[ppl] 56/68: Imported Upstream version 1.1~pre8

Andreas Tille tille at debian.org
Sat Nov 12 08:42:00 UTC 2016


This is an automated email from the git hooks/post-receive script.

tille pushed a commit to branch master
in repository ppl.

commit 38241bf302a5dd4bd9a364a8ae55c03b431e624d
Author: Andreas Tille <tille at debian.org>
Date:   Sat Nov 12 01:16:13 2016 -0600

    Imported Upstream version 1.1~pre8
---
 ChangeLog                                          |      4 -
 Makefile.am                                        |      6 +-
 Makefile.in                                        |    184 +-
 NEWS                                               |     43 +-
 README                                             |    662 +-
 README.alpha                                       |      4 +-
 README.arm                                         |      4 +-
 README.configure                                   |      6 +-
 README.solaris                                     |      4 +-
 STANDARDS                                          |     34 +-
 aclocal.m4                                         |    370 +-
 compile                                            |      7 +-
 config.guess                                       |     13 +-
 config.sub                                         |     33 +-
 configure                                          |    334 +-
 configure.ac                                       |     74 +-
 demos/Makefile.am                                  |      2 +-
 demos/Makefile.in                                  |    147 +-
 demos/ppl_lcdd/Makefile.am                         |      8 +-
 demos/ppl_lcdd/Makefile.in                         |    197 +-
 demos/ppl_lcdd/examples/Makefile.am                |      2 +-
 demos/ppl_lcdd/examples/Makefile.in                |     43 +-
 demos/ppl_lcdd/ppl_lcdd.1                          |      2 +-
 demos/ppl_lcdd/ppl_lcdd.cc                         |    502 +-
 demos/ppl_lpsol/Makefile.am                        |      2 +-
 demos/ppl_lpsol/Makefile.in                        |    203 +-
 demos/ppl_lpsol/dummy.cc                           |      2 +-
 demos/ppl_lpsol/examples/Makefile.am               |      2 +-
 demos/ppl_lpsol/examples/Makefile.in               |     43 +-
 demos/ppl_lpsol/ppl_lpsol.1                        |      2 +-
 demos/ppl_lpsol/ppl_lpsol.c                        |    158 +-
 demos/ppl_pips/Makefile.am                         |      5 +-
 demos/ppl_pips/Makefile.in                         |    194 +-
 demos/ppl_pips/examples/Makefile.am                |      2 +-
 demos/ppl_pips/examples/Makefile.in                |     43 +-
 demos/ppl_pips/ppl_pips.1                          |      2 +-
 demos/ppl_pips/ppl_pips.cc                         |     68 +-
 depcomp                                            |     86 +-
 doc/Makefile.am                                    |    256 +-
 doc/Makefile.in                                    |    335 +-
 doc/README.doc                                     |      4 +-
 doc/definitions.dox                                |     18 +-
 doc/devref-language-interface.tex                  |      4 +-
 doc/devref.doxyconf-html.in                        |      8 +-
 doc/devref.doxyconf-latex.in                       |      8 +-
 doc/devref.tex                                     |      4 +-
 doc/fdl.pdf                                        |    Bin 81942 -> 81942 bytes
 doc/fdl.ps.gz                                      |    Bin 94026 -> 94026 bytes
 doc/fdl.txt                                        |      4 +-
 doc/gpl.pdf                                        |    Bin 75174 -> 75174 bytes
 doc/gpl.ps.gz                                      |    Bin 88038 -> 88038 bytes
 doc/libppl.3                                       |      2 +-
 doc/libppl_c.3                                     |      2 +-
 doc/ppl-config.1                                   |      2 +-
 doc/ppl-user-1.0-html.tar.gz                       |    Bin 1863639 -> 0 bytes
 doc/ppl-user-1.0.pdf                               | 147794 ------------------
 doc/ppl-user-1.0.ps.gz                             |    Bin 2866093 -> 0 bytes
 doc/ppl-user-1.1pre8-html.tar.gz                   |    Bin 0 -> 1818929 bytes
 doc/ppl-user-1.1pre8.pdf                           | 133937 ++++++++++++++++
 doc/ppl-user-1.1pre8.ps.gz                         |    Bin 0 -> 2634101 bytes
 doc/ppl-user-c-interface-1.0-html.tar.gz           |    Bin 299693 -> 0 bytes
 doc/ppl-user-c-interface-1.0.pdf                   |  26568 ----
 doc/ppl-user-c-interface-1.0.ps.gz                 |    Bin 568395 -> 0 bytes
 doc/ppl-user-c-interface-1.1pre8-html.tar.gz       |    Bin 0 -> 310094 bytes
 doc/ppl-user-c-interface-1.1pre8.pdf               |  26574 ++++
 doc/ppl-user-c-interface-1.1pre8.ps.gz             |    Bin 0 -> 568710 bytes
 doc/ppl-user-java-interface-1.0-html.tar.gz        |    Bin 413788 -> 0 bytes
 doc/ppl-user-java-interface-1.0.pdf                |  26019 ---
 doc/ppl-user-java-interface-1.0.ps.gz              |    Bin 619712 -> 0 bytes
 doc/ppl-user-java-interface-1.1pre8-html.tar.gz    |    Bin 0 -> 425396 bytes
 doc/ppl-user-java-interface-1.1pre8.pdf            |  26401 ++++
 doc/ppl-user-java-interface-1.1pre8.ps.gz          |    Bin 0 -> 627231 bytes
 doc/ppl-user-ocaml-interface-1.0-html.tar.gz       |    Bin 130581 -> 0 bytes
 doc/ppl-user-ocaml-interface-1.0.pdf               |    Bin 353271 -> 0 bytes
 doc/ppl-user-ocaml-interface-1.0.ps.gz             |    Bin 309787 -> 0 bytes
 doc/ppl-user-ocaml-interface-1.1pre8-html.tar.gz   |    Bin 0 -> 135016 bytes
 doc/ppl-user-ocaml-interface-1.1pre8.pdf           |    Bin 0 -> 354237 bytes
 doc/ppl-user-ocaml-interface-1.1pre8.ps.gz         |    Bin 0 -> 310130 bytes
 doc/ppl-user-prolog-interface-1.0-html.tar.gz      |    Bin 133960 -> 0 bytes
 doc/ppl-user-prolog-interface-1.0.pdf              |    Bin 359608 -> 0 bytes
 doc/ppl-user-prolog-interface-1.0.ps.gz            |    Bin 344147 -> 0 bytes
 doc/ppl-user-prolog-interface-1.1pre8-html.tar.gz  |    Bin 0 -> 137916 bytes
 doc/ppl-user-prolog-interface-1.1pre8.pdf          |    Bin 0 -> 360518 bytes
 doc/ppl-user-prolog-interface-1.1pre8.ps.gz        |    Bin 0 -> 344441 bytes
 doc/ppl.bib                                        |      8 +-
 doc/ppl.sty                                        |      2 +-
 doc/ppl_citations.bib                              |     27 +-
 doc/user-language-interface.tex                    |      4 +-
 doc/user.tex                                       |      4 +-
 instchk.hh                                         |      2 +-
 interfaces/C/C_interface.dox                       |      6 +-
 interfaces/C/Makefile.am                           |      8 +-
 interfaces/C/Makefile.in                           |    201 +-
 interfaces/C/ppl_c.h.dist                          |    208 +-
 interfaces/C/ppl_c_header.h                        |    202 +-
 interfaces/C/ppl_c_implementation_common.cc        |    248 +-
 interfaces/C/ppl_c_implementation_common.defs.hh   |    259 -
 .../C/ppl_c_implementation_common.inlines.hh       |    214 -
 interfaces/C/ppl_c_implementation_common_defs.hh   |    259 +
 .../C/ppl_c_implementation_common_inlines.hh       |    214 +
 interfaces/C/ppl_c_version.h.in                    |      2 +-
 interfaces/C/ppl_interface_generator_c_cc_code.m4  |     26 +-
 interfaces/C/ppl_interface_generator_c_cc_files.m4 |      4 +-
 interfaces/C/ppl_interface_generator_c_h.m4        |      2 +-
 interfaces/C/ppl_interface_generator_c_h_code.m4   |      2 +-
 interfaces/C/ppl_interface_generator_c_hh_files.m4 |      2 +-
 ...l_interface_generator_c_procedure_generators.m4 |      2 +-
 interfaces/C/tests/Makefile.am                     |      2 +-
 interfaces/C/tests/Makefile.in                     |     92 +-
 interfaces/C/tests/formatted_output.c              |      2 +-
 interfaces/C/tests/pip_test.c                      |      4 +-
 interfaces/C/tests/ppl_c_test.cc                   |      2 +-
 interfaces/C/tests/ppl_c_test.h                    |      2 +-
 interfaces/C/tests/print_to_buffer.c               |     28 +-
 interfaces/C/tests/print_to_buffer.h               |     12 +-
 interfaces/C/tests/watchdog1.c                     |      4 +-
 interfaces/C/tests/weightwatch1.c                  |      4 +-
 interfaces/Java/Makefile.am                        |      2 +-
 interfaces/Java/Makefile.in                        |    153 +-
 interfaces/Java/README.java                        |      2 +-
 interfaces/Java/jni/Makefile.am                    |      6 +-
 interfaces/Java/jni/Makefile.in                    |    125 +-
 ...ppl_interface_generator_java_classes_cc_code.m4 |      6 +-
 ...pl_interface_generator_java_classes_cc_files.m4 |      6 +-
 interfaces/Java/jni/ppl_java_common.cc             |     92 +-
 interfaces/Java/jni/ppl_java_common.defs.hh        |    883 -
 interfaces/Java/jni/ppl_java_common.inlines.hh     |    245 -
 interfaces/Java/jni/ppl_java_common_defs.hh        |    899 +
 interfaces/Java/jni/ppl_java_common_inlines.hh     |    245 +
 interfaces/Java/jni/ppl_java_globals.cc            |     58 +-
 .../Artificial_Parameter.java                      |     13 +-
 .../Artificial_Parameter_Sequence.java             |      7 +-
 .../Bounded_Integer_Type_Overflow.java             |      2 +-
 .../Bounded_Integer_Type_Representation.java       |      2 +-
 .../Bounded_Integer_Type_Width.java                |      2 +-
 .../Java/parma_polyhedra_library/By_Reference.java |      8 +-
 .../Java/parma_polyhedra_library/Coefficient.java  |     14 +-
 .../parma_polyhedra_library/Complexity_Class.java  |      2 +-
 .../Java/parma_polyhedra_library/Congruence.java   |     19 +-
 .../parma_polyhedra_library/Congruence_System.java |      7 +-
 .../Java/parma_polyhedra_library/Constraint.java   |     17 +-
 .../parma_polyhedra_library/Constraint_System.java |      7 +-
 .../Control_Parameter_Name.java                    |      2 +-
 .../Control_Parameter_Value.java                   |      2 +-
 .../Degenerate_Element.java                        |      2 +-
 .../Domain_Error_Exception.java                    |      2 +-
 .../Fake_Class_for_Doxygen.java                    |     50 +-
 .../Java/parma_polyhedra_library/Generator.java    |     26 +-
 .../parma_polyhedra_library/Generator_System.java  |      7 +-
 .../parma_polyhedra_library/Generator_Type.java    |      2 +-
 .../parma_polyhedra_library/Grid_Generator.java    |     34 +-
 .../Grid_Generator_System.java                     |      8 +-
 .../Grid_Generator_Type.java                       |      2 +-
 interfaces/Java/parma_polyhedra_library/IO.java    |      4 +-
 .../Invalid_Argument_Exception.java                |      2 +-
 .../Length_Error_Exception.java                    |      2 +-
 .../parma_polyhedra_library/Linear_Expression.java |     13 +-
 .../Linear_Expression_Coefficient.java             |      8 +-
 .../Linear_Expression_Difference.java              |     10 +-
 .../Linear_Expression_Sum.java                     |      8 +-
 .../Linear_Expression_Times.java                   |     20 +-
 .../Linear_Expression_Unary_Minus.java             |      6 +-
 .../Linear_Expression_Variable.java                |      8 +-
 .../Logic_Error_Exception.java                     |      2 +-
 .../Java/parma_polyhedra_library/MIP_Problem.java  |     21 +-
 .../MIP_Problem_Status.java                        |      2 +-
 .../Java/parma_polyhedra_library/Makefile.am       |      3 +-
 .../Java/parma_polyhedra_library/Makefile.in       |     45 +-
 .../parma_polyhedra_library/Optimization_Mode.java |      2 +-
 .../Overflow_Error_Exception.java                  |      2 +-
 .../parma_polyhedra_library/PIP_Decision_Node.java |      5 +-
 .../Java/parma_polyhedra_library/PIP_Problem.java  |     13 +-
 .../PIP_Problem_Control_Parameter_Name.java        |      2 +-
 .../PIP_Problem_Control_Parameter_Value.java       |      2 +-
 .../PIP_Problem_Status.java                        |      2 +-
 .../parma_polyhedra_library/PIP_Solution_Node.java |      5 +-
 .../parma_polyhedra_library/PIP_Tree_Node.java     |      5 +-
 .../Java/parma_polyhedra_library/PPL_Object.java   |      4 +-
 interfaces/Java/parma_polyhedra_library/Pair.java  |      6 +-
 .../Parma_Polyhedra_Library.java                   |     20 +-
 .../parma_polyhedra_library/Partial_Function.java  |      4 +-
 .../parma_polyhedra_library/Poly_Con_Relation.java |     16 +-
 .../parma_polyhedra_library/Poly_Gen_Relation.java |     10 +-
 .../parma_polyhedra_library/Relation_Symbol.java   |      6 +-
 .../parma_polyhedra_library/Timeout_Exception.java |      2 +-
 .../Java/parma_polyhedra_library/Variable.java     |     56 +-
 .../Variable_Stringifier.java                      |     33 +
 .../parma_polyhedra_library/Variables_Set.java     |      2 +-
 .../ppl_interface_generator_java_classes_java.m4   |      5 +-
 ...l_interface_generator_java_classes_java_code.m4 |      8 +-
 ...nterface_generator_java_procedure_generators.m4 |      2 +-
 interfaces/Java/tests/C_Polyhedron_test1.java      |    144 +-
 .../Java/tests/Custom_Variable_Stringifier.java    |     29 +
 interfaces/Java/tests/MIP_Problem_test1.java       |    116 +-
 interfaces/Java/tests/Makefile.am                  |      9 +-
 interfaces/Java/tests/Makefile.in                  |     51 +-
 interfaces/Java/tests/NNC_Polyhedron_test1.java    |    136 +-
 interfaces/Java/tests/PIP_Problem_test1.java       |    226 +-
 interfaces/Java/tests/PPL_Test.java                |      4 +-
 .../Java/tests/Parma_Polyhedra_Library_test1.java  |     34 +-
 .../Java/tests/Parma_Polyhedra_Library_test2.java  |     30 +-
 interfaces/Java/tests/Test_Executor.java           |     40 +-
 interfaces/Java/tests/Variable_Output_test1.java   |     94 +
 .../ppl_interface_generator_java_test_java.m4      |      2 +-
 .../ppl_interface_generator_java_test_java_code.m4 |      2 +-
 interfaces/Java/tests/ppl_java_tests_common        |    155 +-
 interfaces/Makefile.am                             |      2 +-
 interfaces/Makefile.in                             |    145 +-
 interfaces/OCaml/Makefile.am                       |     27 +-
 interfaces/OCaml/Makefile.in                       |    210 +-
 interfaces/OCaml/OCaml_interface.dox               |      2 +-
 interfaces/OCaml/README.ocaml                      |      2 +-
 .../OCaml/ppl_interface_generator_ocaml_cc_code.m4 |     60 +-
 .../ppl_interface_generator_ocaml_cc_files.m4      |      2 +-
 .../OCaml/ppl_interface_generator_ocaml_hh_code.m4 |      2 +-
 .../ppl_interface_generator_ocaml_hh_files.m4      |      4 +-
 .../OCaml/ppl_interface_generator_ocaml_ml.m4      |      2 +-
 .../OCaml/ppl_interface_generator_ocaml_ml_code.m4 |      2 +-
 .../OCaml/ppl_interface_generator_ocaml_mli.m4     |      2 +-
 .../ppl_interface_generator_ocaml_mli_code.m4      |      2 +-
 ...terface_generator_ocaml_procedure_generators.m4 |      2 +-
 interfaces/OCaml/ppl_ocaml_common.cc               |     94 +-
 interfaces/OCaml/ppl_ocaml_common.defs.hh          |    234 -
 interfaces/OCaml/ppl_ocaml_common.inlines.hh       |     82 -
 interfaces/OCaml/ppl_ocaml_common_defs.hh          |    234 +
 interfaces/OCaml/ppl_ocaml_common_inlines.hh       |     82 +
 interfaces/OCaml/ppl_ocaml_globals.ml              |      2 +-
 interfaces/OCaml/ppl_ocaml_globals.mli             |      2 +-
 interfaces/OCaml/tests/Makefile.am                 |     10 +-
 interfaces/OCaml/tests/Makefile.in                 |     77 +-
 .../tests/ppl_interface_generator_ocaml_test_ml.m4 |      2 +-
 .../ppl_interface_generator_ocaml_test_ml_code.m4  |      2 +-
 interfaces/OCaml/tests/ppl_ocaml_tests_common      |      2 +-
 interfaces/OCaml/tests/test1.ml                    |      2 +-
 interfaces/Prolog/Ciao/Makefile.am                 |      2 +-
 interfaces/Prolog/Ciao/Makefile.in                 |    105 +-
 interfaces/Prolog/Ciao/README.ciao                 |      2 +-
 interfaces/Prolog/Ciao/ciao_cfli.hh                |     16 +-
 interfaces/Prolog/Ciao/ciao_clpq.pl                |     33 +-
 interfaces/Prolog/Ciao/ciao_clpq2.pl               |     26 +-
 interfaces/Prolog/Ciao/ciao_efli.cc                |      4 +-
 interfaces/Prolog/Ciao/ciao_efli.hh                |      2 +-
 interfaces/Prolog/Ciao/ciao_pl_check.pl            |    172 +-
 .../Prolog/Ciao/ppl_interface_generator_ciao_pl.m4 |      2 +-
 ...face_generator_ciao_prolog_generated_test_pl.m4 |      2 +-
 interfaces/Prolog/Ciao/ppl_prolog_sysdep.hh        |      2 +-
 interfaces/Prolog/GNU/Makefile.am                  |      2 +-
 interfaces/Prolog/GNU/Makefile.in                  |    132 +-
 interfaces/Prolog/GNU/README.gprolog               |      2 +-
 interfaces/Prolog/GNU/gnu_pl_check.pl              |      6 +-
 interfaces/Prolog/GNU/gnu_prolog_generated_test.pl |      6 +-
 interfaces/Prolog/GNU/gp_clpq.pl                   |      2 +-
 interfaces/Prolog/GNU/gprolog_cfli.hh              |     16 +-
 interfaces/Prolog/GNU/gprolog_efli.cc              |      4 +-
 interfaces/Prolog/GNU/gprolog_efli.hh              |      2 +-
 .../GNU/ppl_interface_generator_gprolog_pl.m4      |      2 +-
 interfaces/Prolog/GNU/ppl_prolog_sysdep.hh         |      2 +-
 interfaces/Prolog/Makefile.am                      |      6 +-
 interfaces/Prolog/Makefile.in                      |    150 +-
 interfaces/Prolog/Prolog_configured_interface.dox  |      2 +-
 interfaces/Prolog/Prolog_interface.dox             |      2 +-
 interfaces/Prolog/Prolog_interface_compilation.dox |      2 +-
 interfaces/Prolog/Prolog_interface_sysdep.dox      |      2 +-
 interfaces/Prolog/Prolog_interface_sysindep.dox    |    120 +-
 .../Prolog/Prolog_interface_sysindep_domains.dox   |      2 +-
 interfaces/Prolog/SICStus/Makefile.am              |      4 +-
 interfaces/Prolog/SICStus/Makefile.in              |    131 +-
 .../ppl_interface_generator_sicstus_sd_cc.m4       |      2 +-
 interfaces/Prolog/SICStus/ppl_prolog_sysdep.hh     |      2 +-
 interfaces/Prolog/SICStus/ppl_sicstus.pl           |      6 +-
 interfaces/Prolog/SICStus/sicstus_cfli.cc          |      2 +-
 interfaces/Prolog/SICStus/sicstus_cfli.h           |     18 +-
 interfaces/Prolog/SICStus/sicstus_cfli.ic          |     16 +-
 interfaces/Prolog/SICStus/sicstus_efli.cc          |      2 +-
 interfaces/Prolog/SICStus/sicstus_efli.hh          |      2 +-
 interfaces/Prolog/SICStus/sp_clpq.pl               |     30 +-
 interfaces/Prolog/SICStus/sp_pl_check.pl           |     40 +-
 .../Prolog/SICStus/sp_prolog_generated_test.pl     |     38 +-
 interfaces/Prolog/SWI/Makefile.am                  |      2 +-
 interfaces/Prolog/SWI/Makefile.in                  |    134 +-
 interfaces/Prolog/SWI/README.swiprolog             |      2 +-
 interfaces/Prolog/SWI/pl_clpq.cc                   |      2 +-
 interfaces/Prolog/SWI/pl_clpq.pl                   |      2 +-
 .../SWI/ppl_interface_generator_swiprolog_cc.m4    |      2 +-
 interfaces/Prolog/SWI/ppl_pl.cc                    |      2 +-
 interfaces/Prolog/SWI/ppl_prolog_sysdep.hh         |      2 +-
 interfaces/Prolog/SWI/ppl_swiprolog.pl             |      2 +-
 interfaces/Prolog/SWI/swi_cfli.hh                  |     16 +-
 interfaces/Prolog/SWI/swi_efli.cc                  |      2 +-
 interfaces/Prolog/SWI/swi_efli.hh                  |      2 +-
 interfaces/Prolog/SWI/swi_pl_check.pl              |      6 +-
 interfaces/Prolog/SWI/swi_prolog_generated_test.pl |      6 +-
 interfaces/Prolog/XSB/Makefile.am                  |      2 +-
 interfaces/Prolog/XSB/Makefile.in                  |    102 +-
 .../Prolog/XSB/ppl_interface_generator_xsb_H.m4    |      2 +-
 .../Prolog/XSB/ppl_interface_generator_xsb_cc.m4   |      2 +-
 .../Prolog/XSB/ppl_interface_generator_xsb_hh.m4   |      2 +-
 ...erface_generator_xsb_prolog_generated_test_P.m4 |      2 +-
 interfaces/Prolog/XSB/ppl_prolog_sysdep.hh         |      2 +-
 interfaces/Prolog/XSB/xsb_cfli.hh                  |     16 +-
 interfaces/Prolog/XSB/xsb_clpq.P                   |     24 +-
 interfaces/Prolog/XSB/xsb_clpq2.P                  |     26 +-
 interfaces/Prolog/XSB/xsb_efli.cc                  |      4 +-
 interfaces/Prolog/XSB/xsb_efli.hh                  |      2 +-
 interfaces/Prolog/XSB/xsb_pl_check.P               |    184 +-
 interfaces/Prolog/YAP/Makefile.am                  |      2 +-
 interfaces/Prolog/YAP/Makefile.in                  |    105 +-
 interfaces/Prolog/YAP/README.yap                   |      2 +-
 .../Prolog/YAP/ppl_interface_generator_yap_cc.m4   |      2 +-
 interfaces/Prolog/YAP/ppl_prolog_sysdep.hh         |      2 +-
 interfaces/Prolog/YAP/ppl_yap.pl                   |      2 +-
 interfaces/Prolog/YAP/yap_cfli.hh                  |     18 +-
 interfaces/Prolog/YAP/yap_clpq.pl                  |      2 +-
 interfaces/Prolog/YAP/yap_clpq2.pl                 |      2 +-
 interfaces/Prolog/YAP/yap_efli.cc                  |      2 +-
 interfaces/Prolog/YAP/yap_efli.hh                  |      2 +-
 interfaces/Prolog/YAP/yap_pl_check.pl              |      6 +-
 interfaces/Prolog/YAP/yap_prolog_generated_test.pl |      6 +-
 .../ppl_interface_generator_prolog_cc_code.m4      |     49 +-
 .../ppl_interface_generator_prolog_cc_files.m4     |      4 +-
 .../Prolog/ppl_interface_generator_prolog_dox.m4   |      2 +-
 .../ppl_interface_generator_prolog_dox_code.m4     |      2 +-
 .../ppl_interface_generator_prolog_hh_code.m4      |      2 +-
 .../ppl_interface_generator_prolog_hh_files.m4     |      4 +-
 ...erface_generator_prolog_procedure_generators.m4 |      2 +-
 .../ppl_interface_generator_prolog_systems.m4      |      2 +-
 interfaces/Prolog/ppl_prolog_common.cc             |    678 +-
 interfaces/Prolog/ppl_prolog_common.defs.hh        |   1084 -
 interfaces/Prolog/ppl_prolog_common.inlines.hh     |     88 -
 interfaces/Prolog/ppl_prolog_common_defs.hh        |   1084 +
 interfaces/Prolog/ppl_prolog_common_inlines.hh     |     88 +
 interfaces/Prolog/tests/Makefile.am                |      2 +-
 interfaces/Prolog/tests/Makefile.in                |     44 +-
 interfaces/Prolog/tests/clpq.pl                    |     28 +-
 interfaces/Prolog/tests/clpq2.pl                   |      8 +-
 interfaces/Prolog/tests/expected_clpq2_int16       |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int16_a     |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int32       |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int32_a     |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int64       |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int64_a     |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int8        |      2 +-
 interfaces/Prolog/tests/expected_clpq2_int8_a      |      2 +-
 interfaces/Prolog/tests/expected_clpq2_mpz         |      2 +-
 interfaces/Prolog/tests/expected_clpq2_mpz_a       |      2 +-
 interfaces/Prolog/tests/expected_clpq_int16        |      2 +-
 interfaces/Prolog/tests/expected_clpq_int16_a      |      2 +-
 interfaces/Prolog/tests/expected_clpq_int32        |      2 +-
 interfaces/Prolog/tests/expected_clpq_int32_a      |      2 +-
 interfaces/Prolog/tests/expected_clpq_int64        |      2 +-
 interfaces/Prolog/tests/expected_clpq_int64_a      |      2 +-
 interfaces/Prolog/tests/expected_clpq_int8         |      2 +-
 interfaces/Prolog/tests/expected_clpq_int8_a       |      2 +-
 interfaces/Prolog/tests/expected_clpq_mpz          |      2 +-
 interfaces/Prolog/tests/expected_clpq_mpz_a        |      2 +-
 interfaces/Prolog/tests/pl_check.pl                |     24 +-
 ...interface_generator_prolog_generated_test_pl.m4 |      2 +-
 ...face_generator_prolog_generated_test_pl_code.m4 |      2 +-
 .../tests/ppl_prolog_generated_test_common.pl      |      2 +-
 interfaces/Prolog/tests/smm.clpq                   |     24 +-
 interfaces/interfaced_boxes.hh                     |      2 +-
 interfaces/marked_pointers.hh                      |      2 +-
 interfaces/ppl_interface_generator_common.m4       |      2 +-
 interfaces/ppl_interface_generator_common_dat.m4   |      2 +-
 ...erface_generator_common_procedure_generators.m4 |      2 +-
 interfaces/ppl_interface_generator_copyright       |      2 +-
 m4/Makefile.am                                     |      2 +-
 m4/Makefile.in                                     |     49 +-
 m4/ac_check_ciao.m4                                |      2 +-
 m4/ac_check_fpu_control.m4                         |      2 +-
 m4/ac_check_gmp.m4                                 |      2 +-
 m4/ac_check_sicstus_prolog.m4                      |      2 +-
 m4/ac_check_swi_prolog.m4                          |      2 +-
 m4/ac_check_xsb_prolog.m4                          |      2 +-
 m4/ac_check_yap.m4                                 |      2 +-
 m4/ac_cxx_attribute_weak.m4                        |      2 +-
 m4/ac_cxx_double_binary_format.m4                  |      2 +-
 m4/ac_cxx_float_binary_format.m4                   |      2 +-
 m4/ac_cxx_ieee_inexact_flag.m4                     |      2 +-
 m4/ac_cxx_limit_memory.m4                          |      2 +-
 m4/ac_cxx_long_double_binary_format.m4             |     27 +-
 m4/ac_cxx_plain_char_is_signed.m4                  |      2 +-
 m4/ac_cxx_proper_long_double.m4                    |      2 +-
 m4/ac_cxx_zero_length_arrays.m4                    |      2 +-
 m4/ac_prog_jar.m4                                  |      2 +-
 m4/ac_prog_java.m4                                 |      2 +-
 m4/ac_prog_javac.m4                                |      4 +-
 m4/ac_prog_javah.m4                                |      2 +-
 m4/ac_text_md5sum.m4                               |      2 +-
 m4/ppl.m4                                          |      2 +-
 m4/ppl_c.m4                                        |      2 +-
 ppl-config.h.in                                    |    411 -
 src/BDS_Status.idefs.hh                            |    117 -
 src/BDS_Status.inlines.hh                          |    268 -
 src/BDS_Status_idefs.hh                            |    117 +
 src/BDS_Status_inlines.hh                          |    268 +
 src/BD_Shape.cc                                    |      6 +-
 src/BD_Shape.defs.hh                               |   2367 -
 src/BD_Shape.inlines.hh                            |    910 -
 src/BD_Shape.templates.hh                          |   6781 -
 src/BD_Shape.types.hh                              |     25 -
 src/BD_Shape_defs.hh                               |   2371 +
 src/BD_Shape_inlines.hh                            |    910 +
 src/BD_Shape_templates.hh                          |   6789 +
 src/BD_Shape_types.hh                              |     25 +
 src/BHRZ03_Certificate.cc                          |     66 +-
 src/BHRZ03_Certificate.defs.hh                     |    118 -
 src/BHRZ03_Certificate.inlines.hh                  |     63 -
 src/BHRZ03_Certificate.types.hh                    |     22 -
 src/BHRZ03_Certificate_defs.hh                     |    118 +
 src/BHRZ03_Certificate_inlines.hh                  |     63 +
 src/BHRZ03_Certificate_types.hh                    |     22 +
 src/Bit_Matrix.cc                                  |     28 +-
 src/Bit_Matrix.defs.hh                             |    187 -
 src/Bit_Matrix.inlines.hh                          |    149 -
 src/Bit_Matrix.types.hh                            |     22 -
 src/Bit_Matrix_defs.hh                             |    187 +
 src/Bit_Matrix_inlines.hh                          |    149 +
 src/Bit_Matrix_types.hh                            |     22 +
 src/Bit_Row.cc                                     |     26 +-
 src/Bit_Row.defs.hh                                |    214 -
 src/Bit_Row.inlines.hh                             |    236 -
 src/Bit_Row.types.hh                               |     22 -
 src/Bit_Row_defs.hh                                |    214 +
 src/Bit_Row_inlines.hh                             |    236 +
 src/Bit_Row_types.hh                               |     22 +
 src/Boundary.defs.hh                               |    738 -
 src/Boundary_defs.hh                               |    729 +
 src/Box.cc                                         |      4 +-
 src/Box.defs.hh                                    |   2286 -
 src/Box.inlines.hh                                 |    692 -
 src/Box.templates.hh                               |   4285 -
 src/Box.types.hh                                   |     25 -
 src/Box_Status.idefs.hh                            |    115 -
 src/Box_Status.inlines.hh                          |    228 -
 src/Box_Status_idefs.hh                            |    115 +
 src/Box_Status_inlines.hh                          |    228 +
 src/Box_defs.hh                                    |   2286 +
 src/Box_inlines.hh                                 |    692 +
 src/Box_templates.hh                               |   4295 +
 src/Box_types.hh                                   |     25 +
 src/CO_Tree.cc                                     |    180 +-
 src/CO_Tree.defs.hh                                |   1548 -
 src/CO_Tree.inlines.hh                             |    864 -
 src/CO_Tree.templates.hh                           |    139 -
 src/CO_Tree.types.hh                               |     22 -
 src/CO_Tree_defs.hh                                |   1559 +
 src/CO_Tree_inlines.hh                             |    868 +
 src/CO_Tree_templates.hh                           |    141 +
 src/CO_Tree_types.hh                               |     22 +
 src/C_Integer.hh                                   |     64 +-
 src/C_Polyhedron.cc                                |     23 +-
 src/C_Polyhedron.defs.hh                           |    280 -
 src/C_Polyhedron.inlines.hh                        |    154 -
 src/C_Polyhedron.types.hh                          |     22 -
 src/C_Polyhedron_defs.hh                           |    280 +
 src/C_Polyhedron_inlines.hh                        |    154 +
 src/C_Polyhedron_types.hh                          |     22 +
 src/Cast_Floating_Point_Expression.defs.hh         |    182 -
 src/Cast_Floating_Point_Expression.inlines.hh      |     64 -
 src/Cast_Floating_Point_Expression.templates.hh    |     46 -
 src/Cast_Floating_Point_Expression.types.hh        |     23 -
 src/Cast_Floating_Point_Expression_defs.hh         |    182 +
 src/Cast_Floating_Point_Expression_inlines.hh      |     64 +
 src/Cast_Floating_Point_Expression_templates.hh    |     46 +
 src/Cast_Floating_Point_Expression_types.hh        |     23 +
 src/Checked_Number.cc                              |     12 +-
 src/Checked_Number.defs.hh                         |   1068 -
 src/Checked_Number.inlines.hh                      |    848 -
 src/Checked_Number.templates.hh                    |    149 -
 src/Checked_Number.types.hh                        |     27 -
 src/Checked_Number_defs.hh                         |   1068 +
 src/Checked_Number_inlines.hh                      |    848 +
 src/Checked_Number_templates.hh                    |    149 +
 src/Checked_Number_types.hh                        |     27 +
 src/Coefficient.cc                                 |      4 +-
 src/Coefficient.defs.hh                            |     61 -
 src/Coefficient.inlines.hh                         |     72 -
 src/Coefficient.types.hh                           |    182 -
 src/Coefficient_defs.hh                            |     61 +
 src/Coefficient_inlines.hh                         |     72 +
 src/Coefficient_traits_template.hh                 |      2 +-
 src/Coefficient_types.hh                           |    182 +
 src/Concrete_Expression.cc                         |      4 +-
 src/Concrete_Expression.defs.hh                    |    201 -
 src/Concrete_Expression.inlines.hh                 |    123 -
 src/Concrete_Expression.types.hh                   |     98 -
 src/Concrete_Expression_defs.hh                    |    201 +
 src/Concrete_Expression_inlines.hh                 |    123 +
 src/Concrete_Expression_types.hh                   |     98 +
 src/Congruence.cc                                  |     25 +-
 src/Congruence.defs.hh                             |    504 -
 src/Congruence.inlines.hh                          |    281 -
 src/Congruence.types.hh                            |     22 -
 src/Congruence_System.cc                           |     61 +-
 src/Congruence_System.defs.hh                      |    544 -
 src/Congruence_System.inlines.hh                   |    272 -
 src/Congruence_System.types.hh                     |     22 -
 src/Congruence_System_defs.hh                      |    544 +
 src/Congruence_System_inlines.hh                   |    272 +
 src/Congruence_System_types.hh                     |     22 +
 src/Congruence_defs.hh                             |    506 +
 src/Congruence_inlines.hh                          |    281 +
 src/Congruence_types.hh                            |     22 +
 src/Constant_Floating_Point_Expression.defs.hh     |    173 -
 src/Constant_Floating_Point_Expression.inlines.hh  |     80 -
 src/Constant_Floating_Point_Expression.types.hh    |     23 -
 src/Constant_Floating_Point_Expression_defs.hh     |    173 +
 src/Constant_Floating_Point_Expression_inlines.hh  |     80 +
 src/Constant_Floating_Point_Expression_types.hh    |     23 +
 src/Constraint.cc                                  |     85 +-
 src/Constraint.defs.hh                             |    842 -
 src/Constraint.inlines.hh                          |    588 -
 src/Constraint.types.hh                            |     22 -
 src/Constraint_System.cc                           |    114 +-
 src/Constraint_System.defs.hh                      |    687 -
 src/Constraint_System.inlines.hh                   |    439 -
 src/Constraint_System.types.hh                     |     23 -
 src/Constraint_System_defs.hh                      |    687 +
 src/Constraint_System_inlines.hh                   |    439 +
 src/Constraint_System_types.hh                     |     23 +
 src/Constraint_defs.hh                             |    836 +
 src/Constraint_inlines.hh                          |    577 +
 src/Constraint_types.hh                            |     22 +
 src/DB_Matrix.defs.hh                              |    325 -
 src/DB_Matrix.inlines.hh                           |    330 -
 src/DB_Matrix.templates.hh                         |    319 -
 src/DB_Matrix.types.hh                             |     23 -
 src/DB_Matrix_defs.hh                              |    325 +
 src/DB_Matrix_inlines.hh                           |    330 +
 src/DB_Matrix_templates.hh                         |    319 +
 src/DB_Matrix_types.hh                             |     23 +
 src/DB_Row.defs.hh                                 |    470 -
 src/DB_Row.inlines.hh                              |    428 -
 src/DB_Row.templates.hh                            |    215 -
 src/DB_Row.types.hh                                |     26 -
 src/DB_Row_defs.hh                                 |    470 +
 src/DB_Row_inlines.hh                              |    428 +
 src/DB_Row_templates.hh                            |    215 +
 src/DB_Row_types.hh                                |     26 +
 src/Dense_Row.cc                                   |     44 +-
 src/Dense_Row.defs.hh                              |    561 -
 src/Dense_Row.inlines.hh                           |    531 -
 src/Dense_Row.templates.hh                         |     56 -
 src/Dense_Row.types.hh                             |     22 -
 src/Dense_Row_defs.hh                              |    561 +
 src/Dense_Row_inlines.hh                           |    531 +
 src/Dense_Row_templates.hh                         |     56 +
 src/Dense_Row_types.hh                             |     22 +
 src/Determinate.defs.hh                            |    331 -
 src/Determinate.inlines.hh                         |    305 -
 src/Determinate.types.hh                           |     23 -
 src/Determinate_defs.hh                            |    331 +
 src/Determinate_inlines.hh                         |    305 +
 src/Determinate_types.hh                           |     23 +
 src/Difference_Floating_Point_Expression.defs.hh   |    221 -
 ...Difference_Floating_Point_Expression.inlines.hh |     70 -
 ...fference_Floating_Point_Expression.templates.hh |     53 -
 src/Difference_Floating_Point_Expression.types.hh  |     23 -
 src/Difference_Floating_Point_Expression_defs.hh   |    221 +
 ...Difference_Floating_Point_Expression_inlines.hh |     70 +
 ...fference_Floating_Point_Expression_templates.hh |     53 +
 src/Difference_Floating_Point_Expression_types.hh  |     23 +
 src/Division_Floating_Point_Expression.defs.hh     |    238 -
 src/Division_Floating_Point_Expression.inlines.hh  |     69 -
 ...Division_Floating_Point_Expression.templates.hh |     61 -
 src/Division_Floating_Point_Expression.types.hh    |     23 -
 src/Division_Floating_Point_Expression_defs.hh     |    237 +
 src/Division_Floating_Point_Expression_inlines.hh  |     69 +
 ...Division_Floating_Point_Expression_templates.hh |     61 +
 src/Division_Floating_Point_Expression_types.hh    |     23 +
 src/Doubly_Linked_Object.defs.hh                   |     65 -
 src/Doubly_Linked_Object.inlines.hh                |     78 -
 src/Doubly_Linked_Object.types.hh                  |     30 -
 src/Doubly_Linked_Object_defs.hh                   |     65 +
 src/Doubly_Linked_Object_inlines.hh                |     74 +
 src/Doubly_Linked_Object_types.hh                  |     26 +
 src/EList.defs.hh                                  |     90 -
 src/EList.inlines.hh                               |    123 -
 src/EList.types.hh                                 |     31 -
 src/EList_Iterator.defs.hh                         |     92 -
 src/EList_Iterator.inlines.hh                      |    113 -
 src/EList_Iterator.types.hh                        |     31 -
 src/EList_Iterator_defs.hh                         |     88 +
 src/EList_Iterator_inlines.hh                      |    109 +
 src/EList_Iterator_types.hh                        |     27 +
 src/EList_defs.hh                                  |     90 +
 src/EList_inlines.hh                               |    119 +
 src/EList_types.hh                                 |     27 +
 src/Expression_Adapter_defs.hh                     |    216 +
 src/Expression_Adapter_inlines.hh                  |    229 +
 src/Expression_Adapter_types.hh                    |     28 +
 src/Expression_Hide_Inhomo.defs.hh                 |    176 -
 src/Expression_Hide_Inhomo.inlines.hh              |    314 -
 src/Expression_Hide_Inhomo.types.hh                |     23 -
 src/Expression_Hide_Inhomo_defs.hh                 |    147 +
 src/Expression_Hide_Inhomo_inlines.hh              |    218 +
 src/Expression_Hide_Inhomo_types.hh                |     23 +
 src/Expression_Hide_Last.defs.hh                   |    193 -
 src/Expression_Hide_Last.inlines.hh                |    300 -
 src/Expression_Hide_Last.types.hh                  |     23 -
 src/Expression_Hide_Last_defs.hh                   |    165 +
 src/Expression_Hide_Last_inlines.hh                |    241 +
 src/Expression_Hide_Last_types.hh                  |     23 +
 src/Float.cc                                       |      5 +-
 src/Float.defs.hh                                  |    516 -
 src/Float.inlines.hh                               |    536 -
 src/Float.templates.hh                             |    167 -
 src/Float_defs.hh                                  |    523 +
 src/Float_inlines.hh                               |    536 +
 src/Float_templates.hh                             |    167 +
 src/Floating_Point_Expression.defs.hh              |    213 -
 src/Floating_Point_Expression.inlines.hh           |     55 -
 src/Floating_Point_Expression.templates.hh         |    111 -
 src/Floating_Point_Expression.types.hh             |     23 -
 src/Floating_Point_Expression_defs.hh              |    212 +
 src/Floating_Point_Expression_inlines.hh           |     55 +
 src/Floating_Point_Expression_templates.hh         |    111 +
 src/Floating_Point_Expression_types.hh             |     23 +
 src/GMP_Integer.defs.hh                            |    134 -
 src/GMP_Integer.inlines.hh                         |    122 -
 src/GMP_Integer.types.hh                           |     45 -
 src/GMP_Integer_defs.hh                            |    134 +
 src/GMP_Integer_inlines.hh                         |    122 +
 src/GMP_Integer_types.hh                           |     45 +
 src/Generator.cc                                   |     67 +-
 src/Generator.defs.hh                              |   1036 -
 src/Generator.inlines.hh                           |    728 -
 src/Generator.types.hh                             |     22 -
 src/Generator_System.cc                            |    562 +-
 src/Generator_System.defs.hh                       |    744 -
 src/Generator_System.inlines.hh                    |    411 -
 src/Generator_System.types.hh                      |     23 -
 src/Generator_System_defs.hh                       |    744 +
 src/Generator_System_inlines.hh                    |    411 +
 src/Generator_System_types.hh                      |     23 +
 src/Generator_defs.hh                              |   1033 +
 src/Generator_inlines.hh                           |    709 +
 src/Generator_types.hh                             |     22 +
 src/Grid.defs.hh                                   |   2665 -
 src/Grid.inlines.hh                                |    383 -
 src/Grid.templates.hh                              |    339 -
 src/Grid.types.hh                                  |     22 -
 src/Grid_Certificate.cc                            |     34 +-
 src/Grid_Certificate.defs.hh                       |    104 -
 src/Grid_Certificate.inlines.hh                    |     61 -
 src/Grid_Certificate.types.hh                      |     22 -
 src/Grid_Certificate_defs.hh                       |    104 +
 src/Grid_Certificate_inlines.hh                    |     61 +
 src/Grid_Certificate_types.hh                      |     22 +
 src/Grid_Generator.cc                              |     34 +-
 src/Grid_Generator.defs.hh                         |    798 -
 src/Grid_Generator.inlines.hh                      |    382 -
 src/Grid_Generator.types.hh                        |     22 -
 src/Grid_Generator_System.cc                       |     30 +-
 src/Grid_Generator_System.defs.hh                  |    514 -
 src/Grid_Generator_System.inlines.hh               |    279 -
 src/Grid_Generator_System.types.hh                 |     22 -
 src/Grid_Generator_System_defs.hh                  |    514 +
 src/Grid_Generator_System_inlines.hh               |    279 +
 src/Grid_Generator_System_types.hh                 |     22 +
 src/Grid_Generator_defs.hh                         |    796 +
 src/Grid_Generator_inlines.hh                      |    369 +
 src/Grid_Generator_types.hh                        |     22 +
 src/Grid_Status.cc                                 |     18 +-
 src/Grid_Status.idefs.hh                           |    168 -
 src/Grid_Status.inlines.hh                         |    217 -
 src/Grid_Status_idefs.hh                           |    168 +
 src/Grid_Status_inlines.hh                         |    217 +
 src/Grid_chdims.cc                                 |     38 +-
 src/Grid_conversion.cc                             |    144 +-
 src/Grid_defs.hh                                   |   2665 +
 src/Grid_inlines.hh                                |    383 +
 src/Grid_nonpublic.cc                              |    150 +-
 src/Grid_public.cc                                 |    605 +-
 src/Grid_simplify.cc                               |    146 +-
 src/Grid_templates.hh                              |    339 +
 src/Grid_types.hh                                  |     22 +
 src/Grid_widenings.cc                              |     89 +-
 src/H79_Certificate.cc                             |     10 +-
 src/H79_Certificate.defs.hh                        |     98 -
 src/H79_Certificate.inlines.hh                     |     71 -
 src/H79_Certificate.types.hh                       |     22 -
 src/H79_Certificate_defs.hh                        |     98 +
 src/H79_Certificate_inlines.hh                     |     71 +
 src/H79_Certificate_types.hh                       |     22 +
 src/Handler.defs.hh                                |     95 -
 src/Handler.inlines.hh                             |     66 -
 src/Handler.types.hh                               |     35 -
 src/Handler_defs.hh                                |     96 +
 src/Handler_inlines.hh                             |     66 +
 src/Handler_types.hh                               |     35 +
 src/Has_Assign_Or_Swap.hh                          |      6 +-
 src/Init.cc                                        |     36 +-
 src/Init.defs.hh                                   |    100 -
 src/Init.inlines.hh                                |     48 -
 src/Init.types.hh                                  |     22 -
 src/Init_defs.hh                                   |    100 +
 src/Init_inlines.hh                                |     48 +
 src/Init_types.hh                                  |     22 +
 src/Integer_Interval.hh                            |      4 +-
 src/Interval.defs.hh                               |    761 -
 src/Interval.inlines.hh                            |   1151 -
 src/Interval.templates.hh                          |    402 -
 src/Interval.types.hh                              |     23 -
 src/Interval_Info.defs.hh                          |    285 -
 src/Interval_Info.inlines.hh                       |    116 -
 src/Interval_Info.types.hh                         |     26 -
 src/Interval_Info_defs.hh                          |    285 +
 src/Interval_Info_inlines.hh                       |    116 +
 src/Interval_Info_types.hh                         |     26 +
 src/Interval_defs.hh                               |    763 +
 src/Interval_inlines.hh                            |   1160 +
 src/Interval_templates.hh                          |    402 +
 src/Interval_types.hh                              |     23 +
 src/Linear_Expression.cc                           |    105 +-
 src/Linear_Expression.defs.hh                      |   1070 -
 src/Linear_Expression.inlines.hh                   |    880 -
 src/Linear_Expression.types.hh                     |     22 -
 src/Linear_Expression_Impl.cc                      |     11 +-
 src/Linear_Expression_Impl.defs.hh                 |    916 -
 src/Linear_Expression_Impl.inlines.hh              |    282 -
 src/Linear_Expression_Impl.templates.hh            |   1265 -
 src/Linear_Expression_Impl.types.hh                |     23 -
 src/Linear_Expression_Impl_defs.hh                 |    906 +
 src/Linear_Expression_Impl_inlines.hh              |    282 +
 src/Linear_Expression_Impl_templates.hh            |   1316 +
 src/Linear_Expression_Impl_types.hh                |     23 +
 src/Linear_Expression_Interface.cc                 |      4 +-
 src/Linear_Expression_Interface.defs.hh            |    489 -
 src/Linear_Expression_Interface.types.hh           |     22 -
 src/Linear_Expression_Interface_defs.hh            |    489 +
 src/Linear_Expression_Interface_types.hh           |     22 +
 src/Linear_Expression_defs.hh                      |    928 +
 src/Linear_Expression_inlines.hh                   |    822 +
 src/Linear_Expression_types.hh                     |     22 +
 src/Linear_Form.cc                                 |      4 +-
 src/Linear_Form.defs.hh                            |    499 -
 src/Linear_Form.inlines.hh                         |    252 -
 src/Linear_Form.templates.hh                       |    527 -
 src/Linear_Form.types.hh                           |     23 -
 src/Linear_Form_defs.hh                            |    499 +
 src/Linear_Form_inlines.hh                         |    252 +
 src/Linear_Form_templates.hh                       |    527 +
 src/Linear_Form_types.hh                           |     23 +
 src/Linear_System.defs.hh                          |    582 -
 src/Linear_System.inlines.hh                       |    692 -
 src/Linear_System.templates.hh                     |    923 -
 src/Linear_System.types.hh                         |     26 -
 src/Linear_System_defs.hh                          |    582 +
 src/Linear_System_inlines.hh                       |    698 +
 src/Linear_System_templates.hh                     |    930 +
 src/Linear_System_types.hh                         |     26 +
 src/MIP_Problem.cc                                 |    162 +-
 src/MIP_Problem.defs.hh                            |    980 -
 src/MIP_Problem.inlines.hh                         |    322 -
 src/MIP_Problem.templates.hh                       |    181 -
 src/MIP_Problem.types.hh                           |     33 -
 src/MIP_Problem_defs.hh                            |    975 +
 src/MIP_Problem_inlines.hh                         |    321 +
 src/MIP_Problem_templates.hh                       |    181 +
 src/MIP_Problem_types.hh                           |     33 +
 src/Makefile.am                                    |    692 +-
 src/Makefile.in                                    |   1134 +-
 src/Matrix.defs.hh                                 |    437 -
 src/Matrix.inlines.hh                              |    200 -
 src/Matrix.templates.hh                            |    201 -
 src/Matrix.types.hh                                |     23 -
 src/Matrix_defs.hh                                 |    437 +
 src/Matrix_inlines.hh                              |    200 +
 src/Matrix_templates.hh                            |    202 +
 src/Matrix_types.hh                                |     23 +
 ...ultiplication_Floating_Point_Expression.defs.hh |    251 -
 ...iplication_Floating_Point_Expression.inlines.hh |     71 -
 ...lication_Floating_Point_Expression.templates.hh |    109 -
 ...ltiplication_Floating_Point_Expression.types.hh |     23 -
 ...ultiplication_Floating_Point_Expression_defs.hh |    251 +
 ...iplication_Floating_Point_Expression_inlines.hh |     71 +
 ...lication_Floating_Point_Expression_templates.hh |    109 +
 ...ltiplication_Floating_Point_Expression_types.hh |     23 +
 src/NNC_Polyhedron.cc                              |     14 +-
 src/NNC_Polyhedron.defs.hh                         |    256 -
 src/NNC_Polyhedron.inlines.hh                      |    153 -
 src/NNC_Polyhedron.types.hh                        |     22 -
 src/NNC_Polyhedron_defs.hh                         |    256 +
 src/NNC_Polyhedron_inlines.hh                      |    153 +
 src/NNC_Polyhedron_types.hh                        |     22 +
 src/Numeric_Format.defs.hh                         |     38 -
 src/Numeric_Format_defs.hh                         |     38 +
 src/OR_Matrix.defs.hh                              |    610 -
 src/OR_Matrix.inlines.hh                           |    751 -
 src/OR_Matrix.templates.hh                         |    124 -
 src/OR_Matrix.types.hh                             |     23 -
 src/OR_Matrix_defs.hh                              |    610 +
 src/OR_Matrix_inlines.hh                           |    751 +
 src/OR_Matrix_templates.hh                         |    124 +
 src/OR_Matrix_types.hh                             |     23 +
 src/Octagonal_Shape.cc                             |      4 +-
 src/Octagonal_Shape.defs.hh                        |   2324 -
 src/Octagonal_Shape.inlines.hh                     |    892 -
 src/Octagonal_Shape.templates.hh                   |   8113 -
 src/Octagonal_Shape.types.hh                       |     25 -
 src/Octagonal_Shape_defs.hh                        |   2324 +
 src/Octagonal_Shape_inlines.hh                     |    892 +
 src/Octagonal_Shape_templates.hh                   |   8115 +
 src/Octagonal_Shape_types.hh                       |     25 +
 src/Og_Status.idefs.hh                             |    112 -
 src/Og_Status.inlines.hh                           |    225 -
 src/Og_Status_idefs.hh                             |    112 +
 src/Og_Status_inlines.hh                           |    225 +
 src/Opposite_Floating_Point_Expression.defs.hh     |    193 -
 src/Opposite_Floating_Point_Expression.inlines.hh  |     79 -
 src/Opposite_Floating_Point_Expression.types.hh    |     23 -
 src/Opposite_Floating_Point_Expression_defs.hh     |    193 +
 src/Opposite_Floating_Point_Expression_inlines.hh  |     79 +
 src/Opposite_Floating_Point_Expression_types.hh    |     23 +
 src/PIP_Problem.cc                                 |     43 +-
 src/PIP_Problem.defs.hh                            |    834 -
 src/PIP_Problem.inlines.hh                         |     96 -
 src/PIP_Problem.templates.hh                       |     81 -
 src/PIP_Problem.types.hh                           |     31 -
 src/PIP_Problem_defs.hh                            |    834 +
 src/PIP_Problem_inlines.hh                         |     96 +
 src/PIP_Problem_templates.hh                       |     81 +
 src/PIP_Problem_types.hh                           |     31 +
 src/PIP_Tree.cc                                    |     86 +-
 src/PIP_Tree.defs.hh                               |    836 -
 src/PIP_Tree.inlines.hh                            |    140 -
 src/PIP_Tree.types.hh                              |     26 -
 src/PIP_Tree_defs.hh                               |    836 +
 src/PIP_Tree_inlines.hh                            |    140 +
 src/PIP_Tree_types.hh                              |     26 +
 src/Partial_Function.cc                            |      6 +-
 src/Partial_Function.defs.hh                       |     87 -
 src/Partial_Function.inlines.hh                    |     90 -
 src/Partial_Function.types.hh                      |     22 -
 src/Partial_Function_defs.hh                       |     87 +
 src/Partial_Function_inlines.hh                    |     90 +
 src/Partial_Function_types.hh                      |     22 +
 src/Partially_Reduced_Product.defs.hh              |   1689 -
 src/Partially_Reduced_Product.inlines.hh           |    818 -
 src/Partially_Reduced_Product.templates.hh         |    710 -
 src/Partially_Reduced_Product.types.hh             |     38 -
 src/Partially_Reduced_Product_defs.hh              |   1689 +
 src/Partially_Reduced_Product_inlines.hh           |    815 +
 src/Partially_Reduced_Product_templates.hh         |    710 +
 src/Partially_Reduced_Product_types.hh             |     38 +
 src/Pending_Element.defs.hh                        |     77 -
 src/Pending_Element.inlines.hh                     |     85 -
 src/Pending_Element.types.hh                       |     31 -
 src/Pending_Element_defs.hh                        |     77 +
 src/Pending_Element_inlines.hh                     |     85 +
 src/Pending_Element_types.hh                       |     31 +
 src/Pending_List.defs.hh                           |     79 -
 src/Pending_List.inlines.hh                        |     82 -
 src/Pending_List.templates.hh                      |     96 -
 src/Pending_List.types.hh                          |     31 -
 src/Pending_List_defs.hh                           |     79 +
 src/Pending_List_inlines.hh                        |     82 +
 src/Pending_List_templates.hh                      |     96 +
 src/Pending_List_types.hh                          |     31 +
 src/Ph_Status.cc                                   |     18 +-
 src/Ph_Status.idefs.hh                             |    183 -
 src/Ph_Status.inlines.hh                           |    217 -
 src/Ph_Status_idefs.hh                             |    183 +
 src/Ph_Status_inlines.hh                           |    217 +
 src/Pointset_Powerset.cc                           |    114 +-
 src/Pointset_Powerset.defs.hh                      |   1450 -
 src/Pointset_Powerset.inlines.hh                   |    320 -
 src/Pointset_Powerset.templates.hh                 |   1611 -
 src/Pointset_Powerset.types.hh                     |     23 -
 src/Pointset_Powerset_defs.hh                      |   1449 +
 src/Pointset_Powerset_inlines.hh                   |    320 +
 src/Pointset_Powerset_templates.hh                 |   1610 +
 src/Pointset_Powerset_types.hh                     |     23 +
 src/Poly_Con_Relation.cc                           |      4 +-
 src/Poly_Con_Relation.defs.hh                      |    166 -
 src/Poly_Con_Relation.inlines.hh                   |    100 -
 src/Poly_Con_Relation.types.hh                     |     22 -
 src/Poly_Con_Relation_defs.hh                      |    166 +
 src/Poly_Con_Relation_inlines.hh                   |    100 +
 src/Poly_Con_Relation_types.hh                     |     22 +
 src/Poly_Gen_Relation.cc                           |      4 +-
 src/Poly_Gen_Relation.defs.hh                      |    139 -
 src/Poly_Gen_Relation.inlines.hh                   |     85 -
 src/Poly_Gen_Relation.types.hh                     |     22 -
 src/Poly_Gen_Relation_defs.hh                      |    139 +
 src/Poly_Gen_Relation_inlines.hh                   |     85 +
 src/Poly_Gen_Relation_types.hh                     |     22 +
 src/Polyhedron.defs.hh                             |   2843 -
 src/Polyhedron.inlines.hh                          |    461 -
 src/Polyhedron.templates.hh                        |    579 -
 src/Polyhedron.types.hh                            |     22 -
 src/Polyhedron_chdims.cc                           |     26 +-
 src/Polyhedron_chdims.templates.hh                 |     63 -
 src/Polyhedron_chdims_templates.hh                 |     63 +
 src/Polyhedron_conversion.templates.hh             |    919 -
 src/Polyhedron_conversion_templates.hh             |    921 +
 src/Polyhedron_defs.hh                             |   2843 +
 src/Polyhedron_inlines.hh                          |    459 +
 src/Polyhedron_minimize.templates.hh               |    435 -
 src/Polyhedron_minimize_templates.hh               |    437 +
 src/Polyhedron_nonpublic.cc                        |    569 +-
 src/Polyhedron_public.cc                           |    803 +-
 src/Polyhedron_simplify.templates.hh               |    340 -
 src/Polyhedron_simplify_templates.hh               |    340 +
 src/Polyhedron_templates.hh                        |    579 +
 src/Polyhedron_types.hh                            |     22 +
 src/Polyhedron_widenings.cc                        |    238 +-
 src/Powerset.defs.hh                               |    450 -
 src/Powerset.inlines.hh                            |    231 -
 src/Powerset.templates.hh                          |    312 -
 src/Powerset.types.hh                              |     23 -
 src/Powerset_defs.hh                               |    450 +
 src/Powerset_inlines.hh                            |    231 +
 src/Powerset_templates.hh                          |    312 +
 src/Powerset_types.hh                              |     23 +
 src/Ptr_Iterator.defs.hh                           |    172 -
 src/Ptr_Iterator.inlines.hh                        |    189 -
 src/Ptr_Iterator.types.hh                          |     27 -
 src/Ptr_Iterator_defs.hh                           |    172 +
 src/Ptr_Iterator_inlines.hh                        |    189 +
 src/Ptr_Iterator_types.hh                          |     27 +
 src/Rational_Box.hh                                |      4 +-
 src/Rational_Interval.hh                           |      4 +-
 src/Result.defs.hh                                 |    195 -
 src/Result.inlines.hh                              |    102 -
 src/Result_defs.hh                                 |    195 +
 src/Result_inlines.hh                              |    102 +
 src/Rounding_Dir.defs.hh                           |    124 -
 src/Rounding_Dir.inlines.hh                        |    141 -
 src/Rounding_Dir_defs.hh                           |    124 +
 src/Rounding_Dir_inlines.hh                        |    141 +
 src/Scalar_Products.cc                             |     52 +-
 src/Scalar_Products.defs.hh                        |    226 -
 src/Scalar_Products.inlines.hh                     |    163 -
 src/Scalar_Products.types.hh                       |     24 -
 src/Scalar_Products_defs.hh                        |    227 +
 src/Scalar_Products_inlines.hh                     |    163 +
 src/Scalar_Products_types.hh                       |     24 +
 src/Slow_Copy.hh                                   |      2 +-
 src/Sparse_Row.cc                                  |     90 +-
 src/Sparse_Row.defs.hh                             |    930 -
 src/Sparse_Row.inlines.hh                          |    378 -
 src/Sparse_Row.templates.hh                        |    147 -
 src/Sparse_Row.types.hh                            |     22 -
 src/Sparse_Row_defs.hh                             |    930 +
 src/Sparse_Row_inlines.hh                          |    378 +
 src/Sparse_Row_templates.hh                        |    153 +
 src/Sparse_Row_types.hh                            |     22 +
 src/Sum_Floating_Point_Expression.defs.hh          |    213 -
 src/Sum_Floating_Point_Expression.inlines.hh       |     70 -
 src/Sum_Floating_Point_Expression.templates.hh     |     53 -
 src/Sum_Floating_Point_Expression.types.hh         |     23 -
 src/Sum_Floating_Point_Expression_defs.hh          |    213 +
 src/Sum_Floating_Point_Expression_inlines.hh       |     70 +
 src/Sum_Floating_Point_Expression_templates.hh     |     53 +
 src/Sum_Floating_Point_Expression_types.hh         |     23 +
 src/Swapping_Vector.defs.hh                        |     98 -
 src/Swapping_Vector.inlines.hh                     |    234 -
 src/Swapping_Vector.types.hh                       |     23 -
 src/Swapping_Vector_defs.hh                        |     98 +
 src/Swapping_Vector_inlines.hh                     |    234 +
 src/Swapping_Vector_types.hh                       |     23 +
 src/Temp.defs.hh                                   |    143 -
 src/Temp.inlines.hh                                |     97 -
 src/Temp.templates.hh                              |     34 -
 src/Temp_defs.hh                                   |    143 +
 src/Temp_inlines.hh                                |     97 +
 src/Temp_templates.hh                              |     34 +
 src/Threshold_Watcher.cc                           |      4 +-
 src/Threshold_Watcher.defs.hh                      |     96 -
 src/Threshold_Watcher.inlines.hh                   |     66 -
 src/Threshold_Watcher.templates.hh                 |     72 -
 src/Threshold_Watcher.types.hh                     |     23 -
 src/Threshold_Watcher_defs.hh                      |     96 +
 src/Threshold_Watcher_inlines.hh                   |     66 +
 src/Threshold_Watcher_templates.hh                 |     72 +
 src/Threshold_Watcher_types.hh                     |     23 +
 src/Time.cc                                        |      4 +-
 src/Time.defs.hh                                   |    126 -
 src/Time.inlines.hh                                |    155 -
 src/Time.types.hh                                  |     30 -
 src/Time_defs.hh                                   |    126 +
 src/Time_inlines.hh                                |    155 +
 src/Time_types.hh                                  |     30 +
 src/Topology.types.hh                              |     29 -
 src/Topology_types.hh                              |     29 +
 src/Variable.cc                                    |      8 +-
 src/Variable.defs.hh                               |    156 -
 src/Variable.inlines.hh                            |    100 -
 src/Variable.types.hh                              |     22 -
 src/Variable_Floating_Point_Expression.defs.hh     |    187 -
 src/Variable_Floating_Point_Expression.inlines.hh  |     94 -
 src/Variable_Floating_Point_Expression.types.hh    |     23 -
 src/Variable_Floating_Point_Expression_defs.hh     |    187 +
 src/Variable_Floating_Point_Expression_inlines.hh  |     94 +
 src/Variable_Floating_Point_Expression_types.hh    |     23 +
 src/Variable_defs.hh                               |    157 +
 src/Variable_inlines.hh                            |    100 +
 src/Variable_types.hh                              |     22 +
 src/Variables_Set.cc                               |     10 +-
 src/Variables_Set.defs.hh                          |    107 -
 src/Variables_Set.inlines.hh                       |     75 -
 src/Variables_Set.types.hh                         |     22 -
 src/Variables_Set_defs.hh                          |    107 +
 src/Variables_Set_inlines.hh                       |     75 +
 src/Variables_Set_types.hh                         |     22 +
 src/WRD_coefficient_types.defs.hh                  |    153 -
 src/WRD_coefficient_types.inlines.hh               |     43 -
 src/WRD_coefficient_types_defs.hh                  |    153 +
 src/WRD_coefficient_types_inlines.hh               |     43 +
 src/Watchdog.cc                                    |     54 +-
 src/Watchdog.defs.hh                               |    148 -
 src/Watchdog.inlines.hh                            |    101 -
 src/Watchdog.types.hh                              |     22 -
 src/Watchdog_defs.hh                               |    148 +
 src/Watchdog_inlines.hh                            |    101 +
 src/Watchdog_types.hh                              |     22 +
 src/Weight_Profiler.cc                             |     26 +-
 src/Weight_Profiler.defs.hh                        |    154 -
 src/Weight_Profiler_defs.hh                        |    154 +
 src/Widening_Function.defs.hh                      |    127 -
 src/Widening_Function.inlines.hh                   |     75 -
 src/Widening_Function.types.hh                     |     26 -
 src/Widening_Function_defs.hh                      |    127 +
 src/Widening_Function_inlines.hh                   |     75 +
 src/Widening_Function_types.hh                     |     26 +
 src/algorithms.hh                                  |      6 +-
 src/assert.cc                                      |      2 +-
 src/assert.hh                                      |      2 +-
 src/assign_or_swap.hh                              |      2 +-
 src/c_streambuf.cc                                 |     10 +-
 src/c_streambuf.defs.hh                            |    127 -
 src/c_streambuf.inlines.hh                         |     40 -
 src/c_streambuf.types.hh                           |     22 -
 src/c_streambuf_defs.hh                            |    127 +
 src/c_streambuf_inlines.hh                         |     40 +
 src/c_streambuf_types.hh                           |     22 +
 src/checked.cc                                     |     30 +-
 src/checked.defs.hh                                |    716 -
 src/checked.inlines.hh                             |    658 -
 src/checked_defs.hh                                |    716 +
 src/checked_ext.inlines.hh                         |    923 -
 src/checked_ext_inlines.hh                         |    923 +
 src/checked_float.inlines.hh                       |   1236 -
 src/checked_float_inlines.hh                       |   1234 +
 src/checked_inlines.hh                             |    658 +
 src/checked_int.inlines.hh                         |   1957 -
 src/checked_int_inlines.hh                         |   1952 +
 src/checked_mpq.inlines.hh                         |    542 -
 src/checked_mpq_inlines.hh                         |    542 +
 src/checked_mpz.inlines.hh                         |    645 -
 src/checked_mpz_inlines.hh                         |    645 +
 src/checked_numeric_limits.hh                      |     68 +-
 src/compiler.hh                                    |      2 +-
 src/distances.defs.hh                              |     54 -
 src/distances.inlines.hh                           |    113 -
 src/distances.types.hh                             |     29 -
 src/distances_defs.hh                              |     54 +
 src/distances_inlines.hh                           |    113 +
 src/distances_types.hh                             |     29 +
 src/fpu-c99.inlines.hh                             |    100 -
 src/fpu-c99_inlines.hh                             |    100 +
 src/fpu-ia32.cc                                    |      4 +-
 src/fpu-ia32.inlines.hh                            |    203 -
 src/fpu-ia32_inlines.hh                            |    203 +
 src/fpu-none.inlines.hh                            |     75 -
 src/fpu-none_inlines.hh                            |     75 +
 src/fpu-sparc.inlines.hh                           |     77 -
 src/fpu-sparc_inlines.hh                           |     77 +
 src/fpu.defs.hh                                    |    104 -
 src/fpu.types.hh                                   |     27 -
 src/fpu_defs.hh                                    |    104 +
 src/fpu_types.hh                                   |     27 +
 src/globals.cc                                     |      8 +-
 src/globals.defs.hh                                |    550 -
 src/globals.inlines.hh                             |    190 -
 src/globals.types.hh                               |    214 -
 src/globals_defs.hh                                |    564 +
 src/globals_inlines.hh                             |    190 +
 src/globals_types.hh                               |    214 +
 src/initializer.hh                                 |      4 +-
 src/intervals.defs.hh                              |    473 -
 src/intervals_defs.hh                              |    473 +
 src/iterator_to_const.defs.hh                      |    221 -
 src/iterator_to_const.inlines.hh                   |    202 -
 src/iterator_to_const.types.hh                     |     26 -
 src/iterator_to_const_defs.hh                      |    221 +
 src/iterator_to_const_inlines.hh                   |    202 +
 src/iterator_to_const_types.hh                     |     26 +
 src/linearize.hh                                   |     12 +-
 src/math_utilities.defs.hh                         |    110 -
 src/math_utilities.inlines.hh                      |    120 -
 src/math_utilities_defs.hh                         |    110 +
 src/math_utilities_inlines.hh                      |    120 +
 src/max_space_dimension.hh                         |     14 +-
 src/meta_programming.hh                            |     18 +-
 src/mp_std_bits.cc                                 |     14 +-
 src/mp_std_bits.defs.hh                            |    169 -
 src/mp_std_bits.inlines.hh                         |     38 -
 src/mp_std_bits_defs.hh                            |    175 +
 src/mp_std_bits_inlines.hh                         |     38 +
 src/namespaces.hh                                  |      4 +-
 src/ppl-config.cc.in                               |    100 +-
 src/ppl.hh.dist                                    |  12223 +-
 src/ppl_header.hh                                  |      2 +-
 src/stdiobuf.cc                                    |     14 +-
 src/stdiobuf.defs.hh                               |    111 -
 src/stdiobuf.inlines.hh                            |     36 -
 src/stdiobuf.types.hh                              |     22 -
 src/stdiobuf_defs.hh                               |    111 +
 src/stdiobuf_inlines.hh                            |     36 +
 src/stdiobuf_types.hh                              |     22 +
 src/swapping_sort.templates.hh                     |    179 -
 src/swapping_sort_templates.hh                     |    179 +
 src/termination.cc                                 |    146 +-
 src/termination.defs.hh                            |    502 -
 src/termination.templates.hh                       |    552 -
 src/termination.types.hh                           |     22 -
 src/termination_defs.hh                            |    502 +
 src/termination_templates.hh                       |    552 +
 src/termination_types.hh                           |     22 +
 src/version.cc                                     |      4 +-
 src/version.hh.in                                  |      2 +-
 src/wrap_assign.hh                                 |     12 +-
 src/wrap_string.cc                                 |     38 +-
 src/wrap_string.hh                                 |     10 +-
 tests/BD_Shape/Makefile.am                         |      2 +-
 tests/BD_Shape/Makefile.in                         |     85 +-
 tests/BD_Shape/addconstraints1.cc                  |      2 +-
 tests/BD_Shape/addspacedims1.cc                    |      2 +-
 tests/BD_Shape/affinedimension1.cc                 |      2 +-
 tests/BD_Shape/affineimage1.cc                     |      2 +-
 tests/BD_Shape/affineimage2.cc                     |      2 +-
 tests/BD_Shape/affinepreimage1.cc                  |      2 +-
 tests/BD_Shape/ascii_dump_load1.cc                 |      2 +-
 tests/BD_Shape/bgp99extrapolation1.cc              |      2 +-
 tests/BD_Shape/bhmz05widening1.cc                  |      2 +-
 tests/BD_Shape/bhz03widening1.cc                   |      2 +-
 tests/BD_Shape/bounded1.cc                         |      2 +-
 tests/BD_Shape/boundedaffineimage1.cc              |      2 +-
 tests/BD_Shape/boundedaffinepreimage1.cc           |      2 +-
 tests/BD_Shape/bounds1.cc                          |      2 +-
 tests/BD_Shape/cc76extrapolation1.cc               |      2 +-
 tests/BD_Shape/cc76narrowing1.cc                   |      2 +-
 tests/BD_Shape/closure1.cc                         |      2 +-
 tests/BD_Shape/concatenate1.cc                     |      2 +-
 tests/BD_Shape/congruences1.cc                     |      2 +-
 tests/BD_Shape/constrains1.cc                      |     18 +-
 tests/BD_Shape/constraints1.cc                     |      2 +-
 tests/BD_Shape/contains1.cc                        |      2 +-
 tests/BD_Shape/containsintegerpoint1.cc            |      2 +-
 tests/BD_Shape/difference1.cc                      |      2 +-
 tests/BD_Shape/discrete1.cc                        |      2 +-
 tests/BD_Shape/disjoint1.cc                        |      2 +-
 tests/BD_Shape/dropsomenonintegerpoints1.cc        |      2 +-
 tests/BD_Shape/empty1.cc                           |      2 +-
 tests/BD_Shape/equality1.cc                        |      2 +-
 tests/BD_Shape/expandspacedim1.cc                  |      2 +-
 tests/BD_Shape/foldspacedims1.cc                   |      2 +-
 tests/BD_Shape/frequency1.cc                       |      2 +-
 tests/BD_Shape/frombdshape1.cc                     |      2 +-
 tests/BD_Shape/frombox1.cc                         |      2 +-
 tests/BD_Shape/fromgensys1.cc                      |      2 +-
 tests/BD_Shape/fromgrid1.cc                        |      2 +-
 tests/BD_Shape/fromoctagonalshape1.cc              |      2 +-
 tests/BD_Shape/frompolyhedron1.cc                  |      2 +-
 tests/BD_Shape/fromspacedim1.cc                    |      2 +-
 tests/BD_Shape/generalizedaffineimage1.cc          |      2 +-
 tests/BD_Shape/generalizedaffineimage2.cc          |      2 +-
 tests/BD_Shape/generalizedaffinepreimage1.cc       |      2 +-
 tests/BD_Shape/generalizedaffinepreimage2.cc       |      2 +-
 tests/BD_Shape/generalizedaffinepreimage3.cc       |      2 +-
 tests/BD_Shape/geomcovers1.cc                      |      2 +-
 tests/BD_Shape/h79widening1.cc                     |      2 +-
 tests/BD_Shape/integerupperboundifexact1.cc        |      2 +-
 tests/BD_Shape/intersection1.cc                    |      2 +-
 tests/BD_Shape/limitedbhmz05extrapolation1.cc      |      2 +-
 tests/BD_Shape/limitedcc76extrapolation1.cc        |      2 +-
 tests/BD_Shape/limitedh79extrapolation1.cc         |      2 +-
 tests/BD_Shape/mapspacedims1.cc                    |      2 +-
 tests/BD_Shape/max_min1.cc                         |      2 +-
 tests/BD_Shape/max_min2.cc                         |      2 +-
 tests/BD_Shape/maxspacedim1.cc                     |      2 +-
 tests/BD_Shape/membytes1.cc                        |      2 +-
 tests/BD_Shape/minconstraints1.cc                  |      2 +-
 tests/BD_Shape/relations1.cc                       |      2 +-
 tests/BD_Shape/relations2.cc                       |      2 +-
 tests/BD_Shape/relations3.cc                       |      2 +-
 tests/BD_Shape/relations4.cc                       |      2 +-
 tests/BD_Shape/removespacedims1.cc                 |      2 +-
 tests/BD_Shape/run_tests                           |      2 +-
 tests/BD_Shape/simplifyusingcontext1.cc            |      2 +-
 tests/BD_Shape/timeelapse1.cc                      |      2 +-
 tests/BD_Shape/unconstrain1.cc                     |      2 +-
 tests/BD_Shape/universe1.cc                        |      2 +-
 tests/BD_Shape/upperbound1.cc                      |      2 +-
 tests/BD_Shape/upperboundifexact1.cc               |      2 +-
 tests/BD_Shape/wrap1.cc                            |      2 +-
 tests/BD_Shape/writebdshape1.cc                    |      2 +-
 tests/Box/Makefile.am                              |      2 +-
 tests/Box/Makefile.in                              |     85 +-
 tests/Box/addconstraints1.cc                       |      2 +-
 tests/Box/addspacedims1.cc                         |      2 +-
 tests/Box/affinedimension1.cc                      |      2 +-
 tests/Box/affineimage1.cc                          |      2 +-
 tests/Box/affinepreimage1.cc                       |      2 +-
 tests/Box/ascii_dump_load1.cc                      |      2 +-
 tests/Box/bgp99extrapolation1.cc                   |      2 +-
 tests/Box/bhz03widening1.cc                        |      2 +-
 tests/Box/bounded1.cc                              |      2 +-
 tests/Box/boundedaffineimage1.cc                   |      2 +-
 tests/Box/boundedaffinepreimage1.cc                |      2 +-
 tests/Box/cc76narrowing1.cc                        |      2 +-
 tests/Box/cc76widening.cc                          |      2 +-
 tests/Box/concatenate1.cc                          |      2 +-
 tests/Box/congruences1.cc                          |      2 +-
 tests/Box/constrains1.cc                           |     18 +-
 tests/Box/constraints1.cc                          |      2 +-
 tests/Box/contains1.cc                             |      2 +-
 tests/Box/containsintegerpoint1.cc                 |      2 +-
 tests/Box/difference1.cc                           |      2 +-
 tests/Box/discrete1.cc                             |      2 +-
 tests/Box/disjoint1.cc                             |      2 +-
 tests/Box/empty1.cc                                |      2 +-
 tests/Box/equality1.cc                             |      2 +-
 tests/Box/expandspacedim1.cc                       |      2 +-
 tests/Box/foldspacedims1.cc                        |      2 +-
 tests/Box/frequency1.cc                            |      2 +-
 tests/Box/frombdshape1.cc                          |      2 +-
 tests/Box/frombox1.cc                              |      2 +-
 tests/Box/fromgensys1.cc                           |      2 +-
 tests/Box/fromgrid1.cc                             |      2 +-
 tests/Box/frompartiallyreducedproduct1.cc          |      2 +-
 tests/Box/frompolyhedron1.cc                       |      2 +-
 tests/Box/frompolyhedron2.cc                       |      2 +-
 tests/Box/fromspacedim1.cc                         |      2 +-
 tests/Box/generalizedaffineimage1.cc               |      2 +-
 tests/Box/generalizedaffineimage2.cc               |      2 +-
 tests/Box/generalizedaffinepreimage1.cc            |      2 +-
 tests/Box/geomcovers1.cc                           |      2 +-
 tests/Box/intersection1.cc                         |      2 +-
 tests/Box/interval1.cc                             |      2 +-
 tests/Box/limitedcc76extrapolation1.cc             |      2 +-
 tests/Box/mapspacedims1.cc                         |      2 +-
 tests/Box/max_min1.cc                              |      2 +-
 tests/Box/maxspacedim1.cc                          |      2 +-
 tests/Box/membytes1.cc                             |      2 +-
 tests/Box/minconstraints1.cc                       |      2 +-
 tests/Box/propagateconstraints1.cc                 |      2 +-
 tests/Box/propagateconstraints2.cc                 |      2 +-
 tests/Box/refinewithcongruence1.cc                 |      4 +-
 tests/Box/refinewithcongruences1.cc                |     16 +-
 tests/Box/refinewithconstraint1.cc                 |      2 +-
 tests/Box/refinewithconstraint2.cc                 |      2 +-
 tests/Box/refinewithconstraints1.cc                |      2 +-
 tests/Box/refinewithconstraints2.cc                |      2 +-
 tests/Box/relations1.cc                            |      2 +-
 tests/Box/relations2.cc                            |      2 +-
 tests/Box/relations3.cc                            |      2 +-
 tests/Box/relations4.cc                            |      2 +-
 tests/Box/removespacedims1.cc                      |      2 +-
 tests/Box/run_tests                                |      2 +-
 tests/Box/simplifyusingcontext1.cc                 |      2 +-
 tests/Box/timeelapse1.cc                           |      2 +-
 tests/Box/topclosed1.cc                            |      2 +-
 tests/Box/unconstrain1.cc                          |      2 +-
 tests/Box/universe1.cc                             |      2 +-
 tests/Box/upperbound1.cc                           |      2 +-
 tests/Box/upperboundifexact1.cc                    |      2 +-
 tests/Box/wrap1.cc                                 |      2 +-
 tests/Box/writebox1.cc                             |      2 +-
 tests/CO_Tree/Makefile.am                          |      2 +-
 tests/CO_Tree/Makefile.in                          |     85 +-
 tests/CO_Tree/cotree1.cc                           |      2 +-
 tests/Concrete_Expression/C_Expr.cc                |      4 +-
 tests/Concrete_Expression/C_Expr.defs.hh           |    257 -
 tests/Concrete_Expression/C_Expr.inlines.hh        |    187 -
 tests/Concrete_Expression/C_Expr_defs.hh           |    257 +
 tests/Concrete_Expression/C_Expr_inlines.hh        |    187 +
 tests/Concrete_Expression/Makefile.am              |      4 +-
 tests/Concrete_Expression/Makefile.in              |     93 +-
 tests/Concrete_Expression/bdshape1.cc              |      2 +-
 tests/Concrete_Expression/bdshape2.cc              |      2 +-
 tests/Concrete_Expression/digitalfilters1.cc       |      4 +-
 tests/Concrete_Expression/linearform1.cc           |      2 +-
 tests/Concrete_Expression/linearize.cc             |      4 +-
 tests/Concrete_Expression/octagonalshape1.cc       |      2 +-
 tests/Concrete_Expression/octagonalshape2.cc       |      2 +-
 tests/Concrete_Expression/polyhedron1.cc           |      2 +-
 tests/Concrete_Expression/polyhedron2.cc           |     39 +-
 tests/Concrete_Expression/run_tests                |      2 +-
 tests/Grid/Makefile.am                             |      2 +-
 tests/Grid/Makefile.in                             |     85 +-
 tests/Grid/addcongruence1.cc                       |      4 +-
 tests/Grid/addcongruences1.cc                      |     12 +-
 tests/Grid/addconstraint1.cc                       |      4 +-
 tests/Grid/addconstraints1.cc                      |      2 +-
 tests/Grid/addgenerator1.cc                        |      8 +-
 tests/Grid/addgenerators1.cc                       |      6 +-
 tests/Grid/addspacedims1.cc                        |      2 +-
 tests/Grid/affinedim1.cc                           |      2 +-
 tests/Grid/affineimage1.cc                         |      2 +-
 tests/Grid/affineimage2.cc                         |      2 +-
 tests/Grid/affinepreimage1.cc                      |      2 +-
 tests/Grid/affinepreimage2.cc                      |      2 +-
 tests/Grid/approximatepartition1.cc                |      6 +-
 tests/Grid/asciidumpload1.cc                       |      2 +-
 tests/Grid/asciidumpload2.cc                       |      2 +-
 tests/Grid/asciidumpload3.cc                       |      2 +-
 tests/Grid/asciidumpload4.cc                       |      2 +-
 tests/Grid/asciidumpload5.cc                       |      2 +-
 tests/Grid/asciidumpload6.cc                       |      2 +-
 tests/Grid/bhz03widening1.cc                       |      2 +-
 tests/Grid/bounded1.cc                             |      2 +-
 tests/Grid/boundedaffineimage1.cc                  |      2 +-
 tests/Grid/boundedaffinepreimage1.cc               |      2 +-
 tests/Grid/bounds1.cc                              |      8 +-
 tests/Grid/certificate1.cc                         |      2 +-
 tests/Grid/concatenate1.cc                         |      2 +-
 tests/Grid/congruence1.cc                          |     36 +-
 tests/Grid/congruences1.cc                         |      2 +-
 tests/Grid/congruences2.cc                         |     14 +-
 tests/Grid/constraints1.cc                         |      2 +-
 tests/Grid/contains1.cc                            |      2 +-
 tests/Grid/containsintegerpoint1.cc                |      2 +-
 tests/Grid/discrete1.cc                            |      2 +-
 tests/Grid/disjoint1.cc                            |      2 +-
 tests/Grid/dropnonintegerpoints1.cc                |      2 +-
 tests/Grid/equals1.cc                              |      2 +-
 tests/Grid/expandspacedim1.cc                      |      2 +-
 tests/Grid/foldspacedims1.cc                       |      2 +-
 tests/Grid/frequency1.cc                           |      2 +-
 tests/Grid/frombdshape1.cc                         |      2 +-
 tests/Grid/frombox1.cc                             |      2 +-
 tests/Grid/fromgrid1.cc                            |      2 +-
 tests/Grid/fromoctagonalshape1.cc                  |      2 +-
 tests/Grid/frompolyhedron1.cc                      |      2 +-
 tests/Grid/generalizedaffineimage1.cc              |     32 +-
 tests/Grid/generalizedaffineimage2.cc              |     24 +-
 tests/Grid/generalizedaffineimage3.cc              |     16 +-
 tests/Grid/generalizedaffinepreimage1.cc           |     18 +-
 tests/Grid/generalizedaffinepreimage2.cc           |     18 +-
 tests/Grid/generalizedaffinepreimage3.cc           |     18 +-
 tests/Grid/generator1.cc                           |     51 +-
 tests/Grid/generators1.cc                          |      4 +-
 tests/Grid/generators2.cc                          |      2 +-
 tests/Grid/grid1.cc                                |      4 +-
 tests/Grid/grid2.cc                                |      2 +-
 tests/Grid/grid3.cc                                |      2 +-
 tests/Grid/griddifference1.cc                      |      2 +-
 tests/Grid/intersection1.cc                        |      4 +-
 tests/Grid/isempty1.cc                             |      2 +-
 tests/Grid/isuniverse1.cc                          |      2 +-
 tests/Grid/limitedextrapolation1.cc                |      2 +-
 tests/Grid/limitedextrapolation2.cc                |      2 +-
 tests/Grid/limitedextrapolation3.cc                |      2 +-
 tests/Grid/mapspacedims1.cc                        |      2 +-
 tests/Grid/maxmin1.cc                              |     40 +-
 tests/Grid/membytes1.cc                            |      8 +-
 tests/Grid/mincongruences1.cc                      |      2 +-
 tests/Grid/mingenerators1.cc                       |      2 +-
 tests/Grid/outputoperator1.cc                      |      2 +-
 tests/Grid/outputoperator2.cc                      |      2 +-
 tests/Grid/outputoperator3.cc                      |      2 +-
 tests/Grid/partition1.cc                           |     12 +-
 tests/Grid/powersetdifference1.cc                  |      2 +-
 tests/Grid/powersetgeometricallycovers1.cc         |      2 +-
 tests/Grid/powersetgeometricallyequals1.cc         |      2 +-
 tests/Grid/refinewithcongruences1.cc               |      2 +-
 tests/Grid/refinewithconstraints1.cc               |      2 +-
 tests/Grid/relations1.cc                           |      6 +-
 tests/Grid/relations2.cc                           |     28 +-
 tests/Grid/relations3.cc                           |    244 +-
 tests/Grid/removespacedims1.cc                     |      2 +-
 tests/Grid/removespacedims2.cc                     |      2 +-
 tests/Grid/simplifyusingcontext1.cc                |      2 +-
 tests/Grid/timeelapse1.cc                          |      2 +-
 tests/Grid/topclosed1.cc                           |      2 +-
 tests/Grid/topclosure1.cc                          |      2 +-
 tests/Grid/unconstrain1.cc                         |      2 +-
 tests/Grid/upperbound1.cc                          |      2 +-
 tests/Grid/upperbound2.cc                          |      2 +-
 tests/Grid/widening1.cc                            |      2 +-
 tests/Grid/widening2.cc                            |      2 +-
 tests/Grid/widening3.cc                            |      2 +-
 tests/Grid/wrap1.cc                                |      2 +-
 tests/Grid/writecongruencesystem.cc                |      2 +-
 tests/MIP_Problem/Makefile.am                      |      2 +-
 tests/MIP_Problem/Makefile.in                      |     85 +-
 tests/MIP_Problem/ascii_dump_load1.cc              |      2 +-
 tests/MIP_Problem/exceptions1.cc                   |     16 +-
 tests/MIP_Problem/mipproblem1.cc                   |   1494 +-
 tests/MIP_Problem/mipproblem2.cc                   |      4 +-
 tests/MIP_Problem/mipproblem3.cc                   |    768 +-
 tests/MIP_Problem/mipproblem4.cc                   |     16 +-
 tests/Makefile.am                                  |      8 +-
 tests/Makefile.in                                  |    179 +-
 tests/Octagonal_Shape/Makefile.am                  |      2 +-
 tests/Octagonal_Shape/Makefile.in                  |     85 +-
 tests/Octagonal_Shape/addspacedims1.cc             |      2 +-
 tests/Octagonal_Shape/affinedimension1.cc          |      2 +-
 tests/Octagonal_Shape/affineimage1.cc              |      2 +-
 tests/Octagonal_Shape/affineimage2.cc              |      2 +-
 tests/Octagonal_Shape/affinepreimage1.cc           |      2 +-
 tests/Octagonal_Shape/affinepreimage2.cc           |      2 +-
 tests/Octagonal_Shape/ascii_dump_load1.cc          |      2 +-
 tests/Octagonal_Shape/bhmz05widening1.cc           |      2 +-
 tests/Octagonal_Shape/bhz03widening1.cc            |      2 +-
 tests/Octagonal_Shape/bounded1.cc                  |      2 +-
 tests/Octagonal_Shape/boundedaffineimage1.cc       |      2 +-
 tests/Octagonal_Shape/boundedaffinepreimage1.cc    |      2 +-
 tests/Octagonal_Shape/bounds1.cc                   |      2 +-
 tests/Octagonal_Shape/cc76extrapolation1.cc        |      2 +-
 tests/Octagonal_Shape/cc76narrowing1.cc            |      2 +-
 tests/Octagonal_Shape/chinainit.cc                 |      2 +-
 tests/Octagonal_Shape/concatenate1.cc              |      2 +-
 tests/Octagonal_Shape/congruences1.cc              |      2 +-
 tests/Octagonal_Shape/constrains1.cc               |     18 +-
 tests/Octagonal_Shape/constraints1.cc              |      2 +-
 tests/Octagonal_Shape/contains1.cc                 |      2 +-
 tests/Octagonal_Shape/containsintegerpoint1.cc     |      2 +-
 tests/Octagonal_Shape/difference1.cc               |      2 +-
 tests/Octagonal_Shape/discrete1.cc                 |      2 +-
 tests/Octagonal_Shape/disjoint1.cc                 |      2 +-
 tests/Octagonal_Shape/dropsomenonintegerpoints1.cc |      2 +-
 tests/Octagonal_Shape/empty1.cc                    |      2 +-
 tests/Octagonal_Shape/expandspacedim1.cc           |      2 +-
 tests/Octagonal_Shape/foldspacedims1.cc            |      2 +-
 tests/Octagonal_Shape/frequency1.cc                |      2 +-
 tests/Octagonal_Shape/frombdshape1.cc              |      2 +-
 tests/Octagonal_Shape/frombox1.cc                  |      2 +-
 tests/Octagonal_Shape/fromgensys1.cc               |      2 +-
 tests/Octagonal_Shape/fromgrid1.cc                 |      2 +-
 tests/Octagonal_Shape/fromoctagonalshape1.cc       |      2 +-
 tests/Octagonal_Shape/frompolyhedron1.cc           |      2 +-
 tests/Octagonal_Shape/fromspacedim1.cc             |      2 +-
 tests/Octagonal_Shape/generalizedaffineimage1.cc   |      2 +-
 tests/Octagonal_Shape/generalizedaffineimage2.cc   |      2 +-
 tests/Octagonal_Shape/generalizedaffineimage3.cc   |      2 +-
 tests/Octagonal_Shape/generalizedaffineimage4.cc   |      2 +-
 tests/Octagonal_Shape/generalizedaffineimage5.cc   |      2 +-
 .../Octagonal_Shape/generalizedaffinepreimage1.cc  |      2 +-
 .../Octagonal_Shape/generalizedaffinepreimage2.cc  |      2 +-
 .../Octagonal_Shape/generalizedaffinepreimage3.cc  |      2 +-
 .../Octagonal_Shape/generalizedaffinepreimage4.cc  |      2 +-
 tests/Octagonal_Shape/integerupperboundifexact1.cc |      2 +-
 tests/Octagonal_Shape/intersection1.cc             |      2 +-
 .../Octagonal_Shape/limitedbhmz05extrapolation1.cc |      2 +-
 tests/Octagonal_Shape/limitedcc76extrapolation1.cc |      2 +-
 tests/Octagonal_Shape/mapspacedims1.cc             |      2 +-
 tests/Octagonal_Shape/max_min1.cc                  |      2 +-
 tests/Octagonal_Shape/max_min2.cc                  |      2 +-
 tests/Octagonal_Shape/maxspacedim1.cc              |      2 +-
 tests/Octagonal_Shape/membytes1.cc                 |      2 +-
 tests/Octagonal_Shape/minconstraints1.cc           |      2 +-
 tests/Octagonal_Shape/relatwithcons1.cc            |      2 +-
 tests/Octagonal_Shape/relatwithcons2.cc            |      2 +-
 tests/Octagonal_Shape/relatwithcons3.cc            |      2 +-
 tests/Octagonal_Shape/relatwithgen1.cc             |      2 +-
 tests/Octagonal_Shape/removespacedims1.cc          |      2 +-
 tests/Octagonal_Shape/run_tests                    |      2 +-
 tests/Octagonal_Shape/simplifyusingcontext1.cc     |      2 +-
 tests/Octagonal_Shape/timeelapse1.cc               |      2 +-
 tests/Octagonal_Shape/unconstrain1.cc              |      2 +-
 tests/Octagonal_Shape/universe1.cc                 |      2 +-
 tests/Octagonal_Shape/upperbound1.cc               |      2 +-
 tests/Octagonal_Shape/upperboundifexact1.cc        |      2 +-
 tests/Octagonal_Shape/wrap1.cc                     |      2 +-
 tests/Octagonal_Shape/writeoctagon1.cc             |      2 +-
 tests/PIP_Problem/Makefile.am                      |      2 +-
 tests/PIP_Problem/Makefile.in                      |     85 +-
 tests/PIP_Problem/ascii_dump_load1.cc              |      2 +-
 tests/PIP_Problem/exceptions1.cc                   |      2 +-
 tests/PIP_Problem/pipproblem1.cc                   |      2 +-
 tests/PIP_Problem/pipproblem2.cc                   |      2 +-
 tests/PIP_Problem/pipproblem3.cc                   |      2 +-
 tests/PIP_Problem/weightwatch1.cc                  |      2 +-
 tests/Partially_Reduced_Product/Makefile.am        |      2 +-
 tests/Partially_Reduced_Product/Makefile.in        |     85 +-
 tests/Partially_Reduced_Product/addcongruences1.cc |      2 +-
 tests/Partially_Reduced_Product/affineimage1.cc    |      2 +-
 tests/Partially_Reduced_Product/asciidumpload1.cc  |      2 +-
 tests/Partially_Reduced_Product/bounded1.cc        |      2 +-
 .../boundedaffineimage1.cc                         |     13 +-
 tests/Partially_Reduced_Product/bounds1.cc         |      8 +-
 tests/Partially_Reduced_Product/concatenate1.cc    |      2 +-
 tests/Partially_Reduced_Product/congruences1.cc    |      2 +-
 .../congruencesproduct1.cc                         |      2 +-
 tests/Partially_Reduced_Product/constraints1.cc    |      2 +-
 .../constraintsproduct1.cc                         |      2 +-
 tests/Partially_Reduced_Product/contains1.cc       |      2 +-
 tests/Partially_Reduced_Product/difference1.cc     |      2 +-
 tests/Partially_Reduced_Product/dimension1.cc      |      2 +-
 tests/Partially_Reduced_Product/directproduct1.cc  |      2 +-
 tests/Partially_Reduced_Product/discrete1.cc       |      2 +-
 tests/Partially_Reduced_Product/disjoint1.cc       |      2 +-
 .../dropsomenonintegerpoints1.cc                   |      2 +-
 tests/Partially_Reduced_Product/equals1.cc         |      2 +-
 tests/Partially_Reduced_Product/frombdshape1.cc    |      2 +-
 tests/Partially_Reduced_Product/frombox1.cc        |      2 +-
 tests/Partially_Reduced_Product/fromgrid1.cc       |      2 +-
 .../fromoctagonalshape1.cc                         |      2 +-
 tests/Partially_Reduced_Product/frompolyhedron1.cc |      2 +-
 tests/Partially_Reduced_Product/fromproduct1.cc    |      2 +-
 .../generalizedaffineimage1.cc                     |      2 +-
 tests/Partially_Reduced_Product/intersection1.cc   |      2 +-
 tests/Partially_Reduced_Product/isempty1.cc        |      2 +-
 tests/Partially_Reduced_Product/isuniverse1.cc     |      2 +-
 tests/Partially_Reduced_Product/maxmin1.cc         |      2 +-
 .../partially_reduced_product_test.hh              |      2 +-
 .../refinewithcongruences1.cc                      |      2 +-
 .../refinewithconstraints1.cc                      |      2 +-
 tests/Partially_Reduced_Product/relations1.cc      |     54 +-
 .../shapepreservingproduct1.cc                     |      2 +-
 tests/Partially_Reduced_Product/smashproduct1.cc   |      4 +-
 tests/Partially_Reduced_Product/spacedims1.cc      |      2 +-
 tests/Partially_Reduced_Product/timeelapse1.cc     |      2 +-
 tests/Partially_Reduced_Product/topclosed1.cc      |      2 +-
 tests/Partially_Reduced_Product/topclosure1.cc     |      2 +-
 tests/Partially_Reduced_Product/upperbound1.cc     |      4 +-
 tests/Polyhedron/Makefile.am                       |      2 +-
 tests/Polyhedron/Makefile.in                       |     85 +-
 tests/Polyhedron/addcongruence1.cc                 |      2 +-
 tests/Polyhedron/addcongruences1.cc                |      2 +-
 tests/Polyhedron/addconstraint1.cc                 |      4 +-
 tests/Polyhedron/addconstraints1.cc                |      6 +-
 tests/Polyhedron/addconstraints2.cc                |      2 +-
 tests/Polyhedron/addgenerator1.cc                  |      2 +-
 tests/Polyhedron/addgenerator2.cc                  |      8 +-
 tests/Polyhedron/addgenerators1.cc                 |      2 +-
 tests/Polyhedron/addgenerators2.cc                 |      4 +-
 tests/Polyhedron/addspacedims1.cc                  |     10 +-
 tests/Polyhedron/addspacedims2.cc                  |      4 +-
 tests/Polyhedron/affineimage1.cc                   |      6 +-
 tests/Polyhedron/affineimage2.cc                   |      2 +-
 tests/Polyhedron/affinepreimage1.cc                |      6 +-
 tests/Polyhedron/affinetrans.cc                    |      2 +-
 tests/Polyhedron/append1.cc                        |      6 +-
 tests/Polyhedron/append2.cc                        |      8 +-
 tests/Polyhedron/ascii_dump_load1.cc               |      2 +-
 tests/Polyhedron/ascii_dump_load2.cc               |      2 +-
 tests/Polyhedron/ascii_dump_load3.cc               |      2 +-
 tests/Polyhedron/bgp99extrapolation1.cc            |     14 +-
 tests/Polyhedron/bgp99extrapolation2.cc            |      2 +-
 tests/Polyhedron/bhrz03widening1.cc                |      8 +-
 tests/Polyhedron/bhrz03widening2.cc                |      2 +-
 tests/Polyhedron/bhrz03widening3.cc                |     36 +-
 tests/Polyhedron/bhz03widening1.cc                 |     26 +-
 tests/Polyhedron/bounded1.cc                       |      2 +-
 tests/Polyhedron/boundedaffineimage1.cc            |     26 +-
 tests/Polyhedron/boundedaffinepreimage1.cc         |      4 +-
 tests/Polyhedron/boundedbhrz03extrapolation1.cc    |      2 +-
 tests/Polyhedron/boundedh79extrapolation1.cc       |      6 +-
 tests/Polyhedron/bounds1.cc                        |      2 +-
 tests/Polyhedron/cnncconversion1.cc                |      2 +-
 tests/Polyhedron/concatenate1.cc                   |      2 +-
 tests/Polyhedron/congruences1.cc                   |      2 +-
 tests/Polyhedron/constrains1.cc                    |     18 +-
 tests/Polyhedron/constraints1.cc                   |      2 +-
 tests/Polyhedron/contains1.cc                      |      2 +-
 tests/Polyhedron/contains2.cc                      |      2 +-
 tests/Polyhedron/containsintegerpoint1.cc          |      2 +-
 tests/Polyhedron/disjoint1.cc                      |      4 +-
 tests/Polyhedron/disjoint2.cc                      |      8 +-
 tests/Polyhedron/dropsomenonintegerpoints1.cc      |      2 +-
 tests/Polyhedron/dropsomenonintegerpoints2.cc      |     37 +-
 tests/Polyhedron/dualhypercubes.cc                 |     64 +-
 tests/Polyhedron/empty1.cc                         |      2 +-
 tests/Polyhedron/equals1.cc                        |      2 +-
 tests/Polyhedron/exceptions1.cc                    |      2 +-
 tests/Polyhedron/exceptions2.cc                    |      2 +-
 tests/Polyhedron/exceptions3.cc                    |      4 +-
 tests/Polyhedron/expandspacedim1.cc                |      6 +-
 tests/Polyhedron/expandspacedim2.cc                |      2 +-
 tests/Polyhedron/foldspacedims1.cc                 |      2 +-
 tests/Polyhedron/foldspacedims2.cc                 |      2 +-
 tests/Polyhedron/frequency1.cc                     |      2 +-
 tests/Polyhedron/frombdshape1.cc                   |      2 +-
 tests/Polyhedron/frombox1.cc                       |      2 +-
 tests/Polyhedron/frombox2.cc                       |      2 +-
 tests/Polyhedron/fromgrid1.cc                      |      2 +-
 tests/Polyhedron/fromoctagonalshape1.cc            |      2 +-
 tests/Polyhedron/generalizedaffineimage1.cc        |     34 +-
 tests/Polyhedron/generalizedaffineimage2.cc        |     72 +-
 tests/Polyhedron/generalizedaffinepreimage1.cc     |     12 +-
 tests/Polyhedron/generalizedaffinepreimage2.cc     |      4 +-
 tests/Polyhedron/generators1.cc                    |     10 +-
 tests/Polyhedron/geomcovers1.cc                    |      2 +-
 tests/Polyhedron/h79widening1.cc                   |      2 +-
 tests/Polyhedron/h79widening2.cc                   |      2 +-
 tests/Polyhedron/hybrid.cc                         |     10 +-
 tests/Polyhedron/intersection1.cc                  |     26 +-
 tests/Polyhedron/limitedbhrz03extrapolation1.cc    |      2 +-
 tests/Polyhedron/limitedh79extrapolation1.cc       |     24 +-
 tests/Polyhedron/linearexpression1.cc              |      2 +-
 tests/Polyhedron/linearpartition1.cc               |     26 +-
 tests/Polyhedron/linearsystem1.cc                  |     24 +-
 tests/Polyhedron/mapspacedims1.cc                  |      2 +-
 tests/Polyhedron/matrix1.cc                        |     18 +-
 tests/Polyhedron/max_min1.cc                       |      2 +-
 tests/Polyhedron/maxspacedim1.cc                   |     46 +-
 tests/Polyhedron/mc91.cc                           |      2 +-
 tests/Polyhedron/membytes1.cc                      |      8 +-
 tests/Polyhedron/memory1.cc                        |     24 +-
 tests/Polyhedron/memory2.cc                        |     22 +-
 tests/Polyhedron/minconstraints1.cc                |      2 +-
 tests/Polyhedron/minconstraints2.cc                |      4 +-
 tests/Polyhedron/mingenerators1.cc                 |      2 +-
 tests/Polyhedron/mingenerators2.cc                 |      2 +-
 tests/Polyhedron/nncminimize1.cc                   |     16 +-
 tests/Polyhedron/nncminimize2.cc                   |      2 +-
 tests/Polyhedron/numberinput1.cc                   |     38 +-
 tests/Polyhedron/onepoint.cc                       |      2 +-
 tests/Polyhedron/permute.cc                        |      6 +-
 tests/Polyhedron/polydifference1.cc                |      2 +-
 tests/Polyhedron/polydifference2.cc                |      2 +-
 tests/Polyhedron/polyhull1.cc                      |     18 +-
 tests/Polyhedron/polyhull2.cc                      |      2 +-
 tests/Polyhedron/polyhullifexact1.cc               |     42 +-
 tests/Polyhedron/polyhullifexact2.cc               |      2 +-
 tests/Polyhedron/randphull1.cc                     |     30 +-
 tests/Polyhedron/refinewithcongruence1.cc          |      4 +-
 tests/Polyhedron/refinewithcongruences1.cc         |      4 +-
 tests/Polyhedron/refinewithconstraint1.cc          |      6 +-
 tests/Polyhedron/refinewithconstraints1.cc         |      4 +-
 tests/Polyhedron/relations1.cc                     |      2 +-
 tests/Polyhedron/relations2.cc                     |      2 +-
 tests/Polyhedron/relations3.cc                     |      6 +-
 tests/Polyhedron/removespacedims1.cc               |      4 +-
 tests/Polyhedron/removespacedims2.cc               |      4 +-
 tests/Polyhedron/simplifyusingcontext1.cc          |      2 +-
 tests/Polyhedron/smm1.cc                           |     92 +-
 tests/Polyhedron/sparserow1.cc                     |      2 +-
 tests/Polyhedron/termination1.cc                   |      2 +-
 tests/Polyhedron/termination2.cc                   |      2 +-
 tests/Polyhedron/timeelapse1.cc                    |      2 +-
 tests/Polyhedron/timeelapse2.cc                    |      2 +-
 tests/Polyhedron/topclosed1.cc                     |      2 +-
 tests/Polyhedron/topclosure1.cc                    |      2 +-
 tests/Polyhedron/unconstrain1.cc                   |      2 +-
 tests/Polyhedron/universe1.cc                      |      2 +-
 tests/Polyhedron/universe2.cc                      |      2 +-
 tests/Polyhedron/variablesset1.cc                  |     16 +-
 tests/Polyhedron/watchdog1.cc                      |      4 +-
 tests/Polyhedron/weightwatch1.cc                   |      2 +-
 tests/Polyhedron/wrap1.cc                          |      2 +-
 tests/Polyhedron/wrap2.cc                          |      2 +-
 tests/Polyhedron/writeconsys1.cc                   |      2 +-
 tests/Polyhedron/writegensys1.cc                   |      2 +-
 tests/Polyhedron/writepolyhedron1.cc               |      2 +-
 tests/Polyhedron/writepolyhedron2.cc               |      2 +-
 tests/Polyhedron/writerelation1.cc                 |      2 +-
 tests/Polyhedron/writevariable1.cc                 |      6 +-
 tests/Powerset/Makefile.am                         |      2 +-
 tests/Powerset/Makefile.in                         |     85 +-
 tests/Powerset/addcongruences1.cc                  |      2 +-
 tests/Powerset/addconstraints1.cc                  |      2 +-
 tests/Powerset/affinedimension1.cc                 |      2 +-
 tests/Powerset/affineimage1.cc                     |      2 +-
 tests/Powerset/affinepreimage1.cc                  |      2 +-
 tests/Powerset/bounded1.cc                         |      2 +-
 tests/Powerset/bounds1.cc                          |      2 +-
 tests/Powerset/closed1.cc                          |      2 +-
 tests/Powerset/closure1.cc                         |      2 +-
 tests/Powerset/collapse1.cc                        |      2 +-
 tests/Powerset/concatenate1.cc                     |      2 +-
 tests/Powerset/contains1.cc                        |      2 +-
 tests/Powerset/containsintegerpoint1.cc            |      2 +-
 tests/Powerset/difference1.cc                      |      6 +-
 tests/Powerset/discrete1.cc                        |      2 +-
 tests/Powerset/disjoint1.cc                        |      2 +-
 tests/Powerset/disjunct1.cc                        |      2 +-
 tests/Powerset/empty1.cc                           |      2 +-
 tests/Powerset/entails1.cc                         |      2 +-
 tests/Powerset/equals1.cc                          |      2 +-
 tests/Powerset/frombdshape1.cc                     |      2 +-
 tests/Powerset/frombox1.cc                         |      2 +-
 tests/Powerset/fromcongruences1.cc                 |      2 +-
 tests/Powerset/fromconstraints1.cc                 |      4 +-
 tests/Powerset/fromgrid1.cc                        |      2 +-
 tests/Powerset/fromoctagonalshape1.cc              |      2 +-
 tests/Powerset/frompolyhedron1.cc                  |      2 +-
 tests/Powerset/fromspacedimension1.cc              |      2 +-
 tests/Powerset/intersection1.cc                    |      2 +-
 tests/Powerset/maxmin1.cc                          |      2 +-
 tests/Powerset/meet1.cc                            |      2 +-
 tests/Powerset/membytes1.cc                        |      2 +-
 tests/Powerset/powerset1.cc                        |      4 +-
 tests/Powerset/reduce1.cc                          |      2 +-
 tests/Powerset/refinewith1.cc                      |      2 +-
 tests/Powerset/relationwith1.cc                    |      2 +-
 tests/Powerset/simplifyusingcontext1.cc            |      2 +-
 tests/Powerset/size1.cc                            |      2 +-
 tests/Powerset/spacedims1.cc                       |      2 +-
 tests/Powerset/universe1.cc                        |      2 +-
 tests/Powerset/upperbound1.cc                      |      2 +-
 tests/README                                       |      4 +-
 tests/Random_Number_Generator.defs.hh              |     47 -
 tests/Random_Number_Generator.inlines.hh           |     92 -
 tests/Random_Number_Generator.types.hh             |     22 -
 tests/Random_Number_Generator_defs.hh              |     47 +
 tests/Random_Number_Generator_inlines.hh           |     92 +
 tests/Random_Number_Generator_types.hh             |     22 +
 tests/Watchdog/Makefile.am                         |      2 +-
 tests/Watchdog/Makefile.in                         |     85 +-
 tests/Watchdog/watchdog1.cc                        |      2 +-
 tests/files.cc                                     |      2 +-
 tests/files.hh                                     |      2 +-
 tests/ppl_test.cc                                  |     48 +-
 tests/ppl_test.hh                                  |    400 +-
 utils/Makefile.am                                  |      2 +-
 utils/Makefile.in                                  |    105 +-
 utils/build_header.in                              |      2 +-
 utils/cm_cleaner.sh                                |      2 +-
 utils/cm_splitter.sh                               |      2 +-
 utils/text2cxxarray.in                             |      2 +-
 utils/timings.cc                                   |     20 +-
 utils/timings.hh                                   |      2 +-
 1720 files changed, 321665 insertions(+), 332889 deletions(-)

diff --git a/ChangeLog b/ChangeLog
index 8bc799b..78886ab 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,9 +1,5 @@
 2012-06-28  Roberto Bagnara <bagnara at cs.unipr.it>
 
-	* PPL 1.0 released.
-
-2012-06-28  Roberto Bagnara <bagnara at cs.unipr.it>
-
 	* doc/definitions.dox: Work around a Doxygen bug.  Stick to ASCII.
 
 2012-06-28  Roberto Bagnara <bagnara at cs.unipr.it>
diff --git a/Makefile.am b/Makefile.am
index 1b80b3d..b56c5a7 100644
--- a/Makefile.am
+++ b/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -36,10 +36,10 @@ dist_noinst_HEADERS = \
 instchk.hh
 
 ppl-config.h: config.h $(srcdir)/ppl-config.sed
-	$(SED) -f $(srcdir)/ppl-config.sed $< >$@
+	$(SED) -f $(srcdir)/ppl-config.sed config.h >$@
 
 ppl-config.h.in: config.h.in $(srcdir)/ppl-config.sed
-	$(SED) -f $(srcdir)/ppl-config.sed $< >$@
+	$(SED) -f $(srcdir)/ppl-config.sed config.h.in >$@
 
 DISTCHECK_CONFIGURE_FLAGS = \
 --enable-shared
diff --git a/Makefile.in b/Makefile.in
index 4209ca6..54e1492 100644
--- a/Makefile.in
+++ b/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -100,12 +116,18 @@ CONFIG_HEADER = config.h
 CONFIG_CLEAN_FILES = ppl.lsm
 CONFIG_CLEAN_VPATH_FILES =
 SCRIPTS = $(dist_noinst_SCRIPTS)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -115,14 +137,20 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 HEADERS = $(dist_noinst_HEADERS) $(nodist_noinst_HEADERS)
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
 AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \
 	$(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \
-	distdir dist dist-all distcheck
+	cscope distdir dist dist-all distcheck
 ETAGS = etags
 CTAGS = ctags
+CSCOPE = cscope
 DIST_SUBDIRS = $(SUBDIRS)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 distdir = $(PACKAGE)-$(VERSION)
@@ -133,6 +161,7 @@ am__remove_distdir = \
       && rm -rf "$(distdir)" \
       || { sleep 5 && rm -rf "$(distdir)"; }; \
   else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
 am__relativize = \
   dir0=`pwd`; \
   sed_first='s,^\([^/]*\)/.*$$,\1,'; \
@@ -161,6 +190,7 @@ am__relativize = \
 DIST_ARCHIVES = $(distdir).tar.gz $(distdir).tar.bz2 $(distdir).tar.xz \
 	$(distdir).zip
 GZIP_ENV = --best
+DIST_TARGETS = dist-xz dist-bzip2 dist-gzip dist-zip
 distuninstallcheck_listfiles = find . -type f -print
 am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
   | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
@@ -462,12 +492,12 @@ distclean-libtool:
 	-rm -f libtool config.lt
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -477,7 +507,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -491,37 +525,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -530,6 +533,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -593,8 +600,32 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscope: cscope.files
+	test ! -s cscope.files \
+	  || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS)
+
+clean-cscope:
+	-rm -f cscope.files
+
+cscope.files: clean-cscope cscopelist-recursive cscopelist
+
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+	-rm -f cscope.out cscope.in.out cscope.po.out cscope.files
 
 distdir: $(DISTFILES)
 	$(am__remove_distdir)
@@ -630,13 +661,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -668,41 +696,33 @@ distdir: $(DISTFILES)
 	|| chmod -R a+r "$(distdir)"
 dist-gzip: distdir
 	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 dist-bzip2: distdir
 	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 
 dist-lzip: distdir
 	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
-	$(am__remove_distdir)
-
-dist-lzma: distdir
-	tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 dist-xz: distdir
 	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 
 dist-tarZ: distdir
 	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 
 dist-shar: distdir
 	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 dist-zip: distdir
 	-rm -f $(distdir).zip
 	zip -rq $(distdir).zip $(distdir)
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 
-dist dist-all: distdir
-	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
-	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
-	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
-	-rm -f $(distdir).zip
-	zip -rq $(distdir).zip $(distdir)
-	$(am__remove_distdir)
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
 
 # This target untars the dist file and tries a VPATH configuration.  Then
 # it guarantees that the distribution is self-contained by making another
@@ -713,8 +733,6 @@ distcheck: dist
 	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
 	*.tar.bz2*) \
 	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
-	*.tar.lzma*) \
-	  lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\
 	*.tar.lz*) \
 	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
 	*.tar.xz*) \
@@ -726,9 +744,9 @@ distcheck: dist
 	*.zip*) \
 	  unzip $(distdir).zip ;;\
 	esac
-	chmod -R a-w $(distdir); chmod a+w $(distdir)
-	mkdir $(distdir)/_build
-	mkdir $(distdir)/_inst
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
 	chmod a-w $(distdir)
 	test -d $(distdir)/_build || exit 0; \
 	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
@@ -760,7 +778,7 @@ distcheck: dist
 	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
 	  && cd "$$am__cwd" \
 	  || exit 1
-	$(am__remove_distdir)
+	$(am__post_remove_distdir)
 	@(echo "$(distdir) archives ready for distribution: "; \
 	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
 	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
@@ -897,12 +915,14 @@ ps-am:
 uninstall-am:
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all \
-	ctags-recursive install-am install-strip tags-recursive
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
-	all all-am am--refresh check check-am clean clean-generic \
-	clean-libtool ctags ctags-recursive dist dist-all dist-bzip2 \
-	dist-gzip dist-hook dist-lzip dist-lzma dist-shar dist-tarZ \
+	all all-am am--refresh check check-am clean clean-cscope \
+	clean-generic clean-libtool cscope cscopelist \
+	cscopelist-recursive ctags ctags-recursive dist dist-all \
+	dist-bzip2 dist-gzip dist-hook dist-lzip dist-shar dist-tarZ \
 	dist-xz dist-zip distcheck distclean distclean-generic \
 	distclean-hdr distclean-libtool distclean-tags distcleancheck \
 	distdir distuninstallcheck dvi dvi-am html html-am info \
@@ -918,10 +938,10 @@ uninstall-am:
 
 
 ppl-config.h: config.h $(srcdir)/ppl-config.sed
-	$(SED) -f $(srcdir)/ppl-config.sed $< >$@
+	$(SED) -f $(srcdir)/ppl-config.sed config.h >$@
 
 ppl-config.h.in: config.h.in $(srcdir)/ppl-config.sed
-	$(SED) -f $(srcdir)/ppl-config.sed $< >$@
+	$(SED) -f $(srcdir)/ppl-config.sed config.h.in >$@
 
 # Kludge: we need to force building `ppl-config.h' on `make dist',
 # hence we list it in `EXTRA_DIST';  but we do not want to distribute
diff --git a/NEWS b/NEWS
index fac7d33..5eda9f7 100644
--- a/NEWS
+++ b/NEWS
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 Verbatim copying and distribution of this entire article is permitted
 in any medium, provided this notice is preserved.
@@ -9,6 +9,47 @@ Parma Polyhedra Library NEWS -- history of user-visible changes
 ===============================================================
 
 --------------------------------------------------------------------------
+NEWS for version 1.1  (released date to be decided)
+--------------------------------------------------------------------------
+
+New and Changed Features
+========================
+
+o  In the Java language interface:
+
+    - The constraint/generator/... system classes now extend the ArrayList
+      generic container (rather than Vector);
+
+    - Variable objects are now built from a long (rather than int) value,
+      thereby matching the type used elsewhere for space dimensions;
+
+    - added new static method to Variable class
+          void setStringifier(Variable_Stringifier)
+      where Variable_Stringifier is an interface allowing for
+      customization of the output routine for variable's names
+      (see example in interfaces/Java/tests/Variable_Output_test1.java);
+
+    - added value NOT_EQUAL to enumeration Relation_Symbol.
+
+
+Bugfixes
+========
+
+o  Portability improved.
+
+o  Fixed a precision regression in Polyhedron method
+     void drop_some_non_integer_points(const Variables_Set&,
+                                       Complexity_Class);
+
+o  In the Java interface, fixed declaration of methods
+     void drop_some_non_integer_points(...);
+   so as to accept a Complexity_Class enum value.
+
+o  Fixed an issue in method MIP_Problem::OK() whereby the method
+   was trying to enforce a non-invariant condition.
+
+
+--------------------------------------------------------------------------
 NEWS for version 1.0  (released on June 28, 2012)
 --------------------------------------------------------------------------
 
diff --git a/README b/README
index 57ce785..afc4f17 100644
--- a/README
+++ b/README
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -376,8 +376,8 @@ ppl-1.0
 |   |   |-- ppl_c.h.dist
 |   |   |-- ppl_c_header.h
 |   |   |-- ppl_c_implementation_common.cc
-|   |   |-- ppl_c_implementation_common.defs.hh
-|   |   |-- ppl_c_implementation_common.inlines.hh
+|   |   |-- ppl_c_implementation_common_defs.hh
+|   |   |-- ppl_c_implementation_common_inlines.hh
 |   |   |-- ppl_c_version.h.in
 |   |   |-- ppl_interface_generator_c_cc_code.m4
 |   |   |-- ppl_interface_generator_c_cc_files.m4
@@ -406,8 +406,8 @@ ppl-1.0
 |   |   |   |-- ppl_interface_generator_java_classes_cc_code.m4
 |   |   |   |-- ppl_interface_generator_java_classes_cc_files.m4
 |   |   |   |-- ppl_java_common.cc
-|   |   |   |-- ppl_java_common.defs.hh
-|   |   |   |-- ppl_java_common.inlines.hh
+|   |   |   |-- ppl_java_common_defs.hh
+|   |   |   |-- ppl_java_common_inlines.hh
 |   |   |   `-- ppl_java_globals.cc
 |   |   |-- parma_polyhedra_library
 |   |   |   |-- Artificial_Parameter.java
@@ -501,8 +501,8 @@ ppl-1.0
 |   |   |-- ppl_interface_generator_ocaml_mli_code.m4
 |   |   |-- ppl_interface_generator_ocaml_procedure_generators.m4
 |   |   |-- ppl_ocaml_common.cc
-|   |   |-- ppl_ocaml_common.defs.hh
-|   |   |-- ppl_ocaml_common.inlines.hh
+|   |   |-- ppl_ocaml_common_defs.hh
+|   |   |-- ppl_ocaml_common_inlines.hh
 |   |   |-- ppl_ocaml_globals.ml
 |   |   |-- ppl_ocaml_globals.mli
 |   |   `-- tests
@@ -612,8 +612,8 @@ ppl-1.0
 |   |   |-- ppl_interface_generator_prolog_procedure_generators.m4
 |   |   |-- ppl_interface_generator_prolog_systems.m4
 |   |   |-- ppl_prolog_common.cc
-|   |   |-- ppl_prolog_common.defs.hh
-|   |   |-- ppl_prolog_common.inlines.hh
+|   |   |-- ppl_prolog_common_defs.hh
+|   |   |-- ppl_prolog_common_inlines.hh
 |   |   `-- tests
 |   |       |-- Makefile.am
 |   |       |-- Makefile.in
@@ -713,162 +713,162 @@ ppl-1.0
 |-- ppl.lsm.in
 |-- src
 |   |-- BDS_Status.idefs.hh
-|   |-- BDS_Status.inlines.hh
+|   |-- BDS_Status_inlines.hh
 |   |-- BD_Shape.cc
-|   |-- BD_Shape.defs.hh
-|   |-- BD_Shape.inlines.hh
-|   |-- BD_Shape.templates.hh
-|   |-- BD_Shape.types.hh
+|   |-- BD_Shape_defs.hh
+|   |-- BD_Shape_inlines.hh
+|   |-- BD_Shape_templates.hh
+|   |-- BD_Shape_types.hh
 |   |-- BHRZ03_Certificate.cc
-|   |-- BHRZ03_Certificate.defs.hh
-|   |-- BHRZ03_Certificate.inlines.hh
-|   |-- BHRZ03_Certificate.types.hh
+|   |-- BHRZ03_Certificate_defs.hh
+|   |-- BHRZ03_Certificate_inlines.hh
+|   |-- BHRZ03_Certificate_types.hh
 |   |-- BUGS.cc.dist
 |   |-- BUGS.hh.dist
 |   |-- Bit_Matrix.cc
-|   |-- Bit_Matrix.defs.hh
-|   |-- Bit_Matrix.inlines.hh
-|   |-- Bit_Matrix.types.hh
+|   |-- Bit_Matrix_defs.hh
+|   |-- Bit_Matrix_inlines.hh
+|   |-- Bit_Matrix_types.hh
 |   |-- Bit_Row.cc
-|   |-- Bit_Row.defs.hh
-|   |-- Bit_Row.inlines.hh
-|   |-- Bit_Row.types.hh
-|   |-- Boundary.defs.hh
+|   |-- Bit_Row_defs.hh
+|   |-- Bit_Row_inlines.hh
+|   |-- Bit_Row_types.hh
+|   |-- Boundary_defs.hh
 |   |-- Box.cc
-|   |-- Box.defs.hh
-|   |-- Box.inlines.hh
-|   |-- Box.templates.hh
-|   |-- Box.types.hh
+|   |-- Box_defs.hh
+|   |-- Box_inlines.hh
+|   |-- Box_templates.hh
+|   |-- Box_types.hh
 |   |-- Box_Status.idefs.hh
-|   |-- Box_Status.inlines.hh
+|   |-- Box_Status_inlines.hh
 |   |-- COPYING.cc.dist
 |   |-- COPYING.hh.dist
 |   |-- CO_Tree.cc
-|   |-- CO_Tree.defs.hh
-|   |-- CO_Tree.inlines.hh
-|   |-- CO_Tree.templates.hh
-|   |-- CO_Tree.types.hh
+|   |-- CO_Tree_defs.hh
+|   |-- CO_Tree_inlines.hh
+|   |-- CO_Tree_templates.hh
+|   |-- CO_Tree_types.hh
 |   |-- CREDITS.cc.dist
 |   |-- CREDITS.hh.dist
 |   |-- C_Integer.hh
 |   |-- C_Polyhedron.cc
-|   |-- C_Polyhedron.defs.hh
-|   |-- C_Polyhedron.inlines.hh
-|   |-- C_Polyhedron.types.hh
-|   |-- Cast_Floating_Point_Expression.defs.hh
-|   |-- Cast_Floating_Point_Expression.inlines.hh
-|   |-- Cast_Floating_Point_Expression.templates.hh
-|   |-- Cast_Floating_Point_Expression.types.hh
+|   |-- C_Polyhedron_defs.hh
+|   |-- C_Polyhedron_inlines.hh
+|   |-- C_Polyhedron_types.hh
+|   |-- Cast_Floating_Point_Expression_defs.hh
+|   |-- Cast_Floating_Point_Expression_inlines.hh
+|   |-- Cast_Floating_Point_Expression_templates.hh
+|   |-- Cast_Floating_Point_Expression_types.hh
 |   |-- Checked_Number.cc
-|   |-- Checked_Number.defs.hh
-|   |-- Checked_Number.inlines.hh
-|   |-- Checked_Number.templates.hh
-|   |-- Checked_Number.types.hh
+|   |-- Checked_Number_defs.hh
+|   |-- Checked_Number_inlines.hh
+|   |-- Checked_Number_templates.hh
+|   |-- Checked_Number_types.hh
 |   |-- Coefficient.cc
-|   |-- Coefficient.defs.hh
-|   |-- Coefficient.inlines.hh
-|   |-- Coefficient.types.hh
+|   |-- Coefficient_defs.hh
+|   |-- Coefficient_inlines.hh
+|   |-- Coefficient_types.hh
 |   |-- Coefficient_traits_template.hh
 |   |-- Concrete_Expression.cc
-|   |-- Concrete_Expression.defs.hh
-|   |-- Concrete_Expression.inlines.hh
-|   |-- Concrete_Expression.types.hh
+|   |-- Concrete_Expression_defs.hh
+|   |-- Concrete_Expression_inlines.hh
+|   |-- Concrete_Expression_types.hh
 |   |-- Congruence.cc
-|   |-- Congruence.defs.hh
-|   |-- Congruence.inlines.hh
-|   |-- Congruence.types.hh
+|   |-- Congruence_defs.hh
+|   |-- Congruence_inlines.hh
+|   |-- Congruence_types.hh
 |   |-- Congruence_System.cc
-|   |-- Congruence_System.defs.hh
-|   |-- Congruence_System.inlines.hh
-|   |-- Congruence_System.types.hh
-|   |-- Constant_Floating_Point_Expression.defs.hh
-|   |-- Constant_Floating_Point_Expression.inlines.hh
-|   |-- Constant_Floating_Point_Expression.types.hh
+|   |-- Congruence_System_defs.hh
+|   |-- Congruence_System_inlines.hh
+|   |-- Congruence_System_types.hh
+|   |-- Constant_Floating_Point_Expression_defs.hh
+|   |-- Constant_Floating_Point_Expression_inlines.hh
+|   |-- Constant_Floating_Point_Expression_types.hh
 |   |-- Constraint.cc
-|   |-- Constraint.defs.hh
-|   |-- Constraint.inlines.hh
-|   |-- Constraint.types.hh
+|   |-- Constraint_defs.hh
+|   |-- Constraint_inlines.hh
+|   |-- Constraint_types.hh
 |   |-- Constraint_System.cc
-|   |-- Constraint_System.defs.hh
-|   |-- Constraint_System.inlines.hh
-|   |-- Constraint_System.types.hh
-|   |-- DB_Matrix.defs.hh
-|   |-- DB_Matrix.inlines.hh
-|   |-- DB_Matrix.templates.hh
-|   |-- DB_Matrix.types.hh
-|   |-- DB_Row.defs.hh
-|   |-- DB_Row.inlines.hh
-|   |-- DB_Row.templates.hh
-|   |-- DB_Row.types.hh
+|   |-- Constraint_System_defs.hh
+|   |-- Constraint_System_inlines.hh
+|   |-- Constraint_System_types.hh
+|   |-- DB_Matrix_defs.hh
+|   |-- DB_Matrix_inlines.hh
+|   |-- DB_Matrix_templates.hh
+|   |-- DB_Matrix_types.hh
+|   |-- DB_Row_defs.hh
+|   |-- DB_Row_inlines.hh
+|   |-- DB_Row_templates.hh
+|   |-- DB_Row_types.hh
 |   |-- Dense_Row.cc
-|   |-- Dense_Row.defs.hh
-|   |-- Dense_Row.inlines.hh
-|   |-- Dense_Row.templates.hh
-|   |-- Dense_Row.types.hh
-|   |-- Determinate.defs.hh
-|   |-- Determinate.inlines.hh
-|   |-- Determinate.types.hh
-|   |-- Difference_Floating_Point_Expression.defs.hh
-|   |-- Difference_Floating_Point_Expression.inlines.hh
-|   |-- Difference_Floating_Point_Expression.templates.hh
-|   |-- Difference_Floating_Point_Expression.types.hh
-|   |-- Division_Floating_Point_Expression.defs.hh
-|   |-- Division_Floating_Point_Expression.inlines.hh
-|   |-- Division_Floating_Point_Expression.templates.hh
-|   |-- Division_Floating_Point_Expression.types.hh
-|   |-- Doubly_Linked_Object.defs.hh
-|   |-- Doubly_Linked_Object.inlines.hh
-|   |-- Doubly_Linked_Object.types.hh
-|   |-- EList.defs.hh
-|   |-- EList.inlines.hh
-|   |-- EList.types.hh
-|   |-- EList_Iterator.defs.hh
-|   |-- EList_Iterator.inlines.hh
-|   |-- EList_Iterator.types.hh
-|   |-- Expression_Hide_Inhomo.defs.hh
-|   |-- Expression_Hide_Inhomo.inlines.hh
-|   |-- Expression_Hide_Inhomo.types.hh
-|   |-- Expression_Hide_Last.defs.hh
-|   |-- Expression_Hide_Last.inlines.hh
-|   |-- Expression_Hide_Last.types.hh
+|   |-- Dense_Row_defs.hh
+|   |-- Dense_Row_inlines.hh
+|   |-- Dense_Row_templates.hh
+|   |-- Dense_Row_types.hh
+|   |-- Determinate_defs.hh
+|   |-- Determinate_inlines.hh
+|   |-- Determinate_types.hh
+|   |-- Difference_Floating_Point_Expression_defs.hh
+|   |-- Difference_Floating_Point_Expression_inlines.hh
+|   |-- Difference_Floating_Point_Expression_templates.hh
+|   |-- Difference_Floating_Point_Expression_types.hh
+|   |-- Division_Floating_Point_Expression_defs.hh
+|   |-- Division_Floating_Point_Expression_inlines.hh
+|   |-- Division_Floating_Point_Expression_templates.hh
+|   |-- Division_Floating_Point_Expression_types.hh
+|   |-- Doubly_Linked_Object_defs.hh
+|   |-- Doubly_Linked_Object_inlines.hh
+|   |-- Doubly_Linked_Object_types.hh
+|   |-- EList_defs.hh
+|   |-- EList_inlines.hh
+|   |-- EList_types.hh
+|   |-- EList_Iterator_defs.hh
+|   |-- EList_Iterator_inlines.hh
+|   |-- EList_Iterator_types.hh
+|   |-- Expression_Hide_Inhomo_defs.hh
+|   |-- Expression_Hide_Inhomo_inlines.hh
+|   |-- Expression_Hide_Inhomo_types.hh
+|   |-- Expression_Hide_Last_defs.hh
+|   |-- Expression_Hide_Last_inlines.hh
+|   |-- Expression_Hide_Last_types.hh
 |   |-- Float.cc
-|   |-- Float.defs.hh
-|   |-- Float.inlines.hh
-|   |-- Float.templates.hh
-|   |-- Floating_Point_Expression.defs.hh
-|   |-- Floating_Point_Expression.inlines.hh
-|   |-- Floating_Point_Expression.templates.hh
-|   |-- Floating_Point_Expression.types.hh
-|   |-- GMP_Integer.defs.hh
-|   |-- GMP_Integer.inlines.hh
-|   |-- GMP_Integer.types.hh
+|   |-- Float_defs.hh
+|   |-- Float_inlines.hh
+|   |-- Float_templates.hh
+|   |-- Floating_Point_Expression_defs.hh
+|   |-- Floating_Point_Expression_inlines.hh
+|   |-- Floating_Point_Expression_templates.hh
+|   |-- Floating_Point_Expression_types.hh
+|   |-- GMP_Integer_defs.hh
+|   |-- GMP_Integer_inlines.hh
+|   |-- GMP_Integer_types.hh
 |   |-- Generator.cc
-|   |-- Generator.defs.hh
-|   |-- Generator.inlines.hh
-|   |-- Generator.types.hh
+|   |-- Generator_defs.hh
+|   |-- Generator_inlines.hh
+|   |-- Generator_types.hh
 |   |-- Generator_System.cc
-|   |-- Generator_System.defs.hh
-|   |-- Generator_System.inlines.hh
-|   |-- Generator_System.types.hh
-|   |-- Grid.defs.hh
-|   |-- Grid.inlines.hh
-|   |-- Grid.templates.hh
-|   |-- Grid.types.hh
+|   |-- Generator_System_defs.hh
+|   |-- Generator_System_inlines.hh
+|   |-- Generator_System_types.hh
+|   |-- Grid_defs.hh
+|   |-- Grid_inlines.hh
+|   |-- Grid_templates.hh
+|   |-- Grid_types.hh
 |   |-- Grid_Certificate.cc
-|   |-- Grid_Certificate.defs.hh
-|   |-- Grid_Certificate.inlines.hh
-|   |-- Grid_Certificate.types.hh
+|   |-- Grid_Certificate_defs.hh
+|   |-- Grid_Certificate_inlines.hh
+|   |-- Grid_Certificate_types.hh
 |   |-- Grid_Generator.cc
-|   |-- Grid_Generator.defs.hh
-|   |-- Grid_Generator.inlines.hh
-|   |-- Grid_Generator.types.hh
+|   |-- Grid_Generator_defs.hh
+|   |-- Grid_Generator_inlines.hh
+|   |-- Grid_Generator_types.hh
 |   |-- Grid_Generator_System.cc
-|   |-- Grid_Generator_System.defs.hh
-|   |-- Grid_Generator_System.inlines.hh
-|   |-- Grid_Generator_System.types.hh
+|   |-- Grid_Generator_System_defs.hh
+|   |-- Grid_Generator_System_inlines.hh
+|   |-- Grid_Generator_System_types.hh
 |   |-- Grid_Status.cc
 |   |-- Grid_Status.idefs.hh
-|   |-- Grid_Status.inlines.hh
+|   |-- Grid_Status_inlines.hh
 |   |-- Grid_chdims.cc
 |   |-- Grid_conversion.cc
 |   |-- Grid_nonpublic.cc
@@ -876,255 +876,255 @@ ppl-1.0
 |   |-- Grid_simplify.cc
 |   |-- Grid_widenings.cc
 |   |-- H79_Certificate.cc
-|   |-- H79_Certificate.defs.hh
-|   |-- H79_Certificate.inlines.hh
-|   |-- H79_Certificate.types.hh
-|   |-- Handler.defs.hh
-|   |-- Handler.inlines.hh
-|   |-- Handler.types.hh
+|   |-- H79_Certificate_defs.hh
+|   |-- H79_Certificate_inlines.hh
+|   |-- H79_Certificate_types.hh
+|   |-- Handler_defs.hh
+|   |-- Handler_inlines.hh
+|   |-- Handler_types.hh
 |   |-- Has_Assign_Or_Swap.hh
 |   |-- Init.cc
-|   |-- Init.defs.hh
-|   |-- Init.inlines.hh
-|   |-- Init.types.hh
+|   |-- Init_defs.hh
+|   |-- Init_inlines.hh
+|   |-- Init_types.hh
 |   |-- Integer_Interval.hh
-|   |-- Interval.defs.hh
-|   |-- Interval.inlines.hh
-|   |-- Interval.templates.hh
-|   |-- Interval.types.hh
-|   |-- Interval_Info.defs.hh
-|   |-- Interval_Info.inlines.hh
-|   |-- Interval_Info.types.hh
+|   |-- Interval_defs.hh
+|   |-- Interval_inlines.hh
+|   |-- Interval_templates.hh
+|   |-- Interval_types.hh
+|   |-- Interval_Info_defs.hh
+|   |-- Interval_Info_inlines.hh
+|   |-- Interval_Info_types.hh
 |   |-- Linear_Expression.cc
-|   |-- Linear_Expression.defs.hh
-|   |-- Linear_Expression.inlines.hh
-|   |-- Linear_Expression.types.hh
+|   |-- Linear_Expression_defs.hh
+|   |-- Linear_Expression_inlines.hh
+|   |-- Linear_Expression_types.hh
 |   |-- Linear_Expression_Impl.cc
-|   |-- Linear_Expression_Impl.defs.hh
-|   |-- Linear_Expression_Impl.inlines.hh
-|   |-- Linear_Expression_Impl.templates.hh
-|   |-- Linear_Expression_Impl.types.hh
+|   |-- Linear_Expression_Impl_defs.hh
+|   |-- Linear_Expression_Impl_inlines.hh
+|   |-- Linear_Expression_Impl_templates.hh
+|   |-- Linear_Expression_Impl_types.hh
 |   |-- Linear_Expression_Interface.cc
-|   |-- Linear_Expression_Interface.defs.hh
-|   |-- Linear_Expression_Interface.types.hh
+|   |-- Linear_Expression_Interface_defs.hh
+|   |-- Linear_Expression_Interface_types.hh
 |   |-- Linear_Form.cc
-|   |-- Linear_Form.defs.hh
-|   |-- Linear_Form.inlines.hh
-|   |-- Linear_Form.templates.hh
-|   |-- Linear_Form.types.hh
-|   |-- Linear_System.defs.hh
-|   |-- Linear_System.inlines.hh
-|   |-- Linear_System.templates.hh
-|   |-- Linear_System.types.hh
+|   |-- Linear_Form_defs.hh
+|   |-- Linear_Form_inlines.hh
+|   |-- Linear_Form_templates.hh
+|   |-- Linear_Form_types.hh
+|   |-- Linear_System_defs.hh
+|   |-- Linear_System_inlines.hh
+|   |-- Linear_System_templates.hh
+|   |-- Linear_System_types.hh
 |   |-- MIP_Problem.cc
-|   |-- MIP_Problem.defs.hh
-|   |-- MIP_Problem.inlines.hh
-|   |-- MIP_Problem.templates.hh
-|   |-- MIP_Problem.types.hh
+|   |-- MIP_Problem_defs.hh
+|   |-- MIP_Problem_inlines.hh
+|   |-- MIP_Problem_templates.hh
+|   |-- MIP_Problem_types.hh
 |   |-- Makefile.am
 |   |-- Makefile.in
-|   |-- Matrix.defs.hh
-|   |-- Matrix.inlines.hh
-|   |-- Matrix.templates.hh
-|   |-- Matrix.types.hh
-|   |-- Multiplication_Floating_Point_Expression.defs.hh
-|   |-- Multiplication_Floating_Point_Expression.inlines.hh
-|   |-- Multiplication_Floating_Point_Expression.templates.hh
-|   |-- Multiplication_Floating_Point_Expression.types.hh
+|   |-- Matrix_defs.hh
+|   |-- Matrix_inlines.hh
+|   |-- Matrix_templates.hh
+|   |-- Matrix_types.hh
+|   |-- Multiplication_Floating_Point_Expression_defs.hh
+|   |-- Multiplication_Floating_Point_Expression_inlines.hh
+|   |-- Multiplication_Floating_Point_Expression_templates.hh
+|   |-- Multiplication_Floating_Point_Expression_types.hh
 |   |-- NNC_Polyhedron.cc
-|   |-- NNC_Polyhedron.defs.hh
-|   |-- NNC_Polyhedron.inlines.hh
-|   |-- NNC_Polyhedron.types.hh
-|   |-- Numeric_Format.defs.hh
-|   |-- OR_Matrix.defs.hh
-|   |-- OR_Matrix.inlines.hh
-|   |-- OR_Matrix.templates.hh
-|   |-- OR_Matrix.types.hh
+|   |-- NNC_Polyhedron_defs.hh
+|   |-- NNC_Polyhedron_inlines.hh
+|   |-- NNC_Polyhedron_types.hh
+|   |-- Numeric_Format_defs.hh
+|   |-- OR_Matrix_defs.hh
+|   |-- OR_Matrix_inlines.hh
+|   |-- OR_Matrix_templates.hh
+|   |-- OR_Matrix_types.hh
 |   |-- Octagonal_Shape.cc
-|   |-- Octagonal_Shape.defs.hh
-|   |-- Octagonal_Shape.inlines.hh
-|   |-- Octagonal_Shape.templates.hh
-|   |-- Octagonal_Shape.types.hh
+|   |-- Octagonal_Shape_defs.hh
+|   |-- Octagonal_Shape_inlines.hh
+|   |-- Octagonal_Shape_templates.hh
+|   |-- Octagonal_Shape_types.hh
 |   |-- Og_Status.idefs.hh
-|   |-- Og_Status.inlines.hh
-|   |-- Opposite_Floating_Point_Expression.defs.hh
-|   |-- Opposite_Floating_Point_Expression.inlines.hh
-|   |-- Opposite_Floating_Point_Expression.types.hh
+|   |-- Og_Status_inlines.hh
+|   |-- Opposite_Floating_Point_Expression_defs.hh
+|   |-- Opposite_Floating_Point_Expression_inlines.hh
+|   |-- Opposite_Floating_Point_Expression_types.hh
 |   |-- PIP_Problem.cc
-|   |-- PIP_Problem.defs.hh
-|   |-- PIP_Problem.inlines.hh
-|   |-- PIP_Problem.templates.hh
-|   |-- PIP_Problem.types.hh
+|   |-- PIP_Problem_defs.hh
+|   |-- PIP_Problem_inlines.hh
+|   |-- PIP_Problem_templates.hh
+|   |-- PIP_Problem_types.hh
 |   |-- PIP_Tree.cc
-|   |-- PIP_Tree.defs.hh
-|   |-- PIP_Tree.inlines.hh
-|   |-- PIP_Tree.types.hh
+|   |-- PIP_Tree_defs.hh
+|   |-- PIP_Tree_inlines.hh
+|   |-- PIP_Tree_types.hh
 |   |-- Partial_Function.cc
-|   |-- Partial_Function.defs.hh
-|   |-- Partial_Function.inlines.hh
-|   |-- Partial_Function.types.hh
-|   |-- Partially_Reduced_Product.defs.hh
-|   |-- Partially_Reduced_Product.inlines.hh
-|   |-- Partially_Reduced_Product.templates.hh
-|   |-- Partially_Reduced_Product.types.hh
-|   |-- Pending_Element.defs.hh
-|   |-- Pending_Element.inlines.hh
-|   |-- Pending_Element.types.hh
-|   |-- Pending_List.defs.hh
-|   |-- Pending_List.inlines.hh
-|   |-- Pending_List.templates.hh
-|   |-- Pending_List.types.hh
+|   |-- Partial_Function_defs.hh
+|   |-- Partial_Function_inlines.hh
+|   |-- Partial_Function_types.hh
+|   |-- Partially_Reduced_Product_defs.hh
+|   |-- Partially_Reduced_Product_inlines.hh
+|   |-- Partially_Reduced_Product_templates.hh
+|   |-- Partially_Reduced_Product_types.hh
+|   |-- Pending_Element_defs.hh
+|   |-- Pending_Element_inlines.hh
+|   |-- Pending_Element_types.hh
+|   |-- Pending_List_defs.hh
+|   |-- Pending_List_inlines.hh
+|   |-- Pending_List_templates.hh
+|   |-- Pending_List_types.hh
 |   |-- Ph_Status.cc
 |   |-- Ph_Status.idefs.hh
-|   |-- Ph_Status.inlines.hh
+|   |-- Ph_Status_inlines.hh
 |   |-- Pointset_Powerset.cc
-|   |-- Pointset_Powerset.defs.hh
-|   |-- Pointset_Powerset.inlines.hh
-|   |-- Pointset_Powerset.templates.hh
-|   |-- Pointset_Powerset.types.hh
+|   |-- Pointset_Powerset_defs.hh
+|   |-- Pointset_Powerset_inlines.hh
+|   |-- Pointset_Powerset_templates.hh
+|   |-- Pointset_Powerset_types.hh
 |   |-- Poly_Con_Relation.cc
-|   |-- Poly_Con_Relation.defs.hh
-|   |-- Poly_Con_Relation.inlines.hh
-|   |-- Poly_Con_Relation.types.hh
+|   |-- Poly_Con_Relation_defs.hh
+|   |-- Poly_Con_Relation_inlines.hh
+|   |-- Poly_Con_Relation_types.hh
 |   |-- Poly_Gen_Relation.cc
-|   |-- Poly_Gen_Relation.defs.hh
-|   |-- Poly_Gen_Relation.inlines.hh
-|   |-- Poly_Gen_Relation.types.hh
-|   |-- Polyhedron.defs.hh
-|   |-- Polyhedron.inlines.hh
-|   |-- Polyhedron.templates.hh
-|   |-- Polyhedron.types.hh
+|   |-- Poly_Gen_Relation_defs.hh
+|   |-- Poly_Gen_Relation_inlines.hh
+|   |-- Poly_Gen_Relation_types.hh
+|   |-- Polyhedron_defs.hh
+|   |-- Polyhedron_inlines.hh
+|   |-- Polyhedron_templates.hh
+|   |-- Polyhedron_types.hh
 |   |-- Polyhedron_chdims.cc
-|   |-- Polyhedron_chdims.templates.hh
-|   |-- Polyhedron_conversion.templates.hh
-|   |-- Polyhedron_minimize.templates.hh
+|   |-- Polyhedron_chdims_templates.hh
+|   |-- Polyhedron_conversion_templates.hh
+|   |-- Polyhedron_minimize_templates.hh
 |   |-- Polyhedron_nonpublic.cc
 |   |-- Polyhedron_public.cc
-|   |-- Polyhedron_simplify.templates.hh
+|   |-- Polyhedron_simplify_templates.hh
 |   |-- Polyhedron_widenings.cc
-|   |-- Powerset.defs.hh
-|   |-- Powerset.inlines.hh
-|   |-- Powerset.templates.hh
-|   |-- Powerset.types.hh
-|   |-- Ptr_Iterator.defs.hh
-|   |-- Ptr_Iterator.inlines.hh
-|   |-- Ptr_Iterator.types.hh
+|   |-- Powerset_defs.hh
+|   |-- Powerset_inlines.hh
+|   |-- Powerset_templates.hh
+|   |-- Powerset_types.hh
+|   |-- Ptr_Iterator_defs.hh
+|   |-- Ptr_Iterator_inlines.hh
+|   |-- Ptr_Iterator_types.hh
 |   |-- Rational_Box.hh
 |   |-- Rational_Interval.hh
-|   |-- Result.defs.hh
-|   |-- Result.inlines.hh
-|   |-- Rounding_Dir.defs.hh
-|   |-- Rounding_Dir.inlines.hh
+|   |-- Result_defs.hh
+|   |-- Result_inlines.hh
+|   |-- Rounding_Dir_defs.hh
+|   |-- Rounding_Dir_inlines.hh
 |   |-- Scalar_Products.cc
-|   |-- Scalar_Products.defs.hh
-|   |-- Scalar_Products.inlines.hh
-|   |-- Scalar_Products.types.hh
+|   |-- Scalar_Products_defs.hh
+|   |-- Scalar_Products_inlines.hh
+|   |-- Scalar_Products_types.hh
 |   |-- Slow_Copy.hh
 |   |-- Sparse_Row.cc
-|   |-- Sparse_Row.defs.hh
-|   |-- Sparse_Row.inlines.hh
-|   |-- Sparse_Row.templates.hh
-|   |-- Sparse_Row.types.hh
-|   |-- Sum_Floating_Point_Expression.defs.hh
-|   |-- Sum_Floating_Point_Expression.inlines.hh
-|   |-- Sum_Floating_Point_Expression.templates.hh
-|   |-- Sum_Floating_Point_Expression.types.hh
-|   |-- Swapping_Vector.defs.hh
-|   |-- Swapping_Vector.inlines.hh
-|   |-- Swapping_Vector.types.hh
-|   |-- Temp.defs.hh
-|   |-- Temp.inlines.hh
-|   |-- Temp.templates.hh
+|   |-- Sparse_Row_defs.hh
+|   |-- Sparse_Row_inlines.hh
+|   |-- Sparse_Row_templates.hh
+|   |-- Sparse_Row_types.hh
+|   |-- Sum_Floating_Point_Expression_defs.hh
+|   |-- Sum_Floating_Point_Expression_inlines.hh
+|   |-- Sum_Floating_Point_Expression_templates.hh
+|   |-- Sum_Floating_Point_Expression_types.hh
+|   |-- Swapping_Vector_defs.hh
+|   |-- Swapping_Vector_inlines.hh
+|   |-- Swapping_Vector_types.hh
+|   |-- Temp_defs.hh
+|   |-- Temp_inlines.hh
+|   |-- Temp_templates.hh
 |   |-- Threshold_Watcher.cc
-|   |-- Threshold_Watcher.defs.hh
-|   |-- Threshold_Watcher.inlines.hh
-|   |-- Threshold_Watcher.templates.hh
-|   |-- Threshold_Watcher.types.hh
+|   |-- Threshold_Watcher_defs.hh
+|   |-- Threshold_Watcher_inlines.hh
+|   |-- Threshold_Watcher_templates.hh
+|   |-- Threshold_Watcher_types.hh
 |   |-- Time.cc
-|   |-- Time.defs.hh
-|   |-- Time.inlines.hh
-|   |-- Time.types.hh
-|   |-- Topology.types.hh
+|   |-- Time_defs.hh
+|   |-- Time_inlines.hh
+|   |-- Time_types.hh
+|   |-- Topology_types.hh
 |   |-- Variable.cc
-|   |-- Variable.defs.hh
-|   |-- Variable.inlines.hh
-|   |-- Variable.types.hh
-|   |-- Variable_Floating_Point_Expression.defs.hh
-|   |-- Variable_Floating_Point_Expression.inlines.hh
-|   |-- Variable_Floating_Point_Expression.types.hh
+|   |-- Variable_defs.hh
+|   |-- Variable_inlines.hh
+|   |-- Variable_types.hh
+|   |-- Variable_Floating_Point_Expression_defs.hh
+|   |-- Variable_Floating_Point_Expression_inlines.hh
+|   |-- Variable_Floating_Point_Expression_types.hh
 |   |-- Variables_Set.cc
-|   |-- Variables_Set.defs.hh
-|   |-- Variables_Set.inlines.hh
-|   |-- Variables_Set.types.hh
-|   |-- WRD_coefficient_types.defs.hh
-|   |-- WRD_coefficient_types.inlines.hh
+|   |-- Variables_Set_defs.hh
+|   |-- Variables_Set_inlines.hh
+|   |-- Variables_Set_types.hh
+|   |-- WRD_coefficient_types_defs.hh
+|   |-- WRD_coefficient_types_inlines.hh
 |   |-- Watchdog.cc
-|   |-- Watchdog.defs.hh
-|   |-- Watchdog.inlines.hh
-|   |-- Watchdog.types.hh
+|   |-- Watchdog_defs.hh
+|   |-- Watchdog_inlines.hh
+|   |-- Watchdog_types.hh
 |   |-- Weight_Profiler.cc
-|   |-- Weight_Profiler.defs.hh
-|   |-- Widening_Function.defs.hh
-|   |-- Widening_Function.inlines.hh
-|   |-- Widening_Function.types.hh
+|   |-- Weight_Profiler_defs.hh
+|   |-- Widening_Function_defs.hh
+|   |-- Widening_Function_inlines.hh
+|   |-- Widening_Function_types.hh
 |   |-- algorithms.hh
 |   |-- assert.cc
 |   |-- assert.hh
 |   |-- assign_or_swap.hh
 |   |-- c_streambuf.cc
-|   |-- c_streambuf.defs.hh
-|   |-- c_streambuf.inlines.hh
-|   |-- c_streambuf.types.hh
+|   |-- c_streambuf_defs.hh
+|   |-- c_streambuf_inlines.hh
+|   |-- c_streambuf_types.hh
 |   |-- checked.cc
-|   |-- checked.defs.hh
-|   |-- checked.inlines.hh
-|   |-- checked_ext.inlines.hh
-|   |-- checked_float.inlines.hh
-|   |-- checked_int.inlines.hh
-|   |-- checked_mpq.inlines.hh
-|   |-- checked_mpz.inlines.hh
+|   |-- checked_defs.hh
+|   |-- checked_inlines.hh
+|   |-- checked_ext_inlines.hh
+|   |-- checked_float_inlines.hh
+|   |-- checked_int_inlines.hh
+|   |-- checked_mpq_inlines.hh
+|   |-- checked_mpz_inlines.hh
 |   |-- checked_numeric_limits.hh
 |   |-- compiler.hh
-|   |-- distances.defs.hh
-|   |-- distances.inlines.hh
-|   |-- distances.types.hh
-|   |-- fpu-c99.inlines.hh
+|   |-- distances_defs.hh
+|   |-- distances_inlines.hh
+|   |-- distances_types.hh
+|   |-- fpu-c99_inlines.hh
 |   |-- fpu-ia32.cc
-|   |-- fpu-ia32.inlines.hh
-|   |-- fpu-none.inlines.hh
-|   |-- fpu-sparc.inlines.hh
-|   |-- fpu.defs.hh
-|   |-- fpu.types.hh
+|   |-- fpu-ia32_inlines.hh
+|   |-- fpu-none_inlines.hh
+|   |-- fpu-sparc_inlines.hh
+|   |-- fpu_defs.hh
+|   |-- fpu_types.hh
 |   |-- globals.cc
-|   |-- globals.defs.hh
-|   |-- globals.inlines.hh
-|   |-- globals.types.hh
+|   |-- globals_defs.hh
+|   |-- globals_inlines.hh
+|   |-- globals_types.hh
 |   |-- initializer.hh
-|   |-- intervals.defs.hh
-|   |-- iterator_to_const.defs.hh
-|   |-- iterator_to_const.inlines.hh
-|   |-- iterator_to_const.types.hh
+|   |-- intervals_defs.hh
+|   |-- iterator_to_const_defs.hh
+|   |-- iterator_to_const_inlines.hh
+|   |-- iterator_to_const_types.hh
 |   |-- linearize.hh
-|   |-- math_utilities.defs.hh
-|   |-- math_utilities.inlines.hh
+|   |-- math_utilities_defs.hh
+|   |-- math_utilities_inlines.hh
 |   |-- max_space_dimension.hh
 |   |-- meta_programming.hh
 |   |-- mp_std_bits.cc
-|   |-- mp_std_bits.defs.hh
-|   |-- mp_std_bits.inlines.hh
+|   |-- mp_std_bits_defs.hh
+|   |-- mp_std_bits_inlines.hh
 |   |-- namespaces.hh
 |   |-- ppl-config.cc.in
 |   |-- ppl.hh.dist
 |   |-- ppl_header.hh
 |   |-- stdiobuf.cc
-|   |-- stdiobuf.defs.hh
-|   |-- stdiobuf.inlines.hh
-|   |-- stdiobuf.types.hh
-|   |-- swapping_sort.templates.hh
+|   |-- stdiobuf_defs.hh
+|   |-- stdiobuf_inlines.hh
+|   |-- stdiobuf_types.hh
+|   |-- swapping_sort_templates.hh
 |   |-- termination.cc
-|   |-- termination.defs.hh
-|   |-- termination.templates.hh
-|   |-- termination.types.hh
+|   |-- termination_defs.hh
+|   |-- termination_templates.hh
+|   |-- termination_types.hh
 |   |-- version.cc
 |   |-- version.hh.in
 |   |-- wrap_assign.hh
@@ -1284,8 +1284,8 @@ ppl-1.0
 |   |   `-- cotree1.cc
 |   |-- Concrete_Expression
 |   |   |-- C_Expr.cc
-|   |   |-- C_Expr.defs.hh
-|   |   |-- C_Expr.inlines.hh
+|   |   |-- C_Expr_defs.hh
+|   |   |-- C_Expr_inlines.hh
 |   |   |-- Makefile.am
 |   |   |-- Makefile.in
 |   |   |-- bdshape1.cc
@@ -1711,9 +1711,9 @@ ppl-1.0
 |   |   |-- universe1.cc
 |   |   `-- upperbound1.cc
 |   |-- README
-|   |-- Random_Number_Generator.defs.hh
-|   |-- Random_Number_Generator.inlines.hh
-|   |-- Random_Number_Generator.types.hh
+|   |-- Random_Number_Generator_defs.hh
+|   |-- Random_Number_Generator_inlines.hh
+|   |-- Random_Number_Generator_types.hh
 |   |-- Watchdog
 |   |   |-- Makefile.am
 |   |   |-- Makefile.in
@@ -1737,7 +1737,7 @@ ppl-1.0
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/README.alpha b/README.alpha
index 5e9e6fa..490756c 100644
--- a/README.alpha
+++ b/README.alpha
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -28,7 +28,7 @@ should probably not worry.  Your mileage may vary...
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/README.arm b/README.arm
index 18e2bad..435baae 100644
--- a/README.arm
+++ b/README.arm
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -23,7 +23,7 @@ For example:
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/README.configure b/README.configure
index 7181c84..54268f8 100644
--- a/README.configure
+++ b/README.configure
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -400,7 +400,7 @@ If desired, these default values can be customized to user's needs by
 changing just a few lines of library code. For instance, the
 constraint systems stored inside C_Polyhedron and NNC_Polyhedron
 objects can be made to use the sparse representation by just changing
-the following line in Polyhedron.defs.hh:
+the following line in Polyhedron_defs.hh:
 
   static const Representation default_con_sys_repr = DENSE;
 
@@ -488,7 +488,7 @@ you cannot explain otherwise, use `autoreconf -f'.
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/README.solaris b/README.solaris
index ead4a76..f940c14 100644
--- a/README.solaris
+++ b/README.solaris
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -19,7 +19,7 @@ This is recommended, even if only the C++ language interface is used.
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/STANDARDS b/STANDARDS
index ea09010..a73e161 100644
--- a/STANDARDS
+++ b/STANDARDS
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -136,13 +136,13 @@ Use `!' to negate a value.
 
 For example, use
 
-	if (!ph.is_empty())
-	   std::cout << "ph contains at least one point" << endl;
+        if (!ph.is_empty())
+           std::cout << "ph contains at least one point" << endl;
 
 instead of
 
-	if (ph.is_empty() == false)
-	   std::cout << "ph contains at least one point" << endl;
+        if (ph.is_empty() == false)
+           std::cout << "ph contains at least one point" << endl;
 
 
 Comparison with zero
@@ -152,11 +152,11 @@ Be explicit when comparing a value with zero in a conditional context.
 
 For example, use
 
-	assert(sys.num_rows() != 0);
+        assert(sys.num_rows() != 0);
 
 instead of
 
-	assert(sys.num_rows());
+        assert(sys.num_rows());
 
 
 Formatting Conventions
@@ -249,20 +249,20 @@ developer of the library should be provided with a set of source files
 whose filenames start with `Xtype'. The source files for such a type
 should be named and populated as follows:
 
-a) Xtype.types.hh
+a) Xtype_types.hh
 Contains the forward declarations of type names (in particular, the
 one for `Xtype') and other useful typedef's.
 
-b) Xtype.defs.hh
+b) Xtype_defs.hh
 Contains the definition of the type, together with the declaration of
 any function that, even though not being formally part of the type, is
 nonetheless related to it and should therefore be considered part of
 its interface.
 
-c) Xtype.inlines.hh
+c) Xtype_inlines.hh
 Contains the definitions of inline functions.
 
-d) Xtype.templates.hh
+d) Xtype_templates.hh
 Contains the non-inline definitions of all class template members and
 all (member or non-member) function templates that are not fully
 specialized.
@@ -277,8 +277,8 @@ Polyhedron_public.cc, Polyhedron_nonpublic.cc, Polyhedron_chdims.cc
 and Polyhedron_widenings.cc, or even conversion.cc, minimize.cc, etc.).
 
 Note that:
-  - all interface functions should be declared in Xtype.defs.hh;
-  - no function definition should be placed in Xtype.defs.hh;
+  - all interface functions should be declared in Xtype_defs.hh;
+  - no function definition should be placed in Xtype_defs.hh;
   - bare declarations should not be declared inline (i.e., inline directives
     should be placed only in front of the definition of the functions);
   - inner classes are usually kept in the same files as the outer class;
@@ -374,7 +374,7 @@ Standards for Documenting the Project with Doxygen
 
 5) In the source files, detailed comments should be placed together
    with the brief ones, so that all the documentation pertinent to a
-   code entity is kept in a single file (typically, the *.defs.hh file).
+   code entity is kept in a single file (typically, the *_defs.hh file).
 
 6) Brief Doxygen comments should be brief (indeed).
    If more than two lines are required, then the comment should be
@@ -384,7 +384,7 @@ Standards for Documenting the Project with Doxygen
    (but that are useful for the developers) should be surrounded by
 
      #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-	//! ... Doxygen comments ...
+        //! ... Doxygen comments ...
      #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 
    so that they will only appear in the developer's reference.
@@ -421,7 +421,7 @@ Standards for Documenting the Project with Doxygen
    It seems that, in order to correctly match function declarations
    and definitions, the \relates command should be placed in both places.
    Typically, this will be the only kind of Doxygen command
-   occurring in *.inlines.hh and *.cc source files.
+   occurring in *_inlines.hh and *.cc source files.
 
    If Classname is a template class, the arguments of the template
    (as well as the angle brackets) should be omitted.
@@ -708,7 +708,7 @@ o  Ideally the tests should exercise every line of code in the library.
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/aclocal.m4 b/aclocal.m4
index 1df5f6c..15739f3 100644
--- a/aclocal.m4
+++ b/aclocal.m4
@@ -1,8 +1,7 @@
-# generated automatically by aclocal 1.11.3 -*- Autoconf -*-
+# generated automatically by aclocal 1.12.6 -*- Autoconf -*-
+
+# Copyright (C) 1996-2012 Free Software Foundation, Inc.
 
-# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
-# 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation,
-# Inc.
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -18,27 +17,24 @@ m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.68],,
 [m4_warning([this file was generated for autoconf 2.68.
 You have another version of autoconf.  It may work, but is not guaranteed to.
 If you have problems, you may need to regenerate the build system entirely.
-To do so, use the procedure documented by the package, typically `autoreconf'.])])
+To do so, use the procedure documented by the package, typically 'autoreconf'.])])
 
-# Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 2002-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 1
-
 # AM_AUTOMAKE_VERSION(VERSION)
 # ----------------------------
 # Automake X.Y traces this macro to ensure aclocal.m4 has been
 # generated from the m4 files accompanying Automake X.Y.
 # (This private macro should not be called outside this file.)
 AC_DEFUN([AM_AUTOMAKE_VERSION],
-[am__api_version='1.11'
+[am__api_version='1.12'
 dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
 dnl require some minimum version.  Point them to the right macro.
-m4_if([$1], [1.11.3], [],
+m4_if([$1], [1.12.6], [],
       [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
 ])
 
@@ -54,24 +50,22 @@ m4_define([_AM_AUTOCONF_VERSION], [])
 # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
 # This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
 AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
-[AM_AUTOMAKE_VERSION([1.11.3])dnl
+[AM_AUTOMAKE_VERSION([1.12.6])dnl
 m4_ifndef([AC_AUTOCONF_VERSION],
   [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
 _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
 
 # AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-
 
-# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
+# Copyright (C) 2001-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 1
-
 # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
-# $ac_aux_dir to `$srcdir/foo'.  In other projects, it is set to
-# `$srcdir', `$srcdir/..', or `$srcdir/../..'.
+# $ac_aux_dir to '$srcdir/foo'.  In other projects, it is set to
+# '$srcdir', '$srcdir/..', or '$srcdir/../..'.
 #
 # Of course, Automake must honor this variable whenever it calls a
 # tool from the auxiliary directory.  The problem is that $srcdir (and
@@ -90,7 +84,7 @@ _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
 #
 # The reason of the latter failure is that $top_srcdir and $ac_aux_dir
 # are both prefixed by $srcdir.  In an in-source build this is usually
-# harmless because $srcdir is `.', but things will broke when you
+# harmless because $srcdir is '.', but things will broke when you
 # start a VPATH build or use an absolute $srcdir.
 #
 # So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
@@ -116,22 +110,19 @@ am_aux_dir=`cd $ac_aux_dir && pwd`
 
 # AM_CONDITIONAL                                            -*- Autoconf -*-
 
-# Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008
-# Free Software Foundation, Inc.
+# Copyright (C) 1997-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 9
-
 # AM_CONDITIONAL(NAME, SHELL-CONDITION)
 # -------------------------------------
 # Define a conditional.
 AC_DEFUN([AM_CONDITIONAL],
-[AC_PREREQ(2.52)dnl
- ifelse([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
-	[$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
+[AC_PREREQ([2.52])dnl
+ m4_if([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
+       [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
 AC_SUBST([$1_TRUE])dnl
 AC_SUBST([$1_FALSE])dnl
 _AM_SUBST_NOTMAKE([$1_TRUE])dnl
@@ -150,16 +141,14 @@ AC_CONFIG_COMMANDS_PRE(
 Usually this means the macro was only invoked conditionally.]])
 fi])])
 
-# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009,
-# 2010, 2011 Free Software Foundation, Inc.
+# Copyright (C) 1999-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 12
 
-# There are a few dirty hacks below to avoid letting `AC_PROG_CC' be
+# There are a few dirty hacks below to avoid letting 'AC_PROG_CC' be
 # written in clear, in which case automake, when reading aclocal.m4,
 # will think it sees a *use*, and therefore will trigger all it's
 # C support machinery.  Also note that it means that autoscan, seeing
@@ -169,7 +158,7 @@ fi])])
 # _AM_DEPENDENCIES(NAME)
 # ----------------------
 # See how the compiler implements dependency checking.
-# NAME is "CC", "CXX", "GCJ", or "OBJC".
+# NAME is "CC", "CXX", "OBJC", "OBJCXX", "UPC", or "GJC".
 # We try a few techniques and use that to set a single cache variable.
 #
 # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was
@@ -182,12 +171,13 @@ AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl
 AC_REQUIRE([AM_MAKE_INCLUDE])dnl
 AC_REQUIRE([AM_DEP_TRACK])dnl
 
-ifelse([$1], CC,   [depcc="$CC"   am_compiler_list=],
-       [$1], CXX,  [depcc="$CXX"  am_compiler_list=],
-       [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
-       [$1], UPC,  [depcc="$UPC"  am_compiler_list=],
-       [$1], GCJ,  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
-                   [depcc="$$1"   am_compiler_list=])
+m4_if([$1], [CC],   [depcc="$CC"   am_compiler_list=],
+      [$1], [CXX],  [depcc="$CXX"  am_compiler_list=],
+      [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
+      [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'],
+      [$1], [UPC],  [depcc="$UPC"  am_compiler_list=],
+      [$1], [GCJ],  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
+                    [depcc="$$1"   am_compiler_list=])
 
 AC_CACHE_CHECK([dependency style of $depcc],
                [am_cv_$1_dependencies_compiler_type],
@@ -195,8 +185,8 @@ AC_CACHE_CHECK([dependency style of $depcc],
   # We make a subdir and do the tests there.  Otherwise we can end up
   # making bogus files that we don't know about and never remove.  For
   # instance it was reported that on HP-UX the gcc test will end up
-  # making a dummy file named `D' -- because `-MD' means `put the output
-  # in D'.
+  # making a dummy file named 'D' -- because '-MD' means "put the output
+  # in D".
   rm -rf conftest.dir
   mkdir conftest.dir
   # Copy depcomp to subdir because otherwise we won't find it if we're
@@ -236,16 +226,16 @@ AC_CACHE_CHECK([dependency style of $depcc],
     : > sub/conftest.c
     for i in 1 2 3 4 5 6; do
       echo '#include "conftst'$i'.h"' >> sub/conftest.c
-      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
-      # Solaris 8's {/usr,}/bin/sh.
-      touch sub/conftst$i.h
+      # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with
+      # Solaris 10 /bin/sh.
+      echo '/* dummy */' > sub/conftst$i.h
     done
     echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
 
-    # We check with `-c' and `-o' for the sake of the "dashmstdout"
+    # We check with '-c' and '-o' for the sake of the "dashmstdout"
     # mode.  It turns out that the SunPro C++ compiler does not properly
-    # handle `-M -o', and we need to detect this.  Also, some Intel
-    # versions had trouble with output in subdirs
+    # handle '-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs.
     am__obj=sub/conftest.${OBJEXT-o}
     am__minus_obj="-o $am__obj"
     case $depmode in
@@ -254,8 +244,8 @@ AC_CACHE_CHECK([dependency style of $depcc],
       test "$am__universal" = false || continue
       ;;
     nosideeffect)
-      # after this tag, mechanisms are not by side-effect, so they'll
-      # only be used when explicitly requested
+      # After this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested.
       if test "x$enable_dependency_tracking" = xyes; then
 	continue
       else
@@ -263,7 +253,7 @@ AC_CACHE_CHECK([dependency style of $depcc],
       fi
       ;;
     msvc7 | msvc7msys | msvisualcpp | msvcmsys)
-      # This compiler won't grok `-c -o', but also, the minuso test has
+      # This compiler won't grok '-c -o', but also, the minuso test has
       # not run yet.  These depmodes are late enough in the game, and
       # so weak that their functioning should not be impacted.
       am__obj=conftest.${OBJEXT-o}
@@ -311,7 +301,7 @@ AM_CONDITIONAL([am__fastdep$1], [
 # AM_SET_DEPDIR
 # -------------
 # Choose a directory name for dependency files.
-# This macro is AC_REQUIREd in _AM_DEPENDENCIES
+# This macro is AC_REQUIREd in _AM_DEPENDENCIES.
 AC_DEFUN([AM_SET_DEPDIR],
 [AC_REQUIRE([AM_SET_LEADING_DOT])dnl
 AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
@@ -321,9 +311,13 @@ AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
 # AM_DEP_TRACK
 # ------------
 AC_DEFUN([AM_DEP_TRACK],
-[AC_ARG_ENABLE(dependency-tracking,
-[  --disable-dependency-tracking  speeds up one-time build
-  --enable-dependency-tracking   do not reject slow dependency extractors])
+[AC_ARG_ENABLE([dependency-tracking], [dnl
+AS_HELP_STRING(
+  [--enable-dependency-tracking],
+  [do not reject slow dependency extractors])
+AS_HELP_STRING(
+  [--disable-dependency-tracking],
+  [speeds up one-time build])])
 if test "x$enable_dependency_tracking" != xno; then
   am_depcomp="$ac_aux_dir/depcomp"
   AMDEPBACKSLASH='\'
@@ -338,14 +332,12 @@ _AM_SUBST_NOTMAKE([am__nodep])dnl
 
 # Generate code to set up dependency tracking.              -*- Autoconf -*-
 
-# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008
-# Free Software Foundation, Inc.
+# Copyright (C) 1999-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-#serial 5
 
 # _AM_OUTPUT_DEPENDENCY_COMMANDS
 # ------------------------------
@@ -364,7 +356,7 @@ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],
     # Strip MF so we end up with the name of the file.
     mf=`echo "$mf" | sed -e 's/:.*$//'`
     # Check whether this is an Automake generated Makefile or not.
-    # We used to match only the files named `Makefile.in', but
+    # We used to match only the files named 'Makefile.in', but
     # some people rename them; so instead we look at the file content.
     # Grep'ing the first line is not enough: some people post-process
     # each Makefile.in and add a new line on top of each file to say so.
@@ -376,21 +368,19 @@ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],
       continue
     fi
     # Extract the definition of DEPDIR, am__include, and am__quote
-    # from the Makefile without running `make'.
+    # from the Makefile without running 'make'.
     DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
     test -z "$DEPDIR" && continue
     am__include=`sed -n 's/^am__include = //p' < "$mf"`
     test -z "am__include" && continue
     am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
-    # When using ansi2knr, U may be empty or an underscore; expand it
-    U=`sed -n 's/^U = //p' < "$mf"`
     # Find all dependency output files, they are included files with
     # $(DEPDIR) in their names.  We invoke sed twice because it is the
     # simplest approach to changing $(DEPDIR) to its actual value in the
     # expansion.
     for file in `sed -n "
       s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
-	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do
       # Make sure the directory exists.
       test -f "$dirpart/$file" && continue
       fdir=`AS_DIRNAME(["$file"])`
@@ -408,7 +398,7 @@ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],
 # This macro should only be invoked once -- use via AC_REQUIRE.
 #
 # This code is only required when automatic dependency tracking
-# is enabled.  FIXME.  This creates each `.P' file that we will
+# is enabled.  FIXME.  This creates each '.P' file that we will
 # need in order to bootstrap the dependency handling code.
 AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS],
 [AC_CONFIG_COMMANDS([depfiles],
@@ -418,15 +408,12 @@ AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS],
 
 # Do all the work for Automake.                             -*- Autoconf -*-
 
-# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
-# 2005, 2006, 2008, 2009 Free Software Foundation, Inc.
+# Copyright (C) 1996-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 16
-
 # This macro actually does too much.  Some checks are only needed if
 # your package does certain things.  But this isn't really a big deal.
 
@@ -471,31 +458,41 @@ AC_SUBST([CYGPATH_W])
 # Define the identity of the package.
 dnl Distinguish between old-style and new-style calls.
 m4_ifval([$2],
-[m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+[AC_DIAGNOSE([obsolete],
+[$0: two- and three-arguments forms are deprecated.  For more info, see:
+http://www.gnu.org/software/automake/manual/automake.html#Modernize-AM_INIT_AUTOMAKE-invocation])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
  AC_SUBST([PACKAGE], [$1])dnl
  AC_SUBST([VERSION], [$2])],
 [_AM_SET_OPTIONS([$1])dnl
 dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
-m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,,
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
   [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
  AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
  AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
 
 _AM_IF_OPTION([no-define],,
-[AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package])
- AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
 
 # Some tools Automake needs.
 AC_REQUIRE([AM_SANITY_CHECK])dnl
 AC_REQUIRE([AC_ARG_PROGRAM])dnl
-AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version})
-AM_MISSING_PROG(AUTOCONF, autoconf)
-AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version})
-AM_MISSING_PROG(AUTOHEADER, autoheader)
-AM_MISSING_PROG(MAKEINFO, makeinfo)
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
 AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
 AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
-AC_REQUIRE([AM_PROG_MKDIR_P])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
 # We need awk for the "check" target.  The system "awk" is bad on
 # some platforms.
 AC_REQUIRE([AC_PROG_AWK])dnl
@@ -506,28 +503,35 @@ _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
 			     [_AM_PROG_TAR([v7])])])
 _AM_IF_OPTION([no-dependencies],,
 [AC_PROVIDE_IFELSE([AC_PROG_CC],
-		  [_AM_DEPENDENCIES(CC)],
-		  [define([AC_PROG_CC],
-			  defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
 AC_PROVIDE_IFELSE([AC_PROG_CXX],
-		  [_AM_DEPENDENCIES(CXX)],
-		  [define([AC_PROG_CXX],
-			  defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
 AC_PROVIDE_IFELSE([AC_PROG_OBJC],
-		  [_AM_DEPENDENCIES(OBJC)],
-		  [define([AC_PROG_OBJC],
-			  defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+dnl Support for Objective C++ was only introduced in Autoconf 2.65,
+dnl but we still cater to Autoconf 2.62.
+m4_ifdef([AC_PROG_OBJCXX],
+[AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])])dnl
 ])
 _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl
-dnl The `parallel-tests' driver may need to know about EXEEXT, so add the
-dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This macro
+dnl The 'parallel-tests' driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This macro
 dnl is hooked onto _AC_COMPILER_EXEEXT early, see below.
 AC_CONFIG_COMMANDS_PRE(dnl
 [m4_provide_if([_AM_COMPILER_EXEEXT],
   [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
 ])
 
-dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
+dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
 dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
 dnl mangled by Autoconf and run in a shell conditional statement.
 m4_define([_AC_COMPILER_EXEEXT],
@@ -555,15 +559,12 @@ for _am_header in $config_headers :; do
 done
 echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
 
-# Copyright (C) 2001, 2003, 2005, 2008, 2011 Free Software Foundation,
-# Inc.
+# Copyright (C) 2001-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 1
-
 # AM_PROG_INSTALL_SH
 # ------------------
 # Define $install_sh.
@@ -577,16 +578,14 @@ if test x"${install_sh}" != xset; then
     install_sh="\${SHELL} $am_aux_dir/install-sh"
   esac
 fi
-AC_SUBST(install_sh)])
+AC_SUBST([install_sh])])
 
-# Copyright (C) 2003, 2005  Free Software Foundation, Inc.
+# Copyright (C) 2003-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 2
-
 # Check whether the underlying file-system supports filenames
 # with a leading dot.  For instance MS-DOS doesn't.
 AC_DEFUN([AM_SET_LEADING_DOT],
@@ -602,14 +601,12 @@ AC_SUBST([am__leading_dot])])
 
 # Check to see how 'make' treats includes.	            -*- Autoconf -*-
 
-# Copyright (C) 2001, 2002, 2003, 2005, 2009  Free Software Foundation, Inc.
+# Copyright (C) 2001-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 4
-
 # AM_MAKE_INCLUDE()
 # -----------------
 # Check to see how make treats includes.
@@ -627,7 +624,7 @@ am__quote=
 _am_result=none
 # First try GNU make style include.
 echo "include confinc" > confmf
-# Ignore all kinds of additional output from `make'.
+# Ignore all kinds of additional output from 'make'.
 case `$am_make -s -f confmf 2> /dev/null` in #(
 *the\ am__doit\ target*)
   am__include=include
@@ -654,15 +651,12 @@ rm -f confinc confmf
 
 # Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-
 
-# Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008
-# Free Software Foundation, Inc.
+# Copyright (C) 1997-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 6
-
 # AM_MISSING_PROG(NAME, PROGRAM)
 # ------------------------------
 AC_DEFUN([AM_MISSING_PROG],
@@ -670,7 +664,6 @@ AC_DEFUN([AM_MISSING_PROG],
 $1=${$1-"${am_missing_run}$2"}
 AC_SUBST($1)])
 
-
 # AM_MISSING_HAS_RUN
 # ------------------
 # Define MISSING if not defined so far and test if it supports --run.
@@ -691,50 +684,18 @@ if eval "$MISSING --run true"; then
   am_missing_run="$MISSING --run "
 else
   am_missing_run=
-  AC_MSG_WARN([`missing' script is too old or missing])
+  AC_MSG_WARN(['missing' script is too old or missing])
 fi
 ])
 
-# Copyright (C) 2003, 2004, 2005, 2006, 2011 Free Software Foundation,
-# Inc.
-#
-# This file is free software; the Free Software Foundation
-# gives unlimited permission to copy and/or distribute it,
-# with or without modifications, as long as this notice is preserved.
-
-# serial 1
-
-# AM_PROG_MKDIR_P
-# ---------------
-# Check for `mkdir -p'.
-AC_DEFUN([AM_PROG_MKDIR_P],
-[AC_PREREQ([2.60])dnl
-AC_REQUIRE([AC_PROG_MKDIR_P])dnl
-dnl Automake 1.8 to 1.9.6 used to define mkdir_p.  We now use MKDIR_P,
-dnl while keeping a definition of mkdir_p for backward compatibility.
-dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile.
-dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of
-dnl Makefile.ins that do not define MKDIR_P, so we do our own
-dnl adjustment using top_builddir (which is defined more often than
-dnl MKDIR_P).
-AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl
-case $mkdir_p in
-  [[\\/$]]* | ?:[[\\/]]*) ;;
-  */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
-esac
-])
-
 # Helper functions for option handling.                     -*- Autoconf -*-
 
-# Copyright (C) 2001, 2002, 2003, 2005, 2008, 2010 Free Software
-# Foundation, Inc.
+# Copyright (C) 2001-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 5
-
 # _AM_MANGLE_OPTION(NAME)
 # -----------------------
 AC_DEFUN([_AM_MANGLE_OPTION],
@@ -744,7 +705,7 @@ AC_DEFUN([_AM_MANGLE_OPTION],
 # --------------------
 # Set option NAME.  Presently that only means defining a flag for this option.
 AC_DEFUN([_AM_SET_OPTION],
-[m4_define(_AM_MANGLE_OPTION([$1]), 1)])
+[m4_define(_AM_MANGLE_OPTION([$1]), [1])])
 
 # _AM_SET_OPTIONS(OPTIONS)
 # ------------------------
@@ -758,14 +719,12 @@ AC_DEFUN([_AM_SET_OPTIONS],
 AC_DEFUN([_AM_IF_OPTION],
 [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
 
-# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
+# Copyright (C) 2001-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 1
-
 # AM_RUN_LOG(COMMAND)
 # -------------------
 # Run COMMAND, save the exit status in ac_status, and log it.
@@ -779,22 +738,16 @@ AC_DEFUN([AM_RUN_LOG],
 
 # Check to make sure that the build environment is sane.    -*- Autoconf -*-
 
-# Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008
-# Free Software Foundation, Inc.
+# Copyright (C) 1996-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 5
-
 # AM_SANITY_CHECK
 # ---------------
 AC_DEFUN([AM_SANITY_CHECK],
 [AC_MSG_CHECKING([whether build environment is sane])
-# Just in case
-sleep 1
-echo timestamp > conftest.file
 # Reject unsafe characters in $srcdir or the absolute working directory
 # name.  Accept space and tab only in the latter.
 am_lf='
@@ -805,32 +758,40 @@ case `pwd` in
 esac
 case $srcdir in
   *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
-    AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);;
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
 esac
 
-# Do `set' in a subshell so we don't clobber the current shell's
+# Do 'set' in a subshell so we don't clobber the current shell's
 # arguments.  Must try -L first in case configure is actually a
 # symlink; some systems play weird games with the mod time of symlinks
 # (eg FreeBSD returns the mod time of the symlink's containing
 # directory).
 if (
-   set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
-   if test "$[*]" = "X"; then
-      # -L didn't work.
-      set X `ls -t "$srcdir/configure" conftest.file`
-   fi
-   rm -f conftest.file
-   if test "$[*]" != "X $srcdir/configure conftest.file" \
-      && test "$[*]" != "X conftest.file $srcdir/configure"; then
-
-      # If neither matched, then we have a broken ls.  This can happen
-      # if, for instance, CONFIG_SHELL is bash and it inherits a
-      # broken ls alias from the environment.  This has actually
-      # happened.  Such a system could not be considered "sane".
-      AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
-alias in your environment])
-   fi
-
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
    test "$[2]" = conftest.file
    )
 then
@@ -840,31 +801,50 @@ else
    AC_MSG_ERROR([newly created file is older than distributed files!
 Check your system clock])
 fi
-AC_MSG_RESULT(yes)])
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
 
-# Copyright (C) 2009, 2011  Free Software Foundation, Inc.
+# Copyright (C) 2009-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 2
-
 # AM_SILENT_RULES([DEFAULT])
 # --------------------------
 # Enable less verbose build rules; with the default set to DEFAULT
-# (`yes' being less verbose, `no' or empty being verbose).
+# ("yes" being less verbose, "no" or empty being verbose).
 AC_DEFUN([AM_SILENT_RULES],
-[AC_ARG_ENABLE([silent-rules],
-[  --enable-silent-rules          less verbose build output (undo: `make V=1')
-  --disable-silent-rules         verbose build output (undo: `make V=0')])
-case $enable_silent_rules in
-yes) AM_DEFAULT_VERBOSITY=0;;
-no)  AM_DEFAULT_VERBOSITY=1;;
-*)   AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+[AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
 esac
 dnl
-dnl A few `make' implementations (e.g., NonStop OS and NextStep)
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
 dnl do not support nested variable expansions.
 dnl See automake bug#9928 and bug#10237.
 am_make=${MAKE-make}
@@ -882,7 +862,7 @@ else
   am_cv_make_support_nested_variables=no
 fi])
 if test $am_cv_make_support_nested_variables = yes; then
-  dnl Using `$V' instead of `$(V)' breaks IRIX make.
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
   AM_V='$(V)'
   AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
 else
@@ -899,44 +879,40 @@ AC_SUBST([AM_BACKSLASH])dnl
 _AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
 ])
 
-# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
+# Copyright (C) 2001-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 1
-
 # AM_PROG_INSTALL_STRIP
 # ---------------------
-# One issue with vendor `install' (even GNU) is that you can't
+# One issue with vendor 'install' (even GNU) is that you can't
 # specify the program used to strip binaries.  This is especially
 # annoying in cross-compiling environments, where the build's strip
 # is unlikely to handle the host's binaries.
 # Fortunately install-sh will honor a STRIPPROG variable, so we
-# always use install-sh in `make install-strip', and initialize
+# always use install-sh in "make install-strip", and initialize
 # STRIPPROG with the value of the STRIP variable (set by the user).
 AC_DEFUN([AM_PROG_INSTALL_STRIP],
 [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
-# Installed binaries are usually stripped using `strip' when the user
-# run `make install-strip'.  However `strip' might not be the right
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
 # tool to use in cross-compilation environments, therefore Automake
-# will honor the `STRIP' environment variable to overrule this program.
-dnl Don't test for $cross_compiling = yes, because it might be `maybe'.
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
 if test "$cross_compiling" != no; then
   AC_CHECK_TOOL([STRIP], [strip], :)
 fi
 INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
 AC_SUBST([INSTALL_STRIP_PROGRAM])])
 
-# Copyright (C) 2006, 2008, 2010 Free Software Foundation, Inc.
+# Copyright (C) 2006-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 3
-
 # _AM_SUBST_NOTMAKE(VARIABLE)
 # ---------------------------
 # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
@@ -950,18 +926,16 @@ AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
 
 # Check how to create a tarball.                            -*- Autoconf -*-
 
-# Copyright (C) 2004, 2005, 2012 Free Software Foundation, Inc.
+# Copyright (C) 2004-2012 Free Software Foundation, Inc.
 #
 # This file is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
 
-# serial 2
-
 # _AM_PROG_TAR(FORMAT)
 # --------------------
 # Check how to create a tarball in format FORMAT.
-# FORMAT should be one of `v7', `ustar', or `pax'.
+# FORMAT should be one of 'v7', 'ustar', or 'pax'.
 #
 # Substitute a variable $(am__tar) that is a command
 # writing to stdout a FORMAT-tarball containing the directory
@@ -984,7 +958,7 @@ AC_MSG_CHECKING([how to create a $1 tar archive])
 _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
 _am_tools=${am_cv_prog_tar_$1-$_am_tools}
 # Do not fold the above two line into one, because Tru64 sh and
-# Solaris sh will not grok spaces in the rhs of `-'.
+# Solaris sh will not grok spaces in the rhs of '-'.
 for _am_tool in $_am_tools
 do
   case $_am_tool in
diff --git a/compile b/compile
index 7b4a9a7..718dc6d 100755
--- a/compile
+++ b/compile
@@ -1,7 +1,7 @@
 #! /bin/sh
 # Wrapper for compilers which do not understand '-c -o'.
 
-scriptversion=2012-03-05.13; # UTC
+scriptversion=2012-10-14.11; # UTC
 
 # Copyright (C) 1999-2012 Free Software Foundation, Inc.
 # Written by Tom Tromey <tromey at cygnus.com>.
@@ -112,6 +112,11 @@ func_cl_dashl ()
       lib=$dir/$lib.lib
       break
     fi
+    if test -f "$dir/lib$lib.a"; then
+      found=yes
+      lib=$dir/lib$lib.a
+      break
+    fi
   done
   IFS=$save_IFS
 
diff --git a/config.guess b/config.guess
index aa04f04..872b96a 100755
--- a/config.guess
+++ b/config.guess
@@ -4,7 +4,7 @@
 #   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
 #   2011, 2012 Free Software Foundation, Inc.
 
-timestamp='2012-06-17'
+timestamp='2012-09-25'
 
 # This file is free software; you can redistribute it and/or modify it
 # under the terms of the GNU General Public License as published by
@@ -306,7 +306,7 @@ case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
     arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)
 	echo arm-acorn-riscix${UNAME_RELEASE}
 	exit ;;
-    arm:riscos:*:*|arm:RISCOS:*:*)
+    arm*:riscos:*:*|arm*:RISCOS:*:*)
 	echo arm-unknown-riscos
 	exit ;;
     SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
@@ -805,6 +805,9 @@ EOF
     i*:CYGWIN*:*)
 	echo ${UNAME_MACHINE}-pc-cygwin
 	exit ;;
+    *:MINGW64*:*)
+	echo ${UNAME_MACHINE}-pc-mingw64
+	exit ;;
     *:MINGW*:*)
 	echo ${UNAME_MACHINE}-pc-mingw32
 	exit ;;
@@ -1205,6 +1208,9 @@ EOF
     BePC:Haiku:*:*)	# Haiku running on Intel PC compatible.
 	echo i586-pc-haiku
 	exit ;;
+    x86_64:Haiku:*:*)
+	echo x86_64-unknown-haiku
+	exit ;;
     SX-4:SUPER-UX:*:*)
 	echo sx4-nec-superux${UNAME_RELEASE}
 	exit ;;
@@ -1334,9 +1340,6 @@ EOF
 	exit ;;
 esac
 
-#echo '(No uname command or uname output not recognized.)' 1>&2
-#echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2
-
 eval $set_cc_for_build
 cat >$dummy.c <<EOF
 #ifdef _SEQUENT_
diff --git a/config.sub b/config.sub
index aa2cf19..8df5511 100755
--- a/config.sub
+++ b/config.sub
@@ -4,7 +4,7 @@
 #   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
 #   2011, 2012 Free Software Foundation, Inc.
 
-timestamp='2012-06-17'
+timestamp='2012-12-06'
 
 # This file is (in principle) common to ALL GNU software.
 # The presence of a machine in this file suggests that SOME GNU software
@@ -123,7 +123,7 @@ esac
 maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'`
 case $maybe_os in
   nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \
-  linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \
+  linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \
   knetbsd*-gnu* | netbsd*-gnu* | \
   kopensolaris*-gnu* | \
   storm-chaos* | os2-emx* | rtmk-nova*)
@@ -156,7 +156,7 @@ case $os in
 	-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\
 	-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \
 	-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \
-	-apple | -axis | -knuth | -cray | -microblaze)
+	-apple | -axis | -knuth | -cray | -microblaze*)
 		os=
 		basic_machine=$1
 		;;
@@ -259,8 +259,10 @@ case $basic_machine in
 	| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \
 	| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \
 	| am33_2.0 \
-	| arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \
-        | be32 | be64 \
+	| arc \
+	| arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \
+	| avr | avr32 \
+	| be32 | be64 \
 	| bfin \
 	| c4x | clipper \
 	| d10v | d30v | dlx | dsp16xx \
@@ -273,7 +275,7 @@ case $basic_machine in
 	| le32 | le64 \
 	| lm32 \
 	| m32c | m32r | m32rle | m68000 | m68k | m88k \
-	| maxq | mb | microblaze | mcore | mep | metag \
+	| maxq | mb | microblaze | microblazeel | mcore | mep | metag \
 	| mips | mipsbe | mipseb | mipsel | mipsle \
 	| mips16 \
 	| mips64 | mips64el \
@@ -389,7 +391,8 @@ case $basic_machine in
 	| lm32-* \
 	| m32c-* | m32r-* | m32rle-* \
 	| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \
-	| m88110-* | m88k-* | maxq-* | mcore-* | metag-* | microblaze-* \
+	| m88110-* | m88k-* | maxq-* | mcore-* | metag-* \
+	| microblaze-* | microblazeel-* \
 	| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \
 	| mips16-* \
 	| mips64-* | mips64el-* \
@@ -788,9 +791,13 @@ case $basic_machine in
 		basic_machine=ns32k-utek
 		os=-sysv
 		;;
-	microblaze)
+	microblaze*)
 		basic_machine=microblaze-xilinx
 		;;
+	mingw64)
+		basic_machine=x86_64-pc
+		os=-mingw64
+		;;
 	mingw32)
 		basic_machine=i386-pc
 		os=-mingw32
@@ -1019,7 +1026,11 @@ case $basic_machine in
 		basic_machine=i586-unknown
 		os=-pw32
 		;;
-	rdos)
+	rdos | rdos64)
+		basic_machine=x86_64-pc
+		os=-rdos
+		;;
+	rdos32)
 		basic_machine=i386-pc
 		os=-rdos
 		;;
@@ -1359,8 +1370,8 @@ case $os in
 	      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \
 	      | -chorusos* | -chorusrdb* | -cegcc* \
 	      | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \
-	      | -mingw32* | -linux-gnu* | -linux-android* \
-	      | -linux-newlib* | -linux-uclibc* \
+	      | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \
+	      | -linux-newlib* | -linux-musl* | -linux-uclibc* \
 	      | -uxpv* | -beos* | -mpeix* | -udk* \
 	      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \
 	      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \
diff --git a/configure b/configure
index 11e5756..68d8ff5 100755
--- a/configure
+++ b/configure
@@ -1,6 +1,6 @@
 #! /bin/sh
 # Guess values for system-dependent variables and create Makefiles.
-# Generated by GNU Autoconf 2.68 for the Parma Polyhedra Library 1.0.
+# Generated by GNU Autoconf 2.68 for the Parma Polyhedra Library 1.1pre8.
 #
 # Report bugs to <ppl-devel at cs.unipr.it>.
 #
@@ -570,8 +570,8 @@ MAKEFLAGS=
 # Identity of this package.
 PACKAGE_NAME='the Parma Polyhedra Library'
 PACKAGE_TARNAME='ppl'
-PACKAGE_VERSION='1.0'
-PACKAGE_STRING='the Parma Polyhedra Library 1.0'
+PACKAGE_VERSION='1.1pre8'
+PACKAGE_STRING='the Parma Polyhedra Library 1.1pre8'
 PACKAGE_BUGREPORT='ppl-devel at cs.unipr.it'
 PACKAGE_URL=''
 
@@ -1501,7 +1501,7 @@ if test "$ac_init_help" = "long"; then
   # Omit some internal or obsolete options to make the list less imposing.
   # This message is too long to be a string in the A/UX 3.1 sh.
   cat <<_ACEOF
-\`configure' configures the Parma Polyhedra Library 1.0 to adapt to many kinds of systems.
+\`configure' configures the Parma Polyhedra Library 1.1pre8 to adapt to many kinds of systems.
 
 Usage: $0 [OPTION]... [VAR=VALUE]...
 
@@ -1571,7 +1571,7 @@ fi
 
 if test -n "$ac_init_help"; then
   case $ac_init_help in
-     short | recursive ) echo "Configuration of the Parma Polyhedra Library 1.0:";;
+     short | recursive ) echo "Configuration of the Parma Polyhedra Library 1.1pre8:";;
    esac
   cat <<\_ACEOF
 
@@ -1579,10 +1579,12 @@ Optional Features:
   --disable-option-checking  ignore unrecognized --enable/--with options
   --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
   --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
-  --enable-silent-rules          less verbose build output (undo: `make V=1')
-  --disable-silent-rules         verbose build output (undo: `make V=0')
-  --disable-dependency-tracking  speeds up one-time build
-  --enable-dependency-tracking   do not reject slow dependency extractors
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+  --enable-dependency-tracking
+                          do not reject slow dependency extractors
+  --disable-dependency-tracking
+                          speeds up one-time build
   --enable-debugging      compile with debugging information
   --enable-profiling      compile for profiling
   --enable-coverage       compile for test coverage
@@ -1714,7 +1716,7 @@ fi
 test -n "$ac_init_help" && exit $ac_status
 if $ac_init_version; then
   cat <<\_ACEOF
-the Parma Polyhedra Library configure 1.0
+the Parma Polyhedra Library configure 1.1pre8
 generated by GNU Autoconf 2.68
 
 Copyright (C) 2010 Free Software Foundation, Inc.
@@ -2896,7 +2898,7 @@ cat >config.log <<_ACEOF
 This file contains any messages produced by compilers while
 running configure, to aid debugging if configure makes a mistake.
 
-It was created by the Parma Polyhedra Library $as_me 1.0, which was
+It was created by the Parma Polyhedra Library $as_me 1.1pre8, which was
 generated by GNU Autoconf 2.68.  Invocation command line was
 
   $ $0 $@
@@ -3358,7 +3360,7 @@ case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac
 
 
 # Use Automake.
-am__api_version='1.11'
+am__api_version='1.12'
 
 # Find a good install program.  We prefer a C program (faster),
 # so one script is as good as another.  But avoid the broken or
@@ -3455,9 +3457,6 @@ test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
 
 { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
 $as_echo_n "checking whether build environment is sane... " >&6; }
-# Just in case
-sleep 1
-echo timestamp > conftest.file
 # Reject unsafe characters in $srcdir or the absolute working directory
 # name.  Accept space and tab only in the latter.
 am_lf='
@@ -3468,32 +3467,40 @@ case `pwd` in
 esac
 case $srcdir in
   *[\\\"\#\$\&\'\`$am_lf\ \	]*)
-    as_fn_error $? "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;;
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
 esac
 
-# Do `set' in a subshell so we don't clobber the current shell's
+# Do 'set' in a subshell so we don't clobber the current shell's
 # arguments.  Must try -L first in case configure is actually a
 # symlink; some systems play weird games with the mod time of symlinks
 # (eg FreeBSD returns the mod time of the symlink's containing
 # directory).
 if (
-   set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
-   if test "$*" = "X"; then
-      # -L didn't work.
-      set X `ls -t "$srcdir/configure" conftest.file`
-   fi
-   rm -f conftest.file
-   if test "$*" != "X $srcdir/configure conftest.file" \
-      && test "$*" != "X conftest.file $srcdir/configure"; then
-
-      # If neither matched, then we have a broken ls.  This can happen
-      # if, for instance, CONFIG_SHELL is bash and it inherits a
-      # broken ls alias from the environment.  This has actually
-      # happened.  Such a system could not be considered "sane".
-      as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
-alias in your environment" "$LINENO" 5
-   fi
-
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
    test "$2" = conftest.file
    )
 then
@@ -3505,6 +3512,16 @@ Check your system clock" "$LINENO" 5
 fi
 { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
 $as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
 test "$program_prefix" != NONE &&
   program_transform_name="s&^&$program_prefix&;$program_transform_name"
 # Use a double $ so make ignores it.
@@ -3531,8 +3548,8 @@ if eval "$MISSING --run true"; then
   am_missing_run="$MISSING --run "
 else
   am_missing_run=
-  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5
-$as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
 fi
 
 if test x"${install_sh}" != xset; then
@@ -3544,10 +3561,10 @@ if test x"${install_sh}" != xset; then
   esac
 fi
 
-# Installed binaries are usually stripped using `strip' when the user
-# run `make install-strip'.  However `strip' might not be the right
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
 # tool to use in cross-compilation environments, therefore Automake
-# will honor the `STRIP' environment variable to overrule this program.
+# will honor the 'STRIP' environment variable to overrule this program.
 if test "$cross_compiling" != no; then
   if test -n "$ac_tool_prefix"; then
   # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
@@ -3686,12 +3703,6 @@ fi
 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
 $as_echo "$MKDIR_P" >&6; }
 
-mkdir_p="$MKDIR_P"
-case $mkdir_p in
-  [\\/$]* | ?:[\\/]*) ;;
-  */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
-esac
-
 for ac_prog in gawk mawk nawk awk
 do
   # Extract the first word of "$ac_prog", so it can be a program name with args.
@@ -3779,10 +3790,10 @@ if test "${enable_silent_rules+set}" = set; then :
   enableval=$enable_silent_rules;
 fi
 
-case $enable_silent_rules in
-yes) AM_DEFAULT_VERBOSITY=0;;
-no)  AM_DEFAULT_VERBOSITY=1;;
-*)   AM_DEFAULT_VERBOSITY=1;;
+case $enable_silent_rules in # (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
 esac
 am_make=${MAKE-make}
 { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
@@ -3835,7 +3846,7 @@ fi
 
 # Define the identity of the package.
  PACKAGE='ppl'
- VERSION='1.0'
+ VERSION='1.1pre8'
 
 
 # Some tools Automake needs.
@@ -3854,6 +3865,12 @@ AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
 
 MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
 
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
 # We need awk for the "check" target.  The system "awk" is bad on
 # some platforms.
 # Always define AMTAR for backward compatibility.  Yes, it's still used
@@ -3867,7 +3884,7 @@ $as_echo_n "checking how to create a ustar tar archive... " >&6; }
 _am_tools='gnutar plaintar pax cpio none'
 _am_tools=${am_cv_prog_tar_ustar-$_am_tools}
 # Do not fold the above two line into one, because Tru64 sh and
-# Solaris sh will not grok spaces in the rhs of `-'.
+# Solaris sh will not grok spaces in the rhs of '-'.
 for _am_tool in $_am_tools
 do
   case $_am_tool in
@@ -4824,7 +4841,7 @@ am__quote=
 _am_result=none
 # First try GNU make style include.
 echo "include confinc" > confmf
-# Ignore all kinds of additional output from `make'.
+# Ignore all kinds of additional output from 'make'.
 case `$am_make -s -f confmf 2> /dev/null` in #(
 *the\ am__doit\ target*)
   am__include=include
@@ -4880,8 +4897,8 @@ else
   # We make a subdir and do the tests there.  Otherwise we can end up
   # making bogus files that we don't know about and never remove.  For
   # instance it was reported that on HP-UX the gcc test will end up
-  # making a dummy file named `D' -- because `-MD' means `put the output
-  # in D'.
+  # making a dummy file named 'D' -- because '-MD' means "put the output
+  # in D".
   rm -rf conftest.dir
   mkdir conftest.dir
   # Copy depcomp to subdir because otherwise we won't find it if we're
@@ -4916,16 +4933,16 @@ else
     : > sub/conftest.c
     for i in 1 2 3 4 5 6; do
       echo '#include "conftst'$i'.h"' >> sub/conftest.c
-      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
-      # Solaris 8's {/usr,}/bin/sh.
-      touch sub/conftst$i.h
+      # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with
+      # Solaris 10 /bin/sh.
+      echo '/* dummy */' > sub/conftst$i.h
     done
     echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
 
-    # We check with `-c' and `-o' for the sake of the "dashmstdout"
+    # We check with '-c' and '-o' for the sake of the "dashmstdout"
     # mode.  It turns out that the SunPro C++ compiler does not properly
-    # handle `-M -o', and we need to detect this.  Also, some Intel
-    # versions had trouble with output in subdirs
+    # handle '-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs.
     am__obj=sub/conftest.${OBJEXT-o}
     am__minus_obj="-o $am__obj"
     case $depmode in
@@ -4934,8 +4951,8 @@ else
       test "$am__universal" = false || continue
       ;;
     nosideeffect)
-      # after this tag, mechanisms are not by side-effect, so they'll
-      # only be used when explicitly requested
+      # After this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested.
       if test "x$enable_dependency_tracking" = xyes; then
 	continue
       else
@@ -4943,7 +4960,7 @@ else
       fi
       ;;
     msvc7 | msvc7msys | msvisualcpp | msvcmsys)
-      # This compiler won't grok `-c -o', but also, the minuso test has
+      # This compiler won't grok '-c -o', but also, the minuso test has
       # not run yet.  These depmodes are late enough in the game, and
       # so weak that their functioning should not be impacted.
       am__obj=conftest.${OBJEXT-o}
@@ -5058,8 +5075,8 @@ fi
 # The clang compiler masquerades as gcc, but we want to know.
 if test x"$GCC" = xyes
 then
-  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are actually using Clang" >&5
-$as_echo_n "checking whether we are actually using Clang... " >&6; }
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are actually using clang" >&5
+$as_echo_n "checking whether we are actually using clang... " >&6; }
   ac_ext=c
 ac_cpp='$CPP $CPPFLAGS'
 ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
@@ -5092,6 +5109,46 @@ ac_compiler_gnu=$ac_cv_c_compiler_gnu
 
 fi
 
+# The llvm-gcc compiler masquerades as gcc, but we want to know.
+if test x"$GCC" = xyes
+then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are actually using llvm-gcc" >&5
+$as_echo_n "checking whether we are actually using llvm-gcc... " >&6; }
+  ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+  save_CFLAGS="$CFLAGS"
+  CFLAGS="-fplugin-arg-dragonegg-emit-ir -S"
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int main() {
+  return 0;
+}
+
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  LLVM_GCC=yes
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  LLVM_GCC=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+  CFLAGS="$save_CFLAGS"
+  ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+fi
+
 save_CXXFLAGS="$CXXFLAGS"
 ac_ext=cpp
 ac_cpp='$CXXCPP $CPPFLAGS'
@@ -5361,8 +5418,8 @@ else
   # We make a subdir and do the tests there.  Otherwise we can end up
   # making bogus files that we don't know about and never remove.  For
   # instance it was reported that on HP-UX the gcc test will end up
-  # making a dummy file named `D' -- because `-MD' means `put the output
-  # in D'.
+  # making a dummy file named 'D' -- because '-MD' means "put the output
+  # in D".
   rm -rf conftest.dir
   mkdir conftest.dir
   # Copy depcomp to subdir because otherwise we won't find it if we're
@@ -5397,16 +5454,16 @@ else
     : > sub/conftest.c
     for i in 1 2 3 4 5 6; do
       echo '#include "conftst'$i'.h"' >> sub/conftest.c
-      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
-      # Solaris 8's {/usr,}/bin/sh.
-      touch sub/conftst$i.h
+      # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with
+      # Solaris 10 /bin/sh.
+      echo '/* dummy */' > sub/conftst$i.h
     done
     echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
 
-    # We check with `-c' and `-o' for the sake of the "dashmstdout"
+    # We check with '-c' and '-o' for the sake of the "dashmstdout"
     # mode.  It turns out that the SunPro C++ compiler does not properly
-    # handle `-M -o', and we need to detect this.  Also, some Intel
-    # versions had trouble with output in subdirs
+    # handle '-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs.
     am__obj=sub/conftest.${OBJEXT-o}
     am__minus_obj="-o $am__obj"
     case $depmode in
@@ -5415,8 +5472,8 @@ else
       test "$am__universal" = false || continue
       ;;
     nosideeffect)
-      # after this tag, mechanisms are not by side-effect, so they'll
-      # only be used when explicitly requested
+      # After this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested.
       if test "x$enable_dependency_tracking" = xyes; then
 	continue
       else
@@ -5424,7 +5481,7 @@ else
       fi
       ;;
     msvc7 | msvc7msys | msvisualcpp | msvcmsys)
-      # This compiler won't grok `-c -o', but also, the minuso test has
+      # This compiler won't grok '-c -o', but also, the minuso test has
       # not run yet.  These depmodes are late enough in the game, and
       # so weak that their functioning should not be impacted.
       am__obj=conftest.${OBJEXT-o}
@@ -5555,6 +5612,47 @@ ac_compiler_gnu=$ac_cv_c_compiler_gnu
 
 fi
 
+# The llvm-++ compiler masquerades as g++, but we want to know.
+if test x"$GXX" = xyes
+then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are actually using llvm-g++" >&5
+$as_echo_n "checking whether we are actually using llvm-g++... " >&6; }
+  ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+
+  save_CXXFLAGS="$CXXFLAGS"
+  CXXFLAGS="-fplugin-arg-dragonegg-emit-ir -S"
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int main() {
+  return 0;
+}
+
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  LLVM_GXX=yes
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  LLVM_GXX=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+  CXXFLAGS="$save_CXXFLAGS"
+  ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+fi
+
+
 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5
 $as_echo_n "checking for grep that handles long lines and -e... " >&6; }
 if ${ac_cv_path_GREP+:} false; then :
@@ -6318,21 +6416,20 @@ then
   then
     OPT_FLAGS="$OPT_FLAGS -fp-model strict -fp-speculation off"
   else
-    # -frounding-math is not yet supported in clang++, if we use it we get
-    # lots of warnings.
-    if test x"$CLANGXX" = xyes
+    # -frounding-math is not yet supported in clang++ or llvm-g++.
+    if test x"$CLANGXX" = xyes || x"$LLVM_GXX" = xyes
     then
       if test x"$use_fpmath" = xyes
       then
         { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: CANNOT RELY ON DIRECTED ROUNDING:
 *** DISABLED ALL ABSTRACTIONS BASED ON MACHINE FLOATING-POINT NUMBERS.
-*** clang++ has been detected, which does not provide support for
+*** A compiler has been detected that does not provide support for
 *** -frounding-math (or any other option with the same semantics).
 *** Hence, we cannot rely on floating-point computations to happen
 *** in agreement with the rounding direction(s) used by the PPL." >&5
 $as_echo "$as_me: WARNING: CANNOT RELY ON DIRECTED ROUNDING:
 *** DISABLED ALL ABSTRACTIONS BASED ON MACHINE FLOATING-POINT NUMBERS.
-*** clang++ has been detected, which does not provide support for
+*** A compiler has been detected that does not provide support for
 *** -frounding-math (or any other option with the same semantics).
 *** Hence, we cannot rely on floating-point computations to happen
 *** in agreement with the rounding direction(s) used by the PPL." >&2;}
@@ -8751,7 +8848,46 @@ fi
 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cxx_long_double_binary_format" >&5
 $as_echo "$ac_cxx_long_double_binary_format" >&6; }
 
-if test x"$ac_cxx_long_double_binary_format" = x"unknown" || test $ac_cv_can_control_fpu = 0
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether std::floor(long double) is buggy" >&5
+$as_echo_n "checking whether std::floor(long double) is buggy... " >&6; }
+if test "$cross_compiling" = yes; then :
+  ac_std_floor_long_double_is_buggy=no
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: assuming is not" >&5
+$as_echo "assuming is not" >&6; }
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <cmath>
+#include <cstdlib>
+
+long double x = 13311002825915415087.0L;
+
+int main() {
+  long double y = std::floor(x);
+  if (x != y)
+    return 1;
+  else
+    return 0;
+}
+
+_ACEOF
+if ac_fn_cxx_try_run "$LINENO"; then :
+  ac_std_floor_long_double_is_buggy=no
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+else
+  ac_std_floor_long_double_is_buggy=yes
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+fi
+rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \
+  conftest.$ac_objext conftest.beam conftest.$ac_ext
+fi
+
+
+if test x"$ac_cxx_long_double_binary_format" = x"unknown" \
+|| test $ac_cv_can_control_fpu = 0 \
+|| test x"$ac_std_floor_long_double_is_buggy" = x"yes"
 then
   ac_supported_long_double=0
 else
@@ -9949,7 +10085,7 @@ $as_echo "${available_interfaces}" >&6; }
     enableval=${default_interfaces}
   fi
   # Make the list blank-separated and lowercase; turn "c++" into "cxx".
-  required_interfaces=`echo "${enableval}" | sed -e 's/-/_/g' -e 's/[ 	,][ 	,]*/ /g' -e 's/c++/cxx/g' | tr '[:upper:]' '[:lower:]'`
+  required_interfaces=`echo "${enableval}" | sed -e 's/-/_/g' -e 's/[  ,][   ,]*/ /g' -e 's/c++/cxx/g' | tr '[:upper:]' '[:lower:]'`
   # Check that the specified interfaces exist.
   for interface in ${required_interfaces}
   do
@@ -10151,7 +10287,7 @@ else
 JAVA_TEST=Test.java
 CLASS_TEST=Test.class
 cat << \EOF > $JAVA_TEST
-/* #line 10154 "configure" */
+/* #line 10290 "configure" */
 public class Test {
 public enum Relation_Symbol {
     /*! Less than. */
@@ -10342,7 +10478,7 @@ EOF
 if uudecode$EXEEXT Test.uue; then
         ac_cv_prog_uudecode_base64=yes
 else
-        echo "configure: 10345: uudecode had trouble decoding base 64 file 'Test.uue'" >&5
+        echo "configure: 10481: uudecode had trouble decoding base 64 file 'Test.uue'" >&5
         echo "configure: failed file was:" >&5
         cat Test.uue >&5
         ac_cv_prog_uudecode_base64=no
@@ -10461,7 +10597,7 @@ else
 JAVA_TEST=Test.java
 CLASS_TEST=Test.class
 cat << \EOF > $JAVA_TEST
-/* #line 10464 "configure" */
+/* #line 10600 "configure" */
 public class Test {
 public enum Relation_Symbol {
     /*! Less than. */
@@ -10510,7 +10646,7 @@ JAVA_TEST=Test.java
 CLASS_TEST=Test.class
 TEST=Test
 cat << \EOF > $JAVA_TEST
-/* [#]line 10513 "configure" */
+/* [#]line 10649 "configure" */
 public class Test {
 public static void main (String args[]) {
         System.exit (0);
@@ -11806,7 +11942,7 @@ $as_echo "yes" >&6; }
       else
         { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
 $as_echo "no" >&6; }
-	ocamlopt_gmp="no"
+        ocamlopt_gmp="no"
       fi
     fi
   fi
@@ -12911,7 +13047,7 @@ $as_echo "none" >&6; }
     enableval=${available_instantiations}
   fi
   # Avoid extra blanks.
-  required_instantiations=`echo "${enableval}" | sed -e 's/[	 ][	 ]*/ /g' -e 's/[ ]*\([@<>,]\)/\1/g' -e 's/\([@<>,]\)[ ]*/\1/g' -e 's/>>/> >/g' -e 's/^[ ]//g' -e 's/[ ]$//g'`
+  required_instantiations=`echo "${enableval}" | sed -e 's/[    ][    ]*/ /g' -e 's/[ ]*\([@<>,]\)/\1/g' -e 's/\([@<>,]\)[ ]*/\1/g' -e 's/>>/> >/g' -e 's/^[ ]//g' -e 's/[ ]$//g'`
   # Check the specified instantiations for validity.
   ac_save_CPPFLAGS="$CPPFLAGS"
   CPPFLAGS="$CPPFLAGS -I${srcdir} ${gmp_include_options}"
@@ -23943,6 +24079,14 @@ LIBOBJS=$ac_libobjs
 LTLIBOBJS=$ac_ltlibobjs
 
 
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
  if test -n "$EXEEXT"; then
   am__EXEEXT_TRUE=
   am__EXEEXT_FALSE='#'
@@ -24565,7 +24709,7 @@ cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
 # report actual input values of CONFIG_FILES etc. instead of their
 # values after options handling.
 ac_log="
-This file was extended by the Parma Polyhedra Library $as_me 1.0, which was
+This file was extended by the Parma Polyhedra Library $as_me 1.1pre8, which was
 generated by GNU Autoconf 2.68.  Invocation command line was
 
   CONFIG_FILES    = $CONFIG_FILES
@@ -24631,7 +24775,7 @@ _ACEOF
 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
 ac_cs_version="\\
-the Parma Polyhedra Library config.status 1.0
+the Parma Polyhedra Library config.status 1.1pre8
 configured by $0, generated by GNU Autoconf 2.68,
   with options \\"\$ac_cs_config\\"
 
@@ -25799,7 +25943,7 @@ $as_echo "$as_me: executing $ac_file commands" >&6;}
     # Strip MF so we end up with the name of the file.
     mf=`echo "$mf" | sed -e 's/:.*$//'`
     # Check whether this is an Automake generated Makefile or not.
-    # We used to match only the files named `Makefile.in', but
+    # We used to match only the files named 'Makefile.in', but
     # some people rename them; so instead we look at the file content.
     # Grep'ing the first line is not enough: some people post-process
     # each Makefile.in and add a new line on top of each file to say so.
@@ -25833,21 +25977,19 @@ $as_echo X"$mf" |
       continue
     fi
     # Extract the definition of DEPDIR, am__include, and am__quote
-    # from the Makefile without running `make'.
+    # from the Makefile without running 'make'.
     DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
     test -z "$DEPDIR" && continue
     am__include=`sed -n 's/^am__include = //p' < "$mf"`
     test -z "am__include" && continue
     am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
-    # When using ansi2knr, U may be empty or an underscore; expand it
-    U=`sed -n 's/^U = //p' < "$mf"`
     # Find all dependency output files, they are included files with
     # $(DEPDIR) in their names.  We invoke sed twice because it is the
     # simplest approach to changing $(DEPDIR) to its actual value in the
     # expansion.
     for file in `sed -n "
       s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
-	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do
       # Make sure the directory exists.
       test -f "$dirpart/$file" && continue
       fdir=`$as_dirname -- "$file" ||
diff --git a/configure.ac b/configure.ac
index 2750ba6..bc97704 100644
--- a/configure.ac
+++ b/configure.ac
@@ -1,6 +1,6 @@
 # Autoconf source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -24,7 +24,7 @@
 # Process this file with Autoconf to produce a configure script.
 
 # Every other copy of the package version number gets its value from here.
-AC_INIT([the Parma Polyhedra Library], [1.0], [ppl-devel at cs.unipr.it], [ppl])
+AC_INIT([the Parma Polyhedra Library], [1.1pre8], [ppl-devel at cs.unipr.it], [ppl])
 
 # Minimum Autoconf version required.
 AC_PREREQ(2.61)
@@ -178,7 +178,7 @@ AM_CONDITIONAL(ICC, test x"$ICC" = xyes)
 # The clang compiler masquerades as gcc, but we want to know.
 if test x"$GCC" = xyes
 then
-  AC_MSG_CHECKING([whether we are actually using Clang])
+  AC_MSG_CHECKING([whether we are actually using clang])
   AC_LANG_PUSH(C)
   AC_COMPILE_IFELSE([AC_LANG_SOURCE([[
 #ifndef __clang__
@@ -194,6 +194,28 @@ choke me
   AC_LANG_POP(C)
 fi
 
+# The llvm-gcc compiler masquerades as gcc, but we want to know.
+if test x"$GCC" = xyes
+then
+  AC_MSG_CHECKING([whether we are actually using llvm-gcc])
+  AC_LANG_PUSH(C)
+  save_CFLAGS="$CFLAGS"
+  CFLAGS="-fplugin-arg-dragonegg-emit-ir -S"
+  AC_COMPILE_IFELSE([AC_LANG_SOURCE([[
+int main() {
+  return 0;
+}
+]])],
+  AC_MSG_RESULT(yes)
+  LLVM_GCC=yes,
+  AC_MSG_RESULT(no)
+  LLVM_GCC=no,
+  AC_MSG_RESULT(no)
+  LLVM_GCC=no)
+  CFLAGS="$save_CFLAGS"
+  AC_LANG_POP(C)
+fi
+
 save_CXXFLAGS="$CXXFLAGS"
 AC_PROG_CXX
 CXXFLAGS="$save_CXXFLAGS"
@@ -236,6 +258,29 @@ choke me
   AC_LANG_POP(C++)
 fi
 
+# The llvm-++ compiler masquerades as g++, but we want to know.
+if test x"$GXX" = xyes
+then
+  AC_MSG_CHECKING([whether we are actually using llvm-g++])
+  AC_LANG_PUSH(C++)
+  save_CXXFLAGS="$CXXFLAGS"
+  CXXFLAGS="-fplugin-arg-dragonegg-emit-ir -S"
+  AC_COMPILE_IFELSE([AC_LANG_SOURCE([[
+int main() {
+  return 0;
+}
+]])],
+  AC_MSG_RESULT(yes)
+  LLVM_GXX=yes,
+  AC_MSG_RESULT(no)
+  LLVM_GXX=no,
+  AC_MSG_RESULT(no)
+  LLVM_GXX=no)
+  CXXFLAGS="$save_CXXFLAGS"
+  AC_LANG_POP(C++)
+fi
+
+
 AC_PROG_FGREP
 AC_PROG_EGREP
 AC_PROG_SED
@@ -492,15 +537,14 @@ then
   then
     OPT_FLAGS="$OPT_FLAGS -fp-model strict -fp-speculation off"
   else
-    # -frounding-math is not yet supported in clang++, if we use it we get
-    # lots of warnings.
-    if test x"$CLANGXX" = xyes
+    # -frounding-math is not yet supported in clang++ or llvm-g++.
+    if test x"$CLANGXX" = xyes || x"$LLVM_GXX" = xyes
     then
       if test x"$use_fpmath" = xyes
       then
         AC_MSG_WARN([CANNOT RELY ON DIRECTED ROUNDING:
 *** DISABLED ALL ABSTRACTIONS BASED ON MACHINE FLOATING-POINT NUMBERS.
-*** clang++ has been detected, which does not provide support for
+*** A compiler has been detected that does not provide support for
 *** -frounding-math (or any other option with the same semantics).
 *** Hence, we cannot rely on floating-point computations to happen
 *** in agreement with the rounding direction(s) used by the PPL.])
@@ -957,7 +1001,7 @@ xall)
     enableval=${default_interfaces}
   fi
   # Make the list blank-separated and lowercase; turn "c++" into "cxx".
-  required_interfaces=`echo "${enableval}" | sed -e 's/-/_/g' -e 's/[[ 	,]][[ 	,]]*/ /g' -e 's/c++/cxx/g' | tr '[[:upper:]]' '[[:lower:]]'`
+  required_interfaces=`echo "${enableval}" | sed -e 's/-/_/g' -e 's/[[  ,]][[   ,]]*/ /g' -e 's/c++/cxx/g' | tr '[[:upper:]]' '[[:lower:]]'`
   # Check that the specified interfaces exist.
   for interface in ${required_interfaces}
   do
@@ -1114,7 +1158,7 @@ then
         ocamlopt_gmp="yes"
       else
         AC_MSG_RESULT(no)
-	ocamlopt_gmp="no"
+        ocamlopt_gmp="no"
       fi
     fi
   fi
@@ -1348,7 +1392,7 @@ xno | xnone)
     enableval=${available_instantiations}
   fi
   # Avoid extra blanks.
-  required_instantiations=`echo "${enableval}" | sed -e 's/[[	 ]][[	 ]]*/ /g' -e 's/[[ ]]*\([[@<>,]]\)/\1/g' -e 's/\([[@<>,]]\)[[ ]]*/\1/g' -e 's/>>/> >/g' -e 's/^[[ ]]//g' -e 's/[[ ]]$//g'`
+  required_instantiations=`echo "${enableval}" | sed -e 's/[[    ]][[    ]]*/ /g' -e 's/[[ ]]*\([[@<>,]]\)/\1/g' -e 's/\([[@<>,]]\)[[ ]]*/\1/g' -e 's/>>/> >/g' -e 's/^[[ ]]//g' -e 's/[[ ]]$//g'`
   # Check the specified instantiations for validity.
   ac_save_CPPFLAGS="$CPPFLAGS"
   CPPFLAGS="$CPPFLAGS -I${srcdir} ${gmp_include_options}"
@@ -1642,12 +1686,12 @@ AC_CONFIG_FILES(Makefile
                 interfaces/C/Makefile
                 interfaces/C/ppl_c_version.h
                 interfaces/C/tests/Makefile
-               	interfaces/Java/Makefile
-		interfaces/Java/jni/Makefile
-		interfaces/Java/tests/Makefile
+                interfaces/Java/Makefile
+                interfaces/Java/jni/Makefile
+                interfaces/Java/tests/Makefile
                 interfaces/Java/parma_polyhedra_library/Makefile
-		interfaces/OCaml/Makefile
-		interfaces/OCaml/tests/Makefile
+                interfaces/OCaml/Makefile
+                interfaces/OCaml/tests/Makefile
                 interfaces/Prolog/Makefile
                 interfaces/Prolog/Ciao/Makefile
                 interfaces/Prolog/GNU/Makefile
diff --git a/demos/Makefile.am b/demos/Makefile.am
index e740daf..646b0dd 100644
--- a/demos/Makefile.am
+++ b/demos/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/demos/Makefile.in b/demos/Makefile.in
index 51264ce..aeb446f 100644
--- a/demos/Makefile.in
+++ b/demos/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -57,7 +73,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = demos
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -90,12 +107,18 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -105,6 +128,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
 AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \
@@ -376,12 +404,12 @@ clean-libtool:
 	-rm -rf .libs _libs
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -391,7 +419,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -405,37 +437,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -444,6 +445,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -507,6 +512,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -542,13 +561,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -669,22 +685,23 @@ ps-am:
 
 uninstall-am:
 
-.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) ctags-recursive \
-	install-am install-strip tags-recursive
+.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) \
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-generic clean-libtool \
-	ctags ctags-recursive distclean distclean-generic \
-	distclean-libtool distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-pdf install-pdf-am \
-	install-ps install-ps-am install-strip installcheck \
-	installcheck-am installdirs installdirs-am maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-generic \
-	mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \
-	uninstall uninstall-am
+	cscopelist cscopelist-recursive ctags ctags-recursive \
+	distclean distclean-generic distclean-libtool distclean-tags \
+	distdir dvi dvi-am html html-am info info-am install \
+	install-am install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-man \
+	install-pdf install-pdf-am install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	installdirs-am maintainer-clean maintainer-clean-generic \
+	mostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \
+	ps ps-am tags tags-recursive uninstall uninstall-am
 
 
 # Tell versions [3.59,3.63) of GNU make to not export all variables.
diff --git a/demos/ppl_lcdd/Makefile.am b/demos/ppl_lcdd/Makefile.am
index c85841c..2d2c462 100644
--- a/demos/ppl_lcdd/Makefile.am
+++ b/demos/ppl_lcdd/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -43,14 +43,16 @@ polka_lcdd.o: $(srcdir)/ppl_lcdd.cc $(top_builddir)/utils/libppl_utils.a
 	$(CXXCOMPILE) -c -o $@ -DUSE_POLKA $(srcdir)/ppl_lcdd.cc
 
 polka_lcdd: polka_lcdd.o
-	$(CXXLINK) $< -lpolkag -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
+	$(CXXLINK) polka_lcdd.o \
+	    -lpolkag -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
 
 
 polylib_lcdd.o:	$(srcdir)/ppl_lcdd.cc
 	$(CXXCOMPILE) -c -o $@ -DUSE_POLYLIB $(srcdir)/ppl_lcdd.cc
 
 polylib_lcdd: polylib_lcdd.o $(top_builddir)/utils/libppl_utils.a
-	$(CXXLINK) $< -lpolylibgmp -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
+	$(CXXLINK) polylib_lcdd.o \
+	    -lpolylibgmp -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
 
 EXTRA_DIST = \
 expected_mpz \
diff --git a/demos/ppl_lcdd/Makefile.in b/demos/ppl_lcdd/Makefile.in
index 1fba06f..14f4f89 100644
--- a/demos/ppl_lcdd/Makefile.in
+++ b/demos/ppl_lcdd/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ host_triplet = @host@
 bin_PROGRAMS = ppl_lcdd$(EXEEXT)
 subdir = demos/ppl_lcdd
 DIST_COMMON = $(dist_man_MANS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -102,6 +119,19 @@ ppl_lcdd_DEPENDENCIES = $(top_builddir)/src/libppl.la \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -114,20 +144,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(ppl_lcdd_SOURCES)
 DIST_SOURCES = $(ppl_lcdd_SOURCES)
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -137,6 +163,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -491,8 +522,11 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -572,11 +606,18 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-man1: $(dist_man_MANS)
 	@$(NORMAL_INSTALL)
-	test -z "$(man1dir)" || $(MKDIR_P) "$(DESTDIR)$(man1dir)"
-	@list=''; test -n "$(man1dir)" || exit 0; \
-	{ for i in $$list; do echo "$$i"; done; \
-	l2='$(dist_man_MANS)'; for i in $$l2; do echo "$$i"; done | \
-	  sed -n '/\.1[a-z]*$$/p'; \
+	@list1=''; \
+	list2='$(dist_man_MANS)'; \
+	test -n "$(man1dir)" \
+	  && test -n "`echo $$list1$$list2`" \
+	  || exit 0; \
+	echo " $(MKDIR_P) '$(DESTDIR)$(man1dir)'"; \
+	$(MKDIR_P) "$(DESTDIR)$(man1dir)" || exit 1; \
+	{ for i in $$list1; do echo "$$i"; done;  \
+	if test -n "$$list2"; then \
+	  for i in $$list2; do echo "$$i"; done \
+	    | sed -n '/\.1[a-z]*$$/p'; \
+	fi; \
 	} | while read p; do \
 	  if test -f $$p; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; echo "$$p"; \
@@ -608,12 +649,12 @@ uninstall-man1:
 	dir='$(DESTDIR)$(man1dir)'; $(am__uninstall_files_from_dir)
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -623,7 +664,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -637,37 +682,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -676,6 +690,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -739,6 +757,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -749,10 +781,10 @@ distdir: $(DISTFILES)
 	    if test -f "$$d$$p"; then echo "$$d$$p"; else :; fi; done`; \
 	  if test -n "$$list" && \
 	    grep 'ab help2man is required to generate this page' $$list >/dev/null; then \
-	    echo "error: found man pages containing the \`missing help2man' replacement text:" >&2; \
+	    echo "error: found man pages containing the 'missing help2man' replacement text:" >&2; \
 	    grep -l 'ab help2man is required to generate this page' $$list | sed 's/^/         /' >&2; \
 	    echo "       to fix them, install help2man, remove and regenerate the man pages;" >&2; \
-	    echo "       typically \`make maintainer-clean' will remove them" >&2; \
+	    echo "       typically 'make maintainer-clean' will remove them" >&2; \
 	    exit 1; \
 	  else :; fi; \
 	else :; fi
@@ -787,13 +819,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -927,22 +956,24 @@ uninstall-am: uninstall-binPROGRAMS uninstall-man
 uninstall-man: uninstall-man1
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) check-am \
-	ctags-recursive install-am install-strip tags-recursive
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am check-local clean clean-binPROGRAMS \
-	clean-generic clean-libtool ctags ctags-recursive distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-binPROGRAMS install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-man1 install-pdf \
-	install-pdf-am install-ps install-ps-am install-strip \
-	installcheck installcheck-am installdirs installdirs-am \
-	maintainer-clean maintainer-clean-generic mostlyclean \
-	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
-	pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \
+	clean-generic clean-libtool cscopelist cscopelist-recursive \
+	ctags ctags-recursive distclean distclean-compile \
+	distclean-generic distclean-libtool distclean-tags distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	install-binPROGRAMS install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-man \
+	install-man1 install-pdf install-pdf-am install-ps \
+	install-ps-am install-strip installcheck installcheck-am \
+	installdirs installdirs-am maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-compile \
+	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags tags-recursive uninstall uninstall-am \
 	uninstall-binPROGRAMS uninstall-man uninstall-man1
 
 
@@ -950,13 +981,15 @@ polka_lcdd.o: $(srcdir)/ppl_lcdd.cc $(top_builddir)/utils/libppl_utils.a
 	$(CXXCOMPILE) -c -o $@ -DUSE_POLKA $(srcdir)/ppl_lcdd.cc
 
 polka_lcdd: polka_lcdd.o
-	$(CXXLINK) $< -lpolkag -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
+	$(CXXLINK) polka_lcdd.o \
+	    -lpolkag -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
 
 polylib_lcdd.o:	$(srcdir)/ppl_lcdd.cc
 	$(CXXCOMPILE) -c -o $@ -DUSE_POLYLIB $(srcdir)/ppl_lcdd.cc
 
 polylib_lcdd: polylib_lcdd.o $(top_builddir)/utils/libppl_utils.a
-	$(CXXLINK) $< -lpolylibgmp -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
+	$(CXXLINK) polylib_lcdd.o \
+	    -lpolylibgmp -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
 
 @HAVE_MD5SUM_TRUE at check-local: ppl_lcdd$(EXEEXT)
 @HAVE_MD5SUM_TRUE@	echo $(TOUGH_EXAMPLES) >tough_examples
diff --git a/demos/ppl_lcdd/examples/Makefile.am b/demos/ppl_lcdd/examples/Makefile.am
index 4e6d6b7..8a516bf 100644
--- a/demos/ppl_lcdd/examples/Makefile.am
+++ b/demos/ppl_lcdd/examples/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/demos/ppl_lcdd/examples/Makefile.in b/demos/ppl_lcdd/examples/Makefile.in
index 4a6d5b5..1d03479 100644
--- a/demos/ppl_lcdd/examples/Makefile.in
+++ b/demos/ppl_lcdd/examples/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,7 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = demos/ppl_lcdd/examples
 DIST_COMMON = README $(dist_noinst_DATA) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -92,14 +108,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(dist_noinst_DATA)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
@@ -452,6 +479,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
diff --git a/demos/ppl_lcdd/ppl_lcdd.1 b/demos/ppl_lcdd/ppl_lcdd.1
index 9d5ebb8..7a8bf46 100644
--- a/demos/ppl_lcdd/ppl_lcdd.1
+++ b/demos/ppl_lcdd/ppl_lcdd.1
@@ -51,7 +51,7 @@ See the file \fBCREDITS\fR in the source distribution or use the command
 Report bugs to <ppl\-devel at cs.unipr.it>.
 .SH COPYRIGHT
 Copyright (C) 2001\-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010\-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010\-2013 BUGSENG srl (http://bugseng.com)
 .br
 This is free software; see the file \fBCOPYING\fR in the source
 distribution or use the command \fBppl\-config \-\-copying\fR to
diff --git a/demos/ppl_lcdd/ppl_lcdd.cc b/demos/ppl_lcdd/ppl_lcdd.cc
index 744c696..8e2e2f4 100644
--- a/demos/ppl_lcdd/ppl_lcdd.cc
+++ b/demos/ppl_lcdd/ppl_lcdd.cc
@@ -1,6 +1,6 @@
 /* A sort of clone of the cddlib test program `lcdd'.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -255,8 +255,8 @@ set_output(const char* file_name) {
 
   if (file_name) {
     output_stream_p = new std::ofstream(file_name,
-					std::ios_base::out
-					| std::ios_base::app);
+                                        std::ios_base::out
+                                        | std::ios_base::app);
     if (!*output_stream_p)
       fatal("cannot open output file `%s'", file_name);
     output_file_name = file_name;
@@ -298,7 +298,7 @@ warning(const char* format, ...) {
 
 #ifdef PPL_LCDD_SUPPORTS_LIMIT_ON_CPU_TIME
 
-extern "C" typedef void (*sig_handler_type)(int);
+extern "C" typedef void (* const sig_handler_type)(int);
 
 void
 set_alarm_on_cpu_time(const unsigned long seconds, sig_handler_type handler) {
@@ -360,7 +360,7 @@ extern "C" void
 timeout(int) {
   try {
     std::cerr << "TIMEOUT"
-	      << std::endl;
+              << std::endl;
   }
   catch (...) {
   }
@@ -368,7 +368,7 @@ timeout(int) {
   try {
     if (output_file_name)
       output() << "TIMEOUT"
-	       << std::endl;
+               << std::endl;
   }
   catch (...) {
   }
@@ -381,10 +381,10 @@ process_options(int argc, char* argv[]) {
   while (true) {
 #ifdef PPL_HAVE_GETOPT_H
     int option_index = 0;
-    int c = getopt_long(argc, argv, OPTION_LETTERS, long_options,
-			&option_index);
+    const int c = getopt_long(argc, argv, OPTION_LETTERS, long_options,
+                              &option_index);
 #else
-    int c = getopt(argc, argv, OPTION_LETTERS);
+    const int c = getopt(argc, argv, OPTION_LETTERS);
 #endif
 
     if (c == EOF)
@@ -407,23 +407,23 @@ process_options(int argc, char* argv[]) {
     case 'C':
       l = strtol(optarg, &endptr, 10);
       if (*endptr || l < 0)
-	fatal("a non-negative integer must follow `-C'");
+        fatal("a non-negative integer must follow `-C'");
       else
-	max_seconds_of_cpu_time = l;
+        max_seconds_of_cpu_time = static_cast<unsigned long>(l);
       break;
 
 #endif // defined(PPL_LCDD_SUPPORTS_LIMIT_ON_CPU_TIME)
 
     case 'R':
       {
-        const int MEGA = 1024*1024;
+        const unsigned long MEGA = 1024U*1024U;
         l = strtol(optarg, &endptr, 10);
         if (*endptr || l < 0)
           fatal("a non-negative integer must follow `-R'");
         else if (static_cast<unsigned long>(l) > ULONG_MAX/MEGA)
           max_bytes_of_virtual_memory = ULONG_MAX;
         else
-          max_bytes_of_virtual_memory = l*MEGA;
+          max_bytes_of_virtual_memory = static_cast<unsigned long>(l)*MEGA;
       }
       break;
 
@@ -487,15 +487,15 @@ maybe_print_clock() {
 
 void
 normalize(const std::vector<mpq_class>& source,
-	  std::vector<mpz_class>& dest,
-	  mpz_class& denominator) {
+          std::vector<mpz_class>& dest,
+          mpz_class& denominator) {
   typedef std::vector<mpq_class>::size_type size_type;
-  size_type n = source.size();
+  const size_type n = source.size();
   denominator = 1;
   for (size_type i = 0; i < n; ++i)
     mpz_lcm(denominator.get_mpz_t(),
-	    denominator.get_mpz_t(),
-	    source[i].get_den().get_mpz_t());
+            denominator.get_mpz_t(),
+            source[i].get_den().get_mpz_t());
   for (size_type i = 0; i < n; ++i)
     dest[i] = denominator*source[i];
 }
@@ -545,17 +545,17 @@ enum Number_Type { INTEGER, RATIONAL, REAL };
 
 void
 read_coefficients(std::istream& in,
-		  const Number_Type number_type,
-		  std::vector<mpz_class>& coefficients,
-		  mpz_class& denominator) {
+                  const Number_Type number_type,
+                  std::vector<mpz_class>& coefficients,
+                  mpz_class& denominator) {
   typedef std::vector<mpz_class>::size_type size_type;
-  size_type num_coefficients = coefficients.size();
+  const size_type num_coefficients = coefficients.size();
   switch (number_type) {
   case INTEGER:
     {
       for (unsigned i = 0; i < num_coefficients; ++i)
-	if (!guarded_read(in, coefficients[i]))
-	  error("missing or invalid integer coefficient");
+        if (!guarded_read(in, coefficients[i]))
+          error("missing or invalid integer coefficient");
       denominator = 1;
       break;
     }
@@ -563,8 +563,8 @@ read_coefficients(std::istream& in,
     {
       std::vector<mpq_class> rational_coefficients(num_coefficients);
       for (unsigned i = 0; i < num_coefficients; ++i)
-	if (!guarded_read(in, rational_coefficients[i]))
-	  error("missing or invalid rational coefficient");
+        if (!guarded_read(in, rational_coefficients[i]))
+          error("missing or invalid rational coefficient");
       normalize(rational_coefficients, coefficients, denominator);
       break;
     }
@@ -572,10 +572,10 @@ read_coefficients(std::istream& in,
     {
       std::vector<mpq_class> rational_coefficients(num_coefficients);
       for (unsigned i = 0; i < num_coefficients; ++i) {
-	double d;
-	if (!guarded_read(in, d))
-	  error("missing or invalid real coefficient");
-	rational_coefficients[i] = mpq_class(d);
+        double d;
+        if (!guarded_read(in, d))
+          error("missing or invalid real coefficient");
+        rational_coefficients[i] = mpq_class(d);
       }
       normalize(rational_coefficients, coefficients, denominator);
       break;
@@ -585,8 +585,8 @@ read_coefficients(std::istream& in,
 
 void
 read_indexes_set(std::istream& in,
-		 std::set<unsigned>& dest,
-		 const char* what) {
+                 std::set<unsigned>& dest,
+                 const char* what) {
   assert(dest.empty());
   unsigned num_elements;
   if (!guarded_read(in, num_elements))
@@ -619,11 +619,11 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     else if (s == "linearity" || s == "equality" || s == "partial_enum") {
       read_indexes_set(in, linearity, "linearity");
       if (verbose) {
-	std::cerr << "Linearity: ";
-	for (std::set<unsigned>::const_iterator j = linearity.begin(),
-	       linearity_end = linearity.end(); j != linearity_end; ++j)
-	  std::cerr << *j << " ";
-	std::cerr << std::endl;
+        std::cerr << "Linearity: ";
+        for (std::set<unsigned>::const_iterator j = linearity.begin(),
+               linearity_end = linearity.end(); j != linearity_end; ++j)
+          std::cerr << *j << " ";
+        std::cerr << std::endl;
       }
     }
     else if (s == "begin")
@@ -644,14 +644,14 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     std::istringstream iss(s);
     if (!guarded_read(iss, num_rows))
       error("illegal number of rows `%s' (\"*****\" would be accepted)",
-	    s.c_str());
+            s.c_str());
     has_num_rows = true;
   }
 
   unsigned num_columns;
   if (!guarded_read(in, num_columns))
     error("illegal or missing number of columns");
-  unsigned space_dim = num_columns - 1;
+  const unsigned space_dim = num_columns - 1;
 
   if (!guarded_read(in, s))
     error("missing number type");
@@ -672,8 +672,8 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     else
       std::cerr << '?';
     std::cerr << " x " << num_columns
-	      << "; number type: " << s
-	      << std::endl;
+              << "; number type: " << s
+              << std::endl;
   }
 
 #if defined(USE_PPL)
@@ -707,80 +707,80 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     for (row = 0; !has_num_rows || row < num_rows; ++row) {
       int vertex_marker;
       if (!has_num_rows) {
-	// Must be prepared to read an "end" here.
-	if (!guarded_read(in, s))
-	  error("missing vertex marker");
-	if (s == "end")
-	  break;
-	std::istringstream iss(s);
-	if (!guarded_read(iss, vertex_marker)
-	    || vertex_marker < 0 || vertex_marker > 1)
-	  error("illegal vertex marker `%s'", s.c_str());
+        // Must be prepared to read an "end" here.
+        if (!guarded_read(in, s))
+          error("missing vertex marker");
+        if (s == "end")
+          break;
+        std::istringstream iss(s);
+        if (!guarded_read(iss, vertex_marker)
+            || vertex_marker < 0 || vertex_marker > 1)
+          error("illegal vertex marker `%s'", s.c_str());
       }
       else if (!guarded_read(in, vertex_marker)
-		 || vertex_marker < 0 || vertex_marker > 1)
-	error("illegal or missing vertex marker");
+                 || vertex_marker < 0 || vertex_marker > 1)
+        error("illegal or missing vertex marker");
       read_coefficients(in, number_type, coefficients, denominator);
 
 #if defined(USE_PPL)
       // PPL variables have indices 0, 1, ..., space_dim-1.
       PPL::Linear_Expression e;
       for (unsigned j = space_dim; j-- > 0; )
-	e += coefficients[j] * PPL::Variable(j);
+        e += coefficients[j] * PPL::Variable(j);
 #elif defined(USE_POLKA)
       // NewPolka variables have indices 2, 3, ..., space_dim+1.
       for (unsigned j = space_dim; j-- > 0; )
-	pkint_set(mat->p[row][j+2], coefficients[j].get_mpz_t());
+        pkint_set(mat->p[row][j+2], coefficients[j].get_mpz_t());
 #elif defined(USE_POLYLIB)
       // PolyLib variables have indices 1, 2, ..., space_dim.
       for (unsigned j = space_dim; j-- > 0; )
-	value_assign(mat->p[row][j+1], coefficients[j].get_mpz_t());
+        value_assign(mat->p[row][j+1], coefficients[j].get_mpz_t());
 #endif
       if (vertex_marker == 1) {
-	assert(linearity.find(row+1) == linearity_end);
+        assert(linearity.find(row+1) == linearity_end);
 #if defined(USE_PPL)
-	gs.insert(point(e, denominator));
+        gs.insert(point(e, denominator));
 #elif defined(USE_POLKA)
-	// NewPolka stores the generator kind at index 0 (1 = ray/point)
-	// and the common denominator at index 1.
-	pkint_set_si(mat->p[row][0], 1);
-	pkint_set(mat->p[row][1], denominator.get_mpz_t());
+        // NewPolka stores the generator kind at index 0 (1 = ray/point)
+        // and the common denominator at index 1.
+        pkint_set_si(mat->p[row][0], 1);
+        pkint_set(mat->p[row][1], denominator.get_mpz_t());
 #elif defined(USE_POLYLIB)
-	// PolyLib stores the generator kind at index 0 (1 = ray/point)
-	// and the common denominator at index space_dim+1.
-	value_set_si(mat->p[row][0], 1);
-	value_assign(mat->p[row][space_dim+1], denominator.get_mpz_t());
+        // PolyLib stores the generator kind at index 0 (1 = ray/point)
+        // and the common denominator at index space_dim+1.
+        value_set_si(mat->p[row][0], 1);
+        value_assign(mat->p[row][space_dim+1], denominator.get_mpz_t());
 #endif
-	has_a_point = true;
+        has_a_point = true;
       }
       else if (linearity.find(row+1) != linearity_end) {
 #if defined(USE_PPL)
-	gs.insert(line(e));
+        gs.insert(line(e));
 #elif defined(USE_POLKA)
-	// NewPolka stores the generator kind at index 0 (0 = line)
-	// and the common denominator at index 1 (0 for ray/line).
-	pkint_set_si(mat->p[row][0], 0);
-	pkint_set_si(mat->p[row][1], 0);
+        // NewPolka stores the generator kind at index 0 (0 = line)
+        // and the common denominator at index 1 (0 for ray/line).
+        pkint_set_si(mat->p[row][0], 0);
+        pkint_set_si(mat->p[row][1], 0);
 #elif defined(USE_POLYLIB)
-	// PolyLib stores the generator kind at index 0 (0 = line)
-	// and the common denominator at index space_dim+1 (0 for ray/line).
-	value_set_si(mat->p[row][0], 0);
-	value_set_si(mat->p[row][space_dim+1], 0);
+        // PolyLib stores the generator kind at index 0 (0 = line)
+        // and the common denominator at index space_dim+1 (0 for ray/line).
+        value_set_si(mat->p[row][0], 0);
+        value_set_si(mat->p[row][space_dim+1], 0);
 #endif
       }
       else {
 #if defined(USE_PPL)
-	gs.insert(ray(e));
+        gs.insert(ray(e));
 #elif defined(USE_POLKA)
-	// NewPolka stores the generator kind at index 0 (1 = ray/point)
-	// and the common denominator at index 1 (0 for ray/line).
-	pkint_set_si(mat->p[row][0], 1);
-	pkint_set_si(mat->p[row][1], 0);
+        // NewPolka stores the generator kind at index 0 (1 = ray/point)
+        // and the common denominator at index 1 (0 for ray/line).
+        pkint_set_si(mat->p[row][0], 1);
+        pkint_set_si(mat->p[row][1], 0);
 #elif defined(USE_POLYLIB)
-	// PolyLib stores the generator kind at index 0 (1 = ray/point)
-	// and the common denominator at index space_dim+1 (0 for ray/line).
-	value_set_si(mat->p[row][0], 1);
-	value_set_si(mat->p[row][space_dim+1], 0);
+        // PolyLib stores the generator kind at index 0 (1 = ray/point)
+        // and the common denominator at index space_dim+1 (0 for ray/line).
+        value_set_si(mat->p[row][0], 1);
+        value_set_si(mat->p[row][space_dim+1], 0);
 #endif
       }
     }
@@ -793,23 +793,23 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
       pkint_set_si(mat->p[num_rows][0], 1);
       pkint_set_si(mat->p[num_rows][1], 1);
       for (unsigned j = space_dim; j-- > 0; )
-	pkint_set_si(mat->p[num_rows][j+2], 0);
+        pkint_set_si(mat->p[num_rows][j+2], 0);
       ++num_rows;
 #elif defined(USE_POLYLIB)
       // Add the origin as a point.
       value_set_si(mat->p[num_rows][0], 1);
       value_set_si(mat->p[num_rows][space_dim+1], 1);
       for (unsigned j = space_dim; j-- > 0; )
-	value_set_si(mat->p[num_rows][j+1], 0);
+        value_set_si(mat->p[num_rows][j+1], 0);
       ++num_rows;
 #endif
     }
 
     if (verbose) {
       if (!has_num_rows)
-	std::cerr << "Problem dimension: " << row << " x " << num_columns
-		  << "; number type: " << s
-		  << std::endl;
+        std::cerr << "Problem dimension: " << row << " x " << num_columns
+                  << "; number type: " << s
+                  << std::endl;
 
 #if defined(USE_PPL)
       using namespace PPL::IO_Operators;
@@ -832,68 +832,68 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     mpz_class denominator;
     for (row = 0; !has_num_rows || row < num_rows; ++row) {
       if (!has_num_rows) {
-	// Must be prepared to read an "end" here.
-	std::getline(in, s);
-	if (!in)
-	  error("premature end of file while seeking "
-		"for coefficients or `end'");
-	if (s.substr(0, 2) == "end")
-	  break;
-	std::istringstream iss(s);
-	read_coefficients(iss, number_type, coefficients, denominator);
+        // Must be prepared to read an "end" here.
+        std::getline(in, s);
+        if (!in)
+          error("premature end of file while seeking "
+                "for coefficients or `end'");
+        if (s.substr(0, 2) == "end")
+          break;
+        std::istringstream iss(s);
+        read_coefficients(iss, number_type, coefficients, denominator);
       }
       else
-	read_coefficients(in, number_type, coefficients, denominator);
+        read_coefficients(in, number_type, coefficients, denominator);
 
 #if defined(USE_PPL)
       // PPL variables have indices 0, 1, ..., space_dim-1.
       PPL::Linear_Expression e;
       for (unsigned j = num_columns; j-- > 1; )
-	e += coefficients[j] * PPL::Variable(j-1);
+        e += coefficients[j] * PPL::Variable(j-1);
       e += coefficients[0];
 #elif defined(USE_POLKA)
       // NewPolka variables have indices 2, 3, ..., space_dim+1.
       for (unsigned j = num_columns; j-- > 1; )
-	pkint_set(mat->p[row][j+1], coefficients[j].get_mpz_t());
+        pkint_set(mat->p[row][j+1], coefficients[j].get_mpz_t());
       // NewPolka stores the inhomogeneous term at index 1.
       pkint_set(mat->p[row][1], coefficients[0].get_mpz_t());
 #elif defined(USE_POLYLIB)
       // PolyLib variables have indices 1, 2, ..., space_dim.
       for (unsigned j = num_columns; j-- > 1; )
-	value_assign(mat->p[row][j], coefficients[j].get_mpz_t());
+        value_assign(mat->p[row][j], coefficients[j].get_mpz_t());
       // PolyLib stores the inhomogeneous term at index space_dim+1.
       value_assign(mat->p[row][space_dim+1], coefficients[0].get_mpz_t());
 #endif
 
       if (linearity.find(row+1) != linearity_end) {
 #if defined(USE_PPL)
-	cs.insert(e == 0);
+        cs.insert(e == 0);
 #elif defined(USE_POLKA)
-	// NewPolka stores the constraint kind at index 0 (0 = equality).
-	pkint_set_si(mat->p[row][0], 0);
+        // NewPolka stores the constraint kind at index 0 (0 = equality).
+        pkint_set_si(mat->p[row][0], 0);
 #elif defined(USE_POLYLIB)
-	// PolyLib stores the constraint kind at index 0 (0 = equality).
-	value_set_si(mat->p[row][0], 0);
+        // PolyLib stores the constraint kind at index 0 (0 = equality).
+        value_set_si(mat->p[row][0], 0);
 #endif
       }
       else {
 #if defined(USE_PPL)
-	cs.insert(e >= 0);
+        cs.insert(e >= 0);
 #elif defined(USE_POLKA)
-	// NewPolka stores the constraint kind at index 0 (1 = inequality).
-	pkint_set_si(mat->p[row][0], 1);
+        // NewPolka stores the constraint kind at index 0 (1 = inequality).
+        pkint_set_si(mat->p[row][0], 1);
 #elif defined(USE_POLYLIB)
-	// PolyLib stores the constraint kind at index 0 (1 = inequality).
-	value_set_si(mat->p[row][0], 1);
+        // PolyLib stores the constraint kind at index 0 (1 = inequality).
+        value_set_si(mat->p[row][0], 1);
 #endif
       }
     }
 
     if (verbose) {
       if (!has_num_rows)
-	std::cerr << "Problem dimension: " << row << " x " << num_columns
-		  << "; number type: " << s
-		  << std::endl;
+        std::cerr << "Problem dimension: " << row << " x " << num_columns
+                  << "; number type: " << s
+                  << std::endl;
 
 #if defined(USE_PPL)
       using namespace PPL::IO_Operators;
@@ -929,7 +929,7 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     // PolyLib is not lazy: it will perform the conversion immediately.
     maybe_start_clock();
     ph = AddConstraints(mat->p[0], num_rows, ph,
-			max_constraints_or_generators);
+                        max_constraints_or_generators);
     maybe_print_clock();
 #endif
   }
@@ -944,7 +944,7 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
     // PolyLib is not lazy: it will perform the conversion immediately.
     maybe_start_clock();
     ph = AddRays(mat->p[0], num_rows, ph,
-		 max_constraints_or_generators);
+                 max_constraints_or_generators);
     maybe_print_clock();
 #endif
   }
@@ -953,8 +953,8 @@ read_polyhedron(std::istream& in, POLYHEDRON_TYPE& ph) {
 
 void
 write_polyhedron(std::ostream& out,
-		 const POLYHEDRON_TYPE& ph,
-		 const Representation rep) {
+                 const POLYHEDRON_TYPE& ph,
+                 const Representation rep) {
   if (rep == H)
     guarded_write(out, "H-representation\n");
   else {
@@ -968,19 +968,19 @@ write_polyhedron(std::ostream& out,
   if (rep == H) {
     const PPL::Constraint_System& cs = ph.constraints();
     for (PPL::Constraint_System::const_iterator i = cs.begin(),
-	   cs_end = cs.end(); i != cs_end; ++i) {
+           cs_end = cs.end(); i != cs_end; ++i) {
       ++num_rows;
       if (i->is_equality())
-	linearity.insert(linearity.end(), num_rows);
+        linearity.insert(linearity.end(), num_rows);
     }
   }
   else {
     const PPL::Generator_System& gs = ph.generators();
     for (PPL::Generator_System::const_iterator i = gs.begin(),
-	   gs_end = gs.end(); i != gs_end; ++i) {
+           gs_end = gs.end(); i != gs_end; ++i) {
       ++num_rows;
       if (i->is_line())
-	linearity.insert(linearity.end(), num_rows);
+        linearity.insert(linearity.end(), num_rows);
     }
   }
 #elif defined(USE_POLKA)
@@ -1006,7 +1006,7 @@ write_polyhedron(std::ostream& out,
     guarded_write(out, "linearity ");
     guarded_write(out, linearity.size());
     for (std::set<unsigned>::const_iterator j = linearity.begin(),
-	   linearity_end = linearity.end(); j != linearity_end; ++j) {
+           linearity_end = linearity.end(); j != linearity_end; ++j) {
       guarded_write(out, ' ');
       guarded_write(out, *j);
     }
@@ -1014,11 +1014,11 @@ write_polyhedron(std::ostream& out,
   }
 
 #if defined(USE_PPL)
-  PPL::dimension_type space_dim = ph.space_dimension();
+  const PPL::dimension_type space_dim = ph.space_dimension();
 #elif defined(USE_POLKA)
-  unsigned space_dim = poly_dimension(ph);
+  const unsigned space_dim = poly_dimension(ph);
 #elif defined(USE_POLYLIB)
-  unsigned space_dim = mat->NbColumns - 2;
+  const unsigned space_dim = mat->NbColumns - 2;
 #endif
 
   guarded_write(out, "begin\n");
@@ -1035,12 +1035,12 @@ write_polyhedron(std::ostream& out,
   if (rep == H) {
     const PPL::Constraint_System& cs = ph.constraints();
     for (PPL::Constraint_System::const_iterator i = cs.begin(),
-	   cs_end = cs.end(); i != cs_end; ++i) {
+           cs_end = cs.end(); i != cs_end; ++i) {
       const PPL::Constraint& c = *i;
       guarded_write(out, c.inhomogeneous_term());
       for (PPL::dimension_type j = 0; j < space_dim; ++j) {
-	guarded_write(out, ' ');
-	guarded_write(out, c.coefficient(PPL::Variable(j)));
+        guarded_write(out, ' ');
+        guarded_write(out, c.coefficient(PPL::Variable(j)));
       }
       guarded_write(out, '\n');
     }
@@ -1049,32 +1049,32 @@ write_polyhedron(std::ostream& out,
     assert(rep == V);
     const PPL::Generator_System& gs = ph.generators();
     for (PPL::Generator_System::const_iterator i = gs.begin(),
-	   gs_end = gs.end(); i != gs_end; ++i) {
+           gs_end = gs.end(); i != gs_end; ++i) {
       const PPL::Generator& g = *i;
       if (g.is_point()) {
-	guarded_write(out, '1');
-	const PPL::Coefficient& divisor = g.divisor();
-	for (PPL::dimension_type j = 0; j < space_dim; ++j) {
-	  guarded_write(out, ' ');
-	  if (g.coefficient(PPL::Variable(j)) == 0)
-	    guarded_write(out, '0');
-	  else {
-	    mpz_class numer, denom;
-	    PPL::assign_r(numer,
-			g.coefficient(PPL::Variable(j)),
-			PPL::ROUND_NOT_NEEDED);
-	    PPL::assign_r(denom, divisor, PPL::ROUND_NOT_NEEDED);
-	    guarded_write(out, mpq_class(numer, denom));
-	  }
-	}
+        guarded_write(out, '1');
+        const PPL::Coefficient& divisor = g.divisor();
+        for (PPL::dimension_type j = 0; j < space_dim; ++j) {
+          guarded_write(out, ' ');
+          if (g.coefficient(PPL::Variable(j)) == 0)
+            guarded_write(out, '0');
+          else {
+            mpz_class numer, denom;
+            PPL::assign_r(numer,
+                        g.coefficient(PPL::Variable(j)),
+                        PPL::ROUND_NOT_NEEDED);
+            PPL::assign_r(denom, divisor, PPL::ROUND_NOT_NEEDED);
+            guarded_write(out, mpq_class(numer, denom));
+          }
+        }
       }
       else {
-	// `g' is a ray or a line.
-	guarded_write(out, '0');
-	for (PPL::dimension_type j = 0; j < space_dim; ++j) {
-	  guarded_write(out, ' ');
-	  guarded_write(out, g.coefficient(PPL::Variable(j)));
-	}
+        // `g' is a ray or a line.
+        guarded_write(out, '0');
+        for (PPL::dimension_type j = 0; j < space_dim; ++j) {
+          guarded_write(out, ' ');
+          guarded_write(out, g.coefficient(PPL::Variable(j)));
+        }
       }
       guarded_write(out, '\n');
     }
@@ -1087,8 +1087,8 @@ write_polyhedron(std::ostream& out,
       guarded_write(out, c[1]);
       // The variables' coefficients.
       for (unsigned j = 0; j < space_dim; ++j) {
-	guarded_write(out, ' ');
-	guarded_write(out, c[j+2]);
+        guarded_write(out, ' ');
+        guarded_write(out, c[j+2]);
       }
       guarded_write(out, '\n');
     }
@@ -1100,21 +1100,21 @@ write_polyhedron(std::ostream& out,
       guarded_write(out, g[0]);
       const pkint_t divisor = g[1];
       if (pkint_sgn(divisor) != 0)
-	// `g' is a point.
-	for (unsigned j = 0; j < space_dim; ++j) {
-	  guarded_write(out, ' ');
-	  if (pkint_sgn(g[j+2]) == 0)
-	    guarded_write(out, '0');
-	  else
-	    guarded_write(out, mpq_class(mpz_class(g[j+2].rep),
-					 mpz_class(divisor.rep)));
-	}
+        // `g' is a point.
+        for (unsigned j = 0; j < space_dim; ++j) {
+          guarded_write(out, ' ');
+          if (pkint_sgn(g[j+2]) == 0)
+            guarded_write(out, '0');
+          else
+            guarded_write(out, mpq_class(mpz_class(g[j+2].rep),
+                                         mpz_class(divisor.rep)));
+        }
       else
-	// `g' is a ray or a line.
-	for (unsigned j = 0; j < space_dim; ++j) {
-	  guarded_write(out, ' ');
-	  guarded_write(out, g[j+2]);
-	}
+        // `g' is a ray or a line.
+        for (unsigned j = 0; j < space_dim; ++j) {
+          guarded_write(out, ' ');
+          guarded_write(out, g[j+2]);
+        }
       guarded_write(out, '\n');
     }
   }
@@ -1126,8 +1126,8 @@ write_polyhedron(std::ostream& out,
       guarded_write(out, c[space_dim+1]);
       // The variables' coefficients.
       for (unsigned j = 0; j < space_dim; ++j) {
-	guarded_write(out, ' ');
-	guarded_write(out, c[j+1]);
+        guarded_write(out, ' ');
+        guarded_write(out, c[j+1]);
       }
       guarded_write(out, '\n');
     }
@@ -1139,21 +1139,21 @@ write_polyhedron(std::ostream& out,
       guarded_write(out, g[0]);
       const Value& divisor = g[space_dim+1];
       if (value_sign(divisor) != 0)
-	// `g' is a point.
-	for (unsigned j = 0; j < space_dim; ++j) {
-	  guarded_write(out, ' ');
-	  if (value_sign(g[j+1]) == 0)
-	    guarded_write(out, '0');
-	  else
-	    guarded_write(out, mpq_class(mpz_class(g[j+1]),
-					 mpz_class(divisor)));
-	}
+        // `g' is a point.
+        for (unsigned j = 0; j < space_dim; ++j) {
+          guarded_write(out, ' ');
+          if (value_sign(g[j+1]) == 0)
+            guarded_write(out, '0');
+          else
+            guarded_write(out, mpq_class(mpz_class(g[j+1]),
+                                         mpz_class(divisor)));
+        }
       else
-	// `g' is a ray or a line.
-	for (unsigned j = 0; j < space_dim; ++j) {
-	  guarded_write(out, ' ');
-	  guarded_write(out, g[j+1]);
-	}
+        // `g' is a ray or a line.
+        for (unsigned j = 0; j < space_dim; ++j) {
+          guarded_write(out, ' ');
+          guarded_write(out, g[j+1]);
+        }
       guarded_write(out, '\n');
     }
   }
@@ -1181,12 +1181,12 @@ main(int argc, char* argv[]) try {
 #if defined(USE_PPL)
   if (strcmp(PPL_VERSION, PPL::version()) != 0)
     fatal("was compiled with PPL version %s, but linked with version %s",
-	  PPL_VERSION, PPL::version());
+          PPL_VERSION, PPL::version());
 
   if (verbose)
     std::cerr << "Parma Polyhedra Library version:\n" << PPL::version()
-	      << "\n\nParma Polyhedra Library banner:\n" << PPL::banner()
-	      << std::endl;
+              << "\n\nParma Polyhedra Library banner:\n" << PPL::banner()
+              << std::endl;
 #endif
 
   // Process command line options.
@@ -1207,7 +1207,7 @@ main(int argc, char* argv[]) try {
   set_output(output_file_name);
 
   POLYHEDRON_TYPE ph;
-  Representation rep = read_polyhedron(input(), ph);
+  const Representation rep = read_polyhedron(input(), ph);
 
   enum Command { None, H_to_V, V_to_H };
   Command command = None;
@@ -1259,76 +1259,76 @@ main(int argc, char* argv[]) try {
     set_input(check_file_name);
     // Read the polyhedron containing the expected result.
     PPL::C_Polyhedron e_ph;
-    Representation e_rep = read_polyhedron(input(), e_ph);
+    const Representation e_rep = read_polyhedron(input(), e_ph);
 
     switch (command) {
     case H_to_V:
       {
-	if (e_rep == H)
-	  warning("checking an H-to-V conversion with an H representation");
-
-	// Count the number of generators of `ph'.
-	unsigned ph_num_generators = 0;
-	const PPL::Generator_System& ph_gs = ph.generators();
-	for (PPL::Generator_System::const_iterator i = ph_gs.begin(),
-	       ph_gs_end = ph_gs.end(); i != ph_gs_end; ++i)
-	  ++ph_num_generators;
-
-	// Count the number of generators of `e_ph'.
-	unsigned e_ph_num_generators = 0;
-	const PPL::Generator_System& e_ph_gs = e_ph.generators();
-	for (PPL::Generator_System::const_iterator i = e_ph_gs.begin(),
-	       e_ph_gs_end = e_ph_gs.end(); i != e_ph_gs_end; ++i)
-	  ++e_ph_num_generators;
-
-	// If the polyhedra differ, that is the problem.
-	if (ph != e_ph) {
-	  if (verbose)
-	    std::cerr << "Check failed: polyhedra differ"
-		      << std::endl;
-	  return 1;
-	}
-	else if (ph_num_generators != e_ph_num_generators)
-	  // If we have different number of generators, we fail.
-	  std::cerr << "Check failed: different number of generators:\n"
-		    << "expected " << e_ph_num_generators
-		    << ", obtained " << ph_num_generators
-		    << std::endl;
-	break;
+        if (e_rep == H)
+          warning("checking an H-to-V conversion with an H representation");
+
+        // Count the number of generators of `ph'.
+        unsigned ph_num_generators = 0;
+        const PPL::Generator_System& ph_gs = ph.generators();
+        for (PPL::Generator_System::const_iterator i = ph_gs.begin(),
+               ph_gs_end = ph_gs.end(); i != ph_gs_end; ++i)
+          ++ph_num_generators;
+
+        // Count the number of generators of `e_ph'.
+        unsigned e_ph_num_generators = 0;
+        const PPL::Generator_System& e_ph_gs = e_ph.generators();
+        for (PPL::Generator_System::const_iterator i = e_ph_gs.begin(),
+               e_ph_gs_end = e_ph_gs.end(); i != e_ph_gs_end; ++i)
+          ++e_ph_num_generators;
+
+        // If the polyhedra differ, that is the problem.
+        if (ph != e_ph) {
+          if (verbose)
+            std::cerr << "Check failed: polyhedra differ"
+                      << std::endl;
+          return 1;
+        }
+        else if (ph_num_generators != e_ph_num_generators)
+          // If we have different number of generators, we fail.
+          std::cerr << "Check failed: different number of generators:\n"
+                    << "expected " << e_ph_num_generators
+                    << ", obtained " << ph_num_generators
+                    << std::endl;
+        break;
       }
     case V_to_H:
       {
-	if (e_rep == V)
-	  warning("checking an V-to-H conversion with a V representation");
-
-	// Count the number of constraints of `ph'.
-	unsigned ph_num_constraints = 0;
-	const PPL::Constraint_System& ph_cs = ph.constraints();
-	for (PPL::Constraint_System::const_iterator i = ph_cs.begin(),
-	       ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i)
-	  ++ph_num_constraints;
-
-	// Count the number of constraints of `e_ph'.
-	unsigned e_ph_num_constraints = 0;
-	const PPL::Constraint_System& e_ph_cs = e_ph.constraints();
-	for (PPL::Constraint_System::const_iterator i = e_ph_cs.begin(),
-	       e_ph_cs_end = e_ph_cs.end(); i != e_ph_cs_end; ++i)
-	  ++e_ph_num_constraints;
-
-	// If the polyhedra differ, that is the problem.
-	if (ph != e_ph) {
-	  if (verbose)
-	    std::cerr << "Check failed: polyhedra differ"
-		      << std::endl;
-	  return 1;
-	}
-	else if (ph_num_constraints != e_ph_num_constraints)
-	  // If we have different number of constraints, we fail.
-	  std::cerr << "Check failed: different number of constraints:\n"
-		    << "expected " << e_ph_num_constraints
-		    << ", obtained " << ph_num_constraints
-		    << std::endl;
-	break;
+        if (e_rep == V)
+          warning("checking an V-to-H conversion with a V representation");
+
+        // Count the number of constraints of `ph'.
+        unsigned ph_num_constraints = 0;
+        const PPL::Constraint_System& ph_cs = ph.constraints();
+        for (PPL::Constraint_System::const_iterator i = ph_cs.begin(),
+               ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i)
+          ++ph_num_constraints;
+
+        // Count the number of constraints of `e_ph'.
+        unsigned e_ph_num_constraints = 0;
+        const PPL::Constraint_System& e_ph_cs = e_ph.constraints();
+        for (PPL::Constraint_System::const_iterator i = e_ph_cs.begin(),
+               e_ph_cs_end = e_ph_cs.end(); i != e_ph_cs_end; ++i)
+          ++e_ph_num_constraints;
+
+        // If the polyhedra differ, that is the problem.
+        if (ph != e_ph) {
+          if (verbose)
+            std::cerr << "Check failed: polyhedra differ"
+                      << std::endl;
+          return 1;
+        }
+        else if (ph_num_constraints != e_ph_num_constraints)
+          // If we have different number of constraints, we fail.
+          std::cerr << "Check failed: different number of constraints:\n"
+                    << "expected " << e_ph_num_constraints
+                    << ", obtained " << ph_num_constraints
+                    << std::endl;
+        break;
       }
     case None:
       break;
diff --git a/demos/ppl_lpsol/Makefile.am b/demos/ppl_lpsol/Makefile.am
index 44a4f7d..85703e5 100644
--- a/demos/ppl_lpsol/Makefile.am
+++ b/demos/ppl_lpsol/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/demos/ppl_lpsol/Makefile.in b/demos/ppl_lpsol/Makefile.in
index fb69fc2..b7a210d 100644
--- a/demos/ppl_lpsol/Makefile.in
+++ b/demos/ppl_lpsol/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -62,7 +78,8 @@ host_triplet = @host@
 @BUILD_C_INTERFACE_TRUE@@HAVE_GLPK_TRUE@	ppl_lpsol$(EXEEXT)
 subdir = demos/ppl_lpsol
 DIST_COMMON = $(dist_man_MANS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -99,10 +116,8 @@ LIBRARIES = $(noinst_LIBRARIES)
 ARFLAGS = cru
 AM_V_AR = $(am__v_AR_ at AM_V@)
 am__v_AR_ = $(am__v_AR_ at AM_DEFAULT_V@)
-am__v_AR_0 = @echo "  AR    " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_AR_0 = @echo "  AR      " $@;
+am__v_AR_1 = 
 libglpk_set_d_eps_a_AR = $(AR) $(ARFLAGS)
 libglpk_set_d_eps_a_LIBADD =
 am__libglpk_set_d_eps_a_SOURCES_DIST = glpk_set_d_eps.c
@@ -121,6 +136,19 @@ ppl_lpsol_OBJECTS = $(am_ppl_lpsol_OBJECTS)
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -133,14 +161,16 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
 	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
 LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
@@ -149,17 +179,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(libglpk_set_d_eps_a_SOURCES) $(ppl_lpsol_SOURCES)
 DIST_SOURCES = $(am__libglpk_set_d_eps_a_SOURCES_DIST) \
 	$(am__ppl_lpsol_SOURCES_DIST)
@@ -170,6 +199,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -645,8 +679,11 @@ libglpk_set_d_eps.a: $(libglpk_set_d_eps_a_OBJECTS) $(libglpk_set_d_eps_a_DEPEND
 	$(AM_V_at)$(RANLIB) libglpk_set_d_eps.a
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -763,11 +800,18 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-man1: $(dist_man_MANS)
 	@$(NORMAL_INSTALL)
-	test -z "$(man1dir)" || $(MKDIR_P) "$(DESTDIR)$(man1dir)"
-	@list=''; test -n "$(man1dir)" || exit 0; \
-	{ for i in $$list; do echo "$$i"; done; \
-	l2='$(dist_man_MANS)'; for i in $$l2; do echo "$$i"; done | \
-	  sed -n '/\.1[a-z]*$$/p'; \
+	@list1=''; \
+	list2='$(dist_man_MANS)'; \
+	test -n "$(man1dir)" \
+	  && test -n "`echo $$list1$$list2`" \
+	  || exit 0; \
+	echo " $(MKDIR_P) '$(DESTDIR)$(man1dir)'"; \
+	$(MKDIR_P) "$(DESTDIR)$(man1dir)" || exit 1; \
+	{ for i in $$list1; do echo "$$i"; done;  \
+	if test -n "$$list2"; then \
+	  for i in $$list2; do echo "$$i"; done \
+	    | sed -n '/\.1[a-z]*$$/p'; \
+	fi; \
 	} | while read p; do \
 	  if test -f $$p; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; echo "$$p"; \
@@ -799,12 +843,12 @@ uninstall-man1:
 	dir='$(DESTDIR)$(man1dir)'; $(am__uninstall_files_from_dir)
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -814,7 +858,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -828,37 +876,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -867,6 +884,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -930,6 +951,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -940,10 +975,10 @@ distdir: $(DISTFILES)
 	    if test -f "$$d$$p"; then echo "$$d$$p"; else :; fi; done`; \
 	  if test -n "$$list" && \
 	    grep 'ab help2man is required to generate this page' $$list >/dev/null; then \
-	    echo "error: found man pages containing the \`missing help2man' replacement text:" >&2; \
+	    echo "error: found man pages containing the 'missing help2man' replacement text:" >&2; \
 	    grep -l 'ab help2man is required to generate this page' $$list | sed 's/^/         /' >&2; \
 	    echo "       to fix them, install help2man, remove and regenerate the man pages;" >&2; \
-	    echo "       typically \`make maintainer-clean' will remove them" >&2; \
+	    echo "       typically 'make maintainer-clean' will remove them" >&2; \
 	    exit 1; \
 	  else :; fi; \
 	else :; fi
@@ -978,13 +1013,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -1120,24 +1152,25 @@ uninstall-am: uninstall-binPROGRAMS uninstall-man
 uninstall-man: uninstall-man1
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) check-am \
-	ctags-recursive install-am install-strip tags-recursive
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am check-local clean clean-binPROGRAMS \
-	clean-generic clean-libtool clean-noinstLIBRARIES ctags \
-	ctags-recursive distclean distclean-compile distclean-generic \
-	distclean-libtool distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-binPROGRAMS \
-	install-data install-data-am install-dvi install-dvi-am \
-	install-exec install-exec-am install-html install-html-am \
-	install-info install-info-am install-man install-man1 \
-	install-pdf install-pdf-am install-ps install-ps-am \
-	install-strip installcheck installcheck-am installdirs \
-	installdirs-am maintainer-clean maintainer-clean-generic \
-	mostlyclean mostlyclean-compile mostlyclean-generic \
-	mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \
-	uninstall uninstall-am uninstall-binPROGRAMS uninstall-man \
-	uninstall-man1
+	clean-generic clean-libtool clean-noinstLIBRARIES cscopelist \
+	cscopelist-recursive ctags ctags-recursive distclean \
+	distclean-compile distclean-generic distclean-libtool \
+	distclean-tags distdir dvi dvi-am html html-am info info-am \
+	install install-am install-binPROGRAMS install-data \
+	install-data-am install-dvi install-dvi-am install-exec \
+	install-exec-am install-html install-html-am install-info \
+	install-info-am install-man install-man1 install-pdf \
+	install-pdf-am install-ps install-ps-am install-strip \
+	installcheck installcheck-am installdirs installdirs-am \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
+	pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \
+	uninstall-binPROGRAMS uninstall-man uninstall-man1
 
 
 @BUILD_C_INTERFACE_TRUE@@HAVE_GLPK_TRUE at check-local: ppl_lpsol$(EXEEXT)
diff --git a/demos/ppl_lpsol/dummy.cc b/demos/ppl_lpsol/dummy.cc
index 453114c..67adace 100644
--- a/demos/ppl_lpsol/dummy.cc
+++ b/demos/ppl_lpsol/dummy.cc
@@ -1,5 +1,5 @@
 /* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is free software; as a special exception the author gives
 unlimited permission to copy and/or distribute it, with or without
diff --git a/demos/ppl_lpsol/examples/Makefile.am b/demos/ppl_lpsol/examples/Makefile.am
index a8c9fb6..88ff354 100644
--- a/demos/ppl_lpsol/examples/Makefile.am
+++ b/demos/ppl_lpsol/examples/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/demos/ppl_lpsol/examples/Makefile.in b/demos/ppl_lpsol/examples/Makefile.in
index 79d2f2c..3c36cff 100644
--- a/demos/ppl_lpsol/examples/Makefile.in
+++ b/demos/ppl_lpsol/examples/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,7 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = demos/ppl_lpsol/examples
 DIST_COMMON = README $(dist_noinst_DATA) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -92,14 +108,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(dist_noinst_DATA)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
@@ -369,6 +396,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
diff --git a/demos/ppl_lpsol/ppl_lpsol.1 b/demos/ppl_lpsol/ppl_lpsol.1
index 52f1231..8b0044f 100644
--- a/demos/ppl_lpsol/ppl_lpsol.1
+++ b/demos/ppl_lpsol/ppl_lpsol.1
@@ -86,7 +86,7 @@ See the file \fBCREDITS\fR in the source distribution or use the command
 \fBppl\-config \-\-credits\fR for a list of contributors.
 .SH COPYRIGHT
 Copyright (C) 2001\-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010\-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010\-2013 BUGSENG srl (http://bugseng.com)
 .br
 This is free software; see the file \fBCOPYING\fR in the source
 distribution or use the command \fBppl\-config \-\-copying\fR to
diff --git a/demos/ppl_lpsol/ppl_lpsol.c b/demos/ppl_lpsol/ppl_lpsol.c
index 8c62b94..5d07c46 100644
--- a/demos/ppl_lpsol/ppl_lpsol.c
+++ b/demos/ppl_lpsol/ppl_lpsol.c
@@ -1,7 +1,7 @@
 /* Solve linear programming problems by either vertex/point enumeration
    or the primal simplex algorithm.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -298,14 +298,14 @@ process_options(int argc, char* argv[]) {
     case 'c':
       check_results = 1;
       if (optarg) {
-	d = strtod(optarg, &endptr);
-	if (*endptr || errno == ERANGE || d < 0.0)
-	  fatal("only a non-negative floating point number can `-c'");
-	else
-	  check_threshold = d;
+        d = strtod(optarg, &endptr);
+        if (*endptr || errno == ERANGE || d < 0.0)
+          fatal("only a non-negative floating point number can `-c'");
+        else
+          check_threshold = d;
       }
       else
-	check_threshold = default_check_threshold;
+        check_threshold = default_check_threshold;
       break;
 
     case 'm':
@@ -331,9 +331,9 @@ process_options(int argc, char* argv[]) {
     case 'C':
       l = strtol(optarg, &endptr, 10);
       if (*endptr || l < 0)
-	fatal("a non-negative integer must follow `-C'");
+        fatal("a non-negative integer must follow `-C'");
       else
-	max_seconds_of_cpu_time = l;
+        max_seconds_of_cpu_time = l;
       break;
 
 #endif /* defined (PPL_LPSOL_SUPPORTS_LIMIT_ON_CPU_TIME) */
@@ -341,11 +341,11 @@ process_options(int argc, char* argv[]) {
     case 'R':
       l = strtol(optarg, &endptr, 10);
       if (*endptr || l < 0)
-	fatal("a non-negative integer must follow `-R'");
+        fatal("a non-negative integer must follow `-R'");
       else if (((unsigned long) l) > ULONG_MAX/(1024*1024))
         max_bytes_of_virtual_memory = ULONG_MAX;
       else
-	max_bytes_of_virtual_memory = l*1024*1024;
+        max_bytes_of_virtual_memory = l*1024*1024;
       break;
 
     case 'o':
@@ -355,9 +355,9 @@ process_options(int argc, char* argv[]) {
     case 'p':
       l = strtol(optarg, &endptr, 10);
       if (*endptr || l < 0 || l > 2)
-	fatal("0 or 1 or 2 must follow `-p'");
+        fatal("0 or 1 or 2 must follow `-p'");
       else
-	pricing_method = l;
+        pricing_method = l;
       break;
 
     case 'e':
@@ -379,9 +379,9 @@ process_options(int argc, char* argv[]) {
     case 'v':
       l = strtol(optarg, &endptr, 10);
       if (*endptr || l < 0 || l > 4)
-	fatal("verbosity must be an integer between 0 and 4");
+        fatal("verbosity must be an integer between 0 and 4");
       else
-	verbosity = l;
+        verbosity = l;
       break;
 
     case 'V':
@@ -408,7 +408,7 @@ process_options(int argc, char* argv[]) {
 
   if (enumerate_required
       && (simplex_required
-	  || incremental_required))
+          || incremental_required))
       fatal("-e option is incompatible with -i and -s");
 
   if (enumerate_required)
@@ -428,10 +428,10 @@ process_options(int argc, char* argv[]) {
   if (optind >= argc) {
     if (verbosity >= 4)
       fprintf(stderr,
-	      "Parma Polyhedra Library version:\n%s\n\n"
-	      "Parma Polyhedra Library banner:\n%s\n",
-	      get_ppl_version(),
-	      get_ppl_banner());
+              "Parma Polyhedra Library version:\n%s\n\n"
+              "Parma Polyhedra Library banner:\n%s\n",
+              get_ppl_version(),
+              get_ppl_banner());
     else
       fatal("no input files");
   }
@@ -601,15 +601,15 @@ maybe_check_results(const int ppl_status, const double ppl_optimum_value) {
   }
   /* If no_optimization is enabled, the second case is not possibile. */
   if (!((ppl_status == PPL_MIP_PROBLEM_STATUS_UNFEASIBLE
-	 && (glpk_status == LPX_NOFEAS || glpk_status == LPX_I_NOFEAS))
-	|| (ppl_status == PPL_MIP_PROBLEM_STATUS_UNBOUNDED
-	    && (glpk_status == LPX_UNBND || glpk_status == LPX_I_UNDEF))
-	|| (ppl_status == PPL_MIP_PROBLEM_STATUS_OPTIMIZED
-	    && ((glpk_status == LPX_OPT || glpk_status == LPX_I_OPT)
-		/* If no_optimization is enabled, check if the problem is
-		   unbounded for GLPK.  */
-		|| (no_optimization && (glpk_status == LPX_UNBND
-					|| glpk_status == LPX_I_UNDEF))))))  {
+         && (glpk_status == LPX_NOFEAS || glpk_status == LPX_I_NOFEAS))
+        || (ppl_status == PPL_MIP_PROBLEM_STATUS_UNBOUNDED
+            && (glpk_status == LPX_UNBND || glpk_status == LPX_I_UNDEF))
+        || (ppl_status == PPL_MIP_PROBLEM_STATUS_OPTIMIZED
+            && ((glpk_status == LPX_OPT || glpk_status == LPX_I_OPT)
+                /* If no_optimization is enabled, check if the problem is
+                   unbounded for GLPK.  */
+                || (no_optimization && (glpk_status == LPX_UNBND
+                                        || glpk_status == LPX_I_UNDEF))))))  {
 
     if (ppl_status == PPL_MIP_PROBLEM_STATUS_UNFEASIBLE)
       ppl_status_string = "unfeasible";
@@ -645,19 +645,19 @@ maybe_check_results(const int ppl_status, const double ppl_optimum_value) {
     }
 
     error("check failed: for GLPK the problem is %s, not %s",
-	  glpk_status_string, ppl_status_string);
+          glpk_status_string, ppl_status_string);
 
     check_results_failed = 1;
   }
   else if (!no_optimization
-	   && ppl_status == PPL_MIP_PROBLEM_STATUS_OPTIMIZED) {
+           && ppl_status == PPL_MIP_PROBLEM_STATUS_OPTIMIZED) {
 
     double glpk_optimum_value = treat_as_lp ? lpx_get_obj_val(glpk_lp)
       : lpx_mip_obj_val(glpk_lp);
 
     if (fabs(ppl_optimum_value - glpk_optimum_value) > check_threshold) {
       error("check failed: for GLPK the problem's optimum is %.20g,"
-	    " not %.20g", glpk_optimum_value, ppl_optimum_value);
+            " not %.20g", glpk_optimum_value, ppl_optimum_value);
       check_results_failed = 1;
     }
   }
@@ -676,8 +676,8 @@ variable_output_function(ppl_dimension_type var) {
 
 static void
 add_constraints(ppl_Linear_Expression_t ppl_le,
-		int type, mpq_t rational_lb, mpq_t rational_ub, mpz_t den_lcm,
-		ppl_Constraint_System_t ppl_cs) {
+                int type, mpq_t rational_lb, mpq_t rational_ub, mpz_t den_lcm,
+                ppl_Constraint_System_t ppl_cs) {
   ppl_Constraint_t ppl_c;
   ppl_Linear_Expression_t ppl_le2;
   switch (type) {
@@ -706,7 +706,7 @@ add_constraints(ppl_Linear_Expression_t ppl_le,
     ppl_assign_Coefficient_from_mpz_t(ppl_coeff, tmp_z);
     ppl_Linear_Expression_add_to_inhomogeneous(ppl_le, ppl_coeff);
     ppl_new_Constraint(&ppl_c, ppl_le,
-		       PPL_CONSTRAINT_TYPE_LESS_OR_EQUAL);
+                       PPL_CONSTRAINT_TYPE_LESS_OR_EQUAL);
     if (verbosity >= 4) {
       ppl_io_fprint_Constraint(output_file, ppl_c);
       fprintf(output_file, "\n");
@@ -753,7 +753,7 @@ add_constraints(ppl_Linear_Expression_t ppl_le,
     ppl_assign_Coefficient_from_mpz_t(ppl_coeff, tmp_z);
     ppl_Linear_Expression_add_to_inhomogeneous(ppl_le, ppl_coeff);
     ppl_new_Constraint(&ppl_c, ppl_le,
-		       PPL_CONSTRAINT_TYPE_EQUAL);
+                       PPL_CONSTRAINT_TYPE_EQUAL);
     if (verbosity >= 4) {
       ppl_io_fprint_Constraint(output_file, ppl_c);
       fprintf(output_file, "\n");
@@ -770,10 +770,10 @@ add_constraints(ppl_Linear_Expression_t ppl_le,
 
 static int
 solve_with_generators(ppl_Constraint_System_t ppl_cs,
-		      ppl_const_Linear_Expression_t ppl_objective_le,
-		      ppl_Coefficient_t optimum_n,
-		      ppl_Coefficient_t optimum_d,
-		      ppl_Generator_t point) {
+                      ppl_const_Linear_Expression_t ppl_objective_le,
+                      ppl_Coefficient_t optimum_n,
+                      ppl_Coefficient_t optimum_d,
+                      ppl_Generator_t point) {
   ppl_Polyhedron_t ppl_ph;
   int optimum_found = 0;
   int empty;
@@ -878,10 +878,10 @@ solve_with_generators(ppl_Constraint_System_t ppl_cs,
 
 static int
 solve_with_simplex(ppl_const_Constraint_System_t cs,
-		   ppl_const_Linear_Expression_t objective,
-		   ppl_Coefficient_t optimum_n,
-		   ppl_Coefficient_t optimum_d,
-		   ppl_Generator_t point) {
+                   ppl_const_Linear_Expression_t objective,
+                   ppl_Coefficient_t optimum_n,
+                   ppl_Coefficient_t optimum_d,
+                   ppl_Generator_t point) {
   ppl_MIP_Problem_t ppl_mip;
   int optimum_found = 0;
   int pricing = 0;
@@ -917,7 +917,7 @@ solve_with_simplex(ppl_const_Constraint_System_t cs,
   ppl_MIP_Problem_set_optimization_mode(ppl_mip, mode);
   if (!no_mip)
     ppl_MIP_Problem_add_to_integer_space_dimensions(ppl_mip, integer_variables,
-						    glpk_lp_num_int);
+                                                    glpk_lp_num_int);
   if (incremental) {
     /* Add the constraints of `cs' one at a time. */
     ppl_new_Constraint_System_const_iterator(&i);
@@ -929,17 +929,17 @@ solve_with_simplex(ppl_const_Constraint_System_t cs,
     while (!ppl_Constraint_System_const_iterator_equal_test(i, iend)) {
       ++counter;
       if (verbosity >= 4)
-	fprintf(output_file, "\nSolving constraint %d\n", counter);
+        fprintf(output_file, "\nSolving constraint %d\n", counter);
       ppl_Constraint_System_const_iterator_dereference(i, &c);
       ppl_MIP_Problem_add_constraint(ppl_mip, c);
 
       if (no_optimization) {
-	satisfiable = ppl_MIP_Problem_is_satisfiable(ppl_mip);
-	if (!satisfiable)
-	  break;
+        satisfiable = ppl_MIP_Problem_is_satisfiable(ppl_mip);
+        if (!satisfiable)
+          break;
       }
       else
-	status = ppl_MIP_Problem_solve(ppl_mip);
+        status = ppl_MIP_Problem_solve(ppl_mip);
       ppl_Constraint_System_const_iterator_increment(i);
     }
     ppl_delete_Constraint_System_const_iterator(i);
@@ -1069,19 +1069,19 @@ solve(char* file_name) {
   /* Read variables constrained to be integer. */
     if (glpk_lp_problem_kind == LPX_MIP && !no_mip && use_simplex) {
       if (verbosity >= 4)
-	fprintf(output_file, "Integer variables:\n");
+        fprintf(output_file, "Integer variables:\n");
       glpk_lp_num_int = lpx_get_num_int(glpk_lp);
       integer_variables = (ppl_dimension_type*)
-	malloc((glpk_lp_num_int + 1)*sizeof(ppl_dimension_type));
+        malloc((glpk_lp_num_int + 1)*sizeof(ppl_dimension_type));
       for (i = 0, j = 0; i < dimension; ++i)
-	if (lpx_get_col_kind(glpk_lp, i+1) == LPX_IV) {
-	  integer_variables[j] = i;
-	  if (verbosity >= 4) {
-	    ppl_io_fprint_variable(output_file, i);
-	    fprintf(output_file, " ");
-	  }
-	  ++j;
-	}
+        if (lpx_get_col_kind(glpk_lp, i+1) == LPX_IV) {
+          integer_variables[j] = i;
+          if (verbosity >= 4) {
+            ppl_io_fprint_variable(output_file, i);
+            fprintf(output_file, " ");
+          }
+          ++j;
+        }
     }
   coefficient_index = (int*) malloc((dimension+1)*sizeof(int));
   coefficient_value = (double*) malloc((dimension+1)*sizeof(double));
@@ -1125,7 +1125,7 @@ solve(char* file_name) {
       mpz_divexact(tmp_z, tmp_z, mpq_denref(rational_coefficient[i]));
       ppl_assign_Coefficient_from_mpz_t(ppl_coeff, tmp_z);
       ppl_Linear_Expression_add_to_coefficient(ppl_le, coefficient_index[i]-1,
-					       ppl_coeff);
+                                               ppl_coeff);
     }
 
     add_constraints(ppl_le, type, rational_lb, rational_ub, den_lcm, ppl_cs);
@@ -1219,7 +1219,7 @@ solve(char* file_name) {
       mpz_out_str(output_file, 10, den_lcm);
     }
     fprintf(output_file, "\n%s\n",
-	    (maximize ? "Maximizing." : "Minimizing."));
+            (maximize ? "Maximizing." : "Minimizing."));
   }
 
   ppl_new_Coefficient(&optimum_n);
@@ -1228,15 +1228,15 @@ solve(char* file_name) {
 
   optimum_found = use_simplex
     ? solve_with_simplex(ppl_cs,
-			 ppl_objective_le,
-			 optimum_n,
-			 optimum_d,
-			 optimum_location)
+                         ppl_objective_le,
+                         optimum_n,
+                         optimum_d,
+                         optimum_location)
     : solve_with_generators(ppl_cs,
-			    ppl_objective_le,
-			    optimum_n,
-			    optimum_d,
-			    optimum_location);
+                            ppl_objective_le,
+                            optimum_n,
+                            optimum_d,
+                            optimum_location);
 
   ppl_delete_Linear_Expression(ppl_objective_le);
 
@@ -1259,11 +1259,11 @@ solve(char* file_name) {
       ppl_Generator_divisor(optimum_location, ppl_coeff);
       ppl_Coefficient_to_mpz_t(ppl_coeff, tmp_z);
       for (i = 0; i < dimension; ++i) {
-	mpz_set(mpq_denref(tmp1_q), tmp_z);
-	ppl_Generator_coefficient(optimum_location, i, ppl_coeff);
-	ppl_Coefficient_to_mpz_t(ppl_coeff, mpq_numref(tmp1_q));
-	ppl_io_fprint_variable(output_file, i);
-	fprintf(output_file, " = %.10g\n", mpq_get_d(tmp1_q));
+        mpz_set(mpq_denref(tmp1_q), tmp_z);
+        ppl_Generator_coefficient(optimum_location, i, ppl_coeff);
+        ppl_Coefficient_to_mpz_t(ppl_coeff, mpq_numref(tmp1_q));
+        ppl_io_fprint_variable(output_file, i);
+        fprintf(output_file, " = %.10g\n", mpq_get_d(tmp1_q));
       }
     }
 #ifndef NDEBUG
@@ -1278,7 +1278,7 @@ solve(char* file_name) {
     }
 #endif
     maybe_check_results(PPL_MIP_PROBLEM_STATUS_OPTIMIZED,
-			mpq_get_d(optimum));
+                        mpq_get_d(optimum));
     mpq_clear(optimum);
   }
 
@@ -1292,7 +1292,7 @@ solve(char* file_name) {
 
 static void
 error_handler(enum ppl_enum_error_code code,
-	      const char* description) {
+              const char* description) {
   if (output_argument)
     fprintf(output_file, "PPL error code %d: %s\n", code, description);
   fatal("PPL error code %d: %s", code, description);
@@ -1339,7 +1339,7 @@ int
 main(int argc, char* argv[]) {
 #if defined(PPL_GLPK_HAS__GLP_LIB_PRINT_HOOK)
   extern void _glp_lib_print_hook(int (*func)(void *info, const char *buf),
-				  void *info);
+                                  void *info);
 #endif
   program_name = argv[0];
   if (ppl_initialize() < 0)
@@ -1357,7 +1357,7 @@ main(int argc, char* argv[]) {
 
   if (strcmp(ppl_source_version, get_ppl_version()) != 0)
     fatal("was compiled with PPL version %s, but linked with version %s",
-	  ppl_source_version, get_ppl_version());
+          ppl_source_version, get_ppl_version());
 
   if (ppl_io_set_variable_output_function(variable_output_function) < 0)
     fatal("cannot install the custom variable output function");
diff --git a/demos/ppl_pips/Makefile.am b/demos/ppl_pips/Makefile.am
index 80f567c..81d0b5b 100644
--- a/demos/ppl_pips/Makefile.am
+++ b/demos/ppl_pips/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -56,7 +56,8 @@ piplib_pips.o: $(srcdir)/ppl_pips.cc $(top_builddir)/utils/libppl_utils.a
 	$(CXXCOMPILE) -c -o $@ -DUSE_PIPLIB $(srcdir)/ppl_pips.cc
 
 piplib_pips: piplib_pips.o
-	$(CXXLINK) $< -lpip -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
+	$(CXXLINK) piplib_pips.o\
+	    -lpip -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
 
 EXTRA_DIST = \
 expected_mpz \
diff --git a/demos/ppl_pips/Makefile.in b/demos/ppl_pips/Makefile.in
index ab8420e..8e50bee 100644
--- a/demos/ppl_pips/Makefile.in
+++ b/demos/ppl_pips/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ host_triplet = @host@
 bin_PROGRAMS = ppl_pips$(EXEEXT)
 subdir = demos/ppl_pips
 DIST_COMMON = $(dist_man_MANS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -102,6 +119,19 @@ ppl_pips_DEPENDENCIES = $(top_builddir)/src/libppl.la \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -114,20 +144,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(ppl_pips_SOURCES)
 DIST_SOURCES = $(ppl_pips_SOURCES)
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -137,6 +163,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -474,8 +505,11 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -555,11 +589,18 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-man1: $(dist_man_MANS)
 	@$(NORMAL_INSTALL)
-	test -z "$(man1dir)" || $(MKDIR_P) "$(DESTDIR)$(man1dir)"
-	@list=''; test -n "$(man1dir)" || exit 0; \
-	{ for i in $$list; do echo "$$i"; done; \
-	l2='$(dist_man_MANS)'; for i in $$l2; do echo "$$i"; done | \
-	  sed -n '/\.1[a-z]*$$/p'; \
+	@list1=''; \
+	list2='$(dist_man_MANS)'; \
+	test -n "$(man1dir)" \
+	  && test -n "`echo $$list1$$list2`" \
+	  || exit 0; \
+	echo " $(MKDIR_P) '$(DESTDIR)$(man1dir)'"; \
+	$(MKDIR_P) "$(DESTDIR)$(man1dir)" || exit 1; \
+	{ for i in $$list1; do echo "$$i"; done;  \
+	if test -n "$$list2"; then \
+	  for i in $$list2; do echo "$$i"; done \
+	    | sed -n '/\.1[a-z]*$$/p'; \
+	fi; \
 	} | while read p; do \
 	  if test -f $$p; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; echo "$$p"; \
@@ -591,12 +632,12 @@ uninstall-man1:
 	dir='$(DESTDIR)$(man1dir)'; $(am__uninstall_files_from_dir)
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -606,7 +647,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -620,37 +665,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -659,6 +673,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -722,6 +740,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -732,10 +764,10 @@ distdir: $(DISTFILES)
 	    if test -f "$$d$$p"; then echo "$$d$$p"; else :; fi; done`; \
 	  if test -n "$$list" && \
 	    grep 'ab help2man is required to generate this page' $$list >/dev/null; then \
-	    echo "error: found man pages containing the \`missing help2man' replacement text:" >&2; \
+	    echo "error: found man pages containing the 'missing help2man' replacement text:" >&2; \
 	    grep -l 'ab help2man is required to generate this page' $$list | sed 's/^/         /' >&2; \
 	    echo "       to fix them, install help2man, remove and regenerate the man pages;" >&2; \
-	    echo "       typically \`make maintainer-clean' will remove them" >&2; \
+	    echo "       typically 'make maintainer-clean' will remove them" >&2; \
 	    exit 1; \
 	  else :; fi; \
 	else :; fi
@@ -770,13 +802,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -910,22 +939,24 @@ uninstall-am: uninstall-binPROGRAMS uninstall-man
 uninstall-man: uninstall-man1
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) check-am \
-	ctags-recursive install-am install-strip tags-recursive
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am check-local clean clean-binPROGRAMS \
-	clean-generic clean-libtool ctags ctags-recursive distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-binPROGRAMS install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-man1 install-pdf \
-	install-pdf-am install-ps install-ps-am install-strip \
-	installcheck installcheck-am installdirs installdirs-am \
-	maintainer-clean maintainer-clean-generic mostlyclean \
-	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
-	pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \
+	clean-generic clean-libtool cscopelist cscopelist-recursive \
+	ctags ctags-recursive distclean distclean-compile \
+	distclean-generic distclean-libtool distclean-tags distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	install-binPROGRAMS install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-man \
+	install-man1 install-pdf install-pdf-am install-ps \
+	install-ps-am install-strip installcheck installcheck-am \
+	installdirs installdirs-am maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-compile \
+	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags tags-recursive uninstall uninstall-am \
 	uninstall-binPROGRAMS uninstall-man uninstall-man1
 
 
@@ -933,7 +964,8 @@ piplib_pips.o: $(srcdir)/ppl_pips.cc $(top_builddir)/utils/libppl_utils.a
 	$(CXXCOMPILE) -c -o $@ -DUSE_PIPLIB $(srcdir)/ppl_pips.cc
 
 piplib_pips: piplib_pips.o
-	$(CXXLINK) $< -lpip -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
+	$(CXXLINK) piplib_pips.o\
+	    -lpip -lgmpxx -lgmp $(top_builddir)/utils/libppl_utils.a
 
 @HAVE_MD5SUM_TRUE at check-local: ppl_pips$(EXEEXT)
 @HAVE_MD5SUM_TRUE@	echo $(TOUGH_EXAMPLES) >tough_examples
diff --git a/demos/ppl_pips/examples/Makefile.am b/demos/ppl_pips/examples/Makefile.am
index 3a669d6..ed5525d 100644
--- a/demos/ppl_pips/examples/Makefile.am
+++ b/demos/ppl_pips/examples/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/demos/ppl_pips/examples/Makefile.in b/demos/ppl_pips/examples/Makefile.in
index b54b37b..d6ae067 100644
--- a/demos/ppl_pips/examples/Makefile.in
+++ b/demos/ppl_pips/examples/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,7 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = demos/ppl_pips/examples
 DIST_COMMON = README $(dist_noinst_DATA) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -92,14 +108,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(dist_noinst_DATA)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
@@ -364,6 +391,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
diff --git a/demos/ppl_pips/ppl_pips.1 b/demos/ppl_pips/ppl_pips.1
index 0b55367..da2b2ea 100644
--- a/demos/ppl_pips/ppl_pips.1
+++ b/demos/ppl_pips/ppl_pips.1
@@ -118,7 +118,7 @@ See the file \fBCREDITS\fR in the source distribution or use the command
 Report bugs to <ppl\-devel at cs.unipr.it>.
 .SH COPYRIGHT
 Copyright (C) 2001\-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010\-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010\-2013 BUGSENG srl (http://bugseng.com)
 .br
 This is free software; see the file \fBCOPYING\fR in the source
 distribution or use the command \fBppl\-config \-\-copying\fR to
diff --git a/demos/ppl_pips/ppl_pips.cc b/demos/ppl_pips/ppl_pips.cc
index b60d2ce..3538cef 100644
--- a/demos/ppl_pips/ppl_pips.cc
+++ b/demos/ppl_pips/ppl_pips.cc
@@ -1,6 +1,6 @@
 /* A sort of clone of the cddlib test program `lcdd'.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -138,7 +138,7 @@ pip_display_sol(std::ostream& out,
           << " = " << *i << endl;
     }
     const Constraint_System &constraints = pip->constraints();
-    bool constraints_empty = constraints.empty();
+    const bool constraints_empty = constraints.empty();
     if (!constraints_empty) {
       out << setw(indent*2) << "" << "if ";
       for (Constraint_System::const_iterator
@@ -148,7 +148,7 @@ pip_display_sol(std::ostream& out,
         out << ((i == cs_begin) ? "" : " and ") << *i;
       out << " then" << endl;
     }
-    const PIP_Decision_Node* decision_node_p = pip->as_decision();
+    const PIP_Decision_Node* const decision_node_p = pip->as_decision();
     if (decision_node_p) {
       pip_display_sol(out, decision_node_p->child_node(true),
                       parameters, vars, space_dimension, indent+1);
@@ -157,7 +157,7 @@ pip_display_sol(std::ostream& out,
                       parameters, vars, space_dimension, indent+1);
     }
     else {
-      const PIP_Solution_Node* solution_node_p = pip->as_solution();
+      const PIP_Solution_Node* const solution_node_p = pip->as_solution();
       out << setw(indent*2 + (constraints_empty ? 0 : 2)) << "" << "{";
       for (Variables_Set::const_iterator
              v_begin = vars.begin(),
@@ -282,6 +282,7 @@ public:
       std::istringstream iss(line);
       iss >> bignum_column_coding;
     }
+    PPL_ASSERT(bignum_column_coding >= -1);
 
     PPL::dimension_type num_constraints;
     PPL::dimension_type constraint_width;
@@ -305,15 +306,16 @@ public:
       }
     }
 
-    PPL::dimension_type bignum_column = (bignum_column_coding == -1)
+    const PPL::dimension_type bignum_column
+      = (bignum_column_coding == -1)
       ? PPL::not_a_dimension()
-      : (num_vars + (bignum_column_coding - 1));
+      : (num_vars + PPL::dimension_type(bignum_column_coding - 1));
 
-    bool result = update_pip(num_vars, num_params,
-                             num_constraints, num_ctx_rows,
-                             constraints, context,
-                             constraint_type, ctx_type,
-                             bignum_column);
+    const bool result = update_pip(num_vars, num_params,
+                                   num_constraints, num_ctx_rows,
+                                   constraints, context,
+                                   constraint_type, ctx_type,
+                                   bignum_column);
     return result;
   }
 
@@ -349,9 +351,11 @@ public:
 
     int bignum_column_coding;
     in >> bignum_column_coding;
-    PPL::dimension_type bignum_column = (bignum_column_coding == -1)
+    PPL_ASSERT(bignum_column_coding >= -1);
+    const PPL::dimension_type bignum_column
+      = (bignum_column_coding == -1)
       ? PPL::not_a_dimension()
-      : (bignum_column_coding - 1);
+      : PPL::dimension_type(bignum_column_coding - 1);
 
     int solve_integer;
     in >> solve_integer;
@@ -362,7 +366,7 @@ public:
 
     if (!expect(in, '('))
       return false;
-    PPL::dimension_type constraint_width = num_vars+num_params+1;
+    const PPL::dimension_type constraint_width = num_vars+num_params+1;
     Coeff_Vector constraints(num_constraints * constraint_width);
     Int_Vector constraint_type(num_constraints);
     for (PPL::dimension_type i = 0; i < num_constraints; ++i)
@@ -379,11 +383,11 @@ public:
       if (!read_vector(in, i, num_params+1, num_params, context))
         return false;
 
-    bool result = update_pip(num_vars, num_params,
-                             num_constraints, num_ctx_rows,
-                             constraints, context,
-                             constraint_type, ctx_type,
-                             bignum_column);
+    const bool result = update_pip(num_vars, num_params,
+                                   num_constraints, num_ctx_rows,
+                                   constraints, context,
+                                   constraint_type, ctx_type,
+                                   bignum_column);
     return result;
   }
 
@@ -427,7 +431,7 @@ protected:
     if (in.fail())
       return false;
     std::istringstream iss(s);
-    PPL::dimension_type start_index = row_index * row_size;
+    const PPL::dimension_type start_index = row_index * row_size;
     PPL::dimension_type k = start_index;
     for (PPL::dimension_type i = 0; i < cst_col; ++i, ++k) {
       iss >> tab[k];
@@ -559,8 +563,8 @@ set_output(const char* file_name) {
 
   if (file_name) {
     output_stream_p = new std::ofstream(file_name,
-					std::ios_base::out
-					| std::ios_base::app);
+                                        std::ios_base::out
+                                        | std::ios_base::app);
     if (!*output_stream_p)
       fatal("cannot open output file `%s'", file_name);
     output_file_name = file_name;
@@ -625,10 +629,10 @@ process_options(int argc, char* argv[]) {
   while (true) {
 #ifdef PPL_HAVE_GETOPT_H
     int option_index = 0;
-    int c = getopt_long(argc, argv, OPTION_LETTERS, long_options,
-			&option_index);
+    const int c = getopt_long(argc, argv, OPTION_LETTERS, long_options,
+                        &option_index);
 #else
-    int c = getopt(argc, argv, OPTION_LETTERS);
+    const int c = getopt(argc, argv, OPTION_LETTERS);
 #endif
 
     if (c == EOF)
@@ -647,14 +651,14 @@ process_options(int argc, char* argv[]) {
 
     case 'R':
       {
-        const int MEGA = 1024*1024;
-        long l = strtol(optarg, &endptr, 10);
+        const unsigned long MEGA = 1024U*1024U;
+        const long l = strtol(optarg, &endptr, 10);
         if (*endptr || l < 0)
           fatal("a non-negative integer must follow `-R'");
         else if (static_cast<unsigned long>(l) > ULONG_MAX/MEGA)
           max_bytes_of_virtual_memory = ULONG_MAX;
         else
-          max_bytes_of_virtual_memory = l*MEGA;
+          max_bytes_of_virtual_memory = static_cast<unsigned long>(l)*MEGA;
       }
       break;
 
@@ -681,7 +685,7 @@ process_options(int argc, char* argv[]) {
     case 'i':
       loop_iterations = strtol(optarg, &endptr, 10);
       if (*endptr || loop_iterations < 1)
-	fatal("a positive integer must follow `-i'");
+        fatal("a positive integer must follow `-i'");
       break;
 
 #if defined(USE_PPL)
@@ -756,12 +760,12 @@ main(int argc, char* argv[]) try {
 #if defined(USE_PPL)
   if (strcmp(PPL_VERSION, PPL::version()) != 0)
     fatal("was compiled with PPL version %s, but linked with version %s",
-	  PPL_VERSION, PPL::version());
+          PPL_VERSION, PPL::version());
 
   if (verbose)
     std::cerr << "Parma Polyhedra Library version:\n" << PPL::version()
-	      << "\n\nParma Polyhedra Library banner:\n" << PPL::banner()
-	      << std::endl;
+              << "\n\nParma Polyhedra Library banner:\n" << PPL::banner()
+              << std::endl;
 #endif
 
   // Process command line options.
diff --git a/depcomp b/depcomp
index debb6ff..e1f51f4 100755
--- a/depcomp
+++ b/depcomp
@@ -1,7 +1,7 @@
 #! /bin/sh
 # depcomp - compile a program generating dependencies as side-effects
 
-scriptversion=2012-03-27.16; # UTC
+scriptversion=2012-07-12.20; # UTC
 
 # Copyright (C) 1999-2012 Free Software Foundation, Inc.
 
@@ -74,6 +74,9 @@ tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`}
 
 rm -f "$tmpdepfile"
 
+# Avoid interferences from the environment.
+gccflag= dashmflag=
+
 # Some modes work just like other modes, but use different flags.  We
 # parameterize here, but still list the modes in the big case below,
 # to make depend.m4 easier to write.  Note that we *cannot* use a case
@@ -108,7 +111,7 @@ if test "$depmode" = msvc7msys; then
 fi
 
 if test "$depmode" = xlc; then
-   # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency informations.
+   # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information.
    gccflag=-qmakedep=gcc,-MF
    depmode=gcc
 fi
@@ -142,13 +145,17 @@ gcc3)
   ;;
 
 gcc)
+## Note that this doesn't just cater to obsosete pre-3.x GCC compilers.
+## but also to in-use compilers like IMB xlc/xlC and the HP C compiler.
+## (see the conditional assignment to $gccflag above).
 ## There are various ways to get dependency output from gcc.  Here's
 ## why we pick this rather obscure method:
 ## - Don't want to use -MD because we'd like the dependencies to end
 ##   up in a subdir.  Having to rename by hand is ugly.
 ##   (We might end up doing this anyway to support other compilers.)
 ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
-##   -MM, not -M (despite what the docs say).
+##   -MM, not -M (despite what the docs say).  Also, it might not be
+##   supported by the other compilers which use the 'gcc' depmode.
 ## - Using -M directly means running the compiler twice (even worse
 ##   than renaming).
   if test -z "$gccflag"; then
@@ -334,6 +341,79 @@ icc)
   rm -f "$tmpdepfile"
   ;;
 
+## The order of this option in the case statement is important, since the
+## shell code in configure will try each of these formats in the order
+## listed in this file.  A plain '-MD' option would be understood by many
+## compilers, so we must ensure this comes after the gcc and icc options.
+pgcc)
+  # Portland's C compiler understands '-MD'.
+  # Will always output deps to 'file.d' where file is the root name of the
+  # source file under compilation, even if file resides in a subdirectory.
+  # The object file name does not affect the name of the '.d' file.
+  # pgcc 10.2 will output
+  #    foo.o: sub/foo.c sub/foo.h
+  # and will wrap long lines using '\' :
+  #    foo.o: sub/foo.c ... \
+  #     sub/foo.h ... \
+  #     ...
+  dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
+  test "x$dir" = "x$object" && dir=
+  # Use the source, not the object, to determine the base name, since
+  # that's sadly what pgcc will do too.
+  base=`echo "$source" | sed -e 's|^.*/||' -e 's/\.[-_a-zA-Z0-9]*$//'`
+  tmpdepfile="$base.d"
+
+  # For projects that build the same source file twice into different object
+  # files, the pgcc approach of using the *source* file root name can cause
+  # problems in parallel builds.  Use a locking strategy to avoid stomping on
+  # the same $tmpdepfile.
+  lockdir="$base.d-lock"
+  trap "echo '$0: caught signal, cleaning up...' >&2; rm -rf $lockdir" 1 2 13 15
+  numtries=100
+  i=$numtries
+  while test $i -gt 0 ; do
+    # mkdir is a portable test-and-set.
+    if mkdir $lockdir 2>/dev/null; then
+      # This process acquired the lock.
+      "$@" -MD
+      stat=$?
+      # Release the lock.
+      rm -rf $lockdir
+      break
+    else
+      ## the lock is being held by a different process,
+      ## wait until the winning process is done or we timeout
+      while test -d $lockdir && test $i -gt 0; do
+        sleep 1
+        i=`expr $i - 1`
+      done
+    fi
+    i=`expr $i - 1`
+  done
+  trap - 1 2 13 15
+  if test $i -le 0; then
+    echo "$0: failed to acquire lock after $numtries attempts" >&2
+    echo "$0: check lockdir '$lockdir'" >&2
+    exit 1
+  fi
+
+  if test $stat -ne 0; then
+    rm -f "$tmpdepfile"
+    exit $stat
+  fi
+  rm -f "$depfile"
+  # Each line is of the form `foo.o: dependent.h',
+  # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'.
+  # Do two passes, one to just change these to
+  # `$object: dependent.h' and one to simply `dependent.h:'.
+  sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
+  # Some versions of the HPUX 10.20 sed can't process this invocation
+  # correctly.  Breaking it into two sed invocations is a workaround.
+  sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" |
+    sed -e 's/$/ :/' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
 hp2)
   # The "hp" stanza above does not work with aCC (C++) and HP's ia64
   # compilers, which have integrated preprocessors.  The correct option
diff --git a/doc/Makefile.am b/doc/Makefile.am
index 9cde930..8d5ce89 100644
--- a/doc/Makefile.am
+++ b/doc/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -72,7 +72,7 @@ gpl.dox \
 fdl.dox
 
 # NOTE: this variable is used to populate Doxygen configuration tag INPUT.
-# The file path is that of the build directory, hence we ca not use
+# The file path is that of the build directory, hence we cannot use
 # variable DOX_LICENSE_FILES defined above.
 DOX_LICENSE_INPUT = \
 $(srcdir)/gpl.dox \
@@ -134,8 +134,8 @@ user-language-interface.tex
 DEVREF_C_INTERFACE_STUFF = \
 $(COMMON_C_INTERFACE_STUFF) \
 devref-language-interface.tex \
-../interfaces/C/ppl_c_implementation_common.defs.hh \
-../interfaces/C/ppl_c_implementation_common.inlines.hh \
+../interfaces/C/ppl_c_implementation_common_defs.hh \
+../interfaces/C/ppl_c_implementation_common_inlines.hh \
 ../interfaces/C/ppl_c_implementation_common.cc
 
 
@@ -168,8 +168,8 @@ $(top_builddir)/interfaces/C/ppl_c.h
 DEVREF_CONFIGURED_C_INTERFACE_STUFF = \
 $(COMMON_C_INTERFACE_STUFF) \
 $(top_builddir)/interfaces/C/ppl_c.h \
-../interfaces/C/ppl_c_implementation_common.defs.hh \
-../interfaces/C/ppl_c_implementation_common.inlines.hh \
+../interfaces/C/ppl_c_implementation_common_defs.hh \
+../interfaces/C/ppl_c_implementation_common_inlines.hh \
 ../interfaces/C/ppl_c_implementation_common.cc
 
 endif BUILD_C_INTERFACE
@@ -219,8 +219,8 @@ devref-language-interface.tex \
 ppl.sty \
 ../interfaces/Prolog/Prolog_interface.dox \
 $(PROLOG_INTERFACE_ADDITIONAL_DOX_PAGES) \
-../interfaces/Prolog/ppl_prolog_common.defs.hh \
-../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+../interfaces/Prolog/ppl_prolog_common_defs.hh \
+../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 ../interfaces/Prolog/ppl_prolog_common.cc
 
 
@@ -259,8 +259,8 @@ devref-language-interface.tex \
 ppl.sty \
 ../interfaces/Prolog/Prolog_configured_interface.dox \
 $(PROLOG_INTERFACE_ADDITIONAL_DOX_PAGES) \
-../interfaces/Prolog/ppl_prolog_common.defs.hh \
-../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+../interfaces/Prolog/ppl_prolog_common_defs.hh \
+../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 ../interfaces/Prolog/ppl_prolog_common.cc \
 $(top_builddir)/interfaces/Prolog/ppl_prolog_domains.hh \
 $(top_builddir)/interfaces/Prolog/ppl_prolog_domains.cc.stamp
@@ -304,8 +304,8 @@ $(DOX_LICENSE_FILES) \
 devref-language-interface.tex \
 ppl.sty \
 ../interfaces/OCaml/OCaml_interface.dox \
-../interfaces/OCaml/ppl_ocaml_common.defs.hh \
-../interfaces/OCaml/ppl_ocaml_common.inlines.hh \
+../interfaces/OCaml/ppl_ocaml_common_defs.hh \
+../interfaces/OCaml/ppl_ocaml_common_inlines.hh \
 ../interfaces/OCaml/ppl_ocaml_common.cc \
 ../interfaces/OCaml/ppl_ocaml_globals.mli
 
@@ -421,8 +421,8 @@ devref-language-interface.tex \
 ppl.sty \
 $(JAVA_INTERFACE_JAVA_FILES) \
 ../interfaces/Java/jni/ppl_java_common.cc \
-../interfaces/Java/jni/ppl_java_common.defs.hh \
-../interfaces/Java/jni/ppl_java_common.inlines.hh \
+../interfaces/Java/jni/ppl_java_common_defs.hh \
+../interfaces/Java/jni/ppl_java_common_inlines.hh \
 ../interfaces/Java/jni/ppl_java_globals.cc
 
 
@@ -872,25 +872,27 @@ TEX_ENV = TEXINPUTS=$(abs_srcdir):$(TEXINPUTS)
 
 user.latex-dir: user.doxyconf-latex $(USER_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) user.doxyconf-latex
 
 devref.latex-dir: devref.doxyconf-latex $(DEVREF_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) devref.doxyconf-latex
 
 ppl-user- at VERSION@.pdf: user.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user.latex-dir refman.pdf \
+	    && mv -f user.latex-dir/refman.pdf $@
 
 ppl-devref- at VERSION@.pdf: devref.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref.latex-dir refman.pdf \
+	    && mv -f devref.latex-dir/refman.pdf $@
 
 $(USER_CORE_HTML_DIR): user.doxyconf-html $(USER_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) user.doxyconf-html
 
 $(DEVREF_CORE_HTML_DIR): devref.doxyconf-html $(DEVREF_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) devref.doxyconf-html
 
 ############################################################################
 
@@ -933,8 +935,8 @@ $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/C/ppl_c_header.h \
 $(srcdir)/../interfaces/C/C_interface.dox \
 $(srcdir)/../interfaces/C/ppl_c_implementation_common.cc \
-$(srcdir)/../interfaces/C/ppl_c_implementation_common.defs.hh \
-$(srcdir)/../interfaces/C/ppl_c_implementation_common.inlines.hh
+$(srcdir)/../interfaces/C/ppl_c_implementation_common_defs.hh \
+$(srcdir)/../interfaces/C/ppl_c_implementation_common_inlines.hh
 
 user-c-interface.latex-dir: \
 user-language-interface.doxyconf \
@@ -945,7 +947,8 @@ $(USER_C_INTERFACE_STUFF)
 	    > user-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_USER_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-c-interface-latex
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-c-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-c-interface-latex
 
 devref-c-interface.latex-dir: \
@@ -957,14 +960,17 @@ $(DEVREF_C_INTERFACE_STUFF)
 	    > devref-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_DEVREF_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-c-interface-latex
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-c-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-c-interface-latex
 
 ppl-user-c-interface- at VERSION@.pdf: user-c-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-c-interface.latex-dir refman.pdf \
+	    && mv -f user-c-interface.latex-dir/refman.pdf $@
 
 ppl-devref-c-interface- at VERSION@.pdf: devref-c-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-c-interface.latex-dir refman.pdf \
+	    && mv -f devref-c-interface.latex-dir/refman.pdf $@
 
 ppl-user-c-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -975,7 +981,8 @@ $(USER_C_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-c-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-c-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-c-interface-html
 
 ppl-devref-c-interface- at VERSION@-html: \
@@ -987,7 +994,8 @@ $(DEVREF_C_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    > devref-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_DEVREF_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-c-interface-html
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-c-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-c-interface-html
 
 # (System Independent) Prolog Language Interface Targets
@@ -1013,8 +1021,8 @@ $(srcdir)/../interfaces/Prolog/Prolog_interface_sysindep.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_sysindep_domains.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_compilation.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_sysdep.dox \
-$(srcdir)/../interfaces/Prolog/ppl_prolog_common.defs.hh \
-$(srcdir)/../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+$(srcdir)/../interfaces/Prolog/ppl_prolog_common_defs.hh \
+$(srcdir)/../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 $(srcdir)/../interfaces/Prolog/ppl_prolog_common.cc
 
 user-prolog-interface.latex-dir: \
@@ -1025,8 +1033,9 @@ $(USER_PROLOG_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-prolog-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-prolog-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-prolog-interface-latex
 
 devref-prolog-interface.latex-dir: \
@@ -1037,15 +1046,18 @@ $(DEVREF_PROLOG_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-prolog-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-prolog-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-prolog-interface-latex
 
 ppl-user-prolog-interface- at VERSION@.pdf: user-prolog-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-prolog-interface.latex-dir refman.pdf \
+	    && mv -f user-prolog-interface.latex-dir/refman.pdf $@
 
 ppl-devref-prolog-interface- at VERSION@.pdf: devref-prolog-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-prolog-interface.latex-dir refman.pdf \
+	    && mv -f devref-prolog-interface.latex-dir/refman.pdf $@
 
 ppl-user-prolog-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1055,8 +1067,9 @@ $(USER_PROLOG_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_USER_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-prolog-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-prolog-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-prolog-interface-html
 
 ppl-devref-prolog-interface- at VERSION@-html: \
@@ -1067,8 +1080,9 @@ $(DEVREF_PROLOG_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-prolog-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf > \
+	    Doxyfile.devref-prolog-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-prolog-interface-html
 
 # OCaml Language Interface Targets
@@ -1087,8 +1101,8 @@ SED_OCAML_INPUT_DEVREF = \
 $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/OCaml/OCaml_interface.dox \
 $(srcdir)/../interfaces/OCaml/ppl_ocaml_common.cc \
-$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.defs.hh \
-$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.inlines.hh
+$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_defs.hh \
+$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_inlines.hh
 
 OCAMLDOC_HTML_OPTIONS = \
 -I @mlgmp_dir@ -I $(top_builddir)/interfaces/OCaml -html
@@ -1105,8 +1119,9 @@ $(USER_OCAML_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-ocaml-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf > \
+	    Doxyfile.user-ocaml-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-ocaml-interface-latex
 	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 		$(srcdir)/../interfaces/OCaml/ppl_ocaml_globals.mli
@@ -1119,17 +1134,20 @@ $(DEVREF_OCAML_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-ocaml-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-ocaml-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-ocaml-interface-latex
 	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 		$(srcdir)/../interfaces/OCaml/ppl_ocaml_globals.mli
 
 ppl-user-ocaml-interface- at VERSION@.pdf: user-ocaml-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-ocaml-interface.latex-dir refman.pdf \
+	    && mv -f user-ocaml-interface.latex-dir/refman.pdf $@
 
 ppl-devref-ocaml-interface- at VERSION@.pdf: devref-ocaml-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-ocaml-interface.latex-dir refman.pdf \
+	    && mv -f devref-ocaml-interface.latex-dir/refman.pdf $@
 
 ppl-user-ocaml-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1140,7 +1158,8 @@ $(USER_OCAML_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-ocaml-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-ocaml-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-ocaml-interface-html
 	mkdir $@/ocamldoc
 	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -1154,8 +1173,9 @@ $(DEVREF_OCAML_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-ocaml-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-ocaml-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-ocaml-interface-html
 	mkdir $@/ocamldoc
 	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -1177,8 +1197,8 @@ SED_JAVA_INPUT_DEVREF = \
 $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/Java/parma_polyhedra_library \
 $(srcdir)/../interfaces/Java/jni/ppl_java_common.cc \
-$(srcdir)/../interfaces/Java/jni/ppl_java_common.defs.hh \
-$(srcdir)/../interfaces/Java/jni/ppl_java_common.inlines.hh \
+$(srcdir)/../interfaces/Java/jni/ppl_java_common_defs.hh \
+$(srcdir)/../interfaces/Java/jni/ppl_java_common_inlines.hh \
 $(srcdir)/../interfaces/Java/jni/ppl_java_globals.cc
 
 user-java-interface.latex-dir: \
@@ -1189,8 +1209,9 @@ $(USER_JAVA_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-java-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-java-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-java-interface-latex
 
 devref-java-interface.latex-dir: \
@@ -1201,15 +1222,18 @@ $(DEVREF_JAVA_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-java-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-java-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-java-interface-latex
 
 ppl-user-java-interface- at VERSION@.pdf: user-java-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-java-interface.latex-dir refman.pdf \
+	    && mv -f user-java-interface.latex-dir/refman.pdf $@
 
 ppl-devref-java-interface- at VERSION@.pdf: devref-java-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-java-interface.latex-dir refman.pdf \
+	    && mv -f devref-java-interface.latex-dir/refman.pdf $@
 
 ppl-user-java-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1219,8 +1243,9 @@ $(USER_JAVA_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_USER_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-java-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-java-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-java-interface-html
 
 ppl-devref-java-interface- at VERSION@-html: \
@@ -1231,8 +1256,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-java-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-java-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-java-interface-html
 
 ############################################################################
@@ -1258,8 +1284,8 @@ $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/C/C_interface.dox \
 ../interfaces/C/ppl_c.h \
 $(srcdir)/../interfaces/C/ppl_c_implementation_common.cc \
-$(srcdir)/../interfaces/C/ppl_c_implementation_common.defs.hh \
-$(srcdir)/../interfaces/C/ppl_c_implementation_common.inlines.hh
+$(srcdir)/../interfaces/C/ppl_c_implementation_common_defs.hh \
+$(srcdir)/../interfaces/C/ppl_c_implementation_common_inlines.hh
 # FIXME add generated files
 
 user-configured-c-interface.latex-dir: \
@@ -1271,7 +1297,8 @@ $(USER_CONFIGURED_C_INTERFACE_STUFF)
 	    > user-configured-c-interface.tex
 	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_USER_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-configured-c-interface-latex
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-c-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-c-interface-latex
 
 devref-configured-c-interface.latex-dir: \
@@ -1283,16 +1310,19 @@ $(DEVREF_CONFIGURED_C_INTERFACE_STUFF)
 	    > devref-configured-c-interface.tex
 	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_DEVREF_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-configured-c-interface-latex
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-c-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-c-interface-latex
 
 ppl-user-configured-c-interface- at VERSION@.pdf: \
 user-configured-c-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-configured-c-interface.latex-dir refman.pdf \
+	  && mv -f user-configured-c-interface.latex-dir/refman.pdf $@
 
 ppl-devref-configured-c-interface- at VERSION@.pdf: \
 devref-configured-c-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-configured-c-interface.latex-dir refman.pdf \
+	    && mv -f devref-configured-c-interface.latex-dir/refman.pdf $@
 
 ppl-user-configured-c-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1303,7 +1333,8 @@ $(USER_CONFIGURED_C_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-configured-c-interface.tex
 	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-configured-c-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-c-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-c-interface-html
 
 ppl-devref-configured-c-interface- at VERSION@-html: \
@@ -1315,7 +1346,8 @@ $(DEVREF_CONFIGURED_C_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    > devref-configured-c-interface.tex
 	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_DEVREF_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-configured-c-interface-html
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-c-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-c-interface-html
 
 endif BUILD_C_INTERFACE
@@ -1344,8 +1376,8 @@ $(srcdir)/../interfaces/Prolog/Prolog_interface_sysindep.dox \
 ../interfaces/Prolog/Prolog_configured_domains.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_compilation.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_sysdep.dox \
-$(srcdir)/../interfaces/Prolog/ppl_prolog_common.defs.hh \
-$(srcdir)/../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+$(srcdir)/../interfaces/Prolog/ppl_prolog_common_defs.hh \
+$(srcdir)/../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 $(srcdir)/../interfaces/Prolog/ppl_prolog_common.cc
 # FIXME: add appropriate generated files.
 
@@ -1357,8 +1389,9 @@ $(USER_CONFIGURED_PROLOG_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-configured-prolog-interface.tex
 	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-configured-prolog-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-prolog-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-prolog-interface-latex
 
 devref-configured-prolog-interface.latex-dir: \
@@ -1369,17 +1402,22 @@ $(DEVREF_CONFIGURED_PROLOG_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-configured-prolog-interface.tex
 	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-configured-prolog-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-prolog-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-prolog-interface-latex
 
 ppl-user-configured-prolog-interface- at VERSION@.pdf: \
 user-configured-prolog-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-configured-prolog-interface.latex-dir \
+	    refman.pdf \
+	    && mv -f user-configured-prolog-interface.latex-dir/refman.pdf $@
 
 ppl-devref-configured-prolog-interface- at VERSION@.pdf: \
 devref-configured-prolog-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-configured-prolog-interface.latex-dir \
+	    refman.pdf \
+	    && mv -f devref-configured-prolog-interface.latex-dir/refman.pdf $@
 
 ppl-user-configured-prolog-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1389,8 +1427,9 @@ $(USER_CONFIGURED_PROLOG_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-configured-prolog-interface.tex
 	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_USER_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-configured-prolog-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-prolog-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-prolog-interface-html
 
 ppl-devref-configured-prolog-interface- at VERSION@-html: \
@@ -1401,8 +1440,9 @@ $(DEVREF_CONFIGURED_PROLOG_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-configured-prolog-interface.tex
 	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-configured-prolog-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-prolog-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-prolog-interface-html
 
 endif BUILD_SOME_PROLOG_INTERFACES
@@ -1424,8 +1464,8 @@ SED_CONFIGURED_OCAML_INPUT_DEVREF = \
 $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/OCaml/OCaml_interface.dox \
 $(srcdir)/../interfaces/OCaml/ppl_ocaml_common.cc \
-$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.defs.hh \
-$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.inlines.hh
+$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_defs.hh \
+$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_inlines.hh
 
 user-configured-ocaml-interface.latex-dir: \
 user-language-interface.doxyconf \
@@ -1435,8 +1475,9 @@ $(USER_CONFIGURED_OCAML_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-configured-ocaml-interface.tex
 	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-configured-ocaml-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-ocaml-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-ocaml-interface-latex
 	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 		../interfaces/OCaml/ppl_ocaml.mli
@@ -1449,19 +1490,24 @@ $(DEVREF_CONFIGURED_OCAML_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-configured-ocaml-interface.tex
 	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-configured-ocaml-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-ocaml-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-ocaml-interface-latex
 	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 		../interfaces/OCaml/ppl_ocaml.mli
 
 ppl-user-configured-ocaml-interface- at VERSION@.pdf: \
 user-configured-ocaml-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-configured-ocaml-interface.latex-dir \
+	    refman.pdf \
+	    && mv -f user-configured-ocaml-interface.latex-dir/refman.pdf $@
 
 ppl-devref-configured-ocaml-interface- at VERSION@.pdf: \
 devref-configured-ocaml-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-configured-ocaml-interface.latex-dir \
+	    refman.pdf \
+	    && mv -f devref-configured-ocaml-interface.latex-dir/refman.pdf $@
 
 ppl-user-configured-ocaml-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1472,7 +1518,8 @@ $(USER_CONFIGURED_OCAML_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-configured-ocaml-interface.tex
 	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-configured-ocaml-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-ocaml-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-ocaml-interface-html
 	mkdir $@/ocamldoc
 	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -1486,8 +1533,9 @@ $(DEVREF_CONFIGURED_OCAML_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-configured-ocaml-interface.tex
 	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-configured-ocaml-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-ocaml-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-ocaml-interface-html
 	mkdir $@/ocamldoc
 	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -1527,7 +1575,8 @@ $(USER_CONFIGURED_JAVA_INTERFACE_STUFF)
 	    > user-configured-java-interface.tex
 	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_USER_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-configured-java-interface-latex
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-java-interface-latex
 	echo "HIDE_UNDOC_MEMBERS = NO" \
 	    >> Doxyfile.user-configured-java-interface-latex
 	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
@@ -1543,18 +1592,23 @@ $(DEVREF_CONFIGURED_JAVA_INTERFACE_STUFF)
 	    > devref-configured-java-interface.tex
 	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_DEVREF_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-configured-java-interface-latex
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-java-interface-latex
 	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
 	    >> Doxyfile.devref-configured-java-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-java-interface-latex
 
 ppl-user-configured-java-interface- at VERSION@.pdf: \
 user-configured-java-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-configured-java-interface.latex-dir \
+	    refman.pdf \
+	    && mv -f user-configured-java-interface.latex-dir/refman.pdf $@
 
 ppl-devref-configured-java-interface- at VERSION@.pdf: \
 devref-configured-java-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-configured-java-interface.latex-dir \
+	    refman.pdf \
+	    && mv -f devref-configured-java-interface.latex-dir/refman.pdf $@
 
 ppl-user-configured-java-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1565,7 +1619,8 @@ $(USER_CONFIGURED_JAVA_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-configured-java-interface.tex
 	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-configured-java-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-configured-java-interface-html
 	echo "HIDE_UNDOC_MEMBERS = NO" \
 	    >> Doxyfile.user-configured-java-interface-html
 	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
@@ -1581,7 +1636,8 @@ $(DEVREF_CONFIGURED_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    > devref-configured-java-interface.tex
 	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_DEVREF_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-configured-java-interface-html
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-configured-java-interface-html
 	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
 	    >> Doxyfile.devref-configured-java-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-java-interface-html
diff --git a/doc/Makefile.in b/doc/Makefile.in
index 1501beb..72bd47a 100644
--- a/doc/Makefile.in
+++ b/doc/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -64,7 +80,7 @@ DIST_COMMON = $(dist_man_MANS) $(srcdir)/Makefile.am \
 	$(srcdir)/devref.doxyconf-latex.in \
 	$(srcdir)/user-language-interface.doxyconf.in \
 	$(srcdir)/user.doxyconf-html.in \
-	$(srcdir)/user.doxyconf-latex.in
+	$(srcdir)/user.doxyconf-latex.in $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -100,14 +116,25 @@ CONFIG_CLEAN_FILES = user.doxyconf-latex devref.doxyconf-latex \
 	user-language-interface.doxyconf \
 	devref-language-interface.doxyconf
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -377,7 +404,7 @@ fdl.dox
 
 
 # NOTE: this variable is used to populate Doxygen configuration tag INPUT.
-# The file path is that of the build directory, hence we ca not use
+# The file path is that of the build directory, hence we cannot use
 # variable DOX_LICENSE_FILES defined above.
 DOX_LICENSE_INPUT = \
 $(srcdir)/gpl.dox \
@@ -440,8 +467,8 @@ $(PPL_SOURCE_FILES)
 @BUILD_C_INTERFACE_TRUE at DEVREF_C_INTERFACE_STUFF = \
 @BUILD_C_INTERFACE_TRUE@$(COMMON_C_INTERFACE_STUFF) \
 @BUILD_C_INTERFACE_TRUE at devref-language-interface.tex \
- at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common.defs.hh \
- at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common.inlines.hh \
+ at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common_defs.hh \
+ at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common_inlines.hh \
 @BUILD_C_INTERFACE_TRUE at ../interfaces/C/ppl_c_implementation_common.cc
 
 
@@ -477,8 +504,8 @@ $(PPL_SOURCE_FILES)
 @BUILD_C_INTERFACE_TRUE at DEVREF_CONFIGURED_C_INTERFACE_STUFF = \
 @BUILD_C_INTERFACE_TRUE@$(COMMON_C_INTERFACE_STUFF) \
 @BUILD_C_INTERFACE_TRUE@$(top_builddir)/interfaces/C/ppl_c.h \
- at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common.defs.hh \
- at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common.inlines.hh \
+ at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common_defs.hh \
+ at BUILD_C_INTERFACE_TRUE@../interfaces/C/ppl_c_implementation_common_inlines.hh \
 @BUILD_C_INTERFACE_TRUE at ../interfaces/C/ppl_c_implementation_common.cc
 
 
@@ -526,8 +553,8 @@ $(PPL_SOURCE_FILES)
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ppl.sty \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ../interfaces/Prolog/Prolog_interface.dox \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(PROLOG_INTERFACE_ADDITIONAL_DOX_PAGES) \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common.defs.hh \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common_defs.hh \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ../interfaces/Prolog/ppl_prolog_common.cc
 
 
@@ -569,8 +596,8 @@ $(PPL_SOURCE_FILES)
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ppl.sty \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ../interfaces/Prolog/Prolog_configured_interface.dox \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(PROLOG_INTERFACE_ADDITIONAL_DOX_PAGES) \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common.defs.hh \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common_defs.hh \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ../interfaces/Prolog/ppl_prolog_common.cc \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(top_builddir)/interfaces/Prolog/ppl_prolog_domains.hh \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(top_builddir)/interfaces/Prolog/ppl_prolog_domains.cc.stamp
@@ -613,8 +640,8 @@ $(PPL_SOURCE_FILES)
 @BUILD_OCAML_INTERFACE_TRUE at devref-language-interface.tex \
 @BUILD_OCAML_INTERFACE_TRUE at ppl.sty \
 @BUILD_OCAML_INTERFACE_TRUE at ../interfaces/OCaml/OCaml_interface.dox \
- at BUILD_OCAML_INTERFACE_TRUE@../interfaces/OCaml/ppl_ocaml_common.defs.hh \
- at BUILD_OCAML_INTERFACE_TRUE@../interfaces/OCaml/ppl_ocaml_common.inlines.hh \
+ at BUILD_OCAML_INTERFACE_TRUE@../interfaces/OCaml/ppl_ocaml_common_defs.hh \
+ at BUILD_OCAML_INTERFACE_TRUE@../interfaces/OCaml/ppl_ocaml_common_inlines.hh \
 @BUILD_OCAML_INTERFACE_TRUE at ../interfaces/OCaml/ppl_ocaml_common.cc \
 @BUILD_OCAML_INTERFACE_TRUE at ../interfaces/OCaml/ppl_ocaml_globals.mli
 
@@ -733,8 +760,8 @@ $(PPL_SOURCE_FILES)
 @BUILD_JAVA_INTERFACE_TRUE at ppl.sty \
 @BUILD_JAVA_INTERFACE_TRUE@$(JAVA_INTERFACE_JAVA_FILES) \
 @BUILD_JAVA_INTERFACE_TRUE at ../interfaces/Java/jni/ppl_java_common.cc \
- at BUILD_JAVA_INTERFACE_TRUE@../interfaces/Java/jni/ppl_java_common.defs.hh \
- at BUILD_JAVA_INTERFACE_TRUE@../interfaces/Java/jni/ppl_java_common.inlines.hh \
+ at BUILD_JAVA_INTERFACE_TRUE@../interfaces/Java/jni/ppl_java_common_defs.hh \
+ at BUILD_JAVA_INTERFACE_TRUE@../interfaces/Java/jni/ppl_java_common_inlines.hh \
 @BUILD_JAVA_INTERFACE_TRUE at ../interfaces/Java/jni/ppl_java_globals.cc
 
 
@@ -978,8 +1005,8 @@ $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/C/ppl_c_header.h \
 $(srcdir)/../interfaces/C/C_interface.dox \
 $(srcdir)/../interfaces/C/ppl_c_implementation_common.cc \
-$(srcdir)/../interfaces/C/ppl_c_implementation_common.defs.hh \
-$(srcdir)/../interfaces/C/ppl_c_implementation_common.inlines.hh
+$(srcdir)/../interfaces/C/ppl_c_implementation_common_defs.hh \
+$(srcdir)/../interfaces/C/ppl_c_implementation_common_inlines.hh
 
 
 # (System Independent) Prolog Language Interface Targets
@@ -1004,8 +1031,8 @@ $(srcdir)/../interfaces/Prolog/Prolog_interface_sysindep.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_sysindep_domains.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_compilation.dox \
 $(srcdir)/../interfaces/Prolog/Prolog_interface_sysdep.dox \
-$(srcdir)/../interfaces/Prolog/ppl_prolog_common.defs.hh \
-$(srcdir)/../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+$(srcdir)/../interfaces/Prolog/ppl_prolog_common_defs.hh \
+$(srcdir)/../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 $(srcdir)/../interfaces/Prolog/ppl_prolog_common.cc
 
 
@@ -1024,8 +1051,8 @@ SED_OCAML_INPUT_DEVREF = \
 $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/OCaml/OCaml_interface.dox \
 $(srcdir)/../interfaces/OCaml/ppl_ocaml_common.cc \
-$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.defs.hh \
-$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.inlines.hh
+$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_defs.hh \
+$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_inlines.hh
 
 OCAMLDOC_HTML_OPTIONS = \
 -I @mlgmp_dir@ -I $(top_builddir)/interfaces/OCaml -html
@@ -1050,8 +1077,8 @@ SED_JAVA_INPUT_DEVREF = \
 $(DOX_LICENSE_INPUT) \
 $(srcdir)/../interfaces/Java/parma_polyhedra_library \
 $(srcdir)/../interfaces/Java/jni/ppl_java_common.cc \
-$(srcdir)/../interfaces/Java/jni/ppl_java_common.defs.hh \
-$(srcdir)/../interfaces/Java/jni/ppl_java_common.inlines.hh \
+$(srcdir)/../interfaces/Java/jni/ppl_java_common_defs.hh \
+$(srcdir)/../interfaces/Java/jni/ppl_java_common_inlines.hh \
 $(srcdir)/../interfaces/Java/jni/ppl_java_globals.cc
 
 
@@ -1076,8 +1103,8 @@ $(srcdir)/../interfaces/Java/jni/ppl_java_globals.cc
 @BUILD_C_INTERFACE_TRUE@$(srcdir)/../interfaces/C/C_interface.dox \
 @BUILD_C_INTERFACE_TRUE at ../interfaces/C/ppl_c.h \
 @BUILD_C_INTERFACE_TRUE@$(srcdir)/../interfaces/C/ppl_c_implementation_common.cc \
- at BUILD_C_INTERFACE_TRUE@$(srcdir)/../interfaces/C/ppl_c_implementation_common.defs.hh \
- at BUILD_C_INTERFACE_TRUE@$(srcdir)/../interfaces/C/ppl_c_implementation_common.inlines.hh
+ at BUILD_C_INTERFACE_TRUE@$(srcdir)/../interfaces/C/ppl_c_implementation_common_defs.hh \
+ at BUILD_C_INTERFACE_TRUE@$(srcdir)/../interfaces/C/ppl_c_implementation_common_inlines.hh
 
 
 # Configuration-Dependent Prolog Language Interface Targets
@@ -1102,8 +1129,8 @@ $(srcdir)/../interfaces/Java/jni/ppl_java_globals.cc
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ../interfaces/Prolog/Prolog_configured_domains.dox \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/Prolog_interface_compilation.dox \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/Prolog_interface_sysdep.dox \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/ppl_prolog_common.defs.hh \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/ppl_prolog_common.inlines.hh \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/ppl_prolog_common_defs.hh \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/ppl_prolog_common_inlines.hh \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@$(srcdir)/../interfaces/Prolog/ppl_prolog_common.cc
 
 
@@ -1122,8 +1149,8 @@ $(srcdir)/../interfaces/Java/jni/ppl_java_globals.cc
 @BUILD_OCAML_INTERFACE_TRUE@$(DOX_LICENSE_INPUT) \
 @BUILD_OCAML_INTERFACE_TRUE@$(srcdir)/../interfaces/OCaml/OCaml_interface.dox \
 @BUILD_OCAML_INTERFACE_TRUE@$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.cc \
- at BUILD_OCAML_INTERFACE_TRUE@$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.defs.hh \
- at BUILD_OCAML_INTERFACE_TRUE@$(srcdir)/../interfaces/OCaml/ppl_ocaml_common.inlines.hh
+ at BUILD_OCAML_INTERFACE_TRUE@$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_defs.hh \
+ at BUILD_OCAML_INTERFACE_TRUE@$(srcdir)/../interfaces/OCaml/ppl_ocaml_common_inlines.hh
 
 
 # Configuration-Dependent Java Language Interface Targets
@@ -1234,11 +1261,18 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-man1: $(dist_man_MANS)
 	@$(NORMAL_INSTALL)
-	test -z "$(man1dir)" || $(MKDIR_P) "$(DESTDIR)$(man1dir)"
-	@list=''; test -n "$(man1dir)" || exit 0; \
-	{ for i in $$list; do echo "$$i"; done; \
-	l2='$(dist_man_MANS)'; for i in $$l2; do echo "$$i"; done | \
-	  sed -n '/\.1[a-z]*$$/p'; \
+	@list1=''; \
+	list2='$(dist_man_MANS)'; \
+	test -n "$(man1dir)" \
+	  && test -n "`echo $$list1$$list2`" \
+	  || exit 0; \
+	echo " $(MKDIR_P) '$(DESTDIR)$(man1dir)'"; \
+	$(MKDIR_P) "$(DESTDIR)$(man1dir)" || exit 1; \
+	{ for i in $$list1; do echo "$$i"; done;  \
+	if test -n "$$list2"; then \
+	  for i in $$list2; do echo "$$i"; done \
+	    | sed -n '/\.1[a-z]*$$/p'; \
+	fi; \
 	} | while read p; do \
 	  if test -f $$p; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; echo "$$p"; \
@@ -1270,11 +1304,18 @@ uninstall-man1:
 	dir='$(DESTDIR)$(man1dir)'; $(am__uninstall_files_from_dir)
 install-man3: $(dist_man_MANS)
 	@$(NORMAL_INSTALL)
-	test -z "$(man3dir)" || $(MKDIR_P) "$(DESTDIR)$(man3dir)"
-	@list=''; test -n "$(man3dir)" || exit 0; \
-	{ for i in $$list; do echo "$$i"; done; \
-	l2='$(dist_man_MANS)'; for i in $$l2; do echo "$$i"; done | \
-	  sed -n '/\.3[a-z]*$$/p'; \
+	@list1=''; \
+	list2='$(dist_man_MANS)'; \
+	test -n "$(man3dir)" \
+	  && test -n "`echo $$list1$$list2`" \
+	  || exit 0; \
+	echo " $(MKDIR_P) '$(DESTDIR)$(man3dir)'"; \
+	$(MKDIR_P) "$(DESTDIR)$(man3dir)" || exit 1; \
+	{ for i in $$list1; do echo "$$i"; done;  \
+	if test -n "$$list2"; then \
+	  for i in $$list2; do echo "$$i"; done \
+	    | sed -n '/\.3[a-z]*$$/p'; \
+	fi; \
 	} | while read p; do \
 	  if test -f $$p; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; echo "$$p"; \
@@ -1310,6 +1351,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@list='$(MANS)'; if test -n "$$list"; then \
@@ -1318,10 +1361,10 @@ distdir: $(DISTFILES)
 	    if test -f "$$d$$p"; then echo "$$d$$p"; else :; fi; done`; \
 	  if test -n "$$list" && \
 	    grep 'ab help2man is required to generate this page' $$list >/dev/null; then \
-	    echo "error: found man pages containing the \`missing help2man' replacement text:" >&2; \
+	    echo "error: found man pages containing the 'missing help2man' replacement text:" >&2; \
 	    grep -l 'ab help2man is required to generate this page' $$list | sed 's/^/         /' >&2; \
 	    echo "       to fix them, install help2man, remove and regenerate the man pages;" >&2; \
-	    echo "       typically \`make maintainer-clean' will remove them" >&2; \
+	    echo "       typically 'make maintainer-clean' will remove them" >&2; \
 	    exit 1; \
 	  else :; fi; \
 	else :; fi
@@ -1684,25 +1727,27 @@ uninstall-txt:
 
 user.latex-dir: user.doxyconf-latex $(USER_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) user.doxyconf-latex
 
 devref.latex-dir: devref.doxyconf-latex $(DEVREF_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) devref.doxyconf-latex
 
 ppl-user- at VERSION@.pdf: user.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user.latex-dir refman.pdf \
+	    && mv -f user.latex-dir/refman.pdf $@
 
 ppl-devref- at VERSION@.pdf: devref.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref.latex-dir refman.pdf \
+	    && mv -f devref.latex-dir/refman.pdf $@
 
 $(USER_CORE_HTML_DIR): user.doxyconf-html $(USER_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) user.doxyconf-html
 
 $(DEVREF_CORE_HTML_DIR): devref.doxyconf-html $(DEVREF_CORE_STUFF)
 	rm -rf $@
-	$(TEX_ENV) $(DOXYGEN) $<
+	$(TEX_ENV) $(DOXYGEN) devref.doxyconf-html
 
 user-c-interface.latex-dir: \
 user-language-interface.doxyconf \
@@ -1713,7 +1758,8 @@ $(USER_C_INTERFACE_STUFF)
 	    > user-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_USER_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-c-interface-latex
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-c-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-c-interface-latex
 
 devref-c-interface.latex-dir: \
@@ -1725,14 +1771,17 @@ $(DEVREF_C_INTERFACE_STUFF)
 	    > devref-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_DEVREF_LATEX_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-c-interface-latex
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-c-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-c-interface-latex
 
 ppl-user-c-interface- at VERSION@.pdf: user-c-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-c-interface.latex-dir refman.pdf \
+	    && mv -f user-c-interface.latex-dir/refman.pdf $@
 
 ppl-devref-c-interface- at VERSION@.pdf: devref-c-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-c-interface.latex-dir refman.pdf \
+	    && mv -f devref-c-interface.latex-dir/refman.pdf $@
 
 ppl-user-c-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1743,7 +1792,8 @@ $(USER_C_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-c-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-c-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-c-interface-html
 
 ppl-devref-c-interface- at VERSION@-html: \
@@ -1755,7 +1805,8 @@ $(DEVREF_C_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    > devref-c-interface.tex
 	$(SED) $(SED_C_OPTION) $(SED_DEVREF_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_C_INPUT_DEVREF)"'|' \
-	    $<  > Doxyfile.devref-c-interface-html
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-c-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-c-interface-html
 
 user-prolog-interface.latex-dir: \
@@ -1766,8 +1817,9 @@ $(USER_PROLOG_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-prolog-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-prolog-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-prolog-interface-latex
 
 devref-prolog-interface.latex-dir: \
@@ -1778,15 +1830,18 @@ $(DEVREF_PROLOG_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-prolog-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-prolog-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-prolog-interface-latex
 
 ppl-user-prolog-interface- at VERSION@.pdf: user-prolog-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-prolog-interface.latex-dir refman.pdf \
+	    && mv -f user-prolog-interface.latex-dir/refman.pdf $@
 
 ppl-devref-prolog-interface- at VERSION@.pdf: devref-prolog-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-prolog-interface.latex-dir refman.pdf \
+	    && mv -f devref-prolog-interface.latex-dir/refman.pdf $@
 
 ppl-user-prolog-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1796,8 +1851,9 @@ $(USER_PROLOG_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_USER_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-prolog-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-prolog-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-prolog-interface-html
 
 ppl-devref-prolog-interface- at VERSION@-html: \
@@ -1808,8 +1864,9 @@ $(DEVREF_PROLOG_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-prolog-interface.tex
 	$(SED) $(SED_PROLOG_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-prolog-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_PROLOG_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf > \
+	    Doxyfile.devref-prolog-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-prolog-interface-html
 
 user-ocaml-interface.latex-dir: \
@@ -1820,8 +1877,9 @@ $(USER_OCAML_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-ocaml-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf > \
+	    Doxyfile.user-ocaml-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-ocaml-interface-latex
 	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 		$(srcdir)/../interfaces/OCaml/ppl_ocaml_globals.mli
@@ -1834,17 +1892,20 @@ $(DEVREF_OCAML_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-ocaml-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-ocaml-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-ocaml-interface-latex
 	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 		$(srcdir)/../interfaces/OCaml/ppl_ocaml_globals.mli
 
 ppl-user-ocaml-interface- at VERSION@.pdf: user-ocaml-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-ocaml-interface.latex-dir refman.pdf \
+	    && mv -f user-ocaml-interface.latex-dir/refman.pdf $@
 
 ppl-devref-ocaml-interface- at VERSION@.pdf: devref-ocaml-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-ocaml-interface.latex-dir refman.pdf \
+	    && mv -f devref-ocaml-interface.latex-dir/refman.pdf $@
 
 ppl-user-ocaml-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1855,7 +1916,8 @@ $(USER_OCAML_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    > user-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_USER_HTML_OPTION) \
 	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_USER)"'|' \
-	    $<  > Doxyfile.user-ocaml-interface-html
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-ocaml-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-ocaml-interface-html
 	mkdir $@/ocamldoc
 	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -1869,8 +1931,9 @@ $(DEVREF_OCAML_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-ocaml-interface.tex
 	$(SED) $(SED_OCAML_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-ocaml-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_OCAML_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-ocaml-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-ocaml-interface-html
 	mkdir $@/ocamldoc
 	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -1884,8 +1947,9 @@ $(USER_JAVA_INTERFACE_STUFF)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_USER_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-java-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-java-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-java-interface-latex
 
 devref-java-interface.latex-dir: \
@@ -1896,15 +1960,18 @@ $(DEVREF_JAVA_INTERFACE_STUFF)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_DEVREF_LATEX_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-java-interface-latex
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-java-interface-latex
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-java-interface-latex
 
 ppl-user-java-interface- at VERSION@.pdf: user-java-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C user-java-interface.latex-dir refman.pdf \
+	    && mv -f user-java-interface.latex-dir/refman.pdf $@
 
 ppl-devref-java-interface- at VERSION@.pdf: devref-java-interface.latex-dir
-	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+	$(TEX_ENV) make -C devref-java-interface.latex-dir refman.pdf \
+	    && mv -f devref-java-interface.latex-dir/refman.pdf $@
 
 ppl-user-java-interface- at VERSION@-html: \
 user-language-interface.doxyconf \
@@ -1914,8 +1981,9 @@ $(USER_JAVA_INTERFACE_STUFF) $(USER_CORE_HTML_DIR)
 	    $(srcdir)/user-language-interface.tex \
 	    > user-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_USER_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
-	  $<  > Doxyfile.user-java-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_USER)"'|' \
+	    user-language-interface.doxyconf \
+	    > Doxyfile.user-java-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-java-interface-html
 
 ppl-devref-java-interface- at VERSION@-html: \
@@ -1926,8 +1994,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 	    $(srcdir)/devref-language-interface.tex \
 	    > devref-java-interface.tex
 	$(SED) $(SED_JAVA_OPTION) $(SED_DEVREF_HTML_OPTION) \
-	  -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
-	  $<  > Doxyfile.devref-java-interface-html
+	    -e 's|<PPL_SED_INPUT>|'"$(SED_JAVA_INPUT_DEVREF)"'|' \
+	    devref-language-interface.doxyconf \
+	    > Doxyfile.devref-java-interface-html
 	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-java-interface-html
 # FIXME add generated files
 
@@ -1940,7 +2009,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_C_INTERFACE_TRUE@	    > user-configured-c-interface.tex
 @BUILD_C_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_USER_LATEX_OPTION) \
 @BUILD_C_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_USER)"'|' \
- at BUILD_C_INTERFACE_TRUE@	    $<  > Doxyfile.user-configured-c-interface-latex
+ at BUILD_C_INTERFACE_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_C_INTERFACE_TRUE@	    > Doxyfile.user-configured-c-interface-latex
 @BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-c-interface-latex
 
 @BUILD_C_INTERFACE_TRUE at devref-configured-c-interface.latex-dir: \
@@ -1952,16 +2022,19 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_C_INTERFACE_TRUE@	    > devref-configured-c-interface.tex
 @BUILD_C_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_DEVREF_LATEX_OPTION) \
 @BUILD_C_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_DEVREF)"'|' \
- at BUILD_C_INTERFACE_TRUE@	    $<  > Doxyfile.devref-configured-c-interface-latex
+ at BUILD_C_INTERFACE_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_C_INTERFACE_TRUE@	    > Doxyfile.devref-configured-c-interface-latex
 @BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-c-interface-latex
 
 @BUILD_C_INTERFACE_TRUE at ppl-user-configured-c-interface-@VERSION at .pdf: \
 @BUILD_C_INTERFACE_TRUE at user-configured-c-interface.latex-dir
- at BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) make -C user-configured-c-interface.latex-dir refman.pdf \
+ at BUILD_C_INTERFACE_TRUE@	  && mv -f user-configured-c-interface.latex-dir/refman.pdf $@
 
 @BUILD_C_INTERFACE_TRUE at ppl-devref-configured-c-interface-@VERSION at .pdf: \
 @BUILD_C_INTERFACE_TRUE at devref-configured-c-interface.latex-dir
- at BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) make -C devref-configured-c-interface.latex-dir refman.pdf \
+ at BUILD_C_INTERFACE_TRUE@	    && mv -f devref-configured-c-interface.latex-dir/refman.pdf $@
 
 @BUILD_C_INTERFACE_TRUE at ppl-user-configured-c-interface-@VERSION at -html: \
 @BUILD_C_INTERFACE_TRUE at user-language-interface.doxyconf \
@@ -1972,7 +2045,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_C_INTERFACE_TRUE@	    > user-configured-c-interface.tex
 @BUILD_C_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_USER_HTML_OPTION) \
 @BUILD_C_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_USER)"'|' \
- at BUILD_C_INTERFACE_TRUE@	    $<  > Doxyfile.user-configured-c-interface-html
+ at BUILD_C_INTERFACE_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_C_INTERFACE_TRUE@	    > Doxyfile.user-configured-c-interface-html
 @BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-c-interface-html
 
 @BUILD_C_INTERFACE_TRUE at ppl-devref-configured-c-interface-@VERSION at -html: \
@@ -1984,7 +2058,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_C_INTERFACE_TRUE@	    > devref-configured-c-interface.tex
 @BUILD_C_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_C_OPTION) $(SED_DEVREF_HTML_OPTION) \
 @BUILD_C_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_C_INPUT_DEVREF)"'|' \
- at BUILD_C_INTERFACE_TRUE@	    $<  > Doxyfile.devref-configured-c-interface-html
+ at BUILD_C_INTERFACE_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_C_INTERFACE_TRUE@	    > Doxyfile.devref-configured-c-interface-html
 @BUILD_C_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-c-interface-html
 # FIXME: add appropriate generated files.
 
@@ -1996,8 +2071,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    $(srcdir)/user-language-interface.tex \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > user-configured-prolog-interface.tex
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_USER_LATEX_OPTION) \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  $<  > Doxyfile.user-configured-prolog-interface-latex
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > Doxyfile.user-configured-prolog-interface-latex
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-prolog-interface-latex
 
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at devref-configured-prolog-interface.latex-dir: \
@@ -2008,17 +2084,22 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    $(srcdir)/devref-language-interface.tex \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > devref-configured-prolog-interface.tex
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_DEVREF_LATEX_OPTION) \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  $<  > Doxyfile.devref-configured-prolog-interface-latex
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > Doxyfile.devref-configured-prolog-interface-latex
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-prolog-interface-latex
 
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ppl-user-configured-prolog-interface-@VERSION at .pdf: \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at user-configured-prolog-interface.latex-dir
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) make -C user-configured-prolog-interface.latex-dir \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    refman.pdf \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    && mv -f user-configured-prolog-interface.latex-dir/refman.pdf $@
 
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ppl-devref-configured-prolog-interface-@VERSION at .pdf: \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at devref-configured-prolog-interface.latex-dir
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) make -C devref-configured-prolog-interface.latex-dir \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    refman.pdf \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    && mv -f devref-configured-prolog-interface.latex-dir/refman.pdf $@
 
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ppl-user-configured-prolog-interface-@VERSION at -html: \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at user-language-interface.doxyconf \
@@ -2028,8 +2109,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    $(srcdir)/user-language-interface.tex \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > user-configured-prolog-interface.tex
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_USER_HTML_OPTION) \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  $<  > Doxyfile.user-configured-prolog-interface-html
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_USER)"'|' \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > Doxyfile.user-configured-prolog-interface-html
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-prolog-interface-html
 
 @BUILD_SOME_PROLOG_INTERFACES_TRUE at ppl-devref-configured-prolog-interface-@VERSION at -html: \
@@ -2040,8 +2122,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    $(srcdir)/devref-language-interface.tex \
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > devref-configured-prolog-interface.tex
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(SED) $(SED_CONFIGURED_PROLOG_OPTION) $(SED_DEVREF_HTML_OPTION) \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
- at BUILD_SOME_PROLOG_INTERFACES_TRUE@	  $<  > Doxyfile.devref-configured-prolog-interface-html
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_PROLOG_INPUT_DEVREF)"'|' \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_SOME_PROLOG_INTERFACES_TRUE@	    > Doxyfile.devref-configured-prolog-interface-html
 @BUILD_SOME_PROLOG_INTERFACES_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-prolog-interface-html
 
 @BUILD_OCAML_INTERFACE_TRUE at user-configured-ocaml-interface.latex-dir: \
@@ -2052,8 +2135,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_OCAML_INTERFACE_TRUE@	    $(srcdir)/user-language-interface.tex \
 @BUILD_OCAML_INTERFACE_TRUE@	    > user-configured-ocaml-interface.tex
 @BUILD_OCAML_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_USER_LATEX_OPTION) \
- at BUILD_OCAML_INTERFACE_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_USER)"'|' \
- at BUILD_OCAML_INTERFACE_TRUE@	  $<  > Doxyfile.user-configured-ocaml-interface-latex
+ at BUILD_OCAML_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_USER)"'|' \
+ at BUILD_OCAML_INTERFACE_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_OCAML_INTERFACE_TRUE@	    > Doxyfile.user-configured-ocaml-interface-latex
 @BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-ocaml-interface-latex
 @BUILD_OCAML_INTERFACE_TRUE@	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 @BUILD_OCAML_INTERFACE_TRUE@		../interfaces/OCaml/ppl_ocaml.mli
@@ -2066,19 +2150,24 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_OCAML_INTERFACE_TRUE@	    $(srcdir)/devref-language-interface.tex \
 @BUILD_OCAML_INTERFACE_TRUE@	    > devref-configured-ocaml-interface.tex
 @BUILD_OCAML_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_DEVREF_LATEX_OPTION) \
- at BUILD_OCAML_INTERFACE_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
- at BUILD_OCAML_INTERFACE_TRUE@	  $<  > Doxyfile.devref-configured-ocaml-interface-latex
+ at BUILD_OCAML_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
+ at BUILD_OCAML_INTERFACE_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_OCAML_INTERFACE_TRUE@	    > Doxyfile.devref-configured-ocaml-interface-latex
 @BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-ocaml-interface-latex
 @BUILD_OCAML_INTERFACE_TRUE@	$(OCAMLDOC) $(OCAMLDOC_LATEX_OPTIONS) -o $@/ocamldoc.tex \
 @BUILD_OCAML_INTERFACE_TRUE@		../interfaces/OCaml/ppl_ocaml.mli
 
 @BUILD_OCAML_INTERFACE_TRUE at ppl-user-configured-ocaml-interface-@VERSION at .pdf: \
 @BUILD_OCAML_INTERFACE_TRUE at user-configured-ocaml-interface.latex-dir
- at BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) make -C user-configured-ocaml-interface.latex-dir \
+ at BUILD_OCAML_INTERFACE_TRUE@	    refman.pdf \
+ at BUILD_OCAML_INTERFACE_TRUE@	    && mv -f user-configured-ocaml-interface.latex-dir/refman.pdf $@
 
 @BUILD_OCAML_INTERFACE_TRUE at ppl-devref-configured-ocaml-interface-@VERSION at .pdf: \
 @BUILD_OCAML_INTERFACE_TRUE at devref-configured-ocaml-interface.latex-dir
- at BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) make -C devref-configured-ocaml-interface.latex-dir \
+ at BUILD_OCAML_INTERFACE_TRUE@	    refman.pdf \
+ at BUILD_OCAML_INTERFACE_TRUE@	    && mv -f devref-configured-ocaml-interface.latex-dir/refman.pdf $@
 
 @BUILD_OCAML_INTERFACE_TRUE at ppl-user-configured-ocaml-interface-@VERSION at -html: \
 @BUILD_OCAML_INTERFACE_TRUE at user-language-interface.doxyconf \
@@ -2089,7 +2178,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_OCAML_INTERFACE_TRUE@	    > user-configured-ocaml-interface.tex
 @BUILD_OCAML_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_USER_HTML_OPTION) \
 @BUILD_OCAML_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_USER)"'|' \
- at BUILD_OCAML_INTERFACE_TRUE@	    $<  > Doxyfile.user-configured-ocaml-interface-html
+ at BUILD_OCAML_INTERFACE_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_OCAML_INTERFACE_TRUE@	    > Doxyfile.user-configured-ocaml-interface-html
 @BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.user-configured-ocaml-interface-html
 @BUILD_OCAML_INTERFACE_TRUE@	mkdir $@/ocamldoc
 @BUILD_OCAML_INTERFACE_TRUE@	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -2103,8 +2193,9 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_OCAML_INTERFACE_TRUE@	    $(srcdir)/devref-language-interface.tex \
 @BUILD_OCAML_INTERFACE_TRUE@	    > devref-configured-ocaml-interface.tex
 @BUILD_OCAML_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_OCAML_OPTION) $(SED_DEVREF_HTML_OPTION) \
- at BUILD_OCAML_INTERFACE_TRUE@	  -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
- at BUILD_OCAML_INTERFACE_TRUE@	  $<  > Doxyfile.devref-configured-ocaml-interface-html
+ at BUILD_OCAML_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_OCAML_INPUT_DEVREF)"'|' \
+ at BUILD_OCAML_INTERFACE_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_OCAML_INTERFACE_TRUE@	    > Doxyfile.devref-configured-ocaml-interface-html
 @BUILD_OCAML_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-ocaml-interface-html
 @BUILD_OCAML_INTERFACE_TRUE@	mkdir $@/ocamldoc
 @BUILD_OCAML_INTERFACE_TRUE@	$(OCAMLDOC) $(OCAMLDOC_HTML_OPTIONS) -d $@/ocamldoc \
@@ -2125,7 +2216,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_JAVA_INTERFACE_TRUE@	    > user-configured-java-interface.tex
 @BUILD_JAVA_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_USER_LATEX_OPTION) \
 @BUILD_JAVA_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_USER)"'|' \
- at BUILD_JAVA_INTERFACE_TRUE@	    $<  > Doxyfile.user-configured-java-interface-latex
+ at BUILD_JAVA_INTERFACE_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_JAVA_INTERFACE_TRUE@	    > Doxyfile.user-configured-java-interface-latex
 @BUILD_JAVA_INTERFACE_TRUE@	echo "HIDE_UNDOC_MEMBERS = NO" \
 @BUILD_JAVA_INTERFACE_TRUE@	    >> Doxyfile.user-configured-java-interface-latex
 @BUILD_JAVA_INTERFACE_TRUE@	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
@@ -2141,18 +2233,23 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_JAVA_INTERFACE_TRUE@	    > devref-configured-java-interface.tex
 @BUILD_JAVA_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_DEVREF_LATEX_OPTION) \
 @BUILD_JAVA_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_DEVREF)"'|' \
- at BUILD_JAVA_INTERFACE_TRUE@	    $<  > Doxyfile.devref-configured-java-interface-latex
+ at BUILD_JAVA_INTERFACE_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_JAVA_INTERFACE_TRUE@	    > Doxyfile.devref-configured-java-interface-latex
 @BUILD_JAVA_INTERFACE_TRUE@	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
 @BUILD_JAVA_INTERFACE_TRUE@	    >> Doxyfile.devref-configured-java-interface-latex
 @BUILD_JAVA_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-java-interface-latex
 
 @BUILD_JAVA_INTERFACE_TRUE at ppl-user-configured-java-interface-@VERSION at .pdf: \
 @BUILD_JAVA_INTERFACE_TRUE at user-configured-java-interface.latex-dir
- at BUILD_JAVA_INTERFACE_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_JAVA_INTERFACE_TRUE@	$(TEX_ENV) make -C user-configured-java-interface.latex-dir \
+ at BUILD_JAVA_INTERFACE_TRUE@	    refman.pdf \
+ at BUILD_JAVA_INTERFACE_TRUE@	    && mv -f user-configured-java-interface.latex-dir/refman.pdf $@
 
 @BUILD_JAVA_INTERFACE_TRUE at ppl-devref-configured-java-interface-@VERSION at .pdf: \
 @BUILD_JAVA_INTERFACE_TRUE at devref-configured-java-interface.latex-dir
- at BUILD_JAVA_INTERFACE_TRUE@	$(TEX_ENV) make -C $< refman.pdf && mv -f $</refman.pdf $@
+ at BUILD_JAVA_INTERFACE_TRUE@	$(TEX_ENV) make -C devref-configured-java-interface.latex-dir \
+ at BUILD_JAVA_INTERFACE_TRUE@	    refman.pdf \
+ at BUILD_JAVA_INTERFACE_TRUE@	    && mv -f devref-configured-java-interface.latex-dir/refman.pdf $@
 
 @BUILD_JAVA_INTERFACE_TRUE at ppl-user-configured-java-interface-@VERSION at -html: \
 @BUILD_JAVA_INTERFACE_TRUE at user-language-interface.doxyconf \
@@ -2163,7 +2260,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_JAVA_INTERFACE_TRUE@	    > user-configured-java-interface.tex
 @BUILD_JAVA_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_USER_HTML_OPTION) \
 @BUILD_JAVA_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_USER)"'|' \
- at BUILD_JAVA_INTERFACE_TRUE@	    $<  > Doxyfile.user-configured-java-interface-html
+ at BUILD_JAVA_INTERFACE_TRUE@	    user-language-interface.doxyconf \
+ at BUILD_JAVA_INTERFACE_TRUE@	    > Doxyfile.user-configured-java-interface-html
 @BUILD_JAVA_INTERFACE_TRUE@	echo "HIDE_UNDOC_MEMBERS = NO" \
 @BUILD_JAVA_INTERFACE_TRUE@	    >> Doxyfile.user-configured-java-interface-html
 @BUILD_JAVA_INTERFACE_TRUE@	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
@@ -2179,7 +2277,8 @@ $(DEVREF_JAVA_INTERFACE_STUFF) $(DEVREF_CORE_HTML_DIR)
 @BUILD_JAVA_INTERFACE_TRUE@	    > devref-configured-java-interface.tex
 @BUILD_JAVA_INTERFACE_TRUE@	$(SED) $(SED_CONFIGURED_JAVA_OPTION) $(SED_DEVREF_HTML_OPTION) \
 @BUILD_JAVA_INTERFACE_TRUE@	    -e 's|<PPL_SED_INPUT>|'"$(SED_CONFIGURED_JAVA_INPUT_DEVREF)"'|' \
- at BUILD_JAVA_INTERFACE_TRUE@	    $<  > Doxyfile.devref-configured-java-interface-html
+ at BUILD_JAVA_INTERFACE_TRUE@	    devref-language-interface.doxyconf \
+ at BUILD_JAVA_INTERFACE_TRUE@	    > Doxyfile.devref-configured-java-interface-html
 @BUILD_JAVA_INTERFACE_TRUE@	echo "EXCLUDE_PATTERNS = */Fake_Class_for_Doxygen*" \
 @BUILD_JAVA_INTERFACE_TRUE@	    >> Doxyfile.devref-configured-java-interface-html
 @BUILD_JAVA_INTERFACE_TRUE@	$(TEX_ENV) $(DOXYGEN) Doxyfile.devref-configured-java-interface-html
diff --git a/doc/README.doc b/doc/README.doc
index 9799abf..1c86a95 100644
--- a/doc/README.doc
+++ b/doc/README.doc
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 
@@ -136,7 +136,7 @@ command should be used to configure TeX system-wide).
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/doc/definitions.dox b/doc/definitions.dox
index cfb03dc..c9a459f 100644
--- a/doc/definitions.dox
+++ b/doc/definitions.dox
@@ -1,5 +1,5 @@
 // Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-// Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+// Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 //
 // This document describes the Parma Polyhedra Library (PPL).
 //
@@ -1491,9 +1491,9 @@ We can define a <EM>floating-point interval linear form</EM>
 \f$\langle\vect{\alpha}, \vect{x}\rangle
  + \beta\f$ 
 as:
-	\f[\left<\vect{\alpha}, \vect{x}\right> + \beta = 
-	\alpha_0x_0 + \ldots + 
-	\alpha_{n-1}x_{n-1} + \beta,\f]
+        \f[\left<\vect{\alpha}, \vect{x}\right> + \beta = 
+        \alpha_0x_0 + \ldots + 
+        \alpha_{n-1}x_{n-1} + \beta,\f]
 
 where \f$\beta\f$, \f$\vect{\alpha}_k \in \mathbb{I}_{\mathrm{f}}\f$ 
 for each \f$k = 0, \ldots, n - 1\f$. 
@@ -1580,10 +1580,8 @@ is the smallest NNC polyhedron containing the set
     \vect{p} \in \cP, \vect{q} \in \cQ, \lambda \in \nonnegRset
   \,\bigr\}.
 \f]
-Note that, if \f$\cP,\cQ \in \CPset_n\f$ are closed polyhedra,
-the above set is also a closed polyhedron.
-In contrast, when \f$\cQ\f$ is not topologically closed,
-the above set might not be an NNC polyhedron.
+Note that the above set might not be an NNC polyhedron.
+
 
 \subsection Meet_Preserving_Simplification Meet-Preserving Enlargement and Simplification
 
@@ -4401,7 +4399,7 @@ If \f$A\f$ is a rational \f$m \times n\f$ matrix,
                                   + \vect{z}^\transpose B, \\
           \vect{y} = (y_0, \ldots, y_{m-1})^\transpose \in \nonnegRset^{m},
           \sum_{k=0}^{m-1} y_k = 1, \\
-	  \vect{z} \in \nonnegRset^{m'}
+          \vect{z} \in \nonnegRset^{m'}
         },
 \f]
 then \f$\cQ\f$ is a rational polyhedron.
@@ -4464,7 +4462,7 @@ where \f$\xi \geq 0\f$. That is,
            (\xi \vect{x}^\transpose, \xi)^\transpose
       \mid
            \xi A\vect{x} - \xi \vect{b}
-	   \geq \vect{0}, \xi \geq 0
+           \geq \vect{0}, \xi \geq 0
       \,\}
     = \{\,\vect{x}' \mid A'\vect{x}' \geq \vect{0}\,\}
 \f]
diff --git a/doc/devref-language-interface.tex b/doc/devref-language-interface.tex
index be147d5..661feb5 100644
--- a/doc/devref-language-interface.tex
+++ b/doc/devref-language-interface.tex
@@ -1,5 +1,5 @@
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This document describes the Parma Polyhedra Library (PPL).
 %
@@ -119,7 +119,7 @@ Abramo Bagnara\thanks{abramo.bagnara at bugseng.com,
 
 \newpage
 Copyright \copyright\ 2001--2010 Roberto Bagnara (bagnara at cs.unipr.it) \\
-Copyright \copyright\ 2010--2012 BUGSENG srl (http://bugseng.com)
+Copyright \copyright\ 2010--2013 BUGSENG srl (http://bugseng.com)
 
 
 This document describes the Parma Polyhedra Library (PPL).
diff --git a/doc/devref.doxyconf-html.in b/doc/devref.doxyconf-html.in
index c3002b7..58cd081 100644
--- a/doc/devref.doxyconf-html.in
+++ b/doc/devref.doxyconf-html.in
@@ -102,10 +102,10 @@ INPUT                  = @srcdir@/definitions.dox \
                          @srcdir@/gpl.dox \
                          @srcdir@/fdl.dox
 INPUT_ENCODING         = UTF-8
-FILE_PATTERNS          = *.types.hh \
-                         *.defs.hh \
-                         *.inlines.hh \
-                         *.templates.hh \
+FILE_PATTERNS          = *_types.hh \
+                         *_defs.hh \
+                         *_inlines.hh \
+                         *_templates.hh \
                          *.cc \
                          C_Integer.hh \
                          Coefficient_traits_template.hh \
diff --git a/doc/devref.doxyconf-latex.in b/doc/devref.doxyconf-latex.in
index a2bd931..1259fd1 100644
--- a/doc/devref.doxyconf-latex.in
+++ b/doc/devref.doxyconf-latex.in
@@ -102,10 +102,10 @@ INPUT                  = @srcdir@/definitions.dox \
                          @srcdir@/gpl.dox \
                          @srcdir@/fdl.dox
 INPUT_ENCODING         = UTF-8
-FILE_PATTERNS          = *.types.hh \
-                         *.defs.hh \
-                         *.inlines.hh \
-                         *.templates.hh \
+FILE_PATTERNS          = *_types.hh \
+                         *_defs.hh \
+                         *_inlines.hh \
+                         *_templates.hh \
                          *.cc \
                          C_Integer.hh \
                          Coefficient_traits_template.hh \
diff --git a/doc/devref.tex b/doc/devref.tex
index 930bb89..fd69ac1 100644
--- a/doc/devref.tex
+++ b/doc/devref.tex
@@ -1,5 +1,5 @@
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This document describes the Parma Polyhedra Library (PPL).
 %
@@ -117,7 +117,7 @@ Abramo Bagnara\thanks{abramo.bagnara at bugseng.com,
 
 \newpage
 Copyright \copyright\ 2001--2010 Roberto Bagnara (bagnara at cs.unipr.it) \\
-Copyright \copyright\ 2010--2012 BUGSENG srl (http://bugseng.com)
+Copyright \copyright\ 2010--2013 BUGSENG srl (http://bugseng.com)
 
 
 This document describes the Parma Polyhedra Library (PPL).
diff --git a/doc/fdl.pdf b/doc/fdl.pdf
index 6fbea6c..876afc3 100644
Binary files a/doc/fdl.pdf and b/doc/fdl.pdf differ
diff --git a/doc/fdl.ps.gz b/doc/fdl.ps.gz
index 9518267..fa38f77 100644
Binary files a/doc/fdl.ps.gz and b/doc/fdl.ps.gz differ
diff --git a/doc/fdl.txt b/doc/fdl.txt
index 4a0fe1c..a988da5 100644
--- a/doc/fdl.txt
+++ b/doc/fdl.txt
@@ -1,5 +1,5 @@
-		GNU Free Documentation License
-		  Version 1.2, November 2002
+                GNU Free Documentation License
+                  Version 1.2, November 2002
 
 
  Copyright (C) 2000,2001,2002  Free Software Foundation, Inc.
diff --git a/doc/gpl.pdf b/doc/gpl.pdf
index 593c449..a205184 100644
Binary files a/doc/gpl.pdf and b/doc/gpl.pdf differ
diff --git a/doc/gpl.ps.gz b/doc/gpl.ps.gz
index 6f273f0..26ef6f5 100644
Binary files a/doc/gpl.ps.gz and b/doc/gpl.ps.gz differ
diff --git a/doc/libppl.3 b/doc/libppl.3
index 691b187..03c9c55 100644
--- a/doc/libppl.3
+++ b/doc/libppl.3
@@ -218,7 +218,7 @@ Report bugs to <ppl\-devel at cs.unipr.it>.
 
 .SH "COPYRIGHT AND NO WARRANTY"
 Copyright (C) 2001\-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010\-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010\-2013 BUGSENG srl (http://bugseng.com)
 .br
 This is free software; see the file \fBCOPYING\fR in the source
 distribution or use the command \fBppl\-config \-\-copying\fR to
diff --git a/doc/libppl_c.3 b/doc/libppl_c.3
index aa76d21..3db0351 100644
--- a/doc/libppl_c.3
+++ b/doc/libppl_c.3
@@ -154,7 +154,7 @@ Report bugs to <ppl\-devel at cs.unipr.it>.
 
 .SH "COPYRIGHT AND NO WARRANTY"
 Copyright (C) 2001\-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010\-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010\-2013 BUGSENG srl (http://bugseng.com)
 .br
 This is free software; see the file \fBCOPYING\fR in the source
 distribution or use the command \fBppl\-config \-\-copying\fR to
diff --git a/doc/ppl-config.1 b/doc/ppl-config.1
index 3c18381..d03caac 100644
--- a/doc/ppl-config.1
+++ b/doc/ppl-config.1
@@ -103,7 +103,7 @@ See the file \fBCREDITS\fR in the source distribution or use the command
 Report bugs to <ppl\-devel at cs.unipr.it>.
 .SH "COPYRIGHT AND NO WARRANTY"
 Copyright (C) 2001\-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010\-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010\-2013 BUGSENG srl (http://bugseng.com)
 .br
 This is free software; see the file \fBCOPYING\fR in the source
 distribution or use the command \fBppl\-config \-\-copying\fR to
diff --git a/doc/ppl-user-1.0-html.tar.gz b/doc/ppl-user-1.0-html.tar.gz
deleted file mode 100644
index e75ee3e..0000000
Binary files a/doc/ppl-user-1.0-html.tar.gz and /dev/null differ
diff --git a/doc/ppl-user-1.0.pdf b/doc/ppl-user-1.0.pdf
deleted file mode 100644
index e4a4e5d..0000000
--- a/doc/ppl-user-1.0.pdf
+++ /dev/null
@@ -1,147794 +0,0 @@
-%PDF-1.4
-%����
-1 0 obj
-<< /S /GoTo /D (section.1) >>
-endobj
-4 0 obj
-(\376\377\000G\000e\000n\000e\000r\000a\000l\000\040\000I\000n\000f\000o\000r\000m\000a\000t\000i\000o\000n\000\040\000o\000n\000\040\000t\000h\000e\000\040\000P\000P\000L)
-endobj
-5 0 obj
-<< /S /GoTo /D (subsection.1.1) >>
-endobj
-8 0 obj
-(\376\377\000T\000h\000e\000\040\000M\000a\000i\000n\000\040\000F\000e\000a\000t\000u\000r\000e\000s)
-endobj
-9 0 obj
-<< /S /GoTo /D (subsection.1.2) >>
-endobj
-12 0 obj
-(\376\377\000U\000p\000w\000a\000r\000d\000\040\000A\000p\000p\000r\000o\000x\000i\000m\000a\000t\000i\000o\000n)
-endobj
-13 0 obj
-<< /S /GoTo /D (subsection.1.3) >>
-endobj
-16 0 obj
-(\376\377\000A\000p\000p\000r\000o\000x\000i\000m\000a\000t\000i\000n\000g\000\040\000I\000n\000t\000e\000g\000e\000r\000s)
-endobj
-17 0 obj
-<< /S /GoTo /D (subsection.1.4) >>
-endobj
-20 0 obj
-(\376\377\000C\000o\000n\000v\000e\000x\000\040\000P\000o\000l\000y\000h\000e\000d\000r\000a)
-endobj
-21 0 obj
-<< /S /GoTo /D (subsection.1.5) >>
-endobj
-24 0 obj
-(\376\377\000R\000e\000p\000r\000e\000s\000e\000n\000t\000a\000t\000i\000o\000n\000s\000\040\000o\000f\000\040\000C\000o\000n\000v\000e\000x\000\040\000P\000o\000l\000y\000h\000e\000d\000r\000a)
-endobj
-25 0 obj
-<< /S /GoTo /D (subsection.1.6) >>
-endobj
-28 0 obj
-(\376\377\000O\000p\000e\000r\000a\000t\000i\000o\000n\000s\000\040\000o\000n\000\040\000C\000o\000n\000v\000e\000x\000\040\000P\000o\000l\000y\000h\000e\000d\000r\000a)
-endobj
-29 0 obj
-<< /S /GoTo /D (subsection.1.7) >>
-endobj
-32 0 obj
-(\376\377\000I\000n\000t\000e\000r\000v\000a\000l\000s\000\040\000a\000n\000d\000\040\000B\000o\000x\000e\000s)
-endobj
-33 0 obj
-<< /S /GoTo /D (subsection.1.8) >>
-endobj
-36 0 obj
-(\376\377\000W\000e\000a\000k\000l\000y\000-\000R\000e\000l\000a\000t\000i\000o\000n\000a\000l\000\040\000S\000h\000a\000p\000e\000s)
-endobj
-37 0 obj
-<< /S /GoTo /D (subsection.1.9) >>
-endobj
-40 0 obj
-(\376\377\000R\000a\000t\000i\000o\000n\000a\000l\000\040\000G\000r\000i\000d\000s)
-endobj
-41 0 obj
-<< /S /GoTo /D (subsection.1.10) >>
-endobj
-44 0 obj
-(\376\377\000O\000p\000e\000r\000a\000t\000i\000o\000n\000s\000\040\000o\000n\000\040\000R\000a\000t\000i\000o\000n\000a\000l\000\040\000G\000r\000i\000d\000s)
-endobj
-45 0 obj
-<< /S /GoTo /D (subsection.1.11) >>
-endobj
-48 0 obj
-(\376\377\000T\000h\000e\000\040\000P\000o\000w\000e\000r\000s\000e\000t\000\040\000C\000o\000n\000s\000t\000r\000u\000c\000t\000i\000o\000n)
-endobj
-49 0 obj
-<< /S /GoTo /D (subsection.1.12) >>
-endobj
-52 0 obj
-(\376\377\000O\000p\000e\000r\000a\000t\000i\000o\000n\000s\000\040\000o\000n\000\040\000t\000h\000e\000\040\000P\000o\000w\000e\000r\000s\000e\000t\000\040\000C\000o\000n\000s\000t\000r\000u\000c\000t\000i\000o\000n)
-endobj
-53 0 obj
-<< /S /GoTo /D (subsection.1.13) >>
-endobj
-56 0 obj
-(\376\377\000T\000h\000e\000\040\000P\000o\000i\000n\000t\000s\000e\000t\000\040\000P\000o\000w\000e\000r\000s\000e\000t\000\040\000D\000o\000m\000a\000i\000n)
-endobj
-57 0 obj
-<< /S /GoTo /D (subsection.1.14) >>
-endobj
-60 0 obj
-(\376\377\000A\000n\000a\000l\000y\000s\000i\000s\000\040\000o\000f\000\040\000f\000l\000o\000a\000t\000i\000n\000g\000\040\000p\000o\000i\000n\000t\000\040\000c\000o\000m\000p\000u\000t\000a\000t\000i\000o\000n\000s)
-endobj
-61 0 obj
-<< /S /GoTo /D (subsection.1.15) >>
-endobj
-64 0 obj
-(\376\377\000U\000s\000i\000n\000g\000\040\000t\000h\000e\000\040\000L\000i\000b\000r\000a\000r\000y)
-endobj
-65 0 obj
-<< /S /GoTo /D (subsection.1.16) >>
-endobj
-68 0 obj
-(\376\377\000B\000i\000b\000l\000i\000o\000g\000r\000a\000p\000h\000y)
-endobj
-69 0 obj
-<< /S /GoTo /D (section.2) >>
-endobj
-72 0 obj
-(\376\377\000G\000N\000U\000\040\000G\000e\000n\000e\000r\000a\000l\000\040\000P\000u\000b\000l\000i\000c\000\040\000L\000i\000c\000e\000n\000s\000e)
-endobj
-73 0 obj
-<< /S /GoTo /D (section.3) >>
-endobj
-76 0 obj
-(\376\377\000G\000N\000U\000\040\000F\000r\000e\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000L\000i\000c\000e\000n\000s\000e)
-endobj
-77 0 obj
-<< /S /GoTo /D (section.4) >>
-endobj
-80 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000\040\000I\000n\000d\000e\000x)
-endobj
-81 0 obj
-<< /S /GoTo /D (subsection.4.1) >>
-endobj
-84 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000s)
-endobj
-85 0 obj
-<< /S /GoTo /D (section.5) >>
-endobj
-88 0 obj
-(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000I\000n\000d\000e\000x)
-endobj
-89 0 obj
-<< /S /GoTo /D (subsection.5.1) >>
-endobj
-92 0 obj
-(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000L\000i\000s\000t)
-endobj
-93 0 obj
-<< /S /GoTo /D (section.6) >>
-endobj
-96 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
-endobj
-97 0 obj
-<< /S /GoTo /D (subsection.6.1) >>
-endobj
-100 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000H\000i\000e\000r\000a\000r\000c\000h\000y)
-endobj
-101 0 obj
-<< /S /GoTo /D (section.7) >>
-endobj
-104 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
-endobj
-105 0 obj
-<< /S /GoTo /D (subsection.7.1) >>
-endobj
-108 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000L\000i\000s\000t)
-endobj
-109 0 obj
-<< /S /GoTo /D (section.8) >>
-endobj
-112 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-113 0 obj
-<< /S /GoTo /D (subsection.8.1) >>
-endobj
-116 0 obj
-(\376\377\000C\000+\000+\000\040\000L\000a\000n\000g\000u\000a\000g\000e\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e)
-endobj
-117 0 obj
-<< /S /GoTo /D (section.9) >>
-endobj
-120 0 obj
-(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-121 0 obj
-<< /S /GoTo /D (subsection.9.1) >>
-endobj
-124 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000\040\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-125 0 obj
-<< /S /GoTo /D (subsection.9.2) >>
-endobj
-128 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000O\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000s\000\040\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-129 0 obj
-<< /S /GoTo /D (subsection.9.3) >>
-endobj
-132 0 obj
-(\376\377\000s\000t\000d\000\040\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-133 0 obj
-<< /S /GoTo /D (section.10) >>
-endobj
-136 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-137 0 obj
-<< /S /GoTo /D (subsection.10.1) >>
-endobj
-140 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000A\000p\000p\000r\000o\000x\000i\000m\000a\000b\000l\000e\000\137\000R\000e\000f\000e\000r\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-141 0 obj
-<< /S /GoTo /D (subsection.10.2) >>
-endobj
-144 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000A\000p\000p\000r\000o\000x\000i\000m\000a\000b\000l\000e\000\137\000R\000e\000f\000e\000r\000e\000n\000c\000e\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-145 0 obj
-<< /S /GoTo /D (subsection.10.3) >>
-endobj
-148 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000:\000:\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-149 0 obj
-<< /S /GoTo /D (subsection.10.4) >>
-endobj
-152 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000D\000\137\000S\000h\000a\000p\000e\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-153 0 obj
-<< /S /GoTo /D (subsection.10.5) >>
-endobj
-156 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000H\000R\000Z\0000\0003\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-157 0 obj
-<< /S /GoTo /D (subsection.10.6) >>
-endobj
-160 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000i\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-161 0 obj
-<< /S /GoTo /D (subsection.10.7) >>
-endobj
-164 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000i\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-165 0 obj
-<< /S /GoTo /D (subsection.10.8) >>
-endobj
-168 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000o\000x\000<\000\040\000I\000T\000V\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-169 0 obj
-<< /S /GoTo /D (subsection.10.9) >>
-endobj
-172 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-173 0 obj
-<< /S /GoTo /D (subsection.10.10) >>
-endobj
-176 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000a\000s\000t\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000>\000\040\000C\000l\0 [...]
-endobj
-177 0 obj
-<< /S /GoTo /D (subsection.10.11) >>
-endobj
-180 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000a\000s\000t\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-181 0 obj
-<< /S /GoTo /D (subsection.10.12) >>
-endobj
-184 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000a\000s\000t\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-185 0 obj
-<< /S /GoTo /D (subsection.10.13) >>
-endobj
-188 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000h\000e\000c\000k\000e\000d\000\137\000N\000u\000m\000b\000e\000r\000<\000\040\000T\000,\000\040\000P\000o\000l\000i\000c\000y\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-189 0 obj
-<< /S /GoTo /D (subsection.10.14) >>
-endobj
-192 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000H\000R\000Z\0000\0003\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-193 0 obj
-<< /S /GoTo /D (subsection.10.15) >>
-endobj
-196 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000H\0007\0009\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-197 0 obj
-<< /S /GoTo /D (subsection.10.16) >>
-endobj
-200 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-201 0 obj
-<< /S /GoTo /D (subsection.10.17) >>
-endobj
-204 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-205 0 obj
-<< /S /GoTo /D (subsection.10.18) >>
-endobj
-208 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000c\000r\000e\000t\000e\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-209 0 obj
-<< /S /GoTo /D (subsection.10.19) >>
-endobj
-212 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000c\000r\000e\000t\000e\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-213 0 obj
-<< /S /GoTo /D (subsection.10.20) >>
-endobj
-216 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000c\000r\000e\000t\000e\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000T\000y\000p\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-217 0 obj
-<< /S /GoTo /D (subsection.10.21) >>
-endobj
-220 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-221 0 obj
-<< /S /GoTo /D (subsection.10.22) >>
-endobj
-224 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-225 0 obj
-<< /S /GoTo /D (subsection.10.23) >>
-endobj
-228 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000s\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-229 0 obj
-<< /S /GoTo /D (subsection.10.24) >>
-endobj
-232 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000O\000\137\000T\000r\000e\000e\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-233 0 obj
-<< /S /GoTo /D (subsection.10.25) >>
-endobj
-236 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000I\000m\000p\000l\000<\000\040\000R\000o\000w\000\040\000>\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-237 0 obj
-<< /S /GoTo /D (subsection.10.26) >>
-endobj
-240 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-241 0 obj
-<< /S /GoTo /D (subsection.10.27) >>
-endobj
-244 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-245 0 obj
-<< /S /GoTo /D (subsection.10.28) >>
-endobj
-248 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-249 0 obj
-<< /S /GoTo /D (subsection.10.29) >>
-endobj
-252 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-253 0 obj
-<< /S /GoTo /D (subsection.10.30) >>
-endobj
-256 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000I\000n\000t\000e\000r\000f\000a\000c\000e\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000i\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000 [...]
-endobj
-257 0 obj
-<< /S /GoTo /D (subsection.10.31) >>
-endobj
-260 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000a\000n\000t\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
-endobj
-261 0 obj
-<< /S /GoTo /D (subsection.10.32) >>
-endobj
-264 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-265 0 obj
-<< /S /GoTo /D (subsection.10.33) >>
-endobj
-268 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-269 0 obj
-<< /S /GoTo /D (subsection.10.34) >>
-endobj
-272 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-273 0 obj
-<< /S /GoTo /D (subsection.10.35) >>
-endobj
-276 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000s\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-277 0 obj
-<< /S /GoTo /D (subsection.10.36) >>
-endobj
-280 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000e\000t\000e\000r\000m\000i\000n\000a\000t\000e\000<\000\040\000P\000S\000E\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-281 0 obj
-<< /S /GoTo /D (subsection.10.37) >>
-endobj
-284 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000i\000f\000f\000e\000r\000e\000n\000c\000e\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\00 [...]
-endobj
-285 0 obj
-<< /S /GoTo /D (subsection.10.38) >>
-endobj
-288 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000i\000v\000i\000s\000i\000o\000n\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
-endobj
-289 0 obj
-<< /S /GoTo /D (subsection.10.39) >>
-endobj
-292 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000o\000m\000a\000i\000n\000\137\000P\000r\000o\000d\000u\000c\000t\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-293 0 obj
-<< /S /GoTo /D (subsection.10.40) >>
-endobj
-296 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000D\000o\000u\000b\000l\000y\000\137\000L\000i\000n\000k\000e\000d\000\137\000O\000b\000j\000e\000c\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-297 0 obj
-<< /S /GoTo /D (subsection.10.41) >>
-endobj
-300 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000E\000L\000i\000s\000t\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-301 0 obj
-<< /S /GoTo /D (subsection.10.42) >>
-endobj
-304 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000E\000L\000i\000s\000t\000\137\000I\000t\000e\000r\000a\000t\000o\000r\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000 [...]
-endobj
-305 0 obj
-<< /S /GoTo /D (subsection.10.43) >>
-endobj
-308 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-309 0 obj
-<< /S /GoTo /D (subsection.10.44) >>
-endobj
-312 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-313 0 obj
-<< /S /GoTo /D (subsection.10.45) >>
-endobj
-316 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\0 [...]
-endobj
-317 0 obj
-<< /S /GoTo /D (subsection.10.46) >>
-endobj
-320 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000P\000\137\000O\000r\000a\000c\000l\000e\000<\000\040\000T\000a\000r\000g\000e\000t\000,\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-321 0 obj
-<< /S /GoTo /D (subsection.10.47) >>
-endobj
-324 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-325 0 obj
-<< /S /GoTo /D (subsection.10.48) >>
-endobj
-328 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-329 0 obj
-<< /S /GoTo /D (subsection.10.49) >>
-endobj
-332 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-333 0 obj
-<< /S /GoTo /D (subsection.10.50) >>
-endobj
-336 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000M\000P\000\137\000I\000n\000t\000e\000g\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-337 0 obj
-<< /S /GoTo /D (subsection.10.51) >>
-endobj
-340 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-341 0 obj
-<< /S /GoTo /D (subsection.10.52) >>
-endobj
-344 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-345 0 obj
-<< /S /GoTo /D (subsection.10.53) >>
-endobj
-348 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-349 0 obj
-<< /S /GoTo /D (subsection.10.54) >>
-endobj
-352 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-353 0 obj
-<< /S /GoTo /D (subsection.10.55) >>
-endobj
-356 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000H\0007\0009\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-357 0 obj
-<< /S /GoTo /D (subsection.10.56) >>
-endobj
-360 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000H\000a\000n\000d\000l\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-361 0 obj
-<< /S /GoTo /D (subsection.10.57) >>
-endobj
-364 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000H\000a\000n\000d\000l\000e\000r\000\137\000F\000l\000a\000g\000<\000\040\000F\000l\000a\000g\000\137\000B\000a\000s\000e\000,\000\040\000F\000l\000a\000g\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\ [...]
-endobj
-365 0 obj
-<< /S /GoTo /D (subsection.10.58) >>
-endobj
-368 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000H\000a\000n\000d\000l\000e\000r\000\137\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-369 0 obj
-<< /S /GoTo /D (subsection.10.59) >>
-endobj
-372 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000n\000t\000e\000g\000e\000r\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-373 0 obj
-<< /S /GoTo /D (subsection.10.60) >>
-endobj
-376 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000n\000t\000e\000g\000e\000r\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-377 0 obj
-<< /S /GoTo /D (subsection.10.61) >>
-endobj
-380 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000n\000t\000e\000r\000v\000a\000l\000<\000\040\000B\000o\000u\000n\000d\000a\000r\000y\000,\000\040\000I\000n\000f\000o\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-381 0 obj
-<< /S /GoTo /D (subsection.10.62) >>
-endobj
-384 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000O\000\137\000T\000r\000e\000e\000:\000:\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-385 0 obj
-<< /S /GoTo /D (subsection.10.63) >>
-endobj
-388 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-389 0 obj
-<< /S /GoTo /D (subsection.10.64) >>
-endobj
-392 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000F\000o\000r\000m\000<\000\040\000C\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-393 0 obj
-<< /S /GoTo /D (subsection.10.65) >>
-endobj
-396 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-397 0 obj
-<< /S /GoTo /D (subsection.10.66) >>
-endobj
-400 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000M\000u\000l\000t\000i\000p\000l\000i\000c\000a\000t\000i\000o\000n\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\00 [...]
-endobj
-401 0 obj
-<< /S /GoTo /D (subsection.10.67) >>
-endobj
-404 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000N\000N\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-405 0 obj
-<< /S /GoTo /D (subsection.10.68) >>
-endobj
-408 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000:\000:\000N\000o\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000s\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-409 0 obj
-<< /S /GoTo /D (subsection.10.69) >>
-endobj
-412 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000N\000o\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-413 0 obj
-<< /S /GoTo /D (subsection.10.70) >>
-endobj
-416 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000O\000c\000t\000a\000g\000o\000n\000a\000l\000\137\000S\000h\000a\000p\000e\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-417 0 obj
-<< /S /GoTo /D (subsection.10.71) >>
-endobj
-420 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000O\000p\000p\000o\000s\000i\000t\000e\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
-endobj
-421 0 obj
-<< /S /GoTo /D (subsection.10.72) >>
-endobj
-424 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000a\000r\000t\000i\000a\000l\000l\000y\000\137\000R\000e\000d\000u\000c\000e\000d\000\137\000P\000r\000o\000d\000u\000c\000t\000<\000\040\000D\0001\000,\000\040\000D\0002\000,\000\040\000R\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-425 0 obj
-<< /S /GoTo /D (subsection.10.73) >>
-endobj
-428 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000P\000e\000n\000d\000i\000n\000g\000\137\000E\000l\000e\000m\000e\000n\000t\000<\000\040\000T\000h\000r\000e\000s\000h\000o\000l\000d\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\0 [...]
-endobj
-429 0 obj
-<< /S /GoTo /D (subsection.10.74) >>
-endobj
-432 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000P\000e\000n\000d\000i\000n\000g\000\137\000L\000i\000s\000t\000<\000\040\000T\000r\000a\000i\000t\000s\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000 [...]
-endobj
-433 0 obj
-<< /S /GoTo /D (subsection.10.75) >>
-endobj
-436 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000D\000e\000c\000i\000s\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-437 0 obj
-<< /S /GoTo /D (subsection.10.76) >>
-endobj
-440 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-441 0 obj
-<< /S /GoTo /D (subsection.10.77) >>
-endobj
-444 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-445 0 obj
-<< /S /GoTo /D (subsection.10.78) >>
-endobj
-448 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-449 0 obj
-<< /S /GoTo /D (subsection.10.79) >>
-endobj
-452 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000<\000\040\000P\000S\000E\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-453 0 obj
-<< /S /GoTo /D (subsection.10.80) >>
-endobj
-456 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000l\000y\000\137\000C\000o\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-457 0 obj
-<< /S /GoTo /D (subsection.10.81) >>
-endobj
-460 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000l\000y\000\137\000G\000e\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-461 0 obj
-<< /S /GoTo /D (subsection.10.82) >>
-endobj
-464 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-465 0 obj
-<< /S /GoTo /D (subsection.10.83) >>
-endobj
-468 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000w\000e\000r\000s\000e\000t\000<\000\040\000D\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-469 0 obj
-<< /S /GoTo /D (subsection.10.84) >>
-endobj
-472 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000R\000e\000c\000y\000c\000l\000e\000\137\000I\000n\000p\000u\000t\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-473 0 obj
-<< /S /GoTo /D (subsection.10.85) >>
-endobj
-476 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000S\000h\000a\000p\000e\000\137\000P\000r\000e\000s\000e\000r\000v\000i\000n\000g\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-477 0 obj
-<< /S /GoTo /D (subsection.10.86) >>
-endobj
-480 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000S\000m\000a\000s\000h\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-481 0 obj
-<< /S /GoTo /D (subsection.10.87) >>
-endobj
-484 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000S\000u\000m\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000>\000\040\000C\000l\000a\0 [...]
-endobj
-485 0 obj
-<< /S /GoTo /D (subsection.10.88) >>
-endobj
-488 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000T\000h\000r\000e\000s\000h\000o\000l\000d\000\137\000W\000a\000t\000c\000h\000e\000r\000<\000\040\000T\000r\000a\000i\000t\000s\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-489 0 obj
-<< /S /GoTo /D (subsection.10.89) >>
-endobj
-492 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000T\000h\000r\000o\000w\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-493 0 obj
-<< /S /GoTo /D (subsection.10.90) >>
-endobj
-496 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000T\000i\000m\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-497 0 obj
-<< /S /GoTo /D (subsection.10.91) >>
-endobj
-500 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000U\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-501 0 obj
-<< /S /GoTo /D (subsection.10.92) >>
-endobj
-504 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000U\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-505 0 obj
-<< /S /GoTo /D (subsection.10.93) >>
-endobj
-508 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-509 0 obj
-<< /S /GoTo /D (subsection.10.94) >>
-endobj
-512 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
-endobj
-513 0 obj
-<< /S /GoTo /D (subsection.10.95) >>
-endobj
-516 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000s\000\137\000S\000e\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-517 0 obj
-<< /S /GoTo /D (subsection.10.96) >>
-endobj
-520 0 obj
-(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-521 0 obj
-<< /S /GoTo /D [522 0 R  /Fit ] >>
-endobj
-525 0 obj <<
-/Length 1354      
-/Filter /FlateDecode
->>
-stream
-x��WKs�6��W��)5!x��^�w��3�%�����d�$��P
9�
,hS�2I{�x�v���V���7�
�ӈE�
-By%"%4gQ�
�}@��y�x���3������eщ>���t�:
�=��>K��儳4��ˈ%I�$JF�H��m�1�ߩɔ�E|5Ih,
lҸ�-��n�w��L����^�����?�o�4'I��1���@�7�2?:
=
���;���;��
lf ����G
R�<�OrT�;�Ew]�2�	��
-²t�N�	دL_�1�@gOZF�`iMEBҌ��k�P���j<$W�
�{
	�r��2�B)�,J�%j��C��� 1e����q
p,��ѽ$���n�=�yFh�=b���^ļ$9/vO;@>��r���j�}����p�����e$O�.�a(���BH	��ء/��8) 	A�,��v¡��P¼x�q���N�V*�(+�o�����o]�Et�ڈe%ae�&�A���Jx���y��J��J�K�ز|^�
9	ޱ
��L
�WCW���.2���;��x!{u�$W��6�U��Zo�
�lz�����M�Kd^�UUC|D"�4�z���ȇݭQ�q��JY�,��j$*�Y��;X�I�ʸ�]�Ѝ�NC'�t�2�@�$I�`���0"�I/�ꐴ��6[����Z�B�X��O �o���d°�m��K�r
iZ	s(����;��U�:[C�x�,�z%Mu,0�OUYܸ񢜺�(���dA&��jc�d�<\���
�Ki�T
��zO~����0�.o�gs�.��L�z�Í�^���^��ce�+ ��_������9���2PN�K�1����#5�W4�zخ�̶�t�gȽUm��>T�f������.���>�d���~�Q��F�}��)�#�a�2>m�	�Y5}��~Ӻ��dz�d�b�"Kmpq����
�.�,^�"�DU��k^��YiS�;�(O9^(�?]
���>����p�pu�il�+ۿ��lX���@F���8��@������"3�˽
-Z~�0Ơ�v��G<��Tv�j{r
-�vi
2�d�`�(S�yYM��ϪɅ:�!�}����
$}W��Op<>��]��
8�2xW��ÓN�B�Ga�3Pgzi��e��et�]ȗ� ϕn�5�W�'g��H�n1��Qad=6�;�0`�9P���[�$�j�H��ٹ)��?
)�7UO6]�6n<�ھB��o����0NG#,H�
���8�_Xph��q�?��#�������0�M���i�����rx-].jI��a�f�_�^u+R������<��f�ʥ����{� ?2J����=��Q��Z����e
-���
-
w� �&
-endstream
-endobj
-522 0 obj <<
-/Type /Page
-/Contents 525 0 R
-/Resources 524 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 533 0 R
->> endobj
-523 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/ppl_logo.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 534 0 R
-/BBox [0 0 640 829]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 535 0 R
->>>>
-/Length 2688
-/Filter /FlateDecode
->>
-stream
-x�m�K�#�
D�ZEm�4	�
{�(�#�sD��'�*�>��j�V��L��ǑS9���������9����qӸל�i�Қǟ�>�u��V���)�2k�%[�׍�jk
e���<F��bȣ��u��5�ID���q�^��%�R��ˬ���|�T�4��yԮ������hYϔc�ԭ��V�»�>�������������J�k�>�si���3�4���Hݏ��{�l��V����^.&ϩ�<&;�����u��I
@����Z�KD�P���\�i����s|��R4�h}�9��艥����b\K��؆��j�ik�L���=�̸�"ؼZI��(	���%s6W���+�y�1�H')�ql�
��g���y�Qs�_7������/�;ji�y�'x���k%_�J>8{w@�wv�NQȁ�l�=("JY�s����Iy
ǹ�k�S���+���}hk�>"���Rd�'n$�4��
�įGh
�Y�ϲ����Ȭbeh&f������3(0Ϝw�9��Б ��‘�^@�A}� �T�4D�߶V�?5�$��[e��!�f�b[�l��E�4����Y4�9p��	���n<���
��9;�D4%�q�+^�kK��%��9�5��|?ĝS�Ī��@.�"�A���T�5&�%^�n59:�/H��(%�~����a	Z=�d�I��fJ+�^+�︌�B2X����#ѥ�S�����0V[-NS� �(b&�C��*�s�

��*d�K
��5ɫ�6�؄KC�hz�4��)�
�y� DF^Akz�\3W��m9�`����@�l:�MYe��B�:x6+b� h�6$sܨ��W�Z�^,����Ddx&hI���
��$�a"q���
�:��RSH�2<Z<�H�r{v%��.W次�8��?�BJ6
b�H4
,Fߎ� �Ԛ�������2��B�Z�	�.Ŋ�>@��񸵊��d�J�
�S����Q��ufG�.-�+���]��ҢxR�ِNV1�0	K��r�ہ�
��.�Q�<��͙N��*7b�_<��6���G"Cd�t�6 D�x�RkT����`; F'���́�����Gy����.C��EK�+��
(�eC�K8T�2�Q)� [...]
���B[�}��T�<��W��Z�.q[C�T"WCNҵ�e;WCk��KC�CV �E���*!��h�n�o�v������"?�1˪���롋q� vZ��K�	��.����_�6=:�+Ң�y�����
���K�4zx��
�L�ť���IoOCE
;Q6M�`]�����TD��s��E��a�,|ʙd9�Iङ��CK-���{|�׎�Aг�=GD�~W�#�J�6l=��W#,�8�$���9G�=UT�����o	���2+�S�2��Q{��u���QnU=�Qc����0Wv�b�0�����J
�QK
Ց7�4<�U��
�Sz
�j}��RdJ-��U"�
Yl���U-��q"N)����I�+�F�ۜ+����Ӽ
��M�תoÂ���l6����Q�j�q�'���}BR�
PKǧ��ѓ�%2V����,^��
j�b�K����L�N͙
�q����MW��.�P��W$������
-D���5G�\����84I���$�h<u�k�L59�0%Q��)�FX�C��ӻ�
�����
���a:׊]G'�u
��Z��B�^LE��e����Z7D�C���c�I��
U��]��iQ8s�2��*'��X�"���h6b�B��k���L2(:����I�1�s�˹�����{�uo:�k�%�.�k[��x�R�����u�
�<�����-�o�ͻ�m���

�	x���}�H�e�.��XD
�8r�D��\�%#
����k�6
%o؁zW>
 ><�ϸ�x�G���/�#�"pb:�h]�F��7��>��KHݗT��r�kwت �ӠD���Ւy��K���կ���,�G��C�Ss|��<g��uo?�������K@�
��	4�ͺ'��)�$&O:3
��.��[�G�¸���E�;{
��*����Kw�-K���T@�O���+LH�㛃��ӊwĪfgh*�� Mj�TV���F1�k
I
�?5ڮ����åےT�ѻP.d�wѩ/��"\G�
���
��G"�
�u��+��t�bg��[����pS�jeg)s_�螢bM��R
-εQo��
}� ���������@1n�M͢
���6"�-lW�Z7U���
;���mD+�|G�F��Z��@
����Q�5����(g�`R���X�6T�����.��|��6���ч��
�?��3
o���3��� m�B ��MY:c�q�P}E'�-2���
-@!S#����s����I���U$ZJZ$��\!X��P8���+�x^�|�f�:��d|?@__��h���^�a9��n]چ�*5s|Y��E���v_�#^��[�/�s͢O��
�?v�s`\�ؿ��^X{��~Ej�aW�K/Tz�
����Z���\��j�
|��>�?��a��x(~?�B�
<q����
T��5F#��
�s�B�
-����[���N��o�ِW]r�a'tܯ�_�|�"�8w�VۥDD�#��n���f���?�
�
-endstream
-endobj
-534 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100336+01'00')
-/ModDate (D:20111106100336+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-535 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-526 0 obj <<
-/D [522 0 R /XYZ 89 770.89 null]
->> endobj
-527 0 obj <<
-/D [522 0 R /XYZ 90 721.073 null]
->> endobj
-524 0 obj <<
-/Font << /F58 528 0 R /F24 529 0 R /F41 530 0 R /F42 531 0 R /F60 532 0 R >>
-/XObject << /Im1 523 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-538 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-537 0 obj <<
-/Type /Page
-/Contents 538 0 R
-/Resources 536 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 533 0 R
->> endobj
-539 0 obj <<
-/D [537 0 R /XYZ 89 770.89 null]
->> endobj
-536 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-550 0 obj <<
-/Length 1536      
-/Filter /FlateDecode
->>
-stream
-xڝWQ��8
~�W�풙%�NBH���-����r��M��C ���&���ߟd�$��wO�%Y�%}�͜�Ü����ӻ�'��;����x��a�G} ���n�}�����
��Ý��H��g��|�ʜ��;����vN(sg�����&��eUq�sN�nʽǙ�\e���"b�q�	��!��qF�i���*iq�n��J�.�~[������E��)`q<x��I��mΌma̡���l�pG����[��oz��'�{�Բ���rwb:��"$��mV��U�<�da�d����4L��4�x<r�jg;)��\ٳ�g�*��g&�{�쟘6���j��uV^7 g�
7UZ(��w1�H\�y�ȽR0pWY��E}N%I,-V�����\e�g�����
������ѡ�/#\�Oxܽ{x$�m%�T�5�S��% ���R���U���㜻���|�
b��HH

�3-�TIC�����"��-�
-�
��E� `�
;���|�"�}=��k���M+C�E3%D��@�Ep�_Qh�>ej{��Bb���
x,�Z�T��gr�Jk
F�?J�Ve��7%Z6�DFߝ{1s%R��P

wio��&��:]~{�#n�P��uC��XǪҊ0�H�b�IN����	��2?� �N�gp�鼴���TN�B����SmL���0�BC1�)����-��
���"�溎!1�K�hX���f� q�VA@���by �eZФ�/Ї��G�-��u`MY�,�B���5<B
Nd!�4��	ba�)ǰ���iM�6X�����DL
-`�X��C�@�J 
U�81�
�N�'l��v�H��bSM�BZ�K�(��������'�K�O��r`� a����逑ҁ*lx��
G

-�@h�	 ���p���a4
�_�������@b|3z���$D�$D8 ���W�Y���m�����B�(OY��la��\�+C$մ�k<��qNbÇO��q�N�Ç�'/��Bj���*��R2�K�1%9��� ����}&
-�`�~MoށA/���
ߏ矌@E��x�0�����&C&��p���;�<�
{�8�|��|�1��'��s����B���ާk�;��TҾ`T����3Ɠ�jl"��m����(M*��Y�mH�ٺ@`�̲0J�W at X�p[j
-�&�uS�6w��X��F>/�
���T�aV�2Dx;�Z
'7������+"���o��qz
��-���L�JeDn��v�y	���mX�e��Z?
id
F]
��0
gË�%ߪ��v:iv�wU��
'+�:v�[����?����椻4���9Q���y���M~��b�����W��Tuo��{��~G�o$������A�?��
�
��H���iwBo���~MͿ����C2���
vT`
�<����Tҿ,�!:�v�̓E�E-�_�Ge�&�␶>@g�dlF��n 5>��_�:]�+<
-�(�z%Q'�9?G�3����T�.}�ӵ���
	�J��X�T6�WR���_/��
-endstream
-endobj
-549 0 obj <<
-/Type /Page
-/Contents 550 0 R
-/Resources 548 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 533 0 R
-/Annots [ 540 0 R 541 0 R 542 0 R 543 0 R 553 0 R 544 0 R 546 0 R ]
->> endobj
-545 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/bugseng_logo.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 555 0 R
-/BBox [0 0 640 166]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 556 0 R
->>>>
-/Length 1662
-/Filter /FlateDecode
->>
-stream
-x�}W[�
7
��S�	��8F�
�c6���)R"��Y��Z��J$U��ʩ\Y��Ϗ�o��ۿ��|��r)�j5�hu�9��]^�<r9��m)S�M�:)��v��� j��a+%�z}
$�$�/�*i^�jjS.*s&,t���R�<+h�:��wݱ��)�Z��
i%�z-�{�
Q݆��V,�Y���W���I_���'�ԫq�"��
��'
�*���b.i��\O�>���%�h�&�Ȥ�~˄@�D���N���$�_�&a#��e�Uj�|[Q�^o��2o���îi!cZ�ף����
i����s4eW

E����݆��
�<+Z
I��P꽇�8Y�Ɨ��3����4�W)�����/r�]w��<�ʶ�q�<��~�t��
�_u)�V��Y�U�����
-����/ 8� &���Ua���j��Je��+%
-��̉�)i�U
�
�S���F_@��rG�T���HE�
nw�6[.�:�o��@r�������ЊCAT���F_�n�n��)|�d�Q��
H�i��?
�h=�8�8΍=U��UPC%Ӎ�.
��(R�ae*77=�󱁉�S�^�
-��3��j_
��
�Z�|>j�$�3�#a���>�׹2D���'N)�
�+ }��"��{�7��Aw�a���mŏ�
-FVCg��
�ԭ����)_����'�\G�^����\��1B��g��n�\ڠ�NY�
:��Yq�&�Fa�-��� B��S��f���7�G	#S���
٬7��E�� 9�D��M
-G
-�20��Ci�e�+������D�����ô b�~#����z�'�\.���F�է��]xv���i�@ I�8a�=�z[PjVkn��w|0S��t�h�m�ل֩�H�F��@0#����5�jN�1�-�R�F;p1jվ(�֙EHG´��i
�;i�`
 {��&4X��s[4�I�
d�!
޴r/^�a��@��Ƕ�?Zr�W��U��PǗ}2
��di8�ÍU���Q{?��b:���H��l�D��
�0ձ�vxk�ڱ�ʜ�

ו��^Y�"Ƃ۸���8�z��Hح�(;�����_۲h��a
�
-�e���f���hX�R�iqV`z��!��9s���}���g�z^���A�.a?�S�*To
-�W�h@�+V�C�`�x�k��a�<��]a�M�:r�#�`[�{���T�|�W��$̽�g����+�xآ%��
-$�*^*��w��+�M��M1����Q���o*Z6�P)�P�n�+T�`����jV�
-	�
-�,r ��U��W
O�qj�T�M�J�p/������5쐯�kC����u�%��u_(�@�3~Gvig\��W�A�^���j;+t,q�pLM{9i�I�s$��!w�tꡎ�+�!�HB�$���� ������d�_
d7e"�yξ��W��w$����+N�n�� 8�uXl���W(��DY6�~٭����Ȧ�<6��IJGfQ%?4�
�
��L+Bt���{1m�8�MS&L��r9=56*�Q�*�RȾ�{O�C=��P���Yb���
���h��k
9K,k�8�n#�f:Vl07�:��+��i�v,��~"[
�k�� :)��
z��U����3���b��X��?k���1�G���f��σo��?Q��B
-endstream
-endobj
-555 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100335+01'00')
-/ModDate (D:20111106100335+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-556 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-547 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/ppl_logo_no_ppl.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 557 0 R
-/BBox [0 0 640 640]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 558 0 R
->>>>
-/Length 2432
-/Filter /FlateDecode
->>
-stream
-x�m�]�$7���y��%R����
-��C��s���ʬ��6
�Z��"#�d�u�Tά������ۿ����_G>K>{���gM^ο�8�s��(�czʥ����z���-U[�%�b�
9'cYSu��ó�T�*�^���δ��i��O/<��Y�J�8�|�6�i�G����T�2
�Q��R�RNk
]ΙϞ=��ǟ\�ۡ�Z��~��(�����YZ�<k�-����5k��Z��Q����~]7���Z
F���~��f��|����B5n��1�Sֈ�g
�
k+���㨥���h}�Sd�R�6{��X7S0�>��zʤ�@�����X�k���bq��x����e��2�ݒ9O�~&3y�-�qN�\Vy�V6����׍��}�p��
FX��k�0H
m֖F�uM@��办®�M쒑Rqp,�񶖕���y���W�2��
����:9FLs9o���n�	��S(v�A'{��� �\w|Q���҆�<i=ML�ZR�%��
-�&�
/81���L�n������``^I���*��g
��l���q��Ǘ�_� ������Q�Ov��vT�p���в8>���
d��o�ўAC�+���
b�8�$=��Zs����	~�4��ɓd�7^�ۣ�� X�~�����>�v��Я*�6[�h�b��h�G2o '
L4��dV2��?�i=�kq���@�7Ye�i���
�|G`ped�m��ڵ��\*'3�	
-�V/#�0�ۜ��!0�x/uA�N��ㄵ�"3 H�W�
v"젰aC"`� 6����{	�T�g��H]~!
b��S'����Z���>���]<ˀ����'
?��M��������
q�K�ؓc<1�c�3����x�h�H/r�ђ�'�
��(
���4��-0Y�~�BJ�1L��	�
^,t�����

"��bQ�N�b�3J"�� ����B	���
�����6\�h,�0pRٖ��Ѡ= Pz=�%�B�Mޑ�>ؙ�/1��
#��@ңvR��`r+pB���{Qo`
	@���_轁D^��j�J��H���(�B�3qy_�
�����G��K�cG� ��-TlFq�4T�G08��2�
�,E�
⃝VTD�
JY��&x;w+d�H\��)SU�t�����_!ԙ�q��P��h�[z
I��f�Q�M�sTQ؜���"�Ch&,�ɮ� ������M�k���C[�}���<��N�Ӑ7�}���C<;�d��./�F\KXS�>�"�
-}W,T&w�>8�[�����
-wx�_R�O;��{U�⑨���A��Wn�_N����#b��,���n~v�7�hI�W�{�Zw�LV1'�HI(6�;�C���
JBCFU$�=z����Ԝ�� ��8 ��{S�b�wH�g�Uk"�n�)[dA4ohw�@M�z�|��Z?��v#�քD�v��V�S"�Ed��
�5���:ND
,��	��{�!���}����?>'��+�S�2����mj� ��A�U=�Zf�wH�x�d��y�J����H#��� �Ҙ�
y�NP�'
b���#�U�
�\_j���D�[���</������r뤈J�o���jQ�e
-��3��˵O�yK�b���C���C�a��!쩨.6%g�'���Ս��@�/��4qS�@
bgS}w�}-���Cw#B�ZD�k�B�,&%U4�һbܴ������!'QE��n���	�� )�rO��1
h���m@��P�&�q��S��J��Yn��PxV��S;uc��D���z�S�_b
���-�]���8,�@GC�U���$�
zٲ�4w����L�@ԁ���SQ�H&�0�tJZ�*6�?�R���A��e� �!�0nI��-���R��ʵ� ĞƮ'*اq��n/���u�!m� 
����ss
 =��-
- z�`�k�,�~�D�x�mC�`M�`�+_���x?�d�։U�uh�g}P�d�v-���q����:(��ڕ/�Ƿ�'��_�D�Q�fBc��/�fMj%�i���	%�8���U`�ԏ�a�l� 0v��s��DRn��h|�n�r��6pd�q�e�c�h�v0��Af�
���� ��jw-:��v��{�Њ$�&H��

�|��|�zL�w�zW|ׄ����_�N+��H�z)x_�{h ��\1Dz^ �Kc��!�aw�w�h
�(��.����
m��HA3À%�br�\�g�(���N�m��Ppn��
�88}�B?
-��?��"�`�����tu8��5���w\�S��i��h�R;�%{��.�L�
�
����3Lp	�rp
3Z[���&=K٣�E'h�>��o��4�	���^4�ѵlP���m�
�p#�י)ח�,�����M��ڮ5unT��7���*�G�F�Xjf%�A�H�K�;�4�ьw��
�JV��q��
<��d��������S2
�
-endstream
-endobj
-557 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100336+01'00')
-/ModDate (D:20111106100336+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-558 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-540 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [385.063 648.798 490.947 659.702]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
->> endobj
-541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 626.945 322.585 635.792]
-/A << /S /GoTo /D (GFDL_GFDL) >>
->> endobj
-542 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [231.464 595.308 337.877 606.212]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
->> endobj
-543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.112 583.353 513.996 594.257]
-/A << /S /GoTo /D (GPL_GPL) >>
->> endobj
-553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 573.455 169.87 582.302]
-/A << /S /GoTo /D (GPL_GPL) >>
->> endobj
-544 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [204.862 457.687 398.138 467.585]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
->> endobj
-546 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-551 0 obj <<
-/D [549 0 R /XYZ 89 770.89 null]
->> endobj
-548 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im2 545 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-563 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-562 0 obj <<
-/Type /Page
-/Contents 563 0 R
-/Resources 561 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 533 0 R
->> endobj
-564 0 obj <<
-/D [562 0 R /XYZ 89 770.89 null]
->> endobj
-561 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-611 0 obj <<
-/Length 1684      
-/Filter /FlateDecode
->>
-stream
-x��[[O�H~ϯ��:�2��R�V*�P�-e!�J�V�I�`5�S�i����
;���I��%<�{�|�2g<�:�9i
v[ǂ8
-(��ӽqtU�q�����
}<�9�^��t�9C��y3����k�鶾���
��̀�N���:s��Q���=46��C����_-X���P��� �	�DI�	ͥEC+�⤪t:
-i�2jw��=с��Q��tO��6fn�����f���������������Qh�\5�fb4R�:
�d�N�	ahF�b>x��|��d�*�S�v�5��U��H�ո�6_[��&?��E/���L��ηf��,��7D�&DI�(���!

oJt1w��u�$Ϙ�b)��� �6a�{
-b��
@���V"��*���@-C�,�zb��&Y�m��lNȯ�g��j
 �E�����y�-�S�?N"�f'ܘ��b�F��{Z�x#
��Tu�eP�B*Vb�?û9w�����������;z���(	/o�ɲ�k/�W�'�����h� �I�� QO��;q7/e4�5���CO���q @ȂY����4��0��N�D'Ѵ�l�@���6��L�[��d;��ĿTE�P�H��~�����z
��nA��P=e���ݛZ at _�xx����3�$�[�NR���~8�L�EA�@�W,�S�H󜎘��*.*���
y�}�x�9�ϣ�|��E�п
��0�&�m���B<�O+�&�Z�;��Ec���VN�
��1K� _����Sҥ�*�yy�*�8j#�j]D��t\�%��eX2���r���!
LG���
��� �(:��5�qw�� *��oZv�s�K
-R��~
����f�3k�3o���_m�1%�e|��
V��"�'5?�fm�������ȋ�ƞη�t[s���sB��&�F��	
�g_,�[��̮v1�Xf�e^N��~y
p��,�XR��P
-�r�E�/D�8��e�
��P����l��_�b8W{d����dr�<����$��n��Ui��t3‹�^������l&��]�
�nxJ���V�u$m�xS��k0y���c/Q�0���izg�*Ұ���]�8<L)�>�w�'�����>[L�k}��4n+��'H]�.��
����y�v6ە����\eM[*���
��q��1Bsb)3m��{��"�P\V�t�����C�,Q Y��,�6	�����N�I���
��b,z2�!��}_Z/s�T3Kc ��t�! Mw~z��	s#�{g�@F��B���QϾl⪩��{�X֔F��
m����^�;���H�����+�5�� 0!7��UwH�MrwhBy"�nI�]����,�%�1�5���ſ��tA�R�FD����(�ؒ��<����[VE�U���䈑+� �[(�&�0��F���$��&�¸�UTV����06�`.�t1��8������@�UyH6"cx�,�s��� [...]
-endstream
-endobj
-610 0 obj <<
-/Type /Page
-/Contents 611 0 R
-/Resources 609 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 533 0 R
-/Annots [ 565 0 R 566 0 R 567 0 R 568 0 R 569 0 R 570 0 R 571 0 R 572 0 R 573 0 R 574 0 R 575 0 R 576 0 R 577 0 R 578 0 R 579 0 R 580 0 R 581 0 R 582 0 R 583 0 R 584 0 R 585 0 R 586 0 R 587 0 R 588 0 R 589 0 R 590 0 R 591 0 R 592 0 R 593 0 R 594 0 R 595 0 R 596 0 R 597 0 R 598 0 R 599 0 R 600 0 R 614 0 R 601 0 R 602 0 R 603 0 R 604 0 R 605 0 R 615 0 R 606 0 R 608 0 R ]
->> endobj
-565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 687.591 244.609 696.567]
-/A << /S /GoTo /D (section.1) >>
->> endobj
-566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 675.558 214.074 684.405]
-/A << /S /GoTo /D (subsection.1.1) >>
->> endobj
-567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 661.449 234.179 672.353]
-/A << /S /GoTo /D (subsection.1.2) >>
->> endobj
-568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 649.396 234.129 660.3]
-/A << /S /GoTo /D (subsection.1.3) >>
->> endobj
-569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 637.344 212.002 648.248]
-/A << /S /GoTo /D (subsection.1.4) >>
->> endobj
-570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 625.291 288.923 636.195]
-/A << /S /GoTo /D (subsection.1.5) >>
->> endobj
-571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 613.239 270.662 624.143]
-/A << /S /GoTo /D (subsection.1.6) >>
->> endobj
-572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 603.124 217.551 612.091]
-/A << /S /GoTo /D (subsection.1.7) >>
->> endobj
-573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 589.134 243.991 600.038]
-/A << /S /GoTo /D (subsection.1.8) >>
->> endobj
-574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 579.02 197.207 587.986]
-/A << /S /GoTo /D (subsection.1.9) >>
->> endobj
-575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 565.03 255.867 575.934]
-/A << /S /GoTo /D (subsection.1.10) >>
->> endobj
-576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 555.035 247.04 563.881]
-/A << /S /GoTo /D (subsection.1.11) >>
->> endobj
-577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 540.925 302.382 551.829]
-/A << /S /GoTo /D (subsection.1.12) >>
->> endobj
-578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 530.93 262.263 539.777]
-/A << /S /GoTo /D (subsection.1.13) >>
->> endobj
-579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 516.82 296.564 527.724]
-/A << /S /GoTo /D (subsection.1.14) >>
->> endobj
-580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 504.768 209.651 515.672]
-/A << /S /GoTo /D (subsection.1.15) >>
->> endobj
-581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 492.716 191.35 503.619]
-/A << /S /GoTo /D (subsection.1.16) >>
->> endobj
-582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 472.349 229.087 481.325]
-/A << /S /GoTo /D (section.2) >>
->> endobj
-583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 449.945 252.131 458.921]
-/A << /S /GoTo /D (section.3) >>
->> endobj
-584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 427.541 165.446 436.518]
-/A << /S /GoTo /D (section.4) >>
->> endobj
-585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 415.509 173.686 424.356]
-/A << /S /GoTo /D (subsection.4.1) >>
->> endobj
-586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 391.182 180.928 402.062]
-/A << /S /GoTo /D (section.5) >>
->> endobj
-587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 378.996 202.726 389.9]
-/A << /S /GoTo /D (subsection.5.1) >>
->> endobj
-588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 358.629 155.484 367.605]
-/A << /S /GoTo /D (section.6) >>
->> endobj
-589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 344.539 202.677 355.443]
-/A << /S /GoTo /D (subsection.6.1) >>
->> endobj
-590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 324.173 155.484 333.149]
-/A << /S /GoTo /D (section.7) >>
->> endobj
-591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 312.141 178.398 320.987]
-/A << /S /GoTo /D (subsection.7.1) >>
->> endobj
-592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 289.717 206.393 298.693]
-/A << /S /GoTo /D (section.8) >>
->> endobj
-593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 275.627 236.261 286.531]
-/A << /S /GoTo /D (subsection.8.1) >>
->> endobj
-594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 253.358 221.874 264.237]
-/A << /S /GoTo /D (section.9) >>
->> endobj
-595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 241.171 335.637 252.075]
-/A << /S /GoTo /D (subsection.9.1) >>
->> endobj
-596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 229.119 395.95 240.023]
-/A << /S /GoTo /D (subsection.9.2) >>
->> endobj
-597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 217.066 241.72 227.97]
-/A << /S /GoTo /D (subsection.9.3) >>
->> endobj
-598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 196.7 196.43 205.676]
-/A << /S /GoTo /D (section.10) >>
->> endobj
-599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 182.61 419.761 193.514]
-/A << /S /GoTo /D (subsection.10.1) >>
->> endobj
-600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 170.558 513.996 181.462]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 158.603 201.053 169.506]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 146.55 467.421 157.454]
-/A << /S /GoTo /D (subsection.10.3) >>
->> endobj
-602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 134.498 426.003 145.402]
-/A << /S /GoTo /D (subsection.10.4) >>
->> endobj
-603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 122.445 399.865 133.349]
-/A << /S /GoTo /D (subsection.10.5) >>
->> endobj
-604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 110.393 384.354 121.297]
-/A << /S /GoTo /D (subsection.10.6) >>
->> endobj
-605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 98.341 513.996 109.245]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 88.443 164.809 97.289]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 74.333 409.953 85.237]
-/A << /S /GoTo /D (subsection.10.8) >>
->> endobj
-608 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-612 0 obj <<
-/D [610 0 R /XYZ 89 770.89 null]
->> endobj
-609 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-658 0 obj <<
-/Length 1935      
-/Filter /FlateDecode
->>
-stream
-x��[Yo�F~ׯ�[% Z�}E�#q�Ī��@���eZf�á���
��E���7���<�s�7�C�u=콮�j׎��
2�J�}��)n���߭��
E�O�
�#����������uz�vڮ}���=�?/��^�_��	{�p���3������8e���k�����;^�jL��s�̑��S� BrRF��$B�z�AD=���������8�/��8��^�<��
M
-����(?�
-��8
tŒ�	Iއ&ô�M����1�'�u"���e��oX7BLy'�ǥ���?�
�$t�h����<��h�8�mGg �����oYR�zz�Y�?$a��A����nh\z_4����r33$7C��EF�R�@|R@
eg���K1)���q���n(\�� 	�4�Ⱦ4��~6u��:�i*��iņ��
]>�q�
c{2F�\G�2ב3��3����/v�a��a��;2	���n�� Ҋ���܂eh�l�Z��iP\�x���LԢ)���?�[l�+{cf�j�72
-
-V��Ȭ��>�|n��[��c��[`BD"�U�QR>�I��/r��wF������
h�ɲ�̷��\�YP[/F
-Q�H�*Gn#�Wo����?�$��1� ] �a�!��^'�c')!Vcfi\�Y��
#o�ٞ
^1XWfMڰ�:�n��i�=o�!�(��hB�j��*�%�kF-gyN��*t
�8L�yj
'��>ME>7�E�
p3m� FQ��
K��� ��
��%Ծ�Ռ:�+|@1u�W5�IM�R��mc�W
�K޺�cF�5'���0�\�>kP�&��i��}{AX �J�=37.G�Ux
�pM����,v=�'$�\�Ohq�A�2pKf���ԹXF��^�3;^{.�(q.��U�p|	q��z
\�
�ďצ�ff���4ngUI\D�0���9Xt��1����� ɧ�y5L��ߊVˆK���R|
-UVO�T��!~�o\!c���8�qr�*�F-1�\���
���)Jl���:�TUJ�[0�u	�ҁz�Z��y�o�C�M���	]=�Q����n'����Z1+zp��a�bLNw[��`�Y�D~4u><f�yNy��v�+�`���(	�;x^)LYr�xP��Ϧ���|����q��l��b
��;v�`��h��\5jm6q ��P&��ޗysH���	¹ZVD�Y��ud��~��F���rm��`��Ÿ	�1eS
-s�y��_W�kJ�=h@� ��OT+$�XU�f>	A��h0��.qH
Cs{���O�E�P��;�S�E^/Rf�q�
-��DwiN
S阄
R�� 	��WI$�^��)˾
-M��+a~��+�W�&-)V�e��3�T�_�
��
Ab��VCn�ns at n��
i����U�z2�C�K
�4�vP��
��{{V�2��ې%l�:�����]��A$Y���l�4�����pozOp�`2?sy�w�k"o��NKg�\:s��)�^D���;���֍�"���ћ|ja�9�[�fv:�)��}Z��ΖHwd����F+��
i��$�FȰFB���f5�'���V��y �[5=�礇�0i���(%��rp�w櫴@Rmn@9�e�J�Ͱia��|� +Ő�K���P�
�9;��`r�K8AaU����LkRj%K�ƾX܈�5�Ȋ��+�!��$n՟U^�A�W؝�	i�e��f�RhJE�é?�2H@�Q�@��J�'Ju���z��mq���so)�@����"E���sr��ɾd�R��S�=��
g'όO
���w2��f�5a��l��ǭ\M���I֤
ߓ{��8�Z���0��!D}��w��1���A�_S��l�� 
�	�'��É�r�>O��5�X��#8�����'��ˣ����(
tQ [...]
��.�f@'ZV޿� �
-endstream
-endobj
-657 0 obj <<
-/Type /Page
-/Contents 658 0 R
-/Resources 656 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 533 0 R
-/Annots [ 607 0 R 616 0 R 660 0 R 617 0 R 618 0 R 661 0 R 619 0 R 620 0 R 621 0 R 622 0 R 623 0 R 624 0 R 625 0 R 662 0 R 626 0 R 627 0 R 628 0 R 629 0 R 663 0 R 630 0 R 631 0 R 664 0 R 632 0 R 633 0 R 634 0 R 635 0 R 636 0 R 665 0 R 637 0 R 666 0 R 638 0 R 639 0 R 640 0 R 641 0 R 642 0 R 643 0 R 667 0 R 644 0 R 668 0 R 645 0 R 646 0 R 669 0 R 647 0 R 670 0 R 648 0 R 671 0 R 649 0 R 650 0 R 672 0 R 651 0 R 673 0 R 652 0 R 674 0 R 653 0 R 655 0 R ]
->> endobj
-607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 707.957 374.411 718.861]
-/A << /S /GoTo /D (subsection.10.9) >>
->> endobj
-616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 696.002 513.996 706.906]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 684.047 284.058 694.951]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 672.092 374.949 682.996]
-/A << /S /GoTo /D (subsection.10.11) >>
->> endobj
-618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 660.136 513.996 671.04]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 650.239 157.068 659.085]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 636.226 484.782 647.13]
-/A << /S /GoTo /D (subsection.10.13) >>
->> endobj
-620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 624.271 444.139 635.175]
-/A << /S /GoTo /D (subsection.10.14) >>
->> endobj
-621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 612.316 424.761 623.22]
-/A << /S /GoTo /D (subsection.10.15) >>
->> endobj
-622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 600.361 425.867 611.265]
-/A << /S /GoTo /D (subsection.10.16) >>
->> endobj
-623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 588.405 394.316 599.309]
-/A << /S /GoTo /D (subsection.10.17) >>
->> endobj
-624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 576.45 402.067 587.354]
-/A << /S /GoTo /D (subsection.10.18) >>
->> endobj
-625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 564.495 513.996 575.399]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 554.597 179.195 563.444]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 540.585 426.725 551.489]
-/A << /S /GoTo /D (subsection.10.20) >>
->> endobj
-627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 528.63 364.987 539.534]
-/A << /S /GoTo /D (subsection.10.21) >>
->> endobj
-628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 516.674 399.307 527.578]
-/A << /S /GoTo /D (subsection.10.22) >>
->> endobj
-629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 504.719 513.996 515.623]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 494.821 157.068 503.668]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 480.809 413.892 491.713]
-/A << /S /GoTo /D (subsection.10.24) >>
->> endobj
-631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 468.854 513.996 479.758]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 458.956 164.809 467.803]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 444.943 452.427 455.847]
-/A << /S /GoTo /D (subsection.10.26) >>
->> endobj
-633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 432.988 459.63 443.892]
-/A << /S /GoTo /D (subsection.10.27) >>
->> endobj
-634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 421.033 433.628 431.937]
-/A << /S /GoTo /D (subsection.10.28) >>
->> endobj
-635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 409.078 474.564 419.982]
-/A << /S /GoTo /D (subsection.10.29) >>
->> endobj
-636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 397.123 513.996 408.027]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 387.105 179.195 396.071]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 373.212 513.996 384.116]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 361.257 294.579 372.161]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 349.302 358.361 360.206]
-/A << /S /GoTo /D (subsection.10.32) >>
->> endobj
-639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 337.347 392.682 348.251]
-/A << /S /GoTo /D (subsection.10.33) >>
->> endobj
-640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 325.392 452.447 336.296]
-/A << /S /GoTo /D (subsection.10.34) >>
->> endobj
-641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 313.437 497.404 324.34]
-/A << /S /GoTo /D (subsection.10.35) >>
->> endobj
-642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 301.481 449.245 312.385]
-/A << /S /GoTo /D (subsection.10.36) >>
->> endobj
-643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 289.526 513.996 300.43]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 277.571 300.118 288.475]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 265.616 513.996 276.52]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 253.661 294.579 264.565]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 241.706 474.152 252.609]
-/A << /S /GoTo /D (subsection.10.39) >>
->> endobj
-646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 229.75 513.996 240.654]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 219.733 164.809 228.699]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 205.84 513.996 216.744]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 195.942 164.809 204.789]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 181.93 513.996 192.834]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 169.975 201.053 180.878]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 158.019 416.493 168.923]
-/A << /S /GoTo /D (subsection.10.43) >>
->> endobj
-650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 146.064 513.996 156.968]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 134.109 201.053 145.013]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 122.154 513.996 133.058]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 110.199 252.935 121.103]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 98.244 513.996 109.147]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 88.226 164.809 97.192]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 74.333 356.678 85.237]
-/A << /S /GoTo /D (subsection.10.47) >>
->> endobj
-655 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-659 0 obj <<
-/D [657 0 R /XYZ 89 770.89 null]
->> endobj
-656 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-722 0 obj <<
-/Length 2112      
-/Filter /FlateDecode
->>
-stream
-x��[�r�H}�W�m!b(���ؘ����3�6c����	B
e�X�!z��)	qPez�w�B��Y'O��*�`���ٻ����b�AFRt��
�
�O������]�����S�	G��k�[E����ٟg�Y
�r ����O�` �
-0bF�N|����/gx�,����|����I��tsd8!���)F\7[
�h7�h��8쵓��
�a�C�9
�狋�6�i�%i��<��٢��Q8����Ѧ6��ª깂O-�U5[�7��Ƭ|S7���;nz >[`�bi�y���~O�^��g}Lׇ
R�4���&�d��v�6�l~��z<�0��f�u
-
�8ٟFw��QG6��!k~��"�~��~�]�4�~ǘ�C@���#�������El��Ü�n:��n���
L,lc>�	����K��9=�r��.�ߎ'#;�qfQ_\��Ըf��A2DŽ�`�C�L�I�q�VofA�f�;��@Ѳ�faKV�S�,/Y+x
��V���ޅS�8�Ǝa[T��^��kF3)3��+.�6nX�m�=�"�b�9�G	
�
8-Π����o�Y���g�-����Ҥ��*�sF�Vj�Qj�D��z��K4D���i�MA���}���]��zg�짰:I��
*�K͆����nTp|i1]�Z����I4�!�Q!�eu���&��M��30=e0���ȀX^�����ߑ��Hn�����B2�ҤpŨ1D�}v �t�w�,
��M)?�a|?&5#K����-��e���P*�z�ۤ�j���u�L4Rk/.��\
�%���9)�Qlôw��Ij��yw$t%���z�=��ɯI�q]����ΑsY3�A�

��qh{�D�T���
-�5��?޶{�4�<�Q��������
�r�g�,���~Q#��J� 
¥�	+�U'�8�\X���M�q���W���[eF7QB�s
-���{XW]p���G�+�[�V�{�-�1f6N����rqڇu�Ч��~�tҒm�N2�Qr�
 ��%eA��*s�;Y:�gS�1]ƣ�)�T<�
�J�[S�c��"�2Ʋ$�"���RҔ
���� ��SgqĶ�r�R��,
&1pW�)��:'�e�<��n� 	���iRP'��J΀A�PN"�~2I�P�z�
j�X���v����W�I�Qt
�2��cJD|��������Hm��ҙ��E�h�\R�
��[�q�

%�>��5�c����P7�)���ʨ��gD�O	?�6z�#�S�W]����y�{}c�m�A�g��5ui��ʢ̹r�>%>%�A
)��ޔ�b\�m��e�T[�|X*�#�o�K�CχhZ

�%'f/�$��E�
-#�Ok�Q��^[�LAX����{����_�*�E��I���+ۏ��JqWf��h1.���Q��J�~��߷ĥ�r�R/ҡ
ڛ���<6o(g�]��=���7�2�����n/���f�[�]���~y�(�(s���u��N��ŏ�ܵ4�:A�ѨdHp�
��<�������km���E���&�ƾ�/3�
�X��M]��m<*b��.MA<2�fn
�K
-D��A
-W�
AR����4�g]��;�kĩP��������n��,�����c�v�$�'TYvj�/�
��E��+�)׻�
��.�@���de���b@2�m��zr$��W޸��v�d�v*�;�p��qD".��J��²�b��Ğ
!R�
�n�j'����
-꿃��$��u��Uo]0��
-��Y��Xi�
m6�.v�
-�{�F��O[�I|-���E�ʦuСQ�䵯'%�Gߢ��vs�n4{C�p�
��яe���
?�<D,��+����=�l���g�hl}6r�8�
��8��_c���O|��Q�N8�����u�|O$�����K��Q��+�\!�ϗ*�S�n(~�
-�M!s�|
�Y8*��]
Jf!Z	�p��|�
�m[��|�����۵b�QH�yY,��lrq~�y6��x���x��v�����|��tnP?
�U/�V~8/Hi�	p�ga�-�X=.~��8?q~;f�U^���_����
-endstream
-endobj
-721 0 obj <<
-/Type /Page
-/Contents 722 0 R
-/Resources 720 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 734 0 R
-/Annots [ 654 0 R 675 0 R 676 0 R 677 0 R 678 0 R 679 0 R 680 0 R 681 0 R 682 0 R 683 0 R 724 0 R 684 0 R 725 0 R 685 0 R 686 0 R 726 0 R 687 0 R 688 0 R 689 0 R 690 0 R 691 0 R 692 0 R 727 0 R 693 0 R 694 0 R 695 0 R 696 0 R 697 0 R 728 0 R 698 0 R 729 0 R 699 0 R 730 0 R 700 0 R 731 0 R 701 0 R 702 0 R 703 0 R 704 0 R 705 0 R 706 0 R 707 0 R 708 0 R 709 0 R 710 0 R 711 0 R 732 0 R 712 0 R 713 0 R 733 0 R 714 0 R 715 0 R 716 0 R 717 0 R 719 0 R ]
->> endobj
-654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 707.957 390.998 718.861]
-/A << /S /GoTo /D (subsection.10.48) >>
->> endobj
-675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 696.002 450.764 706.906]
-/A << /S /GoTo /D (subsection.10.49) >>
->> endobj
-676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 684.047 371.482 694.951]
-/A << /S /GoTo /D (subsection.10.50) >>
->> endobj
-677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 672.092 335.109 682.996]
-/A << /S /GoTo /D (subsection.10.51) >>
->> endobj
-678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 660.136 381.594 671.04]
-/A << /S /GoTo /D (subsection.10.52) >>
->> endobj
-679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 648.181 379.92 659.085]
-/A << /S /GoTo /D (subsection.10.53) >>
->> endobj
-680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 636.226 414.241 647.13]
-/A << /S /GoTo /D (subsection.10.54) >>
->> endobj
-681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 624.271 380.488 635.175]
-/A << /S /GoTo /D (subsection.10.55) >>
->> endobj
-682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 612.316 463.257 623.22]
-/A << /S /GoTo /D (subsection.10.56) >>
->> endobj
-683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 600.361 513.996 611.265]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 588.405 252.935 599.309]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 576.45 513.996 587.354]
-/A << /S /GoTo /D (subsection.10.58) >>
->> endobj
-725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 566.552 157.068 575.399]
-/A << /S /GoTo /D (subsection.10.58) >>
->> endobj
-685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 552.54 385.32 563.444]
-/A << /S /GoTo /D (subsection.10.59) >>
->> endobj
-686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 540.585 513.996 551.489]
-/A << /S /GoTo /D (subsection.10.60) >>
->> endobj
-726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 530.687 164.809 539.534]
-/A << /S /GoTo /D (subsection.10.60) >>
->> endobj
-687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 516.674 467.706 527.578]
-/A << /S /GoTo /D (subsection.10.61) >>
->> endobj
-688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 504.719 387.88 515.623]
-/A << /S /GoTo /D (subsection.10.62) >>
->> endobj
-689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 492.764 392.104 503.668]
-/A << /S /GoTo /D (subsection.10.63) >>
->> endobj
-690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 480.809 435.816 491.713]
-/A << /S /GoTo /D (subsection.10.64) >>
->> endobj
-691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 468.854 373.305 479.758]
-/A << /S /GoTo /D (subsection.10.65) >>
->> endobj
-692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 456.899 513.996 467.803]
-/A << /S /GoTo /D (subsection.10.66) >>
->> endobj
-727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 444.943 300.118 455.847]
-/A << /S /GoTo /D (subsection.10.66) >>
->> endobj
-693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 432.988 388.797 443.892]
-/A << /S /GoTo /D (subsection.10.67) >>
->> endobj
-694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 421.033 466.853 431.937]
-/A << /S /GoTo /D (subsection.10.68) >>
->> endobj
-695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 409.078 464.19 419.982]
-/A << /S /GoTo /D (subsection.10.69) >>
->> endobj
-696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 397.123 453.111 408.027]
-/A << /S /GoTo /D (subsection.10.70) >>
->> endobj
-697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 385.168 513.996 396.071]
-/A << /S /GoTo /D (subsection.10.71) >>
->> endobj
-728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 373.212 294.579 384.116]
-/A << /S /GoTo /D (subsection.10.71) >>
->> endobj
-698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 361.257 513.996 372.161]
-/A << /S /GoTo /D (subsection.10.72) >>
->> endobj
-729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 351.359 179.195 360.206]
-/A << /S /GoTo /D (subsection.10.72) >>
->> endobj
-699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 337.347 513.996 348.251]
-/A << /S /GoTo /D (subsection.10.73) >>
->> endobj
-730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 325.392 242.696 336.296]
-/A << /S /GoTo /D (subsection.10.73) >>
->> endobj
-700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 313.437 513.996 324.34]
-/A << /S /GoTo /D (subsection.10.74) >>
->> endobj
-731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 301.481 218.617 312.385]
-/A << /S /GoTo /D (subsection.10.74) >>
->> endobj
-701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 289.526 398.202 300.43]
-/A << /S /GoTo /D (subsection.10.75) >>
->> endobj
-702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 277.571 369.988 288.475]
-/A << /S /GoTo /D (subsection.10.76) >>
->> endobj
-703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 265.616 396.558 276.52]
-/A << /S /GoTo /D (subsection.10.77) >>
->> endobj
-704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 253.661 380.688 264.565]
-/A << /S /GoTo /D (subsection.10.78) >>
->> endobj
-705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 241.706 473.364 252.609]
-/A << /S /GoTo /D (subsection.10.79) >>
->> endobj
-706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 229.75 395.452 240.654]
-/A << /S /GoTo /D (subsection.10.80) >>
->> endobj
-707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 217.795 395.442 228.699]
-/A << /S /GoTo /D (subsection.10.81) >>
->> endobj
-708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 205.84 362.785 216.744]
-/A << /S /GoTo /D (subsection.10.82) >>
->> endobj
-709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 193.885 420.214 204.789]
-/A << /S /GoTo /D (subsection.10.83) >>
->> endobj
-710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 181.93 377.011 192.834]
-/A << /S /GoTo /D (subsection.10.84) >>
->> endobj
-711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 169.975 513.996 180.878]
-/A << /S /GoTo /D (subsection.10.85) >>
->> endobj
-732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 160.077 179.195 168.923]
-/A << /S /GoTo /D (subsection.10.85) >>
->> endobj
-712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 146.064 478.585 156.968]
-/A << /S /GoTo /D (subsection.10.86) >>
->> endobj
-713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 134.109 513.996 145.013]
-/A << /S /GoTo /D (subsection.10.87) >>
->> endobj
-733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 122.154 284.058 133.058]
-/A << /S /GoTo /D (subsection.10.87) >>
->> endobj
-714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 110.199 477.967 121.103]
-/A << /S /GoTo /D (subsection.10.88) >>
->> endobj
-715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 98.244 359.657 109.147]
-/A << /S /GoTo /D (subsection.10.89) >>
->> endobj
-716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 86.288 451.849 97.192]
-/A << /S /GoTo /D (subsection.10.90) >>
->> endobj
-717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 74.333 382.132 85.237]
-/A << /S /GoTo /D (subsection.10.91) >>
->> endobj
-719 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-723 0 obj <<
-/D [721 0 R /XYZ 89 770.89 null]
->> endobj
-720 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-742 0 obj <<
-/Length 720       
-/Filter /FlateDecode
->>
-stream
-x��V�R�0}�W��L�H�.��C)�@)�Ĵ��Dq2�%u
-��%!� �L�L�dEZ�ΞݳY�bD��]`���Ck�$
-&H���B¯1��g%��s
!O��j	��ӓ��$Vg�A`��(
D+�R�⒠1l!�=��Q�8������"-��z�~�Z�����c�9R�bJ(�`�
�A�C�
i��vj�E
Ϯ�����;����M�y��i�gU �>��{�	�=�
-�Mc����\Y�O�U��vl�M
U��5��C�b7�
�e�ߊ�&�'Qi��33q딸L*� �
lh!���0���yY2�.\�S;� ��p���3�/$m��'r=�}��_��M1~q(�p:���*�`��:,!Ǜ�ȵ��>C
yH	ߙ����Q9�b��eex�k^��b�Y����S��Xr�4��ì4ō� N������>avM_�fm8mO
��*�
��$uN�!��3�U:p�Q�SU��O��h(���|��|X;b��Y�Ch�[kJ������A>r
-���B�h:��
�/�I�{��ӄdX����4�v�+,t=���&T)V�����v�w�z�}��ܹ�Ͻs��L|ȍ䵪}�9��i�i+���Y�/L���n��)ʮ��Y�
�T	6E���M�	�S����f������('����Xu�iY��z���xa����
�`�����$/0i^�ͲI� '�&�7��SJ
-endstream
-endobj
-741 0 obj <<
-/Type /Page
-/Contents 742 0 R
-/Resources 740 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 734 0 R
-/Annots [ 718 0 R 744 0 R 735 0 R 736 0 R 745 0 R 737 0 R 738 0 R 739 0 R ]
->> endobj
-718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 707.957 513.996 718.861]
-/A << /S /GoTo /D (subsection.10.92) >>
->> endobj
-744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 698.059 164.809 706.906]
-/A << /S /GoTo /D (subsection.10.92) >>
->> endobj
-735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 684.047 350.042 694.951]
-/A << /S /GoTo /D (subsection.10.93) >>
->> endobj
-736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 672.092 513.996 682.996]
-/A << /S /GoTo /D (subsection.10.94) >>
->> endobj
-745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 660.136 294.579 671.04]
-/A << /S /GoTo /D (subsection.10.94) >>
->> endobj
-737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 648.181 371.631 659.085]
-/A << /S /GoTo /D (subsection.10.95) >>
->> endobj
-738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 636.226 356.997 647.13]
-/A << /S /GoTo /D (subsection.10.96) >>
->> endobj
-739 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-743 0 obj <<
-/D [741 0 R /XYZ 89 770.89 null]
->> endobj
-740 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-757 0 obj <<
-/Length 2612      
-/Filter /FlateDecode
->>
-stream
-x��ْ�H��o��պ��؁�v����(Ke�
F=����ʬ��V0�/V�y_��Vە��>�����Y�r7O�du�Y��*�r7N`V��9��e{εld'*�<o6�A�]-�6�h��N��͛�0H�� �ܾ8�����x��Oxb7�VE}��oU���y��Ӈ�U��V7g�>�d�
b
� X~�Q|ύ��r�{ޔ� �,�3`�|� 
H�2nB�y
k���2 Af>�u
�[�P�����~��Y�MT��"7�B�GP��y��
���mu�ɲ��K��Dw��{/��	����z��ÑS���Zz��
�)�M��`0�kѨ�X��J��o3ֲS��1�j6V��&�C�"~���8�hh�����
d#�A�������oU3��R���_=�����$r}/ �[CGf�AYf��T�lz�U�p?��e1h ��(�
�
�G�c����9Xs��D��`�ù�9�
h�lk�m ��s�,8�
Ӝ�)�<����C!�2�WI���X��i�#3�_�"�yŸ����h<x
��xf����v[vڟ��V��'K� ����
��	����X���__�\2Y�w�ƀ<7��%F!"�
� �&d�0 �@�D��͌A2����X6
�;ѕwH9�ڷ�a�U��
� 
-"K�;5�X�}�
� ��ƚF5[�e����xd�E�8��)�vc&oT�V����m'��B�D�
�V�
�?4Ůk�vd����V��"��5�;�	��m�aG����
��h�^ޝ��;���Q�E
Ώ�#�
v�ݙ1"/��6F�v�6�@�Z�fX�9-
 
Dw�g�V4G�<g/�A�:Z�֕���0e*`����64��_�=`@���FD��w���ZJ�V������HɇL�A�HY2���
kݢ(�;!�@ �D��P5|��*�r��ɰ��0y
@��v��w�
O
�^����`����.{�th�n;��p��I�T�f���g%5OX�^�4GE���㵉��l�=�i
[���[���

3�
��m��	�����Q��;
������X��n'ӡ�!m�X/������:-��UY�\zm苁g
l�ǥ���J;�E��IO�
-8Y
�dcj�p���������� ^������4�'nfP�@��sY�>�dqCѤf�� v��S�)��c��
�H�w��H�i%n��&�C�J �#�t!�&���2[�_.@��x���a3���9��RQC�'�� "u�|7�N�
�O ������(��41�����t��f1
<�O��S$xB��S
Q��)��(�t��ĺb����a4�\K�	�9 at kzmc W�V��q������F,cu6��vO����[H
:�RN���p�_��N
-왃߯�4�� ��t�:5�$�0V	�j���^����^�>8[2��*(��;�Niz���4
u���)�PE�*�
Ezً�d
-�i	ɦ#��1�
��F��	�T��[V#c��2qy�_��M�[��bڱ)�w��v�z�_�:B�
�g5L�
�w�k.�Z��]�Ί�u�)��~��B��R���k��c�!��ľ?1�
-�=p.��
�]mH��q�X8s� �o<���
�l^����
-{�T��9q�`+m���)����O.ċID��:�'���)�	���{m0�[o:tv��37J�y����it�F��NZ�8>�X���N�b$[$x�<
� �������ۅ�ԛq]�2�/U�]���^(9��-'M�y�B{=����vX�X^ |K�x~�s|���B:��-m�K�'�]��X��*u^��i����cDĞ^�
��Dd��tœ`p̛��l͉I�2qC�ܵ�e�h��0?�{��0l,�~^wF
d�ז�:fQ�
-����X�\������) $
T��_ֶ�[o{.�S�8�
����~���,�ʅ��8cY*[wÎ(?����	�
���
��M����
�,�L��c�FBMA� ��o3}������/�H2�R]�O���y�m
�[��h��
c��RyD~�F��i�� �g~H����m�1�N_�i{/u������io��y
-!A�~
�B7��?�b�|99��� ��b�]�yѧ�<�Q�~���)�ONEu���;�n
�s��%�M�	���aI+�A��:�&/��� Q��6Zڭ����oe ܻ6`gN'`��d8	
�[@��ژڃ�ڈ/��c�<�ʅ�
-����򾭥��DG[�=��	҂67
�Q��O�0��3�����
F	�Q<���DmpZ�4r��2sq����9���z��K)��O��(�#P�瞂_G�O����ՏR�������vxSj����#�!�a��F0
-��U%?��by��,w�$����*^�}_ŷ�-5=R��/W����<$�S|۪iz����$��~韙�oK@��$�-��c8?o�Qu��P
��C���Dc�"X�p�9�4|��?]0
�H���Vf�/Rɑ?�\�K����㫫���e�u���/�	��
��67���ɿ���[��1�|���H��j
�O�@�������
W��p���/��1�
-endstream
-endobj
-756 0 obj <<
-/Type /Page
-/Contents 757 0 R
-/Resources 755 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 734 0 R
-/Annots [ 746 0 R 747 0 R 748 0 R 749 0 R 750 0 R 751 0 R 752 0 R 754 0 R ]
->> endobj
-746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.351 628.995 427.818 639.899]
-/A << /S /GoTo /D (index_convex_polys) >>
->> endobj
-747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.548 273.425 337.122 284.329]
-/A << /S /GoTo /D (index_use_of_library) >>
->> endobj
-748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 155.605 190.125 165.503]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 135.443 202.08 145.341]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 115.281 187.689 125.178]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 95.118 229.532 105.016]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 75.05 169.757 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-754 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2 0 obj <<
-/D [756 0 R /XYZ 90 721.073 null]
->> endobj
-759 0 obj <<
-/D [756 0 R /XYZ 90 699.812 null]
->> endobj
-760 0 obj <<
-/D [756 0 R /XYZ 90 699.812 null]
->> endobj
-6 0 obj <<
-/D [756 0 R /XYZ 90 699.812 null]
->> endobj
-761 0 obj <<
-/D [756 0 R /XYZ 159.628 264.623 null]
->> endobj
-762 0 obj <<
-/D [756 0 R /XYZ 90 247.629 null]
->> endobj
-755 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R /F32 764 0 R /F10 765 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-779 0 obj <<
-/Length 2277      
-/Filter /FlateDecode
->>
-stream
-xڭYYs��~ׯ�[�*s4��JU��*�$������R��HB-� h-���==8	Q^��1����������q�����叡�b2���^̽Џ��m�}\���<DL����o�y����-�]�[_|�0�=A�5
#/�]|��{[����Lő�d'�<_*x���ſ.�ӄ5
-�@#���
�`B����v�~9�^=85>\��@J�� n�����h�dK	;r��~eM�҂)
y+�����
Me^�Dy�ԥy�}�i�ƙ�bj�N���J��"�Gqؙ*K�9�
�"�H��n�,
H�h_�"�d+w���]�'u=��V,M2�0
��>'Iu�P��rp<QR�
��8/
-|,�fF��Y}�ZY1'C�,��9'c�b�.�Ds�5��;�UR,�5
-���𜐐��
M�����eE�X
-�8�KyO���P�m
S��ߓ��קl�<R�a��,��C��z��KrS4���RA�b`��nή0-���j����"�k�[RlI���tU�P
�
|�'o���ܮ%�2q% ��
��~��9'pF���/�NϬ���H
������]_�6��^�{pE�%��ᛖ,�]�6f�ϓ�moӖ�
E����X�
(^�2Z�f�
B������gH�Z�/���9~�bi�ۗt��ۚ9��q8p�Tr�Z����q�K0buH�%m0��
��W&=T�
IT�1
h�*w�J�V���
8�H��2΢�ѵ~4�i]����� �K)�)!j��ݔO��Y
-���!�[��L��=ss�n=#��Q��9`�3��t
rL@)���e��>vH�&�
�>��!5ۻ���Ƭ=����E{t��+*@W�5>�H
׵��O��&���s��H���c�C3���+h>��(
ZN9D�bޝ�J>'�C(�]�(w���v0ޮ�hJ
��=�����Ì
1�
��r�{T8MV:�ʽ����)i)
J��yf��ɉ:d<���ۀ�P
�u[���SԷ��
�)(s |'��P���
�
j�_�Q���R
�Qj�R�=��_�-
G�-%�FZXQ<@�+A���Q��I�nD,L�����݅#V�ֵ�
�ڟh`�����O���j�s
�X3��v��Y�E��[\p�h�m�����r=�N����m-�֓��sYխ�L�V��L|v*�
0p >
�aPr�*Lp�6���rŒ/n��rg��}��J�8���
�p�� �\МV��d�<��<,_
6�,`7��w�

��{2���h͂‹����6�ZZ�2��I7 ��c�<�43��ڢ%M�:�TƸ���a<��߲b����,* ����
-$3
 ���3BC���:��>/ϗ����G�
y2!L��s��<�	��I[�t7��0$�!�xV:p��B.�"^�B�"h���R��j�6F>�=��T ��\$6''�V>�� �c�ר��v�'qW�0�2
��+c8:a�, �nB���z�FE���
[��;��a�A���Q�O��S��*�\
G��t���!6���2{+���Z��\
']_�q_5|ȉ�:����I���
�E�P. ;��!�l�
-�a����n)t�a�Ǩ{Pi�cFb>���&!�q��~��v�B8�,
���w�
��"c���7��z����}A�h�*�񒩤�
-��]��D�S
��ž[O��.9R�ƭ���¾
�K�r�B��O$GZ�u9e��`
*��:q{��z��u[� ؘa�mb��l�Q��3��(���K���D�6�w�_W
%�pP
�p��B���4�Qw�k��sb"]YrH=�\+1�����կ�q�nn��R}������p�z���
���5p�7���땓Dh S6����!��gv���&�M�
��mb� d"]���Hg�����
�G��۔����2m��㵼�V0���S`�C)L���1C���a"�2z:�—!G�W�Xcݮ
\9�����s���{��-	��D
,g �`�.��
�һM܄YT}2m��4}�c��F�o(C��S�)����r��#	'���<Fԓ� ����
=��lb��jv$�/&#��M'���Y�~˘I�^�8���RK}�oE��>������b���~����
l׸���;�]� ��y�^`�
6|ˁ#�|0����]��OK��_�L
- @}�uwٺ��8UA �p�3��^��N�Ӈ��>@ڴ�h�c��__^n�)
XZ�N��_
nj�����&��%�&#�:�ܖ"
-endstream
-endobj
-778 0 obj <<
-/Type /Page
-/Contents 779 0 R
-/Resources 777 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 734 0 R
-/Annots [ 753 0 R 773 0 R 774 0 R 775 0 R 776 0 R ]
->> endobj
-753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 708.674 142.304 718.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.957 613.938 268.261 624.842]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 552.315 259.42 562.118]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 532.496 337.129 542.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-776 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-780 0 obj <<
-/D [778 0 R /XYZ 496.074 468.299 null]
->> endobj
-781 0 obj <<
-/D [778 0 R /XYZ 90 451.663 null]
->> endobj
-782 0 obj <<
-/D [778 0 R /XYZ 390.898 352.07 null]
->> endobj
-783 0 obj <<
-/D [778 0 R /XYZ 90 345.43 null]
->> endobj
-784 0 obj <<
-/D [778 0 R /XYZ 338.874 146.894 null]
->> endobj
-785 0 obj <<
-/D [778 0 R /XYZ 90 140.254 null]
->> endobj
-777 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F11 613 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-793 0 obj <<
-/Length 2513      
-/Filter /FlateDecode
->>
-stream
-x��Z[�۸~?�Bؗ�h�#��.I�Rdt�-�H�>$��l��je�+�9��
��(G�I[�x�ƙ�􉂛 
-�^������T9���wA
i�3�@�
>���՚GQ����Z�(�kQ5�z�*��p�V<
u�ZK��$�����p����_�8���*�f��p���((a�� b2ς[Ctb!�[��~Y#_�$�D�Q�b�)!9��Qe6w˂k��U����޶�Mw��V3$
֜��$�A��/�{P<��b��C��_4��h��Nݰ׎�.���EB�42���!�cmcy�v�����Β��6m]�h��ʱ���Pl�jk����^�k�djr�+E꽜i�w��j�
-U?h��5��JO#iv�^���7��4��<B7�M"��G�2�@G�1").�DL���"�G��OL5�e�U�8��b����y(NC[�7ն������St����x�sN:'�y��'��Ǫ
gЗ6gq6��yA�
b�{��dq�>�ϛ�Ԕ�\��5����s�W)����O�d��Q��Ŵ
�yф���9xJ>҂�v(n��y1�A�hn���h���ﰘ|�b�W9h������Ǚ̯M��SQW��9֓	S�}֛
�?�4[T�C��{�K�FR=N��m֠F�������A�L�7�g��쮐�
����.���L�������w�@��_���!{{Y0e
�a��SB=)�Y�'�A�������&�a_
�e�&4E���MkI˪�W
fd#�JY",�zW
�����*Q�
�(��n �Tj�T��Mm&m��
S��G�:L��n�`J��h�0����{MS��&L� !'�|m0i-�`�]��)��M 
MAʑd�!�ų`�W
�ɣ��*�	g"��|� [...]
g�HD�	��I6!�-b1�q�?��RE�����u�s��yC �I�GV�gۗcB����U��M
c^�Pyx�3�'��H+iA���L���[j����L�����������Ě�T�嵅l�!uCv5��$|��PW�BA;�cdV�P �e�ѻ~MHFU��JD��f�^�Rڌu
��7��\݌�GK�s(󸁽���
q��*�T�$���\΢+eJ���
�� ��KwAɒ1z��i����(A{��2�3v��<t0��F7�s2{�3��%����6<�1O�u�ؐ���~�Z�I�5�8�R�<�]q|;*�����;�f�AMO3opp\jjp	<K��
���0�m�ӠG6z����t7���t���ih�(��.�v+f:�U���3h�!��2�c3���6ʲ,�h�υ��0��T�
"�
q:8��>$j����p
C��^7DR�d4���zH���ڊ=S�2�2�
�
-]�
DpB%�9t�����T���I� iꢽ>[Ժ4e1���o��&�1/ ���Az�����j��l*w�H�o8o�K�a�w
�4�>"�����V�T@��L�����s
]�EW�$�=6�{��tlJo
�ʏ������;����d�

�	�"�ʞ����g�(rt��=���uۛ���kVqd3������^�]Ad�lh\�#ƴ���0�U�<��&�����/���a��`��I8��~˖~.�����䧁I|�L�C��2�z�V��S���=��4N�w�����?� 7���.��K19���,�Ǘ+��ko�e� W^pt���� ff�tT�5�:R�h\�&J�O��
}*�jG_�=�&��B��VA��n�2��5�3��
��I�ƛ�p�
���� ��H�:��L�Z��̋Y~�����;�YA
�w&�����t�.�)��_��v*���(��*ha������G����
��!�O�z���o��4\�4=��0���KF���M��lL�
-'X�*��z��eu� =�E����
��J��
&,2���B���+��ȸ�Q��y�/���VDt�D��������d!
-j;}�_�
� ��<�s&�O����fO
��� �Y�q1
�q'�/�'uW<�y�/3�)�j!�S�#�mь�uc�k����u3��G s��]�
 �� �_�
�����_nf) �~�_��CWo6�NGL(l���@k
�v	&U��*��r��~/�J�Rĝ�
������
zBg�EV05CVпDV0D� �h�
B��
�L��q�\?hye�U�}շ������k�Pt��N��*a�I��'5�W*o0J�4�b�U�y��
���{>eoq��o�mJ}��c��Z�f�κew�_�x����E / ۪wO���8@[����u���2�i�]>zO�}=��˿�HK�|�_w���� @��Mx�u
�G�����B����JAr�Ҝ��([���0�Eڡ D�;��		����~�2�{���)5��0
_^_oN7�� [...]
-endstream
-endobj
-792 0 obj <<
-/Type /Page
-/Contents 793 0 R
-/Resources 791 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 734 0 R
-/Annots [ 790 0 R ]
->> endobj
-790 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-796 0 obj <<
-/D [792 0 R /XYZ 90 67.689 null]
->> endobj
-791 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F8 794 0 R /F24 529 0 R /F11 613 0 R /F7 795 0 R /F93 763 0 R /F75 554 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-803 0 obj <<
-/Length 2463      
-/Filter /FlateDecode
->>
-stream
-x��ZY�7~ׯ��j�,���yK������x��N��%uҗ��<��������e�5n� H RtyX����������H�;��a���2p#��P�-?�ܻ?~Yr?$,�a�j���o?���
�?>,>-t�%��=��8[|��.w��˒
�˓�-]��7]�_�{A�$�8
�c�Zc�#�i	�D
��֌R�z+sY����֎B��dS%����u\%%v3���Ж��O��
]�
�h��<
%��������
q[U2o�G]�۲,��ֵ�t��0#SQ���{�=
���7��8K��� '���
�����`�e�>
�گ��
�h��6��&S�"ɛ���T��H+�.�I.��Ƽa�XH{��;T�n�\��H������
-F�j�G[�j���� 
��C�h�����
-u)��#�N����x�2�
?)ri�2�`F�qv�
w�X�}Qɾ~Ǽգ
�</]�m
�qa�ьD�т-�Ꮇ*�$�w� ��n�q�s�[�"o*Q7����J�z�H+)v��`AX�����I5�3Gb�q����f��w�=�����:
��I
�Sl�PDZR{�JI�� �XŨO|7��t@�CeI��is�8~7�3�D�
��4��	�I�@�8�a�E#$��󮣭�E���{�y
Z]@-���`.�
F�sV���Tm�g�L�<�s��W�N-^ɬl,��kP@����9�g�M{@07sKaU`��ְE�<���8g3�^�2-弄�Q4��Q2m�� Ki���Q?捈��L�G"�o�#8[opp!q�ЪdRo��~�
�?vF���A�_�#�.�(P�����x�h��F�!��G�C�4}��ifz��x�u��`��
 >ߒ:�Ft�Z\g
�@}[����#g�%�B�@�I^o '�AV��W������j"���
uʗ�����B�j�id�+�D�'j��:�f.	
�+Դ)�n2��#,x�}ɯ�>�z�6��m��r�,�@@�X�~�j��+�'��rB��nѬ�~&���R_%�Ko�_�,��4%>��o8~��tI�B� XC���Q�B>#*��.�����c��eAhu��y
��
-�{���5�@!U�$9����


3<��	,	�U<~Y� ��}Q�Rw�����b��[p����t�f�5����OmR����B��q��
�EelXȋ|}.�BL��&�p^�ԕ'�tN�Q�8X4��~R�"�Vqe#%��cS��q3�� ����{z��Y���,���Ͽa�A���}��f���D����"�3C>�y]df�l�V���7\Z�
�R"�g��as�k� ����g�d]�\>�fs��]�6�5�.
�x��x?�yg�|��ι��%{̧"O+1�-`q��XG��
%r&r���	�G�1�3�&����'�<F�׉�
b)JCU�> N[DqlՄ�5o�D*ݨ�6�6:6f�R`Ku:�u0�[R�E�թO2wf���n�J�65`�T�%�?�"��hb��vB{�c0@/�!�o���!C�qP�۷f�N@�Gᙚ�륀 ̒ٷy�{o�*��8�s
 �+�Q��$�4V�{�`��ߘj
�����ۤ��̏uB��ԛ}UdW]Yfٙ'�����v�b�<�`�M'G���O#q���]���]�r���`�
�B�
�[���=ƅ�T�=�:$��3��������'�y�� �)�5OpF�K�#
'A4?�(�����T�<?�m��72e=�xD<ϙM�8��
ʷcI��
B�Ri��`ܱhd/$��̳M}�U�v`�|b���^�m{�\��[{y��c걺�����
�Ю_YX��t#��}��_"��iqz9ҙ��d���ゼ�?� J���#m�L�0
| [...]
��*L������2���
����jx3�wuboDMt#�+�41�Y
Q�z�N'�I&��-��ym�N�²o�@Φ���Rв�f����˂�^`���Oυ�ҙ��g,2 ^4_s�:{����&?g�d��-�`Ynt�p
�֒Z+VB������$�n����
Tjo/�ar��7m(��Tw$�Mv���IJ�i���Ax�t�6w
�()�Q�wL�����
��~����IZ���P�9
W�c��`�˜!Ź��tLbt��$i�P��
�%���4ե�9T���q�݄���<F��j
�A@�����Z?f�"=���&��>�w}s���'oN��SK	�i� �]����t�C
�X�s�1����_p|ZP�:<����sL���_�)�XOn
��=A�������:CF\0T3���.�S��w��2w��yko����e�Qp@�o�Ki�J��w'����
��
��Ǧ)_��o�(��@*�4��'��\��ZF����.�� q�D
-endstream
-endobj
-802 0 obj <<
-/Type /Page
-/Contents 803 0 R
-/Resources 801 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 734 0 R
-/Annots [ 797 0 R 809 0 R 800 0 R ]
->> endobj
-797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.273 240.069 513.996 249.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ad326f3bec17300467f639ba345f2dd22) >>
->> endobj
-809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.828 228.114 191.619 238.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ad326f3bec17300467f639ba345f2dd22) >>
->> endobj
-800 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-804 0 obj <<
-/D [802 0 R /XYZ 90 721.073 null]
->> endobj
-805 0 obj <<
-/D [802 0 R /XYZ 292.568 600.052 null]
->> endobj
-806 0 obj <<
-/D [802 0 R /XYZ 90 583.872 null]
->> endobj
-807 0 obj <<
-/D [802 0 R /XYZ 90 557.291 null]
->> endobj
-808 0 obj <<
-/D [802 0 R /XYZ 90 538.521 null]
->> endobj
-801 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-814 0 obj <<
-/Length 2775      
-/Filter /FlateDecode
->>
-stream
-x��]s�6�ݿBo'�D0 ~��8�M���<�$
MA���T\ݯ�],@��,�i�����]����O���������ț$,	e8Y�&	�D~‚F���`b6���b�fs��/i^R��LS���z&�jfsOq8
f�-~:{�8��L 
>�7`Q<�6g��%L�4��K�Ƀ�L|�A[Ln��}����Ր;[2f^N"���/R�~9R���6�/����3?��^�6Y��U����b�l��H��v�+�
=�%�
�[�6�S�ͣ�E›̅�/0(j����G#�n^nw��-�ԩvm7YmU��yU6l at x2�|�EH%�'	��F@����X�ֻ��j4���V+jSj�I�6�hty�ӪT4�ic��js2
- *g"���$ȡv0��<�
Zoc	U�
b~���%��ˊ�M�;eq���;��'&�H|����!�g^4]�t��g>��g�ђ&L����d�v5��h�Qi�����]���)˜Y5(Cّ��̠�5��\�22�KkX�4
-�O�
-[q����dZ�&
��U^�
Mj���jWg�&�-	��+���I>E����j����̦�h0�bzSm�#�Sd�>��ʆ&�ֺB=~͗�&а�  7�B��ϼ�X�F�ڊ`���k�[�ٚ�{�g�-��j&��v at huU��
���֍
-`��ZeyC9��N�jL��E�9
��6�4^[֝�׳�/��ݞ w
��p�H
��ϵ���oyC�@Y�@
"�X�
�r��L�R[3�6�G���nߴ./G+�U�/�M��E�4y�
A< i4 �g��0=b� ځ��X5v)@���Z
���&�RjV����'��zi`�'8�@#XQKN
:dz��l�j���*q��H��U
����:�#���c��|1
O,N���q��
h�L��O	2�#
-
C��&���ք����<Qk�I
����y����fߴʠ�jg'ݲ��`��w�D�&Eb014nc��|�,i�1_�}�,�:�9
�(mUT/@����
�jۂ-f�n�����-h�1�t�v�*MB����gD���M"��KS�MڲjGX񄽲I��CЉ|E�"_>E��-S[s0
2�����#�2��~4GRo
[��t�T��T9b�Q��F3ʥ\�2#�2`	��#�(E=��.��=7I
%
I�B_r�G�g���x�#�,ɋ0���g�:�D0�P/!AQ���8��mH��"�g�Jb1������ #��Bb(0f����R<,�O
-� �u�D�x���
��~��
E��w=rG��``ݑ�%Z��\��<�o��
��ÕU}@�"`�Ӻ?�D�/�
 2%���P|\�HE�TY�{�
�x�t�m�yR�jE
-�
�ԝ�v�.M��m'�(hK��i���
�j��j��iv�լv�Vn�ȴ�L��Y�cU���.L����������)�ӽZ��y�9�]�@�V���brZ ��F��E�<N�q�	ԧɷP�n�C��â���Gܝb�ȝ?r�ғ��x1j�Bd+p�
��
��LX�&}��r�ڐ�b'g�3z����}S>6�;x\�L��}�a3�%z�1������Uu�(
�X+
�4��`�q\
AI߁�
K:�|��; ��u
��"o�J�wG�F�I��$��=�Ri�s�}s"�
���6��r*6.N�temJM�o��B�ciI�l
&�%�l�ٵ�8
-�9U/�qJ��F0$hۢ�x�P��iڢ�1�K5\���"SWy�G���:N�-cIf���B��W&��ۚ=���NQ��{l�:���q�󤋑��b����H��W��M4~ P�k_ǵ�,��X"�a
j̔L>~c�r{y�
���nbޡ�Y(�;ͻ=و1�=6�fU��}�Q�F�
Ht�=�z:�d��3
�5^\��5�/�Bt���l
�ev˫��+�4}�3�!�G�%�C;��e~���PFG
���Mjr7��ɤ^��p�]�vYew_c�
8���-[��A�7���S�+
�����E��i���	L��.���%�^
x���T�Dz��˷l�=��/�Si�
�$cfrPp]�J�y�
Җ,�h�/������npl���
0��n���б�?�{JK[�9ڿ%.�A"Փ�SF��^^N��C��a2̖�M��%HI�S���������3�
Uf��~��
-u�
-
k�{+�V�vb��
_��0
�fr �%`J��Q���(��i-
�l�J�+̨��-�-���
'f~]K�&�tnLmڍ�ZK�C�r�:NϷ�mn�
-%�!u��+���C��z}��Au,�����Շ7�?]����uf(:�����t������!�J��S9�"���U�fq}�f��?����뛷oǨ`E�g������O�1S�����[��;>.�u�����cQ��/���6�C5PS�|F��łE��b�>��I|0\�eM/���^�5uaT��*6<,�eI�����;��5

^xH8�Z>�x����� ;%
�Jğ�8�~� ��vg �e����k�#8�w����8�]P(A�ީ�
������%?b��o�����Q�?fA0m��ʝ}�D9Q�^7�-�`��b�] ��8m�����La�ߊ ��9Y��������Q�=˪���8|$�G݁�^���!/�$�6��/��
|u���H���{8�s���]h&ί6���?����
-endstream
-endobj
-813 0 obj <<
-/Type /Page
-/Contents 814 0 R
-/Resources 812 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 820 0 R
-/Annots [ 798 0 R 799 0 R 811 0 R ]
->> endobj
-798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.828 708.58 209.552 718.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae15725ff36519df514dce8b2a52c8f9e) >>
->> endobj
-799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.54 708.58 286.264 718.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af5e8cc3b25cdc1ef3e37bb82a4e8c7c8) >>
->> endobj
-811 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-815 0 obj <<
-/D [813 0 R /XYZ 89 770.89 null]
->> endobj
-816 0 obj <<
-/D [813 0 R /XYZ 90 691.846 null]
->> endobj
-817 0 obj <<
-/D [813 0 R /XYZ 90 589.061 null]
->> endobj
-818 0 obj <<
-/D [813 0 R /XYZ 90 546.051 null]
->> endobj
-819 0 obj <<
-/D [813 0 R /XYZ 90 69.588 null]
->> endobj
-812 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-826 0 obj <<
-/Length 3370      
-/Filter /FlateDecode
->>
-stream
-x��ɲ����B��U�0�u
�-e�O����vMQ%�,�.~~�����8�]N��'�F��{�
-W�U����'wϿH�*Wyb���~���4�U��l��!H�z�je�L�<�=����|���>�{s�a)\i�
�4[m�w?��v �j*�g�GB:�"c������_w�p*��/������8�`�5����_�0
��.�E{��`w�6&
�v�д�7Q�ku.����Sw��/�pr�p�6��mƔ�%PΓ�R)�s!���t,w�L��6m�>�'q�
�`ߴ���Nhl���x�x,[�5��x¯Ŷ�i[véw뺑��kΗ�/wB��U�N��Rn��� *��2�!��Z�O�k��T����;X��x� ��&��M��4r�0��m��=(��?����HY뭩��N�&b�)�Eݯ�$� ն�ҕ��-���Y�U2:�Eݑ �4"�8�c�g�TΆ�(c�9�X�D`�\���6�'�u}[m�V7\ʶ+eF�O ]�\���;#qY3�
�F��׿E��D�)��~��{�+�-W[{��l�� ���6u�W��~�.(#be��1*1f.G��$���
h7��; ͅ
�^�����΂:"]���K��]Ֆ$V�X/M��5
u-���s�&^h�汞*l�1�nAd�iA�B��0+�fQD��x.�R�'Evf��>`<l�:��DN����M�,P
��Aı�����$�;sq w��!�
C�n�{l�QI6����*��1C2��m΀�$���)0o��(��O0��@i�Q�M
q��ɼ�����
�tF��%)��j{
�A*OB��{[1�)��
h!�ѩ�����q��6��6��Z�>)I�,��
BL��R�`��	
,
-Zt�bG,�q:���� �J�K������5��$�0��'��=�%��
IԲ���s�DW���02��l�>���P
�]��{�!��[FnF�Y��H�sf"���QF�/� 3z
�3h	�M0���Hp6�)
-��#�ķ�1]
�
-�ʁLar#I��5�~92���S�i[^�A��8���1�p��
�\
�h��ٚ+

ᘶ6�I�>U����l�[�>���HP�\��H��3�aq�fL>�2�Y;
�/{�:�eB������$�'#H�h�
��"
C�Y@n/��Ϳ��q�1��X�"��7
�l|
���&�fpD�K����s>Gx[
-X��qd83GNA
v�
�Yq|]{6Vں��Ja�PS؁�˺/a� K
�巗��<��V
��,^�'s���y��נ4"�;�-8�9-!d�����ހ�!�.)�ضեoڎ�]�J�|*����i�d�!죤[�ݦ�J(��X��˩����T��[4��|��g
-��y+-*��|�x;l��T�|uoM�U�+��#U	����Q�
�(Q�c88�G�y��H�
3�"ƛ�2E%���
(4���Wɀ.^
��멵�i��i�]U\��f�iJ�~�3��U�8����ʀ�BR�FP|D�@�my;�l�G�u�TW2u! ��'
l��l�����M�-���C&�B���<ݷyX8�>T��M� ��&%އ����M;b�ݘ
�#���M�J�4�v/`��no�6��
X�k��k)�
���h�e���-�������>Z��Ji,�q�W�#����aS���Fp����(
�GG�5�$��:3�RHMl�_M���L"���
&���HF�#?
���Lq�6�P�(] p#��A=Z��W1�`���O
r��d5 �Ug� 
-����é��ѓ�.��ы�&�qS����\�����dP�'b�pS%T��i)�”�&,CGUv��f��!��o��=aj���Z,�4|kV��fF;$����h��A�/�����
ʺt�$��0�s�ג�Q
�I1q@o c�.�L�n���yI�7�?�>0пM��̞�p���vX`��_����ARC)
�,4
��
}[������a�y�b���
��)�`a0�Eu*( �2w6D��L�c8�
Y�|�D �SQ��T^$�ʷ\q�̂Mկ�F���V�(/f�Nd`�`,�OI�No� �T(��{tm�sp�=���s=�e�BeB��FjX��hʸ��T/g�zT�
DD�]���Hs�݁� ���\���¡��j�"Uڔ�+�&Jf-Ve�d�R+���ʗ��+
�������
-����4��]^CEN����@����"ICߘyQK���
��i.S6v�
V���ǫ���Y�5&�<��ny���=/�Ӫ�G�c�8=7���N�f��B���,<LF*���ar������$Y�q��ZҩM�2&�ۆ�7M�*��� �

�
�iruW�qw]x놄�$��`!�T����\e��p9l�G5��,��k�q�ݶ�=�C��r,AT
�7�Z�z��M�gR�V�K��3s��`"��� ��P�~�撔s�3x�ӂ��4S���~���LE�7�3�ܤ٢���eQD��Ӏ��-H��R���Yi\WG�|�U�Mʽ�`;gjQ���&�aa�vF�Y$܁���Bg�A� 2,��L��t~���$h���%�W��;t %i
M޴�-ljJ"��Q��_\K�������1J? �i���#{�
E��E3���Ab(��Ñ�6����½C��~{�{?7����y�`�`��Js

-`� $�
��'K�*'��5�||�=���gn�C��l����~a
-A
��
�?�;�z�NUh�k��24�C���$��5��i��4�
q���8-�M��>�T�%�ĩ��?�`��篋�'�����m�A�H1d:}p�&o�W�^P�d�t?��w�h�-f�H�(��ԕ����U�?&q-(L���Y��-�o:���cՕ�]�
�t�"m`��8�~W��w�9����פ��<
��\
�����"������+3���5�w[ڀ�PX��`m���g,��!-�
n{�U��OCIݭ
�"\
B����x���K�~8�^"���
L�s*�{��y�/�<�����*�

wZ=�s�J��������_ip0i#��4
�Ka�}!vM�p8��
-�F��z�������㯈���)
W����2���4��8=��
A`�#ĝ� ;�[UPI�J�����.���Q'����M6F�9�}��]M�Z��i����/�v�Y�Frk��
	ҿ��}2p�$"�����g������;�������P�x��M,��V��[�
G�RD�|�����
��O��#�_ş�}y���f8te}P`L��`ܜ�Ee��՞l0\9�_�Ե��
Z��P
-endstream
-endobj
-825 0 obj <<
-/Type /Page
-/Contents 826 0 R
-/Resources 824 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 820 0 R
-/Annots [ 823 0 R ]
->> endobj
-823 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-827 0 obj <<
-/D [825 0 R /XYZ 89 770.89 null]
->> endobj
-10 0 obj <<
-/D [825 0 R /XYZ 90 721.073 null]
->> endobj
-828 0 obj <<
-/D [825 0 R /XYZ 327.954 555.065 null]
->> endobj
-14 0 obj <<
-/D [825 0 R /XYZ 90 537.395 null]
->> endobj
-829 0 obj <<
-/D [825 0 R /XYZ 376.313 483.442 null]
->> endobj
-830 0 obj <<
-/D [825 0 R /XYZ 90 465.771 null]
->> endobj
-831 0 obj <<
-/D [825 0 R /XYZ 234.018 354.034 null]
->> endobj
-832 0 obj <<
-/D [825 0 R /XYZ 90 336.363 null]
->> endobj
-824 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F32 764 0 R /F10 765 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F7 795 0 R /F24 529 0 R /F1 833 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-844 0 obj <<
-/Length 3774      
-/Filter /FlateDecode
->>
-stream
-xڕٖ۶�}�Bo՜�ApO���Iݴ��q�ϩ�J�H�)R�by���@P�q�..p��R��Fm~�������hSE��͛�M�6Y\I
-o���6
�ۻP)��K���j��6T[���N'j��V�m�<
M՗�wQX��6����7{s��&�S�&d�I��������`�DE���i�������_0U��0
-�m�0
/9��y��nM��J�;s,�j����{����n��7
t�gi'��y�Ѿk��w�.�x��x��
S3���b���̟M_�u�0G'�W#/�Ì���9E�0=��
��]��#\)��E�7���-���M�oc�˦
�^ �c9�f��3��l�3�|�7>�|��T�
X4b��	�o�\8�2��0o���w_�S9�* U�¾R�;͒�g3�W�s7 g���ޅ�$YE1�Ц�H
�3>-�HN�@3a�`׉�0۔�a*F�_D{����g�mS@��;��@/�^vΕ��(�>���F �22��YB�E.��Ζ��
�� �,��� ò�+����n�zO2�����J��%B��w��Gu (���T2jû� �Cv�5{3
`'�ܫ���^ѧ�t�;
� T#�9ˮd��T�T
|�vjU�� T��tQ��P��[�[�
 �η?�!�
�S9���������"aI�e}��
�{�B�aDI�F
ʄG�,s��
�e�W�YB�
��$�"V\�+�^�: �uh�O�-,� �ނ��[C�,BV�B���@I�8�/B�,)���ӕ�}�c���\a#F�� !��n6�����*��`5\<h
%�7|ܥ2����[����k�
��s��kU�	�#�=��
hI��Ϗ����.��HG��e3oh�B�"hf��
-�g��^��@\jv?�A[�.Y�G=]q^X����YaY �78�d@�
�,�
��v���λ]=�?�C`�PZ{�;|�
b�`+V��ұ
-�8�J���C����,')^iʝiؿ���g���k��A'��/+'AZ8�Q9��5\y�_�Tj�-{=M�A�̃[��dx�N'Ӄ�n���ᆽ�ס�G ��H	�pSeAV�k�K�	�#G{�gɏ��+�%��9�g 
/+RG�{�5�Dz��j����jVX8�al�)	�J0�g�—��]���BY3�<�@�`_�i��Ṗ��y
�1�|n�A
�غ��*T
�/
)ӛ��aEhؤA�E9��0H�h��X�$G*
-�Q
-�������A
w�!���"�(�3g�?œ�)�,�$|J?�1��4w��6�$p�l9}u�4H)��
-�Xh
�Z�|�^A#�]�l�D�K��ƟZOH��1��^�,*"�ueg�
-G��_P{:~�M9pb
/��-g`EI(��0��#��@t��-&��0�^�	�G��޾�F[y�D"�5
>�V�F�Y,O7���w��a멜��d �@	P�
-����	��0�=B,<L��G���R}�{���'�0�Y�|�6R���
�����{��W����D0����!�V4c
-���!b�o{���
W��|�� "�bZJD`a�@|d����4^�VU͜����0�%򸋫WX����+�P�s�\�Q'S�P
�NC

��_b
�ʑ�$1���B܇xL�.l9
#N��4���q�;�5jLEt"
;WK#�z�]�-� �SO�L$uy�C!G��ԕ�
�ZUC�= �
V��
v� }�
�@�l�aCvxE2�@�~�.�۷Ǻ�yH�:�͘�
����(��i�@���f�
�D7�l�x��0�b=QNH
ʰ��*x�q
[�ˆ�`��y8ѓ�M\�l� �#�͠��=���Non�u[��+�t�c
�
�M���ܝ_>��ı�l1
eҖ����X����}�s?�b^#x�KsB�%�r��
�Fp���]�M��

����Q��ؖ�ԃs\�`՝ DO�g�JmLe�.H��E�X��} $w/
-ێ��{QH?��6���,\喤������ �I�KMd#y�Zh
�ﺽ*�!6���Qy;S��}wځ�H�̢ςT
z.�T�}���<��A�
-�+��O��Z�
���\����obJ�p��\B02cO};��}��|g�|��Y��a*�<��֚0�j��af��r�fq׎:I4�I���M$I�	�6������
;l�=�ݡc�.n�
��B
-w
9�I�N���r^m��C��\
��><�9q�
|��4�v�s��hW��Ĉ\��5�0����0ď����
�N��b�2�),�Y�9�&��g�$p����f]J��E�����YX�e?�.&$}�}`h�ʐ����S9�h
ӭ#X#��)V�u����&�0�
���xhc�o
Z⅞�
z]���OG
-H������
�gl�7;-�L����T_�_
�6
�
�8͞&���?��]{W�@{�C����͎�C��dʲ9+8;��3�A�B�?c��q�E���4=�
��;�l���T������u
-��z�.4�H
�ng at mIaAD�����@�o�
.��Ō������/|徢o%Y,�4~v���L��
�:iE��o�
���J��
O�E� �Ǿk
Fz��.�zXĀD��>��{�k�&*#GQJ
!e������f^�ѶrfJ�� @c��#n��׋S�U�����$�A�<��;/�G��k(��M{��#���<L�|g���„�1
-S�{S.��K�]��ߟ1��ą��u]c��0��i�I$F�Uꚇ���U
���
?$�M�c�
8��>��}1aï&J����
E�기	E\x_c��J�
�� I�H�/���e��X�y,e=*�Mĭ��ּ���
ɷz�c5
&�/q@�2ߒ�k?u�K��KBf
�Lr0���3�eL�N�K��o��ʴ�����y�k������MQ9�%�X���ɯ ����L"`�gx��_�)�zpuV�;�
Y�:}��4I9��M���a�ˮ��_�����

>���
-ɲ<��+s�e-N�
�
��@�
E�{�6���3��{Dqo�I�u���膁�w�ȫ����-j��u����y
-�W�l�A�j��DYY©1>�f(� ��z��G����+�
�`�1�%�k�-T�����Fk@y�q�K[���pK_��vyJoN~~�&����Ǧ� ��`m at yU���P�s�:�0��A~l����AXv�U)Y8S�������S>I ����E�J�F�[�q�E�.�5�-1EL�Q��Q��.%9%����O�
~��.
N'�D�r����vϬ����+����9�/�����*	[���B�+
�Ua���ʕ]0e��q9�rɯ��;�rE������\p�r�(8(��;��c\��`����V���Ja'3,��o�8���n
�g?���Z��Q�q��$H#?�p��[�q�5��!��'�$�s��𪵱��X�\��k
w%�-:'D!������=ŝ��&ho���qѳ�]���"�|�A�(�����i
o��S�ރY�Ä��'A�k�[�t�k�/����>���I�_9d���
-f���]������]�ݓ��/�`����"��w��6_������(ֺ)�����v��n�2
���s��o�AG�X��gAR��9����my���l'뾸���`2
�k
-��Nf|�;�񆾬�W	�8@����q
�߼|�����
�੭yt���GW��g��)h`�1h���0HSm9���Wa�i��Ǵh7���W�h���˕��
a��
-endstream
-endobj
-843 0 obj <<
-/Type /Page
-/Contents 844 0 R
-/Resources 842 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 820 0 R
-/Annots [ 835 0 R 836 0 R 837 0 R 838 0 R 839 0 R 840 0 R 841 0 R ]
->> endobj
-835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.728 573.012 314.05 583.916]
-/A << /S /GoTo /D (index_SK07) >>
->> endobj
-836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.144 203.018 490.683 213.922]
-/A << /S /GoTo /D (index_Dropping_Non_Integer_Points) >>
->> endobj
-837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.353 96.717 378.495 107.063]
-/A << /S /GoTo /D (index_BRZH02b) >>
->> endobj
-838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.484 96.717 415.576 107.063]
-/A << /S /GoTo /D (index_Fuk98) >>
->> endobj
-839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.565 96.717 453.752 107.063]
-/A << /S /GoTo /D (index_NW88) >>
->> endobj
-840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.618 96.717 506.753 107.063]
-/A << /S /GoTo /D (index_Wil93) >>
->> endobj
-841 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-845 0 obj <<
-/D [843 0 R /XYZ 89 770.89 null]
->> endobj
-846 0 obj <<
-/D [843 0 R /XYZ 90 625.695 null]
->> endobj
-847 0 obj <<
-/D [843 0 R /XYZ 90 625.695 null]
->> endobj
-766 0 obj <<
-/D [843 0 R /XYZ 258.486 176.592 null]
->> endobj
-18 0 obj <<
-/D [843 0 R /XYZ 90 154.208 null]
->> endobj
-848 0 obj <<
-/D [843 0 R /XYZ 508.248 99.312 null]
->> endobj
-849 0 obj <<
-/D [843 0 R /XYZ 90 77.486 null]
->> endobj
-842 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F75 554 0 R /F11 613 0 R /F24 529 0 R /F32 764 0 R /F1 833 0 R /F8 794 0 R /F7 795 0 R /F10 765 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-859 0 obj <<
-/Length 4285      
-/Filter /FlateDecode
->>
-stream
-x��\Ys��~�_�������Ǻ6)ljsz���I��<@"$!&� WV~}z. ��J
T �9����!����Ͱ�����p��ի7_+63�H*gW�3�g�$$�Z;���?��0cR#b$�������߼��h����ի_x�gĿ.�ҳ�ͫ���g+h�Lˌ�=�N��
����Wy��u����zA���	�,�c<�ۂ�yy�5�!���bI��St��l���^���7ź����7��M׺-Dr��Z��Ƴ%�q����B�|0��UY7��W��G;ț�
�+��E���� x&�QL�

-(*f
I"|��wJ��7l�
����0�#
Q��t�����U�)�j�b����R�����7a�M�vbw�=ƴ\�|���7��8T��\��6C
-�4�L�2��H�,G�����YP1(W~����O�����n�u�E�̖ 8FD�5�f��=.���Œ)2�ro�M[v�����X������ui�s���B<�|O����V�����7f��q|@��G6��݄��<�SI�l�)l�k'�;������H
gH��ԕ�A���DB�
(�
����t*zJ��禲ۊ
� �j��^���x��7֙�0���
DgV��N�:G2�$+��P4��:��(��)��
ij�U�y$�d�8/3A��*�UH�v$b��!�u��
-cd~�l�M]֝�I���f�B��{,�M��oj�#���,��&FGH���Pc��E��n��Ը�r&L�`|2�:Iټ�qiƤ�@�r|�p+u2]�K��
�b9^�D���T�S+v�?�!�q�p 8�;
�1@�͐�{'��+OH޻J+W�UZy��Ќ�/��)11 �<a�ke�D8�Dg�0���;}�]
�	<�5�5��*lu��@���߼��+@2����L#���%21�/�?U���������A�����_�]��'0��;��r
�l���i |t��\0w�9`HY0�uS�~
ץ�
8�ͪ���vWzOliԆ.����ğ<�V`�#��H� �.܉��j�ˬƔFyj��
�e����j�_nﶡ��iv+���oطNv�m�'��d�ޮJ���� "���֫��Z�vE&�|�_w�v]���w����[��+�� �쌥
-�Ft.p���A�� C��g����'ݻ]Q�ۦ���mKśr���'����|�ѫ�C'Z$�@A�CJ�/xo�?B��u V
-���i��-x�Xrs��g�5�fp����'~��i�!�O�>�x�9����gr�8aw>����s۳����)�!�&�=�n�E�]��B��.����X+��q�I
-T� �I��pBx"��hA�G�
2`/a��
wAm���٘JN�c�}+�v�TJ�n�Ȭzq %���e<Ez[�e�+t�$P�_
�d6�J"#j6���P�'�6#tK��¬3F��j�Hge���
@a�;��9V���<���1��H3�n�%[�
�#Xx��Q��� ��Y���ϛ����g6�t��or�C�th����pe�� ���Xg��
�@�4�LV�o�&0���%1���'�yf*w�9�ҧ��]>l��m�K~
�\�m��6>��>��K����\tY<i.r�\4���x��R��:.b�E�evE��>���ݹ4�[�8O������#���2�4d�uaF���{�BĶ.������ҥ����90고���v%����,2�2 ���;�O	'�a����%DQ0�!�Ί�O^��
=��³2��	��)�1j��/-��I3I/
-y*q$��0,�'㭗
��d�a�����Yg}A�G

T��"BF��%��H
-�3>E�$
����
����� �Gѓ<�/r˦�
���4��b�9��X ^i����2F�7M�B�^�]���}y�Vd#5����O��9=
!G�q�%U:�]B0����Bz�l�&�l�4`��� �b2�z^��[
-��G��H����r� �
Mi!oõKC�8�KV��?1E%zݏtH
��yR!�X�zr���2ч�
��1	����LD�6x� �
���LJ�M�F2��6�2\�}��H����=����g�	:6*O䉵 9�R0�G��
v)�en>��Ͷ�_��/KQ����4E�ɋ���~$�8"��bK
R�LS�,�tv$ ���^�J0ԅ%	U��A[j3r
-�����_��I���)G�"�)D����G,�|����b�r�|�;Sp$
�ݩC
�҃x�J
-�]����ކ��Ri���)��bI�P���a
`
}
��7
��<дgc�tH%p�p(x?�	'yo at j����
�p.e�I�>Ep�jdn ���/����P�$�Shg��E�u6���
	��Pq �+vkK�΁���r��
�&�qIf���'jL���\�!����飐Ϙ�Wz��gϲ�wR��b���$o�9��bziOԢRì�
q��x�#K3�v��Wn�_.��
��|�v���>�`�[�kݖ�
�9���x�a��h�7�;t�K�p߬K�<)5�GޛF���Ԇzv 
Nۘ$�����Op�0�ԉ�S�r��P�ևeK
�`�~�?�
P*� c"�		=$LXH�|^�
ؗ���P�h[ L����r�+.H���҂�a���E�����Ȏ
ˢCD���
f�f��:mV�D���

��Z��0�bW9D	
����@B�-	)v$�6���t�5�,"5C�7T0%˱�-=�޿�����Bb0nN�THNX��7�.�5�t�ג��i�KZ��'=�X�<d2���sꙜ�<I'��Hd�:��H�K-p�EQ��f
-�L�E��@W��
J�~8�L:Z��Ȁ�W��@
v1@�1��f�����g���XnZL&�J�'sB�ͤdW�U5|t��|��h}-�K|�V�p��d��%/rͩ����V�[��b�
���୩'�މ�C
�
��_����(j�+��I�A278or�N���H�$�'�:��N��氜�E��q!�Ȏ3I�e�p+���?M8���z��cF
�kH��CS
m�M5��r�KL�xγ�+��f	�%1�Lk
?cz"�I���#r�0��Ԩ3���~o�a�됈eF!*'emSsm�7�FE�����GNimW�sd���7�p�;������(11����Q'R� �`Be�� D?W�b$!��I�7��ݹ�Bࡦ�C��f���kSOßG
-V/���l��jЂ��YY4���
�W9cG��}���� Ldj��~
dpU�|���	���,A�H[9�ld�޷�aU<�r���tcؑ0��8���c���036̑�
�f�ڍ����-�2�ccPv>9{[���l�vg�>���Ql���[��v���&�9
Q~uw�?.��&�Y�Ϡ��^34���^�9�Ui9���uIM�DCDqV��%�=���`0`�	�:�z^ٜe���
� �,�B�U��bco��?�C8����'�i�\��Dd��.�lS�i
AZ�����lvegO<BC�۴�s�b�$�%�uL
-��!I
�
'`R`�e� �
�d_�b�v�A������T�%�_�K��]��m�����|\
��)i$w�Q�3
I��9�:b̀�i���C�d�|Z�@�i�`�E���2
�pA��
��m�k�)&�-[�O��!<{�,R�_���܇�l-ou��@��+�T����\ �/�a�l��gT��|>�5hTRR�>���������/X:����\B�u��V&�$�����q�Q۩�� �hh�,1���:�>�kK�:���	N����v�
�S��9,?�U��M[l❥���
���
v�-,1�5nC8�%�8?�H�_��(�%ur��

�QL��l�F����{�{h��������f]�w��-��ο�X,!t"4
���t�
��?ϳ��b���d
z� �m�!i[F��_������u��ӕ��.��l�8����C���~�k����vz��&|
����P�.���2����_�t���?�E�z���4�bn�G?�H���6ͮ��@���
(o���`�]�vb���%b���`��|�/��� ��,x
bϪ��Q�)p��ы
tʸ��#�
L������=�7�߰ٯln	�-���g��kظ��s����OM~��'�m[�~�"��S���:x��DNVnC�c�-~]?������b�
�����۾}��z��C ���#��	����6��^�<��ƍ3hʼ� >�)�
-endstream
-endobj
-858 0 obj <<
-/Type /Page
-/Contents 859 0 R
-/Resources 857 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 820 0 R
-/Annots [ 855 0 R 856 0 R ]
->> endobj
-855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.096 86.288 457.668 97.192]
-/A << /S /GoTo /D (index_Topologies_and_Topological_compatibility) >>
->> endobj
-856 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-860 0 obj <<
-/D [858 0 R /XYZ 89 770.89 null]
->> endobj
-864 0 obj <<
-/D [858 0 R /XYZ 506.258 542.516 null]
->> endobj
-865 0 obj <<
-/D [858 0 R /XYZ 90 525.581 null]
->> endobj
-866 0 obj <<
-/D [858 0 R /XYZ 155.86 348.917 null]
->> endobj
-867 0 obj <<
-/D [858 0 R /XYZ 90 332.316 null]
->> endobj
-857 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F32 764 0 R /F10 765 0 R /F11 613 0 R /F6 861 0 R /F24 529 0 R /F8 794 0 R /F101 862 0 R /F7 795 0 R /F13 834 0 R /F98 863 0 R /F93 763 0 R /F1 833 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-872 0 obj <<
-/Length 3725      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�[������8
�mҤ�Ǎ�郝��$8$��-���� �Iɉ3�x�X�Ź��]����ξ;���ٓo����\��\�
-:3� J�_���#j�`����v3gyVuU�-�u�t�W4k���E��%�>�ͪ;�՜Ä��Mu�)�0Le���7?�����og
Ƞ3�_���g����_��n�0�D�죛��I.ບ�>���9�4�QC
3�a�s�.��v�*��%��l�n*;bYu5�*{G)_����~�UF�
IY���K��V�G�e���٭/��8��p��m����vU/������j�Gm/r�F����AZ $`qlJy>�7�v�\f����-������쒂�l�j���R�O��Ϭ��qw��V��ޮ뗹	��^߮����]�uc)y����1$�V{����
Fg�F�N��\ D��
K%�R��5��W�e?wus��x�����
uNH
^h��IeD
F����z]5�N�p�
��'M;�n�K�pۆg������uQ5�5����jӮ��D�,7U���*��ݦ\���iY㧄+k���
XpKd��/� B��%���iw����	.6g,
g�����$*�~��'�	�z�AS\F?�5���::�4�u0c��}ۀ��ܛ�:l�L΢I^� �$d&t��� ��ń�-�7P[������!���n-�9)��yG���D�0�OA�@�O�ԙ$EJwl3`8�_~r�h

��-oz���S��ӔH	��9�B'�f�1Ü
-���g��^�,Q�4|��f�!$DqB6��'1
/
	�]$��R�
�> Ѳ�
-����"�u���)E��T0�x�D�a�(6��
´"�cl�Q�
�b�x��F�'�%(��\�l
�
B�(Ombp�g`�&�092���1_A��&{j/�_L���Ģ���i���Q?��ۍ&ZN��!+���֟"\ڇp����H���]�C���B��}H)HdJ�]�TX
�`C�9��|*�>l��B�KI
��Ғ�Hp��ԇ�&��ߟ�|��<���e���E��m��m�vb���u灅
n�,�h�jۯ�u��*��I��8�O���po�|��xGm7~lQT���p�E�-0T7�"����@�k 
�r�n�Y
/��Sn�u�����*xb��8�k(‚r_$\��Rm?Bs�[
ʂ �Y���V���X��
#��V����ކ_��\��U���������>�����}���f\hSˍrp���u�*2�v��y�
-k���,��V�_��
f}
����U�I�hU[���H��*���Q�~w8�@�$J
���%ت
	#�ZR��0"# 2J�`5��W����禶fc�.dV���ã��qH$c��"�F��.<��$9�أI. ��%s���w|)���]�@�P6���_�pM5�␴���ݶZ#��h=0�$	I*�Z��az(T�MВ�Iy.-� ����N���I7a�.!��i}$���MiKo�J)�]P)�%��Da&."=T�#f���}/�3�!�-�i�P;�w
ft��X� �`S
��FV�Ѥ�(
Qb�����
�<�c��
�ej�wr��~���45 ��}j@��àcbZD��֛,���a��xaP�`��(A��P<���	�_�A�	�aI7���#�G�3 M
"�����.h�
-���
��
-��|�(j�NC�F_H�3,�@�0ӂ�+y�
>�|����Cĺ�2u��s��QfF&kGp�-g�֟��$��Q��B,��-���>L�&��^��Xƣ4Q��8z8dG4�!�D��fY��yH*�O����PyH����T���%� 'b�o
�� ,i����c�U�3P�� ̨��h��

-4��<NS/��]
Q�o@�
�s��*�=Yc{1�
eA]u�R�_"��i�f��
-s;)+���׬�B'�j��̑����n�ք'�ܭV�#*��-ֽ2Ps
Zy�$��FO�S
-L,���$���[";�6���+��^B�c&�c��}B~ų�1%PY(Ţ.tZ�	bFp��!PP��m�E��m�$
-M��+�����z�\�N
GF��[{�a��k]�2ݲ\��5I�Bz�)��m5���݌�m�>(���*cv76i/�Q���1?��:VSc�*E�ɍƬo!
8���]�$�a�� s���l����6�a���"��
 �"OJ�X�`���1݁���3N]�W
GM�=

X�l
�L�������ɦ���e}�v�.���$���ѡy��6�A�l�
�:�
CZ�<��#�xY��Ob�
�bl_�N��a��!z��"N$`4���ؽ6=�U��^�㼷
E��!Z��A���v��y�)���z�nͲm�%��nX�=�H��.:��A����SM��(�
7���4�*3	�e�(�NG,�Ad
[m����Cu����}\
��ӧ0$�|:��,o-+ȏy
-����]in�:a�
b�
�
a�=U�/f܀��(��V���
 ���=?��vRV!LvRS�1{|��Av#�w��e8�U�N�
��*����u�F׋v{�o�ڨ7�j�
o5U؂�Qwt�;ϩ����M�
��}aC��c3$N[i�
-�g
.O���Ѓ��̡؀ZÆfl1�i(?R@$�ʅd,��Od_d�)r�P�ɑ4���
�&���FN�Xi�,7�;�w��>�L��7�TƬ�q[������+���S@!��4��4a<؃��J��~% pȊ"mhD�ƍ��xq>�w�S�*� C1O���(���d�<��5*H~O�S4!���S
��_�k^`��C�qɁ�Ըg�V���q�m��T�v>Š�$�l��աl��[t������
!���?C
���C�Q� %�L��<SH4�h7��fy�X��,��H"�<=�x ��t����Bw���������e5q3�S� �<��)�� N�{Z�]�[=�Ѯ/��NQ��A��5b�9��? �s
�O����8�kDJ�A�B����v]a�a�ts�M �Ui�9�Z��/O;ڢ��`a�\k��3W�P(�+�#݄�?�
O��𨜚���^a�V at 50:�iZ{�-$�	U:MH���ޒa�?�c�=H�"Yx�i�a3�l����
7Po1<�뗶uaL��G#"�MB��`"������O8
���P]��Ƈ���B���>��(?����iP��
!w�x�?X�P����j̾�3�/�����cï�P4�+=r��c̠�@
���Z��
k���
-�v���9�pc�n��s#
-���Q��N4�����
dF�H�
-����&$�C��!�7*TJ鋓.~V\�
m�#'��n�{�ɖ���mW���認O
��
�
M����.��h�B��^q��t��B�����z
8�A���L��/��aC�F�p�J�T�1����xS�k9���õ����M"?W����b�/'��
�.�H~I`�2�>�� I�x��^��෻�7���ѐ�ci˘�r�wW^���~�p���RY���e�+W����7ݰQ��ѱ�ث��9O�~�/���HaJ��K������'��j�	����" �F�p՟�_�n��2@��
eDk�K���%������=�n<�~-foA������!�0
-endstream
-endobj
-871 0 obj <<
-/Type /Page
-/Contents 872 0 R
-/Resources 870 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 820 0 R
-/Annots [ 869 0 R ]
->> endobj
-869 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-873 0 obj <<
-/D [871 0 R /XYZ 89 770.89 null]
->> endobj
-874 0 obj <<
-/D [871 0 R /XYZ 90 674.303 null]
->> endobj
-875 0 obj <<
-/D [871 0 R /XYZ 90 669.307 null]
->> endobj
-876 0 obj <<
-/D [871 0 R /XYZ 282.028 584.385 null]
->> endobj
-22 0 obj <<
-/D [871 0 R /XYZ 90 566.491 null]
->> endobj
-877 0 obj <<
-/D [871 0 R /XYZ 325.434 512.494 null]
->> endobj
-878 0 obj <<
-/D [871 0 R /XYZ 90 494.601 null]
->> endobj
-880 0 obj <<
-/D [871 0 R /XYZ 481.318 353.504 null]
->> endobj
-881 0 obj <<
-/D [871 0 R /XYZ 90 335.611 null]
->> endobj
-882 0 obj <<
-/D [871 0 R /XYZ 480.615 77.486 null]
->> endobj
-870 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F32 764 0 R /F10 765 0 R /F90 758 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R /F6 861 0 R /F1 833 0 R /F101 862 0 R /F8 794 0 R /F7 795 0 R /F9 879 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-886 0 obj <<
-/Length 4162      
-/Filter /FlateDecode
->>
-stream
-x��\[s�6~���[�i����N��4�vӬ7��>4}�-��T�\Qn���{p� P )�N��R

��w.4�������?.N^�RlV�BR9���x�x���O��/s�O��iƤF���#���_o/~x{��|w�����'��3�~/�ҳ���/���
�4Èz��Z�8ep]�ޟ��{R0��ܚ�'
�J	#��B�����O�o�f�~u��T��V��~[�߾+O��?��S�,�͛��Z�����dL�-(G���7�Ό~��h��+����t�$�S7��x ��V���g�i3B"��lA/�ոQ	U
-�ϢA�f�������3ws�Y=�V��A@��۪I6<[0�`Z��9��R���e!�륛����j��v[ u�"I�M�e����@aJ�;f$�vI�X�n�r���~��WK�glwF
-2sSjxލ�\�#U��w
��n�7=����n
-��g��U�`��f����W ��;z�?
-/f
I"��o�z���w`���y��j������ɣңg#(
�t햬w��vDG��ۍ���T�6�S����7�7<nx�:���T
�SaŽ%R�)QS�U��6��L<]���%9,K���F�����m<͐�0H9�"}�'�
ЉM��}�ET�r"Ȟ38K��{���V~
�;0�Y &�pD�CNX"x?���N���p���q�t�k�|��6���R�&c�2FY�(9c�ww>[V�
�S���n��3A$b��ob:$�z`_�H����N����	=Z�Ɯ腈�� �+�X0
'�ު^�C�Vi���R�%����d��c��i8�
-"�
X�[X7z�%�3�
-
6o�bL�eV-%�1&:t�`�����W���`R�LY
��
�
-�p^`y0ZOp���}/7��
_)�j0��t ��:0
)Mi��lb�[*�C+�Kٹ�m�Ў8|Α|�����R��
�
̫b
"1��曫���j���a�
;�ЂGV[h��I�w��SAJ1�� ����g��������S���p;�\!bIr�Xz�4�w�}U{�]�M���&\2�ʨ��w۪m+?A�'��
-��;;`G����GR�}�Y_�M��3�āGm�2}�� %������n�I���������#�ܩR
�-
!i
��*3��=�EƼ��9��iY;[��
�B)A
脡\$1�����
%���9�ٹ�b]�
B,n. �ۃ3%�!��`��z����N���^����\��íl�W���m�zW�Rщ��+"�+���W��^��4F�rV�@�_Ej, �~��d��@�h�
-3n�>j9z�r�����
ɘ\�Ɏ7�����`�@��T�y�DžzD�� (b 9|�	��ɓ4v��Y�Un-�P<
-t��
?]� �G�.
$�S4%a
`aN���.�pol��$B��I��!�3P�M"�z
�a��
�D4���5����u�v�[
����͍{t��7�.3
O[����)n� �Cg3

-�C�CM[/��,���G�U/�Ԗ� 'M܎\$�$�{q
��"BTȈs�]5ն4D2���w�q at U�s���D��խq�ܧ���,8�8F���<�$�����HR�$���澁`�g�w���
�v�n�>U⇵�CX�n�6���#*���l����PA�(f�	J��Jrқ,I �0���q`%�L�z�l��t�G)��=�7�&�+xԳ��Q ���c��*��
���߭���K������
�"�c�1f$w�{�|
-'��B����a�� ;N��PYvA��ä�W;ڲ
�#�0J� �wc얱
-�tR���u�Ӏ�C�x��z�V��Y6���m_մ{{X�j
�@��r]$
gl�A
.�9E�
5ͯ��H
�=�c�_���?
`�M.����R��_�
8��*G�)�~
-�
N�X��&K ���"|V
-�	����EJ�CZ��Q���D�ʖ
zr��������$�喇k�_���D�U�[����(��@���o��B�;3p��Y"-m�c�>��__��g��*v� ��N�GԳ�W&
�%;�-K{e��A*��x
S�	�Xa8Ѹ�l\m����
���t�Ń���(�>�<��#\�|:- at X��8§3�}� �K�|:�*�&��r
|3)�G��]u���/C�t��G�]��?;�)
��O����1�yI�o٠S�
-����Ӄ��BM:b��ۨw�f����ow�3��
��r�s"&
1�S�4R�m�\Unݏ������|ԓ���@ko%������j�{����䳸`��.���xJ�,R����Ԕ��<+��9b{�&�~����/İ�
�����o�b(d93�Uշ���y#W2�R��f���L&�@&�ql�PW��D��~�{�Wf��ZА�=\�?
��V
�&��K;��N�o�I�1�piQX"Φ� � AxF���� ����1#�̛c`ք9fbjL5���F`L���=��b����B�<� �\M���H�i�:�~�n2�,X�-$K��
�A���(8!���Jk��m��
x�Ю��h����N�b��F���Y�n7�7�9!0�����%ň�*@q�i��n��
��%=(�G�!�
��ByH�(�H
-S�ʸ�jT�	��z\끱��"=��R�r[[Y�)lJ
-�qP��Ovg	��Y
-*�b��D
-�Wd�I{e�v���(%��dm���ja����c<�����ݕ����}
)�(W׋���h�u�K�L ��D�ʶ�T�4�. ���[��6�Ҧܩ�>wՅ� ����ߛ��n[�?S�. at wB'�C�
-�$]e�owF���c��qj#|.Y�s����ƺ
Ŏ~0���2yI5����K����|Q_�'{>:���
��5l�M���fC/Ł�2��ͩ��X�X$�m7,:	>��U
�8�I��/2��d�@*4vĊ����r�
- n�t��p�mZ�S�U�#�
�����H�d�y��BOJdq
#ɳ1R!��F�#Iz��9�P;O
;� z5�
K���ہ�p0�
�¤���;������ 퓏6���y���U~��Nڙ���k�<�HSo
���>$͆�2��$��q�f��I!�i`�Aw���0�m���<�*�X��Nj��T�
��5i�k�?�M���w���j�+I?��+ӵ&tZ�`8�H�x�od
���[k�`ݽE�'J��6���[�|��1�9��*D���2��
-��[��Ln��䞎�;�j��bH�qm��E�+��]�Y��_������d�}o@��ȩ��G>aǸ�i��1��w���\��V�H�3�o�r�����%
"�
#iB`�:���!�e
-���!����l���
�+M�jJS\��H�����W �+
Pn����5�1�Y0M�<�W�2J���m�e���80w��(o��v瞗�i$P��Hx�Q�@yy",a�ɯD�
-�\�\��4�[�8�FO�~��*�h���X)����K�ᄄZ��S�秤�ө<�R�	n������4^��A�
-o���f`���`�I鉤Hb>"����� ;�7m��S�Մ
���\�i������9���#�2iPn�
.�i�
��b�r at w@O����I�y(�^��G�=�>h���LT�e�
u�
��(q���/7���j�����e�^m�#6�f�/P�F�.�"�To\3��p]ZB/��
������\��	H3����y*�
���i`@����ic9���)1f	��ԽE�i��֌��68I��5����*�W*}_��b�
��
-��`	�`� �/#9��to
�t�˗��<
�"��
�p:�7K�
�;��P��8E�:�&��� �L�0!>���3�����(����v���u�W�/	��yg���X�����'��W����'��B���*�w��([ԃ���~���?x���^n`�0��[�	�P��jت�N����	~�/��|���w����f?��}��
���RD�X
	®a�v㾯*�*G�o{��i�Ռ��
����nw�����7m�ܠ�����C�e���G�7]�n���&P�����f
-endstream
-endobj
-885 0 obj <<
-/Type /Page
-/Contents 886 0 R
-/Resources 884 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 820 0 R
-/Annots [ 883 0 R ]
->> endobj
-883 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-887 0 obj <<
-/D [885 0 R /XYZ 89 770.89 null]
->> endobj
-888 0 obj <<
-/D [885 0 R /XYZ 90 721.073 null]
->> endobj
-889 0 obj <<
-/D [885 0 R /XYZ 213.944 517.221 null]
->> endobj
-890 0 obj <<
-/D [885 0 R /XYZ 90 500.572 null]
->> endobj
-891 0 obj <<
-/D [885 0 R /XYZ 252.717 255.864 null]
->> endobj
-892 0 obj <<
-/D [885 0 R /XYZ 90 239.215 null]
->> endobj
-893 0 obj <<
-/D [885 0 R /XYZ 175.241 145.908 null]
->> endobj
-894 0 obj <<
-/D [885 0 R /XYZ 90 130.06 null]
->> endobj
-884 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R /F101 862 0 R /F93 763 0 R /F8 794 0 R /F98 863 0 R /F11 613 0 R /F6 861 0 R /F7 795 0 R /F1 833 0 R /F13 834 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-898 0 obj <<
-/Length 3052      
-/Filter /FlateDecode
->>
-stream
-x���r����-P�r43x
`WR�h�.;�k�����DdA�@k��O�t0 !j�[��Ḅ1��(W+����wW7oL��D��duw����D����V?J��k%�
~(��J��+�>�˦��:�AsO�ۦ��d����A���^k ���Ů�a)�*�����]�v� �Rto,L��
�~�U�v���J�0KW�谊t�j����W�'!�3�J�(

��Z���k
�5�eAލ{��Lǟ���}ѴE_n�`ڢ;U}G�ݞN.����y���
Jܢ�j�m��ޗ����i�F�L~�N+Z~#���_�Y
�y�дe�? Ba�M��(�6�㩷x�zN��-��
\F���!�P9
���P���/_xo��l�[
���AP��؝�]^�4��}��u��<u��}�vb8ˈD�Y�N[@@e��>���&H>��s�QN��V��'Z���H��߱|�
�cU
���y�
�
o�2�������e�ģ/��
-�-Q��S�b�������#��m���DAgY���/ڮ�:��-����������C�|�Ӳ�vŎ^z,�=������Zc�,��~�R/��-
+�$;�N�R�ւ`�ԑ�$Θ`͚P��`p�L��|VN�ׯ�y��
RjB�����M1\�&����a�Cn/˜��:Lc��4�1q
X���T
>����
Ce���a�|w��������\�9
��
�aSVe�Dײ�yP�PG"�]�w�[i�o;8�Gy�4�x>������������ I��捎�U�E�5�lo|K ���L
D�8�Ŷ躼-�'Z�VMW�
:/:lʇ�iy��
�rr��
��Z�P��L?P���J�+�Ϟ���p
-��n�D1�4�C���$��Щq�E�L�lbI�޼�"������KЎ�?\�M���~J�$�=�,�B���p�ZA"B�
F�3����'�֎�8�L%���J^u
�<{1��;؄��eJ/��:R1X��Jq�X�t�$Aߖ�l��+I�Ӽ��P�&�����C%dl^`��`
-�&�;�Uނ��u�Z`J�
-��dJѨ.�8����q��&fn%VR0
1-��3Cs^�[倥��'�Sny
�S^��
-p6�LF=x4�Yg&�۟�0�-
-�=.�����40WL l�sLGIO'�u����[��<;�5 ��XCK=�Jƭn�s�B��H��	���Q�����B�0/$Z�
��#&*M�
]
e����㘁㴩��D���Q���
��/
X��v �	P�I/QWe�A��+�B��DP�w��0&
��ܴ��
��e�NOdl^A�酗W�/Z���S�v"��'�"+|�
Յ�)�
"09p�9a8;7(��30��ZG2���g\_�.��$�=�G/��u*���>��
-z�
j4e~�^-��H={�͓s��EێiH3KG�<�.K��npӞqŜEr \�
v4�g������"a�l$ܺ�0�D�E��G���U[�!
Ny�K�5���D3[ 9����d!6�)�M��f �*���َ��-OE
�L젧�F
�C�߮([@�-��_�&)�ܮ��K�M���

�8
SM�X�
�&����L�#���ԏu���ޯ94����Pu�r�A
-�(���l�«��8 ��V*4
+<W�pm�)��>�q�Ҟ��7��+�&��o�j���5��ق&/��g����p��I8&�rC
ԉP����)���XJߣ[#l��
-7�UŻ��,��H�o!?F���ϯ.?L�|�r�(���2%��ҙBĆj���� �m
��]"�E���A� ��e���\e�,6u�
�Mpoದy�Ep���ܸ��L,�f�3��v��"����
��=f!�t6��X:f
�ڣ[��i:�D%�1� ��3������6��>�+g�n���'�P�f�Lm�'�2
�0D��D7:}։�Jh�~�ʡ��ͮ#XT6�����^C���9�(w��'O��yo�w���Ia����`�ۦ���@���<\�E?א�4%r�=�r{��1߲F�� Xw
��.ŰA��?ؤ��
^[�"�C��1:�ví
�T�c
b�j���i�ƙ��
�,�Qc���� C�J(
Ϊ5%!	�
T�6
�)���ӟ%�S�C��VEm�B5� �yQP��|�
1K2
�KD�P�4z��X`�J�"��ѧ!k�'�:�%y�P����h�Z9�ھ_��ñ@�o�?��(C���o{J

���ݑ���
|5Be�
-�
��յe�Oe��bĖ�Ȍl�SG�+lyN�(B�w|ź*��P��30̰g_�G4:b���
-L���[��@��k����&����%4}+ѱ�4���
Tv���il��0J.�� �yY�9Bn����f����U
>'�����Y�[����

.��6 |�tDV?4?,�a?���
F�H��8v2o�	�B>��3��Km�u~�6"c�;t�?�����k����
-�[��m�e*���
S�(
;�$�ˇخ�ߞA�
L}X
�r���*��<Yd>_��%�c8�/��x���Q��@�5K'�Ƕh"�<g�CeD(3bz��Y���
wɼ?�Đ2
���dEcRw���G�� ��oB�:U�ib��&HE%�����f^8j R��'x3��;~�Zд��쒪�c0�-�+�l=ƨ�L�"~�\@�
�њ>$�T�`>Q&�;e�O]ts�0�_V�x��U&�����:4 (�f)�e
��E��aџ�ah�����m�H��O�f�f�i=c��gq� 0%�>'o3�۸���6,���`
�i�V�Џ�J�IJN���w�7�rޝ
�q���[z��;`��D
a�#�|��t��F$��*2V��j�� ��[���_�̏����>6 o�IÍ X�A���'�߯��_���CE���ǂl���/nn6�����켫�ё����}@�
�d�
v��
�76��X*�$�q��ەR�-�?���E^����^7����m��<W�
-endstream
-endobj
-897 0 obj <<
-/Type /Page
-/Contents 898 0 R
-/Resources 896 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 903 0 R
-/Annots [ 895 0 R ]
->> endobj
-895 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-899 0 obj <<
-/D [897 0 R /XYZ 89 770.89 null]
->> endobj
-868 0 obj <<
-/D [897 0 R /XYZ 175.23 633.71 null]
->> endobj
-900 0 obj <<
-/D [897 0 R /XYZ 90 615.685 null]
->> endobj
-901 0 obj <<
-/D [897 0 R /XYZ 316.33 314.352 null]
->> endobj
-902 0 obj <<
-/D [897 0 R /XYZ 90 296.327 null]
->> endobj
-896 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F24 529 0 R /F8 794 0 R /F11 613 0 R /F93 763 0 R /F32 764 0 R /F10 765 0 R /F101 862 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-907 0 obj <<
-/Length 3446      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_��J��
A��!�:m
'�N:灒�+�)�T��_�
�$(h���>t<�"A\�s?���nFg�]}ys���L�4�)Og7�3MgY��L�m3�e���כ�g"U���֯~xy��˛����77W�|�3��%��l����W:�@��3J�V�{�i?K������ՏWtLJJ'�0F�5ޖ�b�䩘w[����C�vm�r_TmYW�Z�b�
_�u�vM^Vݵi�|�]QM�Ս��ڇ�+���M�g-[l̏]�ϻr��v�i��Fm�����,�t���h)q3UQl���Ek�
�����x;�j�_C���C�{���^�_e逧��h�ͫ;K�it�����]�.;?�n���]��: 4-�
�ڌ���c[���I��;|:
�C�Ċ	%\^����z�k�KH��H�KF)�q��R^��p5Qm�C��kɫ
>����;)��,��u��~C�tn�)��ڢ���=� F���ٷ<ͦ$a�y
��
��QXL�=�c�l��	e��V�$����4�,I�g�N�+���O�?��y
��s� �F��md˰�ǔ�-��9��3M8��-�Sd�
̌�	�2�)�)`�"0Z�Q���C�
�N�X~�`
-Y[X
N��0u�UI�Ǘ�F[�pr�Ac"��$Y�b�A�rY���e�8���3�Sv���k��&JO8��
t

fh�2y���d��R�	�Iꬉ�;Ż#�U�ڑݰ�	�k0���4�
r�A�a�wd:J�����u+OyƁg��?��qb�c$�4��a�cF��(��f�^�4�K�fJ	U�x�ϝ��;1 ��
�F6n��<�14N	
��[�P�Jf��
-4|���

Qԛ�=�ݢ
|�5>�������>TJR���(F�@��p�����ŋ&�mdg`O��}\G��V��
-�\>Av�E��ޔ_��ya�
-�KDs7ɍ5H �>_�{|���U�`�=����r�7�m�70����}�M�zDJ�4ϗ��|`�Y��/
=_���ޫru
-�	���W0q/,!���$� �3�\�8@:��_�(Y�/S�ղ����:�1������WEH=sO�U&�

��RB�
sX\�c2t�Q�T��1�5�4���<u��������f
�N��QB��y�\4`�U���
(��<�ӑ�*��,�6k1$�
NEFJB�]�
�PI#�q
-Ꮮ���ųD
�A��2Q�{� 
0�#Bcv�j ���M���
���I�l����	
H��Pŀ��)���o���䣵�����<�� �
)ؼ)�y��<s��A+Ft�0-4
-�)\��+tri��~���LR� �繟ۯ�7nJNlA
�JY
-9o�јd��D
�X#�z䨒�Y���e_�:	x������*�'~0�$ա|i�b�#��:.V�q���Y��-��HPqL�
-�S�1(W��-����������n[����o8U�
�|�	~�"ή���b�	�ԝw�5�>�ch�_0����)8n�G?�����aq�
9)瘕b�!��QLE�	�ـ� aD���G�4��e���g�ru���7�9���L[`(��!
-��<W$�$
^�KjY^P"N�:��o�YJ+�chx4F�I���L�B��� N��ql;��ZPC��a*{l�ˇ�������3���$��+�9P��X��
W��KG�F#
)�c�3%���o˵1<C+�S���0VH��y��E���mY�a;��5��s�ǔy�v�A
?���
�ZA��E�
�+��]�[�7\ �X�^�|��%?5K������1��� ����t:�[ϓ#(�Cu��hf3��@N 4$�}�����mb	�.�rL�`
-��NA3�d�Y$
�Fy�r]���V�Rt�W7��\�޸��ͯc4@�!���V����y����*˲6���yАw��
"8�AL��Y����=&��b�^���
-f������Ja�
�0�NW~�1S��C�W
���݂���	�'�U �g���Y՘�
�_s�Tlb�3L�
���z�"`@B:����E:\ܚC�`�
3i̡)Z�m�ǃ
�,�|�
U�	!~��j��ޜ��޻
~G7����$5��P�ݜf딅�ٶ4=��m]}$�^�n���@�������&[F��S��ͨ{��S�!w
�'��:�LȠ�
����� ���bq���+�����
y�
-��_� ���t�ـ
D��8�|��ڕ��� X���T�²`��w�ɛ|q�k����p���C�h	x덓��)�s)� ��n�]�m6�=��n�!S6_l���0�.f�ʠ%�9�2�
;<��w6k�G���
-�9��G �hʵҘ2�
4a�C�9��ήk�um���X6��ڱ<Xdt���ռr��8bۣ
�̲mL�z)8�j���HލM�H;�
��@W���n�x�t��"1�\C�/����3�?�M�,kZ1�T�����1��?���]_�v��!��w[[5�E<x��uSz-�Ǵ�w7ؚ���
��ܫhp; ��[^�R9����0�
0'�k���
��v�oG<�}"�ߚ=�����
�吗��|��c#�"!ψ���tx#@s
$~gΊ���y�~T~�J<Z/�``N;MΈO�:Ig��t3�Q�kDԕv��&i:TRQHu��B��!(<��fZ?��qg�p茍�q6�V*�MJ<�,8МQD�dƴ�X���� ��Jc�!�KC���LRC�cj�@�z�?2�9�K�G!���cⷜ�����
-��*��a�y�TdwD��J׺oc�΀O�ӅFe�IB����3���&��-&�ܗ����%�D��>�}G�^|=�0q��T����q��Bp�N�l������A�m at tfbp)z8`s��N�(6�^�V��#D<�"u��dj�C{��r8�j8 [...]
�e�4B�
�u������Q�#[VeeB�S�'2J�pKq_����1�Lut��#rN�V��=���M8�M��e�)���}qp���!7Ȼ�\m,�è�����L�ix}��_zY,��^ã�����
�?���h`bR{��
�T�aM����G?�5<{���k�l�n	�-�	��|�J<�3�KR�hx��ի�ÿڢ�������yu���}u�7>�P<��V�u�O���=�7�_A����bն��={�:޵EuG���4�kM�p��_���Mo%�j�	��
�
-%
-endstream
-endobj
-906 0 obj <<
-/Type /Page
-/Contents 907 0 R
-/Resources 905 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 903 0 R
-/Annots [ 904 0 R ]
->> endobj
-904 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-908 0 obj <<
-/D [906 0 R /XYZ 89 770.89 null]
->> endobj
-909 0 obj <<
-/D [906 0 R /XYZ 155.574 687.2 null]
->> endobj
-910 0 obj <<
-/D [906 0 R /XYZ 90 667.229 null]
->> endobj
-911 0 obj <<
-/D [906 0 R /XYZ 90 377.062 null]
->> endobj
-912 0 obj <<
-/D [906 0 R /XYZ 90 371.373 null]
->> endobj
-913 0 obj <<
-/D [906 0 R /XYZ 317.494 265.796 null]
->> endobj
-26 0 obj <<
-/D [906 0 R /XYZ 90 245.825 null]
->> endobj
-914 0 obj <<
-/D [906 0 R /XYZ 474.355 203.368 null]
->> endobj
-915 0 obj <<
-/D [906 0 R /XYZ 90 183.397 null]
->> endobj
-916 0 obj <<
-/D [906 0 R /XYZ 285.407 77.486 null]
->> endobj
-905 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F24 529 0 R /F101 862 0 R /F7 795 0 R /F11 613 0 R /F10 765 0 R /F32 764 0 R /F93 763 0 R /F1 833 0 R /F8 794 0 R /F98 863 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-920 0 obj <<
-/Length 3623      
-/Filter /FlateDecode
->>
-stream
-x��[ݓ۶��Bo���o���!M�L�ֵ�k^���'Qwl$�BR���. � Q�咉�3&��~�v���̾������ϲ$SLͮ7��̴���m=�iN�XRB��?�E��e�oK&ɼ����d�nAɼ�`�^/
�>��:7]��S����۫^_�vEay2�v9��t��]��
�����Ix��ޛA��`
���Wo����$Lbn0W�JJ�m$�m	�l��XP:G�Y
-CO��
K���Un6
=/�b�*
�
�_*=2[2l�˽\P9�j�#��|�o�"��y麫�}�z����g���%��e�"�3�k;D�T�i��h�l���Ȥ۳
,���3o�g��`
K?j%�E'�V��A���"	�h-J��H�����2A
�=�f|��vt��8#�U)3t��@��`e҉gTij.7
��7E��NF�P�����?I@
�I��dٓ��-/�_f�Vқ���Q���$yLe�%�����ߔ3�|������O��"XFY�qcJ�r��τ�}�����F)�F�˷ۢi�۪wLr^��9u��
�k�r_�o���^��h˕� ��$
-��:��	��"���s�e{�
ܘǠ�Q�4��Ns�}���d~[�!,l�޴ 6s,����]u���МM����g��T���;
��rh�������y�ެ��94ʁ���b
-���
�.
C+���\��cLQ�|��czP��HD�2���z/(0��.��ב[�S	�OQ�4ɤ
ݥoU��V���]��Z/>���m�j����b�,��c� j�ꦨ�����5N���]��ZU��Ck
؎/��;Ɲ�pK&��G
S9X:
�O�9l˛:����r���b����3�
;��=ԃ	��Esض����
�}�l at 9|@9��-���K�\h���q�@�ƾ�[F
zb
�豻�~��F�;����
��mc�,ۦ��ܷ
F5�����e�4�|���1��bsغI+��l�uQ�^�
-��'����
�4(�����>W!?�+��gU�zv<w �to�W!�m%Y��;���I�k�Na�L&0�V:*���P ��Q`���!��U"�
-������4���M�:�dT|l�{��*���Sv�����bXx)S�0T�6��d:<���v;�b��!3Iz���g-�MJ�����.{���'|�=:
��p�����3Ā��A`J����6PCF�+@%f̺pH+��ODʥ7�s�� }J(�`F��gF�\N�Q�~J<;8�b϶Ǥ5�
Y�I��gcK���>�}����������X�D�)Y�&1$�X/���GC���T�1�?�qr|a��ρt��ЏfA�0���f�u�
R��!oT
Q
-:����-�$Oe�44r�%�iM�o*��)a�4ޭ��CAR���6�֦�\c�UMO�Zh�uM>F�Lhy
��y �;�>�R6$T��!��i*���Ae����DL4K	C\a��89�q/�E�!�KM���/���0�$��L�\1�MQ�tÁw�l�3w�M��V&�h^X
�U��qËݍIf���JLr��8�c���ܢr�؇�aWm�v���&s����d򉎀�L8K��u��8�#�J+�ūo<�P�r�*
 ��]U��e��l��r���2��kW
������i(�Rm�cN��P�yd
B>
 z����0sAz�I|"�me��e�_���e��LM�}W�w�k컑>>����#2:���F���mV��R ���2�
䠘��?��
-�seNQ����S��������%��a\$�
z
ͩH��4Pw��͵�C�#Ϧ��
J��L� p��ɣ�Q�:��e吝�
b��u<�]jx��}�;�Z�1͜/���>���a����i�i�J?#�D��v*
��ǣ��Vp0� aE�	sq�7��mk��r\c���[�u���ANyBɨ:��Uԧ>ݔ���lV5�y��̻���]y{�W����\M�Ws�P-}+��Y�c���	�3Ԣa�o
Yo�ݼ���F��aN
-�����
kb��>퇵
a�J�x�ՙ�J�8ȼ��͆^��V��
-ü/�>2�d
�Y�S>һ4�V���08��������~@]]��ڨ��N5;S`���zڛ8G����9��7v��|���������@I@��S�f�$�4 !�P^�,e�
$
���b? &�tY�Es_�]��Q&��i0���
lޭ]B��7T��&XfO��n����~U<���H�-����r4tl�j������b��RM��g¢��.g�
Z�Rh�QQy�Lr�
�1X�=��ޕ������}����n���
��x
PX�ڝ�ʝ
�>����H���.w'��hȦ!����J��$
A�觌=���#fdSy��,��}�g�b �'�:X�K['
\3
U�Gp��2��h�#e&.��,���!I!�6SR	�#���$I<+g0P��|���\n���C&�9f��%�k�K&'�d:�(D���t�^88
-�$��!*�TY哰�&l(Xd/3m�Aı
6��P�;O�9X]��� X�I\���0��aQ: J����K��3��E�IX�a�����0�r
�
��ء��KEc2a�|�f�J����#�
�h)S��)Љ

a���0y�_mk�4�p<Qͷ'H15�4
����ٛ^^`b�*���.��m��|f��W�xv�H
���a�d�������l�����,~;���'��fܻj�
z�LuW,�DomO��n��
r�� �I���%hM�%�Z�"�Ck�SDk�(ڟ����&/;� �H�����.D_��%/:U;��>�>�䢣T>u��d��L��e0
/H��0ԫ��W_�\y�+Y���s����ת�_��V
?�j�ٯU��V
�u�	���,�QeY�]���
=��*�Ԗy*�iyՐ��{H�'��!5e��X�
����l�~Ph6%ɾ4�VA� &�ػ�gS{*��7��Ewzd�`�����,
`��%D(��	q�+�$�o�'G����*
˽_��de����
[��Bd�,("N�G|��Oh
)�V������8bm]�
��$���[<-�
Wo�U����S�mɒ+7#t�K��e�����`���)��g�
�=�ͷE۞8
d2��͕��F�'/��(�KYp
�o	(�+�Uԇ㈜dg��:�S<��p\x�"�|�#�����N��`�W��>�Jh�xGxX�FC��Y�:v�� �%L��VX��m�x��4}�u���w�/�~�������p	A{w�Ix�_�v u%��ٜ��E��>9�c�O-�o��9f#~�gH�z���)c�Zfڂ�?��}�	���'�.V*>�:>$��թ�qe:�W~-�E Uǟ�*�h�^~j>��Яc��=�Ndw��S�ׯ�e�m��o
)��f���ݧ(£�04!����j[��u��
8H�@� G�������7�ۦ��&+{�bvoȧW�M�Sv=�,�뒝���t�v|�
�:N 3�d�Pml
�ym�c�����7;>��_����
-endstream
-endobj
-919 0 obj <<
-/Type /Page
-/Contents 920 0 R
-/Resources 918 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 903 0 R
-/Annots [ 917 0 R ]
->> endobj
-917 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-921 0 obj <<
-/D [919 0 R /XYZ 89 770.89 null]
->> endobj
-922 0 obj <<
-/D [919 0 R /XYZ 90 721.073 null]
->> endobj
-923 0 obj <<
-/D [919 0 R /XYZ 409.479 633.06 null]
->> endobj
-924 0 obj <<
-/D [919 0 R /XYZ 90 615.275 null]
->> endobj
-925 0 obj <<
-/D [919 0 R /XYZ 392.938 489.429 null]
->> endobj
-926 0 obj <<
-/D [919 0 R /XYZ 90 471.645 null]
->> endobj
-927 0 obj <<
-/D [919 0 R /XYZ 90 211.176 null]
->> endobj
-928 0 obj <<
-/D [919 0 R /XYZ 90 195.549 null]
->> endobj
-918 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F7 795 0 R /F11 613 0 R /F32 764 0 R /F10 765 0 R /F93 763 0 R /F8 794 0 R /F1 833 0 R /F13 834 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-934 0 obj <<
-/Length 3748      
-/Filter /FlateDecode
->>
-stream
-x��\Ys7~ׯ`�>,U1a܇
�îcW��ĉ���xS49�hKC���x�6�
/[��R)=�p�F���1ƒ�
<;����ç�

2��������		���WC�O_�7`R#b$��=��ߟ���K���7�'���
-���@J&7'�^��
7��=�s�n�2�^^��x�SQ$.D!��|6;�b����aӞ���ñ���I�o����]�歕��S�m�`���
n|�lH�
-յ�nV+���j
��/����v|
����֡�E�$���_�j��y���f�h��5��Q"�R�0��4��f����jvy�,GnUF���@pSs
q���WŪ6Q�Q\N۵իW.̙1�EdLv�ϒ>���)������7���٤��rٌ�Ͳ��j��͗�mР�r^Y.��j�ri�x�Z�tV;|j���9q
��i��Y�Z��Ic�BX���N�uOyҽ�v̻�_��J�o�h**���_ˁDF1�zBXk�q���(��$����` m3��b�㕿�i.��N�7��Y{�a)�z�߹�O�W����ܧ�����E�D�*������1�ex��ܾ4���(X�C[�^�{���L�D��u7�v
ü+�D$�Y���~�H���,��'�7D�Ma����	��G M���f��.5Ң�a�6;���x	�B6�����r��|Sn	.,N
�&Ei$���5cz���)�r� �Vf��0Z���
�S�Ƿ�g��Mj5��
Q��+D���!y:"����b�͇�`Vp�$qK���i��ؽ�L����Υ9yB�)��,
1؎^����]
	z��f�8�S���Xz?<��=o���^ם׳7��2<�QV�����_
����;I�����Tz:�+l���8�5Jzj�~��(i5�L�˩_Ypj.�J���b�\�\����-H����ⶅ���/
��w[?cF7��L#�Y- ��������

���I�#"��/��<�ۊ

��q"W

�}��'�$����������O�����)�+}u;�
-kkaҦz�����AI�{� ���P������mY.�Y�K�
˵)i��9�B�gq�qe�'�ɝ�Ǫ�
�����"��g�ر�+0W��[P��w��(!|���R^�?��Z��
p���6�@�&D-�mp����8�o�0$#x8^6����'5
Sb_*�
АͽXhNF����S����
-�
�
�4�շU�$� Z���-U�3�<��4}O,c ɨA�-�Eb����fG Q�h0�W���hQ���M0�}�ĸ��p�\�9�B���'�6�F��)���[0�uh���r�J�b�
ns���
�[Z�6Yȷɍ��
�n�S ~&��mg�!=���5��(����6$b��|N�PDf~*
p��HD���;��w�US��3���Vp91���
tK��"�ئX�)��Y@ &��eɔ�m��%
�����TY�j��N
ܓ��L+A�:D��U-ˢ��
:���
ҳ�K�_D�"�����#M�Mj�B%��>,0���Z�
-���ʤ�@,:�J��` �TI?�Օ�@B
-�Hw@��M�­ԇΓ�y�}�{�i�<Y�gE2�Ѹ��ƒtwbH7�{Κ�j�LrX�
)h�~Tf�h(
*�f�za�
�
-�'�fm��?V��2������
-��/Ҫ�f�k3ݳC��{/i��v���V֐��a���w\�A�r���t�
-��.�(iE��}QqCi�37T� ��8���!4c1i�G���,�
-,�7�-�
��z�C[�G����_�[~mq�I�
IvP%w�
�eӛk��S�
�X�8�搳
vDGf*f
z��~O���7�g��n^_�
��N����R'�+�S;n �v
�s�q'���b"
 ��:�L��d���z`��5��ݩL�H ���67)��%/ҽF%yVte�砪KEத�r�ϐ�����A����@�
h�_Y`�;�T�,�{{G:+|l��$e�(zR0��䨌��dD�
��x�/�sP]2bo:�
\��WU� �N�t	
�o��:lA
;B��d��ui���y�^�2xӫyV�!
���U����";�_�R  ����Т���ϻ
�b��__8��3�"��¦eP�>lW�V� �t� �v��u�,��}�=���0���Y��*��A�n�5���藭�`��ѷl���� Xw��:i	��j���gH���?b�i�I�T4���B���8�Ȑ��B)�(��]؂X�Z�y0
�9wd+gq��V���Y�b����Q��^vogNZ��on�AX�(�]"�_
��r�ܺ�0����9)˞;hɐ1Tb`fA�W^$R�p~<w�s�E:��2������dg(g�)1Du߰fJ�
�V�m͒
���,���oIDa�l��cL�]
�м��עޖR�_;I
�>W�]5wL�&7G‡�YMq&�xWk��$(S�
Z�f�<3�w5 ��=����u����A
-R-f�di�: �<>�<�z�#�'5���D(�p�[���98$�=����/

��b��6�6������2
��������ճ'O�����Y����^��T	�"q�q�t~
i��T���Ŭ��
-r�)
��P�{uu|��a�4`�#�)�i����ݡ9���%+o��e'�@�'�#�  ���`�\
WP8�D�	l!F�R�{�yRfgHL�L���8�L�nݮ��e��ņ�f�?;KS��b���(R���]-�H�v�k
-�)N�l?>�K�.୧��Fӷu>�:"s���i�|5_(D�ܲ´X�m
$�:I��Y}�/5뵮���vZ3 ��I0�;�i����%��^8�֌'5���0�X�LE
-b+���jZ�g&dc�sN4�z�!��8�Up�4
@~
{���_����D*
-
���5��	I:g�l�Ct�~�l~�~�r���뮇�L-���L) 
���
�x�%�Q��E�s��R
#�A�ו�`�
{�
 �Ūz�x��1��ኻ�ѹ��4�6���i
Q�D�x�rZ&��)i
�FⰡE��b��t@���=f

��u��v��a�����:��W�������b�_���x*��#i�"T�~
�)��C�NLz�z�
p�()%��<W.�9�< {�u({�?{@e�>�@}Y���
{Pϲ�s$
�/e�[�~m�-�`���
��3
rqNz���/��
�ׯ��Fq�=���z�e
�QS�:�'�to�Vs$�tm��.Rg��i�P�5�3f�վ��}̦_���g��_K��zt{9�/
-L0�?⯺��G�
-����q� �1�o~T
���
3���e�w��㡋
�@ZwE?nC�|Ca�K4�	ڪ�'���^{ɽ���ö���S�:7�Y�H_3����BZ�Z0~�e��`�o &I���KU�,������N�0����
-�BKv�l
��NG
[�YqM
*`�T�zڎ7�j��e<�C��^��B�ۏ����HDߴ�u|g*0���}u|=[�<V��l
>�RD�5s$��%
��f���K-�P����d�0<(�Շ�H��9�_}$?�
-���!��`�����_r��~
<���
�̡������$⪾���5���&9�
s��_��߫f��S!�A���m���bxi+�������/��r/׻^���d"F�)\�׋����^���M�7�5��cc�F�������u��yl,���&=�
-endstream
-endobj
-933 0 obj <<
-/Type /Page
-/Contents 934 0 R
-/Resources 932 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 903 0 R
-/Annots [ 929 0 R 930 0 R 931 0 R ]
->> endobj
-929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.653 358.91 290.207 369.814]
-/A << /S /GoTo /D (index_GDDetal04) >>
->> endobj
-930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.653 74.333 290.207 85.237]
-/A << /S /GoTo /D (index_GDDetal04) >>
->> endobj
-931 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-935 0 obj <<
-/D [933 0 R /XYZ 89 770.89 null]
->> endobj
-936 0 obj <<
-/D [933 0 R /XYZ 90 647.598 null]
->> endobj
-937 0 obj <<
-/D [933 0 R /XYZ 90 633.7 null]
->> endobj
-940 0 obj <<
-/D [933 0 R /XYZ 90 504.666 null]
->> endobj
-941 0 obj <<
-/D [933 0 R /XYZ 90 504.666 null]
->> endobj
-942 0 obj <<
-/D [933 0 R /XYZ 90 490.768 null]
->> endobj
-943 0 obj <<
-/D [933 0 R /XYZ 90 359.906 null]
->> endobj
-944 0 obj <<
-/D [933 0 R /XYZ 90 359.906 null]
->> endobj
-945 0 obj <<
-/D [933 0 R /XYZ 90 346.008 null]
->> endobj
-946 0 obj <<
-/D [933 0 R /XYZ 90 75.329 null]
->> endobj
-947 0 obj <<
-/D [933 0 R /XYZ 90 75.329 null]
->> endobj
-932 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R /F24 529 0 R /F32 764 0 R /F7 795 0 R /F8 794 0 R /F1 833 0 R /F90 758 0 R /F10 765 0 R /F29 938 0 R /F12 939 0 R /F6 861 0 R /F13 834 0 R /F101 862 0 R /F9 879 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-952 0 obj <<
-/Length 4426      
-/Filter /FlateDecode
->>
-stream
-x��
�r۸�=_�>U�]!�L��l�Mg{٦M��m��Dۜ��+ʱ��=���C�����R 

����������o>�z�>����٧�YNg�̉��k=�aΈ�X0J��/��ay,���b���w��-�H:�|��x�c.8L�<����
9g�⟟���w�^����t��v�df�ھ��t���?�(��ݻIۙ�����W}E�peo�%��J��a�9��A��./������
{n�����|8e����_����|W�_�.�����
-�?��b�d�ZC��������D�������>,P,W7����+�~'i�9aF�:���A�����&�Q�����<��(Q�Y�oa+:le��a��	���v�V�>[D�,��� l�����OJЗ{�d��c���e��n
����TN2���3�
��Ŋ"�b���kh����`(���'����"�xS�yy��$R6��}�
Y�k"Y^ϾۭA����1�'K�i���Y�MU
1"�!�pN�:
�5"	��X]#���L5������Ѫ���C,�f�3�_Ή������ϘYt`˗
6���i�⪿(V�xM{��'q��� nؑ�PS�H��@���r�Z����jF�|\Z$��H
KYB;I�F�1i�Y�
D�L:ܓkj@�8�y0B9vdE�h��3��
�6�urڏ�o��� ��
�:�8�1�C(k�}�-����b@}��G�܊I�K*��
�L1,a�7�\/xÊ'
�~�Xn���PK��|�	�kc��
5AyF�@�!l��u�NtcW)&��7j��1ѹWKzTm���H �-Z��w�$����sX>=��3����0
Z>�
�
.�vcP���بT�e�P�� ���d�sH��
���
��0�]�,�/���fy�we��Ef8��3z�(F�%sZ]�I�~ZZ`�d��6�D���
Xc�q6b��1Ξ6��s��ub/��:�Ү��9g��S
�d��)K<�#:Ii����	TBN1�j̘��c�M3�lԘ

-�W����+0�j�
v��
g���:Ҟ[T�GK4:��5w��\@
-���JG28ղ\�}��S�l�4�&��n����)�Ů*�DP��Uq�\� ���f%�$x�3 N��e�<��ӄ�+Jr�ozI��|�d+ _d
�:��[,L��
��*���$a�u�C
�gF!_^]03o]���1
Ҡ�3o��jX��������:b^Y
�P�ߨ����p�{4��lYu�l����o�%���d���G��yv�6f
�I�**	>�͚���.;+�[�I�u
�
��XB�/g��C�F
�G��V߻�2�E&�� �Q�c�J&���`�s�In���/d�ur����
/�}G��V
�14/BM6�Ɠˮ���U�2Bd�oF3+p���
 �΋��7.@�Nz�$|P��1q�{� m��
�癪�q
-��4l�E0�����K-Zo;<�
-����]"Ǒ�}5z��i��V�Z&�\B�#ϖ	ߢ.��юt*�� 
�΄!8�ޑ?�"=�˘"�W�#��(1���(���\�$��:ה����	�6�:�r�tq�z�ao�V
��,�_L�pon��D�
�z�Y0NX�0.����1�fH˼X �,�1.�
- ��ba����#a�K"!L�r%[��ڒ-�om��=�)YޚZOL�1�޼{�7���%�/o���*]��B�%����+0�7D�,��^�*�?�ZV�^2�CS;��q[���.��X�~��_\����R�f�[�'� 
<j�'�5~�P�
�r��b����v��0L�<��.kO��n���#SGhv����o��C��V+������g
����V���
�x�xm�5�ar�&�T��}��/�-F��q@�F`�V{]�Ʉ����m0�����k,@�j�Ds�@������rŤ Y�8 at 6�w$BS#d�?��������
-3k�(wJ��$�7�)rxk\��	w]4eQ��7<m
~ �q �D�8O*X��p��V�ql>�����D��M+����7�n����ڛl~�v�ٟ�����f_k�
���{y{�)W�pO�������a0x���z.XRP��~0����\x?Gf��[�6u-�]�N[��`x�js�B6^���
�i�Y-�a��a[
��~�f�YW����p��0'�5��M����	�!���u|u�^��
�d�{N�X<~.��:��T�H�q�v��$�D�
-���叮b^�������lO>�.X]�[y(WG�3]�z�^�7ZX�`Ě4�p3g21s�4z��H�<腢���^�
l*S6mϙ�˗>���R�
�R�t
.�������[�;�����~]l�-�����a,w밚����o�<�ڍn7u�
��n��[{y����X
��<�r凖UU^�@���ҡ"��#IM5�J\�lH����ZgՎ�`
- [3np��� �]�h����e���
Gt~}�<�+�
!�E}�*O�"��t͊)E�L�̝��*Z��5C�s��
-�ݖ�\�i�(�M���n�e�{~�8���� �jM������&���4ں� ��i��
��~ ��+���9��9�-}���E��T:�Ob{�Z�>�S��<���u�f�$�;�0x��1B`�&ii�$�QW���Ӣ}���E*��zz�%�L�E��y��>jٺ=�H�������V�,��r��
 �(�5�e-�Z��C����6
U+�mI��5��3��#�ש��b#	�/iI�GZ�6�
Q�MV/@�Ǩ� *���W�6��Q:!0�rfʤ
�V�̰PA����ӹ@v�Y,�w����l��	O:��>4�h��@*G��

�
��)�q��PM���)�ZH�e�2\�D
-�
%;I��W71��i�I](�%Rw$����)���fl�@fC�-9&
-dqZ������#�����bb�w8�΄���juw�g���j���[�Ŧ׎7ƻ��8��ހ�e
E�@Ñ��i�F;�<���#Bi��W�buy��!l@��2?���"��u[���iv��ށ���U�F�\,F�
/Q�(���4�c]�V5��X�j�j�<=

�p(EO�tMu��B�TJ,f]�١�C��qw\���~�����)�����M�r<j�su�Aq�N���%��r�n浈�X�޽�Ɖ�ۙCj
@t�VyЭA���8��a��q_ڀ���X�&�Y�^��RK�CO�
)Ó2�a�]��Zd-��$_$��ݣ���7վ	���T�.�&�;��$�l�y	`z����I���x�j��mӅJ�
A��
��EX[z��%������vc�n<�XMwebk����rBńw.���X/{*��;��W.�Km4�v
�#�/d��m��3ϊ�O�<}���C�r>�j�.�Ey�i�
-����S��� ?�1�4�
-,rEГā���t��p�I���1��sU��yj;b�G�m�c��&
��d4&�-r��A�y.dA�Gj��}E���E�&�rLۄ�Z�z��~�����]7�l���Җf�&�T2|qKm���/��D� Y�3�Ԛ���pM"�.Z���}y�Ф�Bsʻ��(A�ef_�WfI^u�n�&�
��6��#�fH�w+�Y�X����<�8i��҇�6�����1��?P0��� ���=b�;�_ 7��«Ϡ�i��yM'�A{��y#I�#g�.?/u����r[_�Lp���TE*c�ɸ���0�8�.]����u�y�8�tpΠtN)|�\��{��^�V�[�hu^�04� �MD�:��>NP
o�H��-�ô�NsF2%��P/�&�o������,7��]��}�C^��0��ooR�W��k]$w˸�
�D��xn�_b�$�ɡ�\�@��.W���*�G��j��[׮�U�W�CyY�����վ�,N|�6��U�V�������oX1>b�����߮����үS��� [...]
-6�i_6����\�����1V��?��׌v��ɝ�iݷ��L�I���oe��b_�ʾ%龊i{as�	�>|����;�>��Pj
�����]�"g	jP����8�m�
����{���w�U(L��n��ws<޾y����*�9���D��Aq4ho^����O�;��=߱�:Z�QQ� >
-� d�~e�#4�E��a��a��w[1��
�~��?þ�U
-endstream
-endobj
-951 0 obj <<
-/Type /Page
-/Contents 952 0 R
-/Resources 950 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 903 0 R
-/Annots [ 949 0 R ]
->> endobj
-949 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-953 0 obj <<
-/D [951 0 R /XYZ 89 770.89 null]
->> endobj
-954 0 obj <<
-/D [951 0 R /XYZ 90 721.073 null]
->> endobj
-955 0 obj <<
-/D [951 0 R /XYZ 395.521 157.573 null]
->> endobj
-956 0 obj <<
-/D [951 0 R /XYZ 90 141.213 null]
->> endobj
-950 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R /F8 794 0 R /F93 763 0 R /F7 795 0 R /F1 833 0 R /F101 862 0 R /F13 834 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-960 0 obj <<
-/Length 4557      
-/Filter /FlateDecode
->>
-stream
-x��\�s7�����ߎ��c��m�%�u*��m�u6�U�4�X�H���x���03 3CY��ݺr�51@�я_7$���}w�͛��4���*�fonf�̴��T��z��9U��W��V�K���?���o������o.~����Q�����]�_���dv
Ϳ���[3{t��g�q����p�?$&E��J+J���w���	_�����V��z���"T��_�~&�FI�DC�o�8������R�{�t2[P]I
���i��պ�f�l�%�U�ac���"Z+f6K���BP��
F8�,y�
-8���a
k$^�J�O�y\���=j��D�aa�D>���p6P\yy�$�ۂU�ؼ]�v�
�a詀g<n�q�+�ڴ������Ӆ/��
Pƭ�J�p���u�D��@1���)�K�S{�7R���,��H�K�AE%`[�^�K���@Lk�
���6��Q/�������U1��T����!zt��l,��9cצ���-� c(�sv at N�@��mq,;ct��*�b�\���Ȝ�8�g���`F�:���t��˜
�i٪����;���d�he��Pc��P��@.�sm����|'���@�
%���	;A���'\����H�r@�m�1[p“m�Ļ ��dt��;�u6t����D�E�%o���sdQ��G_c��T��|��+�a
r�
�%@�/�moҭ�ɋB�_v
Q7�&�>Q���i�mN]
�R�g�
L�^�1|~�+�W
����Ժ05D�\�xB�C}�W_�� N3s��'*�e�#$�K�]]=
��z��*C�D��������v�oK6M�l�Ǫ9u�D�T�3�Ǔ��dr��\�AUƶ^���:�x%��0���w��i��f3$�[C���x-+jb^��r�����{8��o
�W��%��JkP����*Lb�t���_�����%�����;|��N�C�
-pi**Tj���w%�l��2=bF�Y��+D^z�2���w��+Q �.��FB����!���x�
�$�dʛ�v)�4���i׷�
-"��.��HX��`ͼ	'Ҟ�-�m�lK�f��[X �)�a`̊��C��z]�΀d 
ş��yp�L���`������qXeh���)�
 �!l!�'Y�L�8M�_���N�
F�2�G��0�{ʬ�
�Jw����m��#(���������sR�V�h)傚6^�ꜚhPP�˷
�/K��Y��b�L�l��q�6�#S
Cvi��Kjp�l[���t��_^R2����������ݾ>,��w�v���S}�����I��f�܆�ݍ�����������8�4�AQ�Z�.�s��Χ=l��C	�  kU�� �J��ؒ�P9d'�
D"ցPbƒ+���߭�ݕ� ��^�&�N��HĒ�l�	
-4�
����lӁ�bHj��†�� VQ��_!t�a��T��*����r{Ur��Ώ{ O(<��b\l(�k�Ũ� �\��t�����r{��
��k����L��ǟ
��лs�%$X�"����o�S�H�X�L�l��o�-*`C��}��%�>��f�Q���طZ 
��8�`�j
%%�o(�M2����2 �P�!�$eЃcx��I+�����?;�|�d5A�����$��eY"�G1�&���b �I4')%z�-�
��k�΂fqpT��������^�6����d!��l��%H�N���3#�5O���q�Dž�j��?�!=��s�H**եy�Be�3`}���S@�23��0-�*h�
--DJ�s"���S�#���ty*jCܷœm|�)��I9	A��ǗE�Ӛf ��
����(�T<!KH
-��0�=g�&fC�l�BNĔ2�1WL2�	���$h�并��7�
#�
]כM
-p�œ�n`*��pXѤ���Z@�y�v�<,7�z��=,�
�J
���R�byi�2뒄v�`J8��
���
|@��� exd�|C���B<ׇ�)2���)'�$�b8؊�/�Y�Z���'��d�?;�� C�
Ai0
ק;�/w���.�P
a�&(�.X��d
�r�{�
ߓ�CC�@��k�Y���|��i	c�|k;�f�-�@0A*���NZ,���?	)�S��(A[�<[�����7WZ��oׁ�ˣ���!�
�iS�P����U]>w!�Vtj���rV.b ��n��X�꒑�����]�[ F
-#/�< I���cnٳ�#�,;'�
�X%�\�%�L��R<�8�k�ք�g�%9�Z��s'^K��'I
Yi�R�������i���G�0
f��<^���(���ln
SPۘ
����?������n�l,|r�%~��L��@'b��bb4���<U&,؉K���TbU�i��'Vq�.���
͙~���]�b���hn�Q��f"I��tnUVT}�ܪ9�U0
�V�Hn��|�ܪ�ʭ���*�r��)ܞ}��� eYn�W����*c�˭2����
�Jog]�c�[����o��m�<b���G��j�=#��Fj��_�*��]M,;��y�̘�X��7�ۇ��A�
�rS@�5q��h�3;�x�g�I��v�*���`K��)`o�*�>��T���1I_�n�r�
��q���X
�5(��#�ԎO��U���C>e���@��?={��ݘ��a}�n}J�ݥCۑ�}-'�V˫��J�����v�2x
͂����s݌#�aP���Y���VW݈]ޣE�=]ŦuN˱��5G����U5V�`�4ʹ�RU%]}�����8�{���\�C��45�=�F�S2=lT�E�x\0�[����S��b �v�����a���V�%ď����!"x\��@��k?G�_]�i�
-M�L�g>*�Q�%]XE'�WV���"֤,
B� )����XZL,X���i�a�����-��� �֭N\����;lŌ9�&Q&�.SN����؄�-f/
�i��-��0z%���#�����ևݗI�"��(:�b����n|G� M��y8��V�Q �%^��?�]@t3���P����J��@�G�� ڲ��_c
\���C\~�?|}���Ro�H�1���ė��h\�z��2p���?�X���j ߪOSn�K�q�E��9xĸk�I����A3�8��3�aE�7S�@�kO���
�
c���6����ը �L�����Y�ŏcLK�-L�mW��EJ?q؆L�g3�z��Wviat�e� NV��5�Zu�F�z��y�j_"��
-���gq���nV�}��)��(�	E!��1PO4YZ9Kt�Az
VC��XC��G�~]{v7;p,e��i��X�j\�)ɣt�
���4ةtw��ʌl%�͊��a.,(�J`S:�
�"�5ms
K0�BHm>	���RKr_vbZ"<��]��*η��%��J��%�;�H��3g���-�K�N*S��B�t6d������wEE�PΚ�	�ۯA�O��
gثDz�r^��[0G�M��	j��|�}���䰜�9���}����T���#��G�aX|�����c�eM*����Pj����=
�%�&�,<�gac�j��
��X����ua ,��̀�D�����e+���ѷ�q�dS���"-ЙR�'�
(�C(��O\=y9
.L��%f!M5�5�Qѫ������S��h�.�*���Xq |S�Ԍ'G�+�Si�Zx��7��Bd�
K�e|&�ކ.ۇ�U}8����1d
m.f�>��?W�.�6,n�Zc�a��_$ c��I\�����l\�� [...]
{�n��^p�Ϲ�
�<���2ɱՄT��.���ˤ�
)�E(���#^D
�:�s1��:~ět��'�
���o�1��1�$g��
zf't EW��eY�z�����\H�r4������w��ɯ�Ww�s��WkӰ�*� 
�P	�W~���,���)+�}�3C�|

�[s���&
�ȁ�8��q,����
��,�i�T�;��
M(CV����fөT�1���[/���[9�	A�4C�S�3̟�L�Oip�����S���H���S iue�=������T��M�WAj�ک��*j
-�U&+��.Ys�0��
l��Q6I���~��Q�Tƥ��񍚁���L`�.I�ꭑ� af���ׇ %^g�|�몚v'��@ �]EN�6,�*hVۅ?7R_�5����J���6��P��4����^�j���E��P�b
�=�/�wB����w0X7��[t6�@
-6P)��􀃂Ň>mq��S�_��?��X��R�y�����>4�
�J�I�=�k~F��u
X��zے�{�qVӃ?b�����������"��
-�O?�нl-(lA7��~w��(�G�@go�����
-endstream
-endobj
-959 0 obj <<
-/Type /Page
-/Contents 960 0 R
-/Resources 958 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 903 0 R
-/Annots [ 957 0 R ]
->> endobj
-957 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-961 0 obj <<
-/D [959 0 R /XYZ 89 770.89 null]
->> endobj
-962 0 obj <<
-/D [959 0 R /XYZ 199.887 353.06 null]
->> endobj
-963 0 obj <<
-/D [959 0 R /XYZ 90 338.514 null]
->> endobj
-964 0 obj <<
-/D [959 0 R /XYZ 90 235.527 null]
->> endobj
-965 0 obj <<
-/D [959 0 R /XYZ 90 221.08 null]
->> endobj
-966 0 obj <<
-/D [959 0 R /XYZ 139.584 77.486 null]
->> endobj
-958 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F24 529 0 R /F7 795 0 R /F10 765 0 R /F13 834 0 R /F101 862 0 R /F93 763 0 R /F32 764 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-973 0 obj <<
-/Length 3772      
-/Filter /FlateDecode
->>
-stream
-x��[Y�۸~�_��T�Z��I��u�6��Gfm��`o�85�D�$�c�קq� 	���nR�����n��uD��Z|}�ח��t��yF����"G
��gp�Y�Jp�-W!���X�E_5u�\���6��������|g�]-	
ؿߕ��Џ$K�X���/_^���0=Z`3
O�\��~A�
<�n�R��ŝ
tX0B�s�xq������pu�>�
@+���A�S+��e
��/W2)7�������4w�˽�5�<�Y����Ŋ�TPi&yQ
�}���/3�<B�$��T�;_�<K���{���:�i�y���<e2)�K,���L$풊��f肄#]�DJE��F43����Q7��rEa�׈�����"Ks-�vA��K��"��T�|��F�K
�>���B�A�v����

t�EJv�6�ve[�iR�$�X%���I�7�������T���uTZ��Ob$@D��"ld�a�j.Q����?��t��a7�Tr��&�"E�zKq����yPml�/�r$~�e�M�����V
�T��+�Ԝs+O[��.I���T^��ؖ]7�Aߓ�yJ䠤�G9a�ў��}�lc8����%�b!ƀ@X��H!�OVFN�E�!�<���a"+����)�g����rKb>Z=�]��p���7rS����v&�;�g. @����\2f�<�t���Z`o���PD�1>wSxAZ�B*���̠:�T
]y [...]
:�� +���~���q�%�P
O at P@)�/1X�m֯hS���"P�JQ_׍��o�?�HLQ'
�`
�]���Pv�|s[��oտb_ֽ!�7�����ٗ�������D���X$���px{[�O��J[¦�Lg�L�
O��o
PZ!*;�T��9܃
�,�T�1s��2��9��)�F!�.���jP-AmG5n�‰��
��U�9]�8ɓo{�r�J���w��u�P�8R�
�<�ޮ�O���y�%
0���j�LJbe
�m�Tp���YC[�{m(�%�z}۶�5���gX�D\��
��|�z[�)��
}��^CkxPXN�mup�F�H��78\�\T��5F�,"�L@&g~�� �&��^�8v�(��d۴n��/��4��i>K����miG9��"!&�9s2�l�=�atC&t�)�P9�5fX&�|�
�h?�I���Ȅ�C��1����3�P̖pp&�s(ᤵ$�
��S��b�1�C�
���$�0
-
�:��v ���W���T�]�8N��A��t|��}���-`�}�cob7�X�s��|&S����r��K[�hf��ze=��ڽ���>����y�@��7?���@�WFέb�z�h�̮���T�5�~w,׽����Z�.� ��&m
E�R�T�
-����H�x.��T|l�C�:���,�Y��Z�B��K
��gH`E+j��(�*����8�Eu�d	v�� 'pQ���y�u�x.�o<���x�|��-?�o�ʊ�a����Ƴ3 C��믥��Iv1�
��X�W�PE΄�nX��@��z]���|���<��E)H?����JH
�x���U����������2�=$ � �AIJ��G���Y1�|l�W�8�2�{���֖|��5���&�-���K;�unV���<��H�2���n�G�Q[�U���K2TR��TS
�IF�N��_��cZ���y�<U,^�P{He�
�m>t_�>l<T�f������Y74����N[��R~��R����_��S���<}3�I�8�'�F
-`#Il��uj���DT&t*����plz@�y��ߟ�{
H��X�}���P��K���<�[J��4W���⺍y
9�vo���>�͒NW���X�K��Ժ���(Pi�&]�A=h���.���- Q1�%_�QC��"�@C'��8����6J`@1�
3�g>��,��d���Y@
@��S�
������
�ES|�15�5�KX�՗��ؕ�TL��� ���W�f�H�Ke�!.��EYnL���ץn��#>���T� �_���7W�s1-
0�
��u�r��*@��Z?�XSUDkL	�βr��@I����6�i
���hߛ��
�ݾ������
8q�ϴd�9'�J�Y�sk;EeI��1�lK��ұ�4rW�N�T��\�b�����Ԇ����g�b9Nu��)���}�M����n��@f����F���
v�
\��]YF�7�6�鄩`�
�?�uNB*Y�22� V�`��mc�wS��
�G�~�K.��P�'��u��iȄ��e$G�t��-;e�(����J�X��J�2
纩���MG�v�h8G􄧘`��K�g��c
���[#��	h���7�}M*>�r�Ψ
>�p��W�x]��9up�����g�ͷ��\��	�+�(�"��k�y[�f)|���|-D
-̞��H��\wYWPm[�Ըm�$�Q���Q�����"1��p���xN�}��J��7��������w�jKl�K&-��

���4վ֔���<O���i*^�E�~��F��
-���0]�",T&���m;$�
m#p��Tk
]�#��I��J��Ƀ>�k�;
XM�Z�g Εe�;ݹ�˲_]V;
 ���?���E���_u��`*�B%B}�:
��N�9H��;B�Wg��C� ?���t� ����RF>�7* �1Ҹu���F��� �ח!�^q�f�l ���.�_�%�o�������Qu��"mq��L�h�8�9iS��PdP��.�"=

&��؀���vfQ1���cfU��uqF��3�����5��\Ez��lD�O� �o�((��@�FUǽyx��3�r�C��V���Z�ή�:������:�D?�(=(����$��fqr������ >����-�*��1�M��U��M_�3w�-,�EJǃs]$NOլ^<��S*���
�ĝ���H�k_����QO����cР�l|5�-�k%J��NBx`���'�s9�g���X��(�FPZ�;{�.ڍj�U}U���[~�d���~�Ĕn
3�O���l�.Īc!�h��@ۦ��B�w����>�2��  [...]
-}�]Ӗ
�k�;V�쁒���� +U���
��4=�m��
u�o�^*8u��oX�
<�_��Lz���A�!�X6}�+#��
-�����]��j?BZ��.�j��������?��?/9O�}�XԷ���͋NN��K �T�.��^����0���]}��U��`�R>�d�������׷7�"7�9��'G�`��Q�ͺ���:e0j4���x+�G�	P���
ݧ�?�Z�~h<��@k@��+u���r
-endstream
-endobj
-972 0 obj <<
-/Type /Page
-/Contents 973 0 R
-/Resources 971 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 982 0 R
-/Annots [ 967 0 R 968 0 R 970 0 R ]
->> endobj
-967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.648 505.225 370.375 516.129]
-/A << /S /GoTo /D (index_HMT71) >>
->> endobj
-968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.151 352.961 315.118 363.865]
-/A << /S /GoTo /D (index_HPR97) >>
->> endobj
-970 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-974 0 obj <<
-/D [972 0 R /XYZ 89 770.89 null]
->> endobj
-975 0 obj <<
-/D [972 0 R /XYZ 90 721.073 null]
->> endobj
-976 0 obj <<
-/D [972 0 R /XYZ 175.548 567.257 null]
->> endobj
-977 0 obj <<
-/D [972 0 R /XYZ 90 548.584 null]
->> endobj
-978 0 obj <<
-/D [972 0 R /XYZ 291.462 414.992 null]
->> endobj
-979 0 obj <<
-/D [972 0 R /XYZ 90 396.32 null]
->> endobj
-980 0 obj <<
-/D [972 0 R /XYZ 400.848 275.811 null]
->> endobj
-981 0 obj <<
-/D [972 0 R /XYZ 90 257.139 null]
->> endobj
-971 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R /F13 834 0 R /F24 529 0 R /F101 862 0 R /F32 764 0 R /F10 765 0 R /F1 833 0 R /F7 795 0 R /F9 879 0 R /F75 554 0 R /F6 861 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-991 0 obj <<
-/Length 3227      
-/Filter /FlateDecode
->>
-stream
-x��ے۶�}�Bo��D0n$�f��8I㤭����LmO���Z6)�T���=�E�v�$��/n�����.����7W��lԢ`E&�����
�
�f��,�&"�~��Be9E��/�{y��˛78w���Շ+S|!����|��_�}��v��*�Ž[�_h���xs������P�`BЙ7w�z)
-��U[��9�͵H�����h���UU���m˾i����
���q"U�
P��aW�>�x�z�㺩{����f`
-%X�M�vt�m8��o�}Y�
�[���
�I�{����t_�<eX�iJ��we��:KZ�ۺ�NIa�����]���f5_���_
Z���g��m�+�k�'[���?���s�.�*���m{�/.h;����8��h���idʓ��7�>�
G:�w\@~�ٰ�a�L'2��
��ǎq����8x�5~Q"(8{�>�����
0����}��	
-8Z-��ʮZS�����Es�|D
m�,7*ٶ�&��	�����<i�}�m�rG��]y�
� �^f<K�XK
Wv�\�4���N6q����"�u�q�G4
�����x�S}��v����W��n�)�#�F$+�J���k��z!��m���2 c��5X�b��p��X��%,c€�qΓ�v�_�P��,2O�
�B�d~܉�þ2eR�����Bagn�p$�#��(����'R� E�h=�Իkv�a���������;��N�ڃ�K
N؊�}�
��[��'}`JI[[{
-�i2WDM�9
Mg�\��H3`�փ�}3��i%�
-g��������9vaw~�(��"��,
N
����=�bN8�{�z����:9�{/� Ŕz
_������k�0��`���x�qP��8���]��V泣��Q��o4#���r?�
q
�I��`9���{��n���`a#`gL�a��-4�r �c��AD%r�ab�>��I���IV�S��l���rLI9��	�1N?Lv".&�G���`�0���d�
DT������8寸$j�G9�e>�22}z�%��������m\�U/���@-Ú���"/�d5���6��U`�� ?:�q.���>D�w�s
9Y3%�Tq!�#`0�j��ͩ
bb)�V6v�c~N#���6�8��
�
�1{
X�|���c��f�C���}�2�=
8Cg_Hv$���u�PʙΊ�
-u��H�����"c� -ip�6��`�h�$Bu��
���/��;�4*��T/e��'z��
�T
���SN�s"��bhU :fm6���ZHnd�ɈC(�E2��+Ub��Bi���Y��Ƚp���_���%��3l�翝�e��~�^W�~��i�piI��l Đ�Qe2@��Q9�?�+ʑʃ
AX�="���	�MɋG�I0��c�4G���UR=�;��#e<j�RH�'R
������R.KmƸ.�"s��f��K���%�8���{����[2���$h�̴�Co>/����ζ��Q�Y�tT�O
�J#�Fz����^��������_�Y�_n��TR3��]q
���"�?3�;[^K>���~��*����z
·��3�
��귷�9�D^�Q){3���4�<��j��M��b":K�\�\&/"{�q�F��}�"��l9��*� �ű�\讧
-���w*`�����`�î�-�U�渶�_=��$��vh���#U�T�,sM
��A36���B�L��G�i�oq(~�	<;4�c���s7�
�� 
���O%��왟��SS�烀����c
�V'��	VǤ��L(:����
��B^����4���4̠�>eW�~��'�w̪T�^Ya�!����ܼ�Ue��I�.�-�
�f�x�	Ӛ�c0{\u�}�e.����g�p�x�wΑ4ez�x
_��!v[^�*g��?y?�Uw��� �'������8h?u�"��'�䄘��Ł�s���B�+O.�
�c>�33R�R���q��f��L���iO��s��C��5ُ_r�]Lk)�o��3��V�N�{L��������Tt���6���[B����|�c�1�յ[�E�������5D�
9��~a�� n$sAK�M|��T�к 
��}
����]�
�|B�
-����ݫ�/�����+{ɨ��ܭ
���]w�������xZ0�[e'�
�u���Z�@r
��/�{ 5z����¼?��,�V�˦G��:�,�яXX7�ñU6�q~E��\ӄb�L3�
�D.�i4 =*FW3
7�3
9+ʞ��T)^fN�W����Hd$�'_��-
��%�Ba,�d�~���CT��
-� �EUOɭ;�o!~�Z'��+��π��b��W
e�k��j55��k"p�1�y봜�IA�ܮ�� 8�C8T�i���ו��q�vTJ
$3��5������C	V��T/���6c[�3�3��͝�*�sg�p����#����������1�e4ā�����!�,�?����∨�0�0Ϡ#:��~�R�L'o	�2f+@&��d��ɫ
�.�R/�ׂ�g`��=#��tf��tJL�d1�7�M�N���)��AU8��O��j�N�Dz-��Z?�7���f"e& ;�tǝ��o9�݄���S�v'�$�Uwr�?�ԎF���,�C�8��b��ar�ℍ��yz
��A��]�g��]�;vXq��+	h���:���0��9�
��;j���~
b:�jgSzv��}�@
��\c�k:�{ӽ۟���m�/�
��1<���琛�g��l�_���(��l~�s�U�9Ej��UݠH^�Z�҄Q>=Ae��0D�0�pl[2���R�0�A�?�gzav5#���G6�C��'���5=h�׊S~y��ԯ'^�3zN��|���$H$=f��S3�1������wd��
P�
I���������w��n��U�la#?Jf ����Fq���ܧ4�l�勞�k���s��3N��ߎ��~de��i��m�۶A�bG��t&̤�3Z�ˇp���ȲI5��_-��
l��Է��5�Ѕ{d��%.��nr�v��?�웽Z|��f�vK�o9n^"��
P;'�C��߯�>�����_��w0c��1������N�Rzs8���Z
-��O��T�O��rO'�2��
�����Ϟ��[��-[S�s���c�rxo�oB���ap���y�yS�S
-endstream
-endobj
-990 0 obj <<
-/Type /Page
-/Contents 991 0 R
-/Resources 989 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 982 0 R
-/Annots [ 969 0 R 993 0 R 985 0 R 986 0 R 987 0 R 988 0 R ]
->> endobj
-969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.267 654.467 513.996 665.371]
-/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
->> endobj
-993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 642.512 234.367 653.416]
-/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
->> endobj
-985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.859 278.715 492.835 289.619]
-/A << /S /GoTo /D (index_Hal79) >>
->> endobj
-986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.791 266.76 180.758 277.717]
-/A << /S /GoTo /D (index_HPR97) >>
->> endobj
-987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.388 213.27 148.972 224.227]
-/A << /S /GoTo /D (index_BHRZ03a) >>
->> endobj
-988 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-992 0 obj <<
-/D [990 0 R /XYZ 89 770.89 null]
->> endobj
-994 0 obj <<
-/D [990 0 R /XYZ 90 643.508 null]
->> endobj
-995 0 obj <<
-/D [990 0 R /XYZ 90 643.508 null]
->> endobj
-996 0 obj <<
-/D [990 0 R /XYZ 90 624.492 null]
->> endobj
-997 0 obj <<
-/D [990 0 R /XYZ 130.944 355.703 null]
->> endobj
-998 0 obj <<
-/D [990 0 R /XYZ 90 334.529 null]
->> endobj
-999 0 obj <<
-/D [990 0 R /XYZ 404.764 293.823 null]
->> endobj
-1000 0 obj <<
-/D [990 0 R /XYZ 90 243.846 null]
->> endobj
-989 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F24 529 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F101 862 0 R /F93 763 0 R /F32 764 0 R /F10 765 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1012 0 obj <<
-/Length 3897      
-/Filter /FlateDecode
->>
-stream
-xڕZ[�ܶ~�_1o��2/�(�h�8��mj;.�	�
wW�FK����\H���k�e�w

��w%6������W�^�)�2W���ͦ��I�C�y����]K!��e;�~'��#�TͰ�V�#�w�,�ia�t+���o����Շ+	[��䥳�������bs��6"�e���A�M�4�7�_�^_	G��
���h�5gڋ2"���2e��FK���z�"��"1��\ÿК�~��ɳm���;˅C5��M�c!��:(��x�}5v��޵�;{�o�^NS�m}:7�d۱k?���
�mm�ף���ݬ���z:<4
�Zʤ�2>д3\���
-n���^pˁ����K�
z;\��˸٢�>ڶno݂�sS��Al��
-��{w
-e~�����띂��U�
�z��G�#��;|��f[�����(�m��=����0�S��3�ȥ���|�E��Pi(�?3�m�,eE$��F��G��
n���*��F�&2q�c#k)(��L\��	J�iL]
�ȼ�́�������Me�ܵ��s���Չ�}�����7 y����C�y�M��#����g�Z,Z �R���~�,�%��v#�(Q>��0� ��4;��
��b)�B�A}�&va@�K����GS����
-$��k:;#
-�-/��_7
o�SyoG�,����yR�������ȸi둵�j�L�K��W�NA�g&|�P�M���:l"kT9�YE�?7�����42�(a��BE6)��]}�[�#�R��n�L�d�p�͊f/	�U	�de�����[����'/rP	NHur%�ض��
����A.�C�
���c�3[
�
�ִ�P��ݑ�
��3���Sv.hgy\�K�g
��
l�Ȃ�A�٨�yRI��@VS�c���S߀�:z�Y
^�υ���E�g"MU��9��$��6Vu; �
�Uc��/�#r*s�
�-�
I�\��pD�L )�@�<�����i�Y��<�

. �,DJ'i������|f��1���	�T��6�jdj����k��B]�Ta��P�C�?�dҖ���
{���
7�[��#>��so�/ǚ ���s-��
ؓ^�e����T�Q7
�����J��h �Āc2�҂����d��k��"��R�A��I!'i�Kl�ň�Q?)�Y	d���+@� &������ٌ;��w]s
��A�B����

��~�eP��%�ދ��U��Pp�W`����
�]�:Ѕ	rz��֭T�~��BS���XmHǡ֢pB��^�ۨݪ1\��P�`����E ��
�%��mj��̇?y�
G@�h���r(��{�0�X�0Ч�$��կL�6���S}n��.�p`*ݧsG��Cw:_�� \�i�
űc�t+Y�
�'?w� 5
��}��;�v�:�
Fͮ�T�ܤ^�,�40+P&�:���m�.N��P���*�8pSL�7
k
v8_�껊�Adsb�=e`�b�K:+ep��J@��Ҿ��@�2D�)w-[]A�t�Pߠ
-P�򀵛�;q�]Ɗi�D�P�}�M��$��Ad�k� �I�R�\�!��=�'V ��4\�g�����J��/nǸ��E�����0R��	Ӏ{G�
�K� �:QjƂ�}XS�4v��&MżD�o>�٢L��L���?^3�R���,!�����}a!g���CK��p�� �W�7 �d�A
��#�U�J����=Z���
փ��=7`���r�_Ѝ�Cᚡ�������Z� 
�&"ۂ0M����
�50W߂7�ǢقڥX`�=�f�Y��ƻ� Xb���CZ�ce�ҽ���Mh}���
c'r���=a��"����J(!�:���4�S�զ8Ƨp�Ԅ�'����I��
*��$wg ��WM
I:'#
%��_�3�ph:
�	X�4�;�~:t��lÅS4�;��a-��8t����GS$�n�S%����Tn�0e��E|��~�y�^N{
-4q��؍{D8�n(
�\�l#p-���P���
4ܻ4C8���!�&7�@
uN��/�|�/\>�T�\��
ފ�\�R���
�ǜ�#�;-�r$��4��2,�`f�<ӈ

(ѥ�?�9�j7�}#fF"��
�c�-�N�%�I��vk*X������n�
Ɏs�
��ܢOm7�Y��a�=v�d}O�ϑ�I��� "��e'���p�[��
�x�N�uZLY`j
��
-�
v��L��̸}�;���*�UY$�,#�
�3�CG� ��%kE&
絲
dp3
A����y@�
2�KdU����!
-�l�f]˅��X
�)�>vrX��W��b]�[n��
�Di
\$�һ��r/��[1�E	Qף����!���ў9֡����ܗ����g�_�j
-܍��k'���Wh�$
-+!K��t��zc�U�͘��(��%RN��ԧMa�ωD���X�D{
����Ȓv_�
x@�M"��	}s���Nn����ז2O��q`R@�}9�c�4-�$s�
���W@��A�}��D��#Hv󎆿��՛��P�*��|�
�i҂����$E�J8�k=��jcņx�j��`Q�mP
@^On
U�lX?rΈ<?��8���_@��mR�U�ڴ�<���;W�n6Fke{�mÉGS�|q鵡X�55#'~d%����M�M�)YM�'l�A�g�ay
-K,��0�80���1�i��� =���R� v\
��w��O>H��a�
�@�Q��a
-�]�Q�H�����s�P�F3R����b}�X�T���
�C7-���K�
�������K>�NO��l�������*a��!���\�.�����6떜#w�}��ȹ��b���P�wۄN���Y�� H�X��
*�A��,n\M���	㪥Z<gC��һ�n����">Q��
-M�Wj�Hz�!�lnh�Wmx��Nr��'�����ܼ%K?tQVp�^څI�˧����R��+�*L$
G�Tu��p�}��
��J�$"�1՝s򳧧�фX�Cz�
���7��d��*�+t+H��X���x
��[�"��\��
$�ez�d3s�G�Yb�"���u�b�����)1�w;�
?�̚���6�n�޾z�O,�
H[���V��8���W�^�:�O&冞�k�{��O.ڎ�	߱��9%��&A��u�LJ������I�Qn4nt�0�
���c�O�V�bo� ���(������,���&(��H!\3�@
���%E̯}o���
���p�
�n��8'��4-����
b�W���3䘌��HnR'r
�t�>�^���_L_J,i��G"
�D���Qs�
�;�ϱ����
�m�L�K���MqI���+�r����
~ �2�O� �z)�o;� �c4I���"�љW����
\��V{���4�S?�'~VS��=������]
�S�N�}y��w!��`[=DH�ӤHӯp�1~��ar˰�
�n�@+
-��P\
5Qė"TV�ԛ��uO�f3�S�o��bg}@��Y)���HR5ryaa+��T����Z�
)6yR]���$��Dm4�%�t0j����g�b��}�v����8��)�3a7�sۻn
N���e��%��`J��߷�l�'�o"/��I�^��/�
7k��#[� 	��*��"�H�_cd����	�m��iRr�X�ZUφ b��k����~�J��
~ݐ�OrSP���cF P��`�?a������_?36�.�to��>�%�s�b=xd��o|�W�-�L����������g��-������H*8G	p��	`�8r¼k
��\ '=�S����
�4Fш�L�~�kx��7���w���/��
-endstream
-endobj
-1011 0 obj <<
-/Type /Page
-/Contents 1012 0 R
-/Resources 1010 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 982 0 R
-/Annots [ 1004 0 R 1016 0 R 1005 0 R 1006 0 R 1007 0 R 1008 0 R 1009 0 R ]
->> endobj
-1004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [491.531 473.228 513.996 484.131]
-/A << /S /GoTo /D (index_BHRZ03a) >>
->> endobj
-1016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 461.272 121.432 472.176]
-/A << /S /GoTo /D (index_BHRZ03a) >>
->> endobj
-1005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.089 277.611 416.057 288.515]
-/A << /S /GoTo /D (index_HPR97) >>
->> endobj
-1006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 229.791 126.971 240.695]
-/A << /S /GoTo /D (index_HPR97) >>
->> endobj
-1007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 188.256 242.088 199.16]
-/A << /S /GoTo /D (index_CC76_interval_widening) >>
->> endobj
-1008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.64 188.256 327.726 199.16]
-/A << /S /GoTo /D (index_Intervals_and_Boxes) >>
->> endobj
-1009 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1013 0 obj <<
-/D [1011 0 R /XYZ 89 770.89 null]
->> endobj
-1014 0 obj <<
-/D [1011 0 R /XYZ 90 565.24 null]
->> endobj
-1015 0 obj <<
-/D [1011 0 R /XYZ 90 560.105 null]
->> endobj
-1017 0 obj <<
-/D [1011 0 R /XYZ 233.411 392.694 null]
->> endobj
-1018 0 obj <<
-/D [1011 0 R /XYZ 90 374.387 null]
->> endobj
-1019 0 obj <<
-/D [1011 0 R /XYZ 90 308.187 null]
->> endobj
-1020 0 obj <<
-/D [1011 0 R /XYZ 90 230.787 null]
->> endobj
-1021 0 obj <<
-/D [1011 0 R /XYZ 484.168 191.409 null]
->> endobj
-30 0 obj <<
-/D [1011 0 R /XYZ 90 173.101 null]
->> endobj
-1022 0 obj <<
-/D [1011 0 R /XYZ 90 116.864 null]
->> endobj
-1010 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F8 794 0 R /F11 613 0 R /F93 763 0 R /F32 764 0 R /F101 862 0 R /F10 765 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1029 0 obj <<
-/Length 3828      
-/Filter /FlateDecode
->>
-stream
-x��\ݓ۶��Bo���o�I�N�$��i���郝�D�1֑�Hž��]`A� �Ɍ�
H� �X���
::���ً�g�O�N�,'��zv���t�ʜ(
O��������̄��5|d[����W�]�2�.�������+:c��"i6[�^����V��͌�g�w���Lr�����?/hH
-�R#��7f�'_3ʂ>�d��*\���&����g�!$�<�{��
#:���PE�H��y߁̙N�'��yr��5
z��p!������y��
-��W%�Ai��<�%��z����Rl�eS��n�TR��iJ8��ݴ7����|��j;|,j$��W�&‚��m:a҈�)at���=k업�Q��C?�J�<�~G�ݟ���K�_>��:B��D{i~C)�P2��a�Q
%��p
㴹�;���M���8�x�nv�ɛMd�
�4њ���R8��- at -�y�_�D���0/}���
���f�H�IG��U>��ٝ������ٰ�G��Ғ}��0By~~e��g��(�1�Nq�Bs���"᠏
Fd.GR��G��)�
������P�H.o��^B��,�l
)
�9��[�,پF�]_�uݸ�/]��Ms}��AE�	Z��1҅�6�V�f|�hrS�x��7�d�1y�
�S��R��mx
�(6l�.��i�O��h�c�gD������б�i�|���x\r���4�Y>�#
-�zs�	�л�����a^�vQ��D ˶��c
��CԈ�\yͳ����̘��h�T�۲��:Z��8�"��`�`<�i��<SI[��/�kl�1����ud��d|� H�n�zsΔ$l��2�sF�B��X
;�'@g��
U4f9,G��R
L�9Xسv����
-�
i�`���k���薛5.�^��#p���bܽr�Y'^TuD��`�	
�Jp0Q\@x:�ƪ���!50�@�!SAR����
�H1���9����B2�*�xYۦ���1ί�V>���]S�x_���ed����O�m?��2�p�f�es�i�����W;��	�F�4���Kv���46w�
hPy9 ^��a83,�\/W��~�^
N�PcF/�ݮl�M�2��2�PgZB/��h�*��u��G���83(1���@�A@�����H���S�
-9!*�� �4&-r*�Th�d���_d	��޷�
p*�Q 
�GЀ�m{�hdx��ɷݭ�G����E%/ա�
��d�	�g9`D�`�Adƾ������Z�e�iZ+
g�F��Ɂ�/��(���s3�t�'l�e�-vj��%ɫ�����
����
�ϡ;K��m�
���&��
�q�
��X��Zm[b���ߑ#ފg�x�2�&��q��^�:�
����N�
-����Q��vp�9�Q8�>���ǀ�Jq8�Q��^�
�O N.�i��u��6S� ڭ +�7����CNd�
-��>�p�rq��:��P��uVW!�\L[����ˀ8�#�y_���Ae??2�<;w�W�8��."a\(=H�j,�0z4���G�@�v	~���\�d&`�Iz��
��a� �_F�	�392�q�ɑ�
�]j(��Yh��r*�ٔd>�xռ�'S��
����m��IYYo2�%���Rtge:N6ø�0p[v�Ҹ��f�7�j߱�j-�U]��&�;�q���
���Ug��a;`�RYDzW�ٙ8��������$c���N�rz��0�iDm����D�4,X��4��nv�`�A?�b����b� ���/V�mY����&&� >ZD�<C��X���tQ�

���h[���
z�5��� ���I|4%x�,�D*�� ��r
~D	"�;���
R'�H�IM8�N�N���ƹ�H�B�Ľ'�E�ؾ	*N%�r���J�.�s4���q:�p:�臭����۲�7��J��b
BA�&��q&�ػ�9�MJsy�����r�}`��:��}k��Zء߾v=���01����ˋ
P��*S�1�
i�PTc�`����ժ���噛n�z�
�.0�a����0�ƒ��WϚ9�`�aZ��r'|���$�5��f=4M6�ծ���'�]c�� ���^�
����'�~dkg�� ���@U�<yQyɨ�K�n��{|��Me�,0�D�+����Drz�e�^g� t:��Z ���4B�v��@�O�>6�z
-�)x�<Ջ�}�\~:�)�v����&���:|1	�")$�$s�d��9L99�Q���$
�],�4
-�� ��
��!�^\�^���
~
�'_�D�a**
s�)L�������
^L
-u�ي�nۀ ���ESR]�v ��4����-�%:�z�hi���h�����eWl(��oR��2�D����H��1���X�3�8�({@��`��
�(e�
�}� �qG���
T.ћV��FF������:���!n�
-�5n-�
-a�����Td���З�ۍ����%���ÛW7�����s��|�����7������w<�gs��wE��+k��Z�o�]���/�������ZP���ܔKt�찀I����>
��c��}��x������{�p�	�|lTzY��A�
��dgց�#̝AW�
:��S���M�%s �q�4�r��=eo8��fs���o ���!�L��2�iz$~O��0p�s�]�/]r
������p�u�s
fڧ�ঽ��^,�����2�s
K�1�ν*��
-��j�g��V�����:8���s�Ls���
�S�+��g��J�e�^'j����7d���\��|�	j	����$o�}q;^���lx�χw@4
��%�����E,; 9��$e8�����Pڏ�ݍ ��@���۽r9��n��ؑ.f*��&ǖ��#l���NtI����4z>1H<��Xs�T#���������!#�p*����FJ��=���B[
-b��Q�K PӃL4��&���0@\A�˲d
�F d���-�׫m���w
�w� 4B�sU-�6�F��>^w�~�I�"#�f��V��ٯq��IO��;�
�<<�y�
���zZ�ݧc�
"Ms���8�4stq,Mx?�9{��;�����_lDs"h�4�)�?�V��~�9��1�����}�x��a��l�^}� z���#��=�g��f�ޘqΈR��b�=����8R�r�Ow�G
-�y:9ܷ�o�C�V�m���Br�3{rB��4|��o�|'������I���J8�I�b�9p
s�M��b
ܦYX�KU������j�:��a]۞,Bј�;$1�ƙ�#?��
��t�S��x��l�&�W����g_�
-������Sy�6{؋��1��➹돚0����?s��;=G��l��Y�J�p�=7U
���f
d_���k!p at oV��銗�h� ��Iw[��p����H1	�̗17_�av���9�z� =�pGL2o�
-A��e�| �O��|�{�'��"Ze.�>��.��~�G^@z��F�_�J�1��F�9h��02���H��0���>�H�q�x�8�ڟ	�`�=����[�h�9�?8j�>F���ϕ����C��� |�"v�
;�?L�40{��v
V
|�{��=�P�ۙ���|a�|�����e��kx�[1�����p
o�����e� -��$���	jn�AXs�����Os�gW�Q�{<�LmT�Դ�@##�wF�jN�We�X�t�
����g*�G�� �M�m?}��jݖ�5Y6��Ω�8�	�A� g�Mo������t�y���z�
-endstream
-endobj
-1028 0 obj <<
-/Type /Page
-/Contents 1029 0 R
-/Resources 1027 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 982 0 R
-/Annots [ 1024 0 R 1025 0 R 1026 0 R ]
->> endobj
-1024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.462 470.508 244.342 481.412]
-/A << /S /GoTo /D (index_CC76) >>
->> endobj
-1025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.855 458.219 194.766 470.174]
-/A << /S /GoTo /D (index_BCCetal02) >>
->> endobj
-1026 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1030 0 obj <<
-/D [1028 0 R /XYZ 89 770.89 null]
->> endobj
-1023 0 obj <<
-/D [1028 0 R /XYZ 90 554.153 null]
->> endobj
-1031 0 obj <<
-/D [1028 0 R /XYZ 90 554.153 null]
->> endobj
-1032 0 obj <<
-/D [1028 0 R /XYZ 90 537.754 null]
->> endobj
-1033 0 obj <<
-/D [1028 0 R /XYZ 434.16 461.706 null]
->> endobj
-34 0 obj <<
-/D [1028 0 R /XYZ 90 442.816 null]
->> endobj
-1034 0 obj <<
-/D [1028 0 R /XYZ 253.525 365.109 null]
->> endobj
-1035 0 obj <<
-/D [1028 0 R /XYZ 90 348.61 null]
->> endobj
-1036 0 obj <<
-/D [1028 0 R /XYZ 138.148 196.139 null]
->> endobj
-1037 0 obj <<
-/D [1028 0 R /XYZ 90 178.926 null]
->> endobj
-1027 0 obj <<
-/Font << /F73 552 0 R /F24 529 0 R /F101 862 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F8 794 0 R /F10 765 0 R /F32 764 0 R /F7 795 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1047 0 obj <<
-/Length 3299      
-/Filter /FlateDecode
->>
-stream
-xڝZے�6}����r�F0@�ؕJ��}7k�ǩTe�J�$V(R!��g�~��
�ı�������� �값��n^��y�m�W���0^�ۯ2�J�L���V���ZI)��yW�U^ޮC#��b������U���:��܀Pa��7�n��QP)W�&5"IW�����r���WR�,]�w�N�(��,W�7���c�b9�O)���He���n#��V�����O�s]>
�f�ٷa4�*M��X�7�k
� ��:
uTP
����
uQr�,ѩ�E�F��QQ?^r"}"�ըKђ�m^�H஦����9ϒ�m+���So��V���������.,��Qo�ߤ����hȾnh��X7
4)�/�^�
U�U�8m�Ew�͂�U$�J��k��!��ǖ��ZG2��!��g
�:� ����ƶ��QU���BQu�i�!K5�����7)ê�{u9ml3�z=
���]��ļV�[(�Ѱ!�"�!�^:F�H|S%i �4�J{t��
�4If�M��5*
V[���Ǘ�����;��NC�쓈8d4��&uf`��C\�?�E��Z0.��l�K�#����`o��v���ʶ�^yE5�d#�ܪ����K���~<e�O��S�������W��yl�@���0Խ �'B�@��m��o���X���o;_Mډ
���rzP��v�Q�-O�P	�]q�UK�����(�
Z�?��Y��;�۰����#K�;�Nv�n�w��S�v��7�4>�� ������P�}�H��
��m�"���U*x\���R��
� [...]
-
F�!�!
���IE(����R�q�1O+'Q
�r��!�$
���&�-�H�$�}S
�
R��D�"�U *0��&@�&1�Z?W����9�9
-��`�r�d-7��ͺ�!V T����Lo�$TQ
�h��
\=�`����fDv���yC��r��y<١�T�3�mK��š���|��~6oy�����]
���)�*�.鎔7�1(F$����(>��!> ]�NLD�I���
6W4
\TeZD`cv�ͮ]/��M��PQ:&�,�����zpQH�O�)E��ќ�	
-h
:1?aU}���4g���\IƃBc�Y����
��is�͐�������>���?
��t�ͷG*
I�\Q
²
Dg!9�h�ĄP��Meww
�h��K&u��7!�
-x/��w��E�$X<M�`y?�8�)����
kp�+o�'���PyQ���y��}>��hC�OC,�H��af��am�c�x�
��ۢ���C���~����tTs
��/.�kP��^�\�F��
^���3JkPh&�v�����tn(P��G>������_��ө�/�:�tDG/f��H�K��(���R�����椮���� dXd�'�N3�4��- N�zn�qa7r��>[�������K�wʉ�sx�'A*���9&��~��r���T���h\�`��iy�j6ww.�ƹ���3g�j>���+�j���
-�rq�d�Ѓ(t�%���뮢��X_G_���z�
�<o�Kl�y�!�������GY�2�
���XK8�ÑԵ
��n5��v9�B'8)�:��v��
2$i�.�Uۥ�g�a���|V!�q���!�
�c\�rSwi*:�be�&==�
5&?��u~G�P�\<���%��0���c
H~�� (OU5�[Z�^Z�`�#��2S��v��� *�Ў�tdT2�F���Ͼ�&�8�ZHf �2v��
lKef�bd\O�t~���^
��� 4|6u�7�,z):r/m����#���n]�;X�d���6�N�K���O�K�
�������Gԡ�CzcwK^�K̹7�@�)�#��?���0��|�%8��
6I=S��a��4�
W�pu���xE��2
-�|��!Jz�U�=!q�e�o����O_8���p��Bh��lr��f�8�Fr4�,6M�<ҐQZ�C�AѾ)\�
��W�k
���{���P5�@:�j�Ip�z�^�7���H
vx�}��>�3x�4�"ꀽ��g��%'��:��ܝ������'�������4�
=7W2�-�T{)=�S�ʍ�KñbC�����L�`�r=R�ă9�yT�*�M����Nmʝé��E�ˡʞ-��p����
E���ijx~�
��F&���ҟ=���m�^�>zL��`
-<�k^�J�
��mg�LܮF绞��~���_��g=�
����V5��`4r)�<�|�n���{�픱NP`>�Wlx�*��
G����"Zsw�������lx]���{��Ck,I
����ݣ�s���^�y�5�]C=��ؿ��€k�pq�س͘��j�}^�>��/��O���Dlfgg�bx��X�n�>~�4M<P
-c�'�
�'��NR��ȋV�J���ϼG&hj��$
��`	�*�M��8U@�����k�y�����1�ēG��nGW�:3���&�O#
fyx�����Ki�w��A��&�Aߢ\fB�0�Mq�f���t�����|���3q�����i��
�/�N��b��+V ��*�{h.L�a`����.]!>y I�L��|��f=�f�P��
��
_�E
��j��@Ki3�'t�=~�Me`��޴�d��ҙ,��)����l���ܫ�%.w��w�_�"����
-�<��c;�
Wo��+�>���y�
�߉eB����gng���xM��v���
��;�/��E&�W"/@�8	6���7�xe8��^�h"��f�f���w�[�*Y:@z�!���<�z�8
]��JD:m��;E�J:Pwv���5��D �]���D){ed
at4�k���$Q�m�_V�tx�#�‡ZHeq�\�
J����!���/&�~����/z9�'=�@����WHq(�P�WH��#g���>rVM'�So���
-?���2 F�Oyu�<�����&%$��p�&�OB����Zf$�2�0C�8v����g��R�Al��u��#�����s�������sy=�D
�eM�2����^�$t=�e��rųNz�u
-
>��?Y��
-endstream
-endobj
-1046 0 obj <<
-/Type /Page
-/Contents 1047 0 R
-/Resources 1045 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 982 0 R
-/Annots [ 1040 0 R 1041 0 R 1042 0 R 1043 0 R 1044 0 R ]
->> endobj
-1040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.191 295.569 208.619 306.473]
-/A << /S /GoTo /D (index_CH78) >>
->> endobj
-1041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [413.494 295.569 511.506 306.473]
-/A << /S /GoTo /D (index_BHMZ05a) >>
->> endobj
-1042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [460.906 254.035 492.786 264.939]
-/A << /S /GoTo /D (index_CC76) >>
->> endobj
-1043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.084 172 458.091 182.904]
-/A << /S /GoTo /D (index_BDHetal05) >>
->> endobj
-1044 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1048 0 obj <<
-/D [1046 0 R /XYZ 89 770.89 null]
->> endobj
-1049 0 obj <<
-/D [1046 0 R /XYZ 121.551 657.62 null]
->> endobj
-1050 0 obj <<
-/D [1046 0 R /XYZ 90 643.362 null]
->> endobj
-1051 0 obj <<
-/D [1046 0 R /XYZ 480.711 366.809 null]
->> endobj
-1052 0 obj <<
-/D [1046 0 R /XYZ 90 350.494 null]
->> endobj
-1053 0 obj <<
-/D [1046 0 R /XYZ 90 326.14 null]
->> endobj
-1054 0 obj <<
-/D [1046 0 R /XYZ 90 272.655 null]
->> endobj
-1055 0 obj <<
-/D [1046 0 R /XYZ 438.959 233.277 null]
->> endobj
-38 0 obj <<
-/D [1046 0 R /XYZ 90 216.962 null]
->> endobj
-1056 0 obj <<
-/D [1046 0 R /XYZ 505.567 133.618 null]
->> endobj
-1057 0 obj <<
-/D [1046 0 R /XYZ 90 117.303 null]
->> endobj
-1045 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1064 0 obj <<
-/Length 3948      
-/Filter /FlateDecode
->>
-stream
-x��\ms�6��_�o'M#���t�zm&=_/m|s3m���i[��"�N��o�@-E%��:7� �������g����N^������w��Xb5ד�����BZ�4�u=�e���׋�'B¬������o�x�;�������脅�+R�����_��n?�DX3y��&�
�\Nޜ�xFSQ4��a,�y^��rϿ<�4aT�r�	#�LFb�m��\H:��fR�Ң
�c��մ^ SH"y7�O�,E���0 {fI�a� 2�KF��͘�nv�97rZ�Ww�JL���j�Qi&+#��*Y,щZ}PB��i�щ&�ƍPD	5D��Y��##'�lԜˢ��E�&'�7�@�L���1
�z���\_e�W��ՈQ%�Dv*�|1�3�	�-�
��U��,�.���
d�|������;�/6��"��f��,.`��<{RMD��
l
-翦
�C0tS,�^zK9C��o'3�3"�
?�A�2DI3I]�6�
T���u��Mp}p.��� .�Ra�Sk�ߘ$:>�r��J���^mַ��j}U��w3QL�e����Xc6g����������I�-k�I3�zK)_W�a�����.j D��	�ZGO��&�J��K�����A$<�


0|@��0��~�DR���L3�
c"�L�! ߒ�֮ ��f�����L~��c�/\i
�"N��J�g�?l�N~؟�U�_�ؖ�1�����\cL�=���{-;��� (�X�U��
�t��Ք�"��͡[0�S�bv� �p-�M<�Ȕ��=@K
<&�/��xW��"2
-4P0£�P4�o��m]&@�\ᙣ6�}a�t��0j���g].����M�s�b �Y���������v�
�]�
�߁����
L:	LN�10i\�K�E]���8� ����RE�"����*L�{̠�� �:
&���GTu��a ,��/���#�����~��C��S
(�@(�G�
��DY6�d���D(�3R���!�l)��1�.Z�k�}(N��~w(�;G:
119��<���I�z���_���T"maSZ���QgvLo�
݀~A,��eYWA��ž��K7�c2���E�s�
-)c�w�5�/�5���ѝ��uu��Pk�Z��x"D#;��Hƒ;�R�$cy��p
�#l����O���0��X�
e� [��F�U�"����c���q5
����>Bd�.K��C8�YC�YB�}3a9( 
�'NHŧ��~R��iɚۂ9Y�ރ� �4���}O���H��&�y@����f��YN6�q�d=�Ee�{��X�D�pslSҁ��Hv(NV��C�2,�fbE
�OS�,�t����~�p�]]!�h��Ų�p�|Xv*'��JS����J�д��w�u�y�% ����<sf�̌���U`���+�^'
 �s���n���f�r���ôMշ'5�yH�t[��4 V�����@[i���vkgils���UQ�dZ��$,1.\_t��sF���~s
�����v�p�\N7��c��~U-��0���DCHA	�1�}�@�`-aݝM�TZb
-2`51+@��e���F�Y�<)�p�o�žjj��iIx���Տ��Za�Dӌ�T�L�SњaC��cC�	��s�>bۏ�v��^�����)
b���r(�4� �ȉ�N��燋Y���ё~=�#_�ϝ
`k���yAH����� �5�pYo�+�2j�a�@���
��.���q�]W��nq��j��!/U�>V�gÒ
-^����$�\����=����f��	��U�14q�g=�@B��mTv/���ʣcP�fU�[IAL���rp+�~x/%���r�l���[�\�v(��[�
-�Ⱥ�ގc��U��-E�ƈ��8�m�WNb&%1��_
�-Pb��� Q	�
-���z�/` �d�pl���"�IKk�&!�Q��,;��I�A���f�x�ѽl $ĺШB5�ۋ�n.�`�z�_�1&f��93�&9gA+�LJr�]VϚ����q{x���e�w�#�u�v��R�Ao/��'�X>a�6���.-�B�Q�L�!��),��U!y��UU���`��kY�
-B���?�W�CO�5��-�r��vaԧ��Sc�d��l��b�>�@��D��_�
�;�w�@,u _
���x�/��
�z��\U��r�K��Xg����P~��|mU|
Γ]L�6��WU�xp5_O�?M���v��������	!�[���0�����v|�حØ�k�W�����~f�㿫�C� M�R�%�OSj4\�pє�e�����*
- L��j�Tt�Kh뙖��U4��]�|��F)0��V�Ď&�9ܐm:��B�̏�
xp)2��eJ���B��
--HL�g���i~�k�����u�y��m+���Q�6I����ʊ���Ek8�T
܅��B��������r�I�����v6g΋�W��\�|�i5mvK�+w�V7���)�rq{�}]-�xk�9V�|��S��Nj��;=�K0�[y�N�
xC�zN��|T���D�=�lw�!���e�����C��1��0�	�2%�m�΀Ũ^~�j�K�@�ͮ�/��Dk_�V�3��A��j�O�	�J�#U]SY�A1%��Wܯ�z��!�I�W�w8������j�� �ԯ�����r�n����]�m���DŽ�
���	3�rO
k!L�����$g
-IH8K��P�%�M���y~�>t�(��7qx�X����ա$��g$4;L )%
ׂD�w
��1��<���4 �>W;�6�J��!`�mO-�FR��*��ɢ�!���m����ij�xL�ےR�Զ�7�z��8DW��5b3G��r&�PZ
K�?��1

h�u��C'�1N_���-A�ț2�PO�WH�
-����z�
��Q�\U�D/\�Qs(�ۡ	�]���@s�����Ķ������f�9mg��[�X
�C[��:Mpl�+
 �.b� x&���Ȉv�A��4|]E����C��+	�zvm�L
�Ew�+��tN��J�м�.
�m�;k�D$
	�D
4x�:�^�tN
-���0��r�(+֐	
-��H
�
��N,��x��*�%��\��>��R?�z]a�R���G(*;�o�u���
p���
�!
��8�m�
�$�(��B�?M;|Z�k���V��*�:�����q<�:m+�Q7n}�[�n"R7�P��3*E��u{=s'��rU�
�E��!偋�E��4F�z�.�t*ms?�|�|(�`�����:ƕm4�& 1I��*��\�n��!�
�u�l�XT��h=�z�[�O 
�]w&rX�uFÛ9�6��
N3"�����詗Z��FVB�+X�q�	�װU����.>��
�K�M���]���B)p�x�>*�'t}ǻ>AZ�Y��γ��=
(V|�q[�Α����Nṟ,��w���A�\_,9�
*1�Yp�b�?Q��xO��z�i/���5m�6��/����aB��h��[�� ����p���'Å��� $��Y��=�Ѹ��8Y�`�{�.˃����_���(�	:��,�

w��Ԍ
+?� g���� 瞠{��`���m�0�~��l��P��x{I�
-`�3�`�r�+��
-P��o��`�R\ ���`�8

-ʎ��Pi�Ba����EŜ��V\��	
ր��m`�p1
����oQ
�I\ΐ�}u"
jɝ$���
���z`�
-��o��_
��K2����$p��O���}-��3�wg�$��
�%����7͍�Vb�
L������x`��
�̀��v���`����p���e�Դ!��(��mY�eRmwqWB`��\�a�o��QU���N쿻�
B��(I������/�?������-��0݈?���[{����6ق��������
��
-endstream
-endobj
-1063 0 obj <<
-/Type /Page
-/Contents 1064 0 R
-/Resources 1062 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 982 0 R
-/Annots [ 1061 0 R ]
->> endobj
-1061 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1065 0 obj <<
-/D [1063 0 R /XYZ 89 770.89 null]
->> endobj
-1066 0 obj <<
-/D [1063 0 R /XYZ 393.496 576.359 null]
->> endobj
-1067 0 obj <<
-/D [1063 0 R /XYZ 90 552.631 null]
->> endobj
-1068 0 obj <<
-/D [1063 0 R /XYZ 322.875 352.393 null]
->> endobj
-1069 0 obj <<
-/D [1063 0 R /XYZ 90 330.021 null]
->> endobj
-1070 0 obj <<
-/D [1063 0 R /XYZ 222.161 245.362 null]
->> endobj
-1071 0 obj <<
-/D [1063 0 R /XYZ 90 224.384 null]
->> endobj
-1072 0 obj <<
-/D [1063 0 R /XYZ 90 66.713 null]
->> endobj
-1062 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F32 764 0 R /F24 529 0 R /F11 613 0 R /F101 862 0 R /F10 765 0 R /F98 863 0 R /F93 763 0 R /F1 833 0 R /F8 794 0 R /F7 795 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1079 0 obj <<
-/Length 3527      
-/Filter /FlateDecode
->>
-stream
-xڵ[�s�6�_��>��V>	�7�N[_���N���
�>Pm��HU�.������$@A�Ӥ��A`w��]�tv?���o�\<�^�YA���7w��δ,���i9{�1R\��4{U��)W�s�hv�����oo~�I&�spa{/����
�t�pRE��ݮ/��FgK��iF�(����I.�w5{}qsA=}�pe���S
s��2F�%ʓ��J�q��V�T�r�n��U��V]��
c��~�g���2t<�s\�?��fvv�g�ec:���}7�2�=�m �<�Gz��v�>�^�`-&sh�^��8��tka�M`�fsFd!q��("Z�x3
�m۵����R��=��~�U;|��a_��c��ͮ��>�lSn�u���]ϬghU7U��.���}�u�2g9'�1Ѐ�R
-骭�tTI��:�{�Ů��}��{�岾dYs��%��b�m�^�
�{�؂�t�M�q��/�k=U���A1K��Hxsrz�.����F{�Q\~'K�7w�\�>U�/
-
�U��*�ϸud�H��{�~����B�"
^�^�n�\g7�7�^&M�l�Qn=���HϨ׳n�>a�)�o��� 9�OZ ��y0ʊ܍�27W��w�Q��

h"���z
h��ۡ�$���W��q�����%8��j�+U41H�$H�a
��0��x����q��R���"�_"��p2M���n"�_)��Z��e�)wD�_��պ��=Tй`� I����		%�݃ot��E����k�l\실)X{�>lj�U�����n�]2�L�y�w���/����n��  ���&aJL)�M1j�\j��sN���Ս`L�I-�g���	c�m�m�*����
�}�Db��F��x�(X\��� ������\�"{����(~�Є���k��[/���j�85�����|{�C�+WTMWr�F@�F#���|�߬���C<���4���V��ᬂ^�3����1nӀЮ���v^B
�B�S!VU�G�����[��Q�S���~�\���x?��nW [...]
{%NH�D�,�P�E� K0'���`19�m�:!+ 7�?�
�
-�h��#v�@>��
�.{��
Dv	f��D�)Y�;0!
J�#F�}}.�X�#iQ�
��PRDN~H/����F�6��>������|p:�#���1
�u��<����1
-�����`a�|�X���i�c�:{�S8��%z�;��۬�]�������Ӹu)
����x2�����?�3*���#�N��mB�J��"Ca?OY%jT���HH.�D"�:��	�gp�~�I�������:7�y��$f(`�A��}��� �
-F�j�=x
-�Q
�*ƢQ�F ~�u��˹ɪ�|׋�(}� /�l5�k\�Z�ش�� �۶������BE &� д1�|�'A�s��>����5,r���M�E�������m�+ (�������1\�T��b�t0�q
��))!����
�{w
Ɒ�"���<.��1��H
�*����%u�ȃ��K���r���@���NI8?.aH�
Sl�/�Gw���ζl��x�ծ7�><҇�
������W���=���C���~�uۥ�6��l
MR�iҮ0[КP3����
-�?.�y��]�[�r�r(#W�
�O3}q��H�������(Q���N�葒�ÙcY �8jԧN5��
���qA|����P�I޻ �
i�"��CLN��qe"�A�L�
-L
.��F�TIT(A�_��ezJ
YO��p�'(C�5�A	���G�.��,��,��_�q�N���w�
���n��xbƎy�G� 
�L��[����S�y�fM��RF�6�#j �
-�djn�.HA��%���K��P'�H��ŗ�#D��u
 &+"�}(g�%��ء�A�VE�Gh��Z��lM��!Ih]Q��C���'�w����֣�v;�&�j��\��m���
@���4��'W"T��d)W�@��u�֝ Z3��9�#
 ��4�1�
��N�!�0��>��j��K�����U��n�?샎;[��ϯ�#��f!���6 �\J���N�
���M�z|���҂Y.��l��H��I�K�L��c*����|��
�K���)��˙"�w� �v�������<,�
ɀ;�}�窧�����˓�R`Lܜ��4@���~�.2+}�R-O�qS>\��Ӷ�h�[����ʦæ�K¯�X&�\
-V
�w�
,#톎MY�-f��{G�`&�[�jZ����w	����PT;�dw���W
��eX,�z����#S�y-R�D�b)B�	
�M%ڐ�
o
��I!�p���ܶ�U0f_����<���u��c[u�����d���t���~�����@F���������vxT�
� ����}m_�
�m�M
-Ͳw���k��i�GX��S��8־ǫ
�i��o���a��
�B[.֛�n�������j�wE<���QOgxad���H=���
-�x�t��e> @#�?
.q���~����X���_��[%��C�,���m�U��3i۱ެ�u<a�غ�N))n����M���^��e���J�MK�(�Ү��xAg�
6nI��f�x:
-���A��My����\��=�rዹU9ˢ^նX��(!��	�x"�!���l��r8���;��������Q��^�G�0p��S\��[r�|��W>�t�a|
��X?i��|6V`x�ğAL����<��@�m�k۴���C�E�ϸ_����x���UR�
�� �H	Q{y3�<0y��F�"�J�� �9��	��
�Ic=x
�o�I��vx3���񲅝�
-ls�;�����Ԭ�Ŷ�q�>�~Բ��w˔{��z�_2��n�7w�
?X��fYm*�����`����Qj�
$�
|�xGc��&�:.S&,\
o٫I�(�&�^�5O0m
-`)d3фkS�rK�o\����C���@��1��R�B
-��)�G

�9 
-���D����>lHǀ�#��S��=	ۺ}{��h��⻤��2�;�ޛ�ƺ��^�����׋����j��q�w�TF�dW
zփ�p��.��u�W
H�?�jbFW\w���b<u{��������t���X�+�
��\
�jQ2�ó?K�MU�//�
�
���g:���EY����I٨���P^�D
�
-��QCȤ�K	�e�#E�����w�x <o�u?"(
#G��������D�A��S�p����
Z�������D��1��]z��6��U����}��l���s+V��u�e��K� ���Q�~7�[��[�R��g��(v��WϞ-���+� ���*� T�8}�P��7��c8x@�?A��(#9D:/	� ~ʴ+y����^���g?����L�����q}
-endstream
-endobj
-1078 0 obj <<
-/Type /Page
-/Contents 1079 0 R
-/Resources 1077 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1092 0 R
-/Annots [ 1073 0 R 1074 0 R 1076 0 R ]
->> endobj
-1073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.832 582.067 133.366 594.022]
-/A << /S /GoTo /D (index_Sch99) >>
->> endobj
-1074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.954 582.067 292.961 594.022]
-/A << /S /GoTo /D (index_BDHetal05) >>
->> endobj
-1076 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1080 0 obj <<
-/D [1078 0 R /XYZ 89 770.89 null]
->> endobj
-1081 0 obj <<
-/D [1078 0 R /XYZ 90 721.073 null]
->> endobj
-1083 0 obj <<
-/D [1078 0 R /XYZ 393.867 544.019 null]
->> endobj
-1084 0 obj <<
-/D [1078 0 R /XYZ 90 523.034 null]
->> endobj
-1085 0 obj <<
-/D [1078 0 R /XYZ 116.849 405.797 null]
->> endobj
-1086 0 obj <<
-/D [1078 0 R /XYZ 90 385.506 null]
->> endobj
-1087 0 obj <<
-/D [1078 0 R /XYZ 353.539 267.576 null]
->> endobj
-1088 0 obj <<
-/D [1078 0 R /XYZ 90 247.284 null]
->> endobj
-1089 0 obj <<
-/D [1078 0 R /XYZ 127.27 182.844 null]
->> endobj
-1090 0 obj <<
-/D [1078 0 R /XYZ 90 162.552 null]
->> endobj
-1091 0 obj <<
-/D [1078 0 R /XYZ 195.948 98.112 null]
->> endobj
-42 0 obj <<
-/D [1078 0 R /XYZ 90 77.486 null]
->> endobj
-1077 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F32 764 0 R /F10 765 0 R /F11 613 0 R /F24 529 0 R /F8 794 0 R /F93 763 0 R /F102 1082 0 R /F101 862 0 R /F13 834 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1099 0 obj <<
-/Length 4908      
-/Filter /FlateDecode
->>
-stream
-x��<]s�6�������F
��d��ۙ�^.���>%�U�D˼H�#��x�u �!PҌ�[)W�$���FCeA�l=+����[��������BK*gog��U\B��j�Ӝ���ˌIU-�#��������?~�wW�x���W���EQ��r{�����
-���2�f���v�)��f���We�� ��B�"x$�N
w����e9���ׇv���
J�|��돦��اw�v�@�U�~+�`��lAy���|
�0}�t0��<6?�5�yLj�Mw2ߏ���ͤ�޻/�d��[�T�ë]�nw����\����ٛ�n[�u��=G W����
�fQi��v�/��ū��pvlZ֝m�q
��

���6}h�8�C)}�v������'�9��r���?�
/矮��7��7���n�t׬�uD) ��^p*�l6�k*揶�cc�����`[VM�ܷ7Ͱ$Dh!��@,�{wW_�0�r�ԇ�}�z"]�zӸ�����h]_�*������ ��\�}�l
�׻a�y��Y*%��!�X��B�e� NJ����,i�Xi�v[_W���B�'6�}����i�ח
�70��r/�,3t��������R�}�L�v��v�M�����>4��on���a�ۇni�0LA@�)q(�Λ�f_�
H�
��]5n��耗��5����bf��J:n��{�h��7F=�Y�t�nq2��ξ��RA���m}�1z���'��`F��Is]ʙ,t�v��
`+8\L�_l���U!A��,G  ��kj��",���~��QTZ�����>�ܯmWʃ�
 �z�{7@
����C�:�|Y�R

��
�
NU��
i���
/IT����H b&F n2����Ȇ�����j�~�v��i��.*X^�V[�R���끫��a�I ���(?�Lf3�]
��E
-"�[Y
Ôef.جf
�o�H�p$�J�Uf��I�U˪�c�-��q
ؿ
+�:�c�.a1�pXB
r<
�
���8olF�厜�c�08�"�^�Y�.�$�¾�d�"���|�d�|)�Z4��Z�H:z�
�
��'�p�k��1�H	l̵��cud��/>�U :��V�&l��(���W`Xd�����j�|e?eE�V�h�.#z��T��
2
�
-�VC�

A���x���&3�6<�\�9:Y
�K�(��u�q�2®�j��egc^����h9�T�BJ�au4G7��J�/a~�����#�)-��l���-@B�e^��p�ӑ

-te/�9�T�/nƢ*� R{<(u2J��9��RR訕�5w��P\��6+njD�ω�1%ۜ~��#��*?2�2��/�7��S�Xo�B6�VFqXɢE)cőe�._P����jL:����`�e>�9OZ�X{Tz��,����(z����_��KТ"��~��r��8`d�O6Bg$���$kw��9^k{��y�t�:���?��
�7�
BAZ�4�`Gq�s�6
���nP߳ۤ�&��U�sۤ�gB�`���`�P\/���
��v����+H@
��
��\�posG��."�8FBP!��KIX`&Ͱ7n�џjV��;̋;@���f�Sa�f�ح�r~�A�#Xe��!'��a��]/��;
��<%�����i
 �7��Fo`0�s����2g0�u��FM
-܍�W�T�Q��-
C�:�6�^�f{�ٿ
d6�<r��X>�F�.$!9����?��S�Y��-fgI��p��u}

9����H�nj"�|�D�U'�DebPxT'�<�A��l�i���-�
-|D=˺;Z�/�?�G.��?[ �ia,��MH���	s� �C�Ƒ�I�bnXJ�f�W���h�~ɥv�k���,q	��T>M��yG���$���\�FЈ�
�c�����X_B
�Xf&�S�d�
�›o7
9��!]
	)_��|A���$v}l7�h�7���P���a����f�	���B���w�8 at U$G��VQÛj��(�5���7�΃��X��-f
ܾ	�L�o
\
�94�S�����|�U��v�r%G�PF��s6
A��
�Y�-.���r�MʼBV�z1�-.����� �	��]�Y�k��5#V�#g��)���I��T~���'�Oq�x���"��� �{��S�E
��}��������\%�.q�R�c�3K�50�������)�b9�NYP�1���)b`�6���)�E�A�a|�j��X���l9	n�[\��s���m���pY���Nx`�T��
-.�GY.�cI�Y�~��0�L�A���oy����V�P?e�U^��8��2�J�;�r��tA���
1���SݚN
�d�lF�Si� -�n����7
���
J@[4ūllqw�Oz�T��K����@���$	�Z<
�cn�#
��4�z2�z�^�؋i��
�
o�XO݀���	�����8�?'�#4uc�V��?��s"�nbr��y��W�r���gk�f�h�A
�&���͡���q·Up[���mi�9t�R�
-�q&�}���A"i|���sd���������B�ޙ3���F
��ڍ�ŵ�olOa�ehf���`W��Πs�G�֕$���U�_I�NU�}�i��ܬ�fL(ԟ�^1�o^ #H�}��8M3�ق
�d��A�
�iz>��9
�F�0�;�6S�'3��`�q"�J}��d�
<�PK�
	�4��ʪ
-�� ��+/{C
-��BV*f�n,��|�v���AK}o�h:��k�W�������-��kZ
M5�
�np�}����o�ۇ�J��*�����\n���r����J��
�
ki�u�sUU\@�s�1����&ۗF�'$�<7?65c6ĢPL�B
� 0�T���b��Vd��Y)C3֢*��
��k׭-D���x�A�IN'k*?���_LQ,��]��� %�f��]�G'�pZ_'Z�I�
�QI�2SN�������S�J1\S)����������C� �p{N��(ij�����8�
ӏ��f,�0
���MrW�##�bQQ�l�\I+�*Y�atz�u��=|,Wt;f�0g,�g�F��m��<�;���;w��`,eI��
689x��"����h�P��!�I�d���dT+-?� �}���2�����K��3gm�w%��e�؜�uk��+�o燛�ُ5�|�E�$,k^
��j�kF�^�MwȆv�ԥ���ɐ%_\
�&�����	�SS3
��ܩ�I�e������:|��~�?���g>L&�U�bS�(;,ɏ�k����}h�Ϩ�β��鿳�M���{W��x�������{�:�ր2�����A�>v;[��ߌ��$I*�ˏ�0`�B��!§�BNJ+���y��}�
� ��K�;�軚|9��r��f=�e<("����]�ޜJ���h�&��������D�0<��`.{N@�X��\���K��̲%J�b��ڗ�ǹG\zR����ϙ�'�O�Q�S�8�~S���M" yns�gJ�0>��$��t]%�F8�u.G����[L�$�q���.X���!$[em���\�sTi�e���t�VY".���E֢�{�\F�RgA��:N��h��+�BH>��k�ߛ&/P�/N�{��:�I~Of���§��NJ�A,
�qg �w�=\}i'��,8f����Y�c{
��P��NN��Ov=
�@hF�4���
-���z�
�*���aN�
C�@(M�4����S9ra�qz"!]�O�]ʹ�� lI�89VA������iH������%J"p�x�<��SV�Jo/^{R�##K��=�Sb�I0��MQ�+�tA�욆:TJ�X���T���N/����.Ν����ʥm*�H�xs0��qϓO��E[���)�V�>k�u�!�3о�?�G�[����
�)�ɭ���8��'W�)��iTR�΢�L:���	������
Wk��ˌ��Bis$��S�_�{`\�'��}g4�4��T2z��
-�Tĥq�g>�L�M�HzŠ���U����QO���d{~�3�� &�3f�x��/ЄŎ�*�(0�z�a����ҽ����ByY��FM<
� ��S��8f���g�PfR
&���[w��~f]b�Yxm~}�0��t-�0�ˊ�#�76xX�匯������w��!er��q�d�
m0]e�
vQɋ0�v9�j���6)��}�U�w53��|���Fi��fU��<����H���pgG��YF�
׹���.��/q��=�r�(���Ν��,�<�o�O���:�M
��hO�t�l!h�I�1�D{�ni��u5�9���ą��C���D�e�C��):�݄_�=���E��h����3<`�����#ϰЉ �����H�#s��B*��I}��7t�
���9��}]�)&@J~�FV4B�H>{R�H�X�psOKs�vmq�����6��we2�OT�SS�X.�U�� ��|�%If���>��ʥ9m�:�;�c%��	̟MSg4+���
�| [...]
-�p_Gz����>��s{o
�Mm�^�Ψ��g��𼵶?�t�H�0{�F3�M��<O��7�$�e�{�o��ʜ���Û6���y9|�^�e����`~������b�)X��P�s}|����6���o��y-������a��+�3�g֏[j��#��>)�ƭ&
�/#���?V'Bx�
1���p�����úo�u��m����Xk�/}���c^�ݐ_l�q��x����M
-endstream
-endobj
-1098 0 obj <<
-/Type /Page
-/Contents 1099 0 R
-/Resources 1097 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1092 0 R
-/Annots [ 1075 0 R 1094 0 R 1095 0 R 1096 0 R ]
->> endobj
-1075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.78 671.653 389.769 682.557]
-/A << /S /GoTo /D (index_Operations_on_Convex_Polyhedra) >>
->> endobj
-1094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.559 603.537 333.579 614.441]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-1095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.336 266.646 346.916 277.55]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-1096 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1100 0 obj <<
-/D [1098 0 R /XYZ 89 770.89 null]
->> endobj
-1101 0 obj <<
-/D [1098 0 R /XYZ 439.645 662.851 null]
->> endobj
-1102 0 obj <<
-/D [1098 0 R /XYZ 90 646.507 null]
->> endobj
-1103 0 obj <<
-/D [1098 0 R /XYZ 225.341 325.959 null]
->> endobj
-1104 0 obj <<
-/D [1098 0 R /XYZ 90 311.673 null]
->> endobj
-1105 0 obj <<
-/D [1098 0 R /XYZ 150.808 157.557 null]
->> endobj
-1106 0 obj <<
-/D [1098 0 R /XYZ 90 141.213 null]
->> endobj
-1097 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F101 862 0 R /F1 833 0 R /F13 834 0 R /F32 764 0 R /F7 795 0 R /F93 763 0 R /F9 879 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1111 0 obj <<
-/Length 3458      
-/Filter /FlateDecode
->>
-stream
-x��[K���ϯ�%Me�Ń �6�ĉ��8�����D��֐ZR����t 	��}�+�9�C@`��u��
�.�t���o�n����&:����n��"K4�)��]��d�����.�9M~,몽]qI�ue�ߛ������)��!�L,�����W7�xu�����7H������ǟ�b
��ZP"�Z�3�
	p�/~����¦t$,	����}�2$�]S�9����#>��_7�á���m�-�����^�v
�ܗ�&o�Ӧ8�;o�Z�G��”�	B
�r��I��tg�sQ$��y�����oo�\��Sa���%Ɍ�����ti�B��
ۛ'�$��A�{'+���#�%��&%��C|
"!	�'�."��u��tR)�i����p���uD���)�K�X>��N���)b��(���a�0%
-����ț��22{J�F��xf{�<�'Y��+��D���#��z���?��S���
���R�lo�	VKP�Xq"�}���Ĵ��J����H@�c��D_���x�e�¦���29�;��ܥb�P� [N�U�2o���f����CM�����ym R�C��eD',�E
]�z��n��,�+�
��&.�|�n��-zOp�Bs������(_[�����)�U���>)[��|���g�þD/o�u����ٖ���^�\l����D)l�>"��}��-�� �z�x_l��Y�F�۩7���EH���}~(�g�O—����o۬�O(�_�D��Q*3�iso�6ykzA��G�,T
6�;�2�д�ݘk�k��G(�&H����gdve�
�jS<3A���j�����_�4o��Ux̧aXӽ�~
Rd0jz
-��,J8�::c 8�L��4�
� =�6�%�\��:�������,wv..D�
���ߤP�SB7Hn/����F1=�%�@
ѻ�MD^�X��r`0��c���1R�8`J�%sk��́����1>�� �7�|_
�
T��={xM%-~=4ַ���T��+6�h�o�`��E���VIJ�d.��h(�yL0Jq�&20t��'$4
-�$�#��hXl���6|e
-$A%sTC
�c�H�����X����i(C��I�8���X�c����r��Z~��Gr�C��h:?a�V>����em��3I��'��a�bQز5���"�
�jߖ?��+�g^łW�Ą��N;>J�����e�E��K.�(X4`�^�g�Lo�grLC@�1{ą-��F�����X�wEQ���$�J�Ki,����>q��p��CVhd%IQڶ��c{���Ň�p��`��? .���$�������k����IL(W��Ic
�:����Q�C��N�%�����3d���~���{]0���@i�n1�
��4�Ԏ�|����C�rK�� 0*^�沈��ɉ�P��"�DZ�4�V>�p���
��ؚaf�V'�*I
����k�w,��W�{��K�����R�d�ޕ�(�GL��Ű	��WZ{�'��JUk��JVk;XN
�7��旲���Y_ 퍓�>���[�G�~޴��b\�i�$�kQ�M]�5H����~�
��)r
�r��j��������������
�n�QJ�w�;3�v����Pw.t�����m�����KM��#^�V�τ*��P>�"6:%t��a�cFo��Ѯ5�;hؾ�}l�Ńmk�CS�Eu�ՋX$
�˹	�hٳŕ�I�/+�ə�n�"g�	{��7 ����<Sk���\1W�7�4�°Ԍ��=}m�w5�FkC2�jC����DRw
 	J�lP��k�l�(]
�5�hz���<5���nL&�t�Ծ�C�qN��&�w%�J�e��G`:ʟ�
��;k:eA�`E8章��e���
c���L�u��- �pq&�`aDh�A�`Gm�޻�:��U:Ϩ�``#|�p!��z�
-��
̣��8�&�
\t�8˜;����S�w-	B�#Ho2p�C��ngp#f�|5�Y��h"vر�m��\ch�,'�{�]S?D��O�f��8d�}�r'E��
B`���L$�.b)<� .�
-��NCS��
$���_�� ư�ak�6!���v�Nj��-�
�J:�1�m��M-�z�rW"���eM��4),=
��C3!>7#�*���0T�0d���rs4%=���Ek
-�Ef���+��X8�6�|�1�:�1�X
m0�QM3��<��n�tt��(���ߑ�췙�k*�6�2"��)ڍ��p��F��
�d7�rG�5v�l����f�<�kn/��p�7�$���\G���<|��~_4���(�Df�=�eh��I���F�
e�ٟ�]U'�
ү�w���;����c
�4�|b�2��G�`lT��]��}��r�8r$ �<���Tm �w�48�@,u
�S����D̞�D�B���{�f�g��G�Y�HG�\�za6:w!��
#ѽ�]���Y��q¼��+�����fVW�p���0�xb��,���}��mW/�j��kE����In'	���;�}��l"�eۥ�V�.y׆i�Hd�
���`S*�~_9}���*�[XFru@�H��\|{�'�zl���!=d�2pr,\�h�F܈�!+�,/;�S\�1��&#��}d
&��
����%6̻k�V/m}/��]׺|�-���^�z���
-~�lw�Q��|�=6i����bP4�a�@^*��r&��>����!1z�b���K��g>
�T.H���hfX/����8_P-�.��($����\'�;$��I�P�H��лP�W|��Ռ���K�F�H�"�gv�:.�|�
-l�
~n]9��)�u�`B9:�$S�f��T*��9���$�I�S桑� <�&�B+���yM�	����2-�	L�Y�OG�<�*��:��KP��+V�w`"�L5��tN�
K#�poݞ
��Ǣd�<��Z�2F�~k3�Q��cHxz���/� �Y���3gfq��4�9�MC�g�M��,3N���P���_8pU]�KAFIG��my �LM�
u,>@��}�d�
�3��i:o�J]�6,}n��
TX�j��Հ�f_�'�mC{�.%�쑍kO� ��
�����4��n`�uյ�X	%4��A���L��6��FJ�������6]�
��l�0��,�p`��y�YT�y�y�wޅNAfJq	ȡ��GP:��9Q���ܾ5z����2s^�4J=�L�<�,h ̈�����wA�2����?�f� �
9_:t�a��[�a��D@����`[����$%"qm
}��\��7_W~?�}7�����n.�j|7G��~����O[4�S6nz�ΫS����s����E�����p�[�Ytw���
�'
-�	������x������V�ll�����	
�Ю[�KU�
-
>���t_"vz��*�4�|sC��d&��wo����� �A��'��W�Q
-endstream
-endobj
-1110 0 obj <<
-/Type /Page
-/Contents 1111 0 R
-/Resources 1109 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1092 0 R
-/Annots [ 1108 0 R ]
->> endobj
-1108 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1112 0 obj <<
-/D [1110 0 R /XYZ 89 770.89 null]
->> endobj
-1113 0 obj <<
-/D [1110 0 R /XYZ 453.524 621.116 null]
->> endobj
-1114 0 obj <<
-/D [1110 0 R /XYZ 90 600.797 null]
->> endobj
-1115 0 obj <<
-/D [1110 0 R /XYZ 90 513.931 null]
->> endobj
-1116 0 obj <<
-/D [1110 0 R /XYZ 90 496.102 null]
->> endobj
-1117 0 obj <<
-/D [1110 0 R /XYZ 491.236 77.486 null]
->> endobj
-1109 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F24 529 0 R /F101 862 0 R /F1 833 0 R /F32 764 0 R /F10 765 0 R /F90 758 0 R /F7 795 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1124 0 obj <<
-/Length 3917      
-/Filter /FlateDecode
->>
-stream
-x���r���_����#
�&�Cs�IӜ4q�3M2
Z�e�H�BRq���..$HA�퓙f:z ���b�X��zFf_\}|s��s�gy�+�f7w��̴�3��m5�~����7_θ2�|d{?y���g_�|�cW��\�tEa�̨�^f�̖۫�$�t9#����N�����̾���񨐌Il��#k��4��a -���%�����}�[_/3���)���ȅ�_����l�D�E�V��/�\�y
}
���'Rfb����wѶ�z�掖WyF�s�M}M���jU�
��G|�y�n�ۦh
�����
x�M}����uS� );�q;Cz7kO�o���}o'<j���c��[�pk��۶�GC=N����ɔ�РY.��\�/��3|���宭�]����=
����a�kZ`�XW�ٟ�N��u�և���T����u��/���b���׌�5<İ|�/��
��S���
p�W���Rγ� ���=id�x�u��(I�?I���j[�Z�^�t�������n�j݄��l�]h��j�^Sd
&�����/Ųs�FX�	��wuW6��Ry�m��k4%R���wM�M�у$�Z�k��v����
HB��9w�.J�TK��*�eS�a{m��Йb
�w���nK'LLD��U�8
��,�͜���Ei�a��/�
Jf*�578Cg�� .H�p�Rҫ3��Y4�
�0(5��������XSЌ�
�/
жߑ_5�"�ki}��8�F�ѽ�AW$v�ģRe��aݹ)&�!����vpB����r����
:<>t���Z��� y#�x��iFK��\'�:� 2�AfW���X�d�ZtN�q<�e��A<T���5-���b�Ħ���!�
Ӕ*�	`�`M���h��K��|�HS���ɟQ�͡L�&&J���=>��G)�B�k&
u�1�Mb	p&xOJ2�`7F�dR�����Q�&,=�����L������&�Q�S�V9h'=��H�8�ᙢrt�#��e�E4k��L:�	[E
iyY�a�Ox�1��N�i5?��k���O�0#3j�9!�$�
lB��M���	�.0��|`�g����<�Z\:F�8F��a��� IGS��1}N��!�N�(!*fQy�E	W���	�<Ob�A����P�%���?CW9�
��p\
�!���0�vIF���� [...]
�ɽV)w��
.�1�<sAd��# '�
֗�D�sԅq�(JǕ�X�vŮ�w
-O= �
w�@�L
�mRB����Y�yH�G�[�#����o�HM���a�%�c�L����UBI��葱#	�%P_��@�H��B>X���h��<�pճ�C�لXd_q
z��Pg�
-a�8T
�
�`<#�3���il.	��M�����m+�d��j
D퀏
!f_m�\ �;{�rCl�n��꿱�#�v���0$O�wY���ryѯz(�w6
-Jx��'q�T��5�}ю��w�M��s�xd	�^
��}ԩ�:V�V�cDN	�$���Y2����c"3	�_���
̘���E��(���&��p��MЌY���i�
��ͣ�w���L0�M
Ē|����8o�5;w�8� �
-=Kz���O���2�B�Y�74���̸�F�ӡ𪰫S��cDzHkp��X�����JYt��a��X3+A�dž��!U�N����Hgcl.��J[�Di�9�Ј���6�6���Sh��by�Fω �P~�@�;H	?C@\ ~
/H�c7��j�vu�VpØy�AyZ�U��\�J
6r+-m=�
x�b��
-�3DO%�
�S6��9%L��R�~¯�������$?��P���� ˜�	fS�%D���{�}�J�q
��D�0��.	�4ݠN{���E4
����+*���7�|�g�ZY�ۖ���/�b[ve����X},I*]j�ܩ��K�@0�с	���MI.�XR�$w��M,����b�Qr)��~��d�<"髐�`S���az3d�����y�\�⽏�eD
-g�ׅz�C�r7����~l�r�ڽΞd�x�Ow=��D$<×G$�X��Z��ά���Y�
-S��-p at A��`�!�(6MY�
��-D/����
�K�ޭ�C�[&�j�A���i
{ �>�@�T�=ˇ
��&��x9�y2A�s��
���Idν@���_B�a?L�w�#W�Q8o�4�9b�K�����K2w�A���=�V
y�Fz�ب�;���wl��M}�I�b��I��ćuR{�
�P]���S�򝏮=��)����\s�s�\�t�\�^����9��ܶLi��R<�,�"�(����(�.��<
��1#��r2z:��=
'rp���$R�
�3�$���{?�ޏ�?�~�9�R�f6't$���o��DN�ä~Ѩ�lRj���1� ����t�7�V��ތ�y�ܢ3˅�/0�y\,�/�s>N~с\%
-~�PJlq����Zە��]�fUo

����gK�@�ii�#w˾;�=C�`�W��n"dd��Vr؀}��C��{��U1d��v�u��
-;�qY�t�
���)�bC��צ��t�D���6��W����Q
ո��3|L-�tg��;"z�k ��!��%�1\��6�M�>��pHb������
�������f� �e��&8�V��My�%��jLu��'bnkĶ害��R���uW�yE�����b��G6
=�~¤����	G_�� S���z�x_��"������o��Զ&���5�<$��ы0�r�#B���s���{�Eu��r����D��O�`MJ4�q<� xT����7�&�W�7v�W���b������ļb�����V
���=�hÜ�)1Ԃ������d�G����z��l��nB�6�)�BLC�"u}
g,����<�~ ��c,n�E�::�q�⼡�`N!���6Ӝ��z-�����0�e��?��Q^ѩ���yÜ��r�fS�(�E�Վ����*�\K��N��t�%"-��T]ٯ��Mp�
�)�R��R:� �����+��X��M(��._ `;-
C� �� [...]
�
�-`�Ű��{"�^�K4�&���3$xp��|�k�����Ϋ����3���m_�H3��6ߕ��ux�������b���R������~}{X��n�-����":|�����+����V�B��;���/@�7
-endstream
-endobj
-1123 0 obj <<
-/Type /Page
-/Contents 1124 0 R
-/Resources 1122 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1092 0 R
-/Annots [ 1107 0 R 1118 0 R 1119 0 R 1121 0 R ]
->> endobj
-1107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.077 683.608 412.698 694.512]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-1118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.366 356.065 371.373 366.969]
-/A << /S /GoTo /D (index_BDHetal05) >>
->> endobj
-1119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.24 153.973 230.92 164.877]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-1121 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1125 0 obj <<
-/D [1123 0 R /XYZ 89 770.89 null]
->> endobj
-1126 0 obj <<
-/D [1123 0 R /XYZ 90 721.073 null]
->> endobj
-1127 0 obj <<
-/D [1123 0 R /XYZ 90 418.612 null]
->> endobj
-1128 0 obj <<
-/D [1123 0 R /XYZ 90 410.296 null]
->> endobj
-1129 0 obj <<
-/D [1123 0 R /XYZ 90 205.259 null]
->> endobj
-1130 0 obj <<
-/D [1123 0 R /XYZ 90 196.943 null]
->> endobj
-1131 0 obj <<
-/D [1123 0 R /XYZ 319.418 157.126 null]
->> endobj
-1132 0 obj <<
-/D [1123 0 R /XYZ 90 141.213 null]
->> endobj
-1122 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R /F11 613 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1139 0 obj <<
-/Length 4070      
-/Filter /FlateDecode
->>
-stream
-x���v���_�>�|��o�������mv��M��-3�H-I�q�ɿw� �r�I�"� 
fs_l|���Go.^|��E��T��77��/2]�$�����R0!.��|�涺��	_���|�^
-�������Om��a5�m=��Rf�߾���7�.���VHX�/V��������\p��|qg�Z*��.^_������|�@	�/`]����zuؖݥ���Й�˛�÷�*W�4n��kj�՗b�����P�p[Ԫ{�l������u��S�UW���eI�Wm�U��m�8#��ŧ��e%%+D�2�o�]=Tk�P	�e��U��CW��mIx�E��~� �+�^\R�$�u�Ў�Pzyw[
�l�*j\W��5��HK�z��V�����-��`B
�]=�>�FJu���[xґ�f�eE�&��mS�;X�ʞ��U���ke�#��6�ž��b�ּ������[;��&g�W��O�
�$bN�!�
Y���c��� �[��AC�
����%���f�
�fUQw�Վޕnhc���g/���\�*$Fչ�"����
��}�9n�C-�y�7$╒bY�a����t���vm0
���?~���
O#J�� Z���ڡrӔ��C�:
��l���-:�f�9��)l�
-+ ��m��JXA
iNc��K�/7D
���0�
Ueǚ����ӈk���
ʺ1x�'���5R����@��� 
>���Qif�s�!QW��$_I$a����v�:tԬ7���N�g�I���9L&x(��3� O	 ���Q��D��2M�$j�� �H��@��ov�a���[6�&~�jxb�%-,:��7�˦
�Ӿ��ɨ��g��0��-v�wR񱤹�]uE�U��CCx�nw��S
����+G�j�,
�1��h�d�,�e5ht�ۓ|��u�h lܐ�x�n�<�:��	7|�Co�W�9� ��R']G�
�a��L��
v�UG��� �a}�'<M,�pW3�}S�RU���i�[��A_�Ț�@"

O�����}
-���rS�G�
%N���-��v���:o�����\��5��@{pM���u��ժ=
-� 2�" �*
xZ�(R{z4�aj����x��}�3c�!���4?6�������#5�no���5N��O
� ��v�2�_J�B�z<����u�˒�p�d�zP�S5_~<B�	��	��,%A0�`dO����2��se�
���?�ہ
o�vG��ƅ
%��
-4�ն��6X���}���d2X?��
@h����������nV�ú"Ȍ�N�{e�%���ڣ��h%��� 9���w�R���gω���qY*#����p
-=�M!c�+�i�LiY��S�r6��T�ze�m���u4+���~f�i�A�n�����
-����Zr\�9Q���(�3����?��'
��I:��5�ap
#
&
-p	��y at K5�(�"�(�gzƤ�
9Kd��!�<�L �c�[�ۭs�BO.ay:�ݴ�Uw	.Y�>4k~��x�j�[Z�j�q��Ȓ����O�;����'0S}C3�@���1� �"�g
 � ;a
�a��|t�$zl�@Dt�m"F�G�'��Ÿ�<O�5�N�.�
Ēy/���E��`�tZ,�A`:
-P�	
�
-L(c���"��!����_F�X���-&�->�w����i�
e�YK���8�\�k��%`��t�b"�9�_B�<� (�8�R
T^���dT��
-,fŅ��3
��&���`��)�<�/��QO�ۛ�xT_s�i_�ZQ$}Q$�(�'DQ�D&E�6D5��z�r[2>�|�㭀�I��)`L�
��
 �S�O*��R�Uf��&���-$˥��UL0�U�Z��D^�N�7�!l#p' ��c�$@P�0�1�
-o�����0���관�}!��1
H��G��x%eP�y��88g`��1��$8��P>�~��_~&�%���S�ⴅ� E#��R��
�
�/Ó_~Wٕ��8��?+�0�I
���@�cZ��&�6p�s�0h\��<�֋���s;וY؄����ל���<��

�oԎ�

g
}�п97g��x�+�r�f�8C�h���'ɲ���L��fBA@� �ױY��!ER-A���J�u!�����F�L!����&�Ȗ
i����p���3c�H�gC�,w��}lBW��M����È�o̞�!�0czR�pp"h �b2�3�u`��]�qP���q���Q#�
;�/i�Cy
v�
ψ$���|l�c j�T�7���$�/�2B�(p
XR�L
-��pd�G�
OI��I�P�S�bz��&ц�F�E�DŽ�d�L;,jf���<I
��1�3��h�y��u�Z��M��*�
�ǽ���_���o�Q�p��Y����
+�U���ս�x�ʎ2�
��4v:�c<�.b� I� -~����5I��X���I�)5bp��M�ڑ��*ʀE�Y�4�(r��C~b�4���jỪZ����K5��a
x�Y�3m��pkBU�Y�;ش��t�8��8��O�ͽfx7B�S	���<�-
�_Ӝ9mС��
��14l��x"�Kp�'��Q����-�v]�:�̤"
�賈�HL��\�m,az��L
�f
%�"c�NIj�!RwJR�[a�E�W
:�Z���L�&2�a?����N�1%הW9C`�1&��]]�~[�j��Z@��;LV{X̾�̞S�I58)������u�#�9孩�'i��o*͔�$q"��$����w
�ٴJ�;�&��m�>�V9� �C�Ӫ��&WXg��Cm
��6`ܔ�C�DzGϏ�
VxT��	���/�Fi�ĩh�N"��d—c�x�U��ˤ�A����298J�Cr4��.��2Mehy����gUt�P�`l��������P��7/F ����>,���~
�Db8Q����Q���FHႨN��o�H��O���X<c|ʗ��M��'ڬ�J�6�4�>ڑ�AɊ�z��ș�y �^�<�a�@���h0�*=�ms���W�AWۭ��j��)͗�A��2�A���O�����,�Z�v%�"�:��t� ���bv�B�•�e� [...]
-&l
��Q��s�f�T�Y��%��`0��'�����)N
�)
-W�œz�"���bg�h�0���I>
��F�
&�|��@?ѓ�`��q�X.&3��@HV3�$^dT�1���35Ŭ��Ԕ��A�x<p#�'K��l�j��Aͳ�\���+����
-
K�D��@戗ށIe��
d��^�y�
=���a��6��7�����j@�ܱU��d�pQx�������3���`�8U��N��m��}̠ə�#�\--��<��;�~�9O����U��&)��y8i�����Jf��T%�/J���"��9�ϠCk�y���@�����|���hUWv]*�����ݸ��hJ
\B�7��s�M?��#]��N?X��)�����ħ@���vWm�Ψ�㈺*9�ɥ~�T�.؆aS������6�G�:
��@���h'L�&���M,��y
��nhе
�w�
-�Ω˾[����q�g��M
-'� g��@
|)���k�@_�Q��%DmS�%]�00�6yw[فMU�]-�K�c��j`�s.B��@�u9V�J[���+#����hn��k��n�am�s$��W���U����MX�Ƙ�j Amn�H�nܨ��
Zo;8��VQcU2�n��v��6�;s4�n)w�lN�I �9y�
���w-’8Z͌I�S.�Hr��gG�C�3�͘J00Թ��-F� ��n1�%E�{c�:ށ��?��{��v�v�k�
\
E�u����Y0n�f(���N��?,\��FvM��D�dJ����ׇ
��
[��>�Qo�	;��Qo7�+����:<&\���� �
�J�K�~ۼtڎ_����<]�/�u&
-endstream
-endobj
-1138 0 obj <<
-/Type /Page
-/Contents 1139 0 R
-/Resources 1137 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1092 0 R
-/Annots [ 1120 0 R 1133 0 R 1134 0 R 1135 0 R 1136 0 R ]
->> endobj
-1120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [448.533 696.002 486.501 706.906]
-/A << /S /GoTo /D (index_HPR97) >>
->> endobj
-1133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.495 565.77 266.135 576.674]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-1134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.01 565.77 392.525 576.674]
-/A << /S /GoTo /D (index_BHZ04) >>
->> endobj
-1135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.467 542.233 428.905 552.764]
-/A << /S /GoTo /D (index_pointset_powerset) >>
->> endobj
-1136 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1140 0 obj <<
-/D [1138 0 R /XYZ 89 770.89 null]
->> endobj
-1141 0 obj <<
-/D [1138 0 R /XYZ 296.413 651.334 null]
->> endobj
-46 0 obj <<
-/D [1138 0 R /XYZ 90 634.643 null]
->> endobj
-1142 0 obj <<
-/D [1138 0 R /XYZ 90 543.23 null]
->> endobj
-1143 0 obj <<
-/D [1138 0 R /XYZ 90 543.23 null]
->> endobj
-1144 0 obj <<
-/D [1138 0 R /XYZ 90 528.695 null]
->> endobj
-1145 0 obj <<
-/D [1138 0 R /XYZ 90 136.02 null]
->> endobj
-50 0 obj <<
-/D [1138 0 R /XYZ 90 131.251 null]
->> endobj
-1146 0 obj <<
-/D [1138 0 R /XYZ 90 75.329 null]
->> endobj
-1147 0 obj <<
-/D [1138 0 R /XYZ 90 75.329 null]
->> endobj
-1137 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F11 613 0 R /F24 529 0 R /F8 794 0 R /F7 795 0 R /F12 939 0 R /F9 879 0 R /F13 834 0 R /F29 938 0 R /F6 861 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1158 0 obj <<
-/Length 2970      
-/Filter /FlateDecode
->>
-stream
-xڽZIs�6��W�6�*7��X��
��2�$�f���T��$:ݤL������B ��b{�x�{+'W	Nޞ�<?y�F�$G��"9�Lr��,G\��6��R����DŽ	�H.�#����w�ߝ�鱓��'�N
���9�*��O>���-t��`�r�ܚI�$�
������'�m#�uS?��`�pc� B��EY�	�8��,�՚R���6~��)[�|�
�W�t������ɚr8�[�m��<�sExZְDF����
�ve�饞����W�
-:p��ΐ�@�dJO3��	���
�N
-6"�2�&v�3jD �GQ��e$�,��&�=��
��Wn�I�rE�
��g* u9��O}R�4;�᫙��$@T�D�Z��%)A�a�Ȩp��Q	��� �٢��<Q����o��~t�6V�rk�p�9�Iw�E[���h[����fS��4ʣ��,CT`$A9����
"�
�%@�'
	����
ݛ���r#�@
q����q#��kk�y��$���%
A���? ����I��CD��>j�A�>��R
�ÿ�`=[S�b�K8ʀ���}e���߁
2��
P�$K�
Ҩ0	�����Fa�@0f%�\��6������
-y��i�n��aS����h
ꪩ��F�zh��o�hj�heb�3
�3��̞�?����iT�RJ�䨎 
v�[L�zҖ�M��='���<E�n~��׌E
-�f�N�z�\�?�+ zU_9o������_���`�Yz��۲�8��rW�˺�9c���$�5�,�J��.�ؗJ�AB����+׻ғ@��ްD������|���P�߹B��01@vw�	���
p�y�	bt��g����,��GJCwk�9�
�FhLޜ��ܟ2C
-�<l�d���[ٜ����4��Ո�zJ�b�L�O�G�>����V�!�L�8�������nW�ts�q�b4�-J�膄��$��.��d#и�Y��I
)�
�c^��>�f���Ǝ>����'BK� �,ᶱ/#�f
�ET֞P?������o���i��4��(FMsIeWu�(Lsi�E�\�	�)N�6J'�v3

lBw'@��S'*��~�0��z#��!p78^5����
KEi��Ԃ�г�+��0�
c�� h���������u՗!�c�mi�(
Cgڣ7�Qu��^���?oO�fҹ�>�oWOC�T��]�
�%-���̺�n:#wh0e;
-`��r�D.�y#�9Y*�8X��K׸��-'�c�+����Q	P�u_m��U��˾��"ݖݦ�nLi�+����ف2
qk�t�~v�I#mx{�ц�W!m��h�]�`b �}m6�P7
}��r.�30��{�
����z]�.�w
Z�	�0Z9���&�6�g�
��1P�
0L���-#6J1s��醧���1��a:M
�_|���A�]
9�
;-D�c��k�
�9���G��f���,[g�o����mk�}띖B3@�*�'�]
�V���îhݔf����
�y��9���B��	XP=\�Bڢ�C
-D:g��fWi{�)�8n�*���B>,��A���8[�l���{�E9���hAb������q���!�C��l�#F�G�BZ���I�'wug�q�3�y2&����a��K���D
��@I8	��� _����� +|�����y�4��g�"O��H��qXg߀�]��
-�d�ܧhj�=���3uWIL��좳o:~���&J�r��{�8�鎎[����Ь��]�w�h7.�=1�x�"�J@ɀgL�"
)-�|f�B�5q�,¾
q���o�A�҉f��(-*b�%�7��T��6bQ&��y$t[���sW&�/�#V�B�K��RI"^*
\�
t!O�
`���+��zO�g:���ҝ�&)���epهD��+Ly���EԷ8Lg�P~:;W]���,�7�������CsΞ+�J���-ɝ7�Jʧxę�]�@�!�F���*�IO*W�+���8��Pim�"ߜ�E���ٔu�2��3���˳�y<�۶O�0jr��b�EKˆO�u�@�45e �L8Qg_I԰)„/k�7*k�&
��c3=f����O$l �� � ~��`�d8�9�Y*�m�͘H�bs
�a@`l��	����
�j[xY�9..BN����&X@�����p��eQ��R�Ⱦ���U����ti+r9��r,.	N����h�Ҥ���;�@�
R�����&*FH�����)�	y��佾n~��,zE.�|
-�f��7c3��yV�4��V��Z��.0ٺ�����O�l��������E��&���<CR��%#a��ao���H�����b#y�#ۂ�Z�hY��ו��w�E�YqK�qQ�n�/
-��^�� ���#��Ͽ��n��W�:�0������(�]y�fC]��i�y
��\g+��2�Nu at m�,Lul���|��`�vH��k����h:
V����+]1
�
C[6�YX�B�=/6�)��z�j���w���v.�q�upR�ZfB�ڕ ��]_��a��iһ��6zEA�I��`�X��׼v�fb4vJa�~���<*7d����.\ؾ����VT���%ծh�!�_D8��m�p9��y�s�B�"
-
�մ۲
����p[F��j{W�ZR&Q'��rS
�2DS]uϦ���e1�
_�&��0��p�
}å�����'�b���z�zn��n흈�
���g��*�(e����W��ewiۅ��c��.ԝ�M�{I�C�&�}�����k?�`p�҄����fp��u<�aϒW
,6-����ӂ�o� C0���T��� "�
�i���#4~��ۊ�ԩ��E}(v�]��U��Q-�ڦ���YY:V�}�1n�_'ơx��җ�N/������������Ц�/����yn�61�
-W��7m9ܿA��؏���z�
-endstream
-endobj
-1157 0 obj <<
-/Type /Page
-/Contents 1158 0 R
-/Resources 1156 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1092 0 R
-/Annots [ 1151 0 R 1167 0 R 1152 0 R 1153 0 R 1168 0 R 1154 0 R 1169 0 R 1155 0 R ]
->> endobj
-1151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.512 460.123 513.996 471.027]
-/A << /S /GoTo /D (index_powerset) >>
->> endobj
-1167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 448.168 181.006 459.125]
-/A << /S /GoTo /D (index_powerset) >>
->> endobj
-1152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.703 436.212 287.736 447.116]
-/A << /S /GoTo /D (index_Semantic_Geometric_Descriptors) >>
->> endobj
-1153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.972 418.588 513.996 429.492]
-/A << /S /GoTo /D (index_ps_operations) >>
->> endobj
-1168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 406.633 164.282 417.537]
-/A << /S /GoTo /D (index_ps_operations) >>
->> endobj
-1154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.712 406.633 513.996 417.537]
-/A << /S /GoTo /D (index_Generic_Operations_on_Semantic_Geometric_Descriptors) >>
->> endobj
-1169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 394.678 181.684 405.582]
-/A << /S /GoTo /D (index_Generic_Operations_on_Semantic_Geometric_Descriptors) >>
->> endobj
-1155 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1159 0 obj <<
-/D [1157 0 R /XYZ 89 770.89 null]
->> endobj
-1160 0 obj <<
-/D [1157 0 R /XYZ 90 721.073 null]
->> endobj
-1161 0 obj <<
-/D [1157 0 R /XYZ 90 670.477 null]
->> endobj
-1162 0 obj <<
-/D [1157 0 R /XYZ 90 670.477 null]
->> endobj
-1163 0 obj <<
-/D [1157 0 R /XYZ 90 651.697 null]
->> endobj
-1164 0 obj <<
-/D [1157 0 R /XYZ 90 596.927 null]
->> endobj
-1165 0 obj <<
-/D [1157 0 R /XYZ 90 596.927 null]
->> endobj
-1166 0 obj <<
-/D [1157 0 R /XYZ 90 578.147 null]
->> endobj
-1150 0 obj <<
-/D [1157 0 R /XYZ 270.222 526.863 null]
->> endobj
-54 0 obj <<
-/D [1157 0 R /XYZ 90 505.927 null]
->> endobj
-1001 0 obj <<
-/D [1157 0 R /XYZ 122.378 385.876 null]
->> endobj
-1170 0 obj <<
-/D [1157 0 R /XYZ 90 366.996 null]
->> endobj
-1171 0 obj <<
-/D [1157 0 R /XYZ 90 77.387 null]
->> endobj
-1172 0 obj <<
-/D [1157 0 R /XYZ 90 77.387 null]
->> endobj
-1156 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F7 795 0 R /F11 613 0 R /F6 861 0 R /F93 763 0 R /F8 794 0 R /F12 939 0 R /F9 879 0 R /F1 833 0 R /F10 765 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1186 0 obj <<
-/Length 3535      
-/Filter /FlateDecode
->>
-stream
-xڭZm�۶�~�B�/��X4@��i;ӳc�yi�ĝ���x(��c,�
-I�r���7� :���Dp,��}vA���B-^]\��x�25�<ȓ0Y��-r�H�<�x�.�-u���J+��oo��U���P-��w)�Z-o�v��hEUc;	�e�_����7o/~�а�Zh^-�l�9\�{�[ �P�ɳ�-
:,���s����JWAc�
�5݆���� �}�*�Cٷ�$
����p,ڪk��K<}��
���<g����0^�~��e�[L�eO�I��q�
��
�d��
-O_���X�4Ha����C�E��pD(c+
Dy,��A���OD���g-��Z)�AU��V�]�A5�.ڙ.��P2i]t�j_�j�3}k��E��i�U3�9��c����P�]��OPN�
�)K"h� �ņ��7&�S�gW�a#�����)UA���ɑ�f���D
g�5��5�b��cq6�:����᳑,
B�=J
����v,�s*��DF�J�EŪ
v�At���_O���^͔f�3��%
����D��W-�]#-w�<[Z�
�%Yr�1^�	����)
-B�6�������Bp���|�ګ�4PY���1��k�3�=o\���_$��GǓ#Dw��<J�Y������X
<N�&<U.�	��U�|B/��h�+�4�Z�'� ,�����Oay`����gg ��+����6e�� �z��V]�h�#9
��0�|oC?�F��B4A�h��^�5���':Y8�P��3d��
-~x�
���CQ��[��W/�)w�u��<�k��ȓ1(_
�F��U�}{09p
��8� �8�N J�qx�KL��IBs,ۢoZ	�Y
djff}�xu�?�դ	��9�ؾ���r_h�2ƪezL&Lf>qL�0�����e����G�-�͉�	� !l[�M_n��le��΋Z��A��}j
-�hp�@w;�S�0���Y� s@���U�5�Sϖo����qO�S��Zr�Е ��!��
��Fz�@*�Pt]u]㪴���
t��
�0�.ƻϷiQ^�����m H���c
-tU�t^�eٯ�Ҵe����Anr>	��򸇤qdr`���e;��h{Sm!π�7$g�,W�f
�9o �ۦ.�Ֆ�S�9ዣ0D����ѫ���I����p
�ɣa
�w8���o�t��YV�jx���#��R ���q%�@��N{
qUr�0͂,4�\�VjěKB޲g��*
�}��@;Lf8a�ǃ
���"D��	�H�_|6��X'�pX��������rr�1���}�4��m4�	�4" >w���o�c�/zv ��
��P̷ *]�u[`��/��8Fu�J���a�}�_�,��U*�
Jof��8+
��o �	�S�k�/Ƕ9lE��L�\���wW+�e5��Wo���D#�������<
����W��C��P"��]c(t�!xR@���V�=m1\_D���
kF`#�����Z��F!d��t�(n�
t
�Y᳨%�y�(�T��Ѥ���mǍ��@�/uB:�#�9������l$�}9�����[��RyN�1�Ld\�w�C�\��fb�L�MN8~�����F,�����O�� ��d�J%�hL '
� 2�,Vd�hfE�;�� ��[ҭΦ�!?öY^����,'w@��2RCB�3�0E�
7FU��9� ���g
]	��W����e��tX۫,˶��cǻ�mL��'pELc,/O���p�fY`�|½]Y>�`���o���{���@
���Xp�9nN��U�����	��o1�ǂB�K�
-�
r�A��(��qw�g���"�[��9P���t̍S|��~1�Ų���lq�X*Y�ċ /&�ư�j�|��:x Da�8O��E{��4��t's�Ɏ����	�~��EO
U�,@�� ����|PI��J�:G���e�Q��:*�۵(:���mڏ�0�ř��0�Aĵ6m�
t%���J�P��e��<��z)u�%�&SC�p�\Q��j��!��y�84��D�0�c(�76
-� &,N�}���%O��D�����}I�����!�	K�����8M��Id��mK<��O��6��讃-�ң�'���œ�:f���a��O�"���%�s&
W�K� e���?/��bcӴP�
�z��P�y���!�"�2˖d�<n��<yt("���X�e"���z�
�hN�'�-\|���[x�I�&�ĽC<~���gV����MUt//��J�P�l���8��G)
d�7Af�ԟ*��\���`�.'�\�|�P��T�7t
gNr�'jB�'���
��A
-п.�����
-���
�8=�!�&�
 :�93���>�j�� �
HbcS�g苣xW�՗0���J�?P҄��<�R���I�7KJcp��[�������ѫv�� ��$����>�B�r���]�	ǫÊ",~����@.Q��o*��
t�ioD���o�[��-x���$�����
��A@ש�Є��)���f�(v�b�,H���*���Z���yX~��1$���{Q�&��RG�*�	w
)r��
-�_�q?�zp�$��(Kk�y'B�y�1�A�[BL��|�g�u�i;*#��Ac���;a���l�q���??XGr�K�U����]	�m�d�v>!��W��.
��m=��7�6��>���Q(�"%Q�w�K�t����:#
��0~:H����q��v$��S&�\7��>vΈ�wߪ�����>��P��0
��H��7~����Mi;e3J�nD�
c�DFj{CK52
U8Y���p
1�ړ�X{
��^C�8
��6�a�୞���7�{�!��Y$ 
vY
7��κ�.eյ�>�ݱ��V;���FF�����]���Rɝ��u�T���I��%�ة�����D�w�—��`���~ZTB��]���[8
Au����&���a��ʙ+��~?���&4\��Pa	nA�7��jo�t��
��D�ddМxMG7t����\{C�;Gm�Y�t��Z��M���)�m!� ��i�����(�=}8~��
�gϮ��	s���ύ����6���7�+��:~n�g��⤝rA*$0�klk`�V>��L/9�Bs{e�oӜ)6^tO���(�
�"2#@ �� eÁ|Îxa��yh�2�=���2��Hh��Ip,Tq��^	D7
�������1����K��[	P
����1�]
3�>C�X./�����'-5n�oֲ��3���7�%	�G��6CL�ʮ��Î�g
-��`z�ؑ�tp��ta0b�psF���u��$�'�#�L
\�9�&5�3	�44���&��	�x�xɟ����0މc�K)�$B�_��?��;~���O�bE����6$�@�)��?���������;�(��#������Ϟ>]�����@3��C�}�����M
-6�����!Y���z���$�� e�v���4�n�:�D!<}}0�
(x�E���S�
-endstream
-endobj
-1185 0 obj <<
-/Type /Page
-/Contents 1186 0 R
-/Resources 1184 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1201 0 R
-/Annots [ 1173 0 R 1174 0 R 1195 0 R 1175 0 R 1176 0 R 1177 0 R 1199 0 R 1178 0 R 1179 0 R 1180 0 R 1181 0 R 1200 0 R 1182 0 R 1183 0 R ]
->> endobj
-1173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 561.335 210.548 572.292]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ad326f3bec17300467f639ba345f2dd22) >>
->> endobj
-1174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [498.724 475.777 513.996 486.681]
-/A << /S /GoTo /D (index_BGP99) >>
->> endobj
-1195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 463.822 117.009 474.726]
-/A << /S /GoTo /D (index_BGP99) >>
->> endobj
-1175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.136 416.001 238.651 426.905]
-/A << /S /GoTo /D (index_BHZ04) >>
->> endobj
-1176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.642 330.444 266.138 341.348]
-/A << /S /GoTo /D (index_BHZ03b) >>
->> endobj
-1177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.848 199.554 513.996 210.458]
-/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
->> endobj
-1199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 187.599 197.394 198.503]
-/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
->> endobj
-1178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.115 187.599 375.525 198.503]
-/A << /S /GoTo /D (index_pps_pairwise_merge) >>
->> endobj
-1179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [470.5 151.733 513.996 162.637]
-/A << /S /GoTo /D (index_BHZ03b) >>
->> endobj
-1180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [105.88 140.336 144.396 150.682]
-/A << /S /GoTo /D (index_BHZ04) >>
->> endobj
-1181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.381 122.154 513.996 133.058]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-1200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 110.199 259.791 121.103]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-1182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.892 98.244 272.525 109.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-1183 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1187 0 obj <<
-/D [1185 0 R /XYZ 89 770.89 null]
->> endobj
-1188 0 obj <<
-/D [1185 0 R /XYZ 90 721.073 null]
->> endobj
-1189 0 obj <<
-/D [1185 0 R /XYZ 90 648.008 null]
->> endobj
-1190 0 obj <<
-/D [1185 0 R /XYZ 90 648.008 null]
->> endobj
-1191 0 obj <<
-/D [1185 0 R /XYZ 90 629.185 null]
->> endobj
-1192 0 obj <<
-/D [1185 0 R /XYZ 90 538.64 null]
->> endobj
-1193 0 obj <<
-/D [1185 0 R /XYZ 90 538.64 null]
->> endobj
-1194 0 obj <<
-/D [1185 0 R /XYZ 90 519.817 null]
->> endobj
-1196 0 obj <<
-/D [1185 0 R /XYZ 90 416.998 null]
->> endobj
-1197 0 obj <<
-/D [1185 0 R /XYZ 90 416.998 null]
->> endobj
-1198 0 obj <<
-/D [1185 0 R /XYZ 90 398.175 null]
->> endobj
-1184 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F7 795 0 R /F11 613 0 R /F93 763 0 R /F75 554 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1221 0 obj <<
-/Length 2778      
-/Filter /FlateDecode
->>
-stream
-x��ZY�۸~�_��P��A�p���Q�ػ�z���rQ$�L�2����t�^ñ��!/#h �����y�y/.�vy��y,�4H#y�{/e^
����k��%[}��ٓQ�4�I���_�|���[
�xvy�����8�WA�x������A��

d�x׆��B�oώ����+��Ӟ�j-���
-�^���uI]۪\����+��]n�
�u���f�Vk%��rOcM�=R�,
�����>鲥���߲�
'�>�V�����_�
|i��\Y�W��:�:k������Fh���S�J�1�M���[� ��
 0!b��T�@V��V�j�c�_ˬXq��4x!���/@!+�<�������V�s�����f&�V�A$B���hPb�o��
>v����F�1��o޼�F�i �-˄��Np�8k-Qm�u��Qko�ı󹮾�'{�����iO���n���
d �~�j�^�8s
����%
-����*a�
�WEQ�^^ӷ=�"����Cd��D ���k@����ޛ����&��CYiֈ�ӊ����'f"�4�л��;�Q�}�`I;ݡE�ZM��N�}���
�{�
�cИ8
�X���
QL�=YO`����R�h/�f��L�a��14�PY�g���P���/ld�J�L��C�!� [	2_>fV4���bt�u2���='Bμ�H�0
-X� Y����n�I���U��B�#B�1��x���/��F�
����n���DV�����h��E�v�)�5���F��S�=�mFuW��/Zl�%
SN��;V� ���.T���A��s?����*�
1�OJ�%�������= �!�~�u�ۂb��
��&��Ɉґ���(lV�+��9�u�Vh+�	�(
�\��l���e����ozKV#ng6;3���gfp�m���]/z�2os�,\t 	�
���		�L8*�
-C��Hx��G)^��o
_��P-��Nxd���J	������W Ȭ&�G��
-X�|��Gj�hS	E1Y�<�ޛ�%���{|�
]�:�)��h[�V�i�q���F��2�yV���+�@�ꕌ}�4.B�1���d׫�{}L�����ߴW�ck5^9����
��ڍ
h[�k/�?!������*� D>�A0>>������&��H at YD2��!�A��Y�X�{�Z��%e�v B
-vѡ�^3Q�	p�'SǍ�i
X�
o~BM���AF=?eM��A@����У)�(�@$�,L�c��l��

����a�f�:����;���0���\5y�_0��j`��wqqD..�q	6J��+4�\`'�
]��7�y�ˮ�CL�vg���׌kt,L�s�Ьw���CJX�H�}۝
h^���Gs��737�t'jP$#&é��⧈4���]��P-{�����<��zƓ �F���I�K�Rf�lJ��]��{vg�k[?P�y:~L�l�R.��D����X�~
z�����E�56�@C,��\8���ݨV��q�3�
�m�b8ګ|LT
g�p��M��[���u�?�i~�7�n�L.9�8褽�ͪ�T�|�ћ-i��#~�9�O�

P��[y�(��1p�)�E
-���	�W
-�W
-ʼ��4�
�q�)EG�
a���/��(N��ek�Gވ�g�~�Y��`1�);��̞�I�M�`�Z^~e&�*� G�
B.ܴUml(��XLľ��p-[�

-^&uC���b{
C
-���pi���P�IJ�'69��
�+`�&$&�=$'�zP��`u����a�x.�F0^��j��M
�+����'Vk�$ЌA�9da
t"����Q���p�
d�
ad�/��6��Nڽ�,�
��ب�L�[b[@������|a?�RLl�ja��oBɩ��A�1D�d������6�Nɍ�/���$��DW

�
�
)�[m_kӚ�8�,	��������S�B�e�b�x=�"
W
-�r(ИT�������
��Q|]���  ��}1F�G���\dK�c&�
-�!�[�	�{�T�`�C��Bw9t�u
s�XyX�e������t[`kSu�i����

v��~����!��x�
%�
z~��
>]7��n��d	Xu:�6�?h��:D�C�E�6�6��� X�r�rRh�t{�v�
-�t8U�4r��i�~�`}R4j��P+z�;:��^u��k�i8�7���jl,
�\>��![:O�߀(��Sn�
-]cgn��*��Z�)/g��m����Tћ�#Zx�h�O��Y��
���1r�ެ"eL�9E�a�!��n��m��%�Ҩ;��o�ϝG��1�*��P�	\!��Rq�E�
v�/RR�)^(R6�����1�a�޶���.�{[�D\��;޳�����!�؜k� C��"��͢P|�mi#c.d��ؚ�B�{�qR��T����F\we
1�ԥw �\�l��&�w��'8>d��
-��Ao�
+�8��uv�#�%	4F�O�Zn��(��l��S-y�m(R5�@����c�(CI�� �1;a\r��'�Lo���"�>�1/05���R�jZ&�
��ʁH)�zdž�Y
4N�u��&ض,�`E-u΢�a������	5�}��a41������|���X��q�
�9���˓�V�ذ��[
��H@�0��:l�fi�T��<�c㟍���8ZC��]V8���B���E7[�~���_�z��N&2�Gaj��Ƕ=?y�x�
]
P�ۦ2LNӀ
9$���̉r(��D�l�g0� �T�n
-endstream
-endobj
-1220 0 obj <<
-/Type /Page
-/Contents 1221 0 R
-/Resources 1219 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1201 0 R
-/Annots [ 1206 0 R 1207 0 R 1208 0 R 1226 0 R 1209 0 R 1210 0 R 1211 0 R 1212 0 R 1213 0 R 1214 0 R 1215 0 R 1216 0 R 1217 0 R 1218 0 R ]
->> endobj
-1206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.002 623.859 381.199 634.763]
-/A << /S /GoTo /D (index_Min04) >>
->> endobj
-1207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [476.308 623.859 511.506 634.763]
-/A << /S /GoTo /D (index_Min05) >>
->> endobj
-1208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.723 517.844 513.996 528.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-1226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 507.946 90.996 516.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-1209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 480.305 297.721 490.203]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-1210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 459.157 321.631 469.055]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-1211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 438.009 321.631 447.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-1212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 416.238 321.898 427.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-1213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 383.134 291.743 394.038]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-1214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 361.986 334.671 372.89]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-1215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 328.882 357.021 339.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-1216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.779 321.488 306.683]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-1217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.691 86.288 176.633 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-1218 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1222 0 obj <<
-/D [1220 0 R /XYZ 89 770.89 null]
->> endobj
-1223 0 obj <<
-/D [1220 0 R /XYZ 126.802 699.155 null]
->> endobj
-58 0 obj <<
-/D [1220 0 R /XYZ 90 683.109 null]
->> endobj
-1224 0 obj <<
-/D [1220 0 R /XYZ 461.12 579.192 null]
->> endobj
-1225 0 obj <<
-/D [1220 0 R /XYZ 90 561.089 null]
->> endobj
-1219 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R /F8 794 0 R /F93 763 0 R /F75 554 0 R /F11 613 0 R /F1 833 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1246 0 obj <<
-/Length 2790      
-/Filter /FlateDecode
->>
-stream
-x��[�o�6��B��P-�K�-)�}H�k�6��.��yW�
-�]m$9���wH%Q��7N�<�0।9��͋�ht����'g'��%"�H����.��F�̈�p��^Č09�3Ji�x��o���͹�qu�~_R*��-���zW���5�fw�³jk^�T�X�ٯg?������	
h�ܘ�$i�؜���FK��cD�����m"�����'�8�C�5
�πg渿��Z��ܺ�vU❦X־6W2n*w�����"_絥��u�^���z�h|m��7��y��h��͌+��G�e�r�@Pp���WW�e^�ECfsA��l�=V��F��`�s�]���^�u�
����m�׮� ͼ.�7�ʶ4���1��`Y �|[,����^W���yd89��
��S�͹ ,Aѿm#�4!i��,BE�(KG���R�l���ȨAKF�FI�ih�I����)I���C�A21 ���8��G�3O��9���,2��*�RЍ Rp�9��
��%A�2� 
-��R

E�'GijPF��PԠ[�H�g	����1��?fF�J"�Ivx?Rw��I�P at i�D�1��|0غ&*InNJ�8L]܊�d
-+C �
��ַ�4sd��b_#�h�`n�3ud��'
Z �
ut�}e�=
���C��%e�
໏�!��I1��8I2���c��JX&�IBw�p#Q�R�q�.P.��D��~8��Yޞ���c
Li�y2����:�f��9O+ z��
D�A4�g���!�>��6��� �eQ��DA�f�A�8IiAv�(�}x�}@K���ď���s��G���r�����.�ST�ǯn�����c/�<�n��( My*�a�J�O:���fG���@|����X�?�>N�{�X�cܯ	����q*A�"%:E7��UQb�xdy�"� �ԇenF
-���fb8I$O��V������龣���p�-�.'g�pv����(
�Y��k at f���Pq��
/��.�]�]ڍI�l��讷�4��$���2�{�v=�m�w����/�C)�e������X\�
Q״�B����L�iqc������U���\/�)ag&ჲЛV JN	gr��������� �N5e1�N�H0�3eO��.7
]�K�7\�[�m��
���6҃ߵD,p
�2��n���w��z[n�BI����y=v�eb����9P5e[��Qhn�Ӵ��G�y��f�|�w���g"��)ah���4��Uc���g+
�m�T�27�5�E�X9�ʌ��8��e~��7q��G[\� ���1�3��XY�!��:l��H��)���f�~۾�OVT�ߤ?ǽ��B��syݺ�����
x�B���UH�b�(���P&}��
l� ͑����D�ǚ
-�#��l`w�Oe�L1��T��� M0k?�G�q��;]�1�Tw�0N/!�7�&�4�.��f�S��D7�cAXpFH!��3)��B��BH���@w���H�C{
�˯g.��lAj��w!b&�H;�O��N�����
-
F5H/;P�i�G�.x�
����B���}x �H%��	��0�t�
��
S�)�$vsH@��Ё�:p�-
h�Сt:	'�26�����k�P�j�(��&;�rt�ܱzw:�+�b��q�u����3���0�̾��3���K<%����Y��|M��z�~R�
`;��&�"J
-s����ӝ����\�G��A
��NP

TQa|��a���W7���X�N�m�

���G֐�y�~���l� 6��
cp�iy^���L�xp��Y�
-�
-f��̶�m*�*0 �ImS��
-����W%���U����
��1��C9���S۝J��4��� �~��E�� X`��!qY-,���G�G,�zk0�t�-�``Ew�
1��#��h5LyL6�~��N���N}ҩU�eR�G 嘷	�`Y�b�w�Q&
w���.�j�Fg��X1�H�X�]˧
-���	R̹��쮰���	s�� §�
-�\ݨL�"�R�6޹�™��;
�,��ql���,j�$����ͤ���ا�1)�� �BB��,�gˀ"
-H
4x�L��ۛ~wX6ȫ�u*�5���͓���OB�x�¾]�G�9�WDQ�<NAy��<�zUl���n�S�Cg�1���Wt�%�S�8�j�HM!7T�"5��H�Q]�S��Y���*�����Y- �`^��'��+�
�E�/�I�rY��a���W�mM�=Q�C�8
��/$\i7]⸇��L���$'
�8�T�vaO�
js��p<��/Vy����Q�� (�ղ�X��Ņ�L�tA��}�l�ؚ�
�/nIǨU���٪.02������܋Z=�S�={��G^E��(�,eY�'����*���CQ���!�q@���E�_V ��� ����R
�ǨP�'����U�U��]�qhD]�p>Z�å�c�'�CA���#���pk_pa�bh�
�K��e��py���i��O�ֲ������� �c��G	�>
|�b���	�{�=�8j],�����-��]yb~
C\�7w�"��#b��W���
-ޗ��Հ&���ٛp~�ˉ��+��ۼ�t̔��.�s~Q7��w��ܨ��f�Gd�
����hN�VG~����dJ�0o���	x� -�P�����1�ηW�W���/
 50(Ǵ�y���1�*򭟜���0%��=ªmw�NOϯ.�ҽ$ �}s�##4钷c$
-��rT�Lͽ$@��!ZP���oж��x�􇍈��@��'V���� 
-endstream
-endobj
-1245 0 obj <<
-/Type /Page
-/Contents 1246 0 R
-/Resources 1244 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1201 0 R
-/Annots [ 1239 0 R 1240 0 R 1241 0 R 1242 0 R 1251 0 R 1243 0 R ]
->> endobj
-1239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.681 299.1 301.234 310.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-1240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.196 116.241 335.441 126.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-1241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.382 116.241 432.469 126.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-1242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.228 116.241 513.996 126.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-1251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 103.913 90.996 114.817]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-1243 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1247 0 obj <<
-/D [1245 0 R /XYZ 89 770.89 null]
->> endobj
-1249 0 obj <<
-/D [1245 0 R /XYZ 90 170.144 null]
->> endobj
-1250 0 obj <<
-/D [1245 0 R /XYZ 90 160.083 null]
->> endobj
-767 0 obj <<
-/D [1245 0 R /XYZ 335.706 77.486 null]
->> endobj
-1244 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F1 833 0 R /F11 613 0 R /F8 794 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F93 763 0 R /F32 764 0 R /F75 554 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1256 0 obj <<
-/Length 3546      
-/Filter /FlateDecode
->>
-stream
-x��ْ���}��o��0��N�ʶ,�G$��T
l���@����_��	I����b�3����7��W�ꛛ/oo��L�*SY����~���$�T��n��g�����V&NU�Ű��_�~u���۷8w������ ��U��#����x��/�j��V�2Y�z�E�U�
<��ۛ���Š�t�C|c�+TE�q�A�,�(Zo���te}��h�z����r���z�z���2�1
�_mt�L��$T D�`���^(4��o���
m��}�&��Ţ�'��}Ӯ���f�=��
,�L���S��7F
�]s�Vnl��-O� ��?4;
��|kkO��&����� ���k
D�ş�~j�ǃݵ�3x��Y)Rؐ��)�
-��(`
-�<6]?�0.��:Y�?���e+�r��ܝ��(ߌ��� ��9
-��~�t��|�q�nʺo�H(��k`�ʰ� '�^e�
_
����yuߴe8v�~���
���`�ڮ�y'D��@��˼b`��%�L�?���S�M��_������"���y�������
R�+!	ԏYz~�U��
��
�ʺh�(*�A�΃
 ��š.ߟm��<� 
ٰ`��-I
ɝ�&�^�
?��	��0�ǃ����(��5/<�� �ǥ;<�yї�
bCqwjX��X���[Dg��۪$�q:U���I at q&G�%�hp5x���
�|�2
�+���,�>�@�fw.���ͨ���7�O�X>��Q��<� ���D��M��<�'���� U�
b�ܼ� �=�jc�X%Q2-H��n�U
dm�����⚾�T�����N�� �}��4�����"=H����Q��
��8��$�2b ���wp�cY���w��w�����j4I�~� $qj�TJ0[9DSW�"F��i`����9�j�sݡ9W;����sgw@:�w�8@��=�	������|��;��!�`�Cr~����Tvwos�H��
-�f��e��S��oK'�wq
-L�@UOD�q"o�0�U.
�47&�ޗy�6[
f���]�#�-%
��c�$b�@B����N�L����)
{O�$x9+1�-�օ �����v
��3�� 
-���PX�.nk3�k����cX!��
�ѥj=u�$BP��=��1'�FS�,
�W��K*L9��$ h
0��t��@����l����E�^[AN�ԊC9�o<����"
=I��%��-
+�`�r��0�� 󰠔d�.���+矉��q�ԟ�|�
-\LGhV��}!9��Qv
��:�1R�,ɲ~/
s��<�ɂט&��=>��a@����Pq��ӹ��"�#�X�z
v}YU�ߑח	[w2,��
,<ت�8��\L�,��>/�
J�ER �kG�q[.����mB<
=3�
-�T�.�J��{����B��>g�	��{?b:�{/�
�
V����3U�4[�Pa���4�#cC�\ƾ�锯����&��M}_=2�;w'��S�[=�Y� ���]'B���P{<��p�g�М!{�4߈�����Q)M
)U�y��Q��p8	9�\�)��`��X�����X¾0p�
�]�ҋ0H�7]<�#Zr9t�A��H��ԓ4�-f1Cm
->�UGYpI

��^
�㰼8��B��z�c:,^�arӾ�n �(A"��w���֑��R�;%��FR�Y	�AC:��
-H��t<������Ԑ��%k4�,	��$=J�}��:�
1����FJ󵁪���,#���
�g�A���6?�1��h�uV�y'U��a�u�l2�m��X	Q�b��1~���󴎧|�<�U��+f���$6n
-�8P��mC9��7��p�1������ٴ'�`�keŬNb�` s��#�����z�Ԁ�O�a5�S{f�y&Mb9�r�w��LEA����]�#E����Ш4
��Ϲ}MH.��Ryx��<�2��2��R섻�Xdf�N`�y�Ll�PgV���MQ��DߢAߢ��
�[ v�Q���#�Z�h�O[}JK�t�ޠ�5�L:�_�!�8U�oVƠ�~��U�fC7��
'��*�jӘP�F8b��Ã�Zy�g�8��ٱJ	@_Jpc���S
%w� �`y���s�����5�,V�! �1Udjɣm�ˋ�� {h��L���LǴ�$f
��gf�y���������g���7o~��X�KN
-����O�K��؏(���sWv����ְ ���w'�����˩X�93���5�v,A�c�q�ܯ�X�޵|�w�����v�)�.
-Ո�\Q���|:5mO]e�ꄏ��g�o��},���yOC
Z8��C�_�����l=v�b�
�o�ӹ쥶��gF����$!��?I��j�2n��{.����������2���}SU,��Kr�EZ���<nv)^&ʤ�
Ao��iF�}���d��8�[^@
-�=
�y���m�X��e!8f*�֟t/���NFB�]�+�{#v�p�0S�y�!^��1�Z?.`�
��ɇ���_�(
�r;�d�۱��ck ���]j ��th���n�G��`�Yit�˂|�� z$��<��&*L��5^r9z�4��Go�

;v�~2��X����Uǟԩt<�
�=� ��઺���US� ��-�c���^}_jT��O��M[.�3�$��E��7u^ݹ�1�Κp���
�]��
.1}�A-��He�G�1�;O�p
_����a��u��6�-y�7�)>����ɗ�'��)nYJ��E��z��-��붜*�dΘ\s�|l�9�y����
-L��<rK�_�o��Ԓ &ӆ8$3TE]
�C0��Q�
�8����f�=
-����Z���>w/�vy/(�Ǔ�`A��#
-�����
R5��JW���
>'h�^S
�JQY�����
��ó��^��~PR�G_��p���(�����ے���$�X*x�ǟUi�eq3T㾭P� �#�R�󗜅sbˀZf��<��
�e
J1t
J�l׷��T]�=�xIQt��k?Q��c��g(�w��B3m
(�T at _�����y)�a�"��S��%޹Uy?��ܰ��h.�A�M�����LC1��t��?>%{�Q�ԽB�I�p��y[��`��!��u. �c��ƐE
�	�m˱��� B����8ly+Nc�d��m���r�QF���y��|�U� ?oʗ�
א��=fA%���/��;��N��F�'�cu�=O���B�:�*�uρ
S*M�%	�CR�9��w��?�a�ꕒ�2|�\�ޤl�%~C����)W���U;��43�%?��FZAc��lC��K�Q
A<^�t���
�C�����8
�~�p`iH����<~��R��?kp�6O���d#�
QFv{��D��tL�n� �{4�
 �m �fDH�L
-��C.���d�$�E�����l��uyr}���'
��\����zk����z7���
�鄟(T��}��������P�B6
���Y��1	ٻ��q(�˚>ˠ�]]޿0���
-endstream
-endobj
-1255 0 obj <<
-/Type /Page
-/Contents 1256 0 R
-/Resources 1254 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1201 0 R
-/Annots [ 1253 0 R ]
->> endobj
-1253 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1257 0 obj <<
-/D [1255 0 R /XYZ 89 770.89 null]
->> endobj
-62 0 obj <<
-/D [1255 0 R /XYZ 90 721.073 null]
->> endobj
-1258 0 obj <<
-/D [1255 0 R /XYZ 90 701.791 null]
->> endobj
-1259 0 obj <<
-/D [1255 0 R /XYZ 90 701.791 null]
->> endobj
-1260 0 obj <<
-/D [1255 0 R /XYZ 90 355.742 null]
->> endobj
-1261 0 obj <<
-/D [1255 0 R /XYZ 90 350.298 null]
->> endobj
-1262 0 obj <<
-/D [1255 0 R /XYZ 90 183.145 null]
->> endobj
-1263 0 obj <<
-/D [1255 0 R /XYZ 90 177.701 null]
->> endobj
-1264 0 obj <<
-/D [1255 0 R /XYZ 475.551 77.486 null]
->> endobj
-1254 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1268 0 obj <<
-/Length 3505      
-/Filter /FlateDecode
->>
-stream
-xڭۖ۶�}�B}��f�坔��g/Yw
;q�M�s�
� Y��y�F���`��7vO_`0
�P�d3�&�N.nOή�p2w�I�Lnד�7I��'0ZM�:��'ә�y�s��қZl�;��/��'��^�5�
�=����É@o���M�ɲ<y��7Y���s�y6�7H�$
-Bh�ɛ��x̝�1v�a^�֐W����n���XMgA�9��j�٥�k�l+�4O��9M�<
Gԕ�6
ݵ�msI����5���z�:���R6��ZQ禕�hu=�}�1°�9�N��{�Y�a4'�_��
A�zK
����
jQ�zG���J��`V����0�R׼v+jQJ`����h	WX��\0`�� \�
��,�R
-؞Z��1�c:�k��=w�UQP��-u��e.�
ng��?�X� �m���Ux8
@��@��J֖��4�
w:��Թ����Ű�X��Cڅ�cg�����m��y
-#��\����%��
���X8Z���M�̩'x����`��t�������*
���u�b
�A�"g�F¾�ZҨ�� v>"�8
;�}�h���Q-�+-B�'N%��Q�bG3���b��r[�RVVLp���s\���Pa"�-��������C�z�^�G;�P[
��Z,��g]�{!�>p����rU[�qЪ�!<��Z����f״��~-��l�A�Tq�:?窐4�抩�a�� p@����&��EzLO�)pڔ�v̟��z��4tJ��[�w�0Z�g���wS�s�I�9e]�O����!m}Qlt�ڼ�=L �N�Wj�;"��
~ԕ(� ��(	f\Z�Ee��o�1�4)ݍk�1ECT�`,��Bf�;
��(5
�#��c�F������qV]��	�
XtC-D��Z�W�٧�s�w&V���!�@ �G�a� �X��\��CC�h���?��1���w^�-F�B�47n	�Jal�~�

����3��\�UU! [...]
�Pӎ
��#�NjB�i/��s�C�]4�-c
�WH+� H�
�����,�CȎS�Ɲ��^;ם���_0�@#���:}H�oK��;�]�R�l���;�
*��!'�J�O�!��M�Uc2E�ט���$q�i��|$t��Eqv6�%�H]+�
�	jz��!�is�U��
v�ڄL��*]�d�mw�`�8�u�?q�C��!�
�@�S8������[C����oL��+�i�����݃��_�~m
��1��O����55��i܅ܨj@4�e�s
F���#Cr��Φy/�*<��Q��|�_�s_}��S�)�
iP�}���j�wռ7�b9��=��

�컣m
������M�z1D�ϵ!6���%�G�����  2�����xr�*��1�����A,�ɺ�3�
9�!)i�.�v���>C�Y>�
G�V>z\o����N��90�_�Mְ�k��ԯ�'C�|G�2��E��{�����kH5��7Tű�;^��7��]���1��G`\�xT�og~ x����X+sU��
-�&��O���C�|�#�o�e���
S��7�84ugr�,!mޕ
L��"S�
���@�;Kn�X!QMD}����Fٕ�����*
C
�$
��Fm1�`��X~q`)
���A�s�0�\/4E��LB��B�݅G�]S*�
�̙��BJF�W�>	` 
�$v~Э�;̲�8A�O���
*6���foL|��{ � ������
Ƕ��9J���"��=���d<�nM��ߢ3�9������
`��O�}7�}��c`�����E�r#�L$}m?$��n
�����
x�
�	p
;�dn�X�
�
(�$3ND[rY�JJ�K��%�ə4
���

+��Q���7O+؊}M�PE��������R5S�n)Vv��
$��q
�����#�J���a1��;p�(Ӹ<�M6-��V�}�k��j��û��
�
�2lm����v�:�E$�b��ӗː��W�}j�E�u,��Z����(�'�r�PC�~�׫z�U�?Vތ��($��d�
3�Go�[z�B�
q�ȚB�z�
�U�+4�4����%��6S��1�м:�h��E�ݪ�<
�^1�Cz��_Z8��������|gͻ���ԛ�S&���'q�
N�
'��3}���΃��1U��~�~{^-��/���溱�C���`��jJ����q�&�~��wa�W�S#��Z�ku	������4���PׂZZ\5*Z����4YBE���m�7��)a��$ށ6hE�\�Z��0udC�)��̇~Y�(�HA��A6z�_�]�Q
?�T�C�Q7���i�:�+s�Z���oN��<���G
��}���s�=��@۳8t}<��M��/ν�Q���9z�=�s��%���Z�x��#[����U�w�K/�/@
಄ZHQ�>�V�. �票��m.pf�\��>����`E3��%t=���Sz���
J��tG���賌�
T��"?tn�C���
���Z�\[
Ѡo9����A~E�wGCUA��V~gn
]��)�H�c�a����{
�l��c#L �����k�P��qv$�l��������b �}�T y`��f0�U|U�߉�,��(��b�9B�{�=��<}<ynrȄ^��y
�U��"�!~�+ъX�=�;�D�k�[=���E-�ب��
- �F�l�rv�Š���t�L��4L@��'b/�8��(N���\)�o�r�h�d���Rs�P��X�Z�O�
|�E�Tc�{ݛ���0��6��xᭆ����V���y{5���1��
�?�,��������
������C�����~����&}ih�� ��
� !%I=���,4��
���Mӣ
�����F1�
����Rq^���.��dG�d̑��,1h>�I��z~/j���2ϟk��>�8>�k?�u�h�����4��<#����=��IKzp/xT�0~p�
�- q.@��\b	�!ޙ� ���\ۙ�c��
��2��^0�������s�vN�\��W��J��w�h��B�
����{�w^������+�
��b�~x��������w+�J�mWo�� q���5�%M[��XP�v�8�X�v7[֪5kG
-�.g�*�����B�V&(�6z��
RKtJH�n*������
�Z��K
Pc��#i"�9O��k^�Z�%y��
O��>(�Λn���&gT��1�?
q��t��
���A���2�JZW3b7%��ޞ�jw�����
-oqj��R��oɱً��0��K��C\�@��T#
=��8Iঐ�~��p�?n�� �M��3����4��<L\y���(���i{;T�|L��ï�5\S���FJ柘�����Te
X��ȍ~������٢ۀf6�R�cD�
s�K�I�ږ��?���S���� Ĥ�J���2�O��`��f�.d��MN�4��W���ZŃ
-endstream
-endobj
-1267 0 obj <<
-/Type /Page
-/Contents 1268 0 R
-/Resources 1266 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1201 0 R
-/Annots [ 1265 0 R ]
->> endobj
-1265 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1269 0 obj <<
-/D [1267 0 R /XYZ 89 770.89 null]
->> endobj
-1270 0 obj <<
-/D [1267 0 R /XYZ 90 721.073 null]
->> endobj
-1271 0 obj <<
-/D [1267 0 R /XYZ 118.403 310.764 null]
->> endobj
-66 0 obj <<
-/D [1267 0 R /XYZ 90 294.098 null]
->> endobj
-1272 0 obj <<
-/D [1267 0 R /XYZ 90 265.567 null]
->> endobj
-1273 0 obj <<
-/D [1267 0 R /XYZ 90 234.976 null]
->> endobj
-1274 0 obj <<
-/D [1267 0 R /XYZ 90 190.559 null]
->> endobj
-1148 0 obj <<
-/D [1267 0 R /XYZ 90 158.813 null]
->> endobj
-1039 0 obj <<
-/D [1267 0 R /XYZ 90 127.068 null]
->> endobj
-1266 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1284 0 obj <<
-/Length 3161      
-/Filter /FlateDecode
->>
-stream
-x��Z[s۸~���S��F0��7'vnk���i;�恢�c������= o�8�mg:}�s �������N^�=�=;��$$������IH'Z�D��|�~�}3~@X�� C}����Woo�;��=���N�
��&����':Y�̈́�{�i7�\�s;Y��vF�K	�KaL���f�0f?�fʕ�gI9�q�{��6�8�ʴ}��O�mR�ϧ�ƶ�iQmV��'\��
��?�S�X�l�	��/SN�|[�;��i?c&��I x3�uWu1�s���U��ԭ�y���UR�5/�4��dly���Gk�e4�/��
,T�v
ԌрLg�Qo�/�l
��-��>e�yI���8���3xI3��)����Tf��g�9	C'���._���?�gJ5��~ k��T}:��`ۜ��}�;Ѱ�h�EEka��ꨗ���3G�1�s�9>��{�n����#��l���([Y��!����<eȄ�0`ޅ�É%QaǬ�]�bE�缰b�!��@*Qm��,�e�U��
�UZVE�D�ԕ�3�
���4����\W���҉�]�ϋ���)B�'�mo��
kf���5�>�'�2e
-PQ��C�u�
��:IV����_;̨�f���L�z�yX� ��
3�`&���5�W)�-F���
�!�9@�r�Q�h8�
��Q\Yq�ke$��GC�s
h�@�F�\
��:(9
��|\6h��TK�!�F�mbg�*w����M�֯(d�?}��>m�親�O�����I
�#[D��
���-Ƥ�;߀���D{����<Ȧ�mOɝiA�j>|�,
W��Bt�g���PM��;��������nPB�ZB�+7b�|Q�,�U�t:ST@��i�L�h
*�0���m0�>�<0_\z�]���>o�d���i�d�V�$I��
{]�Q���u��]��l���M�a1�S���vv!��
vP�΍6s
��(7�n�0�
��pH�7jL��q�(�<zfxV�|f��˴ލ�v�(��z�t��g��j�
=�"A�
B
�B\�2����n<�A{6��xD����#�l8b�
1�q
mdi�8��
- at 4���9�3q�i�V������-�'�U
-"�n6u�L�DWD+T2���/�ze���Eeދ)���q鞷Hˋ"-S�H���gf�m��q�عH�|��V���
-�O�g��:;�����&Y��dQr(�6<�#�x'1c�E]��ؾ����
�r
-a�|}a]ݾ��jP�{Yܧ�7�U���J��� D��Du��c��j�<՗I�K���U��M��1,�;#��~
���c6<�
ā��w�����I6cJv�d?�`� _ބ�iAJ�T��[
?�P�=��Ud��;C���b�8O`v���Ӑ7Co���!�i98H��f�&��ׂy�<��H�ʎ(�*ٕ�`���:[��b�7R0숁uc5YH|�f][�b�>�9��e�E
CXɾHJ�������ȿ��
恥���@k!�P����f��
�� yh�
���
2pe�:�@x�F
6e�9
�;
-����udx�����
w�cٷ"L�p�
�(

��3
�
P�0�Q�G	E�
��j��ʓ�T H��1����3݅gȚ��
ϐհ�o�RGs@
Z�hp�C�
�NW�.-Z!k��6��ᙡ�'���aV$��>4Q�O�� ]����h	��:�(0h��� �g�NYs Q����Ӹ$7��T2�%1&O&���� �1�>w��J�^�����#I�+!���V�x�1�#��$���AT�������{�f0��!�y�
W������.p�F��R.M
]�r���֦����_�	�`�38��&�\�$h@��ý�Z} :(
-�����A�h6�����!`�\T|M���X����(`��.���_�	ׇ)�^��\cy�rU������5� ��͝6P��c&CE�m�I���
�u��Yg3�5wϦ"����lҌ�@b�
��d6��l���
g3
���
�w=c��
Gpd8���VG+�vah�]y��>**�
o���</��f�
�~��8��EO��Q#لr��XAC��
-�����3J�ݾ iu~S/�h�$ A�	
	H!�w�˓����A 9 ����}@JH��o0':@���pL�
@
-zH1�h ) 	�q�w	��!_)�=�R���|ew��Y/
�׎��C/ό���8��冀��h�}Q��	&���H�b�'��Kq�e����+��+�a�qSLP⨘ �S�&��
��yu0,&�
��ܶƋ	���
/&���� MSL�Uv�f�'�1$	�<X^�
�	ks��"
-#���y�ʳ���U>䤭ֽ�@�܀g3
MRڕ�X��A��ui*{�*�ޥq�:Z��6�Q��>8�I��e������S?|5ꇽ��I�f�^�:���@7Q�V����+<���h�%��X�E0[_�̞�Zd����n��@`��Z�q
�:Y}���w�fw*����-��������m �J�kko�i���o��	"�At-��f�B`ʨg�<��I�1_D�K��Mds�x
mS�D�Fn���
wX����`�‰��±��-�q��d-�^����5w�F㨽�CR�q��X7-s\�TO�W�q����B�a�ƅ�?�q~؋� |�`��E�0�⚚�	�
�-���h
��10�m��
�W0E#}r
_��g?m�
����ǩ��# <}G��P�A�%���+ڳ��Y}�Y}��:R�A�$6�Q
�>�W�ꋡ���߷�\''K�R�":�00�o�~h�?'*H��y�]���ej�l�MY�3�?��E����@�<;����"ՠW
-z	
�����'O�]9ި<�
-�������5_YӢU7W��o�]SJ���7fy�L'es�
-*
\�Q�nly<��-��1�z�(�P
R@�-M=C��(�.��) d��M�1?�������T���>��T��RCfo������i�
��6�f�#��މ�e�u��`�Y7���l)�-��hj���ݹ>���q�|ss��2)~����
ϣ�n�4P�[�7�fPVW�2qF��Xo=X��.ޏ+H����!��
��׆����m(�ګ�#��
��

-endstream
-endobj
-1283 0 obj <<
-/Type /Page
-/Contents 1284 0 R
-/Resources 1282 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1201 0 R
-/Annots [ 1275 0 R 1287 0 R 1276 0 R 1277 0 R 1278 0 R 1279 0 R 1280 0 R 1281 0 R ]
->> endobj
-1275 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.519 614.155 513.996 625.059]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.comp.leeds.ac.uk/hill/Papers/papers.html)>>
->> endobj
-1287 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [113.91 602.823 289.253 612.72]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.comp.leeds.ac.uk/hill/Papers/papers.html)>>
->> endobj
-1276 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [225.322 367.695 328.933 378.599]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1277 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [345.113 367.695 538.388 378.599]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
->> endobj
-1278 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [211.932 320.794 429.117 331.698]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1279 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [123.594 156.803 340.779 166.701]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1280 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [211.932 74.333 429.117 85.237]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1281 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1285 0 obj <<
-/D [1283 0 R /XYZ 89 770.89 null]
->> endobj
-1060 0 obj <<
-/D [1283 0 R /XYZ 90 691.48 null]
->> endobj
-1286 0 obj <<
-/D [1283 0 R /XYZ 90 645.297 null]
->> endobj
-1288 0 obj <<
-/D [1283 0 R /XYZ 90 598.301 null]
->> endobj
-1289 0 obj <<
-/D [1283 0 R /XYZ 90 538.822 null]
->> endobj
-1290 0 obj <<
-/D [1283 0 R /XYZ 90 503.876 null]
->> endobj
-1202 0 obj <<
-/D [1283 0 R /XYZ 90 469.05 null]
->> endobj
-1291 0 obj <<
-/D [1283 0 R /XYZ 90 422.149 null]
->> endobj
-1059 0 obj <<
-/D [1283 0 R /XYZ 90 363.173 null]
->> endobj
-1292 0 obj <<
-/D [1283 0 R /XYZ 90 316.272 null]
->> endobj
-1003 0 obj <<
-/D [1283 0 R /XYZ 90 257.416 null]
->> endobj
-1293 0 obj <<
-/D [1283 0 R /XYZ 90 198.56 null]
->> endobj
-1294 0 obj <<
-/D [1283 0 R /XYZ 90 152.281 null]
->> endobj
-1295 0 obj <<
-/D [1283 0 R /XYZ 90 116.713 null]
->> endobj
-1282 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1310 0 obj <<
-/Length 3384      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�H��W�T�E����
��xb�<�3�5I�DK�P������� Eʔ�j�j.�@7����h��r"&o�^�
���$��@���I,&��}��b�ѓ�
�3)��^fwyV.�d��J�=L?��:1R�B�0�S�[��o��<��(&���~M�룏��dͿN���h��)�'Fi��'7G�
	��xr��&�_��Pw�ݳ�^'���b��v����L��{�,���J/9���z�S)�礡w�Z�dy���K������~��w?��i��` 
��NI�HQ����r�K���Z�M�;O�:����$�S~�,fn�g
-����
� ����_J�?Mg*�ަ�V���X�EA�,�?K���u�Xyg���[2_�Uڰ̭�o��[�g��d��t�5eU��N^�����
��~]M���y���4&� جRj�u��+/K��廴�U�x�e�{
-�(�/���@GzeA�g�zSi������xS�7��kx������4/7kP�FZ3\\�7y��I����w��L��mU�9�����j��-�.1�1
��{��l�Vx7u��k�́�—�s�c�I�iM=�	g�j\%�*[
�$+X��Ph����-8t�������}O��뻴��ˋks=�1�
�
-���C����!Vu�H4�u�g�'m���	�-R�L�5vM�ۼi��j����6��!�=O�L؏qnJ��z���A��U#Th# T$w ��+�g�@9����@�;"Ԝ��C�١�uce�Fm�q�?B
б�١ٵ����PEY��25b>@�Z��
��t[N����
7���X
��ZEO,��_Wi�d���h
�&��t��p
ouvI�b����/�f8�%� ��T	o۔�IY�p1��O�>��5����{Ve��h�95
vd��[+��
��'[Or&À7�Y%�MS����q��i��{�#>4pp��

�_�ܜ�n�ϰ�L�;�;t�@�hџ��z�s�v�
Ҩ�C�#6��C��"6���ΨC�2� ��iA�T�MZ%h�4��vlߔ�gaK҆D
0���q$�`5�y�/�@ jR�GZP�I�a�K�
_�C�<D���n7j�Xy��r��4��
-"��
�M�wuS7$�(���P�$z�V��
=�\6Ɏ�2
�'��
۬���3�]l�YYܧ��b�����_��^�-ث�&9�gJ������a�e�]�p*�!=� dog�؏t窗��v�z�+����!��J� Nў���3���S��7j0e�~��v&M�~�SSn�h����]{Xp���-��`���B�dɚ/�&��[�k�؋Þ�'�������Q��.�j��zUAN��9��CQU�='v�sb�I
.�N��;'Ƒ~�&
0Ȓ_���c��Ę��&��
C4�����
-b��
N5z���iİϵ�j������C��#�*z:

�4�gyr��4B��
�
�ˤ�z�/��-N�:ҳj�͋��o߾��ϭ�`����٦���B���);��Wݡ�Ӷ&C�k��}��i��M��1�'O��6�
-��<��[ V��enf?s����D�

�;�E]��":
4�E����q=��M�G��N�U��ǂ���6L85����z�	�З
���$�f�d���_(�0|���~�& �X=B���x@��>q����;��F?h;g�8�ġwK����)u�޽L���z�@`�
q܀Ղ�`�y��IG�;�Q��^
��*�: ���
ݐ������x�@d}����[�cр���V0[�u�׵�tz ����c�o� R�3�2j��S3�}����s�g�v>
�a��S�ç~|8���g��,l C���g,}�
|"��N��L��fG��6��c0�0�c��cR�'��&sus"�DdG�\�6
����yD�s�#��0
.9��*�?��F�1��0*%�_�W���O~ 4�!�c�&xff��
�G�I������ZR�s�
 5r�Ԁj���Dj�}��@KGj�k��;�
��؆���gî�U�9���e��� m�����
�6x�P=3�&�"
&�ĺpbL<3ApL1����J�:�@��rw�鰢d5�kN=�E ������n<Njhr��@�\n�����%\�w-wi�Q9[o*|e9'�����X� #�b��t���
x��%�iʆ��S-����������7�����0H���>;����<A�=��*�'����e��� ��n6
Z��c*��Q���玹�5]l����
��EJ�Zn�3%,�

-AlT�;
����`��.X���~x��.��j?<�H.ԁN?<���C�RI
A
�%�8� �˯C7��`���2��V�#��OD%��z �Y�}�%��=*��DI
y�y%�ޜ�PH�ԏEI
�%.Ə��P��W�1�n�.
��t?�„����n���Kt�?^��� ����ƙ6wo�媡KL����b6�/�*kVk���p��'԰X�*��I�T��2�d�6�Fǵ"�9.�M�x-,l�8�
�
y-�
p�~���.=W
�}v� �È�0�Î
~
i���oi��Eq^=u�
s���a��vT�2�M���7���*|�H�����c~
��D�d?V��`$�ާ���ro3��
(��u:�u�
�9��
��RZ�N7�������ѓ�6��<�U�}4\
<�u��SZ�Q���$�#��'�(��3#���gU
X�fl��|��|4aa�U�Eی��[7��Ap���uy�/��?y�=�P����SX˄���mOaAvβq;��qʧ��#���Q�1iQ�����p�
�ۂ��)7��'fU��=�*Z�+H^c�ȧ��rY����j� 1��k���i���,�c;�²'��0~���GH0F{�#�
!q��?ՠ�F4<W�&?W�x|ȋ�.o��@i
4�xvԍ�;;��������Ύ��-:pv��+�w]*�u�G
&�5x�&�g������5v�D	���
����%�z��Hrz�A���#
(_�֛���^W	$3�<��%�>ܜ
�7�s���G�Q��x���sGK���e�0~U��p�7�~u[�
��
�b#��o

����

-�j��
Z��������
�{6/��?GN����]�%�X��B�CV�G�B<�rF��
�!��)��>
�O�්��D�P
-
�hB߂>q�/���������_�
��
�b�
���*w�����ι��t߇���m�uZ,�yG^{��[G싰cR
ℷ.+^P�>�rf�_}��h����	��?� ��0TN��mGn8�X�ɫ6x�9��,�
-endstream
-endobj
-1309 0 obj <<
-/Type /Page
-/Contents 1310 0 R
-/Resources 1308 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1324 0 R
-/Annots [ 1296 0 R 1314 0 R 1297 0 R 1317 0 R 1298 0 R 1299 0 R 1300 0 R 1301 0 R 1302 0 R 1303 0 R 1304 0 R 1307 0 R ]
->> endobj
-1296 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [440.273 511.24 513.996 522.144]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1314 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [113.91 499.908 265.342 509.805]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1297 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [482.116 419.946 513.996 430.85]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1317 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [113.91 407.991 307.186 418.895]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1298 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [154.856 396.659 258.468 406.94]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.646 350.389 426.585 361.293]
-/A << /S /GoTo /D (index_BHZ07c) >>
->> endobj
-1300 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [294.32 304.742 511.506 315.646]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1301 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [365.665 292.787 469.276 303.691]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1302 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [194.168 247.14 411.353 258.044]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1303 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [316.241 235.807 419.852 246.088]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.098 201.493 414.595 212.397]
-/A << /S /GoTo /D (index_BHZ06b) >>
->> endobj
-1307 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1311 0 obj <<
-/D [1309 0 R /XYZ 89 770.89 null]
->> endobj
-1312 0 obj <<
-/D [1309 0 R /XYZ 90 721.073 null]
->> endobj
-1313 0 obj <<
-/D [1309 0 R /XYZ 90 656.959 null]
->> endobj
-1203 0 obj <<
-/D [1309 0 R /XYZ 90 598.64 null]
->> endobj
-1149 0 obj <<
-/D [1309 0 R /XYZ 90 541.038 null]
->> endobj
-1315 0 obj <<
-/D [1309 0 R /XYZ 90 496.013 null]
->> endobj
-1316 0 obj <<
-/D [1309 0 R /XYZ 90 461.699 null]
->> endobj
-1318 0 obj <<
-/D [1309 0 R /XYZ 90 392.764 null]
->> endobj
-1319 0 obj <<
-/D [1309 0 R /XYZ 90 346.494 null]
->> endobj
-1320 0 obj <<
-/D [1309 0 R /XYZ 90 288.892 null]
->> endobj
-1321 0 obj <<
-/D [1309 0 R /XYZ 90 231.913 null]
->> endobj
-1322 0 obj <<
-/D [1309 0 R /XYZ 90 185.643 null]
->> endobj
-1323 0 obj <<
-/D [1309 0 R /XYZ 90 116.086 null]
->> endobj
-1308 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1338 0 obj <<
-/Length 3496      
-/Filter /FlateDecode
->>
-stream
-xڵZ[wӸ~��۸kWW��@�e:�s�Y��&j�cہ���goI���M�5�[ںY���/
-��fd�������K�g:�	Kf׷3MfJ�X&PZ�>F<9���͌'iLu�l��_�_����B����ї#
-"2����U:[��>�IfK�~3#1���m��	��Y̮�~;"~)��(�)us|����?��]���		�Hͺ�~���<aѳlUfu�J�F�ǔ�ȋ.�G��re��՝�6d��LF����(2$"�N7�"_dm^��kZݺ�����3�:+\��Zo�mز�\���؍�3�T����ZJ�Y��M]�na��������'B��
녝
�wY��fW[���Muۆ"5�Mk�M��8y��`
_�n;��LUs���p>�_fjW�Z�\7��d(#1��XO���%��$"�_:w�e
��h'��D��H4�D�
�@a��9�&
-�01g!�n
�P"GR tL��3��͂I�L�ȂI�
�P��ug��4�t���-Z���U^��KӚ�;`������⁀?�=�\3���|��@����ܮN�L���4m��ys�e��6[���\�
M��&��|m��˖�{^d �
�b����2�/��m��d��eY�����-��8� �
2� X
h�02
��EvS �)����c�ϳ��-�E��P_w�wm�yzr��۷x���2��qޞ\nozu?9� �Z �
���U]ÙTH�i&���M]���
�.ձ���yn���"��P0.Ve^d�ڂ�-��YNJ��	N�-�_˼
��QEǭ,!����	b
H���T���Y�z�
�5�f�
���h��=���ĩ[�ƽ�S��x^͝�ùɏ���W�n}xu4�h�cn���s,�8�2hk��L*K%��%M
�@��\�'��y�$�(:�
���o!�� �\�~�\�>$h?����&Ʌ'IH.<�#�D��������VR)c�z2����_��J>uB4`�R>ik$ln`j80�g�D�)��+�n�HU`"�-:��#;F
�$��ʿ�U�:H)���Ǻ����P��v��f�jL����8MZnms��%PMc����A�S
3؇	�/��2���Lv�%���C�$����&����8%��>��������>�]�1��â+=\]!�ӇM��.wo��)VU��wk�"�
���n�
��)K�L�bT��Ѵ۴��2��Rn�
��UK?*8V^Y�ν�0M�*���<p�B�
�\����)=�?��,N1e��')9L�`I)
aN?Ċ
-��
�챢��Cݙ�Mc8��$�q4��4	��3%�8�@�)����)�}� NJF�dgC7

�)�1�����l0��L�6m}���z�y�cbG�>6Ib���I ,����υ�SN�#����4����k���\����xfRD�@c�I>��52�
�
-oL	l�[9����|�
-��U-�7y����
-�C4'e�a'g7%FR�⮮�j۸vEV����X;�ѹs�Tł��).��p�u
��
-n�\G���e^|�c �6>ZU7O����X�~î
7Ʃ_=�B��=�� *Y�\5�������DxI�;�r^B�W�@��]ݯ��˷�)%"N�8��6�0����0,Ć4�'����&
-
�
��;�.8u��W�i\w��@��b�@�*x��5Ϲ���u�P5I� �/�S�
�A�-�MG�C�4��԰ǰ�ҹ��A���Q�"[y�z��s���jqn�~f�B�p��"k���v�j
s��[��-2�)K���
��k�h�yW�_�Ƶu�	/�v������b����`� �ޙ,o}Ͷ�CYr�'D�v3�b�XJ��C)
-a��EĦ��ʅ��e�ײ�E;���Z��Z�3��-��z�s��O&3&:�#�UK��Iu���/������w��I�G�l�=��[�p������C���m$�^�
�;�EV�?�k�y���R����c]j	��/߽8�׾�pp�	ס�Pr��Xf�Q>h��'[q��{�
w�q�R1Iv8�o�SPy��);�X�X�cƼB[�F粳a�@�@�K_����}eM
V�~u�ߨNQ�Ѹ�3���΁{PK��)��/.s�$�S9�m��r� ��0^�$K/9�i�m�'C��֟y�t~�Y���ȶm����Y=���������L��:*�b'*������m���sA��
�7-����m����re
l(y�
 � Mr�-K�t7M2�r�g����M<�����#��I+(��?8E&W�

b�]J�����‚eKNbj�]��8�|16J���c,����b�˧C���OBLB���!�b�'��B
�͒ f��$�Hn�4��B�q��S�@���b�t/Yq���G-�W6�������Xb6�A���G�4&J�d
�/S�' �Rl�,U���M�璌��>��
�H�>e|�
"��
��b�
-�+#JeDɩ�
����NQ>

e]8����\�����-k��z18^��X�T�K�q��q�7oƩ]���}0P�5w2/�0q���y�;s;�n O� ��0
sS�T�y�&g�
v��yѻ�����q�e��ډ�I1���$�~�
ˮ��m�L��o��il~��4	�/^eUM�߀�
ʪu-E�?�df�|GG����^e�1��{᥷��d���.�����)$��+�[�
",�65w��Ųr����|�˭��;��Ϝ�m�^�
#t�sm�p���&S�������#mk�XC����hL�|�q��L(�O<�j'q"�t

}�ZkC�t���플S&�!�Á5'����n8�
o���"[�%���M����/�
�0����Y���5��4��QgI��%FB
/��|m�����nRc�+Ad��p�^c�Rv�XX�ŗNc��T���
%�]�Q|'�X�z���8��ű�b�?x�(g)^2�{i�2��9�4�����{�U�.�^��1����
3�S��.���Ɓ���������I������KL�Ċ�q��G��^?�VP7m�D����т
vF���Y]��V�D,^@۴��q�b�<v���1���!���`$M�����V�8M��h'8ј���:���'
�1����*y4���zJ�mKZ\w�)�n'��h�[`�}L������.�fE�e��ځ��v�[�4��U��?����V`�3?��<��ɐQ;�GR��2�C)@&�J��gx�2��
���Xq���ַM��M8
J���:X^
Q���/�7](J�;J��t��v�0p%
�^l˪���@��� [...]
����z_E������tYzX̺�M�י>��;����w
-endstream
-endobj
-1337 0 obj <<
-/Type /Page
-/Contents 1338 0 R
-/Resources 1336 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1324 0 R
-/Annots [ 1305 0 R 1306 0 R 1325 0 R 1343 0 R 1326 0 R 1327 0 R 1328 0 R 1329 0 R 1330 0 R 1331 0 R 1332 0 R 1333 0 R 1334 0 R 1335 0 R ]
->> endobj
-1305 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [188.47 639.905 405.656 650.809]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.587 615.994 394.526 626.898]
-/A << /S /GoTo /D (index_BHZ09c) >>
->> endobj
-1325 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [482.116 583.807 513.996 594.711]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1343 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [113.91 572.475 193.611 582.756]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1326 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [210.986 572.475 404.261 582.756]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
->> endobj
-1327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.005 339.186 357.146 350.09]
-/A << /S /GoTo /D (index_BMPZ12a) >>
->> endobj
-1328 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [194.985 295.667 298.596 305.948]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
->> endobj
-1329 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [318.23 295.667 511.506 305.948]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
->> endobj
-1330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.297 283.089 243.016 293.993]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-1331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.831 151.22 224.415 161.566]
-/A << /S /GoTo /D (index_BRZH02c) >>
->> endobj
-1332 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [277.924 151.22 495.109 161.566]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1333 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [188.779 119.033 405.964 129.379]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
->> endobj
-1334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.334 119.033 501.476 129.379]
-/A << /S /GoTo /D (index_BRZH02b) >>
->> endobj
-1335 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1339 0 obj <<
-/D [1337 0 R /XYZ 89 770.89 null]
->> endobj
-1340 0 obj <<
-/D [1337 0 R /XYZ 90 721.073 null]
->> endobj
-1341 0 obj <<
-/D [1337 0 R /XYZ 90 681.622 null]
->> endobj
-1342 0 obj <<
-/D [1337 0 R /XYZ 90 612.852 null]
->> endobj
-1344 0 obj <<
-/D [1337 0 R /XYZ 90 569.333 null]
->> endobj
-1345 0 obj <<
-/D [1337 0 R /XYZ 90 526.506 null]
->> endobj
-1346 0 obj <<
-/D [1337 0 R /XYZ 90 492.5 null]
->> endobj
-1347 0 obj <<
-/D [1337 0 R /XYZ 90 436.284 null]
->> endobj
-1348 0 obj <<
-/D [1337 0 R /XYZ 90 380.186 null]
->> endobj
-1349 0 obj <<
-/D [1337 0 R /XYZ 90 336.044 null]
->> endobj
-1350 0 obj <<
-/D [1337 0 R /XYZ 90 279.947 null]
->> endobj
-1351 0 obj <<
-/D [1337 0 R /XYZ 90 247.76 null]
->> endobj
-851 0 obj <<
-/D [1337 0 R /XYZ 90 191.662 null]
->> endobj
-1352 0 obj <<
-/D [1337 0 R /XYZ 90 148.078 null]
->> endobj
-1038 0 obj <<
-/D [1337 0 R /XYZ 90 115.891 null]
->> endobj
-1336 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1357 0 obj <<
-/Length 3451      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�8��W�TmD �Gnv
{�<�{vvg2Z�%�)R!�x�_�_���YI|�r�	5�&���	��r"&G�7G��7��8P���n�I�Ǯ�k1�ӑ�
�3)�pN��<+�U�YM�v
��\N|��
��
�B�
��9�|$A�,�F����Ͽ�d��D�^
M
̠��W
������#aW'�Rbi����Wa��ys;��<�	^��:hWy5�R:�t��*�u�p;)���Ӊ����cݤ���ܹH�lYp����"	�[vI�Xg5�
-�;�ө
-���NY�׆o�)h����p����j�\M}�e����X��K�
f
����d��Z�f���T�u�w���IQl����9y���?�7e�m���,�yUe�<��im�w<Ϯ�����z�%�wI��&���a����YH����
LT��I��T�T�l�uR�M�=�MYd%�*-�����o�'�%�0&)c-f�D�����E��f�}, O%\?�
�b�,���t
2mA���A�h�z�TF�4Ɯ"5.��4HB{^E:o2:*b�q|�i���ERU�T��l��d��3�
=W��3%Ɔ����M����MZm��I蕴�8"К��.?O��cQ�K�^ba�4���NV�X
N:�rSV��=����~��F?�ói_��U$�6,x��3㭶�v�Z��m�J �� �ŷ`g�5tf�,-�a�)̊,�|��
�	���Pk0�
m�̷�+�#v��FOB,"��b,�Ѕ�h������
i74�Cِ^*�&B�$`C��gi1O�,YBzFg.�Vω�� [...]
-
E��/Y��h~!3 ��ܲ)�u�!��])�]�Y?F�Ox(�	��*����Ch�)/v>��Ґ�@���z�¢qN���ڢ��N���ābݘ<<��i���FMf��}����a)U02�H
d4#���o�uYX�I�}����Q�
��x���4�bӗ�R��5�ӑ�Q���
0����D$
5B
:�wN�eYe�j�c�ʊ9|B
�����c�ie�)�]os��M��EY̊�^���}MF�e���V��g�?�HG���ڄed"�A
w�A���֘b���QEw2����^��8g�fk��
-b�>�>���<�}�N������>T)
�
]����OZ�����Ȥ���:�P�ϱm ��?�z y�
=��?�<k��	
.��	
��C �bH���NO;����0
�&H]���<BaH�ý
C���~C�7��$�t v0��
p{GF:#Z�
S��!�s&
��Y�
-rα����އ�����a1P�O at C

=�6���04�Ej�"�F@�x��jp������tE�:!ߞ�YR���?�� ���GΩy��7_��>����Z���'�r���¨�7iQ�S������NgM�c���1A8�V
�
-2��}?<���m���.m

-л�k
w[N��'������S
���ƽ��P,�<M�M�!:C�Dn��;;�"S��<O����m�Jd��;�Iݔ�|��
���}su|�m�e�/�3���\��J�)+0W��Ğ_�ΙN�-��v0�5h2������`"+3�ts" ��#
��q��Ӭ
�.��#���
��2D��-%"H���>d&���wҰ:���8|�Rh7���Ȟ
-�$�n&�I�m�Azh�����H��DO�(�7>�dw 
���ӏ|�N�>����
OD�O�V��6w����iɇE.�<ߟ?�����(�(rl�c�{3D/�*��(��q=ë�_��aY��;����t�9��o	�m���WU�0Փ�S�Y�*�c���*��j8�UigW��@�O�0�=Sz�����Y���
_��D��ۼ�w��jXs$��Q$���Kb�H[��>3N�Ce�y�ߧ��۬H0�x.bf�@��f@�ښ�4�wD�3�uNel�rv9��r�i��X�OL�}��v��j�1��|ծ$��cb���;܇���*��7Ӗ.�m^�y:gÀ!l�6x+��u�!
������a�ǰA�"����
Z��9���
���
-�ƣ��E����D�+D�tj
#M6�On�X��t�H
|�T�n,�Xs��������5qXhU�ģP�2\����,��>H��O~������t�vS�u�5!�4i�7��e�*ʼ\>N�2��wɶN`
-yX���6�������������W�b������t�'���i�P�Z�~Ҷޒd����
t�HVM�yy|����f��.�ϕ

�՝���߉(�hg��A;����B�;#��
�~�|n�n��H�Z��`լ�C���,���?r#9�ggf!�|(���s�4��
�Ѐ.We�����E	+g8�k��,{��
:>�IJ5�D��v���X��馶C8(V���u���m�9�w�0`Q����ɩ�iЪ��uRe_S
PE��E����KQ�f�%$�I@�ݩ�u���yU.Ҽ�J�>�U�C�G�%7����띪��SH��!(:8U� ��vޖ�e����{��bϳw����#��Y��uD�@����nN^�\3;��>/ ��w��y;^/@�1��^B ����f�UL���7O��?
-�~�M��
�T-�L��uI5O�hz�I:�@B�wrX���
�q]��R�����5-��"� ��r�xc*c��v�eY?t����"�R
��
���}�D��/�N�T
��-��n�-�@�,���A�L�$$�V�1��3���鴀��P�k �|c� #�jotsxa�5�&y���<�O�x�w��8���p��\j����MDX��1��a��;^�
VZ�%�dBoQZS{+
>H5B.��}{<��>ͪ��'��ۺۗE�xF
-ʟD!R�=($���!b�����q0� �h�g����U�s].����T��k���J��Nq
����ڴ?D���>4�˴\��h[��G�o������=_W�f���@�![��;
-�/��9f
�[�C�Vg��Ǩ��5�ب3�l	W��v����w�h���|��:��c Q��O����0��e���x�d�/���o�����C;�}~L���s<�����6M�B�Y�X���э�5\DHZw��d�bd=��*���]q��� T�F	�W�M5.+IS���l��)�+�p�,�_Oѥ>T���2_KaAd��b�Z
-ʪ1��$��D8WW�,D`��Ayn�֙-�Ѧewвh+Y�v�:�4=�[�K�ڇ�ǹ��v�xp�BۿE�`@W�b<-f]VvCYA�F�+�
Z+G'�ZI@������L�7h��v�%
�Y{���?P����
-endstream
-endobj
-1356 0 obj <<
-/Type /Page
-/Contents 1357 0 R
-/Resources 1355 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1324 0 R
-/Annots [ 1353 0 R 1368 0 R 1354 0 R ]
->> endobj
-1353 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.563 264.531 513.996 274.812]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html)>>
->> endobj
-1368 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [113.91 252.67 139.813 262.857]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html)>>
->> endobj
-1354 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1358 0 obj <<
-/D [1356 0 R /XYZ 89 770.89 null]
->> endobj
-1359 0 obj <<
-/D [1356 0 R /XYZ 90 721.073 null]
->> endobj
-1360 0 obj <<
-/D [1356 0 R /XYZ 90 681.491 null]
->> endobj
-1058 0 obj <<
-/D [1356 0 R /XYZ 90 614.515 null]
->> endobj
-1361 0 obj <<
-/D [1356 0 R /XYZ 90 568.053 null]
->> endobj
-1362 0 obj <<
-/D [1356 0 R /XYZ 90 524.366 null]
->> endobj
-1363 0 obj <<
-/D [1356 0 R /XYZ 90 479.961 null]
->> endobj
-1364 0 obj <<
-/D [1356 0 R /XYZ 90 446.794 null]
->> endobj
-1365 0 obj <<
-/D [1356 0 R /XYZ 90 416.282 null]
->> endobj
-1366 0 obj <<
-/D [1356 0 R /XYZ 90 381.894 null]
->> endobj
-1367 0 obj <<
-/D [1356 0 R /XYZ 90 351.382 null]
->> endobj
-852 0 obj <<
-/D [1356 0 R /XYZ 90 293.084 null]
->> endobj
-948 0 obj <<
-/D [1356 0 R /XYZ 90 249.397 null]
->> endobj
-1369 0 obj <<
-/D [1356 0 R /XYZ 90 192.319 null]
->> endobj
-1370 0 obj <<
-/D [1356 0 R /XYZ 90 148.632 null]
->> endobj
-1371 0 obj <<
-/D [1356 0 R /XYZ 90 104.227 null]
->> endobj
-1355 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1375 0 obj <<
-/Length 3677      
-/Filter /FlateDecode
->>
-stream
-xڵZKs�8��W��v�  �Gn���v
�ky���́�`�e>�J���ۍ�f�Mv�t 4@<����!6������뻣�o|gڡ'����,d3�
m���z�����.g��<��=�p}wv}�Ķ����/G
�،Si��,Ύ�����P}9c��oZ(��g:[
������'�Ĺ�9}�Ϸe��N/�x�������͜sn���t�7��K�5
�e
�IL�Q
�sn
����➞i����r\�r��X�{`�/�(M�D�>QT�:Ҋ�$Z���#F�ؕŦ�23��\���{��xr;������
-䫇9�ցj�|��к���e��3�|%�h�����R�.��7���7a�y l�y�{w�7�o�^���|��
oʹ+�"V0F���˸*�J�UT��kU氳n�����(��6k4�,����t
�2��p���y�UEy��^2`6�Q
G؈��sY���"�jN�~Ui��T^�VHn}��Q��̈��撦ŗ}��F�@�q��BUB�Ɔ�9N7s���E�`渏(�!�,K���g&����
l;9
�@ǹ�l/l�I/��±�Z�СaW
5��vr��z�������@]uRd�=�,�-�D���\�a<�]����;^h��7f��{ႇ�H�.�Ͷ.r���;S�a�mR��L�9êt��L�M3�$�=���,�k�
�!��nb�_�>���-�`k
1��� >��"\�a�J�-�ӳ�
-��}�R�A��:��V�Z��WU]���"�	=�3��0c
��4���jT^
��`W���$�0��M�v�Yǰ D�W8�)Lq��f0>��[��
�-ٮ��V+����=�SF�{�T�F:��p3��N�丶`���΀�1 60 ��	ۗ^߀�c
Hw~ �*L�2�����X�0����C��{0wh��lE�Q�OZ�L�oQ�Z�haA��7��(�V�nI[��^�~�-��*A�
��u�Aݗ�vՎ�V�x�R-Z��U��QB�W��G�+�ό	,)#�#
 ��$#iܼ�ɀ��9���=L��+���)-�@qE�_ړ;�a:�R4��<
���K��A�62/���(�V�����=O�!EQ@���E�|hU��5��^��=�V5
���:��t4���ʋm���``{
2k��UW|y��z?�	œ���O*��X���4�с�#Z��ڢ��:��,�b_Q��t� F��|�ؗq�_�Z[+���aT
&�ܻAB-��uF�#!���T�ƱVz�\�O`.�G��Ѝ0*��\�c.����q��"t~�[
�ڌ�����o���Ч�y
��nC v��9�ý�� 2���>"���,ી�����F
�8�L�YZ��u��j
l���^]�.�L�<�?a]��X��颷��&��M��6aqn��
�t�����
SIS��0�MP�v��
Z��ך�l��
 �s �U���G��m|�k{��2˿0N��	�R?a�y]E)�JOZ��hd��
��m��\�X}��b��<1x�]��eTV��@�z"�2�m]��Y�
�P�*�h�Z�;���!���a����]�.8���
���j).��cCR,����	t�#����|�ίB�4��`_�3�B��u�Wi�z�k��,@O��h�T�q@ݥi��ʽ� ܵξ��.x�
2s��@\���� � (��cU����2���2?�;P:���
�4��6GO�{
 ��e���
-]���x��������A��U�֜���=
�}?�7K*j*}z��}�N*��&be8Y�+����38�>�	�;���1�d� pM+@$�B���s����̈ޔ��i÷'s) N�e�7��6�jݦ`ԋk�>����Z��g9�~M�Q�����
8��qD����g-�w� ?1bd��
fa
�ی
-��pq}FeD���Ηjȵj��
U��i�q�
�Ck
=�Ĉy�/��Jr#@1 �h�է�}Z#��H�G:R�&<zᮃ3\ʩE;;��R}���@ 9�~g�%cHq=�9�UQ�H"WUM2@#�t@@��N�ԮH��h
-
ijZ�P�@Ɩb���Wi��C;�|
-Ɂ}��8̜�����ؔO"���k�@v�O�7"�*�eN1}��8gd@������Lط�掃��\	�ѥ�����"�Y
ǘ;�
��y �[Vɤ�K����N�֥�t@�Q�2

��
�&�)O�K�R��?����.΋4�Y��
g��u�K@�&� ��_1�����Iڜ�bx��:^8DO��'��Mv�:�&�����Z�O�4ԇR�^/Y���#�Tu˳Vzf*�M�k��L�a��	:��%u�
�+�A��=�(��>?�@��k��W��'���2����%����$��K���
t(C�7�y��8X��&]
��
��|��}*��uF���2S �\J�O�u��|:�}�l�a�X�c(�0R�xvM6
)�p��M�u����	=�
�8-�n}��A�?��FS���xl��?4E�yd�
�� 
-^n�}�p|�p�xkDs� ����N���E����‹�X4v�CC,M֎����S��3�m����Qf�kb�I��b=�n(���)8�M>�H�7J����K&0��K�٩���QC4&�ǰ��=��$�.���Y8�.�7`�s�^��`�����1>���о�HtL�T�C��J��418,�p���L
�`�@I�D�Ʈ��G�����
ڄ�c��
.��	����V
��^C���_0��b�T�	���E��R�ө˅�ہp'o��"|L
-�BdOggg��
����td�i[i�]ž����;���+b���P �e��5���%��\�S���]��e(�Q*D���Y�
C^M�#��*1�8�(PG�q��G j��J��܆88�r/(^�I��/a���8 &�)T
s1�S
O�38�k���͜G�>DP��똋��ɼ_��
Ӓ�Ҏ	h+�uk�oL]HX�p[���V�ۻ���в����
��8�b�5]�M�����p��
~N�P4��9�N
B�u�E�fK(�s� sl�z]�9�v�~=�ף ���ےu����d��ko�4�F
����k��jj�?,4�S��(��8�΍^���!~��h�>̨�Jiރ���dQ>T['��!P�AF�
���
|-Ӽ˷�/&y�i2�!k�<z ���b:N8�]�
-ĉy��5շ�Q�2)LŇ2���EE��D��m€������3�Ʃ� ?k,����z~���`������_�>�=�]��yOڻ�4�D����m��%�H�xڙ��)�w�J<Pݡ2rM�Y��*ts�i s��./o���$��Ĉߪ\�tBZ�4����UTC*�Q(��#��L.�8�6a��F�)���`�F�&UL�Y��
-����
-o^P�zڽ �
-�`D��SxFS.LNg�('T Y��2|d�%�?�y����������?�
1�q_['�ze���1//2gvZ�`�p
o�
��^��.x.�(��†b�[��77Wƒ*U����T�%-q*,#���
68Ѹ��VѼ
�i�C��� ���~[׻W/_���J�;.��&�uC���D�	&��jؾ��8�� ��M�
-endstream
-endobj
-1374 0 obj <<
-/Type /Page
-/Contents 1375 0 R
-/Resources 1373 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1324 0 R
-/Annots [ 1372 0 R ]
->> endobj
-1372 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1376 0 obj <<
-/D [1374 0 R /XYZ 89 770.89 null]
->> endobj
-1377 0 obj <<
-/D [1374 0 R /XYZ 90 721.073 null]
->> endobj
-1378 0 obj <<
-/D [1374 0 R /XYZ 90 656.863 null]
->> endobj
-1002 0 obj <<
-/D [1374 0 R /XYZ 90 602.56 null]
->> endobj
-1379 0 obj <<
-/D [1374 0 R /XYZ 90 556.815 null]
->> endobj
-1380 0 obj <<
-/D [1374 0 R /XYZ 90 511.693 null]
->> endobj
-1381 0 obj <<
-/D [1374 0 R /XYZ 90 467.288 null]
->> endobj
-1382 0 obj <<
-/D [1374 0 R /XYZ 90 424.821 null]
->> endobj
-1383 0 obj <<
-/D [1374 0 R /XYZ 90 390.434 null]
->> endobj
-983 0 obj <<
-/D [1374 0 R /XYZ 90 357.984 null]
->> endobj
-1384 0 obj <<
-/D [1374 0 R /XYZ 90 327.472 null]
->> endobj
-984 0 obj <<
-/D [1374 0 R /XYZ 90 269.174 null]
->> endobj
-1385 0 obj <<
-/D [1374 0 R /XYZ 90 236.724 null]
->> endobj
-1386 0 obj <<
-/D [1374 0 R /XYZ 90 192.319 null]
->> endobj
-1387 0 obj <<
-/D [1374 0 R /XYZ 90 159.87 null]
->> endobj
-1388 0 obj <<
-/D [1374 0 R /XYZ 90 103.509 null]
->> endobj
-1373 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1396 0 obj <<
-/Length 3616      
-/Filter /FlateDecode
->>
-stream
-xڭZIw�8��W�꽈�Bdn����q�ݓC�J�%�)Rͥ���T��Պ2��E
-;��b�͌�ޝ�}89��r�q(����,f3
ľ
-���}�����3Ƽ��2K�M��s����o�g�>�f��e�ԓˇ�?N8ٌӔ���l�;������~�|G��l��,������'��
�%��qZ��/��f�������ӫ�
F‡��[��?_{���\�͓CUJ��ٟs��d�fi�L}�|M�U�WiU�|E�a��EI�,�M���&�S�>��@
L���ǝ�^��cJ
�*��
��L�����$�vay {~ g
��X)�lv��*ɰ3�n���fϴ��R4�
�%^S�P�\/���c���
qd~�a��A���僡�8���Pt��

-1�v��g�9�L9瑷1�"xgԖ��U��=ߚ2O��y��j��WQ�$�eZow��^��D���DeyHcӼ��͡��b��C(�`{�w��g��ޒݾ����q<d��2
3�I�,5���sS��U��+��'��#�?L;�-
-��u���u����%�`�j�?�J]����%�v
'������I�k8���x
LF���Y:�޲L�g�;
�]���&����2�`M��Y;��5�2A�&Ձ�4K���nI�n�P�i֖~��TC�#_�N4�u�o�ZSc�9=MW��oU]&�r�?��t"L˅�U�_�d�k��
"X�p�g����1Fr����$ʍ D���p� B1r6��
�ʒ�TԐ֕�
�\����P=�@��!?��;pFԴ��Z<���
�g&�ޝ̾��/����,�cф�~F�?��{"
j�R�ދ��nC��5��n�k
JL��s�( *o$���q2c�5�[�OD+Sx6
-"}�s���Hdoׂ=��
��hJ$�`r��0
f�Hܰ���EĎ3��<P����P�n�j�RuAj�@M
�P_�b!��7J��
-�
��q.r`�RbbJn��;V̻����
��<Jy�n���<D�Z(ɽ��L���؛�5ψ�5uE�
��
+0�9��j	��3� 4/�0xo�.�5UA76e^�c'
P�i�p�:?�j΀���:���Y�~P9%#.J+ at D@oͫA��pv~C
SA���"�O��&̩��SӪ cU� ��`�|�(�����W���VԪ�ma�g����Bu�;a�8w�_�vv�D���Ya5U��0�)�32J6����
��U�s�JR�g|��Q��rg��+0⾗1h=�e
j�:Q�a�A����M`Q�h�i�q����h=�s��{Ტ�
���_�b���֯�

2:�4�7�Ur�*2��0�F

�%�I�
-<�C
� �[Z�%����� ��1{Ӝ��8C_����!�k��@8#�km� ����V��7�g��B5��]��ԲL*��@.
i�>�L�y�u�e���bI�
G�	���m�\04>;S��HM8I�7�̧�D.y���F0
-=���(��|)����o�
Nf�;�AY�r�ϻ}Q���u��{������H�����ݬjGF�q{v�N�6:�`��y9$�������\>�?�o���0^I,i�L����'� k'i�G7*m
�s
�V`�v�J-���
��~��dw-d�P�X�Βr�T�ra�]R>ٚ�7�^��� ��������6xʒ�Ӱ�PI�AMT��q�Ҿb�V2�
-
8b�\��dc%*�&�P:M��o��H�����i��]�2�l�-�m�_�O�@��D�^0T"�8��� �ۆ��2��K(�2�@poJ7m`�����oJ-"�� �`�X���S���nĮ�n�z3�*kGzg �sJF�

��d*�]_^^��:i%��-=�d��
���Y����}�3�"p
=;���C-ZxB90�XB4T
5���o�Wu�b���ܪ�-�7��n:@>��Џt8��w>EI��Yf�
��1�����{_'���
�����<�rM. |���[�L]> �@} 7�����q�
'� ���_�e��σ�{;FP�A����p��P;��&
&G
��,p��]��&Y���U����6Da�u$���!ܝ:$������)#=v�b$�u�L��>v�
h�@Ղ!�eL6s��i��*�|Q�;7Ԕ%����ay��p϶�t�p$t�
=��2�<�~m�Y?$��Il�X6k�bg\����UD�b�T�bU��"P���Ls�Ѐ���U;߮���
GGm�

S��������C�L�
�q�z&�����X8�)S��^��v�5�|Nv�
GJ�K
�mR�L"��
��O�j�m�?�mߴ5�G�
��S��w��_'��U0�S�L��q�|op�z�Zj��j*P.��
��X���A�� Ҽ�^�@[���A�+l�W䮨 ���̠��L���4 1J�D�����A
�����t���yX�
��{��7E�����(��w�
�P��5i�?�������48�`�~�xؖI��<�"[�EC�`�	�jU�{���Ɲ��ź��c���]�f!�����A	����]ٺ9Q0��� Ҭ싅q�i��ǁk{ ��%*VӾ7��6i
��E�܅ͦ�B#��%;��@Z�T���@��>�#`~���0��9��<�R�	8Pl2 "�*r�~��FUD��Ӂ}�-� ��:����7�Р�BKdo��R
-"^n�_����W+zЃ!ַu3uCl�{�ˉ�`���9���v�d�'�����{!��ꄰ��)��j�R�EA���Y۷� �k�d5�,z��X�f��
E;� �c�>�q�,�/�]x��|�C�����O��4U^Q��^
-����1�O���*����K;��\b�+���P~
M
�@`���u$�E$uo��wx��ESh�����{�l��c��џE�� ���q�sG�p_��mY�ž nW�q��\�N2�
u׊H�G"�U���Ġ�Jw�{�.S���)V.� ��8q^F���A�L^;�bwr^�Љ���i���� B��_�b���<c ���q���8B�i�\*Mi �<�Hzg�BG�6�{_��AtAP@-�ڻ ƒu6h�����L��2���|�q����EY�oM�ڶ.��i���$K�'y�
���m�l�
-8��m~��������W;	��wG��@���*���B��5ZM	��i�7�/
JxW�aU�>Ư�*�&h� ���d��D��b��4_��
-�����[�J&Aw��;�6�\�lK�h4�xu��
��S1<)�g�|�=v����睝����xx�������H]I��Gr������$n��}쟖�7�tm�/���
�;��+����.���p�P�
V\����#w����9�{����#��}zQ��ݷ
�շ
�'>�qľ�=��T(|-���_)��(`F��ߨ@�
-��1ٶ�0��W���c��
�r�
݇Uv�!���͘�������*���t�l �7��ؽT��9@�ugݟ>�Ҵy��)���������ho.�����=�e��t��띜]p�����
IA�
-endstream
-endobj
-1395 0 obj <<
-/Type /Page
-/Contents 1396 0 R
-/Resources 1394 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1324 0 R
-/Annots [ 1389 0 R 1401 0 R 1390 0 R 1391 0 R 1393 0 R ]
->> endobj
-1389 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [482.116 643.058 513.996 654.071]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://icps.u-strasbg.fr/~loechner/polylib/)>>
->> endobj
-1401 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [113.91 631.725 350.8 642.006]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://icps.u-strasbg.fr/~loechner/polylib/)>>
->> endobj
-1390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 619.705 195.753 630.051]
-/A << /S /GoTo /D (index_Wil93) >>
->> endobj
-1391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.891 146.887 85.237]
-/A << /S /GoTo /D (index_NO80) >>
->> endobj
-1393 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1397 0 obj <<
-/D [1395 0 R /XYZ 89 770.89 null]
->> endobj
-1398 0 obj <<
-/D [1395 0 R /XYZ 90 721.073 null]
->> endobj
-1399 0 obj <<
-/D [1395 0 R /XYZ 90 692.848 null]
->> endobj
-1400 0 obj <<
-/D [1395 0 R /XYZ 90 660.996 null]
->> endobj
-1402 0 obj <<
-/D [1395 0 R /XYZ 90 616.432 null]
->> endobj
-1403 0 obj <<
-/D [1395 0 R /XYZ 90 583.544 null]
->> endobj
-1404 0 obj <<
-/D [1395 0 R /XYZ 90 539.019 null]
->> endobj
-1405 0 obj <<
-/D [1395 0 R /XYZ 90 506.569 null]
->> endobj
-1406 0 obj <<
-/D [1395 0 R /XYZ 90 450.209 null]
->> endobj
-1407 0 obj <<
-/D [1395 0 R /XYZ 90 405.804 null]
->> endobj
-1227 0 obj <<
-/D [1395 0 R /XYZ 90 361.4 null]
->> endobj
-1228 0 obj <<
-/D [1395 0 R /XYZ 90 305.039 null]
->> endobj
-1408 0 obj <<
-/D [1395 0 R /XYZ 90 273.307 null]
->> endobj
-1409 0 obj <<
-/D [1395 0 R /XYZ 90 216.23 null]
->> endobj
-1410 0 obj <<
-/D [1395 0 R /XYZ 90 183.899 null]
->> endobj
-1411 0 obj <<
-/D [1395 0 R /XYZ 90 127.42 null]
->> endobj
-1394 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1419 0 obj <<
-/Length 3443      
-/Filter /FlateDecode
->>
-stream
-xڵZIs����W��BV��`|��8�%����sr��19�X�ȿ>_O7�E���]�AO������|����
�>��Aꤑ
n�
R5���	#������qs>��q��,�������̈́�Nn�
��R�LJN�
�˃���
��r�4|�L�A��x���/J���ܒ�:��k����?��ݘק��ৎr�n����K�����vV̸ql;��0}X�t�v�z�ӑ��a�����t��r�gm�k~��j-Sv,Ӳ�W�.�Z��� �v��4�<�xNݎ�G^8,۪�r��U��#'�cH#
Cfn4���G�<��,B'J�n�W��ſ�Py�q�`α�㦉��}�L�Y�]��_$]� @���Y��[�l�q��j"˨�b"���m?T�۪�&�
�n�8RN�<� ��z��VϘD�ao��v
?�\�
��{y^��]�g�†���(:�kS׺!1���i�����_��7�7^���B�*�JPJ'k �z�!x�總�>����Zn
l�FW�ޣ�M��
t}_���a �6sv}69�e�U+���)��Y
���r��B��rZe0�ΐ�RO��
�TŻ���$O�+p
�
�<X��}����"kkke ��@��Cy~%0м�d���(

�
���� �Q���|��G���YSV�j}V�Y�ﬦ��qC�=��������0���NM
W��؈��s'�m�Mte��ˈ
�zZ�F�w�!&,�����������
�dwK ��X�:>$/P��*�u�1;�z)�6r��d���Z���!�� �R�7RQɝ:�﹅×,"z��(�ۜ��;��"�f2�^ [...]
��陡�ޗҗ��/��i�t�
O�Z铜��_ZX�݁�D6�:����#x��}�X8:��g�����C��eV�U���d�D�H{‹Ip�颀tr�K�ʪa�z��i�-^W��H�|�ka*����L���������WK�B��/Q�l��
�'�C��-L= 	6��Ԫ���j!ʆZx�����2͊:b)=~\C"%�<�[��0�קE��*�\��.�( ҝ��#�n�)�����J
��;xvκ�
���l�L�s���sW����A��+�'�
��	��ɕ���D��=�9���e��䙦����t!��m� ��B~�R
ᇆ���FK���rU3�KU.�H�Щ7@��Q���
�;�ڐ-nᴚ�^�
��
�����ܷ\�=�Qc����h�D�8H��������~{������y����D+m�8mP?��[�w��Ef���F�w.<fIΜ*�y#k���c�t�Z!�l��{�����K�ŷ1%��+���.^���+Kc/�M��s�Lsc
���u�]��{��phVt4߷���W{��=�Q�k���������EծmL��}�8�bF+�����J��S��5������O����ȏ��p
-є �X
-}��c��q�G޽����͚<���-f�j�Rؖ+
G��9\٦"LʶY0�|	�Ήeb>�\�9��ï}%Avu���uC���|�����~��>�u�Ik:5RT�٪3���fy�DV�=3�O�
���hQ�d#GJ��r�+zO��O��eF*��)~dl,����d|�7��*��+��E�VZP���r�����r� Ɏ�e�����&�m%� �@����X3��x��Li�l������c�q��������;
�`]4�P�v�í�0��*nKp��� �@�D�	�1���N_�󩺒m[r�ٗܒ>Q�x;����Oӗ�uQ&��yM9 )��l�
{�>�`@5�dwx
�����'��_[_�u8zo�E��mփJ
-�Ԃ��Y��_��PJ����4��&�y���B�	�h
w/�QQ�@q��/@ܗ��z��#v�h˝\ G���˅ ��f�ձ��(-X��N$[2��Κ��V!�
-Y0����D����%td�bְW���t�z
#������t��n�Z]�8tqnrF�
5=D��D�,�=����	EO*Gbwx}�צ~��x8��rv4܀r%�vq*
-���rU֦]������ގ�G�
])�K�>���_��abTMA��q��M[��x�]�E�f�
vU6�i0'?��EKU��N�
�����p7�a���(.:�AB�P$��t�'�Vs]Լ�E��b~�e�:��2���
�&��
�;��,2""�٪VWy6��/��:�[p�%�ʤ�ӎ9	�Y�~l/.�I`Ϫ�~��h��B�� ���n�+�~a����̬��-��=�uSe�
��_[
��+ϊy+G�7cutQ���
�����
DYcodD�Q���mD�x:撱+��E��p�}Ķ�ȉv�'�h�9^�n8����g�
+�Ʈ�'*�~4S�����O%���wɠ^ul��������o�X�m����ц���vܒB�
��O2����%�f�
���45��@�obR�8���|,�$�j?�9)?�}��\�G
(����W����svrr��B"w���
-�G�
�����b!�Y���S��2�K�,�Y�ǒ�m
Kn���%jLk��/_�@<*��@ ��dP�'��>
�0E
���68q�n%D!���)����W������ ċD4R
ɦە^)�y��`R*v0��%��s�
%���S����
c'�UǶ6vD�]c��?.�׆K�.vQ{�H��۽�%����е	خ���q���M�����暾��c
-
Tx
�J�%�	�>��o����m ��)�]�E��3C�"��i�F���.�Η6�W�[D�][�UG�3�
�|a�|���Y�Z@�jJ{z7��v$}\?4�y���o**��S�T�l^������N�e�yJ!�������&��g�p�����6�0:�� ��	U�D�y&~ɗ�O�p�J=�)ω��Bh���x��'�Y��54���G+_��n��(��q︞��tP��Ix��
��
���lf���v'��KG���ni�
/��T��T�Sxs�C��ԑ�-����6r
w��=�w����w�A���o��10��0�&�z�
�Ʊg;7۶�#��gKp\b��tc�7^Oh�i颶�?���e���������B�]�� ��CXE�!(�[�#�:�2�T��ET���~���f����t���ʢiVo^��m�FՇR��Ѯ�0��_B8�b3˲�Df�/���8����%� 
-endstream
-endobj
-1418 0 obj <<
-/Type /Page
-/Contents 1419 0 R
-/Resources 1417 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1324 0 R
-/Annots [ 1392 0 R 1413 0 R 1416 0 R ]
->> endobj
-1392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.327 696.002 411.303 706.906]
-/A << /S /GoTo /D (index_NO77) >>
->> endobj
-1413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.77 601.064 290.746 611.968]
-/A << /S /GoTo /D (index_NO77) >>
->> endobj
-1416 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1420 0 obj <<
-/D [1418 0 R /XYZ 89 770.89 null]
->> endobj
-1412 0 obj <<
-/D [1418 0 R /XYZ 90 721.073 null]
->> endobj
-1421 0 obj <<
-/D [1418 0 R /XYZ 90 693.13 null]
->> endobj
-853 0 obj <<
-/D [1418 0 R /XYZ 90 661.484 null]
->> endobj
-1422 0 obj <<
-/D [1418 0 R /XYZ 90 629.838 null]
->> endobj
-1423 0 obj <<
-/D [1418 0 R /XYZ 90 598.192 null]
->> endobj
-1424 0 obj <<
-/D [1418 0 R /XYZ 90 567.263 null]
->> endobj
-1425 0 obj <<
-/D [1418 0 R /XYZ 90 534.9 null]
->> endobj
-1426 0 obj <<
-/D [1418 0 R /XYZ 90 503.374 null]
->> endobj
-1427 0 obj <<
-/D [1418 0 R /XYZ 90 471.728 null]
->> endobj
-1428 0 obj <<
-/D [1418 0 R /XYZ 90 416.769 null]
->> endobj
-1093 0 obj <<
-/D [1418 0 R /XYZ 90 384.406 null]
->> endobj
-1429 0 obj <<
-/D [1418 0 R /XYZ 90 352.76 null]
->> endobj
-850 0 obj <<
-/D [1418 0 R /XYZ 90 321.487 null]
->> endobj
-1430 0 obj <<
-/D [1418 0 R /XYZ 90 267.615 null]
->> endobj
-1431 0 obj <<
-/D [1418 0 R /XYZ 90 234.031 null]
->> endobj
-1432 0 obj <<
-/D [1418 0 R /XYZ 90 178.355 null]
->> endobj
-1433 0 obj <<
-/D [1418 0 R /XYZ 90 134.754 null]
->> endobj
-1434 0 obj <<
-/D [1418 0 R /XYZ 90 103.825 null]
->> endobj
-1417 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1439 0 obj <<
-/Length 3284      
-/Filter /FlateDecode
->>
-stream
-xڝZYs�8~���[�*��}d�2�c<gv���V2	I�P��G����(P�3�}1��h��u��ڭ�ջ��
�nߦ�*w�$HV�U��(w�z���o��s����4T������qS��?�R5��NF���?~�z�p�ו{y+�y�n������?�U�W����&
VQ·^�_���1������ﳴ?���Q�0���7
o�&��*
-@�
Fh���&
r��:�
��c�T)�S���A5C�)�2�U�i섞S����׾��:�/��x��Z
�8��I��8v\���mn#<7Jc#��큷՚��R�·bХ��=���"
-�
�5GIf�]â(w����	��͂xu����
r�&�k6���1�N���պ�3}芦�A8/t#�F
w;1���Vi����؛��u/�4��M��������Ɨ����A�_�8�"�a�xLc��OƖv��o���DG�U���a�y�<p����
j:�
U�����g�~�Fyz��f��f
xΈ6�E�V,n��s�t@/Ǔ򁼌�w�A�ܼ�Ͽ־�ǃ,�[r0�L疃��f<l0(p� b�n���i�Zv2��[�+����0VZ���O�c�3�7~���}��R
mç6��N�G��A,��z=��:��צ-|����%���V����Ma{�0v$T��ۮ=|{8\��Lو��;�|��w����3G�y�հ	s@����5n��O���n��J�<�y��Zo:� p�m�Ԫ�͎�Sx��o��D���/E?���c�S�3zM�
-2緎4�#Ё��t��;���3 x�
��������"��kU*��������弪���GL~�
M�������w��� >�I��:Gq�n@�Z��,p�<1
�,�WM��‘En
f��,��x2=D
Z?� �DAQa�3�W�|*|�3u X�\@�N
.�kJ����ۤn
J�����3i%��\�ql�P</�3?u� 2v=b
>uz�x�'/���?���Zo;%������(��zB;6GĸkJr\�|^��O~�mi/s�xJ��a8�����[��v�_�ʍY�+��>���q��F C�o)��IE#Õ�ϹC8	�
����a�&ȅQ�id�7;�S��
�rČ�兗:�Yd�͎�
x9�1��ܴi�^�-!����TZ��!(/���Tq G�[�Co����?��X��"�A~eͨ�V[9Wm/d|�F����T�h�d�g�T������>��R
����s���ơ�n]  F�$p�]QBz&��ȴ��0K+��]�d=�"~
*�
{�6��ĔS;�X���=̗�{��2,�/~��ͅ���
-�˜�N2�'�4�S�a:�
��3�
�g��	��g�n*%��̘D�`wP2YN��q�hm�y��'̬"���1�;)#�Pc�G�
�v��OA�懳-p��w��J��6춌�8q�%8F���gq� ��
����־^2i>�z��[s ��K ��{�X��a��
c<lO��	����Pu�
;n�G��—�C��X#>.�$�tIjM<s�x��?���ţ�M	)Xkf����i�=��t���!��Q��,��N
粉_BK\��C�.�ʇ=�f����GU|fy_:�
Pl
^�-ŬcG�9�ڪ��,�J	Y����
�ϛ��o$|jGljE,0���~0�
�X�E�4
��$Pp|_
�:����/0��u��3�D�h�'9hSƍD�Ѥ��I��F\
����N���$a�"�h��/G��#�X#����
Ҟ�A1l�L��Ji�m%-�
)���)�����t�f�Fr�KrLL'HL}�7	4S
�`��$b�z�.R��-��7��T5^�̔�Eh/��Mk�8=	��`�w���䎘J+�U�1�
0��/K&�
-�F1��'�ju6i#\�zn�]�Z�b
�@�����Yh���Q���� ����}%A$���
K��� %���Y�0DJ���@+�!Qꍮ�@��T�����28��'�[Y0	w�qa:�]���wh+����%��S1m��Q1�'^/>�(cy1�q�@�JHI�㺈_��ñ&��f�#l�<]�4d�Aޑ`^?�{�L���=?���߬Q�`���2"�(�s�p�ֱ�{�M�E��ؒ�n
��A�+��4w�� �D�=�%�3�@� �
-�Q���f��0�.�<�Gf�
��;�,�,L�t}:f�0��g5@�
�k������ �L">.���E��	R��7�=�\���ƴ
&�\�L5��&�r��"�J��T�@y��gn��:��К`
-ڏz�
�ȘW?�c��ﴘk}yA���[�Y^�7�J�ƳX�Eг�y��OV���)'뜫��et�"`kͯ�]k����.|3��-^�G��c���Twk.�s[�Wg�����*c�,
!@F~�c�h&I���{bNy��R��l��)����*C۱�M46,�R)_�Ԉ��Xx�FRP�F�H�:`������|~ oZ�7�4�&��\e=��
���<��]Փ�zF��3��r:/'�|�@	ۋ�"�������x#��syU]/��ұ�����A�G]��M<�E��XphՎ���L�(��<ř�E����\ĕ���>��i.��@J�|����3
���d<YW�ޞ
B��|1�	��B�n̬.�38���	�rQ���R�����5�m���!B�7㖸�d��r�o��
������+9�RVO�˦lG��`~c|�����
-}��!�4��r�.�o?E�h�N���(+
-/c1�a;�ӯ����͝;|�
-M!��
���mY���B�
���nŜ
��a�1.������
K��
;_sr�k
-W�$��R��
 �G�4�1�
���>dؠ�
��D�hVQ�N�_�k�Ȏ�4b0\�]Z�j��p� \�b�
���w��'ώⵂ�����B3v�N����3��Wtڬ��
�h3h�`e���J��T����)=X+0|��QT'����
1>
-�c)��Ǿhє�ȜH�'ӵ�ێW���^�
�Q��� }_3��)x;.�G;
�o�jȃ���~�?I�A����A��x��͓$���R7������I����~:��/ q����j��S��a�%w����9��Ǒ�?>��ٌ�^5;��~��~x�Α�^:�,�=WQ��_7@<�k�k�{���P7I�	P�_W���i�
�M�f�n���u

->�[���p
-endstream
-endobj
-1438 0 obj <<
-/Type /Page
-/Contents 1439 0 R
-/Resources 1437 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1445 0 R
-/Annots [ 1414 0 R 1415 0 R 1435 0 R 1436 0 R ]
->> endobj
-1414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.101 696.002 304.554 706.906]
-/A << /S /GoTo /D (index_Wey50) >>
->> endobj
-1415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.932 652.665 405.385 663.569]
-/A << /S /GoTo /D (index_Wey35) >>
->> endobj
-1435 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [297.062 524.699 388.718 535.603]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://fsf.org/)>>
->> endobj
-1436 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1440 0 obj <<
-/D [1438 0 R /XYZ 89 770.89 null]
->> endobj
-1441 0 obj <<
-/D [1438 0 R /XYZ 90 721.073 null]
->> endobj
-1442 0 obj <<
-/D [1438 0 R /XYZ 90 693.262 null]
->> endobj
-854 0 obj <<
-/D [1438 0 R /XYZ 90 649.925 null]
->> endobj
-70 0 obj <<
-/D [1438 0 R /XYZ 90 595.574 null]
->> endobj
-1443 0 obj <<
-/D [1438 0 R /XYZ 90 562.835 null]
->> endobj
-560 0 obj <<
-/D [1438 0 R /XYZ 90 562.835 null]
->> endobj
-1444 0 obj <<
-/D [1438 0 R /XYZ 90 457.465 null]
->> endobj
-1437 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1449 0 obj <<
-/Length 3132      
-/Filter /FlateDecode
->>
-stream
-xڍɖ۸��_�[���en�ܜ�����{N�9�IH˜��LG����T��\D� 
-�� s���w7�x�y�sm�]v���&�7I�����߼8�����&:�� ;�"����������ݼ}��v���	x�~�������wS ������t�L��M
F�-77����
�+R�`��ϦVey�
����.JCOoý��6�{�� h��ڮ9u����;�;�]��yS�����
�'Y�7��y��괠�eC���M�� ]�ٟ��|u3p�k��g�+����.����������~�L����W�NT6m�y@�7�^s�9���f
��{�w��kǮm첼��q�]�W���~F�����������Ȓgz6�Y&�
M!�?�1/
θ6ȼ�չQ%C
U�t��@���j��h�� w�����
�Y��xC2�����}��`f�~q����Au$p  {�>nS8��a�n�:�Z����gnjn������������q��N�j�-l?	��B5��t]��-�qw������v��dw���i	0���H%T��9M]����p��tv [...]

$�wI
�A�����
-S���n��z�����{6U�ج���
�],�އ`l�h$����خ�]/v�KF�g#w����5 c˽#�㒣b�zw7P��t��4Xٹ�y|*M��o��x��'a]gN灩�!X�
��y�V�o��w�qZ�J�4?�LQcD�{�)�� j���A_M]�2h�%c�t_�Be�׏�YP���וAQ
�pE+��{b��(�>��+�+`�X_U�.<aq�D�d�|�/E7%
�
S�|F�[�'�-�f
�*�l� 
�&��>L��4#�1M��t?��SC
G�o
ڜiB�.K�lb#i�DC��s� �N[���������|ޅ�V����"�L�gv����� k-�w욊[DP�+T;ʲ��`_;"eB�$/�Eg8#�H>�?�J���FӁ�[�D���!���
UMdv�j�)�
bM!�7��R��IE�?
-���`G���t���a�
z$�� n�D
�`�,{��١�U�1m+�uJ�
��l�����A��I9W�v��Uܫ.���4o�r��.�i�H
nc�Q��zq;ht���g[��
-�`���DcEj7�?�B�����سF
��P�W

'Z
-�*E
��9�3lF�/d:r��+�^0l�lm��`�"9
�1y4�3
���1lpq�hg���*�%R�iboq���|Z�TQ�ײ9�̺��Vfp��%Y�hcَ�m��n���wO�
[=����B�%QhH�d�f��2�LN3u^�e&Qv�E��`
W}����z��ӫ0
�k���*�x���@S���E6S|J1��C2�}SiZ�5o�f�Eew�찒�.���9l�ml.R�$�9��m&�&�� 
#sf�z�5�(��t*�$/G0وW�2>�3=�U>��\�R
���ݚ ~ԝs� �x���
�,d��u�xZ�:1��B��n��Ֆ�
\�Ѯ�q�Z���Dao�.��b�ܺ��3����+�9��ž=�AЕ�T�
2[���-'���8��@�-r�
i� �߳���,kؔ
�
Ҁ��x�I����8y���j��*��U��\���GoD�rj5�,��:c��7wg� �(�ؓ=�]���AŹ5�1qoi�}8�@;{i��+p1S�
St�I���t9g�:����`��4[ux������|�
ݒ9Ϭ'|�'�ZHR�F�+�4L�
���!'6ؗ�s�����[��Ņ��¹?
�t���Zv
-WζVE�+-�A#V�p
p��H�c_�A�G�?Z��ך�bS[�y'���*�Ř�ؠJQ���EZJ?Ċp�8w
ʆw�x��8��3�j钜�"�
���#tu��"�[�XT
-�p�`5H��;d5�1�Z���Ke�yUR4a= ̥�21R��N��.r  �(8���FKY2�Ό���h>s�����n`ح���d�?=�1㺆z5p�Rw)��k��U���o"�dD�à0>-�~.�BM��AV�ך�آ'�\�k��†�t[T:EX� ���`Y��
�	�.��wk�������ye�Q'aň��F�ziѕF�򬂒J�.q 
F��Q����T2+ ��>��-Q��r����
�w=͘���jl�zU~we9+.ȝl�-�Z�փN�0pV�p�ٶ@��y����JU"e��w�H@
�y��3 �Ɛ_x
-�%����A6z�\ɁZ�(�bf)�?`�ܔZ�ȱ3�!9��;&/����c����@
�HO d��X�	Ҫ��:q��pL����4�U۠��� ��h$H���!�+��c
 �� ���f�%ՙ�&6�I��'	q�<�c9�y��)
K$�/' <J�:$�'��$
{���:	����U`sI���p����RReġ֘63k�aiָ���
-cr�Sa�0m`����tXM
SNqp��Z[�N�A
-a�p�2���
-�]AFv9��%��W�Ce�l?��T�7�Opd�d�pP�U��%�`�E1��1��-B"[qe���֥�}���=¤��
����t#9_ͲE��� Zp6�>2%%����3G����u5-��t�c�*�
軑#�(bQ
ٚ�	]�)� ��
���
pו_圮�&���Ab�b��B�ו紱�1��ˢL�O �[|c��Q��b �c?
��kA&^4�ȥ
-N��ڊ[6� ��5�(��7��c��ֺ`'��sF&�ƒ�]5��,^�dH�3��(%\qK9���dWJeq��t�8� ���frqX��w"�r��j��H$�v0��軥Gc�3����p��;����f
�d����
� ���$	ipަA�F ��W��M�&tw��nBh��BT�1��`C�/s�/���c��o��ſ%p���G���{��|䐼=h-W�t}ud����ӳ�w��*9C��W�������e�2-β���v�{>���0�O�cwͼ�TIm
-endstream
-endobj
-1448 0 obj <<
-/Type /Page
-/Contents 1449 0 R
-/Resources 1447 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1445 0 R
-/Annots [ 1446 0 R ]
->> endobj
-1446 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1450 0 obj <<
-/D [1448 0 R /XYZ 89 770.89 null]
->> endobj
-1451 0 obj <<
-/D [1448 0 R /XYZ 90 615.819 null]
->> endobj
-1452 0 obj <<
-/D [1448 0 R /XYZ 90 591.396 null]
->> endobj
-1453 0 obj <<
-/D [1448 0 R /XYZ 90 267.351 null]
->> endobj
-1447 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1457 0 obj <<
-/Length 3004      
-/Filter /FlateDecode
->>
-stream
-xڕZI����ϯ�M`U��l9R�(�8Ǖ�} �&�%lB����m���q�'�~��~��
����߼�������4�
v�D%�����o�谋h�_=��W����g!t������p,M�����jh��h�E�������x��.���M�kǻt�ɫ�_�7������<Ѡj�~��ǻ������#f삀�̛���*��Ґ
@fyo�*����h��އ~���A֓��m{��F���y��E�-P��Ս�L��C��.B<m�k�O��q�Y�}��^W<��9vY��M�cά��v��Q�iJ���s��q�'�Y���Y����m����d�̎��Q�N
�v͹�*�ß.&�pG�i�
V��)�o��
��<��ݩ�*S��/*�u*��G�j�y �r$�@��(�6�R^sbk�e�ay��n�I����_V��F
�����:mۦ.Hd
��\CZ���x�~��PÑ���v�fd�6��zP�ʹ�L:VA�Y�'�� �D9�|x zY],ċ��j\�^@�2�t
�3ǵ�k�U&g���'��M��q���$�
�s8�T�?9?��e�muN~���>P�9��X�������th�0P�?{'X�r���m��,U�ΙQd}�C򦪆����NR
-uIZ@&�r���'�k�e.� 9W	1X�@4���I�[�&Ǎ]z����]�]�"����'�qXd9�
�M�.�
-c2�FVc\����V���Y&�f����\��
��7�_�8��5S|�����o�X|��.�.�p���h����eĄv6C
�V2�:aɧqFV����߁�P���=ԡü��p�$�T�
�?�}�Y��j�=lU�2ւZYS
-�MU��T�K"�oJ�h	�˜/�e���C]�	��S%�'��@tH��R`��~�E=\is�of=ph`�J\��oj��\f� 4�k�s�R	�*t�/�`9S�d�>�
3G��`��'��^�{,�|�H�L��0��)/��
-�ɪ��aW�
�
��TFvN�
�
E�f�D݀݇P�?��Š]�87
-Sq}`7C�=O��C.,Xs( ;c^Ϊb�«�E6��jmhH�;�m�3iꀖ�
����(�'�	�@B1������0�ڍ���M?�T�`\�?�e
��ߏиP
d�$5.��9ŗ�8��Ŝ@�q�����
���,_B_79
��6x~)G��taQXz3pH甏���2ñO[������m�:0��g���@p���	В<��8�h��$�4��a
�4ly�+

-�*fH��ujDͼU^A�
��<^q���ʆ��
U��t�["N#c�l�d�C)�2CK��WC�EXe��d?W

gՅɚ�¿�O�,�MD/�(���J��6�P�y�ae��H�뷢�Wq����$� �A@�J>�6�v�Tǡ�eSdN�P��}�f^�
�8�eK���A���crB.�5L��AE��)W���%@ �����#�U#.Y�I
-f�3™�B�D��9��j-1;C7\������"_�1�rT�����RJ�Y�c"SX�f��
�60�?	�I$�$��A����x���$���j�"�4�چ���B$J�v#��
-�tԗ�<�u�#,��وp~.*h2X�R�&��G㦣gP6����
���@I��fڣ
$�q]�?_���O3�� ��V.y��
��[�P%b�*t��{���V�$;.P���%��
^	6p��3����M��:���
����|S>*��fR�W��#悾�.��D
-�0\P���l׍��!m�
CM^`�7�GǀF�;�sޓ�FfC(h8�ͺ�X-���Y�P0�CGo=����{?�]	ʅg_q��>�Ł���@�����{s��L�� �p��m���B�!��c�8�y1��L]H
5�ZWn0?���+
p�����I��v?��\�l�xdV�3;t�/�#�I��F��Z����P�J�8
%���\;R�0�M�T���ɸQ�(���p�zA sN��5�_��S7 �Fu:믲\Ѵ�ݸ
� S���
xXut;�C�)����W\��
�̺��@ e�1�1Qؾ3���q,�y�w���
��]�%�\4A ��a�^ :!"n�~�w��kT�k	?[�K�fN cJ~[@K���J�w<�ѓ��t4����q��,
r�N)�>'�K�{�H})mx��h3
V՞J�‰c�P&LďK��rc�џ��?fY����Lұ:��-l�z��	���)��
�06/3S=���'Й�݆t��U���&�t�;��7F��;KX�wVXK
`�Z�䞀u�h
�+o�|��߿�D<>ħ?~�D�"�t禚���� ���҇�3�5��
�E?�C�t�_�E��zs���!� �~�Xq�cI���` �Wo	
-�����
-�b�W($�2
��1ݖ4R�$�h�)
�F�kz�S�띒���1>c�z���i�"
�S���Ix]����[��+!OȖ*�����C3X�Ri����
~�>p+�H��
��Y~q�q�����ux�탁�o&�G��%�rs��H)D�̶�@��U8��՟(#ƌ�
�+p��-X߻ױEu������{H�U
Yy�t“+'��!6R��m��辕��}�
N:�T�
��Y@L�Q��ʎV׹^�Ngw�n��W�����$���m�y
DE��Ι�ݹ�R
��If*&��&�[��?>9���Y��f
�f/�j��w��MS$�Zk��(��^�k�@%N��NNO'�����ii���p��E�Z��C�6]?qi���
�
����p�z-E�<z��;Q�T�_���}��C"N"��
������F���	��L�����Ճ�)���/��N׫�� �p���ZK
`�?m
��g@<%��]
+�"Q.}������p��8�r�
=+(�s
v~�wsG�VM��w�6C(b��9����;�4��
���4U4bNS��(���W���Ӎ�����
-endstream
-endobj
-1456 0 obj <<
-/Type /Page
-/Contents 1457 0 R
-/Resources 1455 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1445 0 R
-/Annots [ 1454 0 R ]
->> endobj
-1454 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1458 0 obj <<
-/D [1456 0 R /XYZ 89 770.89 null]
->> endobj
-1459 0 obj <<
-/D [1456 0 R /XYZ 90 563.344 null]
->> endobj
-1460 0 obj <<
-/D [1456 0 R /XYZ 90 336.215 null]
->> endobj
-1461 0 obj <<
-/D [1456 0 R /XYZ 90 188.549 null]
->> endobj
-1455 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1465 0 obj <<
-/Length 3063      
-/Filter /FlateDecode
->>
-stream
-xڥْ���}��o�D��t�
�Jɑ��IUJ�
ID @��z��}��X�Je�����鞾A�
��y���w
�������׉�en����˼]fn�[��������w*N]?�aa_����O��?���O�w_�|�v>���$�׻��z��?þ*Kw4�
�z����w��`t ��<�﻾�;G�����m�*p���;�Ust�:��e���]���v��~�����=Gw���ڦw�#���������n�B����s�(��s�(�$@�+n��G�9>�a���ό<�=

@XF��xߵ�.����n5|֊|���h˻ܺ�

�Y
�<u���{T�#�-� �,���S�����g�] .�R��)u� o����j�.�����'

e��*I.D"z$Y��}��U����%yغ�Gkʊ����~w~
יµ&n��F}
-�h9��!�`�O^�3�{���2�0c/�)�{�
]�F72ҴCUh�D?�ݑ�n�y�k/�W�H)os��J�����Z� ��f�2�R�I����ۼ�w��̻J��f���񎯖w\ny��
��<er�6�X�,^�SR�-mz9I�yö�z��a�-uyR	�M�;y�
-�V};�(�p5`� ��gL���U��|�0�^�L`����̀Mm�C�82bx��P�Q�Z߶�j��X��ֆ��>����
Q�$�����8�k#vD3���OF
A�M'�yJΏ�K[k2"'J��{�ؠ��|�m�-�P�W-
A.�����9
�u߳�S��<sC�g�Ǒ���)s�0gv.�y�H�,�N�����v�i=��[2RZ3\x�QR��*�c-&Հ�D攬�y���d�Ed,�(1
8fy3�]�
K7eƽ$F�0˞�[�
�E
-J��?���te
�\R����0m%�"�Nr����K�R�2
!op)>��+ΎPz|���}p
r��DD�2�kl�љ4%<�k��/v6;�����q@�d����v:�`)SN����~,.<�.��,iWuZ��K�;K�!��׏&z&)B��Է�B)^!Ȝ7'N�X��B�0|!c0� �/5;	�{���r"т�B�*���ȂKʪ�Քf��D�[W�(a��5OyǮ�H16ꨧ�tx'/����ȕ/�
ɕ���ɠ
�lZ�`}�2�4�
�,���K�p�0�R:ıc���
�i�QVLL1r�06g�
�lM�G�B�o�%�T�GL}t�����Y��MÀS^
���e�鮿ȃ�Kĵbn�o5Z�5���`q��C�tF�t'T��B��������`�J�i�a�6]
I��
g
-J�Kf��]���љGUI$i	f�|6�BgS�2�<B�d��L-���@
i_�^
�95W��@�CQ�:gJ�8
�D3��|���Ǥ#9?���i��*�
��4�m.\�:F�6]%���7W]V#�
�J2���I��f�|��y`�
��N��*X) fs�ĸ��q�����SV	�]u�
�b�ᤕ��+�TB
-<��Z� ��TJ6���L��V�`s߁�@��IȌ،������I:�Z�!9�:��̀���
�Ȯ$�쇧P$0��"�MS�#GS
#���������ș
e�PX_+�r��qq��c/�����܋����x�;kWU�q.h��<�%�^�QB�3�jK�!T�Ɓx���m�wmsX�"^�	����N�PT��U��?(.
Ֆ3V
g���pE{������Qu�t 2Y�2�����	e�|���`
 ���
$�1@��l�4���m�\�j�a�+��.hqhz�>t:/9���Wm>�E!դ�� �
�M�9'i8��py�� ����d���� �@�r\I>$��f����`ï�:RYl�g4]4�r� U
y�D�:��
��e_
���@��.`,�=T05O�
����x�0��[�$v<��q4A6_H�/�a�
Q�
�Uf�3[_3�1׌�X��f�e at P<Qܻ��r�<���a��
HZ�+�``�s�����1��\����D�dqɛ����ѨD�J�SH�T"�*�;l���D0
Kj��Z��S��u�z]�U��J�C>>�
-}�U]5 at zg� O�.��g%O�;��� �ݩ�Qå�R�?�#�I[��J>�E 1�
��7
�����XM 41
�VFY���vk��_Nf�8Z$`�^�p�5�!P
Iw^�q�Y4d�X2H��Ţ{��L��`�Ę�ѕj0+T_4We�m���p��~Cg֑Z-�kW��OIW|N|��Jm��8���-#���GS=WR'O#�|��N�~
�߁��q��w`��
v/��Zb�Xqh*pv/r ;YN �h�Y!Q�t�*�/4��Y�Z ��mcZ[�Q�a�x[�
-::��|�\C�t������
=�2!Fl�U)UB��\}#���q�e��p�]є-�#��,S;����K$�������bʷ?��M7K�q��j ����Ů2�/`
-
�

����͐�[&
�,��L^�G�;ˤ�ʒy>�8C�ҟ��Fcwq5���0B�vo��y
J��ң�|�2j�K˨�mê	YyOmX�a7�����
��h�t�	�
�d7��6��[xS5c.c��M.������V:�G��́PٕOi
���#.��=D�M�D���2�943�أL��p�S|#�FHX)1u_�ᾹLUέ�
��~�܁*�ڶ
H��ff))�
-�Y��&.Tx�2V�W�Z�ES� `V�h��׾&
'_CI�j~�_2�j���|yv�H��#�j�-�<�
�f�o�Q�f5)s�� ��Uj>����g�`҂���Rs���>��E�,�#,_X�֙z�S�d:1i��w���hb����2�	�4s��Xc�ٗD\#��*��@`,2�h>�3�,�$T��-l�Nj8p�@}�/f
�č2��Ɨ;���$	hpӠY#��o�j���M�@�0�?t�
XK�!v5��w� 6������߿e�? )���_�#�h�"��:*���H]��ZD���l��O��K4?O�Q���\����˗������oڢ�g��%�Yk+:Ɏ��bNC-=w}y��%me
-endstream
-endobj
-1464 0 obj <<
-/Type /Page
-/Contents 1465 0 R
-/Resources 1463 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1445 0 R
-/Annots [ 1462 0 R ]
->> endobj
-1462 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1466 0 obj <<
-/D [1464 0 R /XYZ 89 770.89 null]
->> endobj
-1467 0 obj <<
-/D [1464 0 R /XYZ 90 702.138 null]
->> endobj
-1468 0 obj <<
-/D [1464 0 R /XYZ 90 361.058 null]
->> endobj
-1463 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1472 0 obj <<
-/Length 3433      
-/Filter /FlateDecode
->>
-stream
-xڍɖ���_�[���5ܗ��$��v&���`� ���
E�9m��S@PÉs�&P(
-�BmP�����O_�z�U
��c�E���yW�<)�i�z��>:�Di�������;=��;��S�T����tg4t�8)�Iz���7O{���Sk��i�Ǽ�U���
v5���Ǹ,v��t�%Q
�v���?���,��
��X�.�c2�'͜�
|�r��[7�C���z���#F�a��#���A?��&]3�tg�{?
QAU
���(���;P툚x���Џ���mn����O����a��7݅��UU�6S��3���-Ӕw:�=�����̘߰Ol�T�M�ǽ��j�f݌����3��4��}�^��z�NW͍��o@*}-P��Ol�^A�2Kf�QW?P�K?��
}W�ԍ����c�������?[��h�[mPzy�����aQ�.�Vg�ސ�a��F�zi�ŞQM9]@
��d�=�4��ʀ�z���a���_c�%
-�̛V�Z�ѳ�'�k{{��i][u$P��Ԙ�]�Wm�܈�� �2G�x���^�c����(<f���K�k��_� tTԸ�At�!A�Q��-
�m�;A +BgÒ���h`�/S�Bm�?���c@��|�f����M��ɂ��6��Z�G"�\
)B�0�'�Y�����'z�����3
�W�����Q�(���4ElN�H�C
��3�0:XC�\M���-M��p������]m���O��8���T��m%���(�X~��
�K�� {��ݶ�-)�$E�E
Ao�xR�rN�.�G�W�\[����� �?8
�
RS���L�f��iT�������BI��[j]F�9�����;�4��~�ʄ�k�Z9:f�c���/a���Ã޻���j`� |u#z�S�O�rG
vpBX5���

1�{Y�5ՕoZuB[u�fCgRݥaM@p����	`L&�q
�s
�o�K���ν٠`�EV/RG
- at d]ޭi�q!�q30�@�ڷBc����<`�h"
. ;7�'��6ͥ���i��=[�Bφk���%��c��{�-��|_�궅5���Y�+x���xk:�&&����͕S��Cl���D��f?�����X�@8<�\��6�j9�
�?�7I� ��>�]V�9�D��b��Ut�I�:���U����V	x�e�~��9&r
-�
��
-3^������p�P�E������;��z
�v�CS��c�vߪ���oF3G�g�An��V�
�)AQ׬)i&d&5͟\I"I�������p���Ւ]Rw��
k<�G���P�4���=K��!#G�
�
�F�L#��*
�/D�b�$�X
-�s; f��r	���c
xW�+�q+�
���%E�8�������|��N
��G�UCF=W�ճ�F�Џ[;�����=<˗��0Iޞ
� �0p�+ͩ��Iu�Čh
�+e�n�kѾ�������Z���mBh[��Q���� �����P�7��.���BD�>]�����=�t
������?
P�م[,���[�l�
03d�ܣ�.�`���
�(�P��Z5O�GA�${KB��
!$��,X�Y;�
>3�U�
�@`i&�aB�B�
[A�S��
�
oHDbHp
7
5 -�
����4� q-��23�ɤ��ͩNl�-�IzecQ �
��nv7��<w3c	[R��th���x�L��0Z�h	�]/�h�|zq_��ȉ:C|�G�@��9n���t)�}ҕ��g�ڌ?���jœ���Zo�ͷtx�-g��-�U��%�u�<H�S=����w�w1�p�<2\�TOR��Ȁ�
��pq��b�<J�����zg��n�u��H|I~.�G���f�
 M��d�R�(!�i����89S��4
��~l.�2‚�62=���c ;�*?�m;�n	�Jq�%��7��k��z5CC��&v���q���Lw�s�6<.9(+����m at Xc��Ci����
o��K�P?�]$A@)0`i0��A���@�;AP����8!�f�qYn�n�D����N����
N������kH8p����F
�$�	�D���$��y�!�ZY�yP@�e�Z �a�K��,c.��q6 4C �g͖�&4���(�Ɗ��(�{R',X���%+[��F�&���161��U |��(z�%[���ƛ�6�<�
����f"�m&��G�U��z?��;T��t^�\�p>��
��/p��� �۵����+r[�`���5��<'۔�5��kå��f#��i���b�!lj51ǹ5�93���F�yn=X�<؃_N����M�˾�Wp�٠=K,5.�l�l)*�]���Y.��ˎ$C�w���
��$ �<����_TG�
J�R�O�'?���n������ 
rY�3r�#�I)�n�=s�
,(���R�Fm�?�Ƥ�))]j�6��p���ϫ�t�/�y�ǦoYiV���Z2���M}շ桖�)��5�Z�$U��͘\�q�y��G
F���M���	9K��7�!�
G2~����{<AG�2
-1���P
w�W�y�ϔz���_��Ŗ�%�.@�
�Jɿ��f�[���D��
і����aķ�P曯 %%ޣB���=����U
w�+nG":�N*�6�pɛ��J6���}�
�1������
4n�U} -y����Ո�t/|�6sM�����ӛ�J�e�'�0�:}~Ě+�� N�A�à-�Iw������RP�?O�%K?���}�*cl
:��
h`pg���-��u=�-ᯱ)�Y�@�w��x���XlЖW=�c%�>I^E��d,����B�
�|�g���٤\� <0	[�+Y��
-

i0p�7�%����"�?����\�%�i�
�Gޟ����ӵ�/W��V�h��l�x!�*���I�Y�o�r�VޓD����2 X^�YХ��J:��*�����q3F�(A��2Bu�P!am�jY�T`�@�4z���=zht5��v��<��V ���&m׳���k�5-�cVD��>
�c[DĆSh/j�G�mx������T
'b���$w����
��0���$Nj'����Mg�/
-D� ��"�-oA���CF�x�|(y!�zk<�0�
�|x4ybb022�lH�L=�v9t�ab��U�}ܪ0��e
Z���e_
���C
��nAG�P�B,scp�Nve�}u-b��0B�
�ױ�&
-
c>h�Z\��a�spA^dD�{�Q
ēE�<��������D~c�����
-��o��!��X
��w����F�<'�}x
8?��L_k៙������ϝR��0M�i��r����oޜ���+�:k���<ya纠�}?${i��
��1
����7
�0�#���4h'
-���[��k^~'�_��`�
-endstream
-endobj
-1471 0 obj <<
-/Type /Page
-/Contents 1472 0 R
-/Resources 1470 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1445 0 R
-/Annots [ 1469 0 R ]
->> endobj
-1469 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1473 0 obj <<
-/D [1471 0 R /XYZ 89 770.89 null]
->> endobj
-1474 0 obj <<
-/D [1471 0 R /XYZ 90 184.366 null]
->> endobj
-1470 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1478 0 obj <<
-/Length 3009      
-/Filter /FlateDecode
->>
-stream
-xڭZK�۶�ϯЮ�9
$A�JVn��I
׭��
;
��F8�H��<�������
o�����>�
��<n�槻??ܽ�1K6�p��w���f�6�އ�z��C�w��
~�$�<��;�DԿ����o����w��"R���a�o��݇�Ԧ�/&�|�DL獎�֛�w��Sӣ���(QF�i��}��Ai���N�Eoz�?����+��me��L
NF���
-��S�Q���>I����iW�<��y��R&Ue�6E�<ӝm�Evo7y0�-���p�����L�T�{��>M�V|�TC�߂?e����
�1
-Dw��=���O�<qӯw*�����ˢ�ƣ��錥�\����;��|���i`�x��_(
w��
�m�';���h*�<œl����3wZP
%K؍�iq9=�w8ٞ[oli����X.
d'i��q���I�H�ϭ@�8(��a�؈�Ǚ��1��pj;�_��ó���uѝں2]/�8�	�
��a"��^.�9�fX,��u�PD`b��ɜ��e��m�]��|��D
�c
�s����s�Y��}Y��
-	�躢�yr�6��k�|�-��̔�h�G�H3�B<v�[⳹�.����M98�˂(k*!��G�H՘�z������{�&���ˌX���Dtp�K��m|{�
��E��͛�t_����f�j�b�SڏJ�lW:�L�C�9Ԇ�
&����5s4� �y��\�y2���
0
\�Ȁ������ѣ�r�w�6
k|�
o�T�!������t
獽s���
���J�!
��ړ=8���۾3�
�x@��vRюv7u�WۛA��%��T��j�!��!O�:�Q���
�f��Յ�I at D�G�>�\�����v%�/�E�����A%�{N���p;ON�
V����J��_]����r=Զ�(C����f/��$�Z�e9���pk�b��]�\3��k�f��MY;�O4�1 ?bp�&����צ�l��]Q�7��*�;,�'i%q�зg�-��M�o���2AB;΄0��eҔo`Gj�
��� �Z���!�)%�"o�߉:�K�!��Q�Sf�Fl�~�=
N<� L��?�Zn@��j����w+��h��&�
����[���� �
�d|�*ͮ(��[�����2,�Y*2�Y$v�`�(�łۿ�YP���
-���9�6�joư>��b��t`o����bF>�x��g �N��>��^e�s�_Մ
�H!(�ͽ �-&�)>��Y��0
�:������ۣY'�k7�	�1��LERl�\l��gSH �$�������LdQ�L0K���L��s
đ3S)��W`o�*7�;WL�d�;�7��8�������.��a���
�,_/r�B
��Vf>N�{㎵^O	
-��	
-���[���+1W@@%2A� 4^ij������%N��J�ؕ�v��{�n�JR1+	H��� �����UG�&�
�$�I�6�4&�������
[1=���ͳH���,v$��Z��,$�X���D�|����֒��C�Mc�^��!d����R�8l"�-�0
��<t��%��J�rk�<4����`���E�U� 8�+� �.���ʹ4��״�Z���E��8�R0G�l"��#2*��j#�i#�j�EY���`O����(ueJ5��C����
��"ü���
-�*I�'�C0ܷ׮̝5CX�X;F
WS����7�,���%�1
-��0���
rR��+)�O" ݰ��
�0��c���Z��b��b�=LD��=t�U�%��9%\���yҋ$죑b1�܃�_���r-����B$��|�̒R���<M!���@v��$i�?uv�L�]�YQ�s
��!��Oiq|�@��a
���t�����̡c���j�K���l��e��������M8r��*4������y��hц3D�x!UlR������T"��
\��EzAE9��H� �ƇR����y�}
YFI�̞����t_?��'�).y(
�(�D�3
��:�,�θo��=Yr>-H���c�
�]X+@� E!Rdk+�d

���'KpQ�l!���յ,2����:
��]��Gt�Qj�%�͉�
���V>܏�
�Z����
b�T*:�w�ΞO���*]��Ӽ��8͝(�Rc
P��m����:LD��uX*�

 pS��7�,��ض���N
-2� �
H�)�
-'�9|�F2?P$��p!�-�u��!�/�H��5��ib �5P�gfɣ(vg��d��QJ�t +q
�P3�E��s�H��1���hX\�^7����q=�b���3JٗĵZ���u�
-(@<x;��� V+~��{��
yT�Ovs~s����B��{���S"9$�$�t;��O
���
0����=���t֥���NI�9��
��)A�c\^:ïmg�aS<��F���c�攧��V����V�<1z���Nvz�f�bƣD�����WD���W	2%�Q���D��~�3gV�#����a��#���W�e�ٺ9�v�<:سY
d�s��Hu�K�rש�eb�Y���'A:c/����ia��\).Q6-Ƶn~������N��Kf{W�ìkg�J�X
�Yx&N�D�!k�.�J��x�����\���-�����1K��@�	2��$�x'�֓D
��25�9I��+�1Ɉ�{@%�rk�
6��f����Z*�R-��:ؖ<-�R=V�ڃ
�'�'�GT�ɜ�5f���t�+:IT�缠
 �zV.4����vQ�~�5G�I]M�4xZ�)����S_��ڏ
3&j��������,N��E�L�Y���>�WQ��48mӠ�#��?�����������?:� �wa|�G�D/<�>N$�޽�ƿz��i�?r�ע�O� [...]
-endstream
-endobj
-1477 0 obj <<
-/Type /Page
-/Contents 1478 0 R
-/Resources 1476 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1445 0 R
-/Annots [ 1475 0 R ]
->> endobj
-1475 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1479 0 obj <<
-/D [1477 0 R /XYZ 89 770.89 null]
->> endobj
-1480 0 obj <<
-/D [1477 0 R /XYZ 90 267.351 null]
->> endobj
-1476 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1484 0 obj <<
-/Length 3286      
-/Filter /FlateDecode
->>
-stream
-xڕZI������-�{�. E�6�nO�&���g����&2��n�}jJ
�>(�B���"Ż�]������^y�vա*�b������QU����i�S����<����Gi�^ۺ�λ��3
�ߚF���N��2R��/�����ǻ��w	���容���K�;��]|Ȫr�LL��J3�v���u���!ͱ��Z
�$�$a��J�Fo�F?MuߠTi}?L����8�O�;�<,w���I�j�G�6<=
�0N��_����>U�*�y���q4���,ˢ�jl�Q��#��ͱ7
<\��Bk��-�Td1={�v=��F�}�G��Y��
�^��~3<�A��:���ʴwvx��t��e�oL���5�G=��>��~��Q=�7�S^/Oh3�6J�b�����sM3[K��q�t�"��L�2>Κn���y`
��'
�I��~�M�����b���	��8э"�c���G�
����=��φ
xN�
y��Ir߲�7I�oV&��-��=�^��+d�p��M����aoj��dsA���
��O2��u�z��iB攦ix��G�y$�e8��
�a������3r�{Ƴ�q��$\��32���x���S�5������Cx
j�DPV2���g㌢��r�!a
-���`5�Z%��
s�	Y�Y�rh�<V�]����0�
]VgɁ��'ӰZ�d��u�U0���_?<���rՀ�to�=�w
�V�y��`�R�[Z0�
j�S��p��6
����D�
������8Y]_
�6,�`�u�µ
����1f�!	^=>	y�lrH���5���@�*N܀�:�d	wκ#ȁ�W0���<
���-?�њ
��!�������d� x�{\�x=aev�	��z�������u#cnyq&�Z�H���ʝ�ʝ�B���/�<t�Y�l��a�a� �k��SgĎ�O�
-M�5��ͧ�N�`:�fj=Ǹ
-%~��Ho����
��L���d�gT�!�Ltr������9`[���q��
N�=AУ������P�G�70�#�����%�����-ˠ��Û�	�
-�[�މ�ќD��C��E,��4���SF�ì��9��>����5��
�->
{`=s�}Zy6*a���ߣJ�;B�Y�`

DZ
�巰�Ȅ�Vx6^����0RO(��UF*8�?����xn��~

�r�R��JK%�Y��BV|���<��O�x�a
Y��C0��2NLm�7�
�����:b��sd����-��
��u�d5�O-��w3�M�S`?�M�$@�ނ��T%j�dS`�l��?l�8���F����Z�
�C����Եq��W
Dw4	���AB[
f���n��WG�zZs,�^s
������8�y�}af�F��e�Y@�t�J��3
�ϳ�Z��'k\����_� ){���j㖼�R�YY��MNjR�y�t���8�7�l,Koc�|�``��K�pE���P��J„L9}dK���#��G
բ�"v �;��"���6
�� hk�P��Z��ʔ�,s�� 	��4%���xôp�@��b�
�Ab�ύ
	�s�b
�C��<���F���M7�SR͟��Ӽo��\�0�<��6�HA��3���U�<�f�����������7�-���K��w�"�H��wd֥� �W
�RFH�*u�-#�2m�g>d�5�q		m�Rȿ�[�˕�y
ˑ���S����
��
���8���B�78[Q�D��y�l�`�qSZ�h`��s��G;tl�0L���穅�w��i�r��+)y4#�o
���f��R���Ƣ�R�p)�6pp̟[ӴW ��(o>ԣ>a�P�*0
�3��,̂ ���@8���J��}�І�y at b�Q�����O.�C
���HVU�M�L|S#�7�)���ظ��U�Z��Qq���
����/�bCV.qlޙ����
x�Ӌt_6s�
TL����g�+.��L)�����������8\��R�����T2����B/[�.9WQ�M�;3�#
R�eA,�I�1$#�cI ��!k�WG�/Y��ݢr�*�@_��ګ����lWIَ󮼺.ەR����$��C��Ea0&��
-`4P&���,1f4��8`�K~�J�
Aa�@J
-UI�X�Nr�#
��(��P�h�(�.|���{VH
�x�rZ��j��Q5hF7���m�YǤ�p�\
|ΟK�� �R�������)W��2)�_�=GC��1�1(�)
�v�gsb�1����Vk^ɇY�n�q�$s��VNAí�ł��F�&��X�I+)��gs���	:5a�G*MS�(��
-`�@��
�A�"K�
�����:kȽ*�Q8����y����lZ�7h��jn���
0R��
6}ZH�.E�����+��ܫ���c�
��%�I���d_��X[�us��:E�@g�ˮ�Fy}Cs'�Ӄ\'*�
-^���RrFu.�Ě?�v��1�8ӫQ�����
Pt @�Q�aU}w;Q��e�?؊�L�g�Ո��{pz��x�L������Cȗ�<j�w
-�T�~_�91
^$������
���ϲd<�\~hp|�+� �k�Y�3-���&=�/��U[��.)��}VOP;_�K\���~x��� 	Y���9s&��~ܬfg�%����l]�X���w׽�;�͂��>Xr�� �����E�q]x������p'�è<�9]C*�
1ʓ�������
H�
:�9��� 9�8��MR�����A
-�̜;�+8��0�e\ϗ VăE���c�un�o
PG��n".�	ɹ�B�o�v�
�<VB�
@����9�@4�r<�顠�)�b�T63
���h�V��?�
�MM)r]�W��ɖ�l���xӲQ�7J ��$�c9R)
`RgH
��<�'��)���Y��0e̗��A��M��y�����o]�C)�
4���L*��.���-�W?�
��|���r>a�‰⒋�)m�y�<�
-�;�*�#;%�T�d�����c
��]*lurg�
OS��
��$���GR-?��=��
�[��N�� ��{X�I��b>r�@�8S�m�~����q�O�"=
����ӄ�SRĻ�P������!~R��
�{��?�
S�������TLL���q��"?
�a�Z��r�@�$W�<Oa�Di����_?̏�>
��ݖ�sT��X��g�/��t|J��?;N����H�&@���C�
�)q�mt����K��| /���A�o
-endstream
-endobj
-1483 0 obj <<
-/Type /Page
-/Contents 1484 0 R
-/Resources 1482 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1489 0 R
-/Annots [ 1481 0 R ]
->> endobj
-1481 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1485 0 obj <<
-/D [1483 0 R /XYZ 89 770.89 null]
->> endobj
-1486 0 obj <<
-/D [1483 0 R /XYZ 90 701.618 null]
->> endobj
-1487 0 obj <<
-/D [1483 0 R /XYZ 90 581.663 null]
->> endobj
-1488 0 obj <<
-/D [1483 0 R /XYZ 90 356.791 null]
->> endobj
-1482 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1493 0 obj <<
-/Length 3261      
-/Filter /FlateDecode
->>
-stream
-xڥZɒ����W�&2B��·�-M�<�=-G8$
@ $��¢��~�P`�#d�BTe&j���e���q6�
��������$�$���i�8�8H�a�^��i
v�<}����M"��Կ���雏O������ï.X�ƕ��}|�d��O�8�
��6��O�g�7���Ym>?�����9wKqݽ�ʜE~.v�^�o�K:|M�h{�y�v
�lOmgT�E3H�*���
}�֎*���.p����p[�ϭl�2�4N�CD�"���u�m�Eze#�Լ16Cw�E�Vg����]���
�j��^�c_�Ɲ�#6����=�}0[;+K:,�t�%A4��ݒO��*7�{/��6���0u�)�̱��g���c�4Qu/�2���rrf;w�
��چ/)
��ʣ:PWڷ���V�Ǣ*��.�N�'��|?��#Ogx��$�^ǮS�?�yh�;o�����N�"ʶ�s9\��
-���HD���SKZF�lι��+��-q�����h�f5׮���
�5�T�ۚ� ��
[�﬍�6
�$0-��c��;�"!cYF��E�܉�
Q$��I}N�X��.�EF͜��i7�E/
�GQ���6Dpe�/}!Y�B�Kە��Nؑja�-%�y�;'X(�I!�?/O7d�H��c~*��
-�&'Ʉ��WZ�䤳�C'k1�Y�+�ƫ�
.j�S�
�Y��`+��
5�^���N�2K��&,���+�X
��tސ����:���#�k�<��y��9���[��Y
�gi��c"��y~^�YW�e�mw%P��Ȕ���з�VIe�Uc^�� �O�N�
��s��x�zI�la����R
U�}���`�ݬ�ӥXE.��j� ��F	�h^R��uR��Ԗ`S��k��WT�
����F���
��
�9�){v	5�H#�����Gsƈ��R|�~��S\��ڹ��D�No�࣢ƪ��
��}o� Z6
-I����$��y

-Z:-;	q#:E{
���D��V�nFu"�H�X�l
���� d��W><a�CW*N��jߞ�&6C���e��|)��4e�h�����h�7����[�l���6čװ
k���ј�� }�K��
-�VI
�z#�
-���d�G�Q����I�k޴-Ц3w�~{
JUA�k&[󦥽��s�Cb}��ژ�u�d�@��nVr�<�1�N][K
Z��x��AXFB��!ԷC����	�?�t%��6:���U��}H��{��d��d��Z�H#Y9^#w��S3]�+�u7m��:��D��J�4��C��֌A�
e�ԽBeiWV:-+�+���~���DWՠ��
�DB�nj�)��
-<����UJ�"��y͐�:�h�g��*Mk� ���T9��E �����1x at gg�mC[��ݽ̌O�%>�`�[��u(zH'���>��K��8��ԏ-��}
-�I'h}�V��]ހ~,&�"��Fo��&!�`�4�9�
-�4L�9`����^ɍ�4��2[h3/N��	���2%[=iuֵ$C:�4�>�2I
-,*�`PR�Y:��������f��q���g�Y�

�=`�{z�Cq���=�����ؓ���pZxz����
-��S����
 �+!|�E��:��%�]$`./�G�g�>��8����8��N
�Rˈ��\�Ł�ihPx�rN$A�G��A�mG+G��	H}�˔3��mF�i
����PE�e6�𫵏�
I6�$+�|�.>Gr�$��V�m�P�
9�Kʕ��
Yyxj�m�<��t7f�64���^�6�q��t�JT��w������s�~��ٟt����jH��
�Ji2|�9V�	~��,t��K�Y�>�Ůk
-d
	PG�{
� �"��g����d��rlB(JS�R�*~

�艠�-����a畚�R��yVydn�%)O �y�c�����s��KS�!�EW�k�� ۃ�c~פqpdUUd�pS�u-W�i%�W�8�%���~(N
�yLS&Ɣ9�f]�@�S�"}լ��5�m��fA�T;Zb�gɥ\l�+u��0�RY-5Y�
-;sÖrɳ��|���fE�]q�?o��+*Ű��W����dU���<\_���{EK�)9�x��Gi�=�v���UyE���Χ�>�t'Ÿ���w���
aCsYY>�sx��#U�
��0�"sDQhh/6yw7�D���~
��
Ϫl�ؗ̌����ŽD�+g׿�Q����5�c+��Ed��3��_D�2
��
 8oOFNE�*c:=tpzrt�l:1P4�� nOA[�b�
U<��
�_���z�xѤ�W.��\{Dp�
yD�a
��("g�$b��t|g��)�\f
��?lF3�����m����B���jI�r���]���
�x����
�7�j�CB�CB�V�
�t'/�
�ⴉ1�6:�i�m�VѯT�D�_��G�®���B*d�m���
������]j:�
�ޖ�غ�$OK�Mӏ��y���s8�4��I&��W�?
�
�q���M|���򶟭["�qp��놉� �įth�E��|���^���I6�|�(z�ЦHl0Kb��1b#!����Yh���"e]h�5Ċ�/��?�� �O
��n��V�@�I����)��ײc`�E�}㊠!�
k
-��]��<s��F^�YΔ(��U�e����m�l��k����5��P�ZS���|7^Fy"0��l�V)���{�I��S�;k�4c}�&C*&C�<�����B:��I�1��\�,6#w#����o��@B���&��a�����1�`�����6�:�n'2֤�%�����
b?D,��a� �8K�@2�J۫~�
w�9Pu�� �20��6&]&%΢�#FQ*�	4�� ��њ���%"�f�zq*�T�LQ�^���ƌ}�͋_٦�4	˘F a���͍�J�̍:�M����A?m0N���r�$-V���~Ɍ
���Պg[yѾ���}�Kۚ;�Y���9�׾�U��m톪];�>Ѻ�g�R�+��`
,�w�L\cP��$��߄�񷖀B`V�:��: ��a��} 4}�
�C e>t&8
�L3e����D�>��?��� އ	�w�W�Ǎc��v���
%�y_����l
��=��?�
  �� �{p�����(���O��ګ����w�͘*0������
��"G�Y|.��d]_�e���{��	�}z�OF�a���͛�xF�<��^����$�;���{2iL�U2��m�>�� P��
-endstream
-endobj
-1492 0 obj <<
-/Type /Page
-/Contents 1493 0 R
-/Resources 1491 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1489 0 R
-/Annots [ 1490 0 R ]
->> endobj
-1490 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1494 0 obj <<
-/D [1492 0 R /XYZ 89 770.89 null]
->> endobj
-1495 0 obj <<
-/D [1492 0 R /XYZ 90 438.052 null]
->> endobj
-1496 0 obj <<
-/D [1492 0 R /XYZ 90 308.024 null]
->> endobj
-1497 0 obj <<
-/D [1492 0 R /XYZ 90 201.991 null]
->> endobj
-1491 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1501 0 obj <<
-/Length 2723      
-/Filter /FlateDecode
->>
-stream
-xڝMs���_�mMUB��
�;9`�`l�LjgLp��Y�L���O_6�%UoީՒZ�VK�V��zo��Ǜ���~�3Z���ҭV�i
�V�;��֭��}����8]�Q
&ܙ�I�bx������7�}�;h��v�7�h0���X����[������5�k�
c�o}Ӯ��
h����Fm�i�jjZG�X�U��ĺ�,#nE���Дr�������_ڦ�����(�2�E��fn��*ڗa��.���m�T���ۚ����G�.LARr�C�����H�=fʌ��6��t`0X�
�k`��0Q
�[�D� b��
��H�#���pש�:��eAX
�k���;��b
&��#�q[7���Yq ��u\�r�g"z�v��M��-��
���AOyʐ�#:M�����;���4�dح����%i�4�xk��)��
,��Ne1p��(
�a�v���0�1�߷b�m��#!�����QqH���Z�P%
�4N�e��jӒ��~&*��9�g������<B

�q �7��.k&��+��X��$�w$Y����׶����0-�m�Td���@�	�n�kH�O����>��2�q���<{�qo<�
#3�f���|˽`vAv��4V�{v��1σȴ��;��������2�_�
E=���T���>9S��p��/C��� v���sw��
 [...]
-�4��
Ͽ��tt�&��=�AK��^�:>��"/����!X���u��W[��>`�
����l0���4�[{�vM�/�t��`���r�{��)L�vM�
fw��t8Y��4�X
LgL\ؼJH0�=��)���ctpHY
�ɲx5�v���w��R��f��
���t��H�>�}��؞��|�;
fBݮ��蒷�=�s�/
�V`K
���!�ua�Z�*j!|�y��Ca�՜��7
;�H��e�m��\�·͟��M�"���X�/���3v�����2e����g�B�p��"�#�d¤�3#��۵(�
��
�o`.��z
Ϥ
�<U�M���fIz�Ļ��c�<�M�p'���5
{��Q2C�p^(!j1��[Y���
p�S
*���)��q=F؏�Ã,r��D��W�|-�M����H at x��t�4�M��8���>��<�p\�9�h��,�h��	��89n�3�g��3r:�
n'��k��
P�!��CUF�����2�N;"�zb{t��gOp��U��3t�
H�d
�c�}�ZX�ۊ�^�dj���</�l����OL���E�q�֝��VO� �5�
 ���w�T+Ǒ�o�F��:ߒ
<����${ft5��fH�ϊ�7�1O
-Hϙ���
@��
�
M���>�I����S՝�	@s�i�	�\otչ����
�+hmnƶ;YPfFژ[Χ ����_:��%)�HI�(c���1x���kш�X-��1��b�-M"����� J
'E��aQ��G/.�8Jd�` 
X�[9�p\;HL���?�gE�g���<��k�hUJ� =��6Lׂ�~*�n�p-c�}�$�UuyEB&
xA�.���qH�8�C��P�.T�x3��#.#�2AA�f%�K�5�T��VX��,�<L$���MPXf��
��R�Хb.�eS���k@�As��|ԣVPn��,�a�0:���P4D�$D
?D8� �B�U5TQ���*�B���.�,9�W�Uޞ�Y��ř�n��""V�K��G��•�)��?�r�v ��$�WiSBs�1��(�a�?Ig%��|�o�}���y5XՎ���em.�iZU��!�,�E�&��
��R:�
՘� \�A����6r����$�
-�n�
�x��5����_(��

��#w�mD��}=�|�[��)\
Co5d�s�
2G�)B7�G��u�� �5dZUE�A/.�C���� ��)�Z���H̸OOJ]�RCR"���C������d
�>ŵ�ћ��Rc�,Y���W="��m
��͐���U[���?Qf�2"/�<L�mJ	�|l�Ֆ���1K����ȃ!Q�y�l��2�
Z��#H��
��)����:W_��{q	VWYSk���|Q�2$��F��q�$� ��+�T���ـn��V ��%c�~��w�1�4��bv"0�12�
s�Fn��ַ��XE�.�UUO��I&���
Uk�'���
���/e�V :��^%�B�D]�D���՚�����T�j�Ul�C"
�w�tl��P2%�¢���2�
��%㊛'qz�G��Y��e�{l�<�ȶ�C"O�� 灱���o'��ij�9��bҭN0�D�%�IQ`��(���{���l���n�@�#��e
�WAf����hҮ����~�3ߙ
�U��Vx��'M
�E�/�<�|�}�c
�`
y�B���?S��I^P���\'�zfƀV�D�>Ar~B���_�KiJB�I�P�H`�{<W�e�xsʫ
�Tܒ�ζ�䣭��F�"T�"ة>E�?EH�j��Pl#����̄�?&�������cR���l"�=8���ի
�|������S��az�>x�U���uT�
̚�~����
-�r��	�
�s�sm�r������^D�{�U��
4�1訽�1���.���S@���ߩ��*;��ֱ,���/��Z��G&b5P���h�20��S�s���
-endstream
-endobj
-1500 0 obj <<
-/Type /Page
-/Contents 1501 0 R
-/Resources 1499 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1489 0 R
-/Annots [ 1498 0 R ]
->> endobj
-1498 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1502 0 obj <<
-/D [1500 0 R /XYZ 89 770.89 null]
->> endobj
-1503 0 obj <<
-/D [1500 0 R /XYZ 90 628.067 null]
->> endobj
-1504 0 obj <<
-/D [1500 0 R /XYZ 90 487.345 null]
->> endobj
-1505 0 obj <<
-/D [1500 0 R /XYZ 90 334.668 null]
->> endobj
-1506 0 obj <<
-/D [1500 0 R /XYZ 90 221.652 null]
->> endobj
-1499 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1514 0 obj <<
-/Length 2612      
-/Filter /FlateDecode
->>
-stream
-xڍYmo�6��_!엵�X��K�O�6٦�&�عâ-p�L�B$ѕ���7�ʒ��
��
���
�X˱�\\/.�n���q(Bk��bǚ��
�0ZY��g���W�
#ۍCX���7�9~��Y\�u��'�ri}`O#+-.~�ӱV@��rl/����TX��ͭ�ſ.��(��(�����knlM�u]ڸ���$t��m%�7W��T����*i2U^Af������j�B�����|����%/W�>�cM\ǎ�����	���G�g�j���7��Iy�N�4g"�Zs���mDhÅ�]۬�U�Jm����!�����徑+�P�
e�vҐ����,ϩ��9�Z�����ya���/�/
�
�1u��<{X|�ɰn�ʬ�o�\������J�������_o�?�̮����ڛ��[<���<x|f٨y�=/�>��Ϙ�����8���W��Hy�m`�//���,e��ž��<K{�B����P�
W�I��~�}S{ZT��r��6ycV�Le�f�P����;��~�N��ܜ�Ӱ>3H��;޻T
�M-%�"ëez�]X�Ӫm��>]]
{S�mUm�r�����
��
-��
�N��
-1��bJ���Z�'" 
�V��J��B"�v��"
h��T�M�648�`gy�V�2m*U�
-�&%o�Kv���-���V�S;>ɆjrcAW��֯������������QV�$��&
6x
� 
o����P�T1�tK;�Yw=�*�[��.ϺI��6r��<�
��6v��ɒ\���]���4h�W���t>�B��
����҃پ�	���6[�:�?�H����
;�ەG�����oRȾ3%{e�����m2b�k��SU��ܙf�������=dz���`���$�G��
w|`��!W>	e�u�<kN��&c�ڤ��2�c��ʄ�Sj�KW��D��l`*+8GiS�24����+�8��wDŽ�:�v
��;�΀�%� o����4�5Q���Ԓ����)7!��g4f�dF�����4oG�����:��S�F*����q؋��#r�Fp�}����'b��8@F3�=;�
-r �"(�5�l�gY�J�
\� �����j����d
�Z���=�: ��s��d&�����K�E����ߏ�<���՜Q��t�O(@o#�6�p$�(���6|à���y�!��W�XsK
k���>�)�_�[� NM<'
�pX���q���N;8=۔=ި��ZB�lj�K�$C@=�qv�lLQ��D$
PK�u�TZ� �qG�(
�7(9�t�R�LK��9��D�Ċb("���G��Dd
-��ӷ�iD�4�/O��������B�v"τ�w����Sۛ
-Æ�q"<��A̞Q.(��,w�!ՠ0�a)"�
p?+SU�TW��L����xB�UK��!�:�
-��
�CT2�ov7:�n�S��eN����y��آ�q$�Z$G�A��t>�
�����"���6�Հ�<+_I$_�|�

��d�X:٠d1�b!"vw�ǐ�h�𔌗���K*�FGD�}%����U�y
���El
@�O�Ab���P�$c(8++�F&+�����
t�8�����#����Y�2!�$v`�N�r����ε�f���n{�:l���I�����)���
-;��]86�L�W� �o{~(t���
Ƿ !B˕���cJ"�
=`�g��
�m�< R�,��d��ƿ!�����&�
�
�T�������;���3�>
�.��C`�\�?�R��*��/%we:�
�[��_s��һ�����JUL�VuӲ�:ca
��3�Ȕ���
��7o�:�R��+������S�"�s`
-�p���2��=��fϼ[��\�`��H�M�MfJf��bX�X���su�+F���7��Y
tV'O�7����7X���$��C��C��y����`�G�0�s4�9��q���Qb��>A(�gJ4忛�R�LҀ[zj�M��RW�:�!'����_��o�I�X�|�2~�D���
X�@��s�k��*>!���q�������T��e�xJ����˛0k��x#S�%�X8�}�
2
d�#'
��ּ�
����H��21���M� xY�X֑��A�*{9���K,��*��L
��B�]
�U���D���m@ʃI�:��
��)`e�d5��S���Z#h�N
Z�I)j�!"o�Y�Y
���`��/�㰳����
rE��`;$-͢v
T<&�4!�0t7�J�����׃?T��s8��ݐ�/$O
����]僱�\��xЩ�M�4���4aď�H�C�ÿ�̠è�[�ߋ�3�9&��}�|aBQ��À�b��A.�'
`�H�̱S�W�T3(񡨼k�+�, ܼ��䍔 �� $�qz��Dh�����&$f��J�����vK,����g>2�����2Ӫ6�J��y�	�wソ�t��ib���_�
w������G��	Ww�g���ى��MN
��.a�y̍\ۇ
�s:���tO�
-�K���
A}�%
h���A��im��j��<��R����~泱�^�	�N���v�-6mo������?.�R:,�
-endstream
-endobj
-1513 0 obj <<
-/Type /Page
-/Contents 1514 0 R
-/Resources 1512 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1489 0 R
-/Annots [ 1508 0 R 1509 0 R 1510 0 R 1511 0 R ]
->> endobj
-1508 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [314.956 600.478 472.963 609.585]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
->> endobj
-1509 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [152.087 390.239 321.452 400.521]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
->> endobj
-1510 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [225.562 336.127 508.501 347.031]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/philosophy/why-not-lgpl.html)>>
->> endobj
-1511 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1515 0 obj <<
-/D [1513 0 R /XYZ 89 770.89 null]
->> endobj
-74 0 obj <<
-/D [1513 0 R /XYZ 90 321.223 null]
->> endobj
-1516 0 obj <<
-/D [1513 0 R /XYZ 90 289.159 null]
->> endobj
-559 0 obj <<
-/D [1513 0 R /XYZ 90 289.159 null]
->> endobj
-1512 0 obj <<
-/Font << /F73 552 0 R /F75 554 0 R /F60 532 0 R /F110 1507 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1520 0 obj <<
-/Length 3692      
-/Filter /FlateDecode
->>
-stream
-xڍ�v���_���R��Z�%�O�k��ݸ�N�4�DB���%����HH�ۼ��`0 s�����_|�x}���&Zd�,
���~���M���z��/Z]���}��#7޷�`�iͽ�u>
uի���>�\W
��~�xI�����Ż��o��/^#Yo���x��o�� �Dž����⑐��8��[.�.�~��M����:x��\m}֎��wP���~_���3�.��Lǭq��1�Э`��
F����Z0��TٝA���	]��W��V_��� �v:W#�yL�
��
-�%	��Һ�u��N
-7^!װ
-<���`�4��9^���:2�;�CYp;���[��?0�t& �Ld��0����L��Q��JE}�,���@QTN�z�
Dwk�
��C�0��Sтa��{��hz�\�T���
�BEɕ��N���)�N
-��I����Z<J����˹#����J`E�;�\P��o7����;G��$y� �ǃ�I��*Ͱ+Mw ��[����T�
���W�o
-U�� ,�
hY��GÀtsӨ�|b�|���[{<��Κ�m�
�o���O��i�^�����?�S���:
c�M Rs}{������O7�?3��/o�X�{�����/wL�Ē��g
D�:D[O5Mi���]��(����t}��˃�IL��$ck�.�p
�"��k0��-��� ��?5��馡�Z�l3��
n�5R��w�K�x(ݝz"=G��� `g���ř
Z�Ao�
�ي����ǎa(�RD�+�w7���Q��|�U��ɰ��,��d��hn�
�����b�n����
�dC�!�
~��%��X[1- &�
�!l��e��"�p��Ab
�;p��^��hS#b?��������K�g]֫0����)�I���B�x!�#.#x�V�������N _�3���ӂG�
�`G�!�Hڃ�rW�/��<
h3�TEт�$�dl��|��%�'ʼ�W�r�<�M�m�54��]@����d�X
�|�c�Xf���d��{*�g+8��KT�gP	�VL�:5s���t�h ��@�\O��)����H
-�P�f��g8ͯ����p,�@0`��X�=�
�J��Z�����
�Cb��^��,�`�ꊻM�:o��%�jCs�p>����
h����wpC�6�ʪ
���E���t��!�#<�J
7��zԃ>�y<�<
-Roy�Q�U��}���m�J�W񧂰�HӀ�5`/a=���-0�j�
- �i��a-��4&�3XI��
�A�c��
��X�4(�\r�趘���ꠁ��9���0�nr�ڎ�	�#��ё��f��,Gt\�0��U�Р��%�F����)�����foBG���9�^ .������:��R|!Qt��=Y��M�zbľ5����A�̇AO�g�����]� ٷ���O��/�#<�>�ߨ�g�b��n1^�3��Ӄ����Q��S\���QFi�@)XGӇ��na�Oh��E������g#��
�B�mF���N��X-B	
|!�����g�
U��<���Rk��)^��Z�Mx��K�|����g�TNiByi
 �mnF at s0e����G$��6u	�����L�$!qM�q־�#H�7�*F��L�H� .��-�K�V1M�۞Fq�pO�l��/uwF��w�+%�!�9[��8%ݢi�3xn�ж;�K�E-��6�d��5� � ���6NqzFA2���{��y�E���$J��=C�,)�9��: [...]
��"
LZ�&1�^\
�O�
-8���!��qT9�L��ժP�R���i>���k ��R�
��l��+VG%˰�����;	ֵ��)�Tb1p
-<S�v�B�T
/6
t��
w8S���V�T�n �0�D�
k)�����
v�NԋIhq>�4�0�L)~o�
Nb�0��a�
�G�qH��P=� �~�� h�l.B.%c���=CHn(���t�q�0D=åJ-��΂�˴�#
�
V�_(��[���,���.A��C�
�d���5���{] �M�p�
ָԌ�0�1%:�>O
'
-�$�
�T�# �?�զ�-�Zߣ�'��j3/�1pڻ
1X��M&������Qc���n�h�
-�L�������>��P��3C1���!�3
'ͅ�

�yT�ס�(Ηr0q�a�1��rV �i
-p��Z��j�Ѱ�'��3i^"�"�
-(�!?��ᅃ�V$行ʵaxh�X
R�������%�4q�:F?����ϟ��3(L�w����S��P<Z�
$$�N�X�|d�:Vpl����e#
�j����3�D\<HpJ[�Y��(`�r�.��ul8������+���Q
_�.�<c�R!J0M��I:`�I�ƻ�{ss�M��5��L��6վ�Q�f�;���O�	}ؤ�Q좥�݇ϟ����
�K���î�|��g��o��R��H%@(�*W���/�:;���Ip�}���K��B�q���븙��[���{LϷf��a8���N5
�z8�t��YƶtT �ړ�
{�8��5����$�n�|���Oo�ےi�co?�����Q��h��4۔w=C���7�P�56
gk���
���%f	۞,>[7K��{0�뮫��a�
-g�U$,V�[���ЃN���		C�*�D��o�^�.;A�(�4|νKdE�	��E/&
-�'�-#�S ��b`K�Ih��d�
��I ���!�3w�
-D�尐���EW���wT0
@L/��Bw������pb-���hc@ȗܥ������-b)����TC�믂7V���l#z�k��r/���
:[-c@�j�r�<[���B��0/��
�,�YNjgfW� ��$�Po!ؤ�����} |�O���F��
/Pu^��`0=�YF@��ׁ�؏��+�㻯��)�I���d�nb3z���o-8���l���b H���t�t$��(�pl���T���� ��'B�,A���m�
Ea8LFXf���°���HMЖ@[
*���i'"PM�Qc
2����
CS�2�ц�T����]Eۢ�	����Z���=*��G
{�����=��6��6'sn�{��д�
My!��F�B�@DM���Y����#���JU1�}�A��	�gʋ�K�D�
-J-�����e
:��y_L����;��PC���{>��װ�?���zF�f��e�u�����,ެ�w�*���'n�������m<��Z�W�`�c�j�蠵�7�ua[ÿ�%�V�$^'IC��C�7߽z�
 �yXC�}ˆ�sdk��sG�r�m]�Tl�(`���Y>&~�N��r����_��f�ۦA;Q �n���m

����_��
-endstream
-endobj
-1519 0 obj <<
-/Type /Page
-/Contents 1520 0 R
-/Resources 1518 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1489 0 R
-/Annots [ 1517 0 R ]
->> endobj
-1517 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1521 0 obj <<
-/D [1519 0 R /XYZ 89 770.89 null]
->> endobj
-1518 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1525 0 obj <<
-/Length 3585      
-/Filter /FlateDecode
->>
-stream
-xڝɲ�6���B�.#UY2wR�yK�2�팕�x�
 �8������7p
��JU���
rDž��������w���n��-v���Y��vF���-Co���Dž%w�$��|�v�����ݽ��}�sa�Y�<?���"=������ ������d�HH�E���-�~�s�[���V\w㺼�Z��$Y���;��J_�MnJ�ꬱ�]�W�R�8�3��uaV^�|\E��	���n��T5c�?O?��W���@����W:�S�T�,�_������,ְ�m��M�Z�!��!�S]�7�;��ZG~�ܭgip
H��t��/+7\j�Ҝ��[��2o
-}�}s�/� [J ��y<ii]Mˋ�M���L���w֪�-�`��
��g�#�:tC��o:����q�_�}/�ij�,/��m�|O�P�4�r�#�M�v��<Y{���"g�{w��
�˴h3��"�UU����Wy�*?�f@����2���a
!�4M�ʊ����u�@�][td��$���W�2U].E�3̤%cW����m�
-bLT er�xz
@Q�� �y�+�����˸�IF�W�V� SʴC��|*�ȩf%~��eK�.MY\��H����>� Re5�e��<�\{D�׳�:tA�K�)�
0��f~��f2�
-.��k��k88�PzftRx"��(�VL���E�U)����R[Ш
@7�oD��!����{��n҄�Ͷz�^=�ݯ�������'������o���#;;Q��+&�� �H��'1H�/��`:'��ښ*���<�ff�(B<��!�����g����-u.7
-X�9�*
-A52R�r4H�|��.�����,�Id�h	_։1Xs� ]�
��ʏ����Ԃ̗Mt57�N�a~g0`�VW�[���a �5
�c�>����uB�tlT�)���qD(
-n��rھO�$h�+�b/�32C�ů�5'B{��UNr z
-��(�#�P6vS�
�q(�5����p��0z[OL��G�2�%����
P�Vu[7�G�$�amS���_8OS�B��U��J�S��/m�|�y,=֡�1<��R�|8�o�q Z�>!�`q���
-x���KF\
-x��'}�H<��4
�� [���F�+��KO�<�&v�aY������̵M�� 
(T�r��Q��4��$Ʊ=�gلm:Ƕ���Z,��6�Pc㒼�	L�qLL��J�6Z����w������9�m�
��lb��FDj�V�.��ċ\ovri�`d
-��/�
���Mዃ�.�f?���Ͽ<�{�}��� ��|�<h���t���Cb�}hC�됄M�$��E���)���g�#�`�gV�9Z�
k#�
,Y�e���`�d�1n�x�b�a��<�M7'6v�C꿭 ��y�w� ���Jns6W�{9�?#�V�Uզ�5Y8pk�
Ђx�0u��Y���W�<�o�1
g	�B��͚�`�ZU$�0�OXu����ar
�”��`tt�g�T���0���� #a���e�#
-d1g�����/T�i�*�'�"�mi �=���xQ4�`�_
-1f��&_&����e8��F�
' :+�'!�[v9&��r$�Jb��a�����
8�B�pq�	�`T��
&���f��@��C
}����ʎR`$K�dw���Q�� 5��p��Bd���bb}В/y

D;�0���+El
-�0S�*���
�J��86�un�6���$�]G�-�� ��q�R!�<(�+��%����S�Fe�9���U����<ʱw�!Ft嶰I{86��}k��QG
�t�v�u�K�i�[�i�����6�������{X��y�Ad6� ���	G�@<Pφ��<O
-$��+{`��Ǔ�	6��D'pg�H�np�X� ���� ��������E��d�"���m&[G:U-�L�e�y�$�������%kC�ۭUmJ;c?;�ڪ�i)2�9k<�y0
��VOh�}u��-��?*���F꨿~��g�n�F*t{��T�]��V�x�H��r��v9v at 4�
Ʊ�
v%6��
�Z�K��Q�S�'�nk�Z�24PѰRe}�#69� �'b
��V�iE�-���&��.�E0�Z�"Us�ПR�Nl�D����
-of]�F|zZrn��} �ҙ[R��&��
u�+2� 
PZ�5_�9��6Uqh'�K�5��`'eaT6wKB5��6���2�O�X�iLj����?x�B���
��U���3��-L`��t�p�Pi=����y
�nná7Y�0��I xZM
!�k����_�j���]6���ף��5&<z��L�b�F_8݊���S:�{��%wGʌ�1W���$���� �L�k�K*���	~d��1�Xf`t	���U�xF�d����S�
&RL�$Z!����R�/[~'6��
:��r�&Ǖ0 iq%�F6�f�bMn�ߣ
khF7���Aw ��" Z<�19q�
��>8״)b�U+��*��~وc2�soT^t�߸���_h=��z�h�><< ��0|18@���|xn_ �\O�U��Q!u[q�+w}r~*(�����T� �e�0�����I�\������c� �������ϸr��j͓1�y_���z
�0�M�xڠ`;)�	E���r��HІ��m��-����oVG�������w/��
޽��'Ր��Q�K�r{ 큭��s䡟LFO�t> �
-�����A
l�9��l�Q�5A4.B
HHUL��d���O��Y�ɴ��۲2��
�j�8ڎKct\�O�
{
}�N�Z���Ckj�5(��vDb��2V̉�����Ldy
-�ʐU�؏��
���Ȟ� �:Z7�����{�Mw�<�o��
�#~���4�ٓ�������g���7�,���Yƞ|�~�����pcR��4wt6�����`�A�p�M�'
@%�
��y�k���&���o
�73z�z���P~�w�H�Vl���
=��#O�Qz�a�{Kĵdž��2I�}��\
J�>K����B��@
q$v��aG¼�n≋��PP�rڑ�0A/��q�X>&}$�9����5�Oo����U�bztL&�+!�(���6�J<y���5��m�j: �
����9}�,��` ��`��"��
6(��}����~����R_�/#���#ׅ �v[U�9��!���K3�j��`[��?��3]���EW缮��,z}Z�r�����Ӌ��X_��&��sɒ����#���U(�ؘ9
`��00"h�Q�/�)~%��
����0L��]�jB�g��]��� ��UN�E�:u���J�id��-R
\b�3ۉ�������f,	
�}w�!@%��u�0��=��k+ֺ[�Z��~,u��x�1
[-��y�/�
��W��5�ěpK�|�l
7�=
�i���Ӈ��xe�XOn
��=A���-
-H�w��	��C ��߿���{�A��ʮ^���F�܍#&��mY����m��
�p?a�	C�J��i.Ϟ>ݷ�Z��
���
f��8qb�
l�#/S�<xV͍*���y��
-endstream
-endobj
-1524 0 obj <<
-/Type /Page
-/Contents 1525 0 R
-/Resources 1523 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1489 0 R
-/Annots [ 1522 0 R ]
->> endobj
-1522 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1526 0 obj <<
-/D [1524 0 R /XYZ 89 770.89 null]
->> endobj
-1523 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1530 0 obj <<
-/Length 3065      
-/Filter /FlateDecode
->>
-stream
-xڭ˒�6�>_�5�UWyd�z��ر�f�[[Ij�ݭ�
m=���� (Qj���I$ � �E9���ټ���������$v�p��$�&�;��o~���
�Տ�P�e�ucKJ��7�PɺO���	��d�!>t��
-���on^<�|�qaMg���
ś����wg���Ʊ�$�|RD��
|�����7��n�캮o'N��\�v]bY3���o��NZ��i��-�������2>
�c�vϠ�
���{Ly�^nE`}�-u�cZ��
��?�n`IX�USy�P���4�D�z�,e���ιx���4uѡA w��$h���8�č�J�ZH������AL�GԿ	̨�NC
"�NM�������$p���q[��s/����� uZ����4�ʢ;�hW�@)˜��ܺ�kɶ|F <�+s���p���XZ�/H�~+
kUbpZQ��޷��-)�Z9c4kN[ױ�mq8�,���
�]��V��M���*��ʆ\��$��x�k��
GX���6p�H3 ���h;��7-
�o	T��fʠt<��4S�{}C�H hzҖ��Zp
�-e�	ݯ8���yWޱEi��uV�D�C��*���J��"��t�+������> �z�f	����hkG
-��P(+Tԇ���*d<ɶ*��,7�@�hg�����*B��X\D1���\��
{��X݄�Y኎Z�:p�$U/Ƃ�T�ꎍ2�LqA	�)�|`�,�|^^�����V��
?�r�cA
�.:�� �I��%���p?(s�h;t_T2��z�;�u`�)\@uW � 3}��(�sj��ȉ�9#�Z"x�F�����J�Q��f=�]���X����e36mv4pO},�_qa�'��m1�=�i	:�����K�[t�`����6����-���O��[�)ϏI����бY/�
=qN���Au��|�QI$Vf���gR�<�Hsn�!�%Tt��ZO!+��B4AH�2F;=)���L}h(�qi�dڢzs���茀
P��<����<���"����8���\�i6�u�ٌ����
{{����·p�i��a�Z*��@�� ���� ��`�cf��¡H�*g�T�QM-�x:��#G��0S�h:��WQ2+�"f�yt["m��1��VQ@V#kB)eĆQ^
�����J7U�g"]DH.��-v�G�<SV6��jFt�2�f���ZI�49l\�Oo��\�>
h^�A^����?��k� ��P���!�RYP��<���e��n QQ�fw�d,�:Qg�F@��
-���M����#���h
�3l6��Շ/1
�~�!�
���
Fƥ��l�XH	�1H��R *�+KS�d����� ��N/�&�����;�"�^b�@`{|�ڏGI;��*=rǀS	Qu���eV����.�$5����"_��NGVS_�:= �2[ٗ� ��,��*���$m�q��q��&'�=����ϋ&���$�&�̒�yr�rt�ܫP¬���Ř"�B���})�5����|���V�
}M�b��?�M��J�$���$/
-t��{!f
-?u�M���P
`U��n�R�u{��,
S��,h���M� p%d/����3�����k8
�}��qCc�`)}���
x�:���̽r�آxݷd�
M�1I��=8*�vC���S��/~ް�� /uhrX�,�\��^Q�ع��1�d�����xabd5H�
�9�4�IlF�U��ȋ����0��2�Q��Q!A)�g&��QA0���x�����s0:�^I��vJ�tRwE>%%�
�+6�3�7�}³}�z��-���^�RՀ|Ǵ
��
`
� ��u&�
Hh=
��4+(ǃ
��w�hA�]�{�%)��2�c�~��_��~���Nŵ��]hî��=g���B"�wM�c�`��y&������L���[sd����_
C���8gM_��L�k�
-P�
a<�����:�Jav�Y��k㥄 �g�}�eeZT�
l
-��=`S�7�}��t�K�0sN7��R��v��\��[p
wUګb!�F+����oz:�:��1��1�>i	��R�L�o�<m�c��]�YɡJ#����@���$
h�IN��3��R�aiD��A��i�
-� ��ah5'm���C�O�囊[df][�D��!^q��Q##��8A
�k)���yDmh�6o��A����#�c����
3i3����<BQ ����Y)/��ĘgV�S������ -rt�0�jWC��u��\�����wH��?�kp}�O�9��94���
�L�N�L�X�6�B�G��"�d�i���8�=�cԑƬ�GňTu��̊M��,6dw��>uU5@ ��Bv`�BN}��iu�b�Ku��!�_9q��<Fg�c�
�G&�Z�SD��gOdSJf8=ݭ�<�QK�hew�WX��|�b�����p|�lGE�kUS�c[h]L�u(���4j��t��[��+�B��Oiש�K�)��C��T��/����5�x����Ke�UwěUw<�P4��K\� �%p��l���ZƀH��2�K��%O>/�K<Аun����uÖ��b	w�؀ a�b�hv��?���H�~��3�U�
i)V��~N0� \)�eTl��*��9�Vp4��I�v�(�a���c�
�#�br�.:N�K=6ЌN!��Q"*|����
�`����?'@#0�!�cD��4?Sg�S�>��I�f{T���~�Lug!�Yi���Yd��A>�i�ݝWu} �~#�֐�LQ4=�2oQ�E��� )K�F�sM9�5��Ǵ�3LՐbJ! [...]
��ι��W��)�b��F�~�|$0Xq��1�8����ϟ�C'냝�����|��D�
��U���U���g�tʝ@�Z����a(�$@�o
�q�H(
-���z �����}�~��ޓ�
-endstream
-endobj
-1529 0 obj <<
-/Type /Page
-/Contents 1530 0 R
-/Resources 1528 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1532 0 R
-/Annots [ 1527 0 R ]
->> endobj
-1527 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1531 0 obj <<
-/D [1529 0 R /XYZ 89 770.89 null]
->> endobj
-1528 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1536 0 obj <<
-/Length 3085      
-/Filter /FlateDecode
->>
-stream
-xڥ]s�6�ݿB�R3�����)���mb��:7m(��p�BP����.v�4��̽��b�X`?���zX���?l/^��F�|�'a��
V��JE��蕫߽X�������l�	L��7�wۛ��'
���^|�`�_4?ޤ�j�\����*����Dy�z�H�J�|�է�\�.+�?c%6A at kn���*LB�8Ǯ�Ï}?�hK=�w�T�j�z݁C�۟��
�Wv�m���vO�RQ��W��h�A����k
�
�;U}#��]�;�<��P�dϫM�����+�c
Ǵ�C��O���ቺn��:|
��~����T�-�^U�O�9�Yg��])����*���u^��f6��LI��t���ud�������w�wo�����_�-���P�m�
��0�O��@����w�N�AIp�p8�r8����%�(�髺*��

����p���=��\&(f}�/#��V
D(A�Qy��Z�0���]��n�AZ��h
!�B�2P�V$�� [...]
h�Ʋ���4v� =g�k+�Z�2��ۡЛ�`K�3�|�/��
�Ɍ7b͹
�f"��-
KQSwAD�"Z�v
Q.�]E߾:��^��
�=<u
-�(�>Ԍmw��
8�T��-�@�U�g��4F�Q v4
-Ȑ;B8�:2 ΞZ�m�֡�-��K
�
rڑ	�v��3
9(lȡ�&y�ȫ���Z�l[�/a���/g=)����,�ȸ=��H��%��\I&y*��#h5�K'��Q:�0N�VjVI�{��G�P蛌a~N�8N�m&����m�g��j�2K���\�x.�מ�
�k�AG��9 `���,�}V��M�找˪ORTSc1��q|Ɇ <*�
t���)Y���=�-����R7��y�1{�
���H��x �Y	�(��q �i�ᔄ{�
F�?]RW�13: s&�Y�Q*�s�r
֐����H
A��F8��
��0��z%�4��
-w��j�"���{�� {�	����P��.g'�S�p�C��*�+��K�圌
0X\�*!����o�Tm.�w6��l�ݻ�7����OD����'�L�a
��8��}W�V���*�)i��y�ױ��H�5����TL��T�i(�L��Q1��Ey�L����G
�N �%ے�$�<��� �;����?M��f�

��~
z3�Atg78N�[}L��9]����*ʬ��ԯ$�9��w$����Y
��<87yp&\�d1D��������bS�zL2Ğ	�����l�1<��zXR𥐋(�B�s����֨�
AR�
�r���8�"����X�����F
-�)a�
5f
��a
J�$1�@f��HL����T�-yũF��2��އ��= ���Si�Bp��l��+ȌE�&��.
�啄pn�z���X����Y�
�v�1�
�a�ٍ�}u
�Q
���]ج�<r�FC4I�?�F�Ҏ6N㸹p�M|�}>e���ۏ7o_�
�[���'N;�o>���ݖ��?��
�5�[�IN��[(j��7�Y
�p�+��h�" �`�I
N1��,
-kG T$���K�k�Y� �����]}�;-�
�m����_���
M�������s
��x��$&�%
����AW�ڡ".U:�j��xY<<84T���4yD�H���@�����
��Ȍ�d�L�0�� �TP�3E>��ѷ���A���ߚ �)EhZM�eŸ,�a��n�.�3
;M�ky�G2
-wYtU�M�,�ݜ
-~`OWt�c��if�
-CO�,�ʓ���s��93n%s�b��Vwh�)��� F��b�q⋻���œ+�u�t�����w	;�QU=ڤ�
_2�E6��E�]������&k�����h�N}��	�W_�(:&3V��G�ZNg
����yi� �x�$-g�c<����:��\�بPA
q*��A�ٷ�7
�����A�����і�Ώ
ndW�o����|�=_�����xYS�AX���]R�u�ch��){f�@3�wƖG0�v��ha!�x�„��Z��>(ʨ��]�\R4�y���v�T/�]�w�'���=��4x$?��ƻ�iU�w�֔!�1w�g<O2��I���x��\���
�`ƻ�~|}��
�/'��l�Q��E�l�>�T��U
�
%l>����Y�
�4з5�����N���'�>���x��lyQ�58��]aC���E�F� v�
��4z!�878
���p�ʒq�%c�!��q
c�=L?%F<D�!���H(�/o��XU����@a`���o���.l_]y|����_�h���q�~���M���T��Str��.q����2�O�h�e�-
��X��-3h
Q6)��{�?�B
�=��8�Ms�E�S�G����3�Ô�:��Zh�kа�M�&�v�Z�7{����˅�9עe�bd� *jm���$LF��d�uw^��D�
-� Z����`k��"]i�2*�����
{�����sC�w�<�
3�+�
T�>�&g��J�nA}�2�y�r��Ӛ�������9����~>֔ϔ��͢=p����aƟ3H�*ɩ�ƨ,�S��'��3�����~f�y���2g� uj� }�
7�I5�a�p��3ܮ��
ǡ����c�����C�}���Ӽ�ϩ#��d��>ՙ0��8@��`�
�=a?����y}C�!7������w6��
���$	7i}�K��"݀���/���4ԃn[�9
xu�D����䮀��H��w%�M&7d�F�~�y�EI}xG�_A`&����(Z{~(�gzl|٧��"�>[�����.?���qh��s
���^�ڝT�>l����6��?��\�W��3� [LN��o���/�B�%
-endstream
-endobj
-1535 0 obj <<
-/Type /Page
-/Contents 1536 0 R
-/Resources 1534 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1532 0 R
-/Annots [ 1533 0 R ]
->> endobj
-1533 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1537 0 obj <<
-/D [1535 0 R /XYZ 89 770.89 null]
->> endobj
-1534 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1543 0 obj <<
-/Length 2456      
-/Filter /FlateDecode
->>
-stream
-xڕY[s۶~�����PӘ�b�S�:�Z��X�L'�%BOyQy����´�x�v��bw�����a��~�^ݾ�<#���
����m#�c+���Lu����J�\q{S�����O��x��E ��R��W]9@�
��V�6��է?l#�O�my�ڸР��]���p�˕=V-�g�9��8��o+DZͪ�"�,�'l�fY�L�W�
xZ���
I�YTiv��t�<۫�Q2��yr�5m��V�mv�b��I1��j���u��	��{unyXҌ��Z5M�Ĥs]!�1KUʔ/�
�&���
�2�f{�@�g�=kj�n|��y������V�mU�� ���8����S[x���<��Y���#S s0�Y��|��U��RI�2�����
�������I���B�lU]deB
��Tu53��xj���x<�	Z��Bom��Vn`^�D��ߦ=�#��m�d��Tq㔠�<���^e���ǁUa������bp�k�PW�ִ
l����;�ֽv� ��#HS�x��D���᡽S�6��<2%�E�nb^o$תH�r�5A�

:R0@{�<K�=&̐�GV��<ݱ-��|�q���
K�p���a���w߽����F(��wo�X�
f�tX��|Y+j��Cuh/x
�Z�Є� b�*y	0�x
�SK
-�����P<d
��Kt5 ��IՁ9

@x���\)}�z
���
�$�̬PҪ4e0�q�ٞ����V
:�\I`K|Ak'�����y���Zүx�r����h*�1;�����*vP��R�&Y�q�.A������
 �]�
-a�R\BH�e#��ȶW��0��i��Ϙ
�QP9al���ܩm����^.�XvVUo�ruhoE$'�Yl:ady�:
ƍ�E���Ӹ�K�o�?q0�<_�/z���|�#�*yB�
�<v����Eʮ؁G� ��	���
�ѯ:�|�ݜ�>�ݶ]��qI˭d)�	\�
�b(��u�h��#pD�u%b�>B'���x-#πQ�[A��'`^���4�s;�o�Vy�yG
���	��q^h��|&��2���c��{��#��̚91��

=��u����4Q/�9�a�N�rё
��X�w;�)Aa��
t�:9�0���l 0bk
-�ě@4�$̤�t�K�qEF�U�_h���O�ƻ_@9	�F��������|�
��*N���8bbs�NJ22-�M��D�O�32-rw�:#3$� ib��
Mpf�"~��Y��|+p\����p�YK���L�6
���:Z���U���Rqi�w�
-:���v<I��5H����^_Wy�
-*@̖%7f�CY��
�j
(Ȅ����;���y�����ަ
Ei��@��^���
�8C]�ȵl:��X
�B%w�8h�>%�
- at YI��_����
-l�˴Y�/��䨾��gp��5�)��M�k�Q
�Z[�'��$N�+�?�
Ȏ
�����w?����Y�l0B���c����q�
뤤�;��Ŕ���r��{
��:��ؖ
O=i��s��b�'�D�{lbLxTb�O)�f� ���ޯ:��X�
zI)�
�c�q<4��=�
�"� P&z��]Z���b�M���p3g?�=e�g�Q/�lo^T�Z٭���A���?$�?e�X��@N�$�����+��0�
9٩���4�
���`�K���W���n77���	�r����h֦���#‚v �G� ´��qBg"
�]E�<d��xb���#
��'{�$k{�5�eY��53�TKi���!)k�	~\��
~����� ���U�O�����뻍@�v���{�X�
-_���H_\i
�
��N�?[
��<Z�Zn
J��y�Bh!y0NCm�NX�`A��b�
𚊮� E������
>hp��%;�%O�8d"��i��<��j�^͕��^怖��P�If�Ц��YZl��*��k��
����Q���$@����w"�ռz��Lc%�9'eB�7
ҝ�\��T��.�yѸZ��`��G�*WI�%�j��/�`$*T��pI�+T
��_�B�H�D�~��b*�	���!>BM
b�
~���OQ_$p�<�J�D�+U�:
���%3�'��c0����Lj�N�C�����
������-���R����j�m��ѡ��gt,�?O!lA,i��z�t.	�����S+�V�ޭDw�
C]����@�_��|t��}`
�U��	��w��3^R
����� �����sL}�>��2>�	}3
W����V�z������a� � ^��A�����Q��D,�&)�Dl����`�fcm��P�*N W�`� �뎍*�
� [...]
�
�,� c��i;�c�ߨML=Q���3~����o:�)�4
-endstream
-endobj
-1542 0 obj <<
-/Type /Page
-/Contents 1543 0 R
-/Resources 1541 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1532 0 R
-/Annots [ 1538 0 R 1539 0 R 1540 0 R ]
->> endobj
-1538 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [258.676 600.977 428.041 611.881]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/copyleft/)>>
->> endobj
-1539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.8.1) >>
->> endobj
-1540 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1544 0 obj <<
-/D [1542 0 R /XYZ 89 770.89 null]
->> endobj
-1545 0 obj <<
-/D [1542 0 R /XYZ 90 482.933 null]
->> endobj
-78 0 obj <<
-/D [1542 0 R /XYZ 90 180.648 null]
->> endobj
-82 0 obj <<
-/D [1542 0 R /XYZ 90 146.228 null]
->> endobj
-1541 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1573 0 obj <<
-/Length 1230      
-/Filter /FlateDecode
->>
-stream
-x��X]s�8}�W�m��"�iY���44i�f�l��a�c��b��f��^۲��h`�I�,]
�{�����޷N��Ιd�Bʥ����$WH��5��m�:_�,�z�(������U����:������
$=+�Z�_�5��FLy���Sdqʠ�Zw�?[�@����Z�"
1������ s�cl_���f~��6��}��C��Xb�l�2M��4��6�_�ˈl�}f���Ι�W�;�#�;�:-
-l�YU�U1-씵����N��(	摎s=������=�'Um��ڌ
�,H�Y
&q�]_wS�I��K���
�&� �D���8���?�q(`�.&z����p���bm�€���+Z+��Y?,(L
�ٺ&���FN�ğ1�q��<1��ѐa�~�&�M<����gXx�
�m��A@�{q=����ϓ4{������x6�;�<��蠱R�a����”Ķb��EV
���
��r?
��A�{�fg�TH!m�_
�e�hS��V�c$
\�Dso�g��3V�,�b�<?��
8Ҟ��.��viOts�~�3�.Y�6i"M���t���դ�B����$��ͦ:�k]��l�u
������E��֡ž�Jm'�a��zp�t��x�~]O0[���-�<,�A/��$.���B�Q�l��U]�Y�0U��;������7X,�!f���
O��"�փ^"�
�0��}��ɻ��ğ�
��+��%���m@�2��)�{^�p�8
?���AO�yX$��Ϸn>
S�0vX���1��N�e~%���Q���t��	wOi�Ǭ
�"�
�<o�tv�<n�jv���p����I���![	������Y��)���D�����[��”��DX�M@)�㑉���hp5��:�$L�e�����G3q,6Q�Wl_j8G��cS�)�ap
���[��R�(~X�K�sp�փ�y�����#<�l>U�G�]�x
-�	G�K⠚:׃��ꔨ�,��sX���S,[r�����ގܔ���89p
Ce&[̶�ٕ�b{���R$���
��@.�P���7�lbHz���Z/�cLC�"bֻ�-͵�^{i�|1����ۅo=�8���Y����\V��2���@�3��?�x�w��X��;�NK՗���B;AN��K�t�j��k�c���G@�MƟ�����
��L�c7�/����yaٜ���Q����-���/��К!p޿#B
-endstream
-endobj
-1572 0 obj <<
-/Type /Page
-/Contents 1573 0 R
-/Resources 1571 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1532 0 R
-/Annots [ 1546 0 R 1547 0 R 1548 0 R 1549 0 R 1550 0 R 1551 0 R 1552 0 R 1553 0 R 1554 0 R 1555 0 R 1556 0 R 1557 0 R 1558 0 R 1559 0 R 1560 0 R 1561 0 R 1562 0 R 1563 0 R 1564 0 R 1565 0 R 1566 0 R 1567 0 R 1568 0 R 1570 0 R ]
->> endobj
-1546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 630.668 221.094 641.547]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library) >>
->> endobj
-1547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 620.616 513.996 629.592]
-/A << /S /GoTo /D (subsection.9.1) >>
->> endobj
-1548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 596.467 288.052 607.346]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators) >>
->> endobj
-1549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 586.415 513.996 595.391]
-/A << /S /GoTo /D (subsection.9.2) >>
->> endobj
-1550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 564.169 117.901 573.145]
-/A << /S /GoTo /D (namespacestd) >>
->> endobj
-1551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 552.214 513.996 561.19]
-/A << /S /GoTo /D (subsection.9.3) >>
->> endobj
-1552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 434.329 513.996 443.306]
-/A << /S /GoTo /D (subsection.10.1) >>
->> endobj
-1553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 412.083 513.996 421.06]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-1554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 389.837 513.996 398.814]
-/A << /S /GoTo /D (subsection.10.4) >>
->> endobj
-1555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 367.591 513.996 376.568]
-/A << /S /GoTo /D (subsection.10.5) >>
->> endobj
-1556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 345.345 513.996 354.322]
-/A << /S /GoTo /D (subsection.10.6) >>
->> endobj
-1557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 323.099 513.996 332.076]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-1558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 300.853 513.996 309.829]
-/A << /S /GoTo /D (subsection.10.8) >>
->> endobj
-1559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 278.607 513.996 287.583]
-/A << /S /GoTo /D (subsection.10.11) >>
->> endobj
-1560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 256.481 513.996 265.337]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-1561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 234.235 513.996 243.091]
-/A << /S /GoTo /D (subsection.10.13) >>
->> endobj
-1562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 211.869 513.996 220.845]
-/A << /S /GoTo /D (subsection.10.14) >>
->> endobj
-1563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 189.623 513.996 198.599]
-/A << /S /GoTo /D (subsection.10.15) >>
->> endobj
-1564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 167.377 513.996 176.353]
-/A << /S /GoTo /D (subsection.10.16) >>
->> endobj
-1565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 145.131 513.996 154.107]
-/A << /S /GoTo /D (subsection.10.17) >>
->> endobj
-1566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 122.885 513.996 131.861]
-/A << /S /GoTo /D (subsection.10.18) >>
->> endobj
-1567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 100.639 513.996 109.615]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-1568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.20) >>
->> endobj
-1570 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1574 0 obj <<
-/D [1572 0 R /XYZ 89 770.89 null]
->> endobj
-86 0 obj <<
-/D [1572 0 R /XYZ 90 721.073 null]
->> endobj
-90 0 obj <<
-/D [1572 0 R /XYZ 90 697.175 null]
->> endobj
-94 0 obj <<
-/D [1572 0 R /XYZ 90 534.139 null]
->> endobj
-98 0 obj <<
-/D [1572 0 R /XYZ 90 501.687 null]
->> endobj
-1571 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1608 0 obj <<
-/Length 1298      
-/Filter /FlateDecode
->>
-stream
-x��YMs�6��W�Vr���
��顑�:q&��Ni�CK��F$
�N���d)�H���b��xx�ط ����u=�m:�+fi�%��tail)�������hKD�!��o��f�
����I��!�=[9D�[g�(����4};���
��-R�(�r�Y8��	[sx��ˆi�����
~����.�
�~�`��Q� B
-��`�OBߛ8��z�2���n�����|G���D3�c-@&������8�Kצ��&���X"Li硽��&5���+�)�}!�xwf�4K�8ʆ��{f)�Hb�����09"Q^���Eh�hMo� �V���0���@���%�4C�r]V�:>xSGq;�fc./gq�I� �O�䄃�����y
tD�O��
D�
8Ȼ	׵^r����KLWwq6����R�=��QO
-Ab�
��$4#6�
q<��E
�s�����+	��^�
�k@$ϋ���ě���Nx8W��:/��$�{�&*����$���k/<
�]n����H��eq��
`�4�a�S&)
�x_C7K��E���x헻P �}j�T����u
Q%]U�aH�;٦\wRն��
8#
"?55ȉH��<Lu|�\1:�b(nw���~�C�*�f1Qǃ�3�cBH��g|�^ʬ��1��R?��/G
-�Og�y���zzXo�:��ud�އ���Dv�R��`I�=���P�n�MZ���x낹.�5"�hh�?����T6��H���72�<���UaW�و'#]#�w3��J^��yMwCF$ԫP.��O
щ2&9Rr��~R@�8�n�i�1c؅�uP�sE�H�
}�"zag������{�湎��j"E����~
<�a��+��d]������`{ij�H��z
�f�]r5���a�\GS���G�IQjgX�����|�hJ���C�
�ZAe
���|Ґ��
��Km}���r���
��Z"���g<�n`
-��.�V�F�#��
3
^e
)f*
�kET?
W��U<�P�s�$Q�
��P�*hq�nS

��۵�� ��ZPF��w,�`1;�x
�Pn��9N�����d����U
+մ�<(������� ��a��@5��ߙhH2�
-
�T-���
9em����-(�����WH�}Y��Bv&����ύI~r���{��~�䯋翱�_����~�_Bd�{�
(X�}o����g�zz�1 �A!�#!v�`����Oˍ��h��
�C��w*���2�I9� Z�������x8�Z1d~`��R4�x����/.nBf�b x��3L��
-endstream
-endobj
-1607 0 obj <<
-/Type /Page
-/Contents 1608 0 R
-/Resources 1606 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1532 0 R
-/Annots [ 1569 0 R 1578 0 R 1579 0 R 1580 0 R 1581 0 R 1582 0 R 1583 0 R 1584 0 R 1585 0 R 1586 0 R 1587 0 R 1588 0 R 1589 0 R 1590 0 R 1591 0 R 1592 0 R 1593 0 R 1594 0 R 1595 0 R 1596 0 R 1597 0 R 1598 0 R 1599 0 R 1600 0 R 1601 0 R 1602 0 R 1603 0 R 1605 0 R ]
->> endobj
-1569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 709.994 513.996 718.971]
-/A << /S /GoTo /D (subsection.10.21) >>
->> endobj
-1578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 688.092 513.996 696.949]
-/A << /S /GoTo /D (subsection.10.22) >>
->> endobj
-1579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 666.07 513.996 674.927]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-1580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 643.929 513.996 652.905]
-/A << /S /GoTo /D (subsection.10.24) >>
->> endobj
-1581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 622.027 513.996 630.883]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-1582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 600.005 513.996 608.861]
-/A << /S /GoTo /D (subsection.10.26) >>
->> endobj
-1583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 577.863 513.996 586.84]
-/A << /S /GoTo /D (subsection.10.27) >>
->> endobj
-1584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 555.961 513.996 564.818]
-/A << /S /GoTo /D (subsection.10.28) >>
->> endobj
-1585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 533.82 513.996 542.796]
-/A << /S /GoTo /D (subsection.10.29) >>
->> endobj
-1586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 511.798 513.996 520.774]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-1587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 489.776 513.996 498.752]
-/A << /S /GoTo /D (subsection.10.32) >>
->> endobj
-1588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 467.754 513.996 476.73]
-/A << /S /GoTo /D (subsection.10.33) >>
->> endobj
-1589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 445.732 513.996 454.709]
-/A << /S /GoTo /D (subsection.10.34) >>
->> endobj
-1590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 423.71 513.996 432.687]
-/A << /S /GoTo /D (subsection.10.35) >>
->> endobj
-1591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 401.689 513.996 410.665]
-/A << /S /GoTo /D (subsection.10.36) >>
->> endobj
-1592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 379.667 513.996 388.643]
-/A << /S /GoTo /D (subsection.10.39) >>
->> endobj
-1593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 357.645 513.996 366.621]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-1594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 335.623 513.996 344.599]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-1595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 301.646 513.996 310.622]
-/A << /S /GoTo /D (subsection.10.73) >>
->> endobj
-1596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 279.624 513.996 288.6]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-1597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 257.602 513.996 266.579]
-/A << /S /GoTo /D (subsection.10.43) >>
->> endobj
-1598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 235.581 513.996 244.557]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-1599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 213.559 513.996 222.535]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-1600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 179.701 513.996 188.558]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-1601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 145.605 513.996 154.581]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-1602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 111.628 513.996 120.604]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-1603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 77.651 513.996 86.627]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-1605 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1609 0 obj <<
-/D [1607 0 R /XYZ 89 770.89 null]
->> endobj
-1606 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1640 0 obj <<
-/Length 1279      
-/Filter /FlateDecode
->>
-stream
-x��Xَ�F}�+�#���EJ��I/d �C��rC5mی1I��sm����k9u�{Ov�v�Z���ŭb�AFR�
�
�
�
���W����'�I����){��4�y�o��A�[��'쐢�@J;ð��;#x�������7
-
N�N�~��^@���/4B4b\:�DH��&�����zm��x��nG��=���|t���IL'��O�8�n'1<D�E� J���I�h��f�"[��-
���ak'˵�P4ف��b��=�>Jm�a�+8��,v�1HQ��Eko�V������
*p���M�ê�8�"�Wh~�CPp��A�|��
�^\�e/��_9�N�)@J 1 5�&���i<
R{�Tc��+�� �i�Tt+���|�W@,�j�/#
Qe��8#M��5����㨕I�*���
�
�
4YjZH���u%��  �)�T .V��8��o
-
�ur������d�L�Mt�a%�����H6
i�
-�?'�pbKp(5���$�l1(B��9��:��e�lRY��lL��+ T�Fl��䝍l�q���ҡ4�Ru ��cg���Ԇ�C�t顺�
-e�7��Y�A�9@��i�|bB

]�mU0͂aN
�$UL*���O?�we�4��1e+ `��
y��� ���2��30�`#H���N��geꇁ
�2�O��p:�����Iw���p�t�>�ǀϏF��MA��@u`S��j� kA�j�K�D�����.�Yn�0u�
�a#��vѮ[�%|��c��sx���ͣa��:��1�x�*l����d�]eyߏҪ
-����O� w�C�;?NPq�q)�&�\65%�7-�G=.�bJv�U�����T�!+'|ϣ
��]ظ��-��%�K���4%G���ǒSW�Wυ�,�
-�ۭaX
ә|�i��D�OJ�-�P�K�3d��}o��)
5?-�Z }1�ڴ��`̰kD��Ӑ��٪Lאl��#ަ��Jƀ������Ј����Iu�>B�zy�b8�U>�p�2�O+�L'�x2�/�
-�<�E�M|8�ϪL�eF�L�َ�2����~�&��vM˲>�o��/;53�2)̔��ݻZI����]�FG��0�%��D��?n>��}/.�C�\�0�z���Y���J�hX
천`�8�sѦ(����{(
~��们v̊��~4���?�C��M���$�{��
�ۥ�.p����KF���#8bE�{�N�����Fc4��-�wc
�jU�ޠ&�`�8Y,(���;
������
���g
-endstream
-endobj
-1639 0 obj <<
-/Type /Page
-/Contents 1640 0 R
-/Resources 1638 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1532 0 R
-/Annots [ 1604 0 R 1610 0 R 1611 0 R 1612 0 R 1613 0 R 1614 0 R 1615 0 R 1616 0 R 1617 0 R 1618 0 R 1619 0 R 1620 0 R 1621 0 R 1622 0 R 1623 0 R 1624 0 R 1625 0 R 1626 0 R 1627 0 R 1628 0 R 1629 0 R 1630 0 R 1631 0 R 1632 0 R 1633 0 R 1634 0 R 1635 0 R 1637 0 R ]
->> endobj
-1604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.66) >>
->> endobj
-1610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 664.091 513.996 673.067]
-/A << /S /GoTo /D (subsection.10.71) >>
->> endobj
-1611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 630.142 513.996 639.119]
-/A << /S /GoTo /D (subsection.10.87) >>
->> endobj
-1612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 596.194 513.996 605.17]
-/A << /S /GoTo /D (subsection.10.94) >>
->> endobj
-1613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 574.201 513.996 583.177]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-1614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 552.327 513.996 561.184]
-/A << /S /GoTo /D (subsection.10.47) >>
->> endobj
-1615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 530.214 513.996 539.19]
-/A << /S /GoTo /D (subsection.10.48) >>
->> endobj
-1616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 508.221 513.996 517.197]
-/A << /S /GoTo /D (subsection.10.49) >>
->> endobj
-1617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 486.227 513.996 495.204]
-/A << /S /GoTo /D (subsection.10.50) >>
->> endobj
-1618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 464.234 513.996 473.21]
-/A << /S /GoTo /D (subsection.10.51) >>
->> endobj
-1619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 442.241 513.996 451.217]
-/A << /S /GoTo /D (subsection.10.52) >>
->> endobj
-1620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 420.248 513.996 429.224]
-/A << /S /GoTo /D (subsection.10.53) >>
->> endobj
-1621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 398.254 513.996 407.23]
-/A << /S /GoTo /D (subsection.10.54) >>
->> endobj
-1622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 376.261 513.996 385.237]
-/A << /S /GoTo /D (subsection.10.55) >>
->> endobj
-1623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 354.268 513.996 363.244]
-/A << /S /GoTo /D (subsection.10.56) >>
->> endobj
-1624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 320.319 513.996 329.295]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-1625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 298.326 513.996 307.302]
-/A << /S /GoTo /D (subsection.10.58) >>
->> endobj
-1626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 276.333 513.996 285.309]
-/A << /S /GoTo /D (subsection.10.59) >>
->> endobj
-1627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 254.339 513.996 263.316]
-/A << /S /GoTo /D (subsection.10.60) >>
->> endobj
-1628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 232.346 513.996 241.322]
-/A << /S /GoTo /D (subsection.10.61) >>
->> endobj
-1629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 210.353 513.996 219.329]
-/A << /S /GoTo /D (subsection.10.62) >>
->> endobj
-1630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 188.359 513.996 197.336]
-/A << /S /GoTo /D (subsection.10.63) >>
->> endobj
-1631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 166.366 513.996 175.342]
-/A << /S /GoTo /D (subsection.10.3) >>
->> endobj
-1632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 144.373 513.996 153.349]
-/A << /S /GoTo /D (subsection.10.64) >>
->> endobj
-1633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 122.38 513.996 131.356]
-/A << /S /GoTo /D (subsection.10.65) >>
->> endobj
-1634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 100.386 513.996 109.362]
-/A << /S /GoTo /D (subsection.10.68) >>
->> endobj
-1635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.69) >>
->> endobj
-1637 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1641 0 obj <<
-/D [1639 0 R /XYZ 89 770.89 null]
->> endobj
-1638 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1670 0 obj <<
-/Length 1177      
-/Filter /FlateDecode
->>
-stream
-x��X�r�6}�W��L����C���4qKi�
���S^
�J���&�2C�
i�D����bqv	Z"����5G��}F� -
�
-~-н��#&�s��uټ������
�c�5�T
�&�
��
�
(tD��$�.�G��O-��
"�}+EH0�M�Bv�}���)�hJ1�%�ɐ�O#ߛ
q��ie��

R?}��|?��e��7]��6|�f�-k4f���[9�`g��vĬa�)W���
ZJ>�eE�����hؘn��FU�	A#n8v]�F�aMXG�Y��wg��]x�tH]'�Y�q� XS՝�1��t�1�w
�
-���=i2.6�ד�X�
Y��
C�8� �//�
*���|�H�9�0�Ƌ ^”ue�p��1��Ή�pR?��M�k�U_�$Ê�[�;�7�Lj�y �~ 
ݏZ�#�"=��_r�c�ֻM�F8B�v��,���y��9W.��OO�4	7Y�1 �X�yU�w8�lXܡ,��ʑ����ŵ탂uCї����&-�L��;��q��AB�r�C�{Z2no{�p�M������~����fӵm
-�Tl��Q|�(�ʞ��Q����+�>�8�m���M�6�i�~֨���J�
�M_5	�q!ߠ�HY�_h��V�:������"7
�

�u�#�v���B�W�
-��
�g��;;��ֻ�7Y�� �JybIQ$���k����J����#�L!klhw��	�&�H�����!��!�c�i�W�TP���$�/g|G�<K�0[U
�J
���_��ƒ��d�
-s��81gq���2����i
i�q �y�,GDm��IA
��i���>��G��Y���'�r؞�s{��Q�
Ÿ���}j�����Kۜ�_�~f@ϩ�u8J�
o�_%���rE��M���ڛ��w��
��^����vO
�#3�������ϐ<+�W.�j=.�o�-$RBv�D���!�������ê���B��XU,��� tJ���	O���#�l�
M&o��Gx�J�Te�w~��ò����JDZ���x8�����>U��խ?sw�{P�XU�=^^\<l�k/�<��G��9̾�
�� %iu� ������<JBAm��	 �
�O�֬��.��'V
7G��p`�� �Oq�
-endstream
-endobj
-1669 0 obj <<
-/Type /Page
-/Contents 1670 0 R
-/Resources 1668 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1672 0 R
-/Annots [ 1636 0 R 1642 0 R 1643 0 R 1644 0 R 1645 0 R 1646 0 R 1647 0 R 1648 0 R 1649 0 R 1650 0 R 1651 0 R 1652 0 R 1653 0 R 1654 0 R 1655 0 R 1656 0 R 1657 0 R 1658 0 R 1659 0 R 1660 0 R 1661 0 R 1662 0 R 1663 0 R 1664 0 R 1665 0 R 1666 0 R 1667 0 R ]
->> endobj
-1636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 709.994 513.996 718.971]
-/A << /S /GoTo /D (subsection.10.70) >>
->> endobj
-1642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 687.292 513.996 696.268]
-/A << /S /GoTo /D (subsection.10.72) >>
->> endobj
-1643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 664.589 513.996 673.566]
-/A << /S /GoTo /D (subsection.10.74) >>
->> endobj
-1644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 641.887 513.996 650.863]
-/A << /S /GoTo /D (subsection.10.76) >>
->> endobj
-1645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 619.185 513.996 628.161]
-/A << /S /GoTo /D (subsection.10.78) >>
->> endobj
-1646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 596.482 513.996 605.458]
-/A << /S /GoTo /D (subsection.10.75) >>
->> endobj
-1647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 573.78 513.996 582.756]
-/A << /S /GoTo /D (subsection.10.77) >>
->> endobj
-1648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 551.077 513.996 560.053]
-/A << /S /GoTo /D (subsection.10.80) >>
->> endobj
-1649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 528.375 513.996 537.351]
-/A << /S /GoTo /D (subsection.10.81) >>
->> endobj
-1650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 505.672 513.996 514.648]
-/A << /S /GoTo /D (subsection.10.82) >>
->> endobj
-1651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 482.97 513.996 491.946]
-/A << /S /GoTo /D (subsection.10.9) >>
->> endobj
-1652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 460.267 513.996 469.243]
-/A << /S /GoTo /D (subsection.10.67) >>
->> endobj
-1653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 437.565 513.996 446.541]
-/A << /S /GoTo /D (subsection.10.83) >>
->> endobj
-1654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 402.907 513.996 411.883]
-/A << /S /GoTo /D (subsection.10.83) >>
->> endobj
-1655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 380.205 513.996 389.181]
-/A << /S /GoTo /D (subsection.10.79) >>
->> endobj
-1656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 357.502 513.996 366.478]
-/A << /S /GoTo /D (subsection.10.84) >>
->> endobj
-1657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 334.8 513.996 343.776]
-/A << /S /GoTo /D (subsection.10.85) >>
->> endobj
-1658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 312.097 513.996 321.073]
-/A << /S /GoTo /D (subsection.10.86) >>
->> endobj
-1659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 289.395 513.996 298.371]
-/A << /S /GoTo /D (subsection.10.88) >>
->> endobj
-1660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 266.692 513.996 275.668]
-/A << /S /GoTo /D (subsection.10.89) >>
->> endobj
-1661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 243.99 513.996 252.966]
-/A << /S /GoTo /D (subsection.10.90) >>
->> endobj
-1662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 221.287 513.996 230.263]
-/A << /S /GoTo /D (subsection.10.91) >>
->> endobj
-1663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 198.585 513.996 207.561]
-/A << /S /GoTo /D (subsection.10.92) >>
->> endobj
-1664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 175.882 513.996 184.858]
-/A << /S /GoTo /D (subsection.10.93) >>
->> endobj
-1665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 153.18 513.996 162.156]
-/A << /S /GoTo /D (subsection.10.95) >>
->> endobj
-1666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 130.477 513.996 139.454]
-/A << /S /GoTo /D (subsection.10.96) >>
->> endobj
-1667 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1671 0 obj <<
-/D [1669 0 R /XYZ 89 770.89 null]
->> endobj
-102 0 obj <<
-/D [1669 0 R /XYZ 90 110.349 null]
->> endobj
-106 0 obj <<
-/D [1669 0 R /XYZ 90 77.486 null]
->> endobj
-1668 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1713 0 obj <<
-/Length 1457      
-/Filter /FlateDecode
->>
-stream
-x��Y_s�8�����L�H	����&MҴ�����pi�� �L
�����߂�ml�k�yBi����#�S���
.��<�N.
j$�ō���pl���и39�
�3(w
6U��oF7���[�b���#�	D�g�q� ��}�F���\*\�Z�E�97n{�p���!�A�Y�#x%D
� ���y>��?�,���Eŋ���
��1����h�����
��
�z�Te�J��E�

-��L�4��I�QR�l�'0���}T��h�Er���̃,Z%����g	a6���t��
b#�"��fX
�ž7�[�L�3f��!g~�xz��o1s����5Ӈ(��s�}�Y��$�
f�C�m�u���4	Ԯ��K>(�2�A.5�&�L�(�֠m.�d@� �AOc��-�kF�Q2�c�l���!ka1��yǀ�sr	��V��0dѕ'���4�
�@�^1�

�)y�ʢ�"�嶣����
��1r�9�=��M�W�I)c��QX��#.���T6�
z��cעH�&
%h2+�/`:A�Ͻ���ug
|bc�~�7�:4�'
�q�/���5/�~�,�;Hgo�ۙ��-FF��lL�2[{m��4"�u�S��R�5��e�:���d'��Z�=�rN
S�G���0�Υ���oG�t�bc�Gy����JРAt�mWIM1�sS(�UDN2�4;ৄ0jJ��W���������4��m	�C�<���#Vq_2�vKk
�0�	��^�i��H���
���b�A�{f�y!

-�
S��C[|�
��9�^�>�i
�`�c�e6�pb�3%iQ$���Ϣ��V]�˰���<
�P�B\�f�'�|�)��O�� �]z<���:%�^�V����:���m�?�uL������.�_���"�Y��f��bL�Tr�$���&�
z�e/T2T%UUr�=�:,�T�m1p��-��1n�$I�E�z)P#
C]�i,��. �j2[@�p�#����0X��
��zb�E���x���x��"��`��$IJ����J[g۶�t�<���\�86e�
�Hڙ��[e��w��Ǫ��N��k��BͫMϞG�c�� �
-�QG�F�՞$�3�Jd֢�d��O���s���F��)�U6��ߣ3j~<���1��4^���:G�"-t��f!�A��J��9�'�B�D
)&�u�Q��s���g
��,
-�o ��
-�K���=/�@^��,vG�>���ƺ"U��?���
F�?����~��?ic�TS<
�T�x/R�w �B�E��ll�
�Duy���fU7��G���8����&bkr�7X��86\�v����\���2
~P��s��������~�Ԑ~�
�({
���#(*`������RkW��m���2ݰM~�%+o=��4+�����x9�e2EA��q�7C�Ď��Nt.�S}�%���>Q�(�_W|�
-endstream
-endobj
-1712 0 obj <<
-/Type /Page
-/Contents 1713 0 R
-/Resources 1711 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1672 0 R
-/Annots [ 1673 0 R 1674 0 R 1675 0 R 1676 0 R 1677 0 R 1678 0 R 1679 0 R 1680 0 R 1681 0 R 1682 0 R 1683 0 R 1684 0 R 1685 0 R 1686 0 R 1687 0 R 1688 0 R 1689 0 R 1690 0 R 1691 0 R 1715 0 R 1692 0 R 1693 0 R 1694 0 R 1695 0 R 1696 0 R 1697 0 R 1698 0 R 1699 0 R 1700 0 R 1701 0 R 1702 0 R 1703 0 R 1704 0 R 1705 0 R 1706 0 R 1707 0 R 1710 0 R ]
->> endobj
-1673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 659.759 336.132 670.639]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
->> endobj
-1674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 649.707 513.996 658.683]
-/A << /S /GoTo /D (subsection.10.1) >>
->> endobj
-1675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 624.799 428.64 635.679]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference__Common) >>
->> endobj
-1676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 614.747 513.996 623.723]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-1677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 589.84 389.939 600.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-1678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 579.787 513.996 588.763]
-/A << /S /GoTo /D (subsection.10.3) >>
->> endobj
-1679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 554.88 299.694 565.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-1680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 544.827 513.996 553.804]
-/A << /S /GoTo /D (subsection.10.4) >>
->> endobj
-1681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 519.92 315.718 530.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-1682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 509.867 513.996 518.844]
-/A << /S /GoTo /D (subsection.10.5) >>
->> endobj
-1683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 484.96 301.89 495.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-1684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 474.907 513.996 483.884]
-/A << /S /GoTo /D (subsection.10.6) >>
->> endobj
-1685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 450 394.399 460.879]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common) >>
->> endobj
-1686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 439.948 513.996 448.924]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-1687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 415.04 282.529 425.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-1688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 404.988 513.996 413.964]
-/A << /S /GoTo /D (subsection.10.8) >>
->> endobj
-1689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 380.08 288.79 390.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-1690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 370.028 513.996 379.004]
-/A << /S /GoTo /D (subsection.10.9) >>
->> endobj
-1691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 345.12 513.996 355.999]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-1715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 334.798 127.862 342.551]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-1692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 323.232 513.996 332.089]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-1693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 298.205 291.918 309.084]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
->> endobj
-1694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 288.153 513.996 297.129]
-/A << /S /GoTo /D (subsection.10.11) >>
->> endobj
-1695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 263.245 384.426 274.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator__Common) >>
->> endobj
-1696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 253.312 513.996 262.169]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-1697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 228.285 362.289 239.164]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-1698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 218.352 513.996 227.209]
-/A << /S /GoTo /D (subsection.10.13) >>
->> endobj
-1699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 193.325 362.014 204.204]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) >>
->> endobj
-1700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 183.273 513.996 192.249]
-/A << /S /GoTo /D (subsection.10.14) >>
->> endobj
-1701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 158.365 341.531 169.244]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) >>
->> endobj
-1702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 148.313 513.996 157.289]
-/A << /S /GoTo /D (subsection.10.15) >>
->> endobj
-1703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 123.405 344.301 134.284]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) >>
->> endobj
-1704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.245 111.45 224.72 122.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-1705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 113.353 513.996 122.329]
-/A << /S /GoTo /D (subsection.10.16) >>
->> endobj
-1706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 88.445 310.189 99.324]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare) >>
->> endobj
-1707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.17) >>
->> endobj
-1710 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1714 0 obj <<
-/D [1712 0 R /XYZ 89 770.89 null]
->> endobj
-1711 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1770 0 obj <<
-/Length 1374      
-/Filter /FlateDecode
->>
-stream
-x��Yms�8��_���3gEz#ss3M�tڦs���)�x�-;Lyq�\���$�q��ӌ�	!i���G�����������Rz��|A�3Y8>v$�p7wn\��pD0���(���r�^�y1��|r��$�U	
R�.&���!fA��rf���;s���`���y��b�Q��s=�{��nO��r�Ү��K{�"0#	A���C�� ���xH��F�{=ς�Ux�����}�̲!Q�.��⿕�y�&�9�a�g���>�f�ɽ6���
�6@�
s
��>�����ֆ��q�T�fD���K|�R�y�@_�7��د�2}�Ʊ��`��O�D�����qH���d�SP�Tf���=g���e���#�(���
t��Őr7�^�9�RL��9��d�z��ݢol?D� �)��
-�2{�ɬ���%Q�� k�l��e��h�bvl�����qo�r#�����}A,��]J��|�U�fE�M*T ��s�Ұ�9��}N�� E{�	���O�&̟�ɉ����p��lQ�ɘ��j*��}:�`��mx�f�r�p��A�'���S"��ɿ
�;��)�[^L�BgA�����53l�5a��Sح,)E:�I�[���\[��ټ6��!z�s������vUQ�.��WQg($D�,�ZE�c�BI�Z)���DP�{�ى"�=�Rz8�P���5P<\kB����;��z/e���V���,�����u���D��,k���|�̗�����ͷ�|�&Ѻ�Te@������1M�d�#��A
�v�;-��B��>`(���,�O?�Ę{x��W��%hbG�:{B� i���ޔz0w̞
aӰ~�<�x��B�����S^I1��Ҡ�H���jG�{(�0{�S�9.��&��i5�sW	�rT}�:
-6x�P��)s⠫�c
�~UY%�U=TQΚ������&s{ѳ�!�3 C�
�<���F�x��X�%�M礙�9�sR�Ɏm�+5:
���BE(p
�od��
ظ0��ul`�� ������R�����B��o�6 
�*���G�e�5�f
&A�; '�#!�;p|}1�
-Y��<G|�<I�0�G����U�4
���'����"�US�A?�vou��b�خ�f��֜n��aD6_1�[pU�o��,�7\�
О5�e��S��)�c�-Zl6��n��Q���,X����ʇrQ�P
w���oA��^����~�
@fU0�8ȷ�fV.,��:�m�Ks�%H��3�o�c�Nԙ7		,��
��=��w�
}.��o�B8C�7���buzrr���u�D�4މԶ
>�[���4ӵU�z��K�#�	Ak$ ��0��V���a���8�{�y
- o���t���
-endstream
-endobj
-1769 0 obj <<
-/Type /Page
-/Contents 1770 0 R
-/Resources 1768 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1672 0 R
-/Annots [ 1708 0 R 1709 0 R 1728 0 R 1729 0 R 1730 0 R 1731 0 R 1732 0 R 1733 0 R 1734 0 R 1735 0 R 1736 0 R 1737 0 R 1738 0 R 1739 0 R 1740 0 R 1741 0 R 1742 0 R 1743 0 R 1744 0 R 1745 0 R 1746 0 R 1747 0 R 1748 0 R 1749 0 R 1750 0 R 1751 0 R 1752 0 R 1772 0 R 1753 0 R 1754 0 R 1755 0 R 1756 0 R 1757 0 R 1758 0 R 1759 0 R 1760 0 R 1761 0 R 1762 0 R 1763 0 R 1764 0 R 1767 0 R ]
->> endobj
-1708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 318.129 718.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-1709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.18) >>
->> endobj
-1728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 673.003 410.637 683.882]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common) >>
->> endobj
-1729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 662.95 513.996 671.927]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-1730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 637.914 343.962 648.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
->> endobj
-1731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 627.861 513.996 636.838]
-/A << /S /GoTo /D (subsection.10.20) >>
->> endobj
-1732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 602.825 279.196 613.704]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-1733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 592.772 513.996 601.749]
-/A << /S /GoTo /D (subsection.10.21) >>
->> endobj
-1734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 567.736 314.612 578.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-1735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 557.803 513.996 566.66]
-/A << /S /GoTo /D (subsection.10.22) >>
->> endobj
-1736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 532.647 381.587 543.526]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction) >>
->> endobj
-1737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 522.714 513.996 531.571]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-1738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 497.558 333.043 508.437]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-1739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 487.505 513.996 496.482]
-/A << /S /GoTo /D (subsection.10.24) >>
->> endobj
-1740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 462.469 439.967 473.348]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator) >>
->> endobj
-1741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 464.491 513.996 473.348]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-1742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 439.335 374.756 450.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-1743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 441.357 513.996 450.214]
-/A << /S /GoTo /D (subsection.10.26) >>
->> endobj
-1744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 416.201 381.003 427.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-1745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 406.149 513.996 415.125]
-/A << /S /GoTo /D (subsection.10.27) >>
->> endobj
-1746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 381.112 354.811 391.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-1747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 371.179 513.996 380.036]
-/A << /S /GoTo /D (subsection.10.28) >>
->> endobj
-1748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 346.023 399.264 356.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-1749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 335.971 513.996 344.947]
-/A << /S /GoTo /D (subsection.10.29) >>
->> endobj
-1750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 310.934 461.061 321.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) >>
->> endobj
-1751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 312.837 513.996 321.813]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-1752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 287.8 513.996 298.68]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-1772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 276.587 173.262 286.724]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-1753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 265.793 513.996 274.769]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-1754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 240.756 273.666 251.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-1755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 230.704 513.996 239.68]
-/A << /S /GoTo /D (subsection.10.32) >>
->> endobj
-1756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 205.667 309.083 216.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-1757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 195.615 513.996 204.591]
-/A << /S /GoTo /D (subsection.10.33) >>
->> endobj
-1758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 170.578 373.82 181.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-1759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 160.526 513.996 169.502]
-/A << /S /GoTo /D (subsection.10.34) >>
->> endobj
-1760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 135.489 376.057 146.368]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction) >>
->> endobj
-1761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 125.437 513.996 134.413]
-/A << /S /GoTo /D (subsection.10.35) >>
->> endobj
-1762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 100.4 326.234 111.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-1763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.053 76.49 243.251 87.369]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-1764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.36) >>
->> endobj
-1767 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1771 0 obj <<
-/D [1769 0 R /XYZ 89 770.89 null]
->> endobj
-1768 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F112 1773 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1830 0 obj <<
-/Length 1664      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�F~�W�b�{�V��әԱ3N���d��f
V
�D��{�& ;)�����s�w.�vfv^u~
tή�D(�;��a'�"�sXM��.��O���!"����Ż��˷�[y�s9�|���
���Q:�E��'�L`����B�Z8
e�;wn;�w�1��T�ό��M��!;!�mZ�K��x��R�f�������&�q�>?�L�"���X
��Y\&�̈'i9������"�R����ߜKC�X��h��E�qD�#V�?�NKy(v�(���A7���R<��(��UOŹGC�p@�
����ixե���We�9�ʖ_$6�;F��dM�
8���L�"O�zQ��޳aҫ*Vz�0`
�9{$Ą�ԧ5#�#&{(��tJ�Z��H��s ���oq
-^�0�,B��v@�Pob�C�� h~��E��þ2-���M�#�>��$QV���<71�M`R�

-��>��1�K
-���x
꒻v��e&���q:��_��\_�����XdU�	+z'R-"���RՐ�1-�
-�Q��j	G��F�)���$�x�l�,Q��"��G� �
-C��$�'�B�%do��������I6�)��� ��� 
ߍ�:Q*[
�|
U�'��(.��ca�˩.[�������:O�3uh��p(����mN�c�vy�ec_���
+�J`Р#B��-�'���CX<���@_�'�L<pt�w�b$&|Xͥ7�J�� �d�{̍�SpJv
8X[��JK��^�w�>�%nzo��meI�VR�`Mln���궒��.
-1�%^�,ܟD>
a�r��I��5�Ÿ�i���o��҉�
��m,��sN��dR�����T�[٦J�8T�$
���4T���\diQ��c: fZKo�ac�Ʈ�:�K�Ģ5c}�_�.�=t�!���$jDU������.�2mi!�w��&��i�/�ƀ}7j�w�v�ij �px���G���D�0����lG�C>���iJw���Ɔ�'R��RØ���K
-½�Tb�.��0���C��S
���C�6
J(b4lKM���P�N�:t�QQ�g�^U��e&#͸a����GG��F��$�)�}7���N<_�-r��X��̾9������{��h��țH������'��^uS����ovvR1�,�/+����,ө	2��$�ѩ-��ژv�P/B���
�nUB��ζX�49D�� �!ǣ���+��m�O�Y
�S����u����:����yV�*�Y����E
ui at N���v]��h�Z\�:��t���~�B�'.
�iFҮC5Z�Iyq��.6��x�i�y��?9,�1Kt�w�Wotם�I�!
e�t�EH=g�L�Hȭ�h����R�
�s�Ȉ���d�:�g��W"�4�W��
��	�b:�ߓ��3��@Qt�MB��\}Z
ה>���ﺀ�������'iE��e�$�2�F����'�����
�Sb��B��Y��md�
����5w�������g�A/@~������ ������i�1g�
��@�F]��6
-տC
;P
�{�Ʌy@ԌL=#5��������7q��4K��"�t��e�����1 �V���v�Wf�&٢�m�����r��ry~v6Z�
-���
�YsF��+�Z�Y.lלZʅj� � ^#��
-endstream
-endobj
-1829 0 obj <<
-/Type /Page
-/Contents 1830 0 R
-/Resources 1828 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1672 0 R
-/Annots [ 1765 0 R 1832 0 R 1766 0 R 1792 0 R 1833 0 R 1793 0 R 1794 0 R 1795 0 R 1796 0 R 1797 0 R 1798 0 R 1799 0 R 1800 0 R 1801 0 R 1802 0 R 1803 0 R 1804 0 R 1805 0 R 1806 0 R 1807 0 R 1808 0 R 1809 0 R 1810 0 R 1811 0 R 1812 0 R 1813 0 R 1814 0 R 1815 0 R 1816 0 R 1817 0 R 1818 0 R 1819 0 R 1820 0 R 1821 0 R 1822 0 R 1823 0 R 1824 0 R 1827 0 R ]
->> endobj
-1765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 513.996 718.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-1832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 696.879 173.262 707.016]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-1766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 686.084 513.996 695.06]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-1792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 661.892 513.996 672.771]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-1833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 650.679 167.175 660.816]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-1793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 639.884 513.996 648.86]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-1794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 615.692 350.414 626.571]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Domain__Product) >>
->> endobj
-1795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 593.684 513.996 602.661]
-/A << /S /GoTo /D (subsection.10.39) >>
->> endobj
-1796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 569.492 452.245 580.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-1797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 559.44 513.996 568.416]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-1798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 535.247 402.527 546.126]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList) >>
->> endobj
-1799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 513.24 513.996 522.216]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-1800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 489.047 441.252 499.926]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-1801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 478.995 513.996 487.971]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-1802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 454.803 334.358 465.682]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
->> endobj
-1803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 444.75 513.996 453.727]
-/A << /S /GoTo /D (subsection.10.43) >>
->> endobj
-1804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 420.558 426.867 431.437]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant__Common) >>
->> endobj
-1805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 410.506 513.996 419.482]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-1806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 386.313 492.37 397.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-1807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 376.261 513.996 385.237]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-1808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 352.068 403.972 362.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-1809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 318.106 513.996 327.082]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-1810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 293.913 271.993 304.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-1811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 283.981 513.996 292.837]
-/A << /S /GoTo /D (subsection.10.47) >>
->> endobj
-1812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 259.669 307.409 270.548]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-1813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 249.616 513.996 258.593]
-/A << /S /GoTo /D (subsection.10.48) >>
->> endobj
-1814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 225.424 372.146 236.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-1815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 215.372 513.996 224.348]
-/A << /S /GoTo /D (subsection.10.49) >>
->> endobj
-1816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 191.179 286.936 202.058]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-1817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 181.127 513.996 190.103]
-/A << /S /GoTo /D (subsection.10.50) >>
->> endobj
-1818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 156.935 248.212 167.814]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-1819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 146.882 513.996 155.859]
-/A << /S /GoTo /D (subsection.10.51) >>
->> endobj
-1820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 122.69 298.005 133.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-1821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.941 110.735 289.417 121.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-1822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 112.638 513.996 121.614]
-/A << /S /GoTo /D (subsection.10.52) >>
->> endobj
-1823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 88.445 297.457 99.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-1824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.53) >>
->> endobj
-1827 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1831 0 obj <<
-/D [1829 0 R /XYZ 89 770.89 null]
->> endobj
-1828 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1888 0 obj <<
-/Length 1588      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�o����$c�$M�.M�&�>��!K�-T/�$�Ϳ�I$�ؑmu-�~�)�:
��{�N����Ϋ������cN�I�s{���x����عs=D�#�1v�Ұ��#*�{�T����k��0�@V�X�fv��v�i@`;D
��(�}�N
ӯ
�X�;_�E��)��Թ�5�F�����rn��Ҟ`��x� B�R�!�nXf�t2��-҇���pz��ʰ|�_�I<}�rU�uQNo
�Ze�A���(����@-�w�E�����^��A�Y���}�nDAy�2&7�<||PǨE)b��y�?�`z��:y�1��Z�>jT�C�����l~�x�277D�S�C*ܢ������z�%�U��s��R�'‰�.��88]f�Te*��:)�����nXG����a
���ݬ��0��)gae�z
�
�Zp��Qk�
�a���>�c 
����^�����B�1�����rʯz�&I��1��3=\_ & ��#���s6��� [���(�����8�����.�3�
�G$yU�ij�
�?�#������hQ���.�7�B*���ߛs~� �&��<iNdb���r]�`�Us~$L�Z����q���Zn��}r���q{y���<��.�DU�?=����N�,��m�6�	��Q���5��
-{�Vw��\��{Y򷇰�e�ӃD�
&���
-6dzQ��0퀒��G����*�A�P��>�e����`O���">
-�h�Pr�g�B-�̆ya,�� �$}��,*�e��1����jS�������0
���~��;{;�
z�(���ި��8Fnq�}¤��J�6����P䊲�]�}�̀��%�=8yB�Sp
���\���eE��H�&m��F�
|,����/45e]�ȗ�w �u���Y�(%>G>�yW5��{��i&�Ŏ�3�����$�_)S"�t������tҺE1K���|�|��s�4���k�`D�?/�,[WA�g�v��<�<�H`��:Y�IԖ��0��f9ص#
��mE���Ar��
&��
�i�a	�D���C���6�s6`®�A�}�����]V6Iɘ|
=g!2��8�˗=	�HF�9������l�V���C���U�W��;6��#�
Gz�0
-�)�U���E
����Eo&�du�ڶ�5���ֱ��k�A�3t���/�
���.�Ԧ�*��rF��#՝��;����v����oΉ)L�i��Sҷ��H��x�]$ճn�Pp
|�j�:�<2gl�2U/�x�˵�D?�6�4����v�У
-��H4�6w-r ܛE�T]F�~�-]]W�AX�>���~��ښp�*�*�<L�����SƤ>F<�P�<�/g��܋�ɝ�D��MH�N.�g�v���i���	ӗ���u�M���!)x������!�����[��
��P�9�dr�W����
��	�uԦ
��P�*�5����5��������џ
��*Dp�u�������d��W*���ȶ�y� aoݩ�[�ʊR����u
-���HG�)%�H ��:ϣ튧���}�L�\f�9/ ��L���J
-endstream
-endobj
-1887 0 obj <<
-/Type /Page
-/Contents 1888 0 R
-/Resources 1886 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1672 0 R
-/Annots [ 1825 0 R 1826 0 R 1847 0 R 1848 0 R 1849 0 R 1850 0 R 1851 0 R 1890 0 R 1852 0 R 1853 0 R 1854 0 R 1855 0 R 1856 0 R 1857 0 R 1858 0 R 1859 0 R 1860 0 R 1861 0 R 1862 0 R 1863 0 R 1864 0 R 1865 0 R 1866 0 R 1867 0 R 1868 0 R 1869 0 R 1870 0 R 1871 0 R 1891 0 R 1872 0 R 1873 0 R 1874 0 R 1875 0 R 1876 0 R 1877 0 R 1878 0 R 1879 0 R 1880 0 R 1881 0 R 1892 0 R 1882 0 R 1885 0 R ]
->> endobj
-1825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 332.874 718.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-1826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.54) >>
->> endobj
-1847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 673.751 295.235 684.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-1848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 663.699 513.996 672.675]
-/A << /S /GoTo /D (subsection.10.55) >>
->> endobj
-1849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 639.411 387.578 650.291]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-1850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 629.359 513.996 638.335]
-/A << /S /GoTo /D (subsection.10.56) >>
->> endobj
-1851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 605.071 513.996 615.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) >>
->> endobj
-1890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 594.749 127.862 602.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) >>
->> endobj
-1852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.472 581.161 197.891 592.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-1853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 583.064 513.996 592.04]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-1854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 558.776 430.756 569.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function) >>
->> endobj
-1855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.472 546.821 197.891 557.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-1856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 548.724 513.996 557.7]
-/A << /S /GoTo /D (subsection.10.58) >>
->> endobj
-1857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 524.436 302.438 535.315]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant) >>
->> endobj
-1858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 514.384 513.996 523.36]
-/A << /S /GoTo /D (subsection.10.59) >>
->> endobj
-1859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 490.096 394.946 500.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant__Common) >>
->> endobj
-1860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 480.044 513.996 489.02]
-/A << /S /GoTo /D (subsection.10.60) >>
->> endobj
-1861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 455.756 346.847 466.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-1862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 445.704 513.996 454.68]
-/A << /S /GoTo /D (subsection.10.61) >>
->> endobj
-1863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 421.416 305.925 432.295]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-1864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 411.364 513.996 420.34]
-/A << /S /GoTo /D (subsection.10.62) >>
->> endobj
-1865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 387.076 308.366 397.955]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-1866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 377.024 513.996 386]
-/A << /S /GoTo /D (subsection.10.63) >>
->> endobj
-1867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 352.736 312.705 363.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-1868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 342.684 513.996 351.66]
-/A << /S /GoTo /D (subsection.10.64) >>
->> endobj
-1869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 318.396 288.421 329.275]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-1870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 308.344 513.996 317.32]
-/A << /S /GoTo /D (subsection.10.65) >>
->> endobj
-1871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 284.056 513.996 294.935]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-1891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 272.843 179.349 282.98]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-1872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 262.048 513.996 271.025]
-/A << /S /GoTo /D (subsection.10.66) >>
->> endobj
-1873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 237.761 303.176 248.64]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-1874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 227.708 513.996 236.685]
-/A << /S /GoTo /D (subsection.10.67) >>
->> endobj
-1875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 203.421 384.918 214.3]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) >>
->> endobj
-1876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 193.368 513.996 202.344]
-/A << /S /GoTo /D (subsection.10.68) >>
->> endobj
-1877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 169.08 338.419 179.96]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
->> endobj
-1878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 159.028 513.996 168.004]
-/A << /S /GoTo /D (subsection.10.69) >>
->> endobj
-1879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 134.74 329.582 145.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-1880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 124.688 513.996 133.664]
-/A << /S /GoTo /D (subsection.10.70) >>
->> endobj
-1881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 100.4 513.996 111.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-1892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 89.187 173.262 99.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-1882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.71) >>
->> endobj
-1885 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1889 0 obj <<
-/D [1887 0 R /XYZ 89 770.89 null]
->> endobj
-1886 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1943 0 obj <<
-/Length 1529      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~����d`fH��%tMR��:/����0h�����Jr���
��lٲ�4��'�I�|߹[

[o�M7�c(p�kM� [

waYm�
?M�Z��#����}�LJ����z7���
��Q�9�|+L?a+��FN�[���bԁ�ؚ
�
`}����|�Ͻ�,�
��A������"O�l<����ǥ�r1{���"���
ʕ���ٝ�6��f�|H|;�AY	uq�m?DF
i��E-ٻ
�N`V\���#ʱ}E��]DZ�AA�͞_k4��{Ǐ��Ʈ5Y�Ֆ�R���F 5��Q���;��ٽ�-*825��EX���З�'��8"����
ֺ�����
-Y
�}��MֱLdZ��^��]n�2\F٢b6�4Z��ٵZ��C)�'�
�ˈY0]* �eG]�q�XЏ7ǥ�6�i�z��cQ��~H���-%�<hY�H	��V���z�ê\��\F�!=^��O��p����7
߯�N��(�YC��cv.Ve�e�
�ܞ��P9��ey�RmGy$��Ћ��R�&��
��Y>N!�\
-��P8�
Ϯd�*��ه,���Z��M/���[���
X���@��~"�95Z�����b-B��hEo��`��l��`��e&p4�M,Y�P�ݦ�\H�T�`��ȥ���M�C
ؖlU���]�p'p ��u�
T&������P����^�A
���;�)�$
^[�����2�!| ��k @p&e��W�
e��T[
d]�
C�Ih�`1�\O���^�
r
�'������
-V曰��nE)@kEi��y3
�7�(
�s��:���U��?S�f�g����d\G��մIi��V��e� e�
-	k��ڥ�Wi�Z��p�S6
���	>�
-8o�g!S��R�9>�.`Cϫ8;72�h���B�ΧA�
��[(q��Qr���n��~�
���
�t|��K#.�{�K���YQ5�w��xב�RG/`6g�y����c��m�ޔ�s\��U�#�8���m�����fHӐ
>O��R���C!;ʫ�_�r�n�gt���P@��ѝ�GWG�O{FS�#�
�ު8�t��*q"Y�e8M+d���O/���O4��b5��<�����H��3ID�<I(	� �PC���Qtְ<�;��;~
�3�$��8e�g&ߝ]3Mq�D]�\���ܺϪ"R�t}�X��kY�
�1,�Q@&�+
z.r�=�<���2�3S� ���`�`
�
�q��0
 xs�<��jΚޖ�;�qz�Fu0���a+���%U4�]��Y
7�4&&��Rn�Y�
a��5T��e(��Yp
�Ӝ�4F��
�
-�{���ʰ�wOM���%��ȩz�;�Q���bq�ԤN߿Xv6B8�����e 2�<Z��}�_�=z��6q��
�
7��F��g\lAz�B�Xi�O��k��c�T�OC�m���"݈x���Ze��d6�� \���p� ���K�������� ��}8C|kx˲\_^\�7�B�
fɞ�������P�71&�ri����_�=Q�  �?��Z
-endstream
-endobj
-1942 0 obj <<
-/Type /Page
-/Contents 1943 0 R
-/Resources 1941 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1672 0 R
-/Annots [ 1883 0 R 1884 0 R 1904 0 R 1905 0 R 1906 0 R 1907 0 R 1908 0 R 1909 0 R 1910 0 R 1911 0 R 1912 0 R 1913 0 R 1914 0 R 1915 0 R 1916 0 R 1917 0 R 1918 0 R 1919 0 R 1920 0 R 1921 0 R 1922 0 R 1923 0 R 1924 0 R 1925 0 R 1926 0 R 1927 0 R 1928 0 R 1929 0 R 1930 0 R 1931 0 R 1932 0 R 1945 0 R 1933 0 R 1934 0 R 1935 0 R 1936 0 R 1937 0 R 1940 0 R ]
->> endobj
-1883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 407.868 718.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-1884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.72) >>
->> endobj
-1904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 672.345 490.068 683.224]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
->> endobj
-1905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 662.293 513.996 671.269]
-/A << /S /GoTo /D (subsection.10.73) >>
->> endobj
-1906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 636.598 454.173 647.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List) >>
->> endobj
-1907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 626.546 513.996 635.522]
-/A << /S /GoTo /D (subsection.10.74) >>
->> endobj
-1908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 600.852 311.853 611.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-1909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 590.8 513.996 599.776]
-/A << /S /GoTo /D (subsection.10.75) >>
->> endobj
-1910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 565.105 285.103 575.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-1911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 555.053 513.996 564.029]
-/A << /S /GoTo /D (subsection.10.76) >>
->> endobj
-1912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 529.359 311.315 540.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-1913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 519.307 513.996 528.283]
-/A << /S /GoTo /D (subsection.10.77) >>
->> endobj
-1914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 493.612 294.877 504.491]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-1915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 483.56 513.996 492.536]
-/A << /S /GoTo /D (subsection.10.78) >>
->> endobj
-1916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 457.866 350.643 468.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-1917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 447.813 513.996 456.79]
-/A << /S /GoTo /D (subsection.10.79) >>
->> endobj
-1918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 422.119 310 432.998]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-1919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 412.067 513.996 421.043]
-/A << /S /GoTo /D (subsection.10.80) >>
->> endobj
-1920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 386.373 310 397.252]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-1921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 376.32 513.996 385.297]
-/A << /S /GoTo /D (subsection.10.81) >>
->> endobj
-1922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 350.626 276.615 361.505]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-1923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 340.574 513.996 349.55]
-/A << /S /GoTo /D (subsection.10.82) >>
->> endobj
-1924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 314.88 293.826 325.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-1925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 304.827 513.996 313.804]
-/A << /S /GoTo /D (subsection.10.83) >>
->> endobj
-1926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 279.133 289.158 290.012]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-1927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 269.081 513.996 278.057]
-/A << /S /GoTo /D (subsection.10.84) >>
->> endobj
-1928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 243.387 402.896 254.266]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) >>
->> endobj
-1929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 233.334 513.996 242.31]
-/A << /S /GoTo /D (subsection.10.85) >>
->> endobj
-1930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 207.64 354.478 218.519]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction) >>
->> endobj
-1931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 197.588 513.996 206.564]
-/A << /S /GoTo /D (subsection.10.86) >>
->> endobj
-1932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 171.893 513.996 182.773]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-1945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 161.571 127.862 169.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-1933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 149.886 513.996 158.862]
-/A << /S /GoTo /D (subsection.10.87) >>
->> endobj
-1934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 124.192 358.443 135.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Threshold__Watcher) >>
->> endobj
-1935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 114.139 513.996 123.116]
-/A << /S /GoTo /D (subsection.10.88) >>
->> endobj
-1936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 88.445 273.945 99.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
->> endobj
-1937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.89) >>
->> endobj
-1940 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1944 0 obj <<
-/D [1942 0 R /XYZ 89 770.89 null]
->> endobj
-1941 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1985 0 obj <<
-/Length 1481      
-/Filter /FlateDecode
->>
-stream
-x��X[s�8~ϯ��@T],_2;;��-Ѕ�> �qm5�_�����=�$;q�4�v��؎�s��O�����_���щϬ�
���b�wC�=xJ��v�)���"Y-��YīL�MԤE��Om�;_��G����#��E�-��������J���F,
��vPf���ui}�3�ڭ�Wi��k��9N�����QΟ;�Q�E�s�b�X�,DRE�������4+���e2���
5�")���!��f����b��k�a��s5�s�L���Z�^:��E�
*iH��R�ti>Wo�<Q7Y���j��ʢN�TFp%4���K�FT��hYk7�PY��sH��F$w�
A�`)�Q���e��U� ��������|�@*�e*4PM������c�l��?
Եd�nX�O�B~,��"˔wG'@؞ɔ��eU�v�PCdG�5�NHab9�\4[
29�3��܈v`xL=1�u�tx�b?�~����}R�����v�@��m*�K��BǪ�:�(�C�.�~I [...]
y���ܽ<&��;f���NMm6u|׾)�3g�2l�����爄�&����,�V���A;r[F�"U��
����`�Lv���W��?02�?�
��j3w��}�$�I-��"P����-?D��\&�1�aA��^W����[���1�|�!�孼Hr���	��QբC8�5f!���4��N��@��5AI;n�C
W��6~��|��U��6D�z��t/�fJ��k�%m��%za�.���2�fC��蜐:ަN?�ܩG�@mO/W�U�4"7LSW�)wo#��4���P9�6�D۪�4
DL<� ¦(��/��ac�on
��/]��-��]�0�U12+ 7�C�fM��R`4G������U���b���_�[7��e�A�|�_ܿ`L����,LN����Ǜq�C�QP��to|耽u:^Şt��
�>�ɪ��&Ꭵ�zt�))w�}r![׹�P�@�tK-="q�Z��c!2���/�J<�e/�^[����4��`ND[d���j�&��[(j�t1�
� [...]
�,
͈�-F at M�
��;P
�#��l�z����}�B�f�v|se*4.ĥ�������o��ㅈ���d�v�](9;��~���v[��So�����
��̿_z`>��J�k%_�R�9�+6�f��S�[�z L��;�)L���,e(7.J�cQ�"��C�E��N �
L�>�a0"]3�]��C;�&�W�k_0�W2zQ�K-A�'�3��a��r��e����e��
-�.���EӔ����ռ�
�Ev��kq����m����
��v
�D����1A
�4 �w�V��>mG�߷/͇���ӌY/
 �?y�4�E
-endstream
-endobj
-1984 0 obj <<
-/Type /Page
-/Contents 1985 0 R
-/Resources 1983 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1991 0 R
-/Annots [ 1938 0 R 1939 0 R 1960 0 R 1961 0 R 1962 0 R 1963 0 R 1964 0 R 1965 0 R 1966 0 R 1987 0 R 1967 0 R 1968 0 R 1969 0 R 1970 0 R 1971 0 R 1972 0 R 1973 0 R 1974 0 R 1975 0 R 1976 0 R 1977 0 R 1978 0 R 1979 0 R 1980 0 R 1982 0 R ]
->> endobj
-1938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 374.109 718.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
->> endobj
-1939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.90) >>
->> endobj
-1960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 674.144 299.669 685.023]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator) >>
->> endobj
-1961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 664.092 513.996 673.068]
-/A << /S /GoTo /D (subsection.10.91) >>
->> endobj
-1962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 640.197 392.177 651.076]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common) >>
->> endobj
-1963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 630.145 513.996 639.121]
-/A << /S /GoTo /D (subsection.10.92) >>
->> endobj
-1964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 606.25 263.893 617.129]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-1965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 596.198 513.996 605.174]
-/A << /S /GoTo /D (subsection.10.93) >>
->> endobj
-1966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 572.303 513.996 583.182]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-1987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 561.09 173.262 571.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-1967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.279 548.392 199.435 559.271]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-1968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 550.295 513.996 559.271]
-/A << /S /GoTo /D (subsection.10.94) >>
->> endobj
-1969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 526.4 286.03 537.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-1970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 516.348 513.996 525.324]
-/A << /S /GoTo /D (subsection.10.95) >>
->> endobj
-1971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 492.453 270.807 503.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog) >>
->> endobj
-1972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 482.401 513.996 491.377]
-/A << /S /GoTo /D (subsection.10.96) >>
->> endobj
-1973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.107 330.916 327.956 341.82]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators) >>
->> endobj
-1974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.107 302.723 173.725 313.627]
-/A << /S /GoTo /D (namespacestd) >>
->> endobj
-1975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 232.222 282.038 243.126]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-1976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 204.029 326.869 214.933]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare) >>
->> endobj
-1977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 175.837 291.652 186.741]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
->> endobj
-1978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 147.644 309.565 158.548]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-1979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 119.452 328.39 130.356]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-1980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.259 377.356 102.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-1982 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1986 0 obj <<
-/D [1984 0 R /XYZ 89 770.89 null]
->> endobj
-110 0 obj <<
-/D [1984 0 R /XYZ 90 465.469 null]
->> endobj
-1988 0 obj <<
-/D [1984 0 R /XYZ 90 433.246 null]
->> endobj
-114 0 obj <<
-/D [1984 0 R /XYZ 90 433.246 null]
->> endobj
-1989 0 obj <<
-/D [1984 0 R /XYZ 90 348.061 null]
->> endobj
-1990 0 obj <<
-/D [1984 0 R /XYZ 90 251.279 null]
->> endobj
-1983 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2025 0 obj <<
-/Length 1158      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�o���&%Q/�0`i� m�z��/i!�2��%����ߏ/�l%.�fr�}2}<
>�;
IR����x6��.�`�;>�-A�@�E����\[�o���B
�b�����qv�qv%�F'����.�
O`�d5����B���(ߕ�
-x�+~sp5�c�(h��v a�C�
A�1�X��8DMn���1A�JrZUM�����g��dMmL,�W4����
[p_dsN����yQ3~g;B#�f&�b�
(���~�*��BǍ��q�)²�덭�?/��
ӾL̸�:�{�;9�\���'��
ǁ
!`�	D��&~�ӥ6F+ϒ@Q�M�%��(��-H�b�Fm]VU67]�v�U�0S���e�,���G|p��
�ͅ�9���
-Fy|r��beYY�
�-Ч$�ʮn3�A��@"'��ߖ��DT|�C,�vC�n
���	Z9!�OP�
��3��0�cB��rn��6^$�
nd<m����
�]�x���&*F�R����i�K�v����
+v��J���B縼߷��P������3
-�?�Y� 
-×ms��`�
�n��gnjYU�K�����n
֌�MjZ���>�6��WU�V=9b���0\�)�Rh�|�����XA�����U4�!3��Q��T�vg��r�d�Wq�f�jP�%��h�����9R
���,�u����&�J2g�wƊQ������b���݀J+SU
>��^�{�5�J�����}CgP��qȁ��C��a%3)ꑼ9���1%8�\����������GDJ�����|Oy9�{�S�ٽ)�啚$B;HC�WD�>
-�ֲ��/��6'�UV�
s�SB
Pf뜟_!ӷ����^�f�����,��]|uC�l��6� 	�@��
-
/=
�d?�sy
mr�-m
ZK����~�
��5��o�C��^��g�h��
��OIMӲ��������_�����OF� ��\�˽��%B����E��^{�,y�=��|[r����
�H"��w;BbuA��ݶ�4c��|�w�0�57��[��o�#1��got���tz�_*����M�uI���)��d��-h1D�Oh�]��37��_-��)���!"��D�M]��&��&�X�¤\=u���(�hImQ�*93�&B�R�����7IDZ�
-endstream
-endobj
-2024 0 obj <<
-/Type /Page
-/Contents 2025 0 R
-/Resources 2023 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1991 0 R
-/Annots [ 1981 0 R 1998 0 R 1999 0 R 2000 0 R 2001 0 R 2002 0 R 2003 0 R 2004 0 R 2005 0 R 2006 0 R 2007 0 R 2008 0 R 2009 0 R 2010 0 R 2011 0 R 2012 0 R 2013 0 R 2014 0 R 2015 0 R 2016 0 R 2017 0 R 2018 0 R 2019 0 R 2022 0 R ]
->> endobj
-1981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 707.957 360.28 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-1998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 679.922 324.1 690.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-1999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 651.887 290.357 662.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-2000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 623.851 288.673 634.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-2001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 595.816 311.916 606.72]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-2002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 567.781 296.982 578.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-2003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 539.745 302.527 550.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-2004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 511.71 324.677 522.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-2005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 483.675 384.442 494.579]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-2006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 455.639 331.303 466.543]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-2007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 427.604 391.626 438.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-2008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 399.569 327.447 410.473]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-2009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 371.534 322.994 382.438]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-2010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 343.498 382.759 354.402]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-2011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 315.463 327.437 326.367]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-2012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 287.428 294.78 298.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-2013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 259.392 305.301 270.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-2014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 231.357 346.237 242.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-2015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 203.322 267.104 214.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-2016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 175.287 318.577 186.191]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-2017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 147.251 306.407 158.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 119.216 345.685 130.12]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-2019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.181 301.983 102.085]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-2022 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2026 0 obj <<
-/D [2024 0 R /XYZ 89 770.89 null]
->> endobj
-2023 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2052 0 obj <<
-/Length 1559      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�Ԥ�q! ��LcG��ɨ�ۇ:
,�����
�})K���mE
? I����.L�
<�k��h
��R!
��kOaO
-�z}�җ�4[c��z�lQ��S�
&z`\�CR��Z�lW
-&�P4�^|l��h|kx
����#!�ިq�{}��aĔ�n˛F^@���y�� �Y�!�Jp�&=A"ā�B)/_^?�]�8@��:ϫ
N6�p����et���:�n'����it������7���Ŭ{l�"��1���̽g�����'kX���0�^�H�
-�Ű"��&� �7&k{�&��Iz�ŹW�C�i�E=���ڷQ�$Q2p�t
�څ�!�Gs�(mMqR�)����B=��O�& {j*��R�.��O������Y̋\�(����x:
,=2T֛�E�0=��:�⻊�8�MA�&��w76��4����t>���{f��^9������P"!LZ��ݲ�e������|B�L��������0-�b,X
�Q^k`�pt;��C܀��
1�t��ˡ�)�i����h�Y�sn���tt at j
�I^d ��Wk� 
��)��p�4ud�t���u���u�*��:l����J+����H;e��e=��&7�
l����
-Q�@\�b����#Wt��Ք=^�g�?�+e%
-j:z ��0�UO"�H�8|��.���;'��ly��b$��i��gK�

-���lD�J�q��1�w��Pz]�y������������&EIU�����m숝�KG"`;J�!�V��������tlˮr�94:�S��6�1En-G-:����6p�Q5gT
]K���
C�@o.Q�c�����
7	��	�}U�r�뼞�֡Ii?Ѝ��İl��B��mg(�u����M��[���LJJ���/�D��n�DD 
�������Ǿ_W���l����ҹi��Rrc�
ѕt׈C-)��T��}"�	D����i
�j�/(3����y�mǩ.�d΂��>��8 

1���!Oukw��A���
w/��wcq�!p�m�o��@�ˡ#�
щ�3�K[z�T�ۙ,�U�
��Z5'��u�b0t-C.
�,�MM�#78� ��NQ�� d������
��^J�/E+J^�����:��Ul��V�@�u��'�VJH���K�r��k�Q�!Z#l�a�d�u�k��M"5U�D�I���@��4�tM-][��Mf��*]!��PZ%!m�k�`�7�k&��ܲsx-�a�&r^Õ�3��1#!�d3�-aDZ�J9��j;D�)Q���4��h
G=mSɭ���0\���m�a�]�N�|^�5�
�k����J��>O�
��O"+�M�o���S����Q��0~9J
���75!(
-Qi�oj�oh� S��(�Eᴬ�;7�/M������N&�*ɿ`�o,�P�N�q�	��
��:1q����֟��#>�&��â�>:��
r�
P/
�h�3�P
Y?;=�
���+������5�
6�0�5@�������7�./�VGF�;I���ϖ�EgT
-endstream
-endobj
-2051 0 obj <<
-/Type /Page
-/Contents 2052 0 R
-/Resources 2050 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1991 0 R
-/Annots [ 2020 0 R 2021 0 R 2027 0 R 2028 0 R 2029 0 R 2030 0 R 2031 0 R 2032 0 R 2033 0 R 2034 0 R 2035 0 R 2036 0 R 2037 0 R 2038 0 R 2039 0 R 2040 0 R 2054 0 R 2041 0 R 2055 0 R 2042 0 R 2056 0 R 2043 0 R 2044 0 R 2057 0 R 2045 0 R 2058 0 R 2046 0 R 2059 0 R 2047 0 R 2060 0 R 2049 0 R ]
->> endobj
-2020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 707.957 331.861 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-2021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 680.368 312.483 691.272]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-2027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 652.779 313.589 663.683]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-2028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.544 638.312 273.474 648.217]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-2029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 625.191 320.793 636.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-2030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 597.602 371.159 608.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction) >>
->> endobj
-2031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 570.013 389.978 580.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction) >>
->> endobj
-2032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 542.424 396.603 553.328]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction) >>
->> endobj
-2033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 514.835 416.529 525.739]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) >>
->> endobj
-2034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 487.246 356.763 498.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
->> endobj
-2035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 459.657 419.706 470.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-2036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 432.069 341.819 442.973]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-2037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 406.642 160.373 416.547]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-2038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 393.521 312.788 404.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-2039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 365.932 365.938 376.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-2040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.569 338.343 513.996 349.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-2054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 328.155 123.652 335.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-2041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.17 298.799 513.996 309.703]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-2055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 288.611 123.652 296.364]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-2042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.17 259.255 513.996 270.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-2056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 249.067 123.652 256.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-2043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.845 232.832 197.225 242.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-2044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.397 219.711 513.996 230.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-2057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 209.523 123.652 217.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-2045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.78 180.167 513.996 191.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-2058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 169.979 154.775 178.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-2046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.459 140.623 513.996 151.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-2059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 129.644 165.295 139.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-2047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.17 101.079 513.996 111.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-2060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 90.891 123.652 98.644]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-2049 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2053 0 obj <<
-/D [2051 0 R /XYZ 89 770.89 null]
->> endobj
-2050 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2108 0 obj <<
-/Length 1469      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�8~��`��gj"�����8	θu�k�t�m������N7����GH�KHb
�;}AI�>}G:�A�[r��j�ۍ�n[�
��$������b�os����/�[N�tA44h�}�X�i�cR�0�Ʒ�E�i{Uh��,h|���9|~�!A6t�{V)�I���ƍ�
Ĩ�mJڢ$"MPd�k�� ���gIR���fܧ��?��$a�N�d�FY�@��)���3���[<�]��Mc7��f�ZE��b��Gn�K�䅩c���q�xQH�Ϻ�cCP2� �F.�o���
AS��Bw����wM	������¯�-	I��K8F�1-�%""q-�PU
-���
��Yא9
 4%�TD0{
R]�)@zW�l���!����KB�r]�ې0'�W�RSn�T)a�ў -I�$i�����H�R&OX��*N�,q\E���R�p��9��Q{Yɕ��3�%.KA�IJ���-�hҌ��x�3!a��$�h��)�!�`�0���,C����2�Ȉ]Զ�=~���I!~�&þsc�ƽ��\w�F�X����ǭ��ٹl��g�l����Ş�@�fj���hҳ�5A�5��5�ŸS��y�#���B�Yw^��B��M�su
���ԥ�B�g�@��ը"��Q���@y	-������mm at E�'C�y�O�Q���M0k�s�'
-�Skb?Z8ۇ�c��VvnA0T�$��m�&����
�JЫc��v�$��My�����!S���b7�
Y�xQ��R\60�v���s��Cp����sk�\�N t���,��}1���!	�ka�d��X�q�3�^M
D�Cq^��~bU)�ͨs�� ��SiL�����v{=��
���|�� C�@=&qt5I��^~J-���L��

:��
�Şk���k�ɑ
�
�m~
��
X
-u;
[�
�1���O˼�ߏ�ꂢ�1ۓ]�8���������-@��o��n
�tҷ+t��7���x9� �-�QY֟��W�3��+��0�U�_U��8�t���N�����1K�ݝv�x2�Yl��'c2��ի���)�!�<���=�E2�R��S4��<N�C�wGœ�cu�����=r&ֻz�e����

�E-_�]�!���e��x�!�d
U���Oz�
\�+}:����'����TC5���G6l�W��
�|�0l;���{Q��p0>�n��kb����
C`�9p�Ȍ��!?ʮ�/�$�~~�_��(����e�}B�Ϛ�f?�Y���^z�4�F ��:��!����&	mI>��h���T#�w���m)+��g�y����e`��6���Ԗt�((v�:���hh���W�
��w��<���TtG����W�( �.
-͖
Z�q
ZS^_
��Ƚ���GUU-��n�t���l�^B<�@��a�W[��q ��Eļ�n�ʌ�/��
G
-endstream
-endobj
-2107 0 obj <<
-/Type /Page
-/Contents 2108 0 R
-/Resources 2106 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1991 0 R
-/Annots [ 2048 0 R 2110 0 R 2061 0 R 2062 0 R 2063 0 R 2064 0 R 2065 0 R 2066 0 R 2067 0 R 2068 0 R 2069 0 R 2070 0 R 2071 0 R 2072 0 R 2073 0 R 2115 0 R 2074 0 R 2075 0 R 2076 0 R 2077 0 R 2116 0 R 2078 0 R 2079 0 R 2080 0 R 2081 0 R 2117 0 R 2082 0 R 2083 0 R 2084 0 R 2118 0 R 2085 0 R 2086 0 R 2119 0 R 2087 0 R 2088 0 R 2089 0 R 2120 0 R 2090 0 R 2091 0 R 2092 0 R 2093 0 R 2121 0 R 2094 0 R 2095 0 R 2096 0 R 2122 0 R 2097 0 R 2098 0 R 2123 0 R 2105 0 R ]
->> endobj
-2048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.17 707.957 513.996 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-2110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 697.769 123.652 705.522]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-2061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 668.278 303.478 679.182]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-2062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 599.699 251.782 609.626]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gae19dfe022c51c874d905e2a7c81c18f1) >>
->> endobj
-2063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 571.975 251.225 581.902]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga8458e58a5e857de11c35ce3076a70ab8) >>
->> endobj
-2064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 544.25 264.505 554.178]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gabadfeba0a415d210cdd6d7309365e800) >>
->> endobj
-2065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 516.526 244.032 526.454]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7a529f51bfebdd4b3e69c866dced9bc1) >>
->> endobj
-2066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 477.843 213.038 487.771]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga79bd3696a302bb721ef8168fa5d650fb) >>
->> endobj
-2067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 407.312 348.737 418.215]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-2068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 379.587 360.902 390.491]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-2069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.455 351.863 421.554 362.767]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-2070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 282.308 277.077 293.212]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 270.353 272.923 281.257]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a3d884f787b884a260970cdef004fcc10) >>
->> endobj
-2072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.314 270.353 413.843 281.257]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a9f5dce9506b72773425c0504845d8e4e) >>
->> endobj
-2073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.234 270.353 513.996 281.257]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) >>
->> endobj
-2115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 258.397 145.791 269.301]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) >>
->> endobj
-2074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.779 258.397 287.309 269.301]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3) >>
->> endobj
-2075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 246.442 252.44 257.346]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ad5e386c6a05c9656eac42fe9e2cdd8b5) >>
->> endobj
-2076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.31 246.442 393.734 257.346]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b) >>
->> endobj
-2077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.604 246.442 513.996 257.346]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) >>
->> endobj
-2116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 234.487 141.357 245.391]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) >>
->> endobj
-2078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.346 234.487 288.963 245.391]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) >>
->> endobj
-2079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 222.532 294.502 233.436]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8adeb9e65ceecfb8271acec22e00a226ca) >>
->> endobj
-2080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.893 222.532 455.347 233.436]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4194f750c76fb24d6e5930e1696076c4) >>
->> endobj
-2081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.738 222.532 513.996 233.436]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) >>
->> endobj
-2117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 210.577 205.008 221.481]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) >>
->> endobj
-2082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.997 210.577 422.899 221.481]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) >>
->> endobj
-2083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 198.622 337.66 209.526]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) >>
->> endobj
-2084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.608 198.622 513.996 209.526]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) >>
->> endobj
-2118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 186.666 169.581 197.57]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) >>
->> endobj
-2085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.992 186.666 388 197.57]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a02347568b111860e1ac15154a1832252) >>
->> endobj
-2086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.411 186.666 513.996 197.57]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) >>
->> endobj
-2119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 175.429 142.463 185.615]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) >>
->> endobj
-2087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 162.756 308.898 173.66]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae0c660bfcbcd3d10c3e764e22f41d0a1) >>
->> endobj
-2088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.289 162.756 485.235 173.66]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a057025d0ff550a2226a0a1273c84b4f6) >>
->> endobj
-2089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.626 162.756 513.996 173.66]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) >>
->> endobj
-2120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 150.801 277.496 161.705]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) >>
->> endobj
-2090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.484 150.801 465.499 161.705]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a5912e00d1de38a643d48af1f0e5dd35f) >>
->> endobj
-2091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 138.846 283.433 149.75]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) >>
->> endobj
-2092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.824 138.846 485.235 149.75]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a930a62d56d7231cdb1ed57e1d3eff0f7) >>
->> endobj
-2093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.626 138.846 513.996 149.75]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6) >>
->> endobj
-2121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 126.891 275.294 137.795]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6) >>
->> endobj
-2094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.283 126.891 457.768 137.795]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab) >>
->> endobj
-2095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 114.935 290.078 125.839]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a261922c7bb53bf71459671df868e55da) >>
->> endobj
-2096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.469 114.935 513.996 125.839]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) >>
->> endobj
-2122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.98 156.859 113.884]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) >>
->> endobj
-2097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.25 102.98 420.638 113.884]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a202263943c451b9fdfe003b2bc8d0b1f) >>
->> endobj
-2098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.029 102.98 513.996 113.884]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
->> endobj
-2123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.399 229.924 101.929]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
->> endobj
-2105 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2109 0 obj <<
-/D [2107 0 R /XYZ 89 770.89 null]
->> endobj
-2111 0 obj <<
-/D [2107 0 R /XYZ 90 617.631 null]
->> endobj
-2112 0 obj <<
-/D [2107 0 R /XYZ 90 532.724 null]
->> endobj
-2113 0 obj <<
-/D [2107 0 R /XYZ 90 424.222 null]
->> endobj
-2114 0 obj <<
-/D [2107 0 R /XYZ 90 301.216 null]
->> endobj
-2106 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2212 0 obj <<
-/Length 1633      
-/Filter /FlateDecode
->>
-stream
-x��Z[w�H~�W�zf$�
|33�(8������A�v2��fs��o5
j��0g�	l��ꪯ��.ǍA�e�ܩ�u��XM�eƹf4�(��J2��2��*�5�
B�~��]��K����қa��
]{�SU�.k��ǚ��~�8Ђ�J�XEe&�ڷ����G���2��#�\�]�\C��h�Pm�!��Q8��8j�w��R��k̷���`��Ɖ5�,3k�� �48��E
�
��<�<��#/zh���2������Ѷx���!�*+��
5I�&>���
�c]�[j����i�%RG��2��
��dEۊ�K�����L
R٦带�w�N!��p
lgh\8�P�
�2�i���`~=�j�]�e1E��r�_M�jR��
N4��)�<I�0���u�/�N�	�=	���K��O�oeG��YY�A1��2�q_
L��p�#/��>�

$ۊ���ZF��>��ע�bwOF�S����J����Yt��,�!������(54�X��	
�$tS�	�zZV����������y���� ��
���:�fy�GH1�d
ݢK8��ˡ�v�a�Ua�\�k�״�e"�'4}�P��2���X�!I3&Nq�f<�s��k� �\���<�s/�w�B
K�X����7ڽ�|wa�=����p��
�H��D��k��������u+
���x���r6'$n��xX<Be�m�/��)�C�U�
!J�bꘂ�a}�(�v1�%�eV�l���LaU�W�v*�q���6n���,��oG�<qNJE<u�!�Y��U<�b����4�9��{n8��	/�_ ���y�
R=_%2S��x�햺�W+屫�$�٪=�X�Oе*E��G{3�;��<�C|��c�Ǖ
<R
9��p��9�����پ��M�J$�JO�ko���Q��������#$�
^��o[@�?�P�Ʋ���YW�հ=��,�V�GfG�������J%Tx�m�=�R����g �7ޝ��@���uJRj�:���V�v����#
ڻ]�*�0A�SNڦ��>L �I���Z���t����Z�`���
-<��Ϧd�6���s?�^D'ӊ>W��x���,B��J����1�?�$�s��R?X�Zު��ROz8����O����l@�<�Z@��|��S�´��d��ڹ�{�ҵ;!��
���n��
anR�ZU
Q���$�ڽn���˵
�W����su
kt^H�Ѱ�?�ڝ�������pW���f��=jC�y��a�//+v���r^�Y[��Ǫ�	���?��>+ϒ0���TƔ�R�YҫG�vc���}����
����q���JFfWo�2d�{mQ�
-�\�J at X�t&�B?��
6��(�	lCx� ��uyCv%n�Z�����
W�
-"A����bcD�s�"�
q��0^���9���Q��c��
-���
-
������̳
-/��#�����@�����!�Y%ɠGoF1�~#�������7���t̎���ḏ��UiQf㼻J����w�ȇҦ7%��$

���$�m��l��A};c���y���E�����;�S���^v����%ı��� g��!q�§36�Ӈ�������N^��/�N��
-endstream
-endobj
-2211 0 obj <<
-/Type /Page
-/Contents 2212 0 R
-/Resources 2210 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1991 0 R
-/Annots [ 2099 0 R 2100 0 R 2101 0 R 2102 0 R 2214 0 R 2103 0 R 2104 0 R 2160 0 R 2161 0 R 2162 0 R 2215 0 R 2163 0 R 2164 0 R 2165 0 R 2166 0 R 2216 0 R 2167 0 R 2168 0 R 2169 0 R 2170 0 R 2171 0 R 2217 0 R 2172 0 R 2173 0 R 2218 0 R 2174 0 R 2175 0 R 2219 0 R 2176 0 R 2177 0 R 2178 0 R 2179 0 R 2180 0 R 2220 0 R 2181 0 R 2182 0 R 2183 0 R 2184 0 R 2221 0 R 2185 0 R 2186 0 R 2187 0 R 2222 0 R 2188 0 R 2189 0 R 2223 0 R 2190 0 R 2191 0 R 2192 0 R 2224 0 R 2193 0 R 2194 0 R 2195 0 R 2196  [...]
->> endobj
-2099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 707.957 309.177 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 696.002 298.367 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2abeee33de6f8542b0228161d044640eaa) >>
->> endobj
-2101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.758 696.002 466.964 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) >>
->> endobj
-2102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [469.355 696.002 513.996 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) >>
->> endobj
-2214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 684.047 234.328 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) >>
->> endobj
-2103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.807 684.047 458.575 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aeafcc7ca16bda73dc6b0f7deaf9470dd) >>
->> endobj
-2104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 672.092 356.489 682.996]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2ae0c0414fd69996a2edb8ea476ab236e1) >>
->> endobj
-2160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.94 644.182 334.411 655.086]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-2161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.987 644.182 503.317 655.086]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-2162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [505.708 644.182 513.996 655.086]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-2215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 632.227 235.444 643.131]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-2163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 604.318 321.36 615.222]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-2164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 592.363 260.739 603.267]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) >>
->> endobj
-2165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.883 592.363 433.858 603.267]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea556cc08f48e769b9c15bea83d5d883a1) >>
->> endobj
-2166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.002 592.363 513.996 603.267]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416) >>
->> endobj
-2216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 580.408 237.107 591.312]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416) >>
->> endobj
-2167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.096 580.408 431.756 591.312]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea94cf20719046117aece5acba61dcae4d) >>
->> endobj
-2168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 568.453 330.477 579.356]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab) >>
->> endobj
-2169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.953 568.453 506.236 579.356]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea8191bdbdcd041a9859ed465d16062ab1) >>
->> endobj
-2170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.169 528.588 324.718 539.492]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-2171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.751 528.588 513.996 539.492]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-2217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 516.633 185.083 527.537]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-2172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.474 516.633 412.349 527.537]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1ab39e3c667ce455313f8ff578722af2e9) >>
->> endobj
-2173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.74 516.633 513.996 527.537]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-2218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 505.051 212.201 515.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-2174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.495 476.769 332.376 487.673]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-2175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.06 476.769 513.996 487.673]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) >>
->> endobj
-2219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 464.813 130.289 475.717]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) >>
->> endobj
-2176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.278 464.813 322.158 475.717]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
->> endobj
-2177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 436.904 374.78 447.808]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-2178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 424.949 258.537 435.853]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) >>
->> endobj
-2179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.047 424.949 410.655 435.853]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdac58a6ff6765224e937fefbadf45a4860) >>
->> endobj
-2180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [413.166 424.949 513.996 435.853]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) >>
->> endobj
-2220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 412.994 157.975 423.898]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) >>
->> endobj
-2181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.963 412.994 310.571 423.898]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559) >>
->> endobj
-2182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 401.039 268.499 411.943]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda9a59b7fa00c2cf8df942badc9c414aef) >>
->> endobj
-2183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.94 373.129 409.44 384.033]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-2184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.015 373.129 513.996 384.033]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) >>
->> endobj
-2221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 361.174 172.351 372.078]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) >>
->> endobj
-2185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.34 361.174 408.513 372.078]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaf4462ec77078de4bbabb446cf61e5123) >>
->> endobj
-2186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.315 333.265 388.279 344.169]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-2187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.604 333.265 513.996 344.169]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) >>
->> endobj
-2222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 321.31 210.547 332.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) >>
->> endobj
-2188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.938 321.31 443.333 332.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7869fdfe9b1ace668a0a7b1d2faba812) >>
->> endobj
-2189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.724 321.31 513.996 332.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
->> endobj
-2223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 309.355 274.746 320.259]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
->> endobj
-2190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.94 281.446 310.78 292.349]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-2191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.355 281.446 462.53 292.349]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13a39adc66b0a3d8cae2a7dc2abc8885c69) >>
->> endobj
-2192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.921 281.446 513.996 292.349]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-2224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 269.49 192.844 280.394]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-2193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 230.622 344.464 241.526]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
->> endobj
-2194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 218.667 294.502 229.571]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) >>
->> endobj
-2195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.893 218.667 486.889 229.571]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d) >>
->> endobj
-2196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.28 218.667 513.996 229.571]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) >>
->> endobj
-2225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 206.712 283.583 217.616]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) >>
->> endobj
-2197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.572 206.712 469.923 217.616]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) >>
->> endobj
-2198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 194.757 359.239 205.661]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fab25413bda9bbd45d2f22366d0e0ef831) >>
->> endobj
-2199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.63 194.757 513.996 205.661]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) >>
->> endobj
-2226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 182.802 135.27 193.706]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) >>
->> endobj
-2200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.259 182.802 315.533 193.706]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa8d3ab7646117632841be76c043efc39b) >>
->> endobj
-2201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.853 154.892 334.408 165.796]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
->> endobj
-2202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.81 154.892 513.996 165.796]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) >>
->> endobj
-2227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 142.937 193.402 153.841]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) >>
->> endobj
-2203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.39 142.937 434.555 153.841]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a3b60d6dfe175b3a5d48361ac121f23ae) >>
->> endobj
-2204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.777 115.028 338.649 125.932]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) >>
->> endobj
-2205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.897 115.028 513.996 125.932]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) >>
->> endobj
-2228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 103.073 202.806 113.977]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) >>
->> endobj
-2206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.197 103.073 456.085 113.977]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) >>
->> endobj
-2207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.476 103.073 513.996 113.977]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05) >>
->> endobj
-2229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.118 284.708 102.022]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05) >>
->> endobj
-2209 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2213 0 obj <<
-/D [2211 0 R /XYZ 89 770.89 null]
->> endobj
-2210 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2314 0 obj <<
-/Length 1649      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�8~���SW*��D
�b�m�=�fw6-�f���H���C��N{Sd�'�<�s|����s
[��ǃ�~�Z�|�[�3+�V�E���kf��
~��\?D$�a�}��p�w8>�s����������PZ�lp�	[3~ca�F��M-�,���έ��_lX��2ٕ�a
h�#�9�{�vR��d�s^)N:Z�
���$��<7�
�"�
�����^��a��\T�С
��2Rfl'�9��G��["
�F�v>b��5��=��]s9����I�jz������Xq"�?�fI|�ϯ/��L�w�L��gϒI"f���\tUpQ���K����<+�� a�*h��ȵB���$����8���<��ZE�����G��6��R��)/�z(�|����{6^1��F�u\���3�1��;���kQ@,��7�>�K��g�TtSǼj��k�̛ݣĜr��/�:/��R�;?b�;9���S�.�]�"�ߌ�nR��x_s
H�Q�;� [...]
l^��V�\
"�l^�b��,M5*��6��H�kóq�"Rkh�p��"?b?d�c>W~}{��}J?Zņ���-<�:�3�v~�P�9�������n
�m�Q$�1��n�z��K\�
)b��)㣐�D]�w3��a�\L)72�y���	�

-w
�F�X��_��s�A����a�Ҭ	�P�;�o����.�?�.R1�ɨˊ�ݾ�t+wy�����p#C���}z�n���O��ot���|ҽXf�:
-~�x풧��x�
�v����/�ׯ�ﭡ��(��'��u�l����+>?�V��˩���B��d�YG���.�-��$���s�ߴbG,�`�)
���K�� !�:����iY2]�ԏ�o` ү��]F��uU���Ϝ����hⲥ��-S����[
$i�?�l�rP!�}*��
��k�*5�TІ�]*xb�
'�
������H�`O�<�K/j�`oS�u��u4@��e��w���
-�0�(��D��l��do��&>�.U�cM��	�c��»�M��w��,�Y��N���r�A�������aD�&���IM��xm�8�
-����g\��4�K3^_�3ݟ����D�j����p]B��F�_6������?Z��m�e��o� �wXz���eLW�)�,SU��{��O8�@�C�Cl/E/d���y
-����3�������'x��ڈ� -�xR%_
�:��g&P�q�
�au�F;�Z%�A�W\,*/7`�5��sHZ8�����z
z��:<
뒭�P϶b����Db��_X�.�<S]X�]T� ���@����8�n0�&4F���X���SP�����6zb���R/L����徚l�����̵^�@lA�z΂�*����NH��7k��[�st�Nw>T��mȘmJK�h���K�
��xa�
�q�tEm���ұ�V���-��<@_��梮�g�Ѥ9��8G�<��X���sg��L>�M�3���Q�e
-endstream
-endobj
-2313 0 obj <<
-/Type /Page
-/Contents 2314 0 R
-/Resources 2312 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1991 0 R
-/Annots [ 2208 0 R 2284 0 R 2285 0 R 2286 0 R 2287 0 R 2288 0 R 2289 0 R 2290 0 R 2291 0 R 2292 0 R 2293 0 R 2294 0 R 2295 0 R 2296 0 R 2297 0 R 2298 0 R 2299 0 R 2300 0 R 2301 0 R 2302 0 R 2303 0 R 2304 0 R 2305 0 R 2306 0 R 2307 0 R 2308 0 R 2311 0 R ]
->> endobj
-2208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.892 684.406 469.663 695.31]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga00a906832c41c42a70a5c9d194e07a7d) >>
->> endobj
-2284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.865 611.732 295.886 622.636]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e) >>
->> endobj
-2285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.865 597.836 290.903 609.791]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga266a81f442cf72bfded10a4ecb79f130) >>
->> endobj
-2286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.865 584.607 291.253 595.511]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) >>
->> endobj
-2287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.435 571.045 327.995 581.949]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) >>
->> endobj
-2288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.609 541.928 351.237 552.832]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gac40e401b77b5ec6e9625c317ce6d760d) >>
->> endobj
-2289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.865 512.811 336.841 523.715]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga13bf4cf2db045bfd362c5c8aae7f785b) >>
->> endobj
-2290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.965 455.691 327.986 466.595]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga984f2c32e934b6510731f6a7faf28296) >>
->> endobj
-2291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.965 441.795 323.002 453.75]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) >>
->> endobj
-2292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.965 428.566 315.264 439.47]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae) >>
->> endobj
-2293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.965 399.449 326.332 410.353]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) >>
->> endobj
-2294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 385.887 297.301 396.791]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) >>
->> endobj
-2295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 372.325 285.376 383.229]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) >>
->> endobj
-2296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 358.763 300.868 369.666]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga809c78f95611c4b838b4e8f097a03e32) >>
->> endobj
-2297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 345.2 321.341 356.104]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3ccd0ef2cbdc282106525b2f0e734c7e) >>
->> endobj
-2298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 331.638 331.303 342.542]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e) >>
->> endobj
-2299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 318.076 298.098 328.98]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) >>
->> endobj
-2300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 304.513 303.637 315.417]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga34d9dfd53548ce172ae94462d24f41e6) >>
->> endobj
-2301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 290.951 330.755 301.855]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) >>
->> endobj
-2302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.172 277.389 403.801 288.293]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142) >>
->> endobj
-2303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 208.314 331.323 219.218]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
->> endobj
-2304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.631 193.082 462.977 202.988]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.98 167.242 343.151 178.146]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
->> endobj
-2306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.631 140.055 462.977 149.96]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.703 114.214 383.562 125.118]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
->> endobj
-2308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.902 76.49 194.248 85.974]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2311 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2315 0 obj <<
-/D [2313 0 R /XYZ 89 770.89 null]
->> endobj
-2316 0 obj <<
-/D [2313 0 R /XYZ 90 704.011 null]
->> endobj
-2317 0 obj <<
-/D [2313 0 R /XYZ 90 629.274 null]
->> endobj
-2318 0 obj <<
-/D [2313 0 R /XYZ 90 473.233 null]
->> endobj
-2319 0 obj <<
-/D [2313 0 R /XYZ 90 237.811 null]
->> endobj
-2312 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F110 1507 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2373 0 obj <<
-/Length 1403      
-/Filter /FlateDecode
->>
-stream
-x��Ks�6���<��$����7�$�3��^�d8�I
��BRΨ���EI�#Վ�qu�X,��~\ "�&�Nz��zGoC׊Q
���[1�B/F~ O#�ڎq�cl�x���S�Ol��ӻ���
�c��
����ޛ�ޗ
�^�E�U��5�zן�5���Fn
Y_�Rfyԅߙu����� q{�n
�� ynd�� B�`?Q���M3�&Dq��h!/��B*�<��X�E���n�ң!��(��4�,ȏ���r�s�i��_�����=�����jF�(D��>�(�}�8(����pd9�
�8�Y�}C�mVf,9/f�)�,9M%+��^9O�ء��	c
-%�o�|����N�<9�L�ϴ�O���"�jG�"f%�_���%	S��Vz`
��^�^Q������R��𜗬.J��-�[�6��R�.,`
�\~�>���S�]91�y��9SI`��hD�i=Ue 弪Tq)�'��j�kT��j*�.J�9L·
�`��g<��B1�}N���x=-F�p�Teg��Y� )#cv�j.�,��ƕ\�@Puyzsw8^�>;����kj�m0Z�G)
-<
-=R�li�u(��t� ��lv?Q �?P���K����������Q9qi�9��DHkh���ID��!2]�I����
����DȂ�F�2��%υ��x�83��@��A�3�����AT�G֗�ҝ���ݢKv%9��B�G��~'T�Ȍ���Lhb蹛�A��G|�<g�E6_ W`���.iWʽD,��D�W�F:L��{?w��6b6�N���7M���4�?W�'��o�\_m�u[��ߤ��
����n�
��:�ӭ�(ԭ����<J6��z݄z�v)������ۧ������}�֫mX"v`���&��F
�f�}�C��b��?��a�]�!mu���]�Ѓ5a.�L�4�+��zRN/��U7�*QW \,l6~��\��8D���8wu
�X'�.��W��N���nt�}B�
-|7W�/Z�3Q��DP�f`R��|��Y��9��x��x��G���*[�Eu�U.��'�'#��OP�"�۷��I`竹�]��z�]�n�AO��	%��O�
-���
��]�!�7�����2��32w�ae
<h@��	��N7�`#�ȑ��
9hPЀ&:X��5�:�������p? �|��$�햅�T�G�:����C�-
�g���ED=�>����z�����yi�󡀢���~>d>Z�
��B䃾��μu��O��W��_
߷+�|���9�%ѭ�"/��Ar��
aҗ���e��+�
D��|�F�u=ut4XL*�Oаȶ�-�y����el�V��4�K.����}LPP�	p�
F��!�mYV�����]�Z���Z�af�u
-endstream
-endobj
-2372 0 obj <<
-/Type /Page
-/Contents 2373 0 R
-/Resources 2371 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2381 0 R
-/Annots [ 2309 0 R 2310 0 R 2344 0 R 2345 0 R 2346 0 R 2347 0 R 2348 0 R 2349 0 R 2350 0 R 2351 0 R 2352 0 R 2353 0 R 2354 0 R 2355 0 R 2356 0 R 2357 0 R 2358 0 R 2359 0 R 2360 0 R 2361 0 R 2362 0 R 2363 0 R 2364 0 R 2365 0 R 2366 0 R 2367 0 R 2368 0 R 2369 0 R 2370 0 R ]
->> endobj
-2309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 696.002 391.338 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
->> endobj
-2310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.902 658.928 194.248 668.412]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 633.317 380.628 644.221]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
->> endobj
-2345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.902 596.244 194.248 605.727]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 570.632 390.59 581.536]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
->> endobj
-2347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.902 533.559 194.248 543.042]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.432 507.947 408.754 518.851]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga60f87e33c0dde9f5c2c7d3b4b78818ab) >>
->> endobj
-2349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.503 470.874 209.849 480.358]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 445.262 416.603 456.166]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga470bfc567789301bfdc28fd70ed82f92) >>
->> endobj
-2351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.503 396.234 209.849 405.718]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 370.622 329.111 381.526]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) >>
->> endobj
-2353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.675 356.041 228.857 365.947]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
->> endobj
-2354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [413.266 356.041 454.611 365.947]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 330.852 338.476 341.755]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d) >>
->> endobj
-2356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.719 304.315 238.867 314.221]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
->> endobj
-2357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.953 293.778 208.298 303.262]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 268.167 379.164 279.071]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) >>
->> endobj
-2359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.675 253.586 273.385 263.491]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
->> endobj
-2360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.793 253.586 499.138 263.491]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 228.396 389.126 239.3]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) >>
->> endobj
-2362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.622 201.86 282.298 211.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
->> endobj
-2363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.103 190.901 233.449 200.806]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 165.711 378.416 176.615]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga233295f67896774a4fa42920a4b8522b) >>
->> endobj
-2365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.675 139.175 273.393 149.08]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
->> endobj
-2366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.802 139.175 499.147 149.08]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 113.985 388.379 124.889]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) >>
->> endobj
-2368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.622 87.449 282.306 97.354]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
->> endobj
-2369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.103 76.49 233.449 86.395]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2370 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2374 0 obj <<
-/D [2372 0 R /XYZ 89 770.89 null]
->> endobj
-2375 0 obj <<
-/D [2372 0 R /XYZ 90 400.219 null]
->> endobj
-2376 0 obj <<
-/D [2372 0 R /XYZ 90 360.027 null]
->> endobj
-2377 0 obj <<
-/D [2372 0 R /XYZ 90 297.763 null]
->> endobj
-2378 0 obj <<
-/D [2372 0 R /XYZ 90 257.571 null]
->> endobj
-2379 0 obj <<
-/D [2372 0 R /XYZ 90 194.886 null]
->> endobj
-2380 0 obj <<
-/D [2372 0 R /XYZ 90 143.16 null]
->> endobj
-2371 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2392 0 obj <<
-/Length 2323      
-/Filter /FlateDecode
->>
-stream
-x��YKs�8��W�fKU,� ��G�q6v��v���)E�g(QCR�ڿ~�� E�a;�kj/���5�n�sn
��������]$��%���xN�',a4s>���6~��0f<	a���}�
�.ǟ���h|���O��i}����G����;
�I���I
����t�#Ϩ�1`���+�9�4 u
��y�[դy�f��1���WM^.�zV�ɻ���s��g�O��x�`y�YY�^�Xj��M�yiZy�m�6v�ՀnZ-R3,����Uf�!�Viuo����Uy�(�07�٫Wl0�R���a}�.T�J3u
��s�0��y�0<���.��瞕�U���|9S���G�D�)+ꤳY��K3>-Z�a´\7�Ui6�^�/o
E�Yڤ�k�W���{`n!	jK�d�l�ɋ4�P��B����27� ���H���Enë���1V�����n �H0ɝ�'LD�c�,X'm<�F.�&�D��`ch�~
]:�x�+Wp��0~	��,
���� [...]
-�o�N�k�A��LER��_
��p'�`j?0v,��ڀ������!�?�����E��$�j,U�NE�]_���
8�������5yj�"�R�}_	b�����](df���Kٖ
M�e�?
���\��#Q���
	�
�≹��uԭ�}�$m
@9��rvr5�F�jvb
-���Y��
o�=z�&�p����&WY�ۥjK�F����-C5�~�Z)��h/d]
�"ԪU_q!���ۀq[H�P�X�P
�(��	X���"m�����̨��7껁���;��Fx�L��GA���AVQ�W�ѻw�g����+
-����,J����F{bFHr��9+�
��Y�=^������I�<�~gRi�& ��b7�ބ��]�4;�0el5��ٶ�>N��{��@k�B�l�
�����u�㚒��А���
 �Wd�k�aWc�U��+Sa�H
�@.�J+��[
��G>}�რ
�@���l*�RK�UKU�MY���VFA;i�σ���0ڼ
J��#�.���f(=�U+�Y�
Oi
+�yY+C����u�^�۶����D
-汵Rv�B�IY€q�[]�^��1u�� �/݄��,���}+ݍ
-��eb5͚uZ�ȝ��ޮ {|�E1�`Xh&�@����� s��=��D�n��p�'?p������R�6���&��{7���,Pu$��uez�U�fl7%tiS�f������M���IV at y���Ժf��j(�n
��0�7��͌�W�L�%���:Q��>�2u�A\E�b��NQ��m�o�v��u]4m�ߍR���p�|�9�6\<��> #	��M�ԪG�Tj�(�0�l��?P?5�\�c�v  �B/h8J�S�T�r�Y�(=cUy��tO����� ��l:x��
\&WvP�CJ
��o�up7���G�.KsG�f��� <C�T��p��
�ڔ�e�}60�z�^�C�a �x��ɗ�0���,�����	�)Y��)d���֗f��$���1��<4
)�nDlC��i�����i � �P����d<��J��W-zޓ�a�r>U�ئ��U�j����t\ u\�� (���F��%�:0�0<� ��v-
���B׫
mF�N;:����?3Cȱ�|��~ĂD�
�'$�
�"�?v���]c'�
�-�ن
���p�P��pǘI�:
�9��H6s�/�m
��ZU�Aa\q�.�6�Gow�3�����C��=��$�����U��G�
-��O`A{�Λfuzr2]�Bzp
��b7��,N��*��� e�v����x
��
-endstream
-endobj
-2391 0 obj <<
-/Type /Page
-/Contents 2392 0 R
-/Resources 2390 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2381 0 R
-/Annots [ 2387 0 R 2388 0 R 2389 0 R ]
->> endobj
-2387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [131.844 154.004 188.471 164.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-2388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.066 123.937 264.446 134.841]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-2389 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2393 0 obj <<
-/D [2391 0 R /XYZ 89 770.89 null]
->> endobj
-2394 0 obj <<
-/D [2391 0 R /XYZ 90 721.073 null]
->> endobj
-2395 0 obj <<
-/D [2391 0 R /XYZ 90 658.895 null]
->> endobj
-2124 0 obj <<
-/D [2391 0 R /XYZ 90 636.518 null]
->> endobj
-2396 0 obj <<
-/D [2391 0 R /XYZ 90 636.518 null]
->> endobj
-2125 0 obj <<
-/D [2391 0 R /XYZ 90 594.814 null]
->> endobj
-2397 0 obj <<
-/D [2391 0 R /XYZ 90 590.331 null]
->> endobj
-2126 0 obj <<
-/D [2391 0 R /XYZ 90 552.656 null]
->> endobj
-2398 0 obj <<
-/D [2391 0 R /XYZ 90 548.173 null]
->> endobj
-2127 0 obj <<
-/D [2391 0 R /XYZ 90 508.441 null]
->> endobj
-2399 0 obj <<
-/D [2391 0 R /XYZ 90 503.958 null]
->> endobj
-2400 0 obj <<
-/D [2391 0 R /XYZ 90 371.99 null]
->> endobj
-2128 0 obj <<
-/D [2391 0 R /XYZ 90 346.725 null]
->> endobj
-2401 0 obj <<
-/D [2391 0 R /XYZ 90 346.725 null]
->> endobj
-2129 0 obj <<
-/D [2391 0 R /XYZ 90 306.933 null]
->> endobj
-2402 0 obj <<
-/D [2391 0 R /XYZ 90 302.45 null]
->> endobj
-2130 0 obj <<
-/D [2391 0 R /XYZ 90 262.718 null]
->> endobj
-2403 0 obj <<
-/D [2391 0 R /XYZ 90 258.235 null]
->> endobj
-2390 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2407 0 obj <<
-/Length 1572      
-/Filter /FlateDecode
->>
-stream
-x��Y]s�8}���m�t�H񑷴v2n
۱q:�mǃm�01���n�ׯ����N6��'@��s���P[kP�j��Zg��������yw�
5�t���J��; �;B�x�����?^g�:O�8
蝿䏎mغm��y[=�����,PCbTlG[F�/ߠ�b�5
��~�"���n�i�%@0��"Ჱ�"Rh�)��ⶭgQ@�4Lb�;��6
�q��n�d��TtࠏO˚:���fQ�b
�}�K� �p���W�6��O#>nc�'���`E�� \P�>��O�]�Ip�]Zek;rD�
 h�q��.\l�;�,]&Q��Ow����>X>p�J��0���4\�I������:���P��%�z~8V�zv�.
�
`CW�+4
1��w=�~�#�`�X�`ۻ��mD�?�e*
� 9�%Kq���������v�\
D�
��xS����w�|���!��)
@�	*�^-(�m�TW���w�ū��l�Z ������a���*ic������0*|{�D%�/��bt�k�_��Ê�Gq��\
I�ԫ�%���OƱ��`�
 6�Ȉ&�b��DF����`��M ��k��܂�,ZT�U���Wq
�r��~�`��$��������`�jo���r;�m��-���V�ⵂϟDʐB
��r�QZ��+$0R��u��P�.#0Vׂ7��Ƶ�Y UM�&���T��S,�VC�7fS���_��#�r����<�q�����O��e��?�
�)�V�ٻy��������L&
���	���I���a`��3Z{
89r5����1!@J�"�=fO� F����-�5�d>~�C���6U���R&,t�*E��$�k(~���D�.��[B9K��n�v�Go2��g9��T��
-��{�/���
-h� BU��3��v��
� ���y��#H�,�h(,ʸ{�W�?T�d�G:��]����I9uſ
7'�	7���{}(1�2�G�Z��M߰T�v���p��$JV�&����j���b�cHg�F�����L��b
��G�����R�pĽ���F���%�i�H)��^�M��ΏJm���P!�ɠ�\�}������=�E����񴤋�dr�
r�7�{W��  6i���{�Ӡ�7����M��/�=i�DT������sR��
LKE�Y5����U&1��>M�Q�
-�"�՚�LӼf
���:
MO�� L췲�x����*�
'��7�
�����?B6K>�W
I�c3l�{~��?9�=/DAy��:F�T����Lk�ݐ��lur��4X�QI�]B�Qw��sT,
͆�y�-�ڸŲ
��ל��\�9�+�
l
:��&e�D�CͱT�
�Q�&p��ą
�e�� "�D+�g�xw�L��*	
����
���0��qꏑ�����b���bڀ���
x<
���.���A��ڏ3�/�d�ى�$�(�>�>�>
�_�~Њ�O��)A�"D9�>M��gg�l͂��U��]%;\ mE�Z[QBUm����	�d�#�X.�`d~gk
"��y��}���P6��#C�&��������5
-endstream
-endobj
-2406 0 obj <<
-/Type /Page
-/Contents 2407 0 R
-/Resources 2405 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2381 0 R
-/Annots [ 2404 0 R ]
->> endobj
-2404 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2408 0 obj <<
-/D [2406 0 R /XYZ 89 770.89 null]
->> endobj
-2409 0 obj <<
-/D [2406 0 R /XYZ 90 721.073 null]
->> endobj
-2131 0 obj <<
-/D [2406 0 R /XYZ 90 702.288 null]
->> endobj
-2410 0 obj <<
-/D [2406 0 R /XYZ 90 702.288 null]
->> endobj
-2132 0 obj <<
-/D [2406 0 R /XYZ 107.713 620.79 null]
->> endobj
-2133 0 obj <<
-/D [2406 0 R /XYZ 107.713 604.885 null]
->> endobj
-2134 0 obj <<
-/D [2406 0 R /XYZ 107.713 588.98 null]
->> endobj
-2135 0 obj <<
-/D [2406 0 R /XYZ 107.713 573.074 null]
->> endobj
-2136 0 obj <<
-/D [2406 0 R /XYZ 107.713 557.169 null]
->> endobj
-2137 0 obj <<
-/D [2406 0 R /XYZ 107.713 541.263 null]
->> endobj
-2138 0 obj <<
-/D [2406 0 R /XYZ 107.713 525.358 null]
->> endobj
-2139 0 obj <<
-/D [2406 0 R /XYZ 107.713 509.453 null]
->> endobj
-2140 0 obj <<
-/D [2406 0 R /XYZ 107.713 493.547 null]
->> endobj
-2141 0 obj <<
-/D [2406 0 R /XYZ 107.713 477.642 null]
->> endobj
-2142 0 obj <<
-/D [2406 0 R /XYZ 107.713 461.737 null]
->> endobj
-2143 0 obj <<
-/D [2406 0 R /XYZ 107.713 445.831 null]
->> endobj
-2144 0 obj <<
-/D [2406 0 R /XYZ 107.713 429.926 null]
->> endobj
-2145 0 obj <<
-/D [2406 0 R /XYZ 107.713 414.021 null]
->> endobj
-2146 0 obj <<
-/D [2406 0 R /XYZ 107.713 398.115 null]
->> endobj
-2147 0 obj <<
-/D [2406 0 R /XYZ 107.713 382.21 null]
->> endobj
-2148 0 obj <<
-/D [2406 0 R /XYZ 107.713 366.304 null]
->> endobj
-2149 0 obj <<
-/D [2406 0 R /XYZ 107.713 350.399 null]
->> endobj
-2150 0 obj <<
-/D [2406 0 R /XYZ 107.713 334.494 null]
->> endobj
-2151 0 obj <<
-/D [2406 0 R /XYZ 107.713 318.588 null]
->> endobj
-2152 0 obj <<
-/D [2406 0 R /XYZ 107.713 302.683 null]
->> endobj
-2153 0 obj <<
-/D [2406 0 R /XYZ 107.713 286.778 null]
->> endobj
-2154 0 obj <<
-/D [2406 0 R /XYZ 107.713 270.872 null]
->> endobj
-2155 0 obj <<
-/D [2406 0 R /XYZ 107.713 254.967 null]
->> endobj
-2156 0 obj <<
-/D [2406 0 R /XYZ 107.713 239.062 null]
->> endobj
-2157 0 obj <<
-/D [2406 0 R /XYZ 107.713 223.156 null]
->> endobj
-2158 0 obj <<
-/D [2406 0 R /XYZ 107.713 207.251 null]
->> endobj
-2159 0 obj <<
-/D [2406 0 R /XYZ 107.713 191.346 null]
->> endobj
-2230 0 obj <<
-/D [2406 0 R /XYZ 90 179.313 null]
->> endobj
-2411 0 obj <<
-/D [2406 0 R /XYZ 90 174.83 null]
->> endobj
-2231 0 obj <<
-/D [2406 0 R /XYZ 107.713 93.392 null]
->> endobj
-2232 0 obj <<
-/D [2406 0 R /XYZ 107.713 77.486 null]
->> endobj
-2405 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F112 1773 0 R /F24 529 0 R /F8 794 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2416 0 obj <<
-/Length 1397      
-/Filter /FlateDecode
->>
-stream
-x��X[s�8~�W�ma�V$�׼�����Vpv��vJ�/�6M��#K2� ;��� YFG�|�w�$c�A��M���u�֡��<۰��^��
�lxZj�ڎ��
�Ө�"��0��
L���������-��"i}���%
��0���=UJ4Ӡ��ڴ����+x�%B�
�v�C���
LF���Y�f8���j��[��umdK�=���2J:�a�vT�v�b�!V��c�Ò-�h��6�:��~b�|d���?�QG��'�Xǥ4��gM�r���zk?D�c[m�@3z]����
8
-fC߿���A@��\�
�����ЦY);�-���n{G,�/ْ�^�.�K�u.G�ǰT=9��X
�Q���\����{�
A�Y��l
��=\HD�T"��� ��y�ڒ�G��,�(U��7��_h2 �
�iLzW�l���Ao4<��<Æ�*�aQì�����]��S����떷�p#:a*Zk���}
-XsʗTh]��ŷ|T�b#�M�r�>g�c������Qs\�y�%�u�B�2	?2,
o8z�.z:��MAU�"ד� E&�
�`
>��N����g�ȣ�B~���y��
֏7�l���~4��|syy�
X���f~���^ui]7
��k��ҥ_v��["iYb3/�4��M5
�#j�n@�:P��

�2Y~ٴ��>+�.r��SC��
���'ӣ��r�kц�y@�4�VԼ`�0��
E
����c������H�s�
-�D�Jo����ݱL�
j?
�%�rs��;.Xy���vL͟��L��t�̳�|I;��5�@Q�U�J������$�_�a�N'4%g64����Y�G�hٷ)0�V쳢P�	�K���W
Mf'u]���eeY�	�^���p�f�wr~ԡ�i�&gP󳱐��|
64�$/.��1Q�����I�l��>�
��嵏��
��C%���%�
-6�}����*AS��!�@uV�T�\l���7�~��2
�A�۟]����w|!P'<�N��:.WUQ�Pm+�5͒H��hbr�4��h(nګ�;�MC�ڎ�)<Z��,-_�U
�V�e}$�a
o�:g�!���R�:
�t�iwxwf���,���r�7'@?*8~ݢ��!��ٹ6Z�Q�[���
^�l�(��:���#	��Κ�ް7��}�.���zD�^h��C5�[#[��^�=�3y�t?��
M�?���O,��
����eg�� ˫��|
1q
�z�ۯ^�9rࢗP�:c[s:�ӷ�74�̶MA
�
��i������,��繄`��������X
0N�~ʔ�__j���o[֮?lwV}�~,�����|�P��A�?gp;��v�̼W��$�����*��y��2ɪ
-endstream
-endobj
-2415 0 obj <<
-/Type /Page
-/Contents 2416 0 R
-/Resources 2414 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2381 0 R
-/Annots [ 2413 0 R ]
->> endobj
-2413 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2417 0 obj <<
-/D [2415 0 R /XYZ 89 770.89 null]
->> endobj
-2233 0 obj <<
-/D [2415 0 R /XYZ 107.713 711.11 null]
->> endobj
-2234 0 obj <<
-/D [2415 0 R /XYZ 107.713 693.956 null]
->> endobj
-2235 0 obj <<
-/D [2415 0 R /XYZ 107.713 664.847 null]
->> endobj
-2236 0 obj <<
-/D [2415 0 R /XYZ 90 638.952 null]
->> endobj
-2418 0 obj <<
-/D [2415 0 R /XYZ 90 634.468 null]
->> endobj
-2237 0 obj <<
-/D [2415 0 R /XYZ 107.713 551.122 null]
->> endobj
-2238 0 obj <<
-/D [2415 0 R /XYZ 107.713 533.968 null]
->> endobj
-2239 0 obj <<
-/D [2415 0 R /XYZ 90 520.028 null]
->> endobj
-2419 0 obj <<
-/D [2415 0 R /XYZ 90 515.545 null]
->> endobj
-2240 0 obj <<
-/D [2415 0 R /XYZ 107.713 432.198 null]
->> endobj
-2241 0 obj <<
-/D [2415 0 R /XYZ 107.713 415.044 null]
->> endobj
-2242 0 obj <<
-/D [2415 0 R /XYZ 107.713 397.89 null]
->> endobj
-2243 0 obj <<
-/D [2415 0 R /XYZ 107.713 380.736 null]
->> endobj
-2244 0 obj <<
-/D [2415 0 R /XYZ 107.713 363.582 null]
->> endobj
-2245 0 obj <<
-/D [2415 0 R /XYZ 107.713 346.428 null]
->> endobj
-2246 0 obj <<
-/D [2415 0 R /XYZ 90 332.488 null]
->> endobj
-2420 0 obj <<
-/D [2415 0 R /XYZ 90 328.005 null]
->> endobj
-2247 0 obj <<
-/D [2415 0 R /XYZ 107.713 244.658 null]
->> endobj
-2248 0 obj <<
-/D [2415 0 R /XYZ 107.713 227.504 null]
->> endobj
-2249 0 obj <<
-/D [2415 0 R /XYZ 107.713 210.35 null]
->> endobj
-2250 0 obj <<
-/D [2415 0 R /XYZ 90 196.41 null]
->> endobj
-2421 0 obj <<
-/D [2415 0 R /XYZ 90 191.927 null]
->> endobj
-2251 0 obj <<
-/D [2415 0 R /XYZ 107.713 108.581 null]
->> endobj
-2252 0 obj <<
-/D [2415 0 R /XYZ 107.713 91.426 null]
->> endobj
-2253 0 obj <<
-/D [2415 0 R /XYZ 90 77.486 null]
->> endobj
-2414 0 obj <<
-/Font << /F73 552 0 R /F112 1773 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2427 0 obj <<
-/Length 1858      
-/Filter /FlateDecode
->>
-stream
-x��XKs�6��W�Vj�x�[������JsH:J�$���T\��wXP����Lgz".v�o�]�{
�{�{/F���Xy)K#y���r/RF�6�>�	����/���?�!�/�b��ھ]����_�X�~
�
���z�z�pOX�!�o��}��{3����L��wg��^ <W�m��
'9�!�A��B0!ZoY�b�X��߮ѝ�]�	KU̪���~V���M_r�\�zVe��|Re����嶘������xԏ����}����Y�-;��ΣCdm %<�6��nV��˹}N�)�����}�i'0Z34�"f���w�)
͒��6yY���<�hT

-���=���m6U�G��X�����L��D7bG�p���D�TH�(�*k��yW����\y�N$,�)
D¸�V݋���89�N�
~B�͛�
���:<vZ�)sA ٤�9�}�=Zh�{J>�
�~��(x�=��f{B���S�*�G�$��c�`!Oy#��x��TH
��E��4}2��˨�`���H�%��!�wW�����NE%LY��
�:_n���  ��$HI'��
��~ss9|3���C((��p�ܒ���f|�ԕ���F����
���N?�D���ھgvU�Wp�v�l�bw��w�0�M�a_<a��$,
�VM��f�נ�
�u٤.Wۆ�Z����@ґ���av��Zv_ƥ��ȹ*qx�����
	������2Co>�e������/÷�������ps{2�8DJ��
G�嗸��qx�`�e�I��d���v�f=4�#p��k+��YA�2kH�
��s�E1��{�$�U�λ;+��@��� 
-���g2WA�i���C\A���9�����
�Z�u9ۮJ�Nrx�P�E�6d��Ľ��1$�|�&�S,�w� ��B�p��
�Wt��^
�/
��| �C$H�O#A��N
$�Q��Ǝ1��� �*	4xP\
�[�u�옰�CĆu5
GLJэ�=�-7�Jm쬂6�s��
1<�G�'�0�.��ì�5, "��]� ɇr�8T���C�I�Ρ�.�8N��\�fI�� r���U^nk�b����v2o�iҵ������̊l��i�>J϶��)��L�#��l�
$�K�� 

��Nt�<Q9-�M 
-�i�0��(
��e1��
���Y�����A
�@�ɬA8�|����͡
�� ����H{|Z�0 ��'�*ovv��8��C
L�K;
\�����B	�*;\gE>׵娺�����S}����W 0,�;�a}_$1��dF�ρ���']������xq9|��b�/O$���=w�|`����^�꣄�>�H@�F*:~�1�_��&:�yE�hڶ�-��Q5��(Y�
-zJ���09�s��(�X�l���г����e��ځ�68�.i�Ynk3��Ԅ2y1˧ĄV�A�Lƒ�< i��ΕB
�
*Z�
��-�N�Kճ�S]אcT�.̪�h5D��Ӽ�w/�7����;�e�m�#łD<����{1i�܋o�(�/-m�
��@��&����\Gp�֟����y�sf���*/tV�/��
�N9@1�V�h;x�1�v���Fx5_��C�dy�V_g�Gf�	��
-��&!m�Ws�^��vɭp3e�/�%��_��d�TO�ek~�B|�6E��
b�J=r軹���w���������f+;�c�
�HѺm6�W�u�wύ~����+"
X�=�i6���&�`c� @�qv������
�� ��&�b���v�r��H�����	�E
K#q86�B�8�X+�U	��+���2
-endstream
-endobj
-2426 0 obj <<
-/Type /Page
-/Contents 2427 0 R
-/Resources 2425 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2381 0 R
-/Annots [ 2412 0 R 2422 0 R 2423 0 R 2424 0 R ]
->> endobj
-2412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 668.225 294.501 679.129]
-/A << /S /GoTo /D (index_Approximating_Bounded_Integers) >>
->> endobj
-2422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 484.112 294.501 495.016]
-/A << /S /GoTo /D (index_Approximating_Bounded_Integers) >>
->> endobj
-2423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 340.156 294.501 351.06]
-/A << /S /GoTo /D (index_Approximating_Bounded_Integers) >>
->> endobj
-2424 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2428 0 obj <<
-/D [2426 0 R /XYZ 89 770.89 null]
->> endobj
-2429 0 obj <<
-/D [2426 0 R /XYZ 90 721.073 null]
->> endobj
-2254 0 obj <<
-/D [2426 0 R /XYZ 107.713 627.99 null]
->> endobj
-2255 0 obj <<
-/D [2426 0 R /XYZ 107.713 610.618 null]
->> endobj
-2256 0 obj <<
-/D [2426 0 R /XYZ 107.713 593.247 null]
->> endobj
-2257 0 obj <<
-/D [2426 0 R /XYZ 107.713 575.876 null]
->> endobj
-2258 0 obj <<
-/D [2426 0 R /XYZ 107.713 558.505 null]
->> endobj
-2259 0 obj <<
-/D [2426 0 R /XYZ 90 547.889 null]
->> endobj
-2430 0 obj <<
-/D [2426 0 R /XYZ 90 543.406 null]
->> endobj
-2260 0 obj <<
-/D [2426 0 R /XYZ 107.713 443.876 null]
->> endobj
-2261 0 obj <<
-/D [2426 0 R /XYZ 107.713 426.505 null]
->> endobj
-2262 0 obj <<
-/D [2426 0 R /XYZ 90 402.992 null]
->> endobj
-2431 0 obj <<
-/D [2426 0 R /XYZ 90 398.509 null]
->> endobj
-2263 0 obj <<
-/D [2426 0 R /XYZ 107.713 299.921 null]
->> endobj
-2264 0 obj <<
-/D [2426 0 R /XYZ 107.713 270.595 null]
->> endobj
-2265 0 obj <<
-/D [2426 0 R /XYZ 107.713 166.968 null]
->> endobj
-2266 0 obj <<
-/D [2426 0 R /XYZ 90 131.5 null]
->> endobj
-2432 0 obj <<
-/D [2426 0 R /XYZ 90 127.017 null]
->> endobj
-2425 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F112 1773 0 R /F11 613 0 R /F8 794 0 R /F10 765 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2439 0 obj <<
-/Length 1915      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ�ӆ��8
~��Y'>��\��d�EK��
-Ejxd����@��(K
95��������n��γC������U ��D>���҉�x�>�Z8���~���?$,�a�����l|7���x6�2`0E
��%	Bg�
|�L�
��P"���j�
�
hSg:�y@�*mK��]�XA�V�0"�zN��<�f�
�^�"������J�mϮ�;�XH9#h�(�r|7
w��]��*x��a���Re��DH�Bm
-U����$�·#�Gn����\-�\��Q��	���R}�U6׋��M�=Qj����q�C&]5�8�/�
R�3�� F")Q�$���"ɞ�#������[���8������S(\v{��/؋�Y*-�+���O�;��V�z}צ8s��Y�6S��$\B7[�NZ�ثKU�1l��
-;�*��Z���e�K�쑠K���Y:��� u�N.>~�<
��h�3�ąa����qf�)�u�^�ZP�
"�1���%0D-�k^���Y�5=oJw
g�R���
C
ΉF�����xNJ7Yo@�D��Q�1�Y1ϳ�^o�ca��
lQۑ*Y+����)�V8���q]*�ȲPj�i�)�E\�vY~�6��
�
B�{}Z��7:���f]�-���?�12P�S[P�g֖�9¶�z�Ba
��L��t��}��g��0��һj�����y���[0I'6,,
-m�D���G""�`�r"��J��2J��0mka{E��
Y#c�b
?N�
2]��R�"~�I���x9?�Js�M�l瓬z��Hr�S����
��h��5��F����ȳ��=�MR��ge��9T�T�M#�k�Y3�R�� �����5�
�U��{x.�b���B��� ?�^��qY�Q��8�˪���5Ņ�'�S+�`&
�,�j��;N���ģ������F��W���� >~�S�"�ӗ�a�F�[P@
1�<_o��ܮ�O�+l��
k�$C;��n���)%\k�����r��
�ǁ�
�uqs�G� $B�7,�
��^���Z��<)��m�լll+�Į����&� ����Z/Ϊ�,㝠>V�vX��.���݇�ޢ$�X6Hyϩ:�N�C�£�x3:�_��7�.����� {�^�E^?
C�{���$y��o�g<�燋�^ZF��ܗ:^
�%b�!&{;8�`
<On��
ǿ�[�r܋�yP� A40�ޝB����w,
-�ƕ�:���d�����5�����a�v�^�
�o���'�
-��=!
�'���	{�j�ǃ�{��V]�o^������p;�G�G��֕�p��wo�un?�{�~&ד�I1d������f]���3��2i͖��`�W��M�H�Ǻ��=��2O�-P
����2-����L?�]�/��:a�{۟3<ȶb�V-�� ��s�-Ul
L��(�Si�'����_Ǘ'�&"=�_�U\�o�3<��q�<�z�6��
&%L���{�������=��@*��	�R;��{�����4靪�S^�"�M�Ph�4mc�dՠ
-0�ߋEPZ�b1��6�
ī:��O.<t/�9p���v���M�$/ܕH���GU�i�!l=����@��	���}_�9�¨�F��+0
���A��&q�bȘ�)����S���p>���a�|LP�Q�B��Fy����d
G��K�,�X���F����ɟ�pQ7#B�7��x �m?Q�
�g��}��uBb���8oc�S��I�>�������5.N����F�"�/p�p3��7��
;pv��e¶��N挶�S!PC�
�#C*(X�ܮ�F�dr���R?�tn�6��&N��m�/�GMx���Ƒ`�Y
�z�ު����G�)۷ת�6�ggO�s��g��u��n���Aˀ�>�t\	.�Hww
-endstream
-endobj
-2438 0 obj <<
-/Type /Page
-/Contents 2439 0 R
-/Resources 2437 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2381 0 R
-/Annots [ 2433 0 R 2434 0 R 2435 0 R 2436 0 R ]
->> endobj
-2433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 532.54 248.743 543.444]
-/A << /S /GoTo /D (index_floating_point) >>
->> endobj
-2434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.841 329.404 245.973 339.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-2435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.841 215.126 249.291 225.054]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-2436 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2440 0 obj <<
-/D [2438 0 R /XYZ 89 770.89 null]
->> endobj
-2267 0 obj <<
-/D [2438 0 R /XYZ 107.713 695.907 null]
->> endobj
-2268 0 obj <<
-/D [2438 0 R /XYZ 107.713 655.76 null]
->> endobj
-2269 0 obj <<
-/D [2438 0 R /XYZ 90 607.331 null]
->> endobj
-2441 0 obj <<
-/D [2438 0 R /XYZ 90 602.847 null]
->> endobj
-2270 0 obj <<
-/D [2438 0 R /XYZ 107.713 493.438 null]
->> endobj
-2271 0 obj <<
-/D [2438 0 R /XYZ 107.713 477.202 null]
->> endobj
-2272 0 obj <<
-/D [2438 0 R /XYZ 107.713 460.965 null]
->> endobj
-2273 0 obj <<
-/D [2438 0 R /XYZ 107.713 444.728 null]
->> endobj
-2274 0 obj <<
-/D [2438 0 R /XYZ 107.713 428.492 null]
->> endobj
-2275 0 obj <<
-/D [2438 0 R /XYZ 107.713 400.3 null]
->> endobj
-2276 0 obj <<
-/D [2438 0 R /XYZ 107.713 384.063 null]
->> endobj
-2277 0 obj <<
-/D [2438 0 R /XYZ 90 373.64 null]
->> endobj
-2442 0 obj <<
-/D [2438 0 R /XYZ 90 369.156 null]
->> endobj
-2278 0 obj <<
-/D [2438 0 R /XYZ 107.713 288.162 null]
->> endobj
-2279 0 obj <<
-/D [2438 0 R /XYZ 107.713 271.926 null]
->> endobj
-2280 0 obj <<
-/D [2438 0 R /XYZ 90 259.361 null]
->> endobj
-2443 0 obj <<
-/D [2438 0 R /XYZ 90 254.878 null]
->> endobj
-2281 0 obj <<
-/D [2438 0 R /XYZ 107.713 173.884 null]
->> endobj
-2282 0 obj <<
-/D [2438 0 R /XYZ 107.713 157.648 null]
->> endobj
-2283 0 obj <<
-/D [2438 0 R /XYZ 107.713 141.411 null]
->> endobj
-2444 0 obj <<
-/D [2438 0 R /XYZ 90 124.017 null]
->> endobj
-2322 0 obj <<
-/D [2438 0 R /XYZ 90 101.507 null]
->> endobj
-2445 0 obj <<
-/D [2438 0 R /XYZ 90 101.507 null]
->> endobj
-2323 0 obj <<
-/D [2438 0 R /XYZ 90 77.486 null]
->> endobj
-2447 0 obj <<
-/D [2438 0 R /XYZ 90 77.486 null]
->> endobj
-2437 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F112 1773 0 R /F60 532 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2452 0 obj <<
-/Length 2868      
-/Filter /FlateDecode
->>
-stream
-x��\[s�6~���S+Mc�Kfgg��e�MZo⾬���mk+Q
-E����
�MH�DJȎ�O�$���}瀇ˆ��� ���3lO������+�I���n`�@q���O���P#2:'��w�|3:�ߎ����>�>��ˬ��ڏZ15Tj������Wg������*�҃����G<����f��ww�|�)��l���_g8��`��&!��%��H�g���<T/G���|�
�(�uv6��Qd�i�m�!#&ڐ.G��!��٤� �#�S ��!"u ����s=����b��rQX�(o�+%bl���S]3�/�
<:�B�Qv��Z70��<�X�
�_��U����Ka-[�Hu�akz\_t=�g�<���� ��F��(�@�"�U�r�(�Im�4�)�Y_�%@�9 �����y56]�C�@���7)�k�6�xȠm��h��
-a�O�`��$�FT(���W���� �E
-�W�� E��"$O�k$
!�-v��
�4���B2�pk��8]�" �l�m!80���	~�JnP��M���ߖ�*2(����l]��{��qQVg��,�AOt�w��
�"[��ey9���
���MV�8
>��X瑫��|��X��5�i�3�4���k�Emm��QD���=a�
~D�����V�Lك)��ǜ���"?,|��� J � ��qtѽȘ4��+X����	A<�l0�!�
-g�f����kP�D�����&$d�ٷz�A� F�:�@5=�$>��["Q�<*jJ#)y��͚�R�� �Q[��������$ 4E�
B
]"��8�L�2�
)h�)/��9�0���Fy�/��d��Gh-a�0�BB4�N�5�#)�3e�r���Ԯ��@\)!y)0P
�
B� C��Ҳ*

�؀M���F���`j�41+�H2ML.
��X�>���*E{�� �q�St�s��6Q��3?����3���]N��x�rdxt1�݅
-7�S@/T0E}�Q	U��Be,�!��
-�$'T�!��*�0��8�g$EϜ� f{�w(��C珁�
�3ȨaJ��.�<�q�N�
�2�Ҋ<X�Mg�s
�	p!�ȭ)�h[�vy 6�<�
�B

ENe r*6 "���oYa����o�`%Fژ(̻�z{�bt�[.�'�X�	�0���O��}V��|3�a�v���X�l�f�ٲ�d��AA��r��$��
k:�,b�E����^����?���8
I�)n���n���r���䥔����B�;�	�	�6�)�)nBD�W[S��
n�@6
-n7��D�
1t��H�4$KF�Œ�N���xj*1I�æ�N0&~6:9%Ka��`Q
-��ڦ�.�d:8%�ųaj7�Yl�%�)���uxÇC�k�3t��+��
�8��Lu&8x7��@��M��+�)d�
-��0�AJ��da�����}�U�tD�U#ꦹ��	,���|( ���A�b9�@5�����چi���fy��7���Y
�X/{�2)LD
-,
2)
�|���{qj ��;qv
��Z�O�5��S}� ��wA_z������1��E��	���;s"
fj�y���-�hr�Ѕ�8ncX-�p
L	��s�t��m�9� ��xG��=3
���S5a�7ͲI6�@3����
(�956�d �q݁#�(a1�������S\�� @��j#�-�0���8�
+A�^X�F���:[����b���Ĵ}��BHO�b@[��Qڲ%*M�a�AU��#��6���J �k���ݖ}3�{eR�~#*u��/�[��;H��Sm�,ǭ)�d�/�@�9
 ���0j�8��#$�1J�	�6�`�,ĸJĘC�G�]SE�,Ě"�� �'{Ao�'����Ʊ*��m�,
�z��Zȸ
��Y��'\"@*����i���/%���K���[�#j�8T��@�i�G�Ν���}={�a�$�'E�ھ*��֫�$Z�iu�H�~Ss6\~^�'�r�MKVM�@�%=�� :82F0\�d� [...]
-�5Y��Z�H�X�-6�2��9�
j�����4Atd���W+��|	�C�;Ԯ�������uҼ�Ui>�[�22����*bS�r��|�=6 at VBM�u���7_
I�
����Q��k�$��ݕ�(�.%���@\m@�_f�|�嘆��r�H8���� I���X	!A:M��#��}��"A
�H2�]�+�
3\1���UL�nÞm�i����($�[��β*[H��_�
�&�*C�V��3�US�4��Η��z�:i��eX��1ͳ�a1��o�7��e�|\L����CVd7E�O�;`'���g���������w��&8�)���tr20O5�9����ޱ�3pe��-�:��a���L�������~�g���/m"F�q��
�x at mйa���lZ���,��!0vY��Qd����Jel#U�5Ԅ�
����
{��S
ڄ�$aolժ��6���
��tGnV�C����?r�&�2z�\L��*�}Z���E�6��QNI�k'3{ry����|׷x�N'����핛
-8͒^`:��7��rn/�"�~|��e��B��1(_����-;W��ϗ������k�N�"'&��N�Y{Ҿ�˺�i�'����@�oJ�B��qӕ�Ž
��UV|=bX�о���:��M�e� \�}|������_��g�V�P��H<�K�P���7��U�ߣ��|{�j��@��P�ο
-=�
���X�r�+���B�T���H�`~���?���}�~�7�_\�����
��l�	���
-endstream
-endobj
-2451 0 obj <<
-/Type /Page
-/Contents 2452 0 R
-/Resources 2450 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2473 0 R
-/Annots [ 2448 0 R 2449 0 R ]
->> endobj
-2448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.838 173.771 463.556 184.674]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2449 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2453 0 obj <<
-/D [2451 0 R /XYZ 89 770.89 null]
->> endobj
-2324 0 obj <<
-/D [2451 0 R /XYZ 90 704.136 null]
->> endobj
-2454 0 obj <<
-/D [2451 0 R /XYZ 90 704.136 null]
->> endobj
-2325 0 obj <<
-/D [2451 0 R /XYZ 90 682.422 null]
->> endobj
-2455 0 obj <<
-/D [2451 0 R /XYZ 90 682.422 null]
->> endobj
-2326 0 obj <<
-/D [2451 0 R /XYZ 90 642.631 null]
->> endobj
-2456 0 obj <<
-/D [2451 0 R /XYZ 90 638.148 null]
->> endobj
-2327 0 obj <<
-/D [2451 0 R /XYZ 90 598.416 null]
->> endobj
-2457 0 obj <<
-/D [2451 0 R /XYZ 90 593.932 null]
->> endobj
-2328 0 obj <<
-/D [2451 0 R /XYZ 90 571.885 null]
->> endobj
-2458 0 obj <<
-/D [2451 0 R /XYZ 90 571.885 null]
->> endobj
-2329 0 obj <<
-/D [2451 0 R /XYZ 90 538.823 null]
->> endobj
-2459 0 obj <<
-/D [2451 0 R /XYZ 90 538.823 null]
->> endobj
-2330 0 obj <<
-/D [2451 0 R /XYZ 90 504.76 null]
->> endobj
-2460 0 obj <<
-/D [2451 0 R /XYZ 90 504.76 null]
->> endobj
-2331 0 obj <<
-/D [2451 0 R /XYZ 90 463.968 null]
->> endobj
-2461 0 obj <<
-/D [2451 0 R /XYZ 90 459.484 null]
->> endobj
-2332 0 obj <<
-/D [2451 0 R /XYZ 90 437.372 null]
->> endobj
-2462 0 obj <<
-/D [2451 0 R /XYZ 90 437.372 null]
->> endobj
-2333 0 obj <<
-/D [2451 0 R /XYZ 90 415.264 null]
->> endobj
-2463 0 obj <<
-/D [2451 0 R /XYZ 90 415.264 null]
->> endobj
-2334 0 obj <<
-/D [2451 0 R /XYZ 90 393.157 null]
->> endobj
-2464 0 obj <<
-/D [2451 0 R /XYZ 90 393.157 null]
->> endobj
-2335 0 obj <<
-/D [2451 0 R /XYZ 90 371.049 null]
->> endobj
-2465 0 obj <<
-/D [2451 0 R /XYZ 90 371.049 null]
->> endobj
-2336 0 obj <<
-/D [2451 0 R /XYZ 90 348.942 null]
->> endobj
-2466 0 obj <<
-/D [2451 0 R /XYZ 90 348.942 null]
->> endobj
-2337 0 obj <<
-/D [2451 0 R /XYZ 90 326.834 null]
->> endobj
-2467 0 obj <<
-/D [2451 0 R /XYZ 90 326.834 null]
->> endobj
-2338 0 obj <<
-/D [2451 0 R /XYZ 90 304.727 null]
->> endobj
-2468 0 obj <<
-/D [2451 0 R /XYZ 90 304.727 null]
->> endobj
-2339 0 obj <<
-/D [2451 0 R /XYZ 90 282.619 null]
->> endobj
-2469 0 obj <<
-/D [2451 0 R /XYZ 90 282.619 null]
->> endobj
-2340 0 obj <<
-/D [2451 0 R /XYZ 90 260.512 null]
->> endobj
-2470 0 obj <<
-/D [2451 0 R /XYZ 90 260.512 null]
->> endobj
-2341 0 obj <<
-/D [2451 0 R /XYZ 90 227.515 null]
->> endobj
-2471 0 obj <<
-/D [2451 0 R /XYZ 90 227.515 null]
->> endobj
-2472 0 obj <<
-/D [2451 0 R /XYZ 90 155.882 null]
->> endobj
-2450 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F24 529 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2479 0 obj <<
-/Length 2736      
-/Filter /FlateDecode
->>
-stream
-x��ZY���~�_����2GsR*Ur"'q,Y�6/�T*,	�L4ȍ����@
 r�Z�U.�	���������]g8���חO�Q,3�H*��efp��AB��"{;Qz���یI��������._��|c�]������+���@Jg�����8[��F���#Zg�2���7���A��������{�A�L�
�Ҽ�R>ɛ|]�fJ�d��p
�a�ֿ��+��b��L���ux~V��L&	E��c\A�INzl����@8E���1F�P��Ͷ�y
��)���v"%2T��<�Ψ��M]V;+<�I��4���:�Mɤ�������W�M>�x���n�H�
��U]o��Ǜz��Z�U�+�����.LA'y���~)����AF/꥛_��S*�X��jUl�PY-�y|ț@��V�<����/k�<>n�&f����f�1���
�"!z�
!�̈́��qS�l)��e�jŴ%����!I
`O�:4�R��6��.�i8Lc2�8@�#z6��&O�E����g~pL��flD
�� O�)cR�n�A���+��v�n����G,�uQm��o=+�5K,��Sq��M"�	
æ��`�k�L�a���ػ����:��vf�
	���֣�3#�G����C� ��C��Nw��w�
���{?�:.��Qp����kz��مu���f�@
�4���7��&����4���}"}D�M�i�mQ�<�_;�IW���BoB`�w���z��P�||�Q�so��e퐔ܛ ��
P�E�Dz�$��D7 wW��n*�

��Q����0��A¸����3��������|iÞ�U�Ư
�҂HD
��5���g��>��ÂJ� 
3���P�n�j<��] �Ha?R#�Bl�kn���(%d��Jk��y5%brgT�<7܆2n����� �����mp
ó�3/
-�
Z��bu�'�!N�}62���Ư��j;�:Ɛ`��:��Az��C6|�#e5����v[�
Z�V
d
�ڤ��>�)��͔c�5-*��C�!�1B��Ĺ`=��H�i�LM�y���Y�F-��2�9(���mH���I��r.���?���% c�x"��d#�hi"88��kNS�%��U�Ո�$�)�:�C,�{
 Ը�f:�-�HS�5
-�Z�"�]k�.^�L'"��k�-(�.�5ۈvݭ����@�`7c��(��(�p��A��z��nb��8���	kM�
�[[��m�
-�R����7/.GxJ�����Oow�U]�C����aNa�jȖ�kv
8)�����`kH�J�6�f`�+�k���fD�Z�C��"��������ӧ��l 	��H�E

�&ā�pRF`6z�Y� If}9R{�
̏�gN��"�9���wX��K2춀Nn���,�c���K�
_���4}\���@������t:"�;s�x)��D[
p�"�>��[A�,'��j�bw7�:�\�㫣�:�t��Qi#u���G��%Q��
Q��^�� ��g0� Q�r��$��80vڱ���E
�x_���>�;���X���u�opW�9�,�U�,z��
�$WMQ�?�X�6�A�?@f��ѽ������>�z�NP�
�
�
�
d�:*��I��*
X�<��șB
$:����>=��
<]��b-#�x2Ah�Ǖ���9��:
�8�bx4E�<^�T
-v/@#$�ZӍXuX��"(f�\
9�����'
�0$�,]��<(�;�P����l��eʸ��
��fo^��ο���ᓸG˅
g#�0V�"���5�������I,��ɭ�֋D��-R{[��
ܗ�2��|��
�)��
�������h�2��>	SV����stư�Qv�Z$D��N��s�1pČ�����JQ.�<�i�H�F�&�L�!W&ݦ�}�W��f$tL커hGBю
�Ց��\?݆�H�+������t
[�b-ϭ����<lE�y�Z��֧E�7` d�p�p��h�\�k߅V��[=3�ˡ���ꜛ,6w��
ˠ�ܱ�����Z=g�ՋSj��l�zqJ�^�Q�4'�p?
3��	~N?7G�S��[:8A�O�p
�+8MLѲ�m"uz?R�q��c�[�.zC�Go 5W����ɖ
?��
-ߏ޶NHڊ^'˔�,��øV��a�>p�R����o�_Z�_Z�_Z���}������۲�g�>���W7[��=<��W�+�q���O-ا>�s�t�y�2-�w����+���s�s߼�S��)t�9�tO-�
��_
-���DrjA�X1�S
b(
uu�e��@
8�pNAt�)��n�)�XR�.�Z�qa�/4��ֶ���ϴw��i��J<Gg��n���V�]��7ۄS*-����8�r�[ʄB��n��C���-<��I�`��H?_"�R��b,[X�^�pR5�F��Ab\9��;<��1?� Ri��aJ�;>j���0;d�In Y&�+�ރ��Ht�R�� ֠�{��>�,�K,�
�yur� 
-M�W�!Dr�`
��
�:~��5�<�YNR�G�� 9J�~��+m���z��[���h\��'@'L���e�޽�߄�'�Z���50۳��ٞa
	4,Wr� ������k|؛�n���SpIA�/��6_�{ۢ;n۶8wl��ʣ�?��n��V�{���#8�5���n��ɓ��k��h^��=��� 
X�������u<-^V6.p���������
-endstream
-endobj
-2478 0 obj <<
-/Type /Page
-/Contents 2479 0 R
-/Resources 2477 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2473 0 R
-/Annots [ 2474 0 R 2476 0 R ]
->> endobj
-2474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.838 467.468 463.556 478.372]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2476 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2480 0 obj <<
-/D [2478 0 R /XYZ 89 770.89 null]
->> endobj
-2481 0 obj <<
-/D [2478 0 R /XYZ 90 720.814 null]
->> endobj
-2342 0 obj <<
-/D [2478 0 R /XYZ 90 524.634 null]
->> endobj
-2482 0 obj <<
-/D [2478 0 R /XYZ 90 520.151 null]
->> endobj
-2483 0 obj <<
-/D [2478 0 R /XYZ 90 449.58 null]
->> endobj
-2484 0 obj <<
-/D [2478 0 R /XYZ 90 386.067 null]
->> endobj
-2343 0 obj <<
-/D [2478 0 R /XYZ 90 77.486 null]
->> endobj
-2477 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F11 613 0 R /F13 834 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2489 0 obj <<
-/Length 2865      
-/Filter /FlateDecode
->>
-stream
-x��Z[�۸~?�BO���
����n�Iw� �����-
�%�d'����!)Y�u|nP�}�$z4�!��
54�Nh����ˋg/�H,����r�X�i���4Oާa�)���~�d2劦���z�_���j[4�|���&5v���./~�`0
M�窈ɒ����G��a���a��#Z'�
���w��A at J��[�q�W,.c��^Z��A�m�ެ�m�={	D�� 4S0�{��"bm��YG���)�|�JJ��}���O-	�l�ʟFx2J��g���2d��	�iެ�����©)�=���X7�_����V�:�h��NOA
�ү�bތH 0��
������.����L�����uU����J{2C�0� ���|lbI-��,k/'��k��է��
�Wrb�Y��v4Vx��f۲�F&6Q\�e�
\�@�7��|�����T(N(g��,x�#��U�J�yOsw��
�
&Q�d�s�M[l��8
��zUTE�o��[�2��	��n̛5Q��s+�Ůg/��z�2���%�f��ˉ�iѬ�*w[2�BB�r��ݗr��甆����ϝ�~G�Ӯ����P��4����3��
-ԋ0�c���.����o��ʛy�2ܼ+�b궑��w�U�)��Us
���W�{�6�������K��8�,��k5,�"Bw�)��
�ހ|d��
i
-�\Opӕ�yq��L�!
J%O�2�B��t�g��yfm�iF�T��Rt��2��C��ڀ�g��
-<�"Y
���0���3�@T%YfB
-���U�T���s�B���!	��>�Ss��ґ:�U�c�:�f�.�-&���6���s|4οp�9޼}����]���o�9xO킑QCIܫ>A@)��o����E����S� �69��1�
aJfޖ:�.@�����|����)��I}^�{�;�̂��Dp�R{�/6ES�'b���J~|k"�bg��,L*g��������2i$"
Xq

��C�ӆ�4��G
-�c��>�X�� ;>�܈4߀��Z���Y�S8���
�W�2G(�t�F\���㪮7��˲n�[�\ q�v��
Rz��
-���e��e��>O�s-��"
*�y9�
�&�U=�]�s���E
���K�<N�L@�Y�8��su ��R+#R���׀� kD�!��
�_P���9�E5T�����N�4�.؃'z��6�s�h1��
���	1"�G� O5�
J��� �u�׶�����Z
n�%�6�����U�R��*o�
6�A� 0�ܠ��b�)=�z���	�46�)f`c٣��
ϔi�m�1 ��q�c�Nw��������_��h�8dK��~���p���f���1
[×e��IP��M
3�'vА�)6MѺ�)\��qO��uty#��ӦXH�;&ԯ!�us�m�dWŢv��ܛ��h`pS4@��Dz�$��uY ���׉V�6�hC��� �aP���D�k0�&\.�ۆ����7d�|��'���ކ.��f�H�7�i8��@��
=P�Pe���
-�
PR$C�ZB�����	&=N�Q����eQ��:d�mv�Ht�E���Ł
�NM��5U1G� {�.�?�k޶�u����8��G���}���P;9X�4�A(̢�N���1���h�(�	�jV�=~C���%�?���m
Q���j�_�5�k�u‚Ŭ���b�J?G�/�SÑ�#�59�Q>Ձ�w`	��:��<{�	APH	���x2��$�=*,w\
-G�
�$3|�`�>��4�]����(b|ҕ��ɢD�m`����8�3�!f`��Э괆�n�+���$c���q
�0N8��@�@�H�c��v��t at 4�Y)f٬"J�!+��G�De����Ƕ��E�h3�vE
-�<
�䝁�
[��I�Z�c=��}m54�Y]�:+![�� <�8`�W�>v�w#3N�+����I|P`SW!�`��2��A��d�u�z1V�I��J~����{:�q�
-�Y
�1��������қ��ԧY��<���N��o���.c���
X9ˈ���2B?�
Q����<�Kޝ�
-0!���p.�*�n���q����[g�.і[�7Yw^S�/�
���x��
�N��=���* ����C�Vq�8Q�V�v`����1��q��
��S7H�O}�S�� 
O�'¢`<������DiquF��HO;[�M>��+s��'�S(��ف�!A�,6�L��WՇd#5
�t��[2�'7"FaQ�󴏡c�
-��
�J�"|���vdm%·F�j�jޝ"��C��X*�Z�/���U�Ͷ
w���q
-@��QAҡ&��߲wC��L�[z7�>��
dx�w#��u" ����n���������^���s���� �.�$�g� C,��t�����
3c��`��C򳨌��
�|����I�(_�߼��JB�y�P��9���Aӈ�
���42��
z
���~*���f�n�0ww�|�)ǝ�1����澔Ӈ��O���	f�۳�'~��b��ў
��}��nȑwk�1wn��$�
9�A
9���o�����8
P =m����<ݱ-���|�8������&��w�n�3��u�
��n�H��w��q
�a7{
-p4�����
�3\��
��⮝�Ue��e�1��uz���<��m��~�T��7y��W�
72TȭO	0Ȉ�\<
����(B�BJ������(LI�T_�-����gϮv�mQ]�Y�>�w=�k.�����m]w}e���.�3�&D�hޭ,�/��"w�{�g�bx��Z$�a�����0�
-endstream
-endobj
-2488 0 obj <<
-/Type /Page
-/Contents 2489 0 R
-/Resources 2487 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2473 0 R
-/Annots [ 2475 0 R 2485 0 R 2486 0 R ]
->> endobj
-2475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [116.949 662.497 162.667 672.843]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [116.949 268.134 162.667 278.48]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2486 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2490 0 obj <<
-/D [2488 0 R /XYZ 89 770.89 null]
->> endobj
-2491 0 obj <<
-/D [2488 0 R /XYZ 90 721.073 null]
->> endobj
-2492 0 obj <<
-/D [2488 0 R /XYZ 90 644.609 null]
->> endobj
-2493 0 obj <<
-/D [2488 0 R /XYZ 90 581.097 null]
->> endobj
-2382 0 obj <<
-/D [2488 0 R /XYZ 90 336.698 null]
->> endobj
-2494 0 obj <<
-/D [2488 0 R /XYZ 90 332.215 null]
->> endobj
-2495 0 obj <<
-/D [2488 0 R /XYZ 90 250.246 null]
->> endobj
-2487 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F13 834 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2500 0 obj <<
-/Length 3146      
-/Filter /FlateDecode
->>
-stream
-x��[[��~�_���Fc.�7m�$MҦ�t���@7A�53Blɑ=�L~}��E�.�xf���(�:<$��;�hv���ˋO//^|aDf��\g�י����(
o���$���/�ʄ�	�>r�����Ͽ�|�m�_^�t���f���ɳ�����4[B�W%���;�i�I.���\��V�'�
-��
�=��%���0A��ܼ�r9�7�u�+�)c���k at yt�a�oĶ��hN`a��L���%4�+A�#�i)����4ӂ�zd�j���#V`�j�_�Ͷ��pU\��T�I��в1͡�<�T����
O�Lg��ɦ.�
����MS�R�绲��*1�����)W��������?Wu��5Ū�vߩڥ�4��jU8�-W �JE%�Po��O-Ww��|�fN'3��3���+��܎(�

�.�Sh���§�g�KW��ޗv���VnC[����j����X��L�R]FB�y����¿`S�8_���8��E�9z�u�z!�wۗ
=�@������8W�>/�`,5D�<.�/~�M�aD��
-�NE"#E�;u�H�b������f��?L||�+�`�&�qCr!:�U#[o�e2
�RtRW�P�n���庨�e]��SM������ѹٜ�'�+0�eBC��
-�|G)
����
�u�r�f(�	{��8ho��:��>3=g���i�����S�wN8��Q"5��k�'��g13j�;̠��6�چ�6t��
-
�
}�Ն�CV�<h�5̈�(����
6��]�
�F�lNr��l��oc��XlA4S
��Zu�O��Yt�1�mk��Т���}Ϗ�2�����&�����8�aY�
������ݯ�3>�1
:Yk��C�3&��� �C������	�3O�7t�HKh�7AV��ѻp��'��]�iJ�F�{)'M�i�mQ��E��{O|G���p��"M��7 ���<�)z�w
q*�+[_����*~�T�Pr�P+x��P��]5���5H	w�@�5p
�m)ǩ���!BKvdv~�薕�[h-
������R����G��Y���mySaOG�������.7Wl
-���5q�ˠ�F��^¥����c�u{w&��2$
���.�C��5��F6�|��������7�IA;�$g��@���)q܄J�g�X!ɑ�fD�  �S��3�
6�}[�I8Ȇm�]s7���n�h�����5�th}8�{l�ϽV�7x� h|��/|���+��3��=�w�	�W�?��gt��!�ڎE���
8 SU@�e^{Re��*Z������]F͝�0�bQ����:1�c�
�V���̫�X�@���d�[
HA�����l��
�����Hy
�������;�a84��uF�
�$7|�p=�.aAi7��~1�`�a�N�D9l�4<Z�al�@��3Tq�P� 6�!��:[���X��8p

mn���01�p9BN |6��b�ad^�y��:$�ށ�cj��2����c��f
���]����q`
0d����UgD5�����VQ%
[�4dh0s����}
 \������kSW�֨���x$�Q>�대a"i����������
W� ��m�&��E�'eG��J�

w���w(�P��:�=
���
@#z?�\

Q�����
����	��U�)L�C���X|
�C�N�G^�Ӗ;7��벂���i2�YZ�26;!��?���40�v�ЯbM	�D�X�m�%1��D潘�>�X�{7S��	�J
pȹb���4T��3��(SJ�!4�	q� K�.�Ɵ�-�-�����4���� ��./
�
�P����w��N;	��C�~9%(���>s�Z�C�
�<�K���F
��~U�͒�Nܬ�q���J�R"k�A����`c)JE7D�;i�8�0�V�=
�W-% �W
#�%%x�@�XoV!���.F�� [...]
-�0����RtGN�Qo`L'ʳLY
-�ޔ#�ڎ
m ���,C(�;�7^��zc)��V���j��x�Ε~uϤ�E����hD�8
���Mc
-`L���k�,M��#E#�k�S�{M
,.m��Cʻ1��h�ilwG���u����Ȃ���	�S�w�
܁?�p�A.��N���I�\��K��ݭ?���&�:��[&P����A7��5�Q\j��}j\�!��
WO���^����}ݫb[͛��
-o ��ƒWMQ�?�e��in�.}��E��y����z�F��
�=.yJA?�˝
-
R����<2�zBڔ

�Iw
1?
k��.u�a_�C@
l���,O֧��%]=ZG�O�)����WLx��C50��L
^uN��sN�v)��|���͑�t�Gj	��|a��yr;߶w�M�8\e��U��)^��ڷ�#G �m��3��{,K
e��^`K�5��⍎�>t.�
YD7�Wo����H���`>�
-�
�;�)@�
��x�{��a}�&~�s
f��ys���xLy>pa�*�O9���a�
-�w
�<���S���c2�e_�y�s�����Zc��v���ϥ;�0�Ư�п	�w�(��NH�
�u��<9�q��Αir'K�c^,$w��5���������u�KX�3u�KX�KX��%�q�@@�����Gp3 at r�]A��
-O/�`�פ��-h��"�p��.�i��{B�e�p�אX�Γ�*�2�xĘ�x]B_� �ҋG�І�e��:l�X�^<J	'k0�w}
S��ұ�m�
�R���N8 at z��>�7�" RO>��ެ��pq�Od��3DY���O�)�h��ƴ��7�����"�K
���f at o�'��
�HK�!g.=�t=�C"X�׶h~?Uj6�ռ���|1C8�� *!�F
����)�/V��[���ϳ~�$J�G�����Ww7 �7dQ�������:�Iۛꞙu
#��B�q�P7� ��_�s"�
-endstream
-endobj
-2499 0 obj <<
-/Type /Page
-/Contents 2500 0 R
-/Resources 2498 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2473 0 R
-/Annots [ 2496 0 R 2497 0 R ]
->> endobj
-2496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [116.949 265.405 162.667 275.751]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2497 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2501 0 obj <<
-/D [2499 0 R /XYZ 89 770.89 null]
->> endobj
-2502 0 obj <<
-/D [2499 0 R /XYZ 90 720.814 null]
->> endobj
-2503 0 obj <<
-/D [2499 0 R /XYZ 90 482.328 null]
->> endobj
-2383 0 obj <<
-/D [2499 0 R /XYZ 90 333.969 null]
->> endobj
-2504 0 obj <<
-/D [2499 0 R /XYZ 90 329.485 null]
->> endobj
-2505 0 obj <<
-/D [2499 0 R /XYZ 90 247.517 null]
->> endobj
-2506 0 obj <<
-/D [2499 0 R /XYZ 90 184.004 null]
->> endobj
-2498 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F11 613 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F13 834 0 R /F75 554 0 R /F1 833 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2512 0 obj <<
-/Length 3477      
-/Filter /FlateDecode
->>
-stream
-x��[ms���_�O�4�pxqi;���%i�s�ә�enh��9�H��sq}w�B%˶��i���X�˳�5�\O�����gϾ6bb��\Oί&�N��DixZL�L3�fsF)�~��'�9Wt�}^]��ׅ����U~���f��ُ�ߝ}u~���Y�y���lr�:{�#�,���	%�f��n�j"�������g4,��-��b@�1"�=LO��)f�D3E�>H�N�"Z�Y�I��$c�BL
��H�ٹ�}�Y#��E��$�b�C��i1Z�M���r�F�����|�)��b�{s�s��7�k]/�n�ESW������M��\զ���g_3�[�(����!Yo�&Z��
NgS�G���dqXS��bST۲��k���u���ɜK�Ø�
$Ȫ ��r	�t�R+�f\O�Rʫ����O~wu[]na���X7��u��ľ|�[yS�,����;?��&o�KP��?��0���oۨ޶Ȕ�-֛b;�
.�e,"~�Br�a�~�*J �
�㪷;x����
�������j䜙��2��r
vl���QS*`=DZ���]y ���Io�'a���"T�hi�`�
-cho6z�`�
tJ���87ĂR��rw��d�ƭ���mX+5
��
�8Y���r��]oЯ#�@����DX�>��7ES�)�&*�<���t6�7�3���	�"K��q�f��s����ğ�|����� �'�F�f��	��ڗ���LL�D�Ly5cj
--(CYV[�D��_T�]�ֆp�r���GII�[��b2�K��9���l��
�2o��bYlƄ�Zb�ǣ�f�����u�d]W�plu���̽!d�u4�l
 ZO��38v
NL�豧��f�Z��]����`���ZpC���[Kt�bCG�u攂&��������B��]��A��5��V�����n�j�� p�
�6)��MP`�Ayz��j�uS���"��JOWE��R��ʡӟ<6��ֿt(
-z�겮.���ޞ`7���75v�/��L�v�1I�(��V;���M0�R�dznf��#��e
-��I|�p
0Q�1Y7|Z\������C���a�uQ/� 
-�?��a�Xn�٪�uS_7��?$
Ye
�
n��#�b
�&8�!
���f~R�"^^��9�
-lԕCtЊG��p)~
�FnAkQG��L����V�z;�9o��*�|[�Á "žh�
ϐ$�'�Ξ@�{�\�QM�]��6�%0�
-��`	<
1�F��?�3K����ݺ������W��:��%��_FH������BN�O(@��7�|7�F�%��m�� 
=��,�e��l9�j&@��3Ʀ��L/��է�^�ly;���E�C�M�?�nwvcH�O1{ 
"�v��*D�;�J
-�I���j[���8mwR�MB�d�R����V�xpwZ����$�K4�h�}�zd>�A%O3�4�0?
����*P� ,l���;��3�ɮ����&�ۙ
��rb>5�08f��ݤ�q
-�2��EeX�:kpL�3�vTw��a����-��I��A�fY���
-|�L���%B�~9�<)��#��rQB!�KV7����\�l/O%�h��Wxt�#:�0J2'�d��N��M)C��Q���z��
B,"��d�~m�
��� ����t��Z
����[��tG
�b�M@�~
�G�U� >"�=†h,�v at 5��=Cd�����;����Ty��
�A�u��/ꛃ���ʟ�p��pJ�xq6y�pݛ/^��7�?&̊��=Pe��9u^��##e6��+�G�4P)@�6��~��CGT�+8(b��d�c�@ӹ	
��a
�l€*�_6����(�~�;���FSL��  �@ˊ~ƀ�z���~�s��	�����p?� �?��4�L-|�n���26�I/��is�^�����_���^}�����z[. jG��y
-ڪ
�˪\a���<į�}�9���Dt��z
�A^�"eg .�'��^MA�������GUqP*�
D����?�6%S<�bI	8]�ƞ'��$L p�x⠴hA�>��� p�k�!�w��j�
:���k�rL���l.�
-|�נ�����_���F������>�d:ۛ;�>I�i�
P��.S
M^g���
Nq�^8����
0-Z
K�b)F�[2w���iYy�0���h�d�B�����+�%���
;L���#�t�a�Ey�T��C�e}�o������a�KVn���`��4�"1e��s5 �Ij#���_w�zwY���@�nPGg��n� �fB$Ӎ_Y�z����ۆV������#	z����}�
� E�p�
[�f�ӫ������{
.��F�Є���3�B6�m�X�9�\�Sh��P=�C�#���3j����ֶo�!�Zo��$4�
c���c���k�5숵�H-s�������p�ĭᆙ����7��=�r3�c�11���7�@Mh��g�yW�� �.vM��r��c��l?���߫��4�
,�"Ʋ���1~_����c��|��J-�ï/|��|v�K~����W���0$x�#�����:)$x4�]g���O�,$E�^���T�@�Z7�w&R�|)�*��e��}(>�$f��kt��]��ͩ|�S
�9�Z�c�
Q)�U�R��&[y�+)b�[
���@W�}�	T�Po�H9nu��
--ّ��}�sV6
��0��J [�ôv8�.��+j
���.�PB�U l
-6�"]�U:e����.
�H�C
��©�f�S��@�6z-
���̨�.�ͭ�g���MH}J[rj�.����{�����9��Y�"�yH1���2Z$k�X��Ց~�E�-k�������]
S����EWGԢ��֢�c
-��
������Zt��Zt	x"Ԣc�F:(3v�faB
S��H��$��FS���i�Eg��Gݳ
X���+F��Ma�Hq
�Jai�r�Kf6���j��1�S���p��߾]0"�=�-Ò	���v.���/G7|o9�e��v

YE���p���i�.+Օ���IU��*
�CU:6C`£`��`��a���
�_��&
�J�
-
�:2��&��رQ��:�}�G�i5�&c�.y��{�>���0�)b�T��
���
�Q.v����rC�6

7�^
-Hާ'���A?�0ֲ��w��
- �t�|���LW��ж=P�n�������X�+
�v_��t�F�T�۶�
��W�1(��+�A69 ;9�'�U�?:��	E��	C��

�Ӛz�=��Kv
�@�5^维�D�!\ȉ��
l�sS4�)5
�U�2�n�oc	N�5_�����
�gF����N�������wKa
-O�����v��ٳ��kŮ�e�ڭS������`1+���0�p�$Vc��D�3
9��x��nD��^�CdzoWb�������
2G�
-endstream
-endobj
-2511 0 obj <<
-/Type /Page
-/Contents 2512 0 R
-/Resources 2510 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2473 0 R
-/Annots [ 2507 0 R 2509 0 R ]
->> endobj
-2507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [116.949 534.387 162.667 544.733]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2509 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2513 0 obj <<
-/D [2511 0 R /XYZ 89 770.89 null]
->> endobj
-2384 0 obj <<
-/D [2511 0 R /XYZ 90 605.108 null]
->> endobj
-2514 0 obj <<
-/D [2511 0 R /XYZ 90 600.625 null]
->> endobj
-2515 0 obj <<
-/D [2511 0 R /XYZ 90 516.499 null]
->> endobj
-2516 0 obj <<
-/D [2511 0 R /XYZ 90 452.987 null]
->> endobj
-2517 0 obj <<
-/D [2511 0 R /XYZ 90 214.5 null]
->> endobj
-2385 0 obj <<
-/D [2511 0 R /XYZ 90 81.969 null]
->> endobj
-2518 0 obj <<
-/D [2511 0 R /XYZ 90 77.486 null]
->> endobj
-2510 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F75 554 0 R /F7 795 0 R /F1 833 0 R /F10 765 0 R /F24 529 0 R /F90 758 0 R /F117 2446 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2523 0 obj <<
-/Length 3449      
-/Filter /FlateDecode
->>
-stream
-x��[ݓ۶��BO�4�`|t��$m�6�S��Ng�d<<���D"Jg���w )��t_�K��#	-
`?~�ܣ��������
��p�����k#&�4ד��$�#3�4<-'淪�~��f"�%,����߾����w���W�?]0��N�_c'�����d	����"��O�h3�\�u=yw��
	�
�@�Ƃ<�E����t�/6�u�/P�������Z�J�;O�6�H���E�o�ٜ6}���O-�5�}�	��)�}�8�rZ�����f�o�(��R��m
'�ͺ�;�0�	G�ߴ�3���z����X6	�D�QB}$���U�7���޽z��׉�MF����o9�FG��)�Uq<���h�ǘXRC�b��?��21+g�Rp���fm��Dz�N̫9�V�2�VD
�;w�b��,���L)���Z�˺�
KŴ&`�:ˈP�9B1�
ʇ�X;�w`�N�����2S����A�-������M�GXҹ��ؿH�<��fY�֍�-�
�ܜ� [...]
-1���wES\5EU��O������/&�
��/߼�7�?D�H4���)��T �;":���5��˶
�ܾh�xv����ϋ��u��U:�l�6����	
=���a�3l�
��SW6d��
�a&��T`��U��wl�� D�4��h�h�֧��$�T�����9V#�#mά&6H�Q<^������t[��
0���n�u��
���;�Û�o����o��Jk��]JK�\�Q}Iܫ΃lʪܔ�)��j�L�a�&G�^p�H�����9\
-—�O׽�F�
ٸv�
�Iu
�m�&'
-�6�
-��qN)��?�U)�!l��7��#6ll�N��T)�y]� ��CeI8�	���	g�A��Z���s�q�[;�
L�y�5p#��,��rvϦ.v��
H|U�䈟>�u�G0j��㺮����M�
o�j�#�x�rײ
Sp���
��hXF� .���?"|ɛ2�Z�¡�Z���!o!d��"w.�=��W5�#�O�Wq�g�HD�d2�1�� �E�J�9���'L2#�Ke�^�h�A�����B5�6 9�(�H�&�)��D�Cf���^�����LIH�
-���#yL��J�a� (ȣ�<׵�ۺڇ�������ks뗯mT�R.���8��3�Z�,<
6�KB�Ħ�X��HR�'�E�:s
�&c��
s�<sXLݧ
=�G(=V��t�ϾG��$
~u^��0ց~�����rt���
�o�!��O7E��>���
�Kl�У!ASl�b�"��C<��o[:�0���Λb] ��n��W��(�g�Ι�WŪv���ۥ�e`p[4@���e�I-k� �]�˻�V�9��
H�=@��W���
D�{{���#м}�=p�-�D��W|�[�
����%���(}�H
٤
)���#%���.�Zߏ��&�ۉT��
�3a�� 28nK)���CW_�V=O�$�����q��V{�w��rʮ�J0�X��.���^�B��G�����/��Η&<
:
�������	޹�π�PIw�
1�P�٠i�
�$

l�1dž(�D�o����^E�S�+Rn�_B��s�H3b��e׎a���4�W�yQ���\�@v� �,�A�{��<I�҇�6&��N>�C<Y�N�3�γ|������Z@��(
"
�� pOY\B� �0��w
��)m�3����3�!�r��ƿi3���Eco�x��K�H�K���K����K�1��O&�y	
��D
-�|�,H��7�S.�Q
��xҾ������8��d��Ƃ� �h!�lћ�����0p���}�eX��H 5�x�s�B�?�����4�C2�Nm�
q�,=���tqӅ�H��m��8�B*��˪�V
!��B:^

ʉe]��T�Jʥ�K��8^s�`'� I{D�t���Ƭ�s�DI�g哤�Ïx�'v"_�Q���
3�EL�#��K�O����'�Sy8�i^�Dg��
6і�����B󃢐��C��T=?������{+ �U�K�1�K�N�z�Q$?�5����!0�ȟ�P#Le�G��g���Ϊ�IT_�צ�K:Ц3U����\�u�M����]�N!�c}��_�����B�d���Г(�.�_��a?_�8��#
->s���T at L�U���v%��z����J��
��ᖥ��LEqr�"���0�v]���V�[�W�@��?j�ے������7E�2�z���>�P�
Ce *�E]-ַ�����e�P��C3���p�rTZ �L��(��:��3m}y! ��a
��W�X�����>{�p�
-�����z� �`���X(�vdps���ԇ��E���8 ��7��W
-׶������)�mG��E�y�y��O� �?�.m`bz��^�OZ3���\y�P~����P�M���Zt{���[G���W��3�
s�i/��)�؞�;��*]M2�v�U �/B��n+�.���.��a��nk�U�R�q]m�LO
���Bw���n昰gr��f�dZ\����$�͑�o
C���
Ip��3�
����t8�1m�p�����y��C�s4��z��\CE6F�3W�]�
�D�%���1���m<%��(CW��Y�U
�����]�
�ˆa�4~��O�>���*��
-q ��L0(����ׇM3��`z}��J5���ND����?���ʰ^����f�}�|
�����t'��O�)�|�ܹ�u1�û\b��k66�@�@+�kr�Ģ��1q�`�:����uj̹G�$
�>M�X��� p$�ɣ��
�=� �&,�3�yb�}` <3;P���g^��ަ��Dߺ~p�:�v[����_��{}����o
}�r���_����� #Gl\�q|F�:�k�f����#.�m]��i���r~�]?�?��N[���
+����3\��B
�O�~'�!*s���HK�Z����~l�	/���?����n�����Z8V-}�N8�Ľ�N�査���LAd��o��6_�{ԙP����hd���v��}!�c'�_/�����T��o���/�n�wEuM��8H^�2�����A�M��T�~Rum�q���/ ��
-endstream
-endobj
-2522 0 obj <<
-/Type /Page
-/Contents 2523 0 R
-/Resources 2521 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2473 0 R
-/Annots [ 2508 0 R 2519 0 R 2520 0 R ]
->> endobj
-2508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.529 650.542 197.247 660.888]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.529 206.226 197.247 216.572]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2520 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2524 0 obj <<
-/D [2522 0 R /XYZ 89 770.89 null]
->> endobj
-2525 0 obj <<
-/D [2522 0 R /XYZ 90 632.654 null]
->> endobj
-2526 0 obj <<
-/D [2522 0 R /XYZ 90 569.142 null]
->> endobj
-2386 0 obj <<
-/D [2522 0 R /XYZ 336.065 288.902 null]
->> endobj
-2527 0 obj <<
-/D [2522 0 R /XYZ 90 282.262 null]
->> endobj
-2528 0 obj <<
-/D [2522 0 R /XYZ 90 188.338 null]
->> endobj
-2521 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F13 834 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2532 0 obj <<
-/Length 3186      
-/Filter /FlateDecode
->>
-stream
-x��[�s��_��R�3�$/Ӈ��GҴ�N��!���e�'�
-I���뻋(R�d���L�?������4��"
����7W����(c��6�YG��1c�j}�L,��<��g�-�����yuw��
-����f�/�2MT�j���WW����J�,<$հ$�����~��
-���8SYݻA�HK���۫\q�`�ˤ�&�x�A�Q�4c��(�e�4�f!u�7�� Bĭ�k"yv��]���&+�)��2�f�6���
-d"�"�5��{A*��b�'bi��F"�`�I at Q�x&i��mѽ�-�u� +(h��m��:?Q';� a-��N�[\+!�}]V
�GW�~���]ޕ�
v���t��B�8�
����5�n�z���Ӡ�>Ҕ��p&v�YҀ�j;��;t�	��0���_�o���%����\
ވ�ڝ���`�]�B�qY�!Y؁+��m�z�V��;V��^���y�o~*Vlq�a�n����d�rIx�̷�z	�{�r�I�F���aJ�oߌ�4���޳��ҌƼ��C0`ڦa?�6'�G�R�o��4Hd:H4h$E��,
�
��&�����ϩ�O&�`6��T��t���',z8�]M [W�o�{�Yh��]Q�e]y�K���
G��k�R<a]^a�28�RA��"��`�"fV=R�]�
#,��g�E�������XX��E'K�S�;eN�*�(5�|���	��I�̢�HDm�
Q;�Ԇ����6�u�
��P�<��V$d0�~kN[��fc���{���N[�T�/��e [�	b+f����A?�x�>��pb��~,��)�O��>铤�A>�c��+��ε����#~��g����W���&���0�������g��˩�s������
&ϔ7
�(KY�o+�1�HmB$�֡�7%�m&`�u���h��
Oá=���h��0�2!&�A�}fNC�Nq"�GǙ������P,4�IcB,����ր�����#�
��>�5܃���
�n@�ArX�hJz�3��ucX6Y8�,�i[pxŹ?Ll
3�Ng����-�*
�$�Ի*��̺h�Z�Gl�č.�O'f�&aR'�#���\�z
F���2
��&c���+�ؓ�`��9ხ��Y�A at 1Lf�f�tI;$/�$/.�Zi&xzB!3O�}���i�F�
-f�7�U�$�#o!=}K90XH���Rv��d�O�>>Q���c����e�-���ɤM�:�[������aS����k��B84{��	�Rf,��$Ħ��d
��Uf6���%���;*@
B�^3�I�q
9:b�\1@
�Fiw�t�~������#ևj��(a��9�8ކ>�y(��wA�e���\n�g���O���aWNc	��3�����(���yV��^!^Z�C�A6��� D6
���UH�o�C�*Vo��	
T5�Iy�dd�Dm�a����A������'\��p��J`� %�a�q2���!K!�(��c��ɾf1C@�m�09��7ij��"�~I���g��bT��h]���M^��P�� �����)@�@��*](�9�4�����q>��g��}T~��4L�
-��D�
rZ��(8t�#�S��"?�[RNE&���;�I�yJma`�f�K
)1]s9#N1%�����)[R���8�`������gQ�;�'4�2�X�?
�s�
�G��Q�'e:��������D����_8
-|�"S
�VR3��c�;fjo�	�i` ��M��6(��S
D�sB!��Wn� �b���g��Y"~�B1��
�\4 �~��c�b?�%��\�%���z��As�6;�����1$Y�)�ԇ�옉d�#4#d�I�4�
�4Oڦ�2�(F�o����7�sen�
-�PDt�bzaM�8�{S�1%)�����NgTr\��89{5���M�Fo̟℀�Z
���Y��ڸ��E�Y\vԿ+���k����]�vc9e������6�L�$��O	�7���n„��zf�_�&�iē8��2v�O��;�ԇC�iT�@9!�t��H
�nN�P)-���L��{�|fq�Y�e��5�{
��'/����@/�
#
c4�	��"�
\C��/ݼeK��s,�<Ͳ� ����-O,:�����
���d�3'k���r�Y���u�
-
-$E�s��G
��
4l�y٪�]V)���\<���?�c��L��_%t��P�j/��
%�&3��UM�5*Fͮ�
9M��j�Z(�Er�@�Y���:%s[$�'�i�E�<@T���W�gV�jm3�} �P�l���0�4Jd �D	�a�N����#?\oAѠ�g�w��Fi��3���?�XEQ�
���NjXeC�u�dړՐ%�[\�K��T� �ٗQjA�,#�.o�
l1�޼�o�G���P�Q�E�
h� ͓,kQ�|�c^�N��
����5�j�����n �mO^B����4�c
ç,�1�n
�<��@k��,��A(.��b�i
(ԥ
QP�(ԇS(�)���Uٕ���S�p�Î�T4�{,��6ž��>
��rS,�-�Aϊ8���?�)x�
�G.۲*�dp4�[�
-�gld��0z� �;�c����`����)��nC-��0|ˉ
[g�!����o4����t
�j���+������2�;%?�
��6
az�(�����j�$�K��
7�nV�+�w�;Oѡ4ʸ���
Qӯ�-X���p
��^��Ŷ�����S�^PY�N��مÀK8�C����B۰a���3��`-!;l���T����� 	�$�ݖ��m���m�e��=�T�m�[g�p��!<�7��^\�

��?�*/�
�C�``".�Q�ù�R�{���o�����9���;��:Z�
��YCG�����-��(MGM���>����$�N�_���}��jn]�C��A*k|�nr�x���]QM��M{Lh��%,ހ�E��QF�@
��
�>}
�|"�S�� 0�)��՞��	3ّؤ����kj��-��,����˫C�=�w��i{l��`}��m��lD��(��z��*�@]d��u�u�7�_�
�����4<
֑�o�x��!)���3p�+�\�M�e{R�C*I��	��!y�"qU�
��fx�w��r��/j��#��_�`5�
-endstream
-endobj
-2531 0 obj <<
-/Type /Page
-/Contents 2532 0 R
-/Resources 2530 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2538 0 R
-/Annots [ 2529 0 R ]
->> endobj
-2529 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2533 0 obj <<
-/D [2531 0 R /XYZ 89 770.89 null]
->> endobj
-2534 0 obj <<
-/D [2531 0 R /XYZ 90 720.814 null]
->> endobj
-2535 0 obj <<
-/D [2531 0 R /XYZ 90 482.328 null]
->> endobj
-2536 0 obj <<
-/D [2531 0 R /XYZ 90 273.098 null]
->> endobj
-2321 0 obj <<
-/D [2531 0 R /XYZ 90 249.726 null]
->> endobj
-2537 0 obj <<
-/D [2531 0 R /XYZ 90 249.726 null]
->> endobj
-2530 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F11 613 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F13 834 0 R /F75 554 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2558 0 obj <<
-/Length 1609      
-/Filter /FlateDecode
->>
-stream
-x��XKs�6��W�rƂ�7�[������j/IF����$�����.^�
�ǍU�D�.v�}ؚ[��8�e2:>�}+Ei�E���J�)
-#�˭�v8_'�,?J��F@$gO��&gW�;�6:����\X–��C'VV�>�Vӟ,��4�
��
-<��u7�}��(�y���x&)�8�b�Gi����
��l�:>��I��8���ž�h'
�=7�yU�`�a��U�f��t\l�����Bږͫ͹n�Z5SsVu�Q?r��^j�
�jb��n�PS
R兡��6���IC��j�n�P�#i*

-�(
C��ㆊM��#�����LS5(ج!�ʉB[/8�SC-� �eê��&���1G��u
�^�ߖ*��?h���u��~�.
-�'yFU�!g�lj}!Ѝ}RDzeA'�R#Xd�Z�9�bϮ�������d�6a�����T���Ѻc�R4R_�����	������(��Ѫ{��
���
Y���s��r�m9R1�?2x� �A��1�б�~�
+V�3v1��)�X�	������e	r��F|=s�M��ztZ������6iJ��5\HiZa�Q�/��I�g�֎wE��=�+J�7��ټp\�^-h�<'C#7��"��1�#S�K\�8�W
-�-�o����*�Lg[i
�@q{`X�t-����X��q���
�^E����Ce�G��k�
�q�s�!m_��#�	(���
�x^�Ak}
�xM(�(l�̵�n�6!����
�x��(�o% JH�y(
-< 7@�),�¤�z�
�e5��
��
Q!4r`_l����^�[@z��R����ۗ�>��^7$+�O�#�Ȝ
ԶY�)T�N�()�P��ԞQ�ee]P��$�ba��hnPC��eH�V�B��YQ�]f⬅^�ǜ�^����GN>���B#I
ej�0����J�0�����7�
���mⵢ,���=�
�ˉ(��x�lj����9H�Z�S�^}��||�vY��c������jzk��u�o��?!�$����5� �R4l.�~���:�v��Fk��ZOL# [ɷh�������/P��RY��24�̒��G'��<��B�E�o�
���ȣo��Z%"���-�pP�^���f���rOJ�k���7�
 �=���1�
n"B��D
yXN4�&�@��ղ��S��GU�6[9����a���UM����>����Z�X�l%�샢t!M&�̶|��J a.L�۬&�\����4?2��j��T�1̲��(��
-�FYh�w��9Bۼ����ijÃ9�Q:W��_r��S
��v���%q=�(�jmkq�A+�)�]CD����}I��XY׼7T���c��Jy%�_9�~dV�E���NSg��\���=���a�t�X́鳨�D�R����`1�

��y�ܹ��7��;���{l�=��{�a�0����Z��8����X.=q|Q���vc�7
�7�P�M\�%��7����o�N���ji��/8���p��ü+
�c�1���[/���!<\�'
�x��/ދ��O��g�yK�9�Ԯ/
�)\������K�����-o�x_��
-endstream
-endobj
-2557 0 obj <<
-/Type /Page
-/Contents 2558 0 R
-/Resources 2556 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2538 0 R
-/Annots [ 2539 0 R 2540 0 R 2541 0 R 2542 0 R 2543 0 R 2544 0 R 2545 0 R 2546 0 R 2547 0 R 2548 0 R 2549 0 R 2550 0 R 2551 0 R 2552 0 R 2555 0 R ]
->> endobj
-2539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.107 508.114 216.873 519.018]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators) >>
->> endobj
-2540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 439.05 180.37 448.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-2541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 401.176 170.956 410.022]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-2542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 373.18 180.57 382.026]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
->> endobj
-2543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 343.126 198.482 354.03]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-2544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 316.106 190.183 326.034]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-2545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 288.11 210.149 298.038]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-2546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 261.195 168.495 270.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-2547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 232.118 192.544 242.046]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-2548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 203.146 213.018 214.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-2549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 177.207 179.274 186.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-2550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 149.211 177.591 158.057]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-2551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 120.133 200.833 130.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-2552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.161 185.9 102.065]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-2555 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2559 0 obj <<
-/D [2557 0 R /XYZ 89 770.89 null]
->> endobj
-118 0 obj <<
-/D [2557 0 R /XYZ 90 644.138 null]
->> endobj
-1575 0 obj <<
-/D [2557 0 R /XYZ 90 607.282 null]
->> endobj
-122 0 obj <<
-/D [2557 0 R /XYZ 90 607.282 null]
->> endobj
-2560 0 obj <<
-/D [2557 0 R /XYZ 90 525.16 null]
->> endobj
-2561 0 obj <<
-/D [2557 0 R /XYZ 90 457.033 null]
->> endobj
-2556 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2588 0 obj <<
-/Length 1072      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�8~������Z���}�ۦ�n�z�)�02�	� Q���߯�$�z�dMY?!@���w��� ���`t�`'���
-L��	
#y�w�bw�B����!�$�����=]
-�|����;�B�|$%�+�R}{CWT�x�P�
�x2�q�~�����
�t�͆0
��
�}E`)���1xl'� �|y-����2�>��!�(��?1�c���i��3p7
%�� um^(wDf��i�((S�t���ut9��XZ�e��`x`�C�p��_hR���
�^Z�.��7y͇\�5t���o**���M²��8t�[G$
�~�y��𚳺$gMr��Zv�I�k�|e�hm)��^���LZo����4\�
��Mn�F����U�=PsG~=^�db���[�J`&3\"�&7� M�٩��&+�6��O�y��
�ye2����G��`Ρz��
e:~�2��6R�}��?F�U:�;Kg at R1��s��Є��{bQnv�ς�Ԗ�~;\Y
I���R��۞��R4�
-��j��_����ɖHW�ZRX�6�_P���Q"��g3�5-�$�e�2C�~�\�5�.
.%βd�U�����@� �.,����=�ڨt�i�:�
�X�?ؠ��*I�g�ȗI����Qv�|GX�^�=}��ޓ��|N�t��liC~��T��M�]f{Ϻ5�����8�.�_�w��H��׫&?�>4�'n�QW��mfVK����
Lm�^*N��9���n�F-v�wv�}�E�Пe�۾��x���t�OY���x>#�f�iΈ�$�*s&�AǢ�i$S
w
����拆��#?W?�O����qF�5&��C�b�{���3�����
��1��
ٴYY�!��G�Hj<8�`<�@z%lם
���3vH��o�ȃ��?�7�����%�b�����l�A>�T�ᆡc�]��U��D��صX"՗Bw�K��R[Yh��v��W� ��'_���7M�j4Z����
���^9{8&�c��vJ.�կ��J&-�!�0�<˄$�� �}�c���?n_�̓�U�7\����/�Pvt
-endstream
-endobj
-2587 0 obj <<
-/Type /Page
-/Contents 2588 0 R
-/Resources 2586 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2538 0 R
-/Annots [ 2553 0 R 2554 0 R 2562 0 R 2563 0 R 2564 0 R 2565 0 R 2566 0 R 2567 0 R 2568 0 R 2569 0 R 2570 0 R 2571 0 R 2572 0 R 2573 0 R 2574 0 R 2575 0 R 2576 0 R 2577 0 R 2578 0 R 2579 0 R 2580 0 R 2581 0 R 2582 0 R 2585 0 R ]
->> endobj
-2553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 710.014 154.368 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-2554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 679.922 213.595 690.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-2562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 651.887 273.36 662.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-2563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 623.851 220.22 634.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-2564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 595.816 216.365 606.72]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-2565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 567.781 211.912 578.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-2566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 539.745 271.677 550.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-2567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 511.71 216.355 522.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-2568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 483.675 183.698 494.579]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-2569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 456.616 194.218 466.543]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-2570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 427.604 246.252 438.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-2571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 399.569 235.154 410.473]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-2572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 373.591 156.022 382.438]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-2573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 343.498 180.928 354.402]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-2574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 315.463 195.324 326.367]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 287.428 208.036 298.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-2576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 259.392 247.638 270.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
->> endobj
-2577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 231.357 265.052 242.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common) >>
->> endobj
-2578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 203.322 247.339 214.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common) >>
->> endobj
-2579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 175.287 245.117 186.191]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common) >>
->> endobj
-2580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 147.251 237.934 158.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator__Common) >>
->> endobj
-2581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 119.216 248.305 130.12]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant__Common) >>
->> endobj
-2582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.181 279.478 102.085]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant__Common) >>
->> endobj
-2585 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2589 0 obj <<
-/D [2587 0 R /XYZ 89 770.89 null]
->> endobj
-2586 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2619 0 obj <<
-/Length 1311      
-/Filter /FlateDecode
->>
-stream
-x��Y[w�6~���p�&�
}�8��Z׍�>4��Q@�9�"9N�}G7|���8N�$!��O�fF#	Y

Y:����� �b7��}k:�bd
z���+�����L?[A?r���d�����|4��������A�<5>t����d����BnG�Z�TX=?�2�&�?:HCAې�h
���n/���繞� \�~(��a�U7D�Nr̘�p��u)�Cd�����g�����IMʄ̆�(h�#s�<��+\�����n��[]��F�)fđjY��ZUj'�B�,A���SU2Z��@:��6@
/��
p{$u4>��[�4�4��k
-�����WS;̫3��u���O%'N�
�C6�L]��YIp
5O
P���ZL��
թ�x�O�Ax�:Ahׄ�F4%b��d�ε�,u�4撯xF���U���L4�CR�Lh��\����o� ��	�X��=B
}��l��$c/�VE�����|
��{���˿Q0��g��	���;_���Y&0�Aw*4�PT�y';*wCzÓ����,%e�3��
-W
y�g�����@���[{� ١�j��,=,_����ޟ�k#v4��4X��n�g5����%�d��:�L�EI��w|d��BC�YCyT���-!�LW�ܽ[�WƾI9�M�tF��\O��l��lIӧ|Ua����Z�<�

a��5h��q��K��_	��z%�"o���k`r��$�c�wsߚ�k�:MTSh�k�h9�o�ɳL
I���˱
8�\�<PT�T
�%�C�6�ѰG�ق�}&��Z�}�[
�����
��G��4qRTTM��l�25�p������:
��%)7��&a�Iɜ=%��*P͍s��{wT�>#��EV
��&��ȷ׊Ϫ��GР�*��RQ���~��x��U�
��ZfƗ��U�n��
��~.��=0�ˢ>���sq��t[j�ľ<��r5�3+�b
�������S,����fo�|�C
?�פVG�Z
R�V	o�w`y;��R�_�bF����/g���^��
p	a��pӣ�@�Q �Y:�-�3>��)�2�xf���M����

�ٚ4w�B���[w�Ty/|
- *`��
U��
�x��Fk~N~ڻ�_������$�8�Ǯ`^+��Uq|S�-�l����?�ѷƭ������k��
|ٹ]��f�n8�T�aq]���4/����s{��������?������N�~��
-���;�����|�E�u�u�=!� ��_�#o��'�a���%��/''��#��Mh�%nDZ��ۜ
-Z�Ac��c��/�;��
-endstream
-endobj
-2618 0 obj <<
-/Type /Page
-/Contents 2619 0 R
-/Resources 2617 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2538 0 R
-/Annots [ 2583 0 R 2584 0 R 2590 0 R 2591 0 R 2592 0 R 2593 0 R 2594 0 R 2595 0 R 2596 0 R 2597 0 R 2598 0 R 2599 0 R 2600 0 R 2601 0 R 2602 0 R 2603 0 R 2604 0 R 2605 0 R 2606 0 R 2607 0 R 2608 0 R 2609 0 R 2610 0 R 2611 0 R 2612 0 R 2613 0 R 2616 0 R ]
->> endobj
-2583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 707.957 282.746 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference__Common) >>
->> endobj
-2584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 681.304 190.901 691.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-2590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 653.674 201.601 663.602]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-2591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 626.044 217.471 635.972]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-2592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 598.414 219.115 608.342]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-2593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 570.785 220.778 580.712]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-2594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 543.155 201.401 553.083]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-2595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 515.525 202.507 525.453]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-2596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.544 500.061 273.474 509.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-2597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 486.919 209.71 497.823]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-2598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 460.266 210.268 470.194]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction) >>
->> endobj
-2599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 432.636 229.087 442.564]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction) >>
->> endobj
-2600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 404.03 235.712 414.934]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction) >>
->> endobj
-2601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 376.4 255.637 387.304]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) >>
->> endobj
-2602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 349.747 195.872 359.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
->> endobj
-2603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 321.141 247.189 332.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-2604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 294.488 205.835 304.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Domain__Product) >>
->> endobj
-2605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 267.939 187.005 276.785]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-2606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 240.435 160.373 250.34]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-2607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 229.35 174.034 238.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-2608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 200.639 211.124 210.567]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-2609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 172.033 268.947 182.937]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-2610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 144.404 286.66 155.308]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-2611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 116.774 284.429 127.678]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-2612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.845 102.286 197.225 112.191]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-2613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 89.144 269.505 100.048]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-2616 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2620 0 obj <<
-/D [2618 0 R /XYZ 89 770.89 null]
->> endobj
-2617 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2656 0 obj <<
-/Length 1180      
-/Filter /FlateDecode
->>
-stream
-x�͙[s�8���+�[��"�
��I�Nz��ufg'�02ȶ��(�
��WB>���k���!��}�w@��̂����wr
�D>���Ԋ���|q�Z7v��GB{� h�*'������㜦�?�IE�G��=h"9�K�Pu��Ni�Ц�lBA�v8_��z�q�{	3��Դ
B+�{7_����w�(���N���8f֗�_=��U%>\Q���Ah���[��vr�u����$#u�oHs����s�EJ9gS{��#��'
+f񈳢��eE��bm����E4�Ba��J1���>����7��LҦ�X�t�
��� �<e�1D]��P�a���f��[���m���1�0&ڙ��Eְ2c�����>�q�:griݱ���:gj��ftU��f�o�<3�q��[ZB�d��ٞH܋�
��bH�DKnX.c:B�A����5�y�ƝRa���ׄ���S>��v};�ES9�'�_�-�f�����!�4����ׇT��pg~g�H**�g�鍍�	��$I�u���Y��2�A���BT.�UI+��}��I;��PJ_��vx��I��z9p}���hw�����Ȳؚ/��	
���}�I�� 
�w�Z���謃�y�{6�%�S
��eѴ��h�U7D��]!j�L�회�ħ&9�մQ��
�w
�@��/�Uˑ#yS�`9�d4n�(ۯ�=yڋ
F5�vZ,���vx����D�S5�up�{�q�8ޮ(��	_�	ٛn'~uI@�Q˗w�X���q��f���MTI��X�I�5s�� 0�H;nh���i�Sɛj���]�q�k�W�i���ͯ_A*����k�Ga�j�fœ��e+a�=������^���,�c��5���\�#��1�S�.����Ro�kadE���@���,�E�SZo8�79���a��lN�F�F�54�%�	���������Z
;���C|v5���<�
~��F���G�-eQ����ս$c&�v����e`A�{��Ɨ�
V��=w�n0����1��;�f�~�M
���m�Π�V�J@��H���ҷЃwry�jY�! E;N j�/��
e�7˜���x+� ���ŭ֔yӔ��L3�g ���Ŵ�C� Ah��^�H
]:�y�A
�"���}lH��E�Q���y{�<�N.�u���%�S�j�
-endstream
-endobj
-2655 0 obj <<
-/Type /Page
-/Contents 2656 0 R
-/Resources 2654 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2538 0 R
-/Annots [ 2614 0 R 2615 0 R 2621 0 R 2622 0 R 2623 0 R 2624 0 R 2625 0 R 2626 0 R 2627 0 R 2628 0 R 2629 0 R 2630 0 R 2631 0 R 2632 0 R 2633 0 R 2634 0 R 2635 0 R 2636 0 R 2637 0 R 2638 0 R 2653 0 R ]
->> endobj
-2614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 707.957 293.574 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-2615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 677.907 308.249 688.811]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-2621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 647.857 285.306 658.761]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-2622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 617.807 287.208 628.711]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-2623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 587.757 177.91 598.661]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog) >>
->> endobj
-2624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 558.683 216.086 568.611]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Threshold__Watcher) >>
->> endobj
-2625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 527.656 222.98 538.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-2626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 497.606 205.267 508.51]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-2627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 467.556 203.045 478.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator) >>
->> endobj
-2628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 437.506 195.862 448.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
->> endobj
-2629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 407.456 206.233 418.36]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant) >>
->> endobj
-2630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 377.406 237.406 388.31]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
->> endobj
-2631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 347.356 240.674 358.26]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
->> endobj
-2632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 317.306 192.395 328.21]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-2633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 242.439 237.655 253.343]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-2634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 212.389 249.819 223.292]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-2635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.29 182.338 271.408 193.242]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833) >>
->> endobj
-2636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.29 152.288 270.86 163.192]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a3bb2c0ddb1b766959ee6149bb52a7e61) >>
->> endobj
-2637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.29 122.238 271.408 133.142]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) >>
->> endobj
-2638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.455 92.188 310.472 103.092]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-2653 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2657 0 obj <<
-/D [2655 0 R /XYZ 89 770.89 null]
->> endobj
-2658 0 obj <<
-/D [2655 0 R /XYZ 90 260.512 null]
->> endobj
-2654 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2748 0 obj <<
-/Length 1738      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�H~�W�P5.��oF�aG� &s-�h�aG!#�lvj�������K�k�����s��[a&(B�v
��zM]�d��L!�.X��lX�a¯��El��o��n�d�2DF;��n⹚
�~�T�R��
��&�ڗo�0��?E֭�pO-����s.�����XQd�����ZOSUYU)v*5��-�E��9adM�=�z�c
-�)7�P�4�lh��WM3�`�/uCQD��l
K��1��BWM1@�j^ĝ�8Ϸ)�jS��2���^0l���WqC�
����
׉>q��(\RŊܶ�Ԓ�%�A?�aГ���z�D�-�:��5C)?@s��m"xɳ翇�� ��>�I�-0�3��1��c�
�\��0�*����	��`��f3L���T1����^*�Kk�c,ow�ػ������p�$Z�k G~��� ��w*���T�@��4%��T�s�K�A�#���]�2�l
7D���n%��X�1vGjLd�u+m>

�K
��+I
��m�#rxD��<[+* �2\����J�	�
��0�:)�����~`�Pk��oȔ����!iY�� �oCV�̯���X�K-E��<��#���V�$[����N�c��H�!ޠ��)�I�<;e�ˤ�Y�"�����vU��L~��V9^���J��*�&�,�&�CS{��n��r�2rG}
-s�����இ]���].�>�!h:�(�A;r<��vW*�Z���7E4�m
��-_5�����E��g(��&��9Z������#ׁ��V>�
-ͷ+a}X	������-?�"���3�� (��e���
:2)��g�����u;m���aq��+{9���ň����v����[��~��~`�#;��v˭KY��e��HP��LN�z2��5U�@<���+)
���Ѵ�r���
>���i�7��G�[�:X��&��O1-!�$�g�
�@v~P��j���j��'�,�I��w[$��o"��3� 
�3t>��z��Ȱ��9�a�zO��HR:� qO��qG��I
�
�q�}�E��$ɴ�94D�;Q�8A@�Y�kUPf�jX��j��z�d���5U��`���=��
-P�I]�E+
-���Pd����V5���	SP��X<���8��N{������֓j��'���WE�3I3���M0�_/�P���U��C�=C�b�
>��fΒ2�g/
��5�,�{w�������.)����"�P��]���B���<
5��H}s�Es:I4�I��KjK�i�7�d8G?W(��+�U
%����R]W
q��h���i�Tn�o6�S����$���߹�2

ˮ���9/�f�ts���
3�_7�kp����r�<+9K��$���u�M��²5�b"���)m�7�@W�,�3`1�a���b\
Z�8�m7�F��=��,������$)�]ot^
m[�j}⸑=`�����v����9V�
�{%?�<*���+�T��N`+�h��f�,/{ޠ҅���/p�uʂ�w��_f�q�i�W��zv�䲘�
<x
rj��#��@��<��ꤷ^P��BGj���b�
-���(U�R��g+�&75����<6��a��]~�YQ�M�L>~'�%�
�9
]�f at lC�����3��G�R��[C*Z�?�/�
-öɎj8NW�9}�I�Ul���Te�Fk�CT�Δ�k�?���
�0��à�������z5��9�A[�α[��4[%v}�
i��uʝ�@y�z��~
-endstream
-endobj
-2747 0 obj <<
-/Type /Page
-/Contents 2748 0 R
-/Resources 2746 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2538 0 R
-/Annots [ 2639 0 R 2640 0 R 2641 0 R 2642 0 R 2643 0 R 2644 0 R 2645 0 R 2646 0 R 2647 0 R 2648 0 R 2649 0 R 2650 0 R 2651 0 R 2652 0 R 2662 0 R 2663 0 R 2664 0 R 2665 0 R 2666 0 R 2667 0 R 2668 0 R 2669 0 R 2670 0 R 2671 0 R 2672 0 R 2673 0 R 2674 0 R 2675 0 R 2676 0 R 2677 0 R 2678 0 R 2679 0 R 2680 0 R 2681 0 R 2682 0 R 2683 0 R 2684 0 R 2685 0 R 2686 0 R 2687 0 R 2688 0 R 2689 0 R 2690 0 R 2751 0 R 2691 0 R 2692 0 R 2693 0 R 2694 0 R 2695 0 R 2696 0 R 2697 0 R 2698 0 R 2699 0 R 2700  [...]
->> endobj
-2639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.199 685.688 193.225 696.219]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8) >>
->> endobj
-2640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.317 685.688 266.297 696.219]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a96b8890edb38e9960c455aa178e508ba) >>
->> endobj
-2641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.946 685.688 370.997 696.219]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8abd640c30f757e4ecccd08ac527536ca6) >>
->> endobj
-2642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.646 685.688 467.956 696.219]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a979f37a289d4cb316643f1dcc07ec7cd) >>
->> endobj
-2643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [471.605 685.688 513.996 696.219]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a9606fc251d767040929d3e2645dbb446) >>
->> endobj
-2644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 660.804 204.739 671.335]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98) >>
->> endobj
-2645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 648.849 168.485 659.38]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98af4fca65e2503d4afea11aa9b9da7d51e) >>
->> endobj
-2646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.474 648.849 205.566 659.38]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9afce68d66f8c8eedec345f8df2e822f) >>
->> endobj
-2647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.555 648.849 241.541 659.38]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98ae9e9040024adaad2b7a0d9ceea0c8b62) >>
->> endobj
-2648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.53 648.849 278.622 659.38]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98accf532c4e56a06e520b6b3f638371667) >>
->> endobj
-2649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 636.894 148.002 647.424]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9223ac459b80b2eb397dd7810be7aa07) >>
->> endobj
-2650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.991 636.894 183.977 647.424]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a44ed03f4b908d58ac405493b10be3012) >>
->> endobj
-2651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.966 636.894 221.058 647.424]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c) >>
->> endobj
-2652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.047 636.894 264.226 647.424]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a468389fd24e4a478d296cbcf6b104eb0) >>
->> endobj
-2662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 623.965 165.994 634.496]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 612.01 161.84 622.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a3d884f787b884a260970cdef004fcc10) >>
->> endobj
-2664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.829 612.01 192.276 622.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a9f5dce9506b72773425c0504845d8e4e) >>
->> endobj
-2665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.265 612.01 221.606 622.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) >>
->> endobj
-2666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.595 612.01 252.042 622.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3) >>
->> endobj
-2667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 600.399 141.357 610.585]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ad5e386c6a05c9656eac42fe9e2cdd8b5) >>
->> endobj
-2668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.346 600.399 170.687 610.585]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b) >>
->> endobj
-2669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.676 600.399 201.123 610.585]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) >>
->> endobj
-2670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.112 600.399 237.646 610.585]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) >>
->> endobj
-2671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 588.443 183.419 598.63]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8adeb9e65ceecfb8271acec22e00a226ca) >>
->> endobj
-2672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.408 588.443 233.78 598.63]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4194f750c76fb24d6e5930e1696076c4) >>
->> endobj
-2673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.769 588.443 287.469 598.63]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) >>
->> endobj
-2674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.458 588.443 394.278 598.63]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) >>
->> endobj
-2675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 576.145 226.577 586.675]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) >>
->> endobj
-2676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.566 576.145 342.233 586.675]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) >>
->> endobj
-2677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.222 576.145 450.148 586.675]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a02347568b111860e1ac15154a1832252) >>
->> endobj
-2678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.136 576.145 488.882 586.675]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) >>
->> endobj
-2679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 564.533 197.815 574.72]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae0c660bfcbcd3d10c3e764e22f41d0a1) >>
->> endobj
-2680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.804 564.533 263.668 574.72]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a057025d0ff550a2226a0a1273c84b4f6) >>
->> endobj
-2681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.657 564.533 344.465 574.72]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) >>
->> endobj
-2682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.454 564.533 421.386 574.72]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a5912e00d1de38a643d48af1f0e5dd35f) >>
->> endobj
-2683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 552.578 172.351 562.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) >>
->> endobj
-2684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.34 552.578 263.668 562.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a930a62d56d7231cdb1ed57e1d3eff0f7) >>
->> endobj
-2685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.657 552.578 342.263 562.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6) >>
->> endobj
-2686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.252 552.578 413.655 562.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab) >>
->> endobj
-2687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 540.279 178.996 550.809]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a261922c7bb53bf71459671df868e55da) >>
->> endobj
-2688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.499 540.279 334.007 550.809]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) >>
->> endobj
-2689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.51 540.279 486.816 550.809]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a202263943c451b9fdfe003b2bc8d0b1f) >>
->> endobj
-2690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.319 540.279 513.996 550.809]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
->> endobj
-2751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 528.324 205.018 538.854]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
->> endobj
-2691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 500.1 198.094 511.004]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 488.862 187.285 499.049]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2abeee33de6f8542b0228161d044640eaa) >>
->> endobj
-2693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.274 488.862 245.397 499.049]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) >>
->> endobj
-2694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.385 488.862 328.405 499.049]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) >>
->> endobj
-2695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.884 488.862 441.57 499.049]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aeafcc7ca16bda73dc6b0f7deaf9470dd) >>
->> endobj
-2696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 476.563 245.406 487.094]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2ae0c0414fd69996a2edb8ea476ab236e1) >>
->> endobj
-2697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 448.34 223.927 459.244]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-2698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.698 448.34 282.945 459.244]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-2699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.934 448.34 321.69 459.244]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-2700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 420.49 210.278 431.393]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-2701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 408.908 149.656 419.438]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) >>
->> endobj
-2702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.645 408.908 210.538 419.438]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea556cc08f48e769b9c15bea83d5d883a1) >>
->> endobj
-2703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.526 408.908 296.326 419.438]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416) >>
->> endobj
-2704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.314 408.908 379.892 419.438]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea94cf20719046117aece5acba61dcae4d) >>
->> endobj
-2705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 396.953 219.394 407.483]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab) >>
->> endobj
-2706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.383 396.953 283.583 407.483]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea8191bdbdcd041a9859ed465d16062ab1) >>
->> endobj
-2707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.249 368.729 214.715 379.633]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-2708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.908 368.729 360.933 379.633]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-2709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.633 368.729 478.426 379.633]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1ab39e3c667ce455313f8ff578722af2e9) >>
->> endobj
-2710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.126 368.729 513.996 379.633]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-2752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 357.147 180.102 367.678]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-2711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 328.924 221.336 339.828]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-2712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.107 328.924 303.029 339.828]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) >>
->> endobj
-2713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.018 328.924 383.816 339.828]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
->> endobj
-2714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 301.074 263.698 311.978]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-2715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 289.836 147.454 300.022]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) >>
->> endobj
-2716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.443 289.836 188.968 300.022]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdac58a6ff6765224e937fefbadf45a4860) >>
->> endobj
-2717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.957 289.836 230.483 300.022]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) >>
->> endobj
-2718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.471 289.836 271.997 300.022]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559) >>
->> endobj
-2719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 277.537 157.417 288.067]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda9a59b7fa00c2cf8df942badc9c414aef) >>
->> endobj
-2720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 249.313 298.955 260.217]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-2721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.726 249.313 359.627 260.217]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) >>
->> endobj
-2722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.616 249.313 484.708 260.217]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaf4462ec77078de4bbabb446cf61e5123) >>
->> endobj
-2723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.94 221.463 275.823 232.367]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-2724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.398 221.463 379.035 232.367]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) >>
->> endobj
-2725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.426 221.463 500.738 232.367]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7869fdfe9b1ace668a0a7b1d2faba812) >>
->> endobj
-2726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [503.129 221.463 513.996 232.367]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
->> endobj
-2753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 209.881 227.155 220.412]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
->> endobj
-2727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 181.658 200.295 192.562]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-2728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.066 181.658 242.158 192.562]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13a39adc66b0a3d8cae2a7dc2abc8885c69) >>
->> endobj
-2729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.147 181.658 283.682 192.562]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-2730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 142.849 233.381 153.753]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
->> endobj
-2731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 131.267 183.419 141.797]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) >>
->> endobj
-2732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.408 131.267 265.322 141.797]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d) >>
->> endobj
-2733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.311 131.267 352.206 141.797]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) >>
->> endobj
-2734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.195 131.267 427.464 141.797]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) >>
->> endobj
-2735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 119.312 248.156 129.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fab25413bda9bbd45d2f22366d0e0ef831) >>
->> endobj
-2736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.145 119.312 312.355 129.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) >>
->> endobj
-2737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.344 119.312 381.535 129.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa8d3ab7646117632841be76c043efc39b) >>
->> endobj
-2738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 91.462 223.01 101.992]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
->> endobj
-2739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.781 91.462 365.066 101.992]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) >>
->> endobj
-2740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.055 91.462 495.138 101.992]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a3b60d6dfe175b3a5d48361ac121f23ae) >>
->> endobj
-2745 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2749 0 obj <<
-/D [2747 0 R /XYZ 89 770.89 null]
->> endobj
-2750 0 obj <<
-/D [2747 0 R /XYZ 90 704.286 null]
->> endobj
-2746 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2811 0 obj <<
-/Length 1576      
-/Filter /FlateDecode
->>
-stream
-x��Y�r�6}�W�fJ�U�[��
����҇&$�6�T@Љ��wq�(ْ�FV���	�r��b���Υ���z��z��$pR��~�]8)v�0EQ
oS獛"����
�	v)/h6��حf7Wl�i�*s�o��a�����	ӯ'��>���]$I��;L���^���z{``��m#�
�I�{�;S�~�`�C�T8�@;sN{� w%�qG�cC'!��y�����Ns�x��ʦ0�
�4�NԈ Iܣ��M\^�g��NM���
���ub���`������3���kx<ZY��e3����Ϗ_����)��q�x rEZ��,.u�ztvxt����k���,u�vp� #��Pi!D
̃v��Ѩ?���
��vR5bR�嘷
݊+�o����U��κ�]K�"�E	�#	B6
-G�� Ex��H8�8�r"���lNښ<�G1	֘ӝ�J��+k�+7sv�
)`Y��f�̻T�G~�C4!����&N�hxih������YP����U�2]��/K*���|jX�h	�
-�^��\��sڔrO6�l�9�T�β9g�|'��:�� q����F.�F�����.*���(
]�M�l��TW�=���f"{
��hl�Փ�kH>e��cxk��)�yy��l4z�U3%k<���T5�STSf
�h�K��ԏk�95�T��i˽U�[��
-X��̫�4���;��
v�
�*��(��F�bvӏ"w��g��rZm=�3��Z�fVn��d;�Lڽ$�
(s��w��l}�M
R��ʹ��S�zخ���
�Ve��q��%��@�哉} -&/�*�=b�U��GJ�I�J�	NsQ?{�.���\@�y���ƫ]?�;L�
��ȶ�)���&(���p�)��խp
-o�ƞ��d?�d
\o5�/��Le�;���#��Ec�E~��b���ma�$3抖SH�Ȫ�X`\�'x~�R�@���O4ȥ���p�C�0��R��Aeb����- at a����6҈k)�ƕ�=\���}h����Ƭ&:Z{]�7�ò-�*Èl����2M�F��v�M�I�{����AFe�A����7f��μ�n�7I�[rrE��
�ag�� ���:�h�!tF��ķ�:,-�^�'N60l �����%2�6���
���X��iY2�=�;�̓�m0wʮ� ��d9 X\�j�ò�C���
-!��:���w ����	9��+C��䱑���A^5g�����N�k��]ۘy��֯�ys�~�G�
-�v@�
�&NQL����o�Z��h�8^� y^av�B�ޏjM�ތ����z��֌��?:h����m�s5r�$��-R�6�P����V&]U���-�H����Bu�"^CNLۏj��
-��[��0
��
�g�-(��D�
����6-%k���cn��
�1�~�]�	K�	�R����5t^3��,_�G�llI_�ҍgLA k�^ ��)�i����O��
,�j%
-Q��_	16��K��M���ȑ"��~��QT���Bg�J��~�<F�
�e
@��
F�$*���γ���h:�E༨�����^IƆ
-endstream
-endobj
-2810 0 obj <<
-/Type /Page
-/Contents 2811 0 R
-/Resources 2809 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2827 0 R
-/Annots [ 2741 0 R 2742 0 R 2743 0 R 2813 0 R 2744 0 R 2768 0 R 2769 0 R 2770 0 R 2771 0 R 2772 0 R 2773 0 R 2774 0 R 2775 0 R 2776 0 R 2777 0 R 2778 0 R 2779 0 R 2780 0 R 2781 0 R 2782 0 R 2783 0 R 2784 0 R 2785 0 R 2786 0 R 2787 0 R 2788 0 R 2789 0 R 2790 0 R 2791 0 R 2792 0 R 2793 0 R 2794 0 R 2795 0 R 2796 0 R 2797 0 R 2798 0 R 2799 0 R 2800 0 R 2808 0 R ]
->> endobj
-2741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.798 708.331 227.588 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) >>
->> endobj
-2742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.879 708.331 375.482 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) >>
->> endobj
-2743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.731 708.331 513.996 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) >>
->> endobj
-2813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 696.376 124.76 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) >>
->> endobj
-2744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.748 696.376 258.148 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05) >>
->> endobj
-2768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 626.349 179.554 637.253]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-2769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 626.349 250.676 637.253]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) >>
->> endobj
-2770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.376 598.558 232.395 609.462]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a30a5addfb775d0e3586f1575ece47bf6) >>
->> endobj
-2771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 570.767 229.984 581.671]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_abdd9791a8d91b11a5bd3a6ef0770bc86) >>
->> endobj
-2772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 542.975 226.677 553.879]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a63bd7c7767faf3c219f9c2762095e2dd) >>
->> endobj
-2773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 515.184 243.822 526.088]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) >>
->> endobj
-2774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 487.767 170.776 498.297]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a03ed91fbbeb6d32952c5d2a30bfd3830) >>
->> endobj
-2775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 459.975 165.237 470.506]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a05dd6b345e96427a50b45f9756e302ab) >>
->> endobj
-2776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 432.184 322.077 442.714]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
->> endobj
-2777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 404.393 319.317 414.923]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-2778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 376.228 179.554 387.132]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-2779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 376.228 272.803 387.132]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_aca6003248d614d68c07f5330b468a242) >>
->> endobj
-2780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.56 312.248 222.957 323.152]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a0adf6106892886dc859985042b8a7433) >>
->> endobj
-2781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.56 286.553 223.515 297.457]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_af9dd9190c5f29dbbfa3d6e442dea7e7d) >>
->> endobj
-2782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.56 260.858 231.565 271.762]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a5604f97d216583cdf012a50d2f8cdbde) >>
->> endobj
-2783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.56 235.164 216.312 246.068]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_af127b16b1a8e300aa97caca515284b6f) >>
->> endobj
-2784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.724 209.843 206.897 220.373]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a99e9dc5df3cf7c0ab581e602d1176e41) >>
->> endobj
-2785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.724 184.148 204.825 194.678]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_aee4e9b54e65780ac3010fda40ea235a6) >>
->> endobj
-2786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 121.787 152.551 132.691]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.049 121.787 195.988 132.691]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e) >>
->> endobj
-2788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.804 121.787 227.26 132.691]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.721 121.787 265.178 132.691]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 110.546 152.551 122.501]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.049 110.546 191.005 122.501]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga266a81f442cf72bfded10a4ecb79f130) >>
->> endobj
-2792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.82 110.546 222.277 122.501]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.738 110.546 260.194 122.501]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 99.973 152.551 110.877]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.049 99.973 191.355 110.877]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) >>
->> endobj
-2796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.171 99.973 222.628 110.877]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.088 99.973 260.545 110.877]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 89.44 179.121 99.97]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8) >>
->> endobj
-2799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.619 89.44 228.097 99.97]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) >>
->> endobj
-2800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.912 89.44 259.369 99.97]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2808 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2812 0 obj <<
-/D [2810 0 R /XYZ 89 770.89 null]
->> endobj
-2814 0 obj <<
-/D [2810 0 R /XYZ 90 645.291 null]
->> endobj
-2815 0 obj <<
-/D [2810 0 R /XYZ 90 645.291 null]
->> endobj
-2816 0 obj <<
-/D [2810 0 R /XYZ 90 615.766 null]
->> endobj
-2817 0 obj <<
-/D [2810 0 R /XYZ 90 504.601 null]
->> endobj
-2818 0 obj <<
-/D [2810 0 R /XYZ 90 476.809 null]
->> endobj
-2819 0 obj <<
-/D [2810 0 R /XYZ 90 449.018 null]
->> endobj
-2820 0 obj <<
-/D [2810 0 R /XYZ 90 421.227 null]
->> endobj
-2821 0 obj <<
-/D [2810 0 R /XYZ 90 393.435 null]
->> endobj
-2822 0 obj <<
-/D [2810 0 R /XYZ 90 327.274 null]
->> endobj
-2823 0 obj <<
-/D [2810 0 R /XYZ 90 301.768 null]
->> endobj
-2824 0 obj <<
-/D [2810 0 R /XYZ 90 276.073 null]
->> endobj
-2825 0 obj <<
-/D [2810 0 R /XYZ 90 250.379 null]
->> endobj
-2826 0 obj <<
-/D [2810 0 R /XYZ 90 224.684 null]
->> endobj
-2809 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F24 529 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2886 0 obj <<
-/Length 1742      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�J3��NIl���qd��:
%A6k�������.^4%Q�Hn<�Ŧ ,�a��bwIl\�8i��5:Ǯe��wL��
��#����q��q�k�a9
"�B�������y��5�z���.l)O��èq�#h~o`d��� E�mZ�b\6>5�����
\�D��
�p	A�H _L��ş���鵂�=iWm�q�˲b���l�a�2)n�R(�RC�`�U��$j�:��

-��s�[��vl�m�D�M�61�g�r�G��Eh3�YKL��0���,���i���)�;DŽ���cS�4�cf0Pdy�̀����`�6� ���J;�?�Y�\&�9,mb!�m�A�-�|\�C�J��ms�y�d2	�k�x<I ��u�2�Ba�l�9�U��KD��Y)�^�<Z���xZ�CX4
&�?�?䈓I\nd�f�汅
O!>-כ����g� p�l
-��
%��D,�#���
-�[O�"
�1��0eb�~�8e�uv���Ch���"��55,Ry�5sJ�I�Id������9������.z?;)ԓ��d�RޭQ�Kj
��"�����r�.�8�X��N�q��2����)~h�P:Z�i�+3ܢ���a؋�������
H� 
U�ۺs�h��=$B\M5�sq�߇I�M
e{����[Gy��0T�뙟�0ؿA��
y�"���xbO>�rO�yb#�Z�������Y-sF�Y�Ŗ��A�en�^����p‚�[a
�"([hQ�
�hZ�:փ�(21U$��IZ�qf\�mbC����T�<����\8@�<Iٮ�N���*�����Z�£m�R�0�7!
+Y7|�#&F����6B���m�#�z[=hU�
4���A�����<�_���
�
D)���S�Ґ�G#��%�A�'���8��s�����V�T4�LEwu�a}��|�L
-�}o�<Q�.�Q��LY���C��l1%���j\�
��5��Y1�
�v�D� �����W��"��#8}�6���R�Z��k�^[�ei��O�]b����Ofj&���H:JFleI

��e�U3��l��#�?��럞��
�L)Zɾ+������y�&�
b$��Y�w6E ��3`���n�Z}YwV�P�;i���?/�u�M�ӗ�;��!�~�����36b���z�?ew��Ͻ�}
Y���P��W�7��i8��W^�#��uz�5.�lW���,�6��KK�:e�p��sf���H�5�ķ�rӤg����
�*&\B��Td��h
-�`2 �
<�3]d�e<��
13���W���� R���<���I-D]�E~/���s�CfK�멞�4
-c��0g�?�\Ɗ!�%��O��˷�9V��
�P�@([3�R�U_"FS���E��
̈́�)�oU �J���Z*
ؗL���%Rx�ZuWo�.�"�뜾6-��T?'�������b��epٸ`
+�O�݈�;�$f�
~}�؄��[��v�k�*',~����**��c�!�ǖ��a~#��)fY&��G6b�Wo_v+��@5ղ�����y�f?o���m3��
����
�}s��0��c"״6���"h����˯�F���):�ϢS˨��id���i�6��~�PV}1K�
\Wc��������>��X�K�R]�?
�"P�L8iu�^�8�D
�
w>:”�nK���V�PQZ�n�|�k�3(�3_�a-��'a�G�-��XG�O�U	�`��
0޿O*�O
-endstream
-endobj
-2885 0 obj <<
-/Type /Page
-/Contents 2886 0 R
-/Resources 2884 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2827 0 R
-/Annots [ 2801 0 R 2802 0 R 2803 0 R 2804 0 R 2805 0 R 2806 0 R 2807 0 R 2832 0 R 2833 0 R 2834 0 R 2835 0 R 2836 0 R 2837 0 R 2838 0 R 2839 0 R 2840 0 R 2841 0 R 2842 0 R 2843 0 R 2844 0 R 2845 0 R 2846 0 R 2847 0 R 2848 0 R 2849 0 R 2850 0 R 2851 0 R 2852 0 R 2853 0 R 2854 0 R 2855 0 R 2856 0 R 2857 0 R 2858 0 R 2859 0 R 2860 0 R 2861 0 R 2862 0 R 2863 0 R 2864 0 R 2865 0 R 2866 0 R 2867 0 R 2868 0 R 2869 0 R 2870 0 R 2871 0 R 2872 0 R 2873 0 R 2874 0 R 2875 0 R 2876 0 R 2877 0 R 2883 0 R ]
->> endobj
-2801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 708.331 191.296 718.861]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98) >>
->> endobj
-2802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.794 708.331 251.339 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gac40e401b77b5ec6e9625c317ce6d760d) >>
->> endobj
-2803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.155 708.331 282.612 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 684.679 152.551 695.21]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.049 684.679 236.943 695.21]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga13bf4cf2db045bfd362c5c8aae7f785b) >>
->> endobj
-2806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.759 684.679 268.216 695.21]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-2807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 635.837 275.489 646.741]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ace0cdceaa0c7eea84cc1c38cf5bea680) >>
->> endobj
-2832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.357 610.452 358.139 621.356]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a9c118832fed4c0b9b40547578459dad4) >>
->> endobj
-2833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 585.067 257.776 595.971]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ad31eeb0067d6cad2eb2ea5ab5bd0a2b2) >>
->> endobj
-2834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.921 559.682 380.884 570.586]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a74074a5ed3718745a4d82bacd5b381ed) >>
->> endobj
-2835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.921 534.297 438.278 545.201]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a3e6dcd6f5d8e3ea263c9205b21a83e48) >>
->> endobj
-2836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 485.999 273.816 496.902]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6a54c55d8b52ef353df7cefdfa632d8d) >>
->> endobj
-2837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 460.614 217.766 471.518]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a5e801a56c2c3dcec13d2d87adf07ac47) >>
->> endobj
-2838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 435.229 215.196 446.133]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a19b0ebdb3476fe1feb0f51d9328fd384) >>
->> endobj
-2839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 373.938 184.651 384.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.149 373.938 228.088 384.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga984f2c32e934b6510731f6a7faf28296) >>
->> endobj
-2841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.903 373.938 291.46 384.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.92 373.938 361.477 384.842]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 362.775 184.651 374.73]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.149 362.775 223.104 374.73]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) >>
->> endobj
-2845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.92 362.775 286.476 374.73]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.937 362.775 356.493 374.73]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 352.279 184.651 363.183]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.149 352.279 215.366 363.183]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae) >>
->> endobj
-2849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.181 352.279 278.738 363.183]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 328.628 184.651 339.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.149 328.628 226.434 339.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) >>
->> endobj
-2852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.25 328.628 289.806 339.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 317.798 197.403 328.702]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) >>
->> endobj
-2854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.219 317.798 260.775 328.702]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 306.969 185.478 317.873]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) >>
->> endobj
-2856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.294 306.969 248.85 317.873]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 296.14 200.97 307.044]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga809c78f95611c4b838b4e8f097a03e32) >>
->> endobj
-2858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.785 296.14 264.342 307.044]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 285.31 221.443 296.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3ccd0ef2cbdc282106525b2f0e734c7e) >>
->> endobj
-2860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.259 285.31 284.815 296.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 274.481 231.405 285.385]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e) >>
->> endobj
-2862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.221 274.481 294.777 285.385]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 263.651 198.2 274.555]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) >>
->> endobj
-2864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.016 263.651 261.572 274.555]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 252.822 203.739 263.726]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga34d9dfd53548ce172ae94462d24f41e6) >>
->> endobj
-2866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.555 252.822 267.111 263.726]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 241.993 230.857 252.897]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) >>
->> endobj
-2868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.673 241.993 294.229 252.897]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.357 231.163 303.903 242.067]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142) >>
->> endobj
-2870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.719 231.163 367.275 242.067]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-2871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 170.739 231.425 181.643]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
->> endobj
-2872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.815 158.24 474.161 168.146]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 135.133 241.387 146.037]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
->> endobj
-2874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.815 122.634 474.161 132.539]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 99.526 282.075 110.43]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
->> endobj
-2876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.937 99.526 405.76 110.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-2877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.688 76.49 221.033 85.974]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2883 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2887 0 obj <<
-/D [2885 0 R /XYZ 89 770.89 null]
->> endobj
-2888 0 obj <<
-/D [2885 0 R /XYZ 90 650.786 null]
->> endobj
-2889 0 obj <<
-/D [2885 0 R /XYZ 90 625.59 null]
->> endobj
-2890 0 obj <<
-/D [2885 0 R /XYZ 90 600.205 null]
->> endobj
-2891 0 obj <<
-/D [2885 0 R /XYZ 90 574.82 null]
->> endobj
-2892 0 obj <<
-/D [2885 0 R /XYZ 90 549.435 null]
->> endobj
-2893 0 obj <<
-/D [2885 0 R /XYZ 90 501.136 null]
->> endobj
-2894 0 obj <<
-/D [2885 0 R /XYZ 90 475.751 null]
->> endobj
-2884 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2935 0 obj <<
-/Length 1642      
-/Filter /FlateDecode
->>
-stream
-x��]o�6���+t�I@͐%J�0`��b]x����� �L�Ŗ\IN���
~ɲ�8v�X�+ч�y�><-�\:�y�{1�
���8��3�pb�p� �_�܍��c�<�ݴ������-f7S1)��]6*����� �'�\T�t,��Sq!J�D�ȥ��8bnL�÷�W���
�a`����G�x�;���	��:�q�|RNs�Q�3��G���LBܚ	!
�Ђ�ѳyOi�nn��6
�
�&B,��B9�b�����
�^�qˏr�Xl
�
k=�(�¦����!2:(��WÎ><�M~n�\ͨ���Ӈ	�A��FE133�q,/M at O����c��E�^x4p�cL�G��WY~�\,�q�yr|�е����x\�U�ԸUųE%�d$.�R<���w�_zQ�v��6P�>�7"eZ��d�͗0.�V�Z�؇5�Ð)0D@�}�#j�<�b�r�婜:
3$��j�!v?e�T۠����f�p���Z:]����Ԙ���
����Z�E^k��B;�S�
sQO��6�n��XTyZz>wME�O�U�0*ֳ9�I��%Ϯn���������؈����h��R2-;��
-ҵ�Բ�����n�*��K�-���k=KF����d`�[�\7��u�%���
Y�dPF�a�U+�/��C�p!�����B�*�Pw��Ɩ
Y�\���ۉnnI�a�=���_<�(���dM��&j��6�
��
~'�{e�nԏ����z|�'�.n��q�V�^H6o"3�@�]���NJT1.E*5��d���R�nT,�$߂ʗ�|�
-aE���կ2F�
�A�Id�-*���-�j�B�[Te?��v�ںa3�U(+T���j�\�����C2Jà�Q��ٞ�P��~T
�}T���L(����3~�ޝ
�����Oh?�3y�z���Ƕdpz�K��zf�g�����9��y|&��uc�>�[��
�*90g��4�gjR^��D̪�L[M�ތ��X3�oq��� J�$ʖ(;ʝ�l%0��S��E�;E��[e�IK�|%c���)�A���k�
0�y:����b\˩�+��ձ�4*�mC��J�K�w�
=8������_�k��T��Ϫ��ʹ�g�����>���;U>��^��N
�eK��X�ˊ�S7�� k7��?u
��/�ð�dolv�
L[�@�
��������܃��
Ti����Fn���g���C���NN����\dB���)=j؞(t���uX�~Ya����Atq�~Lf�~�L�$�����Leޒdƺ3S���T�Ce*���ɋZ�5EX婾�rs����"7-�t�qw&�[�s��1?�";�-�a����;�4�������j4�e�{s�h��&�t�#b}4���d����,
<��
�a�29�k�S$cu����Ϯ ݢ�~���'����Qd�Uo���
-9��c�0
-�/;�ĸ^߈7?$
)����C2���j���(�ͳ�Ц���.�Y��/�J�>N�e:�\��UVͨ	RX"��<����}�����k���k
�E�BN�z����hyY���zl'��<b�y�] g�=a�ԥ,W���"�I��c�	
-Cj#��ha�9U
��
��跹��Z@�W����
-
-endstream
-endobj
-2934 0 obj <<
-/Type /Page
-/Contents 2935 0 R
-/Resources 2933 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2827 0 R
-/Annots [ 2878 0 R 2879 0 R 2880 0 R 2881 0 R 2882 0 R 2896 0 R 2897 0 R 2898 0 R 2899 0 R 2900 0 R 2901 0 R 2902 0 R 2903 0 R 2904 0 R 2905 0 R 2906 0 R 2907 0 R 2908 0 R 2909 0 R 2910 0 R 2911 0 R 2912 0 R 2913 0 R 2914 0 R 2915 0 R 2916 0 R 2917 0 R 2918 0 R 2919 0 R 2920 0 R 2921 0 R 2922 0 R 2923 0 R 2924 0 R 2925 0 R 2926 0 R 2927 0 R 2937 0 R 2928 0 R 2929 0 R 2930 0 R 2931 0 R 2932 0 R ]
->> endobj
-2878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.58 696.002 293.319 706.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
->> endobj
-2879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 684.42 166.918 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-2880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.688 660.573 221.033 670.057]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 636.606 281.327 647.51]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
->> endobj
-2882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.19 636.606 422.746 647.51]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.087 613.132 205.432 622.616]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.484 589.165 292.675 600.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
->> endobj
-2898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 577.21 184.651 588.114]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.087 553.736 205.432 563.22]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.756 529.769 307.996 540.673]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga60f87e33c0dde9f5c2c7d3b4b78818ab) >>
->> endobj
-2901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.644 529.769 452.2 540.673]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.916 517.814 229.473 528.718]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.379 494.34 236.725 503.824]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.244 470.373 317.447 481.277]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga470bfc567789301bfdc28fd70ed82f92) >>
->> endobj
-2905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.929 458.418 207.485 469.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.137 458.418 367.693 469.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-2907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.379 434.944 236.725 444.428]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 410.978 229.213 421.881]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) >>
->> endobj
-2909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.86 397.045 240.042 406.95]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
->> endobj
-2910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.45 397.045 465.796 406.95]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 372.503 239.176 383.407]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d) >>
->> endobj
-2912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.043 358.571 249.191 368.476]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
->> endobj
-2913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.137 348.033 219.483 357.517]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 323.07 279.863 333.974]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) >>
->> endobj
-2915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.725 323.07 403.548 333.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-2916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.86 309.137 284.569 319.042]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
->> endobj
-2917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.977 309.137 510.323 319.042]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.886 284.596 291.413 295.499]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) >>
->> endobj
-2919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 273.014 166.918 283.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-2920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.424 258.708 293.1 268.613]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
->> endobj
-2921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.491 247.749 256.836 257.654]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 223.207 279.116 234.111]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga233295f67896774a4fa42920a4b8522b) >>
->> endobj
-2923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.978 223.207 434.92 234.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-2924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.86 209.274 284.578 219.18]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
->> endobj
-2925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.986 209.274 510.332 219.18]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145 184.733 288.979 195.637]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) >>
->> endobj
-2927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [501.493 184.733 513.996 195.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-2937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 172.778 191.844 183.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-2928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.423 158.845 293.108 168.75]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
->> endobj
-2929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.491 147.886 256.836 157.791]
-/A << /S /GoTo /D (index_BMPZ10) >>
->> endobj
-2930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 91.727 182.234 102.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
->> endobj
-2931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.892 91.727 358.581 102.631]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga00a906832c41c42a70a5c9d194e07a7d) >>
->> endobj
-2932 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2936 0 obj <<
-/D [2934 0 R /XYZ 89 770.89 null]
->> endobj
-2938 0 obj <<
-/D [2934 0 R /XYZ 90 111.337 null]
->> endobj
-2933 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F90 758 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2949 0 obj <<
-/Length 1557      
-/Filter /FlateDecode
->>
-stream
-x��Xms�8�ί�g�"�������h��t�&�0D⩱�mzͿ�՛1!��N�W��zv����ظ3��u2n
�����1^!6|'D���qk���2�`�^�H��&1{z5w�k���
�
Z^a���.�c�l�~��
�?�a`�#-
���L����VP0�.�C]��A�(\d�M0��+�8as�Mi �b�ǫ2�ROpt���a�M
��P��3��b��e�+9��y�?�A\��,K?cLSq
��L=���4Z�b�� �,k�0l��ݘE�Yc�	������,����/zb��Mۄ��[e]e��\Q�~�\��`-��(_F��E��%��l�G���N�s����"��J6�~_I�( ��"N����VgDp O즳l�
-�W��\���E�Y���Y�5�ty��=��l�l۞�͢�%k~��:�Ky���Yg���飜.��U���l�D�
�iQF�L��R�n��k����l�FYʤ�l�Q^�(�S�i��m;5O�|=�Z�<*�|˥`ػ�vs��_7?��M15O���ѽ���c���=U�R�y��ӻ�0���"VWwh#!6�W�<�
/�i�&#�`9�k(۰���sn�o�0P�������6��}�ز?�b��z(n�v���i��H�˜��Y#.
CA\>
�Z�橘-�S^3�l9e��
-�v�^P�a�G琞7�y^�F~ߡ�GPl��.
-}_/��%
��Eop�r�;�zء�:~=M�7I�'Wß˒�|LEPT�ԑ98g{��go'MWI�ZS�v0��P�HM�Z�V
-�q-��H�P�uޱ�.��㳳w���͉�.o�J:�}�
e*i��Q��4��xp�ū�����������;��U���z�$��7���kx�?ϫ�H+��q�i��UJ�|f�|M+>�'8���)�i%Z�M��&�6Bӊ'�a��Z���7����+����t̻��к�s����Ϸvv��1y�J�
-��`J�X�N��&QQl�ى��^]�m�*h���YU� �;��V$%��� ��5<�M��O�����򸿏���bo
-ЈqBr'C�W
X�Z'�\ج��
G
�۠�Jy�x��V�{&��yo���
$DIo ˼w�������L3X0>.
�>�����@�9�]1(+�_��B��

�as`���cVn��Cb��͞�� ��m#h������{7bɎD�VW�4n�hҽ
�g
�p����3�
�,8c�|���/�E
�M��q66Dc�>���0�|���׽.D�l�-WQ7�O԰��
-Ez���BR��}���oQ�6H8Mޏ_p?�U
y���Է�̐��f
�����9��@'gC��6ȁ��'tҽݛ#q=��+�ū7�登�� Dž��t
'ɞ$�x<(�6��z:I��?������P��}�z���S�.��z��8�-m�,eum���(~�P8��Q�r�'j����pؗ�M���,�5�_.��-���ŲO�
ـ�$A���5�?m$��싖��P��:�u���}Y�:GG��
�w(�4���!$���BSs��U�����ݤ��
-endstream
-endobj
-2948 0 obj <<
-/Type /Page
-/Contents 2949 0 R
-/Resources 2947 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2827 0 R
-/Annots [ 2939 0 R 2940 0 R 2941 0 R 2942 0 R 2943 0 R 2944 0 R 2945 0 R 2946 0 R ]
->> endobj
-2939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.007 584.672 511.506 595.576]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-2940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 572.717 156.281 583.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator) >>
->> endobj
-2941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.792 572.717 218.886 583.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
->> endobj
-2942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.396 572.717 291.861 583.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant) >>
->> endobj
-2943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.372 572.717 396.009 583.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
->> endobj
-2944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.712 572.717 513.617 583.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
->> endobj
-2945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.989 560.762 229.488 571.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-2946 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2950 0 obj <<
-/D [2948 0 R /XYZ 89 770.89 null]
->> endobj
-2951 0 obj <<
-/D [2948 0 R /XYZ 90 721.073 null]
->> endobj
-2952 0 obj <<
-/D [2948 0 R /XYZ 90 667.754 null]
->> endobj
-2659 0 obj <<
-/D [2948 0 R /XYZ 90 643.084 null]
->> endobj
-2953 0 obj <<
-/D [2948 0 R /XYZ 90 643.084 null]
->> endobj
-2660 0 obj <<
-/D [2948 0 R /XYZ 239.495 551.959 null]
->> endobj
-2954 0 obj <<
-/D [2948 0 R /XYZ 90 545.942 null]
->> endobj
-2661 0 obj <<
-/D [2948 0 R /XYZ 284.469 478.165 null]
->> endobj
-2955 0 obj <<
-/D [2948 0 R /XYZ 90 472.242 null]
->> endobj
-2956 0 obj <<
-/D [2948 0 R /XYZ 90 397.698 null]
->> endobj
-2754 0 obj <<
-/D [2948 0 R /XYZ 90 373.029 null]
->> endobj
-2957 0 obj <<
-/D [2948 0 R /XYZ 90 373.029 null]
->> endobj
-2755 0 obj <<
-/D [2948 0 R /XYZ 107.713 319.165 null]
->> endobj
-2756 0 obj <<
-/D [2948 0 R /XYZ 107.713 302.38 null]
->> endobj
-2757 0 obj <<
-/D [2948 0 R /XYZ 107.713 285.595 null]
->> endobj
-2758 0 obj <<
-/D [2948 0 R /XYZ 107.713 268.81 null]
->> endobj
-2759 0 obj <<
-/D [2948 0 R /XYZ 90 256.365 null]
->> endobj
-2958 0 obj <<
-/D [2948 0 R /XYZ 90 251.882 null]
->> endobj
-2760 0 obj <<
-/D [2948 0 R /XYZ 107.713 197.137 null]
->> endobj
-2761 0 obj <<
-/D [2948 0 R /XYZ 107.713 180.352 null]
->> endobj
-2762 0 obj <<
-/D [2948 0 R /XYZ 107.713 163.567 null]
->> endobj
-2763 0 obj <<
-/D [2948 0 R /XYZ 107.713 146.782 null]
->> endobj
-2764 0 obj <<
-/D [2948 0 R /XYZ 107.713 129.998 null]
->> endobj
-2765 0 obj <<
-/D [2948 0 R /XYZ 107.713 113.213 null]
->> endobj
-2766 0 obj <<
-/D [2948 0 R /XYZ 107.713 96.428 null]
->> endobj
-2767 0 obj <<
-/D [2948 0 R /XYZ 107.713 79.643 null]
->> endobj
-2947 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F112 1773 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2965 0 obj <<
-/Length 2696      
-/Filter /FlateDecode
->>
-stream
-xڵZ[s۶~����)5�h x�[N[w�[�ę�L���dsB�
-/qs~��p��R�D}"���
|�-�л�B����\\^%�˂,��w����K�,�1�V�;?
�lN�0�_�H���&_���Я�/�b��ߊ�&o�<~�r�r+����v6�<���7���K�?_��hf$�E%��1�36�p���O7�.�
-=���A�z��Ż��B�/^�,�
T��Q�g齹��"4�	��|��A�;:BB��H��]�ղ+�
-�����^�Qu�*�N�@ќF���Ā�˺j;-p9K�����.�h4�)��ɡ(�Ð�F��	�
m0�����̑,���1���=di6���LѐI�)IIL�bF��!�v��4�D�0 �����z��橏�v�W֓���!g�P�F
�]^�c�sµ`�
H�h��E�7�Y��~,�|�)�l����LU��QT�wwo���W��c
�~ ���$A�E��ݨ��a0}��3����J�����5�l�%
-�ۺ��։nZ'J>�ޢi���,�l��RT-�u+�_�ˏ�I�6**)拮~Л�ɫ~�ϻ�3ʭ�Y�φA� �f�ZI�?|��|a��Ͷ(�xQܷb�ߺZ��Jd��k
�+���ܗ�8��w��Fl�
�kuM^�C/6�*���~�T�u�@�1r�@�+ �V-f�EA�1
X-*�6pL�/���t�"18^���<a
�
����I�k�����~�l�8��bǮKS��b)���	�)���(O�|��ʋJ����r
���H
g0�E�wEUBƇ� G�1�� �g/�B�;��qf
�#��eV�4�Ș�po��wAqOk
-;�L���V�ߜ0� 8�.�R?���/��Sm}Y0V�j4$��v%0iUt������@��Wn��tB�r�#g�'h�G��+ѶSh�b9&�0��\��g	�yQ淥x
Ҍ}�����,�.V��t$��4	"�M�$�
�DQ�<
n0IIB�a%��k��6��&
����
�r
$�§�z^N�_� 6g�� 2�q�{ۈe��VCM��15�A
�*�b��	���
- �vGo'�)R���$~���>
�h$
�K<�
߈�ݣ[���O����xӡ]/4���/UQ��hL�вĶ��oE� �QZ!QPI�!��ѹU�)�]���e�j�V���I'2	�aFƩ�.=pfX��əP
dXᦁ�d�XCF\L�^O�G�vJ|D� ~�B��L��
�.�
Lh$#���?n���kB1�I
��3����r�n�i��D�x�Hj����
�X�-9�~�{)��(Gұg�H��w�b���:H'���Y$�i���.9	��gB�+��I�E�~#��
�4�
-i��
I���
���JRL�v�!@��ϋJ�G��X-�X�ߩ�����Q���#��
�e�
�
-A�:1�إ�d��Ho��<Xf3"Eh$OF��F��FU at 2A�eM���ip���oYm��D��"��׾E�?���Lf0�kF_�5�,IP��5
���5�`�ᚎ���0�pMǂFf!u_�������=�XH��{
X+�͡bF�Y�
Z���^
�=&���2{Z*
'A�.z��~i����M�2
�z ��رa~�v��qG3n�X�"I`
*bUlk}���議��*ǭ��6wo@��R��
�t�o�[�ȤU@���j���
�DYu�2�Q��"ͻb�$v���ؘ*-����}��be�ՕU�㉎�^sg��/�w��-X�X��-�S�7�wa�"���!��������C�:�,���(2X���t8�W'�Qz�(J�Ӂ��M��9��N��	#�8��_�0"�ĵb;�4���Y�f<�|o�r�O�%�d�C)#�}��J�0�8�D��Q�4�L1޽���N�)�n�k������!��C�=r%�@�e����
�\a+K�ɟ,֒�o�%���B�H�u�s�ΐ0:�4��k����LTo�V�i�l�e�rR|<܋j�s�\f
L� ���X7�FW� 0/
��
-{��M
�[�&�UmJ��\�	��PG
(����‘j�+�/%���`W��͋�N�T��g6�xzb}"���n�\��>
-��X���#ǧ��}"*A�tX�
��h��a%�o�w�q(7h1̍��?mP;
x������!}Kiԡ�>8'�w��7��U���a1��>$�i�' �L��
�'23J����*#Y��+9�	4
�k��_Nݔ� ��Y
�<�HM
�
rZ
)�?u��X�_4꟎��/����Y�/��B7��p���J��Ir
�˺R�l��Vme-|�-����7�X�:N�2���I}�S��77C}d~!8����C�oN�A#:N��{�z,V���m���
dZ��3�w'��O����Jl�{� r����yeȴ<��\0�
h�n!I��՝�o��(Þ��Q� ��oƠ-��H�Jl.&��PW�J�ۮ(�΀�8�����A�
D��,�ִ{A�uv���)iL������d��vc�'5I��t�za� ߶��N�7b��=���r���O
�i��P��o�݅�菞}��B1���r�"|�6�����������p���<G�� [...]
-endstream
-endobj
-2964 0 obj <<
-/Type /Page
-/Contents 2965 0 R
-/Resources 2963 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2827 0 R
-/Annots [ 2959 0 R 2973 0 R 2960 0 R 2961 0 R 2962 0 R ]
->> endobj
-2959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.893 348.133 513.996 359.037]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) >>
->> endobj
-2973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 336.178 155.753 347.082]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) >>
->> endobj
-2960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.473 232.804 424.869 243.707]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a63bd7c7767faf3c219f9c2762095e2dd) >>
->> endobj
-2961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.932 103.659 206.516 114.563]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators_a9ccf426c9d89537e0351aac50a333e95) >>
->> endobj
-2962 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2966 0 obj <<
-/D [2964 0 R /XYZ 89 770.89 null]
->> endobj
-2967 0 obj <<
-/D [2964 0 R /XYZ 90 721.073 null]
->> endobj
-2831 0 obj <<
-/D [2964 0 R /XYZ 90 704.201 null]
->> endobj
-2968 0 obj <<
-/D [2964 0 R /XYZ 90 704.201 null]
->> endobj
-2895 0 obj <<
-/D [2964 0 R /XYZ 90 623.119 null]
->> endobj
-2969 0 obj <<
-/D [2964 0 R /XYZ 90 618.636 null]
->> endobj
-2828 0 obj <<
-/D [2964 0 R /XYZ 199.727 549.324 null]
->> endobj
-2970 0 obj <<
-/D [2964 0 R /XYZ 90 544.741 null]
->> endobj
-2971 0 obj <<
-/D [2964 0 R /XYZ 90 448.685 null]
->> endobj
-2829 0 obj <<
-/D [2964 0 R /XYZ 90 413.125 null]
->> endobj
-2972 0 obj <<
-/D [2964 0 R /XYZ 90 408.642 null]
->> endobj
-2830 0 obj <<
-/D [2964 0 R /XYZ 267.991 339.331 null]
->> endobj
-2974 0 obj <<
-/D [2964 0 R /XYZ 90 332.691 null]
->> endobj
-1576 0 obj <<
-/D [2964 0 R /XYZ 487.773 224.001 null]
->> endobj
-126 0 obj <<
-/D [2964 0 R /XYZ 90 205.941 null]
->> endobj
-2975 0 obj <<
-/D [2964 0 R /XYZ 90 123.245 null]
->> endobj
-2963 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F24 529 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2981 0 obj <<
-/Length 2451      
-/Filter /FlateDecode
->>
-stream
-xڵZ�s��_��C*M, 	�t��i/����ٽs�.7
��-N(R�G]�����X�"e���ꃆ�\�.~�@|v;㳿
�����f	K"�.of	��0a*��j�y���/�?͂(f"�`�m}{����������ˣߎt����x�m�>�4�4�,H�ٝ
���2�o1�t�#�X�L*,��1�ƌ	��p|1��b)8��L��Y-�R�Pk�:߶yUZ��'�!=>[ʐaB��\�e �</�]{��k�D����i[�
U��@�'�*�\��6v�����
-Ӎi�if�b�����_��JC-M?;u�k�P�_�i}���R�fȨ��$%J�DC�y��W�˪���lM}cH�h~��kѮ��5����kLMM��v�(�-Pe�Un!C*A�u2?+�����c�J��s�P����֕E�+7��iƥ�B���������
-A4?;9ǂ�uA�w9n6�7
�mVRl*�Y5�V�PSJլ�Mٺ��ȳAƈ��z
!�
����i�:�b╻G�-x
Nv��3��
 �pq�
-$��C��(LYu�nv���1mrԭ�w
����,3M㖪�%7� �u�W0X�W����ͦ�*�M��
����1���#��}9SP��Jŏh�Z�"�� F�Ӂ�
X�%�k��v�����F+�>�΋�ޤWUq�6�:�zOuzzv~u�-�{���'�����X�
AI��X�hMw��"�2'�WӦjZ*�
5N�g���۔U�H�RG3o;�Ʊ_ă m�C�bM;����Q:ګO�Mk6ߒ�����c�{�[
+y���_��Yî�m^b~���`�\�q��,���8?ګM���[ڣ7;��d��<v�s& x��t��?�2}C{,��RgQ�|t+i�Ho!��|���9ʀ�i%�:C-ٱ
a���1j-
�0������;��:�k��鵷z�Z
[`V��F~�ϥ���]���9=,_b����
�-슨ԘQ2���	�:�l���r��
��b�g����XV{�7֓ZF�?���SӔz�D�mB
C�uz��z�p�@��:�
3���ws�U��%Y�%Y�2�9%YU�m �Ҭ�*�i���'nM�:=k�.\�0/C�����H�5��1�R<�]J��I�_>�$!�e\Ŗ����\,9���s��C f���!X��{,��xn��1俎��2�L�ј�)T��N��B8	��L
-��ᘉ!
��c�,\���@���B7�k��a7�r��4��/��x�P�L�hJ�cbqlq`L�v�r��l�[L`'dШ��R9�0�8�`(A��ԫD�`�ԖV$\�m���H&`W���
y�=
����{�O�"�L at 7�G�`�Vc8l&����Ix���YY�h�"/�IJ膕>̲෬���5���.�R>{�gnc
-��lc¦��9�
�R��H2
�)E~�07|�6br���T6����s�y�2��] 
�/�!��-9E<���SWi�qS�r?�D���U��'��*���GL�!���܆�G��)�{���(`�Ɠ�I��Q������)�`Ɵ�
-��ӏ�R`
^�	3
�@3d���yv�B�Ou'�& ��,� *"��!�X���k���'�>4Cy]���#u�Iɀ�eOˤ���+dz
p�K���CS$�aҨ�a�!��<�h$Ì����g��u
M�k�P�/�,ݹ?��� �b&�^
|*8$`M� ��K<-:
��U�$��Ԓ��oE�dn �����eR���(*8�:g�Wh�W���U��J�i�
��A�	
%/䥈�G���_�������T���e
���h*��!���aAG�7��@"9�
2�
��1>
�!�
����{�'߮}
-�Ui���
�(�d
zx������)>�
�s8zH���y�G�vu9����6D#�
3<���6��[My{�ꎀ+��N3
��e2-��i
v�lti�apE
Տp^��M�w�:�R�}h6mZ��ڱ�����h��[Gn�5����C<�J�XU#V�g5
=�R���w�4��o����+YU�!n�Q>�_a�[k�� ���Z�i���r���+�z�{:M�ዪ{�M�3omSӳ��=���n���3S�~޳����-�ȯqM6$�,�/x�u���kG����1���,`v�;�E�:܌u�j��Rtj1��ͶH[C�fk�<-��鈴p�0��-
a3����*Y�6n^Oڿ�
/H{��/>���yd����#O
�Pǃ�>
�V�2�w�
^\��}&�N�C�!i<����f*���

�\K�9,�N?�5��m��ۑ[�厠l1�$
-��	��/:v
���� /����=-���QJq���O����h��x�E|�ڳ�7zl�GW�n��m�==9��n�,�6=�nrB�Hn��u��(��?�6�h d�
-endstream
-endobj
-2980 0 obj <<
-/Type /Page
-/Contents 2981 0 R
-/Resources 2979 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2827 0 R
-/Annots [ 2977 0 R 2978 0 R ]
->> endobj
-2977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.669 529.424 211.204 540.328]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library) >>
->> endobj
-2978 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2982 0 obj <<
-/D [2980 0 R /XYZ 89 770.89 null]
->> endobj
-2983 0 obj <<
-/D [2980 0 R /XYZ 90 721.073 null]
->> endobj
-2984 0 obj <<
-/D [2980 0 R /XYZ 90 469.728 null]
->> endobj
-2976 0 obj <<
-/D [2980 0 R /XYZ 90 445.961 null]
->> endobj
-2985 0 obj <<
-/D [2980 0 R /XYZ 90 445.961 null]
->> endobj
-2986 0 obj <<
-/D [2980 0 R /XYZ 90 375.415 null]
->> endobj
-1577 0 obj <<
-/D [2980 0 R /XYZ 90 224.782 null]
->> endobj
-130 0 obj <<
-/D [2980 0 R /XYZ 90 219.995 null]
->> endobj
-2987 0 obj <<
-/D [2980 0 R /XYZ 90 160.811 null]
->> endobj
-2979 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F13 834 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-2993 0 obj <<
-/Length 1558      
-/Filter /FlateDecode
->>
-stream
-x��X[o�6~��������.*����[���(�N�I�+)k�_�Ë.��4Yl��b�u���}<$�."
=�=:��<MX��TR�m�G	O���o
��	�/����"k�|R��J�m�6���#��8��g/f?��>���q�JT�*go��h
�/"�X��OvPq��YDof��?�i

,�
��ạ�0�r��u�j�d���S9��(��4Z�3�=�԰
)���k��jND�g�֍��qۍivz�gE�ź�q���=�Q+�6ۧ�]�9t�t1C9G�H�iql��u��P�e�6n| ^%�Q��Z?���v�MU�+Yт1�K`��B�O�"�aLWZ�v3�?��VM�\����W�y��h*7�Ne��5�ƳWK7�8�\
�¢�_�|p~:\���&�c����9"��|���fk
%iڍD&w��z�
�!���0R��N��6>�����v�Z�.ȅ^���o*C�q�q
����(�����K��\#߶���aI�ʿ3�h�&$�X��F at +�)��'-H��Q�BP���
�
�jO�
��:�N���q%:ӈx��9�qV�١�A��������!�kJ�# D�Av�-��
-�sF� 7�חz]�@1E��I0P
�MD��e~^g@'_��>��j��8�s^f��$.�!,`$A˦�ň@$�!����ֵ�ڼ�Џ� x9N�=��`gzA�e�5����ڮj��������u��
ajm�C���
O��ŦGfhQuT+}O~���
-����/�G�]�]Wk/ӄ�ˇ����#��9�חݮ@��G�0�Ջ�O7qr��a(	�D�$oz�<�m�V#
3u����/�B�},�?���|�����0]n��җ{�\
U�'+|�υ���Z����*�TsS0K��v�0�`�O��ͅ3�E�FdA��TG�]��(ࢳ���C8��e�%106�
[D�{��:
0|�
N��� ց҅�K�(#�L/��!*��qU���'O)
簛E�ץ�X�T���:�Ci
� _7���Y��4�����]�$
f�rJ�]š���ia
u������C f"�B
e�>P�^+zIj������N��?��1�t�3����6+}�o��`ɑL�$�
3��d
E�-�JAQ%�ќ�Ҕ��[�R�
�vt� �hL%)�������d����*8WM��)eu, at u��r
-�(:��
T�$$�}����cir[*�0���6�Eb��7(
��Ȁy�K��eר�bw/��P�Ls�4�0���s
-
]�`db�|y����|P�EB�M�>�TAID�� M1l�<��u�֠��~"��]��Yq��#0�	�Fc�~.�<�����7��g;<oף���n���ErO� ^F��A
Z�N�/.��3��!q��
�m���
-�
�]��r_�饽)6��]?"�n|�m�:�����z8DC%
��_B��]0
�?�����:g�B��0���}ٶ�ӓ��
8�_�H�AV�֑"��諒�j݅:K+����ΏC�$i�	p�GP\L����}�}�;N��,zR������ W�6
-endstream
-endobj
-2992 0 obj <<
-/Type /Page
-/Contents 2993 0 R
-/Resources 2991 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2999 0 R
-/Annots [ 2990 0 R ]
->> endobj
-2990 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2994 0 obj <<
-/D [2992 0 R /XYZ 89 770.89 null]
->> endobj
-134 0 obj <<
-/D [2992 0 R /XYZ 90 641.366 null]
->> endobj
-1716 0 obj <<
-/D [2992 0 R /XYZ 90 606.788 null]
->> endobj
-138 0 obj <<
-/D [2992 0 R /XYZ 90 606.788 null]
->> endobj
-2995 0 obj <<
-/D [2992 0 R /XYZ 90 514.019 null]
->> endobj
-1717 0 obj <<
-/D [2992 0 R /XYZ 90 406.315 null]
->> endobj
-142 0 obj <<
-/D [2992 0 R /XYZ 90 392.613 null]
->> endobj
-2997 0 obj <<
-/D [2992 0 R /XYZ 90 287.788 null]
->> endobj
-2998 0 obj <<
-/D [2992 0 R /XYZ 90 233.349 null]
->> endobj
-1718 0 obj <<
-/D [2992 0 R /XYZ 90 153.178 null]
->> endobj
-146 0 obj <<
-/D [2992 0 R /XYZ 90 139.476 null]
->> endobj
-2991 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3025 0 obj <<
-/Length 1476      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~���^2�R7JF�Х�K;�񰇴d�N��Jj���
��d;��n:
{0$����w�s!��K
koG��G�o��y�s
G�/5k�����H��=g�y�N3
ρA�ד�>�_���m������@ֈ
o#�ja2����>��02=W�i:%�e�����#�����T!"�<M���e��l<1l�G<�A"�,3!_fcb�H�ū+��?�
��t:;���i�1�C���(�'�����	+��6�k��~ª�5�B�fy9�%��z���p���Mc;N}8>M,�UX�h`d��k�x�
�ș&kS5�y[�Y��L�ڬZ��
��1\�=KL��7U�<K��un�8�2]
"[R�'ð���Z�K��Ƿ#�bbc��
��x�]���1��
zy��^�U��8��بU�[U\J:���RTa��='&��bl`��qT�
�||],[���5��<��RkB��6���k�)f�b���Y�j
Zw;�)
����\�� ��:b�l�ela��\�IƖc�֥F,-�R�,��fV_�%�w�o0�Io���L� ?L��꛰�W�X~(j*��7�NT"�f	O�Z�]
߯摘|de%R���bd�AB��W���8j�����%��z5�u>,�_���h7f�_܌!`�]��9�)Yx~�M
-D���6"��V
��);��zY��n۩��J��&�i;���jH���[
����ʹۖ��
램�L�Ȳx�����C/^<uT9�3
�mbDL�3��ؽ��K�[S�Y��M�	dQ���	T�?��Cvf�16���
���x7�u Wg� �?�~��U�YVE� ��`��i���C���9��*ɿo��6v�M�� 3,���(#(@�Ca
�FNo)�����|�`��Q �A�	R�b��"�@�� �x�� �4��!
�����A)��}�Q�,|��<�e�
�5�3,q=D�t�\���
:��,�,D��n��a�@aF�G�����80�C�)ۜ�VI��[�
S�?��X��s�=�
��GU
Hǎ� ���|��dž3��vf��Kyl�
Z�D�2w�45�
���K;ƠK���x54�K
�"�T$��f�_�
���>
nľf� 9R��n;NC��Y�
 �`�.bby=D����,\b�A���a֨
ϡ��a[+�v�Z��;�j��
-CV�*~6�a�[�2��A�
���=ث�^�=�n��Qj?��'aI&V~��2�\���Q2g�P#��<��:�����FeX��tU��Z�	os��]5�a���4d���@Z�r���m��福3�<�mOzo߈���an�����Y�=��R��RC])��w\)��Bwy �&����e-��Y`էA~޲g6;�/L�\Gų�AZ���q�Rc�D�U^5X��t�Z�H���������7�N����,���񢺄<p�B�r6��V(xӎ�����s�e}(XW�h�x� u��
-endstream
-endobj
-3024 0 obj <<
-/Type /Page
-/Contents 3025 0 R
-/Resources 3023 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2999 0 R
-/Group 2989 0 R
-/Annots [ 3000 0 R 3001 0 R 3002 0 R 3003 0 R 3004 0 R 3005 0 R 3006 0 R 3007 0 R 3008 0 R 3009 0 R 3010 0 R 3011 0 R 3012 0 R 3013 0 R 3014 0 R 3015 0 R 3016 0 R 3017 0 R 3018 0 R 3019 0 R 3020 0 R 3022 0 R ]
->> endobj
-2988 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 3041 0 R
-/BBox [0 0 214 206]
-/Group 2989 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 3042 0 R>>
->>
-/Length 483
-/Filter /FlateDecode
->>
-stream
-x��T�j
1
��+��H�c(^\�Bm�Y��榄��t�߯�=�[ڬ�0�cY>��3����
����
-�A~^������?���/��A�'us
�N�>�0������+$k��M5��B
lD�Q�by$G��Rf�(R!�[hif��]��0��c���b��;�0����
Lgu�)��G�k3�ĜG�ƍ�%���� �i0.[bu=6��=��}
Oi�B�P
;�aL�Sn�@�f���4�t�<�Ԝ	��y>���$s�!o������k���ߋ�	�U
@�fR�%����v�ua�;�zY������7��ĺ����ۓY���zZ��.SQ
�(�����L^#Y��~oR��=�����0�7�t��>ϋ �Ix����38���ݾ����RS;2
-��r��9�+kAV��� D���/�2è�ԛq�:�n�����/��R�gL���D5Ԣ�y&$\�f%����
�
-?_
-endstream
-endobj
-3041 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-3042 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /KKKUXN+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 3043 0 R]
-/ToUnicode 3044 0 R
->>
-endobj
-3043 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /KKKUXN+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 3045 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 611 722 667 278 460 500 556 667 500 556 500]]
->>
-endobj
-3044 0 obj
-<<
-/Length 3046 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0��<���!	�����¡?*�{� cr��k<V*�H���^ڗ�

K?�$;Z�
�r4Ow'��t
L�s��D
-o9
-���ܭ�Bck��5K?�8/ne�g5��0��w��
��vߗ����?4�YX�4
S�}�Wa��H,
�}��>,����*�VK,�q%9)���䄹RRg�4���4	�O�+�z-o
r�˳�5��@G*U9���@�4�-R����Agh'� 
@=��@e좠�.�7Ӂ
-�g��|�ɑ�$�Hˑ���[>�gQ��
-P�� _�

�*���W��r䫊0�8�mH�F=6@ޝ��k���{0��L;���_���
-endstream
-endobj
-3045 0 obj
-<<
-/Type /FontDescriptor
-/FontName /KKKUXN+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 3047 0 R
->>
-endobj
-3046 0 obj
-343
-endobj
-3047 0 obj
-<<
-/Length 3048 0 R
-/Filter /FlateDecode
-/Length1 2404
->>
-stream
-x�UV{lS�?��#N�:v�k�8
;�C
_?B �!'&�h
�`�C
N*�Bۄ�R�T�֦�
�*�ժ=U�[;iB�EPi��N)m7m�#l*0�im����u��y|���
��w�=�cy��qV?:��c��}
�����''V~��k̟��1=��O�G�ө�HcA�:�An��J�
_hxU��#��3�)�&ހ���gR
s��E��C���� c|��2b`��a�p�
\/uЄ�2_]���;�7
�I��#���LN��kՈހ�]M|r~����>!�]n��n��U#��U���GhA��َ��q;�b>���kL���rw���}{�{i���rm���C��ڪ�����wZ=U�D�o$���\���Ե˽���Y�w5h�ǝ�Zߗ_�&:l�bcQ^�Z�-)��=���o;w$�F}m���0�V�� F	HJ���Qk"����=���w=,����M�
-{"H��q �
m��ʻ���D��ݾTM�~_g_B���:��ڹ#V��K��`l����P�7�1ޖ=��0�����7��^���ʮ��L�*�Zd�[��bE=�>7�O��-.e"�X$|��ۗ����I�
��43s(5+�"&W�RfF�r�!��Y�n�������J�l~�D3�Z�Jn+��J�ns�,ׯ��~�[k+�s��f9��3�2c���h�Ċ�k�j��+�z�4�OŤ��U����6鸒��!�jae�U8�6D
�$
;6��!'
뜤%�W�'�	�C�O>5�5_,HO��{�����	M
<�L|��%X�խ���,�7g�#R�ӯ���`�fR!컨��*�

{��i�s�D"���x�wU�����H�37|(3;�� ��
����u��(-5a��~�r��/l�=������
�w�����\|`P=+�gRN�\�J�i�W�@|�dz��TS���-�8�����O���P;��y7�L��l��� �U|�~�h����V�7����q9y7�<~ �<1`����-��ϭ�����������Wtd5�L��tn`�c}�ob�)O�1��=��,�k��$����>�>���z�Xz|n��uy'UQ��v�Æ���E9&da����)~�%�EA:h�U���utĹ>$�TjVG�=t>�쳊
=�3�#V�����4�P�!ʨ��L�|<im|+��64��ɕ���z/4ذoB'��s1m�>o�@P��X�A]�[V�KB��
E{�SBB7��Z<ulx��2GG�-
�Z>u��ќ=�,}{�w���o�ƞ�x�������J�ijg�|��؎�B#���ޡ��E_Kc�
�|Z���+�P
Z?�Ofge�ӬmA�\�L=���_����Rt�}�
-]���<��xj�Ez����ym�N�||<������������g_�n���Sb���*l��ҭ�3�����;�9`��V�9zL���ս#���:J�	��N��FN�^�^���(+/0[��v>��&�]�N��
to1�;*e�0RFS�;�Ы�[�l=�f�KQ��*瘱R%^y�'^
��� ���ŀ��TD-`�����b���r�h�X���;\��/T}!������7�o��5_��O���^���g6����G�5_n�����߰�†y
�AQV����ހ�b���a̱�<h%h1��a
��͢��Q&�?�
�1A6�5�Ǿmʾ6��Iѿ��7�zЦ7�מ.��-Ë��!�W=�1*�Uxߨ�nQ�P�u��x��o r�ୢ�[Fl�8WZ�/�W�w�⦔�ōu�pE�� I������U
-endstream
-endobj
-3048 0 obj
-1813
-endobj
-2989 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-3000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 422.716 197.097 433.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) >>
->> endobj
-3001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 394.255 197.097 405.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_abe1602d6e19dcfeda71963b72ed61cae) >>
->> endobj
-3002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.434 394.255 301.684 405.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 366.167 197.097 377.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a514da3c88769e7584fe9d6da6f2cb003) >>
->> endobj
-3004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.434 366.167 307.621 377.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 338.454 306.286 348.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a243d9267fe6a9414af634749b27dac8d) >>
->> endobj
-3006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 309.992 169.013 320.896]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_acd547a5df8e528ed1ab16c8f19c97685) >>
->> endobj
-3007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 309.992 256.016 320.896]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 281.905 180.54 292.809]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ac2c8b1fa8685b79a6e0dac07128b24d9) >>
->> endobj
-3009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 281.905 291.064 292.809]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 253.817 178.239 264.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a2bd978ad611c80d14315255b1577772d) >>
->> endobj
-3011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 253.817 288.763 264.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 225.73 181.845 236.634]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a6cb598653a5f9e64b0b42b88e5a9b5d1) >>
->> endobj
-3013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 197.642 181.845 208.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9b395593b699094656f3cc00361976f4) >>
->> endobj
-3014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 169.555 154.727 180.459]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a5e151ddb186280f9ac6825e4b38e3d4d) >>
->> endobj
-3015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 141.841 176.505 152.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a8ca5257af8014cbcb2b4723340b9139d) >>
->> endobj
-3016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 126.75 450.955 136.656]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9b395593b699094656f3cc00361976f4) >>
->> endobj
-3017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.421 191.718 113.325]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-3018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 102.421 288.852 113.325]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a3611ca64bf028cea3b37bbfe3c5f84e6) >>
->> endobj
-3019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 191.718 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-3020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 74.333 303.079 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9561e112f9dc57e63230b0fda3858e1a) >>
->> endobj
-3022 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3026 0 obj <<
-/D [3024 0 R /XYZ 89 770.89 null]
->> endobj
-3027 0 obj <<
-/D [3024 0 R /XYZ 90 441.432 null]
->> endobj
-3028 0 obj <<
-/D [3024 0 R /XYZ 90 441.432 null]
->> endobj
-3029 0 obj <<
-/D [3024 0 R /XYZ 90 385.249 null]
->> endobj
-3030 0 obj <<
-/D [3024 0 R /XYZ 90 355.436 null]
->> endobj
-3031 0 obj <<
-/D [3024 0 R /XYZ 90 327.348 null]
->> endobj
-3033 0 obj <<
-/D [3024 0 R /XYZ 90 271.173 null]
->> endobj
-3034 0 obj <<
-/D [3024 0 R /XYZ 90 243.086 null]
->> endobj
-3035 0 obj <<
-/D [3024 0 R /XYZ 90 214.998 null]
->> endobj
-3036 0 obj <<
-/D [3024 0 R /XYZ 90 186.91 null]
->> endobj
-3038 0 obj <<
-/D [3024 0 R /XYZ 90 158.823 null]
->> endobj
-3039 0 obj <<
-/D [3024 0 R /XYZ 90 119.777 null]
->> endobj
-3040 0 obj <<
-/D [3024 0 R /XYZ 90 91.689 null]
->> endobj
-3023 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F67 3037 0 R /F75 554 0 R >>
-/XObject << /Im4 2988 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3062 0 obj <<
-/Length 2222      
-/Filter /FlateDecode
->>
-stream
-x��Y[s۶~���S5����K�˙�I�&�S���"dsE�$���gq�H�b�Xy�C"��b�� n
��엫��ׂɘ���2�8�D<����cH0b�9���3�ô^�ח3�êx�SY�^��o�~���|sy}5QX�H*u�{������6��1]�iq턤+ժz6�
�/��i��{�Tvr�P�9��R���������?g���Zr$�`�:��72h�5 ]eܛA� �
~���ٟg�mx��@� đ6 ��$� B�
ޫvS�N��Nُ&������<�ʍ��;�WjUՏ�;-Sm�[����d����q�W&I@�T5���
E�
�P�����
4�%�S?�z#����9e1J8�"ɝ>Q����s����µ듩o��7#����mw�n��9���~Q�M;�Un�
�∂j�Q4<��0��i�3
C"&~P�.-��Te�.�=�u
-h�a͹C��*����W*s�F��=�����%�Z���QD$��*���&��M�h��n���a8��Hz�p�{�*�u�v�7�1��GY�
Ro�f�~Qd�jp�$FK`A����A��F�M��7�>���C�<���A��[������nO_�qτ� ���z�`}¥�����i���y{7&���N���ଏb���Z�Ӹh���j�Z�+��g��P�U��U���[�`��v��OSZ�~e"����*U�|��~>
���\���� �cӮ7΃���r�P���ѽ��l��#
y��=A�)��l&�,ל���ߔw��;�g�Nm��õv�^�i��D�jӼ�_�fQ�k��7���M�Xg��
�
0�K��bcV�1���iњ_�����>��Lb���F�l��m_���v����K�ֶS�{Xתi��п�V7y���vH�
[R<�NK����rQl2��7;!�%n'Y>�<��g�֐���DAp�%���8j3F�lg^�F�[�
�TY��Ҹ+��s� [...]
(!܈bı��Q(����"jD)P��S�@1F���*تm6OB[��k@#Ѐ��h�A�(
jp5�

��
]@(:��Ct.�Yp ޾��==Ԃ2:	
�^�=Z>:J�\�3y
-�"H8M&4Ҏ
ـ
�_lӠ�;�J�0Cyk(��0���-;�̲�G��.�|�3;���6;�t?�q�|D
Tsl��j�tiI
�/�
���IHK$��Ĉb\��3����b�Aƴ�'�X�E���p�B�Um�SF
� �L��U6bM	p�zy2�N%!5�P
꜒`�`K�&����@�Ϻ0s0��{�A
�2$W&�H�H_��
�QF�,LȤ��������R(6(
a��Hҁ����

-� ����BB�0�5,#�|t?Q��
���k;u��l���+6��K���*l"!�$GdJ*֤ ɎT��;,�!LCC<��o ��:h.Sh|�.C� -K*��\�'`����Qf�w�`"ӥ�o=�� �)�/&Yr��yQ�9��ʎk��r+[c�?�M������[��|,���>�x
J%���;�7�{MK�V�Z��0c���$�
a $I�~�����')1�ݾ��[]�̈E0�%�+�m׶#2�Xz@�1���8q�ֽ�v�[�_^�

i��F$CH���
A���h,�1#$r�N���8Y�SH�0� �J�L
)�zX���=���u8<A�5AqJ�
o� �x8I0p�ƃ#ϡX�dW���i�!g��{!�
-��DA(��Z
�4���4/g#>��e�P!2ޚr{�C΄�Iw
-��ݭ2AA ���_�!6���]]����{ڱ�
�H����Xz��(�j�|�*�K0	�����BTtZ��~��ǡ���K_���ܽ�:�_�l6�����P{��m���)Nvn����;�&�{����(ߺKbze�>c{cn@D$�I/Ț[�˷��F���q�Y�]Zn|]�K{k���O�y�շ�����VW����vf����d�خ�k�������Q�-ZT��ұ����?�UUw��:�3#_�uބ	�c�-��̏�Ԍ��N?�5��Y��e�s�����
-endstream
-endobj
-3061 0 obj <<
-/Type /Page
-/Contents 3062 0 R
-/Resources 3060 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2999 0 R
-/Annots [ 3021 0 R 3051 0 R 3052 0 R 3053 0 R 3054 0 R 3055 0 R 3056 0 R 3057 0 R 3058 0 R 3059 0 R ]
->> endobj
-3021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 695.379 150.493 705.91]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_adcaa7cd147b3ebb7c52d232824de49e4) >>
->> endobj
-3051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 597.923 156.281 608.827]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ad59c13d00ea95d4ed045bca314f5e5fc) >>
->> endobj
-3052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 597.923 312.663 608.827]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.875 597.923 483.441 608.827]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 570.028 226.034 580.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a022891f0008542ea787d812e6e6f9e48) >>
->> endobj
-3055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.157 570.028 478.723 580.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 542.133 156.281 553.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ad59c13d00ea95d4ed045bca314f5e5fc) >>
->> endobj
-3057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 542.133 312.663 553.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.875 542.133 483.441 553.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-3059 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3063 0 obj <<
-/D [3061 0 R /XYZ 89 770.89 null]
->> endobj
-3064 0 obj <<
-/D [3061 0 R /XYZ 90 712.265 null]
->> endobj
-3065 0 obj <<
-/D [3061 0 R /XYZ 90 644.196 null]
->> endobj
-3066 0 obj <<
-/D [3061 0 R /XYZ 90 506.267 null]
->> endobj
-3067 0 obj <<
-/D [3061 0 R /XYZ 90 506.267 null]
->> endobj
-3068 0 obj <<
-/D [3061 0 R /XYZ 90 406.131 null]
->> endobj
-3049 0 obj <<
-/D [3061 0 R /XYZ 90 383.754 null]
->> endobj
-3069 0 obj <<
-/D [3061 0 R /XYZ 90 383.754 null]
->> endobj
-3071 0 obj <<
-/D [3061 0 R /XYZ 90 294.305 null]
->> endobj
-3072 0 obj <<
-/D [3061 0 R /XYZ 90 204.352 null]
->> endobj
-3073 0 obj <<
-/D [3061 0 R /XYZ 90 103.663 null]
->> endobj
-3050 0 obj <<
-/D [3061 0 R /XYZ 90 77.486 null]
->> endobj
-3074 0 obj <<
-/D [3061 0 R /XYZ 90 77.486 null]
->> endobj
-3060 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F119 3070 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3092 0 obj <<
-/Length 2153      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�8~ϯ0�@Wj��`f���:��d/��-�fbae�եi��ϡH](ˎ[xw
v օ<<<��΅ˆ������ϰ�����גM"	*&�I�'2�p��|"5�4�e„B$0�~��w��ͯͻ���g����b�s$�d�>��	O���X�Ej�PZOB��7�\��~�=�j�@��!��2I�G�3�1n�,�Ψ�Ք�A���]��
��%�
��C�Q���mW"%��z*]M
@
B�Ǖ^�#P"S'рR/�����6���L�Wo�F� O����!��Or�GV�P�d�#Τ��l�/..a�De�c�H�tW�V�I
�8E�
1P�/^�R��V�q��?�h��s<�qƂE�)J�ހw3J�!��@jĹ{�w{���ܮaE
��D5}fG"{C�Ģ
�8&aղ
��Q�:���q�Z���H(Qr�D�����7��.�ې�P��Be^i;�J
-1i%w�

l��"ۤ��
-^ճi؛�CDYo/�������UR<��Y~WHI9��'E�P�VH����s���3�R@�@�� ^���*.�ՃAB��у�}�m0R��U<�8��l����Eyp�s�q�m���۵�	8���^
$K���_:n��Xd������d�(DE�
�
��Do���e�p�x�Ӹ���u�Y����{�-*л��G}��:�Ui8\�M'_
����!
-�⭽�9�K\��ֱ|o�S���@�&@}���t��D[�|}>��C���f��'"?
=�1p�w�}��^�aA�����[<|:
�G
����A�v,4Q�-f�q���CR�Ƥ �px( p�V�|�	�0gn#��/u�-�%$���u��2
΀4	�qMߨ�B
�p��1HB��=�@6
]o��P|�.:f��Qԣ��Z�K���
LN��%
-	!
�ű�zT�<
��~��
�[Un+�[�B�:.���� ���7B��|��m/u֏� K��H\�H��]���n��ƀ�)
-��l�LՍ�4�Le��V �੾� ��r$�+�?R��Qf
@�ݦh��u�7j��2��
�)4u���T9a���
��J�t
=5�CjdE��1�RP�D����:x��Wc�#F�$ �9#�׫x�J��
-i��Z���J�kF�DŽ(��[J�m��v���PRΧ!ĉ����?�20��B$
�
�Q嗚��\ΪͲ�K�fn
-���P���_��"��z$�s�Z
L�ɂ|
���c�@�H	�|O�(t����>r8�n�li����q�
�L7e(���}A��K�Ĺa0��;0����fFז���ߍ�}szT�N���"!B{�Dۅ ��
�ռ޵q��l#,d��mpV0��`�#�� #S����Y��M1=^��M����PK2y�=���\�d��6��Ҧ.�� _Km
�.�>�,��
�T�Ye��$�{��ZV93C�_�U��I�4>Yj��M��b�����1>3�A���׷:�;��1�)z>.Ir���ۡ��%�vϏ���?�l�[fM�½I��UWY�=�B�M���1���I�zy���{i��?�_e�	Z�N`U(�v�|C$��=e�wN'Ѡܛ_��\:���7�
<}V�I

1�I����<³�8�h�$�N��m�l��,C��ň
���N�$6��Ft�� �.��o�Ua���8p������}���������@Ə$7
Ƒ<.G�߿� v��˃�NF��}hx
K2
��4�t�c^g���0�%e
�AdCiA�S��}�N���bY-�
-��>
�H����3��˚�	���*@`�G���%��<E��1A����Bo�2|�Xd��K y�h�f
*
�ӌ���}�v�f��6ST
(O��*}>���h�{�Ũ������!���?�
���6�p�
����Z����H��Ǫ�=�*�2No��dss�XZ�#���3:������轉�(*����z)i��]�l��o�l�*a��țu�^�]J�6]4��u���[{�B��������j>W�|1��yѦd�j[9�^��V��j���nl{���.ݮ�r{q~~[�C��G
�|�2��ݙ|{
-�m
~x���
:����
-endstream
-endobj
-3091 0 obj <<
-/Type /Page
-/Contents 3092 0 R
-/Resources 3090 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2999 0 R
-/Annots [ 3077 0 R 3078 0 R 3079 0 R 3080 0 R 3081 0 R 3082 0 R 3083 0 R 3084 0 R 3085 0 R 3086 0 R 3089 0 R ]
->> endobj
-3077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.857 295.838 243.473 306.742]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acfed8bc19e046453778c9d99d84df283) >>
->> endobj
-3078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 267.771 155.464 278.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.962 267.771 221.894 278.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a12dc6df3a06f4c97c6bb2264bbad05ac) >>
->> endobj
-3080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 197.563 181.845 208.466]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aedabe8ecd0866b972e97709e17f94681) >>
->> endobj
-3081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 169.495 181.845 180.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a82b35fc075e1e9542d4cc5cff2e236f8) >>
->> endobj
-3082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 141.427 154.727 152.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a93c1c491c0035f6c38b9ee036184aa7e) >>
->> endobj
-3083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 113.733 176.505 124.264]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1a6088f536e9340145630576cfd6e6b9) >>
->> endobj
-3084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 98.653 450.955 108.558]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a82b35fc075e1e9542d4cc5cff2e236f8) >>
->> endobj
-3085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 191.718 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-3086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 74.333 288.852 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a033967c42f02b6029fc4d6153eb8072a) >>
->> endobj
-3089 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3093 0 obj <<
-/D [3091 0 R /XYZ 89 770.89 null]
->> endobj
-3094 0 obj <<
-/D [3091 0 R /XYZ 90 642.502 null]
->> endobj
-3075 0 obj <<
-/D [3091 0 R /XYZ 90 620.087 null]
->> endobj
-3095 0 obj <<
-/D [3091 0 R /XYZ 90 620.087 null]
->> endobj
-3076 0 obj <<
-/D [3091 0 R /XYZ 90 566.427 null]
->> endobj
-3096 0 obj <<
-/D [3091 0 R /XYZ 90 561.944 null]
->> endobj
-3097 0 obj <<
-/D [3091 0 R /XYZ 90 505.774 null]
->> endobj
-770 0 obj <<
-/D [3091 0 R /XYZ 90 420.35 null]
->> endobj
-150 0 obj <<
-/D [3091 0 R /XYZ 90 413.642 null]
->> endobj
-3098 0 obj <<
-/D [3091 0 R /XYZ 90 312.921 null]
->> endobj
-3099 0 obj <<
-/D [3091 0 R /XYZ 90 312.921 null]
->> endobj
-3100 0 obj <<
-/D [3091 0 R /XYZ 90 285.117 null]
->> endobj
-3101 0 obj <<
-/D [3091 0 R /XYZ 90 216.642 null]
->> endobj
-3102 0 obj <<
-/D [3091 0 R /XYZ 90 216.642 null]
->> endobj
-3103 0 obj <<
-/D [3091 0 R /XYZ 90 186.841 null]
->> endobj
-3104 0 obj <<
-/D [3091 0 R /XYZ 90 158.773 null]
->> endobj
-3105 0 obj <<
-/D [3091 0 R /XYZ 90 130.706 null]
->> endobj
-3106 0 obj <<
-/D [3091 0 R /XYZ 90 91.679 null]
->> endobj
-3090 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F22 2996 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3169 0 obj <<
-/Length 2089      
-/Filter /FlateDecode
->>
-stream
-x��Zms����_��^{f��!��vfӤ���%ۤw�N��!���p'���{�0N
��s?�v�t8:�s^�#l�
l��^
N^
-f8ȱ�e\�6�� n�_S�Ӑ`d��c<�<t�Н\�(
Ƌ�ܟ&��Mp������ӳ���]��?�~=yIHE,qL$
^�K��R{3���ŀ�"����b��hL9a
��r�f�z������~��#�0>t
)rp~5�2  DY�#a^8��'6���W#k����I|.�����
����a�
�Zf�,u�
A�U�*�Ui����5�3w������a���u��	������d���2��,e=ˮ(D��L���3Ƭ W�����l
�jPmm� N�b��ZXފ+��>
Q"�1��v�)�I
-�d�a��j`|s\�q"
3�֊zݳ����ï��D�b�E�D�*A���9�DYϋ�4�zQ���(�L
-+3�m�.��l�F��˙��_b�@8�����'��B6�^҂�F3�2F'�m[����|��S��H����u��J=��L527q�dy�q.������jQqL,X
(�6��QZ&YyY��?)�I�`�~���w�R�>��:�Y]��L@
t����jiB��
�i ʧA
}	��hN�Q�3�S7���81�#?��19_��:M��
-��v�>�{�����[S�9S�ғ�}�t,�uv���V�5�'����
-x�2����%��K�
���#����o��vx{�(Eš���s
d]"��G���E
u��A���*�A�Wׁ�/����x�����__�qH�OFL 2�[$/^�+�O{*���
��-��r&r��Lk���*�X̩���c��V�W�d!�IK�u#7Դ�� ��HPQ�,��D��%#<A�A��,��
|#i�]�BV�|k�jik�Ҙ�kߍ��-J��f:f��.-qd��m$Lsg����ɭ�AГ1Og����U��G/������k��8*�_C
-&�&ڎ�
��{�>��΁�p����*˻PVM.�)8icX��{E�V`�
s�
n��J-	�x%I&�M����	��:Coʬnp�����3KVr�	��8踝�hE����4�+U��I�E�iPrP���Z�+��Y6��F�(C������K|����҅>9�P܄�r�(��M��6N�c�H*Lʃ���{	!	F�X���2H�#
-
�h���1�u �}��~u ux/N;��4��U:a\7�n]�)��mc����j�h*�r�\�_;
�a����V�s��
'�^8��)��>}��3B�M���*��g= l󣧼$�6�9�៳׽x������B����̝���|���d�aֵ��s̻��Φ5�MD��y�]ܷ��~�=��~���Z����{������ny�@b���
@X�cE�'�Q*^���ك

�
����PWE����R���^oudg��9�����.�����t�!�E�^�����qI�p��z�K�(3-�
*�یu7�n�s��ZP
'�]ޓ^��,x8FȶI��_�
��V��.���GY{��BN�
�p��CM���"�.j6�ZjV��*�Ϙ�4%���ʿ�,��I�:	+��o�����Bؑ�B
�╠�~x�� �ry���^�:֝���]������zkk�rV~��aG�5��=�MS��=�����߼��1w�{e�����[�i�Z���G������I��{#�IJm
Gex�2�aDX�p�=k6�M���� �C��AZi
-��9dK�Iɻ(ۄ�LȀ�5��n $n\��!
��P��#h�vwZZ
���cF
�#F��瘶��#Fđ��
���G�+
� 
�����E���@�&2�s�
b
[|�
]�.�+zZ?���W�_V�"�ֵW�z��PԦ�K:�w�
J8��At���E����]��N�U�D�P@�
�����>K��_#·�o�hU�cH�J��ɦ�"��� �]�ESJ�e�~��0��EL�7
�g������j���
���[RW֡��z�MQ��qR���:*n
v� ˢ�%��_a"�GT��?����!3�b0��:�� ���
-endstream
-endobj
-3168 0 obj <<
-/Type /Page
-/Contents 3169 0 R
-/Resources 3167 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2999 0 R
-/Annots [ 3087 0 R 3088 0 R 3107 0 R 3108 0 R 3109 0 R 3110 0 R 3111 0 R 3112 0 R 3113 0 R 3114 0 R 3115 0 R 3116 0 R 3117 0 R 3118 0 R 3119 0 R 3120 0 R 3121 0 R 3122 0 R 3123 0 R 3124 0 R 3125 0 R 3126 0 R 3127 0 R 3128 0 R 3129 0 R 3130 0 R 3131 0 R 3132 0 R 3133 0 R 3134 0 R 3172 0 R 3135 0 R 3136 0 R 3137 0 R 3138 0 R 3139 0 R 3140 0 R 3141 0 R 3142 0 R 3173 0 R 3143 0 R 3144 0 R 3145 0 R 3146 0 R 3147 0 R 3148 0 R 3149 0 R 3150 0 R 3151 0 R 3152 0 R 3153 0 R 3154 0 R 3155 0 R 3156  [...]
->> endobj
-3087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 695.067 191.718 705.971]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-3088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 695.067 303.079 705.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a25c5ef784f17646705c76a5be6c724a3) >>
->> endobj
-3107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.635 667.667 188.679 678.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae0a1b4b4a344cad01c58e8e006a7ff16) >>
->> endobj
-3108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 603.393 170.255 614.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aab3964a5c29992e6476852c9d246fe6f) >>
->> endobj
-3109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.071 603.393 239.714 614.297]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.878 603.393 409.266 614.297]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-3111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.097 603.393 484.344 614.297]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-3112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 579.604 170.255 590.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a3825b4905d72422089bf28d3c95c2964) >>
->> endobj
-3113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.592 579.604 242.753 590.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.317 579.604 335.783 590.508]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.582 579.604 479.333 590.508]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 543.861 170.255 554.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a26a38ad6506b5c3154e90e696ea6dc88) >>
->> endobj
-3117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.428 543.861 241.589 554.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.612 543.861 360.078 554.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.295 543.861 503.047 554.765]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 520.072 170.255 530.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a128b2fafec11e096e41f78710ba2ff0a) >>
->> endobj
-3121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.592 520.072 275.419 530.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 496.284 170.255 507.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a15b3e8152862a6b98ecf1c4f4a142634) >>
->> endobj
-3123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.592 496.284 282.045 507.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-3124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 472.496 170.255 483.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_adbf2609849c95cfb7277df1edc69534f) >>
->> endobj
-3125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.592 472.496 273.736 483.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-3126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 448.707 170.255 459.611]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_afaa5d6b3c1b3b83161b619c28c5f9936) >>
->> endobj
-3127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.592 448.707 245.522 459.611]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-3128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.715 448.707 344.181 459.611]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.98 448.707 487.732 459.611]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 412.964 170.255 423.867]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a587ebb6173af401b6fc9d274bb839608) >>
->> endobj
-3131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.496 412.964 217.096 423.867]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-3132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.795 412.964 258.521 423.867]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.403 412.964 373.869 423.867]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 412.964 513.996 423.867]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 401.382 134.28 411.912]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 377.22 170.255 388.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a25a2d683973c6c6901e47c4fe90cf2b1) >>
->> endobj
-3136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.592 377.22 217.846 388.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-3137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.126 377.22 322.592 388.124]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.391 377.22 466.143 388.124]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 341.476 170.255 352.38]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a96f9f41695040221ad560cb4ec452ef9) >>
->> endobj
-3140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.122 341.476 270.391 352.38]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-3141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.275 341.476 396.741 352.38]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.805 341.476 513.996 352.38]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 329.895 156.965 340.425]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 305.733 170.255 316.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.995 305.733 221.801 316.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_abee6d42dd6f94979bcc7fb3d51102864) >>
->> endobj
-3145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.138 305.733 294.299 316.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 280.074 180.198 290.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a867bed09df5c122833745b9a4cbfa3ea) >>
->> endobj
-3147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 280.074 229.174 290.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 254.415 178.004 265.319]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aa78a6abbbb3c425992ca644f732e69e8) >>
->> endobj
-3149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 192.629 190.738 203.533]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 192.629 261.85 203.533]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8101d965bc32e4ab1df6aa445730769b) >>
->> endobj
-3151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 166.97 190.738 177.874]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 166.97 262.159 177.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ad09a9ccc89ace499a888b6b1a1f4ce44) >>
->> endobj
-3153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.225 153.467 390.082 163.372]
-/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
->> endobj
-3154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 141.311 202.922 152.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 141.311 248.58 152.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1e645f35cbeedf3341428988157f71ab) >>
->> endobj
-3156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 115.652 202.922 126.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 115.652 296.181 126.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a24fbe68af11e373092f23f59b6cfd3e1) >>
->> endobj
-3158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 89.993 209.547 100.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-3159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 89.993 261.831 100.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac7f89b09f6755cdcd97daa3a92522b00) >>
->> endobj
-3166 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3170 0 obj <<
-/D [3168 0 R /XYZ 89 770.89 null]
->> endobj
-3171 0 obj <<
-/D [3168 0 R /XYZ 90 712.265 null]
->> endobj
-3174 0 obj <<
-/D [3168 0 R /XYZ 90 320.939 null]
->> endobj
-3175 0 obj <<
-/D [3168 0 R /XYZ 90 295.28 null]
->> endobj
-3176 0 obj <<
-/D [3168 0 R /XYZ 90 269.621 null]
->> endobj
-3177 0 obj <<
-/D [3168 0 R /XYZ 90 207.646 null]
->> endobj
-3178 0 obj <<
-/D [3168 0 R /XYZ 90 182.176 null]
->> endobj
-3180 0 obj <<
-/D [3168 0 R /XYZ 90 156.517 null]
->> endobj
-3181 0 obj <<
-/D [3168 0 R /XYZ 90 130.858 null]
->> endobj
-3182 0 obj <<
-/D [3168 0 R /XYZ 90 105.199 null]
->> endobj
-3167 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F24 529 0 R /F66 3179 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3247 0 obj <<
-/Length 2058      
-/Filter /FlateDecode
->>
-stream
-x��[[��:~���)
U�Fh������\���}IN�[�ٵ�x&�_�-$l��ab�ɦ�0���j}���l�,l��p7���g�@£�u7��|W ������&;��l1/@Dx�Tq���߽���V���<
���
-8�k�
|�[������T--�28.���?�؂�6y�b!>��	�D�6���h|��j=�3>�X�
c�M�ҵ��rt��r�l�rl/�8ZF����x� �=j?a��8�/�����'�� :幪S�"�%֐0�yLw���i��&�ۡ:�ڎp��e�ōd������:\D���W�F�Y�G�'���h���2\
T�b.+�䙖"W�\����Q���
dH�z��n7��Ң�4]�:$P���\�DK	� v�����#�e
���Bk
��>� %�t� ND)�jú��!�������I�0׏��>YǓl4M��(�O
��G�O
`vGt��2LGo?�R�eƯ��^I�
���h�uD7
 È�-�� �f��D�T��}�ċ�>�[M�죀nېЯ�62g7Ҵ3M
����4�Fۏ�4
7�PP$�@�� A�
����:B�+��"q(������F�{"�4*�Q��L��s1��?͈�8��pJh
8����
-�����(P�8�qި0[�F�IM��&�5M^;���`p\l5�ε�_�Z/� f���ψFY{�7�ŌOL����8+c�^7@��}% ;2�h���D.W�fg[C#
E����mhe���������`��
7���U��j�0�i
���:�ḃ�
�)�8��<�78\����k�H��b]ΆY	��j��I
i���Hû��Hë���ӳ�;�4̓�q��])�J9/N9�t,ԇUŹ>}�K�\Sg�R��Jϴ�P�A��Lk�i�9�9� ]���Z
P�`�T�3 ue@�
x
�{�ӓ
�Q՚�'N�M�Y�J�HЅ�X���!���
���8���7p>�a�cщ�Z9�a�E�	�X|%��'��m��(V��9]�dqy��H��Ts��^�$�p���I_+K"�Gn����){�;��<���
��;�j���"�m���X2b��\��)����y�&����ȱ�
�}�J$\��X	�[\�6���J
-����n�QaY�#N
��Yy+�F\�S:۟�L�����8zX	
�M��"�:�5�G��6���!cJ�7�
7��=g�0j��Bp�j>�
f��0n0u̦�| 
?`!�E�'jVP[b��3�0>�
�@t��V�p��ՙ�h
FqvF�G��p�X|�9�jB^�hRO/j5�3Ӌ�
U�t
�@��6
�8bA7����Ϟf���8_lF�:x^��v���
�n.����`	x
����n��&Q�o��e�+�^IG�2�#O�S�Q/A�T��rT[���v�*�Gߣz� 	�I�����4�(RR#=*� �rĽQ"i
I�=c������
1���bų�"�?IٴV$, at L��`TEQ�Ƣ�:�2N:X-����a��ɣ��A�,�
�ɼ
�
��M5
��H�K$͚V
���K>C�����|),����}!i�J��Gz͗����!�͙fg2A��=&Mz�2��~_�NY�c},wt�
�%]�����F-
�:�Ԯ�~�6��uD�Q} �>�Ȇu���q%�,jƩ̯z΀N,���ت�pp��*Y$�h
.�^�"���:�����
-P�[�8�`�n�}&Mm&���ޏr��l-�
-���F^��x8���/<��f#X�8��t���ב=cC[[c"x!ì
�x[�e*�Vʿ��q��st�����
B�
�Qx�h��uE��n�1L�Kz,8��.P�o1�2)�ſ����ku��/_B
��z sʺ~�ZyƉ��KׇF��>-nVϋ��3���ߗ��1e;uC�7�),?��8A.�����+�����'��d��s� �0^������OR\�ղ�r�
��V�ѥ�����_ԧ¼�c�"��8m�竿��ܯg��gh�W_���[`M�c��[΂��bg��� ���R
-endstream
-endobj
-3246 0 obj <<
-/Type /Page
-/Contents 3247 0 R
-/Resources 3245 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2999 0 R
-/Annots [ 3160 0 R 3161 0 R 3162 0 R 3163 0 R 3164 0 R 3165 0 R 3194 0 R 3195 0 R 3196 0 R 3197 0 R 3198 0 R 3199 0 R 3200 0 R 3201 0 R 3202 0 R 3203 0 R 3204 0 R 3205 0 R 3206 0 R 3207 0 R 3208 0 R 3209 0 R 3210 0 R 3211 0 R 3212 0 R 3213 0 R 3214 0 R 3215 0 R 3216 0 R 3250 0 R 3217 0 R 3218 0 R 3219 0 R 3220 0 R 3221 0 R 3222 0 R 3223 0 R 3224 0 R 3225 0 R 3226 0 R 3227 0 R 3228 0 R 3229 0 R 3230 0 R 3231 0 R 3232 0 R 3233 0 R 3234 0 R 3235 0 R 3236 0 R 3237 0 R 3238 0 R 3239 0 R 3240  [...]
->> endobj
-3160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 707.957 209.547 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-3161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 707.957 309.432 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8f0bdfca2a6993bfa08358319d589ab6) >>
->> endobj
-3162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 671.665 228.895 682.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a79a586ca093d218e5603380ac0475717) >>
->> endobj
-3163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 671.665 333.482 682.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 648.039 229.503 658.943]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a641b55dd6c26bce06bd8041b38aec873) >>
->> endobj
-3165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 648.039 334.089 658.943]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 624.413 187.264 635.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aa7b3a5c12ea008b78eed88a621c1fab1) >>
->> endobj
-3195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 624.413 293.213 635.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 624.413 371.148 635.317]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 624.413 455.727 635.317]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 577.873 187.264 588.777]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae61fdcc22d1e0fe43b94194f2eadaa1a) >>
->> endobj
-3199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 577.873 293.213 588.777]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 577.873 371.148 588.777]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 577.873 455.727 588.777]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 565.918 220.058 576.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-3203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 531.334 186.348 542.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a33daeddebffc6eb847edd92c3ba045dc) >>
->> endobj
-3204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 531.334 293.772 542.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 531.334 373.367 542.238]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 531.334 456.837 542.238]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 484.794 186.348 495.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1d00782cbab77286295552af7dba7ed8) >>
->> endobj
-3208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 484.794 293.772 495.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 484.794 373.367 495.698]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 484.794 456.837 495.698]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 472.839 218.404 483.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-3212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.772 438.254 187.446 449.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aca71bae643870b4a7aaaabbab838c330) >>
->> endobj
-3213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.73 438.254 292.979 449.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.431 438.254 370.447 449.158]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.745 438.254 456.762 449.158]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 438.254 513.996 449.158]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 426.673 159.485 437.203]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.603 426.673 240.62 437.203]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-3218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 391.714 180.496 402.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a6a3dd351c33d66250d2b4ac639768f07) >>
->> endobj
-3219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 391.714 252.994 402.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 368.089 213.153 378.993]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8a87935278cb7b1290301e96cb82fcb1) >>
->> endobj
-3221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 368.089 285.651 378.993]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 344.463 213.163 355.367]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a5e972fbb672e9b2faec34b949c9a2918) >>
->> endobj
-3223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 344.463 285.661 355.367]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 320.837 205.692 331.741]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-3225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 320.837 261.312 331.741]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a75188bcee0bfc88a4c8571acc04a1826) >>
->> endobj
-3226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 320.837 332.156 331.741]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-3227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 297.212 205.692 308.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-3228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 297.212 261.312 308.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4aef1a4f6e9bed5d473e98320401e0e5) >>
->> endobj
-3229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 297.212 338.781 308.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-3230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 273.586 205.682 284.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-3231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 273.586 261.302 284.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a16f61fdba7e14a67990a84e93be00efb) >>
->> endobj
-3232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 273.586 330.462 284.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-3233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 249.96 183.824 260.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acaa538c9c00b2f69301365d916bb49e8) >>
->> endobj
-3234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 225 192.272 235.531]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a620d5cdb01b8b20848ca01f4e4c05b4f) >>
->> endobj
-3235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 199.667 189.901 210.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a242d9bf0b5b215d4aa771e9f8595baea) >>
->> endobj
-3236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 173.96 241.935 184.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a54f33edf5fdf4c6f606136b882be9f1d) >>
->> endobj
-3237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 149 193.229 159.53]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8c73e2c464d5e93dc55862d00d5478f8) >>
->> endobj
-3238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 123.292 238.459 134.196]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a396bd79b5d57d54685d9c1b9d970c00e) >>
->> endobj
-3239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 98.332 187.689 108.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ad369744c43a49ebac904bc3e17de0478) >>
->> endobj
-3240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 98.332 226.693 108.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 74.707 161.677 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a29212d49685544d8a3c71993bd30f467) >>
->> endobj
-3244 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3248 0 obj <<
-/D [3246 0 R /XYZ 89 770.89 null]
->> endobj
-3249 0 obj <<
-/D [3246 0 R /XYZ 90 721.073 null]
->> endobj
-3251 0 obj <<
-/D [3246 0 R /XYZ 90 265.085 null]
->> endobj
-3252 0 obj <<
-/D [3246 0 R /XYZ 90 239.752 null]
->> endobj
-3253 0 obj <<
-/D [3246 0 R /XYZ 90 214.418 null]
->> endobj
-3254 0 obj <<
-/D [3246 0 R /XYZ 90 189.084 null]
->> endobj
-3255 0 obj <<
-/D [3246 0 R /XYZ 90 163.751 null]
->> endobj
-3256 0 obj <<
-/D [3246 0 R /XYZ 90 138.417 null]
->> endobj
-3257 0 obj <<
-/D [3246 0 R /XYZ 90 89.458 null]
->> endobj
-3245 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3326 0 obj <<
-/Length 2651      
-/Filter /FlateDecode
->>
-stream
-x��[[o�8~ϯ�S��w���3�v���m�}i�b3����Jr;�_����e�Q�3�CT�><���H
-�#<����Wg�i�%������#�5�7}
���`���&��dN�M(
���[3O����:	�݋?��^ކ3��ꗋׄ��͑�,���Oi�
+Q^L�ꠡa����C^.�4��S����c��,�������$�M<�!ř I��y�����g����H�����ox4��_F1櫛�q���rty��3�k���iZ�Q �J���.<*B��~o�m���6�a_�e�6Ws�&eHIRL�n��a<��x��O���Z�_s�Z.�	c��G���n�tŜ4̢�Q��#\.s.�|$�'
���I�Y��
�l��H�H at G@ )܄3s�*Z�8�ֱ'��[:��E�x��5�ksϯ��,�_��d�a�O
-s����G7��u��:�k�J\G%C\ �qMs�R*?}<�a_�_E���`�ȑ���r�ϧ3`5K�(��t�OX`7����^"�f@��1E��IN�"9���
c�?��&W�����O�
���h�u�L!I�	ٺe�t�ff�\�z���&������L�X�3=7����]7!�!R�{�	A��b��9 Q :cP�I
&6�
I=D���%�O�Rm�;8҈�2
�
� �b|��5��EXGB��
UI�ZÃ%�� qgz��	�t��Sڰo���a��ڌ��I��
z�F�&�aє��5�n�4GAk/�?*�:�C�E��aH�Y��rV:H���"
&y�E�څBj����cJ�X�B������Kg%Gw �Li�`&C�
T	��P���a�
���/�0�_
*�O�|O�$>���(�}�Շ�
�XQ�On�|���H�N l�<�!k�#�
&���'�r
����+@����r=ƺK"����^KS��(J��!#�S��N@ٷ�ڄhD��O9�
�A)
�cD�'[��o��QEx��@�8
�Q��ے����BZ���
qY1Q��8F�|��Q�8׭��%�DP
��6&W���ęI �g��7�ͺc%Q at Y�$�) ��	[C軅�yؓ�Z���b&ӛu�����m���]��P�8�%��|mC)m)�q�F9ۘ74�A�}�A#�v���[�A���]��{5Q|�|�D�c�}i�����;M�`j�U�tϖ�&{^KE���%l�Q�*#Z�L*�y�u��M
��	��a��)F\��?K��mvl
?�^%iF����؈'E
4���&
�"p���}�Y�{'��'d�,@`�?�j@,g�����6�g�uI[M�{il��}��A��D�׻�E ����k���'Ly-�!���-�y����%
�S}d�W��i�_��xab�@r���_��K��>)�h(����MC�&�n
�Ep�rח8�?s{�B���� "�jw�>�
|Aʤ����"�Ӓ
-E��NO*�� '�]
H*5�eV���YE��Zl��(t��@(��1t��uSH�3P3{�����,����\E��Wl�"E�&�LEd*ғ�HG�
���Pi��Y.�TM̻i�v�)ғ�dU��Ҕ���E�{3�;�3U^}��;�.>�˫�&|4�+��猞��j�
:��獙E�zU��S
C���㸃F݁�q��#SO0
� �!NQ՛~4�}݁����u�A��Ŵ#6�>x���M��;MƩ1��f��aR�6! �:�K<(*��
�=s�fݼܙ(�I�a�A�ŏ~��bV�A���qi��O�3!������e�N�GRr�}֗��f�Y at 0Ɯ
�����*�y�b����v���S�,,�
Ĩ
�
-
�����i�^�˳�S{��>�� �1"U��&{�$y-�3��a�F�8�>Ц�B�u��ˊ���q�nwE�|
�3���#�J�N/M��i����܀r��v�a7�L���Cu�U
��2��'��A~|�����o�f�
��aK��iNTO��
�0�l-�i�"��tl�luNZUV�i�^{`�~q걜%���!}���Ը;�S��{����z��>wP
g}�P�p��D�Y[�k���z�o�D��/�د%:���rҮ��m�,B�D�
z�r�٘d���"���p�`�*\.m��
zYV���ېr�6�G!�B=�1a@3����y�.wH���4����(�eO1޽��Q��ܚy��ďvZ^iȒ��h�8=dx���}�T*�M]l���m��8ʼH�{o(�
�鑚"B�wt߇n�i
�+
-�	��;y�xmMK���(�d�F��t.��e��e���l��	�T@�r8�,�w-��~P�c\�]<8y�l\����
�=�qUx�
�Sv۲�
�TY���G��.�u�$��-\,�
�Tع�?�bV.����j���
v��Bغo�5o짬��[?��
�)R�����a�ِE���m�I�%�Ǯ��_2K�X��/��˲q��O���/-^5һwo�m��$�1N��g�m�OhE�b��AeIE�\#�
-���)$�L�wT<��~�+ePペ�,ۼ����.R/�l��k����X��q�ο^���
�����G�7�
&HJZh���
#L��Y���^?�.ެ���\},�ٯq�
-endstream
-endobj
-3325 0 obj <<
-/Type /Page
-/Contents 3326 0 R
-/Resources 3324 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3328 0 R
-/Annots [ 3242 0 R 3243 0 R 3272 0 R 3273 0 R 3274 0 R 3275 0 R 3276 0 R 3277 0 R 3278 0 R 3279 0 R 3280 0 R 3281 0 R 3282 0 R 3283 0 R 3284 0 R 3285 0 R 3286 0 R 3287 0 R 3288 0 R 3289 0 R 3290 0 R 3291 0 R 3292 0 R 3293 0 R 3294 0 R 3295 0 R 3296 0 R 3297 0 R 3298 0 R 3299 0 R 3300 0 R 3301 0 R 3302 0 R 3303 0 R 3304 0 R 3305 0 R 3306 0 R 3307 0 R 3308 0 R 3309 0 R 3310 0 R 3311 0 R 3312 0 R 3313 0 R 3314 0 R 3315 0 R 3316 0 R 3317 0 R 3318 0 R 3319 0 R 3323 0 R ]
->> endobj
-3242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 661.099 205.752 671.629]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a20814dec69b3a6602b70a9ad50db9b2a) >>
->> endobj
-3243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 661.099 276.595 671.629]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-3272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 637.098 212.377 648.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acf4dc2de16f4a54ca03daa6ac1d31ce2) >>
->> endobj
-3273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 637.098 289.846 648.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-3274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 613.472 209.627 624.375]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a28b268e37d25a0cfa2b5bf39e85c758d) >>
->> endobj
-3275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 613.472 314.791 624.375]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 589.845 248.202 600.749]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a535090b407c713681228d6ab2b835e36) >>
->> endobj
-3277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.018 589.845 329.845 600.749]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 566.218 216.252 577.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0cc08ca5d72d5cf465eb7812ffbb156a) >>
->> endobj
-3279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 566.218 328.042 577.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-3280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 542.591 254.827 553.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aa85819690f928a46e3f437bfe629e976) >>
->> endobj
-3281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.643 542.591 343.096 553.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-3282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 519.338 236.745 529.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8ede75fbd470fa30f11d4c02672883f5) >>
->> endobj
-3283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 519.338 307.588 529.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-3284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 495.338 243.37 506.242]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ace010a880cb8574335f1be294907de89) >>
->> endobj
-3285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 495.338 320.839 506.242]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-3286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 471.711 240.62 482.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8e13e7d3536de2745bc9e58a25b75b77) >>
->> endobj
-3287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 471.711 345.785 482.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 448.085 247.246 458.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a35f19d0e7190c5a18aebc9ced95d554e) >>
->> endobj
-3289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 448.085 359.035 458.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-3290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.173 412.503 290.391 423.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac68574b9eea6918a73dca2ce92a82fd7) >>
->> endobj
-3291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.876 412.503 374.291 423.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-3292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.612 412.503 416.339 423.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.628 400.548 229.044 411.452]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-3294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.291 400.548 270.018 411.452]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.515 388.061 256.856 397.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.505 354.007 339.621 364.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a5851243f84aa67103a7f805232daecad) >>
->> endobj
-3297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.769 354.007 420.184 364.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-3298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.836 354.007 460.563 364.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.133 342.052 274.549 352.956]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-3300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.978 342.052 315.705 352.956]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.256 342.052 513.996 352.956]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-3302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.369 317.61 256.71 327.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 283.556 255.714 294.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9f427e126a129393342ba033e08c5d39) >>
->> endobj
-3304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 260.303 193.577 270.833]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a668cbd7cea86f47c4e2b303468083712) >>
->> endobj
-3305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 260.303 232.581 270.833]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 247.443 248.845 257.348]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-3307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 225.717 193.577 236.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ad2e535d5b20d25d36b4744da392edf02) >>
->> endobj
-3308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 225.717 277.691 236.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-3309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 212.857 247.177 222.762]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-3310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 190.758 223.465 201.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a86dd59c40a3c9867c2979ff24ba342c2) >>
->> endobj
-3311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 190.758 295.962 201.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 167.131 229.552 178.035]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0442c5079b3de8dcac61c224ee7a2e6f) >>
->> endobj
-3313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 167.131 302.05 178.035]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 143.504 266.673 154.408]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4b7615a8ec5120dc083f368ecfe2d1da) >>
->> endobj
-3315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.01 143.504 339.17 154.408]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 108.919 299.171 119.823]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a6ef0e7043830c5e6b9ffd67697d22c04) >>
->> endobj
-3317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.508 108.919 371.668 119.823]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 217.109 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a894e92407922be006a76577cf47b8589) >>
->> endobj
-3319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 74.333 289.606 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3323 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3327 0 obj <<
-/D [3325 0 R /XYZ 89 770.89 null]
->> endobj
-3324 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F39 2320 0 R /F67 3037 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3424 0 obj <<
-/Length 3404      
-/Filter /FlateDecode
->>
-stream
-x��\m�����Ÿ�6���]b�+��\�K�r�n�I`x��PYrd�n���C�z�LYr�&� 8�V�)rșy晡h<�����.^__��4`3���rv��)<
�BB§��9�t���g3&CD�����7_}y����+�����/|�g��@� ��n/����p��FL��'�h;���dvu�
le��5�)6
A6ɵl�cD�2 R
-��~ߥ��%x^dZ���ʰ�
QX��=ƬlCn5�H�jT�����3<e(��i��$��E���'���jg�fi���8��R�OF��u�Y�p���
�Qzkd�|��`��ҵ�#"�Tu�gO7�z$d,��!��[�u�G��K�QH����yj�ݥ�x~�e���
+����ia0��x�|���.�BG
"�?˕��n������v��ן,��=]�x�N��M3cw�)���|)
-�ꚬ�=&��
�
C����)�,�(*.w�
����X%�:�
�vU�����~[�����3y���r����(��V�
B�8oŗ��w�C�
��$�U��|���Z��-m����X�'�7>�DX�K�A��;_
�F	�]
}�vW</�p��
�������� A��h����fA��,M�e�]�
x�n����������*�W7���G=�*_p<�3�����>��h�/����#p�C�Ս^���k��&��I��QZ,�|��>2�.��ڠ�V`�8��%�$%,���4�����W��>
&K��7
��f,��&�N�
���@�ܔҰ
${u��Y��WZO)��6�;�߁-�^�	43���D=�z����\�{+��!��?mW��J��e���$�z����	�%�E��:�;
V��ie��ƘH��O��k��8i�<Z�7n�}��
���n&�-����
�#(���!
3OH��IG�����
-�)�Z�h�8�c�_���{�H4��x�E�jkQ��F����t�y$]��_�Z$zbB��2�C�7Y��C��<TPY
�rX��vA��€�7� @���&<
w���ց���cC1��u����"�z�zB=w���ʘ47�O�^�/��Xܿd< �(���� ?�T�!?�b
���d�m���x
�=1@��D!�c�
�Ba-jh;���)���n��� ;x	��.� ����
� ��{cP�� 
���OfXz��a7�
-b5���2�\���<��
�cA��25xz�A�ui��{��^��φ��Յ��Rp���
�d���d&ii:Nw��
$��OJ�2���E$�~�V������D!��ARJ(u��GJuģ�ҟl4��(��U�7Z/�m�sN� ܑb�
%���z��d�O�<J��[M
��P�
@J�
d�`<��
֛�ӀN��\nAFu�����N�����

����)�
Erh�A��~	��Nɒ .D\�`^�"�3�!���	x��[|�v���(�<lZ�	����
�V���
-0������™0�#0C
Lw�Xp�����*˽���Y�ŕ�ߡc0�"11�P�^{^��O�vó����[k��c�@XH7rTUκ�h�
"%
��7�����R�o�jK����c�m B�c� <�<��
�\_�l�F�c����H��G�tx  �^ꀠ�̓��r����~?M�����y��D�3M�gsKޅ_}����C2� %��a
��
R�=���䞟 ��U;
��z�
�����@�;,��uP��}�vš$W[1��1OW�G`
��y{����0����� ����� ��Ԛ���
���ˀ����w��i�C��;kH�$�Vm`��,y/	&x��:��Ea=�7�oz��
��I�X.,;`��0\X��n��²��)�;%˳�0�8�\���\�z-�a���E��� ��@������a��a


; <�7ajP� ��}���g�!䇌�`������C�/N�^Q��o
�Mx
� L �����F P �! >(F�}�a��;a8\��0���D6L�
� �bØ1�d{�K0Ĺt_��
������M�k�c
- ��4X?��v��W�� <�F/��e����}��� ,>
��{"ˬ?M���Z����0j�Yϫ�@�€L/�i��i�K�fd ��\�l�A�c/b;�H�BF
k���'7��v�f�m�c�H5�s �3FD�(�W�]�/I�C{]]�
YЮ�)���LpN��y�)w�X3�3!��(�R׵�O!jA�
�q=H "1�3 ':G�+����i��$,!�SnRz�R#���Gɺ����[d#hs�KT��.��K�R:��t!�*�;��rT�xOE]N+��T�y��^�K��hE��&<�֝�:�'�'2t�{�;9�'
ɌJ�xxf|��∎
-O�
�Of�Q��H�
�)�������ȹaJ�^�b��8U�E![S'n�1�JQ���G�\o�%��n�6���Z'-J=$E}
�
d��

-�
��_�
�[���x���wl,`�?�Mq�
at�l�ج�i�bʲ�S���X�	N�W�WQ�pZv5T�|mI�;{��.ʗ�
H�w��Mb�5D=�O
)���K��a��4�J�?�(�|pOO��3��Qߊrm��^���a$hԔ�� q�%_h�x��󾈺"(o�R�P�_8&�!�N}�_�^�ꨡ��l>�ڰ�����q�,�aE�d��H�Jͱ\se�2Nױ^��x��J��WE������ ��&�� ��P�9M�}�t
�jʽwa�~�hX�WO�nʹO8?9ITZ��n�� 4�Y��[F���Ӿ/F
c��
-�$ 
�^\UI>���囯�x������֓+��X�^�U�v�<[��w���G�X��<(�ؑ� b�U/Nk�ȪS]V�՗�&��]��*��+'�L
]k2��Ą�S�S�g�Ц��1^��~��в�#b�n����Nt�1ᄇr��r�m�7 ��샩�1ü��d'
X��2
ܱe�cm�j[�ѫ�e���2|ѱ���&���# ��g9x��&�(lʓ�N�m�W�p���޳��!Nۧ��
A� cwfp`��S���,����U��M��C>�d�����(į�#�E=���)��9[�3/7 Ci�PXR�)T��M m
�W����S��͚5�2��07]i���V o;���O� ��T��vZr� e~���
�0)7?�_��|Y=co�|�e�O2��<|v�th��I�B
,�A�#�
{������(���	
kb_�҇ʲ��,�n�
d- ����P)�j����H8	��[g|�E����˛�;H
�ĘC�m�g(��#A��@n����}���*�� �,
-endstream
-endobj
-3423 0 obj <<
-/Type /Page
-/Contents 3424 0 R
-/Resources 3422 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3328 0 R
-/Annots [ 3320 0 R 3321 0 R 3322 0 R 3349 0 R 3350 0 R 3351 0 R 3352 0 R 3353 0 R 3354 0 R 3355 0 R 3356 0 R 3357 0 R 3358 0 R 3359 0 R 3360 0 R 3361 0 R 3362 0 R 3363 0 R 3364 0 R 3365 0 R 3366 0 R 3367 0 R 3368 0 R 3369 0 R 3370 0 R 3371 0 R 3372 0 R 3373 0 R 3374 0 R 3375 0 R 3376 0 R 3377 0 R 3378 0 R 3379 0 R 3380 0 R 3381 0 R 3382 0 R 3383 0 R 3384 0 R 3385 0 R 3386 0 R 3387 0 R 3388 0 R 3389 0 R 3427 0 R 3390 0 R 3391 0 R 3392 0 R 3393 0 R 3394 0 R 3395 0 R 3428 0 R 3396 0 R 3397  [...]
->> endobj
-3320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 697.131 271.126 708.035]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a84a9c57aa31433a277d9be6b0077065a) >>
->> endobj
-3321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.463 697.131 343.623 708.035]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.863 684.637 326.259 694.542]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-3349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 662.529 198.26 673.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4e04c3a6c835332c31dfbb928b31144e) >>
->> endobj
-3350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 662.529 236.665 673.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 662.529 353.317 673.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 650.947 246.458 661.478]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-3353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.562 638.079 267.759 647.984]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-3354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.583 604.016 222.689 614.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9743d54c550c39688a16670c49d7272e) >>
->> endobj
-3355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.988 604.016 261.176 614.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.804 604.016 355.22 614.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-3357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.95 604.016 395.676 614.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.268 591.521 288.464 601.426]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-3359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 569.413 212.768 580.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a07cc48290e435dfb739fb565ff1aa3fa) >>
->> endobj
-3360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 569.413 252.959 580.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 569.413 375.145 580.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 557.832 286 568.362]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-3363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.657 544.963 275.748 554.868]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-3364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 522.855 250.099 533.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae0ba85e8cab7e4e95ec001bde5bdd99d) >>
->> endobj
-3365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 522.855 289.446 533.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 522.855 379.512 533.759]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-3367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 522.855 513.996 533.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 510.9 416.369 521.804]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-3369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.43 497.196 403.696 509.361]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 476.297 250.748 487.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0acf1147e3f81830606dec4cc8faddd4) >>
->> endobj
-3371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 476.297 357.317 487.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 476.297 456.145 487.201]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-3373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 464.342 202.344 475.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [356.462 451.847 409.185 462.803]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 429.74 261.881 440.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a988ff507806fa8126649f463ef6a1f31) >>
->> endobj
-3376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 429.74 300.286 440.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 429.74 388.504 440.643]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-3378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 429.74 520.199 440.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 417.784 416.369 428.688]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-3380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.141 404.08 414.324 416.245]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 383.182 261.881 394.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a79acafbe4f67eb7e2710287bcd60db96) >>
->> endobj
-3382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 383.182 365.272 394.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 383.182 460.793 394.086]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-3384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 371.227 202.344 382.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.012 358.732 414.183 369.688]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 336.624 239.984 347.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acda762f8c081fed2862260211618fce0) >>
->> endobj
-3387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 336.624 280.82 347.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 336.624 405.104 347.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 336.624 513.996 347.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 324.669 171.361 335.573]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 324.669 478.077 335.573]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-3391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 310.965 432.092 324.123]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-3392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 288.863 251.209 299.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a178a6a88143f44b43939d36024af6162) >>
->> endobj
-3393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 288.863 290.549 299.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 288.863 409.969 299.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 288.863 513.996 299.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 276.908 171.361 287.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-3396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 276.908 478.077 287.812]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-3397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 263.204 456.992 276.362]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-3398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 241.102 224.57 252.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a5a66e6f883c7310ddbc312f78bb0970f) >>
->> endobj
-3399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 241.102 297.068 252.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 228.608 347.869 238.513]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-3401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 217.459 196.297 228.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ab109e8a2fca1324773e2a5777f75c852) >>
->> endobj
-3402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.439 217.459 279.215 228.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-3403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.718 217.459 432.878 228.363]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-3404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.827 217.459 513.996 228.363]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-3429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 205.504 216.491 216.407]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-3405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.094 205.504 362.977 216.407]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-3406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.254 205.504 475.081 216.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 181.053 164.537 190.959]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-3408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 169.905 273.129 180.808]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a3e0339ccaf8da39b9fd21ff8777e99e4) >>
->> endobj
-3409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 169.905 352.41 180.808]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 169.905 495.961 180.808]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 146.261 275.007 157.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a2204d6d24f9c68fdb6a72062afe9a209) >>
->> endobj
-3412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 146.261 362.877 157.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-3413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 146.261 472.148 157.165]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-3414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 134.306 233.986 145.21]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-3415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 99.703 255.564 110.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ad80989353ea3738abdb6b605d27cc8fa) >>
->> endobj
-3416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 257.637 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9507085c5b0efd13c80f08a22b0f5529) >>
->> endobj
-3417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.974 74.333 330.134 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3421 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3425 0 obj <<
-/D [3423 0 R /XYZ 89 770.89 null]
->> endobj
-3430 0 obj <<
-/D [3423 0 R /XYZ 90 114.837 null]
->> endobj
-3422 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F66 3179 0 R /F42 531 0 R /F67 3037 0 R /F38 3426 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3499 0 obj <<
-/Length 2568      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�KΘ�`wOڙڮ'�j�y���@�RBC I���
�!Ȣl5�D88���@<�����'��O^��l�@P19_O<�^���o���)�ț�	�xz:#xf�pq:�x�lvWj������,�v/_�z�8�
-S5����o	i�%��d�â��w���2�D��༇G��%�����z��lN9f��m�	
e�|Pk�͈?U�NI�q��i�'�8?��� <!V

I�ܞ|�OVp��	F
��5DۉG|n&g'�<�N��O��M|ح��n=�.
JB�i6��<�.c��"�2
-�q�/J?a�g�(� ������(�D��)CR���i&�19U����ߓ��\&���K��+c����ҩ���'�����k)�J���4ͧa����$v�Y�8�
U�*��K1C>;��a��cD8AE��a��VB-Y`��s�1D��
�=�O����$
-$&�&y���Y�
4�D�t���$�
�إ*����
-��E�����w@�+��Gf�
-8��7& D�� �'J;�D���8��[�
�0��$΋a�͸�e�l7|�
'A-��i��߹���p
��)�.`j]0���w�4����%ҿb���Z;C��挃�?�)���Lj?g� pȿ#@jz���c���V*S
B�.>�.�D| 
-�
�E@��"L%�!
�k�yi�>K �}����6c$�O�G��cA�ԣmT���Adl&ҷ���&;�}��
-���^k�,��bq�ˡ�e�̟��p�I�)k(qir�xp
��C�o�ۦ����Dw7JÒFK���ԢN�8��� ���$q6��;�<��=R�:1�XZ`�������&)���}���A��Js�>8
-˫1g��sP

.��V96X� D�K0�͋;�n6u81i�z0>y5`�t
��`�j�Ȗ�Hz����,Kf�Oo�B��J��H
-Ub��OL��;Rf���2�^����w���y��
�~'�T�r(�K�����p�V�ׁ��q
E��V��2�!�����
�yd�
-e{���9M7��P��8�\�(0a�_%�{5b����d� Â�Nz�2�ם�O��?���_p(�1OXX@�h�Q_�x,	�	��Pz�VԷ��?m�G�4��riP_݃�>y 
-0��ip^Y��M����h��ahH����d����=J��AO���p�G��G��c����6z�� ć<G��f�ɎSq�A�C��@��C�úZ� .�U#��A�'\h%�f��H��#K
-֢���Ui�78zD
��1!�
4�`�g�t�=� qgq���Y�h"S�����P�~�a|�1{4!P�rg��ZN���
h�
�4��n΅k��k��ۜ�ems.��s�~�*a�
n�"D���
W��N���vq�C�B�G.Qj�h=J�&�"J�9����{��*�{~{
/MS�U�l�C'��d�w
��D[Q�X��%�뿀��Z�'1p�,
�j(��<nB+K��%�p�Z�z�Ū�l��
��ү呃<���~
�w����	e�Z�}�A1"�z^������Gl��Uz-�s����QAޱY�qW_�9���I���ߨWN3\Wz�E�AۦY��?�u�lUٱ��*Q�8N��+8s�ه�~�@�7s H˰P1�=��S�gF*��s��d&9�>O�	mY����G�]_��,m��J�8D�
�K�
�Gu�Lm
��O��x�/F�0�‹��g�7
->�ѣ�0����eq�[�ZF����
���P�Uty��њHʀ���cԫ
U镮�D�I!O��]Ϩ�k�x���ҦW��0�Me>���X5� �39r� }���`��n%+�p�(K�5|8������>x�~!KW&az�@rx�6H�k�>�Y!F���5L�~��ͽ�a����e�tA���9��5�Z�,�a��j�_;
ٹH��Վ���ZA��v�g
�>��#W��m�
�����]�p��'i��Q�uV�>��E�4�[��W~H�$�f77a�7d��`\�#��zb~_ZC��
�������h���!N�"׍k>��"�36��
ƾ�l5�q/��-�a�8��L�8}�w��Be�6�w�:�Y@
-��/��'?���q��)]e�j�NQs7ᅞ�.��~
B�?��J>w���)�dй���zu�\��64�7��H�o}ף@Ͷ�B�3�����
1L�27�ىB/�e����-e^�|�.E��[k������j��hS�~
��F�U'*��M
2뺡���5_�~P��xD�֑�0jj�
9��j @��3=`_�Ω?=������Z�u�
��ۣ�=y`]�$NK�]�K+�����jh/at�_9�l�O}�OzDӚ�“��y�y�>��?ۃ�*��~֖������2�m���u�m�4nΠ�;S�R���G?�>o�@<���UQ�/_�����U|���v?4���[���z���R!�ܚ*4U�c����&@����b"%5�cs��ѝx�n�&oPp�k����[V
-endstream
-endobj
-3498 0 obj <<
-/Type /Page
-/Contents 3499 0 R
-/Resources 3497 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3328 0 R
-/Annots [ 3418 0 R 3419 0 R 3420 0 R 3446 0 R 3447 0 R 3448 0 R 3449 0 R 3450 0 R 3451 0 R 3452 0 R 3453 0 R 3454 0 R 3455 0 R 3456 0 R 3457 0 R 3458 0 R 3459 0 R 3460 0 R 3461 0 R 3462 0 R 3463 0 R 3464 0 R 3465 0 R 3466 0 R 3467 0 R 3468 0 R 3469 0 R 3470 0 R 3471 0 R 3472 0 R 3473 0 R 3474 0 R 3475 0 R 3476 0 R 3477 0 R 3478 0 R 3479 0 R 3480 0 R 3481 0 R 3482 0 R 3483 0 R 3484 0 R 3485 0 R 3486 0 R 3487 0 R 3488 0 R 3489 0 R 3490 0 R 3491 0 R 3492 0 R 3493 0 R 3496 0 R ]
->> endobj
-3418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 708.28 378.454 718.186]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.703 684.956 257.24 695.86]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8c7ffb3e15a1f5746c633af2af465556) >>
->> endobj
-3420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.783 684.956 328.943 695.86]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 660.285 378.454 670.19]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 648.915 257.786 659.819]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1a02b17cbccf348192f3e7f776b3b3fd) >>
->> endobj
-3448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.123 648.915 330.284 659.819]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 636.2 375.773 646.105]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-3450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 624.83 305.745 635.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aeda87d46bc3b54b420a475934e0e1cb6) >>
->> endobj
-3451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.887 624.83 377.048 635.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.46 624.83 494.287 635.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.489 600.16 302.72 610.065]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-3454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 577.831 245.911 588.735]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_adf3cfc56df68bc8063e6e9eb3d0ad3f1) >>
->> endobj
-3455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.248 577.831 318.408 588.735]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.912 565.116 521.824 575.021]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.576 542.787 292.328 553.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a2af430cd70ac416ca0907312b65812e6) >>
->> endobj
-3458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.618 542.787 367.778 553.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [413.662 542.787 491.489 553.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.622 518.117 310.533 528.022]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 495.788 236.197 506.692]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a5d71f71f50ba04fe5f810acf0cf1e294) >>
->> endobj
-3462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.534 495.788 308.695 506.692]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 483.073 357.84 492.978]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-3464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 471.703 214.06 482.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a00b832cc0784b7b30f4d4a2f738a3032) >>
->> endobj
-3465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.398 471.703 286.558 482.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.221 445.626 284.876 456.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_accbd8986577794cea90edef63e859ab1) >>
->> endobj
-3467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.455 445.626 357.615 456.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.095 445.626 476.922 456.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-3469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.902 420.955 286.2 430.86]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-3470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 359.469 289.866 370.373]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9c0703b2311336754e28a7f739b7e685) >>
->> endobj
-3471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 359.469 359.324 370.373]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 335.384 290.971 346.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_afa8a10ff4b09f8a87e3c558a39f5888e) >>
->> endobj
-3473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 335.384 360.43 346.288]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 311.299 224.003 322.203]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ab0a670aeef72d808d620bbc33a5e8cd7) >>
->> endobj
-3475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 311.299 296.5 322.203]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 298.583 272.49 308.488]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-3477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 287.214 254.15 298.118]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a63e8c0f76da4e9b3520aa338d152d253) >>
->> endobj
-3478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 287.214 338.263 298.118]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-3479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 263.129 284.585 274.033]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ab054f67fb31ea4e860dd7c24c0b56676) >>
->> endobj
-3480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 263.129 354.044 274.033]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 227.088 241.726 237.992]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4780bcf6d4bced818a0cc1b6ed7c97d2) >>
->> endobj
-3482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.617 214.373 407.658 224.278]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-3483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 203.003 249.318 213.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0badc932380dcb7f72ea50ca922d9d4b) >>
->> endobj
-3484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 203.003 288.321 213.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 203.003 371.519 213.907]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 178.918 240.62 189.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1f8426558552c358c30b6263c758fe51) >>
->> endobj
-3487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 178.918 324.734 189.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-3488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 178.918 389.5 189.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 142.878 278.538 153.782]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0a486044e2b8a3efc48b5d73b6af3267) >>
->> endobj
-3490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.353 142.878 300.953 153.782]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-3491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.2 142.878 341.927 153.782]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-3492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 74.333 203.075 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 74.333 296.324 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae68d61763922cee018cbba3834b2085c) >>
->> endobj
-3496 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3500 0 obj <<
-/D [3498 0 R /XYZ 89 770.89 null]
->> endobj
-3501 0 obj <<
-/D [3498 0 R /XYZ 90 487.058 null]
->> endobj
-3502 0 obj <<
-/D [3498 0 R /XYZ 90 93.417 null]
->> endobj
-3503 0 obj <<
-/D [3498 0 R /XYZ 90 93.417 null]
->> endobj
-3497 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F24 529 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3569 0 obj <<
-/Length 1695      
-/Filter /FlateDecode
->>
-stream
-x��[s�8���+ؗ�=S+� !:�>�iw���v�S�����p7ɿ�#��!`'N�&~��A:�O�i�����」Q���
ق
-ctn�ذLqs��}�����{�	��-����'��'�S���v���#�$�#K���+6\������ҸH�|ä
~��i�
�uY�Mu��!A7aj����E"$��J�Q���~2Sم�\z����/�I~��|�^�N�]9����iv1qr���s5 ��RS
��	��!�H���L���
�����y�1(�8�7��?
�y.��Ms/~J�sUƑ�h�&s5��A�D�$��*N��ϡ���9�?���R���Rw�L"�~����W�F��"Νy�2���6"&)����&`u0]�|2��蹡V���\"0��&���a��텸=0� �z��L��
-&�&�@D�6M����BcKĸ0��!*ha��I�
�Q��
&	Tk�a
�g�X
[��I����8��D�Ei���3e��Ť�Z�
"�� ��@X�7$S���l
��D&��Xh��0{E�Z�4e!�*���$�V9��B��[2j��HB����D�bHZ$	�`��/_�P`��z�^�BENFEJ�.&&��6�j�#�e�(
�M�+hW��x|:sjmΚ~�YHr��+"���Tk�`�Dܒmn�C�����oZ��g
1b�	�a�,�y�jߧ ��'��b��������_<�=;�,nB�oo�W����V�/�^#)��6�0!����酳h\
)G���^6���̮
/�5
P����a�����ڳ����']{ݛ�b�x�����!�	�A�+���Jp���4���Tc5�娗&�*�&{��i�Ħ�)C������~-p��.�_eW�aVs*6.z=nS�s�y�V�z�R�ɶ�k'и,/8S���p��]
Q�#�ؖ
��?L$��a�.�
����ٓ�<k�
�k� ���u���
�¤5����9�j{�x?Rpv�{�r���ʼn��1N
{��U@�}��f�&��c�r�'˴C�R�
���Q��ʟ�u�iL��^&*pˉ�ù���J�@5`F;�we��h`f񁩺~9�=�!3mD)�Ga<1Ș��n��G��
���;Nq��e�z�t|�EMˤ�E����b��oB�L�zC=o��5(��0���	fN��N���_�OUɅRA�Y�P�m����aM�a6�

#p- ��hE�-�LL�Lڡ
gXl�=���vP~��=��4�o�C�{*��Je�*���*�#M���6�وټ�D=��Q�q�e
ct3*
 �ywD�	��X��aY�X�c�8])a�X� ���	M��YЉ���e�	^g���ҟ��`����
�珊��٬�*X_-'s�UN�Iu�-�M�:�RQ]���%���T�a�.��_*�K$�������3�ˢ���SD�����e�  � P��6�vH���D�a���
������aK;`kٷ�-�Ӷ�����Ӣ���?�_!��ryV�
-�d���}��Ȃ�����M
q;�0�[��EӇ��������>3�C�n�
�ӯ�D�dI�
~.�ź�Ǐe��*�u�y?.�FKg^���kP���h
-�Z���|����2��+��SY�k!0�e
fI�xyxx���*��I�__��m�j�v^4������
���/7���
�
-endstream
-endobj
-3568 0 obj <<
-/Type /Page
-/Contents 3569 0 R
-/Resources 3567 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3328 0 R
-/Annots [ 3494 0 R 3495 0 R 3520 0 R 3521 0 R 3522 0 R 3523 0 R 3524 0 R 3525 0 R 3526 0 R 3527 0 R 3528 0 R 3529 0 R 3530 0 R 3531 0 R 3532 0 R 3533 0 R 3574 0 R 3534 0 R 3535 0 R 3536 0 R 3537 0 R 3538 0 R 3575 0 R 3539 0 R 3540 0 R 3541 0 R 3542 0 R 3543 0 R 3576 0 R 3544 0 R 3545 0 R 3546 0 R 3547 0 R 3548 0 R 3577 0 R 3549 0 R 3550 0 R 3551 0 R 3552 0 R 3553 0 R 3578 0 R 3554 0 R 3555 0 R 3556 0 R 3557 0 R 3558 0 R 3579 0 R 3559 0 R 3560 0 R 3566 0 R ]
->> endobj
-3494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 694.531 287.856 705.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae748c3f5082b158453fbb3ccf57c8f70) >>
->> endobj
-3495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 665.687 294.481 676.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8c89ddcd2fc4311af0e358477630d7d9) >>
->> endobj
-3520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 554.42 226.034 565.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8a1cd7df2586fcb1c129b1ec5a28fe9f) >>
->> endobj
-3521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 554.42 366.336 565.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 513.621 156.281 524.525]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a91187ba19738062968cc1cb26b135a6a) >>
->> endobj
-3523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 513.621 205.257 524.525]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.035 513.621 295.195 524.525]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 472.822 180.54 483.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a54d9925e5f42a7730cfa90a3d537f1a0) >>
->> endobj
-3526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 472.822 253.037 483.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.336 472.822 366.497 483.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 432.022 178.239 442.926]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a45fd50a7deed65baf4e64b803a595c29) >>
->> endobj
-3529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 432.022 250.736 442.926]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.035 432.022 364.196 442.926]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.967 391.223 243.863 402.127]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acad0e332f148041d23f17cdf85b80568) >>
->> endobj
-3532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.531 391.223 321.912 402.127]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 391.223 513.996 402.127]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 379.268 152.426 390.172]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 379.268 265.885 390.172]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.015 379.268 369.572 390.172]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.967 338.469 243.863 349.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8e28c15a0d7487efa59258598e2f78b2) >>
->> endobj
-3537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.531 338.469 321.912 349.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 338.469 513.996 349.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 326.513 152.426 337.417]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 326.513 265.885 337.417]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.015 326.513 369.572 337.417]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.967 285.714 243.863 296.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_af0d016bccf8f6a9323cdbd4743003eb2) >>
->> endobj
-3542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.531 285.714 321.912 296.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 285.714 513.996 296.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 273.759 152.426 284.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.019 273.759 270.18 284.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.786 273.759 377.343 284.663]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 221.004 241.928 231.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a01e1250fa095e6dac631943527b5e41c) >>
->> endobj
-3547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.871 221.004 320.252 231.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 221.004 513.996 231.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 209.049 152.426 219.953]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 209.049 265.885 219.953]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.015 209.049 369.572 219.953]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 168.25 241.928 179.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_abe5a9b3a09856b591bf8d94b53d1e673) >>
->> endobj
-3552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.871 168.25 320.252 179.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 168.25 513.996 179.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 156.295 152.426 167.199]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 156.295 265.885 167.199]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.015 156.295 369.572 167.199]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 115.495 241.928 126.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a26ed8b6a9eba118ffd48ecfd8bb74bbf) >>
->> endobj
-3557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.871 115.495 320.252 126.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 115.495 513.996 126.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 103.54 152.426 114.444]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.019 103.54 270.18 114.444]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.786 103.54 377.343 114.444]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3566 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3570 0 obj <<
-/D [3568 0 R /XYZ 89 770.89 null]
->> endobj
-3571 0 obj <<
-/D [3568 0 R /XYZ 90 712.265 null]
->> endobj
-3572 0 obj <<
-/D [3568 0 R /XYZ 90 683.421 null]
->> endobj
-3573 0 obj <<
-/D [3568 0 R /XYZ 90 613.122 null]
->> endobj
-3567 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F110 1507 0 R /F90 758 0 R /F39 2320 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3659 0 obj <<
-/Length 1590      
-/Filter /FlateDecode
->>
-stream
-x��[s�F���)苋f���/���m��
�v���K�f"��p
}�
�d�I#��d
��=g����h;�v�vί;�os
2�J���c���AB�C�K0��
��]�]/
{��.�n4������nb/������_�y������B*�Ñ2*���<3��
5Q^\�(� �Da�[[	/G�t��Q��0C]<y�����?�q�h�pJq&�S���y}���!P
vH��v�·O���wF
�y��
N�
9W��;8�,�FX�Z+%�L;�����Ҭ���=
-�Iz�F\�³�pe
f*vT!�G�V�DB�EI��zc���^͎�e
,ר�D=ꕚ�=B	‚�AF���&�F��i���<�o;·
��
���#�4
�YL���܆�X����O�込�_�������7���x�R�b��1ˁ�%��e���K�f���{��E=��h
�D��U�r�n
-`����˳Q8M��x�K�;=�5�L�;�2^������%��V#��
�l��y�y&�kx�9☵yP���.,�p2�J}�����>
�m�U/�3\1d4�]*=4
�d����
i v�ĵ��'���30��y!U�NA�
���,8u�o%3^PE�
Fƨ|FȬj- �1�rJ�b�f���Ƀ�Edq�Vɐ�h���+$���
��JǥY�V�"[� Zfm�W�"��h2č<(B+�Nd�����B�4S\i�ci)~8��Q|
�?x���K�b��-�-�-�w�ś���T�"���aZ��Q�	��
ct=��8߯
mO�k�x�`<�k&he3�ܓd<�+����,�t����:���Ԝ�;[��b�\a�\���B
�\�\ 3HsڈyŐV�db
塲h��^�/^�R2)ӷ��S�0��O��Z�X�hEPϖ������)k���ǐ�b���e��
��w������ՙ+�&js}��>��;n��`����s0߮<��6y�
]��Lo��a%�HK�U�*:T�6| .�@7����cB�ql�ui����{�x��*t����/����ғ�u�hT�p�T�
�yE�õB��U-�d
-ݐ|.���\¯ �j���2F�k�
k�b�b�
k�>=�傣@ښN��s�t᪐�� is8�	,I,I,I��$ǥ[$s���(�^��0�.k8b��5�촒5Rn��EKW�*YU��1ĥ�k��я%�^�
�Z�0�b|i)�%�]�Y��ߩf7��������k1��ˑ�GE��cٸFڶ�	c��٥�]�Y�
�~\�5�����#_�Y�X�X�
+G������c��9�Ӈ��&O�}�
-k�AL�}�e��i/1Қ�5�W�%r�;i K����,�&���e�z[�W�@đ��}���-׋@����%���4}=B���p3�.���/�H�LTk~	���I�B��&���.O������?S?��+������{��2��)ޏ�Af'A�F��:]�EX�Fq��?��܈��C
��"
�drvzzs;��[4���9Q�� \�3�ؼ1�(�

-B89�h'*�)S�Q`���E$ �_;8�w��-���ō������yA�ˏ��
@g�

-endstream
-endobj
-3658 0 obj <<
-/Type /Page
-/Contents 3659 0 R
-/Resources 3657 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3328 0 R
-/Annots [ 3561 0 R 3562 0 R 3563 0 R 3661 0 R 3564 0 R 3565 0 R 3590 0 R 3591 0 R 3592 0 R 3662 0 R 3593 0 R 3594 0 R 3595 0 R 3596 0 R 3597 0 R 3663 0 R 3598 0 R 3599 0 R 3600 0 R 3601 0 R 3602 0 R 3603 0 R 3604 0 R 3605 0 R 3606 0 R 3607 0 R 3608 0 R 3664 0 R 3609 0 R 3610 0 R 3611 0 R 3612 0 R 3613 0 R 3665 0 R 3614 0 R 3615 0 R 3616 0 R 3617 0 R 3618 0 R 3666 0 R 3619 0 R 3620 0 R 3621 0 R 3622 0 R 3623 0 R 3667 0 R 3624 0 R 3625 0 R 3626 0 R 3627 0 R 3628 0 R 3668 0 R 3629 0 R 3630  [...]
->> endobj
-3561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.435 696.002 240.486 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0ff8a3e3f7c118f923482924b1862c2e) >>
->> endobj
-3562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.622 696.002 319.002 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 696.002 513.996 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 684.047 152.426 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 684.047 265.885 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.015 684.047 369.572 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.435 643.107 240.486 654.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_afd263c6cdcbb67035989078c9058bb19) >>
->> endobj
-3591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.622 643.107 319.002 654.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 643.107 513.996 654.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 631.152 152.426 642.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 631.152 265.885 642.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.015 631.152 369.572 642.056]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.435 590.213 240.486 601.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a21d79f277ceee36111baef3184e8d2cd) >>
->> endobj
-3596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.622 590.213 319.002 601.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 590.213 513.996 601.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 578.258 152.426 589.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.019 578.258 270.18 589.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.786 578.258 377.343 589.162]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 525.363 180.54 536.267]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a54d9925e5f42a7730cfa90a3d537f1a0) >>
->> endobj
-3601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 525.363 253.037 536.267]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.336 525.363 366.497 536.267]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 499.913 178.239 510.816]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a45fd50a7deed65baf4e64b803a595c29) >>
->> endobj
-3604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 499.913 250.736 510.816]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.035 499.913 364.196 510.816]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.967 474.462 243.863 485.365]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a32c0ddfdabd75501718ed9f44f6d9ae2) >>
->> endobj
-3607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.531 474.462 321.912 485.365]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 474.462 513.996 485.365]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 462.506 152.426 473.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.412 462.506 273.572 473.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.911 462.506 408.468 473.41]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.967 425.1 243.863 436.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a830339e65ebcd4c100c672487dc63f33) >>
->> endobj
-3612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.531 425.1 321.912 436.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 425.1 513.996 436.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 413.145 152.426 424.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 413.145 265.885 424.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.537 413.145 393.093 424.049]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.967 387.694 243.863 398.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aaf0d15460d44b410c5a223d13b447b1a) >>
->> endobj
-3617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.531 387.694 321.912 398.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 387.694 513.996 398.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 375.739 152.426 386.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 375.739 265.885 386.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.537 375.739 393.093 386.643]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 350.288 241.928 361.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a900609f82bcb2d07dab53d7bd2035ec8) >>
->> endobj
-3622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.871 350.288 320.252 361.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 350.288 513.996 361.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 338.333 152.426 349.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.412 338.333 273.572 349.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.911 338.333 408.468 349.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 300.927 241.928 311.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a43c478e6516cd11d378e25f16e669514) >>
->> endobj
-3627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.871 300.927 320.252 311.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 300.927 513.996 311.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 288.972 152.426 299.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 288.972 265.885 299.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.537 288.972 393.093 299.876]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 263.521 241.928 274.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1d502ed8aa71e78a52f33d9b16704974) >>
->> endobj
-3632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.871 263.521 320.252 274.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 263.521 513.996 274.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 251.565 152.426 262.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 251.565 265.885 262.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.537 251.565 393.093 262.469]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.435 226.115 240.486 237.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0aa903d00357007b8ef684059f92a8d6) >>
->> endobj
-3637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.622 226.115 319.002 237.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 226.115 513.996 237.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 214.159 152.426 225.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.412 214.159 273.572 225.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.911 214.159 408.468 225.063]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.435 176.753 240.486 187.657]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a198e5e17ee2a7484f89d293b8bbf5ccf) >>
->> endobj
-3642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.622 176.753 319.002 187.657]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 176.753 513.996 187.657]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 164.798 152.426 175.702]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 164.798 265.885 175.702]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.537 164.798 393.093 175.702]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.435 139.347 240.486 150.251]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4ac2269cb78d6549ccb1d573929be1c7) >>
->> endobj
-3647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.622 139.347 319.002 150.251]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-3648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 139.347 513.996 150.251]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 127.392 152.426 138.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.725 127.392 265.885 138.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.537 127.392 393.093 138.296]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-3651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 101.941 156.281 112.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a91187ba19738062968cc1cb26b135a6a) >>
->> endobj
-3652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 101.941 205.257 112.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.035 101.941 295.195 112.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 76.49 226.034 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8a1cd7df2586fcb1c129b1ec5a28fe9f) >>
->> endobj
-3655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 76.49 366.336 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3656 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3660 0 obj <<
-/D [3658 0 R /XYZ 89 770.89 null]
->> endobj
-3657 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F67 3037 0 R /F42 531 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3692 0 obj <<
-/Length 3328      
-/Filter /FlateDecode
->>
-stream
-x��Z��6��������|H��^h�M�w���-���Jmɑ�n��
�!%��#��a��L���p
��N�:��������DL2�I.'���N�(#��_���SF����o'B��eF��/�����_�o7_�߼�a�N�!�$�,w7?�J'+h�vB���ɣD\�s;y}���P�c��
���9c�0f#a�9��N�./��j6�<�_�)�]YW���
�4��2\iW��ۼ+Ԑۗ0M?�$΄]�?L�����l��i_T��0����D��������m޶����y�ˏ����J����p���ۄcqs<�.*RHiF^����cӧM�jB
$1�ѧa!I	#�/M��������w�
.���`@p�X�>�7�>�$�K1K�)	�,�CH-¥�����K9$5W���5�±��GL���P��1��U�0���h�jY��V-�h�#`	�
)�oT�DN��nI�������)	0NI��E O�uH��4�
	Q�{��m�����
���
)����/ˢ�LcS웢���vzD�`��K�5��r�Ͽ���|�� [...]
-><k�$G+��~eʓ5���{�*�|�iƀ�rn
�g���|{@H���pV���)W�6�v�3T
Z �b�x,�[󖷁Pj�\�lfy�aY���cn�\`F	q:r�Z�)vV"�Yr�
-�x���2Ӕ��\b�C�ԃu �m 
I��K
-+8�^�휽�	�8;g.��ۚ]���iו}9Ls� �{ u2O2)��`�
="����yL����*(߲l
$�ޮ�z�.����(Ț<
�
-	v'�
�:��tD"�%������¤I{X���g#�p	1�*�����&jP�j���R���Ŕ�f����j�������'�����b�+H(S�(er��P�ʓґ��M(�)a��[+_������^��,I�b>�
4���xc�^ RI�{��B�v�w��	~:+�舂�!�
���w�0SRkN^���ט��`��&Q:����ʱK[B�͑�m��m[*��,͸xY

�����q�F
�x J9aݘ�@������������+��@��grc�R�;��{|q7H�C��Q+�A������Ԩ�~IRh{��ь�-��ֹk�m�:�I���ڀ�1�fTvR�]a=�0[��—usШcd��:��X��}by~����`�{�,��X�,�
�mٕE��dž�
E�[>H�P��W5�� 4M&��mXм+��'
-P��c)X^��W�
�8��cn������<��[z9��&-��:�i���)�٪
Y�3�f���r�*V *�.[+�j(�e��\Xs�h��꧗���C���v
����^�A]3�\�o�̷�ȫ�y���85���%���o���{?g�$'M�'<B��`rʥ4�i���~ٚ�L�.����zH隬�:�߆��AD�`���6A�Nd�d2�UA$������3�@�ivA�J�d<P��&v��? ��
��y���D��C
�Ο
�U�Kl>�T�,TG
-���u��'	�+�*�t��}U�ž��
:e�m��M����z�N�.��$��Od�/\E		��e=*A���=,7�M��P'���hS_�l��ύ��Ў'����g�� O쒡�~�^�^*��s�I.t�A�E��\����[��� ��%th��W��O�⽅�Д/L�c��Aq)
Ǵ�(~���S����b��#(��0@�"��Ԧ5�g��R�g ���,�	+#��)9����(�Gz^m!D�� �O��HB�����H�j ��Kߣ0/C
�';���TV���X at y��-,��\~A������JU�|RHJ��_��&^�4�u!L&)i�ᶮ-�k�]1*S#�/�mmQZW�ѵ9d;�tX��,�j����Ŕ%�ϡ�M�/$��U[�T��
-�B��7�ȃ�D�+.d� ��R6:��H3:�x�#��/M�:<&I	�� D��xg,U���� [S�ͦ/��3ZNa�	;�ю�U2OI09��i���I�ۇg.]���Av�~��8�Q�g*�\��O��E�qe.a$Mą���-�  ��J 7P(1����9�^@��P<smDh
���x�9J�Д{F9r��- �H�?M!\�9*�
WCCsB"�D��Uȣ�nL	K��#����[ʂ緁�
lip.;4�7]<5�9�k-W70�OB�j�?Bk{J
�"�����wcW
qlruB���X���Rn��ѵS�9�=�Apg������)}���~��D��S�@��t���T������!����
��
-�ux��cΠ'E�4zR�,zR���!<���R�v�I�;e}�
�d��B�(ãs�?%��`�Z��k�f/e�;{p�tA�z����;�j�–J�uU7�Pʮ%��� n��Vn��%�(�V�D�
�&�Ou�ޚ5�~�o�6�Ҭ,��5~@y)���+ʈ�s<ˀ>��/���#-�0�8l�NSVxY�[f�~���X����h�|���Jު���6��rNwL ����.�
��8t��q����V���7P�ѝ'���(Twnz����^�Z?��ML��K��n�` ��8ӗ���PBY�3
���v
6�~�������@o��� 䕂�dd���@t��?~|��{��h��.e�~ȫ�EtJ�x-��2���0���.lm����c����~�H�d�
�t�����Ⰶ`�&Kscӿ���2B�
�����]jS�!���p��
{W�4
-endstream
-endobj
-3691 0 obj <<
-/Type /Page
-/Contents 3692 0 R
-/Resources 3690 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3328 0 R
-/Annots [ 3685 0 R 3686 0 R 3687 0 R 3688 0 R 3689 0 R ]
->> endobj
-3685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [110.861 447.037 170.418 457.941]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-3686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.817 250.397 349.323 261.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-3687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.725 208.862 193.232 219.766]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-3688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.433 115.868 336.939 126.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-3689 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3693 0 obj <<
-/D [3691 0 R /XYZ 89 770.89 null]
->> endobj
-3694 0 obj <<
-/D [3691 0 R /XYZ 90 721.073 null]
->> endobj
-3695 0 obj <<
-/D [3691 0 R /XYZ 90 677.646 null]
->> endobj
-3690 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F10 765 0 R /F75 554 0 R /F8 794 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3699 0 obj <<
-/Length 2155      
-/Filter /FlateDecode
->>
-stream
-x��Y[s۶~ׯ�S+�D0.@�if��ɤ'm����f4�D[�J�JR��_��$�'�S'3!M-���o��w�a�U��U��d�BJP�]�x
-{�W�
�k�]�	F�`H0�����0[�����t��E�,
���Y��OO���.g�2�����%!-�D�H� -�>5"��a%�WW

-�+�g�4���y>R�A���h���Ed���n�l@�~�L��O���;����#�{Ą�#x�E��=����'#�ܕB
ϧ
�s��[��n^M��'��,0�
-$��$!�,��=��p<���/�1�����2�3��Kt�E�Q��(�EK��V_^���z�!�`,��G�F��}A�!�A�t����K�VC$�-afwzf��&������8�5�&���8����S����<?��$�,ʗi2�_.Ҏ�d5������-˨�P���֦Wk�$"�{
	
32
}�Ko�zbּ��g�C�Y����뼈�>���J�"
��Ow���RC�@2��R�F�E�eti�y0�
�2�Q��QV�$�7��~0�]��z�}�
�����C
/}|�B�s�¾�Wό�x�ߞ��F�
�.� �� ElE]�%
Q,�i2_��b���a+!�?
ua|0I_�Z�|�ᤈ'�ϛ4[X�7��T@)#�5Ǝ�U2��F~�h�Ըɤ��m��F	R�f�/�"^��ʡ|�\�YM��q
2�&B��p��p�.��m��2#e��VY�K�~��}T�K��K�4�����<��x�J�}A�==� �=��
�]1���]
��/z����}���]�<91/�ξ^vh�nLj�[��B[FN#\�W6)�ShLP��}g�#=�y��c��M�m%�[V���C�B7�OA���A�堒Q��~CY���T�jR���)ߘ�Y�}|�NV�0�ĉݼH�8�U{1D�rEE3��d7�jp� O����z%�B�N>��������,�.$�"��/#��D�g�n@U���8�\Kt��&U��4�,{�
ftn9�B>�Z�4�4�!	Fz*/dK\(�w�>%:�����@!M�MMt� A�
-T=B��BwIJ%�BeR I���n%x��o�
��D���P��3O�ё���g�m�Dd��|
�q�T0�Y��w\6�
�.5Y��׿���<wl)�^���� �p ���R��8��I�ޡԇ�R��>�0z�$�ut��Ǔ�x߁�Mj��8 
���&���JZSA�[JS"�f.�e��s���&G�2��aL+2�/��N�	s
�Z &FyCJ-|�
��Bͤ�;��[����G����`����Q[ ǰ�R�u5B�Q

$�doEc���
�eew7��%�����mKV���Pc��G�Z�_�bgD������N��-Ј����V�����
�r��}ۆ��
#�<͛q�z�����s������&�����k4�)9"<��ȃ	��	�
�9���{�g�3�:�\��g�nA�d)�hk1�Ϊc��8i�q"U������؝;�q�%���ېo�w�)%�
�!��k�f&ݤ> �~�L{<��Z�M��C�!6��ƒ�/�9q���H�]��'  
��@<���
*�p��㢧��:
�A���5��"�'��q�
�
�RA�j�&���S\�
-
�.�ˁ+�5���?G/~��������t���qq�=�7��EwRV&)0
KY-��5��	$yu<�Ե�9,34�}T����&5؊�������r���i��$͢):<��.Ŷ�¾�(�����HK������=дw�c�D�ƶ��xC&����R��!��̖�|\�F>`튻�nޡ��b5�:t��r �x��;Oz��O�<��vA^@��7�R �oL��A?�|�=��
 �?8��Ċ����E���/�坩B;Շ�e��Nj������{Ő�����D��{�TM��,%���k�w�͹fIٱ_ث�  ��o�%�&W���o��;����MY�U8o�U�A
\��#y42؆�(��n��۫��o>�4�Y��
�����d��ͣ�A$����B�9����E��_��w�2	Pu�X�� 0`#���I�׺/�^�N^/�w�B��ض�
$Y
-endstream
-endobj
-3698 0 obj <<
-/Type /Page
-/Contents 3699 0 R
-/Resources 3697 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3707 0 R
-/Annots [ 3696 0 R ]
->> endobj
-3696 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3700 0 obj <<
-/D [3698 0 R /XYZ 89 770.89 null]
->> endobj
-3701 0 obj <<
-/D [3698 0 R /XYZ 90 429.737 null]
->> endobj
-3184 0 obj <<
-/D [3698 0 R /XYZ 90 406.278 null]
->> endobj
-3702 0 obj <<
-/D [3698 0 R /XYZ 90 406.278 null]
->> endobj
-3703 0 obj <<
-/D [3698 0 R /XYZ 90 323.776 null]
->> endobj
-3185 0 obj <<
-/D [3698 0 R /XYZ 90 243.671 null]
->> endobj
-3704 0 obj <<
-/D [3698 0 R /XYZ 90 239.188 null]
->> endobj
-3186 0 obj <<
-/D [3698 0 R /XYZ 240.245 169.876 null]
->> endobj
-3705 0 obj <<
-/D [3698 0 R /XYZ 90 163.236 null]
->> endobj
-3187 0 obj <<
-/D [3698 0 R /XYZ 240.245 84.126 null]
->> endobj
-3706 0 obj <<
-/D [3698 0 R /XYZ 90 77.486 null]
->> endobj
-3697 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F90 758 0 R /F60 532 0 R /F32 764 0 R /F7 795 0 R /F93 763 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3711 0 obj <<
-/Length 2026      
-/Filter /FlateDecode
->>
-stream
-x��Z�o����B�Z83|�
-��<���^��@{�@k+�P[�I�����;�b'N
,�)��
��QQ�l�ϰ�B�r~v�V� D��2��!���
>N��O�&5"�����_?��|�_���7�?�L�8)
,�g?�`	�?��,���hpʠ�Wg�<�=�,G@��!���!�E|:#�Iow���
#�oaQ��bkQs�7��GZ!�u�����i���3��d�!�ҢQ�?܊���9BX��rJ�$ʷ����I��[��<�~�|Σ�������u��1O�B
�1����V�	1����z�ŅG"�8kV���Q�P���w,�tƕ�,��(=tg�s$fp�!p��ʬΣ$-���
-8[�N�!ӫv�K-��.AD6L/
-��
���.�x�EQ�(�c�n�4��^��~�YyK)���$����g<+�Dgk$0�E���&�e6*��\�����������u�:�Ӣ�g7�]4J.|Bkp0F���V
Y�� 1#!ELK�(�-���f�a2I�q���]����d�E��
�
.�D
�c�lt�:��	B� Q�@!ѵ7S�
���)!��Oq�zn;�&��0|J����x����!��!��$a5F�g�b|/nB�Qp���H
-�=���"�"�D.�FR����~Gz���C�q�0K
���&iENi2�����i]�c
M��,fu���"ޕ����N�	&G��8G��g�i
I�T�e�T	�dHѼ֡h�	@&���F
7��H(�
�H�
-E���H�)Ǔ?�M����)��-�r��)�HcvJ9A0:�1�_��sx�!γ���u�M��|��è�$���Қ�g*W͒,-!@�fdՉn��:Y��]
�$ͪ�
�bm6w����n��jئSӁ�d�� /�ad¹T�ma���
�O0��)U�uҧ�|� nB�{���^�|K��lJ�U~��x�	i�:�Yyk
x��R�Y@<#EX�"-*�8�[;�/���U
��������s�J�³�S�@�����s�Bn��m
�?�/�����p�~�?����
$	Oi.��x
�gb�$'G�
���I��3дN���&�C�
�O@�LQ������	���@�ǡ���=4/�
4��Ľ$�'N }H����aH�a.�c7�<�t�<�w�<�Z$�ɒ�Cmb�-�|���H��G�ߙ�"
�x��>��H�QcƢ���w$�
^*��q
�Y>��rz8���x檞�
��N~��5�P)��"r�l��E@˭�y������dͽ��k���w���:AN���6R;�4���bP���Ab�O(�z׆�n
�p%�:Ft��	*!����q*
�U���r�]��O���R��'���@�B3J�����{�Y�d�UDg��Hku2pvJIkt6�Fg#���YO�.<�_
-n��Z��t {�w������j|
5+]�����@��U���M9N�x�y
-�Q���EM�;j�QSWOS�'.�
��"<��v�|G%!�5��UfMʻ�W��(|D��<n�_�S"&�-0�'�)� �$���oׯ~���������.
�b�9�l��~��@!S� �U��}xB��`H�=ЍIno����1ɺP�j bj>Ά@���ٍ6�
��z[m�e��������j�����V,b[Yó��N�V�b/� �%^ 9#P��r�
��J=B	�7CG�3��;/���!�!*	R�1���5�����[�Ҳ�kiF�50�� �*Sõ�:�&��=���[؁��d�l�Gm| By8���-v�������Q�e�����n����?`+L��v�۷��;����-
^g@�%7z��`
�4��e�_���/S./߻ο�8���O���(��6�ob����㼽L!��e�ȁWq\�&���>�G���N�V���]���]q�B`��c\�2O�Ǿ�r��6���R��)B|G	G�_c�T
-endstream
-endobj
-3710 0 obj <<
-/Type /Page
-/Contents 3711 0 R
-/Resources 3709 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3707 0 R
-/Annots [ 3708 0 R ]
->> endobj
-3708 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3712 0 obj <<
-/D [3710 0 R /XYZ 89 770.89 null]
->> endobj
-3713 0 obj <<
-/D [3710 0 R /XYZ 90 640.379 null]
->> endobj
-3714 0 obj <<
-/D [3710 0 R /XYZ 90 586.69 null]
->> endobj
-3188 0 obj <<
-/D [3710 0 R /XYZ 90 540.065 null]
->> endobj
-3715 0 obj <<
-/D [3710 0 R /XYZ 90 535.582 null]
->> endobj
-3716 0 obj <<
-/D [3710 0 R /XYZ 90 447.227 null]
->> endobj
-3717 0 obj <<
-/D [3710 0 R /XYZ 90 393.538 null]
->> endobj
-3189 0 obj <<
-/D [3710 0 R /XYZ 90 346.912 null]
->> endobj
-3718 0 obj <<
-/D [3710 0 R /XYZ 90 342.429 null]
->> endobj
-3719 0 obj <<
-/D [3710 0 R /XYZ 90 240.609 null]
->> endobj
-3190 0 obj <<
-/D [3710 0 R /XYZ 90 181.209 null]
->> endobj
-3720 0 obj <<
-/D [3710 0 R /XYZ 90 176.725 null]
->> endobj
-3191 0 obj <<
-/D [3710 0 R /XYZ 107.534 83.504 null]
->> endobj
-3721 0 obj <<
-/D [3710 0 R /XYZ 90 77.486 null]
->> endobj
-3709 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3725 0 obj <<
-/Length 2251      
-/Filter /FlateDecode
->>
-stream
-x��Zmo�6��_�Ow2P3|��ܾ��^s�.�b�[���%WR�쿿�H�F�
[)��I�p83
�3&FTL�Sl.�O�������bS���r���j<U\#!�i5����lN0��͌`/Hw��͌b/�~ل�4��ݥA����՛ۏ�`�>/~�zGH�h���a��[ۥ52�Dy�aу�a���c��A���T` ��
w�m�����}�Έ���gf�
���b��� 
����?]�&�>��
-� 52�̟E�ݔS�����?��s�_�h��ԋ(��Rʧ�W
a_t؂VH�J���};3_�z��Ҋu��ሢ�l�!��1�t�l��
l1��?fDx��o�GԮ�"e�S<unP�sJi�=�h!��C^L%”
���C���X!N)����랹
-�Yգ��ZH``*��~���ܗ�2�����d�~^%�}�X"�Ցe�Ѐ5.X��$}�e	F�����[��]|�H��.�1�=~�#
%��Jy�p��1ʿ��pу�4��β��������w=���$m��?�����~�������_{&�5R�``1�ES�:�}��m������J���@q$x��>���m�����"���&�bW�������<Dە�����z���$���ou�K
Q�1hI!	s��fcS�I/�7a�m��{�e�`麮�]gQ�7�HuWeǚ3,j�;@��~�S^�ن��]���n���(
;� /�\nVaC�rz
'(�])��ctl8�Hk	�fȗ��n�Ct� Z�-�em��w��ڗ�]w�X"����ԛ_��""��T at rAa�
@�Sg�6�ݟ[�3$}0a�`^�̪xHYDRh�P��:#R"MU[�v�؛4���8��m��>���Q�q����{r����@b��W�#Z��	�:>�_I��۷h�&`�b79��.����-6Qŋ�x� qՅ��M���4\�nY���:�X���LJ��)��!
��]�@���S��N�˳U1�E )C>�/�F�
�O鄯�� `�7yYaķ��p��fxd_8a
�����[���1�j���?�6�I���t�g5`�L b� �pzx�C6-aY�"�v;w�����a��7�a�θ��S�!��g� ����1Ƌ${xz��A�F�z[�[l�dF��'da�@:to�.
3
.a3m��ͼ���'�G���]�G�r`Ų�c��2
M.jp�А����ag[���
-jb�y[	&A0G
��`R�f��>�py�G/
b踫�ȣ��3�D�ԡ_��i�@���X�����+]>&NJ�`�E&�_W%��S%Pb�J0g
h����}�z���k�=@����PzY�q�L�.�����v9��~�����O��l����G��O$��8���y�1�!�NJj�[ĝ���ĝ������̝���ܛ�u�)�;i2�r�EG��q���'�]��yu�����3%
/�

�Hژ4�
��Î-%`����6�)��BAz�UK���u�QEѝk��r��H����;@J<fhtD�I�9W��u& 9b�\�~�H�>��+����b؏ ��1�H�#>����
��3H,5�� f�\�/
^;
]o ^������
����+	{g��1���Z�]S�صˠLCI���ء� c�H��+RЖ�\B�9;
�'
��m�^�f���H���*yO$�glp�D�����"̣|�
-�X��8�N�	�ݰ �,�N������q�g���	�L�~��GR
;�Ґ텋	s��d�B��ɃZ���
-���#�SS����]��O�<X'q�
T��HQ}��B�}f��\
;uЀ:uPc$Y_��_�g�.x]yz��8q�}�:��8��>q`�a����}��|6�]	�t)���:P��܁�M��O6q欪a@[���E
���[��
�YӨGg6�o�����5���EM���A�������8���#���#�.a1���as7���#�HyNa����F[b,9�KU<Οհ $�Ǭ���h�ʔ�٨RH��-x\&Q��5%���
g�b؉`���-�Ft���. a��zN��8�s@��_�W��hrs��������gBx�R?�Ci%�c������H6��k!��n#�B�oZ��kRd)�(x�U����������:
�5�x��4�VU2{��V�
x���wA^qSp��y�90BKM�2�a��s��k�/�]���
��I@����s���
-endstream
-endobj
-3724 0 obj <<
-/Type /Page
-/Contents 3725 0 R
-/Resources 3723 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3707 0 R
-/Annots [ 3722 0 R ]
->> endobj
-3722 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3726 0 obj <<
-/D [3724 0 R /XYZ 89 770.89 null]
->> endobj
-3727 0 obj <<
-/D [3724 0 R /XYZ 90 618.526 null]
->> endobj
-3728 0 obj <<
-/D [3724 0 R /XYZ 90 552.484 null]
->> endobj
-3192 0 obj <<
-/D [3724 0 R /XYZ 90 505.858 null]
->> endobj
-3729 0 obj <<
-/D [3724 0 R /XYZ 90 501.375 null]
->> endobj
-3730 0 obj <<
-/D [3724 0 R /XYZ 90 389.11 null]
->> endobj
-3731 0 obj <<
-/D [3724 0 R /XYZ 90 323.067 null]
->> endobj
-3193 0 obj <<
-/D [3724 0 R /XYZ 90 276.442 null]
->> endobj
-3732 0 obj <<
-/D [3724 0 R /XYZ 90 271.959 null]
->> endobj
-3733 0 obj <<
-/D [3724 0 R /XYZ 90 159.693 null]
->> endobj
-3723 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3737 0 obj <<
-/Length 2545      
-/Filter /FlateDecode
->>
-stream
-x��[K������)���<13���d�m�Q��IQmaIpɄh�J���y @|a
'���~�|=�u�,

|w�����o%
4����Y�q �F"�O��}H
}��!`�BDG�+�����|���w滛�w7���
-�	H�`��y�Sx�C��*x�/�N\������`oKuET�[s��̝�J#�y 	C
-
g��O�d],�tc
����i0
-���T�ZoH�{P��2a2t)�8�
i
P�4iI%p%m��g5��9�� ;y�jB����CAA�%<sS�)����$},��I������ҡY���Բ!�' 5��c
�H��աG�F�ܺ{w�<Q>��1�,\�ܵ�'�f��'�v�X%�P�>f33
�1��;%e�e�N�
�"e�J2""�'�MK�*��XmW�C�\:C�i�ac�c��0�cB��$�Ѩ�ӈEW`�`����A#�*��듑?UԯM#��hL0��O��!�ͨ���m:)<T�*�la��>j�b
��hLA �u�xE�Z/�"q�!�f�d+Q���I�����$�W �yx�!�$�J	_u���Y��g��B��_z;"8��U|�vDq�-?ϓi
߿Y<�q�����W�����Ce�1�s�Z��7��S��d�_
����ۇl�N7��H
-:� ��%i�(�JW�ۇ��X#a%	���r�٪C�`����


��7~Ȍ⏉�￰��1Q8�,\tL���
-~oi���?��~&���};ۃm�������W`	���p�w��&9U��`�L�\_��@TUPy�H�`�Fh��1#f�!����H�m�n�40�U
E�M:V{�1m�I��&K���ݢ+�HଊѤ�>'��9�jfy���ě?���g��F�q�n�:�〼Jq1_t�;�,�;�gil���J�8�p���TQ+*41=�LKprM��e��S�bMd�+z!��"�
-fF
�CD�-�8?����>�GL��65�����-WK���jolx� ����SX��Y�k��`���Q�k���,�+ at EmNjt����b
�ɉ���;
F���rƫd
�r+���~�ttN'0A�!H�%@ԉ�n͞�54?$P'>���"�����g�u ���y��x���p��ʡH݅�r2����8�Ѱ
�g�iY
gf鐬�&�V�,�Z���du-W/du
O�����]>c��DJ2l�u�̣�Fq���=#���t�:H��
�u�GGh
���G�(�}�D(��T��ن����X�~�,��}oӺa��{�"��
9~�Q�
�<��q��/���a��d�
� :Y�E���@`ǒ�k�l���ApS	W�Q�ԙ쳩��:wF��F�4��f��a�d�~r*���ɩB
�J���.�G��0N�������-�MnW]cBm#�N�
��N`�A�7X-ģ�g���
�ڧ�fn��Qڼ3°f��c��ƱfsWf�F„Z��a�e͈�Әf���u���3l_��Q�'�wMt[IE��Gޭ�fS�@7��j��ҕ��te_�J�
*���b2/f��6
�I��
��U�
Da���J���p�x�-�˾r1
d[$�s�
�[`�*�吷 aInj�#ECC�9���)���4�����m�0\�%
�������d�?�3�L
�G�D
^iLs�<2�*��ܕ�[ڼ���\듷gVV����CY:o��N&E�nG�ك����_�0p�
��x}����σK�x�J�D:�!+Q�T��8�}z
-�����
K*0�PL�q�y<g��ؓ�t��'
D
- uBih�J� IҜ��;$MOB�U�t�nH�i�f�E�\P�ԍ��)!C"ih�I�B%(ġ�@���By��0]gK��Z���-��0W�x��Z/��ձ�N��ţrJ0ܪ_��X�y�k)T�j��:�	J��=�L��42=2QyMs��U
>Xs}HO��z��
��
O�4׫���3v8�@$�y~h^.s �(�����Yg���b��5�~��j�H�O���e	»��!�Ѭ-ڵ�@��O}��-�]Glj�6���
�cWf
E����+紲m�H�̉Z��>��N#���w���p����9V�o�/k<�%�s`M|/���W�۴ȶ�y�a��,yi�����_�x��[<��-
-/9ֲ���3�x�y�ӷ>(��k?��#�\՚]��c6W�,�Y�
��]�4$��A��TۣJ
/m������w��Զw�Fol&�����$�-��1�E����_=vȀĽ[M����0�gm �6�j�*_v���v��e;HU�!v�u�H}��'y�E�dz�Y�D���
|sb�T<�{��]"C}/);��g�'Y$�r�_��`"%�_����o���߯X�*a;qc�7�	,ɸ2�܎�"��Ri�����w��M��y$D��8��Kwo�C[��r�ldЀ�wI�������]�f��H�
-r�X߾|��}�$�#�����uf�c
���XƬl|����x�����7y�s�-
-endstream
-endobj
-3736 0 obj <<
-/Type /Page
-/Contents 3737 0 R
-/Resources 3735 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3707 0 R
-/Annots [ 3734 0 R ]
->> endobj
-3734 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3738 0 obj <<
-/D [3736 0 R /XYZ 89 770.89 null]
->> endobj
-3739 0 obj <<
-/D [3736 0 R /XYZ 90 718.682 null]
->> endobj
-3740 0 obj <<
-/D [3736 0 R /XYZ 90 667.449 null]
->> endobj
-3258 0 obj <<
-/D [3736 0 R /XYZ 90 642.916 null]
->> endobj
-3741 0 obj <<
-/D [3736 0 R /XYZ 90 642.916 null]
->> endobj
-3742 0 obj <<
-/D [3736 0 R /XYZ 90 570.237 null]
->> endobj
-3259 0 obj <<
-/D [3736 0 R /XYZ 90 535.567 null]
->> endobj
-3743 0 obj <<
-/D [3736 0 R /XYZ 90 531.084 null]
->> endobj
-3744 0 obj <<
-/D [3736 0 R /XYZ 90 458.221 null]
->> endobj
-3260 0 obj <<
-/D [3736 0 R /XYZ 90 423.551 null]
->> endobj
-3745 0 obj <<
-/D [3736 0 R /XYZ 90 419.068 null]
->> endobj
-3746 0 obj <<
-/D [3736 0 R /XYZ 90 324.427 null]
->> endobj
-3747 0 obj <<
-/D [3736 0 R /XYZ 90 233.676 null]
->> endobj
-3261 0 obj <<
-/D [3736 0 R /XYZ 211.842 168.856 null]
->> endobj
-3748 0 obj <<
-/D [3736 0 R /XYZ 90 164.219 null]
->> endobj
-3735 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3752 0 obj <<
-/Length 2798      
-/Filter /FlateDecode
->>
-stream
-x��\[���~�_��V���/۠I� �
8�}p�W�Vl%r�Kl���
�Wi�
9��a��(��93ߜ�G.
=�������n^~��� #�
�-F�7HH�4���dJ0��7���f
ݿ�P<�V���|ݿN
6�������޿]FO���ݏ/�#�!����0h.�+wKkd���;�
��
?'�U��N�T`f�8^?��]��/�̈́�q����L�	!V�ͫ���n��#�C �G��ͻ�x4��?�0b`̇����S������7���ꈨ���P�7Ȭu�a�G�0d��
f��<G�xg�$�m�בd��ߺ/�wG�a�`�OZ&�Ƕ���*cF�H$�8%�&�q ��v
!
����;�h���q��5_DR�8P�\z"%2T���[]%i
m�y<!�jo�I��k��
�����d��7�����ÿ�ٮ�7�-�;�[R��,�˯�bO��]
M�{v�d��iB����o��Q�Ȁy���pH8���9"���3㈂�Z!Ŵ[����>���4񂹥I�t��7�.+�-
-\�߃ʛx�_�O�O�G�}|�z[ѽ�-hH(��蠤H
U�BI	�4��4�J�4�C��I�y�f�$�\`�mG�҃H�L�%:0	�8�a�D
b
dJ�0#n	��r	���Ҋ`����6���$⸊dI��(-�j��>���4�"�V����r�����tC	DR.B�3�DN&�����y
r
����I��R?^��AJ�}\S�-�<��e2�tO �f�8�o_؏z�!Y��.��c�v��ԥ���?eI�sלÔ��*��7�Ϫ����2�Ğ�Q�4�ŸH�,���M
�7o�h���ݐ�'=4�h�]�n�B�3,h��[�uU���A�"�z�q?Y��)/(
�aH�)ϛ��9�
2s� 4�({8EGr(���!2�N 3�Z���G�3��B��b
Y�I�混I:��h��cj��1쿓���#�YPK�
@=4�p�T�Lm�K
Ξ�-�[n2��?�U��1Iθ�v4�Q�S�J�*D�
lS��	,����I:��O�Vg=��G�f�6�� [...]
�葦|�h#��E�
ۧ�lYɼ���X{h��A6;���8bH}�]�Z>nY+H5�8�z�PH�
-g�OOq����x{�\!��A�%�ôJ�
�l���n���A�}��~���R�Jsʨ�,��B�o���T����
<�r��3H�v
��
����y������
p����5E�T��_JT
uTTw�
ۉ�վ`펩�3�o�xN�Β"8���z�;G�p���c&Ú� O �Ov�����9W����h
2"�i.��"�>Cm*D�U��B�)�	chަ�mC�/| o�o�)��kUH�j�s4ۍW����@�Ou
+q��8-���P`
���
-�[���6�C���u��Ag�+
��Ru��l�4BD�5�q2o��I�P��ė&(�j<
K�jlݘy8�u�P�v<���I��V=cT��2��r�rI���Ⱦ�@��$����������!sM>,�����Fa��!�o!gm�V��M|\��{_6[��(�l�-7+�k�~f6�3�U� �%�/'aE��$���
���'�R�?�r�k�PX
-B�
>��<v��@��`
ϡ%:<c�ǫ0$�B\
�:�aQe	��5񃹩��|h���
K���^y)HH+��
K6�cRŒ�-u[a�"Bt�&^,�4��
����t��I�>x\�C����zR��܆�L�ҍ��2Ft�.^F��KpF� u�(�bz�A���K*.�������H	
�b�0Ta{ΟA�۳P[3JC�A
�C� Հ�&
�Ғ:0�'
Բ�

T�A�W�{�HBYح�_����>
�N�A��}�d����8L�cO�|� ��t��hy(:� ٓ��c?�6O~�j�H�%H�T��C����kB�~� ��6�=	!�m�]��P[M�BSn'��ejdB29��PtN!�G��Pt�����_��s�)}�g���*g�
�\\�rz~ts�Ρ�(3�²
z �#�\�1��
I��
-E/�t'�����mC�蜆��#I����C���>�w�e�>N���g���Q�cI��
=2�A0~@"Q�I"1�d
/"�$9��/���h {Tu"w��Oŝϧژe���z8x.��L.�PW�Ĕ���+� �8d�?�ļ<'Ҿ稃�Wv���������G�R�����?����6G
���
��}',�@���E�$�j�sS��!���ѽ��>��
��
��}s������CבW5�c���s�W�
�^{����@p�MyF���W�a��������j��?G^]����ҍ%)����
:1�B���U0��u�a:��\C�6TDe6W��g�4��c�o��/lh���|�Q[
ًE-dO�����]>{[���{���?_D��^�n��D��&��%�����3�J�ɔH��/u�O�f�@���kw��m���ľ1�>�#J��ʝ۶�{9eS�
a�B����q\��N���ʳ��'�U!�#!��c��=ݾ|�����#���_԰b^]�/���6����|Ϡ�+X�$%-g&�7X?LT��
-�k��_�?,.��a�F�f0��j��m]8
-endstream
-endobj
-3751 0 obj <<
-/Type /Page
-/Contents 3752 0 R
-/Resources 3750 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3707 0 R
-/Annots [ 3749 0 R ]
->> endobj
-3749 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3753 0 obj <<
-/D [3751 0 R /XYZ 89 770.89 null]
->> endobj
-3754 0 obj <<
-/D [3751 0 R /XYZ 90 720.814 null]
->> endobj
-3755 0 obj <<
-/D [3751 0 R /XYZ 90 605.755 null]
->> endobj
-3262 0 obj <<
-/D [3751 0 R /XYZ 192.853 541.506 null]
->> endobj
-3756 0 obj <<
-/D [3751 0 R /XYZ 90 535.488 null]
->> endobj
-3757 0 obj <<
-/D [3751 0 R /XYZ 90 442.381 null]
->> endobj
-3758 0 obj <<
-/D [3751 0 R /XYZ 90 351.631 null]
->> endobj
-3263 0 obj <<
-/D [3751 0 R /XYZ 211.842 287.382 null]
->> endobj
-3759 0 obj <<
-/D [3751 0 R /XYZ 90 282.744 null]
->> endobj
-3760 0 obj <<
-/D [3751 0 R /XYZ 90 188.257 null]
->> endobj
-3750 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3766 0 obj <<
-/Length 2706      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�SKΘ�cWI����8uS5V�
�"A	-	� (���=��+�
/�'�d�@\|{Ξ۷8+�=x�{{��������HK*�ۥ���s���o
��:�t��ǤBDKx�����?ݾ�����������+?a�8 �|���W?ao��0bZy_젵�)�ϕ���W8���DT�K�K���J#����N�7��ç,J�� �`
-7���@x,��~��v�ԡ5ؗ�chOj���F��؃%�I�!�s5H{�pDa�s�4�5g����� �
���q6���:��
O��U��
�)�'�ug�^]�����٨��:�@t_S�8"���T�ݐb�(k(z��&S*&_��
-<��F;0Q{�S�$)�(��)u���q\
-�Cy}�%R�_��c�6Ҫ��
���di�_D`�
��,����)Ȣ�U��
&��.��� 2������
a�DL)���-VSH�Q�&�ҬCf�&��)۹�$mC��\%�.�k����]�'�x.ܗe������9�T�ɫ��	L�f�`�	[&g�z�4̶i\�Y�C^BJ�i�d����t�H)U�zպ�
��8F�Q
����S�{3
r/�
���4��T��
-�����Y��?��"��v����q���l #�k�!0Ɠ
�md�
	�=�3�U� ߺ�	|��R�l����H�����:�[ A8J���O�U�����OK��L	��Zw7S�'�j��w��4Hw����p��1xj��E=o~;(Q�V ����X���e~ކ�|�Ovn�~�[�6cPz)�6�Ӫ}d�(kY
-yO���8
һ7&5	7&�H����L(��.�p�Q8%bb@%.��!CR���O�%dD:�r^�7;x c'�n됟2N EC��P�R��~
-yX���&��t��*G,�C$nSLC�Iz����!G�Gѓ3�_�������Ii]7����j�:ԙ�m)�Ħ��t&`[
-�f�8}�%v#r�ֆ��[��rD���İ�(
Y
-
ǚ�.Z�.�xE_�,DU�fJz�_��HBew�$gH?ۺ�i�u
�
+�y�n�v�*y�P��g��xڋ$^��U�S�ڢ��<5E�,�}l��~6l&X3�b��>�6�0�~Y6Px
)���20�b���ڲlXc�ћr	�،[<�D�P��>K�`����b�Oәĸk4	5���axjTMdQ�)�b
,!
�N���f�1�)� �d\������#�
" J�N��MV�Ɲ�2!�D����&����^1")ܼP����Fi N
an
>kي�.FNY�e����1�1�Y�pɠ�]�M߸�8
a_���X8�@�n���!Ou���әr�v�6l�}���TZ^��n(��vo�Nw�0�>W��]�


C
�&A��X*i��}e���W��~-�o��]d��A5H�b]V �"C�V|c���"������CF]ڽ�<�x��ao}�����U�)��1F��[��WP
Lq�6���4Z4ҵ�7�a[U�$
�[·�g̃<
<&y=��9x��y�����V��qq��u�a\�����؈6칆G�
�ָ��@'4�{q�8&�/��5��t>�r8�k/��R��z5�G~���7[#_7.�"�|ZE��}��v����ߖ���c:�V�J���i��r �§���Zv�$�>]��$P�v
–��II���Q��78�u�i~v���n�������<�'H2:���Q�*O;.{^&I���%)=m��:�|M�8�;�
_;1���f�g $gc���Ok�s�z�v9��:���_ �E�q">j��yI��S�=Z�|LM�~���g�����0/��[�;���
�qC�|�ֆ9��,������j�u�m�c(`B՛)��c��J���o�u,��r�� [...]
-,
8a�`��T�!�qI�
`Z�J�i��1Ij
��J5AJ�GR�Դ �{��IR�v��F86I�x��`���]DPϷVgH��%�a��
� �V4�rZ�_�֐NZCi
?���Ik��у�FW�f���<[�� ��P��Lr��N<�<��KĠ.5�_/���8%�cʙ���L��h��o�a]N�d�:��:��1�Mo�S?�q-���X����=�L
-�y/A�(Q�-�R��?�ɨ�0-1#�hW�TbV����_!`��15-�ٞ�g����3K�ηVw$V��.�
$f�l��׉�G03I��afTw13Y
��|�ď`f��/�� u�^$
��\��1a�pkk*s��>&�m6���6�J�<�5g�t+��1�f���3/Ss�(Y�LPV�<�46
4g�����	���ℓ���o��ܿI��	���qd��kv�O�������1&��_;��]��g��߭��C`�
�f`Q�h�5�� ��c�g
-nn޻�n��S!&y��oA�
V���;��V�	���t� �~���N��b���ڤ&x���s>f������ۇM?�����CW�C��.'���rQ
7ׁa���/��[�
-endstream
-endobj
-3765 0 obj <<
-/Type /Page
-/Contents 3766 0 R
-/Resources 3764 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3707 0 R
-/Annots [ 3761 0 R 3762 0 R 3763 0 R ]
->> endobj
-3761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.931 507.696 186.185 520.03]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-3762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.668 507.696 272.341 520.03]
-/A << /S /GoTo /D (index_Grid_Frequency) >>
->> endobj
-3763 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3767 0 obj <<
-/D [3765 0 R /XYZ 89 770.89 null]
->> endobj
-3768 0 obj <<
-/D [3765 0 R /XYZ 90 718.682 null]
->> endobj
-3264 0 obj <<
-/D [3765 0 R /XYZ 192.853 654.432 null]
->> endobj
-3769 0 obj <<
-/D [3765 0 R /XYZ 90 648.415 null]
->> endobj
-3770 0 obj <<
-/D [3765 0 R /XYZ 90 557.31 null]
->> endobj
-3771 0 obj <<
-/D [3765 0 R /XYZ 90 442.252 null]
->> endobj
-3265 0 obj <<
-/D [3765 0 R /XYZ 439.299 389.957 null]
->> endobj
-3772 0 obj <<
-/D [3765 0 R /XYZ 90 383.94 null]
->> endobj
-3773 0 obj <<
-/D [3765 0 R /XYZ 90 312.611 null]
->> endobj
-3266 0 obj <<
-/D [3765 0 R /XYZ 90 277.941 null]
->> endobj
-3774 0 obj <<
-/D [3765 0 R /XYZ 90 273.458 null]
->> endobj
-3775 0 obj <<
-/D [3765 0 R /XYZ 90 200.595 null]
->> endobj
-3267 0 obj <<
-/D [3765 0 R /XYZ 90 164.154 null]
->> endobj
-3776 0 obj <<
-/D [3765 0 R /XYZ 90 159.671 null]
->> endobj
-3764 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3780 0 obj <<
-/Length 2236      
-/Filter /FlateDecode
->>
-stream
-x��[�۸���)���@���2(h��E�[ M�}�.[�1jK^Y��|�
�fQ���Lc�E�9�O�C���d
�
|?{s7��N�� #�
�
��
��
-~
-	F|� �����0�v���9�a�}y�WYt���!�����7��?>E�x���7�Ғ%�#e4tZ���l��
=Q^7���0�0Q7�fL��6:
�
*0�ƻ�6���·�1��D�q��[�3¬��ۻ�/328 �;R:X�f?�����!���1��F��S�m�q���<�\���T��㘵A�@�4�п�u��M�
��H�tQ�`;8<�HP58�b���-�kk"bL a�0��]hM��#K�J���{-��>ሂ�+�,
[*��8
�P���Qp���C����$s��O�v����9S��y'y9_��b�̼
-���]K�H5d�l/C�
��1��)K�T���2f6�Uȉ��8EL�:�~-[8�q��}��zD�DZ���˨HVEq���m�~Yl�e��G��a[�)���j�r�Prڠ�ỳU�,ȳ�c%��^��"���d�%��
C�T[B^g��l�����
q�o�/�8�vv�8�M�
�&V#��0S��7���ir�!�a�2(�/�ɨ�� �a�8��V���AB�`Q-��M'NjL���j;Nv*g�����~E�ѦY
��N4�'��`�����&�Q
�
<_p!�%lQy�D��&+����h��=�q
�1�����D6-�=��jY7�ёr������*
�<a�X[���8Β
-
�*�Ԏ��?���&Y��y���q��#iyR0$=�
��$
-�Ѵɟ6��
H%☴�;�e��N����
:�լX�b��#:�_P)�օa���M@��L�W�, Fh�
��	0-�K Fh�`ν�OKk��:�`
K�!��.�
�(����)4�r(0���"��>y�#
-$��~���Q��U
��5��X�b�`�������y��u�\N�}_
}�
-�Y�9�#|<}�������q��M	�
':��J�������^
m8$8n�פy�m�N|�MK��� ��*oh���m:�ND�үm�Ǧ=h1
�
q.�����;T�
���@�Ds�n8lqҳC7��D7���醌ҍ���C�"}�
�p "�R���Y��Y_�F"q|37�ޚ�`|Z���V���3ڬ]�dC�
���X�L�5�;�0�l
�}f�+hX���ͨ�5-�K���������ƚ���Ʊ�����t�P`^�b3}��GH*�F�%��L(�c��2
;�4�J�7gX☽�t�>ɣ�E/WH�^����Xh��J�!�
/��6e�C�0N�\0X�Zp��e�Ȉ�Md���� b�p?Y�D}$B$�xR�Ę���K�Q�0G�+9�yF�	d�"𛬒&ۗ�'����ɵ������9���)0�UO�>��5�
�A5p
-%���QD��xPaS/�Ү�Y��f�����%�Ama�o����<:�N��	o�
�(��h��U:(/�}��A�&���@����@
V���c�1}�H���p��(P��^�=qM���
~H�F�S��=y�nV}��>
䯏 �� =
^QW�Vs�N�*\B��l�f.��p�K��'��@����|�u�4�ιz
��	��$3�G,��GY�N[�{�f^��5��������w�v�&��D���C���j�YA�D�g�0]
xC�-��dW
�|��K��6b�ڢ�����! !��me�0��×��&F�+ m���ػbAM�bO:��`��F8�����
���p��A�@�,
�8���y��zߵ�]VQ��E?����\0��3
�tX�K��d�/{מ`�iR{?�u��w�"�
�=���+
�^��Q*��ԡa^)�v��fb}�pl���m�;n�MtNF�)sڷ6����xx(
F���f [��6mq� �_����ց�ފ*�@�G�Ѯ�#�T
��	S��E	`T���.�֕���~�fy�
-/
�x�jW`nI�\�ʃ��u7�S$4���ɒ����E����:��P)y��Z!atg�{�����?q�ǹaEr���h[~���iNDg�4A��-�K��J���ԟ�6+�q(Dp`�&���|{s��>���b>%�
��� �c���]Z? �$psW<�D���Y>������_fT���>��Xݸ���Rp�q��
27�
-endstream
-endobj
-3779 0 obj <<
-/Type /Page
-/Contents 3780 0 R
-/Resources 3778 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3794 0 R
-/Annots [ 3777 0 R ]
->> endobj
-3777 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3781 0 obj <<
-/D [3779 0 R /XYZ 89 770.89 null]
->> endobj
-3782 0 obj <<
-/D [3779 0 R /XYZ 90 718.682 null]
->> endobj
-3268 0 obj <<
-/D [3779 0 R /XYZ 90 684.012 null]
->> endobj
-3783 0 obj <<
-/D [3779 0 R /XYZ 90 679.529 null]
->> endobj
-3784 0 obj <<
-/D [3779 0 R /XYZ 90 606.666 null]
->> endobj
-3269 0 obj <<
-/D [3779 0 R /XYZ 90 571.996 null]
->> endobj
-3785 0 obj <<
-/D [3779 0 R /XYZ 90 567.513 null]
->> endobj
-3786 0 obj <<
-/D [3779 0 R /XYZ 90 494.65 null]
->> endobj
-3270 0 obj <<
-/D [3779 0 R /XYZ 90 459.98 null]
->> endobj
-3787 0 obj <<
-/D [3779 0 R /XYZ 90 455.497 null]
->> endobj
-3788 0 obj <<
-/D [3779 0 R /XYZ 90 382.634 null]
->> endobj
-3271 0 obj <<
-/D [3779 0 R /XYZ 90 347.964 null]
->> endobj
-3789 0 obj <<
-/D [3779 0 R /XYZ 90 343.48 null]
->> endobj
-3790 0 obj <<
-/D [3779 0 R /XYZ 90 270.618 null]
->> endobj
-3329 0 obj <<
-/D [3779 0 R /XYZ 90 235.948 null]
->> endobj
-3791 0 obj <<
-/D [3779 0 R /XYZ 90 231.464 null]
->> endobj
-3792 0 obj <<
-/D [3779 0 R /XYZ 90 160.733 null]
->> endobj
-3793 0 obj <<
-/D [3779 0 R /XYZ 90 107.044 null]
->> endobj
-3778 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3798 0 obj <<
-/Length 2179      
-/Filter /FlateDecode
->>
-stream
-x��Z[o��~���SK�z��(�4I����Vч���E�"*�
-I%տ���"R�(K��^΋E��ogvg��o��{���Ǜ7�����yI�7{�
�7HH�/�>���ɧ�
�#�-w��i��ٽ}v�nv����#�@ ������'�p�#f���5Zy�2�]z�7���-Qa/�Oe`u-#R�G
9���_D��2("k��{h�{S)$��M�m٢����M�b���`M��������h�f�n�eB���aٮ3�D#�Y��Ä`?�V�Ç	�~��.�0

~�� ��ݽy�p��}N��d�Kk�����Vr�-;N��wwA8Q~x\2��t�Ű���6M,
�:�I�;S?O��l%s7ޔ1� ^���Q��
<�r!m��z�Q�ts��&>~U��j5��!���?�����&`qW���{�n=%��ޔRD�._�}�������k2�����E��vN
�7U��yEZ����ȷ9��c}��Ly�jdv1�3Ƭ�D1�r���
)C�i�:#�%��Y�R�] [...]
-�k2�2���/Gq��Q/HQ�T�R� H²���
$�)N�QҤ� �J�0���auM�d���A?.���C.�4��AJ�ӝ5�,���JҢ��0s%c��Ja���岪J��z�fEV��ݫ&޼�ڹ��]��*��St�
b�v�
-���È���5�'��`	M��H��2�G����}���e�H3󍔑3�
K#��(��Rs7cJ�������wj'��S�8>¿V
U��e�8 @���S"�!�y�7�
��F:P0�҆�>��2N�O�b
-�;�15U���f��
H��PrZ�;r��zL7IX�d�	�S��$UA6�I�<�I+�5
����E�
-")������
-�%#�ɣ#���
�
-�qĕ���� %X;"O��+��W
3fGWU����k�\^��.w���
>�1C�b��/+��������Z
-��[W
H^P:��j!^!�8�U�Ѥֈ~�Rk��ˤV�϶Ԣ�
�Z
2c�,�]�a�VO� Qw*g������Gu�����H`}���~q�@�y٣�ۥ�Śe!G9$xI����E<_T�JE�V���ŷ�a��Q���
kL�
-�c���]
�_Q�1���a�\yB���4���W�N�����lJ�v����Pd��Jz�k��(2"�R8(
���Es�x;��/�>�!e���P
��V]����S�-X����j�R���;��ȡP��gf at k����(
�2lĢ|tDWڈ�L��먖��
]w����cF��;
����QO�c����xQ>e��f�ve(�3V�*�vݵ�|��/_(f/���Q���y�|9�yb�B00=��� 8�YP�f�&���l
�
-5K�
�������잣��َ�����75{qX
'
- at T���O>W`�G���VgL��0�׬>�8�܏�7����
o��P?M�ګ �7+G���ń�n���3����{� l��V�OCO�`
�T
�u�q��ϣ<�,�2�K��f�:��,*6Y��;
��7f�]�5߅?Ѡ�h}*W�i���
F�\R�q߮���	�]��
bTww �/;�
;0^Ne��A j����mo 

�j[ޒÏc�`��8���� �$}�� 	3v�k�^E�R����[1w�@�ϛ��_�`�j�`��۸�� _��*�{�O!�X�V��7��L���k���)(:�h>wa�u���a�Nu��O+�Ml7�����4xdO
l�ڣ�+T?|����{
e���W#�� ���]_,�GY�I�QX���(����럍��q�вGp$Dʋ�X���>n��(yFPz
���e9w�a֓M@֘U�E����U`����	�Yi
-endstream
-endobj
-3797 0 obj <<
-/Type /Page
-/Contents 3798 0 R
-/Resources 3796 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3794 0 R
-/Annots [ 3795 0 R ]
->> endobj
-3795 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3799 0 obj <<
-/D [3797 0 R /XYZ 89 770.89 null]
->> endobj
-3330 0 obj <<
-/D [3797 0 R /XYZ 90 721.073 null]
->> endobj
-3800 0 obj <<
-/D [3797 0 R /XYZ 90 721.073 null]
->> endobj
-3801 0 obj <<
-/D [3797 0 R /XYZ 90 658.004 null]
->> endobj
-3802 0 obj <<
-/D [3797 0 R /XYZ 90 604.315 null]
->> endobj
-3331 0 obj <<
-/D [3797 0 R /XYZ 90 557.689 null]
->> endobj
-3803 0 obj <<
-/D [3797 0 R /XYZ 90 553.206 null]
->> endobj
-3804 0 obj <<
-/D [3797 0 R /XYZ 90 482.475 null]
->> endobj
-3805 0 obj <<
-/D [3797 0 R /XYZ 90 428.786 null]
->> endobj
-3332 0 obj <<
-/D [3797 0 R /XYZ 90 382.161 null]
->> endobj
-3806 0 obj <<
-/D [3797 0 R /XYZ 90 377.678 null]
->> endobj
-3807 0 obj <<
-/D [3797 0 R /XYZ 90 306.947 null]
->> endobj
-3808 0 obj <<
-/D [3797 0 R /XYZ 90 253.258 null]
->> endobj
-3333 0 obj <<
-/D [3797 0 R /XYZ 90 137.792 null]
->> endobj
-3809 0 obj <<
-/D [3797 0 R /XYZ 90 133.309 null]
->> endobj
-3796 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3813 0 obj <<
-/Length 2298      
-/Filter /FlateDecode
->>
-stream
-x��[ݏ۸�_��V�\~S\����H�-��
��]
�%G�����P�dI����{�K�����p8��
�x��������'�<����{x�4��HH�+�>�#>����aJ�f���Ôb?]n&���_�,̶��o�=~\�k3�����O���͑�LZJ�S5�33�Dy=�a@�F��z��OIx�
�|:��0M}�Z/��TO�a�M6%�o�9<R�	�aeN~|�|��=R�C x����g�E��g#�|+�<N\�����'�y��"*쭽8�̝΁FsO�4�4�r�s�2�U��y�מ����V/�=�p�`��Z&рm-��*�=�%X
�
-�	�B��V��D�a��aM+�_����H
-o�C�W�H�4U]=ަIƉ
�b�bu�&/��j�&,��o�rY�=��a��
K{��m^�Uu�>7��"�Y��yQn,�H;u�����ֿ1fn���(�t@�1�"Ϋ1
�)�9i��~D"r��Ʃ������P�<�����f]İ����@
-X=uT��*�dt�U:`�
�2�zR	\I_��YKb��pD!�*�񞏧Bf �K�1�V&/���8�r�
�q�fS�����$�񠧘� �h'X�C��2��ꈡݭ�5�Bױ�a��S*�o�tư�������<��IS7��$�C��.����I��T�G1�N�i'�t���ii~��P��lh2
-.����M��S�p!e��_z3*!���feBs̥���|Q��.g'��)d�U�\n]�߬�iV��i�+o޹q%h+o�tڝ��L#&o؊�sH�7n
�E��

�(�ˈAH8�\Ԡs�*�$���p�o۵I ڰ���L P���#�S���բ�4��p4x��z�M�_�v�䘙]��,�Q�q���Ⰵ�e
J�����}Po�
U��D�
-�Ғn�b?��JQ��LU3gfo�S"��R 
�lh(&�NTW�.d�$]�Z�\��������
-*�{`
	�C�Z�=���K�]�M��� �Pn%���ܧ8YƉ��:�D
qy	| &�^p��K�
 
��
)��@��
�{��|�ĶR~���K
�Q�
�1T� �x�Z������[(C6g�U@�ֿ1-�&�����K$* aJ//�y��

-���ަ� -�Ѣ�\�Ŕ�e��}7T���)�r��=��53��R'�$w�
���uwP�b��2*^�����}�W��Y�i�S���X<���*�v��-P�s�g1ݫW�p�c���%^����x��
-v��]nI0.�}�e�����R#Rݖ��.��,�@uG����=C���
;�S�W����Mu���I$��
-'�d^��a��z�5eB+�������}�����o^o.�(J�iR��
-�0�7�2�WoJ�Q�
�c
&ը'��U��I:
��[�D��
�ݬ�s�x�އj��ɟ7K�lVMil��KT�^f��dN�2z�
� x2`H�+�&�@#�M
�X�ZN����cX
҄"�BTs��OA��)^�O!��Sd*M�@� �c@`(7u*Cʊ��ַ�X
�
-�\C&cVmGt'�!�Vsbƅ��
mUx�OQ�~ߵ<�2�/hP
Ȁ���#�'EJ�n{�y��Ú����}�nH
iӞI���
-��uϡ����O�&iN#�>���M�jSD�0Wz��*
��:@<���F���~�${��#�����B
�Hg�! pT�$���7*1���h��굹]�*t�ޅ{\
������CW��}���ٙ
��]q8n@$
�<��^�e��Bat��o
-�A�����j��-���=���vO�	9�)@-

�;�
�Һ+�3��
-
1u�-б��(w�`[��$�2ض�it �o�N`���"���P��L�|��
�Q R����M2O

�� N{��~�\����Ӕ
8���A��(^���k�Y+�ՙtwRs6�Ұ�����k絖�3ᡵ�+u�b��.�����tu��.��4�%{Fq._�v
���@ �c��ҭ��TP��Ķ�E�R�rG�X�9`:ҷͶ�[���n��)�u���������
�1��
@��v*�?*��9��	<"l��Z��v?����ع�塎� b at r~�]����>�Z�@��8�w���0لn�lm�j;�&˫�?<$ۚ��1.qTJ�ǫ�~��In�
-
	�t�E����{ڼ�&yA l��G� ��I��e�ߞ�5H�x�
--EuQo���C�	p�X?L����}����{p�~żw)8x�Z����
-endstream
-endobj
-3812 0 obj <<
-/Type /Page
-/Contents 3813 0 R
-/Resources 3811 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3794 0 R
-/Annots [ 3810 0 R ]
->> endobj
-3810 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3814 0 obj <<
-/D [3812 0 R /XYZ 89 770.89 null]
->> endobj
-3815 0 obj <<
-/D [3812 0 R /XYZ 90 720.814 null]
->> endobj
-3816 0 obj <<
-/D [3812 0 R /XYZ 90 667.125 null]
->> endobj
-3334 0 obj <<
-/D [3812 0 R /XYZ 90 620.5 null]
->> endobj
-3817 0 obj <<
-/D [3812 0 R /XYZ 90 616.017 null]
->> endobj
-3818 0 obj <<
-/D [3812 0 R /XYZ 90 545.286 null]
->> endobj
-3819 0 obj <<
-/D [3812 0 R /XYZ 90 479.641 null]
->> endobj
-3335 0 obj <<
-/D [3812 0 R /XYZ 90 364.951 null]
->> endobj
-3820 0 obj <<
-/D [3812 0 R /XYZ 90 360.468 null]
->> endobj
-3821 0 obj <<
-/D [3812 0 R /XYZ 90 291.894 null]
->> endobj
-3822 0 obj <<
-/D [3812 0 R /XYZ 90 238.205 null]
->> endobj
-3336 0 obj <<
-/D [3812 0 R /XYZ 90 203.535 null]
->> endobj
-3823 0 obj <<
-/D [3812 0 R /XYZ 90 199.052 null]
->> endobj
-3824 0 obj <<
-/D [3812 0 R /XYZ 90 128.321 null]
->> endobj
-3811 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3830 0 obj <<
-/Length 2746      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_��F��`\	`'ә&�3N��ɮ�
�W�j9�H�����s �"%�N7�O� �� ��
@4�4����۫��,�!�ۇ��@KKT�f��c����ρ
a6��\������/�7�w������.0O@m�����̠��aM��
Z�
x.���_�h�K�$\�+>*��Cc	�2�LC�g��i�*�,-
C[$���3�[�Ӑ(��r�6�l��E�k�a� ���
�0���YO�I�k�t�L�\���E�
��>�qB����S����$
K:�-��]���
͟�qZzy���,](,�o�TIX���4l�!��p�Y��c���}N���(y�սx�e�;ɉYmG�S*� �ڃ�5͘�1)��.!���3?�4K��S�N�
��"ܨ��鼇,\��Σ<�dg	H� 
�$�4[��2�_�d������K�t�I!I��fz��N
���@p\ޭR[
-4�0J騌��ETV2c����$��w~D��&Z6��U�FK� ��=a	�6�kA�N���1��,�U��1w�
��onj��,���cNG���1���ݛ�>��������y�V}��k��w��[ل[C����R��+�-�5���<C�i�
��B0
�\�7�q0Z�hƶ0-�B����ܟ��gVrֲAf�8�;)���̣$-
�nn�
):�H��
I;-l$�CC��� ���b#�U_���n��HaZ��\���d=^
����V��'�"I��L`�Ɂ�h0U	/
�A�/�q�]T������=�g�7�������>�#���e�q�e��5Zٝ��;���>{Jg����
�
�@���K�yOP�`&
?"*�CQI�X1�fc
�!�0�4�<|oj�'����q>flt ���?%�S6$��3֐��C��]��4'J��q�K�K�'Q�A��Bu����[�B��B.�z�Ă[�pq��.L۾�7k��F�y���"���DS�rNE5�1�(�t�Ҭ���
��
G�7��hU*.�y��8��
�����c��
(
-���س)��۔0�k=8nS�Bȴ�&�_���ci�TC��Kp��x(
�
���m,�L��Y���z��Y}B�0
R;_^��H��砆y	̓HM�su4����?R��@jRK�@
)IΎjL�qZg�u-�h�f�)�N���i�dJ
�ikW4��i`��nⴝ�KP�FU�˜
�Z��~���b#&����m�	b���<al�|vp�.sVC��$�VR/t�m�<�.c��u�p�3ծ&��p���������
-�qk[~���:�o>O�����v��k;�-��-&
V��L�Q�?� ���q��	 �f?��|��3���
-��L(E�f��_��7o	q��!�Y��%�LH0Sp�C�!WZ����	�:+�������/��V$���"��� da��"3��&ݽ�
js ��VJ��7!���o����)&f�c�b���v�*�%EH~�+����E���
�G��+�E!�D�>S ����0�E��AP��-�{���-e��|4��`�Ԉ �)�Nj�%I!\:�m�>@��F�
1+
x۰;+
�A�ڞ������׀��j����
��e��g����z1}MJ�������G��p�(��aw�0
-V�o�-,��
���m�t�g�	}rv���I�;h	vm	�}��N(����
�S,ģ^���E�
-!M�P� �G:�V��y�>ۅ�N��'ڋ����o�@��Ƌ�R.ɺ�w��Z@��J�(��b�G�%	y���j qK�W��i�VNJ�
/�<�?�}t8	�<�8f�!��[
���x(ɪb�4g��a1���
���N���U�ލm��f���s��׫���!Rn�͠��뮰s
-
��Q�_Vy\����?�� G[[c�J:���H��d
-�̍\�%��,1ƜU�����x}��?V��n��a�i���):��,�D
����ܘ3At}X�ɡ�El�V�:l�K:�	Ә�r���?��kK}K����hQ�.�ڹN��
p��*�YeގtUv�rW@î�R�Z������kº��(��9t�'EV��l�Q��c�� ���m��Г��4�]
��4���U�xws[U��N���R߹�ک�
o�i.C�֢�6��p�����7�N�\�H��t�#L�0������Z�e�Z���a���kk����@We-ГTd�o[Y
4��qm�\�i�\�?���+���
CÇ4��)�Vg��C.��3�!�
{3�+��~��Yo���2�@
�6�UƇ\i]�Xꙕ��JwUƻx�2�N��T��>��}��t7��)ɯ�:��b_
�������nI;��9
?Tw?_
v�(�K#bX�?�涾=
���E]��r��N���_u�b��z ��%�Ѵ�
.�f+����
-/<��,^���?0�-\���5�<N1@ֳ�[�:��]�E:��ԑ��-L�<{u�ÝY�ϖ�Y���rQ]I�V�<��,=+.��"Qc�����1�O�lC��p��t�
��� ���	��8�?��{�(������2���l���������~ؚ̀��M�kE5��P��e������
 ��o���wE���T�E�ST�S�����ER�_�P�\U�u��׿��~����GI�TS{,�����O�"N�s�����k�A��Yf�͆�YgA[��7���
-endstream
-endobj
-3829 0 obj <<
-/Type /Page
-/Contents 3830 0 R
-/Resources 3828 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3794 0 R
-/Annots [ 3825 0 R 3827 0 R ]
->> endobj
-3825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.403 261.677 224.563 272.581]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3827 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3831 0 obj <<
-/D [3829 0 R /XYZ 89 770.89 null]
->> endobj
-3832 0 obj <<
-/D [3829 0 R /XYZ 90 718.682 null]
->> endobj
-3337 0 obj <<
-/D [3829 0 R /XYZ 90 684.012 null]
->> endobj
-3833 0 obj <<
-/D [3829 0 R /XYZ 90 679.529 null]
->> endobj
-3834 0 obj <<
-/D [3829 0 R /XYZ 90 608.798 null]
->> endobj
-3835 0 obj <<
-/D [3829 0 R /XYZ 90 543.154 null]
->> endobj
-3338 0 obj <<
-/D [3829 0 R /XYZ 90 508.484 null]
->> endobj
-3836 0 obj <<
-/D [3829 0 R /XYZ 90 504 null]
->> endobj
-3837 0 obj <<
-/D [3829 0 R /XYZ 90 433.27 null]
->> endobj
-3838 0 obj <<
-/D [3829 0 R /XYZ 90 367.625 null]
->> endobj
-3339 0 obj <<
-/D [3829 0 R /XYZ 90 332.955 null]
->> endobj
-3839 0 obj <<
-/D [3829 0 R /XYZ 90 328.472 null]
->> endobj
-3840 0 obj <<
-/D [3829 0 R /XYZ 90 234.454 null]
->> endobj
-3841 0 obj <<
-/D [3829 0 R /XYZ 90 144.501 null]
->> endobj
-3340 0 obj <<
-/D [3829 0 R /XYZ 406.869 77.486 null]
->> endobj
-3828 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3849 0 obj <<
-/Length 2988      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���S*��܇c�&$��]�i�D�l%RK�����g.�8u���O���3���f���G?_�p{u�V�H#-��n�Ƒ�		��ѧ���'c<z?&x��������Q��>��2�{�Mˤ�������LJd�������-!-�Ds�t
�Z�u�3�L��/���Ј0Q��S��L6��
-
�4
���2�R7�!]��ģ4����L�Q���O�W����q�H��lu��O
�a��#�y�/�"N\��ǫ^a/Y`E�[s�rZ��	A��F̈!*�����}1(�$�J2�����
�v����,�ƽr�@P�
��;����CB�S��~�~�+P�$
=��%�}m0��Vp
�c*�HǺQʾ�,���~�f��|�Z�/��1�"��i�bֈ��&�@&�c$� �Z��Q�	��R�
}
n  F�-9P��ͽQ]��e���c�������t$5�H�ר�J�0�-)R
�L����i�̱B���̬1�	g~Ϊ�
�� �X
1+�)%�Y�Y�&eϼ�D�� �2�HgZ�r�3� G/�W8
&��~~���3���
O�ƣY�o�
�)j�������1m��"G�o�Մ	nH�pt�
��d!���
|
=J���R���B!:�v��H��;g�UΑ
��H�s|����QXv���7���&�Z���'�L՛>!i���靂�R�r�������D` �s	�
�x��}˃�>��	N9
�Tf���*Ր�z�RHB�"���]M�e}% l6��r�]�0���Ǎ��K!~r�^5At�?e�q�Z��9��[�&;!�D
��Dp\��"�
�Q�����v���W�b��=��^�~��>�wہ���?�x(�,��
s7a�߻U�"�P���n���
�
7�
��{G�����/=n�|�
-w��U������t��T��2��I��\M��B�U��1�jt�Cm�	G��os}��`Mn��U�iٛ��S���^���)VL��v�~m�q��u:ˌ2����q�_ q���0�B>$v�m)�^:p��
~Z���N�Y�x��y��h�^�	�����Y�
�8���zL���lG��R��#�|�Q�8�
$ء��sx�eP�H
Y=�!

�@�-^�Gh�0�����Vҥ�c2*�υ	�p1$w#�	iO&'ˍ{d�f��x���z
x�.���G��1�'e������?��H�۹�±C�J�G��� ��b�қn�ꗪ(�B $&�s��_z�R�U
��"]��Hβ4������[P�i��t��+L@G.W�A7%��� 38EHC��@���
-�:HV��8���y#��	q�aq]�����00�
<򀁻 0�r
x 
y���̓q��

8��1��?B̥�:l�@�A�9 b���á���ʽ�NCҗ�FBP۪u�3H��
�$n^�N?p���
K��Y<�Z ���|��\L���s
�1��
��2K�F�'2�3r4�MKY
��n2�/���4-��HPv�A��.I�]��
)S,j"e-��P��!�!dh��M5����1ǣ�d���
���x��O1G1f���D�Ke��!ձ����ޔ�+�}(
#�=��E_EJ������[�rLZu=.ʾ���Ȍ_R	�&�cχ�y�� |&Yncd�M��[ս�N�M at Z\�!�o��R�dd��?�QC�
'�b���1S�-_+ۀ�\M����}^b��E^�o!
���-/Q>��]Z�cnڝg��o&�ƙ��ԙ�r�39�0��۷ɋ��$����l~y�R�
-9�������$�5h�	�H�j�ق���1�91�_��o
ˆ}��n*ӃHf��5ԺL�d�yU�몘�Kw����K���n�suSk�{��YճN���EP�a[I:�f��諦Z=P�y�V`R�T�օSY��j����uY|�V��í�8F��,L&����D�:# I�:��aYev#��h�����k�[�*<$���!	�I�!	�P�<q@qz�!	~�!	k��o�ʜ= 'yc�N �
-z�tB}*t��6�Y�� �
�6��N}
-��o<�xBj��_�
'D���`j�G
�+^���yR�>I��>�)�bd��Ӑ�pg�h�y.Y
Vez7���X^���m՝���d�-4��� ����ٲ=�s�9T@<D����Ҷ���,��8�5�}N�x�fץ�k�]nK\f ]M���v�qz2z.�H�_)�?ssX����0Ё�C���h��Rb�����cf�Y��w�c�:>zfMì��+�U
x�>f6{��>�Y�sVws��l2?�1{��[P�
i_S|Y��j�>��f�Q"��M�:�b�%���"��^��S�ǃ�چ\i]
w�zay
��Py
��<~��V�}Y�,�Fh�d,OE�
�b���0��;x:(@/��[uS�� e'fT��yS���u�I؟����q��
Ԧ&�}��i'�,����ݷ����C1ߠ��{�Z:�5:�DK�� I�ѵƠ�,�!ݞU��5�,�k��
����k���[G�n-�*�z,��!;_���=�*���@
6򀃥���'�'_�O�Y���
XA�m$p���M�B�$���z]m�����`w�%��2�Uw��9-m�t�$�1;���7���&������~9��~��m9=K�i��%�s�#~�n�5��j�@ѽ
-�
�5��^|�����J_N���걉
E��0`�3�fH�]	��ug)F|w,�t�,�~=K��&�d�I����H��rs�Bc�9
{ E^���
LSw�
�]w�[���7
-%.;��H���͹Y^wX�Jw?���wޙo��/�,G}2#�����5�ʝ�"����cZ�1�慨���r�
-��kz��������~���D��!h��ծӸ(��������y��Eu��	�R ��^ ���Y0QV���{����\��bяxV�
JL��
-endstream
-endobj
-3848 0 obj <<
-/Type /Page
-/Contents 3849 0 R
-/Resources 3847 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3794 0 R
-/Annots [ 3826 0 R 3842 0 R 3843 0 R 3844 0 R 3846 0 R ]
->> endobj
-3826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.245 649.984 224.405 660.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-3842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 222.384 174.682 229.91]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.874 222.384 241.631 229.91]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8101d965bc32e4ab1df6aa445730769b) >>
->> endobj
-3844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.796 115.968 258.368 123.494]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3846 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3850 0 obj <<
-/D [3848 0 R /XYZ 89 770.89 null]
->> endobj
-3851 0 obj <<
-/D [3848 0 R /XYZ 90 721.073 null]
->> endobj
-3852 0 obj <<
-/D [3848 0 R /XYZ 90 622.138 null]
->> endobj
-3853 0 obj <<
-/D [3848 0 R /XYZ 90 519.831 null]
->> endobj
-3341 0 obj <<
-/D [3848 0 R /XYZ 406.869 443.228 null]
->> endobj
-3854 0 obj <<
-/D [3848 0 R /XYZ 90 436.588 null]
->> endobj
-3855 0 obj <<
-/D [3848 0 R /XYZ 90 356.059 null]
->> endobj
-3856 0 obj <<
-/D [3848 0 R /XYZ 90 302.37 null]
->> endobj
-3847 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3863 0 obj <<
-/Length 2305      
-/Filter /FlateDecode
->>
-stream
-x��[[s�F~���)+UE�_\[[��LR��&��6/��
��&+�h&��9�
���%��ü�����}�G���={5?;�F�� #���w����		�n��B����w�#�)w�����a~i���~F��� ��������8����E1���n�2��q]��t�k]�
������>ھ�@D7�B"XF�D�W�:�N�Fx�~&1�IY�Mu�^���,p=�Zb_�N����t�de�gW��*�#�l�G�c-���kG��YY�=>�b��kP����Hܙ���ͨBB+oZcB9�Q�'�C�O��ߒ�ʟ_?�c�Z-
��~k�3�
���[�jp����P�i;���
���򭷔���>m]��&�禑#{�D1�5cb�؉-�j]de�P�ax��]�(�
��"&t3*����
�8�
p?�ʳ�u��~<
��p�� �_'7�2)��d��
�RL���>���h6]�0�6�Y�u:��!��3�!V*������͓J!I[k��G�R�
`�:��Vw�'�
�\!����W�@bӲ��S�'yڄS���
�� [...]
��1y\��m���1���:���̎��”wf
-QN6c֗���vL���} B���L�oÕ�9gN�u�a�

�$Ң-��5NAන��t�)T��L�3WW76ڬe�:d�(G��0>N�
s�VB��
��5Hk
G+A6y		
P*��L�P���}�ӻ����
��j1Hԃ:B_V"�	I6tH*��S�u0�%�s��'	)�T&���"��8U�0�%�F�@�y�Ú�-p'w�6׽�c�X4]�;�1�E�	(c��v��$H��G
��%�f����\h(�B–7VW�7�$+[f�$�!i�I�a`~�OƗ�S
k���d[�}�#�]�J�h�It7��B(���yRV� 8��]��W��LM�א*�p�S
���P0�n[�G���,݂�`�:(�)��Y
v{:�gI����0�ֈ8��Z�+;��`��|
`��@w�.f��SbuwZ�H��qS��Å
~p% �����4�S�)�Ĥ�{��Ė �b�R�.})�.��G	�Z�}��r4��[
�E�#��j�`�C�m�rӡ�
3
j�LNJ��tt1=FAR�U�t�k[�c�uk-�Y�L�i���T��Ծ�b��N
�_%�1L�,��b5�]�qj�d5������È@meW{�Fdך%#���%:�ƴ���FbD����.#"�E@�-�E'*�K�e6�(�Z8���M�V$�c���%>�'1 ��N� ����d���
g�
��K�,�#�˒���I�����ƒF��!I[�6$i��}
)�3 I��$)hlP�
	"&E;�}�BqY� ��efw�F�N�����`����Hw�:�AV���(�|(k3��E�Y��+W�j"ٷ� Y�0ȁL��0ڝ� QQ6n�8E�^�pq����
5f�6���q���D�n�
@��\�uD��U�e �5�Pҫ]��l[�5�r�!
!�1@� �R��4��n�ڴ�4��4��
DqSo0zo����3.�Nf(
���?�Ve��=^�t��R��D
��97��G�
--&�T��L:<�+�r�ـ+�f4 ��t"��vv1����53�g㴡�q��@b��r| X�f������3j'A"���� �n�%����L�]ԁ�:�yG�)k��~b�hppLK<�eꑋ恥�V��z����h�l���b����@�u�l�N!ۄ�7-O��v�eY�#�aק ��pO���(�eׂ��'a-Ő��eEqU�Xl�
� �5�k)���e����OB��S�x�2^,��^X|��ҟ�
Zn��ໟ"��=�R�����>�3&HmE^
�,��Q��
�tp�C3&l�	�$��hPp<+ �y$

��


<v�v&��K �R�SD������e���Et��~��wx&ʕj���sw�y��p��%�^� l#n�f�Mk�y��m?z �;�zL��������eR�c*솽���8[�����zRl�����n���ۃ�e�,"{��ߪ���

}GB��顪V�����2��D���y�}����]^xe�yѮ��ť�����Oyҗ_
-endstream
-endobj
-3862 0 obj <<
-/Type /Page
-/Contents 3863 0 R
-/Resources 3861 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3794 0 R
-/Annots [ 3845 0 R 3857 0 R 3858 0 R 3859 0 R 3860 0 R ]
->> endobj
-3845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.796 709.04 258.368 716.566]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-3857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 612.245 212.124 623.149]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-3858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 438.719 210.103 449.623]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-3859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 335.311 485.603 347.829]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3860 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3864 0 obj <<
-/D [3862 0 R /XYZ 89 770.89 null]
->> endobj
-3342 0 obj <<
-/D [3862 0 R /XYZ 227.473 671.568 null]
->> endobj
-3865 0 obj <<
-/D [3862 0 R /XYZ 90 664.928 null]
->> endobj
-3866 0 obj <<
-/D [3862 0 R /XYZ 90 586.401 null]
->> endobj
-3867 0 obj <<
-/D [3862 0 R /XYZ 90 532.712 null]
->> endobj
-3343 0 obj <<
-/D [3862 0 R /XYZ 90 498.042 null]
->> endobj
-3868 0 obj <<
-/D [3862 0 R /XYZ 90 493.559 null]
->> endobj
-3869 0 obj <<
-/D [3862 0 R /XYZ 90 412.875 null]
->> endobj
-3870 0 obj <<
-/D [3862 0 R /XYZ 90 359.186 null]
->> endobj
-3344 0 obj <<
-/D [3862 0 R /XYZ 90 312.561 null]
->> endobj
-3871 0 obj <<
-/D [3862 0 R /XYZ 90 308.078 null]
->> endobj
-3872 0 obj <<
-/D [3862 0 R /XYZ 90 235.215 null]
->> endobj
-3345 0 obj <<
-/D [3862 0 R /XYZ 90 200.545 null]
->> endobj
-3873 0 obj <<
-/D [3862 0 R /XYZ 90 196.062 null]
->> endobj
-3874 0 obj <<
-/D [3862 0 R /XYZ 90 123.199 null]
->> endobj
-3346 0 obj <<
-/D [3862 0 R /XYZ 90 81.969 null]
->> endobj
-3875 0 obj <<
-/D [3862 0 R /XYZ 90 77.486 null]
->> endobj
-3861 0 obj <<
-/Font << /F73 552 0 R /F75 554 0 R /F60 532 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3881 0 obj <<
-/Length 2750      
-/Filter /FlateDecode
->>
-stream
-x��[[o�8~ϯ�Ӯ
��)f/�v�:�t��}��ˎ����r���=$u�,�I�L�A�,���9���}���2���3l.������k����2�\�k$$|�&#>����ݔ�I����wS�'���6������:�����/���F�x�����ׄ��͑�!Lj������
3Q^�p�#C#�Du�ߏI�qm���i:�כUT�n�x�SN���gbB�62�^]�}:# ĹC 7�q0����
��loZ�2�\���u�=?[��
߿� 0�v/b����E���J!I�
�d+�x}Cq���hm
ֺן��X��C=���b���:�V=^�`k��IA"�
2�ר�*c.��
ܬ��θKW�..v�
��^�� "� �	~((ҡ�#a�bH`fE�J��l��{��{�PcLK1E�KZH�d���
K	ޓ���H�z�d�3'S�`>ʜ
CPS�xJ��KtS at .�p�_,�tƅ��d��	i9��Rs b9G!�G�W��<����?UT�Y�}��PV7����Y��!�Ƶ"�t���G�XU�8-�Rg

p6d
��
݃o��zR���¥��t�n/��S�uKM�ӰQ�
59@��6ٺ{<ŨB��7r��5W�PҎӤ�4.�n�X�!��
��ⓤ0�a��K�����z�$�5&��$�S=��"��G
Vْ��.[JS3X��s��{f�1��I��.�նo:F!�t{:ӓ��s~?��5LkuF9K'�՗�xS$�پ��O�����/A����X)l���疉�W�$�!�8(�ƗJ�t%���v�pD�ǥ�<-!�{X�@23#E�~ʭͶ�_\$���]�J�WQ>ej�ܭ�p�5�
C�5�s<;�)_PZ}CM$9d��;X#�|;/o�lJ��s�B;�v
�@�1ʀl���2 Q�ԡr".���%P�'�4[ȦY��d�MT$׫
^+����br8{@"'d܌<E�Q�/B "����w����~��r:؋�!��
-�2�Q������E’TP
�M$�cLk�%�ʟv�jPj�#�L
�]���i�� �E�(�JZ{����j�j�(+K�j�Y�g��(� Ǹ�V�
�`��K���A4�d�i�*�dS=L��4%�e_��j���%o1�K�b.{y��6טsJ'(��h'��`'�z��(�&.3K\�x�{C\�C����
��3��
��OPeJE$��B6
�-�gy�=���0FAa$=�LK[8�o�G�--����E:c�1-��K��'R�����R����`
-���Q����0�_0��	����
g��Y"e6�3V�Y�0t
��ҴY�;�淲�K����iܙ�#S*������{w���0PTsl��jo���t�Th�Y%i�.�wx��rO�<��l���&�;��R;}e���-�a4��N�nl�tƤ�$�븸���:�?�<ޖBn��-.n�xa2ҏ�$��߁	��M�#,*��%8����NVI�w;��>�<2c�!v��Q�ʸC
� ;#
�@�U>W��ȕ�C\�`y�+�璉O�d�w&	����ɗ�#|9�rJ͗��b1U ���>c%� @B�4�
G�4�� 
�|(�����x��<�dJ���U���?�K�ڋ��4dc�{���r��J1|{�
�+c/�2l�������ۂ�(�Ў�2
-�D`2�1 �<P���:-E`-
����D�� Pv�D$� �f�
�(�D�Bd��hDaLK+��1��D���;Q�D��5�B�k���<E��C
-��k���g
_��c����}�`�!��v�KM!A��%X��nk�x�GBl�i)V��(oZ!�|����DB�Q&��!�'�������@C��C ���ʠb�q�	V��}T�j�$_����Og���:����x��9x
-�.�,���
-��僽�p�4��S��r�9)n�j��&�GP-?z�%�Y�=Ȫ�jK�E_��Ԉ:�w!��&XE�7�(0h@�i�� 

b��L���|ȷ`�q�)�
��~*ţ@�;�s ���)_����
2-�&���Sc���S at 6�	Hر@���V �c�A�g�d�&[e�{c�>�?}A�̈Ta8j�$�('�����sq&���j ��C6PC����-�����a


-
DH{�L���ʬ��'m�r%�d�_�d
M�&�W��BYP�����&{��?�?3Q�D&M{� 
�ۅwf1�
-K<��ϭ���.C��2��]��IG�ի/�G��Y��)
-�V
���Գ�!6����٬�1����2���5X�S֐)c����]�"��b{qQ;�@8}��i�s
-1�=y
���=�<N�u�FE�� ��
��1��z
X
�޾�ҾW6�@��-��������n��3��d�_0�	�6��t���;�惜�(�g�9��$�2�6�E��6Iq���;S���ףڽ7j-vi	���:�l,�2_�	^�񡆠����ޗ��Z�%��3��(�B��K?UY(�;x e�y-�
\����bM��Mi�
��R
y`�j��ⳝ��1 at y��`��)�])y	,��

����޽u�b�������;{��&A�o��Վ%�&�9��v�>���)������uQ���p���ۢ�\��_��8]" ��)޲C�+�����,�y%
�-�GU��q&�&)i�	p�'@d�W�w���Ճ����5
^f����*��@
-endstream
-endobj
-3880 0 obj <<
-/Type /Page
-/Contents 3881 0 R
-/Resources 3879 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3891 0 R
-/Annots [ 3876 0 R 3877 0 R 3878 0 R ]
->> endobj
-3876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.275 242.274 293.971 253.178]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-3877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.332 105.295 235.598 116.198]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-3878 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3882 0 obj <<
-/D [3880 0 R /XYZ 89 770.89 null]
->> endobj
-3883 0 obj <<
-/D [3880 0 R /XYZ 90 645.919 null]
->> endobj
-3347 0 obj <<
-/D [3880 0 R /XYZ 90 611.249 null]
->> endobj
-3884 0 obj <<
-/D [3880 0 R /XYZ 90 606.766 null]
->> endobj
-3885 0 obj <<
-/D [3880 0 R /XYZ 90 523.95 null]
->> endobj
-3348 0 obj <<
-/D [3880 0 R /XYZ 90 411.457 null]
->> endobj
-3886 0 obj <<
-/D [3880 0 R /XYZ 90 406.973 null]
->> endobj
-3887 0 obj <<
-/D [3880 0 R /XYZ 90 336.267 null]
->> endobj
-3431 0 obj <<
-/D [3880 0 R /XYZ 90 301.597 null]
->> endobj
-3888 0 obj <<
-/D [3880 0 R /XYZ 90 297.114 null]
->> endobj
-3889 0 obj <<
-/D [3880 0 R /XYZ 90 212.296 null]
->> endobj
-3432 0 obj <<
-/D [3880 0 R /XYZ 90 176.573 null]
->> endobj
-3890 0 obj <<
-/D [3880 0 R /XYZ 90 172.09 null]
->> endobj
-3879 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3898 0 obj <<
-/Length 2645      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_��V��`����8q������pW��+J��v�_��t��>�I	
�|����cD�o����z�QLb�ut��422&J��4z7b����.�k<U^���n^�p��ݻzys���-1/@c���ջ�i4���"JDl��y$���S���W�ҥ�$\����2[
mL(��a���k�f��(Y%�HWc�F�R�-�������ޖe���^�4	�֑�Ib��Hǚ(��I�hFb�6�����II
��PJh��z�OV~�w-�
/�Cww�iMbn�z����+:z?�
- Ȓ���J��f����T�N
���P���J:fj��r����"�ײu5�
�tJ����&��wBĉtH�
.ѣ�J�u�D;��a�n�cN�&
�˔	B��L��y���b��?'��8X�m�nX�OŇ���=�
C ����,#�a�J
�4_̳���c�u�>adu�i��U�Sb�l�v#"�n at l�-�B
C�d~'^�z�.
��r��A
̬�^�˲˞�&���
G
%����نT�O�)�=֑X^g�p$I/c�F���qBw5gD���ͺ�^_g�X"�'O��%�0�GD��{N%�T
i'�|���B lk���^8�4&(�{v��V
��P�(��g
�v�yPZ"��k󍀶1	
��c]��7��b�rlܕl�F��4�/#���*oZ#��zP�O�.���Y=AL�,#�m��l}x�U�
�f���������U�<�T��۟�/�ˤȚ±���6�X�멪2xk�oo�.˄EQ��*���5�}{��&�`�J�Uc%���D���
-N�xz
�D����
-��m�}%�3�0J�����))R�ތuab�n}�~DO8*I�
(>.�
�+����& PB�i��= �Q޸�
݄@"�t�ú��]�=�h�Pg$O��@�'S������ͮl���ђ��Mx�?��ØAc�F�
i�Ȫ��#A�%V4k�f�ණyr��u ����t�Jn_gw�d��/
-~#X?�\_����Y�
�bD�o'�03Md
K��⢷����CU-nm
�Ę�ПǗ�
�H`\Nֵ��o�j
�X�2�
2�
�J�&���u������6
���[/տ�1o�j�Mw����
Dƚ���G����{ԓE`~���5��:��du����ղm�Ǡ�����������2G�8<?�b��"R����
M�B�������i��"B�&��(`�nJC}'ʘ#�n���p!BFo�O!4X�y��==d 	٦r�z-�F��0�ؠT8a�b
�(y(WN��b�d/�_R/`+�n���n�V�����۫�]��F����A���{L{�V+��V|p
��a�p�Z������.ϓ�2���
��=?����5 5
 ��d#�������v�����λ��.�S֌�ez�9��_�����|�}
�O�/�e������	��P	��L�K+�br@�ap�eG-
��A	yi��R�D�_�G������Gȟo�n�@$��Z�ǜ��Ћ�P�@�vУ]~��8rp�(�[W	�،��j�}�u���8��\�����>d���tIf�>���r��~��"m�y��#d�b�"Z9��%�l�z���Om�؀6nyh�����}��Nj�/^���YQ���fy}�?���rA�Hw
����3wk7������-Nu��%��K&e��<���Eʁ|�e�����
���Ub,�`<�v�<����=;�<0���khi�p��Ĭv
�����]a {��Ӽ�e7�W�+�W��ֹ�HI���f�鱯���W|I���}�� 5U/���C,����@�:�DN͠��"�)Y�xa������l����R��X�Q
K7�d��C
NG�0�ȍ
�St�-:
-E�K�
�fp������z�o�Y�A����P�S(?K�c)?�p����dK4W��K�N���u
�6kAx`vR�HY7S�tụjb�W�-��2@�cv�X)�
��~�J�"�	SFL�y�e��u�d�r�c�^bZfX�
-k��4��`"�(�܃W�����6[Y�\��E
b��B��!����-��6
������&�h�~Q"�
��i���
�졠�w� �hv�JEjT<��[Ģ��
h�!q�%q� �h	�� ��Id�؝?D-"+����!j�F1VD0~���&����۫�m3��c
p��9��Ʌ�'�ҽ�2�

\b��q`O3>(E��KlO�(/�#����,���n]d�sq$�r�ջa��
y�sp�
xBë�dž9&+��dž/T&���2��������poֆ<�9�D+�S9�a�]
eg
�P�0���|�c���	i�Чb�l����
�Z���bt8D
K�
/��7����/���;�F�`T�pV�Lq���➕
�����r`�\��
� �j6l�Df��F��pq�_{' ʳ?x��C�1����^ެ��.�x5��
k�M o�
-�����j��f��z�~���M����u���X�Q�j9ɟ�'��1Q剾t�"������]�Mkr����F��J at v�Q����׬(��/^�=?�����ݶ����	�=�P;�|��
�rw  ):uMw�� ���
-endstream
-endobj
-3897 0 obj <<
-/Type /Page
-/Contents 3898 0 R
-/Resources 3896 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3891 0 R
-/Annots [ 3892 0 R 3893 0 R 3895 0 R ]
->> endobj
-3892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.953 524.514 250.388 535.418]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-3893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.151 300.766 244.345 311.67]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-3895 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3899 0 obj <<
-/D [3897 0 R /XYZ 89 770.89 null]
->> endobj
-3900 0 obj <<
-/D [3897 0 R /XYZ 90 720.814 null]
->> endobj
-3901 0 obj <<
-/D [3897 0 R /XYZ 90 642.418 null]
->> endobj
-3433 0 obj <<
-/D [3897 0 R /XYZ 90 595.792 null]
->> endobj
-3902 0 obj <<
-/D [3897 0 R /XYZ 90 591.309 null]
->> endobj
-3903 0 obj <<
-/D [3897 0 R /XYZ 90 496.668 null]
->> endobj
-3904 0 obj <<
-/D [3897 0 R /XYZ 90 418.67 null]
->> endobj
-3434 0 obj <<
-/D [3897 0 R /XYZ 90 372.045 null]
->> endobj
-3905 0 obj <<
-/D [3897 0 R /XYZ 90 367.562 null]
->> endobj
-3906 0 obj <<
-/D [3897 0 R /XYZ 90 272.921 null]
->> endobj
-3907 0 obj <<
-/D [3897 0 R /XYZ 90 194.524 null]
->> endobj
-3435 0 obj <<
-/D [3897 0 R /XYZ 90 81.969 null]
->> endobj
-3908 0 obj <<
-/D [3897 0 R /XYZ 90 77.486 null]
->> endobj
-3896 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3914 0 obj <<
-/Length 2958      
-/Filter /FlateDecode
->>
-stream
-x��\[o#�~���S++�wr��@�\�4�Y�/I`��cK�%9#�n6���s��ѕi�@
�%�����s.%\��FԽ|uE�[�~v{u����d�����(�##3�4�z}7f��ɔQJǯ'���r�߽�p:^=�e~���m��on>����,)&?�~}�%c=�,��dL+��K���e��6B##L�f�_Q��s�^O�\Q���X�<���m�X�f���
)Ԙq�h^}q{��:b�
�;�_\}�
=��aFe>T�#�^�Go��uE;W��о�(֚�P�m�i��U����چ�.�||)���	J���63��
�tF��O�
��1�1�4
/�6DR�O�P��fS�Yb
Ma�L�a
�ɲ�����d�0Q��������.&X�I&F:ˈPr0��f-4v��2E2�U�X#f��=�|Y�2��AU
-Μ3�k%Z��E>1co�I���SE#�-�
���+/����vGMuF:��w��ˉ��Wq Yɛ����jy������9F�����KY<�?.^E6Z ��V���r���wJ�� ����˻/~z�1c��L
V n���!&.`��ń��#�#�$	D�VE���y��D�����5 at Bv82C�)^G�2�o�77��B�BBT�-s!Me�
�x.��
-�q�i���C�\-��|�*
����эV�,eL|�Z�܌��R+b�Mq�,�4���-��Ks�^�����k"��d
a��_�P{Z�c���f���q�g
*"2csl�T��|�����N�ͬ�L���b�z��Wܽ=�?;����f�(��Kq��"����6�C_�T��ۯ�F�U
��	W�:�V?-�X��	��c.�QՅ*�]��C�$�;w��DY;D�:M��S�	V��V�	�j|][�G�[��$R�P,\\��3����JU����|�

�ϲ%�4�P��;�[�Y�Am�K~�+g[;�0�sF, 8�G�}@>H����1�Jx��k.ꁉ���꯵? ���
��o?F�ȸA���X��;
Z���	�-ן2���܅
�I��?�%r��K>�x
R�~�f�ݷ�K��vƪ)D�r�
-�vIk��/K�0�]ᜱ|�iAG��d��$.f�2"{�w�XLs|x�
!�5\��P������ƿ������C��{��D��!�zmQ��$�
���[[�˵+o��
�-���P�5v�!��Hj���	z$ZE��i�(�B�U��M
-3�`�8s���d ��(z
T�qxgA��'y*VRS�`1�0�4a
L���q
-gM]��9�A�2a�P�
�Be�n����Xh*�O�=�m7P5可��C���c� ��I#Tj�
u��m�QSU�
-i�h2���� �.�'��<-�‚�W����E{�O��)F�����
"T���D5=�/~�/^�!r �="sU,#\��3��=�&�iV)-b�>�,�%DH��m�t�둬>g�pԣ5��=�wk�	Eu�%�i�777��D"�D��p�W���y�F�NQ�Q�TS��mU��U�i��a���M
5���+����(��珱V�%�k]�w
#�[��t�;~.��b���d>a�/8#5mK���5Ɉ�m��E��&��v��K�,!3�"s��E©����˭��
e���bU��+�A.nhcH&Z���Q�1����
��j�����V:�i�
�qb�t�
1�%��q9�M��M�^1�:�^�����oj�[��j=�����Зħ�P*-2�4:_B��M*����M��m�ڠM
-K2�d��Hy�-�f�p��I�mS���єB<�m�>a$E�C#)�E���z`,G�>m,�
��M��y��3d.	U��&�Q{����r����A���sPAKĥ�0Gh90�ѽ��e�N�`��xֳ
�6>�Q8�lr�~�㸶���xU�g9naX�y:�g9?�=\��8
I$wc�g�������E� #
 H�H
-k]�ӹ]�
-
-��(8�
;j��	$��޲����U�pjq� ��ّu�ō��|�W����RV��)V5���v&M+1K��W�T���P3�B9�͠@�#'(I:=�+3��.�O�T<����$P�p�t"�55��A.'��8��A�qxk�F1�S�%5E�cZ�D�G!n�D��
D�er�Qҗ����g>_���I�mJ@�M�>3�d�63w�!�62~���qS�&��@�tl��G��e�4�n2s#��J�dN�g�c�R��1+k1z�[�\��1Vq
�5i
��ݳ}���5kÎ���*�b�;Y��%�Ѻ����u>#d(���/ov�v
-�ePO
�!l�\�r_����g����{�@=��1B��ӎ�.�y���ݠ�9�
*������P9��o�P
)�e��Ppnz�g$U[mTK��+H�M��WpM���

J��:��n�}ٵ��+
-D��t�+pʉ�"�}GJKyҍ��
���,@\5xgA��΂�:�� �>4T��@�a*ѵ�
&����][P��]Yc�%w*Huܵ� 2ݭ
�
{kAvĭ���
#��n-4��J}��i���b�p�}*q
i>&��~8�>�����T0.��_�ώ�
5@��Dr�U��;܈�7��=�
bD;]}1>�{
-��a7 �
�J���=)Ŷ%m�3����s�I�c_����gK8���h�w�OEJj�R������PK2�'_R�L�(L�����(��� <@Q�����+�M8�I�'�
ev��ˤ�"�/�o�n���B)Ky)�l��kx
�#^�c�K�fK�+�e�h�!*�[����7�Ϳ�E��	ʯ:��g�|��Y�+�߻=*�u{"��q�2�L��7ES�y��;j�����;Q��գ9u�>�l^n��߾{Z�'r�Z��==�cym_���bU�
-͗�p�w���B�2�5o,c����^�迯�l~Xp���}�������NX
-endstream
-endobj
-3913 0 obj <<
-/Type /Page
-/Contents 3914 0 R
-/Resources 3912 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3891 0 R
-/Annots [ 3894 0 R 3909 0 R 3910 0 R 3911 0 R ]
->> endobj
-3894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.612 648.705 384.189 661.623]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.679 401.529 395.172 414.009]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.382 164.149 394.782 177.067]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3911 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3915 0 obj <<
-/D [3913 0 R /XYZ 89 770.89 null]
->> endobj
-3916 0 obj <<
-/D [3913 0 R /XYZ 90 622.138 null]
->> endobj
-3917 0 obj <<
-/D [3913 0 R /XYZ 90 531.388 null]
->> endobj
-3436 0 obj <<
-/D [3913 0 R /XYZ 90 472.808 null]
->> endobj
-3918 0 obj <<
-/D [3913 0 R /XYZ 90 468.325 null]
->> endobj
-3919 0 obj <<
-/D [3913 0 R /XYZ 90 373.683 null]
->> endobj
-3920 0 obj <<
-/D [3913 0 R /XYZ 90 295.287 null]
->> endobj
-3437 0 obj <<
-/D [3913 0 R /XYZ 90 248.662 null]
->> endobj
-3921 0 obj <<
-/D [3913 0 R /XYZ 90 244.179 null]
->> endobj
-3922 0 obj <<
-/D [3913 0 R /XYZ 90 137.582 null]
->> endobj
-3912 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3929 0 obj <<
-/Length 3283      
-/Filter /FlateDecode
->>
-stream
-x��\Ys#�~ׯ�SBV-��%qUlo\v
g�U��T�8�X�Ԯ׿>��0��9�r��$rlt7}}���q@_]}~s��/F

q������с��(�o��C���ǛoB[œƯ��/���͛�n��wWon�~�bxE,P�������`���
(�>�A�����qEs^ʿ�+����9͊C��r`� ���Λ���v�\lC;$w��3�	v���(n�rdw%����4�n�
%R�}t�@(b��)Y���I���F2<g�ph9'��5*qq���'T��3xg��^_�#I��'ϳ��d=f��2�۸^]����"�^�80 ޔTI�6�$�u3��Xq]Л��r����b4V�
g^:l0U���Dp[�i�X�g��v��c�9
#�;ۀ���_2L&��“و
��ҔP#��g?��&���A��4�Ჾ�JaŘS*�$#Ζc�O�����Yd:�-l���ٌ��K>3F���;[�/��vv���	��� ׮h�����'��3b*y{���6ҝ��%w���EC���P�!F�����]@���K�Xgϛ����CMS�I�e�]�ҭ��չ�UIv�
�sf�[>���VaF�/�N��ԓ��I��/��?Ty�f�d
L�"��1����|�fq�K�WW[��qDB
�"�ۏ�l1��}�7-!�e���� �3���~��p9˽A�#�(YZ�������������ǧl���~;�[O���?�����d�&%
.���3�M�1w�X�S���Ce� u}�8�a��ֈJ�����|�ag#ā��ޤ�+md��S�1HQ�r� g���Ĝ!R ��03����̫u6�OF�Atlp��
����{$Sۖ��������"��o����@e���-X4��W�����/-��i���,1����s�t�.��6�F��>�U
c!��]��u�KB�;G/
:`�t�M�v0p6�
-4�%o�����p7
-{�c����?��DžT
�˖h�^HuD8�™��
����
�7�
P�&���%5a��l�yXg�Uv��,@
QOY�O�׏�^�����a���gx�����2][_4��U�f���cKb_`s�A
ۜC$Y$<��١�����(2�
��c�Y�T���(E��eTx��~x��m�Z$ΥU$�DR�4��T
�)#
��`�?gH��������+�E��j��L��5��R1	�M��=�2�Fޅ�"�!BNֈ��
;�
��
���
-5���3X�8>��b(G�\k�?��=%�RHJ8.$Jz��d�t+�i����2���
>n�����=l�'_8E۝M󷩯�<bj�8cġ<�i�.�{�AR"A�ў���	qV0Տ=	F,•B��qFO����8hV���nVuvJ�:���r6��K
�l?�S��o��X�X���||�ca
-��&�\�G������d���ɽ���t/?���4��)��r�(�
�����o�`�>���f�fq9�~��Yұ
��z�9�8��,5��r�u�{��h87-�݂���9�
g�D�&Lk9NdUU^VHI��i���jݦ�Y�.[-�:Gov�����pX��B�����f�L�����x�pa�����I,m���r�޷�{�gG���z�Ev�Pd���w.�y��*=�W¢�*~����w˗Ŵ��j9
w )<��uP�"�!
-'�0p��J��V�13�ⴑ�̍����}������T�9�%�M��li
-��d5��1�t�ָ��� B6,%�'7,E F�7,U�3��v��'^�����d�>���EJۥ
�	wH=c�=R�R�?AMR
��K�Ң$��٣~�'Y�\�$��>�`Ex&��jҕ�b��=u?+ҥ�[�mŜ9��d^�mŬN�ݮ'�����\���
-%��M�kJ
�=�~�=`Wg�lq߾=ᯙh��ܲ��싣��J�����v���|Uo
{�R���~ 8s<.��!�1� ��@��x?��Q*���9(��Pv%���\�(�����,xP �b(��/�n��x݁�z���Z�}�_ʺ7
|W�4ѕ�ns�k�ኬi
�hzd58�#z��25��)�
T��"�Cv�hI
�c�³)T��\�`�0ë��8���&�(kAO3��&)������Qլuy���3v0F�eT�a7�)�e�� �����^�%�6�cNaʠ2)��H�4�
~#ƀ�-"Pk�g�w��IA^�S��e��Xgƒ�L�z���ڋL�({���+r���e5E-V�v�����9Y8�?
Ӗ<_�NK�$���;�h[����ύ]l�Bqk��ǝ���
��:dc���jc	?��-^��:O��	BjSϱ���CP�-
��gvg��m$���;�hv�{��t��)��1�?�R��_N4���i7�:?G���j�)M�l9�
$��݉&�7�hrH��7<[,Η�����Vk�t��.���j�Ds���t��ϗ�P��h�r�P|�+'�8?<�x >։!5��#e�hX�bg��DziZ��h=��LB�$X“��§)
-j��|y�֓��|W0/�Qh��k�m�� �3�<��i`$�8�b������B�
-
-|��C�βղG0�F�0�9�@����
�,�Ȇ�灑��	�;�,H
-�����#�:����
�&�y�!����L�v�~Au%������y�v�5��ڸ��R$���f��(��q�f��2
R��l��Di��l�QQ�O���hh
:��(��hBp������N�S��9�}4�Q��>��go�N'�)j�zu��<��2�Ӻ��������2I�U��Փ��
���0s��&3��W1�
p�:�' ��:!sp�U����6�	H�8tIFW�YZ�V���׿��J�/5&�pI
�����_��
X�
RS�^ZW
c�?�䨸
p���㩦�{p�J�;pp��LfS��\��V���jY��=Lo�޹$��G���v�U��E�oH$�~=x�i��v�"���!RdR��V����w������Y�
�<T�+X����^�+���
�>r���G��\����	�
�!L��ל
u�1��	 c
��@\�c��
qUp3�W����:�� ��||"p9����hN̡�YU�(9�5�����S8/����7���_����%�U�Ơ7�- � ��(d�,
0�Ǥ=�o�����ֿ)5�k¿M/E��{��>Nf�d��v�X 5�n �����^T�G!��s��v��~����q�-
	j�]�\��9BMi_EE<_��l����Rv��� �
-endstream
-endobj
-3928 0 obj <<
-/Type /Page
-/Contents 3929 0 R
-/Resources 3927 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3891 0 R
-/Annots [ 3923 0 R 3924 0 R 3925 0 R 3926 0 R ]
->> endobj
-3923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.723 588.823 400.608 601.302]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-3924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 351.443 422.924 366.159]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-3925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 90.209 425.662 104.925]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-3926 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3930 0 obj <<
-/D [3928 0 R /XYZ 89 770.89 null]
->> endobj
-3931 0 obj <<
-/D [3928 0 R /XYZ 90 718.682 null]
->> endobj
-3438 0 obj <<
-/D [3928 0 R /XYZ 90 660.102 null]
->> endobj
-3932 0 obj <<
-/D [3928 0 R /XYZ 90 655.618 null]
->> endobj
-3933 0 obj <<
-/D [3928 0 R /XYZ 90 560.977 null]
->> endobj
-3934 0 obj <<
-/D [3928 0 R /XYZ 90 482.581 null]
->> endobj
-3439 0 obj <<
-/D [3928 0 R /XYZ 90 435.956 null]
->> endobj
-3935 0 obj <<
-/D [3928 0 R /XYZ 90 431.472 null]
->> endobj
-3936 0 obj <<
-/D [3928 0 R /XYZ 90 321.833 null]
->> endobj
-3937 0 obj <<
-/D [3928 0 R /XYZ 90 219.128 null]
->> endobj
-3440 0 obj <<
-/D [3928 0 R /XYZ 90 174.722 null]
->> endobj
-3938 0 obj <<
-/D [3928 0 R /XYZ 90 170.238 null]
->> endobj
-3927 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3946 0 obj <<
-/Length 3492      
-/Filter /FlateDecode
->>
-stream
-x��[ݓ��߿�O�=s���a�f&ߓ4���n������5�
��l���#	
��zm��C� ���~�S"�<N��77��ݼ�Z�ID"����a-""ܭ&�4 b6�AL��h0��m|�nƂi�y^'�2��>]�q�|{������q��~����הv��H
�0������Fb��p��e��ӗ(|���j6g2 b�&�b׉}�C�3N�l	���rJG�7_���rC�L0�V
��p���|�9����w��p�̓鴝�ẙ����M�$�^	��ċ�7���
F$�DSN"a9�
-�s�Mjd�N+��e��o�K|w4� $��'g��gn
��)AB�h�"Ed OQ�ޔDR
����!D 
A�A@��Yy�K+�!QQ���|��S�H�t����C��� �4^lܓ]������^����3X枔	`=ͳ?������+&6$Ƀ1�5:E��P*�8�b��\MM4�n�	�_��0v
?^���i1��I�yio�Lmr��S��/�]�J��!�%3*q�IU�
���:
���dc�nl�v�o8�$Q`�����΅�^	����î��ٰ��o	���9
 )aIG���-�&"�NO���ˈ
4(.�FqpjWx�d�6��Ҟ������ˎ\( 12X��m�A��3���tzh�Хk��y��l��'t��{��	��������
Eә��H�u�qh7��#(KV�'Oi���U�`�ݦ�
���
�%g�å�0�]��FU�K	�.�V~3�Ⱟ~]&Em��d�}F��	
,N�o���"���2�$��h�p���E�
-� δ4�d�p��P�
T"
��)IU�no�l& ��&]݃�p�h�I̳@�0�c�f�a��
"�OL�g�X���[��e��JM����·�^
|0�
-�ھie��'�a����B
5cL���A �Q;�:�~y�!	��l)�)�`y�"�l�A6�!��@���
�¶O�N+Ϩs
��@j��9.��]��64��4�R@��fjMd�#�p�VA\�y"�e���0��Y��^�"^
���Tǒ�4 ��3d�^��������
-�2h��:M�Ն�*���
R�O��T�'B��Z�T���^ZCxX8���N�
��"��-@����|н%��C�Ä�A)���t�+��4�n:^UT��u�����l΢�������������
:��Q%��P�Kp
-
�&jAq��8;2GJ��5��E�6�D�߻~�Hl���!
}DS�Bc�gs!�t	�N�Ya�[��X at 0��xi�FO��z�� ̠�����s�xۅ}���x/T=�1Ӕ����f�4K~���|Ѡ� V�.Wl�̈��:��e��*�����4��6Mhrm�X��M������|t(�ᛛ���c�k#�z��OI��| �
\���k]�h�>X�
��ux฼�� 1s� ���"�@��$�;�`L_��4I�P	YtAe0K��f	���i���O�
-Ms�M�p0�&O81U_�Лi/Q�ĝ}3� 
��M�Td�U�a^�Z�*$�
��W��54_
1�y~a��G����
_�	����~ �
1#�vHJ� ����zR��XOA��p�#n��-���}R{���vv:
S�E�uM9��xF'����
k����۬N
���n��pw��E�U���F��*ޢ�	Ϳo(�� o.��88�Ia�
-T�<̶�wp�
�G9S��#�#��<�����h�sl>y��s��,�5wڲ5��s.�`D���ع�Ӭ��\����}оw-}F!��׏�ձ&0\:�z��DE�Մ�`
'�
-�
�(@
8���� y��.��c�+������
�.Y�(qP�}�~nc7
-���X,
X)5�X8�e`^C���7�a� 
A;y��@�zt��y��k/[0�m���\b�	��qO"i�J?��]���<
�',�}3R���3A�䇉g'O8̾3L͈�K0�%�H��%emX�2�]���HeU;�q�ɲݢ5��פK� �oID���&�D�|�
��)�4
-S�@G#�i?
��L[і��kT���^Ɍw3��L��_%u�F=\s�@B�#P
��F���Q�>C�9.P�CE8��W��
�
�N����B�\vÈ��cBxd��,�@F�r�@��+̩$��&v;�W��m�[! �6'4�1���n�-lg�B�d��#�0� ����bo�
�BO�'�Eh��"�

�{?y.^/� ����tD��N��UC^��8�@2F1�M�`�b‹�
���hZ&x�MW�3���jM���ŧ=�n��:4��2�W]�U7#������%��b�
#
(25�q��)Z삅����]n
�~�jB��,�^ń�]&,v� n �6
-u�/�7�E�����15�)�ռ9��]ZT�M��͢Z��Z��ʢ�K��j��	 .�0%D�r�xt��X�
�
�1����a�#��fX�eSg�/�A������e�]^U�b�����lg��"G|��7D�0��e[{���-����:��U�W��0uK�F�6�<9,B��?�rƙ�9�j��o�a�9�xX���}�f��7
�~[y�I�rG)�_��B�˄�?g�1��|͜� ��7�C����B�cO�����ӟ։�4˳9������TH$��oKp
E
�9����o ��pp|W�n��퇝X�=nX��k���
-���y�6�c�,�%�W���..W��ΧB��V5izT��u�\�&ZGks��|U$�C^n�� �����3���2�e��^Cl�G(���?.n�ks~��Q�ѵ;�
W;G�2�̚�R�t����)��#V�z�{�
-��CA��x�j�����nXæe
@���X�����^z`��
�̛���3�'�m��>��{�Vx��kN�i�4�Ǚ�X����Y��eg
�u�?�'��g����	�$=��0`
-7D��llٙלj3��r�1�g�v���������H� �TA\
�^U
�_=��������X�m}W�>��_Ź���8�
tض�d�mn�ҧ�E��4:}�;��|V�?g���-��
-���q݌��P��F5qԴa�
J�.��}V�(;v�U��ɝ�&�J|�@Q��k����P,���","b <<
5��>��Ըp�1��"u�
���糔����8�貼��[^IB�?�
�A#W
-�F������;ܭ����q��(3k���M���rPµ�';D\ۖU7 �^������qؓ�c��u�Z����L�l�l��Ы"��_=��lu��w.]�a- �L�YȻ����{;�����7��B��|�6�vO�ݻ�m�UR�q&b���q�k��B��`mО��.��`�>i��e�ߓ���
{V�����\�uq���b�Q�#�w|Դ3��6�yh��lg#%
�MxE���;�k�X#	�/�~՚�
ݶy�|�
��v�'_� ��j��=;�
-endstream
-endobj
-3945 0 obj <<
-/Type /Page
-/Contents 3946 0 R
-/Resources 3944 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3891 0 R
-/Annots [ 3939 0 R 3940 0 R 3941 0 R 3942 0 R 3943 0 R ]
->> endobj
-3939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 512.16 322.446 523.064]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-3940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 364.279 116.998 375.183]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-3941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 323.083 243.45 337.03]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-3942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.883 155.148 361.886 167.666]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-3943 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3947 0 obj <<
-/D [3945 0 R /XYZ 89 770.89 null]
->> endobj
-3948 0 obj <<
-/D [3945 0 R /XYZ 90 720.814 null]
->> endobj
-3949 0 obj <<
-/D [3945 0 R /XYZ 90 618.109 null]
->> endobj
-3441 0 obj <<
-/D [3945 0 R /XYZ 90 571.484 null]
->> endobj
-3950 0 obj <<
-/D [3945 0 R /XYZ 90 567 null]
->> endobj
-3951 0 obj <<
-/D [3945 0 R /XYZ 90 494.137 null]
->> endobj
-3442 0 obj <<
-/D [3945 0 R /XYZ 90 459.467 null]
->> endobj
-3952 0 obj <<
-/D [3945 0 R /XYZ 90 454.984 null]
->> endobj
-3953 0 obj <<
-/D [3945 0 R /XYZ 90 348.388 null]
->> endobj
-3944 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3960 0 obj <<
-/Length 2506      
-/Filter /FlateDecode
->>
-stream
-x��[[o�F~ׯ��V��܇4�
$NZ����Z��"�EKD%R!)'��{�B����%f��`����93����{3{?^M?(�(�Tz�/����M��CB����g�I�@�S��կ�&o�Mn�o�7������G,�@����7��?{���>�AK�S�
�f�� ;]�OD���NC��h�c�)��U����hU�i��� �DX	Z���X"A�^����3��~iL0F�I�"N��4�(Ci��$mD�X
��'
QXd��E�C
��<�P��
-�Y�����2NF
�E<�
�S��z%���.kP��Ĭ�i�d�{h{��qD��3OYwA�
\��d��#*����X:���.~������_��0fv��1(�I9�>�]�1
�
#L�AqnENcX�
�`
'��r��"��}��y�0�@#�K��0�;��Uqc^��
-�a��'���9-�q~�Du*3) �5&�`���b\
��D
W��d���UlN� �=ص��hp0
�g䀝�J#R����_4:<��U,�8b��ј`��E�\-�¹x��Q���U@~oG4�R�P<��$\BH1��t �
W���@�N�
-�qD�0���_�V��r����a�-�����t�4��Yx�6���������ۛy��%$��3P����i�#_Qtb�
��U�y9�FD
��6S R �B.f�Z�}�A!x��3�}� ;�A_ɔ	E[y�e�!*�V���eSM�I�l
���^�R��4h	��"����0�:�s�
��:S΀��y��x�A�����pf(��W
x�y}���۫E�祻��A�Ŭʗ�	�H�)+�
rA>�2��w��^�����7��i�{��B)PLl� 
����cH�C��澋�4ϡ�<�
-Qijy%yG�P��X
Q%聢جMwN�4KW�8��o���Ue��~������,�,r��>M�i�@��Q�G7Rpk!�R$}�,�L�,:��d��	
`�
	����� �@�!;�V��h��P	���i�[��]<[ �L� ��!����^�@$�r�F���%
-�ék4�;\���e�(���p/}��a�ﻛ�b�f�K��<�
�D��1��.�
2E�Nv2���dI�Ce4y�Z�ֶ��T���w�Y�j�eбU�n
eμq^�gM���ܕugk��k���^D�az�&��Б)XU0٬���4ǦR5�6�Gd��JD�g�
d���K�
V�+3h�U����8��'�DŽ腓j(&��}Hu��!u/'�Ah�IB��}w��!�b=RZN:�B�H�6H��l�kP��8�[D��MTt8����J"�"�~=T
u�����

-P���Ïaf��o���x��R<��s7O���
��xrM�;'�Ɠ}V�d�_y
�u<�n�d�Y��v�C�~)
�Ѹ���WSn���倶
�5_�ɴ��E�1o	��T�c���� ��ky���'��
�y�t�'l�u�xN��f -TeS]W�c�y�t��*�.$�.$��VH0Κ!�G���yd/5�+�	�q-:,� f�{h�c8�1a6=�!8y�v{��@�>}�oD��&R��t2�*ɩ]�*u;m]���v�>��N�k���<
�ym'����v~���4���[��g�;�����9��S���yݟ" a�x�=i�����U
-��;[A�LV�A�w�%o� =L<Kjo�\�}��r��1&�����}�T�쀏nv4zDV6~�x��GTsZ'z=�i׻dț~ǻ������Ū��5^�+P���w(Fۭ]� J+����"N�{{@�ȩk
�|i� o�7�����w$EI	��Z/�f�׉}]lڮyY�tdd3"��q�7t�-�hU�n�]T|���c��6�r�	��D�d�e>	�Jm\t�=��12���	�2�㖑�H��~zG44�b���z�#�s6JRR3�!�}��Ļ��K@�^ߔ��[g�	pܺr�庬M�&�m^qFe�&E�iY[WdI����X�<�0�� N_����1�{}��;��p�$RT�)"�9ʀ�YR]ָ#\�<-:=���K�a�0�F������C�7���aj/C7����[}���
h8M��/�T�E�^ޕ��T��P�]
/6 E���đ)��]S,[^ۛ&e$��
	��MP�Z-��/���i�T�7'
j�t��i��V.��'��u�I�Q�u�yw [...]
-Mz=��0m�[c&Oȷ;�?� ��
���	�XB��t�3-�@��Z
��3ծ3Ѝ��A��U�
�B�&��0*A�ͥ���G
�=�Z�C�(���_	gavQ��_
-��
�O ��B"0
��@�V�������w��%�^� ���xXz10P)��r�m�,�67����ڋ�Q��H@���	�u������L̴�؛�mU3��7QYK�^Tj�}`�����f����(V�w�Y
%3���to
�4lڸ����2��L��4�jז"8�
�ӣ
-endstream
-endobj
-3959 0 obj <<
-/Type /Page
-/Contents 3960 0 R
-/Resources 3958 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3891 0 R
-/Annots [ 3954 0 R 3955 0 R 3957 0 R ]
->> endobj
-3954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 241.234 355.512 252.137]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 175.729 362.353 188.063]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-3957 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3961 0 obj <<
-/D [3959 0 R /XYZ 89 770.89 null]
->> endobj
-3962 0 obj <<
-/D [3959 0 R /XYZ 90 718.682 null]
->> endobj
-3443 0 obj <<
-/D [3959 0 R /XYZ 90 672.057 null]
->> endobj
-3963 0 obj <<
-/D [3959 0 R /XYZ 90 667.574 null]
->> endobj
-3964 0 obj <<
-/D [3959 0 R /XYZ 90 596.843 null]
->> endobj
-3444 0 obj <<
-/D [3959 0 R /XYZ 90 508.26 null]
->> endobj
-3965 0 obj <<
-/D [3959 0 R /XYZ 90 503.776 null]
->> endobj
-3966 0 obj <<
-/D [3959 0 R /XYZ 90 411.292 null]
->> endobj
-3445 0 obj <<
-/D [3959 0 R /XYZ 90 298.4 null]
->> endobj
-3967 0 obj <<
-/D [3959 0 R /XYZ 90 293.917 null]
->> endobj
-3968 0 obj <<
-/D [3959 0 R /XYZ 90 225.343 null]
->> endobj
-3969 0 obj <<
-/D [3959 0 R /XYZ 90 147.345 null]
->> endobj
-3504 0 obj <<
-/D [3959 0 R /XYZ 90 81.969 null]
->> endobj
-3970 0 obj <<
-/D [3959 0 R /XYZ 90 77.486 null]
->> endobj
-3958 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3980 0 obj <<
-/Length 2678      
-/Filter /FlateDecode
->>
-stream
-x��\[s��~ׯ�SK΄��_4ig|��Ɍ�/u2
H�$LH�&�(��=��X
- )rU��_
\
�s�;��1�"�I�=|{��)
_����Q,1�H*�����Dq���OWɇ	��Ogc<y7%x����wS�'���6�Z��/���������o�U6�����7���Ñ2nZK��-	�
w��/8�aa�/��.	��iYNgT`f�$[��i��+?e��zJ�$[^�%ř�*�̓o�O>����!�������/8���߃s_/Z$�28Γ�'�<���k���п� 0�u/bH��ǕW��J!I7=�VH�vA��ʖ�����?9�כ
�vXu�uc`�a�t3ú���uZ�!�12L�TQ��M)���84�Z����<�2��C��l���z
�L#b�6GX��6�+D%�fr�ʳ�W��|
\J9"�&���_��6-�C�R���%�lJ���j��
-�D^,4P��X

48��P��f	�z�3�ą�\˲�~a�p�%Sq�4�ϻ���W�ŋP�%�#�n��T��WÂ�lu�
��<0&m���1��'&e5$�R��d�M�	�86�H��r1Ҧ��ni70k�2wFB��eC7?���j��f�E�M
-���>
q$��'H�g_&O������� �"p����cSr�b�*���U��
b�3�6/ݚ@*Ǥ[�T�uV��+w^\��e�X�U����6k,�!��ib��oO���Mf��ƣ���hV^d�}�-�	���-��'�.��6W"�E�À�LW�P`KX�7@�V��7`/2D��5&]C��lA&e(q�8�xuߺ/�w������
��yH��=�>�D(v&��@E�&��Ju�>(҂!	%�ͨ��踣��H
�C�"%l�
-�x������>�Ҧ��s(y]����(5A���E��tY��͆��|(�$CL�a� �d#"�
, ���
#HQ�
Y�7���4
-�9ERAOF���_���ae'Џ�g�}}^,��ߔ�`X
-
-I}R�_6U����lU��j?P
l�8@$�*&�bK�q%
�HF#�
-�&T8�1��t=�>�:R�a@��PŲ�*�hj16O��ƍ�A�7���
�E���ׅ`��
�QBk�lD�o��W�E
.%&�ʶ���}��Y�)9��dR�ӴY�N
��ߦT at C����]��
0�C!�,�^h�^õԲN@>�Tů6�g�8 ��|�F0.�|��+}鿿͚�IW������}~�-���yu�g�V��6�*������v���� �_|
���� ��
.q���Nh�0所��{���/��;��=� ���U����O�I|�.��;�M$p$�"��z"���h,��u�\o�]��`b`T���NY]��A��!v�y~�1]O����-�厢I1G����=� �i*c
���v�Ш�,ݷ��v]��t���/Aa� �q݆Q;���&A^�9%D�,_ZR#�rH����S
�����2q���;�;p-��:��y�
���Pc�� U
ᅪ�op�?���	�T}�~�S�!�f��ˆ��=H�����o<���h�'�� �c8t�Ԓ��Զ
��{�,(x�})�#�Lx��{�/wO�
�},�~_*��C���A�3!�R�.&gA�l4��P9�� [...]
o���<�p��)<�qZ
���
��Ho�h0X�r��'�����#�7*���y$�!bu`}�.�X~J��<RO�1<�%e3�x���z
i��y���/<R�#
�[�!�0,gq���;y$�qHI
�~��<�<_��6�(I �C�m���b�`#	�%)��1��Z|4���-%

�����
��h
E�a V�
--�eH�e	�F�,�fq��c�C��l'���^��'b��ҝ��lE��8
3���a�Pѯ��5L���%$��㎶�M�]��Z
-d��)7JЄ6�[3��]��B;��?Y=/?s���s7s�
� ,�E��ǩ�ȫ/\<�c:/
w�-��u�G}עl��l7�Q׏����a�����@�'�U�6�a'��
�1�,H�m+P�ޥ}ɏL� ���o�ԓ`9
'��}�<;�_Gd����٦Q����D�XO�(Ą�I�Q
�O��Tb������u�{x�V$&"£Ktע��Yh�����		C�x'ƏSc��>7��i�x��/-/V
f�����q���y
#���$�D�:	���1ib�$��	�~4�qZ
c��������o�x0H�~��^K|ML,I�鹈41!)��z�u�1�n�?���(I�	�s�N��1��a�(�xVz�84����f�Á�=��(=L����5_

�;�a�v��T�:Yw7U���������[�����[t
�
�l���	O������)���� h�?�����=��CA8�
�[Шi��Cs��_��zӽ��@���KJ�_�T1z�{}��w�2[�u*`����]:�d%�kSץ�Z�"A�U��z�>���)�k���qR�S��DG8�V�������̖70��~��a��'ĵ�{�E�Y���=��B��mф	� ����O�{L�����y���as���%�
p�������w�
-endstream
-endobj
-3979 0 obj <<
-/Type /Page
-/Contents 3980 0 R
-/Resources 3978 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3991 0 R
-/Annots [ 3956 0 R 3971 0 R 3972 0 R 3973 0 R 3974 0 R 3975 0 R 3977 0 R ]
->> endobj
-3956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 661.939 355.512 672.843]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 571.727 362.353 584.061]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-3972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 449.35 355.661 460.254]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-3973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 383.845 362.353 396.179]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-3974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.008 249.513 276.143 260.417]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-3975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 159.699 362.353 172.033]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-3977 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3981 0 obj <<
-/D [3979 0 R /XYZ 89 770.89 null]
->> endobj
-3982 0 obj <<
-/D [3979 0 R /XYZ 90 646.048 null]
->> endobj
-3983 0 obj <<
-/D [3979 0 R /XYZ 90 543.343 null]
->> endobj
-3505 0 obj <<
-/D [3979 0 R /XYZ 90 508.673 null]
->> endobj
-3984 0 obj <<
-/D [3979 0 R /XYZ 90 504.19 null]
->> endobj
-3985 0 obj <<
-/D [3979 0 R /XYZ 90 433.459 null]
->> endobj
-3986 0 obj <<
-/D [3979 0 R /XYZ 90 355.461 null]
->> endobj
-3506 0 obj <<
-/D [3979 0 R /XYZ 90 320.791 null]
->> endobj
-3987 0 obj <<
-/D [3979 0 R /XYZ 90 316.308 null]
->> endobj
-3988 0 obj <<
-/D [3979 0 R /XYZ 90 221.667 null]
->> endobj
-3989 0 obj <<
-/D [3979 0 R /XYZ 90 131.315 null]
->> endobj
-3507 0 obj <<
-/D [3979 0 R /XYZ 90 81.969 null]
->> endobj
-3990 0 obj <<
-/D [3979 0 R /XYZ 90 77.486 null]
->> endobj
-3978 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F24 529 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3999 0 obj <<
-/Length 2777      
-/Filter /FlateDecode
->>
-stream
-x��[[s۸~���S+ͬ`�Az��d��^������xh��9+�
-I�ѿ�����Xbf�v_,^��s��L	W���?�_P{��oo.._1I��
�|�t`dH�����ݐq=z��@耰P������y���ھ�xus���
0G@
&��w���
���"
O��@r���������4|�#�U
Q"� J�ƌR:,��b����5F��4�h
�,�ō�hbd3�X-�y4�Gc�7
�F
��� �3���i��0M��@O�
:��
�v��0�f�����t�z������.����շ��^?F�.)�6DR�OL��.��<
H`�`
U�J�Ъ,�I]]�|i�0X��|�Ð%��'a6ư���0�Ò���GY6bj��>%�m8�P�0��$�np�y�0�9��REGc��p���c�UH�i�f�ZJIyh)��=+i� �)���`Z#��Y�U��Р�R�uP�|��gZFH\p�O�zQ*0��rX�n.ۺm6~�TT�U�AX�F_�c��1
\A�r=(v�fq���:��<+��Ty��;�
�kr��	
	ۚ�4�,J�E�L�-����#���-փ�Jҧ8����y��nU��u���}1xW��>>���}� ��6I�ޚ�UF�e� �b1M&��x�QþƔ��5c�����Q��\ę��ܧ��ۙ��o�K�n3{i!H���K�V� �e)"#
q�P��(����%#%�V����eػ�4'�L
<�eZ�������"b^��Ҏ]<j�/xD�f�:�
��h��XD�{{(Y;�9(`���_��i�NW�n�Eի%�J��+�sm��B�@(i�t���$^�d����*��T��,~��U�h��2�	����6I��Z$��(l,��,
|�%'e���0nu����
-�$��S4M�o�l$��a9���~����J
-y`A|ST!$�	�OT�yiHТx��<f鈫���Ţ�+}KN�f}-�]�G��:��1�*��H�����������ã��|����w��P����9v�ۅ���I>�-Ϡ��`��
�Jy��Nt��f���Q�b	��.��<V6��v�}:����C��wO�}</�U�8]�Y��5��އ���>bA�#7��3ې�7#�z at R�9�#�sL��ر�����D�e-
nY���.��Ŵ0z�B&�2r��OI��]ϕVX[���y/�؂�
Q�Fy�o2nJ\��d�[9�+��ԸhK�M[j��|c�d�eq�M��m�h�?�.��L��PEy껏'eP�Z�^yC
���
h��a
\��Il�<b�\1���C߂�J��D�iW�q�M>�M��>����뤭h������$���S�y��&<
�қ{,�r�iT%��
a2�6&��^����K��M#d[��˕�P��D�G($�v�`]d ��W���R�,2�5VLChE�������Q��i2Kl�� [...]
�g�ay
-_
���X�9 晃X^p�[C��Q@��tR&luǝ�sI�:��l ����Ԭ�.� E�*tt��L*ҌX����]
|@T��Ӽ?T��=|�a�ڕ��y#4ݡ<~4
�$Cs�}8����C�c���DPg�����*U/w�vv�1�
F��Kf�w+�M��]�s��Wl���yś�k����E�Ƙt�U�GM�uX�`,�m9��Xw39�αʼ��Tż��O7��"��t��D���Q"�6�
�!F���)l���b�;�
(*���
-�����Lt��
_
��k���
���[��<b?"z��w�#HJ����):
���cᨲ
�KCm������F���ٸ�cs�J���S

,��VK��ڬ�87~��ԟ������e�m# I���hu}StVG�\����l
��ͩ@"S�5�:��;��n�ks��V9�"f�≦�,b
�=,Fl��˨�T���w�$����I�slo��b����DK�Ƴ�v��@2](��l��]q{o{k at 8������
�
�
-��[�+LJ:T$�
�
J��ڿf6
F� �Ө���x�8O>.+|��:uyw;�N��^'S|
x�u&���w����L����Y
�NY�����s��E����h
������I����Q�z�kC�z�k��]�\���.�T;w��
-��	�1�t�6��9�K�ա�S��q�%d��'s��=)��S
-{v�?c�
�����I&U�Q�ۢ��(�?.a��j����
���pw` E��~��94
(����������L�u��#�"_R�
*�¾5R.>R	��7��2h}�
�M3�D`Щ{3�p��G���IR~�IRs����u�1��8�Uq]�	�n�a��w�|���~/,l?���>[u�
Y׶����i�ْ���>����=_�h
���)��p&[Ҩ�|5Ggzs
-~+������a�c+�;Ų�g(U�1�
\&�a�g �g��	4�����oOW�nk����Lk��}#y����s�4����y�v
����I��
H��˻�,6't��u2��w� :1\
��������G�J�1�|پ._��T.���w)��ɍAo�&X�
-¸�ҝ�dBՓ�
o���.���ٟG
-����
͗Q�em-��hd�ە�CFhu�
���k�t|�ְ��E�[�(���I�E�����[>�������.W��Y��i���S03K�
��

����:	���N 
-endstream
-endobj
-3998 0 obj <<
-/Type /Page
-/Contents 3999 0 R
-/Resources 3997 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3991 0 R
-/Annots [ 3976 0 R 3992 0 R 3993 0 R 3994 0 R 3995 0 R 3996 0 R ]
->> endobj
-3976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.011 673.894 513.996 684.798]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 398.789 276.047 409.693]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-3993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 308.976 362.353 321.309]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-3994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 174.643 334.073 185.547]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-3995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 109.139 362.353 121.472]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-3996 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4000 0 obj <<
-/D [3998 0 R /XYZ 89 770.89 null]
->> endobj
-4001 0 obj <<
-/D [3998 0 R /XYZ 90 646.048 null]
->> endobj
-4002 0 obj <<
-/D [3998 0 R /XYZ 90 592.359 null]
->> endobj
-3508 0 obj <<
-/D [3998 0 R /XYZ 90 467.854 null]
->> endobj
-4004 0 obj <<
-/D [3998 0 R /XYZ 90 463.371 null]
->> endobj
-4005 0 obj <<
-/D [3998 0 R /XYZ 90 370.943 null]
->> endobj
-4006 0 obj <<
-/D [3998 0 R /XYZ 90 280.592 null]
->> endobj
-3509 0 obj <<
-/D [3998 0 R /XYZ 90 233.967 null]
->> endobj
-4007 0 obj <<
-/D [3998 0 R /XYZ 90 229.483 null]
->> endobj
-4008 0 obj <<
-/D [3998 0 R /XYZ 90 158.753 null]
->> endobj
-3997 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R /F118 4003 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4014 0 obj <<
-/Length 2939      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�S
Θk�
P���q�&Mg\[}r=��D4$@�e���� RBq3͋ ,g����
���&���^]��|#i��D\\IH� .�)
>�8Bl6�Q�og8
-�z�^���(�Vw�<��˟��:����_��|�L7����O/�`���dàZ�7�Kod�0��bDF�0��_���*m�ٜ��%$�כU���]~��3
�y��&�(1�J���g��0��l��#��ه�Q�A�OA�(L�VwZ�P����g�8����+"\ݪ�]o���9NP�@b��տ���7mQ��VhO��f5���@�ȣ����g���2N�@��P��#r�7F	���x(R����1CV�
-���#�lNϠ0AUb$���i����(g,
-?��"�L����v���ٯC�A"�L'�(L
�
gJ)CX�c3]3$Q��M�bYW3�����Lqm\\l�
#�
-�|�_QD�_�n'�ľO�,ӧ��@,��2����t}�F�Ĉ	d��z{V��4�O�\T�M�W�

�,N��)VyЁ�H,٤Ny���!JI0AS>% 
-�l^h]h��R"A�Q�'\"�|��n�����F�h�)�H
�@O h'���yFXX�X���`ޚNJnBv���{��ٜ$1�7	�֘�P-Y�D����u���~�s@��@p���h#ࡉ7�}�����?������Ș	A�L3fy���g�_�:�T`q������)4�؁XL�* �(nTH�
�
�fs&d��dݎO���f
�!���gB�<jBQ��񍎈?8�A��a�fq�8`Α�b�&O������U�E�^��k h��'�[���X��]4�Zr�{lK�my6��h�x��sX<	��@� q��,%QD|���Wo'
-l�I��
�~(�UQ�{xp����0���ؼ��zY
s��'@L	�
�B,D�:o���4V׻�0ʝ��W�~8
>����E��Ey�SH�NC�b��qO�pugFKWMeZ���};d�X��Jf8lL[Q�,�����F�  ��v�ک*d ��9�p%Ԛuͭ�0֢��_]������S7�
-�,��G
-AR.� H%�wB}f���C�� ��`�8v�NmH
ɶULH��Q���1
�K�JJ��'���5��~��p�o�	"�
�zx�� ���D���@	�Ҟ�[}������F��X
�c�z��{�"1�� ��G�����u����BP@��|� ���OX���"�q����%
g*��i,
 ����
��n
���OSc�ƻj\����ᢳ�O�_l��6�V���l?gB��|��Yݓ�|�F@��Z����i'ǧ��< ��{�jj�x��C��$-�m��ŷ�H
V�n��̓��^�A�
-�T�6��=(�O�U�%���j�����j
�ԃ�@�)��+'T�5�����j'��~Q�6/�
���>Q���s��en+?�f��3zXO8�����E�t���F]��W��Ym�X�ŧm�������{����rJ�z��Ǖ�\O&/%��lL&�Z=�L
t��U:^�~l)�#�R2�2���<�L]-y0�'֒{3����=\��>)�W�P�
'�
1&�-H?}��!��H<�k�"�ނ4�I�|]AZ�^��_(H��L�c�h at b�Yt��>�6,8"�i�:
-�h�I�Ȱ*/>ɰ	qi�a�37#�h
-�O14aJTf�m��`L���I�`���}f�������L���U�>�ʛ�J���΀���`����\��`%��0u�J��B�,kF�8�
-N�`�é��u�q�%�~��F̀9V�lP}vP
:��k�~L��]��:�>*	bɔ�yr�
RU]at�J_�b@T �
������(#�*� �-v� C�uV�fك��ӕ?��B}�cS�S%�/��FU!?�..�;�
-�U���B/��!��b�s�ۥa�&����2oZ�P�Y��P_���h���Z at pya�_��}ž��껆�8(��Lsj.��,��,�1

^U[�(3�x�:��)��4j����p��۽ޖ�T�:���f�V'"��r�U)�W�r0b��<|�V����
�MA��Z4׭/^\��z�U�
���!R	�^)���#!�3%=��0u]�ٜ�+D��N B ��򓑬$�A�y��O>��~�Ӿ����L�}
4E���*?4�
Vd
p�5��b���Eq,2�)I�ͣ�	���_��^�P}H�~��� ł�|Z�
�
���~�`*�e���F&h����>vd����@�Cl�~՘�X��2�7��
0 �\eI|�j�����9pL6���Ή����X��]�$0
��Jx�ιMV� ��<�6Q���1��1�#��^�	���Y�{��Z����q��
c�
}�1N1�e��A7�N����q�(���W�2��Gh~޸�=C�I=�r۹��ɴD���ۏ�I�=s�V�o�^�3��My�dr��^�H�����	��/O�b�_��xV��t�o� lOyJ��G	&V���L�!�I�!��O0�Q+W7x��!���
��

�to)����
����l���k
7
�i
��.I�ښ� �x\#�O���T7v�����
F
-O��*iK;�8#�<�(&]Fʒ#�tw�� ����Ì:[�wz��*zJ������m������,%�G5� �0Po��S�QH�d
�g����*A2�(;�W������>��ңuw���v�<'C�
-�>����&�6��P�+A���.k��V�~��'� #�}����g���q
�4���4���>@X7���j�(2gn����ܝ�1J�����i4�Ss���P��m7�/_^mo���A�j���;�H���p���r��
u\|�O�#G_<`�0������);lGt���ѽh^�����
-x���
H+zs
-endstream
-endobj
-4013 0 obj <<
-/Type /Page
-/Contents 4014 0 R
-/Resources 4012 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3991 0 R
-/Annots [ 4009 0 R 4010 0 R 4011 0 R ]
->> endobj
-4009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.224 612.733 256.77 623.637]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-4010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 522.92 362.353 535.254]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-4011 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4015 0 obj <<
-/D [4013 0 R /XYZ 89 770.89 null]
->> endobj
-4016 0 obj <<
-/D [4013 0 R /XYZ 90 718.682 null]
->> endobj
-3510 0 obj <<
-/D [4013 0 R /XYZ 90 684.012 null]
->> endobj
-4017 0 obj <<
-/D [4013 0 R /XYZ 90 679.529 null]
->> endobj
-4018 0 obj <<
-/D [4013 0 R /XYZ 90 584.887 null]
->> endobj
-4019 0 obj <<
-/D [4013 0 R /XYZ 90 494.536 null]
->> endobj
-3511 0 obj <<
-/D [4013 0 R /XYZ 90 459.866 null]
->> endobj
-4020 0 obj <<
-/D [4013 0 R /XYZ 90 455.383 null]
->> endobj
-4021 0 obj <<
-/D [4013 0 R /XYZ 90 384.652 null]
->> endobj
-3512 0 obj <<
-/D [4013 0 R /XYZ 90 264.612 null]
->> endobj
-4022 0 obj <<
-/D [4013 0 R /XYZ 90 260.128 null]
->> endobj
-4023 0 obj <<
-/D [4013 0 R /XYZ 90 189.397 null]
->> endobj
-3513 0 obj <<
-/D [4013 0 R /XYZ 90 77.486 null]
->> endobj
-4012 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R /F32 764 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4035 0 obj <<
-/Length 2689      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���S+��܇c�f7M��n���v!�m��H�������2E�
�@��I��3�>�93��� �^|}sq�A�@#-�
n���5~��O3B����&CD�������Ǜ�?�|4�.��\�zA�HE@ ��ŧ�8X������G;hp��
>^��;^0��ܚ��
h���q�a�CB�c<+��~������j�T
-I֬U��h+�x3�|��i���
to��nt����b
�/s�gY��z�&�k���s�gQ����s�g��i��h�Cr�G������,?n����D*�1��jH��!
-
�j-�q	��tM��j��+�~�,���qM�5b��yE:ԍo
z��Җ����"�O�
J�ٿ���r,�ʅ
-��F4�9
-9=�PL���􄣴�PSP�w�Q�� 	�p؈�k�:�.?H�X(kP8qX}�g��4( ��j�}]А��`�4+���x�0�&)�1
Tv���Ď[�'��s����>YfZ�J���
���
�J=�[�"n�t=@�H�ճ�GE �x�
�b�=N����Z>*��u�υ�!Ol?M�\aA	G�[ �X�j������_�S:vE��~?�Kΐ�
��v��{K��i�R)r�ģ�(C��|���O�|֡h���)�F
w
"U��R=#HrH&��imS�뫫m�ޗ�e��s.�𕙎��b�K�M)H�0䡞���7I5"�,X#X�=�n6y6�b��͸�%w����� ��
M`d۵=n��*���Y�*AW�E��V��/�(6C��cGf���h�H?���K�.�mi'Y6t�Js*�*��M�F�
�Gy��
�1���)�<nϡy�P!´�$�
��/��<�e&��
a=%a^�e%�p�Sw�	�˗6�f��!
N2+�+�&��L"�,��\S0u�n�b�1.t,!��
���4Qn�P
��2:y>,
�e=X�Smg�m
.������M��W	�,jR�yЪ�%��Ƥ����:D ��
�,D������PWx�f��=? [...]
ΑWY���>K�Izߔ>�k{��p���^��O��P*�3�v�ـ�'�R�}5�g.�!���o8�Ys�B��~��)�дA͡��JOX�t(��P!a�\ 
��S�@��1$�m�^B�`jv� R>�`�Pκ`�	���œ�[�PJL�2�
!H��4�BD=Ȗ�0g�uI��v{��LB��
�rc��,K�#H��:�L����Pj�#�h���߅�((���2J�z�O��B��Q>(��yau�j7:
؜����3H���8B���^�]m$'����(�@:�62�d
���~�C�`{��	��8D���{�&cfa�L� �Ӟ��E�@��0k:��GK��CE��5�5hj�H���1 .��V:Jբp~q(ހ�q�r��w��4AV-7�S�n!c
�&�����n-
����g���e�]���>&u���L�W��&Zo�3�[�=.{�=Y!�v}zI�ʴD!d����&���쵐i��7�i�+31.�+j��صC��]
�g�W)C�ɰ딂��'i
^G$
B�]A=�j���.� ��s�$�
�E�@�>���{��%��sK��~

4"� ���
P�޶��J>m
�C�$����-|LI�S��
��B�����|�7ƺ��:޺�����2�� �*hhT��Y�W�p�[��C�*���%��
�4�a�"�G�o�
x=9�B>&`w�������5T�d�,)��4�d�/u�2
-
1Ŵ�q؛��Y!v�B�v;���������Saa@߆g�ߘ61 ]CJ�[)�S[�>���
b�-�����7��R����  *�m�/N�|mw�;����[��*����x�z����]'�;����N
-�IwR&�h
�D��I�8:a�II�qO����>��I��2�h�
��S�M8��i���x��զ1���x���=Ğ�S��k)
��H�ʞ5�R�2��J.L��k���p���v�+��yU�'�g��l��J�ƴ@{���[��FL_̄=�	�5���>+�f�h&
�4	�t����Y��%6E}��˧�*[g�(i�����
���E7�F�|��b��X{���RA!��u�
L��=�7j��ۧ�Q��:}��x��Ԏ�l�i��hˌyk���
-_�[e�J�����
��j��n����`2{8*��.�
"�{�8
�ul6��xm��  (i��P_ l��
1ѡ	dgM�ҭr.`�i��a�g���ޚ-Ts]Eۭ�#�����=��
7�_�Ν�ҝ��5lD|��Z
���j��M��n�0���n�
-�x&ĐP�<�[�:��j�g��W�{ӵ�z��zӺ����>����b���m�~ܛtIz*蛯�R[�<��t7b ʵ�Br�D�36�so_�߸���X�M�Zr
��h	ֹ
�OB]n� $օzR?�__�P�����?����`�҇zU6zq���L�.�D�ǸVp��/
�����Gp$D㖛��_]^�>�C�G�lw��ۏ�Ū)��j���Zm��Ý=�����/"Q��
-endstream
-endobj
-4034 0 obj <<
-/Type /Page
-/Contents 4035 0 R
-/Resources 4033 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3991 0 R
-/Annots [ 4024 0 R 4025 0 R 4026 0 R 4027 0 R 4028 0 R 4029 0 R 4032 0 R ]
->> endobj
-4024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.334 673.894 236.659 684.798]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-4025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 618.611 335.755 630.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae68d61763922cee018cbba3834b2085c) >>
->> endobj
-4026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 508.727 243.45 522.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 456.468 485.603 468.986]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.376 250.424 385.519 261.328]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-4029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 75.416 174.682 82.942]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4032 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4036 0 obj <<
-/D [4034 0 R /XYZ 89 770.89 null]
->> endobj
-4037 0 obj <<
-/D [4034 0 R /XYZ 90 721.073 null]
->> endobj
-4038 0 obj <<
-/D [4034 0 R /XYZ 90 655.872 null]
->> endobj
-3514 0 obj <<
-/D [4034 0 R /XYZ 90 609.246 null]
->> endobj
-4039 0 obj <<
-/D [4034 0 R /XYZ 90 604.763 null]
->> endobj
-4040 0 obj <<
-/D [4034 0 R /XYZ 90 534.032 null]
->> endobj
-4041 0 obj <<
-/D [4034 0 R /XYZ 90 480.343 null]
->> endobj
-3515 0 obj <<
-/D [4034 0 R /XYZ 90 433.718 null]
->> endobj
-4042 0 obj <<
-/D [4034 0 R /XYZ 90 429.235 null]
->> endobj
-4043 0 obj <<
-/D [4034 0 R /XYZ 90 356.372 null]
->> endobj
-3516 0 obj <<
-/D [4034 0 R /XYZ 90 321.702 null]
->> endobj
-4044 0 obj <<
-/D [4034 0 R /XYZ 90 317.219 null]
->> endobj
-4045 0 obj <<
-/D [4034 0 R /XYZ 90 234.533 null]
->> endobj
-4033 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4055 0 obj <<
-/Length 3183      
-/Filter /FlateDecode
->>
-stream
-x��[Y��6~�_���Tk�8	`6����$�*Ǟ͋���H��)����
�(P�ȕ}؇Q$�h4���@
=D8�������?Ii�cG7��Ƒ���-�7����x�rJ�$)����)œ|��1]���]�_�������c�I�����'Bzd��Hj�Z�ߺ!��0�̀� 
�̀�Q��*)��
-
�4����*�Rw�Uz�S�&i6�[�31!T�W?�\}�"@GĉC �����͟8Z��_#�,�
��8e�^_�~�����@�� X��H�m��
V�5c���r�]�/�TL��6m%���KWy���6И�E�N������o��Z&+��~�ͫe�!�����1�3DA����!�z��Q!�HKx
�
G3�P��[�]����7���nʷX������^�2�&��:�J����TkHc�l����^
-�o�v�;s��$���
|��22��h�ˎ�<���#:��Y+���i�H����ǭ�ܻ
1�$�̀;����Y�(�M��iV�
�!u���q�-B�R�0m
�}pV���}5�9�oЉ�BL-���
��΁�3�����)M	�%�,
���-�4����`
��E�[�� ����B҈!D
-6��x����ےj,`@�!%��f����1�c:�������v		����
P�qc(�f�iZ7��0������W�6
�1�x�
-\�d�0
-�'����1���
�۬�bD%b@���p@��@9�ig�ɪ
����H5.�R��q#z	$y�1�92"`l�]U����|zk�BFJ�@��ƠG�E��d���$Y^�
-N5_��$��9�K�J�ۧe�h��C;��7)����H�y��k��iƏ ��0�X,k����r�ΗF�FŐ��Yf�S`$��b�6ji��s��u_N�L(�]$��%�:����dW��J
,y�%��
`�Z����0�N���N
A�� �|�/� 
�C��b�X�M�ۃ\�V6�Z�
p����v}�N	�|�Ԉ�G}Dƈ�#!ؾ؏"�t�٨�_�ԈAdH1�=L����e���R
�� ��m �MU��x,�L���0�sR,��U���� �
�~4:��O��T���~�eC�F]\��A
-����@�a�(��Y�:O(R0�2 ���hl
�+݀y���������
6Z/ �7y�h1'蒉&}����!hƺ(ʋ��a�K� �F���ƺ���2����,!8��S��<�Xr�$Y��;iV��ץ��֑ @Rz�e��@>�=k�&%�@�#��]
��@Z<�
_eb�ܨ�ظi�օ����Q�c��z�6q�f�g�.���bH�u��	��a.�y��h5����2�� ��q���Ә�]��V������ZWʰ&�-�/�1jt�2F��P4����|�A0ލd��G<����������D�p�D�&+߼�[gT'���4�m+A�P�dH���G��p��yM�H���&J(䴆�������א�p��d�\܂�`r�����=��Gavѕ�z`7�p��qȘ徥�y?�(��+�y,r�y>�n#��r�������2?U���WCw��Jt_;a�ǩIw�&?�<�!
b��OѺq����5���tF{#8ݿ|�4١�%�����t�ѫ��v��-��x�@A1�� �R�g��4{�
oӢ�r1ɋ#
�Fkž8+
GЈ���1cĦp5I6t�5hId�ի�f���7!'�om�t�>�E�]-��y�-�Ό�g�>5
p+5C�=�
W���^r�W
:�W�� ƭn֛|���޶dL�~(�%���a�wz�׶1� ����"��4��7�!�mJ�M%�r��(��	����]
�z\��Z�j��ц���*��4eP�R�]�<
�JT���0wE�@�ݮf`ʦB6�1��IՍÁ9�eד����"E�A������7w��[Ly��H��D9�ھe�.>
���)~d�`f
-�ݺ-�0���1`q�P9��4�
V�ҦC�~�t����ޏ.vu�;�>H���K< ^xN��#ѭ��ݔ9�$�g�9?z���
�����#@��,� Ar�uޱ
:��c6� O�	8���c�;�G�
��#�
``4�����u�/�:�
 �P�#��K<b<��?��,3fIA����A"�2ӂWg`�޴^
ش:f\��q��VK�tw����(o_7�5��cYdkK߄`�]�i��V����[T��/��
�Hp���ƀ_�G~�U�<��[�}t߽ /�c��daO%�[�-ݧd��3!��Q#�H��
��h�w���Oŝ�Z i�8�c�ō ��1e�'2�K{̴u�2��J���Pҷ�a
�߽���|ZSe�~�zdG�|э+���^�K��):�{��9pH�)�
#�F�9����A�}
-a��q��8�VޔL�C��<���!��Cl��
H5��rPQ1�_f�)xbK�}�FI�:�9)ӏhܙ��P�>S��������K�V$;H�˷r(�A.���
-4�Q[�M���0���Q<�N\7r�y�8�\#��l*����W���U�U���V�N���Vt��a���oY�e6���w�A�^�l���uu� ӛ�V�a:w��ϳ�x�E>����;��f�)Ol1�?a{\<�U�r�`��C�������!���689�Oia�LҸ4��Y�a�-���qT��l=����K�h���`�=Er�ї�W�U�\
��6܀˽5`��$'To)�Ur�Y��8�R��� ����U��
-8�
e�_M0�H��.����SK��+
O�{+]�
M���\�h��?�V��r�!�?���1w
���T�t���ׇ'.|œ�!܁�{�֣\wO�[���j�u��(q�n��f
-A��
-C���Ț3�dR�"��T����Z���Iɀ�捇h ���}�19����qO`��I%��H�'�.�y\[�js�@a"\!Oj��(T�o��SJʎ}[�q
-x�y�@}�
�}���O��
-1����I�m^&4eV�K/�n(�)=�����c�}�\����
+Dp$z]ª�\?~�}(��A0�[��CۺF�Ms at g�i�Bps�K3A�m Zl^��%�� ��D���y�����7���f�9�����\�e
-endstream
-endobj
-4054 0 obj <<
-/Type /Page
-/Contents 4055 0 R
-/Resources 4053 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3991 0 R
-/Annots [ 4030 0 R 4031 0 R 4046 0 R 4047 0 R 4048 0 R 4049 0 R 4050 0 R 4063 0 R 4051 0 R 4052 0 R ]
->> endobj
-4030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.953 685.438 216.525 692.964]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.27 685.438 291.843 692.964]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 607.263 239.856 618.167]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-4047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 419.546 379.76 431.879]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae68d61763922cee018cbba3834b2085c) >>
->> endobj
-4048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 377.448 182.164 388.352]
-/A << /S /GoTo /D (index_expand_space_dimension) >>
->> endobj
-4049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 280.082 243.45 294.03]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 203.514 535.938 216.032]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 190.129 226.824 202.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 80.973 362.844 92.041]
-/A << /S /GoTo /D (index_fold_space_dimensions) >>
->> endobj
-4052 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4056 0 obj <<
-/D [4054 0 R /XYZ 89 770.89 null]
->> endobj
-3517 0 obj <<
-/D [4054 0 R /XYZ 244.439 610.416 null]
->> endobj
-4057 0 obj <<
-/D [4054 0 R /XYZ 90 603.776 null]
->> endobj
-4058 0 obj <<
-/D [4054 0 R /XYZ 90 535.202 null]
->> endobj
-4059 0 obj <<
-/D [4054 0 R /XYZ 90 469.16 null]
->> endobj
-3518 0 obj <<
-/D [4054 0 R /XYZ 400.69 380.601 null]
->> endobj
-4060 0 obj <<
-/D [4054 0 R /XYZ 90 373.961 null]
->> endobj
-4061 0 obj <<
-/D [4054 0 R /XYZ 90 305.387 null]
->> endobj
-4062 0 obj <<
-/D [4054 0 R /XYZ 90 227.389 null]
->> endobj
-3519 0 obj <<
-/D [4054 0 R /XYZ 487.765 84.126 null]
->> endobj
-4064 0 obj <<
-/D [4054 0 R /XYZ 90 77.486 null]
->> endobj
-4053 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F8 794 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4068 0 obj <<
-/Length 2874      
-/Filter /FlateDecode
->>
-stream
-x��[mo�8��_��{6P3|�m��dѽ�n���>t�@��DX[�Jr���R�

�Rg��
�A�,g�3�<C2Q1��`}���[��>?:>
�$D��rr~5	�$�!>-'����ٗ�'L*DB	�2������݇�3��ѻ�?�|�'� P�&����/x���?��,T�[��z�)��jrv��#�hf4�F� B�BqĐ�9�O�x�YEe�59>���_�T�*���pd(��
��&N�u<�S���
�
��?z�v��Fb�n�!�!�B�n��2�gs5�:#b�
��
qj
�p�o*(
-U�L�C�30����
�O�����. 
��]�uF�4K�ՋN(�k\�qF�4�������lu/����2������9!b�L�m(D�ӓ��o/�n��o"A<�M�VX��
_\���84�''y��4��e
-����)�F9x�)#�Ԟ��x��z<8Ș�!ʤ;f2�TQ�����@	�s5�.�2��'M�F5r�����qwQf�NYƧ�a�=1NC$a�md���|)%�Ļ0�f��:@�|5)���\��	z)�/*K���K��P
«\BD)�u?���h4�e$ň����ע��+s&%�hL�9��H�f�`�I�Ջ,-J;g�;
k��s���4�b�YW��S�
�
D�r���OK
-���^u4�x���n��4PYo��Ƙ�G��E�`Y���ו8���UR���̣��'Mu�I
-�b���y9�qI��T�)D/#�. A�*M�C5�A��+q��%L�՗��]�#������?u�G��J�
'+�+^�"ߕZ��@P�$��3*�x��`Z��^�I��Ӕq†@چtG��:�M9�a��<��E��f�y��;�mS9̧�undյ��h��0�|�����A#��x����,^>'�g���+<HQU�D�>�ŋ�fO�M S`���S�’�$�{I/��ԓA�^F
�zo���Cap?rE�/d����BM����FNׇna��
 \ܩ��6Om)��
����Œ�-�K�7W ��R
bW#J-}t��Ws��z���g �f�Y��HW��F�(]zd @��
�Rq�]4t%�M��."�vs	p��Uu����dc΋�
�
�@�$m��Cz�.��X�����C����Ҳ��0PZB>eL
��`O�$N�E��)07�b
����6]�I�V��f��:N��<��^�H�,
-��3*"#��ˆoZ	{�gq��txyr�A}��u%���m�<*�sFA�v��^��[6m0g΅��i: �)i��x�� �&t���
U���!A{A��Ѐ�s��
�Zĕ{�.hț��\>uB���<xB�-V�U��u �Q
�A��_��fk��	
!,Fb��6���'e�sLq�p�ȇV����	�x��E�X�Y�CU��Y�j|!w�ؠ���EA��Nq2��PӫhU��A0˚	H�1�`X[m��<D���1�ֲ#+����n7��d�>�0���`�
;c��ơ�0(�N�o�c���T��8�p� m�gzh}�M�s�5�8/�Ӯ��JL����}�Y�Cp��Ӆ��]�Ne�i�G��vuv����mR�P�(AӴ�
����',�:�����������ߍ�m��G[^�s�� ��
�8�/��ʶX���hS}�Y
�w%
��C��.
����B5H|�·4I���*C#L"0)��n+
��>@Ȁ�	�ֻqU��w����4{�"�n�s�v��<R ��y��b�Q[�>��JH@�Ɯ�Ǧ/{��e��
C�yC�.�lU	�˾f񔑚�I�˽B��(��
�zȗ
-���G�B��ǻ�����ϴ[
�N�Qn�$����ص�q��1N`�a�z�:�Y~`�+>�{:
;�f�U��V�,]��%:�����X�����o�����c�{���^���
w������6������=��z���L��.��ϓt��7@�/W��:A
''zi�6&��i��xǮ]׳ ݴ�#��O=Xn"/^�Zp5��R3���N{�]�!l�U
�����>��.�����99�Y3��z���{���.Ǡ;i���+
-�>�p at w�\�_���
�Ӭ|4������,߄��fE̥��Ya^TGN�.+��ɓ`��
�
ɖy�f�u�B �/�2�:Q�?N(6!F!Ի'��
�Ѣ�ڧˤ(�t�9�A,:��
-f
@�9*��:u7�vp_�-�&���ċ�u7//>lחq�߳���^��J�*;�]͹�mΦ���8]�ˇ>!
-#-2�,�>�'D1]�� ��঱jg×��A��D!��a?�4
Y%�YP���SHg

�6i����@�ϗ�$���Ġ�}t@
�t����A
$[>���ҍ0|x��x��g��t�,�Hn�����m�e�^_�Mr�~Cml\�/�*�
h�
��qsΫS��@��V�0�z��w{�G����#J�Y �C ��[H�E����[�@�Z�{6�W���=��
���L�� 7���Ak���oD&�T�3-D���
ӂ���	1�ZI{�j��
TX�����
#s�l��.Y۝4�(���暖�O)���G�f���ߡ�\;G���Y���]bV�ϝ���7�66VB�.���L
�m\o��6�j'wv
m�z�g/=U�=
��2t�-�50�s��?���|pƒ찱�b��!�/��M��/&�Y��ν����}p�~�&o3֊���y+�>��@h2a�WMe=����n�U��_��rрѶ=�(p�g��
ȿ�)T�g�=`i���Q��Gf:�@ [...]
-endstream
-endobj
-4067 0 obj <<
-/Type /Page
-/Contents 4068 0 R
-/Resources 4066 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3991 0 R
-/Annots [ 4065 0 R ]
->> endobj
-4065 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4069 0 obj <<
-/D [4067 0 R /XYZ 89 770.89 null]
->> endobj
-4070 0 obj <<
-/D [4067 0 R /XYZ 90 646.048 null]
->> endobj
-3183 0 obj <<
-/D [4067 0 R /XYZ 90 608.211 null]
->> endobj
-4071 0 obj <<
-/D [4067 0 R /XYZ 90 603.728 null]
->> endobj
-4072 0 obj <<
-/D [4067 0 R /XYZ 90 513.562 null]
->> endobj
-3580 0 obj <<
-/D [4067 0 R /XYZ 90 489.613 null]
->> endobj
-4073 0 obj <<
-/D [4067 0 R /XYZ 90 489.613 null]
->> endobj
-3581 0 obj <<
-/D [4067 0 R /XYZ 206.91 396.575 null]
->> endobj
-4074 0 obj <<
-/D [4067 0 R /XYZ 90 389.935 null]
->> endobj
-3582 0 obj <<
-/D [4067 0 R /XYZ 90 338.248 null]
->> endobj
-4075 0 obj <<
-/D [4067 0 R /XYZ 90 333.765 null]
->> endobj
-3583 0 obj <<
-/D [4067 0 R /XYZ 494.439 266.61 null]
->> endobj
-4076 0 obj <<
-/D [4067 0 R /XYZ 90 259.97 null]
->> endobj
-3584 0 obj <<
-/D [4067 0 R /XYZ 488.462 192.816 null]
->> endobj
-4077 0 obj <<
-/D [4067 0 R /XYZ 90 186.176 null]
->> endobj
-4066 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4081 0 obj <<
-/Length 2148      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~����U���/
E�����e+��J�–�,��zFױd�a�\]y�4wO����42�
|=��jv�b�AFR\��$$ܭ��s�_,	�x~� x
f���rA�<]?>D�,��.�������/^^�z����շ_�K
G�hP�~ZL�4�&ʫ	W=2
"LT>��b
�v�%�:�6�u�G��O�]�-��G�-
)�Ĝ0beξ���6# �p�@J����78X��F
�y�&mN|��W�g��Y�<K���>_����o��v��y�&�b$̢�bewi��V��~'����
*`^
ެ��[�]�?n˯�x�n�����on��W�c���x+WB��
���1��.��U-��2]Ƿ
"�}1 at A�;x\r�{*�O����SӞ��T"��`�8’51
��ۼ���CX�����%[�&��Opm��ޱ���ĝ)R���	=~R
����U�HW��o�t]�ˢ�<^�If�X�D .t ��<QCM�Ѧ�i˞~N4� Š��閱�wyh�YPإI
��ҾbH��>)<�
��4,Hj,!�e�8%A@Sf(F`7�PM��=���E� ]�Pi]()����S�"�3�Da�����e�"m&�˰@Zs_��ѹ+��
-@�bmF��Y�����ZS4b���- ���2H�z�-�׼'2(�Ьg
�0Α��)q�K��q�ը�u��B\6j�%SA�p?%�
@G
���T��1%#�Y�h�ѳ~,���O�>YA�~g}"%C�^֪��/
j�f�
�2�T*|�����"�vVo�>V������m
�"��h/
&�J��?���]�݀�viy�}�<�9T`�87TWdww�o�(�Y7e�ڧ�z3Ԫ��a��3^"�d�1]!���VC� �A*$i�� �a���
�p;�Xf�[F8tx*�L�۴�#����?�	�w�"�_0�I��f�����4����I���f�x��_1����y���iߢ4x��
-�`Z��|���\2���KB��
�!Sg�'U�
� {���݅�]�LF۽6����ƻ��C���_�
-/�L���6HҤ��N�r���v(.�k��nc�Uh�Ly�K
]��N��
����a�f	?�
�g� }�oG
��%�_��]�
))��<� v�E|�^��p,$0�	
@a�{mT�.XF3���
y�4� �1"&�Pװ�~m-ف��
�Av {�-�&�aӐ�)�E�9� L��$����!��f�>+�hvA�@oE<�g��&��a1V�Z"�8�K>� ���)G�iN���)b��5&6ψT�j]�k��f���R�L������T2�To��O*G�yhv�+At��a~t�ƙ�A
��2�)ә2��(�U�S&�Ԭ\s���ޖ|�3�"�ԞX�>��1B ah
��=���z���G�]���H�1yJ�h*pw5�IL�K$��J�C
�0Ր &
	b�3��a�2Z�a%�H�������U&= 
-  ��Zpj�
 �W�`Nec,�i�0@�)�bCڊk.8‚��HU{�d���6

-�D�B�H A\�!�� �����'�R�AD�	3>�Z
-L����
-�FC�)�GP0m*�j*���T
-4� Z
?B�4��v:J�$;�p:�7||����>���xR�a�I�$�/:&!0?1'a~��em�'� ,���'�g�dL���(�5��)�ap�6
n[�6dpބq�a��AɊ'�!E�����Ԉ���2�h�`�E����W�� ����
�ݶe�:�OC�n�=�c~N
�{�A� ���н�H0�OG���Bԟ�B���/D	���(�3HgJu�QN��	}�
a6�X�j}x�!Ơ>�~��P�D���Cfs�%��
 k	�B� T����9��

����}(��b��+�U/��
wL��:���;��C�߇���C�3�?�3�����OӾ�T���_�@�(�N��J��
�%/�mQ}t���?��� �]}����Y����(�ձG��-��毢�lŢ
����\6K!�#!�{���󋋛��.J�S���쀒���]u�I���8��U(����i!�<��
܏�r]�Z���ˁ�o6,x���<ض�[��F
-endstream
-endobj
-4080 0 obj <<
-/Type /Page
-/Contents 4081 0 R
-/Resources 4079 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4088 0 R
-/Annots [ 4078 0 R ]
->> endobj
-4078 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4082 0 obj <<
-/D [4080 0 R /XYZ 89 770.89 null]
->> endobj
-3585 0 obj <<
-/D [4080 0 R /XYZ 90 699.155 null]
->> endobj
-4083 0 obj <<
-/D [4080 0 R /XYZ 90 694.672 null]
->> endobj
-3586 0 obj <<
-/D [4080 0 R /XYZ 128.643 554.246 null]
->> endobj
-4084 0 obj <<
-/D [4080 0 R /XYZ 90 547.606 null]
->> endobj
-3587 0 obj <<
-/D [4080 0 R /XYZ 442.087 409.337 null]
->> endobj
-4085 0 obj <<
-/D [4080 0 R /XYZ 90 402.697 null]
->> endobj
-3588 0 obj <<
-/D [4080 0 R /XYZ 90 264.428 null]
->> endobj
-4086 0 obj <<
-/D [4080 0 R /XYZ 90 259.945 null]
->> endobj
-3589 0 obj <<
-/D [4080 0 R /XYZ 128.643 119.52 null]
->> endobj
-4087 0 obj <<
-/D [4080 0 R /XYZ 90 112.88 null]
->> endobj
-4079 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4092 0 obj <<
-/Length 2323      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�F~�@^�dU8����l�&�Sq
�Y+O��E���
-I0 [�>=�

��D��@
������0FT7�?�L�=�߯.'�

2����:08P� !�l��Fgo/�LjD�����xy����k{o��r���-
�T�@J����[
���sP̌>�A��S������	�Y�,u�A�da���ٜ`���p�[/�����*�T
-I�s������VH�b��vn�p6��L/g\OAvz���Q'C��ƕ�d��QDq�p��x�)7���8^����rF�t
����4�hD	s�b�tş"�M1�1� �i-�hXl��G���p>�b��a��x��G7�4?c�ӈղv�(Cژ`�!�$}.�<
W�^
7Wa�O�LW��tR�H'�N7�ӧ�v�NcB�
-�� &�}bB� ߈Er�J�zC/�o�}5ct���LMo=�aAz����s�2�Xe��$��:d�䅦e��<�A�U�B�WO޽~�����H���'�������7��ļ��9�i!�%� � �z h_ *"Z�˦};�����#�A�|����vmo�=��Lɐ)ծ�֜"0�el�k �[�hu��
����0J�G,i��#���r$T�@A�%Y�E=��+(^O�7Ih���[טr�q�LV��!�0�')�e\g�:�쎇po��E�}�
���-w�X���Ux��[�uDhC�<~L�Ԭ�4+#�خ�R�.g��#DT�
P�S
m
�
?xz��k0���18�:���r�1�5�v�`�� �˱��h���1݆+��Q2��$���,v�$�m�(�.�שW�!=����g,s�t-⚓���c��{DBd��
C�P@�M�_�$r
-���zv�+b��E�)׋�ާ	����C.$�}�卤H0��M��2�hY�2
)���V�v�e��߅��N\�������qΪ-��b�m�;��D=���^�ʖ���Y�=�$�y&�q���:7ܲ�>N�mz�ی
-x>Z\�C�4����a�qۄ�c��
 #Z�>!qL�y�m;����F���-��f�洈<$-b��<pl� 3'<�[�ӏ����=�P$%
���)�
�#��u���r��֣�3�!vc�Yİ8�t�s,�(ri
Ś���cA�[8���q#q�9 f�t�і

ҫ�c-�0�?9�	
-��-�V岛cَ��C/�ִ�w�b����w
m<�=�c�+n��b(���
�U���6�%��
o�VP��/5�� ���	~�[hWV��,,��Ša���b8��A�Xe��E6��XA�Y���9�#�A��@��QC���P��yW�B�=sJN�
-c�%\T ����=r�.��#\ ��
��˸W���|CtW�@��kT��0!
�c�Y�Øh�p{+�NoY�c����e��.�S5ʑ+���h�R
!?^��Q��J}D��Ӥ>���>��B}�iF}�a��K�c�kqvz4|QPD6q�l����<X
�´ ]��w�

!‹G$
�M@Үi�� rt`;گ�
��{?��&M8�#im����x���Έ���I�@��i�׸�n��8�t���}@T/�V{����a�RP~5�]�M�Z��Y0X�D]s��$�w���9'�o��c�T���dE15h�i��nSM�y��o�ۄi���u{�/%��OT�V�p���A,�= 
���8ʱ uG�
�I��� $� 
b}4�<<
g�"���A�̃>

� H�y���x�=�xЌL�e�JF��a�
-�K.��7�B�h�bЇ�R�����
�S�-`��O�:y�
FĨ4�1 ���s���,�’��H��;K�����Y��s�T��ϒ�М���滳$�xX�ܥ�,Ɋ��� �4�ޜ%��Y�����7y�o�F�&O=���1�ǰ�vf��
�����'A
�_�	_6(#H�H��p�~@1ռ��
�!�C��2=w<dΙi�_�w�_J���.�=N�
Ѕ5�C�����n[�E��s��Ѫ��^Ηo|o��`-Gx��]0vń����x�z���^�����zay�|f��"T{�0�J�t��
ѷ����պ���J��!_4���ՎC�`�l�~�5�_m�'0�E����<I.�{S�+��D��cw3&�p��ObV����y)нT�ET��0�:z׳1u���Ջ��}��c&�4C"�/��E�Sl)�f_��ɾ�Pa`4������0
`j�/���M\�+�`{�Ȫ����WǛ}��A��N�\���.a"@�ԘM��hkq��T>� S�;w���
-endstream
-endobj
-4091 0 obj <<
-/Type /Page
-/Contents 4092 0 R
-/Resources 4090 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4088 0 R
-/Annots [ 4089 0 R ]
->> endobj
-4089 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4093 0 obj <<
-/D [4091 0 R /XYZ 89 770.89 null]
->> endobj
-3673 0 obj <<
-/D [4091 0 R /XYZ 442.087 588.309 null]
->> endobj
-4094 0 obj <<
-/D [4091 0 R /XYZ 90 581.669 null]
->> endobj
-3674 0 obj <<
-/D [4091 0 R /XYZ 90 443.4 null]
->> endobj
-4095 0 obj <<
-/D [4091 0 R /XYZ 90 438.917 null]
->> endobj
-3675 0 obj <<
-/D [4091 0 R /XYZ 128.643 298.491 null]
->> endobj
-4096 0 obj <<
-/D [4091 0 R /XYZ 90 291.851 null]
->> endobj
-4097 0 obj <<
-/D [4091 0 R /XYZ 90 146.942 null]
->> endobj
-4098 0 obj <<
-/D [4091 0 R /XYZ 90 112.939 null]
->> endobj
-3676 0 obj <<
-/D [4091 0 R /XYZ 90 78.877 null]
->> endobj
-4099 0 obj <<
-/D [4091 0 R /XYZ 90 78.877 null]
->> endobj
-4090 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4104 0 obj <<
-/Length 2408      
-/Filter /FlateDecode
->>
-stream
-x��\m���~�b��.�H_E?؎ۤip��_jYZ�	��E�չ��S���h���>���p8�3#��p�E�=�킺�����������n>D�FZX"��FobF�LF�R_'����b|{�p��O��t=��q�~=^?]]=���S�}��������x�&#.i�|>�l���:a&N��4�,h� �w7?\|ws��éш�S�D�h��x�FS|�4��>f���������Գ1�
e��1F�L��Ta�6]<�ݔq&�/qT�I���e�K>“��Հ��C�
/
-�o��.
���M�7D�x�?����	L�iA���ҿf�&rP����<ױN'��|�L��}�
��o3W�ǜω5�r����Dj�y}:�l�n���JE��^KK 56c��o��������k
��sV�������/.����O����:
!����`����[k
��~ۦ�i:��	�h*呲h����kI�e�(V�V�����H�C/�� v�^'�1��&�����P�ZB���oJ�1���=�N��[��,Q��4Y-7�@dp����������C(SAL-�K
b������Bvc�+*�
�P�H�o�6�P�� �4D
r T#�^|�AvY}^	{�z\Ng˻��uH�Rg���`�1t,��J�
���Fo4$w����zbYob�RyH(��V�0)���ҋ@e���"��:uX=}�宒��
`G�C���F�J����H���{Q�A�(�+
�Cs�<�_7
H�
��(fxGp�ފ4�4������s��X o1_v� RuXy*?��&h�aD
���9�����<.
n��g�	z�jD�]�m��
�ÈFqnԴ-�;����"��8�r;���1�L&���H#�֬���|��� H"�L��!1s�!��P#�#���'hL���
���>Dk'�)q
�8��QЃ^�[��
�]
ڂ�QՖե�h�vA4!�"Z[Bg�!�h��i�!D���o~�pS�z�{D5�֠
��S`
Yf`�5{�Z�5k9|��jzoHY��ހp-��(8T�ՑT�r,N'	��|6M��P5��� �ʵV�i�
.
�.'��M]
!z�,5� �溜cG�9@d��rN"%LB=�sN�[9׃޲�������
��CW�K��r:0�CL�nza(�qә	�dM�_5��}0'��ٝ�@zK&��
����
������Y��h�B�؅��Z�-|
�ec�@
�3�e� �}K%i�5s��O,��Eyz�ΓhCo�ׅc}]y���Bn!O��
-��R���u�Z,�}�
�}]O���
��C_���j��Y�9�Us2�5�}a��[]��՜DXk=�c�n5��
��0�	�m{u7
-3��DQ[P��ҝ�^ζO��CE�>t
�p%��}�z� 0����H_s]=���#b�@��r�Gp�tA�Q=:Q�Y����e���
�ǡ�<�>���#�0�G�y�;�{�9��y8Q�w'
=�.�GSu;��Cq�;���n��N�^~��D��ݪh��z+���;Ў�i=4�����Ȋ�6�u�i�㢏�; ִܴ=�w{�:��� Od�ğSH�$�D1�AA at vf�ݸ�(F���H�\[wf�ņ��Z_q�&�G�������h��˟�&���P}�ɝ��`e���e���;�ɇ6��&��mryN
U*�ˆ���LA+��'�"^ͦ��M�X�q��_u0�c!�Yo+�؞���=)��V�LB: 
�V���I��֎
����yO���R�M��MkgRWyn��^]�6�u:^�R�ɿ�_=���v�%�^�K�`(h���*�d$p_�ԅҜ�0�4l@���
�t߰m�)�O��|��3~T��:M�'+����<�rB��|�����Ht��7��
���q�.���lU���FI�d{?+nX�ԗ-}̮l*^ܥKV���z�(?�����U�e�a���<���ʛ��M
dqCĊb�o9�7��H�|x�����?��9_,��Z!��~
-!�]?`�tĐ�=��> 2�|Vۘ��2Y���!S��WfMy�N���*�:o�5[����U[�Y$ L�3
,,$foϱ��������n�§�����uZV��b��\�3�#�~�cZIE��d��v�_��s����N(�)����4]VQ]%X)cع'�СH#�-'��i(wI�u�.�x�tV��ݰ#}l��{g��^ܽ#MaM̡�
i�:�2����٭h\��&����'�ڤ�?;Oy����x^ߠQ�Ц�I�P�I2L?��2
-�I����q����
-��I0�ۇ�����w�tyG&���©a�d]�D
�պ0h��7Y�$��)��aH��'Й���)�Y�
�ϳ�,޸�~ы:x���$�a�
-endstream
-endobj
-4103 0 obj <<
-/Type /Page
-/Contents 4104 0 R
-/Resources 4102 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4088 0 R
-/Annots [ 4101 0 R ]
->> endobj
-4101 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4105 0 obj <<
-/D [4103 0 R /XYZ 89 770.89 null]
->> endobj
-3677 0 obj <<
-/D [4103 0 R /XYZ 90 669.666 null]
->> endobj
-4106 0 obj <<
-/D [4103 0 R /XYZ 90 669.666 null]
->> endobj
-3678 0 obj <<
-/D [4103 0 R /XYZ 90 622.647 null]
->> endobj
-4107 0 obj <<
-/D [4103 0 R /XYZ 90 622.647 null]
->> endobj
-3679 0 obj <<
-/D [4103 0 R /XYZ 90 576.629 null]
->> endobj
-4108 0 obj <<
-/D [4103 0 R /XYZ 90 576.629 null]
->> endobj
-3680 0 obj <<
-/D [4103 0 R /XYZ 90 519.657 null]
->> endobj
-4109 0 obj <<
-/D [4103 0 R /XYZ 90 519.657 null]
->> endobj
-3681 0 obj <<
-/D [4103 0 R /XYZ 90 472.638 null]
->> endobj
-4110 0 obj <<
-/D [4103 0 R /XYZ 90 472.638 null]
->> endobj
-3682 0 obj <<
-/D [4103 0 R /XYZ 90 426.62 null]
->> endobj
-4111 0 obj <<
-/D [4103 0 R /XYZ 90 426.62 null]
->> endobj
-3683 0 obj <<
-/D [4103 0 R /XYZ 90 369.648 null]
->> endobj
-4112 0 obj <<
-/D [4103 0 R /XYZ 90 369.648 null]
->> endobj
-3684 0 obj <<
-/D [4103 0 R /XYZ 90 322.629 null]
->> endobj
-4113 0 obj <<
-/D [4103 0 R /XYZ 90 322.629 null]
->> endobj
-4114 0 obj <<
-/D [4103 0 R /XYZ 90 276.611 null]
->> endobj
-4115 0 obj <<
-/D [4103 0 R /XYZ 90 243.55 null]
->> endobj
-1204 0 obj <<
-/D [4103 0 R /XYZ 90 160.53 null]
->> endobj
-154 0 obj <<
-/D [4103 0 R /XYZ 90 152.654 null]
->> endobj
-4102 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4130 0 obj <<
-/Length 1714      
-/Filter /FlateDecode
->>
-stream
-x��XYs�6~ׯ�SJ�D0N�[��M�$u��q�CK��	E*$U��})��&N�
������-0�"X�|~�`3����٥dA��F��2�q y�D����0>�x�s�"�H
�);}����o�ߛ�ɋ���	�%
G@ ���f��#0�3\�b��M��S�,x?�m�;�Y��F�#B!��,�*]ً1���etx�D�3�(���
��Tt�f㰪�ݼ�+F�r�zg�P�Ëb�MJ=z����
-a�Rq̈@�3�SK�.�$sâ�2.t��+?��ﳗ���̍纬���<�u�

��47c1� ?�/���v*�,�M��7zs�K7����:-����&���X^
JԷ��

��G�U�
G��2�e���f�
�&���C�'߬%ǐ�{
-h�:�yWEv�֋�b�ȓ�������b�������v>�
u�G
�M-A�p��%!��)��6[l�nS���lw��Q�6Q�c<�ܓ�o����_�۳K��(�!��qn0�΀��$�\5{�GDC����
��V���4����#�������_�B�m�Z�Ӫ�*K���1|���?t����*u�TkA at -��SH�}�@�
I�
E���z�V#�ʪ�H��.����v��ʘr:�
�3�I���,�^�>	7('��
8��@�z����:I3�p��y^�[�'|
��
xu>�8�kJD��p�����*�]ݥ
����V���2B8�
D���h
�\�^ �9��v����Jt3)8d�ש�&
�0x����e�l��nJ
b��+O#��8�
-���?�t��_�pU+A�N���,���ⶰL��
W-�M���tq�Q0����Q�(����mQ��N�0
H�0���d�Abv�%H��.a��������|o�^g$��Ҡ���r�hv$͍���6�͆F��W׍f4���-A���.�l
?=��z�yh
�'�A
,����T�K��-Y�0`�|�[})�n,=�I�����$
��X��H1�mt^'�ҽ��B
�6+������
[n�a[K"����Mq���(Vq��Z"1"�XR�x�^M
�
PMhs�
�H�Ga����:�-�g*�??��
2!b�=
-
-ʅ�]&.l�E�޽��x`md �t�%���L•�2
<3 �Xs�IS5eS�~��
Dٗ�r��%CD�n$aHbA��cb����!�?���t�+�>t���4
l�6B���e��6���J}:$`�[���)\��~���A:�$

���b�Ts�vuž�(#&S5��R
c�
-;lP�p������&�2�V�$���y`����K���J
qpf�#a;�9|�!�b�����J]m5���	��d�Ө�Q3&0h�=�ɢCX�@��L���c(<���
��A���C��U�����|��
S����a�,ܭSV��د="@o����L!��LЛA�n �-��U�X�ɵ�X5̡��|��j.u��$��xx��ihѩ�}����͛�'k�k� �0�H{ �,�M��e�eN�6ތ�2}�E=�s$|c~�
�n3�^wV�/�E|�/��D"�Oߟ!�b"mڀ���]l����W</�؞�
���m�:]
P^��t-su��
~�t���^�o���
��zX��lejro��u0
_�Z����9�Gp$D=�ޞ����V�?��5,w��q��>�Z'��(�arc

���7n?Y
-endstream
-endobj
-4129 0 obj <<
-/Type /Page
-/Contents 4130 0 R
-/Resources 4128 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4088 0 R
-/Annots [ 4100 0 R 4116 0 R 4117 0 R 4118 0 R 4119 0 R 4120 0 R 4121 0 R 4122 0 R 4123 0 R 4124 0 R 4125 0 R 4126 0 R 4127 0 R ]
->> endobj
-4100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 683.988 177.053 694.892]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) >>
->> endobj
-4116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 610.33 198.921 620.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a67b4e0eba7692bced073431cd3cc22ae) >>
->> endobj
-4117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 580.262 198.921 591.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a5ebec8f5ff32009c4cf98dead90f4a3c) >>
->> endobj
-4118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.258 580.262 274.188 591.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-4119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 550.568 198.921 561.472]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_af2ec3c62388f9aef1414a527e82cd1a7) >>
->> endobj
-4120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.258 550.568 311.268 561.472]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-4121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 521.247 206.669 531.777]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a97b2101d371edae52746a53cf34e4b67) >>
->> endobj
-4122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 491.179 163.215 502.083]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a35ea0c10995c89f8a11a2e8bb5dc7f17) >>
->> endobj
-4123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.552 491.179 275.562 502.083]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-4124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 461.485 163.215 472.389]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a6ab41afc79135511037718442fcad4d4) >>
->> endobj
-4125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.552 461.485 238.482 472.389]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-4126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 299.835 191.727 310.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-4127 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4131 0 obj <<
-/D [4129 0 R /XYZ 89 770.89 null]
->> endobj
-4132 0 obj <<
-/D [4129 0 R /XYZ 90 703.796 null]
->> endobj
-4133 0 obj <<
-/D [4129 0 R /XYZ 90 629.85 null]
->> endobj
-4134 0 obj <<
-/D [4129 0 R /XYZ 90 629.85 null]
->> endobj
-4135 0 obj <<
-/D [4129 0 R /XYZ 90 598.422 null]
->> endobj
-4136 0 obj <<
-/D [4129 0 R /XYZ 90 568.727 null]
->> endobj
-4137 0 obj <<
-/D [4129 0 R /XYZ 90 539.033 null]
->> endobj
-4138 0 obj <<
-/D [4129 0 R /XYZ 90 479.644 null]
->> endobj
-4139 0 obj <<
-/D [4129 0 R /XYZ 90 430.367 null]
->> endobj
-4140 0 obj <<
-/D [4129 0 R /XYZ 90 284.237 null]
->> endobj
-4141 0 obj <<
-/D [4129 0 R /XYZ 90 261.455 null]
->> endobj
-4142 0 obj <<
-/D [4129 0 R /XYZ 90 261.455 null]
->> endobj
-1719 0 obj <<
-/D [4129 0 R /XYZ 90 68.617 null]
->> endobj
-4128 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R /F117 2446 0 R /F8 794 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4153 0 obj <<
-/Length 1647      
-/Filter /FlateDecode
->>
-stream
-x��Y�n�F}�W�CI�\�{3� uM�Mܾ$�@Kk�(E*$����ey�(Y�$E"���ٙ3gf(�,
��:���\\K�h����#�������%	�'c��#�
�U8��(v��ai�Y8}�ea�pyy%�9}�6YX���S�ݧq����so2�(�$3FI@�K�>ܾ�<��|�@�
R��H*g������9|����i�|����2�����?&�9F����Gs<�EҜS{>�%d�x4���
�p�&�'և@1ĕla�  �#
��(n<F��
!n��]S$�:
��� �A�|��@V�#@��݂� QiE@z�vX��%�Ǔ��*�l�/��1�'���� �@�f�)xWQ��N<
��82���H���%盛Y��2S���x��_֙��(MrTB�\�=$�H�ZPC�!Jf�fn�p�n%gH��p���[AZ� -�#vG
-2�Y��v� %��%
-s|��K
-D��xf�0�+�@��|�E��|(�8�u7�7�]6���l�2IV�������2j�i��T�o��,LR"���te5�X
�
���(Y�_�ǘ��r�"�����xO)�z�s�z���RȷV� v�&�W5
�r�΢j�-�N��s`��6�p���I�k$���l�(CX��	�
-$Ԗ���U��ה��Rl	�VhA�U`��z��ʘ.JO�b�,�	�r�C�f�]��<�����:�l/����
�&H�V>aH�~��� x0�CQ�
-s����0|�B��n��'
-:,7�;(�q4���+��3M��$�Ro�A\�ħ���FuG�\�MҼi��i������ӫ�7�?��y�����ŵ�s
�
n^�9�f��C��P���j ��t�oL�ɒ�ka�`��]4�J�?���-3%ĒJ
��:�B��%�#��
-T"f�{�$p��U�stp� W�5�`�Q8��i)d�#ŭ��=a����:+ '�J^� 7�<n3�I�•�)(��H�P�8�V1���
Z_�
k
�l=��b�
��4���
��a(i�)ؒ�����
-��a��pL
�1��#���d��F�,Z,���!�U N��F��K��;"��
��ީ��>q0�b��>�msF
-4tz��w�ٞB_<�M�L
f_�6�A�ߴ�����0+kO7��+(��T�����P;K�M�;�l/98����4%4?~��e�'�@8z�`
�qN��q

�ǁ�< ��:���I�p��H��Y2-�S��@1I�8�[��^_j������o��?�������_L��`�,/&J['��8�bb�a(!i�/c�4W+�؄��R���_cf������Q+����y��7�phӃї�I�L<��A��Y?X§�����Cy�YYb���
�.��
ƦEl��W�瞨+��aO����4.��9���hC���r��>�J����Q8'���V�l��+������M)�[jw�~�ۿ(	
-e�
��R�Ǣ�g�� �u���ps��37ُ
�n��U�l��k��Oeq0Yު=AUÍ<� v����ߎ��}RQ��C_Ļ�vY�ˋ���"7�͠�e�
a�2��8�436�媪J�*��#��܁�7� g~�c"�Q������6_\��bγ
��h�b�v
-endstream
-endobj
-4152 0 obj <<
-/Type /Page
-/Contents 4153 0 R
-/Resources 4151 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4088 0 R
-/Annots [ 4143 0 R 4144 0 R 4145 0 R 4146 0 R 4147 0 R 4148 0 R 4149 0 R 4150 0 R ]
->> endobj
-4143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 428.318 225.481 439.222]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a3bb2c0ddb1b766959ee6149bb52a7e61) >>
->> endobj
-4144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.979 428.318 291.602 439.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a35b06cfa8331827b55846da95b222287) >>
->> endobj
-4145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 402.258 224.644 413.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-4146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.378 390.302 230.03 401.206]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common_aa26b7ac0a5822f668664afb29033b4e0) >>
->> endobj
-4147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 364.242 224.644 375.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-4148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.378 352.287 235.569 363.191]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a5621564b142adc0eaee14971b379084c) >>
->> endobj
-4149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.367 90.193 219.683 101.097]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_acbf26ad2a67dbfbd24eb9c89448a793b) >>
->> endobj
-4150 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4154 0 obj <<
-/D [4152 0 R /XYZ 89 770.89 null]
->> endobj
-158 0 obj <<
-/D [4152 0 R /XYZ 90 721.073 null]
->> endobj
-4155 0 obj <<
-/D [4152 0 R /XYZ 90 653.858 null]
->> endobj
-1720 0 obj <<
-/D [4152 0 R /XYZ 90 567.413 null]
->> endobj
-162 0 obj <<
-/D [4152 0 R /XYZ 90 557.969 null]
->> endobj
-4156 0 obj <<
-/D [4152 0 R /XYZ 90 446.394 null]
->> endobj
-4157 0 obj <<
-/D [4152 0 R /XYZ 90 446.394 null]
->> endobj
-4158 0 obj <<
-/D [4152 0 R /XYZ 90 418.6 null]
->> endobj
-4159 0 obj <<
-/D [4152 0 R /XYZ 90 380.584 null]
->> endobj
-4160 0 obj <<
-/D [4152 0 R /XYZ 90 325.835 null]
->> endobj
-4161 0 obj <<
-/D [4152 0 R /XYZ 90 276.809 null]
->> endobj
-772 0 obj <<
-/D [4152 0 R /XYZ 90 215.341 null]
->> endobj
-166 0 obj <<
-/D [4152 0 R /XYZ 90 205.896 null]
->> endobj
-4162 0 obj <<
-/D [4152 0 R /XYZ 90 106.272 null]
->> endobj
-4163 0 obj <<
-/D [4152 0 R /XYZ 90 106.272 null]
->> endobj
-4151 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F22 2996 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4223 0 obj <<
-/Length 2146      
-/Filter /FlateDecode
->>
-stream
-x��Zko����_�O����G�H
�p�$���{��(r�%�8��,wI����(�Ņ��v��sf���[3
[ߟ=�]�t��!Ϧ�5��<l9�C†o��~@�=�u���lφY���7��W�Ƿ귳����g~��r\+������n�`a�<׺���
>���ٿϰ�#*ԥ�0����f� B�7���̣`8��
���T����"	�(M�J�F���xi��%6�̵`"r��e�Tt�Z�G�A 2Kx�����;}qn���3c�����L��()e�iH�����Uc>`��J�B~
�ӹ웮%� �h����k�����m��k�9�FD �]����\�`�J��?�!s�N��$��v��\����m�i�.��B��%!x��D(�ڝ>��
�Q�!�
�:
ZqD<���C�ػa��A���+N�ܐ���U��<,��}(�Ɨoei�,�>$�@
f���

dSZ�
�� ȡǃ\��s ��4����_L��^�j_��\��N
��1
"��}�Γ�H	��إ��`�2<�\�
G���y�E����
�X&��������Ǒ+�x\��Z�"�����:���~�pn�QCl��zI
-S�܆���y!{�Lm�z^��p��
�5��
-���AC2�}�Coð��O∉f�~bVL��
�N�c'=�bN���>�6��
#�Hp�#��?�$�'}d{���=�G$�H�f�ie�0Jf��P�=��P�~LZXd��)�X��R�)��������S�C�����.'�.'��?M�`����
�
�p�
��
lσ��K ����.R��
Rp�pi���z#Fav�
=�!��.�R���5�QM+��Ƒ��/g/���5DЊFC|SiU�
�b�,��n���@)[Lmx��P���n�"FE��$�wh:��
����Q��2�� �
�V��Q�t9��=5��1D �z<�3�=(9zf��(����,�=_
��Q�[0s ���N�̼C�	���a��p,)XSPvr,m��G
f,�4_N
-0Ȥ\f�0,˴��37J&�e)OJ�M���� 	k�[&����@�L�ʛ�`�E�GL�}�bq~zvP���J��|.e��doȏG6�_��3�o'��u!#9(r �
�{B
!�a�,$�Nʽ��G`�P~jet4�L�P�Q?&4�ܥy��	��9}
-jcĸ8fG�/�(���8��\��<j����
�T��*����@�}%��ȶ��R�|v{y}�z4��B&�_V��	�M8=q��PU�;�E��k
-y��Mq^
)�
��>9:�މ��
r�Q~�<�o�
�
o�\O$8"6?Jx0Բf��x�<�f�E�d�k�%�l�q�4��_6�X��S����u�c�����s�}�'�\��G��(�z3M?7�o� �͏Z!�c�UIzҝ��k��b��-�w��Cz�#
-|�r����� �¨�(�Y�3͍�{?3�b����
N Qm�`��^�'������7���
��O�U|��t�_T��d�@N��2��f�-J�o�k����wWoo�֦
�|��"�eژ��<��e�$�$s��Q�|�a��H��L��<55�n�W-��j�:FQ�<(V���*IoAk������Od�l�롨\N.�~�[�q;�����W7?]��z��1qS7����	�l��Mԑ�N�� V5�A��Iu����nX�Vs�
M����e8ow�w�J��h�0��_�du�2Q�Ml
-v �w�}��-ldX5MUvA�u�������DW
iS$��4�
-?bD���-�#�ې�v��#�݇��
 	ȉ��y���B꽕2j�*
-��}
 �
���w�
��j5	�rϡڞ�R���:��i�p��I͌A�("�J���i���;�' �g�6b�;!A_�
Vn��J
�o�̞�}+e�e0���$[�f%P���/�NN�@U=��C���7S�2�
�\_��u�@�m������8�
���D� �U���~���r������z��qq
3�E
-�Zq#�7jVo��
�\�8�݌�,=�c���'}�3���T�c
ꕟ,Ꞿ2�'�
2/�&��ΐz�Y��Z���T����G�m<|,�����t1�Rj�`G�t��ZZ�mվRg�q�7�i��7�ޟ����
-endstream
-endobj
-4222 0 obj <<
-/Type /Page
-/Contents 4223 0 R
-/Resources 4221 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4088 0 R
-/Annots [ 4164 0 R 4165 0 R 4166 0 R 4167 0 R 4168 0 R 4169 0 R 4170 0 R 4171 0 R 4172 0 R 4173 0 R 4174 0 R 4175 0 R 4176 0 R 4177 0 R 4178 0 R 4179 0 R 4180 0 R 4181 0 R 4182 0 R 4183 0 R 4184 0 R 4185 0 R 4186 0 R 4187 0 R 4188 0 R 4189 0 R 4190 0 R 4191 0 R 4192 0 R 4193 0 R 4194 0 R 4195 0 R 4196 0 R 4197 0 R 4198 0 R 4199 0 R 4200 0 R 4201 0 R 4202 0 R 4203 0 R 4204 0 R 4205 0 R 4206 0 R 4207 0 R 4208 0 R 4209 0 R 4210 0 R 4211 0 R 4220 0 R ]
->> endobj
-4164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.762 685.198 216.096 696.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a9e6044d3d1b8cd66b7e150763a0cce2a) >>
->> endobj
-4165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.912 685.198 255.099 696.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 657.547 182.144 668.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ad02ce2da26b1d9dcd0d45042b9f5c3e5) >>
->> endobj
-4167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.959 657.547 221.147 668.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 629.523 206.692 640.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a15090c11a17afcd60289117320991a0a) >>
->> endobj
-4169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.508 629.523 245.695 640.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.249 629.523 309.266 640.053]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.478 629.523 373.495 640.053]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 590.165 206.941 601.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae0cdf58c61934d284e497bb509596fde) >>
->> endobj
-4173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.757 590.165 245.944 601.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.498 590.165 309.515 601.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.727 590.165 373.744 601.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 551.182 191.737 562.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.236 551.182 237.396 562.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab76731fc33f60619d339fd146af90e7f) >>
->> endobj
-4178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 523.157 191.737 534.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.236 523.157 284.996 534.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aac61a0c0f3a687ef1d79d9014238554c) >>
->> endobj
-4180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 495.133 198.363 506.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.861 495.133 250.646 506.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a319084c6ac93db482a8742a58e2e01f3) >>
->> endobj
-4182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 467.108 198.363 478.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.861 467.108 298.247 478.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a5f1ce9b2af5f6ba550cd9080ff83077c) >>
->> endobj
-4184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 439.083 191.718 449.987]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-4185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 439.083 288.852 449.987]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae627d4ce07125a5bf6dbe4c4464bfacf) >>
->> endobj
-4186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 411.059 191.718 421.962]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-4187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 411.059 303.079 421.962]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_adcd50fc4fa1b8e5533d7af0513d1a833) >>
->> endobj
-4188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.635 383.407 188.679 393.938]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a88ea295438ef6e62d77b24c099f2b9c0) >>
->> endobj
-4189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 355.009 181.845 365.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a818b1050a44c6fb4d635a6fc088eeeca) >>
->> endobj
-4190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 326.985 181.845 337.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a84d340c4e2a8a35e81d0fb91ff2c466e) >>
->> endobj
-4191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 298.96 154.727 309.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac72c231542712976d1f9223d0537f5d5) >>
->> endobj
-4192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 270.935 176.864 281.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abeb3e0b3cafb96de2ab53e985c574bb7) >>
->> endobj
-4193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 206.163 143.695 217.067]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab4b097033191e38bbb59add2ebba3e70) >>
->> endobj
-4194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.511 206.163 213.154 217.067]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.317 206.163 382.706 217.067]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-4196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.537 206.163 457.784 217.067]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-4197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 182.188 143.695 193.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_acddbfcdd0e7dd70c2258493ef67d0911) >>
->> endobj
-4198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 182.188 189.632 193.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.196 182.188 282.662 193.092]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.461 182.188 426.213 193.092]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 146.258 143.695 157.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a389e6681289ba2b90a1eaad6eff80a50) >>
->> endobj
-4202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 146.258 189.632 157.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.939 146.258 347.405 157.162]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.204 146.258 490.956 157.162]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 122.283 143.695 133.187]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3f2210364b954a8d532905d09bcb7149) >>
->> endobj
-4206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 122.283 248.859 133.187]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 98.308 143.695 109.212]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7fff251a8cd2ecd8b928175af94d7069) >>
->> endobj
-4208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 98.308 248.859 109.212]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.388 98.308 330.333 109.212]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-4210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 143.695 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7ded037fa4c26b2e12565d3aa2c6b70b) >>
->> endobj
-4211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 74.333 247.176 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-4220 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4224 0 obj <<
-/D [4222 0 R /XYZ 89 770.89 null]
->> endobj
-4225 0 obj <<
-/D [4222 0 R /XYZ 90 704.257 null]
->> endobj
-4226 0 obj <<
-/D [4222 0 R /XYZ 90 568.506 null]
->> endobj
-4227 0 obj <<
-/D [4222 0 R /XYZ 90 540.482 null]
->> endobj
-4228 0 obj <<
-/D [4222 0 R /XYZ 90 512.457 null]
->> endobj
-4229 0 obj <<
-/D [4222 0 R /XYZ 90 484.432 null]
->> endobj
-4230 0 obj <<
-/D [4222 0 R /XYZ 90 456.408 null]
->> endobj
-4231 0 obj <<
-/D [4222 0 R /XYZ 90 428.383 null]
->> endobj
-4232 0 obj <<
-/D [4222 0 R /XYZ 90 372.334 null]
->> endobj
-4233 0 obj <<
-/D [4222 0 R /XYZ 90 344.309 null]
->> endobj
-4234 0 obj <<
-/D [4222 0 R /XYZ 90 316.284 null]
->> endobj
-4235 0 obj <<
-/D [4222 0 R /XYZ 90 288.26 null]
->> endobj
-4221 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F39 2320 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4305 0 obj <<
-/Length 2211      
-/Filter /FlateDecode
->>
-stream
-x��[ms����_��\{�Q$�x��ݙM�v�7msߝ�;
Ʋì
,���������c7ٝ͗@@����������y�s��1
y6������X
b6�74�t	Fn�`���=��A6
��
��d2���,�Ad�ׯϓo������#d�Gb�Н�+;�A6��^B���_z��Wm~�Љ��o&A��N)��~ϣ]>M'A��>�Y��]
�p�#����v��;vt�
"�`�q�p���;6�p�#�s����԰�	ljq��o+`W�%Оi�0\�B
ׂ�©C����>�E��u ��<e=�u�����SS��y���d$�cA��Y7(�L��kP�� Cĭ@�F��b䰪	*A��:{g�%
-N��"��
-� j�#_)e��$��X�|�c|9e�0%��!\����8/�͆�E��b�b�������q�j{/7<���	�/�tV4u3�M�sY��F� �ȶ`B��Dg=�������d��N��vdS��=
�o�x�̈́�nc;
�k,�������@wN���A�����E��j1څ��O�hG
dYފ���!`!�b��8�r��;4=�Z��� Y�c�Ԅ
	�S�������v����]���j�����듯E&�V��7D7�n5�m��d0ܪ��[\�[T�}�k�~��i����珟>\�|�������h+����:�]�?�����]
��]��@cD�<��m�0`fU��Mn�F�l�L꾘(ʵZ��˺��"'q0�ma�p=g��1�l71��
N���fa^K
<
gaں,����
�;��
``�Q ���F��h.׬Φ/�
�`uV����>S�y��>I��ӻW�R��)�o)��?~V^�]��C<o��)W,q�
,1V�[ [...]
-?m���d�n�Ox]�Lz/g��;�aj��8�#?Z
-�jf�K%��t��5��,���az`�,У��N�d�{NRYT�� ���������P��$�c4��<.zՈ�ZP5Le	�R����*�bl6�h!/��]Դ\�0.���A������Ѽ�pj�j�����0�9�Q�F�0���. �lX�:��9�Rm���}Yڮ��B�~�PV��M��l��E
�A�7PL"�v�b�!*�+�{Q�A�y��d�F����rAfmעT'�@�?X���t����a���7��/y���
�a4��VAV�
Md�G���ףVs�Eʲ��r��!��'7�Oi
:8���v���nx1�ЭrV��W��yX��r����$�E�\׬��pl�(�%����

-� 3��m�S�z��	���y���K�M��Y9n����J��Q��!��#�?XZ�+́ز�(�"��ZN�V�5�U\�J����q�.�>�rM����U:
$�d;Q��>�� ՅXd3�[���$	�u��(P�A.=~d��ԡM����9&="��8�^��<��
�0* �=�����x-�4�$�(,+"������s����ex	��M�+S�� �E�\�nmXG��0�Ì�E��C��� ���A2��/&}P�X�$���j�X�Zs?����<���{�ď�VéF������:u/��]��J��O�^d���m��#�t�,
-�Fg~/R� ;D1K5�'W̊j����\d�kv.1.��Q�
=�di��{��{}�}b����
���bt��2������i'\4bw�����d��P��ɰ�Z���&��	R��񋵕��A��׸sc;�\|�6����&�1�����I}���{�5�Z}�C�����n:&"�<HK��si��B��k�#Gſ��ֿeo�M6�Ջ��&�0�vȩu�T��?ʒ�
1	Y�:@3W� ���[��|Sa�D~w�nM�V�n�Sj�˖�,�2�d at b諭}}}%O����_=ƺJo�x�?��%�j#Ȑg�&��k���0���.�m�Y��j�(��gg��8����t]K����ّ.�L��J��ⴴ
�#�qd� ۦ	 ��F�8-[,��7�������4. x�����/
-endstream
-endobj
-4304 0 obj <<
-/Type /Page
-/Contents 4305 0 R
-/Resources 4303 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4320 0 R
-/Annots [ 4212 0 R 4213 0 R 4214 0 R 4215 0 R 4216 0 R 4217 0 R 4218 0 R 4219 0 R 4247 0 R 4248 0 R 4249 0 R 4250 0 R 4307 0 R 4251 0 R 4252 0 R 4253 0 R 4254 0 R 4308 0 R 4255 0 R 4256 0 R 4257 0 R 4258 0 R 4259 0 R 4260 0 R 4261 0 R 4262 0 R 4263 0 R 4264 0 R 4265 0 R 4266 0 R 4309 0 R 4267 0 R 4268 0 R 4269 0 R 4270 0 R 4271 0 R 4272 0 R 4273 0 R 4274 0 R 4275 0 R 4276 0 R 4277 0 R 4278 0 R 4279 0 R 4280 0 R 4281 0 R 4282 0 R 4283 0 R 4284 0 R 4285 0 R 4286 0 R 4287 0 R 4288 0 R 4289  [...]
->> endobj
-4212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 697.079 143.695 707.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a9de293fc5ed59d0122ccd78839b1a668) >>
->> endobj
-4213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 697.079 247.176 707.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-4214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.263 697.079 329.207 707.983]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-4215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 673.331 143.695 684.235]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a04732c1c89db2f6d76b3b9479ec2fb99) >>
->> endobj
-4216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 673.331 255.485 684.235]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 662.453 143.695 673.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_addca3baab772ce17fb5133b0c4e60c33) >>
->> endobj
-4218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 662.453 255.485 673.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.995 662.453 341.94 673.357]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-4247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 639.62 143.695 650.524]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7a1255c5cac46f6115750121e97136e6) >>
->> endobj
-4248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.405 639.62 216.566 650.524]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-4249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.992 639.62 346.459 650.524]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.444 639.62 513.996 650.524]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-4307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 628.038 150.878 638.569]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-4251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 591.961 143.695 602.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab81be8ef47b7e0e260d2d9a361eb6e8b) >>
->> endobj
-4252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.716 591.961 243.984 602.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-4253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.407 591.961 372.873 602.865]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.014 591.961 513.996 602.865]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-4308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 580.38 177.448 590.91]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-4255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 556.258 143.695 567.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af623edfed6d4816ac5573f42a6a1e801) >>
->> endobj
-4256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 556.258 218.962 567.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-4257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.155 556.258 317.621 567.162]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.42 556.258 461.172 567.162]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 532.509 143.695 543.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3c827da439e915a61c30e404828e8d32) >>
->> endobj
-4260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.032 532.509 191.286 543.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-4261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.417 532.509 287.883 543.413]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.682 532.509 475.707 543.413]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
->> endobj
-4263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 496.806 143.695 507.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0acf30ed848cc95eb3c888c0e16952ec) >>
->> endobj
-4264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.228 496.806 282.649 507.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-4265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.937 496.806 443.403 507.71]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.3 496.806 513.996 507.71]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 485.224 203.46 495.754]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 461.102 143.695 472.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.435 461.102 195.241 472.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac8a2f81fc1c5b99600d406300792119f) >>
->> endobj
-4269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.578 461.102 241.178 472.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 435.523 180.198 446.427]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_afcfef0ae2edb80d19b21b211f7523971) >>
->> endobj
-4271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 435.523 202.614 446.427]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 373.958 190.738 384.862]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 373.958 261.85 384.862]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a286412c3f05e82abdf69c5e5562ff949) >>
->> endobj
-4274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 348.379 190.738 359.283]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 348.379 262.159 359.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7e1a00f36570e89ee95817d898587743) >>
->> endobj
-4276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.225 334.917 390.082 344.822]
-/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
->> endobj
-4277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 322.8 183.824 333.704]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac86971c152fbb8d2d486d7396ad6b142) >>
->> endobj
-4278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 297.595 192.272 308.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a901382835b88fb9969d88eea101ae7cf) >>
->> endobj
-4279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 271.642 241.935 282.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a339a341a2f7d60de83e4feb3e8986558) >>
->> endobj
-4280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 246.437 189.901 256.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a70638e55ff0529f6f481db703645be05) >>
->> endobj
-4281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 220.858 193.229 231.388]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abd6b88d6fd6e0259faa544106b08aeaa) >>
->> endobj
-4282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 194.906 238.459 205.809]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a055f3030915a1b7de0cc50761d9a3245) >>
->> endobj
-4283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 169.7 187.689 180.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a573ac186b0da77408bcb80531ca0090c) >>
->> endobj
-4284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 169.7 226.693 180.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 145.578 205.692 156.482]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-4286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 145.578 261.312 156.482]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a8e45baf04a16a09cfa25bac864515832) >>
->> endobj
-4287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 145.578 332.156 156.482]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-4288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 121.83 205.692 132.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-4289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 121.83 261.312 132.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3c8e578089e8420dc286b27411fde2fd) >>
->> endobj
-4290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 121.83 338.781 132.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-4291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 98.082 205.682 108.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-4292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 98.082 261.302 108.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a36e39f75a5b973533a044d606444db4f) >>
->> endobj
-4293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 98.082 330.462 108.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-4294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 74.333 228.895 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ace7b6bb6c1aabdf57f1643e88a834aac) >>
->> endobj
-4295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 74.333 333.482 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4302 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4306 0 obj <<
-/D [4304 0 R /XYZ 89 770.89 null]
->> endobj
-4310 0 obj <<
-/D [4304 0 R /XYZ 90 476.288 null]
->> endobj
-4311 0 obj <<
-/D [4304 0 R /XYZ 90 450.709 null]
->> endobj
-4312 0 obj <<
-/D [4304 0 R /XYZ 90 388.955 null]
->> endobj
-4313 0 obj <<
-/D [4304 0 R /XYZ 90 363.565 null]
->> endobj
-4314 0 obj <<
-/D [4304 0 R /XYZ 90 337.986 null]
->> endobj
-4315 0 obj <<
-/D [4304 0 R /XYZ 90 312.407 null]
->> endobj
-4316 0 obj <<
-/D [4304 0 R /XYZ 90 286.828 null]
->> endobj
-4317 0 obj <<
-/D [4304 0 R /XYZ 90 261.25 null]
->> endobj
-4318 0 obj <<
-/D [4304 0 R /XYZ 90 235.671 null]
->> endobj
-4319 0 obj <<
-/D [4304 0 R /XYZ 90 210.092 null]
->> endobj
-4303 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F68 3032 0 R /F66 3179 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4391 0 obj <<
-/Length 2000      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�8��+|�BՠH�eY[���g�w�=�LQ�]��I�_�-[
�v�ɰSTF�nw��[2ؘ�x�y~�9�MC aS۸
����id|���}�|k��������O/_}��P�u^]vn:���0�
c8�|���\~k`d
-ǸK'�
���j\t��`m����6a�f[�6baDa�	A�d�|�q�����5!xm��1��a"�Y��D�&�$o��S���?��?]d#��D�őC�:��<��e���I�g
�,�
fZ�U�#�{+�j?j;kBE"�
c��:dc�t���G��
��3� h�k��S�#���E�uS�
-w_�
��
����E8�����X: ��`6��ӠGY�nS���
3<
�(�����^Ady�_&�L���J2���.Bp�U�����?3�T4�j��� }N��
~�e�㇀�$Nw��{3�_�y�ID�)�xS��x�Y���B�iw_r�� 
J����R�Q2���XI"�4z�K��=�� �}�X�X���Y�l��!"��< e�ti�Ia9���D�

t��(O�v-1�Z�nю(S�q6��y�X�V�ĦV��%ZV�
֒W)[[<��6��������i+��)w��P��:E�Cx�,��^?�n����Z �a����Dҭ;M��0�!8�'�
�pFN��X'�؏4�U/�o�/C7���zr(���(�P�YVcn�o
x~�
�ev_��&m���,��f� 5�yZ��u=� 1C6�0��ݙ�3�01 ��g@�Ԕ-�4�-0���Ǖ
�P�$)TwT3�r��eS3#N3�
��9
��0f��af�]p	��
>�8lK�N[�<�%�x$�b��e�җ�+�
U�t"����ǖK�D5'�ٗj�/�Ž٤Lz�*��,�jegS8�q�tCy�H,����d�Ѧ���Al龦x@ˈE=s����=��D�jE���QB��P�w����J���z�ץ�
�Q�@�ՀQ-n��,�`�F�W�2�ҏ�Gq�ދT��f(\M|�&�3�D.KOS �:F�y%�a�L�(�ĢMq��3�M���#��s"\�Իq�
�3�nw�ŋ2M
�ǶXx��
TN����6�;�Am䈆����j�D �^�=Q���	�8����biQ8.9��X�c��[�^�Kq�Y
�N3��o�@Ow=�������C~f���m��l&�
�C��"/���oU��'�yb�h^C� U���L+)�e [...]
-���׉?��(o']ݭ}p��>#o���67	a�\?hsk�w�*��UC�
�)�B�+o
2ًJ!g��{.���FQ��
s�`��&Y�M�ę(0u��'&�(��*��ƑT��*�s�@�9�>��$A�6|�i�D�@gp�9�A�^��Z�4x��T1
���ꥱaY4 3!�O�
����
a���P�]�b8����S��"���.�x��3	զ�<�}*��
'-�&(����
-iYٖ���5y�x��T柷`V�i�����N�`

;k
-
�"�z�UI?B�
-.*9e�ֲ��X߾��@��ꈭ�l�
-$�d���%���^~�0S��<"T�	*?*a�����_q��寭���ȆF���h�4��O2w@}�:&~�J�0��x
- 
{�S���z#f�S�
'(�	U/{TT
y%Z���J���&Z]��� `۰�=	 ���BB5'�B̜���A�C���ڴ)��l��͵-��H�y��������8�2�G_8�cf/��y����7�v�Dr� �zN�\�y�>~�
 ��/=ƺQ���'��WػU�/��6A���M��2��̮�f�S���v2��x����U2��?AÍӰ��a���8�{� \�lg��8�
-�>x�
-endstream
-endobj
-4390 0 obj <<
-/Type /Page
-/Contents 4391 0 R
-/Resources 4389 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4320 0 R
-/Annots [ 4296 0 R 4297 0 R 4298 0 R 4299 0 R 4300 0 R 4301 0 R 4334 0 R 4335 0 R 4336 0 R 4337 0 R 4338 0 R 4339 0 R 4340 0 R 4341 0 R 4342 0 R 4343 0 R 4344 0 R 4345 0 R 4346 0 R 4347 0 R 4348 0 R 4349 0 R 4350 0 R 4351 0 R 4352 0 R 4393 0 R 4353 0 R 4354 0 R 4355 0 R 4356 0 R 4357 0 R 4358 0 R 4359 0 R 4360 0 R 4361 0 R 4362 0 R 4363 0 R 4364 0 R 4365 0 R 4366 0 R 4367 0 R 4368 0 R 4369 0 R 4370 0 R 4371 0 R 4372 0 R 4373 0 R 4374 0 R 4375 0 R 4376 0 R 4377 0 R 4378 0 R 4379 0 R 4380  [...]
->> endobj
-4296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 696.988 229.503 707.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abb6e0e38bda55fc988819da21f2689eb) >>
->> endobj
-4297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 696.988 334.089 707.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 673.057 187.264 683.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a40ab06947d065a171792da1ce6ed2505) >>
->> endobj
-4299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 673.057 293.213 683.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 673.057 371.148 683.961]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 673.057 455.727 683.961]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 626.213 187.264 637.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a90cc17398be6745eb507339397381d7a) >>
->> endobj
-4335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 626.213 293.213 637.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 626.213 371.148 637.117]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 626.213 455.727 637.117]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 614.257 220.058 625.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-4339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 579.368 186.348 590.272]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1039be5680ea8eceb903367e1e7aa13f) >>
->> endobj
-4340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 579.368 293.772 590.272]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 579.368 373.367 590.272]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 579.368 456.837 590.272]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 532.523 186.348 543.427]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a9ffb692c7f3bd8af9b81135e38b38dd7) >>
->> endobj
-4344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 532.523 293.772 543.427]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 532.523 373.367 543.427]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 532.523 456.837 543.427]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 520.568 218.404 531.472]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-4348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.772 485.678 187.446 496.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a4cd79f95aeca1043d5e56dcc194bf096) >>
->> endobj
-4349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.73 485.678 292.979 496.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.431 485.678 370.447 496.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.745 485.678 456.762 496.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 485.678 513.996 496.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 474.097 159.485 484.627]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.603 474.097 240.62 484.627]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-4354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 438.834 180.496 449.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a5307e5cfaad0770ede6799ad31962d71) >>
->> endobj
-4355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 438.834 226.434 449.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 414.903 213.153 425.807]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_afe3a91955f4b6b81c8572e60b3e263dc) >>
->> endobj
-4357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 414.903 259.091 425.807]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 390.972 213.163 401.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2ebf93b52454102cd99eaa211ad6ff71) >>
->> endobj
-4359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 390.972 259.101 401.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 367.415 161.677 377.946]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2f964d43c2798bde1924e82d88971ea2) >>
->> endobj
-4361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 304.878 205.752 315.408]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac5eb33b72a86a33d7ae4685d376b50a6) >>
->> endobj
-4362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 304.878 276.595 315.408]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-4363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 280.574 209.627 291.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aacf7b2a7e0bb5007ce8cd9506d06137d) >>
->> endobj
-4364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 280.574 314.791 291.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 256.643 248.202 267.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aa366a38561684a64bc0a042702534a07) >>
->> endobj
-4366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.018 256.643 329.845 267.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 232.712 212.377 243.616]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab85f80c281c840eedb4f228757b8515a) >>
->> endobj
-4368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 232.712 289.846 243.616]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-4369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 208.782 216.252 219.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a92ef9a99d160f55e3fc44a4bd1ae78f2) >>
->> endobj
-4370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 208.782 328.042 219.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 184.851 254.827 195.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a736577ec65f40b0637f13486e64f051a) >>
->> endobj
-4372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.643 184.851 343.096 195.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 161.294 236.745 171.824]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae862a635387c2458da51889c20465f0c) >>
->> endobj
-4374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 161.294 307.588 171.824]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-4375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 136.99 240.62 147.894]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6d2f7819b7359865679b24e683231303) >>
->> endobj
-4376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 136.99 345.785 147.894]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 113.059 243.37 123.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a944e2c41213d3ea40e74930a90de97bf) >>
->> endobj
-4378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 113.059 320.839 123.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-4379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 89.128 247.246 100.032]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a22f9ceb879f1c8d892f60fb3d9577d81) >>
->> endobj
-4380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 89.128 359.035 100.032]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-4388 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4392 0 obj <<
-/D [4390 0 R /XYZ 89 770.89 null]
->> endobj
-4394 0 obj <<
-/D [4390 0 R /XYZ 90 382.319 null]
->> endobj
-4389 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4482 0 obj <<
-/Length 3100      
-/Filter /FlateDecode
->>
-stream
-x��\mo�F��_�O9	����\��C{= ׸��-S6q��t߯�Y.ߵ|1Ĵn�%r�3;;�̳�K���/�y������I��z�0x��AB·���K��^]�����e���������>�M����M$��^}}�������7�4z$RBw
��
��5i	!�j���O�^(4�U���t�L���.H��%xy�2t 
ݕ�m���^��."�0c;������
��q�H��f��/xq
��[`Č^��7�/8e�w�xw�
\7
,qSM���'!F�+��R�
/[�|)��r;G��=�QrW��C�ʎ�
���J,a|��!N�$��ۡm�

�����`'/6�
i�)�^�1l�a�0�v�(��,.	E��cZLBv_|p*�
��h�
7��
-i�ʩݸ&-I֦�l�=$ޞ
k��X�Ŭ7�Yt��
���+u�_�5�J�=�ǘ��H�J��>J=*R�-۠��:.rIE�Z�ad�W>����x���c��{���/�����a��4���c��c|\GY�䓕~�?���ži����Ío�	CF�( ��,<���q�~}�����!�P�켾:���s\��a|�B��X�'��
6��(�M"��q���˶:l}s
-YMP3eN�؜r$���[��;��S�0=������M���}��:}­�DW.�!H|^/����^_B����(�sB�xkh�:��%��h�x��` pzb�y=�H����	N?q[ޟ�߅��\�@:OP����6�f=A ��6K0$U;�r�ȇ1`�q9 .�aq4t\t؏Ut���
�	i�Ǹ�
�f�4l��dq����7�&O_��a �F��+Z +2:g��
&)̖%�JgM�*9���s���V��\h��LN�$����H�9�*��/�`f���9�t	�[H i�F��nbz"��Q"f���1L�7�����9�z.Ε�
d�kn`�%�� �9�jr�x��]Dc��tA`"�L\��
����:ڮC�4�l��t�ڄh
-�F
s��k� �U�+�\���n	�t���C��amV5�R7�Т�5�存-��
���&),�
GC���Y�mJ�4�,yGMV�ш�!�����L-$�Ki�f����m>�
v�W�9+pK�p�	����M�F[ˇ�ab�}_�D�[3m͔�U^�g�Iќl�̅�i�?����!��h
k�����;��=�f��d.0�q*-����X,s��#F&
XX��=�bf	�,An{ei-
- at z�I�G|X5V\��+�}}���ݫ� 
�I �� �z��
�W
����8J����q%��*}r|'/�
ޭ��:�w'uA�ꌲ�}�(��`�nW�.G�>�}�A����1	��㺶�
��f߯a5�M���V���ի\�:	�l�O�F</V�=�,zƇ}�!��ԧbqw��,�L
bC����:
#)�LTQֻ���[�&ȳ��
�8����'�`�s]
-�R΄5� öt;7�}���!.�^�ǣ��—
>�
�T��J�AT��;tD��UT�4�C�FǩK4O+��H�CyN����ѻ��Q�Bh���84���@\��t�fݟk������P6�I	7��԰z���X�u��ީ�kQ����������Dw��O:���_�S
-
(��
����W3�8�1
-��`\������0`A/`��!��Ft��[>�4
.׀_�K��Q�´�
�P
w �9P�@�M��Ȳq��P��]@GכĻ�Og����^� Ȓ�E��4m�j���
�a�
4̘1��2G9�m��L��1�t�Ǖj2���ϔ:Q�{�k�̵}f��KV�N
���3H�I/ i��y�}
 ���/��^� �~$_g�
@Ұ�RM��aP̞m_�
J��]�I���ޮ�ׄT���l��@m�-wy�b��qS��Z�$�.}ܿtE�1B�Gp��s��,4�#\S��qϲ�)d�\USFt�j
-R�P�z��
��'P�(E�&�R.9`2����)��xZ
@���WBv�u8�l�P at XWJ~X	�,��Ӆ�IQ����h0C��
�Ve�r8Y�B+���ʵe�ѣ=
	� ���}��K��R���|�2��^{ �VG|�#�-�e_�H����jbN�C!.(
}t�q��Uy�q�t��Z�iI�'�2Um�5�.�8�r�8�
nGh/�����:8��(�j��j�
5W��ն�$�ǃ�
D"
���:O�R�����8OX���	��L�L)k�	+�ˌ�;�t!d���<l
}\�����.
-���C�"!_�(
-�tQ
��.����� )�
-��Ԝ�/ʾ`m����/t�/X;_�e��_��I�8�V"l�X�%��,���
6m���)�黻z��)>�<l/U��U��Q=����>���
�[����պ]�ȥv)��9��%��@��у"mFj���e��CC?��'�eO��nepG<���Qxf���s[,@����ɽ����h
��d!�$�s���B6+�f�YP��vʇ1pv����X�@Iw3����

-ڮlX�����j��c3�rK��M&�}�Io2��7��퓝�5&� ����� 
�18�Ha6	��<
��>mY�3�NBO"�����x{_���
|��(r�F/v7����i��n�� �É�ϩ:�H�^1�Ν�
*�N�Ӭ�:���� t�:ͺ�iV��7V�f�
-׺�_�`E���&� �n-�w7� �v�E�
-�־�2� {j�#&�y��Y���+
�F�JA{.��g�R�
S��%)��)����K-�5 X��|".5 {�C��j��3<�@"0
�=��y(�2
-1J�X�gS��
�gpgx�A��>�n8k;�uϕM��d���%�.��]��>-u�F��aS�������WH@��L�%�{��{���4L�bO{���A���j���-L�s
�#�ِ�ޅ�؜��]���e�H�N ��K��Yv|uuu�p���
�
��a��A�>�P����Tg��Y�<{�@J;
-
l[��`�_/0�D��4�����f�`q���=[�� ���s� 
-endstream
-endobj
-4481 0 obj <<
-/Type /Page
-/Contents 4482 0 R
-/Resources 4480 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4320 0 R
-/Annots [ 4381 0 R 4382 0 R 4383 0 R 4384 0 R 4385 0 R 4386 0 R 4387 0 R 4414 0 R 4415 0 R 4416 0 R 4417 0 R 4418 0 R 4419 0 R 4420 0 R 4421 0 R 4422 0 R 4423 0 R 4424 0 R 4425 0 R 4426 0 R 4427 0 R 4428 0 R 4429 0 R 4430 0 R 4431 0 R 4432 0 R 4433 0 R 4434 0 R 4435 0 R 4436 0 R 4437 0 R 4438 0 R 4439 0 R 4440 0 R 4441 0 R 4442 0 R 4443 0 R 4444 0 R 4445 0 R 4446 0 R 4447 0 R 4448 0 R 4449 0 R 4450 0 R 4451 0 R 4452 0 R 4453 0 R 4454 0 R 4455 0 R 4456 0 R 4457 0 R 4458 0 R 4459 0 R 4460  [...]
->> endobj
-4381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 707.957 230.598 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a685232ed211cce61f5d27727d979df94) >>
->> endobj
-4382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.935 707.957 301.442 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-4383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 684.118 234.474 695.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abd0fb1fa2293b2ca367d1ba5eba12106) >>
->> endobj
-4384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.811 684.118 339.638 695.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.167 684.118 426.81 695.021]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 660.652 193.577 671.182]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a87e906459b095e23114ee8f0025086cb) >>
->> endobj
-4387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 660.652 232.581 671.182]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 647.685 248.845 657.59]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-4415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 625.853 193.577 636.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a9ff61047ef1f0f33fe206ab471aa4025) >>
->> endobj
-4416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 625.853 277.691 636.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-4417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 612.887 247.177 622.792]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-4418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 590.681 223.465 601.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3daaa36a6bf749e0b4d66ce57878e2d0) >>
->> endobj
-4419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 590.681 269.402 601.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 566.841 229.552 577.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae70fafb10013762e436a434564d7e931) >>
->> endobj
-4421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 566.841 275.49 577.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 543.002 266.673 553.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ad9dba7a094763a47be44e246c1120fa7) >>
->> endobj
-4423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.01 543.002 312.61 553.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 508.203 217.109 519.107]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a161c87c94b78fd1111365e185d0a3ae7) >>
->> endobj
-4425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 508.203 263.046 519.107]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 484.364 271.126 495.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_afb683aefdda7a1c5dcf92ee2a03daf81) >>
->> endobj
-4427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.463 484.364 317.063 495.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.863 471.771 326.259 481.676]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-4429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 449.565 198.26 460.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a06c2ce3f0789aba0294da43628b50226) >>
->> endobj
-4430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 449.565 236.665 460.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 449.565 353.317 460.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 437.984 246.458 448.514]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-4433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.306 425.017 269.939 434.923]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-4434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 402.812 223.206 413.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aeb7acbeca4ad92485f92bf3ea7bcc60c) >>
->> endobj
-4435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.022 402.812 262.209 413.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.285 402.812 357.7 413.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-4437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.268 390.219 288.464 400.124]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-4438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 368.013 212.768 378.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae1509738a054a1ffeb070a35c41db257) >>
->> endobj
-4439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 368.013 252.959 378.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 368.013 375.145 378.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 356.432 286 366.962]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-4442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.401 343.465 277.928 353.37]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-4443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 321.259 250.099 332.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abd266a7d827fb77e09de63dfea2f9d58) >>
->> endobj
-4444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 321.259 289.446 332.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 321.259 379.512 332.163]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-4446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 321.259 513.996 332.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 309.304 416.369 320.208]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-4448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.304 295.502 439.335 307.668]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 274.506 261.881 285.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a17182f3f0d9242d5821ba59b2773ae55) >>
->> endobj
-4450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 274.506 300.286 285.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 274.506 388.504 285.41]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-4452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 274.506 520.199 285.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 262.551 416.369 273.455]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-4454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.87 248.749 449.708 260.914]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 227.752 250.748 238.656]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aace7b1f85601837554656295b9c90dce) >>
->> endobj
-4456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 227.752 357.317 238.656]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 227.752 456.145 238.656]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-4458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 215.797 202.344 226.701]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.005 203.204 446.071 214.16]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 180.999 261.881 191.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae8b96392adb007f1c59758cba8cbc886) >>
->> endobj
-4461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 180.999 365.272 191.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 180.999 460.793 191.902]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-4463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 169.043 202.344 179.947]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.222 156.451 466.67 167.407]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 134.245 239.984 145.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_afd20bc6142cb1206b51b0b449ebf4273) >>
->> endobj
-4466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 134.245 280.82 145.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 134.245 405.104 145.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 134.245 513.996 145.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 122.29 171.361 133.194]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 122.29 478.077 133.194]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-4470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 108.488 432.092 121.646]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-4471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 86.288 251.209 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3d107d8f8a78a3925031545c8e1d1a73) >>
->> endobj
-4472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 86.288 290.549 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 86.288 409.969 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 86.288 513.996 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 171.361 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-4475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 74.333 478.077 85.237]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-4479 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4483 0 obj <<
-/D [4481 0 R /XYZ 89 770.89 null]
->> endobj
-4480 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F66 3179 0 R /F42 531 0 R /F67 3037 0 R /F38 3426 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4550 0 obj <<
-/Length 2732      
-/Filter /FlateDecode
->>
-stream
-x��[�s�6��B�Ri&�� ���f'��<���$
-�2�(R%);��o��S�ñ��\��"��b����b��|�G?�<�<9}�9� �����(�#�
���>���'\�<r��H���j>{������
�����ɟ'>��
���lq��<����FN���b�R~���ɯ'��2�U���ٸ+eY�G�D��DzL�Y9�:.W����%�;��c��1v4!�K�8�k��&)5Qo|: z�e1q��Hф��\�Q_�q~m��W��&�K�=���\�Y��E����`�R�ܘ��O'���U��bk��zB|) �D�qUI�F�V�/
�P�yʉ8K�ӑ-TK�^5h�8"�S�j�
#
-l�	�O��
sA��'�r��:/h�#RՎ�
�7\�
���԰���E�EU^ؼ��5	����(u
!�N
��wJ("��N�7�
c���!j�`bE�-�3D]x�T��}���U���l�y��Q�h�i� �Ԭx m�o1HoQ���AW布wӀ"��Q0
-jL�H)�����0cQ<Γx��
��d!BX$�R��B�!/I�3<˳����Y�������ޗv~}����D9]��f*qm����?D9���rP�P���� ��w�/��*��F�]xU�z�umSӕ���,$�+�xS�i�,��!
��Dk
�>�c
	
��Yz�͗y�ϓY���4/W�>߽��D1��I�
*�µ��q>5q���������`� 
��r�����B���B �$�U*��BT6f�@$��E�x�[`
-�ҁ�<��J�/'>
��"�m��qC�a�n����ܧ*ה��W�
��u(j�}'��(EVmf!�= l�؜�ٛ[�$
-�x�����0
,�x�X�E�`|&I�(ɪ�b]Vb1p-�v\�a� z��9�
q���Y.�b5e�&S���U&
Kfv5̦jޟ�j
V7�ћ<���XS\�Y�/�,N�"n�x���iU��V���F"� ��A�B�HnC�&pȤ6�)i=�" �-�ᤎ$M�[Ȃ!Q0���k�����k\�˰�!1��
��:�2��r�n�
-.�3�Y
-�a��7���
|�{x����_^�������Cҍ�r]�lW��'��T`6��b�
=._��c 6Η�&ǐV�O����fJ>����`n��+�E��`�TT��]�@�c�?�O�N��S"�[��Z<K�< �H�~,v�p"		'���Y��>�5 |
g�����a޻��
ɕ���|
�2�_��Ɨe�Ҿ
Ov_�_֍׹���T�W��oqWE� vή�I�ي��.E�@��>��;ȥ�"n��l� ���d�=��}KN��`É���JO��!�Af
t訇����薂��
�T�VdQ
4���n�C��%�Oa��{���"��3<��U�M$D}�)cKA��j�sH��F.r���i�q9�ܝ	�ec;���
Y�A�����'O4�+��G�̴�7E�\:�Q�]l�)��?U�?f��YT
-�?�_����D��iy�kݪ3��
"*�v��F��1˜�c<駻�vv���.�E�����qyS������J�^L�v��+� >اԡ����ײ�4Ҵ6�=
#��<�
��*#dOe�?�0B}���M"��1���v��2{cLm�
-�8�pD�=,|������/��`:`Z������!_n�|�
�����Rͽ����nˁH `��ˁ�O`�J�MX�̲��l����5���r��j�b�`C9�8MI%�P	��U-s}<��|�����|�ܚOU*���]����J�����*�2N�(�}�<_,u�A�
n��i���] �$��;�p�XBZ̦K�yj���a4
�Ϫ�,���(-s�$�k]Ę)���
�R��Rz
]��If(������̆tӚ�W�n"��9G�%F�����jd���ju�i�=B
��Z{�К F��@��2������8�k)���=i�^K��Is�>d����8	�<��'�0+�X�!�N/��v�|���ɾ�s�d�k�#̽]�����9�FD0�[��
�":�̤�D
/�[����j����� :�n��A����4�)���U�B������@l��(�J,��#���lV�g�m8|���*���� �=���
ᾇ��;��
bG�_����E���
-�8��G�
|���	�����6\�L��/
t�+�K������u�pڄ�L��w��v��SJ��fyZ�:��,�|@����<�ͼc����vY���wh���ݰUc���q.����긂1wU�}��?�vF��rc"���G��ڍM��\�75�G����P�n��k)*��vb�^���ڶA����'_�^C����q�ܥ���l�b V?8��u�k¶�	�a��r �$�ief����𭮬�ֵ�����������R��)�ox�9
���<����
�n�.�A�͏�����]��L^
��Sm�<@��cbo!�\�z��X��oB�eY_]y
�S�0���~ǽ��}m��d~#��5����/�9�(J�'�̼!_>�?�:
]�@�
ҟ'�q#�G����X�1
��
g�<f-�)�
�)�^E�'�{�o�-���/�៥(~�EӲΉ�U}�Xj�\:m�`��.�N
p.FUZ��4b�C�鬇>.bmi禪�ONO�V�Rds4��
�){
 \��y���Kh\�m��6�
-endstream
-endobj
-4549 0 obj <<
-/Type /Page
-/Contents 4550 0 R
-/Resources 4548 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4320 0 R
-/Annots [ 4476 0 R 4477 0 R 4478 0 R 4504 0 R 4505 0 R 4506 0 R 4507 0 R 4508 0 R 4509 0 R 4553 0 R 4510 0 R 4511 0 R 4512 0 R 4513 0 R 4514 0 R 4515 0 R 4516 0 R 4517 0 R 4518 0 R 4519 0 R 4520 0 R 4521 0 R 4522 0 R 4523 0 R 4524 0 R 4525 0 R 4526 0 R 4527 0 R 4528 0 R 4529 0 R 4530 0 R 4531 0 R 4532 0 R 4533 0 R 4534 0 R 4535 0 R 4536 0 R 4537 0 R 4538 0 R 4539 0 R 4540 0 R 4541 0 R 4542 0 R 4543 0 R 4544 0 R 4547 0 R ]
->> endobj
-4476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 707.071 456.992 720.229]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-4477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 684.884 224.57 695.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6d5097ef9a821f98cb97571eb52a49aa) >>
->> endobj
-4478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 684.884 270.508 695.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 672.303 347.869 682.208]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-4505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 661.068 255.564 671.972]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a96038eb89649898faa9a4355206b72d3) >>
->> endobj
-4506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 635.354 196.297 646.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab34fdd45afee329b70aa329b05ecab5b) >>
->> endobj
-4507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.439 635.354 279.215 646.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-4508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.718 635.354 432.878 646.258]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-4509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.827 635.354 513.996 646.258]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-4553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 623.399 216.491 634.303]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-4510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.094 623.399 362.977 634.303]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-4511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.254 623.399 475.081 634.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 598.863 164.537 608.768]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-4513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 587.628 273.129 598.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2e233c23c81273bd776c73cff35ec60e) >>
->> endobj
-4514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 587.628 352.41 598.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 587.628 495.961 598.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 563.812 275.007 574.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abe59d09769e8f4ee38d79b45a6295756) >>
->> endobj
-4517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 563.812 362.877 574.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-4518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 563.812 472.148 574.716]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-4519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 551.857 233.986 562.761]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-4520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.498 505.844 248.098 516.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.034 469.262 275.228 480.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af3171c1a2a80a801ffef9d620bbe1eb9) >>
->> endobj
-4522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 456.681 363.328 466.586]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.498 434.208 248.098 444.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.034 397.625 275.228 408.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2206a2c7921d483451f7e2366f0f8166) >>
->> endobj
-4525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 385.044 363.328 394.949]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 373.809 214.06 384.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6919ec5aef8459ad9c65bc36e8100d58) >>
->> endobj
-4527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.398 373.809 259.998 384.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.942 348.096 290.693 359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af5edabe0fbfa14196208041ded356c65) >>
->> endobj
-4529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.714 348.096 336.314 359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.957 348.096 454.784 359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-4531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.622 323.559 310.533 333.465]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.498 290.128 248.098 300.314]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.034 253.545 278.845 264.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a54ee0d81e7047f0c89c29fd63af3b778) >>
->> endobj
-4534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.912 240.964 521.824 250.869]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 180.555 289.866 191.459]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aba476c1ff2b0f1cd58f6e76b981cafac) >>
->> endobj
-4536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 180.555 359.324 191.459]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 156.739 290.971 167.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a4aa52c6b939cf0076740afb33dd454e5) >>
->> endobj
-4538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 156.739 360.43 167.643]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 132.924 224.003 143.828]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a070e05c80af78d7c91bee958b9848080) >>
->> endobj
-4540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 132.924 269.94 143.828]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 98.149 254.15 109.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a21711374269e4bc42c158e233fd8d384) >>
->> endobj
-4542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 98.149 338.263 109.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-4543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 284.585 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a929caef76be87459ac964105f4c75cf4) >>
->> endobj
-4544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 74.333 354.044 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4547 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4551 0 obj <<
-/D [4549 0 R /XYZ 89 770.89 null]
->> endobj
-4552 0 obj <<
-/D [4549 0 R /XYZ 90 676.288 null]
->> endobj
-4554 0 obj <<
-/D [4549 0 R /XYZ 90 389.029 null]
->> endobj
-4548 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F38 3426 0 R /F66 3179 0 R /F42 531 0 R /F60 532 0 R /F24 529 0 R /F39 2320 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4618 0 obj <<
-/Length 2066      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�F�� �����0��s���؎"m|q\[f%*<��������^X[�-G�e���������r�`���O���)��&5��R���
1�y�;�`di�c��i�N:�3�b5�8�W�e�$���?�w����G��44�u��+�a#����o�=Z(��J��
Jt��8	�4�)��\��*�U�dbs�\,E�K�
�l�,�D*��2�}�P���C�R�p��=V<8����n[�m.*��7P.f�p��o
h[W,0b!�5�^8� �47�\��
�(LϮ
����k09?��PD�G�P��Nֹ-�t��t
d~tUH�
��z�A�޹
��
���bȰ�2Ƒ�]t�[.�09�UJ�<�e@�NMܘ�C�[�L�!Ӧ�[���m�ő�1�wY�0+�Y9Ź!��Z�rdv�-M �گ�~%"',"�g ��w���:r����
Zv�m	��a�m�6�7y.�^�D]rU���י�.7"tV�|���oF���3�µl�����j	�A���ԁ�H6� ���ꬺ8�b3^vn����
׍s�zP���pdV�6����4B3�=�� #Ѓ����2�w+'򺳶k�v�S [...]
-�~�8�	[/���}�b�

D�t^���w��8>�+�E�d�
�QK=[_j\
ʿ�Ex��p\�{�#�-���,͒�d)3�t3��2���v7�
� ��\��uu����:
c���Y��ڷk��De�yA�,LX�h;F&&�����`�"�4��
�"����/�����G��(S��]�.K�ū_�{q���Z�Y��u�3%�K���J��@_%k�j|C�.<J���n#l�9�\�R�b�΄a��"
���TA���eC�j}JϝDt
	K�l��)ڊz͎bԚދ�S{k����H��TB�q�<,��w���#�ͻ���uk�;
�	��ml�aWC߿-@$���������xg<
 X���f��Tf8$W��67\��N��$g��j��
%9-n�캿�F5��{�04u�C
��-?��_C�H
h�_���J�0���/���r�I
0�,C�1��HF��H�V��V{���#
C�Y�)�%v�A):c(/�V9
-�7�1��䔗z�2�AƓ��o��Φ��vpUr]�wô@CԶ
-^0�5^0���>'/`0�?zZ=0-�1��/�
-�h�_��oY�*�?�
�ղ!ͼ��Z\��آ�6`O�s����֣
I2=����|���l@��
6lD�N���V��2��N�
��"}�݈/�߹f�3��b�� �f�A8�68�Oal`�&������,<?�
��⤩��jk�P�1ܥ�\
�_��
-o�f�o
@��-�گ^h�k�n��3
��r��ȫZ��r#Wn����@�� ~�P|�@�H�Ix�31JۡKJ��GYS��Va��]3��S��x�?�Z��'�OP�dz��CR��8N�xi띂b[�L'�*!�糯���� ���
[6)W��"���U`2f۟�����@M
ٺ��s�c��� �~$F#�%X&2��O+����L���{01f�L̞�����k����z�c'�Y�5�SCKNźa�Q�N�Q*����h�Q�tn���g@���J�:muj�Y��=W��
-�^��;��{�#�\y?���Q�7��:Q��
|O8Q��{X
���9�x�a E�`�,���,Α>L⭑j���Y�t��z�)����/�{"T���E�����1Pap Ă��%����
����{�15��w]�O.3�F�X$�;���I�,#�]�|�qc�Jy�����(�@�U�{�e�㣣��U*�+���6
6��	�–�J�I���

�N*�d)��0A�I�H at 0?�`�#��\�y�_,o,N
����1����?
.��
-endstream
-endobj
-4617 0 obj <<
-/Type /Page
-/Contents 4618 0 R
-/Resources 4616 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4320 0 R
-/Annots [ 4545 0 R 4546 0 R 4568 0 R 4569 0 R 4570 0 R 4571 0 R 4572 0 R 4573 0 R 4574 0 R 4575 0 R 4576 0 R 4577 0 R 4578 0 R 4579 0 R 4580 0 R 4581 0 R 4582 0 R 4583 0 R 4584 0 R 4585 0 R 4586 0 R 4587 0 R 4588 0 R 4589 0 R 4590 0 R 4591 0 R 4592 0 R 4593 0 R 4594 0 R 4595 0 R 4596 0 R 4597 0 R 4598 0 R 4599 0 R 4600 0 R 4601 0 R 4602 0 R 4603 0 R 4604 0 R 4605 0 R 4606 0 R 4607 0 R 4608 0 R 4609 0 R 4615 0 R ]
->> endobj
-4545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 685.31 241.726 696.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a50155ea93e900c22ab4251298fa70bb0) >>
->> endobj
-4546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.617 672.948 407.658 682.853]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-4568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 661.933 249.318 672.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0cb0abcc152d2d7c95a116efd3ea989a) >>
->> endobj
-4569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 661.933 288.321 672.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 661.933 371.519 672.837]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 638.556 240.62 649.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af0b5a67b4316f5fabc76dddc85e01f95) >>
->> endobj
-4572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 638.556 324.734 649.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-4573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 638.556 389.5 649.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 571.518 203.075 582.422]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-4575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 571.518 296.324 582.422]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a4e6787c98290a49ce80b90c008aac5a8) >>
->> endobj
-4576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.198 557.164 309.133 567.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 544.156 287.856 555.06]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a5659d55fb93c1fe31b82a674e2630c13) >>
->> endobj
-4578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 516.794 294.481 527.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1d20ad17015746b2d9e0290631fc175b) >>
->> endobj
-4579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 409.33 156.281 420.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2ece0bdf729fb3120ccc49ba616371ad) >>
->> endobj
-4580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 409.33 178.697 420.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.985 409.33 252.585 420.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 370.012 180.54 380.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7321e2cdc1f62423eef211a89ff5a93d) >>
->> endobj
-4583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 370.012 226.477 380.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.287 370.012 323.887 380.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 330.695 178.239 341.599]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6f66ccd85fdb7cc3afdfe9a9eec33805) >>
->> endobj
-4586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 330.695 224.176 341.599]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.985 330.695 321.586 341.599]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 291.378 226.034 302.282]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a30fb611cd3b23f903e1b5f285c238c38) >>
->> endobj
-4589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 291.378 339.776 302.282]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 252.061 245.522 262.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3a1140c13e71533dd97cc2406cb8fd79) >>
->> endobj
-4591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 252.061 325.229 262.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 240.106 132.511 251.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 240.106 229.92 251.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.561 240.106 344.117 251.01]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 200.788 245.522 211.692]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0fc52076243c0da6c56397ae37cd5194) >>
->> endobj
-4596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 200.788 325.229 211.692]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 188.833 132.511 199.737]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 188.833 229.92 199.737]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.561 188.833 344.117 199.737]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 149.516 245.522 160.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aa50c3a8544e3182f11f4b971c2b185e6) >>
->> endobj
-4601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 149.516 325.229 160.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 137.561 132.511 148.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.42 137.561 234.02 148.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.979 137.561 351.535 148.465]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 86.288 243.605 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a36a9d0801d846225758faab4be3cc7e4) >>
->> endobj
-4606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 86.288 323.607 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 132.511 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 74.333 229.92 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.561 74.333 344.117 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4615 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4619 0 obj <<
-/D [4617 0 R /XYZ 89 770.89 null]
->> endobj
-4620 0 obj <<
-/D [4617 0 R /XYZ 90 590.16 null]
->> endobj
-4621 0 obj <<
-/D [4617 0 R /XYZ 90 590.16 null]
->> endobj
-4622 0 obj <<
-/D [4617 0 R /XYZ 90 561.149 null]
->> endobj
-4623 0 obj <<
-/D [4617 0 R /XYZ 90 533.787 null]
->> endobj
-4624 0 obj <<
-/D [4617 0 R /XYZ 90 466.491 null]
->> endobj
-4616 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4707 0 obj <<
-/Length 1532      
-/Filter /FlateDecode
->>
-stream
-x��ݓ�H���+��A�
��qe�������)w/�E�w)!Y!����u�6�d�-��tf�gz~t7�w�a�U�ٰ3x��g��Tz�Ϟ���		��Y�p��4|�1�1�J>~�����t�!n�
;_;��G�Rڛ,:g��7���x1��o������������3]6_�
�4�&y��a�)B!�
��j
��^�
-܍.���_O泩?ҷ��*���܏��~�>xI�� ("B�V^�25%����`��
���i�E V���I��
����
}��z}B��&��#���]
-�I|�F\����_\�Ǒ���LE�*�y�ȓT�֓DB����+?/�y
����*}�8[�
��a����
j���Ia��B�ʼ-
.2B���a8��%���E��_u��>g��Q���j5�jә	���]���?��#0���zq�/7���T�b�����\�����q��'בL��F���l�#"w��P��ɶ٫��h�����#M�`�et�	dc֟��m��$V��cD��)\��I��u�M�	+|��u�o���%"��B�3����-�

��I�Ҫ��p
Lg����l���)���ä�TZY#R�0����P�W�ג����!� \n�;��e;`k�$�e\� ˨��Mc~�6��Ƶ6�
 ��m,]�XFM�Q���
-:i!�-q��'������8ݖ�@o����P|/D�8턆t��]`bpw>�1��,��1:�?,�	��5�2Hrz
��]M-=��
#�[��G�-��8|�6;�̀W)Z_>�����!$�Q3�[U	E+�m*,`#+���*�12&/�4��O�RjkK�� �c�)��t!���Ԏ؎؎؎؎�����0����S/~Pf�5[𚕿�=��|�fX�Ye�#��lSh�+�-��E�V��H+���/�����_�N��Y�-�I4�������1*-�T�P���#�%8���[UC
��-j��z�t�8���%,6��5pI�5p�������u��}lkDk9��j9
:��Y�
.iC
y\�
�dm��1��M��S"9�9�
bdo��c=)���@�A�
a[ڰO"�EXd�/
\��yIn��q�x(��)�9r�#9�%.16tHw~ӝ/j:_$��HM
hn��ʭ 
jͭ8�2���pܐ[�c̭
�
�����
�~��j�
Sj����+T.gKL"ܑ��8�@�����Ȃlۖ#��%!��!�4�RܞQ�!�S
-�:-���PmgC{BU{v:��M����%yvC��g7CZ�m���e*Ǯ_�]�ED?:"b��
�ˤ
1
1
1Z����-�P)ʶ�ߖʍ\!a�?|�ځ��(E���uҘߓ}0x�`ދ:+��C����_`d��&	2�t�䏴�{�6��g�/�	��N��9��yz
����M�/W�0{�� 
O��v��Ϧ*��K���?��IL��(��2��~
��+?�@�pq����Bn�9\��,�ef�,���D���?
���
-endstream
-endobj
-4706 0 obj <<
-/Type /Page
-/Contents 4707 0 R
-/Resources 4705 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4320 0 R
-/Annots [ 4610 0 R 4611 0 R 4612 0 R 4613 0 R 4614 0 R 4636 0 R 4637 0 R 4638 0 R 4639 0 R 4640 0 R 4641 0 R 4642 0 R 4643 0 R 4644 0 R 4645 0 R 4646 0 R 4647 0 R 4648 0 R 4649 0 R 4650 0 R 4651 0 R 4652 0 R 4653 0 R 4654 0 R 4655 0 R 4656 0 R 4657 0 R 4658 0 R 4659 0 R 4660 0 R 4661 0 R 4662 0 R 4663 0 R 4664 0 R 4665 0 R 4666 0 R 4667 0 R 4668 0 R 4669 0 R 4670 0 R 4671 0 R 4672 0 R 4673 0 R 4674 0 R 4675 0 R 4676 0 R 4677 0 R 4678 0 R 4679 0 R 4680 0 R 4681 0 R 4682 0 R 4683 0 R 4684  [...]
->> endobj
-4610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 683.313 243.605 694.217]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a5418f668bf3b5a8590ac6d5d483d5ea3) >>
->> endobj
-4611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 683.313 323.607 694.217]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 671.358 132.511 682.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 671.358 229.92 682.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.561 671.358 344.117 682.261]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 632.031 243.605 642.935]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae02fa938635a4847617bc270ce5d61f1) >>
->> endobj
-4637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 632.031 323.607 642.935]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 620.076 132.511 630.98]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.42 620.076 234.02 630.98]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.979 620.076 351.535 630.98]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 568.795 239.568 579.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab4addfca3eaf252964b09cb03b12f701) >>
->> endobj
-4642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 568.795 317.166 579.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 568.795 513.375 579.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.473 556.84 203.073 567.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.714 556.84 317.27 567.744]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 517.513 239.568 528.417]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a857138d532c5352b43623e6b5e5a629b) >>
->> endobj
-4647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 517.513 317.166 528.417]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 517.513 513.375 528.417]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.473 505.558 203.073 516.462]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.714 505.558 317.27 516.462]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 466.232 239.568 477.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a507389e04ae54928ad21bae9f8caf354) >>
->> endobj
-4652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 466.232 317.166 477.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 466.232 513.375 477.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.53 454.277 202.13 465.181]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.827 454.277 315.383 465.181]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 414.951 245.522 425.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aaba1e38f6fda99261ed2bd61ec99e369) >>
->> endobj
-4657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 414.951 325.229 425.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 402.995 132.511 413.899]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.981 402.995 234.581 413.899]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.403 402.995 376.96 413.899]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 366.396 245.522 377.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aec5e83677f965ea4672262477c3e9737) >>
->> endobj
-4662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 366.396 325.229 377.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 354.441 132.511 365.345]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 354.441 229.92 365.345]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.082 354.441 367.639 365.345]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 329.796 245.522 340.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ad303b49ba5f16febd5aba07ba6d1b656) >>
->> endobj
-4667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 329.796 325.229 340.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 317.841 132.511 328.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 317.841 229.92 328.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.082 317.841 367.639 328.745]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 293.197 243.605 304.101]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a108121fbb775ce12e17480900dc32516) >>
->> endobj
-4672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 293.197 323.607 304.101]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 281.241 132.511 292.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.981 281.241 234.581 292.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.403 281.241 376.96 292.145]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 244.642 243.605 255.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3271b453d7283448ee3b26406f027c41) >>
->> endobj
-4677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 244.642 323.607 255.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 232.687 132.511 243.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 232.687 229.92 243.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.082 232.687 367.639 243.591]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 208.042 243.605 218.946]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abf26ba6f468ba6cfd016cf8b8ca51b92) >>
->> endobj
-4682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 208.042 323.607 218.946]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 196.087 132.511 206.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.32 196.087 229.92 206.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.082 196.087 367.639 206.991]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 171.443 239.568 182.347]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae51d28e968849dc1fc4ac29475dd89d1) >>
->> endobj
-4687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 171.443 317.166 182.347]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 171.443 513.375 182.347]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.661 159.488 207.261 170.391]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.597 159.488 350.154 170.391]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 122.888 239.568 133.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1089c9be5304fd1f8bba20e462be1528) >>
->> endobj
-4692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 122.888 317.166 133.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 122.888 513.375 133.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.473 110.933 203.073 121.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.235 110.933 340.792 121.837]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 86.288 239.568 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a13a65e37276cb17bf0f92c33e4d135fa) >>
->> endobj
-4697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 86.288 317.166 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-4698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 86.288 513.375 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.473 74.333 203.073 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.235 74.333 340.792 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-4704 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4708 0 obj <<
-/D [4706 0 R /XYZ 89 770.89 null]
->> endobj
-4705 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F67 3037 0 R /F42 531 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4732 0 obj <<
-/Length 2730      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~���S:d^D�t�
�NZ��6n�[$�!�ȶ�3�T�4���Ë.�H#�v����H���;ߡ��� ?
}v�쇈
-)AEpv(
D�B\��U�~F0����N���b���)�����dU��Ӌ".n����o��~z�!
�D�zF�wv��(,B���~�Ban��sDS���u\���xv6Wt�l��J쓷�eR̉�%�
)�匄L
=zyv��18 �
E2Xn����
-
�`Ĕ
>�A� �
����ѯG�9w
,���@!�AD
��(�f�z��!a��H�Ʋ�6Ÿ ,n�����yړ��Q#�v�d��9��'2����={�"*y� {�v��&Aҕ3J���r>}��Q�ެX~2��Lw�>`�Gg�\�u��%��(R�ƒe8�BX�C��R��<=l��,D�����-���!X��H�����,u�VV��㼬�$�X�O0�&E\�ŀ�U�c�Q��;� P�
���Mʧ�f�ge���"`3�_?�.�6�t|@;}�
-*/8TJ��(X0�lܦ� �jϋ���u��P	��e�n�4�<��U�тž
-�PJ�[�!�X�C����8���Ͱ�8C���5.q9'|�J���R�_�h�u�:�� 
�K�e��L�y
-А!��a�ܧsF���	���>��(z
$�V���҉�B�
����C


-$�9
��>�۴
*"��R��
����$ˤ,�"]ߺݻ��d�rZ拼H��2�
O��|�Tɲ���u��
-:q�#��z������7��Y~��:7C�d[$%,\��յ�]T��l���׶�W�zN~9�0	AoQ>@�k�n=�|��Z�3�e���m^��
"f��"���U=2��.�,^��W
��!�	Hcp��
��
�D%��,��]k!֔��
�C��`�O�I14IB�/���S��KS�m�t��t�d��@ϖf(�/r
�
��%����nq�qh�)����z�`D�BTh���ŀ�Q�8�ݲ!آ��P��D��sU�
3�
hg
�'E�Qzrl��Y/�t�Uݨm^;� ��z
���P�Kb7!� '�/)&(zD�k�
V�B��
=
6����]'�W���U��<
��f��P37�F�r���EU3�y���>=���@�
G�!�ơtW����U��6�ܦL3
������
��7�
P����v!(Nń
���b�Ȫ6�f���v]^�E*��M�y�۴��@
!�Z��rz�X0���"����
��{bt�4X�i��2�E�m�`�AP崄����M�t�+���
�E3���p9y�a`\4<Ayn=�)�6�[���m���<�ҵ�V����ރre�cW

�7�Ēf�ztR��U�
�i���dCu�����~���N�pq���$n`Lu� Y�{����$॑�t//s��:�
�� ,�y�qV~i��$�u ���z�֋ݐ2ݤ��>$57I��UmH���U�7�����:�հ-M$�ݺ�::�V�'��$�z����.��-�鷨�NL�4I
ɓ���
�ȗf�Ɵً�Ś��@kA�"�Tk&Z3��#�`fg�8j��}>4
b�Ei��Q8�Lݹ�<>
���kF4���h�λ�m at N(ܴK
�9�N�5��=#?�3���f��$a� f@�9J~f_�/L86�]�
-����H�?
-
ڣ���!�8RQ���}'	$†��H��L�%�/׉�t2��&>���t4�3G�=���W��|���@@!�%���@�C�O���i�N���4��}���4_l2�}r�]�˴�x��f���J�ҥ�.]�|*���S�����
���mz��n��&��ƴ�&��|��gV)%
�PD�8aNm }*�y��J_^����k_�w�o�K ���
|����A�
-(� ����
<ؓj��<D�R%��=�v��E}
- �ԃ�Ά��pģ��T֧�B �|e��T�/j�V穇MC�ks�^?}�q�s�R{ �
6����
�&h!����ǖh�vo4a�K���
�J!�� �]R�Az
�^W�w
����T�-4	sf�aCx{
�=b���I� z��u�x��Ə��L��K����i8� 
-8��92��
��q����Ș
����9����r�#��Y���`(�"��DדȀ\�Tq�#���Q엇�_����
�!.*! �+o��\Ъ�{'9�fr�V��'�	�/6R��M���0g��%��.'H�ay���'o~>}��߯���R)�~o�;NT��'�OT��4�ܮO˶z
�vOm���l�
��9c�l���^ey�����w�ux¾$�p2�'�JP�;��>Ն��퍩z{��>t���XN��C>i�0DTFF��DcO��1m;�	�uDX�\�}
~AI�	�	��<�`��S�
��
�X��L��/+�|;揤U����Щ��/�J��Ԉ��a����-�����=o��8؃2�&�s�F�^
���*H����/
�C
��Io��
O:(�H�����g���Ɵ�ᠽ�
�W lm����;��B�����(��D�=����=Y�
^�J�����k{���]7�s~��]�UJ���Ci�&�#}Žg��k�U�Ϡ��בqL�
-�M�8溪��Ϟ]��$�B���Q�ء�p���M^4���a�+��d��`�0l�	p�_P�1�a��νyYOt��ڰ�En;��&���
-endstream
-endobj
-4731 0 obj <<
-/Type /Page
-/Contents 4732 0 R
-/Resources 4730 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4741 0 R
-/Annots [ 4701 0 R 4702 0 R 4703 0 R 4723 0 R 4724 0 R 4725 0 R 4726 0 R 4727 0 R 4728 0 R 4729 0 R ]
->> endobj
-4701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 696.002 156.281 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2ece0bdf729fb3120ccc49ba616371ad) >>
->> endobj
-4702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 696.002 178.697 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.985 696.002 252.585 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 671.095 226.034 681.999]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a30fb611cd3b23f903e1b5f285c238c38) >>
->> endobj
-4724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 671.095 339.776 681.999]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.148 572.578 117.749 583.482]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.986 513.538 125.586 524.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.17 392.8 213.77 403.704]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.732 380.845 218.288 391.749]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-4729 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4733 0 obj <<
-/D [4731 0 R /XYZ 89 770.89 null]
->> endobj
-4734 0 obj <<
-/D [4731 0 R /XYZ 90 657.521 null]
->> endobj
-4735 0 obj <<
-/D [4731 0 R /XYZ 90 608.883 null]
->> endobj
-4736 0 obj <<
-/D [4731 0 R /XYZ 90 367.271 null]
->> endobj
-4241 0 obj <<
-/D [4731 0 R /XYZ 90 344.894 null]
->> endobj
-4737 0 obj <<
-/D [4731 0 R /XYZ 90 344.894 null]
->> endobj
-4738 0 obj <<
-/D [4731 0 R /XYZ 90 274.347 null]
->> endobj
-4242 0 obj <<
-/D [4731 0 R /XYZ 90 219.406 null]
->> endobj
-4739 0 obj <<
-/D [4731 0 R /XYZ 90 214.923 null]
->> endobj
-4243 0 obj <<
-/D [4731 0 R /XYZ 240.245 145.612 null]
->> endobj
-4740 0 obj <<
-/D [4731 0 R /XYZ 90 138.972 null]
->> endobj
-4730 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F90 758 0 R /F75 554 0 R /F93 763 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4747 0 obj <<
-/Length 1955      
-/Filter /FlateDecode
->>
-stream
-x��Z[��6~�W������Ւ�Ng�4�$M�m��%��xA
��Ml�,��G�llրN�d��BHG��s�α�3s���xܻx&��!ϥ�3�u<�H�!�¯��O8��t���\��u?����������t���#�vH.@ ��ɲ��=v������y���
Z:�2x.��ޟ=\���
,� B�5�s=R���h�Z��� ��}~< �?[/u��=Ab��0��eP1�¬g
�a=��
v��"���:F
-Q�C�1�V�Sm�\<Pۉ�!�Dq6?�#j�%�\��J����F�����
"��.E������㲔y9 ������~����4��_7�oF���]�2�y����l�rD3Z"�;`���+�F
�	�
Q��#�c�
-����+Ї0ID��d��y�j�3:��0���$p�
+)�Lˮ�C�cY
�V�$Mp�U�K,FQ
D��ѽ
�E��
ҸD��b�O
�8�����jL��}����v,lH�BӺ�?^���
?���d��8Z歴0�$?Ŭ
�&Z
rҴi)���ӫAˮ�4��z�
��^s����d�u
��.Е?��i �"	���݀�%HIr
�[CY��A_;�p��
-gA�Š)+ߐjph���%�>k+��7�����]�"��}4��{^�*��J�p�9BQ���X�
�����W��$\��$�W���GE\
-�硨+��"��:�G���o
I�ܐ��bH���I�fZ��t��`?�yW�Vq�&��͛�=�m6f��《��ȧ�Xl�;�m�i�����H�h��3+���
-���z6ߚ"
�1{����71+�Q��4nL�:�V3��m�,:|�����~�{M@(pXuhTgH�z��v��04�y5�#
����uė�:?5�D�b�=�L��E�Z�M�\��C�������Cc
QO�aP��A�g=n s�z�q��I�& {Vr�Ql��@~ dH �
�Q_��p����
���%f�s�ȜwI~�P���!?�h$?5��? ?'_�~ ���.��k��Q1�<�q{�G��B���C��Rn�٦�]��ٮ�@
Y������꺔l�ԟ���_,6�*���ձ��P@�uE9-
-��J@��ד4��vy�q���
�C�<]�Q:�Lt��F��:�]���:Ա&q����=�5V
9��skWylW/$�CL`�s�z�8��r!Gl
u֒��r�����,g4�%x@�&���&)�9u��*yF���T�Ø�Y�66
���E��㻨�~P#e)>�R�P�-*^2�B��g#Ň�W��������H[�Oa&Ɉ>g��w�J�~߂�3L��C��f��N�
�̈U
��
�{"
�'�i�UDf�`�<�k��0���
�x2RkI:
��p�����`z��&�7k9�a��Na?Lkw���,x
�jM�)�鬾��<�
��d�����
U�-�I:���❤e��/G��Udҍc��$s�Q��znDb�:���d
�H������|�H�Ej,X�n/�U�r[�;Z��'��=P��'����gp0����s0�R�?���	������Y��u��w.1�gD�)��
�<\���U/�XY�L�u���Ai��]�T'�8���7j6W�$�����*��%D�i�����ݯ
 ��.�m�\b�pL!
���R$�����R�H�u����E�~
�U��ﷺ|�t�Ė��pyȕpY|�a��nӏ�Ef��80[�e⾕xN�n>���e�
�H���<1g���[��O>ν�
	��"��
 ���f�������� �!����j;���c;.^,��k¶� o�X��ry�A��E����U��+��!�V	~��u���&��_����(����!�d�Jk�!s\����e)@$vb����t5���Y�
��$Z�O
��=p�۴� s�(��� �	|
p�S��\�
-endstream
-endobj
-4746 0 obj <<
-/Type /Page
-/Contents 4747 0 R
-/Resources 4745 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4741 0 R
-/Annots [ 4742 0 R 4743 0 R 4744 0 R ]
->> endobj
-4742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.658 594.396 439.839 606.914]
-/A << /S /GoTo /D (index_intervals) >>
->> endobj
-4743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.658 454.933 439.839 467.451]
-/A << /S /GoTo /D (index_intervals) >>
->> endobj
-4744 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4748 0 obj <<
-/D [4746 0 R /XYZ 89 770.89 null]
->> endobj
-4244 0 obj <<
-/D [4746 0 R /XYZ 240.245 711.11 null]
->> endobj
-4749 0 obj <<
-/D [4746 0 R /XYZ 90 704.47 null]
->> endobj
-4750 0 obj <<
-/D [4746 0 R /XYZ 90 618.272 null]
->> endobj
-4245 0 obj <<
-/D [4746 0 R /XYZ 90 571.647 null]
->> endobj
-4751 0 obj <<
-/D [4746 0 R /XYZ 90 567.163 null]
->> endobj
-4752 0 obj <<
-/D [4746 0 R /XYZ 90 478.808 null]
->> endobj
-4246 0 obj <<
-/D [4746 0 R /XYZ 90 419.829 null]
->> endobj
-4753 0 obj <<
-/D [4746 0 R /XYZ 90 415.346 null]
->> endobj
-4754 0 obj <<
-/D [4746 0 R /XYZ 90 313.526 null]
->> endobj
-4321 0 obj <<
-/D [4746 0 R /XYZ 90 278.856 null]
->> endobj
-4755 0 obj <<
-/D [4746 0 R /XYZ 90 274.373 null]
->> endobj
-4756 0 obj <<
-/D [4746 0 R /XYZ 90 174.685 null]
->> endobj
-4757 0 obj <<
-/D [4746 0 R /XYZ 90 108.643 null]
->> endobj
-4322 0 obj <<
-/D [4746 0 R /XYZ 90 77.486 null]
->> endobj
-4745 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4761 0 obj <<
-/Length 2403      
-/Filter /FlateDecode
->>
-stream
-x��Zm�۸���B�Z��|��h
��r���w�+䂅���Bmɑ�&��
�z�d{_|-�|2M���pf�g8����Ώg�&g�os4ҒJgr�h�(����m�|t	F�hL0����`�OV����b7^n�,�o�»�O��⯣O����ҐH�q
����.im
-��j���=R(,�՚�
a�\�z��hLv'#M�`�^�Y`g~
�dD<7��0���\
z�����1�!�)ϙ��>~��
�r0b�s��V�
>����/g�0,�"��|fYm3��++#ZY:+�ݵ�b{�c̖h����v
D�ʼ���1,���J�c��iD�ڧz����D ����������u at B�(��mM4bL�k~��Ƃ{�4�ҬG�,�c�NU
Q8a
͓�q�ۛm
-�ڳ�V���T��j.�U�N�i��
���.)t�5�:�>��2��O=¸B^%�E�$�g����zN�,UE��[ٔ9�`RL)
("�+��	��<L=7[�ѩ�t�/��9�����`���0�w�ϓpf�f���((��m��~M�����>�V'���'+t�fD!ͪ5h4fL��\��v�h$a�xY~�$�
o�M���E���� J�8�_A�]5�F��#�d��ͣj'��3����G��+3 � �d&�7m��~���>�ͳn�!O����WO����V""Z;k ��R�CX�#�"C+�r�((���֙ۊH
-�OS��/�ښ��/
��:�`�|6���&�U�����O;��
D�$X¯�
��_�����_�ٶ�&�HYnP�8V*�I8�������lo�
����~[��`�8��yTH1)'	���&+�eq-%�E�I�h��	"y��
{8H@�1f
/� 
J!Fd���4�;
:L�^�( e��+(�5�n����2Zo�>��!����j5bî~ T�G3�aZ$W!<�i�*ӌ"MZӖW�t�5�����
���Bn��q���!ZVZ?��0r���<�N�F�
bɑ'�Ø̘�“�OqL ���$
�H؁
��o
�ӧ"\�=�Z�
�%0P�g�g���-��2�9��	pׇ��'i�K�ZZ|�d�K�\�q�SP�ǞϠ+�J?gp<�D
 k`{�'y0@(P LA�lc5Pn�
-��i�$MM^Α+d}ǟ��)�@N�p
-�-}�~D�{$A��յ`�
d��b�>�W
��a�T>
��fq�
璏�ǰ
�H��s:��%
���qD9k�}����
-I�=��
:����G�͍��ek�PhvH;ݯݤG ���"
�NW���������kQ�-�,J�b�����
�p:�.�^���Y��c4쓓��$��;9��S5D
:�����

�u��:�
�r���G�T�j�ә�0�������(�]):����?�w������w�W?��r��e�U�C˦#�1
��O���5�o�7��77}J��h.�p
�C?񔆁IZ��c��luI��e�]����ж� ᨎ�~�(i��6i��fS�~�!ID�*4�/�^�c(�+���eE������k{Q�A�HsGS��n�
������8� ����Q����Z�m(!�|��oRX�jz4��҈�Q��5���J��S���E&���y�qERv��j	�"j%�i�+�
�aEԭ�
X�| V��?��a%.ݢ(Cj�hk�<�3�s9g�D���
��?c�����zJ�Qx�MA��6E}i��<�
jS��
�)�����.�ߥ�t�O�<ƍ�g+�vDxǷ)֋�,+�T��,K�p�������^��aZ�P!0q���$ċdE
�'d�uqB��u0�
���R{�T�`�"��N*�<Oh����O�C߯PE%����T���n�e�A�i����Y
*�w�fʮ��F�<�0 �[-3���ihzBv	3-��׀��c����쯔l�f�p/�{(Hy\�7��2U�ב��{��%�cHz�ٚb�X)�Ff \{9
.3;o��-a�P6[s�3{y�{�B��;��c]�P
�����)a
X�`ią> [X�?����
� la�N^v����-.�p�A���MwW(
��!���y2��}�
�HV�f�IѪr���Z�1��S��Z��:wL�2P7��X��	5�W����E�UI��A�������!��,�W
�o�M�q
�. WnQH%k ��R�� �#5�j� �}U@�;C����;�?�e�
-�[J^6>��ē�-�����4H�<���p�w~�)
G��Ғ�	a�
3ȓ7AP�o���S��~��V� ^Q��"����w�yDsvލ��{ b�����6�*�:�L��2*�M_u�0���%���� �*��h�������s��`���XN��
-endstream
-endobj
-4760 0 obj <<
-/Type /Page
-/Contents 4761 0 R
-/Resources 4759 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4741 0 R
-/Annots [ 4758 0 R ]
->> endobj
-4758 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4762 0 obj <<
-/D [4760 0 R /XYZ 89 770.89 null]
->> endobj
-4763 0 obj <<
-/D [4760 0 R /XYZ 90 721.073 null]
->> endobj
-4764 0 obj <<
-/D [4760 0 R /XYZ 90 646.048 null]
->> endobj
-4323 0 obj <<
-/D [4760 0 R /XYZ 90 599.423 null]
->> endobj
-4765 0 obj <<
-/D [4760 0 R /XYZ 90 594.94 null]
->> endobj
-4766 0 obj <<
-/D [4760 0 R /XYZ 90 512.254 null]
->> endobj
-4324 0 obj <<
-/D [4760 0 R /XYZ 90 456.351 null]
->> endobj
-4767 0 obj <<
-/D [4760 0 R /XYZ 90 451.868 null]
->> endobj
-4325 0 obj <<
-/D [4760 0 R /XYZ 126.015 358.646 null]
->> endobj
-4768 0 obj <<
-/D [4760 0 R /XYZ 90 352.006 null]
->> endobj
-4326 0 obj <<
-/D [4760 0 R /XYZ 126.015 260.941 null]
->> endobj
-4769 0 obj <<
-/D [4760 0 R /XYZ 90 254.301 null]
->> endobj
-4327 0 obj <<
-/D [4760 0 R /XYZ 107.534 163.236 null]
->> endobj
-4770 0 obj <<
-/D [4760 0 R /XYZ 90 157.219 null]
->> endobj
-4328 0 obj <<
-/D [4760 0 R /XYZ 126.015 77.486 null]
->> endobj
-4759 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4774 0 obj <<
-/Length 2281      
-/Filter /FlateDecode
->>
-stream
-x��Zmo�F��_�O=	�����5���N�^��]qE�D�D%R%�:��7���W�-�E�;0)r9;��
9�[x��������k�<��O}oz�i�I�������4"��~�1_!�}x��|�������Gs��rz��	�[�#%���f��O��7���{1���b����q�}<��	�x��
-sjg@��DH�F
-QD�xB0ƣ<\��A
�N_ê�I)�OU��_�m�$o��0V�xB�
���� )|�	�����$�'XCr;s�!��>洛�
R
_�A��M
-G��7?8X!`c�dO*�=&�H�|�M�Z�r�՘�Q����1ţd�p����mt����ٷ��~L#��]��	�
-�-�@X�]��4xv�K �ؠa��D!-���
O��Yg��"#��
�JCy,����fί��1Q�~�.�`K"���炼*bu��=�e�
j
�*��)���
ƴ^�MMBvV �~�����C)�GR7�:O *�/Q�p}�
��ETjD�}g�c"F�R����I�j
���?]��������LrȦ5�LtlK*��2����)��^F�(�\��:�����.�#�8E���6�r��|�<܀�'�Ny�Q�(�way�������.T�K;>d1M	G���*����I�%�t!J}�ƉI��f�ing�����
�
���_�Q���ņ@J6ll�B�N�E�F��*+���K�����s{���q���������(�jn$qE([���g�i��zp�����Y������-��*]�'�
�E�ر�ҽ
W7aZ:��M<ˣ$.]$��*;��~io	�&�#I�C
�'�R����R���R��ޗzm��M�,]�E#Ed/߾LE�0��"QşQ��"�B�d����⨾2��`�ߏc��A7�ЕB�B�5.���G��$����ʂ�W5nk��
���܇0ߤq�"@<��N�nBG�@��Qst[e˸�xI\'B��x
�ȴ"���;`��|
eM�--Q��(.����>دm�7��	��j*W~e.&Ҥ�
�!����N| [...]
��E��
@�%��4!Ej�CTpJw��u���8�>I�\�dq
�(Ţ&���m�J٫XɈP����=\GD������8�\F�kpK&G�"eW�a�A(�Ha6�� �F��2Ƌ�C�^Bc��ӻ4S1��w�(����	1��1Z��x����BI����Ѥ�[G�H�zJ�Do?|��P at ma�1޺5�
I��䳃�(�{;y��  ��}Q���\��y�=ھ�����yC#�
*�
:�q#��ϣm��z
�z�^����B<z�C$E8�$���
-"��
ۜH�V ),]�{@�%ƨ�iP�~|M3Ҷ�U��
�q�Z?�W��ZBp4�,D1��ύ�쎮�{u�.YΛ��&����=�M�"J��
�j�U�߬�ck�D֢����AZ�����r�KA�M�4YO� 6LI0��tH
l�Ӛl���6=Q6��ۀ��6�9^�tg\
-�|WXB3�7a�}�4�b�>t�OD4�o{@I��ch�E4�6&-D���h�RD�8Cp D�8-���f�n�x:䃚/�z�Y�Tλ�I��i@�@�ρi,-ۘN�#
>~W��j�D
-
-Q

�P�n��A3�
�,p
��a\��cp
��3�?�R���D=�X���p�349�m��
n��1%M/=l�
Ar/����Qb����5߅�3��2�@
�k(�Ƨ
:
׀��4��'�#�~w�k�5��C@
1��8�3����c� t=���ȧ_
�GT
�*_�f�h�A
�h:$�A4ļi�
)h
hz�
h��~xfWT
-�[H��{��m�=��$��v
G�܋g�Hi�˓xI<��v<����m�
c�>�"�]_:�l|1w�3_n�M<�
�n\H !X�c����l�ߦf ,Y9�U � �B�`��op���
�1MUд`�~|����o�8
���/�b�4̲
- �R�1~�+�rfn�m EkD����q���?E�x��獓B
-��ZG��F3�����Np�z��6�+w����
w
(��5��Fz}���bl�#�ݱ��.�կ��1� ���yq�~��p�fż����&@o��+�2m	/g�	�P�޴*��.��ޖ'����/c!F�9��&X��&�J���A�85O$ӏaX���뗆��F��N"Dc��<_����lY/ЬJ8�ϷC;�[ ~��%3�$m�.��F���

��A
-endstream
-endobj
-4773 0 obj <<
-/Type /Page
-/Contents 4774 0 R
-/Resources 4772 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4741 0 R
-/Annots [ 4771 0 R ]
->> endobj
-4771 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4775 0 obj <<
-/D [4773 0 R /XYZ 89 770.89 null]
->> endobj
-4776 0 obj <<
-/D [4773 0 R /XYZ 90 721.073 null]
->> endobj
-4777 0 obj <<
-/D [4773 0 R /XYZ 90 619.408 null]
->> endobj
-4329 0 obj <<
-/D [4773 0 R /XYZ 90 596.409 null]
->> endobj
-4778 0 obj <<
-/D [4773 0 R /XYZ 90 596.409 null]
->> endobj
-4779 0 obj <<
-/D [4773 0 R /XYZ 90 523.73 null]
->> endobj
-4330 0 obj <<
-/D [4773 0 R /XYZ 90 489.06 null]
->> endobj
-4780 0 obj <<
-/D [4773 0 R /XYZ 90 484.577 null]
->> endobj
-4781 0 obj <<
-/D [4773 0 R /XYZ 90 411.714 null]
->> endobj
-4331 0 obj <<
-/D [4773 0 R /XYZ 90 377.044 null]
->> endobj
-4782 0 obj <<
-/D [4773 0 R /XYZ 90 372.561 null]
->> endobj
-4783 0 obj <<
-/D [4773 0 R /XYZ 90 299.698 null]
->> endobj
-4332 0 obj <<
-/D [4773 0 R /XYZ 90 265.028 null]
->> endobj
-4784 0 obj <<
-/D [4773 0 R /XYZ 90 260.545 null]
->> endobj
-4785 0 obj <<
-/D [4773 0 R /XYZ 90 187.682 null]
->> endobj
-4333 0 obj <<
-/D [4773 0 R /XYZ 90 152 null]
->> endobj
-4786 0 obj <<
-/D [4773 0 R /XYZ 90 147.517 null]
->> endobj
-4772 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4790 0 obj <<
-/Length 2695      
-/Filter /FlateDecode
->>
-stream
-x��\K������)��Ѽ�Tvd�
�J�7�AQmaIp�		�AR�ͯOf $�8+�ʺ� v��=�u�7݀pt�臫oo�^�Xd��TF7���Hq���o��CL0ң1���G�I�Lnߏ(����C:-��w�")�����?�>����{B�� ��|��?�!�IaZx{�)��z̟{�0S��n��V�18����E�Nݝ��YZ����l�
:&\Y�Won�~�" Gĭ�@JG��Շ�8���#����S9hq��s�r���
["*����
2�Jk�0��C
���ϓ�q=ϳU�ОȽ)�
v�=�1�=U�/w[�[���21&��#;z at .�&��#��'�i�Y�'
@$*!E�R��E(�̊Qp�m�j=���g#��O�b>�M�S��f�fk�_}���MfA
s @t�R�8"R
�T�wp���7E>�"~ʜ��g��D�w�"&I�s����
j
���zP�M���f�@Z�j̿0f]�!�k9����d����
�g>5�g�|����w�
�0�
�w	2{�Ȋ$�űd
SV�!T�Y1$}fXW�u?n+��;��%[!�u��Ϗi�,�1ܓ
-�@���T�	��m*���EW���`�44�D��
��*s$����Ev�j�����M6]��+.߇͢��P��L����sH��Ƅ�� k�8_v̬�;��Ϭ!
-ڞ�.]�#B�';u4fB#NI4�n�Æ��12�@�\w�9#`����<K����
[�
�l��X|
���6P5� 
-��I�"ձ�%�$�	
-@:�-��!�	Du���l:l� 8�D#
F�\�	�~�s��٪k�`�j�+6�Ѩ
-��
�6��y�x>�%�ݭ���%枻�@O�4���n[4���gͺR
-�[I��x��6+kE�
S��\H�
���|��L#/ ��w܈	��5D^���p
����"x;�$x-K�2���
߱~7�p�
뚗�<���Tk�bx�E��gx¨#
�lK�
O�E
��8���
��L>ϗ����@L�Zyz�T/�S�r~��As�k��
��h���m mҭ7��3�z:��8�����r|�z�W��}�`����
�2z&
m�ƀGQ��
e>wg]��b�m��
-AA�䐵8�I���.�[;E��d�n�B��F�h�n�Yv-	2�NJE/+�/�����1x37ēc}�
�����
�m���a�ȱ�p��^U	�����a���hh�>��|�. |�����O�0R��޴�ORst��q�r����O���/@7O���	K at O��՘W0%�
S�S?=�'����J��$Yy"�~��xE���#�'K������:�X��Y��sNإ�ň��吜 /�me��G�-�����&������tR\byZ�&�
Rs���
&��8=�X�� y����n^�L
��
b �����0�(s����O��yu v��%T'������d]����+����x�h�'�c?�@$;,�\<�����$�MM<CZ�@!8$3eDMn���|�&�`njR�9�3s��s��|vZ�=
J����x�IH$�~����@��9�iz�.ӤHMMj M�,_γ���`;�w
DJ��Z��%0
&8n3feڣ�n�~�����2]Z���SS� ��C��a�X�;�Uh������%��<��%���S
-Q
�1	&�Ta�x���2��&A�h�����$���`e�Ve�
S��[�~-��e��;��F R
y�k��	+���﴾�u�8:Į��jeF񺺣X�]
X<�
C��vE�
-�Vyய��U���cnB쁳.�� =vea��ً�2�fe=�+)`�D�Zz�uY�zuq�C�Gj|P�n��
k���ڑ�y��Ʈ'.ҙ?�o�u��<�E���%/�U���
��5s��f���	��a�pu����O���̱���{
��1{O3H<�ն
-�/l�[
��>gk�r(�E����CM39��L���^m������co�
���
��;�f��f�Ա�z�8�����a>���U�؁	=�uDOh
ѯ���U種,$��1�g>�?=�E�š��y�YLJ"M�2����OP��!m+���H�5��}���,��X�ω�L��&��8�qu�2�%ږ2�����u�E�I�<��%:<C̳G�������ٸ�P�n075�"���V�o�&p�
�m.�AI�	
%8��*�ܺ�P�n(55�B���v�o��T:dw �D&�;�b�٭+"1��g��.ԥ�u�����uu8�J?�@$9�6�y�
-с�1����
G�)@���E���((/ҡ;�5t��CZR;YQ�d�ɞ tM&i:]��_u�4_,�
��q��>s�OV`ۣ��]���d��6��Y�w�{Tb#}�e�q5�u��92��瓺������"
����k��Z&��;���u��ݡ�"ː� ��]�Z�%=[�j�
�j{8#��m�ʁ�ڦ�_��u�v�f�����/<
��?�/�S�(;����-x�o�rU6��
���w��﫴�fd����$�$
wm>��Yl�"a[�F���_��D����ꯎ%nU!�#!���z�x�����~�f�h���n��v at HVuObV�L�y�y7�eBGU��F&HJZ�,毰�(E��������o�,�K
�ݭ���a
-endstream
-endobj
-4789 0 obj <<
-/Type /Page
-/Contents 4790 0 R
-/Resources 4788 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4741 0 R
-/Annots [ 4787 0 R ]
->> endobj
-4787 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4791 0 obj <<
-/D [4789 0 R /XYZ 89 770.89 null]
->> endobj
-4792 0 obj <<
-/D [4789 0 R /XYZ 90 718.682 null]
->> endobj
-4395 0 obj <<
-/D [4789 0 R /XYZ 90 684.012 null]
->> endobj
-4793 0 obj <<
-/D [4789 0 R /XYZ 90 679.529 null]
->> endobj
-4794 0 obj <<
-/D [4789 0 R /XYZ 90 606.666 null]
->> endobj
-4396 0 obj <<
-/D [4789 0 R /XYZ 90 571.996 null]
->> endobj
-4795 0 obj <<
-/D [4789 0 R /XYZ 90 567.513 null]
->> endobj
-4796 0 obj <<
-/D [4789 0 R /XYZ 90 472.871 null]
->> endobj
-4797 0 obj <<
-/D [4789 0 R /XYZ 90 382.121 null]
->> endobj
-4397 0 obj <<
-/D [4789 0 R /XYZ 211.842 317.872 null]
->> endobj
-4798 0 obj <<
-/D [4789 0 R /XYZ 90 313.234 null]
->> endobj
-4799 0 obj <<
-/D [4789 0 R /XYZ 90 218.747 null]
->> endobj
-4800 0 obj <<
-/D [4789 0 R /XYZ 90 103.689 null]
->> endobj
-4788 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4804 0 obj <<
-/Length 2892      
-/Filter /FlateDecode
->>
-stream
-x��\ms۸��_�O�<!xq��pm.���6n�!���e��HG�⸿�
��2(R����̈́4.v���}���m����__<�A�� #�
�W����		-�w3�����&5"F�[�������?_���]����xA�'
'@ ������{
,��F���h�	8ep]o/�|�ۺH��
!��竕������h$����c��(�jÑѤj��řk��
-�M�Z̉1�hs�?�[=K�>��������v��$͝ܛt�,��{�ڦwޤ�D�>��g��	63]�]��,�t��R������6q��Y�,=
H���G6��H|��u-��w�m1˓Ű��&�
ov��9� ��9 ����-$i�*��
i�f��mt9����*ww�$Ow��h��u�����l:�p��`]�.�4b��D`�g9 n
��D��CX���k��@!X�5��$�X�9�����G�H����yD�z��-n�t]c�c�$�5{sI0
�&����Y�~��ن^�7�p�xu�}�٣
tpS���*�7�[v�$;J��^]m�$������Y9V�`�/�\��"M��c��
t����8����	��eq�x��+
~U�:���nY`�J\/��6�!���F+�tGI�靃l�{��3NVO]<��a��QC9z0�p~��.��#
1M
Yd�&>C	E��
��j`p���P#��u�1t���Ū�S��FP�������]w�s�	x��`)����8S��� �]�����+��7l7�tvʽ��"�d���@�D���ʨlLjx��@	���I�����}y���4x8'Q誑�>�xN���R�i
-#��Rou�@�T�x
��K*f�O
@�Xs��$#̧C��T�&P���.
M
���]�-B����E���"���ߕ7qb���ş��!�zW����"����:̖�;
n1�YYD]Ct�(��a1��I�Y֕���������� 

�R���DOs��/+�y	,=�נ�[��d�t�3x!�L�X��D���1")<<S�J���P�U�ݺ��
-�e�v�L���l_&	�҃?���?�E^��,7����)��]nu��

G-9c
��"l�&���
�%C�Q��L!�NX(U���
�y����֤s��D�0OK<���
v
�N6��A$?1!����$�a|Z,	�$&
����t�&~,�5�������C�Ɇ�Ͻ����)�4�D�&���l4Q�۰@p�(W���e��x:O��J���.�	<Ǥ���\o��x
��Uia��ҽ��0tщF���a���$:%:O��Mj
�:�	�0��
&���z�y��

��#2cn"�p
[����1�2�5�5dh�D���싴�D�	G�J�6
-V�W�-
0+F#!ʴ6˗WW�� �p
/?@j
��[�
\e�B(̲�lRK�
@�7�1^���u� ʺ�^�m�N7���'���g����`�\Q�Q�&���y�vgUy��M�<N�7�����b����`��HuX��K�t�^:�
7Z
�H�S�9T��m#S����[/!d
*��gE�}�E���e
��+���2�^���
ヌC����F����	�1mLOd�$���uW/#�UӯМcK��n}��	���
�f���sJi>>�����)�~7DU�
&�	������`3�����9-ez�
,��s`�J>G��|����9
�����dGX�#8�����
p9
-Q%n���;�a�6&T
-��s9�Y�_�N��6��
3Ĉ�����,�
���h<�ar|8gv��=��e��� � ��mZ�(�2J���0msJ���^���6�8�7"��߈�o��9�Q]T��>��2�?�E���5�OJ�q�F!d
e5".;��SX+bbJ��x+x�Ĕ���%;sF	�(zRފ��ۅ~4ou�2��lG�����q�G��L�5L.���;��\�#Ҍ
�[����mM�ou��3o?��S2
�K,�Da
k3-� w�J
I[���ImE�ku�
�o%JC&���
�4��_MJZQ
�
ʎ&����KZut��#�Ɓ��a�ǒ��-=%:����)!å���u
�S��Lj?�Q��� *������:��.��r�*�
�"ٳO��bE��n��=����f�Bfx�J��ڍ�}Xn������X��n�f���6J�ʣ�P�{^5�(�6L�a�<��=y
-��
-1�2k<]�q�-��FE&gm)�^ؤ�������.3%k�ykK�	*'cm���bm�L=���X����Y��g��HƧ]�'��r�Di���>5�>�{����3r�!>�s�����l���9ħ��3��	[{��1��Ĉ��?}�Ou9_�E9_���6/�q��9�������C���Ô/�C��i(��6����ť�=��*)_Xs)_.d�f8���X
�-k��1G��Q'������� ��QD	;���0����	8�w�=��
\,��x
-K�5 �@���׷�]���c����&2րklĴ�!uC|�����1�	�^�)o,tQb�B�e�̓	��,\}w�<�
-�g�a��bOp+F�	n�xĢ�DY����Fw�Oy���[^��8�˗�e��
.U���
�0�M���}�a$�>�`[i�l�~��|5p^��,�1����C�n x��
2ħ�h��	#l�B�f��㷗s�q�tR�.��ז���QM������賏��`����k�?V���ڰ�)k��A޼X��,�b'
R4ƕm��7o^���f��חB��B����� ���ۆ�$۵���x�6�ʡrz��V�'W�m�# ��B�������ov�Y��"ب=]���v:�U��t[�r��(�=�����
-endstream
-endobj
-4803 0 obj <<
-/Type /Page
-/Contents 4804 0 R
-/Resources 4802 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4741 0 R
-/Annots [ 4801 0 R ]
->> endobj
-4801 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4805 0 obj <<
-/D [4803 0 R /XYZ 89 770.89 null]
->> endobj
-4398 0 obj <<
-/D [4803 0 R /XYZ 192.853 699.155 null]
->> endobj
-4806 0 obj <<
-/D [4803 0 R /XYZ 90 693.138 null]
->> endobj
-4807 0 obj <<
-/D [4803 0 R /XYZ 90 600.031 null]
->> endobj
-4808 0 obj <<
-/D [4803 0 R /XYZ 90 509.281 null]
->> endobj
-4399 0 obj <<
-/D [4803 0 R /XYZ 211.842 445.031 null]
->> endobj
-4809 0 obj <<
-/D [4803 0 R /XYZ 90 440.393 null]
->> endobj
-4810 0 obj <<
-/D [4803 0 R /XYZ 90 345.907 null]
->> endobj
-4811 0 obj <<
-/D [4803 0 R /XYZ 90 230.848 null]
->> endobj
-4400 0 obj <<
-/D [4803 0 R /XYZ 192.853 166.076 null]
->> endobj
-4812 0 obj <<
-/D [4803 0 R /XYZ 90 160.059 null]
->> endobj
-4802 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4818 0 obj <<
-/Length 2460      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_��V������t:Ӥ��i2�u�}q<;�H��J���V}^%^t����(
-�p��; ��';�o����I1G#-�t
V�Ǝ�		�|�݌`��c<��<��x?�xov��O��_��������?�|�!
D"%�q�/��
Қ&�Հ7��@�0Wc���t9⇍���x�0�tl�7^�;o�U�̉;
�%��D�3µ������
��)�Yno޽ǎ�v0b�u>烶�
>7�o7�����V��
-si>���ZhW#
j)�VrX\��m��Ifi.�r�
����o�a��5��C��U�ڑ��!TM�b֮v�E8L"5��Ԯw`���sbW�o���p�Ba$ދ
MU[��uᢛ0
-��^s"��A��qd������p���Y��U||�6���[a
Q���ݰ��HD.P��C
$�S������O9�:��%�>�(�̑�B���ʫd��,��
�t	��s-iެ�l*�u 2�(�i��vL

�U�rL�`� {I��e���'���93o�R|-��Af/����6�%P��*��
2p�]R��@��{�� *pm��#ȧ���-
!�������&�v���0[?�Ħ^c�䩰���7΂H� �uQ@>��$�[��*�4H�:L{`�u�o/��,��L��d�^�q��_���[���������
-	�8a�O�h�^h�Q'�5E�K�8�{q���I�
�Mqz���h�sLZ�^֌�f5jF~���7;#߅��)HO��:�q���RC���S#Z��
-qWO��i�$ªH}��͑��2I���)IE���m�xYI��.o�TGq�4�
�F��N󴳕��
��zJG�����Ǵ~� PZ��q��2I���)I�g~��0�4� Y7��vbN;[�~�`�Z٤$�l���h	���
-Z��e�A�4�?�)
͐��7$�i�
�&W��#P��q.�p�d�����'
��(A��Y
�1�3#�Y뤙wFs�M,����s�'����
�b�\�&�����2p\"Ր�mb��obmM�@Á}.8{ؕ
8ELV�*(�#i��v
d�f���:��1f]�5��l
�㓕͋���6�"���i��T�4�w�o��@R��
��1]��	 �`�#I��ۤ]�
-��q�
uL`
-���k�Ǩk
-�\Y	�j�ur
�r��<vi�
��;�l"��H�7o�Uф�DY��\~��͂�Wm�O@[Ph��[o�#v,v˳r��p/[)��ކxk��d�� �FdȐ���B ����x
�D\��Ǜ�=t�=p5���&i���[%"rN?��Y�ʦww�8ʼ0J�:���/��e<'�(�:�]P
���wq�
c4��G)<��q{6b��O%�jr
D���u  rE] ���.�B�U��
���Ӛ���m�]Ҏ�c��\~�F��أ�@�D9���E�U��
&'�e��t(%��rou[P�9���`� �1
��
:9G咡�M�����9C�Э�xR�ڀ���rH��|3C�RӒ��z&CmizC��.�
��b���
2	�<�
-���O�:/�
n�
:�v�T����r>�U�J�W�,��U��p�Ѳ^
��U89���Y.��y��;<v��@�չ���	�lWWqhz�&DA����L�[�28
�L(ߣCq�[ʡ�U*]�4�I��c�I��C�@k"�.���������5K���·��ؖ4]"�
-ۢ
�Wc[
���H�� \3�[��[��nՈ��-�4�r2�5��%�j+z&�j���s��m�̜�6�.�
%Z
+�(i-~U�%��#Z�>U9@���*D�`6N�ꭥ#���W{���2c*�
��+��g[[F���?qXd���
-��SLl����&^%� P��>Ѡu\�y�����0&A�o��M];�럴1��=7MǕ��̣�;i�fN�(����\�y	Y��@����M�hI��4=��5�����F�
�jھ�"�Q�F�@
�6_��k6�|M���C��g�d��C����`���
��?�#��@�<�f~{)�s�	�/�O�Ԋ���sR�xa~r
�� P� ��9��Pq`��Ӈ�
gy���.@�g��Vq�p���吝c�����֮:�Vn��tn�@�g�c�.�����²oƴ<�
�Fa��uF��W�.���?g����  �+��E둍���M���!��NuhY0$��@$�r/fy�9�
��<Gڒ�:G��?�\|���|�����)��Bϗ��� )�<~|6`��>`
-���c_�,
5RB�^< ���=����b/��ɟ�B̊���x{m�}'���#�d��
	�|��
-�_����M�vjQ4z�~�j�e�w��^�� zB���vC�|VU�#��K�Fps��
-���
L -�r%`1?��0Q��#�������o���{

\[��~�
-endstream
-endobj
-4817 0 obj <<
-/Type /Page
-/Contents 4818 0 R
-/Resources 4816 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4830 0 R
-/Annots [ 4813 0 R 4814 0 R 4815 0 R ]
->> endobj
-4813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.931 671.2 186.185 683.534]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-4814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.668 671.2 272.341 683.534]
-/A << /S /GoTo /D (index_Grid_Frequency) >>
->> endobj
-4815 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4819 0 obj <<
-/D [4817 0 R /XYZ 89 770.89 null]
->> endobj
-4820 0 obj <<
-/D [4817 0 R /XYZ 90 720.814 null]
->> endobj
-4821 0 obj <<
-/D [4817 0 R /XYZ 90 605.755 null]
->> endobj
-4401 0 obj <<
-/D [4817 0 R /XYZ 439.299 553.461 null]
->> endobj
-4822 0 obj <<
-/D [4817 0 R /XYZ 90 547.443 null]
->> endobj
-4823 0 obj <<
-/D [4817 0 R /XYZ 90 476.115 null]
->> endobj
-4402 0 obj <<
-/D [4817 0 R /XYZ 90 441.445 null]
->> endobj
-4824 0 obj <<
-/D [4817 0 R /XYZ 90 436.961 null]
->> endobj
-4825 0 obj <<
-/D [4817 0 R /XYZ 90 364.098 null]
->> endobj
-4403 0 obj <<
-/D [4817 0 R /XYZ 90 329.429 null]
->> endobj
-4826 0 obj <<
-/D [4817 0 R /XYZ 90 324.945 null]
->> endobj
-4827 0 obj <<
-/D [4817 0 R /XYZ 90 252.082 null]
->> endobj
-4404 0 obj <<
-/D [4817 0 R /XYZ 90 217.412 null]
->> endobj
-4828 0 obj <<
-/D [4817 0 R /XYZ 90 212.929 null]
->> endobj
-4829 0 obj <<
-/D [4817 0 R /XYZ 90 142.198 null]
->> endobj
-4816 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F8 794 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4835 0 obj <<
-/Length 2170      
-/Filter /FlateDecode
->>
-stream
-x��[[��6~���S�j�AQ��E�n�n�ۇ44��c�mM$9���=ԝ��+'ھ�d��x�s�D
�}=�|�X`��T����@q���_Q�fL����
�Ԉ	���o~�i���k�l�b6z?"��H�`�
�y���_1���E�u�)��*x=�e�+Y�+����K%!`�j�0�"
i,Jq^�>��e��
-�� ��(g��	�%T
��� ����sc�2L 5E�
�i
P�
�A%p%��vX�h'
Q��#���H����Bf�b�������v��p<���ѻ0�05^l��&/�5�
�9���\&,��1��T�)�&H�A`��e�
�dB���f2�F���vm7�R��b���0fe'%���Ѵ�?,���+�DZ�S���I�� y.ˍ��Iڌ���jdi@Ӹ����
|k��̓�c�/�V��)#d��=3��n��NK,f�$��1�|yZ��)���SB`H���p�z������c��qT����󇸊V��R���o�_'�;��j��5l:l�����7(,"%�k�
-�p(��0�pS%
�4b�I�)���Wa
�@Hg�R`����/�
�B�7
��x��I29�~��
H!���|�	�5F�aB�8YF��:aL[�U�^MgX��^M(
'���8J�w?.��0}���,iG6b#ʁv��_�`%��9�t{F5���2��IS�K!����U�a��M=]��q'+��ʆ)�q)*���=O9��45F����S�Գ~͐l#�g�
*'��`γ>EXӆeA��A��Z�No���r�ub�N���A=�("X�����
Qō�{� �r~{���:�	!Ys�tɓ�y�r���~`�(��D7�͢'.����F�%0�Nȭڜ���+H�ZÍ ];)8s�B���ty�H
��pNu(@�R�m%b��g�Ee(8<�SS�.lOU��@�BIDh�����H��Z)\����R�]�6���CEqt,�@�B�a$c§�\�x
�L#��w�%F���s��t% o�x�X-�K at R�x�X�VYS,w��1,g�Ţt�bX��l�]��S@:<���r>Ȩ(�C�J"��ѹ:�N��!
f匡��
~)�s 2�-�>>,�U!REӒ�ٲ��4�U6 at i|>����# J���
-ȣ��+(�(q9�zFNŨ
�z �}e@�0*c�)��o�>�2�kʾEM�k�{��ȕ9N�l�C�
8\�װ+"� a�x�
-6��0��|B�x�	`4R0�(&Hi�
-�VW�jz��c�*�?���c�M
go����boT�"��M��<�c@<�����'��7�a2s{�R�^��q6}�2HvDª�X�OnW-����D�w�2���`�O;�
�<��`��|>f_*�{����:�xd|
�+(��m����|
�Ys���^F��u�M����bc
���oȹ�@L!+���u�@�i]��a��p�)��ɵ��q����wa�m�E|/�2~���<�Z�q�0j��U�s�#�a�����c=q����,�߮�	��p���u
-��i�o�j�5�B�F�+>��VO��]�����6�(/I,/}j
�C�,zH�=�BX�u�����(9F�ۀr�Tk�I�z+��(�uʀyPfį=e��5ۓ7�w�n�ͼґ{�8��
��_8�m����yѧ�NI���-¤b�j�='=i
�$��9n�d�%����vi+��O����=�=���N5 �$��{��/a˜!��Ė�y���#��X��ք4���FRZL^��F��)|�J1z��#Ƭ�"�<�\�a
�ѧ�\
-x^�El��O�=R_�������g�,<	��P����W_�K���[e�{�e^F{�Uvi/�j�sRm���IU�E���I&>P�=��{Q"
&la�?(�r�	ۗ���d��I��˒زì(t��H?	����� �^�������
;� ������=��R�xؽ/
�c�����,�g`-��-`�w,F������M��^�X��'��L�W�����rQ{oK����iV�h�H�et���u\�\���F�F��w����C�?����mY�Y ����
l ��
ro)t�z<I��T
-ס�in
-F�?JG�
-endstream
-endobj
-4834 0 obj <<
-/Type /Page
-/Contents 4835 0 R
-/Resources 4833 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4830 0 R
-/Annots [ 4831 0 R 4832 0 R ]
->> endobj
-4831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.32 681.422 320.92 693.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4832 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4836 0 obj <<
-/D [4834 0 R /XYZ 89 770.89 null]
->> endobj
-4837 0 obj <<
-/D [4834 0 R /XYZ 90 718.682 null]
->> endobj
-4405 0 obj <<
-/D [4834 0 R /XYZ 90 672.057 null]
->> endobj
-4838 0 obj <<
-/D [4834 0 R /XYZ 90 667.574 null]
->> endobj
-4839 0 obj <<
-/D [4834 0 R /XYZ 90 596.843 null]
->> endobj
-4840 0 obj <<
-/D [4834 0 R /XYZ 90 543.154 null]
->> endobj
-4406 0 obj <<
-/D [4834 0 R /XYZ 90 496.528 null]
->> endobj
-4841 0 obj <<
-/D [4834 0 R /XYZ 90 492.045 null]
->> endobj
-4842 0 obj <<
-/D [4834 0 R /XYZ 90 421.314 null]
->> endobj
-4843 0 obj <<
-/D [4834 0 R /XYZ 90 367.625 null]
->> endobj
-4407 0 obj <<
-/D [4834 0 R /XYZ 90 252.935 null]
->> endobj
-4844 0 obj <<
-/D [4834 0 R /XYZ 90 248.452 null]
->> endobj
-4845 0 obj <<
-/D [4834 0 R /XYZ 90 179.878 null]
->> endobj
-4846 0 obj <<
-/D [4834 0 R /XYZ 90 126.189 null]
->> endobj
-4408 0 obj <<
-/D [4834 0 R /XYZ 90 77.486 null]
->> endobj
-4833 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4850 0 obj <<
-/Length 2214      
-/Filter /FlateDecode
->>
-stream
-x��ZY���~�_�������A ���� 'V��08"g$D��$e���V7�)��8���٬���&�
����������2�=�$$����!�HO�c
��
F�:��vBq�Y�I�E^>fQ�{x�n�������7��()�
��
�?�K�Ma�,�a��
*��f͟�a�^�U��)8�M

���**���?��$�
&�
n"tH�D゚�}�#@�Ԇ@J����8����F���[�8ep]���~�+�/����J�@�W3!Dl��"�RuQ�{������M��B�7
��K�Fk+8�Gt+⬣Z�"�����<�<�,�>h��{_�0� "E�ꗊ�1
�*�!���ƇN�E�sg0�͐+Pd�i����
TM�l?ߤ���zb^�?X`�E0e� lL0��F�f}^��r�������r�
�5��Vo��֡j/K44��y�-48d�x'o��� �����t�L�N�u�ܿ�m�Sb��S
-�Ǻ|��q\u�)����CJ�=/�����F�	�Ų��۝J�q��i<��iQm�|�.'T�Ha�JҢa��.�D��n,�>�(ȐZ
��c�(dX#�t�g��}�Tb�
�G��:4!��
Ca3!	s�`��mp��|h�uӧ��Ο�e�=�ץi�|G1DU�d�(�� �H4��xV=�,")ܼ��e���|>fG}����jA�I���D"r�ǭ
$��c���Ϭ�N1�(�(�U�}��<y)��@���H�0��q��d|�.��(Ed�
(�lԡJ�J��k-��>��
��F�O��H(�
@E3"��ɋ���1���h��?Fل��y���|��E�1�i\���1R��e
�}9g�lc�ԗt2��%\>�N/�s
-'=]8�iEi�[�߷w���6>�i�,)���`�
�i�L��KT,W��mI���(��Kv��X@���-#��-�eSF%8D�הU��L�_�����UnM7U���l��V�]�7߾�l�"��Ի�4��!��f
<����93yC 
�R!=L���s
͓�J0M��ů��� 5	�����q�2�w�(�J��W�4�h�PS���i'
-n Y���J�RSy
�"�"�HIh��Y2��w�	�*�c�hh��
PL���g�o��n`^���}���a
�n�1�
�}�0�+pKJFl�G��ZO�%�+*�q�%D�`�����q
%�������2I�g΍��X�ux�\�vD�L��:��2��X�����AjfN�m��$�u�k�+\ʇl���6 ;��0mu&Ľڢ� (bB�
��)^�p�� 
�r�UR�Q��W��
���Ԉ�E���
x+6�a��1nG��0�'�7����q�ṿ��RdR��~n�yYRf��Y5����Qp�t�>�&�n��Bi
-���0�	7����a��۵K��bB�ET��QZ�z��[GqR���7ˠ-r��+� ��K�qoɇP�Ch#��b6+�Ll�
ST=̒b�U\:��2T��
A\,���}Cu,�GOI��q�bc��n�L
u�
a�xa�(�k(=v ��'&Z�9��{����Z��d�ZN/�Qd	T�&=C�Z
 �•3~ӔB1��)K����/�bѳ+���<6ƮƮ�7����`bʅ<z�lY׼5���?T-�P��É
����z�ф���h5���yr�=�mo}:1��a��ԃ���ugq�Ƙ}��G�4g3�O���O(T#�ƄE�St �b��R�

� �Rb��r�Ss���
4x\�z����x���ݓ+�-/�`�,�}�4�m$ũϷ.�)^����cl7
��5f��
-4]�ٰ�Z_�GAv�ddWD�F�vT&�
e�)i
�;��0{@�>��I������l
-郌>�?��%�J�]�
�v={/�>z^o��!���fܰ�����U�Т��
�_��B0X��1�%E�9�e�MK����?�;�(w*{�^NX�9�� ��
����yª L��:c��0�F���
~����K!�
�X�����N�Qv�W�u��x���}*(�0���}�s���~"DXi�(ݺA�(?��l'PI���2�I�6G��]�T��L�7��t�4�g���ht�(�������s����סw��fR5N״��M]�)�\G��Du�6�H���(�TL��nE��{X�Xݸ�a͂�n@����Nr�
-endstream
-endobj
-4849 0 obj <<
-/Type /Page
-/Contents 4850 0 R
-/Resources 4848 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4830 0 R
-/Annots [ 4847 0 R ]
->> endobj
-4847 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4851 0 obj <<
-/D [4849 0 R /XYZ 89 770.89 null]
->> endobj
-4852 0 obj <<
-/D [4849 0 R /XYZ 90 721.073 null]
->> endobj
-4853 0 obj <<
-/D [4849 0 R /XYZ 90 658.004 null]
->> endobj
-4854 0 obj <<
-/D [4849 0 R /XYZ 90 604.315 null]
->> endobj
-4409 0 obj <<
-/D [4849 0 R /XYZ 90 557.689 null]
->> endobj
-4855 0 obj <<
-/D [4849 0 R /XYZ 90 553.206 null]
->> endobj
-4856 0 obj <<
-/D [4849 0 R /XYZ 90 482.475 null]
->> endobj
-4857 0 obj <<
-/D [4849 0 R /XYZ 90 416.831 null]
->> endobj
-4410 0 obj <<
-/D [4849 0 R /XYZ 90 302.141 null]
->> endobj
-4858 0 obj <<
-/D [4849 0 R /XYZ 90 297.658 null]
->> endobj
-4859 0 obj <<
-/D [4849 0 R /XYZ 90 231.086 null]
->> endobj
-4860 0 obj <<
-/D [4849 0 R /XYZ 90 177.397 null]
->> endobj
-4411 0 obj <<
-/D [4849 0 R /XYZ 90 142.203 null]
->> endobj
-4861 0 obj <<
-/D [4849 0 R /XYZ 90 137.72 null]
->> endobj
-4848 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4866 0 obj <<
-/Length 2208      
-/Filter /FlateDecode
->>
-stream
-x��Zm����~���R
-���}��"�:��Թ�j�8Ɓ�xQ�T(ʗ���}!EJ��h;��o�ٙٙg�Y
-� ���nrs��b�FZRL
��5�f���:�0�!`2BDKx��~����뷓w������o7
�8�(��n���
n�`�t<�A��S�e����u���
-sj^C���0�c
(�N���a\ī�L�!���u �s�ç�yv`�x��2�:lk���a�t #����
-�#{B����@ ��&FXS����1?I��UJ��)�����d��ƌ�p�g���Ӭܘ$,s��c⮷�d��<�;)�_1�Y�J��Ƃ�p2�p�ߌG������U��U��e�gN��?.���pɢ0���Z���
�	A|`�J��T�0��H=Ѱ�)$��2�yy�
q.�!O�r��[���jά��$v�M�͗~T�|��L֨U��\��G�d�
�R�K| I# [�R��}��Mt�@�30Fr�0��1�
��'��tH�0�$��m��d_�y�!�އ��XTB�$x�G,BfF�IU����r�CZ��t�#����f at o�S�Q�٠��=At�T*��Lm��Qֶt�(��S��ѡ�9EL�
-E 
Xq��zL�H��҈�zP��:� lDJ�F����
S��g95N�i�Z�䞂)���k"�x�H)鰉y�̗���)H
��y�t���DHa
�,��jV^*�)6�ƈ0
��˞>�Ԝ"su�C��eu�ߋ��mOGD������n��~��a�N��tU���d�d3?g��͐��t�E����d��˭���yG�v��nw�Fg�sL�Ǹ��@�@�
-��i�ܝ|{�'�k�;��m�.�Y:-c� c�U���
���Z�ȗ�"�7�j��ߩ�oW�gI2Kf^;��qD�е
�֞1n�v9s��[�z2��K�:܅��9�
}��|�,(�>
�e�o;��x�"yL���)-���
l�Fc�q��~�Ӿ��
-o�V�bRj��
���x
=�H��?X����k.�~�iY�U3I�2�FD��G��'^�_����cӁ���إ����4�W�8Ҩ��onDk���ϐ;��`=
�L��!R(�k��h����'C�L��r�U�5 
��;xX����^>/�Y?��~,�������u�:��&Z��P�jLU���c��#�[�
-��.Q at J��q�OuX*��a����&
��:BU�_.:fP��d1�6#ړB�΋m�MMdS.��\�
/;VYi��a�v��V0[���o�eR͒��#B���)j�¸dއ�-Z���48J>�e=,g$�R�������ঃ��ĻԨ��A�X����ecq��h�
9��v�
RDB�a�"�/���	hE�㉃K���3�S\�wv��!#SZ�j�өݗ+���i�1�H�#��-������[s|�A$Cn�].�e�<3�����
�&(��
/��S���C�:4D^���"��l�aHK�]�=S/�uhY���u��]����x�H�3h^^#���t� MU���?i���a���dcDѪ]�1C��hLk�]k�9��D�!�yx�����p1�@v
v��4�hӵ���}��/�3
@N��Φ3���SZ�
������N�s��<�*�s��E�&�H{V��0���5�

\���H�wr/`5
)�
-8ajf3�Nњ+��5-=&GS�s���9�� RDlȈ�X��x
(T
�k ��$
�@}�.� ,�fC2���k�
5
P4��Њ��Yz!�i���5Gk0��\�^�s�A
4/��y��༒�6���Olօ�������_�}���Lj"(��uT�|# V������ٟL�&�m�>[vXˡ�`��O&
2���18à�N�`g0��y�i�.��{k��]p��V��pm>�������|�>Dlt�)�5Ie�|%�a
 �l�h�!��
�Ah� ���Ңk�8ǕJtr����$9�r���Y$�r��G��C���b�����E��s���£�жt��b��n�5����
��͊�A�N��w�P��'%w[B�8YMڎ�����	 m��g����m�lJ�'S�bS"A؀?2��%����^���������0���qQ���ۏ��&����2�{�|�R��ʫ�4����^�� y���
-endstream
-endobj
-4865 0 obj <<
-/Type /Page
-/Contents 4866 0 R
-/Resources 4864 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4830 0 R
-/Annots [ 4862 0 R 4870 0 R 4863 0 R ]
->> endobj
-4862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.9 551.643 513.996 562.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae862a635387c2458da51889c20465f0c) >>
->> endobj
-4870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 539.688 120.665 550.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae862a635387c2458da51889c20465f0c) >>
->> endobj
-4863 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4867 0 obj <<
-/D [4865 0 R /XYZ 89 770.89 null]
->> endobj
-4868 0 obj <<
-/D [4865 0 R /XYZ 90 720.814 null]
->> endobj
-4869 0 obj <<
-/D [4865 0 R /XYZ 90 655.17 null]
->> endobj
-4412 0 obj <<
-/D [4865 0 R /XYZ 90 530.721 null]
->> endobj
-4871 0 obj <<
-/D [4865 0 R /XYZ 90 526.238 null]
->> endobj
-4872 0 obj <<
-/D [4865 0 R /XYZ 90 457.664 null]
->> endobj
-4873 0 obj <<
-/D [4865 0 R /XYZ 90 403.975 null]
->> endobj
-4413 0 obj <<
-/D [4865 0 R /XYZ 90 369.305 null]
->> endobj
-4874 0 obj <<
-/D [4865 0 R /XYZ 90 364.822 null]
->> endobj
-4875 0 obj <<
-/D [4865 0 R /XYZ 90 294.091 null]
->> endobj
-4876 0 obj <<
-/D [4865 0 R /XYZ 90 240.402 null]
->> endobj
-4486 0 obj <<
-/D [4865 0 R /XYZ 90 205.732 null]
->> endobj
-4877 0 obj <<
-/D [4865 0 R /XYZ 90 201.249 null]
->> endobj
-4878 0 obj <<
-/D [4865 0 R /XYZ 90 130.518 null]
->> endobj
-4864 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4885 0 obj <<
-/Length 2484      
-/Filter /FlateDecode
->>
-stream
-x��[]s��}���)��V����\I
v��5���Ɏw�0�ra
�$h����4
$�d���C�����s.�
~������{-K��*��,
th�T�k
��0J�t�(��7SF'�zݼ�r:�Ϗ�|
���ܮ����շ����/�g�e�)s!�W���y(
›����X�B�10"l=��"���K:��Z>���ET���/�}��23��;\�L�	�������
34`~5$�&�[^��@�9.�P"�	>���A�������/h��͑p�NݡZn��L�XB�f�*�Կ�|��$K�rB;&w
��
�3y���z����6�
��~i��Y(�
�c��Rn�e8�m��w-��u"�dmd
�-+~s:�8�™Ѹ�7'/�WWI:
��c�H�7�z*���i��߯��@�b�Ũ��
��T��0��y�h'�,������:�r9����I�}�!Q7�
9��9�OJE���=�Xӌ)
�܏�N@��6��t�c�)b�����X1$,��YW�>O�79�i��w�r��"&�7K
-
�Ή��r&�GMʳl�(g]�A�TS� \Ue���u��&��-���D�̀�y���&�R���@Ǣ�
���q��I����%J�z��
a��^�	
�n3�
�!fU(
���)rWW+�19�V�TmB7����Y �̆{
G��&>v#�V)RY!�,f��u�XGIZ�r+8P@��,T��ճ�
m�D~��y��#�z�6{�l��ԝ��5�ӷ�Xیi`���]�IPl�/�ϻ��� ;8mq�OÊ�\wW7)�u�@����ř�X!��C�CQ�
ZKև���
{���$�?t����a�9a����W�[<V'�@q%�y�1D�����a��}�޶��^��S9)��_�Ҟ"��L�1�� �C�쭃�[���aձs8�SC�+Z
�V�� �<�%,Q��(s��*"�/G�[,�ԜH�P�{�
�Lc��V��v�
/Sx����2���n��z0a��o�Oy<�gG&�!�����o8
`R9f��m��Pd����Ġ
�/
.�� � �^������j?����&�n�Y��&�v�K�OK����O�[̴����kۈ��`�rZ�Gw��R;
ݝ^��~��~����@�LAӿ����R�|��
��� ���x�)����dzO���o<�,�� �m��y�6�)$�6n���d��g�����6{J�񼲾��
����]�9
���R���Q�4��O�RaI�r�Ӥ�\,�lu\�5�)�T�1��d�/�H
-
���ݕ�K ��
-�/`���� K
���2yNw%4��U��^�Ӻ����핎�����a�=N����N"�����g�|\�7��n�?�P}�:u����7�
<�P�V֑�TJ�1�(�2z�JJ
ͻ�2�F��,��%����
J�Ქ�oZ���A�؄X=-ZG�^�d(�
I 6t���`+�Mp�������0����F��Ջ�zQ\���(&�l�[[=����y~��Ю��;�E�޹�3�:��}M"-Tk
���I���
�5X�Nw�@
��=z+�h���E�
p��3�5_'�����j?���U&4��(e@Ú�����p�U|WT�d���"�vLX���5�k58?ֻ��%]v��1��!7����D�f�ـ!7��]` j=ߊ�s7�un,1������70o�1u��K�)(ʒe#5n@�m@X��N�
��gΣWKw���n��鐣�U�/
;
�
���d��

� LJ��
��-��8q
����u
W�_(�1���Y�+a����Z&��y\��
M��i��\=Q�u<
�y���y�%��4�p�4��$:<���F�p�w�%��;}�Kb�T�����<�v��Y*!����_��
%̀�z�
�Jec�-u�q�3������n�� ���{�q\c۪hX�H�-/v����;��#Ŏ35 v
-���e6�Ћ
��F�ٖ=�ʭ�$��i=�rD���� j��
� 	���0�^P�B�%��Q��u^	����� ������u6����D��ʢ���rD�:����1LRr$I�,��g�$��D s�z�x�dzuQg2]
��B�t��&�RcF��_&�ue��.�� Z�Q���&������fGj\lk$o�h�d����C㱜�|f����G�^�����
q���K0F��0&;
-����W�^E8�diu�.~�a�;9��lw菳t�/А����|�ל(��,J���ٜЄ�Q���>-��|��b�G���d�ձk��ű��Qǹ�:���t`
�n�߼�ٟ����?N�c����ҧh�
��כR�vԝ��I��m\�����짋2,6Sa�r���cQ��./o�
�8} ��]5���B���,�Y��7Iqq���
��J�R�^	,�o�@ʴ���yy��au���RͰ����/o���
-endstream
-endobj
-4884 0 obj <<
-/Type /Page
-/Contents 4885 0 R
-/Resources 4883 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4830 0 R
-/Annots [ 4879 0 R 4880 0 R 4881 0 R 4882 0 R ]
->> endobj
-4879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 358.943 212.124 369.847]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-4880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 185.417 210.103 196.321]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-4881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 82.01 485.603 94.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4882 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4886 0 obj <<
-/D [4884 0 R /XYZ 89 770.89 null]
->> endobj
-4887 0 obj <<
-/D [4884 0 R /XYZ 90 718.682 null]
->> endobj
-4487 0 obj <<
-/D [4884 0 R /XYZ 90 684.012 null]
->> endobj
-4888 0 obj <<
-/D [4884 0 R /XYZ 90 679.529 null]
->> endobj
-4889 0 obj <<
-/D [4884 0 R /XYZ 90 596.843 null]
->> endobj
-4890 0 obj <<
-/D [4884 0 R /XYZ 90 506.89 null]
->> endobj
-4488 0 obj <<
-/D [4884 0 R /XYZ 90 416.11 null]
->> endobj
-4891 0 obj <<
-/D [4884 0 R /XYZ 90 411.627 null]
->> endobj
-4892 0 obj <<
-/D [4884 0 R /XYZ 90 333.1 null]
->> endobj
-4893 0 obj <<
-/D [4884 0 R /XYZ 90 279.411 null]
->> endobj
-4489 0 obj <<
-/D [4884 0 R /XYZ 90 244.741 null]
->> endobj
-4894 0 obj <<
-/D [4884 0 R /XYZ 90 240.258 null]
->> endobj
-4895 0 obj <<
-/D [4884 0 R /XYZ 90 159.574 null]
->> endobj
-4896 0 obj <<
-/D [4884 0 R /XYZ 90 105.885 null]
->> endobj
-4883 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4902 0 obj <<
-/Length 2061      
-/Filter /FlateDecode
->>
-stream
-x��Ys�6���+��J3���t:�#�gڸ}I2ڢlNu�����w��Iɖ�4m�$���2��#
}?��bp�T�� #��.�����		M��C"�����#�)w��_�x���
���������pD
-)
]�/_�h��0bFG�ܠy�)��Y�b�� ��`D����f �׌DH�F1D�hL0��<��fq�X�Ξ¨�I����R��b�'[!����*Y��d4�T�]��!RgO��W
"A?�t#ގ(.�I1�[q��f���#��q6��<Q<\�no�I��)����������}3�H��F_�n�GF�]fٕ2Հ��t�'و��:�����n<p� ��
�fWTP���qq7��H)�A�^��n�h��X4��ŀWX�ј
9�Z.�y�(FieS��J$�޻��X]�7h��U"Tkd�����C�AX�i
-��*����1�
QN#uD�@���nM���jYLBy��Tc�+�Y���=����o�u1�S�J�1i%Ť.���rw��5G�>Z�i/&
r �R[+�I�4���~m��ؘb�&P�Ơ����U����}I}�����߮ǒC
-B�*Ȯ�뎢܈=�L�_L$!�d����"�}�>ɶH�\K��i+^	ɒhڒRT
�>�0�b"P��w�����÷�,����S���<Y���
B1G�����P9�Le��]a��~
`�(�-��ɖ#*���DL��S�$�h2Q#.�b
geQ���5d�8]\-�8O/g	��-+���e
-ٍG�iy�̽�%
�.�{ ��	��`
-a�g+��{�AR��}���Mc�42v?n#�=8l�Z�݁/� F���V�1}
|Ő��eE���ė�M��[��8*ĴC��ҟ��>����Nĕ�P|�?*��
CA�߭��l����_��w
��t�.�Kݪ��n$�	��
-��L�
�
-�
��@�CA�Yp["�AAA#
CZZ�����g�#
-:<�[�)"��v�̽(�a?�J�(HN��d
-�}�8݌�\.g
�@am�� }��2�
�O�@� ��
-��V��^
`ڊ�i���V]�	*��k��ʕ��-
-�֜
 � s�aC�9�e}_���^���
{�w�h��~�.f�"y���5GB)���M��pS৽(��]��.;I�@���
oN��=��BZ�]���4��0��"I�H��V|������/�*)��|? �c)d�]�ک
bg�m��
Vْ%�&[JS����]�N:f[DRL�5w��]�1�
e��Y���{�3��^ՠV~
�
J'�速ɨCK�1� 
-����V��e���Y����Vo
-Y��~�Lˣd�~&F�񁟞�����w��
���
�
�A��-�z8�����w���$�NGj�d��*�8yW at w�%Z�1|T��누D��‚�
���\ ɉ���1���̧ٚ%L"��uf!�lş�A��r������J��G��:���"2h�?�L`T
x�����c �j(�\���V �e� �Y�`��V
-�H��<��iy�̽ FC�0��c��_SX�tz��t�H�Cܙ�1MWM �EXY
6k{Pz�	%C���b���޴���hF�]]P	�(�L����p�/?�_vR�{�e_�×
�E���ƥ�6F��2X~�~�t�̓$��d�do���Yd�@����ŕ��ݿ�"�@2V�_ߥ�M�h�J\+����t�;ܹ�X���y��r�Q;�^C�)Z�?)��׿���I�^�v����p�>�ߎ�xc�;�<a�)�Hȭ�2
aI�>��F�1|M�=�c(�hg�׾�ҵg�#];�>�W���	�+��d��Su���,E�����R�,D9j���y0�u_��ݗ�3即gs}�a��1�7� ��|ۑ/0��sm7�
�2�?����v��GB
˒�s��ij��2�[{�彮�a��"?
�H��$z�U�����kK��hڧ7y�:?;��\���5�@�K(�������2+��/�z��s��W���#��?�fa�
-endstream
-endobj
-4901 0 obj <<
-/Type /Page
-/Contents 4902 0 R
-/Resources 4900 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4830 0 R
-/Annots [ 4897 0 R 4899 0 R ]
->> endobj
-4897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.275 215.877 293.971 226.781]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-4899 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4903 0 obj <<
-/D [4901 0 R /XYZ 89 770.89 null]
->> endobj
-4490 0 obj <<
-/D [4901 0 R /XYZ 90 721.073 null]
->> endobj
-4904 0 obj <<
-/D [4901 0 R /XYZ 90 721.073 null]
->> endobj
-4905 0 obj <<
-/D [4901 0 R /XYZ 90 655.872 null]
->> endobj
-4491 0 obj <<
-/D [4901 0 R /XYZ 90 621.202 null]
->> endobj
-4906 0 obj <<
-/D [4901 0 R /XYZ 90 616.718 null]
->> endobj
-4907 0 obj <<
-/D [4901 0 R /XYZ 90 543.856 null]
->> endobj
-4492 0 obj <<
-/D [4901 0 R /XYZ 90 509.186 null]
->> endobj
-4908 0 obj <<
-/D [4901 0 R /XYZ 90 504.702 null]
->> endobj
-4909 0 obj <<
-/D [4901 0 R /XYZ 90 421.887 null]
->> endobj
-4493 0 obj <<
-/D [4901 0 R /XYZ 90 387.217 null]
->> endobj
-4910 0 obj <<
-/D [4901 0 R /XYZ 90 382.734 null]
->> endobj
-4911 0 obj <<
-/D [4901 0 R /XYZ 90 309.871 null]
->> endobj
-4494 0 obj <<
-/D [4901 0 R /XYZ 90 275.201 null]
->> endobj
-4912 0 obj <<
-/D [4901 0 R /XYZ 90 270.717 null]
->> endobj
-4913 0 obj <<
-/D [4901 0 R /XYZ 90 185.899 null]
->> endobj
-4495 0 obj <<
-/D [4901 0 R /XYZ 90 81.969 null]
->> endobj
-4914 0 obj <<
-/D [4901 0 R /XYZ 90 77.486 null]
->> endobj
-4900 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4920 0 obj <<
-/Length 2841      
-/Filter /FlateDecode
->>
-stream
-x��[Y��~�_��D��`p���vv]�7U��/k�G�F�H���_�@R�.�*��.El4�{0�b�0�����?������K�&I��n91x��AB��b�vJ0ҳk�1���<M�M�����i���JE��Uv_$ŧ�ۯ�_﾿yIHK"��q�	���

-�Ц�ww?G�P肛>��L��u��ͮ��ӻ���t�N�Է��.�bF�4�Ρ���D+�����oW��	��H��|s��W<Y@��`Ef��봙p�ພ�������
2B��`j�uC�W&.k5�@)$��X1����M���c�M6v�\��TؙɎM�֦���~F�4�1��i#�\�0��TCs
�O�D4�V`���d�
�t�>_.1\�5c�
��"�M���+�%C��`��M2SӇ�5 �/�/X�y��=����6B����N�,�_7�Q���FT����E�I<�S̲a��~�oweDʐ��:�ʶiR�{�����.˷ٚ"JWo�!�+�N���S+�GW��f��S���,ݖ�א)�
`F����!Sv�ʉ"�*�E������d
Q�T�΅�sʑ42
�H����p�,�=�6�dۤ�
����ꯑ�Ws
���|[
�D�)��~�����$h�[
]�戺y)۽�	c��#����[_�
���1�2����Ҳ��L��`љ�4}�U��}�BZ�}���֮u�P-���^M�:e�匊i�_\
l��4�b�5_F���-��z?mpzs�*ŖO�yi7���$�����߼��<M0> L��1��;��yg��P
���Ch֞�r5�4�=��̾�.|�����F F<�ֻDt,�ƒ�v��DZɞ
Ց�@�f۠`��P��)�)}!��	9�U��p '
륍_�tJ�^�1���h�u�
i���G�V��y%"b�Db!̠S��
?�X�]��s�
�H�"���E$��
���/�B=�VU��D�bw��~Xe�U�T���m�m��
-��E�ş��,`�
�܏)�G����%:�	�gd$�� �"����r�U
��.T&��2
�O��p����qu؎������I
V�K���Z5��rq��IH�cg�Ad]�OY�>
�ڊ��-�f�����0ɺz�%&�\H
����U=���O��[�O��Ƣ�(Оm�~�ia�
�gK����m�|"F��~�q���8�
��3g��;�J�`��e��L �bl6�&
���+Ѿ֒��	G!V2�t�
��BrRd
-�
-�w���6��8 ?Yg�w�W���� �)(a6�<m�
��;Q[J��a��=e�<�VEn7�p�C���eP�=�6
�+�辯
� ���0��:1ے��46���,��L� �OךL$�
�TZ��ӆ����"(X�z�2*��Cd�y�yLʬ	Hk'
5�b����"F�Sm
��r�I��%����mN���FR�1�e�H:I]�������(�:�!^"� ��5��_S��sR�t����o��$1D|[z�}��FB,z�!��
E|
���8R^�ZB0�������[^l"#k
���2���$Y8r�s��; �Ps2�Ι<�s�{w�˹s���p�/�V��m���D� ;�G��D6����K?��ׄ4'��:�/HŹ_��
��KX	y�k��$-DN�v�ܳ(
lD/�7Y�Li
�
��UlX`�ܰ���
�Ov�Dd[�]�G���R���j�
l7�΁�>�@��)�3�Z��?��%�����}�-7��L
G���$�f\��c�j���^�F��h��E�ۣ��g܋+�
�<s�K�
�S��@<9A�'}�!���HB�"-��
�p�c�M�6
����#t��A
8ᴨ����)2�О49�v�; <y�3ˣ�G�9�
��z�\%ՓE�1�<�T�|
-�G
�>�ġ��ۑ}O�z�*���� �<mp������:�m�T?v���P���X�17��Oc��U>ztj�1��5�
_�w
RQNF$�Z/ ��'5�:�7�<kb�3��`�mb�!��{j 
�
-� �&?&����o��e4�h����
��E|v`n	����؟*��@����G���94��	 "
�A�'�0Rڌa
��h�����9@"�x�7:_�� �2H���vK���M�i���sy�ʪ'���,�yY�B  �m���J��u�/�u�R��Ǚ��4�w�}�o��Ь �ՙ�E��������K,ῴH
�P@ԡ@���r0��`�=g
��
A�
��p�
���*։��Ej0�p�� �����T������A�+V��t���t*��t��ST=d��8BՐ/C��Vc)G#T�dj��
��PՂ8Q��&^�0��X��Đ*�{5���Ĕ1����؊�L�TM<��u5q0��w5q�Qf���X )G�&��bb�Z������zbCݢ��y]NL�^��v919������&&�r^WM�
<VM��ǖ
��r���Ga�'2"�1�D��[�J5*M���N"�/�#Jz|Fz�yFV>�GV�?�~��H<,�T�-��x��YQL��
wr=�ı�W��V�?�~ Xf����ct�
Rĸ�l�jbb�7.Ϫ&�P�8�����T�o�~�K����sV���!Eٱb]�A
lQ�/-S�H ���շ��vi�Ǚ���P�}��Ԯr�?헞 ����&��k��&���\4�W��%��'*��|����zإ�4�7ϳ��<L;]����E5�lk��9�չa�
L '��%�����A������
�/V
7�m���9x�Z�3�'
-endstream
-endobj
-4919 0 obj <<
-/Type /Page
-/Contents 4920 0 R
-/Resources 4918 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4929 0 R
-/Annots [ 4898 0 R 4915 0 R 4916 0 R 4917 0 R ]
->> endobj
-4898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.269 661.939 238.02 672.843]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-4915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.953 449.748 250.388 460.652]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-4916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.089 196.421 246.767 207.325]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-4917 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4921 0 obj <<
-/D [4919 0 R /XYZ 89 770.89 null]
->> endobj
-4922 0 obj <<
-/D [4919 0 R /XYZ 90 634.093 null]
->> endobj
-4923 0 obj <<
-/D [4919 0 R /XYZ 90 555.697 null]
->> endobj
-4496 0 obj <<
-/D [4919 0 R /XYZ 90 509.072 null]
->> endobj
-4924 0 obj <<
-/D [4919 0 R /XYZ 90 504.589 null]
->> endobj
-4925 0 obj <<
-/D [4919 0 R /XYZ 90 421.903 null]
->> endobj
-4926 0 obj <<
-/D [4919 0 R /XYZ 90 343.905 null]
->> endobj
-4497 0 obj <<
-/D [4919 0 R /XYZ 364.289 267.7 null]
->> endobj
-4927 0 obj <<
-/D [4919 0 R /XYZ 90 261.06 null]
->> endobj
-4928 0 obj <<
-/D [4919 0 R /XYZ 90 168.576 null]
->> endobj
-4918 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4936 0 obj <<
-/Length 2457      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�SKΘ��_��L���$n��j^܌!
-S�T at J����- ��\O��
< �Ź���O��$��7g_]���͈���N.oG#
Q����Sz���w�Ж0��U����p����w����˳_�^ф��\O���L�1
�P"�M>�����׻���?�heKs%\�[�,�̕��Jeb� ��`��O���2���A"7T
^���T��N�� �MZb?�LL�K��D����	ı5�
W�.�֒X>g�p9�(��%$LM<�qB�8�gaj���E>J:xL���UZ
�L
��lfk�lp*1�"��p���~
-!	�f���
AN
��n^��!W����HI7�o�oX\����Dp[��q6�O�Y��alG�a����
�Ut�k5�|T>ɇlЧKSB����>��)���A�l
�pٞTG�f��S*�<#�6c���b��"
��s a��;*͈kA��Ɉ1�T�|v=�ާ���
>����ﯽ�6�
�ת
�^�)	i�	�7�/�M.�����Zp�,F��2F�<�Ad�JQ��'$����K��EM�'��]
�t|꤫�%XsD��QJ�lz�.�pķ�C�j��1��7��f���>��S`C0>���
��ڔ�?�H��fI<�
��jv�2��
X� ZLӫ�C$�=�f�"�z�(�������
sP��NK���{5��"��
-U���s�����pd�,+P~-�Ǜ�s���h��
�
#g]��M,0� t,
-�4�d�vn�&�,�T���ZA3�Hޥ-��4
��~#�8��h�\
��:���S����0�Ѯ��Gd;M��Qde�̰�ή�=M?����Dp����n�4}�3�(��5V\�[���N���.p��,-�^�
-��E�b7uX�����>s-���
�x��`t'	YX5K��yV"�:�ے.8
���ߞt
��𢨨�ԲH����	]W��0���^HSƾ���n�ͬ�f��@���k\0�b���V�0e���	��|��u.
-9H�J�������&ҙ�@����
-��c��<�0j�W�&3_��
,�=%
�W�
P�����M�r�AYP��0�n{[
-ʼn�&�����6h-��}v�lB��YL��bR��oΒ���:�#��_�7����k%8$��Y��)Īf�^�q����(qp/kQ�&�hV������t�E�Xk��*d-���1��Ru{��ғ�#*�B�z�NT�_k�5֒�%J�C� �����HQ��*��ͫ����>�b��Z�V�d+ z�����⦙����Q�#k��%
���S<��D�NB!�1��ׇn�������G$����|[�I��M�2Cma�=�
�93P�W
������9���@�i�{���b{�� �Ao����촶�i��'��E��
-�k�e
ڻ������m�n>��>��U�V�����n����n�k-�?�٣�\�\ߎ����D_l�}�Sq�'X��W
�
��iy�Ԥ�� <͜~�͹ܕ9��&n�Z�d�E>,�%�x����IUP��L��k���Ju���ӌ�Jۘ*��)�Ͳ>��HGE>�ݑ�6�S�

-۪�Pw���1��F󘨋-�D���hş~�:�m
"�(:��
`��ۇ����]ۜ ;��wt& ��
-x����w����h�1�
�0����%O��Uߕ{��
(���%�Q�D�v�ܛ����nٮ�wޙ��C`~tp�b�K�*fx���i����4)�����>=�
2���
��I��$�@�IaH��dZD7k2m���ȴ��/d��!��
��
2�蕲=uq�Zh\2�$�{�4����f_ȴ��&0
�F!Ӽ(e&�"h�ɴ�f�k|����4�
�
Χْ=>�PSZ>�P[e�|�n/�&���s��.�&<�ã�i^�����"������>m�
�§	B��Q�U�ж�4�4��I�����M�M[W���Ԫ(��.J��5��]u��RC��."��P+�ԤՇPjX��7
-T�ȩU��%L�J�����T�2H5n-�,�iJt��7��%ո���<R�D;zO
;v|����o�
-DR�T�.1���Ѹ�GR��(R�Ds�A�6�tR�x�O-D�T�.1�E1��qI5�*��ډ��C�m�E�
��v�@�P1I���)� #�jG�=�T;͜~ص���&Վ�vLB"�Q���%>�T+�l|R�Y���T�
2˵�4Ҟ�I��$�@��M2��H��n֤ښ�Ǒjm7_H�R�O�
�R��.H..�v�̾���C���o{Wէ���:v�@������}����zp��T$�C�J��F+�u
-��\\�?�g����v[�o߄�-���C�:���
���w&��cɊ(���	�
��L4�������JH��Q
t�dn�������E6�,������%�4��^��yQ9���pZ�(k$��X�/o�:
-endstream
-endobj
-4935 0 obj <<
-/Type /Page
-/Contents 4936 0 R
-/Resources 4934 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4929 0 R
-/Annots [ 4930 0 R 4931 0 R 4933 0 R ]
->> endobj
-4930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.899 587.544 431.977 600.462]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.307 327.134 434.874 340.052]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4933 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4937 0 obj <<
-/D [4935 0 R /XYZ 89 770.89 null]
->> endobj
-4938 0 obj <<
-/D [4935 0 R /XYZ 90 718.682 null]
->> endobj
-4498 0 obj <<
-/D [4935 0 R /XYZ 90 672.057 null]
->> endobj
-4939 0 obj <<
-/D [4935 0 R /XYZ 90 667.574 null]
->> endobj
-4940 0 obj <<
-/D [4935 0 R /XYZ 90 560.977 null]
->> endobj
-4941 0 obj <<
-/D [4935 0 R /XYZ 90 458.272 null]
->> endobj
-4499 0 obj <<
-/D [4935 0 R /XYZ 90 411.647 null]
->> endobj
-4942 0 obj <<
-/D [4935 0 R /XYZ 90 407.164 null]
->> endobj
-4943 0 obj <<
-/D [4935 0 R /XYZ 90 300.567 null]
->> endobj
-4944 0 obj <<
-/D [4935 0 R /XYZ 90 197.862 null]
->> endobj
-4500 0 obj <<
-/D [4935 0 R /XYZ 90 81.969 null]
->> endobj
-4945 0 obj <<
-/D [4935 0 R /XYZ 90 77.486 null]
->> endobj
-4934 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4951 0 obj <<
-/Length 2879      
-/Filter /FlateDecode
->>
-stream
-x��\[o��~���SK�x��t��b�)�&�d�lѶP]���K}��}(R�%&E� ��љ3g�s�8
-%\E��.�������WFD�8�ut}9���k��%v4f���͈�x�.&7oF�ƫ���d�Nn^�n�I����էѯ�?]�b�!�i
q�e��	&�$�����
R8��j̟{�W��~>Y�Gc�h|=r<NO��&ɟ�M�t�l�,���1ec��z����
14b�516�[\���FS<�	V�F�A�Hr��<zw�
�93/d��e�`i�u����ěR�]C4�-+�
1�����,'
�N0�cSe�-��zJ�#>���W�i��
�Z�O�p��K�:��17�8ɣ1
�~���*�\]=��
I:�����Ow�
'ND�9"��
X`�u0v���"��L+՜��B)_&�s�P5�̜3‹ET3����s�K������҉�n�\o:�
 r�����2��7/?=徵^�V��[A�c�~Wn�i�y9b��~э9j*��M�7�������j�%�(R
M�����E�zc!`
)B��KB�{�	�E�
0�,�}\w9�A�����2Ԕ����Ō&ai�9a�<��_����J���*�������YS�BEa�
�U;�y��
-p�M��$��{(nW�
�+h����l�O�&��nSY �>&�-������"z���C'#�oL�G\Ņ��sD�6�6w�2b�m �@|�8��đ�8�(U��iW,G�d�Ȉi_�c�Y¾��V`-����]����Iڕ��/�����!%�D#P�5+�t��T���Z����#]��������$0�1���C��պV��GaoGfQ
-k�>|�2�!5NR�ۍ/,X�%����X�i����]�h�n�*go9��I��/+�0��F
���Y�F
-B�y�
-�D�&�
����o,�9
��G�(d
o�q]�v��o��ɲ��z6->m���S1�D�#��1�i��XL��C��jH<
-1Ór�H���╵
�""��b$L\E�C�:S�nX5չ�
���*�n��S�p`\b�P����"̈́�-�
r�A���G'J=j��

ψ>�(@������C��� u���Լ�;Yt
TFJ���.��t�<y=��H�J��@�O�����0��2s/C֞��+k���k�̞�\�hy
!i���U��Tx1hLQ^�7ӫ��r$i���f�����"Yn��S���AW�� @��T�Q6�[j�� �r���1]y?�X$�YW;%9
-{6L?%i5�,�3�Շ��
���	��v^Ĝ���(�9"��;MPk�$�ٲ1��K%�PWcP�V��������y�KB$�nX7?G�A�R:��UM�R�o���k)������Ң
)�ì� 3��e03*�q)TI\���`��SX�:��v\�CĥE�2�#.e��c.ݭ���̥i3���0��0���Ĕ9�2�R�n�RK"��
-�%4��K(�1��{�K
�K<h5�usI���X�R�g.y�\�#�Ksq���%Bq9N��W���CfVb�v����Kuq��H��o)=u%�����55��ܰ�%�dR�H��L5:���_��<}-�{�E��"����%�h��l��D'��uiy�6��
-�9��<Y��}���dC"eh�9R
*74�CR�—M(��CY��G7H�z|U�����o?Djk����GY
-aы��9K\Ÿ����2s7C�Ϝ��l�<���m����8�!WZr�����Y+��Y~�����wIf�svX7?G�AΒ[M
oq��g��8K}4gy��.��<���#��ZC��S�Rߋ2e񱇧��t�����t��p�I�eNR��/b*g����.O�����Mx*�5`��0�4�}L��t�%�'���5,{hAU���r
;u���$�}�e��g
��;d��@X�F�
�3�$�!��ڢm���@PCek��YF��S(���ߖ��f�5���*�|�nVV&��n���i��
-�C�
�ݤ��f}uU�Vkz@9����k��i
�O�{xu�f?#�rO�.Vy�4Y���d�R`�-��ԅ/��I"��
-�|�Z&
��V�آA�ӒXo�L����o>P����V��vG���p�f�Ԙ����$�m߹a�b ��(ݢߡ@M����7�^�
�ԗ�n5���аi��>�:�iu)��4ӻ
����vS,��9BQ}�;�
��̀8�����GK��)Cj�V��U�]�� �s(��B���e�Kfx���9��m� ʢ�"��o#�w6H�Q�
U��\�X�)r�Fc45�	�m�>Xb���:D
t��s6��Ĉ��g�Ë3�I����A��5̗��V�7��Tz@�fh�!�
�D���P�8��>������!��L=:y�@�����C^Y�fO�OS4b�˱��.X�ȣ(���z�
-��%��R� ��-���S��!ʗY�7�o9ʨuc��Ӎ��>Ɩ�E�u�D}bj�sNI�y��gˇ_z���~����j��׃K�a'U�#�a`Y�L"˖�����;O�n�5�9vۧ�/	������n�_
.1�
�G4���sd#vq�c���y
'�k���;K�n�5��gs�n�X��Y�g��e����)Z'�?<�߾��'�4��G�����Vg�4�&�r����Iqf�q$�ˌ�eϹxtԞ���7�ra�-����
����M��.����p�����
1\
���H�@�?K���5ڹ�͛���?�I���Rq������R��<$�t]��g��5��wI��J�+*��v�u�*LI��j?n6OW���ۇu�|  �._�X��Yx�qݗ�x�J�͖x��*HR6[t(�	�KK���a�(3Y�������Ń�"��
-�w�? "(
-endstream
-endobj
-4950 0 obj <<
-/Type /Page
-/Contents 4951 0 R
-/Resources 4949 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4929 0 R
-/Annots [ 4932 0 R 4946 0 R 4947 0 R 4948 0 R ]
->> endobj
-4932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.631 661.939 429.297 674.418]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.883 449.748 440.282 462.228]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-4947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 224.324 422.924 239.039]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-4948 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4952 0 obj <<
-/D [4950 0 R /XYZ 89 770.89 null]
->> endobj
-4953 0 obj <<
-/D [4950 0 R /XYZ 90 634.093 null]
->> endobj
-4954 0 obj <<
-/D [4950 0 R /XYZ 90 555.697 null]
->> endobj
-4501 0 obj <<
-/D [4950 0 R /XYZ 90 521.027 null]
->> endobj
-4955 0 obj <<
-/D [4950 0 R /XYZ 90 516.544 null]
->> endobj
-4956 0 obj <<
-/D [4950 0 R /XYZ 90 421.903 null]
->> endobj
-4957 0 obj <<
-/D [4950 0 R /XYZ 90 343.506 null]
->> endobj
-4502 0 obj <<
-/D [4950 0 R /XYZ 90 308.836 null]
->> endobj
-4958 0 obj <<
-/D [4950 0 R /XYZ 90 304.353 null]
->> endobj
-4959 0 obj <<
-/D [4950 0 R /XYZ 90 194.714 null]
->> endobj
-4949 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F8 794 0 R /F13 834 0 R /F93 763 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4969 0 obj <<
-/Length 3294      
-/Filter /FlateDecode
->>
-stream
-x��\[s�~���S+�DX�A�mf�t�I�&۬�<�m�6[�R$����x�J����!O�I��\>�
�٥��
}q���՛�1�I��
�<�b:22&J����1S�䧛�FBG���r�?������ܼ����\�|��XI@��W?�DG3<�jD�����h1�\�s>z��+Z��|��W�Qq�-�QL(�#���*�y��}�*�e�q
��ۢ��n��<�Dqs�{��h_�ُMƈG:�D����#.H�v�2|�]��g
��9��C�%�u:z�)M�c�P*����4�bv}��I���<��&�0���"͋�Z}��T��bH1!
��w�B��9u����y�^N��'S��8{���p���$':j��,͗�,O��\���&i�6۔d��b|3c���F`\�x~w���
-m"%���Ut�nV� In�j(n�)2Iѡ�J6�|V��KT���T�d!qԬ)��M`ש������XU6I�)6Wt<� �
��4�URdw���#>�zdB�N�#���D�HHյ��ˢ����Ur��N��C at 3�Q`E��~D7%��5��S"��8�^h)r�V/�y8�X��i,�*
R;O��R:.��j�i�o�:?5�h�@��
-��!F6
��U�'
@C0>���� IeH�
->
P��)��t��x�U�
�,&Z7�z7a��z�ܾ�p q���������:Y�\_��%�J�>(�c�9a���D�0����*��=��w�m>Kg�� iasq
'nP�o)�m�p����!����9��#5���
|#��W�4[$���4[7b�s�K
4N��I�a�,������1
�ȱ��h:�$d՘�6~�#�*
pI�l<��Y�&�۷6\0�q�o�vO���w!V#�kcھ��ζ����H/�o�t����ѣ
D�qW��>�&a�В�x���:�m at K\��ˑ�Di�k�rG���45Ap72|�Lݱ���|��V8��Lf�mb�����k�N�bs}�ig����p��#ػ���~�>�P��4��N䙱
%��
����rH������e��	�೻�u�[�
hd����U�nn� 1�g�0���3���\�F�bȀp ��C$@
-�L�(-7-}��+'a@�1j��ԱМ�Y�T�`���(Y(��6��J����
-��}q5��-��[�<ز�
-L��:EfR���Q�H�� �ւHRb���Ru
��]��r�V�w��D�f�`�)�p��Z��L���L"韡�n
�(r&\E� B\���)TmE.˅���(��0������*>���*2h`WG�����ݵ+�T�
�
�*ιQ]��c��D��!f�
-��.���
-5%���SJYT�Ng�
�K���1���dۚ:oE����5)�%���6x�e�:�&
���eh��H!�Yu
�֪h�
\��X!G!��{uo����xx!ڏ1@
7>7OU�l}^�պ'��
�ج����,��;NOj'��#1b
�@�~ [M�!�54�[��5�a��3
!�U� #��S�꨽�1�]�Oc]~���E��s-wK�cj^����{����puV\�����lY�A�Ԉ!a74�v�֥�@�S8����jo0_���	î��ɰۮVrg���4Gn�^	��):�Ih�Ư��
 �"YQ5 �‰�1�]�Np]vJ�E�z���b�W���ة4���R�K�������R�K:��+||⽏�M��r5uMG��6^'�
-��"�'UUe��QUۋ���
�mu.���r
�6B/v-E�.�
��	���*�*>x��޳Q�>C�>��C08G�l�v(^�n�B"������Y�[w=�����[��W�pU�5\/k��}��� (��u���<�pQy��5\�Gl�r
�5\|�:�q�ܜ�q�P�A:��Hǵ�PX,����rB����	��*�qXs�X_���`}�[>�'�Mh���a�}�~��6q
	�vN�����t�'S�toGO0"x�
z,	�itԐ��غ�O��i2ݘ�%@y_�Oo� �q��wM
���l�Ƀ_
�taJ��&����4U@]Jۀ�-���p��.�)�vPY��z}��4��X�X�>�k"�95���1�G�l5��_���~lj[�J
^�c�P�h�@P�^A�[tHv�����U��=,1��吒�e���up@�P
�I�����w3���jN"*�6�=�4��@�o��#�W旐<�?r��$b~�(��X{��<��:Y��4J�Lqb��h\O���YR�+/�׬Jޔ�ɛf$84��}���ދ
X�
�cj���gL������2/��t}{31r
���`�<�Y�ڍ���v�������J�t���
IC�h�J�67�5���~�����X
���g��tm
��~��Sj�h�epb�#��c�S!)*�ݑ),^'Y^ܾ���
-J��~\�5�q6�7��<k:�O.P,2y�H��;S��Ҭ�e�S x3/��ZB��;��&�
�BZF�i��mn�]:�6՜��O.� Y������փ�E �h�|�O����Y�z,
��� KԜ����r
$�ȧ0�}���qt�Ј+�y�k$�g�s6�&��K�b�F��iѬ�ih�����~�[^�F�����M�"k�?;\�َS=ҤX���곕:�oگ��5�%1J��
�c��yZ��("l.
N��P���a����g���n.�36�tY/b%�d�Xi������=�_6|�����.��w�>7�U�����1 7E���{���zo}�*���=Ws�X�C�E�V�V ]�� ��	��ܚu�v
-^/b"
�.�R��vi&�j�$�~��۷ȏ\�]�
\�m�v�E�}e�O����ʻ��mt<���\�^A�!�:4��v�(��@V�$<-B9�N�O��EL�!�e���ν�Q��Jq�\��g�
Mԙ��S�n�î���YM5��O�]K��w��j�20�r��=Wy�Hc��1���
v����c��CW��Ũ@�\cy
-t/�!��.%r�3 a�zV5���,�ݥO��<x�\N*T�iQ�b�%
��i���4��b�
���t�hӡQ�
2�s��
@�F�?���b{%N��+��q;��&'������w���M��͗
1���ZrSЛ�k<�-ˮ2s���?�|�����?7�����U���$��t�F��\;�l����
-d���:-��O��߮\5���S�>���͛��#��#A���<l
ǰ_s;�P�^�e}3��x�pnݯŀ������
-endstream
-endobj
-4968 0 obj <<
-/Type /Page
-/Contents 4969 0 R
-/Resources 4967 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4929 0 R
-/Annots [ 4960 0 R 4961 0 R 4962 0 R 4963 0 R 4966 0 R ]
->> endobj
-4960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 587.544 425.662 602.26]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-4961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 349.281 322.446 360.185]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-4962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 201.399 116.998 212.303]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-4963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 160.203 243.45 174.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4966 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4970 0 obj <<
-/D [4968 0 R /XYZ 89 770.89 null]
->> endobj
-4971 0 obj <<
-/D [4968 0 R /XYZ 90 718.682 null]
->> endobj
-4503 0 obj <<
-/D [4968 0 R /XYZ 90 672.057 null]
->> endobj
-4972 0 obj <<
-/D [4968 0 R /XYZ 90 667.574 null]
->> endobj
-4973 0 obj <<
-/D [4968 0 R /XYZ 90 557.934 null]
->> endobj
-4974 0 obj <<
-/D [4968 0 R /XYZ 90 455.229 null]
->> endobj
-4555 0 obj <<
-/D [4968 0 R /XYZ 90 408.604 null]
->> endobj
-4975 0 obj <<
-/D [4968 0 R /XYZ 90 404.121 null]
->> endobj
-4976 0 obj <<
-/D [4968 0 R /XYZ 90 331.258 null]
->> endobj
-4556 0 obj <<
-/D [4968 0 R /XYZ 90 296.588 null]
->> endobj
-4977 0 obj <<
-/D [4968 0 R /XYZ 90 292.105 null]
->> endobj
-4978 0 obj <<
-/D [4968 0 R /XYZ 90 185.508 null]
->> endobj
-4967 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F7 795 0 R /F8 794 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-4984 0 obj <<
-/Length 3079      
-/Filter /FlateDecode
->>
-stream
-x��[ms���_�O)5��J�$3�咹4/nν6s�xh���J�BJ����@R$E��b��L��$
.�g�.!:����ۋ��/^}��&�����~��(��(O���Q�'�R�]���|�\�9����<������m
�O��_eǿ^�����C��xV�g�KkP
��o���H��B�>_�"t���"*��+�]�5���j�c��s|�czqz�&�T�1��Ћ7��]0��#次H��~��)��Q"t8z���#���ѻ��]�Ұ�(s���v�1FՇ���t��i=�&"8(�
M�:b-tˎ�2>
-('��Μw��ʚ��F�T��h<S�v��y�V�*+��v�
��n
w�ʒt�E���]#w���b�G����b
/�x"y��c
���,����QC�<n��N*�
q���`M�*
�	78�^R�+��Y�S�`��ǫ<.b����SV�4Y'Y-\C���"�VI:�{A��]��l���d=�F(V�][K�4J��������c
��|�������>ˡ<̥��{�X��}!��$�=�٘��l�ڬ#3�Vv���YAt�j��&�Z��^��I�t�g=�.�4�	�[�6�d̕�����
fӯ��x��Q��xW-٘I�a̔g����u�D D����>�ݪh�N���h�1��$u}�s��<ڸ�T����6v�e���_��]R���yձ�Q��*�d�Qlk�h�a_��&�]J
3L�\1�X�V��	�1��a���ptJ�*$CMQ�m��%�yէ�3�P�Ѭ�C"�|��D{C����"���V����ۙ��F@}l>Ԥ�g�F ^���>��n�;0�
�N���cxq1�ӓ��s��8Z��Ꜩ��*ʣe�6u-�+d�Rx��=�g�����Y9����}�
J.TkY6O�%��4��
���$	6 [...]
|>��&R–����
-v&�G���؍���!�n���	�=O�~�6u��C�
�lF�:,��}��Z2w�����\�Pc��#���Yo>��+��-
��3����C���\�
�
/�95W���3�+�J4�5$�v�"#;y<�?
'T@��
�t�����KP�ԇh�Lo"���6�-
D=�S�[�'f���D���������ł��<��yf��#�y�}{� Gaxy�����=�
񀩪��Ls���&�M�Q�T�p�.b���qr�ei�d	,��C:�3Ƽ(O"#�Č��#)*�|�r8	C��0�vU�nk�" �6�C�����l��kt0��s�~�1�L�
Y��p���C�#
��!�
��6
��ėz[�"�HU���Ui�@��a���
�@�
�O�8��d��=5/t���WK�QO՞�0��˒i_mL�UǗ�L����U�H%o�.��e�/��.�]^N-o�V�e:�+r>�!�G�?�
��5.v�	"�aV��K�Ud˸gTCq���j�L4h��f��&���� �rl�\w5���xz�8�
��dp)�]w�l+m62��}�� ��u\{m�Q����o	���"���~��H]�C}�3�b$�5�����?�p��������Zc��6n+��z:�y"�sP~
O��ni�p�d6_�iѳI05U�)��ߙ[�m9�4�� �}�md�z϶&��
|mM:�2��,˧I�HY�6�m�c{�&�}�D�2Z!�Չ��#Ĺ5�s�����%Z*-���w��
M����� 2�-����Qo���躪;.�������++Z�}�����l��,`�%x7�)g��ľ|^�!a�:B	�K|^+B [...]
��� ����PQF�כ<G>U�y���E�U��Y�zu�W��&���v7�-��~Y�R�VL�XU%��^P���9�������
����-�%0�m~��
-��`�I�IT������^�T
�H����QT��H��d��Q2��ikГ�����5x�y|�1҉�}��#� 5�A�ޜ;(
�ͻx�(�~�.���א(4
���A]�i�Ȍ9
�Î13N��>�Œ��Œ�V�gŒ�� �K��@,���m9r�%��b�h��֒%�u�%����]W�7�rg wݕ��YQ~�0dY����櫿9BP�u�3o+��V�z�����$���h<� �dX�K�4
��5�K-�04�*H�����)�<]z�{K���)���S��
�R����Nan�E�n
߫B�+�$��8AQ�:ߖ/M���wQ>=1!x���c
2�
\�C+UDr�S����I�������t�|^�!�
�@��X��N��j�g���O:M�s�c���/���<�t��W���aKRZ
�N�kw�#P�M��u{�F���[��n�L�
e?Ԟ���-jQ������O��
ﳣ�-z�I�`�5
���z���}K��BxT���_�}���L@�6��w [...]
-�.��P��׫�W�n7�"Ngp�vc
H�^VO.�bݙ�ߢ�*j��2�������Rʂ��
�{���Ų��ۥ}������;
.�
-endstream
-endobj
-4983 0 obj <<
-/Type /Page
-/Contents 4984 0 R
-/Resources 4982 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4929 0 R
-/Annots [ 4964 0 R 4965 0 R 4979 0 R 4980 0 R 4981 0 R ]
->> endobj
-4964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.622 626.029 373.222 639.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.622 601.72 373.222 615.668]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-4979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 537.506 485.603 550.024]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-4980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 74.333 340.17 85.237]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4981 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-4985 0 obj <<
-/D [4983 0 R /XYZ 89 770.89 null]
->> endobj
-4986 0 obj <<
-/D [4983 0 R /XYZ 90 561.381 null]
->> endobj
-4557 0 obj <<
-/D [4983 0 R /XYZ 90 514.756 null]
->> endobj
-4987 0 obj <<
-/D [4983 0 R /XYZ 90 510.273 null]
->> endobj
-4988 0 obj <<
-/D [4983 0 R /XYZ 90 439.542 null]
->> endobj
-4558 0 obj <<
-/D [4983 0 R /XYZ 90 350.959 null]
->> endobj
-4989 0 obj <<
-/D [4983 0 R /XYZ 90 346.476 null]
->> endobj
-4990 0 obj <<
-/D [4983 0 R /XYZ 90 253.991 null]
->> endobj
-4559 0 obj <<
-/D [4983 0 R /XYZ 90 155.41 null]
->> endobj
-4991 0 obj <<
-/D [4983 0 R /XYZ 90 150.927 null]
->> endobj
-4982 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5000 0 obj <<
-/Length 3143      
-/Filter /FlateDecode
->>
-stream
-x��[Y��6~�_���Te�����Vَ7�$�x��}qR.�
gF]9
Ͽ�@R��:��!)=��h�}|�ă�
|�rr����

2����v`�@q�������!�x����#�-w��/?O^�<yg��x=��xA�/< ��@J������ #f���=4p��8�����xi��
-{j�@sá6c>P�!�=7oG��u6��|="dX8�v(GG����i�ۙ�Vf��$�̭E���4	,�Q��	2Bl�����"�����ɯn�:I��Lȶȉ��Pr�b4�����Iy�����	p��`�����` J#�3W�'x�\��t�����¿Hy�E���~�W��H�6
��zy?-b
�67Ϡ�
,�D���FK������WpE�1�;u����
�5�Z!�t%��A~Q�x� �Sb�\���"����r��V.�
��ҟf���bz��>�� �8ͮf��S���tq�/�����a~U]��{و��t�!P.<����
\.����q�p�Fz(�=�x�/�Y�Z͞<n��Ŷ˻����?�_
���7��y�qZ�W/n�i[�꭛|�=U�����LJ
�%��S�۽,�Q)����s��)d��b}��:w*��e�apt/�.�G�Iz���
�V�`o	
�6I�^���O8�`�+"�|p��v�0X
I�X�BEysy	�����fӛ�z����a�/��zO1G��3�����2��j�TC��
�V�=���zi��ceR���)8h��AK�q�P���������y�Pш;��D֕����p
-�Q���z9_e��m��b�v�^vo! ɰN�-ϡ��H����Be�F0�z4&[�?_Ͳ2�� ���RH�F �V�c�88d�<P>��� 6f�o&���m���
i�=�1���i�M��?l�
�Ca at dLMh��>5����H
g�n&ȹ��v��l��)l@��}Wœ����md��7q�}�����-��$\;�lB��Y1��
�2{q̄AJ�*ƪ���H
-���EA"��n���$E�-�ĺg�(�jE��D��h̘r
W
�!d�Z���FB��C�_�曘4�<B��W�5;G
RY��R�8�FU4Q�dTf,��udL��`�$�P��֘�����&�{��=�	�
Vܝ
���$Y?&A���\^fEn��M���(�gʬ�4Q�lH���r[6�L|}k�#;u���A����5�z�}xk����>�Yg~�^�����eǞ�Y��j�0��CunjL�s{�JɈ
0� �}`T��L é#Eh�"7i�����r�dd�<�D8rV�4��S�2�јKn!���7'��M����v�҂l�D�k�-(�Ԗ�n���
يr���rQ>�;:��o}�7���ZȭFm$L� ;܊�dž�
�\
nM�:��E�ޜ�G��h�� 0�:/
f�?w0��竇�p���q��[��U^>�y
M� ����z�;n� 
-�� &��0H��
�0J�
�L��Y�St��
)�R��o;Wr8N&Q3��ώӟ����$�)<5E��
-��0i
L��p�+�
{���aQ
������6?/j(�v��wg��8�ơ�7��z�(���{�0%;yf�*a�����I�fS�:9�P���E^h����y��u���1��\T:��j�j�l���c'ϰ[%�A:i��t��UD8D66J]�FsE�B�_���{�Ȕ��s*"
�=̒UDRδ��lM�ĊH0ӿ*"�"r������9q�my�ފS
i����F��8� ��))h��
!�@e� )�$�,���Ԃ���Ti�H0�P�l:~��Y�
.d�S��tfE@���FG�T�!���$&ŠWPF�m���\g�%h
����
��[_�������긩��]
� ��
-'{1V8Ӳb+�튀FGԈ0q�(6��kڔ#Lb��SkȪ��
-0���3x]��H	����t1��/���b�mA�`7 ��
-_�
�P`�h�:�c�6�
ā�l�J�+��D��In�t]��;�
-v�}8��p�����]m�Q�
-���W���1�K�/n��kr���E��u�	�5��"3��	݈:��A�盠��@�1�a|`G�H� �
����U�ѕ�f[�M��BBA�$
DN�F	X(�Q�9$�)ӭ�]bAdԔ�FmE��c��3��&�v`���VG
�Q�R�SS�
-.�
AӠV)Q��|^��yl�U��Ƥ6ͅ"�
-km��	���4�[������|�֝<�n
vLJ�KM�k
H'횧�8
������k\�����j������	@0�W'<��0K��a牤@����
Q�m�hm脇[��q0:L� ����	�Y��[����ư�`�6�E'6L�N

>��=�0Q��2})'ی�sJ�{
]��������C2r�G�Y��'���=��*�����
� �@�'��{ �}�v��{J�G�sh��ބ���� ,���P�
��E��Nz��I=_�>�L��I�K^�	���4px�}"��k���
�xr���Xc93`
�J·�HAL�}r��c�11{��W�����Ɂc	[A�Z����>e⪣�A����+
}�@�h1 ;��
0�V���|o�?'�t&�������
2ɐB!�L8dO�_g�`�6��P�sa
�2�K���tU9�-�i�7}m�J�>���6�6�l��%(���_+��qL��]�Z � ��L�"[�v����;��!�3$	
J#>6D]W�l����������x�b�҇�<��dݤՊ��C2��;�\���
DԮ��~к�e�-Rݫ�{-
��|o.�ڵ�f� >�������
�I��x�}��?�eQݻz��e���T��UBH
-�cX[�f�k�x�v���H����#�҄��m��6RW�'���ݟ�;Ս�o�l���mȍ��xC�NT�=K�}�@���	1�o�'�-���F�&��l���Y�=8�.|}n�=b5f`]��5N����a��
�	-~�-�4�p_����ϯ
�|q� U�ݘ��
lc���ۺCs��K�S[d�;������t�
-endstream
-endobj
-4999 0 obj <<
-/Type /Page
-/Contents 5000 0 R
-/Resources 4998 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 4929 0 R
-/Annots [ 4992 0 R 4993 0 R 4994 0 R 4995 0 R 4996 0 R 4997 0 R ]
->> endobj
-4992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 671.2 362.353 683.534]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-4993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 524.912 340.17 535.816]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 324.677 276.047 335.581]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 234.863 362.353 247.197]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-4996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.011 88.568 513.996 99.472]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-4997 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5001 0 obj <<
-/D [4999 0 R /XYZ 89 770.89 null]
->> endobj
-5002 0 obj <<
-/D [4999 0 R /XYZ 90 720.814 null]
->> endobj
-5003 0 obj <<
-/D [4999 0 R /XYZ 90 642.816 null]
->> endobj
-4560 0 obj <<
-/D [4999 0 R /XYZ 90 608.146 null]
->> endobj
-5004 0 obj <<
-/D [4999 0 R /XYZ 90 603.663 null]
->> endobj
-5005 0 obj <<
-/D [4999 0 R /XYZ 90 509.022 null]
->> endobj
-5006 0 obj <<
-/D [4999 0 R /XYZ 90 430.625 null]
->> endobj
-4561 0 obj <<
-/D [4999 0 R /XYZ 90 395.955 null]
->> endobj
-5007 0 obj <<
-/D [4999 0 R /XYZ 90 391.472 null]
->> endobj
-5008 0 obj <<
-/D [4999 0 R /XYZ 90 296.831 null]
->> endobj
-5009 0 obj <<
-/D [4999 0 R /XYZ 90 206.479 null]
->> endobj
-4562 0 obj <<
-/D [4999 0 R /XYZ 90 159.847 null]
->> endobj
-5010 0 obj <<
-/D [4999 0 R /XYZ 90 155.363 null]
->> endobj
-4998 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5015 0 obj <<
-/Length 2893      
-/Filter /FlateDecode
->>
-stream
-x��[Ys��~ׯ�SBV��91%�������&�x���.D@�Aв���� A�7���"0h�5=��
�4��h��ɫ����ibb
Gg������wY�n�(I�
F)���3:K�U��͜�Yu}w�gu���N���W՗���_~�X�#�c�����֓
�B�~8�����naZ����z=_pEggs�g���:mr?�6���9Kfy�Đa*���Y�'ߞ�|:a`C#潡�N�����e�1�D�$�uD�Hr����瓿�����pe/�Op7xn�N
�0K3A��ùnNWyc�d���k��ݧ��}�cM���e1�����2$̘(6�q5#F�[��A�(Ab=)��{w�y����9��DLG��p=��0�Vd}d���$z�6���kn��Ư���2&��v%�6�@4P�3"XK���&-JO���%�$�%{O�+O���t���b=%�:"r��ń=��{#Բ�1�t���1��Ļ��/���)����$+̞>��+�#\rt�>HN?!
~٘�}��ҍ3�"�Z&u
]
N'�*,��H*�ܬ���KI�����>��\���f����G�#	�
 [...]
���ҳ���s5�-}U-.&�Ċ�
#�X�
QZf|�6�%��	.	�.�<�:�Y��Yc=-�rY�nҦ8���KR��������1;�|�G�*���̟+4]SIj\�����"�7���`��t71�#���t
�.��?�-��,�K?\��u�T����7�1���~�9�"�N"
?
F1�b�j�������:U�����&�޴v �6M����ܚ	�т#��!'��
&��jc��dV4�X���]7��5[���U^��zbm2�]���ɺe�zy�qѷ���V�rD���u�	�	���{�h���Vh�֞ht[�e��%e��Fˮ=Hs�uЗo�l��X� ��R���=�-
6�n�^_O%)iۚ��_���:�X�u]�B���-�eiM��&��6�mWv[@���_�׉
�]�
���_��I���&�|��n�uu1-hx�'Ի)��dP+5�ҌU�B���
�b�ig���˸��g�Q�Z ��d���z�y� ��M

wa�����$h�eG����%�����*8*
�G�
&/P|�p�*�)Dl �:o<��̱���N�{�������x�y�a]�����\ϲ]hn��1�����H`�+j�e���B�I�Xߤ�|B�-q\
C�A�19ڵ!�]�\�0�#�
�N��nj$Q!�s~
�
-!��@d�:o��Mu�+I�.�;�|�k�
0ݣ�ѡng5����W���:L�H���(��2�0haF)Ǧ^$ik5am�&��S��
-�#-������65ll�isΙ�QB����s�kߠ��/�
���'�n�`�v�cح �_x�J"Q�X
���íR*��r��+dZ4cR&$1�C�m`=O�����g]@m���G�m�i�=h#����ip�鈱�T�����-	������X%:C�'灼��
B��UjK�g�ܣ�Aqy��?Z�Y>g
-}��
����ӂ��ba����*�T��"S^�<o���é�]ߡ�w�
?
:R7Il�U^��G�0��S<X�$�����h�⬺H��y�)>L,Ī���U{�ښ�����8��bSv���̾�n�[�����6��ž	���k����Z��y۔
���09T�W�'�-��{b���NXG�6Ԥ�X��7\�đ 1
��r$�
QW|��;�V���Fk��Ȱ>��k����?h&ѓ�����$��{��.�@F� �� hںO'Tp�]���7h�c
�����ij�r�=
-��(z�����~=OL(zc5{TS3i���ޙ�1��C�",�hW�&ۘE
��pxhpL(Z�'�~o�]o��c���o��
(�@1r��
X;. at r5�AL06�H��~�> Rrm���� 
�S��cʯ�)��0�@Xj��*-+���{P�1�X9� \y�-�
�>�,�!4@ˁЛ�U����0Œ����a�G"L;K�G�;x�Ò]�Ϫ<�UӃ�r6-�<<?��s�T�1�����(�Y�X��


�_	U�Qq(��)$}��@t��W�O�~�\K�B��=O�8�D9K�����h������r/��~�Y�A�
~[��ވ�1���:���o	�ϐNf�Ǹ�@�^�o?f�ã�Q5e���
�i�@�a~`�Z
+X�c�`�
-�Z�j��t�մ�c�!W�9SlK�E��؋\�f� ��CW
��=vU}�jz���`0[�j���ߙ���>��&��w��Z&9і	��ó��pv��M��N�i%����@��7 Y�@ ��c-��ʡfc�W����}0V����)���'�CPl���8(V����X&���!�F��~	�����>E&�n"��x��	V!��e�h8�N��'�w�D�[E
��^��bDl�ɾ3�������׳&��zl��j
-�%����
�d���qLJ@�Dž����<�C~U� �d8����O�
4��S�ڝ�q� ���&�U�or����pȰ4�
��
��b���v���P���;�쮖i�/�Yu޴��
�
d>���JFt<
-B�
x��
�Y�Y

.
w��u��u��mu�����"�w��Esu�"1���������;<t�80�.
��
ZĀ�c·+M�IFh�͛���_�y��R� �����U>��\�k�
-���p��
��Z	�{���W<q~٪”$Ju�z�47�/_�o.�yyI��jw��������ݘXU�Ѣ���
w"m��"Eߊ�3x���RK���Q�����0�򇕈~_��[p�/ub�
-endstream
-endobj
-5014 0 obj <<
-/Type /Page
-/Contents 5015 0 R
-/Resources 5013 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5024 0 R
-/Annots [ 5011 0 R 5012 0 R ]
->> endobj
-5011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.615 695.509 194.215 709.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-5012 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5016 0 obj <<
-/D [5014 0 R /XYZ 89 770.89 null]
->> endobj
-5017 0 obj <<
-/D [5014 0 R /XYZ 90 720.814 null]
->> endobj
-5018 0 obj <<
-/D [5014 0 R /XYZ 90 667.125 null]
->> endobj
-4563 0 obj <<
-/D [5014 0 R /XYZ 90 542.619 null]
->> endobj
-5019 0 obj <<
-/D [5014 0 R /XYZ 90 538.136 null]
->> endobj
-5020 0 obj <<
-/D [5014 0 R /XYZ 90 469.619 null]
->> endobj
-4564 0 obj <<
-/D [5014 0 R /XYZ 90 349.579 null]
->> endobj
-5021 0 obj <<
-/D [5014 0 R /XYZ 90 345.096 null]
->> endobj
-5022 0 obj <<
-/D [5014 0 R /XYZ 90 274.365 null]
->> endobj
-4565 0 obj <<
-/D [5014 0 R /XYZ 90 145.612 null]
->> endobj
-5023 0 obj <<
-/D [5014 0 R /XYZ 90 141.129 null]
->> endobj
-5013 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F118 4003 0 R /F8 794 0 R /F117 2446 0 R /F32 764 0 R /F7 795 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5034 0 obj <<
-/Length 3169      
-/Filter /FlateDecode
->>
-stream
-x��[msܶ��_�O��4� H��L��i�4um%_�����$�w�BR���w A�ĝd�ܙ�t<c� p��ؗg�F7��9{yq��QJR�Utq
�4�qJ��_��݂)����H���T�W��������.�b���g��1��$�I�ޝ���Fh�.�D�I��
�E1��Fo��uFǼ(:�1˜������^���aSD����
���N�p��L9��b$�i?�M7�I�Hp��e$�b�jJ;�c9!J�h5���ך(��*̵���\�\3J�=����Jp�ho͋Z\U�L.�ƶ���Λ�������EUھ�l��RɅiW��
-ɧ4q<H�
��hTL҄�c�ۢ	p�AF%�AN�

Է�k "AcI?����m��r���5b��J�t�#Ho|c%J�����Hs�^�Ms}�]�������6o���"��T
���{H���
�Pl����䁥�?ͺ�
���>���TN
�_?
-��'%���٧�J�ƀ���� 1��r���L���s۫"
���t*�%&�rO�1{�&$X���6��
��y����hԟ�I}�g\�[S�x�H� #���x��TҀ
�$ڙ��9��M%��ZX�JL��ј/�+���9>�}���m�X%��Do�20�$�
�����D0��U������S�kk7_

�3�K��ە��p�
v1���	�l��H��D
����1�>����K�7��ɺ�4�I���a�ˀ��f������q|	y��s��$NF��a��CQ0I>��
�u�m}�o�i��*@)a��qh�dD�I=���^�S�X�/)+H�5@�D.>,]d{�����&��Z�m+�̺�u��V,>4�2���yݴ�g��a,��
Z,C�wٺ{���l
-����s� #2�@���a��N�l�0D2&Z:�ߓ��J1��*=�J(ӥ=d0�I&V��̍�Au4`�B�S�.��(�Q�b�	/;i�}7+(��M[gE�6�c�Z
�IN�Yr3;a���.�tJ�+ROi�]Vwh΢�ښ6� 
��$�F`����>�u?�����gP���(�RχX�<+�! 7��6�8� 2�D)�8��<�(:wZ��
�M��e��3�52����Ā�������v�/y�������,�uq���D�z�]�^rP�v�o����������� �fP>0uTDÐ�a�V\C�⚳�?P�[���:�Uh@��y9ϴ"Z�H�
l==V�s��ԕ����e�)��P����r* a�dRNf��C� O��ǫX*�$�UF���CZ�
V�Ȯ�ys��ߕ�U���w�ji/�1��L
-W�	�㐨��n�e������wE�-����
�4����e}��K������.���tk��V��
�^�7���@A�
 ���w#�'n!�2fU2Л>=��^ۉ}Ӎ*��
��w���U��~^� ;���O�=B�F����R/`A4��h)�4�V�=Z
��|HaL�7>�?�+ ��˅���
g�3�D}�q�曳���	L���YJ7���w���qՙt51m/B�\��^��C6��$S�=]o�m���|B�}2Š+Σ1n+Q( +����?���(���?Ÿ��f�Q���v�x�|�Ƨc�:Q�
�
���
�lJ?Q4�,&�ʎF�G����~»Hܴ���\� 1�m���@!���~��G��PO�8��
Kʧ�
-�T���6M	������-�>s�(Bp"�N��l�2��e��9]�YA�W��xf�>-nVr��ʮ� |xb�:

a���\x� ���C�n���w+}�/ʀ���S�����NlZB

-��P�z��
vl�H}�`�
��C'R�	I�<�WP���o���ꌝ���P$�;��-np7*PCIp���r����{�t�F�I���D�`�6�*	qX8�r]�m��1���� �2�U�I'�$2~�t��lM�����H:-�vBbN�F�.�����Δ���F�e�g �﷭C���$�������v2A(�0(��C�2�p9�
-�MY�S�O�o"��U�J~r@* �<>i��
4
 ��O(Pҁ��v4

H� �� ���R_�
�
4H=9=@�`+�[s�F�^��e
�N |S�Y�;=8w9��q�<:mo ��� ��S�d��>
$>yi;P��ň�!� D�L(�!���Q��l8�<�S6��9�
d2��O�.�wAr��6��%�i�~^ :$�o
^ݗ��9�/�\��+���� �Mn =
L��4ާ9
-��4G��8�N���k�5����P�g��`��bu�
-)�U�SL+��dZ^	ޟA��;��F6�\u�rc���N�f�d�	��z
��c
���L*��k�.t���~<����
�fw�����O
<�mUϲZ�^W�|/8;��G��"�����G�+���1���<�F��)�¹&�A�[�!
���>t�<F�g 
#�
$lf����~0\�
y�����<�o<:y��œ�=l
x��'O��u�)|�_;w�� ���;	�"u>j~�F��u�|�-���j�ږ��&���p/ȭ,о�6�CU�(��σ����&Mo0� �
��P�
-�
�U���+��{s	����u��vY1��1��3���r?	}������l�%?�M������d�v����:*17��E/�r��M}���]��s��=γ���Y8����2��ӈo����*���*
-��0�j{�
��	l��;bK����h� ���y_nr<P/�
���ke�o�/�{z؁=�H�+T��
�ּ��Q�m�᳾ol��� x������]��UݵwW���b��A۫�Fz��������|�n_c��ű
-J)�t-�؁�#�	^$�C�9�V;�K{V�#��5��r��ɶY�l5~ �0���W�(O}��N=�}�,�S����_��w=B���}>�fDݔ7́���?
L��
�h2����4>�Ѧ����
��\ ��w���5��v'��* 6�[��@��R4����&�
��I�L�������&���x����GV�������҅
��6�
�����߭�����W:w�mۻ�/��o �ސu��#���wD\%xݣ�,��wYp��
�p�
-endstream
-endobj
-5033 0 obj <<
-/Type /Page
-/Contents 5034 0 R
-/Resources 5032 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5024 0 R
-/Annots [ 5025 0 R 5026 0 R 5027 0 R 5028 0 R 5031 0 R ]
->> endobj
-5025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 525.934 243.45 539.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 473.674 485.603 486.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.376 267.63 385.519 278.534]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-5028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 102.137 174.682 109.663]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5031 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5035 0 obj <<
-/D [5033 0 R /XYZ 89 770.89 null]
->> endobj
-4566 0 obj <<
-/D [5033 0 R /XYZ 237.535 626.453 null]
->> endobj
-5036 0 obj <<
-/D [5033 0 R /XYZ 90 619.813 null]
->> endobj
-5037 0 obj <<
-/D [5033 0 R /XYZ 90 551.239 null]
->> endobj
-5038 0 obj <<
-/D [5033 0 R /XYZ 90 497.55 null]
->> endobj
-4567 0 obj <<
-/D [5033 0 R /XYZ 90 450.925 null]
->> endobj
-5039 0 obj <<
-/D [5033 0 R /XYZ 90 446.441 null]
->> endobj
-5040 0 obj <<
-/D [5033 0 R /XYZ 90 373.579 null]
->> endobj
-4625 0 obj <<
-/D [5033 0 R /XYZ 90 338.909 null]
->> endobj
-5041 0 obj <<
-/D [5033 0 R /XYZ 90 334.425 null]
->> endobj
-5042 0 obj <<
-/D [5033 0 R /XYZ 90 251.739 null]
->> endobj
-5032 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R /F75 554 0 R /F7 795 0 R /F8 794 0 R /F1 833 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5052 0 obj <<
-/Length 3336      
-/Filter /FlateDecode
->>
-stream
-x��[�s��_�����`|���L��:��3׋������h[9�ԑR���w�
Hɲn��[	-���ⷿq���W��^]��,�H'4�n"�#�5	|[F�c����	�8~;#8N�Mz�vFq\�ʖez���L��on�+��~����5!=�$I@
������&^��	m���9 �Bܶ�vD�M���Ӫ�ͩ���L�8�l��.sw�eY9#*����D��$�������18"NI-6W���n�aĴ�>�F��S��觫�\�Z���)�����1�z�,���%<4�"�D���S�/��
j#<z?O`}6�������n��;�*^�6Y^���n��6
�X���}>)!�ff�j�ý��y�1øH#��k�����(�j�	�~�����Yu̩DBղ�vA�C8Q�9<��0�$�M�{c
-ǻ���̶eVe�.[�
��}������4_�:�a��N��`�T��^�Q��}��,�q�Mt��h�
-�!@�mh6gZ�o
B�HizLI��U�F��>`Ls�����E�����([E�2��QCH,:��`�ʟo+��
���Ѩ�`[

7AIB��� �zl�+�%$b�~
H�sm(����Zײ�0O�������}H�1��*�E��%��D�A��21m����}�#&�@
K�a�,���(��s��*��"ոL��Shō�%���qGF���띻6�7��\탐�,��5�#4D
��dYdu'yQ�
-;T��G���mZ�V��}颒��y�{2W�Eۺ,�����̪E��o_�Ҵ��s�b��ͳ�6[��
i
A���es�'mW�c���r�m w�l��nG4�_���	��e�JCB��d�l�F'e�Tj��ɖH����tc�GG�����$��֔!��X-C�ECPaM�s��W�S�:��`�QH�A�vDam@���f��_�u���	b�E��#2'`EZ�HY(��Aj�0���}+L�a��_A��@���ﶅA`�T��
ou��������*�_�f*�� +�ی1�Y��W!�1(�
.��l(<ѨC%����p`�cA����W�z�g�L�5-0���^Uc�2_�=���Y�&��t
��Ƶ`�q�a/��%
�,!�o�|ن���M4�[�oi���l��1Ҡ_���j�� �"-!�L�B�ʗx�W�{8|�
�güFp 4b:��=�lz2��@D����I�8��/�y��4�#�9�T M����" ��K��[
$ĚJ
��ٺ
���z��7M��l�+س��_�'. j�L|�P@���4�KKt�gb��=�
Dl�.��ŷ����Q�-�?������
b�Mkk�¶���|�N2���1���svIC:[b0
�	��<�J�9���/�lk0�PBP�
-�@���-��N��W�i�
�q�;� |��H�H{�@X TS
)��a�I	���H�k��[��@��!4����6
&��=D�ݴ�S�U����D�Se	�hS�
���3�}*
��|�w�`^�
B#Ӑ�b�8�^Rk�Ij�
͏+ip;@v��Lb�0�d��

B�$��%V7�  �BvuQ���L�t�� MO�2��R��&�
|Z";��]�C���
�z<����
țU�s�u�?��q剎�Gi��b_
���#��}mxN̘qbCq��Ң�C����L�\=�5Ϭt'�A� ����=�l��b�^���t_�-��=ύ}i6 ���4��1[:�NjH�DT-���0�q�7�M���~�Z1&��+�y- %�I���s���E	���l�9_桅y��k6�3��FHt���Yh�A��;vO�*�z�vM�,f՝U��g)�K	�t�z
.��
;�0wtk�^3�hC�
-�i��'U���]w�
 �V�
ݗ�������B�|����J���Գ���4�@(��������Ȼy۸���P��
��U5^5�]�24��V���8ń��N滺�;��W�h�8KN�x@��(o�D���gC��8TA��^s~rO7�9l��#���@�h��cɑ��n���,�g�6���c|؋'�
���!�h�*��_��"&
�PM$��by�$l��E%�b2cV�d�$B�}�^5��^�
�kJ"s.��P�`��^����Hu�Ss���8�"[��&T� �j�M�
-UQ kQI�+�,�*4DJ�r������c0^�WG^׆S�@�V~���Z`,��
 	��G��.%�K�Mݗd��uSf��?��̉
-v�B��%��
p��
B h�!�Kd!�V�p�/K�����R�U�k9�I��3��{�}��B�Y���2B�?���XN9[s��9��
��%Z��
-DH���7d�AvQm��1�}�8���㶣7�Bތ��͡������
¼�R'鮦u��b��ʛ�8�IJ�}��Jk
-�
���w0~zR%�l
�Z��H$��
�/�y�
�A#�_��Cm(v�B�W��<�:I���a��ӓxK\�q(��K.Wƹ�<�w0���_o�
���"���B��]j�2�Mvdž���MԚ��E��Bhq��Qf�
-�ױ�c�����Н;�h�y}��?�1q��m��ys۰��=
S�tup v���RG ���aݿ����P����w(i\��S§�#1a��i�D���b�A$
-�.Hϗ�ȉ���8E�����+��.� �"��d��<���T�r䀃Y�T4<K�#'�:.h�#�p��ۿ�b>��n�S#�%j�g:���f��'�����.�R�4ZUs�\����O���#�_V���|!
������!X
�.��
衾8�n�j�8�>�͉ws�a(�$��sl���RX
7���F֜p�A��.��H��J(PK��S��
�޼�!�C:����)y�D���N`�
c�Y$SZf�ɼ˧C;���<=@k
���Y���D���:	���+��ƴFHx�8?B�㮅�f[y�N�	0��]��1��#���f䉁�rj�&
L[ŎP�Q�
-q���(I^‰sE`
`V&�eS��+w�!]7�S"δ?G� ����7JN�y�>Im)�>Q�
��*�I��
�����;��U�
�*͛��-\�}���_�l
�5x_��e��M�W��f�	4�N}���v
-�Jxs�AB(��}��Gw��*+�4"����4�76&�Ȕ]"�Y�:+�)k"��Ǩ���;��
������n������?VY�� K;\��<����
�sw��l�
nnzh����=�7'kM�2?A\'���pwm6?�o\�ٰ�(����Ut5
-endstream
-endobj
-5051 0 obj <<
-/Type /Page
-/Contents 5052 0 R
-/Resources 5050 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5024 0 R
-/Annots [ 5029 0 R 5030 0 R 5043 0 R 5044 0 R 5045 0 R 5046 0 R 5047 0 R 5060 0 R 5048 0 R 5049 0 R ]
->> endobj
-5029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.953 709.04 216.525 716.566]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.27 709.04 291.843 716.566]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 630.865 239.856 641.769]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-5044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 443.148 379.76 455.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a4e6787c98290a49ce80b90c008aac5a8) >>
->> endobj
-5045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 401.05 182.164 411.954]
-/A << /S /GoTo /D (index_expand_space_dimension) >>
->> endobj
-5046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 303.684 243.45 317.632]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 227.116 535.938 239.634]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 213.731 226.824 226.065]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 157.971 362.844 169.039]
-/A << /S /GoTo /D (index_fold_space_dimensions) >>
->> endobj
-5049 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5053 0 obj <<
-/D [5051 0 R /XYZ 89 770.89 null]
->> endobj
-4626 0 obj <<
-/D [5051 0 R /XYZ 244.439 634.018 null]
->> endobj
-5054 0 obj <<
-/D [5051 0 R /XYZ 90 627.378 null]
->> endobj
-5055 0 obj <<
-/D [5051 0 R /XYZ 90 558.804 null]
->> endobj
-5056 0 obj <<
-/D [5051 0 R /XYZ 90 492.762 null]
->> endobj
-4627 0 obj <<
-/D [5051 0 R /XYZ 400.69 404.203 null]
->> endobj
-5057 0 obj <<
-/D [5051 0 R /XYZ 90 397.563 null]
->> endobj
-5058 0 obj <<
-/D [5051 0 R /XYZ 90 328.989 null]
->> endobj
-5059 0 obj <<
-/D [5051 0 R /XYZ 90 250.991 null]
->> endobj
-4236 0 obj <<
-/D [5051 0 R /XYZ 487.765 161.124 null]
->> endobj
-5061 0 obj <<
-/D [5051 0 R /XYZ 90 154.484 null]
->> endobj
-5050 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F60 532 0 R /F8 794 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5065 0 obj <<
-/Length 2740      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���S+�d�3t/@w�٦�q�%�D�D%�!%g�_�3rHjH9��@[?���̙s��g�nfx�׋�.��E�Y�I��j3K�L�		�ֳws"����3&5"������|}����[s������
��8)=[�.޽dz5\�a�K��}h7��q;{{�
�ui��
-sj^C�4�	˜�aHc��y��*���eQ[��D
-�V0

)�%TMjo
��w���e�3��L8b�	��4A���d(Ҽ�i��(X�
��٦#�9�>�P����sN�__^�ł��}����j����ˊ��ט?(��dv֍�v ��p��qD��ک�!�	���ѫ۪\P1�T,�T�y�1����8EL�&������l�2�>��N\Q��I��]����:[���g�������ԟ1f1�P�[���y
S�����i
-�����ieD�Ϛ���9]��t	���J+F1$�bI0��}��ۦ��Y


^U
-I����=�������wY��lp��˫�""�@����cD$1;i��_P>/󵏙^�CE���oB�ڥ�,(����m������*�>_^~W�ч@�����c_����@�ҩm�,uyYg��&���JI���@!a�6������b�U���1O��M?c�#�]20��v���aE��H(9O��m���[L#�d�w�%
���bvՈ��_A5��jkb{��\!�@
,��"
A"vEC�{�ۼ�������,��5�Q����}Y�B�={�X!~����Z7ݛ��\�oS_���C��#k%a�L�w-��A����=�DP at Vv�����G������~��

���OG�c����`~>�sΝ6�g�կD?��>��	���>
O,m|v�\}�ȓ�G3�����q��9?~0o�uYn��Gp�� ��I�qr
-�$�ܦu
�P�n}�h�8�F=�o�!�OYY��`K�XZC
��]ڶl�P�KD�8/��GLj}_f(Dt��^p��tm`GA<P|]�@��j�uP����3#)��nQ���o[��:"��[��J+�A��j�`�_�-�Y#!
_j�q�Œ�"e�!ä�=�Z���;e��h�* �Ѯ��͙�g�
-�`+�:ۺ
��
�6����*��Тh�m�n�,�p��֡�-�$�a�է��
]���0�Ctig�PZ�����5����J,"�<�V�gf��	K
Ø�Kt�XĈ0Ĩ���:��	U���{�jUV뼸�~6���/�����^�ץk�GX~8Xh�`�K8b0\�Ԥ��QpL�������1VR����$�a�iUp��,�������k�p�緩��`=w�zp�z���R;J����e�evr37�Ά�C�D,¡i
��)�u҆A�����&eM�-�����5۲�x�qmy�O��9 �~�l�[�����^��w��/�|nfc V�o{��,�!��lOAWk���؟&~6��;���|��we�v������{��A�N���H�P
��\�n�V/�aV!\�k �:
3�""V�`�6�u,h�

�j+����ʝ�2g�֏�ac����9`jc-�
��H��T�`�IX��x�u�VH�[wR���N��
-�8�J�~�d�M�6��t��N�h
m
���ȶ��j
�0g�tc�<�
����G~@N}�nʭwV}�+�٘�0ş���R1�,}"�A��mu�p7��d l�!m�H+�w���7�vQڤ#���P�7���i�h�=�2=R��YFa1�0�Vx�>�n�j�t��T�ʖ��e 9h[��?�ց^�d���
-�~�r���Y�aesn
�K��M3�p�6��� =H�ۗ�Ԁ�+X���*2'�X$	����%��0j+4
W)��|e��Y��v&͹����v���C��	n2
)���
��x�����&~����o���J���
�W�������dN�%0ǂ�zu���we��s
N�g

�>��gJ0R�x��K
��gUـ�,0�#Tr(�,����ے@�R�;�6k�W�q � ���!#�68Q�?
0���h
�^`T���'�M1 �,L�5��-�D���^�y�V��h*����\��䶩�Ud�u2�9G2"�r�m�%/Vۃ)�Ux���:$g� 4;���o�|NM3,��)lp���?�-�?@L��Q��� �'�?��0A��l
���?"f
CkU���
�FW�뇻�8���?Dz�X&��l�<!
�Y?�2A�X�'�o��Á�#}�O�~�!��d� ����	0BO�~�>���Ӭ�CH?��S��;u��SO����D�=�~�'���
�	�KH�0fL�~򑤟��~�
H?��Dz~T�b��X?�����0��o+�B�B,맓.맵�G�|��#� RqLgq��y��8PF���I��
-O p�7�|%ЬY��3
��� y,���0N,%�W0~�)Ə<1~O���8��L�0~r���L=���}�O4��l?��j?���Z���l	�b���l�Eo�b��#��Q�O�
m�my>�0��{j��0�8E�C�׫�"������&JQ{�{no6��
�_����%
� o6��j0��d��
�fQ����z�͛W��uV�v! ��￧š������e>4%{Lcƀ�Y3�9��ժ�7�
}(ކ��~w�����Ί�r��?����y6�h�+���uSuSS⏜�a�Nt
-endstream
-endobj
-5064 0 obj <<
-/Type /Page
-/Contents 5065 0 R
-/Resources 5063 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5024 0 R
-/Annots [ 5062 0 R ]
->> endobj
-5062 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5066 0 obj <<
-/D [5064 0 R /XYZ 89 770.89 null]
->> endobj
-5067 0 obj <<
-/D [5064 0 R /XYZ 90 718.682 null]
->> endobj
-4237 0 obj <<
-/D [5064 0 R /XYZ 90 684.012 null]
->> endobj
-5068 0 obj <<
-/D [5064 0 R /XYZ 90 679.529 null]
->> endobj
-5069 0 obj <<
-/D [5064 0 R /XYZ 90 608.668 null]
->> endobj
-4238 0 obj <<
-/D [5064 0 R /XYZ 90 577.891 null]
->> endobj
-5070 0 obj <<
-/D [5064 0 R /XYZ 90 573.408 null]
->> endobj
-4239 0 obj <<
-/D [5064 0 R /XYZ 90 326.797 null]
->> endobj
-5071 0 obj <<
-/D [5064 0 R /XYZ 90 322.314 null]
->> endobj
-4240 0 obj <<
-/D [5064 0 R /XYZ 90 77.486 null]
->> endobj
-5063 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5075 0 obj <<
-/Length 2549      
-/Filter /FlateDecode
->>
-stream
-x��[ms����_�~I��t�/j��Ď:N�T��~�=��$LH��H����(�<u��
�ǻݽ�g�����v�';�����B��AFR9���<Q� !�m5�0%�ٜ`���3��^��/gO��㝿��럂E�ŏ���G�OW?�]R��H	�qX/����Ƣ�-���w�,��r̷=�0S�x���d6�O�f�N��v�~��ο���S?\B�!BO�vғ�N~;!0
���)=YnN>|“t�8��=��m&�2x�'�O~9�ΰ ��M�pf���f&����C�9S�����P
-I�[�ḽ����q���*�d�m�@�ӖmS�|؈bD����J��2�b
�C&��hSm�<T�1�n�(��s�08���'3�HuȢM���H@a��K9����K���ȥ@ň\j�Mӈ�h�\�#\�S�"V�ɜ1�4��
~a�(~&��Emz�mJ���� �?eQpv!��G
�sJ�:��;?�š
U/0:_i��̔���к��\ @����������9X��:�
�|LCPʐ!��ۆ�O�y�M��M��ɇ��5��)x�c"�V�K>N;�$��3Vz�um��&"�ts	h��U��Z�	�R��br?옜r0M)��[wmw��Z�e��:�
@��э�h�k������@�#%h
b��׋8�Õu:����d�w��\�r�
�i��ۛh���a�e]uo�]sj���("#`�!����X�za�Un��e,�>�|N�dF�����oX��/�H��9��?�
BW: �6j�hU�)�P��!�o�v@\�Fh���
�6Ҵ ��0��d��El5a� Z�q���1�q��1M���m҅
-�
b��}��u���]Hy���10

�Q���/����$b�/+
cE�|�h��^�Z�{�ܹ2��������N�E�	J�x;��v��I��R�>����_���A��@�ϙ( \k����n�
���:!C���4��]�J�27��e)Q�~�[A��L�ƒ�J>�\�q,+�ch-���
r�
k���?H���5�y��x��
'�* f� ���2�l��,֕�3"�~r>�3�� ,�	
e_z��2P	1�օ�H�BB�*�x��OE�U,g��F�@-Y�{
����wN�{U��aB5��;�W���^���5��w^��s��ұ����C:�^�1 ����v�W'3�� ��g#��b����0J�
��P\����~�����u,Vw1y��L��#=�j�«6*IW��Q�ƾ����&�߱�a /�؝8����^�4��[�v�����|$=���(ڍ�1�	*���nF��S�9S	m����f
�ۜR#U�鈵60w��
��]��9�*�C�1/��B�E���j&�4�ϑN�怞���q�#[l	&��e��h/�?`g�"
۝=!�<〝A�c,�I�f��o$�g���W�:��9�ʆ �Tse/I��07Aρ
\����;��=��W�?�6
?�ob���^��f��n�[�����վM���
`B{��slB4PÁ������j�UP(!��.���[�^� T�u���"M7�3mғ��`����$��vO$�т�#�н͙:��B�-�_V�q��
o(5g
���fD��v�*o��qg�gHђ���AM��G�t�B�#�I�^Cݥ~Ң�ux�:,�E��/�
��7��!�����}}�M�V_�0ƞS���"���d͒�-�NL�\q�h(n;*��[�f�C��j��PM�7�qh��3!��S��
�6@>��w������C�ɯײ��iog�F]Bi��
-�P���ʅ�f��V��U/����k��@�"��ξ"���>H|�+6�C�h
4^ݕ^�$��ݢ�V�
���.����
�V��R_<v�� ��l&Zw�P Ӷ�j�����F��ܷ�����=YUn@ro�xcŲ��@,o��g
xPĺ_Y���R̼5��PI_�y�쥸W{3z�iIo��חY�Z�+�������4� ��������2�:��Ǣ�]�q���~]��e�do�� ��5�'cj�Ƀ���� �
Á�Q���Y��Ph3Id�
* �0�z��%�Is�  
� @
(R��'�(���bQEHQ 0s� �Rg�@�Ȯ�C����	�b���a��s�u�~����� ���9���, L��
:���G45���h�>��}�B�ϣ6
-�}�u��>��)l�W2�Q���/A�!A������+��#�
�c��۞��ۆ#�32���
��m���mW�9����m�b7�����%�֫�~0w�SKӺF8X
 �d{_�=�6(@��w
@ec��!c9����%w�`��n9���Oy�_����D$%�uҿg��qR�
A�7�(�n|��.I�B�:)Z?�ܰ���(]�.M��gg��m⇷�i?���0W|S��MT\�u��Q�
;
- 	���70?&*˝��������8{�a�7��ֶ�۬Ve
-endstream
-endobj
-5074 0 obj <<
-/Type /Page
-/Contents 5075 0 R
-/Resources 5073 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5024 0 R
-/Annots [ 5072 0 R ]
->> endobj
-5072 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5076 0 obj <<
-/D [5074 0 R /XYZ 89 770.89 null]
->> endobj
-5077 0 obj <<
-/D [5074 0 R /XYZ 90 721.073 null]
->> endobj
-5078 0 obj <<
-/D [5074 0 R /XYZ 90 640.762 null]
->> endobj
-4628 0 obj <<
-/D [5074 0 R /XYZ 90 617.251 null]
->> endobj
-5079 0 obj <<
-/D [5074 0 R /XYZ 90 617.251 null]
->> endobj
-4629 0 obj <<
-/D [5074 0 R /XYZ 90 575.547 null]
->> endobj
-5080 0 obj <<
-/D [5074 0 R /XYZ 90 571.063 null]
->> endobj
-4630 0 obj <<
-/D [5074 0 R /XYZ 490.972 503.909 null]
->> endobj
-5081 0 obj <<
-/D [5074 0 R /XYZ 90 497.269 null]
->> endobj
-4631 0 obj <<
-/D [5074 0 R /XYZ 484.995 430.114 null]
->> endobj
-5082 0 obj <<
-/D [5074 0 R /XYZ 90 423.474 null]
->> endobj
-4632 0 obj <<
-/D [5074 0 R /XYZ 90 371.787 null]
->> endobj
-5083 0 obj <<
-/D [5074 0 R /XYZ 90 367.304 null]
->> endobj
-4633 0 obj <<
-/D [5074 0 R /XYZ 90 229.035 null]
->> endobj
-5084 0 obj <<
-/D [5074 0 R /XYZ 90 224.552 null]
->> endobj
-4634 0 obj <<
-/D [5074 0 R /XYZ 128.643 84.126 null]
->> endobj
-5085 0 obj <<
-/D [5074 0 R /XYZ 90 77.486 null]
->> endobj
-5073 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5089 0 obj <<
-/Length 2553      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�~ׯ����ZB��$��l�N�f�8����E�#��<�$���}>`N�sɤ|lTz��Ӎn4��o P�Ur�P��3�/������s#G��:��N
M�tDi�͒�#������Ж0��Vx����x�����ٳ��_��E�	P���jy��
Mfx�
g����2�\�w��:���zzq�#��
��I�x�(��]��]Lw����s4�^4�P��
�)k�6�H[4��ߦ��2
O�4����#�����bM��k
�^��/���-f9�%
�n�l����z��nҫ�|1_��͡�%�DZ�%��r?'κr ].�"�Dn�ͷ���*mЫ
ጟD��0�E�����f���U4sW�!81,��5�T
��ҫ�nj����w��t�"��BC�hDِ��n���.]��١K8&��6����1.�^e&�b�m�=�^A��s��b�=�/ǂ�֋��،���5���Dv͝�+d�Z�DPΎ�XSL�CA�hZj�Z������0Y��v��i:jH��C�eR+B�=����F�+�>���5�HTѴj1_"��R�=ֳʴ��-�=�
rTY����[�櫛���7M"� �T:���w�2�$/S?��}���ʱ��Mb1
�8F*;�ԚP�$S"|�6Ȳ,���c��r�_oR_vgoB*���s
����8��w�~�g����n�n}�D�f��
�l�ί�1]���P�B�£�"���t�>MW
��QPV>�nOT�7]͚��T0���C!�8S�'0ӄk�:&0�
��]6��ǘZ,3�_D���e���2&�p��2
H���
��2-2��L�������n�ݭ7i���*���ݬ?̗��|�?Z���w��j�nꔅǘ��� �rg��6�m�ȉ��^�����.m�q�L�c�m��+���t�m�	�Rk����|���0M1�P�;wQ�
�.$މ��;1�;{�������ަWs?T *�L�o�$�)E=W
�#E��g����_�L�U��[y���Ϸ��z�Yݺ�"�����z3��g���������"m�!��zZ��o��Z��Y�I�&����*�
��E>�cDe9U!�F95gE�1Y���4P
��
Z��Q��=�y��՘��b>K����W@�� p
x� ʚ �)��z��);�g.V\�
A�X�O:U
Lwz0�C[�Ȋ�X��z��P%Jg���0+	w2�򄰓�p�oǝ@/g���w �zj	nid��\�
�~������M�u����^�7�t�M{8�����n�;!��
jD|�A5��(��q8��e:A?�{�����QPd��
-�y0���)x-Bj
�s&s�pQ7
�5�2
dEV��0F�يb�l%���d
�s�JH��W��4�(�QX�!��o��F���.Ho��Cz/�
w		VF�0(�Pr���*��i(�G�{͉{(�S�{> ދNx�j�}x�x�/j������_�0><��_&��Ax�{�������Z�,�
�%��ſ}J<�fS�g��?�k�%���'T�ȻG]ް���V/�A�by#o ��cy�[ճ�Q��by���}��H�ϑ�
���QxQ�ܿ�a���=�f�F�4Wk
�c��Z9K9�
~X<:;�"��
��q��"G��i��i��^�h���1�>�S�	�?A�����P_|�?�K������_��P_ ��P�?	P�_�P�F�g�I����
����~3���_��z �7�C\�>e��$3Z �j����\!�I� 2�2΢9`t ��e?�	Ȉ	� ��7)�@K�6&��ռ/Tߠ
-& ���œ�	�S�
�l({^���	h�	�)4k�|��b��	P���
i�S
�՘��b���)��y "G򢄕}L� 
N�WN�c��L ���>@X��
W���	�>mwA�j!�&@��g��Znz-7}L�����f&��
�~����۝�vb�k��x�v'�B*���C�}�tH?ѡ��M_��&�
�E;�X��&ֵ�I�b@)�6- -B�:
x� h�ۿ'Z��(as�0_�47��7o��`k�ЭF�ź��Ri�hy�օ�4�Ke���Rus��?3eY�f*ڹ�J
���j��Le�Af���{�|yP�j�����k+��jD�PV�IU�A-�9���j�RtJ�[�Q�vM��C�Qʹ��=T�k]`7}�&}�
�bYl~�[���"���dD�
�4� �ށv�Z
%(Ưo��r܂!'K��[��pб�_��T��@:,�V�3
P��.�㊋6�����:,q�'$
�1�JWG8D�z�PG8D�z�����zP�j����`�	�IzPǪ/�_�v�r^2\
=]{Q���
/�M�	�	���������K�|���J��&��P�a��iZ�%���Č������l����J������:������n�%qc��I�~�e�*MsWe�������€���$Q����v��?��_��l��
;̥���Ze���@�r]е�ʳ����?g1&
-endstream
-endobj
-5088 0 obj <<
-/Type /Page
-/Contents 5089 0 R
-/Resources 5087 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5024 0 R
-/Annots [ 5086 0 R ]
->> endobj
-5086 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5090 0 obj <<
-/D [5088 0 R /XYZ 89 770.89 null]
->> endobj
-4635 0 obj <<
-/D [5088 0 R /XYZ 442.087 600.264 null]
->> endobj
-5091 0 obj <<
-/D [5088 0 R /XYZ 90 593.624 null]
->> endobj
-4709 0 obj <<
-/D [5088 0 R /XYZ 90 455.355 null]
->> endobj
-5092 0 obj <<
-/D [5088 0 R /XYZ 90 450.872 null]
->> endobj
-4710 0 obj <<
-/D [5088 0 R /XYZ 128.643 310.446 null]
->> endobj
-5093 0 obj <<
-/D [5088 0 R /XYZ 90 303.806 null]
->> endobj
-4711 0 obj <<
-/D [5088 0 R /XYZ 442.087 177.493 null]
->> endobj
-5094 0 obj <<
-/D [5088 0 R /XYZ 90 170.853 null]
->> endobj
-5087 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5098 0 obj <<
-/Length 2659      
-/Filter /FlateDecode
->>
-stream
-x��\Ys�F~����2���V�6�QN�)%���RA"d�B
-H�ҿ�n�
����e�\�Q�tOO��5�$�[�x?̾���}��g���.n<K<-l �[z�}J3_PB�>���uxy>g�OV�e^����0}x����~���dz�)ݓH�q�e��q��V
xy�)
��j��
B�-G�X���|�$�/����v��ί�M�Ω��5ܲT�*�Bg�]���QC<�{C�x����7�[��=pk��٠�'�ו����w�"
�R�Q��.�sY�it���M�6��_w����m����
�mo���wBX��o\=~���h /
��A��,g� Gx
Fm�A�>U�@�g�\� 
,����.��6��Q~q�7I��i�ۻm�y�_�5g����**�
--����m��/�E�`�E�˟��WQ�VA�FX9F� B�
p17��8�0���]�YV�/ϓU|=��h
`�=�L#��5eޛA4J
|����_�j���" ��{-eņەA{8'�+�4�6�T
@�n�5����
-apC�;�K�p�����ó�!�}�R��h�Uμp�֛�*IV������Ă2OI
ֲ�=�kl�
���h�"��5S
op�l��áfK���B3�
4dSG�2��B�=���$��hV�>�h������;��%�.8�����|e�,�M	aɵ�
KX~R��<�0���6�S�f��a9����8�iH��P���dӨ�i �PS&�˳�W���9g~�ztk�a2���=w��������QU�H���>%�V5�R��%2$'R��*��"f0t��2 �Z�-�FܷY
. >��
@��`g[u�/ ��l�z���y����
5�ʴ_���j��q�&RA*c@�3s�0������ua�[���f��0�A����j�E�A�m��}�	������S���df!�[@(���6�D !QooT��s���GѦ�Z
e��x�-�M���f��2���<�B��C�	���{	��C�mw�
��8w�
wQH���U�
����AT}�TJ쀻 �P��.R��8�e�A�h	�K�owI��|�M<�%7�G�.ovIۜ
���:�O
-
�ĥ��.�}(Q��J_��.j�	��VB������D�j8	���}��mz8��_�<��J��ۨ�D��K*!��A�
�d
/
-4�>�
�4/4oeA�9
«Q��@
�,H�����-r��( 
N|�r$����I(�P���dH��gH�ɐLC�Pv5�3$��3�	4�
��=̐��\0$G�g͐$�-�
	EIi�1�	�
��{bH'��Y3��`BgԐj��0�>WxZV˽[ߒ6���8��=��S(=B*k�}�'��\R��=��O�&�Q4Q�h�&~y4��41�jZ�y�Q�-8�c�����o]��b�P[3,C���-h������&P0���Hu58�
};
-��)�v�xRz���!뤇��
�
zHa
�д��U��´����zr	W
ř`�M3IR�A���@]�@1�CC��� ky�R�V�HW��m
V_W>���!9 n����Y at O\Y�N
E�
�J"�RD7�
�5�^N�FH��
$n
-���� ��=���8���0%' n{!�Iܨ�����w7���H���%���
_�����_J�ޚ6��� �c;��c�����
�EZ8��
�����
~g�SPcŚ
�k�)���


 4�R�^s;�8R��w��� ��{(��!% (�ƀ.@���
S���|�nƲ��W��k�b�g�(i�@���D���w5��[�ݾ����o�O�}�1ks6E�E)5�};�޲}��=�oO��߾mʩ۷= �>��KG���c�����_�c��h���	�
'�*i�H,i����k�!��€��>�5
5��4����
s��8&�)؞��(Jꡒ���N�W�r���[4����1���'WЀS�S4�ʇ�Cm�eAs�
-ک��
-��*h�
��#�����~����/FDw٩�U���M����Ί'�G19�
�EQR�a&���v�
-�y)W��ۥ ��;�s����!m��]%�
�۝@o��u�z��aoW�z������m��@8�@�[s0�
�{�F
��$�(p(`\A����XP��EIm�A,5��)4+��-Gs��=�]X�>�ӹ�c uL��QTu�d�
O��dÎ���e��Ć?2�OY����Z��P���ޅ���=��FIi%�K�
k�Ly��KH)(i�	&��
��@���U\4pAGA�rjF��f�ũ�{̖�4<�*�3�#OQc`�(I�_ϐ���	�2�QVSW�(b;�ġC��k=���1y��y�(b;�׊)
��u㠗Ώ0ZM'�z�̏a�D���joǪ���G��n����~0���J�/)���/)	H��4������/���ү�R��a�����8��)�/�3Q��N�����`��|���ª|�x��O��)�T�Y���ʻ���������m�y\'�����aR���I�|2�<
o�hxvl<(�a�G	�@w,<���O����]g�X�8{��޷	8��Ʋ�L��
-endstream
-endobj
-5097 0 obj <<
-/Type /Page
-/Contents 5098 0 R
-/Resources 5096 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5109 0 R
-/Annots [ 5095 0 R ]
->> endobj
-5095 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5099 0 obj <<
-/D [5097 0 R /XYZ 89 770.89 null]
->> endobj
-4712 0 obj <<
-/D [5097 0 R /XYZ 90 681.531 null]
->> endobj
-5100 0 obj <<
-/D [5097 0 R /XYZ 90 677.047 null]
->> endobj
-4713 0 obj <<
-/D [5097 0 R /XYZ 128.643 536.622 null]
->> endobj
-5101 0 obj <<
-/D [5097 0 R /XYZ 90 529.982 null]
->> endobj
-4714 0 obj <<
-/D [5097 0 R /XYZ 442.087 403.668 null]
->> endobj
-5102 0 obj <<
-/D [5097 0 R /XYZ 90 397.028 null]
->> endobj
-4715 0 obj <<
-/D [5097 0 R /XYZ 90 340.116 null]
->> endobj
-5103 0 obj <<
-/D [5097 0 R /XYZ 90 340.116 null]
->> endobj
-4716 0 obj <<
-/D [5097 0 R /XYZ 90 293.097 null]
->> endobj
-5104 0 obj <<
-/D [5097 0 R /XYZ 90 293.097 null]
->> endobj
-4717 0 obj <<
-/D [5097 0 R /XYZ 90 247.079 null]
->> endobj
-5105 0 obj <<
-/D [5097 0 R /XYZ 90 247.079 null]
->> endobj
-4718 0 obj <<
-/D [5097 0 R /XYZ 90 190.107 null]
->> endobj
-5106 0 obj <<
-/D [5097 0 R /XYZ 90 190.107 null]
->> endobj
-4719 0 obj <<
-/D [5097 0 R /XYZ 90 143.088 null]
->> endobj
-5107 0 obj <<
-/D [5097 0 R /XYZ 90 143.088 null]
->> endobj
-4720 0 obj <<
-/D [5097 0 R /XYZ 90 97.07 null]
->> endobj
-5108 0 obj <<
-/D [5097 0 R /XYZ 90 97.07 null]
->> endobj
-5096 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-5124 0 obj <<
-/Length 2103      
-/Filter /FlateDecode
->>
-stream
-x��Zko�F��_A�@V��F�@�8�t۬���-26�TI���}��)R����bEJ�������siaD�s�`{��
�[��Z���(�d$���c���AB�'��0'R���?9LjD��]����[^�[^��f���3_a�R�Ymf>aLJ�?�bf��5_�q8ep];׳_g�eYn�h[D"�4#�8��]��<
6۵�֒�7��٩�TW&�,V�d+�x� {���	��f�t���l�IϿ���%�H1����֑�v�{�YDSD)�����.p�R^����u!p}of0��1b�
�:EF�:f�!�
-v}ĘFa�x��S��RS(�t@
-2n_�����
�B!
-�P,!x�~_����]T��G,pq<�"Y0*��Y�>#DY���K�<�o��6�Aҟ�L�c9iϾ^P��M.I�Y����Z9��JH����H�Z�N'�0T�S�e෢
�W.��x
�\5�&
�t���h��D���MX�"q%�Ze�lGi֓�#֨{?�D�3`��h�lB�z��3:�4T��*`�jx�����豋�mv�+
]=p��;�ة�m~�"?��n^�I�fɐi<���S����x$H�K
pׂ���I��1��X�'�L'v�Z�'�#��EЎI~�J@��:[	�!	,/�?�m�b<m��Ѷ�

�:����-�A��	�(���7�`�1�t�a�N'
h�GK�8�Bs�8Z��(���s0~�sP`�p

h�&O�
00 at I[Q��㜃�I�<�e[�(��3RM{�
@J�(�9��>�	8�jv1#���Q��q�AW��q{����
�2�>�t�c���I�"�Y��� `�-�C53�_-j�����8퍦�
�RL�(K�en ��
B���2t��
-�Ѫ笃� �C�A�@߁V�OjaD�E.���Qe�E�It��k�
FQ��">�f
���5�(
-A@Q&��K�i�saߍi��!
�KFQ��T��I�������$D�(�RRp�0�#�H[�	�;㔔��pҜ �ڜ�L��dp��JFA�
�P-�)^��j�i2��cN�S�u,��
&sҪؓ ��ώ��1��A�s"(�',��z29�ӥ|
�~!2u	���ŧ���5�z�;V�-4ϫ*��}y-���δ������l��={J�[�8)�^��?kޛ��d4Y�i柟�i�ަ����� 񲸏����{�˗�o
-UCR�Zp�{��u6��I�=
h�L�2�b5�썙�ImF��
��S��;(p���$j����������V5���|yo�N��v� ʼ,����gH��&���n��[�~���+?��ͫ�/w&��T���إb���xd��up޲ٞg��k������
%�ݮ��}��aAѦ��R�	�uA����,Lx���!΂�V�pN�G,CB��g�*�К�,�g�}
-k���>�
(�yC���-%m~o[���/z
�	L�i�@����ǃ�j��/ʜ����g �AT��P�Y(Y@�P�����U�i���`\��&�����x��׹
q�z�������.�V�߇7e�HВe��.�&�;r`��Rt�P�e����eeX�F�AsrQ�w�x�N}_Y�m��\�~{7EJ�t��Q�V�WH��j`H��Q"GPH�?�F�����࿽���jg����F8�cH�_@�ڰ�t-������0`�ʸ�-���
���%�����.Z�.��zۉ{ݯ�*:Я
-K�����u�n��-�਽�4�c�`鍥}����^��P����
��u^U3��\�	#��a�~{�����ח��5��D�0�F����Hr��p��<�W�p�x� ,IbvQ�'<XJ�'qw	p�챸�hW��m�AG�Jmt��9��
�х]�xa��\?��B�d�X����|JR�3٩?����FW5��RUM7�5ͪ����-�y�BЛL ��_�i��������� ��+ļ̏_�h��:�E�OҚ�@'�B�A�\U�v}����,��{��D�J�>˶�gg���4���*�
fP�����j8���&NJ��
nr����i4
J
-endstream
-endobj
-5123 0 obj <<
-/Type /Page
-/Contents 5124 0 R
-/Resources 5122 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5109 0 R
-/Group 5111 0 R
-/Annots [ 5112 0 R 5113 0 R 5114 0 R 5115 0 R 5116 0 R 5117 0 R 5121 0 R ]
->> endobj
-5110 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1C__Polyhedron__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 5131 0 R
-/BBox [0 0 212 192]
-/Group 5111 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 5132 0 R>>
->>
-/Length 391
-/Filter /FlateDecode
->>
-stream
-x��TMO�0
��W�4���$�aB����a�a�
�
�q���)++b�Q��%��m��o`jd'�e�X3
7�������'K��{Y����g��|������(L��
�
���
����)o#i<�R��G�YBi쐭Pd"}�Ɍ}�0�i�?m ����y�ka��L�U$�4[�_��g�Sem&��M�۾K��	u����Ti�wb	]�!O��#�U��T��lS6F�FH�fZ��R���f�L��&�J;z��K��n�y7l�Ofn;�nN�h�'��e�E�b�k���QT6��s
�U/�8�
ƭ�EՓ�r�c �=!+����@r��*OF�ʫ��ݢ�	���+
-W��;c>-+j�JM_j2w+9F�|���p��j�
-endstream
-endobj
-5131 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-5132 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /VQVKTR+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 5133 0 R]
-/ToUnicode 5134 0 R
->>
-endobj
-5133 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /VQVKTR+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 5135 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 556]]
->>
-endobj
-5134 0 obj
-<<
-/Length 5136 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j� ��}���^,9�B�lor�M� FǬ�1�E޾f&l����?���f��q6B�F�bc�8���:�E	ڪ��j�^d���SġqfU�g�f�<��' �{���a�}my��{�����k�hR�W��䀐�y���8o���k�%q�GR���K�A�
E��QCeҨ:�O/Nl댺�@�E*��C^�DǂiGt*���i��
ӑ��NL���].L��L����1��~�Y[� �z2C��DEξ
���z�%����{)pzjJz��:|�?��E����
-endstream
-endobj
-5135 0 obj
-<<
-/Type /FontDescriptor
-/FontName /VQVKTR+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 5137 0 R
->>
-endobj
-5136 0 obj
-298
-endobj
-5137 0 obj
-<<
-/Length 5138 0 R
-/Filter /FlateDecode
-/Length1 1704
->>
-stream
-x�UU{l�U?�~m�*[��_�
�n]�.����۽�=
-��l+l�
�&�0����pJL�@bL�ј�c"�e��B���hP6u�d#�W�����9��s�=��9�~@  ꀂ�P$8Sk� �v�
<<63���_\��I �bh88����_���2gʫDB�;��B�c���
-��:�-c�CA��5 U����y��ȟG>}v�!�
� "o�󍼱���f2"�M�6
-Zh+���sa<�
� D�*&��7��J�洛�	
O��;@JǦ��k�^o�5�
����K�_�����25�,(�N�mz�׉6��2�
���$�jH5��M����YMR9�ޭ�
*MJ2�-��@ׁ��lm�3U�y;��;+������*'����I�QHk��-
�f�y{�&-!Y�Tef�͖R��ukQ�Z�.��`"Ј�cچs*0)Q�!��@܁@�#�ޒ"���F��"�:M��?�c�,�N�Aϴ����h���ڃ%�-�֮�X&�lT�V^�+��6K�I����>��Jl%棞�Y�
(��z6>8e���c^l�H�?<�~u
;�Ӑ���
��h&gO�O̞�6�|M���h���3�I�|G�Hdp��"�*� ���B��
y�����
�
2"�>
-
�|-�D-y�w�����,>�ٔ�Oz�Q�ƹ�m^�!�OS�l�D~E[Z���"�q�ȅ�ºN�?߻���O���A�t�.I�[
:<�19W
�
�\u�
 ߨ7`.1��	�
�^id	�uJ�S$��?b
-h^�
�{)�6�!Hs�Lյ{VZ,
ὃ�^n�s�P��g�&�����3
�0R���;�h��s�T��v9G_<12��4z|>�W��^�}s7I��'��G�������
hWɰ5
-F�#�*QafJ)x�����c���ߏͱ�N�7������A
-�K�
�q�|sX�
��i͝�]����БJ�=
�����c���g��'7���hO�ĦMV��X[�7�E�
��JH���^���Z{
�h�ʈ)��K���2��[�g�W�4��FO�Ez�A���{���'C���]�����_{���Q��
�xo��u�>�C������^�����vY;��1r�|'�9�%�}A��
-|���?J��X
G��X��'TP&�����ʨ0�DH»�j|R�
4��|��pk ��!M��3�o~��!>?>*+W��&B���}��*z|t�B��%�K�_B7�
}��H4rnh�%����4�u��e`A�D�܃���a�~V��eς4�0���
�3R6�~�w1*�9��pW��F�p_1;-�z:Y�!��l��'m%���Jg�
-endstream
-endobj
-5138 0 obj
-1320
-endobj
-5111 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-5112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 103.949 173.467 114.853]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a4b841053fdf5718c17a018ff650b550a) >>
->> endobj
-5113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.282 103.949 242.925 114.853]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.089 103.949 412.478 114.853]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-5115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.308 103.949 487.556 114.853]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-5116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 173.467 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a33d58476db85f48e4ad680c69bca524f) >>
->> endobj
-5117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.804 74.333 278.631 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-5121 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5125 0 obj <<
-/D [5123 0 R /XYZ 89 770.89 null]
->> endobj
-4721 0 obj <<
-/D [5123 0 R /XYZ 90 669.666 null]
->> endobj
-5126 0 obj <<
-/D [5123 0 R /XYZ 90 669.666 null]
->> endobj
-4722 0 obj <<
-/D [5123 0 R /XYZ 90 622.647 null]
->> endobj
-5127 0 obj <<
-/D [5123 0 R /XYZ 90 622.647 null]
->> endobj
-5128 0 obj <<
-/D [5123 0 R /XYZ 90 576.629 null]
->> endobj
-5129 0 obj <<
-/D [5123 0 R /XYZ 90 554.521 null]
->> endobj
-768 0 obj <<
-/D [5123 0 R /XYZ 90 467.489 null]
->> endobj
-170 0 obj <<
-/D [5123 0 R /XYZ 90 459.814 null]
->> endobj
-5130 0 obj <<
-/D [5123 0 R /XYZ 90 123.803 null]
->> endobj
-5122 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im5 5110 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5191 0 obj <<
-/Length 1600      
-/Filter /FlateDecode
->>
-stream
-x��ZQs�8~���)�gbYBHB���4I�I/msM:s����6q���n�+�8��iܹ{2�j���V�
�11��st��
-jH$�ō�kCbC�1���'�`$�=�16/��n<u]
�Q���Ʊ;8���/�=;���nj�n�b�<�$я�k/{�#$[¦&����u��U�k��j� Z��c���O_�1���FT:��l�԰-
-��q����s��3+%5
����JbI�
C�ц
��`����Z�Ya��J����ie~�HR/����(
-��e��i�23
���
�`߳,�m��e��z}�,VY���'9J�_u�O=��sMA���^��3��ߖ`
g�*%�ڎ���N�{G���(�g�l�։ϧ��C�
+P���E (�}�w�0��䇓��أ8,Ӧ�W^��n�M��$?��䘨�����
��=�HK���"��)��~kAHr�x�N��$��d��?uNj<D���_8E���nyAk�
5���M�]����X�����S��᧋���j��*��
O/�~

�{sq��ﳫ��.�����i�>��a�
-b#�b�/L��Ho��!���ʐ�yxQ2׫�qS.��n
f�O	���-%��
f,��
Q�x�
��Ȗ�9}d���H�$T�n�i-�\��Dۥ
��I
1G��3/t�9 ga��ߺ�8A�l�.-��?��uc%EL�j45g@��!�Q�c
2�i,�&�&U,6+
�1�.�^G䮽(E�l���

���ֵa����C�L�}!{�P������'�SP�C�@#a�m�$l$����ӊH0��dpy�μF6Q�`�[(T"���E]�|��&���8��8�v
�N�r��
9:�k�̕`���ْ1����ލRw�nЂ8�geg3s0k&�-�
���S� j��iK���
.i
����T{E��x3�
�G�'y��T���$��p�m�M���@���֝'I�I{�>]e���w�_̹ﲋ���xQ��g��n�|�5�yJF
4
�t����z�!8_w_N�:�-U_�3�{�,�Q ��"[�^
H�1�u�fq\V鍟�ܚ-
-g4)&��N��K�t�Y��Oy}�;����`wS�
�s=������U�	��yzxL��B))Z15�B
��M�����'��`0�M���
aʶ�Q�S�^��qg	*�5e!xiY�9���G6(S	�o�Y:g�0��� W��̃`�����
���
�{���T8��T����=e�
�p��$�
!v�xm�	ߜx�͛�#�	~�U��7
-��a~���k��=�8��.c8a��$elo'���QRa��0�<�a��f.����W��C��e�n���գL *d0ܟ�ʞeK\﹃b�5��38��h
�)�]��7�6��<j���~Ul׿���-��ɾ�᫑ "l�̯�f�y'$��ߺ����o�p^�nJ�o
-x/V��
$k�����+�Z����O�I�Ŀ�+�{7i:{����
'J��A�bpU������4�s���PtE!*�A*pd� �U������gBXٌ���e�0�M�q�ˏ���N
�
-endstream
-endobj
-5190 0 obj <<
-/Type /Page
-/Contents 5191 0 R
-/Resources 5189 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5109 0 R
-/Annots [ 5118 0 R 5119 0 R 5120 0 R 5141 0 R 5142 0 R 5143 0 R 5144 0 R 5145 0 R 5146 0 R 5147 0 R 5148 0 R 5149 0 R 5150 0 R 5151 0 R 5152 0 R 5153 0 R 5154 0 R 5193 0 R 5155 0 R 5156 0 R 5157 0 R 5158 0 R 5159 0 R 5194 0 R 5160 0 R 5161 0 R 5162 0 R 5163 0 R 5195 0 R 5164 0 R 5165 0 R 5166 0 R 5167 0 R 5196 0 R 5168 0 R 5169 0 R 5170 0 R 5171 0 R 5172 0 R 5173 0 R 5174 0 R 5175 0 R 5176 0 R 5177 0 R 5178 0 R 5179 0 R 5180 0 R 5181 0 R 5182 0 R 5183 0 R 5184 0 R 5185 0 R 5186 0 R 5188 0 R ]
->> endobj
-5118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 692.168 173.467 703.072]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a2b220dabc613a89a062968101429e58c) >>
->> endobj
-5119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.282 692.168 255.109 703.072]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-5120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.638 692.168 336.583 703.072]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-5141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 658.596 173.467 669.5]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) >>
->> endobj
-5142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.804 658.596 276.947 669.5]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-5143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 625.024 173.467 635.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a8a6c3f01edb04382620066f17b63b20c) >>
->> endobj
-5144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.282 625.024 253.426 635.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-5145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.513 625.024 335.458 635.928]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-5146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 591.453 173.467 602.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ae46f7a91b9fac1a62ef875ec5c72aab6) >>
->> endobj
-5147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.804 591.453 285.256 602.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-5148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 557.881 173.467 568.785]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ac3126925bcd3349b150771d52c19639d) >>
->> endobj
-5149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.282 557.881 261.735 568.785]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-5150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.245 557.881 348.19 568.785]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-5151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 524.31 173.467 535.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a9720487deabf813a31afd4e9cfe695aa) >>
->> endobj
-5152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.297 524.31 277.239 535.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-5153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.608 524.31 373.074 535.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-5154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 524.31 513.996 535.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 512.728 123.096 523.258]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 466.828 173.467 477.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a9eb55b3f27138d74d5002cc9782fd381) >>
->> endobj
-5156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.821 466.828 219.422 477.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-5157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.677 466.828 260.404 477.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-5158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.846 466.828 374.312 477.732]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-5159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 466.828 513.996 477.732]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 455.246 123.096 465.777]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 409.346 173.467 420.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a2d68c082ea8fcddda6aa41afdd7ab476) >>
->> endobj
-5161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.363 409.346 246.523 420.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-5162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.576 409.346 374.042 420.25]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-5163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 409.346 513.996 420.25]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 397.764 123.096 408.295]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 351.864 173.467 362.768]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) >>
->> endobj
-5165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.424 351.864 272.693 362.768]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-5166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.73 351.864 397.196 362.768]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-5167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.805 351.864 513.996 362.768]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 340.282 145.781 350.813]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 306.337 173.467 317.241]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ac86d25d06285c9a2e890770fed084574) >>
->> endobj
-5169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.804 306.337 221.058 317.241]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-5170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.338 306.337 325.804 317.241]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-5171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.603 306.337 469.354 317.241]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 272.766 173.467 283.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_afaae25a26dbecf9341c7fb2c2575f81f) >>
->> endobj
-5173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.804 272.766 260.36 283.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.924 272.766 353.39 283.67]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-5175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.189 272.766 496.941 283.67]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-5176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 239.194 173.467 250.098]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.206 239.194 225.013 250.098]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a59d06e9b429faef7a632d58e4a0b12bd) >>
->> endobj
-5178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.35 239.194 311.906 250.098]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 205.622 173.467 216.526]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.206 205.622 225.013 216.526]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a6f581bf46ab0488f444977453ba2ea2d) >>
->> endobj
-5181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.35 205.622 326.292 216.526]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-5182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 172.051 181.215 182.955]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a09726be54fe2a591787de59eeffdd2ea) >>
->> endobj
-5183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 138.479 241.112 149.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a5eb7f86790ada6549123a0225d68a4de) >>
->> endobj
-5184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.449 138.479 328.006 149.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 93.949 255.488 104.853]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a6424da8931d774f6a2e403c1e2f0d09a) >>
->> endobj
-5186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.826 93.949 342.382 104.853]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5188 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5192 0 obj <<
-/D [5190 0 R /XYZ 89 770.89 null]
->> endobj
-5197 0 obj <<
-/D [5190 0 R /XYZ 90 259.292 null]
->> endobj
-5198 0 obj <<
-/D [5190 0 R /XYZ 90 225.72 null]
->> endobj
-5199 0 obj <<
-/D [5190 0 R /XYZ 90 192.149 null]
->> endobj
-5200 0 obj <<
-/D [5190 0 R /XYZ 90 115.773 null]
->> endobj
-5189 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F110 1507 0 R /F39 2320 0 R /F11 613 0 R /F68 3032 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5217 0 obj <<
-/Length 2483      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�F��W����1�V��l9�(���

�
-$G"6 @`d���y� 	Q��l�^��<z�{���G���q������	�R�J*���(�Q�S$$�ZDc��ɧ�"&"��U���竛˫�k3vvys������# P������'
-���#����NZE�2����/g���i>�3�5�D����$�y�WeVL����]��u�����^�t=!$n,��Aהr�x��(Ed2%���n����f^�k�����e��
���b��yQ5��i��?&D�������U�ԋ�*�U:P"	��{J�dʸ����5mWw��]j�1/�&�kΣ���d�h�^ܾ�6b�E\�u�]�����Ip}�P,Um�W���|�ţ[�e��*R
)J��1u��[u8��rGV�b�V�Uה��LAk��#�Ygs�x`�/G�$��n��Di”��X�3��I�#�d�<��rg7e	�LO��Kme��lBq�ɋE^޻��}NL{� 7mV�݂��Z
�6�M�}��5�m�:��0_A����Ĝ�����v���˺�P?���Я;\

��/K�~pe���CN"KҠw`.�X��y�?o�"oG�,�yڃ�
M�"!�u�ʋ��IIE�$�����<�I���; h�
�>�j��p�j�����[�=5�˝�ie~�kϴͩ��.u����`�vDFo$7P� m���+�7.��1 �L�e耩�1�p�b���D9WU��4ƭ$Q(�)hN!̘[{��/�����(Iw��
=�E�g��T3�
k\�,�_a�kF��0
�ʡӪ���Eq�a��
��+3A��F����ۍ3w��B��1-u3vI�i��[��J�Tl=
7�Y�[׶���c:z��M6��`
�8G٦�U P�
-��՜�‘��3����u�z�*0�8L�� �.�&g�e����	�\f뵽g��V�;�n�֋M����u?��ҵ
#���~�'/{�

,��@xU���.4�u���h*��M��m�
��L𺚐ت�Gߎu�폭���Ah�KGH7�'�m
��$���=��#���H��A��Cla�wn�C�T��f��Ձ��f��-A�3�y��۷Ӗ
�M;�{[o��͂���]U���۲�6
�sB�����y/�>������o�`p����oV3e{���&�"��
-��^e��5&j�gQ0��k�R�v�~,MD����r��0�
-0��c!MW�,P�O����Y��BU�x~~��?��O�?g�@�sP�^T�8+i
-��S��0D�N j�XS�
� u
�i��9��,޶�k��w{�N�0�4��f�/(Eq�^(�pK�%(�E�8m�x�z�D_6n2J�*
�B��W#ꁀ
�:K����~]�^�\�1�)FI������
هJ�QI���ջ]~���� ����u����t
&}��<ѧj
n4%�
-��H��?�/�"���C�,Xk`�LN��7���T�ֵk;��M�oc�����4�Zwj��	�q(XP��Q�7��J��%������4c��&Jdr��!�X�cK��-�'H��TqD���
��\�N�WJ .�%���fu;�IQ
-	^2
Czw���'4J$�ίcv�fH���j
��	�g�!���^�An8[`p�.M�ҥiݒ=x���#�r5<�-�ȅ:%ZOMѡ��0;,��׳p�����Uiςį�c
�=>�!��MҨ=� �����k���S��e�)�X9d-:
-�/V�����S"���,D�\"� P �}qj���#<
-U��� ��B����_@��S�p�� �%�$ͺ
I�O8�X"���qN`3� 2�b�����B����V������À��-��)%9 9tWD�8"���(���Ɔ����^�wc ELv!���C��[��+�t�D����u�m�}�W�P�,
-�Hx��y�n��
3#�]O_ �!�=��z9���5�y1�
�Me�_֜�p��?��'X�G��ɔA7�^`��LJ�m
-SH��<�b��}�%o�p"�u�S	5�~�����T?
)Aɟ�~���P��pl������A
Q�8+��q'm��1�i�j�#x� )]�|�Ujo�]�x?yV
�mn��X	@!����y3B<��|~ʄB@4H���y}J��͟L볃��7�^�|��-v��=���w�̘#y"C�n�g����`
%�'
�ON���
S�DIZ�@5a���-{.G�J6Fs�
P�Ayp��p��W�:�k�\��a $�a�X/��jp�	e���Po!�H���g�C�J�`�m����݊Eo+ �%7z�-����=\��3��3����?�Ư���6"���)+7Y��`!��A�?� �Z�Gt���
��<���FBt�L�l����׳�}	�W�}G�]
n
o��w����Bp���-�>j
�'@��c :
-endstream
-endobj
-5216 0 obj <<
-/Type /Page
-/Contents 5217 0 R
-/Resources 5215 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5109 0 R
-/Annots [ 5187 0 R 5213 0 R 5214 0 R ]
->> endobj
-5187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.58 641.634 242.137 652.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-5213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.326 496.373 370.268 507.277]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-5214 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5218 0 obj <<
-/D [5216 0 R /XYZ 89 770.89 null]
->> endobj
-5219 0 obj <<
-/D [5216 0 R /XYZ 90 704.286 null]
->> endobj
-5220 0 obj <<
-/D [5216 0 R /XYZ 90 704.286 null]
->> endobj
-5221 0 obj <<
-/D [5216 0 R /XYZ 90 470.844 null]
->> endobj
-5139 0 obj <<
-/D [5216 0 R /XYZ 90 448.468 null]
->> endobj
-5222 0 obj <<
-/D [5216 0 R /XYZ 90 448.468 null]
->> endobj
-5223 0 obj <<
-/D [5216 0 R /XYZ 90 377.921 null]
->> endobj
-5224 0 obj <<
-/D [5216 0 R /XYZ 90 299.923 null]
->> endobj
-5140 0 obj <<
-/D [5216 0 R /XYZ 465.707 247.629 null]
->> endobj
-5225 0 obj <<
-/D [5216 0 R /XYZ 90 240.989 null]
->> endobj
-5226 0 obj <<
-/D [5216 0 R /XYZ 90 154.79 null]
->> endobj
-5215 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F32 764 0 R /F10 765 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5230 0 obj <<
-/Length 2097      
-/Filter /FlateDecode
->>
-stream
-x��[[o�6~���Ӯ
�9��b޶�n1�H;٧� ��L"�-e$���}EJ�
Y�1��'���
��>2��c���g�����[�@!�(�{$WHD�k|
	Fj� ��vNp�����vNqX��OzY&�?f�ˤ��ܼ|��8,���
-
�[%Ue����|�y��J�B"�������f_fD���$� ]�>~��^�`�T
��tZ�2x����g�i�=�i
NW���+�1$a(������~��"��^@����`&x!<���rR�f���`_��Hq��&p�7AJ�=XO�i�� ���#
-��@J
<�P���
��030��ͩ���M��9KV��>)�L�����k�_���b�̼*
-��}M�DrJӨo�+D�@ѻ���S���'{���I�F��j����}L�h�2���^�����oYZ;�\��
-֙����	�������l ��^
�*��pa�#PBFE�
��7��e$#�@��"�'��HŪ�DH1��v�(��9!���#"�u�X��b�8,�@��84�����C�����9�-f�K0'�ϸ(J��ć(
SģS$��2�
l�K�B����w���nތ�.�r����=��.(q�#�ތ̻`���`�
����N��J߿ϟ7�rĐĝ���z=g8܎�����=A{��H�(�:}����O��1�K;��f�
��&[-]�K\�aϮ"i��R�fS@�,

8V�P	-�Dm����d��.�6�B�s���2��Ue�b?����� j��B���[�l�T�ֵ)�Hx���S�	�Q��[�����;bS���
-���F��
�H��E�q
	!R����3,�8$��b�
$���"q �5S%v6����9,
T.��P���?�Cݎ�9�/8���~��ȼp/�:]%�^�x<�A�Xv���n�
�`�f�>�4�T�q����B
��זI�,@�MZoJ�^���m|��a ���W�
�Ƙp��}始&!r��
v @���ѣ<Z��`�"��T
�(
-�'�؂Êr�K9ۓ��:Iƽ�/ɿ��5YcI
��Tm�
-O�,MV�m�LuDxK�Ժ����j��We��3�Ze??��eu�E^�
�- ��>m�b��x��1T'�;�� L�WZ�
-����8Fq$}��
�5��+(��F�}j��=U/$�M����+wМ
d�^]�*̣̟����3~:�7Å�>��@�3��Z�?�T��c~��'����A��O���
��!0�W�2.��u���:�e�}�
 �o|�����~�F0 8
F��-h;���D}�yL��7#�0-�/>�?�WY��Ӥ_������]%5���Uߣ��թ~7����dH���T;,"PY�~�	�
-��" y\�}�+�R�QV2�n�X�ٸ��>տ��^��a+ H"|� ]�x
�`T6���#
-B��+�W�l��*�$��
�=�>��'3
f���+E�z��bOіX
Vt�W
�
�
-N-���y;��B�
�q*̠ʾ�g|�B���m�3��vxJ܈�����7��$��
 ��:�Ҧ�^����jSv��;�?N_.ޞ�cT�>��*̣�F
�6;8�"Ng/f8��{Hr{� B�^"��^|�������^<����	��{�x��rw�we1G�-#��,�ז��x������ʈ���T�E��T���
ؔV9�ו��1D$=��\'�(�H��(ò�o�6�f��ڄ�x at c���
<���Isci>dndS͘Gn,itʍ��_���;z��
�W���GAr���zgi½IS��Y^)ɸ[�%���,/_��&���}�ň�+�v�~�@�
d��h^��T�1��
-;�+��{;S�d{�0�������K����ǐИ���
�=�UM������h�'�1��^�J$ڋ��|���h��t�Ϲ�K&?%�&Yٶ!����G�;�A6�
J:Fp�Ak���
��fM%�Ŝi�]y=����۷�7���QZ�_2��
�eW�=�g]�����r����Z��&�mi���_`1��6=���c;нx�~͂o
X��n�	��%
-endstream
-endobj
-5229 0 obj <<
-/Type /Page
-/Contents 5230 0 R
-/Resources 5228 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5109 0 R
-/Annots [ 5227 0 R ]
->> endobj
-5227 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5231 0 obj <<
-/D [5229 0 R /XYZ 89 770.89 null]
->> endobj
-5232 0 obj <<
-/D [5229 0 R /XYZ 90 718.682 null]
->> endobj
-5201 0 obj <<
-/D [5229 0 R /XYZ 90 684.012 null]
->> endobj
-5233 0 obj <<
-/D [5229 0 R /XYZ 90 679.529 null]
->> endobj
-5234 0 obj <<
-/D [5229 0 R /XYZ 90 591.173 null]
->> endobj
-5235 0 obj <<
-/D [5229 0 R /XYZ 90 513.176 null]
->> endobj
-5202 0 obj <<
-/D [5229 0 R /XYZ 90 478.506 null]
->> endobj
-5236 0 obj <<
-/D [5229 0 R /XYZ 90 474.022 null]
->> endobj
-5237 0 obj <<
-/D [5229 0 R /XYZ 90 385.667 null]
->> endobj
-5238 0 obj <<
-/D [5229 0 R /XYZ 90 331.978 null]
->> endobj
-5203 0 obj <<
-/D [5229 0 R /XYZ 90 285.353 null]
->> endobj
-5239 0 obj <<
-/D [5229 0 R /XYZ 90 280.87 null]
->> endobj
-5240 0 obj <<
-/D [5229 0 R /XYZ 90 192.515 null]
->> endobj
-5241 0 obj <<
-/D [5229 0 R /XYZ 90 114.517 null]
->> endobj
-5228 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5245 0 obj <<
-/Length 2404      
-/Filter /FlateDecode
->>
-stream
-x��Zko���_�O�
����Ig�lg�i���
��8Bm�+�����R�$Ӗm�QQ()yyH�{﹤q�p��ӫ��

2��`�

(n����<�2"���N��Ԉ	��Ƿ?�O?�O?�wW�W�\x�RH�`����sx�}�3:��l�
-8ep]���z�
�����␁-!�
#�(��	��
Ɣ��l
""�#
6lo��)\md��PH�y3:J�cBFۗh�u!0
-q-�@@1F\q���)
��D��77���S��|��9Csj�D�Ҥ�1��
��a���d<���~��'\��,M��B�c�҈
�<M�&Jf���m^D���A���o����&�V��-�+D#-U�pN�4�0	�:��|�U�/��z���k�Ե']'��ݐ`B)"XW]?l��<��xV���N���+?g��k�W�Qާ��u�,W��x��B��j��K�m=N^�,.
��n��Ù��ǫ(��C=bӴ
z
�Vď-{`�"tF��Je8	WQe�P�oo���?|[����c��@�u2XJ�.[��Y��M �DX�2
-�+j�V+��u4�9R��I��P�o
_+")<|
�-���P��hxz�䎚���$N{�lY�N�J�|��:N"��@; �.�x6�
͐��K�b��5&C$v�2� ���A�ڇߥ��K�#� ���
H�ݤ���aF���1�
��dt!�NF��c�	O 6y��o�l;[F�w�zStY�
)ܘ�oV�1ãmL�@V�}�p4�&���R�E3�� �	t�W�+���
0dn�T\I��3ي2X��J� &7oR�ѩ<O�jI�%���+x�)���$מ�@�3�+��뙤Emb�
�hޡ���P#�&��7Fk=E�p�G�
N���$W�7�6�p��fVl�Z۬�mu���X9^�Z�)
�p�>t�=� �"�z@��b�R�C�`èkj���`
osɶ�S�H�W� ����S�%\�dʷIΊx.��:�?��=GY�qXD5�b��4��kՆ�)�eM~�X�fy?F^�
�	&��CR�r�g�9g���9a��
s��h>�0���A� ��
���|��0?�=�� P�0��
-s�v���w� m������&.s������kyN����v��[�3�01�V�MW�e����e��]�9�8��d�������S=�CWMB 6I����
o������M�'|:���#����Ҧ
�)H5A�(W��k�
-6
l~)4N6����LsGT;|�!���b���y(@��惿E�3
��I�3ȓ���X�A�I3�HP�
0�Z9�K��D�@�PLO��W��!�������˱��`��!�3���9�B��0����h��\�Q�><z�n
�B�6�4,��b��`�v:ܛx��P�����>��!��A7
�a��ڹܛە��IQ���K[�4����&���KJ śC�b����V���]bc?h�����>���
����`T��wB5S5��r���wIFH��z�fF	�
�Q� �zΉff�-5��PtRaN/�	��)CB
�2^p�Jźz7�1X��#S��
-�F�~H_;�J�����
-����J� [���`v�?� ;&�hu��O���~�R떞��J?�α8����N妷J� �?{�/
����&ܗ8Y�I��*�ʗ6����a��Q�іR���tS�2�5J_��~��)�gHy���.t�ۯ��~�l�*;d�$L��M��5Y�y�ϢY�G����Q̖�y����
T���_Ok���"�/�VVw/a�.\�������ʹ�H�!���X�LWa����'Z�M�Ú�q鵏�|'�Ni��hJ�'��s�K�^g�k��ԯ��|zG�`M23d3�Ŋa �(g��1�Z�a�^ƼQ7�v
]�\�����[�|���-��f�A�2��t���Y�. ۝	�=�=�WgΨʟ��7���6+�"@cc�~�G�J�-�n;��d1��Fϧݒ$98ՠ���J�b~s���E��e٘�V�Nӝb�4fC�f�����D���a�̟��%K�ۯ�#����^�!�}�T�}����Pe
��
#NZ9�ڱY
J~g�F�(�*��uC��
!9mV��p���Z�e�6�$ �TE�vc[�2ہ>��)w�.�j��,�a=�r�]Jp�'�HQ�����8�[%~�q0QeU�v�˗u���nł?�`�57{��`Me
����4|h{�X����ç���y��v,�ȥ��dS�r[i�[;Q����i+8[ @��9�\@�p��������;x�c�)c_�b}s}��Y�2[ H�uY��@NhK���#�UZ���	<������<�7��?�
-endstream
-endobj
-5244 0 obj <<
-/Type /Page
-/Contents 5245 0 R
-/Resources 5243 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5109 0 R
-/Annots [ 5242 0 R ]
->> endobj
-5242 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5246 0 obj <<
-/D [5244 0 R /XYZ 89 770.89 null]
->> endobj
-5204 0 obj <<
-/D [5244 0 R /XYZ 90 721.073 null]
->> endobj
-5247 0 obj <<
-/D [5244 0 R /XYZ 90 721.073 null]
->> endobj
-5248 0 obj <<
-/D [5244 0 R /XYZ 90 640.379 null]
->> endobj
-5205 0 obj <<
-/D [5244 0 R /XYZ 90 605.709 null]
->> endobj
-5249 0 obj <<
-/D [5244 0 R /XYZ 90 601.226 null]
->> endobj
-5250 0 obj <<
-/D [5244 0 R /XYZ 90 512.871 null]
->> endobj
-5206 0 obj <<
-/D [5244 0 R /XYZ 90 453.892 null]
->> endobj
-5251 0 obj <<
-/D [5244 0 R /XYZ 90 449.409 null]
->> endobj
-5252 0 obj <<
-/D [5244 0 R /XYZ 90 378.678 null]
->> endobj
-5207 0 obj <<
-/D [5244 0 R /XYZ 90 331.654 null]
->> endobj
-5253 0 obj <<
-/D [5244 0 R /XYZ 90 327.171 null]
->> endobj
-5254 0 obj <<
-/D [5244 0 R /XYZ 90 214.905 null]
->> endobj
-5255 0 obj <<
-/D [5244 0 R /XYZ 90 148.863 null]
->> endobj
-5208 0 obj <<
-/D [5244 0 R /XYZ 90 81.969 null]
->> endobj
-5256 0 obj <<
-/D [5244 0 R /XYZ 90 77.486 null]
->> endobj
-5243 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5260 0 obj <<
-/Length 2280      
-/Filter /FlateDecode
->>
-stream
-x��[]��6}���S�b�)��LS�M6�h���k[�,o3�~/)QmI�ؚ.R̃$�������
J�Ç!6�؜���tp�F��FZR9��5
*���p5~��xB0ƣ�1��0Y��7c�G��q͓����.	�Ǘ/_{7�$ś�
-<z�
-w�����}d�E�Y���lD��8�~:�}@�5<$�+�`8[>}��9��#��t0��6Z9ep\
?�5�^�66���F"�

QDp
_���0��'Wo�U��RH� :�~���l+�x� }�F�p
�������bgy�����$�����J��64�u[�(ҁ.�u� *��%�f�(�蘐Q6��0L�Ҥ��]u C�x�
�jz�p�K�<@\����D �k
�#�T�p
p�x��01�

 � t4�7�4C�7�'T1� %0���l������u��
��!
 ��9Q� 	��8�ڵ�ƙP6�kq7QQ( ���1����2}�ͪN�Q��$}���<	�z�]M7�")���㟿޾����������ZFB�a�HnTTDž1�U��|ZnV�M��,�`i����
	�\�Oї�j9[��VQ���Ȫщ��j�a��c�\��
�e<;l�
-�{�O�{�����3C��|BL-�Y�ETor�YD�2ͻO]��6����:�얅�M_]̝��s�����.w|�D��.r���y1[�����4���/<#6�eFKȭ@�^9�%"5�!�|{���Ż���4�PI$��}��/����j��J'!��*��&�o6��^5�*N�
ISC1u�#�oS�����nxS�H�4$�scz��.�љ����P(3�@W��
��"��<��e�`�ۢE��VO����iZ �ފ�dW�ȺХZdy.M����\?�:�~�[>l���-<,j��!���Xs�n��2\e�
��N�<?�82&E��'"��'5� ; e�!
bb�� B�,=A���A�B<:ʐ>z�eHk:�
\q:��+�	��4|�7�Q�(��
-
z�(ѮG'�^1ѠG�׼E���#�O�#L�FA�y� !B<I�`.N
-���_K��g݄I }�p]&p��fN��iU���u�ڴ�y�ޞfJ�trh>W*ƟB���a��ʕ���2x���BF��B�ڍN�o��ݢ%���	�{?R�.
-΁&S�jN�y����sc��g�6��
0I8�^}[��E�]���6��U�\ms�K�P���i��sь#0�t��<��Ie�@�
-�
Z�=j�%��>�."��L�#
��iЃ���]u�t ~��>z2��l
�E90P��

a 
0f

��I�8�5�%Q�����弆�[�o���Vu!��L
���>��O���L����Ӡ��C�;���)"~�R�t��C���ݪ�&�>�Ͼ�o�|� E<_� F(�L��n�2��'�L�2+hR���
��БZ>�92=��Q��i
~0I�M>P}[���A �C�J��ٻ&�\�|�K���\������h�
�}ӠGd^`�$Y�����o�Xw�l����y��|��.{
t��=t����t ̗{�sO`�)�vڹjf���bߵ�ۼcj)<t�
Y�4z
xTG�'
���t�
�5n���(te��@a��[H��M�<�r�5�QW0x�~���X䕳�#��\t����S�����"W��G�; �6�o��Y�1n���g�����L��y
-3��“!���.�W�����`Vp	��T��<���'�����k
1�(�s}��ɢU_a�K�P����)pUo��VS��)0���H)ߡ�~��{�j<�S�Q`���
-5	�MM�6���o �Fy_�e r��~�
,����̸~	gi6��-Ѽ�إ�>}Aa���o��N �D
�<�Um�yX�k1Ͼ
��2ޚm��߅�f'k�2�Ϻ���{����bV��SErR��m��<T��5�5k����zl�_R�`�b~g�B6�p�t��vkK�M�qM�V
��� ��ݰ�E��@�(�'ȋ�;��1��l�
w Zh�}����2a#�G���`
u���=GYB����)8)SRJ��(kB���ͻ���]����ܭ��f�䗙��5�%�nA�L4�0��(�?s�?Cw���&�t�&[~��H��˫����.�<   �3�d����>N�.[��4�qm	r�P�����L at 2"�����_���t�?\�]��u
	.U�� ���\
-endstream
-endobj
-5259 0 obj <<
-/Type /Page
-/Contents 5260 0 R
-/Resources 5258 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5270 0 R
-/Annots [ 5257 0 R ]
->> endobj
-5257 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5261 0 obj <<
-/D [5259 0 R /XYZ 89 770.89 null]
->> endobj
-5262 0 obj <<
-/D [5259 0 R /XYZ 90 628.424 null]
->> endobj
-5209 0 obj <<
-/D [5259 0 R /XYZ 90 581.4 null]
->> endobj
-5263 0 obj <<
-/D [5259 0 R /XYZ 90 576.917 null]
->> endobj
-5264 0 obj <<
-/D [5259 0 R /XYZ 90 464.652 null]
->> endobj
-5210 0 obj <<
-/D [5259 0 R /XYZ 90 417.628 null]
->> endobj
-5265 0 obj <<
-/D [5259 0 R /XYZ 90 413.145 null]
->> endobj
-5266 0 obj <<
-/D [5259 0 R /XYZ 90 324.79 null]
->> endobj
-5211 0 obj <<
-/D [5259 0 R /XYZ 90 276.499 null]
->> endobj
-5267 0 obj <<
-/D [5259 0 R /XYZ 90 272.015 null]
->> endobj
-5268 0 obj <<
-/D [5259 0 R /XYZ 90 184.076 null]
->> endobj
-5212 0 obj <<
-/D [5259 0 R /XYZ 90 161.319 null]
->> endobj
-5269 0 obj <<
-/D [5259 0 R /XYZ 90 161.319 null]
->> endobj
-5258 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-5294 0 obj <<
-/Length 1700      
-/Filter /FlateDecode
->>
-stream
-x��Yێ�6}�W(�Z@��U�"@����ɺOI`hm�+T�
YΥ_�!%ʒ,;��
h�LI�p.��ph�<��6x2
\\I�)�xӥ��'�B"����nH$�?L�{,Q������zz�zzm�
.�����GJ�Л��>`o��{1z���)��Ļ
��J��Qa���d�5
˜{�0bQ�s�e�7E��[�Ёȃ-�
��� 	*Ojo

Z��o˄`(/P
1�	�0� %DG,�_�i�5D���#
-^����[6���i‡�03b$�+��-�q��
?EI��E���p�[�(�u,
s2;��` �v-e�#�S�MR�e-C��y�S1���#*�0^�.�(o����8
�ǘ���hNB*�����V @
ד�t�#�(�����#%Dܢ���R�E
���Fq:�֛��o�NK0���G	dDB&:+)�!�
F^ $g�A�y2�[�G&;���Y^l`�h�D�j��'xU+��<*�Z�gk�T;aIR�.NW�+�M�	
8�& ����=��H`<�lt{[���m&.#G��#'�r�*���?"M|�T��L�
!Q`������e
Wj� �Qd�LGƉ��0K|B�_o�"�с���@a
 h��2��!׍�����i�-zT�
�P�G	2$m�p�d =���֌�;�֌ Q���=F3	�����!�R�����&�[���L�KE�`.��RN� �B}�n����闞�N9�6�YZh
�O>�(�� ��)~PPLJS�n7���K�F=D6u�
���~Df�@E�WY�*�R����rQz�H��:�O�,K��:��$�\�7o�җC��t�[I���G��PȤĪ������y�`	oG5��Ē��8E=�C~�(���'(��n�˙�4f
-��
-;�nɒH�=���
9��0
�����'�Ҍ;�ނ�Ed<W
�U
�;�nb�
��M���ɳ2EV�q�
5�>�ui�֕�($]�[�B)k�,�>�b%��b���
-m��RV
Lܚ+�t�-
 ��=���e�^�8>ٜ �����{
�F���G(šI�fFch?�uՋ�g���5��9�U�#�Ө��a�
z:������X�;2�+���nP�A����"]�e��(��*���$svU���BPC�Vq[�1(1�m,�|�le( �yF��&0M���c��:��S
��ޝh
�qʞ^׍&�{P,��[S����б�J��I�ί��n��{�z3�]6dB!QBv�ssW��i��a!�-Z�R�Z�}+�G��~��2�9(�>��Vf�M
jș��v �,-D��O�N�P�~��|�h���f[�Ѽ�]Y��L���8/i�d_�
M-��K����s�$���n1��T�.1�e��o\G�
pK��ߢL���lf at d.f���C!3!��G�tx��@
-p���
Hm��;���ӓ���.��o�Ǒ�&˒���A���/�]n>���A�ⴌ���Պ��[��@ ���v��U���mz�qլ��vI>"յcÆ�	i_�R$)��_9���	��)]��]��]�.����k�h!A
�V�i��N&/��[���
1�2ǫ(�E��3�޴�|[_�����?b@�k��U��g��������D��ۢ،/.nv��NWh���[#%@#*�]��u�.��ti���6h�o�r��
-endstream
-endobj
-5293 0 obj <<
-/Type /Page
-/Contents 5294 0 R
-/Resources 5292 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5270 0 R
-/Group 5272 0 R
-/Annots [ 5273 0 R 5274 0 R 5275 0 R 5276 0 R 5277 0 R 5278 0 R 5279 0 R 5280 0 R 5281 0 R 5282 0 R 5283 0 R 5284 0 R 5285 0 R 5286 0 R 5287 0 R 5288 0 R 5291 0 R ]
->> endobj
-5271 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 5302 0 R
-/BBox [0 0 418 144]
-/Group 5272 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 5303 0 R>>
->>
-/Length 557
-/Filter /FlateDecode
->>
-stream
-x��UMo�0
��W��%�aI��C�a��
�ء�!m�C2`�a�mي3�-z
���D=�'�Y��6�Ѻ�U����o��yzě-����������wH5���
-��x��6�"��#~�\���KdpeQ�Y͸
I�&LN�B,2TԩN`���� �)���kj�01v'�9TT�h�p����m�F�V�ib[k5�6����r9��A�@���מ4�ns����a����=�~츘�;b{��T\;�v��I�aʄI�35�#W6���-sO 
Lf��\�b
-��Ʃ~e�`�XN1�"2�f��	���l/$�`�Р���V�h��[4��U,׿�
-��l�L��f~3T
׬��H��6
���9��g�K�Pr�RK��;��L������n�
L����1��"q�we�y�)]���_O�C��3[���9ø�ٙ��M�Z�J�����F[���h���W�	�
uA�?���f?ɵ�"٤�ޜ9	����������gb��ц���)���u�A��z
Q�����mb����X[�}�#���
~^����9
�k
-endstream
-endobj
-5302 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-5303 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /YQTHCQ+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 5304 0 R]
-/ToUnicode 5305 0 R
->>
-endobj
-5304 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /YQTHCQ+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 5306 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 500 278 611 556 556 667 500 556 584 278 278 500 611 278 584]]
->>
-endobj
-5305 0 obj
-<<
-/Length 5307 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mk�0����
��E��.�P����? &�Pc���ߘ7l����L�1_ڗV�+�?�,;Z�0jei��V��:ꈧL�r
��r&�]r�-+M�
樮Y���j7vxVsOOc,~��쨯��}���C�%Q�0E�+�*̛���>��*�����v|m�Xꙣ%9+Z��d��RT'n5�
�j"��_<
i� o����mO�"i<��J�<U)(GL�
-�
��@H�N�r�;�� ��
$=塊B,T!P�l�	O<A^�_~N���KP�#��
-�
}r�Up����/C�
~i��/��_N�_:�_�?�W�n��}�#�ֺ����e��Q�c��l�,��ц��
-endstream
-endobj
-5306 0 obj
-<<
-/Type /FontDescriptor
-/FontName /YQTHCQ+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 5308 0 R
->>
-endobj
-5307 0 obj
-357
-endobj
-5308 0 obj
-<<
-/Length 5309 0 R
-/Filter /FlateDecode
-/Length1 2588
->>
-stream
-x�UV	l��
��+�qb|5qq�8����r_N
�$�ppHR�
i�iVh���
-m��NT;�m�֭L��Ƥj�V���R���6�5��`G�|����@f�
��������{�c��8s
J�f�}���e`u�ɩ�Ɏ��̏���Dl������cA�ׂ�tI<yta�i�I���<5s(�ؙ:�2@�J�f�\ �_�E�9��+L����Kmz� ׊�4)��W��:x'���� _���U���mn�Jp�<�*≹��#䜚{�5�׸bdN��Wf�ֲ�m�U�V��[Y�0f�	n�Io�~��^�(�:��^㯧=�q؋��۷�t
-��Q�Alܙ�i7�W�"�ޑ���󱺂�
�=;wթ­y]u>��Qg��AߛYZ�i�8
-�rs4YJ�:?��(w���vVF��Zg���Vt��i
F
��`�'�m��H$�S�\�m���'Ż\;�[P`O��
-{l�b�[���n��͓���'V]����5BG��ڮ��PuI�]|�n�q���n�B�)�<��T&��7��`��fr
KR�$B3�z�R�r}�b�ь|x=ʝ;���쉥��P��u_/����7Ν���=ɫ��plZ�EL��E9�� �/F�����S���!(���+��K
-�@�W+�����m�E?;�"׮�8�%����N��t��s�2`|A�+z���!�vv��+?�+�?\e=M�Q��r`�૑2Vj3[`�_Б�0�X�*��0�s��Z��Gr�
�^>���3���Ȟ�}�:�[��'�FW���+�㙏xށ�9�
-K�v�,��|�^�F�NWq����&����D"�M����
U��p��>���
�LEg��M���bk3��?������Y���q����Mv��0��v�k?L$����l��X��8�|r�����G9��O��Ǐ�܄aM-O��/��{��7��Ù+33��i�R�?Fneݒ^��q�G��r�\���)E��W ��o��/p[q�¥w�/v͍߮�>��
<�?h�i��Ӹ{�p��v0����z{���L
��U���@^K�}�
��BԑT�#�f;m���Ϫ���fGUp�s��c4���j�P�m��
��Z����8�`n����D�J
-�Z��uW����8ץV��/I'��%�uNj|
^�$�7X�r�
-wx���\�"�V`P�i���l�K/�2�f�!3�-d��FhU<J��-��W�V���$��
�
���W�>��n"�~W�R���� �S�������1���ި�R���8�f|>>~l|��g�k�sxZ�n.Roؚ������‰��
u�]�������ј�]M7����#ѱ${��|̖�$av�K�����8Nߦ��6
%�G�
��
�2�ݠ,~�J~;���~:��ű�w�:e]��Ƴx���lA�}h�f<�잊/
��5�,�9���}�ԉ
A���&<s�����	SO�R�29��������}�r��3�k�jݵ�Z�%�*���fWV�p�J��(��~�����}���U���hl�.�����>���7,.��
&��+�f��DžW_8� �G�@��Z���I�u��[E
�����O�B
����Ô��z��rw{*���RR��9ԬK
�d���JT 5�� r��)-n;
�].��5�33��ǐ�|&a��mc�YZ"
���5�S��g+��D_�kџ6Ư��T��� 3؆
�_��A�_�~jm������_�5�o�!^�*���*Y�N�]�>e-t�1�+G�G
a�	���l�����S���b�뼅�9�u���;���8ֲ�g¼��u;p��Ժ�x��E�w����
Ƈ�ނ7J4�x�).��}��w%�UJ�D�DŽ
-o)���
-un05�r�/�M��h�����Y��s��"�d�#z\�3׃����fN%C
-endstream
-endobj
-5309 0 obj
-1947
-endobj
-5272 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-5273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 307.322 224.395 318.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 284.388 189.925 294.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-5275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 284.388 260.898 294.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a56648c2436a8c8b290e54ff23a69d7a9) >>
->> endobj
-5276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 268.82 422.545 278.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 243.62 224.395 254.524]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 220.686 232.982 230.613]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-5279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 220.686 347.013 230.613]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a311e87a81daa4ca81dfb5ff62bd29b0f) >>
->> endobj
-5280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 205.118 389.11 215.023]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 179.917 224.395 190.821]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 156.983 254.671 166.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-5283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 156.983 390.391 166.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_aef498310bbb162748eb0cc7c1bb07fd8) >>
->> endobj
-5284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 141.416 465.458 151.321]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 86.662 169.81 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_ae1df79fdf94dd23fac62d57fe0681842) >>
->> endobj
-5286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 86.662 309.485 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-5287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 86.662 514.653 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-5288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 74.707 227.553 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-5291 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5295 0 obj <<
-/D [5293 0 R /XYZ 89 770.89 null]
->> endobj
-5296 0 obj <<
-/D [5293 0 R /XYZ 90 718.682 null]
->> endobj
-1230 0 obj <<
-/D [5293 0 R /XYZ 90 631.047 null]
->> endobj
-174 0 obj <<
-/D [5293 0 R /XYZ 90 624.356 null]
->> endobj
-5297 0 obj <<
-/D [5293 0 R /XYZ 90 336.244 null]
->> endobj
-5298 0 obj <<
-/D [5293 0 R /XYZ 90 336.244 null]
->> endobj
-5299 0 obj <<
-/D [5293 0 R /XYZ 90 272.805 null]
->> endobj
-5300 0 obj <<
-/D [5293 0 R /XYZ 90 209.103 null]
->> endobj
-5301 0 obj <<
-/D [5293 0 R /XYZ 90 105.253 null]
->> endobj
-5292 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F22 2996 0 R /F11 613 0 R /F67 3037 0 R >>
-/XObject << /Im6 5271 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5326 0 obj <<
-/Length 2463      
-/Filter /FlateDecode
->>
-stream
-x��Z�o���]�)����0� �
N�B�բ�
ԉ���+w�l���䒼ө��E�������f�ۙY��6�ٟN��89=S,3�H*�����LI�%��u�!'<��q~>!8/6���|Bq��?ޕכ��mu�)6�/_�*����|U���6t����w�כ	�y��V���Nj�O��J
G�
��-��%
�<v8;�|��ˍ��I5���(�?��vp6e�#�E6%!�qg*�(Q��!�Z�U��!3�ǫy��N�T��bbh^.��.}˻��j/g��))r����介��Ñ3�@�)��'~��54�aČ�>�N��S�����_Op�_���ӰL���;y�AXg
-P ��o�eYl��� y}.�������r�U�-��m�PƖm
���վa[��pۊ��Q��3�;@N)E�S��R�E�H�He�[;W��,f�� �;��.���~rΰ��a�~��
��\�q��e��}�3��M�jb�FS�zE�*�[�^Rw�
-DD�^1f�Kq��6
��*̔.�l���SUߍ�D��r�#�Ě��e�
T�a�.&�e�W���{�+����u��s��sbd���,��a�����	g9l�>�	�
V=�K��5�Or��
�i�	D����n.#���
��vlŔAD�
�:]"GF7�4�挤2  �n�T��=���}5��&
3+��V
���m!��W��Sj{(���,W7�z
����5j�v��V�'f|�
XO�#+�8��`G�N#.u�
�L!�ۃ���fw��6���xΦ~�Ξ&�DHv��qS$�h����FBs?ͻҞ��@T�g��Y
�n��a�7����r}Wԍ_lCc�	�Ux�(Wpp�相(`�P��-�ÐN:������֘����3
�m?��z�m	 5TR),�E�cm��/ �!}*I�!R"݆g_�x03FZ�Tr��
\���~�����}rT
-Q�_&c��t��>���LU�����l �LςE�P�Ŀ�P��*Ο��t�;<��P��]QW�擰���C�D�0��o'\C�Gǿ�˯���E�����`�r��;2��h��ʯ+.s��Yޕ��	a~�DDi�.�b\	�P�y]�E5�3B�5�T���SnH0c�H��Ld�q�
�L� ���\�dLP���{*
R
��8|-#1��Ѹ��
-���@Sm�@�G�P����D#lT*�ńkO���V�B
E�w�
�*MR��v�	�~��Tkv�
3�j(r�*��]p���	u
�����T��	��jn7�/;E�@P�
E�g�"��9��C�sD%\��" ��o�.#j��cH�迳��
�L��.�6�
nnH�$
	GX�@:9m�rz��<�ے�^��ĝv��R�
E|͑R$��rZ�P�>�!�''�G�ё @��Cp
{b�#xi�}gHL
�슀���P�.�p���?���Q�/���t�z�sn��}���~�X�r �e����0<��

��?�^Ұ"tƳ)����
W��,��ִ=�݋ ����
�]�k�������a�d �hM�)-��ކ5�’qq��nBK���vA�{[�s�&e�@��l��h�z�ն�4�׫EQ�,�M}Z��B���dZD,��
,�
��}ڋ�`H�.��
��(�@f�0��@2)��ս/��?�{v���8�ۭۻ����M
dc�=��b�.s�q��/����Np���V�i��Bk(��SiwJ�5�;�����$����-G��ڸ��
tR�mu��a���j��`c*�E�C�l$���Ėw�G%�i���:� }`MF�>&.C��@�]������j<]-9*�b,v�Ջ�i�3#2I8%d�D//�M����!�
zC����_��� �W�D��dfZ��
(���������6���Q��77���K����{EX�#��;��v���Xb�¯�]ݻ=+BK� �j]n
-{��yF�JO��$xi�iHj{?�k+�/�ޢ z	�IS��x|��;T�L��@��=\ 
ǔm�2���W�x�c
Ғ��.���ݓ���1Ȁ��A�
"Zf]�~3�T�0AR0��G��ĵHϳ�U�Ĩq�	ը	GvkgM<fgl
������O�����d$�z��dt�7�%)Dj�?��)�~ǭ��Q���6vé��k�d�~�?���u�g!��g�2žp1bm�C,i���(�e�n��E��0�1Qb>���t�r&|z�
<�����$d�	V���e���8|��/�\.��P0W���dL�������m���&B�ᓋ��+X�[W�(7���/����
�{���ŧ?��4�sfk�	;��z������2�[4[-��~G�¨0�fn��xa_-}��$�d�Q`���	 �'�d0Q��
�g�2

�o,{��ۏ�~�jDŽ
-endstream
-endobj
-5325 0 obj <<
-/Type /Page
-/Contents 5326 0 R
-/Resources 5324 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5270 0 R
-/Annots [ 5289 0 R 5290 0 R 5314 0 R 5315 0 R 5316 0 R 5317 0 R 5318 0 R 5319 0 R 5332 0 R 5320 0 R 5321 0 R 5322 0 R 5333 0 R 5323 0 R ]
->> endobj
-5289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 695.329 169.013 706.233]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_ac2aa68157ca89c0b63725c3efcdd9200) >>
->> endobj
-5290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 695.329 306.008 706.233]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 633.793 258.274 644.697]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a2c0a4ef9e072d80fed2be806ed3eb825) >>
->> endobj
-5315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.042 633.793 372.526 644.697]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-5316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 597.229 266.023 608.133]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a22e9347af75b6aac3d63edecff007a34) >>
->> endobj
-5317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.868 492.74 156.234 503.644]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_aeb54a606e241519ea2831af487cd4625) >>
->> endobj
-5318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.002 492.74 293.181 503.644]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.777 492.74 513.996 503.644]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 480.785 191.18 491.689]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.868 441.582 156.234 452.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_aeb54a606e241519ea2831af487cd4625) >>
->> endobj
-5321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.002 441.582 293.181 452.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.777 441.582 513.996 452.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 429.627 191.18 440.531]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
->> endobj
-5323 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5327 0 obj <<
-/D [5325 0 R /XYZ 89 770.89 null]
->> endobj
-5328 0 obj <<
-/D [5325 0 R /XYZ 90 712.265 null]
->> endobj
-5329 0 obj <<
-/D [5325 0 R /XYZ 90 650.45 null]
->> endobj
-5330 0 obj <<
-/D [5325 0 R /XYZ 90 612.173 null]
->> endobj
-5331 0 obj <<
-/D [5325 0 R /XYZ 90 549.674 null]
->> endobj
-5334 0 obj <<
-/D [5325 0 R /XYZ 90 394.052 null]
->> endobj
-5335 0 obj <<
-/D [5325 0 R /XYZ 90 394.052 null]
->> endobj
-5336 0 obj <<
-/D [5325 0 R /XYZ 90 331.401 null]
->> endobj
-5324 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F60 532 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F90 758 0 R /F39 2320 0 R /F75 554 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5344 0 obj <<
-/Length 3100      
-/Filter /FlateDecode
->>
-stream
-x��[ko#���_1h�VV\�N[ M� �&q��݅!Kc[��qF�u6����ypD=��4H�I�����幇4��2�}y�ϫ���eIevu��)n���n��%�﮾ΘԈ	�r��wW_|w��~w����Og���R:���޼��
>�:È�=�F��S����ٿ�p��{�`�$	�|�S1z?&b���&�hj_��-Ƭ�V������X�+����??��f�(��ߗ�tz!� &I=��7�
��
S7���Q߳b�PlU
>��T�tz�TE,2��*���AXho�L8'����n���Q�ReŴoH�K�fNXSs�M:�>O�T;l
��8̥�m�N#�M`(����X}��#,�o�K"Ɖ���*3z
-��k�-U��s��|o�1u�� �@`=!j�k�u>-�*��(W	O9��X=ѯdH+^7�M7�o��S����By�>d'�6‘d�c�$��l|�F.�`ǁ�

��3�4b�7��F�rYX�<m��'�BR�لj�
�q �	b|X@�v�V�)"tS4п��3F����@*�G����I�W�rqw20��b����͡�D��F�'�ʘ�)�����	��6؊�@ip�"!X�ʼnq
-dz�+�ae{�M��$	'~=8�nx"��9o*N�o�͛�?�4�HIՎ�m;��Є$����&N��
�T7�%�L`T�.a+�P0���>��5����QFk��\�?">��Mr�m��d�gv¼ 6@
�\�>�$�>;��,���w�!|:].]�a߬�꾘�r��A�](�~���X���)��N}������Z��h����2_�W��絔a��O9F,]�eY��g_J���LG�tDV��^ܨR�(aD:��Z/QgV��`�DQBm�E	���z�bo?�p��
V]۩���#g\'-��3#P�K�B=#�
����$4���7��c[���[��F�
� M�� �b�m���m�
]<�g�-wݻϋ��*_W�*T��[q�6[êg�D�	=T���JJ��6��oa�q/w5
��z��-'���m�B��a�B�����	��i�'#D=�Ué3�Y�0_٢q<�^N�c�a��A
��#;p5�za�!xa_�qa
f$�:�-��X�n]@қV��
`���#1�+��}n�"��H_"p� �rL�h
-=^_�)
�����^׫KĄ�W׫�M9-?����u�T��z���
�V|p,��Վ�7�.9�#
�Fp����]'��aMqe�(�
-q�o��@��$��E�����@p
Da�@pȦ��؍������s��/~�
-K�&V3"M�`�IN	S�Xh
�k?[ �����O�
x��*<S(��XZ���z�*��
�eU�m
`��U&`oP�)!�a�0�/֖�!'x� ��� l�n卽#���r�q}a5��#�%b�>�
؄I��
����vܬ�+!^�b����nS<u���;�GD"�&�툤�,�j��.

-
��qY��

�);�Н=�����y�(�����>��`[�",��!y�%��o�Г��g��:�/w��ᄅ�v�ƅ�q)Kd�rL�����N��F5���"36
;Q�o��P�!��eZ5#(n�
`�6{س��_Q)W�/6	�l�1i�CϡD�:�.~7� � �}RJa��5"���t�aO�R"mb��ר��o�����1疠
8g�|�u��5��Z�n2�;��j�U��]'q$fXo��D���k�r
;uc�|��
5LT��PA��P9tU0:�9 �].
[����������3�EX\�
�
�W&
��"�������I����U�O;v�!�c��=�V!cdH 
m�� /Tr���CL�d�4m�So��s�;i u�i �*�
+95(��p����f{��Ԑ��h��]x�2�áI
���\�w�-�)l�y<f�4�*���0��<�fy>��/4
-��EC]o��M�W(w�jqݕO�M`�b o�s#�}
���	�l9�^;�7�r��:y[�M��]N�1_t���h:EW1�1e��W���Y!;��r�Ι"����a�[�p�C;��8[�N�p�M��4��N5y�`�@苇�/Ǵur]ofq}5��
-/� ��
��.��r({��+
�b��ctZ�*+#0�]����ʂ�zQ.��|�+�O�m"�������-�U�[F�N�Vr�Q�Q�*�J��%%ѱ��B� H��F��s���1rDX�
�+f/����O*�i{�x�����p�b���U���!$
�0$�W��H〴�^�h����C�{%�^�3�YX�k�D
K$��= �M�<,�2	Ձ
���=@�<�ɵ��t ��Dq�$vc/�!
vfq��eu���甬6��!Mb
�D���t���͵-�O�C�B��\������ZP���g���Ȩ���ݻR��
a2�R�;!q��
-?CP��0�X��K��eDi���~�߯���%����O�|�a���q������\6�xZT�I�	�
�
�w�(�
N��=���17��%7�=A
>9SR�g��<��I׃S���n����o at O�C�6fzbM�璓!����3��Nj�q�b�&&�6��|fbM).�KM��&��$'C��I���=�=�u
I��3����5��]��ˠ��_�Ū'����o�GV�]����J"��IV��[JE���D yxX���]|ƯZ��^[e
��j	M-��#��4q�@�c�)�lo��j
l
?�n3-�|�D}���X�=ыr�u�����gi�]���Uni%\P:-��r�������EP�C~��t�۱�e���{N�7Ij���AyŶ����1��Ƚ�l�i0+�jϥ���v{� RX|*�?	�/�t��{n���2�O�yH��0��<�/�߄^~�b��k�M�ޤ5X���(��~{@��6q¸�|����˿���\��t�X�
[b�� l��dЪ�>Tޯ���
GB!��W���˗7�w�|}�f�j
�
�ն
-jr�����g߷.[��B��
-endstream
-endobj
-5343 0 obj <<
-/Type /Page
-/Contents 5344 0 R
-/Resources 5342 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5270 0 R
-/Annots [ 5338 0 R 5347 0 R 5339 0 R 5348 0 R 5340 0 R 5341 0 R ]
->> endobj
-5338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.089 633.401 513.996 645.356]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-5347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 621.78 126.862 632.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-5339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.811 621.78 513.996 632.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-5348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 610.671 126.862 618.318]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-5340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 324.44 501.708 335.344]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-5341 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5345 0 obj <<
-/D [5343 0 R /XYZ 89 770.89 null]
->> endobj
-5349 0 obj <<
-/D [5343 0 R /XYZ 90 597.097 null]
->> endobj
-5313 0 obj <<
-/D [5343 0 R /XYZ 90 573.874 null]
->> endobj
-5350 0 obj <<
-/D [5343 0 R /XYZ 90 573.874 null]
->> endobj
-5351 0 obj <<
-/D [5343 0 R /XYZ 90 461.793 null]
->> endobj
-5352 0 obj <<
-/D [5343 0 R /XYZ 90 311.597 null]
->> endobj
-5337 0 obj <<
-/D [5343 0 R /XYZ 90 289.221 null]
->> endobj
-5353 0 obj <<
-/D [5343 0 R /XYZ 90 289.221 null]
->> endobj
-5354 0 obj <<
-/D [5343 0 R /XYZ 90 219.123 null]
->> endobj
-1721 0 obj <<
-/D [5343 0 R /XYZ 90 128.414 null]
->> endobj
-178 0 obj <<
-/D [5343 0 R /XYZ 90 119.295 null]
->> endobj
-5342 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F35 1248 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F29 938 0 R /F99 5346 0 R /F1 833 0 R /F24 529 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5375 0 obj <<
-/Length 1777      
-/Filter /FlateDecode
->>
-stream
-x��Y]o�6}��0�����Hۀ-]��c���-Ŧ
!��J�2��$K�
g�=�!�$S���{xhco�a������d^�€���
�'y�D w�O0"t8"c�rH�e���rH����wz�E7o��,��gg�Q^ܼ_�,*���<],�d�����!sЀ!�	d`���
�J�L[}~=
)Lk&��'
��XU�����|
��pDYP�֋�<*t��JO5̥|����X7���
�|=�20Q�GJ���/?co�_{�Pyv�������a�� �0
�	A�&��7q2��&�g��!�.p��$��U��9���CL �b��0)�� EȪyaJ�	�F�"�h�
H۱�.�x�' #Up���xY�%�՟^�q�7�
 sl�^��ʫԑ�=�`
�@Y|�q2s�]g�pw�|���L�I�>+���.ܨb����h�!�;�ݹ�t�Z褈�:̴J���s7�c\>�Fq73��5X`̛Y��^�U��<
R�?�+��1��t
	 {���?Q*�c>�
c�����
-Am]���##zz�r���
@D��R���������u'�h�A�8����q9dTfH�_*�v+����� d��B)mÑ��� A͔8NR",i;�JP��f$DD�G��Q���,S�)�
�A`t[�:5<�lT<Vʼn?3xVJ��������VRNL�Ն�j�|d{DCfuqD
-�k
�Y�ߣN#����^�)��V��z�G�v*S�z��#F_kS��)��M�>qSh������=)�C���
K7R�DV�!�]�l�p d���
3�Ma
-`�=�I���
�,�׻�*���
?% IhFJ2y�x��2��P�1�N� �d\!%�1R` ���
�H�
-`£��\��;�/t���=����1��j0��ݥh���#i�;*ވ";�Q������8*K���)T���B[�U�{�e�<A��GI%���i���jq��^6�=�nR8h���p�BV�
���_�z'`�P�]N+�s9&x��'�r`"sf~ewԞ9�����'^ǝ�
�h	��i�Z8�U֧(מ1d�Mw׽���MK��7��K�<X �C>�ه���-�en�'�N[���U26—�MP]j��H�GD�6��.���f�������7��Jm�H��n��N
̖��n����e��;:چ�ؿ��0u
��;
�G�(���p�APٝ�asȍj�	�K�:
i�B��ٕ�W�����O׻0����%��J����q2�� �g�+�,�ь�◗$��+�����1'C�q�V6߫�}�Ȧ�e�(`�3��[E
��l5���&^15%�<���}��)��M#�;�~(���c��K=�
e���]��PՄ�N�{��d�.���9H�����aR;`�/IJ3�2�A��֑��〔���.ъNA=GFX�Em5O�m����e��m�N`��8�z�n���h)�9\X��h�עCg�$�#��m[���dN��Ԋ�%��3���/֥�ڻ��t�L��ܼ�{q��١TQp�
� ����ܹ�E��qG����N6�¯�=^��>Z�(qǠ2|����"��SY�ٺ�b�H���zk�E���L���./ߖ��:�v(��v�wQ���Ú�����;z��>#����e��^u���!�I����v��+������j��d�ƀ���l�#DX�
-R��E�Վ
.lEQuZ�p�
uh���<#&RR;b��~X��
���`�� n~(�t���
-endstream
-endobj
-5374 0 obj <<
-/Type /Page
-/Contents 5375 0 R
-/Resources 5373 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5270 0 R
-/Annots [ 5358 0 R 5359 0 R 5360 0 R 5361 0 R 5362 0 R 5363 0 R 5364 0 R 5365 0 R 5366 0 R 5367 0 R 5372 0 R ]
->> endobj
-5358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 247.594 150.493 258.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a33a5462cd5398fdbd61989d17aeeaa72) >>
->> endobj
-5359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 219.114 141.367 230.018]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.865 219.114 174.293 230.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab74908b692bc6f8112f5d27b96141431) >>
->> endobj
-5361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 154.512 199.475 165.043]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afcba1dd5e579752d6dcc40ef4d5799b8) >>
->> endobj
-5362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 128.131 199.475 139.034]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ac0ef828e81a5c7625db3abadcafc8438) >>
->> endobj
-5363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.812 128.131 301.193 139.034]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 90.167 199.475 101.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a009f1dc78c8b168cb2256481169157ac) >>
->> endobj
-5365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.812 90.167 301.193 101.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.691 90.167 477.247 101.071]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.672 76.49 303.64 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5372 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5376 0 obj <<
-/D [5374 0 R /XYZ 89 770.89 null]
->> endobj
-5377 0 obj <<
-/D [5374 0 R /XYZ 90 694.769 null]
->> endobj
-1722 0 obj <<
-/D [5374 0 R /XYZ 90 600.725 null]
->> endobj
-182 0 obj <<
-/D [5374 0 R /XYZ 90 593.994 null]
->> endobj
-5378 0 obj <<
-/D [5374 0 R /XYZ 90 504.223 null]
->> endobj
-5379 0 obj <<
-/D [5374 0 R /XYZ 90 454.803 null]
->> endobj
-1723 0 obj <<
-/D [5374 0 R /XYZ 90 385.784 null]
->> endobj
-186 0 obj <<
-/D [5374 0 R /XYZ 90 379.052 null]
->> endobj
-5380 0 obj <<
-/D [5374 0 R /XYZ 90 266.32 null]
->> endobj
-5381 0 obj <<
-/D [5374 0 R /XYZ 90 266.32 null]
->> endobj
-5382 0 obj <<
-/D [5374 0 R /XYZ 90 171.173 null]
->> endobj
-5383 0 obj <<
-/D [5374 0 R /XYZ 90 143.45 null]
->> endobj
-5384 0 obj <<
-/D [5374 0 R /XYZ 90 117.442 null]
->> endobj
-5373 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F90 758 0 R /F60 532 0 R /F22 2996 0 R /F93 763 0 R /F68 3032 0 R /F39 2320 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5433 0 obj <<
-/Length 1159      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�3�7HO�C
;�q�X=�
%R2'|�$�����M����%�'��b��}�\� ԗ:��k�O�� �
l��>Y�6������/
$,���N���娼��ϳ����B�i��FC�
�P����y�]~��+�?����ɅB�b"��~�����ض�ÖM	���@�0�
-c����ޞ,K3>������8���_M
ϝ��Ù�t�I)̠q�_;��?ݚ��\�^%�9^G�-���^���H�h���:>��nI9Ub
8E��-
TZ�0�yV��G~�;�����8*��I��œS\V���s1�vʉ��UX_����)Yбv��Qm&����!���Wں�t<>)�u�d��J˥AR�G{FH�� ������=!�GOKziB������v���wr��
��Y�N
���R3IJ��`����������Qb����-��ʞ�3@�� $��K��#��ߍ׳�>�m?~���B�c'�

fI2���t9\�L灓���!��(�s!'2#������ϔi�y�gRh,sP��^l��/�����F���q���je!�1��B��
�+A� I���

���,�_vJ���A�ܪ ͼp82�r�ݒ�PjW����4
0���nW^����$�����0��VC��
��^Z
`a�^�U�����v(���*y'?[ˆp�5��&F*9�6NZ����ȑunz�( @��
�0l�E���	P��i:�Xysa=ڨT�Õ5�t�H �
��
m�&"��X�`�
����JI:d]ҷ�Up�ɵ���s[(�� �
��� ��̣R7-��?dk~W2y�{z
~�����` �����8��ӟ��n��Z�Q��HP� ߚP`b��`
H
�6�����탣
s��
�
������*�\oᬃl s�f��U��}�4Bχ�˟�؝�� l{f7�K

�f�d�;

��_�W�3��G���F.�;�<�Xck ���y�
���yg�>�Ɣ
�Ӑ��b��Q7��F���d)��2
-J�
��u9�;?����;��_Lƌ�7�''ZWs^��7���5�@E*��
	��Pv}�������=���5�u�����z�z�̋�I7����
���‹8��J��B$�<2����|�
-endstream
-endobj
-5432 0 obj <<
-/Type /Page
-/Contents 5433 0 R
-/Resources 5431 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5270 0 R
-/Annots [ 5368 0 R 5369 0 R 5370 0 R 5371 0 R 5386 0 R 5387 0 R 5388 0 R 5389 0 R 5390 0 R 5391 0 R 5392 0 R 5393 0 R 5394 0 R 5395 0 R 5396 0 R 5397 0 R 5398 0 R 5399 0 R 5400 0 R 5401 0 R 5402 0 R 5403 0 R 5404 0 R 5405 0 R 5406 0 R 5407 0 R 5408 0 R 5409 0 R 5410 0 R 5411 0 R 5412 0 R 5413 0 R 5414 0 R 5415 0 R 5416 0 R 5417 0 R 5418 0 R 5419 0 R 5420 0 R 5421 0 R 5422 0 R 5423 0 R 5424 0 R 5425 0 R 5430 0 R ]
->> endobj
-5368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 707.957 199.475 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4ce2f9170fb3470ba10d87607c3c0bf3) >>
->> endobj
-5369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.242 707.957 291.799 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 682.641 199.475 693.545]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4bed59d493c4fd91537602efb267c938) >>
->> endobj
-5371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.745 682.641 320.301 693.545]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 657.325 199.475 668.229]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a80f6de87ec43c33fac3832b14a507c0b) >>
->> endobj
-5387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.525 657.325 323.081 668.229]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 632.009 199.475 642.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a298300b8f88eb674c317b99ad09a474b) >>
->> endobj
-5389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.12 632.009 313.676 642.913]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 606.693 199.475 617.597]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a2024878c4c26cb836d454e2e93f40c8f) >>
->> endobj
-5391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.313 606.693 320.869 617.597]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 581.377 199.475 592.28]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4f3206ab2d3c47e2014e5b306167c7c0) >>
->> endobj
-5393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.517 581.377 341.074 592.28]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 556.06 199.475 566.964]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_acca11ef67e39b711f96604b6bf806feb) >>
->> endobj
-5395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 556.06 330.264 566.964]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 530.744 199.475 541.648]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab4d4a0ebee3fcc93490aa029028a810b) >>
->> endobj
-5397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.487 530.744 333.044 541.648]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 505.428 199.475 516.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1bdc1023fb4478270594d0e965eb90c9) >>
->> endobj
-5399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.083 505.428 323.639 516.332]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 480.112 199.475 491.016]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a461dbfcb8f68886137794e4a408fc55e) >>
->> endobj
-5401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.276 480.112 330.832 491.016]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 454.796 199.475 465.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a74b0a8cfdec7831e7a3e296b3e3751dd) >>
->> endobj
-5403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.48 454.796 351.036 465.7]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 429.48 199.475 440.384]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6957dba3dbf92459a364893d7ecfb897) >>
->> endobj
-5405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.81 429.48 292.366 440.384]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 404.164 199.475 415.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af47ee9cf59cfac8a346660698c61d113) >>
->> endobj
-5407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.215 404.164 301.771 415.068]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 378.848 199.475 389.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_abf60cc7fa60d33c4fe958126d55cbac2) >>
->> endobj
-5409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.419 378.848 321.975 389.752]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 353.532 199.475 364.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a77a2c5c27e9c0838fea6e6447b20c320) >>
->> endobj
-5411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.431 353.532 347.987 364.436]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 328.215 199.475 339.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a404beea19c04f4e7bbcfe81aae0d6a7d) >>
->> endobj
-5413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.873 328.215 347.429 339.119]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 302.899 199.475 313.803]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ada0964a53a3426e1fc35355ed38a235c) >>
->> endobj
-5415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.745 302.899 320.301 313.803]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 265.628 199.475 276.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aca7c785640663dd43199b6f4c9262b99) >>
->> endobj
-5417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.469 265.628 327.026 276.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 216.402 199.475 227.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a01655d2b2c4a079c9474d9072891e007) >>
->> endobj
-5419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.812 216.402 301.193 227.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.672 203.071 303.64 212.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 191.086 199.475 201.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a9d2cd0aa9626fd28ec99bde5bff4c020) >>
->> endobj
-5422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 165.769 199.475 176.673]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa3de5a2fe7f06d0aa3e4972be2023933) >>
->> endobj
-5423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 140.453 199.475 151.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afcb46dd5c0701130f067f577f99ef27f) >>
->> endobj
-5424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 115.137 199.475 126.041]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a24e90bb8bb38d248aca79c76a1717d9d) >>
->> endobj
-5425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 89.821 199.475 100.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a55e9dfdf5da9a55b7523bda6b7f56c78) >>
->> endobj
-5430 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5434 0 obj <<
-/D [5432 0 R /XYZ 89 770.89 null]
->> endobj
-5435 0 obj <<
-/D [5432 0 R /XYZ 90 721.073 null]
->> endobj
-5436 0 obj <<
-/D [5432 0 R /XYZ 90 697.761 null]
->> endobj
-5437 0 obj <<
-/D [5432 0 R /XYZ 90 672.445 null]
->> endobj
-5438 0 obj <<
-/D [5432 0 R /XYZ 90 647.129 null]
->> endobj
-5439 0 obj <<
-/D [5432 0 R /XYZ 90 621.813 null]
->> endobj
-5440 0 obj <<
-/D [5432 0 R /XYZ 90 596.497 null]
->> endobj
-5441 0 obj <<
-/D [5432 0 R /XYZ 90 571.181 null]
->> endobj
-5442 0 obj <<
-/D [5432 0 R /XYZ 90 545.865 null]
->> endobj
-5443 0 obj <<
-/D [5432 0 R /XYZ 90 520.549 null]
->> endobj
-5444 0 obj <<
-/D [5432 0 R /XYZ 90 495.233 null]
->> endobj
-5445 0 obj <<
-/D [5432 0 R /XYZ 90 469.917 null]
->> endobj
-5446 0 obj <<
-/D [5432 0 R /XYZ 90 444.6 null]
->> endobj
-5447 0 obj <<
-/D [5432 0 R /XYZ 90 419.284 null]
->> endobj
-5448 0 obj <<
-/D [5432 0 R /XYZ 90 393.968 null]
->> endobj
-5449 0 obj <<
-/D [5432 0 R /XYZ 90 368.652 null]
->> endobj
-5450 0 obj <<
-/D [5432 0 R /XYZ 90 343.336 null]
->> endobj
-5451 0 obj <<
-/D [5432 0 R /XYZ 90 318.02 null]
->> endobj
-5452 0 obj <<
-/D [5432 0 R /XYZ 90 292.704 null]
->> endobj
-5453 0 obj <<
-/D [5432 0 R /XYZ 90 243.477 null]
->> endobj
-5454 0 obj <<
-/D [5432 0 R /XYZ 90 206.206 null]
->> endobj
-5455 0 obj <<
-/D [5432 0 R /XYZ 90 180.89 null]
->> endobj
-5456 0 obj <<
-/D [5432 0 R /XYZ 90 155.574 null]
->> endobj
-5457 0 obj <<
-/D [5432 0 R /XYZ 90 130.258 null]
->> endobj
-5458 0 obj <<
-/D [5432 0 R /XYZ 90 104.942 null]
->> endobj
-5431 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F39 2320 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5489 0 obj <<
-/Length 1384      
-/Filter /FlateDecode
->>
-stream
-x��Zms�F�ίЧT���^t:�i2�:q�iں6�dg!
X$aI8C~}�E	+�c�L?	�������]��������)#�<;�`lx�`��#��ƕ� @��"�yn!h�Y��-
�t���a�?G������
�J!
���#�Y_�z��V���X_-�i��b�X�6���Jj�(X�(&
@
���}H����s�v`y���l�\�\� �\�'�r(6��·A綃�h M�5��s���d@@<����b��D<��e�,��u
8�1�
! ���^cL���r�lR¸��1��Tب��yBJn�R�G���z��4��Z!���~�N=b��c+�b����"@��>�,�L
ZY�DE�O��~��
g�M�4��|�؀Jl�t������T��̓0���4��&h�_�����lw<ϓ���?;
���
ɓ�����s��ߤY��Ux���(yI�
-4�g[9�{����ؗH���f���/�"���U�t>��C�W"8R�[���3yˑ�� M�j<�
����a��$7Jȟ
��6�����/��䫖@qˆ�����s��!Z�U��~���
p�' o-� l�E���&�"�?��'����b(��@���Ā� ��\`;n�JQuG{ī�al����ihr u���Ō'~\���L�p_'� �v����0�t
��'
<J�.σ�D(�{��F�~x%�@\XC-G?$��óq[{
ۀBv��z�`w�g��r��$-�l$��항�l�� a��k�a������YX��霫�#s��m�
��=�w�E])`�P5
��K��C3IҌ�oƪ�8���gR�D�Ȯ'2���� ��5�]� (w�
�� ���4˫�]���ND�;
�s6�t�6UG���g�n:�_�Y��a�/��:-�L
��ɻG��*3H��O��p<$	��+�Y�7�e��失~7���B�MK
%�gQ���I�~��Yr7(/�D���̗�~.O�F�I�E
S�A�ΖO��Vt�����L[�����{�E��-A�׭�G��\vb^���.������O���5���fsv�Qǖ@v*c���(�9��y=6�z:/Y��'-ޖ0<���f����T�fѢ�9�v��!(rJ�;{���=�{�N�|���7�xmO�2�P�؀����j�ޓ�����r�e�����y�����	��hc�����
�m���
X*l&j���A�c�����y��%J�2m��O械\�s'��bB"��%���K^%U�W����Eh=r�ڏ�e�yS�~�7�Or�L@�/��+���Ȗo\�
����"M
ƪB�[�"�8�bB�yہ "ư��V?Vˁ�YL��� x�:�o!�

-endstream
-endobj
-5488 0 obj <<
-/Type /Page
-/Contents 5489 0 R
-/Resources 5487 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5511 0 R
-/Annots [ 5426 0 R 5427 0 R 5428 0 R 5429 0 R 5459 0 R 5460 0 R 5461 0 R 5462 0 R 5463 0 R 5464 0 R 5465 0 R 5466 0 R 5467 0 R 5468 0 R 5469 0 R 5470 0 R 5471 0 R 5472 0 R 5473 0 R 5474 0 R 5475 0 R 5476 0 R 5477 0 R 5478 0 R 5479 0 R 5480 0 R 5486 0 R ]
->> endobj
-5426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 707.957 199.475 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a8abdf2e292960e1fb216ce3c2c0816ff) >>
->> endobj
-5427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 681.868 199.475 692.771]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af9d7eaecf113e25020c55ed0bf79eb03) >>
->> endobj
-5428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 655.778 199.475 666.682]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afad3fbdebb1ba319083c56fa2ae679e6) >>
->> endobj
-5429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 629.688 199.475 640.592]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a79f64d099a652834da74cc8fd68f2452) >>
->> endobj
-5459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 603.599 199.475 614.503]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a164f8732d5fe6b526a34e168145a95ad) >>
->> endobj
-5460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 577.509 199.475 588.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a98dae78cdd16f7127a4b3e18c3976562) >>
->> endobj
-5461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 551.42 199.475 562.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af9daca45c3c1d0d1afd57ab47c6cacd4) >>
->> endobj
-5462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 525.33 199.475 536.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af0647cd431d30a9658d4bdc77e32d9e4) >>
->> endobj
-5463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 499.241 199.475 510.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab19be1f26efb21370e8460b325a7f57c) >>
->> endobj
-5464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 473.151 199.475 484.055]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a65b1cc4ac0c0c8a2efcbf3d36d4ac0ac) >>
->> endobj
-5465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 447.061 199.475 457.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6afe848ad84ff68d48142caf0599760a) >>
->> endobj
-5466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 420.972 199.475 431.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a91459c49e4f7d7fc2dea0347e0489ce5) >>
->> endobj
-5467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 382.927 199.475 393.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4bffbfaa7f512a0a886493a1a057b135) >>
->> endobj
-5468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 307.769 168.86 318.673]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a00f887bfb5c61faba29a67def563c786) >>
->> endobj
-5469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.914 282.053 187.002 292.583]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a268aa30d717cdc7d07e60cf7c56712e6) >>
->> endobj
-5470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.436 255.963 210.524 266.494]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a627ac77a4752fde3c10792ee9f1673a4) >>
->> endobj
-5471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 192.387 199.475 203.291]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 192.387 251.021 203.291]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab45faf2ccad8057c7b27e0c999eb063b) >>
->> endobj
-5473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.359 192.387 352.739 203.291]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 154.342 199.475 165.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 154.342 251.021 165.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae14ac67511e816b1a2f336a54695cddb) >>
->> endobj
-5476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 116.297 199.475 127.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 116.297 256.64 127.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a257a415453078f71a54d6d0b3b57ff4d) >>
->> endobj
-5478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.977 116.297 358.358 127.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 90.208 199.475 101.112]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 90.208 256.64 101.112]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a8772f767006f16e376d8eca9b1578b73) >>
->> endobj
-5486 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5490 0 obj <<
-/D [5488 0 R /XYZ 89 770.89 null]
->> endobj
-5491 0 obj <<
-/D [5488 0 R /XYZ 90 721.073 null]
->> endobj
-5492 0 obj <<
-/D [5488 0 R /XYZ 90 697.228 null]
->> endobj
-5493 0 obj <<
-/D [5488 0 R /XYZ 90 671.139 null]
->> endobj
-5494 0 obj <<
-/D [5488 0 R /XYZ 90 645.049 null]
->> endobj
-5495 0 obj <<
-/D [5488 0 R /XYZ 90 618.959 null]
->> endobj
-5496 0 obj <<
-/D [5488 0 R /XYZ 90 592.87 null]
->> endobj
-5497 0 obj <<
-/D [5488 0 R /XYZ 90 566.78 null]
->> endobj
-5498 0 obj <<
-/D [5488 0 R /XYZ 90 540.691 null]
->> endobj
-5499 0 obj <<
-/D [5488 0 R /XYZ 90 514.601 null]
->> endobj
-5500 0 obj <<
-/D [5488 0 R /XYZ 90 488.512 null]
->> endobj
-5501 0 obj <<
-/D [5488 0 R /XYZ 90 462.422 null]
->> endobj
-5502 0 obj <<
-/D [5488 0 R /XYZ 90 436.332 null]
->> endobj
-5503 0 obj <<
-/D [5488 0 R /XYZ 90 410.243 null]
->> endobj
-5504 0 obj <<
-/D [5488 0 R /XYZ 90 324.844 null]
->> endobj
-5505 0 obj <<
-/D [5488 0 R /XYZ 90 297.04 null]
->> endobj
-5506 0 obj <<
-/D [5488 0 R /XYZ 90 270.95 null]
->> endobj
-5507 0 obj <<
-/D [5488 0 R /XYZ 90 207.559 null]
->> endobj
-5508 0 obj <<
-/D [5488 0 R /XYZ 90 181.658 null]
->> endobj
-5509 0 obj <<
-/D [5488 0 R /XYZ 90 143.613 null]
->> endobj
-5510 0 obj <<
-/D [5488 0 R /XYZ 90 105.568 null]
->> endobj
-5487 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5544 0 obj <<
-/Length 1089      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�H~�W�*��܇*�U�>R�a{��';���U� ��}�d|��H6Of����{>F at slB��O��
b*�8�f��T�T����<������G�p	��Z*y�{|��?��c�~��n =M�*`@Hs�g_�9ҏ?�%��$Ϥ��ߩyj�k��X��ÊM	���@ �p�1K����(���r�[��l�Dn,�= �2
@��'�Og�4q�d�wt3s}�s�f�:�A'� S���U�,=�H�PfG{�K'�����

^���R ֧�oЉ ����p>8r����um#f���p�{���Z�a
Et�Bq���55�(�u
�%,�.�zױ��t���%6�S8�p���<K�^�bp��.�p	5s��h��[E����VbAlT#954���`:�!�ir^ 	�}���iP�L@��@����bL��`�N����E*=�

U@�\���!T)����1�9MRJ�
ǩ�+?1���(U����|>�vaR
��,!d���\�
ƀ�ĉRmX
,C��^p at e=�
��U#
�z�<��,�;�����y +�C�%�exw�k�9��ʮl]O at 6VJC�d��v���E��w�"��;@ޘ��������*
-'7#�-mhiCKV�
VE
��Z��m"1U���&A��!$
X�@I��Y	AP B����/�o�_�h2�޼L� -�*�:h=��tTz'�����l)���B`���۽��]J���<�� � ~��d;�Ow��'��<>�d	�{����}�����C�����6x{\Ҳ�g���z�J^c�N��f�<��z|{٠M����,��7[D B�����?�Ax���������%-�h	�
-���ůh
�����:��t���oV�Pk�zQ�_��gϽ5v��h^[o��4����_�U� L%��}7 �H�
V���\&{�=�he�����)�߹��@�|�/���*����������������_8S��D�7��$�r� ����w��K��V��)N���(`�8���Y�۽X��?ô��;y)����(��2���a����=��,'�'�{��
-endstream
-endobj
-5543 0 obj <<
-/Type /Page
-/Contents 5544 0 R
-/Resources 5542 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5511 0 R
-/Annots [ 5481 0 R 5482 0 R 5483 0 R 5484 0 R 5485 0 R 5512 0 R 5513 0 R 5514 0 R 5515 0 R 5516 0 R 5517 0 R 5518 0 R 5519 0 R 5520 0 R 5521 0 R 5522 0 R 5523 0 R 5524 0 R 5525 0 R 5526 0 R 5527 0 R 5528 0 R 5529 0 R 5530 0 R 5531 0 R 5532 0 R 5533 0 R 5534 0 R 5535 0 R 5536 0 R 5541 0 R ]
->> endobj
-5481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.945 672.809 231.325 682.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.315 660.136 252.74 671.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_abdf3631e599e5641e1fea94cfd46a3a2) >>
->> endobj
-5483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 622.612 199.475 633.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 622.612 254.14 633.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3dc4a1fb95b9f86f622fbe557265f85d) >>
->> endobj
-5485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.477 622.612 355.858 633.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 597.043 199.475 607.947]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 597.043 254.14 607.947]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a02949da26a3761489d2fb98018010990) >>
->> endobj
-5514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.945 536.326 231.325 546.512]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.315 523.653 250.24 534.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a589cc1d8001fd57ded3f964928e66738) >>
->> endobj
-5516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 486.129 199.475 497.033]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 486.129 256.003 497.033]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6e4e84f9ccaf35d6c56acc6c6c3de53c) >>
->> endobj
-5518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.34 486.129 357.721 497.033]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 460.56 199.475 471.464]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 460.56 256.003 471.464]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7ce6dfd81e04c3eb8d196bf13a96ebe6) >>
->> endobj
-5521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.945 399.843 231.325 410.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.315 387.17 252.103 398.074]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aafe0bdaacef3657f8ed1368c3d1f374a) >>
->> endobj
-5523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 349.646 199.475 360.55]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 349.646 253.791 360.55]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ac8b0427ab092068fffe6c4db194e9602) >>
->> endobj
-5525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.128 349.646 355.509 360.55]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 324.077 199.475 334.981]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 324.077 253.791 334.981]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6a2d561ac8088ed64a0bb51d8fffcd9b) >>
->> endobj
-5528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.945 263.36 231.325 273.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.315 250.687 249.891 261.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0edbf435f928c1702dc879bc4862bbf8) >>
->> endobj
-5530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 213.163 199.475 224.067]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 213.163 259.32 224.067]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab75c0e7d52f4b166574fa66584ce92e4) >>
->> endobj
-5532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.658 213.163 361.038 224.067]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 187.594 199.475 198.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 187.594 259.32 198.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1a79ab4c49d7ae4406b56dc2b3d94463) >>
->> endobj
-5535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.945 126.877 231.325 137.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.315 114.204 255.42 125.108]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3f0416bda0c321489e3eb1fdad315c2c) >>
->> endobj
-5541 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5545 0 obj <<
-/D [5543 0 R /XYZ 89 770.89 null]
->> endobj
-5546 0 obj <<
-/D [5543 0 R /XYZ 90 721.073 null]
->> endobj
-5547 0 obj <<
-/D [5543 0 R /XYZ 90 649.751 null]
->> endobj
-5548 0 obj <<
-/D [5543 0 R /XYZ 90 612.227 null]
->> endobj
-5549 0 obj <<
-/D [5543 0 R /XYZ 90 586.658 null]
->> endobj
-5550 0 obj <<
-/D [5543 0 R /XYZ 90 513.268 null]
->> endobj
-5551 0 obj <<
-/D [5543 0 R /XYZ 90 475.744 null]
->> endobj
-5552 0 obj <<
-/D [5543 0 R /XYZ 90 450.175 null]
->> endobj
-5553 0 obj <<
-/D [5543 0 R /XYZ 90 376.785 null]
->> endobj
-5554 0 obj <<
-/D [5543 0 R /XYZ 90 339.261 null]
->> endobj
-5555 0 obj <<
-/D [5543 0 R /XYZ 90 313.692 null]
->> endobj
-5556 0 obj <<
-/D [5543 0 R /XYZ 90 240.302 null]
->> endobj
-5557 0 obj <<
-/D [5543 0 R /XYZ 90 202.778 null]
->> endobj
-5558 0 obj <<
-/D [5543 0 R /XYZ 90 177.208 null]
->> endobj
-5542 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F93 763 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5586 0 obj <<
-/Length 1282      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�䒓
-����C�8�4uU[=�-�'"�TZ��.����$;�;r��G0�.��v���������Ωb��<I�տ�<l)�!!ῡue�s�cl�
�� ���Pl'��X���ޤA:�vߎ������4�ѩ���sJȂ�(bD��B�/�%#@)��������Ӧ�XP�
���Cģ��_w�};	���w<j��n��з`<qm
�K
-j�������)�"%\)�D����B�G
#��?Š����ĺl����x�/I�0C�`}��ה�B��t�=
Uf\|hYWm>jv�|
�2�;�:����;�y��y�4�

dŠ�s�1˅�H^8�"ɉ�&
1,���R�)[��xP�"
��\�C�m�;�-)YA�=�n��
��	��I 9.h��CG�qd2��n?'���ej;B�"�#PBT�б���~P׆t�E��.�I�C�J]�t�0��m�c �#��D
=O�,����n��
Ҫ'՗�.�.ڷ�R��E$���`�6x��O!Oab�s�^]2�F��y
�B��+EmI�DW�|v�� �u�Y����l���!W)p3A����>n&�?�m(��*W�\��l�޳�?�С��f���?S��
:<{�
6�u.�ݺpb�\Zy���L���-�$ɤA��
�M�B��t��Y�s\���F?��Y�0{ ��k�����u�������:��T��������4
-�i��5�4��>�J
�U����q����{?Y�&G�
���\�-s�xΑ+�~�:�������<% ��SoO呧��Sy9�B�F�٧��T
O�Y�lW/8M��A��!N��
e
��|٣/��>�EJ�
��ȅ���[���qy�a��lN�R<��{-�����I�o)[��Bg�I�������^c���t:�7��"�O�b�B�pUq�k��4
���6��a�6D��Sz���|q��c��;���
������R9C;[)DW��7��눔�8�.�)_��C����!��X��
y�|���
�/qs]�{���}�`!
�����E�
��Ɓ�(07D#Q+��H�3W_|Hp
e}�Q�𸿞\!�K������>���3���aW�S��)�� �dM�0��N��
t��R�N*��bխ��s�`
-
	1Go��w�N�f:�t<B�rﵜn���SUso��
-6J��0��(0���~;S�(0$8�
-	 �k
#L��ň�v�e=���E�z� ���j��F�;
-endstream
-endobj
-5585 0 obj <<
-/Type /Page
-/Contents 5586 0 R
-/Resources 5584 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5511 0 R
-/Annots [ 5537 0 R 5538 0 R 5539 0 R 5540 0 R 5559 0 R 5560 0 R 5561 0 R 5562 0 R 5563 0 R 5564 0 R 5565 0 R 5566 0 R 5567 0 R 5568 0 R 5569 0 R 5570 0 R 5571 0 R 5572 0 R 5573 0 R 5574 0 R 5575 0 R 5576 0 R 5577 0 R 5578 0 R 5579 0 R 5583 0 R ]
->> endobj
-5537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 707.957 199.475 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 707.957 256.64 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3cb9b031ec4e6fd7e53e53da5b0f04a1) >>
->> endobj
-5539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 681.339 199.475 692.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.973 681.339 246.399 692.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ade4a5582f82333f20fd6a8be13ff8d7f) >>
->> endobj
-5559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 654.721 199.475 665.625]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.215 654.721 251.839 665.625]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a06c0a4ba25cbc3d59797bf1c73c49497) >>
->> endobj
-5561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 628.103 199.475 639.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.973 628.103 241.597 639.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0803532e7523865597c394e1371d2b16) >>
->> endobj
-5563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.899 494.501 270.071 505.405]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ade4a2cd219350c0e41006c642f27bbd1) >>
->> endobj
-5564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.899 444.969 270.649 455.873]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae0c5fe9f35e5e632c14c559b3f8b4723) >>
->> endobj
-5565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.899 395.437 262.898 406.341]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1e526c2cec217592b49a1636bd5f497d) >>
->> endobj
-5566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.705 345.905 244.078 356.808]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a91dd10f097f76e4ffba7e5760368a526) >>
->> endobj
-5567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.899 296.372 240.034 307.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ade1c60421ba77dae4f75a2bf42e8511d) >>
->> endobj
-5568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.76 234.885 173.217 245.789]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.649 234.885 245.164 245.789]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_abe7d7a2cba56d2668ac3306afeb98e38) >>
->> endobj
-5570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.539 234.885 407.096 245.789]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.76 173.398 173.217 184.302]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.649 173.398 241.847 184.302]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4ab8f30000aaa8dd4ee1d92dc1afc37e) >>
->> endobj
-5573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.222 173.398 403.778 184.302]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.76 123.865 173.217 134.769]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.649 123.865 241.847 134.769]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a749193ffeb01c2c18a87d7f2965d5dc5) >>
->> endobj
-5576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.009 123.865 396.565 134.769]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.76 74.333 173.217 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.649 74.333 241.847 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa0952cbf70240edacf4abd0f460f98c0) >>
->> endobj
-5579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.488 74.333 373.044 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5583 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5587 0 obj <<
-/D [5585 0 R /XYZ 89 770.89 null]
->> endobj
-5588 0 obj <<
-/D [5585 0 R /XYZ 90 721.073 null]
->> endobj
-5589 0 obj <<
-/D [5585 0 R /XYZ 90 696.964 null]
->> endobj
-5590 0 obj <<
-/D [5585 0 R /XYZ 90 670.346 null]
->> endobj
-5591 0 obj <<
-/D [5585 0 R /XYZ 90 643.728 null]
->> endobj
-5592 0 obj <<
-/D [5585 0 R /XYZ 90 577.354 null]
->> endobj
-5584 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F39 2320 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5648 0 obj <<
-/Length 1681      
-/Filter /FlateDecode
->>
-stream
-x��[�s�8��S抢oY�N�m:�]�^�=�
�!�4؜m�����mbL�H M� KZ�v�ծ,�5�����Ǡ������TZ�sKcKq���_g֗.�i���Ť���0*y��������Ĵu�:�v4a��R�5�t�|��<�`aĴm]%�&�
>/����
�邫:I\щ`�8�-E"$U�+�"�<��QH+L�q�smcw2�tb�
�?d�ҏ*Ĺ�w|���I�Hت�t3u}g���T�� �x�~��>�ިGD��aV�4����\s�0�0L܇Ek!Ҟ?zw�,[��w8�
��c}I���zw�i�>Y�W,��������
�f�S7��1���b#��m�U]�h�a�S<7ּyj�`��6����]�h7�j��L�����)Z*� \K��0��b
�"6����+g�j�Jw*7��.5�
-IZ��ʋ/���UH�i�"+��ns��ul���y���$xnG�ŵ��ڡ
:F��!D�u.g�"ҧ�7Hb
-e?��E-#J)x��S,��B�I�J��(�6�}?�� €o-2 �_@
���&�$o����

�����ع
fc=xz�уE,�8�Rm
p�o��&�������5�]�n�ov��l��%
�V�s���Άj�A*g�[�A������sz�ߟ7X׻.���hx�Ğ�+���Oᰂ��94��Z��r����"%��T"�����}I�t�F�˸
�B�|Ѧ�B����A��
&u����p13{��L
d�ḍ
'L�P[1�H��^_1f
�r��"YVP
3�����7^��g^ؔQP��d��#�jAUQ�.퇉��WT�+�����W���;pӴ��I���3�%��e�������Zv�$��=�|�
����a0i�i�M8oM.l��ҏ;�*W_��90t�	
�����*����
�9G�$˲&�J���v���N3�&�J��U���(m�iä�H���{R`ēU?r
�& �Վ�>1e�"9������S�-����9�l�����<$9oW0��������s_�ԺD
4dP#��:U1d+�����2̋�%��H�QܭB�RޡB�
I�6V�sʺ�,���y�sJ�G���Aš��^c��`�K�c�<
�	��J�&څl�
����x*'N6d�<���$}E��
t֫�S��"�
��QݛwxT��
��H�� �e��`���m\%�$�*c�&�	��0a���@��R�>��'�7yB�R���
�<���5	m�m��^�U�D�ҝ$�6�����MaO-ux�F�^����yB�.�]�Ԕ@�ϙ�n^Z;q^��k�;q�vq�v�89
�����T���k�T��g���~4uG��Y�<�_QkXb	O���Rbo�����<�<�n
�/�����Y�N���؍g!�75�E��ĺY�T@�� ��:ݶ��N*�	F��ԃ�6�x�\�/����u}�2�x�.
��3͞��%�Sd�������m}�M
�1V
g5d
���b=����FR�(��k*�BB'������.JѤ��=i��d��O��& a��>����T�lN�d>i
-�܌�?��~�'r��zBt3�t�Y
�
��j=��
��A�A@���͙����P�O�e��>�#Q&�q<=��?��#��Q�
�
���&���9TJ)���Nz8	z�r��ǡ]
-endstream
-endobj
-5647 0 obj <<
-/Type /Page
-/Contents 5648 0 R
-/Resources 5646 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5511 0 R
-/Annots [ 5580 0 R 5581 0 R 5582 0 R 5602 0 R 5603 0 R 5604 0 R 5605 0 R 5606 0 R 5607 0 R 5608 0 R 5609 0 R 5610 0 R 5611 0 R 5612 0 R 5613 0 R 5614 0 R 5615 0 R 5616 0 R 5617 0 R 5618 0 R 5619 0 R 5620 0 R 5621 0 R 5622 0 R 5623 0 R 5624 0 R 5625 0 R 5626 0 R 5627 0 R 5628 0 R 5629 0 R 5630 0 R 5631 0 R 5632 0 R 5633 0 R 5634 0 R 5635 0 R 5636 0 R 5637 0 R 5638 0 R 5639 0 R 5640 0 R 5641 0 R 5645 0 R ]
->> endobj
-5580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 696.002 156.281 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aefab59adcb013d5714004cd6b196483e) >>
->> endobj
-5581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 696.002 234.477 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.814 696.002 383.195 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.251 655.911 199.339 666.815]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1c255ab3c82434e261f010d0590810c0) >>
->> endobj
-5603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.676 655.911 301.057 666.815]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [132.73 630.885 175.818 641.789]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3f13c2c23ad04a1ca900396fc27d0150) >>
->> endobj
-5605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.633 630.885 254.014 641.789]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 605.858 191.718 616.762]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-5607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 605.858 288.852 616.762]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a04f1fafc7f28579ed19eea062a2b13c0) >>
->> endobj
-5608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.19 605.858 390.57 616.762]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 580.832 191.718 591.736]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-5610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 580.832 303.079 591.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a249c56a7ba2a6ad434338028cbdd00fc) >>
->> endobj
-5611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.416 580.832 404.797 591.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.76 531.895 173.217 542.799]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.649 531.895 241.847 542.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a749193ffeb01c2c18a87d7f2965d5dc5) >>
->> endobj
-5614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.009 531.895 396.565 542.799]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 506.868 188.291 517.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.914 506.868 285.72 517.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1ccbc462776ddeb1052d4c4fb35da65a) >>
->> endobj
-5617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.058 506.868 387.438 517.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 481.842 188.291 492.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.914 481.842 283.22 492.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a610ebadc0a8c71ad8575ea198e800655) >>
->> endobj
-5620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.557 481.842 384.938 492.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.705 432.905 207.536 443.809]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af1faacdc4d1bd9cc6efa3df48b9ab40d) >>
->> endobj
-5622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.754 372.012 257.902 382.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af3c2c2bca173e0697358e9c76afd4a60) >>
->> endobj
-5623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.909 323.076 175.366 333.979]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.236 323.076 239.693 333.979]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae4cfb147e2773008ad585185d07e1b79) >>
->> endobj
-5625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 311.12 173.467 322.024]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 286.094 226.034 296.998]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a5371b59fd606148bacb3cd9ec41c5306) >>
->> endobj
-5627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.157 286.094 400.538 296.998]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.76 237.157 173.217 248.061]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.649 237.157 229.125 248.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a262ceb2e6dc438920274528c8d324344) >>
->> endobj
-5630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.594 237.157 387.15 248.061]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.137 212.13 223.822 223.034]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a93329bd6701b72b26d8336d090f04c86) >>
->> endobj
-5632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296 212.13 370.381 223.034]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 187.104 156.281 198.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aefab59adcb013d5714004cd6b196483e) >>
->> endobj
-5634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 187.104 234.477 198.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.814 187.104 383.195 198.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 125.164 202.902 136.068]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-5637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 125.164 300.037 136.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a04f1fafc7f28579ed19eea062a2b13c0) >>
->> endobj
-5638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.374 125.164 401.755 136.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 89.178 202.902 100.082]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-5640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 89.178 314.263 100.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a249c56a7ba2a6ad434338028cbdd00fc) >>
->> endobj
-5641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.601 89.178 415.981 100.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5645 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5649 0 obj <<
-/D [5647 0 R /XYZ 89 770.89 null]
->> endobj
-5646 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5712 0 obj <<
-/Length 1756      
-/Filter /FlateDecode
->>
-stream
-x��[ے�F}�+��J����ƕr��ĩ8N���O�kK
2K�� ���ӣ
H\4��]��QOwO�szt�^ߣ��_.ZgO5�
1�)��g���!Rᯞ��J��;@)���@�0
���mF�d8��zix�|p������'�Q��
�.�����������S��
�3�A���?�CjN�L�.�Z�?�;LZ�y����0�<���a8
�f/چ���fN��ȋ�
:��]<�$�!��d뷋և��A�.It�uG��o�����<J�	���A#O0��C�e��-2����@<�ƙ��8
L�G�d�����&J�I��3�J[gO��DH��a,7�1�z�&FS�gD���ӤLL�On*�&B����YRDjniv��(*��}+[��ܮq�?[3�1���:���H�Ų�XIB8'4��������[IK��4n��[/0n�V�RD��
dzLjjŜ��c��u6�*i7�Ǔ
��a�%%��+�v�PK0�l��'
j�.<6
k�(%�� ��[
�B��W1RW���pZ�M��Ϧ�
 >i�����s���Ƙՠ��p��S7����F�;!
5G�H
��6Cm+\}�z�A����Pʓ$��^gЏ7U�F;��"�_�Xo�
-`�p	�Z}���(�IR:D+'�G�Z����Y�D�9n�a����g�D��
b�CA�~��a~�c8��'��~vv�u�>]��:�,]h�������8І9a,��ᦶ����|�>ᆫ�u#܀0�҄YG��
��n5�>Y��
�g'�1F۴I�*1v(T�w̶��7p��Xf'b9��w���h"ΰy��
�� ���x�� �3v���@�K��$�	][ɶ�M��fߚ�
əCϔ�+z�~�����l�X�L�3N�6�k�"����x4��<"
*
�hd���H:��GS�H���u!0�[*
-x75^$Ӹ����$J�Q��,�Q�&�{�U�eYN��U����3�'�iyw(�&��?w.��
>�$"�M#z��{E����.�����H3z�+�C�+���
-�Ļ��*!���DEi�w��
-A����
�m!}�iQo��EL�(	;���8Kj��p��ۀk
��ɸDP�p2H��ZWHD�y�o�HG�b7̨q�X�)J�N�6].
��w�ܭ�8�-v�J*�{��UL7�1�Օd}�8%�n���o
M�pe��7�$ 8�
ު�;)��%/(o(y��~K^�\[6�zm�:�R
-01�J��P0��ywC�ke�!���x��p
�4Qc�M��4QB֓��[m�1S퇽��h�����+G(A�qm�zo
q]�a�;d�b8�r��
3N�+Ib(wƨw���%%ʈ�:o���J����g<�a��o౹��w:
-�KǽH�Ξ@{�0�Q��?�EF��*�V�<��y�uV1?���?1���c;:揧WMt
-{n��2v=�R��9ՠ�.:���T��N:ʼnw�@?@�9��c����i�D�w������Ml���u��\��pQ)&k�����3*e�;�E�N���pƨVc�=�XP(��;[L=_�j�Ϋ�>��-\�[���r#o˗r��oU���'4�8>��������W�(��-�_��_a<-ݲ��h�����Z6ҕ��XU���(*�ϝ~�������u)�\���dr����j�Gq�t��*�U�@n��z�w�GI�����r
3Y�QR��
+3���ТȺZ�lD�{�gybq���~M0�������:
-endstream
-endobj
-5711 0 obj <<
-/Type /Page
-/Contents 5712 0 R
-/Resources 5710 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5511 0 R
-/Annots [ 5642 0 R 5643 0 R 5644 0 R 5663 0 R 5664 0 R 5665 0 R 5666 0 R 5667 0 R 5668 0 R 5669 0 R 5670 0 R 5671 0 R 5672 0 R 5673 0 R 5674 0 R 5675 0 R 5676 0 R 5677 0 R 5678 0 R 5679 0 R 5680 0 R 5681 0 R 5682 0 R 5683 0 R 5684 0 R 5685 0 R 5686 0 R 5687 0 R 5688 0 R 5689 0 R 5690 0 R 5691 0 R 5692 0 R 5693 0 R 5694 0 R 5695 0 R 5696 0 R 5697 0 R 5698 0 R 5699 0 R 5700 0 R 5701 0 R 5702 0 R 5709 0 R ]
->> endobj
-5642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 673.782 199.475 684.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.098 673.782 296.905 684.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1ccbc462776ddeb1052d4c4fb35da65a) >>
->> endobj
-5644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.242 673.782 398.623 684.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 637.796 199.475 648.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.098 637.796 294.404 648.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a610ebadc0a8c71ad8575ea198e800655) >>
->> endobj
-5665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.742 637.796 396.122 648.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 601.81 195.799 612.714]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa5caf9c1465a76332b9b809a1bf9f9a2) >>
->> endobj
-5667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.615 601.81 273.995 612.714]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.134 565.823 196.833 576.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1b71d709b44273380a21cd197d3ebb85) >>
->> endobj
-5669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.684 565.823 276.064 576.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.387 565.823 454.768 576.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 517.882 191.365 528.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a74af0786f5787a7f7db0a2b6232e56a9) >>
->> endobj
-5672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.181 517.882 269.562 528.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.528 481.896 192.794 492.8]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7e4efb96f10ef03b316495c90ae4313d) >>
->> endobj
-5674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.038 481.896 272.419 492.8]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.205 481.896 453.586 492.8]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 433.954 197.453 444.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7c68cdeac59035fabf1603a87f313f66) >>
->> endobj
-5677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.268 433.954 275.649 444.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.987 397.968 198.34 408.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aceae8deb3688022d007eec835d772695) >>
->> endobj
-5679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.043 397.968 277.424 408.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.828 397.968 455.209 408.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 350.027 191.216 360.931]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afc3e3bc6e3d2c5b002d930b32b9631bd) >>
->> endobj
-5682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.032 350.027 269.413 360.931]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.541 314.04 192.658 324.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7148f41de04826e832fe479a0e859f46) >>
->> endobj
-5684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.916 314.04 272.296 324.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.165 314.04 453.546 324.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 266.099 190.26 277.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a5d0001ad77e62cf77498a9504d793c61) >>
->> endobj
-5687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.075 266.099 268.456 277.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.626 230.113 191.787 241.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afb84ec3fc2c8fedbb685c29bbdc7f3a8) >>
->> endobj
-5689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.129 230.113 271.51 241.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.91 230.113 453.291 241.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.668 182.171 212.417 193.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa03c7854d954ddbffa13a2aca58f22d0) >>
->> endobj
-5692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.801 182.171 291.182 193.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.593 182.171 466.974 193.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.922 170.216 250.302 181.12]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.722 134.23 211.923 145.134]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a5dee740c35d52d07415f0ba91e15b648) >>
->> endobj
-5696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.36 134.23 290.741 145.134]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.486 134.23 466.867 145.134]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.922 122.275 250.302 133.179]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.015 86.288 191.281 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0a674e95cda0698184161e3e009aa570) >>
->> endobj
-5700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.013 86.288 269.393 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.762 86.288 441.143 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 74.333 222.997 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5709 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5713 0 obj <<
-/D [5711 0 R /XYZ 89 770.89 null]
->> endobj
-5710 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5752 0 obj <<
-/Length 2010      
-/Filter /FlateDecode
->>
-stream
-x��[[s�F~�W�/.L�z�Lә^�NzI҄>%���I �H�v~}��.���Cw���Z�=����}g�7���k�Q���b�AFR��{{�$$�ͼ�}�����7�I����V���ϟ�
?���z�G��
�G�#��������؛�ǿy1���F+�S��ޫ�_=����?��0O�o�[�Lj¥"�8�c.��p0�����s��\z�i�s�o��
-IJ�х��oL��I�Q��4X��ur=[\/�`�����%�"�yf���g�5��g�f�&w�S���Ξ�xD�
�?��4�CJ0R�xC��K^yC��K!�0�oi�en?�W�K�I�3�vT!�M����EŒD�����_OVi�Gɿ�@V����逈,��^�AX�9�!�5a
a�� #D��z at a��4r;u7�t����
2����̷=�D�I<�*�J��7���|�O?�����ꝿ�I6L��Y"$dQ�g�Ԅ J�i5(n�f
�MT�2,
�E[�b�,kqv�%7�
�!�QgX�na��
-òQ��ՉrX�`���ქG�n�T:�ㆷ�Y1|Y�0L�`
 �8����(dG	��1����-�aLkC�)�I�<%=wE�+G
-��"�C��
&
(�}�!G
�+
1T
-a
��E�r'���)y;w
-�Ý`l�;�:�NxZp'�4s'g��;K=7s�Н����Џ��z^��~,���(^E
Vr�
��t�H��b��4�
��2^�i{�5�9�X���~�،jl	j�t���D�6%6oJw1�Z��
�%<���
1�W�k�"�
-���tՠX�ӣ*�)�
	ާp�

��E���V��U���P�c���ŸGy	yY��xU����yy�r��?���@�øN���0| ��J�	�Dw�.����F\m���r��X �ս*1CR�k��Hl�Z��&e�e�
-s\Е���а*Y!%

�^��Ǫdlte��� ��g����
���:�
(�7`�m�v��Yr�X� �΃�PŐ�����8u=Yn�E)U�
�k�*U4�D�� ��$m#�$ ��6�<F)Y��Q�J$n��\�8I�T�(
���.'����:!�6P�
��_;Q��#�T>
Z���|E��.�2�Z%�	h�R�~-��
!haЊ�Z��5dj�}X2�u�ea�B5��	�:��b�4�L�qP
�m��K�bo�iGs_h�.X�U��
-�ܰ�
Kĩ��a,�0c�=�Q��%k|���hM/���Ok�F�m+�*%��n��a�
 �i[�?
-�����SĊC��X�
����T�I�c�+�q
O�M�$v���
U6�5��������v4;
�j��6�����յ��q
VJ��
�M�a�v
pU
DŽ�)s!���P���!��8d�@�]Ug�]��R�b_jo�s«�$9�J�7.�A�a��H��X�2Q��ΐh�%,�PK/�/}@ ��2q�����D�&͎Ŷ�R���d�3�|�]O�{anhe�ѽ�$-�5�uXEJ��P9�JT���z�n�
V.����-:���g0R�ҵ��?ߌK˸�Ðp���u
�1c(�q��,ч���q=g���!
��m����
$R�@j<�|޷�:d	���
��)奦�b|�PcM �Di���%�����
��0�w��R���5�.�5� IEH�ł��"H��ѣ�]�d�+a�
-�$�Z^�d@�<�LeC�|G�?rY.��A�]Y��!�%+�S�}T�'�>At7�s  �#�� �]q�o�{C��4���U)��JyZ�'�tNn�$�p��k
�8~Y��I;�P�����vZ��3��ߗI�e]_Vz�+$L�ô�
F���t
?��I?8�b�/+�
�ް0�ZMV
4A
���I�:�U|�������|k�
����9Yo��;��d�m��p�ui�X��g��1w�w�Y(*�
�E� Qt�����v
��9��}�+m^�U>/�g?|[�|�>\���hw���5D�
-endstream
-endobj
-5751 0 obj <<
-/Type /Page
-/Contents 5752 0 R
-/Resources 5750 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5511 0 R
-/Annots [ 5703 0 R 5704 0 R 5705 0 R 5706 0 R 5707 0 R 5708 0 R 5754 0 R 5727 0 R 5728 0 R 5729 0 R 5730 0 R 5731 0 R 5732 0 R 5733 0 R 5734 0 R 5735 0 R 5736 0 R 5737 0 R 5738 0 R 5739 0 R 5740 0 R 5741 0 R 5742 0 R 5743 0 R 5744 0 R 5745 0 R 5746 0 R 5747 0 R 5749 0 R ]
->> endobj
-5703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.074 685.549 204.365 696.453]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a53e464cc638472234a399bfcc3fb4fd9) >>
->> endobj
-5704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.155 685.549 283.535 696.453]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.986 685.549 437.367 696.453]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 673.594 199.475 684.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.238 673.594 370.619 684.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.945 673.594 513.996 684.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 661.638 159.735 672.542]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.968 626.784 191.792 637.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7f00bb47581722220814a6a59803e255) >>
->> endobj
-5728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.476 626.784 269.856 637.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.951 626.784 441.332 637.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 614.829 222.997 625.733]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.197 579.975 216.778 590.879]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a5dcbfe8e54c7b465495bc71274c62a98) >>
->> endobj
-5732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.691 579.975 295.071 590.879]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.536 579.975 467.917 590.879]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.491 533.166 214.054 544.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab2c74f72a54a0b6a18906c124de256a9) >>
->> endobj
-5735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.261 533.166 292.642 544.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.947 533.166 467.328 544.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.33 486.357 215.546 497.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7c476dda1d63f9a52caece85a3a905d1) >>
->> endobj
-5738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.592 486.357 293.972 497.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.27 486.357 467.65 497.261]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.922 474.402 250.302 485.305]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.479 439.547 193.302 450.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab65c6e56b8c876fadd996e950403e318) >>
->> endobj
-5742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.497 439.547 272.878 450.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.354 439.547 453.735 450.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.4 297.957 259.826 308.86]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a5a4741faa2f2e8ebf45ed4e3cc044fe6) >>
->> endobj
-5745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.63 227.237 265.202 238.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7341b0f373b6f29aabb059318c838dd0) >>
->> endobj
-5746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.4 145.053 257.524 155.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a26483f6bea8469aa377bf4a8fa77f64d) >>
->> endobj
-5747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.63 74.333 282.915 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a339b5de27c5e23c9ac925b0a7f5bedcd) >>
->> endobj
-5749 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5753 0 obj <<
-/D [5751 0 R /XYZ 89 770.89 null]
->> endobj
-5750 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F68 3032 0 R /F67 3037 0 R /F66 3179 0 R /F119 3070 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5776 0 obj <<
-/Length 1053      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W��3�
- 4nMc�7u��d8�LKJHѦ���IP"
Jʣyh��A4	����KMF��oC�&R�hx�F�W����]�a^�`��+�`7��(��(v�d5�o�(����(_
O���]1(�	_<��8��
���ih��#R�/�VCZFh�ԯ
=�?{=�

J���C0S@����O�$Z,*�COQ7N�hWw^Ʒ�x��|�o	N]�B��t��;DK��Tpq�����n��gS��
�"�2���W�_6��fnI$=Cڿ��הV��i�
	JbR�	�A�ز�����8*���#�[��@�%���y�L���5�x�v�S��( -_{�r��
��j��y4J���#ȸ=�Che�v�b���3�r��G���a#Q;t(���m*40
-!ZW{�בƢ��`�5J

�''��B
��h��.$H�w
���
k�w��c�/?5�[Q�<�ˡ�
D% ؤ�۷
�8p����Q_�bl_^�{C�/��"`[�J��
eYҡ�s`�~�~*X1�z|y��RSv��2�Zx , ���}��E�F|�h�l�X����_�h�5�V-avULs���JD	,�
�@Y�q�{L��&���4�WW���?D�y�yk
�.� ���!�7bI�fP���P�.v18��`�P����\3�˪
�<�*��)	L���@�0�@���l�vx�ڶ_�E�:��-�ߢ}Afi�����w��ʪ�V=�}I�/I�Ճ	ۃ
uvz(;f�q���n��U��?@������d�:��:����>���N�}�]���,�����hw���,퐩q����
P���6޷OG����+�

-
-���=xX4ܬZ��e>�
�&.WW���ߋ8����5���|��^dgM��ef� ��O7?�}��_��WϋS��a
-����<].����a���WH����,ט��;
-i��fs}3����P�q�X���5�{&���_�|XO47�)C�g����� ��?�
-endstream
-endobj
-5775 0 obj <<
-/Type /Page
-/Contents 5776 0 R
-/Resources 5774 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5778 0 R
-/Annots [ 5748 0 R 5765 0 R 5766 0 R 5767 0 R 5768 0 R 5769 0 R 5770 0 R 5771 0 R 5773 0 R ]
->> endobj
-5748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.4 636.226 261.956 647.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6b608bb6b2030aafbc57964f63f9a6de) >>
->> endobj
-5765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.63 565.823 311.119 576.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aaf7ee24b1de8cacef61bc37c4d280bd6) >>
->> endobj
-5766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.4 483.798 256.337 494.702]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4b2839dbccb2736dccbb58b0e589b5e3) >>
->> endobj
-5767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.63 413.395 293.415 424.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa49993578916331f71d60ff1b9a3951d) >>
->> endobj
-5768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.4 331.369 261.956 342.273]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa27860086ead05da8ac152dbd2d6fabe) >>
->> endobj
-5769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.63 260.967 298.407 271.871]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7a8a423b9e5236053b363400e7789fad) >>
->> endobj
-5770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.4 178.941 256.337 189.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a45a8595dfc15e72d28fd31b5f4561bdd) >>
->> endobj
-5771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.63 108.538 280.703 119.442]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0673c1c20598ea950f352d2d5ea2689c) >>
->> endobj
-5773 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5777 0 obj <<
-/D [5775 0 R /XYZ 89 770.89 null]
->> endobj
-5657 0 obj <<
-/D [5775 0 R /XYZ 90 112.523 null]
->> endobj
-5774 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F24 529 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5803 0 obj <<
-/Length 2029      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ�+�zo�B�m�"i����-�%"�����w��)J>�M�'r��3�s|3��
�~�4
����
Q(��W^�=��HHͽC�ѧ�+�� �P�.����7�o������t�e@`
-{����z��������
�Y��8e�\y��pS��*�����'���h�UOFc*�0N
--��,��r�IJq��-�>���
&�b�Q�4����/�a�/��
-�>���$/�8gY��o'�`�����ӳ�y�"�e�ę�	G�o%z��m��N𠱚aDXe��c�H6��H�\C�O�$�Oz(p�V.�=$
-j�Y	�%�-s�Q�<NVib�_��X���;\kp
�J�M��{j��z��H��G��RKԈ��"*�k5"x���O���a�X:q6i
wf#�U�Q3=�ڍ���t
qLAR��)X?pf�T�o�Q�c�7����|�ZoVQ��Y�XG}�k
?��^�yWޤ� �֪�eb_����iSB$peǢoLF�ק&(®|�D�+u��'�q{��
���Xuؗ�������Cuq�]��T���Zj��#d�|=�:��*h�
>�>�
�9�
����w�TÎw<FD�5l��7��fR���3M�����
 J鰛��B�
#����7q�R�+���3*�^�	C������

�T�5<��L��U�U9i�e�8q՗m��<����V-,�5��I4�
82
-:�ড��L ��Q����P��f�	 �������f[�Ϸ<,��ʢ"��c�M�(A�a�?��
�,�
K�b��P���7O{hH��q�j ��#{p� �0.!���蘽%�$H���:!�Zo�����p���$͋LEP��'i���uX�?N�ܷ��7۵���ř�T��#����
�d,CD;	�]�5hu�<�� z
g{@
�jbE��Vx
��ަ�x�5���B"�c�0�p�	¶1Mb:�S�^}?��ɟ
�7=�+F׭�$ƭ�zT�F�_�]��X��6K����K�t
Ѣ
-��c�Є+-��
-��%S�2����L,�4Z,c
Bȍ�$9qA@s��%LjC�2��I�>9Al|Ȃ9�gq|1�
��{">߯�
$���2#�8�QKc)���Uy�N"W
-7.�&���Zi�����O7�lZ�7�l��6�⤧d+#mڹ��ȋ[��7��
�֡
�]�5%���^i���ۿQ��T�Q�i-ó{qwt�;Vn�#\���hz���N���q@>&����2MW}E�a���U��Q�ݫR��`�f��;��c�0�[��
�3����E��"�1���"�WJ�@�,���>[��vN* �þPk�
�Xؽ����5�f:����tfގ
��{a��|����|�zWQ���)F�:�o�2��G��&��g)$��j�lK�AHI
)Yb�; �p�T�O�=�\"L;"��/��.�&� Z9�-��%�ک�|I8���jIRgʮ[aH~̭��1���v��\�qԐw�4s
�l4�`�ѵ[�h�)ۭuh���uKc �VIQ�m#�X4 =)��U~��G{�-t���T�w�d�z%s��)
�nP֡�
V��{��Pٕ�hV�^Ƴ��5�9�h�����}
Ca��/��dW�9KՕ>�G��,V���M}FMO��u�@�
�v����Vi��o�������]���b�RĀ#M�e�z�0���ӎq�N�a	3V	pP�/w��S�
-��ni���j�������8	��\Y#�W�
�I
-'<X�V at Q�)��z���OM�:�s0��u�˲4�o�tp_��.���LD�H<s��RO:�j%G7$��k��2�~���]��������l� +L|���滙,���/��{�����k��q�\=dɴ�VS��}m_��U��6�3�oQb���>q&�+�u=��*+ +��J�_u;O4�
��:�,�����r��U�@���Wo�o�noz�*>��6;�kn˔`¿ ��V
-endstream
-endobj
-5802 0 obj <<
-/Type /Page
-/Contents 5803 0 R
-/Resources 5801 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5778 0 R
-/Annots [ 5772 0 R 5787 0 R 5788 0 R 5789 0 R 5790 0 R 5791 0 R 5792 0 R 5793 0 R 5794 0 R 5795 0 R 5796 0 R 5797 0 R 5798 0 R 5799 0 R 5800 0 R ]
->> endobj
-5772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.89 707.957 218.72 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af1faacdc4d1bd9cc6efa3df48b9ab40d) >>
->> endobj
-5787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.939 632.588 269.087 643.492]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af3c2c2bca173e0697358e9c76afd4a60) >>
->> endobj
-5788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.904 516.727 185.36 527.631]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.327 516.727 247.783 527.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae4cfb147e2773008ad585185d07e1b79) >>
->> endobj
-5790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 504.772 184.651 515.676]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.533 481.036 237.219 491.94]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a5371b59fd606148bacb3cd9ec41c5306) >>
->> endobj
-5792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.342 481.036 411.722 491.94]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.884 419.615 257.813 430.519]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af5e8cc3b25cdc1ef3e37bb82a4e8c7c8) >>
->> endobj
-5794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.945 358.194 184.401 369.098]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
->> endobj
-5795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.833 358.194 240.309 369.098]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a262ceb2e6dc438920274528c8d324344) >>
->> endobj
-5796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.778 358.194 398.335 369.098]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-5797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.322 320.683 235.007 331.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a93329bd6701b72b26d8336d090f04c86) >>
->> endobj
-5798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.185 320.683 381.565 331.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-5799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.083 259.262 252.473 270.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae15725ff36519df514dce8b2a52c8f9e) >>
->> endobj
-5800 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5804 0 obj <<
-/D [5802 0 R /XYZ 89 770.89 null]
->> endobj
-5658 0 obj <<
-/D [5802 0 R /XYZ 90 696.499 null]
->> endobj
-5805 0 obj <<
-/D [5802 0 R /XYZ 90 228.536 null]
->> endobj
-5806 0 obj <<
-/D [5802 0 R /XYZ 90 178.094 null]
->> endobj
-5807 0 obj <<
-/D [5802 0 R /XYZ 90 100.603 null]
->> endobj
-5385 0 obj <<
-/D [5802 0 R /XYZ 90 77.486 null]
->> endobj
-5808 0 obj <<
-/D [5802 0 R /XYZ 90 77.486 null]
->> endobj
-5801 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F66 3179 0 R /F110 1507 0 R /F39 2320 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5812 0 obj <<
-/Length 3156      
-/Filter /FlateDecode
->>
-stream
-x��\�r�}�W�I����/����2]r
E��'I��%�%bA/@[�קgfo��@b([��
,ݽ�=���#*FW#l/�`���<=8:Qld��T�N/G�7HH�v1z7&69$���	��i9����P<^��_g������������^g���Qvq��n~����?
���@E�(��|�F�R������'�TX
��|v�
"��?��6���L�K/�tb�8���LW���&��
g�
nIA�D++��Ӄ�H�#��%�ң����<���?���ѣ_\���Sכ�ۃ�
� �� #�?!
�u?��T!X�V�?�RHR�sk [!ś��۬����2
��vn�o��ip:���5���p<��x��o����ʫzHNM��
�0>�F�Da$\	2BxуY��kIxlČ�Y'�s5[
�8�R���np|<�1��_�{���C.��|���u������bZ����z��x{U�e1��ʐ����i�xl�,����Yyq [...]
eH�Fw�ܡb�6b��TP.�  � fK �BU�d�k֓2ϊ
��T��Q\�o2[DU_N��*_�ۋ��n����ՍVh
ܲ�Bj��R�
-
-�u�
���MX�q�/�+��P��d�-� r@�
Wm(k)d�i
-��R�B�" ꀙH��W^^��G��J�
��8��2b�V��R�m�}��W�?G���"�ZF �̄j�SFT�
-E��dm�����?"�.tҶ��
�X�B�?�Zvt0��8�#������$2�$��-_1�PT&A��G2�@`{7 Ǜ~����
-2��4���X�"J�Z�Tb��W�ӈJ)`�Ө�H
�{N@ ?Zs�[��dUQ�����,V�+
t���S$�a-��=Bp����ޕ�>l �u����5��pj��l`E)E�
���b���-l�@m���Ml�B�g�@�l�#@"��� �$UY9�
N�4�(S�D3�V0�.��u=��?���^ ��hB���p�Ќ�v�fz�N� Ja� :��5 at w�����m ��v#@'�YtW� 
 -w h
-i+X�Q
-D9��7qp&HS�D+�KMt��w�P�0g���LM
�A��[��N���v�R���A�%���;����C�$vk�(zfc3s]9�Z������Y��-�N��
t��l�`��ٮ����N��b��~��ήcu�i����$M�rn,$����$5p��� ��#%�[�R<�<��F��ē� CH��e�!�lW��lĤFJӽ�RQ'Jh�/R��!����[��,�=
�v����ˈr�J��!�$"I�,TދQ�B���4�A%
�d��ñ�V�h�� ʒ���G���Ϯ�S��a�J��R� ��)��+�sh�?��U�kpRڼZ�c[�(F�l�T�.�n�T�|��p䞽ծ�2'I�=�c|
P���R)��a,��T�Y
�_��v�^Wi
K9�;S(�� R
-Ԝ�.�*�c���2�Qh��A�H γg�� �o]@wVr��N!�]ĉ����6����S�$�:}"$�е�5m+C�A�Y�T�����TQl����+jR��~y7[����-���(��v�j��G�l�h5ŀ�Ƌ��!���ɧ�{��A��fqW\���ً��n�d�!�.�F�y %{z�]Jѩ��b1[
+��Ƭ(�ٗ�vWDؽ��R��T���e	TVd���L��fTA��U
-6���*P6k�H�،����lf�Nl&��ZJ��j?5��30lZ��Gg�
Rz�{
-�aOg7w�@oeOE�{ʀ=� {Ҷ�
�'E��G����]��OI��<� ����ʌ|�)3�	Y�)��н��4bZ:Q\�}��o�23�M]���p7u�=<ef�)�zmװǙ��)3`*��d<�ә�9ۅ
u{���gQ��m�	�;����axz{ޤ��C`wD
-[d2�3��X�\�bE��G
k�

M�1�m�';�} �����t�ć r� Aoirv39��
m�`Oei�`�|	�
-:��dr�A�5��
��3�n���"�8Պⴚ/�v��
-d��q��v%;�lW�<
-P�c>���yZ��9��I�$"��v��]ؤI�rl�Äj��9(,8S�$�
Y
T�Xo��m�,�
�MAY���
��-����i��s=HSԢ�
#�
�� tiʭ({\�˱� 5Auƅ��R��O�1KCb��۹	Hb��� ����.��%������
'�|�7)0����l����r�g�&��ͫ����C��� �=��Nadlo QL���
b;X����sS��ڋPw
��\pH�4�+�:�-�ݯ���z����C<���9� wz0 k���<]���U
�l�U�QXӀ��K�+���H��6����NQ
���������?G
��w�ꟳ��m���_E_%��x�)rl�V��!�v)��o�@
yB���A
\��K��]^tB�����0����lB���*+�(���Ol
�2��Fr���jE�
�	��)�nI\
�B�=���T�Q��:��ǫ��f^�7����5ɖ�ȣP� h'm��2���7�ӫ͠��ζ���z�#��%�S��ۢ\&�b
�%���a*��O��������Y�������w5U��/�(���p� lC�&�
�Ͳ*D�菣�ӿ��ZS���H�J׫��������2+��̯���<�q����^���05a��s�TcC�G�axg�{O�3�c�\1�����G/�l�b��0բ

-endstream
-endobj
-5811 0 obj <<
-/Type /Page
-/Contents 5812 0 R
-/Resources 5810 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5778 0 R
-/Annots [ 5809 0 R ]
->> endobj
-5809 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5813 0 obj <<
-/D [5811 0 R /XYZ 89 770.89 null]
->> endobj
-5814 0 obj <<
-/D [5811 0 R /XYZ 90 545.857 null]
->> endobj
-5593 0 obj <<
-/D [5811 0 R /XYZ 90 522.274 null]
->> endobj
-5815 0 obj <<
-/D [5811 0 R /XYZ 90 522.274 null]
->> endobj
-5594 0 obj <<
-/D [5811 0 R /XYZ 90 486.299 null]
->> endobj
-5816 0 obj <<
-/D [5811 0 R /XYZ 90 486.299 null]
->> endobj
-5595 0 obj <<
-/D [5811 0 R /XYZ 90 452.236 null]
->> endobj
-5817 0 obj <<
-/D [5811 0 R /XYZ 90 452.236 null]
->> endobj
-5596 0 obj <<
-/D [5811 0 R /XYZ 90 418.173 null]
->> endobj
-5818 0 obj <<
-/D [5811 0 R /XYZ 90 418.173 null]
->> endobj
-5597 0 obj <<
-/D [5811 0 R /XYZ 90 384.11 null]
->> endobj
-5819 0 obj <<
-/D [5811 0 R /XYZ 90 384.11 null]
->> endobj
-5598 0 obj <<
-/D [5811 0 R /XYZ 90 350.048 null]
->> endobj
-5820 0 obj <<
-/D [5811 0 R /XYZ 90 350.048 null]
->> endobj
-5599 0 obj <<
-/D [5811 0 R /XYZ 90 304.03 null]
->> endobj
-5821 0 obj <<
-/D [5811 0 R /XYZ 90 304.03 null]
->> endobj
-5600 0 obj <<
-/D [5811 0 R /XYZ 90 258.012 null]
->> endobj
-5822 0 obj <<
-/D [5811 0 R /XYZ 90 258.012 null]
->> endobj
-5601 0 obj <<
-/D [5811 0 R /XYZ 90 223.885 null]
->> endobj
-5823 0 obj <<
-/D [5811 0 R /XYZ 90 223.885 null]
->> endobj
-5653 0 obj <<
-/D [5811 0 R /XYZ 90 189.822 null]
->> endobj
-5824 0 obj <<
-/D [5811 0 R /XYZ 90 189.822 null]
->> endobj
-5654 0 obj <<
-/D [5811 0 R /XYZ 90 138.14 null]
->> endobj
-5825 0 obj <<
-/D [5811 0 R /XYZ 90 133.657 null]
->> endobj
-5655 0 obj <<
-/D [5811 0 R /XYZ 90 81.969 null]
->> endobj
-5826 0 obj <<
-/D [5811 0 R /XYZ 90 77.486 null]
->> endobj
-5810 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5830 0 obj <<
-/Length 1501      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�V~ׯ੅itt�N�3�$�����ʓ��`	˚H� )��} $H�I��Þ={���vFTX
G�_z8:�����b�AFRi
�,�-�
~��k�h��
�XLjD�����?�q1|y1����^{zna�$R��{�7���7013��'
4�8ep�YW�?{��Y��(zD"d�F�!�u�cl/����]z�+�W0,TSDI}�.Q0���:
�\?x�;��>e�
Fl�H~m����è
̦#G�뒉	�H�l��!�@�:0Y<��{�`��}���za�U��U�)�
:R���9�8�f��
-����� �&��
��$�(�˒����C����F�#W�Lݲ�ު�n�jV����W�	��c���Ŀ%&
�:�
D�l�#
-��(���Ћz|�+����6ۧ� F8�@�c�<��w�5,^`�a�Z$g�n9B�(�Y�܎�xcR� �5\
�L�h�7�$,-�c��fx
���x��<��G�����.��
�
"�~2E�:Q�:��uO����ov�K؉v2I[�s�	�L�V����Pn�qb�
�,�}
��D3K��\�$(2�+���Eb��ؔڄ�],�?�@��
&bܴ���E}��
@C at 4���AG+��,"�x+6�Y%3q��f;�
k���\�HmO< ����� iNBw�\�$�;[y�O?،��
,"��r��e�qͫ�Ȩ
�
pS
-%��
��S�����)����?�`�L ;��ALd9|H]P���.*t�� �#�>@��
U!!��)*�O���s��R����%�,�F���鬌IL�\?R�8^�H1��t�I/��[D}
����*�}&d]�8��0� aѵ0Z������3�j؃#��:I���=���)�+"��ž��v`Ϣȟa߲
���n�r�N
��E
	
-�k>>\wχ�K>d	���Ƭ�|�J+D�,\��2B���f*���� n�*6��
!�
-B��m�<dM�C	y�ٵ��
-V���>'$��z��RĦh��p�i}�c=-��tdrto�l��v��	��B�������
�a�V�L�����s��
��d4��a��2�QUٴ)�#F�ƙ�υW	l;7��X)�R!�튑�*F)y]F�]�m^�">)cU7��)����Q��T�^�aU\U0��Y#N��m(QS0Bi,ύ��r��9F� \N�	
-�rS���)�t�n�1
-����6P�#�rF�Y�<Oy�$��-�Q �
-��

��?S�b��<�u���
���}�G�ʹDZ9�AP�?��0�)���:M;�����t��2
���7R�q��O
���
p�(k���փ\��:n?|��0Q��7����3�
��sf�
���\��s�q���O�@aD[�	��͘$�RR���-9y��¯�o7����Wis:��Lj��p�1A8�{��$���m�6��}����xö�
	�e��r���`p��,<�F�|?I�
$_�̾
6%�<��������?:�s�
-endstream
-endobj
-5829 0 obj <<
-/Type /Page
-/Contents 5830 0 R
-/Resources 5828 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5778 0 R
-/Annots [ 5827 0 R ]
->> endobj
-5827 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5831 0 obj <<
-/D [5829 0 R /XYZ 89 770.89 null]
->> endobj
-5656 0 obj <<
-/D [5829 0 R /XYZ 90 674.891 null]
->> endobj
-5832 0 obj <<
-/D [5829 0 R /XYZ 90 670.407 null]
->> endobj
-5714 0 obj <<
-/D [5829 0 R /XYZ 90 618.72 null]
->> endobj
-5833 0 obj <<
-/D [5829 0 R /XYZ 90 614.237 null]
->> endobj
-5715 0 obj <<
-/D [5829 0 R /XYZ 90 562.55 null]
->> endobj
-5834 0 obj <<
-/D [5829 0 R /XYZ 90 558.067 null]
->> endobj
-5716 0 obj <<
-/D [5829 0 R /XYZ 90 506.38 null]
->> endobj
-5835 0 obj <<
-/D [5829 0 R /XYZ 90 501.897 null]
->> endobj
-5717 0 obj <<
-/D [5829 0 R /XYZ 90 450.21 null]
->> endobj
-5836 0 obj <<
-/D [5829 0 R /XYZ 90 445.726 null]
->> endobj
-5718 0 obj <<
-/D [5829 0 R /XYZ 90 394.039 null]
->> endobj
-5837 0 obj <<
-/D [5829 0 R /XYZ 90 389.556 null]
->> endobj
-5719 0 obj <<
-/D [5829 0 R /XYZ 90 337.869 null]
->> endobj
-5838 0 obj <<
-/D [5829 0 R /XYZ 90 333.386 null]
->> endobj
-5720 0 obj <<
-/D [5829 0 R /XYZ 90 281.699 null]
->> endobj
-5839 0 obj <<
-/D [5829 0 R /XYZ 90 277.216 null]
->> endobj
-5721 0 obj <<
-/D [5829 0 R /XYZ 90 225.529 null]
->> endobj
-5840 0 obj <<
-/D [5829 0 R /XYZ 90 221.045 null]
->> endobj
-5722 0 obj <<
-/D [5829 0 R /XYZ 90 169.358 null]
->> endobj
-5841 0 obj <<
-/D [5829 0 R /XYZ 90 164.875 null]
->> endobj
-5723 0 obj <<
-/D [5829 0 R /XYZ 90 113.188 null]
->> endobj
-5842 0 obj <<
-/D [5829 0 R /XYZ 90 108.705 null]
->> endobj
-5828 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5846 0 obj <<
-/Length 2261      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�6~ׯ�S"UlW�ڤ*�ͤ�MRN�}����%����Dy���i�D
-"iK�qmT~�$����F}��p�n"�.?����^�.^kYbW�����HKK@�Q��(abp�(�����x1��]8��'���h��y|����^}w�
�t%�w�����b��꧋׌mh��4���#�2T�e���@�����A�w<|
�0����M�w�x���^
,�'ӻI�&�/�'�q����R���X'���U�C���
. �D�i��[���faM��i$���$���[�V�!�eT�g���<�D^�AZs{���Y
׊pM�4���]2��n��A�]
΂��]�P�~x�
QFԐ�h�yP�~�~�e>
�����6�B��dXj������wQ����V`�r���@�"�H���N��5�	�
�
[Ax;�Bcx��BI"���q� �R��4”-e=�����z��e��KB�

�m��鄐�M��]��'��`	5P>�v�
-P�
-
�N��"q�u�6����^�V������?��S��뷙�
*�TII��v�ɆH���m��p��'����f�~<Y_����$��LE��5�$�l��խ�IAt1a]�u���ksu6���\���
-�mރ��)�̌Y�:�P�(��Q�F
-�W�=ݝ"
-mH���1
0�&��0� z�����T����n/k%{�
ѶŇl�@�D�1�.��5ٶ�܍��y��\
��\����J{x�6�ョ��u�mŦ
�}�������#
��`��ƈQP��g3�w�"0�
5��Q�Ao��b&�E�2��g�
ʑ"��/�Ȼ���_CBE�+Sv_fC#v��1�
rnS9�A���q�r�
s�ru��،��h�Erob��h��AfSRD12����s4q�����4/��:qۉ�N�֝�����m��m��V-Qq����m�ٻ�j��f8
-����P�1f���� ���'���'�+)O�Rih�Ri�;U���M�XE��6�Mˏ�*y�
F���J��er�T�xE���c��ϊk�o;(m�!X�V�Q�4�}���f��pu�o��t:��Gc�:���|�P�c\!`�T�s��[-��BR0<ֺ�o�S�����ޕK�c�D�e�����R��%��>��a�ܫ� 
���
�?��@I�x{���n�(P��
c�(\
v�����F�K`O,���m�eM����NAՎ"F��������c4��8䜗�9�g���H֢�̮(��<<F��m�L�8o�Yl�ޅ���w�

Sx�!�����c�y��`g�l�����C�B�@�Q�"Y&i:�݄�p�٠_���0(�N�f�\
o���
<����M��v�_�����H
2a_�21�D�� s#�΄}�_
*�0hq�c����лDz™/�QX0/��Kke�[U��0Nw
~8\�
~q�$����S]�TW8����$�C
?]M��ݤ���K���/��@�Q$�(�cvgyޝ�yX�k���nk��s�9����M[F�r��m�:3s����2�]�C
(�
D��P�8*�}��7�����
-�1@���>���ƃ��<Z{�����=���j�*�
�Ґ\W+�D��^����#�'`����ک.S���ej"a#/�fW�K-6R�����e���pU�s������x����D�c���IC����N�!Z�fB�	���C��֍����fO�� �N3��1P fևЌ�cT5{ƐMgz��~fD�2k�/�2̑^8q�g�
��8���۬������\
Z��5-�O�K�=r	�z�S�p2�;�x�MJ��4��b��kNr���(�
-�
3:s��!tb"A����H����H��է�NG=OG=��Ï�•%����S�lU��F�2�Mb�����\�2��9Wi��s��~X��q2K�u���T���$
;n�E��7.+�Z�.�ɶZߓ�f�N��zZ4�lS��'X��]'��{c�~\�"����(�\��Q���bJ�j���<)���i�Q�دhmb��*K���������[��b���9��=t�	XS�����������@���/�lO�ώ%�)%
o;��f�@g�G�6�Q��߽
%?��Ohn��������f��n�p>����zߗv0�/�V�?N��I�Т�(���H �zY`��a�o�sv���⇋�"��
������O�
-endstream
-endobj
-5845 0 obj <<
-/Type /Page
-/Contents 5846 0 R
-/Resources 5844 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5778 0 R
-/Annots [ 5843 0 R ]
->> endobj
-5843 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5847 0 obj <<
-/D [5845 0 R /XYZ 89 770.89 null]
->> endobj
-5724 0 obj <<
-/D [5845 0 R /XYZ 90 674.891 null]
->> endobj
-5848 0 obj <<
-/D [5845 0 R /XYZ 90 670.407 null]
->> endobj
-5725 0 obj <<
-/D [5845 0 R /XYZ 90 606.765 null]
->> endobj
-5849 0 obj <<
-/D [5845 0 R /XYZ 90 602.282 null]
->> endobj
-5726 0 obj <<
-/D [5845 0 R /XYZ 90 538.64 null]
->> endobj
-5850 0 obj <<
-/D [5845 0 R /XYZ 90 534.157 null]
->> endobj
-5755 0 obj <<
-/D [5845 0 R /XYZ 90 470.514 null]
->> endobj
-5851 0 obj <<
-/D [5845 0 R /XYZ 90 466.031 null]
->> endobj
-5756 0 obj <<
-/D [5845 0 R /XYZ 90 390.434 null]
->> endobj
-5852 0 obj <<
-/D [5845 0 R /XYZ 90 385.951 null]
->> endobj
-5757 0 obj <<
-/D [5845 0 R /XYZ 90 322.308 null]
->> endobj
-5853 0 obj <<
-/D [5845 0 R /XYZ 90 317.825 null]
->> endobj
-5758 0 obj <<
-/D [5845 0 R /XYZ 90 266.138 null]
->> endobj
-5854 0 obj <<
-/D [5845 0 R /XYZ 90 261.655 null]
->> endobj
-5759 0 obj <<
-/D [5845 0 R /XYZ 90 209.634 null]
->> endobj
-5855 0 obj <<
-/D [5845 0 R /XYZ 90 205.151 null]
->> endobj
-5760 0 obj <<
-/D [5845 0 R /XYZ 287.777 126.375 null]
->> endobj
-5856 0 obj <<
-/D [5845 0 R /XYZ 90 120.358 null]
->> endobj
-5844 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F119 3070 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5860 0 obj <<
-/Length 2573      
-/Filter /FlateDecode
->>
-stream
-x��\�r�F}�W0/	Y��~q9��M씳�㔹O^W��`Y�D�$�]��� 3 �Pl�"2�Ҹ�i4}�g@	W���?�Q�>�99;j����
L�

������!st�z��@hK��pV���ߞO�<����ΞL�>�1�E������۳W���6�
�����n�
���<���&��A�4#�c!!J� �ƌR:\e�n��̧r��N��0�bΏ�#��i��/���6�9w�I��m��{1|8�����`�,�����7 �uP^
�y��p~}Y�_~\�����ny�D9��DP�VdN�ue��VHM�Iu����լ��?T�"�d�E���@x�]�1:�.�x���M�h(�1D�v�jLFZ��w�ZHb�i��Xh�L
�p�N��ȯc,S0��2��}۔(�����ϖ��qI�r[��v��n�l�
-U���
-��0�Ei���*
 �����t����"�O���|�džt�T'��+N�s�
ej�S���%\���� %%�V�7�8"�l�����]V��Aajx�(߰��i�;����6�ty���Z�PE�)o).<�~�#��f�囵(zv������	+>�0Sn}'ol{p
�t
5�˱�d6}��&kht
Rj����ݭ�	J
TQ+I�����6��
�x�.�x�lH[���%m��m�$������jY����ZI�e	�o�H'��
-�3DS�@������eSO�U-�q�@�����	���5��
}�	Mo>�7 x��
�k��uӰ`
-BA��@�
N١XL�h��������X��k-�оܦ��
�E��*��0{�
�12Dդ��M.�F�kc�)
/����B'G(�`����,�-N~(t��
�P�����gC4E�Pm=�� Th��Jȇr�uMygMm�
���Hz�6���+�7��MH���
�=����t5_|�]���/��T:�|c.�Q?2MKɭ�u��D�G��Ҧz�T�
-�k��	�ś�՗�C�FJ��{t�Γ���5�2���
��a�
F�A�%yw)=
ܠ��6����^��ഞ���Q�
�����.���0p��Kp۴
f�z	&���T�k=Vo[���-�&�H�p��ٞs�f�I�W
�։�a޵ag3�R f��n-_g[����|�f�Y�A�cRO*v�I����(h�ʹ�N�6%��QhBgD�yGڬ��I���6븭���i��y��ɁR$C�M4&YO�D���Y�m���1Kڬc
�E�P�h��8�"A�i�H���iX$_��"a���JM�Dlk� �5����2ðI��ӧ����@1r�G҆
F�!�
�^�v��C�
b/�m{�A�%���s�����z>�a�����
Z/�m�z�Q�%�r��e�X�v�H�j�H��D�)W��l�4?J�H�Z�s��bGW��kS�0l�IB�f
6
-Tw|u����%.�;s
��
�te4M)�]�u�6'�Ҡ��(4
�4�:
M#�
y��w'O#�F���5fd�:�25��:���J;ۓ�p#S�q[�zw̒��G�� '�2�,΃rej]�mkz�LSPh�R����u�%B
�����:�w?-283̚^��΂��D�\L�Ɯ
cOAO
-E���>>���0z#�'����$nГ	n����
z2�<N=��1�d��Ɉ~z7���MO"`F=�`b8?]z�O;9?���ݮR��C�W�m�>��I�
/a
��a�K>o´~i$C�t
Te
-YZN�T���hPn��D;��;�
���;��ݶ\;��y���1�*��|r'!����bʇR��#�jiwJ�(j��J2*��
-Z�
�
-J��+�0p�P��
-��1K�P�<
-�	�8�x�gq
��P�h<m[ӿ��~����8��r���i'�YN(����|��_F+r?�ߢ���=Ъ+���XL��R��A-&�mr3���8��s���(��|(�{����
z1�mӋ�Q/&��R5�g������Զ�J�c	�=B�scI��Uy<�Un

ӊ���³a:M
f�m�
`�"���~,�!B��C{�v�����f���0g�w�!���0|��w��$�.���
|���5f���8�
f5T
e��%�������6�F��|�`
���P����8��A�i�w��)��������E��XX�l������
-%?	1)��
�"&���R��w���;�$n�u�V1���d
�H�$�P^��d>�=דa�F1Y�m��c�b����^�oRwy?F�]��[�f���
ΠU.�����������~¤܍3����P0���TM #m�5�!+���EL!
L�.��ŝUl��
l,)�e��mrd�?4�)n]����p����k'JC��_���(�s�����|g<'l8v+?�!Xn
��U��>�x�{��,�p\z8�x��k�_������e���K� �~��J�B��e���<(-F�/0�8�×Y
-X���L�_gy�k�(I�*�w�ՇG��o>]-������U��ɾ�U/�~���|Q��6�BS�ϚD
���C�̯
-endstream
-endobj
-5859 0 obj <<
-/Type /Page
-/Contents 5860 0 R
-/Resources 5858 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5778 0 R
-/Annots [ 5857 0 R ]
->> endobj
-5857 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5861 0 obj <<
-/D [5859 0 R /XYZ 89 770.89 null]
->> endobj
-5761 0 obj <<
-/D [5859 0 R /XYZ 90 674.891 null]
->> endobj
-5862 0 obj <<
-/D [5859 0 R /XYZ 90 670.407 null]
->> endobj
-5762 0 obj <<
-/D [5859 0 R /XYZ 90 606.765 null]
->> endobj
-5863 0 obj <<
-/D [5859 0 R /XYZ 90 602.282 null]
->> endobj
-5763 0 obj <<
-/D [5859 0 R /XYZ 90 557.325 null]
->> endobj
-5864 0 obj <<
-/D [5859 0 R /XYZ 90 557.325 null]
->> endobj
-5764 0 obj <<
-/D [5859 0 R /XYZ 90 492.622 null]
->> endobj
-5865 0 obj <<
-/D [5859 0 R /XYZ 90 488.139 null]
->> endobj
-5779 0 obj <<
-/D [5859 0 R /XYZ 90 443.182 null]
->> endobj
-5866 0 obj <<
-/D [5859 0 R /XYZ 90 443.182 null]
->> endobj
-5780 0 obj <<
-/D [5859 0 R /XYZ 90 378.479 null]
->> endobj
-5867 0 obj <<
-/D [5859 0 R /XYZ 90 373.995 null]
->> endobj
-5781 0 obj <<
-/D [5859 0 R /XYZ 90 328.037 null]
->> endobj
-5868 0 obj <<
-/D [5859 0 R /XYZ 90 328.037 null]
->> endobj
-5782 0 obj <<
-/D [5859 0 R /XYZ 90 264.335 null]
->> endobj
-5869 0 obj <<
-/D [5859 0 R /XYZ 90 259.852 null]
->> endobj
-5783 0 obj <<
-/D [5859 0 R /XYZ 90 213.894 null]
->> endobj
-5870 0 obj <<
-/D [5859 0 R /XYZ 90 213.894 null]
->> endobj
-5784 0 obj <<
-/D [5859 0 R /XYZ 90 150.192 null]
->> endobj
-5871 0 obj <<
-/D [5859 0 R /XYZ 90 145.709 null]
->> endobj
-5785 0 obj <<
-/D [5859 0 R /XYZ 90 99.751 null]
->> endobj
-5872 0 obj <<
-/D [5859 0 R /XYZ 90 99.751 null]
->> endobj
-5858 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5876 0 obj <<
-/Length 3379      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_���:���_6I�i�8�i�����N}�w�D�r����7P����}h��4>|�
�ň����˷W�~���n��_*61�H*'���'�$$�-&o�a��'��'i�N߽�R����٢H�}��+��������7�([��a��ˊ�/��]�$��e1�����I�tJy��v�x�b:��z��]�#��A���g���*���۩�I�ޮ�2�O~���y��l3�GRЄbM^}s{��+xB|�Rz2__��O��;33z�k��p�ບ�|��+
���?��O�k�������)"���WHq]7(��&]���-�Wh���F�#6�L��
�g[�fD�٤wS����02
-�1�^�as*�m�p
�1��r7���#�sd��h9��v���֣�-$bJn�����hi�8 }�n5G\����H��#I�(]�$�A��8�D$�e���f�`:8TM�[�+E��Dk0;nn>X����
�dƨ}1>���F���b� Li1�� &�%�"�

fM���c� Z 
���Wk��Ղ~c� � �Q��"kz}>l �%�8�oR6�
CƌJ
 x����Hc5Fp1H���!��5&DD7���k	�'8�)�L�S�`*Ύ)
��>	�cI���[ 
�����.�W�>��<c�l���mV�e
�n�k�!�
���2��]��;���j���A�u��X��D�ٮaz�0� �F�=F��i��
J�}�v2�)2���8�֒�����XÏ�����`��}VK��}�񟚸
� o2Њ=qeQ��"��� C�>�P�ܶ�
�8�ߕR
�
��c�[IŠ�SZq�>+���?*�%3�XS����G�֊�nOJ�˻l�b���>��a0���&�#L&!_OIO�A�<?g3T������#�L*��^�.�J�R7�
�D�h>VP���D/���'
C��D�N�%����UX�J�'��k$���Z<g��&��%3h?��;J�D*��.�&(����d6��0`J�3ua&Ƨ�j�s��mlR���G31$`2F��ڤ
vMĶ̠t�.���$�s�D��X�J}:�
� ��Ӵq�l�_��5j�8�g���|2I�/���#`�2��%@!ٕ���|WY�����)Mj��(�(Y°�>W��[_[ĩ;T
p�!&b���ڮ�'�y
v
8XOH

-a�vұ�5�	�n�̋uZ��[y}��
�O���H���)�o��û��Et( ӼA�n�L ��`���@�Q ����%��3�_L$�p�.����;�
`�����Q�[�1��쎍
�F�
xo�p
l�Ӊ5
�hj����h�z��`~�c�j���	�m����O�CPR��h|~Ү�RP���Ҳ�I��44N���

SK�� �e���K�_�y�/؈At�	�'�1�]�3N5��RN��������Ĝ *Vn��ӗ�9
&�3� ������q5G�l�����~Ws�Q�eE��x��U���`�e��1v;-�$��~V4�0�<ɗ�#4���^�A֦0�zNw��2�b��i��.]��� S�`6/+��'�v����-s���L��y��'�2���T-���z�&n�'��q�]
>�����S*���<G�ݼͥp�~κ��u;
���S+wM'
������
�Ӛ��\\��ҝ�q�Y�q�;����]`�{�vgj�>m�Ne��(����۽޳��O���i����eT�,7^�GG�U4�{K������MLG��Ar��CLC��],F�O��3�YE�YK�C��Tþ�4��~����|�Ψ�1p���T�ⵕ
i�Z�
(�B{�k�d����~�?�T��9@�:'#F��"��L�$p=�Z�RA�Y�,��e�F��5.��z$TDRxx�2Q ��
 ��k��s�'�
-fE�����@��\�����|LȌm�C
-M��H�����#;����̉8b�^TK+����n��[=�'��N�l���<���a>[V��tW���
-���<��������O��'��8h��
�#� �|��
�
lq*F� �
��2?�8��Q'm��u��B\�U��v�Z�e�i�|����.�k5&l>�b4y
-am�pБ�I�JF��b���P�Ё�/
T�;
-妷�G�2�����Zd���+�c&�ٳ�]֐�����e��2���|�����4�-�Ҷx
�4����j.Xڦ���,eE�7�!5��Wިg��j�.=��2�Φ�E
���̛��ޛ��勃�-ɫ��xS=�6
5��6/�
-��
�sb�kajT.ݾ_Z��jD��KK[���w�����Y���I�����~�(��$|x�'T}W��P
�j�����C}$�xWM����� �Z�D���,fx���([ 	��֑�{��f����m��v��E7�5�T�ێ\
~�N�
ڃ`��V���4ⲩ���|d�>p
-7Y
*H�Ο�X�jDٵ#
�$m0��`n���L?V&W+?�v���P��
-�.��
b�c��v��ϭ��T������Jk�pZaFp3�
ZjU�QZO�]��
MaɸQP��Hโb�
�CS~��j0S*b����,v�"
I��=�?6����T�����T�<8�6~L�����o�u7_f�ҏh�,/롅�h�))О�$"����|F㣄n
EN͇la9����8R̪�<�$����Hg�
�uZ��d��eлܥ#�:K7#]��]j����X�5ȡ�DCWo�yKےM�����K~iw4x�q�u��wϬ��
{Ca4E�
d(��,D�cg�
�XԂ�18��I�/������X!a��ى%�B�9;-��9��"�V��}��[��L�c�g�������f�ii�~�04�Z2Hk}44�
�6Uh�cCL76���������:6�!��M��]<P̞�
8�
?��"��G9�$�"f�ᴻ��]��?�6"1�57f욚(�������S]G#cOZ�ǨX|w��̗1b�|/4�Q*
�h�Ǥ�^��I �$�]I{c!i���fV�1FA�B��7��wG 	��l����
{C`�v`(蝳Z���nW�[�:w��OI��;�1ͻp7��o븐Q�ٓ�F
�,�!��6���>��&�Hœ�"$�MvxW��q0��%E��nz�����m�1��/�MU�'�_�����.+�dO�Ti��f_�ت��59� lݶ�:�?gY�w��I���Wn�[W� !#M�,�7��w��]�y@�|}�3�y��j&q���΋�b�w����d��PJZG���H3��>��|v_�?�
\�Z���9�]^��
4�
-endstream
-endobj
-5875 0 obj <<
-/Type /Page
-/Contents 5876 0 R
-/Resources 5874 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5884 0 R
-/Annots [ 5873 0 R ]
->> endobj
-5873 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5877 0 obj <<
-/D [5875 0 R /XYZ 89 770.89 null]
->> endobj
-5786 0 obj <<
-/D [5875 0 R /XYZ 90 662.935 null]
->> endobj
-5878 0 obj <<
-/D [5875 0 R /XYZ 90 658.452 null]
->> endobj
-5659 0 obj <<
-/D [5875 0 R /XYZ 90 613.495 null]
->> endobj
-5879 0 obj <<
-/D [5875 0 R /XYZ 90 613.495 null]
->> endobj
-5660 0 obj <<
-/D [5875 0 R /XYZ 90 567.478 null]
->> endobj
-5880 0 obj <<
-/D [5875 0 R /XYZ 90 567.478 null]
->> endobj
-822 0 obj <<
-/D [5875 0 R /XYZ 90 514.729 null]
->> endobj
-5881 0 obj <<
-/D [5875 0 R /XYZ 90 510.246 null]
->> endobj
-5661 0 obj <<
-/D [5875 0 R /XYZ 90 458.559 null]
->> endobj
-5882 0 obj <<
-/D [5875 0 R /XYZ 90 454.076 null]
->> endobj
-5883 0 obj <<
-/D [5875 0 R /XYZ 90 385.502 null]
->> endobj
-5874 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F24 529 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F13 834 0 R /F8 794 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5888 0 obj <<
-/Length 2884      
-/Filter /FlateDecode
->>
-stream
-x���r�6��_��K�u��N0�}h.ͺۺٍ��L���2es*�*I�q��7��a�ֶ��@� 8��gW3<{{�����7	��(�T��W���"!��r�aNRz����3&"��]f��g�o���뵣7�G�
X�3b(Q�����/xv	���0b����͌S�����
a�

�$� '�%�L�B!���
-s��6���/�&_|��X��-�2[�d^�6y�إ���1f��Wv~[ek��e��mti˪5'���� �� W*bԳ�"
-�X��$���v`���<+5V
AS$U�x�N>
��G
��w��(Uݺ�|� 
b	����)�<􂢅Q�K8"�� �T���Ù��!)RJ�Wb�c3����'3�$q�}��#��	��C����#��,��-
 ��25A`(��d�	ɼG6��.�q�S·�y���H��݂�u��o"���1�+c
$�F�f�
��k&iC��U�-��S�4�

�,'8/4!=�M��Jf���Ҁ�n�ŭ��5���g�u�����*�B\���5��:?^0��h O���t=� "�+����
Q��V��I�;j�$�ʖth���
-5w����
	���� q%&�
��S��1Z�E�4�����p&#T:�J��QO$��L�����56�L�0��d���/�1BA����>�`��1�
�$r.���!����(pbH�=��A���d�
�D��&���
+=�>����c�I1�;�S�C
�x�j�W��1��I��IM{iP~0�
�Br�4!�O7�H�j�P"�T?'z�&X���&a����@-�$8C��=I
�OC
K�H�Ɣd���(j�_ȃ��
�����'��
�{�~6��).��vT�,
2$J(dMY�GnJ'Wvd�`�$�_�U��n[V{��1���/�m��M]�m^: 3���uV��U����A�j'��s���I���k=M�RpuS�U����D�6�W̳�Eq�+�[���n�z]4��e���u��`� RA]��J-��[��v+{�����y��_s�[���eqU����KF,u� ��B�L�����4��z�%WtR��
l9�����u��V���]B ag�I�/�ec5�u$����%.�j�ӳ���Tȃ�N
-��.��:��U�5!�Ы�+��õu�%��Ө�I�]~�1�Q�X��
}�+���D�:Ć5� �}�(
-�`n�ޜ)�|P;8�1ϙ`H@6�ҷ�)>����[�0��J{�K`@[�<
�����6���t�Y
�T���]�0�5F0�<��>��
p��\!�m
h�- ��0ąU�St?�@d
�ў uS��6�\�h�ݮ�܇�j
����
���3Y�ƐDw(u���X�L\�À�O
LH�R�?��� gjF�왁��BL�-#c�\�?k7��wyc��ů:�����Y��%S]��7!	��:�zr�A:
��.'�j�D��n���������^
���U9��c߆
=
 OF�.H*���+��b�`�	i��Q�� ����u����~����B̵/��B��ν���I�x�_��ȍg�e��|s[��;����s���Ҽ��!aU�וV��y��D��H
vD<㗆�
q�a)�Vw>G��iwH�G~�jW.���$�\:tS��c,���%�ь
��G��I�N�AG�
��k��.�&s�M
��՗���ɉ���0Q���=����H�l �Od���]�k�V��j�z��U�o&�0Xd�^�n;m1٦M��a6L�.��˶����wm�U�Z����7A�e��j��Y.Bu��v����*�]T��Lj�jG��uil25f�YÅ�|.10y����	!�� �$s^��X
T�n�	hon@!��I�~2ʥ�j�]CJ��W!z��,8؃�k2�����L��c��_
�k����./
�2TS�Cm��V�ESn0_��(׷Y׷���a�poFR4W�asǥ6�l�h��s,M���%�J� 'f�
f����YoQA>�� ��_��|}���<֋Sú�p
X�j���u޴u�t�̜�����p"	��rW��Tv٭ηȎB�r.��N��y���FF��k&I��0�>�H*����z)�m�>�
�(4�[��iQ��+��ߕ��M�)``R�q�n3���]WhY�F&_y��9e�-�
�ySԺr|�uW
Va�з�l�{�͠ [...]
-�琴
O�m
U8O��l
�f��?A���x���e��!�c��o#��	��5B�|�u������o?��Tl�����F��T�l'���z����oF�)
�6E+
#)a���#D���ofAe#f��;�P<�H�?�Q�w?���w"��4A7;>
\���&
��^	��ҫ�
�>
-D��
���(�z6"�R$�Z��1J��1ut^�����1~��q��������b���kדT�}ٞ=c�2x��&�Q>o�"��pW�Z<;�)��`��q
D�e�:��q��
%.�u�YO3b��>}��9$���l�(���E��/@yb>Ɓ��
a�I�P�8
�E��M<;ݰ��
-�[�y��@�]���Jr۾'�C��`�Vӻw����M^?9b���L��5��7]��t�;A�fiP���c�����ڔm���H�.!�n���g�.vWP:]��}�5��b�ᤫu��yS��r4]��"���_8J�
-endstream
-endobj
-5887 0 obj <<
-/Type /Page
-/Contents 5888 0 R
-/Resources 5886 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5884 0 R
-/Annots [ 5885 0 R ]
->> endobj
-5885 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5889 0 obj <<
-/D [5887 0 R /XYZ 89 770.89 null]
->> endobj
-5886 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F8 794 0 R /F11 613 0 R /F24 529 0 R /F13 834 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5893 0 obj <<
-/Length 2940      
-/Filter /FlateDecode
->>
-stream
-x��\�nG}�W̓Mb�V�/���&�
'Y�ck���@�#��H*$e[A>~OO��&���M���LOUMuթKw�&W	M^
}zt�܈���NN/G#
Q�Fɻ
�����QJ{���������u������C:��~�χ󻓓>���tt��vr����O:~�X��f�?c�4
�	�\�����=���d|�w����걿����z�X��}�{���z�LÕ7�%�g��N/pI+�cNx�G?�
�v�@�&,�Kc���ѻ�4��O	%���s6h�H.�y��=����4�M�6�
"�L
c�����0m���

��^�xy�i����L,�"*��{�o^
%��
���� A~��
w���Rb���5_��P*�\ك��\��Dx�ʃ�������pZ
�
H	��߯t���"*�cGR��$���xCG�=•��?^��`��+x%�Y2�'�g'�
�{�r���f9Ys�C $�˻�t:�x���͜���,\\������rƀNR6ܼ�ٻ9S�����d�X���$0| [...]
�U�?�NE��
L�q�f`��x�$W�E(�� ���qk�5
1ܶ遒(/1V�l:x��^�p-�/IG���
_"$
�VW��r���%�p
����RG�k~q�\׭�:@��R
}9��]�/lB�
i�"�2u��p0�Ѣw�'-Z�L�ЅQ�8
�c������a�� Թm��g]ܲ�V�ɵ��Z���\ۗ1�s��\�.��r��1b��Dj'���*���r�)�+8��w�U��,���_�G�ON�N8
-L��U�
]�L�>����
�J�~�jd1C5Dӭ�Q3���O^���-l?�
�{��u��B�D�=h{��R��`
-�\�P�'����x�>L]�N�?<��
0��B��L���z6
,�Ê�!�̊��{q`��p���$6C�e��L
*��P�2�N��A`���WC�d���t�!|�Vg_�p�>W��\�,~u�
�� u� u�#��6T�T*�
-�0>���YpV���\�G��\�f�Q`��3��<�	�2�[OGa�)t����<R쐇8�[ߘ�$"\#�ē0�&C���N��Z�{���Yw�fa�-�T4��M
(�����C�
-ܝ��
ר ���H1���q��L9
�̓���=�\p��~\���bYc�(��3�d)��փ��e��R4<�Ȍ�Rn�_EV����乨�~�$�F����q ��7d�
��aFۤp�����j�_0x E.
w
q@��B
a�������N�T��	\
��A�.S��h��r�:h�II����l����8@�z=����Xk
+IG

������e�b�G�k�&��M ��#��v3|.[�細�I:������ӳUՐ�2"K���rx����>Z"
'Z�}�B2_B����"�/
�"��@Za:�-5ƫ:��4�a��n�U(G�X�y�q�n�.*80�zsXD�k���[��@�0�q, A
���C�=����ۥ�΍jA��JS+�,��4
-
З�pge�2{9
-+��0l`�@W�u�!���₆5�NX��u�UX��H��~)��°	+8Rh��>p�`��
��4d+�Q�Ї	
t>��S9i�//��+
-�Xg�	)�W5�
�J+OJ+8]S��_SPpى�.41jro\U��؉��峜*���J�
O��9�`e�2[��hZ����H���7���z��
���kxy*݂�b1��D
-�z�"DƑ>��lV_yR�.��Λ+��7/�֔y~t�6��Z;��<�� Zq_��"�
9pY�F����7���h<�:{6�G��)gq��|g��KI���`b�Z����PX[)Y�P�$��B��&��Ջ,��Ȣ�����"�EV�W�!}%YB[�Y�����ֶ�>��h��+|�e7nڬF�9����b�0j��h�m����J��v%�g�0�D�"�rѶ��i�K�a)L�'��������,�H1�g�Q�>Vr�	��
�&�Y{c�᷁�Zl�2ckl��4(�:��xW��A�Q��-&
���؇lhB
>��j
-��
�L���r���E#�����;nN���6�R�__���L��!w_JY艅��]��
����U��]�j��!�Y
M����)1�f�|��'ʕ�GQ�*d7r[M�hȽ	�$lO�`쀯D
(%����
�p<�!J�:�.����Һ�i�N�n�e��<_A>z�	�$��L(ݯ��tf������&x^4t��sE�Su�1�@�
솧�Y1]�فMPa�6C3X$�r��������m�e/&~/#wE�sE���*�{s�n~���rOٗM[i��w�B�EB�P*�����^�� ��)�%�R�-\E
j}������o+��5[�"�v2Da�Rc��
��2RT�0iY��W"hfk]��0����؛�7X�(낭��ueŗ!j-�	G�4���N�Qm?���y8
FwmY�wY���@l���6�]�P����[kU�!4�!(��x�R
��A�h�\P���6���U�ne�\��ۉ?��_ĬN �"������Y�&�����=��'���	��_(�2;���'���+��]oX��'=DKTi�
�
]dx�xp9�i�K��
��l�&�ۻ�a�mU������a$
�O���0FW�0�Ə�Z�<~j��Sn�OCt�b�
Q�q&���C�b���4�91\���2`�/ᴖ��v@�\�.9����z�����ߋt�؟|��-�?����u��-,
��/Ƴi���oM���~���[�?&�o?��uP�”��s�|X.oN���o���\�>[��H�=���^-�Mf������
;!'YA�J��aDk�����O��V}�Q��{vs�`~���D$�fP�i�/+yq
-endstream
-endobj
-5892 0 obj <<
-/Type /Page
-/Contents 5893 0 R
-/Resources 5891 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5884 0 R
-/Annots [ 5890 0 R ]
->> endobj
-5890 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5894 0 obj <<
-/D [5892 0 R /XYZ 89 770.89 null]
->> endobj
-5662 0 obj <<
-/D [5892 0 R /XYZ 90 650.41 null]
->> endobj
-5895 0 obj <<
-/D [5892 0 R /XYZ 90 645.927 null]
->> endobj
-821 0 obj <<
-/D [5892 0 R /XYZ 90 592.85 null]
->> endobj
-5896 0 obj <<
-/D [5892 0 R /XYZ 90 588.367 null]
->> endobj
-5650 0 obj <<
-/D [5892 0 R /XYZ 90 538.737 null]
->> endobj
-5897 0 obj <<
-/D [5892 0 R /XYZ 90 534.254 null]
->> endobj
-5651 0 obj <<
-/D [5892 0 R /XYZ 90 480.51 null]
->> endobj
-5898 0 obj <<
-/D [5892 0 R /XYZ 90 476.027 null]
->> endobj
-5652 0 obj <<
-/D [5892 0 R /XYZ 90 442.024 null]
->> endobj
-5899 0 obj <<
-/D [5892 0 R /XYZ 90 442.024 null]
->> endobj
-5900 0 obj <<
-/D [5892 0 R /XYZ 90 407.961 null]
->> endobj
-5901 0 obj <<
-/D [5892 0 R /XYZ 90 373.898 null]
->> endobj
-5902 0 obj <<
-/D [5892 0 R /XYZ 90 339.836 null]
->> endobj
-5903 0 obj <<
-/D [5892 0 R /XYZ 90 305.708 null]
->> endobj
-5904 0 obj <<
-/D [5892 0 R /XYZ 90 271.71 null]
->> endobj
-5905 0 obj <<
-/D [5892 0 R /XYZ 90 237.647 null]
->> endobj
-5906 0 obj <<
-/D [5892 0 R /XYZ 90 203.52 null]
->> endobj
-5907 0 obj <<
-/D [5892 0 R /XYZ 90 157.567 null]
->> endobj
-5908 0 obj <<
-/D [5892 0 R /XYZ 90 112.55 null]
->> endobj
-5909 0 obj <<
-/D [5892 0 R /XYZ 90 77.486 null]
->> endobj
-5891 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5919 0 obj <<
-/Length 1838      
-/Filter /FlateDecode
->>
-stream
-x��Y�n�F}�W(�R@��
w�+'i��I�/M����TH*����R��H6*�E��Kr93�9s�Pƈ��*�����%
��N�J(���e�p #����4x�ߟ���Q���O_�<�����7zr>�4"p
��H��l9z�
)\~����k�iD��q��>½�lD`�!�F�!�O�8��r�HjmB9y
-�6��I��p;z�%�Q�l�oV:O�z<�
��#؏e����
f���$O.�2\��<Q!S�n
�}٢�Q����)x�n��_���ڛ}����@�
-��
'l�P��a�L���@��'�n%�c�s��
p��L
�%��Yv]���lLx�Q��b
)L���X%�1ه�
����&�d����C���

����?��zQ��
-�r�6�M߹���պv�w�c�<F˜Ȟ�y�	�q���/���(bm�<
�
Ԕ��R��t�Uu���
�\F�CY5�#�&A�w;+�y��W
g�E��lM�=�H
M�fd�x���:����-�!��u��}���) M
�L�^�k����H�jFt��{/_�
�E6"�pL��(:@ʔ�T
>p���.��(� �I��� a�-
O"��
A�#��k�`�bS�n+&�8&8�釗��
z)����
�n�A �-�0я�L�=�
њ�2`B!
����#������]p�	Ԑ��	��:
���-� F��CEPm>�iY�UcB��d����B_.6luDԩ]�A����O�ޘ
�
������9����s7��s'OŞ.��|n��q���R�5(�"w�.���g�[�I�צ�?�ҹ!q��'�b�<�c�E1�<����.�Ø.�t@���4���
�����#�V
4��;��C�7V��=�i&�kӗI�Lv)��q
p�>�R��
�X��N
@
A!�-.}	<�
��uZ�@q
�8J�>3{!��]�Ii��t���ٟ�
�0��ߎ>B,{Q�B;C��:3Ș����b�JJ���M]�g�[��KhR]�|��޹
�
��'�΢NnY��.[h6-�sᰯ�Md�J
@� D=[}���:
X
���8�g�7�6@�&$�b�{�t`�*i?$Aރ�<��shϦ�7m�ծ���a��?·s��.�����{Q ��u��ʣ���5���ņ�V
�p<�����\?�v+8d������G�yc��1��I�`4(!"�Կ~0p��w��u�
-aP�;ۙ�J-
�K<��6s���٥
)�����.�|D>CŶX�:0�og߬Xj?
.��$
�u�.|�
-�=�v9��8�nq��>�z�l����ǺN��
W �Ǻ����N�=T��CZֈ��l�mDË,O��^�:�,��i���\���9�6��	Ŝ��؆�~(���<��ݲ	b]�,����f*���v�Cu�ɤ}���7Z"�(�O
��t�Qx
����|_Iȝ$J�
�H����Q�����J�(:�F1�ptg�r���
��Q�I5���Rr�$C��6��($v�,��q���
�I�M����	����v�ɒ��,���,�G
�_2^�(��$�xM2&��%p�+K`s�M(����&�w5	<�h���5	��&�mMb6:M�d��%�u� Fڤo��UP$)��[;`�������D��௳�7�g����K<.�����M6�
]���`������׿���.�s�=�-��
x
��Q�jeA���x�@`��
ø�>�a�2��������m�u����\��*�_!h�]�o
V
-aٶ\+��E�_�S���� ߂�
-endstream
-endobj
-5918 0 obj <<
-/Type /Page
-/Contents 5919 0 R
-/Resources 5917 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5884 0 R
-/Annots [ 5910 0 R 5911 0 R 5912 0 R 5913 0 R 5914 0 R 5915 0 R 5916 0 R ]
->> endobj
-5910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 449.761 175.937 460.665]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare_a98c515b16e12424b273eaff073b31f3b) >>
->> endobj
-5911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.274 449.761 288.285 460.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-5912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.018 449.761 415.028 460.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-5913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 175.231 175.937 186.135]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare_abf5e694ab674c48a452893f021986318) >>
->> endobj
-5914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.274 175.231 268.908 186.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-5915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.641 175.231 376.274 186.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-5916 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5920 0 obj <<
-/D [5918 0 R /XYZ 89 770.89 null]
->> endobj
-5921 0 obj <<
-/D [5918 0 R /XYZ 90 692.575 null]
->> endobj
-5922 0 obj <<
-/D [5918 0 R /XYZ 90 658.512 null]
->> endobj
-1724 0 obj <<
-/D [5918 0 R /XYZ 90 573.915 null]
->> endobj
-190 0 obj <<
-/D [5918 0 R /XYZ 90 567.038 null]
->> endobj
-5923 0 obj <<
-/D [5918 0 R /XYZ 90 468.666 null]
->> endobj
-5924 0 obj <<
-/D [5918 0 R /XYZ 90 468.666 null]
->> endobj
-5925 0 obj <<
-/D [5918 0 R /XYZ 90 421.736 null]
->> endobj
-1725 0 obj <<
-/D [5918 0 R /XYZ 90 299.384 null]
->> endobj
-194 0 obj <<
-/D [5918 0 R /XYZ 90 292.508 null]
->> endobj
-5926 0 obj <<
-/D [5918 0 R /XYZ 90 194.135 null]
->> endobj
-5927 0 obj <<
-/D [5918 0 R /XYZ 90 194.135 null]
->> endobj
-5928 0 obj <<
-/D [5918 0 R /XYZ 90 147.206 null]
->> endobj
-5917 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5941 0 obj <<
-/Length 1312      
-/Filter /FlateDecode
->>
-stream
-x��X]o�6}��0`���!)Q��a���A�Ȓ�/I�2c
�%W������K�
�I0/��>����s����7�w2zs1:x�C/AILc���K�ǣ���ޥO0"q0&c�4 �O�Ez}P�W��\N���c>������Χ�G�n�+�i�����Z,�: —��2쟷�*k�}&o�Y+3X��}����Ň�ۋ����#C\x�bt�{S����(L�w�7-����[x�?F��o��D�9����V�j!�6m�4�n���<o�����j>��L���O�u�p�J�(��2�6/g斢������Gb���a�W����1��,����
-�L-��84���0Fթ��k��b[pi����|�b$��b���
A���]4�C
$�(�̋#���8
B
-r
-�
b�X ���=�`4
��ou���"�
��DDC
�9���>JAT�SlH����֙�WƆ��D�W�i�Xh#���fզ�1�z*�N��Ƨ:x=�
�iݩ����
�����
R[���


�8�id����Y��J��r������l�e�/��V�
�T���1s�~},Yz�%
E�B�������&�w�g��Or1Q�R��U����
y$
]v��r�;�'$��8TKUt��
-3
d[L�Z�ڧC:,�ۜ�x��Q��<�k��n���� �H�Eq"
����g�]�&J��=��
;	@Y�
}��b�6�7RZN]J�Ƃ�-�8b��ݖ(�S�!�Ҷ��T�&�l��7AQ��c�[�]��gțb����u/@�v�c٦y���X6Y�/uc�Qj��1��k�fU�0���I^�hb�e-������J��Q�O�]�
\u�
.�o�
��p���y���k
�U��֋�4V�ݽ?/A%��AY5�tR��\���*��"��ǘ��?���O��9����|a���g��3�0>� .�Tw��
!Լt0��q�	R��R���N)��vU��MIL�/� O ��G���A��El��0q��<`���~
����GW1��e��e&� ��LB$"����|őxi���2-�*�Z�p�0�q�o/8�B����
h�i�!����i^؞W�� �:�O��Z���-Ӣ�J��@_ɀ0�C����m��F#��l~n�)�-|��F��q]3�l��
2OO?��F�?����Oi�r�Iu�o�AY7]m!HwX�C�"�҅Ԁ��s��#M�
-aU�5�y�.&�Y#��>�P�s$����-��
��	r�w<2��:&�̯#5urN����݃����E�
W@������	�
-endstream
-endobj
-5940 0 obj <<
-/Type /Page
-/Contents 5941 0 R
-/Resources 5939 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5884 0 R
-/Annots [ 5929 0 R 5930 0 R 5931 0 R 5932 0 R 5933 0 R 5934 0 R 5935 0 R 5936 0 R 5937 0 R 5938 0 R ]
->> endobj
-5929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.588 622.278 187.842 633.182]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-5930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 548.246 175.937 559.15]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare_a92edb0b8b1e2097c5d20795e576517cf) >>
->> endobj
-5931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.274 548.246 270.013 559.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-5932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.746 548.246 378.485 559.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-5933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.588 475.211 187.842 486.115]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-5934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.305 457.586 305.559 468.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-5935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 268.296 175.937 279.2]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare_af6c069432956f215967c61be24a40939) >>
->> endobj
-5936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.753 268.296 214.94 279.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.401 268.296 260.589 279.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-5938 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5942 0 obj <<
-/D [5940 0 R /XYZ 89 770.89 null]
->> endobj
-1726 0 obj <<
-/D [5940 0 R /XYZ 90 674.552 null]
->> endobj
-198 0 obj <<
-/D [5940 0 R /XYZ 90 667.429 null]
->> endobj
-5943 0 obj <<
-/D [5940 0 R /XYZ 90 567.659 null]
->> endobj
-5944 0 obj <<
-/D [5940 0 R /XYZ 90 567.659 null]
->> endobj
-5945 0 obj <<
-/D [5940 0 R /XYZ 90 518.692 null]
->> endobj
-1727 0 obj <<
-/D [5940 0 R /XYZ 90 394.602 null]
->> endobj
-202 0 obj <<
-/D [5940 0 R /XYZ 90 387.479 null]
->> endobj
-5946 0 obj <<
-/D [5940 0 R /XYZ 90 287.708 null]
->> endobj
-5947 0 obj <<
-/D [5940 0 R /XYZ 90 287.708 null]
->> endobj
-5948 0 obj <<
-/D [5940 0 R /XYZ 90 238.742 null]
->> endobj
-1774 0 obj <<
-/D [5940 0 R /XYZ 90 144.231 null]
->> endobj
-206 0 obj <<
-/D [5940 0 R /XYZ 90 137.108 null]
->> endobj
-5939 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-5989 0 obj <<
-/Length 2663      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���K�x����n����O���%�V�"�6��=3
^E���t[D����̹~����r����յb�AFR�>�$$�7
>���ѧ۟&5�1<�.�|����������ۋ�/���	�t0Y\|���)\�9��
��MZ�2��.�~�=/Qa���s�����9xϣ,��Ɣ��z��d�d�:~
-�WײN c��&'�+�m��@A�0{��b��b���e�o.��}���ŢH�����3


-$
�
R*��S�(L,qi
-g�be�\]3S�G�\���hP�HhUR������Kr;�V���c�z�oL����i����#*�h~�
�

a�B�_�
U�-�
-�+͢l6��	�d�c�h����=h�M�w��2�ֳ�Mu�	�Yt�����8[F�/w�V�:ʒu�$�_������um
-F\�bFK�nz�"OQݧ�&���du����Z�xn,��=�
�[G�y�+��Tz���
6���H(�+���`Bq�8�U
-A�WJI�\�
-&�WŘ1
5}�|�:�0)��v��w��l/S�����Q����nkX.�8Ͻ���L֋^�P��P�Fi0v��njJ$�ц�^�1ߥy
-�W��^��R��GZK� i��H2���#�U
���F�r
��y�
�cJ4hˀ�(��3��t���>@W��<
�-�
y��� @�t��j;]�a at W��8^�3����N�GtzF�3�CD�x�%	�9 ����ј��ra7���}�
�<�XWb�XgU���r�k�:�]C���C;QG
x����ͷ��3��_#�h!�Dv�1�YV>�������@L� C�'�<�
�~&��u�q���{��f�X	;A]�A�
�gP��A��
;c��nD�3�@t;�%��k�4&�E�����Z
 W���
芄�b�
�mS3��Ii����gL��`:?��� ]�����~'��;�������d9Y�Y|�P1Nm<��T���`2H���%
I�v�.��,X�{H�WEn��s�h���c�=���sb���l��Z��`3�u at 8�%�S> �B�C!����\
�75���a�R*Y�ک���.��]XW	g�VAvRXW�o�_���q� ���<�6�\X�	�����7r���M��+�,�Bv����JfK��b�L�9L�|����ѡ13k��)N�4�d4&��Wq���q�Wq:Y�V�6v
(�}�I�>*�M�Q�%K
�����+��\�t�p�8ԋs����i�K��ҋ�yd�K�L6ö{h��d�}��/[걙��f7���!��z�tdd��oGR8�%!��]V��.+�����ci��wN�����A5�My<m� � /x�%;gׅ��쳵d4��1���'��o�
܎@�
i�ڪ|ѡz�U�+���+?�(��T8���Cs�rHx [...]
U���ez�OV
.�,ʁ�8A����\�jh� �ZZ�勖%��yNo	A4�eb�ep��9�FA�R�tJ���¢�x��(����rZ�;T�u]
�I�
�`@�V�`�
�D2z�
u�;B���ZՎ-?m�{B>��@A\
�%*彻
VU[e_ë,Ǽ�
m1!�ۨ�@<� �`�e�F���!�CX
�*��
	BCh����KJ-�aIQ�w��p
-�r��,PM\R׶��Cty&L�Z %5���:���D
)gs1U�\n�j�z 43�
�x��O�b��y%��	�Y�U�C��d/
)F̾>F9T��
;\��59��1�u�c��v���u���I�I�崢C7�
�Q���k�O}�Ƙ2
*@�U��_����IB��&užmI�tp`4*ݩ���ZVH���.Or����-�,��No+����>�;퍉�|D��6�p��1�v��
F�MP�N�*��I�(?���"E�
-���X�n:k;Z���ѫ���i�v�%Hī�!�e�������S�,���*IgE�ݧ�\�Q<��}k���n�`�S1D�b���\wx3�
*+h�l|C}�v��[�(_ڮ��F� 0�龏��wH��C��췦	��	��:�t��~��iR%�K��c5��:���4�q�P#�#_��Q�"8ДV3�V�LA�kc�o��Ő1;�p €�-�l�Jl1�S�֫c�؆p?X�V�ͷ#Y�3���7��tOf_<�"�t��lV���koN
iҢ�E/�ں�+ F��� &���vGPĚ�6�NO�E�n��።��g��tǭ�
aY-LTB"� �����U��W��r|(.�(UA��ő1\W��aƊf�
�p�
�p�!Y��O~�������|��n�f�#\�&�h�D����p�Q���+x�R��J6�~�ͲO�f�
���>�g�}����D��`G��#��-��X�$�o���HQ���õ�
�}u�;0��r;�W���3���O
�J�XEn
�������D�]Y,�|ps�&�#��	z��%Zn
-��[��߬Ӳ�$�v�:*��q�.-�뷒�]�b��T�B�%�S���_]�o
�x���h��+���A��
�#�~��?ϖpq�f�����^��
-endstream
-endobj
-5988 0 obj <<
-/Type /Page
-/Contents 5989 0 R
-/Resources 5987 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 5884 0 R
-/Annots [ 5949 0 R 5950 0 R 5951 0 R 5952 0 R 5953 0 R 5954 0 R 5955 0 R 5956 0 R 5957 0 R 5958 0 R 5959 0 R 5960 0 R 5961 0 R 5962 0 R 5963 0 R 5964 0 R 5965 0 R 5966 0 R 5967 0 R 5968 0 R 5969 0 R 5970 0 R 5971 0 R 5972 0 R 5973 0 R 5974 0 R 5975 0 R 5976 0 R 5977 0 R 5978 0 R 5979 0 R 5980 0 R 5981 0 R 5982 0 R 5983 0 R 5984 0 R 5985 0 R 5986 0 R ]
->> endobj
-5949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.059 646.058 213.719 656.962]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a51da7be45180533a6f05d193a193fde5) >>
->> endobj
-5950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.48 646.058 310.978 656.962]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-5951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.426 646.058 476.029 656.962]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-5952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.454 634.103 373.097 645.007]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.088 634.103 431.504 645.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.557 622.148 231.972 633.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.166 597.241 213.278 608.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a34ee73e8a8cb7e13a65fc6ed7e0d3678) >>
->> endobj
-5956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.145 597.241 310.644 608.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-5957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.373 597.241 475.975 608.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-5958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.454 585.286 373.097 596.19]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.088 585.286 431.504 596.19]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.557 573.331 231.972 584.235]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.841 548.424 214.617 559.328]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_ae9988816fab7d8ef0cae14eab37167fe) >>
->> endobj
-5962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.16 548.424 311.659 559.328]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-5963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.535 548.424 476.138 559.328]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-5964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.454 536.469 373.097 547.373]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.088 536.469 431.504 547.373]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.557 524.514 231.972 535.418]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.43 499.608 212.188 510.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a307595e3959d8b493eef756efaf0631b) >>
->> endobj
-5968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.319 499.608 309.818 510.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
->> endobj
-5969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.241 499.608 475.843 510.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-5970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.454 487.652 373.097 498.556]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.088 487.652 431.504 498.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.557 475.697 231.972 486.601]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.571 450.791 216.337 461.695]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a837cb016717cabc430d6309b2d5bd28f) >>
->> endobj
-5974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.61 450.791 305.704 461.695]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
->> endobj
-5975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.67 450.791 475.272 461.695]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-5976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.454 438.835 373.097 449.739]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.088 438.835 431.504 449.739]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.557 426.88 231.972 437.784]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.559 401.974 169.852 412.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_aa13879760b95faeaebfcd40e1723005b) >>
->> endobj
-5980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.078 401.974 283.29 412.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-5981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.036 401.974 424.638 412.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-5982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.301 390.018 325.944 400.922]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-5983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.85 390.018 384.265 400.922]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.259 378.063 192.674 388.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-5985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.418 132.671 525.63 145.189]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-5986 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-5990 0 obj <<
-/D [5988 0 R /XYZ 89 770.89 null]
->> endobj
-5991 0 obj <<
-/D [5988 0 R /XYZ 90 704.286 null]
->> endobj
-5992 0 obj <<
-/D [5988 0 R /XYZ 90 349.869 null]
->> endobj
-5993 0 obj <<
-/D [5988 0 R /XYZ 90 293.002 null]
->> endobj
-5994 0 obj <<
-/D [5988 0 R /XYZ 90 270.625 null]
->> endobj
-5995 0 obj <<
-/D [5988 0 R /XYZ 90 270.625 null]
->> endobj
-5996 0 obj <<
-/D [5988 0 R /XYZ 90 156.546 null]
->> endobj
-5987 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F93 763 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6008 0 obj <<
-/Length 3572      
-/Filter /FlateDecode
->>
-stream
-x��\����~� ��Z�}?.M�4�Ӥ	�:ע�c
x'�'D/�d���;�KR\j�8�\'@p�#W����pfvV4{��쫋�]]<}fD��\gW����HG����������QJχ���<�~>�tP����e~���f�/�]^~^.n�CfŪ����Ẫ��b8�>��U._�"<_�Ñ���3�WW�\|yu��
-i�E����/^���n�Q"����A�Lr��쇋^К���p���Q�
snX��P*3�q2p��X����ӟ�:�f��|R!��W�u��}�Lw�H�l�A�I����ȗ�_�U+�j}{[�b�$L���J4�M�Y�ZUp"�kF�����*H�\$���F�Y
�FB�k&А�A٠H6H�+����������"R����$�Τ�wFœ˴`D���Ҍ�Xo� I��-e��&�զxS�_hxhX^Ի��4����'�Ӛ8nbz�<p��L`�x-�}��W�2<�E� �ϊ!SH|�`Ī
��.G���׫���w�5�!��U��"a+@̈S*���_$,��DkOd��ӄ�.��؄�yF��{ƀv��s]�� ��?
�q��5��Z"T��Yq�O'%��.)����p���z�_]d/��~������z����7|��>��u����u[�a o(
��3��3`Q
�Ϝ\
LځF!����y6��Љ38^�#(
�.AWq�'�r
��j [�!�^
����ޭq�RJ{N
�{F�!�$င�8(>�B�
�6h,��Z�V� ��$ԥ��ϼ
O���4�������T2NI�9#��g|XR�4�@y9�
й
���Y����/J�x=�/��U�[`|�F>��H����H�-��/V!ja���e��~��sI45���t9<��ix؇1`��a�"�f ��8�0�M=Nt�t�j��N�+��3N�u��z�H4��I��$�Ā�
	� *Z���8E�&
-�
�0�+�#�fu�K�
Q
H�3��,�4s*b."
-"hM������fq�6|T��`�+
e��uZ�y�U�ۭ��+P͛���X
�w(7�]���t9p"h�
��u�r��$l^�@['�g�!t��5��V6�P*M��@v�� ���6Z
#�0�&���GI�Ƿ����P�w����{| N��ٱ�F�K,yp�}�~x����D��L�>����YbP�?�:�
-�	Pa�
��H���%	c"��!� �h��Th�*LXkgM��3Eu�R6?���aeˤ��ao�)��a�
�KI��Fj�$)L���S�*�I°�:�
����.C��2� �m��
�ɼ[�$

�qj�"���X��r�a���
�1�4�
�"�xp��AN��
gۋ���9"J�ca���
\&^�#!�:Xu$
L
�5
r_bjP,�w|��
-��`�J6Z/��
-A�pQ���V���Q�Em�
�OHA�H�3(o��q[���j�*��
y�b�e���o0�еR�
u�
E,�>i��H��
�b������2��>
��6;�t ;��j�֏���pM�&�kX�A����_�Np�$dbo�F�
��:H�כ0p)[�|���g�.AԈ� @
w�
o�ń���HܪݸE$��s�9�ŃV�	�$�i�]�;�*�d0g�Ü=��� 9�!gB�9�r��c4����lV"��V�)�73�Mn�my$x�8��:�;��j:��� ����9���=�Q�a�<�Ԉ�OR�>�t?D�)9���Ô&�R�|�ɿ�Eyb���D��4�f���(�����(�
�`�pN�F�WW���u8Ie� N�jk
-�&�T���
�����IcJ�O���Զ�=gI����;�~5�yag����v�Iw
by�R�����2痉��Hlg' Q
�a��^��VL��|3��T�CjM$úLF����]�d��z��
-=�0��qH��!���v��v*���an���"��x�,f��S�	w���I�2���v��p���Ln[i�
S�+�H�:�Ҫ����r��S�tKz��Mq
�K$t a�Ҁ�8���`���C�6��3@]/��r�<Vp�{��=���ִ�f��~�EP��Ij
>���5]��Պ�K,N�WMg�ͻ:�]/nWm�.nOC��Q�����*gx�K�L0�6;�M�¾�T!��pǔs���˄^w/���=�<e��pc���Kwyl<\�s�I;�j5�},H
{��},8)����v�3w�0�3!�ߐ���6r����AA �q��^S��KZH�7�|�M� ����A����	��ج�p��mS
�ӄ�Q����V`��A�7e9
W��f�)	X�s0%�M�r���aի<���H:���M��P�B�*�|]���oq����PN Tz��(�]�F��dB��
6{�
��O�
�W�j+7�}��je&�{�"�ո儢��n{ք�a�`���I�
"�
?�V
��mz@���~��|�#���A��3��%, �&�
lA�E�:�
��x��P��/�G����d"��E�H F�ޫ%h{�A��:H�� ݄6'�'l�
_^���T�2���WH�lÈ�t^,pS�zՊ "��L��Ą��68mc
��}
-
X�:��
�)P
-
�/x��ǽ
0��8mv!��$�?�r
- 4o`b
-@��
$= RȄ������+�I�O������Xp���y�k ��	�i���	b��Cg�7�q'��Q0g�P����^�K���@�4~�-"`?¬���Fz;��Iܖmcr�2l�H�wq���-�_�4�����~�˅
-{��ߋ�}��	��u�I#�)p��`j��6y�H6�4'-6��5���;�4�7�{e} oӲ�o�v1��*�6��$�a��N�O��XT	��sb)��'� �R�`����8|F��$�!̫��)ta��%ku7�Z\�z���3Ŧ�a���
r@?�Q�ې�َ95�����i�#�
rl���/�QY{|��{��x`�� ����|�����Ό�>����s,�l��ЄQ�N�~��
-Zs
aa F[9pz�Sx
RqN�B����ô�AT����&���8f�3ķi%*��7���-6��꾸�N��>�4�d�� �]�������w
@3���C�����e*>���J[{RwZ�k�|�x�pD�G`m�U@�E�Ug���0g�4�!FR�p�
�bo�5��ы�]n�?�.96��,�5̴ɮ���뫡�M�r�e~(a�v
K�4;���v�u�`�Bv��w�
N|y����nY�����y9��q9ϧ
2
A8]�ꂻ~F�]G��ͧM��SX��
��]���q�]��oJ�hO�8�#��]�
3����=�#�|ة1<2(�oI���oIl�~���c���R�5nh��$��J��i��Ͽ
���埇J
j��/֍E`M6�~��F(f?hh��P4G��?e��?��6�`�TV߭V��O�ެ_W��5��w;M������F����ܧ�x5]`�Wi2���(#��Z ̟��_}��ε�|�����Ⱦ(A�T��"�?
-endstream
-endobj
-6007 0 obj <<
-/Type /Page
-/Contents 6008 0 R
-/Resources 6006 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6013 0 R
-/Annots [ 6002 0 R 6003 0 R 6004 0 R 6005 0 R ]
->> endobj
-6002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 618.004 228.516 631.952]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-6003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.263 360.562 510.679 372.518]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-6004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.418 209.473 525.63 221.99]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-6005 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6009 0 obj <<
-/D [6007 0 R /XYZ 89 770.89 null]
->> endobj
-6010 0 obj <<
-/D [6007 0 R /XYZ 90 667.618 null]
->> endobj
-5997 0 obj <<
-/D [6007 0 R /XYZ 430.496 352.094 null]
->> endobj
-6011 0 obj <<
-/D [6007 0 R /XYZ 90 345.454 null]
->> endobj
-6012 0 obj <<
-/D [6007 0 R /XYZ 90 233.348 null]
->> endobj
-6006 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F99 5346 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6021 0 obj <<
-/Length 3669      
-/Filter /FlateDecode
->>
-stream
-x��\����~����Z�}?��@��iR;q�KP�1�u'D���]���.Iq������pk����r
���Β��{�����g���s�i�{瓞�=#
Q��^�����������9
������;��ξ:?����-�caE��]��^���1\��G�p�����$p��^��댖��G��⡤��Rh
�T�
��@͋���z4ϊl=`��{�vfN>a�n���v8���d�r�I��Ɯ:!�����D�}��
�֤A�M40N�� lJ	u<H�r�������Z9wI�i�E�n��iM
719�7�`ȭ�_N��;<���*[���:ܹZ.�ր�p/0��gy>].ˆb�ͦ�l������P2����M^�[����ɋ���K5��!cā4<�/�"
��4�	QY�/b�4awq'.qB��	�~��
�ni/���]pb4Ή�K�-��Yv��GN�9��������?|}�{5������~�%�����Q��,
�d�i6>bwf��;sJ��z� 2刕�4 ��S�� ������"G"L�8�ݏ�4̚�
-	�0�O��y8]����!��q�3���)��)o��S�0$
�֝�Q�G�(e��r-	��7��(ݏ�4�����/�ӟ)��8���sgr��
SrwJ��u��Ž�q�J)?+ÕQ"n��I8���� ��WY�jK��
���E�f0��P:rni��
ӽ!0�m�=ˊ�0A�pΪPfF�� E�q��?�34' q��@��W�~��
-[��@lE��,�{S��q�p����R�p�q⬋����
�U�&1�$F���H��U��$��M��[B��
-��Y�
��� �6l
��:J��a�}
{QZkp?v�><Kjq�>|�� �;`��
��
�с��4`��i 
���
���@�b�x��?$�3+#�� �
��g�d������ϗ��8�6� ��J�0_r���p�0&�{�QE���	g�ͨx��N�T�I±dT҄�
�GB���|�����0xA�҂�� ���:����Ơ�' ���z�����C`O
��g ���~�B0����hI�X/�V
wT�o�g&]E5�e��ʖIeﺾ]�v]�2��R����h�)4�XJ�8R�_�����]��$
+����R
-\v*�6�����_��yc&N
� ��cMqi��6��
P�%pW�P����
-�bG)ƃgh
�V�}`%
6���,x[�Q�HXoC�����9�X��0�����B�a��@��B�i!{�}Z�>����?,dO��PH��;���*_O\����g�&�!e
�֛�ݧ[�l%+�g����tU^X������Z�G�dG=�'Ġ}�1h�3d�;
����2����xu�7s�ϋ����pR!T�t
�����U��]n����
�3|�-p���:��F'�Ū^T��
�ԦcN�C�e���l�,Õ@�%x
Oe�W
-�đSs�(3�f�� �M2�7�����o��Y�R�"���"v���
� 2 at L���YBh�Xs�"����3q�F�I�׮���r��U����:
-s�H����9K1��
���Ѕ�Z�)Ya���:��*��fK����I
-���6��ت��� �0G�/�r'��I�O�~��ʃ�k���.�F��gE��%�T�p�> @>����t%�IF��1�;ϔ���	��(+xe�V��>�������8I���1K�Ruq���
-���.P
���1N�|�TS���Β�k+�u��F�������ξG��
��$�;� W)��HnjG��DP�͝��F>Q_
��ȅ�JI����Y���g�ש������u���M����hU�s]����U�|D\�R���v��i��b	
an��ٍ"��x��f��Q 
-W�����t��˫��v1��e�mD�M�fɢ���A*ͳ�a�Y���
-
��I���.q�� Lk��
-g���-�8$4m]<E��F�n-Wȃ'�g�['��!
���VniI�b�j�2A
���?����_�8<�"צ���.ߕi�fqUԵ�H��6��F%���/F��r�']rg�EM�?��<��A��a��Ѳꌯ�,�D�o�/��
-T�2Cf����K��.ρ;�9�����������gE��+%Z�����QÝ#
V�`-��`�����BA�m�Lʕ��o�$��y�
�v	 q��) E�b"��8n�H�?Xlj��ܱׄa�Ղ�
0٫ ���r����&���8;_
�b1[�V��@�w�C�t�O�F!�R�������O.����$
-.~�>OK���j�LH��3�ߘ��
�U7�Ux�\%�m
�@!9�B�R�Ӹ�����{���@���
\�n8��j ,�
p�>�v��|?�=���A��7�&b��
��B-
r�HX�݁T���P��/�G���yl"��E�P F��%h7��Fa=H�� ��6'�'�1~�d>Z�2���-,D�B�e
G���l�o�.�Z�loj%&��p��:��u�ѦЀ��Ch�R���`
��)��^�U0g��h at B��q����!0W`�����[8z0�P	���$w5Nf����-3w�2~���ƂWn��w�4��K���
�K'�����h�
	���^�3E��2\
�/.�o28���v�f5?����@V#k[�[�ڔa�G"��cvF8����H��u�´^.P�
-����Vٺ�#��6y#�إ�YRéެ�zE
�Ŗ�j���͜f�^�7�n6����2�r�
f=QCNB��0��η�J��G�`�|�'X�&�R�ѱO$b[�� Qʪ6�,fk��r�z7���ܖ tEE��f�'��H�M�-��[= e~X5A��B�����8�>�PB�Ś����|;�m?
p�' 8~���������=~����7
rȟ���"�/����gğ5f�י$
�{�c��&�7.�C\RuM�
��W~�T�_��A*N�p@(8�s��b���\l�!SM����6������U�L3_eW�ɻ��ʚ
�$��bZ��.ͻk��Y~��⫨�*����Z����ptŇ�g
-G��Һmf<����vv�9��1a�qw��A�z�#j���	�l<�.Vɱ���@�qV�>0z3�]����Æ���Q�qKw4�0Ў���XȦ
���
�͉/�VUo���:�ý2��7[�K#\
/��
�G���᪟��aʀ�
nFaŶ,��7�ͬ
�nF���
���D>(�#=�=`�a�8#;��{�)o�k�i�}�z~Ȋͺs�u
pC����p��\U��&;
�MLj���*����Q*�G_�}�2䦞*��r�
�~;�o�1���X�C���N�Xg�)�ts��c!U7�ur�"UM���ӽ�I~=�I�G�I��?>;�'��*�NX„����ߧ�?v�����O�5~(
Q!��H����(�5����7����E��K�l;��n'���Dc�zO�a��rL�a�/����l���R�r�|>Zl���؄%r��~���\�!ay�U�Z
-t�R��������!U��7E�z�����:��2��B������T��z�:�e;<�.��������
�	\
-endstream
-endobj
-6020 0 obj <<
-/Type /Page
-/Contents 6021 0 R
-/Resources 6019 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6013 0 R
-/Annots [ 6014 0 R 6015 0 R 6016 0 R 6018 0 R ]
->> endobj
-6014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 671.2 228.516 685.148]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-6015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.263 385.167 510.679 397.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-6016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.418 234.077 525.63 246.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-6018 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6022 0 obj <<
-/D [6020 0 R /XYZ 89 770.89 null]
->> endobj
-6023 0 obj <<
-/D [6020 0 R /XYZ 90 720.814 null]
->> endobj
-5998 0 obj <<
-/D [6020 0 R /XYZ 430.496 376.698 null]
->> endobj
-6024 0 obj <<
-/D [6020 0 R /XYZ 90 370.058 null]
->> endobj
-6025 0 obj <<
-/D [6020 0 R /XYZ 90 257.952 null]
->> endobj
-6026 0 obj <<
-/D [6020 0 R /XYZ 90 116.935 null]
->> endobj
-6019 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F99 5346 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6033 0 obj <<
-/Length 3763      
-/Filter /FlateDecode
->>
-stream
-x��\ms���_�63-95a�Ni�!��&u&j�v:c{4'�$qB��ɮ��
�
pđ�D�/��	���b����� :�
�ѳ�o_
=~��QJR�����(��D�Di�v>z9f�03�2J��d��8+���Ʉ�q�xw�������Y���+V�r��8���'��v��z^�&S����E�^����E�����i�S3fi:y�⇣'/�~;b�!
1Ǒ"�͖G/_��9<�aD�H���
I.�s1���_G��
%
-[���
9ƈ��vz��O� �#���)��*�f$�>!Y�����$:
%>%w�(@\j�����L 0�9<�';���hMR��켸��������??;��~zr�Sٱ[S��Xg����&/��9�>5�4a��� $tj��>
$Oс�hb(;
�xB�4N��1N����uH�x?�ݏ�(��f!��*�J׾(ʥkeg�
- at V�o�z������Ɓ����:4E��D)́
xf��C��Ne=�E����N
A>;-������<?�#j?�ܙ�a5I.�!�sg�-e�Hs����I	�r����������r�=7���}.q�<̯��wІ(���rz]�W�{�OC��"�u�|4�=�S�dz4�8Aʆ�����S���QR����0^E�$m�����O dC%D&�BxRw��o��{\F7������'�~�&����b

����Ԥ��x�H�4eD�2
ͧ%IF��)�!�04,e��O	�
-����#�f�u�1I
����4$n�����+�}�0EGSMhb��C�XR�=�aåT�����K�Ǡ�~l�ȑ�OF�[M
��N��qb}�7��"�@��@m-H�C��ߍ��~�`���fu�^0 ߊ��  ��#�c�9@{m�D�`qNڅ=���NR�7�+ת���x�	Z�iJ83�D%��:!��	�Kz���Row>"�R����`��L9�9�vc�ۍ�
 EAQ����|�.�G:�g %_H�!
��an�$�� _,��TS.��
� �1������N�l�[�2��M׷9�Mק�k)�t}}4�L(%
V
��oQa�
aa��F���Ǵ�Wˀ�!3}E
�l�mBχ��$�Q��
�J�CK���
Kcś���{E]t�$�wR�P:�@}����iX��=�p��l�o�d!�Z��7�e�f2z�u� JP
��H�22�y:
����
,?��uPW�`Ճ8X���M�r�r?��'�?O�
����F1�v��
n�8��L�rLK
�m�g�	W�+��9V8����}����il�3��i��w�#`ڼ��ɔ�d|�W �n+��J�m*���n֦����%�*
*<"������\
�>f��X�+�k��38��-�:��r� -�ѕR�6E��I(b��^��̂#T,����'ګW�J�ӄ�5A;H�J�Wq�4�Ed�nT&	m��#rƙ�p��0���y#����muU?����|���Nu.\'�r-�����or
-�ʨ��7�)�I��@\���
��� <��?����JN��Q?@�C�AE8�l��[��v}
��Am���5D"�c�,L��/A����e�Y�]^�����ӎ�s�J�G��T�ԆД쉦����ؾiV��@T^L%#	���>�L⨔�vz��停����m,ʭb9�(]��
c{)Sf����
u|��[
�CIC�돮nj� �: �EL5��
)%��
-�)��jTJ|�V%��*�[Հea�K�gZ���KdyAX��*?h�q�k�e$��.i7!S�5=M�=��:ƈ䭑���ywCDSa�!W�@)��v�}�U�+����a8�	��ac&<��~E �.z3���^�R�����+��_��=��{�"q�k�±%��É���d�Ύ90c���l�����҇ύ�5�%ǟq�}��oq����w�L�"��ѯ�Dp�8wA|���ݩ�+�S�nK�oԽ
�x�.{:I5���9I�u8o��u��
���pP��X�*����̇��H
6�3]PǍ
ꬠ�����������A{ ~�����`o�R���h#�K�g��q�<�S��(I �wq�xҝo�m���{�Z
V�9����Z������]
�a�q�p$��r1�^O �]�Ms��A�k�&|_�|b(�Z܌���e1���|���̝\�<,>5W1o��vۋ����pN��{��ʛ 2�ϐj��
�ܾt��*�k![��I֥�@�E�
��u<sXh�
6��F�/��K.�Ӽ,��5����ͳ
-���_�?�-���zA�B���
l�WWE}�%	
+'��D
�o�S�\$���tge��
R����g���;sw�P���Ik+�G�Ir�
18�-&������
�q���w\�b���B�pJ��~�ߝW�
%�|��R�
 ��� ��"��ZP9���<�?�A�I�@v�

S���9?��E��o��ճ!Ƃ7�d��S\�ե���`�{g�j��`3蛪9�{���oV��-$�f@�s~��O!�.��K&Q���zAx��z�����p��������F�Y����X7p_�\W�'��V
�x̭��Z�G��ly����0
�lV�`�kIa�e��j�#��j���ޫv���U~S���|�J���!6�xvUkT�}��jn��AӢ>�	[����E�N�&����#ų�sOZ��S׫(���<����U3�pt����g�u
�]iϪ7����ϽS�Ԯ��y=�ލB�;���T9���؊�Hi���ڎ��>k��:_e�����	�x*�����h�J�:?=ټB���AD�
,Kr��'��ks,|�෠@�O$՜b�
U��YDf�Mؑ�����Ā��x1�f
R�E=C�6��&"x�ꕭ{_�i�j�R
�:��ٜ�D,`�z�II�\X�MjQ��wl��w���ce��s"(R�8�4���UV�;��>�'�u�m�'�]��0Ɉ�5����7;������J.m�qV\GН�����ϊ�[�!
���R�m���L=�hs���j�-.q�pq��$�
��҆��X�C���������I��Z<�s��v;�
�� 
hfK�ۼ�av"�lE�T��Ϻ� [...]
�8'HS�O��9?>^fױ�d��
\!Dz�p�sX�q7�jE0�7�t�УAH;��!$oC�>�	X�څ֎�(�����[
Lb��b"��L�W���ķ� t
8�I#;HZ@Đ�oY��W����"2O��%w�g8���ƀk&�v�<W'�sR�6���@�|�8Ûj`��y�a��Жk�����Ҟ�;2������3]��.�
`�u��e{�S�3< �nf��d�V��w	lu$?
���R
-8L� ���:/{ɟ�v����MRC�rE
g�2o��溨��)�����m)j��vhs �5�
���UG�
w��u�ɔ�b
��_1}�ב�p�k�Ŵ�C�HDw&�,�<8o�7�ùe�?�ͺ1�J���*���iu5_G��x�����e���:�o�Ϸ^�̪��)��a\�;�&��{�'�q	y:�Z�{��>�WZjn���Ҳ��
Ԭ�pl��'���-y''�]�����D�q�?�c��e�&�p-;�Bp��J�|@ǿ�͵���_GM�GV�
+�V�Z(\U�����g7��|uI at Y����#�W$����檶���|�����q��l�?pl�$@����)Kl�����c������b���݀�{�{v
-endstream
-endobj
-6032 0 obj <<
-/Type /Page
-/Contents 6033 0 R
-/Resources 6031 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6013 0 R
-/Annots [ 6017 0 R 6027 0 R 6028 0 R 6030 0 R ]
->> endobj
-6017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 698.159 228.516 712.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-6027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.773 266.115 508.188 278.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-6028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.522 254.16 418.938 267.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-6030 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6034 0 obj <<
-/D [6032 0 R /XYZ 89 770.89 null]
->> endobj
-5999 0 obj <<
-/D [6032 0 R /XYZ 117.716 204.157 null]
->> endobj
-6035 0 obj <<
-/D [6032 0 R /XYZ 90 199.575 null]
->> endobj
-6036 0 obj <<
-/D [6032 0 R /XYZ 90 87.65 null]
->> endobj
-6031 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F99 5346 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6043 0 obj <<
-/Length 3972      
-/Filter /FlateDecode
->>
-stream
-x��\y�ܶ�?�� �
�yv[�Mbǩ���6(`
�vw�96#�]�����E������4��V�
�������'OO�~z��b�AFR��^&'�$$�5O^N(��ק_'LjD�����Ͽ����oO��N�<=����#�O@ �������8�������[�h�p��w��p��\򂑰W���9B�f'=Dz��4A<&�Z!��*N(C�th�%]z�����K8�X��Yr�"�Tiڪ$J O$Q�"ũW����I��25��<�
-����uȒ�l��� �4
c
�v�L���(6
�o�jR���앜��f����n�UVd[�0��.������b��X��b��m7�^D���U9�$/�+�o�[ }��n�Y���
��
��8C��
�gDi_�_<�ͳ9ڭ
-�
b�h�
ڂ��1վ�Mo_�"m�1�7�
-�t�>
}�Ǧ�c,�j�a�Ri��x������&]��N�Xf�K�
��8ΊaX+f��b��V
��V
/7۲�u�|�$9�b�.s��ZV���:=ϋmzQ����*]��tư��^�]:�S�'��|��������v=��u~��]���uj�3%bRZ{�^a�6�i�“�
��/����`�z��4t\�p�5m�SQ�WP� *y"����)����ݮ��!W�����u�k���Wx,����Е�cR%C��Rgץz��u�n��A�p{q�e�l���
{�q�*z���X��"�L�j�m�.�
-&Q!u$4#F#!s� 7�� _L)�BeY�L����: W`D(x	<���P�;䆣StQFp��fw�����Hr�I8�2�on�2� a�m��Fܓ� CDJd�
-���N���b�n��k>��d۴p
�\�I��Y_�d;��7�Y~��>yV�����
�VS�(_�"��q�_<�1b)D!�j{��G	H�xc� ���h��G;cHS�{����
|����)�I�゚.��2;��c'��6;�;zl3��
��4
{��`_���o��b��1v�І!$�
ud�
b6�)9�(��RHBeY�-/�r�N��=
d�c(�6C�a.�!_]�	`�y�� X�C��|+
H��$�
-��)z
A�@(
�M	���R��9�y���� ݏ�8����Zm�
�h6�#�0�
�1�tT�s4ŻU\C�ϕ���N�N���q��śE^�m��YU����&�u*4Thꆚ��d�9�U
-����=|BH�
WWe�o�[
@�LU��TRh�PW����U��AA�=�e+ 	�U�ZVu�o�Z�8T����?4�����;��
-
��aomZ
)Ɠ~�@�1VD�z
�I!�@(�`X�
zU~��r��Y�ɐ�و���EMb�E���DX�ݺ`�W
�]�r��#jR@:��N3o�ߕ�bD:ו��0�D-Bq^
���e@�g�۴�Y�
-�nɢ��#L
a���uX4×��NyI4	�}ДC���?Nf�($1	
��������j"-
��*�i@���qD�
-i

A&��A�#����=S��%���@of`�\ a`�^�@!ie.�a�����\��
�����B�]�N��vÀ��3!<�W�OaM١J�Ta�;���z>l�j�!�-�+�G��w������Pj_ �;�.d

:��+��0m��
EՀ�Q��"�iWʀ�!3}�	
�l���׆��$ޞ:E�hY��5�f6J�7�:�^Q
�Q�(�
����Z��U�߳
-�M?y$W鍖�$�T�e�B��<QN��iҮ|�F?�[�$bX�
Ec�P�4"
��&!i@�C{S�k��wJ~s��>:�G��@
�|����G�B��[C@�X�vOv�گC��:L��.��;נQSO5d}�qЧ	4@��R��N�D	�z{��.3�줏�3"��<B	�Z�{
x#�S^.��b����
���ڳ������
&YA�G�E=���@�PW�����Ҿh�O
�=;!s���P�4
�o�qUM|��`
�
���X}��#,K����&$
������Y%�5����_I���
^e�[�
bwK�5��${�Sj�])�yD�
i�G@�� �^���p�mB�8���{��8��@|��O�f�HӼ�bY.7o�G�3����#���F����҈
�飋
��=ѸDW��G�~�.l_�@���P
G:�(��F�[�G<@[�`>��_�#��W�-'������Y
�m�}:
����%2���1
;u	m@�6�]pw@���}+��o�\ཌU��b��`��AI�(񛱨���w�҈H>�	ʃLPh���A}�
�Cm��׸5��(W�����n=���	
�ܗ�t%pZM}�C�x-+����?�}
c��Z+�u|�M�c�2�Pp�Y5�ŕ�+W�r�Q_.���r�9�{܅�2��	gZ��t�3a؃�SI�F�`g�h�7_�q��v9l�>��;�a25
����P�r�'���4
�-����tS��-��N�

���*�>wqe2�0��(
��՝z�9��?�k�p1R����#��vϞ���awr�tWy#�3���A�
���O�]
կ:�_��D��
g~ml�@z�W�
���ۡ���+ү:���	#�V[��}X���SLț� 2i4�fL#
-�mWe�^gUV^�j��M	ܽfy��g��>
��n�'Hd� -�|w��/��O���6[�E���w����]�o.i���77я@�
�r���nU`�Y��*+�7��+Aݞ��
����3I-$Ҵv���iK�b	#�fc���ϞX��kk����Ƞ9��|�x�PQ�����S�0��U-�,
�6mi��ȡ��[
-���h
��n�퍪�h1b�Q� �=
��%�A�(7�/~��Y�~v��Kz:l���΃
}��!�m
-�;�ttl��`�RJ����^���-J2��*�gi�6߶E�mQm�8Wf�닢�Kw������A�Yڋ!�$� ��~�Kd��`����)JȯL�0�D���-�
��!����s)q<4c�}�ӕ���ө�d���t���$�ղ ��O^�O��� א$	���M$��ySo"�oa�"
ʶ�('�[wH�e�y�t�g�1���3����N�\W�Ct�#q����_#��_T���
Dž��f��Wi^�G�v�>¨85��Ψ���N��g�0?R�
�j6
���9��]�)}����삧���e��K��>�74�P�Pau��wT	Ta?9�!��M
aoT1�2q�^��rBs*��Ad"\c�Cj���z��6�p��
-�x�p�WD�#�Ձ,A�#����
�d�c0 @Y���
O��=�8cȐN��e�C
@�	�0�
	a&mw��=Z�7��H;WB!���@�w�/V��N���&�f�&^>���
eV'�N4�
*�5bX[
�0�48�wo ���J�’�>�> �D���
pb��K�-v�#
j@:8�pi�`���'������
Sq(�Ց�
;��h,�q�5��èĸ��44�����h�C(�ή��b�^Q��n^
��:��Q�ݧ�cp����
8�
1-���F~�"͒�����.��~1�����F���+���렂�ΆP��1�d�_e˛l۩������ρѨ�h��Xb���k��MxzQxV��K��Z��"_����I�e��'w�`
a�j�
SFx
�MB6[N�2���T����2q:k}r�Y��m�D׋|��P�C�5�
�Uw�
QB�{���n����6[/��	����BL����u�
V�7
>[��
k�̀ެ!X
q ��v��
��3��l�p���s�<��q*Ĥ\��&]�V��٪�
n��ڄ|�Z�=�
��CV
�����f����? J!j�_�ͣ��o��l}�@'}sm^�B7�eUٯ\p�W��]�u��)�tP[+
-endstream
-endobj
-6042 0 obj <<
-/Type /Page
-/Contents 6043 0 R
-/Resources 6041 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6013 0 R
-/Annots [ 6029 0 R 6037 0 R 6038 0 R 6039 0 R 6040 0 R ]
->> endobj
-6029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.418 699.589 525.63 712.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-6037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 532.833 228.516 546.781]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-6038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.773 197.771 508.188 209.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-6039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.522 185.816 418.938 198.758]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-6040 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6044 0 obj <<
-/D [6042 0 R /XYZ 89 770.89 null]
->> endobj
-6045 0 obj <<
-/D [6042 0 R /XYZ 90 582.447 null]
->> endobj
-6000 0 obj <<
-/D [6042 0 R /XYZ 338.866 177.348 null]
->> endobj
-6046 0 obj <<
-/D [6042 0 R /XYZ 90 170.708 null]
->> endobj
-6041 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F35 1248 0 R /F24 529 0 R /F99 5346 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6054 0 obj <<
-/Length 2839      
-/Filter /FlateDecode
->>
-stream
-x��[����~� �X�}?�E�&��$6�:�O�q�I�I�$����wf�O���A7�(r5��ofgf�h��軛��n^�2"r�i���i�hd�#J÷I�~�(av8b����!��8[��o�����,�d����CgO��ߤ�q6dv���������f3OW�Wt��"�l��d���q2
9��S6�p��ͷw7opH#8R��h��y��F��CD�p6��-#�|.��n�uC
�O�^�G!2ЬE��P*#�q2H}7���r��s�s
�s	��K
�f���t�]{���7�IE5њ˛��� ��i�\�-'J
�K#
-d;T|�]���E�I©*hdI4m	6k”|�H;Khm5��FCa��$6:dN%�T�)
� `��	!	��t��HN
@���;���OkD�҃��'�_W��7�d<�>�W���fź�j�ǫ|
�S�A:-��d��$ᄏ����x�.=���&��2�'Żpg�qJ�����M2!�͡�#B_���^���z��<MY¥�Dzg8�}�-z�ѻ.����_r�,�����]`�����W �_������b�4����Q�q[�qS��B�~,dӏ�~ӏ��4͊��b��kr�� ^l�3������a�g�8�'�2���p$��͊Wz�����
�xU��t���f�n�p=������
���))Ě��`����%j�Ԉp9
y/P��)���y^��9���`�wI��V��$w�靖��������y��θ
]M$E������٬0�b�J�l���F ��8I&��E �~3gD*Qқv��* �W�J�u٧���I��v44b�i:ɣ��
A���[�
��tJ+��:��j"NGU��.�� ��Ga�M�#�3 �@��Pc����&�O0*`p�˙���Z�Z0bZ�M�����Z�J�I�>���"�	�
fu�����l�b��+$;

- �
�f}S
0��0a�����$��
�3��ErƮc�cMvcGri���?���f]ë̙?n�l�|�
@v�h�!!!5�O��M1�
rNcE? �8V�;Q0�bz�� e�i(���n�5��ko���e�y�)�����a�b��H*+�DP��@�' A�a�F)��h��l���$�\�M7|��T�Y��9$�<�t��4�\��aE.X������|
�H
u�f�n)�D
Ӫ��.c��C4�e��װ�E�x 
�ZZA�
-ֱrp7�
-;]��Ba��V��/����b{�~SUP�w-i��=�N�u�b�U (������}d̗�P=�3 P`��� ���}���2��

^"��;Q�j�C�.��ˬ�+<��g��p����q��O3
`N����X�|�e�R�Pu���R�=lthA���3Zh�SI�4�Q"�XQ��CM/:�q�I%�!uAa�YE��-�H D6{�Z�Y &]�!�� �4�w���'(Q�Ou�4QP����rP~�6�
�2{%4���D+׆}
-�Ē

-�&��X&`&Ld&���x����D����cY��d�LV�k�y���k�J/:J�]��>0ܿ�N�a

v�9��
v�l����~3�&^Z(�aR���-aՠ�����M��c������
]�����gB��L�;�4�Xf.��.	[��k����&�ۻ��&��n��(?/Π€�GJ��U�L�@Rԝ
�8T�Ψ^8�P�i���8Ĭ��ļZ��tպ̪l�3�xm�
���-e��
-��s�ɇV�`'Ӈ<C�.8a�6�3��lN�ʷ�^�:�l�hr��񧫛Ρ<�S
�>/䶮�!���2'�C�DU��P���|���8Ͳd�/�ƒx�����KP�&,�j|T�_l
��s�k	u���I���nK\+�]�ZZ/z���Ȫ�r�N7���sC*� ���
T
.�OjwCl|�����������I��^`cL�8�P�bn�#C�us
��V
w�e�촳%����¥�8��,լ_�fp2H�e#�
-4��Ђ�&+<�rh�wSF��mm\��Me�1�p���08�X��~��y������Z��Z��u{f��{��.�%*��^�i`'T��ZU��Y��+\�L�1M��z^�
�%\.�a���>q�/=�"�O�񁚳g8D��鼙�+���Q���o&�r�I*�{�X�Ȭ�י�oK_4�p%C�0k1�.���Ł$�ux�w�C����2g�%0c�F�yc	W�Ӎ�&;_�6��@�V)t4(���Ŝ�8
�>���)�k�IA�): [...]
-��m�'[�:��պ?�%h�d���8/L;��~۝QF��������īIW���r�>Թg,���gٮ\��f ���W�%����
^p
�"�� L�Hc���UA�6AE�M� _t�c�P�Cq���Hr�ώG�MJU\ ݪKw�h����["T���|Q�֡s� �tTN�:"~ݡ)Al���AB-*���)�`	x*-�ʺÈ���cvD��Q_u��x-���2
1mЄdj�Kl�>��IB�j�s�Y�*��%=��݄ӝc	 �*�X�[}L��v	^�������g�"\��?����J���pĺ
��,]��7M��5��~
Τ-��v:���l4�[iV��nҪ(
��
2����ּ���?)-c,T�
&�
ĝ��������ߛ$��P�A��7�j[v�pl(���#�q 6�@�?%e:
��%*�~

�����{��Ufy��}��a��푀��6�p�֣�e�����+�����<���W�y�	P��
44~�5����ō��/E�\og�L��
-endstream
-endobj
-6053 0 obj <<
-/Type /Page
-/Contents 6054 0 R
-/Resources 6052 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6013 0 R
-/Annots [ 6047 0 R 6048 0 R 6049 0 R 6050 0 R 6051 0 R ]
->> endobj
-6047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.418 694.941 525.63 707.459]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-6048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 540.141 228.516 554.089]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-6049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.418 353.549 525.63 366.067]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-6050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 198.749 228.516 212.697]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-6051 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6055 0 obj <<
-/D [6053 0 R /XYZ 89 770.89 null]
->> endobj
-6056 0 obj <<
-/D [6053 0 R /XYZ 90 718.816 null]
->> endobj
-6057 0 obj <<
-/D [6053 0 R /XYZ 90 577.8 null]
->> endobj
-6001 0 obj <<
-/D [6053 0 R /XYZ 90 506.069 null]
->> endobj
-6058 0 obj <<
-/D [6053 0 R /XYZ 90 501.585 null]
->> endobj
-6059 0 obj <<
-/D [6053 0 R /XYZ 90 377.424 null]
->> endobj
-6060 0 obj <<
-/D [6053 0 R /XYZ 90 236.408 null]
->> endobj
-1775 0 obj <<
-/D [6053 0 R /XYZ 90 66.932 null]
->> endobj
-6052 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F7 795 0 R /F10 765 0 R /F35 1248 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6081 0 obj <<
-/Length 1913      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ Ї�\�\��CN�l���C����H�BQq��;��-J�k9I��0HQ�3�9�����
���
LF'O�4ҒJor�i�)����i�SL����
�!"Z®����^O
����ߍ
OF�G��
qR�7]����

?�0b:�EK�Sׅ�n����`D����R2�E�B�J4�H��`��x�Ƨ|
e�h[
"$
-ð�ʰ�'C"T�\�W�#���q��	__�Y6 �!�Ǒ�½۴%x�gQ������a�L3��)4G��㈡C�HW���2�^�i�͛	F�G�̈́ #���r���<����SX\��/nIϪ
)p�r�ė\��snuj�!����V[~�IU���k?`� T�AVc�Lz��<t�W�,P�ߚ
_�Mf���i.'O$n�m�$⠸�rĩ#� Z[*������H3w-嗕���Oĸ6��w�oxa�V!I�c�S�L��q+�$�JJ�aO�
Z
-�T
V���
��
-��軇��[��
-qBA-	Q���
t���N�����d���&���};:ޡk�f!�L�K%|�T��Z���e�}:�����г&`�&~���+s3k����|�

��6�:��:�y!���E0S$�e"���5�&KJ��/K�(w酻~ �;{ɰERQD
�w����!��
�ܘ>�����tp�	R��R��ݴ�"Nf�i�S���x��@�+*��q0#��5^lRH+L�qٰ0Ke�(L��Q�O�G�%Y&��S
-�P�L��I�,�; �4����}7��>2Y�S1�b1��hs��z�v[�r$O��[y�B��Ծ�E��
�pD�:���tl�y���ŀ�-p�J/$�Vq$�j�ါR�
�T�.�~`�k6!���)@kQW �D_*�H�Z� �	��
)Dd-�$��Uq�%Q��6�Ski
R���1��cp�r�L��\�m5�J(W�Eڷ�f8�]�C�*��
-u�.�U�
�DOU���h?v
 �
�=)-r�U'�)K�<
�d|�v�+� ��
���,7�����3�
Iƿ5tt�ӆ�
i����E���|���n&݃��ʌބ4�v@#o~�8s�%��>X��!��	��
�m~�����(Th�ם�[�=D���#�G�P!����4�Wy�in �.E�
!C��M�
	Ͷ{D;�-xiv��:
$(E��~Q�C�٩��s�Ş�&Pr �2���ƚM�z��ւ B*	���Rw75G�ˣ��bLtE8���$�����AD	H
1��7�=/���9�S�˻����Ř��<	ӛz��T z��Vۮ�����s�w'��o�N7K��Q ]�*��_��8�&1YT��E�.{'ˋt�Hm����y�s��.�i7y�]@��`;J����46����5*��.X�!ŇO:(�x�1&
���궣�c�P�::"�r�q9�YGG�C�
�`^
;:̋	�k�Bvx�$���T:��ȝ���F7�9����	�qL ��!����t����̖�V�s��4�JJ�U�gsc9
W�T������n"W(��<�UY
w��ZKA�n�f�ۤQlD��oh�
�c�,��
n_9�<��ϊC�}Y������u:<��w�
�A��	�z�w��u�x�_
6� �3�gW[4����q.C�����T��^}`�|�L�z�����@\
-u"H}`-$�D�?
L������׺ؽ�Sd��}-��|���]��"�ޝL��Q�<�
t�7�?��v,��)Tk#����o�>C��*�h�׺/����N�-��(b
� �
��̔�&��k���7/��k���
1.��*J6�¯=�u+�umQ�
-oB~��h�LU�:�>�b��^K
��Fŗy�:=99���e�h
-G��xl6�5�����43�+��e�y[��J�>$
-endstream
-endobj
-6080 0 obj <<
-/Type /Page
-/Contents 6081 0 R
-/Resources 6079 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6013 0 R
-/Annots [ 6061 0 R 6062 0 R 6063 0 R 6064 0 R 6065 0 R 6066 0 R 6067 0 R 6068 0 R 6069 0 R 6070 0 R 6071 0 R 6072 0 R 6073 0 R 6078 0 R ]
->> endobj
-6061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 596.52 225.78 607.424]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
->> endobj
-6062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.278 596.52 245.426 607.424]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_aa1ae2d642bd66d32f64b708c28fbf044) >>
->> endobj
-6063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 568.308 226.029 579.212]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833) >>
->> endobj
-6064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.527 568.308 246.233 579.212]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a603e2a97c5ea7e4e81bad4464a9aba2b) >>
->> endobj
-6065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 528.515 142.752 539.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_ae7432f48686d9fa7923ed66d070988d6) >>
->> endobj
-6066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.069 487.974 211.36 498.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a9eeea4961725654dcc5f4526fa729df1) >>
->> endobj
-6067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.59 447.807 234.882 458.711]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a6ceeebd94402797c5ad4a69f8bb73bcf) >>
->> endobj
-6068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 175.904 214.542 186.808]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a722647b9832d183eedcc441913b25edb) >>
->> endobj
-6069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 147.692 203.643 158.596]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1558ce3303b13a4d17df20c2f4d20ada) >>
->> endobj
-6070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 119.481 239.07 130.385]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-6071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.569 119.481 358.183 130.385]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a5d1e8bb981043726cc2ffacfdd3c3013) >>
->> endobj
-6072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.269 274.328 102.173]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-6073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.826 91.269 427.183 102.173]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_aef17a5e76a36d74b648706582fd2487d) >>
->> endobj
-6078 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6082 0 obj <<
-/D [6080 0 R /XYZ 89 770.89 null]
->> endobj
-210 0 obj <<
-/D [6080 0 R /XYZ 90 721.073 null]
->> endobj
-6083 0 obj <<
-/D [6080 0 R /XYZ 90 615.672 null]
->> endobj
-6084 0 obj <<
-/D [6080 0 R /XYZ 90 615.672 null]
->> endobj
-6085 0 obj <<
-/D [6080 0 R /XYZ 90 585.726 null]
->> endobj
-6086 0 obj <<
-/D [6080 0 R /XYZ 90 557.514 null]
->> endobj
-6087 0 obj <<
-/D [6080 0 R /XYZ 90 517.347 null]
->> endobj
-6088 0 obj <<
-/D [6080 0 R /XYZ 90 477.18 null]
->> endobj
-6089 0 obj <<
-/D [6080 0 R /XYZ 90 419.098 null]
->> endobj
-6090 0 obj <<
-/D [6080 0 R /XYZ 90 369.93 null]
->> endobj
-1776 0 obj <<
-/D [6080 0 R /XYZ 90 300.805 null]
->> endobj
-214 0 obj <<
-/D [6080 0 R /XYZ 90 294.007 null]
->> endobj
-6091 0 obj <<
-/D [6080 0 R /XYZ 90 195.056 null]
->> endobj
-6092 0 obj <<
-/D [6080 0 R /XYZ 90 195.056 null]
->> endobj
-6093 0 obj <<
-/D [6080 0 R /XYZ 90 165.11 null]
->> endobj
-6079 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F22 2996 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F39 2320 0 R /F110 1507 0 R /F67 3037 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6108 0 obj <<
-/Length 2199      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�Vj&��~��$��5uwzH2
Y�eMeҥ���] EP�DEt�
2�hw��o?�8ZD8�a�����J�� #��n�#�#�
>ͣ1����`���1��4��^�)��՗�d�OoY��������,��c��Hn������e��ތ��<%�	8~������]r����
�W*,b�����O��7��GL�q�	�t4{
}���9|�S�3:ڔ�
#N�]E�G����%n�V��n	��3
)B!n�)���ϭ�|��x��(�0���t��oL�dLD�Hrئ�v���}�_%�G�Y6�"�
j�q�.B
+0��
�">b��q��e�h�v/�
�48Cr�
J��4�������9O}����&�go��}w�<L?/�ܯ�o��o�}(��q��r���NH��^{���q�MSC�(؅
v�rqEn,�Hb]-*
�k�(�5A��j
-
�ʖ	�-�E
qsj�\��i�L��8��ʆ2�j*�%F�l'�p����*���Po
u�Kk�"Ƙ"
-��c�#ƴ_��
d�8
bл,[����췟_*<̙��!��^�����c�Z���Lm�}���iZ���|�T��!dk�2M��E�
-k��SւAP[n�
+� bҨ�����*^UM
��B���tV $��l:�ЮAO(���p<�N�ވ�c!����\�>^�VBG�nc�� �5�0t�i#��]r7�?^
H;L+��
-�KY�K��n���$�^�Ү�̓���9��EtC^Y:=�pD`����N�Y���Y?e�nrE�՜��P=u{�TAmW�D����ٚ�+�H�*\�z��;mHR-� ��W٦Cg3�!G��>��X��c�Y�څ�����R��^�ƾ�p{a�i�	�ڢ�v�h�� �U{<:
ft	��ՠ�x"�&)��UYp�o��,_>�4�Vna+	����5��W�ȴ�2y��a�VgQ�������A���d����&jk���G�! e�C�*��ꚪcV���-&�Q���d ��%�ۥY�0���p�����Ea65�*�U��hl���8��jF�;�	�
�5�1��s�`$4���D�i�i�c���d38��b&4c��:t
��
F�0��P�͘k�3nD�0*8=�./+\ܱ�6!!P`��9��U��ĕ�
�

?Z����[J1�nj]"x����%�
-
�\��j�! �V7�
����!4�$��Itѐ�0��n���j�&�3

� ��?w�Ne��nTZV����q�Gy�CC�"��/�;?�]��h��
-B.۩6���d���D
O�A��T�Ì�߱ݞ%Hi����	̝��
��c�C~���y�x;Ҭhz2 ��A��K�	
s�B(��e)�;l
�aG�H)��L'(�9'"���$���
-:��d�¨X �o�r%Z�z?����A,����j�T���R�Q��
-��覐{R�Pwc�
-�W�&1�	�����XŠf�d�
(��-�wccaI�
-� jm��	�ԃ�XyԲ_�C-� �I���^�ѸƤ�W���,�H�q�@�elG�
��7�:�Y:�,���e��p} ��.�▱�>��!,��
��0�p6�0P�0
�
�eC� HI��+���CX��d�L`�Av%a�'��VַT��S�Iq2��̵���Bm�:�]
��bW����j��]Z�Ar]�$ޜN� ���Q-{�Ca��s�����$��!g{kzX
k����@��@���Yu���;�����v{��>T�J��(4��VgU���і���[�͢���B���D-�$��
bP��Ќ��%�Q�핓j�޲��uî؅w޹Vhh��Vl�i��/���V@�����(.�X ���+���xy�t
-j���>t/�
F�*��#6�����0�H��߉���>��z�����t��-=�a��I>-*����N
-�Vnبʹn]%���f�"�D���W�OO+����~�O”���M��ͽ�$��P�F��u}��{�c��ߍ���'~����ո����ֺ�*t5[�h
C
-��'��3���z�yTfO�"�v�:
�������y�N����w���` J7�a�1�Y^��㊼��On{"LS�V� g�=*V-W4����~迸��Eo2p��e�D'�
-endstream
-endobj
-6107 0 obj <<
-/Type /Page
-/Contents 6108 0 R
-/Resources 6106 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6123 0 R
-/Annots [ 6074 0 R 6075 0 R 6076 0 R 6077 0 R 6096 0 R 6097 0 R 6098 0 R 6099 0 R 6100 0 R 6113 0 R 6101 0 R 6102 0 R 6103 0 R 6104 0 R 6105 0 R ]
->> endobj
-6074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 251.793 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-6075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.291 707.957 383.08 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a67bee18b81c21e09116b7423b3465a2a) >>
->> endobj
-6076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 678.985 208.754 689.889]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
->> endobj
-6077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.252 678.985 298.695 689.889]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a7d15247c02efb42a971a2cddbd7ff70e) >>
->> endobj
-6096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 650.386 150.493 660.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_abf158dc171228668bd20a36339b60f10) >>
->> endobj
-6097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.834 577.678 248.703 588.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
->> endobj
-6098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.604 577.678 317.406 588.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a0c0e22bb6388967d928cb6cde46b9196) >>
->> endobj
-6099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.623 577.678 445.784 588.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-6100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.882 577.678 513.996 588.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-6113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 565.723 238.353 576.627]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-6101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.27 565.723 438.152 576.627]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-6102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 536.751 249.301 547.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
->> endobj
-6103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.799 536.751 307.702 547.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1b95213b929e61be2683bf1d9c220d70) >>
->> endobj
-6104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.517 536.751 406.361 547.655]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
->> endobj
-6105 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6109 0 obj <<
-/D [6107 0 R /XYZ 89 770.89 null]
->> endobj
-6110 0 obj <<
-/D [6107 0 R /XYZ 90 667.811 null]
->> endobj
-6111 0 obj <<
-/D [6107 0 R /XYZ 90 597.126 null]
->> endobj
-6112 0 obj <<
-/D [6107 0 R /XYZ 90 597.126 null]
->> endobj
-6114 0 obj <<
-/D [6107 0 R /XYZ 90 554.549 null]
->> endobj
-6115 0 obj <<
-/D [6107 0 R /XYZ 90 506.806 null]
->> endobj
-6116 0 obj <<
-/D [6107 0 R /XYZ 90 448.485 null]
->> endobj
-6094 0 obj <<
-/D [6107 0 R /XYZ 90 425.867 null]
->> endobj
-6117 0 obj <<
-/D [6107 0 R /XYZ 90 425.867 null]
->> endobj
-6095 0 obj <<
-/D [6107 0 R /XYZ 399.149 356.739 null]
->> endobj
-6118 0 obj <<
-/D [6107 0 R /XYZ 90 350.099 null]
->> endobj
-6119 0 obj <<
-/D [6107 0 R /XYZ 399.149 270.99 null]
->> endobj
-6120 0 obj <<
-/D [6107 0 R /XYZ 90 264.35 null]
->> endobj
-6121 0 obj <<
-/D [6107 0 R /XYZ 399.149 197.195 null]
->> endobj
-6122 0 obj <<
-/D [6107 0 R /XYZ 90 190.555 null]
->> endobj
-1777 0 obj <<
-/D [6107 0 R /XYZ 90 68.978 null]
->> endobj
-6106 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F90 758 0 R /F75 554 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6165 0 obj <<
-/Length 1731      
-/Filter /FlateDecode
->>
-stream
-x��Zko�6��_!`@g5Ç(Q�2��cX�G�z���"3�PYr%9���w)�i˲�8i
jJ"��s�}�6�6~
�2
��p��"צ�1�6\l8���
W3�Øb��8}i0[ ��0*������7������t�yD�6���#G�r��#6fp���s��%�4,��74ޏ����(WM�SXs�\�ii\�M Г��1
���{��۵�p	!�
�}V1ąS��a�1�
�2��dt
�&!��BΒ(�
-m�iZ�*�J�Ĝ�����i
͓��|iN(㧡����N^��X&�Ced���
7$0!T�dB-�,W��	L��8
"�^��~�.��%��4&r�M-=�� ���L�`{ݓ3� ��~��A ʲ�j�Ţc
Ƒ�y��g�Ɩ�r8+u
djLE�@�����רMM
�]ɴ�
舍,& 8�x1���5��0� �
�#���I2/��.�~��}���U"�4��-#�
�׿���
,^��Lt��:�3x��p�\�B�!�-
�Z/0�{A�+$d�y�6���l�h��co
f�I�L�
-������)�-
����g���,Y�Y��*[H����u�7

���B�ҕWޜK��+/�
���;+��>-3�ߒ��
��H@��>>�����M�'y���B���d yɦ�`U�
-�� 9U1�B��>�z�?~�?�
-kQ�B�;:�~p�1�3}#'
�*��
\�� ʺ��;�Ah[m&�V|S�,��:�����!o^'����R_��k/
��"L��%d��� ʪ��w6��׈
y�u\;yO=�@�]U.�Ѷ�.U�TV
��PB �R��㙼m�:r`ԯ�x%�<��P�����@q5� �ffeo�̇@������

��jg�-:�d�N��j�_':B��u�����ODӿ��
f�ބY��[��N�'[i?Ćݕ8���7&ۂY��Ry �
�p�c�iZ�
�di� 4
��h�\�
o�~�t
$qr�l]U×j�5�a�b��UG߇Lj>���^�D����ˣF�!/�� �w��ȱ�]jۙt��]����
�L�?� �U�ڄre
��ǥ�����4�\�u���A{��w¿�X�%�wvf�����jD4VЊ�mʠ��DU��
��Q�:��!b�6�ڠäA���K���#I#��2��H���2���dDm�*���?mN�G�ԓ	a��
��T91�a��7
-��!��62ث�2���
�@�NWj�W�(���{�� 7���۩g�#�	c�ž�#٪��*�ޥ{
��`�^
� ��2t��t��;X��t��b��]���|

�"�>�1l��7�,��
��OG"�{&��է=Y��Y�1�Q� ^�ۆ���b�U
�R4�eo��a<�q(�w1������
(UuEZQ�{Q�ባ�8�
-���
$�s���̨K�v>+��ˍM} �N.����2}�6e1������Ž�n�
Q�� �z���qX-
�F�^�~JX%*�_���J�_|�
ȶ
�cz��\W�^&��{��?R�����ذ��J�A�W�� {�$A��oD�9��\�y�&N�
��v��
S�8�mɌg1LVO7��&����v�/
-v� g�'�pZ�v~�J7�Le����`�P�g�(��I}�C�^3a���R�ڮO�ٿ��� ������e�ӓ���<��
��rW�ݽ��S�}���2N��(�\v��y�#�
-endstream
-endobj
-6164 0 obj <<
-/Type /Page
-/Contents 6165 0 R
-/Resources 6163 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6123 0 R
-/Annots [ 6124 0 R 6125 0 R 6126 0 R 6127 0 R 6128 0 R 6129 0 R 6130 0 R 6131 0 R 6132 0 R 6133 0 R 6134 0 R 6135 0 R 6136 0 R 6137 0 R 6138 0 R 6139 0 R 6140 0 R 6141 0 R 6142 0 R 6143 0 R 6144 0 R 6145 0 R 6146 0 R 6147 0 R 6148 0 R 6149 0 R 6150 0 R 6151 0 R 6152 0 R 6153 0 R 6154 0 R 6155 0 R 6156 0 R 6157 0 R 6158 0 R 6159 0 R 6162 0 R ]
->> endobj
-6124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 611.381 223.528 622.285]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.026 611.381 270.292 622.285]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae79e04eb36dcf5595f3c664093686c3f) >>
->> endobj
-6126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 556.778 164.042 567.682]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.858 556.778 229.615 567.682]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.05 556.778 330.028 567.682]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 529.153 164.042 540.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aba7dbedd485eab91821f129132a04723) >>
->> endobj
-6130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.379 529.153 241.511 540.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 501.527 164.042 512.431]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aeb05cfafe5dbcb57a7f831180204ef7f) >>
->> endobj
-6132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.379 501.527 241.511 512.431]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.146 501.527 325.904 512.431]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 473.902 164.042 484.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aef9838273809d695f9c52a96b37123b6) >>
->> endobj
-6135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.379 473.902 234.885 484.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.539 473.902 314.297 484.806]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.731 473.902 414.709 484.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 446.277 171.791 457.181]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ab45e800217e1c61d8595e2ffc51a83ad) >>
->> endobj
-6139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 418.652 164.042 429.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.782 418.652 215.588 429.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a95560c356a7aa70cccb41b866a8455c0) >>
->> endobj
-6141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.925 418.652 293.057 429.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 391.027 175.668 401.931]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 391.027 234.596 401.931]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ad76648f21279e7e7c852cfc1daa1887f) >>
->> endobj
-6144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 363.401 208.395 374.305]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a42e13324ee4f4b86975c282078a646fb) >>
->> endobj
-6145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 363.401 273.968 374.305]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 335.776 179.554 346.68]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 335.776 250.666 346.68]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a584cb5084fe5479b0c373e3d17fe5ffd) >>
->> endobj
-6148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 308.525 297.728 319.055]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a79c648d88214174287e3763b804f4aaf) >>
->> endobj
-6149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.544 308.525 336.732 319.055]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 280.526 342.261 291.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a3c9879f0c9dcb81fe1bbf78828509ef6) >>
->> endobj
-6151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 253.274 290.247 263.805]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a39b6f38fff55dd953ec509b3739dd17d) >>
->> endobj
-6152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 225.649 186.278 236.179]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a11d3ecf7df43ab6f40620de32004f339) >>
->> endobj
-6153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 212.833 155.823 223.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a844aeb45177c00f4d4ad0755509d9e69) >>
->> endobj
-6154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 184.834 164.042 195.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.782 184.834 218.358 195.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aa03b119140132112557907b772102b33) >>
->> endobj
-6156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 157.209 194.776 168.113]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae96eebded76c559c95910dc233c68f06) >>
->> endobj
-6157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 129.957 195.334 140.487]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ac26379e5f82fd0223682b11b9e052ea5) >>
->> endobj
-6158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 101.958 224.634 112.862]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a29c6deef0eb3911adbb08d36a8f0b3f2) >>
->> endobj
-6159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 74.333 179.832 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a6609e54e84d50cd074c2dd65f38b47da) >>
->> endobj
-6162 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6166 0 obj <<
-/D [6164 0 R /XYZ 89 770.89 null]
->> endobj
-218 0 obj <<
-/D [6164 0 R /XYZ 90 721.073 null]
->> endobj
-6167 0 obj <<
-/D [6164 0 R /XYZ 90 628.242 null]
->> endobj
-6168 0 obj <<
-/D [6164 0 R /XYZ 90 575.636 null]
->> endobj
-6169 0 obj <<
-/D [6164 0 R /XYZ 90 575.636 null]
->> endobj
-6170 0 obj <<
-/D [6164 0 R /XYZ 90 518.652 null]
->> endobj
-6171 0 obj <<
-/D [6164 0 R /XYZ 90 463.402 null]
->> endobj
-6172 0 obj <<
-/D [6164 0 R /XYZ 90 437.502 null]
->> endobj
-6173 0 obj <<
-/D [6164 0 R /XYZ 90 408.151 null]
->> endobj
-6174 0 obj <<
-/D [6164 0 R /XYZ 90 380.526 null]
->> endobj
-6175 0 obj <<
-/D [6164 0 R /XYZ 90 352.901 null]
->> endobj
-6176 0 obj <<
-/D [6164 0 R /XYZ 90 297.65 null]
->> endobj
-6177 0 obj <<
-/D [6164 0 R /XYZ 90 270.025 null]
->> endobj
-6178 0 obj <<
-/D [6164 0 R /XYZ 90 229.634 null]
->> endobj
-6163 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6244 0 obj <<
-/Length 1940      
-/Filter /FlateDecode
->>
-stream
-x��ZIs�8��W�!�" 	.�������'�t�.MA+\������@�F��%9UsH �X��
 6f6~
��~t�γ� .u���`�s�\�kb|2	F�Xc�16�,��HdQxgQl�r�'"
-�'"���"����1�Ɣa�&��Ru?�)�M����&�������O���#a�(
-�|#�F����~����|����M�����p��v�0؆̹�d�� a��A�(�>�y)ɸzG^mcDlK5+`L��X���s�
�L��_�!J==�3�v�fr�2��<)��j%��_�(M��Ř��jA =xM�cB(p�@�� ���L)ۘ��!f�Z>�<2>�� �Y!�a����j��ó$yUQEi��M��aY�rcj;�3f��U\�e����jS8��
���r��T�O Ħ�P���j�k�9�V䪮dT��VԊ��[L�&*ۏq\/>ѳz�A� y�
o
1��
F�M|���� nf~���_~:U�\�Y�G����K|\�������|���j�(���=����6ԛ9�eH��
-?i���@S6#�Dy�-[X�gj�FUR��)�
�H�q��
�x�L�)*�$	'u�����I�S�\}�
F��KYM��c.D�FnO
K�����Vu�l�)y^�|����]��ZXp�x�'�����c�몳�kQV�G��ț�{��G~
r)�>�=�/#����95�I^]8���=ʾ�� �sq#�GI ��l?P�I>�[��zݖł��*��\o�~a���?��ҲW���y�`
h��N
hʴ�"�
4�Ǵ_���Wk�Sa9�,�^�{�%�z;��t�� �7d���������,,���v���;�\�y{�Y�4m��-z]C�L!vÅ<%ռo%��[�9d��)/ ���㰬���]�
e(,��=<�d</�0vK�vD�-�̧�\D1�� �X,�
s��u�ۨk��Y�8Qٯ�!ҧ1
!gȋ�OU4��p�k��g]qJ�8������o��!�G!A�i���k�� 0
@�\�H�u#A�+~�3&|ڄ�:��r��qe�KP U{#�P
�����1֋\�n���>�y$Ÿ�I��=��&�o�S���K�	0J
W%��R������!r6h��<XZ�)o�E]
��Y&�i���~����mG(;���.Ʀ}G�C��
i��2u%�bR�u�Q6���zjvR��C
�
�����k���c�w�b�㡇�ʏd O�+�S�r�M�
K� ��"��A>�d�*��>�WE�#���e��ʇI�B
ҽn�#
\g 0�F�'m%����|�
�%�zY|V6�ɴz�[.3OO����<n ��a^�,J�����߿��W��|���˰��p����̋�X�h伨����^[0r!
	/*��(M[W� �o;��:�~L&ݭ����2�dO�X
��d
!D��D6
1���%�ئP�;mP�I^
�Q߼�,�L����졹����:��
�G/�E��F=$8��R��R���`%�v��>E���{�y���`�tJ-��9U��p��XJ�
-v��$yR%3��n��F>������)�X�x'��$?
���~Rrx�_\�0Cy
,�;��Dؙ�͘|�!U
�wA�m
->���[
��qӑOo����nj��
�i����94ސ
��ݸ��wJ�%
�Ǝ�?�p`=�W&��&�K۱���-�]��U>
1����e�ʗ�x�[��w���P�;D��c��[Sk4�@8R/J+-[���~B�R�Q��'T�S)w�����Z��k��ݽW���\�M�5j
�(��E�ݣ$����%��!R~����/���*����r�Alu[8������C=+y>CqW���l����B�ʢK}�2��N�@�Z�
�TK��b;&�G���棞��pu���?
���� 
i�*
-endstream
-endobj
-6243 0 obj <<
-/Type /Page
-/Contents 6244 0 R
-/Resources 6242 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6123 0 R
-/Annots [ 6160 0 R 6161 0 R 6190 0 R 6191 0 R 6192 0 R 6193 0 R 6194 0 R 6195 0 R 6196 0 R 6197 0 R 6198 0 R 6199 0 R 6200 0 R 6201 0 R 6202 0 R 6203 0 R 6204 0 R 6205 0 R 6206 0 R 6207 0 R 6208 0 R 6209 0 R 6210 0 R 6255 0 R 6211 0 R 6212 0 R 6213 0 R 6214 0 R 6215 0 R 6216 0 R 6217 0 R 6218 0 R 6219 0 R 6220 0 R 6221 0 R 6222 0 R 6223 0 R 6224 0 R 6225 0 R 6226 0 R 6227 0 R 6228 0 R 6229 0 R 6230 0 R 6231 0 R 6232 0 R 6241 0 R ]
->> endobj
-6160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 695.051 191.718 705.955]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-6161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 695.051 288.852 705.955]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a484373d269a31c21efae44a83f8be6f0) >>
->> endobj
-6190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 667.246 191.718 678.15]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-6191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 667.246 303.079 678.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a0ff04e47054c14b2edf29096ecc95ab7) >>
->> endobj
-6192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 639.815 150.493 650.345]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a33e6005a1fe40cb202eb619912c25c3c) >>
->> endobj
-6193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 611.637 181.845 622.541]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a43983a6ee447e480f8700915bccb4811) >>
->> endobj
-6194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 583.832 181.845 594.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ac53e4323b140cdd4ba1ac96e7204d93a) >>
->> endobj
-6195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 556.027 154.727 566.931]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a146b211f83e22bd011d3de2e5975073b) >>
->> endobj
-6196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 528.596 176.505 539.126]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a94b3624c208219e401569cd289049b38) >>
->> endobj
-6197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 500.418 169.013 511.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ad8229aed551687502c5af78a4143254f) >>
->> endobj
-6198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 500.418 222.961 511.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 472.613 164.042 483.517]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a77a4ec4e4b5b11f3ce61f6c6701d8a7d) >>
->> endobj
-6200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.379 472.613 241.511 483.517]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.146 472.613 329.789 483.517]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 444.808 164.042 455.712]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_afd55d0cb3ab31c5e800c18eb849aa295) >>
->> endobj
-6203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.379 444.808 241.511 455.712]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.146 444.808 329.789 455.712]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.22 444.808 486.978 455.712]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 417.003 164.042 427.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aed38df906a6f7c01305168df91d7d095) >>
->> endobj
-6207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.184 417.003 233.69 427.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.249 417.003 320.892 427.907]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.248 417.003 477.005 427.907]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [485.842 417.003 513.996 427.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 405.048 177.322 415.952]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 392.142 164.042 403.046]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aba9d8397055aa341d1ffc6702f67e60f) >>
->> endobj
-6212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.858 392.142 245.107 403.046]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.285 392.142 478.23 403.046]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-6214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.96 377.567 257.863 387.472]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 364.337 233.76 375.241]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a9aa9789183ac22bcb28a092c3e1f804f) >>
->> endobj
-6216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.575 364.337 272.763 375.241]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.205 364.337 323.393 375.241]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 336.533 220.579 347.437]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a07bb90eb18242945afb161e4deadb09e) >>
->> endobj
-6219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 336.533 290.038 347.437]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 323.626 231.1 334.53]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_af66a2692f29cc03aa773c48a2cc644ab) >>
->> endobj
-6221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.915 323.626 270.103 334.53]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.916 323.626 345.559 334.53]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 310.72 197.337 321.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a6a24743a95176da13995bb6c17151c9b) >>
->> endobj
-6224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 283.289 175.748 293.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a29c63b939ed830a0395170835e60beaf) >>
->> endobj
-6225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 255.111 205.636 266.015]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_afcf86304f17dc474e1e5bbe0486c1b59) >>
->> endobj
-6226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 185.439 203.075 196.343]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 185.439 296.324 196.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a5a207ecd92e9fd8f3b1937a5064746a9) >>
->> endobj
-6228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 170.863 322.825 180.768]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 158.007 194.297 168.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ab917a480b6afe7e2750aa2862c6783cf) >>
->> endobj
-6230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 130.203 188.759 140.733]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a2ca2446f563956eb2b92ddd17e5c0b2c) >>
->> endobj
-6231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 102.024 211.085 112.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.824 102.024 307.233 112.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ad07dc0dabac5685f9db8d9dc11e513f1) >>
->> endobj
-6241 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6245 0 obj <<
-/D [6243 0 R /XYZ 89 770.89 null]
->> endobj
-6246 0 obj <<
-/D [6243 0 R /XYZ 90 712.265 null]
->> endobj
-6247 0 obj <<
-/D [6243 0 R /XYZ 90 684.461 null]
->> endobj
-6248 0 obj <<
-/D [6243 0 R /XYZ 90 656.656 null]
->> endobj
-6249 0 obj <<
-/D [6243 0 R /XYZ 90 628.851 null]
->> endobj
-6250 0 obj <<
-/D [6243 0 R /XYZ 90 601.046 null]
->> endobj
-6251 0 obj <<
-/D [6243 0 R /XYZ 90 573.242 null]
->> endobj
-6252 0 obj <<
-/D [6243 0 R /XYZ 90 545.437 null]
->> endobj
-6253 0 obj <<
-/D [6243 0 R /XYZ 90 517.632 null]
->> endobj
-6254 0 obj <<
-/D [6243 0 R /XYZ 90 462.023 null]
->> endobj
-6256 0 obj <<
-/D [6243 0 R /XYZ 90 381.552 null]
->> endobj
-6257 0 obj <<
-/D [6243 0 R /XYZ 90 204.302 null]
->> endobj
-6258 0 obj <<
-/D [6243 0 R /XYZ 90 204.302 null]
->> endobj
-6259 0 obj <<
-/D [6243 0 R /XYZ 90 174.848 null]
->> endobj
-6260 0 obj <<
-/D [6243 0 R /XYZ 90 148.115 null]
->> endobj
-6261 0 obj <<
-/D [6243 0 R /XYZ 90 120.31 null]
->> endobj
-6242 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F67 3037 0 R /F90 758 0 R /F66 3179 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6333 0 obj <<
-/Length 1590      
-/Filter /FlateDecode
->>
-stream
-x��Z�s�8~�_�=\
3�"		A�y�����zm.�=��
�����Ms��`�!�/Ӧ}��Z�~��������W��&����6<�9�1&��
�<�
�75ޛ;���k�v\D<F�_�{;9z;9Um�����@6���p�`1z�Sx�����\��0��:7NG�p�
^���k:� f�� ��@)/&����
c3��,
�1��
�(��NJ�dV�xRtW]^��,�e�Ma�������$>����
�`ӟ��B>`��Gm�u��g.��aj��"�QcL
��+=�Y�D�^��/�e
S^H}U�����^�.
-�j5 at a�q3
��2J�8�m��d�ce�5��3�u���0
q�y�.�	�\
��kN���l���Ƃ9�
-��0԰�
-�6e�9�:
q�
��]��ޟyf�H?��q�@��0�~rv�u�ȴ0�$ٳ�|���r�H��]̉T�e���"�]0��&��\:�P79�mN���|��%�-�̡�'������
�51�@
���`�uYՁht�HE\��I�;Ю !
���
 D8H�*@�=��
�uH  �� �T�a��
�*�!@�,K�0K�� r�!��£mA � ���2�tA�1`��AІ~�Vg�E��
^K�Q�i��N��q2�@L�K�U��
�{c��V��O�w��
��H��z�-l\d���<�\YC]
-�4��r��c6�8u��ӊ���r��[œW�gY�[��y&��7����`U�a�]�nPt�
����vN����
�Za9/�=�@���R_Vzmy*�%�}I�+k���C�n{(s��'r9h���2�5y�-ob�Uw�ҷqV
#.�������'�M��
�8��z.�9эx^�H \��(:���v��K��Y�

ޕ������� y}����LoE� �'
��]��
4h�(NjN�R‹ґQ	�8�_�;hj��	������e�
Z���)�#ǫ���Rw�ui���<���!�z8 �L��8�p���!&n	�����)�C��s0r�;�gN�4j�����*�U�kT�lDpm�g϶�I���hQ%�����{�.���o��l����2��
#�&�n�F��m�h]�rϭ(��w~�OB�M�g�sJ��؃���
-�_q���]Bn���Ï�����
-�W��X�p

-F���	fw�ϧ]�	�e�5�V�� Id���Y�#	�\�(����f��_�Ѭ���tP����=���K��S���WNO�y��Q^��:
�G�BD����n0Z�gw{�����!M(����[��l� �C���R���k�
T.�*�.ۄ��d%l�ˇ73�@���FC�������vצWEafم��Ba�1i�g#U��I�B��v�}
�:�Ŗ�ݙ�Av��*Ώ^
���S�j�Ƕ!o~<�P8��C?
[���W|u�y�&BТq��h�Ɣ��X���1[����J`�I��A�%��*�4�
��7��2yjq^1���(��ﱾ���LVbT|(��	�;���^�j��T���F��k^x�e˃���|��h��\����`��j��jW�|�
.�7Zh�y��]��
-endstream
-endobj
-6332 0 obj <<
-/Type /Page
-/Contents 6333 0 R
-/Resources 6331 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6123 0 R
-/Annots [ 6233 0 R 6234 0 R 6235 0 R 6236 0 R 6237 0 R 6238 0 R 6239 0 R 6337 0 R 6240 0 R 6270 0 R 6271 0 R 6272 0 R 6273 0 R 6339 0 R 6274 0 R 6275 0 R 6276 0 R 6277 0 R 6278 0 R 6341 0 R 6279 0 R 6280 0 R 6281 0 R 6282 0 R 6283 0 R 6284 0 R 6285 0 R 6286 0 R 6287 0 R 6288 0 R 6289 0 R 6290 0 R 6291 0 R 6292 0 R 6293 0 R 6294 0 R 6295 0 R 6296 0 R 6297 0 R 6298 0 R 6299 0 R 6300 0 R 6301 0 R 6302 0 R 6303 0 R 6304 0 R 6305 0 R 6306 0 R 6307 0 R 6308 0 R 6309 0 R 6310 0 R 6311 0 R 6312  [...]
->> endobj
-6233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 707.957 211.085 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.824 707.957 285.136 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) >>
->> endobj
-6235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.427 676.814 187.559 687.718]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.052 676.814 213.825 687.718]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a016c2304fe3a1a73988eb83b2ccf1fe9) >>
->> endobj
-6237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.153 676.814 318.403 687.718]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.546 676.814 441.796 687.718]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.423 676.814 513.996 687.718]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 664.859 131.405 675.763]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.839 664.859 231.817 675.763]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.278 633.716 187.41 644.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.755 633.716 213.528 644.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a5f3003416d324720351da9235a0a3802) >>
->> endobj
-6272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.559 633.716 317.808 644.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.896 633.716 513.996 644.62]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 621.761 151.877 632.665]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.312 621.761 252.29 632.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.278 590.619 187.41 601.522]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.755 590.619 213.528 601.522]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ab6054ead00332969adad17cdf785088b) >>
->> endobj
-6277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.268 590.619 467.518 601.522]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.896 590.619 513.996 601.522]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 578.663 151.877 589.567]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.312 578.663 252.29 589.567]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 501.229 222.711 512.132]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.209 501.229 314.187 512.132]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
->> endobj
-6282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.794 501.229 361.329 512.132]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-6283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 396.515 180.54 407.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_adeee840f3313b6050d439dbe5fe2fdd7) >>
->> endobj
-6284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 396.515 258.009 407.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.742 396.515 349.874 407.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 365.372 178.239 376.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aaf7dc46b2cfbd6650ac1d2035d331f15) >>
->> endobj
-6287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 365.372 255.707 376.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.441 365.372 347.572 376.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 334.23 226.034 345.133]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae0c9395c1ac4d96e245be43fcd76424c) >>
->> endobj
-6290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 334.23 371.308 345.133]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 303.087 164.042 313.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 303.087 213.646 313.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849) >>
->> endobj
-6293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.983 303.087 318.232 313.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.389 303.087 441.638 313.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 271.944 164.042 282.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 271.944 213.646 282.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) >>
->> endobj
-6297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.983 271.944 318.232 282.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 240.801 164.042 251.705]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 240.801 202.497 251.705]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aa948df90fc7880e7e52ceef297ee9bbf) >>
->> endobj
-6300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.835 240.801 279.966 251.705]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 209.659 164.042 220.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 209.659 202.497 220.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a2cb39e7c88e9e724e7970d0e953f2c81) >>
->> endobj
-6303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.835 209.659 273.341 220.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 178.516 156.281 189.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a408ca35042312cfb3c8fb63d41ed2bf5) >>
->> endobj
-6305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 178.516 210.229 189.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.44 178.516 278.572 189.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 163.941 164.042 174.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 163.941 213.646 174.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849) >>
->> endobj
-6309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.983 163.941 318.232 174.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.389 163.941 441.638 174.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 149.366 164.042 160.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 149.366 213.646 160.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) >>
->> endobj
-6313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.983 149.366 318.232 160.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 134.79 164.042 145.694]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 134.79 202.497 145.694]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aa948df90fc7880e7e52ceef297ee9bbf) >>
->> endobj
-6316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.835 134.79 279.966 145.694]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 120.215 164.042 131.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.54 120.215 202.497 131.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a2cb39e7c88e9e724e7970d0e953f2c81) >>
->> endobj
-6319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.835 120.215 273.341 131.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 105.64 180.54 116.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_adeee840f3313b6050d439dbe5fe2fdd7) >>
->> endobj
-6321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 105.64 258.009 116.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.742 105.64 349.874 116.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 91.065 178.239 101.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aaf7dc46b2cfbd6650ac1d2035d331f15) >>
->> endobj
-6324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 91.065 255.707 101.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.441 91.065 347.572 101.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 76.49 156.281 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a408ca35042312cfb3c8fb63d41ed2bf5) >>
->> endobj
-6327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 76.49 210.229 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.44 76.49 278.572 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6330 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6334 0 obj <<
-/D [6332 0 R /XYZ 89 770.89 null]
->> endobj
-6335 0 obj <<
-/D [6332 0 R /XYZ 90 721.073 null]
->> endobj
-6336 0 obj <<
-/D [6332 0 R /XYZ 90 695.29 null]
->> endobj
-6338 0 obj <<
-/D [6332 0 R /XYZ 90 652.192 null]
->> endobj
-6340 0 obj <<
-/D [6332 0 R /XYZ 90 609.094 null]
->> endobj
-6342 0 obj <<
-/D [6332 0 R /XYZ 90 521.761 null]
->> endobj
-6343 0 obj <<
-/D [6332 0 R /XYZ 90 444.411 null]
->> endobj
-6331 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F66 3179 0 R /F67 3037 0 R /F90 758 0 R /F110 1507 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6365 0 obj <<
-/Length 2539      
-/Filter /FlateDecode
->>
-stream
-x��Z�s۸������`  ҙ
��d��t�M�^�;.E�[��I*�����$HA��l����!E< ���'x
/�~������{A�Ŝp��ދO�1b
�ͽ�>��)������O�urw3!�_�v�l^%w�Y�T�����bQm�"�&S���UR���cv�U
�zSp�b���O�n/
.0pxXs����t}������㟼 �8�
��
	����t�׋�
8e�V^��`���0F['C�پϚ$_es�D�N�|��e�l��z��oJBD�X��}�U^dI���N"H.$g`�8	͌B���fic����Y)�J��
)�ja$��
�t/x�]3�
$c���Ԙ��F�L
�3�L� �$����\Ѧ
� &�[9��=��AŞ@� ���
G��m�
-T�0`U��
-CF-�Šb��Ϡ=M#,�llH�c��D��T�p����u�m
��5a�d8T�GFd�c;�X��0�
֢�b�YDOΥ8
;����q[4�
۩��p��E
-B�

t+"?�L�0��`]£ȟ;VA����z��P�*dFE�b.@ x��eVe�-	�U��±\�(�-�4	J�62J�?��YQK{Wϥ��f���&I�K��	($��x���q�Yd�l�Ǽh�	f�<�I��~B����Y�h:�<�ȱ�ʓ�*s"7�tZ:
k��`�0������8�����Ų�*�:�.x+��3�+Y��[�Ef�Z�	?)\��"8t<B�?LT��-@`�!�0�.��ն~j��]@�
8�SĹm�aL���
�/�ty	,Ċ�bM�B#�i;V��g��M�� �񙳇m�ʛ�~��������*TL�]F�
-��@N	��!���I!���!��
��0`b�:�p�
 ����
R"k9
([
-��Wp
-O
�
Y&a��b�_�p;�S��BP@^A.Y'���R��,�`���d�
�@>;Jf�`ˆ�=A�aF�*'��:�U�u&��6_��6їԝ0
�s1�k�_I��M}�Y;�#Nc+���8o��!�J�餒~�`��m�4Y�v��LVp$��nf
'��j�
3gi&[GU��n=+Wz���� U��:���K�:��Wf�����$y��x
W(
ڈE9�`/:b�RK
�a_ő'�s�	�!'��d�1�
(�1o�z��6�����ı��Y��:,����e�T۴�u��fZ�̵�5�͌��5�q�
-�A�>,<s���V[��5��#��苔�2z�J�w����Z�����~(�v�B�I���n�h $��"��G�b�.�Q$�Pp-��υ�0D$�|땃����+]�N!�
i
���n۳��X�Z�t/f��\lc��s#�y&s�"3�N�p��|�]��[7/Q=��v���&o�$���a��&���\��k�(( M��(���q
n��ժ��|�Z�Gw�z�ʌ��f�Ȥ��
mLY&f���ȃ�>�
ا�}��
D��J�9�r;�|Wx54_�]�2��a��0a}} ~��V�G�P�AI�Xdr����є��$
O ]͛�.ҝ$�'�~���#=5�C�%d#�����w:|�S�6�A�����`Z��`���r�t������{�L]-�
s�y�A�����g��;�>ɤ@!s�
-���.n�>�y.���s�H�~�D��/	���~ۥ#v��m	�-ñmPA�P�e�����]��Ȗ?Ř'b@�5	1����y��?}�v�Z_�B-P͝0w�'M�i�
�g�LW�^YO�8K�U�	Ŧ�ul�5`�q���� �#
ᏸ�aP�
��o
ѡ� ���D��`^&_�_�:^� �l
�(LαHȰ��P/��G܍b�o-n�6�p���<4LC\օ$�?ƿ
��
�����
e^q��w����5�Ν
A~��p�틶mQ'M^ˬR'i#\�7p��kV�S��蔫���N}�6c}'��~CbO�<�m�8�� &�(M�a'��di.rvv�<V��TU�'c�>Y�ٝ|(��=��R�K]_K�ށp��
-{o$���^,�U�zQ[��
��
 K�ԁ���3�ԺlK�������/�u����Q��޵Y;�]ؽP��=z��qk��P���w]�C��T��I�\�O�>�`�~0r��z�JS%us�|�߇޶�m1v��zY�Q�c���28��"h�
-^���!؝+ᶎ;���*sU�@e�	;�v�
韛ol���=6;}���f��
���Y�,e�&���y$_0H�/�\�jaH��E�l�1s�a���=�	 �є��lmz�B~�Sv��}Y����5�U�
j��ھ7j��1뾧���Ț�W�f�og�郷��jF���a�o�)�Vz�H�#�bZ���(̴��
��惾�[�U�d��p����&��+Ao��'
)�"6ģOY
&������{V0
c]
�l�����l���b��r����u�X���\P�~�촎ڏ�Z9� #鶑�
-�BEa߫�v�yp��zߗ ��k��V`�
-endstream
-endobj
-6364 0 obj <<
-/Type /Page
-/Contents 6365 0 R
-/Resources 6363 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6123 0 R
-/Annots [ 6329 0 R 6352 0 R 6353 0 R 6354 0 R 6355 0 R 6356 0 R 6357 0 R 6358 0 R 6359 0 R 6360 0 R 6361 0 R 6362 0 R ]
->> endobj
-6329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 665.984 227.951 676.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 348.776 158.921 356.302]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 311.615 158.921 319.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 274.454 158.921 281.98]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 237.293 158.921 244.819]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.141 237.293 317.925 244.819]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) >>
->> endobj
-6357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 192.162 158.921 199.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.141 192.162 305.372 199.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-6359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 176.222 158.921 183.748]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.141 176.222 305.372 183.748]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-6361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 131.091 158.921 138.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6362 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6366 0 obj <<
-/D [6364 0 R /XYZ 89 770.89 null]
->> endobj
-6367 0 obj <<
-/D [6364 0 R /XYZ 90 721.073 null]
->> endobj
-6363 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R /F32 764 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6380 0 obj <<
-/Length 2486      
-/Filter /FlateDecode
->>
-stream
-xڵZ[s�6~���tfSj��$�6;�u��v�4�x�%�xi��8K�
-I�Vw�����)J�k�!!�w�s������ٷWg��G�H�4���^�Cx[x}��٧�=ƈ�f��˟�^�~{�A~;{}u����'�-��(�����O�[@��
FL�ޭ����Yx��q��.�Q.��a4����@^D����]���lNi�S��X����+��(�›S�0�B��R ���*�jF���+ݕV
�Y�O�~5o�%��Vw���j���03�J?�4�3��kn�Ůؙ��<o��p{B?Kҵ#	i�-�.�`L�<+����ޜ$8׻�!��~��g%�
@�| �\ջ�L3�}��k�*�2Kj=*�3�5l!�J� ��'E�J��
?F�v at R.�*�Er�xL��}�
�fo�Z]��^�]qf�%v�
AgD�"ҋ�X�]�AQ�Y�Z����?�c��+�S�M�!����mJP̄��
-E����_��FB0���c>�.2q��#�n���
-Is&
-"a e�����i�z���5я23��b1@���&[
-Ų�$�:���
��073�����v�ՙ�(�e�-;G�V}ysx�$aݥ�#�NO���E��2� �Y�bh���6�c����,�c#xb�b'�
��E2�~8�d� 9
!9~:�ѤsО�^�^�
�\�DJ�k �
�N�5N�dz+��81ĊHM忻���b/�
F Q�%�Ϫ`s����Y_釢ܖd���MO��+�
�I���F�|�
���Hra���V�t��o�1�Ĉ�oVZ�Y���������Э/��
��a�AGV.�����ٛEeS����V]���%�/׬x	
s�+_9R�����ǫN3dX�\,1z�8vT���˗S[W�6K���E4�������.D7���Ϥ4'�y�y�G'/ʹ�S��l +�I����~�(v�~퐲Z��g���c�o�� '�"�d�\��o'��0�l�4��f�X����bn��.<
��! ��
 �����=ҥ6�J�<��TJr�nmB	b��!�C�1H)�uy��6�*+�j�\�Y�Y���̓a
��>¦���!k����;��q҇�%=–���	iG��
2! ��&�m��v��6�X����9������[�ӣ|�9��>��~�$W{9r�C7{�SN�^�^��aL�8���
����<�����ó	�f<7p�N&><�1*!�F�Y�K�߷U+A&�-i_B�G��2=��P'���p��mR�y�+T�
-�
�e��M��� R�jb$ݘ�;l��4)���Z�*�^BQ!˺�hݚ�A�l��m>��&e��r�&!���B4�V�$�������D��BɨJ"�'" 
-F�uc�Vf΂�?e����E��Y����Rw|W�;p`mҚ4�H}F��4�`	D�"���8��q��\���3���KU��PQ�I���L�*��lQ'�o�:����\\����1f�5�\�#B�[u��j��v�7���a�hݒ����u�x�z�Yݽ�+9�W���
��M�u�u@�3S��hԢ��M�� �>ܽ[fn��&����
��l��4$�Ip����a͑p�<� ����<RH�EW{<�.��*b%�dž������5�U��p#~(��8o���lV:�8��V��
��>���x�%�C_3҅3�y�
��G�*	��S���>�"7
��Jw�U>楬�|:i�p�(�X�q?׋�Z�������b�s�@�N��	����;zD���
��$�
-dGmY:
ȯ��*�I����ŷv
]X��:�����S�ex�;]})�
-,��Z�'�[�h��s�Ȧ�k%m�*谟*@'�qgy�ț��]ެe&�H�f/��}8O��(���xB�
-D�h�x,O
TxO0ly"$'y"�끚�!`j'L<�e�>�݈��Ԃ�-�Ϭ'w��Xj�����#~$
��T
�p_��k��U�b �K�8b�����ij#!쀑apri�l��X�MIWD����"uxjBMU�q����a��PUt��5UZ�d��
�!RJ�%��
�9���4��Sn�$���R���G±JhN���~��t���2��G�|�d��=��XO2)�9"U?�^�	+�μ�#Es�����ᓀ �
�6����� |
@hq
�"��:C�G.�� Ř=�N�a:�*c�v�ѩ��C��YÝ^�k]�(��ZNXG ��S�����rc���Yv�v1ȱ��L{��~�A
"��"o(O�鲆�
H���=��
-���B�A�gX|fD�G��>�9���o�}W��^�
��{�W1\~�p����V�޽{��l��K�t���]�Mҹ�j�C'��֜����PP���N��b��睋\������f�׶Bi�9tD�d! �꠼T9
��j�A�Fyȩ�
����'v
-endstream
-endobj
-6379 0 obj <<
-/Type /Page
-/Contents 6380 0 R
-/Resources 6378 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6123 0 R
-/Annots [ 6369 0 R 6370 0 R 6371 0 R 6372 0 R 6373 0 R 6374 0 R 6375 0 R 6376 0 R 6377 0 R ]
->> endobj
-6369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 638.041 158.921 645.568]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.192 622.101 188.212 629.627]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-6371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.376 582.251 204.949 589.777]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.454 558.34 167.29 565.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 502.549 158.921 510.076]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 494.579 158.921 502.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
->> endobj
-6375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.47 380.972 515.72 391.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.884 258.37 193.016 287.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6377 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6381 0 obj <<
-/D [6379 0 R /XYZ 89 770.89 null]
->> endobj
-6382 0 obj <<
-/D [6379 0 R /XYZ 90 446.049 null]
->> endobj
-6179 0 obj <<
-/D [6379 0 R /XYZ 90 421.76 null]
->> endobj
-6383 0 obj <<
-/D [6379 0 R /XYZ 90 421.76 null]
->> endobj
-6384 0 obj <<
-/D [6379 0 R /XYZ 90 367.398 null]
->> endobj
-6181 0 obj <<
-/D [6379 0 R /XYZ 90 345.022 null]
->> endobj
-6385 0 obj <<
-/D [6379 0 R /XYZ 90 345.022 null]
->> endobj
-6182 0 obj <<
-/D [6379 0 R /XYZ 90 237.449 null]
->> endobj
-6386 0 obj <<
-/D [6379 0 R /XYZ 90 232.966 null]
->> endobj
-6387 0 obj <<
-/D [6379 0 R /XYZ 90 162.26 null]
->> endobj
-6262 0 obj <<
-/D [6379 0 R /XYZ 90 81.969 null]
->> endobj
-6388 0 obj <<
-/D [6379 0 R /XYZ 90 77.486 null]
->> endobj
-6378 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F24 529 0 R /F8 794 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6396 0 obj <<
-/Length 2733      
-/Filter /FlateDecode
->>
-stream
-xڵ[[��8~�_��!�"j�%w/���0��/
�w��\z
����ɒ
�qn�)
�壣s��w$C	W��u?�_Pw��_?\\�4b��Ds=�p3H��Ȅ(��f��C�7�h�(�÷#F��|1�~;�t��?ܥ�|r�:��O򇫫��m�I��t4���'뵿|�ޤ��١��z�i2��Ꮛ.��`Ј��@c����Ot0��?��H��[9h1�\�w>x��
-�\d�Kb�0�XDԫ�\ծ*L%D�|]��B�$6�U�U�iN���&oG�Ê#Ɔޒ�p�	�
8U�2i�=7�a佖'�
�E
��1��j�.����a���C#M�$B�j�/~�j�!�#��ۧ
���3cA�R~�,[��u�Z^�i�h�@	��鈩�ó�h�1!�䙆�g�
�;Y�Rt}?��i�+5��3�t�O[ۧ�/�:�$�i�r̮�~f�sY
��-��2�T.�B�˗�)v̙���0j��wp�0.*�L��߲��_wG���4��R�Ϊ�
-c��H�Z

S�$�@/��sU�����0�&q�_*��C���.�xNޟ�mp��/�Aqn��߲��
��8���4�/�y֓E����<]��bR8���&ΒR
���>y�/���?��7%�o��u�n9RoV������NG�%Y�Z{=6
ޭ�
-.�l���S=�
1
!#�&ny:p+�dG6� �N5�l��A�
-�#N�n^A�T� t���nxk�-�.��p�:������� r���=��	��^�f
-Ƅ�WD0�(e
-TA�R�{r�����˼�b�ּ����*
Ѧ��;�vI����U
5��.ڹ�g]�Dn# ����{�8�(Z�+�ނ! �L�
�M�Z��In\ ?}\I	R�a�ˤս[�d^�����	�F�uU��΀5!�~?��M����jXk�p"#5
�:$��~^��L��߫ �C},�J"�QRU���0t��Cx��0c��Uz��m��
W�ȁL�@,���Q�5	� ��rdh�\:뫫���ʁ
�;���

-�
Ϟ�t�a�o��ش�Bhm�Eg�p\_o�m�0��ׯ����*�Q���	L� �		l����G� F4�r��Ic5�ҍ�+��RiaH@��:[����j��o�
FЊXP���
���M]"Jxs˷�R�4�C�����u��
�-�׈IJ�:Y���u�N��z<�J^�^�G�9����>����#z�;���}�ۍ��w��)�\����j��c�����=O��c�ji�h�RTVA�W�}#6\w�{�ݧ��{��k�F*�ÛM�����?W"a��JT"� �*6c�
�#0?v��_�f�﷕c
�j�!
��p��b��ݭ�SЀ
^�B��
���1���s��o�>�
Ck���:���|qR�=N��kjQiU�|�(�B� � ��,�iU�6��_}����+U	��Ӊó�&�������B�y?.��ƽ	A�6;�j��M�������f9
u���n�ntόe'����H>��;N����*�gw��gq�
��=�=��c�̡Ɣ'�6�C���D��	���H4=� �@�i���1�FQK齽�p�^u[��Q�a�l�y�g�Krb���
��׎v9bu��y���k�\�,n�Y��EKKE���K�M�\��o��6��������1���~ZwtmM!���v�Tt�$��z��.[wL��L1DR�	
4���iZn
�'0Tw������呭=
��̒/pd���:�`1���H�^CdyI�a� $O7�Y�h� I��o����I��A�8�Ff
3�-�����)����J˝0$zk�B�ish�q S8U�+-��A\oΆ� T%e�Y�����ٙ��~�B��H����^V�v„��Bu��������U��+���Ys7��`�(@˟{9��۱?

-���"9,����̣L��7"fR<0���:�2��Γ�;��"�M)M��q*� I:V�
n�6E��G4Y8=Ra/�X�
,O��*�ڃ6�+8���l
8f{Tx��J�F����'Z�Z
��]�	�<vz��Q-���_�=
[t
J
c1w�o#Z��)��i�&cQ;ۉ�H��I��dǀS�!n�:�
�������X0:|��
%1T�,*
&�O�6�U�>]-�j;�k��*+
F��o����
���:�o��o���$��H��� HR
��D�G��� '��3��КP�zQA��Q2Va/����|R���g�LU[����N��&��:'ʝ&����0}�����;����U����� !ku�o6�"��gi���D�+�R�POY��GM��I��C7�d�52>\{�x�`M�s��B�O�v�CmHh/
�.ϱ��C����k�%M
�9
����0
1�Q����E
w�U
�{��lC�!�ƶc�u��:}�T|w*Klb�S9�X�(��YǬ�OZ�(�g��M��� �&:��e7���
-��o�\���
-���u4ݮ����c���X ��m}b�u�r���џ�N��}9����#Sٟ��:�_v%�-��"��fT��rd��S����
 ���7o�} h[g!o߾��Y��wf ��d�;��M�?*η_L��"�{�V'z^�/���_�[��*�9)U�]Q�_]^~��"&oɴ���Q+�p_G�pU�,VyXP���E�3-X���)#U1X���̔G�_�|X�n\�Z��o+����${�
-endstream
-endobj
-6395 0 obj <<
-/Type /Page
-/Contents 6396 0 R
-/Resources 6394 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6407 0 R
-/Annots [ 6389 0 R 6390 0 R 6391 0 R 6392 0 R 6393 0 R ]
->> endobj
-6389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.381 629.944 193.513 659.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.972 495.686 233.221 506.59]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.539 434.111 193.671 463.426]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 382.952 261.163 396.9]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-6393 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6397 0 obj <<
-/D [6395 0 R /XYZ 89 770.89 null]
->> endobj
-6263 0 obj <<
-/D [6395 0 R /XYZ 90 609.022 null]
->> endobj
-6398 0 obj <<
-/D [6395 0 R /XYZ 90 604.539 null]
->> endobj
-6264 0 obj <<
-/D [6395 0 R /XYZ 492.815 555.009 null]
->> endobj
-6399 0 obj <<
-/D [6395 0 R /XYZ 90 548.369 null]
->> endobj
-6400 0 obj <<
-/D [6395 0 R /XYZ 90 408.257 null]
->> endobj
-6401 0 obj <<
-/D [6395 0 R /XYZ 90 356.626 null]
->> endobj
-6183 0 obj <<
-/D [6395 0 R /XYZ 90 332.093 null]
->> endobj
-6402 0 obj <<
-/D [6395 0 R /XYZ 90 332.093 null]
->> endobj
-6403 0 obj <<
-/D [6395 0 R /XYZ 90 261.416 null]
->> endobj
-6184 0 obj <<
-/D [6395 0 R /XYZ 90 226.38 null]
->> endobj
-6404 0 obj <<
-/D [6395 0 R /XYZ 90 221.897 null]
->> endobj
-6185 0 obj <<
-/D [6395 0 R /XYZ 413.076 170.21 null]
->> endobj
-6405 0 obj <<
-/D [6395 0 R /XYZ 90 163.57 null]
->> endobj
-6186 0 obj <<
-/D [6395 0 R /XYZ 254.215 84.46 null]
->> endobj
-6406 0 obj <<
-/D [6395 0 R /XYZ 90 77.486 null]
->> endobj
-6394 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F7 795 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6411 0 obj <<
-/Length 2300      
-/Filter /FlateDecode
->>
-stream
-x��Z]s�}���K��4��I��C�M:M����ew'#K�ũDjIʮ��{A !R�e��ɋI�н�9�0�"������
-�[��������E
-��&��2R8J�B"����	%x���ۈ%�����o�����w�̻��o��\x�#b��h����G
x�-$fJF�M�M�)��:�p��+
 kA�!���@C�8�Ә`�'wE��Ɣ���)�Y���A�T")E�a�
4��T-�>
"	�)0��2:�L�VzQ � Zp>J9�����Y9������m�ߗ;����MV��0"�
-�^Q�(�lW��>����|�OcE��#�ټȫ���x�M�

SfcCsDpj��]׻2o��](
q�=?k�m�	��F��<��
{S��'{��OS�����V�0f88
Y��^e�i��a/~�
3x��+��]�mx�h�̞\����ݼe�q�(8& K�ܤ(�5�&u�����f�$��^��e�^S*&�Y~��5�
-���T7�dG��I�\P2s��D�[}���Y���Y�tc��t�F"�b�"�R�I�G	R)�2��H��"�0�,w�X�L!
�~����N�Q��&d Ul!h�H���D��P$��q޸D�[n`|�شr�9 
�a�= G�Dq �8\�`���
,�4���*��1M���{���)!=��:���d��3�Jhzb�m�mYluyH�(�8��'� ��3����1���d��_9��	�A-I;�o6�"
��e�+��+]�x�jHB���"�[�-��s��ڍ)Zr�c�s��b�-Q��6�
t�5���A���:Xbc����8+�"<tA�5.H�1���L("��m��
- ������� K���U���_��F�`��3A��uu�ʏe?m���/��1��,��󌋢�mf�
[�@3���|�<��I�~k��N�'
�2\M��K�׎�g���i��/Gw!�*vO�v/y���
�c�=�bz����{��ؽ�x�`ٖS"&Mm��)�(��;�j��r�g
�4Se�V��|�����2�J�#��Om��n����]�K=��RR��'�A��3zB5
-�>�'^���1�W�9\��<
"pM͐��БM��c7�2z�*��%�
B1���#��!�B�Bx��/��
-����ᳵ&av;Ok�9xsf�a��Z믨ʕ��t�G��
-ˇ;(H#v{��yQ�х��”N�F�E���)qr�@�V�yإ��08&���Bq"ƀ`�I0!
g��u°JJ�@�`�d�a�����zh	�6)%����h�u�mt^eEn	�T+�&"i��~���i�:ߴ�>�
�ա�ׄ����
���S��f���ԋ�����������َ��aw `{ D`$�a��� ��p�0[,�Ӕ©�����w=�o�^���Zt��܃��6��
�x�'�!���Z�
A�N�Ɛa��B���	��y�4KF�`
-�94
 
/�l9X
-`��m�x��� ϱR �:JZVC�0m+�ʒ�X1H�c ��N�d���`)`�
����,�A�0�f�ZgT����P�Q�){��@J�/8�����
-��
���.g�<��%��n�*��l at D[��@

-#楽>��nF*S��zVֶ�@�eYlNmc��ASs���s��@j���4f�LnW���$Y>�-P�Þ�=�0�&GP�_R�
;ų%�`K�9�H(�L
�*����ĮGR�s(���z*��&d=��B�1 @R�����4����C��0�e��
��u��4|���X܆
��w.���	�aew8�
�6MXb��[a
�j�nP���~��h[f����:���5�u�q�Km����ES�d�gS���ا�)˪�O�"���3��O��O?d_ܩyS�̋cw��y��H���1�fBq��T� �� G�v�	����w�y���ׯ��i�=Ce��/��u֍�}Kۯڰ�w͋ݼ��#��]q�Q�

㞟Uf�� [���m�t9��	}-{���(�HB�3�{yzO�n��kDm���@
l�q���!1n
� ]�N1(]o�i~�v��
˷l�y]����7�u���uQV( r�#f0+'�	�?b�|�
�����_�ᘤ)m^v�3����6,�C���b��6 �[�$�푐9�m:K$�������?*]���΍�_f�����̍i�w�a�s	�N`��k7T׿Z��j\c��0}��^������nw_��
�D�'�a`޻ݥ��o��-P�w3c�{���@
-endstream
-endobj
-6410 0 obj <<
-/Type /Page
-/Contents 6411 0 R
-/Resources 6409 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6407 0 R
-/Annots [ 6408 0 R ]
->> endobj
-6408 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6412 0 obj <<
-/D [6410 0 R /XYZ 89 770.89 null]
->> endobj
-6187 0 obj <<
-/D [6410 0 R /XYZ 90 616.275 null]
->> endobj
-6413 0 obj <<
-/D [6410 0 R /XYZ 90 611.792 null]
->> endobj
-6188 0 obj <<
-/D [6410 0 R /XYZ 90 502.321 null]
->> endobj
-6414 0 obj <<
-/D [6410 0 R /XYZ 90 497.838 null]
->> endobj
-6189 0 obj <<
-/D [6410 0 R /XYZ 308.538 443.471 null]
->> endobj
-6415 0 obj <<
-/D [6410 0 R /XYZ 90 436.831 null]
->> endobj
-6265 0 obj <<
-/D [6410 0 R /XYZ 268.967 381.631 null]
->> endobj
-6416 0 obj <<
-/D [6410 0 R /XYZ 90 374.991 null]
->> endobj
-6266 0 obj <<
-/D [6410 0 R /XYZ 391.965 325.461 null]
->> endobj
-6417 0 obj <<
-/D [6410 0 R /XYZ 90 318.821 null]
->> endobj
-6267 0 obj <<
-/D [6410 0 R /XYZ 158.014 257.335 null]
->> endobj
-6418 0 obj <<
-/D [6410 0 R /XYZ 90 250.695 null]
->> endobj
-6268 0 obj <<
-/D [6410 0 R /XYZ 206.163 183.541 null]
->> endobj
-6419 0 obj <<
-/D [6410 0 R /XYZ 90 176.901 null]
->> endobj
-6269 0 obj <<
-/D [6410 0 R /XYZ 507.769 121.701 null]
->> endobj
-6420 0 obj <<
-/D [6410 0 R /XYZ 90 115.061 null]
->> endobj
-6409 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F8 794 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6424 0 obj <<
-/Length 2170      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~ׯ�>l���`�/��M�N�t�&ާ4�ad��X"
�j���
�A�$ڒv��EQ p������G?L�����T,2�H*�����Hq���o�ѻ�`D�tF0���)�qR��������&�,�����??�g��:���tF�_,��t�oҫ��
�_	�XƔ�����&�_L>M�Gĭ@ ���j��=�.��OF���s=hq��s���6���H��B!n/o����i
g9�d��3�t����%k�$v�L��S7$��^L��{�/Y�Y���*ɪżt_W�3ɚ���	5�O�Mj�m��-���NV�{��Ϫ䋻�;8)��`�3آ��1_Ww���������"��Ž?{	��5��ت�~���O�D �o��d�j�0�ռ��4o�ʹA�h�����D����"�.�ʨ���Uo�eR�͗��l^-��}�.��W��U/�����*¾X���c�/݌�b�?w߭Z�3.d<ϳ�r���A�A�v
- �
��@0�X���Z����4�/���m�P�]ˢ
aa�dU��9
�Z�,I�
�����ή�=�m mƈAL20�h�蛴ZY��Q���$pL�A5�������p?m�
Q�m�K`~����i�
�B"�ԆB�LR4�s�݌a
�
-�%*�t'�� (�o�`S��
`e�B�<� Wɲ
1�QĔ�;1 ,l
3�5
(���󼬊4Y9��"--�q��6\�pr�a�l��@�T��NS�q�����F�t���)�[)�χ_)Nk�r.�?M

P
�1>V{w{o��o�M�h�/�N;)�
���Y���r��lr�
��"����ު)	"IF�$*�|�4�@��d�5cҀ)���Xch�S����K��b��1H7{J6#�PH��C"J����<
�D��A4�� [�2���3�bҫ��/lW�n�Q�Tj$� u���QR��C:�����H����p��

[��x��J ��
c:_تp����'$h#E���֧MW��E�'�CAF���D��o�����NU�%��<s�x)@��_�WS�Ő
C��Ǥ�U�,3��
�C�0�H~�gV�d��r�s�A�[��
]h �^1����B>����‰�<��ƘMr�Y���	��2.
!i�9�j����pކ�:� ���@�a
*?�OL3�@�v*�Gҙ��^'���H_�:S���6�J���5P�
�ClNZ.�٦e�
8ʺFك#�s�k�<s����jq��_dס�	@���*�EV�[n�-�?S!�fW��r�\�d�U�
�>�J��L?���Ƙ��#�F�O-һ"-���9M?�^�u�`
-$�wT�]@��җA܈6�r��!��	�Q�<gE�������T*�\�*4��j����Zx&&k�g����y�9�����1� 
� �AP>�$��x��[�F����8��X
:m�.C�S�i��t_�dd�`���
-H�VۇJn��?9�eq(r�� '� S�q�S1����fd����#�s(�)�?"pL�
-+�Kr8r�:h�(r�(Rxp3r���|�,R��
�DB���F����n�QHa�F��`�p3u�ǃmr�5��W7M�?�����y
UN	�?'w�F�6�
E�>��!��5Oٌ��>�~Ӏ�j��o5����>�!�z�EBܴ��o�
	�u8Q�zS���!V��.+P6�9eF7� M�:"Z".�lN�5��TT�mN)��g�مz{�eH�@���ݤ�P׻�'s@��X��am��%϶)Cv�V������13�@K`���
$�0#f&ǵd��SCG�d��3G��
8�|�c:2}��vv�4d85'���� N��OUê�0���#ۈY

N>��>T
�����T��}Ą>�:R x=�����`��)L��/~
�;P
1��TG��zZ�S
'��I��q��
'����<\*m���
.m�B:'%o�r˭m����+w��2-�M�_�l�,���y�;�7	��X�A6�6M�]�E�F��ϓZ)�R���s�(zSUw�gg��e�]��+��N�`���.�ʋ��n�,�+{D֞�D��h�YB}0��(��U׾�7��lln���b�w9(��
��TC��
-endstream
-endobj
-6423 0 obj <<
-/Type /Page
-/Contents 6424 0 R
-/Resources 6422 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6407 0 R
-/Annots [ 6421 0 R ]
->> endobj
-6421 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6425 0 obj <<
-/D [6423 0 R /XYZ 89 770.89 null]
->> endobj
-6426 0 obj <<
-/D [6423 0 R /XYZ 90 671.361 null]
->> endobj
-6344 0 obj <<
-/D [6423 0 R /XYZ 90 646.771 null]
->> endobj
-6427 0 obj <<
-/D [6423 0 R /XYZ 90 646.771 null]
->> endobj
-6345 0 obj <<
-/D [6423 0 R /XYZ 90 605.066 null]
->> endobj
-6428 0 obj <<
-/D [6423 0 R /XYZ 90 600.583 null]
->> endobj
-6346 0 obj <<
-/D [6423 0 R /XYZ 90 560.851 null]
->> endobj
-6429 0 obj <<
-/D [6423 0 R /XYZ 90 556.368 null]
->> endobj
-6347 0 obj <<
-/D [6423 0 R /XYZ 90 516.636 null]
->> endobj
-6430 0 obj <<
-/D [6423 0 R /XYZ 90 512.153 null]
->> endobj
-6348 0 obj <<
-/D [6423 0 R /XYZ 90 460.132 null]
->> endobj
-6431 0 obj <<
-/D [6423 0 R /XYZ 90 455.649 null]
->> endobj
-6349 0 obj <<
-/D [6423 0 R /XYZ 90 403.962 null]
->> endobj
-6432 0 obj <<
-/D [6423 0 R /XYZ 90 399.479 null]
->> endobj
-6350 0 obj <<
-/D [6423 0 R /XYZ 139.991 320.703 null]
->> endobj
-6433 0 obj <<
-/D [6423 0 R /XYZ 90 313.729 null]
->> endobj
-6351 0 obj <<
-/D [6423 0 R /XYZ 90 262.376 null]
->> endobj
-6434 0 obj <<
-/D [6423 0 R /XYZ 90 257.892 null]
->> endobj
-6435 0 obj <<
-/D [6423 0 R /XYZ 90 235.845 null]
->> endobj
-6436 0 obj <<
-/D [6423 0 R /XYZ 90 202.783 null]
->> endobj
-6437 0 obj <<
-/D [6423 0 R /XYZ 90 167.719 null]
->> endobj
-6438 0 obj <<
-/D [6423 0 R /XYZ 90 134.658 null]
->> endobj
-6439 0 obj <<
-/D [6423 0 R /XYZ 90 100.595 null]
->> endobj
-6440 0 obj <<
-/D [6423 0 R /XYZ 90 77.486 null]
->> endobj
-6422 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F8 794 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6470 0 obj <<
-/Length 1908      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~���0�����E$�`
��2��6k���(���ɒ+�Ͳ_�C��%Yv�Ų'Quxx�s����������!\������SH	*�����'������Χ�N?\��1"�|U?~���ŋ��������ӄ�+�+�#z�z������X��л�'���2������	�iVk2���+�HG$���ؿ��t:�4��.�*/�yb��c����
?γ�2�vK�a��lYluk;��gH������ Dv����jf��xDl�q�L9�
_E��
-�]
lF�F��7����:�*=�P��8S��"3���y�
"X����S�y2� �SB��hӁs�XJ"*�.�}��A�p�	��� p�]t���^_��B�<�"7���ZgUT%yvdAx4�f���F�I?
-�v�n��S���.9،�����gƣ�b
�*�1R��D`6Ϗ%,�T�ڔ���(@���E�@4K3�Cr'�^�y1��bH�/���+�W�䲈 �п>=�����\/�mZ�kd�/�Q@�r`� ��7���OF��Q�
�7�V�ۯ�Ϟ�=1�@�6J#>�G��K��y�!:y��/VT�x_Mx�-�܎ya��R�_ٛ�}Kt��'��
-P��u^龀�-�6��B!Œvw@	D�fJ0���6��m\՚��(��Ae?����WI��ˍ���S�D��?nQ0��S5j������H�I�5��r�0��:�
[���V��������͓�J��6)W�e��\����=j�w�25n��D��Z%�j��^���C�j�Өt�+c���,ufXJ�I�z-�4�k��]�G�ة>���G�ưv
.
��)��Y�f
��f���ʾ�wFa���F*
	�.YS����S�
-�b��@�c��!
ʽ��у��p#�*z���!��
-�xpO�	u_�U]���&@Q�}E�J�m~�|
�o�b*}]�J
�~@�̺(�����X#�D��y� �
�/�CF �}�dq����
(�j���#� ���v �A�����!��{�B
�FƑ7c7]�*�6�F�h2¡`��o_W(��'��S�=��cRنeT��"�MTB�W�uU
�p8E�fM.�F�UM>�M����]t{�ob�Z[6E�l{	��&�u�.]|��b�,�liq�Уv5��E�G |l6��Ĩ��c������	��:����/p
C���|<w�l�!���Ng
V��R� I:w�$r������
�3�S	x]�_X~�@Y-����
�~��xX�w��x
��i�Ȣ�G�}�g����U8ek�&!�V�� m�4w�QWq�v��
� �R@?󵝡m�c:(�!�����	��-�+�ԥ�j�cf0F%Y���,�
���U�-��rz�pR�{��L>�!	�M�q�l:�y1Ĕ�
����o�O1e��6�b�Wb\ZWbͩ�-��B ��S���N��
P���H�6C�ϛ�r}'G�Ղ��3���b�W��k���	��ऻt~,d��ױ��T}���
(����h:���
��zk͘T�
-�.<c�!^�2BM����xw��3=�9Nn�#�9��+E
��(.�����D�}^e�N�O�(M�vBr�) �^���T"E
W8�
��>e�M���Imy�\��)!Ŀ���
��?��c�g����l�x�DO�x�&׃BZ+�U����4���	vw�c��_��2�
���0�����~�f
q��\A����r;P?U���#L�����~�|�
���f��
����@�l'�>!��اh�מ��f���nʹ��(�6ǿƦ�
�E�
�T��ul��@�^�j�:�ϰ:�pȰ�6���jszrr�]��-Q���}���»�W���:/t����zĉ���
-endstream
-endobj
-6469 0 obj <<
-/Type /Page
-/Contents 6470 0 R
-/Resources 6468 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6407 0 R
-/Annots [ 6441 0 R 6442 0 R 6443 0 R 6444 0 R 6445 0 R 6446 0 R 6447 0 R 6448 0 R 6449 0 R 6450 0 R 6451 0 R 6452 0 R 6453 0 R 6454 0 R 6455 0 R 6456 0 R 6457 0 R 6458 0 R 6459 0 R 6460 0 R 6461 0 R 6467 0 R ]
->> endobj
-6441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 366.292 192.544 376.22]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.528 198.363 306.432]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) >>
->> endobj
-6443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.179 295.528 263.936 306.432]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 267.644 198.363 278.548]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a1a897aa9f5d0da382de3c8baafba247c) >>
->> endobj
-6445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.179 267.644 267.822 278.548]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.283 267.644 340.04 278.548]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 239.76 198.363 250.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a8bca7707491a770d78b523ae5570b139) >>
->> endobj
-6448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.7 239.76 275.832 250.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.467 239.76 360.224 250.664]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 211.875 198.363 222.779]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aeb80e8469483bf1408d49901fee73802) >>
->> endobj
-6451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.7 211.875 269.206 222.779]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.86 211.875 348.618 222.779]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 173.032 198.363 183.936]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a8f78066abbc29188a3dccfad42477aec) >>
->> endobj
-6454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.7 173.032 303.527 183.936]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-6455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.056 173.032 386.814 183.936]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 145.148 198.363 156.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_acf4cf2f1d8c3e1d339b1eddc94139272) >>
->> endobj
-6457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.7 145.148 310.153 156.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 117.263 198.363 128.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a1557515cde9d0030743cd45ce2471e0a) >>
->> endobj
-6459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.7 117.263 310.153 128.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.663 117.263 398.421 128.167]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 89.379 206.112 100.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a9d7fe3b07d9e1d35c04fa2d81e32bf34) >>
->> endobj
-6467 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6471 0 obj <<
-/D [6469 0 R /XYZ 89 770.89 null]
->> endobj
-6472 0 obj <<
-/D [6469 0 R /XYZ 90 704.53 null]
->> endobj
-6473 0 obj <<
-/D [6469 0 R /XYZ 90 682.422 null]
->> endobj
-6180 0 obj <<
-/D [6469 0 R /XYZ 90 659.986 null]
->> endobj
-6474 0 obj <<
-/D [6469 0 R /XYZ 90 659.986 null]
->> endobj
-1778 0 obj <<
-/D [6469 0 R /XYZ 90 489.369 null]
->> endobj
-222 0 obj <<
-/D [6469 0 R /XYZ 90 482.752 null]
->> endobj
-6475 0 obj <<
-/D [6469 0 R /XYZ 90 384.219 null]
->> endobj
-6476 0 obj <<
-/D [6469 0 R /XYZ 90 314.516 null]
->> endobj
-6477 0 obj <<
-/D [6469 0 R /XYZ 90 314.516 null]
->> endobj
-6478 0 obj <<
-/D [6469 0 R /XYZ 90 284.898 null]
->> endobj
-6479 0 obj <<
-/D [6469 0 R /XYZ 90 257.014 null]
->> endobj
-6480 0 obj <<
-/D [6469 0 R /XYZ 90 189.878 null]
->> endobj
-6481 0 obj <<
-/D [6469 0 R /XYZ 90 134.518 null]
->> endobj
-6482 0 obj <<
-/D [6469 0 R /XYZ 90 106.633 null]
->> endobj
-6468 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F67 3037 0 R /F38 3426 0 R /F66 3179 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6530 0 obj <<
-/Length 2027      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~ׯ�SV��`\��v���4�z
��C���,s*�
-A�U} �$Q��Ў��(���wn ��p������ŷ�9
-<�9��N�
��{�o�|�(�L	�x|=!x
�I8��P<Ζ�9��ٻ�.����,]�k�Fr�~�
-�L����e������2��M���ɘ6�����?���#ra�X98�%�?cg��:��w~5�ǥ
~����G�T	�U�pK5�=�2�� B�z?Q�����z�|Q�q����0���n��`�V�Uy�c�8[�<,��_]���9��T�s�&�f#;��ߋo�� ��jP(E�K�)�����R�"MdZLj�'����B�mͼ󴞒!�z���F�r�`����;Z���;-p
$�_�G�s#�u��|.
d9�:�'L�k�쿕�id�����7��a.�1,b3;jK"yXTc��X�ۂx>?b��Oƫ�y?�,f�~p�>#W&�
��L\�G��@�����q.���]�d�
T����o%0'�:�<OU�Ƭج�i�V!ď��/�1��Ol?�$#
oy�%D�e��t��B���'�MK����6IP
:�@
<�$'�˲e���j&?���
��<yb8w��0"��p�L]p30
��%´t�,]n�U�:]��.�>���r���:0�FE%��O
:��¼�Ϧc%��"�(GDT	U|.�
B5[Ʃ
sK����z������a\�,-#T���&��Bޢ���H��Jv��O���RK�g�#@����,�����IjǀPS���Z���LQ�`<@�(���PQ
�;�q��
\�J㴫�����)~ 
�ae���@.���]1��X-:փ.T���R1���j`{�t���|[�.F�:l�פ����
0„?���G����nAav��ֻ"���`��!곁���H�h?�@��
�]��5�D0�Z
-��a�V�j�d �~���lF�
�½R@�a)�4,�ߊ���R�M�!�5�0
-x��
O���
���!��
���=)eU���ĭ"\ェY�Í��T5f��bWzASyt�b���@^��]9,a(EK��z��k\
Qy
�q3ݧ/
��(�k��J.������Eg�'ۍ�s��
�v؋A���}�/s_V~�cW�P/#�M�~x���w��
},=0�`M��Z�xА/��B�aC��2Y��{�3z����^��1n�&������,.엣Ӷw�v�E�l��Xw8H>=�Ѥ���#�
�� �3�f���Bo��@��
�e
���z�Qn��~{�P˖f��0n�O�v�� z�k����P��
�8
f6ɧUF�BULa�T��vw�A����Ρj���~}xa��
�����z� �5��d����~d
�8L����<UX��~{��>TQ
���d��p�?f��O̅꼮'T1���d�w��yu�
-��ί߿��:�r�#�ٿx��a��x^s\3�eX�:y����;�ȣ�˘V�`Zz�e� 4в����π>z���: i�x��%�,	%������ֽ=
�����ѢRKі�(ʁ_}���5�����8C�$ֵ�Y8�u�õ�lP��Zڝ=2��'.gI��".�wj�l
��)+��h�SO���5<ֺ�� ++�|
�s$p�nӃ�݄ĭ�g���U�:0Ѿ�T
�yl+��|���\�

-� g*�̣��;��a��s :�v�MU��I
-���Gu�j
AϦ���ם��7GH�å�: r4�������`����v��L�|3S����}������8��m�����[vIJ;�u!i��M�g�v����(Z�����ݦ+�볞�����Ź
�y�5��
��t#����q��s�չ�V��zW�e���Lz}��^�O����K�����-�'��̛ �0�^V at Y�q�����f��s�^��y(������z�y��,ٷnK� aQ��ụ�1�LZ�� �
-G�!]{�B��8�ߑ��fD��<�^,o\\%��w 7G�� �]
O
-endstream
-endobj
-6529 0 obj <<
-/Type /Page
-/Contents 6530 0 R
-/Resources 6528 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6407 0 R
-/Annots [ 6462 0 R 6463 0 R 6464 0 R 6465 0 R 6466 0 R 6485 0 R 6486 0 R 6487 0 R 6488 0 R 6489 0 R 6490 0 R 6491 0 R 6492 0 R 6493 0 R 6494 0 R 6495 0 R 6496 0 R 6497 0 R 6498 0 R 6499 0 R 6500 0 R 6501 0 R 6502 0 R 6503 0 R 6504 0 R 6505 0 R 6506 0 R 6507 0 R 6508 0 R 6509 0 R 6510 0 R 6511 0 R 6512 0 R 6513 0 R 6514 0 R 6515 0 R 6516 0 R 6517 0 R 6518 0 R 6519 0 R 6520 0 R 6521 0 R 6522 0 R 6527 0 R ]
->> endobj
-6462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 198.363 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.103 707.957 249.909 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a705b9ccde802cccb058145896a399b50) >>
->> endobj
-6464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.246 707.957 361.699 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 679.872 175.668 690.776]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 679.872 234.596 690.776]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ac759e2fa9ea2058d86292dc3c5b43a7a) >>
->> endobj
-6485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 651.787 208.395 662.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ab8ae5d861fb56c8ed906f604be7c4f02) >>
->> endobj
-6486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 651.787 273.968 662.691]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-6487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 623.702 179.554 634.606]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 623.702 250.666 634.606]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_afefca839fc7b4d2d166e7a1fe6196fd5) >>
->> endobj
-6489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 595.616 182.044 606.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a0dd6aa622dcadcee1746650f8ca164eb) >>
->> endobj
-6490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.381 595.616 293.834 606.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 567.531 220.22 578.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ae4a4890ceb257496b788e0d31dbf6d7f) >>
->> endobj
-6492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 539.82 155.265 550.35]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a3fe60e1a76b2a92143004e52ccfcb7c7) >>
->> endobj
-6493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 511.361 158.044 522.265]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a0a4f8e3f3469f021594ea9311c21aadd) >>
->> endobj
-6494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.382 511.361 235.513 522.265]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 483.276 158.044 494.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a7c083d56e96fb1b5bc3c5fb23350f0a2) >>
->> endobj
-6496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.86 483.276 211.992 494.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.627 483.276 294.571 494.18]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-6498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 444.605 158.044 455.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a067b4c27cf8643f8ded50ebda77da8aa) >>
->> endobj
-6499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.382 444.605 228.888 455.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 405.188 158.044 416.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a8f66b17d5e71aebc89be0af0e3a4c7df) >>
->> endobj
-6501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.382 405.188 269.834 416.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 377.103 158.044 388.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aee8ca9a278a53c88ad387a619bc80f27) >>
->> endobj
-6503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.86 377.103 246.313 388.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.823 377.103 332.768 388.006]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-6505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 349.017 161.013 359.921]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a0bf701759fc56f8fb215c273e53b46ae) >>
->> endobj
-6506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 320.932 170.687 331.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 320.932 195.165 331.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a1685b5eb65ba36a9e715a8e3344dbcd8) >>
->> endobj
-6508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.493 306.217 225.163 316.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.148 295.258 227.817 305.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 282.262 170.687 292.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 282.262 187.563 292.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a5c85932f5fb67a78d1faf8165783d5d3) >>
->> endobj
-6512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.482 267.173 271.151 277.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 254.177 150.493 264.707]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a562fa08178e809398402920e5e674ff8) >>
->> endobj
-6514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 225.718 181.845 236.622]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a9e8a61b2b759dde8f65219688548ffaa) >>
->> endobj
-6515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 197.633 181.845 208.537]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) >>
->> endobj
-6516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 169.548 154.727 180.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ad05bc9046303661aa532423ac5a5c16d) >>
->> endobj
-6517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 141.836 176.505 152.366]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aea6d543c90be52299d6ffc57fc9ba5d1) >>
->> endobj
-6518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 126.747 450.955 136.652]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) >>
->> endobj
-6519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.418 191.718 113.322]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-6520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 102.418 288.852 113.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a77c72d8473dc3e9856d7ff6c05ce7b07) >>
->> endobj
-6521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 191.718 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-6522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 74.333 303.079 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) >>
->> endobj
-6527 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6531 0 obj <<
-/D [6529 0 R /XYZ 89 770.89 null]
->> endobj
-6532 0 obj <<
-/D [6529 0 R /XYZ 90 721.073 null]
->> endobj
-6533 0 obj <<
-/D [6529 0 R /XYZ 90 697.227 null]
->> endobj
-6534 0 obj <<
-/D [6529 0 R /XYZ 90 669.141 null]
->> endobj
-6535 0 obj <<
-/D [6529 0 R /XYZ 90 641.056 null]
->> endobj
-6536 0 obj <<
-/D [6529 0 R /XYZ 90 612.971 null]
->> endobj
-6537 0 obj <<
-/D [6529 0 R /XYZ 90 584.886 null]
->> endobj
-6538 0 obj <<
-/D [6529 0 R /XYZ 90 556.801 null]
->> endobj
-6539 0 obj <<
-/D [6529 0 R /XYZ 90 394.457 null]
->> endobj
-6540 0 obj <<
-/D [6529 0 R /XYZ 90 366.372 null]
->> endobj
-6541 0 obj <<
-/D [6529 0 R /XYZ 90 338.287 null]
->> endobj
-6542 0 obj <<
-/D [6529 0 R /XYZ 90 299.243 null]
->> endobj
-6543 0 obj <<
-/D [6529 0 R /XYZ 90 271.158 null]
->> endobj
-6544 0 obj <<
-/D [6529 0 R /XYZ 90 243.072 null]
->> endobj
-6545 0 obj <<
-/D [6529 0 R /XYZ 90 214.987 null]
->> endobj
-6546 0 obj <<
-/D [6529 0 R /XYZ 90 186.902 null]
->> endobj
-6547 0 obj <<
-/D [6529 0 R /XYZ 90 158.817 null]
->> endobj
-6548 0 obj <<
-/D [6529 0 R /XYZ 90 119.773 null]
->> endobj
-6549 0 obj <<
-/D [6529 0 R /XYZ 90 91.688 null]
->> endobj
-6528 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F67 3037 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6591 0 obj <<
-/Length 1558      
-/Filter /FlateDecode
->>
-stream
-x��YKs�6��W��3
�oOҙ6�=Iǵ�^���a�-
-	�V~} H�%1��
z�	��b�>���T���������55�u�ѝ�c͵|d;�+�>�X���;�t<D|V�ׯ?\��\�nķ����ˀ�'�����\O�$������wF��irR�YԄg��
�
`���S�曚�9��PaOs	A�T|\3^�ia
��u>cՠ���Q�V��gjVv�6;aI�/�8H�`}*���^,�<=w�Uf<�i�	c��E^�f!��$>��jRK.J�M�9H��Vl�W�3���<�ֆ�B����R����D>U&��h�6�z%,-�,
�Ŝ�_#�O�d̾�A
��5j�'lc�#��&YZ�5ҵ0m�)r,
-�8�<�'�p����,��X��P�s�k�gs��AӼd����f}���aٺ`�ٶ��pE*��6�B�m���q� �,�oS�������͢�,�"q����N��<��񩍈���{o�ߛ�uH=�!�.J�EN�ݢ���L�_��}�
ςA��4��<3��?� 
��< �4�S|�uw��Z3��2����0,��
��"f�M�K���zB�K�w��� |M�E����)�W\ѡ��3��un}ƪq�<z|a
-J!�AD���5J�j�L�[�|&�k\��H��²2�	��H�����e�PIW��7�r
B
KJ�z�����<<;�7���	���t+�R�#�j<��V֤%���5�=ȣ�6fk�i�e������V�'��b��n0���L�j;•�A.�:ܨ�* *wk��YC�����!g����{�b73�)�C"V���Z�dq��6���뫲7dB���3��@��`)�G�th�-�� d�f�?�&�B�$^?t�fY�����)�P�d�[nu���S��pK�]f�o�)[��b�d�f��!
R��[�Qa98�8�U��G�z�Uyk�z\�|ϔL0>/�	�p�-]Y�lq�ލ���'F���O�Ǿ�:
-��<l
%e�
��`�ؽJ�I��Q%
!�A�9^p/jp�}}Sװ���ۆ�F���������O&��(��E_=�
ғ�4��<n:fɜ/��M�Z����:1gi��+��H Ku)�]��㞁ڔݳV��ʅgg

-`��z���#�\
-�~��8��J���<
-�,ey�*�
LM����:bD̦�� ���@t�E�E�6���*nE�*Q��FA��
ډ(�]䉎�*��Y
4h�F�r�
�1��H֬�a�P/����2��p�B��mzJR��u(HEM �ի0�/ԉ�Qc�foLءGkH
����,PA�:����8}�rL��|o��f�V�c�i2��h�
�,�
>�|^*�ʮ+\�
qZ�Q�j�>�xbh����~��P	���l+
-پ���
�ٛʏ�c��^�^��ML�
�-�
��pIP��9��G��Vs��Fu¹����U��'öu���i��$lR����)� Y!ch�1oX] W|�۰����[]

���������rZ�t�&Y����>�Pns<��T�I���p��I �Z7��	,�
-endstream
-endobj
-6590 0 obj <<
-/Type /Page
-/Contents 6591 0 R
-/Resources 6589 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6407 0 R
-/Annots [ 6523 0 R 6524 0 R 6525 0 R 6526 0 R 6554 0 R 6555 0 R 6556 0 R 6557 0 R 6558 0 R 6559 0 R 6560 0 R 6561 0 R 6562 0 R 6563 0 R 6564 0 R 6565 0 R 6566 0 R 6567 0 R 6568 0 R 6569 0 R 6570 0 R 6571 0 R 6572 0 R 6573 0 R 6574 0 R 6575 0 R 6576 0 R 6577 0 R 6578 0 R 6579 0 R 6580 0 R 6581 0 R 6582 0 R 6583 0 R 6584 0 R 6585 0 R 6588 0 R ]
->> endobj
-6523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 693.226 179.554 704.13]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 693.226 242.925 704.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a548ae200545f7d25b875f190b5611368) >>
->> endobj
-6525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 661.772 179.554 672.676]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 661.772 285.516 672.676]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aec5860620ae92988c1740dc393064fe7) >>
->> endobj
-6554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 630.319 169.013 641.223]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ad7c61256a3d02a8f345701bf5eabdf6b) >>
->> endobj
-6555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 630.319 257.282 641.223]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 598.865 291.722 609.769]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a87998e7258a2c529be20f456ded30c90) >>
->> endobj
-6557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.538 598.865 361.181 609.769]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 556.452 246.034 567.356]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a6605130131af1ca6e54f8ce1e71a993b) >>
->> endobj
-6559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.522 556.452 360.71 567.356]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 524.998 233.76 535.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a32012e3b09434b858367d216108e42c6) >>
->> endobj
-6561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.575 524.998 272.763 535.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.205 524.998 323.393 535.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 493.544 220.778 504.448]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a20b0080e4a1abdb68ce945191c540b2e) >>
->> endobj
-6564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.594 493.544 290.237 504.448]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 415.378 203.075 426.282]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 415.378 296.324 426.282]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a21f1586e66349acf7aa0d70c77f92b60) >>
->> endobj
-6567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 398.978 352.207 408.883]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 384.298 194.297 394.828]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a6e742d7ffa4f4b7037760cf3ebf62348) >>
->> endobj
-6569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 352.844 188.759 363.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_af97f2d43a487ec81e040aec36bbc6ebe) >>
->> endobj
-6570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 321.016 245.406 331.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.145 321.016 325.654 331.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a11de7a0cc309058d6aee273d613c9432) >>
->> endobj
-6572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.844 304.616 367.996 314.521]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) >>
->> endobj
-6573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 242.85 237.376 253.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa83361b2264ca8ed30599dca32447874) >>
->> endobj
-6574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.713 242.85 329.778 253.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-6575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 137.405 180.54 148.309]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aedf8e546cc63ff0ade5d34cb995beb09) >>
->> endobj
-6576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 137.405 292.33 148.309]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.063 137.405 418.515 148.309]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 122.675 226.034 133.579]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a339fab488002bb5b341e1bb82edee103) >>
->> endobj
-6579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 122.675 405.628 133.579]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 91.221 156.281 102.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aaf3b18ae83d99811dad22d336a1a117f) >>
->> endobj
-6581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 91.221 244.549 102.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.761 91.221 347.214 102.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 76.49 156.281 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aaf3b18ae83d99811dad22d336a1a117f) >>
->> endobj
-6584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 76.49 244.549 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.761 76.49 347.214 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6588 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6592 0 obj <<
-/D [6590 0 R /XYZ 89 770.89 null]
->> endobj
-6593 0 obj <<
-/D [6590 0 R /XYZ 90 712.265 null]
->> endobj
-6594 0 obj <<
-/D [6590 0 R /XYZ 90 680.811 null]
->> endobj
-6595 0 obj <<
-/D [6590 0 R /XYZ 90 649.358 null]
->> endobj
-6596 0 obj <<
-/D [6590 0 R /XYZ 90 544.037 null]
->> endobj
-6597 0 obj <<
-/D [6590 0 R /XYZ 90 436.066 null]
->> endobj
-6598 0 obj <<
-/D [6590 0 R /XYZ 90 436.066 null]
->> endobj
-6599 0 obj <<
-/D [6590 0 R /XYZ 90 402.963 null]
->> endobj
-6600 0 obj <<
-/D [6590 0 R /XYZ 90 372.581 null]
->> endobj
-6601 0 obj <<
-/D [6590 0 R /XYZ 90 341.127 null]
->> endobj
-6602 0 obj <<
-/D [6590 0 R /XYZ 90 263.623 null]
->> endobj
-6603 0 obj <<
-/D [6590 0 R /XYZ 90 263.623 null]
->> endobj
-6604 0 obj <<
-/D [6590 0 R /XYZ 90 185.457 null]
->> endobj
-6589 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6616 0 obj <<
-/Length 2370      
-/Filter /FlateDecode
->>
-stream
-x��Yms����_�/M��x�
^��$N2NҎj��L�$�R�����{o P�\O����p����}��%
�
~�������D�b
�� �AeD��Tw!���ٜQJÛ�a^o�w73N�js�WE����\�y}����ڭ��-ջ7ǦU�ٜK~�ɛ�t_���g,
q�l�Œ�����۟/~��x�@.0#�$I,�woiP���%"K�=iD\@�	�\��Z�@^�]l����PA�c=���Tm^nT����e]�۲�i�W?��i0�QfV��h��
P�L���i������<���fs!xX-~W���W�m��,�5�<h�zmM�������p|}��$
��Y/7����gO�K�",�"���
6m٨���jЌUpZ3�Ii���B<�=�N4	�l
�4�����rר�-wk��S@;/7�FmP�gpf�
�Njr�v
�|c���vm���r�o6G37/~?�*�@9?Me����[Ӄ�ܐ���2�g��H�B�F)�ioE'}�om�Ì�Σ��ԓ
L9
?�

^�0�EL(K�j�v�R��c��o�FV��>�N��6f\��e��/A>@'�
5�&$J%Ȥ%x4Sј�(N݄|WL��4Iܜ�G9c��겪6�
-h��6�x��$KD���9�$㙎}.���V��< z��JJ���yU
LM=�T槞9���P WD.&l �`�̀;���N,%	E8%��q뜠3�	F��}��r(7��OM7Pת�W��/��(�w.�Z�ke=~]���-}ނ���U�N��u�ޡ%�eq H�l`�	���m��Y�1ƹS�b�3
��ZEu�庙�%�Y
����i�nƦ�:������g�;��k�1gY�c�����

�N���|�����*G��
���
[��A����T]}1��
1|�5�
-�+/��4S��b���%�Q��k�BF'��Sm�t�FI3�|�M��3�#LK�Bڴof���҈�ai��(59RZ,C�
 � 3p	ǝN 	�L ��hc���D�< ~�
�
5-�C3JT��W�����
��iw$���P�A��X{�$��D� �=�
O��Q��[�D�nq
ƉC�Pޟ��e'�
-�h���P���m��NG�{e�
�x�gP-���Қ����danr�ҧ�:�4e_��u��{U���0�@c!����X.b���y�m��xN�
-��4���Z�?��ҿH\�����Ϲ�����
���0��


ؚ��#04��A����_�l�N�<��prpq��f

6�	��D+�(>�+O�h�؏
(�IE�B�$�c�|.)�����8Rr��x� z��rc!t��c0�	h�#n߮Z�C
�N����twh|2�J|��v_
r�����@�e�M�
#tv�iׇ����ܺ��%4����KB"E^�/]
-c�1_�S`��/��
+GG�U���(�֌,��,�yU��.U�J
-`�@ϵ��Z���.Dd���
ru��T����F��"�E�i���O(�C���Nh�
�b������D<�$
_
M����r]�t�����Yn�yso7@�����E���V,��A�Z?`�|f:K�2}�xe�6
��
C���~S.��
k�2E9]�XX�V�
��p��jmʝ������.`��/U��	��P�u	Nh��Kz�h	 մ��? �}�{���� \��G御��>��/!��x����&���:
<���Ml=��q�Ŝ��o�(73,�mf���2;�S0O��
�ւ"�R�l���r� �L�/b
-�f��P���A$pn"�2�xt'd@`5�� }�y�S� ��l�.a�v��23��r��d��y�*����E�w6ĥ�jo��M?NW��O)l ��b�
�Co�V9d�	g ���	E<�$;r		8�z�Dںz
Z�j4�h
-��^��25Tn(�3��r� �v�|�\��]{�TDdws�S���e���_ �(0M8/���Z�{���uYl"�AĤ�=�uS�7�4Ha\�焃�+$]�L�ItDb�L\ �6ҁ$
lڛ�bj/p#���Η�z��@�����1�
�j���G$�}|�<�c��E"��n��V�ج z�|��T!�*������Y����������.��᦯1��鯋�@.>��E
4�T
-������q.�����on~5�����L��^�����z��3ܬ�h0&��7��7���\��y�(L�H�'�m����Z
��k�j�+==2}ٱ߮�OD۪��j�$��
%e$����=�(�]��^_�tځ�W[�������4��f
-endstream
-endobj
-6615 0 obj <<
-/Type /Page
-/Contents 6616 0 R
-/Resources 6614 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6622 0 R
-/Annots [ 6586 0 R 6587 0 R 6611 0 R 6612 0 R 6613 0 R ]
->> endobj
-6586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.91 665.984 266.363 676.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [111.184 654.028 161.316 664.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 520.539 188.212 527.758]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) >>
->> endobj
-6612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 313.292 188.212 320.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) >>
->> endobj
-6613 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6617 0 obj <<
-/D [6615 0 R /XYZ 89 770.89 null]
->> endobj
-6618 0 obj <<
-/D [6615 0 R /XYZ 90 721.073 null]
->> endobj
-6619 0 obj <<
-/D [6615 0 R /XYZ 90 195.525 null]
->> endobj
-6483 0 obj <<
-/D [6615 0 R /XYZ 90 173.149 null]
->> endobj
-6620 0 obj <<
-/D [6615 0 R /XYZ 90 173.149 null]
->> endobj
-6621 0 obj <<
-/D [6615 0 R /XYZ 90 88.881 null]
->> endobj
-6614 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F32 764 0 R /F7 795 0 R /F8 794 0 R /F11 613 0 R /F93 763 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6627 0 obj <<
-/Length 2272      
-/Filter /FlateDecode
->>
-stream
-x�՚Ys�6���+��J3���[�4�
i��Oi&�EZ�T"
�j���.@�&(J�,f:��#�� ��. �h
�����ٳ��
2����:28R� !�S��S"�/��Ԉ	���oyu����[��������W8"� ���V�ٻ�8J��F���k��8e���~�ao
F¾��_
��6G�9��*��D�D�8&Zd�M(��+���z"�s�ŢR��uO��PӟPB(�LG
-S�8m������,_p<�+�dɇ�\05_�i^�9�{�/�
i�&��Aӡ��qD�:��=W)6V���MY,���K*�<��������"&I��WM�@�F�-� �YyQ7ob/<���Ѭ�O�"��2��
R�
�?g�
\��hh.'���d�F(�b�!}��HjO-)��%��_/(���6��~���G���h�ٶo��
�My�`t^l���nҤ
1����TOa���B~ʮJԥ��]\|[��r��t�-�d(�6�+�������q��Ycj
-��
-�
�%�U�;x���@蒹�:�}.)'�h-}5y�sთ�z�u�>��hZ��>
�4
?�Ո���m���p,�����e�&���
<|
��$
-� :�'���/e��q�q�vA�<��nU�B�9
-���9�`���
- � CL��UQ���q;�{�v	��uhN=GSGh/Ǯ�r�ћ��
L���N�m�>e���5���ۂ���R��x�6�ޤ�eZAʋ��
�=����3���S�B���_���<ɪ:�׻����6nP��`�]���
��۬plȉB��h�`v��C�y$��n�R��z��._yO��w����ƹ��lͤ
1n��x
Y�YbM7G�4��(�7��9� f�(���	L���	L�@��ס	�&0~K6�X0����8�+;�D��fv
-b�8�!P
u�L��@��8� ���/��c����o�8sC/� #���MǗvX�.4� �ޠB�hzVa6V��t��7Y5RRȴ�k���
 h5�0@!��iH�f�|��Z?WeW����|�	ѳ���W��$HT�����=��$M
�,�w@�� ���[
-Iv�)�8�6��� ��v]¸m������I�����*����G�x ��[�0��(��(��C���P�<ڼ��(�O@!FRNb�
IZp	!�M`�!!&0c
�؃p�~R ����D��(�T��W#
-�D���͛tu�ڤ^添zD�A|	(�ʩ�E�4Ld���a)�AX�{E��RHu�(m�
�d �Sq��">8H	�Z�骡&��<����	_t�u�F��'�����]�l��!��I��*>Uf6�G�������#�Lb��9�$Z9Q���>-�X�i��'���&����;����T�\��U ���_���&q
Ls��wD�AX�a
x�RLqDա��}�Rv�A��&AI*{%|r$ m�z'�q8�!���'��6�[�>Ϡ���4o��~�e�"�m��=���5�:�oР���ͱ�bH�L��zb��T����
�U��=����I�0�‡��W�m��}�c���/(�
-���Nz�d�k
j���S^c�D�s�I
-*1�5Ɣ���W�x�x�9�1���L7�(�<����Cyx}�H*���;K���A��Om	şZBYi��)J���j�	Lhk������	
i����)������.�8�=���������DR��P
/�>�9��
>tN�%� d���n�p8�-��>�8{�B�C�PZcz.�ԖV��}�'1�R��p�l��K!.ThHK�8Y�y2�_h�+�B����	���
�ŵ�v�hU�S�@ki��
-� >U#��
��B; ��
�v{����C�b5�DsH�X&�!ʾZ9�N��K�� �zA�8]2���

`u�?�w��XҒƒw��n��)2yt�"
�0<<��:I��L@�
�W&"��/�a4�tmW�0�Atv{Ll���
&u0�VG]���`�e�7d%�\H
Y�Y»����Ħ
��o�v�)dG���0]0�(�TD����
w��󴝲�����#�6��q���;���X²�챿�u�0��m:>�ј(Eݗ���˶����E� �^��-��[3G!��K��6av�����o���?�9�w���]󫄲�~s 9���ك��m���������gn���
��-꛺��x��j���|�V�v?��;�@��^e{DSv�ʵ-;�0\
0y�t��

-endstream
-endobj
-6626 0 obj <<
-/Type /Page
-/Contents 6627 0 R
-/Resources 6625 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6622 0 R
-/Annots [ 6623 0 R 6624 0 R ]
->> endobj
-6623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.531 585.52 227.984 614.835]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6624 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6628 0 obj <<
-/D [6626 0 R /XYZ 89 770.89 null]
->> endobj
-6484 0 obj <<
-/D [6626 0 R /XYZ 90 688.794 null]
->> endobj
-6629 0 obj <<
-/D [6626 0 R /XYZ 90 684.311 null]
->> endobj
-6630 0 obj <<
-/D [6626 0 R /XYZ 90 559.991 null]
->> endobj
-6550 0 obj <<
-/D [6626 0 R /XYZ 90 537.614 null]
->> endobj
-6631 0 obj <<
-/D [6626 0 R /XYZ 90 537.614 null]
->> endobj
-6551 0 obj <<
-/D [6626 0 R /XYZ 349.813 468.487 null]
->> endobj
-6632 0 obj <<
-/D [6626 0 R /XYZ 90 461.847 null]
->> endobj
-6552 0 obj <<
-/D [6626 0 R /XYZ 219.882 382.737 null]
->> endobj
-6633 0 obj <<
-/D [6626 0 R /XYZ 90 376.097 null]
->> endobj
-6634 0 obj <<
-/D [6626 0 R /XYZ 90 287.767 null]
->> endobj
-6553 0 obj <<
-/D [6626 0 R /XYZ 90 252.249 null]
->> endobj
-6635 0 obj <<
-/D [6626 0 R /XYZ 90 247.766 null]
->> endobj
-6605 0 obj <<
-/D [6626 0 R /XYZ 285.395 190.41 null]
->> endobj
-6636 0 obj <<
-/D [6626 0 R /XYZ 90 183.77 null]
->> endobj
-6625 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6641 0 obj <<
-/Length 2905      
-/Filter /FlateDecode
->>
-stream
-x��Z[s��~ׯ`ә�����BM2c�u&i:qm�}p<�$NI�@���={�e�%Eɴ�:| .�sΞ���xr3���^^�=��$A��rrq=I�D�		w���)���ٜ`��ofO�r�^��Q<-V����L/Y^�iy~�C��)w�&˫˷�b���b3�p���ׄ�P�Q��`y|�rX�I3�y6�S���h�
#HSҌ��Aj?�Ҫr�.f	����*�s��m~��3��f3B��R�
ͳ�]��~f��	q�H�I�>{�O���	F,ѓ;;h=���j���g���GT�K��c�{iޅL)CR��\%���jI��"	�
�
-�	J���N��c	h�M�p"��ue��#0�
~� ��%T��\�z����W�;���v�e1�bz��-�,�E�M3��#�T(~L]��+�>],���l� �ֻ��Vu���ս��ղ^�gDLstXA�HD>CA�]
-���$�O�86"P��!���7�b�+�����`�q���7�t#(�P�t)�7�c�
-��-�̍�S�v�:�~�%P��Ͱ:6�#��U���~e�b��.p,�"ݱ,�D������7���Nl��D4-MƊ�{Y
���:`���P`,�$SQ��m��Aک�i)��(��ԊN��y��5sǽQs���s���='�L�I��K�&��xx(�BL��M&���D}����L�n�2t|��˗q7y/?��#�#�
-\
qA
�
�@�9�n���4e�6K�����bQ7��(�c'ౠ��< �� ���k
_1��
<��(4����A[s�J�l�\%k�f_K_sS�>m�Z�^����h���b����5OW�"Km�i��'m���mY��W��
�/h5�(��;��%Xw]0E�Q�	�$�Hb�+������.�(�8���Ay�|Qh���|�&(puM��6�0��|3c�!S׌�E�� ��)D�
�
Dp��l��
�0hR�	aX#��P�w�U���Ϸ9XWDŽP
��N!�V�P�׍�r
�(=SJ4�Z�5l!�+xsA�4�g�
iȌ�L>r����^��̳�(cMq�0
����L��2�P��[&0-�����!�z#4䝤�ِH�3����r$�-���mg8L�D)$���88R5H���Q2��_����
�#��IJ�n��t����i�{2�
�Z�)RP�O׺���ŗBh(p�0jd��#�B\U(Ho����>sN���<A��2��"�
�
T�P��e^��WC��"3����sG޸��n�G�5�˲�l�����C)]f��o�b�[;G���n���	4��sY���|q
}�
�;
P�\�ҕ�J1�B�m�h�VH�=�P��u	���-�I��BO�������	�ħ��m�%�Ik��盺׆�e
�&.]oW��AF���s<t��Xy�Z�V�O�FX&��E�]w;���Wo��C��
�
ŋF%�P�z��
-
�T1�dP��U�g'���^~�cv�E�D��鰛hK7�Z[H
*��8�0��������ȴ�O���}��v
���c�� ��
���)�Į
-@?s���PX�
M�\� ��	��Q(L2y
-

-���@�G�0�0p;� 
'k
-Ҡ�*�#����Ix�-$�����/fP~��#
pmˠ��n�1 at JPԤ��E#��e}��cHg� 32IB���U�.��hC�I��I��AI�3��$uk@�� '�
��MŐ"x���C;�T�,���!����
ު��l[����]Z��L’���m��<VD��{�����~��pK@��X^�W���f�t嶨��ꩭ{~
�^d�����n}�e���i���ȯ
Q���-}�	�K��Z:�a#
�ׅqpWGN:AZ�-�%-��UQ�G�@/�I�/0ܗ��%H�0������wp�67�����n��6�^����=�ܰ|�9
�"�5ɦt�)t�}g�i��Ce��3\��	�z`W
.]r���Xt+�{�^ ���ʳXPR�C���G:�Ď��p�	R*o��4g�ܨ��ޗ��
���9�,�����Ko� ��Ʋ
-f�5x�eOժ[��6f�FF����`b�O�5)5R����cg��1v���c�̓��,[��M/
=��oj�c���N߸�-�uWow~g���>�c��=���K��8��j$u@5�+�ĩ��(.cE��2ӑ�B*�.E�R@�9	S�Ϥ�{N=�2sy��,��dz�$�c�
?PJW�c��;�5^���:usr�S��KI��=���,����;]�
�妑����3�
��3�i�o��fx[��n�4��}�7�9�Ԍ�
Gl����2p�.ݺ�=]%�
`=2ƈǯ�7�>,0�GחG���p��q
��J�SR73�%�W4w��[�kZj�yCۨ��E�z5��M���-g��;{����䛼Lۥ��X�6�W�Un7�M����  �4�nR�o��p��� G�nW��v_�p��:�B�"�
�ܿ�!$�ZC�����u���/
�oO
-�m�
��dZ��W? ��S@����@�=kUd%�pЄ8� 
�,�V28�
-���Wvo'�L
�b�g^���א
������^�o�;�J�4�s�<sb��S+	��//۵���	�4���H�mK��Ѧj٪ϝ
���b1
-d?���MY�/�4�N�I9�6��M��-b[Ղ!����wЊ յ�]��@�p˻��p�U���=M�l(i������hN�i�͛_�ſ����iJ����nv�Id�#3Uk ��I�~s�]�x�������gV9�(D�u ⶮ��ϟ_�n�|s��b=v��< ǫV����E��s<�fyԄx������^���!�b�l���wm_6��Z�ɫ�����"�
-endstream
-endobj
-6640 0 obj <<
-/Type /Page
-/Contents 6641 0 R
-/Resources 6639 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6622 0 R
-/Annots [ 6638 0 R ]
->> endobj
-6638 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6642 0 obj <<
-/D [6640 0 R /XYZ 89 770.89 null]
->> endobj
-6643 0 obj <<
-/D [6640 0 R /XYZ 90 735.818 null]
->> endobj
-6606 0 obj <<
-/D [6640 0 R /XYZ 472.92 670.125 null]
->> endobj
-6644 0 obj <<
-/D [6640 0 R /XYZ 90 662.155 null]
->> endobj
-6645 0 obj <<
-/D [6640 0 R /XYZ 90 594.911 null]
->> endobj
-6607 0 obj <<
-/D [6640 0 R /XYZ 439.235 515.061 null]
->> endobj
-6646 0 obj <<
-/D [6640 0 R /XYZ 90 508.088 null]
->> endobj
-6647 0 obj <<
-/D [6640 0 R /XYZ 90 407.117 null]
->> endobj
-6608 0 obj <<
-/D [6640 0 R /XYZ 90 383.647 null]
->> endobj
-6648 0 obj <<
-/D [6640 0 R /XYZ 90 383.647 null]
->> endobj
-6609 0 obj <<
-/D [6640 0 R /XYZ 90 348.673 null]
->> endobj
-6649 0 obj <<
-/D [6640 0 R /XYZ 90 348.673 null]
->> endobj
-6610 0 obj <<
-/D [6640 0 R /XYZ 121.143 268.502 null]
->> endobj
-6650 0 obj <<
-/D [6640 0 R /XYZ 90 261.862 null]
->> endobj
-6651 0 obj <<
-/D [6640 0 R /XYZ 90 239.814 null]
->> endobj
-1779 0 obj <<
-/D [6640 0 R /XYZ 90 161.598 null]
->> endobj
-226 0 obj <<
-/D [6640 0 R /XYZ 90 151.961 null]
->> endobj
-6639 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F1 833 0 R /F7 795 0 R /F10 765 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6658 0 obj <<
-/Length 2573      
-/Filter /FlateDecode
->>
-stream
-xڵZYs�F~ׯ�S�2G�@�ڪ�(N9qm�<�)D�$TH�Ak��>�s�3 H�"��0GOO�_7�D�Q}������
-RH&����H�L$��UEcF���7?D\�v��o��滟o>���w7g_�(L%5R���bu���$�`��(!�ȣG�h	�Ṍ>���,��$������
-9��Pj8���βxY/fs���'��U�y�m}�6��@�>��J�,�D�<��D�����X:ڋW���
��,�8O�$��mjj��WUm���VX��$���	��GX*x�KR KȊ`ќ
-RaX�Rw�v��4�ܭ�శ�QJcP
]p>�c�H���|��$n���M��_w-^�s�7VǮ{E
��T�y�bn��D7j6�Y�rp�7݌g�=Ԯ�,h���� /=x�^*իEo��j�׍�XZnI�����m����
���j��Ue&oݢr��=Xw��{
ϵ?%p��Q�+y�����$���{��6ʾܙ��/�v��٦�;˦
-V����6����޺%2�����z3^;ʛ�v��e�'5q�/�xi4c?�櫬v�=k-�ÖA��z�>���Lxdr"d��ۧ�'�}tTF2�!��p}F�F�?��A�
E�9/H!�3�6��r'�47�R}Y/Q�/�EW��A3A��*��_�e��� ,���w���YQ�%9H�߭US��:���t����0�8�& �=u���e�.�4�g��V�ac'	�d)��df�C:;L\��$I�&Ŝ�g���T�
T�M��9�Q&^��s�Q
����/�y������z�X��
-���3�%x��)[��,s
뙴8\�,0��aE�
��F�P��fd�!��׺RvDX
���?W�h+�sP�؏(�&Ś��]A`$C��[��˅'i��}��F����<k��e����7'�����
lY.w&�j�w"�Mq/|q҂;q�B �vPK�VuS���#�z���q�O��
�����#��2$:V��-�u����P4�$��~���c5�xP�?P�|�;|2�b�	�F�ҦW����L70��piҿ�m���Ύ@"n�ذ�a��9;�f�9�h�#$؍��_m�BS`�(�J�"�B8�Z��A(\V��r
.����.�D]cV؛0�� %]�N����{�L�1l�� T�ĭ�J�q�ъ�q�Q͛�;
�gnA����w����N5
�AӋ�·"����F��$0���q�uZ�Cx��t������|p9{3�s�ضѠ�ܚqxh�˽�.C�Qx�3��У�W.����{�
-�](�Ǻ��Eہ�|�A�ֈ-�G�,O_Y��c�ѮZ���<���Ұ
-O�*�lToFt�'��n&S at v�s���fi
w?I����>)ˍ�=��[
Dk��V��ֳ�7�G���v�J{�|���G�
-T5��9�I�nD�����2mp��0�����ĨS�ϰ�����R}�d9
93����
E�
(���|&��9��	X�a�̟���������"G!r�22?��
-Yq
-\�P튯�m�`�V_J�P �H4��|��
K�?D�3�怛�<4� �~>
)0'sqJ\�����)?
�2��J��b�
�=*
-�=ˉق�T�/���H���乍W�3ʕ�����`�d���_�ё	$�A\س�p+5�v�1rP�3>ȶb���H����A�| �I��u?g�ZB��ZB0��b��vP��ގ��$پ�~w�%��A�;����7��f46� ��u�4��d�̳�8��D
��(
[A��<4RM�:z��� �l+h��kQv�ݵ�|J���̴�`�v��V�dIM��Vо
4n����sX6 	Q�u~N��f��pj�|A�w�h��ļ���nX�s
-��Wt�=��
��д5
��t�`� 2
��Av���uN
�c(�jj
D���[�P%ƈXflr��8b���3�lSOف �m̤O�Sۿ��8��%`|ټ�d��>�K�V[ q!m������
ۙ��D�š<Ӹ�۔�
fJ6�(8
��Y4wg%�K����ѻ+�@�zem� �>�NA�����[�m����I.�bB 3E�7�?���=�G������ZV,JK�UW0V��F`�p�Y��nz��ks���<B���סR�T��D�� +r/��FB
-�C(�H.�oA��p��f?�����8k&qn��)[=�Ӗ$S?n�����P `'��j�����t9� �(�$s��ʦ�c�����
��N'�
�B6�mq~�yC�2[��~y��
-x�n�k
-�"�i/�M��
KHN�׵(rD"�$������i{��x]{���
�.���5��/<�'����
-���\e︳=�-�ş��W
�q׸���ը��k����C���R�=�q�{���A�6�
� ��kB���I�]O�=v��݊GW-ۓ��������>�S
-p�����~o^~ۨ��4���~*��˞Xܹ�ʠ �|XE�>��:���?�<����'$M�Õ}��8?���oTsO �
f��E���d�a�7:�s�62Vޟ-�G
-endstream
-endobj
-6657 0 obj <<
-/Type /Page
-/Contents 6658 0 R
-/Resources 6656 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6622 0 R
-/Annots [ 6637 0 R 6652 0 R 6653 0 R 6654 0 R 6655 0 R ]
->> endobj
-6637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.292 213.855 696.196]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction_ac1c1301f7ca50550e48eb2e0e57528d0) >>
->> endobj
-6652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 657.397 197.875 668.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction_a302c20124e5caa73cb5a860a57d6be5e) >>
->> endobj
-6653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 607.584 221.603 618.487]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction_a1b6e413a75c138ef87cc373df0d25194) >>
->> endobj
-6654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.021 494.122 392.442 505.026]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-6655 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6659 0 obj <<
-/D [6657 0 R /XYZ 89 770.89 null]
->> endobj
-6660 0 obj <<
-/D [6657 0 R /XYZ 90 704.286 null]
->> endobj
-6661 0 obj <<
-/D [6657 0 R /XYZ 90 704.286 null]
->> endobj
-6662 0 obj <<
-/D [6657 0 R /XYZ 90 624.843 null]
->> endobj
-6663 0 obj <<
-/D [6657 0 R /XYZ 90 581.115 null]
->> endobj
-6664 0 obj <<
-/D [6657 0 R /XYZ 90 530.362 null]
->> endobj
-6665 0 obj <<
-/D [6657 0 R /XYZ 90 349.658 null]
->> endobj
-6666 0 obj <<
-/D [6657 0 R /XYZ 90 327.282 null]
->> endobj
-6667 0 obj <<
-/D [6657 0 R /XYZ 90 327.282 null]
->> endobj
-6668 0 obj <<
-/D [6657 0 R /XYZ 90 157.482 null]
->> endobj
-6656 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6706 0 obj <<
-/Length 1583      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�a@'�����m@���]�f���-�bl���Jr���HI�
�q;ـ�HEKu�<�
�$�&�^��^Hf(TX�s+��������6��z�K0���C�
f���ԡ�Ng������M<��lu||��l�H��
��J
��$/��Bea�f�K9�Ofa���{u�L�d�
W��ؔ��������뀀��"�*��o�烏�����F,�K�iny��uf}�=������-G	�c�%	A�g?Q����׬�.���N�Dy�����1�2 �����
�2� �>��!��#���o	)�m�2�}ٸ�]�AF��z(&*�N
F�3���v��}��b�� 
u,0:q\��Z���(��^
�qF�

���Me��t0*�:�"��M$@"����t ���Z�23�K=�j�=5�d���nȥ��SU5 �R35WI�?�zf����~)�^9�۫@Ti���� }���A?��x����	�uݓCd ��t��g,�C��p
zk�0�|��n�o
-�t G(�&A��*(�#�}�

o�|�*v^,�q�
>6�R�=��@���&Fc٤��&���ɵ
TR�	s
d�-�|�ExZ�	�$
�j?O�/d�qQeްRD�8
�/�Y
UC���hK�X��L#�ͺ�����PK�z&b:�͍G���`}g��I'�*�ҵ���1�ʈ�m�B�
-����0�
:��b� ~�]FQ
��Ug�j���;�z>c���V�Fj�,
4Pv�f�@��"�
W��q�X�&��>�"�:���!1=�������4ݏ���g*�/�B��e~�_��b߿�~�
y�z�e\TE��[�CqáU%�������n
-�b����1�w8�?��M�0����N&O�<��R��q�{����z(!>b>i8I{�
%���6�F,��
n����ރ�� v/�>~|���_�E<	
�o(�U&��n������x�v��C`�05b9)_��2�^����;�
ꑻ��v�(m��"uϺ��K�(,B��;3He��nk?�6�t֥^{S�c0���7Y+�'�u�*X[;c;��Ƒ���{U,�$_�u��
����p��y��D����I��p��a?J��e�nXwv?�R��~��<Z���Dd6����n�p����)A�4���G8"��1J�َ�ׁ��=Q|���}�C
-�{��A6e�^li�v��$���3E?���;(ں!_
�Q�<�#�>pD�:/{��0��@}����xQ��oS ~�ӑ�<��߫�R�8��^��0���Hu����8���SH ��&���w�E��y)XRW�
	�
�0� ��<Yn���UCײ��7Uf1��rJ�ז7%@�I��TN�̬�ZXQFQ���2�.a����1�γt��d7Y�+
�$L#;
+��ȭ�#�<�x�mj���1�r���pnWV�
�e8s��a���9��$HO� =a}P�,o��bխ?�ܬ5%r���ӢX

���\%4pn�Lˏ a���y��<͚y
n�5��>8�qI!!h���B��1��j���Ս�Wsf=K���l��Q
-endstream
-endobj
-6705 0 obj <<
-/Type /Page
-/Contents 6706 0 R
-/Resources 6704 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6622 0 R
-/Annots [ 6669 0 R 6670 0 R 6671 0 R 6672 0 R 6673 0 R 6674 0 R 6675 0 R 6676 0 R 6677 0 R 6678 0 R 6679 0 R 6680 0 R 6681 0 R 6682 0 R 6683 0 R 6684 0 R 6685 0 R 6686 0 R 6687 0 R 6688 0 R 6689 0 R 6690 0 R 6691 0 R 6692 0 R 6693 0 R 6694 0 R 6695 0 R 6696 0 R 6697 0 R 6698 0 R 6699 0 R 6700 0 R 6701 0 R 6702 0 R 6703 0 R ]
->> endobj
-6669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 578.674 170.687 589.204]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_abed774daa9ed3c470c7fd237bf40e28c) >>
->> endobj
-6670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.184 564.834 259.854 574.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 551.752 170.687 562.282]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a2c9678fbda42018549d63c11e4c806a6) >>
->> endobj
-6672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 524.457 170.687 535.361]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) >>
->> endobj
-6673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.902 524.457 330.546 535.361]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.91 510.323 228.579 520.228]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 497.909 170.687 508.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac8af5985d99461f4c7d765a67da5f02c) >>
->> endobj
-6676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 497.909 254.8 508.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 470.987 170.687 481.517]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a9c5004d1d218c6bfb999ce09552ac2e7) >>
->> endobj
-6678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 470.987 228.788 481.517]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-6679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.977 457.148 278.647 466.385]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 443.692 169.013 454.596]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_addfb9eaa7193de6902fad49459c57da4) >>
->> endobj
-6681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 443.692 229.605 454.596]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 416.77 170.687 427.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 416.77 222.233 427.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_adf87eef74d0ff9ff35e15aeea0a361c7) >>
->> endobj
-6684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.57 416.77 306.346 427.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 389.849 170.687 400.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 389.849 222.233 400.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a412d0108a72eca07f0075f7a60662e34) >>
->> endobj
-6687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.57 389.849 280.334 400.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-6688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 362.927 170.687 373.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 362.927 227.852 373.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_aef8ddf62527c76662e377fdc9b46b928) >>
->> endobj
-6690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 336.005 170.687 346.909]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 336.005 223.05 346.909]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a0ec1eb879aa24c8e3f8b9abc08a51f27) >>
->> endobj
-6692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 309.084 170.687 319.988]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 309.084 217.61 319.988]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) >>
->> endobj
-6694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 282.162 170.687 293.066]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 282.162 212.808 293.066]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_acade7cd192977aa0b43a42bbaafe1c27) >>
->> endobj
-6696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.179 255.24 263.349 266.144]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ad9a4e7c1648f42300ec153db346dffb2) >>
->> endobj
-6697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 228.319 179.554 239.223]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-6698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 228.319 204.032 239.223]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1e45c485643b62ed4d751fd0bfaa3677) >>
->> endobj
-6699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 201.397 180.54 212.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1ddeb95722df9e5f35009c6e017e2404) >>
->> endobj
-6700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 201.397 264.653 212.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 174.475 178.239 185.379]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a4db44a79e5e6eea466723a565634b017) >>
->> endobj
-6702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 174.475 262.352 185.379]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6703 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6707 0 obj <<
-/D [6705 0 R /XYZ 89 770.89 null]
->> endobj
-1780 0 obj <<
-/D [6705 0 R /XYZ 90 702.931 null]
->> endobj
-230 0 obj <<
-/D [6705 0 R /XYZ 90 694.821 null]
->> endobj
-6708 0 obj <<
-/D [6705 0 R /XYZ 90 596.807 null]
->> endobj
-6709 0 obj <<
-/D [6705 0 R /XYZ 90 272.013 null]
->> endobj
-6710 0 obj <<
-/D [6705 0 R /XYZ 90 147.206 null]
->> endobj
-6704 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6733 0 obj <<
-/Length 1857      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~�W�)3e����K�i��
}r<
��	�:��=+i��i'y��������ffl��'��~��^)�d$���Sbp��AB¯Ir�R��W��	�#�_�����_�
���z/��/=�pB*)��g��+�L���#ft�X�%�28N���?{�Ƃ��
jd`�GF"�B@` G�? �����_.
����?�T�ϪË̿�b>~�e�r���E	><=\�yƍ7"�|}���b6�t 1i�%`����6�6��H��Х%%���3�Χ}Bҧ�l� ��"Lu
����ɯ#�N��ϟ�
�/šŘ_p�����HYv~>�Q�o4XD��a������2[� ���τB\�x~&1₆燌V,���Ii�=%
��hI�
-�2/�y�]U�ɸB��q?

�D'�C#Dm1�z7����ʫ��W�m|�!��CUAa]����{x��QQ
��q�O��t4�'�]���M�㿠F/��e>6Nic�)P�^P�D!Iy�A�y=���
��
}��f���۴�Ƒ��u����q!��x� QJ��e>�P��㠵���J�.t�D &�Cd
f"0�-�0��jjC�NM 8nj��M�hȩ
�;9E ��)����I`ZUZUc��p&�Rh
X�id8	����U�jTAdxS�v�&I8լU�$H��B��
�%���#��i;R����*�P{(�6����b�75'���mV�|��.\4�ifU�c�im�u#�!��I#K&��\hj^))m4� �e�{���ѳ�y��i��VaPP�;�+�4 ]WF��E��&P+B�]Vat�y�٪X�z�p(�%�A�i��}��*��{�.�T0��(A0Q��S�e�h��gEf��c(��鴕�.���D"r��m�	0	�3ˎ��k
�U��*%�])q
�Y�Jɚ�B��"@pJɃ�Y)� P+%@g��SJ
��J)�Z)�r�N)AJ4JInQJ at L\ƀ�K���T�)%��$��F�0O1
-
 ��ʸ�������]�@[��
y at 0I�	ߣ�`JJY��ݪ�#����RO�G���|�����$�t�V���+^t����X#
*;���0^Rs��:LPWy`�W]u��m�	�-z��C�,��2˘��q&N�	P~г2��d�/��׉(���h�+/�ĈH�na2�̋ ��
�ZgHp���5�>����u�����{qk�Y��D��c
�&mC��C
X�fn��:s��ڐ�����U��>�E��PVL�:�������&�woRՈ(�Ia �
�C��\��A�ܤ� P7)
��MJ �I� tnRb ���  ('�^6qpJgM�K �U-lj�u
	��
l64�d�
,CV`}И�ݔU�`�zy@[ཻRk�7��Y�y�d !��E�S�"$��b)���HI�kh�MY��3/��ɧq哇c++���-׫D̳I'�r<����L�l�T.�W(��nk�b���1�5e��CCN1x:+� j���" p���Y1� P+�  [N���d�,ޚ���Z���h[�r�V`�j�W+p�(3�_�
��K�A
���b��WhA��3
%<82���ƒ���}

�lD�X
-���p�
��r��8GPxx8�
^zg�o�ɻ��nٞG�!Mc~
p�Š���:�\�=�
g�l�@Y����
-	SV��
-Ā����yy����p�ی%/�`len �+����~B��g԰����c�b��xS��}�-~��_
�?F��h�>��.����r���0�{�r�����{�\�Zx@~�|�y�\ޝ��]?��g�
�g�����ƀtiB��%�l�hvm���L:J�Y$]�
-endstream
-endobj
-6732 0 obj <<
-/Type /Page
-/Contents 6733 0 R
-/Resources 6731 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6622 0 R
-/Annots [ 6726 0 R 6727 0 R 6728 0 R 6729 0 R 6730 0 R ]
->> endobj
-6726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.528 650.522 232.305 660.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.028 448.242 197.804 459.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.985 164.224 251.761 174.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.629 123.028 385.406 136.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
->> endobj
-6730 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6734 0 obj <<
-/D [6732 0 R /XYZ 89 770.89 null]
->> endobj
-6735 0 obj <<
-/D [6732 0 R /XYZ 90 721.073 null]
->> endobj
-6711 0 obj <<
-/D [6732 0 R /XYZ 90 704.201 null]
->> endobj
-6736 0 obj <<
-/D [6732 0 R /XYZ 90 704.201 null]
->> endobj
-6712 0 obj <<
-/D [6732 0 R /XYZ 226.769 635.074 null]
->> endobj
-6737 0 obj <<
-/D [6732 0 R /XYZ 90 628.1 null]
->> endobj
-6738 0 obj <<
-/D [6732 0 R /XYZ 90 559.86 null]
->> endobj
-6713 0 obj <<
-/D [6732 0 R /XYZ 226.769 507.566 null]
->> endobj
-6739 0 obj <<
-/D [6732 0 R /XYZ 90 500.592 null]
->> endobj
-6740 0 obj <<
-/D [6732 0 R /XYZ 90 432.351 null]
->> endobj
-6714 0 obj <<
-/D [6732 0 R /XYZ 226.769 350.079 null]
->> endobj
-6741 0 obj <<
-/D [6732 0 R /XYZ 90 343.105 null]
->> endobj
-6742 0 obj <<
-/D [6732 0 R /XYZ 90 274.865 null]
->> endobj
-6715 0 obj <<
-/D [6732 0 R /XYZ 226.769 222.571 null]
->> endobj
-6743 0 obj <<
-/D [6732 0 R /XYZ 90 215.597 null]
->> endobj
-6744 0 obj <<
-/D [6732 0 R /XYZ 90 148.333 null]
->> endobj
-6745 0 obj <<
-/D [6732 0 R /XYZ 90 77.486 null]
->> endobj
-6731 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6749 0 obj <<
-/Length 1746      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�%'#�;4Ӈ6i:M��mԧ4�m��Ē
��������;<M<}"D-�݃��0]E�]~�Q���O���K�#K�b*~�,���D*�u���I(��i4N���4a4�]e������|�ο
�ߞ
-�y&β��b6͋�q���b6O�L���u��U���cV�N/���
��1H>
_�~
�>� Q�*T�h]Lz�?��o���pk���h	��z
���ѣ�p�a�� �5J��q��&�C�L��vzQ�g��׋���$�iy��l"�w���Ρ��uw	�l|� 1����uu�
�F�(ľi�X�kƿ:b0@�֥'��q�&��<& q5��p> � _BP�N�7q�?
�k�
�!��8���%��C����A��z|��Q����7�1L:�V�P�C�$�B�}�n��ӛ*
���:K��)Ѯ��'�깴��A�
Lc�]e�[&�Ъ1]N�fEc����%[F}��`@D}�c+ee�~<�
O�^m��Tm�}!�� c��
|w_��M�LXٸ��w&Z>$6e
"啑ב�Ia�M1�de,Š�f9C�xӔkI�$+
oΠ�p������?��d����f�U�Ŷ
.��1R"�H�������V��Nr$8�$�VF�������X
^ƀ�Bg��1
eMR���b�M�^_W���2���&�ܘ� ���Б���"A8".��]�f��&�
W��I\c�jfm\s	V�hV�C�~r3��
3�
hIĂ�V�m@�V-Z���F?�$a�Y-Ɠ���M�c
��״�}��:V��F�^�i����"�X,P2�Mb��!�Jd_!�qZ �!]zb��,�pm�t���U�G�U
q���T��QW��>��jH�@
cB NXQ�Xȡ�M���J�F�`zN�f���Z¤#G1y������Y���[�
#����Q7F;���0,]�B����4����[���DIZm�*��u��ؾKDEw�
�Ge�$x���Zpe	�=W�{���G�U��}Dϑ8:E��� ѓ���(��;��[�G�

��Y�.7!��P���GHN�dOB�_��I��i�H��<Γbo� A-y<;K��ג����	 ��<
��%��G�lHF��گV�pY�
�6�;!��W
pQ	�;\"3T�p�1�r/�s$�N�������AY�E�
�L�
vJ
N%1�Ɠ�:⑤�"����t��\��Zg�:V�*=��u�NJ��C��0�JGcT����l�>����� �)
f��`U�<{V�E)u�����=�S��Ӟ����;��_%2N��.e�Кwk��f	�������̝����x��'��W>���F
`��m@�$�sF�`{1����P2�+�6��( [...]
-걨�a<�(AiBQsWێ�S%w^��;%`�*ǭ��ڇ���)�
� � g��N	��
@��W)| �T���@hp���͈S�K� �;��#�A
��t�f��	��W"D3��'yͦ�`�J4�5��,�OO_W���l�}"e\�M:�M데֝�q6ϫ���&�FJ�>��˲zz+П���[�L��!��/~FEq3899��ʳ���MV�5K�~P6���d6o��S�9)?$MA=�) ��&��=GMZ�Ң�.�l
�o��:�ыx���B��
-endstream
-endobj
-6748 0 obj <<
-/Type /Page
-/Contents 6749 0 R
-/Resources 6747 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6761 0 R
-/Annots [ 6746 0 R ]
->> endobj
-6746 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6750 0 obj <<
-/D [6748 0 R /XYZ 89 770.89 null]
->> endobj
-6716 0 obj <<
-/D [6748 0 R /XYZ 90 704.201 null]
->> endobj
-6751 0 obj <<
-/D [6748 0 R /XYZ 90 704.201 null]
->> endobj
-6752 0 obj <<
-/D [6748 0 R /XYZ 90 633.655 null]
->> endobj
-6717 0 obj <<
-/D [6748 0 R /XYZ 211.835 581.36 null]
->> endobj
-6753 0 obj <<
-/D [6748 0 R /XYZ 90 574.386 null]
->> endobj
-6754 0 obj <<
-/D [6748 0 R /XYZ 90 506.146 null]
->> endobj
-6718 0 obj <<
-/D [6748 0 R /XYZ 211.835 453.852 null]
->> endobj
-6755 0 obj <<
-/D [6748 0 R /XYZ 90 446.878 null]
->> endobj
-6756 0 obj <<
-/D [6748 0 R /XYZ 90 378.638 null]
->> endobj
-6719 0 obj <<
-/D [6748 0 R /XYZ 211.835 305.844 null]
->> endobj
-6757 0 obj <<
-/D [6748 0 R /XYZ 90 298.87 null]
->> endobj
-6720 0 obj <<
-/D [6748 0 R /XYZ 211.835 232.049 null]
->> endobj
-6758 0 obj <<
-/D [6748 0 R /XYZ 90 225.076 null]
->> endobj
-6721 0 obj <<
-/D [6748 0 R /XYZ 211.835 158.255 null]
->> endobj
-6759 0 obj <<
-/D [6748 0 R /XYZ 90 151.281 null]
->> endobj
-6722 0 obj <<
-/D [6748 0 R /XYZ 211.835 84.46 null]
->> endobj
-6760 0 obj <<
-/D [6748 0 R /XYZ 90 77.486 null]
->> endobj
-6747 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6772 0 obj <<
-/Length 2126      
-/Filter /FlateDecode
->>
-stream
-x��Zko����_��@Kb�ɼF�M��n������
Y�mb%�K�v��{�/q$�a�)��R��Ι;��{fƔp]E�_~<������xcD��\G痑����(�_��S�9O>��
	m	s_U�_�w����G�������'
�h�j�M'�>�h��?�c�l�P5ZD�
\��Ǔ�� Y�6BD���J"��]o���P!���'F�e�l�e���by�����r�*����+F
ь��.�I��l��kM0
LP�o�
�\7���q��]0ƳD�'��߮�Y9  �-��Ds x�_��2Im���������%��Q�׌h+����ⲛ���%�h���_•����6HNO��&\���4I���T�$����r���1��5�z�Sn��E)�;�j���<_f��a�����J�`N9:[�n�p��W��'��p�WEs��ꛛ2K�B��i�ͳE�\�*�)� йl|}�7��꺘5�&�%
�֣�c��0&);.x_���Ě��[�'%S��.�V�"#�SRؘ��Y��h\cB^�ya�^��y����v�
� 2Rks

p�:���Գh at pB1#ޔ`�h
����(�D
n at 8L�3J����AiA���*L�� �d�� �L�/g����HӒ ����_=�@n� l2n
�O�&�?d��ry���5 at U���r�}C
G�l2�ŷ;����m/����sy�ȞR��
�d'���'<_Q㝠`��N�
;�YbP$R\�-���6�p����'�m��(��zR��G�c�sbAP�}nj%S��!R��$�
EAU�@v�
g �Q p8@!�	iM4e� 0�(���|�r>F����� ���˗u`42G��D �
���̓[�"�Uֿ����x6�
~
���kmO[T��n �����E���:�:��Q
n~U,n&e+���
���H~M$�=��s�z
�B�q蚚D]�n&�~Y��p�O�;�~[���6�*��U�Io]8`��Z��A+"��{��u
c��:��F	�*��H*z!��S
)��
"�}~���
P�wůM֦�M�:����MqkZN�`����CE�Ks�
����'���r�N�
B0��
3(�n��6��
-҆��Ѱ����+�A ��M)i�W��L�� �Q
�)�������\Urv����V*p����h��G  @�ʙ�vA���:0�}
���p�{TA_��
�3����B�0Y��fM����_=��#���T��5���k�P�nkF���-V5\x
�k����h:��?�`
P�k�ӝ�;�`�`U7bP>����yk
��6�lVL����d�����z����|r��>���I��*[�o��,{��|^�=�|yU?�<�yvP
kJ[�	��~𯜫�էTA`��������z�xER�U!��z�WT#U�	�A�6�^��Q�k�jc�ZGU��#�	�z{ 
�Z� @ Oޢ`M���G�`Q0�
0��z���w�ĉ��n��ꧤ��Z����L���֩��t2�6�6�P�9|�y%;]��![���#��gL�V��
�}aW�Y���S��~�.�fO���W�H'�M��̖�lC愛��g�H�A6����r:��e�9~���
�
1�Bk
ذAf�
-
� �	_�S��~��.��i��~�YY߿�[N=a
���R�W���v����ɼ-�}��������N��r)09fk{�����	�[ M�k���Xf��j�V��ªw��n�2ɈD|�(4V�G��ޟ&�l�A���ᇽ��w�����"*�� �A
-)A�@p
�l�f~m��†�uR�]n�e���we�w��c❋��_��ܹ���3�|r1�6���{�m��82kv���A�ݷ��M����ۉ]����#m{HP�]���"�1�k&��f{��ŇO�6xX�.��ϝ���!�U%�wP>e�
-c���7̓?-D�����R�K�[Q��
�ش	�������?�Y��D����_&�.�}x��3����8#UȐu���6�j\�u��U��

%�Ӹ�z��9}�����6[^����i��s��� �E��(��I<\T
�����z��
-endstream
-endobj
-6771 0 obj <<
-/Type /Page
-/Contents 6772 0 R
-/Resources 6770 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6761 0 R
-/Annots [ 6762 0 R 6763 0 R 6764 0 R 6765 0 R 6766 0 R 6767 0 R 6769 0 R ]
->> endobj
-6762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.89 157.558 270.461 168.089]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a21c60e2a5b7d04de458f4d6ff0c3bd9b) >>
->> endobj
-6763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 144.346 208.843 155.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a5bfc7fe8384a4382f89fdb9dc06d7f77) >>
->> endobj
-6764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 131.507 204.042 142.411]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a6fa16eb9302f619ceb4bafaa952394ac) >>
->> endobj
-6765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.954 118.668 222.123 129.572]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_af71ceaa08677639eff48aa5929df1c58) >>
->> endobj
-6766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 91.372 177.601 101.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.099 91.372 211.931 101.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_ad7326cf3c2ddd70745aa4a527ece65be) >>
->> endobj
-6769 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6773 0 obj <<
-/D [6771 0 R /XYZ 89 770.89 null]
->> endobj
-6723 0 obj <<
-/D [6771 0 R /XYZ 211.835 659.423 null]
->> endobj
-6774 0 obj <<
-/D [6771 0 R /XYZ 90 652.449 null]
->> endobj
-6724 0 obj <<
-/D [6771 0 R /XYZ 90 547.183 null]
->> endobj
-6775 0 obj <<
-/D [6771 0 R /XYZ 90 542.7 null]
->> endobj
-6776 0 obj <<
-/D [6771 0 R /XYZ 90 474.126 null]
->> endobj
-6725 0 obj <<
-/D [6771 0 R /XYZ 90 439.456 null]
->> endobj
-6777 0 obj <<
-/D [6771 0 R /XYZ 90 434.973 null]
->> endobj
-6778 0 obj <<
-/D [6771 0 R /XYZ 90 364.242 null]
->> endobj
-1781 0 obj <<
-/D [6771 0 R /XYZ 90 277.69 null]
->> endobj
-234 0 obj <<
-/D [6771 0 R /XYZ 90 270.74 null]
->> endobj
-6779 0 obj <<
-/D [6771 0 R /XYZ 90 176.066 null]
->> endobj
-6780 0 obj <<
-/D [6771 0 R /XYZ 90 135.492 null]
->> endobj
-6770 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F24 529 0 R /F117 2446 0 R /F93 763 0 R /F22 2996 0 R /F68 3032 0 R /F110 1507 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6788 0 obj <<
-/Length 2637      
-/Filter /FlateDecode
->>
-stream
-x��ZKs����W�!k�Ѽ�8U��:���b�T0	�����,+�>=����!�!`���������]���]�����b�AFR�\�&'J$(I�Wɻ�����`�go���r�޼�S<+6O�lU�7o�eZ>]]��wYZ������=�����������?\�t����&
-j03`�S�'?$2�*?������D�D3��=�R\�����n_��UV�UQ�T��w�t���&
�1RZ$
B�"��n3�Y�e��q��K)��/~������]��O. at Z��^������)���<�AۄS��䷋\�05�=EG^��3�(���izOa�������B��}���!��/�X�0ȚV�u����{�ի�0��=�y΋��x����օ�Ǎ��3�BZ�#����k�
�'��L�$��{�
���+��i9g
-b�ϮԭW�FJ���
cV�n
�H�&�u
ź��=������ o?d�5��8�ۓ���C�� ����"DB
}�Ui��V �j�o�,��
-R%vO�n-(G,c�AR�U֓
�!aX'�"m24�R=�g�t�ycl���

-	�:9vZ�rN��e��
��
t
g�
	��
Ҕ�	EF�&S\fDPFB.YQD9K���������`��$&����	
 �
=k@���5�Na���FXT��ܣ�HD�$`� �:�OP �H5��8��	�?8�A
�����\cd���\3d����0N;�;�`ƿ��
�vo�e�!�eokkas�h��-���:����<D��b[�e��xط�;��Sa��.�lW�kiiP��A���'+
����� x���Y�y���n΁���t�� �V����-���L����i�3G�7�-ڸMn��m?f����e�]g1�X>l�1�H�g5�o�a ֕��~�u�
6�9��ȡ���ؤ։
-�%d��
-EA�
_�ЂJ&���ꈷcBe �J���"
b�$���3r�H
-���("��	��Zz
-
(Y0�M�d�[Mb���1�0H&1FM���0[�E�����(2��JG?K&�T1 �~ RŐm?�9�]�U�l�s�p|�����P}Cr�vvQ	�E��.�
y
-�6
u  "PY�&�z(-83,g������Փ�Y��@���X�c$�B?�i��G�W
-x%
-˃v���}�0��S�w�ؘ/�fS,=��W�ٶ(��R�љa	#k!�4h�ꧫ��Q�:H�#�H���2�:����uVs|����}M���vY���0��9���q��&IŬC�(�a֡�����P�}�p_�+/w�����7.	�ag�
l�0
�
��'1�Ah�#���#*�$FѢb#��s���D7�Ѻ��
�o����\0��
jL��6D�����I9� Q�{�Dai�DP/�|��/K���	�FQ6\7����1�����O��
���,tI��������U��7
���& �q:����ˡ�w��a�U�b�WE�8��
-8����,�X�=D(R�>#GA�Є��#o]�J�J2�J���G{�/h~�e��z
�#�:�
���~`�}�[f}���,�c�`��,aml�,�
u��R�����%"^�SX"2b
KL��f�H��f	1K0M�R�,��jV��~�=��L�˰y!Q �,cX9f
-&Ca.U(��"�Bݧ�xC�����B
-��K�l�d�� ��la�`
�H��}%��H2�e
ki�,�S�
-h'���q�Q�5�ᗾ�Ut
-�%��
-c	�$�e��
-��7���M�cӈV
-��F
�H`"B��:��P�YQJ��L" H�$�Qڱ`�p�f
-#8��s��$i�j��-���>k�B��!��[S��	&z
������d1�%�\�6Y/��{����ړ
I*���N���GY�n;C�x����Fa����~����@��(}���UP��S�A[��q
-e�v�H�]������i��L�f���+z�(ѥF����a׉�ΣqJݦV$f3�E�L�#��{��s�:��gz
#hB	��9��1�8I�%-s8w��������aS�b� 
�-�u ��_ι@@m�C�$�mtبFG�R15A�]2��eE)&N5:�^���
�씷ɩ[��\�I�d@����/O$D��D330s���ْu��M=�*�3�MCY�{���G�6l��z��_��h�ۓT�Vß�m� ˴6S�D
?{
-l;+�n�br 
<`�� ��y�_��S��>�
<$� ��ᓇ��=l	��1&!P�P���0ڃO,և|��	`�b�%m��iO�]~q�qM%%2�������	��|S�lj+��9bO�$ �9Ɋ��<
t��}�N9
B +9eP���'�J�i�;s����Ǯ�n���p��N�;���'���a�۲�v���b�)l������X�n��� .�G�>p�������ѓ.B@�+��
M��u8/
"�K�u�۷o��?�Y�^b�9�5Ǒ-
�
2+��–M��8�,
�{����W�p�~0�\�pֺ��./?>���
�L:��w ���Lof�n�������>�)�IL��,� g����r{�׺v�Í��,�� B�˪3�
-endstream
-endobj
-6787 0 obj <<
-/Type /Page
-/Contents 6788 0 R
-/Resources 6786 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6761 0 R
-/Annots [ 6768 0 R 6785 0 R ]
->> endobj
-6768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 707.957 209.043 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a2eb19a01c9b844f52f86464fc8f0ddd3) >>
->> endobj
-6785 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6789 0 obj <<
-/D [6787 0 R /XYZ 89 770.89 null]
->> endobj
-6790 0 obj <<
-/D [6787 0 R /XYZ 90 679.762 null]
->> endobj
-6791 0 obj <<
-/D [6787 0 R /XYZ 90 630.801 null]
->> endobj
-6792 0 obj <<
-/D [6787 0 R /XYZ 90 580.922 null]
->> endobj
-6781 0 obj <<
-/D [6787 0 R /XYZ 90 558.545 null]
->> endobj
-6793 0 obj <<
-/D [6787 0 R /XYZ 90 558.545 null]
->> endobj
-6782 0 obj <<
-/D [6787 0 R /XYZ 283.294 483.132 null]
->> endobj
-6794 0 obj <<
-/D [6787 0 R /XYZ 90 476.492 null]
->> endobj
-6783 0 obj <<
-/D [6787 0 R /XYZ 200.604 415.007 null]
->> endobj
-6795 0 obj <<
-/D [6787 0 R /XYZ 90 408.367 null]
->> endobj
-6784 0 obj <<
-/D [6787 0 R /XYZ 235.732 346.881 null]
->> endobj
-6796 0 obj <<
-/D [6787 0 R /XYZ 90 340.241 null]
->> endobj
-6797 0 obj <<
-/D [6787 0 R /XYZ 90 234.641 null]
->> endobj
-6798 0 obj <<
-/D [6787 0 R /XYZ 90 230.158 null]
->> endobj
-6799 0 obj <<
-/D [6787 0 R /XYZ 90 161.584 null]
->> endobj
-1782 0 obj <<
-/D [6787 0 R /XYZ 90 67.895 null]
->> endobj
-6786 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F90 758 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6830 0 obj <<
-/Length 1718      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~���0��Њ�E��`�%m��M�$�K��$Buq%9���
I�ղ�4�Z
A`Y&?�s��
�v�a��䷳��k�i.rmjkg���5�r���\;�)������"�
�����^
���M^�M�L��5R
-���,��_`m��j1Wh�ŠP�(��@;��9�
-
F����B�A.紂_	)!i&����t/	�U<��HQLe�݄�!.�� bcd9���`T����ZΓ
�w��³
�i#x�O/1L�����#	_V1�|"�
����Ww�D��G���8J�U�!�rw�9
aGt ��L�,MP*��K���D^�.�d�r9�}��}3�X.դb��B�~4
��b��kX���r �:?�#:"
���X��z@�Hؼ�k��s
�������LF0U����6V���
�R)��2�e`����F
v[8���r%P�Y)�#��75�hr�L{�f���
Nba�O�)�s`�X��9����4Pl��4�l
�I,$��ԓ��,gYn]��E��o���+��
D�p} ��z^�Q�Y��H�4
-j�Јm���ϒ�h��Zj�Ž�,�+V$@yД�FSJ/7�z��v��� `��:ͭ��(���[(�I�í��#o��t�O��Ę��:kX��5�d�~�Y����-�~�c>�l�xQN��v���J"�Y����p\��d�$D &Hm�x��.�D���Ӷl�,[�kA����}��)X�Ȼ�L*E�b�ϊ�"���]����?@��㊗ �����|eߖ�G�2ߒi~
u.�AJ��?^�O��-|���NF�MU��Vk9�h)����
$Lm+�6�3FӦm#�xW�'2[&Q�S�l��*����@��Q�Z����^�{�@n������g���a�r�a=�T��־쫱��}c?������2&��
���q��W�x��)A���-vd �w�1T���Gֻ
Y� ^���I�@�3� b�A���k��V�nT0u��|sx��~��M�~�&�X�lCB�vk�x%��n{�ݪ>7�Q�Ɋo��f�T��*��ՏaUR��e�(Z��M������뫞�! [...]
��
^7Y���A6�
'
C`T-�~@
-��
�;u�˺�g��G^����/ڽ�����<?��P���_��q(�٦QU��
Ĝң^.Rd����Z��q_�HB�fgH\ ��%.
Ѵ�%O��£r��B�[u`*6������U�q�?��h�Z6eh*�!������]� h<d'��t���zV[���0�-���[�aw�
�b�[l�p�N��g��}���J��� ��@���
p z�b��A�8]�.lQ��	(��� �\@z�Wn;��,��ku!TGe= �A�f� `a
ч �fv�Ϧk9zE�KΐhBϹ`�
�:�9H�:�z1 �d�S�L��,Q"��"�g~v�1lYT�VQ����t�+�yDb�w��W�W��f

-ɩ���C�ܤ���?�D�
 
�� �M�� 
�Fՙ�n���y%8����lM�r��,�\g��R�_�����^��
2�0a�8䙍��[�N�#�`�jL��|��|�+��O纲�{/ZzA�n�!�&
-T4	�a20̩�Z	%��5�?��
n!���Y���ۛ.�R]�Y
��k����uj�e�
a܄Fx!e�x�uLe�
-endstream
-endobj
-6829 0 obj <<
-/Type /Page
-/Contents 6830 0 R
-/Resources 6828 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6761 0 R
-/Annots [ 6800 0 R 6801 0 R 6802 0 R 6803 0 R 6804 0 R 6805 0 R 6806 0 R 6807 0 R 6808 0 R 6809 0 R 6810 0 R 6811 0 R 6812 0 R 6813 0 R 6814 0 R 6815 0 R 6816 0 R 6817 0 R 6818 0 R 6819 0 R 6820 0 R 6821 0 R 6822 0 R 6823 0 R 6824 0 R 6825 0 R 6826 0 R 6827 0 R ]
->> endobj
-6800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 629.38 170.687 639.91]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac54489beb3010518b290d6afa08902b5) >>
->> endobj
-6801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.184 615.189 259.854 624.427]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 601.756 170.687 612.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8179a7265eb8cfa0fbb55b7f46c18b0) >>
->> endobj
-6803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 601.756 254.8 612.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 573.759 169.013 584.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a5d627d5308cf0cc64f5017c13d956532) >>
->> endobj
-6805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 573.759 229.605 584.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 546.135 170.687 557.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 546.135 222.233 557.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ae4fc34e44b3473124567a5ee4b03fe57) >>
->> endobj
-6808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.57 546.135 306.346 557.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 518.511 170.687 529.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 518.511 227.852 529.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a47dc6fa13c0ff235b9ad27ae26973bc7) >>
->> endobj
-6811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 490.888 170.687 501.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 490.888 223.05 501.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a030483dd2c1346262825de9b2a7f985f) >>
->> endobj
-6813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.452 463.264 193.621 474.168]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a81fad4c0c11e6214ddf1851573e56b5f) >>
->> endobj
-6814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 436.014 149.098 446.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-6815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.596 436.014 183.429 446.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ab02f5557504544356029b3bad5f64942) >>
->> endobj
-6816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 408.016 180.54 418.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8d7d3ac7c1bf2bab50a5594a41a2f25) >>
->> endobj
-6817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 408.016 264.653 418.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 380.392 178.239 391.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a50973a7d753dc94afb42a610aa71d68d) >>
->> endobj
-6819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 380.392 262.352 391.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 284.112 156.281 295.015]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_aeafa7f136ae6eb82b0b996a2df4c6606) >>
->> endobj
-6821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 284.112 297.669 295.015]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.881 284.112 453.453 295.015]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 256.488 156.281 267.392]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_aeafa7f136ae6eb82b0b996a2df4c6606) >>
->> endobj
-6824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 256.488 297.669 267.392]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.881 256.488 453.453 267.392]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.528 92.934 232.305 102.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-6827 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6831 0 obj <<
-/D [6829 0 R /XYZ 89 770.89 null]
->> endobj
-238 0 obj <<
-/D [6829 0 R /XYZ 90 721.073 null]
->> endobj
-6832 0 obj <<
-/D [6829 0 R /XYZ 90 647.864 null]
->> endobj
-6833 0 obj <<
-/D [6829 0 R /XYZ 90 480.388 null]
->> endobj
-6834 0 obj <<
-/D [6829 0 R /XYZ 90 329.841 null]
->> endobj
-6835 0 obj <<
-/D [6829 0 R /XYZ 90 243.036 null]
->> endobj
-6836 0 obj <<
-/D [6829 0 R /XYZ 90 168.99 null]
->> endobj
-6837 0 obj <<
-/D [6829 0 R /XYZ 90 146.613 null]
->> endobj
-6838 0 obj <<
-/D [6829 0 R /XYZ 90 146.613 null]
->> endobj
-6839 0 obj <<
-/D [6829 0 R /XYZ 226.769 77.486 null]
->> endobj
-6828 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6851 0 obj <<
-/Length 2027      
-/Filter /FlateDecode
->>
-stream
-x��ZMs�6��W�*K@��U9$��V�I�d�{����%�f�"="���O�!R2eq2�T�S$�xh4^?4A�����}u9;{�!��*������@
K��_��u�(�j
1Jix1g4�׫��Ŝ�0��p�,��ۗ��:^8?�fI�~��o��93aRi���/�(ߦe���|=�����⢨/I���}�H�(&B�����w�o.g�f
�Ҁ��$�&X�f���`���
(k��U�U 8�������m��c����k���A3F댙p�7��w������@�!`�Xc7�� ����\́��猅���8�r3N%�L{깝G&��� ���R@y\<y��G `Ÿ��
-A�����0S�/(%L���q�h��J:������*��3A�F�����uX��u�\(i�V5��n�0"�M
Ӷ-�r�
-�D3޶A��A(���\��^��
�֛ʱ�={��f#�s���QS�yy��,���
=}h�P�
7N��
�t��>��Z׉$��vV���1

����~�i��=ۥ7��f�=�o�@nk��Zĵa@����Ҡ	=�l
��Xe�%�MM�a^d�w�cKy*��"��ñ	/?{��qY_�O��ꫫm �ɒ
�/����o4)0~'���Z��Y�
�� �E��
�u�9)Z��0-u�T70���:�Cٖ��)�HB�mY�����C�:D� ^%��f�F1����7n�٢��U��:_<�����[�Y	oE\� ���t��)O���CE�Ĉ'�P�'	�		[8SL��
-�Sb�8���<�����vFb��1F�HM(�) �����a�QV��e�S�-� B�
�p��>��ñ�'}Q�-��f]�#�����@Sd/�
��4�DAgԒD�/�z_��6s��TQ�ֽb'[���Rl�� S	���PK��c�B)�Ia�X*'LH�[�$�Ќ�i���2�(Es�AA��x��)�x�O��I���FD2���J��n�EhQJ6e\>��P�n�u+�p���˧5ι�Ӊ$k����Z����؁

�+$
l=%.f��08$��!N|WpF�T'%e4!��L)�G�#PNV�I (�)Q��Q4��� A�
e'�D�@Q�)M�h�ĩ!S�8r�1̇�H�}}��WM=EI�[Oah��#�
`�ÅTO�B� J����k�D�
�3J�4k�[�_�
�d�@G. at D_n)��H��k��P�@��$Q�1�u�2��
@�
-1er��b%z ��ܨIU���G��q
�
�3dO\��V��p4K����y���Q�&��S��s-�
�H���E|<у;q��6{X�`��-'w
��
�Y��{b���]�f�@@q9ރ0�(�d������1B��$e�$0���>�J���FH_#����w
-8�e|o����Up��!���_
?��K�cz3�a\&�zG�m���,�3��pu�g�O�y[9N��\:��4��j���)F����#�md�&��@mb����
-v
"��_�)l�dEs�vRs�?�<�-�1�ޙ��~ `q�� 
é�f�IU�	I���D��Ju���hR� BK�]Ǒ�� 6��q
�N �%�.��HՅ|�$V�����*JЍ��G�*��q�c�?�s���[�Jܪ}n�Or��#���]2@���A���C�(q�Q�ث�
aB���r�@�RP��i ��-݁0�:�
�5pG�p�=c>Rj��)&��-1|[z|t�Z�\�wU
CÏ�.E�d��ݢ�_�jζLS��%)�Y�Ð��������;Mz,�pk�fe[>h����@��S��7������ٳ����A#L�
ƞ�l���r;���F9�{
-���e}�"Y��
�j
�C�=�M���r5�ɺ�F�M\�nʉ+���U�4�kп�����3[(��ܖ�������M�d7d������%To�zë�|�֋2���Nk�v�l�4H6J����wH����4�u����͍�oW|����e��2�
-endstream
-endobj
-6850 0 obj <<
-/Type /Page
-/Contents 6851 0 R
-/Resources 6849 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6761 0 R
-/Annots [ 6848 0 R ]
->> endobj
-6848 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6852 0 obj <<
-/D [6850 0 R /XYZ 89 770.89 null]
->> endobj
-6853 0 obj <<
-/D [6850 0 R /XYZ 90 721.073 null]
->> endobj
-6854 0 obj <<
-/D [6850 0 R /XYZ 90 658.004 null]
->> endobj
-6855 0 obj <<
-/D [6850 0 R /XYZ 90 588.648 null]
->> endobj
-6840 0 obj <<
-/D [6850 0 R /XYZ 90 566.606 null]
->> endobj
-6856 0 obj <<
-/D [6850 0 R /XYZ 90 566.606 null]
->> endobj
-6857 0 obj <<
-/D [6850 0 R /XYZ 90 496.059 null]
->> endobj
-6841 0 obj <<
-/D [6850 0 R /XYZ 211.835 443.765 null]
->> endobj
-6858 0 obj <<
-/D [6850 0 R /XYZ 90 436.791 null]
->> endobj
-6859 0 obj <<
-/D [6850 0 R /XYZ 90 356.595 null]
->> endobj
-6842 0 obj <<
-/D [6850 0 R /XYZ 211.835 303.072 null]
->> endobj
-6860 0 obj <<
-/D [6850 0 R /XYZ 90 296.098 null]
->> endobj
-6843 0 obj <<
-/D [6850 0 R /XYZ 453.931 229.277 null]
->> endobj
-6861 0 obj <<
-/D [6850 0 R /XYZ 90 222.303 null]
->> endobj
-6844 0 obj <<
-/D [6850 0 R /XYZ 453.931 155.482 null]
->> endobj
-6862 0 obj <<
-/D [6850 0 R /XYZ 90 148.509 null]
->> endobj
-6849 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6875 0 obj <<
-/Length 1785      
-/Filter /FlateDecode
->>
-stream
-x��Ym��F��_AU)5R���/VS)MrUӼ\s�O���l|����8��,`�`�#Q*勁e
fg�gf��k{��~���*�d$����3�S� !�j�]�)��ۋg
�#�r��O_^��FO/F�Fna�X)�͖�˷؛��3#f�w[NZz�28������4GDEqZ
*�`s�P�1�a�p��u�o�d]��7wr*�O�6���1�x~�*���O�8Ȣ�*�F҅=6Sfi�(f���΢0���*��<�W�S{���NN)oP
i�jG�
fg)њőѤ���Dk;��
- �$d��qޞ�&�b�)�&�"��s�JĐ�'c ��1��f|�S�X�E&� j�'%7�cKM�KL����$�"�%���
-ԙ��p2�ބ��!��@)��
���*
2�����y��p���J
BKX�x�a���u�&��,M�y���@`� ��@��0
�4�Nӕ={����,�?̌h{d��ҭX,a-�������

��6��� �3-@D�zƇ
@Z�L�L����oL@�z�e��o
B�˾	�
c��D���*�%�I|N��f�����f�m��X��`ȥ����೥�O@%�ν2�e+Td`?����{��,��˄0�@%��PSW)ZF��E�<�	�̂5�X��6�]�6��A0� �DL��������/W�D�AqQ+\�������Fq\�Z��e�����=zW�	�ݸw u�

w� �{8�p4
�ɀA���B�m'#����UrE>��H���JΠ2s@�UɁ�P*�܃pw%7|ł��8 ���� �JΉ
���?<��Q)9�Ǖ�@��]ɿ+yGɹ�H: in�Tr�$L��\�i�?A��	�W�
�G%�|�
 [...]
-�Ԓ�����N�"��ت���k;Tl�����
�8�%JU��J�;�r" �V���
�c�Ejk��*c�
6�\7g�Z2!���
T��6sLnZu��"1ⰎTa�
�ޒa
U� (�K)
NG�8M��M��ž�p##�-��q�]���pC�I�K
�v��h��U��h?�������a���P~A�ZuD�Q�W��>@��V#�=�K�v̚���
@�@����do�aMAm�gH���鱥��
/�k��tZ6=�w��'@l
V@����
-�G3����*����n!Մ���°�]W���.��IƲ��5	�`�.DАr�INaA8R�Z�'�"��y���<�̊w�
�������Q�(�2��K�^C
裆
l��W���x
%A��ݴ�~E��uVE���O`���*2�I�a���D�1�
E̓����/�
G�#(쮓e�q��`����,��,��?�Nˊ�);�w���(E˛���f�L5p�ǒyOR0�37{���z7b������n�wv�ܞ����|!�U%�"H6A�7�U�Ժ�
-	*#���x|
֚hq����sT�K
�ਐ�*in�|5=9��\���͠b�D��ac��.Me�L�zw%��eY�v�?̵`
-endstream
-endobj
-6874 0 obj <<
-/Type /Page
-/Contents 6875 0 R
-/Resources 6873 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6761 0 R
-/Annots [ 6863 0 R 6864 0 R 6865 0 R 6866 0 R 6867 0 R 6868 0 R 6869 0 R 6872 0 R ]
->> endobj
-6863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 171.733 170.687 182.263]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae7c03963759dfdb937135a7f99165361) >>
->> endobj
-6864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 143.922 170.687 154.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a12f3d0ee3885355092a65262f24d46af) >>
->> endobj
-6865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 143.922 254.8 154.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 116.859 178.435 127.389]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_af0ea51d59b5026db43b2edd4cee928ba) >>
->> endobj
-6867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 89.048 170.687 99.952]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 89.048 222.233 99.952]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_adca809f9ebacacf70bc610d41bbaff47) >>
->> endobj
-6869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.57 89.048 306.346 99.952]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6872 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6876 0 obj <<
-/D [6874 0 R /XYZ 89 770.89 null]
->> endobj
-6845 0 obj <<
-/D [6874 0 R /XYZ 90 683.788 null]
->> endobj
-6877 0 obj <<
-/D [6874 0 R /XYZ 90 679.305 null]
->> endobj
-6878 0 obj <<
-/D [6874 0 R /XYZ 90 610.731 null]
->> endobj
-6846 0 obj <<
-/D [6874 0 R /XYZ 90 576.061 null]
->> endobj
-6879 0 obj <<
-/D [6874 0 R /XYZ 90 571.577 null]
->> endobj
-6880 0 obj <<
-/D [6874 0 R /XYZ 90 500.846 null]
->> endobj
-6881 0 obj <<
-/D [6874 0 R /XYZ 90 461.775 null]
->> endobj
-6847 0 obj <<
-/D [6874 0 R /XYZ 90 437.242 null]
->> endobj
-6882 0 obj <<
-/D [6874 0 R /XYZ 90 437.242 null]
->> endobj
-6883 0 obj <<
-/D [6874 0 R /XYZ 90 379.099 null]
->> endobj
-1783 0 obj <<
-/D [6874 0 R /XYZ 90 295.681 null]
->> endobj
-242 0 obj <<
-/D [6874 0 R /XYZ 90 288.37 null]
->> endobj
-6884 0 obj <<
-/D [6874 0 R /XYZ 90 190.124 null]
->> endobj
-6885 0 obj <<
-/D [6874 0 R /XYZ 90 190.124 null]
->> endobj
-6886 0 obj <<
-/D [6874 0 R /XYZ 90 160.953 null]
->> endobj
-6887 0 obj <<
-/D [6874 0 R /XYZ 90 133.516 null]
->> endobj
-6888 0 obj <<
-/D [6874 0 R /XYZ 90 107.805 null]
->> endobj
-6873 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6918 0 obj <<
-/Length 1725      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�b at g-3CR/��v@�4C����SW�L;���J����
��f�u���~HDQ����[k
[�N~��
�1�
-Q�Sߺ\Y!��"χ���zJ0��=#���&x�Yt5�)���5_��ՋdQF�������ռ�I0-)�NN�"�ꫤ�eT�=�
���FU��|��p��ܞy>�2����ɳ���	-�E�V
b�g��o�����FNX���r���z5�}����k��;��#�	,F"D�'��\�L�^�<0\��?uʵ��B�V���J;�ׇ�'
�:>�nWM�#�1��4���-0��!��v���(��F��9>

+ �+d�8=4\Ā
R�)x�aS�1�
3��ěJ!S�O���w)Ȧ�N�_�>@1�E��C���l�ԟ)Oo����
��?�Al*'���\���t�/堸V3�-��{O����t��uK�v���8:��@v N�!%W2W�{�L�Ǫ/�y}wb�'`w�(��;�d�JU~�4*��H�ɓ'�ap@9��7��C� �����+?pg��q<j�jjT_���O̠d�T���E��hG��l?��v
-�
�@8T�E>=���z��G�a3�fD
���D�H1K��%q��gap>��}����N'��>�NK0 �&{�5����!�+��
\k�P m3b��ΉOy
%)x� ު�L6uR��X�!
-��qC%�i�1��Ʌ�������!~S�<ӃV
�tTI��D������K�1V� �����V]��T�†U
%��3�
�ŠT՟ã��6+��ͼ��Y$ɵ�,��F�W��jS�Y	A��)H�^)
������(
!�Pa�)���G�&���~ �C������Z�uU�iaSo�.����K�qS¹��P���V�] S�����^���r��H��dv�Z�P�fL� p2j9��P��$�2ۆ�|2���� ��
�`.6�|7<�{}�u���C[���J5��ǺD

L��Ho� �־	_(��X�n
!\��Qd��+�&=�@K���$7
-�(9JC@��.���"
�B_kJW��v���?

%&��
)�Rlk5��c9�q���� J�#~�\D  v��f�|’���ED��G��t_�V$����z����fo�V��R�~Y�\ ����*�l@��$6B��t���	��
g2�٤����SDE��-Ձ����U�+�*����@� s�0@���� /`MD<�z�S=�D�Ԥ��BVi�����@q ��^T���}���*ٳ`�JH#�!��&~/*0�
P��ba�i[����q!!��
���$:	 $�P�
��x9R�\�<%��_(�w��l#l	A�'ͭgNJGU�H�YE@��}�F�AZ�
\'�풏�S<��&m|<"�!�6E�v7�2

-|oP��{��
������Vr#��?^��
-�϶y,�VuЙo
$���?���B�J������ˈ�B��_���N�`4Q�!F�
"��6ۺ�d����t�[k�:�@Fru�y�Y�/��(�9��V@�3��+�{X2�M�0�s�oR�7�V#�2���~:<��P�?*^~o{�TG��Q��R��^��&k��D��T�|�͉����2����[[q�HM�9y]כ����v]�|
�l�

;B�YsV7�{V����Cg&�{d�*���ENH
 �[8�1a�q]l�򣙨;��3�:- ��g�} �

-endstream
-endobj
-6917 0 obj <<
-/Type /Page
-/Contents 6918 0 R
-/Resources 6916 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6934 0 R
-/Annots [ 6870 0 R 6871 0 R 6889 0 R 6890 0 R 6891 0 R 6892 0 R 6893 0 R 6894 0 R 6895 0 R 6896 0 R 6897 0 R 6898 0 R 6899 0 R 6900 0 R 6927 0 R 6901 0 R 6902 0 R 6903 0 R 6904 0 R 6905 0 R 6906 0 R 6907 0 R 6908 0 R 6909 0 R 6910 0 R 6915 0 R ]
->> endobj
-6870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 707.957 187.564 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.303 707.957 238.472 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae575efc6c01c4bf9968c7e27bb94951b) >>
->> endobj
-6889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 680.402 187.564 691.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-6890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.534 680.402 241.588 691.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a400c02f876d8f4e3f6aef2bfc5fb16cb) >>
->> endobj
-6891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 652.848 170.687 663.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 652.848 227.852 663.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a192ff11375b59075c9ea19a8c2b5511e) >>
->> endobj
-6893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 625.293 170.687 636.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 625.293 217.61 636.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a70e56452f6edfc1943b555156e6bf828) >>
->> endobj
-6895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 597.738 180.54 608.642]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a97586e332fd16ccf6e7d642bb4bbf83e) >>
->> endobj
-6896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 597.738 264.653 608.642]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 570.183 178.239 581.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a0ac88c873a13c4afa6f99d3d436e13a3) >>
->> endobj
-6898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 570.183 262.352 581.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [98.089 481.395 154.865 492.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
->> endobj
-6900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.288 481.395 513.996 492.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 469.44 125.317 480.344]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-6901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.667 201.16 216.973 212.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_add6624f4b11313bba2819951fb70ea2f) >>
->> endobj
-6902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.31 201.16 301.086 212.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 173.605 170.687 184.509]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 173.605 227.852 184.509]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a2d2a836128949f204da12c2fd3aa4f1c) >>
->> endobj
-6905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 146.05 170.687 156.954]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 146.05 223.05 156.954]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_ad9dae1bccc03e59bf39357297de71360) >>
->> endobj
-6907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 118.495 170.687 129.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 118.495 217.61 129.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a83032ffb501255f28077473407e1df81) >>
->> endobj
-6909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 90.94 170.687 101.844]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 90.94 212.808 101.844]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af6ff26a7d66d601d93e6548e8472c892) >>
->> endobj
-6915 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6919 0 obj <<
-/D [6917 0 R /XYZ 89 770.89 null]
->> endobj
-6920 0 obj <<
-/D [6917 0 R /XYZ 90 721.073 null]
->> endobj
-6921 0 obj <<
-/D [6917 0 R /XYZ 90 697.492 null]
->> endobj
-6922 0 obj <<
-/D [6917 0 R /XYZ 90 671.663 null]
->> endobj
-6923 0 obj <<
-/D [6917 0 R /XYZ 90 642.382 null]
->> endobj
-6924 0 obj <<
-/D [6917 0 R /XYZ 90 614.827 null]
->> endobj
-6925 0 obj <<
-/D [6917 0 R /XYZ 90 587.273 null]
->> endobj
-6926 0 obj <<
-/D [6917 0 R /XYZ 90 542.312 null]
->> endobj
-1784 0 obj <<
-/D [6917 0 R /XYZ 90 325.41 null]
->> endobj
-246 0 obj <<
-/D [6917 0 R /XYZ 90 318.282 null]
->> endobj
-6928 0 obj <<
-/D [6917 0 R /XYZ 90 219.983 null]
->> endobj
-6929 0 obj <<
-/D [6917 0 R /XYZ 90 219.983 null]
->> endobj
-6930 0 obj <<
-/D [6917 0 R /XYZ 90 190.694 null]
->> endobj
-6931 0 obj <<
-/D [6917 0 R /XYZ 90 163.139 null]
->> endobj
-6932 0 obj <<
-/D [6917 0 R /XYZ 90 135.585 null]
->> endobj
-6933 0 obj <<
-/D [6917 0 R /XYZ 90 108.03 null]
->> endobj
-6916 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R /F110 1507 0 R /F68 3032 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6950 0 obj <<
-/Length 1850      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ`R �Ph���mI�ԍݧ$(���H�B�1��;�<DR�,�
zL�K�~;�7;+��
��~�ꝜJ�h�����ؑ�F\����ΥT�?\�r�P�ho���~{s���ե뽸�}���p$�3^��}��n�r0bZ9�����Q׹s����s,��I�
-&��r$!��
�{J��|�=��0ޞ��w��;��U�1L��O��<A9v��7[��x����Ӷ��c�'�O�;
� ��2���FIfv=9��Q�D�%R��G����l��q�`�K��d��	w�*�i���I�Iw�݈�f��SBpE��+YX.�
��.���x`��4���M�rĸ�"��>��)v�4Ì������L��s�0��}h���;N����h'>�0o��&�r��Q�yZ
 1R�ܥ������ �$��0�����(�����I�\w�4�]�*HA�bM�1f�pK�I�y��#�5a��w,�X=��ګY������:��x�QL
�)o�g0N����U6߱aܮ�R�<]2�O�`�(�V?CX{{�_*֟L2ݯV%�t��]��+z���(��N:�*f��
-�uG��Y�X��R3g��
-SH�f06�V�C�u�j�T�!)�\v���u�sw����B���6Уo������X�
��
�MR��d�3�a��<H�p
�R�*��'��P�>�cQ1Og�sq�Oq4_o�tSz�Q#-X
$>��<qL���h�xr��p4�Y
?� ����yu�4_�y�I��ӛhlW��!
�,�(��Q����\~�\��ʨ{ѧ��'
{cJ$X
��)�0ٷ;�`S�ܟ��hm��Z�$Rņ��
B��u0IZPJW�����k^���e���px��������)��

؊.
��;��&�k �)��iDT
D
�a���k���x��$�F�2 *�v�k�=#
.!�C����iHVK;DDY-�[diأ�J9A��B�եs��r��.��a|��%ZX�1�O %V2l�]kŨG�Rz;��`@�Vd;��&�y�5��&��ϲ�sT��)'VE��x���Pw�J6�l�f�f���b�6��ޞ�@-]��̯*b
-�b�Tx:sֺ�,�j��
D202�x�n=kz(�z�
Me
�U�Xu�K��4�t���N�dA��b
�p��	W�C���5H[>��+��wP�n"ضd;���%V�j;S�*��d��i���;	�c 	�)fpF�dp�i,���)��NH�HeC	��8%]��$�u
�6�?z��G��r7�c�+�wg�7�ϳ8���]���%f��a��.y�ba�������5�F
?^)�]D2B�t�c%n�Y	��f��޽8
),�͆��/�����Ͽ̂Ș�0�4��nD<���d��T���<�{N$;6	Q�;Zd��
]_�jgdV�YG'���[�)Zt^��+S� $
-�i�;�� �
�ֹ����<��F�'/S
v���g�ߪjU�YN���e7��)��,�Y/M(H�7���Q�ӵ�/׫t_e�90eG�ke����\	�ų<����`
-E[�QT��`8�Z�-F��DS
~1���v
��J��Ď'T�;N���(70��9��+���h<��-�1�\R���[dI$���لwC�YJ��s�f� �');��+�=	�������#I{:��v�x'�q�r���1ۈ���F`��+��

��b�zj��x�}�c$ߛ&v�u���Ɵ��vn�U��	��X�E1v/�‘2\�Jؿ��
*x�g�.W�u�.�''���*�fX{�#+?P��Y�f.Yd'E}�ͅe�4�_
-endstream
-endobj
-6949 0 obj <<
-/Type /Page
-/Contents 6950 0 R
-/Resources 6948 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6934 0 R
-/Annots [ 6911 0 R 6912 0 R 6913 0 R 6914 0 R 6935 0 R 6936 0 R 6937 0 R 6938 0 R 6939 0 R 6940 0 R 6941 0 R 6942 0 R 6943 0 R 6944 0 R 6945 0 R 6946 0 R 6947 0 R ]
->> endobj
-6911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 170.687 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 707.957 227.852 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a9f126c32b4f43115c5f0211ef65b5eba) >>
->> endobj
-6913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 680.062 170.687 690.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 680.062 225.351 690.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a3d8ac57c5e5aa2a5c2f5576d490c4f11) >>
->> endobj
-6935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 652.166 170.687 663.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 652.166 211.991 663.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4699390a942c1aaeaccd2b89b67e5855) >>
->> endobj
-6937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 624.271 170.687 635.175]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 624.271 209.491 635.175]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a73e4d633b9400d175d45eb4e16f694d3) >>
->> endobj
-6939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 596.376 152.954 607.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.452 596.376 193.621 607.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af47168d758e7b40a1a458f985427ae28) >>
->> endobj
-6941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 568.48 144.127 579.384]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-6942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.625 568.48 190.68 579.384]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a108e6a6005f1a43bf906d349b9c40ea1) >>
->> endobj
-6943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 540.585 180.54 551.489]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a400322acab704cef7a052982929182ff) >>
->> endobj
-6944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 540.585 264.653 551.489]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 512.689 178.239 523.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4734a40ed0f8923109e02efe4cedc4c2) >>
->> endobj
-6946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 512.689 262.352 523.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-6947 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6951 0 obj <<
-/D [6949 0 R /XYZ 89 770.89 null]
->> endobj
-6952 0 obj <<
-/D [6949 0 R /XYZ 90 721.073 null]
->> endobj
-6953 0 obj <<
-/D [6949 0 R /XYZ 90 697.321 null]
->> endobj
-6954 0 obj <<
-/D [6949 0 R /XYZ 90 669.426 null]
->> endobj
-6955 0 obj <<
-/D [6949 0 R /XYZ 90 641.531 null]
->> endobj
-6956 0 obj <<
-/D [6949 0 R /XYZ 90 613.635 null]
->> endobj
-6957 0 obj <<
-/D [6949 0 R /XYZ 90 585.74 null]
->> endobj
-6958 0 obj <<
-/D [6949 0 R /XYZ 90 484.495 null]
->> endobj
-6959 0 obj <<
-/D [6949 0 R /XYZ 90 427.628 null]
->> endobj
-6960 0 obj <<
-/D [6949 0 R /XYZ 90 405.251 null]
->> endobj
-6961 0 obj <<
-/D [6949 0 R /XYZ 90 405.251 null]
->> endobj
-6962 0 obj <<
-/D [6949 0 R /XYZ 90 334.704 null]
->> endobj
-6963 0 obj <<
-/D [6949 0 R /XYZ 90 300.034 null]
->> endobj
-6964 0 obj <<
-/D [6949 0 R /XYZ 90 295.551 null]
->> endobj
-6965 0 obj <<
-/D [6949 0 R /XYZ 90 224.82 null]
->> endobj
-1785 0 obj <<
-/D [6949 0 R /XYZ 90 145.623 null]
->> endobj
-250 0 obj <<
-/D [6949 0 R /XYZ 90 136.92 null]
->> endobj
-6948 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F11 613 0 R /F68 3032 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-6992 0 obj <<
-/Length 1894      
-/Filter /FlateDecode
->>
-stream
-x��Y[��4~ϯ00SbJ��[^
-3@/S(��.O-�q
'kp�`;���9���޴��t
v#KG�ѧO�"ao�a�������y!
-%����
�H�%���{9'1�/�x~�<��]���)���U�.��tUF�����4O�r��;�'U���i^'�&����ȫz��wT�2mZ�x�mU����w�ۂ
-a�x�l;b�Z�c��� h(
u�������Z��.P��x7{�
��P
c#*��y�2�ͼ��fء���
F0�#P�8�.+?�gi
��j�C�[�������5``VՍ�~�
���D"Δ
�$�
��b�W/�ܺ5>2�^.l��A������E��y
-t�\�u�v�#J���d
���<�z.B�

F
�l�GQ��?�4#�'j�>:н� �c�`�Ns8

L�����c�{�(�e؜�W2tM���F�$>�	q�bͽ�l)���0���wI��'b
��>��W��L��'I~g�-O\&
��Gf̎�,@<����l�%�7�"��a�7I����`��H>��M[r;��>A���ްf1�鯎!�w�)�`�p�����nR�NǮq�P��,�;v��kv����zu[]X���E&�c[w�rJ��Ěw1���Y�����-F`U�;������	���yRJk�{�
#�Dc bH��pL� Ui�ҍU)��n/�̅^�d�
�����rlNJp$q
�Wi�V=���d�
-]O
 I[Yf9��@�4���l"�D��S�����ߢ� �t�ԎV��w��.HHW�[0���.h���
x��Q�%k��B���^g��X
�>���ų�øa��^��?��{GΉ_Wu�sBnǶ
-�RU��Uа8�����eo�.h<��3��J/Z���7-�Ҫ
'�6�I�^X
-��(�������%Q|eK��V `�f�4wc䶹X�j
f18�&&.��X��q��b:\�ȑ
���
A�,e��&��䝮A
-p�1������qwSdY�S1����h�]�'_�r��HK�a}��pȜ�@�T�<D�
���D>�@u"�+�mAZ��)��&�(
��с�V�r6d�}�E��	���{�i�n+[��}��C���pF@��rݗ�P& ��&��gB�����e|�gUI��m+�J�i�(���*�`ٟ
���̣�P׭�?�G������O��`�(�)D7K\
j+���a
� �#L����F"���M�^�&̾���B��3'��I	FT���+%��M��đ���&�\5�d9E���4N!�q�k�~U{x:�M��Ln;/.�݁�
-1:&����!Y�5�n� �w\-��`�w-e
U���@�����"��E�F���]���
<T��#Ac4���t"
aպ���y�Z�kӌ�IU� ��c�����3�ȸjge�f�SG���͛�k�
P
LiýMY�F̙0�:�ʒ!���o�8�ǣ��>CWW��-�S��Q�QΧ�4(7o7��� ���
-�#�
	��͋AO"1�a�
-krJF��C�h_Rn�@�;�iT�P�RU�O7�B���	%��IO����P
�`d�nN����'��qb�h��S7U�@")N�
���.>Tad�0~���aJFSwOp$�'�c)��
C!W�K�9C�<����A��`p�@�Ap�I���a�L\
-Hz�63z0{�w����;��G�������AIQ@ٻ>@e?�! ��ԋ�g��s����B̝��!�Q����h���d��`
L실��*��ה��p��A��.�u_�����lu�VI�Eq������Am�b���.4Hs�����68
-lm�C��
L2&��,�>�+�Ʀ��8{�c�� ��_�u�d�
-endstream
-endobj
-6991 0 obj <<
-/Type /Page
-/Contents 6992 0 R
-/Resources 6990 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6934 0 R
-/Annots [ 6966 0 R 6967 0 R 6968 0 R 6969 0 R 6970 0 R 6971 0 R 6972 0 R 6973 0 R 6974 0 R 6975 0 R 6976 0 R 6977 0 R 6978 0 R 6979 0 R 6980 0 R 6981 0 R 6982 0 R 6983 0 R 6984 0 R 6985 0 R 6986 0 R 7006 0 R 6989 0 R ]
->> endobj
-6966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.714 170.687 696.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a41cb3496510a68512516cf65f8d214c2) >>
->> endobj
-6967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 657.541 170.687 668.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9af54d524de94ada872d460c1dbd5cc0) >>
->> endobj
-6968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 657.541 254.8 668.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 630.116 178.435 640.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa82cf61e903a201fe8892501b209ab8e) >>
->> endobj
-6970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 601.943 170.687 612.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 601.943 222.233 612.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9571074ab0249afc1e440c8c5eb5d429) >>
->> endobj
-6972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.57 601.943 306.346 612.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 574.144 202.497 585.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-6974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.237 574.144 253.406 585.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a61b27b2ed8bbc9a128f9001d160b078d) >>
->> endobj
-6975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 546.344 202.497 557.248]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-6976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.467 546.344 256.522 557.248]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a2be2c8b9d00f81fc24dcbc36ad05afea) >>
->> endobj
-6977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 518.545 170.687 529.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 518.545 227.852 529.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa6e183ba7e931dc88e16fb9ecfa8b3c7) >>
->> endobj
-6979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 490.746 170.687 501.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 490.746 217.61 501.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a47def4dcb522c046a6f3a432d72008ed) >>
->> endobj
-6981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 462.947 180.54 473.851]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_affa77e724493813cddf9740767c2473e) >>
->> endobj
-6982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 462.947 264.653 473.851]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 435.148 178.239 446.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a26673943182a6efc6cc6e3aad8c731a7) >>
->> endobj
-6984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 435.148 262.352 446.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.68 346.127 156.456 357.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-6986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [485.444 346.127 513.996 357.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-7006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 334.172 165.147 345.076]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-6989 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6993 0 obj <<
-/D [6991 0 R /XYZ 89 770.89 null]
->> endobj
-6994 0 obj <<
-/D [6991 0 R /XYZ 90 704.286 null]
->> endobj
-6995 0 obj <<
-/D [6991 0 R /XYZ 90 704.286 null]
->> endobj
-6996 0 obj <<
-/D [6991 0 R /XYZ 90 674.753 null]
->> endobj
-6997 0 obj <<
-/D [6991 0 R /XYZ 90 646.954 null]
->> endobj
-6998 0 obj <<
-/D [6991 0 R /XYZ 90 620.88 null]
->> endobj
-6999 0 obj <<
-/D [6991 0 R /XYZ 90 591.355 null]
->> endobj
-7000 0 obj <<
-/D [6991 0 R /XYZ 90 563.556 null]
->> endobj
-7001 0 obj <<
-/D [6991 0 R /XYZ 90 537.483 null]
->> endobj
-7002 0 obj <<
-/D [6991 0 R /XYZ 90 507.958 null]
->> endobj
-7003 0 obj <<
-/D [6991 0 R /XYZ 90 480.158 null]
->> endobj
-7004 0 obj <<
-/D [6991 0 R /XYZ 90 452.359 null]
->> endobj
-7005 0 obj <<
-/D [6991 0 R /XYZ 90 407.044 null]
->> endobj
-1786 0 obj <<
-/D [6991 0 R /XYZ 90 139.992 null]
->> endobj
-254 0 obj <<
-/D [6991 0 R /XYZ 90 133.243 null]
->> endobj
-6990 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7017 0 obj <<
-/Length 2355      
-/Filter /FlateDecode
->>
-stream
-xڽZYs�F~ׯ�S��,Gs���nlo%q
o�͋�JA�HD-I( )[���s ĀYX�JG�7}|�3��d8���?/��_+�d$���ufp��AB¯E�aB�~��)cR#b$��/�����Wo/߻{g�.��<#p
g$H�l�>��	g
��S�3:��Zg�28���g�>�
FT�Sw��@V��DH@�n5U�U1��(Փ_���V���~3��f��5�����l�%q�3xq��R���}�	�'wE���xˍ������?D��A��bg�|WV8��<��6z���6ƐQ��?b�
P���~m�*7�������2=�
�/p���p�8�����L�E�M)���ⴁ��`��?��

G<����=<�}
��ب�׶��&
Ou���	�� O�ch
d�i�%��53
	�-�#%D�����+H6/g��Q����LM�&j�+���V���ӧ���
�B&yU�W+���@Ԉ�7��Iذ�&��A����Z���+� ���oKG9��p�W�!��n!!Z �H7��_�[�q$���-�mx(
A�	�G\�@ ��l�*�հ�y��!�o�����フ

?���<�ζ�kL#���L?�3h����-�/���T�NI�,%&�1�0���D��c!\����b��J�K��Wŭ�Χ���rĸ	��	�R_�K�eud��w1��M'q씈ɗ��n�E}�Dz\�7vc����R�2 �&˚,ͣ���r7���*��|mPH���˥��^x���f�k�Y��IbH�Vx�Ʀa].�����
�N��G���`E���c��ȫ���W��&R ��LNjR�t�� c�6�/Ic�
�K���Q�$c׈6�׻)��u~��R��a&��kq�ǥ�h�t���,���(�e���	 [...]
-��|��Kh��u���UQ5�Z�2��z[�v��3F�gM�Y*�$0��ؘX�-J8��Y��v_��fa��]psd�X�?�l&8G�q�7hR�f�a9��A �[W6��Eh��yLH�<��D!�����3��{V�"h��%��ג���~����,_��y {��ڮ��~*Ťm�
sx��̣�]}w���7
-�U5䓟Ƶ�z]Y�)Q�?���u���m*�d[W�Xh6�.겔o\0���vXq�N�)��>�2�\!�~���IN�	hB�r2���k$ �E��ɔk�3
-A U
-a'3�r�� ��9���	�S�˄B��b &A'��q����|
��4O<L�\@#M��,$R�u4�c�E��I�2ib_\��U|[�������5)
��a�u�y�EF�f���-��7Sྜྷu�!I��ʚr��&����+����Q�
,�8��-w����zyE԰��e�狲�6%�N�:T���9���'a���#r�1m(	]
���O�B���%
�D������X!���w������H��b3�}

}��V)Q��:r���]����# �y���i4�|

M�0
b�T�,�R��~>���[ p��k�n+>IѲK�.ag��4-����z�f��l1��c�f26�RŖN �
���>>�P���G�R�H�A��j/;��p��jw��vb0�FT
FƺT��d�`<�̡�fL"�;�ܐwX��<�i����
�k������%�n�k�G6`y��uL��5^,�7�
-)�ה1�N���F� F�X��q<�yr
�`.��8I�J"�QtC����X�D!�F@�a�O)I��y%E��ִ����<,�uZ�;��>����%z�-���9��C����S{���6S��l3��7V��̓���5e`��=�ӻ�Aۣ�_}6���� $3vD�f���
-H`���`C2Ć]#�6
�b
��z7�.6�R�Iج�3zzB ��*-4�Ϛ
���N���	���� c��a���%n=���O0���I��%�s�D��� CL� p�
K�ubֳO��±k�
~��v��yQ
-ˣ%�֦���"a�,�k�����
v� M~Wo
���դ��/�B�S_�� ��bŠPRշ����)=sY_���{'
�B��1�QB���x���M�l������^�
-	㿗���ׁ�ֹ�Y�/���f���
��@�� Ї���G��0��L�9
��ݛp򟭭�Ӓ_�M�
�
`����N��&ƭ�<yo�O%��6�>�ni�
8����������j���4/�ǁrx��U31i�p[��:\\���#���y�
-endstream
-endobj
-7016 0 obj <<
-/Type /Page
-/Contents 7017 0 R
-/Resources 7015 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6934 0 R
-/Annots [ 6987 0 R 6988 0 R 7007 0 R 7008 0 R 7009 0 R 7010 0 R 7011 0 R 7012 0 R 7013 0 R 7014 0 R ]
->> endobj
-6987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 685.855 238.92 696.385]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) >>
->> endobj
-6988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.89 685.855 270.461 696.385]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a4fd7b6cb64e68a51df8a7f8435e09805) >>
->> endobj
-7007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 672.719 208.843 683.623]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_af0b2ceba470bdb52cdf9bafa45e76b4a) >>
->> endobj
-7008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 659.956 204.042 670.86]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_ab758d05c4671c852880999550882f33a) >>
->> endobj
-7009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.954 647.194 222.123 658.098]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a50728db7969b64c9c4fe14e1da04f006) >>
->> endobj
-7010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 620.05 177.601 630.58]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.099 620.05 211.931 630.58]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_afd298b0bb1553ae69fdf50038423813d) >>
->> endobj
-7012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 592.159 209.043 603.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a0c5be0f5a6fef022b59c78a41f1fa0a1) >>
->> endobj
-7013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.38 592.159 332.886 603.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) >>
->> endobj
-7014 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7018 0 obj <<
-/D [7016 0 R /XYZ 89 770.89 null]
->> endobj
-7019 0 obj <<
-/D [7016 0 R /XYZ 90 704.286 null]
->> endobj
-7020 0 obj <<
-/D [7016 0 R /XYZ 90 663.941 null]
->> endobj
-7021 0 obj <<
-/D [7016 0 R /XYZ 90 564.324 null]
->> endobj
-7022 0 obj <<
-/D [7016 0 R /XYZ 90 490.002 null]
->> endobj
-7023 0 obj <<
-/D [7016 0 R /XYZ 90 467.626 null]
->> endobj
-7024 0 obj <<
-/D [7016 0 R /XYZ 90 467.626 null]
->> endobj
-7025 0 obj <<
-/D [7016 0 R /XYZ 283.294 392.213 null]
->> endobj
-7026 0 obj <<
-/D [7016 0 R /XYZ 90 385.573 null]
->> endobj
-7027 0 obj <<
-/D [7016 0 R /XYZ 200.604 324.087 null]
->> endobj
-7028 0 obj <<
-/D [7016 0 R /XYZ 90 317.447 null]
->> endobj
-7029 0 obj <<
-/D [7016 0 R /XYZ 235.732 255.962 null]
->> endobj
-7030 0 obj <<
-/D [7016 0 R /XYZ 90 249.322 null]
->> endobj
-7031 0 obj <<
-/D [7016 0 R /XYZ 90 145.612 null]
->> endobj
-7032 0 obj <<
-/D [7016 0 R /XYZ 90 141.129 null]
->> endobj
-7015 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-7057 0 obj <<
-/Length 1653      
-/Filter /FlateDecode
->>
-stream
-x��Y[��F~ϯ�ԇ�R3;�K�*e+(��OE�Ļ�j;��e���x�v|K�J�)�x��7��s&ػ�����bru��g��Tz�[�`OI�%�b��	F�S�1���~���r
P�o���h��˗�M
�g���l_�Y��N�agw����}���~����,x�xquMHkgF�.��#7��P^O��/�gE����[d�r(��E?���)�
II�)!�Ѭ���p�b� �kU�����3�&�~L���"0ԏ�]�y
�F��٪
bJ
-��FA���b����
��x.���*��}��5
��@�F{vR�q��7��L^Mpe��QQ>�?�eA��6c�)P��:X��A�4�z$���H
�a��},�
N�5���$9[K�7��1�4	,NI��Ε�b��;>"��������i�����0�� d��DJd��Xl*ߌ��a���[��h�Oq����j�j���<Z�ߋ��
-���5�	�?1fnVGF�zN����R��|�R�zP)��K��K
��&5b�o��vu�FY�
-$j�n�+
Z
(��2c�re��kC��۴^�’d[����C�$�u�<
q�=��$D��8��;��T@�����Tfn3�%(g5Z�zZKe
�L7��,_��>��Hk�I p�6`HXzw6�y��H��Vm��QHx%G��7D at a:� 
-�ح
���`��V�
a8RD]����FQ���ƌ)D���ƌc�
�<vd&�_dgi���sY��k�PZ+EZ�k��;D�8T-�p~�/r.��Y��Jρ*I@�4@�
-�E��C�Ah�k�eUVb�+3�uv��jD
�
a��y
�C
-����
��XY�T�rݪ��e��^!8��f�B�jw�C!#Pʏr[�I���@truI�
NWi�q���{iH��5�i��6T���QUʊ�v6TH֖�!�V��:+�R �W��e)��:�~��HK��jWF!Nh��lG���2Z
�wP��/�ʁ0:�.n[��ړ�5����G:�;���f�Rbؚ�/3)�%���2XU투�Ccײ8;��	9ޝ(�8~J{
+�N��hM�Q�o�=���ZC�֌S;��h?�몁���~�Bؽ:�-�
��N��V�f^��k���7>���:�@i��ʠ
-�j�j�N�*]C��O%���B�&=J�k'�|�v���qW��j5�}��L�!e#LNG
a
r�"�͎��bzgQ�7{��1\S�=��oM�j
8%w$�t�S"�U��8���U
W%�a/�lgW-���P�,��|V�1Z7#R�.���БjǍ�o����;<���
p�Ya�q;�Ng(�`6㚒��'�C�

L�o�E
���踣��|��>#h�l?�yt����2N$�䡫8��D�a��P�,1�M1�b=���nĹX[�O�L���8�����҉ʻ��q�Hd���a��X�
:b)��K����>[C��|笸9��12�
f���խ���?($E��s�z�/l[Q�=��0�w_;��t���@�R��av&�
���n&��͵.A�	
-�
X�MT[ǁ���~��6�e��8�Im�b7������G�
Zm�ap��a 7	��bZ2��� ��>]�'��H������D�Cb�T�D
��t���E�+��D
-endstream
-endobj
-7056 0 obj <<
-/Type /Page
-/Contents 7057 0 R
-/Resources 7055 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6934 0 R
-/Group 7034 0 R
-/Annots [ 7035 0 R 7036 0 R 7037 0 R 7038 0 R 7039 0 R 7040 0 R 7041 0 R 7042 0 R 7043 0 R 7044 0 R 7045 0 R 7046 0 R 7047 0 R 7048 0 R 7049 0 R 7050 0 R 7054 0 R ]
->> endobj
-7033 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 7065 0 R
-/BBox [0 0 418 144]
-/Group 7034 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 7066 0 R>>
->>
-/Length 557
-/Filter /FlateDecode
->>
-stream
-x��UKo�0
��W�X%��$`�!@1`��
�P���aH
-�;�-Gq�G��`$�$�#?ɟ�K�#X�	^7�
^�<��p�Dx�=��~�?
-��~��G@��V���z���m���~��P��Kh`n9)�g3��
.��+�u�c�~/�,:�tJ)�����;H�^�ml�9u[��)�A�ɍs��l�X��Ѽϖ�
mY�Usc�̤1tYB���'��Ѯsc{��8q��L���ɥ4��L;���-�aj���XM4��k&��Q
5����Tr�p�m��l�v2��z��*�9���v��P���ɕ[8p-�����r�rC�8�r�L{,��u�����y-g7F���
^
aG�d2\ �u�Mõ�hN�6��yɪ�k.핗�p� m�����b�.ˑ?){�)�H
U�
�lK�-�u��E[.�f�������ΎD��%���Dgx�]hgu��-4_����
ꤴ+zR�u����&i�ϱ��o��1���h�N���ؠ}���N>���o�E�7d���F-�E,#�ޕ�����#��
c��$
-endstream
-endobj
-7065 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-7066 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /CQCQQV+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 7067 0 R]
-/ToUnicode 7068 0 R
->>
-endobj
-7067 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /CQCQQV+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 7069 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 556 500 278 611 556 667 500 556 584 278 278 500 611 278 584]]
->>
-endobj
-7068 0 obj
-<<
-/Length 7070 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0E�|���"�L$�T�}��`�!A*�2d����Z�T�D:��aN<�}i������
�V���n%�����x��(�@�[N�D�+�e����
�5�?]��vc�g5��1��w�Ȏ��ߗ?uwc~h"��$j�hp�^�y��[��qݎ�����f���9F����IV�+Eu➆Ճ{�����g���MX���IR$���S�A��*���@� *��@tB�3���ԃr��.
-Y�B�0��)�x��
��@�B��>�����@��1'�_
��r�e���/
�r8p�U�}�+�,�KC��G�J��헻o�cs��Z�4~]���{2jzl���^�?�ق��
-endstream
-endobj
-7069 0 obj
-<<
-/Type /FontDescriptor
-/FontName /CQCQQV+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 7071 0 R
->>
-endobj
-7070 0 obj
-357
-endobj
-7071 0 obj
-<<
-/Length 7072 0 R
-/Filter /FlateDecode
-/Length1 2588
->>
-stream
-x�UV
l�������Ib�j��8q�N�?(����N
�$�����yT�M
-�Y�eCL�Z(��[;Q�!mӴne҄6&UC��4U��m����a	�h�����1d������s���w�c��8s
J���u���e�w����΅�Y|��[���?��|��獣C��B�ri<qtq�i�I����2={(����\�|*[���r�!c���8_e
-���UWf�Y�V�I�u��^�ɻ�7�)�e����A]M:���2���m�&>5?ts�
�
bﵖ@��W�̋7����Z[�gU�5n�V�܌齂�d��Ϩ���˥��n��h���F���
��Ԥ� 6��̴�**U�h�Hfv���X}a������Uᶁ�	�����.~P��f�U�D:�����\M�R�.(0�+
N�]UQm���A �
U|ڂ6��J06��2SS$�)m��6���I�.׎��ӎ`��
+��Ж*�4[v|�G{OI�
�)�tw�F�Z�3Uq���*TS���)�/��^��+�[�oN>��0������?Xv���cir�D��ŌPź	�<��Dm0!
����O<73wby�=jo���-���s�)�|O�j"1
��l�2sQ�?���)吥1C�N��]y�(�H���B�ө�����|��`[v���ȵ�/No	�ͅa�#�Y
-'�
��h�"��X�+-���p�,���@�������_��,�i�ʱV�3�X
���2��
|B�Î٤�J�:'q�,��I[$������	�|�Q\!;E����Y�:���y�o�}5\�t�?�g�?s���l
ټ�
�f�n?D�����{��c�ӞWZ#���PH«mG�k/����r��sCó3C�Y��q#�$l�F���wc�Rz9k�ꯦ�����h��
�����^`�
�
�/1N'�
)��F��Qν�ǧ���Gvn±��'� ����{����p�����\ʦ����[ymi]=��q�G��r��X�
~SB^�nP 
[-��x�n-�U8uΎ���գy����V�u���3
u:w�
�u��w�[oO
?�SY�G^�����w�m߮���.Wcp
���&�(
��)q�K���_
-�Q
-�:�%d
���Snn�m�B�Y����b��t��r��B}�
-�/
���T�s��d�M-
]���Hui�M�׷�����INr�����〔NB uny��#��zK~ny�wGG�k[��
-��vMu�m}�%�� �oA
3S�#�o���0u���վ��T~����_!�`̜f�G�r�tZ
-R
-p8�f~>>~l|��g�s�kxF�D�|���������+������U��h�⪡�3��đ�X�=�q>fKqJ���~����#�ӷ�������t�V�#��V�����'P�/b'_��OG������_�l��WS|��ϖ��8pZ���=���K�&b�/�t��?��F_?u�BP�ÿ����
�q}����̸����4�y���o_�tơy��Yw-��˒�*�4�jS�h�J��(��~������}��ȧ�n5���]^�O�/��}}��O&�oX\����G��l�SS�����I;����\�ג�*��<�"��
\�N{�b�Bn
���͔��j��sw{2��%��!-k��_n�帤�J�@jx��e!SZ�v98�򐽭؁Dfbf��Q�$��ml;KY����#7����x��
�����)�~��X���,����>�V|!~�U����]����~���l����x
��
֦hb�&y
r)����}f�7�XJJ��h�db3���)�C�r?�!�� �t�
�d�1�q�eALj�~�6���b���UBQޕ`G������h�(�V�
�������J���WpGÎ
-vT��F*ԍ(���x˩�L
���ѡ���Y��s��t�\ z\�37@�`��Y�%C
-endstream
-endobj
-7072 0 obj
-1949
-endobj
-7034 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-7035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 307.037 224.395 317.941]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 284.103 189.925 294.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-7037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 284.103 260.898 294.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a20a1a23e17edcba771385da4510f4786) >>
->> endobj
-7038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 268.401 422.545 278.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 243.067 224.395 253.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 220.133 232.982 230.06]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-7041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 220.133 347.013 230.06]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aa272377eb99f1a8b4b48114da9bc6051) >>
->> endobj
-7042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 204.431 389.11 214.336]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 179.096 224.395 190]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 156.162 254.671 166.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-7045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 156.162 390.391 166.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a8669f7f8a54a22c294c94b36106edfb4) >>
->> endobj
-7046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 140.46 465.458 150.366]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 115.126 224.395 126.03]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 91.216 181.207 102.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-7049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.706 91.216 243.464 102.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a017b50a53d3f73e61cb5c9d787cb1907) >>
->> endobj
-7050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.518 76.49 420.593 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7054 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7058 0 obj <<
-/D [7056 0 R /XYZ 89 770.89 null]
->> endobj
-7059 0 obj <<
-/D [7056 0 R /XYZ 90 720.814 null]
->> endobj
-1231 0 obj <<
-/D [7056 0 R /XYZ 90 632.431 null]
->> endobj
-258 0 obj <<
-/D [7056 0 R /XYZ 90 625.7 null]
->> endobj
-7060 0 obj <<
-/D [7056 0 R /XYZ 90 336.093 null]
->> endobj
-7061 0 obj <<
-/D [7056 0 R /XYZ 90 336.093 null]
->> endobj
-7062 0 obj <<
-/D [7056 0 R /XYZ 90 272.386 null]
->> endobj
-7063 0 obj <<
-/D [7056 0 R /XYZ 90 208.416 null]
->> endobj
-7064 0 obj <<
-/D [7056 0 R /XYZ 90 144.445 null]
->> endobj
-7055 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F22 2996 0 R /F75 554 0 R /F67 3037 0 R >>
-/XObject << /Im7 7033 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7095 0 obj <<
-/Length 2014      
-/Filter /FlateDecode
->>
-stream
-x��YKs�6��W�3%�7O�3iwҦ�[�����%��U�����.�)�VZ�� w����w�a�n��/�4ҒJ�����S\#!�i��)��7?zLF�h	_U�_�������k3v����3C�#V�@*���`o��0b:�
�Ik�S�̻>��
;[p�&�;6,g��A�X>P**��g��P`�O�d�ܹ!cPq�,�
&E�K� H
a%]fy\����U�n���O�"���|�~	�[�p_�7f�Ո2];��j�fS&�ǀ
-?�7A�}��� ���ˀ?/�qi���ʐ$���툾�0�"���]\L�⽟n��qXo�cS+����痚�����2�# 
�@B8L���xg�}���|HOXGUNR�8���m?+�ZO�͊j"k��D7`��0��
D�yg.�zz^f�.
	�x��
���K0�F����6)���~�,A�n�gC�X��k!�<�o�<�^=���$q���
?7���K0���1D���]Y��rq]�Ũ���;3j���������
�U4��_dw��yD
h���z��J��p��x�;���q�
���}<�}f���ܧ��
8��
��/̚���[4 �>;P�$��%���<�>��t5���b��j;�D��i�ye<T�c�:0OUL�D���\?�۝#Ψ;W "���1�	wfq$a߻I�C�$��2�$�'=��Ø$��l�=���5���j{I;$� �D9�+w9����/#z�feo�O�9� T���s5��Qt
}~��$����o�Y���a:rr��0�cR,���ELc�Y�dN�ᝨ�;��Vq,2��_#�Q�B�_>���6�[� �m����f���l��-����E�
-2���p�L4��(��&�VO����Ѡ5����:�g^���~Ӏ2ތi�E��.
��(���wS�;G��C?T��O�
���v��{���q���Tb�!�J����!5�Z
[���z��iJf��!������.\��'Ǣ9$Q����.�|Wñ�b
0V���k0�dE�%�A�t�U� u�4�i���L��u���C�q`�v�<D���?��12���&�
�DS!�ܚ�_����C�Jy��:i�rT9-�=�
�q�c�ߒ,.�NVЃ�C;F!AS^;H�wy��ˇ�l`�s/���lr7���v�_�Jс7�*]"�e��SH+L��5�)���,ІZ�v
U�j�8�]e;C"�F�
d�A�4h1�k4>��={����m'�E��xD1�|������fZ
�*��ͽ�]HuL���;GL�9/����4�ǀ�z�au62N����S�)��oN}�!��MG��= PCL��.`� zm��އ�������,���3-����4���2���4��4�5
�(���_��RSEę-e�l
�"m*wN���t��lXۀ�� @�M#_�iVK��kY��r��	�b�%z>3
���ɢ���Dq�����:5���PhMt��'��K"QŊHh���y� ��L��
�P�F4:��>"�o�M�#K���A0����C`u
-�4��!�6]NmH22�tp�ƧY��ٕ\�C��ĔBT�,�E�YhQ{
�
-���l���dU�X ��9���
�7�mz[�Ξ..j�
1BSD�>��F�qu����ň(�_�j;�@�����>
[��s��)4豠��i�'��9G��9��Ĵ�$c�D���Ȉ8R���?���Ч����ȩj���H 
�Ә!8�3����Y���7`:Q
NwR�K��$�@�]ڇW�s�z�ا��ԩE�ɜ����
��#J�ur�P+���p������ ����,)R�
�K��!W��_�_�L���`����q/�߬��}�Zq!�
[����N��XY+���ޮ��ڛ�wI�U ��N�7��DrP�I��菠�P
-!�*�:���]6f�d����=m9�P�ۋ�����.�ܣe�>�X�����Cj~T��9D���| �?*��
-endstream
-endobj
-7094 0 obj <<
-/Type /Page
-/Contents 7095 0 R
-/Resources 7093 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 6934 0 R
-/Annots [ 7051 0 R 7052 0 R 7053 0 R 7074 0 R 7075 0 R 7076 0 R 7077 0 R 7078 0 R 7079 0 R 7080 0 R 7081 0 R 7082 0 R 7083 0 R 7084 0 R 7085 0 R 7086 0 R 7087 0 R 7088 0 R 7104 0 R 7089 0 R 7090 0 R 7091 0 R 7105 0 R 7092 0 R ]
->> endobj
-7051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 696.002 224.395 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 672.092 159.628 682.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-7053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.127 672.092 200.306 682.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a79a27720fc3f7a3e989f10ebdb6b2800) >>
->> endobj
-7074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.102 656.859 400.176 666.764]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 599.787 169.81 610.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_ab2b9ec90f48c5472b85e3accc9cd40b1) >>
->> endobj
-7076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 599.787 309.485 610.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-7077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 599.787 514.653 610.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-7078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 587.832 227.553 598.362]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-7079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 558.34 169.013 569.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a4ea19117641ead1de64af7d71bf323fc) >>
->> endobj
-7080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 558.34 323.722 569.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 490.833 275.987 501.737]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a70455e8f7f82805a45a045396d85ee0a) >>
->> endobj
-7082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.546 490.833 367.304 501.737]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-7083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.238 490.833 513.996 501.737]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-7084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 441.404 275.987 452.308]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aade09211d1e3917155860ba21f953756) >>
->> endobj
-7085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 414.89 283.736 425.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a843388f4bb21a15bf18a841237a8a617) >>
->> endobj
-7086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 305.582 156.609 316.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_ae6c6807b378b537aea1651c3940c0161) >>
->> endobj
-7087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.752 305.582 311.644 316.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.26 305.582 513.996 316.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 293.627 229.376 304.531]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.243 252.553 156.609 263.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_ae6c6807b378b537aea1651c3940c0161) >>
->> endobj
-7090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.752 252.553 311.644 263.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.26 252.553 513.996 263.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 240.598 229.376 251.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
->> endobj
-7092 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7096 0 obj <<
-/D [7094 0 R /XYZ 89 770.89 null]
->> endobj
-7097 0 obj <<
-/D [7094 0 R /XYZ 90 721.073 null]
->> endobj
-7098 0 obj <<
-/D [7094 0 R /XYZ 90 619.019 null]
->> endobj
-7099 0 obj <<
-/D [7094 0 R /XYZ 90 576.211 null]
->> endobj
-7100 0 obj <<
-/D [7094 0 R /XYZ 90 508.12 null]
->> endobj
-7101 0 obj <<
-/D [7094 0 R /XYZ 90 456.977 null]
->> endobj
-7102 0 obj <<
-/D [7094 0 R /XYZ 90 430.463 null]
->> endobj
-7103 0 obj <<
-/D [7094 0 R /XYZ 90 364.421 null]
->> endobj
-7106 0 obj <<
-/D [7094 0 R /XYZ 90 203.08 null]
->> endobj
-7107 0 obj <<
-/D [7094 0 R /XYZ 90 203.08 null]
->> endobj
-7108 0 obj <<
-/D [7094 0 R /XYZ 90 139.879 null]
->> endobj
-7093 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F90 758 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7116 0 obj <<
-/Length 2766      
-/Filter /FlateDecode
->>
-stream
-x��[mo����_�O-D�}q�׻�!w	�&�$0h����H
)�I}g�˗�)Ɏx�-�A|�}vfv�YG��~�������b�AFR��"�#%	�D�E�1&12��q|=!8N�Mrs=�8��_��Hnޮn���zy�}���$��\��d�����+���m1!:N�r�g�ϳ�__���8������ 
���~����M�K

�B���M��n�W��h�(CR�hJ2B4�]M��s��n � �kU��0����~���dJ�gC�t�]'��]y�ޥn���^bJ��2f�^�8��킀

�J�\ ������g
-�������zhq��w
}����6�][J
��3
)�>���D���_�>N�v���4��~:�ƻv*pczu׷I�lR�z��
�k��&z����W��F\4/�H�4ە~̥�
�����R^U#X�&k|_�
��i$�=`�9�8p�ܖ�"����"�$�
�Z�Ni@@���dZԺdZvtio��أ��
i���U�i5
-�$Tc5�$�O3�2��vi��;'�:��W�`UUKp
-�-B���l^����V�����'�S�o!���2F:�oWY����ڋjgz�mg1��W�>���tBH�Ū���2�{:���S��~�8KBLY�h�r�ho%�
�^

絢�A@&Zd�6��ו�s:��C�[�H�
nU�84�*[uWj�ao+Y;�2���i��{�\����O�:4��ڥ>DJ��l|n
�p�HR���� �����

{eC%��i���*�5#��*M*I�ŀ"!74Q|? D��7��"��Z��un��#,] ��Q�������>[x-;�߇�kb��^��ʞ?X_I3�b�
-��"h1Lzk�MG� �~�ˋ��_��V"�9�;�Q��ߥ�[71
_�y�0���
��:�{+�r�D 
�����O��`QR��&4���6�fW�
�R��`��b�
K�6�&�Vi6l�0��(�*��L�3a�
@ 
��Q H�$1!�ل��eMP�]PB=C/�����3a��b
º:D�@�D�
�2�G�D�n�|=��
���:�X�>�I�h�4�%@l���<�� 4h
��+0O��20LX%����N
-
 I1c ��� ��j���
�%����S�t�1��X
�Iu^^�4��'u9��W# N�:��?�0I�bh���Γ֛6�[_
�1�
ik�?ՓT�D�L3��)O� ���*��&^�B���1�<6���q��0��f����$l��FxTc��1� �b�
-�S;��)��
|*0����@�XĕA\���F�
�E�>��P#��mH}��!�H��p�]H�
q
���c�H���:L (�����R�< �n��j@G���
V�n��?��G�P��~���:�@ҲW.���Vה����7{�[cV�C
?���s�wɯv����̨#C��a���ք��t�o��z�����9Q ��u�ⴍC��Ը�
��rU�{�8&m��P����j7X��
-|n�	��`�M�k~@�Ϊ+p��
����u7�~k�c�	?�ۑh�����J�o"f$�
�}�
{�X�jY/�`"A�Au���ɚn”
���F�Պs��0ۆ� Ьv�n��
�,��$g@>hlf�i�*�}F���G3��H��ci�8�u�}����g�y�xfa<uǮIs�}+����rT�Y�se{�r
�Fa;L	����s�y�{΃3�>]8��l��
-r+�m�!wz��|3��V�T�1��%��
T��	�ʷqߧ�}q�	
��5R�v4�uu�+��iFsw�b���<M�b��B�h��]�.�Fe1��
�+
W��Sb jri-�}
���O�:M�EZ΋ն	��W��u��l��]�&�Y�e^�VWeK���t��E9C�	O�}��f�]��j��Y��Xq��}�ce]Wݍ�
�tϲm�4���M
�/��A�ԑ���`��x��l��۟��U[���V�eP��
�C5LЉxF�w��������m�2ߐ�*V��_��;��ְ�l�v1F#w��];�
���`a"J��&��F�PN&��Q	�O�QH�!,� A�d�* �cP��
�1
�qCBXǺn���`�66
l��n*�-�
��;��o���>����y�^�!���^���~/�Pm�a���g�
%U[QX>{S�q�4T�c �Pe"�5|��
iIF�|]�P
s=INx�T��c��ԗ�����@
1�q����A�U*"P2|ނ'�A*+QM?�y�Gx��t
-�l��>c�C��=ݏ¡P'���=�u@�`-��� �]���Z�����$�Y��
��j�b{���q3ȗ2e��i���j�
���bޛp�[ ��K�$Q�5�&�B�B�{
����c0"0҆������3� ��
eX5C	`���
d(vg�05C!P �_�P�@�J��
e
��(�X
E����nh:
-C���/f(# �J�K�0j�҅��PT��za+����w�
��'���·E�E�������b��h�^�-�uz~CL�G�v��~�q�K��v����N�QR�U��׍kERr��ҏ�~���[w��2-�l�/�x�d�z
�&7��[�[听�Q�
��9��;пF��/�7�B���D�Y�r��^�~}��/��
���S�w�^���Ʋ��
-��>���^qM�
��	�&@����DU��:����E���
�~�A�mC��v���
-endstream
-endobj
-7115 0 obj <<
-/Type /Page
-/Contents 7116 0 R
-/Resources 7114 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7124 0 R
-/Annots [ 7112 0 R 7113 0 R ]
->> endobj
-7112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 272.327 501.708 283.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-7113 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7117 0 obj <<
-/D [7115 0 R /XYZ 89 770.89 null]
->> endobj
-7118 0 obj <<
-/D [7115 0 R /XYZ 90 557.017 null]
->> endobj
-7110 0 obj <<
-/D [7115 0 R /XYZ 90 532.584 null]
->> endobj
-7119 0 obj <<
-/D [7115 0 R /XYZ 90 532.584 null]
->> endobj
-7120 0 obj <<
-/D [7115 0 R /XYZ 90 420.502 null]
->> endobj
-7121 0 obj <<
-/D [7115 0 R /XYZ 90 258.835 null]
->> endobj
-7111 0 obj <<
-/D [7115 0 R /XYZ 90 236.458 null]
->> endobj
-7122 0 obj <<
-/D [7115 0 R /XYZ 90 236.458 null]
->> endobj
-7123 0 obj <<
-/D [7115 0 R /XYZ 90 166.36 null]
->> endobj
-1787 0 obj <<
-/D [7115 0 R /XYZ 90 69.879 null]
->> endobj
-7114 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F8 794 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7179 0 obj <<
-/Length 1725      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~��0�����E��`
Х͖.M��
0���Ȍ-̖
IN�
��;�͒-�v�&}�K"K���w�s������_z?z�6�
�X��ך�5�t���H��Sf_o5f	D

f���ޟ
ޜ
.ճޛA�G��H&�#[hެ��
�Fp���s�v��i&e��]�>�p�
F��K�/�
d�
�i��$$S��Hj�	�X?7�����]ׇp
	!ҩ
;]Z1ą]�ՠ�02m^S��`T�!��D��(?��-�MU�S�*r#�/���ã0�������S*���兼6l]F2�d�d�����+��-ҧ&b����
-�p�O�@��Ե�Y�S?��~��]Pܷ���J�1^Y �6���I����b$�����Hΐ
����A����ŀ�|�&�9�#a�b�O��k|K��`���$T�3��Y�zq N}/�s`� �\�50[@%2� H)�p�[�)嵹ڧ>6�`1��+�D�G����X-�:[=��{�_��
�X����=��������h0<9{��M��A����0M ���z�h�q�	���h0����
���
�^��"9_��H8��FJ�
*��y$�����HO�8i`�@���ԝ+�n�l�=�RV��4���rՕ]�������^�B�D(C��Nz'gW2ʮ�����{o�T#��*1����1ǭD� ���A�&�x���c���4F]��dgWȑ����8g�$��ӗ3���S��#��k5��D�v1�%,&�BPMI0�ˁu�vI�m$8��{X:U�;nu
y�=�Ty�z��G~�F�E���W�2+�������!?���
� ����x�zr�������Ɲ�L���+��2��~���MÿEd{J�S� ���Z��@��dN��� [...]
-�����
��8��~�<0L؏���i �n�����;\�{<��2��#q��8�:���nc�s���/���t��`Vz��7mΞ"u�;��QT@�̯�xW,Z�^D���[���R}�x�0��qSp��f/����s�׬{Udw�K��وCL�.�v_[���٣LO�/ߥ�|uO���=u(7�ݫi�nɆ�q��O�wy����n�jN�I=�D�F�\���d�e^�%M5 C�e�j�Id-k�[�Q��c��Ɩ"'�UN���Y����#���9�f�xx)�spbw�Â�t*��v��MI��džn!i>�����\R�l��j�l����0�j�׏�)v�0I��t��v������/�,Q��%������r[Z����Z�p��;e�k�(��*��� ���ɓs�t��`���Zn5�7lխM���鵽��h�@󧮞���mnG���Ï����_�âȦl�1*M�	��
��
F��6MV�ӇŜ���Ɍi�C��y�������A&�����=?? [...]
 (��%
�Ѳ&'(�
-}��RT����T��^�IA��J}n�`�$����Z�1���:#��
a�d�u���H�G��YC�
-��b���
-endstream
-endobj
-7178 0 obj <<
-/Type /Page
-/Contents 7179 0 R
-/Resources 7177 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7124 0 R
-/Annots [ 7125 0 R 7126 0 R 7127 0 R 7128 0 R 7129 0 R 7130 0 R 7131 0 R 7132 0 R 7133 0 R 7134 0 R 7135 0 R 7136 0 R 7137 0 R 7138 0 R 7139 0 R 7140 0 R 7141 0 R 7142 0 R 7143 0 R 7144 0 R 7145 0 R 7146 0 R 7147 0 R 7148 0 R 7149 0 R 7150 0 R 7151 0 R 7152 0 R 7153 0 R 7154 0 R 7155 0 R 7156 0 R 7157 0 R 7158 0 R 7159 0 R 7160 0 R 7161 0 R 7162 0 R 7163 0 R 7164 0 R 7165 0 R 7166 0 R 7167 0 R 7168 0 R 7169 0 R 7170 0 R 7171 0 R 7172 0 R 7173 0 R 7174 0 R 7176 0 R ]
->> endobj
-7125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 611.237 160.207 622.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) >>
->> endobj
-7126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.977 611.237 220.321 622.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abab5b32713c840499d9e29facf95a17f41) >>
->> endobj
-7127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.31 611.237 347.045 622.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abac1539389d3643cf986ef5bb99697d1cc) >>
->> endobj
-7128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.034 611.237 452.19 622.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6aba7491a8ba26958c3e27bed23b7eef1a7e) >>
->> endobj
-7129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 571.506 201.399 582.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.137 571.506 258.403 582.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a01c6cce6c756073f1684c4e7debd554e) >>
->> endobj
-7131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 516.759 157.417 527.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.232 516.759 222.99 527.663]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.424 516.759 323.402 527.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) >>
->> endobj
-7134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 489.357 157.417 499.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a36a0c8ccab7923610bd27f637af63e1d) >>
->> endobj
-7135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.754 489.357 228.26 499.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 461.207 157.417 472.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0e0942b92b2f099b4ad4897d2b986dea) >>
->> endobj
-7137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.754 461.207 228.26 472.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.914 461.207 311.557 472.111]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 433.431 157.417 444.335]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae3674890a93b407b8080fdd7ea85d93f) >>
->> endobj
-7140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.754 433.431 228.26 444.335]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.914 433.431 307.671 444.335]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 405.655 157.417 416.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a660c04b4c90264ea97b3367acb01e8a9) >>
->> endobj
-7143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.754 405.655 228.26 416.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.914 405.655 311.557 416.559]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.646 405.655 421.404 416.559]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 377.879 157.417 388.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a50213d8479884e1f0d7fae1c4f817943) >>
->> endobj
-7147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.754 377.879 234.885 388.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-7148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.52 377.879 319.278 388.783]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.713 377.879 419.69 388.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) >>
->> endobj
-7150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 350.476 165.165 361.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac7bf9d127644aa14a09eab633e87f544) >>
->> endobj
-7151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 322.326 175.668 333.23]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 322.326 234.596 333.23]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a8d9338b98f6d33e111c0c0d70508b4ee) >>
->> endobj
-7153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 294.55 208.395 305.454]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a097e454cd31f0dddb7e7a7ceab1a2511) >>
->> endobj
-7154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 294.55 273.968 305.454]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 266.774 157.417 277.678]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.156 266.774 208.963 277.678]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9dc926136daee1f47975434ee45298ec) >>
->> endobj
-7157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.3 266.774 279.806 277.678]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 238.998 179.554 249.902]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 238.998 250.666 249.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a3c1dcd74ba0b2509f45aad45a5d922ce) >>
->> endobj
-7160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 211.222 220.579 222.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a85ca415a40fbd066ad850e26b1fe1653) >>
->> endobj
-7161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 211.222 290.038 222.125]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 198.33 233.76 209.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae73aae9c2283b936cdaf92e13ab5d727) >>
->> endobj
-7163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.575 198.33 272.763 209.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.205 198.33 323.393 209.234]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 170.554 243.165 181.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_afbee4abe5b3b83f47971e19f47f3bb53) >>
->> endobj
-7166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.502 170.554 327.278 181.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-7167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 142.777 246.034 153.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_accc738986aa1e74d232da8c9cc10966a) >>
->> endobj
-7168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.522 142.777 360.71 153.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 115.001 231.1 125.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a405f3dfb1b620defbadb0b2f103b8f28) >>
->> endobj
-7170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.915 115.001 270.103 125.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.916 115.001 345.559 125.905]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.109 135.579 113.013]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) >>
->> endobj
-7173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.077 102.109 155.225 113.013]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a239b0622fbcfe1638b4246deab2caa29) >>
->> endobj
-7174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 74.333 179.832 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a745ac1cdddf74c6f387cfbbbc566dc78) >>
->> endobj
-7176 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7180 0 obj <<
-/D [7178 0 R /XYZ 89 770.89 null]
->> endobj
-262 0 obj <<
-/D [7178 0 R /XYZ 90 721.073 null]
->> endobj
-7181 0 obj <<
-/D [7178 0 R /XYZ 90 628.174 null]
->> endobj
-7182 0 obj <<
-/D [7178 0 R /XYZ 90 535.694 null]
->> endobj
-7183 0 obj <<
-/D [7178 0 R /XYZ 90 535.694 null]
->> endobj
-7184 0 obj <<
-/D [7178 0 R /XYZ 90 450.631 null]
->> endobj
-7185 0 obj <<
-/D [7178 0 R /XYZ 90 422.855 null]
->> endobj
-7186 0 obj <<
-/D [7178 0 R /XYZ 90 367.303 null]
->> endobj
-7187 0 obj <<
-/D [7178 0 R /XYZ 90 341.252 null]
->> endobj
-7188 0 obj <<
-/D [7178 0 R /XYZ 90 311.75 null]
->> endobj
-7189 0 obj <<
-/D [7178 0 R /XYZ 90 283.974 null]
->> endobj
-7190 0 obj <<
-/D [7178 0 R /XYZ 90 256.198 null]
->> endobj
-7191 0 obj <<
-/D [7178 0 R /XYZ 90 215.207 null]
->> endobj
-7192 0 obj <<
-/D [7178 0 R /XYZ 90 159.977 null]
->> endobj
-7193 0 obj <<
-/D [7178 0 R /XYZ 90 118.986 null]
->> endobj
-7194 0 obj <<
-/D [7178 0 R /XYZ 90 91.533 null]
->> endobj
-7177 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F66 3179 0 R /F67 3037 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7244 0 obj <<
-/Length 1802      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ�S*�z�F^Z7.r�n�I P�J^���%�(���KRm�f
Z.#�I�{������r��4���跋�ѩ�
�u����cõ|d;�kn|�5'c<>3	
Y
L�L��i����,���,����'i"�,InN���'Q ey��/xfo̓��x�uȘ2��t�z��b�eD@"l�R��ƣ��1�ǯ
����k�(6,��磿F�R��U+�3��
K)G���g�� BJ������8:%�ff�P�a��l��2�ԍĢ�6H��M�D��^�ގ���r�v�zĘ�	b!����n9d-Gy�_� y%J�a2�=VP!
Am4��aBl�\��"ϫ��nt2>Ll��,M��2[V���-��T$an
�|�6��dG�F���M�)r,
-BZ�:�D�[scT.�Kp@���z�Vϒ4��ϕ�̉D

s?�c v��Y
����c�}��Im�
O��ry|�g�fj���~'%›�����a�����PD0�x[�����G��jn5�g�AɌE�>A��j�Z�v�C�8'-��%� �"�&~��.j���d�H.�8]򄧅��<�*��b�
x����Tm�L
�8���vi��
Hў@�
b�F���
-���i��J�O�����K"̓hZ��t�ι<$ZU
���:ۙ�E
����Z�*r��5�UG-{�j�c�a�2
����W
��#�X�vUF<
d� ������a�����$غ{��󠰴�/e�lk��,�<�ҥ��)
��t���&�z[�	��=o�rAt
�k�*�[ҶG��D�D2��ɞHу
C~A$�/l��B���J�	"�ԥ�h�K�=C���
�l�Ĭ9��-9������"�L��f�P\i\�'�J9
�-{P�A�S�6�\D�;H�
�� �^��d�ex�7�a]Բ�z(�e�3[�|�����%�w��r��U��nU����Wj#\�j��d2ȅTU1�ߑ��r�m�+�MF̻��P�鼈Wl�3�ɲ۩Ġ���te>?>y��Q
-#��Ƽr�_�O^�*oKӮʋ�yӤ� ��.��ç���A��fM! �ڡx&
�=�

Y��{b����]e����35�lۮ�q��W�v�4v1{��B�d�6
��l���ς<��s�]��ۥ�ŋ��Z�9=�c�
h5+=;J�y�g�Ͼ'��\ʛ
2^d�e�Ӹu��E�}ڥ���0d������L)TR�J)�E��^��l�a4�
��Ч'
-�g��@��n�y^�.�z�P�V�`�A>��p�	s(R;8��"�6
�T
=�C]aCuhN�]I��ϲ{U1�C.墈����AʷQ��E[�����S���ZȲ���������x*��Q���B�U-���ί�Uk��(i�{-����V]�އ��o��G����*
�`�f����s� {WNDm�R]4�7�d�5&��V
:W!+�q�7>+f�;���x<�_
���HB��
�4LY�ı}�mKY��i���y�L�
{�q�u*WAȧ�ޝ�
t�
&qQ-eZ
-��H��ڣ�ߜi�>���K�Q� տ�51쾱J$"A��Q<��_mF���Z
�{D�U�<�ާ*sɁ5��ͨ���x�*Ϝ.��V�ýlw�%$
*I�y�R��t9;V{��_Y�6������oɳ_T�R��]��Β��J�
϶~M.w�u�s�k�J�?��ub�nlvZ��~������ѬXBj�Da߆zGaw��ԧ��4�l���Xg��>�Z���Pj8���
,&�����;��eݱzp�*f��)x{��?��� 
-endstream
-endobj
-7243 0 obj <<
-/Type /Page
-/Contents 7244 0 R
-/Resources 7242 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7124 0 R
-/Annots [ 7175 0 R 7207 0 R 7208 0 R 7209 0 R 7210 0 R 7211 0 R 7212 0 R 7213 0 R 7214 0 R 7215 0 R 7216 0 R 7217 0 R 7218 0 R 7219 0 R 7220 0 R 7221 0 R 7222 0 R 7223 0 R 7224 0 R 7225 0 R 7226 0 R 7227 0 R 7228 0 R 7229 0 R 7230 0 R 7231 0 R 7232 0 R 7233 0 R 7234 0 R 7235 0 R 7236 0 R 7237 0 R 7238 0 R 7241 0 R ]
->> endobj
-7175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 695.077 187.583 705.981]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab6976f576e6e50941ee7a7b1a737c0eb) >>
->> endobj
-7207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 667.324 227.433 678.228]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab3186208850238a080373f035cd532cc) >>
->> endobj
-7208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 639.571 212.489 650.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a442aecbe0ce384a7c1add146fb125ed6) >>
->> endobj
-7209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 612.191 297.728 622.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2679da4dbd5b8c33ef607aee49690c2a) >>
->> endobj
-7210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.544 612.191 336.732 622.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 584.065 342.261 594.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9960963fb1f8fb56631e0402557065ae) >>
->> endobj
-7212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 556.312 191.718 567.216]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-7213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 556.312 288.852 567.216]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a78c24741e21a4406ea8ad1588c768147) >>
->> endobj
-7214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 528.559 191.718 539.463]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-7215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 528.559 303.079 539.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0ab383f3930179982937f7733a283a03) >>
->> endobj
-7216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 500.806 194.776 511.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a29202eb817eb5c9d59433abeeb4f2eea) >>
->> endobj
-7217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 473.426 195.334 483.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_aea0fedb82a525e6ada13cd7fd2d03225) >>
->> endobj
-7218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 445.3 201.471 456.204]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) >>
->> endobj
-7219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.808 445.3 272.314 456.204]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 417.547 182.044 428.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_aa8a21b3b30b29ca087ecc032d1a3f922) >>
->> endobj
-7221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.381 417.547 252.888 428.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 390.167 150.493 400.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a6742bd7f3f2cb079b96900dda0147940) >>
->> endobj
-7223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 362.041 181.845 372.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab0f18894c8f97fa0cd38736462f36132) >>
->> endobj
-7224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 334.288 181.845 345.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a7bdaff085ea6859cdec9b27bffb6de4b) >>
->> endobj
-7225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 306.535 154.727 317.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a93d5d6abf06ec551294c4c18abb4349d) >>
->> endobj
-7226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 279.155 176.505 289.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0d50a5df6b31c6de90fe366e18e750ff) >>
->> endobj
-7227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 264.232 450.955 274.137]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a7bdaff085ea6859cdec9b27bffb6de4b) >>
->> endobj
-7228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 240.07 169.013 250.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a1e7682395739069fa5bee820540b2bd3) >>
->> endobj
-7229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 240.07 216.335 250.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 212.317 183.698 223.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a01c6cce6c756073f1684c4e7debd554e) >>
->> endobj
-7231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.438 212.317 238.89 223.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a19173722ebe43fed184ef76abfb1c28c) >>
->> endobj
-7232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 157.592 203.075 168.496]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 157.592 296.324 168.496]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a09c8fc0753a389cc42f84c12f7920832) >>
->> endobj
-7234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 143.043 317.229 152.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 130.213 194.297 140.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0ab38d6ea061e7c2cb1595ba9cf2fd42) >>
->> endobj
-7236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 102.46 188.759 112.99]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_aaf207e746f4a3dc2722e254612dab3b3) >>
->> endobj
-7237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 74.707 204.459 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.199 74.707 278.511 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) >>
->> endobj
-7241 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7245 0 obj <<
-/D [7243 0 R /XYZ 89 770.89 null]
->> endobj
-7246 0 obj <<
-/D [7243 0 R /XYZ 90 712.265 null]
->> endobj
-7247 0 obj <<
-/D [7243 0 R /XYZ 90 684.512 null]
->> endobj
-7248 0 obj <<
-/D [7243 0 R /XYZ 90 656.759 null]
->> endobj
-7249 0 obj <<
-/D [7243 0 R /XYZ 90 601.253 null]
->> endobj
-7250 0 obj <<
-/D [7243 0 R /XYZ 90 573.5 null]
->> endobj
-7251 0 obj <<
-/D [7243 0 R /XYZ 90 545.747 null]
->> endobj
-7252 0 obj <<
-/D [7243 0 R /XYZ 90 406.982 null]
->> endobj
-7253 0 obj <<
-/D [7243 0 R /XYZ 90 379.229 null]
->> endobj
-7254 0 obj <<
-/D [7243 0 R /XYZ 90 351.476 null]
->> endobj
-7255 0 obj <<
-/D [7243 0 R /XYZ 90 323.723 null]
->> endobj
-7256 0 obj <<
-/D [7243 0 R /XYZ 90 295.97 null]
->> endobj
-7257 0 obj <<
-/D [7243 0 R /XYZ 90 257.258 null]
->> endobj
-7258 0 obj <<
-/D [7243 0 R /XYZ 90 176.43 null]
->> endobj
-7259 0 obj <<
-/D [7243 0 R /XYZ 90 176.43 null]
->> endobj
-7260 0 obj <<
-/D [7243 0 R /XYZ 90 147.028 null]
->> endobj
-7261 0 obj <<
-/D [7243 0 R /XYZ 90 120.346 null]
->> endobj
-7262 0 obj <<
-/D [7243 0 R /XYZ 90 92.593 null]
->> endobj
-7242 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F67 3037 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7339 0 obj <<
-/Length 1400      
-/Filter /FlateDecode
->>
-stream
-x���S�F���W�)�g�qw��IL`&��i�R�ݾ@�#�4�%#ɦ�_�շ�H�2؄'}�����v��b�V�ʯ����S�)&29���F1�"t1Oc�R��~
|T4n br�>��lpr6�m��A�C�	+$��!a(�i��3V������f�C�i��T��D�w���D��k$��)���P6BM�
E�����n�2��
�
-l�
-cj]O��W�����ՙ����T:��:q�?�F:��q�:~�u	S-�	�mퟂ
-�馞* �0���ᅫ$
P���0M��HS��`n\Pz�jq�PzDC��x���4J��1
���QA�S�}�61�E�=�r
�,�Uq�������=w��\��.e���V�*;�g�-�pY7q��vlwɒ�7߄�G
��|q��E �E��
-S�b	j�}����*�${�p��w�/���l���k��H�;Y�
�N��a#g�=q�᭼�m��
�='Qb�³���"*
N���@D,
QS+����������:2xbic�,=K��ܤchŶ��L]|�q�	82�E
�}9NpM܁=�M$�%��ΎS�0�z'��FB�%l �B���Hs%B�ɐa
-����h�~J5���uW����Cx�u��<�~�mJ
��0F��L�*�r�I� ���eYjƌ�M���O��W?>�}�Z������I�
���
�����)7����+<t
�1%�obx-ʊb���9N� Z,}:wF� �*���:�3����A�� s�~����M�rz-�Mݤ��o�~���ԐTi���wUk[w&=+ eGG�|�C�g���*�P�^<�
��d;��'��t�5d��d��Ai8#m�n{BC��cb���U��\�� ���6%�t�cRR��,&�q�6%�p�`
-��EM�	�隨���"���%��A���<(,���@���q,�6QZ��ҢM�����pa~���G6��a���?8����|#=�����0�
-�BˮE)��T�Đ&̆ Q�g�
-��ڽ��� 9OI�����<��ϜE
=o%v��,�
�o(�eQM����̢v5��f��w��$�duxX���UdD���ylBT@�(vX9
����OO�8b�=w�gfG���Q�h���k�bg��y�
-����z*j��ipaH�l{��Τ
c�y:�E&��
��"�/)*�զ,=�^�����J��	I
k��₾".w�Ϧ�[<
y�v�3�<�R��"]N��Z�"��@] fFս�
�0�F����1
����m�)��0Y>]���F%�
��n	�A�I�r�������o_z?uS����̭I^D�O���1�p\V��V�2=��\_2�ˣY��TG�eU�wA0;�߿���ҹE#w�-煏&�"�+����i%����iT-����?��
-endstream
-endobj
-7338 0 obj <<
-/Type /Page
-/Contents 7339 0 R
-/Resources 7337 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7124 0 R
-/Annots [ 7239 0 R 7240 0 R 7269 0 R 7270 0 R 7271 0 R 7272 0 R 7273 0 R 7274 0 R 7275 0 R 7276 0 R 7277 0 R 7278 0 R 7279 0 R 7280 0 R 7281 0 R 7282 0 R 7283 0 R 7284 0 R 7285 0 R 7286 0 R 7287 0 R 7288 0 R 7289 0 R 7290 0 R 7291 0 R 7292 0 R 7293 0 R 7294 0 R 7295 0 R 7296 0 R 7297 0 R 7298 0 R 7299 0 R 7300 0 R 7301 0 R 7302 0 R 7303 0 R 7304 0 R 7305 0 R 7306 0 R 7307 0 R 7308 0 R 7309 0 R 7310 0 R 7311 0 R 7312 0 R 7313 0 R 7314 0 R 7315 0 R 7316 0 R 7317 0 R 7318 0 R 7319 0 R 7320  [...]
->> endobj
-7239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 694.83 204.459 705.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.199 694.83 297.2 705.734]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_abbde4b86cfca3e29a917650f4c9c62d5) >>
->> endobj
-7269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 666.582 204.459 677.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.199 666.582 287.467 677.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a8e5a205098d89ad9473676ae57f29ac5) >>
->> endobj
-7271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 638.335 204.459 649.239]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.199 638.335 282.496 649.239]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af023b7e8ad5a15b2617878bf2bf93d5c) >>
->> endobj
-7273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 567.705 222.711 578.608]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.209 567.705 314.187 578.608]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) >>
->> endobj
-7275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.794 567.705 361.329 578.608]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-7276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 469.795 157.417 480.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 469.795 200.851 480.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) >>
->> endobj
-7278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 469.795 305.438 480.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.594 469.795 428.844 480.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 441.548 157.417 452.452]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 441.548 200.851 452.452]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a4b4c0277d3b6c85ab6633ae9f5e235c6) >>
->> endobj
-7282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.667 441.548 239.854 452.452]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.297 441.548 290.484 452.452]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 413.301 157.417 424.205]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 413.301 200.851 424.205]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e) >>
->> endobj
-7286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 413.301 305.438 424.205]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 385.053 157.417 395.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 385.053 200.851 395.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) >>
->> endobj
-7289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.174 385.053 455.423 395.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 356.806 157.417 367.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 356.806 200.851 367.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_acc5c5125e7237c5913981b99a502f332) >>
->> endobj
-7292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 356.806 305.438 367.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.594 356.806 428.844 367.71]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 328.559 157.417 339.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 328.559 200.851 339.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a61208276a246a505bd753ffbb568bfe7) >>
->> endobj
-7296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.667 328.559 239.854 339.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.297 328.559 290.484 339.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 300.312 157.417 311.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 300.312 200.851 311.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af245f065572b31c8ca97e196e45f9cf9) >>
->> endobj
-7300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 300.312 305.438 311.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 272.064 157.417 282.968]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 272.064 200.851 282.968]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) >>
->> endobj
-7303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.174 272.064 455.423 282.968]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 243.817 157.417 254.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 243.817 204.34 254.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) >>
->> endobj
-7306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.677 243.817 308.927 254.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.083 243.817 432.333 254.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 215.57 157.417 226.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 215.57 204.34 226.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a047a99eb91872d19730f4fd14a81f55c) >>
->> endobj
-7310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.156 215.57 243.343 226.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.785 215.57 293.973 226.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 187.322 157.417 198.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 187.322 204.34 198.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af2eb5d22ef23937a261cfe3f6bc435e6) >>
->> endobj
-7314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.677 187.322 308.927 198.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 159.075 157.417 169.979]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 159.075 204.34 169.979]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) >>
->> endobj
-7317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.663 159.075 458.912 169.979]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 130.828 157.417 141.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 130.828 206.47 141.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af06b2331eb3d080794682080b7f7eb1d) >>
->> endobj
-7320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 130.828 311.057 141.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.213 130.828 434.463 141.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.58 157.417 113.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 102.58 206.47 113.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2fb9117b8937e3d9a9b4d3ae397bb79a) >>
->> endobj
-7324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.286 102.58 245.473 113.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.915 102.58 296.103 113.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 157.417 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 74.333 206.47 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a423e3bb0d9886c630c3c227def9f2073) >>
->> endobj
-7328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 74.333 311.057 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7336 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7340 0 obj <<
-/D [7338 0 R /XYZ 89 770.89 null]
->> endobj
-7341 0 obj <<
-/D [7338 0 R /XYZ 90 712.265 null]
->> endobj
-7342 0 obj <<
-/D [7338 0 R /XYZ 90 684.018 null]
->> endobj
-7343 0 obj <<
-/D [7338 0 R /XYZ 90 655.771 null]
->> endobj
-7344 0 obj <<
-/D [7338 0 R /XYZ 90 586.79 null]
->> endobj
-7345 0 obj <<
-/D [7338 0 R /XYZ 90 516.244 null]
->> endobj
-7337 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F66 3179 0 R /F60 532 0 R /F68 3032 0 R /F67 3037 0 R /F90 758 0 R /F11 613 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7467 0 obj <<
-/Length 1189      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�H��+��W�Z���h$��a�I*Yo�qؽ8)J��V-HX���
=-�x�[.0�Q���ozzZ3H�U���G�q��S�� ���+R�n3䯞r�b�hM�R/5�T�ڝK� �L�DϷ;΍o��V��s�з
7Ԛ�!�|`AҼ}�k�T��R
�V	�ڏ����v㾁�FH��
��t���H��˟��e*?�NCE'T~�o��
�3�
gQŔ�zd
& S�Ɖ}W"
�n�dx'�F76D�L���:
�D�L)
-%RD���


��'I�m8`#�pZ� ���pKD0����̌�ʠ�[%�,LeCC*
��6sW��6u��džr�d��Ϯ�荄o���YUP�d`<ڝ3�,I�`���#��=���mD��p�N�`�Z��:~ĸ�m�-��צ2(���;�F��s�T8R	<�F�����
�LBo��Iֹ
XGV����:QK֝=�u���8!ɳ�6	q	)1��
�/����ȐSg֚��)�Ԉ�
���a����7Qv�DRq)�VK o

'�B�Ɂxۋ�i@|��^���j&>{�L�
f�C������ߪh�r,{��'�0�h����
#
-=&�'���
,3�(�V�*���Y0X2�t�&�e�.G�L��2G�t}
�%!���{�0t���h�ښ���4�9
-��Wuʍ�
����K���}��H��
y�/�$~Q��B\���q��E��K}��IK�U���I�(�Pf
�'���~�L���c�W&�q at 4�ӗ`KjY��׻��k>1�)��^��E�	e�aA&��&q���-wn�3.7����]M�ͲJ~
����xWW$6��:�IͲJ�U�����,Z��}+�˴�����r�Z4_�g1�Ұ/\�" zq
�s\g`!^Ы��7��t�ꪵ��*o=Bl%���خ޻�CF�]x��ր-�m^`O�k=�k��q��c���t�ٞq�m�Ɗ�\�ʂYЫRY�u�+��3�c;9���o��A8��
��;ŗ�R�΁Y)��l����E��'�ocj�y�o�
�-�f�b~���"i
Z�JL��,%J��d���Ce��A���X��.
G����m �[�z�_�[���s���8��z~j��ʋC;�zBv�,Ñ!,Gɐ�`�7 �9�{��ٍ��OC���I�ϙ��hG�
-endstream
-endobj
-7466 0 obj <<
-/Type /Page
-/Contents 7467 0 R
-/Resources 7465 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7124 0 R
-/Annots [ 7329 0 R 7330 0 R 7331 0 R 7332 0 R 7333 0 R 7334 0 R 7335 0 R 7361 0 R 7362 0 R 7363 0 R 7364 0 R 7365 0 R 7366 0 R 7367 0 R 7368 0 R 7369 0 R 7370 0 R 7371 0 R 7372 0 R 7373 0 R 7374 0 R 7375 0 R 7376 0 R 7377 0 R 7378 0 R 7379 0 R 7380 0 R 7381 0 R 7382 0 R 7383 0 R 7384 0 R 7385 0 R 7386 0 R 7387 0 R 7388 0 R 7389 0 R 7390 0 R 7391 0 R 7392 0 R 7393 0 R 7394 0 R 7395 0 R 7396 0 R 7397 0 R 7398 0 R 7399 0 R 7400 0 R 7401 0 R 7402 0 R 7403 0 R 7404 0 R 7405 0 R 7406 0 R 7407  [...]
->> endobj
-7329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 693.349 157.417 704.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 693.349 206.47 704.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_abdd61469bc5c6dfc6e97f306a751035c) >>
->> endobj
-7331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.793 693.349 461.042 704.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 662.141 157.417 673.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 662.141 206.47 673.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) >>
->> endobj
-7334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 662.141 311.057 673.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.213 662.141 434.463 673.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 630.932 157.417 641.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 630.932 206.47 641.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a600a652347fb8718e0bc05f7230b8d8a) >>
->> endobj
-7363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.286 630.932 245.473 641.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.915 630.932 296.103 641.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 599.724 157.417 610.628]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 599.724 206.47 610.628]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) >>
->> endobj
-7367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 599.724 311.057 610.628]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 568.515 157.417 579.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 568.515 206.47 579.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae615df068adfbb40a0b0b7a993579d22) >>
->> endobj
-7370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.793 568.515 461.042 579.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 537.307 226.034 548.211]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a182ea33f63c0eea708e02a32b0904f30) >>
->> endobj
-7372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 537.307 364.682 548.211]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 506.098 226.034 517.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_acedadd7f7742a18d941ded77da69ba9a) >>
->> endobj
-7374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 506.098 389.897 517.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) >>
->> endobj
-7375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 474.89 180.54 485.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a340e8b886fb185bed798dcbc1391c126) >>
->> endobj
-7376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 474.89 251.383 485.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.116 474.89 336.623 485.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 443.682 178.239 454.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) >>
->> endobj
-7379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 443.682 249.082 454.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.815 443.682 334.321 454.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 412.473 156.281 423.377]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab12acbd3962ac07c4db8f1994351668b) >>
->> endobj
-7382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 412.473 203.603 423.377]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.815 412.473 265.321 423.377]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 397.865 180.54 408.769]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a340e8b886fb185bed798dcbc1391c126) >>
->> endobj
-7385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 397.865 251.383 408.769]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.116 397.865 336.623 408.769]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 383.257 178.239 394.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) >>
->> endobj
-7388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 383.257 249.082 394.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.815 383.257 334.321 394.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 368.649 157.417 379.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 368.649 204.34 379.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) >>
->> endobj
-7392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.677 368.649 308.927 379.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.083 368.649 432.333 379.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 354.041 157.417 364.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 354.041 204.34 364.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a047a99eb91872d19730f4fd14a81f55c) >>
->> endobj
-7396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.156 354.041 243.343 364.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.785 354.041 293.973 364.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 339.433 157.417 350.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 339.433 206.47 350.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) >>
->> endobj
-7400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 339.433 311.057 350.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.213 339.433 434.463 350.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 324.825 157.417 335.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 324.825 206.47 335.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_afe7cc9f7ed389844bb2484ba6bebdde0) >>
->> endobj
-7404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 324.825 268.995 335.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.958 324.825 343.146 335.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 310.217 157.417 321.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 310.217 200.851 321.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_acc5c5125e7237c5913981b99a502f332) >>
->> endobj
-7408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 310.217 305.438 321.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.594 310.217 428.844 321.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.609 157.417 306.513]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 295.609 200.851 306.513]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_adda5908777a9d901f2e7bcf7f61b9d67) >>
->> endobj
-7412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 295.609 263.376 306.513]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.34 295.609 337.527 306.513]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 281.001 157.417 291.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 281.001 204.34 291.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) >>
->> endobj
-7416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.663 281.001 458.912 291.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 266.393 157.417 277.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 266.393 206.47 277.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae615df068adfbb40a0b0b7a993579d22) >>
->> endobj
-7419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.793 266.393 461.042 277.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 251.786 157.417 262.689]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 251.786 200.851 262.689]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) >>
->> endobj
-7422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.174 251.786 455.423 262.689]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 237.178 157.417 248.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 237.178 204.34 248.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af2eb5d22ef23937a261cfe3f6bc435e6) >>
->> endobj
-7425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.677 237.178 308.927 248.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 222.57 157.417 233.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 222.57 206.47 233.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) >>
->> endobj
-7428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 222.57 311.057 233.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 207.962 157.417 218.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 207.962 200.851 218.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af245f065572b31c8ca97e196e45f9cf9) >>
->> endobj
-7431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 207.962 305.438 218.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 193.354 157.417 204.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 193.354 206.47 204.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af06b2331eb3d080794682080b7f7eb1d) >>
->> endobj
-7434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 193.354 311.057 204.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.213 193.354 434.463 204.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 178.746 157.417 189.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 178.746 206.47 189.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a858b9fe39b14cf51d179a84be1605436) >>
->> endobj
-7438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 178.746 268.995 189.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.958 178.746 343.146 189.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 164.138 157.417 175.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 164.138 206.47 175.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_abdd61469bc5c6dfc6e97f306a751035c) >>
->> endobj
-7442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.793 164.138 461.042 175.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 149.53 157.417 160.434]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 149.53 206.47 160.434]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a423e3bb0d9886c630c3c227def9f2073) >>
->> endobj
-7445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.807 149.53 311.057 160.434]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 134.922 157.417 145.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 134.922 200.851 145.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) >>
->> endobj
-7448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 134.922 305.438 145.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.594 134.922 428.844 145.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 120.314 157.417 131.218]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 120.314 200.851 131.218]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a32d23987abcbb26d66dcc31aa003b70d) >>
->> endobj
-7452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 120.314 263.376 131.218]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.34 120.314 337.527 131.218]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-7454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 105.706 157.417 116.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 105.706 200.851 116.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) >>
->> endobj
-7456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.174 105.706 455.423 116.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.098 157.417 102.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.915 91.098 200.851 102.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e) >>
->> endobj
-7459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.188 91.098 305.438 102.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 76.49 156.281 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab12acbd3962ac07c4db8f1994351668b) >>
->> endobj
-7461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 76.49 203.603 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.815 76.49 265.321 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7464 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7468 0 obj <<
-/D [7466 0 R /XYZ 89 770.89 null]
->> endobj
-7465 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F67 3037 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7498 0 obj <<
-/Length 2301      
-/Filter /FlateDecode
->>
-stream
-x��Z[w۸~ׯ�[�&�	������v��K��nܾ${|h�v�J�,R��_���)Ȓ�MO�D
�of��GwQ
};����쭠Q�RNxtu�q$�1O��ØP9��ꇈr�p��+=��/?_]�|�^�]^��G^�6
-2�-G~��9
�ň�2z�B�(!�����o���#�ԭ�X�@W�2���
	“)��x�M�d�"�O��Hx�g�b�U�
tS����8��1!��?��,
/�2���>��d��ٚ�ʎ���l��@����*�'7��g���5��Snnf������u�;��_�
E���UY7�(��B�ۢ�f�s}��
%T�9±u�GB�P�ee�Z��[�9�I�7�J1��Y�8�(0H��0�aR�pj�J+F=����Ka���D8"D8
�j���H4(hi�bWA�N�;�W�0��`*S#��c�p��$e��z�(��|O�1���IH����ž�W���
u���U"P�����

9�.�Ef0O����b*QBR�U���^($�U9��]���D�{
��Q�J~p�c�%��
.~�����`
��\c��<6
X��`�$���� �#)�I <|�"��'���Ħ�E _1���/U�N1������ 4XB��$�i(S�@vZ[UI���"O%
ϋe^֊��qE��d\��Y�:�{03k�rR��'&��w,r�O0��k�fV��~ [...]
Q 5��1�jq����S�;��
Z���(�-��+�i
�
���.}�CG������� �����rn�Õa�o���0-!�����K���Mi
-1���E0ψ������t�F�I������Q#���xA
-���g�\��R��J�7n�e�X,7��l
-C���B�`9�ۀYMm�ٳ޲]�Y46yK7���=�<6L5*�(�
����A[{[-����.T_��;[�y�,��ZX�a
s�*���ZS�I�ˍ;
-���m
��P��6I	�;X����,O����|dh/
]X����0�G	#zGT��-/�pEzʁ?�`���rY��n�(��!�'%KZ�#�!�(�݈H�q/
@L��'�9t�V��g at 8����+q�z ��yO���'�(��@��Q��Ps��-"^�e�1
��4I 
tb	�]�~F��FRy�Q���I{�S�<��u��a
-�m�
t���
|�C�[�p(잝
��r��<����M�Bu~=S��6E2�Q at X�
�?��aɢn�ф�+s�{8S
��o�ۭ�hj��\���k��Lq
1�b�sw�i� �?���(��^�s�R
��olQ�qW��ٚ��B��F�Cxrd���&>匁왅<?
�P�.{��V��6�
0t�.��ąb�Z�Zr��}ax at g/E�p<
-&:
)�
-`��ǽ����&&@4�����!���� QH�&(�4̪5����w�*xXtD�	@\
�8� ��$C�4�
����܇� �1��;�0?c4��Y���Lh��SR�٫�!
-M"$��a�*I�S��sL8��@��Ц��_��34j�2��!�~����o?�2�����e^`�v����C�̣�c���
�!.=�����&w�B-�@#�F�$h�f�:���ڹ��5���t~�|{
���
-v~FT�\Yan���l6����M�|a��tj�}
jw|Y���('�n} �Ϫur�}�`����L�p��B�KDu�9�
X�c��}>�Q�\_�g<����@���?^�y����I��{w�Jȗ[�p!_t!��CD5�� ���va�
����)��e�
-eP��C�
-������
����VI�ڒ�X���'3���
� A���>Lb��W��v,�/�{��}cξ_��
-�uꦠo�)������<1t
-�����	�w?���������b觬�g�/M�]ww@��}�j���_��5�����X�?5�����fsW��
�U����t���
ƭ��_0`p���p��
D���
-endstream
-endobj
-7497 0 obj <<
-/Type /Page
-/Contents 7498 0 R
-/Resources 7496 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7124 0 R
-/Annots [ 7463 0 R 7483 0 R 7484 0 R 7485 0 R 7486 0 R 7487 0 R 7488 0 R 7489 0 R 7490 0 R 7491 0 R 7492 0 R 7493 0 R 7494 0 R 7495 0 R ]
->> endobj
-7463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 665.756 221.326 676.66]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 342.962 158.921 350.488]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 289.636 158.921 297.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 248.266 158.921 255.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 207.052 158.921 214.421]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.956 207.052 313.741 214.421]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) >>
->> endobj
-7488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 157.554 158.921 165.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 157.554 297.003 165.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-7490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 141.614 158.921 149.14]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 141.614 297.003 149.14]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-7492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 125.674 158.921 133.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 125.674 297.003 133.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-7494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 76.49 158.921 83.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7495 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7499 0 obj <<
-/D [7497 0 R /XYZ 89 770.89 null]
->> endobj
-7500 0 obj <<
-/D [7497 0 R /XYZ 90 721.073 null]
->> endobj
-7496 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F11 613 0 R /F8 794 0 R /F24 529 0 R /F75 554 0 R /F32 764 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7511 0 obj <<
-/Length 2321      
-/Filter /FlateDecode
->>
-stream
-xڵ�r���]_��C
-4�j/�ʎ;�"'NDZ��t
��"&$@�e����=�  B4�O���=��s�P燓g����pR�F<rf
'�N
�$�`6w޺��=�QJ�W
�nV���W
�n��[�y�]]�uVߝ��We��YQ���Cꞯ�����r!k�%�,s	�D
1���{7���bv���F�a�AH����'o�Qg�?9�G�8����	��q�9���b���P}���0w$&)�4pb&HBC$���c̽\y��E�ld��$�!ߑ�0�}�<�?����9%T�Ko��C���BW����E�ݵl�ռQ
����+u�C1�s�R��
��?f�4G3��a�˥��`+�;+�t���H�W�!�/*t[T�燡p��Q�>c$

�M����΋�,������h�6�H���Ӑ���lU�w^��dY�>�]h^� k�������U?�4}P��V[�x�0�-^�&͗��	��J.��)�y!˶!C��l�d~'� �c�x"۬$j��
-4���]T�U��-�\R�������03����j��ze�j�1�s����,_�joٓ{
�e�g���:I@�h��P�,�4G�)�� �%�͓@kSQ�^����j�5RA;}�X��"$I����������� �♤�
�0g‰w�&�+w�b����(�Ʈ��7$,� �9�n�G��2�D��90P��ʘ���ܽ�}�os��
WKi�I1| u��e���9ꥒN��
j
�(NGbnM��+e
kiÇ�o��6��T�:�V�������Q�Ve��6��6G;ҡ�iL�^~$!�yrH�b���&�/�y��Q_�8�V$ ;E�
|2�+	;}:JWȤ
�0^ߘx�Z9�8t"��"ѾQ�`FA����)<����[?��#gJ>zz�㠹�Đ�P��
A�]o�%��[��k��y�cM�Q���k���1P
x�j�(�����c<������C	�H��2g7���U?�B����)� ps��e9_=�
$M$J����L�I�(���sF��r�"^�^E?1J�O��
^�ee6 `�Fg�� ���#ň]�0��!�g��K�(��.>n��dȼ�Pa@�u�4,GGF��
�J�\�
D�;�^���#�^ߘ�
�Y�>��-���^PY¢�������.2H6t�
�	�� [...]
�0�t���8��M!j���-��$Ή`A?Ӆp
U�V�J:�o��ֆ�f�)��_�N���&� �� �`xJb�v
`�
�[/<�w;��>7�jT��M����
5�
?���� Q
������Qğ��T��3Έ¡���Z%��e�B�(�L���C�mVQK`y��m�oWY��N�ԷNu�X�H��jsW���E��
.�
]-d��+,-�j� �7��6r
�i�j
�g� A��K�
-I���7�^b�͋9<=7����& ��$�гk����Y��e���
��\.p��*�*��m����
�� >A�y��F��EʽVW7C�@^Jb~�!�!7M���~Ӈ3ʣ!�֬�M<*��/�$��G/�f��`d�]:�O
:s ���<{i�n�u

�M( �[O&�*�]!���o
-9���l��;7yv���}-?�(�f4�~��ޑ��e���e�����_�{�!} ;_VǺ�;���$6�T�I��&�B�
��ʺj̞juX,�O��\)��XC�#̛�N�V'&
���b,�FC��-:ۖ{B�"��xp����i�Ł;�h�jd�%�
b�7�Z=��q
�
�.��X���U��DWF*LR{��oO/_��}��0&<�J�{��iQVv�k���!b�y���Ԇ�_^���~q>�z��,O������a��M�O�m�D�Mc�aXC
�Y�P�?����CH��)�
�A��\e��kc�r��y
t
�h�܏�,L�S�l?#2��F�hP���
<����`"8S�{o_ PBY<Dݏ�C�3tA�_[�n]��A�?XCA�N��G
�*��~m�x<�MG]��'`�@D�o���a;��\�ۢ\�ʾ;�U!�lh���E	^�Z�F9�A�3
���GhA�ű?��
�Ћ�2�I�����W���[#�)<�����]%�Dh��a�F-2B��	%u�Hs�?
��O,w���Cr��e�n�NO��7�,oH^���ܣ�w
-��6
�D��ֵt�㈵
-�ǐB�q�	`�{�yP���o�i/���k�|_�w�R��b�
-endstream
-endobj
-7510 0 obj <<
-/Type /Page
-/Contents 7511 0 R
-/Resources 7509 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7519 0 R
-/Annots [ 7501 0 R 7502 0 R 7503 0 R 7504 0 R 7505 0 R 7506 0 R 7508 0 R ]
->> endobj
-7501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 581.269 158.921 588.795]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.376 533.448 204.949 540.974]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.454 509.538 167.29 517.064]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 453.92 158.921 460.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
->> endobj
-7505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.448 318.313 237.536 329.217]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a19173722ebe43fed184ef76abfb1c28c) >>
->> endobj
-7506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.47 318.313 515.72 329.217]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7508 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7512 0 obj <<
-/D [7510 0 R /XYZ 89 770.89 null]
->> endobj
-7513 0 obj <<
-/D [7510 0 R /XYZ 90 395.464 null]
->> endobj
-7199 0 obj <<
-/D [7510 0 R /XYZ 90 371.056 null]
->> endobj
-7514 0 obj <<
-/D [7510 0 R /XYZ 90 371.056 null]
->> endobj
-7515 0 obj <<
-/D [7510 0 R /XYZ 90 304.145 null]
->> endobj
-7195 0 obj <<
-/D [7510 0 R /XYZ 90 281.649 null]
->> endobj
-7516 0 obj <<
-/D [7510 0 R /XYZ 90 281.649 null]
->> endobj
-7196 0 obj <<
-/D [7510 0 R /XYZ 107.713 197.755 null]
->> endobj
-7197 0 obj <<
-/D [7510 0 R /XYZ 107.713 181.551 null]
->> endobj
-7198 0 obj <<
-/D [7510 0 R /XYZ 107.713 165.346 null]
->> endobj
-7517 0 obj <<
-/D [7510 0 R /XYZ 90 148.025 null]
->> endobj
-7201 0 obj <<
-/D [7510 0 R /XYZ 90 125.529 null]
->> endobj
-7518 0 obj <<
-/D [7510 0 R /XYZ 90 125.529 null]
->> endobj
-7509 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F8 794 0 R /F75 554 0 R /F112 1773 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7525 0 obj <<
-/Length 2549      
-/Filter /FlateDecode
->>
-stream
-x��Z�s۸�_��
5!�&�>��$��]����2.-���������(J�m�
�$�� v�ۅp�
-p������E,�HK*��@� �		�-��!�x�����I����}����~��2�.�^_|� �
-�	(R�b{��
���� #�U����2�n���^�ږ���0��R[2;
�F� "
i���W��d(��;���(a
��s�^��ٜa
fɌ��[-�L�X�s���"�<�Z�o򬬊8�*O�5"����̎[�3���a-�2z̫2�֏�dW$e�Uq��{��ݿ?��;B�,�ܣer7#8������Ԏ�a�;�:�:�`ƒ�B
'H
�&
� ��4[�e�f�}Z���M��ܼ}lœDv �3�p��c�8��9����rв�����ԁ�"�\�"�t�,��@$EL(E�Rԙ�q�h�of�|�dY��@1��j
-(��7�����\�������a������\�pa�K1IG�F��=��p��jF��
 `[/~�̀ū1u��
�L�IV���T�dL �
G���U��E2���7Z�cD�󧭺��H
��@2xF��ܑU!��]XqR�[�󦴝��4ۤY�ŋ����pK@��ٟ���]vS����
��[Z���*5��@"s���M����0
1� ��)�D� 
���p*0$>���P0�0gS���)Ξ���Р�g�yh�X��R�DC�i
W�>��H�
�
�V�b5��q��z�'p�Qa�WG�J	�@7����,ˆ����?�h�`: N[���}0�D���.��ۤ��z�$C���"��-ԕ.��|��x�V
$z[��Q$�č�˭_=�)xI�@S��DX�����"ٙ�,Gq�:F���r�?.NR_ˮ�!��I��"���
X"}2�f�}��d(�|�i��X4B�$��Iq���� f�0�zo�jyy�f3	\hy(¢p�VR��c�A1G
-�Igj�
�g0U� �dtj���H�(�gz�.r�tk*�ލDx��G���ZZ�b�.�"�%�0
�����/�q�� qҀy��ӵ��n�=f�$/��[����KU�n�-j"���/�ö�}D��%8מ|Dj
��D����J~�RD�׀0� M_F)d
-
YQL��)rJ�)L�j},}�R�2��aD ��&0��
 �s��a�$3=�Z��+_m[�9����N@<���zNB��sdb\iD�s����5��(:�������|
-5]='�����J>���/;���
޻R�+��":&�-6y	��3��W�E�w�
�� ��nO�Nˑ
 ��nP>�: 9
��޴��	ю˞SQ�I	�У�
�5��<7�!��#8�a��S/�1M�E�J#J���� ��80�(��67�t?,
����ˍbLx�l:gDO��D�Z۰*�_4� 3
)# ����>�\)5�{ys����`���E�
��`�Ǚ{�ƀ��=)G䂟�.���r�L�߰H�p<�p�Q�K)�M��:(��o�
��S!IE�EDeԂ�T

���p������ֻ⾨�`�A�t�N��1�i6��p:'���#�(�����7�nkEq��6o�T�\]��

x�q�m
h
���ja�M��׻P�ǿlL��Ͷ�
�,�j_d�j� M�Ѩ�LuO������+��&����웖Y�?K�e�gwy[dlw�zoӮ���f}�wa��$K����A�ъ��eyN:RҮ��՛l����e$ +@� ��KRl��+����8�S�`'��uz7F�����	�a`x�g�Qj���F��������G��D����3�V�9�lG����y
J�`�)�Nۮ�X [...]
-^Yg�G<�}�c�
���BKZ~��\ջ
0
--����q�*�z�MAp�g�����0
~7�΀'��2G2O��u{:Ÿ��TW1\��	J�lQ$q��3�~ʡV�s9�rF���
uj��m�S��iF21��y��o`���APi�6-�B��)F�(�x���*//��!|B
��y�z�&Hɾ�|'
-�¶���S�Ĝ�*
Mb��`)�o���0p�'1�qs�!|�f���%v���,���(kN��9h#@Ԛߠ
�l����aT�
�:���fJ�s�O5Q��C�9�%	f*�S����K֐f��`: �n}2i=�4��`�j���b�� #����� �
�(��S��t_r���Q9�Ȳ�l�b�y>�$�?ͪé9��+�#�<Ȗ���ݿ�
-V	-N(��;�Y+��=C�
-��[M�՞��/s����)��]��

4#�I�������g����T��9���|��Փ�)���E��� ?k�kʯ`+&QD����}�|S?x��-
~�AX'n���&
��MM�a[�1�����u7�*�⧙0m0��oq���Mw]��c�a�]��UҔ�ή��f����_�
�����jw����~U&�
--��a��>�Pnu̻mIl���>�pk���>�?5]H
-endstream
-endobj
-7524 0 obj <<
-/Type /Page
-/Contents 7525 0 R
-/Resources 7523 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7519 0 R
-/Annots [ 7507 0 R 7520 0 R 7521 0 R 7522 0 R ]
->> endobj
-7507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.526 692.754 188.032 722.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.526 570.716 188.032 600.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.907 252.764 435.73 263.668]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-7522 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7526 0 obj <<
-/D [7524 0 R /XYZ 89 770.89 null]
->> endobj
-7202 0 obj <<
-/D [7524 0 R /XYZ 90 671.833 null]
->> endobj
-7527 0 obj <<
-/D [7524 0 R /XYZ 90 667.35 null]
->> endobj
-7203 0 obj <<
-/D [7524 0 R /XYZ 90 549.794 null]
->> endobj
-7528 0 obj <<
-/D [7524 0 R /XYZ 90 545.311 null]
->> endobj
-7529 0 obj <<
-/D [7524 0 R /XYZ 90 474.605 null]
->> endobj
-7530 0 obj <<
-/D [7524 0 R /XYZ 90 435.327 null]
->> endobj
-7204 0 obj <<
-/D [7524 0 R /XYZ 90 410.794 null]
->> endobj
-7531 0 obj <<
-/D [7524 0 R /XYZ 90 410.794 null]
->> endobj
-7205 0 obj <<
-/D [7524 0 R /XYZ 389.246 359.291 null]
->> endobj
-7532 0 obj <<
-/D [7524 0 R /XYZ 90 352.651 null]
->> endobj
-7206 0 obj <<
-/D [7524 0 R /XYZ 462.17 255.917 null]
->> endobj
-7533 0 obj <<
-/D [7524 0 R /XYZ 90 249.277 null]
->> endobj
-7263 0 obj <<
-/D [7524 0 R /XYZ 158.014 187.791 null]
->> endobj
-7534 0 obj <<
-/D [7524 0 R /XYZ 90 181.151 null]
->> endobj
-7535 0 obj <<
-/D [7524 0 R /XYZ 90 112.448 null]
->> endobj
-7264 0 obj <<
-/D [7524 0 R /XYZ 90 77.486 null]
->> endobj
-7523 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7541 0 obj <<
-/Length 2372      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�SBN��^�
6錛؝�NFuԾ8
� 	S
-�AP��}�� ,�$؝����Şo�~�;�,,
�D8���_�ON�J%(�i
�_G	�$O����U�aB0bt:#��ٔ�IZݥgS�'���6��ҋw�e�V����e���4/��
-<�q��V��}v�US�&Y��`>&c2��L?��|�����	D8"�@RE���qt�� G���f�]�)��e���?N�[
FT�K��s�K#�YH��]���R�ܬs
�
-)%�D
'� R����	�(�����)���)!��M�$8�
	�v/�35	�s>�W�X<�y<F8�,�F���rY������X��,!T_{o�Al��o���3�N=7\ ����}V���,
-B at t�0���,�j��A��4F
?(��,O�+{Q�G{?��)�<-8�,�O��1���e���6_��-���v^�2��cu�K
֟Ml?�	̢�բ���8�������D1D�1�z��›�M�f<L�������Mp�r7K�I��^\��e9�b�9/n���n5�<"��`�� 
֯��pԇ���ʳO�t�׏s�X�� �@"���>4� 
�(�`J�0F��`��a��:�`#�I�fc�ٝ!1�T�!d��LDž��L�$q��7�H����3����S�f�DH�z�O�� 
��
-�?��- 	�:C��K��J5��~�VCR�,�O�U���C�����dϞ�I������Py��$cy
�A,ࣰ�
�����Y�w��D�1�
�2W���bJ�9k�g7��(�8XP����N?�e�dg�um#:�:Eˬ!�A4?�⊁��/:7��
��t2����	��c
9��dt��2/(�{�
p#�
&���a�
?��
-XE�%���1yt�=_s�Tt� �����5_��3�ƽT݇V�=�
Wq_�o���ew����׍���/)��1GP��މ ;�)jO�o��GC��P�A�yi(^�/�P�~��Z�gx��Nϰ?r�S#g��B>���<5fc4ܼ2�G7#@�
E �I
�`|C�)�M��.um�i_D�Q�C�He���n�E��.�w_\��h2j�e�X�{B���#ٕID�f���
	ªӍ
�Y1) ����og��o�������`:ޔ+i�5=F������b�OZ�FK��p�-���l�	�F�^�1>����נ�zj=du�귝�׻
�3���d`���
�ć�3���ײvc���
^�hx�����&Q&�e���>s��]��T��{�̿����W

�&B��sYַ�A����<o��6�i�3�zJЁ�ģ���S�89:� �g� “2�`|��br�,��r
�,A,�
)��p�W�+�1"T}�#�MuWHH��ͮ ��+~����z�-�!�����a]2v���o����O�,-�6h�V7���M�d���ċ��L3�vY���
-��-V����죽�ws
���_kK�����qi�0Y���&NV�EN
dWr3r��7�����Io 
-�aH���P3�K�i�g�!�y���H�@J�����
-1-XT��V��4(��q�;���������'
%6	����XB��q��p�ps��R�k
-�����+9p�(�2{e����+w�6��¾�
-(��]S=t�H����
�(L!D)�1:%��ɼ5B�
�7�*_5O�k�ܑVoZq<PG���
�;	+�*�m��@��\v�
��
Kh�c�t�ҿ>{[�Yq����)���}�L��}y�.�s���T.�P��\���Q��"2�;-C̝С���K���aM>�~P< !tR�N�j{�J�HMg�w*�b
�'׳�L)#����f��A���;
�Q�^�͈��*�G$���W�4��d;BDzUK��iѣO A�%������O�'N�<�y�
���#��6�؁����1���sc� f6�ID�c�M
-╧��l�Z
�����&$PC
5_���-\�b���������8J��T�M҇H��HʞOR1
I[�v�
�Tvު���	��^ݤ���;w��k��]CD��A'�PRsA:��9�#��5S	����ԫ��m$C�!�y�yh��֫�z*'��i1
�I�O�`_
3�7Il���<���C4��8Kz����6����t���C�Z�l&�R`J�����r��
�s���;{�O(�Z
���k߮��}i�
-w�I��-�x�[�9��"���
-
	������秧��UVܠEy����u$����g������w^���b�_����Q at 7C�s� g~A�DJjFt�͏�Aw��ow,�����_Y$�
-endstream
-endobj
-7540 0 obj <<
-/Type /Page
-/Contents 7541 0 R
-/Resources 7539 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7519 0 R
-/Annots [ 7536 0 R 7537 0 R 7538 0 R ]
->> endobj
-7536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.507 332.884 236.499 343.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) >>
->> endobj
-7537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.256 276.714 511.506 287.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-7538 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7542 0 obj <<
-/D [7540 0 R /XYZ 89 770.89 null]
->> endobj
-7543 0 obj <<
-/D [7540 0 R /XYZ 90 721.073 null]
->> endobj
-7265 0 obj <<
-/D [7540 0 R /XYZ 90 599.456 null]
->> endobj
-7544 0 obj <<
-/D [7540 0 R /XYZ 90 594.973 null]
->> endobj
-7266 0 obj <<
-/D [7540 0 R /XYZ 90 468.683 null]
->> endobj
-7545 0 obj <<
-/D [7540 0 R /XYZ 90 464.2 null]
->> endobj
-7267 0 obj <<
-/D [7540 0 R /XYZ 413.145 397.877 null]
->> endobj
-7546 0 obj <<
-/D [7540 0 R /XYZ 90 391.237 null]
->> endobj
-7268 0 obj <<
-/D [7540 0 R /XYZ 464.551 336.037 null]
->> endobj
-7547 0 obj <<
-/D [7540 0 R /XYZ 90 329.397 null]
->> endobj
-7548 0 obj <<
-/D [7540 0 R /XYZ 90 251.751 null]
->> endobj
-7346 0 obj <<
-/D [7540 0 R /XYZ 90 229.374 null]
->> endobj
-7549 0 obj <<
-/D [7540 0 R /XYZ 90 229.374 null]
->> endobj
-7347 0 obj <<
-/D [7540 0 R /XYZ 90 177.482 null]
->> endobj
-7550 0 obj <<
-/D [7540 0 R /XYZ 90 172.999 null]
->> endobj
-7348 0 obj <<
-/D [7540 0 R /XYZ 90 133.267 null]
->> endobj
-7551 0 obj <<
-/D [7540 0 R /XYZ 90 128.784 null]
->> endobj
-7349 0 obj <<
-/D [7540 0 R /XYZ 90 77.097 null]
->> endobj
-7539 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F8 794 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7555 0 obj <<
-/Length 1545      
-/Filter /FlateDecode
->>
-stream
-x��Z�s�F~�_��֞�7w{��#yh
����}	L�2Ml���?�+��Y�dٖ��C�}�������$��]$��N'���<x�&�\F^DV{ ��{�Q����I���
ߕ~����'��O^&�

M����
X]�
�_��-�$����J�D���^~�M,�����&2�U�LJ�2�@�E:	��	�A(]�:�-W���l�--Y�����C����l
{
-��(_���$,�+^	��6��Ǘ�����8���/��R�7%���!x狼��Z��R�������In{W����ѻB�T��"�
�a��gq�T�}��>��7ui��Òb�G�>e����,�.�x����H�a�\^�g5�
�|~�Wu2<����� ��:u����֌��R�d7D���E|=]�o_�ǒ����6?�`y�R���_�է�l9#���}�]\Tp^
-��*�9�A�c �
-�K&�|%�`	�-L@���+��th0��lw��l��lE�`j��S��,3ۙF0*	�
F�l
�
 k�b �>tAᏊеFX���.@
�	c��_
abY
��U�ܢ����T��A��M�hj9c�wÀ����nx;2˽�X����p�������\�TѪ�9�K%W���[X7`ՠo�*� �C����F�7H�=�t} ��AJ��4T�0���:T׃�
�:f��:�b�0
�S!I;K-H��H�%�e�ӂ�g�)ʫq�dɣ ��=]ݓ���'����p���g}�
݇l_}�mp;k
�f�n��o�9$�Y��L{�|�}H�ĔbS�h�
�皬��Q֯(��%��>�(�p�weZU���!'K�BZ�FHY�.�(i��M��.�� �
�^�j�P�I+���V|�<�|iҪ<q��ևuF �7e�xmZe��a8��
�U�|tM�P�#Ϳ\!��E�#��k�����5i�,��j���J�G4ng۪�
�b��Q��s
�"��NB�

�lJ���s
����
��e���n��
��B,��c�B�˞�B
�J�PME�2A��������z�R�R��j�I0�t�:
O~<8'�
���i�zp�����~�iS+6P`��& )z������jE(yC��
�Y�t`h�?C+bE��3�����}��U�p+�7:��Qڶ
-h-[ՎG�K���a��6F�j�΍��ߋ�5����~�sHz�@-}r�n5�)N���|��xJ��7N�Ѽ�
4WG9����{��s1�vu
-:�
-�>C��{�P���L�U��d2b7��̫&5%y6�K��d`0��7��,����z�1Iݹp��"+O�z���	y7���'E���.OB�G�
�j�)nݨ-�T�|dW|��3��u�~�߳����}?gc�ܘ퍃�b�=�4�K��xY�i��fM��I~:/^<�.~[Ƌ�GD����4�}�^g�I�X�$1$�:�~(A$x��X1�_��/Y\a?
��O��8���Շӓ�7��-��;����^�����
d��|���Ռ?���8κ��#���
-endstream
-endobj
-7554 0 obj <<
-/Type /Page
-/Contents 7555 0 R
-/Resources 7553 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7519 0 R
-/Annots [ 7552 0 R ]
->> endobj
-7552 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7556 0 obj <<
-/D [7554 0 R /XYZ 89 770.89 null]
->> endobj
-7557 0 obj <<
-/D [7554 0 R /XYZ 90 721.073 null]
->> endobj
-7350 0 obj <<
-/D [7554 0 R /XYZ 90 676.658 null]
->> endobj
-7558 0 obj <<
-/D [7554 0 R /XYZ 90 672.175 null]
->> endobj
-7351 0 obj <<
-/D [7554 0 R /XYZ 90 620.488 null]
->> endobj
-7559 0 obj <<
-/D [7554 0 R /XYZ 90 616.005 null]
->> endobj
-7352 0 obj <<
-/D [7554 0 R /XYZ 90 576.273 null]
->> endobj
-7560 0 obj <<
-/D [7554 0 R /XYZ 90 571.789 null]
->> endobj
-7353 0 obj <<
-/D [7554 0 R /XYZ 90 520.102 null]
->> endobj
-7561 0 obj <<
-/D [7554 0 R /XYZ 90 515.619 null]
->> endobj
-7354 0 obj <<
-/D [7554 0 R /XYZ 90 463.932 null]
->> endobj
-7562 0 obj <<
-/D [7554 0 R /XYZ 90 459.449 null]
->> endobj
-7355 0 obj <<
-/D [7554 0 R /XYZ 90 407.997 null]
->> endobj
-7563 0 obj <<
-/D [7554 0 R /XYZ 90 403.514 null]
->> endobj
-7356 0 obj <<
-/D [7554 0 R /XYZ 90 363.782 null]
->> endobj
-7564 0 obj <<
-/D [7554 0 R /XYZ 90 359.299 null]
->> endobj
-7357 0 obj <<
-/D [7554 0 R /XYZ 90 307.612 null]
->> endobj
-7565 0 obj <<
-/D [7554 0 R /XYZ 90 303.128 null]
->> endobj
-7358 0 obj <<
-/D [7554 0 R /XYZ 90 251.441 null]
->> endobj
-7566 0 obj <<
-/D [7554 0 R /XYZ 90 246.958 null]
->> endobj
-7359 0 obj <<
-/D [7554 0 R /XYZ 90 195.036 null]
->> endobj
-7567 0 obj <<
-/D [7554 0 R /XYZ 90 190.553 null]
->> endobj
-7360 0 obj <<
-/D [7554 0 R /XYZ 90 150.821 null]
->> endobj
-7568 0 obj <<
-/D [7554 0 R /XYZ 90 146.338 null]
->> endobj
-7469 0 obj <<
-/D [7554 0 R /XYZ 90 94.651 null]
->> endobj
-7569 0 obj <<
-/D [7554 0 R /XYZ 90 90.168 null]
->> endobj
-7553 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7573 0 obj <<
-/Length 1580      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�F��+��TE����C
;eG�(����rA�Hb�$���Oc%\DB�+�8���y��`D�s����k'�p���w�F1� #�t.�
�
�
�:]������
��M�/�
�n8������r6������8�GA�
Q��Wc:�n��+yD�6X�ǔ$.���|����w�#�vH��@J;�I��g�
��;�|MM
N\�·ޟ=\1-5	dTM"�d���d��\#��N�.ٓ�����14����Q6�Z
d
&��/D)>/���q?a��#.ha�>aL#�)R��
JS6�F�Ѧ�۪��VȀ���J쏧�� �����R��9;c��ܑ��k�3�c��aR�V�S�kA�6�RQ[v�6�u6
-�}y��6C�t:
-��,��MFp)�6�8bR"��s�!����$WST����1�c?�����>~#+�A�RD���|o�Y�̌olv3���2��[V�4�\#.u
�r
�� 
M�Y	UN�2�+�;�P����zU
 j� �w���V��n-�E
-��*�	���kI#�$‹�XC+ºא6)ȐR�>�8�CTɷ
�r�
�W�4�p�y
?;3k�]�&�w�p��B-�?���ܢ:�֪��h�Ka{�B�3�/���
��|�IU"D��䕳�[@-�� �$	*��3��h�?�珁fs�J�v�)�+�5�BtT�,BW�$�-%�XD�
�,���(G����ԓ
�&�LE�"�o(g������;��+^�~NJ��`��Bx��d��:Tb�T0��]0�/u5P��t��]u�܀��cLD1�K�x�鳖�2�s��DC@�}�݇ ��M�a���֟dE�첆քCn�e���i+���r��K(-d�|
ؑ
-����t3��A�0(�[ MF
d )�젰M�T�
�?f��,ߢ,�K�mЁ[`A����/<���ۦx��tr{�č	�J�@$4}���
  ���
 �a8�"�d�)M������RnOJ��Ͽ퇉n���HA(ҼeCgu
-(Ѹ.���YS�q\v>��
Q~0̡��;�iu
-��<T,P��J�
����F
�<��mq�
s@����{%���!��Ѐ���
h@#�����If���Fʈ�A?�JCU�J�%���0B� ���
�
!�W�v�~�I�b�<��ƒGA�8 �7�NR}i�R��������Ŭ&�:��s�yb�g�j6��r5�?bZ:쩰��@P���
-���;o�0��;m�?�`�z�J;��N_�x��b��b�髦t��k���mN_���,�ĉ��(�d�I���.�Ď'��I��*�% ��x������_l����# #O�c��5 �I�g4���R4ٮ���k�֘�
s����H%E��m?"Mϖ��Ӡ���g�\!ar4]G
��g��_S��l
�
��~0���}��s��F)�҇��j�%�����ܪL����^ꔅ*$=B.��M
����/g�S\�A8Y���0ˡ�
-��*3	�ܠQ '~
z�⴮����%-<μ�c�MG,ߧ?/���N��K���/�Қ�
-endstream
-endobj
-7572 0 obj <<
-/Type /Page
-/Contents 7573 0 R
-/Resources 7571 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7519 0 R
-/Annots [ 7570 0 R ]
->> endobj
-7570 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7574 0 obj <<
-/D [7572 0 R /XYZ 89 770.89 null]
->> endobj
-7470 0 obj <<
-/D [7572 0 R /XYZ 90 676.658 null]
->> endobj
-7575 0 obj <<
-/D [7572 0 R /XYZ 90 672.175 null]
->> endobj
-7471 0 obj <<
-/D [7572 0 R /XYZ 90 620.488 null]
->> endobj
-7576 0 obj <<
-/D [7572 0 R /XYZ 90 616.005 null]
->> endobj
-7472 0 obj <<
-/D [7572 0 R /XYZ 90 576.273 null]
->> endobj
-7577 0 obj <<
-/D [7572 0 R /XYZ 90 571.789 null]
->> endobj
-7473 0 obj <<
-/D [7572 0 R /XYZ 90 520.102 null]
->> endobj
-7578 0 obj <<
-/D [7572 0 R /XYZ 90 515.619 null]
->> endobj
-7474 0 obj <<
-/D [7572 0 R /XYZ 90 463.932 null]
->> endobj
-7579 0 obj <<
-/D [7572 0 R /XYZ 90 459.449 null]
->> endobj
-7475 0 obj <<
-/D [7572 0 R /XYZ 90 417.95 null]
->> endobj
-7580 0 obj <<
-/D [7572 0 R /XYZ 90 413.467 null]
->> endobj
-7476 0 obj <<
-/D [7572 0 R /XYZ 90 373.735 null]
->> endobj
-7581 0 obj <<
-/D [7572 0 R /XYZ 90 369.251 null]
->> endobj
-7477 0 obj <<
-/D [7572 0 R /XYZ 90 329.52 null]
->> endobj
-7582 0 obj <<
-/D [7572 0 R /XYZ 90 325.036 null]
->> endobj
-7478 0 obj <<
-/D [7572 0 R /XYZ 90 285.304 null]
->> endobj
-7583 0 obj <<
-/D [7572 0 R /XYZ 90 280.821 null]
->> endobj
-7584 0 obj <<
-/D [7572 0 R /XYZ 90 258.774 null]
->> endobj
-7585 0 obj <<
-/D [7572 0 R /XYZ 90 236.666 null]
->> endobj
-7586 0 obj <<
-/D [7572 0 R /XYZ 90 214.558 null]
->> endobj
-7587 0 obj <<
-/D [7572 0 R /XYZ 90 181.497 null]
->> endobj
-7588 0 obj <<
-/D [7572 0 R /XYZ 90 158.388 null]
->> endobj
-7479 0 obj <<
-/D [7572 0 R /XYZ 90 125.327 null]
->> endobj
-7589 0 obj <<
-/D [7572 0 R /XYZ 90 125.327 null]
->> endobj
-7590 0 obj <<
-/D [7572 0 R /XYZ 90 102.218 null]
->> endobj
-7571 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7594 0 obj <<
-/Length 1750      
-/Filter /FlateDecode
->>
-stream
-x��[[s�V~�W�3��\���3m�t�&�Ӿ$��
r�Ԁ#������a���6��!�vWg�oo�)��{�Q��K��C��i�9y��g�U\y�+�RO�%R᷑��� ݷ�g�P�0����Ͽ�
��
\��:g�·ß���h�
'��o�7���P����/�x�~^{�?:�dYl�([�a,��P'
-�s�W�C�ֹ���|��"YZ�K�V�n�(X̢d
�*�	A����*$�E���J��6��0R0�d�����0��>�tu����|<�Vh1�Pf����,��K7,[�GU�*�t.e��
p�.�-��U�	b$[�J�Z'�����x=���2Y�:
-��E8zC2x\+�z)\z�F�
-�����Զ0��/�6�K�|�_]�� ��a�S�!P���F�$M0C��Jk΁�5XP��`�9d�v��`�X�)�
-`o��
?�6�������
�|89嘊�!�ZOI�X��"+ތ�yl�M���AQ������_���ܵe���nC���V%�Qx��~���:��"\N+�ɈV�	B�8�8�qb
-��k
r�a�
��룚ƻ���QM��@��4�B#[�!X�%�� � �8#�#4�h���R+�����
ķ.+�e����al#FX؁j3=�M��
�׼���yi��lM�W�S�������.����j>�Jx�L��,�$GQ�&�ƅ[
�n����&)�֦#tB�]R��)b��L�5H��('!�j)E��A�_�hQ]�@j�k}��E�v�4��KA�Ǩ�)���V7�!�C(�N"� { P15<��Mx�`u�[Q��!���	� /ѧ��ſ��ǴP��/P��m��֝R5�Mբ+d!����+&��i�c��WT,J��F�P�aQ��W�a���-���[j�(Vya[(��B�V?l���8G��B��9Z)Yo��CY�D��cи]@
߫c j1\�XT|�Q��D���^QV��7����L!�nR �n9Q��?@�'��:O�6���H�MyB3�mh�k��P?^��4/��[�f��u�3�������2`n4n�̙
���a��tά�P���e,wz����@$�E-��(���˵�>˕�?���X�Q�����k�>���܃U)�hל$!�V�Z
��n���խ
㭇Ӈ�
���
@~5E��[�z���D�t�'b]懛��q�[����'bN�f�'b-�O����?<�z"v����1"=�VG�\`"���E��jDچ�tDZR�_
���8�S��u9���(ͻ������}HZM�;�p���
U�s�s�>���կzy����iS��u���2�W<	Az4�N�}�"���x��%F`[�MX*}]�qo���U�E�e�+7�1*��QA4	*2�tF0�� �]���R�HҠ2͂��k�����QTe�u�۱�bu�P*��||�3���
�����*�����
kՆE@%�lQ�
\�^<�x\�w�X�ċ�_]�UF'�z��i���8y���Ƚ�	�x4x��aq�L<w;G���,J�a�K�c���9)i^�s����3,]�Pl���ҋ2
R�o�8� [...]
-endstream
-endobj
-7593 0 obj <<
-/Type /Page
-/Contents 7594 0 R
-/Resources 7592 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7519 0 R
-/Annots [ 7591 0 R ]
->> endobj
-7591 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7595 0 obj <<
-/D [7593 0 R /XYZ 89 770.89 null]
->> endobj
-7480 0 obj <<
-/D [7593 0 R /XYZ 90 693.576 null]
->> endobj
-7596 0 obj <<
-/D [7593 0 R /XYZ 90 693.576 null]
->> endobj
-7597 0 obj <<
-/D [7593 0 R /XYZ 90 670.467 null]
->> endobj
-7598 0 obj <<
-/D [7593 0 R /XYZ 90 637.406 null]
->> endobj
-7599 0 obj <<
-/D [7593 0 R /XYZ 90 602.342 null]
->> endobj
-7600 0 obj <<
-/D [7593 0 R /XYZ 90 569.28 null]
->> endobj
-7601 0 obj <<
-/D [7593 0 R /XYZ 90 535.218 null]
->> endobj
-7602 0 obj <<
-/D [7593 0 R /XYZ 90 500.154 null]
->> endobj
-7603 0 obj <<
-/D [7593 0 R /XYZ 90 467.092 null]
->> endobj
-7481 0 obj <<
-/D [7593 0 R /XYZ 90 433.029 null]
->> endobj
-7604 0 obj <<
-/D [7593 0 R /XYZ 90 433.029 null]
->> endobj
-7605 0 obj <<
-/D [7593 0 R /XYZ 90 409.921 null]
->> endobj
-7606 0 obj <<
-/D [7593 0 R /XYZ 90 375.858 null]
->> endobj
-7607 0 obj <<
-/D [7593 0 R /XYZ 90 341.795 null]
->> endobj
-7482 0 obj <<
-/D [7593 0 R /XYZ 90 308.734 null]
->> endobj
-7608 0 obj <<
-/D [7593 0 R /XYZ 90 308.734 null]
->> endobj
-7609 0 obj <<
-/D [7593 0 R /XYZ 90 285.625 null]
->> endobj
-7610 0 obj <<
-/D [7593 0 R /XYZ 90 252.564 null]
->> endobj
-7611 0 obj <<
-/D [7593 0 R /XYZ 90 218.501 null]
->> endobj
-7612 0 obj <<
-/D [7593 0 R /XYZ 90 195.392 null]
->> endobj
-7200 0 obj <<
-/D [7593 0 R /XYZ 90 172.186 null]
->> endobj
-7613 0 obj <<
-/D [7593 0 R /XYZ 90 172.186 null]
->> endobj
-7592 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7650 0 obj <<
-/Length 1777      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~��0�����E�%Xt�2�k��ɞ�"�%��&K�.
�_�CQ�%Y��8i3�O�d^���ϡ�����_&?]NN�\f��w�c\^>6\�G܁��xo���cl�[�A�
��-��,Y/D�Wo�Y
����YZ�y���ź(�ҚR��IP��N\��"�)�P�e)vLjs�����ϗ�O�a�(A8r=#\N��F�_ ��7���aSmb\L���F'�"�eW6����FS�GۆK�m��oY)jI�k��9ݩ�C.��)��15�r�PJ�0[I;���'i�*,�\�
���j�M �n�r�+�0��Y���i6��f��#�\"-�2�R�.�

��x
�A"�E�� �s�P6�K��S�"Sm�JՋ۶�l�FqQ�鼊�E0K�z}�g�vj�Jo���mP-����aL)��w

#�,��
��굑��[9�
�nj�6s��<(kӍ�u�%IfQO��4v"N{�0��l恐
9~�������S�Y��X�_zx����M%����F6`k�|ԮɷM�
�y��}1�w�!2-):r#���Z�4.8��[�����2P
\�(�
�?=T����ً3ۂ0L��νH°�<��%ё�z:�A"��"�[	��1�D-:�6H���yC�NԬ�*��-j�@���p��6!�8
�*j$!���!��j�#k�l�
���`
Ƒ��v؏������"�P�6��m0U��^I
*�˙�U��JC���Xܲ�" 8�F�|�`�����5 ��
7﷗������Y���Jʫ~`���-j6<PӱkRP��`B���V󥸖+vaR��֔�n3yHWq50h��X���>�Y�����V,�00��"���c�C�`�'���ӿ�����>�
-8�Q��\�M`���GT�&�1ǵ�ŝ�����fx���D������"���󼒁w�ZO�y��@@�A��9d��(��
��S$q���8lĉ��0/F� �u3dC�w
U$؉�����[�5#�bsM��z+C�D��] �m��9t
Q^��Ye��N����IrK�-�n�pᘓ3H�:5&�

n?`��z;ɤK�܃=z�!;���ޗ�����݈�V�n��g��1!�yQ��T֧��>��@
�A�[M��%��نow��;QVy:�r�*W�lm6�S}�)�x�
-�e�9�a6r����n;F��vq���n_4��\_���n�b�,<H�q
|�!�
���,F

v����뚹qw6Ln�#<���]s�(���U�^���R�H/�̯—���O��YlN�Z�&!L�$���<�����~����m�S���l�E�9�L�}t;�v c�c�v!ʭ�o�}^�-����&��ԩ�z��?A�h6k�ƪA�
�@�:P� �β,���EP\u
-�/ö[1���|��I�!���1��Ǣa�
�
a��<z�}�b]ѩ���S}���e��m�f\���p
-G0�G���qX^����}@5j��!�
���*@R�W��ԣ�j�7-�̩w[~��EY0�v�:'�_zr=~�m��V�P'(�}��3��[��@cG[����	�h�\�~OaF]�
*�9�,�ϩi�(�C�� ?��d�ġ��?����`	04�������7��'D��-���jo��j?|K	?KÉ|��TK���
�&�J迍����t�I긍�W��Oe�:=9�Us���(̖ێ���r5ѯ;G�hI/���
,�ڑc����� c~�`����zD�_��Nl^��Z2�e����_x�M
-endstream
-endobj
-7649 0 obj <<
-/Type /Page
-/Contents 7650 0 R
-/Resources 7648 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7668 0 R
-/Annots [ 7614 0 R 7615 0 R 7616 0 R 7617 0 R 7618 0 R 7619 0 R 7620 0 R 7621 0 R 7622 0 R 7623 0 R 7624 0 R 7625 0 R 7626 0 R 7627 0 R 7628 0 R 7629 0 R 7630 0 R 7631 0 R 7632 0 R 7633 0 R 7634 0 R 7635 0 R 7636 0 R 7637 0 R 7638 0 R 7639 0 R 7640 0 R 7641 0 R 7642 0 R 7643 0 R 7644 0 R 7647 0 R ]
->> endobj
-7614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 495.72 191.737 506.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) >>
->> endobj
-7615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.553 495.72 257.311 506.624]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 467.628 191.737 478.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_af2d6708545759fc6836df550bab529a0) >>
->> endobj
-7617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.075 467.628 262.581 478.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.234 467.628 341.992 478.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 439.535 191.737 450.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5498315352fd30826df848010c6bac1d) >>
->> endobj
-7620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.075 439.535 303.527 450.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-7621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.037 439.535 391.795 450.439]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 411.443 191.737 422.347]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a92333180e0163e9c87f2220dceef012d) >>
->> endobj
-7623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.075 411.443 296.902 422.347]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 383.35 191.737 394.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a32d97203a9cbf1abf97af74fc70df05b) >>
->> endobj
-7625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.075 383.35 296.902 394.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.431 383.35 380.188 394.254]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 355.258 199.486 366.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a964e4bcbbfde58f43977d0a8e686ec35) >>
->> endobj
-7628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 327.165 191.737 338.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.477 327.165 243.284 338.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_adfa7b03e2ac3a6666a7538431f1bdee9) >>
->> endobj
-7630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.621 327.165 348.448 338.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 299.073 175.668 309.977]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 299.073 234.596 309.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a09afd391300355989769ad52d3cc97aa) >>
->> endobj
-7633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 270.98 208.395 281.884]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ad876557324aba0b545e25ebabe5a064b) >>
->> endobj
-7634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 270.98 273.968 281.884]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-7635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 242.888 179.554 253.792]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 242.888 250.666 253.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) >>
->> endobj
-7637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 214.796 220.579 225.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ab79c93f68d0f4589de855e872f9e72f6) >>
->> endobj
-7638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 214.796 290.038 225.699]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 186.703 192.554 197.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5fbb0274f3a0a91ad283aef6e608909a) >>
->> endobj
-7640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 158.611 225.211 169.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a6aec148aa41935a4072c64a43c51c577) >>
->> endobj
-7641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 130.892 158.044 141.422]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a8388d0d6d7ff68c627d516ec17f56b4c) >>
->> endobj
-7642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.382 130.892 228.888 141.422]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 102.426 161.013 113.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a314eb5fed86c6bbe4a7223ca8362f0a9) >>
->> endobj
-7644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 74.707 155.265 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a3410a53827de9155ac7d6cbd84263364) >>
->> endobj
-7647 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7651 0 obj <<
-/D [7649 0 R /XYZ 89 770.89 null]
->> endobj
-1788 0 obj <<
-/D [7649 0 R /XYZ 90 620.299 null]
->> endobj
-266 0 obj <<
-/D [7649 0 R /XYZ 90 613.575 null]
->> endobj
-7652 0 obj <<
-/D [7649 0 R /XYZ 90 514.813 null]
->> endobj
-7653 0 obj <<
-/D [7649 0 R /XYZ 90 514.813 null]
->> endobj
-7654 0 obj <<
-/D [7649 0 R /XYZ 90 484.986 null]
->> endobj
-7655 0 obj <<
-/D [7649 0 R /XYZ 90 456.894 null]
->> endobj
-7656 0 obj <<
-/D [7649 0 R /XYZ 90 400.709 null]
->> endobj
-7657 0 obj <<
-/D [7649 0 R /XYZ 90 372.616 null]
->> endobj
-7658 0 obj <<
-/D [7649 0 R /XYZ 90 346.25 null]
->> endobj
-7659 0 obj <<
-/D [7649 0 R /XYZ 90 316.431 null]
->> endobj
-7660 0 obj <<
-/D [7649 0 R /XYZ 90 288.339 null]
->> endobj
-7661 0 obj <<
-/D [7649 0 R /XYZ 90 260.246 null]
->> endobj
-7662 0 obj <<
-/D [7649 0 R /XYZ 90 232.154 null]
->> endobj
-7663 0 obj <<
-/D [7649 0 R /XYZ 90 204.061 null]
->> endobj
-7664 0 obj <<
-/D [7649 0 R /XYZ 90 175.969 null]
->> endobj
-7665 0 obj <<
-/D [7649 0 R /XYZ 90 147.876 null]
->> endobj
-7666 0 obj <<
-/D [7649 0 R /XYZ 90 119.784 null]
->> endobj
-7667 0 obj <<
-/D [7649 0 R /XYZ 90 91.691 null]
->> endobj
-7648 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7705 0 obj <<
-/Length 1690      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�8~���k�Ԋ$�l_v�M'�f���C��(XN�rqn���=;v���	2H�s?�9`���Ϋ�����S�:!
-}�;�3'��B�|�5u>
�現\�v\?@$�ᔹ}�������������ۀ�#쐊 C<p�t��
v�p����έٔ:
u�8����y5��� o��y#4D8p8!�����2�G�K5S��"I�Ey#�E�g�,F�
E��v۬yl��;�V��R��n��ޔ5��^���,�i��L�yf���#��Z��S�i~L)�=ꌉgte��L)k
��\\[m|5p>���O�R�̋��h����:�Z���Ϙa�#k�٠Z��2R#�R4V*Ezr��R��k
�k�͆y���k�=�8�cZh�?�I�h��&w��L3
*Z��cV;1Pr�]��m
�����&Vզ����s�M��-�ˊI������0֋�XIʹe��|��
g�l�(�A��,��υ*ǰe,k�P
!dx���O�a��'�V ?�¶��U�U�'��e|x�Ⱥ8��ш���:7Ͷ%Ey��(b��DQ9��f���59������k��x�[MBEq<�.��#����A59�#�

-���rUN��#Y
��a�7�Q�������Y��t;�.Jf%跮yW�
-䱰�TE#
�{��R�����2��k9\
-[g��_e��q�S�kL��0-�ϲ$7�1P�I���m
��CV}(�E�'ͦN/	%��y`�4�� v�y��|�*� %_� �۸ʋ
o��tٞ�
�q��*hUh'���
�#�uZ��ޥ��'+�ev�:�jN�VP�:�}�=�a�LX.��E$�՝����U>l�>�"�>�q��ƍq��qՋ AӋ�
�(���
-2v}�<L,(�~#�(7lO�˓�1�
 ��d
��|=l�b!��ŨEI�f��y� �~#�L$��t����4g��ƈs�P�B�Z,'*�)'�r.���e^�db����j��ٯ Ԇk��A�U�l�l>�8X1oF�b
�i}�+���z^�万1������ìk��t$����2��-��L���Z��i`@�����(`�O\�Nԭ�Vlŵ[�O��B�+&�x��ij�*�
�[1��M
����V���˛.J�s�ebBn�aDD�T_��m K�� �]K��snG����jćI��L���7��E�:��h��4�MX�侻�eT����LH��11���j��+3����q�H�o��b���s;�=�{��6�>%��錪
���q��HtJ|��5�7�
%B��f.�
��>٣	~��r�=����r��ޗ�w��)�\���
��.Tu��Ȳ��o y	B�����Y�<$b��A(���
��b��횏8U��EJDi@����X#���1�>/k�z#�F5JփM�0�y
]���?�/Dw%jJ Gأ�y۝)�n5��~B�K��v߿�Nqk�{����8�����z��m7��(�
k
����b
�
��xއ���A
����6??���v����v�㈅��7�a�pN����yX��7��R��+b+rc�7^4��.����
c��:������(Y��'+6�٢�õM�븑�
-�d�
�\Ⱥ�W|}m�~�?��u~��ت��)�������Z��Eyz7&�ƣ��y��g�M��6�$�L�

m�?ܸ�
-endstream
-endobj
-7704 0 obj <<
-/Type /Page
-/Contents 7705 0 R
-/Resources 7703 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7668 0 R
-/Annots [ 7645 0 R 7646 0 R 7670 0 R 7671 0 R 7672 0 R 7673 0 R 7674 0 R 7675 0 R 7676 0 R 7677 0 R 7678 0 R 7679 0 R 7680 0 R 7681 0 R 7682 0 R 7683 0 R 7684 0 R 7685 0 R 7686 0 R 7687 0 R 7688 0 R 7689 0 R 7690 0 R 7691 0 R 7692 0 R 7693 0 R 7694 0 R 7695 0 R 7696 0 R 7697 0 R 7698 0 R 7699 0 R 7702 0 R ]
->> endobj
-7645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 693.559 170.687 704.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 693.559 195.165 704.463]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_af59c44aeed3fb4b88852730664a84e9e) >>
->> endobj
-7670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 652.184 170.687 662.714]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 652.184 187.563 662.714]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ae36d644db84375b3aed9a748c6dff35b) >>
->> endobj
-7672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 621.394 150.493 631.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ad350b84c25b7c37693d2e7a08d3165ca) >>
->> endobj
-7673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 590.231 181.845 601.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5cebd3d6d6ec070c47682e77b0248f22) >>
->> endobj
-7674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 559.442 181.845 570.345]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) >>
->> endobj
-7675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 528.652 154.727 539.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2552e7a194f5fb0d591bafb591b91968) >>
->> endobj
-7676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 498.236 176.505 508.766]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5a79ce2b52efebd42da2736164a043ad) >>
->> endobj
-7677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 481.795 450.955 491.7]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) >>
->> endobj
-7678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 456.114 191.718 467.018]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-7679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 456.114 288.852 467.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2b451e6b09162c7c19b0a2ad36545c69) >>
->> endobj
-7680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 425.324 191.718 436.228]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-7681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 425.324 303.079 436.228]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a78a4d5f5e4702a16d6aae656293ec7ad) >>
->> endobj
-7682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 394.535 169.013 405.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a999f627225c179795a8922d8335065fe) >>
->> endobj
-7683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 394.535 250.656 405.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 317.93 203.075 328.834]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-7685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 317.93 296.324 328.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ac3223cf8c7d19b02b5e3c04038024b47) >>
->> endobj
-7686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 301.862 346.612 311.768]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 287.514 194.297 298.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a70e9ad42674d62ed9bd73268e3af7064) >>
->> endobj
-7688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 256.725 188.759 267.255]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_aea9a4fb9807eb61cda3eedf8e5a7acae) >>
->> endobj
-7689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 225.562 238.78 236.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.52 225.562 319.029 236.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a6293b813e42a59a9795cafe0efa762cc) >>
->> endobj
-7691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.965 209.494 397.522 219.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) >>
->> endobj
-7692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 121.678 226.034 132.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_add9738866968b13e938d5669dd94a55e) >>
->> endobj
-7693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 121.678 399.003 132.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 90.889 156.281 101.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2b9db6ddc26573299d412b80ee0dc018) >>
->> endobj
-7695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 90.889 237.924 101.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.136 90.889 333.963 101.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 76.49 156.281 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2b9db6ddc26573299d412b80ee0dc018) >>
->> endobj
-7698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 76.49 237.924 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.136 76.49 333.963 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7702 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7706 0 obj <<
-/D [7704 0 R /XYZ 89 770.89 null]
->> endobj
-7707 0 obj <<
-/D [7704 0 R /XYZ 90 712.265 null]
->> endobj
-7708 0 obj <<
-/D [7704 0 R /XYZ 90 670.517 null]
->> endobj
-7709 0 obj <<
-/D [7704 0 R /XYZ 90 639.727 null]
->> endobj
-7710 0 obj <<
-/D [7704 0 R /XYZ 90 608.938 null]
->> endobj
-7711 0 obj <<
-/D [7704 0 R /XYZ 90 578.148 null]
->> endobj
-7712 0 obj <<
-/D [7704 0 R /XYZ 90 547.359 null]
->> endobj
-7713 0 obj <<
-/D [7704 0 R /XYZ 90 516.569 null]
->> endobj
-7714 0 obj <<
-/D [7704 0 R /XYZ 90 474.821 null]
->> endobj
-7715 0 obj <<
-/D [7704 0 R /XYZ 90 444.031 null]
->> endobj
-7716 0 obj <<
-/D [7704 0 R /XYZ 90 413.242 null]
->> endobj
-7717 0 obj <<
-/D [7704 0 R /XYZ 90 338.286 null]
->> endobj
-7718 0 obj <<
-/D [7704 0 R /XYZ 90 338.286 null]
->> endobj
-7719 0 obj <<
-/D [7704 0 R /XYZ 90 305.847 null]
->> endobj
-7720 0 obj <<
-/D [7704 0 R /XYZ 90 276.129 null]
->> endobj
-7721 0 obj <<
-/D [7704 0 R /XYZ 90 245.34 null]
->> endobj
-7722 0 obj <<
-/D [7704 0 R /XYZ 90 169.398 null]
->> endobj
-7703 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F68 3032 0 R /F110 1507 0 R /F67 3037 0 R /F90 758 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7730 0 obj <<
-/Length 2064      
-/Filter /FlateDecode
->>
-stream
-x��YY��6~ׯ�SB�Z
<'٭J�$�k3�'���Dh�	�1Iţ���F�)Q�3�v�U&���ht_��{7
��^|~���*V^��HF���K�)
#��y�|��R˕��WK�}ݔ���Rr�.��&k���u�����u�v�Ϋ���}ۙr��!��(t�R�ٚf)�T�b%�|�����.��^�]P�{�	Y�x�r��5�2���u��{g'�^ |
���wg�L��ď;!Ț�P&��L�#>7��
���2�_��ﺼ����_Ec��[ɀ� %���Qۑ�-}7��Z�q��Y$���y����ofӹ���ݭ��ƚ��AK57�d/�^x��Ӌ��&�-����
�9���$~�
�ʹ_W�.o͑�t���
m"X�d��Y���J����֠�(W������c��q�j��i��;�
��Y^���Kw�tc\c�ե��.�=���o;��ф��ow�;7^�E�\X�%�
A
VG�3�~D�@#3�r.+�/���"]��K�pu�F�lb�i�
� [...]
-�2�\��⎽\E A���s�O|�{N
���=���37z�+3�
-ʰT�$�K�3�=q�,C���
N"9���\�^p�
�u��
��<vy���(��;�ƴwu�
��z*��n����
Vr���'�7��/���n)f"
=�"�U��I��b�0i�N���%�H��z�8�3 ���i'
B+7-#D׸'7����{�U��|�֨Ǭ���}���92�*a*B�;��g��
+[��\��Da��i�w�XJE���h����]��Ұ#�
H�~�i��h&��BB�v��Ʃ�7ى&cpw�؊h�z+j՚c(wĄ(t��y�5W2��%��[�p4�'0��E�y�O�a�g�&M�qO�$�>{
-4٤�5R�e�h�O�&鲲�-a+ l
���;dE%}���&\ЛW0�Ȼ�R�X�Q��p���p`�.h[�:LV�
��$�w--�$�]��+ZԘ��YdH��L��dg`}�MO�ۦ.�=k���
��
Cm}��@lV�����qi*�S�DO����s���P$���I�V����CD,#x4=����q��D,S��9">�����H����
�ܻ���'x-|�r��ٶ3 ^J��3N	�>���w&v�sb��9i�d�$�����>%�f�
-jH�����QW�1N4=V���?��҉J���b0������i����`S�a��J���)jXR�4ֆ�!f|�A*$S���y7�2�.�cD�D�h�u��b���]��.L5�~�X��;!C1���]n_���X?B��c//�%c������q0L�S7�M^i���#L�_�=�ܺ

m����� �5�n2�&�{FG$��$
�|KK�*aȉ&��X���6��]�ot綴�m�������
���%��Ca4����|D7��,��k��ܠ�6��
��	/X�—t�/¹��@`|4��&���
�ޫN�Ŧ
��nC��j)[K<���0���!�
���c:I�
-�i�OD�)��b�ZU���h��R�
-��*H.!sL>�
-���x�UL��ğTMg�����(�HE�Tⴇu ��c�H r�s:`����\�w.%�T���ǞYz>���� I����p5����\kg�	H4�0�t��$��A?�U^a
�~�����N!��c�;.���K7C��0$e����X��i4}b�q_J�c
��dp���e���3�
�eRe������4�,�︗9*1BF�b���[��M�>(ij��9�{�R=�o���B	XB������ɑq�����ϐ�|�W����v�Y
-�߽��|�ln��n8�K�_)��׷�����
-Y/�ۮ����X�n��7
���!G�Hmz��n��qYjk�Y��b=f�v
9�L${K�1߂O
-ں���`��u\|S*�y
>�Y�?�̮�
-endstream
-endobj
-7729 0 obj <<
-/Type /Page
-/Contents 7730 0 R
-/Resources 7728 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7668 0 R
-/Annots [ 7700 0 R 7701 0 R 7725 0 R 7726 0 R 7727 0 R ]
->> endobj
-7700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.363 665.984 257.19 676.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 654.028 132.51 664.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 529.329 188.212 536.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) >>
->> endobj
-7726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 315.521 188.212 323.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) >>
->> endobj
-7727 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7731 0 obj <<
-/D [7729 0 R /XYZ 89 770.89 null]
->> endobj
-7732 0 obj <<
-/D [7729 0 R /XYZ 90 721.073 null]
->> endobj
-7733 0 obj <<
-/D [7729 0 R /XYZ 90 194.575 null]
->> endobj
-7669 0 obj <<
-/D [7729 0 R /XYZ 90 172.199 null]
->> endobj
-7734 0 obj <<
-/D [7729 0 R /XYZ 90 172.199 null]
->> endobj
-7728 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F32 764 0 R /F7 795 0 R /F8 794 0 R /F93 763 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7758 0 obj <<
-/Length 1731      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�u@'�1�wQA7�k��]_�&�>$E��L"L�]I^���HI��8I�t�P�(��;�=��Ha����o�_���BJ*��s/�^�C$$�M��r5�p��cR!J�Uv?������#������Ӏ�O�#V�@�������M����
�wU�z�2x&���v�`D�i���
d�-#b-  �!6
����:������Nl�N�B���E:.�Yj��g��T�ETv�U��]#*����8/&{{���t4Ɂ��G���:��Yfd�
���JSsU���S;��Z��~7�
<
	�z�9��l"����N�
-A�Ր�,�
;�ʑ����fT�i��h�z�#WqP
T3z�SH
-Rk����![Y>q���A#�Q�{#�E(
`O2����
�U�#�f0����r�E1_�U���	�2 $@ԕ����B�=V�aZ����j���@|�#G!!D�I��$N����\�z:/�Ci�
1
��K�]Źޱ�_Y�˶E~G1���6�O�B�׶�|+m\��)з�� ��慙p���Q��F�:�ӛ͆T�WnX���ȇ���(s =g�2�#2�`�h����i�@���������������A��hn��L^O����nYƐim�2"�j��
��~&�;�7��E.{D at z(qCf�a
o���(
�
T����@}�@u��
�C�%�@�MZ�r�u4\6�˒�5N��5����{�Щ�2���f�j���%��8��]��D﵌��D�)08�9��R*ڣNFp4�'���:ްlF˵WR� oP�
"
"�l��UDH���
-a�䛪+��
-�����V� #�4�80mi��Q��,X^�I�c�P�l�
-m	Ef˄��YA�����k`�n� <!�b	�
)ؑZ�4��Q��s�mG�)Bh[o]�u��O��6����j[���ܥWYB�_g:
�iM�k��Њ}�RxE�)��D ��?�z"�ȭ��s��MU�z�S����d1�=U�`(hʚ�}�	��O5�I�
E����˅Q N(d�
�˶��5����o��Lg�J�����^� '��Qv���f����c��u�:lg�R�j;��v�I^f9E���B�Xt_�G��X��blt`
�c�8���69�+�
�я�_��값
Y�O�4ʖ�+��{;U�ک��s�#ASĜb�{�z�_��*f�Ѓ��dl�l_?�[Ǜ1V
I��p�,���Tt���0�Ōw>���� ���	������mZ��)�u���q6�
6Z҅x�
��=ͮ}o����{Nj�(����u�ޝu�(�G}۷D����}��
-�9
�� � h��e:�m��.1�U`� ��o���<�j���vh�f�l�]i��m�v8�a]x���{9n�@K^<��n`��-o���G;������u��Ҽb
�2�aD�X�n˄#�$+���p���Y��
-��1�je6�j��*��‘Ī�����0�{8q��{��*Ɯ�j^�,֜��\<����"�D���mC�������@�_�AEh�/��\��~�\�.a���� #L�����v�c5�u쾜2o�q#�7j�W7��E�P#+�����׶�g����w+w'�&JQ2�1�.^��~��rK6ߋ��tu�c���6��Ay_� �̥�
�eQ��vw��N/�x6]O�fr"�|��x����:��=�Z���m3
-endstream
-endobj
-7757 0 obj <<
-/Type /Page
-/Contents 7758 0 R
-/Resources 7756 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7668 0 R
-/Annots [ 7735 0 R 7736 0 R 7737 0 R 7738 0 R 7739 0 R 7740 0 R 7741 0 R 7742 0 R 7743 0 R 7744 0 R 7745 0 R 7746 0 R 7747 0 R 7748 0 R 7749 0 R 7750 0 R 7751 0 R 7752 0 R 7753 0 R 7755 0 R ]
->> endobj
-7735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 380.99 251.503 391.893]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aa1ff4528466150c5a3ce8d110c0c92e1) >>
->> endobj
-7736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 349.008 251.503 359.912]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a8ab042e81927db600ee725d3c983b252) >>
->> endobj
-7737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.84 349.008 416.432 359.912]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 317.026 259.251 327.93]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a4948dd7324bd5d7a28e142a66ba5f875) >>
->> endobj
-7739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 285.044 251.503 295.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.242 285.044 303.049 295.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_acefade434fe64088a872391d152455c1) >>
->> endobj
-7741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.386 285.044 467.978 295.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 253.063 180.938 263.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.678 253.063 231.847 263.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aaa37fb590232bdc2474283e83bc019cf) >>
->> endobj
-7744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 221.081 180.938 231.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-7745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.908 221.081 234.963 231.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a168ed0cbd2cf59717febf52a6d6e107a) >>
->> endobj
-7746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 189.099 251.503 200.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.242 189.099 308.668 200.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a40dee04f6adce4b8c60a569662f37f96) >>
->> endobj
-7748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 157.117 251.503 168.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.001 157.117 298.426 168.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aeeafd2e88e461b1f480c37995d105714) >>
->> endobj
-7750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 125.136 180.54 136.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a6d8bd16c6f8ccff0228956f76a9b7464) >>
->> endobj
-7751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 125.136 345.469 136.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 93.154 178.239 104.058]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a177ecd1fb2bec07a416a3369f22d068d) >>
->> endobj
-7753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 93.154 343.168 104.058]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
->> endobj
-7755 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7759 0 obj <<
-/D [7757 0 R /XYZ 89 770.89 null]
->> endobj
-7760 0 obj <<
-/D [7757 0 R /XYZ 90 721.073 null]
->> endobj
-7723 0 obj <<
-/D [7757 0 R /XYZ 90 703.282 null]
->> endobj
-7761 0 obj <<
-/D [7757 0 R /XYZ 90 703.282 null]
->> endobj
-7724 0 obj <<
-/D [7757 0 R /XYZ 108.69 622.199 null]
->> endobj
-7762 0 obj <<
-/D [7757 0 R /XYZ 90 616.277 null]
->> endobj
-7763 0 obj <<
-/D [7757 0 R /XYZ 90 593.512 null]
->> endobj
-1789 0 obj <<
-/D [7757 0 R /XYZ 90 516.069 null]
->> endobj
-270 0 obj <<
-/D [7757 0 R /XYZ 90 506.915 null]
->> endobj
-7764 0 obj <<
-/D [7757 0 R /XYZ 90 402.026 null]
->> endobj
-7765 0 obj <<
-/D [7757 0 R /XYZ 90 402.026 null]
->> endobj
-7766 0 obj <<
-/D [7757 0 R /XYZ 90 368.311 null]
->> endobj
-7767 0 obj <<
-/D [7757 0 R /XYZ 90 336.329 null]
->> endobj
-7768 0 obj <<
-/D [7757 0 R /XYZ 90 306.073 null]
->> endobj
-7769 0 obj <<
-/D [7757 0 R /XYZ 90 272.365 null]
->> endobj
-7770 0 obj <<
-/D [7757 0 R /XYZ 90 240.384 null]
->> endobj
-7771 0 obj <<
-/D [7757 0 R /XYZ 90 210.128 null]
->> endobj
-7772 0 obj <<
-/D [7757 0 R /XYZ 90 176.42 null]
->> endobj
-7773 0 obj <<
-/D [7757 0 R /XYZ 90 144.439 null]
->> endobj
-7774 0 obj <<
-/D [7757 0 R /XYZ 90 112.457 null]
->> endobj
-7756 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F110 1507 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7784 0 obj <<
-/Length 1990      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�4~�_a��bӮ��eK�0�2\:���2�V����ޖ�{�.��^�f�a��ֶV:��\��I�޽����\/�^�̓HF4��<��8��G�yo}����`��ˀ`?����e@�_+������m�����Ve��I^��͕ʶi�We����g�(����
0��xi��� ���n�y,)�����ts�zTڷE�4V�u ��֛"i�
�Rw���U�� fا��"�]/�\h5�#�O
��K׋��a/��=��3i텔����,~Y`�r���W�p Y� �`���CD\.T����T*�I�|�9�Wq�*J�ޒ����J����[U'mUۯ* ���Sn$���i��M���tg�5k$F
��`�ph����豼��m�w���J?����
y���J�eU�3IS�4�5���t5�eL��U�U���tB��t�{˫��[��.�o��}�j�I���n���]�-��w�%FRF�
-��껿H?52H"P�%,��`^�\��UEQ����R�~��:T���V<X;��wӲ�ٯ޸���;�Â�!
-I���fe�7c
馜��ƒ�)�z���"$c&�S��	�F i�����vA	��Y`���>����
-
��s
��V"b`�����H
�Y+� �gl����8?�֋����Jt���煩>h
-.�M�Ufӥ0���P�'�
�����y�g
rDp4RQm[;��ˑQ���s�����pޯ3OPY|1�!ˈ�8��R�=M��J�kEn���@�ei��7�A�ӽ�ǽ*��
��u��$�LA�R(�8U=H�Q�4��Qʧq�:�6Z�\�ᄭj��Ie�w>ۊihZ�~g�����
c�"I��'��������
$�&�ZV��
����B|K �m�X �4&Px����L��#X
-�:�-a8�|S��2
�2�9�W�P/t�s&.��K2":
�=��* �h�t������ ��ķl��,]�K`Q��c����

:B.�
2�6��s�7���VT�>4�kծ�l����!ɼ�+��C�5���~��W���eZl35C%���r��eŀI=���rp�8P�PC�������r{�~����V�[����ն4
kN"
F1D�<�Q�����G�>�7����
0I2O�I��@YS��¡w;*t��m��(�  5�h��b�
G����g���KW������v/���Y68���1��������-��㢩6���)}_:�*��pFޭj?(UN*�T����2 [8��U�3<�t�����$%�	�.��ɹ,<Z�L��7*dӺ��)n�dz�k�C�
�@#�l��
���a��d��5&��e2<w�F� �{�耢T'�� �����y|��ўM�r�gn$�H�����i �Oac	8��,8����0�'0$��h�c�4��rwi2�G�֘��h�
-��+�
� ���
cH,����)�,� 4�b�I37c�j�oI��hw�!�݅�Yۤl�B�Di��\P���]ê�x������	�i����`·Z�󡞑dY3�>��x�R���
��]�Zo�R�#wv��&�+x�'�N \<���a�
gri::@���N~��G�8��"
Cb1��R��ZH���G?
�c�iM
d0>�A�{
��	MoL%�M�D
��uG"�

P7ʞ�o�	և]���!��<�81�ܝ��7��*i��;3���Ą�c:��$��CG�
̈́:$���br@�<�����\���]��_�bw��G��c����iKݗ�$�{�j�C�Yh�"�b����>�=���;6;�ӏ(�;�N��v�c� ��\N�yy��}��Q�g羳�uRn�"詪��oz@��.F:ӱ�Fu
���׽�d�Ew������j��������Q�=�ݏ�`�T2�]c�.Z�nCy	�k�����Ώ
�+�y��'`*&qL͌���[��~X3���l�7��f
-endstream
-endobj
-7783 0 obj <<
-/Type /Page
-/Contents 7784 0 R
-/Resources 7782 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7668 0 R
-/Annots [ 7754 0 R 7775 0 R 7776 0 R 7777 0 R 7778 0 R 7781 0 R ]
->> endobj
-7754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.169 665.79 513.996 676.694]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 363.146 207.229 373.676]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction_a87f25b7a2988f918a20b3d09047b08ab) >>
->> endobj
-7776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 334.016 197.875 344.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction_a383574ff4028da9048235b061a613b99) >>
->> endobj
-7777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 305.633 214.978 316.164]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction_a898fefd81641cf4f6b854e85412a415c) >>
->> endobj
-7778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.613 190.012 397.034 200.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-7781 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7785 0 obj <<
-/D [7783 0 R /XYZ 89 770.89 null]
->> endobj
-7786 0 obj <<
-/D [7783 0 R /XYZ 90 721.073 null]
->> endobj
-1790 0 obj <<
-/D [7783 0 R /XYZ 90 503.091 null]
->> endobj
-274 0 obj <<
-/D [7783 0 R /XYZ 90 495.952 null]
->> endobj
-7787 0 obj <<
-/D [7783 0 R /XYZ 90 382.196 null]
->> endobj
-7788 0 obj <<
-/D [7783 0 R /XYZ 90 382.196 null]
->> endobj
-7789 0 obj <<
-/D [7783 0 R /XYZ 90 322.95 null]
->> endobj
-7790 0 obj <<
-/D [7783 0 R /XYZ 90 277.392 null]
->> endobj
-7791 0 obj <<
-/D [7783 0 R /XYZ 90 226.317 null]
->> endobj
-7792 0 obj <<
-/D [7783 0 R /XYZ 90 163.515 null]
->> endobj
-7793 0 obj <<
-/D [7783 0 R /XYZ 90 140.944 null]
->> endobj
-7794 0 obj <<
-/D [7783 0 R /XYZ 90 140.944 null]
->> endobj
-7782 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F22 2996 0 R /F93 763 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7822 0 obj <<
-/Length 2353      
-/Filter /FlateDecode
->>
-stream
-x��Zێ��}�W�P���w��$���6v��:�	�`�li�I��<�|}�/�I�e<2֋�I�fw���T�)R�[x�{1��j��y��E�J�j�E�
x�����{�S���~��
�$�2�O}u���ե�7yv5�8!p
{�
-(�$��}����0bQ�ݚE��)�ߥw9���u�xKB!��W7j:�2�����*՗���E���X���]�V�
��
ƴȊ��^[���9찓j�r��,`
�Ӏ
-�d�
:%v�@I‘��Y��Vd��V=xd9"�KD¨L�	f͒�H'�V��5D�
13Κ1
-�"ܛ��"!���H�vF�q�H��F��1E��
���0
� G!9bZ��[��3����v%���+>�k��
6��G*��j��Ӱ)���������R�#v��`��d�J$E!��Vբ
,(㥾�yY���P
-PI[DOڇ����^����\�ݨ�*��F��M�O�����7ʎ�	���v�{
d
�P)�Mpj�G/�T��2�w0��4���~
r�um/b7����~خ��90z�찳^�܋�v���$v� nMi���NCs鎧ρ��\�͜\������R=��8���Sjp>98�.
E��y�'�9	8�A��~�¥�7/&�[��E��n�Mtn��%�ut��
CR���
����z��R�;��UM�71�,��]wh3P7�2[���͹*�BG@�s1[R��u�؟We>b�Q��c	��6K�����X�\��~�X���!��NI�}g�n�����Ψ���h�ũ@$Z#���B�Uq�֪���C�ۿ�'�޵7��m
- )F���
@�]��e%��<���T�8a��Dl�q]t�'a��a߫�m�k�x�CȀ�#
����yU���	\_��.�~X[A��<@�����a���˹%��H +
ϊE���%���@5F�2P�x�|m�zW��4:#^>[�h�"�0�^�b
�l���uV:;�
M���z�,��
o����X�BU�zP1�V�[.�)��mx`JMM�U
��Y���tJ��Tls��%��qn�)8�k�U
+�1$n�B�cr:#$��ǻM#�ax��&yn��U=�ĈC�ղ$�M�c�/����3��!��Q��XBK4P�캊�١��Ʌ.��2�;mՇ�' �H����.�:&�e�4K^_>�} cm����ھ�a��)�?�Z�hfި�(_��D
����
 [ܰ�.�D�m�V������;�d�Z�OIz}���
�s'+[��Q�N�ϯ��E{��gr�DzU-ݵ{0׵{�Yb���� ln�3QNU��_�ݥVdV��)I2$�o�Q�~+-��⏺�	 ��X�SV$�M� ��G�
-�p
OYP,�����-9L@�8
��Q ,����@5�`�\��Yba�R��0~�)�
�ҭwV�L�(��l�l��I�e��g��/Ts��	C�_�P�$��9�^餹ރ��$e�
��B&x���
-�w���
�C�Pr�o ��F��c7��?O�ה����
�٢��7����U�W�zUi[At{>�2-)p��}� !��ii�.j`��M�n*� �� �ED��#�w��|m_��M۲
%��s�������F
@p���M�w�k��O�\���~7.��.c���p�bԣ@�٩
�CG���zDʣ��yru����*@%ɱ��Ⱥ�a������;��;T�,z�5��S>4F�z�Z`O��1�pD�EvAߖ}Щ+�߱����Y�e�f�-�_��g�G�SJ:;��|�R�����
�m4��p]n����lQ|���hW�i�B(��b!P�f��%�΄���l,wP��
_I7�r�I�%���*�=Юiy�.���#r�@2j��݈�4��ɐ�	N���{�,Wj�
]G�t Q�e���C�"G ��(bF�H��nU��n]����
ZG���f�l׊#z�:br�,f�y�a.8�(�H�sB`� >4F�n?�N�aV��o��
-��W���sVn�^6��{#^�L�I��p��ދ�æ��x�
���TŰI�9g��~�:��i
-��g�}�9CS2�[��B[�
-߬�7ك��U�Sy3	ΩD���
�ϖ+�M������#��G��=�����g���j�Yj��d{���}y��
H"�Q�w�E��N�#eo#�����	F�57�cs���&
��3�a��țu�ϝ��q��[3���>�`�����<¯�ξ���5���A����2J���o��K� ���[���'�SF�q$���7������כE��J�|7`��Q�pк��:���j���s���;���5L�
-endstream
-endobj
-7821 0 obj <<
-/Type /Page
-/Contents 7822 0 R
-/Resources 7820 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7668 0 R
-/Annots [ 7779 0 R 7780 0 R 7795 0 R 7796 0 R 7797 0 R 7798 0 R 7799 0 R 7800 0 R 7801 0 R 7802 0 R 7803 0 R 7804 0 R 7805 0 R 7806 0 R 7807 0 R 7808 0 R 7809 0 R 7810 0 R 7811 0 R 7812 0 R 7813 0 R 7814 0 R 7815 0 R 7816 0 R 7817 0 R 7818 0 R 7819 0 R ]
->> endobj
-7779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.512 660.136 179.766 671.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-7780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.977 660.136 329.907 671.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-7795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 475.149 123.644 486.053]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-7796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 384.086 176.332 394.99]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a086c7f397ab21146fde044139d607227) >>
->> endobj
-7797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 360.909 176.332 371.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ad353ea3809ab22bb775fc17e65b6ab94) >>
->> endobj
-7798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.669 360.909 281.496 371.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-7799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 337.731 176.332 348.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_afa57568993488dd0803021cbaa06f3fa) >>
->> endobj
-7800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.669 337.731 288.122 348.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-7801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 314.554 176.332 325.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a5fc66875bf8b6a2838028fc66ce3f2be) >>
->> endobj
-7802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.669 314.554 254.906 325.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 291.75 184.081 302.281]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a92fe35a10fee9c27d0958a9d4a3b5bf4) >>
->> endobj
-7804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 236.416 229.552 247.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ae04186768b7847971b787e23badc4682) >>
->> endobj
-7805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 236.416 308.127 247.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 213.238 196.347 224.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ad97c1aed499bc56468b3ab250b235b38) >>
->> endobj
-7807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.684 213.238 274.921 224.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 190.061 220.038 200.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a079249fd8d7a54f2b876c1cecd42ab77) >>
->> endobj
-7809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.375 190.061 298.612 200.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 166.884 224.003 177.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ad35fd6a6bd2b3ddf76f6a85e33ada2cd) >>
->> endobj
-7811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 166.884 302.577 177.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 154.622 272.49 164.527]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-7813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.08 143.706 194.623 154.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a775560d42dce1a47cd1cdedafb46d0fc) >>
->> endobj
-7814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 110.251 176.332 121.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.071 110.251 227.878 121.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a0aec62be016edf40df1aeab68610290d) >>
->> endobj
-7816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.215 110.251 306.452 121.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 87.074 180.198 97.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ad4366a1eb42053ac30ef197d59f92707) >>
->> endobj
-7818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 87.074 235.251 97.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7819 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7823 0 obj <<
-/D [7821 0 R /XYZ 89 770.89 null]
->> endobj
-7824 0 obj <<
-/D [7821 0 R /XYZ 90 632.291 null]
->> endobj
-1791 0 obj <<
-/D [7821 0 R /XYZ 90 540.779 null]
->> endobj
-278 0 obj <<
-/D [7821 0 R /XYZ 90 532.067 null]
->> endobj
-7825 0 obj <<
-/D [7821 0 R /XYZ 90 422.272 null]
->> endobj
-7826 0 obj <<
-/D [7821 0 R /XYZ 90 400.386 null]
->> endobj
-7827 0 obj <<
-/D [7821 0 R /XYZ 90 375.494 null]
->> endobj
-7828 0 obj <<
-/D [7821 0 R /XYZ 90 352.317 null]
->> endobj
-7829 0 obj <<
-/D [7821 0 R /XYZ 90 329.14 null]
->> endobj
-7830 0 obj <<
-/D [7821 0 R /XYZ 90 305.962 null]
->> endobj
-7831 0 obj <<
-/D [7821 0 R /XYZ 90 250.813 null]
->> endobj
-7832 0 obj <<
-/D [7821 0 R /XYZ 90 227.824 null]
->> endobj
-7833 0 obj <<
-/D [7821 0 R /XYZ 90 204.647 null]
->> endobj
-7834 0 obj <<
-/D [7821 0 R /XYZ 90 181.469 null]
->> endobj
-7835 0 obj <<
-/D [7821 0 R /XYZ 90 158.292 null]
->> endobj
-7836 0 obj <<
-/D [7821 0 R /XYZ 90 135.115 null]
->> endobj
-7837 0 obj <<
-/D [7821 0 R /XYZ 90 124.888 null]
->> endobj
-7838 0 obj <<
-/D [7821 0 R /XYZ 90 101.66 null]
->> endobj
-7820 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F93 763 0 R /F22 2996 0 R /F11 613 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7879 0 obj <<
-/Length 1682      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~���^:�^DJ
-�=�m���5���l3�PKr$:���w(��e+�[8.�%f$��\�s#��K;v�8�
���	Q(�p�/�;�".࿑��%1����{�%؍�$�v)v���J���.
�Q>;>~%�̓8���~=stB�i��� .)?��4V�ըg'���>o#�#�v���Pa���r
E�G9vϻ!ue2k�'��̻$pe:�G
��K9�D;��;�
d�C*�p��0�|���<~�v���-'%�G������
lT
�p=�?F�@��pB�Xr�Ij�F�

ܓi:Tq�%?��щX$�
��*_0�2+����
��<�r3H3�2�� �P�/�H����c,�#��֣������D� OԶPV����F�yڬ+�hP����l"�(1�̡Ҡ�⾷���z���
� 会xS�;
����K��O�����m�����w��~�.�ɂ�@9(��j�>���/�Z��SB�����^�-��{o�s2�f+��32�c(�W��zA���}f���6��
�0�t�z��jJ�
 �R;�6VWmd̪��Z�p�X�=Z��=<
>�����3�l�
��D���/�s�!D3�T�!J��a
^Y�;QB��`��e{�d����QM��AF����T�xe����
��Q5������5< ԶA@�m�
b Y4�zB�w�����
���^~�WO��B
�!M��f�ũ*�ZF�B
Ső�G�_�G0
-Jn�(⇛�v"�ey��y�?D���0=�n}��TmI�C(�
5:>�
-��(��?�.�� ?�`5�?_�`(
à֕H-����u�„����j�2> ^��?N�djP��_�Y�����	�>ݲZ<
 b��`�����
JY�R0ޡs;tn��s(3p}�
��C���d��O
ɇ����8UZ:R�Q?� j)ϔ���O�\���
��UV�~�̃��3;M�YI����X&��l�ԛ���#�-
W<

���1s�oS��.�>Ж�[�`k���X�<�z�Ez����zh���;m�������I�^��3V\�U6ُ����"�{7Z�`�Z�c H־���b#��%�N��F7�<��箱�y�=h��j|h�J'�v�A��)
64��A�T�
�#|@u�fM`T<^��#F�
��ᮢ�H��h+9��A�(
P���&�
�֎���W��"��́3	<D�������4�R�+T�Fc
-��R?Rq�`l��7��7 �{|Cnk��b"�,����?�׭�毪�ME��6N������K�qvk/f
��E�J9YrkN�AN���|X�n�M��J@�r8�Nb[�f-x�:
��pߑ��V;`Bώ ���
���ǭ�Di���K�g=8A��m@�o�%0�SJvU�~|��6|y%�z��[Q��ʜ���P
vo�<��	�W4"g����S�v� 
-�-�6i�**�i���J�1xĭ���PI��r�.�-_���m{���>+A$ ��H{n�zz���S���.����(��P�9��^.�"Ό�Tr��u�{&m�������[}u�7����
�WJM�����B��h��K-�"��!�"3��Y�
&�޶A�z��#�	A�&@��
}h�����8._�̓����@��{������
-endstream
-endobj
-7878 0 obj <<
-/Type /Page
-/Contents 7879 0 R
-/Resources 7877 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7893 0 R
-/Annots [ 7839 0 R 7840 0 R 7841 0 R 7842 0 R 7843 0 R 7844 0 R 7845 0 R 7846 0 R 7847 0 R 7848 0 R 7849 0 R 7850 0 R 7851 0 R 7852 0 R 7853 0 R 7854 0 R 7855 0 R 7856 0 R 7857 0 R 7858 0 R 7859 0 R 7860 0 R 7861 0 R 7862 0 R 7863 0 R 7864 0 R 7865 0 R 7866 0 R 7867 0 R 7868 0 R 7869 0 R 7870 0 R 7871 0 R 7872 0 R 7873 0 R 7876 0 R ]
->> endobj
-7839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 643.468 156.281 654.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_aced7c94ba2c14044e98327ac0bd11dd6) >>
->> endobj
-7840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 643.468 211.334 654.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.277 643.468 324.514 654.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 600.046 180.54 610.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_af01a65d9370eabfc5e47d8b613b37b0a) >>
->> endobj
-7843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 600.046 259.114 610.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.579 600.046 395.816 610.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 556.623 178.239 567.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a062f93b32c2103c74d7a91cfa027a82a) >>
->> endobj
-7846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 556.623 256.813 567.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.277 556.623 393.515 567.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 513.2 226.034 524.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a5c44d3d0955540b98975a14f5b97e942) >>
->> endobj
-7849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.301 513.2 368.538 524.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 469.777 226.034 480.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_abbd1a3e57c1f33d638b4ae3aa852416f) >>
->> endobj
-7851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 469.777 372.413 480.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 443.085 180.54 453.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_af01a65d9370eabfc5e47d8b613b37b0a) >>
->> endobj
-7853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 443.085 259.114 453.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.579 443.085 395.816 453.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 416.392 178.239 427.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a062f93b32c2103c74d7a91cfa027a82a) >>
->> endobj
-7856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 416.392 256.813 427.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.277 416.392 393.515 427.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 389.699 156.281 400.603]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_aced7c94ba2c14044e98327ac0bd11dd6) >>
->> endobj
-7859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 389.699 211.334 400.603]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.277 389.699 324.514 400.603]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.417 328.231 206.96 339.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a6c75bb083e814ae12c8df6a2cd63fda6) >>
->> endobj
-7862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 296.763 160.465 307.667]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a2cca0fbafd235d3e82edcbc0f3c41d3c) >>
->> endobj
-7863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 265.669 175.967 276.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ae8fb80899b7c136573ec8f42beb8a207) >>
->> endobj
-7864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 233.828 204.739 244.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a97bcf298710d2a89ee8c29d457fc925b) >>
->> endobj
-7865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.076 233.828 283.313 244.732]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 202.36 244.091 213.264]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a46f440596ccf2c1f53a4d312af97cc0c) >>
->> endobj
-7867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.428 202.36 322.665 213.264]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
->> endobj
-7868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 170.893 191.718 181.797]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-7869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 170.893 288.852 181.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_af537493853b0d1460f9d868c122ae4c1) >>
->> endobj
-7870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 139.425 191.718 150.329]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-7871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 139.425 303.079 150.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a773a5ffce9cb4be2b75dfb92177d9ec5) >>
->> endobj
-7872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 108.331 150.493 118.862]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ab922f32fb84e011b67fee7ac6b69d509) >>
->> endobj
-7873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 76.49 264.424 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a452974abf6ea3b81ac94e4c004bac876) >>
->> endobj
-7876 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7880 0 obj <<
-/D [7878 0 R /XYZ 89 770.89 null]
->> endobj
-7881 0 obj <<
-/D [7878 0 R /XYZ 90 703.482 null]
->> endobj
-7882 0 obj <<
-/D [7878 0 R /XYZ 90 631.047 null]
->> endobj
-7883 0 obj <<
-/D [7878 0 R /XYZ 90 587.624 null]
->> endobj
-7884 0 obj <<
-/D [7878 0 R /XYZ 90 347.013 null]
->> endobj
-7885 0 obj <<
-/D [7878 0 R /XYZ 90 347.013 null]
->> endobj
-7886 0 obj <<
-/D [7878 0 R /XYZ 90 315.809 null]
->> endobj
-7887 0 obj <<
-/D [7878 0 R /XYZ 90 284.342 null]
->> endobj
-7888 0 obj <<
-/D [7878 0 R /XYZ 90 252.874 null]
->> endobj
-7889 0 obj <<
-/D [7878 0 R /XYZ 90 221.406 null]
->> endobj
-7890 0 obj <<
-/D [7878 0 R /XYZ 90 189.939 null]
->> endobj
-7891 0 obj <<
-/D [7878 0 R /XYZ 90 158.471 null]
->> endobj
-7892 0 obj <<
-/D [7878 0 R /XYZ 90 127.003 null]
->> endobj
-7877 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-7903 0 obj <<
-/Length 2287      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�~ϯpQ���5û�`������%g���bӱ[r%y��_��E7[��]h�>I���p��f����n�Gߝ|}urz
�Q�BI��j1
-�(�!���1trs�ÈI�H(��m�旟���|uiޝ��:����+<"N�@���'�7x4��F�P�
�G��
�����O��#*̭�x�@V[3B!N%"�)����E��|2�T�S>��M��U�{h�R�i�$z�YE�6]N�a�zlƐY9��v��O�Dk��|w�!S��.ozdV�&D�WQ�{���Q���=@�BS#�`�?P���ľͩ %i`E1ʝ&F��jB��i��Y�
-!�q���rĔl��c|�E�d��Ogg�{����u
-#3p
 	��
gQ�$!-gU�:=�MqSF✷���&��Cm6:s���H<���ѵl�8)r]��
2�d�q��x
'w��b��^V\,�]�g�$2�iqQav�0��3K��Ȍ��tm�S$p�Zs"�""*+B�-&�����F��o�Ř&�� 2.h`��y|��M�`��H

-�$_
݅�e_hF6_I�$��^-a*���[��IY�C�os������ҍQ�i�&Ӈ,.&d컧(���mg�
�j������
f��g��۸�nW������t;3�r/jߛqu5��l��}������5c�5
 y �< I��$�U0��y�x�TP�2���ݴЫU�@ܨ��>g^[�z����^,���E��Ni�Փ�$��x���=�����~�u���x�C�)�q
<d!D�Lԧ����ֲ|z�Mf?6���m
�g$ْ_%���,�CIEu$I{�
-`'CI�((*��i��ުH���UL�L�\�d

�߅��\>�I �<�:�L
F�(��P.>;[Bh��Pү�
%8A�~B�"`t�
��6I�"�?�Ѫ#;b�L�cS,�\��AG�:q��+x2
	5w�{[4A�U����U���� �*S��đൠܰgv3�,)�*�e����.�Y�wȇ:��
-�juG̢h_Ŭx�cN2w7iRF��U��sw7Oא
��2򍑻8�N�I��U�f,m����+* #1~N�@5%���!�<�u2�u���׸�	+���.������؅�:�p
�>�8��Nhn�чhc����~\��X�J�p�
����
�\>R_�2�f
�(��x|��	���5�)�%a;`�L��*b?u�
-�.�:��Bk�^g� ��'�H�?�6�m���
Wv~�>�@lK�)����
�A%�9aD2���DJ>ӗ�s
�9
��
\Uy1?;K�����	��]���?,1��x݉f`�hb��|o8�
M"B�N�
�
Ǭ�]tt�0����"��J��/]��`s�x�@X���q��GX�aӯ���m�R&�F9{Q��!�~�����
;�P�QV�� �I��r.;��B���Z�.�XM���~�0r|�?��#`~(
=~Jb�9�p��C�
s��0C0�PqV��u��W����ܳ�&��
-a9���j�Z�~�(��� ��p�Bk� :���afI(���y���'h�G�({�{�!�R�GQ��3K^҇�~�T�Tπ�A�����
�g�Ǡ��=	��}?�h�2��?�B;	H��;��
�G�	���{��6
��l�ɝ赶����-��
-��N'&�k�+���u�U��V���7>T���0h���,DB�4[�
-*�6�T�
�@ͅǛ�
--�}k,��c���	b��C@��?p M�D
-�J�"·��!#ۼ���n�A$��`|�8R\<�ò�8*P��R�Uh�@Nj�$�L'3��
���08�2
�k+s�J� ���9 ���
ͥ


�0'��c���
������
7��s��}zNi���H��_6��"��jY}~�?.�M	ǘ	;��ޜ�}�'�
�E<+�〇�`E�cƫ	o���&��<Ĝ����o�B0@#%��t��E�؞̹AS�0E��
a}���ǿ�B�7��3v�e��Sv�ۻ���DU���m#��3� !��i�*�ڧ���w�HF
�k緇��d���{rw��]-Y���:���$`A,��v���KR
����٫ёH��/��!�j_6��˲�o8�~�Fߦ �7y�Z�E8�ljI�Ǡ���oډ��~����u��م�9��(ٖG}�f�$�Y^�{ ��6��l{�/u	
��}��N���֊pY������]��;4K��(�;�P�ԧUͱN��*�dayS��? sQ{�
-endstream
-endobj
-7902 0 obj <<
-/Type /Page
-/Contents 7903 0 R
-/Resources 7901 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7893 0 R
-/Annots [ 7874 0 R 7875 0 R 7900 0 R ]
->> endobj
-7874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 644.429 123.644 655.332]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-7875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.198 614.849 276.837 625.753]
-/A << /S /GoTo /D (index_Bag98) >>
->> endobj
-7900 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7904 0 obj <<
-/D [7902 0 R /XYZ 89 770.89 null]
->> endobj
-7905 0 obj <<
-/D [7902 0 R /XYZ 90 721.073 null]
->> endobj
-7906 0 obj <<
-/D [7902 0 R /XYZ 90 675.064 null]
->> endobj
-7907 0 obj <<
-/D [7902 0 R /XYZ 90 594.087 null]
->> endobj
-7897 0 obj <<
-/D [7902 0 R /XYZ 90 570.273 null]
->> endobj
-7908 0 obj <<
-/D [7902 0 R /XYZ 90 570.273 null]
->> endobj
-7909 0 obj <<
-/D [7902 0 R /XYZ 90 494.855 null]
->> endobj
-7894 0 obj <<
-/D [7902 0 R /XYZ 90 471.041 null]
->> endobj
-7910 0 obj <<
-/D [7902 0 R /XYZ 90 471.041 null]
->> endobj
-7895 0 obj <<
-/D [7902 0 R /XYZ 90 417.381 null]
->> endobj
-7911 0 obj <<
-/D [7902 0 R /XYZ 90 412.898 null]
->> endobj
-7896 0 obj <<
-/D [7902 0 R /XYZ 90 361.211 null]
->> endobj
-7912 0 obj <<
-/D [7902 0 R /XYZ 90 356.728 null]
->> endobj
-7913 0 obj <<
-/D [7902 0 R /XYZ 90 322.725 null]
->> endobj
-7914 0 obj <<
-/D [7902 0 R /XYZ 90 288.662 null]
->> endobj
-7915 0 obj <<
-/D [7902 0 R /XYZ 90 254.599 null]
->> endobj
-1235 0 obj <<
-/D [7902 0 R /XYZ 90 162.899 null]
->> endobj
-282 0 obj <<
-/D [7902 0 R /XYZ 90 152.305 null]
->> endobj
-7901 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F117 2446 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7948 0 obj <<
-/Length 1318      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~���S&�;%cЮu�6��{J
-C�e[�.��$�~�u��Ȯ
]��I�D����C�koF/���b��\I�1].6�$HPbL�ƵI0bʲ	�ؼ�6�4�f��f>l�e��.�y���`��S�8�/��$L�<���� �g��l��Y$��i��|BHK?#R��u����)
�$��	����8�J�yW�������U/6lF
�԰	A�ͺ�E���;��
� �Z��{�`n=���2˦�S˥�mC/��7�VX�SR�T0-u�z:�<" �?H9�"]��^�3 �1�I��)�gh\��
�6����I��x�A�U`sx�ԋ��$-���0
�W�
����`�WI�Ý
�
�!���wZ���
-�8NJ���%�E�
h�~h�D%=h;�(�x��@��s�	�����
-#��F�����bJ{\|�WV/��F��*Tw�Ʉ
�Ǜf�]�[�
-
-�=
-*���t��vn)3
(� Q���
z�GG"� �!.�R�
���ָ��
�.�U�I��+�?�$$��t<D��I
 q%C
�T+I{�:�8|�D
b�MC����x�/�MA�{i�����5������tޕ��pD���D �Vh��*ae9�A��J�Nn���%�e��exG+pV:��hU��R ����#Յh ^���/��ۙ���Ĕ9@;�z<��:��:�
	,���������b�婷�gWy��G'��2�7i^&_���xE�<�
9���''�|�&��T9I��fK�/�����[�B|-e�/�ȏ5�3M"}+؁s�F�!�.��s�r8�KY�x�\�?��3On�%\wJ�
�7��<o�
m�qW��?�$E�ӟ���)ī�:�~<�'Sq��аs7��}m�"
G
�5�d������~Z�'��"M�߅��<�'I��{�b�G�H�?~��x�^�Y�a'
r�g:ʙ�����y���C9|�j��q�v[�:�p�#Rҭ��Ʌ���!�1����.�<+�^�Xw~��R4�y}�I�����ѻ���<
�h�����P5����SZ~�j0�<��|��G��+�
ug��`��8G���-�\�{۬R�fS��h���Ym,n������ 8m�CJ6��͐$��l�=
��5��
���%E��c{�u�u<�WH��֙tyyQ����K�ʵ^|�VC�;
���r� �QB�̀�W~]jJ��nڨ���
�����������|~���x�I�8[~�
���5{`�K]��j������q� )i
��
��R�j��{�����hW�
-endstream
-endobj
-7947 0 obj <<
-/Type /Page
-/Contents 7948 0 R
-/Resources 7946 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7893 0 R
-/Group 7899 0 R
-/Annots [ 7916 0 R 7917 0 R 7918 0 R 7919 0 R 7920 0 R 7921 0 R 7922 0 R 7923 0 R 7924 0 R 7925 0 R 7926 0 R 7927 0 R 7928 0 R 7929 0 R 7930 0 R 7931 0 R 7932 0 R 7933 0 R 7934 0 R 7935 0 R 7936 0 R 7937 0 R 7938 0 R 7939 0 R 7940 0 R 7941 0 R 7945 0 R ]
->> endobj
-7898 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 7958 0 R
-/BBox [0 0 444 144]
-/Group 7899 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 7959 0 R>>
->>
-/Length 563
-/Filter /FlateDecode
->>
-stream
-x��UMo�0
��W��%�aI��C�b��
�ء�!�G�!-�?J�dž�t=�CZ��
)=�'��<j������_�	���o���������7~����#��{`(@��#��'4&�̝�;��
P�L �s+�R��n�t�X“�d2��x2�Pk�����!�!g�<T_�5�G�96Ԑ����
q�\�*6�$GG��5�_�ۨy��+N
�@>6ʦ�0�nKȷ9�u7�}lt;��e���>
JíI�����Qx���$���3Gc/�2 ��KV�	gJ3&2��)\�F;dS�-��*��2�!F첀ݰ��) ���"7ގ!�)�u����
wmW�Y����)��@hAp^c�C�V��P���Űa�,,G�:
�?&1�m�
-�9e�r�8���_����8S�����aѥq"M���ZO
�~K�5�5
���{�ΪFଳe��kd
]����J_������.4(�.�f�5|��`]P
j/�	�u֓4��I��Ϟ�]ZE�J]R���^�v�Uy<5G1;��w�$�+vci�oS�WA?�9gۡ�ς7�	� }��
-endstream
-endobj
-7958 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-7959 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /NCVACV+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 7960 0 R]
-/ToUnicode 7961 0 R
->>
-endobj
-7960 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /NCVACV+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 7962 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 495 556 500 611 278 556 667 500 556 500 584 278 278 500 611 278 584]]
->>
-endobj
-7961 0 obj
-<<
-/Length 7963 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mk�0����
��E�� B�^<�n�4�l�Ct��Ƽa

'3�����=wf\Y��fy����(G�|s��@��$\05�5R�ʩ�I�/۲��='M��\V��Ó�zHc�S�Fse����.7kh"��,i[�H�r/�}�'biH>v���u;�����%&s�$gE��%��\)i2�����i2�_<ϑ6h�ݻp���YVfm ��<P-@b
-T"O�*�"� 	zD���#���T�d�"VQ��*���@y�g�C���!��~�_���WT �ձJ�A�+�5�~0���}��
��a��'�I����c/�+ы��@����
�~���Vɛs~��*�M�wh4t�v;�=+���iʧ
-endstream
-endobj
-7962 0 obj
-<<
-/Type /FontDescriptor
-/FontName /NCVACV+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 7964 0 R
->>
-endobj
-7963 0 obj
-368
-endobj
-7964 0 obj
-<<
-/Length 7965 0 R
-/Filter /FlateDecode
-/Length1 2760
->>
-stream
-x�UV
lS����G^Ɖ��M����yC��4/�C�1�!o�$uH�G]($0���LBk(��n���Ml�4�2�B
��!ZM��N)��6�5l�!�
�r��\;��:������������e�"�Y���>@�U�=��ԡ��5Gn��ګ��F�]��#��
-�+ӆ�LO�,ѹ�ȁ����;D/���̾��3 əD����g�
&�.�[Hg/ eˠ"@2�
y6�����8.�ŖW�Y
�
��%�F 4i�� l�Fr�;���&��a��A��Fc[[�
���o�噿{�=��AQt�Y�
-�	`,�
f�`�
nA+�����r�&�k��v1G�`t�נ^e2�k?
-��&%��BM �5���i,�T����^SQY��{{��Z��q�'-M�G�lGR^AG`�Ş�������h32����2��-EA]���WB����z�i�z�)I�E�a��@ Б�X�"���y�!�
WI*:�D�|Egl�E��Of~Z1�ه���6g�$������Jͱ��Z��Jr�v���	�������J�D�E}�!z����b
��.:
��17��2�O�XI���.�ܒ�5�).�
���N�.,�4�|M�]]�z��o/���s
���`h��B�����d�� O9���)j�ϙ҈�T�#����@�dē�+���t�!csʖ_�b��SSڴ�L?��a��	� YFZ��E2��
-_o,������*���8�.
�俲e��e�

����
��&�ȳ�-d�[ң�0ɱ�56�0Ig(/���?.�^�>v"�:�.��Ў��
���
<{��Cv���]���}=�xfP<���`%K
�K�r�|�AEf?��֜���/

�r��	�
>��w{�//�߅���ف����
��#�������������n�e�@��X�=
}� ����	
����㉉�}����C:G�A�
��|A4�����Dx�Hx���.����`�k������oďg����gc2y�?��*��^#�O��/�Ü�����7�#@�՞��cʊ��_{���߿25;;u�-ߐ�|�}��kg��.q�}y�
-�!�wI��
-��,���{���MM���M���S��<r��O_��]�k���A�0>�E�7�O�U���t�uRX{�e�����V��F�)�w��&�#nE1��8����@b��������Ʌ��"8讚ڿ�w����Fb��O1k��%�2JY��{C�BZ�]�ʖ�W�c���
-���b��Aѫ�B�)I�����Y۝;w�y$��4���
���Y%�YT�+d& X�P�
&=�]U��&������ã#�
ˆ[�v���b��������f9�p��v��mlOQ��w8du�����pd28Y�s��L�sl�=ş�>��ɣ�
l��{�YM˄7�G��� U��-a�B'^
��χ�T>�n�����c���1�[�1���,�;��‡��꾫�>���}�|����N���3�Gȡ|�"������
�"ō��h� 7cL�KZ���h/�
j�����ƥꭒ����[�K�ܥyY9�FscmKO�#P��)�F/A�1}���03~
-Z���6�PJXxO���Ǯw.wq�Q⼱ރo����J���6Q%YQ¬�k�3KA�F��9��R�w/ŽM��������z����M<=�| a.�-	&�ſ�b�Ą�^
�?aG���,8�^k�^4�Rt1�l��drʚű�RV��:AM�	�Y�w
ڢQ�!��C
�ʚ���ϫ�3j��D��dB����z��i���T�&��
��t� ��,�
٤�1�؛���dN�~�RT_r�7�������
r��:��DX��f՗�_s��V+5����
�>�0�J�;����&V�Gt.|
|
&z�=(��A�G�
����ٟ��F�C��l�Ӿ��,��O{��1�j�Rz4F�N&^��{h���*����	/и�S@��ul���+5
zV�]Qu��)
�^Mw<��?C��o���k���
RK�^{��C���q2>H^��hPL���SQ����)�L���AM����G'
-endstream
-endobj
-7965 0 obj
-2044
-endobj
-7899 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-7916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 488.42 224.395 499.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 465.486 189.925 475.414]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-7918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 465.486 260.898 475.414]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1a5c8e881f8449ae038fc40642062df6) >>
->> endobj
-7919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 449.335 422.545 459.24]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 423.551 224.395 434.455]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 400.617 232.982 410.545]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-7922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 400.617 347.013 410.545]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_ab156f789e720f2d04086a672448ded40) >>
->> endobj
-7923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 384.466 389.11 394.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 358.682 224.395 369.586]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 335.748 254.671 345.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-7926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 335.748 390.391 345.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a7cac2a7ab2e138c7c0e96354b32b0110) >>
->> endobj
-7927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 319.596 465.458 329.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 293.812 224.395 304.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 269.902 181.207 280.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-7930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.706 269.902 243.464 280.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a3ae2260455d60d464a71a9b82e49cc9e) >>
->> endobj
-7931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.518 254.727 420.593 264.632]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 228.943 224.395 239.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 205.033 159.628 215.937]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-7934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.127 205.033 200.306 215.937]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_af0800054c69699766ed5188e3e11641c) >>
->> endobj
-7935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.102 189.858 400.176 199.763]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 132.998 169.81 143.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a02d8b929a48de1c69e0e0d702359ec53) >>
->> endobj
-7937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 132.998 309.485 143.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-7938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 132.998 514.653 143.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-7939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 121.042 227.553 131.573]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-7940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 91.665 169.013 102.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_aac178c76c46ac4796dc7c382ec2169ae) >>
->> endobj
-7941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 91.665 330.636 102.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7945 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7949 0 obj <<
-/D [7947 0 R /XYZ 89 770.89 null]
->> endobj
-7950 0 obj <<
-/D [7947 0 R /XYZ 90 517.926 null]
->> endobj
-7951 0 obj <<
-/D [7947 0 R /XYZ 90 517.926 null]
->> endobj
-7952 0 obj <<
-/D [7947 0 R /XYZ 90 453.32 null]
->> endobj
-7953 0 obj <<
-/D [7947 0 R /XYZ 90 388.451 null]
->> endobj
-7954 0 obj <<
-/D [7947 0 R /XYZ 90 323.581 null]
->> endobj
-7955 0 obj <<
-/D [7947 0 R /XYZ 90 258.712 null]
->> endobj
-7956 0 obj <<
-/D [7947 0 R /XYZ 90 152.172 null]
->> endobj
-7957 0 obj <<
-/D [7947 0 R /XYZ 90 109.479 null]
->> endobj
-7946 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F67 3037 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im8 7898 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7977 0 obj <<
-/Length 2449      
-/Filter /FlateDecode
->>
-stream
-x��Zmo����_���U�E�}q_�k/>�z���(�
Z�m��#�8�_��R\��
GiPԟD����gf���%N��|7�����L�� #�L.���
�-��S*����&5"F�[��_�����ˋW������	�G8!^�@J'�����8Y������ɝ�I8e�N^M�>�A���P7�9"pG�	�yU����(�ٜ
-<M��6k�8-�'gw�2�E2�Iʽ�7������:,��&���0��jF��*+�|��=[i�ʯߞ��~����̪jU�4x�<}���ҧur8��B�BF��H�c{�5Hr�
8;�"���]D�~{1�x�a�= 1���fDL�r��^V4ݜ*����

b��B��G�]�!�L3��وj
toU[X�z;��&��QP*+y�X�CXY%���P�$i��$��H��H�i���h �7��FcH�a�<-�w���^�i}W�[۴�+L7�0#xZ���L������j�����&�K�mx̘�f32�(���قpk;?afŁ�;ސnȢ(ým�/�7뢁w�Ʉ��V
R���3b��
܄�ə3)�
��c�q�G�C#`b���1h�0%.j�|0��E#.�N{�G�E!��f�c��z�媇:�D
����Ą�
D��`��#�Aޜ�	�b~��i�Yv�zzv�/jP�:5�9b�AI�E����oҺ�ʪp3-�E^���ls������
�H�
 �!��=Vu��)L�����֮���`7�*Ĺ
r�n�DB��^-��-3���k�J��"}��HC֌ɬ��#�K
�ld��~>������n?>i>���9���}9�
)�J����2�W�!�C0w�ۜq
-d�3���!�^R�
���}���3�J-Wqp��į��m5�	 ��0��	����K�#b�j�|Z
Q���P���'�y��/M9��)��V5
��LA�l�t�k��MV��R�G_�@�;�d�bTd
-�ԭv����j��zlQ��u�q�܌�EcH�����Rt�Dq�ǰ�@ )P�
^D�(l�L�LpM�hb�����i(H�{�����h�C��	�GЀ�k�b
.f\{JԖ��h݋
-5	�����<d��پ��l u�|��waQ]�U�r>�
*�M:\S
-���+b���ъ�g�N����7ٲ
Q��!�1T���POD���,S�kNO�*� �=S��b$��(hpc��ؾ�~�m;����Sf5~��ě�7����
�]r��	�`?
�
���Ks�0�(
wZec$xM����H)��0�b�
C�R��챔�w�� ^2�QCp�+{j��%�*⥽�2�����i����:�!�.B�8�gfQ���;�*���:�J�� F���
-8�
�M�uH׾b��mZ6]�A
0��ą
-��

-� U{���}��vl���
��.�A#����E������b����T�`�����u�	S6��iq�4
-�:�^P��ʖ��
���-X�m�'4~.��L���b��zM�~���5��ARX2ۨl�d!����X
-�j�
��X�`�
O6
-���+7^��ޗ���
~�
U#��m��E�/ʬ魍�wOi,���Z
*
٤�<K�կi�{�	������[ؼi&��̆L�՞�@�4��iC�4I<�(HDi�+[��kؾ�E��ABoSA�*�$K?���(��(�ۀ�4�Z?�u�q�s���sLa�����JG��n
�	ԇ"�-ʟH�
EPj�:A%{07��
*{ F����=Y�	�!�8xOg�>��V��,/R
-�ba�ۃ�\\������<��Q�?ks���A�,�T���I;G'8
����~C�Y�oG
���k��I�	c'y�	?ڄ���֝
�e'!��b��i8c6r�+J{�H(Sa
�=1 �Uu���
<��SA
����&Sc�GL
�ImG*��:@>������eP�_#��
-�Ɲ�7s�
y8(�'�X��8L>̓���GE�'�R�ߌyF����afBx�_$r/
-6���
i�7�ԇ��:������{H}��
���=�hH}}o�cޠc���Y�8
-�M��u<����f��9����
�c���^�
>
-��
-)Ȓ
M��
����t����g����;J<�0�ʠ�d"��x`�Π�&ԟل�Ͱ|Of�o�H)[�.V�`; ����Se�]�
��k�rؗ�a�j��
���>s#O9�=����
vu���!|�_1w^�
-	�>�e�&JQ��{�
6�'/6,�� a;qs�7�	t�r}N��n��0Ʒ��������UV�n&`�������9|���2|k	7	r��!�	vǯ�,@���w��_'�a�����E{lrS��ӓ����*˯Ѣ�
{��q=���U6ћ��*o��
����9�
-endstream
-endobj
-7976 0 obj <<
-/Type /Page
-/Contents 7977 0 R
-/Resources 7975 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7893 0 R
-/Annots [ 7942 0 R 7943 0 R 7944 0 R 7967 0 R 7968 0 R 7969 0 R 7970 0 R 7982 0 R 7971 0 R 7972 0 R 7973 0 R 7983 0 R 7974 0 R ]
->> endobj
-7942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 686.333 282.901 697.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1f3d0a78d4643a39b5bb1e57e9f75966) >>
->> endobj
-7943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.119 686.333 396.604 697.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.8 674.378 284.284 685.282]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-7967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 637.908 290.65 648.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a8ce651047fdd482308082762faeaa1f2) >>
->> endobj
-7968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 531.638 155.683 542.542]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_abd3924517707378fc8a0addaeda7281d) >>
->> endobj
-7969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.901 531.638 316.708 542.542]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.774 531.638 513.996 542.542]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 519.683 229.376 530.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 480.028 155.683 490.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_abd3924517707378fc8a0addaeda7281d) >>
->> endobj
-7972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.901 480.028 316.708 490.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.774 480.028 513.996 490.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 468.073 229.376 478.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
->> endobj
-7974 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7978 0 obj <<
-/D [7976 0 R /XYZ 89 770.89 null]
->> endobj
-7979 0 obj <<
-/D [7976 0 R /XYZ 90 703.217 null]
->> endobj
-7980 0 obj <<
-/D [7976 0 R /XYZ 90 653.53 null]
->> endobj
-7981 0 obj <<
-/D [7976 0 R /XYZ 90 589.473 null]
->> endobj
-7984 0 obj <<
-/D [7976 0 R /XYZ 90 432.295 null]
->> endobj
-7985 0 obj <<
-/D [7976 0 R /XYZ 90 432.295 null]
->> endobj
-7986 0 obj <<
-/D [7976 0 R /XYZ 90 369.644 null]
->> endobj
-7975 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F90 758 0 R /F39 2320 0 R /F75 554 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-7994 0 obj <<
-/Length 3345      
-/Filter /FlateDecode
->>
-stream
-x��\mo#���_�h�VN<�.�N m� �]��~q��Zً�$g�:���;C�Wԋ�{��	Eg
>C��"}}�˓��ZD������<24�1#���r]M%B�N�trq��$-���)��U��>�������L��gg_��yV��d�-o���b�V��n�/��~yp߯��jy���ۗ���,!Zq���7��3L�ip~q�Ͳ�A�䝵���<�r��!{�?���'�
M#F��w�\MV0�*`�bD&���
fӴ�g��קS������I�x(�*sO��zn�GB�j•�^O��<���A?4b��R�D�����4���o#�I�G�hI.ൈޜ����#�A$�!1���_�8_�3��'i���C��Ψ$�H��<����h�`Ib���fj3�"�s*����F?R�B�#ԓF㮑瀘�	.g�����j�Z�6J��f]��m���d]�2 at G=:�Ӌ<g�%,<Q�����H�
��f?R���S,���?zӄJh�Z}�2�;�4D�$@ [...]
-��p�F|J'$���-"I
�[|'>���$������1E4s�@N~ȉ��K����6�ˋ
�R�="Y� ���|U+����,�@F%Q�	�K��GF `B@�L� ��O���$aL
�y�V����?��?ѿ��
-J��t?@ԇ dܤ�>e��G
l���Un%m�40f�����QL��>0�?�V��� ��
���3L#��D)���i`�
-)�F�V�2������m�Xvà�F��=�����5��=�O
-��<�;��B�K�3�
����
'�)���c�!�+�IZ7}2D򮃷�?�q
G ����#�x�5�o<
.�w-��?r�ܑR6�W�Њ+���Ŧs�b�ӹ�[)+�3ԝ��Ms�����mߡ6�����t�~����}Xd��jf5,'^�w�����(+z48�w,�S[U�iOggeV�Wﲩ︠�&�﮳�\���N�LYhG뷠�I�j>p��o\�~C�(�IlN�Z/�
-a�k���̉U�M��f9��LJ���,��×*l�/���΄8""��zU ��PMX%O�䳸=ה@"����?0޲�1���Ġ
Mx-H��7Y鄦���B��~�ru�Yd�*�jA�5��5�z!��?a�U��ҥ��&�ڛ������2]XE�M�/��_�!�6�T
ۨا sHz�Հ���lW��+)�
�t�i�4�X�
�<�1'1�Tπ�S��.�\���G�EHV��3�RN߬�]5 p"K�A
��k ��7�U*�A��]E�fuņe��5f��S	���p
���Wa	���!�)	���b��� R8�)�Jjs,T�a�3ƣX`$$�[�a5qR�:Brt��a��<Gk��f��&�k:�}�#������m���8��M��
�br��.k%� ���v{
-p_ԕ��7�ʡ1�2ܥ+������D�
�xp at a��n��{�?59��	* ���x�
��`7��LS�l���
c=����h+�G:L�Dt;v�aS\V�u ��_1��x
�/���Z�
�1�ɞ۾T���$]j��H�1�
v��G���l�*3�(�9��
��)���u�ջ��6i�vف�`���
�:��%��5W�7���}�ׯ�{�To�\	��-�BJô=���u�.Kt{jX�H�c>wK`Ojw��
�`
-MzI�v�y�
��w��"`
�Z���|
0
-=LY�

֯���n��A���6��E�51,ivw.aw>cS"���
����ߺ/��-)��
�& �b�@�ӏ�#�v��&2��z�Q��n41�1(��RF�5��Cw*�K���ƀi���A�A�5\{]6 
T��n��
-i�0yw�����3v�>���	=������n��'��Y���ӷ��ϧM-U�g!�C��
n��@c�� Ā�9a!KƢ�TĢѨ;��y?�3'
��9-��Y�Յ�:7l��0c1B�1���=w��Yb�26Ȥ>|�U�r�ݷ�O���w����T���0��&Y���m�Ͳً �‹jR��u��Шp܁��b)
W>��MN�����&<����˿VȢD�qp>�w������<�)���w���Mi�Kl�d
�ډ�� ׿)3|�-�
-��nއ(�VೖP��r]]�
��l�kC�(���������r��3Fcz ��
Mb�m�z�ÛK�����GN�	�W1��z���S7gAk_��Y�

È���B���t*�T)>�f�ƲD���Y�g�]��rU�7�p_�;�+
-�c
���$
��空d��x�Y7'��F�f�W���MV�*�MZ�I��&�Fn�۸�l}[�݊��J�d5˪4/�k$��?���{w#,�B���'�|�
L��R�8�!�ٚ���'�-
�
%��}?��}]X�����w���B����P���+ЍTC���4���5�޸f�o\#����R��;_{��1�	�j�c1���/j���̳�l�/�U��|���5�Qk
���5e"� �q�����x7>Z��1�#�aA
>���Y����Pp ?�!a�.F0K at 6���f�1h��t'��C�a���T�(1<��SWB��6X}`�`7B%�����N������p��n�����;����
-��V�;
<�JEҾ�J��2���n>�F��7cU� ��
ʫ�-��%������pԧ��!�N��0��f���-��87vE���,�`��X�`����g������,�$DB��
��훱�����y�
�Ҏ�t������2�{@�Z4]�n�߯�
�J
��������V�
v��v�%��
����W��^�`P9�����|v
O���W��E�W���+
V^N��0EI"�S���|ų�|e������+�o��`�Y�|�����O�+cXP�ς'�1̨��g�|���=�JT�WxLL#O>���`A�W�<���`F�W�f�
�ʰ�4�t
_3s�@bsD��p�-���L��j1�?�t�Y�j~Ev�m�֊���Y�����ou5U�I


-r�}3���/����)��
/�ۿ��HF���..^�7?���(R֞x�.7M��:'���غ1��,8ULg�3���y���(t�0X1��O�����˛��:[ޑ��b;��y@���Fva����ܢ
�$͊k�B��8�'��?��mAmoRÿ�{�e�����o"�r��0�vmnM
-endstream
-endobj
-7993 0 obj <<
-/Type /Page
-/Contents 7994 0 R
-/Resources 7992 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7893 0 R
-/Annots [ 7988 0 R 7996 0 R 7989 0 R 7997 0 R 7990 0 R 7991 0 R ]
->> endobj
-7988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.089 633.401 513.996 645.356]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-7996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 621.78 126.862 632.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-7989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.811 621.78 513.996 632.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-7997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 610.671 126.862 618.318]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-7990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 272.267 501.708 283.171]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-7991 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-7995 0 obj <<
-/D [7993 0 R /XYZ 89 770.89 null]
->> endobj
-7998 0 obj <<
-/D [7993 0 R /XYZ 90 597.097 null]
->> endobj
-7966 0 obj <<
-/D [7993 0 R /XYZ 90 573.874 null]
->> endobj
-7999 0 obj <<
-/D [7993 0 R /XYZ 90 573.874 null]
->> endobj
-8000 0 obj <<
-/D [7993 0 R /XYZ 90 461.793 null]
->> endobj
-8001 0 obj <<
-/D [7993 0 R /XYZ 90 258.786 null]
->> endobj
-7987 0 obj <<
-/D [7993 0 R /XYZ 90 236.409 null]
->> endobj
-8002 0 obj <<
-/D [7993 0 R /XYZ 90 236.409 null]
->> endobj
-8003 0 obj <<
-/D [7993 0 R /XYZ 90 166.311 null]
->> endobj
-1237 0 obj <<
-/D [7993 0 R /XYZ 90 69.928 null]
->> endobj
-7992 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F10 765 0 R /F8 794 0 R /F29 938 0 R /F99 5346 0 R /F1 833 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-8033 0 obj <<
-/Length 1355      
-/Filter /FlateDecode
->>
-stream
-x��Xێ�6}�W�C%���~1���H��n�}JC��z�ʲ#k���;$u�e�n��y�$�3�3�̐��2��������D�� #�
f7����		o��UH���̞LjD��Y��^̞��]��FOf��#�x)
\�F���`��1���ܠU�)��<�
�<�5������F�AF�@�WB<&u�q8�(�r���!B"���ʰ�CB��Dbĕ��F���<"$�p�.�(���g	��#x�]�I�:�0
?��e�l]
@a��R�a0�`L�uRe�r�3ci,��1	�dEu��$�2~
ג#M������2�6��Pڟ!`݂5���١�Ҽ2��/�s�>�8(S���U���.""L�4�6�a�
jÐ9��w7��
(Z�p��3��1�q��{_�!�Y �BLҿ�r6�)�|b�P\�C9f��&��
ɱnY�(O��(�T�u��M�T���2��T��iq��E6��b"q�J�F 'LS�'`u��
��eZ�ev�_
ga]ܗV��m�d�
;*#�(t�G
)PHR�}}����"�#!��H��pI?�� Um�6�
��
���R�v'
-
-qBkd���-,�JlcFX�Ȓe���

o֥�:ud��Χ���/���vQ�7��X�}�"v�߁��|g��й�d���N���$�7̗
-l���(Ec��o�\N���
9X���A&������Z�QP��e	��Ճ�о5�ԍ�=���y����+<^���5�fB�x�{���,
4+e��@E��@#3����vs#g��\
�5�b07x
�uT`t��Y��F�iĥ��'�=r���]w�Y�C
a���F}$keH���g뭶��#����az�iR��w��?�{���l�76'v)
���ak�/�y�l}$\5��m�:_�ukW=�v�#�nS�{�}C�%�%Bq����J��R�m�o� ��ߔ�������2��\Ġ���̢{�1Ќ�
�p��s�C���!O� Ӄ�mU&����Z���B9���Q'�����!Fc$(�_��
��u"����k"V*e�-f[-��U�9 at n��$Ӳ�����Q-��e�]rNhd6Eܰ�[K��9Q�ϲ������w�N;�;'��)��ȡf0
����')��~����Yq��:
�)����t4ܽf�)�N�f�M�
-	��c;&J5�������5�����Π;�
z�q`D=�_c4��N���_�i�u$DX��Ǥ�Kr��
��&Ӳ��"�w��m/ӆ
ׯ-�F��Gpd��j��V�f|qqu�ܦ�]�W����C��v�ڒee�
-'�d�[�~�~��
8
-endstream
-endobj
-8032 0 obj <<
-/Type /Page
-/Contents 8033 0 R
-/Resources 8031 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 7893 0 R
-/Group 8005 0 R
-/Annots [ 8006 0 R 8007 0 R 8008 0 R 8009 0 R 8010 0 R 8011 0 R 8012 0 R 8013 0 R 8014 0 R 8015 0 R 8016 0 R 8017 0 R 8018 0 R 8019 0 R 8020 0 R 8021 0 R 8022 0 R 8023 0 R 8024 0 R 8025 0 R 8030 0 R ]
->> endobj
-8004 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 8041 0 R
-/BBox [0 0 418 144]
-/Group 8005 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 8042 0 R>>
->>
-/Length 557
-/Filter /FlateDecode
->>
-stream
-x��UMo�0
��W�X�-`�!�0`��
�P��6I�!�?Ҷlř�=FB���ޣ��_`�Nh]�&Z|��7�	�r=?�ͽƧ������4~����C�4n�4~B�
�8
�&[e<v��Pfm@��6�����/�͸�N�tIH;����xPP�y
ۯe�MY圣}i�1�a&�p�ot�YS���wZkjC�h��9Ilk�Dצ��o-�
B��p���x��q�}��?C}
�ml�
g+J!�w�<������n;H�3S'�9I<Q�Z
-fQ�Iّ�H�\KT�Q(�o���
-���,|�
-���Љ��S^t�<�I�,��N�j����$��E6�.��?b���O�-D榛��u�H��H�I6�}!s��+L����k-��K_�L�@����n�^L�e;�'�(1G6��*q��m��׺������|v�������
P�x����o��~��V}�6��{�
-?���Ψ]��j���9i��X�3ǁB0����
�&�l���ϩO�W�GI��eD1�
v��9$%�7�X��PF�W�:s��/$
��
-endstream
-endobj
-8041 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-8042 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /IIVALI+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 8043 0 R]
-/ToUnicode 8044 0 R
->>
-endobj
-8043 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /IIVALI+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 8045 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 500 500 556 611 278 556 667 500 556 584 278 278 611 278 584]]
->>
-endobj
-8044 0 obj
-<<
-/Length 8046 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š���t�:�hr�
-5��,|����)TP�<���̉��sk�U��nVZ�0�h�oN���:�H�B�je
-O5u6�}��-+M�樮E����6qx�sO�"~s��h���u����f�MdV�DM#4
��Kg_��D
��V���nG�[�Yi`�-�Y�b;E�3W���_��5���q��w��r�'I�4��@�e�����Ar�D��)�#��@'�
A
� ��
���E��]�;e] � �.~U	�_���W~9��_�]د�/Ǯ%��H¯������ �r��`$�W���r��(
)��~��$�'Gݜ�C�5L�>'���D���p�ԛ��
-endstream
-endobj
-8045 0 obj
-<<
-/Type /FontDescriptor
-/FontName /IIVALI+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 8047 0 R
->>
-endobj
-8046 0 obj
-356
-endobj
-8047 0 obj
-<<
-/Length 8048 0 R
-/Filter /FlateDecode
-/Length1 2556
->>
-stream
-x�UV
l�������qb�j��8q����
-!��r
&v�ۙ!I��QA
-�i�e���V(��v����4��L�ЖJ�T���ZX�I��V�`�v����N Kt������=�|߽�e�ӱZ�Y��Dl�<�
�a�z����w�k�|���Xl�u�g,
:��aм��Я@/�'��>��
���&���;Y�Xz����
��%�C/����Q��TȁIF���at�q��B��|i�����o~��`#����N��c�H
��UA|bv��0�'�݋
�`�"W
��7������g��en�vVƼ�����j1�%O��u�J�����5���.g�Vg��w�Ae��io�F���Nki�&�
N��3����+��ڵ}G�&�ԗ3�^���5�7�������H�͕�����Pk���VW��J�u[yT��w�*Qk�P��6`6�EI��<6��D"�E
�����?-������
-�4��/�U�z��*�V_���Y��*�[�m�i�Ԛ��}ky��(�"�&<�Г�{k3RI�I�x}�E��4��ׯ|��aJ���$c�
f�+�5��e�m�Z�x��.ʞ=���̱���P��iO7����
g�R���ĵDb(6%bȜW�g&d}>" �.~3']�	ؕ
ERa����T��N
,�E7�؍��2
~��2ׯ�<�!��兹A��T��S�2a~�ɸ�+z����+
.n��Ӂ@U,$��/���*鬗*���3�Z�,��b�Ն
�����f�8D���I�'{Ex��~v`j�x�}6�"/��"�v��i-m������/��*����7��\��.��bvdjt���>/�ی*����w�
��_������H��>�j�V��K���,�������`t��܂��[��a���x�p���c������~���
�
+��É�T~~� ~�#gTv�����4=��~r">w4~`g�6�o|*�f~����/~g��>��:=��I��l��ź&�Gq�.��§���
��n��:KR�UP?���ۧ޿<933y�/-ʗ?�9}��
-w2��L˘é��$Q����g�8[z�§}�l���&J��J[��N�1f�f�D�j����
���ᶩ_�>ոT�E
-u5�C{qk�]�_�a�6Դ�F:#EyN��Դ�c�g)�
>�
�[���T�
8�wxj� A_���N>H�n����G���B
����aZ��u�W�R�rOj-Cr����ء�Q`�:�|��,�^�='�$���%����y&u����^m<}Z�(�o��R�lk��IF���S�〤�
}8t��辚΍U#mCS��
��g�����X���;���`��

�[
i���=�t{*:�8ݗH�.�
C��"w���J��+�?�(}�:��Y+�����?��%:�I%��<v���_�dd~>��q��u�$�v-�i8mOqچC�1���9ݹs2~��X���
-�#�[����'�������41w�_�J���b����ͳt�7M��~�R�������n1��V|��wq
- '���
������a~��>����
~$���_+g�Ą3�:>w�E.��@2r��r!���&��6:�t2ײI�D�2�)����]f��ros2��%��V<��]�
����j�0Zd�ff =�f�f�@f#�nFeVfcO�׹L�)�mb�Y*"�e��0�0�U��g�>�����Ok�W���/ԹP��ZU��`�?��������}��/�A^�ʩ�5��X3�Lށ^�>a���
+��BB��c���M�߳~�d@
-��l v��w v����
;���ǂ�6�j
�9lr�P�:�<�h;$2�.�QC�½Ju	�o@��ո�aS��0.
蚋 �
��S;�	��
�b:ܷt}⾦,[@W��C�
W���&�1�� �
J
-endstream
-endobj
-8048 0 obj
-1915
-endobj
-8005 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-8006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 395.749 224.395 406.653]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 372.815 189.925 382.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 372.815 260.898 382.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_aadb6d4669e8aa852e2f3d11e40c8c211) >>
->> endobj
-8009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 354.364 422.545 364.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 326.281 224.395 337.185]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 303.347 232.982 313.274]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-8012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 303.347 347.013 313.274]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_adaf83ce888c996163559b520ebda628c) >>
->> endobj
-8013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 284.896 389.11 294.801]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 256.812 224.395 267.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 233.878 254.671 243.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-8016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 233.878 390.391 243.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) >>
->> endobj
-8017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 215.427 465.458 225.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 187.344 224.395 198.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 163.433 181.207 174.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-8020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.706 163.433 243.464 174.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a443736bb8156073cf1c5f672737eb02b) >>
->> endobj
-8021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.518 145.959 420.593 155.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 117.875 224.395 128.779]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 93.965 159.628 104.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-8024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.127 93.965 200.306 104.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a6cfe9f46fa0f15b09149f89ef35430c4) >>
->> endobj
-8025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.102 76.49 400.176 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8030 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8034 0 obj <<
-/D [8032 0 R /XYZ 89 770.89 null]
->> endobj
-286 0 obj <<
-/D [8032 0 R /XYZ 90 721.073 null]
->> endobj
-8035 0 obj <<
-/D [8032 0 R /XYZ 90 427.555 null]
->> endobj
-8036 0 obj <<
-/D [8032 0 R /XYZ 90 427.555 null]
->> endobj
-8037 0 obj <<
-/D [8032 0 R /XYZ 90 358.349 null]
->> endobj
-8038 0 obj <<
-/D [8032 0 R /XYZ 90 288.881 null]
->> endobj
-8039 0 obj <<
-/D [8032 0 R /XYZ 90 219.412 null]
->> endobj
-8040 0 obj <<
-/D [8032 0 R /XYZ 90 149.944 null]
->> endobj
-8031 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F22 2996 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F67 3037 0 R >>
-/XObject << /Im9 8004 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8064 0 obj <<
-/Length 2146      
-/Filter /FlateDecode
->>
-stream
-x��Z[o��~���K�z�

-�M}�6=P���0h���#�*E�q����Q��*}ʓ�˽��|���qt���?�.���R�J*��]��HI�%�l}�	FL'�1��	�qV���iBq\-�
�E�ݼ+n�~z��MaF|.6EU�\/��)�{?�(�������8ߘ��_��	���p��P ���_nHO@��4���޼-����Z�7�D��i�ofGFR$SMA��y�	q�iFq���g��i�m6Ʉ
-
ϒ���j�̚�����rw�rn���"�B�U/~�]�yA`

�}.���|u��
-���l����ZE�2�]F.~��ސ �0M���
-k��
-�'ު��m��e1i���W� �m_o�y��X�v��߫k�]�Hę��H�p���D��͍>N�綪���
���g~oG��<e���_�p���	
<���k@|6�0���4u6on>4U=��A��|�
4�i|�.אּ�"bQtt#��L� �\ޅM�d�����
f�e�o��tD
�gZ0e P*%�� �'D ���;xD7
ȹ�d��L�������}�9=�#7(�u�3���$
`
Ј$� CT�����8fq\���ͣ%���
�Ώ�� Q{ܶ㵖�:�q
-]��ȭ�O��|�mʳDc�k�F�)%;��哅�	��0&!*�>j><f��DwFS����'�YwFq$����¯���)
z,��������F� {����G�� "b8/�k��?��s ����\�ƛ<|9p�5披�
���
��!��0�e��ǐ
1��S�
�
�'Ta���Q=�Ї�t���h�z畎8����9r~����H�X?D�9���9��i����H3��v�s$��p�
-7���Zg.��r��m^%FI|k�[,?��*/
-�
�/s&g+7lm
�>�5	G�}ߺ*~���j�tW����aBy k�LF�p¤@�� �S7�<�d�~>Ne�`�4d������� �$2�=�#8Q at g;,���B4>W����=Pu(���˒)2�*��
\�R^��s��/��ƃ�c�'�8��^I��
-7��!kv9��wf�o����
-�8��¦hOm�-PJ�+�B��$�pg�&�S���qT!�GX�
!�h�H
R	��Q�r_=q�M�XO
"%��h:��ą~X8%3��ἐ}���������򴼐��sia��嗣Q��50�nf,70�˴��)����WI�)�0'�`�������C�K�WL��%�3�ot�n���?B7G����VFQʩ��z�(ȌM>�-]R�|��b���R �L�`o�a�c�Ĉ�:�ɊeX2�y]�������QE�H̐H��B����{�8�c��J45B�)���^A�:�_�ˬD
�
��>#s�6j�}LeHS}	(�&�/�,���6lR������:�P����
u}�% H=�������9�4��>R쟈��|�
'bp
��މ�	�q�4��^F�E���
"pj
�/�{�1f��1��/��H0v)
J(
��3�d��Wc�wvM� ��Ĵ�}s��wp�XdJα3�;\�{;�#� ͜#��1��Ĵ
'c�7RM�"��p�%}�O#(&�sH`��e/�c�$ l�y�
�Ɂ�)�xm?�9�% ;a
�� �ڿ��%۹�w��WOtMC�
-w����a
-�Qj�=��[��(�}�=7.O��:�C}m/�?�
��фC@�񗚙-�i�����m���D��J��_EwO�L�%a&3�G
-к��\�F�y�l��~˰9��;�.:i�|��.5w;9�
�w��Z�	}�Ze�����?R
�LO�%�h�uɴ���0�ZGu)�MZmv=��F�����n���z���a�4��Ҷm�g'U��B�qa�W�*�u
�ic�{&)(�̻&�vf&C�9��=�v���W{�I�Con�e���f
-%E��S�-����
��w��Φ�w���M^��'�߲rk3_a����-d���7�yx�vB�/
-�_/,�:uC�b�
�f����v{�G�j�O��s��wһ��>WU(���͎A�A�$%
� e�	0�D)jGt��c��;�ޮX���O�ƍ
-endstream
-endobj
-8063 0 obj <<
-/Type /Page
-/Contents 8064 0 R
-/Resources 8062 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8076 0 R
-/Annots [ 8026 0 R 8027 0 R 8028 0 R 8029 0 R 8049 0 R 8050 0 R 8051 0 R 8052 0 R 8053 0 R 8054 0 R 8055 0 R 8056 0 R 8057 0 R 8071 0 R 8058 0 R 8059 0 R 8060 0 R 8072 0 R 8061 0 R ]
->> endobj
-8026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 685.185 169.81 695.715]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_abf9798785b87d68e6ff2db95401536a7) >>
->> endobj
-8027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 685.185 309.485 695.715]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-8028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 685.185 514.653 695.715]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-8029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 673.229 227.553 683.76]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 644.297 169.013 655.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a5c97434b373dda7d6f4f882478dcca61) >>
->> endobj
-8050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 644.297 322.367 655.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 578.189 274.632 589.093]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a164b02df3563d0cac9dcf896537051c8) >>
->> endobj
-8052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.85 578.189 388.335 589.093]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.532 566.233 297.016 577.137]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-8054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 529.04 282.381 539.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a4e31289c7f2b430f3ee16db365000bef) >>
->> endobj
-8055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.94 420.767 156.306 431.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a7d57cba876e1525b5e8ddd5e780fb22a) >>
->> endobj
-8056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.146 420.767 309.683 431.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [469.633 420.767 513.996 431.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 408.812 224.395 419.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.94 368.298 156.306 379.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a7d57cba876e1525b5e8ddd5e780fb22a) >>
->> endobj
-8059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.146 368.298 309.683 379.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [469.633 368.298 513.996 379.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 356.343 224.395 367.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
->> endobj
-8061 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8065 0 obj <<
-/D [8063 0 R /XYZ 89 770.89 null]
->> endobj
-8066 0 obj <<
-/D [8063 0 R /XYZ 90 704.137 null]
->> endobj
-8067 0 obj <<
-/D [8063 0 R /XYZ 90 661.888 null]
->> endobj
-8068 0 obj <<
-/D [8063 0 R /XYZ 90 595.336 null]
->> endobj
-8069 0 obj <<
-/D [8063 0 R /XYZ 90 546.168 null]
->> endobj
-8070 0 obj <<
-/D [8063 0 R /XYZ 90 479.327 null]
->> endobj
-8073 0 obj <<
-/D [8063 0 R /XYZ 90 319.581 null]
->> endobj
-8074 0 obj <<
-/D [8063 0 R /XYZ 90 319.581 null]
->> endobj
-8075 0 obj <<
-/D [8063 0 R /XYZ 90 256.631 null]
->> endobj
-8062 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8086 0 obj <<
-/Length 3619      
-/Filter /FlateDecode
->>
-stream
-x��\�s������mfZjj�����̴M�qj�j�t:c{8�Y�P��v����8�8��D�I�O �������uw��w#:���/gGOO�9�4ף����##
Q~]�^����oϾ
	m	s�*
���ߝ}���+|w����OG
^��1vtqs��-
]��oG�gG�F7#�\�WG�8�m^4���a���"ͱ��'�i�4�BT|�}
�j�	�z���B� %Rɑ!�p��lD�[g�-[)�Gl�K�ޗ�D��$\��7����#N�u�AFš;"�
{kӒ�9�7
-�h��b)Y^�x2D�0�gG�J\о�Q�I�ɐ��!e�w˚�d�
�(���L��D
-�ު
}I-�*��yz<̌�c6�p��x�/��4��^��V����'�]��"R�H{C)�L�gC`.��E�#�2N�I�Y
�� H�P!�a�
_�׫
�_H"9_�Yr����4K�U�߭��a�pg��
�ˆS%�J�\Q/B��\\���:ɧ}�F�)HI��#�4�mC�Ŗ�P���"Z���G| u9����&u0T�48рQ��ۍ���G��{�Q0~Rj
�7,#"
-
��
#�Bό� `�>
�;���*���V�Q�GQA�F�B�j��eT�}��^��)�w�����A��`C)i�ƁZ�&:	
6�
��̤iWʀˡi��2:d�"��C�
�;I�E��J�E3��7�Z�B
T�E@O���b� ����`Z��UhY��'M?|$
��r��&����ރ��g}�.���
`��0�i��/‡��Qԇ
I��nפ4(}jk*�oM���!*����*�J�7��H"i���[e��̏�����KH��|�_S|���,]��>��tnA��.6�}�IЧ
�z�@i�dW�H�3^��:�M��$ώ'L��y�ȵn�6"*0"N�k^.�r���]��y�?E+i×kH�Ҙ����O�
��L��Y�
�*�̴b��Q�G���P�4
�oĸ�6��q�0\	�Ed��W&	����Q[�‘>:>��V�^�h7�h����|���{�m��:(��2A�$P����1)�p�1x���_D$(�5� �v��x,��ozY0M��}�)�O���i����&�²X�~��}�Fg!��X�\ icv��5�_<����=��i�Z�>��
u�}
�RCqp�TA��;(܂�$���C{��+���&�uƶ5�
�f㹀|�ۧ���T.�����q{�R.�
��o�w4]p�ַr.��x�b��A?̉R�4����(��<����M���3 d	��SP�5�SP�
s��;;s���8N��(o�"�
��\Ŧ�
��x澎�+��j�{2%kY�h��,�<�1"y��6>g�lYr�7��֎��u�e�}�
���2�s�w�
�G.AA�p�S�T��8��F�۽�l��/�l�6�0�Ά�
8 ��gü�

��B�M6
?}6
7�l�ԫ�p?��N���	���M��^�������y��c��~).%���\��Փ
xĝ�+�S~��v���J��笯
#�+1�hȜ[}~��_
��@{)B�}�0aD�j
�WU
yTń���`�ј[K8�l\ͯ��?\�U�^��:X�QP[�
��)�k&/�t$��A�b�(��-���2G}$�7U܆�E�V�a����K���c�4Y@�w��M�_��=�G~Wr��ܞ��7��90ɖޘܓ�*Ɂ��t����:��N�t�ާ�r]EPB�
-7
��,[ee�~csg�3�:ӊ&F
Wa��
��lkO���4b�C�(�Z�?���i�
����\��Fـ�`�-��ڟZN���g)�b�s�
-�M�Ѣ��
;��v������=�m���i�O�{�Z:�9eA�BG�/n+��iq{����/+|̗{� l�m6���+Z��49_� ��v�ᶚZR�7��/��
�G��Dp�*[��W���P)����y��1����"�BM�����&]�I^�nj��>�#�o��	+{�ӛ[��1we �h�R,5O�jR���t��`������s �X(E�z ş���GO��
��CR��<�){<��ܕ,"
(���a at s�A.d��X�1��� �2{�EH�(�����pjC�N��&��9 Dfk
�0naQu�z�Z��+8��
��T�xT �
g�ǜ�W����e��js�P.4�/��Y�}�N������81g͔-U�����`͒9Ęن�b'`m��
-Q�.���0ԇ(D	BdA��/P�0
�!8�`f4
9h�j}��E�%e��!ؐ
AM��6d�Ƙ~���L�>����J}
�
-���j�cehۋ�d����5<f^[�ًٟ˒��
vA4�P��lS���A� bj� �(��&�q·wS@؛�£hqV&Q��
���RC+��B=U�J��$��P���q��=&5�I���&Bk�t�,�U_n yp^`�����h�yA�W�'zr
%��m
k_"1<D0
���T@�Y�1��
-�
b�"bhkO�p�l�z?��M�x�-�zd��B$Ame��L�����t��g���Kw�
-���2x0
�]�T�0�L��E�#NK�?4)I��
�5

I7�� I;C��K��#X]E�z
��ykٗ�_�j`~=_G�B	S��C���P~�q�����t`y�kp����\�o�h�0�l�)v�A���%��
Q���`�e��S�m��Kbvq�o�5d���XE�S;���2p��T�f��ca�e":$6!�z(G�IP�������
-��u����YA^�
����9H��CS� �[�
��!Ι"ϒթ���
��0���i3t���
�1to��5α����CS���І
C�r�	Ǚ�\�Vk���{�D��؉#��N�����
kCX�!j?�ܛ�a5c`�!�so�QW�OϬ��L���@
9��lw�+1x�
-�T���y�Iw6W�#����"M/��'�X
-w��V���:֫��6U}�.�0_�!�9�����NU*�n������3�CO��������]|����dE`ĆO���0
-.��R|�.��7�:��c���Q��<[�����mX�gD�^9��/<�Z�YCȻ��*4��}&YýI����?�:��:�N�j�#T|Š�g�u�^]�?fAKY.6e��2ư�ژi%˳�^���.�q�)�N����W��"�.����
g��z�\����'p�Z��U�kYRa �r�‡��f]�CI��ͲU���i)�9�i���4�U�MI. G{��/��m3c�VY�^]�y2_T
�H\$�0�)��~M
�F��
ө���Np���q`̈��
d)��7�������uA�(�%ƺ�X�
��YW�a���o(���P��J��Ύ-�:�?Hx}��
��0�����/��,�
\a��͖����=�Щ��4D�"���+}���e��xY}S>x��F��Z����M��/�\�J;�
��0��M��OO_���i�{�%n^&�M�_`E����$0B��A�_gh1O��<_?�l����?J�����u��N�>=߼{�� ^��i>v���!Z�֫"��Ύ�
- �=��HKu�
-endstream
-endobj
-8085 0 obj <<
-/Type /Page
-/Contents 8086 0 R
-/Resources 8084 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8076 0 R
-/Annots [ 8079 0 R 8088 0 R 8080 0 R 8089 0 R 8081 0 R 8090 0 R 8082 0 R 8083 0 R ]
->> endobj
-8079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.089 444.051 513.996 456.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-8088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 432.096 126.862 445.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-8080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.095 432.096 513.996 445.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) >>
->> endobj
-8089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 420.474 168.705 433.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) >>
->> endobj
-8081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.256 420.474 513.996 433.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-8090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 409.366 186.638 419.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-8082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 74.333 501.708 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-8083 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8087 0 obj <<
-/D [8085 0 R /XYZ 89 770.89 null]
->> endobj
-8091 0 obj <<
-/D [8085 0 R /XYZ 90 395.792 null]
->> endobj
-8077 0 obj <<
-/D [8085 0 R /XYZ 90 372.569 null]
->> endobj
-8092 0 obj <<
-/D [8085 0 R /XYZ 90 372.569 null]
->> endobj
-8093 0 obj <<
-/D [8085 0 R /XYZ 90 260.487 null]
->> endobj
-8084 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F35 1248 0 R /F24 529 0 R /F99 5346 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-8100 0 obj <<
-/Length 1938      
-/Filter /FlateDecode
->>
-stream
-x��Zmo�D��_a		
A���R!$�
/��݇�S�$ncp�`�W�׎�q�V5�C��f;���33�N��� �O�����+d$���u`p��AB��2x�����8��
F�:���R
���*^��Oɼ����ӳ|
%��E1%:̗������'�tV�T!M8�_-�e=���v��b:��gt�#H�f�W��6�ʲ�v954�כ4������:�������<��X���.'N���}$���b=y�K�!����]5i
p��o���:��� E�G��9l��'�[�kĜ�ϋ$Ζ=���ٲ~x�
����l�M�~;���8�FՐ��0�1���޲����������T���ےB�����8���\�Ex~��ZKa�1Ҝ
�/EF�������%�jS����l
G<���)a� ���$�PH����P� ��(�_�H`:,�����s�h/*`�`�=�������~�dYo���E���-x B!� �
-f@}#����&��I	ܽ:Os qv��N�m���kS�jY:v���� �7-r��t���@J����r:a��
kJj�X6�c�J�� �]CV��ب+.>���	�f�܃q�}�ˇ؇[�}��P�)�Y�3��b��
C�s�A(��Qb�$�����'�ʐb�)
$��#�
$P4==VUl�
� Nǁ�)�@�ARx�bJ
` �-
�l�u�d!MGR�]� �S2o����
-�ɹ�
���i�:������J�mʁE�F
�6X��M]	7�.ٮ�������aϊ�|�ZA�
<Q�s�
j)�F�/T�*S��Q�
-�D=Y����*]�*χ�
-�.����1�eLI2�PSB�'
�4B���Be�P���Ȅ����а
,�/T�!��S���;��!x�P�*
���PiJ��uf�^'��΋�a�J\Gg�k��
-ǽ��Y\�&���"_7�7��4�Rz&����bL���
�8Ӏ� b�s�Ÿ�f&@�l6)Z�)����j�Uɡ>ѡ�T*�v�gTm���K���
cCB�=�up8im	8�
-�Ŕ�0Omu��}Bk �((<Kȹ
���hî�0���6
-C�R=��)�-MJ����v��˟]��񛚶IG�Af|?��k�`�JT��f�#���0.���(�F�����

-�f�J��6��(sAv��i�4w1V�����J�M,ޭ�lgh׊�:s_�����X�
�������@B�cV�;��I�-����5A0�L���ٲׄ6C�b�/������� �SH@`��m�,�FI�tz��rQ$�'vv�\��q°�.Hf��T�i��
j�,;
��
Zha�#��\H�
��Q��bϺ��Ě"�=:2{�f

����Q��c�N\��c�$S=7���%l﫝�:r/
��b��^
��#,տ>s���՝��2�u����
|斁�����

'�,c=.%�YM�j��&:��^�y^��}=�������
���
b�%��)!v^f�f��mĐծk��ކ��p�K1���`J�x�mw�;�2���Ǹs�
t��
0���wƸ6^���X!��~q��57�G47k�-Ǐ��)*G��֖��{
��� x���?n�pz��⋶
�e~ck��
^j�%��K�Q�r�E��>��`��� �d�,,Ę��e�{l�Q�)�*���I��2�]f-��.�u��}���󨌫�w?���\�q4�*�ظl1���J>P��?�x�b���Eu��Vm[x����ێ������ʸ�l*l+�z�9�n�t�wW�6��9 ۍ�᫸9��A���r�J�m�Zm��ӓ���Mg7h�r�
�}�wߜ�g�΋�Q�U�p�&$?
-L*b:O�3��D��R���}�>l��
��X��,�~��7�~�
-endstream
-endobj
-8099 0 obj <<
-/Type /Page
-/Contents 8100 0 R
-/Resources 8098 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8076 0 R
-/Annots [ 8097 0 R ]
->> endobj
-8097 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8101 0 obj <<
-/D [8099 0 R /XYZ 89 770.89 null]
->> endobj
-8102 0 obj <<
-/D [8099 0 R /XYZ 90 721.073 null]
->> endobj
-8078 0 obj <<
-/D [8099 0 R /XYZ 90 698.082 null]
->> endobj
-8103 0 obj <<
-/D [8099 0 R /XYZ 90 698.082 null]
->> endobj
-8104 0 obj <<
-/D [8099 0 R /XYZ 90 627.984 null]
->> endobj
-1834 0 obj <<
-/D [8099 0 R /XYZ 90 503.581 null]
->> endobj
-290 0 obj <<
-/D [8099 0 R /XYZ 90 479.984 null]
->> endobj
-8105 0 obj <<
-/D [8099 0 R /XYZ 90 367.732 null]
->> endobj
-8106 0 obj <<
-/D [8099 0 R /XYZ 90 306.233 null]
->> endobj
-1835 0 obj <<
-/D [8099 0 R /XYZ 90 180.584 null]
->> endobj
-294 0 obj <<
-/D [8099 0 R /XYZ 90 156.986 null]
->> endobj
-8098 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8121 0 obj <<
-/Length 1466      
-/Filter /FlateDecode
->>
-stream
-x���n�6��_��Mj�W�2�[��z�{H�@�h[�,���,�CR�-�Iݵ��0yD����[z�{9�u::y!��(��7]x�$��a�xW>
q�q��c�B$
-�?�vz�vzi���O#��G
�������G�% ~�a�"���Ck�S��w9�}�wy	�B!��y��eZ��\c*�����n�(J�����r
__��J'e|�:��qy?���o3��y
�i�O&
-�q=_%�r29-6��
N�7��N������zb�l
�����JD�x!¹Q��F�p�����f89_����f0��,����Ƹ%6ޡf�
��᠀�V��Y �,��������L�n�b�ύZ����CBę��"�L8�(����rٰ���Ȼ
���4ݻ
g�A?`��G
�*b��Bn�nBNA7
1�H|��&��w�A����kpB��zX2�;t1J�Z����8L'/(�a�b��m�~����9�i�,�=Ȃe�߰A�
��l̎���F
-q�ڛ5��
��u\���<nLo�*Ns��.��]Z��<r[
�dFZ�1���'�"%;��L�?�B�I�
�Y<(�o�#y��.��P�����Y�(������φ�"M
w�4�tY_�4�M?�c7�~���,pn����p�
��
I;Y��5��vqq��j���9
-qw�^���� A��
K�DJ�O`�xQCy�_صu`R�UFǘT
aRz�E)�D>i�9��9d����
����:�tW�[��8�~��~^?+mgW��P܅-��
C2ܖ�2��/�&�^郵���./ԛ2�מ�"�k�t�u1��k�׽��Hh�(�j��
jK���
(�I����6h&�G���܍Qz
���
G̬�1#�]��K0�� ��D���4Ӊk�Ou5/�[�y?fr
���#��S�
�d�x���D�5�N�am���5`e%3D�I�MC?m��M76
�[�I�q�Y�
�B�R\�{
-^YVT@#�/[�0�t��N

a�
�s��Z�
2
���ll�m��1}k��\�v�ܟv	tTJ);�E�љ�!�d7����$��P\p�q-`�/2�U|7���@�B���@a
���c�
��X�h�h�)�
}�:�jgPZwŋBDyi?5��W�Rۅ���a��ٟ���y��q�k \�z;�(�k��@��&V��H�Km

��
��i�Rl�RJ�J���Z�7�- -bF�$�
43��p�)��l���]�ڳ;�
ߚ�u�V�����j.T�
l���m	hse��MV�m
-��Jg�M6ԕI9�"5|
-)���#�v.r�n�j�O0���0�'���'�}=��I �x��}f������D�����[�m揁~�����&ζI�)����Hv/���n}��uӱ��y����#��Wu};99�m��Ηh�s�)��#��ռ.G���(���ѻg� BK�
-endstream
-endobj
-8120 0 obj <<
-/Type /Page
-/Contents 8121 0 R
-/Resources 8119 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8076 0 R
-/Group 8096 0 R
-/Annots [ 8107 0 R 8108 0 R 8109 0 R 8110 0 R 8111 0 R 8112 0 R 8113 0 R 8114 0 R 8115 0 R 8116 0 R 8117 0 R 8118 0 R ]
->> endobj
-8095 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 8131 0 R
-/BBox [0 0 428 280]
-/Group 8096 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 8132 0 R>>
->>
-/Length 858
-/Filter /FlateDecode
->>
-stream
-x��W�j
1
��)��H�7�9,�B���
=�
6�MJ��
���<�gֻI��
aI��؟%ْ��%���Zi\���$v��)P���N^l@��.�_>п?�G��!.�$(�[� ?IB2N�eA��&��D���wQg��`hُ�)��fA"D�΂���Q/%���#ؼ�@Vk�TJ)8�U��F����^\�0�R����  Gx��`-
f4�G;��
.��"�@��8ڱ&���:�?B�)�v
L��ъ���՚e at eYm�z;�tKv襀0��O�;L��v��@=�DS �
-�T{[4�c#�qڥ�RA���k�j�~�V%G��YN�w:
������'
;�
-xL���-Kq3�]�	�u��.��N�_Ϲ��@cTNb�t�'YӍ�����y'�r�99��g$
���է�Y�ޔ���v��Ӿ�q@ςh �t7
���E��d��Q���s�]D��f
�s5������Q[��r_��0��^�Pm[�8�7��I��pͦm¾W�T<[���)u��R�ΊT�<�7�h�
�
-=R��T'荲���RCT��s at Ej��C{O�NŐ����\��1��wse�~�32�Ia��Fi2�U)�\ڎ׭N�L�
%�Rf
&إT��<�B�T�=��2i�'�@�腫�����I+O���{
Ny�ƤxY�
��\��;'iGM�
-uR�҉cOτ}?�5Lr.v�Of"�
�~_�4�w(fC�8�>��0�	o�����Yޞ�
��=�=��d�焨��8f/��[��d���x�,
觌��Qus��$%gdJ*���H�,5M��P�Ӕx�V�������p;EeL���/���O�p�IaJ�W��g�4�n�
-endstream
-endobj
-8131 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-8132 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /QOUXJC+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 8133 0 R]
-/ToUnicode 8134 0 R
->>
-endobj
-8133 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /QOUXJC+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 8135 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 556 500 778 222 667 500 584 278 611 584]]
->>
-endobj
-8134 0 obj
-<<
-/Length 8136 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š�2v@�2ݸ��>�&ǩPc��·o��B
-�'�Ϝ��<7f\E��f��*��hG�|s�DO��D2zT+Sx���Q���45f����/.����I�==DB���ir����ץŧ�f�MdV�Du-4
~��ξv�8�����qݎ>�7�s�$��GR���v�\g�U���?ꈌ�W�2��A}w.L�~z�I
(
t��,P��r�4�@n �Pc*A
-�UΠ3j��T�zPR�r^E�ƫ�O6ʺ@2A3%�J�I�#�a?	���؏k��9�~p��׃��H��s���W�~���.��!�_��S�e���u���K�]�n���
-�
:i��н��l�Tx~�-ʥ
-endstream
-endobj
-8135 0 obj
-<<
-/Type /FontDescriptor
-/FontName /QOUXJC+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 8137 0 R
->>
-endobj
-8136 0 obj
-364
-endobj
-8137 0 obj
-<<
-/Length 8138 0 R
-/Filter /FlateDecode
-/Length1 2792
->>
-stream
-x�UV
lS�>�����y����8!�N��$|혆�$�ˉcbyS�
�QA��(t
-Z�<K������j}I��6��M�M��ne��	h��*���u,����������Jѐj�H��hx����!����s�Ȗ�ԯ����c�#�.<��o��ԁ��6T�X����"э����g�������aB�W�
"������
���
�|؄
6�������-:K��
tP>�4�&�uCnr��	B�A]Lu6��aTI�r���������td��6U���N1�wB������ns
�1� 6�L�L���}��0�:��p�j��^���J㮢˨�n��5zG�2�&�
���@iR��XX�
-���&�d�K����[l_���R�vd�k�,��h��/��I�����='3#]���Rge텥e�gM
����@	
!^

`JŜFE8%�UTr��'
-������sּ^�Ǵk�J��Ù�q�/f��`��/�[�>g�$�����J��i�-�����!�;����
(�۱ ���D^�J��X����
��1/6Me�O&"Da��c�Qn��
F���ӌ��������z�6f>��
����F�=�Q�����J��
���x���o���^cZ�F`����/���������r3ͺ�y)����ʹ3�GR}jSv�����	]z��"��bE_�-�����%-�A:�.
俳���e�5�F��B�
���CH��h��F���dTY���Ψ�������PƳ]�;~
m���
�NC˖��n,�Z��a�N4W�KX��su<�Y��]�L'f ��\�z��M:�F�n���|�s[G\�օBޚ@��˻��؋�GV�t��xw��hw��@��*
[�h���F�8��
�����ks�ǣ�m�ׂA��}��bh(��
1H�\���S:��@���<��Pd��᥾ VS�2�`�kա�;_瘟_�}<6��7
����Uls�z��G�F��
@f�QmL�=�
��L�8&��(��Z��D�l]���)���l�;�k�_��~��x��:������d[Q���pT��w��#o�Ë������4��I��F�1��r*�$Q^�7g��,v64��N>��O���}u*��gࣖ�-���L�?�5����ɛo펰�3� � '~.5��?	ƶ��f�f�T�Z2ҿ���u�~�J
��ܾ�;J{�K��{7l{z����'����A�MC_6)D|��%�
i�ߖ0.G�x}>�y~�@U�ek�zF5+�&BU6���ﯫi�L�8��"7�֭Zj�X6;J�Ѿ5���h�n'��_û^�7|��VW_L;i�˧�����������|����{_��΃\GM�y�f��
G���u_~���	���M���
�����"~��w�����-i�6A�<�6�����ռ���;4;pQ)Cൣ7n��

���ܽ�oUg��槧OMM�~�3����
�u�~��%������oϝݵ�-EW�N�N�)��P��0w�)�Q<���M��	�tf�D��[ �+MJI���.�^��Q���j���<@�Ӗ�����튼��������x|хyƥf��
(�Σ�zN��k���ަ��i�0(U.���Mk/�O.r���X���ڪ�ա�Pq^�M��{�.���Vi���H�$j�s勩T,���t��j;s��ˠo�
-%��D�XD��{�U�=3[؞�v�8��
�CE�����Y6ѽP�2�)�A�
�*��$�A0&�{�X
#�����"�&~e�*x��ܜj�I$I�o
-��&
�����n�jB�e�,�{%��#��c!q��#c�ߞ]�^������?\��׹��g�b՝�,��dF�|�t���ᙙ
-՝��GV�	�`'H7+!
h+�
-
R�Jb���k���'��G
-AY� �k0�S#
�5��:Mx�q&|�3���_!$;��[]୬��B���D��1�7�u/+z�>O(�:
�@X
xK
-x#
-�A:�=a	h�"�H��
j��- |S�G*�D
�i6��D�,��b�J?Ư�&D�)|�lPI�� T�f
-endstream
-endobj
-8138 0 obj
-2095
-endobj
-8096 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-8107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 402.366 210.438 413.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_ade93b18091b0c0255f9edf5635671e5e) >>
->> endobj
-8108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 375.731 210.438 386.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_a5d81385e212eb6794b6eccbff7d75f40) >>
->> endobj
-8109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.253 375.731 310.781 386.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.559 375.731 421.086 386.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 349.097 188.47 360.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_a2a9693ada9db53099a8f7bc3b4e4b14f) >>
->> endobj
-8112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.286 349.097 288.813 360.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 322.462 181.277 333.366]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_ac4ab32047b258058ceaeede8df7a39b2) >>
->> endobj
-8114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.093 322.462 281.62 333.366]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.827 210.438 306.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.408 295.827 240.863 306.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_afc08222c6448a38d82487f73f0d2cd4a) >>
->> endobj
-8117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 269.193 218.186 280.097]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_ad381baaa75c172ef8deb34e3663e3ad6) >>
->> endobj
-8118 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8122 0 obj <<
-/D [8120 0 R /XYZ 89 770.89 null]
->> endobj
-8123 0 obj <<
-/D [8120 0 R /XYZ 90 420.729 null]
->> endobj
-8124 0 obj <<
-/D [8120 0 R /XYZ 90 420.729 null]
->> endobj
-8125 0 obj <<
-/D [8120 0 R /XYZ 90 392.361 null]
->> endobj
-8126 0 obj <<
-/D [8120 0 R /XYZ 90 365.726 null]
->> endobj
-8127 0 obj <<
-/D [8120 0 R /XYZ 90 339.091 null]
->> endobj
-8128 0 obj <<
-/D [8120 0 R /XYZ 90 312.457 null]
->> endobj
-8129 0 obj <<
-/D [8120 0 R /XYZ 90 285.822 null]
->> endobj
-8130 0 obj <<
-/D [8120 0 R /XYZ 90 242.195 null]
->> endobj
-1836 0 obj <<
-/D [8120 0 R /XYZ 90 153.753 null]
->> endobj
-298 0 obj <<
-/D [8120 0 R /XYZ 90 145.198 null]
->> endobj
-8119 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F24 529 0 R /F110 1507 0 R /F68 3032 0 R /F22 2996 0 R /F75 554 0 R >>
-/XObject << /Im10 8095 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-8164 0 obj <<
-/Length 1400      
-/Filter /FlateDecode
->>
-stream
-x��X�n�F}�W(�R@��;I�(�6q�\ �Qч80(i%1�H�����;{!EҔ��J�>\-gwgΜ�p����j��dpv
0/B��қ,�{�$HP�M���`��pD0���`?�7���b?[߯�<�o�&�<�����v�6*-�2����ϡ~\�V�l9
�|�������9!�#�H
-��"-�@
ʢJbҳI�����On��:.��
-
�E�W�y\*��1F��7"EB�Wj��!	}�ά
�!¢>�J��/'����#N.Pz����G��a����B��x�j���������x"�1�%�l���
,Cl����W�^c�ݮ�j���B):�JܐEЃR��[��t��5N�y/�xc�,���M±�&��&q��Z���i&�H�cF���W^�>�
H�QD��E�1|�<�)�54"ͱyY�tg��E$���z�����Q�4è���q;�_���_'3p


��[U���U"����~ה��Z��H@
)aӹZ�WZ�|�4�2B�
��7���(�ܦ��G;}���
�=$�GQ� =Z������W�!��ERrO�J$%������lC�ԹH��*���=���~���E`�r�5��:`�#
(��h
-I���
y\�
�����f�p��4KG'�]+�;Q=b�������Nm�*���]:�)�tA�K͖:k7i�
��Ï
P��tMO�3k�[�����ǩ}BQ/��{z�mg��M�qY3�3|�~�=	(�`B
��I�DJs7X�;B��^�6I+�.sܙ2�?�:��bu�ȳ� B�����ӳī )V���t������7�c�PkG"�J���
-�E>���F�����dBQ�'Gv�n�������ۯ���|v�P
@<I
���Ao��Ry1+���������h��4�Nxp��h%�iW囩ҭ?
|շ3���[�2�g{���u��s�ݸ��i��T�U�4�fI��
���K���T5{�MDP�|:�l����
w��&��˝Ҹ2��d��)v� o��7z�����PѬ��1�!����1�d�I���j��
jTj9��^�	����/g�3ȝ�,�L�����~
�W�$�5[�SM�Vi��{뾳G�ɿ$�{��
�#�4�֏W
�L=֨4>R���]����

hmT(CA-�,:}N��]7�,vEI��
�S�\8|����/��=4oC�D�lDH_�9�*���e�{c&Lʎ�13���}� ���T'_^���? ������}���5��;m��
�g�$A\4
1Hn�U�y�ҷ�5�{i��^�#!�j�*����l�[*]�Y�yȮ�
�!����/�6Y^�(�ܘ+2T�=V8
-L����	� ��i?>p�ĺ�M3�H�
-endstream
-endobj
-8163 0 obj <<
-/Type /Page
-/Contents 8164 0 R
-/Resources 8162 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8076 0 R
-/Group 8140 0 R
-/Annots [ 8141 0 R 8142 0 R 8143 0 R 8144 0 R 8145 0 R 8146 0 R 8147 0 R 8148 0 R 8149 0 R 8150 0 R 8151 0 R 8152 0 R 8153 0 R 8154 0 R 8155 0 R 8156 0 R 8157 0 R 8158 0 R 8161 0 R ]
->> endobj
-8139 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 8178 0 R
-/BBox [0 0 222 220]
-/Group 8140 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 8179 0 R>>
->>
-/Length 492
-/Filter /FlateDecode
->>
-stream
-x��U�j
1
��)��H�J��C��
B��I)I��!��c�Nfi�k�
��5�'}���G� �
�'�1<�~+��<?���ᥝ���W��U>���=�F�+B�A�
��!>�w\h��~��Q��c4����#�
�#��T��IqT�� �0�ߌ�53G�i>�1�����(lƣ�����C,������lm�.�wv�--BE�0���b���.?��g��&�y���
gݐ��X�1�v��`�O��R�Y*��/85�8%;��8��"3y�m �
-�4�z����E(ry�ҩt�닛�k�
����
s��tl�Z]-�6��9���=V
- �E�M�Z���"�i%�ӸR�6�
�p����‘����>��Yf�؋HKi&��wzX��SkGa�E
{��m�s�:w���g�¿�j�<r��o�

-tR��ɒP�.%��zB����:P�T��vp�bٶ��aԾf�.��f:��[�-���ߨo�
?'w�
-endstream
-endobj
-8178 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-8179 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /BUOLZF+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 8180 0 R]
-/ToUnicode 8181 0 R
->>
-endobj
-8180 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /BUOLZF+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 8182 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 667 500 584 278 611 584 722 556 500 778 222]]
->>
-endobj
-8181 0 obj
-<<
-/Length 8183 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mk�0����
��E�gD(ۋ�~�m@LƭP�D��o�;l��ǙI�1�������ݤ/��~���2ݜ&��u��L����zTs��˶�4������.�����L
=DB���r�������O��<��HvI�4�P�{Q�Iġ�������2>��DX�%=Zf��){��N�jD���DdͿx������r!]��$)�&P���,P��r�
�@]*c�@�]N�b� *@
(�@9�b�]ĝ��2H&�C��_?�~b?�'�WT ����8�
]K��L�e�Z�/���W�y�˸��
�_�'������¯T��^��ߧ�>U���0�a��,ݧ}��*<��qʥ
-endstream
-endobj
-8182 0 obj
-<<
-/Type /FontDescriptor
-/FontName /BUOLZF+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 8184 0 R
->>
-endobj
-8183 0 obj
-365
-endobj
-8184 0 obj
-<<
-/Length 8185 0 R
-/Filter /FlateDecode
-/Length1 2792
->>
-stream
-x�UV
l��
��/��p�~5qB��8	I ��cB��8/'��
�M
BpH�G
,��Q(h��Rh���MT�KZ5��4m�n�@Lt+��`�N@'`[�|��>'�,������~��
���"��������o��x��뇷
�~���0ކ��Ⱥp�C�_�%$�
seL(β4���F�7{/)π��KãkÄ
� $D�EÛ��i&��-��8rX?�J` �֢ͳh-�L-���uvu&��5b]�
b]2y��WQ�Mkq���i/�lp��F-�$�N��|5SL��.�����\��Y�f&f&��I��Lt
Z��p�6�=�7.g��]I�Q��fU�t��e4M�=ʋ����$���P�m�IJ�ҕ<]���ؾlIy�"�m�X�TQF��X'],d˓�
-ZB�&{v�&]���Pff�%���
z�uI��/0��O�(%*��0QO(jɭ)H1�/X�z�
S�Y*
-�Se��

��]�#�-rP�b�9��y
��֐�Pl�7LݴhA�8�W/��:܁g�O�z@�ݎXul~!
-��Ūg���pَ��i*��db�R���Ӕ��J��p9�T3>�cdlb�h] P�]��̇_���4�pK�W�hwx�ˢ�{����!�r���>f�ט�h����wq�˩ �����ޜ
�6s^��:v3����T�ҔdiR���DoB��#���9[�Wk
-���`�oIsG��K��o��Mi~K��Qֵ 1C���d�g1���-�QYa�1�0�3*m���-�y�sd珢M�i'��в�m�
-jW={���MU�b���X
�g&�y8ӉH�6�,��|�V �GV��dm-���ցa׫����:���..:��đ4]�?��=:��;
-�n�\���`���F��ذ�
��T����r�[�m��^

3������8�2� ��H�8��9������˂�
F6o�
-�� ��ڕA��|���~9���hG�X\&w��V>���]��?z&"��k�
��T�����d�c2!i
��>��e�pd��u᪟ȐB�������wM
�KwٻO`���? S�(����I��͝�rG�&jw��=�F:�h	��O�M���Ym�
C����S�%�U:sFz~�bg}}��k�cY��:UQ�W{��H�p:�	��R�M͔�٭���
�e��o���;�Vϼc�gN|_b�k`�m!��F�l�ʱd�%V9k[��!C(q�whbdž�(�v/
��ٰ�١�;&O�����ܛ��,R ��E�K�����"70�#}2>to���W��T����ʴ�P��g���k��}�#;Ov5KM�u����͎ׄbzc�wMt��/�A'_�S�
y�Zxk���|����O�����m�m�z+� ����y4c]H��i��
�C��xp��ty�5�"O���}�]+�ݦ��'�K��:cMe��PK�(7˦��p�/��Jb�fF�Q�<W�!�J��<���ZO�i�k��:��l��-��s�U�=3[؞�6�q@�9.���bf�D�BTʜ$�4�eY�~t5J[~\�"�A3^>�����
��
�cW��s_�
��r<�<��u䘎��lQA��{K+�뾼@ys��6:��
zH�����h
��B�U:��B\�6�����ٽ��G��4+pQNKൣV�d7p7��{z�N�Y���������SSo��\zs�+n
x��ߺr���ty��gv�}G����cr.h亣���bQ<���N��"�f�D�z��/�ŋ�r�'T�$�
�6��ܳ�bhI,�/y�����*ێ�O@�T��$	�� G*�M:�h�
-�A��jB�e�L�s%��#98�B�Ri�f�ϬI�x�R�[\�����\��sR��NB&�D2��pK�L:_��L�����㟕}F��q�Ŋ��B���Ա��m������
c̑P&(��j�e�HF@�|��`�&�'F���
��[Y)�7����'ҁ�
|+���\�ݙŃ
-A�g�ˊ
}�] �u�NA��ޒވ��|OX����ܡh A�ce�<��,a�
-~TA���0]���[駸56��L�f��H�t�h
-endstream
-endobj
-8185 0 obj
-2094
-endobj
-8140 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-8141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 391.847 204.161 402.751]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.746 391.847 314.292 402.751]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a3b132b18d2e068b93f1e066cca596309) >>
->> endobj
-8143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 364.272 204.161 375.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.225 364.272 262.537 375.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.307 137.492 305.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a8189a0037b35722e1406700cc44d1e19) >>
->> endobj
-8146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 267.732 145.24 278.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_af4ab2701bb30c5fae7fe82b8a0a25481) >>
->> endobj
-8147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 239.784 179.076 250.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_ad6d0f3a9509993f4064a876841e24db3) >>
->> endobj
-8148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 212.209 178.518 223.113]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a28e363b5aa72287de3d6633631885818) >>
->> endobj
-8149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 184.634 145.222 195.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 184.634 169.85 195.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a6050f0724f65d27096693d5ca74f498a) >>
->> endobj
-8151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.665 184.634 204.977 195.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 157.059 145.222 167.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 157.059 168.176 167.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0c2986aa0fafaf4495abeb9c678eb794) >>
->> endobj
-8154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.992 157.059 203.304 167.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 131.9 148.995 141.545]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a9e757d2cec432015a32ad41c1158f391) >>
->> endobj
-8156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 118.525 161.013 129.429]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a5e82ce331187ceffa3d71586cf6ab43d) >>
->> endobj
-8157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 90.95 145.222 101.854]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 90.95 169.701 101.854]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a962fddfb4d1f0a4815fd08ab41789d4e) >>
->> endobj
-8161 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8165 0 obj <<
-/D [8163 0 R /XYZ 89 770.89 null]
->> endobj
-8166 0 obj <<
-/D [8163 0 R /XYZ 90 408.683 null]
->> endobj
-8167 0 obj <<
-/D [8163 0 R /XYZ 90 408.683 null]
->> endobj
-8168 0 obj <<
-/D [8163 0 R /XYZ 90 383.098 null]
->> endobj
-8169 0 obj <<
-/D [8163 0 R /XYZ 90 313.767 null]
->> endobj
-8170 0 obj <<
-/D [8163 0 R /XYZ 90 313.767 null]
->> endobj
-8171 0 obj <<
-/D [8163 0 R /XYZ 90 284.458 null]
->> endobj
-8172 0 obj <<
-/D [8163 0 R /XYZ 90 258.609 null]
->> endobj
-8173 0 obj <<
-/D [8163 0 R /XYZ 90 229.308 null]
->> endobj
-8174 0 obj <<
-/D [8163 0 R /XYZ 90 201.733 null]
->> endobj
-8175 0 obj <<
-/D [8163 0 R /XYZ 90 174.158 null]
->> endobj
-8176 0 obj <<
-/D [8163 0 R /XYZ 90 135.885 null]
->> endobj
-8177 0 obj <<
-/D [8163 0 R /XYZ 90 108.05 null]
->> endobj
-8162 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F24 529 0 R /F110 1507 0 R >>
-/XObject << /Im11 8139 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8214 0 obj <<
-/Length 1736      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_!`�&�3�7I��
ؒ�H��Y�aڢ�%��"K�$7ȿ�Q�^�8��CQH:��G��ܝ������?f��S�Y>�]�Z�K�ǖ�}��Yl����K��߅]������7�������ˈ�O�"Z��<a��чO؊@��ˆ�º��,N\����6Xp��;�vg��A�h )u������|a`�{1�>L
��R�A������e��G�`�OJ����g� �.Wp)E.�քp��ᾓ�&O�q�,H�5dc���J��ⴌӅ~�Ri�AQ�riDI#��\��<��p]\���z`�I���׺�YZ�����\��^ �]���B��0F�*|���l`K�ͱ�.�|���oa��b��[�;�]�7f�gYb�w��'���R�c��+c�؄Z�$�W[@\~
�8H��	��y�YPe\|Ę�ȘA�u���
�|�\��ߣ�gGqgi����>K�2�F��\͕��]�߸w�&�#�}��`ā�����'�
��x"�0����=4�r�N�R�-G�P.�c
9>�K�/zE��=ů^Pެe��F3ۢ�
���ݧ0T9 �\h�c��O��v���f�a�b.�UI)���Ҫv� P�+Uĥ�ŘQ
�u��Q�
�� �����x�C�N�}3���˪����ӿ��
!�Q��N���:� .���].�ô^�͉
�
���;D5A�����
��yv��P�¾��HK�� �
Q$�Tq��+���D?ã�u�4�6��^�^�	�_����Ȱ�r��RМ���l(�,ȍ�{���	R��թ=H'h�|�$�Y2��BW��P��
�ư5EY�i<�E�5��ذSh� n����a!SU�*�jg��\w�%I6��}�TEl�����Qy��d7ٯ�	Z.�"�����
-L"|�R5�#���"!��Q��;��ޭ��� .��9�.��Ó
�쇀@�ޅ!��?&u$�*���C��}�������p����|�5>�+�
����n)
w*9��@<��b�I�d �3�!�{z�.oU	y'/���i(�a.��Tq9-o�Sq�g*Ϳ�Q�[��U1H���ޫ@�=!,�s,�C���&�V�
0<x�o���^)mSvX�
$\w@�;�
߃��۝��|��4��6���&
U@w�u�ɵf!(��߷ׯd{�����&�MX�9�֣Q����>���0C�ٯ�'U=�|ޔ��o��7�
a�u����P�í�b
z��C]>�o!s���9�P���@3$�E��&�v��@�'>y:���{���z������1�4��� �y�a/Pi�
-s���a�.����8��
�׺�s
-�aǢ��4�z'��]�ف	�'��C�˅*'��eb�.��\0�
�gK<
N�o�}
cj�l�,.b��
�%��o�<��'\@7����,�b=·�?�� ��^& ���M��}���I�-NQ=�`[��[��Y
M���N��ץ������p�s��={���B�z2}�~\{��Y

a�G�f,���g��Xm�aɃZ���a��8
-��
4���K�G�C�����=���$��!L�
�:�Տ�
#8:[1�$e��	蛴
-��uOA�������C���B�?�
�6]�� �ɸ1����W$h���'԰�^���u��~5���
�#5u�ڲ,����h�Y2]�0[��v��C�ִ1�������;W�'�[���c��
-endstream
-endobj
-8213 0 obj <<
-/Type /Page
-/Contents 8214 0 R
-/Resources 8212 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8076 0 R
-/Annots [ 8159 0 R 8160 0 R 8187 0 R 8188 0 R 8189 0 R 8190 0 R 8191 0 R 8192 0 R 8193 0 R 8194 0 R 8195 0 R 8196 0 R 8197 0 R 8198 0 R 8199 0 R 8200 0 R 8201 0 R 8202 0 R 8203 0 R 8204 0 R 8205 0 R 8206 0 R 8207 0 R 8211 0 R ]
->> endobj
-8159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 708.331 145.222 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) >>
->> endobj
-8160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 708.331 162.099 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a9e757d2cec432015a32ad41c1158f391) >>
->> endobj
-8187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 680.714 173.456 691.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a3b132b18d2e068b93f1e066cca596309) >>
->> endobj
-8188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.954 680.714 197.934 691.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_abf7fe1e5877e16e79af6547d6f94e16a) >>
->> endobj
-8189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 653.844 173.456 664.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a3b132b18d2e068b93f1e066cca596309) >>
->> endobj
-8190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.954 653.844 190.333 664.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a6d27040392d25412134c73a31eb623c1) >>
->> endobj
-8191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 626.6 150.493 637.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a81b221513817c76fd3b8fd7dc404244e) >>
->> endobj
-8192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 309.107 171.792 319.638]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a9d011856be076fcc65af3573afec9639) >>
->> endobj
-8193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 281.49 171.792 292.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_af4621fadbf4b3fd92473f5a2a6eda95f) >>
->> endobj
-8194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.608 281.49 272.135 292.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 254.246 171.792 265.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.532 254.246 223.339 265.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a5a9d9c2da332d66b23af51d8977c5d74) >>
->> endobj
-8197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.154 254.246 323.682 265.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) >>
->> endobj
-8198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [129.96 227.003 176.015 237.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a37513851388458132d6e62bab159032b) >>
->> endobj
-8199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [132.73 199.759 172.899 210.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a076f21f664d835ce30c0ea4a4835732a) >>
->> endobj
-8200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 172.516 171.792 183.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.532 172.516 228.957 183.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ab0669e0954d13a7fb911459a42de945b) >>
->> endobj
-8202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 145.272 171.792 156.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.291 145.272 218.716 156.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ad2f6505da3244481da4a207f727147c0) >>
->> endobj
-8204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 118.028 171.792 128.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.532 118.028 224.156 128.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ac3cebc5fc52879ce539aaf78bf585f1e) >>
->> endobj
-8206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 90.785 171.792 101.689]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.291 90.785 213.914 101.689]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_af03e6b7aee6649e2eb37ad0e9afc8c62) >>
->> endobj
-8211 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8215 0 obj <<
-/D [8213 0 R /XYZ 89 770.89 null]
->> endobj
-8186 0 obj <<
-/D [8213 0 R /XYZ 90 721.073 null]
->> endobj
-8216 0 obj <<
-/D [8213 0 R /XYZ 90 697.647 null]
->> endobj
-8217 0 obj <<
-/D [8213 0 R /XYZ 90 670.404 null]
->> endobj
-8218 0 obj <<
-/D [8213 0 R /XYZ 90 643.16 null]
->> endobj
-8219 0 obj <<
-/D [8213 0 R /XYZ 90 576.036 null]
->> endobj
-8220 0 obj <<
-/D [8213 0 R /XYZ 90 576.036 null]
->> endobj
-8221 0 obj <<
-/D [8213 0 R /XYZ 90 525.275 null]
->> endobj
-1837 0 obj <<
-/D [8213 0 R /XYZ 90 447.119 null]
->> endobj
-302 0 obj <<
-/D [8213 0 R /XYZ 90 439.508 null]
->> endobj
-8222 0 obj <<
-/D [8213 0 R /XYZ 90 327.401 null]
->> endobj
-8223 0 obj <<
-/D [8213 0 R /XYZ 90 327.401 null]
->> endobj
-8224 0 obj <<
-/D [8213 0 R /XYZ 90 298.424 null]
->> endobj
-8225 0 obj <<
-/D [8213 0 R /XYZ 90 271.18 null]
->> endobj
-8226 0 obj <<
-/D [8213 0 R /XYZ 90 243.937 null]
->> endobj
-8227 0 obj <<
-/D [8213 0 R /XYZ 90 218.419 null]
->> endobj
-8228 0 obj <<
-/D [8213 0 R /XYZ 90 189.449 null]
->> endobj
-8229 0 obj <<
-/D [8213 0 R /XYZ 90 162.206 null]
->> endobj
-8230 0 obj <<
-/D [8213 0 R /XYZ 90 134.962 null]
->> endobj
-8231 0 obj <<
-/D [8213 0 R /XYZ 90 107.719 null]
->> endobj
-8212 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F11 613 0 R /F22 2996 0 R /F75 554 0 R /F24 529 0 R /F110 1507 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8238 0 obj <<
-/Length 1527      
-/Filter /FlateDecode
->>
-stream
-x��Ym��D��_a��D6���"іC-E:�C|h��/��E�%����׎��p�J��^�<���33	�6
�~�=��-��BJ*��k/�!����>���`N0��y@��Ity
P�g��Y����U
���Y�E�6ݸ�۴�|��E�e0��O�(�˗���ѾIW&�+)C�J��x>��b�nF !�H�H ��U2{�{k���È���P-J<N|�ޫ�o3�6���~�����V	A��;=˷&]�ք�\���D)ڛS�p�zC��뽞
 �*�bw��&߸m��VX&��ɣ2�=�o����,�����b[�����Ԙ�o>~W3?��[ F� +d��$�dQ�$�ޜ(��_�r��׋3Bpg9È0���e�7���M��$͢�u��(]�Y��W�h�WH�I��?�8PHR�,�vG��d؂���J� ��|S�2��Q�z�
blN�@B
.�8=U�}�D��AV�Z0X���fZ�����@�@��ޜ)$Hx�W��2����@5|+V�vWn��P=7p
0!N���$�8*M��ƐY���ݖ� �՞��ΤQbj4#�z��]���\D��P�E�e��zǥ�2
-�=���S���P�m�:�E�F(q��8����B�
��J;�@	��4�F�
 ԥ=�k��382�@
E����?,��\ʿYg��J�c��Ǝ�$��$b �� �����S����$
�
��-�ϝ��1FB�~���������̆���z%'!n
n�5l��ɕY�����-�$��Dl�
����l�o�h`���G`>TM���1�����γ�y�4��8
��?���`Lc���w�")���.^�]�nn��&h�B!h-N�*���%�
ꝹJ�DZk�K�4;� ?Z
�`��R�ʔl��}�C�M��µ������M+>�"gRL#dpMLj����5�1H�|
-�

->Ӥ�3l�p?9h8
 R&�f�S\):�
�`�sV�:�U�;�9Q��*7e���4���MQ at 6�Z\ pi��6]���XUЍ A}%����CN
��@Zʁ���BT�ㆀ=�!p�?
�-���UGz8(~u�
-WM��hm	I*�S at h���8	'�#T��)|7
-���*�k)�P��!4|G���V���=���
r%���nLD4?�iR�Q�ic�ӔcfA���h��]� ��f�y�&s��X8�D���Q�
_
V^d(P���Qa�t�U�OYt�gRt�R��
����� 9L��SL�����4�H�d& RӚ�KC���Dc��R�$X'z
-V
C<�ĸ�k�$�Ƶ�z
��뻅�C���N���,���AƇ9�B��Q�
9B%ԏ{��`]�_[����{2�/RJQv��b����4�M��������ɿ
��
�F�>���g���
L^�����(�3 �iJp
�O���eVծ�o�
�F���MY��~S�t�V��Q�u�"���؞l��nC�n&��&K
��)m� 2�A��D)Z��^W�ݍų�yO3 ��w�_%>�A
-endstream
-endobj
-8237 0 obj <<
-/Type /Page
-/Contents 8238 0 R
-/Resources 8236 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8248 0 R
-/Annots [ 8208 0 R 8209 0 R 8210 0 R 8232 0 R 8233 0 R 8234 0 R 8235 0 R ]
->> endobj
-8208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 681.861 180.54 692.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a0b8c563512e846bce0d716066f049fcd) >>
->> endobj
-8209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 681.861 265.759 692.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.492 681.861 365.374 692.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 649.232 178.239 660.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a95e8dcda2a5e9efd485371dad792eb71) >>
->> endobj
-8233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 649.232 263.458 660.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.191 649.232 363.073 660.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) >>
->> endobj
-8235 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8239 0 obj <<
-/D [8237 0 R /XYZ 89 770.89 null]
->> endobj
-8240 0 obj <<
-/D [8237 0 R /XYZ 90 703.221 null]
->> endobj
-8241 0 obj <<
-/D [8237 0 R /XYZ 90 703.221 null]
->> endobj
-8242 0 obj <<
-/D [8237 0 R /XYZ 90 668.859 null]
->> endobj
-8243 0 obj <<
-/D [8237 0 R /XYZ 90 613.347 null]
->> endobj
-8244 0 obj <<
-/D [8237 0 R /XYZ 90 562.19 null]
->> endobj
-1838 0 obj <<
-/D [8237 0 R /XYZ 90 488.649 null]
->> endobj
-306 0 obj <<
-/D [8237 0 R /XYZ 90 479.091 null]
->> endobj
-8245 0 obj <<
-/D [8237 0 R /XYZ 90 397.163 null]
->> endobj
-1839 0 obj <<
-/D [8237 0 R /XYZ 90 297.58 null]
->> endobj
-310 0 obj <<
-/D [8237 0 R /XYZ 90 288.022 null]
->> endobj
-8246 0 obj <<
-/D [8237 0 R /XYZ 90 192.147 null]
->> endobj
-8247 0 obj <<
-/D [8237 0 R /XYZ 90 140.691 null]
->> endobj
-1229 0 obj <<
-/D [8237 0 R /XYZ 90 67.15 null]
->> endobj
-8236 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F11 613 0 R /F75 554 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-8254 0 obj <<
-/Length 820       
-/Filter /FlateDecode
->>
-stream
-xڭUMo�@��W��[›��u���4�RJ��T��m����[�g�k'q���{���{��A�w�`0�
%8QL��=J�"�R�j��C�Dt3>G\L����������9
���C@� �
H�
�+�����}��A�ܥ	�a��U�5 -��l���"[��DJ�A�%�
%X�(���p1�U���Rac�{�I�/T
K�׸ �
-|jك1�8
yDi�<��� F
&�A�`��6�.��*��؄�''�|��Y9;�"_J
F�a�$"+�}ל�qל1�
�>����j�-���`���
ɰ��c�ke��`ˈ��pt �$��'{�p y?��em]
�"*�4�G 8$Q�� �D!zƑ -m���ȃ���
���(,i_O�ȸ>Tǘ����)�O��_�i�?���*�3>F[,�~盽�th+[�Yl׎CE��b,
�T�X����[0"I����έ�Nnj�rn����1��,���u��ɽK��A��� �Ɗ	�EV��S�oB77%͙
��li
����\�x>?`�Kl�����~n�e-2�zn��N���L�p���*-���{ӹi8-r�C'��m�38��Nv��GJ�N��	��z���>q�{j
-��qdH#�?Ӥ9�{�����~����

-
@�� �
�Z3w�=w�ݛvc�����m��`/�t2��
Ĭ���P`��z�ϭg�ht�'�W�zI���sZ>Bj�-��g�a1��)�bNIxe;�x\?װ?�v[x���N�"��zy2�>�V���E����ch�D�
�i`�E���^<���7�
-endstream
-endobj
-8253 0 obj <<
-/Type /Page
-/Contents 8254 0 R
-/Resources 8252 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8248 0 R
-/Annots [ 8251 0 R ]
->> endobj
-8251 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8255 0 obj <<
-/D [8253 0 R /XYZ 89 770.89 null]
->> endobj
-314 0 obj <<
-/D [8253 0 R /XYZ 90 721.073 null]
->> endobj
-8252 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F22 2996 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8261 0 obj <<
-/Length 667       
-/Filter /FlateDecode
->>
-stream
-xڍT]o�0}�W�m 
���G�
�5U�N�Z��VM��@
-4[������d�����{�5A;DЅ�9rf
 ���E[��0���
�s�`�=!�����>^-=J�<}}қ"^]'�E\���4��$۵�IV���

-BW�e�g�Ct5[ �
-R��P����Κ�&����X,W�Y����"JW�'��z�=�rR�,<���`�&jB`.���O5}&�0�`�y��%�˲�y��zH�J7���
�l]���R��ם��yv�T$l��2D�s�@�Ƅ���
-�o��G�fMѭ��!}��eB+�ƒ�i&�>�g=xMb�N��[�]��jut�J
�!�!@դ�
��`�I���aw�
�.�@���0}�jD���^.N7���߫fۢFm#�P��|y�&k�

�x,��RNR
5fA�|�
������]t�s3"�yt���Q
�ص�olRm��$�q���3�,�L���&t���c=v:BR����
�bt`�	��X�ؿ���2�X/���;߇�`��Lbn�-��
�����,u����m��{���i��'�
k�����
&&����j��h@�:��[�e�
�F����OUu��f�/�Rg;���y(L��'��Ef�-�$��y68q��t}����D;w���ܽ�ߙ�`<v��i�
-endstream
-endobj
-8260 0 obj <<
-/Type /Page
-/Contents 8261 0 R
-/Resources 8259 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8248 0 R
-/Group 8250 0 R
-/Annots [ 8256 0 R 8257 0 R 8258 0 R ]
->> endobj
-8249 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 8264 0 R
-/BBox [0 0 456 704]
-/Group 8250 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 8265 0 R>>
->>
-/Length 1619
-/Filter /FlateDecode
->>
-stream
-x��ˎ�6��|
-����;x1 at Q�@m�"�b���(&�.���/�-[
O�Ul
�/���O����rQǘ��Ao�s���]��H�����̓՟��������	��T��kk�~Td��=�������L;%\{��Q�NY�|���G
j�F�V;��.�d��^�m�u��nk[trw��)�����tC��_ԛO�����'���1ɑ������o����u�� �
	
���
9SzՇQ�ò�^?���v�jgO��A�q"o��˗�!�����mJ���n�z�n/��+�6���Iq�ܑ�ǽ>F��bt�(�m�(������X'J��(�Χ��Y�7a�IB���7m7y'$zh!
�<Q#4�0��
-�k8���Q]i��b~Sw�8"z1�q>
���W6w�TW��Yʓ�8
�ȥ����\I�%�t5�<GX�����WYR؛�|/t0�YuZ�|LR�D�j_'T�6�Ϸ�R-u)���%B����"�w�̎
��tb�g�s]�j7f{�:�ũfu�Z�uE�s��@�>o�7��<�Y��0M��Xmgo
�5(k�Q�B���@&d�*�h�+8��
��y����%�s0)x4��t at B�N&x	8����0Gyl��'���0
8��
�ݭ�+P�䒹5^�(O�j5�%W��F�=	�Q��v~�
}Ƌ.���
�"�nh���q��H�؊6�.O�`"��)����rC�-
m��F��D�ƑE�ACA[��̆m�
�|4Xz�������`�R�l
�
��-"�d[�:�5��\�R���#��Kr�rm�y�"Z���u���͸/��cϻL�Ǭ
vb�SNj�SG��
�:�x��]�M��홀;�7����jġV�u1�L�/��d|>D85���b+�P��
}RAK
F�6��9u�1
���J��C4)��]u}�T��
L�׹�bi��
!ր�r���B�l�
-��V��Y�lSi��W&Nm.����Z�s=����ƶ�
Q�\
��`������n��"�%��.:S���ǰ71V��Χ�F
�͇%����P.�)	"�H.���/�l�.R
���4���
�ݚ��݋��ā�%�:�X�y�s ����չ��}v�t��
��Oj�ckH��N��ݶ�0n���
� ���9��d	ެɂ7v=��3�����$�nR�L�9�
�kl�
x�l��<#�
�c��:h�f�`C�
�0���\
v��<׎au�oa[�ظɧ�=.�<�V;�ݫ̛�f76%��j8'�\�)�G����|�5���z�)M`b@��n��\M
-͸E��S�_(��	$�].{I&�,��$�'�4�e��T�Ĉ�i�R5h��J�M�T�,�����z��m=��>�#i������	cu&��_4��Kꤑ����(�^��c��V�V
E�#�"ɛ *,�I�6("M,M����Df	��J�"�����f/`��aQt�w�w������6�\21t
q����yK�����r�n�i�a��N�j*��g��جr�.+�Mr�y�0�UCW�Ho�)o.뼟`� �����(��
-�L�K��wB56+ �TdS���Ex ���l�e]r��e�ƕL��KJF�z�Z}�����v;�v�ܩ_�$T��
-endstream
-endobj
-8264 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-8265 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /OQNFDR+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 8266 0 R]
-/ToUnicode 8267 0 R
->>
-endobj
-8266 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /OQNFDR+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 8268 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 611 278 556 556 667 500 556 500 584 278 278 500 611 278 584 722 722 495 500 833 556 778 667 667]]
->>
-endobj
-8267 0 obj
-<<
-/Length 8269 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š��t@�2ݸ�N� �
�B���oߘ?L����x>=��湱���w7�
���q�L7��ut
l�3�^#��
�9I}�e[V�OIU�����m��d��
�X��
��^���|���m�h$��,�kf���^���
����������2>����1��
-s�ɵ�JI���fU�:!k���ʺ^�.�s��eEV�J�)��P��
T"I�4�]N�b��T�:��@2v1��.�����6�PW��ГG?��T �I���0'���[��S9~9���1~Ss��8��8�D��<�	?���:���]���3�'�����$���_��W�a���˴o�}S��9����۹��`���ӼW�� � 
-endstream
-endobj
-8268 0 obj
-<<
-/Type /FontDescriptor
-/FontName /OQNFDR+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 8270 0 R
->>
-endobj
-8269 0 obj
-395
-endobj
-8270 0 obj
-<<
-/Length 8271 0 R
-/Filter /FlateDecode
-/Length1 3280
->>
-stream
-x�UW	p[��eɗb[хodY�(z�e
lj|Ɩ-+��o9>�ز
 !�9 B�
$G`�B;�5�Bg�L��tJ&�9;t�b�I�I��S�}�H���}�������}�c�l
��1�����d,e/f�ir疜�fO���%�m
����K��\�&ԧ����E��.$-�2����!����1��S��
3�
�0�5��Cg7c|��3l`�΢�Yt�n���i��8�_,Z�[���q�匑ASF:���4�%g��^F||[�����E����j`�����{Îh�4���<��0c�J�i2�
��c�X
�E�q�j=���\vk�&Q�\Ci*�ɫywh�"9�j*.Q��
ɩ9���jr
-W��TUר��ݙ�[k*i��[��wK��d[q{��l���HOLIPk��L��
-��zKiX�����ֈ�
�3J##����$9��
�B��ũFz���$ŵ��%�4����/��Ec�ï}hj/��m�]-
!i��>�pm���@y��Y��Ɲ��
�K�
�D��x]t?���F���->?�t2%�����?��
-���Js��`B>�.;el۽gjf��tS �Ը��g�g��c�t�=�j$�?4%d�yT�?���GC"��w���>�Z�����"���T����](	�gf��R��M�A�]<8�̧1�y�<�bq�
��G�C\$]<V�p}�:0h�U��i��
-ȟ�y�����:y��k10C���r�YLfX��Hqr�&�E8
��Y�.
n��2n��{g�u[�Q�Kv
-�Y�����񍛎?Ѻ�S��=]�xf!��`g:ˆ�:�[�vA�Y���?D�RkAG���wm�t?�
-5�"^���
;���J�/���OO���� ����-�_И�
vvb��:h$^{"�
���H0p,^�����c�U"��Kc�q:�rD΋�V�՜Wo�q���j�yV�pc���ƣ{�?�[O�M�<=�����?��*��^=�ܘ�ScJ�z�X��1���/
Ђ����M~��w.t�p�]`2B �t¦X]�O�-������U��� �6ȏ���ˊ�pÑ#,�� ������J�n�n�
V;���n���%+�n�S.��9��1s<�nIgH�b��D���е9��Ǯ����������Ӷ�j�>K���P��3߽���6�շyci��{p(�YN�ƒ���p$滈�f�)U�.�)����V
�����x�����#��'��(ѪWIf�D�/�y`�����
J_�����j
v` ;�36�� �]���Փc;wm
Z���P�C~�#��]����K��k0@� �2
��<�	XI+qCaY��L��G1E�k܍�z{��e�w�ԭ�"լ���[F��<��Sa�-Hћ�k[�B��
�V�oD�~�W�7чL}n�q+��[����x�T������h.|�~���'Z��bUI�$Qn����G�8���g������T2�g1���W��߽�����	��h���Ƅ<�d4X��ıv��[3k�v�i'�K
r�	{�c��Q� 7ϖ�t&��-|��i~^�PzW�
-��� k
c
�[
-V�
:G�ζ�e�ᮭ��Fz7�6Y�+�ۚW�h�9���u�����l�*&��7)uڃ��O�r>;MkQ,We�C��=��W�L��L���s�7:�
�/VO‰����&����F�.��o.�h@u�������)��zQ�U������Frw�{�'8�8��k<_ڦ&�K(i�����8a
%̈́'v����~���ၭ��&�����p,�>��-|�*ygR����߽�g�u��'�|�1"�xa����^�Y��q���B'��>[������lq���tT�_l
T"�lG/ �)8i��&~��
-4&%���k'���{������x���g�}@?8������Sw
��U<D ˁ�Y�ݮ������UU��
-h�y�6V�m�_|�
�����]�=�u/�nH/���[��W٨[_v���s��
��m��
�R��U�M��7�Y�����Q�W��c������R3���=��w���
A ��qe*�
�I�],wC�6A�|U��eѨ�(
���W���p�i��$�)�ٴ�Q��D��n�
Y1�2M�
�d�,&��\ؖ=V��؃l�ΊXLug\6ee
��\ᩪ/���>���x���r��bB�I,nZ��Y֫�����������+���`}���R;kTyY/�~�q!��5�ef�3��[β@�ס�$��zѧ-��BV/����Y_�*�F1N��]�w�?3��.��x��>��R�
r
�����ɥ@�L��^i��A'�m�*|�N�����}������;5nR��A�C� Wsd�΀����Ko"�&~���9�(�Mƒ���o�D1��^�N}
�ϕq�R�X���0��
-endstream
-endobj
-8271 0 obj
-2442
-endobj
-8250 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-8256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 86.288 200.694 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-8257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.331 74.333 278.806 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8258 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8262 0 obj <<
-/D [8260 0 R /XYZ 89 770.89 null]
->> endobj
-8263 0 obj <<
-/D [8260 0 R /XYZ 90 104.381 null]
->> endobj
-5310 0 obj <<
-/D [8260 0 R /XYZ 90 104.381 null]
->> endobj
-8259 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im12 8249 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8296 0 obj <<
-/Length 2041      
-/Filter /FlateDecode
->>
-stream
-x��Y[��F~�_�S��LO_�{j�UN��Jb{'e_�
-Ih�
-�ؓ_��/ @H����[=�}�;�
ػ��������R!
���S؋�B"����������

%"*�S���~?}�~z��]��^�uA���% P$������[��=����'�i�q��7�n/~�����`S̓�-��
-a�E� B,�WYW��
-쯊�.b���y��]}J�{����&���
*',���$�5S�ׄ���F���_��~��|����q��#=�2D8���H����:�
�4�(�
EB9��T�Ny�8ܷLVyy���٤����<�D��QD�sр�����D0�L��;���<O$�[�{�#����
�9r?t٫yU����E����th��@9 
	)�4�u�q�q��MU�
���|��4�g�|�|�L(�?�Ӆۛ7���<a� �g�!_�˫+
}_�PI��;�>M%;X��UZ�ک���q�G��~��]O��o
1Up<�/����.��
-#���fR�������~�z��Hpu5/��2.�r :�m=I� s�`e�,�齓�G�Y�i~g���w;5��V�Ү揍f�,�����I9!����Y
0�W�	�n;Ip-�1�5�[�.
Gd5��B,�_���1��Ȕx#HF�
���'8��Q�K����m��!PU��Ɖq&�69�ć��� �C��̎.
!h��͏��!(�Z�e�tg7�jgo>oʤ�w��Z���
`���7
�X/^�N �m��lꍔ����a[�;lK�
f�Rs� E��i<�\p'�����`3����r(�{��	i
�V�w٪p�ןH�
50�mV�0,?f��b$���l�m��~�:em�ژR��)�LUo��%��.p��-\
��V\5����X�(�j
�Ii��
�Su�q�0�g�=[������'e
-�i��t�S�]�����)�
�����:_ ��A�U�.�
�L��K��.fIYB|�h��N����Xo�mU�V5��p
��̄k$N�'+��W�S��Rl����)��m'(v�BX"��$�3��!�$ }
U������X���]8���;���՚�l��c��N�ɢX@����Sa꧶ҫ&|h5ě�������F�B�YƜ��M�ŴI�/ �5{aK�eBD�vt��F8 ��� ��� �VQ� U��V	�{�V�acQ7]ya=o
� ��@�#:y��Rϩ�	��'g�Wu]�s
�č�V��~l�t8r�P�
�
�/���D�Y��s��^<m�zGm4;%�s+0��1	�N�8�L�ʀ�|Q��zX��/�G�D�;�k�����/�`ʧ� ���c�$⠱��.�T� R�;6�HIՎx�(�gER���$8��I m�v�V�~
-ڑT� ?�$��N���U���	2�� ��s`R
qț=L�vr��\�P��\�rZ�Y\U���	�~
��bQ���g`�I�YI�
�L���z�O��N�� g@����x��������U�v���	��B[�cb���~C!���"��Ze7hJB�j�?VX�$���p�
�ݴg$@��"�OB��g��Zu��, C� �Ӆ��N��%
�0Q�ᨠ='N���u�MK
-�O'�N��A�;;�
D>� vmXޝ����3�ߐ�f�ꖅsa�^���!�k�0���"_�I�+�:��K��u8��
�ܟS�L�Pc�Ie���@M�E�]&��Իu�͂���E�
�W/lQ	5
-ua�-��i
���l�Mb��geZ߯���*6IC-9�ÏW)P�B��F at z�p�}���=�6q	��6Cr�::�
���"��;9Ne�(��`EԼ����{p�Ӛy�
 �# �`G�8\���+��ٸ=�Q���[���J��'B���~��f���N7ڹD3]�jC���6iJ_����/�����P��6�������r���CP��;yo@����l�mj����k���ݰn������
-endstream
-endobj
-8295 0 obj <<
-/Type /Page
-/Contents 8296 0 R
-/Resources 8294 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8248 0 R
-/Annots [ 8272 0 R 8273 0 R 8274 0 R 8275 0 R 8276 0 R 8277 0 R 8278 0 R 8279 0 R 8280 0 R 8281 0 R 8282 0 R 8300 0 R 8283 0 R 8284 0 R 8285 0 R 8286 0 R 8287 0 R 8288 0 R 8289 0 R 8290 0 R 8291 0 R 8292 0 R 8293 0 R ]
->> endobj
-8272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 695.361 164.879 706.265]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-8273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.307 695.361 370.84 706.265]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-8274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 656.221 189.793 667.125]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 645.242 184.386 655.17]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.123 645.242 330.345 655.17]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-8277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.157 605.126 314.915 616.03]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-8278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.946 577.942 304.125 588.846]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-8279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 509.169 260.646 520.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fee2c86f5b4569065c5761ee0c88ee2) >>
->> endobj
-8280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.422 482.358 197.715 492.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-8281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.857 482.358 337.39 492.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-8282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.336 482.358 513.996 492.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-8300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 470.403 141.915 480.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-8283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.581 470.403 256.056 480.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 401.63 198.373 412.16]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a66d27330f68cd1e721e3253daa389416) >>
->> endobj
-8285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.71 401.63 296.185 412.16]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 374.445 213.247 384.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-8287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.584 374.445 311.059 384.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.376 374.445 400.851 384.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.408 347.261 202.203 357.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) >>
->> endobj
-8290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.511 347.261 300.986 357.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-8291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.404 347.261 458.937 357.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-8292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.374 255.2 270.91 266.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-8293 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8297 0 obj <<
-/D [8295 0 R /XYZ 89 770.89 null]
->> endobj
-7073 0 obj <<
-/D [8295 0 R /XYZ 90 633.986 null]
->> endobj
-7109 0 obj <<
-/D [8295 0 R /XYZ 90 594.846 null]
->> endobj
-8298 0 obj <<
-/D [8295 0 R /XYZ 90 527.807 null]
->> endobj
-8299 0 obj <<
-/D [8295 0 R /XYZ 90 527.807 null]
->> endobj
-8301 0 obj <<
-/D [8295 0 R /XYZ 90 419.81 null]
->> endobj
-8302 0 obj <<
-/D [8295 0 R /XYZ 90 273.754 null]
->> endobj
-8303 0 obj <<
-/D [8295 0 R /XYZ 90 229.407 null]
->> endobj
-8304 0 obj <<
-/D [8295 0 R /XYZ 90 166.764 null]
->> endobj
-8294 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8324 0 obj <<
-/Length 2643      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���S+�d��X��ċl�ԍݢ@60h���J�V�r��
)�D�b������̙�9�O#�|Jp��ً��痊%Iers��(I��$��$#.�#�1
\
	
��Yz{5�xPN�=d�Ez�&�[��o���2���S������AVUyY
?������΀T$�s�x�D6�
���˫��E�-�1��E�ۛ��o���pD��\��`k�3&a
	��
�s�	<�y2"!��?OӪ�c�


d��4�3��>���\��m2F����~�����3#�8��@J'��ه�8�@�	F���{h�p��s�\���
��$�0��3�(0���F�p�7�%F�x�`��l0��tP��7j�ҷ��E:�,�
#�
�k����ٺþl4b�}a��Y�u�|C6��AyZ�s7�um:
�/�lb�JF�i$��=��9�
�H�z��k�ߤ��y��#F\��;�o�+��$x�z(�Ӊ�~Hm�C�Aӿ��
c���nWC0�b�� i��8�wL��wLˎ��
����;��&]�]vVK�6��d�ns�y�d4c7������]�k�/��uMӃw ��h;p\�E�& ���y�W3��`��j�.������8ܪ�Y>M�u��l��,���$����Y
�:���8
����&�}�

����x�
&&E���Ӄ����b�Z�����<+�]k#դ5(Z�b��K{?�NBo/.�_=�o/�ݼ����}����7���_�����޽zws;�����!h6&��/��L7VF�#�U2bQ";{�ay��(ՐD��y��
/��r3�8��*�E�Z�@����A�%����3�k�M4	�o�˩�����Y6�9�iNa�@���R�
o�&u�ģ�)5H3�z���7����	i� a'�H�8ֱ��<���~X3��S��8E�\n��B����n����C�mR F��<�����$$�X�
�w�ĉs��d'��
��8:|�&H�S��9�`�DOx	���1 �d}G�14�)���i��P�w��
-3 $����y#� 2c��R
�K��<��jD��ȂU.�.�ӐG����!��ή[�����X��Ӿey~�|��΢�"0�����mXk,j4�B:�m#���4O���Y:o�k�#�r�îVEOz���ӻi�_'������2<_l�[�n�v[����]|
-~~�x��
�c��:�
д
xZ�1�dM�E ����i���v�
\�;�*�Kp~ �mMW����E��!�c��f�>`��歀~0�
�t���=�_�:��s
��
������R�\,�q=�ޚ���|��C���0]f��|����2˨
5�uou���R�ˮ���e�xln���*Ͷ)vkze6�J��^�
-V�够T��
-ߕ
-�n�b��se?�^�s	)UDζ���g;B�݈�]N�|>�ǎ�
��a�waf 5�C!�{`R
2y d�6vZĤ�c����VG91H��Q��V�!sv^�t���5�9h��m�]/g�����L�K#�R�os~,2\����sHiR�q����)��	= %k�>�UHS}p���8�H`������sYTu
-�
���F�=��
��@
-�
��g���-��
-f�I�1��ՑpAUK��W��ݷ��{'\
I�
�هi�4���6�
�����*���2L>V�1����G�2���+��؀�*��*c"\�VU��z��,#����Z�1�>�
]��.�WՓ�s[m�
��`���(�'9�a�"��
��x��֭`��!�Y�p���H�Y�o\��~��
�ф�o�h;�%~��N�7�p�_��=OU���,��d_Ӄ
��D�� 
�$�Ȁu	��/4J8���	̠P�i�c3v
-�b� z����G��Q���$�#���@�%�u�[4;ŀ
{����u{�bDG1��A1pou��{n[�b�;�hk{�Q
�[O����|R
�U
ēb�<)O���b�_1�O�����;)"���9)r�,��L��
�Q�?��r�"[�QP�@τ?� �bZh���HH���
��	 ;�,XUF�f���������f1�B62k�$��#I�U���[:.��~g�xW�Ӿs
T at 2 �7�$U��-Xk5&�p6�;� 
K����8�  �X`�-�c
��64
	q��a����z���
-���*ޗ����c�GB
-{�����1&�a}^v�hw�?5sQ�G4R+�c�
-�
�?�~'��h
KD��Ma��.NhQ��
/X�`�Q
��lăDluVm
pT�;��'�C
�G�����1�Q��`ח�f
n"���W�W"�"a[g�9q\AI��3���*�v�U���g�!#��ч�r���5mִMH�6�ܩlq�0[�ބ��&U�8������G��7 )R�
����wLn���-���<��z�/�Qe�?��ߦŲ9o�?ļ�<�F�Z-��
�u�h���'��_Ϝ;V� +�
����ϟ�-?UY�	���&�y��m�
-�,
ױB�?u�"
-H68
-L���� 0∉rU�u����������%/K x�ӌ��8ǂ
-endstream
-endobj
-8323 0 obj <<
-/Type /Page
-/Contents 8324 0 R
-/Resources 8322 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8248 0 R
-/Annots [ 8306 0 R 8307 0 R 8328 0 R 8308 0 R 8329 0 R 8309 0 R 8330 0 R 8310 0 R 8331 0 R 8311 0 R 8312 0 R 8313 0 R 8314 0 R 8333 0 R 8315 0 R 8334 0 R 8316 0 R 8335 0 R 8317 0 R 8336 0 R 8318 0 R 8319 0 R 8320 0 R 8321 0 R ]
->> endobj
-8306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.546 511.626 152.146 522.53]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-8307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.739 464.422 513.996 475.326]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_adaf83ce888c996163559b520ebda628c) >>
->> endobj
-8328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 452.467 145.33 463.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_adaf83ce888c996163559b520ebda628c) >>
->> endobj
-8308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.841 452.467 513.996 463.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a12e89691311b8923ae33e930a7c89f4b) >>
->> endobj
-8329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 440.511 146.075 451.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a12e89691311b8923ae33e930a7c89f4b) >>
->> endobj
-8309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.247 440.511 513.996 451.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_ab156f789e720f2d04086a672448ded40) >>
->> endobj
-8330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 428.556 139.791 439.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_ab156f789e720f2d04086a672448ded40) >>
->> endobj
-8310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.301 428.556 513.996 439.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a1e3eb354a88609b46573e1dc2ce6dba9) >>
->> endobj
-8331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 416.601 98.745 427.505]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a1e3eb354a88609b46573e1dc2ce6dba9) >>
->> endobj
-8311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [104.074 416.601 511.506 427.505]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a082d6ea17c164846898241075349cd31) >>
->> endobj
-8312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 404.646 494.06 415.55]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aa272377eb99f1a8b4b48114da9bc6051) >>
->> endobj
-8313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 392.691 474.869 403.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a311e87a81daa4ca81dfb5ff62bd29b0f) >>
->> endobj
-8314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.739 277.361 513.996 288.265]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) >>
->> endobj
-8333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 265.406 145.33 276.31]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) >>
->> endobj
-8315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.841 265.406 513.996 276.31]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) >>
->> endobj
-8334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 253.451 146.075 264.355]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) >>
->> endobj
-8316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.247 253.451 513.996 264.355]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a7cac2a7ab2e138c7c0e96354b32b0110) >>
->> endobj
-8335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 241.496 139.791 252.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a7cac2a7ab2e138c7c0e96354b32b0110) >>
->> endobj
-8317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.301 241.496 513.996 252.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a11a03a73950216b9010c2350cf5ea7e3) >>
->> endobj
-8336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 229.541 98.745 240.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a11a03a73950216b9010c2350cf5ea7e3) >>
->> endobj
-8318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [104.074 229.541 511.506 240.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) >>
->> endobj
-8319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 217.586 494.06 228.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a8669f7f8a54a22c294c94b36106edfb4) >>
->> endobj
-8320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 205.63 474.869 216.534]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_aef498310bbb162748eb0cc7c1bb07fd8) >>
->> endobj
-8321 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8325 0 obj <<
-/D [8323 0 R /XYZ 89 770.89 null]
->> endobj
-8326 0 obj <<
-/D [8323 0 R /XYZ 90 621.099 null]
->> endobj
-5311 0 obj <<
-/D [8323 0 R /XYZ 90 593.948 null]
->> endobj
-8327 0 obj <<
-/D [8323 0 R /XYZ 90 593.948 null]
->> endobj
-5312 0 obj <<
-/D [8323 0 R /XYZ 90 393.687 null]
->> endobj
-8332 0 obj <<
-/D [8323 0 R /XYZ 90 389.204 null]
->> endobj
-8337 0 obj <<
-/D [8323 0 R /XYZ 90 188.035 null]
->> endobj
-5357 0 obj <<
-/D [8323 0 R /XYZ 90 164.855 null]
->> endobj
-8338 0 obj <<
-/D [8323 0 R /XYZ 90 164.855 null]
->> endobj
-8322 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8356 0 obj <<
-/Length 2968      
-/Filter /FlateDecode
->>
-stream
-x��[k������B@�V��<ɡ[h
$��m���Xp�\/ITHʎ��{�A��H�Z1-�� J
^�9s��sgf��ÄN�������u(&�
Ln'��2"*���ɻ)����wh¢ Oٟ����ۯ��}k�]}}{���-:a΀"��,VW����~�nB����m��H.𹜼���m��=_#��w���1:M
-�R��M�&J�ʻ<)���5kY!�tX5�O�*��9��},�u���1�W�|�Kw���<Y����+�ƛM�����^�����W�x��_�ǽ�?S*��L���M���K�S��6�E�fk
�<0&�d<"������6q�!5/�h
O�=�p�i�[��E�Nj�}+�,O�
�j(��\��o0 Q�9%8�gIĴs�f��4��UR&���iѶ��ٲx��4��Y<
�U@��4��Z�
�&�RDS~�*Z�a�Qs62.elFD���Ό�L����6p�x�G��@Ĉ�m�n+µ$��?E�>�
�����ɀ�1	4�EG )���H�#
�
	>n,���eu��P͟:��ڇ�K8�l��G
&�q��rhl��C��q8$�Υ�MI$Y�b-{�4{�A���͠�;_�T^��CG�����}o'�a
z���#.(�H�#r��;���@s
J�DE�
r�B�cRn�uw��SgL���1���e�M:ܔ�U
--}�Q��+�b�X$�C��C2ΈT���/���
-NDU�2�.��.���AT�Be��ѵ�BT��
������ؚ�a
���Z���᪄4�;^>�E7:BF;�k���K�{�<J�8�/����PtXVv����j����@�H�
���^�����ͨ��
�힠���a+�wvb����)6$`���S����&�F�x����m$x�X+�v Ѽct A#���R�`U�3��@0�zAL��C@���t
F��d
�0�st��
�m)�%��"�\�@G�]�����da��
��>�˥�/���iWq	Q=�At�Oq��(^ϥ7v�+��ᜪ��s���L�}�lv�w�
9; t�h��ٜa�M��T��V��[�`H����a�H+��S�+���pM��t��G��8]��
-YH�_�3�\p_6�i|���
?e��6�]�����ŧ

�hU҂Օ4n�B�ۛ��޺��xƩ/��/�oE�HQ�?T�lE'��!��I�ؠ�(0>����Fr$w�W�[�����g���
�՝u�E2��~ 	�A�̣���=T-�E%�bop�~H�+_W��>�h�(
���G�ru�Y&+7���<JWN���b���;����}�$zw�-??%y|�:�����W?l������
/H�>��Rd@������-�o�m����L���Mb���z�F������Z�
�HH_^���-�tU�]^���qоrK@���,�x��B������p p�Kܮ�ÐPĢtG���V�
8
�
S�Y�
�΃N�����s��?��c���9��2�sz t<��lƦ��{4}yL�d�8o��#	��	

��p��������|������Cm�xo����!�T��
9j^p���@IF�fm
G�Fju
��c�
83�)B���gCP2n�B�,�i�G�x{j ��ۏ��e�.�М��µ�'���N"ժ-�!��﫲nȨ���
1�Bg
�΃���L?E��*ҳ᪖����m�$�f��@�v��(��(C(�hL 렅�j#��
Q/�Kt{
�-7�����C(5P_���=D�F����5���Ջ
��\;�/;<�t�q @���
��ImF�A`9�EH���u�[�,8S�v�7#R�t{���3lW���2_n�������7f��HSSԳ�'nL/"Ԟ֮g�n��g�	;czڿޥL)

#*���Ƥ�31
p
-��Ec�ڇ֔�
-����V�x�)
������ڭg�n 4��b7�$�pˍ�d�
�
�
�W�2���$�Kfs�S����Į�
�3;;7��K�N��֯���6�A�ˉ��;���#aka��r���&�n��m���n�.]�e��
ƌd��Ws��%�;��2]�?�j�B����:�^K�Ԭ
Tk
-�"~�{H�{��
�m��}*�_�+�1�v���V!�lfR��U��]A���n�y��ntn��8��\f��.}��:����z�P��ͨ��Ϸx�
!���y0d��=f
{����WZ�6�<o[��C�eu6*��&X-R�)eO�t��I��Cv�
M���o��YM�ܞTcR˒A[��������U �}y/�PyϏ��r��彆)w.Γ��(
}�[
4�=����_�K5�[V�C:��:*�v
������G�>��[��`���|g�]�����
�2-���K5>�4$�(��h|
�� �\ۖ�_�^��쳗���3)�n��GV�
��y��~L� ����c�A*M��$���M�ik�@���#E
l��A5�ߋ�iʚ�<�_Ά���Ϳ2I���A�H �R�#~x��V�myp(��eW���ay�yM��]�tni��~�FO�r��[��`ycw[�;��������
���[�����M%o��r��}�w0[w��T�+W��k�9���B���e��1��-�:Nk��q�8ԛ��U�]�Dg�t�D
��<�.������=�,�|̒ol��f�*
�`���A���_�L'ݚ�
;U��=��A�Ɯ˩O�d�Dr2��e��,+wFZnU��#�q6?�^���8n�L6?۠�l���b迨5
�!R�����U�B�nj�Ƶ�Y=�x��JL��`lgn{����,�Y
-7k"��S�K�!��浻��H򿘸��&^o��1�ԯh�i1d#��;l�6�����v���
w�%!�j�T��W/_�o?��}E������PO-=VY^��У-
-vG�!��?/GR�
-endstream
-endobj
-8355 0 obj <<
-/Type /Page
-/Contents 8356 0 R
-/Resources 8354 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8248 0 R
-/Annots [ 8345 0 R 8359 0 R 8346 0 R 8360 0 R 8347 0 R 8361 0 R 8348 0 R 8362 0 R 8349 0 R 8363 0 R 8350 0 R 8351 0 R 8352 0 R 8353 0 R ]
->> endobj
-8345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.078 472.159 513.996 483.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a47224e5fc07b3798eb4f2f5837073894) >>
->> endobj
-8359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 460.204 141.266 471.108]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a47224e5fc07b3798eb4f2f5837073894) >>
->> endobj
-8346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.352 460.204 513.996 471.108]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_abf9798785b87d68e6ff2db95401536a7) >>
->> endobj
-8360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 448.249 130.323 459.153]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_abf9798785b87d68e6ff2db95401536a7) >>
->> endobj
-8347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.88 448.249 513.996 459.153]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ae0f8501bc09bd6e6247c5d92476a03a1) >>
->> endobj
-8361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 436.294 140.536 447.198]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ae0f8501bc09bd6e6247c5d92476a03a1) >>
->> endobj
-8348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.708 436.294 513.996 447.198]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a02d8b929a48de1c69e0e0d702359ec53) >>
->> endobj
-8362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 424.339 134.842 435.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a02d8b929a48de1c69e0e0d702359ec53) >>
->> endobj
-8349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.825 424.339 513.996 435.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5ac67f2c19f4e1d46eb4d81e280aa581) >>
->> endobj
-8363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 412.384 98.745 423.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5ac67f2c19f4e1d46eb4d81e280aa581) >>
->> endobj
-8350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [104.074 412.384 511.506 423.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_aea16ed2cd1cce0f92352901ce90db8b1) >>
->> endobj
-8351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 400.428 494.06 411.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_ab2b9ec90f48c5472b85e3accc9cd40b1) >>
->> endobj
-8352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 388.473 474.869 399.377]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_ae1df79fdf94dd23fac62d57fe0681842) >>
->> endobj
-8353 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8357 0 obj <<
-/D [8355 0 R /XYZ 89 770.89 null]
->> endobj
-8358 0 obj <<
-/D [8355 0 R /XYZ 90 680.111 null]
->> endobj
-8305 0 obj <<
-/D [8355 0 R /XYZ 90 389.469 null]
->> endobj
-8364 0 obj <<
-/D [8355 0 R /XYZ 90 384.986 null]
->> endobj
-8365 0 obj <<
-/D [8355 0 R /XYZ 90 304.457 null]
->> endobj
-5355 0 obj <<
-/D [8355 0 R /XYZ 90 216.591 null]
->> endobj
-8366 0 obj <<
-/D [8355 0 R /XYZ 90 212.108 null]
->> endobj
-8367 0 obj <<
-/D [8355 0 R /XYZ 90 113.237 null]
->> endobj
-8354 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F7 795 0 R /F10 765 0 R /F35 1248 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8377 0 obj <<
-/Length 3566      
-/Filter /FlateDecode
->>
-stream
-x��ko����� ��F{���)pM�A�;�Mܢ����,�V#��$���wfw�Xr)��
-�/Mg��~���툎~8���ٓs#F�4ף˛QFGF3�8]�G�ƌ�'SF)
_L
��U~u1�t\.?��m~�b1���O��_\�s�_/�ɛ˟��3�B�)%V+X�����ֆ��� .'��p��b��d�
�?������Q����9��I��'��
-���Y��2���Rn�b�Y�{�z4Bm�h�ɔ�o�\� 9v\��=���P�+�\gx�����og
��s\��;�^��zCGs��ӈ���;�I.�w9���_g�-0M;�X����?@���ߕs���U�+r���K���"w[��{�#,(���f�u�*�B�_c�X /w�ܮ�U9��� �1����@��'_���������
��~}�_��"	Fd�*J��A�l�If�EI�� '��
��C�
I0��*�XOkj�\���t�@��%���45��U���y%3�dV�J��ٗ
gĪZ��7��� B&SjtD������΋הr/4�ww}��������<�"�8J,*KZ��%X�SI�l7�Z�
�B{�W)m!F�,ʿO��x�G�\�b|����/}�"B��:��m}��&̀#����01��Z8�?	�(�J'E��G��'�Q���oh$1B�Z at 1�"��*Rm�h#|�ަ�Y=j���`
- [...]
�#Ea�"| C��o$�M,|��Y7]���F8���60���i  e�Yp&_���W`�-�W��:є��5Ʉ�j��MQ�K���z�M2�dVEdX�Z�>oe{p�7N@�~.sO���~ND~n� �h<l��{�G[�'�Ԏ�t<�g[�9�ڔ�F�UGQ+���m�
a��m�ّ+�ϰ�>������̦"�K� �4����b[�Tp��>�Ō�&��->���pg��W�g��
in
j�,2�LEk�]HLc��y��`�

yD͙��Y�+�+�\TX���P�e�@3��/���F"C�oU�]=5D71:��
��=�����a�Cq�/4� � 	�(!�9Pnbݑ��+4������ڈ�Wٓ�Ƨ�q,���h��@s`��)��H����'0G0FHl6�S�%���&c��[�
{J@�;-��$�i���q���z�MN8ԝ��’kHٙ�
˦s�,]
�]��W��o|cc�K��B�5��>��&� �� [...]
-	�!���0sdmDA���i��iFXd;	SqH
if�c�?}��pt��AK��g[Si���\��	��r
.�v�h�W/\��
�Bu�#&D��Z��cL余�Z
���Sj� S]�
��%Ĕ���~���l��xw�˾�Z��6�鮽��+��s��=dS	��He�(Ȼ�J҅�P	q�ϗJ�V�)(p�C��|��i�r�ɦf
���Dkc�4E�6 �M��n
����
-B{��E���������Xb�ýX(ˤ��b�� �_���(4X���
ؿ{V�؜�m��l��
�
@�ǰ�_(<���0[���m_ޤ:��T��pkR�n� �F�F_�[�Z�;,&�Mg:}z@B��������
I$��y���

�#ɘ��1�|
Y��l��v��O�C|֝$(f]+��(A��0�����)�#H�c=��V
���#�Rŝ�(��t[͆y� T�%��
o
*�qYU
�D$�6��)C3��<r�l�
{��b�ƜRoN�Щ�ϯ�:��K�	�A�Ny�&������<����D��ړ�lG)��S8(WD)�>���
�W
!Z���r�6$������TQ�A]y
9i]i��q!��-0��NFxcU�8�+��)�gʰ
- Jz�*��bLN�%��L�h���������zk�rh�.T7�K�i`.M��5�"��S<��>4̞B��j�2�iczME�Nj��l�7j�x��;) �k���jo����SG�mbb=0�68���j�Xٝ9�h��
�;���z��r�P�Uj�Jj��9T�7
J�x��H�*'�QC�h���v~��)����^ug�|
�B�i�$�XcK��8�%�ה��G
�7��2.bE��3І�!ʄ��eZ)(�\��� =�&�e1��o����$��L�2d-��I�M��

}��tw�t��3U�)���\��
��e<Pn
-(74��
+�c�j��XͰKù
���pU^߯�5v.|Kw���[S.�p�{�0�
aH�X��f�=v�!�a���1N02 ?!��[�,` �>A�\{�'ነ��e̕C�bմ�����M�
M�$
\
���
b
,|$n~�"M��3�29��҇G7��pa�`���
��������p�(Q)���\��}
-
- *��;��J�=b6{24&1��6��j���s�|�+���Ew�S(��C�(�G|
-�jTR�PQ�b�Ea�!�|����$��Ҹ�)' r�ReL�0#8R�N���1�
`�CpV�O*`�n���g�W�V�+��͙q��g}�(�XWQ�9�E��ީ
-9,[;��l��{�~{��j��^.%U�+�_>b7�f�ߟ�p��)<�j��Q,�|٭���a9J��\O?��?۔��~����H��]߇��qտW�Ta���bnÄw�~��4fc�I���]&�u��b��P���减Ŷ�;d���6l�=��t�G�dwOOU�_7G*޹0��-��R�j�m��mZ.Kd�;> na��,�F�5�8dS�VD��\�P��
-��fI��Rl�h�* 9�<uƍwVy��*�I�bQ��!���J�T	
q����Y�|���mx
-�4$p��Z�$����;�� @K��� �M2�����F��_A�
R�ܧ�Y�l�h�i����аw����!� �;��	
 ��wĶ�
7�����!�1	qs�ck\���.wy�\3o|��aƔX��@u�jb �UǪ�� ;�\�\}��dȍ��`��D� gp���p�] =�2tG��
���@9����<
 ߊ���FX��w/�����],�v^��)0�8~1/b��
V޷��/.^t�亸�xeB�
����7���4v���a�7���‘��<>�sk�H"��D�/����<�� &��(�(_h�w�,߯c�|���aWA��K&
4�����-�>cm�P��A��
�h�$�3s8 �]l��U{V�� �6��
����Qs����(��|�*�e<_��c�x���} :�-�bW�K���t��j�cN-ֻ�!��sw�S��"vY�a

Ƃɏg 5̺s��:��+��8(��|]s����j+��
?$�����8��uT]����gC
-��_5[������'Of���`�����j}G�޶\[��=k&U�'s�2�8��
t�2c��h_��Ջ�ƓWb�}	
n&a��V�&
-endstream
-endobj
-8376 0 obj <<
-/Type /Page
-/Contents 8377 0 R
-/Resources 8375 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8384 0 R
-/Annots [ 8372 0 R 8373 0 R 8374 0 R ]
->> endobj
-8372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 74.333 211.952 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_a70b0fbcc1272e8bb764a95cb3f1e2d17) >>
->> endobj
-8373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.767 74.333 281.41 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8374 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8378 0 obj <<
-/D [8376 0 R /XYZ 89 770.89 null]
->> endobj
-8094 0 obj <<
-/D [8376 0 R /XYZ 355.061 639.355 null]
->> endobj
-8379 0 obj <<
-/D [8376 0 R /XYZ 90 632.715 null]
->> endobj
-8380 0 obj <<
-/D [8376 0 R /XYZ 90 530.278 null]
->> endobj
-8381 0 obj <<
-/D [8376 0 R /XYZ 90 393.305 null]
->> endobj
-5356 0 obj <<
-/D [8376 0 R /XYZ 90 372.36 null]
->> endobj
-8382 0 obj <<
-/D [8376 0 R /XYZ 90 372.36 null]
->> endobj
-1840 0 obj <<
-/D [8376 0 R /XYZ 90 225.519 null]
->> endobj
-318 0 obj <<
-/D [8376 0 R /XYZ 90 218.632 null]
->> endobj
-8383 0 obj <<
-/D [8376 0 R /XYZ 90 93.556 null]
->> endobj
-8375 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F99 5346 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F24 529 0 R /F98 863 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8397 0 obj <<
-/Length 2999      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�)+UE��v�j6oM�މ�ifJ%K�͊$*$��� /�hI)���'� �h4�t4HG�#:���?o.^]1JH��
�܍:22!J��r�a�
�|��n$�%,��k���n��t�
��x{s���Wtļ E�
-�>����Q";��:�G�
��F�\���]�W�["Ft�uc<!Ԏ
c�1�Ǜ��r2�Œ���ߤN�_����W�ewO����ˋ��_�
t~�5șW�}��.��S�d�-&R��/�z^���?R*�y�m���6�A�M�UA��z���f�.}�����c�3k:�2J��/����F&�zu�d*
�O��
-�Wt���ZV�v�7U>4��D�F`�%�+8�3.�C����4�x֔�_I�<e�H+�'9W�W�SE��1+��[KǷy�
-��Ŋ��k�]w�q�V���l�o�j��f�����.��������a�W+���k\��7Avo���
�1�'���߽�"3�Z*a�
7h^L��)�
I$�5�{}T�W鄩�tS:��g�W6���sn��2u�'1�pX� ?s*=mS�_���1��
�n�A#[�6�]S!�V_wa+����������
l}��"lab
�^"�z�u_�!7���������
f|`��[W8��b7�����$��ƫ<�B�#x�9��Tp_�j�}
���	�����"���[���e�o�V'`r��p�N�%�ۃ�E��aV3��;kˈ�6 at Vu��S�5�nz�Z:�V��h]��v���-��-~��hۡY
Wl���0����'���V�������_�ʠ�m4"�,s�b�;��e�� ��%��.�<�� ts^�E���,9���}^��"�e\΀��dٗ��O�7v{��
�v���#�Bu�"2IA<!Z���I�z��g�g�2�����rP�2𱈴
�FEB�5*�
��g�	�H�l5~�i�d�<�L58)5��Fɀv�B��\��h����cM��m^��I>���|��N
/
�P�R�v
�h�6t�{cDQ*
$;�
��q�O
-������
-Z1u�,k���q\���0RcB\;H�4��ɷi5�VNCn�\ٶ�'�x�&�D�`�*]oW�J@"���>R�l&����H�� ��C0�+�)xEȕ�f���z��0��L$�T
�
-s�ؤ�
�M/�"
�ll�(IH
5@�
1��W��
l�ϡA‰�xip3�v
"J��.-����6w�vP�ּ�p	F_����%e�9�$
���3����+\tY
h ��A�<�b
�?d���-����[Ie���
�k1��
-�\��r
-+W���!,�u4�lm|T�SI-���Zha�5�]j���,'�E�F�P�$I�N�S�~��d���Z
��gY�Ő������@b�ek��WfƋ 7x�)
��m�A(M!9���}o��� ��f�κ�5|_��0��o~x���)y��?��1P:��-�X5̶u������\?���&]�fo^<��Hl
0�����x��ʗ��T�:b! �QU?U=Gy��]��(Ɂ��ό������d;NP'2�����n;/ ۠�Bl*��3NȑB� ��
&�7u-�v��4�
-H���T��]h�m��ͼh�s�� B���\n�E��{��������~xl��)�X����Քa��".���t�( 
�
�C�C�qcY��Ɂ������	�W�ྩ�W��&PĻ
K(��
-q�`�ҏ�
\�ڧ��9��}�N�!(�6�_����8�D9ctl�F��2_ϳM�75ĺ����|�Y֔�!߭]}�#vA���Q<��Na�#�x8b*�Ĕb�c��u�
LJ��"�$��b�:�q��"�
�=�Z
l��=�Z� k�l��b;wu%)��|0�
-�]��/xY��AܑN���|+���'΢�0�*
kp(�C$�yu����c3a�|��_WDz�jx�D�Jz9
�DHvg�����ϙ'��ΐ�
�1��
���
�e�Yw?Í�`* �kP��hx=��$N�\�*b�9���f"�)Щq�>����d�d
V�Yy�)H���lw
-Y߄Sx�
-hCއ@���#�!��閄�N��=`0�h
6��h��b	�/ڊ} �$�N�'
���z`��!�F4����WC�ēk�k,�f��3��@fS��{��M}��
-PB�U�Ow
�pX;�BV�l����>�":����
's���,4'\��9��u��\g������o�9L�梮�.�]B�$��z�^��Kt�z��	{N!N���Wآ�!�.~L�!�i5\�?RhoĠ�6&P��i�+6�3��� ��-�U�n�h���v.���������o�Pu���:�#r|���]p���8��
ˁ_Yј����ܼ�\�l�9+O"��Bx�hل�:��T���P9��I{*bHR�N�r�� P�H�����?��Q.S�g�gBqW�g`@����9� J�$��9�
-
�� �i�.���XM�\�>��`�
s� "Q=+�m��0��3�D.��1����F���D�ed��

�
\e8S�[G���<&�]��E"Dj�3��w-��/[}�Q
�99���^0
<V�F��
-
���eӣ98�xp<��6s�~
 ���a_�,+C(0EE�=
�`��4�	XX�t�����o#O�߶e}�
z�
�c����k����$R.a��d�O�y��Jd�����'_�v���^���r��p�!��	o��
�����
�epW�������Z�ѕa��F���F��22g������m^�˙y��g͉��ԟ�;J�%q��
H)e�p��{�^�߄�W��b�m�ZqS�7m:
��OF$L.��0�I|s��2-�6�'���ͮ.�b���٢l�X���(���'^�_���;��>nk�D����^�zu��/��=Y��}̴'�C7�<�H������e�
-endstream
-endobj
-8396 0 obj <<
-/Type /Page
-/Contents 8397 0 R
-/Resources 8395 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8384 0 R
-/Annots [ 8386 0 R 8387 0 R 8388 0 R 8389 0 R 8390 0 R 8391 0 R 8392 0 R 8393 0 R 8394 0 R ]
->> endobj
-8386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.215 684.514 255.159 695.418]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_a534e99d940f191cba72c31acb19989cc) >>
->> endobj
-8387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.094 684.514 384.732 695.418]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
->> endobj
-8388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.64 634.64 260.151 645.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_ae11646b9e6b853245a5d04301f39c134) >>
->> endobj
-8389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.51 634.64 376.722 645.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-8390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.422 584.766 271.886 595.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_a34f9d9a55678514e434ebed37cf89f01) >>
->> endobj
-8391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.028 584.766 402.933 595.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
->> endobj
-8392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 572.811 179.554 583.715]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.533 374.135 490.745 385.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-8394 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8398 0 obj <<
-/D [8396 0 R /XYZ 89 770.89 null]
->> endobj
-8399 0 obj <<
-/D [8396 0 R /XYZ 90 534.999 null]
->> endobj
-8400 0 obj <<
-/D [8396 0 R /XYZ 90 473.564 null]
->> endobj
-8401 0 obj <<
-/D [8396 0 R /XYZ 90 318.082 null]
->> endobj
-8385 0 obj <<
-/D [8396 0 R /XYZ 90 295.706 null]
->> endobj
-8402 0 obj <<
-/D [8396 0 R /XYZ 90 295.706 null]
->> endobj
-8403 0 obj <<
-/D [8396 0 R /XYZ 90 168.899 null]
->> endobj
-8404 0 obj <<
-/D [8396 0 R /XYZ 90 164.416 null]
->> endobj
-8395 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8429 0 obj <<
-/Length 2380      
-/Filter /FlateDecode
->>
-stream
-x��[o�����)Xh% �}Hc M�]o���(E�DK�R����u��{�BJ�G��C�>���r�����R8�8�����KłE��`|D8P<BB·Y�y at 0�j8"��͐�A\.��͐�A�=.�YO�ӻ2./.�O��
�����Y\U��6�O�!	I>M`8�h@~
�x�n|���p@��0�.�>��
n�`Ģ0x0���
>����?ΰ[K���З�í�ܬ0��<P����E�&���+cL8���MB�p��3f���:�}�/��DT"���L���z�^$�"����_��Ճ��V|��Fua?�`L���~L��L����Z�ů�2��"e���M)G!�5�qV�lf15�
-0�|H�Y�t<�s�a�
�"��D0�P�,WY\��	�����M��mљ@!����*��%x�Q2� a	̇#Y����+��Ә.o���a�9�� 
-,�I��(�Z�=��Q��P
-+k�U^�߆,�<0��NbS(�k�x�����zJ��Z����
�1j��-��9�װ����Ȝ�SɈ2����B����&�˛ɇ2�f>S�
�>������>Uh�2�W���WH��%/�!�%롔�G� `=?���P

�� �0��T��M
M�=Yg��b��"��."7��K��R at Z�'�
�1ҝ<�R�u�9�H���
�%eo�hl��,

-��	.W��`��#�T���=A���5���ȧ�,���^���*("
�D���
!jw��T>�@���O�j��#*��v�^�ăW��(�i��M�!�2��,s��H��T$�N*DL��XBU֪ܶ�M�
-C�Oi� 7�I��j�7%���	�G�����
k�^��F��z�T@��E�k��z�2�
�
�bCi�ݛ����ai
.�,��Z������ln��Hg�!��mH�&���"����
]������n���Z���B!�E��%�>P�uZ�1N�̜.�}�u���L6Pv
�3��˼�PMJ�:��n���N
�V����P�[xVB�ct���
�c�-7���{9�(��2�a(H/"x���A�����"�SN�
O9�:��ƾ�M#H!\���s_��$�j=����Z��$@	B��gx��:��{]��.���J��
�G6�P�[:`:I�(�vbT
�
ẗ��+C��
�

��Q�
^�?��1P�I
`�T$��_D�S`=
��4���Ÿ��i
-�e�; >��
N���Y�Lr
�&{G���;1�"�֑�]�W��M.�*0�>��i�v�)y6X�C���Aw��"��ҪzvqQ�M� �E��v�kLkc�ݝI�׸�Ц.�\*=�ԣhwC`�i�
*��b�HB1}>�
�����}
����Y���*�gAnW�x�.;��Y��C���V��A��iӠ�v���
[-p�+���R������k�`��q�*�#|�b��S N��
-�����:O:=�; ���ld�]�ta��*SP�ãX6�,���4u EDjL�;��s���O�>�������:Ns�|]nʹ�;�Oݯ��h��$���
b�'�	֏`Žv�@���Z�3+�k��6g{�y�R/uO7�[:�9�oe�ߗŲ���E��v=��Ǖ,��,$  (�5-]���JE��瑀ԶZeh��u갑O]D�QyY�|��(7���
��0���>0��d

w�`�"��Œ�p���Q�\]k-�z��7>�	�%��;&X~օ������6���AR6ytg9��o&��
�n���,͓W.��G��۪��C�e#�iVT����#O�c'i���i>��3_��RQ����C�}�����G�{#8c�YK{Y�d}��wf��z�!�])��M�P�beo�$�z�#�@
���0�
�o�ֿ�������w�n�vw�}��g���p�~��>o�?|�t�n��k����R�$
d�$�
FD�o�̹΀:X̑�}%m!��`�h��g�����}|>�!�%���0 ����S� 	R�
-�?�U�(��g���t|oy�3�5����lf�y���g���k���MKu����9\��sQ�
⟒�]�2��:�ֆpO�^�k�lr�G�樹+V �kO���ӿ����Z�� �&徑O�嘈#�;�
- tZW=�تq���(�y�w���7	ަ�ؿ��r
-��1��@�Q�K
77���S��

-8�86�s�8��y���U
]�s'��I����?���-5nL!�#���E]�.����sؑ9�˧�hk
p`�Pp
~ˢ)�i7�c��I�G�iS����_ �0Q�����Ǧ��q~�d��
-p��6��>��
-endstream
-endobj
-8428 0 obj <<
-/Type /Page
-/Contents 8429 0 R
-/Resources 8427 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8384 0 R
-/Annots [ 8407 0 R 8408 0 R 8409 0 R 8410 0 R 8411 0 R 8412 0 R 8413 0 R 8414 0 R 8415 0 R 8416 0 R 8417 0 R 8426 0 R ]
->> endobj
-8407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.855 373.24 346.467 384.144]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) >>
->> endobj
-8408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 198.358 160.207 209.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) >>
->> endobj
-8409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.977 198.358 192.655 209.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a4312979a12cae5ebb0791496e1ccce7a) >>
->> endobj
-8410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.643 198.358 218.667 209.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a05abaa6ff4aa204c25c94719e8a2b6f4) >>
->> endobj
-8411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.656 198.358 252.978 209.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5ab7fe867b1243e111ef4364e3ef5b5329) >>
->> endobj
-8412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.967 198.358 337.66 209.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5abed2d3fff60e7c0b8fc325bf46f9725f) >>
->> endobj
-8413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 146.379 201.399 157.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.376 146.379 268.642 157.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aec5862748da509cc5dbf2ccd7280a92d) >>
->> endobj
-8415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.198 155.733 102.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.549 91.198 221.306 102.102]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.741 91.198 321.719 102.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8426 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8430 0 obj <<
-/D [8428 0 R /XYZ 89 770.89 null]
->> endobj
-8405 0 obj <<
-/D [8428 0 R /XYZ 90 683.658 null]
->> endobj
-8431 0 obj <<
-/D [8428 0 R /XYZ 90 679.174 null]
->> endobj
-8406 0 obj <<
-/D [8428 0 R /XYZ 90 537.448 null]
->> endobj
-8432 0 obj <<
-/D [8428 0 R /XYZ 90 532.965 null]
->> endobj
-1841 0 obj <<
-/D [8428 0 R /XYZ 90 322.874 null]
->> endobj
-322 0 obj <<
-/D [8428 0 R /XYZ 90 316.165 null]
->> endobj
-8433 0 obj <<
-/D [8428 0 R /XYZ 90 215.441 null]
->> endobj
-8434 0 obj <<
-/D [8428 0 R /XYZ 90 110.278 null]
->> endobj
-8435 0 obj <<
-/D [8428 0 R /XYZ 90 110.278 null]
->> endobj
-8427 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8492 0 obj <<
-/Length 1634      
-/Filter /FlateDecode
->>
-stream
-x��Z[��6~���)53Y�.���3mn�K�4��%�xX,{5�����+q3�X�M�L&31������s@cf@�������9#�
��hj8�`�������a���Al�c�U��'�ގ��
]������ �!h�T ��b��34&��+�p�.��0,L��ܸ
�>��.���
K:!h�p�!J��1M
�]��
�25>�/(����ae��?A
-����l�F���(��LIA�h\ 
�M�Bm7�� ������
�:��~����1�ζ4p����e�	�3��$\yZ��Ɲ�oӫ�\
?�
M†J��P
T
����S&r!�Hms
o��ND�t=1V�)��c����1ן�۽�UC���ϱUÁe;y`�	��w
� �x>��(]M��:�U�>�9B����5�+X�K�1�܃��D����C�Y�k":t��k��
�E����nw�u>�x�Q*)��|�[���Fkr�`�9	/=

0bo]	�tVE#
ؐ�s�[5c�l
N[��L�6��MN���x����?�����#�8���24�bg^�s�w��{��T2��
_q(�(:�a��a
�D��<���&��>=����Zl�b)�	ߛ��gu.�9`6ۇ!؈�>�XCR䵖�G��sS �S9YG�{�Y
��m��D�VY��)����L2�J�f^��5j���%���;w��
15׌ĞTA!:D�L�����p����jx���StuX'� [...]
=	d@!�wA�(�w#h{>��x.���^c
"E��Õ��Q�kai9�9�	�yvf$뀲�u=�8U�ȳW���Q�
>�:Yr�z@������o���7&��e ��;��01d���{��(�
-�Ԡ��y`}�;N��
�8]GWW	8�PLE(|O4c��9GMwރ��ֻZ�Tqu�8)�T��T��A���_11 �^�1�Z�ZF-or
��:Ge��.VfG����@�~���vp�����3e~�3����6ʕ�۠,�"7�H�#�qB
�;gk�?���"���J^qw97�*�{��Y��6�Y:;ZNu���
f���Z��4�fS�:l;�!�o�&�'��W
-$��߱������
����]� �]p���
��
-�V��N��/�4@'���$�g{߼��E7���~�Vm����]'�
<T�R40@���OPZ�X�5��\MF]��1;�v
9Q�K/Oz��w�S�M�F�
+L���S����cR���0���hi��t�$�~@ K�I��t�
�k��/�x(a[qJ��V`�j9���B�1��Xn�����ߤD"�A�d����
^m��I�}c��ն�*��Z�i=��B���+]Z�;����o�xyuyy��EŸ/X����8 ��3ӼV�������޿�՟�
-endstream
-endobj
-8491 0 obj <<
-/Type /Page
-/Contents 8492 0 R
-/Resources 8490 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8384 0 R
-/Annots [ 8418 0 R 8419 0 R 8420 0 R 8421 0 R 8422 0 R 8423 0 R 8424 0 R 8425 0 R 8443 0 R 8444 0 R 8445 0 R 8446 0 R 8447 0 R 8448 0 R 8449 0 R 8450 0 R 8451 0 R 8452 0 R 8453 0 R 8454 0 R 8455 0 R 8456 0 R 8457 0 R 8458 0 R 8459 0 R 8460 0 R 8461 0 R 8462 0 R 8463 0 R 8464 0 R 8465 0 R 8466 0 R 8467 0 R 8468 0 R 8469 0 R 8470 0 R 8471 0 R 8472 0 R 8473 0 R 8474 0 R 8475 0 R 8476 0 R 8477 0 R 8478 0 R 8479 0 R 8480 0 R 8481 0 R 8482 0 R 8483 0 R 8484 0 R 8485 0 R 8486 0 R 8489 0 R ]
->> endobj
-8418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 155.733 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a3f29f8b40d09b17eaa4cbaac069f72a0) >>
->> endobj
-8419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.07 707.957 224.893 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 695.092 155.733 705.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4904a65badd41facf2b598f09eb726a5) >>
->> endobj
-8421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.07 695.092 224.893 705.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.105 695.092 304.862 705.996]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 667.37 155.733 678.274]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5a20d28505fdda8702b48c35d08cfddd) >>
->> endobj
-8424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.07 667.37 224.893 678.274]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.105 667.37 308.748 678.274]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 654.505 155.733 665.409]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a37b12f6fbf02f9a3a51dee028128d446) >>
->> endobj
-8444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.07 654.505 224.893 665.409]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.105 654.505 308.748 665.409]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [356.837 654.505 418.595 665.409]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 627.157 163.482 637.687]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab339ccb929a7255295ad19a5b168d5d0) >>
->> endobj
-8448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 599.061 155.733 609.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.473 599.061 207.279 609.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4fb7d78e7b37d7f4b99babdc5cc84783) >>
->> endobj
-8450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.616 599.061 276.439 609.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 571.339 175.668 582.243]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 571.339 234.596 582.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abccc1b3be92c83b70dd47667198d62cf) >>
->> endobj
-8453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 543.617 208.395 554.521]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2c0762c7e8b14cb1d2032bf920b57732) >>
->> endobj
-8454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 543.617 273.968 554.521]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 515.895 179.554 526.799]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 515.895 250.666 526.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1c884f5152f75040139ec3d9ec8ac293) >>
->> endobj
-8457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 488.173 220.579 499.077]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a66af65679979f949af0457fbcb07dcca) >>
->> endobj
-8458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 488.173 290.038 499.077]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 475.308 233.76 486.212]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8d0452265a9138357bbccc5902f80d97) >>
->> endobj
-8460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.575 475.308 272.763 486.212]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-8461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.205 475.308 323.393 486.212]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-8462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 447.586 243.165 458.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af64f0b6ef53df6ef8024b03b187d197c) >>
->> endobj
-8463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.502 447.586 327.278 458.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-8464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 419.864 246.034 430.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a497cd4705484de0b938f6e03fd2ff460) >>
->> endobj
-8465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.522 419.864 360.71 430.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-8466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 392.141 231.1 403.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ae6e33f7246f4e3683fdab905d2e26819) >>
->> endobj
-8467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.915 392.141 270.103 403.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-8468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.916 392.141 345.559 403.045]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 379.277 135.579 390.181]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) >>
->> endobj
-8470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.077 379.277 155.225 390.181]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a7c502c8d46ed2f68679404fdfdf8e0bf) >>
->> endobj
-8471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 351.928 162.677 362.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad8cee05f88ad5aea288c1f6b8bf7cdc7) >>
->> endobj
-8472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 323.832 160.455 334.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ae5902ab7e2d3304037a56ecda7fc22a4) >>
->> endobj
-8473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 296.11 168.216 307.014]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af1827b1f7a42393a2526944530559c5a) >>
->> endobj
-8474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 268.388 201.969 279.292]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2aba27eb7310045e1a35c7e68af01ab2) >>
->> endobj
-8475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 241.04 297.728 251.57]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_afceefab91d648d188e42e5a75a3a977e) >>
->> endobj
-8476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.544 241.04 336.732 251.57]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-8477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 213.317 283.353 223.848]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aeff190ba56f86d3425859043689d499a) >>
->> endobj
-8478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 185.222 191.718 196.126]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-8479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 185.222 288.852 196.126]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ade98f4e320d7d21e223afb83240b3800) >>
->> endobj
-8480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 157.5 191.718 168.404]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-8481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 157.5 303.079 168.404]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a77fc44f44b1bdda486e19e30310634e2) >>
->> endobj
-8482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 129.777 201.471 140.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a42867df59ec40173391b76074f9f0fb2) >>
->> endobj
-8483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.808 129.777 270.631 140.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 102.055 182.044 112.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4da7504ef9aeba8a782d47c83ce1abe7) >>
->> endobj
-8485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.381 102.055 251.204 112.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 74.707 150.493 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af1bf8c762c6f36b30f2abcaffe591acb) >>
->> endobj
-8489 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8493 0 obj <<
-/D [8491 0 R /XYZ 89 770.89 null]
->> endobj
-8494 0 obj <<
-/D [8491 0 R /XYZ 90 711.942 null]
->> endobj
-8495 0 obj <<
-/D [8491 0 R /XYZ 90 671.355 null]
->> endobj
-8496 0 obj <<
-/D [8491 0 R /XYZ 90 643.956 null]
->> endobj
-8497 0 obj <<
-/D [8491 0 R /XYZ 90 617.96 null]
->> endobj
-8498 0 obj <<
-/D [8491 0 R /XYZ 90 588.512 null]
->> endobj
-8499 0 obj <<
-/D [8491 0 R /XYZ 90 560.79 null]
->> endobj
-8500 0 obj <<
-/D [8491 0 R /XYZ 90 533.068 null]
->> endobj
-8501 0 obj <<
-/D [8491 0 R /XYZ 90 492.158 null]
->> endobj
-8502 0 obj <<
-/D [8491 0 R /XYZ 90 396.126 null]
->> endobj
-8503 0 obj <<
-/D [8491 0 R /XYZ 90 368.728 null]
->> endobj
-8504 0 obj <<
-/D [8491 0 R /XYZ 90 341.005 null]
->> endobj
-8505 0 obj <<
-/D [8491 0 R /XYZ 90 313.283 null]
->> endobj
-8506 0 obj <<
-/D [8491 0 R /XYZ 90 285.561 null]
->> endobj
-8507 0 obj <<
-/D [8491 0 R /XYZ 90 202.395 null]
->> endobj
-8508 0 obj <<
-/D [8491 0 R /XYZ 90 174.673 null]
->> endobj
-8509 0 obj <<
-/D [8491 0 R /XYZ 90 91.506 null]
->> endobj
-8490 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F68 3032 0 R /F110 1507 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8580 0 obj <<
-/Length 1743      
-/Filter /FlateDecode
->>
-stream
-x��Z�s�8~�_�S�Ċ~ �L��.�t�KgrIn��x�	S
>�����$ ���$Nr��CbV�����غ���f�����3+@�G=�bf��N�\���6����	�ۧc��P����b;OW�"���$���\

���a����>Jâ0�gb&����"�X@�r6�t�n��b�A�"� qߊ������,�X�[7Zhn9��5��G�p���zm�|X�稵 �[�D�Y�ѵ��Z>Wv&3s
��ܔעz��
l	efe%
�1�v%P�eR|Ę��eՆ

{x��J��P
���;>R�Y&.���vtWϔ��U�3-��(�$�����{
��G�b�#��(ϊ�%vkg�[��.�Y�����Z|�+-DŽ�Q�A��>-_���a$�4�-�.F �J0̌��Ώ޾5�Ʒ
s)DV��J,�����0��6SC$X��� �Py�
�Q�\�h�MF�0>k8�_�"����
�#��>�<J_&�|@d��?@
P`��"�
�d�SQ�x��(:|H
D�n>d�{��I�(���E�]u���y��2_TUƬ����f
R^�ꘑ8�1w �A|.�<
B�4�^b'
�~N`*Ef��39v\;�wF�!�~Js�Z��5�=��� ��VV,��2���r��3�|�
[�OO��*ր����8��YlL-D'?�P@�.�DŽy9�@(0�"��E�6;������&���\ʬ蚎�u֖r)��na�e���-��΅�{�rgaZt� �ănH�$ I�m��q��,Χō�@7�ō���δc���;�	���EdG�H+�7Iyݥ�@�m�[ueZ��aY/���
�y����_p��A���k��*�X:u����8����
p���^�JZ衾}��
s;��}/�B���e��Vl L˗�<���O{}Y��{�э��i��MN�
����~-gB
ojB�
-��f��b�I�L˩��d?��uno����T_������
1���x	��u�0&>zd��	���G���/~0��#�P5t�
?����G�/��cd����RB{�'�w4

~2���!�Џ��>�6�UE�F	 fZ�0)���p<�S>� ����LH�KG�Dz�s�wR��]?G`�D8��5*;�_�(�eC�]�Aw��Y�AǏ#����'Hȝ�����ǃ��m.��$�ݛ��v�����8�x�`
&���Q"��¬ģ4/�RL;í�[�m
��q9���
m�CU��Y�
V�
P֎t��DA۽�.�
-y�� ���z��r��A��ڠ��ō<;���
-`���q2�
-��\-�0�ï�bFbڌ�}{�KJ���|Y�_h#��uT��{�����6����,N���^g���{=�dI��i�M<���6��=,��\�j��Z��:.J����_������?V5}���Iz�4ի�F�y6飹I��0]g�Έ��N
��SٳJćTp��!n�qu�;2+�g�%�Զ�%�ǹ?��+��*�・_e��[��ڷ��H�G��ې�>	�(�Q},=�C1�A���J[`�T ��=pzzbn�.��E��VN~f��*�_T���#[
잋:'�?[�ݟ�;w�L�MC�&�,���+h��Pd��۔X[G �o��Y���<���k��\�`�����
�������Ga�9����a=�����Y����o��A�|
-endstream
-endobj
-8579 0 obj <<
-/Type /Page
-/Contents 8580 0 R
-/Resources 8578 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8384 0 R
-/Annots [ 8487 0 R 8488 0 R 8520 0 R 8521 0 R 8522 0 R 8523 0 R 8524 0 R 8525 0 R 8526 0 R 8527 0 R 8528 0 R 8529 0 R 8530 0 R 8531 0 R 8532 0 R 8533 0 R 8534 0 R 8535 0 R 8536 0 R 8537 0 R 8538 0 R 8539 0 R 8540 0 R 8541 0 R 8542 0 R 8543 0 R 8544 0 R 8545 0 R 8546 0 R 8547 0 R 8548 0 R 8549 0 R 8550 0 R 8551 0 R 8552 0 R 8553 0 R 8554 0 R 8555 0 R 8556 0 R 8557 0 R 8558 0 R 8559 0 R 8560 0 R 8561 0 R 8562 0 R 8563 0 R 8564 0 R 8565 0 R 8566 0 R 8567 0 R 8568 0 R 8569 0 R 8570 0 R 8571  [...]
->> endobj
-8487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 694 181.845 704.903]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a13c726daa7d565ded0b177e24b6d1104) >>
->> endobj
-8488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 664.092 181.845 674.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa40eabb29ea4abe082c3a2e6dc820276) >>
->> endobj
-8520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 634.184 154.727 645.088]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ade2531310fd7806c9e4f745cab145926) >>
->> endobj
-8521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 604.65 176.505 615.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abc8ae851f2a0a6260d954b3bd8505249) >>
->> endobj
-8522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 588.65 450.955 598.555]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa40eabb29ea4abe082c3a2e6dc820276) >>
->> endobj
-8523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 563.41 169.013 574.314]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ef38aca6ca4ade62193017e6e794c94) >>
->> endobj
-8524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 563.41 214.652 574.314]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 533.502 183.698 544.406]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aec5862748da509cc5dbf2ccd7280a92d) >>
->> endobj
-8526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.438 533.502 238.89 544.406]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a3e575c477cd1ab90e4aaa2997d8163f8) >>
->> endobj
-8527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 474.92 179.254 485.824]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 474.92 196.689 485.824]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
->> endobj
-8529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.026 474.92 301.275 485.824]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.929 474.92 380.687 485.824]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.121 474.92 481.099 485.824]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 445.012 179.254 455.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 445.012 194.467 455.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
->> endobj
-8534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.804 445.012 299.054 455.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.708 445.012 378.465 455.916]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.9 445.012 478.877 455.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.246 415.104 180.069 426.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.382 415.104 203.857 426.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.824 415.104 310.074 426.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.179 415.104 429.114 426.008]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-8541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.603 403.149 260.987 414.053]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-8542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.611 403.149 332.369 414.053]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.803 403.149 432.781 414.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 373.241 179.254 384.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 373.241 202.228 384.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) >>
->> endobj
-8546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.044 373.241 267.801 384.145]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 343.334 179.254 354.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 343.334 202.228 354.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e) >>
->> endobj
-8549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.565 343.334 306.815 354.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.468 343.334 386.226 354.238]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.834 313.426 178.657 324.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.557 313.426 234.786 324.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
->> endobj
-8553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.927 313.426 338.177 324.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.87 313.426 455.804 324.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-8555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.509 301.471 285.893 312.375]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-8556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.517 301.471 357.275 312.375]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.709 301.471 457.687 312.375]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 271.563 179.254 282.467]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 271.563 235.981 282.467]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) >>
->> endobj
-8560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.797 271.563 301.554 282.467]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 241.655 179.254 252.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 241.655 235.981 252.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abb59cb64a8f7864eac1bb8253d164db0) >>
->> endobj
-8563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.318 241.655 340.568 252.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.221 241.655 419.979 252.559]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 211.748 203.075 222.652]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 211.748 296.324 222.652]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad593d3aa49a632911d8d49c83b3f4985) >>
->> endobj
-8567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 196.121 316.216 206.026]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 182.214 194.297 192.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a3bc88b2886b0b86865186d142e5ee414) >>
->> endobj
-8569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 152.306 188.759 162.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aebb212a14f52ed934059925c1f5f2010) >>
->> endobj
-8570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 122.025 202.776 132.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.515 122.025 278.601 132.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
->> endobj
-8572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 92.117 202.776 103.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.515 92.117 312.354 103.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6804f93015ae6e1dc0c2e42e726380c4) >>
->> endobj
-8577 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8581 0 obj <<
-/D [8579 0 R /XYZ 89 770.89 null]
->> endobj
-8582 0 obj <<
-/D [8579 0 R /XYZ 90 712.265 null]
->> endobj
-8583 0 obj <<
-/D [8579 0 R /XYZ 90 682.358 null]
->> endobj
-8584 0 obj <<
-/D [8579 0 R /XYZ 90 652.45 null]
->> endobj
-8585 0 obj <<
-/D [8579 0 R /XYZ 90 622.542 null]
->> endobj
-8586 0 obj <<
-/D [8579 0 R /XYZ 90 581.676 null]
->> endobj
-8587 0 obj <<
-/D [8579 0 R /XYZ 90 494.835 null]
->> endobj
-8588 0 obj <<
-/D [8579 0 R /XYZ 90 391.507 null]
->> endobj
-8589 0 obj <<
-/D [8579 0 R /XYZ 90 361.6 null]
->> endobj
-8590 0 obj <<
-/D [8579 0 R /XYZ 90 289.829 null]
->> endobj
-8591 0 obj <<
-/D [8579 0 R /XYZ 90 259.921 null]
->> endobj
-8592 0 obj <<
-/D [8579 0 R /XYZ 90 230.014 null]
->> endobj
-8593 0 obj <<
-/D [8579 0 R /XYZ 90 200.106 null]
->> endobj
-8594 0 obj <<
-/D [8579 0 R /XYZ 90 171.27 null]
->> endobj
-8595 0 obj <<
-/D [8579 0 R /XYZ 90 141.362 null]
->> endobj
-8596 0 obj <<
-/D [8579 0 R /XYZ 90 110.383 null]
->> endobj
-8578 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F90 758 0 R /F32 764 0 R /F38 3426 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8682 0 obj <<
-/Length 1761      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�/.5���3��v�i긶��d4�ۜH�BR�կ�)Q�H�Vb'�/X,�gϒ �qm`�M�Ag��f��\�Z���p�as	
��ƅIm��8xk0�Aĵ�W�������dp��:G����&l�L�@�c��������F�u��Thjp��:1�;w��#*ԭ�h�@W�2B!�牗��n�R�<�_vms�?�N�ȿ�a��&��������X�3ǀ����?P*J]����،�q6Ga'ZH�=��N8Kŕș�E2���k�l�3�W]�Mo>I����Z��ހ���g�G�NX:�e�ΰ�r8������772�r�e�	6���]i�<����*���@�0�fod #��%�3�QfW)�ka�1a
�H�"��LN�$

�}<Fʆr���!�
q�|�����Sr�%�
�)��"}��q*��R��*�*RK&��7�i��qIo�iޫg8�Q�>��?�dX1f�`���˗u!6r
7�U��0%~��ils��!�w��-����-���<��u���"�Du��X���P|�RP���ߦ�9�������

�{��.���*��o�Y��	�
-��(0r�����Ȣ�n��J
@�*�,*�����i:�km8+]�\��j�SUN��֝
�U����Aw/
�)�����kOօ����ljZ@��o]S�A�&��M��2Ќ�<��}��{S�7f%G�r/k�jF��ζԤh��/v�;�2�[lc��ی1E��nƔ�?Ʋ���f�k�B?H6"

m�b�@�=Y�

���2
-+���+��]�<
RT�kLG>�|�D����~jt/�5��`�/�\��Z ~W2��HÍk,�
#� ������ةD8"6ө�*R�nJ%g=�RT�ɮI$g%�td�S�l�y�a��^u0ms�TX+��� >�	���~�:P���ߔ-���T[��[�&y̨|��܎T�d�� ?�j�-qA\����<��J|(��Pb��PB�.��n-���T����\V���2��g�X˨
]i^
׳K�o�.Ֆgs�[b+J��N�t��.]���+��SG��6��S.��a8i��}p� $4���f�{� ��d
�K�
#�D�8�DsY�~J�-�
�Wz#VL�
4U��m�P��2�k
}��_�	�FUʅ�0�Y�%.G|����]O]Ů[;���˙<
f;�`� ����\$�W�ќ{RNgj�23��+r�F����$J�,$
�д�������A��Wh�`i1��B��Ή�`���$���Q�O�B2��ă/ġ��z�
rL��o��*<r<<��{ [...]
�� �����Sj!ky��ն�r������F�M�
.�����X�k	��'�c?�
��W*��C����,=��ﮯ
"(��-(7?6��x	�-
\[��/{��ɭ�A�%�H��-�U�Z
-���X
��?IF�!���I#�%�
��ᵴCG��?
�X���L;O�v�3�l��z�q�i�vȽy���
ji�a��w�hP��;�8M
��
=W�J(U$���n���}������(��i-�ˮt�+�m?w0�Ķiڸz�6�}��?���=eKu=��[*L��Z%fr�-S>zz�.��'�ѯ]!̸�Թ7YR�K��2A� ���ʹ��2�>f��N*�Sr$D��7I2���_ίc\�Q8�d�eg�E�.ث8�:
�S�~ /��rZ�
��
-endstream
-endobj
-8681 0 obj <<
-/Type /Page
-/Contents 8682 0 R
-/Resources 8680 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8384 0 R
-/Annots [ 8574 0 R 8575 0 R 8576 0 R 8602 0 R 8603 0 R 8604 0 R 8605 0 R 8606 0 R 8607 0 R 8608 0 R 8609 0 R 8610 0 R 8611 0 R 8612 0 R 8613 0 R 8614 0 R 8615 0 R 8616 0 R 8617 0 R 8618 0 R 8619 0 R 8620 0 R 8621 0 R 8622 0 R 8623 0 R 8624 0 R 8625 0 R 8626 0 R 8687 0 R 8627 0 R 8628 0 R 8629 0 R 8630 0 R 8631 0 R 8632 0 R 8633 0 R 8634 0 R 8635 0 R 8636 0 R 8637 0 R 8638 0 R 8639 0 R 8640 0 R 8641 0 R 8642 0 R 8643 0 R 8690 0 R 8644 0 R 8645 0 R 8646 0 R 8647 0 R 8648 0 R 8649 0 R 8650  [...]
->> endobj
-8574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 685.047 222.711 695.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.209 685.047 314.187 695.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.794 685.047 361.329 695.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-8602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 587.169 226.034 598.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a303b4ed4262469c1834228e0f88dba74) >>
->> endobj
-8603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 587.169 362.999 598.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 558.935 156.281 569.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) >>
->> endobj
-8605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 558.935 201.92 569.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.131 558.935 261.954 569.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 530.701 155.733 541.605]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.004 530.701 172.94 541.605]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5c96c17c3224a111a56381a75f564896) >>
->> endobj
-8609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.822 530.701 277.071 541.605]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.315 530.701 356.073 541.605]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.28 530.701 501.627 541.605]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 515.911 411.357 525.816]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
->> endobj
-8613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 502.467 155.733 513.37]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.23 502.467 170.945 513.37]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2673a95cb7d41f3c6078024874d1f8b1) >>
->> endobj
-8615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.28 502.467 275.53 513.37]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.182 502.467 354.939 513.37]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.373 502.467 500.72 513.37]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 487.677 409.725 497.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
->> endobj
-8619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 474.233 155.733 485.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.62 474.233 179.096 485.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a9518a0d513563a1a7c144f35d639695f) >>
->> endobj
-8621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.212 474.233 284.461 485.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.141 474.233 403.076 485.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-8623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.033 462.277 234.417 473.181]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-8624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.041 462.277 305.799 473.181]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.233 462.277 451.58 473.181]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.527 447.487 513.996 457.393]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 436.788 171.671 446.434]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 423.084 155.733 433.988]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 423.084 178.707 433.988]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_afed6e254937adbecd53072747e51cb3f) >>
->> endobj
-8629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.522 423.084 244.28 433.988]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 408.294 309.671 418.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) >>
->> endobj
-8631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 394.85 155.733 405.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 394.85 178.707 405.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aab2bceb460b09e14922ef0ad8011e74b) >>
->> endobj
-8633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.044 394.85 283.293 405.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.947 394.85 362.705 405.754]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 380.06 416.342 389.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e) >>
->> endobj
-8636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 366.616 155.733 377.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.634 366.616 211.862 377.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a76769b829453746113dd32f9fe880c9d) >>
->> endobj
-8638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.004 366.616 315.253 377.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.947 366.616 432.881 377.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-8640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.603 354.661 260.987 365.565]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-8641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.611 354.661 332.369 365.565]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.803 354.661 478.15 365.565]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
->> endobj
-8643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.385 339.871 513.996 349.776]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
->> endobj
-8690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 328.912 201.717 338.818]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
->> endobj
-8644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 315.468 155.733 326.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 315.468 212.46 326.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) >>
->> endobj
-8646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.275 315.468 278.033 326.372]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 300.678 340.219 310.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) >>
->> endobj
-8648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 287.234 155.733 298.138]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 287.234 212.46 298.138]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) >>
->> endobj
-8650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.797 287.234 317.047 298.138]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.7 287.234 396.458 298.138]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 272.444 446.891 282.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abb59cb64a8f7864eac1bb8253d164db0) >>
->> endobj
-8653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 259 180.54 269.904]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad7552a414d66f92897d12767579fa3ca) >>
->> endobj
-8654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 259 249.7 269.904]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.433 259 333.256 269.904]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 230.766 178.239 241.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) >>
->> endobj
-8657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 230.766 247.398 241.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.132 230.766 330.954 241.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 190.577 245.522 201.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac5a61f5b91d0db37a1a2fa6c843a26a8) >>
->> endobj
-8660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 190.577 325.229 201.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 178.622 155.733 189.526]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 178.622 239.289 189.526]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.853 178.622 316.409 189.526]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 138.433 245.522 149.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4f591f8dde74ad99d0fb16a8c7e4a59c) >>
->> endobj
-8665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 138.433 325.229 149.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 126.478 155.733 137.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 126.478 239.289 137.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.853 126.478 316.409 137.381]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 86.288 245.522 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1ad16d1e8a395685314dedffe17fbb8c) >>
->> endobj
-8670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 86.288 325.229 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 155.733 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.793 74.333 238.616 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.747 74.333 315.303 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8679 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8683 0 obj <<
-/D [8681 0 R /XYZ 89 770.89 null]
->> endobj
-8684 0 obj <<
-/D [8681 0 R /XYZ 90 704.125 null]
->> endobj
-8685 0 obj <<
-/D [8681 0 R /XYZ 90 633.61 null]
->> endobj
-8686 0 obj <<
-/D [8681 0 R /XYZ 90 491.662 null]
->> endobj
-8688 0 obj <<
-/D [8681 0 R /XYZ 90 412.279 null]
->> endobj
-8689 0 obj <<
-/D [8681 0 R /XYZ 90 384.045 null]
->> endobj
-8691 0 obj <<
-/D [8681 0 R /XYZ 90 304.663 null]
->> endobj
-8680 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F110 1507 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8789 0 obj <<
-/Length 1586      
-/Filter /FlateDecode
->>
-stream
-x��[s�F���)�K
-3�z/�.h�>4�i�n�>%
��6S
-B���{�����v��rv�����ƕ��7���G'�%3\�
-*��K�ņ�]���L��-�1��g����̢،�k5���{�f2y�B{I[cʱ�b�V��;u�b�8�
-g
-�1��&���t�v��|�yD�A� Y8��1
F>ac��1�1���æ
�/���?G8�����7��&l��.Ž!	A�d��:Qy+�k�
����%������s\���^{I�p�d���
-~�r
*��T��;yM�j%qׅF�M����Z*���(��&3�#ᒢЦ�
-G�)��T�B���ou��
-�\f�1Hp���R�{�D��D�� [�^$*X.�De�`�V9*�m�
y���Y�;���Y��
r
�-"����)k��4�唔< �r9�
-^D�"�I[|�Gݻ7#���f�T��Ÿ+/�
:�(��šya
{͙/���o�3j>�}
\@��(��K�Dۻ:UE p�͋�4O��-���&QἬhz-��Ex��t	m��kz[66�fQ�J�9=f�E�۹�9D*.��P�𓛧YW��ʶ�X�C+[-�������/�F#s?NSz�R�au�؈ ;�:m�ʓ2�D��t�PA
�!ۥG�
-	J��W
T=i�"����lD�9� S3�ƑN��F���H!H6��@��v�l�T��=��)
���&
-9�(��H�a�r�S�*r���]@���P'P��V�� J�+e��$��ݽB��CD�G;*D=�����\L}X�b�ɦ�?���� X���Dž��;��0;?�!m��j*�kꠄV(1�%�F6E��
���&�Yn')A
��?�J��
"]�,;�����ue�iՐ��pJU�7�ۚ�
��1��=���‘x43�Z��Z���7�퀖tj
��u��*�މ�r��x��B
-��9��*�O&�*���
�
GѲ
-�ۙ�X�K7�=kk&�9%y5Z����
�LRV ]s%��c�I�_
�?�	�U*����A�Z�S0ӵ
���f �UC?hr_��C���q«�e�`8��F)Ur��]����1�;Q�?�q{W
-���q
t�!$����0�i�pzI�wK��Dc*)�^]Z��z>2�A�i{~��LҪ��~�C�0ʛ��p�M\��&n6뫍�
J��b��r�Y��P�O�(g�l�ֱ�����������l�
�.���l����<�!�U�A3��

u���qgb.L�rw{�����^
8<d��ǭð�3�tȫA��
b=�3�d�o���gRv�7u�sZ�w��jG�V7��߹}�)�wjW� ��4���LJ�
��$����5�5���	E�*���=1�ʐ*w�*�?�I��G?��=b{�
L�q(��i����iv��J�?Z��������>��Gw����Sz� �[�`���{��
۬��ѯ�*^{Z`#��}��$YNNN.�W���B�(إ��.²��e��QŹC~'�t���ϧ
-
9&HZ(b~
a���4-�}�^,n�O��0�eW�U�
��
-endstream
-endobj
-8788 0 obj <<
-/Type /Page
-/Contents 8789 0 R
-/Resources 8787 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8795 0 R
-/Annots [ 8674 0 R 8675 0 R 8676 0 R 8677 0 R 8678 0 R 8703 0 R 8704 0 R 8705 0 R 8706 0 R 8707 0 R 8708 0 R 8709 0 R 8710 0 R 8711 0 R 8712 0 R 8713 0 R 8714 0 R 8715 0 R 8791 0 R 8716 0 R 8717 0 R 8718 0 R 8719 0 R 8720 0 R 8792 0 R 8721 0 R 8722 0 R 8723 0 R 8724 0 R 8725 0 R 8793 0 R 8726 0 R 8727 0 R 8728 0 R 8729 0 R 8730 0 R 8731 0 R 8732 0 R 8733 0 R 8734 0 R 8735 0 R 8736 0 R 8737 0 R 8738 0 R 8739 0 R 8740 0 R 8741 0 R 8742 0 R 8743 0 R 8744 0 R 8745 0 R 8746 0 R 8747 0 R 8748  [...]
->> endobj
-8674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 682.349 243.605 693.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abed1f1d1ff610a4d56c514a7b75509ab) >>
->> endobj
-8675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 682.349 323.607 693.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 670.394 155.733 681.298]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 670.394 239.289 681.298]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.853 670.394 316.409 681.298]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 629.142 245.522 640.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4f591f8dde74ad99d0fb16a8c7e4a59c) >>
->> endobj
-8704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 629.142 325.229 640.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 617.186 155.733 628.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 617.186 239.289 628.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.853 617.186 316.409 628.09]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 575.934 243.605 586.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a475ead5848d02d5c879bb96f22ce1cc5) >>
->> endobj
-8709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 575.934 323.607 586.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 563.978 155.733 574.882]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.793 563.978 238.616 574.882]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.747 563.978 315.303 574.882]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 522.726 239.568 533.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) >>
->> endobj
-8714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 522.726 317.166 533.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 522.726 513.996 533.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 510.771 139.135 521.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.869 510.771 222.691 521.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.255 510.771 299.812 521.675]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 469.518 239.568 480.422]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a37eddcfd7d63573ae2bf02e2f5ed6d50) >>
->> endobj
-8719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 469.518 317.166 480.422]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 469.518 513.996 480.422]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 457.563 139.135 468.467]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.869 457.563 222.691 468.467]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.255 457.563 299.812 468.467]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 416.31 239.568 427.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad006db44540ea4786f611e882bfe8da5) >>
->> endobj
-8724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 416.31 317.166 427.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 416.31 513.996 427.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 404.355 139.135 415.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.869 404.355 222.691 415.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.255 404.355 299.812 415.259]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 375.057 226.034 385.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a75190def344d4c1ba6c59a6f0fcf7420) >>
->> endobj
-8729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 375.057 388.214 385.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) >>
->> endobj
-8730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 345.76 155.733 356.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 345.76 173.167 356.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a95bad70fc4276b46478ff7100cbce347) >>
->> endobj
-8732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.505 345.76 277.754 356.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.408 345.76 357.165 356.664]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 332.107 155.733 343.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 332.107 170.946 343.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1b5063a9931b8a9d4a0db756c0b1c9e6) >>
->> endobj
-8736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.283 332.107 275.533 343.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.186 332.107 354.944 343.011]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 318.455 155.733 329.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.405 318.455 178.881 329.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a43a020d3bbe2b93b7ffa78a1c817b647) >>
->> endobj
-8740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.566 318.455 283.816 329.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.239 318.455 513.996 329.359]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 292.847 155.733 303.751]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 292.847 178.707 303.751]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_afed6e254937adbecd53072747e51cb3f) >>
->> endobj
-8744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.522 292.847 244.28 303.751]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 279.195 155.733 290.099]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 279.195 178.707 290.099]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aab2bceb460b09e14922ef0ad8011e74b) >>
->> endobj
-8747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.044 279.195 283.293 290.099]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.947 279.195 362.705 290.099]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 265.542 155.733 276.446]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.259 265.542 212.488 276.446]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a974166a1fe54f72e254c8f02687084e6) >>
->> endobj
-8751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.881 265.542 317.131 276.446]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.896 265.542 513.996 276.446]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 253.961 151.877 264.491]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 239.934 155.733 250.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 239.934 212.46 250.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) >>
->> endobj
-8755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.275 239.934 278.033 250.838]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 226.282 155.733 237.186]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.231 226.282 212.46 237.186]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) >>
->> endobj
-8758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.797 226.282 317.047 237.186]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.7 226.282 396.458 237.186]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-8760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 212.629 180.54 223.533]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad7552a414d66f92897d12767579fa3ca) >>
->> endobj
-8761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 212.629 249.7 223.533]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.433 212.629 333.256 223.533]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 198.977 178.239 209.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) >>
->> endobj
-8764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 198.977 247.398 209.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.132 198.977 330.954 209.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 173.369 245.522 184.273]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af4f9b4584e455154e3f201876af1848f) >>
->> endobj
-8767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 173.369 325.229 184.273]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 161.414 155.733 172.318]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.606 161.414 243.428 172.318]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.653 161.414 348.21 172.318]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 123.851 245.522 134.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a855eb1638a9b23f78fac816e8c9f7a05) >>
->> endobj
-8772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 123.851 325.229 134.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 111.896 155.733 122.8]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 111.896 239.289 122.8]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.375 111.896 339.931 122.8]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 86.288 245.522 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a78d14a45bade2c29f565fe13390ab13c) >>
->> endobj
-8777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 86.288 325.229 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 155.733 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 74.333 239.289 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.375 74.333 339.931 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8786 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8790 0 obj <<
-/D [8788 0 R /XYZ 89 770.89 null]
->> endobj
-8787 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F67 3037 0 R /F42 531 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8842 0 obj <<
-/Length 2732      
-/Filter /FlateDecode
->>
-stream
-x��Z�s۸�_��
5! @��L���^��M��Cr�%�b#�
-I���] ��h��}47�����v���rB'���rz���'��$N&�C'J"x[L�G�J�?��8�&�$0�u�����7��p����ѧ#Ct�<I����G���t�8��=�rD뉈9<W�wG�:�Aڗ)�=�M��z�#�y>ıt�7��
E��
�h"�H[��f��'<���
]���!���pJ�Ԫ�t��y���Y,it:U4����h#
3J	Ӽa�}�r����LC�#��</�U�9껼
���h�~&8��v��6��YU��ܞ�U�]���T��E�K;�8e���ٛ��ܖ;J{t�TEž6{��	�����	���_j�/څ�N�U6�2]{>���'��7\�r*��p�y�W�M��qi�b��W6�eZ����w_�1h� c�U�0��&2�+3
�-��"�/�^d��Y�mֺ�E�n�z������
�8@�jA�\�
W�y���B< ���'b�[�Fv���- C�Ì�ޑ�!��8 �8}Sh�*�C�p(J���b8��2�'��iG�iG�!���
fh�:����yV_߆(��u�H��C�2$�
�b�P1�vH���Z@�J��*j�~�j�1Q�N��Bp��V< ���BF-���L
���F|�9/�j���F��H� ���q���
w�enW����y���	6�@R}��`�lqX��
-�%݌�p��n���.���
���
S^�B��(
l�(���
r
�^�:�Vvv�5�U�2��Y��G��/�@a at 8��7�*�m�o����)���M؏w�UQmK�'��"I
d}��i�����E��K��h�
��U�qnoX�X��i,�+pȧC
��cI(�].�b �
�ڸ��$�G�
��ɟ��ҭ��O�SO���Q\㸄�����0A�1.\eңy^���)>�P���L���ÌC�`�<��
� &n����	D�VCl_C�78r�D+�	K���o(A�
ճ�`���\�{�
�1fzJ�i�^�oL�J���ߒ陼�}
3>���f��J
�}_�L��M�����hP�S�ZcF�1I���Yb
u&
�;*>�APW��/��
�P&���7M4�����S�;�&W
v�o��ŝ������������T���Ⱦ%(A
<r�A,��ݮAHzƈ:�)8�6�C=�]Dt�tx3䯀����s�(����@1�ߩ"Zǿ;(�!"� 
��A��!��rW��Ơ�w �(��H�����I����C���t����SrH�A��+X��!����#V���ֽ�u�(��aS��%�"[ۼ�:}�d�6�<4�|�c�
�v�&\V��$��$����G��#Z|Ţ#[��@���%������ �
>�pt
�a��
R����-�:xֶ\gy�*.ݙeg��lMQ���Ц�x��pV�l���T=�3R��3Lw�=���ݔ��y�"m���?�a���+rǟ/��I��^�E��]KP�ް2J��<�l��I�@�e�˅-���w�(�l�(.�h�5x����
�����&�͛'c�� ��b[����
�����@���몶둵D���վ�"b�O#&>PXK��a�C
~;��&&��|ݔ��#5*"ƺ ����}
-4h��FW�o4�ީT����Wۅm^v�n��pe�m���^��`��ݸu�t���
-�Eh���[CBN�"�MK�6$�˴���&�����8s(o�hQ�q�PŶ	��[���
Tpb�!9Q��	2�q���exVY�u���8j��5�.
�uQ�O[#xC@�����(?z�PV/�|�ܡp��͛c�㴅`�_}��FV�'
-�YTOY�ڥM+'4�_-�xU��6�,텋
-�v��m��!�9����G~̆ST�{+0,y�Uv^�e挲�t$��D�scU�'S��
N�"��-�
d
���s��V�,�0���X$�W������|9�	�݅�oa��g/�	n���
o0A�:�^�g�٬���8n��l^��X6��U�]��g$��E=8�&��-Z4t�W�-A�5�
Z�lT���6�wf�;:
� S�l�r��
jT�Xwn�Ctvc�����{��\�)>��PZ�.ѱV�`�!��M�w��)��^de(�k�΄�pE
d��S6����n�����<
�E

-
-�$
-=L�&c:ZX�A|�1QZ
���L=�HMX�G��8�h
-�CMaH�I���D�!9��5�
T�Z���{S���+�V�b�`
C�rY�
$+��5�#���G�>a�.`k_D���
�j�_<;H��0�����*�T�@���
 ��K
�\؃w���va
�R]��Q��A�I��]�+O\�
LG�z�����Axm�mϼ��{��^Ɏ�b������zݔä�H����~Ŵ�ҟ\ ;�S-4�_�������Q1��%�e��
z\uԟ�)
���l��zZ����Ş�^y7w��޷~��g"]m}š%�pw�ڳq{����ig����6L%��Ob�b~׿��&
-E�q�Q� 7R�"b7�o��fN�x�5��(�Y�n�f
�������� ��A�?T7���׾�o81=�3^��?�|���|d
��;�2BT���YT���؊��#�{�H��sYכ�O��o/!
_����^�dc�\�5f(��t9t�]�g��(��y
-endstream
-endobj
-8841 0 obj <<
-/Type /Page
-/Contents 8842 0 R
-/Resources 8840 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8795 0 R
-/Annots [ 8781 0 R 8782 0 R 8783 0 R 8784 0 R 8785 0 R 8809 0 R 8810 0 R 8811 0 R 8812 0 R 8813 0 R 8814 0 R 8815 0 R 8816 0 R 8817 0 R 8818 0 R 8819 0 R 8820 0 R 8821 0 R 8844 0 R 8822 0 R 8823 0 R 8824 0 R 8825 0 R 8826 0 R 8845 0 R 8827 0 R 8828 0 R 8829 0 R 8830 0 R 8831 0 R 8846 0 R 8832 0 R 8833 0 R 8834 0 R 8835 0 R 8836 0 R 8837 0 R 8838 0 R 8839 0 R ]
->> endobj
-8781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 696.002 243.605 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a787318df4682a2571d9cad8fc37c8fd6) >>
->> endobj
-8782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 696.002 323.607 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 684.047 155.733 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.606 684.047 243.428 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.653 684.047 348.21 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 647.696 243.605 658.6]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad7576379843ab0fb9a33484bd4d68e71) >>
->> endobj
-8810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 647.696 323.607 658.6]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 635.74 155.733 646.644]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 635.74 239.289 646.644]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.375 635.74 339.931 646.644]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 611.344 243.605 622.248]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a42b10b56cb7a582076a2d279ae07cf85) >>
->> endobj
-8815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 611.344 323.607 622.248]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 599.389 155.733 610.293]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 599.389 239.289 610.293]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.375 599.389 339.931 610.293]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 574.993 239.568 585.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a39da685d64f5bc693cfe8869ee4fe9bc) >>
->> endobj
-8820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 574.993 317.166 585.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 574.993 513.996 585.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 563.038 139.135 573.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.736 563.038 222.559 573.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.512 563.038 323.068 573.942]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 538.642 239.568 549.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a137b1f86858576e71034aec1ce54fd65) >>
->> endobj
-8825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 538.642 317.166 549.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 538.642 513.996 549.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 526.687 139.135 537.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.869 526.687 222.691 537.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.777 526.687 323.333 537.591]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 502.291 239.568 513.195]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac240ffbfd08a91635aada843229f6814) >>
->> endobj
-8830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 502.291 317.166 513.195]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-8831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 502.291 513.996 513.195]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 490.336 139.135 501.24]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.869 490.336 222.691 501.24]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.777 490.336 323.333 501.24]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-8834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 477.895 156.281 488.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) >>
->> endobj
-8835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 477.895 201.92 488.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.131 477.895 261.954 488.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 404.186 219.642 415.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.41 235.422 353.665 266.933]
-/A << /S /GoTo /D (index_representation) >>
->> endobj
-8839 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8843 0 obj <<
-/D [8841 0 R /XYZ 89 770.89 null]
->> endobj
-8847 0 obj <<
-/D [8841 0 R /XYZ 90 464.78 null]
->> endobj
-8840 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F90 758 0 R /F101 862 0 R /F8 794 0 R /F7 795 0 R /F10 765 0 R /F13 834 0 R /F6 861 0 R /F9 879 0 R /F12 939 0 R /F24 529 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8883 0 obj <<
-/Length 2094      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�Tk���L
�6��:i��%�x(��9�H��b+_�] ����8q;��(`��g�^(�]y�{}�����^L␇��ҋ������-��>�$P�)���o&��I�J.�L8��|{�.����lV%����uZ�UҔ�d�%��˓�6�o�eZMX��<u"�ϕ��u���ˋ�N,�z�,@y���������=JD
y7Zh�\�g�;��ڽt��K�ď�{�z�!��QE���������,;�ss�\��bY�y9�ҿɊ+3�N��o��:O�n��~��p
�U�hU%v��I�,��p`
�[�
>
�^ԭq/I�T+p:�# q�[��xD�I���B���^%�=�E�'��h7���#�ϵ��6ҏag"B�S
����2��&��
�d4o���R�Ǟ�JP3U�`Lt���(я(�;�;{��b�� �)��F�K�?�|v`�.*#�h
J(��(����ra'g蚛,_��3yVX������ɪt�dea,ʘ���
����S�� X����+1��@I �#��ী�x�z{�	
Ň��u2o���Ң�v
�7΂�����
�����ʒ��}P�@q0��ϾN�cn0���
��Rhg�nQ|k�Zp�}�>��4""D2`H��oV�3�����_�Y�,����0&b�s gQ7I��&�V�\�#�����dXu]���������Rp*.-�
�L%�S6��6p����XJ���
]�Lձ~���U�D
K�O4�=������7��cP ����b�P|�X8

ZYeW�
�hj�Dw��FIm�eY�u9���Qd�\W6�X�E?d��5��3R~qCj^�"A�(��n#��z< ,
-����Cc�f�����x��V�l�Ak�'wq��3:�]�k��|aO��( �����΁_3�iN	Y:��� KUf��s��\�����<[n�A<1��V�Ǝ����}��d�ly�
y��V����?#�$���;��e��*��/�T��M9��8\�U�z0���k�i��̎��'�1�}��
�m28ꤓA@��j��~�k�A;�
ԩH��%���vس}e	x����±c�
-��E��G��#3[+_���C����F
-X���`�����R����� ��'���)N�B< KY�m
<���LtSP�7�nN�b#@8���{�ν��{�A�0�2II(�K�w%�֣Z^��$1k��+�g�M6�����'JJi��+0��.m6nv�!`,dN��.[eyR��I(�9�V;tĉ2�����+\��O�x��
dM�
VRșRۊ+�
h/� I�}W�ؚ2
-t}<��U��@f��1+	??�Y�w/���q�B�c]�Gu��]&y�Y��Ǻ9:��H�
8�r��ײi�m?��a���j����&w�?Z�xC�-,-Wi�����w�
�!��'	�IB:J��_����II����4n�I=u{h�K1�E�
�~cc�-��nL�-��jVb��s-�̸i/�-`D�m��~�l��v
H=�1��V	`y�6(o���(���
p�A��’��C���" ��8*�碔_�P.̠�0�����b//�I��_�wM�n8i�
� Z���|��-]mVڃQN��Q�)z�n����(��"��4�{(����8�8"a�]۔��Lr�4���(/���#�.��#��B���
���b��cV��P��4!W#�s�f���BBa�`G-���
�iA��6�������0cN
���dQ���Aš�]���Q�^�q�/04�K�C:Ķ��ݠ�
-ޤ�$�?�n`��ue���:i;��t������|�E�j�$�T�9?��
vx����^���W`��N�"��JV���
�X�HFOWy����
Vh���p߱�?9��8�����L
���"�ݚ�͛����uZ}5�ҷ�/I�I��@m�Zw�DF4A< �wi��7���k�~2`�-�Il�u]��Y����6WuZ\�y�rb��XS����UYu�o\%����E{��2 %ޞ
�?���)�c��޵�lo�g?���}	��5ƿ�E=_
-endstream
-endobj
-8882 0 obj <<
-/Type /Page
-/Contents 8883 0 R
-/Resources 8881 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8795 0 R
-/Annots [ 8854 0 R 8855 0 R 8856 0 R 8857 0 R 8858 0 R 8859 0 R 8860 0 R 8861 0 R 8862 0 R 8863 0 R 8864 0 R 8865 0 R 8866 0 R 8867 0 R 8868 0 R 8869 0 R 8870 0 R 8871 0 R 8872 0 R 8873 0 R 8874 0 R 8875 0 R 8876 0 R 8877 0 R 8880 0 R ]
->> endobj
-8854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 605.331 154.737 612.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 605.331 192.396 612.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
->> endobj
-8856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 553.943 154.737 561.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 553.943 192.396 561.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
->> endobj
-8858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 514.816 154.737 522.035]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 514.816 192.396 522.035]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
->> endobj
-8860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 452.435 154.737 459.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 452.435 188.212 459.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
->> endobj
-8862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 355.307 154.737 362.833]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 355.307 196.58 362.833]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 315.873 154.737 323.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 315.873 196.58 323.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 276.44 154.737 283.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 276.44 221.686 283.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 268.47 154.737 275.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.509 268.47 238.423 275.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 229.036 154.737 236.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 229.036 221.686 236.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 165.692 154.737 173.218]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 165.692 305.372 173.218]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
->> endobj
-8874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 149.752 154.737 157.278]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.509 149.752 238.423 157.278]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 75.416 154.737 82.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 75.416 196.58 82.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8880 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8884 0 obj <<
-/D [8882 0 R /XYZ 89 770.89 null]
->> endobj
-8881 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F11 613 0 R /F24 529 0 R /F8 794 0 R /F101 862 0 R /F7 795 0 R /F32 764 0 R /F98 863 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8902 0 obj <<
-/Length 2875      
-/Filter /FlateDecode
->>
-stream
-xڵZ�s�6�_���I��A���̵M���6���
Ҏ��(�S�TH*�ss��-� 	��,'�'��b� ��
��*��˓��ON_�"HH�(8_	
�0!2��U�n�c5����@D��$�Q���_9���[�w�����	�.0d I������4XA�O%"Q�GC�
B.�	ޞ�ㄺ�Dԑ�ј�L1c�1����9��y��77�H�
�<Nf�u�_�l�Ϲ&��J7��eZ`ϥ����z��Ѧ;��>�6e�d+$hJ|ֻl��o�cW�ES��t�)�Q\Y�rkye� :��*��N%��#�
RUi��
��4X��)qyE�jd"�-˲Z�E�d5�/����Yt�E=g�&-��ބ��M
-����`��[Q�C�
�{�Q�"R�m�S-�2
@J
��B8T���N)
��
���Y�\�B����٘'q��#oa�[��c!	�j���J��P���%3
-bh� "I,���Q HĬ*�O��M��¡���� v���x�
�tg����nD��Lh����VI�y��pcw��;�dzu�ٔڜ?jS���pX�g5�r��m�I��>����鷗��Io�D� 7��H ��Y������
�w��R��xj���-Ug�pcE
fT8H"
����մ���0�[?�t��C��
-�$�FӃ�3���Y?X�=��#
ƨַ�G�`QLD�g`�
-ǽZ��I:K��9�J|�
34�5>w at a|�*[=��
|�s^f;�?���P5
-�<��W�Ч��"+S�w؅N����n�U�+�0#5��
%�*�����W�I���Ӷ�Wwh�
|��k�Ԅ�0�}�3��L����L3(Z8�#��#
�x�A7�b�™�j ���eQ7�~i�~���b��@�!��C�D`d�d��e�m���"#a"Z��
-!J���4MXɎ���]�8:�z��/��Q�8:���3�F��|��"'
-�Z��=���(?jU��V�>�����;��)I��αoz���o��*��]h�Ԏu��V��.��|�ߤ�c�ֶ�\{��ٙ���X(	$�-&�M��d��ޥKK�ʷYQ[���#�
1�F�)��D#j|��f,��R�z���7?F�>�U~��(
����=��}�8��,"1 �E
B��X�1tj��x�}Vq�n���&W�c�)�	�D���G� KM
Om�H���f��<"�&6*��
��:�6��ųm�\��?0�‹
2��HO��6/,i���N:l-V.}S�fE�gcgF��$�F��>/�e��X����
�p�7V at 4���ۙ�
�8B�כ]֢�� �~���n���\������e��c
�3@���/DS�zAB�A M̀}쬯�����}y��y�߻���ˍ
��^���eV[�,]^ck
s���
�f���~��"�
0��La���Y�H��Wl*&�D�>����~T��p5���+��
ӻ͝�]N� AT
�4�uH�!!]h�
�R!xg���\�
���#�G�>
cc�bDg6p3!�,
�’	�
���j�+7d]=xc��Ηx����s��b*�2`mɉ��,��cD#��]��V7{��8 ]�!�+>!�ܩ��%갖,��q��e�w(K��'�Qy
x�w�r�<T��rHo��NX4ǘX>f"Iv���v��-��Y$
L
����
�I���_�i,���IIo������z���%+2�J!���� ���H�Xȉd�O�����zr�H^#>k�bxM�,����[���I������6����G�߼��߯��|3%�Ts�;+V��-v�z
H*�.��U\Ma�-�<�{>��4�m�i�����उ�y��횈�`��
#�b�/�l�h�[E3�\�3�(>�i�厝RW�m%��	$���
rj(��
�<��Vy
-����4Ťàl�(�#
r�$"$Y�&)�
$'�
u��M�е
O��WDW��K�v)GY��:#���=M!��]~87П�g�o�gQZ���/��Nt+��v�^��~������u[V쒚�j����⿴��U��*���e!�գ���+L�]c��^m���^k
-#J���G�˦�\�76�,/�4/'1��
ݾ�훳[򼻮Z�B��ڷ�L��Tw_W�����n��#8}��ﴫ�� ��z.����ߟ,k=�V�_��J���$�;ؚ�~ɄP����������U�:B7�͵~�r�����s�A�!$Gi�o����&�bj9�ƼXc1R��Ȱ�	�����A�b�����)'�/6����B�ќF�D�[W8�djRF�+8)`�Yڔ

�����\̀u[j/_��{�|��P��_8�����O�5��}][M�(Ƨ�yk搜Y
}��3Ǡ3O�.6���cq�An0�9�^��W��C5������C���k�v�o)a��u��7av��c˙aG��p=�c���vᐕ&��.�?o�	��ܰ��`?�lbV�ɇ�U��b0��n�L�I��>��K�yt�}T��I
b�Bp����}
L�=̬\�5f}U\��rb�x����Ǖ����;i�o‭�$��y���l�;��F��|ޘ��j�^�1Wě��lU���� [...]
-�b�ss��
���
g������E�ӹ8��9g x1��~.��8��}7���p�j+�J`ֳ[ �Eϰ�3O�Ik׬
N��p薦?h��߼y�/����/�"n���i�7�46v؋�����s��'��Y�(ן��Gh�����}��ivg�����:+� qގն�$���U#̶l�'��������#a�
-endstream
-endobj
-8901 0 obj <<
-/Type /Page
-/Contents 8902 0 R
-/Resources 8900 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8795 0 R
-/Annots [ 8878 0 R 8879 0 R 8885 0 R 8886 0 R 8887 0 R 8888 0 R 8889 0 R 8890 0 R 8891 0 R 8892 0 R 8893 0 R 8894 0 R 8895 0 R 8896 0 R 8897 0 R 8898 0 R 8899 0 R ]
->> endobj
-8878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 667.367 154.737 674.893]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 667.367 196.58 674.893]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 570.123 154.737 577.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 570.123 230.055 577.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
->> endobj
-8887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 518.658 154.737 526.184]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.246 518.658 372.321 526.184]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6804f93015ae6e1dc0c2e42e726380c4) >>
->> endobj
-8889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 502.717 154.737 510.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.984 502.717 305.372 510.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
->> endobj
-8891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.376 334.507 204.949 342.033]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-8892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.454 318.566 163.106 326.093]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.219 318.566 242.607 326.093]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
->> endobj
-8894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 247.176 154.737 254.702]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
->> endobj
-8895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.85 247.176 200.764 254.702]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.56 199.695 171.474 207.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
->> endobj
-8897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.448 74.333 237.536 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a3e575c477cd1ab90e4aaa2997d8163f8) >>
->> endobj
-8898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.47 74.333 515.72 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-8899 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8903 0 obj <<
-/D [8901 0 R /XYZ 89 770.89 null]
->> endobj
-8904 0 obj <<
-/D [8901 0 R /XYZ 90 151.366 null]
->> endobj
-8441 0 obj <<
-/D [8901 0 R /XYZ 90 127.076 null]
->> endobj
-8905 0 obj <<
-/D [8901 0 R /XYZ 90 127.076 null]
->> endobj
-8900 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F101 862 0 R /F8 794 0 R /F24 529 0 R /F11 613 0 R /F7 795 0 R /F32 764 0 R /F75 554 0 R /F90 758 0 R /F10 765 0 R /F13 834 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8913 0 obj <<
-/Length 2177      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W𔥪F0�U�q<�I����
�&S.Z�e�J�CJ3���� ��)J�4��ݓ$l|���� ~�p7�x�X`��Tw�����		���ǐ`��xB0��͘�0�V��͘�0]~}��Yt�<dQ�u:�)^�Y�I��
-
^.�<w_o��8
��Y
昡&�ʌ?��<���9" �H�`�}���94�
`��V�
>����?F������𞁭�g� B�!�]�5^=�6���z����z��k��c:����5Y���Bӄrĸi���'v���N�F�rx�x��PO�wc�ï�q
��[�t~�̓3�`��{���,��ch��N`'#��@�x�1�m[�ϋ��І9���&��'fԙ�~��Ր{� �X�]~%>#��L�
7�P&�k����?��P��8H}
K���,7�ܼ���`X2X��9M֛}qq�
_P���?�~{u���H3u$��2ͷY��`f,���1��2j�$�/��t�o��̍
���/���|� ��yQ�/����4�  �
�EF��_r
�1�
S���S&:6y	�b
-4���b�0Qm���
�)��p@����'\�pf���-� 4������k
��T%���A Y##����
"���I4!W��1Y[~�4Hʌc���
+k���l����}ާ�v)�~��*,c CẄ��9��*K���ѓz�i
���x`vֳ���[�ߏE�V at +���/�r�l=�
�y���"_����ץ�f��5�$<��3Ԍ5E(?�f� ����Cj���f��P?ZX3��=5�tU�7}�Ѣ�}�y�CZ�o�V�Z�Pm���d�d���s4��&^!e ��c��=0
-�����ޞ�����g�	�`�U�u�Ҫ}h�P��'��"�%�yL��ş.lſU�.8�.��
���]��촟.��n�(pt�
��.�� Ť
����Q,�I
�G׿ݮg�R�Z�ska�'�!A?�ڤd����v��I`<�$9�j fք5%$=�퀚8#g��ⴍ`��
-�<GJ��t7��FDkZ��
�������4���w�h�
��󨩊�ncq�G|XF�Ĵ�ӷq	��u�!$���4}�~�Ϯ�TN���h��ܻ�j�%
v
��T&2���
lI��x���yG+�9mh�y�ųp
�F�
��a/����_	?/�
�ٺ�k?[(���
�ٷ��
��W��‹#�s�Q���6�BM �\(��8�Y�6K�tM��&�v;�eo$��dž��<�D�̚�Ă�u�`3�N�����s�L���L�������cB(DN��szZ�6������$I5�j�� DY�ӻ�,-`/瓮�JW��:�[__�Q��ʪ��8C�b�WG�z7Ti�n��Y�Hv�1��U��B����I��O��j��,}�
-<��ޓJ
-��u[r�C$�!�JM�
���:Yr���P�!�Y X�yӂ�Ks �b��9�d��
̏~��|�V���dl۔�����&;����{�z�� 6f��P��
v7�hq��=�� ������
lƒh
K(9��h�<Ex�P��ل�9=-�G��W
-����{�����Z�]=�y+��{���9�`y�����x���xէ�p[�
�;`�?
�
 �
a��(n� }Yu�!�n�� \� �: 1��;0o����^�!RL��m{�L��vo�}� \�x���s`���|��B����4~�Xr��
ݚf�DP�h@�t~ow��Y"�o�6Y�l�鴚��肂�;��r̮��ѳ�q��8+^��$P�%�,i��2,�J��>]�=�)҂�z:��d2�����%q�۷M�谾i,����$_��u�
rg�6`���V	�'�t��c�B-�=I�!Z���
�[,�`Z#�d���
-(
�BwG���Rh�s�]�ƶ��K2���;�H���k�l�R�����m	�kpc��f���P,��n��"���aѕX���6Hئ�c6_�*դ��J�U�U
Fw^𸹹v_~���o���'��z�e
ى�,������C\���@�+(��2*2��B����i�y�^\<lP�
4KW/K�����d~,%�*-_CI�и*��^�J�)i	� �0��7�G�{�g��o�x�b��)��o��lS�
-endstream
-endobj
-8912 0 obj <<
-/Type /Page
-/Contents 8913 0 R
-/Resources 8911 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8795 0 R
-/Annots [ 8906 0 R 8907 0 R 8908 0 R 8909 0 R 8910 0 R ]
->> endobj
-8906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.275 491.078 362.097 501.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.007 434.908 444.83 445.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-8908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.086 74.333 422.655 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-8909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.486 74.333 511.506 85.237]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-8910 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8914 0 obj <<
-/D [8912 0 R /XYZ 89 770.89 null]
->> endobj
-8915 0 obj <<
-/D [8912 0 R /XYZ 90 721.073 null]
->> endobj
-8436 0 obj <<
-/D [8912 0 R /XYZ 90 704.201 null]
->> endobj
-8916 0 obj <<
-/D [8912 0 R /XYZ 90 704.201 null]
->> endobj
-8437 0 obj <<
-/D [8912 0 R /XYZ 107.713 620.703 null]
->> endobj
-8438 0 obj <<
-/D [8912 0 R /XYZ 107.713 604.763 null]
->> endobj
-8439 0 obj <<
-/D [8912 0 R /XYZ 107.713 588.823 null]
->> endobj
-8440 0 obj <<
-/D [8912 0 R /XYZ 107.713 572.882 null]
->> endobj
-8917 0 obj <<
-/D [8912 0 R /XYZ 90 556.155 null]
->> endobj
-8510 0 obj <<
-/D [8912 0 R /XYZ 90 533.779 null]
->> endobj
-8918 0 obj <<
-/D [8912 0 R /XYZ 90 533.779 null]
->> endobj
-8511 0 obj <<
-/D [8912 0 R /XYZ 452.457 494.231 null]
->> endobj
-8919 0 obj <<
-/D [8912 0 R /XYZ 90 487.591 null]
->> endobj
-8920 0 obj <<
-/D [8912 0 R /XYZ 90 409.379 null]
->> endobj
-8598 0 obj <<
-/D [8912 0 R /XYZ 90 387.002 null]
->> endobj
-8921 0 obj <<
-/D [8912 0 R /XYZ 90 387.002 null]
->> endobj
-8922 0 obj <<
-/D [8912 0 R /XYZ 90 316.326 null]
->> endobj
-8599 0 obj <<
-/D [8912 0 R /XYZ 90 281.656 null]
->> endobj
-8923 0 obj <<
-/D [8912 0 R /XYZ 90 277.173 null]
->> endobj
-8924 0 obj <<
-/D [8912 0 R /XYZ 90 204.31 null]
->> endobj
-8600 0 obj <<
-/D [8912 0 R /XYZ 90 163.236 null]
->> endobj
-8925 0 obj <<
-/D [8912 0 R /XYZ 90 158.753 null]
->> endobj
-8911 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F112 1773 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8931 0 obj <<
-/Length 2907      
-/Filter /FlateDecode
->>
-stream
-x��[�s����J3o��c�I/7I��z�����CK�ũ$:m���w� EP�d[L's��C�bw���p8�Mp���뫋7�*��(�T&W�$ʼn�)�ɧ	�x�����I�H*�+����~�z���G���۫�_.����t2�\|�����>���:y��6	�
�����?/p��{��qsV��.��Ŕ��Ô�I�~�J1A���
FT�[sy�.�F)1�aA
ٷ_��]]��]Hg�
yC�/�T��V��@�.�_�$,c�H)�

�
�	J��%p%}��I��pD�h�Ty��/v�5<B(�̐I%~mv����N9�<d�bq�US�&���|[��Z�9Ҙ�*)ȃ0�}Q�HuL���)Y(�ժ*�a?n�3*�X��9E�CN������ֈ[S�����߼*�qm	��s�b؂�$�F��shv���at$c��H0�
-�t���Ifu1���5` H�i��w�6������`
-�GY��倫O�j�
b)e�WX[��8*.E�N[aŢ@B�*�����I��2yZ�*Ƃb�F5
-
J"$~(n*pꙞ<]^�J����_���*?d�i���c0ŴDJ����� x��TO~�Og"��9D�:���b)����
/�6Ϫ�_�)ѓ|���

Ҵ��߻�u}��vDl1<�s�bV�
e����<�t!�n�󆀑
�H�%/��UD.��l|S�˟8�E��rr
��DR�8&�,'hńYR{l����w`S�
-��������E
-A���W�r�&y�o�yL� ��=�.�I��"��dD���6�,-����+�
(���CޘL�խ��D%|�ڰ�N���0E<m�\���~]_���'�@����
���|rx�9��zAu�(�
z�����j�Cl�����c�}hpn�:�
-�<�x��֧�DhD屌@�T�f���|;�p� �s���e���K��?�b�0ȶ���I,�'.$m�̬)��61����kc.��}eޥ��bJ@�n8̔���h܋�Re����퍿W���?��H>�q
�� e�u��8�'�t���K3}���%3�A�<���~�#(������~�����Ԩ�O��9�� �zK2Z�3��M�����O �o��y���M���$_���<Y�p�N˰���y0uJY,
�
�Z��� �R�X��OMl\{N�[K5
 �;ɐ���e�G�K�y*Fa�A M����e�X��1RX�2-gH��i`��j�A�B�0�`EmQ�~r]?�Esa�is���V�0�J����	
��%�%���k}"��1%8 at X
~*�k�0�'��C�>���Ïy�O0�j��r��ݥs�y��N��
-�N��c
��J'����p���p�*v$�$�TQ͠x�	�4
���Uz��JD��o���R
������z�e�c�MY����S8� ��l3U�!��K`�$��,@Ƀ�o���U��4f��S;���>(�B���Lh$�8�J�*�ᴭ[�]���j��L����OSS���:�]��XOC����z��W�S~@�Ŷ��]�.X	�{�Ay�	�
h0 �͊[�𘓭�=p1�Ha
-�|�C#�ɲ*7�on�N��E
pT�Wv(���*���_,���n������}�X�2�;hUܮ�]}�x��ս�#�
EY5�uB�
��}3׍�(�ϛ���e�U�i/`��5?��H�ϭ+��c�>H� ȦpS��	��*&~�eom�F�d�-�&�v���:�wE<�T�m-�W�P�8?*{r����o���%��{eJ~?�|�mo
Mx��=O�ۦ�b��rݚ^G�VgV���^�ު+��9�88=��6��z�0(WT'j����`��bg�1�N}j2
9Iچɺ��O��gEH���4 �&B��l��SQ�AR�0\�<7L2e)��(	�<&Hb��CA�.�6Ƣ��h��,l
��� f05%!�1δj{N�iH ��Q2e>Jڗ�w��RP�/�k���}n�8硫v#l�.�6�{��v�aqO�웭s�J|����L
GR�gG]B��
���`C`?��0���� {������
lEf��f��LN��/�B��4?�� `c�o��N�v
)�@���
���,a��X���U^�󧹳�amI��y��H��bD����Iɰx��*7
q��h�o2w�۳�y�h���*����ۧ�����e�h��@
��U1_��m�n��ς�� ��%|�w7yR����������^����܈��Z��cUD�
�ڧߑ]�t�ô��tڍ�~�5.Rk<f��c<
��
M�7�EE�\}kH�i��<|�6w�&�jѲK��	2�Qы;�H�	� _���+Ŵ�t�v��S!���1�t��E&ڗϚ�F96���A�DʐAbZb4F���=�{6������3p(�6�H
-ƴ��<���;RSw�<�h�A>VgŶm��b)�ī�ߦ�_�@��S!�~���
-IVHZ����cc�.��[!)�[C�p���s1
�F⌇,
�etG�)>;
�(�,dgpGD"E�(��)B�i�\
lbhKD�w�X�p�t�����T��
����-���-m􎝨I'^x��9{
rO�
�i6;���+n��p
s������㴸9÷+j�@�%�v��䥻v���	�g>+��ߺ:J��i,*�wwV4~fGw�G�@�f;U0I��C���C�x�Q�v�c
Ũ��6��ǔ|x�h�<8
O��=�t>4���#��T�((�_����|�_��n��@lOn�f{�Mr�A<��5'���NT�����_����)�}	�l{��f��z����	��~|��1�E�g�?-���
���
	�U�����͛��[�nѼ�
�����coH�&7ؔ��b
/76
�-%,�� �ԛb
-endstream
-endobj
-8930 0 obj <<
-/Type /Page
-/Contents 8931 0 R
-/Resources 8929 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8795 0 R
-/Annots [ 8926 0 R 8927 0 R 8928 0 R ]
->> endobj
-8926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.086 566.361 422.655 577.265]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-8927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.486 566.361 511.506 577.265]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-8928 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8932 0 obj <<
-/D [8930 0 R /XYZ 89 770.89 null]
->> endobj
-8933 0 obj <<
-/D [8930 0 R /XYZ 90 689.934 null]
->> endobj
-8601 0 obj <<
-/D [8930 0 R /XYZ 90 655.264 null]
->> endobj
-8934 0 obj <<
-/D [8930 0 R /XYZ 90 650.781 null]
->> endobj
-8935 0 obj <<
-/D [8930 0 R /XYZ 90 536.384 null]
->> endobj
-8512 0 obj <<
-/D [8930 0 R /XYZ 90 501.714 null]
->> endobj
-8936 0 obj <<
-/D [8930 0 R /XYZ 90 497.23 null]
->> endobj
-8513 0 obj <<
-/D [8930 0 R /XYZ 389.246 445.543 null]
->> endobj
-8937 0 obj <<
-/D [8930 0 R /XYZ 90 438.903 null]
->> endobj
-8514 0 obj <<
-/D [8930 0 R /XYZ 323.472 330.214 null]
->> endobj
-8938 0 obj <<
-/D [8930 0 R /XYZ 90 324.291 null]
->> endobj
-8939 0 obj <<
-/D [8930 0 R /XYZ 90 255 null]
->> endobj
-8515 0 obj <<
-/D [8930 0 R /XYZ 439.235 152.252 null]
->> endobj
-8940 0 obj <<
-/D [8930 0 R /XYZ 90 145.278 null]
->> endobj
-8516 0 obj <<
-/D [8930 0 R /XYZ 158.014 84.126 null]
->> endobj
-8941 0 obj <<
-/D [8930 0 R /XYZ 90 77.486 null]
->> endobj
-8929 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F11 613 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8949 0 obj <<
-/Length 2433      
-/Filter /FlateDecode
->>
-stream
-x��ZKs����W����Ѽ1��
6��k7NE+ksѺ�%T(@@=�}z^ �)J�rH6 ����7_7���6�OG؜��G'S6�HK*G��ƣ�k$$�5
]&#���	�89�d�mvu6�8��O7��ή>��~:=���y��U=>�'?ϳ�q���,��D%y9�A
�T'T��׋ߎ>\
}?"`
g�@�Mn�.���.��3�F����
��ї�ߏp�2�"���DHoAH ��s���ĘN��l��!�D�3+�a��(��ҝY놐T#�hdM[gEۜ�N���Ni��dO�a$c�u>�I^��P�ĕ���9҂
��"�td�٘QȨ1!�˪u
g
� �1:6�%��X%�D6����ҟX`c�J���
�Z��
k
-�,�o���MH�7B!�U�����y�R�KG�`���	ډ�C%]Ҁ!�/Y �X�|Y��̿Z���?�(#M��
���`�
<��E]�norwb�1�"��.W�Cf�B��k�4�d焢tw��B�$�jـ&�M��io�f@eHwrP�CV�@A�j�G�G���$�k
�@,h�9�F�*�Iwt+�YDVK����"�z���Cb�\���j,�����4��D��#
->�B�|4�Iq�
�
�3#&EDP�����B.q��g�bzu���zq ~c8(�Hav�z��R��t�R����)^��M]�b|(
"��#��j.��|LD��V)DB���EJTwC�8��u��y
fބ�_ɿ/����V+V5w��qH2- (
ԑz6�  M�7��M� `��'�7�'�d��Z���|�AIL�iL�ޑC)ر��B��{q(���G�<G�lj��=�S�Z�d����v��T��0L����مGq���AL�}�1���IM����� .�
�Xk�
��g�)�(�� �^�i�5޾_�0Fu�; 
ya$�DX	�(/ �|W���]Ut�)�e2��E��n{���>!��w'��� εB���p����X������C��ȴ�FP�ׇ�6=��PAs�<�9�J�YY�+�M�҈ژ|�Z�d��Yٖ��|�pw����:�L
����,��J"�Wf4�x����ݲ���ʊR�Mj@�v82j��� U�,�T#��؂M���M
�Ɛ��Ma��Ǧ �/�Mc��)
-���%0
�c�$�
Q�>�r3+�F2������K$X����@��B�d@�T�D��i6��JHv6<�@��nUm�ȟ�����r�IG9ڂ�6+vxBd�̉ K��Ş�<&�ƚ,�����2�^�qn, oL���ʜ 	댳���Mf���Ey
��
t�
���C�j����3���Mօ�`
'�1W퐐�
-	aC�,<R`a��(�߄
�&�
-
���þ-n�10��������Cb��{(����-��i՛1�b
-e_L�$�Lѫ��i��	��7H��
���.n:��8���6�X;�sa09Z_�d=�t4��O^�#�U[�D���t����E�Sw�͞���;���i��?x�t��M���Y`�;"�n��V0�yL�T8)E)%k�sz���ν�l��r�@,@�ZV�1l���B�>,��%���� �Ҋ„�������0����L؄ع1
-
�i=�C\�
w�t�!�U�����!�
?���4�I�hl��٤����b/
�<3l���cp	���.m��_n��[\3k[
\ ���dm8+��p��a���Ow�)B�<�0wϽ՝�)��⤩������|j<�[Q1��T��J���Xy9m
��d)'��������s��RM�Ú�e�ek���� ���Hմ�['��;8?�]һW�,�l�
*����M�=wH���)
k�n�~H�i��[6A�}���w
-��r�X��Pw����e�B��� �+S�,ڻ�}t�Z�3_���|o`�*|�5n
��
{Zw�6������ЇQ����0Q�f2�E
�/v��bp�:����s]�C��
I��X�����3cq�k	6�Tl�`CQ��v���[�A���_��^���yW�9�3<��W����[���V]F�O�p2���υ�󠸏����N{�����4���-���(�e�y{�������%��
�
�CE��妪
��.��V��[�I~x�k/�.��<~>�3?t�w{���v� \t�4]��� �$d��S�Um��+2���2]��2]��g��=D햺!�M7��3�Ξ�8������n�v��4��R�	���	h�
-M���}v'@��!+���{V.B�o��zۺ�Av4 '_������(�����qi
-
	�e�M�ޝ��|[\���Ѥ�]�ho
���z��*�.�.�Zg�� v�0AR��	p�w@
���;�����p��-�R�����
sa
-endstream
-endobj
-8948 0 obj <<
-/Type /Page
-/Contents 8949 0 R
-/Resources 8947 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8962 0 R
-/Annots [ 8942 0 R 8943 0 R 8944 0 R 8946 0 R ]
->> endobj
-8942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.507 381.967 236.499 392.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a42867df59ec40173391b76074f9f0fb2) >>
->> endobj
-8943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 130.503 399.496 141.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
->> endobj
-8944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 74.333 397.275 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
->> endobj
-8946 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8950 0 obj <<
-/D [8948 0 R /XYZ 89 770.89 null]
->> endobj
-8951 0 obj <<
-/D [8948 0 R /XYZ 90 657.874 null]
->> endobj
-8517 0 obj <<
-/D [8948 0 R /XYZ 90 623.204 null]
->> endobj
-8952 0 obj <<
-/D [8948 0 R /XYZ 90 618.721 null]
->> endobj
-8953 0 obj <<
-/D [8948 0 R /XYZ 90 545.858 null]
->> endobj
-8518 0 obj <<
-/D [8948 0 R /XYZ 90 508.799 null]
->> endobj
-8954 0 obj <<
-/D [8948 0 R /XYZ 90 504.315 null]
->> endobj
-8519 0 obj <<
-/D [8948 0 R /XYZ 351.108 446.959 null]
->> endobj
-8955 0 obj <<
-/D [8948 0 R /XYZ 90 440.319 null]
->> endobj
-8597 0 obj <<
-/D [8948 0 R /XYZ 462.877 385.12 null]
->> endobj
-8956 0 obj <<
-/D [8948 0 R /XYZ 90 378.48 null]
->> endobj
-8957 0 obj <<
-/D [8948 0 R /XYZ 90 297.056 null]
->> endobj
-8692 0 obj <<
-/D [8948 0 R /XYZ 90 273.59 null]
->> endobj
-8958 0 obj <<
-/D [8948 0 R /XYZ 90 273.59 null]
->> endobj
-8693 0 obj <<
-/D [8948 0 R /XYZ 90 231.885 null]
->> endobj
-8959 0 obj <<
-/D [8948 0 R /XYZ 90 227.402 null]
->> endobj
-8694 0 obj <<
-/D [8948 0 R /XYZ 90 187.67 null]
->> endobj
-8960 0 obj <<
-/D [8948 0 R /XYZ 90 183.187 null]
->> endobj
-8695 0 obj <<
-/D [8948 0 R /XYZ 90 131.5 null]
->> endobj
-8961 0 obj <<
-/D [8948 0 R /XYZ 90 127.017 null]
->> endobj
-8696 0 obj <<
-/D [8948 0 R /XYZ 90 75.329 null]
->> endobj
-8947 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8967 0 obj <<
-/Length 2157      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�F~�@^v�*s4��lR��
W�]��V�
��G*$@`l���9 HB6���a0�tO_�'�	N�M�9��}�Xb��T&�W����		w��uJ5��9�!aR#b$�姿������_�g���w�pB� ��N.W��op�������{�h�p��L^M�;�Q��pCw�����f� B�#��D©�c�3����涜�EV��r�D�r]dy=�Q�ӟ����Aܘf�K�.�D���y=��"��:�H�4��;CZ(�(i��$�,:k�tJ[�^�v9���w at s�g�ɮ��iA`@�*���(�y� CN�¹L�����Ɨ�&�k��=�Ǐ����q�w����F�V
�
���kw��Q=���<�_/�D�ˢڔ�n�R�C�J�6�P�Rd�i�n�R��
-D�ˍ�WP�*s��b�
*���dAu
���
.5��qzQ��b
��꫎�f\��ȫz�k����7>�6�O���u�GB�WL�6��hE!E�y�nd��|���0G��9省7e^
l��ݢ.76,�	�q�&Dv�
�"_ކ<��������5�M�
-��M6�"����/��0_{H���;���C ���3b⼟�M�I��=� ʌ:]��?o
-��� t���)��G��Ќ�Is�b@�
'���P���y����J�����c���vA}���|e�H)��i1 UP�d�_E�!��l�����e��y9�j

�2�`

-��T�0T��(A�"��y~9 ���`�)6����v^U�u
����4�-O����L	������–Îe�
rl����@A�R8h
QInD�����
��{<DAA�
�N�}�$��z�E�mn�܉O�)��X#�Y�SF�b�]NU���3�҃=��H)�b
x%N
�caĈA��I�h��5-1�i=�J�S�
T�sc�;큿,6�"˯�>��!�Ў
Po��E6�!���B���~G��X�7�������/tj��pբ����y
�����z��.l���|@m
-}v[*���v�k���R�Xoӽ�VK
p���!
�}=�I
w���nbk���o��];�<��GLS]��
�0�W���1����k�V�6>���^�ŇlY��*��Y
�� � N��~�9lZ<�}pk�\�p�V|>�ð�!�fڗM��Er�-��/�!��v{V�/�g����_a���&7 k]�4Ժ��ɝ���x0�W����s�����v(I�#
m�UB�H�6�&Ɖ�D_�.���v�\�jUaf^�0 �rU�+����TP��0��2�_,m|�Y����(�@
�I�
 �. 4[� �` O�"�(��
�+�l���N[�����P�l
F��*D����(�q���w+b�
a��3�}닋ͽGBK�6�L��y�@D�P�і� �)\p���?�Mk(�����M��r��3_�a>~m�.��d8|����6�mf\=�

�d�+�K�&�B!��1
F` E|g| �
����Ʃ��0� ��NA����+���Y���W��'�4(�
y��0������'q
W��0����t��pp8Tw��9�%�e����!:3�����;
���
� � �� ����A|b 8��14
xȕV�0�a
�d[F���v���
#�G ;��(�!!��	��~��[�q\�avC!�.`�����i���9B�e9�u�g���aw�Ο��gz���7��Loğ��0�V}z�f<�u�Ho�$u����p�p��)9p

ǍF��?q���C�.��]�3�H
�3;0� ����x�� k�����D����@&�~0�C���@E�œ��8Q
D�$?'ع!?������y[av��$	�Ǒ�l�Oo�����C~��Gtf�!H25��pDD��������:�Q�am��K�J�Wk<$�*ı��X�K
F,
�
-4�
a��x	R�=?�
r�RM2�
���%~������"�a�/����D)�v��a�N�8�~Œ'ۊ����V���`�v9�P~ ��5}v��ſ��ʖ�
-�V��6��ց�:tl˪%)�s���!��m at k��V�'�
} ��M]���]l�+�_#`
wq��1�DZ
]k�jU�Ѡ,w�ij�;���)8"
-endstream
-endobj
-8966 0 obj <<
-/Type /Page
-/Contents 8967 0 R
-/Resources 8965 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8962 0 R
-/Annots [ 8945 0 R 8963 0 R 8964 0 R ]
->> endobj
-8945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 685.85 286.611 696.753]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) >>
->> endobj
-8963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 641.634 320.364 652.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) >>
->> endobj
-8964 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8968 0 obj <<
-/D [8966 0 R /XYZ 89 770.89 null]
->> endobj
-8969 0 obj <<
-/D [8966 0 R /XYZ 90 721.073 null]
->> endobj
-8697 0 obj <<
-/D [8966 0 R /XYZ 90 686.846 null]
->> endobj
-8970 0 obj <<
-/D [8966 0 R /XYZ 90 682.363 null]
->> endobj
-8698 0 obj <<
-/D [8966 0 R /XYZ 90 642.631 null]
->> endobj
-8971 0 obj <<
-/D [8966 0 R /XYZ 90 638.148 null]
->> endobj
-8699 0 obj <<
-/D [8966 0 R /XYZ 90 598.416 null]
->> endobj
-8972 0 obj <<
-/D [8966 0 R /XYZ 90 593.932 null]
->> endobj
-8700 0 obj <<
-/D [8966 0 R /XYZ 90 554.201 null]
->> endobj
-8973 0 obj <<
-/D [8966 0 R /XYZ 90 549.717 null]
->> endobj
-8701 0 obj <<
-/D [8966 0 R /XYZ 90 362.785 null]
->> endobj
-8974 0 obj <<
-/D [8966 0 R /XYZ 90 358.302 null]
->> endobj
-8702 0 obj <<
-/D [8966 0 R /XYZ 90 157.412 null]
->> endobj
-8975 0 obj <<
-/D [8966 0 R /XYZ 90 152.929 null]
->> endobj
-8965 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8979 0 obj <<
-/Length 2088      
-/Filter /FlateDecode
->>
-stream
-x��Z�n�F}�W�)��V���'0�NY&p�S�a�R�&"�
-E��?���*J�a9�~"Y.ݽ�=�$�
����jv�b�AFR\��$$<��w!�����`���9�a�m���9�a�~���,��!�ɢ����6�Y���|A�ZG�]y����ٜ��&K
☡&����_}7��j����A8 �)
,7�w�q���������b�&��u
�2�i�۾H��DH�ʷ���$��my��e
���FY���wyT�nl���ęA-��3�� ���單n$T�!JVCR2�U{
Ƅ�;o��c���+x�&�A���[���v���M�ǩ_J��q�I���DWJ�)��`��,�
�\0�$X at 2���lo�S�
����,�㢙@��j�m��
�d1e�])�?��,r[��!Ha	Ɓ㔗{�\�8ի�(D���y��^��R�K~���إʮʅ��(&��
-@߀�R��x�)1�����{�.�-��v�fy{��ۼ��m�m*���8�빕��6ug�|�cN�>�n�v(
�qZM���Ծ��<Ж2$D"�����H+�D�YC:1�[	FO�u���U
�3WH`��0V
-�1�mW���S���
$M#\���o;.Q��*�5��,$���4Y5
(�V�NQʭ�<��j�^i~���f�B�ؕ�!�E[���:���2�Ֆ,z�r��fwCI_(p��ns�v���V���I<�<�Tl($�"�Ek�!H&��Ε�:ʽP%� MQu�|��V����Qx��$ڸ`I^ͥ���"��R�F&k�o�t]������F��4epV�[#i̩yJ�lL=Q�I���0+v8Q��T~V
�dhW���1R��������_���a�Y������7�\�������f	p�)�/FPf�Uى4&�/a�����deW��!��N4�R�O�Q&�(D	�W�dW/u.u��0�tO��Q ��r�*4Ӊ1��)r,�
�Y%C����6�D�j��
D���%��|�L(G���`�Cq
Z�����8d����0�u�:*!�R� ��t�� \���!���5�װk��u��.�V24�	���˻̺λz���1�P
���Ѝ���@<v׃ [...]
Fv�`3� �c
!ŤvF��
���.�o�#}H
K��
wq�Ǹ�8���.��
8d��<��9� �
�<#"��}��H�q�?����1n�����cܣ�1��W�%类:@V�M�Ը��{�@��^
@�M]ucZC /�����ֆ�#��a
��rL�c
�
-s�B_K���OJX�s�
�!�vO4t�p��`�NC\[d#pOJ��4 ���Cv��A����~
-�p���B�j��pH8�.}�
�
�5�1G�͂ˆ��t���5
� Z��
�Z at Z$TH�D*4F �$���\�8X�,j���v��@��(_���Q"C��?N3I�&|�a�L��9cFA��ɻ�:Fh���4
��r*�qd�������A�;����l"�_��ߝ��"3����a���Dƭ���x"3'��̭x.�n{\�-���Zrw7	0
�P<��(찟C}��,��>
�3=@r��P�(���0 at U��
�Bs�@s�#h�~6�ß������!�`�Q�E�ǰ�l�S�
>��F�y��$ *�Oc:i�
-Q����I~�
������!:�с�
-��#:D0�Pv��$aͧ�3��D�����|�c�
�M�	D� �&���KD��
˅{˛�Q7GE����-�����!�T!��c�v>y
�tH*P>:����R���8d�1��7X/����O?���?�
�|ʗx�Q�
-|PQ6�s��3P�z,����/���Q���ʛ��l��\�П��F�>���9|�Ci6�Ռ� �Zr@��؊a�F�Tw�ϊ(5���-������닋����&w(�a�h��9i��W�����/N
�,�UH��� Z+%�"��
9&J�bG���c�C�p��oRp����JC�s
-endstream
-endobj
-8978 0 obj <<
-/Type /Page
-/Contents 8979 0 R
-/Resources 8977 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8962 0 R
-/Annots [ 8976 0 R ]
->> endobj
-8976 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8980 0 obj <<
-/D [8978 0 R /XYZ 89 770.89 null]
->> endobj
-8796 0 obj <<
-/D [8978 0 R /XYZ 90 597.453 null]
->> endobj
-8981 0 obj <<
-/D [8978 0 R /XYZ 90 592.97 null]
->> endobj
-8982 0 obj <<
-/D [8978 0 R /XYZ 90 393.717 null]
->> endobj
-8797 0 obj <<
-/D [8978 0 R /XYZ 90 186.992 null]
->> endobj
-8983 0 obj <<
-/D [8978 0 R /XYZ 90 182.509 null]
->> endobj
-8977 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F93 763 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8987 0 obj <<
-/Length 2036      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~���Sk����/��L
������	F����-I.ɿ�Y���ȖB�B�y�mu��s�>[8�p�l�����'����28=
7HH�Zo�T�ٻ��#�����^�>}y��>�<=�|�x���t�XO޼��n�0bF��E�S�U�z���m�x�B!N��h6�O�q-�8M�ez�E�<�l��2^�͚8w�|-��h�n�]�-�DK1�qΪ͂>��c
Q�0Z�A����@�
�J�ݳV+�l��7ۢ4��f��M���ٺ2k����ζ�h�I�0�r�Ϩ����l�}�q�+����2dH��A����-!�O�D
�R�d�#�H��l	���!
������
�A����s��C8��8/�"�����Pj����i�s�>��"L�
��e�J{M�Z�DB�y�&���D1m.#�~Ih�{���f�fӋ(���H3������d��I�����4s��4�v=�����jI^y�՝U�Dy_��
-6�ld�p����<������_UiYTl3ئ���A�bC!�<嫝@�B
!"fs��K�UXx
 K�"��y��V���M)\m�$\[gI5=�I1M{�
-���_��G�����?Kӕ�����`H����Ps��S�Dz-�n�i��[QRk���L�����m$��叡�D%��^�R���1�0T�434��9���"qN��op��� �M
����_3��������,�z�T;��
|]�.�
�	�(A�[8O/�(YF���!
-6�e �(��-�C����&�lq'#����������j��4]ŋ��^�x��X���²�7�
ծzD�d3����X׫0x��$��A�UϪ6�#�C:)=ޮ�>� 9��_Ψ�����Q	^�RU��H��p��'q�'��F�쌉-u�lqD
O�U҇���˛,��~��3�w��\q��v��
��-<.qV�7 ���^hb�_�Ŵ]!-��C���q}�<fr���_��~}�
-P�
��
Ε�&��}@�5��Q*��)��� ��{���.q�])E�֪�]V�wQ(dy�]���p� ��
��6��FՐ�\
9͡
-#�,L�Q�r�(=w���]&K�l��Z��Fv�(��R�X}ȟ�%uw-�m4����#��=ܯ����a���+���EI=�l���������ۓӳ�����.�+o�
ۣ���l���x�;
�l�"b� �`���x��_�����IN c�E��5݄�AU b
�c�`t��}U�N�%�3���)ȶWfj�6�ז�!}��R3 M%;�d����*�(����m�WrQ�œ�>��
��(��	D����>��PDG��abN��k�N����@O;�~<�����@%;@�(���b�ַ�\�#/%am3=F���Q�2"`�]��DO�x�p5
�<��^�G\��T����J>ް~�G�ĐQsX
r����
�i��=!Dz=��m�_fy�vi<�S7�y���
�����yl�登�y��<���y�k�y�|	������y��xO�nF���.ͳwJXoO<͛������LϞ�0={�L"8:�g�F��al�=�-4�	��S���
��hLw"
���6w�G�n���=
�X �
�Gc�t���

�P���X��o���۳���ax�
�h�O�@b��žo��$>�
A�g�
��,��,P���H9`�0#X A����Or �
�/Лo��Ɗ�[
�F6�H����R�4X�Tl�
��K���t/���Љ�8Z
@(��~�e�w�������=+�gş͊�(VlF�b�eX1
����g���g��SC�(��~L�z�~k��?M��v
��}^>���7N��Y�$a��9ț7�O��E �U1�lί�&�W���?�(�v&�ԧůa�
}�X���y!��:�	�vj"K���uT�~g�_��?O�0��
|
�E�����l{�G���>V���
��p<�Y�UljM�2����-h
-endstream
-endobj
-8986 0 obj <<
-/Type /Page
-/Contents 8987 0 R
-/Resources 8985 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8962 0 R
-/Annots [ 8984 0 R ]
->> endobj
-8984 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8988 0 obj <<
-/D [8986 0 R /XYZ 89 770.89 null]
->> endobj
-8798 0 obj <<
-/D [8986 0 R /XYZ 90 629.641 null]
->> endobj
-8989 0 obj <<
-/D [8986 0 R /XYZ 90 625.158 null]
->> endobj
-8799 0 obj <<
-/D [8986 0 R /XYZ 90 432.997 null]
->> endobj
-8990 0 obj <<
-/D [8986 0 R /XYZ 90 428.514 null]
->> endobj
-8800 0 obj <<
-/D [8986 0 R /XYZ 90 224.398 null]
->> endobj
-8991 0 obj <<
-/D [8986 0 R /XYZ 90 219.914 null]
->> endobj
-8985 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F93 763 0 R /F11 613 0 R /F117 2446 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-8995 0 obj <<
-/Length 2381      
-/Filter /FlateDecode
->>
-stream
-x��\Ks����W ��2G�~(�
��v��8����[*�
I,� 
B��ߧoP 	��MT{ �
t�t�|_w �]{��v�����7�yI�w~��)n���m�}�	F\�c��	��x\��)���ݍ]��Ň�e
�w������A����	����'{e�9Ѿ
��1C�O��:�~��|�ی���G�	�����>~��
-~��È����z�2��x?�~��|-�'��]��|� �Z�6c�)��"����P��7�~+�Ha�-�3���n�OX�[��`�T�[UH$��rzKn�AM�p�i1he���v�ɽ���ֆ�
�
;�J�� �ԧ�h
&�lx�NR����M��m��|���WŐ8����l֡��MY�ڔ
-�X� #D6�`��-�c1e����Ȉmr�2Q怆�<�aC�HRJ�IDt
��duz��[PA����#����N����9A�2�ۛ7��QH�r��`��
.d��\���."J��lj ��r�2
-�In�z,Q��(�Qn�������ζHVp-C�u~�juI�
D%�-������r���n�Į>5��AT,��HJ�!J�*��_���6�"����(��$}�Ŗ\#Q9������Y��#݆�|]�A����R��1�/��eh�߯��E����
-;�a*��jQ.�UP�d
�6L��T~�iVj�[�AQ2$��`8��#��M34
-�R<�C�`N�7ا@P�{�ɩ�N5/��� �T�.�d�S�.G���0��.Xu�TpHz��]��a=
�աM��R���^9�_����S$�%�AV�ձD	hS�J��!��b�(��
���:ٟ���j��
�,�g�z�1wS{l��ʷq�)��D���j�

r
�5�)�ɓ��8b����Wl��Z���_&�P��w�
{B;
���
ЯI��	���|�Ku�ƥ�	�z�

-R�!�c 
>��#P�Bi!%MEqՈ'V���X<)��x��'�(
B_�n�
��\L�0
w%3�
���b
-tL�^�4�h��/�_
-iN��V
�Tc�l��F��$rXԕ�TL������F�ћ4�ċ�x�
�C�)҆t �
�CB�P�q�S[���"E��RY79���� �֬���F���D��x�@J�$d�v`B�d���M�_���C�*�]�,"�����vL�E���O�Kl��@���?=��1¦3���u$�H�8W
���L�v�D���ۈ*�M;[�����
�����9��v�Q <W��H�Gm={ʐ)���6�ⴱ����D�v��7)v�4W`�ʵ���20� �9��TO�]��Emy1��RSh����˦� ��:�LБ�,�i*�e������՝������K�v���Z��iw�#�|D�Wp9���9��ʮZ��jn���B�3��5F���0H�N���
D����eD���j����f��R�Ř�5'HOl�%�תu�Q�e'j����P������
�oR
 �y���k��C0�ۗ��;�]R��
15U�>�
W�����:nM� ̪��j��1值�D%~
-ھ$WmV\�lw�M*��F
+jbI�X6F,m�
-�=Ը`.�A���̫��d���c���M �=�1�!�k.����fH�D���!�$��0��@mΐ
��
�<
���Ew�:�
VN
 �Z�k�n�?�i���*Q�qT��L�
d�>B0-� i7�
���};�rK�� �8�c���� �k1j�c�NX
-F�>��
��3O����5ij.�
LЁ�L"^�L��L�C��qnú�̚�ҍ��� �Q��p�}�Ґ)�Tfǁ?;RUh��!��Z�>�}9M��
&��gC`�mR܇���>ԧ�=ۜ��C\�~6wks�P�����鏴X�ԧO���7� �����Y��/W�J�ܷ����ze���pO$ �Cd9�A$�2�P��Խ� 6H�)s!]�YW\�H!���
�Q`���)
-��	X�W[u����ԅ�|m������V�!E�'m��t�$�C5ç�H�Q�1�#'P\pdC�͑�|�23G:IE���"'КSd]�+C>C���ƶ��S����V�"�;�r^�*c�`�69֣
�,
�� c`F'��q;
�U��
k�ɧh�I��(�����N��cO�NHroTꔍ�Zt��Z_;e�����)+~=|�߽�u�C\�?�z���FBښ�-�	a�����^>;��]�{o㿸ׂ�w�����&�v@���6N��M$�U#W`�g[���M�W����,5J5�D
Q��&Iv�''���{^�e����sm
�r�*�<�6���C�q�>��
-)�(0�^�,��m��#Y}�j��7�?�|�e޻
����
�*�8
-endstream
-endobj
-8994 0 obj <<
-/Type /Page
-/Contents 8995 0 R
-/Resources 8993 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8962 0 R
-/Annots [ 8992 0 R ]
->> endobj
-8992 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-8996 0 obj <<
-/D [8994 0 R /XYZ 89 770.89 null]
->> endobj
-8801 0 obj <<
-/D [8994 0 R /XYZ 90 673.131 null]
->> endobj
-8997 0 obj <<
-/D [8994 0 R /XYZ 90 668.647 null]
->> endobj
-8802 0 obj <<
-/D [8994 0 R /XYZ 90 626.913 null]
->> endobj
-8998 0 obj <<
-/D [8994 0 R /XYZ 90 622.43 null]
->> endobj
-8803 0 obj <<
-/D [8994 0 R /XYZ 90 600.382 null]
->> endobj
-8999 0 obj <<
-/D [8994 0 R /XYZ 90 600.382 null]
->> endobj
-8804 0 obj <<
-/D [8994 0 R /XYZ 90 578.275 null]
->> endobj
-9000 0 obj <<
-/D [8994 0 R /XYZ 90 578.275 null]
->> endobj
-9001 0 obj <<
-/D [8994 0 R /XYZ 90 544.212 null]
->> endobj
-9002 0 obj <<
-/D [8994 0 R /XYZ 90 522.104 null]
->> endobj
-8805 0 obj <<
-/D [8994 0 R /XYZ 90 499.997 null]
->> endobj
-9003 0 obj <<
-/D [8994 0 R /XYZ 90 499.997 null]
->> endobj
-9004 0 obj <<
-/D [8994 0 R /XYZ 90 465.934 null]
->> endobj
-9005 0 obj <<
-/D [8994 0 R /XYZ 90 443.827 null]
->> endobj
-9006 0 obj <<
-/D [8994 0 R /XYZ 90 421.719 null]
->> endobj
-9007 0 obj <<
-/D [8994 0 R /XYZ 90 399.611 null]
->> endobj
-8806 0 obj <<
-/D [8994 0 R /XYZ 90 377.504 null]
->> endobj
-9008 0 obj <<
-/D [8994 0 R /XYZ 90 377.504 null]
->> endobj
-8807 0 obj <<
-/D [8994 0 R /XYZ 90 320.532 null]
->> endobj
-9009 0 obj <<
-/D [8994 0 R /XYZ 90 320.532 null]
->> endobj
-8808 0 obj <<
-/D [8994 0 R /XYZ 90 273.513 null]
->> endobj
-9010 0 obj <<
-/D [8994 0 R /XYZ 90 273.513 null]
->> endobj
-8848 0 obj <<
-/D [8994 0 R /XYZ 90 227.495 null]
->> endobj
-9011 0 obj <<
-/D [8994 0 R /XYZ 90 227.495 null]
->> endobj
-8849 0 obj <<
-/D [8994 0 R /XYZ 90 170.523 null]
->> endobj
-9012 0 obj <<
-/D [8994 0 R /XYZ 90 170.523 null]
->> endobj
-8850 0 obj <<
-/D [8994 0 R /XYZ 90 123.504 null]
->> endobj
-9013 0 obj <<
-/D [8994 0 R /XYZ 90 123.504 null]
->> endobj
-8851 0 obj <<
-/D [8994 0 R /XYZ 90 77.486 null]
->> endobj
-9014 0 obj <<
-/D [8994 0 R /XYZ 90 77.486 null]
->> endobj
-8993 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9036 0 obj <<
-/Length 2293      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~�� �����}�/#��d�`��ı�O����h��TH*���o5�WS�ĉd�����:���-�(��
6��.�9��w��%�4҂
-����ؓ�F\��̻Q%Ɵ���P�h_������݇�[�����ů
a�X
I�MW���7��߃b���T���|���n/~���e�E õ�D��L0�%���`�Gy�Z/�<4�\��ךOED���o��p������:��U8�P�Fwc_�@��ң��	#b��GI�bB}D����G3�C�ڶ�$YZ��]�2&��p���c)�J׮�u&�1�>w<�1�q�o{TC��gQ-A�l��EY
��pW��9œ�C���>uY�c��c �&Th�
�M�;�y���p�˘�Q8��a�zӞ�K��ԇ��YU�a�R�
-6z�{
Ƴp��
-r'����?�'Ta��B���,���B΢��v�^�
%�h:��m�3�@��#�Ī�/*	���o�<


��+kZ�6M�,�I
�l���}�a�I�#�H�a��E�
�1�&�2��ۤ��lòzc;V{�5�� �ц<n�M<����QڧY0XD�Y�?bҐF]D5^sڿ$F���5�
-	������-�d�Xv�X�'�G��������I�����q���7g����Z��;�&�B\J�F`V�:�,��Yph ���Far8%�CwIɎ��|�';��ܤ�/9)�$��@R>]mE�m��'�Cʜ�#����2�n��0�_��-p�E}�2�
�"pF���Q
-G�
�I��
r?�p��VG*�'��/ ��_��HC�%0�9i��@
-z/#��������)��
}>�ս�_cc�
�j�j�����_���ct>^�	���U� H���j��E���C��N��
-i�#��0�P��Z�C/%�:���dÚ�y��#���!dÆp��R����7v���W�����+q�!�Jw2|�
�հS��0� R?ը�j~S�D3@�F٘��S��W{pF��*�F싚�*�
uf���P�푡nR��� �
cU ۱�z��Њ@�
�<K��U�A
%��pkbK_;�)��Kz�S�jg߄�tL`n��*;�Е6U~m�)HWAs\��q( 埶h�8@
#J��f�I��"��}&h`ir
����c��C@��h{uU����,|
6˼o,%Ky�|
M1L��A)D�=H<:z�w�H�6�^���}׻M�@�}f�O���|/��0�u��naS�w��{�,�ٳ�$�'q8�|�d/j�f�

-Cg%�
-`p^�݇�6ڍ��%�$ְt��m�����鵶���J7Ӽ�

�̞���|@v?x��}1[���t�a)"��]*�w�ʌ
G½��R�F�(����D;��ÿ�i�Һ8K�1_�=��cV
c�
n�l<,�x>�ɪ���U+�W�d�H����0�Nj�
�s�!_TvL����'�֠���$�3i׮�d�L���U�[������	��RT�Z�F~���o�O8��z�D��}������rt)��y�Aꊜ�)�v

I����Wr8Zfa؁�����l���
-�Bׄ~4�Cu`m�|�a�	�
Cn��䖁ߔ��7�#t�aV�>��
-u(�uYd�lS�N�V��a\���e��%���ͬo� X�5��#��-h�#R%�3�
�Y���3"$v	�כp��
-����xj
-<�U)R�7�K�fF:/S�.�:�>�Q��E ���J)�"�#�~���/pH��
�UOٳJHa�l�-�" e|� ���%ݼ-��y
g\�'��ØoF�Y�~A	��j�od[�K ^>**
�;���ѕuf�H?W
�.�_����x1y���o[q��(Z�yEt�`�+� �k�J��v_���-��0��%</����
������C�
S�Q��z1�vU`����S��<}���;xSvZ�G5���F�1��6�Y ��=���?@��#f����oڡ
�D 'ʻ�];�@;������J�V«�N��)y���7������g�����h��Y֔���M�oҸK/�Mj+�rZ��݁�
զT$k�a��$>ͯo̐�Ƣ��K1�l�O.[�q]�V�WhG1��
-���y����q����& �7y�F`1�A���RwJ������3
ӿ�9���1�7��k�����0�j7T�
��6�	k�/����(:��=�Gff)ݼ�������fq��i�����c30��z��a5���UjC��D�S�
-endstream
-endobj
-9035 0 obj <<
-/Type /Page
-/Contents 9036 0 R
-/Resources 9034 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 8962 0 R
-/Annots [ 9015 0 R 9016 0 R 9017 0 R 9018 0 R 9019 0 R 9020 0 R 9021 0 R 9022 0 R 9023 0 R 9024 0 R 9025 0 R 9026 0 R 9027 0 R 9028 0 R 9029 0 R 9030 0 R 9033 0 R ]
->> endobj
-9015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 239.879 190.054 250.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
->> endobj
-9016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [193.87 239.879 255.627 250.783]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-9017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 212.288 190.054 223.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a558bee1e7045c2ed558e68002cb3dd4f) >>
->> endobj
-9018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.391 212.288 259.214 223.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.425 212.288 339.183 223.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-9020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 184.697 190.054 195.601]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aed024de0dc1ad69e380f706d25740cb0) >>
->> endobj
-9021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.391 184.697 293.535 195.601]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 171.898 190.054 182.802]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_acea4ab79eb91ca6bad6a126f08de1cc5) >>
->> endobj
-9023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.391 171.898 293.535 182.802]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.622 171.898 377.379 182.802]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-9025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 144.307 197.803 155.211]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a6135986b7669c295a1855279a9347433) >>
->> endobj
-9026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 116.716 190.054 127.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.794 116.716 241.6 127.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a804b0e848b19f18d99664d5bbd57a3f1) >>
->> endobj
-9028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.937 116.716 345.081 127.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 89.125 175.668 100.029]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-9030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 89.125 234.596 100.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_acb15b3a65e5dba1c113539f2912c75f8) >>
->> endobj
-9033 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9037 0 obj <<
-/D [9035 0 R /XYZ 89 770.89 null]
->> endobj
-8852 0 obj <<
-/D [9035 0 R /XYZ 90 669.666 null]
->> endobj
-9038 0 obj <<
-/D [9035 0 R /XYZ 90 669.666 null]
->> endobj
-8853 0 obj <<
-/D [9035 0 R /XYZ 90 622.647 null]
->> endobj
-9039 0 obj <<
-/D [9035 0 R /XYZ 90 622.647 null]
->> endobj
-9040 0 obj <<
-/D [9035 0 R /XYZ 90 576.629 null]
->> endobj
-9041 0 obj <<
-/D [9035 0 R /XYZ 90 554.521 null]
->> endobj
-8442 0 obj <<
-/D [9035 0 R /XYZ 90 532.085 null]
->> endobj
-9042 0 obj <<
-/D [9035 0 R /XYZ 90 532.085 null]
->> endobj
-1842 0 obj <<
-/D [9035 0 R /XYZ 90 364.108 null]
->> endobj
-326 0 obj <<
-/D [9035 0 R /XYZ 90 357.036 null]
->> endobj
-9043 0 obj <<
-/D [9035 0 R /XYZ 90 258.72 null]
->> endobj
-9044 0 obj <<
-/D [9035 0 R /XYZ 90 258.72 null]
->> endobj
-9045 0 obj <<
-/D [9035 0 R /XYZ 90 229.395 null]
->> endobj
-9046 0 obj <<
-/D [9035 0 R /XYZ 90 188.682 null]
->> endobj
-9047 0 obj <<
-/D [9035 0 R /XYZ 90 161.414 null]
->> endobj
-9048 0 obj <<
-/D [9035 0 R /XYZ 90 135.549 null]
->> endobj
-9049 0 obj <<
-/D [9035 0 R /XYZ 90 106.232 null]
->> endobj
-9034 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9089 0 obj <<
-/Length 2025      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�8~ϯ�k�Ԋ�K�/��M'��f���C��(Xq�rq'u�
		��1I��O� �s����6�6�
�~}t|�Z��|�t��[�džk��:�of|�lo<!��Ř��b6��x�F�;>���Cx��lur�'<cE�M�Vy���Ĥxt�<///�-����$�bV˵G�玿\�;�������AJ9(r=#��>}��
n�30�|�x��b�6-��������R	����5�v�my�K"�T�iR��~��4���T0��gB�l�D����:9/�_d<�I��0M6��>c�w�&��~���{|�[�
-:�P�4�c�Ƅ�5~�0�
����
`o��F`
����U�iLk#{zLq*,�T����"_� �9L>+odc�
�z�R5T��h�D	�`"
-�lǨ��,�y���b����)�f�Vo�Pb �i�O���,�7,W�.�����y N5��-/���4�y
�������;������zP7|��"j9{ |���i��u0c���+^�[^Q��ll�Q��f�͙�b*8_
������J�P)F��S�F6��4�8�:]����"K�seEEf���"Q�	
�d%��ѷ%��W� a�
-zyE�P_즀��xZ�� �
2�.�C܎	�T�6ǫ�s0<���^В�(�
:Hl� J�1L��j��n�e]�"�'z�y��!���3(�$���l��ox֔��T�fjH���Ϻ�E\��s8n��{(��{�K
PVZ���b�)�hJZ��<j
BI(ɨ]�媽�G!U�I��,� ��H�Nj�Մ P@ͦ���Vj�$��W	��*�Qů"��
 ꘌj��[�UR����c�S��������M�F�,��X�T
H�5`
~FĪ�Q�-����}��?i��0��S�E�٫,t���*��1|��+��	F�D�e�sg�/Q��EK�	�
����@�O,�R���ue!�/�0)J�rLY%4^MViϢ��blB����&IL{���U�
��I�d�.��xbC�IA��!̹�W�WF�
�Ș`�p���	~9�����L�f|�����A�&�=���!
�;�����mqz� T+_7j��~ ,7HX�DW��$���X���p&�WJ�<��l/^�\�f@�����l�U)!/f''ϲ}�%S��oW���]�BUq�
�|��;�N�"�
Mi�4/2�T_�*�I���E�IG��d�~��G.�`@`����
�F�.�_�؃5���$�I
��.es:��q�%�E�PAKw]~
a��ʛ7-+��,���n�}g�tVzv��Y�g�-�ݗ�I����f�ԛVm�[��V�S���pj�R;5�;��	Ř�bQJ1[r��ܬ:�3�����2~��&������e�ʭ���
;�7�
-�8�1i��,R)�
X���>h�qW���n����^/_���e�Ua���Ey��>0�r��.��<c(��V�1��l5����4EZ�h��
���J䲁.�SMKI
�Cs���}�^=
��"��d��lFuqXi���sXt%�C;��O@~:�1K��mˆ�
`q@�=��ŏ)�)�!��x�?�����
������'�
آ�j���+=W5=��]��
��r�=�
-CdR�����6�XB�t� %@Tk+�s �3����f�"��#Wgp}�L�B���[��ل�j—ݭ�9݌���;��C��}�>���d�<����x�;�c=��~K��X�A]�I�Z�
8����!�D@|��W�o=
�L�ņO�b���b9L��cv�Br�?x�
-G�.�plR0��|U�/�O��Ћ�,t֧�򠤿˞��Z�ő��
�V
�r��wm�B����wm�;��
�S
�C�k���Ň�⟜g��.DY�#K��h"�
�xV�.���i����_
}�^|-H׳D���('��7�94�s��6����v�>EU�TU|��x�1���#�D�*K�1�A���uM9b�Z>�/���e�����O�l��
-endstream
-endobj
-9088 0 obj <<
-/Type /Page
-/Contents 9089 0 R
-/Resources 9087 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9112 0 R
-/Annots [ 9031 0 R 9032 0 R 9051 0 R 9052 0 R 9053 0 R 9054 0 R 9055 0 R 9056 0 R 9057 0 R 9058 0 R 9059 0 R 9060 0 R 9061 0 R 9062 0 R 9063 0 R 9064 0 R 9065 0 R 9066 0 R 9067 0 R 9068 0 R 9069 0 R 9070 0 R 9071 0 R 9072 0 R 9073 0 R 9074 0 R 9075 0 R 9076 0 R 9077 0 R 9078 0 R 9079 0 R 9080 0 R 9081 0 R 9082 0 R 9083 0 R 9084 0 R 9085 0 R 9086 0 R ]
->> endobj
-9031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 707.957 208.395 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a92ed2a28d3c4689eec62eae04cdc2520) >>
->> endobj
-9032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 707.957 273.968 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-9051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 680.818 179.554 691.722]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 680.818 250.666 691.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aaf6afcf59d181946f02b27418d9b651a) >>
->> endobj
-9053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 653.679 220.579 664.583]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7bda239eefab2b9cc9cabc123bbaef31) >>
->> endobj
-9054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 653.679 290.038 664.583]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 626.914 155.265 637.444]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aa33b89d7143376193110dde339707b0d) >>
->> endobj
-9056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 599.401 158.044 610.305]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_acce6ad80815e7d09970ed92968967585) >>
->> endobj
-9057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.382 599.401 227.204 610.305]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 572.262 158.044 583.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a9eef881b5ea4e9dae4b2ff713a43af79) >>
->> endobj
-9059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.86 572.262 203.683 583.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.894 572.262 281.839 583.166]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-9061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 534.164 161.013 545.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3) >>
->> endobj
-9062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 507.025 170.687 517.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 507.025 195.165 517.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a2b29f5668213f9171cfdc666ef4142ea) >>
->> endobj
-9064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 469.301 170.687 479.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 469.301 187.563 479.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ab174d3f8d008aca83801ae0de294528d) >>
->> endobj
-9066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 442.162 150.493 452.692]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a6b57cf93153051d3aa63c33e34ee4127) >>
->> endobj
-9067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 414.649 181.845 425.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a9fe4a78fa5899317f5a060d7b607b5c1) >>
->> endobj
-9068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 387.51 181.845 398.414]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) >>
->> endobj
-9069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 360.371 154.727 371.275]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a25fce97f25e1814c62ec46b7a04ee942) >>
->> endobj
-9070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 333.606 176.505 344.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a37abf9e26c109cf608ec7829284883ec) >>
->> endobj
-9071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 318.99 450.955 328.895]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) >>
->> endobj
-9072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.134 191.718 306.038]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-9073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 295.134 288.852 306.038]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ab0063024b3761b3ff89c3f259ebac6fe) >>
->> endobj
-9074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 267.995 191.718 278.899]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-9075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 267.995 303.079 278.899]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7072dc2f1979eb1198aea49e10bcd59d) >>
->> endobj
-9076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 240.856 169.013 251.76]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ab9156785517cdd6c775b365ea12d2d18) >>
->> endobj
-9077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 240.856 248.973 251.76]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 172.15 203.075 183.053]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 172.15 296.324 183.053]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ad53075833d1bde0c9e36dd70afb4b967) >>
->> endobj
-9080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 157.907 345.599 167.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 145.384 194.297 155.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a071ec60375df0a0f5051dc431f445e37) >>
->> endobj
-9082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 118.245 188.759 128.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a02b52b4ef5b1806566495cb7b6d35abb) >>
->> endobj
-9083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 90.733 237.097 101.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.836 90.733 309.903 101.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a6e9c19c25562f9d1a71523d00b337450) >>
->> endobj
-9085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.965 76.49 398.006 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
->> endobj
-9086 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9090 0 obj <<
-/D [9088 0 R /XYZ 89 770.89 null]
->> endobj
-9091 0 obj <<
-/D [9088 0 R /XYZ 90 721.073 null]
->> endobj
-9092 0 obj <<
-/D [9088 0 R /XYZ 90 697.7 null]
->> endobj
-9093 0 obj <<
-/D [9088 0 R /XYZ 90 670.561 null]
->> endobj
-9094 0 obj <<
-/D [9088 0 R /XYZ 90 643.422 null]
->> endobj
-9095 0 obj <<
-/D [9088 0 R /XYZ 90 616.283 null]
->> endobj
-9096 0 obj <<
-/D [9088 0 R /XYZ 90 589.144 null]
->> endobj
-9097 0 obj <<
-/D [9088 0 R /XYZ 90 552.772 null]
->> endobj
-9098 0 obj <<
-/D [9088 0 R /XYZ 90 523.907 null]
->> endobj
-9099 0 obj <<
-/D [9088 0 R /XYZ 90 485.809 null]
->> endobj
-9100 0 obj <<
-/D [9088 0 R /XYZ 90 458.67 null]
->> endobj
-9101 0 obj <<
-/D [9088 0 R /XYZ 90 431.531 null]
->> endobj
-9102 0 obj <<
-/D [9088 0 R /XYZ 90 404.392 null]
->> endobj
-9103 0 obj <<
-/D [9088 0 R /XYZ 90 377.253 null]
->> endobj
-9104 0 obj <<
-/D [9088 0 R /XYZ 90 312.016 null]
->> endobj
-9105 0 obj <<
-/D [9088 0 R /XYZ 90 284.877 null]
->> endobj
-9106 0 obj <<
-/D [9088 0 R /XYZ 90 257.738 null]
->> endobj
-9107 0 obj <<
-/D [9088 0 R /XYZ 90 190.68 null]
->> endobj
-9108 0 obj <<
-/D [9088 0 R /XYZ 90 190.68 null]
->> endobj
-9109 0 obj <<
-/D [9088 0 R /XYZ 90 161.892 null]
->> endobj
-9110 0 obj <<
-/D [9088 0 R /XYZ 90 135.825 null]
->> endobj
-9111 0 obj <<
-/D [9088 0 R /XYZ 90 108.686 null]
->> endobj
-9087 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F67 3037 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9129 0 obj <<
-/Length 2323      
-/Filter /FlateDecode
->>
-stream
-x��Y[w�~���S+�+^���{�I�:�Zm69=�K�R�BRk��w�H��do��K����`.�|$i�	h��şVW�d$�y
�I��(��"���iz����@�)aY
����oVooV������ů

�$i��]|��LP"�4x0B� ��Up{��
jm��Gz�/�2��[�a
-x/������t��P��Rխ��i�z��`�C"�
�L#z�:	"��y�F���yc��wrw'
߻M	�b���I(R�!�ݐ�ȗ���(]�]q}�ڮ��5�Ίi6���f�~����;�h��w�ጌ
-�(wa���sa	����j̘Ҿ��ڝ��[Y�a��}j;��
��۴G���D��yq��[f)	!ZK��d�����6��,Z_0���i!QH
rPW���ɧK�����ۇKY��;�v���/s��/������>�@f�0KW���4� �(	�.���O��./+;od�nʽ�� �o0{[�3�
�w�֤��TBb0W� �e
u�Q�;;����‰u�����ȳN��Eu9^��z+c-�
�F���Hb��-�
��l�������
@{��,�
�Ort�L�Ue-
��x��O8L{U�� ���J����(��h���[Y㣲neӕ��
n����zQ=g�m��Z���ɺuMkz0l=1h9tj�w�:��'=�->
Z�} �*��
L/�*
�K�gblM

�ɨ�7v��?S�k��:Z�﬑�4
CHUc��cj��!��������
-��F��ö\oqXک�����>vH{#q6�K����'�ݫ�i+�Ɯ@��Y���:n���d�+�ؤõ΄�8`�L�4[�Q���%\��&qsC��M��0���"9^��~�\�9a
�	?Q>�jL"P������e#��B ��Dh03����P�Ƶ^�D�$]�
-]Fmtj�hw�؋�ܼvJ]8�<=.���ahʓ0Jmܾ�vaٌw�:��ݾ��
�z��
��3�8$�N�%M��镆�%јy�	t��Q�G�p�8u:�3Zb�&��yzV��츮�,�UU�����	~��$K�GB,"�����S_.c��G��TG�+�X�9�9Qݣ)�EOtڱyBh�y6�^x�0z�bİE�b�>NIlh�)�V�J�b�SqB@���>t�l��EX�8��5��d׎D<�W|x��(`QfB�y*��͜�P�
䏥5N��5�(

�'h4�i��y�ɶ�
��d
2hҙ@��S�����,�0g�{����I�M2
-��U�gN�����|R
s�i�B�
�o��� ���v&g7-���V_1����xS�j�������AHX�iCN�����d`�������7�`�PY�(�S��
�6
����LSXT~����j��U]�	�_#�D�޵S�k������/�¡��E�G��*��,w��6
�
�X]��
-p~���WɈF'�e$F���
O
-%��p`+�Pb���Hē�-�t\v�9I�x�vC�I�E�m
-����x�
���Q��h;i]�)7��
uR�BG����������ՆQd��
1a�	q�
�q9�$���bb�>�~5�<�ˈ�����|\OY>�j��Tw�&YO�f)��
�z�=t��r8�a�q֝�����bџ��h��6�/�{��Š�ۼ���C�H0��\���V�Sa�;�CU8���ę�,��gmk��>o ���������O)	ix��S!�����f��_�ݶQ��v|d�Fs:R�����3
�����ϳ_
k�~�{xbߘ��1�P���FY$���g(@�ʾ H��ȋx)c!�Un��}�j�
A�<2��
�-z
��
��Koy6�ςԝ��CY~���I
���	
��q�%}[v�6�ծ�
zܼf�R�З�y�b��$�
<�>G]��!uMb0(�S�ːW��)�d�u�ss���rBM��г��csCf��(�"WH��:��!�4�U�GI�k�0;let�@0%4
�:�KFx
Z�
3
-e�����A8־f�<�M#��
-��V��Q	t/-#\�'�.�"P����Ą������ߏ��	c>48�
q予���
��8d�$�f
�H��h�f/��̗�UT.[?�D����v���_�1'	 �
����!2��Wh&�%	7�c�Э�W��D�F��A��-��,xe�#�R,"v���䧟�������2��3���§+q�i���u�ف��Ji]�v��7��Ǒ=QH��Ϝm�����V��V��2��,3���{۲uw�1���IM�UM���7�}��
-endstream
-endobj
-9128 0 obj <<
-/Type /Page
-/Contents 9129 0 R
-/Resources 9127 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9112 0 R
-/Annots [ 9114 0 R 9115 0 R 9116 0 R 9117 0 R 9118 0 R 9119 0 R 9120 0 R 9121 0 R 9122 0 R 9123 0 R 9124 0 R 9125 0 R 9126 0 R ]
->> endobj
-9114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 659.383 226.034 670.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_adcd147a1c5474a820c7379514f629fda) >>
->> endobj
-9115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 659.383 397.32 670.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 632.173 156.281 643.077]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_afb150cd8c06fd986b4b57ffe29bc871e) >>
->> endobj
-9117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 632.173 236.24 643.077]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.452 632.173 330.596 643.077]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 619.564 156.281 630.468]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_afb150cd8c06fd986b4b57ffe29bc871e) >>
->> endobj
-9120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 619.564 236.24 630.468]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.452 619.564 330.596 630.468]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.27 545.704 256.414 556.608]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 533.749 130.826 544.653]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 356.488 184.027 363.707]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
->> endobj
-9125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 144.002 184.027 151.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
->> endobj
-9126 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9130 0 obj <<
-/D [9128 0 R /XYZ 89 770.89 null]
->> endobj
-9131 0 obj <<
-/D [9128 0 R /XYZ 90 704.286 null]
->> endobj
-9132 0 obj <<
-/D [9128 0 R /XYZ 90 606.298 null]
->> endobj
-9127 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F75 554 0 R /F32 764 0 R /F7 795 0 R /F8 794 0 R /F24 529 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9143 0 obj <<
-/Length 2380      
-/Filter /FlateDecode
->>
-stream
-x��Z[wܶ~ׯ��m�.	�O�
�8qZ�V�
"�+�������wp�+J��r��>��B`0`��+
l
<?�����Y‚�1���M�� �R�ch��ې`�՚`��W+�C�V����aS�U���/��V�����V�����}׫j��
�OJ�u��ZmT�""Tu��T�D!����Og?^�}8#��Ճ�DYu��
r��)���"�1�� �
�2xs��3�t\�-� Fi„�"!1‚	!���m���Sm�+�x���`��C��`M�v�_L�������j
���j
;�b�R�<7����rD��͘b��\Wu�
�V9
՚�q
�)l(v�~�$�]	ƥT�l.͕���
"P�S��fV����pӔe��<�)��ʚ�|ᕾCQ��"mэg���Ɩ[3:;�Z�G��fhm��
�s�f۪n�Թ�!¾�/�a��S����ϟ1:�%{�rnw��I&�"A$��b��P;ff,
�� }Ozk.
v�r5�n��8�Al�iZ[9̛��5�=�]�Jm
}1.��:K�u^����e_kJ`�)"Υoy�Tp����mg.��Z�~���e/!��	Y���(�&�a����(5ٟǚ���y:4�?4F_�?�Wk�X8t�t5+�n���
C����uf���\��1�]��1�4�t�@
��o:誶V�Q����\
-��Y<���
Kib�Vu�]��)�O�\WQg含ܷl)m�-t��"<������^�9�9�#��1ƸW�����f�ح7���zɢ:ۣ��� �j�c
��镝�_�ގ�n�a�k�ޝ��b���W+��u�16K,4[M@�C��vC�k:�ء|����FQ�ڪ[���P�z��^�U9�2P�����
����#�?]�#cq
- �	g��1$�/�Q���ԗ��0���}X�9��_`ܯҕ}���ƌ�'�=1��3�m6�br̦Y�
���lZ��
੡�2�
-�M�1S6���7:h4��	���	��!m��� �?!�Y���xe��Z��5p�b�p�wC2I���Ϳ)��
�����y�W�I���� �x�^�w'�N� ���;�7
�tȀ3�;�oz�z2��
٦�d�P��H�,�bsdX r��nF���H��c�4V�J�ر[ o���<w�nmY/�X&"ţ�+
P�d�/��ڏ��K��4�inE-��4��
-�
��]�UA�*@"u ���ܘ@�{/5s�I����
-ZT��paĨ����(KU/�1��:��^tD��ei��*[��*ˢ�W�r�ݘs��:"(�Z�Ŷ�eik����J:B�‚��g����Z���P�Ǿ]5z����4	�� ����Zp����d�
bA�P��@ qK�>s|��0��3�e`x��Q���@�9+��-��y��&*84�M}�+k�����VCd|���y���LIxj�8mI��{��p����<K�6Nb� ��4��*�V�k5劐�>��V�b�0����0Xa��}�]�E8}�]��V���C`$b2���{U`:��Q�A���*��CѾ�ZlY��x�C�<1d)��)���I
��c��1ĊX��`�-H#�?I2y NG>
�c��o��,j�n�+�h
Íg
<
x����(�l��B��=*떜���3�x�9Xm ��-yL���A��Nz���E�[`����
�a�
���;��)>�
�@�U])Dφ:s�|5,��������D ��F�W�O�DF��� E	�Q�*�]E
x�L��
-b:��Z���fzx��]VK��K�<��<F1����e#s{

4�8���� �S��rUC
��C�%0I�K�Q�F�
#^�~ڿ"ȃۦZ #��
���3�p��Q
i߿y�Ⅽ�rj��֐n�]��Cf�
�����N�� �}>T;-�ز��|dL`���?���������nG����������$ǖ�
1>���E�H�S8�t
dI�N�K��;�}�������GQ��+��Zzu�Q���	b7d��� ��`�����e�$���7:��$�d.��g���������?:)��:��
IH>�N�;@9���v/�z��G�zШ�M'���o6�מ(T��
���­���;.�>�4"��n9��5iNM䪭ܢ.�B����0HAR"��'s��̻�����Q���
�/z7����h)�O��h
-w�W�}��i€���m|<�����? �J(;��
t�R����C� ������_���A���&*nW��z𙖆K+�n$
a��ε�(��[�
|�g�FtP�h��[_������j��mQ�T�1v���<7x�gX5>1+j�
"��
9��2��`��=��'Ԍ���G?�u���X����r
q|
-endstream
-endobj
-9142 0 obj <<
-/Type /Page
-/Contents 9143 0 R
-/Resources 9141 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9112 0 R
-/Annots [ 9135 0 R 9136 0 R 9137 0 R 9138 0 R 9139 0 R 9140 0 R ]
->> endobj
-9135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 631.833 184.027 639.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
->> endobj
-9136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 510.79 184.027 518.009]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
->> endobj
-9137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 393.732 184.027 400.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
->> endobj
-9138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.892 196.728 312.036 207.632]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.804 115.868 445.257 126.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) >>
->> endobj
-9140 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9144 0 obj <<
-/D [9142 0 R /XYZ 89 770.89 null]
->> endobj
-9145 0 obj <<
-/D [9142 0 R /XYZ 90 274.129 null]
->> endobj
-9050 0 obj <<
-/D [9142 0 R /XYZ 90 251.384 null]
->> endobj
-9146 0 obj <<
-/D [9142 0 R /XYZ 90 251.384 null]
->> endobj
-9147 0 obj <<
-/D [9142 0 R /XYZ 90 181.313 null]
->> endobj
-9113 0 obj <<
-/D [9142 0 R /XYZ 90 158.569 null]
->> endobj
-9148 0 obj <<
-/D [9142 0 R /XYZ 90 158.569 null]
->> endobj
-9141 0 obj <<
-/Font << /F73 552 0 R /F75 554 0 R /F90 758 0 R /F60 532 0 R /F32 764 0 R /F7 795 0 R /F93 763 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9172 0 obj <<
-/Length 1723      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�m@'�1�wRA7�k��]_�&�>�E�ش#L�]I^���HI��8i�t�P�^L�
{Hao�a�������b^�I�w:��)
 !�i��4����/<&5"��Y��'o^�>}}zR�6xz:�8 ��� ���x>8{��	�~�a��]���
�
��w2�c��-QQ�g�j[F"�Z at 0���`���42�$�(���dboޚ8̍{8Z%�<Z$��p1^�M���b�v���J�R��S�哃�E��&��d���E���I�|������f%�i�A���GvLk�D�NR
y�
������1]��:Z�^�����/�,��Zx�
	A�Q�LbW��d��f�#VS�9�&���l�6��l� ��z�L�F
�S\{#�E 
`�R������M�#�f
BK���|�ʗ�
�*p=p9* p@�����Qn�
�h�8*ӧa�;�e �H1U���=�4
-���ZBG׮�
-�k��2_ea����/Lzef~�i-/�Z�w*�
-X
�
�iZ��Y��Jz߲F����*�Yqf�ql�FIe�S�.��e�2��&3�0-���ވa���X9_�h���Ȃ�U:��m�T���z�ϐr���
	�/å}*��j����ʰb�
#��৽
��&�=j]�����(�Aݟ�[�搧��S�n��q�zq�V�vd\����o�j��)T��&�(�܍�0s��C���=��Sv�bf��WSM%,�m����}�c����
��3�*�=s�yG�h�:	��r���몆-d�\{%z�Ҽe� y\ 2L��UJE�DZ5���o#V
z���UE�6� tB 
Y
�li��QI��0��������
-��e˄��yB���>8�a�cG ��
C�H��mH�XmŌ�,؍bN�
�
����";ҫ(b�|`��e�{�ҫd�ӡ�Mj��ٚ�T[��(V�c���
^5$j/�3�Mh/�u�
4m�4�	�S�:��(ǫ���ۂ�i�v)
YW�&�;r�@Zּ�כ��(P�
-I_0*�mun�����+3?7i{����]���2%�	�2e1��
��օ��I>���PG�S�l��j=�ARe���9��iY��j衙����R]���
�
a�8�����6	�+�����ȇ�
%
2�O�$Lו#��;�T�ڥ�G�p�T�7T�
f��Ϋr�v
��1� ' [.;4��/ڃ� ����|K }�e�,)�\��.J~��dw
�������-����50I�mU��恆Et����5E���]|�5�Lݵ��wv��'�w��`CFH�����Y�b�׶%(᝶}MO�>΂��	Z2 ����$����W���?&6�x�z�p��������ب}r�2�w�)0���;8-J�;�m�AK�ߟ�n���
�Pޮ��7�����oM�J��*9xc8È�z� ���K�2a_�
�Gn�cO0
�$�cv������B��n��‘ĺ9����(��"EM#�S�M1�f�.ʡ������a�
^DI���]
�=�~����9�&� ����m�u�O�� ������Dp���a㏉*I�mܗ?Vs܋��s�
. at X#n�F���F�
�	lfd��}Vz|���������+�;}&�0
�wg-Y}�JPُ�p��OLu�c���6��AyF��֧��<_
�f�Ifh��_��frqj�j��Ǻ�EZ��^�ˣ�+��h8dl
-endstream
-endobj
-9171 0 obj <<
-/Type /Page
-/Contents 9172 0 R
-/Resources 9170 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9112 0 R
-/Annots [ 9149 0 R 9150 0 R 9151 0 R 9152 0 R 9153 0 R 9154 0 R 9155 0 R 9156 0 R 9157 0 R 9158 0 R 9159 0 R 9160 0 R 9161 0 R 9162 0 R 9163 0 R 9164 0 R 9165 0 R 9166 0 R 9167 0 R 9169 0 R ]
->> endobj
-9149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 380.99 249.819 391.893]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_acd703faaddfab4f29bdd2958b4a9d1c3) >>
->> endobj
-9150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 349.008 249.819 359.912]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a94534f2d8132436533398ce6cdca13c8) >>
->> endobj
-9151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.156 349.008 413.065 359.912]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 317.026 257.568 327.93]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a8ba666eb5beace7b116d9f9e16e9a742) >>
->> endobj
-9153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 285.044 249.819 295.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.559 285.044 301.365 295.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ae23adcce73c0875e8a7dc6b3797e57ac) >>
->> endobj
-9155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.702 285.044 464.611 295.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 253.063 179.255 263.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.994 253.063 230.163 263.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a7ec7cf59ce4c8e5902704637c02f39bd) >>
->> endobj
-9158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 221.081 179.255 231.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.225 221.081 233.28 231.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a76aee99fe2a1984162c8efbf867a97b2) >>
->> endobj
-9160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 189.099 249.819 200.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.559 189.099 306.984 200.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ad21fe8d252487a1df3b3c90f94fbcfb0) >>
->> endobj
-9162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 157.117 249.819 168.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.317 157.117 296.743 168.021]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_aff430afd2381244ef77bb37670ce5627) >>
->> endobj
-9164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 125.136 180.54 136.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a71f52ba9ef61e0f336d025241003646c) >>
->> endobj
-9165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 125.136 343.786 136.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 93.154 178.239 104.058]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a53db1aeb67216c949d1aa627299ab5bf) >>
->> endobj
-9167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 93.154 341.484 104.058]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
->> endobj
-9169 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9173 0 obj <<
-/D [9171 0 R /XYZ 89 770.89 null]
->> endobj
-9174 0 obj <<
-/D [9171 0 R /XYZ 90 721.073 null]
->> endobj
-9133 0 obj <<
-/D [9171 0 R /XYZ 90 703.282 null]
->> endobj
-9175 0 obj <<
-/D [9171 0 R /XYZ 90 703.282 null]
->> endobj
-9134 0 obj <<
-/D [9171 0 R /XYZ 121.143 622.199 null]
->> endobj
-9176 0 obj <<
-/D [9171 0 R /XYZ 90 615.559 null]
->> endobj
-9177 0 obj <<
-/D [9171 0 R /XYZ 90 593.512 null]
->> endobj
-1843 0 obj <<
-/D [9171 0 R /XYZ 90 516.069 null]
->> endobj
-330 0 obj <<
-/D [9171 0 R /XYZ 90 506.915 null]
->> endobj
-9178 0 obj <<
-/D [9171 0 R /XYZ 90 402.026 null]
->> endobj
-9179 0 obj <<
-/D [9171 0 R /XYZ 90 402.026 null]
->> endobj
-9180 0 obj <<
-/D [9171 0 R /XYZ 90 368.311 null]
->> endobj
-9181 0 obj <<
-/D [9171 0 R /XYZ 90 336.329 null]
->> endobj
-9182 0 obj <<
-/D [9171 0 R /XYZ 90 306.073 null]
->> endobj
-9183 0 obj <<
-/D [9171 0 R /XYZ 90 272.365 null]
->> endobj
-9184 0 obj <<
-/D [9171 0 R /XYZ 90 240.384 null]
->> endobj
-9185 0 obj <<
-/D [9171 0 R /XYZ 90 210.128 null]
->> endobj
-9186 0 obj <<
-/D [9171 0 R /XYZ 90 176.42 null]
->> endobj
-9187 0 obj <<
-/D [9171 0 R /XYZ 90 144.439 null]
->> endobj
-9188 0 obj <<
-/D [9171 0 R /XYZ 90 112.457 null]
->> endobj
-9170 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F110 1507 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9224 0 obj <<
-/Length 1848      
-/Filter /FlateDecode
->>
-stream
-x��Y[��6~ϯp�
�
�J���B���2Ph���L�q�ĭ/�v¯��5�7�Ҳ��Ї];�tt.�9瓍����ǣ�FG�BωQ
��9[81vB?F,�_s�՘`İ;!��K�8��dz�R<�����d�,��I�=>~��d��l����2<�)O�Fݞ���h�˔�@��xLc�9{:zx6z;"�v�R��0r�b��
v�0���ȋ#睜T8>��;/F����#�ĭ�h�@V�6B!�4��h�
�6�r>mi�����mV�RA��ѣ�+;�#Ϗ�����5ky���vB�6>��[ui�M�
=i��K^��
�
H���
`��Ӫl�ig���F=�4�i+5���
-ٜ���'�IU�[5/IS���f
Oҕzj5�[��J�GV��D_���<m�3�I�ND�^��>
9����F�ĚJP̘2u�B���~F��~��`���!
�?|�����.�P�cX����WaZTy^����e�R
��\?\�Y�jطf��`����1�BHU�я��"T���WjN��P=�x��$����S�
�, at q�Eҗ4��b	G
�I
"4	 �lhuo�rx٨��^��
^c���Q�Pu���������a�ܣ�7���x�8bf��i٠_f�Q�Ħ�!���v�Ly9.���
]���9b�~v�V&f�
J	�[�զU���iA����>" ��pf��+l����� L#؜@�
0�$���
��Jl�D���P�lM�_EUs�e�5\1]_7�͚��O�M�/K�g�>�X�6�̸�C3��[��"���EVM
幰�kU�'f
-L�6e({��i���Sk�
v�u�AY�|���+.�)>��	7�UX(l�
��F�n��ha5��M����檫im�����;��NҎ�W2
�uU
���4�Ƙ����"��c�^_Sʆ�`"��
�V�0]�8��Ri����p����Pya����=�4���C,
--�1L��	�,B��	'�G�����q��ő�W��� XdWE�I4Vdq����+� �#�+ ɩ�_21�y���-T7���
�|I�=����U�rn`	��
�DX��������h,
#orū݀)�3��j�mV��f�u���L�<����
Y�LT�$,�r<�����{��C�Wq�|����Z�S���?ڔ�(�ߠ٢�R���-i�=���RV�a�����
�)2�w�
�tXP�B����6���Q�h�Lv[���%G�(���ôSo
`��� �nz.j`�o�P�������%�́Ncy�����0���|��>�R8�Y,@�/�ޱ�cy�z����(���(]
RF�^�om����C���D�\:����B�2jbHr8H�)2���o�oDᒼ�x at P!
-�J����vU�6K��_��u5�w._nd���,U
��lY^�Hޗ�56V����2/�zn��{5�'W�b&d�L[��Jw8��()��\�Fn��-D�\ ��*�6[�Q�g�=�CAd�o��gȳ��0
�g�ȻJ@$��k�A0��7�}dk�#�"��U��`
��z!�(#���[Ϋ�Ț_&���jE~��0S��H2��.y�6�γ�/:��P�y� �S`��+ ��>	���WJ4���_G/����SbZ�A��oU�/E���e�o?�r�W
��3��w�9�}��N��+��"|Ȁx�
-��䙺y���;�������$�k��?O�2� �R�o/�9�*��p����M{�->/�ݫ�]
�6ˆ�K����
;b�C�3�Zx�� +a��<��Ə
�7��x��v�&aH��|hꁣ'��<����O�.
�
-endstream
-endobj
-9223 0 obj <<
-/Type /Page
-/Contents 9224 0 R
-/Resources 9222 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9112 0 R
-/Annots [ 9168 0 R 9227 0 R 9189 0 R 9190 0 R 9191 0 R 9192 0 R 9193 0 R 9194 0 R 9195 0 R 9196 0 R 9197 0 R 9198 0 R 9199 0 R 9200 0 R 9201 0 R 9202 0 R 9203 0 R 9204 0 R 9205 0 R 9206 0 R 9207 0 R 9208 0 R 9209 0 R 9210 0 R 9221 0 R ]
->> endobj
-9168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.856 665.984 513.996 676.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 654.028 125.317 664.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-9189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.852 291.351 245.94 302.255]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a6e613e3f02e896503d38da788ad593b8) >>
->> endobj
-9190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.277 291.351 329.905 302.255]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.331 267.776 222.419 278.68]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_ab8dbbfce1fd68d57df6b05d5cc74c012) >>
->> endobj
-9192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.234 267.776 282.862 278.68]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 206.827 191.216 217.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a9a22818e12d0abab8d8a8e0d3346f51a) >>
->> endobj
-9194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.032 206.827 251.659 217.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 183.252 191.216 194.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_acf54a358f4ddf09f56364da87de68a49) >>
->> endobj
-9196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.032 183.252 251.659 194.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.392 183.252 350.02 194.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 159.677 190.26 170.58]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a4039bbdc92a28fade431cb98f20b0fa6) >>
->> endobj
-9199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.075 159.677 250.703 170.58]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 136.101 190.26 147.005]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a11810ad660a4aa63766e8ebb0334b7d6) >>
->> endobj
-9201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.075 136.101 250.703 147.005]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.436 136.101 349.063 147.005]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 112.526 192.471 123.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a29b14636d21c90e28ee1821666dc1d64) >>
->> endobj
-9204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.287 112.526 252.914 123.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.647 112.526 351.275 123.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.36 112.526 448.988 123.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 88.951 191.366 99.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a2f220b5f73e79a2e6feab3a97a7e2445) >>
->> endobj
-9208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.181 88.951 251.809 99.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.542 88.951 350.169 99.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.255 88.951 447.882 99.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9221 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9225 0 obj <<
-/D [9223 0 R /XYZ 89 770.89 null]
->> endobj
-9226 0 obj <<
-/D [9223 0 R /XYZ 90 721.073 null]
->> endobj
-1844 0 obj <<
-/D [9223 0 R /XYZ 90 463.79 null]
->> endobj
-334 0 obj <<
-/D [9223 0 R /XYZ 90 456.67 null]
->> endobj
-9228 0 obj <<
-/D [9223 0 R /XYZ 90 358.368 null]
->> endobj
-9222 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F13 834 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9266 0 obj <<
-/Length 1989      
-/Filter /FlateDecode
->>
-stream
-x��Ks�6���<��$��&љ
�$�$m�4qOI�CK�©D�$�G~}J�DIv�4j��Mr�X�~X, �`
��e����I����28�"���p7
->�T������1"J�W���ߞ�x{����8�]���q
-��`8�}���<~
`�T
\[�i�)��$������-�i��
����/"B!΀O�
-�x�Y�q 0���y:��E�؛��J1,��p��D�7�YR��8[Ue�>a�7�	_�yw�*����.�
�<�b�y
�
tTO�Vv�ge��3[�ň�8@�.G�})B�O�N�Fd��F��+x��������
-%%�`pD��a(�
�7��Fz�,z��9jiZAk@)���>ET=�-��d8� �y� ��wn���������ٺ�tU�Qs|Bn|�b/2э�h�5����Mt��
�N���?�O�t6�B�EW�
�Vy��MZ
$٨S�@R-
�ڡE ��w����zr�}���Fg�Gz�ޫd2ם�8�#K�	�.
TH�
y�h�j�O�.�@Z
�T"�l�)���?��� up���%�H��4g�UZ�1�.���O��WϠ�6"��D
-�
戗�
��R��f+ ME�\J0c���ͬ�x��"4w�0"��3���>��#������]�}i�p���+]��auV#�8��cf_u.c"�6U��0��*
�KAN������wK�{q���?�.�y��z��εQ�N��9�}�}����2���}0�:�e_��ﵚ�,���X;�d�IYy9O�>�B/T���F��("w
];�%w��L�[�3��6���~wT8�>rnz��yaQ�$L�%s!N��J�8si~�.�掆y�gy�ZA{�&{��H�t6J����I�������3�RT��J&Y-�z�'����T_�̛��ʉk�ʽ
^j�hM��g]
(�m-���^s�k������/D
2�:Bd.6J-�dR43(Tu*�yUq� ���*I'�
�1ܕ�"�U&�o&z#�^��y>_�!�K��z*s�Y��f���+sP�w��")l��6�
vأ��ع�/l��0���}2I��„�<3�بD�y�K	��ħ��g�	���l�GH�Z��L;�#

$jkn�`�-۳�=y�f�$C��L�
a�
e޴
5�O�r�pP
U
�u
-1͋E�~Oq�Z����;��+��������Ef�RU��������b|��$[I��
�q�T�I=)�d�ԟ3O�{=���oN�ٰr5��9ΧP�$k8�MY��7�".�Z���<��,`�<��
�Q�b�8ȳw-/�V	$����)bh�iI�&
�K��		�׭��!�u<�
J%b8j�se̩Ss쪝r9���
-iOԐ�ct\��V�� 
-��Q�G��H�H��֛*���rCB���L���>���;
-I�B){F�ڔg�\s*vi[_�BgC�(����$�br�&�v��
^��3ξC��޴��Y
�ntA�uIu�A�
-fg5��
���%JA��>̡zΣ�9]��
-y
���j��u�*��.��{�(���N^R�!U�.�l�2=�*t��c��ҭ�_XU����v[	��C$�)
C~�+)�s��j��"?f+�4��=,z�V^Y��,fF�S�
-K;A����g�ı
G{`ƨ�u����yڡ�`b1Sn��)GX�oc��2��8amR���"'���ޝh� )8X����V
������AA�
����a[�
-�9*��{TȠ���3���j�h&�&�!�(~c�y��O敾���Χ+�����Z��>�MB=fӃɦ0�I�oe�
@oɪ1Gk�
;�����o!CG�k��orʦ�Kv�D����ۗ�7���)
��l�n �K��ozg"1�}�2�_��߽����g����ӛ$s;�~�ٮ�t�<�!nP��<��k�yFÑte��|>.u6F�|�Xc�
�]��n��_t�J��o8���
-endstream
-endobj
-9265 0 obj <<
-/Type /Page
-/Contents 9266 0 R
-/Resources 9264 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9112 0 R
-/Annots [ 9211 0 R 9212 0 R 9213 0 R 9214 0 R 9215 0 R 9216 0 R 9217 0 R 9218 0 R 9219 0 R 9220 0 R 9237 0 R 9238 0 R 9239 0 R 9240 0 R 9241 0 R 9242 0 R 9243 0 R 9244 0 R 9245 0 R 9246 0 R 9247 0 R 9248 0 R 9249 0 R 9250 0 R 9251 0 R 9252 0 R 9253 0 R 9254 0 R 9255 0 R 9256 0 R 9257 0 R 9258 0 R 9259 0 R 9260 0 R 9261 0 R 9262 0 R 9263 0 R ]
->> endobj
-9211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.658 707.957 203.949 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a7f9dc23eef0ab2ef9d07f4d53177afce) >>
->> endobj
-9212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.323 707.957 264.95 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.417 707.957 341.045 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.406 707.957 416.034 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.369 707.957 513.996 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.682 696.002 222.309 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 670.552 191.923 681.456]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a952922658abcdfb880fcf0a8483c9620) >>
->> endobj
-9218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.739 670.552 252.366 681.456]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.099 670.552 350.727 681.456]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.812 670.552 448.44 681.456]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 645.103 211.849 656.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a83b02e8cbb5d14a2ebf2843e6551391d) >>
->> endobj
-9238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.664 645.103 272.292 656.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.025 645.103 370.652 656.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.738 645.103 468.365 656.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 619.653 211.301 630.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a38ab8dc3ca19cacef112ca316bc7ce09) >>
->> endobj
-9242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.116 619.653 271.744 630.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.477 619.653 370.104 630.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.19 619.653 467.817 630.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 594.204 216.681 605.108]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a081a1af02e55d9903d0bf3816a6e91f1) >>
->> endobj
-9246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.496 594.204 277.124 605.108]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.857 594.204 375.484 605.108]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 568.754 213.662 579.658]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_abc1d7e892f343522c751d672d5632f17) >>
->> endobj
-9249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.478 568.754 274.105 579.658]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.838 568.754 372.465 579.658]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 543.305 215.316 554.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a01c5bdd401e8bc17ea983d941be2aa49) >>
->> endobj
-9252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.131 543.305 275.759 554.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.492 543.305 374.119 554.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.205 543.305 471.832 554.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 517.855 191.923 528.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a84565fd9471a52f83618d0d5ce461c3c) >>
->> endobj
-9256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.739 517.855 252.366 528.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.099 517.855 350.727 528.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 492.405 157.254 503.309]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a6d5c75bcc32f8aea006e8da4b3f736b2) >>
->> endobj
-9259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.591 492.405 241.218 503.309]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.951 492.405 339.579 503.309]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 390.171 145.631 401.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
->> endobj
-9262 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [179.204 378.838 288.793 389.12]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://gmplib.org/)>>
->> endobj
-9263 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9267 0 obj <<
-/D [9265 0 R /XYZ 89 770.89 null]
->> endobj
-9268 0 obj <<
-/D [9265 0 R /XYZ 90 508.442 null]
->> endobj
-9269 0 obj <<
-/D [9265 0 R /XYZ 90 451.781 null]
->> endobj
-9270 0 obj <<
-/D [9265 0 R /XYZ 90 361.801 null]
->> endobj
-9229 0 obj <<
-/D [9265 0 R /XYZ 90 338.109 null]
->> endobj
-9271 0 obj <<
-/D [9265 0 R /XYZ 90 338.109 null]
->> endobj
-9230 0 obj <<
-/D [9265 0 R /XYZ 90 296.405 null]
->> endobj
-9272 0 obj <<
-/D [9265 0 R /XYZ 90 291.922 null]
->> endobj
-9231 0 obj <<
-/D [9265 0 R /XYZ 90 252.19 null]
->> endobj
-9273 0 obj <<
-/D [9265 0 R /XYZ 90 247.707 null]
->> endobj
-9232 0 obj <<
-/D [9265 0 R /XYZ 90 207.975 null]
->> endobj
-9274 0 obj <<
-/D [9265 0 R /XYZ 90 203.492 null]
->> endobj
-9233 0 obj <<
-/D [9265 0 R /XYZ 90 163.76 null]
->> endobj
-9275 0 obj <<
-/D [9265 0 R /XYZ 90 159.276 null]
->> endobj
-9234 0 obj <<
-/D [9265 0 R /XYZ 90 119.545 null]
->> endobj
-9276 0 obj <<
-/D [9265 0 R /XYZ 90 115.061 null]
->> endobj
-9235 0 obj <<
-/D [9265 0 R /XYZ 90 75.329 null]
->> endobj
-9264 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F66 3179 0 R /F119 3070 0 R /F90 758 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9288 0 obj <<
-/Length 2153      
-/Filter /FlateDecode
->>
-stream
-x��Ys�F���+�+�h��U����e'�R��q� "YK	������I���!ey�I������Mρ����ד�L�~P�3�H*��;�`Oq���_���'	<���=%�������b?Y?-�p|�iu�
�O�^����Û8��v:��߮��.��ktO���x
�Bʩ�a��7o'��L
&\�
�]Hio���{��
��0bF{3���)�ϵ���	.Z����(���m#r�4D�*��8��OV!�ˉ��6Ǯ��P4Sð�s�"�M��3D�2ix�Z-�������	��u'{�0�lÄ$HbY��#� D
�hD��B��7%�T��'�.u�E9"Z��t��x�j�;]�H���
|� t")|23&)�Bx3����L��6Zi���L����3��(E���eyS
�4qX���fUG���7��H�Q�
FA���r<'w�����jJ���ڭ��96O�F��G��+��'��kž�C �*
(c�	���Q��3���jrA;����n.�=)��l.XW����@N�B-ۑ�l�
-z�)N
�T��
-�
�`Bm��	\�/�	�m.A\�_�d�)�~E�d�
�(�aġK�DZ�!��h �CU
�1
�4�����R���F���A��L�R-(�]P��
���9g�M��= 4&�co���
l!�ԛ1j���9����
�G��؇?!G�
3:n'y�柤z�+J��=�TV
7����4��%�	���ﲡ�ψ?x��w�Qԡt�Q�����(Y�G�O���Z�~<J��`h�/����LWwDE�W:w�p,

�G�`��vy`w����u�C� lh+���
����9�@�`=��J��.?��Gn�S�
�?]���3]RIv����f��s�$�x�d�_�]�k�A���"�p� �*L[�%��.����(��ZQ/���V�~
�z�h,/�
tmhuM�p%M �͟��u��TI���UFo��tu���jhb�T%_`
�b\tЀ
Ӏ?���@�m��
~6@
��&������g��%��8m��8-���'���L�*�9���ai�ǫ�z�
Z����qͅ!@�����dz��V���V=7����U��+Z�:g��������Qr���^5�\t+�d� ���
-<�	����M
� f at u6u|��$�Ǝ��Y

�h�
�
z�(R�����R�!/�
5�
�y����pg���
�8CP=���c�Ta}6{�T	\@�曕�.�p$%��e�UA���#
Ճ���M����v��t�?X�_֭n�X�Vb��/*�g�.��{���;�h/��k(Ae��_C��b��
-V� E,�c��UXii�x���J�!I�B0*/ۋ}� ���(�P�-��+*� ���գ
.a�L5t;.
a,2U����]���X6�@��k�����N����M0%�RӬ.R^�-5
-.��!\L\��~���� ���A)�@mVn��f�A){I~@�`�;�!
����Gr0w�jB[�0��<o,k#�"�ʞ e����	�Q�N�i���`a���;�x�̌ჳ1;ç�4t���Q������,�tc���Q=�A���N[S�׾�A�ʾ�EcW�<
��kdk@ַ�{t��
-�a(7b����$]Eq�q
f�l^�.�� �me�[��
�d0�y4|S��6Z���㪼ϲ*⺏��E���+�&=���J�J L�B�����%�d�mtt���,l�ft�jV:vѴ�{���;'
�ė;m��JN��VS�q��L��<w
:7��z�+O
a-���̞�C~���2��}�-/�&I�L|���CB�aq3"L��
@1H+�ݕ�H�%/��=���%���"���
r��6ٴ�z��׉e��U��Y�W�n���̎[@gE7S*�R�f����-��r����"E�����؅��[o���V�ʿ����_M���
��`]6W�G��Ѷ�I`j�I���p�EE;s����~�dIP�B���SAs������n��]/�<�
g�A;`��Q��&�V�	7Y.���e
&�[	���.ȕ�������Ń�7�}�@�iu�� "Ѥ;
-endstream
-endobj
-9287 0 obj <<
-/Type /Page
-/Contents 9288 0 R
-/Resources 9286 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9300 0 R
-/Annots [ 9285 0 R ]
->> endobj
-9285 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9289 0 obj <<
-/D [9287 0 R /XYZ 89 770.89 null]
->> endobj
-9290 0 obj <<
-/D [9287 0 R /XYZ 90 721.073 null]
->> endobj
-9236 0 obj <<
-/D [9287 0 R /XYZ 90 674.891 null]
->> endobj
-9291 0 obj <<
-/D [9287 0 R /XYZ 90 670.407 null]
->> endobj
-9277 0 obj <<
-/D [9287 0 R /XYZ 90 618.72 null]
->> endobj
-9292 0 obj <<
-/D [9287 0 R /XYZ 90 614.237 null]
->> endobj
-9278 0 obj <<
-/D [9287 0 R /XYZ 101.557 535.127 null]
->> endobj
-9293 0 obj <<
-/D [9287 0 R /XYZ 90 530.545 null]
->> endobj
-9279 0 obj <<
-/D [9287 0 R /XYZ 90 476.8 null]
->> endobj
-9294 0 obj <<
-/D [9287 0 R /XYZ 90 472.317 null]
->> endobj
-9280 0 obj <<
-/D [9287 0 R /XYZ 90 420.63 null]
->> endobj
-9295 0 obj <<
-/D [9287 0 R /XYZ 90 416.147 null]
->> endobj
-9281 0 obj <<
-/D [9287 0 R /XYZ 90 364.46 null]
->> endobj
-9296 0 obj <<
-/D [9287 0 R /XYZ 90 359.977 null]
->> endobj
-9282 0 obj <<
-/D [9287 0 R /XYZ 90 308.29 null]
->> endobj
-9297 0 obj <<
-/D [9287 0 R /XYZ 90 303.806 null]
->> endobj
-9283 0 obj <<
-/D [9287 0 R /XYZ 90 251.786 null]
->> endobj
-9298 0 obj <<
-/D [9287 0 R /XYZ 90 247.302 null]
->> endobj
-9284 0 obj <<
-/D [9287 0 R /XYZ 287.777 180.482 null]
->> endobj
-9299 0 obj <<
-/D [9287 0 R /XYZ 90 174.464 null]
->> endobj
-786 0 obj <<
-/D [9287 0 R /XYZ 90 84.824 null]
->> endobj
-338 0 obj <<
-/D [9287 0 R /XYZ 90 77.486 null]
->> endobj
-9286 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F11 613 0 R /F8 794 0 R /F119 3070 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9356 0 obj <<
-/Length 1859      
-/Filter /FlateDecode
->>
-stream
-x��Zm��8��_�tR�H��l���ԗm��v�����jOo��K
-�m���_�����5ۗ����0~晱�#�
���M�>�������#�Y̘^>6\�G��]d�3-��3}a��C�g�K>~��tz|:��F�����W� JE�g����?؈��
���{�g)��e�51.F�p�2i� ��Z�IpK��4����`�ͳ��A�W� �!��dW������ƞ
��qinj��m�y2&��,yT
�`a��X`A��O�-xϋ�O<s����"�����'IP��y�/Ǯ�
��\�W����[N�K��X�
_�J(6������	C71�Qҿ�Y��#�$��V��ȅ�j��6��E@�Z`�J�r9�Ǧ�c��]���
	�ָ|9�2&��0ӆ��� J�
-��� W�� �(c{ ���_����E;]�w
-Ԭ@g��W��B��\
-	l�� aQ�=�V����[��6_
@;�6<���d!� 0��hO�\y<[����P5��/��׉�~�D7p��XP����x��9/T��:
�8��A,��d���'F�
S��yf�<+������ ⬑*�����	5<�EP��q��>
��8�
�����_��ǽ�b<d��2��:N�Ry?h��j-�Oq��d�)T�x
�p-�*�5�/��ّׄ�,�avH���꺐��Zd��Ŧ�x:��^�(� ��u��6
��u�l�bm�wt7o��5�q�C�0᳓l�
��h����sH1�a
���s���y^VE���??��RAa�I�A�d����]t�=W�k^�s��G����l
-�%�`���nyew
�
-��] 
�_�"Cvr��b":y�aM���X6������,���~����t�4�j6
R��;�*^|�F�
�b��W�]�i�>Ժ>����V����~��A�)��H����Ne�S����K���m
D�ڍ����/�������6�W��*��
-;r{�G�ogO^�:{y������&CQo���r��N�h	�� ��{�Ǜ�X���
 2�A�tv�
V|_}0��WG���o6e|�<�6��~Z�3�W��u�h�r咫�FlҩF�
��NwlO\�����^�U�ȳ �><q��k���Ã��£�p/߻6��͢��ͣ�>��n>��=xH����wUb��<ȳ�e�j�s�}Kg��¯��*Z�j�/�^ip�L=[�ri-��E^��2�J?/󒫦
���pճ(�Z0�+�P!��
-�)y��-I�`���o�W
k`�6z�����R��M�`)�'�Cj��n#�_)C�=
��!m
L�V-r��=�.E6ir�,p� (kZ�Q�&1�Mpr�n�'Y�A��R���DIęp��
fP�.���� ��}1yǁ)��m+
F�f̨�<��k�B��,(6�N��&�:��.!7I���{��#-�
D-��N\�5�6gn��x��3���v
A�
-٥݅\�-�>,ǚe$9{( 
�p���e�Z�FBJc�
-�h0�Q��Fh(����F �g��
ls.6�3���h���&ĵ�ĩC
��~�"|�=B�GS���i����~�*����w�u���u�

-_'��n}���p'�U��Hq�%�m`ފ�6b�Sc9�պh��;��rk��2
���&�6I^6�B����q�A�K`��O�T�ǖ}�T�::P��疏#X�׵���|Y���NR�x���V��MZ���	4�|�2ݔqv�R�[%/~
Sjjw�
-�u�r��$"����4�)��
Tv}h��c$���|�?R4�˪Z=8:��%�B�j�l�(*�Ƈ�5OҼ��3x�"h�8�_/��`
-endstream
-endobj
-9355 0 obj <<
-/Type /Page
-/Contents 9356 0 R
-/Resources 9354 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9300 0 R
-/Annots [ 9301 0 R 9302 0 R 9303 0 R 9304 0 R 9305 0 R 9306 0 R 9307 0 R 9308 0 R 9309 0 R 9310 0 R 9311 0 R 9312 0 R 9313 0 R 9314 0 R 9315 0 R 9316 0 R 9317 0 R 9318 0 R 9319 0 R 9320 0 R 9321 0 R 9322 0 R 9323 0 R 9324 0 R 9325 0 R 9326 0 R 9327 0 R 9328 0 R 9329 0 R 9330 0 R 9331 0 R 9332 0 R 9333 0 R 9334 0 R 9335 0 R 9336 0 R 9337 0 R 9338 0 R 9339 0 R 9340 0 R 9341 0 R 9342 0 R 9343 0 R 9344 0 R 9345 0 R 9346 0 R 9347 0 R 9353 0 R ]
->> endobj
-9301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 611.399 192.296 622.303]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.794 611.399 258.726 622.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a092f5c04d267ab5709dda2d3e51aaeb9) >>
->> endobj
-9303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 542.016 134.164 552.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.98 542.016 203.623 552.92]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.787 542.016 373.176 552.92]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-9306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.006 542.016 448.254 552.92]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-9307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 514.411 134.164 525.315]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a727dc2405cfc5f2252e6f21aa0f18074) >>
->> endobj
-9308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 514.411 245.954 525.315]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 486.806 134.164 497.709]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a31603d81a2b0571a82c4c79b8c6e4564) >>
->> endobj
-9310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.98 486.806 222.432 497.709]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.943 486.806 308.887 497.709]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-9312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 459.2 134.164 470.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0c02302b6281fa91ef9275bd37e43efc) >>
->> endobj
-9313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 459.2 239.328 470.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 431.595 134.164 442.499]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a527ffa31e1581a8beb83a832244dada8) >>
->> endobj
-9315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.98 431.595 215.807 442.499]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.336 431.595 297.281 442.499]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-9317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 403.989 134.164 414.893]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a69a6e807d63018625b02e06c07a578db) >>
->> endobj
-9318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 403.989 260.888 414.893]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-9319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 376.384 134.164 387.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a65f00faeb048901323ffd316d30d61a4) >>
->> endobj
-9320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.98 376.384 237.366 387.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-9321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.434 376.384 324.379 387.288]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-9322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 336.823 134.164 347.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) >>
->> endobj
-9323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 336.823 180.102 347.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-9324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.348 336.823 221.075 347.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-9325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.489 336.823 334.955 347.727]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.754 336.823 478.506 347.727]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 297.263 134.164 308.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a659cb16eede4860a0c3597638ca77830) >>
->> endobj
-9328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 297.263 206.662 308.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-9329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.526 297.263 332.993 308.167]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.791 297.263 476.543 308.167]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 257.702 134.164 268.606]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8d060ee1328743ae25698bc5835a5703) >>
->> endobj
-9332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.163 257.702 233.431 268.606]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-9333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.546 257.702 358.013 268.606]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.642 257.702 501.394 268.606]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 230.097 134.164 241.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a36cc3783cdc92ab5fc69904c298ed12c) >>
->> endobj
-9336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 230.097 209.431 241.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-9337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.624 230.097 308.09 241.001]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.889 230.097 451.641 241.001]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 180.574 134.164 191.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa28d735beef86789b73b41dbbde71abf) >>
->> endobj
-9340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 180.574 181.755 191.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.319 180.574 274.785 191.478]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.584 180.574 418.336 191.478]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 152.968 134.164 163.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 152.968 185.71 163.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1ba97c180500b43954b09532151f6c9d) >>
->> endobj
-9345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.048 152.968 233.301 163.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 89.824 190.738 100.728]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 89.824 261.85 100.728]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afc06f600e94b7bedb91d0371a51f4c38) >>
->> endobj
-9353 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9357 0 obj <<
-/D [9355 0 R /XYZ 89 770.89 null]
->> endobj
-9358 0 obj <<
-/D [9355 0 R /XYZ 90 628.251 null]
->> endobj
-9359 0 obj <<
-/D [9355 0 R /XYZ 90 628.251 null]
->> endobj
-9360 0 obj <<
-/D [9355 0 R /XYZ 90 560.865 null]
->> endobj
-9361 0 obj <<
-/D [9355 0 R /XYZ 90 170.083 null]
->> endobj
-9362 0 obj <<
-/D [9355 0 R /XYZ 90 104.758 null]
->> endobj
-9354 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F39 2320 0 R /F110 1507 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9432 0 obj <<
-/Length 1836      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�6��W�R36
��i�i�θ��K��P$��C!);���A�T(��i9iu�������] ��\���觛����<�ن���4k��!j��T���(���~5&X�$��ֳx�`�<��E�<��/_^��t|nP�������k6c���:KC�l�غ��񧛷��7��#�`�Ⱦ)r\-LF>am
-?��02=W���2Lx�����#����ñqc8�8Ȇ!�9���!;�4��s����H�pNa��(aie�_���p>�`66��c#e~-��V���)�?"a
-��(���ϋ7���0$��C2
d[D;'®%�t��U��9 `7j��9�
�5Z�,dc��p&��fJ�ۨ:ثj�MY��K\����.
96�*E�(,Y��e9+,��
-�)���Ǧ������l�-�w���^�d��v)��;Ȱ	̥@�Ra���&��\0���wo��lʃ(-���dI?�u��H��v��BjZ�B���*��r���	ե��YPF72S�g��#xJ���]T.6|T%�����Bѥ+ �:V]�
�3zR�#�CR�8�(���6���|�)��G˗��PL�g����5y��N&`�ڃ0E�-&B���B�D����4��+t1�c

(����q����D;�����A5`�<_�0����ҋ�2�ZƓ��vxȍk��
���Yw���ٚ�O���dU`����[��,˓{ o<x
g��,eyPf����s9�Jη��G}\-�_A5�~\n���ص6O����+H$}�%�5�a݊�w"��ھX�v�y//�i�p���I�
���"��Q:W�,+�K��DӅĘ$�� �v	"�^])�wȁ���-��s!
`~#8��8����9Ѧ�6]���t��#ˡ�r4�H�_�C�<�¤����D��ui@�
�"'Y�`T�bS󘻿mp�ۿ%�9��cU �ᖑa��l
[r
{xsW��A��

�y�~Cj �4�e\�
�J#����b��d���T> �[&
�0�1E�l���<
-��}g�>�uM���?��ĕ[Wa��� �t5)X�N@�%薅<X���g0���� 9� �F�_�Ӟ�Y�Ȍ�s_�(��5�>�Xw�qĮu%EF3����&96�
�Ia�Jvr-�ٶ=��P
����p����Ӭ���� *��ȃ5Jȣ
-���͜��2ۑY�,�ߒ�J�|�,(���:�p[՞�Zʗ=���{}��s�}g{��1!�(�ĝ���gA��z�-.�s�]���޻_�|���*����l�\�
�>��9�j=^�A�L2>n�>"D|�����2gŮ;J/���*�E�1W�,�Z�w3�bD7��4�B.1��i�����N,�e&q�$�"��[���C,.� �x��X<,8�#д�W��҆�:X���O�J�}$yR��l,ZT��u,q�_�R(�`���
�
�c�gn����Ynkn8D�
(�����E��VdS�Bv�f�,T۷J��Nl�=<K;z��Rx����%���؂��!��c
-{&rM{�)�/.;��4��-���_

-i�3�붯օA���!�Zʜ8�vƂxU��u��,W塼���'��LN��1g�"u:����yv�S�^A#��ŻSۭ��
2���Ť�@�����zkm�v;��o���л�7F�7E
�a
PROM��
-���w��G��Ɣ�J�߂tU��~�:C�? o�g57�y�*�*��[�J��h
N
����EY._^\LV�sn�Xl��Cة�5��Z�,��o��Vq U_kU8RL�m �����8���,�V
��$��s o>���AR
-endstream
-endobj
-9431 0 obj <<
-/Type /Page
-/Contents 9432 0 R
-/Resources 9430 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9300 0 R
-/Annots [ 9348 0 R 9349 0 R 9350 0 R 9351 0 R 9352 0 R 9375 0 R 9376 0 R 9377 0 R 9378 0 R 9379 0 R 9380 0 R 9381 0 R 9382 0 R 9383 0 R 9384 0 R 9385 0 R 9386 0 R 9387 0 R 9388 0 R 9389 0 R 9390 0 R 9391 0 R 9392 0 R 9393 0 R 9394 0 R 9395 0 R 9396 0 R 9397 0 R 9398 0 R 9399 0 R 9400 0 R 9401 0 R 9402 0 R 9403 0 R 9404 0 R 9405 0 R 9406 0 R 9407 0 R 9408 0 R 9409 0 R 9410 0 R 9411 0 R 9412 0 R 9413 0 R 9414 0 R 9415 0 R 9416 0 R 9417 0 R 9418 0 R 9419 0 R 9429 0 R ]
->> endobj
-9348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 707.957 190.738 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 707.957 262.159 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a90ca2b1613fda31a2ac7e79d9388680d) >>
->> endobj
-9350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.225 694.196 390.082 704.102]
-/A << /S /GoTo /D (index_Grid_Affine_Dimension) >>
->> endobj
-9351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 681.781 202.922 692.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 681.781 248.58 692.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a53b24395ac61f8b2b2accc5a3900bf69) >>
->> endobj
-9375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 655.606 202.922 666.51]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 655.606 296.181 666.51]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a880344de195aef75a6b3f2a4db4787b4) >>
->> endobj
-9377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 618.471 233.069 629.375]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.808 618.471 295.594 629.375]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816d72524790) >>
->> endobj
-9379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 592.296 233.069 603.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.808 592.296 343.195 603.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a453e51570268eb4d63fc529130a54440) >>
->> endobj
-9381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 566.12 248.003 577.024]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-9382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.742 566.12 323.26 577.024]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8865893c48cc07adae5dca6b35081751) >>
->> endobj
-9383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 539.945 248.003 550.849]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-9384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.742 539.945 370.86 550.849]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a6ae1850664122e9917f174d10fd3bf06) >>
->> endobj
-9385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 513.769 205.692 524.673]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-9386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 513.769 261.312 524.673]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad14942b33fb82bb3e6a13e5e92ada475) >>
->> endobj
-9387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 513.769 338.781 524.673]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-9388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 487.593 205.682 498.497]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-9389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 487.593 261.302 498.497]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a803035024ab9670971868f4b1092f7c5) >>
->> endobj
-9390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 487.593 353.705 498.497]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-9391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 461.418 205.682 472.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-9392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 461.418 261.302 472.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a6f703ba611b9e5ff613f4df35347ee95) >>
->> endobj
-9393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 461.418 330.462 472.322]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 435.242 205.692 446.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-9395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 435.242 261.312 446.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ace98c3e57a1237e6dd5042b5a0919193) >>
->> endobj
-9396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 435.242 332.156 446.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-9397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 409.067 183.824 419.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0b193ae8bc) >>
->> endobj
-9398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 383.265 192.272 393.795]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a59634a195948ff0617177d0a41e30602) >>
->> endobj
-9399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 356.715 241.935 367.619]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6) >>
->> endobj
-9400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 332.532 213.163 343.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a621d377682c2c67051c24b1cc8a03497) >>
->> endobj
-9401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 332.532 260.754 343.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 308.723 189.901 319.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2528b5f433e743dda827b1028b6c74cd) >>
->> endobj
-9403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 284.54 193.229 295.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1a5606b64a035977b9d76b1932227246) >>
->> endobj
-9404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 257.991 238.459 268.895]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0047a6aa4f26d9133b9d741f68384f38) >>
->> endobj
-9405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 232.189 187.689 242.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3ac47497148e61f3d7a3da09d17a03bf) >>
->> endobj
-9406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 232.189 226.693 242.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 207.632 228.895 218.536]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa033cfca735240b3699b523d60ad692a) >>
->> endobj
-9408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 207.632 333.482 218.536]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 183.449 229.503 194.353]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afde364ce088f82cf2b9a231e7d9f2abc) >>
->> endobj
-9410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 183.449 334.089 194.353]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 159.266 187.264 170.17]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a042613c3f4ad30b298d70143c935d7cd) >>
->> endobj
-9412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 159.266 293.213 170.17]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 159.266 371.148 170.17]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 159.266 455.727 170.17]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 112.169 187.264 123.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8fa02815bb561135934f91c9adcd0cb5) >>
->> endobj
-9416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 112.169 293.213 123.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 112.169 371.148 123.073]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 112.169 455.727 123.073]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 100.213 220.058 111.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9429 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9433 0 obj <<
-/D [9431 0 R /XYZ 89 770.89 null]
->> endobj
-9434 0 obj <<
-/D [9431 0 R /XYZ 90 721.073 null]
->> endobj
-9435 0 obj <<
-/D [9431 0 R /XYZ 90 697.185 null]
->> endobj
-9436 0 obj <<
-/D [9431 0 R /XYZ 90 671.009 null]
->> endobj
-9437 0 obj <<
-/D [9431 0 R /XYZ 90 635.57 null]
->> endobj
-9438 0 obj <<
-/D [9431 0 R /XYZ 90 607.699 null]
->> endobj
-9439 0 obj <<
-/D [9431 0 R /XYZ 90 581.524 null]
->> endobj
-9440 0 obj <<
-/D [9431 0 R /XYZ 90 555.348 null]
->> endobj
-9441 0 obj <<
-/D [9431 0 R /XYZ 90 529.173 null]
->> endobj
-9442 0 obj <<
-/D [9431 0 R /XYZ 90 502.997 null]
->> endobj
-9443 0 obj <<
-/D [9431 0 R /XYZ 90 476.821 null]
->> endobj
-9444 0 obj <<
-/D [9431 0 R /XYZ 90 450.646 null]
->> endobj
-9445 0 obj <<
-/D [9431 0 R /XYZ 90 424.47 null]
->> endobj
-9446 0 obj <<
-/D [9431 0 R /XYZ 90 398.295 null]
->> endobj
-9447 0 obj <<
-/D [9431 0 R /XYZ 90 299.57 null]
->> endobj
-9448 0 obj <<
-/D [9431 0 R /XYZ 90 273.394 null]
->> endobj
-9430 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F66 3179 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9510 0 obj <<
-/Length 2241      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�6��W��PU#�$�j��Lj�L2��{��T�ɬ�HI����m |JI[�f��'R$�h4���ф�������?��.�y�H�Ե�������]���>�T��?����#"\�_�����_��Ի���g����18�|k�9��'���G
#&|�A7�Xep][Wg���\\���5��
=<B!F�?(�z��q�1�o�x�?W�$�\��u
&��	�p�%w{3��?0��8J�n?��
�����%2M�8ڗE�s9!܆&�o
t�o_�r9�
��t
�(kS�<����xI�HZ���
��,9�oM�Ȃsc�sm���B&Sʱ]�Ns�.�	2��:z�
D YSB�����~��6�R���
!�֜@�_�+K�ҴjȤ
	���%��a;���q�~4���
�z;>��)z��X�"rq��m��둚A�83z��]�X��2�
6� H��ro���g�pq;���:~�
�@�@,F1 A���ި1�S+�p��o5���y�9 
���<H��Sv�߄��,`������MZ at os���5��SJ��
c��W�8=Yt
����$��dw0���.��X��t�J7ϥ����\4"��íL&̳e�D��Y���2�2����i.�
��}Dx����1�G�o/'�N�筌@C�~�sX�
!A%�A� ��U��<Ȱ�g/-p	3�$�'�Z��d
���P�w���N�U�~���'H� 7wE�:�
Fe.7
�n
���VF�ʖ�B��E��ԹN
�U��Z�vx�]Wq�rS�%{
�$,�e.jO�02
-;6��f�Fu�Xz'�����m�!��֮�
պ.� �
�]H�H���m��M�SrӒM..Ո�4�
�0��0�,d;��:Ne�?���_��g4ur ����澜���]�B�*K�E+u<>�2��{�0�?	�-�N���ȓ0~(	pSw�$��G��{�+�R�c�,�X��/�c䍳�Q6J�$�g���+r�r�%��y�
1
�y�88�n��x�ן�F�53���O3�3
M��$��cёǙK�?������h�w��K�U2y$aei
w�A�*j��w�N�F
-�a�Py�3�\��\���FF:��??$�C ��&���y�^nn������H
݋x�>ȑ�>^��ǝ����n�!���{��1�pѽ��b��c�� -�`��N!���3���E������t��^m�]�1^:�|��{`Z��"n� #Z��JWa�K
���
���k���V]��'D�Yw	�yK//��K~�
R��B��|
�W`h�<Q�B�I��4��

�F��i٦e���k<~b4Q�A��
����Qdve,�N$�
3IQ���"��a
-"�[��@�6��!��3�7~���!P
��v|��� �
�xjd��^W�c�!�'�7`��s־!fo�{����B���Yo����{����Hk�fi
-ـ��o�vʐ���}���N���Q��
-{��|T�0?n� ��.}9,�������q2���b�D��N;5\tRqU9��V���/=QY,^:��3�
N�W�|9�$y�y�������ߩ�K$[�ֵ��J�oN����<��Z�� �> �.�����S`��m<$ݞ�>�p�;��pqNjJZ/���4W��H_ƈ]0�ו2��ƷA%D8k��~8_{��|�t�	���;-��B����Ѭ���K����U�.]��C��S��U:���eK���̇M9}�r�@�
�(�
iG �g�1��[<q�'�
�6*C�ӡ�	!�V_Wo֭;'s-9&�]��5�cz�ɂ��u-�P�
��3�Ъ}Q)F��tƌcg�X
�<����kj� 3F�E��5�Lj����A��&�"��N�2��A���HV�ho�i�]W
-�x��??��􎏼�8��0? B7��ήd�9�$
����}@5���� 
"��	r��(�>��W�Ҋ�2����w���;��s�
���ܣ�#�:��к�LlM8����9Ǻ�
,���v$6���LjQ2�6�2I�>�23Vz��c�7��,t)�(���ZG�C\�$~>��x�G����~Y��\�kì�cV����i%���b��B�����
p]�
>�ln`��|7��1��6��.)Kޫ<�^�#��TB@Ґ�\ɂ �^�J�R�x�# U�Ͳ��]\�lW��Vh
o���8
-����ՙ[��&N�/��p��.�� �� 2
-endstream
-endobj
-9509 0 obj <<
-/Type /Page
-/Contents 9510 0 R
-/Resources 9508 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9300 0 R
-/Annots [ 9420 0 R 9421 0 R 9422 0 R 9423 0 R 9424 0 R 9425 0 R 9426 0 R 9427 0 R 9428 0 R 9457 0 R 9458 0 R 9459 0 R 9460 0 R 9461 0 R 9512 0 R 9462 0 R 9463 0 R 9464 0 R 9465 0 R 9466 0 R 9467 0 R 9468 0 R 9469 0 R 9470 0 R 9471 0 R 9472 0 R 9473 0 R 9474 0 R 9475 0 R 9476 0 R 9477 0 R 9478 0 R 9479 0 R 9480 0 R 9481 0 R 9482 0 R 9483 0 R 9484 0 R 9485 0 R 9486 0 R 9487 0 R 9488 0 R 9489 0 R 9490 0 R 9491 0 R 9492 0 R 9493 0 R 9494 0 R 9495 0 R 9496 0 R 9497 0 R 9498 0 R 9499 0 R 9500  [...]
->> endobj
-9420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 707.957 186.348 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d8ed7a0e48fe76e7221842c780192b0) >>
->> endobj
-9421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 707.957 293.772 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 707.957 373.367 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 707.957 456.837 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 661.039 186.348 671.943]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a53f980fb1ac8fa21265bec985bd1382f) >>
->> endobj
-9425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 661.039 293.772 671.943]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 661.039 373.367 671.943]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 661.039 456.837 671.943]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 649.084 218.404 659.988]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-9457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.772 614.12 187.446 625.024]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afae3a58c19c9a3b9916f29b7aca4d0e0) >>
->> endobj
-9458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.73 614.12 292.979 625.024]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.431 614.12 370.447 625.024]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.745 614.12 456.762 625.024]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 614.12 513.996 625.024]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 602.539 159.485 613.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.603 602.539 240.62 613.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-9463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.985 589.49 378.999 599.395]
-/A << /S /GoTo /D (index_Grid_Frequency) >>
->> endobj
-9464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 567.202 180.496 578.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad743f8b71eb68f6b41f7ea7b5d21dc22) >>
->> endobj
-9465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 567.202 228.087 578.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 543.198 213.153 554.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8d2cc5d18d050975101f2860f2919da8) >>
->> endobj
-9467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 543.198 260.744 554.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 519.194 161.677 530.098]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814eaad72499) >>
->> endobj
-9469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 456.315 212.377 467.219]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1287b254a91451368e7e2e456f448114) >>
->> endobj
-9470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 456.315 289.846 467.219]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-9471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 432.311 225.109 443.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad09e4e3f9a9da562c6cdb73dd7b47fbe) >>
->> endobj
-9472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.446 432.311 317.512 443.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-9473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 408.306 216.252 419.21]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa26f672c32271db69ed68fc60eee8cff) >>
->> endobj
-9474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 408.306 328.042 419.21]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 384.302 254.827 395.206]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a85b2560352485ac05d10aab0ee483252) >>
->> endobj
-9476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.643 384.302 343.096 395.206]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 360.671 205.752 371.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e87405c740d202951ba788f9e52cbf7) >>
->> endobj
-9478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 360.671 276.595 371.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-9479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 336.294 209.627 347.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a943c42b0d1b3580e54b3ab60aa55255f) >>
->> endobj
-9480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 336.294 314.791 347.197]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 312.289 248.202 323.193]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a145cc7c23d407576222e5af347f401c1) >>
->> endobj
-9482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.018 312.289 329.845 323.193]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 288.285 243.37 299.189]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a953a608f6f9d413870fb3eee5cc6ad1e) >>
->> endobj
-9484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 288.285 320.839 299.189]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-9485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 264.281 247.246 275.185]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_af1ab967a6606266f7e583fc9752667fe) >>
->> endobj
-9486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 264.281 359.035 275.185]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 240.65 236.745 251.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a82b76e3f18679ea161b53bfa80349009) >>
->> endobj
-9488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 240.65 307.588 251.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-9489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 216.272 240.62 227.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8f97dbc7a7c307fa72f7e904b2cbf21b) >>
->> endobj
-9490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 216.272 345.785 227.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 192.268 228.984 203.172]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a19422844125a988daaf489cbaff3835b) >>
->> endobj
-9492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.322 192.268 355.708 203.172]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-9493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 168.264 267.559 179.168]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a214e376adb9dc271c61b58f8b2c927f0) >>
->> endobj
-9494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.375 168.264 370.761 179.168]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-9495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 144.633 193.577 155.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae5dc5003b3652660bc4ff4a15e4060af) >>
->> endobj
-9496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 144.633 232.581 155.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 131.584 248.845 141.49]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-9498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 109.67 193.577 120.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac418d88df400bcd2233fb6281debb08f) >>
->> endobj
-9499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 109.67 277.691 120.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-9500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 96.621 247.177 106.526]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-9501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 223.465 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac9d9eaf8b76024bc20ce524e13bf86a6) >>
->> endobj
-9502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 74.333 271.056 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9507 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9511 0 obj <<
-/D [9509 0 R /XYZ 89 770.89 null]
->> endobj
-9508 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9610 0 obj <<
-/Length 3056      
-/Filter /FlateDecode
->>
-stream
-x��\ko�F��_�OY	�&�$9�ͦE�t�M��-ڂ�-�&VU������w����[8� @DQ�s��9�ΐ����}s�����]1�D;ܙ]��4��R������9�D�ŒQJ���΃d�������.\%��6�J�����7I�Z,���W� M����&L̛���Zrs�\��_/��x}y��[�پq������_�l���Q"�7{0�63�|�g.�yA�a4?Ͱ��y0,GⰘ��å�a���4�n���Y��<���j	�x�h��B��e�G�$q�W����u�q
V
-m��6C��y^gQ��w�S
�h:��Q��U[CLG��-�("�Q3����rzQKN
™�AO�|��Z���K1vo"+Z�aX$�y|�7��E��.L��x�]����f[X���u�M���LԶTv�X�j�u�r�H�0@�T�k
0��_��8�'�<M$�f�q����
��8^?6����L���'qonKA
 x��:^泎��N���)�QЊ�YwӢo�=�xY :2�����kT|�?�I
-�q��9
t6�>~�Y�[*�,�;�}�n!,��&Q�u��Z�	�Zy���`����	��O���>���b@�ܮ45����Ws�
-(�
�?��;�[��B
�N$����B���
�+`�����T��F��:�9��4���k�����K
�{B�c�
s�8	z�
�l�0[�l0�ar�D#U�c��_F�6}�;x��{LO?��(����݅H3hl��zJ-��^J�"E�-	%KKz [�:d�&M@��RF�9�@��b �(� ���B�A͕��$ڞiH0
`llC?��' ��p�u�3���1�j\�[��cA��t��)��^��6چA��}����N�
=�`�;n�U
�����m�gIe��W?	s�3����
f/��U��7�6���e��O������!،
��Dt �P�
p �v��t�S)�^
DkÀ6z�>�M�A~����Vi�CN(u&�N%�@�M����-��o���7�ng�����	l���!y�P��w�	�*�ō�k��I�u�»@�
DI�a�R^
�,�$)M��IT�ѢhC_P���

-h؝
ń��(x�
-dX�
 nȄ�C@�}j�=d�. �Ϊ�'�gܥ��31�<��
����]r��|������q�d�q�f�w�Z��.a
���t�� �y ��cX�u�k����>>M���6܆I���W��P�:߰���$b�>\�\��p�\�I^͖$\��
�2(?��A�8قs�?# �l
g�oZ��@�M�گ��,�#L�?���܍*��s�{��k
��o�]	+��jg�i+XRO[���^�����-悰��ڶ5�Sv�>��a�Nmߓ�Jw�/�;/p
fRg�ul>OTģ9>��{N-��R�W�^�R�`Wm!#i��.��r��Q�
�Ü(ܫk�5��:k�����
7�c�Z�US�(Wu xm,6=�Z�D3�E78_z��גϋo�؊5҈���� �ʑSf�DХu�NڻC�n�
���
&I�?s��t[;����D̫�)��k�07��R�r�s
�
�
�c)���1%�~��}�`Vw%�sG�Pu2� [+�NA	r
%�1���a�y.�P�<N(�Ⅎ�����>YNR?29�M����
-<CYߥ=� \9D
�JI
X�״��Ӝ�$h�}Jj<<Y�����I��7	�*"��᭄A6�
iZ|�KLo�Z�6��[��}b?���ъ�X���Xt4ֺ�P]�(��h�Y<%RC8��6`v� $�M�I���4N�����d�F��5���
_�	��<�r��� �:�͏^D�\�c�.���(���"�aO��С�h�0��y�a�QW���@�c�&=v�a ���)c��>�7J{a�3�q�^?x�

J��� �`�g�+��:?���S�d۟��(�d����#U�
m)ϭ�B��=RA;�H=�M�+�k쑂%�=Rab��=RA��eK7�Eˆ[Q��2�O��t}U�*�@Yb�ߖ�����S#��4�K���Ki��8�]�lm&�٠ T�b6�l�fM\%��n	T�ֆD�iXz��E�m��*�?r�d�C���:pq�,�MQB�
sX�k灏a$\��煭��%���YDž��\טc>1B�z���5�)�gVj��Ru�o�&��DžB�k����S~Oi�n�o�.��_�g����"',ݐ�e�c�	�CN�\rr��8���:��ʶ��� [...]
JM�i����h}��dMT���0kݟ̥��&�W��{��6s&�����.�D���ZzxX8j���OuU~�Vu�>D�z��e��8�d?��0����S'�80��ޠ�A
�Gm�H:ain���Qp	��I˺���(�u��^������u�~[�NY���Qv�;��]�^�d�ś���^�����
q���z}x��?v�ߩF����.mC��N��\�lQo�u+k܃���vpm��W�c�L❟�@K�x�GGA���[��O}�6��o4��R��|�������wo_����O-��Gs�;\W1 ����ONt{����is V�''��������������:�|&l��m&���Z���Eb�k(6�B��Ř0�8O�q�Ч�`��0Y|m�+�9�I�X�I��62��c�DzΨ���;���4{�Pn��A�e{�������{�3	�[�m_H���[{�4L�������}�T]��>���vFL�N ��J���Yq� [...]
�?��V9
-endstream
-endobj
-9609 0 obj <<
-/Type /Page
-/Contents 9610 0 R
-/Resources 9608 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9300 0 R
-/Annots [ 9503 0 R 9504 0 R 9505 0 R 9506 0 R 9535 0 R 9536 0 R 9537 0 R 9538 0 R 9539 0 R 9540 0 R 9541 0 R 9542 0 R 9543 0 R 9544 0 R 9545 0 R 9546 0 R 9547 0 R 9548 0 R 9549 0 R 9550 0 R 9551 0 R 9552 0 R 9553 0 R 9554 0 R 9555 0 R 9556 0 R 9557 0 R 9558 0 R 9559 0 R 9560 0 R 9561 0 R 9562 0 R 9563 0 R 9564 0 R 9565 0 R 9566 0 R 9567 0 R 9568 0 R 9569 0 R 9570 0 R 9571 0 R 9572 0 R 9573 0 R 9574 0 R 9575 0 R 9576 0 R 9577 0 R 9578 0 R 9579 0 R 9580 0 R 9612 0 R 9581 0 R 9582 0 R 9583  [...]
->> endobj
-9503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 697.108 229.552 708.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9831db06919c6ee05360b08e84cccbb7) >>
->> endobj
-9504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 697.108 277.144 708.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 673.417 266.673 684.321]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a68665d093308c111817eca341b98d70a) >>
->> endobj
-9506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.01 673.417 314.264 684.321]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 638.767 217.109 649.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae5955a311fc4fde1edf2d5460f0a8356) >>
->> endobj
-9536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 638.767 264.7 649.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 626.249 274.983 636.154]
-/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
->> endobj
-9538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 615.076 271.126 625.98]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a071aa57e439ba4f358c7fd43b03a6a49) >>
->> endobj
-9539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.463 615.076 318.717 625.98]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.863 602.558 326.259 612.463]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-9541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 580.427 198.26 591.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_abb10ea556dd34e0c1e13f7e99b9efe70) >>
->> endobj
-9542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 580.427 236.665 591.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 580.427 353.317 591.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 568.845 246.458 579.375]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-9545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.306 555.953 269.939 565.858]
-/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
->> endobj
-9546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 533.822 212.768 544.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a90e87cbe8ae0717fa09ff51b70d64b47) >>
->> endobj
-9547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 533.822 252.959 544.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 533.822 375.145 544.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 522.24 286 532.771]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-9550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.401 509.348 277.928 519.253]
-/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
->> endobj
-9551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 487.217 250.099 498.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad42265530a9e3b2f3bda9ab40d4a835b) >>
->> endobj
-9552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 487.217 289.446 498.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 487.217 379.512 498.121]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-9554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 487.217 513.996 498.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.909 475.262 415.293 486.166]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-9556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.557 463.68 277.701 474.21]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
->> endobj
-9557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.468 449.579 441.891 461.744]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-9558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 428.657 261.881 439.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ab602d97b867b5d2ea800ea7ceef4c6b5) >>
->> endobj
-9559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 428.657 300.286 439.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 428.657 388.504 439.561]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-9561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 428.657 520.199 439.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.909 416.702 415.293 427.606]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-9563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.557 405.12 277.701 415.65]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
->> endobj
-9564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.87 391.019 449.708 403.184]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-9565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 370.097 250.748 381.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa9c12ecd84df4ed86b5676a09fa39208) >>
->> endobj
-9566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 370.097 357.317 381.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 370.097 456.145 381.001]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-9568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 358.141 202.344 369.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.711 358.141 475.855 369.045]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
->> endobj
-9570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.481 345.623 465.544 356.579]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-9571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 323.492 261.881 334.396]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afb9d83c4e182f640833116dc2f725076) >>
->> endobj
-9572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 323.492 365.272 334.396]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 323.492 460.793 334.396]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-9574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 311.537 202.344 322.441]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.711 311.537 475.855 322.441]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
->> endobj
-9576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.923 299.018 468.68 309.974]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-9577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 276.887 239.984 287.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0441c9c3b0ab0d55165bb6b4fd107f64) >>
->> endobj
-9578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 276.887 280.82 287.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 276.887 405.104 287.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 276.887 513.996 287.791]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 264.932 171.361 275.836]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 264.932 478.077 275.836]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-9582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 251.204 432.092 264.362]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-9583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 229.079 251.209 239.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e4e32230b187284ac0b9ca8efba8f82) >>
->> endobj
-9584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 229.079 290.549 239.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 229.079 409.969 239.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 229.079 513.996 239.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 217.124 171.361 228.028]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-9587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 217.124 478.077 228.028]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-9588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 203.396 456.992 216.554]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-9589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 181.271 224.57 192.175]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac009459805692e582a00d4b5954ab8e5) >>
->> endobj
-9590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 181.271 272.162 192.175]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 168.753 347.869 178.658]
-/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
->> endobj
-9592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 157.58 196.297 168.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) >>
->> endobj
-9593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.439 157.58 279.215 168.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-9594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.718 157.58 432.878 168.484]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-9595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.827 157.58 513.996 168.484]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-9614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 145.625 216.491 156.529]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-9596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.094 145.625 362.977 156.529]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-9597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.254 145.625 475.081 156.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-9598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 121.152 164.537 131.057]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-9599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 109.979 273.129 120.883]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2d4a31320735e93af31c8d2cc7e78329) >>
->> endobj
-9600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 109.979 352.41 120.883]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 109.979 495.961 120.883]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 86.288 275.007 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa76828d01f5c454221427eef68227f78) >>
->> endobj
-9603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 86.288 362.877 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-9604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 86.288 472.148 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-9605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 74.333 233.986 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-9607 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9611 0 obj <<
-/D [9609 0 R /XYZ 89 770.89 null]
->> endobj
-9608 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F66 3179 0 R /F42 531 0 R /F38 3426 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9684 0 obj <<
-/Length 2563      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�KΘ��`�]OۙԎ3Nl׍����p  �А �b��{��+���֝Ƀ�%���{���sv�x����w���|뱙Dҥ���v&��s$�.|
g��T�ů��Ϙ+�.�ҏ_�������Ի�o�/~� �
-ψ�#Ô���_�,����0bR����v�P�����?.�����e�l&@6�Q�#
-E�D���B�yZ���a�d���x}WFI�D�|�V.Cf��
��T"�j9��u��.�=uD���^�;t�/
>O�,N�承٨�gi���y���;SJ�d	ϣ������(7/�4�̛�q◑mw�榳�.2O��l1��0�85�-%E��ْ`$�4ri�{��,MB-$�x^�Cˠ���p���@'����9T
-���-�I<ą�"	F�(�V��K���~AA�qh�)�����~Ե��Y�I�q�oV�&-vy����I�OU��1��λF���(r
�2�J��ot�Ew�:��$�Ő璪R\փ��*C�s6�ĵ^��P��Hx0-�<<�
-�4Y�(	��>���
-�EQ
��
��������f޻D��f��Ӛ&���
j����^�2��ǟ޿?�>����%�H�
�ވ�HX��(�;MAD�RdF� �mJ�=�U���v���ꏫ *h�R���@�7Q���d`�Dx��qmk�~uD\p	u���n�N]aW�+��!N�Ąu��x(�h[
�V����:J��/��k–�ȝg��HJ�b���ŜlAx�����\F:�R�����+l����pǰ�*l���Ի#ؒ`�t*i�t
\��F��r$�K��5`��3)C�#
a�>cl
-�}E��V�
d�/E
q>���v\c�
�qZ�];-
\4NK�v�iU�huHǜCқW����CpyW
1q^t�`D��ɐ���&^��6.�pՊ�t���2�!�KH8ƀ=�
W
�7����d?r����J��a�b�"X/5
i�B�’[(
A'S��s��J�`���f&�TDz�3A[��e�#�8�
-��F��<.���������O��pR�
H�)�1u:
/�M��R�ܚ|60�*�wia".�OR+�-#��v��<�V�t =D |Zl�[z�m��� yꤑ�%����4��
Uo)j�?F�`�0�#2k�
%M�}&`� ��@��=�9�W�
�^5�q�w~��4��`O½����y��N���tq�5��/�������B�P�x��x`�Ŝ��dy at T<����R
pH���!�
���7����d?�4��`��%;��fx�KD$=w���y��

�
-��'����Ğ�"WU֦���Jσ��ru�e��~�
�t�x'��2���I�@��]�x>���>) �a
76�9�Y�
C<O]���_�mo�����.	J��o�U�����CƷ�i���	��V��g�@�
�v���>c8B;�!t������+}��j5V�B���ñ}���hdU>d�P��(t;
;(h'�aX�V�k3@�8���xȥ��%�}���͙�*��|��%���B=ͦ�v]g�qҫ��efԓ�

#�ySnόC����0�Qs(Ӟv�ז�Ux��e�x�}��7v.(��H
�>�Nޣ���}�3O9���:H�C�4���l�������$B};�+�o��U�Dȩ�oR�ͣm��r��E<�
�Y�Ge{7��X]E�D�Ą�0/�b�?�ITa�`�UdQ�ò>Uݚ�w�k��2�AOIw��.����S��,�gߌ2��(��
3#S�(�2�+�*���]L�z:
��u�&y1�C��>�֢����T[��̂D��8����̋Nְ���%�#9�s�L�!nw����xHz�4igő�6�;2rAD�ԣ
t]���:-mj��7D�U�o-�>靠���ͪ�
 [...]
�e���\\ ��
�����r��ҤCf2��ŭu7
-�Lf�g鰥��-oz�3�>�
-�{Z{<�u<�Ps��]����zJS�6��/�

�H`�T�^��A��ј
E����#���"���t��C�*."�ܝDGh��Жn!��F8/��PGaT�O1���{����3L��7�]y�ff�a2b8`��5�GnA�m_Q��x�����O�tg�8����ݦ�,}`���\
ps
�_;�>�J)��i���(����;�I�H?*�Rw7'��vU�UH�g���	S�ւ\�/>L5)Gd�T��c.b�;#���Hx��KF����A ����p,[���l)�u;7}*ZƉ:
��X�J��{z�2�;���Eǫp�͎����(�/5��q�|�6�j݊2|�*��!�1r[j2}~s��ݻ����z�(�`��[$���|
��1�
�e���������W �_`���Q��]�/�6���-��I����%�l:�?
q;�.��[
��u]y�O�ޛ�OE��i���r>~��BneC&�ϛ � mW�WQ�~���A�?ށ��x��we�����٭A�k�:PK���g*�U��M�
��V�ˁ���4�/
-endstream
-endobj
-9683 0 obj <<
-/Type /Page
-/Contents 9684 0 R
-/Resources 9682 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9300 0 R
-/Annots [ 9606 0 R 9631 0 R 9632 0 R 9633 0 R 9634 0 R 9635 0 R 9636 0 R 9637 0 R 9638 0 R 9639 0 R 9640 0 R 9641 0 R 9642 0 R 9643 0 R 9644 0 R 9645 0 R 9646 0 R 9647 0 R 9648 0 R 9649 0 R 9650 0 R 9651 0 R 9652 0 R 9653 0 R 9654 0 R 9655 0 R 9656 0 R 9657 0 R 9658 0 R 9659 0 R 9660 0 R 9661 0 R 9662 0 R 9663 0 R 9664 0 R 9665 0 R 9687 0 R 9666 0 R 9667 0 R 9668 0 R 9669 0 R 9670 0 R 9671 0 R 9672 0 R 9673 0 R 9674 0 R 9675 0 R 9676 0 R 9677 0 R 9681 0 R ]
->> endobj
-9606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 686.166 255.564 697.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2581586de73769088ece60dc01409a08) >>
->> endobj
-9631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 660.768 264.959 671.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ab6bba83ceaafdb71df04b77e43bed022) >>
->> endobj
-9632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.296 660.768 312.55 671.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.933 648.266 362.407 658.171]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-9634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 626.151 256.66 637.055]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae8d42fcd571a9c9d64f0e7ffe67e995e) >>
->> endobj
-9635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.997 626.151 304.251 637.055]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.5 613.649 366.421 623.554]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-9637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 591.534 214.06 602.438]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a596fc5b3ee0d04895aca9139cb6cbcb6) >>
->> endobj
-9638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.398 591.534 261.651 602.438]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 579.032 358.593 588.937]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-9640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.284 567.876 313.701 578.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae47fdbff76383891b3896ac5fc213d5d) >>
->> endobj
-9641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.407 567.876 361.661 578.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.347 567.876 487.799 578.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.63 543.419 376.664 553.324]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-9644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.429 521.304 306.547 532.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a323efbe5d43695cc65f8cd5935da94dc) >>
->> endobj
-9645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.542 521.304 356.796 532.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.202 521.304 486.655 532.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.627 496.847 379.162 506.752]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-9648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.72 474.732 264.238 485.636]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9bdab8408169307fbd899ec3670cb2bf) >>
->> endobj
-9649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.815 474.732 315.069 485.636]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.421 474.732 445.873 485.636]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-9651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.613 450.275 287.921 460.18]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-9652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 390.498 289.866 401.402]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a10e3116398b920cb137cf576a073cc68) >>
->> endobj
-9653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 390.498 359.324 401.402]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 377.996 159.193 387.901]
-/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
->> endobj
-9655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 366.84 290.971 377.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac4e1b49845e553ff84dc73e710def76c) >>
->> endobj
-9656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 366.84 360.43 377.744]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 354.338 159.193 364.243]
-/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
->> endobj
-9658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 343.182 224.003 354.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1b528a2e8d4d096f62535454e05b74ba) >>
->> endobj
-9659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 343.182 271.594 354.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 330.68 272.49 340.585]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-9661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 319.524 254.15 330.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a5cdf44f392505e1371a85b1245775224) >>
->> endobj
-9662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 319.524 338.263 330.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-9663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 295.866 284.585 306.77]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a7ff92e5d40e6faf667a0b1f6b8fad791) >>
->> endobj
-9664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 295.866 354.044 306.77]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.632 283.364 513.996 293.269]
-/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
->> endobj
-9687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 273.06 197.3 281.965]
-/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
->> endobj
-9666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 249.294 241.726 260.198]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a06894477c4e748b61eb0779ea8c0600f) >>
->> endobj
-9667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.617 236.792 407.658 246.697]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-9668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 225.636 249.318 236.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_af6df34e5e4ab9beab41cd76897d64c72) >>
->> endobj
-9669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 225.636 288.321 236.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 225.636 371.519 236.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 201.978 240.62 212.882]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a688572fbdc35859515f5ea8ba583a45a) >>
->> endobj
-9672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 201.978 324.734 212.882]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-9673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 201.978 389.5 212.882]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 141.032 153.097 151.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a07bdac3717a59f64634da7d9b1cfaefd) >>
->> endobj
-9675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 115.26 180.198 126.164]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_abd8e73adc9b36c272118525242f9b50a) >>
->> endobj
-9676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 115.26 204.267 126.164]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 89.862 193.029 100.766]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a508103dc808fc747a90b573083a60461) >>
->> endobj
-9681 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9685 0 obj <<
-/D [9683 0 R /XYZ 89 770.89 null]
->> endobj
-9686 0 obj <<
-/D [9683 0 R /XYZ 90 701.306 null]
->> endobj
-9688 0 obj <<
-/D [9683 0 R /XYZ 90 157.513 null]
->> endobj
-9689 0 obj <<
-/D [9683 0 R /XYZ 90 132.127 null]
->> endobj
-9690 0 obj <<
-/D [9683 0 R /XYZ 90 105.003 null]
->> endobj
-9682 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9738 0 obj <<
-/Length 1820      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~ϯ�^:���g�C׮E�v˚
{h
C�h[�n�&ޯߡDʒ#�j�CQ�i��s�Ε����Ƌ��/ON����#ߡ�q�4|l���l�Eƻ	��&��OΧO�2
��S�'y�Y��
��E����e
Mg�Ɠ�I�y3|˖��o²��N�I�	����W'�\�|<!@
6Hs��\�ӓw���WF��W��԰�	��qq��	Vl�.;�C��
X��iXzO�]���f6���f
-8h�I�ʕ"�m=K��0��Q��{ȷﱍ����r.J��
pxN�q�g\�����ix@�cI�)E�E��Z��*c��XE.79}N�,2-买[=�73z�Jq=!Ț��\<}���Sӝ����,��s5-_6:^gC�C���
�cl�e!{z�X�C�QPkwB=�uF<�ă�xw�آ�3�O�_�?��sy�"�I0�
)��uZ
��G�lQ"���
���
��X�8[
m�s\���+���
�K����2����� -Ӵǁ��d�;�@���d�e'y
��x��o	��p��E�dYN-{���jw��!����V-�TV-���Z�������"�B5O��B�����ꃂ�Ac7r���)��Z�d;#�ԙ�
��̶��c�˹cS	�0�� ��fj� ��IdU��c\�+yQVl�9zN�l�ë0d�/��� �
�N��2H��Πx�� kV^�0���L�^i
1�A�KcJY���9��es�)��UM�A2Wk�l���hvO
�aI��9ͦ[B���f�(�P�^aC�z�U�H����A�5*8�#�#
��N�����1w-X�}=����Y 3ݕ�wP�������P�A�m��{�p�t.��u���0��}��"�U͇Ig�XL[:�1�RͲM%z����v�{=��dK~Ԝ�d�.|�HdR�S��
TC��z��j1u'�����
�����*
e��{d�/_�@�G�t+�7��s�,�p�gXv\�y�lޮ>���Р GpT�!#���R�VMĴχBR���?q�n�����V
�#�E��dT(U̘��8
5
�hB
-��KJ6a��@�dPF���
��{W�Lh�����
-@�(z��Q�q+=�=�X��]Պ�IC�`�`��$x�i�7�
^f���䔏q����߲$u����v�A��|G�r��
v�]�\���j�墍ߍ��C�nhc�Pm��dn�q��_�Bv���
8���w�Ӈ��u����Û��3=݃U9�3��D����+QTJ���8�}�w�2�5o�Uݛ�ۓۻz�t��R��/pWA1Xh`ɶ�v����"�*�md;��e3��A��a%� 	�
���.W����T�%H��k�܁o��bH��1
��B�&��D�.�r0
v�G����a��C��7�� �[���@�G����������!�-B,ˆ7��M�a&�0��qvg2	����^e��\���D���A�����ab�
>��>��}��%�U�䉾j[��B��Y֗��GɊ�� ��`��>@�D�Rw�)�
����Z��J�3����vH�)���/��l��]ɹ ��i����K�t"�b�mH�e����[�g��E�ѥ�Пn�
-�u���"�D��+(ߒ���L�o
��vS�s��r�"��co���x�K_m�ގJ��_7�?9+��
-"o��
-:�$}Vn�/�e��,�`������G����=oo!{��^
Q���.� t���2�oX
>��t�$�Ri��m�
��H��@���9Ւ a~���[_c�_g\��
Ճӗ�i<�A��!�xs
�
-endstream
-endobj
-9737 0 obj <<
-/Type /Page
-/Contents 9738 0 R
-/Resources 9736 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9751 0 R
-/Annots [ 9678 0 R 9679 0 R 9680 0 R 9705 0 R 9706 0 R 9707 0 R 9708 0 R 9709 0 R 9710 0 R 9711 0 R 9712 0 R 9713 0 R 9714 0 R 9715 0 R 9716 0 R 9717 0 R 9718 0 R 9719 0 R 9720 0 R 9721 0 R 9722 0 R 9723 0 R 9724 0 R 9725 0 R 9726 0 R 9727 0 R 9728 0 R 9729 0 R 9730 0 R 9731 0 R 9732 0 R 9733 0 R 9735 0 R ]
->> endobj
-9678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 707.957 193.029 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) >>
->> endobj
-9679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 681.728 165.911 692.632]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aee33974909cfc1cba605734a57d44df0) >>
->> endobj
-9680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 655.873 187.689 666.404]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1a26d0018999e56d94a7e96db2b6e553) >>
->> endobj
-9705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.557 641.712 476.544 651.618]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) >>
->> endobj
-9706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 618.312 202.902 629.216]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-9707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 618.312 300.037 629.216]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_af39e1b0519a47aafb9dba4121dc41a9c) >>
->> endobj
-9708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 592.084 202.902 602.987]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-9709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 592.084 314.263 602.987]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549bdba93fede) >>
->> endobj
-9710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.819 566.228 199.864 576.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a5f6fcc1dab2b08eff20b41d1412d1e2d) >>
->> endobj
-9711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 496.675 203.075 507.579]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-9712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 496.675 296.324 507.579]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
->> endobj
-9713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.377 481.729 331.306 491.634]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 468.128 294.481 479.032]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a7fc86a6331f34f34a506ab2b0609ac37) >>
->> endobj
-9715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 439.581 287.856 450.485]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3628b6d6e250d4c6b8301173c6ecc777) >>
->> endobj
-9716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 340.968 226.034 351.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25055e33235) >>
->> endobj
-9717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 340.968 341.43 351.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 312.421 156.281 323.325]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b) >>
->> endobj
-9719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 312.421 180.351 323.325]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.562 312.421 218.816 323.325]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 283.874 180.54 294.778]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a87d004db7f8febf6f9c96b4a2a1c85e5) >>
->> endobj
-9722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 283.874 228.131 294.778]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.864 283.874 290.118 294.778]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 255.327 178.239 266.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e17201a9a12235a9a96cc31cfffd38f) >>
->> endobj
-9725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 255.327 225.83 266.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.563 255.327 287.817 266.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 226.78 178.239 237.684]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e17201a9a12235a9a96cc31cfffd38f) >>
->> endobj
-9728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 226.78 225.83 237.684]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.563 226.78 287.817 237.684]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 213.503 156.281 224.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b) >>
->> endobj
-9731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 213.503 180.351 224.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.562 213.503 218.816 224.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 138.455 198.074 149.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-9735 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9739 0 obj <<
-/D [9737 0 R /XYZ 89 770.89 null]
->> endobj
-9740 0 obj <<
-/D [9737 0 R /XYZ 90 721.073 null]
->> endobj
-9741 0 obj <<
-/D [9737 0 R /XYZ 90 697.159 null]
->> endobj
-9742 0 obj <<
-/D [9737 0 R /XYZ 90 670.93 null]
->> endobj
-9743 0 obj <<
-/D [9737 0 R /XYZ 90 633.742 null]
->> endobj
-9744 0 obj <<
-/D [9737 0 R /XYZ 90 607.514 null]
->> endobj
-9745 0 obj <<
-/D [9737 0 R /XYZ 90 515.91 null]
->> endobj
-9746 0 obj <<
-/D [9737 0 R /XYZ 90 515.91 null]
->> endobj
-9747 0 obj <<
-/D [9737 0 R /XYZ 90 485.714 null]
->> endobj
-9748 0 obj <<
-/D [9737 0 R /XYZ 90 457.167 null]
->> endobj
-9749 0 obj <<
-/D [9737 0 R /XYZ 90 387.566 null]
->> endobj
-9750 0 obj <<
-/D [9737 0 R /XYZ 90 199.195 null]
->> endobj
-9736 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F90 758 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9765 0 obj <<
-/Length 2353      
-/Filter /FlateDecode
->>
-stream
-x��YKs����W�
-�������
��W��]gc)��[.R�A @K̯O�t
d+��sȁ5�����Jg�H���O�W�E���$T�s�s�D~"�F��v�I�����
c�&!�2������׷7�v�����
K�q�A ���o�N�?8RxI�����+�ҹ���dY�T�PNdre(|/v"��K�S*0��m��M �,*���
-�J<�eџh��U׷iQ�
M���,��4��jӴu�ہ~�
u��(]a԰qI�!\���R7�ʋjU��+j�;M�����
�����
�)5�`8�`_��J�Q[�<Q7}qH��D���4u�뜆ۓe����R��(K��Z�ñ�67�p7W$A at wJ+���
V���k��YA��eO����Q�M�uŶ<��e�Q�4yl��.ljs�݀
��X��ź5WK��jЯw���"�˚�AJ
�xؓ��miy�.k
{S�R
�Ҡ	}ͭ���}k�>��t	 �izW�Φ.Ow:o�K��C�!8��Hz�"�ˌ
��ųB����T�)Ҏ���8G
�UEow��^h��
ُ���^W�M����@vzR7:3�%��X��9h�1���p���>�z2Z]���|E�A�ʉ��i
ǰpE�:u��x�D����z�
�U!η�|�g,n�(�=؁�<���Ľ�}��pϧ�-jbPd�"�������Y1@R����6
0̘0s)5K�gf���\#k;ϝ.=h��`D�w>��^�,��.}y�{��N�k�P
y3]��|%O�c�����>l���<蠀p���V�����
�G
�a�'��H�0S�i߷�v
v>���h��	
��+6�tM��ּ8��(�� ��]}in�*����6�2	�>��"�#K���SӼ.|�X��D0K���!��K�.˚3
��Yo�b.�~�b)�%h��|�N�rԦ��(����
��2�u�u��i;���j6�=��,C-��s�#�����؇�3��XҠ����&���V[H�A at a
�d*@�9�#���c�#Xf����7��A�|<
c}���|�ӽq�X�a2�Q�u�ԠǴ-R��•�3AQ�O|�,���k��CtNl�j�*vv���v�55�������D�̷��C���tmf26�b.2D#F^�C:�����pz1��;�O�3�m�!w_pRO�uY^
O
̛���]�������ITBc��Mذ]`��Z�����.���W�.xz�	/��]����!�h��MYdE��<O at R��D��mS��sD�s�6c��C-���T�6
-��,�r�i�-��̬c��z�
*ԬnPǧu��
(+��?�ё9ZV8~H(_$2��ȏ��5�Z�{Eh��߀�tK�AQf���Ţ7�v.��2����L��d� m{�Hh��6��N�
�b���凅��8ǹ��
��"'I�-X-��
��G.��'�P���H��bs���	r*����
E�M��/��ƌd�Zzh�!
��" �q<X���T�j0�E$�8��xX�)Ɖ��!��"�����E&6wNA�U�=d
�T
�����w]�Y+KJݼ0��y4�F�Tb���7���U�ބ�
P 9�N��.����}
f�0�@5U
-:��b�1���+23���'�2�f�'%��fo�h��
��9/R�Y��Z���
i
/���_
�����z�Ƀ��������~ �&-L�4k
�'��.�&��%ղKF3��B«�x$b:���)HJ�~��e�rz�b�g�v`����E e�nd0+���m�������j%yv��QO��1���Y-.3��
j���طx�=�:3چU�@�6z��0���
�0��.~Oj�z�	h���
.��z�ܧm?��O_���)Ч���?x�n�;!�����>{�
a����E����f��Ep� ��zo�7A�P'JH{�
-�h��̼/\x������3�

�D�/���9�M̋����+ȩ������%�]���;��_�ؒ�Ħ���ܧ���]�R[�_Im-~ާ�Ť�|WD����>�� �(��S�O똣�|��6O�D��l
�Ko��[��Y{T6_A�
ub�:����.���f���F�9�����N������s(���*)��M6���_�Gҍ"e�}�h������yY����mF������;\��
:5�\�����@�� X�+⧴:�/��
�'ÇTWH���|t��.����L�3�'�E
����yqu�=�;]�E�����2Ib�)�
>-
�v��ߛ������]��
-endstream
-endobj
-9764 0 obj <<
-/Type /Page
-/Contents 9765 0 R
-/Resources 9763 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9751 0 R
-/Annots [ 9734 0 R 9757 0 R 9758 0 R 9759 0 R 9760 0 R 9762 0 R ]
->> endobj
-9734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [121.945 628.844 182.89 639.748]
-/A << /S /GoTo /D (index_sect_rational_grids) >>
->> endobj
-9757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.819 515.785 398.978 526.689]
-/A << /S /GoTo /D (index_Grid_Space_Dimensions) >>
->> endobj
-9758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 283.886 133.816 291.412]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 200.113 133.816 207.639]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 109.333 133.816 116.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9762 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9766 0 obj <<
-/D [9764 0 R /XYZ 89 770.89 null]
->> endobj
-9763 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F32 764 0 R /F93 763 0 R /F7 795 0 R /F75 554 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9779 0 obj <<
-/Length 2137      
-/Filter /FlateDecode
->>
-stream
-x��YY���~ׯ�K�T����Y�!�؃=1�'{1�H��D"e��x�}�/^�F/�̓�>���������u����_�fWo
�H*��U��@�		�e�!$	2��8��
��.���S
�ۧM�����*����o�|9����۴�m�]�ʪ9�ìXd�I2"C������go�f�f΂b�H��b7��
�0�}�K����N|�����g�]c����D�b��!��D���>��MVdUڔ������v�H�M��7�x�,R��үk�uV5��k�x_��aC�P��"�(�K�l�9"1���v���Ǯ�%0v�lG��
0"� ������E�;��fV��)���lx}�\Kh�
|����>u��S�B7��4��
-�
-aPuD9�	�{�����[�J�
����[�gCb�p\0��2�� FE�*��r�ǼX�!.ʥ�|�&|ȷ���SK�6&�eUe��,�n���}�2�gs"`U��S�$
˲�T�?�փ���[����Ĺ��9�0$q�+Q,��=��:��S<Y���b�c�	��R0��&�PO��R��)D0$�:��B�Q�hQ��U+$��>-8�����h2�O��.��M�����!�捧(�࿮\t_+�|7n�P�����U�Պ�>aa��``Ξ8����r��I�X
�ѹ`�\�~^�vP�9�y:Z�+]x���R#' �T�ͨ�c7�C��t��f���Uu�s���4L
Q�PjeY���3j��&��v�UU��B7픢�������Q�E�z�L���V�Z#1�<�7?�Vp�&��Ԉ~��C�c�, =���!���/�_���
�n}�|��X�6��>�y;ܦE6�E��MG
mk2(0	�/�i��8
@���{T�^sl #?��ˆ
y�J��^�j��9Ǝ4�ZT�Ɂ [...]
�M��[�l�7��
�iͱ)F.��ϨNB>
Tg��l�]�#h����
�:y�֗��U����7 d
jU�a��w�G��pƯ3)������
?cD�N!��z���ݿF���|]!�o�
��R8��SD��~�K^���#HW�B]~���1d�_�ax�
<��R[K�B��6ic;:�������
���P;ZH!�4/�pj�\��#�����ˬ^T��}t��h
)�w����͊�P��ك�h��k;�~���/	�sc���8kZ��k�&/a���W�
�U��
�f��#ƴ��Q6�O����eS���c� W�����͔�q���
��foL��Ȳ����"�7y������E�b�˟
�m8��
���M�z��S�~��&���աXX��S$	�y
��S�Sxv,�
X,�� ��C�����h��q�%y	^�����K
-�3�
�%�ŧE0�����vW�:�]P�]�_�|"o�ӾP���
��=��1�є�d<
-ѣ紎ю 0F0�
�1~t;�T�@j�5��
�{6�N�,�SJa�ѣ��
jK_>hdt�ݱ��Q���:I�ڞ���n�ثRޗ����W�e�����,4A���a8��#�tJ���!^&z�e��嶩�#���;Vl+/���@�-[�+n8$"<l�����׮��wk��� )�cg�1��S�+�
��;:�e&
-H1�E���˴ʗ���(�֩��
'�p&�u�A<lN�)�������T� |.=fB�L
�Aq-X���Xt�X?�}8(��n��s^z�c��D��i���W���^�1s!V�Q��EFxt�;[4S�1���+�~ql������b����dpypT�B:�RGS���0�x�1乒z���)����j�
	�
����jB�' 1g�jΎz�v�Ȗ(��q�\�!��.-��w��x
���!e/P���}�L��Pρ��E�?vy�C�i��<�
�
\�W'p|
s#<*
|2���&/�MɋjS�k���(%E��K��4E�~���V��"
a��폶�x�}5"t��SZ
��K�H����D��$c��̝�
�?�o�`��;
-
��-�n�f}u�pX�Y�F�r7��
�)��l�tN�+���ap�j G��^/G@"$%�� a~�腉R�P��f�/tW��X���
�?ͫ��
-endstream
-endobj
-9778 0 obj <<
-/Type /Page
-/Contents 9779 0 R
-/Resources 9777 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9751 0 R
-/Annots [ 9761 0 R 9767 0 R 9768 0 R 9769 0 R 9770 0 R 9771 0 R 9772 0 R 9773 0 R 9776 0 R ]
->> endobj
-9761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 685.13 133.816 692.656]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 587.149 133.816 594.676]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 512.116 133.816 519.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 450.002 133.816 457.528]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 398.879 133.816 406.405]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.113 398.879 184.027 406.405]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-9772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 266.285 133.816 273.811]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 128.375 133.816 135.901]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9776 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9780 0 obj <<
-/D [9778 0 R /XYZ 89 770.89 null]
->> endobj
-9777 0 obj <<
-/Font << /F73 552 0 R /F75 554 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F32 764 0 R /F7 795 0 R /F24 529 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9787 0 obj <<
-/Length 2406      
-/Filter /FlateDecode
->>
-stream
-x��Z�sܶ�����z�� <	 �|ik{�Ʃ)��8
��8�#��$��]`���
��&��@X,
��<�#�>�����+-"Kl���jYii���m��	��\}��fc������^~u���^^��z�`�F
(�Mt�={�
����mD��&z�D�Hr�Mty��3di��+�t� !��$4�P*#���y��l�6�|���i/Ә�ū�τ����*��խc��lUl6Ŝ��C����X����*|��I�Uh����>���"wb��U_
-��"�&�U����6Y�H=�Y3�k����&�A����8,��qL<�D�*Z0Ebf���2[�E�1��u�3U����1�@���۫���`"{���Ǖ�%I���5,x�N�L��/�{�,���3���M\0�9�����u��s/�_��h-g��>9I;i
��
B�/Q�	M��ٔ�|G�óO�;0���~�xW�U�,ǯ��;����P���l�m���֊12��
��,���
H!���*��t��

Ϝͼ���Ш꤬��poN�8	'�Y�ٌf�%Y8�
�B1��S���?N�
>���$_N0a�H��<M��i����Dkݐ��Z��h*�]��)gF$-zT�i�Nm\{u�[�A�y
�f�ā�����s��=�t�	�����J
T%l�
T�&F��\�z�\<fC��@'��Qz9��
-�	n��ʖ��%|p�()��}3V�P"���-������f�d����R��8���ޥ�uq+,m�����`�\����"�!�i��b�����sz�q\�`������C7��
~p�J�1u]&y�I�4����;Ć]1b[f�����x��݃)�]�:�bn��zaӺ�
-/�
��:���D,{�؄��t'q� �2���drp�a�
6���‰AN�m<�6 �rd �o����u��{l�mڰ���
�r{�
�i���b��(�����T�%��;�fY ǣw�
��
�{�*�mR�QA��P��J���6ͬ�mh
\�nҩ�l{�����Y^�i2�ea�Q�͛�μw�֡CR�K~8�
��L8g�B��I����
�
s��-���Ħ�#0�Q@��l}M��DU
-��!k�]�l�ǧkH�l
-d����)(D
{�D `�V�_Op���fiK���;�怙��F�f�neǰ�S5ʺK�g���+P�#��nŎڠkUܗ~E+�j�
4��}cpAuV�Q
Sp�Gr��sm�cV9��Co
�N����CXxY�{^�� \��'��aou��܊�G at G����C
971��
�Er9�q���G
F��%n�g���P��m�sP_!멶|�z�ȓ��W��z�
�-
���uc��nl�i0\��Չ
gc"$;h�2>f��
�U-x�V�P탂˨ڲ�
�#���z�A�ŜZpa�z
�[��+����䒋�&�rJ.z�!O�^��s�7%�/F�	M�镏�\�)���KcVϪ��ݪ
7��%�釫f(ő��⺝�ϧ\�����!)'Dݚ.eE4�_jah
;��y�4/�Y�n�$e	$�	�nz at ILA&��0�gn
@��#�r� .c nv����AM�&���W,�T�6�$%���sp�5R
�/

-|���#,F�n�U�]
��c�k��L�?��BR�Kc-@�L��i�bCXi 
|z�[>�3�*���M�1�A�lfM�]%��G�.��X��dA
���z�݇v�e�������
�l
ɍb#@;��!Y� ��J
;�!������9{��>�]�@�ǡ)u_`�� M��ض�e�p�_;w`eK�[]
C~M���S�8T?�|��A��nqp39���M~l	g���Y�-c�3s9(
љ
-��)is���B�wZ���qM��α�e0��"8�w����F�4�48��
[Zv�I���	)�XeHPAXw�'�lu�����"C�.��	�lO�����K)��}f|	���/�g��m�ڡ��fRBLM7 ��&�
-��oɺ:
�6��sj� L��
&�r��j���y t<4E�MU� b�����N��A�n�O��w�=Zۃ����T��ё�Q r�n��uu�ܤ��l������3Bi��,Op�tl_�n����8�-�p]MA��dy�qi��H��@���~
-o�ׄ R�S ��O�k�6UX�2���HO	��	���
��/��H4�e�����C6I�qQb��r�
��
-pK���j�8�F��Re��~�F������k��fN��f+����c� ~������� ��] 
��@34�o��Ə��?��0|���I��^#�6'f���N���e�U�\�i��]O
�	J�~[�w_]\��_Wi�&7�v���f�w�����-ʴ�L��#d|x�Љ��
-endstream
-endobj
-9786 0 obj <<
-/Type /Page
-/Contents 9787 0 R
-/Resources 9785 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9751 0 R
-/Annots [ 9774 0 R 9775 0 R 9781 0 R 9782 0 R 9783 0 R 9784 0 R ]
->> endobj
-9774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 676.222 133.816 683.748]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.113 676.222 184.027 683.748]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-9781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 415.347 133.816 422.873]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.113 415.347 184.027 422.873]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-9783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 107.297 133.816 114.823]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
->> endobj
-9784 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9788 0 obj <<
-/D [9786 0 R /XYZ 89 770.89 null]
->> endobj
-9785 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F32 764 0 R /F7 795 0 R /F8 794 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9792 0 obj <<
-/Length 2653      
-/Filter /FlateDecode
->>
-stream
-x��Zݓ�F߿��
����	�s����|�&/�k�E#-	@������ ��je�Ꞁah�{���
,
�x�����ۘɈF��<�8��D"��Y�)$	2��q�~Bp�V������\�ߨY�^��_Wiu��ŏU>�L���eZ��􃚫jB�P�I#Q�0�|������şt���(N�lu��3f0�S��Ipg&�N
��Nj_��Ap�b‚�D�5��^�X�MZ5y��W
��>�k}�a�M�IKՔ��T�V��[�� �3$��=�c��7O����	�����DD`����� �8M��dD G2!�
-�O@��E
DH�,�Z�PD\ ]�.B$Z���(ʽ�DG��(���N[�>�j#"E_+n�x�
-���7�,�û�|����J՛eKҏ��P!
��M�|��G,Ԕ�	P`
-�)�8�`V;7��/X$특Yh2�Q�ԫ�i�M��o����F��R�rBDxk�F�u���f�Ju^n-e(�$�.M�"�&,<Ҥ�����
�/@G�5ƌ�����F�i�U��Y+8 d��(�;�RE�R��(L�
�9Uiv���%�ir�iz��ۣ�h�}�E�BL{�V]]
���/�f�}�\�*m�j±�&*E�)�v���ʚVe�M��PR�[����*��
��&�
5�gP��j�ee�� =x��{��
7�Yl}j�X���岜P�u��r�n޵G]���r��=O�a�ϵ(xv����T��^�G��~*2
�$F\g셒����*O����iU�6�jb�
dLa�K53��fU50�u���[Th�:꧌�=O�Q�zS�V���'kC�'16u��ĉ{g�:�xy�pR۱,�M(�ȭ{q�<w��wQ�A�� ��ۏ���3�8~�œq\"*�@��
�*I
(�'�7`#K��i�N}��VI�23�B��|D��F��M����(��L�NYHbt�[�u�Ҡ4�I�f�� 4\ɡ�p�VC�K��  T ��4�CU ՘w�:�r�'�e�/�"]�a
��
-�CE)��@g�V���uY<��ׂ��)�\9�ׅ���&��>pQ3d��3�(IX�zy%
�Z���UG��;
&as�g��vV��J-������ΰq�֏�+��:w�����
�V�^U�Z�ި�B�� OS;ye����]�(�T![' Du��]%�{Ķ6S�Q�f�m��Q{64�&k̚�$��
^+�u�m
_1|��P��)G�K�mh�Rn�ݞ�iP�?��A�Od�ۙ��3�D1�Q �V��F���ntW�)�49�
-�n���T���d����a�
��DŽ�8ꀳ����~�aC�Gn8%

��lV���8B��Y꿑����M�S��?�`�������We��x6�
`��!Cz�Z-T�1I]�Y�=&\bh�d+�����`�a�=42$����_�~{�������(�	�U`�WCJ; ��K`��G��%�

 ��(�����Y{�|�rtH�hi	���l����|9�=���6inR��s�ˆk ���S�f�+]
�\�� L
�
-#	�@��6]
R B��hn6F����޵7���Fg�cX�;I��K�
���e��F�������c{^~G
-!GC�"��B�Y�u��p
�)���
��+���Oe" �4���l��n�)Ϧ��aOo��Z[�]u3Ql:y}��lY��}:�?l� ��[�?�@�8,�zn�6 at 1$>l����"�Dr@�����ޓ����
;�s���ɐ�m�����vb8���u����ĸ�8
Hݠ�b�TO�
�H	9g,�,q�w�X"�<`t��m�����u��}E�����&P��o>�$���+�4ʀN�� p$C����H3N���uB*��D�
r ��u�
�*�͕��	7-��x���	fg��PxL�&]F$�����D��^�Tv�m
-��1fML�q?]�6�	d|�5�v�4S��t
��/�j�zʴ��l�[�vo{k�m�N���D ����&�Sd
�-��%�u����W?�=G�����
*�ݯ������t�S��nzQ7#
��W����,�F)��x_7j5�=%��vO|7�&`W;![�#B�
�~��n�����#;Ρ��G5v��ok�Ep�1^7��>��sֹ�6wz���(�CR�%2y�(oꝶqe�p��K����\&߸��L�x|F�tv��P
-�v&�?^s����J?�
��O�c��{zt1�@���T�����Q�t��G ����K|
'��~
9#'q��~z,M�
-2M�������D>���w@=�������,<���
��d৻~�HvX��S�)2d�1�
�v!v<�_�<��'O�G0�3��2pO��
���ߟ���z
�4~�uSNz�{��%�߰����gKu��XoF��DP���/��f��0��#�C����
>?eQ݆�?��y�9x�2�`�X8��Y��*CĔ
��n��	x2�.�u�.��]���bO~�U����3�i�1�4�~��z�̂����� �����*�GО�l��ڪBGBtM�MӬ_<~�Y�P"QV�v#�g���G�y��*+�.
�̧uԂB��3�����?/4Y�cjf�����A7��݊�Kp�D�\
-endstream
-endobj
-9791 0 obj <<
-/Type /Page
-/Contents 9792 0 R
-/Resources 9790 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9751 0 R
-/Annots [ 9789 0 R ]
->> endobj
-9789 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9793 0 obj <<
-/D [9791 0 R /XYZ 89 770.89 null]
->> endobj
-9794 0 obj <<
-/D [9791 0 R /XYZ 90 542.951 null]
->> endobj
-9363 0 obj <<
-/D [9791 0 R /XYZ 90 520.574 null]
->> endobj
-9795 0 obj <<
-/D [9791 0 R /XYZ 90 520.574 null]
->> endobj
-9796 0 obj <<
-/D [9791 0 R /XYZ 90 450.028 null]
->> endobj
-9797 0 obj <<
-/D [9791 0 R /XYZ 90 372.03 null]
->> endobj
-9364 0 obj <<
-/D [9791 0 R /XYZ 90 337.36 null]
->> endobj
-9798 0 obj <<
-/D [9791 0 R /XYZ 90 332.877 null]
->> endobj
-9799 0 obj <<
-/D [9791 0 R /XYZ 90 244.521 null]
->> endobj
-9800 0 obj <<
-/D [9791 0 R /XYZ 90 190.832 null]
->> endobj
-9365 0 obj <<
-/D [9791 0 R /XYZ 90 156.002 null]
->> endobj
-9801 0 obj <<
-/D [9791 0 R /XYZ 90 151.519 null]
->> endobj
-9790 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F1 833 0 R /F8 794 0 R /F11 613 0 R /F7 795 0 R /F24 529 0 R /F32 764 0 R /F93 763 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9805 0 obj <<
-/Length 2082      
-/Filter /FlateDecode
->>
-stream
-x��[[��F~ׯ�iW���}��[�u\�:Yo<y�]S��h�4F(�������nж��r�A��q��k38X8x9��v��g����2�}
7HH�5ލ���LjD��Y�������n��{����#�p@
�@J�d���p�� #ft�w1(	8ep\oG�
�R�������PJ�;	�A�@�
wҼ�P>�0��(�2^r
 w>��i�
�
k�9�2�:�������L 5GB���=P��&�H����=[��=�(")\
$�l�q"%2T���}�&S��x�]�Q��W�8[��l��h�.̣��4N�w^�^d�
M����
��t�g�Y��*�$ܺ��rf�&D���e4/AW���`J2��B��	��M��AT`�d{�|R��HDz+�(�, �#��#:
+Z���+/U}��� �)`Z��ܫ�o�d{��I���$?8N8�
O�Ey�r��6��Y
���
3�&T��,J�8̣�b�ڝ����C�J�����̝��8��� [...]
-$������
L�Re����77�(]�wQ�M���ӄ��#����:�9t��qD�:�Ė'�� H�Z+�}�V�'��:�˃$O4&r��$U.�n��y�D麢��s4��R���F=`y4_�y�$�'��π�r�De�[?����[���9N[a�qC H��_��y����Wn���	��O�c\e�Ix���h�SvR:��6�l�R�`Ȅn��f��x��i��1�g
"P

�ڇ����u|����x{s��*�?����{,�dʅta�4��� L�k{����a��wo]nYLi�~�$��r�?�r5��-�j�l�B,H=�$
�
-���W��E����,�?��˞�N�$��0����MBK�
w9�*x�<�)rcH�^)�C3_�r�B��*X
o��~�R�6�|�et9���꡻�6C�0�2�=uO1�t" W6_�rDo�_z�
��L��'�g���K$���p.�
(Fg�����~��l������
:N �T�
�k)�񺌙K�$d�3f.	�`�>��g�,
�N�R�̘��2fQ�3iAs�N8
�.��
�Y�Ƌ
8������J��yo�=3��J;2�KPWȦ%�c�)q�y�N�
��U��>n@���;ܞO�����
 $>Ӫ�ڶ�c:�b��	�|�(\�?f��ح߻,q'��ڕs��уkׯ���^�
-�k�M}|���7u�� R�m�A�g+]��sd�JW\^����S�nK�+*]"T�nK���ay�	R���V^S�>�*��ΪF�
��F�ݫ�i�w�I�j��]�	�Z�C4�5b�f>Zs
ٛ��»}���RX�R��;g��uu�w�"�`t8DO/���f�#��5��0):
����jvS��څ0\h���Qf���
��j�
���>�=�/g��Q
�U9��9mn��&\_����q�ٴs�L��X0��07^7R�H2y�F�@I��ܔ��H���FBQ둓��k
-Q ������������~Lg��A�'�C
��
L�+o-!��*��B{��u~O
��
-?n�H$�kV�1�Y1
�_��`H?���a��A_O�����\���.�AC��1#cH���̳� b4L��A��~������j�rE?ȃU?�%��~c՗R���A",YEp;��e�FY����
-qE�4�������`��
$��O �t	�CWH�R=�@�2DG��B�*8�\��o*v��E��`G�~��P"D )|6��#i��ؾ��mG����fv�(Kg!ޒ��;������z�� �^��I�ވ���!�˔]�g6��YS��� +Ĕ•ÿ�yq��S^x�*a��V ����tX��
)yAM,�zh�o޼v'���!�%!~
S(xܹ
c��+�v

�"-l�8�6�J������ߣ"4���)�(��O7ϟ�okH��l�
ƀ�d�J���r��*�*O
�0�ex%P�����
-endstream
-endobj
-9804 0 obj <<
-/Type /Page
-/Contents 9805 0 R
-/Resources 9803 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9751 0 R
-/Annots [ 9802 0 R ]
->> endobj
-9802 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9806 0 obj <<
-/D [9804 0 R /XYZ 89 770.89 null]
->> endobj
-9807 0 obj <<
-/D [9804 0 R /XYZ 90 720.814 null]
->> endobj
-9808 0 obj <<
-/D [9804 0 R /XYZ 90 642.816 null]
->> endobj
-9366 0 obj <<
-/D [9804 0 R /XYZ 90 608.146 null]
->> endobj
-9809 0 obj <<
-/D [9804 0 R /XYZ 90 603.663 null]
->> endobj
-9810 0 obj <<
-/D [9804 0 R /XYZ 90 527.263 null]
->> endobj
-9811 0 obj <<
-/D [9804 0 R /XYZ 90 473.574 null]
->> endobj
-9367 0 obj <<
-/D [9804 0 R /XYZ 90 426.55 null]
->> endobj
-9812 0 obj <<
-/D [9804 0 R /XYZ 90 422.067 null]
->> endobj
-9813 0 obj <<
-/D [9804 0 R /XYZ 90 345.667 null]
->> endobj
-9814 0 obj <<
-/D [9804 0 R /XYZ 90 267.669 null]
->> endobj
-9368 0 obj <<
-/D [9804 0 R /XYZ 90 220.645 null]
->> endobj
-9815 0 obj <<
-/D [9804 0 R /XYZ 90 216.162 null]
->> endobj
-9816 0 obj <<
-/D [9804 0 R /XYZ 90 127.807 null]
->> endobj
-9803 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9820 0 obj <<
-/Length 2580      
-/Filter /FlateDecode
->>
-stream
-x��[[��6~�_���
�
��e���v6�[��@ck<�ڒ+�����!Eʔ,{<��A�!�F&ύ����`����˫����X�XR\�1"
#!�i�)$	2�qx9"8L�Er}9�8,曻tZ&�ﳛ2)7/^�-��hL_͓ժ���ަ刨0�')H��Ȑa1�|��ś��?.�R�-P������g
L��F,V��f�"��u
|�����h��
-}�/vs s�9#�y����O�e���(�#rg�z����X"A���۪�
xb�Z&"q
Ș#�? F
�K�J�"�<O�yN8�`e+�L�[OJ�
?��3-&�g�sV��ŋ,q
~I���:)G,
-g�E�W�����bNf�n�D�;e�#"�C;�~R
#�Z��+��y�4�m}����f�YU颾/쏳4Oˤ*J�i���EUߤ�e��ootƮ��Y_�E�W+tآ�ň�sBgo�k�$�f�Ȭ3GA���������k9
���/϶
-��g� ��Hb?��i>��Ӳ
q�	���Ѥc� ���o��|c�Y)���B>he̔|���fP�V�0鬣$�c䆧#"B8{�骓��>[�m�'�y�HjO��2�؁�j�&��ڗd� E���3D
>��p=U� ���Pn��.4!š�C

P��Xōj�J	Q#T[�����F��5��Հbp
Uh`҆Dm
j
7���-�c��X`�~%�p4v��_�uG�����2���� /��C(�IF�(7b�a�l��G
-�"��!�l&���]�\W}b�4&��8�(7Ӧ��b�p��Q�1Dc� ;��: �(m�����,O?��d����SP�"�U=��:��b��
l���-Ӊ���,���B��oA���͘�(w�.����̪nY�+<�E��͚�����[�ڱ��= #��b�W6ELr&����	��-��A���@|��=�D���6�D�C
?B��՜2�`Gj$���PǪ�v��]�ę��vy�(�~��J
�,ކ:ܛ��k
����w y�%�w
�L�G�1�Q��r��*��r=��e��.�M��]v�{��B
;��j��&�ta� ��s�3� :8ݐ�cO�
�CK���A�bz6�	g
-�5�P�#o���`>O��h�5��Q�P]8[ѫ�U̼J&U6��q5�V��۴��7K���\���}t[�NA.���	�S��Dx0&O�����!��d����x
G�:� �T��'�iR�Gp�ԑ'�
�+�p0�h�}�V���[Uo��qt�A��8�ddX��	d�y#���+G��G\F(��G_�
M6�
rj6����$���Ծ$�L�߃��"$����C
)K
A�]�5$���75ҽvCe|�C1��iT�e�C�
~�*|��^w��/��ɼO>�5��?z��)u#p\TQı4[U�Y
�0^��v�Š��R
���>
-��`?��6
ט
Y#�
��@�P���}�? 2K��wG
��I����i1/W�\��8R�x�2jc�͠궨��B_�{�5�5_��}Vm��W�=KD��쌉�ajUf����=�@")�ݬ�����_~�|��?�~��j
��
E�52?���y6ɪÔ
��
C�Y4�P��Uv�Mq�jS҉�;�j��*7��j���6��,�5��9Q[񎓨vV뮳(VvвL'�jG��.�����z�z|£	��SX>��$1�ǘ�tP���K4����H�axΐT
-4�q�1�șj�"�

���|7��Js
��v�jǗܤ~���q�����VCK��
-�?��aŠ�@f��l�p�)�DŽ�y*�����UC�%�{$��:�l��C�I`'�Y���B��ʍl��e1���"��ܲm�SP���<���Hw{C���
ǷQ�tp:8�F
�^�<��x�&W)WP���_
-��<�>P�8����8:�p���l�5��7��׷�����FͳAu�k�~`1�~�a6�K�G��^߸^��@p%{�~-�.
m�~�����_�4�
�6&� �����
�	������C/�
����|��P���ڤ@��� ��=�/�����<�`��޸�g� �\׉�� C
�!T`P�ꨰ�`�� =�Hs&9
���ǻd��gn;�����Z��=~س{>��d�L���1
-)��o����O��{��t��Haf�=�#h�����\,�@��"��4���W���]�Pk�
�o��f��B�`,<v�B���G�o*��/_D��+�ȧګuױ�<��
���0#
�`4m�+��^0�|��UŠo��h�%�2>P��3p2f�U�cz�3����Zj4���_�/����Q �ɐߦ
-�DU� �Ġ�L =�\8O����5�����M�7�@b���������=9l̎�/e��`$)�{�!���y����u��ߍ���~N��F���]Zn����N#�-"���4��P��w�Ӆ�%[U���a
L�j�����
��
A<�o1�Q�#ܺ�s��_x�H����iBC�/���p&QD�����&���-X� o��?r���
-endstream
-endobj
-9819 0 obj <<
-/Type /Page
-/Contents 9820 0 R
-/Resources 9818 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9831 0 R
-/Annots [ 9817 0 R ]
->> endobj
-9817 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9821 0 obj <<
-/D [9819 0 R /XYZ 89 770.89 null]
->> endobj
-9822 0 obj <<
-/D [9819 0 R /XYZ 90 718.682 null]
->> endobj
-9369 0 obj <<
-/D [9819 0 R /XYZ 90 671.658 null]
->> endobj
-9823 0 obj <<
-/D [9819 0 R /XYZ 90 667.175 null]
->> endobj
-9824 0 obj <<
-/D [9819 0 R /XYZ 90 578.82 null]
->> endobj
-9825 0 obj <<
-/D [9819 0 R /XYZ 90 500.822 null]
->> endobj
-9370 0 obj <<
-/D [9819 0 R /XYZ 90 453.798 null]
->> endobj
-9826 0 obj <<
-/D [9819 0 R /XYZ 90 449.315 null]
->> endobj
-9827 0 obj <<
-/D [9819 0 R /XYZ 90 351.062 null]
->> endobj
-9828 0 obj <<
-/D [9819 0 R /XYZ 90 285.019 null]
->> endobj
-9371 0 obj <<
-/D [9819 0 R /XYZ 90 238.394 null]
->> endobj
-9829 0 obj <<
-/D [9819 0 R /XYZ 90 233.911 null]
->> endobj
-9830 0 obj <<
-/D [9819 0 R /XYZ 90 135.658 null]
->> endobj
-9818 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9835 0 obj <<
-/Length 2454      
-/Filter /FlateDecode
->>
-stream
-x��Z[���~�_�S��5SW�%�����ٝ[2�RV���ۦ�(6xg��}��
6��6�(��8u�ܿS��#�OW�__=�Qq/
-������O�(�!�V�G��p���g��:�Q������^�|{���v����+���G
(�-�W?o��?{$����I[O0����p��+R��\&��\*A����B��(4����_��L���
��<Y­`8a���dj�{+ }���oMʈ�P�@�QI�� �GT)��y�E�>�"`�����m��SM�x(�A(�F
-Ϝj�r���&N����8�gB�Y�4�FT˧�
6�a���\4T#�
ۦ�H�r�ۻ^�ٌI�K:�3����]�u��n����d����f�F
�?�!��h�g7+7���B����3*}��*���.�&����,6�h��gln�|N�"HxNi�Z�`:W��Q��
lr�{
EF�I=�"����Pǫ����(��
(��)!�/��n�(c�YJ۱
�T����
�*PB���]�.�F������25����� أ����gL��|�8
�,D,�P��bT�,�t��TD,T�����8�͌R�~
��
��`7z
-8\9"�����&_䳹��?�)OV���DB�Bs�<SV��	`�kY��ݲ\�e�b���z��S��bј��\��ܱJw}�ְ2���y(��I�#͌���o��
i
�ES��&����EQ�Up#�D��}Æ,�Ɇ��k�:ض��~�����/޽y���^]�ֻ9�����
��C�l�c�n�4��CN�v���Ԝ�6v�1���$ˤ�ԩC��7�(����
-ڽ��>��.��p�;g{e���V3�꾶1w[C���Ρ�ۭ����b���8OJ�f$����u^����pkǵ�*:��7��s�+�C��y73F|�<a�8��͊j�.��Iq�t�^���Z�O��f��+:zc����G�
�c&m�i�H��2�M�z����L%*Gh�u4"��Yor��
-��H)�����d{*H�c��!QI
֑h��!�ťlt+���
�q=fTn��0�"N�$�;�ă3����T�4��P�Eq.��Y����̦�猌j
-&12*�!Ǡ䬓��
-���1��X�7�6K��N4ڿ�#
W���%�K�<�,kq
���
!~�u���������}�m�ژ��s(���ɲ�"�H���)>�5!�@
�'oM�`�tR �
hZ�Ct��D���	�����Ą��{G|Zo���oܜȊ�msB>�9�d�
�����&��Kh>؜�Xh�mNЪ91� ��
�g��o�/g4 �i�*:
�_d��`��6+�os������KA���{1��u�4!}�����I�[���0P�6ϙ��*6�ʭ�qDL��i�Auq>R�"h.<�74�D�ƨ��*X��`u�,�ƥ��1�ͳm�]�.q�/\!��R�"�e�Yt��iOC��,�&�Y��X��](� K�A���
���rs�#�#�l���%��i�s��W��
5��|g�(�_rPaR�PC�&b�&:5B

�-РOڌ� �5�G�nm5|�	In�Rb�K�{N��h*-Ij����aL�8���}I�Mh�꒓{��.�3
�_���.�댇a;�z>���`p���j�~r��X�泉:��
ɀ�Qۈ
���
(;l4�xbJ����
+$��S����i0`:ƢI�,B}G�S���k&
�39Il晩(β���9�cC�Li4O&��� �"���#�rM$&E߀��$.����5
v�
����
lH��_+L���#��`��`_G���NG�#}��` �
�O���ME҇�u8�������d��?g��'K~�@��i;m�|�3�r��������l�T�\L����~*D�Z���<_���|5�`_=�@��a� ��q���&~/���p�q ^���u��>g��a؟���1n�(�9
����$]�u%��f���
���%⭬N
��
-��H�h2���
��PmG����7�K%�?��eY�J��C���.�ahf�3���A<�{o7Y�q�<V�@ki��
V�@+a(�H��
`@�	`�齵�qY�`8bB+ۮ��	SL8y6L� Rv�,���(z>E�!��.�wU���Ҙ�&s�u������gM��ASuʝ�L���<���p
݄�bܓ�Q

�D���
��P%��w+
�n�
���?����Y�\'��lt��i��A-Ys�Y�o���{��H���|l�С,��[��p�2����;w�ޠq{P�"A�����~�z��Ֆ{?d v 7���`]
jH,���ԋv��������"��l�o%�7�t_
#t���)c����X�!�+Q9��ݰ�˕�r�؂�Mz]���Ϟ���
-T���i^���t�okem��&
nm@>Q�{_��
-endstream
-endobj
-9834 0 obj <<
-/Type /Page
-/Contents 9835 0 R
-/Resources 9833 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9831 0 R
-/Annots [ 9832 0 R ]
->> endobj
-9832 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9836 0 obj <<
-/D [9834 0 R /XYZ 89 770.89 null]
->> endobj
-9837 0 obj <<
-/D [9834 0 R /XYZ 90 718.682 null]
->> endobj
-9372 0 obj <<
-/D [9834 0 R /XYZ 90 672.057 null]
->> endobj
-9838 0 obj <<
-/D [9834 0 R /XYZ 90 667.574 null]
->> endobj
-9839 0 obj <<
-/D [9834 0 R /XYZ 90 555.308 null]
->> endobj
-9840 0 obj <<
-/D [9834 0 R /XYZ 90 489.265 null]
->> endobj
-9373 0 obj <<
-/D [9834 0 R /XYZ 90 442.64 null]
->> endobj
-9841 0 obj <<
-/D [9834 0 R /XYZ 90 438.157 null]
->> endobj
-9842 0 obj <<
-/D [9834 0 R /XYZ 90 325.891 null]
->> endobj
-9843 0 obj <<
-/D [9834 0 R /XYZ 90 259.849 null]
->> endobj
-9374 0 obj <<
-/D [9834 0 R /XYZ 90 229.207 null]
->> endobj
-9844 0 obj <<
-/D [9834 0 R /XYZ 90 224.724 null]
->> endobj
-9845 0 obj <<
-/D [9834 0 R /XYZ 90 139.41 null]
->> endobj
-9449 0 obj <<
-/D [9834 0 R /XYZ 90 117.034 null]
->> endobj
-9846 0 obj <<
-/D [9834 0 R /XYZ 90 117.034 null]
->> endobj
-9833 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9850 0 obj <<
-/Length 2269      
-/Filter /FlateDecode
->>
-stream
-x��[Ks���W𔕪��sK6��l&Uή��ɔ��`��DjIif��>
��֓N���X$u�@w
�8yLp����Wo��Xb��T&�����		w��ӄ`$��`�'7S�'i�L�n�O��󓝗����L��w�>��|zM�|�H��_�hl9%zb�I�9aXM?��p����+XpB�n��Nf˫O�q2��?$1�����e�)��E���߮p�
�{f��V��Cyl�e\�p6}�
{��ŪX��,],���٢��
Ր1���u@�����5��`��
b���$R
�������Hk�Hm�t�3(2ڴ���!� �x-
-c�A�L�ɛ2��
�R��c@��#�X
���鵞�U��
��.
�@�
�����-�yV������fF1����eSk~���b��?���k.�dV�U
��������u
g�������������4͈��Q�" �[\m����<�k����]oʼ
-��W�7�����A�P*Ǥ�=���Cy��U�kʻ>�2���

f�հ~ʪ�0��]9DB���g#)q�[!��ț%�"���1�DATCt^0,Šz�mfW����Jz�yN~?	K�
!��,\�����b_[&"�$2'���`�
�E,��'�Kt��J�XEX42J�<�
��*!��+˄2P�]�˧
O���l~�����fiC�yq:(�HC��N0���ܠ����b;o��bJ��k
�e
q1�Fӷ��2r���+���,��U�����
@�`��
 �2n�]"��vvK����4�7�
z#�
���<��D�N�7#@h�M�Dz3�@o"P[f�]�.�0��T�)�����z�4N�s�ZhH�_(�@ox�N �	����������YV����4��a��|�� ���?N�x��2]������]��_���SZ��4� �;7d�XExZ��]��2]����A�V�ߍ ;.6s�tDO!}��j���ډ [...]
7f)�š�Aa݆�� zw	���s:	j�Xĝ�:�D*�󥱷LJ���M�9��`�MiR!e�)�
Ji
���SZ
-�(�T�ZK��A
-�Q��+Ȭ[
-�B��StD^�TpH}�(��T�ii�U�L=���,=������y���T�tfKV1�G�$����Eo?|5%���ˁ"����%2v%
J!�2�"��
�r��D���"��:�"�Q �A� 
P��b��:>$����%1�v�sW3#H��j�ԣz����i�b���r�ƫB���������o+�Qթa��h�&��Ҷ�[�ȉ
��g���+a
-#
����	A��1��OY� 3>�`�#�������l�#�z��_B"���$p�C� M���vZЎ=�S��ߪ�[
��ZS�=�����.|]�Jq���7�J���\c>���+Ȭ�
#��Q��;"/�z
b���6�Ǵ��z=S��z��gp���A��
s�hy�#�Q��ϟ���DJ3�~�E22;������,Ofv�$)��ؙӑ�N���:
8�֍��:C9D��(�kZ�b�u)�)��oy�z��A�
u�c�
?�ڙaj�5����_S��Oq��N�N�(�ʫǭ� ��v>)�cR���K�
1
i�F�vcZ�P���gR���ߨ]K�Ο��ȉ�T���<H�p�<1�S=f�2;��4�A�v1
�e'�jn'b�n�~˖ٯ��j�~�� O��
�C���	��!; �� 
(�L���}a���,
y�_�s�,�A��i�6���"TMz�,F���k#~@`�q��|�^ ��8�^�명/2�(	4e
C)�
�93t���= [...]
-A������82�tm��cw�#HB�>
*A�{ũ�/���
�
���+�l��oV�]n���c2�bccz��f���@Xw;/�Rh�ٱ��а+(vjM8�R�y�X77���+[~7b`�5�7��_�z�g�ܞl�]�!�%<��ڀ߃�W�\�媞�-"\�j��i�^�{��~�X����^@�
;
t)m�?�7�꾩hHV���e��d��Ka�$�[�8�`
�(E���������?/Y��
�e-����A
-endstream
-endobj
-9849 0 obj <<
-/Type /Page
-/Contents 9850 0 R
-/Resources 9848 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9831 0 R
-/Annots [ 9847 0 R ]
->> endobj
-9847 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9851 0 obj <<
-/D [9849 0 R /XYZ 89 770.89 null]
->> endobj
-9450 0 obj <<
-/D [9849 0 R /XYZ 243.423 711.11 null]
->> endobj
-9852 0 obj <<
-/D [9849 0 R /XYZ 90 704.47 null]
->> endobj
-9853 0 obj <<
-/D [9849 0 R /XYZ 90 645.719 null]
->> endobj
-9451 0 obj <<
-/D [9849 0 R /XYZ 90 611.049 null]
->> endobj
-9854 0 obj <<
-/D [9849 0 R /XYZ 90 606.566 null]
->> endobj
-9452 0 obj <<
-/D [9849 0 R /XYZ 335.617 537.255 null]
->> endobj
-9855 0 obj <<
-/D [9849 0 R /XYZ 90 530.615 null]
->> endobj
-9856 0 obj <<
-/D [9849 0 R /XYZ 90 471.864 null]
->> endobj
-9453 0 obj <<
-/D [9849 0 R /XYZ 90 437.194 null]
->> endobj
-9857 0 obj <<
-/D [9849 0 R /XYZ 90 432.711 null]
->> endobj
-9858 0 obj <<
-/D [9849 0 R /XYZ 90 343.199 null]
->> endobj
-9454 0 obj <<
-/D [9849 0 R /XYZ 90 308.53 null]
->> endobj
-9859 0 obj <<
-/D [9849 0 R /XYZ 90 304.046 null]
->> endobj
-9860 0 obj <<
-/D [9849 0 R /XYZ 90 214.535 null]
->> endobj
-9455 0 obj <<
-/D [9849 0 R /XYZ 90 177.977 null]
->> endobj
-9861 0 obj <<
-/D [9849 0 R /XYZ 90 173.494 null]
->> endobj
-9848 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9868 0 obj <<
-/Length 3004      
-/Filter /FlateDecode
->>
-stream
-x��\[�۶~�_��V��`�/�S/�'����v��x<�P�l%jCIYo} �"%P�$��N�b�tx���>�qr����͟no^~�Xb��T&����Dq����Y�a��
~��.aR#b$��=���~�}���{����ۛ�o|���t2]�|���<�.���<�A˄S������op�K��������d�4�a�E2�k�nH�`\���&-��
�N���7
~뿴�
X�5��9j�D�2�U ��I��H`qL*�&��'��v��K�E1†��N�>?~���H
-�TF6��H�
Umen���
-<Xdy:.�u:$�j����*��6+�9)�/ǟ�e��t�o��ɿ��

������덂�z��1�h���hR���gk?�e�z��ϣ �+�|V$�1�
]�dz�ό#
-
Oj��~�ۇOy/0_�I�-Mj0��eZ�7�ϫy���{P�H�ۥ��eH�`�ئ��t��
�тƄRl�
J� et\()���;(�zA�:M�PjjRCi��e�?�.��{�A��Ŋ��=��@����
1�$��A��L�f�/��P�,}�t�.�Vé�˦ئ�H��$uH� YLQ�,{�C����eo�`:���I9�H��{��M��+Q
Q����j
����?.�
�?�u(n3D$�%1WT�
�Ӑ�T 
-��#F1�L&#�9�t{��泐v
#�k��2�:�V�����;H��d��6�!l0wn .�
�幛�i�MWˇ�&��l�m����ls_~�����b��+A�㛛�
��w���a��[98��dPb'�p�� n��n����HZN��&<�@ɵwK-���.�<-+���\W��y#���ho�n��1=���+�$&�_�ן�����U�JJ��	���P�N�A���B��%�7�O�/���!�='�J at r_
-)�d~"ZP��V�@�������+�
��x��>A1���2I��G�O1l>̢Z
-� �辩
�&"�1S�>
DY����bew�c��!��9EL���[
�P�'��
��k����
Ȗ��,/
�dq�U1��5���F R
y�ּ\�!$�<������Ъ�:ʪ)��u^ CF̨A�|��9X��b,N�/(:_m�`�
�t�N�F*����/R`��MsLb�
-߷�H7�"�v��
kK���}-
�Z�ֲ�Ŏi�g�mc��v:����Drјl�E:/�m�Ymmr[��f��
��R�K��3`�Lh>
�1�c� �
W�����K���Q A�9ڗ��So��|�XGAȊRFU�WF�!��T���5���
��o��6���O�^�)2��ec�>K���
���,��M�ୈ
-I���^|�z��^�}K@�o#����$Йր��A�jA�YUvN}_r����*��˾J簩�4+#�>P�-
L���RB�ƾ@E(�`� �cN�\��ۈ�@�$088^�<d/(�wn�\�|
_e(�BO���a(�ɶ����f�[��	���uI��l���eh�U(Q�M��]���I�jD��s�W@�݄�s�4wV�r��p��>d���l���ō*
`��ta$XsH4OV�"�i5*0u��]��œ��Bل�R��I
mHx��pQ%�b��P�
-y:�mZZ�d�L�ͼX-��LV�%�b�I�	ȃ� ��
S@�iμ�W›mo_�x�M�};��k�r�0
��~�˲-��Z��iw���������߷*�Y��:	�9�vSG�`����)'%m
- �b~Y��C�$t�nEl�.
p~�4'�����i�+�	��[��Jh���| ��tF�sl�
�E�rS
�oY�ɽi�+5	�����9/��{�	dz0��[��HJ� �ř4畚�����
ќ��ѽ� R��4gt�LL�.��Js2#
�.�y�.A����o4�o4��=��ˣ]��:��IEL�3�D�Ѹ@��H2��:

��&FR���Iwv�"���R�v玨U0��:����i����� �
��+
$T�PTܹ��}:�U
�]48.��9]A
qX@��l��4�:�ۆ*�m�Z������wÔC9�c��K<��gܳ6��}�}�5&��
2�;���'T1����k�}jœE��cZZ��{�^��,��߯���W�sY��D7�ܭy�� �O%C\�#��v��E#��YSʪN��
���L��4��]��^�
yJy�9��{�!!J�f�)"��۳���]�Aƨ�����]���b�I���|�d=laۉ4���dJG;&�s�KV
0{���c�r�I��=&`�q�86�
�14p���SY�:%@�S�r�P
v
�PN�%8?��B�>� 'g
��`D�{R �硓)
!�($�H)�dq���I���R;/���։��
�~V�Bڟ�	�B=+qO����M܃�ڝv�&��ܶި1%�
���W]�=�5����j��;}0��*a(U
R���z�	C�
�<n<s�
�
�$��Wk���YX{�R��
k�;��g�ݽ]�}���9�����ͭg$&�_�E��ܢe�my�9'�X�3�W*l�����9��9̹=&D�s~�<v��P�b2T�%z<�0�#ѝ��K���R����+5	���Io�������ft�<��:&7]���gI\,����a�u~�&a,559�:�Mҽ� �
y.�bKthR�/�:�6�a�$�=P����Q�שd�[�t��E�S)K\����Z@��fb��
��I����
q��5�=L�I�3�OS�
���˗��]L�m)��%&���i}b��_�_
_����O 
�cr�
,?�xL������<�dc�KOU1�m�e��}Y��|���%K��a;q#�7�	�❶�VyՆ��H�1�p���[�uZ�~(Ġ�_��v��׶�O��
-� l�&�A Fާi�Z�׿k���
�����T�������˗��
�;鰭�������*H/WE
����q��R��_n05
-endstream
-endobj
-9867 0 obj <<
-/Type /Page
-/Contents 9868 0 R
-/Resources 9866 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9831 0 R
-/Annots [ 9862 0 R 9863 0 R 9864 0 R 9865 0 R ]
->> endobj
-9862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.826 647.922 452.756 658.826]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-9863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.826 381.843 452.756 392.747]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-9864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.826 91.455 452.756 102.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-9865 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9869 0 obj <<
-/D [9867 0 R /XYZ 89 770.89 null]
->> endobj
-9870 0 obj <<
-/D [9867 0 R /XYZ 90 720.814 null]
->> endobj
-9871 0 obj <<
-/D [9867 0 R /XYZ 90 606.154 null]
->> endobj
-9456 0 obj <<
-/D [9867 0 R /XYZ 211.842 541.904 null]
->> endobj
-9872 0 obj <<
-/D [9867 0 R /XYZ 90 537.266 null]
->> endobj
-9873 0 obj <<
-/D [9867 0 R /XYZ 90 454.735 null]
->> endobj
-9874 0 obj <<
-/D [9867 0 R /XYZ 90 315.766 null]
->> endobj
-9513 0 obj <<
-/D [9867 0 R /XYZ 216.764 251.516 null]
->> endobj
-9875 0 obj <<
-/D [9867 0 R /XYZ 90 245.499 null]
->> endobj
-9876 0 obj <<
-/D [9867 0 R /XYZ 90 164.347 null]
->> endobj
-9866 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9882 0 obj <<
-/Length 3188      
-/Filter /FlateDecode
->>
-stream
-x��\K�۸�ϯ�)��,o�S�ٸv�T�z����rq$j��D�)���_�@R$��gs��A�jv_��Ɠ�	����������D#-���_M4�D\#!��r�aJ0d6'��݌�i�o�Ow3�����c���Oo��<�_no���r6�O�[ǻ��KVI>#j�d�$IF�a=���Ǜ���|�!�
��l�"5Yln>|ē%\�q��j�lo�L8e��|��
.ͨ?fh>J�@��8��|����.��"�f;�БȣG�'�
)�%4:���[ulAC췖����9b��'���i!:b	|��H�H{�pDa�K!y2Y5���i"��03b"��gW,oo�l���K�N���|Ƣ��~�d�[������"����9  ڵ�1���NY*�0�X#�Z��̷3*�ϙs�te����q��4�؟$_�rwS[�D
�7����Cys�%RQT��
���4�U-�xLw����2��فO��l��<�Ez�N��L�y� �׉�H�y��cDyR"����V�U�rĢѡE��d��	n���O��S����#Y��
�-���m���}�L���*�n���ځ&���ل��0^�]��]�y:cH�}z��<��Z;D�R ��yK�է�g�FJ��.��&V���堚~��
+��O��e�ؤY��o<29��a�jG\'��Y��/ _W^�̔�49/��)EG�B 1�PV���dS
-u�.8N�D1pf����Ԝ�
-�յ�
'o������h���f�B
2#d�j�c
(�(�H
(  Ӷ����մ�no�*���k���_��Y�\LPg�z����DԞ�6͒8���2S9�L0u?k4~U�����-�
��̈����m�ZPV��n�� ��EZf�.NU�C
-�����R7
Ã����R �{�:��F$��+����|��ަ
i/W�t�W�I!�aH
-!�P`��\��h޶��\��qUCѢٔ���oAM��&ɒ<.�Ҟ=���3<{O�Ի
-�#�ŋiO�-M�j�R&U�|H�58��V��	�s+��2��)��M#;��|���}⯔�ʻ9��;�f�7J}�_HDS�5�عg�meP�v��@��+P�3��o���o/׹�*po��ː�,9$�9�đfN���t�h~�q�1֎k�xWf��
��	&#ۯ_�!�z_��-��h;|~L��W�H(t"}V��'1����N���)��E����r7�- �@X��KU��&�x���'Ӂ~���s�h!x�>� ���R=�D��	}�_Чxz_0A��*YC�-�?cDB]s�2-x�D4��ʼ�0����W�DY�8�غ�����JJ_�����,��^��kX
-BC;���Mh?�)&W�c?�@d��sh��
#	a%�Y��6==4�*�U�`�N?����`����^�_���~
�.6��A$?-�\,���D�<
-�%
-E,t���zK�i��RS�K�$�B��fh�ؐ������h
--Ѣ�+0K
�B���
F�J��WG�*Cp�R�N�W©�J�p�
�̓�%�``K�օ��k�.���8s��� M�����۪*���S]#�����ymH�g�
�x�'h�8
��C����Bz�D{T�3X�:[�7�*`��;�2�F���Ė��NW6$�
���N���̥j<���l�W�����e�\�mp�?��|��f����+��m�*�]�C))�
{�b���]�1�
�TZ���]J�M8�� �ٯ�*����N�S=g�z7.�]�V��Ȉ�܂Kt�MDHF�󬱙�G
Q";�(���*E����ȿ���)�UK�i�+��b�$�ݫ
-����
Q 
ƃ��7Wc�Q5�0�k�)'H�A�>����E5�c�u

-���޶�;�/�Q��t��
-y�ո\�y�<;9��S���tX�/�H0��!	���ky�!�D4#�Ҋ��z!#߲�wJ���/_�~/���a=�r�^J�����
�`P��kM;�f���9)-��G���'�-yRoɓ֖|
�r�X/Mr�}���'�
��� �9�2"�lj-6������DDm��oa��DW{!�D*�����6�/���8�0~��k9}E5��9�̑�������(���Wy�y�d�Y4}q�8}��'8}������b�
��@u
q�sy��N���6�Y'@�'d�HE�#�	$!��-�e�X}y����T��dK6�D�-]���/|1T�>6ք:��,+S
a������%(�.���4ƺ��
�Ha�����
J�SN�.�8��I{���	�.
�{p�"y��ue-&�r�<�
\ 5��
�j'���Xq�cf%����]�ÔJ̃�Rm�����Qв�Fۇ0a���v��b�T-�-Pz�:�q�T��B����B�{�G�
��>�P���\y�XSJ`J�ꟊǸډ��)��]�+���I�
p�d0N�ot�B�hH�/�D�R(��ye$�Yj=	v�Y�+���d��}bUQ�
:�E��$��l������CD�M�($�BKt��@Q�d�h�@$��ZW����J>�;�p�6~�5�}haMk�ك����)�5�)��5�OK?�@$>-�\|����I#���OF粃�Q!��ƏϦ:g
��
�JZ��"c�A����9C-C"4�@P"��"@��@�D#����K�
<���Φ&#�福��@��@���_�
����=
��hϨu�A��y�G&�d8(�CKt`���
-�XB�T�����i�{S��H
��u6&��b��i�G&6��iH�_,�<~�H����;���`!i�o �F ?�2�+�
��0��Y"�u0�=����1�B��e��
{Ͱ_�b�nd��"�w��ezv-�ɮ�,ċ_�*��5{6�1�$�Ю�!��=T��r�֝�|:z��}
�2����:U�
w����%�}��c���7f�����i����P�8şϹy���N���(O�
�[�������|��4|�n�J0�l�tS9��$/���Ӟݒ����s���	1-��q���nl��/�I~ج$�ɜ�&x�s��ŁS�?�j�ww���
-
��[�E�t�����a�dB�1cհ��:���m^�47��(�ȹ:z�SII�����|cvr"{|�5�����
�ذ�_�0�?u��
�L
-endstream
-endobj
-9881 0 obj <<
-/Type /Page
-/Contents 9882 0 R
-/Resources 9880 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9831 0 R
-/Annots [ 9877 0 R 9878 0 R 9879 0 R ]
->> endobj
-9877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.826 494.372 452.756 505.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-9878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.911 304.721 340.584 315.625]
-/A << /S /GoTo /D (index_Grid_Frequency) >>
->> endobj
-9879 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9883 0 obj <<
-/D [9881 0 R /XYZ 89 770.89 null]
->> endobj
-9884 0 obj <<
-/D [9881 0 R /XYZ 90 718.682 null]
->> endobj
-9514 0 obj <<
-/D [9881 0 R /XYZ 211.842 654.432 null]
->> endobj
-9885 0 obj <<
-/D [9881 0 R /XYZ 90 649.795 null]
->> endobj
-9886 0 obj <<
-/D [9881 0 R /XYZ 90 567.263 null]
->> endobj
-9887 0 obj <<
-/D [9881 0 R /XYZ 90 428.294 null]
->> endobj
-9515 0 obj <<
-/D [9881 0 R /XYZ 216.764 364.044 null]
->> endobj
-9888 0 obj <<
-/D [9881 0 R /XYZ 90 358.027 null]
->> endobj
-9889 0 obj <<
-/D [9881 0 R /XYZ 90 276.875 null]
->> endobj
-9890 0 obj <<
-/D [9881 0 R /XYZ 90 173.771 null]
->> endobj
-9516 0 obj <<
-/D [9881 0 R /XYZ 289.989 83.504 null]
->> endobj
-9891 0 obj <<
-/D [9881 0 R /XYZ 90 77.486 null]
->> endobj
-9880 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9895 0 obj <<
-/Length 2471      
-/Filter /FlateDecode
->>
-stream
-x��[Ks���W�PU+rH&�S���$�&SS�ˬ�H/Iͬ�}I%Y]I�r
������2FTL��>��`������^��AFR9��<Q� !���c��~��q¤F�Hx�~��/�o��ྻy{��
���x)=��o>~“
�
3�'ߪI�	�
>W�7���
-���+�A
:��q�e��R
��R
��:�GE4C��J��6��6-�}<DKĉ
-@��2
B��]�(�k5J
�J~N
�8��t���{�'���y��q�~s������3=�I�;!~Voq�o&��� ��)pR�ifld |�
% F<�X{>o����f
����tD���a�Mjz�Dg>��k�o���pL�I�#`8�Ӆ����?�W�۔w�
Q���


ڮP>%�I���H�
q; J �Z3�`CCg�eF4�N�텳*�����}.�̃�I:��N~?0H�=��w�a@�k˄@g&�34G��&��K��E��:"�qg�FHn'�
)���$a��(8��[�(�ӓt�q�5^%�������Mk_:d�9Ҙ��)�0�}U��1UCg��*���)ϦTD��#��)b���.��!i��y�F\����#_$`�<j���l�
���ʢ��̀jל��."1��52O	
-bnz��]��(�Ga�3(�J@�E�'�ң���m���7�+ t.#���Z���L5k�L�U��OǙ
�B!M��3����+�1R -��J4b̼��s �
3`��̊��\�1yLG�5<F at vǜ��c�Դ�1=U/�1����1���Z�]DR��u�kd��1��Ѻ�c�%<F�f��c� �<f
�	 
�_�s�j�r��@D[WO	���|Jq�e� �))��4	f�K��*iV�
-�P�'����H�Lh�����ן��S-�x�W�
�H�8#5m��DH}ހ�m��e���S
a���e�'qZ�o�!���S at x�vqA��1 1� d���q�~��Ha��%���)���(�Q5E3��h04L����
� =��l-�۳£�� ��;4�OIɊD%<�
-*�	��eW��6k̝�?�����>JC� ��!��֘���ai�nI�l�AXp�1�2�
c��T�>��۫��g�X���P1@��
�U
�׶�='�G��`��%
�p�]5�<��.�b��$���8� 77�'u��WSLL��a��
����Ϊ�ʑ����0{��Ia�:�=�瘪�rqW���k�rQ�墁���Y�_?g�H\��'���<:I�����f f7��3V��Sk�)J���z`L������	AC�
7��	�=�k�E��M{�o�c�lLO�T�~}�q���Mm��h���`膞m���kg7\d~8.��e�w���]X?�ﮒ�\�ƞ�����Lp���˧zުb�[?��,�`mZC��%Y5p�A���&�>�ÓQB�G�@P��w�o�4

�4�E6�!�T׶(�e�f�ky���
�q0���U��(w��*�� x�I"��n�S屰�<.��?H��h�&�*.
�1���I���6�%��nl
-�����c�o��=or0O�GVӻ�}pat�\�A��Bc���
I�8�m�$���K�Y��]�S��lB� ծ.��k'J�s���6��H
B(���TE�(Js0�P��q
B�Ra	�)�[o_�	n6�5��R�7������<����e�
A|ϧ[��&���x�:���]i�³��Ţ�i���KV��w�=�C�~R`h_�`q�o��O���
n�`������*a�B�+5n��0)G���̊�R �xC���mG�5�[J��=Z�vLM��mO�
��������@ ݽ�8#��ʽ�~��
-Db2�/E��y��먄��H�>#9�Υ �3��u�r/5!�2>�*2�
�����@#@q?
Ӛ�P���r�\U�k�U)F=��Ns��<.+���{pgI��=��w��}
�ͮMv�F|9x#.�S��-^㼛]Dm*+��P���P��� ���M�N�Ql�Ү{K7
�� -#J���E�gk�@ū�"�
�����dV�� i F��a9Ȋ:����x1)"�*05)Qφ�m8�aE�(Q�gH��AJ��X�H�)�<6���Ѩ!h�j[
�C��#T��
�%L"8B����$��2
�j�fZн�:|�/)�;�'��ޕF
ӟ�$-_�/>҇�
fUy��u�̡���w����
�7��"WH��'����R����\}ټS���f��f l'n�f;���k0��:���sv�]g�����,l�ǩQ}6�����	:R��]�ؼ�opDvT�u�|���\
ח�O����Gp$D��x*���ۇͲ����������=�m�r���-�kL�.� [...]
-endstream
-endobj
-9894 0 obj <<
-/Type /Page
-/Contents 9895 0 R
-/Resources 9893 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9831 0 R
-/Annots [ 9892 0 R ]
->> endobj
-9892 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9896 0 obj <<
-/D [9894 0 R /XYZ 89 770.89 null]
->> endobj
-9897 0 obj <<
-/D [9894 0 R /XYZ 90 667.827 null]
->> endobj
-9517 0 obj <<
-/D [9894 0 R /XYZ 90 633.157 null]
->> endobj
-9898 0 obj <<
-/D [9894 0 R /XYZ 90 628.674 null]
->> endobj
-9899 0 obj <<
-/D [9894 0 R /XYZ 90 567.766 null]
->> endobj
-9518 0 obj <<
-/D [9894 0 R /XYZ 90 533.096 null]
->> endobj
-9900 0 obj <<
-/D [9894 0 R /XYZ 90 528.613 null]
->> endobj
-9901 0 obj <<
-/D [9894 0 R /XYZ 90 406.026 null]
->> endobj
-9519 0 obj <<
-/D [9894 0 R /XYZ 280.943 317.866 null]
->> endobj
-9902 0 obj <<
-/D [9894 0 R /XYZ 90 311.226 null]
->> endobj
-9903 0 obj <<
-/D [9894 0 R /XYZ 90 240.52 null]
->> endobj
-9520 0 obj <<
-/D [9894 0 R /XYZ 90 205.85 null]
->> endobj
-9904 0 obj <<
-/D [9894 0 R /XYZ 90 201.367 null]
->> endobj
-9905 0 obj <<
-/D [9894 0 R /XYZ 90 140.459 null]
->> endobj
-9521 0 obj <<
-/D [9894 0 R /XYZ 90 81.969 null]
->> endobj
-9906 0 obj <<
-/D [9894 0 R /XYZ 90 77.486 null]
->> endobj
-9893 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9910 0 obj <<
-/Length 2155      
-/Filter /FlateDecode
->>
-stream
-x��Z[��6~������~ٷ6M2Mәm��>��
k��Lm��t�}����L�����t�tn�FT���lo������b�AFR���$$�[�C�� ���7S��([Eo�����c�Ȣ�o��,ʞ��_g�b:��/�Q������8�
��<$Ɉ
!��o&/o'�&d�qc
�t0_M����߀����K�ip��
�M~�`O�R��!��1DT���)�Ẕ�	P�Y��%#�"
0�asH>��6[	�e"Z �u3e&sJH�&t|J�j��)Ո
�	��o:�a�����b��E� FC�	2�z����C�����5�

<�q����
Vs�(�qJ�[����"^�7���A0��߹
��f���?�
 D#%I��$�l��i�$G
ƚ��p��'�2I���֞x�J6�g\#�T0��݋?,�OE�2_?Y�|v����G���y=��vI8EL�=u=y(F|7%��u���!o�f
�q0�m��1�
�!C���7M�Ƿ�dF1
�p# B��U�u��
�H����kg��=u�v��47���D����u1&��!i�!T��
ևuN�<��3
0��x&�?YDRh�P�f����ʗ�A%i�3�c���퓨pw_�����U���"�rX����9�
8<����X��,-_�vA$"L{��$7rL�?�Ӎ��$�y �A�U���?���H �
�G�a n�����S2>d
��0�
s p%mH�^�l'
Q0�
-$����1�P���a�vk�P�@��P�E�d�
-�‡�*N��fO1G�Q5} ��Ue���C���*�"����1[O���U��
- 6g�Q���@�����
-A"
��p���8Y"	�O.5K��z���2
�S̀v��f�)���u�K0	��
-	�Z
Fw0<�`�:
�����(�rO�cI
c�P��}N�1P � JIc`�=Q�x?ϧD�˸C �`.�Z
C s���[<
-;
�O�$x��'�'�
*=䉘�4cB!��O�ju&)�/�y�HzJX;��x86�f(>��(j��߈�p�
T�Y܍�X2`�e�=�-\�|,��!Uڑ��21:I�'�mi���^�
�g%U��]շf1Эۆ�D�
SO���8:�9w
���Akf�R�-ZE�M}E!�>���7P:K��^��C`>�0���� ��
F<ե�F<�/q���t��DKFG-˾��3@'��=�S	S��ıFX��Ә�ք��Ꙅ����T���ߋ ��Ȝ�`����
��WZ�ei�>t�v�Րt��TF؈f�U&\�K�r��<߬�0�T���d
UMeV��U��^��֛��p�2�e���j��y�G�7s�X���,+13w�m6��u�t�dq�ɪw�ܵ��CKC
�D1�%�~��I��>^V��8/�#���.�
�o�� �X��}�K� хz�a��.��Ԕ@�xVw���2��D��!M\,�%��>O��4.���p
R��	�{N5,��s���}v4��ǔ���_���90d�;�:�Xr���RЮ�A�.������/��Il6�l�e���ż5����4g���� 
-��Y�s0e���X* ,
>�8��

��.)�
-�Q��[DȶT5Vt��^&C'����ml��H�F�÷�8��"�// �
�
�l�ӊ
j#�f��40O�y�
j}�ҍ���j�霽��5�
�a
M�����q�6��5Ck)Z3�~E����Gи�'h���e�_
4��9�����H����3�jm�]y��
���\�D�"�,�7]Հ�����W���e]�盧�uV�_2�=�v���-�+��H�y����ew^�=��s�|�@T'@<�B���1�� .�dG����'��eQj�≲+;�ًB��}�r�
����
�n���#C���,���pGF�
�d�n���5���;%�hl�tIT��N����
xe�~w\�=�-�݅,�=5�U��ܼu7�q��T�����(�Dշf��>�
�8��>4���#��wq\���;��~��S�����f�Ǣx�����<�q�� k��PC(!w���i �j�m?!��Ud+JT{�6-��I`x�L�d~���R��Ѽ/�/V
W?�X��&x���s 
-endstream
-endobj
-9909 0 obj <<
-/Type /Page
-/Contents 9910 0 R
-/Resources 9908 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9921 0 R
-/Annots [ 9907 0 R ]
->> endobj
-9907 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9911 0 obj <<
-/D [9909 0 R /XYZ 89 770.89 null]
->> endobj
-9912 0 obj <<
-/D [9909 0 R /XYZ 90 658.004 null]
->> endobj
-9913 0 obj <<
-/D [9909 0 R /XYZ 90 604.315 null]
->> endobj
-9522 0 obj <<
-/D [9909 0 R /XYZ 90 569.645 null]
->> endobj
-9914 0 obj <<
-/D [9909 0 R /XYZ 90 565.161 null]
->> endobj
-9915 0 obj <<
-/D [9909 0 R /XYZ 90 494.431 null]
->> endobj
-9916 0 obj <<
-/D [9909 0 R /XYZ 90 428.786 null]
->> endobj
-9523 0 obj <<
-/D [9909 0 R /XYZ 90 326.051 null]
->> endobj
-9917 0 obj <<
-/D [9909 0 R /XYZ 90 321.568 null]
->> endobj
-9918 0 obj <<
-/D [9909 0 R /XYZ 90 264.949 null]
->> endobj
-9919 0 obj <<
-/D [9909 0 R /XYZ 90 211.26 null]
->> endobj
-9524 0 obj <<
-/D [9909 0 R /XYZ 90 162.236 null]
->> endobj
-9920 0 obj <<
-/D [9909 0 R /XYZ 90 157.753 null]
->> endobj
-9908 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9925 0 obj <<
-/Length 2091      
-/Filter /FlateDecode
->>
-stream
-x��ZK����W�Ha�~�-�׮8���U*����#r$V$j��v3�>
����^�_�	~h �_�
����u6z�N�� #��fϑ���		����:�4�!bR#b$|�
�ϟf�~�}��F�f��#�pDj �������O8J��F���k��8ep]EF��Ɩ�Qao�0�j�0�"
^[�~B�8.�uZ�ń�q��:B����m�Ҿ;�ffpd��������F&�F"��*�&�q [�v�8�R
�Z�����S3E$��w�!��N�D�*ߌ�2�L����&/�"��T����4��$MатHD�0��[H�Cz���Ř�u�\׳�����`����0��#��w
�����u(1��$��@���*�+9D��u�s��1�4z
GBf��%��+SV��c�O8
�WY�K\L�/��4����b�4�
'���
�1��T��b� Ix�-�̈́���|2eB��g;���(�|�9�\�y�g�Y�8��M�6�2+�6�
-�x�(Γ

����&�>"�f�R���IkSB0M�|�Y��U��r��xS���{d
-	N��ȱj,kи�
N]^�R�$�h�HM�
�ش&ϯ�l��o��_�M�n���W���g�}y�U�4��<�Z�^Y�*٬��s��
b�(<M������
�c�!��&�� �(�L	���ڸ�e�����qyF4Er��fpJ)�ٙzl�i�ϲ�FǛ�-�^�iR�@� �y(�τ��p�ǯ��߃�=>��D��
S�Mt*�)
C�@��R�s��u>!b�J{
`
��1~�~a��3�a�nZ6vv����_>��U����+�Ԏ
�T7 Du[ ��!O�������!<�+�@oJԍ?f�*��O^)r@�S3�P
E7U�_�d_#
gÒ��A�e��H���6��i�y�y��T����Wi˵m�Z�,m!���!�Z�
�
-��5M�_�y�s�L�-G�%܀��_Ys	X�H��98�+�P����KP��]���4�Wuyf\����`��`S��W��%J�z��P��>��n��ܾ�u�v3�u:�k�
.Ӹ2P�-�� �E1�
-��
B�+(]&���j�M�y��C���P�K�v�w��
@$�s�
�W3%�FT��J��ȳ|�K͇Ρ�����x�n���z�[I���r�v�_���qU�����S��:N���i��z��ٰ�r��ܾ����9T���v�XX�W��ۜ7/���͇�U=�3we� \�q�sںu�B at l&Po��눡�xA"�Z
hkz����3��1��^mm�(�ߕ�P[K�C�`���I�L���E
-�M�G�b�L cd
���5��=�BE��
-�+�^��{�k��!���
-��=�Z�*�����%��B���L�Z�}�����s���
���]��6n�����&�<�Zo|��:<���!�w<�J��3
J{H�$H����-:j8��o���!HP�Gt�<�
$x mOWR�৪�M�d�}V�hϊYO ����B|������r;�uu���6�V��i��A��7���XE
r�C���
Ȯn at .���(g:�9�V
��C�S��H�*�i�^LA8���V�ϳ�F�8�f�'�]��+�/T����頲u��Uu���<b@η���
��<���

-���ޫ9��ej�D����	WkELc��PP�zƜ�
�� ��H��^��#�Ztp�N����8�3�G�ǔI``j��/z���g4�P�*ie
�4�Cݫ=���*���-zY;}B�L����L�F*�@�J֘�]5E̎
u�Ǒ2����?��!w��+D<;f'��b%r�����\�,�v�����d]�.�g��
	��
�b�u/���e�M���ok}��=��{�v�5,��5�'�v����?�7@�ş'B��u�G�o�Fm������EYo1�C��%��d�C�6\Q��ߝ�9^��# )�]VXV������vQ��A
yL�������<��e{��ik�,����*?��e���fc
-endstream
-endobj
-9924 0 obj <<
-/Type /Page
-/Contents 9925 0 R
-/Resources 9923 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9921 0 R
-/Annots [ 9922 0 R ]
->> endobj
-9922 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9926 0 obj <<
-/D [9924 0 R /XYZ 89 770.89 null]
->> endobj
-9927 0 obj <<
-/D [9924 0 R /XYZ 90 720.814 null]
->> endobj
-9928 0 obj <<
-/D [9924 0 R /XYZ 90 667.125 null]
->> endobj
-9525 0 obj <<
-/D [9924 0 R /XYZ 90 620.5 null]
->> endobj
-9929 0 obj <<
-/D [9924 0 R /XYZ 90 616.017 null]
->> endobj
-9930 0 obj <<
-/D [9924 0 R /XYZ 90 545.286 null]
->> endobj
-9931 0 obj <<
-/D [9924 0 R /XYZ 90 491.597 null]
->> endobj
-9526 0 obj <<
-/D [9924 0 R /XYZ 90 376.906 null]
->> endobj
-9932 0 obj <<
-/D [9924 0 R /XYZ 90 372.423 null]
->> endobj
-9933 0 obj <<
-/D [9924 0 R /XYZ 90 303.849 null]
->> endobj
-9934 0 obj <<
-/D [9924 0 R /XYZ 90 250.16 null]
->> endobj
-9527 0 obj <<
-/D [9924 0 R /XYZ 90 215.49 null]
->> endobj
-9935 0 obj <<
-/D [9924 0 R /XYZ 90 211.007 null]
->> endobj
-9936 0 obj <<
-/D [9924 0 R /XYZ 90 140.276 null]
->> endobj
-9923 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9940 0 obj <<
-/Length 2233      
-/Filter /FlateDecode
->>
-stream
-x�ݛIs����<%dUc_|K:3]3�T9i�if�EK���7%w��}
�"��Z��TN�)��=�m�@�h����ߦ7��+d$���)28R� !�y�KL0$��q|�
��:}�O(�����l��?-�4����/�Ʉ
-
X�������)���l3�@�dDƌ���7�Mo>��G��-���l}��o8���#�����b�:��u}���
.ͨ��
-��^J�@��8m�<R�!��3��g��~���
-�:";S��
�D����k��4ľ�LD�������
�	2B�����H�\Cdq�pDa�K!y=5���iz
!af�(��6g����-7	��t��?�y�T�x]g��ۯ�����&����9�@�m)c
��Y*�nH�A�y�N��mBE�u�f�d������s�"&�.�#�b�� %��������r���
-H�q=(��{���R՘٢WF.
��<s�ϗ�=;��r3ۮ_���q����%��q���"��A��*�dz��.�@�T������_��m�j���
٬�M�DS�8q|TY
-ncjU�J
��_���Q(	!�+](��P LEL�p�'�踬>wwy�A7YW�T� �0�`��������gV6�u�Y)8�Q��3�\�<]B>,��W,p2�B�o��n&Z�֢���狡ތ\C
-���?���fM��g�4�#j�����D�ζ2ʄ)�E��r)��ϻ�l&Rw�m_l/����>���9���m�QHI�R��B#.k��['��X����lj:!1ӱ�̐��2�/k��xB
A�ê	���,C����#�H��MpN��
~i�wm�3�kh�E�#
�=�/(-=݊`H
-PC�B�4�R2��V	�]���@s�i1퉂���]6GɄA��PF̲�jY��f[�H�>$��
-}��-�"������j�>=�.�m��G�<4�U�+�B�煗K<�G�-
Z�!�M'!۞�"]dBk��I#
��Ј���Ñ��V8�2�B
�,����X�#���p�H!dب�F�(� �e
FDF �`�o+�ky5�@O�iv*�� *X
ᬥ��8��xP��"�W��dV�ɉ?���9�(y��A
QEf����>[� ���� 
XBI-s��2a
h�] �(�D�P >)��ғ�A�e��rph�
�B�
U(,�dߊU8��ICv��%
g�
	�*��l0gPg�n���\�F/�xjLc��+����
-T�:_�K�,�:$sO�)|r���~"�oF=�b���	D���|�
t,l+�2�xd� �ѐ��y
�0�WA5
E(!-��eꅄ�Y��'��r
�Q.߯� Rք�
�kd�2
-xU����"{��2
-h`�®f�|�Ne�B�P0
-`��B���D��
U �B�퉅�5Yط��B2,�0���ß՚�m�<�o�N��S�0��M�v�
>V��Y b�
�@�$ ��"�>j�
��:�8�8Y�
4h���Y����
�U���tX��ٹ%�hϽ����Y�o
5�?�������j
u��2�Ģ�������BQ���Bf
j�T�j<5�W�@+��@:PL�,%�ϳ�]�p�Ba4~�@9NT�/����H
���r��e�s��(�g�a�w��fEm:���N���&P9'�%�O|-��N�
�pj��>����hJ
�T�ʼn�hJb>BS
-
�<j'$7>L�!����J���
�G��E�7�8]�I����6Y�T6C��8bZ����������3���ɿS�p��h_�}-�|N������?ʝH�G�pn�����������JZ-PU
P%F��*'����o�q,}�NU�"T���eK�3AU����$�f0��,!"^e}�j�9�r,�O�R��		2�P�=g'[�,8�
��g���
-���w�=�h���2��X���<�56�x����
��4�F'z�"Cy@
-.��w
CJE_�^�
���U:�roS�i'f��]9~?���w�3���
�.N�g�����j�����RU�m�:� ��
tn(T�`�T^y�_���������R��K^�W\!a�g���?�?��ωq���L7�i�ˋ-l_��d��w� l
I�-���LbN��Dէ��rP�@q�~��y����}|]���tkS������*����({7ש�� U�A�7��HI�����
���R���\|Y=X޸�a͢�oa���_K�q
-endstream
-endobj
-9939 0 obj <<
-/Type /Page
-/Contents 9940 0 R
-/Resources 9938 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9921 0 R
-/Annots [ 9937 0 R ]
->> endobj
-9937 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9941 0 obj <<
-/D [9939 0 R /XYZ 89 770.89 null]
->> endobj
-9942 0 obj <<
-/D [9939 0 R /XYZ 90 718.682 null]
->> endobj
-9528 0 obj <<
-/D [9939 0 R /XYZ 90 684.012 null]
->> endobj
-9943 0 obj <<
-/D [9939 0 R /XYZ 90 679.529 null]
->> endobj
-9944 0 obj <<
-/D [9939 0 R /XYZ 90 620.753 null]
->> endobj
-9945 0 obj <<
-/D [9939 0 R /XYZ 90 567.064 null]
->> endobj
-9529 0 obj <<
-/D [9939 0 R /XYZ 90 532.394 null]
->> endobj
-9946 0 obj <<
-/D [9939 0 R /XYZ 90 527.911 null]
->> endobj
-9947 0 obj <<
-/D [9939 0 R /XYZ 90 457.18 null]
->> endobj
-9948 0 obj <<
-/D [9939 0 R /XYZ 90 403.491 null]
->> endobj
-9530 0 obj <<
-/D [9939 0 R /XYZ 90 368.821 null]
->> endobj
-9949 0 obj <<
-/D [9939 0 R /XYZ 90 364.338 null]
->> endobj
-9950 0 obj <<
-/D [9939 0 R /XYZ 90 293.607 null]
->> endobj
-9951 0 obj <<
-/D [9939 0 R /XYZ 90 239.918 null]
->> endobj
-9531 0 obj <<
-/D [9939 0 R /XYZ 90 193.293 null]
->> endobj
-9952 0 obj <<
-/D [9939 0 R /XYZ 90 188.809 null]
->> endobj
-9953 0 obj <<
-/D [9939 0 R /XYZ 90 118.079 null]
->> endobj
-9938 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9960 0 obj <<
-/Length 2213      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~ׯ�S+�T0��5�f�i�n�n���dh�����T6��= ���;6�d:~ E�����g��ގ>��|�Xf��Tfw����		��ه1#|��ݗ�#�.w��s�曻���ћ�я#_�x ���f�ч�q6��_f1���n�2��q���c�[[�#�ž�Ck!`n-�a�3E�Xxs��<+��r���A� _=�?�>��X"A�A����
�`?5&,�ɤ���
���!v`	
�.�����(�r
R�C�/N?|�3
��_����ޖ�	���E9�!�&L�7�b���ڷ
sXd��Qp��z�GD�C��~Rle��wO�zB���j2����������1IB
}�1��BFwc����cb$����8D"�T�8
�y��yUx��%�N
5-W���9o��E�/�`��&.����$�'M�k0�+VRB’6L�=a&zU�
���i��ɦ#lx�4�L��׫ŋ?��z�t5�n��Ɵ����}{�2��g��z�
ō�sv,n�a��9<���fE]?l���?"ơL��U�l��F�
�Kwd��M��/"���P(3�C�&�FoQ7���_�y��J�,Ӕ(
%�2(_�����z2%C�Pp���#�
����j��n�DS�8���P�š���見���C4�Rj J ��;@�ń���S1�L�T �� p�yǀ���
-��T�_no�V%��
T�Lz^���|�n#+n)�C�|;16�
��M��
gq�U'X
���x�$�Xm�� Qj���A�瀡����
�ܦ) 
-��<-���걝��
e܀���E��W%Tq:�]���ڎ\���<IPH�nB?�͓��*��bִ���~�g�=e�
-?��
��ݼ�9�+ t>��?M�
�
�P��J[7����bk��	�ԃ^$)J�k�!C�A(.��5Hk
G� BιtϗEST6�0����O%�&�A�,;��%Gt�S@?��
?�9G
-z���!G1����p�J3‖�����BKi3'�F�c۰��c�X���vh�,n�>�E�\���  H�yʐ��<��5�P�\�q�7���l�`�D����"�y���
-#u8��K�iPy;�^��"O�ɼ�CE2o��B�!n�� �Z��$?Vx���V�y
-b1�@�I���pb�<�b�O�k0�.�Q�C��t��TGX8I��Ȳ�uD���
8YGL��c��`����f at .�
��;�0�<4�	�+<���p�@�!��	�EM+?����
���凅�#?4��5��*//?�c;�a���#��Nꢙ�܈P��RW���7�C����
�	ä/MzSl�÷�i[��=A�8�7�W ��6@�-���0[�N�2E��2�)�i:N�
ѱ'&���T2�
�6�����Np���b�Jc�Jd�V�M�~Q�r���Ch�C�j#�'_�+
%��F�Gv��eD� �% 5
��>
���^z�}��1N/
k;>�vI�f�.;~���!��w3.��ٟ"H�DĀ�J��+��Z�@����K�|�c||
͎��$G4�"���H��M}�WiPKQ�o\�k����Q��gQ����Q�7�-�%�)K�U�G�rnb���҉Jh�Ƥ�N=�NN	
�S����\�A
�@dcI�R��@<HJ�&yn}�b��U��C�
-Vp�q\��
`@��t]ƙ��tٟ�g�%���hvBŤg��7�˹�
��ŏa�~���
��J�8k���v�E",Xr�d�i
bzLǝ�mX�|�ۃ���/1�5_*������v\���o��o�>C��!4u���\�Z{S�Bښ�2-��<�St?�v�
-���ۗ�Ҟ�T"�N�*	
\%2`�%��sQ
P�a4�%
�P[r���
�eFI�d�HJ?�w ���7Zyݾ��A�__���O��FJ��W�"W�\�&�J���/iQN���zʓR�-�5L��ƒ��n��y!M����X��K�7w ���p
���Q�khS���� �oi�0����D��Z�띻/�=텛�.Y��5�mᦀ7��ְ�{�Dܖt;&�Hy��+򯺨�8v�}�:_m�v��v���,��N���]M�@F���V�����쿍\���
	�5ħ�y�����<���A�n�ۛ
�u��ú��uսM��K�[<��h���C�'
-endstream
-endobj
-9959 0 obj <<
-/Type /Page
-/Contents 9960 0 R
-/Resources 9958 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9921 0 R
-/Annots [ 9954 0 R 9955 0 R 9956 0 R 9957 0 R ]
->> endobj
-9954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 570.736 212.124 581.639]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-9955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 409.165 210.103 420.069]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-9956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 305.757 485.603 318.275]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-9957 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9961 0 obj <<
-/D [9959 0 R /XYZ 89 770.89 null]
->> endobj
-9962 0 obj <<
-/D [9959 0 R /XYZ 90 718.682 null]
->> endobj
-9532 0 obj <<
-/D [9959 0 R /XYZ 90 615.947 null]
->> endobj
-9963 0 obj <<
-/D [9959 0 R /XYZ 90 611.464 null]
->> endobj
-9964 0 obj <<
-/D [9959 0 R /XYZ 90 544.892 null]
->> endobj
-9965 0 obj <<
-/D [9959 0 R /XYZ 90 491.203 null]
->> endobj
-9533 0 obj <<
-/D [9959 0 R /XYZ 90 456.533 null]
->> endobj
-9966 0 obj <<
-/D [9959 0 R /XYZ 90 452.05 null]
->> endobj
-9967 0 obj <<
-/D [9959 0 R /XYZ 90 383.321 null]
->> endobj
-9968 0 obj <<
-/D [9959 0 R /XYZ 90 329.632 null]
->> endobj
-9534 0 obj <<
-/D [9959 0 R /XYZ 90 283.007 null]
->> endobj
-9969 0 obj <<
-/D [9959 0 R /XYZ 90 278.524 null]
->> endobj
-9970 0 obj <<
-/D [9959 0 R /XYZ 90 217.616 null]
->> endobj
-9615 0 obj <<
-/D [9959 0 R /XYZ 90 182.946 null]
->> endobj
-9971 0 obj <<
-/D [9959 0 R /XYZ 90 178.463 null]
->> endobj
-9972 0 obj <<
-/D [9959 0 R /XYZ 90 117.555 null]
->> endobj
-9616 0 obj <<
-/D [9959 0 R /XYZ 90 81.969 null]
->> endobj
-9973 0 obj <<
-/D [9959 0 R /XYZ 90 77.486 null]
->> endobj
-9958 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9981 0 obj <<
-/Length 2953      
-/Filter /FlateDecode
->>
-stream
-x��[[o�~ϯ�S+k�}h����N���/��@I�D�-{e��_�CR�E��$栃A�+2uxy.��DcD��v��ǻ
l/���/����� #��|�O
�(n������SF0d:#��Ô�,����S�����������˫:��//����tFξ_䛍������謨�
�$�#b��ǟ.�~��킀.xB��)=�^^|�On��O�33z��-'�2�\L~����rƀ��B![C��]�V
P�j0�rgڮVD3ĩv�6�t��h�k���q��>L�������ՀR��V)4�� �d��߾�Lg�^^ޯװg;�0��&&�"
6Cc
(r���n"�2���Ife1L
-~Z�V�Y�@��$�J�/[7m9�L�8�8��1�`|�i�������.�/,�tƅ̮Wզ��r��)���]p�A#�BJ�n���N�
����
�>�e7 �"nm�$��9
<c�@� ���S?Χ3&Y���»0\�֯����OO�pz0�������!�8�x?��+7~L�UH��Ҽ���!a�G�!���_
��)�'�ͳ���7���{q�Z٬"V
yL�̤���O0�����/�
-�l���[��
�F������Yf�A�9����֬y��Ħc�9��֧n:8]XZF�
-ӂ$
��Ľ}�.�M	������x+}\�-��`t%Zo
aD���1	
!�8$Fۭ#�>�X�}n ��'
QX�VH]L�)>�
s!af�(D�{�i���Ք��!_�7���1���/���۵o;(�P�XRK�
:6��2�ꐩa�`�(
-�xW��Td��w�2��8āL�� �`r$H��:��4�r�M��k~S��l �feu�Z��Z��n	[��9~�?�l�*N���<
-}%&5¾�ž�
^?��<r��Q#�ÿ6
�P�� �@<�`*bz�@�ޔ��TeE�z�]�F���$K� ��i�b�Sa���.�>�� @k��4�������Q��!�k�����B�������ɟ�]L>9ena�f��6{�ߙ��H��_OB�l��	�@�!�
��B�o��M�F9���F+྽*�Ǣ��C7~쓿c�t���l�n:�e�X�f<8t��UYݶ�
�>)�������9�WK��
����.<�� �%eU-�۲ؖǧ��>�
���6�]�M��+V&i}�2
��J��
D�����kx����v�od�+a_`��a��}�߭�!"M
�Βy�qEr��k(O+J
-���
�z�@���
T���M�\/��s�(�&�z0�a�h=�7��N�a� ꥘`�
�`Z[=)���H��$S+HڄS|��@"r�p�ڃp 0�&c�[����ʲ(�ٺ.6E����.*���˜
�
c���p at CD���X�x��l�j��p\�`
�G���h,Q
�V�6�������J
-�k�!7�%��`�C[A��ހ�v����-*���y*E���SpK��
-~��2�}���K��@�9�����iJK;p:2���4�����j�Z�n�l���u���
�eV��i�ʳd
ů6mr>��"�Z����p�$3g�� b�ש�%6)4p��MC
"�5��B^��J,!*���n#|�K	 ��*S��q�n�1�Ȗ����Pؽ2�AAk
������X��rX�p/z����u�}Yy����ڟO�lZ4�
�d�:�,gLB;.Y[�E��]dV�
��=����W���벫 ;Y_a�����,�� �('�kѽ���fsyٯ�hzaS�J2��n�`����7݃ݛ�Z-�*o\ޅ&⏱�A#�uty?����d{�C
^�
�5cw�*c���HB�����x�� O&:���8�
���n���!~�Ç�/�|8Ĺ����nܑ�\w�b�������e�^�����`��KGr�_�:��-�}��&��
�A��Z�4�&�ls���=1w�
�`#�?6���xd,zv�A
�4!D2�/`dL��JW��e��s�$;ҎD*�ҤP��Ё
><
��@'�DנP�]z9ʋ�
��� �!����+�_,")�<S�C�
U�
�^7���՟�|�+���[��0���8@]�ܝ|���
@�0y��H����
�>'RD&�9��J{L�v9�Y���:�y��
o�L�xt�u
��ۗ��iN�js����/w�zUj�ޭ�pGs��V5P�J��h�:�Y�����>�g� �5���Y��r,]�h�s�H��$�IQ7�ܝ��_4�̺�og ������+���@$9B��i_-�D�Aw��S�_� '�
i���/_@�
e�
d1}�!�a5�T�t qȚz'��00��8ӄfv���Ύ2�og�1
�9$L7=a�O����È^����g��?L�&�9��)�$��ߴ
^4�kC
b�^�oC��F mҰ��d����l���ԓd�r���O�F�޾���&b���,�Vm�λ�/�
s��?UFvLK�ղ�HF
�12�Ց�7uY����ϒy��&\��-w�hc��� a�Y_:�<�M�C�N<Oa��*��F�*���6��P�����ϡ2 �F����Is���'s�A�}"'
Ya�x'=�J#�X��N���{=l�r���"���!m���P��aDr|	�!�(E�I�4��f�3�N/(b���%���D���&JHC��'�iH�/�i°[��F��I�����4^����p�Gz��&f�o����5�i�q�$`�ɐ�&'0�P��Qb�l�aGL'���`��4�7�L����B(�SI��rh����IJ�p=j�?|x�/��)��O��Z������zx�vm�z��aߞ��엢sZ��'��_/�mU�o*�6��f}������n����a?�	a�A���"�ͥ;���,�cA��R�n%`1؄�r�#������{�����%��e
��]�Q�0
-endstream
-endobj
-9980 0 obj <<
-/Type /Page
-/Contents 9981 0 R
-/Resources 9979 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9921 0 R
-/Annots [ 9974 0 R 9975 0 R 9976 0 R 9977 0 R 9978 0 R ]
->> endobj
-9974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.334 575.836 240.823 586.74]
-/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
->> endobj
-9975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.275 446.195 293.971 457.099]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-9976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.269 322.224 238.02 333.128]
-/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
->> endobj
-9977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.089 97.512 246.767 108.416]
-/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
->> endobj
-9978 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9982 0 obj <<
-/D [9980 0 R /XYZ 89 770.89 null]
->> endobj
-9983 0 obj <<
-/D [9980 0 R /XYZ 90 657.874 null]
->> endobj
-9617 0 obj <<
-/D [9980 0 R /XYZ 90 623.204 null]
->> endobj
-9984 0 obj <<
-/D [9980 0 R /XYZ 90 618.721 null]
->> endobj
-9985 0 obj <<
-/D [9980 0 R /XYZ 90 528.234 null]
->> endobj
-9618 0 obj <<
-/D [9980 0 R /XYZ 90 493.564 null]
->> endobj
-9986 0 obj <<
-/D [9980 0 R /XYZ 90 489.08 null]
->> endobj
-9987 0 obj <<
-/D [9980 0 R /XYZ 90 416.217 null]
->> endobj
-9619 0 obj <<
-/D [9980 0 R /XYZ 90 381.548 null]
->> endobj
-9988 0 obj <<
-/D [9980 0 R /XYZ 90 377.064 null]
->> endobj
-9989 0 obj <<
-/D [9980 0 R /XYZ 90 294.378 null]
->> endobj
-9990 0 obj <<
-/D [9980 0 R /XYZ 90 215.982 null]
->> endobj
-9620 0 obj <<
-/D [9980 0 R /XYZ 90 168.79 null]
->> endobj
-9991 0 obj <<
-/D [9980 0 R /XYZ 90 164.307 null]
->> endobj
-9979 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-9997 0 obj <<
-/Length 2844      
-/Filter /FlateDecode
->>
-stream
-x��\[�۶~�_����L�p;~pSדԍ�x�'��J���l(ʎ��{p!EH�V"�֝x�@�>
|��8�Op���7WO��X��TR���%)NO���m��
1"ǿ�|�0�I%�eo������߼1Ϯ��\�zE�N�3 ���lu������w	F,���h�p��L�\�p��/�Qa>���l�=�)˜'�0�r���1�i1]eeV�	m�_G�[{8~�
�gG#�AdN�L���5l~V�0Gi"S���Bk�R!̺h7�@8G
-�0F8�.�暈
pW���ps��9�DJ�R�q���*����
- @>�]�;��]?,���ߪZO�L�1�k'1��ȶ�|�v��nw��2/we6���Q
"0�N��
��]t�x�#"H$�A'��TH1�&<Sl��,�
s�}�35�ֻUVL�M�n�.��y��=�nhH��ƄUl�V�@�q`��Сb���l�Y�k;�� k�?��j�S#��X?l�{?c�7%|�.�{�O��= w]�L����׻1�&�e�L�˝9��m�HuC
L
- ED���xc�L!������2;!�P�3H�dгd'���N_��6�R� 
�O�B!V	\ɡE�Zâ�O8���:E�ܝN�"
	]R�d*��l���u�
s@�t����ba�Z,'aO1G���� |��@��@�
�
�)�
��fQl��� YB�t�ߙ�AA /r���?Ȕ��B����@	H�2��v`�����ɨ�/	�N����o�#I!Q���t=wm(oNk��$UȎ�md(�u�r�o���@�9@��׉-�&�T�4��\�ƿ�mV�2�Ii��[�ҚV]y�}4�ȕNu�-���<=���a:�6���z�h	��E�h,֍
�!�VH	��
VLz���	q����|0�R{��t���S�	��n�|���0�\U��jz\{M-�K'���:�]=v�h/��g�nj�6KSa\d��J:�
�J�P.��o
X=�x}���!Sߛo�(�2�d?Ϗ�b���1�b�"�0�kz�9�q�B ��(=

ů{�	�9ف;���W0
�F�Թ�_��%�mL�j��H�}:2��]�џ[L�����rj��;�
�I0Pl�����-@��g[Te�Ȗۏ+���4 ��>g����(�$S�z���i���Y��z�|l�J����F\�-*�݈Oe�V���Mf�2�+>�p%�^BB�h:0)��J�)����4/���u���9�ݩe`#:�^@m�FY��g���0H�L�,a
���i�T
X�@�ڂ�n�����@Z���'��l������mS�-�<s���HSH��c�jXJ���jiM)%Κb�R����kl�
�l�a���j3�-w��y�P
�UyDȶ������i�c�$.�
�;�D<Ս�$���΄@���̈́RH�ʽ�
��ڌE3syL�8�(���Z�1�%aM5Y�:����l%{2�f1���v�
@�E�}�fe
w]d>�Ž�/�����}�gs������f'������`�M��~,����@�9���
H�N`%
�~�lZZ
-8�4U�lX�0�!b��l9H�F?��\DC}z��f��7]�˽)���
����r�L�Q�t�Vv~Fs�ب�f��~��.�T
0�V�{��&�4��<��e��
T�"�Qt��x��
-8�pá4�B]$�
s��|3p�>�\fw�t]�B�U���S�9:�
�F�yh�7�:e�=�n� -ъĄ^l�z
H�q�Lj=�঎��3gh�͟�a�c��N��z_q�se����7z��O�^��`���+w��?�v_�,���1���D�Dcl���T,��ȡ�Myz��8Йv,6�9[I,��ʼn�Eh�?�n��I"yL�Ŷ�P��}�"�uF�He/�q�;�k��`��ayͰ
<(����i���wB��
=z�� �K�i
�*�<�4
Lw�f�s�*KV�j���7�ݨ$i�fƶhq�4o\D��9`�Xb��Z���I;ě�X�3B��
�A����)	�i�`��-���]���`8�g'�9��|���|6-���_�{ڴׂ�Wg��SOX�[Ƴ����	acQ�����e�=q��
��
D	��O}�.UP�&����=cI΢	��Y	��'���*�����}�ҝ� L)�q���
-�Tk$=���`��c��&ܚӌ�M"
<;S���p��\�Ѕ!���$�_F��$t�^+'Q:
-Z�g��${&�${.���^��|ɞK�)�S�>�4�J�I�TI���!�SR��4��W�}��WѾ!�S	�����1�(�H��ѽ��?�h/�H�^���t�����(���Q]��C�nG��=�|@W͟�G���&�
{�
��N�X�T�A���hk�q�^���2�^v��(
u���V�!
-�Y�^���Sf�r
ўR%�T���?͞h�������		QP�
U��K�D��~���~|��}��wcEq��tL�Ŷ��s/%�*ۛ٧��j?Лv
6��?����9��Z-"c[tX�hA15{"ҩ�\��K;��|Q�}��v,󯖢[t��Wp���nŞp\��R쇹ӎ��;�sžwx�QIͩiT�ۢ�96��d{��e�b�~�'�o��U��P��=!�����KEo���������_(��m$��F�+����Z���>���7�|�b��6`lon�&{��5�؟=`�1�}��5�~��O۬��X��'����w�L���d��+�a��/��Ս�d����ߵ�����C
Gbp�(ˇ�'Onw��l}�f�������4Exv^�զ���n�,MO ���ڵ
-endstream
-endobj
-9996 0 obj <<
-/Type /Page
-/Contents 9997 0 R
-/Resources 9995 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 9921 0 R
-/Annots [ 9992 0 R 9993 0 R 9994 0 R ]
->> endobj
-9992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.79 511.28 434.212 524.198]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-9993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.477 226.227 436.256 239.145]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-9994 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-9998 0 obj <<
-/D [9996 0 R /XYZ 89 770.89 null]
->> endobj
-9999 0 obj <<
-/D [9996 0 R /XYZ 90 720.814 null]
->> endobj
-10000 0 obj <<
-/D [9996 0 R /XYZ 90 642.418 null]
->> endobj
-9621 0 obj <<
-/D [9996 0 R /XYZ 90 595.792 null]
->> endobj
-10001 0 obj <<
-/D [9996 0 R /XYZ 90 591.309 null]
->> endobj
-10002 0 obj <<
-/D [9996 0 R /XYZ 90 484.379 null]
->> endobj
-10003 0 obj <<
-/D [9996 0 R /XYZ 90 357.365 null]
->> endobj
-9622 0 obj <<
-/D [9996 0 R /XYZ 90 310.74 null]
->> endobj
-10004 0 obj <<
-/D [9996 0 R /XYZ 90 306.257 null]
->> endobj
-10005 0 obj <<
-/D [9996 0 R /XYZ 90 199.326 null]
->> endobj
-9995 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10012 0 obj <<
-/Length 3120      
-/Filter /FlateDecode
->>
-stream
-x��\[o��~���K[
-�f�~q�i�
���&��%	
ڢe��8��������")R��q���bA]�gΙ���>�4�'4���O���Ո���N>�'�&F:�4��%ߧ��&SF)M�OM�b�ݼ�p�n��
�Y��|��-������b6�rE�?/��6��&�ϋ	�i���A�L���ɏ��z���+�Є��16�[]}�#Mf��	%����J$p]&�^}}EK3�+�
-_�4d�P*��T��|�?����+t �`�0Np�<�DqsT{���Ђ��זI�s���Hvt�i�q�#���u%�m
��s&	�E2�<�o	[��
c�PR�����lw����z"i��-�����ΟV�zvkh78���"��`
��w�B��;u��:n����L�J?�'S%]��G��\��}��q��-�|�Y-��nS���9
#|?v�P�9�%�i�p��d1ai�\�jdu��c�$�aU5([��.���լ����2�l=f��ؾ<Y�Cf
@����I�\
�%O�����]��6��l��]��#��x�]h���j���vJ��ŭ7��"
��cvW�X+Z*p߷X�j��1V
�X"�O���z�Ct](�3�
��y<8�t��I׈|D��2�=O�L7��`�0
�1f��_+�.)��t���J1��V������}'��!����c�����Z*��?�ڴ
���s|���\�/���P/!�� ���%� Rٶ^�=���{fV�X)�̬,�B�g^  6y�B~��N�Z����]y��Ao�9�Q�KUk�γ��
�]L���q���ٌ [...]
-�W���|�����G?�S;ҡ%�%�=�k�^Ԧ��L� P����y�{�-�,�s��)X���#�$�;����Ѯ����u�`��-8a�=#��`<C7՜����y���e��+��̞�O��M��l��	��=K{�K(
6}�m�9<H��� �D:��ZY|'0N�E�x��6��9�l���9��6=����ƈ� 7*���0)��y��75P	#�^܏��C��ȷ��ݮ^�p}�˥D���|q�|��+_~���c[��Rpp&�=��
4�X�>�D
�8�A�e���0�)	��lc�[���x�'S)���
-��b"��!��k-�SD�I�zS��s����:ţ
-1���>m�V�������
���p��3%LNϽ�K􅨂j�Ku<�,�s[lO)�
H2!�����b�Ç#��m���
=><���2�/
�,�B����߶O~�O�J!"�h�R:
��0fx��*�:&�bK
x���D��`�TPHS�
߃�I�I��N?���԰��m TH���yQz��w�UV�eٺ�4o��j䲖�ld^<�^s�?��Ƌ�`; R;
��%4B������ I�+v�A�ٞ�qz�ð��
�������~�q��Tl�P
�{��6M�����@	c���)��H?��x<A��/1�
d���
߲�_�/0���{�p>dN���z��j��-�]�
�kyo���H�U�?=����3�M٨>�g����CgO��
-��]x���"[>�u��_Q���ĥ�1
`�Hy�
�b��<�`���<R;�2jG�dzG!�!J^�"	���&�S�8���AԈ��D��bxچV�C����M���<��
P^�aK�
-��KO�ɒCF�{����D[}P�!C*B�-����
)�'��{?|A��|�G�|���
 kX������%�BA)�⎓ͧ
-�m)v"a��d��W0��`
_!���B��Z��
-3F�XYb�nO
�v�� ���3�	
&�o�ů���� N3_���fg��g������t��r�����N�!)����[tN�Ǽ|��X`R�ytB��֜E�
-�z���-�BR�iG�/s��e��B��]�|U�$
�E#�'�""C��."2 �2��
��
��
-�.��[jk�XT
C��ٳx��z�6fZzD�1N�
_n���H�bv��K
x�^��Qy
5���
c�:��j��+�1._�a�@�fU̶st�
��AAeT
CP����c�ԣ�M=b�'�rk�E*�"*�� (#}����>��4�ETK�ߘ�3���7d� ���9���c2��~���d`Y�?͏��|��Up
-^RǤ2"�p
�A�M,.#����1�B6�e�olƫ��������}"m��	
f��]s��`=��	�	K8
i��(�hRCj�V�DR�	C�jp�V��ո�<�g�LsDkC�9�m���*�}*T��%��d{�.���q���䨺����〞E�~��u

��s��O��Zk��6�9���~���`���CP�%������
DjA4"� �-?s/ړq�v�ɋ��-��U4�PHB	{�b��h�ԋ
T�x�Y 	�D"X#,��s"��,�G���"��iI�B�(��Y$O��+��5�y,O���A�I��#
m�g���H
��@� �kUI��í
 y wrQM��L�.LZ2<���3)H��8��Q
��
Ta�)�����Gw�4�� �c��
�?��$��MO��ޏ�3�e�)�o|ه5݇�;���A�a���x�$�g��9Y-I ���S�m Y"�� 5��6��C�
-���������6��N(�T��j����ic�~֦A����L��0��;� .}�.80�NԨ]�$a���G�a����{p�F���c�
Lk�˼��>��R�-��0�j�m
��/k�lm��^j1�Ӣ���Ԣ�Y��[���O�
g�./�׷�:L�a�,>�b�1�Λ���,�C�0(J#=�'�BEd 硼�579���zZ��VS�Z�U^�)U��[Ci:By��Ë�<"Yr���[�f6������.N��E��C⪵�~�i�~���ߗ<�wۼ��D����#[?U]z�F�qI�b�WF�*�v?M�ͫ�)(��z��+���Ua
-��}����=^�ys�4���9�۬�ن
�R
�k�u�����>\y/C�`\�4eDk^�,�O�}������k�euc�����D�
,�~����ǃ
-endstream
-endobj
-10011 0 obj <<
-/Type /Page
-/Contents 10012 0 R
-/Resources 10010 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10023 0 R
-/Annots [ 10006 0 R 10007 0 R 10008 0 R 10009 0 R ]
->> endobj
-10006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.585 600.444 422.151 613.258]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-10007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.773 375.9 462.606 388.379]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-10008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 137.788 422.924 152.503]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-10009 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10013 0 obj <<
-/D [10011 0 R /XYZ 89 770.89 null]
->> endobj
-10014 0 obj <<
-/D [10011 0 R /XYZ 90 718.682 null]
->> endobj
-9623 0 obj <<
-/D [10011 0 R /XYZ 90 672.057 null]
->> endobj
-10015 0 obj <<
-/D [10011 0 R /XYZ 90 667.574 null]
->> endobj
-10016 0 obj <<
-/D [10011 0 R /XYZ 90 584.554 null]
->> endobj
-10017 0 obj <<
-/D [10011 0 R /XYZ 90 481.848 null]
->> endobj
-9624 0 obj <<
-/D [10011 0 R /XYZ 90 447.178 null]
->> endobj
-10018 0 obj <<
-/D [10011 0 R /XYZ 90 442.695 null]
->> endobj
-10019 0 obj <<
-/D [10011 0 R /XYZ 90 347.72 null]
->> endobj
-10020 0 obj <<
-/D [10011 0 R /XYZ 90 245.015 null]
->> endobj
-9625 0 obj <<
-/D [10011 0 R /XYZ 90 210.345 null]
->> endobj
-10021 0 obj <<
-/D [10011 0 R /XYZ 90 205.862 null]
->> endobj
-10022 0 obj <<
-/D [10011 0 R /XYZ 90 108.178 null]
->> endobj
-10010 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10034 0 obj <<
-/Length 3245      
-/Filter /FlateDecode
->>
-stream
-x��\[s�~���S+�T<�_��C���I�&�9n�f<�E�leI��㸿��+$P�%�M;y�(\,v��B&��������͟4��*�FWw#KFZ�D*|���sj&?\}1��$�*��o��WWo����]�������R�L��>^|��q��I�5�g��q$��b����҅$�]��-q�&����Tr�D
��	�r�T���E�P�7���2�(&G��D
V����:�02�i�{+u�	,F��3�Q���R�e:���!�L�$���c�ϊU^~]ݕ�E��i�N�g7���<[ޗ�fw&�'�-���J7�t��V�����*�g�� �4W�dx�%�H�P���xb�a�� �S��<]�
����cw�:Q�ꔀ3���v���Z⊺{<��7��/J
��b����V�g�yyQ�M:�t-B|�y��M��j=�n���ּ�Z���	5�{,�eQ�yΊ��j��M(�<-�G]ϳ�S�.�hr�r8u��
�J�!W��ɬ�d��.|� [...]
e	��B�(�fS�//��D ��E6��Z�^+{Q��N����h �=P�EB��3���1�6�y���>h�e��8�s�c��K�i�і��$J��m�)��+E7��c�{;2`U�~yzQQ��N�HD�Ԝ���['���d:��ħ~�>�w$�RM�}k&�ByBhۘ��Xk�6�C���:��BT�gy�c�����4["��gEv�����&jGꖮ_�^��YlȌ$��Δ�N����ʏ�zv��Nêv-C)V��alS��js(�p���Z�� q���Xϑ�?���*ќ�v�l JsL�dJ	�Q\�W����߻o��q���PI��Y�WY�ٴ���JQ�ȉ�h�~��x��P:~yH�yD��K�
BƜ�U�—�M��15���wy���V:�ՅSL��C���)�.������
gg�
�g�KL�3�c  �9K�%0�K��m7T�}Mo���2�'�9��S�V�;�\6���anEƕ�tC� �X�+�9*"����/�e:˯�:�B[R�H���� [...]
-�߼�}��Qз��r��<]̊ʁt&E��4\��A�}�O��L��m;��v
-���w�c�Z���}�߀�[��༌��Ђ��(יִno�(|2ӓ��~ۀ{�WM"eClf���6J5�99�]��c
�'�v�I�W	nȀ��U�kw<S����oNA�����y�W?o,En�圿��LB#	�P��۬��$�O	8�v��
�
SN�����ųǴHs�Pl�
�f�F T�dnd
.�o�͐_
TI�ti�0��Mɂ
��~�zD7t=�
-B��Yq۪f0��)����VEa�pP{ɣJ��	�1���%��RY

�J��1��Y�n#��Ju�>q�u�9�Jխ�<�����is`����Zb	;���8*$M�'G��'��>�������D
-i����K�1�pa�,�
-$n�ғ���\W�����oGO��~�5�C.�S��4�ݧe��F��b�
��A��\�D9`i�#��(�ȭ��4:�8����@O+����4�ki���4z��w��(�K|�c=G��Ҩ�(�j�4�wK���/��3�ԋs{Ng�
-d��
5;�4���P CMyC"�� ��&�FD����
�*�.f�M�_�Yү�6"�w�%|)t*�ꭵ!?�.��W�l��C�G�첾DD�y|U�I3�Wq_�*�i�I)D;VE��ئa�u��
�S������8�`�6A��&-��ts�N
Qo	�D�0Ҩ���	
�������֜�G!vO�		9<gf�&ښA]�� �sf&]
F����K�;"���r4kf�y��H��Y��Hkּg�1��
h��;$,t2n���b�!xy�P�#���տ� R�aٳd
�[���S
!��|��CG�\�҉�Z�{�)
jv$߲|
㲌�*D�s>[���o�C(‰NB�H�|
���T���`ݷ˸{
ls�!-"/�6�aA��
�r��]D�)��;L?-�/\�,��4���h1~Y��߹
�l^<����}J7�yv�:�%��

��뛴>k�
���T3Э&	�i
-�ɑ�+�
����d�;Ϻr���΅�V����
�B(�
qڌ��Y ��gٲ���)��H�G��n5�sjg�v;��
U�ę�͐�)�e1U�x]ƂObq�
�k�Jb�/f^�`���,��K�1ASN�W*خvQiQ�qg�K�P�����
���ƒ�q��h���~�XEe����b


�80�.��@,1��N�o�V
nVp�11�{�&�?����� &a���Mh�l9�>f��b�&��2\�U�ȟ�X�n"yoҷ�"m��
󦹮����w��&�:5i�;6��RJ}�aC����G7��+�ݱ�$5$��ͦ.�R�>�C��E��&�K��e�oځ�Є���Є�w>�~(�����D+��2M�z�ݍ����o�=��
���?��M���U����H�
aw�w����;��N�G��N�]?� R
Y�Z�G�u����lB0,	DFbX�ڎ��9*�A�U��Vd��i�Ryg�n��愭{
-����+k�f�p��B]k�:���Ph�ݖ7i���A��E�qA���=T��f�`�
�A�c��?�g��jW�ҿjw�۝�h�x|��P�Ωp�
0�y̺�m�������u�������-#X=�Þj����~x�N?��m��c��Hpӟ$ċ?^��{Z3��{���T7�|��G\AX+n
-y�V`
� ����XUw���,/��I��N$R���_f˧���C(�aޖG�;�2Hk��CZG�R�6j���S�>XG��	�CQ�/߼�y�v��C���e��fcw5O}\�~�7�y+��o��?
-endstream
-endobj
-10033 0 obj <<
-/Type /Page
-/Contents 10034 0 R
-/Resources 10032 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10023 0 R
-/Annots [ 10024 0 R 10025 0 R 10026 0 R 10027 0 R 10031 0 R ]
->> endobj
-10024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 526.284 425.662 540.999]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-10025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 299.975 322.446 310.879]
-/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
->> endobj
-10026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 164.049 116.998 174.953]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-10027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 122.853 243.45 136.801]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10031 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10035 0 obj <<
-/D [10033 0 R /XYZ 89 770.89 null]
->> endobj
-10036 0 obj <<
-/D [10033 0 R /XYZ 90 645.466 null]
->> endobj
-9626 0 obj <<
-/D [10033 0 R /XYZ 90 598.841 null]
->> endobj
-10037 0 obj <<
-/D [10033 0 R /XYZ 90 594.358 null]
->> endobj
-10038 0 obj <<
-/D [10033 0 R /XYZ 90 496.674 null]
->> endobj
-10039 0 obj <<
-/D [10033 0 R /XYZ 90 393.969 null]
->> endobj
-9627 0 obj <<
-/D [10033 0 R /XYZ 90 347.343 null]
->> endobj
-10040 0 obj <<
-/D [10033 0 R /XYZ 90 342.86 null]
->> endobj
-10041 0 obj <<
-/D [10033 0 R /XYZ 90 281.952 null]
->> endobj
-9628 0 obj <<
-/D [10033 0 R /XYZ 90 247.282 null]
->> endobj
-10042 0 obj <<
-/D [10033 0 R /XYZ 90 242.799 null]
->> endobj
-10043 0 obj <<
-/D [10033 0 R /XYZ 90 148.158 null]
->> endobj
-10032 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R /F7 795 0 R /F8 794 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10050 0 obj <<
-/Length 3169      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_�����h�/���
'N��7i3Nf��h��D�$����
\H���j�^����w�s �`���՟o�^�U�@GZ�~
4
-$��>�E
O�!�L0
-�b��L
-���*Y�ݻtV������"]L�����:.KW�!����$�' IP,B�����o�^�^}� 

-��GR��Շ_Q���oQ��{�h0B�s
������ 
M	����8�H��'��%FX�@(�S2Q at h�qO��lݞl�i�4	$"�d��xn'��@g�� P�
j� D���p���"��.���͟��!�O��w�d|N����0�辩��g�.[$
��fUb$-��7{��v�(�r�g�4[:YU���E�I�2ͳ�L
k
-���ǫ}P7K��}o��":=�
�_:�G�g�!��C��
�RJ�QMu�0	�T�ԭɼ�۞�g�1�
7yY����dJ�
-����)ms���<H
 S��9�*bh�ˇ�J6�d�;IK��z������|̽�y���U:K�i�U�O���;
��O�o�\s����
��t���8��ؿ� �`�n{3g.Pȡ�����r�yW�gfFLi�J����i��M��<<ϲ.]�� �&c����mQq5�n�ؖg&����:1~�
,����D
���Z*ä\���Y��,͇����K���m��S-��&q�h���U81�����v�0O�6)�
-��5 �T U�-4��-�X��
-]ķ���4OX�f�}�7� 9/���.]����c���1bIG1F�#�`2���'m��3�)Vоg�)����b���,3|�Β�a[��Y��,��
9��j�i
--f��������̷���=�a��>����
S�q��l�⬸ۉ�N�Sg:��z��+'��z7[�7�,���l�E������D_�_�����ݥ+y�J@"�lL��Xb#�8ф7v�ƕ�@`Y�������y���u>y�ői����0���lx�Ο��A��F��L��x����k-��� q/�H���]&� E�.-�[��Z\_�لA����]li�����'�E
-�1�	����@)��<1ЮoC:"�;��U�[�!�`��S����H*U;E�F
/ˀ{ẍ�!���{����g�iV��u⾳$J�����6|��F��O�18�46����H��
|h��C��/��R�G#������p�"�f�>�ő�3��Q�zj
՛t�"��S&��7��t4�
s��R�
#=�N�	I��P��|���B���cB	�*3�����*�H�.�_��!�;ҍ`�-Kp,
WY���U6���[�7���a!!��t}5�W$��[�M��r�װ+�P��{����Q!x�6�R����egP8̜�u�L����0o�`_

xY'��(R�.a@|8�9K�YKon��$� ��'��=�i�6؏w�˶�S%�z����e���'��=���Ͷ�h���)���4�R�id+�
��q�e��0�]2ޘ'�s>LcE"�x�`�?�@C���+
iʬ(�=�o
�s�8t��C�@l
��
��
-.�>���gׯ�6�ȷ��PD"�FQ��>+hO�Ҭ�a��ʹ
�S���n� Ɂ>�t�>�/b��Ә��LzR
�-a���̲!��7�6Y:�d�ws��t$x��^�
����S�ƲmxDŒ��ۋ�l�ȸ/�a�
-�4�اbM/�����߾�y���oov�;���2�oؽdG��~ t݃�����~']��$+؁�)G�
v@
�d-N2���"��u��u�J�"մ��}�y�y��4�������iOi�ِ/�0 �=�u�>A~鑀���S�(�`��'�K�!5�����C�ь斔S0s�8�^='_�L��
�n�OK�fe/���y�ݸ�]Y�\�M���!�7iMz��ܴ��sq
G RP5&2/�x�3�
��2
q�t�x��(��8.�s��/���L���(*��DO�'3
�����*s��0�Wc�
-T�Q���(�1���B����u:}��Pi�y�:R�7��6
-�\g�$vG�C4`����D�&�{�TLD�h���� 1�І�
1�l
~l��ߡ&fI�B�`�5o�o//P쉗:8#�$��(�0��I���yO�̓%^�P#Ɣ
�2��e*[��U�=�}�.QXncs%���;k���}�ܽ��B��a
X�h�&��٨����Okf���̐
-l}�s��%ZfH���ܝ��D� ��YTsS�<�>O�AF���6
-�j��ҡQ0�3
-h叹Y�R2�NJ�5�i����3�x�_Z��t�t|
�3�.���آ
-<�ӣKth�W�ң�18���8�*
�����Q
s�\
Ǒ�7�1�y��G�
;!� F1�� F�4���
b$
�΍a�CÀ��5a��.����|H����chC)��P
m��E�
�t;6�D�Q:6G�
w:v��

<�'H��}��A��!������<^�u���B�Wr ����2�h� �SJyDy���In�܃�І�n�|�s>%#D������

����,
#wŽ��_�5�7�j��=�@o�yS	��7J\���wks�Ts��x�]�\�{�N�rhp���`n
^�V���O�l`��Y=N����}7����C!ֵ����ii;	�
' �.�ܵ�'e�ͱ��/E	� 
�y1it��wasE��C�85�0��Q�B�cD�y:
�/Nq͹��;�0�7Ʋ���k�l��$Iͪ��k!
[� �
-<��i��_���.���`D�nLt�,Ђ[A=�W
��Ԉ)��sg��Y:
b���KC3���ۃ���S�s"EXMp��b�[7��}j���� ���
xp���fV
��0�����
-H�{U�~EaokóaAn�ǵ�C��U���f�]?��L'/y�cH�E�%[�
\9_$�>dM�,��K
�8+,�tq���l�SNj����X`��������
-�`>�b2�Z�ds��~,��t���ٮ�\
���܏%L%��[�)�%~��qJ�ԥo�M�*ؤ�x�jWU��~�b�[�I����
R��8t��t����&/�z��Mll2�Ï9 at W~&`2?]�������_�l��_�/�nh�
&x�Z�"s�
-endstream
-endobj
-10049 0 obj <<
-/Type /Page
-/Contents 10050 0 R
-/Resources 10048 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10023 0 R
-/Annots [ 10028 0 R 10029 0 R 10030 0 R 10044 0 R 10045 0 R 10046 0 R 10047 0 R ]
->> endobj
-10028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.931 661.895 224.361 674.228]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) >>
->> endobj
-10029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.346 650.971 363.642 663.489]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-10030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.135 637.586 244.565 649.92]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) >>
->> endobj
-10044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 561.018 485.603 573.536]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.39 157.004 343.198 167.908]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-10046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 79.544 362.353 91.878]
-/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
->> endobj
-10047 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10051 0 obj <<
-/D [10049 0 R /XYZ 89 770.89 null]
->> endobj
-10052 0 obj <<
-/D [10049 0 R /XYZ 90 584.893 null]
->> endobj
-9629 0 obj <<
-/D [10049 0 R /XYZ 90 470.203 null]
->> endobj
-10053 0 obj <<
-/D [10049 0 R /XYZ 90 465.72 null]
->> endobj
-10054 0 obj <<
-/D [10049 0 R /XYZ 90 397.146 null]
->> endobj
-9630 0 obj <<
-/D [10049 0 R /XYZ 90 362.476 null]
->> endobj
-10055 0 obj <<
-/D [10049 0 R /XYZ 90 357.993 null]
->> endobj
-10056 0 obj <<
-/D [10049 0 R /XYZ 90 275.306 null]
->> endobj
-9691 0 obj <<
-/D [10049 0 R /XYZ 90 216.328 null]
->> endobj
-10057 0 obj <<
-/D [10049 0 R /XYZ 90 211.844 null]
->> endobj
-10058 0 obj <<
-/D [10049 0 R /XYZ 90 129.158 null]
->> endobj
-10048 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10068 0 obj <<
-/Length 2496      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~ׯ�S#�TX\��N���$u
'�<9�
W�J�H�LRYo}.�I���$m���8� ��G,^��q7��J�@!%��
�*�<̓�cF�䧻o&"D��^���߾�{����m��n�aD�'
+�#����O8���o����G�h
���u�}7�K}E��[}qAf�0R�0���s
���Y�-�MV@"��#��c�8����E�3h���2a3T T�l߀\hM��|O,�+����D��$DV�	ɓ�%�nN[}�3-F�;�9E9��M�I�ǿƫt�s�O�
/v�$+�~
��C�d�u�0
P �?S�BD�
��h�!�
-Q֙��2�L(?f�)�x�>���|E�V��"&HeG?b�l#�ۍ���6�2-l�. �B\7��y�
"P$e��GJ�B�uVH�X���� {���l���ez�J��fq�`j�h�Q�"�
��U2�]��.`��̺� ��h2%�
Lh8ޤsXmF�o�S���CoJ"�$�R!("x,�Q5�CP$�

-�A�v�oVB�O�d��@����I(u�����}
a��no_�)8��~J�$��M~��Q
-�G} b09JI�c:O�4[�
�`=��,����;r\�"�Z�#�x2
� ��κ�Ζ+$ �3^�t��ޚ#�h��/�!��(������=�@��f�L#M�=
�E ���u�2�g<�:W`}�&O������D��8����u�tA�8k礓�y�)� �E c�~J��ل��h\n�|8D�P����i.ڍ;h��Ui�7����
�J�����z�/��~�j�7
�:���:W
aZ��}R>&I�3G�!�#��$�*�����U}W�밨݄y,����W�
�Α�z�]&�uSĎ+�S�)FJi�TST���x��I��扌�#�9y(���d�Y�@����]�Y_.C�� ��d������z�]8�R<1�DGшHA��A���E
kTpW.c�;3��GpU��zW��A at .P��{�r��/�T{T�;�٤`g�'M�!U��ۉ��Hr�
-�G� 4y�p���s0߈Oݮ�i�~P5p�}
�w��_��_��(^�C�������>m7i�

<�q9!㍽�]�:
0O���'����� ��|5��g��}%��7�6��	HW��r�˄`H
���"�ar�ԡ2�]Q���2q�X�ݮ�,c�C�Sw�"�{*��cf?��)Y�O�a2[f�]�t�}]��Ǎ$��4��%>���+��j�CJ#��k�	d�*��+��y
��1 ��Q;>'ZQ;{3���iO�3�c���7�i�L��v��y��	�r'�{��
�C����������;�١^f�.�
fg�Z!
-����E�u�4�
-��<D��

�V����B�Y�
-!g2+X�bV$��f@
�S>F�y�P�B:BLs$�B�$��8��#Ċɥ��1?�C˃�����7��)�b���U]
%V�!b�n!�0a�#�4@�<a�+�`ϥ�]
L���N~LM���'�)���b��Ԙ�"�%��=o\�6s��S���0O�I6�G�dn�e:[�W{���/fyz?����j��m����H��֚j#g\&{]�i����$�KH%X�*���X%�`a�Ǣ��D��2.a>I%&0�D<�T�Co����.^����a�}���Z�f��P�P2AZ��Jס�W�6��]BI�?Jo�q[ ����k/��<B�*�FE�P��@�^k�O �8
*8[�Pj���P����(��i�(�M�BF�3�ϔ���.߭�&$#�̯Y^#�$�DC�D8+JIs�Rx�RҶ�"A�������\N�G> N)�]=��
-J���%���(|`a��)�],�ʶ�6��clH�%�[�Do��2���U���!���V(�BH`+��t 4�ZX3jr�Q�X�f�"2|Xi� {
�޹�!n��\�1lT���}Yo���
��#
�OR��9[}�((�:���?���]�o�(�{��*p>���\��z��(Gt&
O���*oo:5y��Qt��v1�5=�@���8�
�gm�4�rĪp�I�=l�Y���
�^��/��w7j������Em��Qy��r��* w�@��b�V��617��*j��P�H�!��e�p�grc�H�߉
�5+���.��򄃥+���xI�
z�J�Bş��|���#��^2����/R�
�h8Ȓ*�+��c��'��:
�J��qW�g��b��T�
$
U}�H�v�相Wuцt��]<��Z����g���A��'/K,����e�ѯpm������쥻{�t�ȈOӺX��v��JW��m⑈+s��`�DJj~lߛ�>����k�s�qS�7mV���hZX�
��g�k�u�o߾�7?I�ń������.vy�VX��–� l5c�@��%�>Z\�԰�52	E
�uJ�,������nQ$�A�rX�5��BX�4݃�®?Vo��!���ڔ<��
��&�
-endstream
-endobj
-10067 0 obj <<
-/Type /Page
-/Contents 10068 0 R
-/Resources 10066 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10023 0 R
-/Annots [ 10059 0 R 10060 0 R 10061 0 R 10062 0 R 10063 0 R 10064 0 R 10065 0 R ]
->> endobj
-10059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.778 624.689 336.884 635.593]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-10060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 549.286 362.353 561.62]
-/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
->> endobj
-10061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 426.909 334.351 437.813]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-10062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 331.825 362.353 344.158]
-/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
->> endobj
-10063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.711 209.447 344.79 220.351]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-10064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 119.634 362.353 131.967]
-/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
->> endobj
-10065 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10069 0 obj <<
-/D [10067 0 R /XYZ 89 770.89 null]
->> endobj
-10070 0 obj <<
-/D [10067 0 R /XYZ 90 718.682 null]
->> endobj
-9692 0 obj <<
-/D [10067 0 R /XYZ 90 684.012 null]
->> endobj
-10071 0 obj <<
-/D [10067 0 R /XYZ 90 679.529 null]
->> endobj
-10072 0 obj <<
-/D [10067 0 R /XYZ 90 598.9 null]
->> endobj
-10073 0 obj <<
-/D [10067 0 R /XYZ 90 520.902 null]
->> endobj
-9693 0 obj <<
-/D [10067 0 R /XYZ 90 486.232 null]
->> endobj
-10074 0 obj <<
-/D [10067 0 R /XYZ 90 481.749 null]
->> endobj
-10075 0 obj <<
-/D [10067 0 R /XYZ 90 381.438 null]
->> endobj
-10076 0 obj <<
-/D [10067 0 R /XYZ 90 303.441 null]
->> endobj
-9694 0 obj <<
-/D [10067 0 R /XYZ 90 268.771 null]
->> endobj
-10077 0 obj <<
-/D [10067 0 R /XYZ 90 264.287 null]
->> endobj
-10078 0 obj <<
-/D [10067 0 R /XYZ 90 181.601 null]
->> endobj
-10066 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10088 0 obj <<
-/Length 2668      
-/Filter /FlateDecode
->>
-stream
-x��[[s�6~����.5�B�;�}�v�L��N�q�Ҏ��h�S�tH*���
 $EP�uC&�ټX

�|�����Uo��ys��I�� "��TH��m|q�8��qE��¤�$��f$
-���C�,�۷�]�����o�l9�
�߭����_�����8L�E
-��"��~��������Wt�l��H��bs���(X�埂QOf�&`���:x�߫�1��D���h��;�b���SG����E�XgE^��D�-aW�
�)	ĉ|Q{���=�_Z&�JB1D��_�
�1R��b��C����Hs
3D`�!e������#c�"��H�f�����Y>cQ�)Yg�ۤ�Q���4��yM��
2�j(� "CK)e
����C)D�c��CY��r�4ٽ������cQ�u1��E�N��?	���S?d���*@��ݤ�
��<""F�@�LH��
,P,e;g��$B֡��2��/38�
-�r��b����:E/�8�
-��hOz��%����|9�i�
�X�
��"��aaa�5e�ᛎ��!���8�p� �:U���1�v�*�nF	�ơ�%��j> @���5��a������&���*�1&�]�NAX����i��I]�#�sXV/�s
�˧�>�e�X���U`�����`�
-P4d�ܢ�G�9D�pɹnL?cp�$m�0Ň�48u�h�N����a�����
vqԆDGМj���y;lX�Ѝ0�N�wE�*�� �}�\��fD>'���(�P�Ԅ��.tos���r$����gwI	1�t������?Ƣ�D��?��};�
x ��59v��Ar��>:�¢ 7i��q��sb�'�*�F��ʴڮk;.��\u�e�~�)7)�$��*�Q_�����*�`&�J�M��-�<�W�!�,�����%s���~&몰�4�/ʅ��Y���� ��Lt8kԔ�Y>r�PN�))�~Hj+�K�(\
H��Zk3c����z�Xdy�(T��,�1���{͂�b�ɇC�%
@
S= q�yL�K6i��

(��Ni
-x̐��4��
�MC�%`��3���R�S$8��^
9�QX#�R

�`�
-���-RW]�j�o�T_hB�.xo�m�w	U�ǻ�!�M�$�[�i���	A�,��1.�������q|�O�DR��
��[�ŷ����!�I�@$ERH'�
��Ej�#���M�+[g���E��D�U�Ժh�f�A�7ɮ�E��q�;��i�@�S�G���hAG9���eӭ��p�m�
ô+Ȏ��EZ�c���k]�K
�GK����
 ���3
v�4����|�J1���
-�4S�/�0ȷ��V��5\K4id띀��C�i^�ﺡ ���+�F�;<=�
�<>���
�'L���tӟ�����N�A�h��t�4EV�.
���6��1:ʽ�=�ig �:M��u��Ө]
a$0�N�2�)Q����i��]SL|R�=��P�LS@����v}Z�r�S��v
K�������|�c�
S��}�̃䮾U�!�K��]&��
-z-Naz)����ؑ�.4Z
��.����TrW�؇.��UL��
��RA�/*�I�]:v`Ѱ��M2�P�*���
bW�8H���F�iS*�)%�,��Ӓ��r�~5r���Q|�\%��O��%W��T�� W�'4o�h�+��\��lXG�r�z��J�š+5C���
��(�
LZ4bzT�QZ^vN����� �r�P-Q.}D�P����W�L�$�)���.��B$e�'eJ
=�2�P��澯��=ez�O�Q�a��ķo��L�2�'gJ�V�R�ę^��8��z�I��F	���'�<
���WΔB�H9�3�L�q����ƙ~U������ͼ>�8_�i�)�OF�s���
&��*_@�	:D��(��iO�%�)�����g��Җ3
�z&g�X��3�Ǚ���~"��"O��Kd
�L	�ж�gJG^�%�8Ss#Nr�
����
�F,�y%�RW��4Y�d8B�C��P�F @:�T��"
!JaD,�,
; �`��۪��%3O2}�-%�����1XTi�1/�*�����P 6�7��>�J9�����6�~~LǨM�e�:m3�>-]��r��ܯ�D&����h�>^/�Հ�tB1�
���t<�S���&р�
�Mk��
̆V�F�X/�lJ��8+�vra�W�V>�ǣ
�+�xXD�Ϸ�K4���I$=�x�c�DB�X^��
��8
-:��k{$��-��,�G�S�k?}�����狳�K<����n���b�����_@��)� |�����nj'��LY�{)��`����x��Z���~�M�r�x����`�Ϻ��r�k�i���'�:��T�O&��C7�Qb�8~9#%�3"o3"�w	��I38��d>��H�U3�y�H�,�J3a.�z
-x�}��%t
-l�K�n�	�i��1㫭���[��m'FB�
�jO�=r=�
;=�N
�����
D6��o
�c{z�Ϻ[�Co!@��(WU<He�޽��_������_�N�m�<y�i1VV��2\�(�d�@ߧ-Ei��#hG?[��T��!��I�C]?^�zu�]UJ���x��	BvU�}[�m�����#�y
-��6�Ï~���f'`3?�FXJbf����ͅW?nh�6xwZ�E;G�
-endstream
-endobj
-10087 0 obj <<
-/Type /Page
-/Contents 10088 0 R
-/Resources 10086 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10023 0 R
-/Annots [ 10079 0 R 10080 0 R 10081 0 R 10082 0 R 10083 0 R 10084 0 R 10085 0 R ]
->> endobj
-10079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.628 624.689 360.629 635.593]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-10080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 534.875 362.353 547.209]
-/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
->> endobj
-10081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.97 412.498 252.675 423.402]
-/A << /S /GoTo /D (index_Grid_Widening) >>
->> endobj
-10082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 322.684 362.353 335.018]
-/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
->> endobj
-10083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 200.307 112.027 211.211]
-/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
->> endobj
-10084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 93.467 379.76 105.801]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
->> endobj
-10085 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10089 0 obj <<
-/D [10087 0 R /XYZ 89 770.89 null]
->> endobj
-10090 0 obj <<
-/D [10087 0 R /XYZ 90 718.682 null]
->> endobj
-9695 0 obj <<
-/D [10087 0 R /XYZ 90 684.012 null]
->> endobj
-10091 0 obj <<
-/D [10087 0 R /XYZ 90 679.529 null]
->> endobj
-10092 0 obj <<
-/D [10087 0 R /XYZ 90 596.843 null]
->> endobj
-10093 0 obj <<
-/D [10087 0 R /XYZ 90 506.491 null]
->> endobj
-9696 0 obj <<
-/D [10087 0 R /XYZ 90 471.821 null]
->> endobj
-10094 0 obj <<
-/D [10087 0 R /XYZ 90 467.338 null]
->> endobj
-10095 0 obj <<
-/D [10087 0 R /XYZ 90 384.652 null]
->> endobj
-10096 0 obj <<
-/D [10087 0 R /XYZ 90 294.3 null]
->> endobj
-9697 0 obj <<
-/D [10087 0 R /XYZ 90 259.63 null]
->> endobj
-10097 0 obj <<
-/D [10087 0 R /XYZ 90 255.147 null]
->> endobj
-10098 0 obj <<
-/D [10087 0 R /XYZ 90 184.416 null]
->> endobj
-10099 0 obj <<
-/D [10087 0 R /XYZ 90 130.727 null]
->> endobj
-10086 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10110 0 obj <<
-/Length 2723      
-/Filter /FlateDecode
->>
-stream
-x��[[w��~ׯ�S
���������O7ul5/N�DB$�в��3{�@�ἤ��bvfv.���8X8xs�����
bK*�� �A�c$$<-��!�t���w�
-�X�Wf��������W��.����T��^|�K�.���*x0���
����ŏ�ˋ�=^A��5���lN9	�tFE��pX�'
7�̶i^eE^��l���n݌z]T�v��(?g��y�ڹ�l�N�ڎf�2�~�Ҫ�3��H�*��7����l�v߸o�LuZf��K�Y
�A�X+��#L�"L�z��tk�;{]��ܥ��0$�e^4����
n>k֒2Kn7v�7-)����,��iZ$n%�=�G)���E7���L��~W�c�fyU' 
-��Q����q�em��aޕ�֎N��V��x����A����R��d%ß�5��׌v&S�i�����SzBV/�$q�:*��FHp
�;��|i�M��V�� +�v��
mU��Č�2�v��η�Go��4��9Q1R���ݫ�t5�ACTh��r~�3&��T�`<�
-ᨙ&�4ҥ�"�h���fs"#m
L��A��
�S��d�W@�
�o	s����
W 0
�Yc[
#��'w�C�
5!�"����xc�H)�X"�T0����Iu��:�@�
�S4H{��H��
�'B1'A�&B E<۹2�#�<����"~�u$X|	��8FرB01�1P�:�P
`�s�h�N?%�6�"���aO$e����X�mN2���(�i22�(�-g�f�~��>��e9��q6	
�*�i����m����
-��ހ�_]%�Y.GX�a����!Ȑ�g����
4 'Q H�[����KG
>��
�)���Q~�h��.�d�X���/M2�_���새��Dk�H�����>m�5�F��}���)�wB�A���1M�i��UC�r�x�����\!�C�%؅�o���#∮�C ��ǞG���M���Ljp�!x�
w]�	&e�;���7E�f�Emo��m��fnȀ�.%�
�5��=K�����ȴ�H�����cB_�MP�(T�6�w���/��>���z�K4�]�_�"d�8Py(ƏQ���xG���y�<"@���aMIa�L&<��b��]&�[ہ:{2��i��
�C��r
�u )!(MhG/�8��
� ��Yf^}Y��u�s��)��9�`���7��z�N��i��+}=n���D	\I���lO�
`
G�L������
��N��� �I�U��I�rƛ���&PЖ�lB�@���1�׀ ��y>Ő��/���,LNѩ��0����t�fD�xҤ���>c�&� }/��������,��"�Un�M~ [...]
E�L˙�s_�B�A>EX��+p�!�b1)��
-4MN�,',�;Ϩ�jL�]�O(_S��|Y��׭��Lθr'�0�;�yש��
[1�[���*f��9֔
;ԩ���3������c?�>~��
�1MQ@:��oϢy����C��h��Hr�� �<���V)�T����P>g'b$J'aA�$Jz,���2���?��$� EDS��t�[J��C'�`ۺ9?ŲP�Ť��W��n8|F�A|��mZ�iӶ�p�!�G���]40
-֠z��s�Ϻ1��#�j
�a$�:�q�O���7�vu�ES)�ru�.2�A�9��w��C����0��9����38��S2����
F!JwU�i��8A�ڼ�~����F�����df�,�c�=���z�A���O`$�q�Q�����/��L��"wݨ�#����S�9�i�/��a��RNy��r��;Կ.�d�"�p �N
-f�M��@�g!
�/)BE�9ѿx��S�@�!�'�lyA�E�j�Q�V�L(gS��}Y1���
	2��zE#���
�6fLYO;
�y�/��=�=:��wY��/( ��
��J�h����RSj#%�L4w�)�{�
���iL
�g�{������}"Ϭ|^lF�
(���,Ρ9i<�R����?�#K��LT��` �Լ�ޛ��7n��_[�� b{rs�7�l�K��jo��A�$�E�����[{��*-���X.��;���k�nSki�r3��@X��l��6�l���e�{[�w�P������������ݪJ�Ob����E�A�5�w[�i�0�5=
-4��[�
=�iN
-endstream
-endobj
-10109 0 obj <<
-/Type /Page
-/Contents 10110 0 R
-/Resources 10108 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10023 0 R
-/Annots [ 10100 0 R 10101 0 R 10102 0 R 10103 0 R 10104 0 R 10105 0 R 10107 0 R ]
->> endobj
-10100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 586.033 112.027 596.937]
-/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
->> endobj
-10101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 479.193 379.76 491.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
->> endobj
-10102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.334 339.083 236.659 349.986]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-10103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 283.799 335.755 295.75]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
->> endobj
-10104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 185.871 243.45 199.818]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 133.611 485.603 146.129]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10107 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10111 0 obj <<
-/D [10109 0 R /XYZ 89 770.89 null]
->> endobj
-9698 0 obj <<
-/D [10109 0 R /XYZ 90 645.357 null]
->> endobj
-10112 0 obj <<
-/D [10109 0 R /XYZ 90 640.874 null]
->> endobj
-10113 0 obj <<
-/D [10109 0 R /XYZ 90 570.143 null]
->> endobj
-10114 0 obj <<
-/D [10109 0 R /XYZ 90 516.454 null]
->> endobj
-9699 0 obj <<
-/D [10109 0 R /XYZ 90 386.451 null]
->> endobj
-10115 0 obj <<
-/D [10109 0 R /XYZ 90 381.968 null]
->> endobj
-10116 0 obj <<
-/D [10109 0 R /XYZ 90 321.06 null]
->> endobj
-9700 0 obj <<
-/D [10109 0 R /XYZ 90 274.435 null]
->> endobj
-10117 0 obj <<
-/D [10109 0 R /XYZ 90 269.951 null]
->> endobj
-10118 0 obj <<
-/D [10109 0 R /XYZ 90 211.176 null]
->> endobj
-10119 0 obj <<
-/D [10109 0 R /XYZ 90 157.487 null]
->> endobj
-9701 0 obj <<
-/D [10109 0 R /XYZ 90 81.969 null]
->> endobj
-10120 0 obj <<
-/D [10109 0 R /XYZ 90 77.486 null]
->> endobj
-10108 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F32 764 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10129 0 obj <<
-/Length 3087      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���S*�DX\Ip��C�l�Kg��/i�CK��D"J�]��~ ��@ٱ�ɋ���;��p5��Q���5C�����ͻT�2�%<�]of��2#*��z�ӜQ��b�(���
F�y��o�/8�����b��7?��M�<�}�MS�K����m~8��bS4
��E�*@),�
.?_w����oW
��ss+���jw���t���������}i7�\�w;���_W4X�]
h��a�06X
D��>.��זg�`y�2�;�iN2n�	��c��c�%��@b�����悱���)�+��]��5ԫ�K=o���mS��S��)7�A�\_����ܗw�0��i%'�2���hj��W��&�h~ɋ��Bɯ�]Q
ʺ:8#�/U�01rK��LA:�����/��
2�__r�	��-1U����*�B?E�[I��d�dJ��5�S3��������
ǎ�@*P��2�6��Y=D�y�
�Ƃ� �DN��~����SQ�b~�/ܠ�';���6�� [...]
-�2��1I�݀���$��<���mT
�
A�1�0d$����`_V
	�̷��q@�����)lJ!�J�ኗ\)�C(��
-!	K�sK
L�ӌp�����
 X�Ĥ�D�
-!F$l�T7�8u
��v�\�)�]S�G�8� ZT~T��
{���u���
-�D�IE�s 3��
���\ �G�>�]%
�����q�n��O��J#��d�G�6�<����xh �Ri'�D�_JR�;�!�W����|Fj�f��|�
eB(�(�{����
!
�T��w���E�`e"�����
r�{c�lg�m!!��"kZJFkzF�-� |��� ��p瀅H�����|H�f��^�� �����y%��.3-Hh����DEQ�A��g\�|x)U2_����|�_ 21�
�)^��0�-%*��-,;_�Rp	<���|�� ]z~��9��i�����(�btq%|!Hs��Vu�v���no��T�x�7V�b3���TK��f��ocq�C
�A�&�;{1����]V�+&$Q,��{�>z�S�7!�^*�IJ����F��}S�ek�
-[Ǚn��"Q�Xa�U�JWu�]
-$tv
3�Ր��\
�!#½��~P����ȊY�RV�'�r�
u
4����f0	L�eS�-K�K()%<IC%y���
-��䨮~���lϛ�غ�SHQ���S*�r҃7 �ӝ�u2���(�F��
���Q�h������Rd
)��.3�}4�� 9�ɸӟ�2�}��Ԟ2UDqv�7������m�)��=yA�
�$
�	4
w�:-.�굜F�
|�ɵ7�x�i[�*7�}8�����>��[���:���"|�ʧ�$M|A�{)�S�j0��H1]e�L��+��X{�ި����]��݃G%�@��+��H��z�u�}�eо���0� 
��&���`��cK�Ġ�Bʕ {I(w˼���(�Y&����
~|�Y��z���Icmzg��T���$)���M�LJ�7� ���#C�P�CZڗi��t:ϫ��TɌ�#�1h�=r���i���y����\aŞ����wC/we$Q��|����yylg��oMZ��6tQq��1��Z���*�F�d�D�n��TNIFRډ�rN�Ǹ��Q]�i���Yd��c����������eT�6u��o���[��5�AV�2N1j��ýV��.�oL��s���v
-^**��������)�
6�Z�����ӽ�
|F�E4�+;�Ox�I�2��%�b�B??�p{�.�|SV�tw���~�{ع��f�����/��32�������F����9x�y���B�_q\��J �D��O� �p�e`�޹���l��6�j�jU�Ao�M�W-��a4��%�y~���
g\���:�:N�&�Ӗ�
��;��n7D����"鑬C�MD� �Y�G��A&G�O��d�V�I�6i߫�5֞r��Y~d��1�D���>|�v� �A5�TTv-��_�}!���lD[]�sL��^�B&'�	B5@\��+nO)!��^`ˤ��
+�
��7:��@���;�^��P�ur ��jkiv�)��Ҷ�Z�f]@��+�q at _��X��<�q-[
7Ah)ل5(MҾ������҃���Pq{@�Ų'�18��zE:.6��P�qi/�	1\��
���{
��Ez�^}��MJ��:�b[ژ6�� s�
ڄ��}�qO�F��j�}C��l����kQ����P�k�u�
��[vO��[��>l�n�]&�� �q��t��ͼA���v��ng��u�M�~����?���֕�P��
|Pt�wX5�m�|��D�\2�Qy���0rX��i՘>W'}�Hn�?
q�ME��|�[���:���Sg0F��n�~ݩ3��R[J]���cgL_���hr�+
;��-"G���KpcO��7S�$Ԝ]dV)�$�C��9L����.j�g�q�L��n�ǿd��`��
�\$�><%�i�dXk|n��j.;�����V}����.�H"x�=_٣�ZӜ�У��Hݿ���W��?} cU7 �}]b
 [...]
-ib)����ɽ����
y�L.��ٚ�!nD+���g혼x�
-E��-�����q5TL����U���I��"��#-�����P4Z(5o��ϼz�;d&�h��=0B�N�`t�c�sl��3?�޵�zV��q�P��|<�߾ys�pw(�;��w�Q��*}�d�ˢ�m���k����n�
�әe$I�����G�9�Lm˫ۇ���ƛowb����?Ր
�
-endstream
-endobj
-10128 0 obj <<
-/Type /Page
-/Contents 10129 0 R
-/Resources 10127 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10137 0 R
-/Annots [ 10106 0 R 10131 0 R 10121 0 R 10122 0 R 10123 0 R 10124 0 R 10125 0 R 10126 0 R ]
->> endobj
-10106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.861 673.894 513.996 684.798]
-/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
->> endobj
-10131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 662.786 153.263 672.46]
-/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
->> endobj
-10121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.376 550.77 385.519 561.674]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-10122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 334.61 174.682 342.136]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.953 271.465 216.525 278.992]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.27 271.465 291.843 278.992]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 181.335 239.856 192.239]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-10126 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10130 0 obj <<
-/D [10128 0 R /XYZ 89 770.89 null]
->> endobj
-10132 0 obj <<
-/D [10128 0 R /XYZ 90 644.763 null]
->> endobj
-9702 0 obj <<
-/D [10128 0 R /XYZ 90 610.093 null]
->> endobj
-10133 0 obj <<
-/D [10128 0 R /XYZ 90 605.61 null]
->> endobj
-10134 0 obj <<
-/D [10128 0 R /XYZ 90 487.675 null]
->> endobj
-9703 0 obj <<
-/D [10128 0 R /XYZ 244.439 184.489 null]
->> endobj
-10135 0 obj <<
-/D [10128 0 R /XYZ 90 177.849 null]
->> endobj
-10136 0 obj <<
-/D [10128 0 R /XYZ 90 109.274 null]
->> endobj
-10127 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10146 0 obj <<
-/Length 3237      
-/Filter /FlateDecode
->>
-stream
-x��[�r�}�WL�����`q�E�S��^�
��x�a�ڢ4���
)������ �

p.�l���u
����n��nft���_/�^�
-�,&q�����,��P�D�Z�����_/��� ",�+s�o?�p��o��/�~;cxDg�
-P$�fW������
-���Q"�h�`^��$8�go��yF]�#�J��C�!d�F1�T�B&HD�U��W�]�ye��5�
A��<
���N��E�3���2��,�%ؾ
r�6#�R#�
G6�7i�3I8V�R����9C�a�*�����T���<���O���]R.D8��ߤym�kj?8��dq҉b:0 >���� �5�`h��Ƅ
g��e��j��/�\�yv�gS��IND�Z?�
ka��&�C�;�"�������UQ�iuW�+{]����*��Vp{Y\7oݦ���S��.J{]�%W)ٽJ�P�967�
Z$
�I]�#ȴ.RB�{�\��mI�C�5˛�ԣ�|�ُ?�O;�~��R͂H���s��7��,R͋�@���V�sbw9Z'�^�W�qb!�����j��7
���s�ǝ#��ș�F�n
���|���

�{�^�˫�j޴n�{���
 �V�_ApLW&�/Ø�2�-��ҡ���z}�>��������|��̸�:1�PE�ǜP<Z�Q
�

-=O��)�b���t����!b�0�+�mR�
�D��6�J�/�8ꌴ��*_�	H���m�
1�
-����|�����Ca�Y�G��
-�����r��շ
YP�ɸ��*��ž�q2�ߣ�1�i7�&�ʳ@����q9R�4+�޻����PK�GRโ�G�3 #�
-j��*)	"9Rm$T���س��
���S�b�P50���Ū;l�E��-�����mc��|em�o�zF���,N���+�Y^<�#��#�;��3T�|�<� ��R
<��b�`h
������=��^u���L�6�1z� ?�zJ�Gq��}~ކ�a
9J"��0(��&�F�d�96d KEa�����R�_뫤�$�Y/� ��Q{��9T�;���op"�B#�����^ ��c���tUzT�:���*p
%W���������ߔH���b��(�D���ʉ�����
V���d�	S�a
���Tg��Q��,������+�
��E
"Yf��:�޽I�8������:T�
���G�Wꍨ^x�_
-�'�F�<T�7� j��Wi�Ӕ�U�c7�?AoO��^5T�T?4�(��� t��a��7�v(�����|���OݕdH�
7���v�	��
-�,j���J�I��.����pLmK�J�j75�"�����%�$[	����5O�+�7�L���Վ�!��v�
,��Le�x$桫�Eg�i�lv2��a$l�c�T\�ya5.�֩
�p���k�k��lO�� ��X�i��H�[�&|j�քi������,	 (�� �u�i��>K�����`��$l��
�ޠ2�T1x_�N�`
-
I�a�Q�CO?˓�{��8�b��6��F�&�wii~J2⧮��A"��)m���k��P��O�t��D9m��#�4�-u�,���a��2����n�r�
-��'빜p�m�v4ѧUk�y:�ڨo�8&�3�k �+�������A�\f�U���谌glP��U^_�b��p�ʋ�H#��S{ˀn4ŝ	�
��Җm8b��Nrp ���$���.VN�A����\z)@̾\W
C9���L
�5����y����qPA��.6
z�(wK<
H�.�[ЖV�;
-��X|�}u��kY�1���
-"CvD��k;��hK�A	p���W�f����5U�棊�haB_����w�p��l]l;��:=��0Ӭ�h���$\81 ��ĦUSٖal�����Q� �6�}�z.�����2X:O,��Fh��6o�N
����'k{�-R��)D
T�ئ�l|0�h��`8
�e��P2i�"�\�e3P�ãC���t7

�! q$�!�$�;�`wߧ#�&2BDGՙ�2ݝ�ۄ�qM��KԷ� T���Qm��%:�d�)AZ�%s̡֔���&H1����*�� SaJ��h�v��c��N�A,M}���=/g�)T�"�G�T���:9�Rp~
-E�K�*
E��Uj7�V�c�m�����
�٣��,_�������c�Q��&���Oi}_�^�|%��2k�kfMHXuU��כ�]ayH���Q�-z ��ǐ\�|� &��������<
H�w��
-)[@���m1(���K�z�P�/��7�P$
-�!�[��.x��@�ֽӻ�}d��y���
A�{C;��2�̥�&+�d|��,�M'&���2'?��N��W��US���WŕI�mk����W��
KZ�5�~Q�e�l��O��ֹZ�v���
��?��w`��řV�
-��yzH(Jopms�
���_S-4� ��E�����rOی���M�SBw��~��û�ޖvw���[d�J�x_�ݷ�v��j������2�
3�l�P��%j�A^����3(󒗅1�x
m���S��U/�M7�h�\չ�(Dͯ�pS_� %]	�
0�:m��/"j�uUc�I#5��Տ����?�}ӵ.�S?�c�}�	 U +r�d�!�0���}�i�j?�+M�!y3%����M�g��spY=Vu���&����i7�d~�6Ch��<��ȁ�1�k."t�,��G^/��6-�*}�h�^O(�5d�E�݅�u/�MSj�gwI�`�nW=��'M���: 穏܂�mԫ4�{H�Dg�b`
-?��������w��D0��#p$Y��\��7�3����%
Ӣ�R,�%�>�3��(�p�7%ј�eQ��(�9LϘu��
-�L�$��?�D{��yZ�'��gٞ8���E#�Q�4b{�Oٓ��x1�77������Q���
%m���)ɦ9�q�M[�t����:ݙ&�ϐ��j�?�$��
���f�����C��s�u>�*&UZ���G]7Z��?
-��
yg S�H���-Q�KW>�i�x�D
t����ݰ�����o���s�pxn
��in��v#f_֋[B޲�6 "�7���F� �޼�~������_UZ�I��f=�����\d˂�����4
4��7i[s�z������w��>�&5������_������!0�m��
���p��?զh=)�qs�|l0�Jl�� 0M-
-endstream
-endobj
-10145 0 obj <<
-/Type /Page
-/Contents 10146 0 R
-/Resources 10144 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10137 0 R
-/Annots [ 10138 0 R 10139 0 R 10140 0 R 10141 0 R 10152 0 R 10142 0 R 10143 0 R ]
->> endobj
-10138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 669.068 379.76 681.402]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
->> endobj
-10139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 626.97 182.164 637.874]
-/A << /S /GoTo /D (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) >>
->> endobj
-10140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 529.604 243.45 543.552]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 453.036 535.938 465.554]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 439.651 226.824 451.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 379.69 362.844 390.757]
-/A << /S /GoTo /D (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) >>
->> endobj
-10143 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10147 0 obj <<
-/D [10145 0 R /XYZ 89 770.89 null]
->> endobj
-10148 0 obj <<
-/D [10145 0 R /XYZ 90 718.682 null]
->> endobj
-9704 0 obj <<
-/D [10145 0 R /XYZ 400.69 630.124 null]
->> endobj
-10149 0 obj <<
-/D [10145 0 R /XYZ 90 623.484 null]
->> endobj
-10150 0 obj <<
-/D [10145 0 R /XYZ 90 554.909 null]
->> endobj
-10151 0 obj <<
-/D [10145 0 R /XYZ 90 476.912 null]
->> endobj
-9752 0 obj <<
-/D [10145 0 R /XYZ 487.765 382.843 null]
->> endobj
-10153 0 obj <<
-/D [10145 0 R /XYZ 90 376.203 null]
->> endobj
-10154 0 obj <<
-/D [10145 0 R /XYZ 90 296.035 null]
->> endobj
-9753 0 obj <<
-/D [10145 0 R /XYZ 90 271.263 null]
->> endobj
-10155 0 obj <<
-/D [10145 0 R /XYZ 90 271.263 null]
->> endobj
-9754 0 obj <<
-/D [10145 0 R /XYZ 199.738 190.181 null]
->> endobj
-10156 0 obj <<
-/D [10145 0 R /XYZ 90 183.541 null]
->> endobj
-9755 0 obj <<
-/D [10145 0 R /XYZ 90 143.809 null]
->> endobj
-10157 0 obj <<
-/D [10145 0 R /XYZ 90 139.326 null]
->> endobj
-9756 0 obj <<
-/D [10145 0 R /XYZ 498.315 84.126 null]
->> endobj
-10158 0 obj <<
-/D [10145 0 R /XYZ 90 77.486 null]
->> endobj
-10144 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F8 794 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10178 0 obj <<
-/Length 1768      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~���0�����U��m��6]�vH��eiQ�2��%W�����P$e�Q
�q;
�`���s��w���
�?�GX������4d^�����܋��� �fޅO0t<!c�lL�����٘b�Ȯ/լ�?�J�e\^?/���U��{�i�j<��'Y\Uf�V�U9&�Wyo	a0fT�?��
=;}
�
{�H"P(�d9����L�
X$��f����o��ដ�j�G_5B!��[�E���T��J�q]���d��c��.?)�֢nY�������Z����	@)
-w�
����%� r+�~<�	h�D��&��� �g]l!,�[ v"Vї�����Re���] 
��m!Tb���"�C��[U�˼8�1�e{D]��Y�۔���G��d��̠ȳk3�W7�
Q���_"
H�@o;`� �p۠;6)m�@$*|H
��fj>�����
��q�(��o>��p�W_����"D#�m5Z����V��ʫ��'i��U\��LuT<
O�N�;]�ʾN�JU�ݴ��K�)�\ �d��È����ŭ��=5C&l{P���p�����8�����@����c��/��8�~�Ό˪1!�U��8�"0 =��������فj�m��� ��~���
��0��(,(̋�����dC9��b*�٦,���b�� �"�
-�"Wi�0S��d�'�F>ΤH%�e2���hY�2tyyt��"!�����8�p��A�iv�0X
�`M��
��!!Ö79���q����%LgcF���P7��K��CH at a
 	�I`��x"}K6$ic�C�
-�� �<�=�
9�(.
��C_��D���	��&[q`;�h��
e^�ܼ�I�;I��)�2o�h�
Z�u��I�t��6�]Y
ᣁ�Ɩnp#��P���L9$�R'�¨� ?�匷P�I��}�@2h���=*q"N(d��nyQ�)U�
°������L$�n��hzS���7D
�7
-nQ:� ?3��X/u�YO�c�3Un|�Y�ªڋ��"`
l#�l=����Ĥ�k������u�h�>�����D�Յ�խ{����T��uV��j� �A #���m�����R��ãE�EƱqz�����߯!��
-�-Xf�w�!
Z�R��]��eخ@w�/�M�u��םp�f������cu3
�Bm���ц-2<�{�: ����9
� ֳ�SuhC��H�;<�
���3�i�t���<�Z�mQ}��
���᷵�.H|�1
�u[�
�@v>a���
�
B7��liZ��pH�{�m�UZ_�����D2��
û�n����՚���<Uu�f��ܐ�I�����Z��B��	�ɭ�p+�̜�-���jl$%�D3�B��y�m`¸O~�����x���W7�E��LWv��
c���7���ݧ�
<9�V���2��,���y�,�2ݷ*+U���9��
FQ�����܇�C;!�p��d+3�>����ÆD|;l��Km6=�fӿS��8ɼY(0Ei�L���;qs+j8K�~MhD��y�R��:����[�ٯ�$q�ɔ���R���������z��=
"�-(8;{eT��A[�R��q�vM��
��U[�j�2���r��?yn�ۨix;�(8��
 /�zu|t4]/*V �߄��
�s�-��,ܿ
�
&��rW$Ύ��,��
��I��M�_gܼtډ�K�=-��oZ��
���
-endstream
-endobj
-10177 0 obj <<
-/Type /Page
-/Contents 10178 0 R
-/Resources 10176 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10137 0 R
-/Annots [ 10159 0 R 10160 0 R 10161 0 R 10162 0 R 10163 0 R 10164 0 R 10165 0 R 10166 0 R 10167 0 R 10168 0 R 10169 0 R 10170 0 R 10171 0 R 10172 0 R 10173 0 R 10174 0 R 10175 0 R ]
->> endobj
-10159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.635 517.427 249.889 528.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-10160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 444.598 177.053 455.502]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) >>
->> endobj
-10161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.989 429.884 217.919 439.789]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-10162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 374.73 180.649 385.26]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_ac03d43b46ab7f9e5d0ea3c46a5eab7b3) >>
->> endobj
-10163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 346.275 180.649 357.179]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_acf34edb23c376600051bbc563e4122c4) >>
->> endobj
-10164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.986 346.275 228.24 357.179]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-10165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 318.193 180.649 329.097]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f) >>
->> endobj
-10166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.986 318.193 274.725 329.097]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-10167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 290.485 188.398 301.015]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_adf9fc5ac7e45f36bc03af31b98b31a72) >>
->> endobj
-10168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 262.029 163.215 272.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) >>
->> endobj
-10169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.552 262.029 257.291 272.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-10170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 233.948 163.215 244.851]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_a3b727ab728f8758af9fb217eca9d791a) >>
->> endobj
-10171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.552 233.948 210.806 244.851]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-10172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.635 162.115 249.889 173.019]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-10173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 76.49 173.456 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
->> endobj
-10174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.43 76.49 253.684 87.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-10175 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10179 0 obj <<
-/D [10177 0 R /XYZ 89 770.89 null]
->> endobj
-10180 0 obj <<
-/D [10177 0 R /XYZ 90 664.738 null]
->> endobj
-10181 0 obj <<
-/D [10177 0 R /XYZ 90 642.691 null]
->> endobj
-1845 0 obj <<
-/D [10177 0 R /XYZ 90 569.148 null]
->> endobj
-342 0 obj <<
-/D [10177 0 R /XYZ 90 562.431 null]
->> endobj
-10182 0 obj <<
-/D [10177 0 R /XYZ 90 463.6 null]
->> endobj
-10183 0 obj <<
-/D [10177 0 R /XYZ 90 393.443 null]
->> endobj
-10184 0 obj <<
-/D [10177 0 R /XYZ 90 393.443 null]
->> endobj
-10185 0 obj <<
-/D [10177 0 R /XYZ 90 363.628 null]
->> endobj
-10186 0 obj <<
-/D [10177 0 R /XYZ 90 335.546 null]
->> endobj
-10187 0 obj <<
-/D [10177 0 R /XYZ 90 307.464 null]
->> endobj
-10188 0 obj <<
-/D [10177 0 R /XYZ 90 251.3 null]
->> endobj
-10189 0 obj <<
-/D [10177 0 R /XYZ 90 205.45 null]
->> endobj
-10176 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10232 0 obj <<
-/Length 1843      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�F~ׯ �@���\8�i�i��u�Oia��D�V"J��[��pfxE˱Pl
=���3�9�;�bo�a������d^�"A�7��Eؓa�������gT?O��P�Df��/x?�x?�P�]LF�G^a�X
I�MW��?co���0b���̠�R�K����vX0���,�
2��FF"�" q�h0&c��^��<S��׻t�M��޽ʦ��N��yT��_
�i(iK>"n�$�Z�W
�8_���I���J��
Z��HE�
��%2Dt-DIe0]���2 Ŀ_�Y���Qu�HDe�er��`h�ߟ��ɓY!�R'A 1R"j#xY�����1��[}~>�V�8��A?a��qȅ?��Ͷ �!9!
��J2j܀�Z����")�,�<�#��!!"*G��ȈVULbW0+j���yc�"�!��&�Ba�}�}�1���Ou wY�55ܠ�X��
cA菩@X����]�n�B*�4lZ[!�#o
���Ry���T��rOib߷
ah9�����=)��
�� �ٓ a/� ����^�t��sk���w
�]h'�e�� LU��
?�!5��d���JWbެ��R;�oq��^�ϻx�f�Yɋy���9=�����萻��H��7FZ�7k
\
(�
���>�7�Zs
�`�,�<�z�J�m*�XR/㍻�
�cw3ש�A����g�r�.�-�Y�r_
K}�"5��B� #G�a�F)o��8�P$��%Z,�����qNMH�RYh�X�
���P����8�HEr(�2ĕ�K�

֯���#�
�`>

-�ڍ�c�
ddk������፥P�ڊ��ipy�?�׹N�z0oe�:�e�%���$�.` ��+]Ec
���u��Ph_�^
`�Y�I:]�f��S�@eHFU���GV+ל��a
j/�}}��
sD�;	�S }I��-�r�L�i'A>_�C��e�*4��
��Nw+��`O>w4�6#
-�~����U�աgP�:T�4���!
�Z��^�l�In����S�i�iF
��|i����H����Nﲯ��S�3	.<��ᩗo�_t���}x�Ջ��.&׏������>�� ��.����[P
-�Wӎ�
�E!q)ƈ�����j�ͷ�L�\�eK�
-F�BQ�X&��"�
1��
-���"[e=��n޾�
O
.y	�.�o�;Vk-+�D��
c
��q�Ң��h����0��%6_E���o����E���E�,q(C�]СP�
-Vأw[���_
�]���v��M>$�nr�0��-F�m��d��U.m���"�~6�%�:�.���:��b{�za"�꣯�e�Yi<%L�
��nc�R D�`J=�|��&| <���}��搠g�=�^c����~�R
Oa��l}_n�A�|7�*�]�]���S�%/�)y���\ۿ
-�	J�_�%U��l4&�o`�ߔ����_��6
�5��q��G@�hƶP��
�??j4$��X+C��.�e�W��,���	��'��a�ek;��?�=��/���šRPa���GZ�щv  $0�+�ձx�~k��m,�F����즚-
�db�̳�@	,�g�þ v"����5��-�
�o��fO�W?-�A��|��4�
cg�:[v��
���5']��@-<�ò:������)(��
�5�11��G���g�hb"�g�5���r�{p�vżW�ōA޸h�0�ԍ S�(m�\\]]ڋot�πs�y�]�V�
-��3��.�[�`�`��A�n��~�`?2G�
<<D��#�b�]��������9�f�}�ԓ���[Bu��r�P���U�y ��`
-endstream
-endobj
-10231 0 obj <<
-/Type /Page
-/Contents 10232 0 R
-/Resources 10230 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10137 0 R
-/Annots [ 10191 0 R 10192 0 R 10193 0 R 10194 0 R 10195 0 R 10196 0 R 10197 0 R 10198 0 R 10199 0 R 10200 0 R 10201 0 R 10202 0 R 10203 0 R 10204 0 R 10205 0 R 10206 0 R 10207 0 R 10208 0 R 10209 0 R 10210 0 R 10211 0 R 10212 0 R 10213 0 R 10214 0 R 10215 0 R 10216 0 R 10217 0 R 10218 0 R 10219 0 R 10220 0 R 10221 0 R 10222 0 R 10223 0 R 10229 0 R ]
->> endobj
-10191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 434.374 160.455 443.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_acb1fb1a16ca8e051a815ae73b178dd62) >>
->> endobj
-10192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.794 417.601 266.426 427.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 404.232 160.207 415.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) >>
->> endobj
-10194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.977 404.232 192.655 415.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66ae9cf46c5e08ead7689807e1c8ba30642) >>
->> endobj
-10195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.643 404.232 257.969 415.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a4ac3b90df83c2e43249ccfa2702640de) >>
->> endobj
-10196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.958 404.232 292.28 415.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a25b86c6f0633416506503de2bf693876) >>
->> endobj
-10197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 352.236 201.399 363.14]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.376 352.236 268.642 363.14]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4c001b3abe941fc38c182ed23c7bca2b) >>
->> endobj
-10199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 297.024 178.976 307.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.791 297.024 244.549 307.928]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.984 297.024 344.961 307.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 268.939 178.976 279.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ab1db3272b7beca7b1d9d17f23d22ecbd) >>
->> endobj
-10203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.313 268.939 271.378 279.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 255.892 178.976 266.796]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_add0d04eab672e924694d77cc48921add) >>
->> endobj
-10205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.313 255.892 271.378 266.796]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.59 255.892 351.348 266.796]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 227.807 178.976 238.711]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a271a32761c20049948570491e6b5b9dd) >>
->> endobj
-10208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.313 227.807 271.378 238.711]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.59 227.807 355.233 238.711]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 214.761 178.976 225.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a7718a50034230b311e3f3cc35d7709e9) >>
->> endobj
-10211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.313 214.761 271.378 225.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.59 214.761 355.233 225.664]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.322 214.761 465.08 225.664]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 187.049 186.725 197.579]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a00017ad58d66a7948b0355b3e02c750b) >>
->> endobj
-10215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 158.59 178.976 169.494]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.715 158.59 230.522 169.494]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a1177f236d8c66c01bbb43b37ff90bc7d) >>
->> endobj
-10217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.859 158.59 322.925 169.494]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 130.504 175.668 141.408]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 130.504 234.596 141.408]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_abaa6c80abf60b23dd19db6cc042719b0) >>
->> endobj
-10220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 102.419 208.395 113.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) >>
->> endobj
-10221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 102.419 273.968 113.323]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 179.554 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 74.333 250.666 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a60d9658ef91fbd3a1b0064253246f36b) >>
->> endobj
-10229 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10233 0 obj <<
-/D [10231 0 R /XYZ 89 770.89 null]
->> endobj
-10234 0 obj <<
-/D [10231 0 R /XYZ 90 721.073 null]
->> endobj
-10190 0 obj <<
-/D [10231 0 R /XYZ 90 704.158 null]
->> endobj
-10235 0 obj <<
-/D [10231 0 R /XYZ 90 704.158 null]
->> endobj
-1846 0 obj <<
-/D [10231 0 R /XYZ 90 556.877 null]
->> endobj
-346 0 obj <<
-/D [10231 0 R /XYZ 90 550.158 null]
->> endobj
-10236 0 obj <<
-/D [10231 0 R /XYZ 90 449.408 null]
->> endobj
-10237 0 obj <<
-/D [10231 0 R /XYZ 90 316.113 null]
->> endobj
-10238 0 obj <<
-/D [10231 0 R /XYZ 90 316.113 null]
->> endobj
-10239 0 obj <<
-/D [10231 0 R /XYZ 90 272.924 null]
->> endobj
-10240 0 obj <<
-/D [10231 0 R /XYZ 90 231.792 null]
->> endobj
-10241 0 obj <<
-/D [10231 0 R /XYZ 90 204.03 null]
->> endobj
-10242 0 obj <<
-/D [10231 0 R /XYZ 90 177.67 null]
->> endobj
-10243 0 obj <<
-/D [10231 0 R /XYZ 90 147.859 null]
->> endobj
-10244 0 obj <<
-/D [10231 0 R /XYZ 90 119.773 null]
->> endobj
-10245 0 obj <<
-/D [10231 0 R /XYZ 90 91.688 null]
->> endobj
-10230 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F32 764 0 R /F38 3426 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10293 0 obj <<
-/Length 1940      
-/Filter /FlateDecode
->>
-stream
-x��Zmo����_�O����BrI#(Ц� w)��n�!w hjm��K����ξ�i��>Z)zA�����3�<3;3�عs��~�������9!
-}�;׷N�
���ᯥ�yN0���`��
��q�����y�m�Ų����MW����U��ދBTq]V�3����,��<~��Z�`.�D���q6g�/~��a���ٗ��C�
⁓��?cg	_��`���yԃrǥ
>3�j���
-
?��!sP�w����'bt�$�uUX!�{a
�i.
-������
�� �VI���5薕2-�V������A���A2��O33��5�E>Hh���4�zjP�<6��6a�4��� =����sF(
-1��S���r>�y �6]��՝��
�u���:3
&S�~�
�9Qg�ެ����0����󨩽�$��Կ��4��Fuz ����
�9:��,��w)X�E����c�2=)ŭrK�#MRQ�r�Pr���(�-��k	C�fH\,G'���
��y�3D����MYf�ѩD^.�Ă��фI�����J�c��F{0J����
-*�Y��, -W"I�r
�+�����e>x�v ��VP[�����v�jD�̱W����sa2&��e
�-S��8D�����QZŽJ��ݾ>X��S^����s�7�|�d�X��Q�!ϊ(Ah�r� EmC��"�7$Ǔ�1!-�I��}z[�$�/|o~ ����o��)]+D���m�D�,Z(��t���X�Rl<�zʓN��c#	�ՑS'X��P
G��;L*�,-Ne��0�kcM]�Ř}����S��jK7���<�c@�
`�)p����h�C�t>�8cSe��*��\Ԣz
O�)u0�<�YL�"QTV�@��/�<��ګ2-�o�f�Uf�jaW��7 _�)�
��Ղ�X�ٵF�uԡ'��;ի���UDu�����@F��1���^�$�i^#���IӦ��Y��m��p�#�vT,F�"J��3k�px\f=5����!�e�U*�ej��]��q|T�Ï��
�
��_Zu�"/�M$�_��*ww�Y�q�w�"���B�$�����	n7庉�u9�M
k[#�������H>�
1���d�J����f}���=�'2�rR���?��_�]��Ÿ�q���ik�W���w�3"�;a2&��M$���L���7����c��ͷ�n�
G
�le���Q' �������9��paכ�w,~�TI�|2:
��t	�I���g��>��1���4������gYt_��
�]�e[M.��ѯ�*��Z�;����ݾ�m`G(C��{
��+�)a̒~��7��l���[��~���Lճ����̕w�"QG[��C�Bj�ڣ��\��2�Si�vO}
�$M��:_�j���*��+GC��mj��zQUc�	#��6Q3韮�}���C�ݺ34RGC
텧��(�
?-�ڮ��+ۋo��xG^C'68y�$P�`0饉�;��j9Vܺ���$��ޮ2N�^K�� ��n����|�R�\u�#hɷ�g�߷o�n8��u	�߆�8��Dگ�2^���tį_D�����e�t���@7׸�z4����0e��>���0L�[)VF��:ѕ:�i*�
&�7�P�
{z�8c}>�M��g����R���>
-i0��1�"U�cz6�����B/��<z�����/U�
\��(U��$Rޮ��F��nh���39:u�h�.!�
Syı?�q�My�(�����?O8����exk0U>p�i};��ED�^h�q�$�����?�����aw߿�ź���~��\�ݛ��OImyt%�Ο��y�Q�D�z����;}_׫����
x�
JL�胻�G�0�Ӵ��j�d�2� 5��;z9T�`�/3�0�:�ÿ�g�c����CΜ��`��b�A�l�
-endstream
-endobj
-10292 0 obj <<
-/Type /Page
-/Contents 10293 0 R
-/Resources 10291 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10137 0 R
-/Annots [ 10224 0 R 10225 0 R 10226 0 R 10227 0 R 10228 0 R 10255 0 R 10256 0 R 10257 0 R 10258 0 R 10259 0 R 10260 0 R 10261 0 R 10262 0 R 10263 0 R 10264 0 R 10265 0 R 10266 0 R 10267 0 R 10268 0 R 10269 0 R 10270 0 R 10271 0 R 10272 0 R 10273 0 R 10274 0 R 10275 0 R 10276 0 R 10277 0 R 10278 0 R 10279 0 R 10280 0 R 10281 0 R 10282 0 R 10283 0 R 10284 0 R 10285 0 R 10286 0 R 10287 0 R 10288 0 R 10290 0 R ]
->> endobj
-10224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 695.05 220.579 705.954]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a5f47fcccf4795964925294d448335f0a) >>
->> endobj
-10225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 695.05 290.038 705.954]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 682.143 233.76 693.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a091c62cb35ccf09353d79a532e6c1758) >>
->> endobj
-10227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.575 682.143 272.763 693.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.205 682.143 323.393 693.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 654.336 243.165 665.24]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a3024467f23276b9db83e3bbb6fc05b12) >>
->> endobj
-10256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.502 654.336 327.278 665.24]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-10257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 626.529 246.034 637.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4cf4938d837fcf701695a0828bf56cef) >>
->> endobj
-10258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.522 626.529 360.71 637.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 598.722 231.1 609.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeabcfd0fb026563fd3464f04d32c8e60) >>
->> endobj
-10260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.915 598.722 270.103 609.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.916 598.722 345.559 609.626]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 585.815 135.579 596.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) >>
->> endobj
-10263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.077 585.815 155.225 596.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a1aabacaac0806d617f53db4b34b3349e) >>
->> endobj
-10264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 558.382 162.677 568.912]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a2a0bc130f7cf6a0678ee3b982fcc7ab6) >>
->> endobj
-10265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 530.201 187.563 541.105]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a41227446c918730e97998799bfe04da6) >>
->> endobj
-10266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 502.395 220.768 513.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a76fce1702224700691a26cf5e780a1dd) >>
->> endobj
-10267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 474.588 168.216 485.492]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac915c8d26a7dbcdbbd0c4985ec5b7d4b) >>
->> endobj
-10268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 446.781 226.308 457.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a811f6f947785240bcb76bfca023fed17) >>
->> endobj
-10269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 419.348 297.728 429.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af4e7705af87f5eb64d2ebdc60cd7a36e) >>
->> endobj
-10270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.544 419.348 336.732 429.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-10271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 391.541 283.353 402.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_acdc0aeddab3d98e336719f42e6e5b06c) >>
->> endobj
-10272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 363.36 191.718 374.264]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-10273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 363.36 288.852 374.264]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a13419c5d820bde20af5eabd23e479ec8) >>
->> endobj
-10274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 335.554 191.718 346.458]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-10275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 335.554 303.079 346.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac3e03bc2df621903d136c689c38bdb6f) >>
->> endobj
-10276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 307.747 201.471 318.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aba6b40a4b9708e94d6cd10f54144ed70) >>
->> endobj
-10277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.808 307.747 293.874 318.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 279.94 182.044 290.844]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a1f0828932daf26d10e94120c1f4a4d6b) >>
->> endobj
-10279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.381 279.94 274.447 290.844]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 252.133 272.783 263.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77a904793c99cfb1d61fadd277d59471) >>
->> endobj
-10281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 224.7 150.493 235.23]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a081718c23b5785da17c63ffec13536cc) >>
->> endobj
-10282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 196.519 181.845 207.423]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a164c38a51c8718e6ac3a3f3e4af77bf0) >>
->> endobj
-10283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 168.713 181.845 179.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) >>
->> endobj
-10284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 140.906 154.727 151.81]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a0f19da4c46bb8b3be01875eff4c00538) >>
->> endobj
-10285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 113.473 176.505 124.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a58b86510b9c4dc05004c0fc01622430b) >>
->> endobj
-10286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 98.522 450.955 108.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) >>
->> endobj
-10287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 74.333 169.013 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a64600674ceb04a95caa3db13515aa9ff) >>
->> endobj
-10288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 74.333 237.894 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10290 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10294 0 obj <<
-/D [10292 0 R /XYZ 89 770.89 null]
->> endobj
-10295 0 obj <<
-/D [10292 0 R /XYZ 90 699.035 null]
->> endobj
-10296 0 obj <<
-/D [10292 0 R /XYZ 90 643.745 null]
->> endobj
-10297 0 obj <<
-/D [10292 0 R /XYZ 90 602.707 null]
->> endobj
-10298 0 obj <<
-/D [10292 0 R /XYZ 90 575.224 null]
->> endobj
-10299 0 obj <<
-/D [10292 0 R /XYZ 90 547.417 null]
->> endobj
-10300 0 obj <<
-/D [10292 0 R /XYZ 90 519.61 null]
->> endobj
-10301 0 obj <<
-/D [10292 0 R /XYZ 90 491.803 null]
->> endobj
-10302 0 obj <<
-/D [10292 0 R /XYZ 90 463.996 null]
->> endobj
-10303 0 obj <<
-/D [10292 0 R /XYZ 90 380.576 null]
->> endobj
-10304 0 obj <<
-/D [10292 0 R /XYZ 90 352.769 null]
->> endobj
-10305 0 obj <<
-/D [10292 0 R /XYZ 90 269.349 null]
->> endobj
-10306 0 obj <<
-/D [10292 0 R /XYZ 90 241.542 null]
->> endobj
-10307 0 obj <<
-/D [10292 0 R /XYZ 90 213.735 null]
->> endobj
-10308 0 obj <<
-/D [10292 0 R /XYZ 90 185.928 null]
->> endobj
-10309 0 obj <<
-/D [10292 0 R /XYZ 90 158.121 null]
->> endobj
-10310 0 obj <<
-/D [10292 0 R /XYZ 90 130.314 null]
->> endobj
-10311 0 obj <<
-/D [10292 0 R /XYZ 90 91.549 null]
->> endobj
-10291 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F11 613 0 R /F66 3179 0 R /F67 3037 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10380 0 obj <<
-/Length 1677      
-/Filter /FlateDecode
->>
-stream
-x��Z�s�8~�_�S�Ċ$O��k�N{���}Om�Cl�a���_+!������n��V�j��oWؚ[�z��}�;=�����5��lq7@̃3��P��y��r<���Q�����g��#��w6�}�x�-�+`���t���[3�����	|�V
--�:�F�?{�ز��m

��<W�Fh��oqB!�
��p�)#N�=K�2DXPX�	c'"oI��}FH�DFS��A�#��m$o�4���u�k�0�oB�k�<�r��A �Z� ��j�)e�1�����ڧ�N��y�ܟ�M
.�e�Φ�BLd2�E}��Q���ڔ�'��D\+!��F"����̆�igr��k��x*�z�
Ɛ��ͬ�^��s)̊!̸����!x.f]���E����	X�}�JY�;�;���'�ɊY.�����\r�^����ZP ���XÑϽʹ��s�������Px�n��܇�֘�����
-�>av�R�Hs�U�R��N�엉0:���s�H�,�3�K
F��6 �s\,�Xd�0/q<�
�h n�s$d���7��J�R%잇(#��.��
`��P۝��C�P�S�����}[�"�"@UM,��
-�
-tp��-{��JR��(W'�!
2p(r]��
e4=Է/�W}	`���+�rp}������T�f�
��O�v_f���Al�J��䕈Eʝ�h
3WcT.�T=T�;D%����9�J�8i�&���P�!YC٠"}֨��A�l��J�M�]��r(04�Υ��4��w�"�
�gZ�WJ0E��털gRbĀN:%�C	ꏩ=��i�4���慓���^���#�STG���ܫ
-I�e�5)�K�-�Z��=U����5(|r�);�45�i�7O���������ng���V��,�!f��&
�&~�4$AY
�\R]9
���;,�����С	9H;��O�G��@�+
���u��(p�_[�t��W@���naj�3�tJ$��<Kd]jpQ�e-N�t�q�����0���ۜ[��9�b�
����__!����?Vɫ���?�h)b�����B�
�M�U8�rt���Q�
/����3���DL,�"]�7�~�om7��,�v��v$�bLJuݝ��HF�bӷ�݆�^��w]>]�Y�+'�Z���&~�w��gO�-��q�
L��$m'����$��Q\]/��(��dP�l��NgM��
�y��%E^���s
�p� �
U\{�A�6֖�]Kձ
/�k����ϥL�+Ek)
j��+�ZjbsM��'k�g��.�_��j�p��
��
�����:f�y]��Ě�o�M��̺`����\�E��5���C�]�n��'R��2M2s3L�E�����(@ͱx%��F+����f�a��T���
 �d��#��l�������6wX����af�)��1�rޕ����f* �������r�E��?���V����+�~�vroW�s��7

E�:]����r��q�H[L8�����~X�17N_/
�e�6��o�Q���*[V>A.D��T����m~�W&����٦�
�uQ�T4�*��tӟ��s�H�Mn�ߥ���kXe
�E��)v#�jxzz����4Y��p�h��k��%�I�4Q
7��S�n������
-endstream
-endobj
-10379 0 obj <<
-/Type /Page
-/Contents 10380 0 R
-/Resources 10378 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10137 0 R
-/Annots [ 10289 0 R 10319 0 R 10320 0 R 10321 0 R 10322 0 R 10323 0 R 10324 0 R 10325 0 R 10326 0 R 10327 0 R 10328 0 R 10329 0 R 10330 0 R 10331 0 R 10332 0 R 10333 0 R 10334 0 R 10335 0 R 10336 0 R 10337 0 R 10338 0 R 10339 0 R 10340 0 R 10341 0 R 10342 0 R 10343 0 R 10344 0 R 10345 0 R 10346 0 R 10347 0 R 10348 0 R 10349 0 R 10350 0 R 10351 0 R 10352 0 R 10353 0 R 10354 0 R 10355 0 R 10356 0 R 10357 0 R 10358 0 R 10359 0 R 10360 0 R 10361 0 R 10362 0 R 10363 0 R 10364 0 R 10365 0 R 10 [...]
->> endobj
-10289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 695.267 200.963 705.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a32364020a67e8172442cbd9d1077cf44) >>
->> endobj
-10319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 656.187 179.384 666.717]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad350a787056fefe667783a60a9f2923e) >>
->> endobj
-10320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 627.692 183.698 638.596]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4c001b3abe941fc38c182ed23c7bca2b) >>
->> endobj
-10321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.438 627.692 238.89 638.596]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a875a737ccb94634bd7f5fd577d7d9657) >>
->> endobj
-10322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.834 572.416 201.899 583.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.8 572.416 239.767 583.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
->> endobj
-10324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.909 572.416 343.158 583.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.736 572.416 421.493 583.32]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.33 572.416 521.308 583.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.834 532.34 201.899 543.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.8 532.34 243.622 543.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.764 532.34 347.014 543.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.707 532.34 464.641 543.244]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.509 520.385 285.893 531.289]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-10332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.517 520.385 357.275 531.289]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.709 520.385 457.687 531.289]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 507.321 202.497 518.225]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 507.321 244.818 518.225]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) >>
->> endobj
-10336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.633 507.321 310.391 518.225]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.764 492.587 422.252 502.492]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 479.2 202.497 490.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 479.2 244.818 490.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8950f38d19f1b721d66b756b0ae10cb3) >>
->> endobj
-10340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.155 479.2 349.405 490.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.058 479.2 428.816 490.104]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.834 451.079 201.899 461.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.8 451.079 245.306 461.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.448 451.079 348.697 461.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.391 451.079 466.325 461.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.509 439.124 285.893 450.028]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-10347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.517 439.124 357.275 450.028]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.709 439.124 457.687 450.028]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 411.003 202.497 421.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 411.003 246.502 421.907]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) >>
->> endobj
-10351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.317 411.003 312.075 421.907]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 382.882 202.497 393.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 382.882 246.502 393.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) >>
->> endobj
-10354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.839 382.882 351.088 393.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.742 382.882 430.5 393.786]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 354.762 203.075 365.665]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 354.762 296.324 365.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac74dafaa0b06e9cd3d15ea0d2af1b213) >>
->> endobj
-10358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 340.028 337.637 349.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 327.014 194.297 337.545]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a041afb1a2cc7277572fb7235cf08cf64) >>
->> endobj
-10360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 298.894 188.759 309.424]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ae94a99f8e8d290b5791baa01fd540a14) >>
->> endobj
-10361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 270.399 226.019 281.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.758 270.399 301.843 281.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) >>
->> endobj
-10363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 200.066 222.711 210.97]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.209 200.066 314.187 210.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.794 200.066 361.329 210.97]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
->> endobj
-10366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 102.454 226.034 113.358]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a082a74ad0ce931ec2e517bf0f009daa2) >>
->> endobj
-10367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 102.454 386.241 113.358]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 74.333 156.281 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) >>
->> endobj
-10369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 74.333 225.162 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.374 74.333 308.439 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10377 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10381 0 obj <<
-/D [10379 0 R /XYZ 89 770.89 null]
->> endobj
-10382 0 obj <<
-/D [10379 0 R /XYZ 90 591.438 null]
->> endobj
-10383 0 obj <<
-/D [10379 0 R /XYZ 90 524.37 null]
->> endobj
-10384 0 obj <<
-/D [10379 0 R /XYZ 90 496.572 null]
->> endobj
-10385 0 obj <<
-/D [10379 0 R /XYZ 90 428.375 null]
->> endobj
-10386 0 obj <<
-/D [10379 0 R /XYZ 90 400.255 null]
->> endobj
-10387 0 obj <<
-/D [10379 0 R /XYZ 90 372.134 null]
->> endobj
-10388 0 obj <<
-/D [10379 0 R /XYZ 90 344.013 null]
->> endobj
-10389 0 obj <<
-/D [10379 0 R /XYZ 90 316.964 null]
->> endobj
-10390 0 obj <<
-/D [10379 0 R /XYZ 90 288.843 null]
->> endobj
-10391 0 obj <<
-/D [10379 0 R /XYZ 90 219.088 null]
->> endobj
-10392 0 obj <<
-/D [10379 0 R /XYZ 90 148.839 null]
->> endobj
-10378 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F90 758 0 R /F32 764 0 R /F38 3426 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10482 0 obj <<
-/Length 1763      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W����`<	��m
����M�S���m��D��⸿�
�H���X�Į/"E,��o��K`����������ɜ >���s'���>�9]��`ސ`��#�`7�&�ɑG���o.�Q��KN�(�	��,�
��8��4�T`��8������y�yD���,��I�2x���^�F�
R�B ������g���[#(��8�2����?��z-

���@�k	
V�$R���:��� ���k�T "PT�}-E�$�)��I~٥��T��C�@L�vT�aǿ���5�
�B
�	CT���T4:�f�����P�W�����{����i�7����g�t���N
�}ݣ����Y��I:�ҵ?�Ѣ�Gw��y��Q�
�հb{���΋q>Խ�

��D�%�'Y�+��dD�&�8"R;M ʙ��e���tT��y�.�E�u
niB嚥
-��
�n	�^�k���x�����e�F^R�|N���,ʢI���*�϶�ֱ��Zh/�aUKC�giS��gu_�@>*�1�g	����y%�<

k��0���3��gd�w����k=�0�yz$�y�`z����
8V�)xV
2-�.�t[d��r��y����B�N���ݫـ� 
LJ�F=j� �F�n���ц��5|���������զ��LEk2?�g~C�����U>f�\'��d���(#[%dP�9!��]'d�JB^��)�`�_��"
7���=���7L�s&6�8M�q���d���
x�C at K����h��
!���"�v��F�	[9˳E�Q\�
I�X��4�"X:
ߔw���.�Wn[LL�3�Z$_�1Ч���]ʅD��ݔI��5�~x���ͳi�߆p#���n��X!��v���0L�yG�r�{�1�ZQ{3�
^\A��E�0�D���
C�+
���Sؽ�ŝ�̷%�0�����}��Ɲ��<B�m��S�1-�iz�%"�_�v~Jzk�{�
-V��ol��n����#n�� �ႛ��D��ڡ���Pu���2���Z-=S�C�U�o,>���=b��g�M�*mj��`b"��[E"��D�F�,TU�z���=
4_�3Cɨ��=����[N�p
����R�盻qq�H
E�W��T���T��<JƱ�
R��gY2k�����)l�/5��U
*���ʬ�3|�d�Ve
ʡ�����V�)w���gvb6��el֤���;�i���SH�k���8�S�u2��:,�T!��~�E^{
-�J\�X�w�v��RD�|ĊCgE�h��b��&�#T倨���!�0�b�M}pG<0�L�^L�5��@_�����E����adm���J�q�uS#�jb
�/7����#J�!m�Z#��TPK�>1bǥL��>"J@-����"�$b�݊��O�I\���m�� V�9P
6�B���k\��
-�/�b�8C�����y �(t�b��w*�Hu,�8��
R �H�yߨ�w����
n1��]�b�k;������]6II�RJ�IYQ MR6� ����zQ�{�C��.�4!�������5V��I���<<[���˄��K$����d|t��s
g?zB�f��-�.��W��/�Vg���	���GސA~��@9�
{��>�,꟒GBTž�<������
X�\��t�N�5;�e��6N���L��X� �����>�H �W��1������v4��0�U
- /�'�
JW%�
-endstream
-endobj
-10481 0 obj <<
-/Type /Page
-/Contents 10482 0 R
-/Resources 10480 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10495 0 R
-/Annots [ 10371 0 R 10372 0 R 10373 0 R 10374 0 R 10375 0 R 10485 0 R 10376 0 R 10401 0 R 10402 0 R 10403 0 R 10404 0 R 10405 0 R 10406 0 R 10407 0 R 10408 0 R 10487 0 R 10409 0 R 10410 0 R 10411 0 R 10412 0 R 10413 0 R 10414 0 R 10415 0 R 10416 0 R 10417 0 R 10418 0 R 10419 0 R 10420 0 R 10421 0 R 10422 0 R 10423 0 R 10424 0 R 10425 0 R 10490 0 R 10426 0 R 10427 0 R 10428 0 R 10429 0 R 10430 0 R 10431 0 R 10432 0 R 10433 0 R 10434 0 R 10435 0 R 10436 0 R 10437 0 R 10438 0 R 10439 0 R 10 [...]
->> endobj
-10371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 694.706 178.976 705.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.735 694.706 217.703 705.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeca84d3bda389453f22a494ab9923088) >>
->> endobj
-10373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.563 694.706 322.812 705.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.054 694.706 402.812 705.61]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.508 694.706 513.996 705.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 682.751 177.322 693.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 667.831 452.208 677.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
->> endobj
-10401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 654.257 178.976 665.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.607 654.257 222.43 665.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a80ef003442edc6db8e77caa4de7f7ef1) >>
->> endobj
-10403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.033 654.257 329.282 665.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.706 654.257 448.641 665.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.93 642.302 280.314 653.206]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-10406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.46 642.302 351.217 653.206]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.054 642.302 519.644 653.206]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.317 627.382 513.996 637.287]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 616.423 201.717 626.328]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 602.849 178.976 613.753]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 602.849 221.297 613.753]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a538c16dacec86f66e9520c728a7c5f35) >>
->> endobj
-10411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.112 602.849 286.87 613.753]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 587.929 349.876 597.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) >>
->> endobj
-10413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 574.355 178.976 585.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 574.355 221.297 585.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4be36a9309c5ecfa863e326c44296391) >>
->> endobj
-10415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.634 574.355 325.883 585.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [343.537 574.355 405.295 585.259]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 559.435 456.547 569.341]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8950f38d19f1b721d66b756b0ae10cb3) >>
->> endobj
-10418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 545.861 178.976 556.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.286 545.861 223.793 556.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a622b8ffad2bd654696c12d7d07ba51c6) >>
->> endobj
-10420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.754 545.861 330.004 556.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.107 545.861 449.041 556.765]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.93 533.906 280.314 544.81]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-10423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.46 533.906 351.217 544.81]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.054 533.906 519.644 544.81]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
->> endobj
-10425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.317 518.986 513.996 528.891]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 508.027 201.717 517.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 494.453 178.976 505.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 494.453 222.98 505.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aca47a151389a78c2474186b9628ab5cc) >>
->> endobj
-10428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.796 494.453 288.554 505.357]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 479.533 350.521 489.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) >>
->> endobj
-10430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 465.959 178.976 476.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 465.959 222.98 476.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) >>
->> endobj
-10432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.318 465.959 327.567 476.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.221 465.959 406.978 476.863]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.393 451.039 457.193 460.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) >>
->> endobj
-10435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 437.465 180.54 448.369]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a3075c67d9868fc0b483db13256fb4e0c) >>
->> endobj
-10436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 437.465 272.942 448.369]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.676 437.465 379.741 448.369]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 408.971 178.239 419.875]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ab7b9abebd48fe0ad129a237338aa96) >>
->> endobj
-10439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 408.971 270.641 419.875]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.374 408.971 377.44 419.875]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 380.477 226.034 391.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a6fb154017052c68b63121cef49c568ce) >>
->> endobj
-10442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 380.477 411.457 391.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) >>
->> endobj
-10443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 351.984 180.54 362.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a3075c67d9868fc0b483db13256fb4e0c) >>
->> endobj
-10444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 351.984 272.942 362.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.676 351.984 379.741 362.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 338.733 178.239 349.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ab7b9abebd48fe0ad129a237338aa96) >>
->> endobj
-10447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 338.733 270.641 349.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.374 338.733 377.44 349.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 325.482 178.976 336.386]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 325.482 217.441 336.386]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a82f262d4a5b57ea92ef25f5f49006ffe) >>
->> endobj
-10451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.778 325.482 322.028 336.386]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [339.681 325.482 401.439 336.386]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 312.231 178.976 323.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.34 312.231 221.162 323.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9188a38b44fd9b356f73459148e5f57e) >>
->> endobj
-10455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.231 312.231 325.481 323.135]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [492.637 312.231 513.996 323.135]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 300.65 159.618 311.18]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 287.026 178.976 297.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 287.026 221.297 297.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a538c16dacec86f66e9520c728a7c5f35) >>
->> endobj
-10459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.112 287.026 286.87 297.929]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 273.775 178.976 284.679]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 273.775 221.297 284.679]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4be36a9309c5ecfa863e326c44296391) >>
->> endobj
-10462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.634 273.775 325.883 284.679]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [343.537 273.775 405.295 284.679]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 260.524 178.976 271.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.085 260.524 222.591 271.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac1e87cdf51be31f4c9c43c4c86bccb66) >>
->> endobj
-10466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.149 260.524 326.399 271.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [492.637 260.524 513.996 271.428]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 248.943 159.618 259.473]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 235.318 178.976 246.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 235.318 222.98 246.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aca47a151389a78c2474186b9628ab5cc) >>
->> endobj
-10470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.796 235.318 288.554 246.222]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 222.068 178.976 232.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.474 222.068 222.98 232.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) >>
->> endobj
-10473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.318 222.068 327.567 232.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.221 222.068 406.978 232.971]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 208.817 156.281 219.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) >>
->> endobj
-10476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 208.817 225.162 219.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.374 208.817 308.439 219.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 133.841 242.885 144.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10479 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10483 0 obj <<
-/D [10481 0 R /XYZ 89 770.89 null]
->> endobj
-10484 0 obj <<
-/D [10481 0 R /XYZ 90 712.265 null]
->> endobj
-10486 0 obj <<
-/D [10481 0 R /XYZ 90 671.816 null]
->> endobj
-10488 0 obj <<
-/D [10481 0 R /XYZ 90 591.914 null]
->> endobj
-10489 0 obj <<
-/D [10481 0 R /XYZ 90 563.42 null]
->> endobj
-10491 0 obj <<
-/D [10481 0 R /XYZ 90 483.518 null]
->> endobj
-10494 0 obj <<
-/D [10481 0 R /XYZ 90 194.569 null]
->> endobj
-10480 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F101 862 0 R /F8 794 0 R /F7 795 0 R /F10 765 0 R /F13 834 0 R /F6 861 0 R /F9 879 0 R /F12 939 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10531 0 obj <<
-/Length 2629      
-/Filter /FlateDecode
->>
-stream
-xڽZ[�۶~�_��J��B��}҇���4u�x�>�99\���D�$�����
 � i���G$p0�ˇo@��&���o//���H��$�����X���*z7����1IF�J�-��ݿ�\�zs��.^]^|�`�E#fH�f�r{��W���Lj���V�F1p�Do/�}A�.��)��N�&$Y�2F3
-��\���עw
I�,�/�����\���˪�AϿg�9�""K���̐���T�}�7 2�f賓��(!*�P9Id�D1��4�s3
-�T����<ZP���+=�
S��D�2I@���g���|���JiJ�Ԫ��ʻ�H��nֵ�^�,Ig/�K�_^V�"ƕ2����++���F����
�Q��!�Ђ�s��Yd)h��!�d<
��
�	�dql��̸ԑ'H�M�0k�K�>7�� ��(m��
���H$
��n�ES���\�v��d$NY?�lM�t��ܬ�mQ�e]���z����ͫ�3sw]7��k�1�f�7��芦}�:&��ne�����ɰ<X^
-��'�7�r��lAc)găJ��[����P�܅��g�Ib�����nA8�f]m�Ws&g�r�2����m��|�͊�h�Ԉ���:EB &�`zJ����*_�Q&�u����i���f�A?jS��j�)*���{���v��}Y�Xik+lY7M���j5�]�eg�Fd�w
�q�C��ؔUp�����, 
bC���QH���
��n�BAZfd#JJG=g��*���N��

s��i��#�.o�}�p��a&�����z��[7�b�:�u}[�k`$���y�[�
�aaP�.�[�8y��i�@����4,��E��BH1����H߷Zk����k��a�¡�]���`��+|/�g�z[�K�
'J�̼B�͈%���Ug�!������lL[/�-��
澼��X��q�Y<�ߺ�L���X޷=½�@�6���Va���"�����*@�
&Y��'6��.��p�eY�*p���췶ּ��bp�18�`���X��mm7��@�I"�׮J���� [...]
-��
�	����� �
-��5B�G�,���^֭��÷2��=��2�st��]>�[�vY�^����fS�Z�&��E������蒷-h��E���2��7H�=BpB@ 2�i�Vٰ�އ9G2@<&ġ
�e��OG�
�7�?G,�V���}qdw��G��0
- �v�M8����ʋ;��H��a �ih�=eg
��C�0�L2�\ʬpp�Zye��p
�XJ�-��<��ze;{��o�cB��۲[��)
u0@�ڊ�I��cv��O
މI$N��29C?�)���
g��u�F�8Xˡ��>�hd
.��"��fS57���0�T�c7�_#�y=촓��scb��7�Î�؝#B��wF��&���i�Ɋ	&��������@z6κ)o�3J�
3����ae��I��2�[7w�
-��e����t����v�9bP�H
A*z=��uG
�k
��w�3&(���	4�E3မ`.TY�a�
f���o�ņnǽ�M?4|D�����?i��(q�I�L
-�Id樉�ݦ_�-&1��-�+�3�e2����$}x��X�D$��'�o.���;�f���0I�U�r8Y��
)"���
w��u��5z|�OC���0�U@^�R��u��<V2@ȸ=�p5�;��/�T���B����@�M�}�wʼn��M�;�vۅ�km���I�
0�
[�����s[���t-�8�u
<N�b�&�~�)�Ԁ����T����q��w���R�FP�_��}��#[HF���!�\��O&��
��C!L��4n��ሞ
��ZSIb:���B3��3��zc��`=\f at +�G���s��I�O}�!������Y��9�Y���U
��g?��
��nl�y\OLgV��Al�A=��=�ll�Q
b��'�A_�<���{&$LH|ݺnHﱲ;�e�%�P�9��BL�)�d��=�eع�C<E
�) 1�� ����b)�T)���N��� Ʃx$2�ί&�8���i�H�D���n9a�����
��V�d�{��|�-c�#4~b��鋃ї�{�9��`Ӭ���r���Kw���};$�C%��Чp�]�,NH,�9xz�%RJc�%o�m�ɛ��
Xّ�Î<��>�L�=
�
�e:
O�D?��	Gr¦(a����
���@Lif���0[�7h��1�3�	��n�2&SO�4�Q�q��A��B�NQ�
!�m��r���T�L��Æ<��Y��	�|x�j±���u��|�!�-V����{2�%���Ǵ���K�6�Ŏ
-�}s�
!���Hx�
������?k%��P��g-��8%R�y} FKY����{�ٿc�����j6�[���(��
����!�e�Ԓ~R������ڢ������?�j��k�6�ƿ�0B���,o���������?
�9� �H9P�u��^<~��i��,�g��b��n�o��̶n�� h����>q�����s
-endstream
-endobj
-10530 0 obj <<
-/Type /Page
-/Contents 10531 0 R
-/Resources 10529 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10495 0 R
-/Annots [ 10504 0 R 10505 0 R 10506 0 R 10507 0 R 10508 0 R 10509 0 R 10510 0 R 10511 0 R 10512 0 R 10513 0 R 10514 0 R 10515 0 R 10516 0 R 10517 0 R 10518 0 R 10519 0 R 10520 0 R 10521 0 R 10528 0 R ]
->> endobj
-10504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 445.767 175.659 453.293]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 445.767 234.239 453.293]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
->> endobj
-10506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 407.022 175.659 414.548]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 407.022 234.239 414.548]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
->> endobj
-10508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 333.375 175.659 340.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 333.375 234.239 340.902]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 282.676 175.659 290.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 282.676 238.423 290.202]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 243.931 175.659 251.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 243.931 234.239 251.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 182.24 175.659 189.766]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 182.24 238.423 189.766]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 143.495 175.659 151.022]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 143.495 238.423 151.022]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 104.751 175.659 112.277]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.693 104.751 263.529 112.277]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 96.781 175.659 104.307]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.431 96.781 280.266 104.307]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10528 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10532 0 obj <<
-/D [10530 0 R /XYZ 89 770.89 null]
->> endobj
-10529 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F101 862 0 R /F8 794 0 R /F10 765 0 R /F6 861 0 R /F11 613 0 R /F9 879 0 R /F12 939 0 R /F7 795 0 R /F90 758 0 R /F75 554 0 R /F93 763 0 R /F24 529 0 R /F32 764 0 R /F98 863 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10550 0 obj <<
-/Length 3078      
-/Filter /FlateDecode
->>
-stream
-x��[�s���/���_ҙ$M�I��5������(��ԑ���N���b����Ng�Ť��X��
������x{���X)K#o�Aʃ8L����"�q"8�j:��ɛ����d7o��O���]������:���_����u^�u����Lj>�r�5
�~�/�z*�I^�sS�XM�ӟ�~{��۫wW�� .4��`����g
,��ۀ3�&��!��T�\?\����
�8\���~����Jp�BD�'2��`BвV�
�!�g���UQʩ��8��Үp�mU����&?q�96B�,i0LJb��C�D������W�����m�LD1��K�d��;���ɲZ���ԓ��\aS4���V�c]�yC�Ւ����v��vwԶ��\��}G�G��\?P.��hŦ�.C�y���l��
bQl�)�������
x�Ť�69�jV
-�ޭ��K��%r"�a��6�1P
-IJ�)�U�(�'���1i(	
O�!
#ش
�H��7�
G$!Ǔ&�W��Y��۽��O��|خ�b���&Kcu�9�Q�� ��n����j2�t�����r�Cyӊuo5JqǡJ���V�\�
-�h����6YJ�7�T[�*[3O��m&L�x�b2��3M~�i�]_��݀6�Y*��V<��3b-��ı�g�>�~��w��Y��Y�3��(��s 2f
|�Lr&"��_}�6�5ڪL&��.
h�HX�S3
-W}'X� Ӿn	.z�u’�����%�
�4�|^�	�
��(i�qE��B;{�r"�g���n*z����[R��TL2����xB��s�:�8*xN�bJN������n,�4χmk�0
�eF��*g��|�
���d�zoI�.�G��|����b�{���G ?��_��%��1�#ElgX�����jT���3%��c
��lIR��)���(-�ôm�@�~B
-�`���~�z��{��޿��~�8VH%
��
VH���nI�}q7�Ta!��p��Fl��z�˭��7�P�Ӯ�c��j4�m胇	�
�B����
�z���kj��ž�
�
-o�
��H�UU/�2�卉<���k
ЙMQ6�
 ����
-ގ:+��=���Vt�@A�y�0���g�|��1P ��q>
.I��C,iҎq=
@�8j��G����p �D2q��S9������@��CS�ࡅ:oGv,����P4e�8Du&5�|�͛�L���/R⇇�8pȠ	��zkpG,��G{k�
�z&49쐂�ٴ�w׊�=���t�9��Y�GuvΚz�D�&
���u��
=/���CkA�:>������:A�<���s��^�����d���-:]��A5���
r�Ր3��e(������=I�8�d(�b��)�0��5fx!��.��^
�yɤp"��X�P\3�[��n�R&c�
J
��c�
Q{7�9���9�s�snQw�)� &����

��
�>�c��?n��X
u�C�.]�cq���U]���]��<�:T5�2}������^��˽�	��
a���9di袤�=Iq�נ��t�frҡRh1��
*��<��!S$�6v�!
��}<
-Tx9z<zҗ��8
O����h�<@394�S�����fr'^��ʁx�G�M}h���C���|��p��&�E���=[ܨK��d�,r<��,v�,�'@"�
%�OQ�J�����{[|�\�=�Ζ��"#�Mgx�4�1��Ԫ�����u��e%P��j�Џ��tꉈ>>�I�6�99�īnyŷ��Y
-�]�{�js`z�-60���Θ�D�U�1� ��&Ů�9�
��=���Z���=l]=���ptP�tUŶ�'M.�/�:�y����⡻rb^V
��?c�=�ƭ� �V�
�)H���SC�/��G?�i?n�kb��ڎl�	��|�7�(��w���tk;�@�Db���*�w�G���!z���T1�ڰ�c�y�F��i�����1�:8&��=�4��B�,��Ye�
n�;�ʆ!O��@��S��J���O[!��#�G�
��1s(�7��! ko6[t�G�A�!��
A�NT
�$�!�8���1�>z����K�� k���M$+ō��GB��i
�VrdbD��]�tc�'�<�a�	ї�HxRE ��=/
a%�X��rJ]��T2�
eX�p͢�ݼO(S�!\o,p�x��_�g9�=(FyR"�|ᦱ
�ПJ�7�om��e�]d����0��YJȐq��ݯ$��S-��ċ��F=Y	V4T�uД#��
-�u���9������O
rg�� |����{mB���BLYX\����x�,�������+�:־���7_}��p
�5��P��
�q�������\�e7���/\�c��
��i;vw �|6��?�b�mw*g�&����䳖�^��t��d0���~���O�'�� 
�Y]d�r���Θ4
RqѨ�1N\�H#�.?�f�J>=��_�;�(�axk$���'�ƛ���EV!�Y�l`��y�	���@�
G�K��f���ee'Ȧ�Rσ���i�1�w�b�
���9��+�
�h��.����+�|�!�e�S�^[$�ȯy�"S�b��7+
�[�ӕ���ʾ��eEy�
Ts��]�
/��v<Rm��2�S���~>������
�K���P����@G���;ÞqȦӏX�
�8���K(}d�	
�.L�IS�������
�����	؋d�����XR�����x%ƞkJ��Ҋy~^f��ƻያ@b��7�Ԧe���t�TV��J��
-C�|����%��WK���9�4:aKb���v�r��p�U�f&|S��1�cB��]�}��Yv�JX�}����Ie��b
]bF/A��՜��E���/�G��T�^d7��aU	�*
-����&�2L���w��&��u��_�rOeJBl�rٴ��`F�!wq���%po!�ֱ�wԵn�?w��������������'��u��r)��afS�]�.��� 'Gͅ�lV �w�=����8���|t
m��o6*�S��W࿴k��
-endstream
-endobj
-10549 0 obj <<
-/Type /Page
-/Contents 10550 0 R
-/Resources 10548 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10495 0 R
-/Annots [ 10522 0 R 10523 0 R 10524 0 R 10525 0 R 10526 0 R 10527 0 R 10533 0 R 10534 0 R 10535 0 R 10536 0 R 10537 0 R 10538 0 R 10539 0 R 10540 0 R 10541 0 R 10542 0 R 10543 0 R 10544 0 R 10545 0 R 10546 0 R 10547 0 R ]
->> endobj
-10522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 709.04 175.659 716.566]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.693 709.04 263.529 716.566]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 654.62 175.659 662.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.693 654.62 326.294 662.146]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) >>
->> endobj
-10526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 638.68 175.659 646.206]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.431 638.68 280.266 646.206]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 573.268 175.659 580.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 573.268 238.423 580.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 530.803 175.659 538.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 530.803 242.607 538.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 439.09 175.659 446.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 439.09 234.239 446.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 396.625 175.659 404.152]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 396.625 234.239 404.152]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.376 223.586 204.949 231.112]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.454 207.645 184.027 215.172]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.141 207.645 246.792 215.172]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 145.255 175.659 152.781]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
->> endobj
-10545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.772 145.255 242.607 152.781]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
->> endobj
-10546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 106.775 213.317 114.302]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
->> endobj
-10547 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10551 0 obj <<
-/D [10549 0 R /XYZ 89 770.89 null]
->> endobj
-10548 0 obj <<
-/Font << /F73 552 0 R /F75 554 0 R /F60 532 0 R /F98 863 0 R /F24 529 0 R /F32 764 0 R /F7 795 0 R /F90 758 0 R /F101 862 0 R /F8 794 0 R /F11 613 0 R /F10 765 0 R /F13 834 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10561 0 obj <<
-/Length 2385      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�8}�W�iF��`�	�v�j&�d3��'�>eR.F�e�J�����|�6.���h��V�Jt7���h����/���W1�4Ғ�hvi
�\#!��"�<b����~��T�h	�l���gW�g�̻���ş^�8�*��/>����0bZE�m�u�)��U����
�m��
-�h��e +��D���`$��	��ޥ�i9�P�F�1W��M�Ho]ï��~��d����_'4M(G��@"^ɮ���6e��VP�%���`��#(�J׮؟4%
qA��X���#[�=JA�8�R�Q�;J�&۝Qz�
-V��K��������H�A��:
y�a�4�g� � ��c�ƨ@��E)U���7�]�.z�F5�Zu�d��:���4)o���D�v�*�$���'�?�H�0B*�@Ni!܀�1���\'7�c�G���.]�����k�����2[ܼN�LvE9��T���+�vτs��
��7Y}��rK��rOe��/�t�~}}���R/�,Z������퐎����>$0��\���b�\�)�MvNæ,��o%[ײ.��]q�Xa�E^�s���,����=
� ��R'� ��P�6H�

������t�w(d5�NvO`�>�)�"�䀚�cn�{0����P����0��D�iǻ�4� 
��@�q$���|�t�mxT(��
,f����WC�
�1�<xh^��}'�-��=� �PG~h��k��$�Hu��ǟ�]ͮ>��g'��I���R��#�y�2o؇7�g���������Y�;"�&B I��>��
�⥁��~�B���.
������B�)n�k_#B#&u�9A*���؈���NaDɘV��(�󘐑K�
B�a���
&P,&qh�Ð�ȞÑ
�ɳ� �D�&���� F�	jz��W�P6��xµ�T�`H`Q�J�}܍9����ی1U��
��1զ
f� � �e!���̾
O+b7�C��r�^�W����B��&G-
�5�tL����m�t��[�d�
߳��	�K����p
�bW��,��25��FT
���q��^X�=
'���
�s�%��8q*�L8'�a�lj���q�
x���oBJx�x'b|
-NH�Np��ċޒ�3��A`��Ni�����®d�MNx��M2�+�i�0��`b��:/�G�aV��qmf�_�FX�G�fK�|�l�IY���9���
߳�
<q��M:�����*˼rN����
0b遑�0�`�VX`��0Bˮ���`��c(
Ǔ�r��=ԫ�|���)���&m[#`�_9�S2��V�u�
�)h��z��E6+�Dr~�ki��` �\
�L�bCΟ� �%�umЂ�e�z�����s�"%��z�攇W��ム>��#	�
����R��(mʬO�g�J��A;5���V�۹��)V�����>��n���"�M�W���_Q��c����.���1p�`!O�hϺ�
Z�T�s'���t�ܱx�j�n{������
�
-�ܢ8�:���c�v� �����{(-D��=���P=w����H�'��L�őO�P,�o�iƵD�v��P�y!eݶ�8,sH33b���y��b:��1l�ߒ� ��,
-�����A1G
-��3�l
�3U�8�D<4U�z x,���,,��v�I"s�nN���m}
-����'��{J6�F@`p�yI7y�2[fy���KGv�u�ny^�\���9�, �
_z���ϑ�� �	�+z����b�8�8j���\T���\<�\qF�a�aW��
ɮ0�g�@��]�&��Us�<�RU����e�V�鄇���j
(
�I	�z�2o:�+�?�>t2��y�����&����/z�L���_�)�Y�E��K{�B$l��Y�P
�sङ'�2�v��^��v��1��Z&��2�
ǣ�L�y�� /Ƶ���w�$$ a���)�ga%g�=y]C�_�'�ju,�f���rr
�n�DZ��Hy4)Hr�����[l�=J4pq���U3�,�?M�G7��
;r���]��#$���_
-��o%�~��t�@f�=��Ph�&u���5`R��P6*li��#"J��D���[�
j��dd��Ϳq�3�k�fHa��O�U�o�"��oq��7��2M��A���8�r
��ٟ����I#�1���Xv�N�Ŕ�(���?]�r�����֟@�01�Ƽl?ۗ��p�f͢_
ֈ���I#���@ܥ��>��@�}������_۴�����0~���ɪ��r^)�u��'�˜Oi��g׿k��ya�e�Y Q���n��^^~�_BB-ѼX��O3X���Tַ�_��P�C�������TeV
-endstream
-endobj
-10560 0 obj <<
-/Type /Page
-/Contents 10561 0 R
-/Resources 10559 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10495 0 R
-/Annots [ 10552 0 R 10553 0 R 10554 0 R 10555 0 R 10556 0 R 10557 0 R 10558 0 R ]
->> endobj
-10552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.448 649.545 237.536 660.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a875a737ccb94634bd7f5fd577d7d9657) >>
->> endobj
-10553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.47 649.545 515.72 660.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-10554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.892 404.457 300.957 415.36]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.152 348.286 391.217 359.19]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.086 105.091 422.655 115.995]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.486 105.091 511.506 115.995]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-10558 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10562 0 obj <<
-/D [10560 0 R /XYZ 89 770.89 null]
->> endobj
-10563 0 obj <<
-/D [10560 0 R /XYZ 90 721.073 null]
->> endobj
-10251 0 obj <<
-/D [10560 0 R /XYZ 90 702.288 null]
->> endobj
-10564 0 obj <<
-/D [10560 0 R /XYZ 90 702.288 null]
->> endobj
-10565 0 obj <<
-/D [10560 0 R /XYZ 90 635.971 null]
->> endobj
-10247 0 obj <<
-/D [10560 0 R /XYZ 90 613.595 null]
->> endobj
-10566 0 obj <<
-/D [10560 0 R /XYZ 90 613.595 null]
->> endobj
-10248 0 obj <<
-/D [10560 0 R /XYZ 107.713 530.097 null]
->> endobj
-10249 0 obj <<
-/D [10560 0 R /XYZ 107.713 514.156 null]
->> endobj
-10250 0 obj <<
-/D [10560 0 R /XYZ 107.713 498.216 null]
->> endobj
-10567 0 obj <<
-/D [10560 0 R /XYZ 90 481.489 null]
->> endobj
-10253 0 obj <<
-/D [10560 0 R /XYZ 90 459.112 null]
->> endobj
-10568 0 obj <<
-/D [10560 0 R /XYZ 90 459.112 null]
->> endobj
-10254 0 obj <<
-/D [10560 0 R /XYZ 459.302 407.61 null]
->> endobj
-10569 0 obj <<
-/D [10560 0 R /XYZ 90 400.97 null]
->> endobj
-10570 0 obj <<
-/D [10560 0 R /XYZ 90 322.757 null]
->> endobj
-10396 0 obj <<
-/D [10560 0 R /XYZ 90 300.381 null]
->> endobj
-10571 0 obj <<
-/D [10560 0 R /XYZ 90 300.381 null]
->> endobj
-10572 0 obj <<
-/D [10560 0 R /XYZ 90 229.704 null]
->> endobj
-10397 0 obj <<
-/D [10560 0 R /XYZ 90 193.994 null]
->> endobj
-10573 0 obj <<
-/D [10560 0 R /XYZ 90 189.511 null]
->> endobj
-10559 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F60 532 0 R /F112 1773 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10580 0 obj <<
-/Length 2884      
-/Filter /FlateDecode
->>
-stream
-x��[mo�8��_�Ow2�f��b�>�������mv�t�@��D8�Je%m��ߐ�dQ�_3���(�p�
>�̌���'�~��z�O����2�^&'�$$��H>�#�&S�1N�ON�j�ݼ�P�����|Qe7��UV=�f�bq�.��UV��dJNZeۭ���/�jBt�o�9�$L��16�|�����/W��	�Z�t2__}���<�9���|u��	�
����կW�1��"*쭽4f�̝�� �y�C
o��o���.���)�'ro
-?��`Oy,����n���=��-ci8��8&Fd��%p%C����H��pDa�!U�,{R���}��0�b<󛳭�Y��p�>e+p���0��=��M����~P�a�YTC�
p :��1��T�,�}7�� �C��rBE�u�M����)��8ELZ]�+
?"��w����3�Jt|�3 ��8��V$Q<꡸H�q���%0�CB$P���:��y�9}��a.۵`�
̣(��K at V�0v���>')"���m:��m�B#�B��OL��z\���[qC�	�,��Ǒ�T�M,�׀	

&�����P�n�f��Q8H��s���?��ٔJ����L��
BR=�hS�9�'�� 6��ɳ���k�[i#~�AAjZ���A�
-@��nDl�p��El5��Qf�?}�/G� �2�[�r�!c*5�6#�K"-�?��� �yц�p7!�b
-�) r}�v�c

pc����UV��٬�������D�^r$��ʗ���[#��<
����
�2�0H�i��ޔ�|dk�@Z��l��X���ֽ`��|<*�
��AKI�
wa at a��ȗ�㪾�3�O,?8�}3ɘ�Dig�'@>dsŧ�B|��otkz�Xm��^���������5���|�3�!��H�@Fu
�Hl�D�P�QH��~,���� aN�Hv��bl�%�X
�FĨNHe׏��t�?[��(<�{�����̤_�	�����E\:n�<Y֖�
�6}�'��k���wW�'7��=h,�G�s�
-m
=,ӞD;}pH�G+�
-�=�
��C>�
+�iBD���'R�(̈�48	S�
l�0����ά ��fV� �eV�Ñ�4ff�yIf%8l��V1-mS���/L�K�Or����a�������'s+�5bb�[�&�z�YPYXF"Ա��(�
��4!�%
�h�H ��I� jY�A`�0�pFVD�3.���R��*�m>�c�ٔ4��K��L�}�<
�
-��;N�z˄�] �.yr^��}�(�ԁ�x��M��0ʹ!i��ex�Q���0"�FB���a��%FJ3'˾��;�f!/�!�yl�ج��
g��%��f��c^�l��8-���{j2�j�~��-�:�r[l�Ơ`�,��襙���?,d��}�
� @nz5�z<�������[�5KDwivC�Q,j�
����P�`�mYZ.��q����ȁ1}!~�X+�h�
�	���*P
-��+P�,�HrEH��P�
~V��������l�A
[ܒd��!
�>��XϬ����i�zwl
-[�Xa�S
&'�O��ˊ�v�oo>��X�����Z�;mO��es=�nG�Ahǻs��L��cH)�ۇv�
h5P��VL��Wa�|1 ��eU�����
-̢��@A�r���ڗ���R� g�/g�Z�C}J�Wܿ�p�o�}qw�o�S‹�X�@�+�?e������۹n�����u���mu鮭�`�B��4#E�V��
-
2�| (�����W�h��U�����r�H�"�;���1?4uo�)�׭�x�m�l*M��̿��E�t�6����CV�Ū����f�<\��A�#�fXѶ#|N��ҭ�h�����ԧ2�0nK���<A������<�
-C�' D�*��'h��� y��2T��'�˱LrJ�H

g��3�
�3��{<�� ����H� Ѯ~ݏf��yݯ\?M4
��Oî�>�k�0�vEұ�6$���B
- �"
�?:g�G<�}
��ꎒoF+2�tQ���lH�� �o>,�6\؃k?ڹ�/sMު�لф�B;�#������d}�0,wH
��y�g�<���a��9����5��B[dኤߑ�@��l�����>Ѡ#J̰���Ņ�	�\
�܊���ՠ�T96az�&[#	f�s�5�h��W�e]�m��P�3B�����jl �b��9 �1�C0���[�
a��5��
 v }�89��
@x�� 
��0��/�iS �� ;�x

S� =��8�t�83�
QF�!]XDߌ�k|��t��~79?��EA����W�J��0�h�
-2]/�Žfb��z"/�e&"�f�zY1-m{YS_��
-,
zY��^\IK
-��f�ے�7�|��Nh%�S�� �Chz,�Ϋv¬Q�l��_
�6z]�j
��J���%[�+�D�S�������!,����'�tDAp
p7�}�͊����n}mΤnfo�[�sc�8s��b�b��*��L�&E
,q����58��Q!�h`l���hۢx*��`W|��0��'xv�>9G߸�Ţ8wm�3H��Z�(أO�i����ѧz1�!)8���|��TGE��"
�1`�"Ҟ��KX�*@h4��̖�v�����<��Npt¯w��x�Zy�/��/^ك�n��2��DdFڧ��Ѡ�Zٹ���u
;!y�B�r�?�Y�	����o~���_m�٤�dO@�� �y�v0�܇�M��c�v3���Mڻ_9�٩B�G�����u�0{����n�o�м\�
���{]�e]VmCf��c�F�Ν0A�vVU�!�X{L��v¿޽�c�b��Ϳ�,�G	
��`��7o��
-endstream
-endobj
-10579 0 obj <<
-/Type /Page
-/Contents 10580 0 R
-/Resources 10578 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10495 0 R
-/Annots [ 10574 0 R 10575 0 R 10576 0 R 10577 0 R ]
->> endobj
-10574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.086 595.109 422.655 606.013]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-10575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.486 595.109 511.506 606.013]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-10576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.907 367.764 435.73 378.668]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-10577 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10581 0 obj <<
-/D [10579 0 R /XYZ 89 770.89 null]
->> endobj
-10582 0 obj <<
-/D [10579 0 R /XYZ 90 718.682 null]
->> endobj
-10398 0 obj <<
-/D [10579 0 R /XYZ 90 684.012 null]
->> endobj
-10583 0 obj <<
-/D [10579 0 R /XYZ 90 679.529 null]
->> endobj
-10584 0 obj <<
-/D [10579 0 R /XYZ 90 565.131 null]
->> endobj
-10312 0 obj <<
-/D [10579 0 R /XYZ 90 530.461 null]
->> endobj
-10585 0 obj <<
-/D [10579 0 R /XYZ 90 525.978 null]
->> endobj
-10313 0 obj <<
-/D [10579 0 R /XYZ 389.246 474.291 null]
->> endobj
-10586 0 obj <<
-/D [10579 0 R /XYZ 90 467.651 null]
->> endobj
-10314 0 obj <<
-/D [10579 0 R /XYZ 462.17 370.917 null]
->> endobj
-10587 0 obj <<
-/D [10579 0 R /XYZ 90 364.277 null]
->> endobj
-10315 0 obj <<
-/D [10579 0 R /XYZ 158.014 302.791 null]
->> endobj
-10588 0 obj <<
-/D [10579 0 R /XYZ 90 296.151 null]
->> endobj
-10589 0 obj <<
-/D [10579 0 R /XYZ 90 227.448 null]
->> endobj
-10316 0 obj <<
-/D [10579 0 R /XYZ 90 192.778 null]
->> endobj
-10590 0 obj <<
-/D [10579 0 R /XYZ 90 188.294 null]
->> endobj
-10591 0 obj <<
-/D [10579 0 R /XYZ 90 117.434 null]
->> endobj
-10317 0 obj <<
-/D [10579 0 R /XYZ 90 81.969 null]
->> endobj
-10592 0 obj <<
-/D [10579 0 R /XYZ 90 77.486 null]
->> endobj
-10578 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10599 0 obj <<
-/Length 2603      
-/Filter /FlateDecode
->>
-stream
-xڵZY��H~�_��
���uS(�ev|�
;�{�</-J-b%!j���7� �-�,�"GfVf֗�U��}����
6�p�����W	�R�J*��E��(�)�����1>�p�[ĤB$����_޾�����w�����
�[8"N�@�����p����@1KU��>��8ep\E�n�u�ˬE #��D��L0
	�N�c
ߕ�j2�
�o&��Y�Ύ�"�B)�rNOYFQ��ζck�"H�i`қ	�1XAH�u��j� J	�Pʑ*0��ʪ�T�_g��U��D��p&2����*k�j6+�c�a��(`�!���Ӯx�g+�i�'
b&GўH�T��)M���o,�d�%��妶v�&'�c��!�����ひ�"L��pO�
<b&%o��: #E�u�,$v6O�K$��0�Tw������䡬)�3
M)E+��[��M�G+�H!�:�j��C�L*�%�}�X�+��M�N���;�[�m��
���a6`��v�eQ�5è?�C �I�sv E!S�Rig�I�	��q)j�߷���

-I0R\�$a��̪�[�lBq�Pl���

r����l�ۻk��
��wlkԦl
��
`��U��@b2�!(sv���"�$���%T�ԊbD^���'
�JSD�
-Mx.�H�dE
-N�3G	
C;	�� �+[
h)�\��VR$��ZD��󈬒S��r	"A� 2��4"3;�>"
��Y>��I8�F�c�5J��[x�*r �b���_�t!ٛ0���!�h�c�֗��e��HY7��,�������ާ���7�{���c
�ؔ&�w1�Ϝ�;�;ą?�3_�*Gw�gӪ�?z�v������EY]To�
�G���% ڔq|��B2�4W��V���"�t�� \`�S ^a���	I`���0i� �JH6�~&t�=��y
�)
c��S��@e^<�Iw�{���6ԈA9��_J� ���b�>�ȇ�%��.�JQ
n��h��l�an0�d��+�Sf

�Wz1Ib���P�b���!,W��~�z�
�x�
-�;���@�
-Z��	u���#RuF�꟨�δ�I
->�V�������\4Kw��'r��.���r1��sW=g�@�oLbZB�&n
����
�
{��t�ԍA�۬����,3���ݖŦ1aC0[R�(��ұ#��Y�ڹ�AéT�J�*6�s
��_�)�mp��z��n�Ҕ�f���S	!O{UҰK0��a�[5�v���r�6K�N���"��
w4��	I\ZT�ڝ�OW���+x�w��aNV;d�6�6x�ѹ�$ 
1-ڡ'[���4��8j���s�C��,W��[�
-7=*�P�Nn
-�,".%���3��@��3�8�c�`��	O�g��QLP��
L8��zh�
-ZA}A?����J��ϗDz�jrJ��Vqj�Thՙ��bI��nIs��\՜2&�N����ճ_W�������뇓eV���Y��=T	�,�
�9� OFgs��
Јrz
-�
mK��9�$�M	eKC�!�|D^~�k
�u(�#r�����qz2ո�7Q�����[&"i
-M
4V	9%G>sC���/Ҽw �^�ƅ����JG�)n�� ũ��,��+|��M>��	��٪�?�$����cΣ�f-���#�� <��P�
-��:1�p�Q��vY�f&~ޜX��1I�۪J����i�
-�"�I�G3ވħ	�ų�*�g�
��H&��L1�L=��=�L��e����m5!*ֵY���
q��8�x�WcP��DZkՕ���0�`�O�՘�2��(&�p��&<�W�2��&���Є�j�/�W�!���
�"l
-\K�꪿�UA��;AX���T ){��ϫ�C3�9�w�%���K�ڝ�r�Nf� o��|QW��
-��Yb��^3c�/]��(��eִg���
3w�s-���V?sK��Wނrk�̍Jw����Y;j�;���H�T����ٯ*�|���g���^en���m枱����.kꉾ�4q��
��*�u�Y;�?���C�-A�!^0�9]
��OC����V�k�ӗ��Z^��dߘ�φ4�D��c�h۳�
�s�߲vM�-��\�OO<&bP
�U�vͶ]���%D���
H� kWqm��s�u�����<�w��0�����~y6�1L��T��;�������싲
��l7a�C[k~y�uϹ���H�/��:Ë$�"��vs$bC;���o
��"��	�f�w-ou�

���H`���AK `�2���T0݄��TX�����{o'7�-`�(㢷�u�_ ���
�u��ؑ�^-�X2���:��쀎�ۍ(����]�>�[4E<U�#��Sj1��M-����u����/�Hj��x
�x$H����O�
-CGA���s{�}�_x��E/J�7yӽ���+p����,�g<�Kco���N�
��H{���l�k?=0t{�U�y�A�����ޓή�vf�~c3��
a����h�4����w�{�=����\ٿ�f��_��]�.�m��B	!�?��K�
-endstream
-endobj
-10598 0 obj <<
-/Type /Page
-/Contents 10599 0 R
-/Resources 10597 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10495 0 R
-/Annots [ 10593 0 R 10594 0 R 10595 0 R 10596 0 R ]
->> endobj
-10593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.507 582.475 236.499 593.379]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aba6b40a4b9708e94d6cd10f54144ed70) >>
->> endobj
-10594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 125.188 329.2 136.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) >>
->> endobj
-10595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 80.973 330.884 91.877]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) >>
->> endobj
-10596 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10600 0 obj <<
-/D [10598 0 R /XYZ 89 770.89 null]
->> endobj
-10318 0 obj <<
-/D [10598 0 R /XYZ 351.108 659.423 null]
->> endobj
-10601 0 obj <<
-/D [10598 0 R /XYZ 90 652.783 null]
->> endobj
-10393 0 obj <<
-/D [10598 0 R /XYZ 462.877 585.628 null]
->> endobj
-10602 0 obj <<
-/D [10598 0 R /XYZ 90 578.988 null]
->> endobj
-10394 0 obj <<
-/D [10598 0 R /XYZ 220.39 487.924 null]
->> endobj
-10603 0 obj <<
-/D [10598 0 R /XYZ 90 481.284 null]
->> endobj
-10604 0 obj <<
-/D [10598 0 R /XYZ 90 412.58 null]
->> endobj
-10395 0 obj <<
-/D [10598 0 R /XYZ 90 372.781 null]
->> endobj
-10605 0 obj <<
-/D [10598 0 R /XYZ 90 368.298 null]
->> endobj
-10606 0 obj <<
-/D [10598 0 R /XYZ 90 280.608 null]
->> endobj
-10399 0 obj <<
-/D [10598 0 R /XYZ 90 256.319 null]
->> endobj
-10607 0 obj <<
-/D [10598 0 R /XYZ 90 256.319 null]
->> endobj
-10400 0 obj <<
-/D [10598 0 R /XYZ 90 214.615 null]
->> endobj
-10608 0 obj <<
-/D [10598 0 R /XYZ 90 210.132 null]
->> endobj
-10496 0 obj <<
-/D [10598 0 R /XYZ 90 170.4 null]
->> endobj
-10609 0 obj <<
-/D [10598 0 R /XYZ 90 165.916 null]
->> endobj
-10497 0 obj <<
-/D [10598 0 R /XYZ 90 126.185 null]
->> endobj
-10610 0 obj <<
-/D [10598 0 R /XYZ 90 121.701 null]
->> endobj
-10498 0 obj <<
-/D [10598 0 R /XYZ 90 81.969 null]
->> endobj
-10611 0 obj <<
-/D [10598 0 R /XYZ 90 77.486 null]
->> endobj
-10597 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10615 0 obj <<
-/Length 1968      
-/Filter /FlateDecode
->>
-stream
-x��Zmo����_�~i) Z���p���傻�Z7q?����(��$*$����%��H-%˒�
�(j9;;3�<3�ň��>���� �K������g����2���$$|��!�H��`���!�a�-�O�C��t�8��Y��]r�E��x�6K���ƫ8��4���Ꮛ(ϫ���,ΆD��j�L�
Ï7���
>h�Ri!���d9����)���gF�e�)��E�a�n-�\�h/�D�Ϊ�D�^�]�. at G��t])��u��w,�pą
'�*/��
�f�.U)EwlP�o��2Ƹ��F�v�hDd3��+�X
�
�S�r����fͬ�
a-� �
��m�)�n�m/�"�~,�����rW�	�4H� �U�����d��3c��f�"��ՠ�P*��
JfU�F�iu������?��2�8�#_#.u#��@�y�
�����E�*��E�CR��ػ5�@F5A�	[P��gD
A��v�m4�^4��4(���x��?.���!A�Ҍ��J�g at Bi���($(�З̏	Uc"/��q�Y
-A=�!,��4qA���������6���8|	���y�Pj ����!1ɞ�.�!���P��q
���쮱+b���#|*����9
-)
�)�)�� �Iz���M
i��xJ��6�\����ķYL
������|��o����C�Ο{L�m�:�A�o������R�e� %�����6M#�ߺP���������"YAE�t�!h��m;�$�w�`�}z�u]uby��+_Jf�m���oɛ����+_�S$E����nb���h&�КB�4�3/eH%�R%�<�1�T
 �
A�"�A&lV���h�*�w����
-�
LO�0$�me���A��Ý
-
-��aZ��1�g�cL'����B4)#�+(>a�g ��R�ي�J�R7J�|<n��(_�Ϝ9=e2kO�ų�
-�|��1-� ����

n'�����O���X�zȴ�h2
'{!f�1���A�Y�*���j�2�F�Ϡ
-;��?��F��a�X�`�XFv2��m��g�"�(�(H!�i�_�f49^�(�H��}n� �2�J�V��&��g\5��z�JhD5{��c���H�Cp�
^�?�_�׬(��I�v��
�����kxM\���0*��b�C�?�v��
 �0	��d
����[-/ɤ/�A�����'Ry!"�Oh�Ge�"L�β��q�mgY�HC���Tt���$�G��i
����}�AJ<��1���R�{��eHy�&�
-Z����!Z���d/���kOz�y}�m�:��֦
�~��w���)*��*�l����3a�bX@ �@!RK��Ԉm�Z Z���Ǎ��m\�}yO�P�AV��=+�ؕ�W� �����0]�@��x0�E���FB1�Q�:y0
�>}�� �$��`�>ɖ;{$�xm���S�̌�����
hi�A��
- 	_{�lD
�����}��n`5���ͭ���]+�[���j�e_M
n��a���"��n>T_ڹ'G'`
CR�3H����Eܖ�_Ѱrk&
Mw�Am����`�v(�5�L��.�s�e
-E� m=@�xH�y50_Ǔ��q-"O�WO
-v��N�=k½t��f�}��v�65��=��O<)^Uv��z�u
�b����j��4ɋdu�I�yt���:�ҥ{���LZ}+�)
�C}-:�.2��V�mE1wzL���
��H���*H�p��k�.i[���5�"
�b" qh4 -%iU�D�h��
	�������B7�{�IRH��g�� �	
���>��U]�]_��.����_�.fm�ߢ����V_�D@�76&[�EБ�9?�!���
���e~تB���)��E�
_]�m�!*��쿗*v����n���2�bopsY�r	��Q`����`��`~LT�<�����G�`}��%
~J���cc�	hl
-endstream
-endobj
-10614 0 obj <<
-/Type /Page
-/Contents 10615 0 R
-/Resources 10613 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10631 0 R
-/Annots [ 10612 0 R ]
->> endobj
-10612 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10616 0 obj <<
-/D [10614 0 R /XYZ 89 770.89 null]
->> endobj
-10499 0 obj <<
-/D [10614 0 R /XYZ 90 686.846 null]
->> endobj
-10617 0 obj <<
-/D [10614 0 R /XYZ 90 682.363 null]
->> endobj
-10500 0 obj <<
-/D [10614 0 R /XYZ 90 642.631 null]
->> endobj
-10618 0 obj <<
-/D [10614 0 R /XYZ 90 638.148 null]
->> endobj
-10619 0 obj <<
-/D [10614 0 R /XYZ 90 581.977 null]
->> endobj
-10620 0 obj <<
-/D [10614 0 R /XYZ 90 559.93 null]
->> endobj
-10501 0 obj <<
-/D [10614 0 R /XYZ 90 537.822 null]
->> endobj
-10621 0 obj <<
-/D [10614 0 R /XYZ 90 537.822 null]
->> endobj
-10502 0 obj <<
-/D [10614 0 R /XYZ 90 504.76 null]
->> endobj
-10622 0 obj <<
-/D [10614 0 R /XYZ 90 504.76 null]
->> endobj
-10623 0 obj <<
-/D [10614 0 R /XYZ 90 469.697 null]
->> endobj
-10624 0 obj <<
-/D [10614 0 R /XYZ 90 447.589 null]
->> endobj
-10503 0 obj <<
-/D [10614 0 R /XYZ 90 414.528 null]
->> endobj
-10625 0 obj <<
-/D [10614 0 R /XYZ 90 414.528 null]
->> endobj
-10626 0 obj <<
-/D [10614 0 R /XYZ 90 379.464 null]
->> endobj
-10627 0 obj <<
-/D [10614 0 R /XYZ 90 357.291 null]
->> endobj
-10628 0 obj <<
-/D [10614 0 R /XYZ 90 324.295 null]
->> endobj
-10629 0 obj <<
-/D [10614 0 R /XYZ 90 301.186 null]
->> endobj
-10252 0 obj <<
-/D [10614 0 R /XYZ 90 277.141 null]
->> endobj
-10630 0 obj <<
-/D [10614 0 R /XYZ 90 277.141 null]
->> endobj
-1893 0 obj <<
-/D [10614 0 R /XYZ 90 88.554 null]
->> endobj
-350 0 obj <<
-/D [10614 0 R /XYZ 90 77.486 null]
->> endobj
-10613 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10680 0 obj <<
-/Length 1765      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~��0�����U�l
�[�vm�5�SS��8�lɕ���;")ɲ�Kb'm�'�yx�}�9<�������i�����wt�1+@�K]���
-��� 	�
�/6c�����\���^���>]��tq^>뽽�}�x�-�
��V4�}���!�~����T���)�߱u����[�)��!(�V.�_B��#��>��g�v�M�U?�p����+��&o�W���q1�h�q�0j�c�{~#�Y�
��
-�.p�����*
3�������,
vx�Q�;�
�@��[.��Dfa�f�C3
-��!�f�C�����y!'N�R�~=�\_~�׎g�L&�TNUR?:q����i�}��6��l�m�N���X_U��Q9�X0��>�K���K�D��P��|�R0�
-&�~��!�Ū�t:F77
v�@�+�f�Y��J�0��C�P��(�雈.1�y
�5�q�r	� wI�h����Dh���JYd#��ϪI�g�&y1��%-;�80�G\�$I��a
�#_�y�L4K�=�[��L:۷��
w���R�][����-��
}��g2��
-�9�#�ԏrr����Y1�p0�;�.	)Š�ہ	�%�ʹ_b��q6�d.�",��ꟽB,^�l\
�V{�M�Lu+�o�ui�i���"�ʱ�g0ڕC�=�����l� '�b���ML�K!�wT�c��9����
==�l����j���F��d4�E���xa�@Cc2��#�dL��	�~�3G�M�K�X���ɀ�
-�
��) ��D&9�0(�S��Z�����65(�"�9�>�H��
2�dK��:�.�1��{�F�
-u��y|9x��{
�N��UI߸���䩌�K��4%F�0�W���v�Q���J3>�n]]^b���[C�h��E�HB1��
-_�G`{u,
O��6K+�j
/�D��}d�2��QyєP��M
-���NrBp-.�ְ���D�C��,�Y�,W"�,�Z��
����_\GG
s�pìc����^զ����ą=�/���@[Ʃ9%X
v.���G��g���\�w 
@�]p�q6|���!�5�$�CfCY���i�A��y�iFod��[٬��_S�%�8-����}��*��n��U�iII�cY�<$ rd�X�پ
g7s�Q�����������N'[���ab�G^
��+�.���7|�%�^�I��7���N9X!� P���Nv	o[80��RX%���]	ޝ�ؾ@n at v�b?������޾
6������U�f�$R�p�J
-{��>��֯�9ljJf�g��l�
�g���(�: �I��C�2��;�����4�<vr"A}�4��`�Gѥ�!��2�U��7+B�=ME�>È4��"��uTWm*��
-�9j��6z
���w���o,���
e=-���n
�W��o?�6��L�Z�
��,. ��)�m̥�Z����rc�Q/�J)��[-�B(?Ȟ�#�c�l
Ij|S�����$�S�Bv��׸���*�P~
�-�
�Q �
�i�}hҗ�p�׻k�~���H������S�I�
-5�R�
-�.������(�������E�>N���ϣ���zX�17��M��&c��>��7՗+n�A
07m��gg��?P���Q�
�d�}{��mI�̚}3A
-+��x�ˊ�׿����%
��>ʩ֔��

]�F�LF(J'��i:�^����c�I�ɪD����1 �?8 W�
-endstream
-endobj
-10679 0 obj <<
-/Type /Page
-/Contents 10680 0 R
-/Resources 10678 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10631 0 R
-/Annots [ 10632 0 R 10633 0 R 10634 0 R 10635 0 R 10636 0 R 10637 0 R 10638 0 R 10639 0 R 10640 0 R 10641 0 R 10642 0 R 10643 0 R 10644 0 R 10645 0 R 10646 0 R 10647 0 R 10648 0 R 10649 0 R 10650 0 R 10651 0 R 10652 0 R 10653 0 R 10654 0 R 10655 0 R 10656 0 R 10657 0 R 10658 0 R 10659 0 R 10660 0 R 10661 0 R 10662 0 R 10663 0 R 10664 0 R 10665 0 R 10666 0 R 10667 0 R 10668 0 R 10669 0 R 10670 0 R 10671 0 R 10672 0 R 10673 0 R 10674 0 R 10677 0 R ]
->> endobj
-10632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 612.264 192.544 622.191]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-10633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 541.733 213.297 552.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.112 541.733 278.87 552.637]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 514.01 213.297 524.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab289fda31b27c62873b4542280a90719) >>
->> endobj
-10636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.634 514.01 305.699 524.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.911 514.01 385.668 524.913]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 486.286 213.297 497.19]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aca9c22c405ba1378296cc85f850aff21) >>
->> endobj
-10639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.112 486.286 282.755 497.19]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.737 486.286 365.494 497.19]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 458.563 213.297 469.467]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a998804f094e131a7f06d05c6e9eb5f5c) >>
->> endobj
-10642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.634 458.563 340.02 469.467]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 445.697 213.297 456.601]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_af1afb697fed68cd53ff8d90b1d7cbc28) >>
->> endobj
-10644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.634 445.697 340.02 456.601]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.107 445.697 423.865 456.601]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 417.974 221.045 428.878]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8f29bc3aa01b8f5c67a3323189f9cf9e) >>
->> endobj
-10647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 390.25 213.297 401.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.036 390.25 264.843 401.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8a0c95f43fd48c07a63db5efa3564769) >>
->> endobj
-10649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.18 390.25 391.566 401.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 362.527 175.668 373.431]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 362.527 234.596 373.431]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4e6c82baa2eac91c07d9ae925b8d42b2) >>
->> endobj
-10652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 334.803 208.395 345.707]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aefcc22cba81dc18bc3e25d399127f3f4) >>
->> endobj
-10653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 334.803 273.968 345.707]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-10654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 307.08 179.554 317.984]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 307.08 250.666 317.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac485f37c083be7bc0238a3f5c6c112e3) >>
->> endobj
-10656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 279.73 155.265 290.26]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a023dc725ab60578fb2161f06211fa023) >>
->> endobj
-10657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 251.633 158.044 262.537]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a465d046e2570dea82e57ab6af9b179e9) >>
->> endobj
-10658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.382 251.633 250.447 262.537]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 223.909 158.044 234.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f6d9240b4cf201eee98359c903c1918) >>
->> endobj
-10660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.86 223.909 226.925 234.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.137 223.909 305.082 234.813]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-10662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 196.186 158.044 207.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a773be362898fec2d48f0948c89870cf6) >>
->> endobj
-10663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.86 196.186 261.246 207.09]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.333 196.186 343.278 207.09]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-10665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 168.462 161.013 179.366]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a9e847f0bfafeac6438cecb2d2114e665) >>
->> endobj
-10666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 140.739 170.687 151.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-10667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 140.739 195.165 151.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ace4c05e99016850c16c2bdaff5914afd) >>
->> endobj
-10668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.442 126.204 226.112 136.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-10669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.148 115.245 227.817 125.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-10670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.43 170.687 112.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-10671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 102.43 187.563 112.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_abba3cc93433c6564ba34c1fdd360bde9) >>
->> endobj
-10672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.482 87.522 271.151 97.427]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
->> endobj
-10673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 179.554 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 74.333 223.857 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aa09a1ddc7936a5377e838cb44610548e) >>
->> endobj
-10677 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10681 0 obj <<
-/D [10679 0 R /XYZ 89 770.89 null]
->> endobj
-10682 0 obj <<
-/D [10679 0 R /XYZ 90 630.11 null]
->> endobj
-10683 0 obj <<
-/D [10679 0 R /XYZ 90 560.641 null]
->> endobj
-10684 0 obj <<
-/D [10679 0 R /XYZ 90 560.641 null]
->> endobj
-10685 0 obj <<
-/D [10679 0 R /XYZ 90 531.183 null]
->> endobj
-10686 0 obj <<
-/D [10679 0 R /XYZ 90 503.46 null]
->> endobj
-10687 0 obj <<
-/D [10679 0 R /XYZ 90 462.548 null]
->> endobj
-10688 0 obj <<
-/D [10679 0 R /XYZ 90 435.147 null]
->> endobj
-10689 0 obj <<
-/D [10679 0 R /XYZ 90 409.15 null]
->> endobj
-10690 0 obj <<
-/D [10679 0 R /XYZ 90 379.7 null]
->> endobj
-10691 0 obj <<
-/D [10679 0 R /XYZ 90 351.977 null]
->> endobj
-10692 0 obj <<
-/D [10679 0 R /XYZ 90 324.254 null]
->> endobj
-10693 0 obj <<
-/D [10679 0 R /XYZ 90 296.53 null]
->> endobj
-10694 0 obj <<
-/D [10679 0 R /XYZ 90 241.083 null]
->> endobj
-10695 0 obj <<
-/D [10679 0 R /XYZ 90 213.36 null]
->> endobj
-10696 0 obj <<
-/D [10679 0 R /XYZ 90 185.636 null]
->> endobj
-10697 0 obj <<
-/D [10679 0 R /XYZ 90 157.913 null]
->> endobj
-10698 0 obj <<
-/D [10679 0 R /XYZ 90 119.23 null]
->> endobj
-10699 0 obj <<
-/D [10679 0 R /XYZ 90 91.507 null]
->> endobj
-10678 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10744 0 obj <<
-/Length 1779      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~�_�S�;��%�x�Ҧ��MҸ�;}H2�
Z/.�7�����Y;�$q�w�G`�����跫��	7
�6�����b�[.b6�Ƈ1��Y�)���'�E
�|B�8��sd�{^g"[
�fa��Df"O3�r�rO�����H(U/�Lf�e��ɔ;04M>�t��菫їڰAjZ��ǣ����?
�L�1n�I�aQ��q9�{�5[�׊M�4
`ӶJ6	uv
N"���B�E�h�I_��8���lb�qz��~�
ߔȔ|O����
-ސzN��l�*hP�sC�щ�;��R�l�SB�c��ȏ��ޢ��FCvq:2>L+c��0M�|����hf���D,s���=�d��-?MT��u�K�
9��/�@R�kEV����(L��hM�c��N�H?_��\(o��I�d �>@���ܙnbDLU�����&�6i&�L��$ZjPg�j�鬶8r ?��#��!��/5t�C���$a#�4�rL��c�|���8o�.aq��⵿W����BD^���oW�kv-��X����P%8��^#�ƶ��/"m����� l�f�r`s����[4�v���
��7O�1_ϥ_f2�Uk��IGъW7i��W����S���a)���1���|��*�
-��0	凡����7
�&n
+�	�m�Q��Ǿ̲!���n���A����ggM�Ub��/
-��M�6�=�%�AsbL1����_����5Uy&�ή_�%��8�)�1��;�����
qP�Jv�A�}b=ϚDjDj!�C��
6�Z�"J���@���fh;����O��:
�\�.�&�f�*�^
|�2������
-h�iG�6�v8`ڏT���Ҝm2��ek<(v��lԜ�=��-���QOȸ�kx]�&4!�����eP?�^n�
V߻Ğ���%��t`���S�z�N�aC%m��6r��MM�"
F.���_��(:T
��NM�7e��w-w��D�/����AF
��Zvg"R�[��
��9Qv�L¶Yƈs���X[k�j����or�j;Os�5��0񮗹|�²�3V�h9 �z�&�W��
k��K�/�
�UC�
�ֲ�gO}'��Iy�t+���e�<��7�W
/�X$�lfս�M&ةc?sDM9�
2�=u[��צ�k��� x��/o�b0}b�
���y��0��D �v���e%��ⵟ�9���BJ�jn�0��Qg|^\O�8jn�I�7��I��e��֠�S
�H+
]���j���oT�Ǵ\cq穅�׮��
����a\��b�gD�vmx5g
-t�oʬ9�8�.��ۅ�wR��nv
&a
��t�O��Y��*�~y�t������
���k�tR��a�ܬo��Bin�E2�$Wﹻ��
�7����zEN(|'��%��nQ
�s�7��:���^��]�=-��x������)?�Ȏ�ݬ3{��BF"�����{E?0h��V㲁��Ҽ�e�"o1R�i�6gLi��7�aӬ�(z�V# ��m���ٵ�~w��nh�P�b�o��c
�N'���^�`#��`��\�O�֘�����"_Z %�g҄
0,���#�{yس�GƥN�ҽ��w�Z��L	5���Uشj���[E����k���8��ډ^5~���m=�G�엲��=�;�M1\��k��2�φ����\�&��D6�ћ��E�Y�g����|q|tt]�(�� ?�*|�p���l�93m�:xW
j������0A�M$ �/�1�V3���e�P?8:�M�� ��s�?]��]
-endstream
-endobj
-10743 0 obj <<
-/Type /Page
-/Contents 10744 0 R
-/Resources 10742 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10631 0 R
-/Annots [ 10675 0 R 10676 0 R 10702 0 R 10703 0 R 10704 0 R 10705 0 R 10706 0 R 10707 0 R 10708 0 R 10709 0 R 10710 0 R 10711 0 R 10712 0 R 10713 0 R 10714 0 R 10715 0 R 10716 0 R 10717 0 R 10718 0 R 10719 0 R 10720 0 R 10721 0 R 10722 0 R 10723 0 R 10724 0 R 10725 0 R 10726 0 R 10727 0 R 10728 0 R 10729 0 R 10730 0 R 10731 0 R 10741 0 R ]
->> endobj
-10675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 695.112 179.554 706.016]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 695.112 248.444 706.016]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac53b2bea17ae404e291cbcb7033dbaf2) >>
->> endobj
-10702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 667.429 179.554 678.333]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 667.429 223.558 678.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a102ffa79248502b4998a70fba5f13d98) >>
->> endobj
-10704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 639.746 178.727 650.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8cf170e729ac4e4576624d6ed7d4b44d) >>
->> endobj
-10705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 612.063 182.044 622.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a494a5dcf815a292978b1864d2d7f77ae) >>
->> endobj
-10706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.381 612.063 308.768 622.967]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 584.754 150.493 595.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a6a5f64baba3ae5704d9645db684434d3) >>
->> endobj
-10708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 556.698 181.845 567.602]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac5764ede75697ec70757c5e208945ca2) >>
->> endobj
-10709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 529.015 181.845 539.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) >>
->> endobj
-10710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 501.332 154.727 512.236]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_adfc60b971ed974350d241482f15f46ac) >>
->> endobj
-10711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 474.023 176.505 484.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a63fd965105d740ff7003037964ec7d10) >>
->> endobj
-10712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 459.135 450.955 469.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) >>
->> endobj
-10713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 435.007 191.718 445.911]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-10714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 435.007 288.852 445.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f0983add75d3a9c3663fbf925739212) >>
->> endobj
-10715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 407.325 191.718 418.228]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-10716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 407.325 303.079 418.228]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4254da492e5eeb1c12d8d87b997cd229) >>
->> endobj
-10717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 379.642 169.013 390.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a7d4c3ba6b9e9b575d07b2e87b69a24e3) >>
->> endobj
-10718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 379.642 272.215 390.546]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 310.146 203.075 321.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 310.146 296.324 321.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8530a0719104225bd022dbe9529ae527) >>
->> endobj
-10721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 295.632 367.019 305.537]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 282.837 194.297 293.367]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a62e7b71f72659356d1d732236ed5f330) >>
->> endobj
-10723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 255.154 188.759 265.685]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a864a52992178820135a7ae3a75e65377) >>
->> endobj
-10724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 215.143 213.297 226.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.036 215.143 286.103 226.047]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a90e26e60ccfbe3c6ab8d91b5bf06dab5) >>
->> endobj
-10726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.965 200.628 419.427 210.533]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) >>
->> endobj
-10727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 118.687 226.034 129.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8e247a33c9eb40439c706a98c5d363d0) >>
->> endobj
-10728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 118.687 420.562 129.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 91.004 156.281 101.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) >>
->> endobj
-10730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 91.004 259.483 101.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.695 91.004 377.081 101.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10741 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10745 0 obj <<
-/D [10743 0 R /XYZ 89 770.89 null]
->> endobj
-10746 0 obj <<
-/D [10743 0 R /XYZ 90 712.265 null]
->> endobj
-10747 0 obj <<
-/D [10743 0 R /XYZ 90 684.583 null]
->> endobj
-10748 0 obj <<
-/D [10743 0 R /XYZ 90 656.9 null]
->> endobj
-10749 0 obj <<
-/D [10743 0 R /XYZ 90 629.217 null]
->> endobj
-10750 0 obj <<
-/D [10743 0 R /XYZ 90 601.534 null]
->> endobj
-10751 0 obj <<
-/D [10743 0 R /XYZ 90 573.851 null]
->> endobj
-10752 0 obj <<
-/D [10743 0 R /XYZ 90 546.168 null]
->> endobj
-10753 0 obj <<
-/D [10743 0 R /XYZ 90 518.485 null]
->> endobj
-10754 0 obj <<
-/D [10743 0 R /XYZ 90 452.161 null]
->> endobj
-10755 0 obj <<
-/D [10743 0 R /XYZ 90 424.478 null]
->> endobj
-10756 0 obj <<
-/D [10743 0 R /XYZ 90 396.795 null]
->> endobj
-10757 0 obj <<
-/D [10743 0 R /XYZ 90 328.949 null]
->> endobj
-10758 0 obj <<
-/D [10743 0 R /XYZ 90 328.949 null]
->> endobj
-10759 0 obj <<
-/D [10743 0 R /XYZ 90 299.617 null]
->> endobj
-10760 0 obj <<
-/D [10743 0 R /XYZ 90 273.006 null]
->> endobj
-10761 0 obj <<
-/D [10743 0 R /XYZ 90 245.323 null]
->> endobj
-10762 0 obj <<
-/D [10743 0 R /XYZ 90 164.535 null]
->> endobj
-10742 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F90 758 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10774 0 obj <<
-/Length 2411      
-/Filter /FlateDecode
->>
-stream
-x��Yݓ۶���O��F8|�Ӟ<���Iڦ�}m쌇'�$�������.���/�M�:7s��b�X��o!
l
��������D�b7wAƃ$�XC��/�J�?�|�8e"�a����?ܼ���
�]�����J�1�X������xP���g*K�{C�
B��[��qŭ,|,S�G2	
�P�A"�� ed6w˂�����m�Tv
�i7V���BF|��u��M�����8��G|��]�ɛ�,>��5������n���
�Z�Ƴ2}1�7�ׯ3���8D�I��P+�$#ͽ����;\}�Z>�V�	�;�ۃ&*��bI,
QyG���M]=R
�f�����
f6HX,�#@�3\D��l��
�� o�*Yh+W��\��481���"&�fWB�����ݜ���'���R�
-��$��R�)��i���_�����N�Ǹ�oH�VJ2
ٰ*8�B&�+�A;��>/+�
$S�u���eS_2Pм
�
-�[���#y��on�H�����7���Z
�r�T�hn��޶��.����u�w�y
"ɓt��eG�sb�?�Y�Mk
l[�bQ2�l3'>�C՗��}t�n8�`����L��d~�tH���4�m�*km��b���N���h7
-��۾)�C;b�U��{�k�*�N�}Yoh����/kˊ�Isv�n���wڈN[�;]w`WȄ��Z<5����7��E�q��� <
"��yo�T��L<aˆ�@
ms�u�?p.k�H@��.��Ч��p�����̡A�m��PGs���:s�F��-�["*��N�uO;���s��z�w���r�{�`��]_���Ph��=MW:A�5��y$ih��ƋVU�����n�el��dj�p6��v���N����}�����
L���Y
��������lႬ�AtZ�j�
j8���o2�������@^�"� "]"��e.j~�8k�i��!��+me,{��}��.ܺ�NC������W`�Dc4�&,L�	�B{��8=A@>���I2@���Xcw3g��]SU
-~߽8�+a��e	d2Lj�~&3�?Dlo�_���U
^��6�1��t&� �9RL�\
�gnt�Xe�8����W^ѕQ&=���"e	��Hθ"&7���H-�'���vҩ���M���>��{>ٵ#
-j���±�wD����D��bax�t2��@�?�V8ԯK�QxOКD��m��27��I0!�o���=�	5I��H�9�~k-wd9`.Y(
�RΜ"���JFT�Vy���v
-ή`?�L�O�,7݌�n:F�u���#^8v
Ș�H�V�v
Y̱�`P�0���08�49x�I1b��wL
�/��`M&��l��6�(S�]K4��ѹ|�-6�1/
���i[�훺��L�C�5�]����&�z�:m���j�(�v���X[��mV�	Ϧ �n&aZO���2�LA�<
�K�q|@�S�6,mǎ��4����B�ª�3^�ȱZ�z�0tn�v^�VX%pa�d���+lH���

�����-7e���$�E/����	� e*���S/1�LJ0Ͱ�>�sN�:��}Jf Bߧ�P;Ռ�QC.�N�3Y���D�ﰹ�
-��^�ž�F�p�
��_}!�s_�e��x7V*�,!i��}�w=z������W�w�� �жI��Tl�ڲr,�Bs�
-��$`id���	�G.eC
�iU����
��	)g!/#�T)/
����*�߶�a��� ap�9
1N@�r�<��DB�>��^�r�<+�(�{�������o�F��FY���-g�A�ʞ$�N�I�U����$H�/RO��"x�
��/����`_
��
-Z��W��*:����`���Ư�,�F�v��7����/V��/��H
W��0Zgj�
8��:z(7�^v�5��fz٭��6���4i߫.�2t�6���!

G޴=�VW�{
I� +41Ÿ{���D
��K�
�\D����f��vd��G��\��#�4�����J�h	B-�(g	���YH�Rx��t�.��Lx��%b�1Ңvwh�颠�J
�&~*a2	R��G�9�d����o��d�!$>BxƲhx�y���,��
-�
Q\�o&�6/�~�H��Dr�E�
@�4���Er��"���@
"9
��
c^$���y� �h�utf/?�ô	����O]���ǟ0��0*hfc���醨ڴ @��)��ni���@�m�|�1��;�,�k|�ޣ�a¢��Z�
�
-��
�o�6�n�
��n��o`vd�~�#C�S��w�T���nӑ��	����'x��Q����[^r�^t+�m7<�B�j�P���imUEr�g�/�ƿ�,�����������æ�������/`��Yf�������5Ǜ���1����/��F�
-endstream
-endobj
-10773 0 obj <<
-/Type /Page
-/Contents 10774 0 R
-/Resources 10772 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10631 0 R
-/Annots [ 10732 0 R 10733 0 R 10734 0 R 10735 0 R 10736 0 R 10737 0 R 10738 0 R 10739 0 R 10740 0 R 10766 0 R 10767 0 R 10768 0 R 10769 0 R 10771 0 R ]
->> endobj
-10732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 707.957 180.54 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ae64d3d01d4baab5102f00046f941188f) >>
->> endobj
-10733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 707.957 307.263 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.996 707.957 448.383 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 680.369 180.54 691.273]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ae64d3d01d4baab5102f00046f941188f) >>
->> endobj
-10736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 680.369 307.263 691.273]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.996 680.369 448.383 691.273]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 667.571 156.281 678.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) >>
->> endobj
-10739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 667.571 259.483 678.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.695 667.571 377.081 678.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.243 593.542 281.629 604.446]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.609 581.586 202.675 592.49]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-10768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 400.549 204.949 408.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 147.408 204.949 154.934]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10771 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10775 0 obj <<
-/D [10773 0 R /XYZ 89 770.89 null]
->> endobj
-10776 0 obj <<
-/D [10773 0 R /XYZ 90 654.136 null]
->> endobj
-10772 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F90 758 0 R /F75 554 0 R /F11 613 0 R /F32 764 0 R /F7 795 0 R /F8 794 0 R /F24 529 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10786 0 obj <<
-/Length 2758      
-/Filter /FlateDecode
->>
-stream
-x��Z[��8~�_�'��!B˖ٳ30p�evY`�뎕��:v�&��J�o��
 �ه>�e�T*�������x�{~��۫G�"��$y�]{1�� &2���{�3Jd�X2J��j���T��ë�~��otZ%^f�UR�?~^e���UҔՇ7����ŒK�?ɓ����z��S�.Vz��4�����z��۫�W
t�
��H)o��z��z)t��Q"b�ݚA[/�~s��տ�����/��6N��n��
I
	�g,$Tq/b�0f7?�Գ��[�`�M�W솮e��MM���U�;�t��veV�'jFǜP)�%#��)1�a*���
�ȏ�������޹{X��Up�8#"��AO�
�Gz����y�{�T��.��?��z��
�j�E�
.g$��9��rpΕL���G�±
�H�@%���y�X
-.��Ί�m�*��FW5>>���Ij_�k��ܢ;��7�N1��m筶�����T�N)/����]x:���ݠ��NN;�)΅�c8G��]�\����EIpZz��o�F�@��?�F�wnl-��+����Mi��

����uR��e���aE�Z�����j;w�V���n ����0�4�f�i-�U��6wMԒ���:Ka7)�3��
Z���u��%���\+)�N�u��i7�;{| �E����>�&��Y���2�H�M��s۩
T�����p�E at h��|����A�
�ψ�VQ4�asr ;��ƐY�:��^XF�B
�S�Gߝ��ݏ�=�
����}��#r85[ީ*�-
�U�ݧ�8������\y��fnׁ�_|���b�1cH���W��C�2�D��Rt�:��D����#��E�
�
8A#�a��h��#hM����

�.
5��7�&���z�����HԈ+҉��h:=�J׻�H{)@�czrYM��6��&��Xl�Ľ�" ;�
-��37�,,�@�0��!�:��l����dTu��aZ݀�� EhϞ�=*���>�/�9e�;40�kG�#����'HȜ��WR(S�/p��Ӕ
-�de���O�Y&@¾���Gj~
'�$��
!I��	�χ���)���z)GWC�d�'����lۼ�j���b��;�	��@z4���bH�
�9�A��W��3
_�NB
��k��
F$�m�q�D(O���5���d��8�;��W���=:�pp�Qí�1i6L��*�T�M��t�R	ZK�{��
��݊|o�g��T���k���>%9d 3��
�C�n-
��-
�
��bf�u���u�>���:�D�x
"�mn�9!�V�&+:4��x�&{�p�a
c{��.l��eeҦ���āΌ��1[t`�7|J:U�v�C���u�ҶH;�-���K4�v�<��$�lTj#�۞@��T���g�?�?O���i�j�p|I�YJ:���
n��,FX_ۃ\
k{�e8&c"��4$B�w�8�Nܗ�L�m�or"�2��p�j!�_�
�|[P<V�S$u	8����T[�\,�滛3*HIP�%T�
-8UNUx>N���!��YZP� �.m���ƅ0�"��EWgo\ĒD�E�
ƒHFs�A��b)ed�-
'��%ap=F��q��է w���]�Mb;Ƈ����4B����\m��'�wY�g�~?��C��h�	�" ħf�?+��ʁስ�ӀNR�k_���0lu{*~g��@�)�`���hayY@��
m�gS�p>�9d*��k���Y[��*ߊŢ��O�ť![z2Gpc�	8�l½oAf� l�@^q>2C�dt	8D�T�s�9BSʋ�aLLU�
���1߻���m����
2��n��RX�
-dx�bJ������ K�6
?�fd�D���NBN��g8�q����u���v@�QT
-6���
` Q�������<$��L's8W�`f3��d�S���B�%$�}R����҉�x3Y�h
Ό�wɪ
J3�����ֺ�^����B���A�����zNy���.�d2�/(�EM��XPY���ҕNFe��b���ORP�j at i#�6N쯭��o{ȟ1Fo��{ж���A�>����~K2�
-N��i���^/���JC(��<�����L�,�Ha�!`Dp��T� P�ʏgQŃK� �`���p�"* �
6U�
*���,�T�KwT�ԫ,�Y
H����
LY<]=/����&f�0T'�.E��-A$��-��ټ%��4���/A?^�~4��E��׳ +������<y��6��Z�Ck$n�]U��ʔ5��zG�
`D
��!m�;�alYZ[>0&0B��b���k[��F��zq#�����Aܥ���)�&�U�9��$쓐׺i�b��3�q�
�/�ޠ�#պ]�t]����`�KI��N�zN2d�.�$y�պcjLP��2�k]g�����7x�o���>�N(>�����o
��qP��¯�
�kO�2o����?����:
�%�'�)�>q�ܬȚ,ɧ��3uXB5�4���G:Y�
j.Pq徬�����	c�
�_p��:�q
	�߳q5�O���rS_8��
t�R
-�
-��{
�X�?ف�^���Ct�&�nW�%E�UXlf]
�#�ݹ�ݕ���������7�A�>!{��i���G���
 ؆���1Ǝ��>�lݝᶬ��uй58H:.��()#a�;K�1?BD�#����n��x�b+��%x����5�
-endstream
-endobj
-10785 0 obj <<
-/Type /Page
-/Contents 10786 0 R
-/Resources 10784 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10631 0 R
-/Annots [ 10770 0 R 10778 0 R 10779 0 R 10780 0 R 10781 0 R 10782 0 R 10783 0 R ]
->> endobj
-10770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 709.04 204.949 716.566]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 585.792 204.949 593.318]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 553.911 204.949 561.437]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 454.573 204.949 462.099]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
->> endobj
-10781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.892 268.921 335.278 279.825]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
->> endobj
-10782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.804 115.868 445.257 126.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) >>
->> endobj
-10783 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10787 0 obj <<
-/D [10785 0 R /XYZ 89 770.89 null]
->> endobj
-10788 0 obj <<
-/D [10785 0 R /XYZ 90 346.055 null]
->> endobj
-10700 0 obj <<
-/D [10785 0 R /XYZ 90 323.577 null]
->> endobj
-10789 0 obj <<
-/D [10785 0 R /XYZ 90 323.577 null]
->> endobj
-10790 0 obj <<
-/D [10785 0 R /XYZ 90 254.841 null]
->> endobj
-10701 0 obj <<
-/D [10785 0 R /XYZ 90 232.363 null]
->> endobj
-10791 0 obj <<
-/D [10785 0 R /XYZ 90 232.363 null]
->> endobj
-10763 0 obj <<
-/D [10785 0 R /XYZ 195.633 163.236 null]
->> endobj
-10792 0 obj <<
-/D [10785 0 R /XYZ 90 156.596 null]
->> endobj
-10784 0 obj <<
-/Font << /F73 552 0 R /F75 554 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F32 764 0 R /F7 795 0 R /F93 763 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10806 0 obj <<
-/Length 1758      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_!l at g1�wIAZ�K�v]_�&�>�E��L,L�UI^���HQ��8n�b+P���������h
\8x6��l�
� F��28�
b
�<FB��482�G��^LF��f5��޼>{���T<=|
��bF�d>8��)�~`��(�n�N\��t�� []0�B���
d�5#b4 	��hL0���2U���)����y���V��x�O�t���'��r��:i^�]���Wc�A�ު��u�zzp���R%s,��,
-U&��Ԣ��A�n#��HrҚ��Ќ�m�D�
�
<
B���µ��,��=�
-a��!�E^�fTz�,jG=+��g*7[�p��j5��ưØ�Ӽ*F�s'���I�H2�fbk�ƌ��	��f�yi<�����c�.�9° �
��o�u���iq�C!��� ��Qn�U���<Z�q
��_&Y�̨����9'��
A����䆕"쬔���P͋z5�Z�1'��M=S�uZ�=�
��Ѽk�0���Ço�E��򍴫
�t߶B#"��˸��j'Yf��y��]�\�(l�<$
�M���l(@{o�0Cq��r�2��i�^�M�6����iY�ZV�gD�p�Z�F�
���<5�|3�b���8�D�gD:$~��,
�`"�Fk;�+���H��
�߻6	ؒqRh��^�
&�7^����'/عttu��3� K�+��sRv��X����hcm���
-F
a=|h�M�����c�;�~���]Χ����"�!�8�F���$RޙBH���W�y��e��0���T].})X�c��RJ3|�3Z�Y��f�er�0�b=+Q�ۢ�/�TV�)�c�$�v�
Y?v�
������}�
����G���fܳ�
�i��j^]BY��Գ�f��I�T�֤j�`+Je9�\�۩��e��K�+��
�4S=�55q�f` ��mp�Q*����U��n�"�ij��Je�M�
>[l�hl&�<��,dE� ���[Zf�D���m��� #�Բ�.8i��t<�fjZzt�z��Q�½f��2�(pv4\

<c��P`�{Q!d�E}��O�N5,&�%�
Gq�Q��(
�R���$2
��
-<� ps�ED���]W�8�Q����1`�h� ��Ё�F#��m��i>ɖS�9{
�:�Y}�
-�c�.6�0�"���;��m:4�V����}�2���.p���p{�VPMj�Eë��8{ی�=Z�
]x���T���o)y,�$��
�����^�If=U�X8����]���
�]�
�Y{�r'�
 k�N
v_���F��)����kDmh�ч�
�7�axX�6�|�����d��.��w��(
m�T'z(No�]3	j��f[�:�C.2���c�n

׏�]�ۍ�����U��dn���G"�t5ߣ[��J1�a����/��lUj��ٮ�"
j
f�e��Q砃ј�y�4GM�Dw
Z���eb�F]�SX6ꫂQ(7��[�PA�;P���wE��$t�Ț��q�l�~�'|q�y�����Iփ����X}3����;��~�=]�N����!�@n۠�-v��OI�n������D
"7F}�4�I�4}�[�o>�s����,x� a��1�w��S�B$��
�i��������J���Z���$_����- +�,���@>U�7�^;�4�ܚ>�$���zuV�������R�F���nr
eGwZ������r�4u7��/����
-endstream
-endobj
-10805 0 obj <<
-/Type /Page
-/Contents 10806 0 R
-/Resources 10804 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10631 0 R
-/Annots [ 10793 0 R 10794 0 R 10795 0 R 10796 0 R 10797 0 R 10798 0 R 10799 0 R 10800 0 R 10803 0 R ]
->> endobj
-10793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 283.973 177.053 294.877]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) >>
->> endobj
-10794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 214.115 179.543 224.645]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a061c4c3b4f1eef970794b274dae62504) >>
->> endobj
-10795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 173.708 179.543 184.612]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a5cca0390f76c0a92703e65d3707f157a) >>
->> endobj
-10796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 145.631 179.543 156.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_ab8bee5e53740adc193668686030bb4bb) >>
->> endobj
-10797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.881 145.631 254.811 156.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-10798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 117.553 179.543 128.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_aab939414cdbcf1ba174334859443a72c) >>
->> endobj
-10799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.881 117.553 272.514 128.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-10800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 89.849 187.292 100.38]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a517f4965fd423413531cd1d2058748de) >>
->> endobj
-10803 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10807 0 obj <<
-/D [10805 0 R /XYZ 89 770.89 null]
->> endobj
-10808 0 obj <<
-/D [10805 0 R /XYZ 90 721.073 null]
->> endobj
-10764 0 obj <<
-/D [10805 0 R /XYZ 90 704.16 null]
->> endobj
-10809 0 obj <<
-/D [10805 0 R /XYZ 90 704.16 null]
->> endobj
-10765 0 obj <<
-/D [10805 0 R /XYZ 121.143 623.078 null]
->> endobj
-10810 0 obj <<
-/D [10805 0 R /XYZ 90 616.438 null]
->> endobj
-10777 0 obj <<
-/D [10805 0 R /XYZ 90 576.706 null]
->> endobj
-10811 0 obj <<
-/D [10805 0 R /XYZ 90 572.223 null]
->> endobj
-10812 0 obj <<
-/D [10805 0 R /XYZ 90 516.053 null]
->> endobj
-10813 0 obj <<
-/D [10805 0 R /XYZ 90 483.051 null]
->> endobj
-1205 0 obj <<
-/D [10805 0 R /XYZ 90 408.511 null]
->> endobj
-354 0 obj <<
-/D [10805 0 R /XYZ 90 401.797 null]
->> endobj
-10814 0 obj <<
-/D [10805 0 R /XYZ 90 302.973 null]
->> endobj
-10815 0 obj <<
-/D [10805 0 R /XYZ 90 232.826 null]
->> endobj
-10816 0 obj <<
-/D [10805 0 R /XYZ 90 232.826 null]
->> endobj
-10817 0 obj <<
-/D [10805 0 R /XYZ 90 203.014 null]
->> endobj
-10818 0 obj <<
-/D [10805 0 R /XYZ 90 162.982 null]
->> endobj
-10819 0 obj <<
-/D [10805 0 R /XYZ 90 134.904 null]
->> endobj
-10820 0 obj <<
-/D [10805 0 R /XYZ 90 106.827 null]
->> endobj
-10804 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F39 2320 0 R /F110 1507 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-10830 0 obj <<
-/Length 1759      
-/Filter /FlateDecode
->>
-stream
-x��X�n�6}߯P ��,͋(R��@��uҤp
����z�j��������^�F_�}XJ�F3�3s��;{��^���.�bG4�nV^�=ƈGp�����8����'�&�tP���Z-��ӛ�J�����f���*����b��3���4�zY�-�I��U�)��y�Ե
^��%�WE����g!	>޼��|3�<#�+����#!�t3{�{K���È�һ7�6^H��޻��3����p#<���Lz�D�
���|�}�{?�~V4�v��s^]�	:���l�JM�Տ>`�Ӳ��`�Rğ�U�d0�i�
������}��9���"f��@�PJ)�B���?d�z�V���.
{���^AwU�5K���h��I^���0
-Cv$��%�b��~I�0�ၙ�( ������ ������1�!.Eg�a��d�b��<`PExg����  #�Pb��4�hݲ��]��(��ꞛoL��v��+L"ѥ��9����E�KK�Μ�1�i'�g��:�t�z
��k"A�}��
�����
��%`�(�R?�����\l�{��Mp8T��w8 �u����!A,��9P�=�A[p��R5I��%�I%\�i�mM�<6
����[� ��?��;G|_HN�A`	;�ϖ�Ȋ;{UnU�40�s��>(�a
�c_�b���=�l3��&r)���w2�bR4�unX�`���/@��*�v)��r(������H�g�M�/��~��
���6��
L�a'R�Sd
em
-��qBU�r�vYn��w���(�#o�0�C�o儠���@ma �cF���
���>M
W'�I.�n��2+�<�nH/.�aOʐG� Ov���+��jsk� �E�8ty�鮓�'�hR`�|W��{{ WC#\�5%
-�z�S$O'�%E��;mi��(b"�?�hS֧��QP�!�U��.P`o*��
-I�bₕ��\� �5��=�"�#�$
Dz����z�I���Z,Z�4
��2��<�9n�/!����A�<q<=�=k�D
�H�M턇& �{V4D
���Te0��TC�����_ݬ�U����H��8үX'	�M�
̄�
;�%d3h-@���|߀~ޑ9>` ���
@b�,h��'}�X*�
,{�t9�_+���(1A��}e$��0{a�+���5s��z��ݦ�Y'�s;T�wI���^���J �
�D oE4��!�ٯ��V�z� ��/-%�zo�Ĝq
ـ�rQ���Tr} y!t6=E� i,
��}C� 
��	9���
LEؿ�lt�Z-U�=�_g����u�pț�.���M�Ƙ.z=ȳ
���WYI�8s�wL�	a+
�7��ʓM�48��
�
q��f
ϴ?�1.q�Q�
k5Ū*7wVe���b�)��b,&�=��3�6:�
�ns�^�
6YԊg�C����Q�qE�#$���x�Nq!s�
c.
�a���)�UF
�0t�'��8$�<	��3;p/i�@��c;`�����jsTe��).$��0�
��M��N��&���[�Ƶu�>"�-.�!��}�*˛�N��+��"�wK�J�aǀ�l<=k�q`�Љ
Ƒ��脩K��3��'��C��P�����P ��%u����U���&���M��m�s����
PEZ� hV��w�]p���^;�uf�3؊�i(���M�]�����j
-t�>rq����u��MY���nn
pQ[Em
9֨�m& ���i`"���`l
�/�g�6�{YB��s��N�
-endstream
-endobj
-10829 0 obj <<
-/Type /Page
-/Contents 10830 0 R
-/Resources 10828 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10838 0 R
-/Annots [ 10801 0 R 10802 0 R 10821 0 R 10822 0 R 10823 0 R 10824 0 R 10827 0 R ]
->> endobj
-10801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 707.957 163.215 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a7e6d252ce9557b9d73833ef594f6276b) >>
->> endobj
-10802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.552 707.957 256.185 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-10821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 653.124 163.215 664.028]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a1e1a505b4cd4a4ac97d3a38864bd3977) >>
->> endobj
-10822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 610.246 163.215 621.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a553c3b19a36235d228039a6bb3452918) >>
->> endobj
-10823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.552 610.246 238.482 621.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-10824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.821 426.274 440.832 455.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-10827 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10831 0 obj <<
-/D [10829 0 R /XYZ 89 770.89 null]
->> endobj
-10832 0 obj <<
-/D [10829 0 R /XYZ 90 689.83 null]
->> endobj
-10833 0 obj <<
-/D [10829 0 R /XYZ 90 634.997 null]
->> endobj
-10834 0 obj <<
-/D [10829 0 R /XYZ 90 557.705 null]
->> endobj
-10835 0 obj <<
-/D [10829 0 R /XYZ 90 395.845 null]
->> endobj
-10836 0 obj <<
-/D [10829 0 R /XYZ 90 370.097 null]
->> endobj
-10837 0 obj <<
-/D [10829 0 R /XYZ 90 370.097 null]
->> endobj
-1894 0 obj <<
-/D [10829 0 R /XYZ 90 156.255 null]
->> endobj
-358 0 obj <<
-/D [10829 0 R /XYZ 90 140.291 null]
->> endobj
-10828 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F39 2320 0 R /F68 3032 0 R /F110 1507 0 R /F90 758 0 R /F117 2446 0 R /F24 529 0 R /F8 794 0 R /F75 554 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-10847 0 obj <<
-/Length 1208      
-/Filter /FlateDecode
->>
-stream
-xڭV�n�F}�W�CI \�\
-m�&��I��j�`E�%6�T��}g/�D�
����;�gng{k{og������y	J"y�/�^�$"�ʽK�q|Y��X$I"�2ۯ���|�iy��fo��o3G�#V�@�����
�r�~�a��ݙK[�S��w1�s��Dx��D�}�ڨ���*SAH��"]7��~�ԍ],"��٦׋���Qy�^(VM����Ϸ��ڪ�K���������6y���ߥU^�fn��qM����VBcD��K�-�6�HF�0s�pm{I�qr����ܰwFT��{;H��c��k�g��g�3��b�
-b�,2p��G�]�Ʈ�vU���>h�$$B�I/daέ�+J�Hֻp��^4�.-m8��u���ڔf�l�lD�4릚��~Ī� kg���G@'̓ :�4�(��
)33�Ok�Z
���ѿ�*��G#���A]�ix��3�4�%1�
�
-3c���AU�w\�
u���M�P�#��
��?�_�ڮ�e
�!�w�(E')�aP+�S�Y�� �#��SեE�r����͚�V��` �9ȱ�o+���Ơ\��
fV�m;���u�ۮo&�
�@vGT@�� U��f�>�Q����t^g��Q&w����>�>֪RM�_hɦ�N���eYk<wE��]aLK5��}�rD9����%�l

%pn"5��
-
��P.�
���".�T� ΀&s�0$d<t���p�#

�ő�
�,F�����-���@�Թ�
(�#h�#����l.��
-x�_����*D�g��)G1K�8��P�-�P:�
�'
��b�L��$�
�XG����B�@��V�2U.��|R
3
-��� �J��뗏'�_�2ZZ\�
-B
-�iw>�xO5JO �z���x�W�t�U>��іx��M�x������#�t��:����~�0��eʅ��S�s��:����*+w��7a
��7��q��t�Zמx&z`���诽|��I�8�c
̈́$9�	���a���3�5$��!�1����?�b�ܰ����N���N'舢���N��<F"�� �I
S7��׏
��
:L��/�+���� A$tx0������]�ժ�g�h.I?��0\�qŶ٦
�'Af�AAȠQ^���,����g&�� W�v��t����d�[��Z�
:뽢�
'�������u��R�ͭ�4
��+S
-endstream
-endobj
-10846 0 obj <<
-/Type /Page
-/Contents 10847 0 R
-/Resources 10845 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10838 0 R
-/Group 10826 0 R
-/Annots [ 10839 0 R 10840 0 R 10841 0 R 10844 0 R ]
->> endobj
-10825 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 10853 0 R
-/BBox [0 0 404 212]
-/Group 10826 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 10854 0 R>>
->>
-/Length 647
-/Filter /FlateDecode
->>
-stream
-x��UKk1��W�XeFoA��P
-�
�z98~�������^�MjJ(�I4������l ���0�#x������pW+������
������7u}�6�> [�
��,�3�g����K-��28=�)�{s1�4�d"�dfT��f�b�U�-,�*�s���K@�`�WW��
˝�~��TB�Ӕ�9!l�VNW��Ks��?D&�T��`�pr]u��S�gV��ܔ�Vc��8��Tn��"i'lNo3���8̜ ,~�Q�
Gg�8[���Ȍ�d����-ީ]�<E��^z*����M��̆���F��%
�;z�)����
寸����� ��+
%�0q�5:�����f�й�%]jLy�_��7�e��[��Um�A��%�!�F�2Pb���Uc�*M�9���u/A�6
�I
,�'~���X'�m"�fY��A���L:�x��Y���S�ㅁ:�����c\��q�yI��n
��v"C�A�!Qx
�{J�b�h�� a
\�o��Lk�cP��1��8j��es&��|
2/|�p�I��?ΚT�ݵ{�G���:H�.Ƴa��䵵��*�,K	|Q�L����0�c��6>��V
d�w�r��F_�,�eF�1��c����~OZ

-endstream
-endobj
-10853 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-10854 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /NJRFXQ+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 10855 0 R]
-/ToUnicode 10856 0 R
->>
-endobj
-10855 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /NJRFXQ+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 10857 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 611 584 278 667 500 278 584 556]]
->>
-endobj
-10856 0 obj
-<<
-/Length 10858 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š�:"���E/��br�j
�Y�����*(|�K�GN|i_Z=�,����heè��e�[I���#�25�5���I�(v�ݶ�4�z���f�
.����Y�==E����*�������ï�n�M�W�DM�
�ݫ0ob"��c�\|\��+����
��3�HrV�!�
-}��N�ӰzpO�V��Y(�y֧s��$E�xJ=�
�y�RP���@%b�*����
:#v	P�A9Hz�C�X�B�0��)�x�:dr�U����@��q�~e
-~!�

~y	�_��9��p:�rL��W���:�eaN�U���pw�����
y��-�_W�-����
mf�W��ܣ��
-endstream
-endobj
-10857 0 obj
-<<
-/Type /FontDescriptor
-/FontName /NJRFXQ+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 10859 0 R
->>
-endobj
-10858 0 obj
-356
-endobj
-10859 0 obj
-<<
-/Length 10860 0 R
-/Filter /FlateDecode
-/Length1 2672
->>
-stream
-x�UV
L[�>�������e
�׏����e0N�����	C���	$M�l��)jC��i�nٖM�ԭ�ZiӴfڴ)�6MS'���R��ljR�n�"���kH2����������JI%-��ڃ��
�}�B�氺�������<���zt"2�/�_���{XsF���S�^�4;��V�������!_�
-�&�����
�	��/ƙ��q�B�����̤1
0��A'����Fy'��� �A
#��TUTc֘lz�hs�-U�M��
�֙�R��6���:S��K7�J�Sς�1�#��
�H*���S���N�����R���)��D��b.Q�jm�F����ݪ��qkz�Y_Q�
��F�3���
���,����A�@�Dw������]�Yɚ��*zC
KAnNvjF�R����TXk���v��9jk��/7lچ9�
-pJ��h3Pw(�-m���/Y���=�
���g��=&x�)�=�-��C{o��
�.�w��ĝbgr`��
��R_�����{�w�f�������ą(���n\]�و�cib�J8?�Ź:�]��P�����Bs�O��-.���v��>f\��3�i�ro���pd�뢄G�
��՗B<���;]�B?Av�8����7S���g�*�E�FM^af��c�s3�|*C~�eIQ�ĉ~]Z�p5[Xї�*[��`�owρ �v�F�_ي����V��kr��W
) �̤7���Ee��ǠW����Ψ�D�U�Is(�����gc��t�Zh��yߝ�
-���'�){���U�R���x�ϻ�3�a����;��o�(`�T�v��9=}br��'�
/ﮪW��xq/͖�熆�C�8�G�1z�
[�`���F�zl8������W�j���̎W�A$��:S05���	
2!�Ery�i���1/�ڇ1w�LENF��}�aX��� ����
�μ1�F?����%u�����g�s����^��������q=� 7�M�dL�d@�<4J�M��3��'&"-/�&�����¯�]����=bS2_���u���J2��
��Z��h�U�wKG�t�n�7؟�X#�̫�h�
���@LE�(H������]��� S{�W�)�U����
zBo�G�T�9������:y�ۓ?�>���������Y��W�
��oc�I͛Y���r.��Bi-vO��;-����Ӌ�
�谫>>6rh���Sg.�%�S��[��|��n��F���e1�-E0�#}4?�
>yb|�����Ѯ���dz�CMf��������
O�9�#u�&��u�F��jz{6<��Œ1���?�I.W��ʥ�FF�S�
���W�~�
�o�|z2G���{w��!2�I�}k�����3=����q�2a��;F����w}o]���˵(�"T<2
-$[!t���b�����5Q��,~,��Y�8h�M�7/�t�Zͮ&����߇�������c���U�*{�
�}nG	buؖŽB�����N'�ْ
^-�Ʉ~Z���,U���ٟ��ŤذS
�ۏ
���\㲖�dh�mM]���PUi�Y��z���$��O��/H���DAgv�/��jʜ�]x���G�؀�1��+u0�d����-�����B�jy�n6+)�����z�P(n��^�w�
ҋ�Lhe2�|BO��l')�
�)|�^Q"��$���*�-����|
-��
-�#
��@����B�r�7-t
�%�!������GT�Hr�nw�G��d��U�������5�?,U)?O��F�l��X��H��?�Q��|s�ᯘ��
����&;h/�*ܤ�U'�/%�]':<c�T��@��bvR=���g.��,��D�=E�
�H�
$���X��>�+�s?�l�qo���b3���C/��q�A��a�7�M
-�
-��W@�A�>e7��lJ�@�	��U- �V�ߤu�
ѧS!�z���c��{��G�
���M�H�� ��;2
-endstream
-endobj
-10860 0 obj
-2009
-endobj
-10826 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-10839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 405.292 176.027 415.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_a3690915d5c30a08607ade652aa157cd3) >>
->> endobj
-10840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 360.322 184.244 370.852]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_add9a15bae9fb3c788a0ae526ef65733d) >>
->> endobj
-10841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [129.681 109.582 163.763 120.486]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-10844 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10848 0 obj <<
-/D [10846 0 R /XYZ 89 770.89 null]
->> endobj
-10849 0 obj <<
-/D [10846 0 R /XYZ 90 432.45 null]
->> endobj
-10850 0 obj <<
-/D [10846 0 R /XYZ 90 432.45 null]
->> endobj
-10851 0 obj <<
-/D [10846 0 R /XYZ 90 385.745 null]
->> endobj
-10852 0 obj <<
-/D [10846 0 R /XYZ 90 305.733 null]
->> endobj
-1895 0 obj <<
-/D [10846 0 R /XYZ 90 189.605 null]
->> endobj
-362 0 obj <<
-/D [10846 0 R /XYZ 90 172.334 null]
->> endobj
-10845 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F24 529 0 R /F22 2996 0 R /F75 554 0 R /F11 613 0 R >>
-/XObject << /Im13 10825 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10868 0 obj <<
-/Length 1895      
-/Filter /FlateDecode
->>
-stream
-xڭXY��6~���S+5��HJFQ�m�4=�m�E�"�ڴ�F�\I�b�}��贼�y�)
ù��`���⇻��K-��$���n$4Њ�Yp�
ޅ���+F)
o���iuL?�.9
���`�U���J�����񔛣)����b��k�d�6�öܯ�?��67Շ�y�_�}���K�7
�����[�e�
0�E��t>�����K^��QLb��c$����Y�?�i]{�w˄��K�gޘ���,M��Sq"D("a�.~�[��`@��)4�D���x�7
�0�K@�H���m:�o,��6�Nl20��?#/)h�J�r��h��N̵c��t�����(�8�'�EV��$�n�`��s8q���^� a/#�*�����N�ګV���:��:"�	�:In��K
������ws����s��.Y�
-;QS$p9�i�i��\N�ZN�=����"x��$S/�N�����T�
p��N��ۉGCF�&L��R�)3֌H�v�'�9z�W�2߂
"�įY��
XbW�� ��T�"���#
�@�h�+Lu�4e�>d���R���>��wh2�o"�����5�p�y
��?eUsNsOދ�mq㌉
[��e�*ܗ��gh�c����Eil��I�58���_�(�) ��9�7��6��ϖESN��)cΖ�r��_I�i�)�Id����$<UYYe�#���?T�
�ɫ�СI����$�2�-rǓ8]��P�'��S�AY!

�
Ӥ�[�
So��d�d���%0���)6m~��,D&bRX���y<�"=��l�@V�_&vC�:�$
�?�ޭ�I��/3Kl�U@
-�9A�wIa[K�X^�j"l
W39I�ׅ�,�
}��t��G��_�+���ɾ����8�{�
28w�a�
*!�}4D��b��g�
pH�n���2�[*#\����FR<�3���0��(b����+>M z"  
) �+.�!�ؗ�@+�]>�`��j_(��
鑓_-&VW
-
~�-��I�cVl���=]3�V�ԍ�b1d��������>]\ab�2t���6����w� .�$_Q��qk���
R��j��0��րj�AM%���SP�*��ԛ!��Y�T7�p(k
j��kX��T0R�s�~��/^�\���	��C�5*��y�y�v�P��2��ت
y����0��۝��B��C�™-�P�s�H�t1�:�
r�b
����
���!�
�p*��iO5K�t�=�\�:�
�R�tn��y�{�6���_���#����֞ ���NLMZ�8L?Z�n<�WyIq����WZ_�:�����d�<�8�dz������
I�3�~.�Bz .�V��ҏ�%�"# =��?F��+	{�YЀ�;�r�s(w

>ϐ�t!�+
1�j�O�0|�5 �(��]����j���
����
-�����"�O�oi�뎦9�����@�s����NL���lVҰ�(�K_�����:㤖(J;H��"v��E.jv�� Dc��*Ӝ�����6έ�{S��п�V��&�҂����N-m��V��?�|n?
�<��.k���������m�[Zm���O�ؖ!e(� ����ա���p�E��@G�8�l���m�����8�M��3��O�<
-�s�ir4D^���pa%5�r�|n�͹C��m�-ys��a0�>�=������Ϳ���D�]�#o�o�4<7�����U��n�O��
�����]��>���f}{n_�4��D]�����������
5�{Zt�	�pBԘ��ʈ
MLSo�A�=��G�_}&�Ya�ƥ��ܡiN뛛��6Şl@�8v 4�:
����ʴ�Ǵ]��IʈR��>�Q�]1�ow���㝘��� {l�
-endstream
-endobj
-10867 0 obj <<
-/Type /Page
-/Contents 10868 0 R
-/Resources 10866 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10838 0 R
-/Group 10843 0 R
-/Annots [ 10861 0 R 10862 0 R 10863 0 R 10865 0 R ]
->> endobj
-10842 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 10875 0 R
-/BBox [0 0 224 234]
-/Group 10843 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 10876 0 R>>
->>
-/Length 503
-/Filter /FlateDecode
->>
-stream
-x��UMk
1
��W��#��؆��B(zh;�C�a�)%	4=��W����Y���
e�ճF~�l��7eG�����F
��
O� ?��p�E��^������N~_��-�F�+Bx�d
<Be| 
-q���|Q-j�P{�h`m%)�G�٨
0e֌]a����ݣ��P�fRQ�����Kt40=���Jo�QݼADJ��֤�9��͖S8�di9al/� �
-C�˞XC�-�nM~���v�[��q1�9B����
�9�����Q�0K@�ܢ'����d�:k�m��̑d+A��-
�޾m�e�8�YZ+���z��zu��/���϶��t�ز��U_պ�2Ҝ
-� &QQۖW�P!��N/���.ڵ%h%Ѿt�:�
�_�}��
z(���I�]��&b+�� ڢ8�Dl��z�)O�
�
�
�������z0嚉m̷�	�˭D����,#c��k�<ct�2�>�̚U��E$y]9����ȃ��m�:~�>��n��#
-endstream
-endobj
-10875 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-10876 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /HMDHZC+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 10877 0 R]
-/ToUnicode 10878 0 R
->>
-endobj
-10877 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /HMDHZC+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 10879 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 611 584 278 667 500 278 584]]
->>
-endobj
-10878 0 obj
-<<
-/Length 10880 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š�wD(Ӎ��P���uF�1Dg��7�)TP�<���Cn|i_Z=�,����heè��e�[I���#�25�5���I�(v�n[V�Z=�Q]��Ӊ�j7vxVsOOc,~��쨯��}���C�%Q�0E�k�*̛����|l���u;:�_��f���9F����IV�+Eu➆Ճ{�����g	l� o��r�ʓ�HO����2OU
-ʡ)P� *��@tB�3�
��ԃr��.
-Z�B�0��)�x*9�U��C>�|8�#_Q����@!_А/G�|y	B�
Ss�K��ȗcj�|U8���C���%��گs߽ǮȻ�nM�����7c���a3����_�g�
-endstream
-endobj
-10879 0 obj
-<<
-/Type /FontDescriptor
-/FontName /HMDHZC+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 10881 0 R
->>
-endobj
-10880 0 obj
-353
-endobj
-10881 0 obj
-<<
-/Length 10882 0 R
-/Filter /FlateDecode
-/Length1 2596
->>
-stream
-x�UV
l��>�:v^&�ؿ��y�8q�&��@B�v�N
vI���R��q��B!�(Ck�$ԖB[V�ۺi����VMS+MPm��N��nZGG�TZ���P~`N�}������ FD��J��%bsl��e5`�ē3�&���Y/�PZ��M����_���1�c@�=�����/�'
m����D�Yb�Lr_���"�g�?��
�c�q�('��Xs��O�%� ����f�
s���&�W��Je7��(��C��IW�
v��e��.��Q�����q�9�
^�����5���
����ԏ�8դ���[���DF��2K���I:{��R
ws���mgn��L�ity��<��ܦ��pfg��U��Htp<;���|���|�c��mM�p`�`o������S�Y�[�+���.��� }fN�VWXhvT9�_��D��zg��P E0�C��$8%K�LvYX[$	�wT�J�׼�I�s���(k0���sl�bU[f1[�h�3X���Ut�{#�&�;]p}o}M����Ky�M�|���[k5���B�=uq!�d����7N�\��X�Zf
-��!	�X�$���Z�t&3��q;X��©ٹ����P�3�c�[/~�k/^dY��_$c�Ya����e5�d��r��7S��>�z�GG�`�J�0��4���
Y���X
�%���
ׯ��Yק��y��4O�S�2�~��lX㊽�Q�:W�m��
fӾ�XH�
_R��PlW��V!g|5Q1Q��l���T�a�b�ڄðΙr�YkÓ�H������$z�
$�4s�����w���S���������:�Ѷ{(�g!��
���
-��G5�qþŠ����-�
x����$h�_�͵/}���^�77:��
�&��%��
-nm���W1��N�rj��/��=��O�{^
-��
+������4>/8ȅ^
��3�;GļR����:?z">��w
�����A�v�x�̷F:��ɷ���ѹ�M�[um���A\���q5~й�07�G��� &k���!(ã���3�c���Z�W!E��O���]�4���?xS:_�������;ɾc[�Hx��u 
�ڔCl�~����K-�¯�]o
C�l� ��G��]Fk�����0���������U�����H�:|���̮��L��ۓo|w���g�3��sq>��C�q����y�ȡ���1t웘}5kVSU�%3�c$�����H�\tz�ԁ��5&��8����Sg��Mǧ{o���
-��e�G6��8-eA0G�h~~9v�������==c�����G��}���{������F��޾��j"��{bVW
�5ݓ���M�c��g�?�fS��
b�ʳ���)H����z�5�TB�
��N��
o��eDf,��sygڶ3�7�I���TH�����{���~u�
-�T��D����(\H�.�2K��]�$��jf
q�H<y$�s�j��Ӵ��e�������&�'��
�K卍�s���7o�Vެu�l
�8���
8JX��z�	6�8P�t�JY	K'��:O���
���^6����6ɡ����n�����e9FsGs�P$�-/��� R�ʹ�C����8��'K&�G�p���){AS��3�%.Ur�k�&i=N��V�žE�k
��C��&bj�
��2C�|^�J��TJ
ܪ���պT�#�g�T�a�g!r9��
7`
X�'nx#lK�
�s���b*Q�����:���Y��%���f�Z��Tj��e��Ek���V�@#ڏ�\٦�lu�ᯔ�C��U�uTÂдQ'�K�A��>&?�G&�1FU�BH���L��	�:h�i��sJ�/濧0�G#����FXg���
˜kvͤ!3�P�eȢ�R��m���I��o2�U�@=�gl����ĝ
��\
:�u���]X�{x��|�</�u꒥�m����W�٫�eQ�� !*?
-endstream
-endobj
-10882 0 obj
-1956
-endobj
-10843 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-10861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 393.234 170.687 404.138]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_ae5713be75588690281277d5fe7954a34) >>
->> endobj
-10862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 365.007 176.027 375.537]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_ad7aedf33c2b21bb5c7d9c3b441348e87) >>
->> endobj
-10863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [129.681 255.378 163.763 266.282]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-10865 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10869 0 obj <<
-/D [10867 0 R /XYZ 89 770.89 null]
->> endobj
-10870 0 obj <<
-/D [10867 0 R /XYZ 90 412.58 null]
->> endobj
-10871 0 obj <<
-/D [10867 0 R /XYZ 90 412.58 null]
->> endobj
-10872 0 obj <<
-/D [10867 0 R /XYZ 90 382.246 null]
->> endobj
-10873 0 obj <<
-/D [10867 0 R /XYZ 90 335.292 null]
->> endobj
-10874 0 obj <<
-/D [10867 0 R /XYZ 90 273.993 null]
->> endobj
-1896 0 obj <<
-/D [10867 0 R /XYZ 90 69.164 null]
->> endobj
-10866 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F90 758 0 R /F24 529 0 R /F93 763 0 R /F75 554 0 R >>
-/XObject << /Im14 10842 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-10891 0 obj <<
-/Length 1197      
-/Filter /FlateDecode
->>
-stream
-x��W�n�F}��@�C�v_�E�{��k&��`�,
m�,�Y����j�a`�
G��<Q at wq����;���׋�׋��9�8�['�N�#$�K�K�q�}^�uX ���=>��������~�x�^|]x�
b
J')������F,��}��t8ep-���o
l�`D�6��"_��H�C�[B
����O0��ʣ܍�2~��� I)��
GO�b�0
p�  F<+�Q�.<B�o�63(��

-v �#x��4q�����\�)��*U��m^W��^�&^�n�:[.���P�C���K�^&�
�,��<�W��%
�{ZĻ�1?�[��O#	է�O��4�T��Dux{���x�Y�� �
-n����-v��Uj������6�����sٽ'���}��E�W���K�{T�w
��̣[!�>���#��BP�J�}��JH�a�`(�\�F�a�W��E��m�6�?L 

��Y1�["N�E&��7�F5y�wQ�y�5qiC�c�t��Wua�m�8KB�5	'
��	�����
-

Z9�("�aQ�p�	�T#�pd�blw/����ɛv�����d�������y>K&�5����������Uި��}���`�
-C��L�A�B�>W����3Dx ��9F_a��<
-]���6� v�@``
t�1��G�$����#�^�<s�
	�ޑQ�S.:2Jn���6���iw����6��m�G��Rp-1�
Z�fsk3y�7�>.��>]O�H����˄�
�s�2��9�
zV��q������Yz>#F���vcX�0MU:��	���
����$
-���E�g���s

?S��ɷ8wTl�Z�?��X��}��:�"v$�&�iN�A֑Ӄ
-��&S�j�vH{S�Gu���������d�PSA<��D<O3�p̕vtB��W�QH�����G*BA#��/1Ri_a ��L���ja:TU�ʴ=77Q)��x(R���)�N�5Mf'm����3�#���r:��tsd������K��Z�W��m�n����o
1t�����$� e칿&��<�֐�́IR;s
�Gf֏
�p���ÎP���I��용,�V���N5�{B�Vq>��pX��]K^�ԋ��
B樸P=i
�/�w��#<�#�P��M�n�''7�l��
%�l�w���OC�-�F���e�����
pz

-endstream
-endobj
-10890 0 obj <<
-/Type /Page
-/Contents 10891 0 R
-/Resources 10889 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10838 0 R
-/Group 10884 0 R
-/Annots [ 10864 0 R 10885 0 R 10886 0 R 10887 0 R 10888 0 R ]
->> endobj
-10883 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 10897 0 R
-/BBox [0 0 222 220]
-/Group 10884 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 10898 0 R>>
->>
-/Length 461
-/Filter /FlateDecode
->>
-stream
-x��T�j
1
��)��H��Ň�P(��v���C�ͦ����׏�g���ͥ�Bf$�ҧ���z��@�`"N�|��"(��=�]#ܿ�����yU��}P�W�a���:x���(�0h���U��(ԁ8���#��I�E&�@f�0U��#�5L�7�J:����u�B��I��&�P��w��"R��H�'��lm����eKc��A�
-c��+��\����1�	�m��<�
-v�
'���\�c"���0o��vR��솞�vX���l=��"�x�m �
-7Z��4z�i�8/Yz+
�����y���vk4��ѻ��Nv-�f8����:�v,s����y�9�2�R����R#�ɤ��R���������������
gmJ7�/r�S��)�M���X���'!.E�1
-�
-��������$����
�܁?�Ġ]��8�fY�� 
v�9�ߨ��
X�jy
-endstream
-endobj
-10897 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-10898 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /YQDYJX+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 10899 0 R]
-/ToUnicode 10900 0 R
->>
-endobj
-10899 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /YQDYJX+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 10901 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 611 556]]
->>
-endobj
-10900 0 obj
-<<
-/Length 10902 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Šq��e�q�j� 1��
-5��,|�Ɯ0�>�=לܤ��3���w7˞V�G�
-��Ib]G��Q���[N�&�7�۲��='M��/.����I�=$����)r����ץǧ�f�MdV�%m�i��E�W1K���)���v�����slIΊ+$9a��4�_-k�_mBF����A�o�B9��YVfm�<P�A�@u*�)P	�U�"� 	zD�3�
�$@%h  ��]�؅@qg:�I�|���W#����
���|�	�E
�
-d��WT ��p���A��>eys�8\�0�}������]���d�O
-endstream
-endobj
-10901 0 obj
-<<
-/Type /FontDescriptor
-/FontName /YQDYJX+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 10903 0 R
->>
-endobj
-10902 0 obj
-333
-endobj
-10903 0 obj
-<<
-/Length 10904 0 R
-/Filter /FlateDecode
-/Length1 2284
->>
-stream
-x�UV{l��?������]��88N
��~�B�8Oǎ�.
q��R��q��
-� e
�R'U+)вi[ۍV�D�J���R���6�OՇ��Nb�#l*�D�im>�w?'���{�߹����~1"*�.�Զ7�^���†�
�
���g���Q"�o3����	��+<��=������2���|�h��_�l~o�(y��t�l.}h����Wz�&�
%���*���$��X�0:F�N�g3����j� �\r���@�1����F�Ǫ�<~��������	֚}\
���\檉E�/�j��C!X��TX�6n�F�����j1�%O��uֺ���v�:�6�u9k�%&�ӫ�֠�Jz����iu7j�����jS�[��6��miߪ���V���g����W���zw$�os�T*J6�5ڪ*����&�3ؔ�t��8B���tf=��)���$���D���]na����/�n�CR�L���8�Ś�����E_�6�M��xG҃�@qມ��b-u�~�	6�	�
��X��p��݅��
i,�^�x��!%�u�&���@v�"v [...]
-6|B�v��L���Jcjc��X���M��>�u��������8��*Ɖ}]&�w�"�cŞ�i�����-û�l.Ж���W��5D�僊�n�
��f�!�wXm@��LqzlV�C8
��ǘ�9>�L�?6⇹��J�|��Xb���7ܡ�]{�a�+����ݏ�Y�x��
-����S����o3� �NTo
Վ�����L��l(����D�z77�����
�B���
��'Sy��r
�jDl
��w,#w������
�ϭ���~���=��8Vos�{��E|~Ġ
rz�gT:G���4�͹?��l����\G�:�u�
�#���u��ɟ�����o��S
E�"�!��ma��(���K%Ӑ�|�6.��Ԇ��&{�
Ms��^L��l��}鮟*��O��#��O-��ʷ�o��T��B��N_Y����;ڇ��힮(B4h��l�-�np^_X!�_]o�C�n�!��O�ȻL�ʊ������8ׅ���&u_I��=
z���H�K��#r8˙S%ٙ��7f.�8���S�����
t���	�6��>��8dε�Y+U�����Di�7���Y�
������96
��OM�?�gn���
S��Ԡ�V����&��W�O2��\ܖ�0.Gvo}~=~���Tg��������G�Ng������ö�K'~�
����v5%�F'�vO
�>���ͥ�r�
�a��/�P��r����	�hX~
e�Gֱ� �1��@��X#�r��1�V����Ε�E�A��j�$b��dP^Do�صp}�}8���AoK4���?�e�Ũ�Ą��)���x�F�����P�H����	-u*s�b_�W����R � /u����|�f3A�5`C
+�����V�=1Y��k^��!���ڦ����
��5_���RZ [...]
-endstream
-endobj
-10904 0 obj
-1709
-endobj
-10884 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-10864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [129.681 668.355 163.763 679.259]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-10885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 320.736 188.4 331.266]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function_ae0f59cc4089db649e630a00531827ca9) >>
->> endobj
-10886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 287.039 176.027 297.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function_a2e8f64e26c1ae0aba841b4fd773fff2b) >>
->> endobj
-10887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [129.681 204.445 163.763 215.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-10888 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10892 0 obj <<
-/D [10890 0 R /XYZ 89 770.89 null]
->> endobj
-366 0 obj <<
-/D [10890 0 R /XYZ 90 721.073 null]
->> endobj
-10893 0 obj <<
-/D [10890 0 R /XYZ 90 342.257 null]
->> endobj
-10894 0 obj <<
-/D [10890 0 R /XYZ 90 342.257 null]
->> endobj
-10895 0 obj <<
-/D [10890 0 R /XYZ 90 306.826 null]
->> endobj
-10896 0 obj <<
-/D [10890 0 R /XYZ 90 249.043 null]
->> endobj
-1897 0 obj <<
-/D [10890 0 R /XYZ 90 148.451 null]
->> endobj
-370 0 obj <<
-/D [10890 0 R /XYZ 90 138.225 null]
->> endobj
-10889 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im15 10883 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10918 0 obj <<
-/Length 2019      
-/Filter /FlateDecode
->>
-stream
-x��Y[o��~ׯ P�G��޹4�MZ�p�)-ZZKl)R%�8:���^H�%ˉ�����3���7߬p�
p�������&dA�"Iep�D8%A���~��$�L	�x|7!x
�xv7�x����^���䡈����mV�.f��⬂��:�&��|uCH�

��vV�uC:��eʢz��$�`�x�����
��
�ݳ
�N㲜L��nm�ޤq�ͼ`�(G��`J��p3��G
����n
�
-a!�%�����ѿ#�7
{�\�P����_8X���X��';h
p���
�>�
�V�G��#ku���
(!��AWq��l�*�T΋dS%���Սl���)�[p�V�>sǓ �"��
�b��m>�

C�';�æ�e	֐=&X��HR�\���|�]묊�c��c�mT�ģ3��d�X�L����,�u=U׋�i>�b��dK��O�i��;��8S�y�0�`�I��z7p��M�V+�M ��
jsZ��""
�&�m6
�
)��C �T�0$T؄N
$-7�Ĉ��.��ܸ�0
-�;!d�R��jB�"
Px�Rv=p�1��qM���% rO���W]Oj�:��A
-_�2� `���
)m�0�=r��
-��Ğ
���H�� ��ea?��
E�Z�s$	9X��H��p��s�N	�:Wn�.j�<F7S��!�Wq��a�O���� ���f���l�nz���B@�W��k���.{��)���b0D$�S�B�	
.c�H���}�J��V��
�
��h<��j��Y��Λc�ٱ ��F�y��� �L� R*�{ �x�a'K0E��r��X8	I�#r�g)�f\^�`��
�3)
-q).�	���zr�IM
1\�2�P�Xط|Dfڍ�ЅL��9�JW�D?����.w?#��_mu�9_m��L�."��Z"z�ں���j{p������8
R
-�i���j�«|�-��C�8f��
��|�A�=+F�&^�	��E��"��
�A#0��^��
-�d�����>�2=����$��)��z�mrȽ��+��
-�h��ds��$E�~A�C�]

-�=�	z���l*Ow6r�E��%@��!;���^�x@� g��
������Cx��fsC`eW�
��P
C4:�4��F��ߙ�,�>;��Qf��Y�Xq�_�ѝ�G���24��
�'G��K�������� �n���S�)=��=��a@Ȭ
-��m_T
8S
\:v�2ۺ�AOI�Z�Mcn7��i�����\�"�a�
-���@��7y�/�9�I�m�g@*�2;�� �]�gL�`���9Є/��IS�_{ef��g�m1a�S�!P2
�I�ۀ�������zf���g9�+���M��î��I|�2�c�z��m�@U
�{4{���wn����7�9ᅵϷ������Ҫ�K�(A�D�Q��u��0�B@�xd�q��2NL�Qw��� �@�
-�� ?W�
4��*.���-/`�Dԟ��
�����sIw�
���j�����q���S'�>̡%J��gi&e[�:L+���
$'Ԛն^�q���+�
V�U9#{Y8�?�
"��f�'O�Z����
-Qbb�B|�U�FZ��8�	�����۔��l�ƴ��k
-
-՞��J"��2?f�C�g��CZ���n
�I趜��8Hu5x� �
����7ڽ?�h���$�3��F��}.n�@�A3�d���,+�`���~~���E8�
�����n}�u;{��m:x}
�O�N�7��nի#uj�<����|F%�X�����<&!U��
Q��F�����!wlX��'Q�8�{ӥ�v@A�fD]�g���`�"�ei}x�������S����m_`	
"�����ݯ��R��1���[�5��Ģ���Eٔ ���B�)��Vׁ��'��~�����pd.b��WU����z�.��-��e{����!
6g��3�zj��\�R�����
6WX�>	8�Ga�Ԏh?�/�����?�p��_�����
-endstream
-endobj
-10917 0 obj <<
-/Type /Page
-/Contents 10918 0 R
-/Resources 10916 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10838 0 R
-/Annots [ 10905 0 R 10906 0 R 10907 0 R 10908 0 R 10909 0 R 10910 0 R 10911 0 R 10912 0 R 10913 0 R 10915 0 R ]
->> endobj
-10905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 271.192 169.013 282.096]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_ac6f109ff4cedf174407647a6a1ff1566) >>
->> endobj
-10906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 271.192 205.556 282.096]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-10907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 242.435 244.38 253.339]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_afb730d60db4b7e1ddd4c9994ec077cf6) >>
->> endobj
-10908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 213.678 191.718 224.582]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-10909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 213.678 288.852 224.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a348c6523b219aee93545bb401dc0b813) >>
->> endobj
-10910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 184.921 191.718 195.825]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-10911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 184.921 303.079 195.825]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_aaeb70a45d5ee0c7fac5f5d6c659fc69e) >>
->> endobj
-10912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 156.538 146.637 167.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a479e61ba0938cd3303c57f1881d8f2ab) >>
->> endobj
-10913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.948 91.542 286.957 102.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a546174614e2bea37b0f6f5717a90c218) >>
->> endobj
-10915 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10919 0 obj <<
-/D [10917 0 R /XYZ 89 770.89 null]
->> endobj
-10920 0 obj <<
-/D [10917 0 R /XYZ 90 721.073 null]
->> endobj
-1898 0 obj <<
-/D [10917 0 R /XYZ 90 632.36 null]
->> endobj
-374 0 obj <<
-/D [10917 0 R /XYZ 90 625.221 null]
->> endobj
-10921 0 obj <<
-/D [10917 0 R /XYZ 90 534.572 null]
->> endobj
-10922 0 obj <<
-/D [10917 0 R /XYZ 90 484.859 null]
->> endobj
-787 0 obj <<
-/D [10917 0 R /XYZ 90 415.189 null]
->> endobj
-378 0 obj <<
-/D [10917 0 R /XYZ 90 408.05 null]
->> endobj
-10923 0 obj <<
-/D [10917 0 R /XYZ 90 290.616 null]
->> endobj
-10924 0 obj <<
-/D [10917 0 R /XYZ 90 290.616 null]
->> endobj
-10925 0 obj <<
-/D [10917 0 R /XYZ 90 260.125 null]
->> endobj
-10926 0 obj <<
-/D [10917 0 R /XYZ 90 231.368 null]
->> endobj
-10927 0 obj <<
-/D [10917 0 R /XYZ 90 202.611 null]
->> endobj
-10928 0 obj <<
-/D [10917 0 R /XYZ 90 173.854 null]
->> endobj
-10929 0 obj <<
-/D [10917 0 R /XYZ 90 145.098 null]
->> endobj
-10916 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F22 2996 0 R /F75 554 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F39 2320 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10946 0 obj <<
-/Length 1586      
-/Filter /FlateDecode
->>
-stream
-x��Ks�6���<��L�
���Lq�i���zJ2Z�l����c��.H�%і�(���!E ���a���<���<�
�(�i�%��h�i�)������{�g\ލ^zL��h	��ǿ��j����ܖ���zz��G
-)ߛ�zo�a�
��0b��>�f
�
��w�����.����
���3�S� B
-�R*���fy���Ķ����63�yd�68:a�Q�*Ĺ_V���ђ$��U%�nn�`fC*p�d��Hq�}qY/�
�qZ
-��굶yHF\)�!H
Q�|
��N���ӈ�tݒ��B0�e��X`�;M��a|�,�;��B���]�	F�U�
Ϭ��aI
2�����̀�~-��Q�&�/��{��C�@����zgf�dvY�4�����Ȑg϶
Qh,�1��Ƈ�||��-���I�Q�ч�H1��N	�re�[�8�Y�.�
a�^�7y����*45
O�8H��*nQ�U�i��i�ƭg�΄�b�ﬕ-�5p5�j)y�q��$�-�KH��+�:4&�v�ъ�0Ej$aVz7*q$qM��0-*���
�z(�kG�tD�)

��3��8
��S�jd�!�I��&
'���ķ�Ο�Nj�ɴKiJ)b������v_v�wJ]�u�!E�zz��-�1����-���޳��C���r����%�k�p�l�c~a�f�l/�6�
"��F0�(!��xZ�r�4�Oa-�H���݌]�b��o�m���?��8���m8
�0�ǟC���Rv(	�J;��}�l�L�����,�
t[fRPO��
�e�Vp��<8KX\\
��88�
�������%�E�t�	�Ă�Vi�!�ލ�)�_c��̀��m�I��:
B�/�%

��� t�YR�FU(X8���]��$��F��{K>��u��Swn&Yۡ�.�
��(p�(`����5��?���O�Bl��>�����y���T����g�N���%Aw���n�E��	�]�@p���Q�FV�O��
�1	E>����ʇ����<�� �aښ��u��\�EU���B��Ⱦ:
R��[�c��:��f����������?���Z�!k}��ual�q��if�,,
Յ�{���LT$��w���S��Dݯ?/�ua�3%�|���S���W�
a\3x2)����
`����%6|���*0\#0�����t��C�Վ�D��%��	D�
��
��
8��
]ơU���bׯ���K�4������53SەIW�
-^�qQ��\�
Q�w��
a��A�ix�4���t��t���	�p:�?� ��1g�艎$@ ��[f��|`����s�/�aD��j/y�!Cި��#Ȗ���־J�~�d�/�Ӈm�
R>���*��j�	F�

w'�pff�t��ӲS�����g�)ʶ=��h+O�� ��&JѼ�y��m܃���~M at X-n���t3�!���\��K�2�z�������,��w	�A�,0��2�-�3�C��&@�gH��M9�
-�����͞$�
����u�͏��.�W���Фx7�
��uWF�&n�fI9�a
�8hu���Kd
-endstream
-endobj
-10945 0 obj <<
-/Type /Page
-/Contents 10946 0 R
-/Resources 10944 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10838 0 R
-/Annots [ 10914 0 R 10930 0 R 10931 0 R 10932 0 R 10933 0 R 10934 0 R 10935 0 R 10936 0 R 10937 0 R 10938 0 R 10939 0 R 10943 0 R ]
->> endobj
-10914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.096 636.226 211.105 647.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a53dfdee0a44161ba830690eada3b59e2) >>
->> endobj
-10930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.948 570.531 377.467 581.434]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_ad7a9b929f459945a7578b161edcf5d4b) >>
->> endobj
-10931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.899 516.79 324.725 527.694]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_ab5e4dd91b02f044f26a9fcf244ec0c5f) >>
->> endobj
-10932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.037 501.202 313.023 511.107]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-10933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.699 463.05 306.952 473.954]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_adb7748cb7d0260ae8e1428698a3076e8) >>
->> endobj
-10934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.948 386.395 285.413 397.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a0392d17d04d6a71534e7edc09d5a2de4) >>
->> endobj
-10935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.228 386.395 360.969 397.299]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-10936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.948 320.7 280.731 331.604]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_af859c3d302c3573b8e2183e4370321b0) >>
->> endobj
-10937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.546 320.7 356.286 331.604]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-10938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.096 219.139 186.477 230.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a112e023392095ec2ae4e8d3ac7cc8eee) >>
->> endobj
-10939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.096 133.489 183.459 144.393]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a2f75012f0260eb29d28e3f6ef60c97f4) >>
->> endobj
-10943 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10947 0 obj <<
-/D [10945 0 R /XYZ 89 770.89 null]
->> endobj
-10948 0 obj <<
-/D [10945 0 R /XYZ 90 721.073 null]
->> endobj
-10949 0 obj <<
-/D [10945 0 R /XYZ 90 624.623 null]
->> endobj
-10950 0 obj <<
-/D [10945 0 R /XYZ 90 505.187 null]
->> endobj
-10951 0 obj <<
-/D [10945 0 R /XYZ 90 95.011 null]
->> endobj
-10944 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F24 529 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10964 0 obj <<
-/Length 3097      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~�_���T�`� ��T�r�٤�k{����#Q3�J�LR
���m
<@A���>mj
���F�ϯ�����x���/�%(�T��mf	�)� !�m={?'I�X������yZ�������}���?�UZ=�x�h��L�dgn�����KB�N����w7#� V�,ig|[
�5_1�XR�篊͂�y�.�D��~}�:o'|�M��}�H�<��i���7��lFϳbe�(�sƕ�y�û��7��q"H��jw��7<[��O3�X�gv�n�)����ۛ�`/}<Ԃ��q�g����J������oJ&�����ִ[� q��B��J	�:J���Hw^(�:�WH8�SF�%D#��H7���DP$���!��O���߻�xu�E��Ǜ�{�j�`MnH���+���sk���E9�
�7�-%QB��v´:Aɡ�Fm�"EĔ\B����iQ\�!��p����GP	x�yN�v"%�&B��`"
I���o�}��ө@Dt�|vS�
-I�i�!o�cd��<F��:A�c'
���çK���g����G���0�֯aD")�y at Z'�Z��}֤�6[�\��^U����"

�20��
1�ļ'�cH$l$��I� E���\,���"
��
p!q�B�!NF�=�����(
��
��W��$f(�j
-�P��C)�
00�QR@�2�z�( �!s�#
 *c	�
-
-�Hp�Ч�|�@���P��	�#��Lӑo�5;�K� ��@�'��x�a��H�q.x�Y���Ce��UV�i�o}�^m�:[�i�������*� �X���|@l�2�a����ݽ��$�θ��a�y�vO���6�v0[
E�	�|q`��� ���l<gEӮ}�l��4��b� Rܺ���00ʹX�m��{��! 6���
��
$Zx�����s�%�Y
�o�ƭb�
|?��IӲkR�ؔ�mi�}�[��aw���l��Y�"�y�0
B�<�
 UA
-�I�h߼�hWym&��y�6��úJ�Y��;Îpr7O&�6�i�'Z�j6�T�.b �8#���]aؐ���>�"� �z�kʘU�v��j�гOÂ��e;�Z�a��K&1R��!x�8�&B�iĦ�5��3l�$y�x��ݶL��*T�2��c�@��ջ��N��V{�;ЄY	�o�o_s=�[�j�)�Xu��l�PdO4
� ȳ!��#�.��씘�PZVq1+�
[�I�Ju����@К{y�3�.\�9��}L��~/+�C���*#�6D�nh_���OyG���On�w_~�Fl�sc5���y�N(����^��>��q$	��J�H����0���O�
��\>2���
9����ì��0e�&��,�t��1nh��c�Z�F�گT��We�T |�`��uq
~�q�6Y�
 ��77*�.�
���t�i`��>_ݏ�?�����,t�&�Y�˽)��}Yy�/������m����b���s�e>3�Z�+���1L�u [...]
1�
�O��M�s�C0Y�| �]�+ե����r���A
�$�����v��.��
W����eT=���J "�%���qza̯�oL*K@��
F��>��+
�"�Z�Q����9����3g�R��m�AH7cB��"��ŝ�/<W�̰hS`����	Ś�M��6/�€S���v�s%@)R��%x\�[�� �
->��
]!�����%R�����1b���P�*���܈@ɠ�}
)�Nv�C��B)\�R0Uɯ�,�A�eM��L�sY
p�ÿ���F[l��K:/9���Q������}��U�
-ND!����Å��"�Ɏ���,��|~c��;�b�|�8�zP%bv���+�����[��[���.˚�E7է�^tl���8���Md�S�M�?�	{l����٪	�P7�d1�fX��D��Yι�isJ�X(���7���>q�'ದ��fԗ׀ �e1ELu1%�
& -�m����d���&���ͬX��1���S�N��zX@�F��T�!�hPD9‘��#��T }��\@&
"��Hr�
�ZJ��Hj�������<��䎙��|��
��7�M�9���5�?��A\Өy�
�:�;�BZа�8�	�"�m������}i�%K��
�?���9h��E�ZYx}
�M�%,��-$�mָ�2֮B��e�B�l����[���çq�^h��
�&�`bJ�
+�AvW+3ޢ��
.,F.7�sҕO�E���T�������=�	�MV�MlCjX�\`.'
- @
 �Q��zu�9��=�=��9��R0R�iY �����#��U�>͎�H 0�;��o
ؙNJ�O%q��VZ�SB�����l�&�.\���MV4�9d�RO �	����ɶ�x����{ ÂH	��C�m�Ō
�]����
�W>��u��:>,�����y�͋����|#}i�!x��:v���&v�@�m-�8x�*�uWI�}����P���vu��1�	�t�����q
�k?���F3sT�@�
џ�DX����
�d%����X�J�
- ��j�^�0~��ʝ9O���{�m����27&6O�
������K���کY�hy��7���	�;-�!ߨ�'ߨ��n �Q�Sv�5�L�"yԚ�A8i����Q2�d'M�RЁq��UrÀ���w1:�I�}�v!� ذ���
+� ���1��(�B�#��DG\Lr
�:׽���
d��u����
e��oo��7L�7�COD��^���=����[�J�%-m1�
U�5 P�;v,��o�������}��kT
n�
-�]йo�����owuVܡ��a�
�#�}���@�o���*kO�`pg
jh+G���$�%���?&�6~�o�ll?��_�����_��/{���
-endstream
-endobj
-10963 0 obj <<
-/Type /Page
-/Contents 10964 0 R
-/Resources 10962 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10971 0 R
-/Annots [ 10940 0 R 10941 0 R 10942 0 R 10957 0 R 10958 0 R 10959 0 R 10960 0 R 10961 0 R ]
->> endobj
-10940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 696.002 156.281 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a252ec311fb17e29a3ddcad44b746404d) >>
->> endobj
-10941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 696.002 192.824 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-10942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.738 696.002 324.465 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-10957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 656.832 156.281 667.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a252ec311fb17e29a3ddcad44b746404d) >>
->> endobj
-10958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 656.832 192.824 667.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-10959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.738 656.832 324.465 667.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-10960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.583 253.907 295.607 264.811]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-10961 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10965 0 obj <<
-/D [10963 0 R /XYZ 89 770.89 null]
->> endobj
-10966 0 obj <<
-/D [10963 0 R /XYZ 90 643.564 null]
->> endobj
-10967 0 obj <<
-/D [10963 0 R /XYZ 90 594.925 null]
->> endobj
-10968 0 obj <<
-/D [10963 0 R /XYZ 90 343.612 null]
->> endobj
-10952 0 obj <<
-/D [10963 0 R /XYZ 90 320.518 null]
->> endobj
-10969 0 obj <<
-/D [10963 0 R /XYZ 90 320.518 null]
->> endobj
-10953 0 obj <<
-/D [10963 0 R /XYZ 90 204.392 null]
->> endobj
-10970 0 obj <<
-/D [10963 0 R /XYZ 90 199.909 null]
->> endobj
-10962 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F110 1507 0 R /F90 758 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F118 4003 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-10976 0 obj <<
-/Length 3044      
-/Filter /FlateDecode
->>
-stream
-x��
�r���]_�'�����_4n<Mce���k�O��CI�D�������`�% ���:~А g����n"
�|�����b�AFR�_GG�$$\]E�����_"&5"F�S������������oG�Ώ~?"��H@ ����ѻ8��ۿD1���n�,���4:;���q)>����1�%�� �y�C�gؼ���E�:d��Oe�i���&�'f,{��˗٣�εmGD!�31���I���KĆ#�1
,���t��-��SB*�+�$�k���Vx; |^,X>���xGT���P��|�ٔJD���Hs��r��6�7�J�A�:H�pH�8_%W��p��"��C�*v�lŎQ�4��v�j����{�\I�s�� ,Aּ�!�l�
g���v�1���mr3a��.
�� \��Fh�#F҂��dDn�����P
��&�	�"���Hz�	��c!I����:@GƐ&� �YI��4��V�y��
F����l��L��<	IW!J[�/l�'ܰj��g�''��x�ʕ��*00�i�>�	$�hb+�
-q�]le�Z���C���k�		�D�vtW�6��6�wC���d'�OX/L��z�����j�
��Mu��%[��kG����G�l��!���b6��fH�`>}���㏿N.����I&;Xt�V�dG�DR��6�P�F�
��cd�aQ ��5s���
R��
Ql;:蒴t�AR�ش�$Fw��E�
c�<=�O��^x���P\��*��[!�����c�C�G
ED_��M'������b^����*c��\���!
�H�f9O�%`Cu�*�ճ��#�������.\(�Gr�DH�h��$�N����i�2���H��`�fH&�4���Q��_�:~����9�- 
�
/�o��3��v'�(_g_@�C*2_
/2���E.��B!,LEB�(� �˻5�'�� $XDq]�f�� r�E��v����b���!T!�/��m
��ab�߽e�c�$�I�}.�t��\.�+{�-0w�"���b�[$��c�v������z���-&K�����f��4v�k7��~~���L�}��w�r)�7���x��96;�LX�vW�;�����@h�<�&�Ձ��?�H�z*�I��g\
��H|l����'�f�@�
'Y���M�;:�
-j�1e�
 ��[��YEY7�
���V�M8�.����m�_�u���
vX�L����_4�/Z4��Y�k�?�h�x�5���p՜�$�#z
��P���
�0��^K�"i[٬uײ��U6�"��<�b��ܖ�)�
dŃ4�K
ʡ֞�,R��B�rH^�� ��9�@\#
-빂���Φ�
�&k�/T����y�2
�m�6i�+�� P?��x��p�r�7���0���+Ǡ�R�Jѱ�&��wd��fr�p٦�Ϟm�AE��
�
���H:@�~>o4|hX��SɁ
p�D�>�� e���gkO
�iW�J�{���?!	v} :�VM��
reRS���'z��v}X��+�}�`�mH� 6p�(7�u}@Z*�����
M���6raN=l�S*����YH�i�U�m�q8
�U�}�i:��E-#Y�gġ~]w\�f-�e����Z���`gǎ*TCg�6�v
�_�ÏO��!L 
;{��?��T���
���7�B52�R"3���c̀9�
>�
P閬	��m��{��W���MP
-�B

U���U
P��O��Vn�V4
-=��j�a�(T=��l_��ڬ|y��+��`q�^b�4��������zcJ[�Vi�8܇�$�%RRױ��[�H8�ڄ�5]
��V�
�ksv�c��6�
-
{hѕ�o�m��/O���?I_PJ��`�;ӴC��ml�No=���L���KQ�C[��"��A
-��+��t�E(��r7Uj�m:M; B�$M���H�7)
Dm$ɩ��L�!�\ޫTP?n�R�FI3����R��!#��
lKc���p�7Ee��2wO.�����N[C}jso���i<X!��$�ua�X%*k����/ߜ�z�Z���O��o���)�m�����e�S�&em[��B����XY|��^��H�d�NӞ�m��e�zL(��q��>Ƅ^�;�Ә���cB���1���2 �A~�Ø��T�=地��9���~P�c׃B_-��I!�"�>|Rh��	�?�����'�
[��Ia�ZO
-=N}��B%�L
-�;b
`(=tT�@k,(bXìP4�
-5��}�cg����

w	UW��М�8��;r�� �rRȊI�*'�ܟ���B�05��f����%p#T�Yߩ�;���q�A#��U ��
A���C
'S}�8�%�I!oC�4��
������:
�鼁ȋ�.�_p
0A��u���
2uSi�
�~�j_`��Dv
iv��Mc��b�۹

�1�‚�������`\�$��v9C-�
r��8xV����ٮ�����i�z�f
c� ��y�S<
a�Csy-��6��e�怭��5��O�{D�Hw�s�������b'Wi�
-�5�ʾ�chq~q�J.�Q'w���r5��eq�i�)
-ו�g��m��]IH�j�A������)��Q)[:YX�~H�`>�� ������]����ܞ=-��C��8"�������e�6��݉��L��s>�UP%p]{��7�&�A{��'F�1���OJ�-k�]��"Cy��l�%m�vnA������]��$$R�|� t��ޮ���N[|d'�%��D�����;�����
���W^�w����!�I~\�r:N���/n�$^䩄}r�N�W�W_ϧӹ=��y��d��9�i�Ѵ'�9�.�0�|?D��ލ����)���~���%	�
e]��R�An����g��
��������~&�q�zƢ�� �7x���#�l��M��-f�8��M}ɼy�k���i���P�A���������!�� 	��+��
�xp�9�2��S���#�^|�=
^���rywr||��I��]f���W��a
-\ƂB�f�EN�$��3�h�.����l
-endstream
-endobj
-10975 0 obj <<
-/Type /Page
-/Contents 10976 0 R
-/Resources 10974 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10971 0 R
-/Annots [ 10973 0 R ]
->> endobj
-10973 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-10977 0 obj <<
-/D [10975 0 R /XYZ 89 770.89 null]
->> endobj
-10954 0 obj <<
-/D [10975 0 R /XYZ 90 686.656 null]
->> endobj
-10978 0 obj <<
-/D [10975 0 R /XYZ 90 682.172 null]
->> endobj
-10955 0 obj <<
-/D [10975 0 R /XYZ 90 506.923 null]
->> endobj
-10979 0 obj <<
-/D [10975 0 R /XYZ 90 502.44 null]
->> endobj
-10956 0 obj <<
-/D [10975 0 R /XYZ 213.955 367.166 null]
->> endobj
-10980 0 obj <<
-/D [10975 0 R /XYZ 90 362.683 null]
->> endobj
-10981 0 obj <<
-/D [10975 0 R /XYZ 90 234.305 null]
->> endobj
-10972 0 obj <<
-/D [10975 0 R /XYZ 90 212.262 null]
->> endobj
-10982 0 obj <<
-/D [10975 0 R /XYZ 90 212.262 null]
->> endobj
-10983 0 obj <<
-/D [10975 0 R /XYZ 90 154.119 null]
->> endobj
-1899 0 obj <<
-/D [10975 0 R /XYZ 90 70.165 null]
->> endobj
-10974 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F117 2446 0 R /F75 554 0 R /F118 4003 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11017 0 obj <<
-/Length 1537      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�a@'�5����m@��E�v�Z�S[���Bmɕ�$��;�Ȗl�uɀ�HESu�<�
O$v�v^v~�u�^H�(T8�+'Ď�C��9]���^�`��K�`7�gQ�ң�ͦ�I<ʣ��d�G�����]��I��=�q|~��q
�Y�u)���4*
-�|_�fT:���2��������G��C�@�cG2p������A�k#΍
4s|��:u>t��`�F����XOa.BP�9�\����yJ}��=�
�~��p�U
�@��j���|�f\z��
!��w����c�� ��:�n�jJ[�/
-}q
$F�ц=Op7��
V��&�Ǔn�k�(+��^\�s�f�.��˼�yjTؔgf{�Il`�i��x�e�̎�G���1X��
�G��T�#e�Y��
	*�?&�p��f$x�
�� #6n�K"��j�|>E�I�<��@�jد�F`hBj����b�
�&@{�

�o�� ���X��2�Ң��6�@>
�
���\|��o<�4����޿�8�
�ت��{
-�O�c�#;����ג�H��!��j=� �|1,m~�*������h��֒Q
kC)�+�ջ����=����X1�=Q�=	u�u�<K�2I�6T2�Z�i��(�c��j+�<a������o�T�%�Y���y�6u�T�@N��Ĵ�l��P�[���o��'I���^��B���*�|�f3
fS�G�����7�1�/��<:�k]IBv���_���s�
��ϟ�7Ѽ���
-�&)�J,��㰢shٕ�$3��j�/'I�h�m�B�O���ͣ�<R	?/�dljU���P�+ֶi bY��"J�ؔu6�@������{���*qg�?3���)*⿢�d
�q���Hc��o�ʼ$=N�'
 L�T�{T@�a��
H
-��$[�
�{��SB����=�xb�"-x����W֝bY'x�׷7"ls�e�D������WJh7����\�i��p��ҦX�W`���������ڶ��1$
�����g�A�Ƒ�!��{�v׿���ݻ��
����
%�v�$w��4�\o0T��U�,[�,"2��eV�����i��(A��v8��
ሄF� ˦��'���=��l
�-t� Iy2�ߪ�֟���ۃ
-�I(ΏL��ɹ9{w�	�y6����"�L�������4�_�0O�j����^6�Z^�_
-H~üJo!w�td�Gq��(Mn��Q�vTCB����̐����J��*$6�G8ruZS¢����K�%W�ƨ
-��M�ߜTx��&����)
\k�(� g‹���i��ٜ�F��
-�d�T�m�Sm�V۫
&��a�p&a�8�pW� �z���D<�ܼ��|c�q��ǹk�|��hꭲ��'W���$H/� =a}�����ũZv�\m��>Rǚ��IY�����q�c4p�"��G��\E�U��,�W+6t�4��:��pI!!h���
�+/�Wk�Ճ���Ռ9�g ����_
��
-endstream
-endobj
-11016 0 obj <<
-/Type /Page
-/Contents 11017 0 R
-/Resources 11015 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10971 0 R
-/Annots [ 10984 0 R 10985 0 R 10986 0 R 10987 0 R 10988 0 R 10989 0 R 10990 0 R 10991 0 R 10992 0 R 10993 0 R 10994 0 R 10995 0 R 10996 0 R 10997 0 R 10998 0 R 10999 0 R 11000 0 R 11001 0 R 11002 0 R 11003 0 R 11004 0 R 11005 0 R 11006 0 R 11007 0 R 11008 0 R 11009 0 R 11010 0 R 11011 0 R 11012 0 R 11013 0 R 11014 0 R ]
->> endobj
-10984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 612.06 144.674 622.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ffe9c9777d454e5bc5d0ad41887ae8c) >>
->> endobj
-10985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 584.757 144.674 595.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab331b1dede4f6e83d3eefb864929a9d9) >>
->> endobj
-10986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 557.081 144.674 567.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ba31de49e0fcff11975c0e8670269b9) >>
->> endobj
-10987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.369 557.081 281.012 567.984]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-10988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 530.151 144.674 540.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a64ca0878a1f4a3c338b920ecb7c56c4e) >>
->> endobj
-10989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 502.848 144.674 513.378]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae432dca61c738591a5c53f135631c8e5) >>
->> endobj
-10990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 502.848 202.776 513.378]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-10991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 475.171 169.013 486.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab18c32ab9d8e6a7fc785165b6aa4db56) >>
->> endobj
-10992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 475.171 203.593 486.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-10993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 447.868 144.674 458.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-10994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.414 447.868 196.221 458.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a150a3fcf4b23e91a58c5acb8a455fec2) >>
->> endobj
-10995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.558 447.868 254.322 458.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-10996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 420.565 144.674 431.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-10997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.414 420.565 196.221 431.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a701efa51459fa5353f1620f9a1524f52) >>
->> endobj
-10998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 393.262 144.674 404.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-10999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.414 393.262 201.839 404.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a939f1c932a39f3ac0d579352534ee0d8) >>
->> endobj
-11000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 365.959 144.674 376.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-11001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.414 365.959 197.038 376.863]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae8f1b6153c04bde0aac8592ff6edbe36) >>
->> endobj
-11002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 338.656 144.674 349.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-11003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.173 338.656 191.598 349.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aa29c608bc5c4c8d0b1d42dacc5ff516f) >>
->> endobj
-11004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 311.353 144.674 322.257]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-11005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.173 311.353 186.796 322.257]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aadf870c4d6fea9b5650aa888c2e79ca2) >>
->> endobj
-11006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.377 284.05 205.546 294.954]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a27ebe448697b1357cb06c60b471f4045) >>
->> endobj
-11007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.179 256.747 263.349 267.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad9420cd4a63cbe1e155a94a8064f86b5) >>
->> endobj
-11008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 229.444 179.554 240.348]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 229.444 204.032 240.348]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad4a1398505beae32e88bdc66625dcf92) >>
->> endobj
-11010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 202.141 180.54 213.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_af7e70970808607a85d1daa4548c400d9) >>
->> endobj
-11011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 202.141 238.641 213.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-11012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 174.838 178.239 185.742]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae6ce7cc93a11ff81885948a776dd0e56) >>
->> endobj
-11013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 174.838 236.34 185.742]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
->> endobj
-11014 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11018 0 obj <<
-/D [11016 0 R /XYZ 89 770.89 null]
->> endobj
-382 0 obj <<
-/D [11016 0 R /XYZ 90 721.073 null]
->> endobj
-11019 0 obj <<
-/D [11016 0 R /XYZ 90 630.384 null]
->> endobj
-11020 0 obj <<
-/D [11016 0 R /XYZ 90 301.014 null]
->> endobj
-11021 0 obj <<
-/D [11016 0 R /XYZ 90 275.437 null]
->> endobj
-11022 0 obj <<
-/D [11016 0 R /XYZ 90 147.206 null]
->> endobj
-11015 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11041 0 obj <<
-/Length 1801      
-/Filter /FlateDecode
->>
-stream
-x���r�6��z
-�Zj��q% /�$��i�Nԕ���
s"Q�D�����H��l]дIW�x9�	���(
}�p�������d�F:�I4��4�$�H$�k]�L����%
-��]����o��̹������)
�*�@RE�����fp�u��*z(/ZD�2�Σw�?�j��
-�k6V�������pD0���2_��i�\
G����j�"��XN�i^L�l�����F�#Ƶ�4D��.��Ǔ�b�� Dh�
%*�O�EZ�
6ߘ�#�Pe$����2/�CB���t��Q at 1E�� 
-(�+x�]�&О*~<==;�y� +���#,����0�*MOO�"]M�o�����cp�Hj��.���
-���,�gy��3�ɫ�-eD%C�K�`i���n
O8���6ˇ
�
��'�lf:�BĨ�*p��,a��6�q����@1�4$8N���@�31��强@��K�d���mH�,�;�(%��"[��j/7:}4"�!.;
���0T ��1�����3�x	uʴ%�2��i
x&g���`$���b�h},1uU�뫴��L.��%�Ժ6�����������f?�����D�9M>��jĘD�1�H
;h^�_���4+��(
:��

J�Y��n��E���aYm�cLW����S3�U?�7�����@�'ƿn�c���íH�Ҫ���"i&��~��֋�y�:i�uqB@}H�4O$��(���lD@#
	���O�w8*m":a�$ic�F��R�
p�z~�d\�~{��(��
	��T�b�m+�>|�ͦ�
��
������-[�X���$A���n� 
��Ј�]a��sJ�bP>1�݉�k�'BC�	�	ۛHp��IؙB���	x�������B
),C�c	��?��Wi�F
���Z�8ޮ�`D�8~>��0C�*
�ҾЉF�ס�
v�0&<"#&D��F�D�>��A
�u��F����r��0g��,��#����xk��2�
	��g�#��2�'�����vs at H3 [...]
-�F�B��*�
j�"������H
����� ��G��vRta��h��
-x)]��H�;�٘>6.}N��
��T���;4b/�P&���
n�H'�n\�ܯmG\?V۳��E
!��ьh8b@�a�
z��
�TSt�Z�!-��/�5�ެ2@�j�N�PA̗q�u�w��(vg
��!XDŽ���N u�
-v&�Ϸ��~����H,�l.�k@'���޾I
�L\_؋*
-�,�HBv��_
�3\0��[Pqg��q3��P��2>�E+��<x��$(=ƀo����8����h��{p�]��v���o�l�HH�o�G�� �%��x�^���`?	�
���^��HT����Q0�@�7'���Iw�=p��E/��	7�x�&�kr�o�Q��
�{���M���:]�h����'��d��4!�e`�ŧ:^��S��;��n�~�e�6(�~K
pBP��Eqwzrr}�q���&����Y�?��]_��b���7��!�NWB�
��m4
-endstream
-endobj
-11040 0 obj <<
-/Type /Page
-/Contents 11041 0 R
-/Resources 11039 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10971 0 R
-/Annots [ 11038 0 R ]
->> endobj
-11038 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11042 0 obj <<
-/D [11040 0 R /XYZ 89 770.89 null]
->> endobj
-11043 0 obj <<
-/D [11040 0 R /XYZ 90 721.073 null]
->> endobj
-11023 0 obj <<
-/D [11040 0 R /XYZ 90 704.201 null]
->> endobj
-11044 0 obj <<
-/D [11040 0 R /XYZ 90 704.201 null]
->> endobj
-11024 0 obj <<
-/D [11040 0 R /XYZ 226.769 647.029 null]
->> endobj
-11045 0 obj <<
-/D [11040 0 R /XYZ 90 640.055 null]
->> endobj
-11046 0 obj <<
-/D [11040 0 R /XYZ 90 571.815 null]
->> endobj
-11025 0 obj <<
-/D [11040 0 R /XYZ 226.769 519.521 null]
->> endobj
-11047 0 obj <<
-/D [11040 0 R /XYZ 90 512.547 null]
->> endobj
-11048 0 obj <<
-/D [11040 0 R /XYZ 90 444.307 null]
->> endobj
-11026 0 obj <<
-/D [11040 0 R /XYZ 226.769 362.034 null]
->> endobj
-11049 0 obj <<
-/D [11040 0 R /XYZ 90 355.06 null]
->> endobj
-11050 0 obj <<
-/D [11040 0 R /XYZ 90 287.796 null]
->> endobj
-11027 0 obj <<
-/D [11040 0 R /XYZ 226.769 217.878 null]
->> endobj
-11051 0 obj <<
-/D [11040 0 R /XYZ 90 210.904 null]
->> endobj
-11052 0 obj <<
-/D [11040 0 R /XYZ 90 154.619 null]
->> endobj
-11053 0 obj <<
-/D [11040 0 R /XYZ 90 77.486 null]
->> endobj
-11039 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11057 0 obj <<
-/Length 1813      
-/Filter /FlateDecode
->>
-stream
-x��ZMsG��+���kG�=ߪ�!��T
;Vb��\ki-Q ������
X��SQ��C��~�o{�
Ur�p��ˀ�Kz��tp�Ԉ�1�Q'���#
S�ޝ'�S�Lc��<=ɀ��tT�=ɐ���ϗ���x�|�nZL??~��432�f`Ӳ<>
��i1�L�
O_�Y}�g���W��Jo^�H������ϧ�� �<��b�&g���7<9����#���Z4J$
-z�J^
�����C�z� :2Ѹ��
�+=\��ӛ��|8��L�nF�x^Ty�m�
�
%��4;|�P���ym�Ŀ�!]w
�e@>j�	�6�9���{
�ܵ��dt��I&��0H�c\G�șU&D���!�:m�ܦU����`��
����i�N�iz|<ZG!���b��1aWP��	��u>���VX��:^�d��ja��$?]��z��,���ni��
- 3�f
a���.�(�E����|0���ͅ�D$� n�_�����uS<���v8����]�F]*���E�(؉�`�������s��
$��k�R��s_���-0���[m���_��Vk��I��;J�e��1�e-RUr�F`���*�)�h��l͋nv��L+oS2kM����TVա8��M
G�8�,������e1o��ꪾz׬�5}]�oMeP�q�
rzryS\h�es"�I�35�kq��Țr�	P�
��B���41/>��)gma�X0�IjQM�_�+lw�Fw�"�ee
�HQe\
�pT�G���8˔aml���I�#�p��Z/�3i;M"G��)$~rie�I�vH#V@�ue
-��]�P�1�u
�&ڭ@�S���m4�  $�W!�>12���~�O����<=��g� 4
����U&��#��J�zA�LÈ&N?�fË��>��%�	��"	��V�f椯(=%�[���ʠ�j+�a���P�v�&b)�n�R��j
FU�&��Ke
��We8�2��	��������_Fb�?(�ț�6
1/�m�WbH�7��<�aC�!bK
�����)1,m%�`���İT�)��
�:���IRX+���W� �P† ��5CɎĠl�).C!0'C=3+�&"-�⠡�B�iWo�H��h�aI�n��VŚo���
-P3������k�E��L
-�3D�X)A�
)J1�Ў��X�ѫX
�G�r��l�"2�m�yݽ-�*?�6��"2�b\u
�v�b�
&$5k8L��C�U�4��}f"B�(��
ma��� ����RL�m��ѣ��j�b����)u���=����5
�����ix�����
���5u�)r�2������
ۊ��֋����!P>�|��*��R�.Q�?G����lT�q��2�Q�#iS��c��q ��Z����c�_
/�
��FTφ<�<��]M�~�ME�KVd���
�z=-3T�nr3�a��
���u+S	+�
�N�j�A4�_�~�Mq�3Ւe%�@�~"�!�
�J�L�� @�!�3!�;{*
j;�^�V���
9
��l`'�6���Fi�&�F�
c��hJI��J8�
5mue
-���X�L�X!W ��X��1 �X�!�Ss����j���
-Ό�H�o]v��&`k�!��b�?-����Ӳ}�`�rve�rr��kVN�ϔJ���(�7E3q�|��QNg�?�C��7�������z�
χ���mP������R�	��|~}|t���bV�/��d��9
?
��\{�ΉF�i;?Ӈ��o��e�blÁ�3���`~�"���Vt��/�6
�:ɓ	x9&�ZAƲ
-endstream
-endobj
-11056 0 obj <<
-/Type /Page
-/Contents 11057 0 R
-/Resources 11055 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10971 0 R
-/Annots [ 11054 0 R ]
->> endobj
-11054 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11058 0 obj <<
-/D [11056 0 R /XYZ 89 770.89 null]
->> endobj
-11028 0 obj <<
-/D [11056 0 R /XYZ 90 704.201 null]
->> endobj
-11059 0 obj <<
-/D [11056 0 R /XYZ 90 704.201 null]
->> endobj
-11060 0 obj <<
-/D [11056 0 R /XYZ 90 645.61 null]
->> endobj
-11029 0 obj <<
-/D [11056 0 R /XYZ 211.835 593.315 null]
->> endobj
-11061 0 obj <<
-/D [11056 0 R /XYZ 90 586.342 null]
->> endobj
-11062 0 obj <<
-/D [11056 0 R /XYZ 90 518.101 null]
->> endobj
-11030 0 obj <<
-/D [11056 0 R /XYZ 211.835 465.807 null]
->> endobj
-11063 0 obj <<
-/D [11056 0 R /XYZ 90 458.833 null]
->> endobj
-11064 0 obj <<
-/D [11056 0 R /XYZ 90 390.593 null]
->> endobj
-11031 0 obj <<
-/D [11056 0 R /XYZ 211.835 336.799 null]
->> endobj
-11065 0 obj <<
-/D [11056 0 R /XYZ 90 329.825 null]
->> endobj
-11032 0 obj <<
-/D [11056 0 R /XYZ 211.835 274.96 null]
->> endobj
-11066 0 obj <<
-/D [11056 0 R /XYZ 90 267.986 null]
->> endobj
-11033 0 obj <<
-/D [11056 0 R /XYZ 211.835 213.12 null]
->> endobj
-11067 0 obj <<
-/D [11056 0 R /XYZ 90 206.147 null]
->> endobj
-11034 0 obj <<
-/D [11056 0 R /XYZ 211.835 139.326 null]
->> endobj
-11068 0 obj <<
-/D [11056 0 R /XYZ 90 132.352 null]
->> endobj
-11035 0 obj <<
-/D [11056 0 R /XYZ 211.835 77.486 null]
->> endobj
-11055 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-11074 0 obj <<
-/Length 1468      
-/Filter /FlateDecode
->>
-stream
-x��X]o�6}���0`�
|��o뀭k�u]�5�SZ
����dɕ�����%۴�I܇{2-Q�����\�EW�^�~
�N^9p��hx9�@i�7�.�B����u$�t���
?�v����|�{1�}�!�b� 
-������GM��눁p6��:�#����y�
��0�l�?52�"CD� hl	agR��:�͓l9˳�V���w"kW�Y�>��쏊�hj�[�h+���	rp֭��?.43���b��y#�o�ɤhC`�9#�S����}*FE<������������
. at p
�?���Irz:[%�h���&I�$_���S,
8�e
��q�-W5
���5�ub/fY:˒�լҝ��۠B�%�(. ���}��.�%
�X5M|�S0��_�O҄x���,[%��K�?�z�\n��Ю7��D��$��zf��l���c����ý���G�Hj(���E´�"Z0D��2��_yٔ�A�ˆ�X���b�|��@ph(Ө���a�iczѥ/h
 �FA���.��_Y��b����;
-�%� !ܫ0�0��
�!w6�&1�·�=�)����e�`�R��4�Z�E(@e����
�f����P_Zb� Y��u%z�.�#*��v/	�S��Wۦ�>[}>_��dٲ�$k�1v��֝nf����D<D��"S3�r���G�U��]����_��v�
%
�݅����g��F��E�h�h�:�RoϞ0��dbGw���$]Jl���BRF�T��h
���p�8����fT���,MkG�{�=�'�{"b��X*�>�H{���EQ���(wS�B��%��#�[�+&�9�(�
�N�%#U�;�4ՠ)���\���G�����b�.J)2G�X��8
��D�y�3Ԙ(v�(��@�
���
6*q�F��F�F�c����o���Q)
�m�T��G�lT��h+�i��v;��6�D�6��/����n
-QH�
�|l���Q4!$Mwr6����iz���t��ା���eݼ���G���$+S�$���;���<M�+Jrv�Q"y���@�I'��6�Y}���s�� ��3�"���s���T���܂پu��U%(M�kɄ���3
�`f�"���f I��X�N^�	�;Nm�u!(ސo������%ߠ�{��ŗ������m�|�\Ʀ�I6N:-�<�T�4�O�p����<�n����H#��п�e��z�4%�V��B�&_k�-��l&�ƽ��N
Q
����?�ܵ>�t�š7��bb@����3������v�z�|S?8�u.�_r
-�	7�x�M�Fn,ͨ�iY#�45���sv��7�\&���R�ZM~eף�	��)s�˵2!��.�x H�Γ�
��kؿ��<l�QJ�K<]��''����Iv�F���|�
0�N�Z
�y������JAa7y��ҵ�
-endstream
-endobj
-11073 0 obj <<
-/Type /Page
-/Contents 11074 0 R
-/Resources 11072 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 10971 0 R
-/Annots [ 11071 0 R ]
->> endobj
-11071 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11075 0 obj <<
-/D [11073 0 R /XYZ 89 770.89 null]
->> endobj
-11076 0 obj <<
-/D [11073 0 R /XYZ 90 721.073 null]
->> endobj
-11036 0 obj <<
-/D [11073 0 R /XYZ 90 632.933 null]
->> endobj
-11077 0 obj <<
-/D [11073 0 R /XYZ 90 628.45 null]
->> endobj
-11078 0 obj <<
-/D [11073 0 R /XYZ 90 559.875 null]
->> endobj
-11037 0 obj <<
-/D [11073 0 R /XYZ 90 525.205 null]
->> endobj
-11079 0 obj <<
-/D [11073 0 R /XYZ 90 520.722 null]
->> endobj
-11080 0 obj <<
-/D [11073 0 R /XYZ 90 449.991 null]
->> endobj
-1900 0 obj <<
-/D [11073 0 R /XYZ 90 214.938 null]
->> endobj
-386 0 obj <<
-/D [11073 0 R /XYZ 90 155.824 null]
->> endobj
-11072 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F117 2446 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11110 0 obj <<
-/Length 1111      
-/Filter /FlateDecode
->>
-stream
-x��Y]��6}���S
3Eַ���C�l�d3�&��&�am��㴛__	��4;�t��
W�s�=ҕ���{��z�+I��JF3��LA.̯)��0���FyC#/��h<�	������f��zq�E��`p�Ht������|
zz�^����'�h�v�7z���d��k"C�r���=�>��� v`8�!�Ľ��L�� A�B�WaF��.���=��%P��cG�Er��E
,��"�gQ�~���

c^2>��1

*
ݫaV�ŠA�������
��@

��xX�+o�_�X���!��� �vh/���{U�xWՉ
c!�!u�)r��{�tŠd4!0�d��[s�M��|&���-�� �&6ޓ4Y��E��(79hh��0*
�@���1����[.&&�$�^��Vgn|�I&��ط㸗�e���nh,�w����1
���I
��g�L��X��e>�Z��7>@SQ��Y���`Ą�C$K�O��z���6���P�̧���&Kʥ
U��{7Jg���1�/���M��R�
�l���+��P�*M?@Šx�Mﰯ�.ET�g����{9C��F�Oj�5��n�wQ)�<�`W��d�\�-�Z�N�o��b��J"l'��	e
ƹ�W�(�vB����
���ƕ��΢�I@
����J'Q\��v�:��-����끴u�b� 3���OŹ���2�`���걩�i�:��.o_I�*��N{���2�n9cJ�Z����uf��ƀ�
���X����	�
�+��
�'tT�$c�/�&*�Q�
��ӌ��8*�������4�&b�,l���^���
��Պ	�e���f|쑕S�ETQ}��x-��횲��ǯ+�ב;�wd������iHb��|�������a�B�W0��
�xѲ�h�?�\v���
��;L�/
	)'N;��{ؑ��8�l}
?�Hz�cH׺9�) ¤X�W���`ݦ� PznS�jFl�c��rc_@ݕ����ϵ�~�9��V��d-�z��d�:۶W�2����.�VWs�?�݃W���P0g��:/wy������	�
N�xw�5x(�d���I�f%�Ebnƍj�&G
-A�H�]��$ed;>���&�?�y�r
-endstream
-endobj
-11109 0 obj <<
-/Type /Page
-/Contents 11110 0 R
-/Resources 11108 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11116 0 R
-/Group 11070 0 R
-/Annots [ 11081 0 R 11082 0 R 11083 0 R 11084 0 R 11085 0 R 11086 0 R 11087 0 R 11088 0 R 11089 0 R 11090 0 R 11091 0 R 11092 0 R 11093 0 R 11094 0 R 11095 0 R 11096 0 R 11097 0 R 11098 0 R 11099 0 R 11100 0 R 11101 0 R 11102 0 R 11103 0 R 11104 0 R 11105 0 R 11107 0 R ]
->> endobj
-11069 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Linear__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 11117 0 R
-/BBox [0 0 214 206]
-/Group 11070 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 11118 0 R>>
->>
-/Length 480
-/Filter /FlateDecode
->>
-stream
-x��T�j
1
��+��H~�B!�Eہ.B7��)%7�t�߯�=��f]���G�H��
�G �a m��	�« ���3\
������%n��.��%�I�G`%�����߸@���Dc
Jo"*؎����
{U��8[���bV�<�-{Y�0�(c�޺b��aY�E\�
8y���)9�G�c2�I�<�Vv�4-7����(0�A�l��zl����N����4�"�T
�
���x+Hj˶\Ji��4ev�p�
-l�n��95>�Y3��@o�kd�_�`Ω�2v�c�����Q�\�˄"���544uV羫	<�}�� �U�VC����CXx'�ŭ�[�b΁���>�u�=�N�@ar(��5�֐�DE�a�:s޾�K��������n���ۂ��֭M�΋u�W֌
���
��t�/�2�(
ˌc�>�	�D����]3������ū��UM3>'���|X����$~�?/
-endstream
-endobj
-11117 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-11118 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /JEERLX+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 11119 0 R]
-/ToUnicode 11120 0 R
->>
-endobj
-11119 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /JEERLX+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 11121 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 556 667 500 556 500 278 611 722 667 278 460 500]]
->>
-endobj
-11120 0 obj
-<<
-/Length 11122 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š�2v@�2ݸ��>@LN�B�!:
߾1�B
-��������=wf\Y��f����h��e�9Il��h�35�5Rx�I�$�����4uF�IӰ�Ë��6vxR�@	c,}s��h���u��Y�C��eI�2Eڗ{�UL�Ґ|���u;�������s\IΊ+$9a��4�?-k�?mBF���i���
p��@y���
TBS�
-yt��I�#��Agh� �@��@e����*�7Ӂ
-�g�%:p��ѝG���.@�W���
-7��W��W�q��c��OYԢ�"�&�`ҾQ�
�7����څ���

�7��v�
-�/����
-endstream
-endobj
-11121 0 obj
-<<
-/Type /FontDescriptor
-/FontName /JEERLX+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 11123 0 R
->>
-endobj
-11122 0 obj
-344
-endobj
-11123 0 obj
-<<
-/Length 11124 0 R
-/Filter /FlateDecode
-/Length1 2404
->>
-stream
-x�UV{L[�?��.ص�
0$16ƄG��H��6�ap���N

5�a������)M�G*UkiӒI��i՞�ڭ�4E]�?%��i�D�vҦ>Ȧ&�贶�z�{
Iv�s����������È1�Úgu#��Y��g�� ��N�
_�ٶ���x��Xr�?-�eL�ϟC�c��ڙ�>9_�#�렏���J�$K��@��N���
-�
��	����Q��T�F���n��s��N��k|u�� ���& ��
f���*2:�v�E#z�^W񉹡O��f��{�����
-W
�I��j��y�g�2k��m��y3�E�E0�EO@�:�\�����	�}�u9ʴ9&��̖���hMn������ù�%��mM%�=�}�
M�X��h���Os?�K�+���rw$�nu�
-s��mq��宩�~߱+�7�k����0��������Da?�
+����͝/�x��
�?�(�p&�`��;�ؔ�'�|Zq���p��˛�.?��荋��������wE��]��wi�����Z�J�V&�[3g���>޺�Ƣ��
��5�`?�	�]����o-Ӛ-ȇ��"��™�م�t8
��r����yi�tˑ����G�3�.brf.*�g&x}1.�
��g�g�
-6*|���M�4�V��Qd3o�����9��87�P��Z�R�eq�Ϡ˄�
.�q
+z����'+��
��d�.���W��UDZ��J�n�
!V3+e��n�ƒ�X at J��c�h�r���IZ$[Ul�7<>8��ӝsE��4�(��@߭�����c��W:��\�2�H�b�y~2<5:|�z���Fܾ���β^��'�
����C�Ѩ�WhOի�-�r�
-��١#陡D�G�\�^���]�A)�N���Y+����{2���{9Cql�s�����~`��V$W�Q�
9���t?���މ��S��ƮO�Xk�;1����/�9���6��~7�
H�fu��� �Ul�vM���^O������t��-�_َC
݃�Os\����H'irw��G���1����
�]��w�_���(=O�� ���>�ތ�V�����q�T�5 ����g�;��_
]\L �W�R>���Yl\�Ɩ�Ɗ���Al"�S��O�%���@�}�?�M����J�t���l���
�A��l����TK��C	�l�A�)k�	�/hsU�
w���8���ŦZ1�>5rM{iw����,�di���H<�r�8�&Sн��7����
��x�����s��Dm�:>|�7������>�tC�
drYL$#?7!���EY�ƛX��2f��?��̓{*�A"9�9}(}
!�<�����͛�I��n���5&�K�O���m���_�O��&[QaE�
o{{��ҫ%&u8��M�/����cZ����x��D �HB���WJ�DK�
�p��᭐����N�z_������u��/����c�j�x�[7?J[�q]�7�	M
-q�lbr�̉�i:hL>�xlr���K��v�JY͌�����O2�j�sǖ�`f���QT$�J3V��#�W��@W��䡚�����b ����@�¬�8�XV�j��x�ha�W<_������w��Z�}L��|�nлe��
�/lP��m4h����J��X?_aC���
�ZX�Wgn�v�OX�֙��17F1F�V�~��eo�
BΨ��Y��|�	�Ϭ{F�t�鱷cӮcj30���"��2�@���!��=F�w�7*�[T���W���
H�
�f�%
�kp�Ѭt���hW�{�H1SBN
�й� �����T
-endstream
-endobj
-11124 0 obj
-1809
-endobj
-11070 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-11081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 423.15 192.544 433.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-11082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 366.826 191.16 377.73]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.976 366.826 256.733 377.73]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.258 352.073 364.14 361.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-11085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 338.667 191.16 349.57]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a701574facbfd5461d399dccbc88a2999) >>
->> endobj
-11086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 338.667 295.747 349.57]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 325.583 191.16 336.487]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab33dcdd2d3caf28d71cf7d3f2270535d) >>
->> endobj
-11088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 325.583 295.747 336.487]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.4 325.583 375.158 336.487]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 285.469 191.16 296.373]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aea92b7e986d474c9f9e92f3fa2ea56e8) >>
->> endobj
-11091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 260.43 191.16 271.334]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ad4d28b09f6a6ccc12af382b731824efc) >>
->> endobj
-11092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.493 260.43 469.25 271.334]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 235.392 191.16 246.295]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ad54fa1aa395d8a01b1d40cef5e307653) >>
->> endobj
-11094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.341 235.392 479.984 246.295]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 198.398 191.16 209.302]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a89a4a8da07d80da533b024f24f4864ae) >>
->> endobj
-11096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.341 198.398 479.984 209.302]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.393 186.443 196.151 197.347]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 161.404 191.16 172.308]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a789ef1b22376ead412872189bc809269) >>
->> endobj
-11099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 136.365 191.16 147.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_acf61af4e3287846f0ca79140ff00a2d5) >>
->> endobj
-11100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.654 136.365 455.412 147.269]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 111.327 191.16 122.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8e50cf8481eaf61b281c180029b36fe3) >>
->> endobj
-11102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.654 111.327 459.298 122.231]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 86.288 191.16 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a54156857db022ca821506d19162ebd5a) >>
->> endobj
-11104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.782 86.288 465.425 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 175.668 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11107 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11111 0 obj <<
-/D [11109 0 R /XYZ 89 770.89 null]
->> endobj
-11112 0 obj <<
-/D [11109 0 R /XYZ 90 441.215 null]
->> endobj
-11113 0 obj <<
-/D [11109 0 R /XYZ 90 385.952 null]
->> endobj
-11114 0 obj <<
-/D [11109 0 R /XYZ 90 385.952 null]
->> endobj
-11115 0 obj <<
-/D [11109 0 R /XYZ 90 342.652 null]
->> endobj
-11108 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F39 2320 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im16 11069 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11193 0 obj <<
-/Length 1583      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�)�f"� =ӗ\�i����'��)��T"�R��� /�(	��K2�L,��=gw��9�y�{1ꝼ�	P�Q�]9v� ����s�g�
|
�s��#xЫ|�����F����Q�K��O�!Z G�w�y��3v�����
|�k�h���9����F����-����|G��
-|����7���Yd�8{
R�ے�#�
*�?a�U����_�y'r��_���d��irc<�bH9A
�����<y07�<WI�YP�
��|7�c��y�-�"���>�!fM�!��s)��瞵
@S���t^��j at 9<c�2)�E6����4L��g�Jf2	��<7�:�U��I5 ��[�~�ˆ�'˙�nok��6`\�M�bϦ�V��6��J+�g9���0�7&)߇if�-�d'����Ɋ��t�*�#�G&2]V��l��En���5\^Q,�mn̄#VSp|��'�[���S�v�œ˙��x���Ry߽3d�2��H���
-"���/�� �
e؍�K�"FRt	y>E��iA
��J�
��[!
浌"L�?���
�'�-��+�Bz�&j��ut�1@	� /;���]@)�QeU��Q�+D���/�|B���W�Ql�r=�$��fi��z�[=W_D5Aҟƫ8��FH��0 �8�
B��1T�.b9U�~
��Y�8����
��h���*��㇈X��,<��)!�<wQG�H�gz�'+� ��&o�QC"�������
h.
5$�
����'\QI3�z���̀���er�H�'���I�n2�?
a�
e˲vҹ���z���f"
o
-�ao E�m7�.EA �
�~��ѣ�}���o�%ۋK]�m6�wE�L�,Y�)\��
-�Z���ʔ�������h�Y.���q�
��(��
�3�_)z��cv:A.�+v�/3޳#�� m�d��MK����������
cUX��]��F	@��R���c=��K��y��W��
}�.��dz��b�Y��W��l|�.�+|H��~��s��D2.�-��d��$��磄�f�*����ey��kh�6�*Av�_�/_6���t�6�U�l]�E8�
�-A���
�0�:�9��C`*8b�8����z3y�CN�h3Xҹ��(�]F1ؽ�[F^؟��$N�.����05�fpc��A��v��)�j�㤃a
-r߆_�1�p�pp�� ���c��ݵ�#��[QE���T�{��tB����0��
ێ��E�H_�Ww/
|���>Ȏ�
�M���
-
�9� M�K�r�}`�G�]� ����ߣw�	v�\�+N���t@�ͪt��ō"�Uŭ�D�6!�>��6Q���D5�l2���&M��!��oX�����!!(�L��IC�a����
E�2�����.�}��b�
F��2d¿�s�c�Ǽ8�mΜW)k�
AްX�:mo�`�^cڔSU��������\f�
8����$YNf���+U9�Y�O!��!��s.+vh�����]���m}��xگ�bqzrr��r�D����� ,�qU��iV�Bx9�(>x�-���
-endstream
-endobj
-11192 0 obj <<
-/Type /Page
-/Contents 11193 0 R
-/Resources 11191 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11116 0 R
-/Annots [ 11106 0 R 11134 0 R 11135 0 R 11136 0 R 11137 0 R 11138 0 R 11139 0 R 11140 0 R 11141 0 R 11142 0 R 11143 0 R 11144 0 R 11145 0 R 11146 0 R 11147 0 R 11148 0 R 11149 0 R 11150 0 R 11151 0 R 11152 0 R 11153 0 R 11154 0 R 11155 0 R 11156 0 R 11157 0 R 11158 0 R 11159 0 R 11160 0 R 11161 0 R 11162 0 R 11163 0 R 11164 0 R 11165 0 R 11166 0 R 11167 0 R 11168 0 R 11169 0 R 11170 0 R 11171 0 R 11172 0 R 11173 0 R 11174 0 R 11175 0 R 11176 0 R 11177 0 R 11178 0 R 11179 0 R 11180 0 R 11 [...]
->> endobj
-11106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 198.909 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae9cc837bbae1745ada3780634c73858f) >>
->> endobj
-11134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 680.251 191.16 691.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8ae08699620424e3c3c97dd7a3885d02) >>
->> endobj
-11135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.961 680.251 406.719 691.155]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 652.546 191.16 663.45]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab60766264325cf8fc82be004b2565ddb) >>
->> endobj
-11137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.976 652.546 230.163 663.45]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.976 652.546 301.734 663.45]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 624.84 191.16 635.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5a74ca4d6d20b677bd8e4bf05dd45760) >>
->> endobj
-11140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 624.84 262.003 635.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-11141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 597.135 191.16 608.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a38856ca7f9129f389b4dee5a5a6da8d4) >>
->> endobj
-11142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 597.135 262.003 608.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-11143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.657 597.135 341.415 608.039]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 569.429 191.16 580.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a4124a10b953c4c49984524875a257f3a) >>
->> endobj
-11145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 569.429 260.32 580.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-11146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 530.764 191.16 541.668]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_abc403edfa30e7e93cfc3aa20be9e3a65) >>
->> endobj
-11147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 530.764 260.32 541.668]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-11148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.531 530.764 340.289 541.668]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 492.1 191.16 503.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a04aff92d245522832391c1704f455992) >>
->> endobj
-11150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 492.1 283.563 503.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-11151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 453.435 191.16 464.339]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa65a75af714fc5abd032b312a647fe3c) >>
->> endobj
-11152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 453.435 283.563 464.339]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
->> endobj
-11153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.774 453.435 363.532 464.339]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 414.771 191.16 425.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a158df02c8c54fa5a9286836fb01563cd) >>
->> endobj
-11155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 414.771 268.629 425.675]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-11156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 387.065 191.16 397.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae2f034a1e5e025d25025f71b644d1133) >>
->> endobj
-11157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 387.065 268.629 397.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-11158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.264 387.065 353.021 397.969]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 359.36 175.668 370.264]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.166 359.36 234.596 370.264]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae) >>
->> endobj
-11161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 331.654 208.395 342.558]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5812366691d9099f839e01326923425f) >>
->> endobj
-11162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.211 331.654 273.968 342.558]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 303.948 170.687 314.852]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-11164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 303.948 195.165 314.852]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aca00917f32f160b28b9870beb5ce5f8d) >>
->> endobj
-11165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 291.465 170.687 301.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-11166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 291.465 187.563 301.996]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a033a152c478db97a4e08bc562dbff4b1) >>
->> endobj
-11167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 278.609 170.687 289.139]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
->> endobj
-11168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 278.609 225.501 289.139]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac455ad97639d9e7f59dbdc22e35dc1e7) >>
->> endobj
-11169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.316 278.609 264.504 289.139]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 265.379 179.554 276.283]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 265.379 250.666 276.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac1b93dcadc82e52690114301554801b0) >>
->> endobj
-11172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 237.673 220.579 248.577]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ad44ed4e61b7e7c0c86918b66f44ec665) >>
->> endobj
-11173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.395 237.673 290.038 248.577]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 210.341 297.728 220.871]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0ed481e43baf024d4a5b5e86e85c4a87) >>
->> endobj
-11175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.544 210.341 336.732 220.871]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 182.635 193.76 193.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_afda2273cf9b1d62249e3604c2c538d92) >>
->> endobj
-11177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.576 182.635 232.763 193.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.933 154.556 342.261 165.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa8f43e35dec15be4374b207a9440eb2c) >>
->> endobj
-11179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 126.851 238.293 137.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa74c2bb5c2c947d02fabe33f854fa7d6) >>
->> endobj
-11180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 99.145 197.885 110.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a51f1b18014b098a53242c06d657040c6) >>
->> endobj
-11181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.222 99.145 302.471 110.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.036 99.145 355.223 110.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 86.288 197.287 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac9ef23a57b1e85eb8c0e905b16feda93) >>
->> endobj
-11184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.429 86.288 300.678 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11190 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11194 0 obj <<
-/D [11192 0 R /XYZ 89 770.89 null]
->> endobj
-11195 0 obj <<
-/D [11192 0 R /XYZ 90 721.073 null]
->> endobj
-11196 0 obj <<
-/D [11192 0 R /XYZ 90 699.142 null]
->> endobj
-11197 0 obj <<
-/D [11192 0 R /XYZ 90 376.524 null]
->> endobj
-11198 0 obj <<
-/D [11192 0 R /XYZ 90 348.819 null]
->> endobj
-11199 0 obj <<
-/D [11192 0 R /XYZ 90 282.594 null]
->> endobj
-11200 0 obj <<
-/D [11192 0 R /XYZ 90 254.838 null]
->> endobj
-11201 0 obj <<
-/D [11192 0 R /XYZ 90 227.132 null]
->> endobj
-11202 0 obj <<
-/D [11192 0 R /XYZ 90 199.427 null]
->> endobj
-11203 0 obj <<
-/D [11192 0 R /XYZ 90 171.721 null]
->> endobj
-11204 0 obj <<
-/D [11192 0 R /XYZ 90 144.015 null]
->> endobj
-11191 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11263 0 obj <<
-/Length 2050      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~ϯ�S�j����`��l����N���t �2

��#JI�_�CR�o�-Q2��ĊM
��w���-l����wg׾m�(�g�M�[�"׃�&���ȳ�#�1
�
	
�2c�͐�A�.f|R��c2.Y�����䜕яO�rH�")�ሺxp�2!��'>���<�4�����/w�~�;�zF�9l͌�������_�5��?X�a`=�E��P>S���g��
�������c�O"D��;���v��y䂼J�d��&9*��>�U$ăT

����=mҒ�~�.��\T���h�ў���b蹃@���
->
R�4Nx^EUɒJ\^��Rj��4�ɮ}#y� �
�h't]����5c
-��u6G+T��J���G��y$�,��$�x.�#6I��R�;�
~B �	�ܴ�T�����u�~^\�6(9�<G‘R�94e������#�7�R�Z-Kk��t�jӍ�
[J1ׄ�ӈ
� ���:��Ek
'�v	�'FB.��n�=H�)c�'�6"J
���<+�ą��
��ey���D��A:+�KP�I	"���,M7l-�<N$"�D�"��Z
wPd��Ԣ�Ѷ����i��ϝgɴz_֑r/3
Q�����!��9/��:�Z����R�<���u��Q
�����V�r$�N�g��7β!&n�ퟚ��t�c��"N��^2���lx�~�$�a �V:[���,��[q��>q �H� џ�,v�[i�����pR�en�
-6F��
W�57�sj#�뀔4��A�3O�	~ҖVv;>
- at q�nY��y8���%�0��V�KD)mW`��s���x.���q�ﰭ!�G�"+�y΋ZD WD��7��XRv������f�TD�� "���etه �$1�����/
A��ȞxaČDU�@��D�'�NP;�VK�fo�G�E��L_��#4{�q\�-V�b��&j��
���Q�n��Z���8��I[
�
Q/D>�G��8����9EzF ���	
+��@X��g6c9[��}�%A�pཱ}�� �垲�/?��}�f<����P�K9MS���m��FeU"t�O�t\��D�$Ѥ�毬���ɲ�,��Ӂ�
�@Q5y��Ҁ(#�[v֚�n�޿׏Z�m
-M>趝��ba�
{)� �$<����g?x؜J���JΚv�\|+��#oYs��i{�c$�ٱ��ݼL��}�F�!L��A�s�/�(	%��q�I~o"v����b�K�5���ʿ���A��;�0�A���?�ް�~��v�`��n����P�gIW��r�e2��7��
ڧ��C�֡=�ۡa��5\�5�:Vu
|��
J��X���A,;o|m��y��ǹ��F簱�B���=F�G��e{�Q�6���q�؞ ¡7t]@
��x_'���.{R'*�8�BL��� Pz��S�
-#����:(���D�Z��
#�w���Y�^{�>=x��|m��{
-C�u�*Y��cR͌��|���x��#��0��g�iG��ȋ����_<���/�U1_���V�h�����<`���4�}a'����J��d�KDJ�we��9��w/u�
��YUū��i_��zK"yQf,���}E���m��>���@o�v9Y�o}���N�w�P�>��L]���_*�fB�,L���Jf�r���|i(��qx�MN��#�J
�������(
9��~(h�jb`���z<�i���<��5<_�y\m]��MD�d����~
}�s����=m^*�/����IVg����ty/k"nG.3H(�1��	�C� q��{I�T�i1����o�%$_��g
{��2��&�l����b�h��2�~o{uNINT��цG*_�Ha��x]ɛ�jzT
M�|W�}7se���n�滖ߛ����W���9B#��,��kC)�~�\JC�R_3v��-45�X��O�5Xw��A�2Sͪj~yq1��4�G��*��mE�a�KLӶNΊ�ˠSY-+\�d�G�y��(�+d5L|������vc����̶�S�������<�b
-endstream
-endobj
-11262 0 obj <<
-/Type /Page
-/Contents 11263 0 R
-/Resources 11261 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11116 0 R
-/Annots [ 11185 0 R 11186 0 R 11187 0 R 11188 0 R 11189 0 R 11219 0 R 11220 0 R 11221 0 R 11222 0 R 11223 0 R 11224 0 R 11225 0 R 11226 0 R 11227 0 R 11228 0 R 11229 0 R 11230 0 R 11231 0 R 11232 0 R 11233 0 R 11234 0 R 11235 0 R 11236 0 R 11237 0 R 11238 0 R 11239 0 R 11240 0 R 11241 0 R 11242 0 R 11243 0 R 11244 0 R 11245 0 R 11246 0 R 11247 0 R 11248 0 R 11249 0 R 11250 0 R 11251 0 R 11252 0 R 11253 0 R 11254 0 R 11255 0 R 11256 0 R 11257 0 R 11258 0 R 11259 0 R 11260 0 R ]
->> endobj
-11185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 707.957 214.442 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a74deedff2114e5a1c72305ba6c6e42ed) >>
->> endobj
-11186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.584 707.957 317.834 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 684.003 233.76 694.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aea8819f3edb590eff758fe295c7f3300) >>
->> endobj
-11188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.575 684.003 272.763 694.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.205 684.003 323.393 694.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 658.011 242.965 668.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae9de3534d98524f48d9f6c0cdfbf239c) >>
->> endobj
-11220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.303 658.011 327.079 668.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-11221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 632.02 231.1 642.924]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa66d8fe880ea6f99aa1a70805427d9d6) >>
->> endobj
-11222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.915 632.02 270.103 642.924]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.916 632.02 345.559 642.924]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 620.02 246.034 630.924]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a34bbf3ed8e75730f44ca8a461881adb6) >>
->> endobj
-11225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.522 620.02 360.71 630.924]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 594.403 164.879 604.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac220e6f2cf884a8b2bb4017fc9ae53da) >>
->> endobj
-11227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 568.038 272.783 578.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae25d01221fd2014bead64c551c33c9c5) >>
->> endobj
-11228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 542.046 191.718 552.95]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-11229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 542.046 288.852 552.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_abca5613972564c8ec5c832bc8ff200d6) >>
->> endobj
-11230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 516.055 191.718 526.959]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-11231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 516.055 303.079 526.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3a808cf2742df02d856a8d9882845861) >>
->> endobj
-11232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 490.437 150.493 500.968]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5bb7f6903958069b19f70d1391987a51) >>
->> endobj
-11233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 464.072 181.845 474.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab48b93c69098ab1dccd8d063f9c41575) >>
->> endobj
-11234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 438.081 181.845 448.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) >>
->> endobj
-11235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 412.09 154.727 422.993]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) >>
->> endobj
-11236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 386.472 176.505 397.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a298a32e26d8133869f28560cca4ba73b) >>
->> endobj
-11237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 372.429 450.955 382.335]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) >>
->> endobj
-11238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 349.148 169.013 360.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aadaa110a051cded2af6bb04516e8b72e) >>
->> endobj
-11239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 349.148 250.079 360.052]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 323.157 191.16 334.06]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6e35bc42eb22008e842e81b150eeab6f) >>
->> endobj
-11241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 323.157 295.747 334.06]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.4 323.157 379.044 334.06]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 297.165 191.16 308.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a37e6e92bcce55054b61338c740ecabe6) >>
->> endobj
-11244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.497 297.165 295.747 308.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.4 297.165 379.044 308.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.133 297.165 488.89 308.069]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
->> endobj
-11247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 271.174 182.044 282.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3878ace0dfcc23f80d55d206d2117c84) >>
->> endobj
-11248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.381 271.174 286.631 282.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 259.548 175.748 270.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8a1eeaa7f9845c9d33a22c8c5f5acab2) >>
->> endobj
-11250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 247.175 197.337 258.079]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aeba04371a7fce3d1b5a20b287937feea) >>
->> endobj
-11251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 235.549 176.495 246.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a61a01c066394a2b9ee5d797f6733c5e4) >>
->> endobj
-11252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.832 235.549 260.608 246.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-11253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 168.133 203.075 179.037]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 168.133 296.324 179.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 154.464 346.908 164.369]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 142.515 194.297 153.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_abaf335015f8c71026d2bee65ce4d109f) >>
->> endobj
-11257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 116.524 188.759 127.054]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aea20a64dc7e9dd789fb069c7b8faca16) >>
->> endobj
-11258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.953 90.159 238.203 101.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.942 90.159 268.08 101.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-11260 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11264 0 obj <<
-/D [11262 0 R /XYZ 89 770.89 null]
->> endobj
-11265 0 obj <<
-/D [11262 0 R /XYZ 90 700.361 null]
->> endobj
-11266 0 obj <<
-/D [11262 0 R /XYZ 90 610.337 null]
->> endobj
-11267 0 obj <<
-/D [11262 0 R /XYZ 90 584.345 null]
->> endobj
-11268 0 obj <<
-/D [11262 0 R /XYZ 90 558.354 null]
->> endobj
-11269 0 obj <<
-/D [11262 0 R /XYZ 90 532.363 null]
->> endobj
-11270 0 obj <<
-/D [11262 0 R /XYZ 90 506.371 null]
->> endobj
-11271 0 obj <<
-/D [11262 0 R /XYZ 90 480.38 null]
->> endobj
-11272 0 obj <<
-/D [11262 0 R /XYZ 90 454.389 null]
->> endobj
-11273 0 obj <<
-/D [11262 0 R /XYZ 90 428.397 null]
->> endobj
-11274 0 obj <<
-/D [11262 0 R /XYZ 90 402.406 null]
->> endobj
-11275 0 obj <<
-/D [11262 0 R /XYZ 90 365.456 null]
->> endobj
-11276 0 obj <<
-/D [11262 0 R /XYZ 90 339.464 null]
->> endobj
-11277 0 obj <<
-/D [11262 0 R /XYZ 90 313.473 null]
->> endobj
-11278 0 obj <<
-/D [11262 0 R /XYZ 90 251.16 null]
->> endobj
-11279 0 obj <<
-/D [11262 0 R /XYZ 90 186.09 null]
->> endobj
-11280 0 obj <<
-/D [11262 0 R /XYZ 90 186.09 null]
->> endobj
-11281 0 obj <<
-/D [11262 0 R /XYZ 90 158.449 null]
->> endobj
-11282 0 obj <<
-/D [11262 0 R /XYZ 90 133.529 null]
->> endobj
-6368 0 obj <<
-/D [11262 0 R /XYZ 90 107.538 null]
->> endobj
-11261 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F11 613 0 R /F68 3032 0 R /F66 3179 0 R /F67 3037 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11377 0 obj <<
-/Length 1138      
-/Filter /FlateDecode
->>
-stream
-x��Ks�6���8��$\�
�3�4�;MR7��^����!ES�t(Z��/�%E��Q�O��X,��
-�h�0����׿P
y�I*�`�<��@H��][LH���-b��I�*�~�����rp������=b�0"� �E�Y��3Fw&�-��<=��f�Sf>���g�`�"I&�fFֺf� !��ԏ���P�Z�0���<է�ؿ��0r(ƽL�',�ek#A`+���EJ��L?�A����VGYzTt
-FY�	���C<W��b�R6_�8����ٵ#0��O�G7���Gz>7=T7K�	�u��a�j]��0����O���u^�M^gSМD��
�V�r�%O�H)HN�C8������!2�/�%�i�YZ�[F�)�T�A^�M��D�&Y���	�IQ��61.P�/��mB0��Z�]�:DP*0����ѭ�mB�Y:�v��5_�RX�wSS)䱅�,�XZ��{��E� �I�"`�AVv6�dGw���~��Y�q�:��ũQ�wQ�3jބzdSaҘ':�o�ȟ�󳳔��H�t��ab�$H<
'�
�ׁ��������a�9���
_7�J���O�W7�=u$�%�u:h�4��j<3�
ӆ��10�s��n�-A
u��V�P�V-�W����h!P��P�=}V#s`�+��&//ы:.�~D�}|�i�I���EW��� )�(��<
iG���4�i�ľ vӿ��
�%/���dWjD��� c[�k 
-8Se�=c�2����ت�f�{x%�`D}W�$�
���<oʑ�r�)ה\�P�A��Y�U�f��/��DM7�Z�^Ԋmh�V�
������D"F�ԯ�$B�X��]~��h6.�1)�]�[�Š\�[��wi( ��8���H+	eU1�&�<ȧR�[r�}:�~�؃�ഘ��d2=�v�?��ք�a���]��{��^
׷>I������f�5�[e��9�̞���DRP��}h�Ґ+^�B�k&���p5�m��o3�~	��R�c�9����\C�%����:���J���}��k��m!���������K#,l",
��B�d��v�֕.�v��?K��%O|Ī>��S�r%}����~��a<�����[j�ƞg���Q�/�YX<��&s�'c`�x�ē�
-endstream
-endobj
-11376 0 obj <<
-/Type /Page
-/Contents 11377 0 R
-/Resources 11375 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11116 0 R
-/Annots [ 11290 0 R 11291 0 R 11292 0 R 11293 0 R 11294 0 R 11295 0 R 11296 0 R 11297 0 R 11298 0 R 11299 0 R 11300 0 R 11301 0 R 11302 0 R 11303 0 R 11304 0 R 11305 0 R 11306 0 R 11307 0 R 11308 0 R 11309 0 R 11310 0 R 11311 0 R 11312 0 R 11313 0 R 11314 0 R 11315 0 R 11316 0 R 11317 0 R 11318 0 R 11319 0 R 11320 0 R 11321 0 R 11322 0 R 11323 0 R 11324 0 R 11325 0 R 11326 0 R 11327 0 R 11328 0 R 11329 0 R 11330 0 R 11331 0 R 11332 0 R 11333 0 R 11334 0 R 11335 0 R 11336 0 R 11337 0 R 11 [...]
->> endobj
-11290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 658.198 191.16 669.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 658.198 232.465 669.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) >>
->> endobj
-11292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 658.198 337.051 669.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.208 658.198 460.457 669.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 630.395 191.16 641.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 630.395 232.465 641.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a4d372c4dff7d328d3da118817ed3d8b7) >>
->> endobj
-11296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.28 630.395 271.468 641.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.281 630.395 316.469 641.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 602.592 191.16 613.496]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 602.592 232.465 613.496]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a9dd6ce1cb02b58fd3b973e40867362ac) >>
->> endobj
-11300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.28 602.592 271.468 613.496]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.803 602.592 382.052 613.496]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 574.789 191.16 585.693]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 574.789 232.465 585.693]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_af5bbfb14fef626aee9f34e71a78c0d7d) >>
->> endobj
-11304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 574.789 337.051 585.693]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.705 574.789 389.893 585.693]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 546.986 191.16 557.89]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.557 546.986 232.364 557.89]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a49574f120ec3f9fbfda58d6f826587e9) >>
->> endobj
-11308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.305 546.986 486.554 557.89]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 519.183 191.16 530.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.557 519.183 232.364 530.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) >>
->> endobj
-11311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.5 519.183 336.75 530.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 491.38 191.16 502.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 491.38 232.465 502.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) >>
->> endobj
-11314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 491.38 337.051 502.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 463.576 191.16 474.48]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 463.576 229.964 474.48]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a72b6b45299672d85c7984392454296d6) >>
->> endobj
-11317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 463.576 334.551 474.48]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 435.773 191.16 446.677]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 435.773 229.964 446.677]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) >>
->> endobj
-11320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 435.773 334.551 446.677]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.707 435.773 457.957 446.677]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 407.97 191.16 418.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 407.97 229.964 418.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a114f91c420cc8060d6834730c8e55721) >>
->> endobj
-11324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.78 407.97 268.967 418.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.781 407.97 313.968 418.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 380.167 191.16 391.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 380.167 229.964 391.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a9075dd07574234cc124e6076c272e987) >>
->> endobj
-11328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.78 380.167 268.967 391.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.302 380.167 379.552 391.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 352.364 191.16 363.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 352.364 229.964 363.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8d443d5098921978efd7b625000f3b68) >>
->> endobj
-11332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 352.364 334.551 363.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.205 352.364 387.392 363.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 324.561 191.16 335.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 324.561 229.964 335.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) >>
->> endobj
-11336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.287 324.561 484.536 335.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 296.758 191.16 307.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 296.758 229.964 307.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab4396e8bfbdd5831fd37d13c19194cc4) >>
->> endobj
-11339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 296.758 334.551 307.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 268.955 191.16 279.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.623 268.955 231.792 279.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) >>
->> endobj
-11342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.979 268.955 486.229 279.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 241.152 191.16 252.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.623 241.152 231.792 252.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) >>
->> endobj
-11345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.058 241.152 336.307 252.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 213.349 191.16 224.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 213.349 248.325 224.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) >>
->> endobj
-11348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.141 213.349 329.39 224.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.547 213.349 452.796 224.253]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 185.546 191.16 196.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 185.546 248.325 196.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a385e4d3cfe442f4fcbeefd9acf5c10eb) >>
->> endobj
-11352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.141 185.546 329.39 196.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.044 185.546 382.231 196.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 157.742 191.16 168.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 157.742 248.325 168.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a98b5ccd1157e6ec8beec7702af9acb36) >>
->> endobj
-11356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.141 157.742 329.39 168.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 129.939 191.16 140.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 129.939 245.824 140.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a80d43634ca26fd76dcb1fdede6363dc5) >>
->> endobj
-11359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.64 129.939 326.89 140.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.046 129.939 450.296 140.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.136 191.16 113.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 102.136 245.824 113.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a691b91bcd9b5c336892574e975235de5) >>
->> endobj
-11363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.64 102.136 326.89 113.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.543 102.136 379.731 113.04]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 191.16 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 74.333 245.824 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a65766b549090f6b52281c99cfba9eed3) >>
->> endobj
-11367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.64 74.333 326.89 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11374 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11378 0 obj <<
-/D [11376 0 R /XYZ 89 770.89 null]
->> endobj
-11379 0 obj <<
-/D [11376 0 R /XYZ 90 704.286 null]
->> endobj
-11375 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11522 0 obj <<
-/Length 1465      
-/Filter /FlateDecode
->>
-stream
-x��[�r�H}�W�J4�
3è�{IR�fk��w_��
-[H�V�
���p����d	�.��1j��3�{�����ƻίg��[�
����8
-�V�
�oh��#��.��'��M���E�Nn��a�>�������s���o��"��űV�rl�6q�8~�F^�}p�i�T:&���r�����C�8l����c\N;�_�1��
��r��Thjؔ���8�����_�?S?3
�S��OBŽ!	A�d�~�y�F&W^6��>ecO���c�pl�%�Uc���p�T���ܹ�D��B�[��#J�B"�S���B �>�I�KXu�X��J�����N�g��%�t)�����(Ω�R~�lR�q>���u��.b�x��uqi/^�+t�Ù�Ie~P�d��k�Y��g�Y&u�	)g��U|�
�4bC'�Wy<��Ȣ\C/}/HI��I��_�A�
"
$Y�h� �M�YLŝ9�`�R
��v.#�U�\B}�{��<>~<�%R���ܽ��%�H�e�jB����H2����=��B���9������X�Y���A�Qc<ۅ0�����9�� v�,���@����M���S " [...]
���Pq�B׍-�lO	�1�82�k�"���ZbDŽ�U��&?�ې_�8J��K]�BB�u���ʬJ{�;a�3�j�+}P��	�t>���@�K
�y��
-0� L!�����嬻��\sbd	�
��U3�R���
--QK��*��\mFX" ~���ꉍ��t�7]/�HW-`x%o�����
��#@��ᴒ���Uewņ�u��U��҄�oXH
ٵĮ�$)��lU��y��%�ѺD
ɞӃz����=��ȡ��%q2���8�<wjm�'EHyO
-3����_��Ro at 8�x�+L���&ik�=�j]q����*���l�O��!M�

N5sR�~{)��M��͚�j���෻�Ƨ7v�e��. o��2À�B��N1'�.��ι6_��@�q
����7|m����8y`�t��>�q��9a	n�c7-®�n
Q�&�m��Zm$�%-�N-df�P��
��@������bj��[�h�a�t�júJ����ǁ߾���
_�𶍧b�	vT5�a��'W�?�l޶&���a�ͧԪ?/�M��-D�^�)
i�y��I�z��ʇ�j�
�#�0�_^8̎'��`����=�M��x����]�"I٦�v��p��-iPaKċ'Ί�gNN>f�b/�����+��
���Z�x�q��[jam5���`��+�Gf�F1�C�6��wǹ�8_~WI2��z�q�ct�=�u�f,����{�0�gF�C~ ��g��G�	�H �_;a"�2~J������@����� ������x��
-endstream
-endobj
-11521 0 obj <<
-/Type /Page
-/Contents 11522 0 R
-/Resources 11520 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11116 0 R
-/Annots [ 11368 0 R 11369 0 R 11370 0 R 11371 0 R 11372 0 R 11373 0 R 11402 0 R 11403 0 R 11404 0 R 11405 0 R 11406 0 R 11407 0 R 11408 0 R 11409 0 R 11410 0 R 11524 0 R 11411 0 R 11412 0 R 11413 0 R 11525 0 R 11414 0 R 11415 0 R 11416 0 R 11417 0 R 11418 0 R 11419 0 R 11420 0 R 11421 0 R 11422 0 R 11423 0 R 11424 0 R 11425 0 R 11426 0 R 11427 0 R 11428 0 R 11429 0 R 11430 0 R 11431 0 R 11432 0 R 11433 0 R 11434 0 R 11435 0 R 11436 0 R 11437 0 R 11438 0 R 11439 0 R 11440 0 R 11441 0 R 11 [...]
->> endobj
-11368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 694.751 191.16 705.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 694.751 247.687 705.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0dddfc1f0ff6f55a90c4ea8829b9752b) >>
->> endobj
-11370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.503 694.751 328.753 705.655]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 666.346 191.16 677.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 666.346 245.476 677.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a695843d7e86aecb1d5e9632aae3eec88) >>
->> endobj
-11373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.291 666.346 326.541 677.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 637.941 180.032 648.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) >>
->> endobj
-11403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.848 637.941 261.097 648.845]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 609.535 191.16 620.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.914 609.535 267.663 620.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a392d8d530782ff1240e73a9fb15f7975) >>
->> endobj
-11406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.986 609.535 348.235 620.439]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 597.954 149.098 608.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 569.175 200.067 580.079]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ad5080c3ee416a445b60ac48971d9b808) >>
->> endobj
-11409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.284 569.175 280.534 580.079]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [491.68 569.175 513.996 580.079]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 557.22 165.158 568.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 528.815 199.519 539.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_af0d240ef2e0e5d6771cb1767f6fa64b3) >>
->> endobj
-11412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.736 528.815 279.986 539.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [491.132 528.815 513.996 539.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 516.86 165.158 527.764]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 488.455 191.16 499.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.103 488.455 267.304 499.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a97f2c2912a13988f28555bee4fe96ef4) >>
->> endobj
-11416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.721 488.455 347.971 499.359]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 476.873 149.098 487.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 448.094 226.034 458.998]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a37de3f55cf5e917e32f7f2f9c6d34840) >>
->> endobj
-11419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 448.094 398.426 458.998]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 419.689 156.281 430.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3024f7593cf48937f80197fb8030c290) >>
->> endobj
-11421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 419.689 237.346 430.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.558 419.689 332.808 430.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 391.284 191.16 402.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 391.284 232.465 402.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) >>
->> endobj
-11425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 391.284 337.051 402.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 378.078 191.16 388.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 378.078 232.465 388.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) >>
->> endobj
-11428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 378.078 337.051 388.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 364.872 191.16 375.776]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 364.872 232.465 375.776]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3393f0e95870b681e528c15803a26f60) >>
->> endobj
-11431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 364.872 337.051 375.776]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.227 364.872 413.414 375.776]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 351.665 191.16 362.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 351.665 229.964 362.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab4396e8bfbdd5831fd37d13c19194cc4) >>
->> endobj
-11435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 351.665 334.551 362.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 338.459 191.16 349.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 338.459 229.964 349.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0540634ba6d2d2175bf25e92a0831af1) >>
->> endobj
-11438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 338.459 292.489 349.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.824 338.459 361.011 349.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 325.253 191.16 336.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 325.253 231.827 336.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) >>
->> endobj
-11442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.164 325.253 336.414 336.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 312.046 191.16 322.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 312.046 248.325 322.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a98b5ccd1157e6ec8beec7702af9acb36) >>
->> endobj
-11445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.141 312.046 329.39 322.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 298.84 191.16 309.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 298.84 245.824 309.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a65766b549090f6b52281c99cfba9eed3) >>
->> endobj
-11448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.64 298.84 326.89 309.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 285.634 191.16 296.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 285.634 232.465 296.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) >>
->> endobj
-11451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 285.634 337.051 296.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.208 285.634 460.457 296.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 272.428 191.16 283.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 272.428 232.465 283.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a447ce24e7e4fdf595ebaa4cf5d1c38b8) >>
->> endobj
-11455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 272.428 294.989 283.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.324 272.428 405.574 283.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 259.221 191.16 270.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 259.221 232.465 270.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a49574f120ec3f9fbfda58d6f826587e9) >>
->> endobj
-11459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.787 259.221 487.037 270.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 246.015 191.16 256.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 246.015 232.465 256.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3221626e22e187252b866eb371001183) >>
->> endobj
-11462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.802 246.015 294.989 256.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.324 246.015 363.512 256.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 232.809 191.16 243.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 232.809 229.964 243.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a72b6b45299672d85c7984392454296d6) >>
->> endobj
-11466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 232.809 334.551 243.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 219.602 191.16 230.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 219.602 229.964 230.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) >>
->> endobj
-11469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 219.602 334.551 230.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.707 219.602 457.957 230.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 206.396 191.16 217.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 206.396 229.964 217.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5c4134b034447fcf2b7b154102233dcf) >>
->> endobj
-11473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 206.396 292.489 217.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.824 206.396 403.073 217.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 193.19 191.16 204.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 193.19 229.964 204.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a15c22785d951d9f8f6ec2e14f07b2dc1) >>
->> endobj
-11477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.301 193.19 334.551 204.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.726 193.19 410.914 204.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 179.984 191.16 190.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 179.984 229.964 190.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) >>
->> endobj
-11481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.287 179.984 484.536 190.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 166.777 191.16 177.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 166.777 231.827 177.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) >>
->> endobj
-11484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.15 166.777 486.399 177.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 153.571 191.16 164.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 153.571 248.325 164.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) >>
->> endobj
-11487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.141 153.571 329.39 164.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.547 153.571 452.796 164.475]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 140.365 191.16 151.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 140.365 248.325 151.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab1a39b5a84040af5feee0336b275fa95) >>
->> endobj
-11491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.141 140.365 329.39 151.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.565 140.365 405.753 151.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 127.158 191.16 138.062]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 127.158 245.824 138.062]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a80d43634ca26fd76dcb1fdede6363dc5) >>
->> endobj
-11495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.64 127.158 326.89 138.062]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.046 127.158 450.296 138.062]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 113.952 191.16 124.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 113.952 245.824 124.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a703e355f3726c0cace243d4fe4b74125) >>
->> endobj
-11499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.64 113.952 326.89 124.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.065 113.952 403.252 124.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 100.746 191.16 111.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 100.746 247.687 111.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0dddfc1f0ff6f55a90c4ea8829b9752b) >>
->> endobj
-11503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.503 100.746 328.753 111.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 87.539 191.16 98.443]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.9 87.539 245.476 98.443]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a695843d7e86aecb1d5e9632aae3eec88) >>
->> endobj
-11506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.291 87.539 326.541 98.443]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 74.333 180.032 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) >>
->> endobj
-11508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.848 74.333 261.097 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11519 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11523 0 obj <<
-/D [11521 0 R /XYZ 89 770.89 null]
->> endobj
-11520 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F24 529 0 R /F68 3032 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11558 0 obj <<
-/Length 2672      
-/Filter /FlateDecode
->>
-stream
-x��Z�sܸ
�_��T�X
?���=�I��k�K�ә�MF�˵��JI���
��j�v���I	�  ?P�ΕÝ��xy��H9	KB:�'�N�',�m�|tU/~���Qa�D�,����w�o�]~���7�g��
qG��E��ڞ}��;k����L%�sc���/<s����θ��e
-�@&�C�؉�`B� �H����zue����g�G/��}�:�>���U����M"Ʌ��v���#]�?m���\�2���(��

�
C�/<)���ԛ�
�-��Lͧ�J����X�E�|��FW�X酙W�#���5%A at z2�'6p��
!��VY����T@�6'�^��d��$��S&��z�<e�x�I��@��e���i���Y_\�uS�t�0
�����*m�
-�^� 'px4\�a��F
N�qĒ8ii�<3����x���7!2�3�R0������B���ia�>�����z"n���)�q�+�� �J���E\O��B~0���`�'8h�n�,�k����^Uٮ��;� �x�g�*�d��HNm���m��S��sB��Y����Uc�z6��zOq�	Vi
��^O8.�=%�	Qu�q�8d<�>Tdw����0Gw at 8'�h@2)��DX
#�qH�����ٿfd*_� ~D�
.&Y,��=�
 @����
q��j��(<����6b���3 ��e��
�x�)`�2z>��T��%��ՓJ��CX�	���(o�!�ϰ�!�C��W��Y�;���[�R�:���8��'�V�a�
<��h�ޥ+���NW�s�����7f$y�b�O�~ ]V4�\�:VӌIh[��9oR,
-{
͈� 0uV�kb����	_2O��QNuZ
i��U;K�8�Y��Y$�16ȦAf�T�n���ܖW��徝��-��������9�]��
��PloJz.Q�}�ې�ң
���8k
���4#��~�Tl������ZSgZij���L�le�y���������EV\Y��8N�� (G
:0WgL3<Y� Σ0��i�5���-w �F��j�����)F"Me�TM��O�z�i�n��ն{WZ	aF�j�����^��g
��ɮп��9�j�PÜA3T��Vx���*K�U��q��Dc|��v�tn��υ�m�*�O�q�jc �ɉ�ց�%,t,�
���.'�Ig<�	 ���j�������
9ٙe�-��ᐒ�D=ڔ-�Qaʏ�ߔxU\�O`
�;	呣����'�4�
E�,7\
y
�kz͊U�_۱}�Vw$gA�c����L�p�YO�mfP['ΌQ�ւ3��,$�#l�I��h�.��=�
5Y���l�[�Z�Yz=�+#
\�z�Τ6�
dE
AK`wJ��[`{��
Yf��]z�h�îp��m��ۂ�ʂ��
݂N��b�Jū��ŋ����!��z:g��
��I2�u�~����
���d���I�y�d��] `0L����$�	��`�k�(��L�r�bU,;�t˲5FC�a���:��1CY�sZ����.��X��ٝ���=�2�4_���^���l����
���0,�z����[�1"O���65���QG���	M�l}gS�y�[��8i��
����u�ʀ�@�
��DL|	<�' ����
-(>���}���.���"�A��_����;���G�Ÿ�ZM����n��s*>v��~�b\t{Wsgd���Y�9�
�X�`�SP�GP��5@������C�
b
��è�I�d�"��4o�}&b��{oi�GcX
9����w��_��
�9���ӊ��5�8l/ �h�nt��O�w����'�B~��v��
-ck�����^�Ϫ6��屌�	����6z�@r$�|�@w���H��/O$�Dzn9��n�M� ���@P�P��6

X�۽��`�Jk��U͞�y�X����\v'p�f&����}2�s	���.4
2�a7]��r����xt��
(%�o����$��bs��U`H��*�KUЯl?t$��K
s�`<�ץ�
-	��t�'0}S�+S�
-���2�����w�L$���y��c�x �T�"֛�nW�d'��Ƃߢ���0�5�X�A�)���֘�W�e�V
�{�-�
!tȹ[lio�_��oo�d�>��Gݯ˕����
�X����OF�u����/���S$p������Si���T��t�qJ��ذ
-���z�P �s������jF�%���)D�< ��Ex�-+̌�{wqa�y� �A-�$B�!S*

����2(p��'�AAQ� �<"����<?�g��w�(F�A���s��G�� ��P��F�C�"΂`>b��%���<��6M�bB�:Fp���j��<�Ыr��ʼ%�
�N\�l�<(ɨ6ɘyt	]ݷ{Ӏ��Ɛk����N��dX3���NѿC	��E���AT�hz+ at i�[��t���K�-�
wi3��թie�+��
x��x���k,��5��
�T�Ec0j� 1�v|��'<�fp�6��
����[�.�Y��~^ϰ��#'
-}*g@°]t\ξ����u՚
����4_t_^)�V}���{R����Қ����/��>
��<]7���ŋ��
-�y�V���D�8?Q�q���mٛ:��-���Ӿ
-endstream
-endobj
-11557 0 obj <<
-/Type /Page
-/Contents 11558 0 R
-/Resources 11556 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11116 0 R
-/Annots [ 11509 0 R 11510 0 R 11511 0 R 11512 0 R 11513 0 R 11514 0 R 11515 0 R 11516 0 R 11517 0 R 11518 0 R 11543 0 R 11544 0 R 11545 0 R 11546 0 R 11547 0 R 11548 0 R 11549 0 R 11550 0 R 11551 0 R 11552 0 R 11553 0 R 11554 0 R 11555 0 R ]
->> endobj
-11509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 191.16 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.914 707.957 267.663 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a29d81c4c365b593f707cbfd0f960631f) >>
->> endobj
-11511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.986 707.957 348.235 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 696.376 172.619 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 683.297 191.16 694.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.103 683.297 267.304 694.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a58ce6d6e87e4bf19e99478994bbb6010) >>
->> endobj
-11515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.721 683.297 347.971 694.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 671.715 172.619 682.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 658.637 226.034 669.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a37de3f55cf5e917e32f7f2f9c6d34840) >>
->> endobj
-11518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 658.637 398.426 669.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 645.931 156.281 656.835]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3024f7593cf48937f80197fb8030c290) >>
->> endobj
-11544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 645.931 237.346 656.835]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.558 645.931 332.808 656.835]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 571.985 255.069 582.889]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.521 393.733 182.709 404.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 357.868 124.191 368.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 287.635 188.212 295.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 250.248 188.212 257.774]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 242.278 188.212 249.804]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 234.308 188.212 241.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 226.338 188.212 233.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.141 226.338 280.266 233.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
->> endobj
-11555 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11559 0 obj <<
-/D [11557 0 R /XYZ 89 770.89 null]
->> endobj
-11560 0 obj <<
-/D [11557 0 R /XYZ 90 632.579 null]
->> endobj
-11561 0 obj <<
-/D [11557 0 R /XYZ 90 163.321 null]
->> endobj
-11125 0 obj <<
-/D [11557 0 R /XYZ 90 140.944 null]
->> endobj
-11562 0 obj <<
-/D [11557 0 R /XYZ 90 140.944 null]
->> endobj
-11126 0 obj <<
-/D [11557 0 R /XYZ 440.133 77.486 null]
->> endobj
-11556 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11568 0 obj <<
-/Length 2502      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���S#�D0pp���i�M��8�i��ez��.�$g�����DҢw:�� <�p��| M�O	M�~���˷�'�X*��O,M��D*�v�|�0J���tr5et�nW����d�|~���ͻ��6�>�y�n������<n��L��n�YOg ��e������>��3
�L��ӏ�?^|}��Cp4a
�$�$���4���J�5���*��s��|��
��+��0J���1�Xm������2�g��[lU=�5Q`����?��mM�(��u������9&8�вф3U<�����c �h
�
�!\@>FN�)��Ɩ�;��h���]WS�)c?p��� �X#�3n:3�r�
b6A%i8��e�`v�qA(���p)΁��&��3Ťl��	���?T��LJ��7���U��h�&��kL���F�J�`�����]�ҩ"�8�Id����jӲ��a�ՋkL��\�Bme�r-�SaA�W<Q���[�����e����F.|�h�a�^�l��bMhb�
�m15�r�Ш-��!��q��/���r��|���g�O� a��G��<:�x�θ~Nn�����W�o7+_J�G��7on| 	Ni
�opGΛ�ҽ+I,��m����t��W��/��F�l
-r��ɦLN�㰢�^,��`r���웩����r�%֥�;_Xo���ͱ�t�X>����>�ѧ��&6�F'��oF��B��ʟ��¯�6��n�X��F��i�{Ho��ጨ�1eh
΂'�����I��͑����I��2K@�sy�"�)���%%�r
H��6 �fʜ��������<r��:���/C���XTA���K��xN6���.U�����y�k
�|g���S
�
�b�^
��7z=͢��E�T}yTI֕�VƎ0���bRܝJ~����ܖ��g�L)���
-=�Kzݶ��\�BI�\B̠ɬ5��ǫ�ɫNPE��*<��R�?�y���i&/��:��.z�}�Q/'
񕑆�Qa� 
)��
Lc@�AD#��aBc@�a�M�iQI/�N�%&�8p����vp�d����H
-V��
�
>J����uz��’���B�Zϑ�#��(�A��jϹ[��u���ݧ�0Э���{L�-1YC�0q�z�Qf�
�-x7Ui�\u���JA�(�֞rҪ�
G�$�&�q[О�ԅGiO�����W=��ה1G!ʩ
-B�a�!TU��U}y��s7W� L�ԩ��P�yK�Gݯ���)���l�QW�KD�2ף���
u'��{t��
�`䖱ͣ��w��,|߆B�NG��+�)���1r
-!q����9�BNA�S� "��!9�BNa�S�B�
-U	Q�:��"���=�I}nB!�@S
-���B�f
�W�(4o�z�q.�/Dy����Hz	Q����`dgN���^�fR����a@�mc�q�ޢ�/�׊nO�k�Y����*qbɱ���Eu�]�ZvѠ�s巎�R�&U�I�Zw�-)D/�tBG%�"_}
U�L榴1�.7���@�(-b=��J� 
UZT!�:W��x�
�>���#�|JQt�s��p>s��
n���V��H�塭<͕GM� ՜�l�J�NX�(�r\3�4z}��� Sy&�qdkY�#[���lm��������
�ڌ���'wm^���4�+�`)�M:q��gq��^�B6b�@�a]�-�*m�_�%��K��ڮR��
vY�-�4]!R���N*M�o>���t�����ʴ��.,�chKgJ	� m9��-#��� ���0
іc@�2��[[��S��U!ޡ-
�F��ɢP:뒓���3�%�֖�p=N��2���×(�{�*$�s�ر����J��Dߜ��TTw�;Q�Ͼ�
I��}�
Ά�2_a��-ư1Ù��aD� aD��aD�F��0R��0�t
Fj&�ku�a�F��L)�]o�8]<F���8��
�`�/7E��K^��u�����9$�<��MNr�� 4�!1 ����MK@�N�R���n�x}��;^�
x��G�J��1ߕO�g��l2]M�h0��M��"��,
�_~-e'k��P�N��-�_���Wl�x����B���-t�b
���,_�� �B�e|_Bvگ,�`��C#dΔ�6�E�!d�AY� Ba�E�!d��Y�(�4M�E��"
�0�hݞ�D�|�%iYW��(�F�ntz*�P]9��}�):s�u�ə�Ef�e�;��<N藅��E0ԗ*����L�|��k�﷙���w�����p����@�9�>2�#%�?|b\�
ι.�������/�l[?��W�~J������]�m���r�':�9�B�<�_���ϋ<�&1e�^M|���\^�>}B�|"���0ֵq�i(�����jSe"X���=Y�Q"�*�'Й���)���ĿZ9��x0T\�����6��a�/��tv
-endstream
-endobj
-11567 0 obj <<
-/Type /Page
-/Contents 11568 0 R
-/Resources 11566 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11579 0 R
-/Annots [ 11565 0 R ]
->> endobj
-11565 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11569 0 obj <<
-/D [11567 0 R /XYZ 89 770.89 null]
->> endobj
-11570 0 obj <<
-/D [11567 0 R /XYZ 90 721.073 null]
->> endobj
-11127 0 obj <<
-/D [11567 0 R /XYZ 133.765 641.182 null]
->> endobj
-11571 0 obj <<
-/D [11567 0 R /XYZ 90 634.542 null]
->> endobj
-11128 0 obj <<
-/D [11567 0 R /XYZ 409.708 573.057 null]
->> endobj
-11572 0 obj <<
-/D [11567 0 R /XYZ 90 566.417 null]
->> endobj
-11129 0 obj <<
-/D [11567 0 R /XYZ 223.867 481.021 null]
->> endobj
-11573 0 obj <<
-/D [11567 0 R /XYZ 90 474.381 null]
->> endobj
-11130 0 obj <<
-/D [11567 0 R /XYZ 502.121 412.895 null]
->> endobj
-11574 0 obj <<
-/D [11567 0 R /XYZ 90 406.255 null]
->> endobj
-11131 0 obj <<
-/D [11567 0 R /XYZ 512.62 332.815 null]
->> endobj
-11575 0 obj <<
-/D [11567 0 R /XYZ 90 326.175 null]
->> endobj
-11132 0 obj <<
-/D [11567 0 R /XYZ 395.87 264.689 null]
->> endobj
-11576 0 obj <<
-/D [11567 0 R /XYZ 90 258.049 null]
->> endobj
-11133 0 obj <<
-/D [11567 0 R /XYZ 202.108 172.654 null]
->> endobj
-11577 0 obj <<
-/D [11567 0 R /XYZ 90 166.014 null]
->> endobj
-11205 0 obj <<
-/D [11567 0 R /XYZ 488.282 104.528 null]
->> endobj
-11578 0 obj <<
-/D [11567 0 R /XYZ 90 97.888 null]
->> endobj
-11566 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11586 0 obj <<
-/Length 2707      
-/Filter /FlateDecode
->>
-stream
-x��[ْ��}���SBVĞޗq)vd�
�Q�I^d�
-CbfP!	
-$���s{�� �EDz�� и8��.� ��H�l7�/�݅����+�d$���mbp��AB¯Y�z�$
���1aR#b$\�������t�ʞ�xv}���)�o@ ����������pcft��
Z$�2�ΓW���2�lĈA��;�$C<������QZ.�],FB��
�C�(2�ԘvQ)��$��r�記�	}��fe�%�
��b�,��M���
}��z�/3��
A*��@�0��D�}\��z������ �q)�@O�6�_�p1ۉl ���_cC!j��f�������
�\W�ߏ5
=�1:a�#&h2@F?��lU��
e�l�I7Y�- �43�-`)գ��&�
{qC����6��7}

s�M"�H��i��H!q����*3;ϱG��h�(�
�e dUl.����*	��
���_��6���0�6��ߙ��r�٘�Q{��ش(���X���]����x?�"^��cF��Yp7$,�QuD�ȵ��u�eBm0A� ��X	Q;�Vv"ױ�}[�o`�w��
)�C��t��
�m�'1H���b@��X%�%]����Ew�pD�6�,�m�����$�H$�@�YofWW�ly����嘋Q����e�P4fC�^@�Ю��qD m�;(�m�m���}Y�t�`���Q~k�,$

X��i���E�
�g�۾�%9�<�g]�|O�lV����
����[��e����}�m��,ҏo'��L��6
����y[�b;ı�D01�|߷�f�������a��'���<��'@X������P��� t-�r_ B�k�s�a�0����P1�=��@uu�m�M�!nz���P��
U��r�CC�L�D�}�
F�zĴ���]&�)J Y�A��J����j�O�͛��@
-Uq�0�gڙ���PhX�w&��\#e,�UH�����v��]�Hx�J`�
X{k
��t0���#��
-ܸm�� J`=�9�j�Cʝ��@�3�J9�?p
ح��H�
�!6+��Z�82�7�+}�"���
����F	�2�|��U�'�)�4 8�O<7,�@��O@:��f�-���~k��^SN���Q�(H�֘?�Aǎ��n�YP�G��&�K1����ƻ�ˢi���'�C(4�X.CF�2���M�۪�AD�'�BC�7ft���l
�<�B��i�Mϭ`�i�
Q�Ljn�L,�?������P��0�k6&ks��}Fߌ)
U��Iuڔ*8�)U;K61�1�4h���PyR��A2�����x��S2T���3T&�AG2T
�P	\�5fO�B�
�
�=��Wx�C�*H�
F#)�u��ҥ�B0�ۦ�|����
�v:dRA�	g]wv#�V�@dc>Fa�
-ލ�Y����D �]�ﶙo�Z’���oWq�M�fU��M�9���'�{Y,'���"xGn�lL7�:���=��"���t�������#�"�ݧ]�Na�� �;����`�Ǹ�ꊫ�Q�Nc�T�
z���@|lP֔ 立 u!8G]
!���9�b 
��؃��
S�
sP]تx���
)٧.t=b������
���ƻ��#�nKB{�d!�)�|�ǵ/Y�oG�H�_���\��S4��3�J��__��V��h�>��ߘj_�j᧨���P���Z�8�r���L�l����p��lޚRJ�����|��
6?���#
��0Tl~��e����wM'|�-�2�}T�K'@�����]��OxU��d�Wu���hY��n��e>���'i�v��˙�=%��5�-�U�m�o�.gȼXoˬ=��>�T���?��2�#�bS�z�RUi�,�b�g3�
-�C�=���pG��S�~h��31��
7yj��gH13���A�"�E�e�'0�w+���� �)��#���X�>:�xQ�]��H��<��ʄ�?�%kLqh��]ٍ�Um�������ޛ���{/c�D�QZ�r��4
-���;u�'�8=e�eW��
RP�V��͡�y�
֚�V�h���ZVuݟwV��F٨s
-቏j���8��1��p�L?�ø!
�SK5B�����p�of}�`�B���<�F��f@(;�U�gLF�uu2k����g	�M5�ǘ<4-&
��>������z�i�
ϱ�����bQ�*\l�A�e������
��9DEhw�s��Y����~/�[f����O��M0��^1 ���p��JFj���o ��R�G!L��ޱ���u?�%r�;�jwG�>p��?l3�J�k��D襪�
d/�A.�J.�cNX#�ߦ~H�4�AI��
���}�޸{���tAD4CJ
"��)!�قh AE�DC@�(�p�  C%��`�1J� �� �;�c�H�c��4\x��
������Ư&��1�%��2K
�Y⋕Y��"
!��P �>�u�
�,�����d�<If�G��(�
e֣��2eVG�T\h�?�(�,v��.��}o
��[a�
W��־;Y]\��`�_
-0֘���Ic���&
1!�KA�

�#��u�˗/��?�Y�G;A��-]n�y�N��p�|�B��f�`�^eY��
׿k������#������o6���˛�
0�;4-�������OW|?0��
�K8�pĹo)a	�
�{
-endstream
-endobj
-11585 0 obj <<
-/Type /Page
-/Contents 11586 0 R
-/Resources 11584 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11579 0 R
-/Annots [ 11580 0 R 11589 0 R 11581 0 R 11582 0 R 11583 0 R ]
->> endobj
-11580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.483 631.996 535.938 644.514]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 618.611 311.845 630.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.404 443.467 232.654 454.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.404 202.511 232.654 213.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11583 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11587 0 obj <<
-/D [11585 0 R /XYZ 89 770.89 null]
->> endobj
-11588 0 obj <<
-/D [11585 0 R /XYZ 90 655.872 null]
->> endobj
-11206 0 obj <<
-/D [11585 0 R /XYZ 90 563.981 null]
->> endobj
-11590 0 obj <<
-/D [11585 0 R /XYZ 90 559.498 null]
->> endobj
-11207 0 obj <<
-/D [11585 0 R /XYZ 368.821 446.62 null]
->> endobj
-11591 0 obj <<
-/D [11585 0 R /XYZ 90 439.98 null]
->> endobj
-11208 0 obj <<
-/D [11585 0 R /XYZ 250.019 346.884 null]
->> endobj
-11592 0 obj <<
-/D [11585 0 R /XYZ 90 340.244 null]
->> endobj
-11209 0 obj <<
-/D [11585 0 R /XYZ 368.821 205.664 null]
->> endobj
-11593 0 obj <<
-/D [11585 0 R /XYZ 90 199.024 null]
->> endobj
-11210 0 obj <<
-/D [11585 0 R /XYZ 118.164 82.069 null]
->> endobj
-11594 0 obj <<
-/D [11585 0 R /XYZ 90 77.486 null]
->> endobj
-11584 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F24 529 0 R /F6 861 0 R /F9 879 0 R /F12 939 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11600 0 obj <<
-/Length 2392      
-/Filter /FlateDecode
->>
-stream
-x��[s۸���)��R����;���d���q�n_܌��h�S�t()�~�
 EP�D�L���d&�h���\~$��-Fؾ����^����|��� #�
�܏

)n���n>��F��'c
]�	��b�]�)���LJd^�w��i��^�Yw?}x,�DG�z���xB�~X�뵻|��'���,�]S�#&�����?�\��  ��#�ң����

����0	f��}�h5���r���?.p0�rv�G8;B!��!���gHy9�}-ZB��3l�)��hSk�WA�D�@���Q�蘐�Yu_�	E�P@�]�@�[��DG�BvH�
-A�C(Pie	�o��
V��88� ׈Ky@�*�ѿ���	&���zc��F)�`���/�t~�2ɒ"��k

�(�DT���Z�M4"�n���c�`�l���%%^�h�A������2���7�a�,p�B�4��Bd`�>��6]�m sm
{���[��f2&"jZ����?��<��#���i��W����Xm�2G�֐�
�r��^�c�f��7n�Ǹ�W�&)��}����
��c*�w�ډK at J4��&O}>�򍻘�i2�+�ʏah���;�p�Z;%�@���›�^�� �l�&�H�2���hm���x�|�u�G�y�.
!�Ȉ#���bo^�g4a�/��`d�r�pGV aHL�ZI
�I�(	C2�D�^3�	d1�F�wXB!���!�|��2�Tѕ}��EU/�v̞2��3%��M���0����y ��f`��IG��C�� X�~̆�#S�a�UE�_Æ�
��A��
u���HHM�V��2>������t�:}(�N�ʁZ�Xப��dv85F�
-���Y�d��
V���%kN[B��������H�vA|�L�����u�~�����b]�j�b0�(Wk���`��/�j�&�F:���wu,�^W҉�э[>��C��'.C2	^62��e�֧IȽ+w���;eOpQ;\���We�xi	�}���=
���G��˲]lg�d�k���b���ˋ�mٰ��;�K�o��[��PU�U��O&�&��¡yGQ��M�8V��U�/�S�m�	���:�j�j�쏷���z��=)}>�>]���@�9x;�O���s���*�= ���
-o�>��T���
�ON�-��7
#�|ksx3��N�G�:�:����T�w�C�	��!3a@���4��� �<���F�!�YP�f_2�/��=,���l���d}�Y�Bf�����,�42'J| %U��R�� ,i��J�͒H�0(8&���i2�pM�����n��pR�c8ihMh?�٢ؖ� ��& ��BI��Y�^)�	Z

�2�i=��?0��G�n�;'`��g?��ϰ��B�c�ox�
-�H?����3�V����1���{*�$�a]�n�h�N�wY��\�:d�+,2Pz�q0�����c�t
�}������J=	-�=��k�&�����(�9k`�=�Ɂ�2M��o�NP�`RsĪ��W�A
C��D:"�{֮�}��ړ�u�&��Pų�y��YI�,�}A�}<X�ڼ���y�����O8<�Q��ͼ?�t�d+�{��MǾu�䶣A�Ю����@Eە��lT
@�G�@�9�8�����sPq 
*
�`���u���F��ި(�)V�
>��xn�@;�� �I *�aU��-���O�I��T� P�L��
�4~
-�� 3��R���=�˪�r������/����#��1�mW�ZW��pD�E�_�{D:*k�M��Dt~K��䀻ts�lJ3b���#X�0(����+��/	��@
۞5���	Xz2�ޘPB/��P������j��M��&����
�
�uf������N���$
-��L
K�if3�q
-R��I�"��ͶȪ}�j_��/G�?�t'�!���)��Muv��7)j2J�-����Ə��z����袟5������.m����B<9�4�eWL�^J"A��!B	��ˈ!D����h�W���Y\���K��il-�"���
�ݗbN85�P���
-�dmWD�W��A$@\	�r �w\i��a�J�"�q�̭9�']2��
$�`D�2�S`!�����
x���WQ߄�~^s�Ɔ�O��t�t�N0�8���]����

h��f��
���"DH#:���c��N�c���6�LXޙ��E���U����xjy7����+���$-����m*�
-l�����_3q�;�����_�����c!"o�_�Vm����= ���.�=�~K��N�F��/�C��+������t�X'���վo4�ާj�L�ʋ���psU>��*P+;
-
d	��`̷`~LT��������_�я9�����@
-�
-endstream
-endobj
-11599 0 obj <<
-/Type /Page
-/Contents 11600 0 R
-/Resources 11598 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11579 0 R
-/Annots [ 11595 0 R 11596 0 R 11597 0 R ]
->> endobj
-11595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.404 614.735 232.654 625.639]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.404 413.656 232.654 424.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11597 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11601 0 obj <<
-/D [11599 0 R /XYZ 89 770.89 null]
->> endobj
-11211 0 obj <<
-/D [11599 0 R /XYZ 368.821 617.888 null]
->> endobj
-11602 0 obj <<
-/D [11599 0 R /XYZ 90 611.248 null]
->> endobj
-11212 0 obj <<
-/D [11599 0 R /XYZ 291.124 520.183 null]
->> endobj
-11603 0 obj <<
-/D [11599 0 R /XYZ 90 513.543 null]
->> endobj
-11213 0 obj <<
-/D [11599 0 R /XYZ 374.799 416.809 null]
->> endobj
-11604 0 obj <<
-/D [11599 0 R /XYZ 90 410.169 null]
->> endobj
-11605 0 obj <<
-/D [11599 0 R /XYZ 90 279.734 null]
->> endobj
-11214 0 obj <<
-/D [11599 0 R /XYZ 90 247.97 null]
->> endobj
-11606 0 obj <<
-/D [11599 0 R /XYZ 90 247.97 null]
->> endobj
-11215 0 obj <<
-/D [11599 0 R /XYZ 405.643 196.467 null]
->> endobj
-11607 0 obj <<
-/D [11599 0 R /XYZ 90 189.827 null]
->> endobj
-11216 0 obj <<
-/D [11599 0 R /XYZ 403.979 140.297 null]
->> endobj
-11608 0 obj <<
-/D [11599 0 R /XYZ 90 133.657 null]
->> endobj
-11217 0 obj <<
-/D [11599 0 R /XYZ 487.336 84.126 null]
->> endobj
-11609 0 obj <<
-/D [11599 0 R /XYZ 90 77.486 null]
->> endobj
-11598 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F10 765 0 R /F6 861 0 R /F9 879 0 R /F12 939 0 R /F7 795 0 R /F1 833 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11613 0 obj <<
-/Length 3193      
-/Filter /FlateDecode
->>
-stream
-x��[[w�~��P_Z�4��~q��Ӧ�9M�t�u�����2m��$�D��}?��HP���&/}�D���`����Fw#�/�\P��?^]�zc����
]ݎ

���w3�a,4��x��HhK��x+���o�_����v������#:b� E�
��?�HG7��-:Ύ>�F��ׇѻ��_�Y@1"�cUό-� r2e���	��eq3�r!�o��l5϶�1c	�*��lj�np�����ۉ���Ä���}~�J �G�8ĺ�w��*[M�v�|y�]���g��/��*��0������b���|�A(C�cC@�j#���
W��o��d*���ź�Xz��
F6j]��O~f��H���~��A�h���R�˿�2f:-�k�k�?O,
�@�V��������"�~�S"�%RlZH�s��4�
��ͦ�FGca�[�Aq�0���xx�<*�L�����F�Y���T���:nڔ�E-(��5�t��cQ�'aq*�����Ѷi�^V����l~�͐��	W
1���~��M��,Q�7�;��(J�i��ܖBI�4o�lcS�5��y���eY��פ�o�V����ְ�V��&[���N���}�H
A�S���u�'c������,���:
-�{���D�
"R
���11��FG�	S�E������u�G��y�l�h�2 ��;vy��|V~�ӄ�1���
"%�ɀ<��J�9��d�j0�bq۱N5�<i
��h�ob_Vi��r���g�-��zC�kWh#&	�K*�՘7
�Q���٭I���͗J�^?HS 3BՄ����񩄫�
-��_並r�Ved�2X$��q������m�p��[���-nr�!��c�p��>�p�f���8A5�-��1��.R����{y���o��){�z��oi�PD9s�rO�~���R�;�
-
E����*g�(w�u���<=�a^v��ej�=%�n��`?,ڰ����Sv�b�at�b;�Kk�Ѵs���ز�j~"��d�A��_�٬�yS����V��
-��[�v�����Ƶ�
{Q����x M|
A8)@
D
 G N���PG��_ D�/	�c���_�P�Fz[�
l���s���Y��c?͂(Q�%YeE�����XO�$,n�Ι�s����WpRf����lW~�ٍ���l"�<r2��x��
-�(N�K�
�b��%��2w�\��T��s�϶�
,"������?�M�`ρݫؼ�~�TxRQ��
gN�e�����^y��7�J���襁c$+`�= �)תq�������zRy•��n�E
�x?�T�6���<_�r�1<^�8�W7V�{_,�87�?'�84�ʼn����m��!��
Ix%��v��� J:{��G؂�u �M��
��
��r�s��ı^ b �w�>^�04
>aN%Qb��]��~�O�
V�B� �b𑬵�5���!
u��D�������A������>�a��\��Pt= fH~��[B��(%���:�~���Au�Sq�
�9pȆ&T�c��Q�������S����3�� ;ҙӧS
�F�tc*46nE;�(�!}N�w���s��s8{�<{�S�/ ����&�
$�P�o��K(�1A�0�$B���'�9D�&�^bp�
-Z���U>_�d҇�o���r����U2�4U�`�L� k��	��n7)�u��5�r'�@3�z���c��O��2a\�=6[��G�	��:!�I)>4dR���Z�Dc
�d��`�r|�g����a4���Z�{��I�`e�)J�V�=X�&��m+�z�S��Z6M{Cx#
Wƍ�<�R�
-/�J�~j�$�Վܯ2�����뺣��?_6O�x�]�>�!bu�b�UW�$�<&%�?��g�a�
���&�ƃF�GKB��񳍼���(�O3�L�! ���O���Q�A@��I�D�ȯ��3V�8� �4�A�eߍC�7L��S�^��
����Q���}pD���5�;ꮦB�S;��O��cR�g���HV`)!>��`粗z�����9я��g=����N���\e��>�<q6Z7��LJ�k�4�7e���Ѣv.{�nd&
�9h�!Rǫ�8c��28�P��N��l�g�<
��-9}���9V[��d�͜b�5
�Pi��\]
��@���7�l���E�����!pu�I�x�.�  <W��D׌?櫹'OOe���@Y=a����N�.C���:C$�u�uِu�Z���9tر�hp]�\^~�g�r�X�n��}���.]B�f
R�ag���)@zB
0� X��h�鰗��b����%����л���G���
�rz��Y�J�N�/T���j�0�Y
.1� 2x2������,0#�mf]�|�yVi�:��$� # �6]G�ag����k�}E
p'�.3�0��Z�Z�%~<ͮKϸߘ͖����P0����bv�{�Q�
�?�D�
W��m
���:*[���]~sT!�'w�6J,��JL�2����M
-$
��i�f��=Y�aT��:�֡V�R���ю�46�}��76/i���/2t�*����/z�+<Q��0��G*oSN����T����[QH���Z
-K}�,V���U�/�XR��O"���F_N|}^J <*�<%�gA/G/v�ן}j��>����FCkә�l�7h�Fjҁ��=��o=��2+��&�eT�3�S�5�N
�ν�۞�c:!}��N'��C���ҧm��Z+�e0)F�Yˡ����<�XS��0XB��!
�AÙ
ș�"�
���vm
G'��k�0����D<���!T�[�kT{�<�7U
R��U
��6�:�6A�c�PxզK>��K�7�=�B+`��NT\V�ۺ���,l6��.��j�Ng�|���鯞�5�E�
-K�I
Vo} �;E�V���tO�#��rH�
���H���2�W��9��Ea�1��ۃ�����^��A��s7��2o�R�)B2�֗W���y�U
�n}��ű߫w^��"U�{�~
-���a�wxؼS�x���i	a��)�M[�
���'(ys|�u�i���۷�U?���W��(
��5[l���R��Wm:��g�^�wy
8�`�������=
<J�~us_����^]?݁Q�����j_vػ�f�6�b�l*%�n���Z���$�)
-endstream
-endobj
-11612 0 obj <<
-/Type /Page
-/Contents 11613 0 R
-/Resources 11611 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11579 0 R
-/Annots [ 11610 0 R ]
->> endobj
-11610 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11614 0 obj <<
-/D [11612 0 R /XYZ 89 770.89 null]
->> endobj
-11615 0 obj <<
-/D [11612 0 R /XYZ 90 658.004 null]
->> endobj
-11218 0 obj <<
-/D [11612 0 R /XYZ 298.885 563.776 null]
->> endobj
-11616 0 obj <<
-/D [11612 0 R /XYZ 90 557.136 null]
->> endobj
-11283 0 obj <<
-/D [11612 0 R /XYZ 457.052 507.606 null]
->> endobj
-11617 0 obj <<
-/D [11612 0 R /XYZ 90 500.966 null]
->> endobj
-11284 0 obj <<
-/D [11612 0 R /XYZ 391.16 439.48 null]
->> endobj
-11618 0 obj <<
-/D [11612 0 R /XYZ 90 432.84 null]
->> endobj
-11285 0 obj <<
-/D [11612 0 R /XYZ 174.283 353.731 null]
->> endobj
-11619 0 obj <<
-/D [11612 0 R /XYZ 90 349.093 null]
->> endobj
-11286 0 obj <<
-/D [11612 0 R /XYZ 158.014 285.605 null]
->> endobj
-11620 0 obj <<
-/D [11612 0 R /XYZ 90 278.965 null]
->> endobj
-11621 0 obj <<
-/D [11612 0 R /XYZ 90 210.391 null]
->> endobj
-11287 0 obj <<
-/D [11612 0 R /XYZ 439.235 133.657 null]
->> endobj
-11622 0 obj <<
-/D [11612 0 R /XYZ 90 126.683 null]
->> endobj
-11288 0 obj <<
-/D [11612 0 R /XYZ 470.21 77.486 null]
->> endobj
-11611 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R /F8 794 0 R /F11 613 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11626 0 obj <<
-/Length 1760      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�Ԓ
���[kǙ�n�I�^�L��!�S�tHʮ�� HJ��,)�$'� ��o��pp����׳���b�AFR����
�.��!�H�hH0��iDp����iDq�M��E
<I��8�;88IR�_�w�GD��(�,��T��p���c�ߧ#�HS�C\>��
�<|�
#���h:x�0�:��
�V���
~'������ˆ
-7t?��@��%!��%��Zӛ��0K.@`�Aoxrz�JH4E�����!9)2ڴ���D4hJMG�ӈQ�sDH�m�*��m�M�]�޳�P��w{$�)b�"�6Haݑ���#�� ��
�䳓�z������P7"N:@�X�+q��H�O�	(�ҡ����\a��d �`�w�Y3��L����iv1�d~��;/M8��8�$�t�ش�w��E�
&�U6�.mj�Y���S?*�fu\���yvq�5+g�dr矮�dj���
�$DE��a6����NJ�B(
��m
����E�*���Q�ԹI�,�/��_

U��V�r�^�`�7,�W���;�~��Q� #j%�E�@zbS?:�kg� $���,�d�<:�b	��
�6Q��&
-�Dl#Q8R��53�h2EG��R�6��SEG��\Q$��LH$�܆L�9�xW��d(�� j�$�†��Ե�i1��aP%�E���ˋz6���6��C7�`b%d븩__gER�\����\Ze��b�L�t�(0���5�q�e��*"�"|Z`�ٕX,S���8�/
-o�_�::��	����x��J_���Q6�MA˸�Z4|W�*@I�a��.VR�#�x���Ҩ���
҄�ٕ]�<.�����F�.����U�� )ٳ��f�O~H.,A�4
,��!B$¸]s�����Mz�2���ݓ��>1�-�{kD�l�=r
I' $��y�֖�<-�`�c5�"��Z����a���_��M8�\6K^�P� S�tc�.
g���"pH
i�ƺt��u_D4������8�;2��$>��>�0�8kU��4�z��js=�f��> b�͓���"�
��~�>oz@JK�ɒQ:2J�Bfd}UG���2h�| �ba6��C��y�a�r�f�ew��C����
Bzȅ|���bi�A�s��� �f.�KN^���	n�I�d׸����f׸��-�o�fi��ԸF����̛��6�T̵���m�BE���s���K�2���88h�g��S�{6e$4]�9to*�yu��I�z?�믓�ҏ
5U��y���
N
"���}����#����Ӟ�e�im�f��8�_2��^��0�=s�V��A���
-��<C at j�Y@�@�o�}@p�Ha ��<C�/�m��
 ����4��(_��R��9��،S
�I��n|��M�
�K}���
-�/X�aGj��
@�Z ���W?B��
>%� j����nzC�Ts�>�\���v��
K��U��{��x{ݭ��xFM��Ǯ�����w�o���&f�����o��[�+����ǯ��zW�q�hz+e�{
���R�ɤ=ܠ�c懽�� ��/	��s�t����$E
-������z`
�����+WH��^g��NOO����?GB�����Y<i�(
� ��c� 켊���Vꝵ�׼�����Ae��(Dp$D۬]�������첰�%e�U�/��܂���4�k��t�ͻ/���;
-쾛��`�O`~L��Պ�q���XO��6e�Q~�����<
-endstream
-endobj
-11625 0 obj <<
-/Type /Page
-/Contents 11626 0 R
-/Resources 11624 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11579 0 R
-/Annots [ 11623 0 R ]
->> endobj
-11623 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11627 0 obj <<
-/D [11625 0 R /XYZ 89 770.89 null]
->> endobj
-11628 0 obj <<
-/D [11625 0 R /XYZ 90 721.073 null]
->> endobj
-11289 0 obj <<
-/D [11625 0 R /XYZ 234.765 659.423 null]
->> endobj
-11629 0 obj <<
-/D [11625 0 R /XYZ 90 652.783 null]
->> endobj
-11630 0 obj <<
-/D [11625 0 R /XYZ 90 592.919 null]
->> endobj
-11380 0 obj <<
-/D [11625 0 R /XYZ 90 569.43 null]
->> endobj
-11631 0 obj <<
-/D [11625 0 R /XYZ 90 569.43 null]
->> endobj
-11381 0 obj <<
-/D [11625 0 R /XYZ 90 515.771 null]
->> endobj
-11632 0 obj <<
-/D [11625 0 R /XYZ 90 511.288 null]
->> endobj
-11382 0 obj <<
-/D [11625 0 R /XYZ 90 471.556 null]
->> endobj
-11633 0 obj <<
-/D [11625 0 R /XYZ 90 467.072 null]
->> endobj
-11383 0 obj <<
-/D [11625 0 R /XYZ 90 427.341 null]
->> endobj
-11634 0 obj <<
-/D [11625 0 R /XYZ 90 422.857 null]
->> endobj
-11384 0 obj <<
-/D [11625 0 R /XYZ 90 383.125 null]
->> endobj
-11635 0 obj <<
-/D [11625 0 R /XYZ 90 378.642 null]
->> endobj
-11385 0 obj <<
-/D [11625 0 R /XYZ 90 326.955 null]
->> endobj
-11636 0 obj <<
-/D [11625 0 R /XYZ 90 322.472 null]
->> endobj
-11386 0 obj <<
-/D [11625 0 R /XYZ 90 270.785 null]
->> endobj
-11637 0 obj <<
-/D [11625 0 R /XYZ 90 266.302 null]
->> endobj
-11387 0 obj <<
-/D [11625 0 R /XYZ 90 226.57 null]
->> endobj
-11638 0 obj <<
-/D [11625 0 R /XYZ 90 222.087 null]
->> endobj
-11388 0 obj <<
-/D [11625 0 R /XYZ 90 182.355 null]
->> endobj
-11639 0 obj <<
-/D [11625 0 R /XYZ 90 177.872 null]
->> endobj
-11389 0 obj <<
-/D [11625 0 R /XYZ 90 126.185 null]
->> endobj
-11640 0 obj <<
-/D [11625 0 R /XYZ 90 121.701 null]
->> endobj
-11390 0 obj <<
-/D [11625 0 R /XYZ 90 81.969 null]
->> endobj
-11641 0 obj <<
-/D [11625 0 R /XYZ 90 77.486 null]
->> endobj
-11624 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11646 0 obj <<
-/Length 1711      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�6~ׯ�S*M*���L^�:��i�&j_��G�`[S�r(���]އIQ�4i��)b{|�vR¥w����ˀF�x�i:8{����*���g���%R�
�����>�@¬�Q���<��?���~�O�
�
KH��7_
^���?E�`��)~i�	x��^
�
�������#�%�%
-���#ݵ�
C���$�-}7
.�?�#f�n�Y��dTE���R��Zߺ`�q�
�Gc���
��I�$\d��
Y>��ٻ��˘.�
����G�l�
�'s/���&lP���
g惦Ib�U.�5Ȱ��|z�,�l#�������B�x�J�xgOTY�Fs�M��З.��������%77��ɽ���v�m����Kn�_��Ƹ��+��ZwJE�$�H:��YI��
�Ar�Zkj���9��B��TS�p{�6f9
*�1��ԇ���}�����
��O���_�����4����kw��R>_:?�KK�8�Fz
-gl��FN�����t���ắE,J����ln&�
F5�����C�Rq����r��.p���(�27�����沋x��`�
�
`�J����?������?��������5����
-g-�AS�*m[SNђ
��1Ր�
o$����d�]YM��ՆF �TJ�����)��#Q2S߱�p���c�T�A"$���s�1(U�r�c	ps*p�99���a���X�J�Z܁q�"F�x@�/-��ib�-�>&p�M�(�ɨA�#�[cUabQ v�o��C;6�`tE�.�-��[
���qz�ѷ�V�[���+9_�}��1���epA	��R��
|W���c�
Q��Ҳ5WA�K������j'�p�
��`��G�8{Q~�3ʯ��Z(�ԝ�q��O}���/��t�
-<|�ukTa�
�C	�
���X#b�e�N{�p���%.'@Wח
!�dh(;y���4!�5�a��Oi;�wʘ��d~3��Uf�2L-Y7�P��}����@
G�S�����D{��큺���m��{ڀ�΄��]b
<���GccG>J�؁��fX5q�K+O����ݵ�Jj��DA$�~�ȍ�:�m=W��.Mq�� ��2����U�ݼU.*�kR^Y]b4�$1~��$�2�8�$$��*�F��׵&�C�M��Ln�^_� 	9L���0DŖA��>��`Y]7 �c�+Y�)��P�oz
�G\?��a�./�+�������%�˕�cXǿ�/��}8
�,�L�z1wn�%dop��2�PE�
��1�g2Y�>_�[KX:��k-Jl�EnJ�٪ٶ2��Qlǐ���PG�w;��3�^�}��Ώ���1�����w��) �� �Z`'űhP;m�c神9���L��:�$
�W݃�������i~l9��Wʡ�2Hb�l�s�k�P�fE [...]
z���&]F�ǾQ�ݤS\$���EսВn���}3V��î�����G�Q��l�+��?fc�g����y��
-qc�7.f

�<J��düD��w�.
�ϒ��6.�a$�0u��3���&����1��
�F2�@�e��+�RW%��'��oI/V�O��C
��0������p�����׫��[
���\��47W� 5h����,���i���
-endstream
-endobj
-11645 0 obj <<
-/Type /Page
-/Contents 11646 0 R
-/Resources 11644 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11579 0 R
-/Annots [ 11642 0 R 11656 0 R 11643 0 R ]
->> endobj
-11642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.483 274.67 535.938 287.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 261.285 311.845 273.235]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11643 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11647 0 obj <<
-/D [11645 0 R /XYZ 89 770.89 null]
->> endobj
-11391 0 obj <<
-/D [11645 0 R /XYZ 90 686.846 null]
->> endobj
-11648 0 obj <<
-/D [11645 0 R /XYZ 90 682.363 null]
->> endobj
-11392 0 obj <<
-/D [11645 0 R /XYZ 90 642.631 null]
->> endobj
-11649 0 obj <<
-/D [11645 0 R /XYZ 90 638.148 null]
->> endobj
-11393 0 obj <<
-/D [11645 0 R /XYZ 90 586.46 null]
->> endobj
-11650 0 obj <<
-/D [11645 0 R /XYZ 90 581.977 null]
->> endobj
-11394 0 obj <<
-/D [11645 0 R /XYZ 90 530.29 null]
->> endobj
-11651 0 obj <<
-/D [11645 0 R /XYZ 90 525.807 null]
->> endobj
-11395 0 obj <<
-/D [11645 0 R /XYZ 90 474.12 null]
->> endobj
-11652 0 obj <<
-/D [11645 0 R /XYZ 90 469.637 null]
->> endobj
-11396 0 obj <<
-/D [11645 0 R /XYZ 90 417.95 null]
->> endobj
-11653 0 obj <<
-/D [11645 0 R /XYZ 90 413.467 null]
->> endobj
-11397 0 obj <<
-/D [11645 0 R /XYZ 90 361.779 null]
->> endobj
-11654 0 obj <<
-/D [11645 0 R /XYZ 90 357.296 null]
->> endobj
-11655 0 obj <<
-/D [11645 0 R /XYZ 90 298.545 null]
->> endobj
-11398 0 obj <<
-/D [11645 0 R /XYZ 90 250.995 null]
->> endobj
-11657 0 obj <<
-/D [11645 0 R /XYZ 90 246.512 null]
->> endobj
-11399 0 obj <<
-/D [11645 0 R /XYZ 90 192.668 null]
->> endobj
-11658 0 obj <<
-/D [11645 0 R /XYZ 90 188.185 null]
->> endobj
-11400 0 obj <<
-/D [11645 0 R /XYZ 90 136.498 null]
->> endobj
-11659 0 obj <<
-/D [11645 0 R /XYZ 90 132.015 null]
->> endobj
-11644 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11664 0 obj <<
-/Length 2216      
-/Filter /FlateDecode
->>
-stream
-x��[Y���~ׯ�S�®z�>��C�q�8X�=ɋ�p$jF���(��ߧ�wSM
#*6�0DQdU�������!��σ��n��X`��T����@q���o��CH0�l8"����0J����!��z��1�&�ݛ�}%���7�U
%w��7ɐ�0�n���pDZD�m~�.����IlES�C&����/�׷�?��F ���r��#�p�� #ft�=�
8e��~�®�Qa/�Ga-Ȭ��a�E�X��~�ě���'rOE��*�<�HPup���
�ז��1��qr��8�
ҒJ��%�����#
-N�e$q0k�C�LD��\�(���f�N��E�zH��$r��<J]Q��ChY���5�mc
��'��G�A��M�n������֌��|f?Y�>����&�����|���_�3��e�қ�ag�?�8��Ȁ%���?���o�M

-���<h) �V����+<^F�w#++�T�dDOk�]e��X`�O��k
�`H
bJ��p�x��
���
�D
-�賴/�y�tJ���
-�y�,=��P��6@={��R
-���[`7&\o�$J�H!�F��{6�
�B!\�,��֚=A�N��BZ�:ǡ�?x$�K��j�u<�
�|2�W�~g�"A8�",&EF�*`���T n��4���v<�@�W
����+��֮�$�
U'Y���tĘB
-��˹蜾�@�2^:�,�6N���I���x��
�$68��7���.Y,#M�Xd��_�W�w(Q�Se�2���|�!��T��:&!ZM�?�?�����k�)���(��뷄�&@��4�@�8D�qg��?�����u����ڀҐu�`��!ë&�*�ف1������S��
���
�n�
��	bZB@b�Z'`	�T���:j(��(޹P=es��E�V9�A
��X�h`v���Ƭ<y� D������ǀ�|e0�j�3�W*"hf(��ܼ��Y'
�Y|�Fv���N�!8�>���L(���!V� �,҇���8�ѐIč��PIN&2_	>P��
ĭ�A�P��&�s;^��U���
-ꂚ�C���Ąޗ%�̢�V�| 
8���
1X�
=Դ���u��5�!0F[���f�xӄC�4;�Q�������J�a(��.͝�L�"M��K��^��:��AM��
2�%R
�[ܠ�)��t&��dji��[xK@I{Q,s1q�a��*�җ��˽�9�{K�%/���( Ϊ�mE����=�/����L���oFE����

�d
�/�r&Z
���
I������
������/���Y�ޮ�n���=g��j>�
M�Hzq�Nˠy
W���4X/�
p�(��g��~I���
���7�NU��׫)G��)�4��O1`Ilv<ul�� ��w.V�CRIW�Q(�Ͳ¬Y4�
^��U٭$
-���,�
kş�f(�%�U^����W k�u�� ���r��K�7Nwψ#Ϋ���-��f1�
���<	��Fk_0�3&*��8�j�+��7��������a�-;VR�;�������Fy!p�B�QǁSBC�C1 �d�U|"pJ��S���gzp�EN#���S�^"e�SqW{��iY^���{�$��'xW(r
���g�Y�^���nK���)ςO�"�O���n-xqخ
h��1�0K�pe at C�(I�)+��
ҸzO]�ص.
h���J54��€%�:ka���€�����W{���be��
ڿ2�p�n�Ӏ�m�����T���B�ftW��?����8�L5P(���ةW,�^�G��� ?�%���G&:��ltT�Q(,�b1
-��ӊ��N���K7�"Ϫ
-qJ��L!�
�퐐�)�
ܾ1
-Qɮ�}�܁�
Zt%^��b� ��=m��p��N�o�sz���H��a��<}�I�d��e�e�$��ud[�G)�,���FŽ�����מ�\1}��w�g�%E��S�0�<
�EJ^���
-	�˳�E���M~�m�|g����V�h�_�|�
 N�?q�$�V# ����㸰*�����1�z((��ϫ<��f|ss�{�ƫ4ɧEnu5� ��I<[�d�N
-��+��ll��'����45 }�	p��~LT��_�:��|��q��%
����
-���¶
-endstream
-endobj
-11663 0 obj <<
-/Type /Page
-/Contents 11664 0 R
-/Resources 11662 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11680 0 R
-/Annots [ 11660 0 R 11667 0 R 11661 0 R ]
->> endobj
-11660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.483 694.807 535.938 707.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 681.422 311.845 693.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
->> endobj
-11661 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11665 0 obj <<
-/D [11663 0 R /XYZ 89 770.89 null]
->> endobj
-11666 0 obj <<
-/D [11663 0 R /XYZ 90 718.682 null]
->> endobj
-11401 0 obj <<
-/D [11663 0 R /XYZ 90 643.966 null]
->> endobj
-11668 0 obj <<
-/D [11663 0 R /XYZ 90 639.483 null]
->> endobj
-11526 0 obj <<
-/D [11663 0 R /XYZ 90 585.639 null]
->> endobj
-11669 0 obj <<
-/D [11663 0 R /XYZ 90 581.156 null]
->> endobj
-11527 0 obj <<
-/D [11663 0 R /XYZ 90 529.469 null]
->> endobj
-11670 0 obj <<
-/D [11663 0 R /XYZ 90 524.986 null]
->> endobj
-11528 0 obj <<
-/D [11663 0 R /XYZ 90 473.299 null]
->> endobj
-11671 0 obj <<
-/D [11663 0 R /XYZ 90 468.815 null]
->> endobj
-11529 0 obj <<
-/D [11663 0 R /XYZ 90 429.084 null]
->> endobj
-11672 0 obj <<
-/D [11663 0 R /XYZ 90 424.6 null]
->> endobj
-11530 0 obj <<
-/D [11663 0 R /XYZ 90 372.913 null]
->> endobj
-11673 0 obj <<
-/D [11663 0 R /XYZ 90 368.43 null]
->> endobj
-11531 0 obj <<
-/D [11663 0 R /XYZ 90 316.743 null]
->> endobj
-11674 0 obj <<
-/D [11663 0 R /XYZ 90 312.26 null]
->> endobj
-11532 0 obj <<
-/D [11663 0 R /XYZ 90 260.573 null]
->> endobj
-11675 0 obj <<
-/D [11663 0 R /XYZ 90 256.09 null]
->> endobj
-11533 0 obj <<
-/D [11663 0 R /XYZ 90 204.403 null]
->> endobj
-11676 0 obj <<
-/D [11663 0 R /XYZ 90 199.919 null]
->> endobj
-11534 0 obj <<
-/D [11663 0 R /XYZ 90 148.232 null]
->> endobj
-11677 0 obj <<
-/D [11663 0 R /XYZ 90 143.749 null]
->> endobj
-11678 0 obj <<
-/D [11663 0 R /XYZ 90 99.534 null]
->> endobj
-11679 0 obj <<
-/D [11663 0 R /XYZ 90 77.486 null]
->> endobj
-11662 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11684 0 obj <<
-/Length 1744      
-/Filter /FlateDecode
->>
-stream
-x��Z[��6~ϯ�S�L��V�Յ^��N)�tH�L'
|�L�I 	Пߵ���#�bg��Sl�ڕ��>}����7�L~~����_L.~�y�2��*�2��
2|�:z>Ecf/�"4N�7�*}���O�,�%�M
.&�'��2$��.o'�_��5?~Ďѻ�S��m���M�l��DVz���mT{  2� �A�b�����	�����׫x�����63p�x��^��VN
)��j�.�,w��w�9����$gsciz�^mw����z��o�7 ly�B<��� ����P �h����Z�W/�T���jw7L�@�3��^ �`)���u7@�CAK�)8��m�׻�����U�+T�m�WHx�*�7���N�M���CS����1
� �� �}�<rJ�V�o��.~�2
�a�U�}'tR
/5_�|Hwq=
�Q��%�+C{����W��0�A��`��!�vx���J
�rcͼ�.7��W7up���D�ۂ �����;	��f@�G@�Q�N�� [...]
`@a	�9��;�:�
�a8��0Y�~�cS���p�9ݕ�lg�9O"��\�æ��Ԃ�0��A&�౏3WCc��U��4ǟ�>]1�����"rY��ˎ�_wš���,�J����Đ%�_ui^ZT
��
-�ۿ��
-���C<��Ex��T�(�GV
Ǧ�0���Wq�����u���ס�N�^�
-�� ���\��Kz�� ��t�е�I:i)</�1�ͦ����=�}���/cK�cn�\	��}ug�=��8Y!����6b�r��;d0	L�Ђm͓I ')�
gDB����2�wkV�j�f�{kXԻ��6l����P�:��c��`��� �娪5T��&X-��$��[Rt�y�b��R�#lO��o�h1.�T��P7Qu~)̫G����aԒ���BcI�c�j�oOp���j�����U�tIoK:��K:��FW���%
��Y�ρ�e۞�����4a�P>���mj�$t�q0���6Ü'����[���rX�C���}���,�*�V���b�.�9����Ԉ>�g����{R�x
�y�-ḳG��
�	��|�s��VM�$��Y_4j$
-At
	<
h#�"�n�ߺ@8߮:�s���xZ]��4i��ԝǠ1c�
������l8/g:3}*�N�.ʓ�d ����Ҁ�d���i|�씜���$j;j�QT4���H at 3�q]D
-44
+k�t��{eJ��X�t;�t~�c�cRp�� �ԁ��`�=Q��Q�X�(��2J?@HLI���
-�2�{� �QU�]r���R��P�CC.�av�u�"~�,���i9|�ƒ�
>v��y�Q2Q�jh��h}%
l�k��i����U�����,
:e�
���q$hܺ�,����V�
�.�>0n�P�5!�����N��I=�
=
�
�t��msf�0Z���h�lͫ����h��:��4P0�c0��Q/٥�CЧ��<5	F��Ԫg��gfc+FR��
L(�
��5�������^k*���
uXw�
�6��pa
�1����w��<�®����L�p���J��*��|��yh�p��-F?��Xan����T{�s�3��k���'
��-/zEr�������m��vF4�f��-W�7�u�ȏ	D�M��!�L��͑��Y
�'0��?y����_��*���v��_\���f�ވ��m%G�񾌱+^9ignכ���W��v��~��P%�
�� NT�Z
-endstream
-endobj
-11683 0 obj <<
-/Type /Page
-/Contents 11684 0 R
-/Resources 11682 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11680 0 R
-/Annots [ 11681 0 R ]
->> endobj
-11681 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11685 0 obj <<
-/D [11683 0 R /XYZ 89 770.89 null]
->> endobj
-11535 0 obj <<
-/D [11683 0 R /XYZ 90 692.575 null]
->> endobj
-11686 0 obj <<
-/D [11683 0 R /XYZ 90 692.575 null]
->> endobj
-11687 0 obj <<
-/D [11683 0 R /XYZ 90 659.513 null]
->> endobj
-11536 0 obj <<
-/D [11683 0 R /XYZ 90 624.449 null]
->> endobj
-11688 0 obj <<
-/D [11683 0 R /XYZ 90 624.449 null]
->> endobj
-11689 0 obj <<
-/D [11683 0 R /XYZ 90 602.342 null]
->> endobj
-11690 0 obj <<
-/D [11683 0 R /XYZ 90 568.279 null]
->> endobj
-11691 0 obj <<
-/D [11683 0 R /XYZ 90 534.216 null]
->> endobj
-11692 0 obj <<
-/D [11683 0 R /XYZ 90 500.154 null]
->> endobj
-11537 0 obj <<
-/D [11683 0 R /XYZ 90 466.091 null]
->> endobj
-11693 0 obj <<
-/D [11683 0 R /XYZ 90 466.091 null]
->> endobj
-11694 0 obj <<
-/D [11683 0 R /XYZ 90 433.029 null]
->> endobj
-11538 0 obj <<
-/D [11683 0 R /XYZ 90 397.966 null]
->> endobj
-11695 0 obj <<
-/D [11683 0 R /XYZ 90 397.966 null]
->> endobj
-11696 0 obj <<
-/D [11683 0 R /XYZ 90 375.858 null]
->> endobj
-11697 0 obj <<
-/D [11683 0 R /XYZ 90 353.75 null]
->> endobj
-11539 0 obj <<
-/D [11683 0 R /XYZ 90 319.688 null]
->> endobj
-11698 0 obj <<
-/D [11683 0 R /XYZ 90 319.688 null]
->> endobj
-11540 0 obj <<
-/D [11683 0 R /XYZ 90 286.626 null]
->> endobj
-11699 0 obj <<
-/D [11683 0 R /XYZ 90 286.626 null]
->> endobj
-11700 0 obj <<
-/D [11683 0 R /XYZ 90 252.564 null]
->> endobj
-11701 0 obj <<
-/D [11683 0 R /XYZ 90 217.5 null]
->> endobj
-11702 0 obj <<
-/D [11683 0 R /XYZ 90 183.437 null]
->> endobj
-11541 0 obj <<
-/D [11683 0 R /XYZ 90 149.374 null]
->> endobj
-11703 0 obj <<
-/D [11683 0 R /XYZ 90 149.374 null]
->> endobj
-11704 0 obj <<
-/D [11683 0 R /XYZ 90 116.313 null]
->> endobj
-11542 0 obj <<
-/D [11683 0 R /XYZ 90 81.249 null]
->> endobj
-11705 0 obj <<
-/D [11683 0 R /XYZ 90 81.249 null]
->> endobj
-11682 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11724 0 obj <<
-/Length 2231      
-/Filter /FlateDecode
->>
-stream
-x��Z�n�F}�WX`��v�/B��f�� ��ٗ��AK�L�D*$e��뷚wR��u�a_Ɣ���]u���jaD�7��������������<���һ{�
�7HH�4�>�#�Gc�1�oG�A�
�oG����)������!
����C�Az3��O�������7�t���"�/f��
�[X���#�;&1Hj^���)A���T`�nd�.W� �o>��a:"��)|%$5>��Nz���՟W��
)
#���ty��
�f����Pf��R
Zz�ڭ-�߯~��=���9��&��G3đ`�
q��R��*7��uU�<ˢ$.��Y�
1-������U�yo
-�]��g,�ê�q��*~�;0���E���c&���
7M�,w��Z�5���F8H��a�L3�
i���
-��Up
���Π1�II�1��Q���Y�/|�$�a`m\�vL)"X��χ�4
,0�[,�)�Z���z3Ǥ
M�1ߕsn�QH+s�
5���PSؐ
|/^���F�Q�)O4)�,�@��]��kӤ�f��	٩0LU��� ʳɤAv�<e ���S&��o>
G�ӂ���J˳��@�`lO���)mf9&C(�a^����8_�����%�M�\[��l��DZ��,���V�Zv U �����#�
�`�,N���Hq��b�gs�J"�u��>\�SJo�
��_
�(��-@V��yD��D3@!�~
�
t� ���
"��DWJ B��8�V|**������
'�40X�Q
D�6
\��Z^������o�"uN�fh�Z3P�3���Q'�D��=���|� ��)���H�K+�
�a�!��Y
KHIL��k���o�F\�S���
"+@#+ZS�|���d��d�P��?o�g0_ˊ��7ʊ-�Lcq���m�=@��V)>o�qy
-Q)@��B�y)D($[?��C�
��T�а);���8�]KP zv���]{"}huԩDp�

��A0�2�m�q���>���Oo���Z4�Z���d�dyK��Qe�G
N���
-qۚ���Y
���,<
���
N�V�6.϶�|:d���Ï)����L	�Kg��<�;�I�<d#B��`�S���d��_�qu�������f��
&����ň�÷
�'�,���@�An7V|��W<�OQ՘��=ꗢ�^}���M�pV��&��հ�l�Hl��%���W�x,�Io�
�@`)��WR�3��?��X �V�zz*�g�%�i��zVp4�ue дW�:f{&pv�"
-n�QH#�QH:� PG9�΅�܎���M���Q��|�ϳJlCX��Pތ���onG
���Mz�Uh�@��Wq����Q�;X��]���PJ\��g���
nc
�
oc���F\wnc����5�`�����xE�/��(�\'Z�./Q�T>Eq
��6a�E�{����Fse��
���r(��%����,tRX�2zx�%zM={^���6�ԑ����=�X�f��s ��LK��.´|�Y�S�IY�
�
ްа![أ�s:�p����^�4��]�)9K��
�n�'%/p
B�C��UQ�!|
֋��(Ȇt=�3�|���*_�qE�A=r�Z>%���v��X�d����z�h72��1(G�B�j��s��>�����(�W���§�(�ס3; �%�E\6����*�ϘU��g�&�P6�
��!��P^�
� ������.>߯��,H7O����l�ijF�����(~J��As��d][����@~h.�WU��
������ؚ�p�X�
E��?�“����܍
��Y1<6��F��P�=���
r
ϕW�� �UY��FK8b4Ar�6��ڱ�"��Ak�LX"ֶO��b�����4���dz�������]f�`�7o���X
�O����zk��-ڔ	��Ю�
-h�$�A,K��e�FJ��_d�g�Ml���f�(A�mO�
�B��=���.�3iCz_�.O����bDwvPG�
CoOB.6�'���
D�>� ��@@�Bؐ
��,�����5��9;��
TqE١?�+�Ҳ+�q��у~�����,L�:¯ �K��#�]�-4aڲ A��8��
�h-�o�~��Uq\줾��sib�������z���
M��f�:�0�7�M�i���޲դhO��9Q�Q�5Qz��'
A1Q�#����/V_\�cɼp�o���
ɦ
-endstream
-endobj
-11723 0 obj <<
-/Type /Page
-/Contents 11724 0 R
-/Resources 11722 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11680 0 R
-/Annots [ 11706 0 R 11707 0 R 11708 0 R 11709 0 R 11710 0 R 11711 0 R 11712 0 R 11713 0 R 11714 0 R 11715 0 R 11716 0 R 11717 0 R 11718 0 R 11719 0 R 11721 0 R ]
->> endobj
-11706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 301.463 168.326 311.993]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6ffe3fb5134511834617a887244e645f) >>
->> endobj
-11707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 273.118 168.326 283.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a705817841ed4087af706fb138250677d) >>
->> endobj
-11708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.663 273.118 250.079 283.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 244.774 176.075 255.304]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a091ead8d6024998d0b42d3414af7024a) >>
->> endobj
-11710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 216.429 168.326 226.96]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_aa79bd8215768f99b2f4955d80abe19bd) >>
->> endobj
-11711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 188.085 168.326 198.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac35d5925785d796c12dc79c193263580) >>
->> endobj
-11712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.142 188.085 207.329 198.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 159.367 168.326 170.271]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6377f256c9f9706efe893c170dcf4169) >>
->> endobj
-11714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.663 159.367 272.913 170.271]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-11715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 131.022 179.554 141.926]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 131.022 250.666 141.926]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_abbd8b9f2542dfd695e350d178acdb21a) >>
->> endobj
-11717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.809 103.051 200.604 113.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8a6be57b7127b316a2d1a9155218cdfb) >>
->> endobj
-11718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.42 103.051 239.607 113.582]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.809 74.333 245.137 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1969778eca91e2d869a184cd86a28b7f) >>
->> endobj
-11721 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11725 0 obj <<
-/D [11723 0 R /XYZ 89 770.89 null]
->> endobj
-11726 0 obj <<
-/D [11723 0 R /XYZ 90 693.576 null]
->> endobj
-11727 0 obj <<
-/D [11723 0 R /XYZ 90 658.512 null]
->> endobj
-11728 0 obj <<
-/D [11723 0 R /XYZ 90 624.449 null]
->> endobj
-11563 0 obj <<
-/D [11723 0 R /XYZ 90 602.277 null]
->> endobj
-11729 0 obj <<
-/D [11723 0 R /XYZ 90 602.277 null]
->> endobj
-11564 0 obj <<
-/D [11723 0 R /XYZ 90 568.279 null]
->> endobj
-11730 0 obj <<
-/D [11723 0 R /XYZ 90 568.279 null]
->> endobj
-11731 0 obj <<
-/D [11723 0 R /XYZ 90 534.216 null]
->> endobj
-11732 0 obj <<
-/D [11723 0 R /XYZ 90 501.155 null]
->> endobj
-1238 0 obj <<
-/D [11723 0 R /XYZ 90 426.348 null]
->> endobj
-390 0 obj <<
-/D [11723 0 R /XYZ 90 419.467 null]
->> endobj
-11733 0 obj <<
-/D [11723 0 R /XYZ 90 320.308 null]
->> endobj
-11734 0 obj <<
-/D [11723 0 R /XYZ 90 320.308 null]
->> endobj
-11735 0 obj <<
-/D [11723 0 R /XYZ 90 290.229 null]
->> endobj
-11736 0 obj <<
-/D [11723 0 R /XYZ 90 261.884 null]
->> endobj
-11737 0 obj <<
-/D [11723 0 R /XYZ 90 235.266 null]
->> endobj
-11738 0 obj <<
-/D [11723 0 R /XYZ 90 176.851 null]
->> endobj
-11739 0 obj <<
-/D [11723 0 R /XYZ 90 148.506 null]
->> endobj
-11740 0 obj <<
-/D [11723 0 R /XYZ 90 120.162 null]
->> endobj
-11741 0 obj <<
-/D [11723 0 R /XYZ 90 91.817 null]
->> endobj
-11722 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R /F60 532 0 R /F22 2996 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11788 0 obj <<
-/Length 2256      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�H~���W�v�&
�zNj�����݇̀���M���Î��ou7I�EI
�,��-������j[���q��۳�+�Y
�������
�~ͭ�&��﷿XpE�0J߾������7���Ϸg_�<�1p�V��}�
[s�����\�IwJ,�2�����?�p-��U��1�ل�d#�Cص
B!F�O����(Ǔ�A�F�>dI6%xr���TfU�G�ie
%�ŕp7��m�����"w��H`��T>D��ԓ��ۉ�VT�5Xwt>#���M���]�L)>�8Ɠ�)ѣy�Li<��U�I�R{K�p�<��ܜFu�
s
�I��Z��F(6�8ؐ�>ȩ
څ�k�q�a�0��)q�iɴ,��
Ĉs����N��x�U����)�d��/�?�_��r�(���
b�
���J�p�D�6Ӣ<�Zl %���ٓ�M�.��ym�lÊZ\�Tm�U\�����
�ðZFrތp *<����c�E�k���52�AJ_�
�X�|�Y� 
�Av̺�u5�^ֺ�	�r~��a��*Y~g��'�Z $T�l�6�����P����8F��|P���7�oߚf>e�D.ͥ�8
�Q���j0ý�ՔQ�p�%����e.��3�'���
О���Þ���*�{���2���;��Z�Q
�1h�B�
9���}�C��Gǀ�������j�i�̖2ʬ�N8]�¬u��~X�؈1~ ��3���]�Ň�:΂�(��X?��`-eA&�|j�I�
�!b�q@;�� 
S6�t7����XPK�4R̫P'e�c������X؋{z� 9�Qm�F�y�8�<&,� <ȣ'��3&(��*�0� l��a�Ş��ǫ)��{@�pK~�s�.h˼�{�ռ���PŢ�_
nh�h���bpj<c�;�Z�STh��8#����_�sм|����_���p�t"
-��c�GA[6�k�������=j�8QrI��I��`'i�9~�.Je��WʮY�
Mp��3���)X&%�ȉ[OQ�04f�.�JG����R�}�Δ���+
dS�'O߻����+F�[7<�u�X��i/���Jy�c-�S񲞞�@�tdt��0d�8���T\B0��3�L���
-�x����
��ո�� *�E�'b�Y��4og���T�D&�����ba*��gPY�J�zd��XC�h��_*�f���	�].��)f�����̍�^�\�V6�r�9�@6�K�����5w�%Fܝ%��Rۋ��Q���x���8�s���i�����2��D/��®�Q�v+kMi{3	��5k_-e$5~o���Pĝ��r`vn#�k�ݛv��ޠ�ԅ��
7
�G5p�?*��:�فϮ�������a,7�IHGJ��l���N��8�k�Q�e�+�a����7{'>ϴ���3�x t���_��� m���yK���
����� ��i��ݘ0hI��k7� s��2+��.����
;v����J?9��J���?{�'�����(��|�B^Swr]�M
H����2��'�о��Є�a���F�
]u���㹱0�e
%2-`�#N}��_,�P��蓾�ac'��x�T5��RL�i^

�m��t6>� �`ܭ`�]A���9�'�Ou�i�
3CZ� 5Ng��CV�MT�V��y�H��=ݾkފ,�EіE�.%���� ���d_���K7��("�
MI*���s���c�[E�s_���s��o7�[{ܐ��j3��0K{�Xs;Q�u�=Wx:B1�G)榬*�ޞ��l�V��
���j�
�
d`k��Nj��|3��c��/�,�{H�)`T)~�
#~�
������� �`�$Pua*u��Cn��ֱ��„9P�;π��O �X�jg?&�Ӄ��	�5T&~���Eߜ���:�z��M�Q�nꕫC�}z��R����j
/���=�9�o�@

�C�����c����m�H���	�z���ّ�Rq\$��%��dO��<V�v7��
�C��֎[�WM ��
b
��m� �~g� ��&82h@ Ĝ�D�Т
�b�l�;
-�<6?0T�);���@�A��_&~��G��:m��S߸x�0��L��n�����E��%Ȇ=�}�qHS�]_�3�2��zOUWmj����u�S
-�_k���=�\_Z�U�v�<\�G�I
�r���⮺/dz��,�ŝW�P�9mXYdu��dy��Ɯق�h�x�u�9
-endstream
-endobj
-11787 0 obj <<
-/Type /Page
-/Contents 11788 0 R
-/Resources 11786 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11680 0 R
-/Annots [ 11720 0 R 11743 0 R 11744 0 R 11745 0 R 11746 0 R 11747 0 R 11748 0 R 11749 0 R 11750 0 R 11751 0 R 11752 0 R 11753 0 R 11754 0 R 11755 0 R 11756 0 R 11757 0 R 11758 0 R 11759 0 R 11760 0 R 11761 0 R 11762 0 R 11763 0 R 11764 0 R 11765 0 R 11766 0 R 11767 0 R 11768 0 R 11769 0 R 11770 0 R 11771 0 R 11772 0 R 11773 0 R 11774 0 R 11775 0 R 11776 0 R 11777 0 R 11785 0 R ]
->> endobj
-11720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 694.557 161.711 705.461]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a9a97dfad75b130ba9af2bf837221f571) >>
->> endobj
-11743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 665.765 191.718 676.669]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-11744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 665.765 288.852 676.669]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a868c5d2bfed1531f600d5550a15c9282) >>
->> endobj
-11745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 636.972 191.718 647.876]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-11746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 636.972 303.079 647.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a11faeb0d0bdf510639755bdfa3da44fc) >>
->> endobj
-11747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 608.18 181.845 619.083]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a768af1a1ab63ec4ae39ec442ec69ffb2) >>
->> endobj
-11748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 579.387 181.845 590.291]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac6b95d89c30f7eae0d0a6b8b017f3bb6) >>
->> endobj
-11749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 550.595 154.727 561.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0aae60933043b8a5733655f003b49855) >>
->> endobj
-11750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 522.176 176.505 532.706]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4dbb70694594789f52b71511d56b9e30) >>
->> endobj
-11751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 506.733 450.955 516.638]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac6b95d89c30f7eae0d0a6b8b017f3bb6) >>
->> endobj
-11752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 482.424 150.493 492.955]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ab010a109cfc8c298bec09df604e9c6ca) >>
->> endobj
-11753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 453.258 169.013 464.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac298af7d04123bec59f2a70423c0e4c1) >>
->> endobj
-11754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 453.258 227.245 464.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 424.839 174.852 435.37]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ace7d8219031e05879897cd3443d35ed8) >>
->> endobj
-11756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 395.673 189.725 406.577]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_affe69279c3c6de02262f18195a95e271) >>
->> endobj
-11757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [193.541 395.673 288.384 406.577]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
->> endobj
-11758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.812 395.673 415.228 406.577]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 343.966 177.91 354.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a464efe235d459d13d155c27608940e02) >>
->> endobj
-11760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.247 343.966 249.849 354.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-11761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 272.055 203.075 282.959]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 272.055 296.324 282.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-11763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 256.985 326.375 266.891]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.343 160.909 217.659 171.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a532a142d9884da79dd7c66643aad74ed) >>
->> endobj
-11765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.89 160.909 332.533 171.813]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.056 160.909 390.471 171.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.24 149.327 178.428 159.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.37 123.599 212.477 134.503]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a7fea886a5a8d881aaea0392ad771b0de) >>
->> endobj
-11769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.763 123.599 327.406 134.503]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.963 123.599 385.379 134.503]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.259 111.644 173.446 122.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.522 111.644 268.938 122.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.617 86.288 218.07 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ad326f3bec17300467f639ba345f2dd22) >>
->> endobj
-11774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.85 86.288 331.494 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.244 86.288 388.66 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.992 74.333 247.635 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-11777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.624 74.333 305.039 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11785 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11789 0 obj <<
-/D [11787 0 R /XYZ 89 770.89 null]
->> endobj
-11790 0 obj <<
-/D [11787 0 R /XYZ 90 712.265 null]
->> endobj
-11791 0 obj <<
-/D [11787 0 R /XYZ 90 683.473 null]
->> endobj
-11792 0 obj <<
-/D [11787 0 R /XYZ 90 654.68 null]
->> endobj
-11793 0 obj <<
-/D [11787 0 R /XYZ 90 625.888 null]
->> endobj
-11794 0 obj <<
-/D [11787 0 R /XYZ 90 597.095 null]
->> endobj
-11795 0 obj <<
-/D [11787 0 R /XYZ 90 568.303 null]
->> endobj
-11796 0 obj <<
-/D [11787 0 R /XYZ 90 539.51 null]
->> endobj
-11797 0 obj <<
-/D [11787 0 R /XYZ 90 499.759 null]
->> endobj
-11798 0 obj <<
-/D [11787 0 R /XYZ 90 470.966 null]
->> endobj
-11799 0 obj <<
-/D [11787 0 R /XYZ 90 291.412 null]
->> endobj
-11800 0 obj <<
-/D [11787 0 R /XYZ 90 291.412 null]
->> endobj
-11801 0 obj <<
-/D [11787 0 R /XYZ 90 219.585 null]
->> endobj
-11786 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F67 3037 0 R /F39 2320 0 R /F11 613 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11865 0 obj <<
-/Length 1332      
-/Filter /FlateDecode
->>
-stream
-x��\�S�F
�_�'j�]��z?����n�Jg(�}�ƀ�&�p���?c��Ǒ8	xx�8Z���OҮ���"֧�o���G�Z�d��t-C,�
�]Y�6% �Ӧ��ȡ��w~�0b�7�U��.B/|888���t������������{F0���1����8#sMF񡂉�yF��|}o4r�L��f��۾7��7�~�
�m?��WB2c��DL[tZ�Z��&���u9h�~%���bp���c���Y�Z�:i��"��I�֒�Ĕ�]m)J��=cLēg��1
-�"4���\�q�Jl�xJ�p�ٹ�I��*��p�� 5ʇ
-�
m��#���i+.���!�I�)��T�Ȓ�uj��O-�4�pt��mI��3"ȳ����h�rӕ�F�$�I�~�g{
u�,�8�}?[�%�W��󄟇����?��iI��l�EO4R�x�uA�+/�*��?��nG��@ΐH�~OHJ
H�2������
E���Cn��SE�ET��q]���
+<ll.�~�A�V�~��.s
���7
���`4^�(#�U
��������گV#сdͪ��#��9H
��r��� M���X��[�2��AK��.���uBhF�
0���.�bB at MC�� C�Z�4��&��l�y��ס�b���.�~��#���S)0X��x� o\� ���bx����.�g�5�n*�-� ��:��%
-��^W�~9�'+Du�/�uT������¸O7�gatO*׃�`��p��&
o6
�K9��4Us��W���%"J-z�D9P#��+���c�`���u6��� 񃠊��U�28a+�.�A��
�hm���'�*�L��ż7�%��1Ss�DrђX�&����5�-m�Oϯ�7TH,����涉���JD`�sh6�M	����Fя��/?Ț���
-q�l
^��hE�w{Ϲ� Cņ�E����M.�t.^E�h��l�T�ojo
3G'���t&w�3B�YK�k�ؔ����
H���Ԭ@)���,�s@ϖ�1	��Ueg
R�f��ֱ���S�d;���.D�5����
-�ޔ�}v*����� ����&�

�����_��||��_��x�U"�7��3�{i�
+C������w�o�K
-���
��Fx��
-��
-�Ǔu2�

&����'G;U�//���N��I�~8�
��%98m�����q�����?� �Z
B䖹�o��/�G~p
���� ]�� Qy�D/I�
�T�^��7F9!�k��Q�)�e�@c~k T������������}��^�����
-endstream
-endobj
-11864 0 obj <<
-/Type /Page
-/Contents 11865 0 R
-/Resources 11863 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11680 0 R
-/Annots [ 11778 0 R 11779 0 R 11780 0 R 11781 0 R 11782 0 R 11783 0 R 11784 0 R 11807 0 R 11808 0 R 11809 0 R 11810 0 R 11811 0 R 11812 0 R 11813 0 R 11814 0 R 11815 0 R 11816 0 R 11817 0 R 11818 0 R 11819 0 R 11820 0 R 11821 0 R 11822 0 R 11823 0 R 11824 0 R 11825 0 R 11826 0 R 11827 0 R 11828 0 R 11829 0 R 11830 0 R 11831 0 R 11832 0 R 11833 0 R 11834 0 R 11835 0 R 11836 0 R 11837 0 R 11838 0 R 11839 0 R 11840 0 R 11841 0 R 11842 0 R 11843 0 R 11844 0 R 11845 0 R 11846 0 R 11847 0 R 11 [...]
->> endobj
-11778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 696.002 156.281 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_afa15deb19dfecdd98737b7375b1ce79e) >>
->> endobj
-11779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 696.002 214.512 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.848 696.002 314.263 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 655.691 168.326 666.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 655.691 236.754 666.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_adcca8dd406de66be709434ebb479c9eb) >>
->> endobj
-11783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 655.691 318.507 666.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.682 655.691 445.097 666.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 615.38 168.326 626.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 615.38 236.754 626.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6c1cece5e5e0195baa563da3574b2e42) >>
->> endobj
-11809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.57 615.38 275.758 626.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.092 615.38 363.508 626.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 575.07 168.326 585.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 575.07 236.754 585.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_aecaf3176848b7bc62927a36ab60067ed) >>
->> endobj
-11813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 575.07 318.507 585.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.179 575.07 397.366 585.974]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 534.759 168.326 545.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 534.759 236.754 545.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4d12b35e0dd97b7319d536f692f50150) >>
->> endobj
-11817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.462 534.759 368.878 545.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 494.448 168.326 505.352]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 494.448 236.754 505.352]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6c53f6f9c17b44e920dbcca5b02b6267) >>
->> endobj
-11820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 494.448 318.507 505.352]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 454.137 168.326 465.041]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 454.137 236.754 465.041]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a61ff1698fe2e74953ee823d59d2ddb31) >>
->> endobj
-11823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 454.137 318.507 465.041]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 413.827 168.326 424.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 413.827 234.254 424.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_aff8503daaa036375be162237f0d7c87b) >>
->> endobj
-11826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 413.827 316.007 424.731]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 373.516 168.326 384.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 373.516 234.254 384.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a50e316ac5412563b194a422ed639db97) >>
->> endobj
-11829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 373.516 316.007 384.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [388.181 373.516 442.597 384.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 333.205 168.326 344.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 333.205 234.254 344.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_aa40049de444ed76982f6b4bd21aa5cfd) >>
->> endobj
-11833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.07 333.205 273.257 344.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.592 333.205 361.007 344.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 292.895 168.326 303.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 292.895 234.254 303.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac9b28fec0aa459e25cf267c3ed31a0e5) >>
->> endobj
-11837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 292.895 316.007 303.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.678 292.895 394.866 303.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 252.584 168.326 263.488]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 252.584 234.254 263.488]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8e65c033489da565762e3bde7d374d73) >>
->> endobj
-11841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.962 252.584 366.377 263.488]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 212.273 168.326 223.177]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 212.273 234.254 223.177]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_adb40b5b841a737ad5e7b8924335eef3a) >>
->> endobj
-11844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 212.273 316.007 223.177]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 171.962 168.326 182.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 171.962 236.117 182.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac6910bddc1f60dd99cd77eeaca296341) >>
->> endobj
-11847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.825 171.962 368.24 182.866]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 131.652 168.326 142.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 131.652 236.117 142.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a97c956c3432528492b019a33b6d4394e) >>
->> endobj
-11850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.454 131.652 317.87 142.556]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.341 168.326 102.245]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 91.341 252.615 102.245]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1dd1c5b1e1b88d96d7aa8eae595625a9) >>
->> endobj
-11853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.43 91.341 310.846 102.245]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.02 91.341 437.436 102.245]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11862 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11866 0 obj <<
-/D [11864 0 R /XYZ 89 770.89 null]
->> endobj
-11863 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-11951 0 obj <<
-/Length 1419      
-/Filter /FlateDecode
->>
-stream
-x��[s�F����K
-�r��œ�i�I�&iL�bg:�-
� a!���wuE`���j����蜣��iW�Y7�޴~�z��Z� ��,�,�4pa�����T�Η�;�
-X
�*��������p_�u�u��f�pl��T�ոu�Y�f�;
�ʺ�[�P�9��Z�P�
��$P�'�0�,�1`
;pA�N�6��H�ᰍ&t�m�'#;p��S�s�	�����
�p%3Kǵ�N�K8j�*0���9�1̌�������59�5�q��Cױ��O;��=��Iļ='�t)�|��,!��
64`*�^k�يȬ�(5������\�;�{�8Z�~��1&���6��O�c���1n��о
9E�ߙ��Žyx��j!X�
bNM3�`��v���Nc	_-�����I��8QΜ�%O�ć,�P� 8=�y�
 ��Gܕ�����%{:
ޤN��y��
z�u^r��t?<�@���V��0_�N�l�Ѱ��숢���i�*!�x��7* }tXp��`�NX����
�eѳ��yY�l�@����"-���
�l�1J0�/��D`
-e�Y�@HV�Rjd,+��
��f8#�ƹ!ē��gǎ�
-�HH�:Xo��!�I�	Bv���u3Hj�qD���0)|t\p.4\�";���vF��^ D
NfJEe"�/WUG�h�L�*	�ZE��E[*{PL����"I܀��`�����eg���
���+��@RV�����e�& ���fU�re���� f�\"]e�}�σN
-��j���9
�h!

-
-��|J��� E��� )ߴ�=w��fpD�h�m‡+��Й�?~��vRX���
�P��!�V
b*�P Uq5
�
���6T �)~r�d�pm
ê=p�n�
"������ě�c����6���@����ź�b����4�L�R��(	Y�@`�ʕ�~N
��,�̒�r��0���3
%x#��]���r��f+�*�
��v�B�Q}�k.�l
�4=�n��n�ݣ��WH4b��أ������P�u�^� ?%��'��r�uo����>�����Gt�W6P
-X��I�U�msM$�?��-g�"�1c��S����D��7Qa/�"
���ߵ\��6�·��P�jX`҂�c^S7󚻙״��K���,����Bhy����nz���mO��6�`>�[�|w�3����,��D��f���Jr
�����ܶL��hTa�rߣ�i�dC��Z�z��ܜ�Zݹ��%(�u��=]�'���K
-?}z�s��?v8o'��~�ݙ=�d"�
���O��oĀ�A�K�zϜt�
��O��o�b��
?γa�� ���z��������7~L�yc�ɬ^�r��I at C7\i�OX�x��RI1
-endstream
-endobj
-11950 0 obj <<
-/Type /Page
-/Contents 11951 0 R
-/Resources 11949 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 11680 0 R
-/Annots [ 11855 0 R 11856 0 R 11857 0 R 11858 0 R 11859 0 R 11860 0 R 11861 0 R 11883 0 R 11884 0 R 11885 0 R 11886 0 R 11887 0 R 11888 0 R 11889 0 R 11890 0 R 11891 0 R 11892 0 R 11893 0 R 11894 0 R 11895 0 R 11896 0 R 11897 0 R 11898 0 R 11899 0 R 11900 0 R 11901 0 R 11902 0 R 11903 0 R 11904 0 R 11905 0 R 11906 0 R 11907 0 R 11908 0 R 11909 0 R 11910 0 R 11911 0 R 11912 0 R 11913 0 R 11914 0 R 11915 0 R 11916 0 R 11917 0 R 11918 0 R 11919 0 R 11920 0 R 11921 0 R 11922 0 R 11923 0 R 11 [...]
->> endobj
-11855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 696.002 168.326 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 696.002 252.615 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8121efae2cfdf708bc80df0a29ecace0) >>
->> endobj
-11857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.43 696.002 310.846 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.517 696.002 389.705 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 656.22 168.326 667.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 656.22 252.615 667.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a249b83627bd1fc3a6e8cff5566de8e1a) >>
->> endobj
-11861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.43 656.22 310.846 667.124]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 616.438 168.326 627.342]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 616.438 250.114 627.342]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a25f7695aa23ee1eebaab53c180512003) >>
->> endobj
-11885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.93 616.438 308.345 627.342]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.52 616.438 434.935 627.342]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 576.656 168.326 587.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 576.656 250.114 587.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1a88e1933993c8562b586eb50efb635b) >>
->> endobj
-11889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.93 576.656 308.345 587.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.017 576.656 387.205 587.56]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 536.875 168.326 547.778]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 536.875 250.114 547.778]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8452faaee93aca528132796ec28951ef) >>
->> endobj
-11893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.93 536.875 308.345 547.778]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 497.093 168.326 507.997]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 497.093 251.977 507.997]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0b17cb50f319bb1942e2d93bb03b39f9) >>
->> endobj
-11896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.793 497.093 310.208 507.997]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 457.311 168.326 468.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 457.311 249.765 468.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a928bfef936763acd21344f469b74e83a) >>
->> endobj
-11899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.581 457.311 307.997 468.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 417.529 180.54 428.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a55cc14142958a8c9fbab183d63a18d87) >>
->> endobj
-11901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 417.529 262.293 428.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.149 417.529 385.565 428.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 377.747 178.239 388.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6cd1d9123d91ad11263872e5745a3212) >>
->> endobj
-11904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 377.747 259.991 388.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.848 377.747 383.264 388.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 337.965 226.034 348.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0801eaf17912403e4e1028f8a369d340) >>
->> endobj
-11907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 337.965 375.591 348.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 298.183 168.326 309.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 298.183 236.754 309.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a61ff1698fe2e74953ee823d59d2ddb31) >>
->> endobj
-11910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 298.183 318.507 309.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 273.311 168.326 284.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 273.311 236.754 284.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6c53f6f9c17b44e920dbcca5b02b6267) >>
->> endobj
-11913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 273.311 318.507 284.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 248.439 168.326 259.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 248.439 236.754 259.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0fb5c6814551962ec105ad073103cdbf) >>
->> endobj
-11916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 248.439 318.507 259.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.7 248.439 420.888 259.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 223.567 168.326 234.471]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 223.567 234.254 234.471]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_adb40b5b841a737ad5e7b8924335eef3a) >>
->> endobj
-11920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 223.567 316.007 234.471]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 198.694 168.326 209.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 198.694 234.254 209.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ab5a66f5a68773b7bc33d39bdad1a9fb9) >>
->> endobj
-11923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 198.694 296.779 209.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.113 198.694 365.301 209.598]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 173.822 168.326 184.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 173.822 236.117 184.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a97c956c3432528492b019a33b6d4394e) >>
->> endobj
-11927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.454 173.822 317.87 184.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 148.95 168.326 159.854]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 148.95 252.615 159.854]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a249b83627bd1fc3a6e8cff5566de8e1a) >>
->> endobj
-11930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.43 148.95 310.846 159.854]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 124.078 168.326 134.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 124.078 250.114 134.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8452faaee93aca528132796ec28951ef) >>
->> endobj
-11933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.93 124.078 308.345 134.982]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 99.205 178.239 110.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a6cd1d9123d91ad11263872e5745a3212) >>
->> endobj
-11935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 99.205 259.991 110.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.848 99.205 383.264 110.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 74.333 156.281 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_afa15deb19dfecdd98737b7375b1ce79e) >>
->> endobj
-11938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 74.333 214.512 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.848 74.333 314.263 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11948 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-11952 0 obj <<
-/D [11950 0 R /XYZ 89 770.89 null]
->> endobj
-11949 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F24 529 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12022 0 obj <<
-/Length 2126      
-/Filter /FlateDecode
->>
-stream
-x��\[o�F~ׯ�S�DW�_��@�m��fo�],�%Q6��Rr.�~�\H�-[�%;�����s��ef<��U���
��T,2�H*��idp��AB��$z
�$O�c
_$�i5O�^$����u6�ҷ��Q�V��_�E�Vo_&T�e5O~����%!-��PD9��
�g��#�H��)��ab�Լ&��n�t�L�T��214��Y������iV%D�Y1�GBR3E,��������x��t4�^���	<�)ˆ
�wD�S��,�e�6�m[K�S"�t�A���
��
^���Q�(L�;q�h��Uq& ��tT!����;�$Z5�>.�"��|�Ð�M��X}�-S]��æ�C��
AC#��A	iP�Ҷ�iA�7����0���]��"��UY}�5z�l�
<.���΁l�	�꡵���)������b$ H
Y
->!]_
�T�*HHs
-�/9���B�R��h���y�H�D���ˊ�.#�� ��x�;6��ڿ�ӹ���� Wad�����+S� ����'�~.еS��:#���+e}�%N}=`�.��H�Α:5��`{��ݺ�
y��۾K��	��_>���<�
-s�h�;z�l�Np��~�)�
0�����8�����cnM�"�ɉo0f��[S�O]�� �� ����?�J_��S�q�,7>�-y���~-
-E��փ�`	|"O�S�=��;���!LO��,�f�=4 X
A�'��z�"�!�s��{�;j��H�O ��/��� =?0��#`~{&�Y{U���o
ƑѤ�9l�H��FLwU�7 (bZ����Ǣ���v�|��<n��/x1"��A�T�{���rv?@<~�m(.;�V��4�
I��Z�>���*���v!rO
��q�\M������y��}�|��
Iָ�ٳ]��$_����
I��Y��
-a�x�T:[�~X�L�G�pD�?0��3?��S?�e�4�e�
�p�
W�b��EG��0�hH����!��cH���j�{-j
�2A�>Sټ�7���
�օ�p�H(wg��O ��(jdD�Ԯs@�f��@��OG�$��p��'	�1�y����U="(�v�
B���+�?ɕ
uܜ���1{��?�̦ɺB��������F
`�+�44
-�}co�p;�Z�.�_��0�vq�S+��z����U^���=��ꄒM�=�E�8ϊ���m�@b�4�݋“���e����S����x����)�T٢ʖV�
���o���#�f�t�SX�����kSB�"�Ym��px�E�A'�����cyl9����Tvw�D�b�o�F�&M*x�{0�XC�AS�{��g88�KՈ������>�����������ޢad0��m'~���#
�_gU_�›�*z�i�L3`n��I����$�g����!���;�W ~Y�/��t�ْ�M����>��C
�)�{9�#�D��͹%�Vo+�� �iV�ƵK�I�.� 7�E��
-�� �ҷA��Ki��:-&�FFd����
e��n�ܐc����F0/��yy�Yyc_0��j��!�<�tf�gۙ�>�NR�RMy
CO��Ԧn�\�
dש]B�8�x�������e�VБ�h!����(4�d�(mM��O��89�v<�����m�1}'��M=�
e9ߎЭ6i����خ���
}�f�I����Ȍu6�{i[���[��sd�r��B���ƍp=
�nc�[�����8�0c���Y<���� \f+��Y�}U�m���@7�,:
�!��Ex��d��tJ �*����I�H�L8^���]1��S���ƴ
<G�� yq���<!�R���͚
n��.N(L��j���ݴ*��y�w:�MYd��ձצ�
K`烍ֱC}˒�jZ�h��=4ɩ�@SzW@O�&@^���!��37�=�6�
6@R����� ����ݖ���X�9�0�߽����╿��2����l�ϴ���1;w�@�B-��a;���嗬6���������o-
-�,"DS��W�������
-z�+d��%��0���zd�0�j�I����
���
T)im	0��,0Q����u�_
�~���
������>�
-endstream
-endobj
-12021 0 obj <<
-/Type /Page
-/Contents 12022 0 R
-/Resources 12020 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12026 0 R
-/Annots [ 11940 0 R 11941 0 R 11942 0 R 11943 0 R 11944 0 R 11945 0 R 11946 0 R 11947 0 R 11965 0 R 11966 0 R 11967 0 R 11968 0 R 11969 0 R 11970 0 R 11971 0 R 11972 0 R 11973 0 R 11974 0 R 11975 0 R 11976 0 R 11977 0 R 11978 0 R 11979 0 R 11980 0 R 11981 0 R 11982 0 R 11983 0 R 11984 0 R 11985 0 R 11986 0 R 11987 0 R 11988 0 R 11989 0 R 11990 0 R 11991 0 R 11992 0 R 11993 0 R 11994 0 R 11995 0 R 11996 0 R 11997 0 R 11998 0 R 11999 0 R 12000 0 R 12001 0 R 12002 0 R 12003 0 R 12004 0 R 12 [...]
->> endobj
-11940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 696.002 168.326 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 696.002 236.754 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_adcca8dd406de66be709434ebb479c9eb) >>
->> endobj
-11942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 696.002 318.507 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.682 696.002 445.097 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 671.628 168.326 682.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 671.628 236.754 682.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a31950d4b043d6b2e30a6186c68cb0df0) >>
->> endobj
-11946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.092 671.628 299.279 682.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.614 671.628 387.029 682.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 647.254 168.326 658.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 647.254 236.754 658.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4d12b35e0dd97b7319d536f692f50150) >>
->> endobj
-11967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.462 647.254 368.878 658.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 622.88 168.326 633.784]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 622.88 234.254 633.784]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_aff8503daaa036375be162237f0d7c87b) >>
->> endobj
-11970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 622.88 316.007 633.784]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 598.506 168.326 609.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 598.506 234.254 609.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a50e316ac5412563b194a422ed639db97) >>
->> endobj
-11973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 598.506 316.007 609.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [388.181 598.506 442.597 609.41]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 574.132 168.326 585.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 574.132 234.254 585.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a62e142e1c4c2cb1a57bf9cb8d47efac2) >>
->> endobj
-11977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 574.132 296.779 585.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.113 574.132 384.529 585.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 549.758 168.326 560.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 549.758 234.254 560.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8b1538f5a312dfe26223d4979e615bc3) >>
->> endobj
-11981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.591 549.758 316.007 560.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.2 549.758 418.387 560.662]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 525.384 168.326 536.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 525.384 234.254 536.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a8e65c033489da565762e3bde7d374d73) >>
->> endobj
-11985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.962 525.384 366.377 536.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 501.011 168.326 511.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.948 501.011 236.117 511.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ac6910bddc1f60dd99cd77eeaca296341) >>
->> endobj
-11988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.825 501.011 368.24 511.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 476.637 168.326 487.541]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 476.637 252.615 487.541]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1dd1c5b1e1b88d96d7aa8eae595625a9) >>
->> endobj
-11991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.43 476.637 310.846 487.541]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.02 476.637 437.436 487.541]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 452.263 168.326 463.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 452.263 252.615 463.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_aa6ff88fd77ab673abc05ffdcf583b957) >>
->> endobj
-11995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.43 452.263 310.846 463.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.039 452.263 413.227 463.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-11997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 427.889 168.326 438.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-11998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 427.889 250.114 438.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a25f7695aa23ee1eebaab53c180512003) >>
->> endobj
-11999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.93 427.889 308.345 438.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.52 427.889 434.935 438.793]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 403.515 168.326 414.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 403.515 250.114 414.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1a3e8432869205057fe502d63327562f) >>
->> endobj
-12003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.93 403.515 308.345 414.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.538 403.515 410.726 414.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 379.141 168.326 390.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 379.141 251.977 390.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0b17cb50f319bb1942e2d93bb03b39f9) >>
->> endobj
-12007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.793 379.141 310.208 390.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 354.767 168.326 365.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.189 354.767 249.765 365.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a928bfef936763acd21344f469b74e83a) >>
->> endobj
-12010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.581 354.767 307.997 365.671]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 330.393 180.54 341.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a55cc14142958a8c9fbab183d63a18d87) >>
->> endobj
-12012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 330.393 262.293 341.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.149 330.393 385.565 341.297]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 306.019 226.034 316.923]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0801eaf17912403e4e1028f8a369d340) >>
->> endobj
-12015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 306.019 375.591 316.923]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 207.981 232.235 218.885]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.296 127.71 326.022 138.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.494 74.333 404.682 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12019 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12023 0 obj <<
-/D [12021 0 R /XYZ 89 770.89 null]
->> endobj
-12024 0 obj <<
-/D [12021 0 R /XYZ 90 292.925 null]
->> endobj
-12025 0 obj <<
-/D [12021 0 R /XYZ 90 244.286 null]
->> endobj
-12020 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F24 529 0 R /F90 758 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12038 0 obj <<
-/Length 2119      
-/Filter /FlateDecode
->>
-stream
-x��Y[�۶~�_���j",.I(q
��I�n����ѡ$H�)E*$����
 R�I���}@`0`. ��=꽾�~yw�*�"*䡷�y�zQ��
�k�}�E�g��?z"�	S!�2����v����=�ݽ\��r�`�z�2�$������'�ma�G��b��
��
h3���_�hW��vta4"^�a�
-N�Mv���\0��<)�l?�n�:-r��o���y]��g���Ɍ���z�Y�������)K7Ɉ���K�sZ�S�'+%���B����M����E���&Ro�()�-�)٠%"�G�;��Y�l��&Ks����+ʣ�[�Q^��n����!�tUۏϨ_R��:��
�|?�m�&��)�d�),`��<2�c��?uY؏���pgj����i��>�
'�c�n�a+w��V�����v�F�
Ӫ��T��T�*{ؽlƄ�;����N�I�b`��+pԋ������GG@���H�H I��B儤����4��D���
i�=�C�c=  �"NDܓmp�8�ل&, *Bb¿	`J��.6�!�Uwᜅ���@I�@���cr<ٝ��q�PrL"��)�®~=�>΅����N�@"�=F �5�/',�I�O��4ɝ���ʽKt}}�}4�~�k]ZO�z��y�?���r���0\y*R05���Y"i}(���]ʀ�OvV�ޗ �n �m��#J�����M [...]
O�ac/�< R�n�
�v쬠v
�d�&810�����nƝ�D<�z
	cэ;8
:!{⋤�U#a��0"���D�_��M&�n'��g��d
E�\Qq�FD	g�<R�?JtI�a�4Y��IZ���
-�a�B�ߥ��{t���)HV<�#_��m8�r�ϧӕ�br��z��4?�b�s]����q��	��E7�
-&՚`qݲx����W��.����<^;�l��;�v7��rT}97�O���N�8�:�H3����s;�'3
@%�����Q@��e���D`�c"B�R�Y�[���
��-z%��2�6�5�
X
NB
�5��,7�Nj�~���ZH#{� >C���pH��
-�u:���4
-���[U��A|m�]r�|�.�
�$�p�ηFH`ke��?�¶�� �Ƀn��8ax
�$l��O.T�
P��c4j�
C�_�d�SW��
j���!\�d�/�7�ED��+��&��m7����76��HPVÀ�62����"���
,��ۼ�����
V��Ju
1bH�L��s�j
X<l� G�F�۾�={�&����g ��|
-0�$�Z �;
ч���w3[[
��;DDE�t��2Y�I�%�P�&�!"�?,R$�[6�DNi
��@��.��ńY�EK1�u��T{��G�N𜋈
-����3ŇW���q�|�����YϹ��Y1"Q
E]j�~
-�����e��S�o[
l⹻r|��/�1��``�ধ���\�8��pI���Z4׫�>a�U��o�+ ��t��棎y7�G;]��m����'(���R�
���
Z6��:
�8�N��Qjo7|�R�T!d2�	��a��So�L�����e9
�����W��Ӏ�p��
�+���B \
-����S L�o��P�k#�6ا���a���0֭�0S��3�$�[���8�6Zo�+�}� �\�k�.��qe�]�-Ra1�0��ֈ���F�"� Я���U��s�
��1�+��տ�g7��@���i.�*س���?��Z;���o�
�#��H����Hp��#
�Z�.�l
-��N�{�rQ�P�� �̟�nK���Rٝk�TId�c�ރ�6V��^��
ďi����M  ��$>�R��e��_;DaR޿G�8��
ĴY����
�xU��,��A�m������(�f��7��7p��Qx/
-`va7~�
æ0@
�C̝�� ��Ѹ��v�ݻ7��J��I�}�9��ͳ!
�ۛ�c�I<Y|�~��d��?Z��9���
 �5�Pק��������Mq
�e��tg�Ǣl=�PM�
޿ ����
-endstream
-endobj
-12037 0 obj <<
-/Type /Page
-/Contents 12038 0 R
-/Resources 12036 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12026 0 R
-/Annots [ 12032 0 R 12033 0 R 12034 0 R 12043 0 R 12035 0 R ]
->> endobj
-12032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.615 626.144 233.342 657.456]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.454 557.488 200.764 565.014]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1969778eca91e2d869a184cd86a28b7f) >>
->> endobj
-12034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.483 314.311 535.938 326.829]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-12043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 300.927 275.98 312.877]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-12035 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12039 0 obj <<
-/D [12037 0 R /XYZ 89 770.89 null]
->> endobj
-12040 0 obj <<
-/D [12037 0 R /XYZ 90 434.089 null]
->> endobj
-11742 0 obj <<
-/D [12037 0 R /XYZ 90 410.866 null]
->> endobj
-12041 0 obj <<
-/D [12037 0 R /XYZ 90 410.866 null]
->> endobj
-12042 0 obj <<
-/D [12037 0 R /XYZ 90 338.187 null]
->> endobj
-12044 0 obj <<
-/D [12037 0 R /XYZ 90 275.718 null]
->> endobj
-11802 0 obj <<
-/D [12037 0 R /XYZ 90 248.938 null]
->> endobj
-12045 0 obj <<
-/D [12037 0 R /XYZ 90 248.938 null]
->> endobj
-12036 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F10 765 0 R /F8 794 0 R /F90 758 0 R /F75 554 0 R /F7 795 0 R /F24 529 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12051 0 obj <<
-/Length 3134      
-/Filter /FlateDecode
->>
-stream
-x��[�s۸��B�δ�4B��k��
��5��9�ә$��%�fO"�r���] I��Ê3�/1���b��E��v�'?]|w}��J�I�bI��z5��D�		���7S���9�O_��&�&y�jF�X?ܥ�2y�"�)�����E��I��jFŴ(7�w�??�"�G��(g�xC��f���HY�f| #q7��I����ͩ���YL��f�N�Ԍ�NWi9#�4�0$$��L1M������	1�HE�����;<Y����X
M>6�6N��֓_.�y���ۿ�
-���X�͎�(F�"
��p�:�we^5�
�=����I��'s��}�ٌ!މp������h2��jŘ��Ē��<,�t�O�-�t��ym���U�8'��zX�p�"ݔ��'tS��e�| *�����.w�]P�8nW.껴��U)
-Ѓ��@��T!)��u�h���
�ͮ�-��gX�><l�Saŷ-�*�Y?�_��n����K�:���B��=�(��01��z���dk��c+R
-I
,�[@!��	z'y�ѻ�T�,�m(Av��������i�-C
�Bڃ}�C@�"��aN
�;sF����ؿO-��n./�� �O�N�(PNF'���
uȵPGq�\��C�SҐ�"2k�%�6-85&�RH�j�!
�W���o����n��N*�
E8j-,ɓ�^����i�
o��#�R��mu�#�/���jX�
?
����=�;�X'�=�C0?�:�Gv�4H��Br�h�i�[�B��bѪ1�8ѓ@w�USVymt_yU{�e���C<ᾓ���lwu
-�)b|
Sxj�\��^�j^�
-j�� 
�
���~Y�q ���j�3��R�u�%�]�M�&���"�k��֑>�A�
�fM4��z6\h~
�e�ݖŧlc�l���3�L�0"�ub�,O8(ok�]V��İv�C�A�ʁ0�1
D�S�KMJpӵF5d���o�K�n��x~
I@C=�_�""q

8�T�=��q�^L|���p8\���=|N���^���0���Zǹ_�DR�2f},%�
P�3{�PI��
&i
N?Zn
8�z&���o�}Y܂ҡÛD"r�&�kPT`�O��OM��"����m��Qed�g�rD�uc匩i�jۗ�V�>;ߥ��j�9�&�v��r�"ڶȗ�R���}9�/z��Cd��j�ۧ)���߯7 at RgLO���R
�P�1
|̜7���H2�hqWhS�x�I~�h;
e��S!⧍:/iC�M�f�ĬѪ 
Y���N���80�����ι,iQ�����

B�F���,Z�'���E&B��_�<�c3+��8���7����z
E�E��1
���@x��.Y����3�Nil�}$�ʼn ����=��܎.S���·'�e(oB�	�p��(qD��������.TF�
8
�	R�H�T��"�7��E�K��o!ِjz3&��)����n)��i�
޵��΁��N½��1��B	r���i����]��;�����/X
�dkqI��H��������7��GQ'�,D1d}��}H!H$'�s��z�
;:-��Z� l�-Ӏ�$�d.@-��l�Y�3�A�B�+
m�O����,$���9�=�=
-��Ph��m�d�]%�(7A
-T
y���\�GE�
BLJi
-#�O�U�ߏ��!��MzXl��c�

� ��-�ђ؛Gi��6���Hxl[۳0� q��rtp�w���sqC����<������=�ۣ<�
����(�:���<�r��܆ܵ�\q�<��o�ƣl<�M�x|���
�(!��A�
T� ��@"b�)>ޥ�߲�ab�~�ʤ�"��sڶ{L� s
��KȺo{���3�#ѵBm!����|B��^��`в�]w���&�� ]�T�|5�T
j&6��d�;7
��V��I��	n�;�Nr��>�MJ
��봴i����wG�=M�))O�7�ϊ�;N�kv�x�8E`AG���#
`��&1>�Z
f�z&A�M�D
M�:d�
-1INg��(��Θ"�����*6��%O�ɦ}��A1=��`�{�ޑ_^6�����x�u������_�y̺��@<
-�����^��x�u�Ĺh*V�6�:�

�3mC$�k�'G��ܞ~OOt�C1�Ew՞H�?��&T#� ap�
-��I�p�:IB5E>��p^'��j��j�@a[m:�M?����O5���z`۽��\]��/V!#caqB��~�V\���1
x<zʊ�Slj�4&�8���5p�4b�:�m���E�j�_�N�6ﱣa�9q�hykW����M�ʞ�l�ۗ�4﮻|إ�!N+�����*�I
-HC�Nɞ��Q2�N,"O� ������V�>;ׇ{>���9G[�E���>zG�)��[گ
-@�D�)��l���I�C��t���WW	�ݭD�e6��`�F�742s7�L?6h���v�EZU��:t�����<zC`{�Fw��
--��������dP��a*[�J{�e��_V�k%fK
��	���h<�gBL�
H�4�M���+;=�j�=��i�?!�议��e��==��V_
-Ph�([]K�z}��1g��ta.���6�j~u|N�Ɛ���uRަ{�\L�#���"�)v�tL�6c���~�}�/J�������U*�6�o�aa�%��w�R_�b�����p �
�E��\Mh���hs�W�
�
泼+��Ŕ��J����Z�s�@V�r
!���~Jo1
T��L�Dz��a9��Q�f=�'��	�I�Ϲ&�����\
E9�d)��յ6��Qo3�S4�T+�P	__
-�_�U��(���Uf��Xs���V�W7�?E�����Y
ҫaE��W�5��k+%D:[ʂM�ޑ���^8'��9,S�+|
K��
-	eA�˰R`��S
-�-kuB"Lb�]2��ަ
�9��C
g�����H6 
�:��
-�=
p�bP��F��
�YF���7 }E٩�e��z�t�^�����ի��_UZ����$�9/��`k+U�8 8�\R�%u	�a�׉{����
+Dp$���]]o/�?���Vi~� ��O�}��.B۠ش�F��
�܅�6���$u� a~  ��R���n^����m���a��d�l�
-endstream
-endobj
-12050 0 obj <<
-/Type /Page
-/Contents 12051 0 R
-/Resources 12049 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12026 0 R
-/Annots [ 12046 0 R 12047 0 R 12048 0 R ]
->> endobj
-12046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 290.739 228.516 304.686]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
->> endobj
-12047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.533 148.333 490.745 159.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-12048 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12052 0 obj <<
-/D [12050 0 R /XYZ 89 770.89 null]
->> endobj
-11803 0 obj <<
-/D [12050 0 R /XYZ 304.125 668.32 null]
->> endobj
-12053 0 obj <<
-/D [12050 0 R /XYZ 90 661.68 null]
->> endobj
-12054 0 obj <<
-/D [12050 0 R /XYZ 90 569.196 null]
->> endobj
-11804 0 obj <<
-/D [12050 0 R /XYZ 440.014 403.213 null]
->> endobj
-12055 0 obj <<
-/D [12050 0 R /XYZ 90 396.573 null]
->> endobj
-12056 0 obj <<
-/D [12050 0 R /XYZ 90 316.044 null]
->> endobj
-12049 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R /F99 5346 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F7 795 0 R /F98 863 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12060 0 obj <<
-/Length 2671      
-/Filter /FlateDecode
->>
-stream
-x��[m�����_A�@+!�z�_��@�䂤i���~q
C���P��������]�.o%�NT��}�[�������,���G���|;{y�Xd��TF����Hq���o���)�xw�CĤF�Hx����������7��oog���
G� ���j?{�Gk��C�3:���#N|�7��p_�������1�;����
�ij�~��V�T$�QL�1A"�$���]5F��(�9��ޠ_���	Ҋ7�=<�i��#H5ijM"&E3f[,b*�|�V�۴L��宺c5�ϳ��:YWw?|�>ˏIu����.qS��X���*��dU��'�� ��v�,�b ���Ј܄<@(�|��@�6\����)��0QL����m3q��]�n�C�s0M���:J��"�"���
���z��4+Ɨ_�;�G��Ӷ�جfٲܦw���
F�K��	�|��3���o?���7}%cB0[� HkQi
�$G|���d�kk ���uu�s������
�U�����7��O�r�n9
��u�[1ՈB���E���L��v�@8(���w�X��,SH�v�ur��[Gk3�y���P�g4��!A��RB�Ѧ-&��x3S��ĉb�����b.b
�K܂>�@b��$
-H�=n\�m��A\��W
-8Ӯ
�r��y�]W�\o��2�F���8�'�0�q��L�Fe���L�r5�q�3�̋r���~A��L6g|>
*�
C at pb3Q'�z
q]@T�/[WzZJ
 mؽ�֕?n�d����I�����B!�ũ@���m!
-����`L�����
-i��(e���fP}9��	4`̅R�ip:���vL
�8�5�
��F��*��-��6;#�i�?S
-2�
-�
	T�`hA	�����Z:
X~�%!k�R!zI
ȓ��ˮ�~L.<<�=���.o�
-$�y 0����D-����o\UY7,eW���Ku���)�`�M[4�@�o���Za:.ј-��;��ɳ� ���Ԫ~(J�D5W���:�cl����HO
�z�
�s�i�\W�
@+�&�2~Z��H:ӗ�j
���>��Pa�F�I4��P_�S�ǖ>��X� ��;����J
�H1>�I������3ic}YC�`f;�z��3ú ��g�-�B����AU�:�
�]B�0z
-�}G������#�
a"L�<	�� 5�1�좐&I͜(p��I�`:�
v���u"tԅ>ꒉP�R�u�mC�yf 8%6Ʒs�%#O�t���e+�2�pW� C�2� ���$�1�6D�i
-r!�A�v(�!�m��(��Fb�PL����h|N��c�2LGb��a
� "����U�]���� �ĕO�.��]
-��aY�({��(���G=�� ��zW�!ތP�p�2
�l�2j����i�����v��~;N�`��~2�{b����6�[5
5���V�&|\w�(lb~��[�^�����Lf�-ϡ� ���~`4�]��|��##.��`}y�;Q�m�6~�$H����`���G;?����p� �$�S�a>�I,,��Lr=�����`�3ɴ�)��7��0�Ӥa�N8�K�x��&
jO�j"�<��-�-�^��o�
��^�kĆ=�E{J�Iڅ�\�k�����KK5	�R���^Sס����݆�"pn��$(�X�t>	d���#�����A~82���� �_�`VN1��h���6m
�[n�k0F i?��MR��g�Ȃ��B s
	 �l�f��
t��l��^�2��.�ˮ��]V$�#�e^���V��|���â�$�^e}�0�J�?nAZ��볚�Ҳ�#t�_��qޜ�za���
a$D	$&�OP�ܷ�,�/C �TL\�H�)
-Y�aJs�QGr�'�s��B~)!'��N�gۥ���}	�Qy�������n8�9x�iA�;
E(5(�f�籣wh�b�K�����
=@='�-��l���U.wÖl/<�
-��\T��lv��Kة�+*1��h�L�����d�e4��M��
�	N�2����
ba�F��~��g������Az�
=�g�9H�~!�9)yZ��=zf�H�v��
�%�0�
-gt'ޛ ��	U�P{�
�e��ce�"��2��Ԕ�'�H(��s�ND�L��Ǹ(f�Nx׈|X�#����T5�b�R?�Ø)�D�b�^M�K���v�HMX4F������1�r�$��
���z ��T�
���}�
EG���D��v�s��m�)����#N�j&7i��Hy�I�XK����)*�H�WΩL
�e�5�]�oJ*�)Rö�TT�Ҭ�z�뫾�D�e�r�ȩI�٫P<�ge(����޶����#�Ka�JK_�ɯ��3������@���㿱8���Ho��4W����!�:�7��
���
E �
-H������WG2~�<��Tį^�������O��������I��6=�z�a�*�;��ufߘP.s�w���<S�x���E�d ������ʁ=�u�k���fR�wc�_�X]��H�?,���k�ez���Ν
&yQ�4
-n�mРE� ~�$I
�^�n����-GO���~,��W/_~8�Iz�V��]���
�v����}��GN6���BK	K���w�
-endstream
-endobj
-12059 0 obj <<
-/Type /Page
-/Contents 12060 0 R
-/Resources 12058 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12026 0 R
-/Annots [ 12057 0 R ]
->> endobj
-12057 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12061 0 obj <<
-/D [12059 0 R /XYZ 89 770.89 null]
->> endobj
-12062 0 obj <<
-/D [12059 0 R /XYZ 90 657.069 null]
->> endobj
-11805 0 obj <<
-/D [12059 0 R /XYZ 90 630.755 null]
->> endobj
-12063 0 obj <<
-/D [12059 0 R /XYZ 90 630.755 null]
->> endobj
-11806 0 obj <<
-/D [12059 0 R /XYZ 482.305 567.297 null]
->> endobj
-12064 0 obj <<
-/D [12059 0 R /XYZ 90 560.657 null]
->> endobj
-810 0 obj <<
-/D [12059 0 R /XYZ 182.124 487.216 null]
->> endobj
-12065 0 obj <<
-/D [12059 0 R /XYZ 90 482.578 null]
->> endobj
-11867 0 obj <<
-/D [12059 0 R /XYZ 463.017 419.091 null]
->> endobj
-12066 0 obj <<
-/D [12059 0 R /XYZ 90 414.453 null]
->> endobj
-11868 0 obj <<
-/D [12059 0 R /XYZ 90 360.763 null]
->> endobj
-12067 0 obj <<
-/D [12059 0 R /XYZ 90 356.28 null]
->> endobj
-11869 0 obj <<
-/D [12059 0 R /XYZ 90 306.65 null]
->> endobj
-12068 0 obj <<
-/D [12059 0 R /XYZ 90 302.167 null]
->> endobj
-11870 0 obj <<
-/D [12059 0 R /XYZ 90 250.425 null]
->> endobj
-12069 0 obj <<
-/D [12059 0 R /XYZ 90 245.942 null]
->> endobj
-11871 0 obj <<
-/D [12059 0 R /XYZ 90 194.255 null]
->> endobj
-12070 0 obj <<
-/D [12059 0 R /XYZ 90 189.772 null]
->> endobj
-11872 0 obj <<
-/D [12059 0 R /XYZ 90 138.14 null]
->> endobj
-12071 0 obj <<
-/D [12059 0 R /XYZ 90 133.657 null]
->> endobj
-11873 0 obj <<
-/D [12059 0 R /XYZ 90 81.969 null]
->> endobj
-12072 0 obj <<
-/D [12059 0 R /XYZ 90 77.486 null]
->> endobj
-12058 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F7 795 0 R /F8 794 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12076 0 obj <<
-/Length 1617      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ�SJ��z�#h���E�p�/i06��(�R\��wx��J0���Q�j83��o��n��:��%|�x5;�P,0�H*��E`p��AB·��uH0�<��qx
��:~{Q
nV��'7Y����]g��>}�L�8{{Qn�u�����!
�PD9��ֿ+��<�'Rf�?Y�$5���7����hN�"C�d}��wIy�e�H���0I�ᖐԄL���엫ه38 ebR:�^�^���
�~	eF����yh�����
�2^dl�3M���D#�������O���(2HbϸB��z���]���<bf��i,=)%L�#�/Z(�0?�bߢ�+��f����%Y��dߖq����+^o����"�}bL���Ľ15#��&�������i��@��Eg̜	� 
s�gA�c_gI^r7o���Y��Bv�ϡZ�R��Bb]��e�����v�+t����׋&�=?�@D�A4��	d�i� Tz��� z��J��A5�9_>x
�8q‹S��[��Rd��J�5Q�+""���V��	1i�
?,�
�
�a
v�	��SHS�!V\�-�@�#c|Hӧ!M��@�iԉ4��H3�������v"�6H���F���R޸�jM�
rf�@��á
$W"(Gx��=�C��䡵�HC�Ă�l��Fsp
����㸆h�7��sb����HlT% T=̆
d#��S��‹Y�
��*6!W1��*�|� ˱*��#P��
��\�\�
L�X[�3�8[��V�
L#�*��H����TM�Pi�j�<Ι$Hѧ���
�£�M�
�!Ni���D
�L�+o
�O
�"g�A
-|J#]�`�	�Ǟ��
��{�q
Y
 ��&"�cBP cK�Q#sI���"_$;�W�C�q
�K
�
�zY�!�
���柆����?���)%vJ���'	8�سdE�
�;� ��/q՟��;�R�l(=s��V�
�
-�ʔ��9L��W���~�%��!��c�l�h���{m�fB�
&��#x���Ϡ��v���S��;�v�tz�܆+^������m5P����Q�
����[Z��_���G�E!)�W8ࣄøk��
$�_�rPS(�^I�H�������#��\ˈzJ���[
ƻ��F���`����\��
��
NȀ7�v����%J=<#^�A�1���G�1���#
�=�3��p���;�pur/<�
=��xx_�g�I\s����cB�
��{������>���-E�7P$�`:�5�NR ���]�o-F�0�wI{6��t*�n�����]�����������K�=
�84B'=�(
;���o����2u,��k��x�xR�ףA��4H�͏}�s쀬
�[�
�k᠀$y�k9b��A-��ڇ�ʱ��*y�cْ"5q��� 6<Jã$�bs����~Ug���yy��6ɾ������ӏ���u�/x&�v�I˛�8P4gP�����t�����}V��u���$��nw�������m�ޢ��z��:q at u�9��(�Yo�*�e�L�?Q}��Σ�II�L at 2?��eYU�_��\��X�8�m͂�7����Q�\-
-endstream
-endobj
-12075 0 obj <<
-/Type /Page
-/Contents 12076 0 R
-/Resources 12074 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12026 0 R
-/Annots [ 12073 0 R ]
->> endobj
-12073 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12077 0 obj <<
-/D [12075 0 R /XYZ 89 770.89 null]
->> endobj
-11874 0 obj <<
-/D [12075 0 R /XYZ 90 676.948 null]
->> endobj
-12078 0 obj <<
-/D [12075 0 R /XYZ 90 672.465 null]
->> endobj
-11875 0 obj <<
-/D [12075 0 R /XYZ 90 620.778 null]
->> endobj
-12079 0 obj <<
-/D [12075 0 R /XYZ 90 616.295 null]
->> endobj
-11876 0 obj <<
-/D [12075 0 R /XYZ 90 564.607 null]
->> endobj
-12080 0 obj <<
-/D [12075 0 R /XYZ 90 560.124 null]
->> endobj
-11877 0 obj <<
-/D [12075 0 R /XYZ 90 508.382 null]
->> endobj
-12081 0 obj <<
-/D [12075 0 R /XYZ 90 503.899 null]
->> endobj
-11878 0 obj <<
-/D [12075 0 R /XYZ 90 452.212 null]
->> endobj
-12082 0 obj <<
-/D [12075 0 R /XYZ 90 447.729 null]
->> endobj
-11879 0 obj <<
-/D [12075 0 R /XYZ 90 396.097 null]
->> endobj
-12083 0 obj <<
-/D [12075 0 R /XYZ 90 391.614 null]
->> endobj
-11880 0 obj <<
-/D [12075 0 R /XYZ 90 339.926 null]
->> endobj
-12084 0 obj <<
-/D [12075 0 R /XYZ 90 335.443 null]
->> endobj
-11881 0 obj <<
-/D [12075 0 R /XYZ 90 283.756 null]
->> endobj
-12085 0 obj <<
-/D [12075 0 R /XYZ 90 279.273 null]
->> endobj
-11882 0 obj <<
-/D [12075 0 R /XYZ 90 227.586 null]
->> endobj
-12086 0 obj <<
-/D [12075 0 R /XYZ 90 223.103 null]
->> endobj
-11953 0 obj <<
-/D [12075 0 R /XYZ 90 169.358 null]
->> endobj
-12087 0 obj <<
-/D [12075 0 R /XYZ 90 164.875 null]
->> endobj
-12074 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12093 0 obj <<
-/Length 1917      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~��P_�=ԛ�_2��R�@)����2%�Om��JH�}���[�:����0�����s�t���w�a��ৣ��/�yI�w4�
�7HH�k�}2%G�^yLjD�����g��9z���}�l��h�i@���Hi�t1��{~�a�>��
�
�s����d)����6�df)�6c�)�Š���4Xųp�Nڀ�X®�,�!<�HP�U��@zS�
-�1�Ɠ�"N�Z{�!C������VAL�	G�l1���V@�k��CA�
Oc�5�xrx8�g��qE#.�ad����9����
(QC��1��j�~�z�[U��<
-GT
?/Gcj�p6M�l�v`��O;6�-����>	�� �D̈́ޜ�yvi�Ԥ�Ȁ&ل`D��?�䡟��ez�{1h, 3���_ϖ�
�F��Åu��{<Ns~L�Z��cB��
c��?�e\CT	D X���v�3y���̿��kN�	s;�%����ڍ`�*�HFc�1
��b5���!�ࠈ�"|~�3j�
-)��	��*X��$@>k�IV���l-�1�hT�T-�BA �m���mB���2m�xd�
WA��a����;��}$x>07S�߳B��˜�
��!I
-�S�b�6�D
y��\�1��}9"+cپ+�SE������!
-���|�F*c-���h�`m�|�|��T�|�f�:��O
��0͕fk�[.
=�@��I�� �rb�����Y.�,�$[�D|����,[嘆c��P��[���}�
5]4#��fX�4�
I��I�j,��,�|��O�X�
�&���v�䢙aJ�(�FRV(�4�3A����ӗ����X�B	1�m�X�
�������j��#-����d�"@Uݴ��;�`��6�n@�C
-�A�l�4(D;
D����=S5�℗;��]�ʃ���X¶J��+��D]J�D�V�إZp5x�(L���:�2ڰ�3��6�+��
�+H�(�o�+'�\v �}�W�A,�{��:��-���w�{��+X��^��{�L�%��N��^U��*.���s��G��fUC��5�j�}=�*q_ݪ[��;9�
�}'Lg��)��h�O|��*�٬Rܵ�,?}�6�X{�Aݛ�R�GV���	ƺ��L��;V�D�WJ;
-�
-ƶ����
+OX�=�t��+����r�R at W`�ZYZ��ؑl\\cn�wr
�k�q5��i�uGg��+WԄ
-��2'0k�Ȕ���U���߇Q����W�
lt�%����rղ%�j\U�W
E!�v'��aGk�AWr�t��42.�R�w����D�+1騌�UQ�C�0�i/�(مh$�(���v����֢��v��lj
RJB,�>{D�`Q���L�p��&�}9����l�ӫo/�
�ɩ
�ѓ�ڤ��?�IB�c���el̲�.V����A�
�v
-�/� ��g@�rZ��WZ�6�q=�WV�`��V{d`E�z����^�`���ܢ��$!<��Vc�y��Z�
����"[;��­^�U0�Z)XQ���'��������K���a9%o���X!�.�R��z����
DŽ5s�
���;��"9�+4�څ�[,!�.7��N�(���.��N�
|t
�ڛ�}R
��*D�bM�)k��R��ըn��=o�*ru�
u��J�
-F'�h��@ՠ�7��=�话f& D�4��e�F7���`EEٮ�����?��?�R��4]�_�>}���

�\0���J�1�K��
J'�O͢	Խ2_4;��t�����j�3���@��>�ˤ

D�y
��砤R���A�E���B�_�RE
p�Ef���������l
,��i��
��e)Q��P�Zaa���2)M��|�͕��Fs�
-endstream
-endobj
-12092 0 obj <<
-/Type /Page
-/Contents 12093 0 R
-/Resources 12091 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12026 0 R
-/Annots [ 12088 0 R 12096 0 R 12089 0 R 12101 0 R 12090 0 R ]
->> endobj
-12088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.483 694.807 535.938 707.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-12096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 681.422 275.98 693.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-12089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.483 458.495 535.938 471.013]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-12101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 445.11 275.98 457.06]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) >>
->> endobj
-12090 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12094 0 obj <<
-/D [12092 0 R /XYZ 89 770.89 null]
->> endobj
-12095 0 obj <<
-/D [12092 0 R /XYZ 90 718.682 null]
->> endobj
-11954 0 obj <<
-/D [12092 0 R /XYZ 90 672.057 null]
->> endobj
-12097 0 obj <<
-/D [12092 0 R /XYZ 90 667.574 null]
->> endobj
-11955 0 obj <<
-/D [12092 0 R /XYZ 90 613.73 null]
->> endobj
-12098 0 obj <<
-/D [12092 0 R /XYZ 90 609.246 null]
->> endobj
-11956 0 obj <<
-/D [12092 0 R /XYZ 90 557.559 null]
->> endobj
-12099 0 obj <<
-/D [12092 0 R /XYZ 90 553.076 null]
->> endobj
-12100 0 obj <<
-/D [12092 0 R /XYZ 90 482.37 null]
->> endobj
-11957 0 obj <<
-/D [12092 0 R /XYZ 90 394.557 null]
->> endobj
-12102 0 obj <<
-/D [12092 0 R /XYZ 90 390.074 null]
->> endobj
-11958 0 obj <<
-/D [12092 0 R /XYZ 90 336.23 null]
->> endobj
-12103 0 obj <<
-/D [12092 0 R /XYZ 90 331.747 null]
->> endobj
-11959 0 obj <<
-/D [12092 0 R /XYZ 90 280.06 null]
->> endobj
-12104 0 obj <<
-/D [12092 0 R /XYZ 90 275.577 null]
->> endobj
-11960 0 obj <<
-/D [12092 0 R /XYZ 137.073 196.467 null]
->> endobj
-12105 0 obj <<
-/D [12092 0 R /XYZ 90 189.827 null]
->> endobj
-11961 0 obj <<
-/D [12092 0 R /XYZ 90 138.14 null]
->> endobj
-12106 0 obj <<
-/D [12092 0 R /XYZ 90 133.657 null]
->> endobj
-11962 0 obj <<
-/D [12092 0 R /XYZ 90 81.969 null]
->> endobj
-12107 0 obj <<
-/D [12092 0 R /XYZ 90 77.486 null]
->> endobj
-12091 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12111 0 obj <<
-/Length 1889      
-/Filter /FlateDecode
->>
-stream
-x��[�r�F��+��V���*�!�Rq��+��.$A�*\d����O� 6rMY�
+*
HAPc����p��h��ӈ�_������#Ns
�\D�FF:�4�v
=�%Z�'�R���l��:
s/�7o��,y���4K����4�^
����l�����c
�q¥����S��Z<�
W��G�#���oq�d�
O������8�]M�UZ\�#�H�1�q:?�KJs
cr��OFoG
�Ј�Q���l6z��F�p�	T8�_�4�$�U�F�F��h��kK����#�Ymh"	wk��u��r�
�2bK�!F����U:Of�Ɩ{-
-;���2iK ,O�������b���dVH}��xq�f�j��vM&x�hߪ�%�V���*���>n� ��w툐���=�S?�l1_�<��p�	U<��9���qt+�W]�f��
ۖ0퐍�%x��q�עae�1�j>��+�=��
��/׼(O��#�;a��
��Im�]���W�*t(�BT�$[�I��A�dF�!�p~�Xb�F�
&���+�JC�,�9,
���*�,�%�
���跷�I�:IL'��$4d� 
C0�0G�
�����2[����IJ�A,;������u��b�ePsek�P#
-��U��� �2.� ��� ��Xm�`-l���������a6Ϙ{�C<X3��a�n���Fs�� Q�Q
�2(Qvm�%D���!�.��i�[��D�
-.�<�V�x!<�����G:�#'�#g��j��I����i�T<)tݐ	Pq��8�'��Y�t�U��j]t��
-�ߑ��
M-��{�A��+����9�M6J�Z�E��<�׷9o��[��h^��a�u��a�~�e��D�f�`g>�*�� �Ր��؉��S�g��NF�����`x}#�P��Y��T��L��嬮�
��q������"���z_! �b��Wl�VzH�	tu���,j�g��2f-�Q�_��<.~_S��%�D��?���0���\�Q��Nj�r�a�0
�~?���o��輎楌�2"H�5���;���M�ay}cQ�
-�Za���Z�6
-�i�{Ш�ݕ��KCFm�����_�ʸ�
m�C:;`VbD�G(-G�R�ʽ�.�BZ��/r|����	FBuխ'�6�凩�jXۭ!�@�QZ��'	��݃��M�����iNT���,��`:��V]=�n�e��</$.nj���`T��}-ͧ$����Z��w'�y��ƌh�{^�q4��\�DD�
	�}�!��0I?
'��J��il��m�6W�����
u�{5��Q�U�łm�܇�U>ϱ���C"��6��99�s�Ch�
�ƈ,Y�1
C��Jc�jɼ�1��&F*�e�
�E��
-�V͈�{D�9������ݭ��
V�
9m�m�
��7��u��Wϱ
7
�p�c�U�G�u^י|[Clm�y�#����ѽ:ڢ�c�v!��
�����@�[:H�u[�6���;�RH� (F����AV���1jE߁0��_�Pg���DZ�����
-��+߽g at C6�%�YIϽ�)l��-�Z��y�gىg�{J���/����Es!J�1��'υԐUr����ʅD��K�
�+�E���mJZ�C
/
P@�m&h�Q��|ȩ=*�y%�!.�S�L��Y�x��C����wF5'���;��D5;���Q�%�7�݆�'o6�
?-���L�/��6����̯�i�=�ڻ
zi��\̋���\k2�؟gi�ѪX��Q����(�R��D��0{�Z]


�^�^����l1�}9����
#� F�3[d�.�pq��`��|�����y��� c�
�1�,�4���X������3�� o���/��LX
-endstream
-endobj
-12110 0 obj <<
-/Type /Page
-/Contents 12111 0 R
-/Resources 12109 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12131 0 R
-/Annots [ 12108 0 R ]
->> endobj
-12108 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12112 0 obj <<
-/D [12110 0 R /XYZ 89 770.89 null]
->> endobj
-12113 0 obj <<
-/D [12110 0 R /XYZ 90 670.407 null]
->> endobj
-12114 0 obj <<
-/D [12110 0 R /XYZ 90 637.406 null]
->> endobj
-11963 0 obj <<
-/D [12110 0 R /XYZ 90 602.342 null]
->> endobj
-12115 0 obj <<
-/D [12110 0 R /XYZ 90 602.342 null]
->> endobj
-12116 0 obj <<
-/D [12110 0 R /XYZ 90 568.279 null]
->> endobj
-11964 0 obj <<
-/D [12110 0 R /XYZ 90 534.216 null]
->> endobj
-12117 0 obj <<
-/D [12110 0 R /XYZ 90 534.216 null]
->> endobj
-12118 0 obj <<
-/D [12110 0 R /XYZ 90 500.154 null]
->> endobj
-12119 0 obj <<
-/D [12110 0 R /XYZ 90 466.091 null]
->> endobj
-12120 0 obj <<
-/D [12110 0 R /XYZ 90 432.028 null]
->> endobj
-12121 0 obj <<
-/D [12110 0 R /XYZ 90 397.966 null]
->> endobj
-12122 0 obj <<
-/D [12110 0 R /XYZ 90 363.903 null]
->> endobj
-12123 0 obj <<
-/D [12110 0 R /XYZ 90 330.841 null]
->> endobj
-12027 0 obj <<
-/D [12110 0 R /XYZ 90 295.777 null]
->> endobj
-12124 0 obj <<
-/D [12110 0 R /XYZ 90 295.777 null]
->> endobj
-12125 0 obj <<
-/D [12110 0 R /XYZ 90 261.715 null]
->> endobj
-12126 0 obj <<
-/D [12110 0 R /XYZ 90 227.652 null]
->> endobj
-12127 0 obj <<
-/D [12110 0 R /XYZ 90 194.591 null]
->> endobj
-12028 0 obj <<
-/D [12110 0 R /XYZ 90 159.527 null]
->> endobj
-12128 0 obj <<
-/D [12110 0 R /XYZ 90 159.527 null]
->> endobj
-12029 0 obj <<
-/D [12110 0 R /XYZ 90 125.464 null]
->> endobj
-12129 0 obj <<
-/D [12110 0 R /XYZ 90 125.464 null]
->> endobj
-12130 0 obj <<
-/D [12110 0 R /XYZ 90 91.401 null]
->> endobj
-12109 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12144 0 obj <<
-/Length 2024      
-/Filter /FlateDecode
->>
-stream
-x��Zio����_!������gh$H]9p�E�բ@�E����RrR���
�H���}9
޹�9��!��16/G�
��7����bcy����r���
������a�ݘI��'�l��������\M�_G.�1����"����
�f�
�&EcN�����#��,�d�5"��L0�
�O9.�O�At����rp
��[5ED�R�g���p�����M�Qด��Q�@��$����|F��
�Ւ��q�g��$�:$
-��C*f+�wY	��P�_ at r��:I
"&nn�/X`��O.�x�.�������^Qy-��kM���\(GX��W.l�

-x���Ӥ�k����TC�[TV�ɤ�h���ʤ�i`����Ѫ$i� �{
qJ�.��3�
����8"��#�3�.l��|F�+�d� <�<�a�*f݁��v	Y�+�[��	+�����.����O?�$��G�ZD����Km��ۑ_6zy]�}���
�>;�Y�%�'�X
E�%�In\ɲ����Q����ɸG3G���6��".I'�򔶑�e�"�D�rä��i_*����݇�D
-D��]&M�~03��I2m��b�UR['i�x-�In^��p�OdQs_��
�ưרCO��L	�;�ak���r<:�ӥ
]
-0�������ű�^	!�#��jšX
-��Nӳr��Ĉ8eE
kQ�k�ʞ�c=4�H
�&m5��![5�)�C5$H@���j��j���
-��Ր�VC�mL�޾a/�pȩ
���ׂ}[\��~.3%�]�w�l�mC�PIr���`^�h�O.��DbQ[i%�;��mC�Y1�uO_�����<����UB
�M��0�����
��Y{S�
�6�ntkk9�h�Hp{��{�~F;-�\��F��E�˳�N�kS���6|)�S�����_���t��w
�$�|Q�z�_��|Q=�0a�m����Γ$̥��|n੊|�
-�{
O�ᾑ�Э��a7��
�un�(xQ�,�Q�&_�e��8J
s�tw�F�;&
-I�o�$�B��BR�(�Hc����0Y����r�&��*�;d�v,����~Z���!�]B��;�+=����
�+�YqN=�������m���r��'��a~m�'�d�\�FA����$·.�#����U~t����)�~qr�\���3M��֠��	Χe|�A7O�థ���
*�K%�N�T�g�w���&D����mR�蠅�Tf�c��"�
�a��_�!��z̰FJxCߺ0$���v)�oi�a"�!�FV��9
�]�2��i�
-�
l/P8�P$��Z��>DZO�_��: �JE���b#��A�%9w�$
���y�48|\• 
�`�:��R���"���of��'1$o8�
-���Y�(�����*���B�M��������WHB�����e|�.�
-�`H���g
�Z���
��������[!N o2�,@��`ծ�����	��af�y"�`�^Pz�M�R�I�g�u���Z���c�7����(Dפ 3f�(���
7�û|Ȭ`"��������M�*��e�.R�"0�)�b_g��_-��Ɗ�
��f�"E.��f�_^䀟;
�x�Q!�a	��h8*GI�N��l�y����ޘeC������ٻ���7/�����4k��*E��˂ڐ�
-z:�����i�u>s�<Йa����`N�t ��ϻ��x�'H�d⇷�>�{~Y���t>�Φ���/�gǯ޾�oH�w��Kr���F�t��V+_b���Z���|�����o��bd��Hf��D��р�U���OW�LZ����1���BAo��G����q/���WH!�(E�����byO1pp��	�Ź ϭf����&�Ƌ9�fp6{���
-ҧ��s^����cVS�U�3�M�D���S�A	�\��Uj?�j^Ca�PT���z}sxpp~{�
-�+t�D�,�o� ��_�T����0h�`���[�����W
-endstream
-endobj
-12143 0 obj <<
-/Type /Page
-/Contents 12144 0 R
-/Resources 12142 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12131 0 R
-/Annots [ 12132 0 R 12133 0 R 12134 0 R 12135 0 R 12136 0 R 12137 0 R 12157 0 R 12138 0 R 12141 0 R ]
->> endobj
-12132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 206.815 192.544 216.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-12133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 133.312 244.968 143.842]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983a) >>
->> endobj
-12134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.738 133.312 294.581 143.842]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983aac4528dcb9794c502cf7c9bd65e9c54ae) >>
->> endobj
-12135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.458 104.098 243.782 114.629]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) >>
->> endobj
-12136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.393 104.098 413.893 114.629]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da6a4badcfd0bb8d6e536fa16b2d5108d0) >>
->> endobj
-12137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.801 104.098 513.996 114.629]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) >>
->> endobj
-12157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.143 185.631 102.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) >>
->> endobj
-12138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.62 92.143 289.122 102.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da4d21924dceed7aac6368d4bc5affeccf) >>
->> endobj
-12141 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12145 0 obj <<
-/D [12143 0 R /XYZ 89 770.89 null]
->> endobj
-12146 0 obj <<
-/D [12143 0 R /XYZ 90 692.575 null]
->> endobj
-12147 0 obj <<
-/D [12143 0 R /XYZ 90 658.512 null]
->> endobj
-12030 0 obj <<
-/D [12143 0 R /XYZ 90 624.449 null]
->> endobj
-12148 0 obj <<
-/D [12143 0 R /XYZ 90 624.449 null]
->> endobj
-12149 0 obj <<
-/D [12143 0 R /XYZ 90 590.387 null]
->> endobj
-12031 0 obj <<
-/D [12143 0 R /XYZ 90 556.324 null]
->> endobj
-12150 0 obj <<
-/D [12143 0 R /XYZ 90 556.324 null]
->> endobj
-12151 0 obj <<
-/D [12143 0 R /XYZ 90 522.261 null]
->> endobj
-12152 0 obj <<
-/D [12143 0 R /XYZ 90 488.199 null]
->> endobj
-12153 0 obj <<
-/D [12143 0 R /XYZ 90 454.136 null]
->> endobj
-12154 0 obj <<
-/D [12143 0 R /XYZ 90 420.073 null]
->> endobj
-1901 0 obj <<
-/D [12143 0 R /XYZ 90 333.444 null]
->> endobj
-394 0 obj <<
-/D [12143 0 R /XYZ 90 326.02 null]
->> endobj
-12155 0 obj <<
-/D [12143 0 R /XYZ 90 225.407 null]
->> endobj
-12156 0 obj <<
-/D [12143 0 R /XYZ 90 150.593 null]
->> endobj
-12142 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12219 0 obj <<
-/Length 2052      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�6~ׯ�+�T0@�6�IӸ�6n���t�t84	�L%R!)%ί���)�e'�4O���b/|�X�6~
}1:<f��#ߵ\�����
Q����1�ȥ�`��g&��0����i�q6���q
/��<�o��NO΂��$�8���9�(
?��E�
_�+._�4��Բ<<��o�u������݈�X� J
��gD��뿰��OF���%��p,~������adQ�(~�~���!������d�i���7>�K�P>/ҨL����������fK\�؞��2���e��\�Z~�u|���x=�`Xe7e��x-��S��W��d��
��9�O00!k4�m�M\Gh��eLE�s�&�/�i�}��2O�I8U@~�0�M�*��b=sM�Ul�}��^rC>�DL����B�|6��������[tC��U��*�'Q�՜�ji8�J��t��C�KH5�5����(�肎�����<���y�����ƶ�Cs�V^��Qؒj�G���5%��&!6~��Ep��յ��A���Ҵ(P�3��<̃���W
k=�0�y!4

-������Ҍ
GGy��8I�����1a���2�%C��in��o����'�'>�8y�ˀ;mO� �=�=��3U�rK��֖T7�2I��s1%��	.�����
#�� ZE��!ϱ+�+��^������B�?�ˮԯ��
;EZ�$��U ;�!��!M��>���$x�'W���M�!�kQ��� .����R9hUi��C���<�Z��j��0s#��+�rH,K
8W:�
���ȡ5���!<d7`��^��f
�C�x,bU
�nV ���F-Q�d�V��B�z_�"��8��N
Y-�j|0Ш��ƅR&ڨ�!l��Q� 5C�ڈ�5^��i����i<��,ӿ��*�T�ӆ!��ొ�\
.��
6��u���P���O��`�–�h�c��ڣ:ω�-�HP�d����uۗT�%}�T�
�C*"�T�lw�TDj|�v� ����{�s�â���Lƥ�����(�%:���w
-�T��������\[�
���0Ё<1PA��Ґ'��@
����@���
-y�����7��������1,�� V����Z���
�݄/p\$�٬�T��!P���=�T��m'i�����Z at DG���y)��8I�������z�Y.;;�~ȝMuxl9-6l���
�q]�64
1�v�6��>�S@�������� ��<A�'��@Ӗ|
-��:4,�Z`	X�¶r�ZkH: �6���r�}����<��麐�2I�(��w�#�g�v�I�w��
����X��!*�y
�
P<���nx�˚s	�U�x�~:��Yi�U�]��c��G��Cq�{=	E8}�M!
-�R�n�"���"�T�J�����	�I�Nu��Ԁ�m�T>��q�+��豘
�����+
	x�-����O

-�O^�Cs8�N�v^�q��Ys�o���i�Sx��#�
�v���2Ka 
���O����
sCl>5n(�Z�fk���[���O3[;�w��Ky��ě)�B,�[3+yS�*��oSDhS�c{�� �'��&�~�O���
�
-��y��\D܇tB�+�N G�@|�?�W�}��O�r��iZ
-C}
&��� ��~}�[�*wHk�l�i�ޏU=՛�Yyɣ:�()�nC��c����2
�S�>\U��7��l�s^��b��}s��R w��*��
�Ot�]� @��
C�A�Z����Ѹ�	A�Z
M
����mdr�u��{5���:m�ف�h
r��p�s/�
�-���U<���\(�{��f���
,�����Ǎ}e09~PgR�l��V���L����E��U���s��P�b�;~C)��t;�C襽.*����P�<�ʤt�=~�uM%�UFɛ~A�dD��0=�U顄�ۨ�~��
�������

^.�
�^�(�������0��ū*�ϲ��x��͉,Yّb�jU� c�a�	c��h?˗�D=px2��20p��?q���
-endstream
-endobj
-12218 0 obj <<
-/Type /Page
-/Contents 12219 0 R
-/Resources 12217 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12131 0 R
-/Annots [ 12139 0 R 12140 0 R 12164 0 R 12165 0 R 12166 0 R 12167 0 R 12222 0 R 12168 0 R 12169 0 R 12170 0 R 12171 0 R 12172 0 R 12173 0 R 12174 0 R 12223 0 R 12175 0 R 12176 0 R 12177 0 R 12178 0 R 12179 0 R 12180 0 R 12181 0 R 12224 0 R 12182 0 R 12183 0 R 12184 0 R 12185 0 R 12186 0 R 12187 0 R 12188 0 R 12189 0 R 12190 0 R 12191 0 R 12192 0 R 12193 0 R 12194 0 R 12195 0 R 12196 0 R 12197 0 R 12198 0 R 12199 0 R 12200 0 R 12201 0 R 12202 0 R 12203 0 R 12204 0 R 12205 0 R 12206 0 R 12 [...]
->> endobj
-12139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.09 172.361 695.994]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1ee38be62a49852994bf906003b0c23c) >>
->> endobj
-12140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.176 685.09 241.819 695.994]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 644.96 172.361 655.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a01993c545c5d4dc725147ac29b1d26e5) >>
->> endobj
-12165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.603 644.96 242.246 655.864]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.937 644.96 407.714 655.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-12167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 644.96 513.996 655.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 633.005 160.176 643.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.776 633.005 286.71 643.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-12169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.334 633.005 379.133 643.908]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-12170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.387 633.005 485.184 643.908]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
->> endobj
-12171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 570.957 172.361 581.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aedfa8f360379ceb195993b2ef04424d4) >>
->> endobj
-12172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.578 570.957 241.222 581.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.78 570.957 420.029 581.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [446.031 570.957 513.996 581.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-12223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 559.002 138.587 569.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-12175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 559.002 231.01 569.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-12176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.264 559.002 337.061 569.906]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
->> endobj
-12177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 519.868 172.361 530.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a5da8e430d26c6471590e2c7ae5f7d82e) >>
->> endobj
-12178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.578 519.868 241.222 530.772]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.051 519.868 361.878 530.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [405.255 519.868 482.504 530.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [508.506 519.868 513.996 530.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-12224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 507.913 187.842 518.817]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
->> endobj
-12182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.466 507.913 280.265 518.817]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-12183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.518 507.913 386.316 518.817]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
->> endobj
-12184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 468.779 172.361 479.683]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3805575c5d920cbc808cf34e44c11fee) >>
->> endobj
-12185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.698 468.779 258.148 479.683]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 440.978 180.109 451.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aa4a79e7bb87171b31d49429f9d875dcb) >>
->> endobj
-12187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 412.43 172.361 423.334]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.1 412.43 223.907 423.334]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a40f18b846fb1fe73b63da7fa7cbbbbca) >>
->> endobj
-12189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.244 412.43 309.694 423.334]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 384.255 179.554 395.159]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 384.255 250.666 395.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aff27d012a01487b7c9c14a9a3b40d9b1) >>
->> endobj
-12192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 356.08 194.208 366.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-12193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.948 356.08 311.935 366.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aa9f9e9fbb372e1f21bd0472b2db20567) >>
->> endobj
-12194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 327.906 170.687 338.81]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-12195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 327.906 243.314 338.81]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a8ccc13c9fa8f27701c935b481a371f89) >>
->> endobj
-12196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 300.105 170.687 310.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
->> endobj
-12197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 300.105 235.712 310.635]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_af46e579954688eec46ac0a43029fdaa1) >>
->> endobj
-12198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 271.556 214.681 282.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.421 271.556 301.724 282.46]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3800cc1eb2fb15d0c42dd71740bb661a) >>
->> endobj
-12200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 243.382 196.709 254.285]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-12201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.207 243.382 276.688 254.285]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a162d95e1149e222a317370e2fa25a120) >>
->> endobj
-12202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 215.58 155.265 226.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) >>
->> endobj
-12203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 187.032 278.681 197.936]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3aa58c4d8ded71e574db9d1c59533300) >>
->> endobj
-12204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.497 187.032 348.14 197.936]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 158.857 273.002 169.761]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0bf7e46a624f9d9df1528ae0b47ad55d) >>
->> endobj
-12206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.34 158.857 357.116 169.761]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-12207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 131.056 194.567 141.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_ae60e06beac90231262189084333bda57) >>
->> endobj
-12208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.904 131.056 265.411 141.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-12209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 102.508 198.443 113.412]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3a010e69cfabe1a026ee21f7639207e3) >>
->> endobj
-12210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.78 102.508 303.607 113.412]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 74.333 226.268 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aea40406b8f95d9ca4f61f23598448cd5) >>
->> endobj
-12212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.605 74.333 330.855 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12216 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12220 0 obj <<
-/D [12218 0 R /XYZ 89 770.89 null]
->> endobj
-12221 0 obj <<
-/D [12218 0 R /XYZ 90 704.223 null]
->> endobj
-12225 0 obj <<
-/D [12218 0 R /XYZ 90 486.179 null]
->> endobj
-12226 0 obj <<
-/D [12218 0 R /XYZ 90 458.004 null]
->> endobj
-12227 0 obj <<
-/D [12218 0 R /XYZ 90 431.555 null]
->> endobj
-12228 0 obj <<
-/D [12218 0 R /XYZ 90 401.654 null]
->> endobj
-12229 0 obj <<
-/D [12218 0 R /XYZ 90 373.48 null]
->> endobj
-12230 0 obj <<
-/D [12218 0 R /XYZ 90 345.305 null]
->> endobj
-12231 0 obj <<
-/D [12218 0 R /XYZ 90 317.13 null]
->> endobj
-12232 0 obj <<
-/D [12218 0 R /XYZ 90 288.956 null]
->> endobj
-12233 0 obj <<
-/D [12218 0 R /XYZ 90 260.781 null]
->> endobj
-12217 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F39 2320 0 R /F110 1507 0 R /F66 3179 0 R /F67 3037 0 R /F24 529 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12282 0 obj <<
-/Length 2035      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~���SV��`\���e�m:i��[�݇$á)��V$U^츿� HQEъ��E"	����Ab����g�]������/�p���
���
��;�&���/W?:Lx��V��o>~����ե
;����3C�!5���D�٧/ؙ��
���9�fR⸔��ҹ<����l��|�x��p5o��{�$R�q��b:�
O�[U_d��WQ���E��]��Y����-!�Ks�\�(Գ6w��S��a����

g�u�k�0t͒ϔ�UΧ�xr7��t<�c��Ƃ����/Td�2N�?C-N�ds�MNO��9�Kj�K��
�4�!ckY7P�	���1&�+����dX'ynkp������H�p�0��(�\g�rX!q N�c^/��� i�,-�Gc*��ݪH������2.,̋#�u�y
�GX���v� l��6.��M��h3@����EW����Ep�g�k\�aY��X��ݔ�ɓ�Ú��#�m��w}�ʧ.���j��&T�d�\O�pY��
-lD�kp�6(n����.6{v�A�*�,ߡ�/�x�ӛ`��i�r��?y���^�
;�UZ�O�D�x2@�\]j3��<�
-m���j����J��{Mȩ�!�/�ID�A�K<p�fN��{		Dבа���>�͜"��a`�a�P�
�|)�eRIJ
�Ӱ��݌O�o�҃�|'�K����#Ozm�7)~kז��aX�5
b�ra��iJ&�%�u>er��jY�{�c�y��+�5�Y��͢N����3��j��ׁV�����`���Ю����l�+�4%�珌��^�F��C�͇<[{��څ
-��^����A�UVyjCp8�`�Fa�E=P˳�	�*O�
_ֻ�
�o�P:����8TA�Pm��Nm����'�t6��v��p9Z����j�3D�I�
L���#z��I��L�z�8j��ֽ�FJ^7���?%��ٕ#�ٵCJ�׺6ܓ_%��_]	�����7�׆
�]�ɮ�.T�պ�����U1Q"Oլ}��۳&B���(q���.��0m�䰮Q�:;5��A�QDq
̫d�ę�y\��So��\�6���իH�}�1b�5�_�y�����]�2R�a���Ç.����0Sh�%�ϫN�kV��
-��ʼn<��*��"$��j�Վ=x��"�)5�ʟ���{= R�o�{��M��V�C
�

�B�t=�@oB�[f�uU
R�.���Xk*�_�eH�'�#�&c�d	�v�e�];�q�#C�ϰ�vgA&�:�'�j�
-�e�N-)�pj �8�����i�B˅�%�U�����Ѐ�:
n�>�Q���~�v��z3��DC�P�°@>=I�1c�"��C�0�2��
�|�0�
�o�n�����m�W�G6ULQE�*�E�|�+����Z��B
��3(����0�0\zt)��GɉJ��!(�?UP>�Ը��2+���k�4�~����3ڂ�pb� 2�U�����/�k��`U��8�Y���j]�{��������k��k�����,��|�f�0
���7�gP���{♫��8?e��Ž�6\=����b��`��
iu{y�z+&�ȉ:���|��{�*�
뇾Z	1o��|���c��M��y�
.���y�(p��)!d��j��oTD�Ҫ�r�1W3࿏V
-ϟ4�� ���Hk����3�
׭�T`=��R+�74-�*�3���dz�cT�b{:�M��~��x�x
y^�rw
�c^� �5��ϰ�����k���iè.�#�z���z*'����J��Cs�־�*� �a �
1c͟���9����0���+��Y;	��*�TЮ
L�'�W�<N*�J.����/,��O{
-��Ԝt�B���)�����A�T#���,t%��P��3L��f�{m�5�����9�ɀؚ�
����ٳ�|?J�
�d���t/.~�/~-T�/��X�߇iՔ�Z��
�p���m�s�[����e�'���
-�|
o�r���������EY�;�>²�g��~Ԕ�e
<LL뺣�� [��
-endstream
-endobj
-12281 0 obj <<
-/Type /Page
-/Contents 12282 0 R
-/Resources 12280 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12131 0 R
-/Annots [ 12213 0 R 12214 0 R 12215 0 R 12244 0 R 12245 0 R 12246 0 R 12247 0 R 12248 0 R 12249 0 R 12285 0 R 12250 0 R 12251 0 R 12252 0 R 12253 0 R 12254 0 R 12255 0 R 12256 0 R 12257 0 R 12258 0 R 12259 0 R 12260 0 R 12261 0 R 12262 0 R 12263 0 R 12264 0 R 12265 0 R 12266 0 R 12267 0 R 12268 0 R 12269 0 R 12270 0 R 12271 0 R 12272 0 R 12273 0 R 12274 0 R 12275 0 R 12276 0 R 12279 0 R ]
->> endobj
-12213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 693.613 229.446 704.517]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_afc1e5cbd96d9c2819ba1ec2151f3897e) >>
->> endobj
-12214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.261 693.613 316.06 704.517]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
->> endobj
-12215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 663.306 187.583 673.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a49625522da117289c0312c67060210f2) >>
->> endobj
-12244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 632.626 201.7 643.156]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) >>
->> endobj
-12245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.198 632.626 225.072 643.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a21e9dae374ecb009d8f7f268f5e673e7) >>
->> endobj
-12246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.311 601.572 248.293 612.476]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a97539a3abb32c8f6dee940d553cec62b) >>
->> endobj
-12247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.421 601.572 318.244 612.476]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-12248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.835 601.572 444.852 612.476]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.029 601.572 513.996 612.476]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 589.99 135.27 600.52]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 547.977 179.255 558.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-12251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.994 547.977 248.434 558.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a485bfce228009ebec2a7bd83d695eddd) >>
->> endobj
-12252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 517.296 179.255 528.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-12253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.994 517.296 260.629 528.2]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3601b97efe162fca1df11d70b0b3d607) >>
->> endobj
-12254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 486.616 192.664 497.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) >>
->> endobj
-12255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.48 486.616 242.497 497.52]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.783 486.616 326.8 497.52]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 456.309 150.493 466.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_ab5ff957e959947c6016cd28be6e2fadd) >>
->> endobj
-12258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 425.255 181.845 436.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_abd1a41cf267b29ebf81851eb096dc6de) >>
->> endobj
-12259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 394.574 181.845 405.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1ef2a882e1f0a3121f94eea90a9a16fe) >>
->> endobj
-12260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 363.894 154.727 374.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a8a238e31c3b4acf8a023a6346bbf752f) >>
->> endobj
-12261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 333.587 176.505 344.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabfec033a504656ea05620f485442b1e) >>
->> endobj
-12262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 317.2 450.955 327.105]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1ef2a882e1f0a3121f94eea90a9a16fe) >>
->> endobj
-12263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 291.574 191.718 302.478]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-12264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 291.574 288.852 302.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a25be5d5e126674d8aca8b9ec828e289f) >>
->> endobj
-12265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 260.893 191.718 271.797]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-12266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 260.893 303.079 271.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_ab151aa3732a4737e63c5142b42159dc3) >>
->> endobj
-12267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 230.213 169.013 241.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a797f9cf758c537ea0abaffe280cc9682) >>
->> endobj
-12268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 230.213 231.279 241.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 199.532 219.234 210.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) >>
->> endobj
-12270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.732 199.532 311.916 210.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1e73b39b2848f8141aa58219cf97dead) >>
->> endobj
-12271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.731 199.532 422.161 210.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983a) >>
->> endobj
-12272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 168.852 224.993 179.756]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a42acbf3b42263a3dc137395dc8fe1421) >>
->> endobj
-12273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.808 168.852 334.132 179.756]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) >>
->> endobj
-12274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 92.503 203.075 103.407]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 92.503 296.324 103.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
->> endobj
-12276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.488 76.49 334.373 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12279 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12283 0 obj <<
-/D [12281 0 R /XYZ 89 770.89 null]
->> endobj
-12284 0 obj <<
-/D [12281 0 R /XYZ 90 712.265 null]
->> endobj
-12286 0 obj <<
-/D [12281 0 R /XYZ 90 473.379 null]
->> endobj
-12287 0 obj <<
-/D [12281 0 R /XYZ 90 443.907 null]
->> endobj
-12288 0 obj <<
-/D [12281 0 R /XYZ 90 413.227 null]
->> endobj
-12289 0 obj <<
-/D [12281 0 R /XYZ 90 382.546 null]
->> endobj
-12290 0 obj <<
-/D [12281 0 R /XYZ 90 351.866 null]
->> endobj
-12291 0 obj <<
-/D [12281 0 R /XYZ 90 310.226 null]
->> endobj
-12292 0 obj <<
-/D [12281 0 R /XYZ 90 279.546 null]
->> endobj
-12293 0 obj <<
-/D [12281 0 R /XYZ 90 248.865 null]
->> endobj
-12294 0 obj <<
-/D [12281 0 R /XYZ 90 218.185 null]
->> endobj
-12295 0 obj <<
-/D [12281 0 R /XYZ 90 187.504 null]
->> endobj
-12296 0 obj <<
-/D [12281 0 R /XYZ 90 112.805 null]
->> endobj
-12297 0 obj <<
-/D [12281 0 R /XYZ 90 112.805 null]
->> endobj
-12280 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F68 3032 0 R /F119 3070 0 R /F67 3037 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12316 0 obj <<
-/Length 1931      
-/Filter /FlateDecode
->>
-stream
-x��XKs�8��W�CUY0�75s��cʳI֓xNɔ
� 	�B����~h�"eEI&�=���
Po�Q﷋_o/�^����<	�v���K���	�m��>�$�KF)�o�������"�~S>�Ŧ�w�����j�����[��o֥�� ����+�÷b+̲�
L� �~���_��_����t�@-�1T#&i����������=J�<��
Q�EA��{w���Q�z�?�>�5��1���V��P/���C]����q�z�LPL!q#�4�o�^�����n$���
ԍ]�D�G���	%���${,!Q����a`A<�z��!8�߬V��;����aɴ?��u�[�A/7��x�t���%8�`#�!a4�
F�/��sKI��V��*�ڟ�
���N�O
T�C/ՒH���3E��
�̆��C�6�
���1�����$Q � ��|<>�#"7�U��L��,ծ����������N
�2��{�*�XtJ
���$3v)I�1��e�?�d%#��\b�Ʈ��i
-)[��b:��#�\:�	3‚lR����,
p>��d�a�;��x_�}
/���L�� R�������́���W��w8Ѣ�&�Z�N��ɩ�tn��Eo���2�s�i�p��2��P����?
	���zVN���Z�v��f2j�L���NC��
X7�5�H
[cT+
-�����k�8z at +�Yn@��L
a�s���j�����)B�v,l8�l�Qh�Ĵoy!~��Ĉ�<�F�[���_�..�V��j�w�B�Z�r�D?���X|x){˒�W��%�.Yح�cFh*X�!����W��(���(���b��ǺY�_��g��;��=�s�����r�,0��pq8IZ�Ag�(��Q�a�/������G$�"ub�
M�y��՘%��ҧ��K��2�����yWegc j}|f�y8}e����C�	���
���lo 1+�_ޏ���9������hݹxW�W��zGD�`����Б֋jhۦ��g����ZoКɺ��C�K�;��)TO����3(�gF��?k�tT̎	���^�	��H�@"/�|���$��� 2�}c�Y�#��R�%�/���V{Q�k�i
- ;J"�>��t����Z����� ��x~�B"Tmy��l����f�KW)�BWd`��z�t'��
F)�/,:���� �U"�!�͌$�1��M���&4��=��+r��ς,q)d�K0�
6Tf<SQO�B9:�wD}� 
��T
��v��]��,q�f������
*�mk���˰����	�P��r^�]J� �^
�gB6��v7'�
EƲyN�y��Y��|`�uH[6���a�;����#�5�N �I
��8���2�{�6� ��F�jo�6�ډA٩�b�0Q�h*�ř�;�L��tO%%/��ltR���4�vM����qN+��$��T��x
-�
-��ݤ��g�;�
E�s-������PX�X�*`��ۚ�U��3�_�E��H�%�MPj5
�=�������+��N���
�
{� e#���
���d:��>au� �ǝ����Wz�R�K�k�,(��^��������ɓ��\�x�IfR�˓@�xm���%�p*���{��V�gM��ygws�|��{߳�`+Z�q0��z�Q�m���ƥ~��k,4�N�"g�t|�$�P 'Yj�i��[�|�8��X0}��HJuS
-v��������7���C��<K\n]��
`�lvC)�
�]&I��[�.�+e2}� QJ�<;R����T��i�%†��ô0Y�=\���� ��'\2��=7��~��O-qD�x|���}���Z;%�
~�͉
9����
[��=��&+s��{v~�)#I8O�3?AQ������͢�h'����{ހ������3
-endstream
-endobj
-12315 0 obj <<
-/Type /Page
-/Contents 12316 0 R
-/Resources 12314 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12131 0 R
-/Annots [ 12277 0 R 12278 0 R 12304 0 R 12305 0 R 12306 0 R 12307 0 R 12308 0 R 12309 0 R 12310 0 R 12311 0 R 12312 0 R 12313 0 R ]
->> endobj
-12277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 654.19 226.034 665.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_af9e8e2ee2a429df52a8755417e8c8df6) >>
->> endobj
-12278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 654.19 379.626 665.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 621.021 156.281 631.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a57dab2bd4d371c36b4ebf610a6c85759) >>
->> endobj
-12305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 621.021 218.547 631.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.759 621.021 295.209 631.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 587.852 156.281 598.756]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a57dab2bd4d371c36b4ebf610a6c85759) >>
->> endobj
-12308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 587.852 218.547 598.756]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.759 587.852 295.209 598.756]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.411 378.825 342.66 389.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.006 277.574 322.456 288.478]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.912 247.995 329.362 258.899]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
->> endobj
-12313 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12317 0 obj <<
-/D [12315 0 R /XYZ 89 770.89 null]
->> endobj
-12318 0 obj <<
-/D [12315 0 R /XYZ 90 703.099 null]
->> endobj
-12319 0 obj <<
-/D [12315 0 R /XYZ 90 568.345 null]
->> endobj
-12320 0 obj <<
-/D [12315 0 R /XYZ 90 204.578 null]
->> endobj
-12158 0 obj <<
-/D [12315 0 R /XYZ 90 181.014 null]
->> endobj
-12321 0 obj <<
-/D [12315 0 R /XYZ 90 181.014 null]
->> endobj
-12159 0 obj <<
-/D [12315 0 R /XYZ 107.713 93.561 null]
->> endobj
-12160 0 obj <<
-/D [12315 0 R /XYZ 90 77.486 null]
->> endobj
-12314 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F112 1773 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12329 0 obj <<
-/Length 2832      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�8~���ӌT�8���l��()�$�w��Jm&��%Z�D"
����q�Lɲ̩}"	�F���������'�''���$�
�ɭ'�'|�x Os�À�t�q�ǂ@/�����d�nr�ޝ�''�O��
18�7[�|���94��a�d�}��=�2�����`�
F��[u���,W3B!F�Q�Et8"�A��`�V
-mM	4�ԯ4�<��u4�R<�Vߗ�<��o��<ʿ������^�C��U�>;{���y^Mm�h
�q>��P�A����
�DN_m�Gv���`a�Ȋ"���x�eH��S���,77����˵2?9؏fJ�le�W:���5�EGIXR�$�F��1c�Ge���������-q$DKoW̨���/.޽�^O����d:~�z<}���|��fD0�YX��u�wqQGL��x��՝�$�$]�f��2�?�|X�MQ���1ˢ�>C�,Iˢz��<
i��'(�p%HrnF���Y��%A[*��Q�GB%I�����_<<}�c�j���
(���C=}�`��n_d���Β8-�E5v�4&���痗���

�y��d(@�!�o�M�}ک�Uk/^	�QH�7b��$o�4 ��(�ͬ�[������e�6��f��`d�-M#���
;
�����>.
��}�Z�}|H�
e͈���1
jQ��e2F����

��W�b
-����
a"\
iG��g����
x ��o!W��n��4Yw*�0����P�X���S &���g�9 �vw��`����b�9#���D�����_�h޶��D �O��.����
Ei
b`s	�x�����
-6m�q���`V���t}�IVs�"s)�Dqҗ$Zu;:�j�ЅZ:7[��

�3����A���&ɵKU�2s]Gߒu�#��K{����J#W��m�ݤ�� N_�mc
`F���C ��+2���\� 
�Aq�옛t
[�J��3Mj��[�UQ�O��%����V�3po���)˓E���[��:�h�ϕ.p�T�V��+�u�fE��(�<1�
j�Ef�ިÕ��y��m�� }2�?.��L��D�j�@�
�
�أ
,�%հU�m�
a�'A4�1�v�����O��
	� I*\5&
-~�
�GOu-�d�';Пq��E�����*��ބ@�ԇd�7��Y�����^.�Iѱ��1-��j7d��J�H�

U���I�4���:���(����u�A7L>{�ƙB+Zݵ�
4 ǯ��=�~���eGK<0�
%�����X��o�X/�lt �0� 	���:���� SsǢ
�^<X̺b	\ɶHկ%R�A,Y	�c�v?�1��|b��������l��r9��|�C��;�����s�:$�t{����b�
]b��2g��e�)2�j�nr�EZ*%�а��02�����fq<�P���/�|~W���툺;�NSM�Ӛ�
Vq�ΌP��:�|���ɚ�_�ݛFp�~��)2,x1&��rRϪ�U��UT�iC;�TQs����#H4�|���B>�H;$�?���WWr֑M�mgZLU.R=7�O��=q�t at Z����I*0��]�g�L�� �>PU�K\
��*�
EJ�D-D�O	��
Y1�#��o�ʎCѦ�g
��\4��G
��
^��Q"��e�@
I>F�*�!�BB^�N�:��}��=StΓR�bz
�
r޼��S��!� ����
A9ا��X>
�`>��
-�e]Z u��u�
f���l3�Ra���7IG�t��N�qQ�I����>`'�X2���8�_��	
�OH:U8;����N��T}��a4%�-t���/�u(#t��~p���䇮uN�f�ν����-�ꫝS
1�}YՈl������ۋ��O..�u�ȑ����R���snRՒ�4E	u��uS���2R����������8;A:�;�"�
��<�cꒊ
,�����>��V]�e
ݐ�[��(]tdDH4���&~^m�MC�����?��!

۴�@l{�>¼����s��5[G��54�]Cs�
����7Wg�q�TQ:����dP��4�kh;�H_�m`w
�r\�nDS�
-;�3��k�*I��,���l�ɫ�.|	�B�f^{��$d�[��~��R�ݰw������W<�%��^�O����<['�8�:�|LER�\�O%=�h(��лD�VSHz�G$3;kz�0x����,�9zL��r���ؚ��j��{��Q��5�SR]*;�x��"I���Y�/o
�x)
-ե^U;l�
((B����Fq[�� �6�L%)�[�Z��(����&h�n�����I�
������%j�J{#�@��0D�J
�'*�	<G���g��
~Fq:4{A��3݉
%ҧ}���.ѠMD�����'�FB�Wu�*��|wꞦP7��
-M�lq�	m���
-�sSF�
���W>?2�
�
�ԣ��W �O��-� 5�@��=�=(ȅ�n'!{�Oӣ�m=j�vf���0��{2k0�>�U-�dV���Y
�����k���x�F
�����%
s at P@��0S5)�#���M����q[�ĭb�������ݭ�� O�5z����� �cG �h+��
7ǜ="�h���H�~NhD�k�K�>��|�/���e��6�^���2a���5+H�����
�X)�uyu��������/�o�tSQAӐn���a�
���u\�o��T���9Xn��}�y]�[�������fQ��Ͳ���p�YU�
��_gy
T@�:��s@�/�a/d
-endstream
-endobj
-12328 0 obj <<
-/Type /Page
-/Contents 12329 0 R
-/Resources 12327 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12131 0 R
-/Annots [ 12324 0 R 12326 0 R ]
->> endobj
-12324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 371.037 432.413 384.985]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
->> endobj
-12326 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12330 0 obj <<
-/D [12328 0 R /XYZ 89 770.89 null]
->> endobj
-12331 0 obj <<
-/D [12328 0 R /XYZ 90 721.073 null]
->> endobj
-12161 0 obj <<
-/D [12328 0 R /XYZ 107.713 645.052 null]
->> endobj
-12162 0 obj <<
-/D [12328 0 R /XYZ 107.713 617.157 null]
->> endobj
-12163 0 obj <<
-/D [12328 0 R /XYZ 107.713 601.217 null]
->> endobj
-12332 0 obj <<
-/D [12328 0 R /XYZ 90 584.489 null]
->> endobj
-12234 0 obj <<
-/D [12328 0 R /XYZ 90 562.113 null]
->> endobj
-12333 0 obj <<
-/D [12328 0 R /XYZ 90 562.113 null]
->> endobj
-12334 0 obj <<
-/D [12328 0 R /XYZ 90 461.987 null]
->> endobj
-12335 0 obj <<
-/D [12328 0 R /XYZ 90 396.343 null]
->> endobj
-12235 0 obj <<
-/D [12328 0 R /XYZ 90 361.673 null]
->> endobj
-12336 0 obj <<
-/D [12328 0 R /XYZ 90 357.189 null]
->> endobj
-12337 0 obj <<
-/D [12328 0 R /XYZ 90 238.638 null]
->> endobj
-12327 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F112 1773 0 R /F117 2446 0 R /F75 554 0 R /F8 794 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12343 0 obj <<
-/Length 3124      
-/Filter /FlateDecode
->>
-stream
-x��\�sܶ����>�w39OT3N�d�X�b�3��
-Qҵ��Iʶ��w��#OwG����`�q�b���

��nFt�����G/��b�8����zӑ�1Q<]�ލ%��L�t|6at�d���l��x5�M������C�d�ǧ'ggل����<]L�\��7�$����:�?����rn�X1�����W�G��EG̱��6���ѻ_��
-^�0�D�f��6Z�$p���
�|D��W��⥜'�l�ibB�
i&�����՗�����eh���n
`�y��V��
<�OM��8
E�$@��.�f$Vj�,�+['��<��=����K"Y:������A�#�T at F�;�8yqu|<O�7��E�e�ƫ̭S�:p*aqŠ�i p��
���Ez�
#~�Ƅ�`���j�����)��gꩼ~�!/���l�ڬ�&N3l�t����^U��id7�|�|�6� ��u�E��"�K.�
,]�
謁�J���
-�WT���R"�i�Ab�� I�堊�4�"*C��O_(b�8���5��_q�;~zӦ�
�ږC>���*��Q$���ΖIǟ����"�&B�o�MŎ��lr��=L��[Ӫ�\u�
�
��_��%x�"Kf #����\ܦ�E�~�wn����k�ZA��e�Z�䋇I��_�K^��<r��s��:0�i�q��t4Ɓ5��mC��w�\���8x������?�e*__�//��:�`�]㰷��֞ݤe�OH(�f	��5J�c��cǖIT�U�d�#��W'������ѽ�Ӣl[�9N���t��IQ�.n�e�Y�#Ԛ�-v���|_��Cw�̟Fذ���q
_I/�%��2�-���
�lj�1���$����ٵhk�eݠx�K��1��ɲ��b�Uu�k
EdO��
�li�����G�(����VO�Il�Zl��z�(���Dp�'��]��ɀ ���h @O�X|\F1����*Z�W
�!�W�,�Cd��=�<��	�NI> 
����kŦ�0"c
34��I�!�э=qF�QZ!S{�#�������\jtը���#�
���G^t [...]
-�k�VG�[�7Y^��y at vo5��10�T �AipI�
� Y4��\ &��.`dn��
�`�}��������h��j�S����,�: �oIC� L I�))
��[V
��l��E$��8��1�p�qY����KY�j�W9Z-�R@�o�^{n���]$�Gj,��|G�w&,+|���$�v���wh��8��
_�e4�JR�[��~������e�I�����_0eI��b��H����^����
w�����F
4�CS���q
1�
�|Fڌ3�&
�x=i���K��;�g
-�����������vbIJjD��
ڌ�HD�6�cP��h?�{k��hŚ����Q�}�
le���ܽIl�Vnt�7�g�m���k[L�������%��Rb!�tŴ�W�
���|����$�v��"xh��D6
~1
����5L!
Ep6���� �=z܆��"�f�e3����1�P|�
�5eCb�`��
f������6A
r��	h:��pƆ<���s�A��clz�fr�U}sm��ff��q�
+խ6@�2>�*OӪ�0`��~��

}�3`�GJ9�q��K��k�9�8C �@�uy�A��
�9�0acT��D\
xg

j����%�
�Gtp��fS>o�[��r�m�z*�EGƝ;�k�.�Y

r�q�
��q&�)�	�i=뀯�����
-���g�	O
�ֳ�]�:��� ��aS��rA�i���d!I��i{�|��P�,ڄ�d}�����T)D��L�*3�
��
J���
�f�b:d��b?W,*5*�u�P���X=��L�q��Ƅ3V
�}) il��~�Ǫ��S���UB�
-&����B^�}ȋt�^F�J?RF�� o�r>�w)�z�G���xw]�_�֪7UFlg�W�
-�}�����OU��f���~��q鮶��y����_���*"���~P���uX�G�Γ�M? c�C�B�%kˮ�4�Q�6/���S.h3Z[��n��O��Uj�gw�]�GOUkgrD�z�b;��Mm/	�s48E��q<��Đ�v�@��v�Sl��F��g��o��~���� i�Nr_�M��W�
m�CD�a�8�D��G�ۏ�v��l��
��ӅX�<

X:��c�:M�Y}F=s�$��n�:xn�X �ѐ���Ct�R
Z��
Q%߫�ٓ�vh�|��K��
�o@��A<4E�a&	����MδMy�*n�d�
�>#���å؍;��9
�P���+pb�e��_k3
�U�~��4�~�20:���
�>N�
-�{�-p9ê�6�
��
/p�X�n��|;��Uqx�Nq�Q<���
}
-�
|Q$�`��K��`,pr��]�����M���Sh��g���~��S�D
(���j[�^=��g�mc���^�3�
�ؔʪ���m�s�Q�k�p3�tj�⦜YV$����65Hx�j�-�vT$Y
~%z��d�v����Nr�Շ�I�:)�
-�U9�4]|��bn��5� <}���v �v��5]� 1�\��7}*�4�6~{���g gg�����4��D�q�)�i����n��2B],n��6-S��c�ߣ��G�vV����_������orz��j��n�y@<���վ�b��v ^.��IU��QL�,E���#��2��m������'
1�v�ym��F`�
-endstream
-endobj
-12342 0 obj <<
-/Type /Page
-/Contents 12343 0 R
-/Resources 12341 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12354 0 R
-/Annots [ 12325 0 R 12338 0 R 12339 0 R 12340 0 R ]
->> endobj
-12325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 693.377 432.413 707.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
->> endobj
-12338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 420.215 432.413 434.162]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
->> endobj
-12339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 159.406 432.413 173.354]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
->> endobj
-12340 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12344 0 obj <<
-/D [12342 0 R /XYZ 89 770.89 null]
->> endobj
-12345 0 obj <<
-/D [12342 0 R /XYZ 90 718.682 null]
->> endobj
-12236 0 obj <<
-/D [12342 0 R /XYZ 90 647.748 null]
->> endobj
-12346 0 obj <<
-/D [12342 0 R /XYZ 90 643.265 null]
->> endobj
-12347 0 obj <<
-/D [12342 0 R /XYZ 90 548.623 null]
->> endobj
-12348 0 obj <<
-/D [12342 0 R /XYZ 90 445.52 null]
->> endobj
-12237 0 obj <<
-/D [12342 0 R /XYZ 90 374.586 null]
->> endobj
-12349 0 obj <<
-/D [12342 0 R /XYZ 90 370.103 null]
->> endobj
-12350 0 obj <<
-/D [12342 0 R /XYZ 90 275.461 null]
->> endobj
-12351 0 obj <<
-/D [12342 0 R /XYZ 90 184.711 null]
->> endobj
-12352 0 obj <<
-/D [12342 0 R /XYZ 90 103.211 null]
->> endobj
-12238 0 obj <<
-/D [12342 0 R /XYZ 90 77.486 null]
->> endobj
-12353 0 obj <<
-/D [12342 0 R /XYZ 90 77.486 null]
->> endobj
-12341 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12359 0 obj <<
-/Length 2569      
-/Filter /FlateDecode
->>
-stream
-xڽ[Kw���Wh�H
�xtWm:�I��n�t3��CK
����!i;��� �E��
/H����. cD�h1����ln���Ǜ�E(�T�
��"<R<BB¯���i>���ӈI�H$�+���������v�����
�&<"N�@J�f��_�h��,ңw��z�)��j�p���!��@���D��L0�qD&S�1
�M(g�|2�T��ͯ8_ǻ��2=�V��!xE:j �B"�h�ẟ0:�VB��e2�P��*J�\z~N��8�L�x{w��� (
-�y J ��
A>!b�=O�x����f��*1������L#B�
1���DG�t�1���f�n�/����� �(�T*�P�V��_�")
���.h�f���1f(8���˴��qܾ�A
?'�|{�W�n*�U[��*�oi���({�g�0lȺ�TDHk1��$8���X
)^�Yu;O�ɦH���	h�57C�@�
�]�
-Ѷ�x���0 7	���
bJETR*jo��ު�1o�����W�VU�8+�H�
�
1�Cp��*"C  _U������
��08��" 
�C�3�]����Z�_e���k�]�
sB1Ǫ1�Fq�b
#
��
-$|���9���`�D#�8$�)��H��=�ۗ�}F��|'#��vo��G�Ƣ
�.����c]�r���|^
iH�ҞrO
̺��
�����ѳ
-�fz\7�V�bw����*�nz�{Zߌ�%�2�;(�7 ��+3���]�1@�uR&��f�/�
$�m�k4m}J'4G��R:�:�n@�
-j���> �*#��:W�z@� 
-��ӎ��("���E�Y1�ET�(
�y3��)�:l�5��st� �+��ke�
i=K
��@�#�!c
-���*g���,y)�����Nq'`�a�U�>cL��tN�%��
6���I%p%}�泎D�� ?�<�d����a�44���AS�U4���ݭ�͢\>%y>�@m���N!�k �� ���2�T:�+�����3�LL�al�o
^�n	
�
r8AҶ�oS�$���	4�O��W���,~-�7]փg^���X��
-xS2wŎ���3�?*g3�/���դG�j��a���<Y�O�C~�Q�@�=��%��W��~O��`��p��]
y
�3Je'!eo͈	^O�y�5#��V��9qO�eVT//�	�d�j���2)J�4�̝Ys+���y�x�,m3O+���ɔci_[���Bϝ9V]L7i	5�j���f�)�8�$��c<\�ݲX
-����Izma,��D$;�.&Q �.&*��V
(DB  V���3
-c.��0�1����p�6=�s��AtrjӋ�3ݔ��
~�(W`�B(W��7O����H!
f�9ƈ���Kq�����Bv3.>X0+g��	�?��q��Z����
��%DfՔ���5 ��7���a��z��sW
|]k$��h]q���['(� �ۥ��E=X�d�/���_+��8]��{��R�+�{��V4y��E=�
3 `�Q��!}z��5]�rߚ��
�|��V�)$��rdfA��LI�TP^��0��X��K�
Bf��xQL;��K�W��	
����f�<���˺��yY����[e at N�U���:��4�X�
r8�d�q�� oC��%q t���f��yR�dfQ��6>i�q���p�����6��3;^Ծf�
49�Z��
-��$�2�R�U2���2jܞ�L�_��k����������� B���A8}C7�jC��3�0a,Å	�>���*�[�\Ƚ

&�Mp���~��p��I�l at F��ɤ�) Ej`���w�e/f�e�/��z=ى�J�
���";�Ӄ��'��fYEgXp:C%�M�q�dZBC9D5�2���+(


Fi���4��^Fj�~zK�1�ҩ��ѫƥ&@=��*��S�����t^,a��tVV�7�dHZn�b��"J��ۦ����YIW���֭�����E:�f�'qYW+�2��N�?D�f�>Y����7o����;?H�\�
(��<J�L�N���%N��"�P+�)q-q��(=`�'�B@��	T{N#N�� �8Q
�A8�8I�%N��8Z�P8è������B��]���-�d蜇v�yGT���u�)�)J�e��T���4�K�,*�DB�܂� �b
�v`fC�
�2��c���(�0zE r)͂F��i͈	��W
�W�+{��`�*`?kz���e��맷f��kF�T[pܫXlC�	#;v̿b�Y��%�-�
 8�.�QR�.��C�L��]-R�h���ހpަ��-i�m������R�\�@��)��L�u��	 ���e�U2�N�y�%���N�o�·ܝ
���
L�����νm���
���f��e �7y�V`횐��5�0Ѽs`�9'v�����H��&��츄o�����yk��C
�C�T����o��<F� j*�\��������H6
4�ֻY���T\��_�#�����ؤ���w����IqO
-endstream
-endobj
-12358 0 obj <<
-/Type /Page
-/Contents 12359 0 R
-/Resources 12357 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12354 0 R
-/Annots [ 12355 0 R 12356 0 R ]
->> endobj
-12355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 505.215 379.76 517.549]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
->> endobj
-12356 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12360 0 obj <<
-/D [12358 0 R /XYZ 89 770.89 null]
->> endobj
-12239 0 obj <<
-/D [12358 0 R /XYZ 227.842 671.378 null]
->> endobj
-12361 0 obj <<
-/D [12358 0 R /XYZ 90 664.738 null]
->> endobj
-12362 0 obj <<
-/D [12358 0 R /XYZ 90 596.164 null]
->> endobj
-12363 0 obj <<
-/D [12358 0 R /XYZ 90 542.475 null]
->> endobj
-12240 0 obj <<
-/D [12358 0 R /XYZ 184.963 466.27 null]
->> endobj
-12364 0 obj <<
-/D [12358 0 R /XYZ 90 459.63 null]
->> endobj
-12365 0 obj <<
-/D [12358 0 R /XYZ 90 388.924 null]
->> endobj
-12241 0 obj <<
-/D [12358 0 R /XYZ 90 342.299 null]
->> endobj
-12366 0 obj <<
-/D [12358 0 R /XYZ 90 337.816 null]
->> endobj
-12367 0 obj <<
-/D [12358 0 R /XYZ 90 276.908 null]
->> endobj
-12242 0 obj <<
-/D [12358 0 R /XYZ 90 230.283 null]
->> endobj
-12368 0 obj <<
-/D [12358 0 R /XYZ 90 225.8 null]
->> endobj
-12369 0 obj <<
-/D [12358 0 R /XYZ 90 152.937 null]
->> endobj
-12243 0 obj <<
-/D [12358 0 R /XYZ 90 81.969 null]
->> endobj
-12370 0 obj <<
-/D [12358 0 R /XYZ 90 77.486 null]
->> endobj
-12357 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12374 0 obj <<
-/Length 2606      
-/Filter /FlateDecode
->>
-stream
-xڵZKs�6��W�HU#�o���T�IśqNٔ�� ��tH�3�_�
��zsN�H��u�_7���v��`w	��|���N��AFR9zX�

)n���m>�}L0�b2%�����qR����	��|���΋���H�/ww?�p�x_L�
�OK��L����ˤ,��va��6�YJ��c��䏇o><��uC 
C �G������
n��ѣO�K��
>���7����~�^ #֋DHK-đ
��M(��
pb��7��.0�4„��6��Qd�� ܅D4A����Q0섐�7�.J��C ��!)I��o�d��~C{ (��1� P
�б	�C8�D�����J[�b`T :
F5�ZE���Y��ٞ�%�1?�
-��^�3X7ϼ�
<�rbƳ<+k3t��+a�2��>��(+K'��U���,=�������7	Q�W5"�4��,=҈Dʨ�
�Lj�59��;�
⦔"����G[��P�X�?��!�nǽ�{�6��8�@2lc4���H�n���q
-H��>|��W���%��D~'���$gH��%�:;�m����e"�'�AL�x	Ɛ�T��+���%��O8�X�
-ZB|4�h�)�
�0�7~o�j~w�f)>Y��GHmL���+����w;(�Hc6���M��;�2�!��E#��̀��Ez>��
�O.88
�
��C
-.��d.�)(_�8����/�@��p
A!b
᝴
+UE:��_����&��&�N�KA�			��9�Ky,�`�	�
�\���;�KZ�)To@����`1yE�X��K<?	\#�(�Z!�LL�T�VO9������ZԒ���*�x
�$^E��|�r$��DN!V��A(���ؠC�|type�����j:�P&UZB������y�!Գ��ކ��%��"6�����
|��X�L�/�\�Ð&�B.H!�Q
��ŽZ@�%A�_m�.��n���s��?a��T���a��
6 �RvI�y0P�
�j
m��s���hux鮽��I��t氁TfP�U�=tم�1�ԛN����J�u��O
�
HBT�h6�
-,�*��vi�ќ$|Nog$�A�欃�x
-b\��g#-t���._�]��_%J� _�����:^yNl�
GOl�#s�
n
�&d�����KC�3\C+�f�t�=�g�V�A��f�����������m����=J�ʮ^�f����&e
-y7���i��pL���u6�M�(�g��<����S�1EX���d��Nf?F!(�S����+����ь!jn4c��!�F!\�:�HLl�N[g��GO�k �}E��C b�P��1�C�-j23��Z�-Z�tk
��5R�ָ��f���l�TI�%
l&̦d�f�
�)�鏬ۊ77���å��@�HR������ J!�`�Q!���iV���x�R�>�}n�,��Њwm 7��
��T������}�3��fg-oN_~n�|�#Ve�FӱS��Na�i�jM�z�uhﶺe�U�����{=r����$cj����2�8����3A_

�{�s>�C7�lѓ����5	a��
*�����U����
V,,��3ęlM3t��T�qa����7]�u��O(i�~)�pW�[�3��L��
g/(V�d!�پ5!����A���3ŭ��OE�V_ҙ��i���NV�
w�
�}��>�2e�B#�I�N�
.��Ա���
2aߵ��c�6�p>�w< �T�}��߬D��_�8�.�CU�?4��#
-������^.�J�K��wb�Ώ���˕��VN"�b at G
\�wT`�n�tP��PG=
-�$N&������^����H~�w��V]�\%i����˚qQ�|�����=��.�}���HyX�8�D!q�<�
$ ��L���w��Q�I���\�5�4��.x���
D2��t��%�xz��S�]4����:ꎝ�<��
-2�$ڍ�؀�-�W��R
�����sԳ9��(z�yn�g�<�Q�&�܍��瞐��]���P2�ӌ�k8�F�lVN
-�5ٜ�N�l��^A�Ӳ~���V[�Ҵ`���F����J�Vp�?-���,�q�<��EeO<����F��(4�\%���0�6�]��hwߜL��>��9d�� ⛣�̔���%1�j<
-�� aE*�2#�
a������"'��@zbf �)Ĕ�ؠ3"^�E}��|w�p��C��H��1�������/5�5�?���
��t���w��@<��8x�3�w��mC:-��Ci���ݍ
N��[J�φY�#��	��+�%G[�mnd
'G�#��!��-7��+�(
mQL���i�h@�N��P���q��z�_���s¦���K�H-��>{�ԕ]�u�+D���/c)�N��}��څ�+$������'�[i�o'B����d�$t�.U�)`Qn�a�
9�?Z��稹���o�
-:(ĆݽT����������3�5ӂvh�
��
�MS�ʋ�P���U}Ď��q L Nic	0�_���(E�7��������+6�W�����G8^
-endstream
-endobj
-12373 0 obj <<
-/Type /Page
-/Contents 12374 0 R
-/Resources 12372 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12354 0 R
-/Annots [ 12371 0 R ]
->> endobj
-12371 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12375 0 obj <<
-/D [12373 0 R /XYZ 89 770.89 null]
->> endobj
-12376 0 obj <<
-/D [12373 0 R /XYZ 90 655.872 null]
->> endobj
-12298 0 obj <<
-/D [12373 0 R /XYZ 90 609.246 null]
->> endobj
-12377 0 obj <<
-/D [12373 0 R /XYZ 90 604.763 null]
->> endobj
-12299 0 obj <<
-/D [12373 0 R /XYZ 90 508.961 null]
->> endobj
-12378 0 obj <<
-/D [12373 0 R /XYZ 90 504.478 null]
->> endobj
-12300 0 obj <<
-/D [12373 0 R /XYZ 90 398.878 null]
->> endobj
-12379 0 obj <<
-/D [12373 0 R /XYZ 90 394.395 null]
->> endobj
-12380 0 obj <<
-/D [12373 0 R /XYZ 90 314.488 null]
->> endobj
-12381 0 obj <<
-/D [12373 0 R /XYZ 90 224.137 null]
->> endobj
-12301 0 obj <<
-/D [12373 0 R /XYZ 90 177.512 null]
->> endobj
-12382 0 obj <<
-/D [12373 0 R /XYZ 90 173.029 null]
->> endobj
-12383 0 obj <<
-/D [12373 0 R /XYZ 90 112.121 null]
->> endobj
-12302 0 obj <<
-/D [12373 0 R /XYZ 90 77.486 null]
->> endobj
-12372 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F24 529 0 R /F119 3070 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-12389 0 obj <<
-/Length 2189      
-/Filter /FlateDecode
->>
-stream
-x��Z[o��~ׯ P�T���wiz����S�<9�AK�E�"�����3�]^E�n�}���rv���Pػ�������B1/@���[n� {�HHxZ{�s���~��ǤF$��V���,����2���,gf~�
�R�[�f�ﱷ��<�X���j����5�f��a�
FT�[sq��>g� B,#)�gA0��U���g ��H����4��2����	�#*y��?��R=��)���.<�r�8�[
��(�A#�p�3��z^��γ�'d�i��14CX�I8�aA{
���a�/������o/�`��)S�ϘBL}
�>���W�$ڝ�g�2�����1'�H�&�'RD�8�gqZZ�x����ص��o>��]�
F-Q؎V��oQy��h<S{��
�P�
���g)�&D�p�{��]�@dR�)�qa��X�
����
o��1�<�EY�����
(tA !P�Ax�c̞��a����>�Ǯ�
`��IEOf�*�鑬Ӓ��4!��d^b��bk�UW2�h^�P��	�1,
�<�6
"�ۻ鑀M$�-���6E�>?_g�0No�<�9Dan��(�Hc6�| ˜49�HuB��_� с|�m��T��M�)b��8�8EJ�)"
4
!�6��������*��2߆>��&�"�Re岂M}�z�L�*9�Q��ۍ�^n��&kW+�<��$Z󅂬-	&A�p�>vy��f�t
�]:����7EX�h��@�v
-�8�N�xxE�zҐ	�'���>@/ԡ��fd�Q:��@рghE��%u�h�pP*{�=tP�ͧ� J' �O�pt`\N{b��1�����"��0�����@�
"��8Ʒ ,"`�E��8J�1��V�Ÿ�BTg
��A�#�	��]��(8>�a����i����#N�Ad��:J��=���9��
�53�����8M�4z��K
�l���o^Ee1B��5�M+�
�F+��v��z��DZ��OP*2���mX��܋�t�)Jy�f)p8�p���
R!AOb �a��;��ԆԀ@�tL�2ę�%[�L�ɒ����<m?�B�[\��S�U�Z^J�)adr�* j8��~�`X"F��
�/ �������Հu �_�=���/`��N�xxE��iC�%4��
J�"�
X�C�9��uak������%a���C�r9���VPj�Ҧ��1,-����cQ=��<+�<
-w���e��XJH'a0��n�z�_�������#���B��7�U�N�L�j�@*���ذ�r�ES�!n
��PP��+�#˧p�.ޏ���'=C$Q�
u�[c��NLh�1��ׯ�r(�b�&ļ��u�AX�
#=�0=�}��L��
@ʤ�O�c���	�<�=��O#4��Z~S	�Bо���M��������a�������r;F���=*�gC�����M�:����Q�����WV�1��j��J���Z�tw�[P

6y�4�,I,�8�
�H��
Ӧ[���@ɀ�9�;JE��B���	�n�H�Sۅ8�*  �
I玧�D�G��1 �N6
	��&
>

�4W����DX�SL�� ���
�2�'�E�Q
�|u��f�%t�=n.�
�
�2�@�Ls44ќ�1[�v�28[K3���h
 =����}
�S9�#���� x�XZ��u.��n�W#�>n���D�0RC�M˨�"7n;���lʧ�
͝��Y�&�i@�
r
�Ƃ�4��98�>2
�r�zDKČjL�scp�W`�+ZX��"�DS�Y�A�m�_=b�v���K� I%\�ۛBP�_ͣ<JW�c9
�k,�;y=^هAb�֚X��.�o��;�����I]*�"NW�a
��
�!��_�Ђ~��Y[t@�Z��j�z�:�D��[P@
.H u2�r�����B�������7�Yb���M�G	��V�M���a���V�<S1_��䤍��*?�J&��ݏ��@Ş��΋\U�^� �C�F���Տ�;n���y�e@�%� z��`=����ުo+��AT���Z./�7�+��K��8@�s�
�/�OڹJ^4�K6�
-�
8�*�C���{������:��L,:�o�r~vv{�+����,�k���D
����r'P�n��P�M�x��q^
-endstream
-endobj
-12388 0 obj <<
-/Type /Page
-/Contents 12389 0 R
-/Resources 12387 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12354 0 R
-/Annots [ 12386 0 R ]
->> endobj
-12386 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12390 0 obj <<
-/D [12388 0 R /XYZ 89 770.89 null]
->> endobj
-12391 0 obj <<
-/D [12388 0 R /XYZ 90 721.073 null]
->> endobj
-12392 0 obj <<
-/D [12388 0 R /XYZ 90 667.827 null]
->> endobj
-12303 0 obj <<
-/D [12388 0 R /XYZ 90 621.202 null]
->> endobj
-12393 0 obj <<
-/D [12388 0 R /XYZ 90 616.718 null]
->> endobj
-12394 0 obj <<
-/D [12388 0 R /XYZ 90 542.577 null]
->> endobj
-12395 0 obj <<
-/D [12388 0 R /XYZ 90 446.337 null]
->> endobj
-12322 0 obj <<
-/D [12388 0 R /XYZ 90 412.803 null]
->> endobj
-12396 0 obj <<
-/D [12388 0 R /XYZ 90 412.803 null]
->> endobj
-12323 0 obj <<
-/D [12388 0 R /XYZ 90 371.098 null]
->> endobj
-12397 0 obj <<
-/D [12388 0 R /XYZ 90 366.615 null]
->> endobj
-12398 0 obj <<
-/D [12388 0 R /XYZ 90 322.4 null]
->> endobj
-1236 0 obj <<
-/D [12388 0 R /XYZ 90 209.097 null]
->> endobj
-398 0 obj <<
-/D [12388 0 R /XYZ 90 177.493 null]
->> endobj
-12387 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R /F117 2446 0 R /F119 3070 0 R /F11 613 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12431 0 obj <<
-/Length 1295      
-/Filter /FlateDecode
->>
-stream
-x��X�n�F}�W��!�r<
g���$�5V��@�$J&�E!);���wҔ*N�y�y���r��Ѱ�~�z6:�H�9�Th���`M
-�8%�l�]�#!
�`���A��&�;��q�p�w~�/7y�/wA�o�f~
�'A
�hS��Q6�m��ֽ4	��������}�8���r�/
���f%c�
�
��t�!ʼD�x�;�g�����aR���Ġ\�!�l�6a
�ڕ�_lC:�U	�	�4-T�
��^�
��+�|��^j��O�s*tfK�t�n6�:"�k$O�ő��e8����|��a�
[�υB͢
�@��>���	ܫ
$��Ńظ� �?R ��^�
I�.�8���?B�U��JD��q�!�T�_G���y��ZX~8����!�&z�WS5��W��-�1�����[aY&j�[R�B��
մl��t0�^J�@�5X�8��Jyg�vmr`PJW޺���M6��@�F�#X�
���p��R������@!�Y]Ɋ<w�
9qN�
�
	��T�U]ڞ���R��t�G��Զ{�x��r��~5
�w���P,D��&�6+�|�n��u����yc
�� v���0�X����U�l����h�`Z��^�;Z
d���İ��po‹�5[��޲��`jQ���;6�S��"ۢϊ
�'GǧW�4K�e6����;�(��8�4��y
B4�{�_�D@�]��<D��!�O�r���=b�l5
��v �����Q�F���H~�@�n�Mq�8�T�,�=o.Q��!���Csi���
-�
śCK��#C��xܵ_,�O0I� (��=1$�h
� �}�O{��bc�_�a�i�{���A��"�����.���Ov�RusN
��8_�q�?z�`�G�H��^��y�9^�[�a
'\r�g*˩�����~���
��;
֕�È8��-��`��pk�p2�/�:�=�{����cɳbt�a��y�H��S�m�b���t��]�q\
Nf8O��V�v(�
-a�������`�$���]߾�
,��]{g9����ɸ���G�ս�MK+vK�rDxm�cVy�[R�~�e�~:p߄���[��~v;��H���p�jKhO��&4�q��a��#�Q4KvK u�7Z��^�����	Iʎ�W
���k�D
�s�fU�Ӌb�9���z������� �%
�	�
-�0P�ʫ����?�>�o*E��tn�)P��o�l;>?_�6�m�2��
R�.I}Ȇj/��rs�U=�*�
j#�2Q��1�����f������� �:0�
-endstream
-endobj
-12430 0 obj <<
-/Type /Page
-/Contents 12431 0 R
-/Resources 12429 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12354 0 R
-/Group 12385 0 R
-/Annots [ 12399 0 R 12400 0 R 12401 0 R 12402 0 R 12403 0 R 12404 0 R 12405 0 R 12406 0 R 12407 0 R 12408 0 R 12409 0 R 12410 0 R 12411 0 R 12412 0 R 12413 0 R 12414 0 R 12415 0 R 12416 0 R 12417 0 R 12418 0 R 12419 0 R 12420 0 R 12421 0 R 12422 0 R 12423 0 R 12424 0 R 12428 0 R ]
->> endobj
-12384 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 12439 0 R
-/BBox [0 0 444 144]
-/Group 12385 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 12440 0 R>>
->>
-/Length 566
-/Filter /FlateDecode
->>
-stream
-x��VMo�0
��W��%%Y��C�b��
�ء�!�G�"
�?J�
ņ�t;�CJ���H�(?A[d��F��~��?�x�%|��ǟ���o � �#��#��{`(@��'̀'4*O�N�
J��u&�¹�C)}�4e�l���0��e*O#�'�i��lm�u6MM�
���
jH8
G�{GD�[��c��{��5����z��[�8b�|ߨ.΄
�-!���
�]����	�';ʄ��ؔ�[�
���Q�P��0gL7
ª�tu(��u�LaV��oMՈ\e˶gNX��4/av�
W{1�(�e��

2!���.k�os��\p5�)�^�	mW*�iK���؏	-���
|�ל�z�T�.��������dz�J**��S�:g���W$R�L��8�|;�]&��x���
N$��r�K"/1�h�x����xi��2����[d
]M��_�
-�ޓ��]hPR�ZW��
z�uA-R{EO�.�����t����3bئkTQ�ȡS�*U���āҮ�T��7��
~y-����Xn|��xӋ��P�OӚ�����,x�� �i
-endstream
-endobj
-12439 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-12440 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /ANKDRR+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 12441 0 R]
-/ToUnicode 12442 0 R
->>
-endobj
-12441 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /ANKDRR+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 12443 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 833 556 278 556 500 556 611 556 667 500 500 584 278 278 500 611 278 584]]
->>
-endobj
-12442 0 obj
-<<
-/Length 12444 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š��t@�2ݸ�N� �
�B�!:
߾1�B�ϓs��I��skƕ��nVZ�0�h�oN��:��
�G�F
-_5u6I}�e[V�Z3�I]�����m���
�X��4��\���|������Ȭ,K��i|��ξv�4$[���
}�߉���9FR���v�\g��ԙV�i2�_<ϑ��s�8�dz�̚@"P�Ay )@bT"o U�E� zD���#���
T�T�"Vш�*��
��.ϐ�99�$:p�It���<�� �U�_Q������
�'���'cM��0���;�
-�q���~%���"�S��x����[z�*us�/TX�I�����ng�g���v�{
-endstream
-endobj
-12443 0 obj
-<<
-/Type /FontDescriptor
-/FontName /ANKDRR+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 12445 0 R
->>
-endobj
-12444 0 obj
-366
-endobj
-12445 0 obj
-<<
-/Length 12446 0 R
-/Filter /FlateDecode
-/Length1 2712
->>
-stream
-x�UV{l�������11~5q�N��$��1���	$N
�p�<�C�<*�B!��V��
-m�JL[+mӴne҄:6MB��?�[�����V�`[[��~��,ѹ�;����{�e��b
����d|�vݻ�X�I�
z����5�&|�Zvb4>�o�_�1�����4?�z�
�K����V?�ʼn��8c篃���d|v���c�����fc|�/0|`��n(��=\'o���|a�lo�\�� ��V1F&m%��ۢ�ܵ
W%񱙾�T=q@��
6]᪁�_��{`6 k��K-r+��
-�a�X+�-f�Ir��Z��U&��>�WO[��r:�YFw�VҫL����HuN��R^���:r��O��ltmݴ�Ni�)m����w[[�+������v��� eV�Z�-,��ʫk�ߵ����u��*š1���
-�z2#(�\O��J�h4�Q�T�g����\7�ERaO
��{�"#-�ح8��GK�#�W���vF��Ҏ��umօ�J����ј�~R~y�+�[�0oL
G^��l��ƥ�̻�L��$�H2��23Da�$�˯�:�&
����(f������TK8�Ҽ���ξx��Y�>ۑ��L��'�.b"3��3#�>)/~3�\�9ױ|0�
-6ʼB�6RIF:ٻX[S`3��[��=�s���+�ZkQ���K�D_B��C\$�2V�jSEC()
nj��q_M<,��Քu4���X�Q3�XM���R��
-|������j��E���I�'[ed�3��l���ɶ��|�\ݺ��֎��������W���=�i<
��
�������U�{=�o5���CT�9:k�=wh���@4��
��7V�~j��NZ)ߟ�럚�M!�0���W#���톟RBނ
���Y#���|��>���Z$��X��u�����y�ӳQq�䈜����G9��<9��=���	��" ���g�
���>��45�'6��)��	r��v��O�]L(�
B���1fw�D�l$a��C�
���c=|x�-�s�B�
�=~`yz�bOH�<�A��������f�?i�T��tF~yæx�*�~}j�����lx��K�/�"y%���h+XYV�ѳ}{����EFuKVe9���J/���@?��8^
[&������|ʿ쌽qr�\H���^�� �Ϡ�	0����TE��Z�П��
�@G�y�
͞���
�ח�~ߖ���}�O��=r��PZ�8��>��
b����ܹ��05�P=���_�O�(�
��E�M�MN�rP]��!�O��{|�k�+��b��E�*b��c���Ȋ���+	@�h��Z����P}Ǫ����ɬ]��h�3ho
-���A빹�?�k�ۂ���E�z�6wݜ�
&�cC�t���Q��'r)�?�%�l�}#�����mײ��
P;�'��,�iTIV�D%���85������p��]�JyD�/�=��b+A����h=!F4�+��5�������krU�Z'=D=��R�z)
j90|M{a����ؑk�4շvG;��%EN��،T�2
Su�?�B�2-�yK�+�\
̟�����q��;���{�<�Wb���\�'��~�)q����R����nzGȠ��N�g)�uo7���]^�_X:�_��Lw*�>`	��'�MN��5��cc΂���	�<�fn�kK�Kf�����&[�%����q�JT�lb��
����aT����T
-#K��e�HhYH�
J\b��N
��Q��Ȣ��
]5�]�J7!2
��
�B&걘�fk`���Z�'���[�+�
�<�WB��k��<��\���.�͖����J��z5�}���f�����?�-��o�>^��QkV�Y
�J�_�>g��L��+��Xo�\K6	� ����+k��E~��b.��^�@��UC��F��Bƌ�n��3����L�x	�y�{"�"P?臈J
·
-o?�E����ƽ�F�S�]��.
�r�K� )�מ}�Ge
(�!���3 �e�M�%���j= 4���d@�f���G>0
-endstream
-endobj
-12446 0 obj
-2017
-endobj
-12385 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-12399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 503.407 224.395 514.311]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 480.473 189.925 490.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-12401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 480.473 260.898 490.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a89dba3caf804c7ca6db844c67de99371) >>
->> endobj
-12402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 464.985 422.545 474.89]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 439.864 224.395 450.768]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 416.93 232.982 426.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-12405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 416.93 347.013 426.858]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a12e89691311b8923ae33e930a7c89f4b) >>
->> endobj
-12406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 401.443 389.11 411.348]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 376.322 224.395 387.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 353.388 254.671 363.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-12409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 353.388 390.391 363.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) >>
->> endobj
-12410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 337.9 465.458 347.806]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 312.78 224.395 323.684]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 288.869 181.207 299.773]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-12413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.706 288.869 243.464 299.773]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_aefe92c8417c543823a7ac000dc6d4595) >>
->> endobj
-12414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.518 274.358 420.593 284.263]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 249.237 224.395 260.141]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 225.327 159.628 236.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-12417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.127 225.327 200.306 236.231]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a598c3862b9f9e720061d5d3e87995840) >>
->> endobj
-12418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.102 210.816 400.176 220.721]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 156.214 169.81 166.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ae0f8501bc09bd6e6247c5d92476a03a1) >>
->> endobj
-12420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 156.214 309.485 166.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-12421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 156.214 514.653 166.744]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-12422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 144.259 227.553 154.789]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-12423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 116.208 169.013 127.112]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a47c90b8856ed5b99f2155e603b6a80c4) >>
->> endobj
-12424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 116.208 345.31 127.112]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12428 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12432 0 obj <<
-/D [12430 0 R /XYZ 89 770.89 null]
->> endobj
-12433 0 obj <<
-/D [12430 0 R /XYZ 90 532.249 null]
->> endobj
-12434 0 obj <<
-/D [12430 0 R /XYZ 90 532.249 null]
->> endobj
-8339 0 obj <<
-/D [12430 0 R /XYZ 90 468.97 null]
->> endobj
-8342 0 obj <<
-/D [12430 0 R /XYZ 90 405.428 null]
->> endobj
-12435 0 obj <<
-/D [12430 0 R /XYZ 90 341.885 null]
->> endobj
-12436 0 obj <<
-/D [12430 0 R /XYZ 90 278.343 null]
->> endobj
-12437 0 obj <<
-/D [12430 0 R /XYZ 90 174.725 null]
->> endobj
-12438 0 obj <<
-/D [12430 0 R /XYZ 90 133.359 null]
->> endobj
-12429 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F67 3037 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im17 12384 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12457 0 obj <<
-/Length 2460      
-/Filter /FlateDecode
->>
-stream
-x��Zm�����_��@J��z�_�m���Nc�_�vp�I��TH����,wIqIJG_�(�I+r�;���3/$�n"
};�����b�AFR]��
�7HH�����L�����ELjD������۫��._�{�痳�gnሸR:Zngo~��
-.aČ���IۈS������3�e�]�$��D�B�P� B� o)������ō�ogћ��8~y��ֻ�z�T�<�:��0�n�.�uV]=��+Ҳ�;�j�,�4~��ׇ��Ӗzz2�C
CB78��N����q~q�"������8�\]�5�?��'�5n/j������@2B�����D�y�M*�Q 
-���v���
�CQh;�-�lD\��&͜e��H&p���A����B�p8���G'�ge�8��
I"
���	��>����7�6,Ұ X,�`T#
-�Z���
�J�ݲ�
X���~]�ˆ����ݥ]R�&�`�
�g��"��S
߭7��?q��'��ø��\N]~U�37L�:��9S�W`��2/��]���'���w�ǤBL�z��1�~� 7�4�:��A
�Z��f�
-�Z/D=�
t�`
-q�Rĸ��>=3шK���G�D!��fΣi
����T˒��Ƭ<���֪!
:-����	0p
�3݇��MR�+P;���]��)�A���8R��x8ƫ�J��T�IՌ��_L
-?�rs�n���5�����,�DL
Rk-�Ʊ"9%�
-����
�)��ϣ`1|���3$� ծ������4JY�'��#}
�!R"��4Z9�i
���ֵ���0��roi%��-��;
@e��xJ��
�IN�DL'D��=���v_

��a���L �a�揊��>졈�?�IB�<P��WӃ �
�H�V�`R���dW�� *�R�mZ�j���#����D�D�JR�}ᜀs����9��
�k����Ć(�e�Y�U�Z[쒍Ko^d�i�n���.	��)�w�����NC��B��,����Yr�e��U}��W
c���"��d&�
�'
�1,�	 %�9fy���P
������`g����
-��H��<�

�`���P���P⊭@��9׎u͈DN��Z}
-���PEB�r	R�=b��6^,-���,�Q.�Cn�M�'bĔ<	�L��i�]���������SE�8�P� Nz��~}]$��}<;��AË�'�D�&0�-0�S���o���������N	��n�
��4[
�0���a��Y5�7?F[���w�hB!��)�#�/�Q��ȓH *�S^��l�=��u�u
-14��6t��`(T at M3fj'ۤ�'�qY�M�A�]�?/�M�N�����-+�m

	��\ �d� fņt�n�l�t�f풢i�
ҀA��*��9���@��ۗu�N�x��[�}ܯox���^�Z)J�U�l���T�>>�pB]�Wb�Z@Ӭ*���~�fs����F�u'��ߕ��w�����kG�����?�eU$K��U�M�=�F
W?-l��z�L�K�eK{�
ǎ�b)Ҥ�f�!�l�z;'�
گ��Ζ��[�
���X��
��:�]�ٲH��~d���տD�&xfiR����!xB�z��ZF��)\ߟn���jj��u��@� �:Sւ{q�тA"Jۗk7Cw�ul���ޯ�+'`+pTՆL7	C�m��л79�5��$M}���<�I[)��	� hQO�]�����b��C��p� �"�2�@�!��v�d�1��^��bp.'�{�RO�cH3�]�L:�����pO9^ Tda����^\�����
k���.H��lj�scK
-����t��H��x��WGbWt���ц��<P[k$������t|C���/�l冝� ��]Z$U^�cd��J���P*��B���B����v��lh���Z�"���R
��Z!��LU'���Gry�}�����k�� a���l�c�7���`K{Y��8�>l���!��	���7c��7����,�#Bx``$�/
-:��J��9�܇��:���+��*{�}��
��z��h�}}k�c֠C���Z�4
-����5<*�}����[�����-&���X���f�I�wK+� L�}7}�]���<�s�CVG?�Ս
\Q�Q������
-�I�U�?�
-v�a��ܾCj�
e�\���=2����
�g]�3�T���a3?
�',�L����|
���c�eև[u�`y��C�>��/�����b>�6�/�ͳ�� �2��&~��y�+$L����3�0Q��7���f���ŖE�rXl���[�l���|ˠ��l�z�M7���{7�G���
(�|o5�����Ӳ���e�h%���
NP��NS���V���NYG
�&�z�vgO�^�ݔiv���v�
�|�g��?�.���6o�	[g�96�����z�:
-endstream
-endobj
-12456 0 obj <<
-/Type /Page
-/Contents 12457 0 R
-/Resources 12455 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12354 0 R
-/Annots [ 12425 0 R 12426 0 R 12427 0 R 12447 0 R 12448 0 R 12449 0 R 12450 0 R 12462 0 R 12451 0 R 12452 0 R 12453 0 R 12463 0 R 12454 0 R ]
->> endobj
-12425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 707.957 297.576 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a07785ee99516a90ab920842fa3ab54d1) >>
->> endobj
-12426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.715 707.957 412.2 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.904 696.002 320.388 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-12447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 658.359 305.325 669.263]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a247581d9877a1544797ef8388c86f6f4) >>
->> endobj
-12448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 548.422 155.683 559.326]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a7ff53437f750fd3ce8781dd441d7c304) >>
->> endobj
-12449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.901 548.422 331.382 559.326]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [488.448 548.422 513.996 559.326]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 536.467 229.376 547.371]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.318 495.053 155.683 505.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a7ff53437f750fd3ce8781dd441d7c304) >>
->> endobj
-12452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.901 495.053 331.382 505.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [488.448 495.053 513.996 505.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 483.098 229.376 494.002]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
->> endobj
-12454 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12458 0 obj <<
-/D [12456 0 R /XYZ 89 770.89 null]
->> endobj
-12459 0 obj <<
-/D [12456 0 R /XYZ 90 721.073 null]
->> endobj
-12460 0 obj <<
-/D [12456 0 R /XYZ 90 674.469 null]
->> endobj
-12461 0 obj <<
-/D [12456 0 R /XYZ 90 607.431 null]
->> endobj
-12464 0 obj <<
-/D [12456 0 R /XYZ 90 445.122 null]
->> endobj
-12465 0 obj <<
-/D [12456 0 R /XYZ 90 445.122 null]
->> endobj
-12466 0 obj <<
-/D [12456 0 R /XYZ 90 381.703 null]
->> endobj
-12455 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F90 758 0 R /F39 2320 0 R /F75 554 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12474 0 obj <<
-/Length 3260      
-/Filter /FlateDecode
->>
-stream
-x��\ms���_�igZy&���63ms�$��\sΧ�%Q6'��PԹ�_�]�
-�d[�s�|"MB���ų
�4��h����/N^�'"2��<�.摡Q3�8�.fѻ�$�OnjR:zs��(���SNGe��:�U��|R�է�����o�|��y��</J�Y^�����|�����Q�ZA��?�8g�׿��؀vM��M<�m�1c�(e[����~Yg���Q���8M���M���+�M�O��0�:�7���o}�9�l��HW++����Q��)�:�O~��
�r
-��R<
	mP��ˋ�_NȡkL.It4]���@�<�!�D
�6����E����'�x�G
�Yl5�.��9�zi9J�5��'tO�����
껀�8I6�J��1��h�-�	��<��6 +nZ(�k������g�m�9�D11���@�X &�4N�g��U�Q��9��˴\ܔ��q��t���tZۗ���\�B���`-�# $U�
-��PD���f��ۃQ�)	�S�i	�R�tشrN�4D�$ -�e�^#��a[��b�2b��X�V��#e�Hq�,��ZC/���ִ��{��,���M
�"_fic�$¨ɚn��9�耦��:���F� :�����x'
�poԒHP���uc9��� =���S�ŧ&���X>/��D�ݮ���7�LX�D�
�%�L�
ti"U�����0&���^���2O/o�l���Wכ��)X�}sp�-N���Sr ��!���XE�#Ip�g*kb�9�U�����cp��a)��*�O���9����c�Ơ,

2��U��H����`�
����1>~e��w
�L��}�(%�����m�'�S��I��&Վ�΍ir��2�-�S�o��<�>�
1W!�i��
��^�w���?�<0���	
h�M��C�H�Q"�!<�Mgf7�
REh�o��4i�
.gIc����>������
��
ky9dozg�{��8�ܔ���csX�0� [...]
p�}A[K�sƧ�\���X�#=4;栌	��[�R�c뮈��.Ƀ�|�oWjl���_3ln�ljw���
�w0n�����z��4�M&������pd�B�0��ܒ>��'}�H�/l�aKA�
��֠dg���Ж�V����m/}R�O7���M�a��
�~{��kK�CoH
�iI
�
H
<q�������<���{�Z�Zk���$�_8�5J.�Q���><�c��;�C�v���)��I��t_y�<Ab��B��J�2�?j�x��WT�L�̎P!�?�6_�p
$�	7P9u���u�2H?A�	��u2�]�~��=Ut�BV�J��A
R�^N��B�
�4oZ҆�
ik�]��lf��|rO��_�?Y}]Κ�a�HXu�Ά��

���1� |�6g��u6{9;��^}�Ʈ6((�Z�Ss�7�YU���ٞ*
Y�FC�
�"��ġi}!`�N�W�}E����G��#�x�����53"�h��L
�Xj����̦(i���݅�Đ��G�EA0��
���
�9����=�l���k�Ԃ��I/j
�r
-ĠרEGj/U�^�:��i���2ܲ^��ȗ� b��`h
-
�� �����?n�����~��v΍�eW�7:���5ޫ&m�g������F���Oʛ�j��w^S���ľl���-����O	
�7��i��|��
ٲnN6[i�:GuV����a�Y�:[W��Χ���
-g9����,W�{���u>�����^mq Zַx��to�����Ǎ�&�}20լ}j[��,���V�N�׮K�[Z�j������'��uQ��
-� /��G�Np�:*�'�	wg�_g�I�ף��rj͋}[N��������ni<���
��Xv�� 
�ହ��v��O7�2] <���>��yB4J!Dsz��ݜm�#��Qn�g\�5, (�76{�}�-��"�AL���u

bA$��R�zk�2*>�0B��m�1�2&J3_��]g�����\��Vv�Ѥ,��7\EI��|Aq�wat�x�3�&ae�1j�ԏr�� �CQ��@����SGQ �'��<6���2g);@8:���
��ո
��d��}�������W
�f)-�
Kml19 Մ����>���+�_��K
�д�p�͜?��I���&�4o�Z&����a��{�	�������۴b05��|0mwY�����^5��:�n��^����b
� +
����(!
e6�=���,��;����X�D�q�
�c�]b�C@
�̕��A�e�Ǽ"�h\����ǼB���.~:��P��
-�
-�
|�&\�j���`g�y��kj/W�}E|�m���Ƀ��^�?�̄N�G�!�T,d7?�H�.;�d�Cf�!���1X|T�8��W�"��w����W�xL�f&���
-������
��	'?*h��%W�����Y���4Q��V�����a��}����qH����Q_L�?��
}Z�
�dž�K*���
-|h�`Ѡ�Hs�H����NE2r��]Vc1���Tȃ �T���S��`��N��RY���G���� ��-��9��>L�������:��Z�[
����υO۽V,�=AV{��Qb�x :�D
 �	���� ���R�f�%�ݺA�
�^�<N�0���t Z��
�WM�& ��p�`uw�D
-�
8�\���0 &��Ip�p�~��u�
��[%r�P�
�����j���4��$k��N�l�;
-�(<E%U����b�Up"6����n�c�c���FY���ٿJdQBǠ\��Q��\a�E���I��/�]9���� �
�ҩvUH|�`��*�ٲ٬�V�O!
-�(P�#��Z՗m�6�oˆR[����8�ٮ��.g��p-�7�
�!�{�0�9����
,b��u�%��R,XsH���V�4O�u�,֮Y�
)
݈��-%
-�Z	�l�Cr:V����۾��t��Yu����}�,k{
�������1�Ԗ�!�� 7v;K����U�	���eo�L2g�
i�F>A�b�x���t�FTȁbܞn�����g�T�͛W��UV��pz�N���a��z��dq�P�3	���m�noY��ڻڠ�Q�aEPu���뛳/&�+�W2���7XIWy��͒Pu�t�T�@O����O�!�v� c��B��M��}���{������-���H�_��Fs
-endstream
-endobj
-12473 0 obj <<
-/Type /Page
-/Contents 12474 0 R
-/Resources 12472 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12482 0 R
-/Annots [ 12468 0 R 12476 0 R 12469 0 R 12477 0 R 12470 0 R 12478 0 R 12471 0 R ]
->> endobj
-12468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.089 463.656 513.996 475.611]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-12476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 451.701 126.862 464.642]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-12469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.095 451.701 513.996 464.642]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) >>
->> endobj
-12477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 440.079 168.705 452.687]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) >>
->> endobj
-12470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.256 440.079 513.996 452.687]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-12478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 428.971 186.638 438.645]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-12471 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12475 0 obj <<
-/D [12473 0 R /XYZ 89 770.89 null]
->> endobj
-12479 0 obj <<
-/D [12473 0 R /XYZ 90 375.073 null]
->> endobj
-8369 0 obj <<
-/D [12473 0 R /XYZ 90 350.639 null]
->> endobj
-12480 0 obj <<
-/D [12473 0 R /XYZ 90 350.639 null]
->> endobj
-12481 0 obj <<
-/D [12473 0 R /XYZ 90 226.602 null]
->> endobj
-12472 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F8 794 0 R /F24 529 0 R /F7 795 0 R /F35 1248 0 R /F10 765 0 R /F1 833 0 R /F29 938 0 R /F99 5346 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-12495 0 obj <<
-/Length 1826      
-/Filter /FlateDecode
->>
-stream
-x��Y]o�H}��@Z�k�z2�3D�Jm�T�Y�I�%�,b�-p����� ��DE��v�
x�9s��3g.عq��z��btp���!OR�\\;
v���p�p.�����7�O�[��?�.��.����ї���Cl)��W����Y��7F���m�h�p��7r�G�G��E�B!v�� p'T�q�,/摟e�rd�4\�a��Ij/��A�Q��w�K���:�c�Jrm��K����
�#�(�R��Bd�(��ZșFL��
-K��d�����PE��™�$���j
� γ"�6��M��G�e���L�OW�l�Dw�`�����U�w��'Qӊo�0�g��ր43�,�B@S�
"XWX�
���z�'��i��W$?�]�����S;I���`K [�3
�
IR��y9Mˁ��
-��ȶDT���Ǵ���'
�*B�	�Hz̾ϤD̝�_�¬����^|"?ʛ�M</Yw����,�%Jm
<�P�8 n�H9p
��� =1Q� �%𺑨���_A0, ����R���H&��l_&R�i���"[S��P�+�+���w'z��`a�@bD�
��B2�\�\�� ���
�r����q��a��b=DQK����g���%����$\ةd.!�[m�>a�Kmj*7d`V 'y���w�O�:
-�{g[ap)�]%.��A4��}��\��@�
�Dw@�@����`IVtŠ�2�l`J�A(�ʹ� ��Ԇ�T]2�	��=1H(8�
-���� �
-���㓪�h�A�kI������
-�qED�O����
���0mO����Pz�  ��R�6�.�a!gr��
ĭc
���6q
�TU���><�5��`�
37a��$am�^��
-|�gL&�#�8h.�Jz�����8j�=V�M�ɂ���m�/�z��ygޭ^� �1�	6W,X9�v.��s.B =%
¹���C<ֹ
��t.-?�\�U9���ǹ��ӹHy�>�s1]1�h�2�\Z 
�\ R9�����C�����t �bzb���e �si!x�s F�\Z0�KΥ�����h�:�u�|Yױ�e7kyʛ� Ҳ�b�L�U�`w�D�-�A�G�0�Qp������l
H��(��R�nu9�N��-����
-�^�j�������L��ejj�I�8��v8S������T���H#V��KU�����8��vi�y=�k���@�ZJن`ˇ&���Ύz(��0�:b�?E
�,�
��+�u׮iσ�\'��U�{ai'yy�A��4��*v'YE�9�α�D[2���e�5�QOz�vI��0�G�E�}
)�k�[}�J�[�w�	�Dʎ4�c�)�&V"��/�4�}G������N��5Q��I����/��N( {�!�pYP�
��IF�&����������
-��U�z��"[�1��4F��~�9MW���+�l��u�Օ�!��w���y%ff;�%f��~#o��v�2^���>`IAЍ/��CF���f5�[e���=_
�
�*���ٱ�\���_a�x��dz�?�?�w^�7���z
6POJ^(E�SXT�����M-��(�Ct�vv�M
~���ke哤�N�y�F[	�r�Hh��Ը�����]��0e��/DG�I��z~�����'��^����$� {��Ƌ�
�u�ژ(U���zGj�*��
��&����[6
�
+P�i������鯮0����o���q�J�f��!� !8�g�'H*����B�x/�i���<_

\mn� �A�du�Cۗ=�m
��U��
-��¦�]2���
0��0
-endstream
-endobj
-12494 0 obj <<
-/Type /Page
-/Contents 12495 0 R
-/Resources 12493 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12482 0 R
-/Group 12485 0 R
-/Annots [ 12483 0 R 12486 0 R 12487 0 R 12488 0 R 12489 0 R 12490 0 R 12491 0 R 12492 0 R ]
->> endobj
-12484 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1NNC__Polyhedron__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 12501 0 R
-/BBox [0 0 212 192]
-/Group 12485 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 12502 0 R>>
->>
-/Length 395
-/Filter /FlateDecode
->>
-stream
-x��TKK�@�ϯ�?���>�� {(�P�<�
j_"�`=���M66}P=KH��y�l>���N^�X�fܯ�߁1?�
�愛�r~���N�}��
I.�	�Q2�;,����ض�
-��HyI㩔��>R�Jc�,%EN�@,9c�#�0�7U��K���9؀��f�uE�4��7Dĩ�Y�TY��I�diS8һdxP�/@$PH�vY��wy9M~�uQ�2U�M�*���^Ҭ� �:뢐�lF2岛l-��!`J�%�!\�
|���lt}�>�u��msX�!�̮#�
b�]�q��G�ل�ȲV1��a�b�g

u�ItG$ʍ�A6-_��"�n$����d��|�N�-
-N��[轢�q�O�3�m���V���&sw�5�8��e:��|n�
-endstream
-endobj
-12501 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-12502 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /ZIVHSG+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 12503 0 R]
-/ToUnicode 12504 0 R
->>
-endobj
-12503 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /ZIVHSG+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 12505 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 722 556]]
->>
-endobj
-12504 0 obj
-<<
-/Length 12506 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0E���Y���G�CI7^�A�~�,�A-
YY��+ψ*����
�;�/�KgM���O�� �X�q��^"
x56++PF�D��Q�,��~����S�4�Fq~�ͳ�|�  �
-��W�|_z��ߝ��m�"k[P�c�W��Ĉ��y۩���l���kqq�G����	�^�+fMW
����Ъzyb۠�Mx*/cyQ싖�":�L;�c�T������L�
�$Ӊ���ά��Ӟi`��$Q��(�RdJ'�D;AT�C&�_�cJ�C
-'��ƴ��1y�>�O����č���p�[]��&���
-endstream
-endobj
-12505 0 obj
-<<
-/Type /FontDescriptor
-/FontName /ZIVHSG+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 12507 0 R
->>
-endobj
-12506 0 obj
-303
-endobj
-12507 0 obj
-<<
-/Length 12508 0 R
-/Filter /FlateDecode
-/Length1 1760
->>
-stream
-x�UU{lSe?�w��Ѳ�r�`��]׽���ck�^���
-�c�n�c]7�c��:4�#
Q4Q	1Cb"���F���E�D��	�����ݭ�m�w�9�|��;��. ȁ&�`ߙ����j e
��]��?9��
>P�N
��z�?��ߠΝ@��<� �PK"�w��"���������
��Q�b���
*��%ʫ0f���
p����/7�(�H�dXz��-Tt�N��G�$���r �SU�̛
��p;�Մ&'�om'������f���2�OH�ѹ�/-�-�BU�5��'��
=�

��\f�`��٘�i$
�i5��r���p:�Wu%���3l���@p{��T�]Q_jYkmXWW�
�F�����d���6�J%ݘWn뉴�+���9�
-����`��ڥ�:�4ZMm�
�V\���2�D�E��F":���Dz,�6��|M�vI��f���=mX�?�DŽU,Y���vˉ�������Քw8;�q�ر�PMך�P���.
 I�'�^�,�1���L��2DZ/�ԛ\Էp��2���
"a�|У)��1�nc�Jg�~��V���::6>u$�
-��n
-Ғ�W���%��=�/R�m�1� ���� `�g"��tN~��X�
�-
-"�1*\��F‰y��N���E%|�3�U{g�faft�_e,
�)�8�_ї��	."�Ŋ�l�l
-����uݽa��c����tN��^���ʵ�pf֪�� �&�3�D.�
J+�S"
!%��asD��ol��T�D�^�&Viظ�n��%�ep�г]M����n]ij�yB	fʛ]�{��y�~�꽮��{�Cã��-�H�/bx���~��77�B��x���X�@��s=�U2lMz�1IHp��ͨ���觳g���ћ]��a
���Ts5�\�ύ�Ѯ ������a=�Л��=w��'���7�oab�����[N
=�n_3����N��/�d���c��ҵ��#�r���p��ɨ�/��$��!2%Jp�"�h���1�����l�=�jb�����l5g�����wh��
�N�
�&��@���
Ϗ�������ЈtS
$!;K��
OΜ���̼���/\�h
- |Q�=����kֱ��+�X�8GD�NP����*�Qsyo���ɰa�-T`�� �g��I╋��4xk��h��[��"Qm�׭;
-�Q5w�m���U?f��=R�r^Q�b.d���ݖ~�>�O��,�)��O�
��,���"=��y���d�l��B
��Q6�b��}��� c�{�F�3�%�6������
ҧ
&�R�mH�af
-$|���ÝC�!��
-�
��M�]��aVEe9o��\P�
Ymt�
-endstream
-endobj
-12508 0 obj
-1360
-endobj
-12485 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-12483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 690.333 501.708 701.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-12486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.672 187.853 113.576]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a60ae86027d4480aec07a5eed85f6977a) >>
->> endobj
-12487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.511 102.672 257.154 113.576]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.035 102.672 426.424 113.576]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-12489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.098 102.672 501.345 113.576]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-12490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 187.853 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a16829d6b83d0c21f3d3e1f87c46ac239) >>
->> endobj
-12491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.19 74.333 293.017 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12492 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12496 0 obj <<
-/D [12494 0 R /XYZ 89 770.89 null]
->> endobj
-12497 0 obj <<
-/D [12494 0 R /XYZ 90 676.26 null]
->> endobj
-12467 0 obj <<
-/D [12494 0 R /XYZ 90 653.784 null]
->> endobj
-12498 0 obj <<
-/D [12494 0 R /XYZ 90 653.784 null]
->> endobj
-12499 0 obj <<
-/D [12494 0 R /XYZ 90 571.731 null]
->> endobj
-769 0 obj <<
-/D [12494 0 R /XYZ 90 462.125 null]
->> endobj
-402 0 obj <<
-/D [12494 0 R /XYZ 90 455.248 null]
->> endobj
-12500 0 obj <<
-/D [12494 0 R /XYZ 90 121.887 null]
->> endobj
-12493 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im18 12484 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12564 0 obj <<
-/Length 1627      
-/Filter /FlateDecode
->>
-stream
-x��Z]s�8}�W�)kf�"ɖ%u�;�$M'ݴ�6��v�c�ςMmӖ�W�l0q��$������:W�
-ckda�u��ux�
K"�QϺZ[ܕ�y�k`}�	F
ow�ؾhl����^�)����:$~�<�%~2��ݻ�ʣ6v
�;�a�x짩��!�� �J6��v$i�z�zu���"�
��ֆ!.�����+�0���ȑ���O�X.u�sl]��jac��gn�t,�z�2�P���8!�m��,
���QL�_��M.+m�_�D��4
�P<ԟ�8J30��~e)�--t;<��R:�"ϥV�0��/���"�dd
��u���a8W�{at=���
��̰�)�>�UUjv/�%5"��[E������8�E�YV'f0�L�Y1��K%`�[8r!p�E,i;���V��^�r��;�u���ɺ�ҝ�.�'#Ua������Qå���
hy��k (z�d����EoG؈_p����������Ζ����Y��i��
��
��D��
2`2
*x?�l�՜�FX�2���)��ݧ������>��yUד�.�$c�]�V����qz�Ogׁ!ĵ+@��SB [...]
A���Ӡ�XlN�@��olV��X�h�'��倝��x�N�S�8��?�Y!AUya�j��
��c2P��`��4��iS��aO��'᠞�ƒg�XP���G�.�y��K�W�=�!
-���.F��m�$w�h�������I��ڟkk�ːG����0A����8(�3�'6�%�u�p�ӌ��'�R9TnZ=���+G'����k��2p�
��8mb���|���Q
���	A6 at Hb�B��m���

���
�!���-!d�C1Cx>w=o*���P� "��E��N�
ь`�&�6v�T��r7�qk���>��a�'󢩟Η��g����&�%�G
��x��0_܁x6Pb��RE�U�7C���hD¦�7�����,���bI����� _0v�Zny�<]��0�鹩����~4��݁�H��u�ȣ�~Q&z��A��a
u�HA��ž����դ"
�G�tV�SN ��Sɔ�,��G�
�d
�*[�������0	���:-O�:/��*�qp
Y��%�k��6
��\P�R!N�}W\��^
�ק��_�z6
wuu�î>��~�����b'\�|�27��
���^nb�c����P�E�w{	�
NZ_B/'��V=P�!���

3=�Ks�c
��D�:{��vB&%��
�Y=�!��1�4��A�V� "Kˆ�8�۫�0
P)��ɥ=�;�j�)
+�^<�O
l�e��5e���:߯����c<
-�������=o9@���b�f]\��n9
��ڌ�F�~4+Z��w�� Q$E���9
�
��U+��U|�S�{�*pce�z�e�燇��(
��s3͖� ���
�ȕ�ĉ1(�`p*�P�Q�G�	�*O�3��0 �s��X��?,��ó�c�����+H��F(
-endstream
-endobj
-12563 0 obj <<
-/Type /Page
-/Contents 12564 0 R
-/Resources 12562 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12482 0 R
-/Annots [ 12511 0 R 12512 0 R 12513 0 R 12514 0 R 12515 0 R 12516 0 R 12517 0 R 12518 0 R 12519 0 R 12520 0 R 12521 0 R 12522 0 R 12523 0 R 12524 0 R 12525 0 R 12526 0 R 12527 0 R 12566 0 R 12528 0 R 12529 0 R 12530 0 R 12531 0 R 12532 0 R 12567 0 R 12533 0 R 12534 0 R 12535 0 R 12536 0 R 12537 0 R 12538 0 R 12539 0 R 12540 0 R 12568 0 R 12541 0 R 12542 0 R 12543 0 R 12544 0 R 12569 0 R 12545 0 R 12546 0 R 12547 0 R 12548 0 R 12571 0 R 12549 0 R 12550 0 R 12551 0 R 12552 0 R 12553 0 R 12 [...]
->> endobj
-12511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 692.541 187.853 703.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_af5aee1171c6c67b9c57f3949b7b75be8) >>
->> endobj
-12512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.668 692.541 269.495 703.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.024 692.541 350.969 703.445]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-12514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 659.717 187.853 670.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a7358056031cb08692ae07044715987cd) >>
->> endobj
-12515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.19 659.717 291.333 670.621]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-12516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 626.892 187.853 637.796]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a89d5bd03139c8fcaf1ab035208d680dd) >>
->> endobj
-12517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.668 626.892 267.812 637.796]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-12518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.899 626.892 349.844 637.796]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-12519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 594.068 187.853 604.972]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_ad5c6d64b009045df8248bcb8ffeea69e) >>
->> endobj
-12520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.19 594.068 299.642 604.972]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 561.244 187.853 572.148]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a42e87760e6f69306e6322cc77f20d162) >>
->> endobj
-12522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.668 561.244 276.121 572.148]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.631 561.244 362.576 572.148]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-12524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 528.419 187.853 539.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a8ee7e3364443dc8cd55f3f6388c81ecf) >>
->> endobj
-12525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.683 528.419 277.239 539.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-12526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.608 528.419 373.074 539.323]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 528.419 513.996 539.323]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 516.838 123.096 527.368]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 471.685 187.853 482.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a56849f08cce0bbdb7b8118abb30471c2) >>
->> endobj
-12529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.818 471.685 234.418 482.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-12530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.978 471.685 275.705 482.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.139 471.685 390.605 482.589]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.718 471.685 513.996 482.589]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 460.103 139.694 470.633]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 426.905 187.853 437.809]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a691bb5ef88a4c9638034de4c1b9532cc) >>
->> endobj
-12534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.19 426.905 235.444 437.809]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-12535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.724 426.905 340.19 437.809]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.989 426.905 483.74 437.809]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 382.125 187.853 393.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a35d0734550a70a165a87b145be5e8728) >>
->> endobj
-12538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.359 382.125 261.519 393.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-12539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.868 382.125 390.334 393.029]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.718 382.125 513.996 393.029]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 370.544 139.694 381.074]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 325.391 187.853 336.295]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a86c7ff797f1b5e1b31217a176176eb4c) >>
->> endobj
-12542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.516 325.391 288.784 336.295]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.36 325.391 416.826 336.295]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.288 325.391 513.996 336.295]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 313.809 166.264 324.34]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 280.611 187.853 291.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a163f5dff452c6cf2e3a0c929eb2b8187) >>
->> endobj
-12546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.785 280.611 289.728 291.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.962 280.611 383.428 291.515]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.525 280.611 513.996 291.515]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 269.03 132.501 279.56]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 235.832 187.853 246.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.592 235.832 239.399 246.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a91cfad066b0e12cdaf7454fe4585cfc5) >>
->> endobj
-12551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.736 235.832 340.678 246.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 203.007 187.853 213.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.592 203.007 239.399 213.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a2f41d86c5a949d903179e82072854ef4) >>
->> endobj
-12554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.736 203.007 326.292 213.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-12555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 170.183 195.601 181.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a9dc9e3a464def0e2d929fab9cae6e360) >>
->> endobj
-12556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 137.359 241.112 148.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_aee8ba0ffc68e00046b55e12427c582cd) >>
->> endobj
-12557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.449 137.359 342.392 148.262]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 93.575 255.488 104.479]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a6b1f2d6606a0b4d4fc8bbde3b24ce553) >>
->> endobj
-12559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.826 93.575 356.768 104.479]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12561 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12565 0 obj <<
-/D [12563 0 R /XYZ 89 770.89 null]
->> endobj
-12570 0 obj <<
-/D [12563 0 R /XYZ 90 300.335 null]
->> endobj
-12572 0 obj <<
-/D [12563 0 R /XYZ 90 255.556 null]
->> endobj
-12573 0 obj <<
-/D [12563 0 R /XYZ 90 222.731 null]
->> endobj
-12574 0 obj <<
-/D [12563 0 R /XYZ 90 189.907 null]
->> endobj
-12575 0 obj <<
-/D [12563 0 R /XYZ 90 115.026 null]
->> endobj
-12562 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F110 1507 0 R /F39 2320 0 R /F11 613 0 R /F68 3032 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12593 0 obj <<
-/Length 2351      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�H��Wp�E�r=(
-����g�����={�t8*Y��P�nͯ߬$�d[s��@���L���� ;�v�y��������>����bGx!�>��;�.
����DBf����}��}�W}7_.ta�
�������ؙC�F,
��zP�x��5u�/�}��.Q�n��j����1|?�w��I�G�dJi�~̗�Lj97��L�B�J�9�4M����#_ 2���{-�(I�ײ��d���I����j�#�{�̱��������Lҍi�Ӣ�K�{�a��]�~���U�n�r^9��� �Գk�0LP���W�j
��ba��4
qU�+ԣ*��3�nx�coo?<ݵK���#J�*e%�2B#5
UD�x(`���
��-�i˵��
Cx���
1r��N2�m�3e��0�2�Bn�m��1q]����bitb����#N�>�;>
-
� �M�
�|b��,�H���Fй��F�y�/0�f�mQ˾�aX� 	
���0=�>�c��W�^݈֋�i�J;����,�4�#��@O�P���pߊy�
q�\�yc:[��{;�<�v
�0�0J�}��òS�w&�k0̬�$N�tcp���XhQ��*c��$�
3���X�ڔ�M[��[�Ǝ�4�Ĕ�}0	캨*r#|�����7�i���mH�X^�P
�B�'�	��B��sM��QV�p��4���v�l�6PwK3���0v,��~�+��2*������v7��mLWd.Yь��
ev�(K�v��d�TfЩ�����R~Y'����B2wu��0�6g��4�b]BԲ�ttsB@D�m
-���j�ɇ"��rmc
��]�Xz��E�nMxq�m���P
�E�y��1?t�Ї9t,[S�a���33�)b<Т<`Z��	�t���k�ɞ
-S�ip(DxLD_���Y�Gwsu��۾\�tv
����q'��R���#�s(�F
 x�2 ���h�U�
ri��ys�+y�|�7+�!	8��(��H��@�Ά0H���v�x����	�Z�,ޤ�VcMV��F޷Q`����V�l�݀� �n���4)��O7&
��CC���=�ѧ�b�O����_o?������%^=r!�A�7����P����i����<�Jv�P�a��(mn�<ƒ��<Dq�
f��u��mh�	���Z����l��lk�;Lf�چp�k�)�
�ʞ
�Q5�d=X_�^{��{M���-�<�$1^I�h���
-�s%B�

rD�Q�ء
<�#�D�.�	$O�@ZR�,�i-_gOSC�A&D?�tv�I�<����}F
%AHE_ه�������p��N��b�`:W��0���}��������B�^pF��]��k@� ؍Znv�
֑��FЉ�@�mz
b����JƉ"�����RncjtJDU���j��,֩%�3+g6��D���$H��!�":#&_-�ē� �,�9�
g6��|��>x:�kN�*P:�����0x�O�/��T9�^W�+R�����CP=4BJ�,�$(�|��JT�=�����U*��z�$�r�q��FO����j����(�Ș��/�L����ַ�aY*L|�{=Y
�A�@�%�*k�S��:�ȖW�C�Xʆ��	.��%�& ��Q�91�d�v�c�������?�h�B��Y7��e�?\%�ctKW��҆��Z���?�
V��j2eP��l
�˅*�uZ��e<m��#�6SJR
H##�
ے"蟉���D��
@�q$�$���
�DޮAs"�����3(`DF]pҁ��ui�CN��ƈ9�z>Sg�U=P�
�����9؋��~��T����!����wC���6~�Հ�)S�! f�*�?������
|��b{۱[�7����_�E�
-�qn�v�[�W���ڂl/������f(�
�ֶKw���
/�0�q>j|v���9� g*�B$ �$��ӎUkoTc�Z���ʛ�۾��r�k��z�Y�a "��	�K��z�G�* 
5/c��Ng
j>'�
t���
��Th�BO����94��a�	'�3(�0��Q��
|��3$/�	Gh��%	C�#��cȃ��c	�d��S��1_��I���ڗ=�,�0�nTd
ѐ��5�a����s��P�Xe�m\��2��|
ABPv�wU�SH2�>D�v����{�;�9���cƜ��m�MA�t+�ImP���g>3!bq�hߑww?��_+Y�m¹k}�K���w\�|����	�
-h�Ԡ�������{��O�
}�ܾ�[�����r�~�d���"ۇ�vr��h9��95$$@c����=���1N
-endstream
-endobj
-12592 0 obj <<
-/Type /Page
-/Contents 12593 0 R
-/Resources 12591 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12482 0 R
-/Annots [ 12560 0 R 12587 0 R 12588 0 R 12589 0 R 12590 0 R ]
->> endobj
-12560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.937 641.634 252.879 652.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.44 585.729 513.996 615.044]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-12588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.826 573.774 409.768 584.678]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-12589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.324 561.819 361.88 572.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-12590 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12594 0 obj <<
-/D [12592 0 R /XYZ 89 770.89 null]
->> endobj
-12595 0 obj <<
-/D [12592 0 R /XYZ 90 704.286 null]
->> endobj
-12596 0 obj <<
-/D [12592 0 R /XYZ 90 704.286 null]
->> endobj
-12597 0 obj <<
-/D [12592 0 R /XYZ 90 536.289 null]
->> endobj
-12509 0 obj <<
-/D [12592 0 R /XYZ 90 513.913 null]
->> endobj
-12598 0 obj <<
-/D [12592 0 R /XYZ 90 513.913 null]
->> endobj
-12599 0 obj <<
-/D [12592 0 R /XYZ 90 431.411 null]
->> endobj
-12600 0 obj <<
-/D [12592 0 R /XYZ 90 353.413 null]
->> endobj
-12510 0 obj <<
-/D [12592 0 R /XYZ 480.093 301.119 null]
->> endobj
-12601 0 obj <<
-/D [12592 0 R /XYZ 90 294.479 null]
->> endobj
-12602 0 obj <<
-/D [12592 0 R /XYZ 90 208.28 null]
->> endobj
-12576 0 obj <<
-/D [12592 0 R /XYZ 90 172.424 null]
->> endobj
-12603 0 obj <<
-/D [12592 0 R /XYZ 90 167.941 null]
->> endobj
-12591 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F32 764 0 R /F10 765 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12607 0 obj <<
-/Length 2095      
-/Filter /FlateDecode
->>
-stream
-x��[K��6��W𴡪"O��ƛM9��f���qM�G�Z��PT��mEj(��׺jO�A��5Џ�c
�
|7��a�柒�F��S�q �F"�-�!�(�����s�ø�ď�s��b�N�e��C�������O?��}��|A߮��־��>���4OR#[j
2����}�0�mF 
�E#�TA��}���%
`Ĵ
-��'mN<���ٿg�Q�}"*̫y4�̃�J#�y 	C�[�AZƛ�2(I��q��<�
��ڏ��+ͰB�ͣ�Eh@��̿T "Z��H�1�8��{�H���i�+)��kjw;iv��>����M �(B��>��g0C�E��o�tcߋ'�L�|[�q�W�|u.�_1�y���ʭ~i̾��|���U�C֬̋f`�&�L�Fwp@�H(�$���c~�N���(RT�Y��$�mS3/X00fJD� iصzFV5η��x
-�jW���&�ۗO�}�i2'"�'k Y�TE3���.[���fEW��$B��=i�F ģ;y�h�IRxF�7'w֣�F
S�ib$�'��m6�INu�A��!�{cq5 k-�oM�}^�I�%�z��YfOs*BHi^eq�:C�c-�f�,6GVX�[i_�߂��v�I^��MH�t-}���3��� @CP9$~Do��7��,M�a����F�Q��n��Fa,�	Շr?g(��Ŗq��@1E�*(ه`)�|�BKs�	`">�~
-B�7���"?�Q�",|�a
���0�w0�+�_$����1�B����]��e
N���&�z~���n���
Gԙ���퀐�8R�96-6����$
S(�Nއ,_gy�q@*��������(Hs�E�!��e�%Y���)���a�(�

-	K���t�7��
�Q�=��
�
�1A��>Wn�m|(
b~XtYр�,� ��6�n_�$u1|����-p?�Nm�
�yv/^
&��`0��y� OWp����w�5���H)?L�;�
<M򮟝�7��=����xc�]�~�^��V "9�b�vu����gd�3b���?���?�S<
3D�_7+�{�_f�m\����0Or,Ҭ눬�	G at N��2
��}� 'bF
� ��m�����9����:[>�a2\� `W�O1$P̼jZ�-�`�Te�#�1U�>g�����><��)$�pY�8	M	�氕;����j߭���縝�����%�2����ʫ�� �l���B��+1��0�%�>*�.�

-\��E0�����;ƶ`R���+;�c1��T
�K
Y�@���p���
j��~v�8AR�[p?���=��_vՐ����g�&s��� F�=`���9]v
-.ʚ�C]Qv
چ-�������?�X�E\x��%֌�	������
����6��GEm�
���ͻ18���	�U��0�+��u�H}u`>d�ʚ���3W4�ru��|up�����Șϫ8��G]$�x�;`�"�
�nD2�V]$_�����qڄ����t����

-E�
�T;��kQ�Ȭ]�*���>�
����9%া�>5u�#U�l�4����o�i;�T�m��$�lK *��y�'M�	���2=�
�
�
 ��@��MW`t&�<�qm�	`�m�t�����FR�

~[�rg�0m�G х��
A}�H�<:��$
-*��j�i���!%�
���;Ĥݯ�^�~�K�����Gz�]bMd��Ӵ�*�#	�K"(�$�yŹ��6��F��S~(��{mr���
��"򦎧\��x���@n�x�́���U$&��LL(���2��=� \ �|z��ϲG#��9�ݘ��+��v��c7=�ٍ
�݄I���n&�1Ad�փav)��gn=>����

-q0��y�q�:��:�|��c*�;N��w������%0�E�ݗJ0uD����/�l��a��q����ݘ��F��<p+�(��&g
�O�������kV��"̟q�����^�޼��[m�|��b���:z��mD?�ۘMQ��#��&6�#�
�M"���s����A܅`"i=��^t
��7�6,�G|���7��
-endstream
-endobj
-12606 0 obj <<
-/Type /Page
-/Contents 12607 0 R
-/Resources 12605 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12482 0 R
-/Annots [ 12604 0 R ]
->> endobj
-12604 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12608 0 obj <<
-/D [12606 0 R /XYZ 89 770.89 null]
->> endobj
-12609 0 obj <<
-/D [12606 0 R /XYZ 90 720.814 null]
->> endobj
-12577 0 obj <<
-/D [12606 0 R /XYZ 90 661.835 null]
->> endobj
-12610 0 obj <<
-/D [12606 0 R /XYZ 90 657.352 null]
->> endobj
-12611 0 obj <<
-/D [12606 0 R /XYZ 90 568.997 null]
->> endobj
-12612 0 obj <<
-/D [12606 0 R /XYZ 90 515.308 null]
->> endobj
-12578 0 obj <<
-/D [12606 0 R /XYZ 90 480.638 null]
->> endobj
-12613 0 obj <<
-/D [12606 0 R /XYZ 90 476.154 null]
->> endobj
-12614 0 obj <<
-/D [12606 0 R /XYZ 90 387.799 null]
->> endobj
-12615 0 obj <<
-/D [12606 0 R /XYZ 90 309.801 null]
->> endobj
-12579 0 obj <<
-/D [12606 0 R /XYZ 90 275.131 null]
->> endobj
-12616 0 obj <<
-/D [12606 0 R /XYZ 90 270.648 null]
->> endobj
-12617 0 obj <<
-/D [12606 0 R /XYZ 90 182.293 null]
->> endobj
-12580 0 obj <<
-/D [12606 0 R /XYZ 90 133.657 null]
->> endobj
-12618 0 obj <<
-/D [12606 0 R /XYZ 90 129.173 null]
->> endobj
-12605 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12622 0 obj <<
-/Length 2513      
-/Filter /FlateDecode
->>
-stream
-x��[k����޿�O	��5����v
�f����JY͎Z�M�Ql�ζ�}nA�1�6�h�F`(.�n�ǹui�,
켿y=�y�7�
y�Jg��x�Q�CB¯���e
�|���0��$<�_~������쓹w�nv��
�[�!� ��v���_����?81O;����
�+���?np��{XA��=�)��ī�s�H��
F�Afi�++��nO�:�Ұ| ~�:��e�
�r|�K�`��ٕ�0�œ��{��5�N1�@;�0�.��O(w��_Y�LqӶ��cK���⦹��o� ��
-��P�M�_W"؎�H!�ƽR�C���4���Α�8 %�q^(|��>�+")\�F�B��ȣ�
��S�����������~ŘFa�,~6�u���dʰ�~Ȋ�}2��R�|�'��L
�Y4 R����t[x{��Z�`�j�c0��i�����(�
��Q�����i�%�y�M{q�G�MI0����+�X8^lGL(v��j��͹��� ��W��D�٘.5��¥8C�{�3�Kwҧ��hQr�0�K�خ׻A^u
�n�j"�ޚ\�0�6�te�<
��j�+#�ӄ
-�)H�(
�,(--��G��S���0�������I:�&/��q��_�Fy��f�*li/uK9ѦB8�
-Q�'S�1.S��?�D�J�l��U/4
-�
-�!c�L���	�n�2�8�0
(�S=��D�|
�J���ۻ�7
 �D� @�y�
-Ll��#XU��X
49�$�r��
<�
-,�i�EV�F
�(�ý�&6sL�6��gZ($CBU<��kTш����Dc����OD'<������*x	��Û���]�\���9�<a&n���S����}� ͫ$���/o~����~���1O�C���K�A 9��
�9x٬�y�}iս�<�Z"��H�v
_�$n#�oY���N��iGvpp&F�zay
�o����wJh���7^�����G���
��y�M��6C J0�� �%=E4��I4Z(fǍ�M^�0�ʋ?
��#?�� ���<�rƖXX�H��(�C�� �Ԁ�E!�Qt�
]�ێ��f���t�ܮ���-
{'\F1Tn��倏/6�ģ�
\!�$��Z#�i�Rz�RB��Y~on3��>g�Ÿ;���Հl�	"��BL�"����ۤh�%2��R�_;�XRS�
�K5�i�|�
�WQ?
�Tm�
��
R cj
�j�ز
�4�e@�4��  }jJ���K�� �J�`8�<�!`
-���݆�@U���h1!J+^�:~�Y�(��DK��Y]I)܀`���
T-\�r�Opoƪ�>���}C�1�5>�u3)��nλY7�\E�nEKz�vO�e�Ek9?��*��/
b��0Vl�~�!���ٙDޓ��^N��m��P�-3�_�o�|�W���W���[
Yǩ��I�y�V[A~����j��C��J'�y&Œ��G���A�	D at 5
�PHh
2M��e�x�����[8f��`}�ٌ��Gw��
�r�<Tm\>��� "�c���
��=>j��E�W"�6��3j
;l?���e
!�y]���s9Ԙg�CH�vK��B�p�1����H�/�\��X��rF{c�0�d;_�w/�`�A�;�
�$
-�A����m~}�NƗYx+f���w�d_�y�!1�N�cae$����� ��g�sS�n
-����vD���!H�	���;�
i��#�/�'@6ޛ �D��;>A��J��X{~��$6���!�0"���
m;�\�\�\kp1s�X��2Lj��ȿt�֚�]1�"�̃��O#׾Z�k�%\o��U�*���d�V�$ ���P
���� Ŋ��ūv�@���"On�PEդ��B��d��#F@n?���T�Iʠ
Ԣ�������m :x`X�1�/9°Ľ���1X5 q=�2Y
�
A�g���v6�<�I)�'ᢣ ��+ub�@�;K�ݴ�Q(���v��f_��7��oW��_�ܯ��
��Dk��1�?�K�)
QQ>R��C
��JL࠺��!uؕ@:��١�֥�ȟ�]>��˯Lo�
��%Ck5j�
q�/-��mZMH�P��.�ۑ,��F���%�����|�;�ӽJm�
�^����
���Nteh���kN�<������4�5<�k�iHo�
=o
,��nCЛfo><�S��{��ߛj��

no> ����7I=�krxo�jM�}���o���s δ��fb�)]�oz�'ۑ�d;����(��tn#�]҈�ۗ��B�nD�þ�ՍHzfqb�z}_^X��~k+
cdmN�74)ʆ��R�AЈ��$�$LT�-����f�����Ú9ocV����i-��4q׬��k>�(ƴ�������4H�8µ��я�eB7n��$u}E6b�΄`�SXU��U���M��
<`>BT���e��W�
��4��L�p�뇡�Ū�dOqR�mIPhpq�g��]�x��MY�
-endstream
-endobj
-12621 0 obj <<
-/Type /Page
-/Contents 12622 0 R
-/Resources 12620 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12482 0 R
-/Annots [ 12619 0 R ]
->> endobj
-12619 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12623 0 obj <<
-/D [12621 0 R /XYZ 89 770.89 null]
->> endobj
-12624 0 obj <<
-/D [12621 0 R /XYZ 90 692.066 null]
->> endobj
-12581 0 obj <<
-/D [12621 0 R /XYZ 90 633.088 null]
->> endobj
-12625 0 obj <<
-/D [12621 0 R /XYZ 90 628.604 null]
->> endobj
-12626 0 obj <<
-/D [12621 0 R /XYZ 90 557.873 null]
->> endobj
-12582 0 obj <<
-/D [12621 0 R /XYZ 90 510.85 null]
->> endobj
-12627 0 obj <<
-/D [12621 0 R /XYZ 90 506.367 null]
->> endobj
-12628 0 obj <<
-/D [12621 0 R /XYZ 90 406.056 null]
->> endobj
-12629 0 obj <<
-/D [12621 0 R /XYZ 90 340.013 null]
->> endobj
-12583 0 obj <<
-/D [12621 0 R /XYZ 90 293.388 null]
->> endobj
-12630 0 obj <<
-/D [12621 0 R /XYZ 90 288.905 null]
->> endobj
-12631 0 obj <<
-/D [12621 0 R /XYZ 90 200.55 null]
->> endobj
-12584 0 obj <<
-/D [12621 0 R /XYZ 90 145.612 null]
->> endobj
-12632 0 obj <<
-/D [12621 0 R /XYZ 90 141.129 null]
->> endobj
-12620 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F75 554 0 R /F117 2446 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12636 0 obj <<
-/Length 2363      
-/Filter /FlateDecode
->>
-stream
-x��Zio����_A @"�v߇�عޝ�*k/��30h���P���v��>�l6MR�16'�|�լ��~]�^�8xp���뛳���Iep�
7HH���#����	���c�Ga�
-�c�GY��yx�!������bz9��Βmg��U6�..���7Y�)�0N��xB
]�vV��E���
E�,�[�3b��懳w7g��p�9&���luv�	s��C�3:�\6Z�28&���?�ps�w�H"�
�fi;�z��F���:N�Q
�^�U�m��:�ǫ(����l�i��m��2\W��t^Y��]e��r$�f�&�����3K��h��	D
�:�A!ܨ�.QG	������=�4�2���� C����a��UT�I"�M�^�ز���=�Ϻ3+���ᩕhwr�F��ED�	�Hcz�*�v�ЃB�\i�k� �1m\���.��bE$��/t�����P�v�-	X�%���
��M4wgE��6l����/?�'txT�HD^0��( ��!q5�E�+��f\��p�0���,[����ӗ�x<	c/s�cM�n�qU² <l!�VU�?��,�p
7
|��C�y��s�Z��*w]��)F�!�ٱ؏#0I��Zd>�b3m;@uʥ`�#P�"B+ZPD԰�l$��CF{zUC3e},���k�2����7(
�Q
-�&���/=!gJR��{�Apsߠ*`�p�OPɠ�Q0u0l�n���ZxcҊ�t�(0$[4
K���a��"Cx���l-
)O����՛��%AX�A��
a ���U��{|�
�@�� �1u�/f���'\�� D�A�ʼn'�H���iV�Y&w�em�Ū�HQs��!aҷ�ûFT�#po���7�:6���U�!�IV/�7e����Mn6}F�����ɫ@K��o=����}���׻7?}�~x��˛_{g���a�HeS4g�s��5=�q��i��*!M���$G�S��6��N�Y\|j��N���X �
-v�-)�E�
,�;��]g۪��"¾�x�5���B��&iӲm�:�
-���8m��,]h6m�`߬� �:9c;隯����3���nUr�G��5~�蟡j�Y���|�?�Œ}r˒
$j
��(��L��9�Ηy��7[^�
��7�6�
�^$pC�fd at l
n�a

-���?�����d�U6/t�iM������c�G`��!�r^`��V�j֔6��5��=��z�~��
-W��m6+�4,o�/F��Q�7-��T=�g��>e	b����0����c
��5�?Y�Ph�� .P���
ǵ
-U������c�ʺ��#�8Pf:HH 
e�jy��&I�dM�� ���^��Cb���pD�
�_��0�v��GbhP���}r,�R
�Evf���X�N
-a�@E��
�pm}�	�%��N��I1�QjDւ�OA��]=�_�0h�U[�\Zn���8��dR­���_P-)K1y��^�dt��
-[�6��U�ط��a�
HLU'
--#v�nPT���>7�p�c��!�,�v�Y� �vg�d�o�cv�@���0�W�Ҍ2����UW��h�~Zh&��^&�@E"�
k�S|w��\
���w_f��V�#Z�UŸ@�ށ/�`���7�Y�_ƀ��l
8��I�^�dy�إ)��<
-G8�U"֌DZ�o����"N�
�~�x~Ř)�[�H
-�Têr�0
�[�;T�@�Juh���A���Ho�y6�b��\���
�$O�v�x"�OisO&��
Iw\�u#�+�Po�L�Ԓ��It��CE`�%�ܿ��$>l����m�~�g� "xg?`�b��E�{E���	-O?��ATQ�a��"�V
1�Ȓā.N�-�M��V.�H�2'T#Uہ�r���D�rX��\V������QG*�
��:�
��:��"�jD��V;���$�(mI�NW
Xq�¹���BKyL/�}߉�.�q�d���a��uëB�A�fv��v�������z�k	M at q��n����)��c5���C
�*g�����w��
��f?*�7�6Q���[.E����J�ݒ��שּׁ�z�W�o�2��6Y:�o�W%�O�>w��
��2��e�~
��Ӣ��ai)[���P4ຜ0�~�B�î��&�FE'eZ�;
�f�����΄`7��QS�
�W&�M�ϴ��,_=��s
--e��竢���o�)$<�xM���/�(���o��a����V3���7uX	�V���A �#������ُg%֟\!�#�2*/�b}q~~�}�D������8@�z)�S��<_�S��*��|W�"lK���`���h٢y^>�/V7�/W,x�A��� �M�
-endstream
-endobj
-12635 0 obj <<
-/Type /Page
-/Contents 12636 0 R
-/Resources 12634 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12645 0 R
-/Annots [ 12633 0 R ]
->> endobj
-12633 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12637 0 obj <<
-/D [12635 0 R /XYZ 89 770.89 null]
->> endobj
-12638 0 obj <<
-/D [12635 0 R /XYZ 90 680.111 null]
->> endobj
-12585 0 obj <<
-/D [12635 0 R /XYZ 90 633.088 null]
->> endobj
-12639 0 obj <<
-/D [12635 0 R /XYZ 90 628.604 null]
->> endobj
-12640 0 obj <<
-/D [12635 0 R /XYZ 90 516.339 null]
->> endobj
-12641 0 obj <<
-/D [12635 0 R /XYZ 90 464.707 null]
->> endobj
-12586 0 obj <<
-/D [12635 0 R /XYZ 90 440.174 null]
->> endobj
-12642 0 obj <<
-/D [12635 0 R /XYZ 90 440.174 null]
->> endobj
-12643 0 obj <<
-/D [12635 0 R /XYZ 90 357.597 null]
->> endobj
-1902 0 obj <<
-/D [12635 0 R /XYZ 90 260.088 null]
->> endobj
-406 0 obj <<
-/D [12635 0 R /XYZ 90 250.097 null]
->> endobj
-12644 0 obj <<
-/D [12635 0 R /XYZ 90 167.235 null]
->> endobj
-1903 0 obj <<
-/D [12635 0 R /XYZ 90 66.804 null]
->> endobj
-12634 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12657 0 obj <<
-/Length 1817      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~��0�����E��`(�5m��M��{j
C�[�.�,'˿�!��%�N�ð��E
��w>2�Y:�y;�u6:{0G"�Sߙ�:;�'��-r>����/�w�"҇Uf�������ٵ�6z=}
��
bpg��>}�N��
���:
e�8ף?F��#�����4Y� �9�U�WB�
-#_��1
O]��"
��!�GB��ayL+���4 >F^�;jL]F�y�2~X��P�b��i4���Clv5x�a�N�����2�����<��(p����Lo}����^�$u��l���J�`��
�;�T�/�8�e����Qq��p��g�'�*]'a��ȕ�u��*T�P�mu.����NQL�`( <xHpfE�V����xQm��"w	�ő�Fʕ�E�&�r�G��6/z�/�B-�����";�ig��
i�*��		�O=��q�H���3!L�L��~8:� POX��Z
�a
	��^����P�#ԙ0\Y):��@ �xa��A�7���o��q֦�">�0�BZٟ)彵��eUWoGΧ	���nV�w��Ϙc�Gh"�#@�3�A����D�P��6��� ��6�� 
t<�jq
�=`XeƝK�8���ۀ�U�jS�&�!s/���Ed�Q'$�G���bV'x�M��.\Eة�|
i e>�K���l�v���M��
۴�l�����S�
$0T�u�W��P�
�1&u�锘i��T��B�a����X�Y�zO��&]vq��1t �H��Х|X�,L+4n��7L6"�G��6p`��N��
�
T�]�A�:�*)�B��V*AE"���=�,0���
-0�xخ�r&48���ٵ�����L
�
HeL�0
-ݰe�/��
�k at 2�g�{��[��hg�Y͌&�-,�
�nLy�P���:N����=0E+r�I�����$Ƀ95���$Z�m[�o밀R.������Yҫ��HA=�zg�Q�8�؉!}���Ey
�,�SXy�|��!h����*C��6UY~#�V��>��N���e��4{������A��쿭ŗ�U�zƝF܊��N�D(�y�x� �|j�Lbarnq�`����/�;�	�y�=��hr̻��k�^�j�
�x
d������8Y>1�����bv�
MA܉�}dyQ��VY�(nܦ9�@@}�Z

<$�S����4MՂ�m�X�>�
��i�Gpp�K��H�!9w���D40��)���=8�x^s

-�h@
xP�6�n��d��t�.^f9�V����
�����]��w���75W�,U�]���U�i�y��I������l�VD�D�wCs&�[�<tti��C �s���RH�� �&�O�	ҹD�8�M�$,�ƫ�S�P_uT�𻏋2���2��d��a at h�D����r�
-�j��J8�Ч_	͆� ��
(���.�K�5�m�j������j��)��~��M?"�����e�"�� E�1��\��߄5���.*RU���H�x٧����UlN�+�����^qT"4���Iy�;��ˎ����˰�.}�7��I�=�w��HE������n~��?q���\�����U��Oc�H�R_�a�q}"��61k�X��Q����
������ucg!p4nq�+�&�ꏻ��c��8�-e�E�Zq�7iH��i�@���M�A�N�ۇ?7��Q���'�l[��ԝ�f�D
� ��h!w���תN
��_�ڿ�
R������_������f�ܨl��2���],%�@�
�I�e0�Ƴ� >dc�
-endstream
-endobj
-12656 0 obj <<
-/Type /Page
-/Contents 12657 0 R
-/Resources 12655 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12645 0 R
-/Annots [ 12646 0 R 12647 0 R 12648 0 R 12649 0 R 12650 0 R 12651 0 R 12652 0 R 12654 0 R ]
->> endobj
-12646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 606.851 174.015 617.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction_a77067a656a3aa9381a93a23dfba036e4) >>
->> endobj
-12647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 576.342 197.875 587.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction_af38e352895f910cc9556dc7ac0d8f39d) >>
->> endobj
-12648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 546.581 181.763 557.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction_a5a0edbc51074f6e9e1a908fa292abe13) >>
->> endobj
-12649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.418 428.1 391.839 439.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-12650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.857 122.365 243.473 133.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a96bae54a01fe00bad4306bec61bb4687) >>
->> endobj
-12651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 92.23 155.464 103.134]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-12652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.962 92.23 221.894 103.134]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a891529f721ff485fe2ec90ac48952cc6) >>
->> endobj
-12654 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12658 0 obj <<
-/D [12656 0 R /XYZ 89 770.89 null]
->> endobj
-410 0 obj <<
-/D [12656 0 R /XYZ 90 721.073 null]
->> endobj
-12659 0 obj <<
-/D [12656 0 R /XYZ 90 626.591 null]
->> endobj
-12660 0 obj <<
-/D [12656 0 R /XYZ 90 626.591 null]
->> endobj
-12661 0 obj <<
-/D [12656 0 R /XYZ 90 564.587 null]
->> endobj
-12662 0 obj <<
-/D [12656 0 R /XYZ 90 516.1 null]
->> endobj
-12663 0 obj <<
-/D [12656 0 R /XYZ 90 464.404 null]
->> endobj
-12664 0 obj <<
-/D [12656 0 R /XYZ 90 402.108 null]
->> endobj
-12665 0 obj <<
-/D [12656 0 R /XYZ 90 377.171 null]
->> endobj
-12666 0 obj <<
-/D [12656 0 R /XYZ 90 377.171 null]
->> endobj
-771 0 obj <<
-/D [12656 0 R /XYZ 90 252.458 null]
->> endobj
-414 0 obj <<
-/D [12656 0 R /XYZ 90 244.458 null]
->> endobj
-12667 0 obj <<
-/D [12656 0 R /XYZ 90 140.481 null]
->> endobj
-12668 0 obj <<
-/D [12656 0 R /XYZ 90 140.481 null]
->> endobj
-12669 0 obj <<
-/D [12656 0 R /XYZ 90 110.61 null]
->> endobj
-12655 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F22 2996 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12723 0 obj <<
-/Length 2232      
-/Filter /FlateDecode
->>
-stream
-x��Zms�H��_�'����3�J�j�8[�M6�ȹ��dK���/
Ȏ��_3 !#�
�I�}H$�������
�13��������[�
��r���p�!,�
���M����!����M/�����b3Y���4����I�e���~�͒�[�Gs/
��z���
񔺈s/��TK��U-�i��"��j�O�$�^xy>R�0��A�.�"P�|
n�l@
3�}����6�+�̓˛��O��Qf��p
?:��'6���F�u��rQdX�������k
�*��*?��AV�ބ �`���r2�"�A?��h
-���.c��8/����ϳ�|S,��b�7�+]%�
�v�^����ޕ�
����n6���X����r?
��e�nːW�`�?��ꃖ�5]f8�&�T8 nQcH,�XB���,,�"���7�b�6�
���s?�2��!��m�B/VB
���R_�f���<�
OZX]Kn�@�lt
d����`����N����y�j� �ԒP�Z[�
RF��؉"�����ҮI^d�)������-��S�}\+z����,q\$ 
���4
��0��4%����Z�p�(FdHpR/j�Q�
��y��ā߸���A��5kC�0�C��˖'��غJ�7,�no�;&I���E�M;�
�@�����%�̉y�
,�L�V�3D,�
jAY� �5��A
���<�E���.�`�~��:��������yѩ�
z��2Ы�^<U��A+@�ȥ�d�8E&�
�\[Wy���R�)D�b5�m��!#���,��
'�&l�l�Edx�"'_�~���ŋ֍8��ޭ��[E����+�Av�Jb�~*�=�i��SDI����q�R���.U�
-����0
OV��=mƭ�����&���-�UN�U��Jy}���iX���-�C�Z���Ƕ!Ë��nu_� �'?޳�{�g���:
L
����P�K��*|�8
ݵo���L���>
N�bP�Q=f�=s[s�����jh���h��j$�!�
-�5�|--�-} ?�
M��<��T\����K��c
Xo��.�4[r
��n0l:�	�t����{ȁ3<L��܌�Ѹ^���/v��lZ��YK��/�4R�b����n�>�~��ˏ��\>� H�n��V��#|!l	���a\,�Ŵ�^�T�qx'�!�pt�&��
�����hG����!xi�f�����ڜ{��ęb3�G
ʝ246Q�JEI���͎Р���t��IX��j�@��
���#D~�������]>����\��q�@�Q����^US�$]m$P
x�b��e;�[�$�+���Mj�Uҫ&we��k���e�[Cņ$��uu�Џ�HG����5I�i�K��(, ȴ	�}�d�^ai9���&���ȡ�C�4g��n�>��Y�-�ƬEԕ~?$`� a

	�!qA9Ҵ�D˱A�Ȟk,�
��w�L��J.�{O!H�Nug�5�Z�Q͒Ot<i����9=��H8l�
�]5��ưL�
��x���m�N�����Aq�r�����ti7��dz�qז�l�Y�y�6Z&�P�
q)���!�4˖�X��M�g���%�i~�
-�
��E��$���G ���@a����܁��SOpf�p��€@;J��W
��rٵ>�L�"�4�w<F�q@)�
���f���]�`J��ʋqk�P
�C���7��?��˫� ^0���E�l[
��3]�l�>�g2�+=����k'�$6r�ny�Og��zp�m�]�b
�-봉����$��E@�G@����@�q�����h
��d�,�Y\�N0�����Y8m��p��>��ÿ%ixL�}�5����W�u
A��9�O���n}\�wD͋7�р�����Չ���(r�}�7[���o���z"N'���V�A���'�ܭQ�Ӷ�}���7�ږ1��,������U�p��rg-Vg-
�v�ME��D`Pk�n�q`y�\��߶��`
�Уq*-#Z��]�5I��^�W�5ٞ`�X��+‰B
-z`��T��+�!v��A��D���|s��[�����~���M��/C��=�ƛ;ذ�Xg+��������?��
��xY
u�
�I�Y^�Рa�Z��Δ�շ���݈

��t:/����l���A<C~=���>$۫C�:1���>��լU��Vv�1A
"C[���	Z"-Wl~//V7�ή"f�I����M�{��6
-endstream
-endobj
-12722 0 obj <<
-/Type /Page
-/Contents 12723 0 R
-/Resources 12721 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12645 0 R
-/Annots [ 12653 0 R 12670 0 R 12671 0 R 12672 0 R 12673 0 R 12674 0 R 12675 0 R 12676 0 R 12677 0 R 12678 0 R 12679 0 R 12680 0 R 12681 0 R 12682 0 R 12732 0 R 12683 0 R 12684 0 R 12685 0 R 12686 0 R 12733 0 R 12687 0 R 12688 0 R 12689 0 R 12690 0 R 12734 0 R 12691 0 R 12692 0 R 12693 0 R 12694 0 R 12695 0 R 12696 0 R 12697 0 R 12698 0 R 12699 0 R 12700 0 R 12735 0 R 12701 0 R 12702 0 R 12703 0 R 12704 0 R 12705 0 R 12736 0 R 12706 0 R 12707 0 R 12708 0 R 12709 0 R 12710 0 R 12711 0 R 12 [...]
->> endobj
-12653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 685.388 181.845 696.292]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3b9f6fbac96e03a00d061a2cd2ca2baf) >>
->> endobj
-12670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 657.685 181.845 668.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7dcb9b448c8c0171e18f29551077d133) >>
->> endobj
-12671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 629.982 154.727 640.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a04704288741dbaf6f50e8fc09c43f737) >>
->> endobj
-12672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 602.653 176.505 613.183]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aafdd0083c1c10d49e06f4718a826ae1b) >>
->> endobj
-12673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 587.755 450.955 597.66]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7dcb9b448c8c0171e18f29551077d133) >>
->> endobj
-12674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 563.617 191.718 574.521]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-12675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 563.617 288.852 574.521]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1091bf4d0e8ce7672f907cf5e7921120) >>
->> endobj
-12676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 535.914 191.718 546.818]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-12677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 535.914 303.079 546.818]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af9503f2a0fd1535ce7cb9465908006dc) >>
->> endobj
-12678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.635 508.585 188.679 519.115]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6f9c769f48ed91cd71bec247b7733430) >>
->> endobj
-12679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 444.628 197.363 455.532]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab38e5d3ce8cc120ce4b534bc43d90d34) >>
->> endobj
-12680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.429 444.628 268.072 455.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.049 444.628 440.438 455.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-12682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.518 444.628 513.996 455.532]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-12732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 433.046 133.174 443.577]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-12683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 408.955 197.363 419.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a940509da64dedf971ad0e8c07fa75bc6) >>
->> endobj
-12684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.051 408.955 297.319 419.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.277 408.955 390.744 419.859]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.718 408.955 513.996 419.859]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 397.373 150.878 407.903]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 361.326 197.363 372.23]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaccc951498a59150e2297e6a9a3843a9) >>
->> endobj
-12688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.647 361.326 296.915 372.23]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.05 361.326 417.516 372.23]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.288 361.326 513.996 372.23]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 349.745 177.448 360.275]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 325.653 197.363 336.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae37107ec8d1402bb69ac6462d7f4646d) >>
->> endobj
-12692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.7 325.653 302.527 336.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 301.935 197.363 312.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5e74729a5f7cabef57fb795cc728869c) >>
->> endobj
-12694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.7 301.935 309.153 312.839]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 278.217 197.363 289.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8a329c1ea10527cde394abab15b67356) >>
->> endobj
-12696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.7 278.217 300.844 289.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-12697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 254.499 197.363 265.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a46797ad634dc267c1264aa046c69f9f8) >>
->> endobj
-12698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.855 254.499 273.785 265.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-12699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.278 254.499 373.744 265.403]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 254.499 513.996 265.403]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 242.918 134.28 253.448]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 206.871 197.363 217.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af01e11ba0928481fccc99a0c1cace0d9) >>
->> endobj
-12702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.363 206.871 242.963 217.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-12703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.041 206.871 283.768 217.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.709 206.871 397.175 217.775]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.805 206.871 513.996 217.775]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 195.289 156.965 205.82]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 171.198 197.363 182.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_afa8decb7c7093c9cde1255a6c1af62d4) >>
->> endobj
-12707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.7 171.198 244.954 182.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-12708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.234 171.198 349.7 182.102]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.499 171.198 493.251 182.102]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 135.525 197.363 146.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9ff9fc541a420e15ea669068b9c9cc69) >>
->> endobj
-12711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.925 135.525 270.085 146.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-12712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.428 135.525 396.894 146.428]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-12713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.805 135.525 513.996 146.428]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 123.943 156.965 134.473]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-12714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 99.851 197.363 110.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.103 99.851 248.909 110.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0a7f222ac228554b369d460087815b87) >>
->> endobj
-12716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.246 99.851 348.515 110.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 180.198 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1f116cd62c9c54702aeafb564bf8e400) >>
->> endobj
-12718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 74.333 256.282 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12720 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12724 0 obj <<
-/D [12722 0 R /XYZ 89 770.89 null]
->> endobj
-12725 0 obj <<
-/D [12722 0 R /XYZ 90 704.286 null]
->> endobj
-12726 0 obj <<
-/D [12722 0 R /XYZ 90 704.286 null]
->> endobj
-12727 0 obj <<
-/D [12722 0 R /XYZ 90 674.849 null]
->> endobj
-12728 0 obj <<
-/D [12722 0 R /XYZ 90 647.146 null]
->> endobj
-12729 0 obj <<
-/D [12722 0 R /XYZ 90 619.443 null]
->> endobj
-12730 0 obj <<
-/D [12722 0 R /XYZ 90 580.781 null]
->> endobj
-12731 0 obj <<
-/D [12722 0 R /XYZ 90 553.078 null]
->> endobj
-12738 0 obj <<
-/D [12722 0 R /XYZ 90 115.022 null]
->> endobj
-12739 0 obj <<
-/D [12722 0 R /XYZ 90 89.504 null]
->> endobj
-12721 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12807 0 obj <<
-/Length 2039      
-/Filter /FlateDecode
->>
-stream
-x��[[w�6~ׯ�S*��@����ҳ�$Mc�/i�E�2wER!)����BJ���#V���I��`�o3C��f��}?�����-��D2$�w}�I��D,�S��J1�����aB/s�Տ��|����o�_
�
�0ą��Ͽ��n���F��M��
�߹w5�i�;Y��l�zd
-|D�c�0��\�G�RKq�6m	C���Wߧ�
��F� �>�U���5)����nt�T��
��a
W���Y�u-�����!*��htAa�_}�w�E -澵�c�R���i�8��P����4
-����c���4IUV&yv�dq�.�*����!��aC�bX����
,�	�8p
&��zY�3G�Oz
l�#P���h��͹8��m~,�h>����5���,KC�@��:Z
-
-Q �\`j�efx�ʪX�U^�0ƀw�0-S��!�%�`~�Gaz�҉*���.��M��ouU��un?����|�ܬ�f�}���,%` F�


����W��i:�h��E�q�s/"�_
j������'U-�����
�f���2x�嵗*��y�d�K��B؏-cİ\;�}vE(G��G��	 F7#��Iv
�6�V��Fk�#L��w賥�V��
C��/{sǍ'M
�T��V�t���I��N�*F��	k�
,
��� $�\�`�Ĺ�K}��@8��2��fS%Y5�Z��J�#o�t+��ضg)��-�ce������
�;�
�ʳ��G���4ɒ4�CM�O�]4j��+�"@��D��$9vӠ
��� 9+���ǚ��V�sӏv㥧T_��<�V��9mWtK
b��d����rv�
8���P�l��rf@偕#��{
��� �Y�p��04o#
-:&� О�)�V�	��}�H�*����Z[<0 �؝RЖ�$�.�ʜ����
e�M�
u|���|��U�]w�m�c;�8"'|�:��q�;�ֶ�ہ+��p �
�N�'��=-�A���
�<X(���#{�҇\
fs!N���I\�W�g==�j0F�z{h&�F
���P�TB%%��s
��y�̧��S?5�Ȧ�u*m�=�xy,;�vF`spH��?�yTm��;�R��c;|=��IY'��)�N����Bܳ�|>թ�+<W�Je]�
�J��[��ō��k��#
-W��x��
-	¦*��C�����n6�N�ӷ��

m�����k&�:&м���4�Г��z*.�̪�t��J�g�4ӕc�$㛜�
���f�ى�	#�}E�<�z����T�S�P���ZE�@��@�ˆy}�S:(.�D���4TE��=���V�N�aCҪ
�+�W�BU�x���Q�}�gOJ��I�̦j����6Y��̱��<�%q4�%�y^>���V�漗խS�U�-
.'���>+rn3��gc�O��3U������:����E6�_�UTVk��їQ{P�
-�#*G-�
h`K9;��;�1gע"�􉾎�w:ċ���
-�'Z̹���<�8��g��A�{H�AH��`�?��}�hf�+Mm{
Mr�n某׿�E����B��*�0~
�|��S���w�V�qS�6��1��ހ��Pt�sB!G���
-Nl���	�7 �F�� ��x
-���;>��0�~7G]�{S,�!�
� �t��p:�x�g@_�9�'�a�g,��q�w$v�HҎ4}92=j����:v���./����W�
��16C	=l32-����
\8�����R �Y_�}6�(�9�u����U�%����v̲�^��a�z���C+a2u1E����>��C�8����I�-��
j��¢}�)��j��<�ra�+@;��E�e�#6Q[�XVj����6��9p��o�6:�se�|�e�R��p��<�����N��:����]�x�͗Ra녶�( O���\�������T�w#ƆN�li�ɹm�.�6�@`d�B��ҕ��������џ���
� ����۪Z���r���*��x�P��b�D��h�M�F�y��4p35�a
��'��F�
-endstream
-endobj
-12806 0 obj <<
-/Type /Page
-/Contents 12807 0 R
-/Resources 12805 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12645 0 R
-/Annots [ 12719 0 R 12751 0 R 12752 0 R 12753 0 R 12754 0 R 12755 0 R 12756 0 R 12757 0 R 12758 0 R 12759 0 R 12760 0 R 12761 0 R 12762 0 R 12763 0 R 12764 0 R 12765 0 R 12766 0 R 12767 0 R 12768 0 R 12769 0 R 12770 0 R 12771 0 R 12772 0 R 12773 0 R 12774 0 R 12775 0 R 12776 0 R 12777 0 R 12778 0 R 12779 0 R 12780 0 R 12781 0 R 12782 0 R 12783 0 R 12784 0 R 12785 0 R 12786 0 R 12787 0 R 12788 0 R 12789 0 R 12790 0 R 12791 0 R 12792 0 R 12793 0 R 12794 0 R 12804 0 R ]
->> endobj
-12719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.343 205.112 707.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af1921cd40fb0920e1173cf67418c63fe) >>
->> endobj
-12751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 635.762 190.738 646.666]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 635.762 261.85 646.666]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aed38463ae788879580d6372653452603) >>
->> endobj
-12753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 610.541 190.738 621.445]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-12754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 610.541 262.159 621.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8b99abb6e15eedbdb94e2466e8304c52) >>
->> endobj
-12755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.225 597.258 390.082 607.163]
-/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
->> endobj
-12756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 585.32 202.922 596.224]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 585.32 248.58 596.224]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab5dfec17f683d1cbe01cfc71d601108c) >>
->> endobj
-12758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 560.099 202.922 571.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 560.099 296.181 571.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af14ea5b6122685afd62a3df786512d77) >>
->> endobj
-12760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 534.878 209.547 545.782]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 534.878 261.831 545.782]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af7fd07f1f8d91c830130c061da7b6c56) >>
->> endobj
-12762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 509.658 209.547 520.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 509.658 309.432 520.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab7c86f7ff6b09ff72e3ee3382b4c933b) >>
->> endobj
-12764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 473.478 180.496 484.382]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae85fbe787fa3e172ecf6a63b2847d69a) >>
->> endobj
-12765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 473.478 280.102 484.382]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 449.908 213.153 460.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af2c70f89a472f7fa34ba64817693776a) >>
->> endobj
-12767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 449.908 312.759 460.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 426.339 213.163 437.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d1677ef76c939ca2025722d2ee249e2) >>
->> endobj
-12769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 426.339 312.769 437.243]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 402.77 205.692 413.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-12771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 402.77 261.312 413.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a81c8a26a02090eb4fb9255dd814514a8) >>
->> endobj
-12772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 402.77 332.156 413.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-12773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 379.2 205.692 390.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-12774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 379.2 261.312 390.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2d266342acc104c59dc0046242ccdac8) >>
->> endobj
-12775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 379.2 338.781 390.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-12776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 355.631 205.682 366.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-12777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 355.631 261.302 366.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a46a4105c8476e5f5260a775777398586) >>
->> endobj
-12778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 355.631 330.462 366.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-12779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 332.062 183.824 342.966]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a353fe86259fbb2dd09d451e9dd468676) >>
->> endobj
-12780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 307.214 192.272 317.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaae8e418bb3d7a1432117530eaea7ec4) >>
->> endobj
-12781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 281.993 189.901 292.524]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae3be22e7dcdf54fdc0fb976fd755d0c7) >>
->> endobj
-12782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 256.773 193.229 267.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a74d2b64496aa448a85ec0b370cee0977) >>
->> endobj
-12783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 231.178 241.935 242.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3905c42e02befd8a894c57abd9f972f5) >>
->> endobj
-12784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 205.957 238.459 216.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a22b6ac7ec1477dc82d6db22900b59be2) >>
->> endobj
-12785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 181.11 187.689 191.64]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad423a6ddce01a2f2efb34b826d0de921) >>
->> endobj
-12786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 181.11 226.693 191.64]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 157.167 228.895 168.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7ae373e57180f03b09aa0e38d1f19811) >>
->> endobj
-12788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 157.167 333.482 168.071]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 133.598 229.503 144.501]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1ae372d4f3b58cfa4af6edd51d845209) >>
->> endobj
-12790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 133.598 334.089 144.501]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 110.028 187.264 120.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e90a75aac44c14997804b8911ff7bbb) >>
->> endobj
-12792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 110.028 293.213 120.932]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 110.028 371.148 120.932]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 110.028 455.727 120.932]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12804 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12808 0 obj <<
-/D [12806 0 R /XYZ 89 770.89 null]
->> endobj
-12809 0 obj <<
-/D [12806 0 R /XYZ 90 711.44 null]
->> endobj
-12810 0 obj <<
-/D [12806 0 R /XYZ 90 650.67 null]
->> endobj
-12811 0 obj <<
-/D [12806 0 R /XYZ 90 625.638 null]
->> endobj
-12812 0 obj <<
-/D [12806 0 R /XYZ 90 600.417 null]
->> endobj
-12813 0 obj <<
-/D [12806 0 R /XYZ 90 575.196 null]
->> endobj
-12814 0 obj <<
-/D [12806 0 R /XYZ 90 549.975 null]
->> endobj
-12815 0 obj <<
-/D [12806 0 R /XYZ 90 524.754 null]
->> endobj
-12816 0 obj <<
-/D [12806 0 R /XYZ 90 347.158 null]
->> endobj
-12817 0 obj <<
-/D [12806 0 R /XYZ 90 321.937 null]
->> endobj
-12818 0 obj <<
-/D [12806 0 R /XYZ 90 296.717 null]
->> endobj
-12819 0 obj <<
-/D [12806 0 R /XYZ 90 271.496 null]
->> endobj
-12820 0 obj <<
-/D [12806 0 R /XYZ 90 246.275 null]
->> endobj
-12821 0 obj <<
-/D [12806 0 R /XYZ 90 221.054 null]
->> endobj
-12805 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F24 529 0 R /F66 3179 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12886 0 obj <<
-/Length 2674      
-/Filter /FlateDecode
->>
-stream
-x��[�s�6~�_�'5��A�@�3wi�I�Ns�{/I�CK�ĩH:$�D��o�)A��n��Ch
-\,�~�
,�h1£�/�u}q�2d#�d@���|$�(�%��5��F!
O��{3&؋�$�y3���V��������6�����?O�h������2�S�_��zIHK<�A���C:��ԯ\;dHD�|sL‹UT�	��I��n���y��*�t
-��d�cRj��]_|�  ��5
G�M������
n�0ˆI1�d%#�2�5zw��
\Y�-
ඖ$D<�����(�f�����	��f٪�����Zo�/�D��$�]�>͈�>`��YZ��"^ǩ���>��(�,ݗ%�K5&܃!c{�z��{����r��i���)�X�ݤ���I�J�=�'j���1���%��ʗ�X�gR
��U�������
�*�(j۶��W/%
d�f�}D �BQȫ%��u�5�qk8xH��e��<�#�2$}Q��RH�(�ً,]m��d�kl���a�L`^�R�Gn�(�qq\��N�f�� �+7[�
�aҨ�4Ć�r��ә��x��^�T��f���Ç؋S�$C�g1A��z�3=g��4�|Z�S�<K�K at i˫����>2�����eu���,
�{�>Z���:�
��]�����T�9��.
b�0 � +-��*N��٢j��!��u�f��;�7������ am�2 {�n�l���
��2�O� ��.�t�ˀ%Q+I3�~�ɀÀ�X��i8��!
ƺ
��9
�0�X�]����A�A
�7�A���*���_�G�/��_�Q��S
Yw��IlAQ��d�d��d��K�+�|�M5�T��4� ,ؐ4鱲$"C�
�
�G���c����
-�1�͞��pjQ
�.����X
g.#po�_3�&jvT��P&ul�}�zH���X<�q[���7*��0��
F���z
\T�
-W�Oe�q�O���>Džv���4���FXGv�'���f7	�9�#aٸp����R%*
,��Lۺ�����4�2N����Qi���2��u��ˍk����Xx�VT���c<	0>`
 !��g
�
x
�����
̚i
 �&d�a^,�T#鷚r��V{aB�}��QZb�e�
턻ܼU���8a@
�
1Y�ջ�h�&�ƉJ
1�o�fc�7
A�8]��?�����tZ�E�vT���Mu����f�
{��V��sЖ�|�wa��Fo<�_�h6�1��G�����À}B.�+� ��9�s6+:I�4�����[ �Z��뉲�#2ux���m���fΦ(U�7k��Li �!��D �!=v��
QZQ�# �8
tn�Y#;T�B͂:�N���!|(
�E��V<V�I�C�
=a��d��p�����t�A���E�CP�*	� ;Gbt
-r8G4��F��"_���?D;=B.��3�M�XHϙ�gڍ�V��3�{��ƐX���=|um�*�i��t�¯]�a��)��ǃEq\���\l��p��	��8�b�-�8I. at P�
%�0'
;�
�Lo�yD�ЯH����<L�|���\"U|�K��R"�-�.�ln�5 iɠ��5�)y�	K�>�L�����Q���g6Ð֓JH���$ƝJ�T��p�Η�U��:��
-"�b+����B��H0��K�\H񃧠�/7S������ ?<����_��!B�����B$CpX��b��j%�a�$��q4��S�43w$��&
.7w*���ү�R��aޫt�9&$�
��4�χ���i�8�M��
oZ���y�'7p�:��t��A��Z|u>�R������C���%
��:�#�u��웋���h��^�C_�'�W:�f
���"Zkf
t.
���w�mVj^>�?;�^'�`=Mx��1��
-�F��[��E�Ƽ�
�y�ec��6�_��bY��	�
�m@�N�9Oq�EC��[�{��	���n
!N�0?O{���h��ua��o���oc�&�0�C0�v�J`�f]5�]�

=>`�D�pă�i��g<���!! h��4��ߕ��:=<h�$'�	��<��$�a����[�~����Aï���"5�
-�=�Ѥ�C�&�]}M��р��E,x@���;'ٝ	-�M��Ј�O7�!���-��[Tg)T�m�}I}f�!�]�jUl��q��ۊB��oҊB��Bt?
-QW"G���H�+��^
j��~
��D{b�&:� �*·��Ļ:�t���CϜM�]=�D�
�v���{:���ۮ۬x�ĺ�3p��wjێ&{��
-�-J
�0j�c��1p�� ��:���?cB��{�nW΍M�#�)�_���B����|�����:���L��]0ʽ�|ũ<�_�m�C�U�r9 PY�Of�/t����ެ�rs�
-#"ZM���s��4��^T�"����Q����z��i�8�{�n��X��
 ��~.\
�rw<���ˊn�kG�浽��P��Ɯ{E�
�������AU�m>$��Z"0D�w���U��Q}���o�c�N�ɲ,�_]ݮ�Jh�%�
�z�p��G�L��M;��)
�Q��umG%k��`̏P
��4���ֵ��~��q�*a�o30�����ʕZ!
-endstream
-endobj
-12885 0 obj <<
-/Type /Page
-/Contents 12886 0 R
-/Resources 12884 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12645 0 R
-/Annots [ 12795 0 R 12796 0 R 12797 0 R 12798 0 R 12799 0 R 12800 0 R 12801 0 R 12802 0 R 12803 0 R 12832 0 R 12833 0 R 12834 0 R 12835 0 R 12836 0 R 12837 0 R 12838 0 R 12839 0 R 12840 0 R 12841 0 R 12888 0 R 12842 0 R 12843 0 R 12844 0 R 12845 0 R 12846 0 R 12847 0 R 12848 0 R 12849 0 R 12850 0 R 12851 0 R 12852 0 R 12853 0 R 12854 0 R 12855 0 R 12856 0 R 12857 0 R 12858 0 R 12859 0 R 12860 0 R 12861 0 R 12862 0 R 12863 0 R 12864 0 R 12865 0 R 12866 0 R 12867 0 R 12868 0 R 12869 0 R 12 [...]
->> endobj
-12795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 707.957 187.264 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_acb19de0243a618e9bf3d62e2ee04ae01) >>
->> endobj
-12796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 707.957 293.213 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 707.957 371.148 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 707.957 455.727 718.861]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 696.002 220.058 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-12800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 661.533 186.348 672.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_acfec639e917dfd6eb63c4006ac55b807) >>
->> endobj
-12801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 661.533 293.772 672.436]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 661.533 373.367 672.436]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 661.533 456.837 672.436]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 615.108 186.348 626.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a217e4addfae235df12c449320e65f891) >>
->> endobj
-12833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 615.108 293.772 626.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 615.108 373.367 626.012]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 615.108 456.837 626.012]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 603.153 218.404 614.057]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-12837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.772 568.683 187.446 579.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a508d952b878adf2e55d70d6ca1e64d04) >>
->> endobj
-12838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.73 568.683 292.979 579.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.431 568.683 370.447 579.587]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.745 568.683 456.762 579.587]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 568.683 513.996 579.587]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 557.102 159.485 567.632]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.603 557.102 240.62 567.632]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-12843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 522.633 161.677 533.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a35518da8c480784110d40b680256bd61) >>
->> endobj
-12844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 462.375 205.752 472.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aae058fd9619a17e121c3aab9b0612d81) >>
->> endobj
-12845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 462.375 276.595 472.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-12846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 438.491 209.627 449.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_adc269190695c1745ab086168fcf35835) >>
->> endobj
-12847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 438.491 314.791 449.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 414.981 248.202 425.885]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e09e7efc2f63aba534614086427bf49) >>
->> endobj
-12849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.018 414.981 329.845 425.885]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 391.47 212.377 402.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e9ecea59dea0ccb1cc3600bc11f1056) >>
->> endobj
-12851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 391.47 289.846 402.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-12852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 367.96 216.252 378.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aa493e3939364ce0db66b42f0ef6511d0) >>
->> endobj
-12853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 367.96 328.042 378.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 344.45 254.827 355.353]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1cd37a76428add108f267548ae76664b) >>
->> endobj
-12855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.643 344.45 343.096 355.353]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 321.313 236.745 331.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a594973c5284386e52b8c33b206a47907) >>
->> endobj
-12857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 321.313 307.588 331.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-12858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 297.429 243.37 308.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a580264341ec83f4bf3d6da1205939b0a) >>
->> endobj
-12859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 297.429 320.839 308.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-12860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 273.918 240.62 284.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6376a87e99d3cdabaa6ee7542474849) >>
->> endobj
-12861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 273.918 345.785 284.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-12862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 250.408 247.246 261.312]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aa317313059bdf973567d2fcf5e030212) >>
->> endobj
-12863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 250.408 359.035 261.312]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-12864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.173 214.942 290.391 225.846]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab88fa5dbd9a213a4826f1c766d547b55) >>
->> endobj
-12865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.876 214.942 374.291 225.846]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.612 214.942 416.339 225.846]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.628 202.987 229.044 213.891]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.291 202.987 270.018 213.891]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.505 156.562 339.621 167.466]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1910bb42882fe059a2ed18f5bad0a501) >>
->> endobj
-12870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.769 156.562 420.184 167.466]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.836 156.562 460.563 167.466]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.133 144.607 274.549 155.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.978 144.607 315.705 155.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.256 144.607 513.996 155.511]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-12875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 98.556 193.577 109.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_afea57a711a6b7a5d501112b84b246759) >>
->> endobj
-12876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 98.556 232.581 109.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 85.754 248.845 95.66]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-12883 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12887 0 obj <<
-/D [12885 0 R /XYZ 89 770.89 null]
->> endobj
-12889 0 obj <<
-/D [12885 0 R /XYZ 90 539.021 null]
->> endobj
-12884 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F39 2320 0 R /F67 3037 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-12979 0 obj <<
-/Length 3246      
-/Filter /FlateDecode
->>
-stream
-x��\[s�~���ө4��N �̴i�9i���ۗ$��e��T�Qv�����xo��ħ���	����.@����N>������O"1��j�'7����HZ�4|��|3��ξ��l"�!�jx�]���/n>����]}|s���[t�|�Df��^}�
�����&�k&?�Fۉ��o&�W���AZ�IӒL�ED�c�1/���+7x��䛹�t�4�t�[߅{(��>���k��>��]�
�:�w������ݽ�k��Ƈu|�I��url��
���U��J����O��PWKT�s�%��'�Fa�w���1�fs.����tH
�ϛuzwXK)_����\Ma��^��6��q���BC·b���I���
֙oTUD
�m~X�􇙈�I�O�Ǡ�n��A�܅,	w at Ba/ý��6I3�(k�)A�b��O0�M�1���}�
�i�e��t��W�x2��փ��&��AA�S�|*
��(3Y�T��,s�ƽ�L��,��
2X-�􅟥
����1�ߥ�fq��F�y��U��$̺���G2�H��Q2+&l�Ўݤ���ަ5>H��E���]�{mO���QD�avƩ&
,lDK{����v��޽fC3��вm���0��� �C
��,
!��"��� �S����,D�nCe�!�G�+�
X���fD,Uv[��n�y��.֫E2cj�c�<�f�}����`
-Vx]�5����h���:�H�d�hB#�e � ���3���iX�ꂊ���U���K���^k9�L9
-&���E�
�I���xr|<�BN_9���B���%M���$R�JgV�&k
֞
�he�n�S
��d���0���݃���NN(��N��^ ����
�b�L!��3�j
eG��FrM�E��*%�]SQ6���u���ϼ��k��itME����Y�)W��#���� ,��y�_ۜU@*�N��s9��
�����+�yW�!I��o9���ar;���>�d����L�|�
���r���2�"s��ھ�i����X1%[o����y���.p�}9�Wfk[ SX�
��4%��
d�&�q�E����
ת0�
e)��`�MQ�XV�KY]�K���5���R��sT���%ķw�Fߐ`�b �+U����B�aD0Y
2 i
8�ky�H����L��@n��Df�4v��#M�m|�5�
-����jY���P�Eʅ�?ʧ=Ό}�N�������!ɲ��Fo<v��}�KNJ-�Iz\`���}��uqHB�t
�I#E`�zaF�t�]��qw�c�����Һ�n�p��CW-eʵ�Nd�bi��r�l]#�&v1�[��L�RǬ�+�
�S]J��)p$���Ӑ���c
�m��ށ%~y*��lLU���0:̔'��w��+���Ӷ����x����ҁ�˧���s��F�X&��(4��M 
�8\Ʉ�#�SrOE�F��G�����a��-����
-����$�<>�4��~�(��j�x��v
D��"���i���� ��J��Ȧ
-ȫ�aۆ��2T6g�l�Q���	�.W[0ȝ�Y  !L��J4t\�;��br���5$z���k����,��3*Բ��5�2eŊ���Y��F�٬��>��@
U
��hF~	��F"i��a��ϐ���}��/�a���
�h�hڨz�9sV�
x�EU�%
XB����0�})�Њ*�W�Ա³0�.���_ �)��f�$3-����ͤ�p=ZCh[E= |���
/�<,�U1O�^��1{�(6�3Q컏���hAQ}��ҳ,���x#$�z�(K(M͇�J�N@�vͼ>F��z@r��- 	�� 	�t��#{y)�
-H���x)=��K/��9�O��o��I���67���+�Q3ӯ��+	-�����M�,�d�=o?�{w}8�)��,�����*t<K�Y{�n�X��UH��
-vp�ޤ!T���%>��R�C9
b��`B/|�53���@���ľ|�4[9��J9~��uYdJ�(ғ����9xJ>Q����s��A

0H�\F�E��`�hEf,bӷ!�4�
�B�2r22i�* VOw2��i&�k�p�NxF�8�	���C��Pge�SO�O�!�	�~�P����=�
®G�<@�'
-z^��J���l�T-��{|
-!ƃ����rw�Cy9/���@� DO>8<�‚v�e ��1<@�4<B�a�!B����y�:℀D�'N`/�8��;E+��`��r�}��C6g�m�w�
G`O�-G���x��)�O����V�]�|��y7������7j����2��@�Y`�|�q62>@V�-n�갔pq�

�f�I��fϒ#J����t�#�S�ɯ
�|<<�]�3�=K!�A�A���/`��x�6 
�c��P/xa�7��E�羬��BAh>���
��3$����z�B�����
�mEr��N}(cjP.�P.�W;X�
���o]��SǛ����R3b0�QxShs{R�h�	+��N
+ll�8P���Dh�5$�L_D���T��-d������dX���eC,���蒬�t�b�zJ��B��PejZS"?q
B&�!8P ����M�œD
	Jf��1OL�Vt���c��`h���cgEQg����E����ekQ�ѱ�cj���XȆ;-o(���X��$O�= P5�h�c�Og��ps�
L���#�6c�m� X��6\�H�r�k	T�q3�Y
�9�,R�����i�>����Qm�����Q���0*^G0� \w�f�Ѐ�?o�欪.*�D�!�
�E"U=�F
6g�w�_6y�X���<��.T��.�����:4l������]�@�5
aco�R1�xÈ��o^U�7�7m��\��)��ن�X��e�7�6��
���7M�ڤj=Ԧ�
�3Z�q��J
)[a|Lyl
�e�J�y��;a\ʢ���k�-�
�8 $�P�����#.-��|rHM� ���l�qPG��:��8s����W@[��zC����h��K�9��V��K-/�c]����\Ŕ�����$�'0��m� �g��{���s��
V
�sN�%x�u���%�E��1�+}v7�g
��b��
tVt7���E���D�ϔ1"aUB�:�8_}�����,9�_l
-,��q�������-9G�q��A:�N�I�r��$���T�P�,������������,I��r�=��c��� �(�f�;�^�³�GI}��
�jQ
-endstream
-endobj
-12978 0 obj <<
-/Type /Page
-/Contents 12979 0 R
-/Resources 12977 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 12645 0 R
-/Annots [ 12878 0 R 12879 0 R 12880 0 R 12881 0 R 12882 0 R 12907 0 R 12908 0 R 12909 0 R 12910 0 R 12911 0 R 12912 0 R 12913 0 R 12914 0 R 12915 0 R 12916 0 R 12917 0 R 12918 0 R 12919 0 R 12920 0 R 12921 0 R 12922 0 R 12923 0 R 12924 0 R 12925 0 R 12926 0 R 12927 0 R 12928 0 R 12929 0 R 12930 0 R 12931 0 R 12932 0 R 12933 0 R 12934 0 R 12935 0 R 12936 0 R 12937 0 R 12938 0 R 12939 0 R 12940 0 R 12941 0 R 12942 0 R 12943 0 R 12944 0 R 12945 0 R 12946 0 R 12947 0 R 12981 0 R 12948 0 R 12 [...]
->> endobj
-12878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 708.331 193.577 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a107c769c3c982506e2abf6979b9e92f6) >>
->> endobj
-12879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 708.331 277.691 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-12880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 695.373 247.177 705.278]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-12881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 673.176 223.465 684.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_abfde1aac87d8218fce0fa9b4ea8a5eb1) >>
->> endobj
-12882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 673.176 323.07 684.08]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 649.354 229.552 660.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aec298ee7df246c945e6a56442e04176d) >>
->> endobj
-12908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 649.354 329.158 660.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 625.531 266.673 636.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_abfb434e3d574f4bd53314ac8749c4731) >>
->> endobj
-12910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.01 625.531 366.278 636.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 590.75 299.171 601.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a79864149b95e4560a85aa80eb9c1303a) >>
->> endobj
-12912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.508 590.75 398.776 601.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 555.969 217.109 566.873]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a72782e7d9a6612efd73b253b0f862c6b) >>
->> endobj
-12914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 555.969 316.714 566.873]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 532.147 271.126 543.051]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0a0d8c78069019f44dc34ebab82ecfc6) >>
->> endobj
-12916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.463 532.147 370.731 543.051]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.863 519.563 326.259 529.468]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-12918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 497.366 198.26 508.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_accc6c6488ea9d8555ea8e978cf188749) >>
->> endobj
-12919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 497.366 236.665 508.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 497.366 353.317 508.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 485.784 246.458 496.315]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-12922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.562 472.826 267.759 482.732]
-/A << /S /GoTo /D (index_affine_relation) >>
->> endobj
-12923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.583 438.674 222.689 449.578]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4b561b7d32821298049fd05598b965f3) >>
->> endobj
-12924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.988 438.674 261.176 449.578]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.804 438.674 355.22 449.578]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-12926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.95 438.674 395.676 449.578]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-12927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.268 426.09 288.464 435.995]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-12928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 403.893 212.768 414.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aba9abb279871c30a4f0c6cbb188fecc1) >>
->> endobj
-12929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 403.893 252.959 414.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 403.893 375.145 414.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 392.312 286 402.842]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-12932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.657 379.354 275.748 389.259]
-/A << /S /GoTo /D (index_affine_relation) >>
->> endobj
-12933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 357.157 250.099 368.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a934cc1f45a6d438f5d468276140cd5a8) >>
->> endobj
-12934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 357.157 289.446 368.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 357.157 379.512 368.061]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-12936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 357.157 513.996 368.061]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 345.202 416.369 356.106]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-12938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.255 332.617 484.66 343.574]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-12939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 310.42 250.748 321.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a196d1efc79437ca1d96b79b7cd60387f) >>
->> endobj
-12940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 310.42 357.317 321.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 310.42 456.145 321.324]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-12942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 298.465 202.344 309.369]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.359 285.881 470.793 296.837]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-12944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 263.684 239.984 274.588]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab499fba7b7be2932147748248180e057) >>
->> endobj
-12945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 263.684 280.82 274.588]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 263.684 405.104 274.588]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 263.684 513.996 274.588]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 251.729 171.361 262.633]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 251.729 478.077 262.633]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-12949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 237.936 432.092 251.094]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-12950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 215.745 261.881 226.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a702b00ff42a88c23ab25eecf0e9acef0) >>
->> endobj
-12951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 215.745 300.286 226.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 215.745 388.504 226.649]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-12953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 215.745 520.199 226.649]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 203.79 416.369 214.694]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-12955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.141 189.997 414.324 202.162]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-12956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 169.009 261.881 179.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a25f104e58f88e05dfcb905bcd66e493b) >>
->> endobj
-12957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 169.009 365.272 179.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 169.009 460.793 179.913]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-12959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 157.054 202.344 167.957]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.222 144.469 466.67 155.425]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-12961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 122.272 251.209 133.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d4db6f54c7332e1a2e0bc85e16ba176) >>
->> endobj
-12962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 122.272 290.549 133.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-12963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 122.272 409.969 133.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 122.272 513.996 133.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 110.317 171.361 121.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-12965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 110.317 478.077 121.221]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-12966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 96.524 456.992 109.682]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-12967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 224.57 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a44e10aa0180433db7d19fb8e473dc829) >>
->> endobj
-12968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 74.333 324.176 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-12976 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-12980 0 obj <<
-/D [12978 0 R /XYZ 89 770.89 null]
->> endobj
-12977 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F39 2320 0 R /F11 613 0 R /F66 3179 0 R /F42 531 0 R /F67 3037 0 R /F38 3426 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13057 0 obj <<
-/Length 2644      
-/Filter /FlateDecode
->>
-stream
-x��[m�۶��_�O�4c� A��gƾĩS����IS'��8�	E0$���Y �D������'Q$���>xv� �x1���G�.G�^�t�#߱������c��s�_4�8!�x:#�����I����|j�H�K
�a�6���|����y.D&��2�������&�%޲|�8.t����tF =Z�ip9 �G�2��}Β�(�3�a�[�ʒ����~��)�&<��-�S6�1�2G�]����D��!��W����q�cD}o|��ƶE�7_��>•�����>
{0Z�V��a�p��@O5�E/�jإ�::^�-�!�1:��15�­F6r�g�˸Ѝ:�[�iU�ɧԝ��&)�q��b�ݔq��ƶT^
i+��\��?���xf�i��P=���
�适ĥ��өhڄi4$�0���i�
��u}� u�����f�X�16�I�b����X�
fխ�Kq�ݎ�Ǔ�<̂P��/D>�3<iQ���S8�^�
��ĠU�t�o�5y%n҈G��� [...]
�շCvk��V�⹄��������>�*Q{�"Gt&��a���ź(��. �\�a�\�9/:����h�A�+���6ݮ�nR	,
5s<Qz�;.�A��.E� �S��J�D_)\�iKC���M�$�e~����H�۷�#"��0B��_��\�hd�Ej�*2>��$�Q%�݄�RCc��|^�ܼ
Εڻg�e!�&���j��ȂB�x���ـ.�oPg9�JHu\������_l��o?g�ߝ���o.l�u����Z�=��J �]%��9�bY�����j�'
-WU����,��􊾪\�Q��+p�L9
He!�#��I$T
��ҍb7��1�T������)���m	+�
2H�@
-\ L
-8 ��fݐ"%D��b{�Aе�׆�ָ��
b�
�A�ݘ&'B4�n��q�p��4\Ր�ALC��!
z��7�E�TS���hTw�Я
->���e^��G~�D^%���8Rg�b�E�U��4d�90U#�E��N���D"�
�A�D79ߒ�
?�>m���^*�eݩ�WE�\џR\�uD�|�Ɍ���S����u�
�X��T6��
{35<X��%=Y��V���*e�N
g�8�<�Y�Aw(Tf�
<��/g])=<�
�a�V^>n�ia�<zz�w-3ɞe�w�*Ӧ��{�K��"��D��c�Q��B�(��jg��n�kd6-
��(%����dJoJ��2�ޔ˼63���o�i7�0�鱳�:(őr��zڞ��6��Gr9��zf���  �1vP���T�#�[���m�8*���˻a��O��.������������ڙq� v������lX��p�<��� �����e��~w�rQ�a5I�)D�c=e�
e&�=�
w�Ճ�N'�*.yTc<4�8��ǟ�_�[�D�."G�̋�pa>�}�j�QhaQ�#�7�L�,��V�(���Z��d��n)�������^v��"L�!(᪐¤���׺2׼�zE5>�+�jT�x
�C�Em� M�~�� �
��
KS�����j)a��֥KP�h�M�3L�^�]�c���l����T�>f'�Yg
���r�Z#�a [...]
��KKu�LP�|&����
�
��6
��! ���{��f�k�\��{<ει�2n��
	�R��l��vi��(}� �.wc�
���Z$;Ў[2��(�2d;���e�'��j?��86�Yo��#!��;�k@�����J�y��m��=�����³9�r��٪U�L�v
K{�f=�/�Œ�[�>�(S���^Nj���Z��pP�~F7P?o�~U�XT%��t���� �9xn�ZzL]|�
��S�v!mu�#��=W+���!��
z�.=�
0�c�>zX�$av$�l�&�����4�U
\��?8���e>�Oa-�YN��2�V�* ���>���|�+!�LT{^;��:�?�zE������ir�3M7��{���{S�n,��o�Q
:Qw�z��;Ys��:y7T�v�
��lO�
4��)�t
��ϘD<=Bڐ���}@�"�+�� uF8�l�C.��;f�=�n`¯NH
�<���� Z�����VN{@ �v3[���J��o��?
-�%7!
S�Io
mJ�T�4� ��)gR�
n�����\�U��X'��k�W˲̞?{vu�(x�@s�ڜA-=|��:�_�P�97���+��A�6cG�	r
�X����j�k��k�мX�x�fE��
-0p�۟���
-endstream
-endobj
-13056 0 obj <<
-/Type /Page
-/Contents 13057 0 R
-/Resources 13055 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13062 0 R
-/Annots [ 12969 0 R 12970 0 R 12971 0 R 12972 0 R 12973 0 R 13059 0 R 12974 0 R 12975 0 R 13000 0 R 13001 0 R 13002 0 R 13003 0 R 13004 0 R 13005 0 R 13006 0 R 13007 0 R 13008 0 R 13009 0 R 13010 0 R 13011 0 R 13012 0 R 13013 0 R 13014 0 R 13015 0 R 13016 0 R 13017 0 R 13018 0 R 13019 0 R 13020 0 R 13021 0 R 13022 0 R 13023 0 R 13024 0 R 13025 0 R 13026 0 R 13027 0 R 13028 0 R 13029 0 R 13030 0 R 13031 0 R 13032 0 R 13033 0 R 13034 0 R 13035 0 R 13036 0 R 13037 0 R 13038 0 R 13039 0 R 13 [...]
->> endobj
-12969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 708.28 347.869 718.186]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-12970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 696.855 196.297 707.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1d5a47e2290eea8e036bd1623aba53d5) >>
->> endobj
-12971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.439 696.855 279.215 707.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-12972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.718 696.855 432.878 707.759]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-12973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.827 696.855 513.996 707.759]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-13059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 684.9 216.491 695.804]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-12974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.094 684.9 362.977 695.804]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-12975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.254 684.9 475.081 695.804]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 660.173 164.537 670.078]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-13001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 648.748 273.129 659.652]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a52516b2247ed249d7989a7048a677614) >>
->> endobj
-13002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 648.748 352.41 659.652]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 648.748 495.961 659.652]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 624.551 275.007 635.455]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_adbbe0f9a58b8cfa5c92d54082f2955f2) >>
->> endobj
-13005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 624.551 362.877 635.455]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-13006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 624.551 472.148 635.455]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 612.596 233.986 623.5]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 577.44 255.564 588.344]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad8d04d80653fb850dd92468af1995f97) >>
->> endobj
-13009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 551.251 257.637 562.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1d780ef5b99cc9752eb322353b7b6b08) >>
->> endobj
-13010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.974 551.251 357.242 562.155]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 538.48 378.454 548.385]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.897 515.099 257.434 526.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af53fae5a9b3291b56e90e544402f2c0b) >>
->> endobj
-13013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.367 515.099 356.635 526.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 490.372 378.454 500.278]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 478.947 257.786 489.851]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9b7061aa20aa4b513216bcdb1a905ce7) >>
->> endobj
-13016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.123 478.947 357.392 489.851]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 466.176 375.773 476.081]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-13018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 454.75 214.06 465.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a173628da404c1dc2c4d423cad7f9f960) >>
->> endobj
-13019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.398 454.75 313.666 465.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 428.561 305.745 439.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_afa62abe41a99d6a01cca319ed860bb5b) >>
->> endobj
-13021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.887 428.561 404.156 439.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.568 428.561 521.395 439.465]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.489 403.834 302.72 413.74]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-13024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 381.45 245.911 392.354]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a46d5dc7df45abdea275f0295fee58c23) >>
->> endobj
-13025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.248 381.45 345.516 392.354]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.346 368.679 393.257 378.584]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.84 357.253 291.592 368.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a87aadd3a9d47e978a32c9867b13220a4) >>
->> endobj
-13028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.409 357.253 392.678 368.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.169 357.253 513.996 368.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.622 332.527 310.533 342.432]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 270.594 289.866 281.498]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a703f57855b17ef63b28f88fe13a51870) >>
->> endobj
-13032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 270.594 359.324 281.498]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 246.397 290.971 257.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a204fb0538d07ee8ac3d5f2724419928b) >>
->> endobj
-13034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 246.397 360.43 257.301]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 222.201 224.003 233.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af41476c22751c8d79e8599443aea93da) >>
->> endobj
-13036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 222.201 323.608 233.104]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 209.429 272.49 219.334]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-13038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 198.004 254.15 208.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af3135ed5b5cb04d1e8a54fa9be77b90f) >>
->> endobj
-13039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 198.004 338.263 208.908]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-13040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 173.807 284.585 184.711]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aba8ba56b075b2be7b6309cfaed039070) >>
->> endobj
-13041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 173.807 354.044 184.711]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 137.655 241.726 148.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_adb81ef7bfbf3fbe1cedb4776c558c869) >>
->> endobj
-13043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.617 124.884 407.658 134.789]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-13044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 113.458 249.318 124.362]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a100662089d61a01ea43a28a944da266c) >>
->> endobj
-13045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 113.458 288.321 124.362]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 113.458 371.519 124.362]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 89.261 240.62 100.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6156f452e023eb181658f23bde09ec15) >>
->> endobj
-13048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 89.261 324.734 100.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-13049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 89.261 389.5 100.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13054 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13058 0 obj <<
-/D [13056 0 R /XYZ 89 770.89 null]
->> endobj
-13060 0 obj <<
-/D [13056 0 R /XYZ 90 592.851 null]
->> endobj
-13061 0 obj <<
-/D [13056 0 R /XYZ 90 470.161 null]
->> endobj
-13055 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13123 0 obj <<
-/Length 1999      
-/Filter /FlateDecode
->>
-stream
-x��[[s�F~ׯ�/.���{e�L��6M:�%Ic�)�h�X�L(�j���,W!!�<��~��g�����`kaa����7�Y
-)�:���Rؒ\!��/��dsL���l1�ED90+����������̽���ї�[�"� ��k��ѧ?����-��r��|Phq��si��~�R����7t"D"fHB!��)��մ|�DJbb済;n�m����˴�p����qT"�U5�E1�%�A­��nV:�B=�P��?:r�$������Ɯ��H:Ԛ�9J�b��c��8�K��'�E�ҏ?��O��zL�}���lD�N`����tGi�xp-m9���
�G���
~��g>�5��b�E�8<�GeB(r�3����j贐�Ņ���i�EL�q0k�Z�)��ŗ�w

�冦���0��Gx�}_�Մ����!�y%�3ƬKQ�
���e�v�I� u����ۈ1�
)E�a��#�ٷ�y�6��

H�9B��01vAdo�ĉ� �HO�v{&�g�4��D�K�����-�[lЈd�u���:m�F�ΞM��-ŀߍP[,�cx>��~���|G œ&@�Į8Q���s�$w�-�?�
-R������cڅ'�njXtQ
-^#�*�.K2�8��~�p-��x.�7�#*���G�6��Tš0�dM>�,�`�S����K{Y����WR|��fY ��G;{
����
��������{!���RX}j�bK�=sB�z�����ֳ�A6ϸ�
�q��2��̲l�D�V^��A����!�x/+�y��gebU.��_��� �W�Ѓ\�˿��e��A�i�gF���Rol���&�} �w�νeZ�~0�\[.�QRx9A�ڑQ\�H�L�zf���
f���E����}xX<��KS�C�)��⧏ڔ~
mE
-��1(AJ��]��]kte���_jCŠ��o�Eю���
QF�C�(w����e�y�@p��i�%���)����c���JB;�O�x�vԎ�@������ŋ�0BW�\�l�wh�>�-���~�y�8�������E�K1�#E�1Ү�.Mi�r���;�g١h�r�" j���:[���5!�ḯ�b��}�i|X�^�	��������2���M��gw������phph��V1qv孺� hTD��uG�m�vh��c�j)7
Rb�a��\)6P�}�P,�1\U[�w����>僈�C)-��}�\�4���و8��(@
-�.D���0��NH�$��y�Q��nq��)+�yg�-�K��9��� ��>0R�^Q)o��i�6�<�A�����<���޻'�o
�0@=��8�W)��[�!7��'ƨΑ�c��s]\�ʲ?5�N�^�p����2Ӈ�QL���"� ,�1��1�
]�2���L� �<s
�i��9H�
t�.��/C�ڟ�[�g
=��X!FE/$	��4�4��q���י��z��؜�å��@:��5K��M�<�Y���&L($�ߏ &	�!����m�4v�=��}�בD��Aҵo�Arx����g��x����:�����1a�q�I���߼��� r͟A�CU�]i
u�t at lB����Û:�0��]�4S�zY��L8^&��
�.��1���eg���h���%-�'Zޡev|)��hY<��-h�ܚ����R�����M��rPD�ˌ�!^��
��
Q2l�;d
-4�=����}�llb.�mF7 6�N�p�s��O
-Aڡnc�
'Ϻ��ܡ���\�SQ����g �A#�^ϖ���h���]�D�?�Ha�� v)�%v�X?��Vjx
V�u"�S�}g'��Qn׸:�K���P���{���W*

-V�C_�ؘ�%l
��_F���������jNy��mȬcֈ���I#�zQc�b� YR�)r��Ƈ��oM�:�v,����޺z�߰�߆Ct�<�	�j��>�v�+
z�U���y�E�"����w�e�秧�E������N�LV
-���j��~�.��yrm'x� �	V�
-endstream
-endobj
-13122 0 obj <<
-/Type /Page
-/Contents 13123 0 R
-/Resources 13121 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13062 0 R
-/Annots [ 13050 0 R 13051 0 R 13052 0 R 13053 0 R 13080 0 R 13081 0 R 13082 0 R 13083 0 R 13084 0 R 13085 0 R 13086 0 R 13087 0 R 13088 0 R 13089 0 R 13090 0 R 13091 0 R 13092 0 R 13093 0 R 13094 0 R 13095 0 R 13096 0 R 13097 0 R 13098 0 R 13099 0 R 13100 0 R 13101 0 R 13102 0 R 13103 0 R 13104 0 R 13105 0 R 13106 0 R 13107 0 R 13108 0 R 13109 0 R 13110 0 R 13111 0 R 13112 0 R 13113 0 R 13114 0 R 13120 0 R ]
->> endobj
-13050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 696.002 255.714 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a65fe7fbf38e2395261aefa548bf71e94) >>
->> endobj
-13051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 660.294 278.538 671.198]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e984df6be52ebfb7284efb4c31d8e76) >>
->> endobj
-13052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.353 660.294 300.953 671.198]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-13053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.2 660.294 341.927 671.198]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-13080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 592.711 203.075 603.615]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 592.711 296.324 603.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a38da38d0fab7eed9ee09fdb11f88fd15) >>
->> endobj
-13082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 564.973 287.856 575.876]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a51fb0220102e525b11cdb06dcbe322c7) >>
->> endobj
-13083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 537.234 294.481 548.138]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2f13e4ffe7b47ec50721791877b41622) >>
->> endobj
-13084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 428.661 226.034 439.565]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad9e4b27a90287bc7f17da3de37be34d2) >>
->> endobj
-13085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 428.661 393.444 439.565]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 388.968 156.281 399.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad597da38af773e6cd9335ffd866fa32a) >>
->> endobj
-13087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 388.968 232.365 399.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.143 388.968 349.411 399.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 349.274 180.54 360.178]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a634913398afa411ada69f973e0acdb3f) >>
->> endobj
-13090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 349.274 280.145 360.178]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.444 349.274 420.713 360.178]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 309.581 178.239 320.485]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a197fc2645bde64519a993bebc73f2caa) >>
->> endobj
-13093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 309.581 277.844 320.485]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.143 309.581 418.412 320.485]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 269.888 245.522 280.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9a6c3fb1249ffaf38f7ed7498c138557) >>
->> endobj
-13096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 269.888 325.229 280.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 257.933 186.179 268.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 257.933 326.746 268.837]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.876 257.933 430.433 268.837]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 218.239 245.522 229.143]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a11b4e4651b98d2af87bbc3ac55d76bbb) >>
->> endobj
-13101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 218.239 325.229 229.143]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 206.284 186.179 217.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 206.284 326.746 217.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.876 206.284 430.433 217.188]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 166.591 245.522 177.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_afb32b5b308dcb625f5a62006c6f3625a) >>
->> endobj
-13106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 166.591 325.229 177.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 154.636 186.179 165.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.456 154.636 330.724 165.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.075 154.636 437.631 165.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 102.987 243.605 113.891]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aee949687b91366506561d398d257483b) >>
->> endobj
-13111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 102.987 323.607 113.891]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.032 186.179 101.936]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 91.032 326.746 101.936]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.876 91.032 430.433 101.936]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13120 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13124 0 obj <<
-/D [13122 0 R /XYZ 89 770.89 null]
->> endobj
-13125 0 obj <<
-/D [13122 0 R /XYZ 90 611.541 null]
->> endobj
-13126 0 obj <<
-/D [13122 0 R /XYZ 90 611.541 null]
->> endobj
-13127 0 obj <<
-/D [13122 0 R /XYZ 90 582.154 null]
->> endobj
-13128 0 obj <<
-/D [13122 0 R /XYZ 90 554.415 null]
->> endobj
-13129 0 obj <<
-/D [13122 0 R /XYZ 90 486.574 null]
->> endobj
-13121 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F11 613 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13214 0 obj <<
-/Length 1621      
-/Filter /FlateDecode
->>
-stream
-x��Ks�6����ŕf"o����5I��Mܓ���#s"�
-E7ѿ�o�2)��+�<I"�v��a��5���j�����b�FZRi��4��HH�5�.�#�Gc�1
��
:�ҙ��(
�͕;
��[�2t����N#g
��b���Y����oN_RO�FR*�<��$)Ri�HyV�|�
�Y�_�$<[8��hLa���j�Dnr���
G�
��.1�Đcfd^��
��I�"����rp�[3���ˆi��ZZ�2�\X�
pja\��ĕVJęm)B�7��"�<{,~F!�01�؈K�ie��`�T�*Ĺ�e�$���wC�Y���t33)l̔�z�|l���
�E8G������dL��0�� -DR�2�UL_��S޽Xc��н�.��������
��	�7�+�L
��(n��ʝ~6���&\//�?�
R�g� >x�ҥ~���(
�Xlƕ����,�hr,�鈈�f���T&��W��$
�wLM��_G7)=fbJ��w�MVPpJ6J0��6�nԮ"��[�w��]�E:hB����[T%����H
-�F�������^������
��I�V��f�&-%�c
�U���3)&���:rSRFWi
�5J�I�+�u�F_]��,�K�A��r#|K�Tڡ����
�[
�:/��!E �ׂ��,��b����6`���\����֪9�b�4�AD
\�Ep�݀�%w���7q��M�5:q��6��6�N��
-��;\BW�jWW#�'�v��ܡ��
�F ~�X'ݱn�>ֿ�ٶd�fdS��.92�x��x����E�6j��6AT��(�y!�5hSL�B�"J�<S�A��Ԃ6c�
m�$��HIU
?۱G
�
P���4QǛ/��ğ��5i�*C� ��q�mR�\@�+�Ѓ*lF�l�e
A}���J�
lɐDŽkbC��Q���j٣G�M5
�v�3z��H�u��
��f3�	����p���Ty�Y����q9؞�5� ���
�l�ѰX`���B��KXb9�;$]z!�#�T��ˁX�A�8��mА7
u�L#���N�+�l�����ʂ�:Q>}�+�1p?pn'9�]�?�vt��F�dh1��?�#����ӝ924���$��q)$w;2
/��b���|��@����[x�넭;���;�����
5R��
Rȶ:f���
RSS}��TվC*(��
R�4�)�L��y�zv����
g�����Uժ��K���OS6o���9'ED'[��"���y��sS��v�5N(Ճ�ۃ ۡ���L|�t&�1mOe�g��
���qs\��9���(�=Jz��Kd��
Y�'dG9!��;!��c���ӏs��ȳ(�O�z��(�Q�O�����G����e�ds�*�["�$"a�T��*yW��D߭*9|�S�>p�t�
�B[�b&��Y�)�M��h]�f�o���M0���[.�a �+$t�����ggo�/���������,F���L`���
�?+BjcZ�Fc���ͼ!i�g+���y���
_�H�<Ю�h�����z�v�9��:�Kzh����S&�Ya����ťA;Q���̎h#%�,��2�&�S4.Q�
��
L/��^2�y .^,�/��&
-endstream
-endobj
-13213 0 obj <<
-/Type /Page
-/Contents 13214 0 R
-/Resources 13212 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13062 0 R
-/Annots [ 13115 0 R 13116 0 R 13117 0 R 13118 0 R 13119 0 R 13140 0 R 13141 0 R 13142 0 R 13143 0 R 13144 0 R 13145 0 R 13146 0 R 13147 0 R 13216 0 R 13148 0 R 13149 0 R 13150 0 R 13151 0 R 13152 0 R 13217 0 R 13153 0 R 13154 0 R 13155 0 R 13156 0 R 13157 0 R 13218 0 R 13158 0 R 13159 0 R 13160 0 R 13161 0 R 13162 0 R 13163 0 R 13164 0 R 13165 0 R 13166 0 R 13167 0 R 13168 0 R 13169 0 R 13170 0 R 13171 0 R 13172 0 R 13173 0 R 13174 0 R 13175 0 R 13176 0 R 13177 0 R 13178 0 R 13179 0 R 13 [...]
->> endobj
-13115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 696.002 243.605 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af34d4911235992f1f10dcf2f772ffe05) >>
->> endobj
-13116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 696.002 323.607 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 684.047 186.179 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 684.047 326.746 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.876 684.047 430.433 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 641.982 243.605 652.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aedd7f0d898b4ab1df6dfa90605fede79) >>
->> endobj
-13141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 641.982 323.607 652.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 630.027 186.179 640.931]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.456 630.027 330.724 640.931]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.075 630.027 437.631 640.931]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 576.007 239.568 586.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a50ca45a8cfc186aa1fd90160b643d766) >>
->> endobj
-13146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 576.007 317.166 586.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 576.007 513.996 586.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 564.052 145.233 574.956]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.532 564.052 285.8 574.956]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.93 564.052 389.487 574.956]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 521.988 239.568 532.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a003331e749ebf3ac37f3d5d01005321a) >>
->> endobj
-13151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 521.988 317.166 532.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 521.988 513.996 532.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 510.033 145.233 520.937]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.532 510.033 285.8 520.937]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.93 510.033 389.487 520.937]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 467.968 239.568 478.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae3a252c7d19e09650769922c1874a2ad) >>
->> endobj
-13156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 467.968 317.166 478.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 467.968 513.996 478.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 456.013 145.233 466.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.752 456.013 283.02 466.917]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.95 456.013 384.506 466.917]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 401.993 180.54 412.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a634913398afa411ada69f973e0acdb3f) >>
->> endobj
-13161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 401.993 280.145 412.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.444 401.993 420.713 412.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 375.98 178.239 386.884]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a197fc2645bde64519a993bebc73f2caa) >>
->> endobj
-13164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 375.98 277.844 386.884]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.143 375.98 418.412 386.884]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 349.966 245.522 360.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaec5aac18085c547d9e8a207e2a91a2a) >>
->> endobj
-13167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 349.966 325.229 360.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 338.011 186.179 348.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.447 338.011 334.716 348.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.337 338.011 469.893 348.915]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 300.042 245.522 310.946]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad178f59cac52085594b73fcdff001cab) >>
->> endobj
-13172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 300.042 325.229 310.946]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 288.087 186.179 298.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 288.087 326.746 298.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.398 288.087 453.954 298.991]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.625 262.074 245.522 272.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad96422b035879adfe42f8ffd3ac2bcd4) >>
->> endobj
-13177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.848 262.074 325.229 272.978]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 250.118 186.179 261.022]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 250.118 326.746 261.022]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.398 250.118 453.954 261.022]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 224.105 243.605 235.009]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab030b7a285d9b5e6470263311eeb87f4) >>
->> endobj
-13182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 224.105 323.607 235.009]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 212.15 186.179 223.054]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.447 212.15 334.716 223.054]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.337 212.15 469.893 223.054]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 174.181 243.605 185.085]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5d905934786546ee29986ddc15e2536b) >>
->> endobj
-13187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 174.181 323.607 185.085]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 162.226 186.179 173.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 162.226 326.746 173.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.398 162.226 453.954 173.13]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.92 136.212 243.605 147.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac0753202309a8659d436445a609d8ebd) >>
->> endobj
-13192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.226 136.212 323.607 147.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 124.257 186.179 135.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.478 124.257 326.746 135.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.398 124.257 453.954 135.161]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 98.244 239.568 109.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a07210f7190db4ecbd9af64ae673e7c00) >>
->> endobj
-13197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 98.244 317.166 109.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 98.244 513.996 109.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 86.288 145.233 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.249 86.288 286.518 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.887 86.288 414.443 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13211 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13215 0 obj <<
-/D [13213 0 R /XYZ 89 770.89 null]
->> endobj
-13212 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F39 2320 0 R /F93 763 0 R /F110 1507 0 R /F67 3037 0 R /F42 531 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13243 0 obj <<
-/Length 3136      
-/Filter /FlateDecode
->>
-stream
-x��Z��6���?�d4f�)&i�6i���&��}j��lsm%��Hr7ۿ��=M{7i��
�VI
g�3�yXx���ٷ_]^<�F��BJP1���)<�\�X��z�K�1��z����%�-;���O�_�t���]|}y����G F2���_~ų5
?�dvc�3N\w�W����<�I�O
�Y2�� B
�)����k�
���ļ� .T�m���.m�y��7L
�Q�8OڅO݊%��Dv�n��Hs=_�G�s�#��
��tI����c���n�E�U���	�\�
A*���eY�V�YT(?{1�eA�vWY�cZd���:���X髴��M1ҧ_���$���V���	(a}��!_�jr& D�3�Q���=0?$8m8��a}���ź���e��VsG���h'B)���N݂՜��VeQ7��bդ��Hw
�

�)�B����6��
-Q�QuN#�{}
K��X&��4X�ǃ����,鄼[rǽ�>�����Sƃ۹���K�sy(�Y��z�USC7��['�)�� ��(a�/�=,�\��q��c�7����
-���o\�4�B�R�rL�)����
�P"[C���os
-~���+��1���C�;�dH�B
-��C���
�G|*7 �V��s� d�B���F�ѵn֏�uS�4w��?�r���)���G�u:}��XO��3��7����H�g:G�jzC46����M�Έ18��0(Ⱦ�$Fd� ��n�l�נ��S���}����c�

-(G���e�Dc
ŊO�3bR"ٛ��2�����<fJM�uD�[`��
�R���9�QZ��q�MAG�1����s8���Jp[r��
x�0�8���r�h� !��V��2���Ӱ`
-\6a�lY��|�D�����Z�1+,&H�O�	�9�D�9�j�{q�X�9k���/�a6��9�X0
���l��¡D�B�{�
��&���� �tLl�Z�P�ʙ���
�>�d
-"1F\�M�Fn\���YS��nW�i
�x���
�<��̛�d��q�՜Dz_�FR
v��v�ԯҀ�٪1�b��fź[����1�1�QԔ�X��f����[���]Y�u@�����cP<�f�_����*���
1��q� �Yװ3�`�� ��=ԡs2Z��P�╍<�9
�}�mYY
G�̜
�=���\�n�*s7h���64�6⏢��WpR�
X�6f_.��pC��8���
<��t�ݭ9Gs]g�.j{��zBK���X� �'[���vAG~�&k�~�g)����t����:[���Ay=�`���B��U>٦�녕�����nhB�6�@!��~�휿y��/I��/��3cⵕ�L�2�*͊��d�5�
-'���;8�\P�����_��w��v��L_l��K�V%r1'�
�|ʟ�]k���^�B��z�H
aE�x��kLyHD
X�y��P�h��
i�f��`((��{�HW`�C�N$됏�A�$�
�ǚ��>�'���Y��'� ��n3���	#y
�.l����n��X�NC����i@���!�机Ke���|�k!�Sv��V[�B�[/:��$��v>e|��U �dSqK��N�l�1
-�_��e��,r��{&
��lǺ�l&L���� �n��F`�a�5��� <�3w���#�zk�Ȝg6��ݸ��Cs3N۞Q{.�X=��!�5�h�v�Nܦt#�~_��3�#&&�# ͝�y��a[��F�<�~NW����¢aB�,4�m��-dnr"������Y� �Hݢj�Y
��'.�
-��NL�Lgw���ܴw���6J�H�!��l��2�

7z�swi
�|.��

(�|�k��@�d�;
-�Iy��X��[��N�N	�nޅ�*m�� �g+��P���昀�ˠ挱@A���X����;�-�iБs�2�l���8�ml�6oE>��X�B�t�i�IN�X�ďq�u}FcD��*�Y<�m[C��j*���4ڠ�!�l�<F����"b}��
���}�
-H	
&EP�� �$O��'�_��H��r �������2+�RS�ջ���$3Uy�'���Y���.�X�|$">���FV�"y���
�HKG6SV��jT��iZ���@q�v~���^��Au��e���r!/���Q�������Ę�lj��cP8��F5,�	1��rwFc�/]�$��(���.��\���E&䙡����%uq6����:�:3vaG�W���7f�z���ro�WBz��7�Br�<lv�:�b|f~,��Wt��0�\�e�7y�I�+�&�}�l��
��`�j:4ݡO��P�ʋ��y�;���@�n+wo�E�!&u��F�xqTVukafS
t���Y���t���t��
�X��
u�z������b��!�eM�k۱���]�<�9����
�ӈ��g��뽶Ɇ��إñj�&
��l��C�2
�na������+w��m�~��U��P㦆v':�sئ
�	�3�[�ԙn��]Cf�;<��VQ�P�+���c���a״8�v̉yx�.b�sߟ [...]
-��k�:�dTa
-��`�~�
}0�(�k+y/��c�r	:5�[�e*�t��
X0��_aC�m��`(]�fNx��0w:
��(9���Y��+��O`t�Y�!;��O
�fx	d���&�~%�\f�<������M�X�ŚOFL�� �p����{�"��~���]`�%������N����G��l��b=��[�ۯ��K��
"�5�����Ϳ�F�1��ȧ*?�š�gLZ�;S}Ӏ �����J�_V8��vl���֣~b����m��?z�<lj]lЪ̏��_V
-ᾅp��y٦�Yar�>�
� K!�2
-endstream
-endobj
-13242 0 obj <<
-/Type /Page
-/Contents 13243 0 R
-/Resources 13241 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13062 0 R
-/Annots [ 13201 0 R 13202 0 R 13203 0 R 13245 0 R 13204 0 R 13205 0 R 13206 0 R 13207 0 R 13208 0 R 13246 0 R 13209 0 R 13210 0 R 13232 0 R 13233 0 R 13234 0 R 13235 0 R 13236 0 R 13237 0 R 13238 0 R 13240 0 R ]
->> endobj
-13201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 696.002 239.568 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2b05cfa517e14902fe16c4c32c2cb543) >>
->> endobj
-13202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 696.002 317.166 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 696.002 513.996 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 684.047 145.233 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.532 684.047 285.8 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.452 684.047 413.008 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 659.259 239.568 670.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0851645a537132ba61da46cf65011cd8) >>
->> endobj
-13207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.786 659.259 317.166 670.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
->> endobj
-13208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.775 659.259 513.996 670.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 647.304 145.233 658.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.532 647.304 285.8 658.208]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.452 647.304 413.008 658.208]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
->> endobj
-13232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 622.516 156.281 633.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad597da38af773e6cd9335ffd866fa32a) >>
->> endobj
-13233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 622.516 232.365 633.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.143 622.516 349.411 633.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 597.729 226.034 608.633]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad9e4b27a90287bc7f17da3de37be34d2) >>
->> endobj
-13236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 597.729 393.444 608.633]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [110.861 265.75 170.418 276.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-13238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.941 74.333 313.447 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-13240 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13244 0 obj <<
-/D [13242 0 R /XYZ 89 770.89 null]
->> endobj
-13247 0 obj <<
-/D [13242 0 R /XYZ 90 584.262 null]
->> endobj
-13248 0 obj <<
-/D [13242 0 R /XYZ 90 535.559 null]
->> endobj
-13241 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13255 0 obj <<
-/Length 2541      
-/Filter /FlateDecode
->>
-stream
-x��Z[w�6~���Ӯ��`\�pҜ�m��t�M�}Ir|(����H��+�~7�DK���v���9

f>�|� ?
}yt�\�@!%�.��*���o&#���c<yuL�$.W�իc�'�r{������lV�����eRNj"��W7�:=~w���sB:�)UH	��O�H���^�rD�B�q/���qU
O)ǠL�I�Z/�:�O^��iyL�I�'�)�'!�Z������#jp@�[8�Q���޼��

�`�T|4B� �
������#�����`Jƾx�.��l�Y��	"��7q}b����u�ϳ|���I+�ڛ����L�*;�|�A�N���O>��hqm7�&7E�z��[�Hl|�جҼv��0��� F�Ir��WN�Ď���V�����G��I��`�<�8��U�r�%Y�A�%��˪�o���P{��Uu�%�>)r�gy��i�)<Z���	@�1��dQZ�
�� ��� �"�\8����(xc^�Ќ��,��b���[	�+ [...]
-�����V"B7���4
��%�ːHHJ�>f˥u�̅�]�ܽٞ��7��$	�pĕC�[JyOn0��B
p�l�4�o�`��=:���b
�GVa�s�o��7��<���-�xVl�����&w�A�x��&�,R'So���AL$A��
Ƨ���@ �Xd�H�$4``6턥��	�(�/X�8���?3����V��p�&
-
���� u(�
�L|30�Ћ��Y�*/�p��IT�&>�����ّ�0$U3�:0"���N?g����a�
��Ǜ�
cE
�i�MV
��B�����R
��_��VE�Ol��0+ ��~P�"ۂ�Iq7�f����˗b_�TS'`9�}�gאw\OY��A߇P�	���}�j�L���
��8b����KM��g�DL
-�+�8�k��h�w��uY�z�qM�lu���7{X��q7+��<+��w�"�Ԟ~.+,o�H��1
_�a(�%	�h����P`�>��B������\h����8������m��wq(�R�@'�R9�
_�Kw�-�lJV���a�n���-�7��mywe%�6t}�Q���c
Bps],��G�@cܯOhF��>у���
����W��60&u1TĢp_*R��MEz�"w#���;�.l�t�|��>[f���	&��-�r�t+7�z򾃳��{��_q��3��Y)�<��4f�-K�
-z<t{(?k
G�� N،��ߚ�SX�4�ז̆��o��~���q峸�V��"ZZ&�	wJ�@�qC�
�����T`<��a=�c�oݏ��n�(���'-J��P�n�E�����
K2��4D�FV�]8�Ӌ\yڝu/
P�$p
h�fn
xj8X������3]^7�r^����
/YBa]�����R�l|�� P�:�3��68|�[�%"J@�dOy

Y�v�\"\tvK�>r�}����%��M����203�&\�9�����
�q�T#PI*y$-uVƷV��w�zǾy�a��f��q�����th
��6؊|r��~P$FMR5 3��%���R��D��� "W�'�6j�Zi�&}o�tj���F�ncI'�
J�:��u/�������{���#-(�B@�;���!��<h���;��Plȹ�u��!�������~�. $����ΈG��}�I�L�vM:�G��u���g�e
�ΐ�R(w�s$��;���s�Ԇ�C����<K����a¶ӽ�h� �`��h��񚓂ݮIj�
�vTX���f�yl��
=�	#H���Q�h���p at E�D4R�&a�d�N��
G(ҭw�[{z�C����Ff�Q�7?j~_�D���k#*%
-i�$�3@�>b�j��ԽV
:Oƚ�9�>ެv7?����
<H�m~P�1T�?$��+3��|���R��w#���
��h�w&
H���4OK ���2m[ɾN�Q����LQ���k:
2 �o��������HL� �:����\� 4 at y���,Oߍh
%�(����o���2K���`SvH��c��d2v���#
�&�0�ҳ!�� ����;	Ͻ�U��$�}�o�u��R��F
-:	�K�H�	
!�@r���0�T��i\��[�R�
*fñ�TY��s��o�
-�x1$�^�8��Y���o�K�P��P�r3߬��vs�@����::K��Q� I�
��7Ț�P�7�i���?�8�e�1�Z��܇o�'ˢj;f��ˋ���́�����n0��zB�&<��F
OL����;@
�g�M" ؞��)�>��2CƱ�5��~Us�dw��z��l#6�oo�>�߯�
�|jt/,>�wCT
}M0>\�X�����e��w!} ��<�oBP���9�ի���o������׿�|�On5��o���t��+�E���f��#�w��{�)X�
��������l���|��b�K
:�P��
-t�!�*�f�
�B�U6X� 	A�'������H�$�׹7/�����
���_1�/3Oh
-endstream
-endobj
-13254 0 obj <<
-/Type /Page
-/Contents 13255 0 R
-/Resources 13253 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13062 0 R
-/Annots [ 13239 0 R 13251 0 R 13252 0 R ]
->> endobj
-13239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.725 678.378 193.232 689.281]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-13251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.433 587.338 336.939 598.242]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-13252 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13256 0 obj <<
-/D [13254 0 R /XYZ 89 770.89 null]
->> endobj
-13257 0 obj <<
-/D [13254 0 R /XYZ 90 255.937 null]
->> endobj
-12741 0 obj <<
-/D [13254 0 R /XYZ 90 232.477 null]
->> endobj
-13258 0 obj <<
-/D [13254 0 R /XYZ 90 232.477 null]
->> endobj
-13259 0 obj <<
-/D [13254 0 R /XYZ 90 149.975 null]
->> endobj
-12742 0 obj <<
-/D [13254 0 R /XYZ 90 81.969 null]
->> endobj
-13260 0 obj <<
-/D [13254 0 R /XYZ 90 77.486 null]
->> endobj
-13253 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F8 794 0 R /F24 529 0 R /F7 795 0 R /F90 758 0 R /F32 764 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13264 0 obj <<
-/Length 1999      
-/Filter /FlateDecode
->>
-stream
-x��Z]o�6}����f5�oR�6��ڡ]�d��h�@�G�-���4�~��d��,lj�n���utI�{�=�1��[z�
~
as
-�g���y>�%����󱧸�����{7�XN>�^yLjD|	O�����=3;3�F�g��#��G,�@J{�����-��+x1�wStZ{�28����o#�XVX�E� B�	F
-�":���8כU��ƒ�Ы~R)$��L���p�R|�!�݄q�'S����k��
�`{8��IN�
���A��O'����U�H����E����'�<X&q�:?�
-6]c �BT�}�(�ɪ
]vO�H3�Ma"}!
��L��e��
#��m�N�]@������L���y2!�8�;������]f��7CX�R��ֺ� |S!�F�(SU�ۉ��'��0�Y�~����g� ˺p���w^<0!bl
Oeb�}�k��B��֊?}����ɯ�����r��c�����"%�h� Z�ϻ(^Eq��`��W�^�&��|�yS��`]�l��b�0�1Ѳm�o���<I'B�Q�A�LH�r
�ªskR���	����:�s{%���2N�p�����f��V�þ$�0��<�_�}
ZZ�m�!��}��ݶ��͊R�=�ذ� V��>%�T
-יw��S���`{��}�}/���$���I�l
ts��SdcN��Y#��
l@���FGj�
‘S��<�$�x�
^���,A�o�{@�d]$�B��֔T
�t at q$���.��YE�(�'\* b0q	���h�(Y0�y6L?M�yd��|�O���͍
�E��f�&��5�Mb{)���ϐR��.�8&
-�mZCu����:4�\��_��{
L�/0��\`b�bN!������:#�����6���x�f��b��:�ͳ�94 ��+�.��3���;�hp8�
��3{�L��=˫��$V�Ш��
g]cVJ՞<Ǵҩ�daJiV��h�Eec_�i�gm;7��<]D@
�
>:�r��±q;ӽ��S$��j�D��Ȧ
"�"���8s��Ny_ߵ7ͽ�X�X�i�j]��^� �����9x�"}��Z�n)8$�!��s�["TsUw���ǚẌ��m��tw %މ+�o� �G��{��A��y
��	w�����{
�#e����<ܘ�fO��'�0C��^���5}��
�Y��5����)�P	
I�<�@,�U�(1�л�KBa���s�eI�Y�8>��	��O�*Z�C��TU���=�
ĭ
'�܇�jR'�$�{�N�S
�9s�9�JSߘ<�u�!n�
-��C`��SU����
�&۾���W���.�Iy/��X�խmfכM����6/��6��IQ���]!�\IV�WV�s6'k0f�11���^Q�#

���ܻθD\��������
�G�ez
��G��PM
�W���ECQ:�`|��q`c%{v9v*��W��s���;Q����\^ȯ$!�dPX�����z�
-�8�I������h��vtjǎ��w�}����^\��@-�˃
h�H2�h0���|�
-�
`AD� ��

�G��!Q9�hp��hh
�a��gS40�K4p$ٝd�b$��+
f`5q�v)����\*D�9i��l�Ӽ(/�DY�0��[���{
U
^ŝqe����0��"(��wՂ�_-�����a
�A��=b����_,tke�:��=�cj

9�7�e53ݟ$`��H,���a���KѲV��Mp�z
�ܶ
-㥮�7������
�E�
J\l�@��c�K$1;h�˪�7
���C�o�=
}�N}�,�D���o)��	*j��6l�*$����,���^
��yq�z��p�rͼ� �ᦀ7��䭍�r�������}\
yz�ڞ������N�s���U4�o�ͧ��$�h3
Ty��TY��ܚ�˨X��=�|����U�o���.��Y/�<Yߍ��a�\my�2I�1�$
+A
��,�_ �
-endstream
-endobj
-13263 0 obj <<
-/Type /Page
-/Contents 13264 0 R
-/Resources 13262 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13062 0 R
-/Annots [ 13261 0 R ]
->> endobj
-13261 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13265 0 obj <<
-/D [13263 0 R /XYZ 89 770.89 null]
->> endobj
-12743 0 obj <<
-/D [13263 0 R /XYZ 240.245 647.468 null]
->> endobj
-13266 0 obj <<
-/D [13263 0 R /XYZ 90 640.828 null]
->> endobj
-12744 0 obj <<
-/D [13263 0 R /XYZ 240.245 561.718 null]
->> endobj
-13267 0 obj <<
-/D [13263 0 R /XYZ 90 555.078 null]
->> endobj
-13268 0 obj <<
-/D [13263 0 R /XYZ 90 468.88 null]
->> endobj
-13269 0 obj <<
-/D [13263 0 R /XYZ 90 415.191 null]
->> endobj
-12745 0 obj <<
-/D [13263 0 R /XYZ 90 368.566 null]
->> endobj
-13270 0 obj <<
-/D [13263 0 R /XYZ 90 364.082 null]
->> endobj
-13271 0 obj <<
-/D [13263 0 R /XYZ 90 275.727 null]
->> endobj
-13272 0 obj <<
-/D [13263 0 R /XYZ 90 222.038 null]
->> endobj
-12746 0 obj <<
-/D [13263 0 R /XYZ 90 174.787 null]
->> endobj
-13273 0 obj <<
-/D [13263 0 R /XYZ 90 170.304 null]
->> endobj
-13262 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13277 0 obj <<
-/Length 2379      
-/Filter /FlateDecode
->>
-stream
-x��Zko����_�O]
-XM��ym�&�.��m��"�D[D%RK҉��{�����-���`p4��3s�{���� �_���x�d�FZP\�2҈
��
>�#�gs�1���b_��Q
���U�,���M����U|�g����*�&�OW?����<�	!ar��g7�g�H�z���F��z�_�!�Z�e9�S�L�0�l�q���_�ۤ�&���f<��4���.~�  �ⶅ#������'
,��� #�U���e�\.~��~��'��4���;`�6+�0�IR�;�_?,�m��Yi
ځܙ��`&�1

ĩ<h�=v������DD�@�18��0� �� ���
!�{
H�O"Da�=H��
w8=�"af`$��)���e��"
~����:.fL�w��$��y�;�#8d6�Ba9�@t�R�"D�
X��!�Q�[�ժ�g��_2wg�[��V���e�l\;�_�%YR�U^����g�W�װzt�L�}�*nF��6O��D�w�3��8�u�z��$2��朅y8�t
�X��oD��1����n\�	���.�����6��q�Gu��&�H��GL�/
�*}hvNv�`�
+�
��U���lH3����
-9�X3b��>�Do��7́{y���@5�(���n�a�<��$HC���/�d�LÏخ�
;9�1�U^�<�����P	�ϛ�X�7f���-�!��gN�w�w�ǯׯ���������ud�Z#�&	���c�^XG�M>&�u�H�O=�
�9���sJ�ʽ��>]/}�}�|��=o�|3��[F���0­Yەӳ��b���
z�����Q�2&���<�e�	NU�i�fwcf �q�
����� ���wy�V�����*/�z�����e����LÍX$��}�{gy��6Y����Cn
G�1'#{��E�#���;R��;gD�onG�
-):p�=��"�����#h�׊f�1�*��j�o�c1�KY�r
�̳l��<yB�+7�z����dw�4��ܤ����.���w�j6S_����f���
���f��C\�c��q��dh��
-?�+���NGL
o��#�;w�b�=��a�B��YI�p2�El��6�kP1gр�;DŚ6[�2KOX
Q��7����=���f�,y�-;�{_�&
��g
�c���@������b���e`4�C1�l�O�u�%�F�"	ѽ
��H�m"yb���B~B���ʨ�V�WM���}�'�+�A�Z ��4[%�ť���m�H܈e
-��L��}c'j�*7
=��U�M���c���e��~ȶ �.����j���l��_&��Խ��A����QwB59q�
§�J$<RL��?��q���aQGb����my%�8�*���G
-#��B`�$���pX�H���v�
Q�ʾ
Wu�m
��"/,����j/%��[��7I�8�~�������N ��O�U:��Sp�&q*���E����Q'�G��<����k�ժ�j�Vm��_�ޕ�eya�
V���I��}Y�l�`F)f�&귟�)xx�_>{/���-=�)
�وO�� �	N]cg�ؤz�J�W����		�D;e@����;����8^ag	����N�}�dw��:)�Y�8��>�����`�ue}��
-��u+�[Yg�g?���h�����o��=����i�È�a�T�*K�p�Ԑ����~�z���jK-D��	0��C"���>�|��S� s:�<�h����T�_������A����A�@
��3Ԗ�/��&�{{���wE�{(c�
`T{�OT��WĎb�������z�S��t�O��K�L��Jwy\�{uk��n�
*\ݲ���q
��T80xvd<��p�]�x*z2�
-'�h����z���t|w�r����ju<��x�Rkf��w�~����e!O��tD'�l'G�9
����H�y
�B�)�6�����4dTi�
i���h����]y���O�H�_��cH��45�s$bx.�T�Sb
b�3���&��Tפ?�x�^��#��lʪ���&މ�9��\�	�bR�09���^�zB���!ۉ�1z�l�nu�j�/�y�����h�ԉvM�r��ZC�+�a�
�
!�e7���:.�a"?9��v�����4��%E�
����{�^�q�3�J�iKhga������6Rvꯂki-D�?��� �y���k��L�of���T~����P�´�H
-��C'A��'��
~H����֏�[S�/�8o�lUU��/n��J���kW
u��Y6j�.�5f��4�N@�w�G5��!�Z�l����<�#�m�e���x�f���?��?
k��
-endstream
-endobj
-13276 0 obj <<
-/Type /Page
-/Contents 13277 0 R
-/Resources 13275 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13288 0 R
-/Annots [ 13274 0 R ]
->> endobj
-13274 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13278 0 obj <<
-/D [13276 0 R /XYZ 89 770.89 null]
->> endobj
-13279 0 obj <<
-/D [13276 0 R /XYZ 90 718.682 null]
->> endobj
-12747 0 obj <<
-/D [13276 0 R /XYZ 90 684.012 null]
->> endobj
-13280 0 obj <<
-/D [13276 0 R /XYZ 90 679.529 null]
->> endobj
-12748 0 obj <<
-/D [13276 0 R /XYZ 107.534 574.352 null]
->> endobj
-13281 0 obj <<
-/D [13276 0 R /XYZ 90 568.334 null]
->> endobj
-13282 0 obj <<
-/D [13276 0 R /XYZ 90 469.558 null]
->> endobj
-13283 0 obj <<
-/D [13276 0 R /XYZ 90 403.515 null]
->> endobj
-12749 0 obj <<
-/D [13276 0 R /XYZ 90 356.89 null]
->> endobj
-13284 0 obj <<
-/D [13276 0 R /XYZ 90 352.407 null]
->> endobj
-13285 0 obj <<
-/D [13276 0 R /XYZ 90 252.097 null]
->> endobj
-13286 0 obj <<
-/D [13276 0 R /XYZ 90 186.054 null]
->> endobj
-12750 0 obj <<
-/D [13276 0 R /XYZ 90 81.969 null]
->> endobj
-13287 0 obj <<
-/D [13276 0 R /XYZ 90 77.486 null]
->> endobj
-13275 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13292 0 obj <<
-/Length 2423      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���S+�x�����zw�$�k'V�ۅ@K�Ŗ"��Z��gx�e�.�4�)r��9g��;C#*�G
��?.�>�����{�,96�����`Kr	~��������;��
-dž����7���>���w�_/�����Zn.>��
-.3GY_�A�S�������e�)!��|f�������`�'���n�iQ.�ð�Q�$)e�K>� �HrUH�[/t7�tF�3�w r�lU�o
� 
�5b�l�!��e��K6��%����l�S�'n�q�S�'Q�_{��]|��c7�_]�,S�1
-�`1�\`F
a��	A�9����v�Gm��
��a�2f��%B
��6�S����Y ^�V�!��'����X��	"&�(L�tF�����E�18G��Ac�rD��*�m>�z
�?���!���o�����8����'?�/�7I�@gԶ�b��2{r
-��Ok�U��v-�T2���/�뛏�������%�%�"�h�@�U(|����/
hϪ^�o:�8�F򞶁���
�ʢ��mlڃ�_r8�iJޱ�Uvua~��ˏq�)��7o�c��	eч���}(/�e�S�rr
�&~��b?M�i~[M���,F���&~�?��|DZ"e��G�Ig���4�:G�
-ik��|�()�lco�'-)ӵ[���e�[yI�\�wr�N;TF7�Fk]g9��,r�*�
�� ��^<%d��x�cg����7��v��1�@�럍��u��;�p�=�C��*V�D�k��4���V��e�_r����.�'�x�C�)żӗ��]��4ʏ����ˇo��ae�9]�ޥ
�Ɉ�4:b�L�A
-��MD�7�k( ̨'�<Y=9Ƴ��۵�"��~��!����l�_)���a�^�&-�r����z���u9t
�,�6��[e���
�d[��@�X��'#v��筄���%�?��E|���)TŁrpD�L!*�A���J��&�c��J8d*z�!(���B%p$mD�X1�?)F�Y�c�d
.HN����/|L�
/��\L����S(�
-�1�-�mh[A��Oy at A#�P� आ~�u
M��|Ք������� '%{��&{����:x/���yng2�ZV]B�I���Q�������6�7rA���!X�!p����B%)� f����C`��ƍ�s07;�"����`�V�Gos�5����eZ������Y�q�K�<Y3m
-d����
o�H�}�S6,��La�9��Bͪ[��(
-��U�9'�i��đ��Czbu�[l�`�b���y�f
��a�
�|/�
�/� Vo�
+*9��ؓ�����
�H�b�il�l���
��BoN
��]��^��ä#w2���V5�w^G���q�_�t���k��`_о"=C���ꀊ��`ֹ��j�T3�!1���VJ ����w at A�,��}I�M,���tt2ŀ�)*GMܯ���)�s�d'��^6Հl��d�N�0(&T8
:�S�'����Z@��dٶ
E��Դ�U-UK^u@�.behj��p�*=
u6�f6R5��D�7[E�
bE�f~�{?(���w$�:}��C �
�O��9ȧt{�d�%ߡ��wd�Q�u��r�kF�Ox
1>�QL�!X�r3FUV
�r�I��_��ސ�?�H��H	P���7��ԩ��#�c����%��*gF)�)�
�N��;���TP��v���1������s�›��f]/3�4�U�%
-AQ036:3�J��QK�+`f̌��ma�����03j�`�1�15-�YK������,cf��V$�6Lga23
-y
�H���?���3�#��Ǡnڌ[��=��	��,�O�g]�ɿ"��y��
-l!�(3C&�3c�X�g�a
EA��Y��QAz6�CLP���+����7v
���EoR1�_������֑W���

�|LvW#�C�tn�T�F�FԳ�v��'R;C�>jgF�A�#e�pK�mD�{���$
�՝�L��#��Ǹ��Y����P`�61I
MR�nR�Lҁ�e�Ƭdi��(\��n�v��\��C
��c�ch�"�=?D����{�+ǸT��ҭ�~�O�[n,�!ZTaagP�Q��O��c�`Y�p�Ykn�\�Q�[������������Y��5wi}[��
�l洿o
�D�â�nJd~V.Fq}
+?|,�H�ү�v0

Ǣ�������-[�7&�гQ޲�;YϾ�����
i<�%��l��W�R���0��8�n��.��0�m`5�
�f5`Y�(a�-�A�b��������ċ�<bR,�G7ܕ��i��Mw
^\|�!ȵ�!��7w�W�*��ߕ��_dKАȮ�*��t{uyy�{L��A{�����:��y(
�&*����M���?
B�s
-endstream
-endobj
-13291 0 obj <<
-/Type /Page
-/Contents 13292 0 R
-/Resources 13290 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13288 0 R
-/Annots [ 13289 0 R ]
->> endobj
-13289 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13293 0 obj <<
-/D [13291 0 R /XYZ 89 770.89 null]
->> endobj
-13294 0 obj <<
-/D [13291 0 R /XYZ 90 616.469 null]
->> endobj
-13295 0 obj <<
-/D [13291 0 R /XYZ 90 550.426 null]
->> endobj
-13296 0 obj <<
-/D [13291 0 R /XYZ 90 499.193 null]
->> endobj
-12822 0 obj <<
-/D [13291 0 R /XYZ 90 474.66 null]
->> endobj
-13297 0 obj <<
-/D [13291 0 R /XYZ 90 474.66 null]
->> endobj
-13298 0 obj <<
-/D [13291 0 R /XYZ 90 401.981 null]
->> endobj
-12823 0 obj <<
-/D [13291 0 R /XYZ 90 367.311 null]
->> endobj
-13299 0 obj <<
-/D [13291 0 R /XYZ 90 362.828 null]
->> endobj
-13300 0 obj <<
-/D [13291 0 R /XYZ 90 289.965 null]
->> endobj
-12824 0 obj <<
-/D [13291 0 R /XYZ 90 255.295 null]
->> endobj
-13301 0 obj <<
-/D [13291 0 R /XYZ 90 250.812 null]
->> endobj
-13302 0 obj <<
-/D [13291 0 R /XYZ 90 177.949 null]
->> endobj
-12825 0 obj <<
-/D [13291 0 R /XYZ 90 147.769 null]
->> endobj
-13303 0 obj <<
-/D [13291 0 R /XYZ 90 143.285 null]
->> endobj
-13290 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13307 0 obj <<
-/Length 2096      
-/Filter /FlateDecode
->>
-stream
-x��K��D���:�}��[T@��P�dᒤ�����–Y�%ߞ
�G��5�� E�������	
�
�8��jr�b�AFR\��$$��
�L	F
-��c<}9#x������i��p-�����&
����-�p������]x��]�|�!-yJ
�R���7�g0#�Հ�

�Հg��ۄ��lN1C���~fQq�Ut�3��Q��K�01��X�����28 �[R:Xl'o��`	�0bF���m�)��M�z���
�?���(��͚�A�@�4�ҟ����u���I�MQ�`'�[<�HP5��<�z߂��51&��#
Ѕ�!:�>IW���%�_'
Q�r)�F�mK����E�Y׊�����:�q<}n���0�15]=l�8+�u(
s2�j(��v-e�#�6`�loC�
��1��.MfTL�"gַE�A�5��1I��{�1+�R�!��1��zW�q ���0^�. 	�4\���
-
5��ɢGT#�o�B3-���P� ���x�l��l}���p�3`�Mz0��$Q�k���
�XV]��P��N�e�ȪJ�_��B��Np�R�
�}���pk�ftoK ��Gz�����]��ׯ"X&l�B�H��[� ,$Ѕ$|)B��>�jۇ�+5��O#Ҥѳ�3Հ�˴�o��Q�&<�*/�mr��{d7P����00{>��:���
-n|�P���� 	��aY�yS�7Op$E�9��<�
D����b��e�
�M����s��^s�
�3�
��SD�.~�*�
Ҹd�쮬:U4��w�f��W�7Q�EqO}%�
���KO+���
�;�"�
�:���j�"�\��҉�<ߍ��9,
ꝁ��H����z͜��R��#�$�0�P
v��A>-� �c��X��)h_�H���E�8�~���x
N"����M�1�G�G0�c�\�g��!�
-������6�X�C�S�?x�i�q�O�����O��>sUI!�ч�
-��T#J�AiF��
-
-L���>�T��a�H�:D�(
�$�1�+D%
D�����:����aZ��_�Y��w�� sv���?�z��Ϝ�z8�

-��3h���
-qF|ROKr
�p�Cg��ǧ��tL=�z
K?�����t�Pb������
�(��Ò��c4�"'���"�:�ُ��������qQw��$��q�i߷zx�A
4k�� Oka}���y[p��ȧ>0�ݖ�Bz�C����}@��r��-$S����L؇)pk"�r#_�q� �
	a�8����!�k��҇�hY��W���$��[��
-
����}eo�t"�<qZ�:g�Q9Ӻ�o$�!�1x�HN"F2/�y'uH@��Y�Π��m��p�Ғ
C 
��6�E >-��c��Xz�@��pd GY7G�$+�A�]D(�D���Rs�c�����@��
N,������(ͣ ���p邈�"�	��$�r� C������w��
�0
X�j�fʺq�Έ�&۞��F�=1��g[��Û���>jqל
y��G�_��p!L���s_���ە�W��E`q�
9	"�
�EY�})J�l�m�u�K�v�+�u��5��:Dh�gKuQ혡)ʖ�o�
-�nS�b��e���#�1��1N{�]����
�r/����3h�GaGZ��ג
�{Ԟ&k��|ZZ�^��yϱ��{R�����dt���;��r�tz���-����(ͣtGlo�<h3_��p'��
Q���gO�;+i*�y���;g�h}�L��wɆ4>
-���;��x'�KS9ߩ�$�偷���I��u
�D�����w�G Ƃ�}��
�yK��3L{}��%9��H���x�;��Vt�1�D�s,�Bw5ݝ
��i�D����ٮS�U��t�eO�j�=
^J^=�TH��%�22/_�(����үgBL���k?�������z�
��m�D3hjx�:�ʂY,������$�G�R��w����]��_^\�<�vQ�B��U�ڲþ�^���$-�M��(.n��gP=��N��V� g�=ɟ��o��?����~X^��i˂�p��
�EM�
-endstream
-endobj
-13306 0 obj <<
-/Type /Page
-/Contents 13307 0 R
-/Resources 13305 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13288 0 R
-/Annots [ 13304 0 R ]
->> endobj
-13304 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13308 0 obj <<
-/D [13306 0 R /XYZ 89 770.89 null]
->> endobj
-13309 0 obj <<
-/D [13306 0 R /XYZ 90 718.682 null]
->> endobj
-12826 0 obj <<
-/D [13306 0 R /XYZ 90 684.012 null]
->> endobj
-13310 0 obj <<
-/D [13306 0 R /XYZ 90 679.529 null]
->> endobj
-13311 0 obj <<
-/D [13306 0 R /XYZ 90 594.711 null]
->> endobj
-12827 0 obj <<
-/D [13306 0 R /XYZ 90 560.041 null]
->> endobj
-13312 0 obj <<
-/D [13306 0 R /XYZ 90 555.557 null]
->> endobj
-13313 0 obj <<
-/D [13306 0 R /XYZ 90 470.739 null]
->> endobj
-12828 0 obj <<
-/D [13306 0 R /XYZ 90 436.069 null]
->> endobj
-13314 0 obj <<
-/D [13306 0 R /XYZ 90 431.586 null]
->> endobj
-13315 0 obj <<
-/D [13306 0 R /XYZ 90 358.723 null]
->> endobj
-12829 0 obj <<
-/D [13306 0 R /XYZ 90 324.053 null]
->> endobj
-13316 0 obj <<
-/D [13306 0 R /XYZ 90 319.57 null]
->> endobj
-13317 0 obj <<
-/D [13306 0 R /XYZ 90 246.707 null]
->> endobj
-12830 0 obj <<
-/D [13306 0 R /XYZ 90 212.037 null]
->> endobj
-13318 0 obj <<
-/D [13306 0 R /XYZ 90 207.554 null]
->> endobj
-13319 0 obj <<
-/D [13306 0 R /XYZ 90 134.691 null]
->> endobj
-12831 0 obj <<
-/D [13306 0 R /XYZ 90 81.969 null]
->> endobj
-13320 0 obj <<
-/D [13306 0 R /XYZ 90 77.486 null]
->> endobj
-13305 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13324 0 obj <<
-/Length 2586      
-/Filter /FlateDecode
->>
-stream
-x��[[s۸~���SW��`�	��>�Mvv��fw���xh���J����q} ^eP�N�YOf"��>��'aDEp`���֗�������!
"I*��y� ���G����&"�����?���͛n>�gon.~� ��
-(T�t}��fp�{��E*x4���
>W����.pG3���jD"��L0
-A�&c<*���*.���[ּ�("!�t��
�
���j@���:O�T��@����G�@P��Z�]����"�$��~L�(�����1ţl��Hfy|�ny��������"���xu�a?�
%Q��R�,�*�2n�h���;��H�jQ%��z
^���O�H�
������!
M�tS8� ��5���n�&q~���C>& e�Yf�cb��(���]eD�
�(�uK�D��P�G�-(C<
-kPg��g��t���cv�} ��o����
-�2�|�)cUT�s2��q�(Ũ�E�
K]��
U_��H Ω;#8w�t�]:T�0!�u0l��R�6`/U}�
��Aܮ]kCQ�0 ���m�\��3粆��e��2�U�૷�c
a� ���o�=)�y�q� �1�]X�-�CG(�(��,��	�t�3{���'{��˔�^1Ҙ��C
[X�)�͠;c���x��(�|�P;�: %�T�� ��$w�6�%���<[���e�?���K�H

@�D����-��1�0%�
S�������	?G%�xo�w��
�<YN�_���ūm�P�?���a[$3�A]7��"�"���:���(E9D)�EN��6]y���|�yj�g�ك�`48���@�I 
B_V"dBQ qY�^dž�r�bm��q�
&� �0�BR/pB%��W�H
-7�T�R"�A
���T�[�Pm���Z�k
��~ޕ���@�>
ٻ%Ӣ
�8m��DR�p8��Ճ~�
���u�G�^<�ٷD�g뮃�<CT���HL�X[�	��!`>S7�ۚ�`N��$����s6?��
�ӭ��x-�B��J�%Z()�pz��P
-I�(���y�8��Ѥ��,I��2})0�lG��+��P�~
�|K�`
-)
-)�&���2MN���6�D�y�tX���*��;Ǥ��k ��� ͤ�&���*#�W�lg`�]h���y��	D
-�}B�d��|�y�JEP��@0�!*{go>O��2��T���X0��ڟš��:bM�˴f��P>ɮH�^K��O &`Q	ɓ`>p�)�b���b��!����/��W��-d�,
�CJ`�"�B18:̼Z
-��B~�T��p��]_�!
Ǝ�7�<�G�1�݄#���I2\^�<Q]�w�w	A ��/hO�W�v	���2յm\,�V������`���~���2�C���_
ٕ�n��q &��]
�d�Ӂ	y��	�(�
���Σ!�i�lW�� ���w�.\u�<���	�gݺ�CxtEaƐl��j��4�쬬�s%�huKoS�uRM
ߥ��F�bf�j���&�$;]�V"�#�sȚ����J�e!�M�l;]�M��ͥRZ��Y�:��yeu�Y
�ڟ
L�hQ��
�2RLJ�%��1�
p:����ڳ~��eSȱ���XE"�U�wȀ��8���(�F�c($v ��bV^9���T�b��-�2�?.�<qeS�
�*$�$���N,�	�4��bfzt�
-�I��g�߻DS�3!`��2X�WS

�`����Q���7B`������\�`�-т�3İ_ҁA�W��8��LM�Xnk�E��ӭ��x�L>�J�%Z(1
f1�P�Oq,}u�"n$��B���f�o<�
�O���D
%���"���i��G�Wg�⤯:�|m��a�<yU��"�Bӯ<L�_���`k�A\
-�0�e
G�s�T�C�<O	�{k+��Eb�:YeqqQ�y�5�&�ls��T���je��O�bH
-�S���
-j�����:K9����6/_�����A}��P
:��uJ��Zi��;D��	�x�q�3e<]�q�-���C��[*(�$z��3@)'1��߶D���R�!�(o��OK+�v���ێ���m�ߞ�c��D��"�?���t򷔀��N�V�y�Ǧ	�:�O�U_�D��ޚ�{
��.ɦu����U}׶W��0y�#���[�T�~T�7�V����(=��Pt����abX��p2��""��n
���!M���
8`\�п���Z��eڦ9��_���_���

L�B��0f=�Z��ߐ�#hQ&�'o��t�b�
������a^C؄
@�"�>����p����5v[��0�c�R:����~A2a�p�����|B�/��>�S�`6*�ƿ��TZ���Mt�4-�([*p������xm56vN�i�7T�9���Kg�9�c�:_�u�`n'+�*�?U��!/B�C�jMv�X�� �L�	>��|�E7���o�[/���4��@�Ih��׺6�w�W߭Y�
�5�& o��R[��1n���۫I�=����ًl����n�ؿ���xe�uP��a�Pxa}���<��$�RY��]��W��l�# �j�	�(��뫫���&I����޼
A&�|�i^u��Y^�/�\�Գ��/���
-endstream
-endobj
-13323 0 obj <<
-/Type /Page
-/Contents 13324 0 R
-/Resources 13322 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13288 0 R
-/Annots [ 13321 0 R ]
->> endobj
-13321 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13325 0 obj <<
-/D [13323 0 R /XYZ 89 770.89 null]
->> endobj
-13326 0 obj <<
-/D [13323 0 R /XYZ 90 634.093 null]
->> endobj
-13327 0 obj <<
-/D [13323 0 R /XYZ 90 543.343 null]
->> endobj
-12890 0 obj <<
-/D [13323 0 R /XYZ 211.842 479.094 null]
->> endobj
-13328 0 obj <<
-/D [13323 0 R /XYZ 90 474.456 null]
->> endobj
-13329 0 obj <<
-/D [13323 0 R /XYZ 90 379.969 null]
->> endobj
-13330 0 obj <<
-/D [13323 0 R /XYZ 90 264.91 null]
->> endobj
-12891 0 obj <<
-/D [13323 0 R /XYZ 192.853 198.253 null]
->> endobj
-13331 0 obj <<
-/D [13323 0 R /XYZ 90 192.236 null]
->> endobj
-13322 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13337 0 obj <<
-/Length 3150      
-/Filter /FlateDecode
->>
-stream
-x��\K�۸�ϯ�)��,o���
���T
{R98.G�FL$rLQ����4�%�z®�ʖ�(������1
=�����_�n����(B��rt�Ex�x���O���1�H�ɔ`��o&��b
|3�x���,�y|��q�����2~ȳx���2~L&�~z�#!
�FHJ�WԿ���8�)�_��Јa�~���(���7�ɔ
-
�":N֏��L쓷�")&D��l�X�Ębh޼���tC�

���
��7�?��

�4ˆEz�T��
q������
vn��
-sk.N�@��YGc>R���[�A�
�
���0Iƛ��=�����_���$�6�dyd��������$X
�
-o	�C�j�����G��;1��屰Z
��
^Ɍ�n=�ET���[:���,�
{�L�0
&�M�g�Y���{�f�:�5�ۏ����Yټ[Y
XGgy�Z�˿1fΦD�-�"M�w�e������]Ҽ��a=
-"�B���3$	��-�5GD�0xf
-�ԩRL�
H����$0_lj�=N0g�uR�e��/
.���
�G�۵��yB�8^m�Ӱt��;�҂��Rh�K� �XR1�[,�O��u�������<�rpv_
M
2��@R�nDSh�M"B��0h�E�DJ�0#v��r
-����<uy)�m�eq�IJ�A+�\Xͳ��#�K]��6�Λ���D'��b�
c	HR.B��b��%͒
-D��[��Y�XBzt$[>!/�D����V�g�$<Mk��qI"E�JvI��uHV�	GR5G�HF�ÖO(X�!!�]Z�)緷i6� �x��?Bj����<
|�9Ҙ���]Q�L������HY_һe��~�?�ɪ)b��2�+>�"�<I�DZ�9|���)l�):�i6�׏q�ޯ��*���`s،��2�i^Ns@O(H��Wz��m�'�=�g
-ɶ#bS�4:�/�6/<�A��c�3��.�,/��}����4E�v�����D��3���xA��h
}A�1$	�]�H�m�ի6��[@
-�q���ڕ.BZ��-�P�R�%3?ʦ��)7=�G�
-�r/ڡ�9b��;\%
W�o�2�Ζɼ6�n�܉�SGmJ)"Xu:{�!�\{��[c�-7
�Sd�k�[��M�_
�,^�����F\�6�z�=N��y��u��4Z
-П$�B����G�	7e`6��sj�B�E5��[׻�L���s�
-O�\��
2�ңő"�&_Wݢ�/�5���m�/
U(�����P�W 2�wp����~�G�v�C�,L<K]P�Y
6��㋓���wd9f������`�O��F�Ϯ|u5�!�A 7��p<�	
-9
��
A��J����$��Z#x�'�����)@\Z��
�
�~QL��
*(+ܮ}z��'�
^&�k
yt.�u�J$M���!u)�E+Eע���	pͮ�O3ӂ�Ы&v���
VH��u]��U���V`(j��p�	NU�E��W��]��-T���I�ll�U`n\�Q������g��5���|��E��I.���fV
-�	�[��v�!L!fɊ��e:[�߀�@�dl�`f�&9�%��^���1O3I��2)	����*!�$����%R�@�b��~[6y����$�)	�oE�7�_q���Cv��S�jtn�=M�N�8�K}��Jf���
3�'���8�> ItȩCp��
C	��N
xUL�3'XWr�s��o3��\��75.�!������Q�X�Qy� �JF�P�0��W��1��@�����-�0d#4���to��sr���:V�ӫ
+����iؼT+�@�����
M��&d
-�#ق�9�BS��3Gh딿�@y
^�c�_�R;(��T..�d�<�lg�$�oL)%��)]��&�3�2���e�B�+�̭��:[�m���:�J
,Y�c��i�Z���)�6���I܋�`�L�$d�x9��淌K�>�e,�袂��M���HC�o;$���2HJ��:��6����vG�
�=I��6���wl،�$�5��iz�4�١����4�tԛs���jn�\s
=::����ڷ��c%M���z�C\��f��[��]�
ߒ������o9�ߞF�?���l�&���Ƀ_¾�?x��	�5 03���'�0�} � /���6�f56d�n ,�� X���`�".���(�gL�99gL����0z��FA�~D�D_7��H���#ѡ08�HcI#
�B�T`@�s��S&Î?;Ab��
ض�>S�W�B��A���6Kv��&Ó��$?��-�OV�j!	;D؈"	��	;�`0~`�
�3�݊���n��ª1���Y���Y�]�UYU�p˝wJ7����l��S5Z��v��Š�6�W>�0�m�@䭹�KOj� 7l\��wԲ�A��7�
-�
�
(� ]�_DC���&�`ܐ�B�ӳ�?M��!
��s��PWim���~����ab$ٵN�r�D�c'|Ξ��W�O��d��#�1s�txQ�G�i�~�ɗ�w_�
�,I��9�
}�����:ct�)Z�A����G3�8A�S�<rٌ�%�N��^njs]n^�Z8�OT��&A{Ǔ$m��g�c��y�L|�_�$����0�^��5�wc�w��z��d��5�b
uQ�B3�D��I�Q=zJ˥���
y�|�fnW޾���`�#g�s�/�t�s��pT{P�1���=�ۧg�"��
,c�>����,Ϧ�&E~��b�
)P䜅4����C,7Un�i��{���o�'�ܯ��o�]v
���p�
Յ���w���i��uk���K}�א7�"�|z֙��:�C �uȿ]
N�"�@�K�� s@P�T'F��8��Ɂ3I�c���zt�ĩ�(������
��T,h�
��E�H�:�Y#
�jp� �4�y
'~�u99xf�SqBXm��X;ӫ],�02�$
z��r�����D�ԑ�V��
�wS��Mۧ�bqsn�H�7���?7I�ljc��g�xe�M��f\E[��M����x�.�3<��G�����R�
-1G��,zY���ϟ�o �}@���7�:r@�PM�)	�y�
[����	��k
z0�Q�Z��O���j��:�՗�݃��l��
���� lX��
-endstream
-endobj
-13336 0 obj <<
-/Type /Page
-/Contents 13337 0 R
-/Resources 13335 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13288 0 R
-/Annots [ 13332 0 R 13333 0 R 13334 0 R ]
->> endobj
-13332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.931 140.646 186.185 152.979]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-13333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.668 140.646 272.341 152.979]
-/A << /S /GoTo /D (index_Grid_Frequency) >>
->> endobj
-13334 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13338 0 obj <<
-/D [13336 0 R /XYZ 89 770.89 null]
->> endobj
-13339 0 obj <<
-/D [13336 0 R /XYZ 90 720.814 null]
->> endobj
-13340 0 obj <<
-/D [13336 0 R /XYZ 90 630.064 null]
->> endobj
-12892 0 obj <<
-/D [13336 0 R /XYZ 211.842 565.814 null]
->> endobj
-13341 0 obj <<
-/D [13336 0 R /XYZ 90 561.177 null]
->> endobj
-13342 0 obj <<
-/D [13336 0 R /XYZ 90 466.69 null]
->> endobj
-13343 0 obj <<
-/D [13336 0 R /XYZ 90 351.631 null]
->> endobj
-12893 0 obj <<
-/D [13336 0 R /XYZ 192.853 287.382 null]
->> endobj
-13344 0 obj <<
-/D [13336 0 R /XYZ 90 281.364 null]
->> endobj
-13345 0 obj <<
-/D [13336 0 R /XYZ 90 190.26 null]
->> endobj
-13335 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13349 0 obj <<
-/Length 2174      
-/Filter /FlateDecode
->>
-stream
-x��[َ��}��SFF�ڗF �̒�� ��`�T��D�$5
�}nqI�RK��c�O������.�$�={����_�wo���g��Tz�g���AB·��0�N?��Ԉ	O������_������ݧ;��GJ ��������=�����⦍�)�ϵ�p��
�li>��~T��Bm��S�!�Ei����6��8+
:�<�
�pd<�HPu��b��-��Ƅ�0�4
1X��p7AF�
,�O҇�ϵ ��#
-�\����l����B(���(8W.N���Q<�x򛿎�G?�25y�m�8/�kl=(��̩���{�GD�S��vRle
G�4�R1�
OgT�I���A���s�"&I�G��۴��
.��M~
��Pޞj��R�=���
���np�U��,
K��'���E�"�l�<zZ���	f��["s4�,$Q�ibހy
OJĴ.g��7�Ц�.�u��Q��
�X�4�wi
ߗ_�U
 �<�L�O���i�����)p��q� 
�c=6G�*^����Hu4��e^
��<�-VaP�r���z͌*� mF)"�ZW���ADLgcX�p�]�y�����<���X��B!ś����0�7�fi&�@�?�Ɵ �<����)�$��S�m�����tm���S�'�zS���?GO������-r�9�a�V�v�Y��js�ۮqC�U� ʬ*��ڙk������DŽ�@Fh%	"CГ�N!TM���ԃH�HP�V�-�u��6���J,�tƅ,�
L�bk�P����>�rS�,���R����L�b ����>!H�#��gF�F
��������"��xٗߒe}��J7}���C�X
�.Ķ<�B�Թ� �g�ic#V�!tBG��P����d��32�=�K:O��EA ��ԃ
�S��<L� [...]
-K�3�e�\�x�BP�e]�
*D�˘S
�
��#L�����d/T���8,!^�
m�*I��Cw^�Ұ�f�
��
�
/;���Fv�g@*�
�=/��m2]
z�;
�䁘
7g#z*@�U"H},I�x �H��U�)Nly4f�@
ϊ�R�M	dE�+n���"&�n�M�<
����Q�wkH60//Զ���x� ��mE��ty�/@Ӑ����7=��!P(��BY(eT_e/D
-��>D�%�?�U���]�
M�1}e�/W6ٛ���(?��P���c*?�}Օh腎�m��*�Ї9��.��+�t�r����N
3�
qH��#��LR��N� �0�4 at iZxN<�hƠx�1M�|�W:�s�^_���w`t�-$a�a]�x��bB!��s%Ÿ��)�y�2���H�RL�oPS�C�bܙ�r�g-�z�^��:~v��#z��C��9���͉�=���|�G�%N#�I"qx%<:V��$q�1+G�/p)�Ah�����]��y-V5��k��,����J��X
��ȍۗ77a��Z�0 ��'��7��I-����l8�Z�ʊ����/�DL��8&NP,�+����R�x���߱�S��~y���z�L}
�.�<`�n�I�h�K�Qj��
2r���D@�k���B
fF\"�n4cP�u��k����Xsi�݅F�P�Q>cж�e�2P��پ��]wm͇r�_�_�d�_��(H�]�#_�x��%vàހu�d�����i��YT"�Sr�J��x��%R �u��Q�~�J���uJ���7%��JV�(٫cq�:p;K�mŹ��:
m_��⿧
V3��
�0�1�!},e��b��I�u�G~��6Ey/��S2)^
�/
�:�T=��a(V���<�P#d�3v�z�l�X�Y�ܭ��rw<�}�nA~u���oyl#���1;�O��E��A��r��eXGuB�$�o��PMo���S�����

D� � 0Q��������ě6��[`����u1�0ېFE�����������.����wS!&U��ӏw~�)`��ov
�4+�Ğ$[�X���0����뿍�?�ҲGp`���|{�����9
�g�XS

6��W+K!֘MR�|9���Ʒ�r�x���^
-endstream
-endobj
-13348 0 obj <<
-/Type /Page
-/Contents 13349 0 R
-/Resources 13347 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13288 0 R
-/Annots [ 13346 0 R ]
->> endobj
-13346 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13350 0 obj <<
-/D [13348 0 R /XYZ 89 770.89 null]
->> endobj
-13351 0 obj <<
-/D [13348 0 R /XYZ 90 718.682 null]
->> endobj
-12894 0 obj <<
-/D [13348 0 R /XYZ 439.299 666.388 null]
->> endobj
-13352 0 obj <<
-/D [13348 0 R /XYZ 90 660.37 null]
->> endobj
-13353 0 obj <<
-/D [13348 0 R /XYZ 90 591.173 null]
->> endobj
-13354 0 obj <<
-/D [13348 0 R /XYZ 90 537.484 null]
->> endobj
-12895 0 obj <<
-/D [13348 0 R /XYZ 90 490.859 null]
->> endobj
-13355 0 obj <<
-/D [13348 0 R /XYZ 90 486.376 null]
->> endobj
-13356 0 obj <<
-/D [13348 0 R /XYZ 90 415.645 null]
->> endobj
-13357 0 obj <<
-/D [13348 0 R /XYZ 90 361.956 null]
->> endobj
-12896 0 obj <<
-/D [13348 0 R /XYZ 90 315.331 null]
->> endobj
-13358 0 obj <<
-/D [13348 0 R /XYZ 90 310.848 null]
->> endobj
-13359 0 obj <<
-/D [13348 0 R /XYZ 90 240.117 null]
->> endobj
-13360 0 obj <<
-/D [13348 0 R /XYZ 90 186.428 null]
->> endobj
-12897 0 obj <<
-/D [13348 0 R /XYZ 90 77.486 null]
->> endobj
-13347 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13364 0 obj <<
-/Length 2168      
-/Filter /FlateDecode
->>
-stream
-x��[[���~�_�S������*R�ى��$�Q
fG-��{ Ϭ�}NQ�]��dg����s�s�s>�q�
���7}��}�X`��T���@q������]H0Rx4&����0ʖ�����j��%q=�8ʢl{w�󤈞Wi�x��E�d�����7�쉧� )(/��x�F��
2
"L�
�|J·�(�Gc*034L��ET$�̿�i����t��a"�Y�7�=�|�! ąE ������{
�p�� #ft�\�
8ep\�7���U��a�Co��Ǜ�"��yQ�{MQ�JO�B��zA�]'i���K�X�W�YO ��w��8�<\��-0�2Z/
 q�Q�j��o\��cF��c�⸣6r����(
�0>L
"%�����K�Li�K��D � �U)�ԦMV�s�q�I����
i��EG�H1�����?�Q0�X�����S
�Y���sW�9ª�g���Q������_=�L �� ����/q\h�r`w�00S�� [...]
UQ��w�t1O���l�ġ�tiǓ�Ru'4��(	@ ��#�B���(��0��F��[T�d��wp��Dž.��aG��K��`ޮ��LW��I�<;
�����r��ﲀ|�yn�\,�<����24e,D:���g�Y.&(
�4�I��4q
S�䃑���IS���H��G��9J�gC�&�
C�ISW�C\��vG	�;��X�%ى�K����
���n�;�
H	�cG����#-��=}�4�OfU�R�����]]��G��Jd�YC��U2O�+S�gW�����]1
5zveEahM��,����dDD�H:
 �@��!
�f
-���fw��
)��L��Y��>m����}݌��n؀����!��K��o��	
��^�E�3���yf8>'��
-L�0wQ^+��O�ڒڹe�eGh d�y����1���ܝ�,&��0sb�������v�_Q>`����`���~5Y���^���
 $r͇,��%�Gv)\�rp�k��"'^��;o~�h,ucf@��'�
-�KmQ�o�`��Y�ݖ���]��W���c���q��χ��E���D��n�����N�<}������&�/Ԁ:o�P&\��.*
Fy�Y�@�#΢��1�R�ꩺoʼn;��
�!Z�dwW�y��Y׊sP�FBwa�ȧ�Eel�T&���m)�.fI��*+ˌ�>T��G�J (iM
y4M�� +Kʷ�Q�o�hP��y)�zL�룊/�QE�@��i��Bq&
(��zV���JR�jh��ŬC)P&��J!������2�e��2�5�{TQ�Y�L�3�Qt� ����_:
�1��G��k��|7�.��jqӃ�i;l�
ҖK�r(����s�&��>�p�=�������5:���VК�(���M)���h|MK��K�����4���6��epY1��ͷot?`�?�pa��OQ���cS���I��N'a0�Ʉ�t�$�������n���L!�Q4�������i�'�3���0����lޡ��]`�r�%�3&8��lC54Sԭ����t

XB���ˋ��Չ�,Y�x7r��ʬ<
-endstream
-endobj
-13363 0 obj <<
-/Type /Page
-/Contents 13364 0 R
-/Resources 13362 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13376 0 R
-/Annots [ 13361 0 R ]
->> endobj
-13361 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13365 0 obj <<
-/D [13363 0 R /XYZ 89 770.89 null]
->> endobj
-13366 0 obj <<
-/D [13363 0 R /XYZ 90 721.073 null]
->> endobj
-13367 0 obj <<
-/D [13363 0 R /XYZ 90 658.004 null]
->> endobj
-13368 0 obj <<
-/D [13363 0 R /XYZ 90 604.315 null]
->> endobj
-12898 0 obj <<
-/D [13363 0 R /XYZ 90 557.689 null]
->> endobj
-13369 0 obj <<
-/D [13363 0 R /XYZ 90 553.206 null]
->> endobj
-13370 0 obj <<
-/D [13363 0 R /XYZ 90 482.475 null]
->> endobj
-13371 0 obj <<
-/D [13363 0 R /XYZ 90 428.786 null]
->> endobj
-12899 0 obj <<
-/D [13363 0 R /XYZ 90 382.161 null]
->> endobj
-13372 0 obj <<
-/D [13363 0 R /XYZ 90 377.678 null]
->> endobj
-13373 0 obj <<
-/D [13363 0 R /XYZ 90 306.947 null]
->> endobj
-13374 0 obj <<
-/D [13363 0 R /XYZ 90 241.303 null]
->> endobj
-12900 0 obj <<
-/D [13363 0 R /XYZ 90 133.657 null]
->> endobj
-13375 0 obj <<
-/D [13363 0 R /XYZ 90 129.173 null]
->> endobj
-13362 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13380 0 obj <<
-/Length 1955      
-/Filter /FlateDecode
->>
-stream
-x��[[s�F~ׯ�i#U��}��Ry�d��d6���O�S.,a�Z
y�������a]�s������>��G�G��8]��Xd��TF����Hq����ѻ1'|�~�kĤF�Hx�����g��]�{�׳ч�[8"@ ���j��=�p��#ft�
��8ep���F�peKsDT�S{�,̭�� �y�C�;k�N(�y�J�$�2ޔv� �ΰ{�ݴ�v<���
z&Q�o-��=2�4	,�Pa4AF��[�v<��`'F�P��s���։H
-�4B���H�
U���d2����lS�q�h2e��u7Ң:n�1[WbwXϋx����.�?��?��Ր�j�t���d��B��
�7j,$�!��t��VBlP����k�<),�p�
��RpdԠ�eU�G,IpH���"M�	�@�H����dy�pD!�*�<�n�S�P�����c��fS,./�l���c|�.��|��x��J�b8�)�HNHO���u�1��TC�z��b�(�=����	�OY�۷ֽ��)o=�2I���_���D{2�Sܥ7Ʒ���
��E�����G�V��j��0t�yU�)���k�f���!.қ�乚�
xzN��O(��$p���9\�,:(�ܺ¹�?��)���d�p��B�BQ�.�Fx�
-)�lY��d�^`ߤ�z 9l�j����q�j�Gˈ�颊&/�m
-�z��	4�8_��@��%�?�%�<�~���q�ty�G�$����>g�Q�j3�o\��SF"�2��j��v��./���f�.%�#�M$�F��������X J�.�XM@>��]Ϭ�#�x�Yaa�+oV���1��6Z��Z$�dʅt5�gÕA�4+�j�����S�	�����ZCd6_�m6GX�m�����.�R��ޥ�}�%�=
�)rSj��B�P�.\e�6��#u���
駊��6���ڷ������8�yS����m�������i���`/��4�v��� m�R3�t˫����2(�
-L Af�%@Ib
��G,I�`��PT�(.n۽��@L;&��\g�ѫ�<3ښ�ʧ�4W���e�4�b
Tu���C c!��d��T�"����!`lXF��e�rh������y����u8���Zvu<=Qv�
�ZT�~V �Zq)#�N߾�)���iz��
VX�/������gP=�!�8T
]��a�b�Jxy����0�@���� ���@�]c͐=;\�m�6݂�C?J�1L���|� +v��W�A�뱎�5��y%��A�ٲ�7QXe,�͉��6zGA�8mf>�6c��0I��#���*b��f������E;8��fg�ѫ�<3z���~�%��z�X=U*�W��/��Z��̦Qs��i
#�N_���$�낓�h
z�4�@��]Ӱ��0]�"5�>�"�#Ϙ�mB�g���������K˳
F �޾U>���c'����D�H؜<�Y5F��R�_����7�ƨ"�
"��P��C�X�Y+5�ͺ}us�Ӷ<���`j
��� [...]
�,�
֕��'�����Y	�k}�;�c�˨,�%��Ag)j��0J���c8F��n�0�n�n��X
)0в�7^h>���3�Wbyf8�e����m�ý2E�xSݫ$0�V��Tc�ĂQ���%'�झ70��R�֏��s��*�`'/��ಈr��p=
�8F��s@FE�}A��
`�,�p�4�kA���g�/4Bi����"���*���Wa�
+�N߰�Y�f���<��"�?v������>֕�

� �`���>/o��T.~Y��5�mᦀ7�ց�a�%wt?DB5�7���w�6�n"ĸb����ǚ"Z*�qB�8�m���a˝���WIR�fg����!۲G�
�+��ˋ����&ɖ"q��o6�
���v�;cV��gW�mu(������.|�
-endstream
-endobj
-13379 0 obj <<
-/Type /Page
-/Contents 13380 0 R
-/Resources 13378 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13376 0 R
-/Annots [ 13377 0 R ]
->> endobj
-13377 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13381 0 obj <<
-/D [13379 0 R /XYZ 89 770.89 null]
->> endobj
-13382 0 obj <<
-/D [13379 0 R /XYZ 90 720.814 null]
->> endobj
-13383 0 obj <<
-/D [13379 0 R /XYZ 90 667.125 null]
->> endobj
-12901 0 obj <<
-/D [13379 0 R /XYZ 90 632.455 null]
->> endobj
-13384 0 obj <<
-/D [13379 0 R /XYZ 90 627.972 null]
->> endobj
-13385 0 obj <<
-/D [13379 0 R /XYZ 90 557.241 null]
->> endobj
-13386 0 obj <<
-/D [13379 0 R /XYZ 90 503.552 null]
->> endobj
-12902 0 obj <<
-/D [13379 0 R /XYZ 90 468.882 null]
->> endobj
-13387 0 obj <<
-/D [13379 0 R /XYZ 90 464.399 null]
->> endobj
-13388 0 obj <<
-/D [13379 0 R /XYZ 90 393.668 null]
->> endobj
-13389 0 obj <<
-/D [13379 0 R /XYZ 90 339.979 null]
->> endobj
-12903 0 obj <<
-/D [13379 0 R /XYZ 90 305.309 null]
->> endobj
-13390 0 obj <<
-/D [13379 0 R /XYZ 90 300.826 null]
->> endobj
-13391 0 obj <<
-/D [13379 0 R /XYZ 90 230.095 null]
->> endobj
-13392 0 obj <<
-/D [13379 0 R /XYZ 90 164.45 null]
->> endobj
-12904 0 obj <<
-/D [13379 0 R /XYZ 90 81.969 null]
->> endobj
-13393 0 obj <<
-/D [13379 0 R /XYZ 90 77.486 null]
->> endobj
-13378 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13398 0 obj <<
-/Length 2962      
-/Filter /FlateDecode
->>
-stream
-x��[�o��~�_��V����Qh���W4M|}�mQ6Q��Qtr�_�owI��IZ�����%9;;3���
I	W��	u���Qw��/��_Gbb��\O.�K'��Di\-&琉����R:}3ct����͌��f�x�,����:��Nj����&�WW����d�����׌5�sn��&���
iq���
��a	�z��Q�fo��9W�,�&��U\$a�m�L�3�$����BM%S��ٷ�g?�1��ĢHd&7���d���!Na��h=�\บ�;��m���4�rf�`a����ӥ���ϧ�7���퉰E<"�4���}��k�b�)Pi�lO�-�N�F�(��&QV
��wYm���㌩i�z��(�Nr��!]pb��i����ֶ��]�to:��""�
D�q��t�.���Z��Ss��d�5��b2�V���
�Ƙ"�GC
-��Cx����ҝJm���E��D)ϒ�Q
ى��%O��$

)V	�SZ�u��1+���
-�Qўu�fI�w+���Y�R���=o0�|�1s$�6f��#Mt��3c�??ī�xp���Db�bz�ɶE��G���g��%v�z�w
س9�Q9&�B;�d�� R=�V].J�|�2UQ
	����P��P�c�
-�7X�=�Eq.�"O�⡘�5L=�]h��߉�w��av.a�,�W]R�A�.�O�X����W��
�
�p��.�
$�(\j�'^�p1��&I4D�S���]9�u��K�T���ͧ�%��x�Q^z[�dfB�iq������E8�,�c�¥��<N��|yh��m��_�W������M���!���w�6<�Z�~�.syغ���ל��ĩ��<�n�E�~옝	@ɘ&�V��o,��Rsd��?�W��%Yb�yIK��v���M�^�٬�R�<q�t�C�M�m����
I}7�t��3q
�j8��T\�F2�A��R$
�@؞����	IJ=��5��
6�����)�mJ����:����0]�|��ǥ@�C&4c�<\.����WFR�N?:�������M��M\\���& 	��7�"�Ӥ|����;i9R]0b�
�y?�_�))V���ȵ�����	7�I
�|�
	��+Z��{�pL�rKy�I�n9�ݤIV����w����j�%$
2�0wŎWX��;�ܚ!3:� �s�c at F���'b�>
����L���a���m�z�`d.�U�g-���
-.�Ղ
n�p���$�m	
��1�
��E�z�r�����n������)v�˧٣��bˤ�'XQV4���&�/R�%á�����Fj%���C���O3xj�?�=�6�&�pd�$�{
�~�ao�}JI$O&�ag�\�w4e�����4�I�^��^\��hz��0��SI
������
-����R�I%����J/�����g�ˮ$�7kluܦ��X�*]�a�w�������_��	�^i�B[�g�f������OU�i/Kg��ln���ox���{� vB�b��ɑQ,ŧ�j�`
-���>�Q9]>d7��j�!l�܈���z�-\��a��\�ي�~�؄�z�HV�4�V�D�
q�1�m���X͊�_��j�R7�#����36]ѷ���n��b�ם�yR�<On��c9~�o~Iׁ_;w��%_��8[tQ��D�P ���X�=xN������k�3��
)�@<��Pe���*�kW������x����$��uW�3#��*��^�V�u:��d��ǟ/:T) 0�QH��t	�s���MW�m�(M��̬�K��3��v"���(�F��Z���v���}�y%29!Y{��֎��r
K��ĭΎ�Ug������·��H�~V;��:;
��B�d�tv��4��S�!�䞒��xI�[�~��S��6z��S?1��uZ<��a&���E�c�P0{��=
2�
"��K-�IV�l�0�ߑRF
b�N�3n�̀>��cڶr�W�
-�z7��d�3�w���ͪ�,��uΗ�����|�@췏��G�߭�}�9W�a��ġ�u�R�f���i��]�ɕ�ʂW�ф�v�	�6��!}&�|��GO�LM�[}&\���\��τg�&��/�Zӓ�����N��@�Nӫr
}���.�#��@�a;�;;Jw{�r�����j�9v�S��^�I��.sn�a�N
�D�n��&�e�
7ф�(q9b�st�>��
-��l�	�ITe*�6�N㣳#���7�D��6�VX���"
��RȌM�C�[����&'R�v�Nc�3MF~�m�_o��hu�ڷ��hDČN1 �H���yݼ
2aw�����D�7vvij�9��N�ع
J����Y�W-H�g��/4��)���
-�a_�F�r)
̨ݗ�@3@�m���� yJϕ����:�B����J�l�6����e:��[C?BARk9.�ǧP�
Q���8F�������.Q3p����[)���W�j'�?d��*��t5����L ;_Җȱ��)�#�I�� $���M����Pf����4��	
-�H
-6.>�&��Q���[�����E�}Ώ"���(B�k���˺�?����O#��
In�3�$9�s�\�0Pim�h��UY?�v|���5#Q�����/�@K첤��
������D�]
�DSs�/=,>:�
� ����˫�G��>�����{���3��U�-r_��	��9m��fٙ�A[���c����eeӖ�+��	��}\�)^窝�@]�f\	��5w_�FSDB�1|�m�Q���(p󰪙y*X
R��ש�0�nl<�%��*š?�W1˸��>���^}�͛�ɏ�$����U��8{���CJp��v�$0B����wIe���O����y�Ԭ0*���������v�d���)2밄��m���3��T!(�\}қ:��˻��2$鼒����2+���y�oV/��߭��/�N�
r�8^
-endstream
-endobj
-13397 0 obj <<
-/Type /Page
-/Contents 13398 0 R
-/Resources 13396 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13376 0 R
-/Annots [ 13394 0 R 13395 0 R ]
->> endobj
-13394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 117.316 212.124 128.22]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-13395 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13399 0 obj <<
-/D [13397 0 R /XYZ 89 770.89 null]
->> endobj
-13400 0 obj <<
-/D [13397 0 R /XYZ 90 622.761 null]
->> endobj
-13401 0 obj <<
-/D [13397 0 R /XYZ 90 532.808 null]
->> endobj
-12905 0 obj <<
-/D [13397 0 R /XYZ 406.869 468.558 null]
->> endobj
-13402 0 obj <<
-/D [13397 0 R /XYZ 90 461.918 null]
->> endobj
-13403 0 obj <<
-/D [13397 0 R /XYZ 90 357.479 null]
->> endobj
-13404 0 obj <<
-/D [13397 0 R /XYZ 90 255.172 null]
->> endobj
-12906 0 obj <<
-/D [13397 0 R /XYZ 406.869 176.639 null]
->> endobj
-13405 0 obj <<
-/D [13397 0 R /XYZ 90 169.999 null]
->> endobj
-13396 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13412 0 obj <<
-/Length 2283      
-/Filter /FlateDecode
->>
-stream
-x��[Y���~ׯ�S"Qo�� ;g
ǻ�(~�f1�F�]&)�οO5��H�u��
d���"[_WU��U���|5���b�AFRL
��
�͂�CN����ۀI�������￟��~rk�
�N?<�q )
�/?�`��
0bFO��e�)��Ep;�a�
Y�OD��������P�1a�p'͇��0	�Q%#B�i.�
r�
�O�C�lO3�X�fu�V�|Q at X#H#���*�&�тu֮��
)���aC��	g�C�"���+��U'R"CUS��<����t���x��x�r_�y����x�pW�b�vu�^�Yƫh��k$�D�
-�z��dاO]�x^JXdʵ[����Mf�	��L
-��:*~���&���S����
|�6��]
2�O8��pH�ÕP�����c��&�f77�j�1D�"��A�25|�B�d�ݞb�4������mU�HuL�FF�� ʚ�N��zD������%N�~�2I�JV�=p�jT>&N
�j]䒰/��)o,FR����.�ѕt�<N�ă�G�A}��P�o=
W )��X��x���+g8�V�Q=��ZD��"�"gr�p-�QDTe�?�
t����=o�pi��@�W��?u 넕��bI�:�.ӈz	�
�aD�C�ex�\q�<�fIx�]<M������}>�W���v
n��%F�Q�1m��u)8fT!(�©*j-WMvsS��`>�!R
�����A��e�;�id(X ��(�����9%���l��R~U�|dj�V
1L;�(��Fv�-H���wLAZp� �
;~�^n�Yd��!�Qa#y,"��o�G���V��E��%1�z��ۘ6Id#Ơ�i�HB�P堧8�;
�(�D�6e���z�V~�F٨�.QfS�UeӴC$�2X�x���h�0�i?���c���ҕ9�E��oE���-K�
��t���)��tc[���
@��͐`�=2W�9KcFO��9р)w=���r�Sz�+�����z�(��ȯ�$]��a� Ⱦ
��<�R��Z$�5R�zo��&�s�w� f
~\(�XO��2�=R
��#9��[$��+�E�g�!�-;�Êv5H
=
%U�Ԩk���D
��zEk�}
CnYn�� Os�
-�@�p�*n����!�;RҾ=d���:�:|�jcW��}�+k��,OwE��P�)��Y��.�b7:
؀H��,���mҠ� f%[M�ymҾ�&-^��b��;���h$x4�F�
s�
�
�Q�]�b�,��m#*�q�SDa`!�T�o\̚��Sr̶�<���>�}� ���{��N[AI���sn��H�á�jvB=�����Zш�
�T����3X��T���j��cʼf6
�@�
t7���wF5\H���
�f��3ݿ f�
[�s�y�:��o7|�C������
Mm�7�Ac�7�D(Ѳ*�a�nq,�Dv�j
!�$�oT^����M
-��+����7�(��]
-҃Pք
��x���0Ҧ�l�޺Hmg:���I)�H��Ƥ�l��YL|qt/]��E�;��o�{�����.E,��l�zD����e�[W9]}Q�Q_���
/�)Th�V���y#e�1���y
o�
< ��/��SӒ7�T��764}�9o�|���}M��߰���9R[�oQG��Q��R�QGR!N��E7m4�{����6�;H5�i#�ﮎ�;�6�!�	��ä%mlLZ���Y!�4^�e�
��.����I���8�d�9gdwc?�����X2b�ϒՈU���8뻇јq�ا�pA�_:G�/;	���WC�T9��V=UR�Ξ]U:!���܎?���s1������s6Q�eg�@�6�����Y��ɶ�I�mХPu
K�<�i�1��R!�d3�>���k:tF���r��}
�c�!�x'��2ĵ�� ^ 3'�
ώ� :��� �!��w�o�ާ�%�o�z!�oh�J�sb�j
!N��3<W`��ip Z�x�=��
��ӕIo��i���d
��h�H��;4�p��_��_�L?��oT�'��*�����N�������s��0&*?
�j����7ō7�,���vpc�� K�j�����V`�bL��އ߹��Q����g����W۰8�g	��
KvG�–� (vЦ�F�A'�+��>�ê&�A!�;ϲ�͛7��c�
�>����8F[��a�8a��z�
7���t-%,�� E���
-endstream
-endobj
-13411 0 obj <<
-/Type /Page
-/Contents 13412 0 R
-/Resources 13410 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13376 0 R
-/Annots [ 13406 0 R 13407 0 R 13408 0 R 13409 0 R ]
->> endobj
-13406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 573.132 210.103 584.036]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-13407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 469.724 485.603 482.242]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.54 80.973 309.037 91.877]
-/A << /S /GoTo /D (index_BHZ09b) >>
->> endobj
-13409 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13413 0 obj <<
-/D [13411 0 R /XYZ 89 770.89 null]
->> endobj
-13414 0 obj <<
-/D [13411 0 R /XYZ 90 720.814 null]
->> endobj
-13415 0 obj <<
-/D [13411 0 R /XYZ 90 667.125 null]
->> endobj
-12983 0 obj <<
-/D [13411 0 R /XYZ 90 632.455 null]
->> endobj
-13416 0 obj <<
-/D [13411 0 R /XYZ 90 627.972 null]
->> endobj
-13417 0 obj <<
-/D [13411 0 R /XYZ 90 547.288 null]
->> endobj
-13418 0 obj <<
-/D [13411 0 R /XYZ 90 493.599 null]
->> endobj
-12984 0 obj <<
-/D [13411 0 R /XYZ 90 446.974 null]
->> endobj
-13419 0 obj <<
-/D [13411 0 R /XYZ 90 442.491 null]
->> endobj
-13420 0 obj <<
-/D [13411 0 R /XYZ 90 369.628 null]
->> endobj
-12985 0 obj <<
-/D [13411 0 R /XYZ 90 334.958 null]
->> endobj
-13421 0 obj <<
-/D [13411 0 R /XYZ 90 330.475 null]
->> endobj
-13422 0 obj <<
-/D [13411 0 R /XYZ 90 257.612 null]
->> endobj
-12986 0 obj <<
-/D [13411 0 R /XYZ 90 222.942 null]
->> endobj
-13423 0 obj <<
-/D [13411 0 R /XYZ 90 218.459 null]
->> endobj
-13424 0 obj <<
-/D [13411 0 R /XYZ 90 135.643 null]
->> endobj
-12987 0 obj <<
-/D [13411 0 R /XYZ 313.62 84.126 null]
->> endobj
-13425 0 obj <<
-/D [13411 0 R /XYZ 90 77.486 null]
->> endobj
-13410 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13432 0 obj <<
-/Length 2902      
-/Filter /FlateDecode
->>
-stream
-x��[[s۸~���S+ͬ`�/�e��M�٦�t����L��(�S�Ԓt
��
 %P��Xt&���AE
�sp.��Q1Z������K������b#���rt�<R� !��|�nL0Rx2%��	��\'�L(
���t^&^g7eR>\]�8��e�'�oo�M:y���KBv�Sj��
-w���4�)\��0�0
��)	߭���L�� ��q�ެ�:�w~Ji9!z��3��
cN��y����
b�x���h��x�
��p�p'3zt�
Z�8e���������
2b?�����C�6������k��"
F�R\��M�'kk�Խ�q��h$�㤕xS�>��%i�>@�������b}�MUHs1�������^3A��U���r2��(��(�c=�� &�����hӆ�~ �N)�E�zw�Mߨ
x�
1,���zS���QG�AFe
-qC�a!?�e�3�d�(:ȸR��k��=c*��dH%�`�yM'��?%������X at m�B�gE^�=9%8b�M��)�8RԜ�L�%
�d'��V�o��[���="
�Z��
��D�J�/%�2XD1���ڿ�j��y}������ �Z%m*O8
/mM��ö%ֶ%�~N��	wY,���[�/J�����1kfQ�X���`׷Yէ�@��'>;r�DԨ�ce\ôn=�8�!ꄋ�o �0g��~�	�6f�E�����狚Y�w�!A�kj��w%��;�R���(�*�eʠI
��E���Fc�0r��a4�o��;�����R�p3�O�tSgPb9�>�o�wA��J
-\��;�E*=b�[&"*#��!����~nb�>IW�}o+��&
ʆ2�t���+v�_E�Y)�S~n�zn���
�U6�����˻u��~�M�
i�7��� 
�76�A�& ����z�b;�o�bB��>����;Y �U@"���*���bgak������� [...]
�M7-���#{�:�B4��UC>�_�h�[��(�8
w�Ճ�J,]�hc1�V	L��}�6�i;���m�]
ѺMR�C��ŠJ at n�t��
-
-6@�
V4��\��Z�2m��'u�<
-�˅
|e'�����قeG�h0��
C�%`�Y�[(S�/��̢B��Ƿ�Īy4
Q���*��c/��,���ot������M�\���"�nN�
.�Vm{7q��W�
-�j�*�.�
�d���X����Ww��?
-K\õ���׼�{� ��b[}����Vt�p{wQ��l���]�OdN�xR5��M
@K�J�^Z'M�Ϭ(��&���ry��yQz��Sh�ɏm�X���o�VY�P5�I��f#A�7��)�����\�I�t
ҶYZ�M�2]�/P�[�|��u�\6��/F�����˿��y<�#8
-�l�]?aϺ~b��(}j�d����q����P薷
��r���+nn
�h��k(�l��(�\n}m��19���	p�s�Q
0eU��ha�T��,�/N��I�M�����\�jϫ&��b�'�Ȫ�~=��f�@��a[�vz��+~r���۲v�_��.,�X4a�S�:VP�o���[������
#C�̀
X��Y&������d:�ɡ�2����;"��
+d�gii �
S��4#Ke��i>}���$�
����<�Ơ[ke:������U�@�x�n�(S#&��B���&�����6U⮲
�gL#	�
0,_�xP
%�M�34' R� C\"TŃ�O�կlc�QdY�.�bU�`U�������dO�p]Pe���tS�UZ~�Xn�������gz�*���a 7V��g��W
4ݤn�rǏ�t�{�y
�N�1v߮��ڊ:�	�E�����0vs
xum�	ݲ��.�)*z-;��)e�-o@ש&R|��0��tp�M
E�
���
2
�����wD��-�5�
���4 Oܑ��?��.6ŪX>Dx���� ���z8�@$9.��3�
�'19�@���U�sbr%arI�)Ln
������SF�\uv|�<�;�؁���B��oE&���$"���b*�6
��u2�"���-����%����=y��������6��ܙG;=����8�BJ�V�!�L�X����4)?����=��[�]O��J�BX�P��`�栦 ��Y
����Y:Mg
-	b �̸������ځ��<M����U��i?��b��m��B��e�셂�m��ӼXgy�_
��}\H#�M�Ƚ���쏄�t�g��5�
�nf��		P�F����t�櫺��9�U&q��M-�;���2�vh�
"�@z����ۇ
K�V��]� u{{�l6�B�/���ni������l�%����t��`�?r�'B�KF�
�AS_�.�(��–��C�����PWlM9Zɾ�ٗ&(����`�*c�y��]�o{��	���	�aC�&<;��W��jp��	�k���d��
)�:Dxֽ͇�E$p�s���Nؓ�T�z\R
%ctV��6��v6����wOZ
N�����
���d�
uCK�Q�:�@Q�H+S0j�
���B�
����]e��ˁ��+�;
s*�
VO6�p�HL͐a5�DV�nՈa�
-+�?����W�����鏬]}�Ȋ1���֓
:
	�4+��c�����9V�({�ԅy� %oV+�B"P�v�޼y�/�Y��o'B��
�$�
G�,��h�)-�͆ ���x�6
X�+��Q����][U���J[w[כ��˛�e��K4+���a� ��d�g�l����m�@����0%�O�3���D�%�۹v?�����l��
����1 at m�
-endstream
-endobj
-13431 0 obj <<
-/Type /Page
-/Contents 13432 0 R
-/Resources 13430 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13376 0 R
-/Annots [ 13426 0 R 13427 0 R 13428 0 R 13429 0 R ]
->> endobj
-13426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.54 502.85 309.037 513.754]
-/A << /S /GoTo /D (index_BHZ09b) >>
->> endobj
-13427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.275 334.663 293.971 345.567]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-13428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.332 198.737 235.598 209.641]
-/A << /S /GoTo /D (index_affine_relation) >>
->> endobj
-13429 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13433 0 obj <<
-/D [13431 0 R /XYZ 89 770.89 null]
->> endobj
-13434 0 obj <<
-/D [13431 0 R /XYZ 90 645.919 null]
->> endobj
-12988 0 obj <<
-/D [13431 0 R /XYZ 313.62 506.003 null]
->> endobj
-13435 0 obj <<
-/D [13431 0 R /XYZ 90 499.363 null]
->> endobj
-13436 0 obj <<
-/D [13431 0 R /XYZ 90 428.657 null]
->> endobj
-12989 0 obj <<
-/D [13431 0 R /XYZ 90 393.987 null]
->> endobj
-13437 0 obj <<
-/D [13431 0 R /XYZ 90 389.504 null]
->> endobj
-13438 0 obj <<
-/D [13431 0 R /XYZ 90 304.685 null]
->> endobj
-12990 0 obj <<
-/D [13431 0 R /XYZ 90 270.015 null]
->> endobj
-13439 0 obj <<
-/D [13431 0 R /XYZ 90 265.532 null]
->> endobj
-13440 0 obj <<
-/D [13431 0 R /XYZ 90 170.891 null]
->> endobj
-13430 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13447 0 obj <<
-/Length 3143      
-/Filter /FlateDecode
->>
-stream
-x��[[o#�~����V"./Crh��t$�&۬ӗ40���
T9�����#9wSK��C�V�\y�s�H��.��W��x��!Fq]�F�F:6D*�ZD?Nb�L��&*!�(��.�ݷWo���`�]��������� �N����ǟh���o"J�I���Us��e����ҥ�$\گ���2[
C(�#�I����e�=����:�^�|1���By���z��n���3���2a
��h�\qA
He�dC����Dw�ńc���M�v�x�t��'T@�Ѹ�M�-��y1���)]��t3zr��ʊ�[k�58�ab1�41���)DL��{橺�� �;ͫ��z���c1���L�[;78��'D���EV�Wy����7�f����[��t�k�a� x�]ɧlKQBu\�����"Y?�
�
��F5$Q�~�ߔ��̈I�g��|{x�M�'�ȁ�-|w�͌+Ax̣c��jy�b�^=�e~��k
����ֈ
	��zJ�s�ć�f���b]�/��h��F�
�P�xFX!����9��r�3b��he%rfF��g�ܟ�t�jb�׍Q�!�3�1J��V˴���3ֵ
'L7+�'�DO�&:n��|~Ȋt�('W��pN�	�z<i��
݄ ��'��uQfp�d�4er�._�i! X������@�i��� B�	���V����#�c�y�=My<Y�Ul�U+�M�]��S�ݬ���S_]>�g�Mz�� /��RU��M�y���n^�w�"]^�OBaL��>�@q7�� �13�o�֨�~��2�E<�E0 �
-�J��L�eA�3AHgXM7���f�㣌*`<�7_�ST�ʂ"�J0=܃�E�����ժ���	����8�*:�,dDd��
Ee�DŽ���]^d���K[T�60���Н{gBA�P}�zO��
���H���C��-,���g(/���[+�$a��
-
k�0e+���5�u�q�g�u���?����ƫ��H>"ns�d�Nb��g�v!P*F����m~W�B*ׁJ!�1]�Q)`e�E�J[k��]e��~tʤ��U$�5��(u��qwYo��K�Z%/���3x,�n��k�y�+/\^�yq�<���ܽ7>C*VT7��
��?zo�\��-��{�Y�ζ�H��j�����C6ϭ�l�/�<��EO�p>DgO�j�~i,����	�p:��0�3%Rj�A��
�
�{#����hC�!.@q|%9�D�IKn���Ute���@
�D#�Iik�
w�S
�T���A��U���z�8����|~_]��
�\�þ�Ī*ua0[
j`�"��FD�Z#bnl�
sH����wn���RH�&u���Aȝ�Eq]-
���e*l���$�X��+��E<0�[�c^���6Ӭ���
`�<��u�F� ����>��,2���F�J���dzoh?¿��ľB'��{�p
�e� �u�
 [...]
-Y�қ*�Q	�
�#b��-;`[qϱ�T�g����X�/����{t+�z�_R/��[=e#��(�z9ؗX�/1c,�	
�0�
4 0�l�@t�̗�`�	JT"k/pս�M�I}�q�Z |˫;�Ͷܤ󲾊܏L[����W��\�ٲz���KLG�o���}��*"
�J�+���כM6/����S�S�l�>�ֿ�S.�vrhMD��v���m�׃J�[���U�.�7��M���K�N�&�S#����J�nX��z�GR��m`�a�
̻b� �
�d�~V�C��b�_�
K�&�f��R�>�BMU|��M��V�s�=�H�
܉R�u�ܧsMvѹv�M�\����s��M`G�4>���6e�}[�a=*��� �h�y�m�.U�nX?
P�_��hz�������;ό�1=�(]W8�hm./���j�z�
cx.�ۡ�
�A3���b���7I
�Tw|��F&ԭ;���z]�E%��N�%iMW5�I��j1�$��G�t�
/3#�����xd͆D��>
 ����r�Z��TA �:�B�n)B;2n
$��b}�BV��B���5�a�Qȯa��$����u��l���΢?_E��;�W�2>���=��DE
���lD�ct����*7zT*���$�x}�
Af���oBFo�g��cy$�v��w�Ċ��E�x�K��C9h��@0��2��GS:�iU�:���	���L���q����ϓ�l��x;V'Og7,����1�D+��21��
-��9��ILW�u�>adu�i�կE?
�N��n$�6ތ	�S�n_ M!*
>�� �/�|�'�����z��[
�g�
p{�6ѣ�
�8�zs`0��vz���X��9.?�K�d��
� Q�j�x�̃�™u���S

�'��.ڼ����p�|���/
#�3�<bҸm�sFj�
�D����n���=.�9��B �?��s���3��%��8�lZ��%=>��M��>[�-��ϫ��2$][.�A�&[n�W!2[ح.}�w�YN@������v�;�w�
˾�- ��аj
�N�Rzg
�g��t�x}� �.E�ι�KN���d݁��lv��IL�uG��:߽����
�m۷0�.�.�
��QbX���w7�'���`a!%
F�>~u�Nٍe�?����}�B��]
�-gm�
��26i���D�����}%�?PD���OS�&u��D��[����g$����UN��Id��!2E�?yS�_G�L�
gx��~�<��.x"D�?cd�U�q�$$�$>����cQM糚6���P���SHv����6/J���T)�"X}��������h�U�g�>yT��H7�͹�D�?A��s������ş/��i������n��T�|����֊�AެXw�H�J�~k���P��}�����,��l�ǩ����hZ<���l���!���`�vΤ~�j�z��Q���
}dLdT�����͛�ǻmV��U/#g�2|��y��n�V�M5����{
L^←��=
-endstream
-endobj
-13446 0 obj <<
-/Type /Page
-/Contents 13447 0 R
-/Resources 13445 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13376 0 R
-/Annots [ 13441 0 R 13442 0 R 13443 0 R 13444 0 R ]
->> endobj
-13441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.953 600.778 250.388 611.682]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-13442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.151 347.451 244.345 358.355]
-/A << /S /GoTo /D (index_affine_relation) >>
->> endobj
-13443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.2 110.078 480.931 121.717]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13444 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13448 0 obj <<
-/D [13446 0 R /XYZ 89 770.89 null]
->> endobj
-13449 0 obj <<
-/D [13446 0 R /XYZ 90 718.682 null]
->> endobj
-12991 0 obj <<
-/D [13446 0 R /XYZ 90 672.057 null]
->> endobj
-13450 0 obj <<
-/D [13446 0 R /XYZ 90 667.574 null]
->> endobj
-13451 0 obj <<
-/D [13446 0 R /XYZ 90 572.932 null]
->> endobj
-13452 0 obj <<
-/D [13446 0 R /XYZ 90 494.934 null]
->> endobj
-12992 0 obj <<
-/D [13446 0 R /XYZ 364.289 418.73 null]
->> endobj
-13453 0 obj <<
-/D [13446 0 R /XYZ 90 412.09 null]
->> endobj
-13454 0 obj <<
-/D [13446 0 R /XYZ 90 319.605 null]
->> endobj
-13455 0 obj <<
-/D [13446 0 R /XYZ 90 241.209 null]
->> endobj
-12993 0 obj <<
-/D [13446 0 R /XYZ 90 193.312 null]
->> endobj
-13456 0 obj <<
-/D [13446 0 R /XYZ 90 188.829 null]
->> endobj
-13445 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13463 0 obj <<
-/Length 3210      
-/Filter /FlateDecode
->>
-stream
-x��\ے��}߯�SBV���_6���v�Q*��ɋ�ڂ��.+��A�d��sfp
�r��� ���s���4Ft�8��on�tw��k#F�8���n>rtd�#J���1���ɔQJ�o'���l�ܿ�p:�,?=��,��x�%٧�ۿ?���:Y޿{J��ɏw߾����x�
��`� ���#�����0���8&��e��N�\Qs|�����.��|���l��8]?�pB�%s^��Ww7?�0��#��EcG��~��n;�D8;�
Z�$�\���|wC
W��+�?
-�Cf��u�R92L's��d	w'�t�d�m�kOr����_���,��r�2M:lk���	sn��&��CR�4#N�����B�$~6��x��I�;��ULsܼRݜu�5q��z�=�\��]~���g��v1+��0�
-�X$�ŝ�<�ܕ
�u�%��/i��d��/J��xd�%�_����a�ج�aG(�	�����"
��Ḵh%a�
�E���
2
1���&Œ�����$H^�N'$#u*Hf)�' R�����fyX.V�j-b��C�eh�9X
C��.
��LE�-6����??���S�*Me*��_V>�M�����Ӂ���	S��t�=9D]lm?F RaVD��s�)G��à�,^�G
B�'z��7��:��)��N�n�5����T�����
-Dr������Kk5W�Y�O�W??��~9�Ϟ��jf����N�f�>^fX��b��G�%��E�
�e�dm��w
��>��#!+�d�h~xY3��cG�:"d�}nw����z"�a"u��'!yD4_��SI,�Z
-{� �6U��#�E
Q�E��=e��?"�Qҍ�T�JK�e1يy�A�y��U�B��%�0a ���ń����(LU��Ŏ޶ت���+<���1�^a�3d��2�l���i�=>X��� ���S��є#s�u�Y�
,���3��P������h�U'*�Z��v��A��^�z���&�ߕv��ͼ�C���8I����n9��БU�}K�p�PӶ1�m���îp:t*t�tU�=;?LjB_�zC���l/��d
ެ�t�T�&�Edخ$��I)�	3��kEҁYM���s�NV>�Ю��B�ƶh�H ԓ5����E�Ŭ��� ,
s�p�Y+�e�T`�0H� �E���no'SO���F���v^E	/(a�>X�q,sWae����$/��d^��{s�s��
``$M
<x�J&؍�� ��^�N���)ծc�
hu��7�u�d�_���3�!���:ja�*D���A�|�V�j��}�>K�����E|�BS�P�Ҹ8N��� [...]
��i�]���� �c�4�;��D��������=�
-��zNv�
-pA�p�_{�c����f�Cx�E����D��(��
�(
���*.�YgH0vO�a�y���2!�
AP
�OO�	�����Ye눖zjqa��JWϼ�ɱ��V����f�
�Ĩ�Q��n�w�D3M�+�<�(���J>����0��v�x���"��Q1m�����/�c�W�H���Y�.1ԫ�`��iiFR!w&Z6�x���褍"5N�
�	]lK��KC�aZ�\0
-1�vfІ�D�­��ar�:ݨj�s}��r��"�a��eh�9X8�1)
-=*0>^
'���(H�S�$
5�~M:�rc�'"�a��\8],�<:Z�O�����P�
���
2�"�
-��
a>
;��nHl�ѹ���ha<��#����[��\t��]Ttdg���JTb\�ªk�++�:��sw� uc�����L�[R���ΒŇ�i��7�Š�g�pe�'&�S,�5�������u�
I^3	��!�D�v��^��D�ň��8,�z�ģ
�@��EL�J����b}�yY�:iU�Q
 z1̙��ЛЋXdf^7�(��	n��3 ��x���iN��O�������wJ˷�:�AD�F�胇�0H�4����s��F]���,=L��{}���S QxQ��˦ 
LԈxʼ��?0�1v�Aގh82B���
q����Ga_�`
eD1w����i�?�OJVS��&
��aQ&M��^R��.S6W�|ম�,Y춷��l�FG�%��\;�F�'d4z�α��,��ݵ<�+��ޟrc��G-�y+�FN�߬Ӯ��B�lP䊖̀v
@����
ACq��1��
�b�Rq���
��
��JS�F�V��6;P!t
챎
,���t����U�ψiR�>�:�)��4�]?�G*���7�G����:H+${
-9%R���
���!�m���h�(A,�=/��B
-�K,"�*g���օil��
�u�LQ[<�LE=�hT�>�i�zԦAS�z�!���z�y�K�u��`�C��4��]3
�$���:�2>�B��	��0C�@��̯�	�
��
��
\b�J8��Q3����ʒ	<��ɕzt��
#����y���n���}��
��;���ܰ~$@��Cr݃K
�b�����*�„7V�p��s���+���XS���,sF�<������4N�$�]nk/H�H���������9�A�
;E4�?��{F�>{
�ӧv�>'�����sB�b;�b��

j�{��
��W����U�tì�M3+Cu��Y�6�P��h��xh^^5���
���@\���#
T�'Z�h�r[��y�_צq��w�x9'	�H�^	w������y�5_��f��|)V�ԋ�t�A
��
�H^.�Nd��B
މd
��҃�>�� �$\����+������v�>�pV�m���˺���QR�
c�
�>�@��DR
�� 6?õ��x�!ݮ >��>�_|�����>�U�
C��m�DBD�[P���

N�8k3�����(:�37!���g�Lf�ۡ¿j����zI���dM��6�s��V�J�:�!1
-��!� ��M�cm�K\o��@*͠!��]�K|���ũ�aI"P�k-�V��
�� �}�&���6�~;Qj\��o����$�:��3�4�Q�͓��@&�.-��\��ʫ���Ԫ0%Q�U(y��o_�~��M׏�a�o��j���bYmʥ�X��*���
�B�ּ���|O�	|&�5�×������?o���Zs�C��
-endstream
-endobj
-13462 0 obj <<
-/Type /Page
-/Contents 13463 0 R
-/Resources 13461 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13474 0 R
-/Annots [ 13457 0 R 13458 0 R 13460 0 R ]
->> endobj
-13457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.852 500.205 466.489 512.684]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 262.825 422.924 277.541]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-13460 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13464 0 obj <<
-/D [13462 0 R /XYZ 89 770.89 null]
->> endobj
-13465 0 obj <<
-/D [13462 0 R /XYZ 90 720.814 null]
->> endobj
-13466 0 obj <<
-/D [13462 0 R /XYZ 90 630.064 null]
->> endobj
-12994 0 obj <<
-/D [13462 0 R /XYZ 90 571.484 null]
->> endobj
-13467 0 obj <<
-/D [13462 0 R /XYZ 90 567 null]
->> endobj
-13468 0 obj <<
-/D [13462 0 R /XYZ 90 472.359 null]
->> endobj
-13469 0 obj <<
-/D [13462 0 R /XYZ 90 393.963 null]
->> endobj
-12995 0 obj <<
-/D [13462 0 R /XYZ 90 347.338 null]
->> endobj
-13470 0 obj <<
-/D [13462 0 R /XYZ 90 342.854 null]
->> endobj
-13471 0 obj <<
-/D [13462 0 R /XYZ 90 233.215 null]
->> endobj
-13472 0 obj <<
-/D [13462 0 R /XYZ 90 130.51 null]
->> endobj
-12996 0 obj <<
-/D [13462 0 R /XYZ 90 81.969 null]
->> endobj
-13473 0 obj <<
-/D [13462 0 R /XYZ 90 77.486 null]
->> endobj
-13461 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13480 0 obj <<
-/Length 3116      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�~��ST	ù�J
�G��ɋ�b-�%�
-.�d��盽�@`e�U~`Ǡ��盞�w(�7�Q���+�_��_o��_�s�i�{��=G{F:�4ލz�������􄶄9�_e�ݷ�/��}뿻zy{���W��r��{�_����F��L,��}��{�
����^���eAF�c��|fF��0"�`�(��m:_͒m�U�~�a�O-'̰R�?�#�i��O�t�����k׿���HS��sD ԓ\�#>
��/��|`�h��
�f�h?Yϓ�7N��٧I:Z'w����d���滇m2^.����I��˜!ܺCֆ��


-n��!\�j7�{����f<�~�H��l�s�z��
����sD(y!��̖
#����h��b����{J�"ݟ�sN,V����"V�p��:�Γ���~ ���FV^���X�ir?�V�4F
K
u
@y�
4��JjU�>ž�.wo?��t[X�C��l�i�"��B!*-
���62�PPA��!z^Oi��{��j=`p�f�"sXAT�!~�֒z���^d�p�$����e�a�a�.�x8K�0=m
��.���
f�L/��:�n777�����(~q���ds�u�X��t����� 3J��t�l�k`غ��b�̕ 
v�9p��rQ�fT�p������X��D:��
�έ�W�9z�%�h��Om��� h��v(��.�Y�;�6������>�T�N��|L� ��R׃�|�<*��w8
#*�#��V�)*�r���v��N7��a�� /�ޘ��?= ����}�{�
L
\��hZ�Ƀ��:��	A\��Sڇ�
s��a�qDY�D�"ˠ��H
��Ȁiӿ.
���y	`L}d��i����
-���
�Zn�攕(l^C����_!����(�|�]��'؞�.&Jև�L
��8͐OK4�z�w��L�^#6,G8��7��"dBc

U6�ֵ�M����Ά2T(�
��eZ��)Y#'ۦ8<XJ��Mr�o�/�w�)��P���9�&��5"��JD��z
-�����Q��� Y  
��Ɖ%�=�!߱��b���
��a��Y��-Q;K���I�( ����o?�0UfO�'��!��eVZ|7�Q@/6��:���x���
v���.pD+r�H-:�b�s$Z�\^w�DD:�CVYG�.��@�Rƙ���L�( un��Ӡr���+
�����b�k�9X��
�-L��L��ו� ���?�˔�C��L���
�'ϥc�i=
O��@U=y
u�ζ�
#u�4Bu-1G���h�
�ɪ}�Q3�)�N�wx��^S�
-xa�Šw���@����zgK�&��5�?D��)_��$�˟
ҕ?D��'d�*#��k���efRZ�"}$Y*J�P,��+���!2�
����N{���5ㄢ�S�]rޛ���f�H�H
GwI����
�uA8E�GE���
 ��*��[s�Ԑ �~QCKo'�����(�����`��6����^��%�B��9�4�>
�O�֏ͅ�HkF���w-qD؊���k�W��f]�*�d(�3CFS��G�a�
r-�;��u�|�l1�N�ՙ�w�1ĉ�?I��3bjy{���6����+��O�̓��vB<bj+7P�
��l�
'<�bvmLr[6���a[8��^
:���
3
-}I|j
��"�1�F�KD
m�I�3{�����Z;mҷ�d'�6/�ȓ;m]�\tڂ��;m�坶!�lmMɴ�R'��x��niIqZ�~6�D�r6cg�Օ�q2��
-�����m.�.p縀�#>�A��v�����N��X�7���#xK?G�&ꦗ�y�����n ��HR�`�R���@����^����^�(>�)� ����g�5�c�
��ZxA
��(ēacT��fe��*h����f�Z��"TkKe(�@ڣ�
��Z�g��T�˴T�Y-빁/�Q������;��դY�

�
5�7a}�i�c�ЅzDɡ@�;*ǘ�?����oL��C$;,�x�Zb�'����N�"B�f�朾ȅ��a�T�`_�4���b��"��ä�s�ҵ�
,�ɴ6
d�`��I�
�̣(�L�8J�z������ִ/?DJm�����;s at MvO;sO��)��df��+��pw	��v`���
�M�9�q2�̍�1�3ҹC;K�y�Вsn74F9v6)g�DE��
f;*�$wa�.�m����j+��#��W�옋��5�ЈQ�
.h��~
-Ź&��^BX"���B���hd�Q�����CA������,��n�]�<ʨr��+���S�q��G����i1��i�Bc�Y9{	�	��E~�E)��Kᶋ�9S�3
�
����X`5
r[�l��B��^��. WR5���
B
a.u}�avybX�q��U'�p�"4X�c��g�D�u*�+�nb��+���q�����z�_\�&�-�Nf���'����̉�=|���5�n���Z�z춇UD�n���/V.����
8���=�j��a�[S���
Զ�<���}�A&�`�F�����@���l�
-v�G 
�
T�z�{X
���"
_���"�z���%�<�fz��4�������՞=p���
e��.���E� &u�#.!�
6�i^�xO���.�i2}�m�`֢g�U��4h(Q�9�!���͐��8�/[ǐ�
S�A\�
-�$�
Ϝz��6��9}� Eb=�ɢ3�p_�!d���c�:���&
��uzӄ떙g�4�P�(5�QQ��wI�V#�fu/l��s�e�<��>߰v$@$]�ޝK̰��̘�Xolb+������s��
��GXS����rf����
��Ÿ���٦�"��-2]�]
���[
�NF��<�<�^>���<�]�Lo
eNF��j��v�����D���
��z&'�؅�ZT��K��=��P�"��ٗ��ٗ�o���>��-!�7��a-�\^�����sF>#�����y�:��M��� �[�x�?��SR<��k�~�����p�6��
����۴,r��[�����0i�$QuA7�nW7���O�M����|�j��
Ү*�|,q9_�
��
|8Ow/
A��� '��a
-endstream
-endobj
-13479 0 obj <<
-/Type /Page
-/Contents 13480 0 R
-/Resources 13478 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13474 0 R
-/Annots [ 13459 0 R 13475 0 R 13476 0 R 13477 0 R ]
->> endobj
-13459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.382 648.705 394.782 661.623]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.883 401.529 440.282 414.009]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 164.149 425.662 178.865]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-13477 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13481 0 obj <<
-/D [13479 0 R /XYZ 89 770.89 null]
->> endobj
-13482 0 obj <<
-/D [13479 0 R /XYZ 90 622.138 null]
->> endobj
-13483 0 obj <<
-/D [13479 0 R /XYZ 90 531.388 null]
->> endobj
-12997 0 obj <<
-/D [13479 0 R /XYZ 90 472.808 null]
->> endobj
-13484 0 obj <<
-/D [13479 0 R /XYZ 90 468.325 null]
->> endobj
-13485 0 obj <<
-/D [13479 0 R /XYZ 90 373.683 null]
->> endobj
-13486 0 obj <<
-/D [13479 0 R /XYZ 90 295.287 null]
->> endobj
-12998 0 obj <<
-/D [13479 0 R /XYZ 90 248.662 null]
->> endobj
-13487 0 obj <<
-/D [13479 0 R /XYZ 90 244.179 null]
->> endobj
-13488 0 obj <<
-/D [13479 0 R /XYZ 90 134.54 null]
->> endobj
-13478 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13496 0 obj <<
-/Length 3467      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���SK�
��N�L��$M3I��I��<�d<�D[l%R!);��. ^Y��t��"����� ����������B1�I������b:
eL����ǀQ��9���
�r�ܾ��4(6O�tU&��f�2)�޽�nY'�E�ln?��]z���7o��X�<�1�:��
�Ol�0"�M���0�������&���9W��<H��MR����]Z^�(H�%��P��
i^}ys��2tƬZ	��r{��:[��of��8�=�Nۙ���ه�ﯨ�0%
-[��Ո
cD��yz��O��8��($�9�t��و��A<�aH�R��rJnu�J�b��I]�FE}V�b���K�Ѵό�$�ᐙ�5Nb$�����b�-rh1�'��NwM����`S\s<��~��lc���{"X�|�����
��3�<w$�k���veZUY�W
;�n�
-q�0ͱr�Tgh
z����~�浽��k�Z�w�����GN6{[����@1M�k��(j�
�l:�^@���-i�Z$���@_δ�$��Nė�-�]m��(qL�`�#JF��-h����8��:�����`|1
\٘"�֣h�3I8U�F���w2�*�� 
ġ���^�{���`�l��-X�Ky�JQ1�� 
���Bq츠�iL 8
�Y���`�Zٝ
e����DG��e#�;DGDҶoVY��Iah���G� ���˛�m
-~�3��D�� ������I
�R���H$E�"�l�C6�!���
-BYי
-�,$��>�:�<���q��u��vNJ�aW�
��<�!��:[l�3�G�z�Ȅ �إ!���D��.C�\z���'�R��
���G3
�

�3t�O�Ƃ��9fD
�^�Z�;A�(���r�z	���
�Qj���8A�t�s�d��m�	
�()
P!�iAU?��<�"6t�M���e�r�A6� �2(��/�F��"f��Ő�t�擓���
�.
�
���#�k{��K:L�B�T!��E �0�[p
€�0�0 �b¥��&�U�a���bX�
�
�Ov�.�G�S_ϥ�����3�*̴���<�����4R��,�8�ҎŸ
-a�t�خǓ���
D��f�󖑏Y����Aj�
X�r	��}�3�p�����!|�i|��`�
r.P at 0n����k_�2�Z�N2�`y���WW����ȼ�F��"��4�E���� 8�k��i��h�T�;H��������HH]�����%��(�c9id�
h��AA���aݹ�3K��b�bp4�.�q=Y�0��M�0����W2
�
�
�
t�b8$d�c���t�����\��su�z���� / y2Ӕ�)d��LS�?��e��e��|!#r=�L]�jB-�
%��(�zߦ|J��)�f��
?��xRf	Xbu�!�=2j
-Mq"#S��y��åNTo<
@����9����ۯ�:�O�ۛ�P �۟p�4[�k߀
<���G
��`&���3yt�ҝ�� �$����|���Ey�����O����>-�k�|�)�3wYo��lLK[c:���Ԅ��2�ػL�����T�7�D�HM�a�r
-�'Z�,�Cs���)�R�Y��p0��o��2�AwX���/����-l���A
-�S�&a���s4�t�$�,d7���AV?
�E(
-Y��D-B	B5PK��Ja]lV�Ճ ��fڋDkH�*hQ/�����w�Ra�
N�	��A�;PI����l�O6����G���BB]�S�8H%�h�^Wa�JC�pu�[[�	4T�j���v�2í�t5J��aqؾ�B�˺Y�4��/�� 2�
»$fQ�!�'%$5n���D�4����J�0��nKMN�TSB�-�"s�B�]
-�:$"
��f��9�����ݟ
�r�b1�����
~��&���X�
Z5�%n=��]r���z5�p������Y���V�q�EO��:9E
`��2b��0P��9�TP.s�$o� �"&���3a�+%��&儦6�o�ͳ����SH�L4�Ǔ�ds�5�)�F��#�4C�}��{.��q�ʳ!�Z�
P���SS��eP��
�QH��Pr3٤��@�"&���3a�me��Qڊ��3�
��-�Q�]�;���f��������"��y�`mOf_�n_���H��?�JhB�NM�`��5�b�
-���LPm�g[:���˘�c�τŮ��
��桮ƵN�l��\Kx�L�*�E�hta���g�j�fQ
�1���A5<����ڃ�K��W��(���Sf��S����O�O���Ӱ��1e��nVnwg!�2F��
0򾨪l��ZR� �xAkW >�y
"���˲]}��+�cڏ�J�[�H�[�s��%Qc
�7�=E���ُ���qd.����:̅ �!���9��d
�>����*ݥ�ʝ�4q
�cDʝ���_f�<��z��o�\,�S�~Gr\��C��璉�u�8͋|��oVH at E:��<���9�
;p��
�� ��>���^RU�-�7޴/�rw�`���9��7P�)�
�D���L엨^)��}R�l�
[�,�j��0����l�vM���J�7xk��wE�5ZP2s��2�u��^Gl�Gj���$?.q�ks��&P��Cw�n����e\�9[e t��	��������
-�K��f�q�j?ʁ�,lXæe
@' ��p5��'��
� �[0@0o�f?ϴ
�&ʓ{5q�1Z�u[��8YfUڼ����N��A���ڇ�9�� i39�#�m�N at W�g��\�fQ�]�c~�%��l�~u�8
g����
�4q�Ah��4_h���
������pQ�֞�g@/:�f{�-`��/b���v\[#2�6ۅO�
C����7ر3�1��{�v9,x���h������G��ߘ%��5L�		�˶s��ڕ=�֏[��2��*�(�� �\���5ܥ�Ӭ��H�;Ƃ��Y3[���YǜE�d
�������"�G�A�y�y�6F��W�Hu���<X�°�_N��`�{ܮ����q���Fl���
n�W��ژ�
"�m�Z� M���rm��8
(��L���Q��A�,͗Ͷ�o%z�B"�}�ӄ�֬����ճu�T��2�m���˾�a('���c�i��I��4�lj��Y8�'=
�
��aP]ROv<o:)��yC1_�=�@���<����y1�e�g��B���_��ǾZ�g&��}�
1�’|�)��)4�a<�!�A�g���P=Zl8"��1��ӧD
�~lv�;-���o���F�q����QW�&�~���

-}�CB.��2��f̜�lT����������?����$���G���x1�p�|��#�t@*
>�M�o����i��&P
+�äT�6���ݻ�o��*��	��𣄞
`�q����̷�4�����4'lZ4QF4�l�	P�Wh{a�M�~�<l^t7�~������Gs�_�A�w
-endstream
-endobj
-13495 0 obj <<
-/Type /Page
-/Contents 13496 0 R
-/Resources 13494 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13474 0 R
-/Annots [ 13489 0 R 13490 0 R 13491 0 R 13492 0 R 13493 0 R ]
->> endobj
-13489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 551.871 322.446 562.775]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-13490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 403.99 116.998 414.894]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-13491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 362.794 243.45 376.741]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.883 194.859 361.886 207.377]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-13493 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13497 0 obj <<
-/D [13495 0 R /XYZ 89 770.89 null]
->> endobj
-13498 0 obj <<
-/D [13495 0 R /XYZ 90 657.82 null]
->> endobj
-12999 0 obj <<
-/D [13495 0 R /XYZ 90 611.195 null]
->> endobj
-13499 0 obj <<
-/D [13495 0 R /XYZ 90 606.711 null]
->> endobj
-13500 0 obj <<
-/D [13495 0 R /XYZ 90 533.848 null]
->> endobj
-13063 0 obj <<
-/D [13495 0 R /XYZ 90 499.178 null]
->> endobj
-13501 0 obj <<
-/D [13495 0 R /XYZ 90 494.695 null]
->> endobj
-13502 0 obj <<
-/D [13495 0 R /XYZ 90 388.099 null]
->> endobj
-13503 0 obj <<
-/D [13495 0 R /XYZ 90 128.781 null]
->> endobj
-13064 0 obj <<
-/D [13495 0 R /XYZ 90 81.969 null]
->> endobj
-13504 0 obj <<
-/D [13495 0 R /XYZ 90 77.486 null]
->> endobj
-13494 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13511 0 obj <<
-/Length 2561      
-/Filter /FlateDecode
->>
-stream
-x��[mo����_�O�D�}1z�49�K��-z�m1q��T
�����U�^,3�
�O������33�
WQ�l?~<��>�v}v�J�� #�
�?�$$|��G����&5"F�S���wo�_��������>�tF�'
/@ ������8���`bftp�-N|.�����fN#��ՈD���`�@�r<!�Q-W����*�`X󨦈(R��?�#\!�u5�xXEI���*��G ׈�z�_{�z��j��1�4�����&QF���c�Ga�
o.�����<�f�͛�6
����wwE8K�pqs5W}���f��]��
�0�)Xr#�nC��Փ]\L�1�t�
b�K�@����`A�qx`lC�(�DXQ�R.O�QϬF j� �

۝4I��9)aH
:Ĝ�H�7
��"��'ze=ss��d�)�{�1�*��s�
FG�b�{�8x[!Rp��K\<ܼX�y^�M�1>�U�ĝ{���>���g
�d�z���_n^�������������8\:��[�*������ՅR�4��K/M�<�]X��x6/���
��e�8�U�cV�!���� �<.uԠq\G��r�i��Vq2�ߜ��z���>.��
-�:�ر+;츛wi�M��f�:��
ǛkI0E�	2�!ղ�(f9
O�(�J���MEͯ�G��fb�

����E�Vn��u%B�4��<h�P��ؕꝱ�&���~

Ψ�x
-$
-�)n�w-��'jԁ$���]�K.�/�2\T ��h��~�ab�7��,� ����<���v	���t�v#$�A!v��^w��� �y �B��ێ���C[�6�R���^#
d��u�EIQG�y��{�U@)�rUؽ��v��  �&zV�+�@U ����R�Ǟ�h��`��*�oh���N
U�숃�?Mtj����߾X�`�S�3!�6ة��N�P��'3;���<��1�'��9�r��,�i{ʣ��S�Դ=wMzd�L'`}�&y�G

��Ɔ���v�7WQ�%���T����SĪ�T�W,��g=
-P`�D=�%[ˀ���r[�z[��x�
�_�s=��)�#*���h��h�Q��ַ��-��YE��~��[�d��M�5o�d?�cZ�R8�c�»R�4^��q�-ٲ��pu�B~�Wi2�|���-a'h
�?�Y����yÑd�7�g
�!S1�$Y�Kt<
�����o�A
�	�P0q۪d��6���0������;�\�N�8/��^m9,r�)�(���"���g����z�d��/� 7��|h��:x#؅��Ȋ��uڍ-��!�
�֡%z�Ši=h���Kuj��4��1�����:O�k7"`��dH��,�qu'S@Ʉ~B�ɾם�՝�{��
՝/^(�Ws2EQ� �i�ĚS‚1'��Bd�ۗ"
W)  �-�vdd (^(l) eL<���MY�qcvdP^1�6�={xC���~�0Է�
-���%bG��t�Dc�G�����ʮ�0Ѵ�b���M%��R_�w��K�CO"0�A��@��f��!(�A�o�9y'�8�><���s���[�tV�u�l��&EE��Z/�.#��~]4�ؼJ`�Q�Y�1���,x�X��xv��c�b�#o��>��
;)�L���G&�>0H��j��-j�&~?��dB+��� Xd5̀�ip���Sf{tbf.�/��B9�im�!.�D%z�xG��%�zwUyRX���pՎ��u���&�5q�6�\5)��P���\K2�$
"��tV�W���n<�H��,=��N`��
�Q"<!�rOR��Q��ok����?,G��\7��
�
c2J�eX������n��;yE�K?�ŧ*�H���J�KUp/�$�
���"����ȥV�n9�O��m�ʑl�[��W�Q�Z-
�O���4J���a��2=)q-ª����I�i
Y�q������$*H����Wue����/��E��)�(�8�� [...]
%UM}ê�T7�'qb
��nE)f����r�
�H����x�|�̃Gv	�8�l��5_�;�dwJ!��
�>n��=�1���'��HB����]b;Z�}
4�Ls��`Ϳm�P ��:�V
i����>ˏ�Q)�p�Z���OihI	��V�b�����
��_jtUh�j��i�iZ\��VvE�����vv�&Lwj��Mk�ePד�I�Oh}�)dqS[r��E�C
F��%�w�����9�⺀��]�V�iGP��{�<J����z[�)�?;�;�
-2����`�u?��ݏ�3���K�=a��	ț4+�		MJ�sAP=U�v__^���Σ��c���
&��հ
��}`fٝ�I�5�A���*�x�~���Ǚۂ�>�#��ϼ(V���Y
%3����a�\�=�X�}���o=��t8�ڼ��\�
-endstream
-endobj
-13510 0 obj <<
-/Type /Page
-/Contents 13511 0 R
-/Resources 13509 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13474 0 R
-/Annots [ 13505 0 R 13506 0 R 13507 0 R 13508 0 R ]
->> endobj
-13505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 278.484 355.512 289.388]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 212.98 362.353 225.313]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-13507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 78.52 355.512 89.424]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13508 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13512 0 obj <<
-/D [13510 0 R /XYZ 89 770.89 null]
->> endobj
-13513 0 obj <<
-/D [13510 0 R /XYZ 90 646.048 null]
->> endobj
-13065 0 obj <<
-/D [13510 0 R /XYZ 90 557.465 null]
->> endobj
-13514 0 obj <<
-/D [13510 0 R /XYZ 90 552.982 null]
->> endobj
-13515 0 obj <<
-/D [13510 0 R /XYZ 90 460.498 null]
->> endobj
-13066 0 obj <<
-/D [13510 0 R /XYZ 90 347.606 null]
->> endobj
-13516 0 obj <<
-/D [13510 0 R /XYZ 90 343.123 null]
->> endobj
-13517 0 obj <<
-/D [13510 0 R /XYZ 90 262.593 null]
->> endobj
-13518 0 obj <<
-/D [13510 0 R /XYZ 90 184.596 null]
->> endobj
-13067 0 obj <<
-/D [13510 0 R /XYZ 90 149.799 null]
->> endobj
-13519 0 obj <<
-/D [13510 0 R /XYZ 90 145.316 null]
->> endobj
-13509 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13529 0 obj <<
-/Length 2628      
-/Filter /FlateDecode
->>
-stream
-x��[[s�F}���i#U�z�~q�j3��&5���e')��ME
�8���5
$е'�M�� h_w��.�6

|}����˯

2����!08P� !��,x7")<����͘�Q�-»7c�G�|�Ͳ����>
�����i>�I8��y
-������^~EH
�R��T����I�x#�u��

�u��!���y>�P���Q�X��"rW�FQ6&z%S��
#N�ż�����
7,)
LW�~��
.`��F� ���<����
-W#�
��
�q̍�� �y�C�;�a�9
w��
-k$�];Ƚoؽ�n�{;=�&e�$��[
�"bL �D�}�К #���CCR��aC�p�����.^h�lO9���V�3q�|}��SX8�w:�b%�ʇ��j�y%�aS7��8?M�"��h�~Ɖ{V��I���~�'�Y��D�dtӦx��>�Τn���� �
Fx���a�����9"��a8�H*
-�
-)�����u�.�~�=�d��S�=i֢|y�L㤨�w��w+
��ɫ�y�.���Ǒ��
SB��I2߈�d� e�'����(�@LWa
��q�̐~v�
��]e/΢���&@
-�:����Q�k���."
и
p"f��1ˣxu���j[Q�J�Q�,b��_%A"�1%GŘ�RwV�WI
?��
�~
S�]
��#wX��ɣ��X'�jq_���Zhso�7 E����Q���?a���0`йII8�MVy�<?E�Z	�����Q��r���
�q~��U��=Ϣ�i�
O�rj�i���S�h
�����)�߯"0�
����� ����:�ZAB�@Y�7~��4*	y�H8�
�X Y�^��Q�0$�1K�#
C��ZG�
h�k ˫�#
-�h�E��~�E(�	
鹮�[^̮�!��j�y<�
�1S���"JJ�9Ҙy�%��C��d
�!(��t���c�����)K�Oz���COY9)�䈲�
*+$�i&�

�Z5JúE#^�́d�[��019��I�L��2,bp��|3е��8�p,����b�s�k����:X��bP�URQ�/�����(�%
uСt�̈́�e��
;k��
-E
&X�-����T�\�x�')����Z��X#�x�6�z�5���F"�2�H5�Q;r�ˮ�����b�+s
��ξ�[�SX����.��C�PLUN�Iv^L)��|��˜`J�os�~U�.3��
i��Z8�̶0@�Fb<<��CM{`*1�7�@�����!�����͈4w���E?�ظ�&+���L#������M�!?/�}��NJ3�x�2�
-�t2�-�=a�%��\

-�4oj��]3�V'5uc�yU9�{��-�����ڭ�Ig�l���Q�
E}ҝ�?�,A�M�MN;�d�&��(
D�Κ87��(�
X���JDD��ĹV�O��/4����X�����a:�"^	��1
b�ܿnNՔ �#��	��eV�3�m����$�
����;�l
-����u6�i��p˄wQ�ͩ�:�`:��]��QVjA^",qlʏ���%�=������).uz�I\*ť�gkx	�"�ﲼ��C�����D>�K��4�q�T��lJi$
`�‘]&0T���[��t-
-���㽔(d��7���oE.S`,�
�A�/&(� �u,h.I*�KP6(pI
��D��
b$.aā�҂и�Fָ���TXCc0a0�Zn���m�A-X�ݬsp'=�P�س�Ÿi�k%8�?�W�����p�.���-J�OT��.A�F$�sW��u4<��A'��X^�_�c8�Sw%i6��"��4���63_�[� ��c��U�i_A�
���J�&��#,d�pMj��ݹ��TWP�U=��[�S�;WҾ\�X
�Pɐ�z�9�
P��A�
Ր_+��wIJҰ��P�S��:
���
m�7�F��ջ�x��
-��<�߾
�$=��^C
t�3Yoe��G1�"+�	޶��˹��>���JG"�7
��h���ˀW?���8ʝ��a~�a��d�oD�8&��&>�b*q�^|���k[�I/�C�⳧wx1 ���qy��x�^L1As�1�D�P�U�� ��ӁZir���A����֋
��r����&{�g�ou�V��;�'w����
�9̲��n�D�i�
����>�Y!����_r
-$���Ͷ��r���!kƧ<��ͪ[�Uw��&�"��)��A�N��nF��(�u�
�_5��X�ё��ٜ
��(���{�K0j℉R��j��&�i�^)�'�3D9�>O/ĕ�c%���$a�٢"�j�s��KHi�d>L�0gXЮ	gl������c������EX��6b.�W�j���F6=��"�!K=�Yh$�9��dSc�����"��]T|Q��]Z����z�o��$����䲕��R"����v��O/��
-;����LDC�$��0�_8�$������?y�}6Pe��?��*����*�����i�p�=W�L����.��ѿ�ٿ��ؘB$7�)OE��~��~��G�#�:�t���Pu�����\��L
[}Q)��I���������|�
�h٢}^ެ�.��v���0����?A���
-endstream
-endobj
-13528 0 obj <<
-/Type /Page
-/Contents 13529 0 R
-/Resources 13527 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13474 0 R
-/Annots [ 13520 0 R 13521 0 R 13522 0 R 13523 0 R 13524 0 R 13525 0 R 13526 0 R ]
->> endobj
-13520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 646.493 362.353 658.826]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-13521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 524.115 355.661 535.019]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-13522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 458.611 362.353 470.944]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-13523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.008 324.278 276.143 335.182]
-/A << /S /GoTo /D (index_BHMZ05_widening) >>
->> endobj
-13524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 234.465 362.353 246.798]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-13525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.456 98.742 371.442 109.646]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13526 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13530 0 obj <<
-/D [13528 0 R /XYZ 89 770.89 null]
->> endobj
-13531 0 obj <<
-/D [13528 0 R /XYZ 90 720.814 null]
->> endobj
-13532 0 obj <<
-/D [13528 0 R /XYZ 90 618.109 null]
->> endobj
-13068 0 obj <<
-/D [13528 0 R /XYZ 90 583.439 null]
->> endobj
-13533 0 obj <<
-/D [13528 0 R /XYZ 90 578.956 null]
->> endobj
-13534 0 obj <<
-/D [13528 0 R /XYZ 90 508.225 null]
->> endobj
-13535 0 obj <<
-/D [13528 0 R /XYZ 90 430.227 null]
->> endobj
-13069 0 obj <<
-/D [13528 0 R /XYZ 90 395.557 null]
->> endobj
-13536 0 obj <<
-/D [13528 0 R /XYZ 90 391.074 null]
->> endobj
-13537 0 obj <<
-/D [13528 0 R /XYZ 90 296.432 null]
->> endobj
-13538 0 obj <<
-/D [13528 0 R /XYZ 90 206.081 null]
->> endobj
-13070 0 obj <<
-/D [13528 0 R /XYZ 90 158.065 null]
->> endobj
-13539 0 obj <<
-/D [13528 0 R /XYZ 90 153.582 null]
->> endobj
-13527 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13545 0 obj <<
-/Length 2789      
-/Filter /FlateDecode
->>
-stream
-x��[Ys��~ׯ�SV-g�
@9�����kc)O�
-"!1Ipp��Oρc@�m%U~�aw����_7 
<8���o7o�Q,�Q,�
n���HH��BN�䗛�&#Db	�2��]�t��O7�����7/<��RQ0[]|�s��}�����
Z�28.��^`gKsDT�S}p����(F�@�bn�y?�<L�d�Vi1!$,�];�5�>��������
��Ds��|U��Gq c����h�b!zb�jw�@CR�����~���o���p�F��)QL�o�W�ɔ
-
^]�c�H*mXo\!f�f~�ږn����p\���*��v
�q����zܿ1fv�]�(��1�"+�x�1��z
-"y�z����p>_��_�(���}�y�n�,_���[
-�<u�|
�g,��"��s�""π�#�Կ�4�	G �ip8R�0�b$�ٽ)���%���d��o�b�T��]���0�)�(9c������2����T}��1�̟�͢�'T��.,e���29J�К�A�z> �F�T=�i at J����R���y�S�?M��,_m�*�[�ǂ�aj/��~����/�y8Di�Dqe��\"�&S�1$�t�Y&Uj7���PDT��v�+]!ś-��6�X워Û�
�X5��: ��W����T��p��[c���OȬ�[ _8̗O�t^$�?fwER<]^^ͪ�!_'���E��,��Q|h��qC�2�)S���+�(��\f��J��(�d�,E
!I� D(xj� d
-$"HF̈b5oy�N�]�3At
�_��T���U�lr�
���B���Q,���MH�2{��QQ�|O��3͵jF�MDan���Iq��Q,	qK
-�]
�V�j�
��6�F8|3$p�U�o���a�6�a��
] ?�n��J&�# ���5�
4R�fA�k�y�|�\"���|u��a��`@��/CYK!ܚ��wAtI� 
���8PC#�	"�q��VH�D@��?i	�D��H�I���ee�����գ��xpn���3@;�4��v
��͍�MH�u[���ݓ=&�2�g��>/f���֟�μYgx]�x+�b���&0 �x��l�*�r�K��>��P��%�4@��x��_�Ř�ɝ�¬�.|�o�Z�Қ�_T
&�
��D@}	 ���
� ��ca�K4� ΋)
�� �b��G��Tx��Mϊ�k*�9�pͅ�s�

W��t�6��+��K��"���%��X")�qŃR�:$�n>���1��7ul.-}�cs
�Nj�۲�j�;������yڠ���$Н?��"9ԣ�nt�t�"&��S�n|<�b�xD
��j���Y19�
-V�sӧK���pȮp!�Js"{���
�4W�tw%)��n��;e��
�� �����Z�A5�Kt�jd�V@�����t]�k]� �5�>���w�
����d�Y>Y;�1�X;H3�1��{5��)�nʤ�đ�*�-���m���i�u���w�H�$-g
|^�C�B0
�q���$F�Q��Lr�D���ao�#��9�2Nn
s(ШP�5�G�g�7�M����P�؛��6�boۘ�h��No���#
�m�������N��e%�}��l��:�sެ�������:

/���
��d3W S�����@�?n���D����0�@�8,�
l^"�hC�)�\�������PC<�OT8�B�8����E�pC`VF�
5,7�,
�3���碧�	5�@#
­l�T ��W�fO��P�1tJ�[��(���\M�}�L�H6Q�Y�[�QC�\�Jڢg5�㎰8�M
\B�I�M��W�y9�!Z
-J{����\�&���n��Vo�91kT���|9�BP��1�x���
��P随�n>2
�v1"�]���|8bd��#�j��
cCfZ

��_h�`��Y�tf��ә���a2��T�o����"%��w�����d�"���p�*\?f��ݹ��{��
�Gp�d��}Q
.��EZV�"[��[��Ւ����g����~��VY�~9[@$�A �~31\��d��P������bG�^W
s�X�Sk
�6Z��b�v-
3�ȷ����|@�����R|=*��Imф�`
-�/�C��I
~���䀲W�z���7a�vQ5]��"_�������'H�Q�I�@?���(���^?�����./��
-�WC�H
)
I⬥�	�C��
j8r3���>+�=�ӛX��t��pw���\1�࣋
~ՙ�8�yd�+L#T��Gx����~�l-��I�kh.d�ۮp
-�d}��/�
�6�
���r�ig��F¤��2{��#��.
0u�`
�Y6^#R�R�m��(��o u�r�$jM�J+8�*��Y] �<�� d`�c���W�x�4o1�����Q�^:��� Z��
�vԢ0S'Վc�uţ����q�u���>X=��ԕ���Ma2��Yu����f�ъH��"� 
����
�;5a].6�}��n��@u��ʪ���j�/�a
R���,F�hjK�	J�Z[,����
��-=+^��<����
"�Rc��l���AN����r��t"�o
>���(E���yX���x�݊�AX+n
-��
-@�$�A�2L�V�#����ɿʴ��D��m�?��6q����C���+�M��}�<e@]����������.L���#8��&�.�js������L�h��v�{��8���܁x���%f��ɕ���� ��K��
-endstream
-endobj
-13544 0 obj <<
-/Type /Page
-/Contents 13545 0 R
-/Resources 13543 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13474 0 R
-/Annots [ 13540 0 R 13541 0 R 13542 0 R ]
->> endobj
-13540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 561.176 276.047 572.08]
-/A << /S /GoTo /D (index_CC76_extrapolation) >>
->> endobj
-13541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 471.363 362.353 483.697]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-13542 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13546 0 obj <<
-/D [13544 0 R /XYZ 89 770.89 null]
->> endobj
-13547 0 obj <<
-/D [13544 0 R /XYZ 90 720.814 null]
->> endobj
-13548 0 obj <<
-/D [13544 0 R /XYZ 90 667.125 null]
->> endobj
-13071 0 obj <<
-/D [13544 0 R /XYZ 90 632.455 null]
->> endobj
-13549 0 obj <<
-/D [13544 0 R /XYZ 90 627.972 null]
->> endobj
-13550 0 obj <<
-/D [13544 0 R /XYZ 90 533.33 null]
->> endobj
-13551 0 obj <<
-/D [13544 0 R /XYZ 90 442.979 null]
->> endobj
-13072 0 obj <<
-/D [13544 0 R /XYZ 90 396.354 null]
->> endobj
-13552 0 obj <<
-/D [13544 0 R /XYZ 90 391.871 null]
->> endobj
-13553 0 obj <<
-/D [13544 0 R /XYZ 90 321.14 null]
->> endobj
-13073 0 obj <<
-/D [13544 0 R /XYZ 90 201.099 null]
->> endobj
-13554 0 obj <<
-/D [13544 0 R /XYZ 90 196.616 null]
->> endobj
-13555 0 obj <<
-/D [13544 0 R /XYZ 90 125.885 null]
->> endobj
-13543 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F32 764 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13564 0 obj <<
-/Length 2914      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���SK��X\Hp:��%��4�lwݼlv4�D[l$R!�����@�"(J�E�if�bR$x�s��L�ۀo��ru��u"M��2��	4
�H�X��"�2Jz~�(���sFôZ���眆��a�-�t�C~]������&�-�t5{�L7��ǫ�_�fl@�sM�L0����v���ȣn��
M����
���UZ��<� �y��7����'ﲛ�:g*̊9
	-�0ⱡy���ٯg
dh�Z��$Q�|}��#
x�}@��*����A������?��P’�$�K-�K���";�qx��X�묨�����j��]��Ͳ�ͭ��25�����+7f��.��i��";gq��������o?���M����v��}9_�U:o�*�O�pK{h����� �:�[>뇺�� UX޴�9�k�4/CT���E7nە��YXZ���*së��h�����v�Ֆ9�*^���Z�Wdy�'Mپ�Φ��~�KW�@J`GR����˪�nR��g"�^���q,��*����
-Z�A���"֙���1��ϔ�v����uc�9	$щPf at B��A$s\9*��bP�Qi�D�.�R'�e^-�'��-��V3UV߭�v�5o#�
/����|�ܵ�7�T�a�E`�r�F�\���2ڎT
/Q�q�ФӉ@BIG>�((����7�z�*�$ѽN(h�]Y+�bD���
p�z8��`Ԕ^5��>���+��p�`��$
�E��� ���>ǒP��2i�
A�0&B��%��z�a}
-��k7��$	����1Q̳�K�&�kb���
b�
z��يa)��h�R�@�uy��r���8/�K�;f���<l�"]��1�<#�W�����m�Dԍ�2_L�Y�� 
0
{T�����
��F�=��'��D�C	�S���9��DH��8�8і����M˩ �Ԗ��&�Q�[��j��"�e��&$��ه���M"��cr���X�)��͖�:
-��L��x� �O���{$5JH #
x
9�$��'�l���
R�nh�"ؘ��B]XL�� �gɬ�Ȉ\" ��̭֘Ku���ݛ��]�ּ�
=�� ���@&lp:�Z��՚ܽK�I��d�!��I	������_��[D��y���ܩ�� �q
��#��!x'F��2��v�o?ϳMc�Giߕ��c4DZMŇ༭������4��u
Xz�
�K.��O�����g��9��i�hTYp3�`����#�
D�����*+n��,���Ȣ�6C�Q�QT��?pA(�ЈA!`M(;�3�;
5����
-�-%
-���0�1W������{���j�F�w��2U���捩̋z���+SQ�Gm�6�2G�G�{�ȫG%�:�<���z:&�

���$��rX���@r/���>��a�O�ۗ�
��d��6 S��_�;��?�~U�.��}��~L���C%� ���Tda�!%�Kj��O NT�$�rH��v��z!�B�(e��u��i�u���������%��𓱞�2��'�q���0���6�� �9�N�}
�m�

�&��[����`+���
-�I, ����W�TiGmL둅G��G�)'BΣ�pT����'�h�M�*)����U�D��h�!�Y��(��y�Ę�x����)SJ�y�/檷��9�����O0�y�d�p�o g�󲪲zS�'זA�q{�?е�*�G�r=����77���I>Հ�M��
��(��ʓ-Ba�\��|�֭E,	g�Eˀ�s��	�� ��A͂�5��|1C�Ix{�h
W���ͮv����e��t᜙�e�/b�)�4����9���}̹ȋy�ޠJ2�̾���m�yX��!��p[GGC����hs��3$�(�@���}�6�.�"!���$�FM�uҳ�h�[�"e����%4��I@�$�Ge���L���I����)�$C*�nyv/����4Q at Y'��#E(�.o�}噐�m�I��gF�N�g;�Ȣ����f�ʧ�-	��j�����]�
(�*~&w��B	B�a�7atQ�	��.�׫��m��C^��?
�b�ԏ�{��n5�=�N��g��v�]O�ܺs
 [...]
�w���L���UhI�P_��ΑCD|����i!,7{E�?��ًa$��y4�����P�)9�`���
`u
-�z�z@ր��)����c=E��
�U�����
^촇z��߿��b�@�\[
�4p�|���8�����<�.M4��
�K��4��a��}�?�4a8��-MO/��!�Y����� �ElEg@�
 �����^���J���Hu\F�
�
s����1v;|�"J�9��t3�YAq̞�z��
-!-��۳ڃ�#p��<Ŵ3g�bZoE�۠�j�Aa�W,�x��q�f�&1E��dy�i#�
-)@r��[�-�B��}�� �N��|0��!!��
�M��O� ছ�Hض[���ң����e��]Nw�7�k�������𷲵$�~ʭ��S���q��N��" i�؃ ]���m�.dr[e��~We�̶[z7[��!�Q���!K�!�<j/������2:��=���4 &B���x�ka[����ڟo��[��^{*[�ծ��Tm��/�G�o�ժ-
-z͂��\�7j{��~�>�_�F��34�C�05FM�1�Y��uY��
gIMa_��x�0���r����5�}�����.�p���4����
:I 
�Ho������Ϊ?�y.��#-�:�1�m���j�
�m nz�u��vѿ���[�m��bĵ��.�fs�����m��d^�wڀ�$�ç�.��*��x���H��{W�f��w��0��)KnG
����C���wk�������_8�D
-endstream
-endobj
-13563 0 obj <<
-/Type /Page
-/Contents 13564 0 R
-/Resources 13562 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13575 0 R
-/Annots [ 13556 0 R 13557 0 R 13558 0 R 13559 0 R 13560 0 R 13561 0 R ]
->> endobj
-13556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.334 586.033 236.659 596.937]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-13557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 530.75 335.755 542.701]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a38da38d0fab7eed9ee09fdb11f88fd15) >>
->> endobj
-13558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 420.866 243.45 434.814]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 368.607 485.603 381.125]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.376 162.563 385.519 173.467]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-13561 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13565 0 obj <<
-/D [13563 0 R /XYZ 89 770.89 null]
->> endobj
-13074 0 obj <<
-/D [13563 0 R /XYZ 90 645.357 null]
->> endobj
-13566 0 obj <<
-/D [13563 0 R /XYZ 90 640.874 null]
->> endobj
-13567 0 obj <<
-/D [13563 0 R /XYZ 90 568.011 null]
->> endobj
-13075 0 obj <<
-/D [13563 0 R /XYZ 90 521.386 null]
->> endobj
-13568 0 obj <<
-/D [13563 0 R /XYZ 90 516.902 null]
->> endobj
-13569 0 obj <<
-/D [13563 0 R /XYZ 90 446.171 null]
->> endobj
-13570 0 obj <<
-/D [13563 0 R /XYZ 90 392.482 null]
->> endobj
-13076 0 obj <<
-/D [13563 0 R /XYZ 90 345.857 null]
->> endobj
-13571 0 obj <<
-/D [13563 0 R /XYZ 90 341.374 null]
->> endobj
-13572 0 obj <<
-/D [13563 0 R /XYZ 90 268.511 null]
->> endobj
-13077 0 obj <<
-/D [13563 0 R /XYZ 90 233.841 null]
->> endobj
-13573 0 obj <<
-/D [13563 0 R /XYZ 90 229.358 null]
->> endobj
-13574 0 obj <<
-/D [13563 0 R /XYZ 90 146.672 null]
->> endobj
-13562 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F24 529 0 R /F32 764 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13588 0 obj <<
-/Length 3363      
-/Filter /FlateDecode
->>
-stream
-x���r���]_�'����s3J*U��3���*~�u� ��K4 ����9p
8 )�[�ʃ3����x�0óo��qs�⛘�R�f7�3�g1WHD�k={=�4Z�v�ÌE�[��W?�t��O7�����7W�_�3b��j{��7<[��f1%g̤�S������p�p!b�,�z_�^���� AI�[]�S;ɃFcG-��b�d<O�)��'{�
Տ��)�]�Vi^�n�.)�,����|UgEn=&U�^��v�Wź�&�x��P��\,9%�v�7�o�?��'C�l)�2�-�)JK�>_�o0�y��-�"��7�i�O�B1nY ���n�4JH�{�R��h�ݦ�c�����C�Ѭ`r���K�u�l6�0�.�/J��rn,Ȫ��)T �H̑��(�"F|��R�����yZ.8�S��z+� ���\��6�NH$FD��$�!�J��8/�����j�oA��ώE��;`���y��uW���S�_��2DH�Lj [...]
���!P��
'
�ҧ��h� C2�ld�{
�(�CN$U�=�� �q�]"AT͋oC&��C��Z	�X��������U`g$��_2�A���21-���Ι��1��,z�DXC��@9�h��ɦ
-�����r�
&R�0�k�� ұ��� ��oj{o�-�z�����,����#�"���"u��[5��9l{�"J�ы(�ׇ�~�w܅JzvY�Rx���N�U�ݵȻ7��t��/	��E�X�ڥ�L�a�8���vY��F��.ʡ�p�R�����W}>�3�p�`g�	��i��X
����l��i@�$���W;��>o�D��<�j�#5�	 ��X�- �㴵6`����m�gP�t���&.����vm>=��2��1�+�����ϫ:y(�ds��1م�%*������
�d�^	@�
��9�.v}�.��9���zDb$��q��2>�

	6�3��O�k΅E���d�
.K1�5�X�����m@�Be��x�,�J
�~](
-ۜ%w�v
�M ��l�{-
-I��t�� 
O��}�
�CZG�-ۆ� �%~��-
�1
!O?�*SP�`�6�
˶a�MX;c����n���o���K0ݻ"_��'蛉"}	~���D�Xƺp�
�K� ܄���F��
$%���OP�j$�
-�p8j�ذ��9 �M�V"tX]���QjŽb5��x�\O�
�<u����LAnE�m
g��Z<_f"��h��q������SŽ��d�l2����/ӄ
'�3� ) (���]��=H�u<{�+/a�9��|ܳpG%�yX�%��E+y�~{Vdz�NZ��,��)oJCG�l:Ʒ
@�i�O��!-�a� ˜�WD�0�돫tg
r�����)p�S����<�'��Q/����
� p%C���
H�pD!�s@�tv?���B�
`b�s.����א	q0��&[߂�`��aV��|�9�K좔= AtH*c
��x�T�
-�uv�Sz�X�Bp>U��1����"���ښt=�h�]I�
� ������;�w�ig=G��@
-A/�t��i��
��l�|�OBU1��_M�:<�KHC���jW<�����;���4
-�I���6-��<Q1�(n�Z쳣��qv���
O�3MH� �\���P�c���餫Wa�ӦW����:[�!Ӽ+�����J���i��yj�C3
�z
-��tm
r1(/�:k�Q

7
��7�xkֽm���vc�-��M
Ӿ���|i� �NC|��9f��� E��ŚM]���$�t��)`r; �]c�1�•m�z�X!�I�z�2�
-u��<�8��
-4�ܖT=	�w�.���)�I�O�n
���
��)E�ң~Y
-z�
n$�B�7��P� ���l*���1T��E���=X�2xG��+L���h̰�p�o�qk�t��Z�~�t�ȄA�O�xu�w$��Q�q��� {a� HG�Z���.v�y�� ��䕮Kp���% ��N�� �#��� ��
6�zη/���!�����h�@��U9�|�����x�C^��!N�|�k�PlB}�HC�x����g�=`�I
P
@M�=@[�b�YVE�8���
6��%Q����D�;k�o�T���#
���}�P;t;
vJ`'�P�D�}bz^f�V!
)�]~z����L��*��INuB���뾗\zg9 :���
��+��TG�����4Et�����% 2�]��xq�&��٣�Յ�"a��%�ú:|�[�R�~&2����L[��Һ-MFb������C���-����+#5�{��{+�n\���#�O��
4L$8���pH|)�D�zxB}�tLt��FPp=4n�BG��[��{8�^��UHhWa^2b�(截.�T����>˛�70b�}�ZD]1H��3�NwNuZ��e਴i�<�dG�|�O��
#N��;:r[�.���
0�Z�s�4z�<�6tz�)�~�.kb.�Ϲ �M!x@�y�`�N�,�n�����T]y�y��������Zf�������S
��jg�P�+7���r��,�;ᨁۏ��
���#����6fX6G?�������≼N��Ӯ��A4R�r?�6's������v]$��ƹ8|
-
���O�D�I��Ul�����4��!=f�V�D�/�K$������e+�D���NV��q���p)��r�"�+..i,C�r]�jhc�r:�����Ƙw�
�}{.�����l�)
��{�f����kR-������4�!�ے����X�>_�
+F�H����_�<��
��
-�D�n���y���|Q����@�tEM<E6�hK�)�����c#kN: ���E�ViRBv:0�G
S��
po��h-�0��T'��ԯh���b��&��
L &�)��/��{3ؼ�
��~�f�, Xn	�
���I�-���2��@���g�/_�ho�[��B̝��w��/�t��}��5m��kV�<_����x�k���m���
�h,A]�_���?Ti�� �9��u/+�	�Z�}sNek>V��
n��a��g�2m
-endstream
-endobj
-13587 0 obj <<
-/Type /Page
-/Contents 13588 0 R
-/Resources 13586 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13575 0 R
-/Annots [ 13576 0 R 13577 0 R 13578 0 R 13579 0 R 13580 0 R 13581 0 R 13582 0 R 13583 0 R 13596 0 R 13585 0 R ]
->> endobj
-13576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 661.528 174.682 669.054]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.953 610.339 216.525 617.865]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.27 610.339 291.843 617.865]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 532.164 239.856 543.068]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-13580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 344.446 379.76 356.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a38da38d0fab7eed9ee09fdb11f88fd15) >>
->> endobj
-13581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 302.349 182.164 313.253]
-/A << /S /GoTo /D (index_expand_space_dimension) >>
->> endobj
-13582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 204.983 243.45 218.93]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 128.415 535.938 140.933]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 115.03 226.824 127.363]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13585 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13589 0 obj <<
-/D [13587 0 R /XYZ 89 770.89 null]
->> endobj
-13078 0 obj <<
-/D [13587 0 R /XYZ 244.439 535.317 null]
->> endobj
-13590 0 obj <<
-/D [13587 0 R /XYZ 90 528.677 null]
->> endobj
-13591 0 obj <<
-/D [13587 0 R /XYZ 90 460.103 null]
->> endobj
-13592 0 obj <<
-/D [13587 0 R /XYZ 90 394.06 null]
->> endobj
-13079 0 obj <<
-/D [13587 0 R /XYZ 400.69 305.502 null]
->> endobj
-13593 0 obj <<
-/D [13587 0 R /XYZ 90 298.862 null]
->> endobj
-13594 0 obj <<
-/D [13587 0 R /XYZ 90 230.288 null]
->> endobj
-13595 0 obj <<
-/D [13587 0 R /XYZ 90 152.29 null]
->> endobj
-13586 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13604 0 obj <<
-/Length 2494      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�F}�W�)!����/�d�6���I���ʓץIP����ߞ�

��D��E��AOO��ӗn
���p=y��b�AFR\���
�[�#�gs�1���<
�mx�nF�4K
7�*o~�y�?^]��,��,
���p�>]���'B:�)5HJ�;�ߕCz�����=2
"L��vJ�?�p��ͩ� ��i��%a�w�G�(�=��%�b��)��ʜ�x=�kB@
Hi������O8X��������
8epM���'�ka�&���~Ŧ�e�
���U���}�����,ϣ�.KWqz[�*���yF�I
.��
��MD��X �tm��a�/G�t�qL�Aa�pR� ��l���$��fZg�*ZUc��VO�VЮ�p�@T40�ӣ�@�
ϋ�q�rzg5��7`q�5g�"nd0��:�F
IZ����q������7�B�7�-
wQn���8��F�A����B#�1���t3~����f��|� �|��+�'�[o?�s���
����
�È���-�D���U\�1rQȌ.�g˫�hF��a��!9-���b��T
-HI��EF��@
q�f�#���y�bp4`���] @�G�^B.a�I_�%�T������"����n|S�Yu
�i-�����ڀ�d=�*
3����":���h@)s�:�T����%qM�@Z��	�ST
j:œ
���)9:���k.�m���h��!�u`k�Lk�|z��u4���:�F=c�S(�*pN*@��
<?́M,��}��ko�ç�C�l{%��j<�Jt~�B��DD�	����1�0�Ĭ'O0=��a���Sb��;n-")�|�"=�)�^�)r]#<[�'Z���~/7m����>N*�XTCB�h|y�HD^�����"9c���%z�后�A�@HH�TE�?>,�]�R�QW<�����ו
-�	6����� 97�=�d(Ҿ���C�$��G�z�}!��̊��rs����
-�C�
&��&�gLMo� �=��s�1��BmM�1
��1�dm#+��le��^o������jkOT~c�\"��bo�T�8]f�]X�P#��%��d�j$�<�=1�(]1�|	>����G9��{>_����i�!���� )�T���Gy����PA��9^E���hR�)�A�&[��
V�	����c(%�-!w)�P�Ʃܗ멐%�*֛��A��Re�պ�M;�[m��[����h������2p���w�^�]���y6�\Յ����KT� 
-���g.^�{��@´N�a���zY��֛���I��(wұ���*i0�U��k����{��P����o��)���`�ύ��ps�X^C(�
�^�
-�+�
|�ݥ+
��n�)�£"Dc�4=ܮwu�� ��|o0�aH�F
-��=F�4M�0]�bk��D,��i�a��<b?E�����V�*U��¦�7K��&�
��E�.�w
@�����n����_�h�
��
-��
��P��j��
�qw
����Y��S����Q�c6@�
C=���B��^�>�� �B�;��@�Xki
�/��X[��S�W�f�/n
���鮢���B*�
�����P�YQD�R����Μ�ڼ�[6���x{�6:՞��"֧䋷�;x�9�O�O��U4�<����`��T���0��Di�Z�|�p(���Ȕ�@�Q�9��
�C#/���*Y��������s -�lb�YC&h�}������!ة�YC����Q�:~:Kڼ��	b�!��$>
3r��E=������e���r���H
�
-��!ҩ��#"�;QT�EN���A!�h��R����$v
�'���Ñ �w@�씒�0� 2����4�����	����*��W���\f�=����\?�D�xU�i�+�		��T⫞�84_鄄h���`���]��(�4a�9!aЯ@S�x
7�R��9$y�.�C��.��->��h*�]c��E
B�B���Nk��g
�<��q"%�D��%��X�\�W�AnϿdn/�ܞ���#y+�
9"=
nT@���[��
���h)�}��o�Si�SRa��
���b�3�9�`&!����3r�M��x���
�Xb
'I_�4�:�Ib��'��5����C���,>)\C9���x�i����"�hƙ�
-������--ş��Ɂ�*O`��
-�@�lk��a@)դY
�`8���
O�E"��|<)�&��]{�
�v�� i�s=��/��y �Z6�y�dB��8����٭����?Kh��
�4���bP�|����)���,������h��0�C�w�~����Q��L�i���]Gve@��'
�e��

-�釨�$�J�Կ~)���*��ª�¦(vW�_/�n�Qz������:�0�i�u�����q
-7�a�|��l�5&���`̿&���\]d;��o��~������������^8
-endstream
-endobj
-13603 0 obj <<
-/Type /Page
-/Contents 13604 0 R
-/Resources 13602 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13575 0 R
-/Annots [ 13584 0 R 13597 0 R 13598 0 R 13599 0 R 13600 0 R 13601 0 R ]
->> endobj
-13584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 707.957 362.844 719.025]
-/A << /S /GoTo /D (index_fold_space_dimensions) >>
->> endobj
-13597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 492.285 174.682 499.812]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.874 492.285 241.631 499.812]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aed38463ae788879580d6372653452603) >>
->> endobj
-13599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.796 389.908 258.368 397.434]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.796 326.763 258.368 334.29]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13601 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13605 0 obj <<
-/D [13603 0 R /XYZ 89 770.89 null]
->> endobj
-13130 0 obj <<
-/D [13603 0 R /XYZ 487.765 711.11 null]
->> endobj
-13606 0 obj <<
-/D [13603 0 R /XYZ 90 704.47 null]
->> endobj
-13607 0 obj <<
-/D [13603 0 R /XYZ 90 623.941 null]
->> endobj
-13608 0 obj <<
-/D [13603 0 R /XYZ 90 570.252 null]
->> endobj
-13131 0 obj <<
-/D [13603 0 R /XYZ 227.473 289.291 null]
->> endobj
-13609 0 obj <<
-/D [13603 0 R /XYZ 90 282.651 null]
->> endobj
-13610 0 obj <<
-/D [13603 0 R /XYZ 90 202.122 null]
->> endobj
-12740 0 obj <<
-/D [13603 0 R /XYZ 90 167.425 null]
->> endobj
-13611 0 obj <<
-/D [13603 0 R /XYZ 90 162.942 null]
->> endobj
-13612 0 obj <<
-/D [13603 0 R /XYZ 90 77.486 null]
->> endobj
-13602 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13616 0 obj <<
-/Length 2431      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�}�W yH�*b8��
�ʑD�
[V$�� �TK`Hn؅w������;f	H�*�Ň�p����}���bD��z����n������s�&I���jb�Dq��������S=�p�ÄI��������__�z}��������o'��'�
H��b}���,��013zr[ZO8ep]Mޝ���4+5}�A���	F
-#>����<�m��gsJ���d�o��UT���|�,�8M���t�]ۤ��WN��}=��\(���M�H5qa�7�qvʵ
-+�$յ���G�LRH�f at q��I����VӋ�@���
���@�N�Fb^,�=K�"���K�����EE��0
Q��CZ��h"�,�
\ă�U���%DU����(Ҵ1t�&y�G�BtN
���CX!��Et�&��㻛h\�2��
��z at h%���Y�VB�
�F�Q"]!!)�:�&�Dw�.��̇��^H��ˮ�9��[�)"/�q�b�-`�nD�)*�
Ҁ�x�~�����n��i�.2aF��s��V�}f7�͛
+ߥW!�T`;��)M�N���svGb��?�͹&ӫh�ۀ@@7���qe�-V�ě��~g�D�ZvT��(���M�����,M�	�!L#�ȶ!C����K�rNL:��C�
����6�)Sˎ�e��3*�����
|
oqϲ9��
����.���L�,������`L�8��L���"��fC�{�H���ƹ=�g¦�jU���F���ZE�%��DYU`����_�|Z]�O�^=�8�rP��
}��BM����}�ƚX�4�|��K/\m�a_v�ʗj�ױp�Ui��~��>���$�O�A�t��h��Ƕl�A���. 
 F�G�D�#�y����<�6y(�5�-�d=
�M����MH
-$#n4�
H���x.‚���=f6K:����YKb.�t�յ��s��j��>FČB�#�G�p�K��$� d��C"J	�KD�{�������O�~���om�͒P�3���Dž�|h��NY���*�i���t��A�e�`tqb��H��|�WHf�F�E*Z�۩�C�3�9�
-m������h~!�D
�}mZG��/+ݖ1��9t�8Y��
t���\�
��3@�8���+���Jz���'�7�U
}la�,��g���ɲ2���ć
Y�����B>�|���y�z�k���/�`�fr�j#xO��ƍ�}��(ܷ;�pO
 {��'��z�_�J�bW6�I�E�'��z�?,L�
-�1���^<&�3H �4u�tz�/���`�B�^�X>(0_fE��e����@@�a��U޷�O�Ѧ�����/E�W,�f�.�2΋(Y���Z ��Qf�)ٟ8���:�
��`P�H�/n��Wת���������
�Խ�?g�gx���5?��T�>6Y��O���E����!.!�c`]B��YZ���R蠹<ʼ�����of��*^�T�?=�BB��GOB��J4#����Ӱ ���#ɏ��1 L4?��8�&���HD
@�8�n"���%����t�,�����8
�r10�)9�zP_1��
�jQ��:؍z�x[
��k�������(�x\*W�
-���_�Z����f10�eu`��VQ�*�w
�x��M�p����=�[F8������{LS�ſ�'�<��ͱ�]�Ҡ�4���V�+ϗ�u�����>w��1
\㢺&ERJ�LjnA� �*g���9s%P�>2�5�L�4�tiZ�E�uP�ߞ��G>U�
N�Y��MCd� I+��^
rg��Ѩφ6v����6�	?�=\�0:�q�A�����+`p� �.s�T+�oʾ��@��fk��{����<;�# �կ����覿;��P�6_�tW�ia
 ב
�iCv*�ߔ<��  @D
�����
�1��GX�>ח���!L.f\�bx�d�B�
���x�t��;
�N;\��
-����
1�
-�
B9+��(�
���.$�<=��r	�՛�i���QQ�������8��ba�P��i���1P}/Wipd�Xz?�`�>ʼ̅��{@?��^h����f�v��
�
��wC!ā;���F �<w�����=>��|�؃� ��6@=B�j4w�>5OM�S���0�M�{S6�jfd�4so�>��� ���
��>��
�r�j/��
P�q_�j��W��m-3�f��&X#�A=B
��O�%-7Z�Ľ�C��6����Sa��:����o�g߯��e
-�Zqs�7o��
-��`��>�!���jL?�߼����;��_��y��巼u=�?�lœ �J�9שּׂ����F�����G��4�r�MQl���]n�s�\#�������}�ڢ�U]��i}�'.�˸-%,����4
-endstream
-endobj
-13615 0 obj <<
-/Type /Page
-/Contents 13616 0 R
-/Resources 13614 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13575 0 R
-/Annots [ 13613 0 R ]
->> endobj
-13613 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13617 0 obj <<
-/D [13615 0 R /XYZ 89 770.89 null]
->> endobj
-13132 0 obj <<
-/D [13615 0 R /XYZ 90 670.741 null]
->> endobj
-13618 0 obj <<
-/D [13615 0 R /XYZ 90 670.741 null]
->> endobj
-13133 0 obj <<
-/D [13615 0 R /XYZ 206.91 577.704 null]
->> endobj
-13619 0 obj <<
-/D [13615 0 R /XYZ 90 571.063 null]
->> endobj
-13134 0 obj <<
-/D [13615 0 R /XYZ 90 519.376 null]
->> endobj
-13620 0 obj <<
-/D [13615 0 R /XYZ 90 514.893 null]
->> endobj
-13135 0 obj <<
-/D [13615 0 R /XYZ 494.439 447.739 null]
->> endobj
-13621 0 obj <<
-/D [13615 0 R /XYZ 90 441.099 null]
->> endobj
-13136 0 obj <<
-/D [13615 0 R /XYZ 488.462 373.944 null]
->> endobj
-13622 0 obj <<
-/D [13615 0 R /XYZ 90 367.304 null]
->> endobj
-13137 0 obj <<
-/D [13615 0 R /XYZ 90 229.035 null]
->> endobj
-13623 0 obj <<
-/D [13615 0 R /XYZ 90 224.552 null]
->> endobj
-13138 0 obj <<
-/D [13615 0 R /XYZ 128.643 84.126 null]
->> endobj
-13624 0 obj <<
-/D [13615 0 R /XYZ 90 77.486 null]
->> endobj
-13614 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13628 0 obj <<
-/Length 2571      
-/Filter /FlateDecode
->>
-stream
-x��[Ys��~ׯ�SBVY���M�UI�M��$�WyZo� �X�!��w���
� b׎��
��{z��of@	W������Q��_��.^1s�i�gW�3GgF:�4�V�wsF���sF)�_.��6��\p:�o���U\�Y�DA���տ�qp������C�x���k�*�9wDk��?�Mj=�F.�W
2
aB�
�
��Mp8,ι���<�>l�8L��ކт�y�[�pB�%w^���Wg?�1��3��Ecg��ٻ�t���o�N���C�h;�\ນ�=�������2�~f�����D��:λ�6���mx�&�#���C�
�a�i�
�$��
�R��h5ߧ���Uט0#�r�Q��ʏ��y���~���e�ެwa��.b�%���9�g]����%�DW��j}�?�m�J��$��#����]j��Tю >\n��
�sJe�|.��0\]��q{F�"���u��d~��X
3��c
�V��n8��ʹ�AJ��n�b/�嶕���
-j���>MC��Bp$��ra�O]9K���Ц�����0�������3�-�^d��~w�;‚Kd���p�Ŵ4�Y��!�1���L?Z��Z
�>��r�UN�f�	��c^E�����f�2�<Y�����zww��:꒩�V�]����2W�X�!�{+�e���K,&�t��l��Br��
j�K�$T}@f�8����e���B_�W���㧋׺�Ƨz�l�Fm���ۇ�8�0H|��^Q���?��}�6%}K^�*y�	�a���6��¶�i�Z/-��h�V]�#X�.C�-Dg
-�A|X�*��x�"��}s
\�Yj����_�����1)��U�i>���
j��3�&d}�:�H)߅+�Ia���0�_�ˮ���z��}�j�Y����.�wu��c̖b�i�3��hw�y.<
P�1!�ǰC8����h��dE2�
6�.��WQ�
�}X�,V
��Y�d����Ҙ�}���ks��h�j�ͯ�C�\���Ig�S�$��H)�i�m����1@* ���dXv����[Y�(��C��mޭ��z�,���I���,������&��!�d>C
�
b$����.!Hǔ='g����V�i�*����D!��rjN�짤KB�\�_��f�.D%�f,h��B>.L�7�U�:���ư�y2
� a�j�0����ɄO��NHV�\"8�!B�Qeў�!��RճdA�e=��Y0�0�q�O���9���R��!��z�
�Qʆ�|H�D�Hxk*��Qb�A�-���-�&E��������10n���?�N���zOŋx��
�|�
���}�H��"�Zս�1YŁr ��[�(�|���ga|8
F�|;�`�g�|��,K5@>g23
7U��X1��>�@^d�F�
ct��(��^jB��;Y��������4�'^%�Vy�A|��.M���6f���8
�H�"
-�A�d
%�k��t��)��>
�k���@͟��p_��}U���5���}S���1�����W�b��2�o��T�Ml��ض��䚬�R^��L��eR�>�J>C��E9�i
����I���E
ػO�ª+JxJ�9L�I��5Э�� ��샔���A��������e�O�
-AYCUN�5���r�*�d5��f��
� ��6C$u�lf��/J@Ԩ͐	��!5�/�!�{�!���qN'c~~2�7� ��Z�߀�ڥ�����zA��"~�\�/>���oˈ���*���u���$���d�$�J�d���6@��l
ᚂ~7
-�������
�@�/f�6�?O��P at 7�U/#�
-��&%�T�z�� ���w��7�@���(��}�j���
�	�0C���{"!��!B ?	� ��P�N"M!Q��aB�b��0�f�	�U]sA�>B m����@�B�{	p&&v��B`��7��	
`�$z��P��@+��ƒ|!�F�` ?%PCxx��#�����㤀[=�X;��e��l�e�=F
�
�
�`ϡe���HU�P=tĎ�e�f��*�z�X6�X`
D��uOHYA|
�0���7�{�y9
-��B5ɐ��yJ�=
-��K
k��tA]
�9dBF�9�C �Õ^�4Y�wI�[�O�G�8p���_wu��G�(R���!����G�ʊ9��+�叮�W�龣W�b*���a'}��
ꪓ�(Ň�^ɄmN��s��UՎ�|���&���B0L�9ye�
s�N�%������5S���ɫr?����
5�U����W#va�'9w��An�v�2���囬����a���� =f_����<��J+��rp[n�~�o6
-g6?v�<9�6�c�$�A��*-��[Q0��
8{y�&���!���Pj~(�xy
6�0����0:��ꃅ,�b��mf�O;��,���,�K��$Q�
-�}
?����y�;��;�ڎ��
~����m�}�v�c���C�撼^�~T��Z��p��@x��d��r��3�a��⛭�}����/���
-endstream
-endobj
-13627 0 obj <<
-/Type /Page
-/Contents 13628 0 R
-/Resources 13626 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13575 0 R
-/Annots [ 13625 0 R ]
->> endobj
-13625 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13629 0 obj <<
-/D [13627 0 R /XYZ 89 770.89 null]
->> endobj
-13139 0 obj <<
-/D [13627 0 R /XYZ 442.087 588.309 null]
->> endobj
-13630 0 obj <<
-/D [13627 0 R /XYZ 90 581.669 null]
->> endobj
-13220 0 obj <<
-/D [13627 0 R /XYZ 90 443.4 null]
->> endobj
-13631 0 obj <<
-/D [13627 0 R /XYZ 90 438.917 null]
->> endobj
-13221 0 obj <<
-/D [13627 0 R /XYZ 128.643 298.491 null]
->> endobj
-13632 0 obj <<
-/D [13627 0 R /XYZ 90 291.851 null]
->> endobj
-13222 0 obj <<
-/D [13627 0 R /XYZ 442.087 153.582 null]
->> endobj
-13633 0 obj <<
-/D [13627 0 R /XYZ 90 146.942 null]
->> endobj
-13626 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13637 0 obj <<
-/Length 2476      
-/Filter /FlateDecode
->>
-stream
-x��\ے��}�W /	Y%���>I�Ė]v
Y�6O�J�%�+�I�����Ӄ;��5�������{�їs�å�m@��&���<�R����
-�nK-,�
-ϖ�۩�t��ꛀ+C�*|*���w��^��z��M^^M~� ޢ�$�&Xl&o��`���	(���A�@0��u�f���6���\ @���ٜs1M?DN��/�F=�I"4/��m1��X͍�ܤ�@�� ��t�>�Y��\��0^D���(�Eq����'5#�V��m	��
�K��D�)���	Y��Y-�)eq�|��RM��6��{a�r�v���j��m�����Vi~��ӭoRm˪Y%�YAse��$J�x�(
.S���]��8���d^8��9�&+e1�N5���q��>=����mѽ���}Dr�
-_+��Q�
-��B�3I�7�h��ӝ:{�cZ�?����^�;�w�b��Z��/\�{V�(z�����|V�Y9��7|'��xa��׳9X:]l7��4��>�&Q�a%7�d��N����6��ˌ�%��z
O��cz�+
��C��it-߿��\G�/X-�U����Ea ��ϯfu�s3ʦ/?�Q��Ŀ�]�3�e��4:
�}��>M��&�dҥ%w�
-Ӓm�G'T�
E0�PŊdB��D`hJ�$�f�S_�2��>X�휒�m
n2�4�0S���ԙD�!JN��g� �<�҂�ڋ>��
-�=����:ױ>��h"
-C������Xc�j�U��V��"Q�Ĉ" Wq��V���j�o�
C��6c����ǚ� 
-���%F-�m��~���s��H%-�E�|�9�=-dQ���֘.�)���O�ן;�s/^��M�eM�Pcα	3�+z��M>�z=�
-�E/����
��%
��;G�=��0�_K��'������b,žJ��y�q
������-��v���o>�;_�r��=�<2���g �3 �F|�-Ε@�PmHp�Ҏm=vP}i���([�BSyBkq(GV���]������U��8�
�pE{b}��
�q��0V9��$r5o�./��?(�s�b,ʈMB�ry�� I��!Ա-1+J�
�!G��ʧ�� h��Q~�źQ>V�O�|C��C�
-ˊ:��1{Ԑ�@t��T0h#�
)���_A�� Rd�2)bHL�8��6)rW2Rąn�"w� E��)r�2�cN�ܧA�SD"�����hꈀ�n}̊���9�:eM�9N2&�
da2!L�#O��t_�%~�K5_�U ���|I��\�K#�.�RKw?_Cs��Z�̗���KX����|Ih7r]AmI��j/l�I�%�ocƶC����١�>]tɚ!tI��l_�g� G��!�o�Q}8�gˁZU�t��>�LA�9ba�g�s&Jg>�-�="D��|��
/���
/���g�NY�=fSM�97أ;-�ckY��l�0��O۬ҳI���F��~�s�]�Y#|B\������

�
���`:��xL�h�����~�O\g���} ���E.=�#s	�}Y�H #�������������@�^
-�R�ܵ�9Ǽ���h-���=�c�#"Ԩ��� B*�A�<��A �G
 D�
ġ϶\
6MPZ@y��Ġ;�$J�cG��q
i
�����A
-�#
��@�@�H�&
2�LBk��[�8�Y�$d�[���I68t�(.�f�U
��&�`�KE0��p^��fznoQỐb����^��֪��K�� "�5J=�"fIIr�""b�
�C
Ao�Cl�4��[.�|$; ��r�uoz�}f��-�r
W\�a��FÇ5�>��;���4���� �Ÿ�4
��t���Y
5a~ Iu����sC�k� �
�z0 �X�Á4������
	��AP�l $8_o	�z/��
��߅y(GA�a[5���=�X��	��_�#�@�����m<�
��7����� ��vƢ�����KLW`��S��KH�QT�(��=ՍK�
E�eDq��[�6\Gm㒰����j�D�Z��%Եͪ�
�~'D� y�."�<���;��tm�X��:�^��
����M�\MOJ���[�A�V7��
Hj����z�
	Zolr�]��:w�[��f{��
��s���O��˛�g	Uy����t������!%��
�gx\�yG�J����]�Gx�ZFa�x,�~��`�YO�UcY��QK�֣hV(�Ԧ���K�1O�v�����'5�⍠��x-��w��^�����o��-�
�S�0 �OM
-M��~��3���3'ſ���f�Lq���
|�Ea��9ʛ���bp�J��
-�\z1������o���G��fRN��j�
㻰���
-�/��Gɾ�a�:���=��M���S5��L2�7�#�u������?~}w���[��n����[W�+�q�M��l�徺U��e[�|����L���
-endstream
-endobj
-13636 0 obj <<
-/Type /Page
-/Contents 13637 0 R
-/Resources 13635 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13575 0 R
-/Annots [ 13634 0 R ]
->> endobj
-13634 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13638 0 obj <<
-/D [13636 0 R /XYZ 89 770.89 null]
->> endobj
-13223 0 obj <<
-/D [13636 0 R /XYZ 90 651.951 null]
->> endobj
-13639 0 obj <<
-/D [13636 0 R /XYZ 90 647.468 null]
->> endobj
-13224 0 obj <<
-/D [13636 0 R /XYZ 128.643 507.042 null]
->> endobj
-13640 0 obj <<
-/D [13636 0 R /XYZ 90 500.402 null]
->> endobj
-13641 0 obj <<
-/D [13636 0 R /XYZ 90 355.493 null]
->> endobj
-13642 0 obj <<
-/D [13636 0 R /XYZ 90 321.49 null]
->> endobj
-13225 0 obj <<
-/D [13636 0 R /XYZ 90 287.428 null]
->> endobj
-13643 0 obj <<
-/D [13636 0 R /XYZ 90 287.428 null]
->> endobj
-13226 0 obj <<
-/D [13636 0 R /XYZ 90 229.455 null]
->> endobj
-13644 0 obj <<
-/D [13636 0 R /XYZ 90 229.455 null]
->> endobj
-13227 0 obj <<
-/D [13636 0 R /XYZ 90 183.437 null]
->> endobj
-13645 0 obj <<
-/D [13636 0 R /XYZ 90 183.437 null]
->> endobj
-13228 0 obj <<
-/D [13636 0 R /XYZ 90 137.419 null]
->> endobj
-13646 0 obj <<
-/D [13636 0 R /XYZ 90 137.419 null]
->> endobj
-13229 0 obj <<
-/D [13636 0 R /XYZ 90 79.446 null]
->> endobj
-13647 0 obj <<
-/D [13636 0 R /XYZ 90 79.446 null]
->> endobj
-13635 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F13 834 0 R /F75 554 0 R /F90 758 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-13657 0 obj <<
-/Length 2409      
-/Filter /FlateDecode
->>
-stream
-x��[�o�����B@�TN�}?��@���<�8wʧ���I�-D"��;���]>�Z�JM��ŸDI˙�y�f�\����M�����K���brq��� #��.n�O�$HP2]���f#E�9�Ϯ#�g�~�\Gϲ��}���7?�?������O�]vX����&��uzW.\����ϻ}D�,9
�Y�_|wqEH�3#i�A.��o�O8��
��o�M�do���$��,"�g��䕽y:g�!B�tN2B��]ET�2�H
�Cĵ����G
f�_o��!�S�g���Y��m�<)~y��&Ŷӥ��))f�Ku�z1�}B���x.����v��=������`���'�h;���f�v��{u��%aߤeH�8���f^	z�MQ�c	��B��jAO��W����o��
���Bvr��PDq��Ɠ���C�m
-j��2"b�Y��8=�<�1.��6��O�Ѧ����9�1�)~�>䱵�1caVjƒ",���r}�*�

�d!\k?B��O��وJV7?>l?��C)��9�#`
,h�����6��ן�$]%�c�P�K��Jc�):��A3G�T{k���e� ��1�2‘'��^G��l�^Fj�P'8��|��[������q�����ijW2�&�.����r�M
I?-��.K!����w�����r� 
g�!�!�z�����LB����Szfl=49�G��a����x�t�����xB��M���,��އ�Jۯ��5>S~^'qHK�d*ڋ�
п�'�V�]�V��GVƐ� ���	�
$gB�� R��\�*>܂��Zk�A��p���
�rǠ�р4R
-�2���&8�R:RH
`
�I0��
ԥF��k�%�
���t6��SƇ,"���
�yሁ�À4�A� ��b �
w�S�"
-d�c�T!�;|N��z����M>�q6Ѕ>#�I�GN�B���]c5�� �T����n*@�w��0n��q
ȟ�q� 9(n�� G��i�yо�.N
-)q�
ho���PD�Z�A�	��r�
I
��ie���%
�
�u�+�4]珁�@�k5kN1���y��+!�=
-g�\��8ט
:�m,�
�
�+maH�(}%�"@꼾��|뾲��������-�I�
�L
�U†Ԡ�]��Aݖ
-�@�P-��U~�r���	o����Qg���Y�]%O!K�N�	"���S�K^�u��ݹ��A�SjB��$=%{)A�DH;�%#� ����d�U	��
.A��\� 
�?s	"�q�F(A,)��y%�|����R����_F�_�h�?#�2��)\��Ǐ����
|T��-�
ᩭ��Py�
��tנBK
-�3zz���a������}j��J�(�� �P�z�k@���х�x�~I!iA� !R$-�_����0=�(ݒ"T�7J�o5J�����_F�/����(]u at U<'��{P %���x�Lj�Y�^!�O��d:��=�
� �b`5�x0f�q�����G������������2��`-�=& �1�	��!��e$8�����x�W���!�'��U��}�g���p�k����k��kPdJz�=�=�b�>
t(����-��,W5���J�3Km)k��Zܗ�쮲��6I�8��)��n�W�E~�._�]6o�~r/�_��:W�*��g��֤"��d��O ��O���$���v��Y!!�qV*�y���D�n�A���?�1]�-�^R����x��w�ն�Hk=e
�S���1$�+�~�ے�H�"`HKK╽��7��7֐�F�µ �D(^e��z�z�= �)�h9�M(
UT/�A�j�
�@�o��N� o	-����DH z [...]
jd
/vF O��QI��s �T��!� �`O�s��E9g�e�Âi��o_&@��돾}�n�:yAu�(�<y��In�{N�I5N�ELvh`�Rj��lm��R����P�����l|�
-C�$-��/�t�yX�pZ0R��0��~j �{�F@�ߝ>�*0
-qBK�x�����b5�R@��]i_
-D�ܞ	噠���g���	����o٩.XsB�:��b*�=���2ݖ|a�[w>���=
-D��)��
\��
-����'Y
bԦp� �?�O�CsN֥݊��������-��7���=�|�ks�<�
�F!�=dT�^�<o	�"
�A��g��q�[S]_�P\�rH������ҿ��!�TU��.g&�C]zAl��EsU�ۤ��B��j�|?q�ш�"���}��./.><�
��-�,;J
-�}ط��ث˿m�/7�No��TQ�6������&J�b�Te��Ǿ�6�g�� �1��
-endstream
-endobj
-13656 0 obj <<
-/Type /Page
-/Contents 13657 0 R
-/Resources 13655 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13665 0 R
-/Group 13649 0 R
-/Annots [ 13654 0 R ]
->> endobj
-13648 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 13666 0 R
-/BBox [0 0 418 144]
-/Group 13649 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 13667 0 R>>
->>
-/Length 557
-/Filter /FlateDecode
->>
-stream
-x��UMo�0
��W�X�-`�!@1`��
�P��ÐXw��i[��,I�
#!%Q�|���
l@�	���D����/@(��3�-5>�
�_?�����?���Ҹ���z�� �C����
��� ������rR�=�͸�Ns�8��`�4�xQP�8���2Ȣ��r�чnj
�0�{��6��̩����5�Ś�8'�-֊u%
��bi�!ԅ�[Щ4��L
B�5�i~���4��
';�D*��\JC�ɴ�v�S�r
f�.F���Վ
��҇��x{ā+ղ�
-�@�
�C����ʅ���eM_wس$kD�!�
�ȭ��r��@�3TI��PgY��ҦҤi���,LJ�
�P�jZsxs�
)��x�$�I6��>�9���J�%ô�+
W���e��v%߷��Ũ\V#Q�bsd��8.v��1o�K����ٛuFpIg��z�a
��\U��3�o�Y�����gx��༠NJ��'8/������m��x�

-]_4Zc1�&�l�
����ԹΫ죸+�vQ����ܜCRҽY�2b�]]�^�
�8r_�/,��X
-endstream
-endobj
-13666 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-13667 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /NRHWJQ+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 13668 0 R]
-/ToUnicode 13669 0 R
->>
-endobj
-13668 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /NRHWJQ+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 13670 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 778 556 500 278 611 556 556 667 500 584 278 278 500 611 278 584]]
->>
-endobj
-13669 0 obj
-<<
-/Length 13671 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mk�0����
��E��.�P����? &�Pc���ߘ7l��'���C&��/�
W�Yv��a���2߭$��u�O�����$L��n[V�Z=�Q]�����n��枞"�X�n�Q_����a���C�%Q�0E�+�*̛���>��*�����N|m�Xꙣ%9+Z��d��RT'n5�
�j"��_<
i� o����
O�"i<��J�<U)(GL�
-�
��@H�N�r�;�� ��
$=塊B,T!P�l�	O<A
z�����We���8����@���/G�<����/C�
~i�
~9
8��p���
��P%����v�����
y��
�W?-����
mf�g���%
-endstream
-endobj
-13670 0 obj
-<<
-/Type /FontDescriptor
-/FontName /NRHWJQ+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 13672 0 R
->>
-endobj
-13671 0 obj
-357
-endobj
-13672 0 obj
-<<
-/Length 13673 0 R
-/Filter /FlateDecode
-/Length1 2572
->>
-stream
-x�UV{l�������qb�j�b;q����
-!�弜��M�pfHRg�YA��2H�
��PhK[6�
��iZ�R�bm6MC����ұN�#�*0�
��y��s��s�w�w�y�ι�~�cV�8+�7�$��?0������3��/��χ!t2>�W��{xk�8T9dS~>?>v`z�o�3�o�?2:�/��w!�??����� �
�y����L����
lz[7׊
4,���
y�z!7�4��12�KI����f���y���G�zo�k�ؾP
�.pE��x�/N��n��8+I,q
��b�a���f��(��&���,���R㯤
�q:�j����A:��\��(6�JMu���U�h{jz���XEN�玭�*T�@w�Ps����n�?*�;S
�Z#
gnVf�&M�Rgg��E�r��6S�
-�!�P
��a֑	A	�J���D"���E�&�-o~B�˵���#���dž(V���,�
_�P�jzbe������IhL\ۼ�$T�l�E#n�q����$n'B�&qya*���k�<�v3�������L�]��]��bW�ȇ��̩�g�'g�&�C����vn=��o�:M)�[�.�����%]Ĥ̜���
��lDJ9x�1��Q]�`lz%�;I!h�g�8�1˪�ސ���=�q��s��jKN���8K�D7�ˀ�!.�~+z����-
.nm�����XH�
_�Q^�Z#
�c-B�b5�\�
-lf
<�
:��
�Ye��vN�
YK�ÎH�S=�G��5Oe��#�Ȏ�
���F:�q����U�2���ӕ�3xށ��
-O�����~�^��z������Ӈ�G�/�E"��PH�+����gg��
��do��xot���*	[�ɦ�)����0ӁU�j`��ճ'��79����(���\���H�?0H���eI��O���B���(���#�����ۃ7�XM��0�����3G�詥�'.ML�N&uJ鿆�ʶ%�е���
�$�ݛ���(��U�
��L�l������

o��P|��
/�z�����'��ɧG/���xa��Wcp"k2
٣ �kch�>�94�zI!���l��6?{�M���&bv��*t�#�
�T��62��p�g4o�
�4����:K��������B�&!�Vp�U���~WA�=�`��lꊴFJ�s
Z�!����I{���9��-��s�wyQ3�W0��kVFa�OCC�k��Ws
�zMi��;yR��0j���d�Q���OK���
�رԑ�'���#>��>c���������Um(�ny[5��߼U:G�<�w	�sX0_�h��7��q	t4XZ[���[ٺ�|��o\�[7�tm�mmu5-A˙�#o������ΒHs�@��.��с��ѽc�a�C�1]�I���(�g��� }�Z��X
��
�"j�dpj
�`�
���رg�����\G�ޕ+�Nt���Ǖ�77�gL��{
L����O�������
�� �/<�m
�5�-M�MZi�͡�$Pn��SQ�}]�Iy� ���rl3������?�<ß��LWb�}��>�`2:�����qdUħ�9��.L憿֤�dRy]��V�B��r���ɓ��g##y�0%�i�Q)��ݘH`d��Ԕe	5k��<9.i�
G
�SPei at U��M��	�ף�����,�1��l&�G.��6��F�δ�
�dT<��
-�;�]�kޟV篟KU_*����U0*n���
՟�~ry��˕�G�<�>�毳^^�J��լ��%n��g��:�όx�+e�BX���#3W�1��|�����>ֳ"�
�=X��F��;�����^�'�����:
zG�
���G4J���R\ �)�{%��}���xP�
�΁�#	�<���
-a�{4U����&�ͣK�̃@��|�
-�)L�?
-�'@
-endstream
-endobj
-13673 0 obj
-1927
-endobj
-13649 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-13654 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13658 0 obj <<
-/D [13656 0 R /XYZ 89 770.89 null]
->> endobj
-13230 0 obj <<
-/D [13656 0 R /XYZ 90 680.62 null]
->> endobj
-13659 0 obj <<
-/D [13656 0 R /XYZ 90 680.62 null]
->> endobj
-13231 0 obj <<
-/D [13656 0 R /XYZ 90 634.602 null]
->> endobj
-13660 0 obj <<
-/D [13656 0 R /XYZ 90 634.602 null]
->> endobj
-13249 0 obj <<
-/D [13656 0 R /XYZ 90 576.629 null]
->> endobj
-13661 0 obj <<
-/D [13656 0 R /XYZ 90 576.629 null]
->> endobj
-13250 0 obj <<
-/D [13656 0 R /XYZ 90 530.611 null]
->> endobj
-13662 0 obj <<
-/D [13656 0 R /XYZ 90 530.611 null]
->> endobj
-13663 0 obj <<
-/D [13656 0 R /XYZ 90 484.593 null]
->> endobj
-13664 0 obj <<
-/D [13656 0 R /XYZ 90 450.53 null]
->> endobj
-1233 0 obj <<
-/D [13656 0 R /XYZ 90 359.922 null]
->> endobj
-418 0 obj <<
-/D [13656 0 R /XYZ 90 350.011 null]
->> endobj
-13655 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F22 2996 0 R >>
-/XObject << /Im19 13648 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13688 0 obj <<
-/Length 1991      
-/Filter /FlateDecode
->>
-stream
-x��YKs�F��W�� U�h�W*U���r��J�=�)DBjI�!��_�=/ A��0{�	�`���u��=
��H�l/��`{
��&��%Ie2�K
N7HHxZ$R�h��진I����������w�k�n�z6�cB�N� ���|5��;N0�,̌N>�I��S�er=�u�{�9�@F_#B!~���L��r�M)��/�궨����zޔ�z봊{�׋K�K$�L'SʐR���H��}�|�
-��۪Z�q���>��77�
����.�S
?�/?b��Vs\���͛uSԟ2*�|y��v������n�zT�r��l��oL��Vy딽�̈H�zut!��4�
`D@���..zp%*�V���zQ��e��
t�0��a����;
rD�w��-8��h����<���(N�lꌩ��n�I�x���ܗ��8�X�?`��>����������4�"��o}��U��8����猀V�1
��
�>}��T۲)n.�Uޔ�����:�k�#`1f�'g����쀍����|����ݹa"�|Ę�I���,�$�qR�PI�U[I��e�0&�($��F��ڕЁ��rJ0A
��F����:m�8	������"�9�3�*\86Ҍ
�Q�>�[8��a�9M�Ż�
�����=:w�&
)o�i�>m"���H
y��
4E�2��O����w���F���GF��yr�6��” �!� 5E+v<�Ks���;mrO5��x�MD����r�RY������*���:�y#��bB�!d,�
⸅�ڌ ��x$
�QY��D&s��l���Vq�GL�T3qΟ#B&��j
-P�k�N�B"0��gP�@D#
-� &$":�˼)����1D����U�k���i�j�:ܬ��r�+�����=0v��D�����S�(L��Z�4�jc��
{�ͣ
-q>B(�	�ZI@
k��,V ����~~2���>DJ���q�k�c�u��NH�R��<�;k�)1���6��i��س�M�3�;
�-צ�_�՚�b���
V����:��OBc3�b�@�I.ǰw�6
R�|��z�j@
�a�W2w*�>��K�/#���c6�+�aX(��W�����3_y���3G��)��0
�x�}��T�(m�/}�f�P�e[ՄNI��Mo���	��-;	"
˰=k5y�������"@"#�
f�!a�&2��]��� ��2P�T�.��G:f�&���wɈ�XV�Pa+�?��V�Nj�JUM�94���h���,��3��<Z��
-5���΢�����}�.�$���{ؾs��2�n�V�2ʡ�^��;bJ!
-��3숁8��wt�1�VK<OŢ
Q��!�9T�f�o��:w����ed�-
uU�9��\B�
�6P�t�1
�
\T��U��`%Ib���s�~��KCα2�S�w{+�S���9$?Ώ��'���1~"Hiz�5������
X�b|�����z��P�9��C%9P�0%٨U=J:X ;Ẉ�t�*t��5$۹x�k!Ř�OW��λБ�9L�*<i[sK�9�U�q�c����{�d�g��@�Π��))�w�g�{�Y:�|
5�.ѻA#�i�̡DwM��^f�/��H��;�Յ�X7۰�CX2.���.�D��N��
_R>4l5�m�0�w�ӢZ�����4�����<�
2y��i������b)�+vhv������Fat�y�d��V��lo�hw��sX��(��+����.b����LA
�
�ܕp��S�7�_D�3���Ξ���
����6<���0
J�e����|�p��?`ǘ(E���{�	oV,��a;qS�7�	t4){}H=
 
s<�D���z�o��-�o2!��%�%_?��Ehܺ�RԻ~�f.�M��"���z��U���֎>��E�-�f������

�
ͫ�>5w��a�v�⯀U[���;�
ׂ��
I��
-endstream
-endobj
-13687 0 obj <<
-/Type /Page
-/Contents 13688 0 R
-/Resources 13686 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13665 0 R
-/Annots [ 13650 0 R 13651 0 R 13652 0 R 13653 0 R 13674 0 R 13675 0 R 13676 0 R 13677 0 R 13678 0 R 13679 0 R 13680 0 R 13681 0 R 13695 0 R 13682 0 R 13683 0 R 13684 0 R 13696 0 R 13685 0 R ]
->> endobj
-13650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 684.555 169.81 695.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a47224e5fc07b3798eb4f2f5837073894) >>
->> endobj
-13651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 684.555 309.485 695.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-13652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 684.555 514.653 695.086]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-13653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 672.6 227.553 683.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-13674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 642.799 169.013 653.703]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_af3e260242ad3eb13cbe5281f3c51abb5) >>
->> endobj
-13675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 642.799 324.27 653.703]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 574.521 276.535 585.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_ac63c0ad7c349a9bc2071d7ed158d9ba0) >>
->> endobj
-13677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.753 574.521 390.238 585.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-13678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 535.897 284.284 546.801]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8684a78903049fa062f98ada32e1a1f4) >>
->> endobj
-13679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.096 426.019 156.462 436.923]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_abb2196b5d457aab2d16ee39b6c0710aa) >>
->> endobj
-13680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.459 426.019 311.9 436.923]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.712 426.019 513.996 436.923]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 414.064 229.376 424.968]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.096 372.681 156.462 383.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_abb2196b5d457aab2d16ee39b6c0710aa) >>
->> endobj
-13683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.459 372.681 311.9 383.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.712 372.681 513.996 383.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 360.726 229.376 371.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
->> endobj
-13685 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13689 0 obj <<
-/D [13687 0 R /XYZ 89 770.89 null]
->> endobj
-13690 0 obj <<
-/D [13687 0 R /XYZ 90 703.941 null]
->> endobj
-13691 0 obj <<
-/D [13687 0 R /XYZ 90 660.825 null]
->> endobj
-13692 0 obj <<
-/D [13687 0 R /XYZ 90 591.885 null]
->> endobj
-13693 0 obj <<
-/D [13687 0 R /XYZ 90 551.547 null]
->> endobj
-13694 0 obj <<
-/D [13687 0 R /XYZ 90 485.012 null]
->> endobj
-13697 0 obj <<
-/D [13687 0 R /XYZ 90 322.792 null]
->> endobj
-13698 0 obj <<
-/D [13687 0 R /XYZ 90 322.792 null]
->> endobj
-13699 0 obj <<
-/D [13687 0 R /XYZ 90 259.452 null]
->> endobj
-13686 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F11 613 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13705 0 obj <<
-/Length 3272      
-/Filter /FlateDecode
->>
-stream
-x��[ko���_�E��B��J m"éݪ�Rp
aE��E�\eIZq~}�<�1�"M�	�~"�;��s�;���.�ً��\�<�P,3�H*�����LI�%��${7")rzF0ƣ�S�Gy3ͯ/O)
����b��ׯʛ&o>����ᡞ�������E9�

����۟�S�G�|^ֳ��W�=� d02#i��.7�}��80�v
..�_�Ec���,���N}|(��gg�2D��AF��w�T�j��"a� �kՎ��3�i[������3*�����Q1}��E៼)n
?���>bJ�g��z����O'��q��)���'���l���0bFg���4��g��=��	
�P�ŒI�"5M"5�3K�BH�Y��O���
Ld
-qE}����O�b:4DB 0�2��!�c�v
<*���R�B(�(2�D6G�1΅���E�
��HA��F�5���&�@�f�|f?騴��`a�W�MUΊ��oo[m��T�A�&��tF�Q~���
椐�f&�����ւ��P ��Yg��`^/�1l���r�O뇢�u�_�az�d���<t�
���EA��xe-���yj��5��q����r�.��J��(
�$P���q"�
-iX�gD��F�
$�|� q h�wxg pl�1Zoǹ؎s�$�;�W,��z���@�Y�Q4�e6t��֝N��ȗ_&}e��FX�648�2��0!!-D
	�q�1�E?hU���
[FRY2�Ю_	@�%~
N�
�k�րu|��ѐ�#Q���
}��wg�@��vgL!,|Qڌ
d@�~�SV���<%�,'�_
�
�ɐ�Dn�IZS2H�$�/��ЦHX�`��m!�7���9��7�E����sHϡC@��t�KX�5)B�4�.Sw�~������m4�I\
Z}�P�
}B�aA���
�gg�>�X%��G%
�0�K�ʼn�>B|���3p�u��H��;B�ӎKh�hBo�h�����-�6C�6ЯxbC����a )t
^;���Ѡ����_
ơA=���f4h��g����UUm��8?O�,�)�m�j�[;6ER�I��<ֺv����^��<�ZGq�cE��2�2=����K�����n��8a� �[�*U�!�)�����|��δ�>�.�4��$�}���	T��������f�C`�(�/F���h�<^ӛ�f|�G��xa9���z���E������A�(����ZUe�
-�Y���^QD
ޔ]�Y>u�]\��
���C,��$ݦ4�:����
L����x+y=�L{
-�w���c|	���x��S����
��~�
��8�*�u�U�3D����ؤ4�
��+J�Y����N���*%G A��6�tg�p�1aB�
*��x9c|\�J�
-^"J
-M2�%�@�	��P���bW�2-
a8���"Q�=H��(IGp���
�
N%Ĝ�flCe�{}�!�t����s��;'q�jK���mo��:�#�	 C�$�n�w����[+YY0�@fUߞR������=֍dK�u`X�Xe��.G�t<
Y�]��|Q;��Yb
-6M�6l���
E'o��.��+����
-�P��a�n׽~��2�)R �C�F�M���%�A��{*�>��{$�f�T�
`!��SS̗�"3+
����y�0z"JO�����ʙ]H�
CE9��%�X�e�X�������'
-j��
u0��_�E(�\yl��h$�Y>s�qk/�M�b�?\��
-�鈒������]�T`�� ���q��'{�~\O��)�i*_t3�oSj����ob��ѝY��r�0
- ��Lں�3(ᰁ
��w�v����na�5؆J�[z at 9��C.���<�q�3a��i߭
fq�
���,�<k�Y�N?o���1cߞ�q�^��Ͱ��C
�m���]�m�N���w���Zq�E��mCUl�U
��k;�6�
57"ؼ1ܶK���=t�
=��Bv�8�2F��ةa��?���Od�U�Sr�a�d�7G
��M}G�б{�R at 2�.>
-��XXQ�)�)���O�y>	�ìIh`M��i=)a���$���`���n���ꈰ��
��z�g+M̝����M�X6����g�U=�;찧��4��iZs�4Ϛ/�㢘�w�
-qѱ�ۼ��Fe1ձ��k
�y �g�@����Z؆���^;"�yr���]�ꔌ*��o|M��T������q���

-��~n�G��YSؿ
�I'�����
����ݺ�M��
i���߿����V��l�?Ƀu�|^�˼?��>vVㄬJY\���T$��_��%
��2]0�=bã�
�P>�c����=�7�:�@C��W���M�����-��2�C��٤�d֦��"x��
S�Q ��PP��#(�o��a����qS>���MT�L�E^V�U>��
�y�O�R�`
j
�gy�:�V
K{�"U����k��Ӈ��*u�l>j�Bbz��${���tj�S
ׯ��b`'n��H�f�zUip}��yl��N5�W��a�
�|[�Rn��|��荄+��� wZ=�	�I�@�gA��h�b6��R�k{�o��)�� �|l�>��b㱁01i����4�v՞��pj �&I}$���Ѐ^���7�F~�+�Â��V1.7$�j�@��x��@�2�[�����dn�������*�+:,=0Yŧ�
ء�+���[,vwY͸;�x
���dl������p�K���Q,�P�
-[�r8`�դ#4d*�bT]��،mس7=�cO*����i��甎k��YD�� @L����N$�E̡��PGڮ1��O ��Q,����-X=���Wi~
3�@�����
-���
r��DPJi	�	�lU�^so���]sg�B��%����h�a���q7���+N\v�\ܧzB���|W�͙>��‹$s��Dt�O��O�
Z������MP�`AKP�
�P7�c(C�~;E��(
-�e1|
�]	n��(G���(C
��(G0��(C3�OQ�Rc�ͻ#0�I�/A9����
�ߓ�
���N�F���"�O"�"�z�o��yV��+f���Z�충�+�[�� ��W�ͫg̒�6�v����pBä�uS����2���^^��_�����f�:�-ۣR�/y=��/E�mL�$j%Fo�7�Ǭ��7/�����
6������o�w�bv���t=x�y (�m����]�����`'j�Kw��	���� g�tb��)E]��w���ax���e�������?�� �
-endstream
-endobj
-13704 0 obj <<
-/Type /Page
-/Contents 13705 0 R
-/Resources 13703 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13665 0 R
-/Annots [ 13701 0 R 13702 0 R ]
->> endobj
-13701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 245 501.708 255.904]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-13702 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13706 0 obj <<
-/D [13704 0 R /XYZ 89 770.89 null]
->> endobj
-13707 0 obj <<
-/D [13704 0 R /XYZ 90 556.703 null]
->> endobj
-8368 0 obj <<
-/D [13704 0 R /XYZ 90 535.861 null]
->> endobj
-13708 0 obj <<
-/D [13704 0 R /XYZ 90 535.861 null]
->> endobj
-13709 0 obj <<
-/D [13704 0 R /XYZ 90 423.779 null]
->> endobj
-13710 0 obj <<
-/D [13704 0 R /XYZ 90 231.446 null]
->> endobj
-13700 0 obj <<
-/D [13704 0 R /XYZ 90 209.07 null]
->> endobj
-13711 0 obj <<
-/D [13704 0 R /XYZ 90 209.07 null]
->> endobj
-13712 0 obj <<
-/D [13704 0 R /XYZ 90 138.972 null]
->> endobj
-13703 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13764 0 obj <<
-/Length 1757      
-/Filter /FlateDecode
->>
-stream
-x��Zko�H�ί��R֖�ɼ��Tە6	��m6����
-p�[��1m��{�c6/��-�V|�����sϹ�0��x�8k7N�
fH$]��{CbCp�
���[�3n�o�4��!"]h��>��n7��w�Y��n|lx�
�
8HxFo�x�
}�����I����
N
G�]��c��1�x%&�]ęgB!:�w�:�ˋf�[��؜LFh8�Ou�Cux>!2p 
�*�6�Nm�ayo	F�Z6��eQn���_�#q\�y��
-�����
9�X�5�[9�bą�\$�q�,F�xdb·A?��
�s^
-�U�M�IJ=s��i� �i�td���>NT�!�b9�۠?���73� /��׿�1���*)I,�1�>Uo?}Ni�
0��<~�&�L{=�0� O N�1/h~r��/�e^4�}���?��C�Ͷ�=3OF~d"���
-�gHr����f�Q/(I�"C��9�r� 1Y��0�l���$c�\_&y��D�]����~�\�
�;M���q4E�����1�,�
J���K�F�~�-�&,-
`
$����/��*7X֋���O��o�(+�H�8a E���u�Q؃nRϼ
-�� ���g��o	�-�ŊR�b��j%$�\����R�-���5�i%
6�VQ��;8������ �B�t>	��
3��;
��3�d�3�1f^*�A	P��
�tc`¨�l{d��/��
��d*�p�ݼ�kV|���-�K^���
�U�
H sx6
G�i��('w�ߠ ���F���L����Ø.�aq�+� �h�o��>�E�t�)
Th�=�_�={��<��LU���|��M�Nz�i]���vQqB��0=�׽x2_ ��Lu@���[�{|po�����X
�޼7�ٱ�Gm5.�Q��#b6��a!�d�>�&�qY-���y���%F
mrs2��)��9�`f���0�w��s��^�n����������q�����e�ͣ���vf�aY��s�^����s�
��":�η%�jH}��
-�h8�G�t����H���� £f��ً$�7'�� :��]�yש���CK�N�V>
II v���@R`�����teQ���;
-�P^]��<�����
��狓�(
�ON�6�vԾ`eE���jg%Ct�\�*bT�*b��>��T0,-�Ñ�W�����
D�m{cVٷY��H�I7�����*�Vy�
R^�l;��ir�E�u��O�f����0z�I֏P��
��l��Ip$\�5zrD��0�.:wC��G바��),^o�k�HT
-�N'��.�8��T���
-�K1�GOFvk��"_�d	�
�P9|L��W�:=���8�G�D�D�#{��)H�U���I<��
-*���,��Ӱ:�;���D��"K���qf�D���Rf�=�[0���\o@9;�)��|��d?�0��r�mu���V���r_
u7��&��|�RyHw<��
-a�^�%����݇�`Voo
����Vd.����X,VM�-W�4iv�����r�`�u���k곈�&@�a�\����-����w��h���
d�!�����H>6 "2l�r�=,��7N/�̸���ҝ
����O&+e�#�Cr����V�U>�ɯ����r�G�blP����
��S�$+��e3I�b*������F��z%
X���9�i:yzzڝ
�A4@�����l,AfbQR��D3���Ca7Ǿ������$ձ
-endstream
-endobj
-13763 0 obj <<
-/Type /Page
-/Contents 13764 0 R
-/Resources 13762 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13665 0 R
-/Annots [ 13713 0 R 13714 0 R 13715 0 R 13716 0 R 13767 0 R 13717 0 R 13718 0 R 13719 0 R 13720 0 R 13721 0 R 13722 0 R 13723 0 R 13724 0 R 13725 0 R 13726 0 R 13727 0 R 13728 0 R 13768 0 R 13729 0 R 13730 0 R 13731 0 R 13732 0 R 13769 0 R 13733 0 R 13734 0 R 13735 0 R 13736 0 R 13770 0 R 13737 0 R 13738 0 R 13739 0 R 13740 0 R 13741 0 R 13771 0 R 13742 0 R 13743 0 R 13744 0 R 13745 0 R 13772 0 R 13746 0 R 13747 0 R 13748 0 R 13749 0 R 13773 0 R 13750 0 R 13751 0 R 13752 0 R 13753 0 R 13 [...]
->> endobj
-13713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 563.146 225.331 574.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6713cca018bed4091ffafb98ca4833d0) >>
->> endobj
-13714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.808 563.146 295.451 574.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.102 563.146 466.491 574.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-13716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.983 563.146 513.996 574.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-13767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 551.565 147.454 562.095]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-13717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 523.408 225.331 534.312]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a28f6854a94a3a7d58034cb1d51ae9c7c) >>
->> endobj
-13718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.669 523.408 337.121 534.312]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 495.625 225.331 506.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4857c775f03d5b4ff084723eed2b5e31) >>
->> endobj
-13720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.147 495.625 313.6 506.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 467.842 225.331 478.746]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1daec40615d5a93ce0de360865d93497) >>
->> endobj
-13722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.669 467.842 330.496 478.746]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 440.059 225.331 450.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abc31d844172a202d43d08e299e26322f) >>
->> endobj
-13724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.147 440.059 306.974 450.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 412.276 225.331 423.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad3eb603756ab7be783cd92410ac7aed7) >>
->> endobj
-13726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.73 412.276 311.287 423.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-13727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [333.635 412.276 409.101 423.18]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.431 412.276 513.996 423.18]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 400.695 157.407 411.225]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 372.538 225.331 383.442]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adca9874a75b5ba09114b8495a23c4edd) >>
->> endobj
-13730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.424 372.538 326.366 383.442]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-13731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.338 372.538 424.804 383.442]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [475.481 372.538 513.996 383.442]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 360.956 173.457 371.487]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 332.8 225.331 343.704]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aef3ebc0ed74af80cd3653321153360bd) >>
->> endobj
-13734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.498 332.8 274.752 343.704]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-13735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.94 332.8 373.406 343.704]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.12 332.8 513.996 343.704]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 321.218 123.096 331.749]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 281.107 225.331 292.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abad856c82bc5ed461fed87d318fb5950) >>
->> endobj
-13738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.245 281.107 270.845 292.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-13739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.88 281.107 311.607 292.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-13740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.428 281.107 424.894 292.01]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [475.481 281.107 513.996 292.01]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 269.525 173.457 280.055]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 229.413 225.331 240.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aba9a62afaaf44d400bb19bc9af041182) >>
->> endobj
-13743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.813 229.413 297.973 240.317]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-13744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.144 229.413 424.61 240.317]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [475.481 229.413 513.996 240.317]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 217.832 173.457 228.362]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 177.72 225.331 188.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3b90222087f1b165953960beac112e72) >>
->> endobj
-13747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.815 177.72 325.084 188.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-13748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.155 177.72 450.621 188.624]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [501.493 177.72 513.996 188.624]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 166.138 199.469 176.669]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 137.982 225.331 148.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3b5db50d397654bd1a8d4067d90f7419) >>
->> endobj
-13751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.473 137.982 362.894 148.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.382 137.982 454.848 148.886]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [505.05 137.982 513.996 148.886]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 126.4 199.469 136.93]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 86.288 225.331 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a964b893c418b1885f22f833e42cd730d) >>
->> endobj
-13755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.333 86.288 363.754 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.53 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.211 74.333 256.963 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13761 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13765 0 obj <<
-/D [13763 0 R /XYZ 89 770.89 null]
->> endobj
-789 0 obj <<
-/D [13763 0 R /XYZ 90 701.208 null]
->> endobj
-422 0 obj <<
-/D [13763 0 R /XYZ 90 694.434 null]
->> endobj
-13766 0 obj <<
-/D [13763 0 R /XYZ 90 582.084 null]
->> endobj
-13774 0 obj <<
-/D [13763 0 R /XYZ 90 155.185 null]
->> endobj
-13762 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F22 2996 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F39 2320 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13843 0 obj <<
-/Length 1952      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�6~ׯ�S*�T0�G��C�8�4鸎ۗ$��HHb�C!);�/.R�DI�u���I4���}�],`h�
h���\\��p�ka˸
.4l
��q����Bؽ�!����\�0��|‚������_��
�Ћ���3��묇�n��(z_n�]\!��Al ]��#����R��ˀ�[��D?�����%�7
Ӛ�.-���a�곯#/��l�=wY<����aF�P�1��R5↍�T�%��gB@j�S����Λ�����@Ҽ&�c�q��h���q
�^v�
�;t�Fj�W"����X��� :�ͅD�W�0
-�Z����$gٝW�wL��M8��{Y���@��N��I��0�}�D5����p�˶	l
���U��p�|�YJE.�,��JC��crccถ�cZ�����Yo�v�O}�8J�(Xѯ��*�Ѝ
�I��,�4��i�gH�0h�}��e��ъ¥�jv�X&��2��8�X��A��p��,)z�.R�O!đ���P�q�/�v-@��B҄�	,X![L¼|L8=�>^4r���J!X�
|O3r�u
B�gΉ�?����È	m��-W)�l
�제&�0M��pg�M|��TK�x(ȊER�
SԜ]���6���������R��Y�u��E1�4i.S��{�>�A8��ݴ�[y�M  L�EC��h�_?(�S�{��6�z>T#�
�P�����e
î����w��t!�z��&J�07,X�8|��GY�<@nK�-�#�2<:�y �QS� N΀��
�8L�xow	\^�����o:g���t���,,�v��tFY���i��F^��5�“!h�!�݂l�
׈�e�;�����V^L�#�i�	:�CX��
-���2�	��M��_�+H	�3�zK=װ�za뷮�R�=͊�0+�n̚3>.8�E7:��B��|�����E����jc�JҚٔD2�
+�r?	}�4i�l�|Ch#���
|feH	��	���z?&�+^f��a�f�1g3�\�]�z���J�����R�����������Sci?
,��b��:�[V:߶F���
-�L�
܇����"H4�����B���"��$�����➱���{�E����_ԇ�^"���h��Ӧ�/c�jnf���2
�,J��y��Ֆ38�0μe���eU�n����%��1��2Z���U�0�xZ�ϔ
6�@�W���
h��C�x�n:�t�|�8��"��*Qȴ�C��'
�(�j9��)݅:ŀ��Q�%�(vމt�e9{j���0�y����_���c���p�����c+rD:�4��q�˓q��3�2�)a;�a�eF�#ăb��z�!��i}��1d#
���G�5�+FH�$�
-�BDJ�φ9S��u��
-0�ą�U@����X?��ͱ=j��(��ߩ(Z��4~�s�2V
���;�u��5��S8�6I��[���}�W'F
-}����P��
-��#���X��⛷b�m�
���w.b�����h�X�)똞e�Β�t��b��4�Y���)6�;7���%�Ҽ,��}���w"���C#��H�a�Zh�󲦚��:k��^��hشi�8�=�QO��9�R�ƹ�@�0z�
���{n8/��6�X����
�y��H8���דla��.Ɲ�i<)w9ӆ�g����?��eGcAN7��������m�%��I,ѩ"V���7OH���U�����@�	��t�l�����U3?���b

��Z���Bko[���-qH�ު���e��)8���z�����z�3g����y��Kf^ԫ<CY��nt" �Y}��#+�WB�c�O�������3]\�������p6�Y2�ʖ|U�EEfT��4c�����O(�H!��KKpc~�@ �mc�c�Y�,ꆋ_cb\����\�9�@\
-endstream
-endobj
-13842 0 obj <<
-/Type /Page
-/Contents 13843 0 R
-/Resources 13841 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13665 0 R
-/Annots [ 13758 0 R 13759 0 R 13760 0 R 13788 0 R 13789 0 R 13790 0 R 13791 0 R 13792 0 R 13793 0 R 13794 0 R 13795 0 R 13796 0 R 13797 0 R 13798 0 R 13799 0 R 13800 0 R 13801 0 R 13802 0 R 13803 0 R 13804 0 R 13805 0 R 13806 0 R 13807 0 R 13808 0 R 13809 0 R 13810 0 R 13811 0 R 13812 0 R 13813 0 R 13814 0 R 13815 0 R 13816 0 R 13817 0 R 13818 0 R 13819 0 R 13820 0 R 13821 0 R 13822 0 R 13823 0 R 13824 0 R 13825 0 R 13826 0 R 13827 0 R 13828 0 R 13829 0 R 13830 0 R 13840 0 R ]
->> endobj
-13758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 695.061 225.331 705.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.071 695.061 276.878 705.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a187bdab1051f58af280af66645ce1fed) >>
->> endobj
-13760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.215 695.061 415.636 705.965]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 667.651 162.657 678.181]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab3ad0a7ad694f4a7724504544aff49fa) >>
->> endobj
-13789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 603.329 190.738 614.233]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 603.329 261.85 614.233]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a38a5f3efb1fe599046d2ed48223bfa41) >>
->> endobj
-13791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 577.649 190.738 588.553]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-13792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 577.649 262.159 588.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a46f912e8b181561f68062e183005c8bc) >>
->> endobj
-13793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.216 564.135 279.072 574.041]
-/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
->> endobj
-13794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.187 564.135 391.232 574.041]
-/A << /S /GoTo /D (index_Grid_Affine_Dimension) >>
->> endobj
-13795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.523 552.342 210.384 562.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2583843b139ce11b842155b35d60332) >>
->> endobj
-13796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.523 526.662 210.384 537.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a294875fd6b469d8949f08c24b5893b6e) >>
->> endobj
-13797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 500.608 202.922 511.512]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 500.608 248.58 511.512]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1dc5b9db43a16365ba0773a96fe1b799) >>
->> endobj
-13799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 474.927 202.922 485.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.42 474.927 296.181 485.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2fe458f016db5eeeb95bee46f1800533) >>
->> endobj
-13801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 449.247 209.547 460.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 449.247 261.831 460.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6bd361a7c7e187c0ff63c62894e741f8) >>
->> endobj
-13803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 423.567 209.547 434.471]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 423.567 309.432 434.471]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a425f248891aec4ed7800bd92334fd7c1) >>
->> endobj
-13805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 397.886 205.692 408.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-13806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 397.886 261.312 408.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acc8d0378d1cb13b5ddc04dd12cf18ebe) >>
->> endobj
-13807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 397.886 332.156 408.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-13808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 372.206 205.692 383.11]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-13809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 372.206 261.312 383.11]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3be7b3a04406453631aef24b817565a5) >>
->> endobj
-13810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 372.206 338.781 383.11]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-13811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 346.526 205.682 357.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-13812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 346.526 261.302 357.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad3e2a76d26bef272d0a13fa3bae9a5c2) >>
->> endobj
-13813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 346.526 330.462 357.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-13814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 320.845 183.824 331.749]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aad10819182a33870e4b0a7e3b2bca564) >>
->> endobj
-13815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 295.539 192.272 306.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1190fcf4794305386f8475f9ac51ce00) >>
->> endobj
-13816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 269.485 241.935 280.389]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a41c9a9dc63e253ac5ed21cbdad4e2640) >>
->> endobj
-13817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 232.845 213.163 243.749]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adb466cb206f1d16d24257a838d130cf2) >>
->> endobj
-13818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 232.845 351.922 243.749]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 209.42 189.901 219.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adf7bd95cb0014251d60d1fd82c1d3932) >>
->> endobj
-13820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 183.74 193.229 194.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afb7b94b681c4d195080fa81ed1480cc2) >>
->> endobj
-13821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 158.059 187.689 168.59]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae386245235cada70fc797b0747b0d326) >>
->> endobj
-13822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 158.059 226.693 168.59]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 133.887 228.895 144.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a99dc4fb442b60dc9c694d7abc853a3dc) >>
->> endobj
-13824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 133.887 333.482 144.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 110.087 229.503 120.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa8128b9910f31bc963842e48c44a863e) >>
->> endobj
-13826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 110.087 334.089 120.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 86.288 187.264 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3a03cd3ea1b11c1c8dbdf462959d79df) >>
->> endobj
-13828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 86.288 293.213 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 86.288 371.148 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 86.288 455.727 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13840 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13844 0 obj <<
-/D [13842 0 R /XYZ 89 770.89 null]
->> endobj
-13845 0 obj <<
-/D [13842 0 R /XYZ 90 712.265 null]
->> endobj
-13846 0 obj <<
-/D [13842 0 R /XYZ 90 684.481 null]
->> endobj
-13847 0 obj <<
-/D [13842 0 R /XYZ 90 618.352 null]
->> endobj
-13848 0 obj <<
-/D [13842 0 R /XYZ 90 592.86 null]
->> endobj
-13849 0 obj <<
-/D [13842 0 R /XYZ 90 567.18 null]
->> endobj
-13850 0 obj <<
-/D [13842 0 R /XYZ 90 541.5 null]
->> endobj
-13851 0 obj <<
-/D [13842 0 R /XYZ 90 515.819 null]
->> endobj
-13852 0 obj <<
-/D [13842 0 R /XYZ 90 490.139 null]
->> endobj
-13853 0 obj <<
-/D [13842 0 R /XYZ 90 464.459 null]
->> endobj
-13854 0 obj <<
-/D [13842 0 R /XYZ 90 438.778 null]
->> endobj
-13855 0 obj <<
-/D [13842 0 R /XYZ 90 413.098 null]
->> endobj
-13856 0 obj <<
-/D [13842 0 R /XYZ 90 387.418 null]
->> endobj
-13857 0 obj <<
-/D [13842 0 R /XYZ 90 361.737 null]
->> endobj
-13858 0 obj <<
-/D [13842 0 R /XYZ 90 336.057 null]
->> endobj
-13859 0 obj <<
-/D [13842 0 R /XYZ 90 310.376 null]
->> endobj
-13860 0 obj <<
-/D [13842 0 R /XYZ 90 284.696 null]
->> endobj
-13861 0 obj <<
-/D [13842 0 R /XYZ 90 224.258 null]
->> endobj
-13862 0 obj <<
-/D [13842 0 R /XYZ 90 198.577 null]
->> endobj
-13841 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-13915 0 obj <<
-/Length 2259      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�6~���#U�`
	�ۮ3�ڜ��ٗٔ��`��tHʎ��o�)Qm�
o�<	$�f��_7ag�`绳ޜ]|�#�����9;�+��i�|��̛�~��<���y}���7~���ugn��<#P�
b��N�>��;v��{#&��d�
�2�]9�g���B��_#�d� �<W�F\�(}B!V�O*ߤq���Hn4g0���4�Ӎ��ZcR��+�F��tF}2	�-$�jkKPez{���������Y� .�p5E~e����q�ۂZ?��Z��I<�0�DQ=��g�M6�B_|�N]>I��d�ɔ�ɣҏx�
J�
	换�8�e���9==���>
-��O�

g��`^��F�K�%
2-)�0CQ�6�	�7k��1Xm�J��
���&W
d�\"�7\cF)�\bf��K)our>�8Ơ�dU��^�.
��dZ0"&��h
�W��fD�9�8����1�U��?��U�EI�?���+�5��Nȼ�e�k#�0Rq�9 �t
��ć�$�H
���Qj
��zڮ�Zh��(k��T��;�4ȓtw2]y����޵n۬�G9� ?�E�ȯ��rN�
kg]�?I��t�l���!\":D۾G�Fv��~�*�.*f
���C��#���0���uw3�d��8΀�h(�T
�-�<��zp�HԎ�P��g@����TC8�sr���^�äW`[��æd���4&�+y�̃ۢdVKcүh����$��9V�,5��C��`�[�J�lE��`�e�*ư�3���XkЎ�0y_������&L��R�!	k'Lx?a‡&0�v*�;&|�i�BrP´7���	WLӓ,I,_)Y�ɒ{ռ<Q"
6$Qz�<�H��;��u�]'
@|�ٕ�� ͣ`���?��&T��U�@!�t��
������ [...]
��x�`/�FJ�i�Ҁ�$%x���}�޶܆�)v�KXA�t#Z/k�@�r(�eb,���C>k
y�ؼ��W���Y�� �{aR'��Aq�u�,ȣL����T�����R kߧ�p����!a<"���h�b�!�ǫtJ�
�ޛ1f��R�[xg�7q�C��>��A^4
-�E!YDw۲���J����z�}w߱8h���:1��~ԚN�E�̓�bnl�Q���`�����B/���X,��RC��L�����'��/~5�IW�tѓ��D��2��Ľa�<̶����S�߿+���,���#���X�j�0��N����u�_A
A ��4,;y�s/!rǡ:��=����q�;(����r����"�D�Wyu���&����}
�F��N�έ���=��u��3�;�yσ m��F���z��j}���+{2�*M�Z3B�G|�e$"`�x������Q�#�_h����
 �!��
-��
��p!�;1H�Y�oÕDG|k�x.$F�>��Z��Y��a]�l����E������Z�-ɿ��� V��X�R�h�/d��
�
@0��[,	�;P��
��F� ��h��<@,�Wǀ�ސ8N��7v�_�
F];����찉+�?����B&z��vչP|���Az��/�q�ޣg̘��R&���U/���1������ȁ�*gԼk�/OT�������J3F'�jW�s�����
��}	��n�
w'A�E��
e�$����h���W̌
-;�ߊ�\�e�Ƙ[���ת{�p�l
�.����P&��tN��m�µ|�|NR�,SE����]��#�>9�8Y_��8J����K���P�3c�
ҥm�7��ģ�@�0�
B_�&c�	WU�)s�5�Z�g�/M��Y���H��"Jqf�e�9gn�
���ڀ@�2w�[.o�<IƹyA=�q�}��ÃJ���W(7��V�-
������
�N�Ջ��~Zy9�7��c���r�{m���Gws{�6�/���5z��
�Wc���#.��!�<�ߧ��Y6�e���ſ���6����f0ެ
��G�k�E�i�6�B7����~���2�~3�|R��OA�	�;'ZŏZ�*&��yA�9_�2ɲr�Q����g�[��t����y�������2S����:��~��wI��$���\�,����O�
-endstream
-endobj
-13914 0 obj <<
-/Type /Page
-/Contents 13915 0 R
-/Resources 13913 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 13665 0 R
-/Annots [ 13831 0 R 13832 0 R 13833 0 R 13834 0 R 13835 0 R 13836 0 R 13837 0 R 13838 0 R 13839 0 R 13868 0 R 13869 0 R 13870 0 R 13871 0 R 13872 0 R 13873 0 R 13874 0 R 13875 0 R 13876 0 R 13877 0 R 13878 0 R 13879 0 R 13880 0 R 13881 0 R 13882 0 R 13883 0 R 13884 0 R 13885 0 R 13886 0 R 13887 0 R 13888 0 R 13889 0 R 13890 0 R 13891 0 R 13892 0 R 13893 0 R 13894 0 R 13895 0 R 13896 0 R 13897 0 R 13898 0 R 13899 0 R 13900 0 R 13901 0 R 13902 0 R 13903 0 R 13904 0 R 13905 0 R 13906 0 R 13 [...]
->> endobj
-13831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 686.173 187.264 697.077]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac088d51ee5a9963244f0816e1558c80b) >>
->> endobj
-13832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 686.173 293.213 697.077]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 686.173 371.148 697.077]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 686.173 455.727 697.077]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 674.217 220.058 685.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-13836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 639.615 186.348 650.519]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab73df10027395d3b2c9fbd3f3e77944e) >>
->> endobj
-13837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 639.615 293.772 650.519]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 639.615 373.367 650.519]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 639.615 456.837 650.519]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 593.057 186.348 603.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0477081337723b88cfe4e8a6e8f2929d) >>
->> endobj
-13869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 593.057 293.772 603.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 593.057 373.367 603.961]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 593.057 456.837 603.961]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-13872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 581.102 218.404 592.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-13873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 546.499 180.496 557.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a888509fe116790d0b9a267e614be10ec) >>
->> endobj
-13874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 546.499 319.255 557.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 522.856 213.153 533.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a78e60691cfc6b6b52a34cc7952380a84) >>
->> endobj
-13876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 522.856 351.912 533.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 488.626 161.677 499.157]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a41d30675a3c28980af0f087b06a1f4c1) >>
->> endobj
-13878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 427.637 205.752 438.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_affd7d0678df82882b006ea7b02771f98) >>
->> endobj
-13879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 427.637 276.595 438.167]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-13880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 403.993 236.745 414.523]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac6434b8a020aeda5828830fd4b639277) >>
->> endobj
-13881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 403.993 307.588 414.523]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-13882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 379.976 212.377 390.88]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad3a8f10409a9fd73afb6691686d6862c) >>
->> endobj
-13883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 379.976 289.846 390.88]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-13884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 356.332 243.37 367.236]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a201ee4c814267695f31b30be833917bf) >>
->> endobj
-13885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 356.332 320.839 367.236]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-13886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 332.688 216.252 343.592]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1d52cb88936eb0f5bde559b39f8ec42c) >>
->> endobj
-13887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 332.688 328.042 343.592]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 309.044 247.246 319.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afaf0bc4f0e0a036dbc3852b3e4490243) >>
->> endobj
-13889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 309.044 359.035 319.948]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 285.401 254.827 296.305]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aea7119974f9313e4c93908a2955c4186) >>
->> endobj
-13891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.643 285.401 343.096 296.305]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-13892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 261.757 209.627 272.661]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0c2c96efcf10102068f754c608a12427) >>
->> endobj
-13893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 261.757 314.791 272.661]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 238.113 240.62 249.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3a031a8e65176b8bd80d2857bd9a68b6) >>
->> endobj
-13895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 238.113 345.785 249.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 214.47 248.202 225.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aafc9294d3fb5f2c0fd8d4e4d22c283b6) >>
->> endobj
-13897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.018 214.47 329.845 225.374]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-13898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 191.199 193.577 201.73]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7ea45b608af772cd69e2c23d7d62a3cf) >>
->> endobj
-13899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 191.199 232.581 201.73]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 178.331 248.845 188.236]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-13901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 156.597 193.577 167.127]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac238f59379434b7fbfd7dccd74be1cd6) >>
->> endobj
-13902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 156.597 277.691 167.127]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-13903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 143.728 247.177 153.634]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-13904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 121.621 223.465 132.525]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a676b331ee61606b74be4cd1f90756839) >>
->> endobj
-13905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 121.621 362.223 132.525]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 97.977 229.552 108.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0ea21bf85aa2e90c449435cfedcef181) >>
->> endobj
-13907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 97.977 368.311 108.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 74.333 266.673 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adb0fa15c5f30fc4be6a94ce2606208ef) >>
->> endobj
-13909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.01 74.333 405.431 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13912 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-13916 0 obj <<
-/D [13914 0 R /XYZ 89 770.89 null]
->> endobj
-13917 0 obj <<
-/D [13914 0 R /XYZ 90 503.387 null]
->> endobj
-13913 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14010 0 obj <<
-/Length 3347      
-/Filter /FlateDecode
->>
-stream
-x��\ms���_�ɇ+5��J7Mg�\ҹ�.u�N3IFCI��V"�����]�@J>1�s��"A�b���
 b�����.�zu��+�9I�z�յ#��{	J����K0��lN0���`7̶��rF��n
n�u.^��,�
^�0
�8�l
o��~��ٌn
-?�ُW_?���A�3�%vJz�M:<�ɪ�K��lNv_Rs���-gHJQ��^k�_l�<׽]�$u��n�z͙3�#�Μ$��o����r`Q���8^�%g��}����O�b��������^|�#v�p�k#&�l�u8e�㼻��63��_ΜdN ��x9
�K�$f�>���&)�E�� #i�bp��b�cV	�Zq��jT�ƹnԡO
-H�(L4��nb�K�]��d���V� q�LƊ߰��uD`x�U�n|��5�U��틨@��T�F��*Ͳ��(ߥ�:Nn��[�
%E�fsF���Z����T+���\`�1�iF��އ�Bk�&��(\͈po��k�߰�[4���&�G��S�������ͧ�^x��^�}d�3 ��Qlx�2-�Y����0��>�#� ,ɫ��:��VZ>J
��[���c��tG����@���|?��w%V�k�L�@vc��m�J_��3*\��'��4�~w��X�U���x�JC,P\�p��g�3�<i�ߕ
E
HoN �; <4�7�q�%46�vٌ
7}o�"�L��8��Lv����,W���+H������,��
f�<IƐJ V�sDu�Z���R]"A��h-@�7Q�/�J��`?�f���8\n���)!L1v`�
1���8��l���]������g�2���v�_�Q=�U
P�(�0.�/J��,2�Z�7��~t���t'a�f�
���
�v��Rp�4O5O�&�3c��g�L�yB��yb��F
+��#�MX��
�vA�T
y��
�z�j�>E{�
�vW�� �ܭ��z��4ƨ�[����w-
>�c�@*j!CS
u"
�=�
q�����agB����|�b��d��|��Q�o
��f�j�
��)�'��бO�B1��.�^X�L5<Ș�2&�1 S4��j�2��1 �X�p�?>Q<��P�fD�D�d�Ix�����y1V8
-k�M+�*�&ӏ��Z)�[�hk�v
k��8��&�
�� 	�a�C�k
�Y �?`��󊀻7Qe�&�D��5�s�M���0k��o�M�/�=l����Km�
-ʠ�����I
�
D�<�GO
-R1<�1H���r1FdK�]��[���������}\�jN��LT�P0�ȃ�
���D��@�K�=� �&���o�^{�<���ɻ���
-+9�
N���LR$�
�lp�����r8ٴB3���n
	a�#����Q��
��$�$d��<@D��"�/�"%F$�u���Gvh6}Q���S�� ����V9�Q��w������-�Q��%uӡ�K
-Au��3���h��e�d���
�Y�4�Y� *�^^�<2<��<
/��5U
hj@=�A�s��H9e�`�=
E�S�F0�
�P���CMR���=T?zW�P~0ժ���UkL^>�:*�
4��Z�hGU�Q�Q���c��4!����\��"�9*�����%� �X�3�y���ť@<9�S6O�6`���TQ_6���O�aa�Ɋݪ�
�� b⪋�3+v��
�{�r��6�^��Ǽ���^��(k�t��rY)�ͧ��`�҃	�jٸ[�)���!�y?&�F��
�Q&3J.��
4
������#|D�݁:���$9�?�@��.Y���N�[���+1!��9��(��yH�U�)xX�>.,V
0�O"y�l�p
�'O!� �� �/)1����D&�$1�ʆ�+�*fbv�ľ����/t��x̘��q)�T?_�V�So�VC���x,o6���8��
�1;�	�|

�>J:��@�3�w����g�t���EU
�c���Q�T��m��^�q���
���ݏ��C�%&&[�A/�g�Klxi"8m3�
-#��	�_�`fi�
[���ƴt�
���Nكx�N�e��д��5�.l5$��kG�s8e
��Y�ӕ��{��;�z�[kh5��[��D>�ϩz�U��jg@��{�D��,fy�6j�~h
��<N �
�}Poq�<�]�4$y��=e9�>�j��)
e
ꅳ�Y��)��섐>��%*�#����K������BL�����j_�`�&7S�#{�
��&7Z.��hr�y�T�^BSw|�{&��{"G�;9ȓ�
-�,�\�6}a�9Fu�A	�M�^MpPs���"A��_�S�
0
�)r��R�/�C�D
pw�����e"�A�;�JRF�<R��hV��C�A�|J�|&�T�uNU�^�M���@(1���F��h���4��4
�	
/��>���#?�l����Dޜ9~Fd�0)��]Y� �
)G�
-���Mj#�.ݤ7�*�,V�4�g�l��Z� �|�).j�j�e|��lN���E3��q�
-$������*�ySp��9�*5�D�E>2�Ay��1`3h��tD��%�/v�}���קj˜�
�,}"G�z�N���pml�F?�f�S 
A7�e��p�d�複7�t��S��I�,�(M�&��4V�p�b,���6:ϊ���>�n�e�i7�K}��w�/�������~u��%��`o9
@D���̓Q��消�ܖ�@@�
�>[�6KCy�πVTufE_��0�U���0a�r�x�ue���3�k#F��N�:�0Y�\
�Ԭ�r�v�gp�P[P`Hj7ʡ��N�]լS��U�����3S�[��w��B��V��Z�/�ӶBuO�a��:=�
�l�X�=��;F��Vi�6*
Wv��=��7�S������.\��5D|�*��H��
��&a��A��r���R�
h�����y3���y at H�. |1
-���7�vY��W�pS� ��&4��&]��=������yr00�hU��λRz#`z�DP�$1��	��E9g�f��Hj�������E�l�o����ܦ���K$[��8�8.)��:�֥�Fe�t�fZJ#��oeH�B~��>���]K�� ����2I�)c�A��e�"{h>�~�?���[v�|D�,	y�.���4xUM���k}�m
e�	@�
-%�}�r��ݩɈ�@�k�Я�jͿf��Nu�w]��B��|@�(v/�?_�o�(�A���3��D��2\W�M33�8�������UrT{�=H[�$@�?]`��ڿ�Z��ˇՋ���W[�LA��w��,�
-endstream
-endobj
-14009 0 obj <<
-/Type /Page
-/Contents 14010 0 R
-/Resources 14008 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14015 0 R
-/Annots [ 13910 0 R 13911 0 R 13938 0 R 13939 0 R 13940 0 R 13941 0 R 13942 0 R 13943 0 R 13944 0 R 13945 0 R 13946 0 R 13947 0 R 13948 0 R 13949 0 R 13950 0 R 13951 0 R 13952 0 R 13953 0 R 13954 0 R 13955 0 R 13956 0 R 13957 0 R 13958 0 R 13959 0 R 13960 0 R 13961 0 R 13962 0 R 13963 0 R 13964 0 R 13965 0 R 13966 0 R 13967 0 R 13968 0 R 13969 0 R 13970 0 R 13971 0 R 13972 0 R 13973 0 R 13974 0 R 13975 0 R 13976 0 R 13977 0 R 14012 0 R 13978 0 R 13979 0 R 13980 0 R 13981 0 R 13982 0 R 13 [...]
->> endobj
-13910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 685.937 217.109 696.841]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a15b21e990e26976e615a7d3244ed843e) >>
->> endobj
-13911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 685.937 355.867 696.841]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 661.823 198.26 672.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8b2ee24610cb804238f33581093948c1) >>
->> endobj
-13939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 661.823 236.665 672.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 661.823 353.317 672.727]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 650.241 246.458 660.771]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-13942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.306 637.137 269.939 647.042]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-13943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 614.794 212.768 625.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7999968db9fb568980215d2c84393358) >>
->> endobj
-13944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 614.794 252.959 625.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 614.794 375.145 625.698]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 603.212 286 613.743]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-13947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.401 590.108 277.928 600.014]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-13948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 567.765 250.099 578.669]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abb5709426ac80aa0bcf907b4f1d4a577) >>
->> endobj
-13949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 567.765 289.446 578.669]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 567.765 379.512 578.669]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-13951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 567.765 513.996 578.669]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 555.81 416.369 566.714]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-13953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.304 541.871 439.335 554.036]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.591 532.121 459.505 542.026]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-13955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 520.737 261.881 531.641]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac7b41dba5d22086cb9715c3f51248f98) >>
->> endobj
-13956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 520.737 300.286 531.641]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 520.737 388.504 531.641]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-13958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 520.737 520.199 531.641]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 508.782 416.369 519.685]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-13960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.87 494.842 449.708 507.007]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.37 485.092 462.285 494.998]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-13962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 473.708 250.748 484.612]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a97cc0d02a88d52e79cbb6615a3bbab42) >>
->> endobj
-13963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 473.708 357.317 484.612]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 473.708 456.145 484.612]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-13965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 461.753 202.344 472.657]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.005 449.023 446.071 459.979]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.547 438.064 438.461 447.969]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-13968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 426.679 261.881 437.583]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2c47f2f619b1d0f322b742891920735f) >>
->> endobj
-13969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 426.679 365.272 437.583]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 426.679 460.793 437.583]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-13971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 414.724 202.344 425.628]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.222 401.994 466.67 412.95]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-13973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.37 391.035 462.285 400.94]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-13974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 379.651 239.984 390.555]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae274e65fc3f012ab21bcffa3177228c5) >>
->> endobj
-13975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 379.651 280.82 390.555]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 379.651 405.104 390.555]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 379.651 513.996 390.555]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-14012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 367.696 171.361 378.6]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 367.696 478.077 378.6]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-13979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 353.756 432.092 366.914]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-13980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 331.419 251.209 342.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a732e7355673aa63a2fc22a470a36f707) >>
->> endobj
-13981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 331.419 290.549 342.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-13982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 331.419 409.969 342.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 331.419 513.996 342.323]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-14013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 319.464 171.361 330.368]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-13984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 319.464 478.077 330.368]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-13985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 305.525 456.992 318.683]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-13986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 283.188 224.57 294.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a77a2a8e38120a21ac0d5f19eb6e1668b) >>
->> endobj
-13987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 283.188 363.329 294.092]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.521 270.458 345.848 280.363]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-13989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.442 270.458 508.769 280.363]
-/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
->> endobj
-13990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 259.073 255.564 269.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a940db627ef73d29e63fed31acc7553f7) >>
->> endobj
-13991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 232.966 214.06 243.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a99247c74022e8d51cd0a2d93a87bcfe5) >>
->> endobj
-13992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.398 232.966 352.819 243.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-13993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 208.852 273.129 219.756]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae8be1647844c9837446b9c735f11672b) >>
->> endobj
-13994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 208.852 352.41 219.756]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 208.852 495.961 219.756]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-13996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 184.737 275.007 195.641]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a640fe823a102e14522990200193c6701) >>
->> endobj
-13997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 184.737 362.877 195.641]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-13998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 184.737 472.148 195.641]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-13999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 172.782 233.986 183.686]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-14000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 98.448 289.866 109.352]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2f90e70dbef264e99b7015c0ce7e16fd) >>
->> endobj
-14001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 98.448 359.324 109.352]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 290.971 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a19a2fb28254bc142e01f3ee00c27ea89) >>
->> endobj
-14003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 74.333 360.43 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14007 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14011 0 obj <<
-/D [14009 0 R /XYZ 89 770.89 null]
->> endobj
-14014 0 obj <<
-/D [14009 0 R /XYZ 90 274.443 null]
->> endobj
-14008 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F66 3179 0 R /F42 531 0 R /F67 3037 0 R /F38 3426 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14064 0 obj <<
-/Length 2218      
-/Filter /FlateDecode
->>
-stream
-x��ZYo��~�� ��J at 4��AP�7�/�Ս}o�B�ȱE�[I*�g�I���E��&gΜ�;
��G��������k>�
����
����_��af������
���
�%n������~���Ϯ������#lI�F�g��Շ߱���
�L�3�bQjXԄ�ĸ���
-+^ƿ�7�4<�ͱ8o�ˆ¥K"D2�mU���Bpo-ň�V�n*�
��ȡ�Y��9�g����xVA��e�,��<���A�9S����,]1��^��a�yƲZ-��т���XX�e�	x����\�8�g����e��T��\\���ڃM�X����8Rϸ��Ge��b�d9
��e�oTU���i�U��aeU'v�%�:�d�|ϢMȢ�m��E���b���I'��~�"�" ����*o�r]{�����ot
7>bL�9���
�sӝ��@/�jV1+L�5�%��A����
�u�G��sL�OZ��^��^Ǖ�+��mv��_uVg�J�^>O@
�
�md
�ȷ}y��o�b��>���&r��2
!b#�;n�!c#�=�
-������/n$�����	��
-� ���
��3L�8WN��d�fQ)���'B�P�.U1m_"�K�朓O�l)�e�ö���ڂ2V	��wL��&ǁ�s�����d�I2BӪ`ạ��1~?�s˞��h�����b�;2�:~\�r����t��w��$��v�\�L�*-Å�H^
CM�e�ŭI�I��2o�����P@�IT$7nc�-���1���&����
	�̓`.G������tܯ �X�"��&�.&|��,��X�	 ��Hu먋,�o�V�ާ� �k�w�,H�|�ʗ7�,�[Ygxp�g|Ӟ1 8�0�����d�#iP��^�y��T<��S��@v�ry��AQ� e�;½�#���0T	��&��Ꮞk���)���gz�<�	
����>���06�4��*��-
��([�1�
|#�bPߚ���'[���	�"f��Hת4�G�T~P���IWZ��v��'��>W�A���<���a
�$�+��gP��XU�S�@N��%��	.�u�:cc�d�g��%y�
p
�	�mW� [...]
	^T��O��kXo�a���x>r�wI�%�(_8Bo��\m�c]~���?��
��� �v� �mC2/X�AJ����j��8�_�Z
��=1��j��X���dJh'y

�X�Ot��,g��n��3�#�
G���{�jNRE������?�������O~g�;�4�������5}!�/�q3'�q�ͺ�����6F6T�7��]�Ap�����D�Y�)3m'�}�C��N7B��6aȪ�a���
- %���C�TZ�`y�%�CKWn�j���4OĎ��<�R���nY��c���V�u�,��8[�vj��!�1ް��(;�
�W;�-��D2�
�ᦈ���ס	�
L���H���g4���լ��!6~�a� 
x��(^�
�/���<w�CMy�5-�A�a��Y�:���0�ؗ0�`��3U L�X�j���h���i
�bb�z
-s�/�zDm.����O��\
��D��Y5���f5wgI�g;c�k���Ь����Ā�wOع��?un}��_Sg�gC��4d����>���8ݤ�f�����PD�Q�嬡�H���M{`�[�*>�YX
L [��-o���-�u"�0�-9nԷyę^�g�M��5�(9�>��y҄!P@
�
����s�.?{9*��;6�"��S�c�m�\d���?�O1qE�����f��q�.5��9��-�ޢ#(��s�6� 

��
r{����O�ʯyU��̓l��P<��Ge�	<�}#U%���e�>���?
�]��������j���#
-e�4t�^+q부�м!���p3
�����
-endstream
-endobj
-14063 0 obj <<
-/Type /Page
-/Contents 14064 0 R
-/Resources 14062 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14015 0 R
-/Annots [ 14004 0 R 14005 0 R 14006 0 R 14031 0 R 14032 0 R 14033 0 R 14034 0 R 14035 0 R 14036 0 R 14037 0 R 14038 0 R 14039 0 R 14040 0 R 14041 0 R 14042 0 R 14043 0 R 14044 0 R 14045 0 R 14046 0 R 14047 0 R 14048 0 R 14049 0 R 14050 0 R 14051 0 R 14052 0 R 14053 0 R 14054 0 R 14055 0 R 14056 0 R 14057 0 R 14058 0 R 14059 0 R 14061 0 R ]
->> endobj
-14004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 696.893 224.003 707.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac5ec610fb42e16beaac59b537a71f187) >>
->> endobj
-14005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 696.893 362.761 707.797]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.962 673.2 442.501 683.105]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-14031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 661.812 254.15 672.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af633b1416a118a2ac3146ec4a4fd4298) >>
->> endobj
-14032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 661.812 338.263 672.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 637.691 284.585 648.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adfe66b5a34b84fcf63d1a48777f68e4d) >>
->> endobj
-14034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 637.691 354.044 648.595]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 590.655 241.726 601.559]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9be620ae3a5afa0a9d5b89acfdae387a) >>
->> endobj
-14036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.617 577.921 407.658 587.826]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-14037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 566.534 249.318 577.437]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7a1f9b31c3ed7dc3e7691b9110ddbedb) >>
->> endobj
-14038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 566.534 288.321 577.437]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 566.534 371.519 577.437]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 542.412 240.62 553.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3cad64f36f7df128cc7637c9e0910bf1) >>
->> endobj
-14041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 542.412 324.734 553.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 542.412 389.5 553.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 479.005 244.265 489.909]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acbcc65a843515d547f055b687d1e6d5f) >>
->> endobj
-14044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 452.891 180.198 463.795]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1d1ef9ef2a29c5aafe1baa14d0e49f23) >>
->> endobj
-14045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 452.891 295.434 463.795]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 426.777 193.029 437.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a57fc3d9d838fd7e20e80806307452a91) >>
->> endobj
-14047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 400.663 193.029 411.567]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9a864135634ed49de1aeae3b38ed933a) >>
->> endobj
-14048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 374.549 165.911 385.453]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a885e896b320d1f4285b5dc92a20f8884) >>
->> endobj
-14049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 348.809 187.689 359.339]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a804363984fe210abe47624522dfb7a92) >>
->> endobj
-14050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.557 334.705 476.544 344.61]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9a864135634ed49de1aeae3b38ed933a) >>
->> endobj
-14051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 311.362 202.902 322.266]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 311.362 300.037 322.266]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adea57326388915780370a677453778b3) >>
->> endobj
-14053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 285.248 202.902 296.152]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 285.248 314.263 296.152]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8eb19423295d8af4d69f144fc227128f) >>
->> endobj
-14055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.819 259.508 199.864 270.038]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af191b9781c37da15b49810d47a838823) >>
->> endobj
-14056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 190.436 203.075 201.34]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 190.436 296.324 201.34]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4a53183970490595ac39c8c070601c6f) >>
->> endobj
-14058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.944 119.64 200.017 130.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a343e039e48425126b187827066d12bf2) >>
->> endobj
-14059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.944 91.322 200.017 102.226]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4ac4e4131c756f0ffce85b9dec7d2b3a) >>
->> endobj
-14061 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14065 0 obj <<
-/D [14063 0 R /XYZ 89 770.89 null]
->> endobj
-14066 0 obj <<
-/D [14063 0 R /XYZ 90 496.092 null]
->> endobj
-14067 0 obj <<
-/D [14063 0 R /XYZ 90 469.99 null]
->> endobj
-14068 0 obj <<
-/D [14063 0 R /XYZ 90 442.15 null]
->> endobj
-14069 0 obj <<
-/D [14063 0 R /XYZ 90 416.036 null]
->> endobj
-14070 0 obj <<
-/D [14063 0 R /XYZ 90 389.922 null]
->> endobj
-14071 0 obj <<
-/D [14063 0 R /XYZ 90 363.808 null]
->> endobj
-14072 0 obj <<
-/D [14063 0 R /XYZ 90 326.735 null]
->> endobj
-14073 0 obj <<
-/D [14063 0 R /XYZ 90 300.621 null]
->> endobj
-14074 0 obj <<
-/D [14063 0 R /XYZ 90 209.556 null]
->> endobj
-14075 0 obj <<
-/D [14063 0 R /XYZ 90 209.556 null]
->> endobj
-14076 0 obj <<
-/D [14063 0 R /XYZ 90 136.847 null]
->> endobj
-14077 0 obj <<
-/D [14063 0 R /XYZ 90 136.847 null]
->> endobj
-14078 0 obj <<
-/D [14063 0 R /XYZ 90 108.793 null]
->> endobj
-14062 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F68 3032 0 R /F39 2320 0 R /F24 529 0 R /F67 3037 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14116 0 obj <<
-/Length 1680      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~���^2
�i^%2�l�2�k�����"Pl&1f[�$7��ߡDɒ,Ɏ�����D
����P����z?�{�K�9
-)�z���Q��=�%�x���|�Ƹ���Ep}�R��{=��뗳�(�6��vB2
����HO�=���\"�!�����/�����>CXqP']�y6���@��g\�g�
-ܿ�v0j�RJ����"�X��yǙ���h_/V� ��1g����'�!H	�=1ҷ:5L/'�<�%���Er���ޯ���
���!�{�@�t&�ޛwؙ��FLI�!��p8e�;w^���a)PV����qYո�zĆ��\��DO=���ҋ�8
_���d.�T�b
�;��ʢ��8�)E�b�����ʳΛ����&�lj���;k�(�e\<�� ��l~�Řwuif�[,0��,0�7iQ���ӔE9�pq��� Ò&=m��{�
"���L�.
-ꘙwƅ��`�3�b%�����u�e��Z'��#��%7a8�v�,ν��0��:Z�8�˳=�-�N���fUE2��O��fK��p9�d���Aζ.p�̰�� A
R!.`̔�`�S�D�sy��ǣ ����4�xH�x��8���fu��i�X�K�L��r/�
k��ְ�5��,�
o�'\S�
a�弜�IX��I��Z+�5�BT���v��A�hK�<̒��x�^]Z��vZ�]���݊4�Uǰ�C��)�e��F��i׾[
)��r�D���rB��jI�p�s���2�7�f��|Q��e%/���#�%{R�|H/L�~q�`cI�)
/��m�Q�-rZbW��!!�B�f����ZraQ�R��M�qsԠ
-�IZ���B">A>�,/N���a�D:X�μ�Y{qH�p�� �ߥ�J"V���
 
-I^�W�
��`?����ue�������H��M&X�F��+�W��*��f�H�a�Eg<�V�y5
g��N����_�����jmK�D*���!�)��7\)��[ڏ�q�K�H��O��D ���6h���K������Xv��*���n�
od��S8�
�U��f�=?�
Z�С3^�F
�U���"�X�c���Eڦ��A
�Y��M��X�n<�S�|
x�����H7�d�[�?�рQ������9~c�"=��.���a�dec�� ��d.�m�\H�=�V�@�H�z#k� ;�2'j����8�#
Sl��G��q����c�c 1����7B�G�wH#L_�X��F�! 0�ۇcE��������H�Uа�=��Y�0�;�~
���|)OHw$�q^ �w�HwA:��	H;�

-O�+W	�E:4V��|֍t�ҁ��m-�
Q����ߊ#�Н(�WE錭@榆֭')���R:06%v*��8���[b��KL~#%V=R���p��W�
��P
���}P�{�g��"�lɾ�6s?��	�<9TH*Y�]�
Җ�}����]#t[�
'�΀I���)u�R�
���~ 
�t��
��?9󠱡��O�ҏ˼r?"��������^f�b
}�
-�]�*XB��_�|0��Q\�Q'(�r��
�Zk���N>��|�(*�!x)Z��$Y��7�X/�t��Q�C!�9t��0>[��E`ޖ���܏�y4�8�}#
\��3���f���0�}���
����??��q
-endstream
-endobj
-14115 0 obj <<
-/Type /Page
-/Contents 14116 0 R
-/Resources 14114 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14015 0 R
-/Annots [ 14060 0 R 14086 0 R 14087 0 R 14088 0 R 14089 0 R 14090 0 R 14091 0 R 14092 0 R 14093 0 R 14094 0 R 14095 0 R 14096 0 R 14097 0 R 14098 0 R 14127 0 R 14099 0 R 14100 0 R 14101 0 R 14128 0 R 14102 0 R 14103 0 R 14104 0 R 14129 0 R 14105 0 R 14106 0 R 14107 0 R 14130 0 R 14108 0 R 14109 0 R 14110 0 R 14111 0 R 14112 0 R 14113 0 R ]
->> endobj
-14060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 685.264 211.703 696.168]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab3b8f7e6fdd123f510ba85f4527bdee3) >>
->> endobj
-14086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 657.331 203.414 668.235]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a269f357fca785afae3774b1e084d9b93) >>
->> endobj
-14087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 629.771 179.265 640.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a21a9e355a53ec45a5a60213fa8c24f2e) >>
->> endobj
-14088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.575 561.561 140.53 570.407]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a43ab45399b7e22ffcd6403b7e59a473c) >>
->> endobj
-14089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.575 533.627 140.53 542.474]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2d12805af932544a4fc1575f8db62a3d) >>
->> endobj
-14090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 505.693 167.639 514.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa2a8683afd33a1d57db43c9db16de1f5) >>
->> endobj
-14091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.064 394.509 229.749 405.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2f1209d77894eb265d41b923b74f9d9) >>
->> endobj
-14092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.784 394.509 444.205 405.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.933 342.665 156.299 353.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7982064b912c7e29608acf2e4c0a29b4) >>
->> endobj
-14094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.132 342.665 271.553 353.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.318 342.665 462.739 353.569]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.839 290.821 181.264 301.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8ff90cd506e2377d88aafe850f46ac5b) >>
->> endobj
-14097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.05 290.821 321.471 301.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.251 290.821 513.996 301.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 278.866 146.896 289.77]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.053 238.977 179.177 249.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6cd12c70f251a340295cb737ae2deace) >>
->> endobj
-14100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.391 238.977 319.812 249.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.251 238.977 513.996 249.881]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 227.022 146.896 237.926]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.839 187.133 181.264 198.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8ff90cd506e2377d88aafe850f46ac5b) >>
->> endobj
-14103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.05 187.133 321.471 198.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.251 187.133 513.996 198.037]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 175.178 146.896 186.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.053 150.252 179.177 161.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6cd12c70f251a340295cb737ae2deace) >>
->> endobj
-14106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.391 150.252 319.812 161.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.251 150.252 513.996 161.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 138.297 146.896 149.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.665 113.371 225.35 124.275]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2f1209d77894eb265d41b923b74f9d9) >>
->> endobj
-14109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.192 113.371 430.613 124.275]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.933 88.445 156.299 99.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7982064b912c7e29608acf2e4c0a29b4) >>
->> endobj
-14111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.132 88.445 271.553 99.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.318 88.445 462.739 99.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-14113 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14117 0 obj <<
-/D [14115 0 R /XYZ 89 770.89 null]
->> endobj
-14118 0 obj <<
-/D [14115 0 R /XYZ 90 704.277 null]
->> endobj
-14119 0 obj <<
-/D [14115 0 R /XYZ 90 704.277 null]
->> endobj
-14120 0 obj <<
-/D [14115 0 R /XYZ 90 674.61 null]
->> endobj
-14121 0 obj <<
-/D [14115 0 R /XYZ 90 646.676 null]
->> endobj
-14122 0 obj <<
-/D [14115 0 R /XYZ 90 578.516 null]
->> endobj
-14123 0 obj <<
-/D [14115 0 R /XYZ 90 578.516 null]
->> endobj
-14124 0 obj <<
-/D [14115 0 R /XYZ 90 548.849 null]
->> endobj
-14125 0 obj <<
-/D [14115 0 R /XYZ 90 520.915 null]
->> endobj
-14126 0 obj <<
-/D [14115 0 R /XYZ 90 452.755 null]
->> endobj
-14114 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14145 0 obj <<
-/Length 3325      
-/Filter /FlateDecode
->>
-stream
-x��ZYs��~ׯ`
R����� ޣj�^{w��*��<�[*��$dI�
���_��9 
8�hY�J��
==}|�=�hr7�&oN��:9��$%i�����$�&J�D�𶘼�
-��v���	�i
�t��_/�~��z�}'?\��qB�+�PC@�L櫓��E�4�<�O�Ƀ
����9yw�����&��,g@��RB��FD1BOg4��髼͊e�8�1��[3��u[T�f0�4͘ \��b���ˬ�q��kX�_�s"S�6���q���
h���V90���=��D���n�淁�$�‘�����TN�Y����LL�z��j�
J"�u��@��I��Sڮz�$�RSR�U��)g�jyJ�t{�/�	E>
�2
q�KqSg��,�n_��� ��ӶȖ��]���b�3�$��U>Oo��f���n
-�	z~�uSNX�Gڨ�.*X�
�x��w��g� ��d~����Hm���}�0��g��[����e�X�9���?����֪ۚ������fs���5���)�7��4m��r �;�H���X������eQ���»�	QQ
-$"��X��y��-�O�`��Uln6�uU��;|-ʦ�Jؼ�
���Mg7��.v/�UV����[c���9�J�N����o &4fnHV.t`�2�p��G��Ҭ�=���)�M��`H�X������mr
a�
6/�
-Ћ�;�NoQ	
J*�=������FqbIJ�Dq�f�
�TLD?���ص 
�g�d�7u�8�C�8D��y��Ue��~w��C�1I�'�7|�c�U�hY�Qt��F�Gy�~f�@�s6����P��G7�<���6" ���T�Bـ")��C>�'e�F�b�-6�|��pn��#��(�ȋmڧ�a�s�]>Sp�����C�k �/�}��B�*�7:
�b��}�(	�HzP,�t&����w3��HF�8�}u��G#L�ۅYAm��EK3
�1=b ��� NJH��$R�G�
lN����y���5�������SVbF�5/:��]���\�!�X�Q��tz��j�2�(RQ+�ة���a��t�<o���:�4��AEbfC�;��M�v01̉�r��*�h %L`NE��
BZ�	$
�1��|� Y�����1��.��d
-^\2eޜ�K4}(�{�<��y���2�h�ݔ&{�
 i�҇���m at V-�2K<�I�m#�\L�$y�v@�C�a�[�OfD��r�#c��`-�NR9|�� 4�����1�c���b��C�ih�
1Ə�q& B#��O�'5���̕�bZq���#�T`
�>
Œ�GS��«Rb>�R�oT��
�q�
ر�
}�e\|$��
��<� 
^.ꫂÊ��G���P�2�
-���8-�@������
��g��}֘U2K��@
f�宣%�8�e#a��|�?�B|�>{y�;�w)��3
�¹���6�I������zÝ1��<)��ޗ(� l%2��~>O��_ṏ
-у
-���`�7Q�4-Þ�%f�e s�RO՘�H9��!I�(�m-(?N%�ˆ/�Bk�p����c�X���Q�d���!��"��$��CC�����_`��{�&�f<���E
c
W�j���,
-¶M�c���k[����1�Ͳ��n��^/�x��G�n�yUc8�ʅ��]^Ghϳ����Ge��L
��V�*�%)�g
5��� ����˞/�K��'�lY��bk�@��Rś?�[����ʎ
��Lݍg���G˕�/W4���r:'�o�Y}*"
�Ҥs�,J����:�݀�1����K�K��i�z
����)��X���s��p9���"_��J'gX�
�
�s�>ݛ{$�
���G<}�ن9bH ���I�'�u
�`=+�4Y'�=]w����ѻw�ّC
G垳��{����K���
d��b¨�s�+L���pl��b
� ���a����n L wm^�!����T��ܔ���B�ֹ�Q�S,
-���v�MK�l���S��
_>ex�}'CPQM �"�CS�Z��~����b�4
�n톯�߱n�d�M��C�Aka��`���h��UQ�����4Ct�����(Xȍ�F�)S�?�i�������n�D���Kc�y���u0��G�Ia-���'#v���
��sgC>7���W��hӜu�
K�b~pe�[O���ܞ�����R	cp������f����	;�Wb�R|4��)~��olj~�K?�	�%��L.�
�@B��ݤ٫�0�
-`�� vհ_�
�\���a��mft�&��V��ׁ,<�.���*-����eөޜ��l�F��śp4�}�_��p�wp���L�)a�/h(7����e�y2H
���wu�43W ��=�a������X�v��jһ��-
l�	[p
dΞ��Fĩɬ
��j���2=]
-k��t�	�1��a�顽��6˅y�8��-�[�l��i��.,��)�K��OnEK�,��}�rpV�C�1j\RPo���$�
�U�ܻ�.��,
���rNx��Nr
,~D�й�_���
-I���>�T��Z�R}
-8�ءk�;  �T�Tyy'��43r�PMK�`�I��i�(ǩ)7�٬��=-ƣ��b��GJ�A8fRBc|
� 5H��;Q�w)|��619����l��q�P�D+�I�G4��.��e�„�Pw��
آ��=�b�9]�}�H�3i�y�����=*�Q?i��YN���V˥��
-��
�ܟ?̠���	
�)aO�ieT�	��N��
-�x�š�z�]
�He
T�D��A?�1������დ
��Tt��S����7�`G�b�h�{f�ЌM��[x��:�����߹��۹AN|��xy�ž
&�d[�\F�(H�a�D�u�� �h��U�.���oiu3,�Ɖ�O,�g���a���*����a�Y|f��mH���W�
 |9ϏtJ��1��fN/;*���"h����
-��e�׭
]�'3��ߘ����c{|k�������W|�fj�ٿ��q���k
4X��8
��X#�����Y`��k�~v�H���
-����\@Ď"��C>:��[���vq�ˣ}�x�
&�	���f����?�
�1#��c/�&
-Ed�o������wR�7x֝n�m8�i�'�* ֓��YOPߡ�M%�)H��l(�?;�W���/���p9��ު�oY�ѕ���.k��@ EC#&��VT���;��j�f��Pu�y߶���7��&/�䭻Io?9M��ڹ&�fV������j����_$B�;
-endstream
-endobj
-14144 0 obj <<
-/Type /Page
-/Contents 14145 0 R
-/Resources 14143 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14015 0 R
-/Annots [ 14135 0 R 14136 0 R 14137 0 R 14138 0 R 14139 0 R 14140 0 R 14141 0 R 14142 0 R ]
->> endobj
-14135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.859 590.588 257.582 601.492]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.021 590.588 347.699 601.492]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-14137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.138 590.588 378.041 601.492]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-14138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.352 398.771 304.232 409.675]
-/A << /S /GoTo /D (index_CC79) >>
->> endobj
-14139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.372 309.416 302.073 320.32]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1190fcf4794305386f8475f9ac51ce00) >>
->> endobj
-14140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.149 194.134 329.403 225.447]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-14141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.563 194.134 422.493 225.447]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-14142 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14146 0 obj <<
-/D [14144 0 R /XYZ 89 770.89 null]
->> endobj
-14147 0 obj <<
-/D [14144 0 R /XYZ 90 721.073 null]
->> endobj
-14148 0 obj <<
-/D [14144 0 R /XYZ 90 666.408 null]
->> endobj
-14143 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F60 532 0 R /F75 554 0 R /F7 795 0 R /F8 794 0 R /F24 529 0 R /F32 764 0 R /F10 765 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14152 0 obj <<
-/Length 2020      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�F~ׯ l+�x�
�������
���/n ���fK�*E5ѿ�3R$M˲ⴻ@_<Ԑs�\�s5�
�}5:z+Y��
-i\�
-2$HP\%���`$�dJ0���	��\ij�	��"��뤌g?�7e\n���Ug�fv���\'��rB�q?�ɇ���Һ�J��������}��	x�L�_��ד)x|J��� YΐR�>��#T�k�d�j�]M
��2�+m�S�$aL	AJw�B�j+����;�#�EX�䜘�������]
�^.����bt�	l�`�T|�-N�Yp9��{K�Wg9�HIYyH�pD	\o��cXC��+���Y߿3;��,�z�pG���O����)��=�%Y����|cu��������I2���*�4��ǟ<�o݊�sv�ܳw�ژǜm����y�x��\���)nM��0�fyVLlQ9�a�ǔr��]�)<j�'�ƬK̯Go�6!�P�S�\�k���"ˊ	�i~��E�_~L��?�i�7_%K��z'��6��a����8!�M��LX��

=�d'<P(L�*
:�_�F���ێރkK������5�g�]i8�vؒ���qqr�	bD �������"
�`�`V{z5�Pv��I�����>��l����� yQ
"�^~��\z�~͟������*�o�>$��Ξ<8�w�E��� ���9��JQ�UY���~c��/J�r˩�n���B�Ul<dG�1X�Pø�܆���jU���YJҨW�w�H��j��y�0!%$P����Mi
��K���PO��~��g��_<١L]EO!�rº�!�
Bd[�)
8�!�v/����A�Y�h��~`��%:>
�
�mӴ�l]�!�@��L$�E�($)@s����rɎ'`�@֎�s��z�]"� )e ��d��i�HE�i�l{Խ�4BKK��DZI�2�EmEB���N�% 
5�z=�&�68>�w:�%x��,�ƛ�h*��jp�[�']Y��F7�~���..�l*���Q˦d@`0
ݶ��i����0@�KQҗ[t�
AH5����k�i����Љ`�Zg�99
���a��u�%�Z�s�7��/\�c��4PUWG�����`Lu�6�e���z��Q�a�T,��IT���[�*3 ��`�4L��[�Ҽ�O����
�h`x�"�e)BzS�̺�*(
��Z�U��3$@R�r-֋���D!��	&-�v���������ڭ�!Y)*;�6�90}�K��[�v�Ok���"��'��x�_A]���0_�i��n�	9\�G�D%���r�|q��!�-�wK��$>9���J閴b�>��<F���f䲉y
a�5 ţ)v�:OM��V�<�j��1��[����ӭ
-����7&C���^P<X�#H�\�$�8�
����f.ǐ�d= ��e��e���=�5̑��se������I:�$
jjq 
��OҜk����bQ)up�D"������:۬���8��]u?�e9��8�N�SH�f/*!���}��$��D�����+��}��I>��C���:�4����{�D���RY���uI��E�)]@K�P=تk�V"ln{*�0eG���q? �ֶ/�[�Csw��+�Qw4@��h@�р�ݿ���t���рD`�'f|��@k0��I�T���c�@�#yb4���d�GrXn�1����h �*�����
s�}��Hu��7͈vv�Y����h�����P�
A�kę߭���鋶���^�o:�=�]
-��Ŏn�U}q<~]O���~��🭜>;}�v"�Z^3#$ƣE�Y�Vxi�bZ�
4���#=���6cݖ�_�@u,!��/�:�Y��>���zr����
~^���c/ؿ�|
���0��p#Av��&Sھ��4�1�[P?���wdˊ�:���羪��GG7�Th^,
��%���
�go�|Q��6l.�,�ӳ&�a(Z �^���!5`Ⱦ�~�~�/�~��
N
P�6��
�f
-endstream
-endobj
-14151 0 obj <<
-/Type /Page
-/Contents 14152 0 R
-/Resources 14150 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14015 0 R
-/Annots [ 14149 0 R ]
->> endobj
-14149 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14153 0 obj <<
-/D [14151 0 R /XYZ 89 770.89 null]
->> endobj
-14154 0 obj <<
-/D [14151 0 R /XYZ 90 434.378 null]
->> endobj
-13776 0 obj <<
-/D [14151 0 R /XYZ 90 410.919 null]
->> endobj
-14155 0 obj <<
-/D [14151 0 R /XYZ 90 410.919 null]
->> endobj
-14156 0 obj <<
-/D [14151 0 R /XYZ 90 316.462 null]
->> endobj
-14157 0 obj <<
-/D [14151 0 R /XYZ 90 238.464 null]
->> endobj
-13777 0 obj <<
-/D [14151 0 R /XYZ 90 201.535 null]
->> endobj
-14158 0 obj <<
-/D [14151 0 R /XYZ 90 197.052 null]
->> endobj
-14150 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F90 758 0 R /F60 532 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14162 0 obj <<
-/Length 1761      
-/Filter /FlateDecode
->>
-stream
-x��Z[��6~�W����X��,�Ӈ4i'i�n��)�a����1�	��G��k`��4��Iƒ>�#�ۇ��;;�
�O?+�h�%������Q\#!���y?䜎�'�
&=D��Y��~;y�vre�/'�]�!@ �9�h��;sx����i����
N�
�j�� g�-��<�&�0K	=�0�"
in��
Q>�c?
-� 
2ܤr=@n]�a��4}4�
��9��D-�U0��H;RK$�8�
-�	�B4`�nW�p���aM�~��
޷UDRx�QY=u"%�T���#�
-<��6I��խmg��]�
��`c_$+��d���:^}
-#?	�Y�.���0
	1D��D"�Aݽ�a ����G<�=%X �=���f�:	W�#~���#����/�-�
�z!��#�
s В&��W�L��(\��a_fI~�%�ٳ�$��x,��i�#.�����S̑���� ��M�HuH�Z��X#��N��Ո��ǥu��֨yOT&²L�<�-��t
F�r�mc

^�|x0"b6
�7� �`�Yd�
+H
o6k�
,V;j�A�X�~? HIz��.���A' ŕ=xVs�c8� Z/ ���#�2U)$����vD
\!ŋ�n
,�����z����>�?�Զ-���]�(DB#E�ԏ�i��2^)�刀%ő?����bw�c�&���x7
g��m�śK�@�	��,"E��
��Y0�^B��
W�#i��#`���f������9���
��f

zC�'���q˾�ycW�����M�`�S�

ܲ�Jsz^�5��ʖ
a!RU��]���
q�4>���UUM)�@�IK�J��x.�2�n�
-yس�0;�
-���z��亖���%P/P8�qDp��o�E

�J1�q��3f&l�f �]m�j.�� �K��F)��b���>�ä�ۂn}�bh�hU0T/bja���.FHLF�x���pz�U��c�i��5u8�Q���lE``
L��V���JVjbX
�Xi��
�u�/R��M6�BV�)Y1#sܒ��
��$8���$1D�m�ώ�]�@�N�XT:g^���d
��]���{��4
"�^��~>�iL�
�w�d�*O�^��'���A��^�T�م*q�U��T�O
s��P�L�T��J���~G`�,��:ẈT����RΔ�7�t�)���RI&,Qb4#J��#J����)񒮥L�咚�e��,ѓRaMP~��2�Ϛ\��{�z�J�<�r���V���h�Ι4��8�z,g�����v�dLٮ7�xZƔ-�dL����u�Ed�i�D5���F
-�a�<F�nu�1u��2��8v������9_ݽ�a �a�
�|��X
5����~�
-�鵰��:!��/z�ߩ@v!-�C��3i�SÜ�4T<���4�*I��{�� �
�<ݷ�`
%-�P�������Z>���
ڒ�ų�zm!Bt�-%�9��0v�*v
-W�_0r��W�(Ia�H�˔@�|�`���7[1ߌ�G?�O;]���ʞZ	L
-�>��
1�������JW��pN�S�JG1Z�JM�/�����~�0��f}�وY[�ڄB��
��i��W����� �b(�h�Y}N;�9ً�Ws^� ��s�-s���v$�7��R��uӹ�|c�����3s��_n��}6��[��
na�E��e�)�� �:V��
�
��"�0�f��}���7ۻ
�4[EsC9Y
TE�r��Bs���<H�K0��̀�d��
_
-endstream
-endobj
-14161 0 obj <<
-/Type /Page
-/Contents 14162 0 R
-/Resources 14160 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14015 0 R
-/Annots [ 14159 0 R ]
->> endobj
-14159 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14163 0 obj <<
-/D [14161 0 R /XYZ 89 770.89 null]
->> endobj
-14164 0 obj <<
-/D [14161 0 R /XYZ 90 720.814 null]
->> endobj
-14165 0 obj <<
-/D [14161 0 R /XYZ 90 667.125 null]
->> endobj
-13778 0 obj <<
-/D [14161 0 R /XYZ 90 632.455 null]
->> endobj
-14166 0 obj <<
-/D [14161 0 R /XYZ 90 627.972 null]
->> endobj
-14167 0 obj <<
-/D [14161 0 R /XYZ 90 527.661 null]
->> endobj
-14168 0 obj <<
-/D [14161 0 R /XYZ 90 462.017 null]
->> endobj
-13779 0 obj <<
-/D [14161 0 R /XYZ 90 427.347 null]
->> endobj
-14169 0 obj <<
-/D [14161 0 R /XYZ 90 422.864 null]
->> endobj
-14170 0 obj <<
-/D [14161 0 R /XYZ 90 322.553 null]
->> endobj
-14171 0 obj <<
-/D [14161 0 R /XYZ 90 268.864 null]
->> endobj
-13780 0 obj <<
-/D [14161 0 R /XYZ 90 234.194 null]
->> endobj
-14172 0 obj <<
-/D [14161 0 R /XYZ 90 229.711 null]
->> endobj
-14173 0 obj <<
-/D [14161 0 R /XYZ 90 129.401 null]
->> endobj
-14160 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14177 0 obj <<
-/Length 2069      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ�SK�z��h
4NR$MR7Q�I`�m��n��!wy��,������rvf��9>{�
�~�=
�N^(�d$����3�S� A�7�x}�������}��Q4]��)����i0�F���hݞ��I8��n/���q0�8��D�K�H����N^R��*���N6�OvHM'Ё2��xF��T`�u'�Z�r���;�l�ZL{6ű�6����l��kހ1���ހd��o�
��̰`1��8�
��䜥�{χ�/=w�G2�r��������؛��W
F�h�k6h�q��8�����a�R�Q����~ ��J�1�aHc���o�`���E�)�&rm
-;C:���X6�V�ɼ�fAE�}�D�Oj�8��i�Q�	iH%p$M��k��}�'[Q�]U�إ��$��Qp�.M�LNOg��:�^Q���_Fv�6��
��ui
��M��H��>Y�
��iͼ�4Z���.`oQ�W��L{�Fcw:	��"����۳��B���|��c;��,
-Q*����$nL=}
�7s{�*L��P@������|Ai�}�3��#0�q��)1��ȣdn�O�tx�pS�/�"�rLR������T7EM�B���U�ͳE4�5ң�����Cj�-ukv!�H�J/��v����F�@��z޹cZ�v��欺�6�f�p'mv3
�i������1�2�߱b�+N1�(��',p���ǐᒖ!�2^�?�-A6ѢeXaV�?�PU��
���OZf
0)��8Q[³%`<�&���h� �BD�]�F��-�˟�|K����������o�_?����C��� �Dő�-�D�B�c�����s�4� 6�㞴H�HpV
-��f�8L>׊�F0��K#�LFk��ӛp6q���
VQW^E�y���V��k�q@Ҩ��r�����ɵ �d.��u����!K@��&(�d��n�T��mv���d:w��.� ������2pK�[���u��ғ�ī`
~�<Cl2cŠ���5�"�y
��6�&
-��*�������5�k$���P،TCøM}Tn�~M�fHjY�u��I}��X����4V ,{��<
���xa,�����6��E�h�[��a��
J� )�� ��⦪gz.���m�$��8pZ��RͯC�fC�oă���	z� ���>��!�&i�D�
=Im�}:Q��
}�D��UQ��.E��`om�
p�b[:
 ��- XJF����+")�<R�:4���JM��:�
Ȗ�x鞏V ^(͡��'�M8Zt調�D��6"W�f;�V�-�����dA�(
-[��jU2�;Qv�F� �jT�l�`��3r�k8�ٳ,}V�W��`r7|
j�f0�D
`��:X�~��V�3�9�ġ�&���q�Af��8'od��SE��	����:�/��
F;��gީ� �~��؛w:x�6��!eu�%s'���"�9�
y������_�Nj?ک��۷w� m�\�V�i� �X5�v
-je
-��y��<�Ω'!=�xr�
,�#���==rO�=���=Q������:���*4-m�{�PPa�ណT�����P���m��y;�V�-���f���ޓ|�b��OG����J�>
n�f<��Ȏ?��D�����(T�X���'hƑҼ�V�
df�~rx��SE��S�SRr�WO
ڗ�O
��j�=�O
���U۸R�\�N��Q2w�O��2�Ϟ�}�O�X�IҌa����ny�N?IP{���3�TNq��_�
�1q����&������~bb��J?$��u�~�[�'Qm�E�E*�]�9�B�uԗ�������K�n�tR�~�t

]'��.QyѺ�`�P��
-6��;����?�U�QQv�����yNJ��c��0�Qܟ���'�A�c_ߙ�f����>ݞ��(���NS�9ϼ��U�/?���y�T��'3M�������u
5�-���
P
��)^A��)3_FA�pZ�"��'���|�4�8�
�:
��FTϳ�������9�-��e��s��y
-endstream
-endobj
-14176 0 obj <<
-/Type /Page
-/Contents 14177 0 R
-/Resources 14175 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14187 0 R
-/Annots [ 14174 0 R ]
->> endobj
-14174 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14178 0 obj <<
-/D [14176 0 R /XYZ 89 770.89 null]
->> endobj
-14179 0 obj <<
-/D [14176 0 R /XYZ 90 718.682 null]
->> endobj
-13781 0 obj <<
-/D [14176 0 R /XYZ 90 672.057 null]
->> endobj
-14180 0 obj <<
-/D [14176 0 R /XYZ 90 667.574 null]
->> endobj
-14181 0 obj <<
-/D [14176 0 R /XYZ 90 543.353 null]
->> endobj
-14182 0 obj <<
-/D [14176 0 R /XYZ 90 477.31 null]
->> endobj
-13782 0 obj <<
-/D [14176 0 R /XYZ 90 430.685 null]
->> endobj
-14183 0 obj <<
-/D [14176 0 R /XYZ 90 426.202 null]
->> endobj
-14184 0 obj <<
-/D [14176 0 R /XYZ 90 301.981 null]
->> endobj
-14185 0 obj <<
-/D [14176 0 R /XYZ 90 235.938 null]
->> endobj
-13783 0 obj <<
-/D [14176 0 R /XYZ 90 187.906 null]
->> endobj
-14186 0 obj <<
-/D [14176 0 R /XYZ 90 183.423 null]
->> endobj
-14175 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14191 0 obj <<
-/Length 2016      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ�S+�z��h�G��9�X��A[�-TW(:��}�\�"�h�k7���pf��9>
W��
�z{�+d$���208P� !�n
|�s�_F�&5"F�[�����F��F��\�x���#0�b�tp1�}���1<~
`�g�f�
����W纔WDE:L/�� s��6c
(�V����0gQ�B��L�{��_�?k'ӹ{�a�`g�Z&�ö��'>2�4	,�I��!b�nW�@ 
�(P#l�����劣"��ÎjȪӉ��І��h0��>��
%
{=�g��2^�Nfa�+����˰`|s���&	"�`�F�"��)�-�4GD?�"��TH1m�y��-�р���$�{����XM�`�nDXݲg�U~��/�h�0���fok��������%�]���ۋh�L���� -9EB�6����'�e�SE4�
�AR	\ISb�ZEb��pD!bYq\n?�� ��h1�07�7�d��?��W��Y [...]
-ʞ�*q|��Y`e|;Xܺ�'�Ī�kM�1Z~��t�����mp���������+���
�v�gʓq��i�wv8
W+��!���D#��+
����r"Ao����}:;|�����߯F�
�
�W""����'��d
}�X��4�X"
�/������t���a�k�7��bpY[t���2|iHҸ�&p����d~�4
-�0k޺ҫB��@@#T�F˗����(�$�F[X�VVs~��ria�����0��4��2�~f
-�+(�8��/x��U�\*���Db@�Y
�T���&��
�&��Ǩ#;��e
��y�
�YNb7�q�f<8W#2v�j3
�8��O`��h�%x:}\@)
-��DFG�������]������$�v��8"�C�ĕ�Ndp���2y���(��!
I���$�
IF;�
�+H�����5��$#2#1��Y�H�M��RФ3n�
N�WYP#�uA^#1R���՚�H��H�t�TL�b�!	�F�K�\��;{m��aZ#�]�Od'��$�2QZ'1ng14,Sd�����E��$�L�Ƥ�Ő�e��b�
,t05H~t�

�BZH����-���FZ0�,i���@Z@�R�?
k���
-�Bn�-hi�����u�t��C��e�X)�
.M+U��T��w��(��\>����`^���w��=���wJ�Bu�(��v?��ӓcWa=�<\�}{�ZP��P9ka������
-�����Ĭ�
���'�BCs	5#�#"tAm
eG5�
eM��O��E����M�
	ɕOj̻D
28��h�
��,P��`tT�
��J���5��m��Olw��c0��NN�
�
)ͽvLO 3;UD(�#�Q�؁� J Jdgã}��0p7�f���]��?���k��H�J�=�]d�j��=(�y졿'��g
-��,���`�2�&��l�x'��jƂ�[����Z`g�<��&�q��z�:9ycWQ��@�~��ކ�pj�i��"��<�s�ۂ�(ʃ����R�?{�+�������N��������fW���
k�2�nX����"���
�kщ��Y�T�\�#`�?Es[l
-endstream
-endobj
-14190 0 obj <<
-/Type /Page
-/Contents 14191 0 R
-/Resources 14189 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14187 0 R
-/Annots [ 14188 0 R ]
->> endobj
-14188 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14192 0 obj <<
-/D [14190 0 R /XYZ 89 770.89 null]
->> endobj
-14193 0 obj <<
-/D [14190 0 R /XYZ 90 720.814 null]
->> endobj
-14194 0 obj <<
-/D [14190 0 R /XYZ 90 654.771 null]
->> endobj
-13784 0 obj <<
-/D [14190 0 R /XYZ 90 608.146 null]
->> endobj
-14195 0 obj <<
-/D [14190 0 R /XYZ 90 603.663 null]
->> endobj
-14196 0 obj <<
-/D [14190 0 R /XYZ 90 491.397 null]
->> endobj
-14197 0 obj <<
-/D [14190 0 R /XYZ 90 425.355 null]
->> endobj
-13785 0 obj <<
-/D [14190 0 R /XYZ 90 378.729 null]
->> endobj
-14198 0 obj <<
-/D [14190 0 R /XYZ 90 374.246 null]
->> endobj
-14199 0 obj <<
-/D [14190 0 R /XYZ 90 261.981 null]
->> endobj
-14200 0 obj <<
-/D [14190 0 R /XYZ 90 195.938 null]
->> endobj
-13786 0 obj <<
-/D [14190 0 R /XYZ 90 81.969 null]
->> endobj
-14201 0 obj <<
-/D [14190 0 R /XYZ 90 77.486 null]
->> endobj
-14189 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14205 0 obj <<
-/Length 2428      
-/Filter /FlateDecode
->>
-stream
-x��Z[o��~���S+�x��]��8�n��7�.�H���6[��RT����M
zD*���C��"y8����Ĉ��6�n���va�����k�"���2���
��$HP].������O.�O�|_]L)�d��;���7�u
��gg�E/��W��b;����|J�$��b�����ׄt
HC�pXN���T�xk�5Pf�+^��x��;�b9Cƈ���Hm�ro6��˩��Z/�ºۢc
-	��!�Q�����R1��8�
و�\��O�/O~?!�/�Hi^.���|u��#�����ft�hq�`��ޟ�|�=�����`Y��.D��Y�Ѥg"
�)�3�'\!�usAq��i��`%��
�\��쟤���w2�-"
�L����iF� P�1$
S�<P�t5��E���_B�C��蒢]��dw&C����^�0���a8�Ui��ߍ���,`��.q��W�b�U�������b2��Mx"#���&?͋�6K�����x
��!ä
�l
E8(�#���F���h�%ۼ���ڥ�� 엤����W@(�EZ�*׼�s
-���z�א�Ҽ5������˟�^�9�����4)&:�"�L�Ձ J[=?$�2I�DzN6=��Ğp(�+����&�E]��j�Ϋ*�m�sS_���M at T��L}
FRHB����"N�$�
jI��b���O��#m�@�RBﹳ�g%�͓�^M�\�Y��zw��l�I��׺�t�ڭ��>�s�Pq��	��|�
�jg�:!�l|��m���V'ݹ~ǔ�#�#�-S�N�
}^��	�6"���ND_j�ֽ\�
-�� ����~SI�ϧ�Q)���U\U���un76-\z���v�U����k��xVT@)$�WtoX�Kr�@;��*��%|�H#�"��f �y-�Q��C��iK
-�]wIm�=h_�Bֵ1�M��.
�G�x��A�����h����p~�a�#C� 0W����ܮ
�&#���- �oC�R禫�mr|�UV������ؒ�Dw[Gb�?
R����F7Ù	XV ��qɦX��-mz[�]�<�r1���p���4f������}s�j at A/�)�&�|�.��lJ�䳃2�M��j[5�iP�vQ
�	@1X�f��Z��gUZ�֖���U�%YmW�
1�B�"��Y5Q��1=�=V��AL>!*����%;nN>E�(��5d��=��>'��TEq0�X
�L�$
8�88�L����C)�H�·�:�5"��Y=��rJ���z���O���c����*jbQ6Ģ
�#
R�o�
�Y�G�2D�hA��~
��np�cVb�zz���
_
-��Xv��!QoWv?�x�Qf
*��q���!|
-�1�[2��Qx�G�I�
-�_s݋�$�oG��/�e2O�aJ�q
-�����B�rm2.����e�8خ?W���Z�t-6.�LF at yÐڑ����.��utTwbgY�H��
+�2n��͋�Ac�;�`.��������֮�m^���m:���Wټ|le��L��O9Ľ����̠�E���#l�+
�tͱ̾��psH?������,[2
�!�j������¤_��q��H>F��zRMȳ����WY�j2X{�&�<|�� ~`J#�.K���r[��=dL*��|+fjRh�l��%ix��H
-}�CK��ޓor���C�Z�
P��/fT
-����|���_�ܦ�N��0ܺ�
y�@G� ��W
�
���^�)�ӵY��2���J�^9
-��-�-�y�	=�!���)�
u*#��%i���}d鲡��E��`�f
�1
vC��'w�ft��%��5�P�҈�6��Ӆ����d�r�Uj}_�
�p֗
ztZǽ"���c��� ��u�p��A��uv��N-c��!aR$
�Lvh�$�r<�/��@�j�q�sD=z�W�aw
�;��
���T?	��6���&�Q3�%�fI� ���
H�<���q7�
5Ӟ"s���T ��G����7
-G�Τ}D�(�����%���$-g'Ra���,�n���}��I
�B8�)[��4�C
-T���tًt`V�zn8�p ��<�#|��O�F#������]4_  �t�� ���*���~ ̡0YS��
�.���eʟAf	s܋��1qNG�S��qMJq4�sLM��S��P���Pg GY?GӬ����
&/qL����\���w
(=އ�
J�
������ϝ���(�#v��M�A���7o�
�{T��śj痍��<bR���8�6��.\���.T®G�_����.�բ�5{�8)e��F�4�+�������vc�[8�a���a Zr���bVY�ɓ��ha�0LmDaRB��`�����T1�:��������V,z����[�Z��|
-endstream
-endobj
-14204 0 obj <<
-/Type /Page
-/Contents 14205 0 R
-/Resources 14203 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14187 0 R
-/Annots [ 14202 0 R ]
->> endobj
-14202 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14206 0 obj <<
-/D [14204 0 R /XYZ 89 770.89 null]
->> endobj
-14207 0 obj <<
-/D [14204 0 R /XYZ 90 616.469 null]
->> endobj
-14208 0 obj <<
-/D [14204 0 R /XYZ 90 550.426 null]
->> endobj
-13787 0 obj <<
-/D [14204 0 R /XYZ 90 503.801 null]
->> endobj
-14209 0 obj <<
-/D [14204 0 R /XYZ 90 499.318 null]
->> endobj
-14210 0 obj <<
-/D [14204 0 R /XYZ 90 389.369 null]
->> endobj
-13863 0 obj <<
-/D [14204 0 R /XYZ 90 366.992 null]
->> endobj
-14211 0 obj <<
-/D [14204 0 R /XYZ 90 366.992 null]
->> endobj
-14212 0 obj <<
-/D [14204 0 R /XYZ 90 282.359 null]
->> endobj
-13864 0 obj <<
-/D [14204 0 R /XYZ 90 247.689 null]
->> endobj
-14213 0 obj <<
-/D [14204 0 R /XYZ 90 243.205 null]
->> endobj
-14214 0 obj <<
-/D [14204 0 R /XYZ 90 158.387 null]
->> endobj
-13865 0 obj <<
-/D [14204 0 R /XYZ 90 81.969 null]
->> endobj
-14215 0 obj <<
-/D [14204 0 R /XYZ 90 77.486 null]
->> endobj
-14203 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14219 0 obj <<
-/Length 2360      
-/Filter /FlateDecode
->>
-stream
-x��[�s���_�����|8�{����]6g�y�ۢdF	H>!v����#�� ��*^,�F=�=���Mƈ��!������p�����{����2���$$|����ᗻ_&5"F�[��?��׻w��}�Ϯ��]�~E�H)@ ������
L��_`bft��
8ep]���q�=�
-�@��!��rf����!6
�� ����0��&��a��M����R���O�B����(	��pD9�%��������Ï-�)�>^M�C�.`Q�q���r��<� ��U�
<�e8�
R<HO�h����}fO77�b�F�I�	F�G#��r
�����c4]O���6=H�C�fyȥ`֬�X1	
s7m�a����[����t�LW��c�!CX ���)2�� ܅
�L
Q���
�#�efX`ᆟ;3�7ğ9�O��_-���
��4�I������}�!N�0���X�o�Z�i���5)�|���Z3�
-H�5\#���+�$y=��E���h�����8Y��_
-�Wi����&<�hO��|�c���d�6C\ױ�gk�<<�B�jP<��K2-o�d�T����)G ��;�gM�*�؎�4�[$ʛ�e3S��1kр�j��<^�)`��
�\���dc`�'/���+��Q>O+��w�<*oVe��jZ�ϲt9��鐊����l���E`�(= a��һ��1�|9���o�o�+IT��!ˋ��75�E�K˄�k�!{sH.�.C�K�J�E��"��	@�JH���2[y�P��#��nuV�������k����025xX/�$/l߂P̑ƬWK�
�mr�Me�CS�L���
e��w��tr p ,�
�
l�ٍ|"�V����'�\�NcX [Fq2I��a
�/"tx���'����0��F�"�%�B�t{L�_��d�pǹOT)uDnZ���w�㩦Oe*Bh�����SW�(���<҃~���3z35����D\�TN��TP��cy��H3Z���OGL1�!�K,��AT��H鈪���IT�͖��JTU�D�+�E�Z_ at fAT���������T��P�M��Ί����HR=;/$�&�'������~��
�ϲTN
��K��Z��D+��r�h*���*�����{���3
�bEE�����]�0G7�d����"cb��(1�cW����`����1�f�x�$v�|K
��"���7W��]*m�(�h�<�I��Q
�pY[��L��+5�������3
Gʒ����7m���,����&P�K�
\`ن�z���6�����TK��S]�;�ZΞ�&ug����ޔ���U{�]3�O�5�I��I��7P�b�S(( ���i����A��y�y���9�m{A ���.�]��H�
f�)�����ɼ��
��TRG9	W���b��EK�_�髥^�b
�{K]�y4=ma����Pv�Z�Qfw���3Zρ��>��>|�
���qz�W$:Fuњ=�޵�@?�<�U9��� ��[�8W�Dʂ�{��Ux[ŷ��
-���%0S��u�]�������"�'�ؖH3��[���3�
��
?��
�d�E
��%�x����
��$Q�
8�%LU�'��|�&�`njR�9��w��s:�\�A�d+�/<�d
��J}K,���L�
%��b�i'(��I;����P�FI������v�_z)��L}K,�d�\�~�Y�1+�vMI�ė�98���W�*8y�
�w��'a�W�,
-'��^��j�8e9�Ȣ.(>�}{1gE��"�D��;vŴ���P���w�)���m��/��l�`�.�l�7D�ӹ�� ؀�ֹ��Ҫu�eꉽ{��K��ݟ�b��D
-��/Lΐ�
	+����������e�Ғym�����4k;C&Hm�u���*�l3��M+��j1Rą�}
��E
-�g���U[�g����=Y�,�{f�1�F�z���AZ��Z��������8�H��
lK$��_lԡ��f���N�tm�LׇZZN�����LJ^Τ.gR�3�Τu����P�����C�^�t�R��/x*��AȂJԧ?E�k��x �Dw�=���Ql�1�`L0D���!�p�{@u9{�S����ayyL��чo�(��: �ݩTG�rʾ�;q��5ei?����H�u�wF�u�O����@�0Q������
����K�MA�F��6�����2��&��
��z{�����*��8b�\�0Y���ޖ�m��� l�h��OQ�\U���Z����>�C-�!7��Ǜ�����*J
���6�K4������a�U�v�V+'��2�ݙ���/V)�P
-endstream
-endobj
-14218 0 obj <<
-/Type /Page
-/Contents 14219 0 R
-/Resources 14217 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14187 0 R
-/Annots [ 14216 0 R ]
->> endobj
-14216 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14220 0 obj <<
-/D [14218 0 R /XYZ 89 770.89 null]
->> endobj
-14221 0 obj <<
-/D [14218 0 R /XYZ 90 627.268 null]
->> endobj
-13866 0 obj <<
-/D [14218 0 R /XYZ 90 592.598 null]
->> endobj
-14222 0 obj <<
-/D [14218 0 R /XYZ 90 588.115 null]
->> endobj
-14223 0 obj <<
-/D [14218 0 R /XYZ 90 486.649 null]
->> endobj
-13867 0 obj <<
-/D [14218 0 R /XYZ 90 451.979 null]
->> endobj
-14224 0 obj <<
-/D [14218 0 R /XYZ 90 447.496 null]
->> endobj
-14225 0 obj <<
-/D [14218 0 R /XYZ 90 352.855 null]
->> endobj
-14226 0 obj <<
-/D [14218 0 R /XYZ 90 262.105 null]
->> endobj
-13918 0 obj <<
-/D [14218 0 R /XYZ 211.842 195.612 null]
->> endobj
-14227 0 obj <<
-/D [14218 0 R /XYZ 90 190.974 null]
->> endobj
-14217 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14231 0 obj <<
-/Length 2848      
-/Filter /FlateDecode
->>
-stream
-x��\Is����W��Uf��EI吱gj&N��Q*�ɔ
-"!			j at pl���5hT�
�vR�OX��^��o� ��!��wW��z��b�AFR���''J$(In�O�����O�O	���*�}?�x�^>?f�2�}�ߕi�|}��P��r�|�![l����}9%z���j�����%��@�†�:��~�n��:Pf�;ސW�x�6;b9Cƈ�7����2�l������l��L���,�1���:�������6,+��>�5�B�"9W���ۛ�_���	���
�t2_]��3Np��#ft�i�p�`�L~���nf�ov�n���;��A�D��;E`�8�J��*�1�lj�^H>��Uw�^{a
���-�(`[G�g��1�4	,I���L�ź��a��C�E1���������T�Q
/")��Pٝz"%2T���y�
��y����ϦDX
��&_�\�vۻ��U�)_����p���G
���^O�~:�7
-�=���1kV��Kd4i�
󍻧g����� �
�q|V$�1�
]�ó�ό#p� S!Ŵ�����8	̗isO�b��ʴZ7x^�7�l���e�ڮ�ѯS*&�r����V
O�D
J�%:()���q��b�8	J�i�RW�EV�Wy��4ڎ��&+"�bKt`q�〉� ��E֤�u��i9N��ҋ`
N]]�r��"�D
�H���,w8O�~D.�t����W*	&O	��=�$�
�áH�ELǖ�P�"�Hb�F�(���2)0�J��8	�)v�]%����X�m֗VM^( ��y�-6u��'���]p��(����R����u^T��r2_�7۲���.&�2
��Q���Y�S�Y4ko�gn�4%]^m.����IF,�Hâf��%�W^J(1�j�����ٓ̑��
-R�$>�{qn�b��1�
2k� 4�(G8E[�/���#�>O ����Rf���(I!"Y1��I����5D
xO����@�&�A�a�S̑�,��` ��� �D�C��cg����<�k��?6q�m����Irĥ��vZ,B宄�bT����m^����|����	\���b�'�K�9��@$�*��
/�%$�<��\6)����Y�H
gҠ��
/�ٮa��v�eH�D����
�.֕۹[o�E
m)��=lT�2�S�0�D�UP������>]nB90�
Ӿ=eVmK�5��_b=����K̷!��4Hk}����LL��x�� ��P�|$la߉<�i �~�
��}ӊ��zk˂�3t��^� 2
9"Xw��!�4��N�{����T�u�{OPHqC����ʪ���
q[�Gr��
�j�)�D����������z�
� �`�V�
3GP>[��
�!?� yhH-M��
�AZ�G�i���������z�6���
t	nC��6�CbW�N�z0^ƻ��|���4K�����k[y��VyՃ<�ݴ���E�z���j�ڛ�o��=8>:ϛ$gO
���D�;���%�C!	�N���>�(�h|
�cW�i��U���u�4���`�ƞ��2�j
->��126EX��ū�{���
�A�5i��j8��:���@�+:�Q'��'���*��)=���d�P��%޹w�lQ��5�Х��م�<��@�ә����O:|bÇB�eH�̦�а�}�^5�M�tټ���7�)v�ť��.���m��������<ݴ���r���m���Kr���7���o+���~ �cd
�
�_���
~DU�nEt����S��Q�]N	�
s>�{�2��]O����
���2�r;��
?���#
-�oϱ%:<c1M$R�4�:�
bX���{�&a0w59��
�ai��3"���E�Xc���Q���/X*�c�$��BM�X�ir�{��28�V$��"Ut�M� L"�yBmn�@&dVFw����
u	2�=]�1��S�1�u�46�;~��A�1�$�[/�%�Go1.�<:�ŘA\���nqCI�(�IouD^Bo1(
6�識���֞�#魞�_�-Oo����e"	eq��x�Az���:@o�
��QHv�R��)�v��n��B��&�-�Eם&��A��u��Ӿ$E��!P{�]si��bH���
e�:\pL;}ґd�� EW�⨚a�f�{Ix�	�I��dr�ᱨ�FZ�J�_���T�W*i�DA!Y*��b��wRIQ
m������J
-
!�[f�Ǿˊ�m>p���z|�
2 W�y�s�+f�Buqet���D���5�!�`�!�`/L\Aͩy����=�W��W�j/�� o�����3v�
4��=�ᭌ�E�^��ޥ��^љ1B
s�8���U��c}�V�Y�+���
�����Wx��,��
-��Ww�G���ڌ��OgD�qL�!��ڳۯ
�Q�3;���M�]�L�?�S���8?����6勈��
����).�aۯD�3��
5	���ɗ!�ƛ1<� ����E�����E$.� )�T�I�]�IK]M�q6ސ����d
�Kth�3J�8#
#����م����.������
��ZDŽql�� �t�o#�.=����t{Î͗�Ҵi_�e�½/#o���Ɓ��/#��A[��&8W{V��_�r_F������I,�
��9�h�Ͷ���mc�S�ħŚ���6����>�����u������o���b�.ݾm��j+��ܕ)a�B��'?fYS�:����{rN{�
-
	�˓Ǫz�~��n��Ɋ����R��j�	P�)�֥��prU�Զ=x0AR�v$`0���D)Z��ݯ/�?lN��~Œ7k��l�tidz
-endstream
-endobj
-14230 0 obj <<
-/Type /Page
-/Contents 14231 0 R
-/Resources 14229 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14187 0 R
-/Annots [ 14228 0 R ]
->> endobj
-14228 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14232 0 obj <<
-/D [14230 0 R /XYZ 89 770.89 null]
->> endobj
-14233 0 obj <<
-/D [14230 0 R /XYZ 90 720.814 null]
->> endobj
-14234 0 obj <<
-/D [14230 0 R /XYZ 90 605.755 null]
->> endobj
-13919 0 obj <<
-/D [14230 0 R /XYZ 192.853 541.506 null]
->> endobj
-14235 0 obj <<
-/D [14230 0 R /XYZ 90 535.488 null]
->> endobj
-14236 0 obj <<
-/D [14230 0 R /XYZ 90 442.381 null]
->> endobj
-14237 0 obj <<
-/D [14230 0 R /XYZ 90 351.631 null]
->> endobj
-13920 0 obj <<
-/D [14230 0 R /XYZ 211.842 287.382 null]
->> endobj
-14238 0 obj <<
-/D [14230 0 R /XYZ 90 282.744 null]
->> endobj
-14239 0 obj <<
-/D [14230 0 R /XYZ 90 188.257 null]
->> endobj
-14229 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14243 0 obj <<
-/Length 2276      
-/Filter /FlateDecode
->>
-stream
-x��Ks�F���8m�*s<�j+U��w+�M[9y]*�%Ԓ��v��g�
 %rrp� �t�t�|=�pp��ߓ�L^�K�� #�
nV����		����)�z��懀I������/?߼��潽7y{3�}B�H!@ ���f��#�p�� #ft��5��28����_'�ԥ>"*�=���FCm�<P�!�E���?�c
���)t 򠋢����X"A�Q�� �C
Zb_Z&L�	����
�
�	2Bt�8��H�\K��N8�0ʥ�,
-V-)��݇�0�b\+&g�/���d���S����a6cjz��DI^���|P�a�٨��9�@�k)c
��Y*�nH�A�y��<d錊��d6�O㕵L���1I�8��x̊F�p�8��ɲhCy{�%�JUm��1��
]������~��l!��q�H7�a
߭#t|�3`�%�9DV$Q|���@�GXyR"�u1�߯zfM#IF�4��aU#h2��0�6���8M�>ɐ��$>�|���4/N��]���ŏU�n��Ѻp���W=}���V�z�t�xu��,�wYR�Y��'^BJT�~2Y�&}����Z��
|��<[��l�$��6=��LD�
-�.d'����1����
@�/JD�:Z���.����!ZV��^n;k�
��B��)E�B&�HA'��t`��9x�:���$���RH�Z��-�
R�n���$�X�9��!��=��Mz��
U�`J=����B�
���]���Y�V8���C�zF0
�&���Q<M�{�,��)���lu5w�4�
�� �4
��<����h�[D���lF�4�y�8L�cC
-f�F�7�0b�I��0�`<68v�걹�Z�I
��[ �C"x6�RM��6�6�-Hg�ƶ|�`���0#@u9p20�����J��{���= j�$A
-u�c�x
��D�!N�q}���N���
�r!z��綯����=�v�I> �qi��(w�&�}�;������rC�X�+����2�`tt�iy(t�?D�JYmA�e��ղ�|U[���{�L�x�_�
M���B�` l�F
-��[Ҽ�LW����
��i����Z
��j�1-�j���g�4��CE��~Q3^-��D����4���p�HIٸay����.V:L ��0���
�a5R�
Ը�@e
�־	
B#w�v���@��4'z��� R�v+��,���
"�C����
-,|
Ԧ� 8� �k{n�,^��!E ���
,D�H$��
Ah�M퓇��
,��;Q����T	�B�A�4����p��b�ƻ� T�(��d Ε_5
�P%�im�]�4�.!澄P�T�R�*��
�
�PX�|�
-FO�`-E���W����@Rw�GR��t���ᅰ�h�yT2���R���Xʉ��w�{�K9 � zL,m��K� ��hX:���vL=K=K�b����gk8�@$#fܰ�D�I,e���/j*%/I�����xr�����$��O��'���za�4�|��˾
J���;���	�Rh�(��Hʒ��d M�3�4\��tك�v���yQ�/BR���������0.6�t����(G5^}�<}h!����qU�X�Ÿ4܃�
�`�
0įW�D~VE��,��j�ͷ�����Ĵ�� K�Q�=����CL�����A���:�B��/A_@�c&($����x	1Q�\�51�hgL��g�g�_��_��Ξ����L���<	KT�j���JKeZ��7��܊� W
��U��,�p�I�CL
H	�����"b␱	w�-3��8��U��"F���ش����4&��fӘ��~"��f
h �`掃��$��i���|P+wS�F�J� p+gON��kNd��:��
)��қ�:X��N����G�AFʣ��t��8����
Qiy��*����+��
�ٗ���q_�	��p�ש1-g
)")�*�9
��|-nz���ҕ����mT~
-�J3��-D�"� r�5�so_>�7�-�y�vj�f������ć��e��YĘ{��Ǭ�Z"/)�l�+�h�Ә�V�S��3맶�_�'W>�?Y�����E2�Vo��q
-E{꿷�w�U��w��
�Z��f�Ly����IAX#n���ʉ����u
A���N�%������/�f&Ĵܢ�O���uqn��ӌ�i�Y).B�hi��
���QTf�B���j�8q���Gp����!��^����o��
�'
�j󰁅�y�Y/�����8���Ю}�5�3�8^-
-endstream
-endobj
-14242 0 obj <<
-/Type /Page
-/Contents 14243 0 R
-/Resources 14241 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14187 0 R
-/Annots [ 14240 0 R ]
->> endobj
-14240 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14244 0 obj <<
-/D [14242 0 R /XYZ 89 770.89 null]
->> endobj
-14245 0 obj <<
-/D [14242 0 R /XYZ 90 718.682 null]
->> endobj
-13921 0 obj <<
-/D [14242 0 R /XYZ 216.764 654.432 null]
->> endobj
-14246 0 obj <<
-/D [14242 0 R /XYZ 90 648.415 null]
->> endobj
-14247 0 obj <<
-/D [14242 0 R /XYZ 90 565.131 null]
->> endobj
-13922 0 obj <<
-/D [14242 0 R /XYZ 90 530.461 null]
->> endobj
-14248 0 obj <<
-/D [14242 0 R /XYZ 90 525.978 null]
->> endobj
-14249 0 obj <<
-/D [14242 0 R /XYZ 90 429.827 null]
->> endobj
-13923 0 obj <<
-/D [14242 0 R /XYZ 90 395.157 null]
->> endobj
-14250 0 obj <<
-/D [14242 0 R /XYZ 90 390.674 null]
->> endobj
-14251 0 obj <<
-/D [14242 0 R /XYZ 90 307.859 null]
->> endobj
-13924 0 obj <<
-/D [14242 0 R /XYZ 90 273.189 null]
->> endobj
-14252 0 obj <<
-/D [14242 0 R /XYZ 90 268.705 null]
->> endobj
-14253 0 obj <<
-/D [14242 0 R /XYZ 90 188.022 null]
->> endobj
-14254 0 obj <<
-/D [14242 0 R /XYZ 90 134.333 null]
->> endobj
-13925 0 obj <<
-/D [14242 0 R /XYZ 90 81.969 null]
->> endobj
-14255 0 obj <<
-/D [14242 0 R /XYZ 90 77.486 null]
->> endobj
-14241 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14259 0 obj <<
-/Length 2051      
-/Filter /FlateDecode
->>
-stream
-x��[Io�F��W�Ԋ@5�}1�m�MS�M�S�H�D�������p�"�q��er�8�:�qh��nl����	ǟ�����Ie0�	
�$HPL��ݘ`�h8!��UH�8Z/�뫐��j�x�����u�a
�//�Y���o��a���W���
-�����W/	i<�*���0��yϊ!Μ`��j�s�C8�����ǛXΐ1����
����̣ͦ@�������<�{[0aL!!u0!!�;�$7InX���8�
YArn��ы�����8 �{�@J����{
�p���
|�-N
���џ#��-�`��i�f�C��1���\�)"��
�+���d���2Z$�%N 
-���6�;md�A���E$�ߦ.g.`�s?���Wi�W��
x0g'E�)�����|&�|�͂g=�(��3�e>s��!���t��l�j^^Fq���n2Ɛf,�� &��<��hSg�n�1&��4�"��f����!/�<�c��	��^�d
��
�+q{������U~RM4�h
��m��9b��̏���A&b%'!ޥ�y�L��n����Kل[�P
-R
-�
��Ɵ�l/Qq���mr=�n����Δ̄ڶM�l��*�V��s��G��c��,(G]����Mdz(�XRB�Oܶ�
-��HXI蘴 x��,��RH�X�v��� %��
�M���>��Ԙ�Hb��{�]�
K�Hڐ��d~
��bQ���ঁR���@	E�
�@����d��e�
����i|
�C�Ʒ�d��
�
i̼Z
-� �i�T�8"�X{LuS���ӻ�*�b�iY�dz�QD
Y饈$�
-�#T��>��6N!\��I����Q�~�'h���B����H���B
�y�l	��\������WͶ0w�3%�b��mqv
-�Z'��2��[
Vm�p��Oh6�oqh�&G"��V���� �(��㡐,����c�"y��#y0�h�G�^��
z�i��>�����g{ĺ�Α�X
�V
2�aym�>��%G�qM�����\��̶�”�����z���򈮊ZH����Y�L�X^��c���%�P�__KĎ_P�#漏h!�մ�������^�VC����pr�4�d�
��iL;J���2�?�?l���ܬ�n�[�y���� kz�o!��_>��x$M��1�dHT/�<�+.$�r=fQeܶ�S]5 ��+�Ԭ�|ZZ����g�+��/��:�~	
���j��x�N�WL
�<��8�'w�\�oZj���O���l��0^i)ާ�֞�\3Af
�ুo�a��Hr�ŵ}S�X%j��5
I�wE����
�o��
-�k[�#\z^d���g���p �����H�R٨��_w��6X�:���N�1��� �5`�+mz��9G�Pl�ח�<vafFx��s6� �(�$y8RJ
��r��6�N��L�W�l���)�8N�D����6 b( ��s6�i�jeͼk
�����ʥ� 3�**5���8
�!��#L{�8>-�4N��35�c�ׯqz�Y�W���*H��V�̃2��Ě�d�|J��d!s�h��V틴qQ�.v�
賂
�9ܨcd�>(sju�����gD؜�d���Y�����2��4
�9��-#<�* ގ��!BG_�X(R��=#�᩠#=<�Coe�3[����J��-�	r��%9�?Fe��{$�U�+�$�p�վ��}
-�h�D�y����B�dJ1e>����AK�
{G�i�P
�zUSD�Ì>IM
�G��r�1�-���B:ߜ��� >�$�G<M^Y"ϫ��Q^l���J� 3�3�޿�{���"WF"��7m���JZ�v����f~V��:;Z��c(����Ȯ���̏�������˒tɫ�'���"su����l�}(ĸ\l���Ѽ�m��ǐ�q��,N�-KDᄁ*y�$e�,&�OP��}�'�v*DpP$5��˲�ˋ���dy� 7v�d��Ԫ����XUy�.��"��U��N'L��[z��/�
C������bucy��
������T�%�+
-endstream
-endobj
-14258 0 obj <<
-/Type /Page
-/Contents 14259 0 R
-/Resources 14257 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14272 0 R
-/Annots [ 14256 0 R ]
->> endobj
-14256 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14260 0 obj <<
-/D [14258 0 R /XYZ 89 770.89 null]
->> endobj
-14261 0 obj <<
-/D [14258 0 R /XYZ 90 643.916 null]
->> endobj
-13926 0 obj <<
-/D [14258 0 R /XYZ 90 609.246 null]
->> endobj
-14262 0 obj <<
-/D [14258 0 R /XYZ 90 604.763 null]
->> endobj
-14263 0 obj <<
-/D [14258 0 R /XYZ 90 522.077 null]
->> endobj
-14264 0 obj <<
-/D [14258 0 R /XYZ 90 468.388 null]
->> endobj
-13927 0 obj <<
-/D [14258 0 R /XYZ 90 433.718 null]
->> endobj
-14265 0 obj <<
-/D [14258 0 R /XYZ 90 429.235 null]
->> endobj
-14266 0 obj <<
-/D [14258 0 R /XYZ 90 346.549 null]
->> endobj
-14267 0 obj <<
-/D [14258 0 R /XYZ 90 292.86 null]
->> endobj
-13928 0 obj <<
-/D [14258 0 R /XYZ 90 258.19 null]
->> endobj
-14268 0 obj <<
-/D [14258 0 R /XYZ 90 253.707 null]
->> endobj
-14269 0 obj <<
-/D [14258 0 R /XYZ 90 171.021 null]
->> endobj
-14270 0 obj <<
-/D [14258 0 R /XYZ 90 117.332 null]
->> endobj
-13929 0 obj <<
-/D [14258 0 R /XYZ 90 81.969 null]
->> endobj
-14271 0 obj <<
-/D [14258 0 R /XYZ 90 77.486 null]
->> endobj
-14257 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14276 0 obj <<
-/Length 2130      
-/Filter /FlateDecode
->>
-stream
-x��ZY���~ׯ�SV�����"@�#�����Z�c
8"g��D͒�
���f����nN
~����uW}lbDE�`{�� �[��m2�z�X`��T����@q����(�8��>M�LjD��U��?���z7�`��&���p@
������O8���ؘ
|)'�N\g���/�qVr4|�A���	F�"���	�xX��YXĖ���0m�TS�Fj�t3<�
-)��	��)N�y<S%�/���.Z��Ơn
��`�H����V��$�F�3>�(.��M�lD
bX�oF�l
�ތ(
.f��8���qi�1ea0�th�pk�&wY������E�f���q�����M6"z����K��|�Z�(�Q�Kbդ4h�����)�ާ k,SO����F�
Ȕ@��@���)2�4���{Li�hI�Ժ��)컚�����9hZþ=��	G�3���"}Ȗq:�sЦ��a�-7����l��E����*���P�v�U��Sm,�9��b��w9�F�qx����S��k�9yL$G|fL!h�v��EVFQ��_zx�����s at H�n1��I���&�n
-�#SN�B`�A������$G��~�k)iL�*�dA��:�!��
2JC,�a�Sl_;��z�
ڱv���!m��\-�F�� ����@R���(Lv^�Su1�eOΑ%(�Q�9�n]I��elxNC�D�*��ɶ���܅�
����UcaA��$,��<\��lڂ���B�B�eD"r���](�^}�\��q��~!b���9���4~*�Ez $�>�ag(���/{1}�J��f�� A
-?�
\I��]�A�|��r^���~
�04
B$�r�ɋ��*����,�n�l���a9��b��S
��^%y��h[T�8�O�O�V�2
-�'��1[��~I�2x�Q�8tʲ�|y�Җ/�Y��J�D
7��4ꪹi���.2`b�fUn�0O15N��b���,>���ad���
D��$O�
h�����W������4I:�U�@)l�� �fQRf�Hg+׿�y���YЍTuF�a���;�b
F���n�,��`���`��p��O���rj;A����]c[��l
�
;Y\,�jm��w5��fC
-��0q���Kj
�dz��Fq^@@�Z���޾�
a��AS-h���r�-�H��8����0�s��BQ�-��d�K-@�
zm �@
�}�Hg![؟y ْ5�vȖ�
-ٲ
�V#�D�"[
p�J�p	�e	�v��"�A���a�62�t�r�wC
S��l��EC`���D�^p9f� 	jv�~E��� d�6�lg���}L�Y�Ɵ��Q� �
-��6
�.���x���߆��6���n�
-bkfN(�'�֭�OU}nV�9�R�%�Z�����=��)�=5�^�A
��j
R``�-���C��B.:A�&�c¡�
S�g���M�}��)���1.�w�ʠ�)��l�����*P�$�O��A��ʘ��7�ڧ�5Rm�z&R�$��T+�z��v����	�"����%���~���|�Lj�!��r�a
Q�ȓ��4�;@��< 
-f.�<Z 	{ZJ5����
'x#-zؓCZ�{{�(KT�wchgv�,�gd���GyǠ-{w�Q�N���Y�$�E�(�x(��<މ��
�ipd�N�N�����ZU��� �&�"R#j
_R��e$E�F{�{�X�|K@?�W$Emޓ�(u!�P�cc�3$� j��g�����
?�
�Q��|qv�H
-�'4?��iЊ@�%�odU�@�zm��feD0���Ym��Y���!�>%��UK�3��'�wdU!���;�EZ����"���A`�#+����$i
&����$,[Ȋ��0��:LbX�t��`"!��I̦ab��1G�'	�
ɂ�� �������,��7Iaϣ�)'X��6�[���T�ȸG�%y����շp��#�Tǎ��|c!WH���~����R�
ܼ/�5Ջ��Y�r����@o�&X�oHA�6�6�h�����ܼu7 ~�FB
+�����������FS����
xI�>�Fc)�C
W�r|��a���������cQ<]_]�-�8}@P���p��@O���� �����I
-/�푷��%l�
-endstream
-endobj
-14275 0 obj <<
-/Type /Page
-/Contents 14276 0 R
-/Resources 14274 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14272 0 R
-/Annots [ 14273 0 R ]
->> endobj
-14273 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14277 0 obj <<
-/D [14275 0 R /XYZ 89 770.89 null]
->> endobj
-14278 0 obj <<
-/D [14275 0 R /XYZ 90 646.048 null]
->> endobj
-14279 0 obj <<
-/D [14275 0 R /XYZ 90 592.359 null]
->> endobj
-13930 0 obj <<
-/D [14275 0 R /XYZ 90 489.624 null]
->> endobj
-14280 0 obj <<
-/D [14275 0 R /XYZ 90 485.141 null]
->> endobj
-14281 0 obj <<
-/D [14275 0 R /XYZ 90 404.612 null]
->> endobj
-14282 0 obj <<
-/D [14275 0 R /XYZ 90 350.923 null]
->> endobj
-13931 0 obj <<
-/D [14275 0 R /XYZ 90 316.253 null]
->> endobj
-14283 0 obj <<
-/D [14275 0 R /XYZ 90 311.77 null]
->> endobj
-14284 0 obj <<
-/D [14275 0 R /XYZ 90 231.086 null]
->> endobj
-14285 0 obj <<
-/D [14275 0 R /XYZ 90 177.397 null]
->> endobj
-13932 0 obj <<
-/D [14275 0 R /XYZ 90 145.612 null]
->> endobj
-14286 0 obj <<
-/D [14275 0 R /XYZ 90 141.129 null]
->> endobj
-14274 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14293 0 obj <<
-/Length 2319      
-/Filter /FlateDecode
->>
-stream
-x��Z[o��~ׯ�S#�x���f��i
-8�n��]�D�l%�!�u��{�3���d��}�)rtf���f��� ?��|;��Q�� #�
n�%	�����`��bI0����0݆w7
����)Z���/�}���k? ����p�>Z�W���&]=���|����	iLHC�pXN1�ݐ֚`
��r�;��bI�����}�Xΐ1���wR�i�߄Y��.
�G��M�G�o��1�����d�p�x=D�bQ�r�8�
Y���dzng��<�)��R:Xmg?�`
�0bF/Šm�)��&�0�u����+���ڋ�Ȭ��a�E@����p�v�d��z%�w��o�K��f` )�5��G���/*ci$X�I����m��ڭ�)%`���:{��}�,E$��.C6�N�D���2n�"Ы]��i'���
�<ں�|��~l�^Gk��)�؆���4Z-��V�h�ƕD"r����aE2<e��/�m�)���k������\4��'��
5�|W[�N7��"]
-r�4�g��+銴�k�,��(��F��x"�0�b$�9�d���:N
�?��x}�
���m���aO1G�L�)��C��2��jL�V���@;mkz���T�_���k�� -�"&I����1�]U4!��1�S��1�ؙ�Aa��eC+U�Y��s^��0��i
�{2Ȩe��v��0��7ѱ2�
(wId���d⼼@���`!���?����8y�V]i��	��ѕ8�������o��~��w��?��چk���y_�(�g���
-��y��je��~�W��kd{]Y�C�2��}��g݅�ŕ�(�$109
JJ_g‡h�[�:�^��8�P�֦�:nZ� �H���
1D��y�vp���(�A߭@>�UF���$,VI���jq�Vݗ��Rw^�Av(b`��쭵�f�TU���x��!�q��!�tNr*���"RC��>fVP�)�&5�zR7}*��
3�uVŔ���I�@�dP��1 ����fP��!��r��
�k��O��
-b��0
!�$���/t�e��q����S��t�x����#�b{<�=T�}
AF2P"��[8�G_A��4
>
����i

��¢5g�#w}-� 3�|�����Ti��ON�4ʞ#�1���]��8'ܲ����BM���ϥ�d�I�U��SmKr�X��ʌ�j��z1�
e�P��7/�
��:�P��Fj���f7H�_�
-s��&$'S
,p8����N�HA���v}�
-�c\��u�r��:*.�3���t�%�l�|�QFO$��k4
``C&���%�
Cr�u�Đ^�/H@�Y�E�1CO�Rކ�K(/3 at +�t�wJMK��Q�L���t��;T���7P`7nö�]�d�Ix���
H������
����p0��HJ���z����e��7Bw8����ǩ ������;N�z_�s*�i�p*Ro��q*]����xSE�ℶ�Y�
-�'��� ��T�
��J�~N0����
sV�Sq�8Ւ�v�{,�%��^ew��gN	�V�?�0� @�$
�L�#� ��(�E�1j�8��HĬ�"Ơ��i6'5Vm"f����]mql��*n�(_��+F��

U�>�ݯ�`�h1Nj8D3äI�&7J׈[~,��?�ymAh�Z���9�
�� ��7��*��6���%8�
-�$��� 
�򶯑�@q>�
������bj��Z��D�|�Dr6�����F�(�G�?����O�
'�X$1��2

������
��8��Y~#���M�g��:��
nX�>�ҳE�(8��5x"X@�h�<J��;
(����(^���A�#�-�����`$s�y�
Eklu��(v���m3��~ 9�E�
F�im%*3m��H�QIli.�
*��0���9���8�m��'��

�I��s�8)�,dq�sZ9ı�+�h
-I1�C�|�*6_G��~tU��Ÿ;�`}�=��:H`��
-��+�x�9���nH<a�H��B�4��ϡGĢ�G84�RU�D��`�U�={���pO6��8 �N�l�M_���W��gh\I�gQ�= jˈ
ٻ�l��F�W�P��#������'t
-4;����h�Jr_�!Ʉ�
�rs��{��,�ݥ)~�-L��')6
?�m0rea`h6�P~H�Q�ܢ�
�w�v��B�JW9�)ϟ������Y�<"���l��^����~�K�P���b��ūj�� 	��[��;tJ
Ռ#��������_�,x�ם��O���
-endstream
-endobj
-14292 0 obj <<
-/Type /Page
-/Contents 14293 0 R
-/Resources 14291 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14272 0 R
-/Annots [ 14287 0 R 14288 0 R 14289 0 R 14290 0 R ]
->> endobj
-14287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 495.268 212.124 506.172]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-14288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 309.787 210.103 320.691]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-14289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 206.379 485.603 218.897]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14290 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14294 0 obj <<
-/D [14292 0 R /XYZ 89 770.89 null]
->> endobj
-14295 0 obj <<
-/D [14292 0 R /XYZ 90 720.814 null]
->> endobj
-14296 0 obj <<
-/D [14292 0 R /XYZ 90 667.125 null]
->> endobj
-13933 0 obj <<
-/D [14292 0 R /XYZ 90 564.39 null]
->> endobj
-14297 0 obj <<
-/D [14292 0 R /XYZ 90 559.907 null]
->> endobj
-14298 0 obj <<
-/D [14292 0 R /XYZ 90 469.425 null]
->> endobj
-14299 0 obj <<
-/D [14292 0 R /XYZ 90 415.736 null]
->> endobj
-13934 0 obj <<
-/D [14292 0 R /XYZ 90 381.066 null]
->> endobj
-14300 0 obj <<
-/D [14292 0 R /XYZ 90 376.583 null]
->> endobj
-14301 0 obj <<
-/D [14292 0 R /XYZ 90 283.944 null]
->> endobj
-14302 0 obj <<
-/D [14292 0 R /XYZ 90 230.255 null]
->> endobj
-13935 0 obj <<
-/D [14292 0 R /XYZ 90 181.52 null]
->> endobj
-14303 0 obj <<
-/D [14292 0 R /XYZ 90 177.037 null]
->> endobj
-14291 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14308 0 obj <<
-/Length 2758      
-/Filter /FlateDecode
->>
-stream
-x��[Ys��~ׯ�SBV���J�ޭ��n
[ɋ�RA$(�B\�����
Ā )����D�tO__�
��v�G?\��������
2����bd�Hq����ѧ1t����#�-w���z��׫����۫��.<�#RH��lu��3
���O#��ѣ/n�j�)������?/p�K󋨰����h�8�a�G�0��(�y�u��$K7��=�{S�3�	���	�r�H�K�"��4Af$
G
�w�.�&��!K�tI��Z$�}��U����hѢR*�m>�P��%��^��M1��L�	���h�̯�|���v��Ӣ�א>(�dTP
�v%e�#"�!Ie�
)6�2OЫ�<�P1��N�T�q��ҽ����{�"&I�G������hBF7c��dS�����fP��{���R���
*qgu%�<.9�'��
��4Ig�j
��2F��%��α�A�$��A��,��C��.A@Sn]	F
-Ԏ(�L	�x\ī�2*�R!��B��F�.Gx�R�QY��he����
)_��V݇��Pw
~�a��D����
H�Mc`���YR[��6 �T�Ok[E��'����]<ϣ��5S
-��������w�%7y�?\^V/I�\>\���Y<�~�O�
g��Eh$?������#ސW���
ѻB�'���yʺ�ܮ�q��4�f��zI��L�B�i,r����� !���nʉo�m�i���D����Ҳ7m��$�6J	�N��T0:�A�.zL�.7�&=���m`E�#���W6Օ��W�@��#ް#������-����Ё���� H_T'��Ɩ?%�2I��
��Dy�
1���
��s�ٔ!����d�
����U9g�
Pw���M% تg�d0m�G�M�!�E\�_	W�U�t��y�Yg�<Io�[+��g�|��%��iL)�Hr� ��
�
-�=�&d�}��
-��- �m�<�
-��
u0�R��vD=�z���_~O�ְ
I�YX�<��Q�+ G�:�W<'����%����P������Hs$ݓ
��ɲe?�
��m�@O| t"�
)C�@!���U��W�c��
�`d�C(�&J�|E�Al��_�4 dZ
h
�Ho�
-��n
�"x�y��+�r�yˠ��1�.� G�?g<!d�5�\����|mY�/8����
�����
���.$Z�o�p���p�����
-Q�� m���\�� B0R��|�~%\����|����\���AR��� <J��x�g�ڳZ�E
��J�[j��
(�g�� (
�i�:J%��G�\R����6O�y��3�1��l�I�F�8j�h�集Qfh���a
Ÿ�}
-W���u�����$]ơpࠋ�UX��9U�(�%
V������:��X�y��Ta�
-;][�
$m�
���<Z�A
-f�:U�|ق��� �lAhS�U���4O����b1Q�8��Y�W�`�����E�*0�c�Tӯl�TS+~�V�
IQ�A��
-�U+�odO Z���k��,������Ÿ
�[2�����Ee��藂Qb#���g+�f��P(�m���Pf!�	�𞁦á�EN
��H��C��
	�CCJZ�Ў�'�PO�
�p���v!{N��nyͣ8�*(P���P��C�e
ʱ���zG@��
-��i����,^C��q^s^ q�R��� - ��N�z
�Z��z�0�H�
-��
-K�D��}(�����~����u[��B��zj
��Y���; vQ~���ک9����3�'۝g@�b�n�z�g��,vڛ%u��HA*�*�
��� �	@:R����%���Y���E�z���@
-�7}
�Ԟ)������q���4*��4��
�}���-�u��5?�@z��)�*ߩ!I����i��yl93PF(W^H�
-i-v��[k	�me~�}r�D�N�B���6�D�����VD��|oӹ�"��uW1�ئ��
-��VP�
���
-�E#_�`�r����>�	�&����ٽ�r������=�u^���<[dzľX��y�������6�8��v�}z�-j���v�
-�eƖ��]'o��QС �2>Rvy3<�#

>\8�Z��c��]!F$�>���SBq{t�M�'�)/�n�ɇ�'�U>Wu/��ĺk�~��%�F]ӹ����q�zs����?
�6��"���I>��BS,�NP&�X
L"-M�s��(p��PGM�<f�M��Lcz�v���k�
3�Ǚ���
�����=լBS,�
-LsƬ�r��n�K�{s�Q�:��~�j��X��YO��򞅣��GF��=W�T
�2L&�]=��ճ�eю��m5��=�hO^�as-:�ўL�i_J@.���
I�S
-�I:?VP?�#ߣ��,��
��[�%�Gw���PFk
��n
�R�]�a)���m!�=a�M��+'�XT?�+[����
Q���q��e�$2�KB����C�2��@�U��a��d�m��������v���t�s�����H�����jT�fUx��r/�u�凎�������=�%��
�m�?짩g��~�/])R�=�{�����q	�7`��{ؾv�w��\�ћ
���M��tG�������.4k���> y��]y�M��q"ĸ2�_�t[c
�6�-
-��
�K�0e�->�u����
�?_8
l�#l��x�]Q�/_����n�����w�v/H��	M��WY����p�����`���S�
-endstream
-endobj
-14307 0 obj <<
-/Type /Page
-/Contents 14308 0 R
-/Resources 14306 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14272 0 R
-/Annots [ 14304 0 R 14305 0 R ]
->> endobj
-14304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.269 216.909 238.02 227.813]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-14305 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14309 0 obj <<
-/D [14307 0 R /XYZ 89 770.89 null]
->> endobj
-14310 0 obj <<
-/D [14307 0 R /XYZ 90 718.682 null]
->> endobj
-13936 0 obj <<
-/D [14307 0 R /XYZ 90 684.012 null]
->> endobj
-14311 0 obj <<
-/D [14307 0 R /XYZ 90 679.529 null]
->> endobj
-14312 0 obj <<
-/D [14307 0 R /XYZ 90 594.711 null]
->> endobj
-13937 0 obj <<
-/D [14307 0 R /XYZ 90 560.041 null]
->> endobj
-14313 0 obj <<
-/D [14307 0 R /XYZ 90 555.557 null]
->> endobj
-14314 0 obj <<
-/D [14307 0 R /XYZ 90 458.784 null]
->> endobj
-14016 0 obj <<
-/D [14307 0 R /XYZ 90 424.114 null]
->> endobj
-14315 0 obj <<
-/D [14307 0 R /XYZ 90 419.631 null]
->> endobj
-14316 0 obj <<
-/D [14307 0 R /XYZ 90 334.813 null]
->> endobj
-14017 0 obj <<
-/D [14307 0 R /XYZ 90 300.143 null]
->> endobj
-14317 0 obj <<
-/D [14307 0 R /XYZ 90 295.66 null]
->> endobj
-14318 0 obj <<
-/D [14307 0 R /XYZ 90 189.063 null]
->> endobj
-14319 0 obj <<
-/D [14307 0 R /XYZ 90 110.667 null]
->> endobj
-14306 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14329 0 obj <<
-/Length 3118      
-/Filter /FlateDecode
->>
-stream
-x��[Yo��~���S"�v߇s �
�l&�3��ev`�e������Tw��j��f�<��fuu��u}N
�|��ۋ���%Ier;K
N�$HP��N��#����K�1
݌	
��"��S<Z�_
�i�޽�x����y:��ܽϦϓlzwS��
��r��������&��!l8������:Pf���w�K*��5�>����
#�g��#����<]���۱��l�4O��>�\2���:�$!��Y��-'~
�a!k�\0{�����O�ℸ��)�L?�d
-�H0bF'_ܠE�)��<�p��
\Y
-����TvY��@=�6b���vekE���E:�+����/O�2]d�[J�5�՚B����|��
-v�v��+�F�#>�)��i̾1� ����Ā/@�
M|���H�k[-7����µd�
rz�]��:���1]f�Xd`x+K�)�t")2�4��F�a��(Ro�S��t�F�K8&�t�яX���DҰZ��#�yz?o �������=�b,1�l{;��I	
M;Y-�eD���w�2K��7??���^�ed
mc���T0�Fn6&bd���
Z4{�j�9
N�lYF�HaUp
�V`1s�aZ��E��^�y���n��39�U=q��
-���ɋl�Ɋ��n� `��6͖�E�L�UaO��)b^�x�P4C��w�e5h�yR
-�7�ɢ�H�PK�O�5�D���t|>��9 �����_���	7
м�p��?�@��#fT��L �u����*YD
k�fL�����@��Yl�d���C����_$�.�lLŨ�<��Y��j�j��Pp	rh͟�S�~�
+�f��IiO��o�>=����g����v�M0/��F�9`�p�`�|��8�mb�v�r���)����l�oܿDt4����u;%����t9�-V"�d�m˃�6�FS�����ln[���|Z@�Pڤ��֡��5�a�[������I
�h�;;�(��m���O+�B���8�����7H�8G
-2p�	�DX��,")�<SzN�
U�
����vp�
{����c>y�nգC�c��P^�����u���e6���U
8�U��Ċ�l@�
-���<>`��$�ʄ�V���A2W����;O�(�e�-�YQe�/����v�N^N?@$�-�XT
-��J1D(
VX�D@�� �ǂ�^d��O
Ym}d�Y�)���lB�z�IL:��s%� ��'��u�*��y�v���jb�VthOީ~�AQa蠮�d�6_���<P�jY%lo~�d� {R�����z��ܸ��{2�L������-�P�]G*�+�J���$���c,*E��v�Bf ��ʯ����u�
s ~:ϧwpV����N�S̑�l�eڄNww��qD���_g��C�	o/���X�s�|��f��b�F��Òze��f�M�8�_2��M`}�����(6��o
-��J�z-�*��4$�� Em8Y���Ls@�u�uwP2Dy�5�2�|9Y-��2o�ڇG7
��tO�����6첏U�Ӻ�K'u��m�Gd�Ԩ��[��S���۞�g8�~��2ú�sd���se����ͷ���ܚ���yêּ�}�y#�i����J�y���<��r,����[$�9=V1B�DaX�wz�� ��sL��
&�oiIX�S�Ch��`� DL?a��&H���d����_�c��l��X�|�����a$i���$g'�ܐ=���P��B
IpX�m�m�M �J�5�n~\��Ax���q�Y_)���2�
���Fh�拲TG�pCJ�(����7����T�
�#�!�v� t_
-Ӌ��p�zf�}��@�"���6UQìP�?e����ŒP)F��w
|x�S�;��u����5�n�B�����DFAd2(�t��UGG˜�� KoF�1��U�e-��
-�&�x}JꤾI ��<�k��lW�Ū\�u6�36�`
&�- =
:��d�r��цC�-�>��#���[*�5|qdCd'oPf+�o�9�5}"�c�o�@51���&ۄ��4�1!�>b�ս��z��0"Dd��E�ݔ��
J�X�߈�a�
��4�D�Na�@���y����8��9S�hG4У�γYU�>����|��m5L���A}�ӗޏ���}CK�����a���	� a���\��5�l/�S'¶:����a`9Y�~ӂH�[�`Z�
SS2(7��*�:�<S�8T��
�
����6ux�j�1�l�C�D��=����
�^�gՐP���ԉî�������(<#+���x�]<�Y�l�0j�W4��+��Ṫ
-rJ��
���Ɠ7�� Q�A���%
�5R��s�T�
�r���Lw�]�f�^�A����P��%�M6VBf)8�:��m
r�5��YiM7�Xi�ol/���?����8�(A��j*ݼk7؊s|����K�7ڏ-��)�E�]��^�%���uWLJ12|�)�
Iw��
_���f4"���wwSZ[
��E_�U��������T��e�O��z�@��t���ט=1��s�̽.����
gM�2�����	\��6<��LE�*�G�͏�\s�k.�Ck}
�����֊��
B�2Ȼ����
����W���͡$.;����8�9\y��jO���p�(��Q
� ��
n0�7w��U
Nx���z�
K������I�������M�7��
��o`�Y���E���`o��/x?���f@W ��q�}qc?�k�c�
�����֢ �51{0�+;D.�R���>�nT�d�|.��F|.�	�l�
.ѵ��-�ؠt��Px
�{��&uK����=yݽ �D�kѡ:�A`�o��j���SH�󔉂������
-�UA�!�3�ω)R�~��¸
{y�X�o��v��v�ܼ���Ίߏ�U!����M�
>�mݑ�
�=���Ӈ�N����I�O�pqp�
-
��&~,˧뫫��u�|@��b;�m��A�d���~]��jA�n.
P��4��.!��v6�'�
�
������������,y��
�X�d�F
-endstream
-endobj
-14328 0 obj <<
-/Type /Page
-/Contents 14329 0 R
-/Resources 14327 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14272 0 R
-/Annots [ 14320 0 R 14321 0 R 14322 0 R 14323 0 R 14337 0 R 14324 0 R 14325 0 R 14326 0 R ]
->> endobj
-14320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.089 649.984 246.767 660.888]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-14321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.899 412.604 431.977 425.522]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-14322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.748 401.928 444.511 412.832]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-14323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [523.983 247.501 535.938 258.405]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 234.116 261.145 246.45]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.307 140.239 434.874 153.157]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-14325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.837 129.563 447.599 140.467]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-14326 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14330 0 obj <<
-/D [14328 0 R /XYZ 89 770.89 null]
->> endobj
-14018 0 obj <<
-/D [14328 0 R /XYZ 90 721.073 null]
->> endobj
-14331 0 obj <<
-/D [14328 0 R /XYZ 90 721.073 null]
->> endobj
-14332 0 obj <<
-/D [14328 0 R /XYZ 90 622.138 null]
->> endobj
-14333 0 obj <<
-/D [14328 0 R /XYZ 90 543.742 null]
->> endobj
-14019 0 obj <<
-/D [14328 0 R /XYZ 90 497.117 null]
->> endobj
-14334 0 obj <<
-/D [14328 0 R /XYZ 90 492.633 null]
->> endobj
-14335 0 obj <<
-/D [14328 0 R /XYZ 90 386.037 null]
->> endobj
-14336 0 obj <<
-/D [14328 0 R /XYZ 90 283.332 null]
->> endobj
-14020 0 obj <<
-/D [14328 0 R /XYZ 90 224.752 null]
->> endobj
-14338 0 obj <<
-/D [14328 0 R /XYZ 90 220.268 null]
->> endobj
-14339 0 obj <<
-/D [14328 0 R /XYZ 90 113.672 null]
->> endobj
-14327 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14351 0 obj <<
-/Length 2602      
-/Filter /FlateDecode
->>
-stream
-x��[�r��}�W�)!����/J*U��v��(���u�hY�E
R�j�>g0 @ I�cgS����3}9c��.�ɛ��\���Ո���N�nG#
QM���������Ж0��U���?~�z���;�������g
�h‚ E�Mng�?�d���'�g����E"��u��;��-t�D�;���%�1"��-O��%��h�Sj�T�f�aLSl�4Ww��D��PN���E���/�Y*
w1���De4�+�5q�4�����Wt�|X��x��Ÿ��pݔ���tn���$ܭg����v���'J��x���f���l���nkӄ�`m/F����a$�Ā:#��z��\�����܋���a�'�r��-�>w'��	��:vN7�����rD	<�+����p�
F5�F�D]�o��x^|�
�
���B���fZ*5�cMF�r�o�
@����x<(��0#��X��c�41Q~��J2���PZ��u�R�h!�
~��M�/�:��-��=n��
A�;��ә}�O�����r��ݾ��P�"�6�2\Y[���&2�$�T�B�4��
B'T�Ds�T!��7����r(��|6����B;q�)OETKa�ۦ
-!	�f����ĩ#(:�^M���ܟ=�t�٭7��}(-ܖuO+��&1�����b1~M1M>�~��l�]siJ����iQ<�-q���
�Ce>����:x��c5E�e��j�f:[�,K�!����n�#��7��ly�Z܏7��s|&x��_;
m4DT�|w���9؋[�6�f
.���M1c�h��m���"�F�2�5堶��I9%NF���ȸ�~ew�Nz��,y��~Y.j
��
�����/W��i:��zxƷyX��xH ���t�~\th+����k��,��M6�)�.$�7!��7�������+�U}J���^$�6j�9I���k�9STa�ÉOj���~���ӰB���5'�T��cѐn@��y�O�ㅯ��
�b��k�/y�m�|ۡ
-�;P�˩�ԡ
,��B?*59X�J|�f@��c�y��-�ח�I+�>�.��D��6�����8{��(>��������t�p�N�/�:s�?6]�(K����
-S�֯��w��^�oL������� �XU������ ]���~��'O;x��˩I���uG�r>�"Q��(ʼnE�
Y�(��,|�Ȣ̌"N��ij�x�B&��;���2e�T��� F"
�jj�a�����>Ccً��-�բ��\BSB�v�����n�R]-��"6^���b�P�z�f8~ѡ��i�>�f–(GE����M�]���j�R���3Xf�Ts��ϖs�����Z	i��Nd@��G�x�g�t���I��fՑ���g�S�7z+%���0)�zW�v�,0�����1&ES}��8x \�iY��
ܕ�%��/ZM{.����5����Q�tP����A
��Q�e
툏�;�6�
�U�alcVV�b�R��V��e�y�f]�T�
-^�1o
�h�4"[�v^�y���� �PfO҂���؁&4f8�:
EQ��H ���NK�o�^�� F41��vb�OX��B�F� �+8�+l~[�v� �
��&E|b�=
Cc��0-�V<"]b�:H��)ϭ�Di-zr+t�x�
�\cC��➧�_��>ޘ�ՇH�c1�[b��c&e
<!HZ�0.9B~�<�TE���:M�nTմ������/���w�|.TbK
P�'�E�<
-�"�;�z����b�$5�!RW�*���A�
-Gӿ���
����%>�PA8,���E��|��t����1����L�g
-5��3� ��#aPsZ�H!���B���D��Ю����AM7�+�6���nN7�T?喙o��T����=���=i�Z�B%[��;�04�rw
�DL�����t,G���z)rt=�(�j�^
G�cj�~����?�i����Sd�e��D�i�b���d�e��K���_�p�xizXqE�r{Xq�e�v���}�x�|W��G��;�d��a�c{Xq)T���`�q�Ɋn)n�I�
`�[l#�+ at v
-5-
J�Ћ2��#Ņ3DkcfIi�04fF��"�
-�q�v�(��Q߈��Gb\�
b
	���ٜ7iqL��3�u3�Zib+P��`K�C�����I�c@�ŃV+Y�4/�#��pb�
���:/.T//>N�[����}�v�]}}^\����V���/���TL6!�ļo�LA��J�sfYijh���d�z|MZ�xc�W"���_^�K
x���G��9E|��^�Du�aUW�tb�x���rb��	��s�0\��ˌ3�bԨg1�'�щ��
_�?ޚ���"e�_

/�y�8S�H�Ggƙ�ܑQ)�/ 3l2�?T���xM�	�x�c1��1��,���1�
;�1�ߘ��*3~��i���+��I2����o�81\
����Y/���L~�<������e�M�����H^� l+ny���2�X��e�_��I�%�����_�4��P�A�������]�'_Z�ٺB
#4��/o�ߥ%���w����r��Q�iEM7�����w�tyGd�2lۏ
R��6�m����*+
�-�p���Dr}
��� ���

-endstream
-endobj
-14350 0 obj <<
-/Type /Page
-/Contents 14351 0 R
-/Resources 14349 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14272 0 R
-/Annots [ 14340 0 R 14354 0 R 14341 0 R 14342 0 R 14343 0 R 14344 0 R 14345 0 R 14346 0 R 14348 0 R ]
->> endobj
-14340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [523.983 609.635 535.938 620.539]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 596.251 261.145 608.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.631 503.652 429.297 516.131]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-14342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.215 491.697 409.977 502.601]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-14343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 360.149 267.79 372.483]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.883 267.551 440.282 280.03]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-14345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.008 255.596 420.77 266.5]
-/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
->> endobj
-14346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 124.048 267.79 136.382]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-14348 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14352 0 obj <<
-/D [14350 0 R /XYZ 89 770.89 null]
->> endobj
-14353 0 obj <<
-/D [14350 0 R /XYZ 90 645.466 null]
->> endobj
-14021 0 obj <<
-/D [14350 0 R /XYZ 90 586.886 null]
->> endobj
-14355 0 obj <<
-/D [14350 0 R /XYZ 90 582.403 null]
->> endobj
-14356 0 obj <<
-/D [14350 0 R /XYZ 90 475.806 null]
->> endobj
-14357 0 obj <<
-/D [14350 0 R /XYZ 90 397.41 null]
->> endobj
-14022 0 obj <<
-/D [14350 0 R /XYZ 90 350.785 null]
->> endobj
-14358 0 obj <<
-/D [14350 0 R /XYZ 90 346.301 null]
->> endobj
-14359 0 obj <<
-/D [14350 0 R /XYZ 90 239.705 null]
->> endobj
-14360 0 obj <<
-/D [14350 0 R /XYZ 90 161.309 null]
->> endobj
-14023 0 obj <<
-/D [14350 0 R /XYZ 90 81.969 null]
->> endobj
-14361 0 obj <<
-/D [14350 0 R /XYZ 90 77.486 null]
->> endobj
-14349 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14368 0 obj <<
-/Length 3079      
-/Filter /FlateDecode
->>
-stream
-x��\[���}�_��V���/�
�憤.�:۾8���⮅J�"i��g�����q�FPK�����|�#��F�#�/�^Q�׿�\��ƈ�#Ns=�y9:2����f6z3f�>�2J��Մ�q�Y&��&��W�o��&�}9��$���ŀ�<Y,>ܾNgO�����f��x�?v��n��
c�	��:�����i�	k�•#�b_L�\��W���C��9U~��=R�i�\$�m.�f��8]��.�_M�0Di;�2F�R�7^�i�X����$��*]��J��W_�\�|�p��XP�T�������Ot4���q,����0h9�\��p��+�8�p^��</,�Տ�"Dqf��NZ*��0�Z�o7�H[�}X�Y�L�%�q
-���5퇼�ж
v�����j�;�Δ#�M�
�泮suD����0;͏��t�h�)K������d
ϼij�Ԑ��2uLA��*#���[=e�tvA�$�B������#@��YWA�|�"L/���K
~��g���Gc��3KΉm�;_&3~�La�У4���
 �Q!�_�ܓ�<�[TFbj����-���XJ6M��v��߯��c
\eD9��<K���׿�s����WY�l+���R~׵dK��F,����5|��Zwg
Ds2n��Y<�2�05���Q6��>I=�c��C=��{GJJ��g*(�&Yr_��`X��4�
��YF��UE�
d[�J"�
-��,��m��n{}]�V
Q�cz.aZ4�ߤ0�tS۶��
��,n�f��<Kv�
<��?u�
~��*�5�{�ʊY���7�"v��w�����5b��
d
�p�|����g
@����2={�nCh��C؂��Ϳ���c��ǻU>�1�\��n*:��1{�ؽ�o�1�pM�R�Ai>)<�c��ƫ����eN���2�8��wo�l��:E4K�
-rU�M
ez�n

����j�&
,#d�<L��+<ޤț
-'S;x:⌰���PK���6�{?N�W�m���s�,[�'����'q5�')�[~<}pp�ia��*Q�C���t �"�~�B���e>�61��>��Di%s{u�	�`{X(��X�1�F���F�g�oh*)v�x6u�Uw쭃@5�
6��BKxfꆜB)	��^�!4�3:��[N�lV
-�"
�H���cZS��H��
2�/e�x�ؾv�����C��]� ڇ�v��ѤV�t���7RH�
 pD*
A�)6c�2�eP�*�A��-"��~e1�qs�:t3AS�4�q\7��w���o�󴞡\���}ȯ�r|�M�N�&�p|c
-1�
�X/�Hu\�؊.1�rn)D
l��-Je5)
���6�UI鶞�ذ�tC���
-a��2���D��D�b��>-���<�
��V&�yp�.�j?D �
t�%�3n�E��<�
�Ȧue�Cݰ�t�����a��^L�]��~�h��D�E��77���\Ǟ�5���4
-[֝ =
�!��[}59ج
���j�\e���=ѪA1��P�M���p?�f���Ræ�*RD
���rV��I�]��E���Iy��d��NQQ��
���}>-v�Da�T��%'�
gЏ[T&f2y�������a
�� NB�"����t�
�v4�>!�VT"v��.P��$��� �ŕ����pem��k5��>�©*dl���q7�8��Ȥ�m̢���ͮ���D��b>���S��Q�s�͢T��O����
-!	���F����X4�y�v���
V��x��՘�(duWk�DՖ�}gw����'����6��{'�
9��[ߖ%�a
,����|��|�!y�r�Vo�DF��~]X��ȇm	(��ݬ�絴��M6���́6�է�
�e�*�*�ʴ�S�L"t��x�tm�S"���y�}f���'�e�N��˩�C�0F���@M}��8#
�;���:Ai\��1
� ��r�R��m���c��� ��	|�b�<�v<4=d�"ro�=d0
�id0e�92� |+Ne,3�Y�P��
�	Ğ!�%�M28P�_��� �4<
-����|�BkI5AT�V�'����"ǘ��J�5gFN�b���{a�
e�dF��VZ��%,���&
-%�ei~[�p
���Y
-D
K�
�b��^�q�,Z8��%-ܘ�3-|H
�6-Lm-
�P:F��),Ӥ�1i�3L]w¨��b0�~	��
c
{fK̰��Qf��0F��.x|
-3l
�L�a�
3��2Ø
-���mm3\�Bl��Na��oƒ�X�
f�{<}3���a�`�sfX}Z̰06X�pfX wW�<bX
$�����E�jG��VB �
gg�&�}�ƕ?�>�
��Ζvc
�1|���� �L��؊-1��IJT^X P�\D
[N7������ዷڏ�ǘ�Dt�9�(n���"��]\�
\O7����Dx������<��_�K
��
�9&5�
ܝ��
��N��W���
�_���
z��%2�"���ϣ����j��"|��
�G��{�B��I
@
�&/���p�}��pk��QÍ}~��?Sÿ
j�b��w���{\���u��g�a߿�ޯI
���	��	Ki�԰-������
jx��`g
�!2�����t�Q��\�H�ۮ7�QzX&cL+�,mN�N�Ë�T�TI��5�a�㻍C��Qij}���ۿ�8j|�y%�	��-��hO�+0|��[
�����@k��d�yϛ�<N����IY��嶪k�ր�O��p�<�`P��K�����4ͺB���8�I�6We*�3���:����8���T ��h~H˖�b��TcRb�D�Bp$��s��P�7��'�*�O�>��P(9
~�r~��P�K��I���
%�a�.Z�q�e���gY&
�gW�T�f�L�e�M��LK�OưQ��K�gj��닏��v QѸ}�!"���
�� ���>%�,E�򷛾"��~��W/��ܦ��O����I�T��[~��}�f_�1B�V\���k�>2_�G姿]�”DfZEз����ŋ���m�=`�0�����a6
�jt�*q6�ps�AR&��P�j�KM@�?C����/�W�

�_,n��n)F_����?��_���
-endstream
-endobj
-14367 0 obj <<
-/Type /Page
-/Contents 14368 0 R
-/Resources 14366 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14378 0 R
-/Annots [ 14347 0 R 14362 0 R 14363 0 R 14364 0 R 14365 0 R ]
->> endobj
-14347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 648.705 422.924 663.421]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-14362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 385.253 425.662 399.968]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-14363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 135.034 322.446 145.938]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-14364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.18 135.034 505.099 145.938]
-/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
->> endobj
-14365 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14369 0 obj <<
-/D [14367 0 R /XYZ 89 770.89 null]
->> endobj
-14370 0 obj <<
-/D [14367 0 R /XYZ 90 619.095 null]
->> endobj
-14371 0 obj <<
-/D [14367 0 R /XYZ 90 516.39 null]
->> endobj
-14024 0 obj <<
-/D [14367 0 R /XYZ 90 469.765 null]
->> endobj
-14372 0 obj <<
-/D [14367 0 R /XYZ 90 465.282 null]
->> endobj
-14373 0 obj <<
-/D [14367 0 R /XYZ 90 355.643 null]
->> endobj
-14374 0 obj <<
-/D [14367 0 R /XYZ 90 252.938 null]
->> endobj
-14025 0 obj <<
-/D [14367 0 R /XYZ 90 206.313 null]
->> endobj
-14375 0 obj <<
-/D [14367 0 R /XYZ 90 201.829 null]
->> endobj
-14376 0 obj <<
-/D [14367 0 R /XYZ 90 117.011 null]
->> endobj
-14026 0 obj <<
-/D [14367 0 R /XYZ 90 81.969 null]
->> endobj
-14377 0 obj <<
-/D [14367 0 R /XYZ 90 77.486 null]
->> endobj
-14366 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F7 795 0 R /F8 794 0 R /F13 834 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14383 0 obj <<
-/Length 2607      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~�_��îTeap��=��>R�:ά=�ڔ��H
���I*�����K���0��>�H�@�����0�"��<���������|�X���T7��Ɓ�		�Y�aą
��>`2DDK�e�_�����ۛ���ū��O>�8�0��.>|��
�������v�*��s�����pf9]�A���	F�"��
O�xTƫ�2*c���k�L
)"�T<�Ս�WH�P>��4Z��	Ur��3x�j�#m}
�>��a�H����R��vƵ�F�6�|�%37�sFD#�E5�zL�(�W�����Q�|Xij<���s�P�����
�nΛ�.��+?�L�����]<�L���u>&�(�Fٷ"!�!��V�/���f 4��{lj��ǜ��\]}Nfq���]dZ��R����zH�u����ǀD��%E*�EE��Ss�x�
x<���YZ�=�5�� �h� Β;��1�ʝ�^���+w ���l���"��v���O�a
ry�G)�6�b�՛�.G"����Yߚ
-��-w�6�7 ����kroz�7"ސ�S%}�� i���t���G��C�|-�d'�KpA!h�"
��ϭ�� �����sDC�+�;
��>�r�nL�*Ǥ�E��,K��ݻ�4[�7�1(�W5���оq��
�i�D3D�)l�G�
���� #W�Ѻ]*iU;w��!�
nܡB���n
pDxT;�����G�ޝd��X:�7q:�����i�Ge�,

-�Q��,�H1�W�R��"�.|���2[�i��9玻N�>�/�a�f_
|;�G�Y׺g�3>�SVI�����3���n��2�	F�D
-�'a�� �E9���GȨ���~�”��h�m��9bD
F
�pG�ߗ" (

�@
"��]�.:up�`H
-�p���
���'�б1"%�Tu�x�th��P��I�Zg�
���jS�Ю; p՘���Wi%&��f�瑤��d?�@��19,c���/��(4
��
��StP7��֝@�k8̃\A�p��
-���������6ύ�Vb���$K��k��$-m��<�
�Q�^#?��=�_�sL��e�z
-�΍C�E xI7����
���$ˆ@��j�el��
@uc;ZTvAΛ��E��0�^/:P�9m#�|����ۋ���DM�*U|��i;}?k/#��x�H�O�� /t�y�{���(J��4��)�F���$���@0���X�՗ilU�H�=!�
-�
��C��ZA��
O�9
����3�-�'�&i�H�~hRH�=�<��.Bf��K\�����
-Bۍ���6��L��U�����
	1t��� ��U�LS
�j7:b���n��f�g�;}�.%���s����I 	�u�P��Y�S�EM��$IQ���=楘��=E/���&ٰf��G�w<$HV�.���
_��X��[<I|%	^�T�Џ��̀K�z*x*D��K���'��@�( CJ1���*�]�c�H�*Ǧ��Yڳ($7F*C,J9,����� �� ����e�Ņ@�o���a[��T�Se�@'y�� ?���$���eT�@:Marjg�2�����z�/�&�|����?�p�������Ge�ٍ�0Hd@>�
�>o�ΊbK������y+n*�v ����ʳ<[�k<o��%��q�Q~j#cie?�i��γ|���֋�T����ujH
 Wj�`p��2MmZ<H�?�i$ޱ%F֖Nȶ��Qo���親F��/��f۾dݱ�V92n�*��9���bU49�Ii���ګ�$�|@%;����L��b"o�2�5���
��,;� [...]
-k'E�S�iB*
�]��|~ |M���ˋ��5~3G
o%

�H�TEs�5��L�oŦ��s���ӈ�����^0�m�s!q�
2�<��>a�K�-�
����{�̕�Ȃl����Q������ЀN�O�Ϙ�c��c�FK���0�L�lp�&G�3kP��Ϻ��z~�J
��9p�d at 5�=�O��
V�’"�
���@?�YT\��;���g�Ta�E�K:�
�Ϡ���X� (��\.H��_
衿��涹���
kZ����q٣X���'G���[�i�ƨ_�0�\��esdz�����
��]�.�4�V�Pn�e�$T�AJ��:��-P�#�^+1L1L51���!�@=��:�
�C�.����w��3��]U��h�	�u��y`����a�@�b�Uw�Dt�m\
m�/ʏ��=&��
��ke
�UC^<
N�f
�Dx��y�
��&:���ׇj�qqJ��4^zӍ/��( �z�0o;FN�kf�5
-�FQ��}�W\Z#����2��f�4K���yL�|vb�r���ꖡ(�T����St�
-�T�p�
�(���&�Od�_k�,}�,����W
-[��C������� @
����vEHY ?���(j?����j���nł�k�M�ޤ!XiIZ"�K�	�MU�v�����{����?�`9��!J7������ܸ*�	��]�O8��qUp|�Z���
�[��Ds��(������f^��
��f�����?��
F׳�x�B�*2����*�?m��
-endstream
-endobj
-14382 0 obj <<
-/Type /Page
-/Contents 14383 0 R
-/Resources 14381 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14378 0 R
-/Annots [ 14379 0 R 14380 0 R ]
->> endobj
-14379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 566.855 362.353 579.189]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-14380 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14384 0 obj <<
-/D [14382 0 R /XYZ 89 770.89 null]
->> endobj
-14385 0 obj <<
-/D [14382 0 R /XYZ 90 616.469 null]
->> endobj
-14386 0 obj <<
-/D [14382 0 R /XYZ 90 538.471 null]
->> endobj
-14027 0 obj <<
-/D [14382 0 R /XYZ 90 503.801 null]
->> endobj
-14387 0 obj <<
-/D [14382 0 R /XYZ 90 499.318 null]
->> endobj
-14388 0 obj <<
-/D [14382 0 R /XYZ 90 416.632 null]
->> endobj
-14028 0 obj <<
-/D [14382 0 R /XYZ 90 328.049 null]
->> endobj
-14389 0 obj <<
-/D [14382 0 R /XYZ 90 323.566 null]
->> endobj
-14390 0 obj <<
-/D [14382 0 R /XYZ 90 219.126 null]
->> endobj
-14381 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F24 529 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14398 0 obj <<
-/Length 2418      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~�� �����x��X�ͥ����uܢ�l 0m�+�^�N��33$š)ʖhl
-yMϜs�\��3��u���������b�AFR]^EGJ$(�.�ѻ	�H��`�'�S�'q����S�'���&Y�����C
��ggՀr����dy�H���|J�$�?����N_Қ�*��᠎��/~H��@��G�$�NgT��KZ]\��
#�w��!����:.
-/�rj�$�ܮ�2��E3�RG3B�¿q�\%ΰ$]�q
k���Er���W�'����#���R:ZlN޽��n�aČ�>�A��S�����?Op�R�/��^ڟj�@��*m�<R��^��3o�Y��e�U����3��r��IZ��oʛ$O��rW����\m�����^��y��I�m=��ɔ���)�J�U�<�
D"�o.2X�����K��T�P��8�k��?�2��߼�������
I�̍���w�>c�x����V� k[%P�
-�N�j��"�,�PHq](�o�4�ص�R����s5�>�����M
"��tr'���n����I�Z�%�#���=d�Ӎ2	/�0�+.�r�̠[�N;�E�������
ԃA��j���˩�,��	�XGR@�h2T(2�4e�a�3Α0D�5�3��/N�i�FL�Q�U1ޙv��$i�����ܜ(x��17�0��p�8��3g6��(�2�8g���C��x�f�+�'f���
��q�ܦe
i�]�
t�&�6}
z�V���� ��v�V�z�&�)�3�1���fJĨ���e_u�
�hVT�eS�R�>���c�]����m���
�ߢ�A�¶�,��T=Ȫ6v�ۈ������G�ި_��
$��J�qSJViG��&��e��lDa
l'T��@�B Ct]>��BW�$��
dR���
>��.DZ"I�0F�����>�DD����VjH*��|
���:��p�� �Eq�ɻ]E x�c�1���Pjq���
�A�D{oΔ
��K4�� �E� [...]
-��5�1��nþ��ųо˛<s��v�,C�_j�z�^�40 at a\��L�|؀Ax݀A~PL��'����������j��{p/hu�4W��Vb�@6%K�t�v �*٬�����A�
��|��?�ݼ�F��a5�Ix��
-�ey��%�~&�ȏݙ
%D������
-j��!���+���Y.�\]�\���X.�#�\�Tĥ���h�+�Š[�e����Z�K:��e����v,7�y7ǥl�)-Dž�&��m��
��2]=�t��"[��1]��2�e����Dž!���t�bM-� 6
-��#҉�%:�̀��Fe�
d
�2z��d��� 
�����ؽ� Ri>f

,�i��	
-K��K��5wL��
2}vQh�̌�K[��
p���cy��ռ�c�a�4��+/�by���;�A"���#D�e�T3�l�r�TU�TyީU�!m=ԝ���TA��=���8Rʰ�GJ6
-��tv��:�A�FB�}�����j������ToI�"K��i��
΄AIC#�"Á��3���IXZȱʃqQ������
��{Z���ɞ�����A�'��Q�
��4�=�?�E��A��D�w�����偈���}��C�

�
-��֝�L�<�S�
-�� �Ư�CsX(w׮^����$�	�����7���ߋ� �|�^$ٷ��k��J�o����Fo��L��rF*
��	#�Q����U
ck��Z}��`�:aH⪚�P
I*��ln5ǐ]�m��%P
!���|�T�&^�@�s#^lW���u^� P�
�QL���Rڍa����Sb�Y75j���(�\�)AK��� 1����)���Ք�c�a� ��M	W�0�뢤&AM��Z�ݍ���^Vo� ��|w�3����O��8,j�`�m�{$X?xew�H�B������
��WW� �ӯ�H_�&�V
��&/�dB��
�]=�d�l2���6u�D�"A]���
��# �$��
��̞�
cRm��	g
>o(QS>D��Š����
]��U�a��I��ki��>�������G
z�Egc����G���:0\s��N����Gq�,V���&ݏ�Wy���-�.T���,{�A���B���G�����/���o�ſ�$������?��]\kC�뜻��n�Z�h�U��W�������­*Dp �MTܔ����釻��
��p�Zv@��b�ڃ����)�ܸ����j:"&�V� g��j��Q�׺v����oX�2o��� �;��
-endstream
-endobj
-14397 0 obj <<
-/Type /Page
-/Contents 14398 0 R
-/Resources 14396 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14378 0 R
-/Annots [ 14391 0 R 14392 0 R 14393 0 R 14394 0 R 14395 0 R ]
->> endobj
-14391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 507.826 379.76 520.16]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4a53183970490595ac39c8c070601c6f) >>
->> endobj
-14392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 320.343 379.76 332.676]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4a53183970490595ac39c8c070601c6f) >>
->> endobj
-14393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.217 227.744 424.652 238.648]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-14394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 172.461 335.755 184.411]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4a53183970490595ac39c8c070601c6f) >>
->> endobj
-14395 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14399 0 obj <<
-/D [14397 0 R /XYZ 89 770.89 null]
->> endobj
-14029 0 obj <<
-/D [14397 0 R /XYZ 90 683.788 null]
->> endobj
-14400 0 obj <<
-/D [14397 0 R /XYZ 90 679.305 null]
->> endobj
-14401 0 obj <<
-/D [14397 0 R /XYZ 90 598.775 null]
->> endobj
-14402 0 obj <<
-/D [14397 0 R /XYZ 90 545.086 null]
->> endobj
-14030 0 obj <<
-/D [14397 0 R /XYZ 90 498.461 null]
->> endobj
-14403 0 obj <<
-/D [14397 0 R /XYZ 90 493.978 null]
->> endobj
-14404 0 obj <<
-/D [14397 0 R /XYZ 90 411.292 null]
->> endobj
-14405 0 obj <<
-/D [14397 0 R /XYZ 90 357.603 null]
->> endobj
-14079 0 obj <<
-/D [14397 0 R /XYZ 90 310.978 null]
->> endobj
-14406 0 obj <<
-/D [14397 0 R /XYZ 90 306.495 null]
->> endobj
-14407 0 obj <<
-/D [14397 0 R /XYZ 90 209.721 null]
->> endobj
-14080 0 obj <<
-/D [14397 0 R /XYZ 90 162.195 null]
->> endobj
-14408 0 obj <<
-/D [14397 0 R /XYZ 90 157.711 null]
->> endobj
-14396 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14419 0 obj <<
-/Length 3162      
-/Filter /FlateDecode
->>
-stream
-xڽ[Ys�~����F�Zap�t���=���8y�L�h���+�Z�Z��}�	$(��͋E`����
�N
&t���_o��}c�$%��zr���tbdJ������T��������R
o5���ϟn����#�]}}{���!:a��"&��7W�>��
?�D��䱙��H.�w=�x��+�x�+���!��8LRB��&H*-7ﯹ�f�l������rt��Q;�cG;�	Ɍ�L���z4�P���t�SMUcTa6#�R�V�}{`��`��r+��2�2m�|J^Lsx�Fft_�Lk�r2s�ʯg\;ym/��S?r�{p�|��j���{)��u
X��P����뽥6�v�|���EQ>�Gu�~���l�.�&/�EU�ù�n|�o�k����|A�e��&�
2<ixHR�K���)���5���U�׿��m�H{����ZI��Q�����@$'i�[P�h6n
�#Pe�ˆ�
��9����Y�|�
��*���DRa5��77Ey-)��u����!��� �Q�=��$@���݀���F���i3�� �p��\�>oW�ꚫ�c	��ٴh�ϻo��A�$I�<�K�����O"i��9����9!�j'{���9���W�mVٚ�Ǣ^��V�{����u:P„�@��|��sX��
-3�I��ɬ	IH�YQ�
�,��/
�^D�a��G=y���"%B��]N�5P�0t�X���nT� )�1%�!A���1J!G��:�s+qp/�rŒ���팀�!Fz��Oۼ
z�z��_3��Ά���F��C���*m��K��oD
�b�-Y�Ko'�G4��6�
 IH��U��ew?��l�䬚

/g�ʾzs�^��l�~���/�|q�
R2�঎m�Kb�Q��V���C1%
-��.b�7<*�K��ƃ���
�	kS�&Z��u�+�fyl�BA�T�!%���������u���]d�Đ���Z�v���:߸����L�UTh$� E#f	c
-������w�$��M�=
���
-q
t�x�I�1ݩ�2�脽p�ᒜ”lhɄ8��
���ρ�E� l�l'}*�5d��A���K1F�� TQ�
?(��pp
.��5סf�M��ɖļ��
-��˪��Ճ��d8��!�٢!|�X�
'
�Ā�X�L!l����"�{
�݀P 4�GY�G��d�ę��a�>��H�/�5$
��g�?�f�e�m����$���pG��@\��|���K�E⃭�H|d�1(
�4��3�1�
�G����"���@g��(?��n"H���g����Ay��hJ���?W40�e����=�rHR%��o�y K-�`b ��
-��ȴ��R��d�d0���L��?�-!�JŹm��m�~,OOG��PB�F��7�-������P�k������	��'���~^5!�|f5�tN
�g*�C�V
i�b�R�A2c!vxF�ɶ�Ze�C�G	�E�7)���1XI���Aw�!��E��29�<�_6@�<��}&�ƎǾ�ϛ��`�����j"�6��7�|+$����%�Q4x�1��q:�TM[�n<N϶�A�
��Hޟ@�0�f�y�;��g�'[�v�;z
/�N�f�
�ܹ�w1�^�uD΁@d�u'��\?�mU���""��
-K�˴
%�Mʇ��
w��j�މ�vWa��m�e�8��t���
kS�X�J/ݙ �ڬ�M�K�MZ	�Q�[\�y����O1�Ռ$J�U���Z����`ײ����!�Ʒ=C%A&Luz	�g�:TR˛+!����
�<l�[$ۚ�к�S��0��c*�9��}k at G�o^���Ep3
-\�Ԝ3
-����俤r�B`�X9�,�?\
��M\��������e��H
T ��k��s��o�$zn
p�ϭ���%�|^,��t��?�;x%Dҧ�u�l�:]�>���;?m,@��K��k)
k�Q�\C����~����H�0�h��{�̻� 	�K>�om�<ٴ,�E>���Z�mg�[D�U�ؓx� �i�x�E�3x��
u�4R�z�30 5���j=<��P���
H�~��W�j�%��,6��
�k@ �a��.��2&[���]��
�x�3]�+2$f��
{a�^�C6Y��.�p�����xӹ"���[���پ�le`�P�	�]�k�z����@{���|$1aEz(9$U^�
�+��)��<��]�z�(�Xz
�x�}�h�
-�C�21�!���}n�P�Zؕ��e�s�
$J[Smg8K�A?�r�Š�����_��w׮Sr����_/*�S�X$��2�,�߅s
���=�[C۷���	@m%~���J���s�x����x�8bz�&���(���*.0��@��
6��7��>��$<_�+�M�о[
ht~�w(�`�{7޴B'�
�'�J@ ]
pJ���o6�:Wc���2]i�2��jsBU��
��V
ψ�X�������6S|y����Q
-�/�m�ܖ���
-�H�`貴�ˎ�7��-��u��G�D龻YƲ:��7�&6B̲1��A���^r�;LV�E!ؘ����Nur՞��*4� ����B�{��)*}�#�
-Ю�;+�&![>�Y��X�V	�Lc�PD�.x�-�#�TMhw��L��^��ƚ�$�>��%FB
��t�M��An+��Ń�D�cm��;l�q��e$�.޾�>苟KeP
�M�H�1�$;a
*!�k�,�,��t��]�� %K��
Rp*zV��x.��z�Ǜu���	1ܮ����zx�z�W���P��=S�"|(RC<�;���wyܓD���N�욆�����{�y9_W{,a"ݤD���zK7��A���E�Ơwk
=�������0<
�
D!'6�z�y��ۡ�E��E�ʭ
-������tmٯEp�}�	WV�0��m/���~�+�=��H
^o
�k&$�z��b�է���6_�"/�@���
}��N&��#��aCT�4,~\D~�BD�]7��;����6b�U�:r3�7���t���TF$���	[���h/���w�Vj���Yyh{<�U\I�9#ԕy���y
�,_�x����Ǐ��ͼq��z{��������W�cԽ�u�}�:��l�
n��k
u����W
-endstream
-endobj
-14418 0 obj <<
-/Type /Page
-/Contents 14419 0 R
-/Resources 14417 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14378 0 R
-/Annots [ 14409 0 R 14410 0 R 14411 0 R 14412 0 R 14413 0 R 14414 0 R 14415 0 R 14427 0 R 14416 0 R ]
->> endobj
-14409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 695.509 243.45 709.457]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 643.25 485.603 655.767]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.376 414.142 385.519 425.046]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-14412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 214.91 174.682 222.437]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.953 160.231 216.525 167.757]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.27 160.231 291.843 167.757]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [488.213 86.288 513.996 97.192]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-14427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 74.333 219.384 85.237]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-14416 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14420 0 obj <<
-/D [14418 0 R /XYZ 89 770.89 null]
->> endobj
-14421 0 obj <<
-/D [14418 0 R /XYZ 90 720.814 null]
->> endobj
-14422 0 obj <<
-/D [14418 0 R /XYZ 90 667.125 null]
->> endobj
-14081 0 obj <<
-/D [14418 0 R /XYZ 90 620.5 null]
->> endobj
-14423 0 obj <<
-/D [14418 0 R /XYZ 90 616.017 null]
->> endobj
-14424 0 obj <<
-/D [14418 0 R /XYZ 90 520.09 null]
->> endobj
-14082 0 obj <<
-/D [14418 0 R /XYZ 90 485.42 null]
->> endobj
-14425 0 obj <<
-/D [14418 0 R /XYZ 90 480.937 null]
->> endobj
-14426 0 obj <<
-/D [14418 0 R /XYZ 90 351.047 null]
->> endobj
-14083 0 obj <<
-/D [14418 0 R /XYZ 223.966 77.486 null]
->> endobj
-14417 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14436 0 obj <<
-/Length 3113      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���S+����/nR �f��)�qܼl��h[�D9����3^�J��E�b� M�̜���g�ξ����ū7�eIev}��)I��$�^d�&#E�3�1���<ɫu~�vJ�d���P,����m�W�./À�2_�>�\��y��y[M��l������_�!�7!U
a�a9n�/��hM��L3�5�b:�O^�ps� �2F4��m�j;�?Vy]{j�SC'��q�o
�Y6cL!!u6#!�W�]�6V�s?�c���
I.�}|�������8�r�����w��l���0bFgܠu�)��*����

$���^�܀V,7X
�
1�E�ݶ���4ED�� "�
-)���O�E��
�' 
{�+
-Σ�VB~P�eJjDr�7�Ek���2�����f�H�W;a��uw�eM�@��X֧�5��I�
_��ˆ��Z���p��3 ,��AVX-//�)!���y���F�5�d��ߧ�mZ���?&�i-%Ұ�~̽i
fU��<�*m�8�u�\e�ܔ֜��,pB;`�T�l���|^-��Uk!�?�F�ў�Yu�J����g�$AH��˺�f��D�K��uJaҸU�	Ӌx�
ۻe�Z�ůN
�3y�F����H���(���K�
-�ub�E��B#��n�|�,�s�������7^G�m$8
�UUQ?n�Ų�_mR�5����A0�
"
-ƚ1(�F�Z,�y!no�!�q�v�
-|��2�c��k4��[�Ҿ
�҆���EG��RDĀ�S+�}Dq�!��m:�ۜ#
��pf��:�+")<|�2b����e\7j
.@�c��
������*
W�9�����-�D��}��	Pgջ3�j�!�hy
��5�@���9��Z��U�ծ��V�ʧ�-8�ȕU�ӊ4w^|��Ң��1.u I�:�
�L��LZ�1�d)�/�o>΋�-X�?�GRA�%{�ύ�7���g���K��Q'(�+����H��#�EC�*���F
-f��%ɒ�!��../������j���`����	\�v��S�!�bg�)�4���GD�}[�<E�,���C����C˻DB�mzF��C#_e��t��g�f;
g�_ɓ�k'�{?%bR̷���9!�m�|�֍��F����O�
#����S��U���x��>{u���n����(|-���8�z��*����MQUS.&��H�����q̍ƈǹ���
3"f̚0\��\��qלւ쯶�i�²p�=�&��������il�V
��<��Ho��,2☚s�C 8
�(y��|C��bp7W���w��o����{Ӓ�}S�����v1��:�ӕm�G E��y���4w���
q
��P(�BB�u�,t�ѭ�n�u*�H�[�<���tZ���
QJ
-J�Z� �y�9|1�1�'�ۇ�
�n��!2�,M�QRw�pb�h�a� �
D)Ҕ
��Z��p跤 q���)O█a�L>��(���H��I�Km��Ȭ�o�k�
(M�c�	���z��d��{�,�Uk�}]�0GC]��
���s
p���9�`/��:Z#1����D鄤P2 ���3]Ng
�E�%A�A��$�λ�'�wl �H�	����c�;KD�
��&��
��!U5�������:ؔ�/M,tܔ�D�7e �I6e ��M�;�6�TK�1$!�B!�_�
aI؊%�􁞌����L+m>��i����̌KH<��6�)�I�R
���b��1l���?�:,3�,�!E�Դs@$u��U��"�y�EQ��J��7���Y8����&([}
�,��z`���S��$��V
�2
U2
��I1%�i�в�
!���l���sB�g��p��뵟�gCN3͠V��l�E��@�/\LB��B�u�m1����Ϡ$�o��|qs�(�뗵F`�;��#{?��n\�lN����[�P>�ZO�/EP
�2��b{�����e������i[�S2	�j׃f�C;؆E�Cz�m@���cw�,�m;�A�}�VEb��"�汨ܧG��NeึYdV�s�����tbb9�go:1���gš>Mg������=�
�S��r���l-�3��=
����պk8E6xOӕ?/n�C�t/VΖ�|�~��O]h���*(����h:�r�t��#�)
���>x����A�r��p��+F���|����/�%��4��8��1�ɾ^�mrrDGQ���qn��g��n�>oG�'�بӣ�5Qgu�/���)
����5�g�c����
�&�M8�v/^�W�H3�z:��s$Y�Q�S�>�tH��O��1��öp6��� �;�4��F�
+��t����t6����Z
n���: �\#B.����w#�m .�Ok��R����	,��޳��!<�47��L<)~�W�Q�O
�I!��st��6~XV�U�F֜ƀE�E8�e��r�
-�P}�'%����8qp�&�15�8��x$��
c�YS^�
y_K�"�C��}W
�Au������j@����v�2P��e��o(��A�� ���{�0����8�5P���6�7i0��� ��#�}j�B^Mk�&��(}`C��0?ХhR<n
4��_��("��
�R�R&ץ`��.���J7aI�cѥ���������Y���1
��6���1F����e�2��Z�
!w���Ӈ�A��(���F��쮊�S�8�p����2���5��-Z̮J����g[�P����f�;�=#`k��)_4�q�z���>v:��tw���A"U3�����S��E�[�L����+M���R�C���ɘ�!mW�Y��X�����R�'�
-���G�wX���5�1������Z���P=��
��������Ǜ�r
@9���f��ӍwH��;?/�0=;���M��aS��jú?� �۷?���E���`J��K�y��e�?bVu�8 ��,u�OE���˚��cc�R��H��l����^�>��Ey������� �Zi�5�VכF��%<\�0M�d[mB�$%m8����֝�9[�׻w/�ÃW߭Y�z
�q ��;���
-endstream
-endobj
-14435 0 obj <<
-/Type /Page
-/Contents 14436 0 R
-/Resources 14434 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14378 0 R
-/Annots [ 14428 0 R 14429 0 R 14430 0 R 14431 0 R 14444 0 R 14432 0 R 14433 0 R ]
->> endobj
-14428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 530.392 379.76 542.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4a53183970490595ac39c8c070601c6f) >>
->> endobj
-14429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 488.294 182.164 499.198]
-/A << /S /GoTo /D (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) >>
->> endobj
-14430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 378.973 243.45 392.921]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 302.405 535.938 314.923]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 289.02 226.824 301.354]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 222.188 362.844 233.256]
-/A << /S /GoTo /D (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) >>
->> endobj
-14433 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14437 0 obj <<
-/D [14435 0 R /XYZ 89 770.89 null]
->> endobj
-14438 0 obj <<
-/D [14435 0 R /XYZ 90 721.073 null]
->> endobj
-14439 0 obj <<
-/D [14435 0 R /XYZ 90 646.048 null]
->> endobj
-14440 0 obj <<
-/D [14435 0 R /XYZ 90 580.006 null]
->> endobj
-14084 0 obj <<
-/D [14435 0 R /XYZ 400.69 491.447 null]
->> endobj
-14441 0 obj <<
-/D [14435 0 R /XYZ 90 484.807 null]
->> endobj
-14442 0 obj <<
-/D [14435 0 R /XYZ 90 404.278 null]
->> endobj
-14443 0 obj <<
-/D [14435 0 R /XYZ 90 326.28 null]
->> endobj
-14085 0 obj <<
-/D [14435 0 R /XYZ 487.765 225.342 null]
->> endobj
-14445 0 obj <<
-/D [14435 0 R /XYZ 90 218.702 null]
->> endobj
-14446 0 obj <<
-/D [14435 0 R /XYZ 90 104.319 null]
->> endobj
-14131 0 obj <<
-/D [14435 0 R /XYZ 90 77.486 null]
->> endobj
-14447 0 obj <<
-/D [14435 0 R /XYZ 90 77.486 null]
->> endobj
-14434 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-14453 0 obj <<
-/Length 1932      
-/Filter /FlateDecode
->>
-stream
-x��Z[s۶~ׯP�3=Ҍ�PӜ�s���^R7Q�I�C���)E*$U���
���%7��^��
��bw�o0�b|5�����[��1:}��8@��r��
x�x����h�f�%��[|3fR#H��z��/�^.^۶ѳ����@
'@ ������;<���700
����
s���_�~
�f�F ��!�72�HQ����xR��&	Kc59}��/�B��F�/]��l�o;�7��k3�QE&O����E�a#�i$��W
U�THp�
�_�.01΃�GQF�yV��	�N��mL
�Y�$`(�����M�X/���[,�wg�ę��ҁ^
�
�QՎL�������%��v�e���Ջ=�Q��ٔ�I��q�$7�L�]���,�=���Y�NO�}
+c�txJNܼ�����;B�<�N��F B���6>
	@@�R[H��Hik�7�����P�`��ܕ;c gI�������f[œ�"J�	��C
X�p���<.M�:��x#b�܆�{��Mn
-��agi-��7&�th
9��-@�G
p���#D�@�!���zT3p�� �a�kC�>�Ї�!
݀l
J6l��Z5�A��n$̑
�Y�1��S�'Y
9�Ŕ��u�q*5,1 at +��
-�^��
�P ?�YM.ub9 e �H��
�Ɂ�[�
�J'�$+����0�
-���G���_�� ��	�f��n�Gg
��}������)<cQ�8n郇(��l�t
�+�@
惉ߢ�{�F2���r�6�!�Fk�6ZYBa��6�b��m�/
*ndW#\dY��hrϓ'N|�53�ĝE�
C��c����0c���w�
��P��y�z�+�?�QR�^�WRi�ǹH
���Z��\C���
�W%}t����S �x�*+ �j=4�2�6O}���
�̷��(Ts��_�X��U�ܸ���\w��֛,�b��[������h���H+���B�Z�M��qQ?��PG��X�!Ku�}����cX�
@5C��ɬ����nQ�6i��,N�
��H�
h`���f�˰0���wP��I�4��B�"�-�.ä��b].���B��h���&�
-t�ON�A�S�S�]�ọ��%��5������$>�Dzc�&9mr���INz_r"+~LN��tLN��f�1K}�,u� ��$E&���F
WP�\A�c�:&�GHR���KYl�cz���#��܆�
��Q���	nu��_i_W��}]����=�2J����a�6o*����W�^�O�{)����c����G����_�0]4��([n��C���w�H^&aQߺ����ʤ6����e�����,I2�t���+��-��.�wu����

���ߍ���~�73���$h��k��
D�N*g`c�1T��yfa
�����2'���+� ��Ζ1PY��˚�d;z	�IE��&Ρ`����fe�ܣ���O��{)e_���<g���|��ڴ�0��l�
��TMVQv5�W�2id
yKUNAGN?����j-����S�a����UV�$�]PD�2s��M��ٖ	�a�~�����Ȓ�7Q�Wz��  ���b
�S�'M.t���ӚܤK��R@T6- �kh��.[�nj�\Z��-�g����׺�0Q��9��_
-䡣�q���t�l#_��pP�pYܓ�K�
���M -�����
�s�Ҭf����qZ�H`�E�W�-B�Ce3{sf�ay��,K
�
8��ЭM����
�f2���/�$'��l�ax�UB���t�î;rX9�)��@��(E��������~q�b��O3։��j+�B1LKô K���.�e3h?뜝}�n~*L�{
����ô=�g�(�y�&'��M���<~m�8�~i��vT�َ>���[��f~zz��*Lz����na��8�Uj���Bm�5?��^�� AC�����I
-endstream
-endobj
-14452 0 obj <<
-/Type /Page
-/Contents 14453 0 R
-/Resources 14451 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14378 0 R
-/Annots [ 14450 0 R ]
->> endobj
-14450 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14454 0 obj <<
-/D [14452 0 R /XYZ 89 770.89 null]
->> endobj
-14132 0 obj <<
-/D [14452 0 R /XYZ 263.597 659.423 null]
->> endobj
-14455 0 obj <<
-/D [14452 0 R /XYZ 90 652.783 null]
->> endobj
-14133 0 obj <<
-/D [14452 0 R /XYZ 90 589.141 null]
->> endobj
-14456 0 obj <<
-/D [14452 0 R /XYZ 90 584.658 null]
->> endobj
-14134 0 obj <<
-/D [14452 0 R /XYZ 475.899 505.548 null]
->> endobj
-14457 0 obj <<
-/D [14452 0 R /XYZ 90 498.908 null]
->> endobj
-14458 0 obj <<
-/D [14452 0 R /XYZ 90 413.158 null]
->> endobj
-14459 0 obj <<
-/D [14452 0 R /XYZ 90 367.2 null]
->> endobj
-14460 0 obj <<
-/D [14452 0 R /XYZ 90 321.182 null]
->> endobj
-14461 0 obj <<
-/D [14452 0 R /XYZ 90 287.119 null]
->> endobj
-1946 0 obj <<
-/D [14452 0 R /XYZ 90 181.874 null]
->> endobj
-426 0 obj <<
-/D [14452 0 R /XYZ 90 170.287 null]
->> endobj
-14451 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F22 2996 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14480 0 obj <<
-/Length 1551      
-/Filter /FlateDecode
->>
-stream
-x��XI��6��W9�s�i3� ��l�4q�C
h�c	#K�$O:��}\$��2���'R���=���Y:�y5y:�\�
��8��3�vb�A>%�<u>���yS�1v/=�]Q��եG�[w�Lkq�._Ԣ���^�օ\ɲm^���^໢M��Z�f��,Ӽ\^�0��/�7/	�|�8�@<��'�eGF�����1�j�D�l��H��<�v?9 at oʕ��;SBP��f�B4�7�>v�^L]	ʉV���Z�e���8 .��>y1�|��
��>
-#'YM>}�N
-�o
�X
9���)��p>N~��m<�
HH�i�K|D5���;dB�
�����9
A�N?px!���:���1���A�p�zE��
�:�!}5Uë�Ĵ�5�2�h�#48�F�^����E��9h侗��H�_n�DydsP�<$��QD"C�3����^Z�?��8����#���-�w>c' Lk�+������}�n*EZ�
u�����z�/�L
@�T'�fOulUU�+������k�^}Ƙ���B��'fN�	�2�%�|�G���J�z�����Ҍ��@|������^�e~+�VѶu�Pj���2�i/	�#b��V�<=m4����W�_y_�9����1�g
J�Шxwvq�>?�Yn)�rf�h���:�֐�
3ќ�)#�{�S��ҿ�8U��.{��`AV�r��.�����Wu=����k���
���/���ѓ�
ʎw|�$����@[��{<�!q`��T,8`���j������h�C8=ꁚJui���H�ȳb���^��gF�$������=�d�T�����v�����
��(�\�}�60��z�FG��"�S#���)����B�F-
"�iy.[�ڹ [...]
-��v���v�!?f�n%>Zn�wkY��JB>�����f�
��>‰r)ӱ(��kqݪ�7$4�����N�%�Q�7&�%8
"a
-�0�|n�p�Q�M<B\���0��Ђ�A
F"��ԛF���䃦���/�/��G�N�g��|%��D#LT�x±����n�zʧ8���>u4 ٽ;��g)���ue���hjm�P`��.�P��Ge��j�ҴK@��oL���!�i�H�	���c��]vfSޘ1�D-�V��_�!,-��(�0(4��
-��Ǻj�6ߒ6�m�������(T\UE/a�
Q䇉��Vt`ĮP$ �	��]H3���������uU�-c���M��<6� �9*��SH$RX"6���V�
pO@�Ɗ�I�u�Kr��Bx5�{wH�A��E�u��jw�����6��M�G��+����KY�z[ ]��j�������R�zW)����'۷ݓ���e�Ο�Q at QH�C����m�V$!D�h���;3����������܈��kc���1���yS�}�]#`���{ުWE 
-�9��>�dm��]\,6�F�K� �{�h���m$��꾦�ŕ�=�"x��q;�8f���V��!��V���g+6~��k�!(
-endstream
-endobj
-14479 0 obj <<
-/Type /Page
-/Contents 14480 0 R
-/Resources 14478 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14491 0 R
-/Group 14449 0 R
-/Annots [ 14462 0 R 14463 0 R 14464 0 R 14465 0 R 14466 0 R 14467 0 R 14468 0 R 14469 0 R 14470 0 R 14471 0 R 14472 0 R 14473 0 R 14474 0 R 14475 0 R 14476 0 R 14477 0 R ]
->> endobj
-14448 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 14492 0 R
-/BBox [0 0 244 220]
-/Group 14449 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 14493 0 R>>
->>
-/Length 520
-/Filter /FlateDecode
->>
-stream
-x��U�j
1
��)�3��;���B(zh;�C�a�?)!)4=��+{lﬗ�{-�aW�F��O��x��Y��|�� =��p�Ex�YΟ���/��A~O��
pD�+B��d
�@A|�����3|S�k�p
�QC/%)�G�

XJ�Ic�`�\�� 7_�� �����
�Ϧv�A���98�0����
"R�!I
k�b�1I�8��]4���EE��)�%
�muy��/PwE��`2ء."�a��s�@�Mf
�~�t�:�Z!�nʼn�`�%٩�¹��œLHU����ۺQ#.�Pd㒥R� ��Ƶ~5X=�6�m_S�-U7z�w����E}��W@)��v_|��_�aCy�;P
R��Z�	w�{r;����fY����!6kMsޣ�w�9Yq�߶�ߢ��ě�HKiz:�==t���ԟƑXa��Z��hK�Ƙ��	j���
-��r?���rҬ��:����N�|���<�ts��<z
-�Joa_���6�_9%�[�m�Y�r�U�n�6-d�Q��o0w��
-endstream
-endobj
-14492 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-14493 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /NHANRN+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 14494 0 R]
-/ToUnicode 14495 0 R
->>
-endobj
-14494 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /NHANRN+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 14496 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 667 584 278 611 500 584 722 556 500 778 222]]
->>
-endobj
-14495 0 obj
-<<
-/Length 14497 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0E�|���"�l$�T�}�i?��C�T
2d�����R�HA:������sk�U��n�ZE?X�h�nN���:�H��
ze
-o=�9�}�e[V[�OQ]�����m��d��
"!D��
��^���|�_��<��HvI�4�P�۽��U�$�P|l���v�e��L"
,1��
-��䔽RT'�iD����Ț�,CY��o�B���IR$M�4P)AY�*�P��
T"�T�4�]N�b� *@
(�@9w1�q�d}�L�	�)�W�O����I�~eb?��/��~��K�<�|�*�	��g�_Ι����]����S��*\7��~���޷Jߜ�
V9lҾC�����ӼW��/�[ʥ
-endstream
-endobj
-14496 0 obj
-<<
-/Type /FontDescriptor
-/FontName /NHANRN+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 14498 0 R
->>
-endobj
-14497 0 obj
-366
-endobj
-14498 0 obj
-<<
-/Length 14499 0 R
-/Filter /FlateDecode
-/Length1 2792
->>
-stream
-x�UV
l��
��/��p�~5qB��8	I ��cB��8/'��
�M
BpH�G
4��(�B�B)tе�Z�>�UӚJ�&�6
�D�2�	F�t��k����������������#��"U��ҵ��]��]B�`vr��ԯ����0�
Y����	Ij�\Y�s,
�!������ʳ�/��;<�6L�Q'!���GÛ��&��
��8rX?�F` �֢ͳh-�L-���uvm&��5b]�
b]2y��WQ�Mkq���i/�lp��f-�$�N��|5SL��.�k����\��Y�f&f&��te��h��E�۠�Y���q9+U�J��:�6�R�s�-�i���Q^
-��$%ٌ��PokORJ���銬���eK�+Ao{ƺ��2:���:�R![��W��7ٳ34���23�h/()�>m\Ы֨K�P�x�x�)}5@)�PIE��zB�PKnMA��~ƚ�K��z�RQ��:(�
�X���j��n������.�kp6��ąbC�a�E
Ź�z�t��<#}4�J�N,��c��
Q,.V=��v���v̍MS	�'��\=����dU���i���
#c�G��:�Vf>����Gh⑖诣����E	��1��D��B����7}�N�35р�����SA��]�Ӆ�9fm演��w�f��é>�)+�Ҥ�ۉނ,
�Gv�s����V���<ߒ� 
r�����5����ji��kb�BW=�&$�b4�[L��c2*,\aHgT�N�E�[H�|���F��3
�Nj��e���4��z�e'����,�ӱ:n�L��
p�3�jm.Y��	�&� ؏�z���Z�ᅭîWkC!ou ���]\t����+h��`��{t��w� � �
-n[����9�HK�aKf�����
���`s�
"8f
0�烃q|e�A
-֥�

qZ9s���
6�c����l�Z�	`յ+�0�V
�1�Fg
�|���юޱ�L����|6?W���lD�_?�L=����G��1ف�
�dB�<�}S���Ȗ���U?�!��_�[����8�>�)
/��Lݣ�2�&�V�7w�
U~���]��H�Т%<n�?-6M$v�g��r
���OE�h�V����ً���A����g��TEt�C2#!��&�bK�6A4S�g������"?z�����z�]�=���� ������R�l�̆�
KF��Pb�����
2��z�&vl��n��Ѿ�
۟
:�c�d_�?�Ƚi��"��\4�D�>��j)r�8�'��a����}�-O��i�
Q�LU�|������g::��TW���[�jA��}M��(�7Gz�D�z��qt��u�?�ېǬ�����/f
��J�� m���6�&�/����D�(r�R���NK��}�������V��`+ S%g|a1���������a���}s!g
����.��In��
�C��x���ty�5�"O�ȇ}�]+�ݦ��'�K��:cMe��PK�(7˦���_��t �9����bf�D�z�
r�4'd��~t5J[~
_�/�zs�'��ƆϳkS�����{9
K
�t9��4[TP���Ҋ�//P�܅������b��
��p��|9�of}�u�*�MP!�\�����W��^y��]��$�%��Q+n�����==W'�J�QF�n����7N*��񕃷�B�o]�LW]�2yN�������-ˊݍ��q94r���� r��

LMW��f�J3{�B=����E
H��*�N���A��g�[b1�$㗋�BI�ro�m��'�r*a�D�}R�#�&
h�x�� ۀ|5!�2H&ṒM�
�c!q��]��o/�I�x�R��\��o���\��sR��nB&�D2��p[�B:_~��L�����㟕}B��	�Ŋ��B���Ա��
��:���
c̑P&(��j�e�HF@�|��`�&�G�ؓ>r;Y)�<ak��V��gҁ� [...]
-endstream
-endobj
-14499 0 obj
-2094
-endobj
-14449 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-14462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 410.114 186.747 421.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a153e3f99decdc5f5e6783237f663aa09) >>
->> endobj
-14463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.723 410.114 300.469 421.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a28af0b7829edd2cb5aab92b1883290a5) >>
->> endobj
-14464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.979 410.114 361.061 421.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-14465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.31 410.114 401.18 421.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a4be685ffc90e4a9b9d45930ca3d75a25) >>
->> endobj
-14466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.124 410.114 483.77 421.017]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ab604291f1f371f7c8bdf7c4f4d799954) >>
->> endobj
-14467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 382.007 160.814 392.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ade76cae38d35a93f595ca57a1be076d9) >>
->> endobj
-14468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.791 382.007 274.536 392.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a28af0b7829edd2cb5aab92b1883290a5) >>
->> endobj
-14469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.047 382.007 335.129 392.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-14470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [343.378 382.007 375.248 392.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a4be685ffc90e4a9b9d45930ca3d75a25) >>
->> endobj
-14471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.192 382.007 457.838 392.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ab604291f1f371f7c8bdf7c4f4d799954) >>
->> endobj
-14472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.562 354.274 226.308 364.804]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a28af0b7829edd2cb5aab92b1883290a5) >>
->> endobj
-14473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 326.167 171.514 336.697]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-14474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.253 326.167 214.124 336.697]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a4be685ffc90e4a9b9d45930ca3d75a25) >>
->> endobj
-14475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.356 297.687 196.002 308.59]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ab604291f1f371f7c8bdf7c4f4d799954) >>
->> endobj
-14476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 269.953 150.493 280.484]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_af28c7cc73f024d7be76270575e408e07) >>
->> endobj
-14477 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14481 0 obj <<
-/D [14479 0 R /XYZ 89 770.89 null]
->> endobj
-14482 0 obj <<
-/D [14479 0 R /XYZ 90 429.213 null]
->> endobj
-14483 0 obj <<
-/D [14479 0 R /XYZ 90 429.213 null]
->> endobj
-14484 0 obj <<
-/D [14479 0 R /XYZ 90 399.372 null]
->> endobj
-14485 0 obj <<
-/D [14479 0 R /XYZ 90 371.265 null]
->> endobj
-14486 0 obj <<
-/D [14479 0 R /XYZ 90 343.159 null]
->> endobj
-14487 0 obj <<
-/D [14479 0 R /XYZ 90 316.778 null]
->> endobj
-14488 0 obj <<
-/D [14479 0 R /XYZ 90 286.945 null]
->> endobj
-14489 0 obj <<
-/D [14479 0 R /XYZ 90 241.042 null]
->> endobj
-14490 0 obj <<
-/D [14479 0 R /XYZ 90 181.737 null]
->> endobj
-1947 0 obj <<
-/D [14479 0 R /XYZ 90 69.411 null]
->> endobj
-14478 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im20 14448 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14527 0 obj <<
-/Length 1818      
-/Filter /FlateDecode
->>
-stream
-x��YYo�F~ׯ P %�j���Ph�uN7Qч8(j-��H�����w� ER���r�}0Lrwgg������~�<
����
-Q�QϚ^Y!�|7D܃����v=�|���� z�J}~�������
�NG�G��E� ����W��5��/,�XX7j��r)����~��]0�\>�F3�E
-9��j�J�V�`�Θ`��
��vT��]}�Pj)��!����5��0r}�Q��a��S��v)�ŀ
-G
-�
`���U2+����dr�Z�b%�*��<�L���EU���r�/&e*�͓l��)��K���K=�Ѡ�jY�]O�(��G.������3=	x=e�x�.��*��Q�aX�}z��giT*I֘y�صƄ�����
l��*�)
�w�
-
*
-��BY�&�ə�[��
fSh���������~I�e��U^�B�0E�^�4�r�,a���/¡ܾvp��CW��`8��p��wI����3��LΐPw������
��)Z.�0��� �ss�K�^!�0�E
�P{�f�N�X�^�q�e��{  ��;,�]-�R�Yk}s"��zH�C�0~�NM�f>�)�ڱsf�"`~�v��j�9Xc�
��S�ɇv{�
-�c��`v�G͢��ԙ:�x�d2]�\��| NB(���v��AO��*H�4��L���>�DU�]�� �gv�!�P�sH��9"w�Wj[dy6��v��K�R�/Un����r
ۥ1e�[FC����p�?5��|&����zp�7���=�Y(�
��`H~-V3Q��M���x�yа�+j2����s
d�&
S7�ز����Pe(y�I�P
-T�����>!�4nKJ�\��K��]
>�i�,4=�0�8��cX�`|W#!����΁�<�q�V����QF
=��h�&�� Ǯq��qX.�5��(��x�4c.���Y�=(��~Y'P�U Ӱw�קK�Y��/vb0��:�>WF�9mҞ���p��plH fZ>�S�&8�$ղvɵ0�UU��
��M%�#��#�H9x�b��|e�bV��2�a�!��X�2�_
	
cƦp�
�u�'Y��0�r|���Y��Ay;��J�S[.��	/��̳
��-������>*F¾��T�e�m�j� 

|1g02�$WzN��:���}�1�c��c�wAm�P+
�

{�<���Mq���

�
���t,�P��V��Z�5y$N�
F�5�a�b� �
�')DTJ4��<KMJ��:u�*�	��ec�C\V��8�F3�"�
���M�)"v˶�����ڌ��+�g�5s�ǹu
+�f��9�̘h
�l�Z�����Rd�0�>4*�}��!��R�2��Uv=7J�������H���
t��/eT%%�&T̿�JA[�\DLC����$UI
�Pn�E��SӞ��lp�>���UݲhL1�Á��W�Z�ݝ�c��M�	��
�M"�%gU�Q�>�Ǧ��B*��!��t�5
�� �i�n5 �P�%�u]y�6v���A ��:*
����'�1Tu}�|��U����.��x��ғ2����m��؃3Ё�ž����?�gn:�&�L�1��M�ao�jYW���v;���6��WE�ꅥ�<Ms��M���A��t#g�f����o���H��-A�}�j-��a�3�.L|������ט'�+f=�A�V�䍷q�Nm��3s��\\���� [...]
�Vy�d(��RDC}��sP� 
-endstream
-endobj
-14526 0 obj <<
-/Type /Page
-/Contents 14527 0 R
-/Resources 14525 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14491 0 R
-/Annots [ 14500 0 R 14501 0 R 14502 0 R 14503 0 R 14504 0 R 14505 0 R 14506 0 R 14507 0 R 14508 0 R 14509 0 R 14510 0 R 14511 0 R 14512 0 R 14513 0 R 14514 0 R 14515 0 R 14516 0 R 14517 0 R 14518 0 R 14519 0 R 14520 0 R 14521 0 R 14522 0 R 14523 0 R 14524 0 R ]
->> endobj
-14500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 596.35 169.86 607.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList) >>
->> endobj
-14501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.107 596.35 250.943 607.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
->> endobj
-14502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.198 574.207 158.51 583.074]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.008 574.207 190.32 583.074]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 544.146 169.86 555.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList) >>
->> endobj
-14505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.107 544.146 250.943 555.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
->> endobj
-14506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.198 521.212 186.744 531.139]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a91570d4eb002ad004ea2fdef91ad6dde) >>
->> endobj
-14507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.242 521.212 246.788 531.139]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a91570d4eb002ad004ea2fdef91ad6dde) >>
->> endobj
-14508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 449.496 169.043 460.4]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_aa5c76d2c66f8173ec0dd35acc844db46) >>
->> endobj
-14509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 421.202 176.792 432.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_adc4d2cd573e5a4cf737ad7fba027b171) >>
->> endobj
-14510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 392.909 145.222 403.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.145 392.909 169.274 403.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a3e7dc86a08b4fcd5afb54cf3d921ea1c) >>
->> endobj
-14512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.824 392.909 409.906 403.813]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
->> endobj
-14513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.008 366.134 243.033 376.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
->> endobj
-14514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 352.66 145.222 363.564]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 352.66 168.176 363.564]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7e590338a93fccabc6523fde997f8d73) >>
->> endobj
-14516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.992 352.66 203.304 363.564]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.084 327.141 148.995 336.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a80ba640b32901e54e1d60d760c74fa90) >>
->> endobj
-14518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 313.407 161.013 324.311]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ae955347d214b5ca7f04fcd6b7d53ee9f) >>
->> endobj
-14519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 285.114 145.222 296.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 285.114 169.701 296.018]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a820628e94b7462dfe1b6f779e42d6ba5) >>
->> endobj
-14521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 257.194 145.222 267.724]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) >>
->> endobj
-14522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.721 257.194 162.099 267.724]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a80ba640b32901e54e1d60d760c74fa90) >>
->> endobj
-14523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 228.9 150.493 239.43]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_add253088cfcc2b16bb6393925f956b8c) >>
->> endobj
-14524 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14528 0 obj <<
-/D [14526 0 R /XYZ 89 770.89 null]
->> endobj
-430 0 obj <<
-/D [14526 0 R /XYZ 90 721.073 null]
->> endobj
-14529 0 obj <<
-/D [14526 0 R /XYZ 90 613.545 null]
->> endobj
-14530 0 obj <<
-/D [14526 0 R /XYZ 90 613.545 null]
->> endobj
-14531 0 obj <<
-/D [14526 0 R /XYZ 90 563.331 null]
->> endobj
-14532 0 obj <<
-/D [14526 0 R /XYZ 90 468.689 null]
->> endobj
-14533 0 obj <<
-/D [14526 0 R /XYZ 90 468.689 null]
->> endobj
-14534 0 obj <<
-/D [14526 0 R /XYZ 90 438.661 null]
->> endobj
-14535 0 obj <<
-/D [14526 0 R /XYZ 90 412.094 null]
->> endobj
-14536 0 obj <<
-/D [14526 0 R /XYZ 90 370.119 null]
->> endobj
-14537 0 obj <<
-/D [14526 0 R /XYZ 90 331.126 null]
->> endobj
-14538 0 obj <<
-/D [14526 0 R /XYZ 90 302.573 null]
->> endobj
-14539 0 obj <<
-/D [14526 0 R /XYZ 90 274.279 null]
->> endobj
-14540 0 obj <<
-/D [14526 0 R /XYZ 90 245.985 null]
->> endobj
-14541 0 obj <<
-/D [14526 0 R /XYZ 90 199.684 null]
->> endobj
-14542 0 obj <<
-/D [14526 0 R /XYZ 90 140.296 null]
->> endobj
-1948 0 obj <<
-/D [14526 0 R /XYZ 90 69.317 null]
->> endobj
-14525 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F22 2996 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F24 529 0 R /F110 1507 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-14569 0 obj <<
-/Length 1744      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~��0�����U�a@��Czټ&{j
C�[�,������;)�rd�M�t�h��s���
I��
��>��fp�B2G!�R׹�uv$WH��+t�
	FR��c<��
��ҟNF�x��a�O_G���6�������<J��i�Gc*�����s�|�ou6"�P'|U�zC�ч����n��1r$='X�}�N�_:1�9��NK�S�ع
�5�V%��(���*s����~ҥ 啂w�!�E��UCV}R1$<���!q1�R�Ę������b��H@��ĻGcoh����{
	$H�hK��:wWf�!��,+3�"���ʖ�@ƚ�����PgUK�j�]�p��@g3�rĸ2S>3�/2m� i�!ӫL�:)�dn�����~E�Y,�|�����Wi�.`D�J	��Ŏ`��\ʍD?DI�Cmz��۞�U
-`�񧎹$��PwX�b�Xt���\Qw���hKI�	��	��*Y�,*��V/��y�/͏�43
�?�Ɵb�e
��'ЫqmR+��oʈ��aD���e��v��
i_\\-)q����Cq�
1��V���9f�c�'�P1���7z9әi�X'AŀNu����$*E[���T��:����(+�~l?��gs��۪S	X�f�pZ���v����ô��{�ف�����fX������=��!K &)�D1ǃ�]^1��a%#9�iy��u��-�\�QRh��"m{�&�Q���f
���/tX
��4Nk
��Y�(��{�(�c�n
�X֝�E��N-M(A����,��`%)x��&��\�$٪�pGhE��UC�� 
-��P9D�:��E�
-&���P�rj�#N�N%�,M�x̟����F�
Ek�v��a`z��
��E�
���&?�tN���9�3��#��f���rX_���I
K
��H ��=�܅�'�
��~��P0�ϧ�n�t�H�B���ˣG#�U�ۡtm��P�R��(�u�yQ�`QލR5~j��Ȗ���	>���xIZ�2^�ᶸ���;byb\=ۓ��!F�C��E�Ӥ'IU��{#
Az0�wg<\�����C�� ��˲|��J&��5n�8�[�fYU�'A�X�:Ph��<v�{�R�~�uR�d�WQ
�T��)v
-���]����k���[�:D&���@&�Nd���S+��,
-����Q4
���!��"��L�|����I~�b�9,�7`w�zv�m�c�·�����WW��c��P�̣<��Y�X��\�sE�S���aX���*߀�~�
j��=�|
k�H�dx�����N�A~�PIY
P��ԥ��n�b��be��A��7�M��`�'�X_-�/�X��Dw)o‹�l�*0a����a
�E�9bǘ�p��1R�
��A�Vb�Q2��(
�1#����jp~��Y�����i�"
�n�np���=�6����Q~BUG1FR��+�{�g��i����=-6+}<U� V��Ԏ���lS���6���J�����ǹF��)n3�o?�zէH�w��L�Ȝ{���@���x���ZI�'��쥟���ڼ�׋9��[ �W��wq�9�>�.�:�vw�)�a����njL&�M��\g?���Z덟4���O%�:�ގTai�굮9c���9�5�n2v
(8[�E���������(0i���
=Tu�X�Һ� ��s�*%��
������-a�0���gض�3��k�� c�


-endstream
-endobj
-14568 0 obj <<
-/Type /Page
-/Contents 14569 0 R
-/Resources 14567 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14491 0 R
-/Group 14544 0 R
-/Annots [ 14545 0 R 14546 0 R 14547 0 R 14548 0 R 14549 0 R 14550 0 R 14551 0 R 14552 0 R 14553 0 R 14554 0 R 14555 0 R 14556 0 R 14557 0 R 14558 0 R 14559 0 R 14560 0 R 14561 0 R 14562 0 R 14563 0 R 14566 0 R ]
->> endobj
-14543 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Decision__Node__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 14583 0 R
-/BBox [0 0 212 192]
-/Group 14544 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 14584 0 R>>
->>
-/Length 420
-/Filter /FlateDecode
->>
-stream
-x��T�N�0��+���x�m	�P	!!q "q�z�j�(~�q�N[N(Jf��?��B�@�_CP�"د�	�Az�����l?���S ���*fs@���p��-� #n��+4�m�E
YS�ҙ�
-N%���j��%�	H
�$�!��e�~ڈ C��'��0
j�NL�V��4k1�BD��KR�ʘ��u�&���FM�z8VX
-�R6yBNm���S�3�E��X�l�
g+�����rP3�Ҥ(O��'[s;j���	�ս]��	b[��qj�)7F�p�r��4�h��qڮ���x�J�lO=Yʔف�>��������7�O���Q��@][4��ؽ@.����?j��ݕ�|c��5�`9�i�J�]�:'�+X������XQI�k�\����xa(�鐝�OŽ�t�
-endstream
-endobj
-14583 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-14584 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /PCEWGJ+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 14585 0 R]
-/ToUnicode 14586 0 R
->>
-endobj
-14585 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /PCEWGJ+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 14587 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 722 500 500 556 722 611]]
->>
-endobj
-14586 0 obj
-<<
-/Length 14588 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>�]N��љ�P������T�1Dg��7�)4����s��I/�sc���w7����
���)����IDNzPK��W��I���:/<6������Ë��V�=�㇄��7��
�J��K���f��lʒ�&ͽO�"�
��`�7��ò��/�s�Ly`�'�I�l�b'͕�*󧦪��N��z�����[�.|x��Y
(t�C�S*�iP	_:B�t)�#��Agh� 	*A
� �@E̢��,
�/�
d ���H��
-���(�)�� �WDB}e����wۅ����9?��0a^ۤ������\���
�^
-endstream
-endobj
-14587 0 obj
-<<
-/Type /FontDescriptor
-/FontName /PCEWGJ+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 14589 0 R
->>
-endobj
-14588 0 obj
-319
-endobj
-14589 0 obj
-<<
-/Length 14590 0 R
-/Filter /FlateDecode
-/Length1 2024
->>
-stream
-x�UU{l�U?���W�Z�b}��ֽ���؋u[����
-���Ѳv��@�!�0�	
Q���13�h�b��
�1��`�A
�����~݆~ɹ����{
�sν@  	j�B�p$��
� �
��>0ڹ?� �H�wF�r����{� nHާ"��"o
F�N�VK6�B����p �	u%��	L��i�!�
h�@G�"���:E�N��S����o�ť�&ڌr}(B�Tx����0(tV���:l&
����;�8���\�om�_���	�*]���0ɢ�P�G�4
-��tpV�Z��N�Ԡ7��n�Ir֐jb3��$��QM�E*�Kz-0R��bИ
$��΁��
e�ڪ
�FSuyE����g�l�r����ktsJ��ݷEkZ�)�HJK�YY�������pP&�{�0p��B���N���!�UK\>���XoNS�˴e��ʶWr"<ӈ���gtŲ44������V[�(������J���@e-���"c�~?	Y��M��+3���к��
H�:;�[�`�jGc�
��~*�Q�vr�V/Ui0v���'�f�cS��F�����I��^{��
I�k�|��ƙ.,3g����>�c)G��S�M�6��
N�6��L�f"���{���ي��i.��R��lxM�T���|8�_Q��U\8�
-V�d}Am�כ�Z���%cβ����.����{�X�X3cU�:�<�F�
8�t"�z�����)�I��;j��_�
?�r�e"S�&&���}���ںc�г-��"*v�lK��x>D?3 =U�z�
�k"t{Շ-�N��/���'|>w����ro������]$��돎�
F1~*W�^	�V��)>"A�
��]
-uh��J�1�j���׋ű�ʮ�B	�
�AʥC&�8��9,��j��Y�
�M����Xe�
t���y/����S3G��'ף�ў�XB'K�M̭`��U"�

-9�7�2
�jcap�6(��p�I�:8vȥ���#�C2���αK��X,<O����'�
?!�U.�}
s�C	1,#��Vw
�Η\kkh�p��}ɱ�����}�﬌
��167s��P�����*�3b$�I‡RRBP���0�K֓j�v���d�h
�l��E�\U	��h�7|Uz��Y��N�����4o��,�
�L�tW��~�����7��\���;�Ѕ��
-km���,�p�{�Xi9�o<߆��"v)B����#
-:��w�)�Υ
8�S��]N���<֧NM�
�*zt� =��-dDĜ�>!�l1���<���8B<ΚY��B�0k���y1V��$�g��2�ӱ+��[_��ՠN�����/�gT�I�D��o~�����to�<g!�
+�p�必^ɭ�{�*$���}Zz	��,��"($�������#o���@��
-׸f�,$���� G�7��r���
h��
C�3�w5��W��A������ԏ�.z*Fµ�]�y��J�/F��x3���{�Kp-9��fA��\ĮهQS�OY>���|��
-endstream
-endobj
-14590 0 obj
-1537
-endobj
-14544 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-14545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 378.118 208.246 388.648]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.216 378.118 239.787 388.648]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aa5e48e146300e08949a783b435f7672c) >>
->> endobj
-14547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 350.535 233.508 361.065]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ad096a02cc969dcd4b8606cd77d501070) >>
->> endobj
-14548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 322.952 178.996 333.482]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a47e031aae6928828862422b0ceedec71) >>
->> endobj
-14549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.935 295.369 249.281 305.899]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-14550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.251 295.369 305.729 305.899]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_af8feb908f5def7ba99abb739dd2dc6cc) >>
->> endobj
-14551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.935 267.786 247.638 278.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-14552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.608 267.786 302.989 278.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a058de183d237813010822dc5c734ce5c) >>
->> endobj
-14553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 240.202 203.265 250.733]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.235 240.202 257.501 250.733]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a3d06dcc99da3a287c6881d2b1e43935a) >>
->> endobj
-14555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 212.619 179.743 223.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.713 212.619 233.979 223.15]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) >>
->> endobj
-14557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 184.663 181.845 195.567]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a031ecc9f79496b10a1b48d6626fd98aa) >>
->> endobj
-14558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 157.453 176.505 167.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_af6356910030e23dc05bd4e500f073428) >>
->> endobj
-14559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 142.615 450.955 152.52]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a031ecc9f79496b10a1b48d6626fd98aa) >>
->> endobj
-14560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 118.538 220.22 129.442]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.719 118.538 317.355 129.442]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a81497d1095efd042cd3034335a3d19e6) >>
->> endobj
-14562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 90.955 220.22 101.859]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.719 90.955 331.582 101.859]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ab6e5b1dd2b5b7cc9dae9b4ca656cd05a) >>
->> endobj
-14566 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14570 0 obj <<
-/D [14568 0 R /XYZ 89 770.89 null]
->> endobj
-434 0 obj <<
-/D [14568 0 R /XYZ 90 721.073 null]
->> endobj
-14571 0 obj <<
-/D [14568 0 R /XYZ 90 396.582 null]
->> endobj
-14572 0 obj <<
-/D [14568 0 R /XYZ 90 396.582 null]
->> endobj
-14573 0 obj <<
-/D [14568 0 R /XYZ 90 367.265 null]
->> endobj
-14574 0 obj <<
-/D [14568 0 R /XYZ 90 341.408 null]
->> endobj
-14575 0 obj <<
-/D [14568 0 R /XYZ 90 312.099 null]
->> endobj
-14576 0 obj <<
-/D [14568 0 R /XYZ 90 286.21 null]
->> endobj
-14577 0 obj <<
-/D [14568 0 R /XYZ 90 257.6 null]
->> endobj
-14578 0 obj <<
-/D [14568 0 R /XYZ 90 229.349 null]
->> endobj
-14579 0 obj <<
-/D [14568 0 R /XYZ 90 201.766 null]
->> endobj
-14580 0 obj <<
-/D [14568 0 R /XYZ 90 174.183 null]
->> endobj
-14581 0 obj <<
-/D [14568 0 R /XYZ 90 135.641 null]
->> endobj
-14582 0 obj <<
-/D [14568 0 R /XYZ 90 108.058 null]
->> endobj
-14567 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F24 529 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R >>
-/XObject << /Im21 14543 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14626 0 obj <<
-/Length 2025      
-/Filter /FlateDecode
->>
-stream
-x��Yko����_A��K�xf�����k;��l[$
�&�6�|���5����y�)���AQ��(j�̝�<�k���O~ZLN.\S��PG[<h>�\�G��b�n9����g�t<D|v���>�,�ow����b�eB�'�	`#�Ӣl��7����g
#����bQ�YԄ�T���}��,Q�?�%`�%#"%�W���aQ�bcJ��_��U��b�GMR䵐�;C}�\8���A��i��ؕ��)�{���Gu�������X�_΃3%5
�1�m�E���gl��iԏ#X|�AXG/�F�\�75.�X�bp!ǢڔX`e�wE�b
!O���tI��z�
M;,�\8d\IJ%�I�,�Ԙ��Eo�9_�,�aAާ,\A��TȗqΫ`�1��2)�wS=N2�

4/%a���hX��iP�a��t(�TD��,�u�۶T��y���1��&(Y
'�c -&ys�ݝ��\�X`�vOpǾ,Y
�
u���	��Pd[�UxOX%�v5�7��eX���;�ߛ�&�C}|�@����eV��Y��ҳ�ee�.�I|뼑�X�T���paض.Q����l��������
��|�㩵��0E2����N����\��V�3w|���S��}Q�=�����u���7* �Ry�X{
6U��>��R��	�
d[v{���% [...]
-��D�	"����X�3_����wH�C
���kC�Azh�N��u�1�}�}G�Z:�z�Ё�A�]�^V<7�f (
Mu�f�lf��s$��g+��i�V�/�J+��>�
�uw�x�M���8����{�`
�G8�� ��[]vj���~n�eX5� ����3��R�Z�"��.�F�K�d)��p]��._4O����[eX at k
IjE�)�zk@��l��·Y����dL$�a6�2�
-�
�p�e�\8|jRH�Tn<�
L���`����!9�T6���83�2-_��6�
�vƚ0I[�3VGUR�3w�� �Uz���N�zVV��x�%߄�#V�����h
(r����H���@
���W>�hw�E��)0l:�j��nQ���A@*���
-;Oy��l �C���|uW�ё�Y?p���j۝��2EOO�
E�*���PM
a�^�Q�Ԃ–��]$��yx�fz®����P�Gv�m߸&q E�6`��fT{77L�CB|ybq5"�
�o#�gZ�W�}��=�e6��5"4��r�F[Ǥ-�&�
��2V��-{�_X��+
K&�$�X���<�3`f�|w�x�#���=N����*]M|�mY纥�H�1�h/�E��r��$�ҥ�ăze�PսA��a�ȵ�����d{ϱ{uoO�ri�ϛ�н�
(|aX�
%{���
-Z�/���	�æ*�`�\�
-n�s���{������}p��=]���א�
��r�~X���
@��ϷN@���݄�p�z��͹��c]�"�\�,
�V�T�����մ��H��3��آ�(
�
\\��-^as�6A����範�6`F�
����w��+o9a�����W�o���G�놷?s����;g�1ԥ-#��)�l&� \�Ҿ����+��o�&oU$�L���`z
��@O�<U3�Dhtٴ��!���@�hբČ����+J��(�'�I`�����H1s�������1���R�0�Z���V�����e��u�� B�C� ���
b��|�I�L���L��������Q +��9
X�p�H�5^D[z7�hE$d@������9����G[�����Da�x��ϼ_
G����9`vj
�o�����l_��
;&��Z��ڳ��ݣ^�\f�vV �
-n
-x��h<��!o
,0�Z����+��f՟��N�u�w�?nO9ʪVM8A"�15���uS4)��ؿL�_�Ƕo��>5M9;9�_>B����"ی��f���EE����b�l ^f��GC��o17
-endstream
-endobj
-14625 0 obj <<
-/Type /Page
-/Contents 14626 0 R
-/Resources 14624 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14491 0 R
-/Annots [ 14564 0 R 14565 0 R 14591 0 R 14592 0 R 14593 0 R 14594 0 R 14631 0 R 14595 0 R 14596 0 R 14597 0 R 14598 0 R 14599 0 R 14600 0 R 14601 0 R 14602 0 R 14603 0 R 14604 0 R 14605 0 R 14606 0 R 14607 0 R 14608 0 R 14609 0 R 14610 0 R 14611 0 R 14612 0 R 14613 0 R 14637 0 R 14614 0 R 14615 0 R 14616 0 R 14617 0 R 14618 0 R 14619 0 R 14620 0 R 14621 0 R 14622 0 R 14623 0 R ]
->> endobj
-14564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.45 197.257 696.354]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aebe39b79533783e53ef583a9ea308fdc) >>
->> endobj
-14565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.594 685.45 307.941 696.354]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-14591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.222 657.871 223.528 668.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a4d75a1f9b3e618d337fde1b4de9fdac6) >>
->> endobj
-14592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.67 657.871 304.803 668.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.689 657.871 395.332 668.775]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [479.267 657.871 513.996 668.775]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 645.916 138.04 656.82]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.916 645.916 349.58 656.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
->> endobj
-14596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.115 645.916 475.891 656.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.798 619.498 365.997 629.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1) >>
->> endobj
-14598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.815 606.382 207.648 617.286]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.423 606.382 237.297 617.286]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_afab20885083717c18371349d4c182481) >>
->> endobj
-14600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.438 606.382 318.571 617.286]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.645 594.426 267.421 605.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.423 594.426 375.066 605.33]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.798 579.964 328.634 589.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) >>
->> endobj
-14604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.985 566.847 203.712 577.751]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) >>
->> endobj
-14605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 554.892 179.554 565.796]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 286.565 244.968 297.096]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece) >>
->> endobj
-14607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.738 286.565 355.453 297.096]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1eceaed708535b4103023ee1a5d24ea5ff7b3) >>
->> endobj
-14608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.442 286.565 474.994 297.096]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) >>
->> endobj
-14609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.85 271.729 248.745 281.634]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 258.986 243.862 269.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) >>
->> endobj
-14611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 247.375 248.734 257.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a2b86312f1e0350f49b28c23bd3815e9c) >>
->> endobj
-14612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.191 247.375 403.507 257.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a31110533316a56c835287f82cba44ab6) >>
->> endobj
-14613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.964 247.375 513.996 257.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1) >>
->> endobj
-14637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 235.419 140.252 245.606]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1) >>
->> endobj
-14614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [143.24 235.419 291.902 245.606]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) >>
->> endobj
-14615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 223.121 306.836 233.651]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2adf2b5f608f0f0f055f58d9bedb694855) >>
->> endobj
-14616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.85 208.284 248.745 218.19]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.395 183.213 318.172 194.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) >>
->> endobj
-14618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 113.868 169.043 124.771]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
->> endobj
-14619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.859 113.868 238.502 124.771]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 169.043 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_aeffbd9c469a175051d71f3fd7fb525d4) >>
->> endobj
-14621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.859 74.333 238.502 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [343.885 74.333 400.662 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14623 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14627 0 obj <<
-/D [14625 0 R /XYZ 89 770.89 null]
->> endobj
-14628 0 obj <<
-/D [14625 0 R /XYZ 90 704.286 null]
->> endobj
-14629 0 obj <<
-/D [14625 0 R /XYZ 90 704.286 null]
->> endobj
-14630 0 obj <<
-/D [14625 0 R /XYZ 90 674.973 null]
->> endobj
-14632 0 obj <<
-/D [14625 0 R /XYZ 90 623.483 null]
->> endobj
-14633 0 obj <<
-/D [14625 0 R /XYZ 90 583.949 null]
->> endobj
-14634 0 obj <<
-/D [14625 0 R /XYZ 90 504.383 null]
->> endobj
-14635 0 obj <<
-/D [14625 0 R /XYZ 90 504.383 null]
->> endobj
-1949 0 obj <<
-/D [14625 0 R /XYZ 90 410.428 null]
->> endobj
-438 0 obj <<
-/D [14625 0 R /XYZ 90 403.337 null]
->> endobj
-14636 0 obj <<
-/D [14625 0 R /XYZ 90 303.03 null]
->> endobj
-14638 0 obj <<
-/D [14625 0 R /XYZ 90 212.269 null]
->> endobj
-14639 0 obj <<
-/D [14625 0 R /XYZ 90 132.703 null]
->> endobj
-14624 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R /F39 2320 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14699 0 obj <<
-/Length 1942      
-/Filter /FlateDecode
->>
-stream
-x��Z[w��~���ij��IH\rڇv��^��LҞ�I���j�ə���l�����]y0!���۷%���`�ѷ7�����(����;!v|"����qL0�ɔ`��W��q����	��b�4iG?gwe\>]^^�����		���\,&S����<�R_~��~,�D���#�y|��͏��oF�F���bp�N�}�
;)�����
�s=h�0���ܹ
�w��F���������*
	

�D�V��U6OAF�~�T��r�x�Ouc?f����˸V.�l!r�y���[BpwM�!�R��^��Q��(`�s��5���YF�O+�
�W��ߤȥd�8�re4��w� �
�(� `� <D.�|�ń�R��~wd�8����g.�p�5��-�_��_�ș�E�x

-y���Y!�v#
�q���,O�D��E����~�Y��Z���c\�
!]�8%Ͱ�����.�D��w�H�����5�
xTV�KT�z㜀��ޔb�����(�z�[J��[:B�*~9�
�>
�]��<��
��Q�ÞY�a{fy��X�Y�m�F)�e8�̤��5Ri�C��%��i��w��`"d��f��P�xKYg� 1/llz�]l�����|�C3� x��C�r�
׳'�.��~�j�KQ� ���:3H~#e��C�P+p
�/���M�zZ���T�U$Z+ [���L����|jU6���
V���j��Z��:���q H
�x�o��2�ai]
�7�r������%�
�Bٙ��`����
����OTl�Ϧ��ZdJ��(���9�ץ���
-VeJg�âG׎��Dw���!;[
y�m���i��Mm�T'�hd�
�o1���#��r&"E5,n�{�
�ҕ`�0 P��f;�<��l	4t
-�M��O�Y���A󌃿���$�ǺO��ݩ0���<����!�^�
��-��n;g�Ö|�Y��̩
�e捥�
�`�x�ň��
����y�����B���JQ�i$wbk�l�s1�/"�
ܵ��w�v�Tu=�'�4�}~@1�B�l.t�6� �/�O�x��
Qb�м.�'S
�q���PV��*?T5�R�=��Y����k���k&d��������u�Ǐ"1�0 
�x�����
���P���h8ⶴ~yJ�y-�!$�wa�Q}�eIe���&����z}�G��#w6��:_ۮ�
_��	�Yں~�g��9ɫ����Ֆî��gȰ*4�}�

�ȣtӀ'iB”
]a:,lsE�ORm��yf�Yx{�ז=?��1e_4��!��9���1�b��LF2V���e�J�̥��DR9�����<S�Q�� ��!zqb�����R�p���Z�j%��)揕
��
�*[d	�7�N7��K!Fh�θõ�;_﷬ ��fb�
>�Fq^� 絵��N�M�iz��rdR�}��y9��۠���m��ֽم�b
aAh3iȇ�`�~N5���s���z�����|sJ.3[��
��e[:D�һ
˲�+�|X��� 2!bs~�J��G}m��������l9K��
���	Dna�-a�����X,W���?d�_&��
v�M<
וI�E�j�<sp��̔-�E��
-ړ���Q�=�q
��
3�}s��ݻ-[���
��3@��/mN
-�������^s��@|�h�k_ִG��}�"��CZ�N�g�Q�a{��!ݵ��I nnD��! J����JV��oo� ϷK6��=_�0hg]�*_}���2����&�����E����ӝ����vw���c
� �
��X����f,�0q_�wc�����ůR�_L8oO�s{�PI�{��=H'��g4����-�B��4W?U�����m�ΔZ^^\ܭ
 O< (�����#Dط^w�
j-��r6����
j>�kp�|̣
 �F��5���u��y�ܸx�p��
- ��B��K�{
-endstream
-endobj
-14698 0 obj <<
-/Type /Page
-/Contents 14699 0 R
-/Resources 14697 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14491 0 R
-/Annots [ 14654 0 R 14655 0 R 14656 0 R 14657 0 R 14658 0 R 14659 0 R 14660 0 R 14661 0 R 14662 0 R 14663 0 R 14664 0 R 14665 0 R 14666 0 R 14667 0 R 14668 0 R 14669 0 R 14670 0 R 14671 0 R 14672 0 R 14673 0 R 14674 0 R 14675 0 R 14676 0 R 14677 0 R 14678 0 R 14679 0 R 14680 0 R 14681 0 R 14682 0 R 14683 0 R 14684 0 R 14685 0 R 14686 0 R 14687 0 R 14688 0 R 14689 0 R 14690 0 R 14696 0 R ]
->> endobj
-14654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 683.746 169.043 694.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a62d38f242bfeb5c6d1a4ccdb28518538) >>
->> endobj
-14655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.38 683.746 251.513 694.65]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 655.621 176.792 666.152]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a38cc9e4158abcf9fa6fb719d079108d1) >>
->> endobj
-14657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 626.75 169.043 637.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.783 626.75 220.589 637.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_af353ca460687792eb573428e18467f44) >>
->> endobj
-14659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.926 626.75 303.059 637.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 598.252 179.554 609.156]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 598.252 250.666 609.156]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a25cc092f9c3d26be5b6dac41eb54186c) >>
->> endobj
-14662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 569.754 194.208 580.658]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.948 569.754 324.249 580.658]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a1fe157210b8df0457fa5578d9fa466f0) >>
->> endobj
-14664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 541.257 170.687 552.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) >>
->> endobj
-14665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 541.257 243.314 552.161]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a56ce97c41ec068deda3ccfd81766ff83) >>
->> endobj
-14666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 513.132 170.687 523.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) >>
->> endobj
-14667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.185 513.132 235.712 523.663]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a785a8dddb80c0cf25b4b02f3f38b0631) >>
->> endobj
-14668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 484.635 155.265 495.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a04f2cd33bf24eddaa306c392810004ef) >>
->> endobj
-14669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 455.763 278.681 466.667]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a6ffb7a29c69bf20f56f8ba9f16dc74b8) >>
->> endobj
-14670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.497 455.763 348.14 466.667]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.7 455.763 448.343 466.667]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 416.307 285.316 427.211]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_aa221ca31e0aa489ae726efef9234c6d7) >>
->> endobj
-14673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.653 416.307 369.429 427.211]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 388.182 194.567 398.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a934053580363fb6c281a614d593231f2) >>
->> endobj
-14675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.904 388.182 265.411 398.713]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-14676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 359.311 198.443 370.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a1c6db3c7a9e8bcc79574dfbb087cf996) >>
->> endobj
-14677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.78 359.311 303.607 370.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-14678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 331.187 187.583 341.717]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a6dd86308a6aa3b0a99e7464fa6d64534) >>
->> endobj
-14679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 302.689 198.383 313.219]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
->> endobj
-14680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.881 302.689 221.755 313.219]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abac8b241f6c2a61248fa768b9157203d) >>
->> endobj
-14681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 274.191 153.183 284.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.681 274.191 187.783 284.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_aa7ceb834deaff6303def1cbe95373edc) >>
->> endobj
-14683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 245.32 153.183 256.224]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.681 245.32 235.941 256.224]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a08ee3b2a32e3b7b8088a84a8beaca0f4) >>
->> endobj
-14685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 217.196 150.493 227.726]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) >>
->> endobj
-14686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 188.324 191.817 199.228]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ab9663a6c08e6c35bea0da7fa41c81393) >>
->> endobj
-14687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 159.827 181.845 170.73]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a77a39c345913dd490ff33b698d45b7e2) >>
->> endobj
-14688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 131.329 181.845 142.233]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a26a3ca0eb57793c00b0517a6856b8c10) >>
->> endobj
-14689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 102.831 154.727 113.735]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ae9d3cb337b4a4a0fc296d2b5b742b7f2) >>
->> endobj
-14690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 74.707 176.505 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a2f2683794347b7bceb41d88e1b1412d8) >>
->> endobj
-14696 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14700 0 obj <<
-/D [14698 0 R /XYZ 89 770.89 null]
->> endobj
-14701 0 obj <<
-/D [14698 0 R /XYZ 90 701.306 null]
->> endobj
-14702 0 obj <<
-/D [14698 0 R /XYZ 90 672.809 null]
->> endobj
-14703 0 obj <<
-/D [14698 0 R /XYZ 90 646.037 null]
->> endobj
-14704 0 obj <<
-/D [14698 0 R /XYZ 90 615.813 null]
->> endobj
-14705 0 obj <<
-/D [14698 0 R /XYZ 90 587.315 null]
->> endobj
-14706 0 obj <<
-/D [14698 0 R /XYZ 90 558.818 null]
->> endobj
-14707 0 obj <<
-/D [14698 0 R /XYZ 90 530.32 null]
->> endobj
-14708 0 obj <<
-/D [14698 0 R /XYZ 90 234.383 null]
->> endobj
-14709 0 obj <<
-/D [14698 0 R /XYZ 90 177.387 null]
->> endobj
-14710 0 obj <<
-/D [14698 0 R /XYZ 90 148.89 null]
->> endobj
-14711 0 obj <<
-/D [14698 0 R /XYZ 90 120.392 null]
->> endobj
-14712 0 obj <<
-/D [14698 0 R /XYZ 90 91.894 null]
->> endobj
-14697 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F66 3179 0 R /F67 3037 0 R /F60 532 0 R /F24 529 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14748 0 obj <<
-/Length 1996      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ�S*�D0 <ܾ�I�q�ԭݾ$

EA2[^!H�����%Q��(��Eq���. �6���|s;�x��V������
-��9b.|��wS�ug�~oٮ�H��*���緷߾���c�oo'&��E4�<ߊ�ɻ?�����-����
Ԥ�r�
��u3�e��,��J���|��u�l���G"D��c
��lN]2]�3�M�T�t��[�؈8v#��S�=��vB�i�_߼���M:-g�7��<��*�ʹ����HQh)Vu�W�g�UF��)7�L�~7��)ʡ��x���B����2�f�/��hBQ�����&Q��0[iQ��������.
-����
c{�T��I�]<f���R�`b�	F
�բ(Wb��l�lg�M�ln<��Wu��1v���~e�G�Qy.i&�kГᩨ��
�����������0���t^���!��D
-߷5X��dN1F����[�3F��
V���0��<���B��E�-�ӫ��U^��¬���r[q��j�t%���9�VCkP�:tbm�5�i�w|�	b` t+��J5���B-�����U��U#NK�i
�?��R�	�IO��� ���w�UN�X�2�o`�|`�0
g��s_�C���)�z'�KO��v����0�gԍWG��Ty!
��aq����W׋�2_&<
[�b�P~
�7a1�P�‚��� 9?���%�!�e�
!Ðퟆ^ �<7�ʳ�̓ŵ
��
S��}F�I}b�nx��
�������
���he��9��^�?�n��*hL�e����{8;9�
����	���
1�;g���	�_2A@�?%�e��L||�~h����L!?��c�ȡ���Yƛ��*Ny&d���(�K��b�^��YgA���Nb����x8��afʫ��b
�n
�{>�-;�ԁ������u�fϏ����9E}"h2⍙eR
��D�VعM�ɵ�ȓdD�?���3o�4�?�t�<�o�,�'Nq@���f�Ma!
-�{<"��4
�r>.�eO����8�ӧ�
�k��2�]�fQhH���;�Ov�Q$	+U*{d
�:�y���c�m^5系�j�"LgX�F�WmѾlrκa����
��Z�	�27<4�8n��eX��v�wd
I	�U�W_
3$���
{�)�(��~9��᲼��S=w
���wݟ모
�*�H3�ɡ��±��q;�g;�<��4+���3�I������@���Pぃ��sQ�H���&���$�����%^�*��&m��"*���j�'ίu���Rm��w�U*�o�
)��ˮ M7�,���4Ъ+�%3�%��f��Qv�?yT��Z���jEI(L�gQ���#�EOL�
�Ŕ
�b�E}1M�|�No��)����a!Zm
-��F<��cL{w<�	�@���
-�|�^r��޻}�����M��6�/�$%��ӼSxb*�%
Dd;�
���˅nE�������L��)D�
�=CK��0[�X%�E�
1t�ʎ�lz�D�Z�`+� ���~��~)$vj��
rD4EC6����A|��m��9B��s#���,�N�/c�Ū��/
����C��n�u���V����+��J�f�TH��`V�4$�ʄ2E�&g3���ɽ�y�7P������˽:mȴN-T��q��@�r'�

�
�]��Dz�juW�-A���hоݬy(bP_�I�_I[mL:ޡ�|d�vs�U�T=��j��j;fsUr�N��pӐ��4/MO���>:�O���ۥ�yjhw ���y�>�
�Q靷�`_�e�DA�<�ȋ.
�X���A���m�p�lֳ�̤Y�m/�G��O�}��k����R��z��oo��!���P`�yT
��j�Yc:.�R�z����
��;��5�
o>�"�m�*S�6�^_���	^~!�2M(�fu�t"m��ۚR�Y��yÛ㲖�V����펃X��qWU���Ų��mP�����-�D����[�xP�Bg�
��.x� 
-��
-endstream
-endobj
-14747 0 obj <<
-/Type /Page
-/Contents 14748 0 R
-/Resources 14746 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14491 0 R
-/Annots [ 14691 0 R 14692 0 R 14693 0 R 14694 0 R 14695 0 R 14723 0 R 14724 0 R 14725 0 R 14726 0 R 14727 0 R 14728 0 R 14729 0 R 14730 0 R 14731 0 R 14732 0 R 14733 0 R 14734 0 R 14735 0 R 14736 0 R 14737 0 R 14738 0 R 14739 0 R 14740 0 R 14741 0 R 14742 0 R 14743 0 R 14744 0 R 14745 0 R ]
->> endobj
-14691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 708.28 450.955 718.186]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a26a3ca0eb57793c00b0517a6856b8c10) >>
->> endobj
-14692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 683.881 191.718 694.785]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 683.881 288.852 694.785]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ad750455647786b5cb28c5422930f0ec0) >>
->> endobj
-14694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 655.653 191.718 666.557]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 655.653 303.079 666.557]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a2a7a0b9f3dc8cd6d55e839e20fa28f12) >>
->> endobj
-14723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 627.425 169.013 638.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a920510b7460ca0933ea807b88484ed8c) >>
->> endobj
-14724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 627.425 227.962 638.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 599.198 219.234 610.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) >>
->> endobj
-14726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.732 599.198 311.916 610.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abfb5615fad7429cb2c340d763df8a43b) >>
->> endobj
-14727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.731 599.198 422.161 610.102]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece) >>
->> endobj
-14728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 570.97 224.993 581.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ae6a4663bfee916adb9330010328493d6) >>
->> endobj
-14729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.808 570.97 334.132 581.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) >>
->> endobj
-14730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 542.742 255.996 553.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) >>
->> endobj
-14731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.812 542.742 325.455 553.646]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 514.515 179.554 525.419]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 514.515 303.238 525.419]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a1fefbce40046822771b243b1d2f1277e) >>
->> endobj
-14734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 443.93 203.075 454.834]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 443.93 296.324 454.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
->> endobj
-14736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 429.143 327.9 439.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 346.067 226.034 356.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a5fdacdaf0ba18f647ac7bf95a2624af0) >>
->> endobj
-14738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 346.067 376.309 356.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 317.84 156.281 328.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) >>
->> endobj
-14740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 317.84 215.23 328.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.441 317.84 288.574 328.743]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 289.612 156.281 300.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) >>
->> endobj
-14743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 289.612 215.23 300.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.441 289.612 288.574 300.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14745 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14749 0 obj <<
-/D [14747 0 R /XYZ 89 770.89 null]
->> endobj
-14750 0 obj <<
-/D [14747 0 R /XYZ 90 701.306 null]
->> endobj
-14751 0 obj <<
-/D [14747 0 R /XYZ 90 673.079 null]
->> endobj
-14752 0 obj <<
-/D [14747 0 R /XYZ 90 644.851 null]
->> endobj
-14753 0 obj <<
-/D [14747 0 R /XYZ 90 616.623 null]
->> endobj
-14754 0 obj <<
-/D [14747 0 R /XYZ 90 588.396 null]
->> endobj
-14755 0 obj <<
-/D [14747 0 R /XYZ 90 560.168 null]
->> endobj
-14756 0 obj <<
-/D [14747 0 R /XYZ 90 463.005 null]
->> endobj
-14757 0 obj <<
-/D [14747 0 R /XYZ 90 463.005 null]
->> endobj
-14758 0 obj <<
-/D [14747 0 R /XYZ 90 392.506 null]
->> endobj
-14759 0 obj <<
-/D [14747 0 R /XYZ 90 275.664 null]
->> endobj
-14746 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F90 758 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14767 0 obj <<
-/Length 2779      
-/Filter /FlateDecode
->>
-stream
-xڥ�rܸ�]_��p�;0	�T�٣��I)+���rqf0#�CrLr$+ǿ�� A���	`��h4�f�
�����՛�?���E���{����K�\�	|�~�4Y�� ��U�E[�V2����޵��_�M[����W���_��0��QW����/Ǣ�h���k����2	�%��7?]|����El^Hl�"ͼmu������'/*ϼ;�Ty�T0
�닿_|���Y87
�DD*��0aH�{'el�ۼ��nڜ������~�����}�i�5�-��
n}�C�f�(��0l��9p��/*݃̾	wq"�4����Rh�ӂɴ�d�&�#�7�涩�r�[�H�����*�V�X
���4*J��LE�G��ߚ
)�1ܼ�iצ��|ܮ$,�e��������j�	�_t���Ε���]���#*
�Q7���(��
-6�%�{�ߌP�=-�
�
Ϻ���4���"�c�b�ا5�GnY~%km�H������Nz[��-�se?�H8���J*��~�ڥ��ߒ��ȼ6һ�W�h�;�NM���i	�����AYo[]�/����xF�&�f?��`�É�Z�
���	4�4�
R[�1��������t4��L Ј��*i�<���i�
��J]붠
��ۛ���<�m��Vf�#��$?�m��ߣ�‡QX�-��6��8ݔ[Z�ʺ�μ	e�#oJg��g4�
-�8�N��.�X��vߋJL�Z��s�N�,��hj^I�7��h�b�������1e at hC�A�dy|dS�[��A+n)DS~�~a�H�:�����;O\�]i
*�
ɝ	a���S�͞���>�!�1$T�?��E�5ҋs�
L�Ly4
 �wg#�c��5�*�4��h ���*@j�O��澥3��ߔ�0�bt��X79���� Tl�>7e]��a7 ����:
-�do�+�/���	8F2��=q��w��`/
����ު f����n��D ��#����@��]�z�]N����Id|�6̒�LDInc�wV&��ʄ�"�h��;Ea�w���
�]H
I	}�eaf/
Sȫq�@!��\�'eȱ�u��^w�9��>LF
yI��<[�z$�
��]%B��Yl5-v`�ݻ �z�Z'��ֳ��e�'�x�߭���R0�nӊ�o�zA�a.�`�Ӷ7�q����4�
� ^��=d*e�F�/
�eS�<�i&�@Y
�ű[�T�B��Ӊ��cx�,���(鵽ڂ��"
㹒�H
J����09�bO3��	�#
I�pž!Q�ʺ��I(xM�G'�D~{n[H�Xc��ɫL|�JS�(�R��
����g�$4њQ w��6��5�6��^�xT�`��
0oҬ4et' ���u=�e.��U�r��NAc�u�1�´ \�f
�F�
㺓�^B��Gd�H��}n���0�����p�
fU֠N2w۶��撛��.�=S���ᦘe��X��d$� ������ܯ
-<=G"���	ȥD�SV��11'�N'än���LY=�7�3/�Df`�%ӯtQw���`9�aFG�X��6|+0�_�|�#��YT0z��ӆ
`ۀUv��&sǵ��(�)���� ��`���1��u������v n��0� QD�`���q
-kB|$�T�X���t�0`�QS�/u�eC�
���a\h������
��,E	̳/EL�Vь#��
��4
~ַ�P�T�Ut�s�0�85ք�Z��n�@�`�G8a[���t٥��ݷ��;�՘)�pK��%�ۖ�
qԱmv�-5x�.˸�4f��jy��Q�P`n
�Sp�[���vv8�\���y��5�L�/��a�!?�8�>q��61�_�ܱ�4��X,�"�[��>vf&�O֝O2��G����
�W�B�ЧcJ`�=d��E�B������CR�
���AՊ)��z�6��NM�%����j��
��=�� ��mS��}A�@�ڏ������S��C�rgrd�!�\E9�7�%`��纇>N�]s:�
�����_M�Q�{K�q��/1Օ6����''�ƃA1�r1�-+f�&Q�ەc���ם�-+Ԯ�3P�
���[�
-84��oަ���8�\�u��@�9�O3p�)]��υ�s�%D���6�ĝ�x��|�mS���2P"P��v-�R 5�����ms�^•ľ9
T�;Ы�G�Kc�D
-���
TB�)%�9e�5a�y��
�� ���a�N����i\K�%s!��͑���&���"� ��ׄ��nDdc��g�efܽk�i<��
1x�G��B��
-n 9�������D 2�d���j���*�!p�r�9><Bd��Cρ�m�F��إX>��t�p|��g0_}QO3?�{R�����|H0�I�ȡb�I��t5�&6^�|�����
�������#+���M77��	E-�z �8��7��}�H��4@$v+���]���
p=��0�Ѵm(����
-��<���%�:����m���4|������t�	Ú�p�Yb�Wc%��ߠ.E��Rя�ܕ��
v

B�_� ��@�V*���W�4�K4R�"�S]W�x5a'zB��׈����ۺB$���
�0���H�J������q>7ƣTĀ��S��{�
M���[}���E}.��j	��c�
� ��k��b��gg?�m���q$�x�7}�|�bs>��8H8g}��=�#�C����7�7lrs V��AIZ9�A(�DZI�0?Af�i*
�;7�v#^����]
��|�
-endstream
-endobj
-14766 0 obj <<
-/Type /Page
-/Contents 14767 0 R
-/Resources 14765 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14769 0 R
-/Annots [ 14763 0 R 14764 0 R ]
->> endobj
-14763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.07 323.847 328.202 334.751]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14764 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14768 0 obj <<
-/D [14766 0 R /XYZ 89 770.89 null]
->> endobj
-14765 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14778 0 obj <<
-/Length 2454      
-/Filter /FlateDecode
->>
-stream
-xڝY�s��_��ʭ���\���f.m/n����@$ӡH
A��f�g
��D�쾈�r,v���v�g�^�����߲hV�"���v3+�,�
���}��i~���w�(͙(R�e���p�͇��v���ŧ
��L�	���jw��'>[��gQ��
-�n������_|,K�G���LD�L&m|{�/2�s�T��ljz�Z��j;C�Dz���‡����4���Y�Ik�������گ�7[5u�/E2�o�Lת��P��d$w$ˤ�ʈE�#��Y�~�<�X&fE.=OM
���~+��s|=��/.<ß.)�s��1P��X�
�.���7^
��XDY�d�ng�=R�BF��4�4�+

M�5�G|N�@�|)�����PƔ�ڳw�{{1߷Ͳ�;��U�v�ӭ�B)9��'~�	�f;��:�w��5
|S�����e����l�*���W��T��hީ�/���L�y��Ꞑ�_AV�z��X�K�
�"gi�3��՚6n6�Җ�6MG$x��j
��^���!����� �n`ɖ�#Gr�:�LD����ɏ�Ѩ��;�`0e% W�I	8{����2S
-�)�y���4��=�06
�o��^3$f��iuC�UӶ��
-
�V��`��=x����$;2U}\�L&8�Ƿ�=�)��Xq���Q�&E�����8��^�`q�1�����ŀ��?=?s
1){T.��kvSg�X����-�ְ����A�\5�V��0H�滲.w�
�X�gQz׻}w$��]����
V�v��F�iU���1�ޒ�a9�Z�F+S‡W��;{J�Cӕ+�q�P
��#��#rp
�ԑ��f}�k�A��^���^8����At��O�V3^�
�	
Y�	&OEע`�S��dhu<dW�P���#��闂{��x�sO�$��쩖
n�4f�4EO3S1<G��3�$%��*U5�e����
��mݙ����#�8dn���)�zВE�ĕS����(�XGX����dGzS����K���^�O�����S�u��
��N
�a�|4�0�|�ݖ
-HnBis3:Kp��4L�'̐j4۲Q
-:�H�)�C�/��ïS���{
"V�O e}0&
��v=��8d��
�TvC�?d ���I�h�� eY�"�;*u��2��ŠŬB����.ɬ�B� �q��
I��X�@�cBv�9bM��1
j/�9�=����+*� �2T�o���-�b��m�3)ᝂ�/z[�!
-
[HcY���gIe�d ?�/c�M���n
��'@�C���0�
�B�6P�(%{%H�3�S��u
��e0ɷ#G2��’3
����2Uן��w��ߐr)PYmX��h�(�e�r��
�����
|}
�t��?����h
o��~��UNǠ
�'�^�}����\��>�E"���Y̡��s]�����l�_��$ai!�R�px�n���2�S�A��:�
��R�Ջ$(F/� �֝�(s>Z;�A�]�o�>�ퟪ���R�QH�Wj �J�!�VhOps�n��%�)�q��Rb
-�C�8U�����E�5���b�ǣ3V���S_�[)^
KLm���9�N�(�2�+à^�mgű��q�
5�E����Q�!
=
i�d�d1=9
M.���U�V�<}R.���N���������ssG�f��(z�Oi;�S�s�~��<�z���
ׇ��^��ݺ����.W��l���Y��"!ʞH@��2����4�@�
k���bb�"��� G`?��&
-��:�[K��Kć��a���r��j��9n�g]��`�dlD"�DV�ˇ���nڝ�������τ
��4��`��~
�e���,�V�r�!7M��<�����s�r��W��|��D�������{�`�R�:H.m�+
DK��8�u� �
 
�2x��n�0�=���/YU��-ݗ,�G�л�T�8�7��<w��3�H�w7��f*��2�� �0�����s��(
�^6w�'st����z���r
�C�^��VoZ=W	��J�5lSnh������:��}}k

�`���:e��
��GD��	�/۪�
��$	A1jo
-�����C�
�
-A�+��
EՐ>�D����
�z� ��	�^ic�
�p��3���I��/���j8�N�uX�m�+�΄���+K8 at 4C����T
�S�F��B�r�o��4�\��
�j>������g��<��-�� �����&B��O�O˹�
n52��G?�޼�E��6�ذ��[

��rp�4��-X
��xF��
\�������$�;S�S��Q�Z��{�q��m���Q������dޑ<I̒������Wo�,[��-[5af89LQ���O�vM��A��t�Fd���
�]��
-endstream
-endobj
-14777 0 obj <<
-/Type /Page
-/Contents 14778 0 R
-/Resources 14776 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14769 0 R
-/Annots [ 14770 0 R 14771 0 R 14772 0 R 14773 0 R 14774 0 R 14775 0 R ]
->> endobj
-14770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.7 382.467 179.832 414.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 285.312 163.106 292.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
->> endobj
-14772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.226 169.796 200.359 201.423]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [121.382 158.215 150.891 168.745]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abac8b241f6c2a61248fa768b9157203d) >>
->> endobj
-14774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 140.387 192.396 147.913]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
->> endobj
-14775 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14779 0 obj <<
-/D [14777 0 R /XYZ 89 770.89 null]
->> endobj
-14776 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F93 763 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14790 0 obj <<
-/Length 2714      
-/Filter /FlateDecode
->>
-stream
-xڽ�r���_�<k�9p�*N)�䒭��ɋ���b�$�]���Y�����=�Q�s<�`���/����g�:;�h/
�X����˄��Y�����RI�XJ!������C��\(�7���r����զ�ۻ�������]��o6��X�H���y���M�+�vY% U��~g���9{qu����'��(HR�8���Ax[X����R�9t�B�a�{o��q&\�b�p$E$R{�����ի���o*$M�~�w��&~Λ�zW�]�Б��r����fm�
�=
��*���p���R��}��Fߖ�.���
,殫�몾�C9ݬ��mS�=H�@4(6P_�0+�%��E�Y7ےN�D�t�I�9�[�@E8��k�e�^\�*���TD�r�QD�JA�%M
~q�
��q��4HDf�,$��xn�r�"�}�
��
����ؗ[�rP—Aif���oJ

-�ȷr6�]��7��C��� �8��"�i�c�T�,��(��n{mI�^D�뷫U�
{��OgԱ��� ���2��UƖ�A�`��#>
\6����F	��@,���M_��0N��x2o�
L������m~(���F[Z�,/�ZM�e\)��@���a��-w�i�
)[Ҍďu�Bz��L=@{ͮ�
K�10q��￘�ժ+�5�_[�#ENm-с�,T�zO@�Bm��KK*M�z�[,c����R8��%�g��KS�����}����ih7Ht�P��
���z���=�A�F'1B�#��}G�l1�KkW�
L��
-�>��{��Zӄq�DŽ�%
�
b��bK�R
u t6�ڒ/-G,3�H�D����J�)�ϼ�Hg�� _<qJ���u������}48��+�Oe�[���$�:8�h\�T���i�7t�ٱߺ��se��n����u���� 7�W&"������^�
6|Ȉ���X�e$"�ٮ�[�
�~!�
-_9
�pu$
ZKfo+�;V
�CZ5��8
#9!�i�8)�
f�M�i1y�X�	#3�g�eǻnʶ�܍���s6Dg�Z�:Ǥ�}E�-��"<���[N/�Юm�m��
�
s��
$NG@"3�!�Q�{��\;0IZG�N��)⧑
-
&�.7�#+�D����p��"�Xtu׷9�/`Hv�
�2#fu���j"�X�e��f%��^Vx��Xn������Z^�����d�zw�Xe�����Xّa��
�9�,��t����!��5:x�Dq"MB
�cI��
׬JO�6M�k�C��t��W;��0�qwͱFq�$a/bP1
-�9��$Ys��
�B	���&����
�3�#dCmUзq(�@2ܡ|��P at 5rS���
x�]�0�
Z6�
ƜN�c�������cG�	oow�
�Wϱ�ڿɴ
���Sp��|~ a��-��{Ō~x�U3�p��j�^ۤ�H���3I)`��������|x�~0���mS�,�#N�*忬�
����js��GԎ��>=B�U��S#r^�v>ۅ�;����o3}3[����Ǹ�D��o�)p����b�K 1
-S/��̋ʠ�*=F'W��ʭ�>ZPeq�0%���[����ː���->V-ǁ ��#���<�TT��8�ȑ_�/��
-}_�nI��*�:CBd�n���Ѳ�T�aN*۝�٦��:Q&�bxba�NO
����fc��4n�
-26AI��i$�E�#��W$"J�6��`����1�4��qa�L���
n�ʻ��F�f
�
-�,P� 
�Q�+J����4L��! ԧPS�c�sq���zJ�y���)��h
-I�u��r|�Y�N5��	�X����qc�Ҭ���x��O�cxݟ�@��} �˯ft�pi�0p�
 ��X ��	���M��b���
-�WFS2�h�h�t�q~N�Lh�L�
5�cN�IIñu�=�{��,F�l�9���͓�β9o�c�4�
�?onrjo��,m�7u at O��bl*!��#5��f�������&;��8�������!&\��/ �.ɀC�N��o�i	g���fN������i��
/@	�S��T���M<x �&<�
�$2�
?���|�H۫�am�\�(6M��d�H�����v����W'���0aD?�q�B:��j�><��!w���� 3x��b��
�CU������>b��9��� ������5z�DBv�f�.��̎��
�y��'� �6�x�#���9��������O@ Y�����@�(=N��]0u��L��n��AxbK�
��������U]��r.�_�J�)3ZSl2}
-l
�.�	�v*���`����?��ӟ1K|/B��/G�
Y^�׍c���c}�r��Q7���{��E�	ӏ���M�[(j��:���l~}!nl���
^�V`�(����![yD��W�]A���k�
�p�\*j�04PN�'m����_�E�2����8j/���V�-���Xĝ���AF��� ��/�'
ē!�lˉ�p
���ӦE�
D9(���~������'��M�P��G�2���S 
-{���w�Q���  ���5M�ٕ�П����Ѷ �(HW�)�I�
j�eo��8��gg�R
;�"�0������������x
~�:(H�c/���T�
m�C�v��
����|�r��
�XYI�0�/d�(s�M{��_
�wр�O���=�
-endstream
-endobj
-14789 0 obj <<
-/Type /Page
-/Contents 14790 0 R
-/Resources 14788 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14769 0 R
-/Annots [ 14780 0 R 14781 0 R 14782 0 R 14783 0 R 14792 0 R 14784 0 R 14785 0 R 14793 0 R 14787 0 R ]
->> endobj
-14780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.407 616.836 393.75 627.74]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a5012c55d8fdb1420b80a3bfbe5a5b843) >>
->> endobj
-14781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.21 294.227 328.575 304.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a43eb178d5fe05266ba5f76962e836bfe) >>
->> endobj
-14782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.754 294.227 514.119 304.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44) >>
->> endobj
-14783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.116 164.302 513.996 186.384]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) >>
->> endobj
-14792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 152.347 294.015 163.251]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) >>
->> endobj
-14784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [116.125 110.199 268.691 141.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-14785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.684 110.199 513.996 141.646]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-14793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 98.244 157.965 109.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-14787 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14791 0 obj <<
-/D [14789 0 R /XYZ 89 770.89 null]
->> endobj
-14788 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14804 0 obj <<
-/Length 2980      
-/Filter /FlateDecode
->>
-stream
-xڽZY���~�_���U��
8W�J%>T�cY�n
R�K��KX$@�W�_���
 �˕���\=}~=���������o..�K�,Y�����,��$�D��z�.9������S��f9��?������5�]|{s�ۅ�.9S�@$�t��]��E��@�~&���ٽ�����s;����d^d��X�xRZ	�Y�ੈ��ZGns?m�nI�V�|�#�ˍ�r����Ze��/p:�>�>Qd�!�Ŏ�
��R�:�c�f�]��W܄��l������8�8Gy�w,���p���o?������FG
^	
��%	4�3�
�
��\E����~��b����t,�R|��8(Z�sG�gmW��)�:
-~�u���Y�yQ�5��dj�^��h��qv�=
�?U�Q�0qrV;:�Ƭ����ڝmya�*�Q|"�"�ip�׶�
-k�)�<얶
�6��⽔zU��n�|g[[���-��P�(G��7E��"l��Չ���(�Jဩ '�s]�3H��.��Nj �c���6�N��\s�GGs���
-�x��F}�����B!;A{���0����Eˎ�Һ5��$���Ӟ�d�ӐM�.r !)���Kw��˸����9��i�yɫlk����T[b~��ä·Al'n�FT�_�U��H���*�బ����
:^��-h�ͷ�j�(ǖS'����C�ڊ��vK�k�
��_��N
n������-V�y4���\7UE�hZ
;q����)K��.�;�"A"3��TȔ�~C��Sp��ik�<m3\�����k�SC��
O���X��iL��A�Z螬��J�{c�c*��Dڎ�9�E����*8C�W�A�s%�\�'h��u�����M�,���ϱ�AK;��$Yp�\.1nǿ̣(h�}[��f�yd���,�ϝK^�����Ph�&�vS=�+0}�fn"�4��xu���b�lp�m0��A�X�����C���
�1u
�b��Ct����/!IR�L
V�B�p>��h58����O
`���M��3
69��q���R$��;
-&�
!�ZAr��U闷D���d@���
Ѹ�0`��A�Y�V��1eM
��€����yI�1�D
���R$?s~�����6����~B9�ƅJx����{#� �ą�TP��"
Lhm��+f��^ � Ϊ���~Ŗ�y

�A
?���q���:���a��
&

-Ņ'���D
�
���KF@�1��S��
���
*`���	��=n�m3�	 ���1��Z���>��T_r�bQʑ&�uLP�h�U�K�9�n�>
s��r�Eyn
Qpa]��yK���5i�Q
�r����z(�t�HE�Br����t��3�r]z r�����.��c��a0K���ݿJ��-������
-�Yd�X{�u�<dpXTH!�x1��
B�Yࡼ�l��>t�^ގ�^x��ρ!8�N
�P3�ʶ-�.�
�ӠڷŎ@qJ��B���[|'ݛB��Γ ��g��pd2N�e3ɰ�,KNX��\6�\��霢��cӑu���-f=q�͠9&!���O7�|ހ�M��e�	0 {������ȵ2������k���:Pk�օ=�OT.-�]#���e{����;��F�E5��Sq��,�:�8�G>��,J	]��
��Е����O�PM�e��ę�F%NrH(�5���`��H��ҥ�q);(}]���x�CM��η�������:}����ڗV踻�S�+���25�p
N���|O�]�=W���hI�6J
�M����r�����|�q�

2�� ^\�WX����ۜbv.��q���>N��}���
-�֙/�>��W�+����u@���
���<Z\]&(#-�`Y��{?# 
���O�����
��Uc��ڇn�Nj��'��a �܃Z6������ـ�BoqR�AME�u`��)H'EuHj
�L�	�.��!��;;pz	}܃�r5���������tهeeg�i�d���r �O<D�b�%&�! 
2D�"�鯘P$�h�3�Z��}�n�=��F�
h��p	4���
(���(iDe#E��"ҝ"!�ɉu2�l,s"#b���	���� ��q�@��
8���J�{���x�S�X(����I�>���
,�W�E[
��I�f8� �%�%��=�N���u�<Ǻ>�Aܛۮ"�M�H;%o�����|$N�B�����rX��x�I��F"yn����5�
z�L�
LW}h
���2m
Q����(R=*!�oT�ǥ=9���4_hu
WS���X��q��_��X=_�j���jm2�;&9� m�&|ft����  `қy
-���ζ\�櫏������]
ގ��A�?���
�t��g�E�����ǵ��������qA��|ʶ��5E4��g1��#
��մ�#�I�Y
�M���b�K�"{N
��չoo	��#F&T��G	�VFF�>Z�^4�%�S
��{
!m�Z���
-�Y�!a:
-j@ �'��)�5Q�Dfvg�gYy!�,�I�3�Y�͟�����.�1O1Nb�@sݚg��}�C����>���
��"
-��7yٌ�ˎ[(��š��ˆ��l�\�-�C�
��3"��t|R�J��f$T��j��TD����:�
-��
ˉ���m�����etj�!h[�e���כ���@�`�qIB�5��ٜtc	�j�G��p�F"nl��c9_@��D�$h���&h���}D,y{y��^�kA9�f3Yܟ�Cw��+	�X��.�z�j��]si��{xW��N����b-m��G���0�w�P�
�V�$Ѯ��v�~._���
-;.�����ߗR�l!]���������N���?����ݗXx�1/��
�,��ǿ)!�z�ݴ\wW��ǎ�.��hz�D!�]|ݴ����ry�kly'V���
-��d��I�I��VvU�iCRN�@#��]A�
-endstream
-endobj
-14803 0 obj <<
-/Type /Page
-/Contents 14804 0 R
-/Resources 14802 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14769 0 R
-/Annots [ 14786 0 R 14797 0 R 14798 0 R 14799 0 R 14800 0 R 14801 0 R ]
->> endobj
-14786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [356.02 707.957 411.153 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.03 628.009 450.162 638.913]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.966 546.031 511.506 556.935]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a97ccf10304ef9ba8b58549f7570b8cea) >>
->> endobj
-14799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.428 367.516 299.456 378.42]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4ec7c4c8093efb70675c35a17d6a7e28) >>
->> endobj
-14800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.955 278.024 418.715 288.981]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) >>
->> endobj
-14801 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14805 0 obj <<
-/D [14803 0 R /XYZ 89 770.89 null]
->> endobj
-14802 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F90 758 0 R /F93 763 0 R /F24 529 0 R /F11 613 0 R /F10 765 0 R /F13 834 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14813 0 obj <<
-/Length 2571      
-/Filter /FlateDecode
->>
-stream
-x��ZY��~�_����1��ȞL��
��� ��� �̢!�j�vm�+�}$�O��AY�vϱȓh�T�*��i
-#
�p򷋓�7	�4Ғ���*�8J�FB¯E�1&%r2%��|Bp�����|Bq\�E�^���ʴ�?;;{~y^N����*[O�T���*�*7|�]e�u��g��J�b���/?���8����X8"N
���'����0bZE��h
q�๊>���{��'��
�ㇽ��z����(�
�t}�����̈w�F�
9O'xY�y����6�D����
n��65�s�n�	c�Y8��:s�U6!"���ŲL����M�ӻ|�[�ŕ�Y�TO&*1"������\GĐJDCs�
6A&��>3"��nj�XA!��1�g�('
��@NI���Y�9�2Ƒ""�����2�7u����H���71:�
��
M��(�r����
Eň��n�ǖ�H�����" V�*�bF�!�#���#�$��
��J
".Q�eC3)D���'���F8�om z�R
-����@}ֹ���ldU*�
-W
�K��-A��N�
۴L�Y
)D�� 2��c�VL"����+��r��P�1O!빙j7����y�y�l��A����,��l��9G	#���D
����݈� ��r�)���64�8�g�O�ʃ��'з�R�h�j�(T� J�8�?%�ߍlU`���@�P�Я�-����lq�E��
-��2K�|�܋��̪m�Y��e��_���q�Fڏ��ժ0!
��ڴrC���L�
cR�{$P����m�� ��L�Ʀ�>�U�9$�7��(ҭ!�G��3�� iu�!�=k�L+���Y�!���m���p_��Ć~^��4�P����6��9©��=���=m�G�!��A����v�[/�fCV�[������
�坚�:�����_�S��;���m�ʉ���#��P��9��|���G�)�^ rU�t�].�uh�ؘY�ʳf;�,[�#��f1�t�om@$T��/O�>{/ATe��,_^��8���TG�jm����V1fڑ�S�x�a��<m�������}����Q����C����
A���� �4MxXP�,$x$i[8�ISHa�3Y��u��U�{x�2�{x��n��o܀5A��
L��Uਯ�_��s?��*��:\��# m�h����-����m�:5�j �̙�6C@�X�IףH� �L�f��")_�=�R�@zH?�st5��#z1�^  [...]
-,Z�Ĉ�
?m��g�C���A:E�Sv�[�����8��7��;�!X�T��8��G�
-	�eT�#�/�$�p
�RJ
�Ir�I�1G��F)u����!b��
z=�J@��F�ZG���h/��Cg矷y}=H��3]�Rs�eE?]�7��iT�u��i�x��4�$8�:(�Bm�bt�LP�!y�j�4������s�X���:���6tG��;�
�&I��.�Py8#mG��^2�?(Lž�Pa0��4	�*��k&u\abAaz ל��an�
r
ݥ��
%�A�T9e#|��+�`�.�s��gZ�rh��|e��w�U��d��k��B	x����7˿���
��"��&�q
/2�{�h�n�	�� �n�/n�A�rlf���L.ݭ���
'��̲��L�*OLJ�xfM���
d���&SJA�5Ϭp���m��G�I�	U��$~��D���	 �/�Y��{����q��DZ��������9��=ҕ
d�}'H��n������6sK�櫕���0��H����T�@}�-
�Y���Уqi��4}�h�[�����,���C�lww-��Ӧ��~�LJ����l��~����.�ݍ�A�W�:���"��
O��
'�BU,t�ԣ	w�-��j��
H0
-�E�
j3�%��8P"K�YT�n�<@���f�C��~��Hw��j<r�
�I"����]���9�t
6�n�*�sC��a�P
�8=.J�I��2���KI3
h�]Jg���#	�������Ps�ףڿv�]B���!�@����X�b�ta,^�M0��'��}5h@{J�
-��@�q��+�n
+Я�L��U�ی����r�
��=Ӯ��
��L�{�~�;ph#��F�Y�����f*�8���8�\�`���j�Es�P�P
��S��j4̼��xpIh� ��h�nZ��h���:�Z��͟(��
�S
�-��榜�b�y��i
P�����%M��H�w8J�,��Dʄ웪�w����]U;���p���}e=n��0{<dvV~F9�;lo
Z����S��g�Nj-���6����H�ʎ�����`-e�S���t�B������On�s��2U���w�f�
{��JG�eu�앇��Z0��-jFw���(Dp$D���u�=;=��U�Y�y�޿��顡Al�R�Һ.���o�_����
pcG�	��o�%���C׈I�PK�͇ۗ~���E�
-0p�������
-endstream
-endobj
-14812 0 obj <<
-/Type /Page
-/Contents 14813 0 R
-/Resources 14811 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14769 0 R
-/Annots [ 14808 0 R 14809 0 R 14810 0 R ]
->> endobj
-14808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 440.872 163.106 448.398]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
->> endobj
-14809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.955 176.359 418.715 187.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) >>
->> endobj
-14810 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14814 0 obj <<
-/D [14812 0 R /XYZ 89 770.89 null]
->> endobj
-14811 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F8 794 0 R /F11 613 0 R /F1 833 0 R /F24 529 0 R /F75 554 0 R /F13 834 0 R /F10 765 0 R /F7 795 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14819 0 obj <<
-/Length 2612      
-/Filter /FlateDecode
->>
-stream
-xڽZ[s۸~���[�Ƃq�4�is��n��kog:�
%�6��%�ĞN�{.���,��v� �s�w���Gߝ�����bQ�Iety
%8R<AB��2�<�N��>b2F$��~��O��>]^�w'�.O~;!�
-G�. �������/8Z���F,���f�:�A��.N�q�
-]���]�|���P,�b�R�E
-3D�%�S�d��b�ܦ���׺�0�^UY�]5yqc�)��
��yYر�ڵE��E�����
H�@��ҝ��"��b=E ���!I����$<����D�vFngxLK�D
Q$`13�˔�IZ��|�Վa�e+����.�	H�$�h�O�=
��tH�� 1� ����Č ��{	�0
����ڭ>�MR	mg\���I$�X{njI�b!�
��ij��t@vfh{����M1�`oM�/�li�7U	*\ۇ�}�-��XfKd
�8WѪ`Q��M	��r�W�EZ��mYֆ$>iJ;��~Ƙ�}*�ս}�ځz;��ƽ���c��
Ѽs��݂;�#'���fJ&N^��:;�]9�u[��t����/�N�C2����&o���n=�Κ�҉�

.�po��'_� ɴh5Z�v�O��Q�(
�*|w��7��e�F9G���EY��2��J
�ܣ�9����z�,���&+�EyS���|a߯�"_o������d�z��Z�h)�

�=�bջ���H5��]��$,F�A���M�h��ESVS�'��n��f�c0
F	���m#J�MR���"3�4��7���bpr1�S�cqi�ϦN���<�\���J󢩝�x�N�Hp
-�Q��j�h(2R��f
-4�1A�'Lz�PT�X[����1�'GILG
-�b�t��
�bz�n#4�BG���{��ɀ_
>R�#.�}L� �Q�� 9����Q�ij4�A 
+}T\��Yw��b�m�c�w�C*uXZ�Y�,��
u^�G
�a��rݴ�pH?��mx^��,�
T*�1
&��y�(Q�]��ّ0v4���fCk�X	� ɣ\P
rA� ?���f
�BW
v{6r{�Zc��=���U�^R�s�ҏ�CG��ۙj<֢<6�o�C4I��w�����wCU�ڤpN*8|7e���yH���
-`�G�����jU���>~�3��>1PK
p'�H�8���
}�ɝTX�W-�c�?�^O%GM����Tv`j}u���>j���_��ة�M��.��F�X�_ԁ�5ʋ:���8s���ϯݨ-d�
- ��f���4〟c
��w�����R�utϷb��G���	Q�_I�r`��a����I4��I�.$:�y���i�q{b
BՍ�
���xs������չ�kD�����*AL�&]dW�|��D�G�f��y�yv���b9��h�S����k�%P� ����7W
��ib	 a��2p�
c
����̓��5aCw`��R�B��⡋, �H��E�����:��I����re0��NK�sfɍ�i�B�yǯa��m���n�$�n�hG���6����o<{6
-��e��v�Ux
�
w� .ݷ�y��;��-��6onK�f"E�H7�L��� g0����8�܇?���lR���ϭ�LR<�ʭ���+��9 at s�2Z�X��t
)$�p�� �1�� 2�	t�a��G�Bt%��If�2?}������
�[CgD�jID��*�`İf�鶠?��R�2����6�S�
-����
㉀0am��3_R� .	�I�5b�L%BPy
�ǘ�|���{-eP��$��ksQ��Z賬�B�RqDI�&~���� a�Bv������Y�:�bC��9�2vz�U�jߟO;���f*&i^�;���7��B�j�N�U��������@]9X�SV�x���i�6��U\v��u(:zN�/:r�殫�����
1�cN���9��8H���l���3������Ik��_C���#_��O(`� ߏX����4>J�֣|��������'�����}2�Fp�9 L8�ukk�@�h ?
�v�\�@k���M�yYr���{;��	��
��_j�&>� _�-L
\2�u��M���6^N�s{�@�W�Y/���{��c���n��6�t�E
-��d6�
΄���=���i,#�����3��2�ǎ4>����F_
-(�!>K��.-�2Ȳ ���	,�.���3��<�2=��D	�|�j��K���V�u�u�����)�
�����Y���4{�/�������f����ͱ.��V�E=%��\��/j��8�ute��vDK�V4��x,'�#���|)q�oau�hP�㧘�������C!����{�T�uE)u��̎3y�;���xp��Q��I ��'߂�Q�1�n�|<�t���\��:2�!��h�Z���j�bn�. V��c��5��+$���'!&ʤ6�����7p�a͢�%,�/7��f���?�t�ѵ}�����
��~�7���Ϊ?�H'֏i�m���%Y�Uu�
dJ�:D�ix�eNT��wd�`+Yz�p�x�Y�m�l^��ͷ7UnТ�˛#f�0G<����}�� /tc�:;��b�dd
-endstream
-endobj
-14818 0 obj <<
-/Type /Page
-/Contents 14819 0 R
-/Resources 14817 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14769 0 R
-/Annots [ 14815 0 R 14816 0 R ]
->> endobj
-14815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [115.086 342.403 163.106 349.929]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
->> endobj
-14816 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14820 0 obj <<
-/D [14818 0 R /XYZ 89 770.89 null]
->> endobj
-14817 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F13 834 0 R /F10 765 0 R /F8 794 0 R /F1 833 0 R /F24 529 0 R /F75 554 0 R /F7 795 0 R /F90 758 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14826 0 obj <<
-/Length 2387      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�8~����.U5�q����8��ډ�V�LJEK��Z�Tx$���m�A��Ev��U��b� ��n��u��[x�{u�����e,<Id�#or�I�Ł$aOs��(��јQJ���~Z���ՈS�X>ܫy�N/��2-NN�^_M��K��v�V�1��L�
-���N��*�) �#&� �����'G��E=�l�$N�������a�g�!�ٴ�.`\z7G�8�V�n$<�S=X9��F�DJ/f�$4DY/�<[ef��剟��r��8�U���&��Y�޷O?~�c	���Ɯ*<�B�X��fŢL���
UT�O� <��
'�
-ǦRs���P��v��n[�e�Ru�]i�{�
�)�t�<�f�t��Q���g,"�%�i���,��7*�O#
�e)XH����nʁ�>��%c}�	Jsن��{��H�D��1#�����$��ޞ��x�
�=��!�'x����
~�E{���xL!��r��QH���6���vj
 t�Jf���`:a��N��!eRƟ��z��!���#u�
�%
]�W��!�%��hN���#�+T(: �
���4%�r�Ǎ#2���������?�Y?Zl_� R��u��Ĺvٽ���t��8x�{<�<Μ��v�y��C,��L�
�P�ς�nؠ��Q�����C���K;O�s���x0�N^�e���P<�!a�S�!
	��]	x8t
%!��o���:N��G/����I%I�&i^TU�V7
��nZ��k�gjb�YQyՔj(?*$�ɧ��V�A�?�
f
��3�Ѻ̊2�FQh2�l3+��Uc
�<@Em� y�0�$ �w����A��6AB���
ab"�^K�ѹ,XF�(-�L��Y+-/����c�.�,�젯>�&3����ź�V�Y��k��Yl&�
-��
%p-m]�ʅ\�TU@\>�J�p�z
����e�:�;p+����}-��Vz��3ę�������[U̘��F�+ I ԅ���p[�]�խ���y>��f���a�E1���Nw��h
���E �S��(�m�ٯ)��P޹�c�ȓ��"��y9�_#�����ay;�٣AP�hl(�*��ހ��8p'KL����֢� �{�9Cc�j_�4��ҩ� �﫡��	F �2�wgEy2Xnn�g �w�Nux7���M&�߼��L�O'�~ߧ>P��.�5u�զ:��&�/L�$[�\N�-�1Ѭ�\����dz���Ø��Y
3W�v�OƄ�㔅^������LL�7��Қ9���/#�1v
l�ɐ�w1������O_����쵴 �:� ��}�m�~��}����y��!Ӣ��ҵ�|Þ���
�_��_����k<ȷ�����t�r�g����J�U+ެ��%�=y��{������N��>?x�\nmk�Z�c��m�-v�Q�.�Z4:�RB at x����CV߷�ǘ����q
�Ֆc���-�o^��?�N/O����xw�f���ߦ���h*W
:���Mmϣg[��;\�-�W����lAC&n��z7�� ��LB�H�!�$l�?3ع�Յ�M�HI��߇�D�� A&U���Y(������{���Dv��ݎ7�8P�hR �,%8�c>�]8�dȓ�`�S�Z�]0!�Ɖ�Iq� ��q:x���*���X�B�1Ix�A#E�s0!(�_(�1�ǽ>�2A�M;i���U`}��a�U�q�H����~��7K:t�Մu[��	�j'�uz� p��0!]�}�����,�?��0A �{
���d�y��hQ��6"�k�Ѐh��w
`'�!�t4"q?�
�c=�
-Q�PB1��~T�8+V�Fg �xo']����t���T�Fx
&z�Z�3K���ʮ�ݱ����V[�k&#��
-%9f=3�>:;�C����D����@a`A�&�M��6��I�I��M���V�V)�eQf
�[��t��
�H,T��ж�n
-s����N�i�Ͳ
���s��`��K�n�7M&�}�����&��ݟ5{D��!)J(� �xU�qܢ�O8`���
�K,7a�WT�sU��\� &������#�6a���X��n�|�-t]޷.
S�ϖE����6;KF�9aS�&���j���cB�~�����2�"5��€\�� ���;���em;�
�n'sӥ��&��ζ҃Þ#��d�-��{�-�'���y������P�P��
�1'�g� �?ALB����$��
���T��Q�6v^�yӆLm5h�eյM�x_`*ԿQm�������~d�vÊ�4�M/����'�Ƿ͢R��@����=9$�q8�
-[ଊ�ݛ尸J7
̧3
� ��V�̏p�.cnv���e��]8~�ދ���#s�
-endstream
-endobj
-14825 0 obj <<
-/Type /Page
-/Contents 14826 0 R
-/Resources 14824 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14834 0 R
-/Annots [ 14821 0 R 14822 0 R 14823 0 R ]
->> endobj
-14821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.761 527.368 221.894 538.272]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.512 413.299 221.645 424.203]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14823 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14827 0 obj <<
-/D [14825 0 R /XYZ 89 770.89 null]
->> endobj
-14828 0 obj <<
-/D [14825 0 R /XYZ 90 592.445 null]
->> endobj
-14643 0 obj <<
-/D [14825 0 R /XYZ 90 570.069 null]
->> endobj
-14829 0 obj <<
-/D [14825 0 R /XYZ 90 570.069 null]
->> endobj
-14644 0 obj <<
-/D [14825 0 R /XYZ 107.713 486.57 null]
->> endobj
-14645 0 obj <<
-/D [14825 0 R /XYZ 107.713 470.63 null]
->> endobj
-14646 0 obj <<
-/D [14825 0 R /XYZ 90 458.511 null]
->> endobj
-14830 0 obj <<
-/D [14825 0 R /XYZ 90 454.028 null]
->> endobj
-14647 0 obj <<
-/D [14825 0 R /XYZ 107.713 372.502 null]
->> endobj
-14648 0 obj <<
-/D [14825 0 R /XYZ 107.713 356.562 null]
->> endobj
-14649 0 obj <<
-/D [14825 0 R /XYZ 107.713 340.622 null]
->> endobj
-14650 0 obj <<
-/D [14825 0 R /XYZ 107.713 324.681 null]
->> endobj
-14651 0 obj <<
-/D [14825 0 R /XYZ 107.713 308.741 null]
->> endobj
-14831 0 obj <<
-/D [14825 0 R /XYZ 90 280.059 null]
->> endobj
-14652 0 obj <<
-/D [14825 0 R /XYZ 90 257.682 null]
->> endobj
-14832 0 obj <<
-/D [14825 0 R /XYZ 90 257.682 null]
->> endobj
-14833 0 obj <<
-/D [14825 0 R /XYZ 90 145.601 null]
->> endobj
-14824 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F112 1773 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14841 0 obj <<
-/Length 3021      
-/Filter /FlateDecode
->>
-stream
-x��[[o��~���SWB���g�-
-d��E�V7q��,
Z�m��P����=s#�ug�/E��3gf��\i<z�яW��\��A�Q�I���~���	��c������FLjD	o�����o7o~�yo�]����tE�
'@ �G��Շ��h�a�=�lZ�8e�������Կ�
-sh~�� ��P'c>R�!��S���l]�bc��5��
��<�HP�W{�@z{�د-6#Ʉ#۷G.<MP"DG,�_�iދD��#
-�셔��>��6'�aI.@��kns6��իEV<T��YYN��J�O���b��� L�C�3d�#"վ�~'���o
�Մ���b2���{3; ����1I���=ӑ�
3�3ل�1 ;�T�i�~>�~��
���~}��q�Y���ˊ
��#��I::* �I���o�`	L�$�$�I����o��t	�d�`�$b�N�c<���z�V��vB�W�B���sO��+�x�@�e��2�i=~[�H�
��I"����i�L��9�q�`r�w�(JtR/��Q)粽N�Fǫń���l^�������!T`�س�
-��weZN�z��ի��=�
Z���+�Y��p}u7Q�E�ܡˣ
B	N( ��S¡�X
o�b3?�J#��h�9
���3���*zO&�>�
|уLJc��i�
��2

�Vݪ��z�Q����y�t� �tR�j�Fճ4�#\���IB�Wyz��6�ﳪG�;�hx�/}�fe�"�
xj�'�,) .��Dd��b�i�v0��yB1��.r��aL����a��@'4�� Y���{���$��܏a�=X��;
Is�e�����[�k ��_�	�B�w���n z_���գa�}zʊ0����Z,�i^T~y�y�L��
�.B�Z�1�e�Uˢ�0�]��ۢ8�:�p؆�)rEcA�)���ێ�>��
W��4��n����V^��Y毯f��2\���QRC}}����
�F�٩�����r]fU6wR?�:-�
��
j��-������"PBt�:q�'
H(Z#��f͑��$���m�hS
0M�6�
��$�AX"%"�E��KE�ىK�h@J �j�q��E������gc�Y��0���
W�lҀ`�=H�y�������jcL�e�1�BZ��˱���ymy�Ǽ�O���o

-�	���� �11$��� ����N�
#$�\@���Nu�/R���:�C�Z��*Mk�W�6UZV;�Ѹ��v�
�C߹s�
�X�
��%:�q�<��P�V*
����ց�Q��L�~�Ŋ�FqSM>�,���8
�Ξ�nlp�Ы!�6�D�6��YE�����LA�$��;
-s��ӏ�X��9
����ԑ���Y��	�K��g���x��w�D���x��Ӫ�D�
������
���dZzr�X��CV�#��T�������CN0T�;3<��O����
6j7i@��bX"/�Q(��b��]�Օ�(
-k��5���ֻ>�6�Ǭu#
&-��y߂0�Y��/]��[��L�� KՑ���V��z{Y�w/K/��UiQ
'���ׅ�p�}8�+�Gp9u?M�%]IM�
-g��e�Y�F�j
�c[���z{+ji�
-�&$je>�_��C��FNcz�s�t���o�N� �e�A"UrXr�̃�AN�8���A�f�;�7T�x*f���}��YN��/k��`�P����#<���*�;�{�}D�=�\`���%]&Sr'ZYQ����}�tZ�B
-��\�U8��
-4 79�``4ѝE���f�t��
��6M=�K!ډw�_�~�A���)"��%E�V��	���O�����
Y;%c�������|�uy�kI��"`�&����)�v*����Y��
-ۍ
-Lof�{��Z�`��53M�ފ�C��C��Pq
-nM#�\�Cň%�SxH`�Q�۔tT8���~V2�
-4���

�s8��4X.���HG���8�j�
`�ڰ�l@����ڀ�&� cs,#���E�ęV���׿
ԸYO��_6��
�%_6,{�
��$	ᓺ�EO! �J�,��v��E�w	�v;�Pb�� b�	10����l����$�2vb<$��~e�����|��q}�HJ4�v
���W�����j��؄_�^Ef3	 �b��R��K�[�?7,6�E�-�`��w���+���M+��Qyܬ�.���ǰ/�6�U픾9�d�����f/���>�D[1�
��T��;=�;l�XQ4�I�̣
�i�[Woic�2�ɸxri�96	����7�1�͹�
�o:��
��n/���Vu���/[B����݀�ə���Qfm�
�7���������w.u�����*��	
�j>����W����E�`�T�(H�3�0�'"7_�4���6H��G����0�M.�H��
.�ѕ0�%��f)���!��˘b�g�z�6�tm�q9�
-����V�h�W��7_�'rԓ�^p�0�A��0�[a4�x4��Ϟ��٥�)쓐�5����W̺��l����C�F�
*
��<��f��>�q�<
�)D(��%�Jʳ%��4)��t� �,S�a���+ȴ��p�8��agO0�xNw����jb��{��/�	:<�OК_�'`��>�4x�
�!MԹy��m[
ᛁCpc��+��ل��'�?��Y���|����Z���/
C-�i]vKpG52�05�A:���!�F�n�s�y��c^ s�ƐJ�5�cuH
5�)�����|�pw�2w�n.�.��<����{W��֗4̧��W"�|�˚t��ɔ3a_�C&*��"��t_OE݌��}uܰv]� �W�
�g�q	���ƨ�`(L��������
��
/�.���k�MA޴�W��J
���]à�:���/��ߛ��f"̟o��_Ӣ.ѻ��֔M
� 
%B��s����Z�
�#}GB�9�cU�_�|y���f��6���p�6u��-W��Vpqi�a}[	[�?�x��
-endstream
-endobj
-14840 0 obj <<
-/Type /Page
-/Contents 14841 0 R
-/Resources 14839 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14834 0 R
-/Annots [ 14835 0 R 14836 0 R 14837 0 R 14838 0 R ]
->> endobj
-14835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 693.377 432.413 707.324]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
->> endobj
-14836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 480.788 432.413 494.735]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
->> endobj
-14837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.997 146.418 486.519 158.752]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
->> endobj
-14838 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14842 0 obj <<
-/D [14840 0 R /XYZ 89 770.89 null]
->> endobj
-14843 0 obj <<
-/D [14840 0 R /XYZ 90 718.682 null]
->> endobj
-14653 0 obj <<
-/D [14840 0 R /XYZ 90 684.012 null]
->> endobj
-14844 0 obj <<
-/D [14840 0 R /XYZ 90 679.529 null]
->> endobj
-14845 0 obj <<
-/D [14840 0 R /XYZ 90 596.843 null]
->> endobj
-14846 0 obj <<
-/D [14840 0 R /XYZ 90 506.093 null]
->> endobj
-14847 0 obj <<
-/D [14840 0 R /XYZ 90 442.506 null]
->> endobj
-14713 0 obj <<
-/D [14840 0 R /XYZ 90 417.973 null]
->> endobj
-14848 0 obj <<
-/D [14840 0 R /XYZ 90 417.973 null]
->> endobj
-14714 0 obj <<
-/D [14840 0 R /XYZ 227.842 360.801 null]
->> endobj
-14849 0 obj <<
-/D [14840 0 R /XYZ 90 354.161 null]
->> endobj
-14850 0 obj <<
-/D [14840 0 R /XYZ 90 273.631 null]
->> endobj
-14851 0 obj <<
-/D [14840 0 R /XYZ 90 183.678 null]
->> endobj
-14715 0 obj <<
-/D [14840 0 R /XYZ 184.963 84.126 null]
->> endobj
-14852 0 obj <<
-/D [14840 0 R /XYZ 90 77.486 null]
->> endobj
-14839 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F8 794 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14856 0 obj <<
-/Length 2370      
-/Filter /FlateDecode
->>
-stream
-x��Z[o��~���S+՞�_���I�4E���K�D�D$�!)�����^��$��A`��h9���|��.������_a{
-ǿ�]}�V��AFR9�{�<S� !�j=�iN0Rr�$��͂�yRl�����|���������H�����n�o����a�nK*���MR�����1u?��U
-F�$lΕX�r���7wW�]��g��H��j{��/x����|f��k��q�น�^��
-G�9��F�!���[�#\{]P>ϳ��I�Q���
#J#Έ3ư9�"�M��q��Y0
-q]2��=@)A�L�R��� ��\,���@�
-��t���/H
��PsȠ��d
g�C�*��$0��F�tɴ�j�.9A�ġI�d�V@�Þ!S�Q��!鵌z._��A�
kD�$�r�Q��l���,ߕ�t?c�K��|�*��W��T)D`��`����wa(�5K����ix2�_b$��?���N�U����@�C4��3i
b��3q_�FT0g��~�ښ���/\��Ǥ�"c]�?}+����SsI)�L�� 8�Wϩ?�c�N�����y~�v�����K�߳ճ?M��a0[�]������kR_e���]�̀���C�%�qP�xr�vi+WN$�#�;���U�R�`D��
�����Od�3�`�O�dn���l6`�K�DĘ�$I|r��0�&��*�#�[��u,���#�E�Q��ǎ_8��'�"��
-P�L�W���2�ü�l��=�����
F���ul8(�Hc6���
0��
e�CEQ'
�R�b�@�D~�=����g cd�=�c�o�p��e�
 
�%3�I��[h��-ͭ�]^��U^i��������
����О6<�aQ
W(�"*�?c�|�PQ��W=gC�]��F�t
��
��83�"?m��l���Y],4̪��˜
-c��	c��5PJ�
-c�U
l�4�H
5
-c���!�ǀ��I(@@t/�ձDJM2�Ȉ�`8�V$�[�^�q!�j7�릺|�>�t��Œk�z�����eD�b��:��V��] �������rP{��=�Q簜t���N#�l�y�S�%�{t��j��5��@�NY辀M'kVH:���X�@�hO�L�L�g-kz�~L�D~ve�]�e������>R�t$c0ar�d�!Y�@�lUm���S�&aMa�$����A�T_ހh�"��ʛ��q��Ev���Y�ͳ�+�Ԕ��F
��g�

�5�(�T�P����Ƙ) 8u�u
a��QdV��^
�!n4��7�Ƣ��K�A�Hq\�(��:T7��oe�n�fH����C[¯����L
-���3r*f�Cj�&q����PifHp�w"�3'���( �����a�+ u
�`�R8�I��M�)�Ok����������鼬�O��ǴO�e�}$��G���p��p�+3�<4��^��N��w[��ΒO�+)����VA��2���2
-���-#��"4�+k�H.)�8��n�It�Lz�J�h�
e�5��K��l�IL �D���׾9�1�?,0���ՊG�F��O����\�"�fT9	  ��CГG>�{҈����� ��$�A�TY	䤉G���1�z���5B��}�BTPN���� (:�e��z;Q=��*S#��@��4�I��������V�����$
O۵���1<^�t"P�}�]���!>�M�T�xFI�f��ޤu�<�2�H���c
�
�K���Au�OE�o���i\C@�4c{���*9
\D?�f2k��wl at C"R*&�`$�
C8_�g.\ `\"�e/�"T���ʀ�De�_ з���rµ ���|?c�4�ϯK&XH�(��}[��'����
-��s��;d���ʿ̳�����ÐT�M�I*�z/��b��=�I�=l�G��ѥ�g8�e6��(�v����������Q|�[(>���C������b:&d8�p`�"��w��8S��c/�c�L�+`��!���hM��(D�18��ާ�TǮ���5�;mF�y������?�B���_�4��ѿq���e���IES
l��~�	l�a�V�RO��s�&�u.����e���w��8�wMX�G��L�W�$
7]' ��0�����ߣj�5�ds(`�%����!��Hho7ڜ��D����9�P��_	>�>øB��|�E���_:�M�H޼�a��
S].n~�'�)���
a?,t��Lv�$�%;L��ݣ!{Y�d�o=��,\���Y}���i�X-
-�﹪^�?}z�?���	��9
���v����ۼ��nn�
Bur7�9��HZG��TFL����:�����p��w[6�[n7N�L�
-endstream
-endobj
-14855 0 obj <<
-/Type /Page
-/Contents 14856 0 R
-/Resources 14854 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14834 0 R
-/Annots [ 14853 0 R ]
->> endobj
-14853 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14857 0 obj <<
-/D [14855 0 R /XYZ 89 770.89 null]
->> endobj
-14858 0 obj <<
-/D [14855 0 R /XYZ 90 655.872 null]
->> endobj
-14716 0 obj <<
-/D [14855 0 R /XYZ 90 609.246 null]
->> endobj
-14859 0 obj <<
-/D [14855 0 R /XYZ 90 604.763 null]
->> endobj
-14860 0 obj <<
-/D [14855 0 R /XYZ 90 543.856 null]
->> endobj
-14717 0 obj <<
-/D [14855 0 R /XYZ 90 497.23 null]
->> endobj
-14861 0 obj <<
-/D [14855 0 R /XYZ 90 492.747 null]
->> endobj
-14862 0 obj <<
-/D [14855 0 R /XYZ 90 419.884 null]
->> endobj
-14718 0 obj <<
-/D [14855 0 R /XYZ 90 376.958 null]
->> endobj
-14863 0 obj <<
-/D [14855 0 R /XYZ 90 372.475 null]
->> endobj
-14719 0 obj <<
-/D [14855 0 R /XYZ 90 284.07 null]
->> endobj
-14864 0 obj <<
-/D [14855 0 R /XYZ 90 279.587 null]
->> endobj
-14720 0 obj <<
-/D [14855 0 R /XYZ 90 181.384 null]
->> endobj
-14865 0 obj <<
-/D [14855 0 R /XYZ 90 176.901 null]
->> endobj
-14721 0 obj <<
-/D [14855 0 R /XYZ 318.321 121.701 null]
->> endobj
-14866 0 obj <<
-/D [14855 0 R /XYZ 90 115.061 null]
->> endobj
-14854 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-14873 0 obj <<
-/Length 2055      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�8~�����
�
���ݙvЙ�N��>�E�ش-�-y${���=)Y�e%m\`A Q�?��s��e���G��]�S,�HK*��E�q��FB�h
ݎ����7�DLƈh	_U������7��������W8"N�@*�f���g
���/FL��C5iq�ຎ�G��6�;XA��5�L�T�q�_���6O��)� -ݵ0�}���-r�:��u�-LR��k��Wﯼ�"��T�#*,,{�`�6,
M)E+�`�$��`2%����yj02�����$Ǫ"1�OU$c�(�C
-�HǺQY�� �A�BV�0f�Մ�q��2~\�y��R�8��@i�8!����"����K��cJT˜���UG	ń�q~?Qc0��� �9���@��s�`,F��F����4ϜS|���K2.w��˼�&��wx��w�ն/&��:��WnN������M
ɡ�*}�470���77]�`'(Vͪ�oQ��j�m�*[Lm��BDS@���%�<+������� N��ue
��׃2�L���ǔͦw+�-��h�o��];oTr(v+��]�z�p�zX-�CDҤ���
�)�	RتH����*�$c�!�{J�^��ߺ��]7�K��8
N�
'����+|AG�N@&����5E�)��'"
dB�"`|�[^vZUDRx�B��)��*DqS�r�߁�z��r	(�D� O���8>���[b�!BC�g�<
y��s
S��N���"����7>�9D�!�m��Q
�47�	��_{g.#��z��
�
�,���]�t+��J��v����
-T
�GB™��y����l��H��H�B($����Wd>�
-��_�
8(
-��
���tE��Z"��u���D�'�V"��C�/2*>��m,�ٝ)�	�X
�<�
�@�ιI�
-8��1^%��]�L�@
7y�*r�ujX��xL�����(�|28��
V&�L�VU�ɔ֥�*)�e������̟J3L#&_�W�C D�a�_V/�9�d`�5APu
-R��i��=���s�nLV�%�v�[���%(Y5�w���p�XVH8U/*� .�*
7��Z*I��Y @%��` <]˲���s `PMk,;J�ԲK
��U�J�>�*�mR0�O�=�j���<�j�
�����
j@��9�� )I�t'��8�廖�]�b�p�}�+:o�d�`�M�x�f�43�Kc��ҝ+�=��U���f�m2�m��nX3��C�p��s����!���ҝ���.J��U�?Wsk�b����:��cuӁ qw�]�)k�� ��f'��N�=XbS(�KZ�&�.��-�wEj���$��`���G�N\���̟�0�)��7
�>]�[��s�m�E�/�i���%ߚ"��]
B��*��*x�����`���DZ�)!{��i+IE�z�=�D3�
��r�Ec-H�w6���*q,Uh$y����]j$n�m6 �Zu�X]_�����m�=
�L�S��Q�{�Xo�VG�7���ǝg�Tiˇd�F�M��!����/�z�
]���>�ȀB,����Tb��
--|���Y�v�q�1�r�[ل�C�[�I�����@
-0Mړp~	��`���?�`M�o
�+�C��Ml�Nʲ�x^�̦���]�?X��+����ks��8X4�P��n�'JE8�v*����5Z�N9�cO����P�ԂC��H�q�5!Q
��PK6DY����`G+
��z��g�@�%�2����$ ��<@`4�p]7���Z��,K3���q��|n\���{w��P��d33
Uԉ
�֛�
bLM_�f��”hM ����i^��;&%�I
5��E�_�l���M�:�t��_��
�l�	��
&��hh��U
��	�=���և\!�����*�U� ���7����
�~�A�A��M�6��Rr�8�~��s�,yu����wi��Z���?�l���o�z*A��=e�7�M�U�ؿ�ʥ���9�V������~�'Z�Y�9v��Ƕ-}8�����
S����J��k����E
-endstream
-endobj
-14872 0 obj <<
-/Type /Page
-/Contents 14873 0 R
-/Resources 14871 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14834 0 R
-/Annots [ 14867 0 R 14870 0 R ]
->> endobj
-14867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.899 436.388 345.51 447.292]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) >>
->> endobj
-14870 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14874 0 obj <<
-/D [14872 0 R /XYZ 89 770.89 null]
->> endobj
-14722 0 obj <<
-/D [14872 0 R /XYZ 318.321 711.11 null]
->> endobj
-14875 0 obj <<
-/D [14872 0 R /XYZ 90 704.47 null]
->> endobj
-14876 0 obj <<
-/D [14872 0 R /XYZ 90 635.896 null]
->> endobj
-14877 0 obj <<
-/D [14872 0 R /XYZ 90 569.853 null]
->> endobj
-14760 0 obj <<
-/D [14872 0 R /XYZ 90 513.335 null]
->> endobj
-14878 0 obj <<
-/D [14872 0 R /XYZ 90 508.852 null]
->> endobj
-14879 0 obj <<
-/D [14872 0 R /XYZ 90 390.042 null]
->> endobj
-14761 0 obj <<
-/D [14872 0 R /XYZ 90 361.111 null]
->> endobj
-14880 0 obj <<
-/D [14872 0 R /XYZ 90 361.111 null]
->> endobj
-14762 0 obj <<
-/D [14872 0 R /XYZ 90 319.406 null]
->> endobj
-14881 0 obj <<
-/D [14872 0 R /XYZ 90 314.923 null]
->> endobj
-14882 0 obj <<
-/D [14872 0 R /XYZ 90 270.708 null]
->> endobj
-1950 0 obj <<
-/D [14872 0 R /XYZ 90 168.281 null]
->> endobj
-442 0 obj <<
-/D [14872 0 R /XYZ 90 143.474 null]
->> endobj
-14871 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14907 0 obj <<
-/Length 1687      
-/Filter /FlateDecode
->>
-stream
-x��Y[w�8~��ੋϩI @y�&mOڴ�m������ '���rI���
���`�&ޞ}��03�7�	76�N~����q-�#�PǸ^
��s�)0>�#ם��؜O	6E��|J��F�[dbq.3�mNO���U�E�&��i �3ʰy�<W�Or%�)�L���˹GM>��������ۄ�\� J�\��������;#�{�}=(6lj�d\M���]�
�S�D���"��YX�Z�J� 7����*�T�eZ����42��A�F/��c0
�QZi�m��E�!����_�\�0�<��JcDYլ�޶3f��f;_���{��
a�
T�%�A�z�%�-ϘQ����/���\�3|�y��~�{*�-�zLe���,M`��"?hSP�2<�ı+I@Ǧ��
�J�W
-�BT�������H�.#	r�w��SD��Q�w����7M+Q� S!&Rbv�Yxfq��LA���4/�S׌BV���A�K����2�+f
�A�W�<��
r��_0õև��֚g�2�qg��7��ص��G���U��ie#�fL:�̼Od��=6�aFC�˻t8�w:,����XF��NB3BD=%m
KA�@5�-���Y�8 ��P5B��09�
T���Q]>;๼�z��
-���Z�E�mvû0+J=���bf&�CZ���0�=�zOp0j��Q��e_
���Fq���(���Ie�t�^�kd�
-�/�$"}E����(lB��_w�Oq��
�!*��X*�1�h*��P����v�V
��� yhƌ�-��b
����
��{=E�?�(���������;��5�
`����NK���C4���͘p�y�h:�I��
��v�G�1lvcs%FˣP�⽌�6�epF�(l��ϱ�b�~��c�
Hq���O�v�9b$�E
�}"���\Q�>��F�t.�0��,�{>L���qa�8ށ�
-�ԉIX-�1Nş�yIZt��F�m���#��
Dܑqu��a"E�x�}��|��_
^c-���E���*Q٫iv`ۻ��w���,��MW�gG�Edu-��Q�d���y��kju�׶��S�7��Z1���T��
�U��-j[��


�T!���x�q{d�O��0�"��p��z�y����*Ȧ���G�
�����P`�d����o��6��WWg���n �I!��`�=d3�W矄�P��q���J��"8�k��5��&�C`^��*0��V�M�A�Qd�L0��=��m0��^L���M�r8���_Ы��=v�bE�
���
�{���5Y�n�
B#�E>@2(�����9,�YPW�
F�qm5�Ok��0��
�U[Q]��c\�S{L:L��p^�>��U�
T�C�i5Y�(\��
p����0��R\
��co�Cb��f��?�>�z�PH�BD
=7L�M���/6�v�%ir��e�4g0Eck'*�u������
�ƶy���!J�yp�4�kn~�O<��?
�X$��~��y���m�Y5-`N�!�_j@�s�5�R������qU�3�Oz��痪�W.�ߪ8���A$mYU�vWa-�m�HP���W�������}uU�v
�lĶz�����dY��Vv��4~��
=x}��D�&m [૓�zGD��PcG�	r
�XBߡ`��
ʶ����_��
F�
-endstream
-endobj
-14906 0 obj <<
-/Type /Page
-/Contents 14907 0 R
-/Resources 14905 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14834 0 R
-/Group 14869 0 R
-/Annots [ 14883 0 R 14884 0 R 14885 0 R 14886 0 R 14887 0 R 14888 0 R 14889 0 R 14890 0 R 14891 0 R 14892 0 R 14893 0 R 14894 0 R 14895 0 R 14896 0 R 14897 0 R 14898 0 R 14899 0 R 14900 0 R 14901 0 R 14902 0 R 14903 0 R 14904 0 R ]
->> endobj
-14868 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Solution__Node__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 14921 0 R
-/BBox [0 0 212 192]
-/Group 14869 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 14922 0 R>>
->>
-/Length 419
-/Filter /FlateDecode
->>
-stream
-x��T�j�0
��)�q%��6

-cP�a[`��C״
�
�;��''v������$K�$�s�!t
d�5)����]�簅�a����;�|	��ob� �� �{`$maq��Hc�^E��
-��Tp.�(vW3��>I�H at jPؓK
#vi�?mD�!�����0
j�^L6V��41�AD��KR�ʘ��u�&��u5���p���c�lZ	9tYB^��/PWY���
�:/\d��L�$�N�$J��<e�O��vԉ�['�V�v�GMP�ǣuݐ�:g����H2��e�9ݥ��w%5~�
gmL;��y'K��F�P����{����|c��|
�>��
164�W�
��
"x�!�߃fXP��'���P3��
-�ݝ���u�s��<]GL��NJJ�\��D���
�ț�y�T<�oX�
-endstream
-endobj
-14921 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-14922 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /LKRLLW+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 14923 0 R]
-/ToUnicode 14924 0 R
->>
-endobj
-14923 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /LKRLLW+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 14925 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 667 556 278 556 722 611]]
->>
-endobj
-14924 0 obj
-<<
-/Length 14926 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mn�0���b��"H	!U�ET�{H���
Yp�?+�j	��o��3���<7fX(}w�jy�~0��<ݜb��:�D��D
-5J���ܮ��cc�)�*J?�8/n�ݓ�:~H�(}s��`������jo����f�,�k���t/Ҿʑ)
�}��>,����">W˔���4�V*v�\9�2�j�z�ꄍ���9l]���
�‡gY�Ձ�@G::������#�H'�="�t����ԁ
-�
-T�,Z� x�>�A|�����p����<�c�+"���M���ڻ������9?��`¼�I
��o�Nvs���
�b
-endstream
-endobj
-14925 0 obj
-<<
-/Type /FontDescriptor
-/FontName /LKRLLW+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 14927 0 R
->>
-endobj
-14926 0 obj
-321
-endobj
-14927 0 obj
-<<
-/Length 14928 0 R
-/Filter /FlateDecode
-/Length1 2044
->>
-stream
-x�UU{l�U?���W�Zگuݳ�ڵ{���c���u���ѭetOV7F��=d�D$b$�!�&�`b��A��?�����1$�	ehx$�q_=�W���{����wν �AP��%����C7�4��S��L6h{q�*��zlWt�/�����[�s�pC�!�/�%�����Q�
!?453h/A
�a4��%g(��u��'���tD�J�ҨW�#TƵ�	�]��^�F�Qn��(�	��ZZN��ަ��6��TNh|n��0����u/7��T4<�}OWf~��{����*��\��
@�dmF�fm.Fj(6���ޘ�j$
�n2K�T6g�����Jt�2#à1[$��ጬ<U�s�y%զ���zI�%���_�$s����+�-�h�
�jM�9��L�D��iL�J+�u{وL!�
V`"Ђ�cڄ��0��4֦%�p8�Y�l�b�7Կ�{@e;�X��0�PG�Y<��
�-����Y
�G+�m���0[Ŷ�*�o)
V�Z��$ns�r�6f
%y7����
H��z�?>h���cIr�p�?E�j
;�S[,Uk�
��(�M�.
������n��t���K$}�3�U"1��m�+sV�?�0�a������I�Ae�@���Ro~�*����e�0'W�+�*�ؿHe�S�Rm^�ʹ�p"��-�Opa�X�S͖��P�����I�5�n��wki���+�jƞ!����z�#p�r"$�v���O�S�
$��	CX��������
�;LL$ܰ��n���]"��UA���
)<u��}�3r1R��!�w�ѾV)°��z�_��|��W&�
���p�'��j�.?wt�
�ͭ��L��`�A4Π]	����+?#1���.z?�q�x�]��q&��X_����x*>'b��rr��;N)�
�楌A������xl���d]�6��n!��>t���fru���L��l�&_�kX[�7�W�t-&�ȅ�P�q�Y~ [...]
U� �VH
-���
�U�R�QP�W�e�^���7�� 2�����\��d�w�-��#��ʷ���,ڐ�j<:�����N��̺�Z=ڜ����`��5T/)t�
S=�����\�����>K�dɭ�1X�1����B���.79ͽ��&$^_�\��ǟ&DA�K�I���2\�*7'�4�����2/w.O%�����	�ɓ���a����	�����ڎ
��
�qY���^2���D�,�"b�!t ��DI�ܱ�.�  ߽~�Oi�����
�O�1N=C�~@����Xo�Pe�
"�v�.��;4�$��L�\��B�0k��x}1v���cd��2�)�xR�ė@����$�����vf��I�Dwx3��*�ic~��+���M�
8��p?€��G{�k%�
�?�i���a�V@��|�"y��^�j\�
��tHA����$�FG}+�n\������
-?3�֦B"�2��H���!�!
!}����p-·Tt�o���31���.iC:�t���ZrO�>̚
-|����A��5��
-endstream
-endobj
-14928 0 obj
-1557
-endobj
-14869 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-14883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 439.687 203.075 449.614]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) >>
->> endobj
-14884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 370.751 195.613 381.281]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a8db329a321108295b995b5af1058ff37) >>
->> endobj
-14885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.95 370.751 278.083 381.281]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 343.869 208.246 354.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.216 343.869 239.787 354.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a996dc24a90ed7bf0e7231563f3c78975) >>
->> endobj
-14888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 316.988 231.865 327.518]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c1045d83957e66a37f4b9605431945c) >>
->> endobj
-14889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 290.106 178.996 300.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb1b3eeef8a1a793899d9b66f1200fb0) >>
->> endobj
-14890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.935 263.225 247.638 273.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-14891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.608 263.225 302.989 273.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a49e1548e93467d9fd12ba992f8712c56) >>
->> endobj
-14892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.935 236.343 249.281 246.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-14893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.251 236.343 305.729 246.874]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a50a4be6352d2c6b88989c7a49bae79cf) >>
->> endobj
-14894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 209.088 214.681 219.992]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-14895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.421 209.088 300.2 219.992]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4ec7c4c8093efb70675c35a17d6a7e28) >>
->> endobj
-14896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.015 209.088 339.203 219.992]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-14897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 182.207 181.845 193.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) >>
->> endobj
-14898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 155.699 176.505 166.229]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb91a97e6b843121536f02146fb43f75) >>
->> endobj
-14899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.063 141.212 452.197 151.117]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) >>
->> endobj
-14900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 117.485 220.22 128.389]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.719 117.485 317.355 128.389]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a082a2f74f2c88339b84f233dc45e3370) >>
->> endobj
-14902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 90.604 220.22 101.508]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-14903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.719 90.604 331.582 101.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ab41e16bb175c436813472be1b131f853) >>
->> endobj
-14904 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14908 0 obj <<
-/D [14906 0 R /XYZ 89 770.89 null]
->> endobj
-14909 0 obj <<
-/D [14906 0 R /XYZ 90 457.112 null]
->> endobj
-14910 0 obj <<
-/D [14906 0 R /XYZ 90 388.864 null]
->> endobj
-14911 0 obj <<
-/D [14906 0 R /XYZ 90 388.864 null]
->> endobj
-14912 0 obj <<
-/D [14906 0 R /XYZ 90 360.248 null]
->> endobj
-14913 0 obj <<
-/D [14906 0 R /XYZ 90 333.367 null]
->> endobj
-14914 0 obj <<
-/D [14906 0 R /XYZ 90 308.211 null]
->> endobj
-14915 0 obj <<
-/D [14906 0 R /XYZ 90 279.604 null]
->> endobj
-14916 0 obj <<
-/D [14906 0 R /XYZ 90 254.417 null]
->> endobj
-14917 0 obj <<
-/D [14906 0 R /XYZ 90 198.96 null]
->> endobj
-14918 0 obj <<
-/D [14906 0 R /XYZ 90 172.078 null]
->> endobj
-14919 0 obj <<
-/D [14906 0 R /XYZ 90 134.238 null]
->> endobj
-14920 0 obj <<
-/D [14906 0 R /XYZ 90 107.357 null]
->> endobj
-14905 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F24 529 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im22 14868 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-14963 0 obj <<
-/Length 2398      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�8~���SV�
o��`�@���l��6�yi
C��X;��Jr���=���d�VS3ȃ
�<<<��;��w�a���ד�W��*��[/�^�
-�o�}�y�����I�ҏ��������W������˄�+�# DQ��ד�����ǿz�$���Ak�S�+�j��	��`DC�U}X�@VW3B!F��2 �_�r^�E0�4�����,��W�|^gE^i
�����h�&q{01P\��Di؛��W��}~x=�>NC���7���b�U���
ٙ�h��O8�sP��/d�a�d�=�4����Ű1���`C�SoJ8����b�h9Z�r;�
�%!>���h�d�����7R B������i��UO��#V~��e��uv/c����#f�F���z���2��~�-[����h��!u~�'�eq����v(ogZ
�`�)#�0fjxo�
%1i�8�ƺcJ��f
1W
�U���%���
�zZ�ގ�i������)��Y~g�7����||S���Ηr�����2��|/S���O��.O�9<a(����ޖ����"�&0�s�A.J3���
E�����|a���l>�W�U/�r�M6貼�����e�"_�&�
-�ff��Y�R����[��A0����Yu|VO�F���8Ga�]�oL��V�%,i�
N�H��A�15P��ni-gu
-q�n�BՈ顆=�
���� a�/���+�k��F	���|�ಚU�t.g0i�ة&s1�"s��֜��QX
-|L˪�md���6�;��E1-�+��;��]�/[���:��Ͷ�ͫ��C�w��i�)�U �
�I�tm���-��`�j,�@y!}\y�ހ�eޠ�fk�ڂp�Z�e�,�+�u���
��\\

�S2�Q��jSYvPL���*t��=�ht88CL����A�7pԡ���
-c��G��*��I�@����(y�@U�8��o�H��ߘ�DG����/�'b��K�6
�2	p�6�W���AF�l:�O1E<���=��#v`Z�?Ktqי��w+�*�y�T�.�P��j컴.�oC���P"NY!
F�R��p�!�@ZvTcDR�4���#q=
T_���:�
�a��;�t�n�, 
f+��a�`5�u��џ�0*f�	,�$��� ��C�n������yT��1k���:��Ѥ��h�$�@�{4��0�G .��q0�"Ύ�SB�p>=�m��1����p�2�
<e>
��*F�����x]���9c��շ���s����8��T�i�-�j�a_��U��¨��m��(HFv6�
%�{;�(V�L � S�{���R���o�y Fe��ft��=�L3�8�N�'Ɖ�i����q^Gc
�?:��b���H̷����O4���f���ҲV
=�/
��e��J_䃧!b��C�}��.�
�|�qp�D'9m  �����q?@!T9��3�
-��y�"p��:h�ɗ���� P�{G���TH9b<1r!v"�^�F2텬�l�H|!�y�m��r/�z�5F��� kz�)e��J��W�m�cPյ��a��3���>�����I����q��b�U$ݳ��Rg�ˀr��u�mD�ڿģ���ġ�#��8q�G�EDPX�E�I��Q
-
���R.�� #L�S�@q�0�nG���M��Ec���X؀!=��!�#:�_�۽�q��`'Y9!�ل[����
3�Q
�di��`t즙�t��$+G�8yoӐ<��:�Bh\ ��My�\���v{�~�_
iZ�
[;k�s�#"\�}bln�z(�t�/��b��#���1��s 2l��`���Miok?�D�GP5twAp�6m�!ݭ�br7k�� w� ў%\/�Q7'����"�U�o�̫Կ-��yeʱ#oՂ�vU7R�C2��?�������ϯ��/�oy1 ����
����������
&��sͰ���,�b*�iw-�S��z>t�~
-�`1
��E��5�p
�m�˴�����}YUYC�:�**��3
-�Xx�h�~ �DT��Pe���	-)l6;� a'� �U�����qLb4��$@�M�����1�!N�2�P_���lp�fC��4 ������y�
 ]���	��l��S�Y�IK+�ڜO
�}#�\E��/i9�D }�:�\��~ӯ�I�p�R7���Ƽeb��9�P
�rG�E�#���7�i�ߍ=m
j��@".���t�F�JƆ��O��Z*y#�Ԛ�&:��@	n�;8�k}�/�9����5�^ l'n
-�;�:���s؜
cq�������[%˿)��~��� QE���r�#�� 
- ��N�^8��=�nh��&
]�^������f{M�
���0�M�Q��K'뢔M�
-�i�����u�
-endstream
-endobj
-14962 0 obj <<
-/Type /Page
-/Contents 14963 0 R
-/Resources 14961 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14834 0 R
-/Annots [ 14929 0 R 14930 0 R 14931 0 R 14932 0 R 14933 0 R 14934 0 R 14935 0 R 14936 0 R 14937 0 R 14938 0 R 14939 0 R 14940 0 R 14941 0 R 14942 0 R 14970 0 R 14943 0 R 14944 0 R 14945 0 R 14946 0 R 14947 0 R 14948 0 R 14949 0 R 14950 0 R 14951 0 R 14952 0 R 14953 0 R 14954 0 R 14955 0 R 14956 0 R 14957 0 R 14958 0 R 14959 0 R 14960 0 R ]
->> endobj
-14929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.579 195.613 696.483]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a7ef6a6a1d69f65fd28e518f0de795ffa) >>
->> endobj
-14930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.95 685.579 304.653 696.483]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-14931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 658.256 195.613 669.16]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a02d378f2284277bd0cf98f4f5e9daa37) >>
->> endobj
-14932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.95 658.256 304.653 669.16]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-14933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.218 658.256 386.755 669.16]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) >>
->> endobj
-14934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 631.308 205.107 641.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4f54448c4e6823e33a0f5121e5d27d4c) >>
->> endobj
-14935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.445 631.308 287.577 641.838]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.529 616.6 259.424 626.505]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 603.612 234.079 614.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac3cf88993e63370f39ad5ea8915ba2af) >>
->> endobj
-14938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.416 603.612 316.549 614.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.222 576.29 223.528 587.194]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) >>
->> endobj
-14940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.67 576.29 304.803 587.194]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.689 576.29 395.332 587.194]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [479.267 576.29 513.996 587.194]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 564.334 138.04 575.238]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.916 564.334 349.58 575.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
->> endobj
-14944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.115 564.334 475.891 575.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.798 538.045 365.997 547.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1) >>
->> endobj
-14946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 525.057 199.558 535.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a727cd68e90dd481583b6a2bd5fdfb492) >>
->> endobj
-14947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 497.735 199.558 508.639]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c2621d99e009a3c99558671ab046b9b) >>
->> endobj
-14948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.815 470.412 207.648 481.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-14949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.423 470.412 237.297 481.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) >>
->> endobj
-14950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.438 470.412 318.571 481.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.645 458.457 267.421 469.361]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.423 458.457 375.066 469.361]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.798 444.123 328.634 454.028]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) >>
->> endobj
-14954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.597 431.135 187.488 442.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a68753415da58ce7afaf72efc835a65be) >>
->> endobj
-14955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.986 431.135 257.629 442.039]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.631 431.135 343.407 442.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-14957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 419.18 179.554 430.084]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.985 391.858 203.712 402.761]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) >>
->> endobj
-14959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 379.902 179.554 390.806]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-14960 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14964 0 obj <<
-/D [14962 0 R /XYZ 89 770.89 null]
->> endobj
-14965 0 obj <<
-/D [14962 0 R /XYZ 90 704.286 null]
->> endobj
-14966 0 obj <<
-/D [14962 0 R /XYZ 90 704.286 null]
->> endobj
-14967 0 obj <<
-/D [14962 0 R /XYZ 90 647.907 null]
->> endobj
-14968 0 obj <<
-/D [14962 0 R /XYZ 90 620.585 null]
->> endobj
-14969 0 obj <<
-/D [14962 0 R /XYZ 90 593.263 null]
->> endobj
-14971 0 obj <<
-/D [14962 0 R /XYZ 90 514.708 null]
->> endobj
-14972 0 obj <<
-/D [14962 0 R /XYZ 90 487.386 null]
->> endobj
-14973 0 obj <<
-/D [14962 0 R /XYZ 90 408.831 null]
->> endobj
-14974 0 obj <<
-/D [14962 0 R /XYZ 90 329.637 null]
->> endobj
-14975 0 obj <<
-/D [14962 0 R /XYZ 90 329.637 null]
->> endobj
-14976 0 obj <<
-/D [14962 0 R /XYZ 90 271.294 null]
->> endobj
-14977 0 obj <<
-/D [14962 0 R /XYZ 90 248.917 null]
->> endobj
-14978 0 obj <<
-/D [14962 0 R /XYZ 90 248.917 null]
->> endobj
-14979 0 obj <<
-/D [14962 0 R /XYZ 90 151.366 null]
->> endobj
-14807 0 obj <<
-/D [14962 0 R /XYZ 90 128.989 null]
->> endobj
-14980 0 obj <<
-/D [14962 0 R /XYZ 90 128.989 null]
->> endobj
-14961 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F110 1507 0 R /F68 3032 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-14989 0 obj <<
-/Length 2824      
-/Filter /FlateDecode
->>
-stream
-x��Z�۸�����
��)n�������&{���֦�Beˑ�ݤ}�ɒ-?�ֵ�'Q5
��!�h9£�7�=ܼ��b#���r�i<R\#!�m>��T<��qt?&8J�U2�S
���'3/��O�c�_�����>���1�#c���f<�G���wfa���
�"����O?�|�p��� sxD<3�V7>��
�
a�t<zq�V#N<��������$�[!������Wa�m�6s���k��m�DD_6�)�4_��U��7�����ً�َ
�6E���UxI�de*S��'��b��ۓU�c:K�l�_�S/
#*l�>��*u{����# �4��Ra�xT�]z���ï�����UR#���+�w�M�ץ���#)R�N�h��}j���B8GJs� ƹ��3���1aI��J>:�M�D��.��w��V�>�	tu|JgOA��>~ޚ"��"y̷:�$A$"W,� I!�!���{M�+E{3b�0�`
	

��_ffS�#9c}��0G���߹��d2<Mok���e��2��=��d����E���(�FaF���J(�
��$(�ۛ������d�|
-��T�ܮ̺:��sc6�:a5�>t��qD�:�ЎC�X#���:������f*�҅]
  ���S�rqǕ
G67�q>��S�����t=�W��J��Q*zI�'?���-�.�X�U�{{3��Xq
V�T�g���eM�ϯ�2��Fɐ�@?	��1�m�&�����f
�}�(�F\賢� d'
-�1O����9o�4b�
-�9n��B������])�����*�
��ق�<����ꬒC(IT�(�h���$�` �n8=��\�2v?�g_yT|�]��p�(��˂���I
y(�Á`�
(��.��`f33���33��Uwf�h��m7�2=��G`L
2; -���e޸�X��<G4�p_A'�>�<�Y�/��R 
�W�?��u�jXB񘃮��+c�7�c�	��J�w
Y�okZ�
c �4,m�M�Q	U�a�P(�}�\��#
{ciI�f���g��E�AfU [�
-�YӲg���P�� ��N��CφQ ���� �E�B�A���ƍ
-|�T�֙��N0݋b"!s���
V��_�1��UՙDKӛT"ۚ��
U ^c10�����\ƈ}:��V�R��QPr@\�x"{��uM�r�Q�h3�J��F��$�����l���@礈|���Q��/��;�&Y����dY���d����R�д!�Ӡ�A���0������
�J͗l&
��	x̣2��kv��-*�[�;	O�y�JA�w����9��<�?�0�����$�0�Y���)E�v�R^��
R�	]Tx�N
57Kr���	�E��.m��C�*�9��)b⣾�r�&�|]�[	�� 
P�7����J
���
�h3p�Z�
`b�Z ���
�.�������Bv=

��]f��k��
M�Ά!�Ҷ�yG2��nLf�)��M:���*�m�	c)��=�9ִ�N�����D�U$i ��JI�v�7�R��P ������H���k���
H߁�w�5��~��y|
-�w)
]c= �`�E]����89��]kD���Ps�����oVl�_��H(e{�
��:n{
P/�YW��uշB���چ�ߞ+&�5�ONص�����	-w�^��
|6Y_ ����
b�
���?��H@����=R���6_�E8
�G�҃+WX��?��KJk�5�d��|���wJh|g���۴�aaԷ�
�+�t�?J<���
�x
N�%
�K�:��%A����L�B�їKr���M):̼
��tC�jNx}ƛ�6Y�CG�E�:8Dk���F��2X��"������H�<K���A��!}sջ��GC`L!����z�ǵџQƫ��W�6W6��/��*W>]�qP)h̶Ea����6�['u��.�[ϲ��{h�N�\
��@?���0����=�40��&��eC'�Ʈ!T!�|�-�0���k7�C��ՐY���aP�\�à�
�C
�6��޹��"�c��"��E0�#g
�?9c�
�-
�M[(I�Ԕ��-s�/�dlǮpq

T8�n?�<�w�E^����i��nZB�-�Nk
�3���ԁ�+���-8�����l@[����f�`��@O�h�mԹ��iBit��-wvwWS��P���P:��:�nG��
-��ۙR��]T���+A��#Y�C�]Uӭ`SZ;���1�b���
�ĺ}��*�_�0^+��j
��N��$�9��%�I%G*���x��V�Z�uL��@��殛�.�
Re�E�2{p�-�s�hC�v�l��|[mj螯���_���J"ɐ*�j��im��
�7ҟ�3wk�%�F�ᦎ5��e�w�x?=�O���j�g�OښͲ163wݻB��A�� �WN|�T��(��&COOa{*~�h8%�T�B���
����B���
��n	�V�ʸ-6�Y-W‘���K��8Fx(�%��m.��K{�/a@�vxK��I5ET�A&���+�pǝ��
wh�3���L᮸�*���~��Ğ��K�=��{v�O �+ �)��0
�J������S����5�-HY��ZHc;{t�_V������B+Rg����(��$����"u�����_JS��^�
~��d�MZ���bwϟ �}�CK�M��������n�pv���Օ��ܽy�]�f�D�|u�
�u�
-�F���\�E�l��|+���	@�%�%��
�
���n�������+6�K�9�� S_"
-endstream
-endobj
-14988 0 obj <<
-/Type /Page
-/Contents 14989 0 R
-/Resources 14987 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14997 0 R
-/Annots [ 14983 0 R 14986 0 R ]
->> endobj
-14983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.298 614.502 471.431 627.02]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-14986 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-14990 0 obj <<
-/D [14988 0 R /XYZ 89 770.89 null]
->> endobj
-14991 0 obj <<
-/D [14988 0 R /XYZ 90 692.066 null]
->> endobj
-14992 0 obj <<
-/D [14988 0 R /XYZ 90 638.377 null]
->> endobj
-14981 0 obj <<
-/D [14988 0 R /XYZ 90 591.752 null]
->> endobj
-14993 0 obj <<
-/D [14988 0 R /XYZ 90 587.269 null]
->> endobj
-14994 0 obj <<
-/D [14988 0 R /XYZ 90 516.538 null]
->> endobj
-14982 0 obj <<
-/D [14988 0 R /XYZ 90 457.958 null]
->> endobj
-14995 0 obj <<
-/D [14988 0 R /XYZ 90 453.475 null]
->> endobj
-14996 0 obj <<
-/D [14988 0 R /XYZ 90 370.788 null]
->> endobj
-1951 0 obj <<
-/D [14988 0 R /XYZ 90 161.165 null]
->> endobj
-446 0 obj <<
-/D [14988 0 R /XYZ 90 141.59 null]
->> endobj
-14987 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15021 0 obj <<
-/Length 1348      
-/Filter /FlateDecode
->>
-stream
-x��X�r�6}�W�f* ^4mg�8�8G��';��HX������w^DҴD�V��-��
.��Z�ڻ����[�j.r-��7��5�t���׮t��㯋��
D\
f��ן/o.s�n�f1�x�5R`�v4/]}Ś��5���hjP����P���
�/��B"�X�"�i�������|��x�IҢ1��4��Yno�����`��t;��.f�Ř2=by��b�"�|��BdU\İa�ƨ�
Let�#�\b[L
i���jf�qvA��	��
#�ɦ�yWϘT�M�)|�>�
؂��g��z#�@K,dRG�ra
5��0Xk�v5a�4[��ޥ���/j����4�16���˒ 
�\�{�x��S�)�g,Ӏ�"&-�jZ.���Z�0O���A\�1+Yn� )��tLm]�
.��� ;�1�C
��#��jl�a�9��c�ѷw/�vF}qS�����7���D�y����i��
���
-˿<�U�)����=����Y�l���
/��~#��~��&,�v4T* �-Z<
x�I�D�ZS=%7G��3Mq���_�MX�X��^�}�J�E��&��Џ�"ݯ�oA�o�ۋ�����a����b�"���Dc#Ӯ�ya���җk�0���= ɋ��	l:�M�v2��o�8k��.	�\��ɓ�;�(�xn'�/�x.�ʡ�mSX��X����#p�7��Lda���Y1��J	b�!�a���01bTn:�
�
EtȦrm�
��2�6�PoTc�k�K�FA�j���"�ӍJ���C�T��Dg8��U�
�p>8�����J�=Z�_'p at E􉉂,k
�ro�q��$KU}�6m��Q;�D����$Dֹ<�~:	3�M�qjoPq0�˪�p*4�*�|f*�ٲ�sN�e!�����A<���F�a�N3��B�%aPO�\<�R�9�:
�L�}����ћ�犁�:^�
���(u�/-�\�4�r�����j�N!�ik��^�!)�*f9�f����i�
���
��37��ܺ-��p���z�
7U�r��>��I�G&&�!�{c
�1gX�1��4���t�� �4�<͗w�����:��'��aPy��ʓN�]k ��38K[R��w�_��K�#�@�CyPw��uYxr
���GI�D"V��
-88�1�^������My�)d�����
ziۘ�=s��>[U�>t�~�>���/>��dg��n
�
�L�B9F��0��>��2��3V]
~�q]kI���t�?��C�	��G��ߵ��u9k��L�v��6��gg��:�yI�Xͻɮ�Φ���&*JRQ]i�#
�%�#���Լ�
-endstream
-endobj
-15020 0 obj <<
-/Type /Page
-/Contents 15021 0 R
-/Resources 15019 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14997 0 R
-/Group 14985 0 R
-/Annots [ 14998 0 R 14999 0 R 15000 0 R 15001 0 R 15002 0 R 15003 0 R 15004 0 R 15005 0 R 15006 0 R 15007 0 R 15008 0 R 15009 0 R 15010 0 R 15011 0 R 15012 0 R 15013 0 R 15014 0 R 15015 0 R 15018 0 R ]
->> endobj
-14984 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Tree__Node__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 15033 0 R
-/BBox [0 0 380 170]
-/Group 14985 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 15034 0 R>>
->>
-/Length 557
-/Filter /FlateDecode
->>
-stream
-x�ݔ�j1��z�y�Uf4���C)zh��C������
���k�]��$�SX�I3��O�i4��'�B])��@_����#]��
�����m�n��nn�-���B 
�D-�ԇ���
}3��ʰM���S�My���g�	֐Š ��B�Z�9Y!����[JI!�S��g*LÓ��v�!,
[s{����T��;﫢�j���G�WY:�i!A�4��΅:S��z2�z�,�}����1�C�8�&r7��9 �@�X_W=
�}e[�㎔��pt?��"	�8
�1`��������1�5����
���:F<zVQ
!�V�����%�u�$���-�ӋtWa�����SM-1	�	�<�-�)�i��_ �3Q2k����y���*�Y�Z�u1��R�f�dU1,�{@���d3^,a��������� �쀛"��
�*�6�����&	cUV@ϼV��
L�iO�!>+�g�G������ �b���/�zj�eic6��Ei���|>�z�AVR��<U���yD���1���
Q�g;�
�'o����A��4�O�V����
-endstream
-endobj
-15033 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-15034 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /WBOIUP+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 15035 0 R]
-/ToUnicode 15036 0 R
->>
-endobj
-15035 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /WBOIUP+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 15037 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 611 722 722 500 500 556 667 556 278]]
->>
-endobj
-15036 0 obj
-<<
-/Length 15038 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0��<�
�C&�4B��
����`�%E*�2����x�T�%�>����uzi�3,���I��P?�x�nN1u|
L"r҃Z"���MRon�y�1��T�^����IO
?$D��9�n0W�}]Zl�7kxd�P��5i�}�i_�Ȕ��^�u�m��e�

IM�g+;i��T�_5U�_u�F�����W�҅r�˳���@y�� 
�rPM�J�z�Z�H�
��
:C{IP	�@H*b
-vaP<Y� �
>T��=�
B�"j1��|�H1_�!_���p��Al��>eus�8<�0�m����볓�\���C�u
-endstream
-endobj
-15037 0 obj
-<<
-/Type /FontDescriptor
-/FontName /WBOIUP+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 15039 0 R
->>
-endobj
-15038 0 obj
-331
-endobj
-15039 0 obj
-<<
-/Length 15040 0 R
-/Filter /FlateDecode
-/Length1 2328
->>
-stream
-x�UV{lZ�?���`(\(��`l� \
�_1���
M��#��Y�:]�t��TM�Ej�%M��N��LZ�G�G5i�?��J��u��vR�lM6���M�*_��;鐾s�w����}�
B	!��0��N.��9��vO�X8;{��G!��!D����ə��%��
��l(~Ĕ��%ՙ��U�Y�S���3
Kӓ��|������2��x���6ӄ��Md��Z��n�Z�L%��Y�e��Ss��Bnrs�+&�B�J�ڴ�A�{�^������;�a�0��FC[L6�"�b�K
��a����]fde��x	��y����yO�Sڬ�q�y;
-
��z
6��@��S�Lo*ߟ�i(*�������xQI���������6E2�6
�k�ӕ�v
�ײCEvg,�ctT�4��r��l68�
n�׽u*��!Q�@HC>�ì�
���{�4�J�b�!g	G�c}'��L�d+/Ùn�_�� �]iq0��%ǿ��Y���z�ao�@�o����k�K�WG{���'�8(��7Õܽ\�u�Σ.D�Y|�k��u��Hy��ݥ����s���J���y
T��vnqym}�;��
����}e�nƲ��f�&E]����*՟���ՔXr�����~�TD���F�OT��x
����ډ*S��\Y����
���X�U˓L-dH>O�oХ��0/�v/W��Pmg<��G����t>�La��?�5�.�����UO*�[
Fx��T
-z��E
��i�+9kKi�9���w�}+&Nx�:h���н���ܑc��]��
�3yp�h>�f��
�YJ��������o����ì~�g
�|�[�
�éT�+��9����i��`ytliqtb	�'���^��[
g���f�V
8;�]F�`������l���I�c�S}07��Ϗ
�@NML"�R�5��l�G5�'�eV��̷F�����I$�G��;��H�~�������r^�X��Q[ɶhW�8#����~3��z�����a�c�XHC�,
����؅�����d�!��"IF㩖m�	��隤l`�-�7YJ�i�uI�F��<��V��E���⫯���ͅ�兛l{K�����.^���B
?N
ck��ݪ�BE����!U��
��y.U�<1�v��h��Z���O���<w��T�/��w
�p�*iއ&�H�	��9��h%�W�i�/9\����_NѴl�ok���3ӷ�7�
�
-k����=���\��6�Ni��Yޞ�+�=��;�����m��Og
�H��p��75�=��n`$��7����|�&���a:�ުe6k�����
i��K7~�����h�N
��w��7X��8��ƛ�4�s=�j��5&mn�s��xj�'Թ;�?�8��X��kST��U�X���m`
�X��	}��)0p;jO��"�`<�뭏��{b(�V<���%�!b
����>���pDWf*��8���I2UX�V��w���R���M2i�*�^"���`��;�M�
F�ˉ��$�$
�l�b��ѹJ��.&%D������h��A7G
�̙H^
Mk�����'K���Jd���~{{����N	.��r�B!ٳ�Q���Q|�թ�����~f�.I��d�Փ:#Y�t���=���S��
k�'�
J`�
���"h�M����!_�Jg�7� dԻ���[a7 |��U��Ŕ��Ac��k9k�&��AxS���}9�
r�S�I�� ��ht�� [...]
-endstream
-endobj
-15040 0 obj
-1775
-endobj
-14985 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-14998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 472.067 218.955 481.995]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-14999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 388.397 207.337 399.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-15000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.074 388.397 344.419 399.301]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad2e8f2d9c5b2732df9e001bb155320ca) >>
->> endobj
-15001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.414 373.577 312.271 383.482]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
->> endobj
-15002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 318.031 208.246 328.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-15003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.216 318.031 239.787 328.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aa53032d6032bb4c199a517187c46636e) >>
->> endobj
-15004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 289.738 215.994 300.268]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ae3905fc4ad45180a029f856c7ca7a2fc) >>
->> endobj
-15005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 261.444 178.996 271.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac5612e1699099eb4ce49e81b696ae89f) >>
->> endobj
-15006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.935 233.151 247.638 243.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-15007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.608 233.151 302.989 243.681]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44) >>
->> endobj
-15008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.935 204.857 249.281 215.388]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-15009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.251 204.857 305.729 215.388]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a43eb178d5fe05266ba5f76962e836bfe) >>
->> endobj
-15010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 176.19 215.259 187.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-15011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.999 176.19 271.159 187.094]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a97ccf10304ef9ba8b58549f7570b8cea) >>
->> endobj
-15012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.076 147.897 385.359 158.801]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) >>
->> endobj
-15013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.076 119.603 377.758 130.507]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a048588fb0ac55c4315b0ce6cb1ec274b) >>
->> endobj
-15014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.31 179.554 102.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 91.31 264.484 102.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a48b522405ad8896775cbe6d2344bba4a) >>
->> endobj
-15018 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15022 0 obj <<
-/D [15020 0 R /XYZ 89 770.89 null]
->> endobj
-15023 0 obj <<
-/D [15020 0 R /XYZ 90 490.199 null]
->> endobj
-15024 0 obj <<
-/D [15020 0 R /XYZ 90 417.547 null]
->> endobj
-15025 0 obj <<
-/D [15020 0 R /XYZ 90 417.547 null]
->> endobj
-15026 0 obj <<
-/D [15020 0 R /XYZ 90 336.851 null]
->> endobj
-15027 0 obj <<
-/D [15020 0 R /XYZ 90 336.851 null]
->> endobj
-15028 0 obj <<
-/D [15020 0 R /XYZ 90 306.823 null]
->> endobj
-15029 0 obj <<
-/D [15020 0 R /XYZ 90 280.256 null]
->> endobj
-14796 0 obj <<
-/D [15020 0 R /XYZ 90 250.236 null]
->> endobj
-14795 0 obj <<
-/D [15020 0 R /XYZ 90 221.943 null]
->> endobj
-15030 0 obj <<
-/D [15020 0 R /XYZ 90 165.356 null]
->> endobj
-15031 0 obj <<
-/D [15020 0 R /XYZ 90 137.062 null]
->> endobj
-15032 0 obj <<
-/D [15020 0 R /XYZ 90 108.769 null]
->> endobj
-15019 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F11 613 0 R /F24 529 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im23 14984 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15085 0 obj <<
-/Length 2300      
-/Filter /FlateDecode
->>
-stream
-x��Z]o�8}ϯ�S�j��(3̶�Ef�E���K;�I�cI�(5����)ْe[v�`�E�Z��ˏsW�΃���������`N��z��`G��
�5w>NFŸ��xr=%xi^O)���G9/��]rWD������ux;"e��|.�3����"R�\~���4�bxJ����������~�=�|F`p�!f0
�����?�3�ۿ9��w��F��R�
���g��
����k�#�C.�
A"������y��8�0�/�,��}�GT<ء}�[��,�$+����0Ǫ�_^�,d��ٟ�W�B�e/�2+�О�;q�������m�
f�z6�"ϥΌ�(�-b�z<v��L[�xK^{�q�{u{e�t�
-�Q�4(-�e1e`5S�O��fƐ���D4�>ă�"��!Q����N��
Q�EA�O�r��$	�U�<�A������ �
��{ m�2c뗛�WW
�٥�Q@ǨLr�,� 6�˃1��S$p��ػ<_�u�G�&�
��0c}}i$=2�7��C�e��u �
�
�(4���(�f�*����=�X4����뎢��R

mR�fJ�8��f�J�j�a
"u at O;f̣����( ښU��
�<�
�S΁}3Ft�*�"SC�	�\5��
�4C�k�gro���8�J�W�W������G
5h: f��s���S-	��:C&|��|I����xO*ӼxU�_��K��-o�y-B�n��wϥT�ܯ?�˟�q���
�MkzD"�K���_3�&v_4���Z&M.4>�#4����_:R�
!�K�����_KYd1��=��Hk���N�޽J�ߚ/izD�^�S/D� 
Q01c~I�5
��b#�?�����T[�������!�ݤ�
��&
-��Ew]C����f��nK��pqC�#چ�ך,E���~\aܾ���~X��Qx#?W��fh�p\�E<��K8�XF�,�Ȳ�
�ܳ��t��j�+5�zdj
GX ��ː�2����~[e���c�`���1�J�'E���.�ǖ(�m]��B�=n }���ހ��LK�ֺb>�|��b�>�Xu��7���o\5r�7(U����Y��Ρם�6|���G�,���4��j݇?�Gr��{m�?���/�����pJٗ�[#t���w��
%��?��U��A�aK��9|�g��t׷���,sp�h��m�
�D��gc�l�?l
-�{��b��@l4Vm|\�A�Y�F?H�
sGD?2��)�l�P X7��Ȳ/���(�P�_��e��
-c��,�?Δ���h����30��8*oa9�M��2ԥЅ
��ŢG4�RUw+��%TwG�?�O at X������S�r?�\~X�_��zG�ȼ�8A�����72N����ݏ]��ߘٖQ!�W��Iic�y��� �9���B��aev�
5:)�^��c
y���x5��c]� ��[��!l�Ŧ���^��Gjo
->XK�C		ƀ�[U�yTʰ� �DUߨn1� �ٶTe�C8z��B�N�I*��?�(k�SzR�(�!�4��L�\Oo�
-�M���Q�
-��-�q[&���(�􈻷�`�:O�eU��k�O�]oJ�"�ةPS|�0�:J��qw�VR��y�OD���z�ɖ�"j+m+���E*�"��]�\H�̯��%^�G�Zg���
�itz���w����)"X
��`'.�X��)�}oW�}�ֳ�M�[�e�xO3���f�Zu�۾� Я?x���S���@��.?9:dt�J-�<`�[�;�R&#\I�jWR�v��
�j'XE���v>14X
��P�u�_�ʸj}3:�3�r��j]�X��QKH�:V6
-�`P;�K��h>_
ӻ�9�b�g.�_
�|��1��oW��E�+!ք�n�����*���f7�Ԗ����!4Z4L���S�Y�{/k�g>�l�uYe��8i�hm��ۖ��C��p�}�υ"g -e	_� P���.�D`NL�%$�
����Yx�
��
zp�={�qL����������_}Oj�7};��ؓc�����w���v�a���6�f����@>��7�hE���ɲ�qD���nF
Gl��
�Ž+`��n���~g.�Q�}Ů��(k���3
�
՞�o�0ۓ+7�O�A��4W�듞�_\�W_��ryyqqW=(�=�8O7���<�E���g�4/�O�&	�8Qs��YG!��h������#����֮�͋���Uʜ79,����� ��h2
-endstream
-endobj
-15084 0 obj <<
-/Type /Page
-/Contents 15085 0 R
-/Resources 15083 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14997 0 R
-/Annots [ 15016 0 R 15017 0 R 15041 0 R 15042 0 R 15043 0 R 15044 0 R 15045 0 R 15046 0 R 15047 0 R 15048 0 R 15049 0 R 15050 0 R 15051 0 R 15052 0 R 15053 0 R 15054 0 R 15055 0 R 15056 0 R 15057 0 R 15058 0 R 15059 0 R 15060 0 R 15061 0 R 15062 0 R 15063 0 R 15064 0 R 15065 0 R 15066 0 R 15067 0 R 15068 0 R 15100 0 R 15069 0 R 15070 0 R 15071 0 R 15072 0 R 15073 0 R 15074 0 R 15075 0 R 15076 0 R 15077 0 R 15078 0 R 15079 0 R 15080 0 R 15082 0 R ]
->> endobj
-15016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 707.957 154.727 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9ac8b3ffed6355e1de3f16b194a90a42) >>
->> endobj
-15017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 679.976 181.845 690.88]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ade3035e2021726b1d2c0c563d6c1216e) >>
->> endobj
-15041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 652.369 176.505 662.9]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af46a1a2668f581e1bc158db432912f35) >>
->> endobj
-15042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 637.332 450.955 647.238]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ade3035e2021726b1d2c0c563d6c1216e) >>
->> endobj
-15043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 613.056 220.22 623.96]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-15044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.719 613.056 317.355 623.96]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a8cd66485ef35802c6c117eab5f641d08) >>
->> endobj
-15045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 585.075 220.22 595.979]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-15046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.719 585.075 331.582 595.979]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af0d04edca3b2e3d30f5d6de7499396b5) >>
->> endobj
-15047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.43 515.071 241.937 525.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-15048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.674 515.071 339.338 525.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
->> endobj
-15049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 445.441 179.743 455.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd966830899423f741449e6567241cd) >>
->> endobj
-15050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.08 445.441 262.213 455.971]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 417.086 179.743 427.99]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a6ff7edd489b1d20b1bca1f4431d802f1) >>
->> endobj
-15052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.08 417.086 272.913 427.99]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-15053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 389.106 192.565 400.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.535 389.106 244.33 400.01]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af6518b1b7e729018dfc57b6800d904f8) >>
->> endobj
-15055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.505 374.442 266.4 384.348]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 361.499 205.107 372.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ab57aada46f9e76478cf7db1ca6ec9091) >>
->> endobj
-15057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.445 361.499 287.577 372.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.529 346.462 259.424 356.367]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 333.144 234.079 344.048]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aafa858d51c2ba75d0778692e95c895c7) >>
->> endobj
-15060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.416 333.144 316.549 344.048]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 305.164 220.779 316.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-15062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.749 305.164 255.638 316.068]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a77459bc72a66ade5bdb58c0ce1aaf020) >>
->> endobj
-15063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 277.183 176.854 288.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a454c2aefff18b334bc3e37c1f6e2fb77) >>
->> endobj
-15064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.191 277.183 287.538 288.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-15065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.222 249.202 223.528 260.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1) >>
->> endobj
-15066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.67 249.202 304.803 260.106]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.689 249.202 395.332 260.106]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [479.267 249.202 513.996 260.106]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 237.247 138.04 248.151]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.916 237.247 349.58 248.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
->> endobj
-15070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.115 237.247 475.891 248.151]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.815 197.311 207.648 208.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-15072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.423 197.311 237.297 208.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) >>
->> endobj
-15073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.438 197.311 318.571 208.215]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.645 185.356 267.421 196.26]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.423 185.356 375.066 196.26]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 157.375 194.567 168.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a2d4cc0630c7f91e7e490a1322c53e5c0) >>
->> endobj
-15077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.814 157.375 350.59 168.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 129.395 190.503 140.299]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a1c4c199e8c2b7038c2cc7769d20d53c9) >>
->> endobj
-15079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.985 101.414 203.712 112.318]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a850e5f1b5da521aff7ff926c0b54aa7a) >>
->> endobj
-15080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 89.459 179.554 100.363]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15082 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15086 0 obj <<
-/D [15084 0 R /XYZ 89 770.89 null]
->> endobj
-15087 0 obj <<
-/D [15084 0 R /XYZ 90 698.973 null]
->> endobj
-15088 0 obj <<
-/D [15084 0 R /XYZ 90 669.298 null]
->> endobj
-15089 0 obj <<
-/D [15084 0 R /XYZ 90 630.358 null]
->> endobj
-15090 0 obj <<
-/D [15084 0 R /XYZ 90 602.378 null]
->> endobj
-15091 0 obj <<
-/D [15084 0 R /XYZ 90 532.11 null]
->> endobj
-14640 0 obj <<
-/D [15084 0 R /XYZ 90 532.11 null]
->> endobj
-15092 0 obj <<
-/D [15084 0 R /XYZ 90 464.104 null]
->> endobj
-15093 0 obj <<
-/D [15084 0 R /XYZ 90 464.104 null]
->> endobj
-15094 0 obj <<
-/D [15084 0 R /XYZ 90 434.389 null]
->> endobj
-15095 0 obj <<
-/D [15084 0 R /XYZ 90 406.408 null]
->> endobj
-15096 0 obj <<
-/D [15084 0 R /XYZ 90 378.427 null]
->> endobj
-15097 0 obj <<
-/D [15084 0 R /XYZ 90 350.447 null]
->> endobj
-15098 0 obj <<
-/D [15084 0 R /XYZ 90 322.466 null]
->> endobj
-15099 0 obj <<
-/D [15084 0 R /XYZ 90 294.485 null]
->> endobj
-15101 0 obj <<
-/D [15084 0 R /XYZ 90 174.678 null]
->> endobj
-15102 0 obj <<
-/D [15084 0 R /XYZ 90 146.697 null]
->> endobj
-15083 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F90 758 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15123 0 obj <<
-/Length 2016      
-/Filter /FlateDecode
->>
-stream
-x��Y[s۸~ׯ�SJ�T0 �x3�I�u��uc�)�h(
-��P�BRk{}nIъ�뗎
D���� ��y���쟋��U
z)J#y�[/�^�R�#���>�,����O^%�����o{�����F��}��}�x�=bp'^��}���5
��a��w�'m=FC�.��ٿg����Q}Y�@�P3B!F��6k�<�S���u@�/[��bm�~ە���վ��BV�ֶ��~_\E�mH�X�xs�#�^�(僵��9��o�
����X�y������B�*����eV�����ڱT5��iח��ik�m��W��+�
z��h���|��J��e=�h��,���qhf
�g(M����2�	��������usQ��؛�Iʌ�7F��(w:�|k�a~�
0x��;�
STw�����桭�0��h�@���p1
-j0D1=?~+)�ӱ��v�WEY���|#�/O��׬���^H�~vAz��9��DT@��d@�?!���.T�xBR�ի��P���0��P�{U�i�x�ԬK�V�I6��&]��|�`��J���� ���z:�	<��[�e/�C��2~W>L����"��u~Y�%04ȅz���4���`
�V)1J�[Y^�܌�[[�a
L�C�)l7�J,�j��r�WVV�^��a=�{v�����ji�>0�$(<4�VN	J%���C;!*�QĻ �
 ���
G�;��!G[� �7-xf����xqD3ys�l�!/�k	Ż
� n� %c��;�6%�[f���r�Ч�6��qbs��h'\\�B���;��A,��S��%���U�_��5�J����ȋD�ȋ w�^ip"f�p���/m�Պ�<+bcE�y!3o3�0
+�~b�eүZ��
S�am3��
6�f~�d�m�/K
rS���8<g��[��(> �K�^�T*��F�%МN�� [...]
'��-k��]=�c�
.e�Y�7F���܀�� �\�5�R��Ǔ�zS��������޲6�,o�׽�rq�벾����i/�^t�
�h�wg���G�!��D�
-Є�
@
S�8����: �>ՍB�5����{�SW7Y�UP#��µkGb�Q�wzi��:�l�ƾ�T��w���•���"�8Dw����S!Ћ�^'�<j�f@#�	0� �~-�1��I�
�&�i�K���۾��]W�Se8òN}`
��F���9�

�}��Ǣ�j�$!�
&�1����<
-���(����	"�A��lK���D���NrF��pj�1M��S��MBh;�D�\�q؄���[�R���Oy�5�-3�a0M)c�*m�"�*�� �`��bWC]�ˀ�
-֩=���R;CP���Y���Zn;� ���`�x�6��{բ,��&�f�֢.3�]%�����}�?5N���ZoS͒*�t��'��|��P.�h�h�g��x�����'�R���rN?.,j
k�F����[H��̆{�����J�떣;U}u���I�42'�׻�5�Ŀ(�
�fǗ�4暖FPHO^�R������5+�8xP�"4��� ��,B�ǍX�*�pz&q�*�@�IU��X��#��xy���X�g�"
-İq�X��������/�s
-"�p������
�6���;����\�X?� yx�h���g��cQ�E%>�$��!
2�

P,k�uu����~g�VW(�,���fxg
�����������40Ĥd ��#`PJ�8�lvPT�"�]�E���ֽ
�3
4
�D~f�����uqW�F��Pu2(�u���Uk3�@��µ���U�
�vn5�:�'�.�5��NV��݄�������T(��0{
������/��B
��
�����B��$��
-��=�n�
��qz�$;�����A���h����9�S���/��?���p�7���;�U5h �n:EV�
;��^_:���T����C�M��./.V�; Aw(���B��q�y)��h�[Yw� �䎂�?	��*
-endstream
-endobj
-15122 0 obj <<
-/Type /Page
-/Contents 15123 0 R
-/Resources 15121 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14997 0 R
-/Annots [ 15081 0 R 15105 0 R 15106 0 R 15107 0 R 15108 0 R 15109 0 R 15110 0 R 15111 0 R 15112 0 R 15113 0 R 15114 0 R 15115 0 R 15116 0 R 15117 0 R 15118 0 R 15119 0 R 15120 0 R ]
->> endobj
-15081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 683.479 227.503 694.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9579b18f0878bf26e817c7215ceb4aa3) >>
->> endobj
-15105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 653.083 240.982 663.987]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd1af04908aea1d1e5deda23b627a24) >>
->> endobj
-15106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 622.687 240.982 633.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3b556a97f08c7fc9cbf0e4e9e7b6d901) >>
->> endobj
-15107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 547.983 192.565 557.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.535 547.983 232.156 557.911]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) >>
->> endobj
-15109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.364 531.136 237.259 541.041]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 516.611 220.779 527.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-15111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.749 516.611 260.619 527.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a675704312a01f43f3f2d23f1f24c50c2) >>
->> endobj
-15112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 486.215 191.737 497.118]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-15113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.236 486.215 242.377 497.118]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9957fb5cc207114f8401d86fd66c7fba) >>
->> endobj
-15114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 455.818 240.255 466.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad2e8f2d9c5b2732df9e001bb155320ca) >>
->> endobj
-15115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.753 455.818 324.637 466.722]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a4a60232026ce7d82ef5a4cee5e482fa9) >>
->> endobj
-15116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 352.86 226.034 363.763]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad0f4f20d94ed76c2a147a571e3f44e6c) >>
->> endobj
-15117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.157 352.86 391.99 363.763]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
->> endobj
-15118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 221.038 197.257 231.225]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
->> endobj
-15119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 198.612 195.613 208.799]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
->> endobj
-15120 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15124 0 obj <<
-/D [15122 0 R /XYZ 89 770.89 null]
->> endobj
-15125 0 obj <<
-/D [15122 0 R /XYZ 90 703.639 null]
->> endobj
-15126 0 obj <<
-/D [15122 0 R /XYZ 90 703.639 null]
->> endobj
-15127 0 obj <<
-/D [15122 0 R /XYZ 90 641.197 null]
->> endobj
-15128 0 obj <<
-/D [15122 0 R /XYZ 90 567.251 null]
->> endobj
-15129 0 obj <<
-/D [15122 0 R /XYZ 90 567.251 null]
->> endobj
-15130 0 obj <<
-/D [15122 0 R /XYZ 90 535.121 null]
->> endobj
-15131 0 obj <<
-/D [15122 0 R /XYZ 90 504.725 null]
->> endobj
-15132 0 obj <<
-/D [15122 0 R /XYZ 90 474.328 null]
->> endobj
-15133 0 obj <<
-/D [15122 0 R /XYZ 90 400.382 null]
->> endobj
-15134 0 obj <<
-/D [15122 0 R /XYZ 90 320.601 null]
->> endobj
-15135 0 obj <<
-/D [15122 0 R /XYZ 90 182.225 null]
->> endobj
-14806 0 obj <<
-/D [15122 0 R /XYZ 90 158.569 null]
->> endobj
-15136 0 obj <<
-/D [15122 0 R /XYZ 90 158.569 null]
->> endobj
-15103 0 obj <<
-/D [15122 0 R /XYZ 265.271 77.486 null]
->> endobj
-15121 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15148 0 obj <<
-/Length 3123      
-/Filter /FlateDecode
->>
-stream
-x��[�r#�}�W�)!�VX�1�JR��Vv씼�$�-ֈ
I�
�����9�
$(͒�+y҈6����� 
=��蛫��]��ڈQJR����a�ґ�)Q��Gƌ�L��t|;at�m���v��\<?��M6����d�盛�oo�w#Ǜ	K�y>�[9�'�\���l�u����
X��1-�X&b����~�bP���SFA��ly��#
���w#JD��~�-G�
�]��_�xE�uQ•}��UB��J�c�ENx��O.�e1��<���]���
_c��
-4}IMN�$m=V�%�'1�^�X�\L;Sk�9%�214�\�DjO����d�7���<����,���h5��y`����1q*	eܛ�B��f�)V;�QE'�R��v7��)��M�-ݻ�Y��~͘��(Dj�y+��7n����
�W�s��Jv��y���p�z����YihRJT; �bNج\m���c��k��޵H�܌0�0jj�Z�G�\��gD�fp#<�	�6vO����m��6e�����' 䘳]=$P��Y��&8)k���O90�5�fO`+A7��
�2�Y����;����ߺ��ݡ��*%	6�E7�I�QvB����t��!�{A*�g"U�@�;��HŔ�|�V�p���u�TLs|x�
`��$ő�k \�w���=;A^VP1M�
-��O��J�DHl�!B��qW�4�
(I��>���2U�0���$[��U
���sV�lW��a�9[��;
�,&bΕ�*�Ӕ�D�dN4d� az��g
�V�>��/�;N�M9�
P��(�N	�4
B�p�RŢh�(I��� v�b~���
���8��k 
�11��ڛر��z��B�I�TQ&7��}��O�x�g{���Y�Q���
�H�׼ĦY�UU�/�e��!x�n|��^

2'4��s
-��u�~���ĥYՠy��W[8���y����Fj�V>aj�+(�
-'�b��FV��������
-�
W�&��״]g�P���K�H�& 
"�7/��%ШSu�-�m��ڳ��>n�
�Kȉ��[�:_͋�����sk0�3K�}�����d�4BY��n�Sg�ZHz �/Z�������$q<A*�)L�<%���r4K�PG���4)��B=�r0�`x���sL� ��u�$����c�r��"���0��X�8˓Wm�"}�%B���]LH?�CZz��a�8oS��
�rÏ!�N�M@| ��R��
��v��҆�/f�R�C��v��z�@l���6����)fuRP,�
����U`�?��=lգ�C�O����P}a|Q8���S��4"��.��>eDQ'��
-$.$�����CR�
��
�
6�p[m'�<ֳ���j�B��-�h�ׯ����9 ¥��@[�V���i�5(y9��BmYPń\l��$"K��Kwe�����%ɔ#Lý8m�ƴbB�vCFR���p
-22���
���ˋ�V��=
��ˋmTZ,���էH�T���l5w�zY�����η����p�v��Z�"k�˜�o�F��W��~��N�R]��xH�.�!]!JL��*/�:A^�x��ڦ5O��-��-�}s��n|V
+]�~�}��j�t
���?9����������Pz�s:
ն��:-ڕN�}=k6����_���Ȇ��q��T̞�/-6y6v��q`[�EX]�("7��L0,��OE��cE���Ct�^��<$�$f=�Dw�$^����
k��2~��WO�e���DO�?/�K�~��
a�X�i;�?
Ng/���C�M�#�)�D�'�f"���V)�-N�nӾ���9
֢�P�0��j���m~\x/f�)|ud��������E�7$Mb��L��f�¨�t��f����0�Ҧ�NA���
-7�u��U�/�YQ�Ϊk&~�2����^6��r��]� �
N݀�l��傦g!C=��b�A��T�
||��I�A<er�$�3P���BkD�0%b$p�^����%�$��J�o�*��<����k�zoD(Y1�
-((@���
��DЉ01��b�ٖ�O��%��O(-N�V��'��
ԧH�k%Dݎ�~�3%��s_���-�iˠ6=�3�
�B���d��¨�
-�ڶ�D%��:�<���l[�ۇE�zS�ca�� ��|�
-���UŐQ�&�2�l�m6��ݦ����_���/��x�;��������$l�����)I���3� `\"����N�	uyj�Z�6�=��Nİ�i���V��j_���AM(d���9;��������Dwm�w{��%��
4�
-R8��+p5�O�"�
޿p�[5.x��߸��W��|�o{���E�:����
�s���k7[�h���N�
�w�n�Y���i�+���V�Y��q�Z���O���^jY���	�Cc����/�ϺXX�i��h��m�`�cf��%VY,�1�,j����Ӷ�L�`���?ֵ9{��с�2敳�+���P�(�lM$���� �[n�Zn:m|F]ʆ��� u���
A�e�Q����O9����\�n�
d2��t/gy����>���ܽ���&��qt+��F83�b��U~��~�辿-���x
- �¥ӇY�/G`�=������S�'�y^�e9������٦?	p+�јG&�Dwf����D�[#���7J��
?��<�>w��u�z�j�nv�y\�^�o�
�=����@�H#c�Kt�j� ����s��A��
�	��M��E9k�
-uW���ij�]�ۍCv�����
>�>��;{��Q���b�.�D�;�
�.X�kf���K����w6.S&���2]?�*1�jMu��mea^��s�y
�H��-�@6aH��8h���xd�و~�e�B^�eJ�Q�W�E]��2��s�
*�V#�Ç&7����,�[���U���Y���<���{
�l���^�����7��2��O291\
��zc�F�U
�>�͙ð~{��{��6��C��j�����/#�A�Z0:~�7�sJ�4j��zUU;U�/-U����n}�����q��
ɬ\
W{�H	�
-���[������e�n�d{��-��0��0?e�_hG�����~��/K�ǃm�j
�b
-endstream
-endobj
-15147 0 obj <<
-/Type /Page
-/Contents 15148 0 R
-/Resources 15146 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14997 0 R
-/Annots [ 15139 0 R 15140 0 R 15141 0 R 15154 0 R 15142 0 R 15143 0 R 15144 0 R 15157 0 R 15145 0 R ]
->> endobj
-15139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 500.508 239.046 514.456]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.113 397.041 347.542 407.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a4d75a1f9b3e618d337fde1b4de9fdac6) >>
->> endobj
-15141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.331 397.041 513.996 407.945]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) >>
->> endobj
-15154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 386.062 117.557 395.989]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) >>
->> endobj
-15142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.914 210.613 239.046 224.561]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
->> endobj
-15143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.113 91.952 347.542 102.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_afab20885083717c18371349d4c182481) >>
->> endobj
-15144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.331 91.952 513.996 102.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) >>
->> endobj
-15157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 80.973 117.557 90.901]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) >>
->> endobj
-15145 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15149 0 obj <<
-/D [15147 0 R /XYZ 89 770.89 null]
->> endobj
-15150 0 obj <<
-/D [15147 0 R /XYZ 90 721.073 null]
->> endobj
-15151 0 obj <<
-/D [15147 0 R /XYZ 90 671.961 null]
->> endobj
-14641 0 obj <<
-/D [15147 0 R /XYZ 90 624.938 null]
->> endobj
-15152 0 obj <<
-/D [15147 0 R /XYZ 90 620.454 null]
->> endobj
-15153 0 obj <<
-/D [15147 0 R /XYZ 90 525.813 null]
->> endobj
-14642 0 obj <<
-/D [15147 0 R /XYZ 90 387.058 null]
->> endobj
-15155 0 obj <<
-/D [15147 0 R /XYZ 90 382.575 null]
->> endobj
-15156 0 obj <<
-/D [15147 0 R /XYZ 90 235.918 null]
->> endobj
-15104 0 obj <<
-/D [15147 0 R /XYZ 90 81.969 null]
->> endobj
-15158 0 obj <<
-/D [15147 0 R /XYZ 90 77.486 null]
->> endobj
-15146 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-15166 0 obj <<
-/Length 2682      
-/Filter /FlateDecode
->>
-stream
-xڵZYo�H~����,D��m,��1�
O�}r��h��H*$������-;���Ww���u|]FT�ng�\~=����\�����L#-��]��4��\#!�i9�����O�͘T�h	�����x����v�����	�OxF� �b5K���Ox��׿�b����*f�2��gN�>�2�d��A�8��lD��/�8���p'�v���
�d�uNyT�K�G��)��d*�1¬x��!�i�{�� )V �H��F�zNHt�ʖ�
#
ӣ �I����N�<*�?;;{>@ Ώ�a �X �b.ETgپbF���:�b
-
-i
(~W-���M���n	���QtCX�T�[�`�����YԴ˳���OI��dp��!$
�S
)�� k^�1�FPd����ەC(b,
-����`�!��lb�n|Z�M
(%��9�
�Y�Vu�j$AJ$)�4�k
-0X4�G\W�b�F*&ݠ?*f�zHؼbGl�̈́�K�� 3�5b��·�(x��V�,�̋	�
-R�d�Q��
���T`�Czx�V�9(c��MR'�����0�(�
,��M^�W��&��5�����~�s" b���K�8�%91��cI�,)��TS�p����j���t�]��(��`
A\\�f���E�fe$
��M]����ӄ�E�/&�r$�V���!�IW}M�B{Vq�FI�  (

J��G��X��QUNhd�h܈@�B\���]eN�ϾpWW�䥻Ͻ
-HU��8�
<�M�\+:hɧ�P�t��P`����_�%RP>V��x�e,I��Ym�CJܽN2���h���4�R:>L�$Q�	��_��s`���T<��
�u{����\%��z�]��@��E8
�����(.:���fۺ{G�a��HD�������czȱ%:1LN��xcP9ao k�X�)ԓ��yP��d
�w�����w���sg�B�}���0ڇw�Pa���3ǖh}F��
���M>�����I�C	��%%=���~�7W
{��p�
�2�(Cv��)��L�Ӯ5F��!� �~�l�
�� wϒ�=�r��6���뼼uw�<]�[s�|���:+�۞�ىa�&e	f�,�C�A]l
� ��'�������jg=�7�}q=��V;s
r5�df����&5�$���%�Gs��Q�^L�/+�u����V ��tU�1L�I��>�`���
�����%� x�<�tG�
�_�%�L��Q���+ث��p�X�>
�d����3L
>sP7�&c_4_Ҫ��fS�K���vsMJ7#�D��D?a�x=w� I���M,�6_
��
�U�Y~Y-}���
@������uvN�(K�^w�Q��
`��P���-6������
lN���փx�����~?��.���j�ڐW�-�Z�W��4��s�2
�(�a�'�gj�P����L��I՝7
8>��H�u���
7�����\�	���~0���������b�(
��h
��(8C�@xJG0yP
"8�Ŏ��4�9Q�b�N�bnq����~�Y��GaVI; ���h��&\>;��=bG&m��h�
-��tX��}_��n�r�X�
���th�6�=e�;=eۺ���:��/]�N��x�%�Ѣ
-�]��pl�o�H^�}�U�n�'�}�r����k��?}n��	�Ol`%�)�	�Gԧ�ض�G9��C�[Zv�n�#�<����|��w׶c���)޼�F,{��������o�:oW�{tܕw���2�[�%�آ���P��p^��n����,�u�k�{����+��Ƈn�:J6���;l���]R�/��۬��d$fU-�L��r^�2�2M��E����t��ә8�/�V�A���b��γriDS�\.���l��yx�-S�0xzU�ۢ;�h9�*��:P�H_%�_�@�O�Rm�!'�!,FX
��L&��R�:�&�	9�o�W����z��Oa��x���j��{,
�}d�E.�1ʜ�wf=���C�$��DH���	l���}:���~�YLB!b<�Y�z��Ν1�H݌Z�}�|t�6�C�Z#�v�
 H�*�T�CT�����/���;�]FM�I�e��b
|�w�o��Y�M�^W&1޹�a� �����u�Cq��aeו�H���
qY�VE�K&��/�1d�tA�} 
 �*�R������*�c##���NY��3R�����½�2�2R�Ǹk�NQS8l1v
,�7M:e
˞�/�O(���r�~������>��?����C���=>����>  g^�9�/(覀�Rq�2��2��
-�
=W�>7.N�ڬ�c;�����9�H�6b��r~�G'�o���"�Ih"�t����e��.�)� fԎ�YPq�?O
�#�7�B��&�1d&��%��
֝vI+On��IW�O��*�md�}��Z����
�>����B1
��4�����!��D�8
>S`&n��_ *�8�#���c7ѿ8}[ �WD��{z��
��G��|�����3�� 
L
��z���0Y��
-Ṁ���6�t
�S��E�~L\}x����΅�|	�3)�]�P%ױ��>�®Ef+���
q��s��#<�E�OV��ݜ��^oo���Ep���d�)�R��xQu�7/�e1��i��oKk�
-endstream
-endobj
-15165 0 obj <<
-/Type /Page
-/Contents 15166 0 R
-/Resources 15164 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 14997 0 R
-/Group 15162 0 R
-/Annots [ 15159 0 R 15160 0 R 15169 0 R 15163 0 R ]
->> endobj
-15161 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Pointset__Powerset__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 15173 0 R
-/BBox [0 0 434 130]
-/Group 15162 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 15174 0 R>>
->>
-/Length 484
-/Filter /FlateDecode
->>
-stream
-x��U�j
1
��)��H�
C�a!
-=�
�!��fBHz��W���$
�
3�lK�,Y��-o�s���� c~���bOx����]��7~���o����0�q��'�'41N at V����HI�Z�K*���֢
��Ao
-�
�R�
���X
-�n��b���25���g�8vԑ�3
��q�!K�:k30ɘ,m��.�����S�]��Uu�T~���Xo�<����:qf�&�t3��X�<mq8�B:�>���a:yaN��u
����<~?�b#6�"ܺő
h��6u�i�M{�2
�*�i�,Ye����~9L;V�%��#�QP$�Ma	-��t���E;��U��'V'�-y�a�j8[�B�^��sK6���3���r��Zg�ŽjR��Y�M;��+��Ln�ؓ�������\�
TO}�ߵ�ʅ��qʄX�5*Z���L�y�C'�gU\R
�?͸�;��$��;�
- ��o�
-endstream
-endobj
-15173 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-15174 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /GZIDQG+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 15175 0 R]
-/ToUnicode 15176 0 R
->>
-endobj
-15175 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /GZIDQG+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 15177 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 556 278 500 722 584 278 667 667 611 584 722]]
->>
-endobj
-15176 0 obj
-<<
-/Length 15178 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n� ��>��b��3vc�L7.���> �ejR�����
2MJ����\8\�K�ܙqe黛eO+ӣQ����$����Ix��(�H�/'a�ԛ�mYiꌞ��a���m���
�X����\����c��Y�C��eI�2Eڗ{�UL��`>v���
��o��f��9�$gE���0WJ�̏�5ڏ6!����	�A�o��r�gY����@'*�9���@|t��I�#��Agh� �@��@e����*�'Ӂ
-�g��|5jr�
P�W����~
�r�
G�*���ĩ9�Uq�+���W�������o��sysη;<���ã��[���]��
0�r
-endstream
-endobj
-15177 0 obj
-<<
-/Type /FontDescriptor
-/FontName /GZIDQG+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 15179 0 R
->>
-endobj
-15178 0 obj
-339
-endobj
-15179 0 obj
-<<
-/Length 15180 0 R
-/Filter /FlateDecode
-/Length1 2296
->>
-stream
-x�UV}l[�?�>�%����~6����clj����G�&i���l'6��Y�|�!�K!e�el��eZ%(
-��:iBeڴ����2M�
-BB�"0����&(Ra,�;�9)����s�=�s� 
-� 0L-L.ÍOO�����Dz'fO~���Gğgf&�?o�ӧ��#�E2$����.�U��յF����%>�]��8J{
3�//L�-�
L&���"�i 6��A�@6:�n�ёfz�g���fu�&�Qқ#�
p �E]FGТ����LJlne��8��Ǖ�k��ט0��\g�K��������2;�@����h��QIt9=�|�Z
-�-،!��)���f,̖V��iQ���Ѧ&Ƌt�&��M�U�=͍{���x�l��)�+/ww(o԰�Eno_���(3���hE�������k'��?A#�ih���i.A������VlM�R}U�^�����c�m�?�OhO%��qP[�|���j�_��s��&��]�\/w���i�M�U�v*�\0�أ\ݞ)�ܭ\���
���Vr�Y��OO���X��@��� �Tɯ�cg�X���B��<hX9yzq�䩥�D�#>8�����g.`ᅾ��.,�M.r[�2��������%'���s
����@�,���07�ل�٨��Yf7�*u�~1|��7�d�{Eky��(��#[&���"��§�k�'���ƃ�I��&ʟٺ�@u_����꥞A��
 n��JD�T&;V���&�
�Sh�%g])�C#��}{�g�LR
C���������٥��:�i
>���Fx~Bq���"5�ª�p��[��}�Oz��
��l6�t,���%
��n��O�| [...]
-?�LRsl�a�7����E
�@�8�zrxͫ%�髚G�{�2k�f���ޤ��b�%	�
z���/���K�.-
O,�m��ߠڪ��_э���˙���;ao�����l��ރ#ɽ��r:�oUVq���ב���6 at a/�.%�F
g���	c9,K�!�����bw��3��1��r�����ŧb�ϫ=��\��(�J�'ڀ�Hա��P̖�X�yD
��h���?޽����f�z9��q|��bC��p�0Y�[���R��r��d�S�̟���=�p�t�d;�?�=����ű���c�	����;2�9�}�ܿ�����a�T��7�����o
��� �	P
�MP'[X8Ԁ�.�D��뙔.g�P-K�J���ݥg~��sk���4N
���]�,��
k���otc��o���ƚt�OL}���ξX�6p�n���{��+�]ѱ&��Hhg>��s�zJ�k�{��G�*�l�3��2��Ã_P�m
��TC6H��	��9$<:~�5�'7O�'��H'H����
�1���
�mx�
�pI�eP� �����0����Ͼv%�����֯)W^:�
��[Pg3�:�@C�Ш�۶\�F���KK��n�?��߯�)��B(�w��j]Lg���1��f"�X�
-��y��V0m��e>?R���	qs�ˮ���/T|ڏ56b
a�/��G�;0����7�j?ޒ���� �.�(��Z샸�
-
�.w��*�bx��L2�و$o�9�X�k4�����
"�?�.�F�H$
���O/�.ȇ�t
���++Q9�}["z��A�L�o���5$����w�6�E�.�m� �*�VQ]��U���
-S��-p
-A�?	�j
-endstream
-endobj
-15180 0 obj
-1763
-endobj
-15162 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-15159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.113 523.384 347.542 534.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) >>
->> endobj
-15160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.331 523.384 513.996 534.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) >>
->> endobj
-15169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 512.405 117.557 522.332]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) >>
->> endobj
-15163 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15167 0 obj <<
-/D [15165 0 R /XYZ 89 770.89 null]
->> endobj
-15168 0 obj <<
-/D [15165 0 R /XYZ 90 648.051 null]
->> endobj
-15137 0 obj <<
-/D [15165 0 R /XYZ 90 513.401 null]
->> endobj
-15170 0 obj <<
-/D [15165 0 R /XYZ 90 508.918 null]
->> endobj
-15171 0 obj <<
-/D [15165 0 R /XYZ 90 400.817 null]
->> endobj
-15138 0 obj <<
-/D [15165 0 R /XYZ 90 378.44 null]
->> endobj
-15172 0 obj <<
-/D [15165 0 R /XYZ 90 378.44 null]
->> endobj
-788 0 obj <<
-/D [15165 0 R /XYZ 90 291.477 null]
->> endobj
-450 0 obj <<
-/D [15165 0 R /XYZ 90 282.579 null]
->> endobj
-15164 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F11 613 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F22 2996 0 R >>
-/XObject << /Im24 15161 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15240 0 obj <<
-/Length 2314      
-/Filter /FlateDecode
->>
-stream
-x��Zms�H��_�'���3̀+{U���^^���-BX��P
���y��r����U��LOOw?��`cn`ㇳW㳋7�2<�1ʌ��a��
r��M��C�16G�M?[��рb3���,�'o�i�g��K�8J�<,�1�1������o�-F-�l�+r��jH�X�Z^9btw=n�Ñ�+2=H�*��|0�6����b�E��܆�a6 �&<".%��:�������3d�A��
�]#X�}�3x�����ƣ
�0lj�56��~:�Z���#n�E� h5u@�-�M��n�Q �Q�|.�����J�"J�\rW��׋7�N�0d[��gk�~��i�5>
P�g�ə~'�����o�(!*?�h2[-��4��O���G�X��æg.��l�L��M�!q��b�YT�ZcEZZ �Ͳl�J�y1��
�,SC�
����@?QD�����Q����f�T�<L
-_HX�K�A��z.q��'��6mİ[*
���5J�C*J�!�-ev8`gH,Dl�Q��k�Y�/�D��U��D�ȏ#F韣Z�C���f��!fpB�.3p�υQ���X#o"���S�B��jP��x��h?�ʣd�F��x�d�
3�H59���[o"�˗-+Y���0{=�=MӸ��ԟuB;j����-�%�̈y�
l�L�j۳�Aͩ� 5�,A��~P�0�1_s�T\�VA8SO����?l�>���8׸B����^����b��6�X�!��SD��� ��t���KI-R��
�<^
�oh���,�ۖ��"[��+��WA���*~ѺaVm�ޏ�V�
X�y�C�=F0�8[��e#�R
���ʑ�u"q%4���pޅ?@
�N�J6�{��j7��*Nԩ��u�Y�J��k���E��`˓b�
w�[f�ZL�Q�w��~{�3_K���D8�pr
�0���ߢd��~�~~��ۻ�������z��S׭X��H��P�pz����j�3���J��"GK�I��d�.7�,��R�b�3M�"]����/G�^Ɉ��;H?�Ʌs$R@�a�bK�1���j�i�/=�<_����
��r�V�%*�UW�04�uX����\}x7z�߶�u3��$��Շ�3B	[�A�u-!R�b@9���$�<N&�
�N�,D�7�lb3N����U)7(1�U>#<F�/4:~� [...]
 ^ɯH�
-Da¶�
D#�l/����B��b�4�!�sr�@�
�PmhXUM5�\���.�t�ڎ��B���JU4Y��qe��N+*ҳ(���|�%[��t%A
��˺�VS�ҽh��������+c%�(��nK�ɥ��K5��5ǡ�鋍N�oi���f�
I�w��!��(}���^/��F|~VD~
�'��,&�LT
�އW�����܍ŀP���wn)�]�!Ν.$�V@:_f�.g�
vFC�B�e{MQ�O〠.K�+]v�
��B*���wT'�U���}�Ȧf,���C����X�MC�.�X�i�1�b���҃�7���S�2��U�]��K~��fM���}���sV���=�
-��yJ�2�>����| :�[����h��u&H�)ɪ�d�����z��|-v�
-�
�V$SB(;���+�զ��*�.�x�q��V�����P��/�ߐ�̳��>�i%󧙉�?c&ZH�&bYp_�� �6yu�,�B���j#�ݫ�î���@	�j
���CW���^����踷�=Y޾�y�,�����iCzJ��
jr���4�䈂�y�6�!���|���&��� ��܀�y���b�(t)p�r�k�B\I|�Q�?;���E��D��(x_

-D}�{�G'Е�O�ru����K�`��TP���(������x?��懠��i�Ǔ��������?!׫U�mGh\К{��U#q����zB�	���)�NS���:��LA�b�T��٤^w�f�OG���)3�|���lHw�@r�n qJ��tm��N$1��G��	ǐp1k+=!�N��NgOG��
��&)��0m?n��#���ȳ��9�ܱ�x��
p�~�@hC(�9H�^���;���=�jdϧ�.����8�
-���yҶ��2*���<z*���9)l�
�Eǹq�J�ު���0��8*�1��OVe���Y�̩�\�%wa�kӿ����I
��-
9��qE�������y��Q�.v�Zۇ�0�����H���:�P*�rt0A��R ���0„�����˗�D���fa�S��t� iv�
-endstream
-endobj
-15239 0 obj <<
-/Type /Page
-/Contents 15240 0 R
-/Resources 15238 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15258 0 R
-/Annots [ 15181 0 R 15182 0 R 15183 0 R 15184 0 R 15185 0 R 15186 0 R 15187 0 R 15188 0 R 15189 0 R 15247 0 R 15190 0 R 15191 0 R 15192 0 R 15193 0 R 15194 0 R 15248 0 R 15195 0 R 15196 0 R 15197 0 R 15198 0 R 15249 0 R 15199 0 R 15200 0 R 15201 0 R 15202 0 R 15203 0 R 15204 0 R 15205 0 R 15206 0 R 15207 0 R 15208 0 R 15209 0 R 15210 0 R 15211 0 R 15212 0 R 15213 0 R 15253 0 R 15214 0 R 15215 0 R 15216 0 R 15217 0 R 15254 0 R 15218 0 R 15219 0 R 15220 0 R 15221 0 R 15222 0 R 15223 0 R 15 [...]
->> endobj
-15181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 685.011 181.845 695.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a88358b265bd62da2cd81c56fcd645ff4) >>
->> endobj
-15182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 656.728 181.845 667.632]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae2abdfa9b2796151d2d8940d14129568) >>
->> endobj
-15183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 628.446 154.727 639.35]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad1574856ed0bd50691f53d457f7050a3) >>
->> endobj
-15184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 600.536 176.505 611.067]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2620151d844d477b43ae04337c554e99) >>
->> endobj
-15185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 585.348 450.955 595.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae2abdfa9b2796151d2d8940d14129568) >>
->> endobj
-15186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 523.787 200.451 534.69]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9639bd96c993f44bae8ec9185cf00d45) >>
->> endobj
-15187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.79 523.787 270.434 534.69]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.775 523.787 441.164 534.69]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-15189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.518 523.787 513.996 534.69]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-15247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 512.205 133.174 522.735]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
->> endobj
-15190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.341 499.106 358.056 509.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 487.727 200.451 498.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aee7b076885815e52c4678cfc0fb9e5a4) >>
->> endobj
-15192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.105 487.727 303.461 498.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.382 487.727 396.848 498.631]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.805 487.727 513.996 498.631]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 476.146 156.965 486.676]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 439.713 200.451 450.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0aa45bed5fe5f850d404fa9f415c4b0f) >>
->> endobj
-15196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.868 439.713 303.224 450.617]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.821 439.713 431.287 450.617]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.126 439.713 513.996 450.617]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 428.131 191.286 438.662]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 391.699 200.451 402.603]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a81171c017292bad186bd36d04e0450e2) >>
->> endobj
-15200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.975 391.699 338.396 402.603]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-15201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.53 391.699 513.996 402.603]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.396 379.743 268.147 390.647]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.486 366.022 244.201 375.927]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 342.688 200.451 353.592]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a98db63b080d0117099060e3faa4f0278) >>
->> endobj
-15205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.788 342.688 305.615 353.592]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-15206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.796 328.967 243.512 338.872]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 316.591 200.451 327.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa0bf2a85994114dfd0e8574b94c0843e) >>
->> endobj
-15208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.788 316.591 312.241 327.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-15209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.796 302.87 243.512 312.775]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 290.495 200.451 301.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a410bfbb102ec5ec854351c383685ca91) >>
->> endobj
-15211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.661 290.495 289.217 301.399]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.516 290.495 389.983 301.399]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.718 290.495 513.996 301.399]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 278.913 150.878 289.444]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 254.436 200.451 265.339]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8b27f6597e651407b433a5098a47a76f) >>
->> endobj
-15215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.818 254.436 302.761 265.339]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.112 254.436 402.578 265.339]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.892 254.436 513.996 265.339]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 242.854 163.052 253.384]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 218.376 200.451 229.28]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7347d9123ff2c5b816d45a40d74717a9) >>
->> endobj
-15219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.788 218.376 248.042 229.28]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.173 218.376 344.639 229.28]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.438 218.376 488.19 229.28]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 182.317 200.451 193.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad2b46dff4ba33746c2e55f7767627227) >>
->> endobj
-15223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.928 182.317 300.196 193.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
->> endobj
-15224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.146 182.317 424.612 193.221]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [475.481 182.317 513.996 193.221]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 170.736 184.641 181.266]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 134.303 200.451 145.207]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2915faf8e749672c943206607eb29f4b) >>
->> endobj
-15227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.076 134.303 273.237 145.207]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
->> endobj
-15228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.483 134.303 402.949 145.207]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.892 134.303 513.996 145.207]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 122.721 163.052 133.252]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 86.288 200.451 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a58e593961a5e7c1f92670c9cbcd6b633) >>
->> endobj
-15231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.299 86.288 246.899 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-15232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.401 86.288 288.128 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-15233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.372 86.288 402.838 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.892 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.707 163.052 85.237]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15237 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15241 0 obj <<
-/D [15239 0 R /XYZ 89 770.89 null]
->> endobj
-15242 0 obj <<
-/D [15239 0 R /XYZ 90 704.199 null]
->> endobj
-15243 0 obj <<
-/D [15239 0 R /XYZ 90 704.199 null]
->> endobj
-15244 0 obj <<
-/D [15239 0 R /XYZ 90 674.182 null]
->> endobj
-15245 0 obj <<
-/D [15239 0 R /XYZ 90 645.899 null]
->> endobj
-15246 0 obj <<
-/D [15239 0 R /XYZ 90 617.616 null]
->> endobj
-15250 0 obj <<
-/D [15239 0 R /XYZ 90 419.018 null]
->> endobj
-15251 0 obj <<
-/D [15239 0 R /XYZ 90 358.052 null]
->> endobj
-15252 0 obj <<
-/D [15239 0 R /XYZ 90 331.955 null]
->> endobj
-15238 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15322 0 obj <<
-/Length 2033      
-/Filter /FlateDecode
->>
-stream
-x��[[w�6~ׯ�S*�ø ��I���6iڸ}Izt(	��+�
-I����
 Eʔ�شZ{��#^@`0��7��
��
^]
��J�)����Sؓ�B\����<�1���'�� %����_>\��p�ɼ��|
x�=b+�H�t5��'�f��'#��(��|���}�:�N���B6ż d����Q��� B� �6�r���(������(�3���ɵNG�ƾJ6�ż��$�����
-���3&V�;�I&���j�����<Jb'Q~�L����=x�̢�MYLۋ�#
-�9�퍑�a�P����5�C>�(""�b}������.
P��x��8��Y��qR��>���4[�S=��l|�|�
ÏخMA)�

7P�>T
]R���7�oҭR����70��_�i�8`
-y���$�⅑��M,��4�/3[�\+�#���P~e�P�q��B�zg�I� H(˜��p>��t��'�Q�?�(���P�$��=߃Q���j�ߜ�1��X?O7�MC
tM�BQI����/
����P�T􂔑��

-Ϊ�"]��ƅ�xN��i�xn����Ո�a�gh�mEy�v /5PI��Gn��0�#� �{
��` s�L�4\.oƆ���DQ��`_-���>��I�
�Q����,){3�J�0
19��
��X���)� ��S�T��h
�dϞ0��/��)�AF���Qw�>�/���>�5fo���<MV�P�c������ 1Q�e\�
-�����@Z���i��
‘P�,t�R�D��V��0"���@
F��~,k���9��G
Q��2?}*P����Un�{��1"��
F�d�jW�%��r��
+����	
�.�V�Zг�
�B�� �6b$��� ��f
N�o;޸G����7�֩����(���������4��xY#ϰ7�t��!~����:��3T������!�p��6_y4H��4���
-�
-�dF��U�-ZE���x��.g�8jp�Pep#_
�����DWs���LS�U�m���`M�KM��4{9*�(5�� �Ѳ�.wyQ(k����ɾ��Y��s�g�4|F�3p�|��S� q�{J�rd�ѸX���r>���҈����������{�潦�Z�0J�LmN�P�D�N��4+
q�__FS���q��I@���r^<
3�3
�in0;7�.7eD����z���q���o�<
���X��Y�i
؋��}f�S�ξ���RN��շ���K��yZg��]�]��lm��.�D]k�9���9�
<�b at E��(ng@�:1 Tq��PW�iЁ�@�Q<?Ȁ
k��&À�V%e�*s"AcM÷9
��0���a��.����^
�N
v���
�
�
�/���?�_�Q��bc��t�,��o��cH�����SMp��{�l�.i�CeIDI�k���n.t��yZ�ިͱ��Z��Gy�G��y���N�r<`
��
g�,�7�X��J
!+�ԍa�
����D�գ�`�XPs6F�0BvѰ��������teg�o���g���P�*i�
&>E�l¢��i}^$!_m��2K�9����9�d�n��]2oݹ��<��&�������8\��0�3vܧ	oN�(��i^�vx�ϧ}"z��
�m�շ�w
N�D����@S��|�ocQ��@o�%���6��
[B>X���7zٷ�E@�
u�ҁ]j ���(ޝ<	K"�
���O[�j��#?�_�:��+s���&y�
�PAd��O��ys_E=�������@�~/�^F��
�@��m��
�E2��̓>y�,���Xi��d�Nr�9S'E�
:C+B�B�c��a#��@A�����ڇ�� Y�
�:�)i�~]�,�q���bޏ	T���
�;�VX
'
�
-�A��L�ы�$�ǟ���Nq>t��>�m���R����K���2�<����1+�*��e��(ه<�b��<_���|�Yd:^������(���
n^
�Z%i5�����
ND�����
-endstream
-endobj
-15321 0 obj <<
-/Type /Page
-/Contents 15322 0 R
-/Resources 15320 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15258 0 R
-/Annots [ 15235 0 R 15236 0 R 15268 0 R 15269 0 R 15270 0 R 15271 0 R 15272 0 R 15273 0 R 15274 0 R 15275 0 R 15276 0 R 15277 0 R 15278 0 R 15279 0 R 15280 0 R 15281 0 R 15282 0 R 15283 0 R 15284 0 R 15285 0 R 15286 0 R 15287 0 R 15288 0 R 15289 0 R 15290 0 R 15291 0 R 15292 0 R 15293 0 R 15294 0 R 15295 0 R 15296 0 R 15297 0 R 15298 0 R 15299 0 R 15300 0 R 15301 0 R 15302 0 R 15303 0 R 15304 0 R 15305 0 R 15306 0 R 15307 0 R 15308 0 R 15309 0 R 15319 0 R ]
->> endobj
-15235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 658.052 190.738 668.956]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 658.052 261.85 668.956]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a69b8be312d167dfebfba35b91c7c9f95) >>
->> endobj
-15268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 632.049 190.738 642.953]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 632.049 262.159 642.953]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab3118b07bb55902e522ddf0375eac899) >>
->> endobj
-15270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 606.046 183.824 616.95]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad1e68150be7e04e59627d8ee19c76d10) >>
->> endobj
-15271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 580.417 192.272 590.947]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7e6ce9a6495c9482980e3d2f76d948a9) >>
->> endobj
-15272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 554.041 241.935 564.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a43d9dc891079233f9ec0618bd5d4b46c) >>
->> endobj
-15273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 528.411 193.229 538.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ade90870acddf26103903da3d9e270088) >>
->> endobj
-15274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 502.035 213.163 512.939]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa1b0f7ebce9dd3f01d55861ea1698fdc) >>
->> endobj
-15275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 502.035 315.857 512.939]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 478.398 189.901 488.928]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9fddb040df547f46e9581e9ff7f80107) >>
->> endobj
-15277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 452.395 187.689 462.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a741a79dbeefc27764532e2be63120ff8) >>
->> endobj
-15278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 452.395 226.693 462.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 428.011 228.895 438.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae4d04c972b69315f7f82ef303f1b31e7) >>
->> endobj
-15280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 428.011 333.482 438.915]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 404.001 229.503 414.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afbae47064f15bcfd238fbb8e778e4ea1) >>
->> endobj
-15282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 404.001 334.089 414.905]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 379.99 187.264 390.894]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acfb675b82bc6829361d1647880a2e00d) >>
->> endobj
-15284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 379.99 293.213 390.894]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 379.99 371.148 390.894]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 379.99 455.727 390.894]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 333.066 187.264 343.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae54a4b74cd6e303628d06baa3014a4a9) >>
->> endobj
-15288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 333.066 293.213 343.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 333.066 371.148 343.97]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 333.066 455.727 343.97]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 321.111 220.058 332.015]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-15292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 286.141 186.348 297.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a14552a788e6f0f23a513ba57c1ed9129) >>
->> endobj
-15293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 286.141 293.772 297.045]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 286.141 373.367 297.045]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 286.141 456.837 297.045]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 239.217 186.348 250.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a34d86332404f9819605dbce5ab19f684) >>
->> endobj
-15297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 239.217 293.772 250.121]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 239.217 373.367 250.121]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 239.217 456.837 250.121]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-15300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 227.262 218.404 238.166]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-15301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 192.292 232.76 203.196]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a92c73441367e1d9c77bc360a009820b8) >>
->> endobj
-15302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.097 192.292 335.454 203.196]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 157.323 232.511 168.227]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a65234fd4b0ac6aa8765dc960489104c2) >>
->> endobj
-15304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.848 157.323 335.204 168.227]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 122.354 180.496 133.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa1a9bfc80ee005c6dcf60ad60fbcedfd) >>
->> endobj
-15306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 122.354 283.19 133.258]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 98.344 213.153 109.248]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a37fa37c5d3937c14095868add547dac7) >>
->> endobj
-15308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 98.344 315.847 109.248]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 74.333 238.459 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afffb0b03585f4317ffa46aff429b2c6c) >>
->> endobj
-15319 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15323 0 obj <<
-/D [15321 0 R /XYZ 89 770.89 null]
->> endobj
-15324 0 obj <<
-/D [15321 0 R /XYZ 90 673.181 null]
->> endobj
-15325 0 obj <<
-/D [15321 0 R /XYZ 90 647.366 null]
->> endobj
-15326 0 obj <<
-/D [15321 0 R /XYZ 90 621.364 null]
->> endobj
-15327 0 obj <<
-/D [15321 0 R /XYZ 90 595.361 null]
->> endobj
-15328 0 obj <<
-/D [15321 0 R /XYZ 90 569.358 null]
->> endobj
-15329 0 obj <<
-/D [15321 0 R /XYZ 90 543.355 null]
->> endobj
-15330 0 obj <<
-/D [15321 0 R /XYZ 90 493.342 null]
->> endobj
-15331 0 obj <<
-/D [15321 0 R /XYZ 90 89.65 null]
->> endobj
-15320 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F68 3032 0 R /F110 1507 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15395 0 obj <<
-/Length 2290      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�SK΄����i;�*�ljݨ��i��`@bE�! ����g/ A
-!	��<wϞ=�;�]bg�`���߯���x�	P�R׹�q�x<@
o��iD0��`�G�c�GQ����1ţl�]�8����4���W�u���,�5�N��b�����oi,FE\x��^�/f�
?�>eA5����u
q\���I2˨(�*��z
Б\��Q)͛��F�c�d:�Wħd�}O={}}��2�!FTy�3[�}�;1������s��
N|.����a+��O���9>��r�.~��#�N5�e��Ӣ�>n
g�V�+�4��hR�<�T����(��C�.��	~ҳ]�1�{ȧ��`�����~��")��Q��ei%�UFT�ϥ���b˪P%�
��
-Q� �r����j*a߸��	y��Ete��T��2��V�ߞ9�&Ba
P
^di�QD�,==M1����]R.����`�a�Ei<B�B
�ABe�?̀
1�hۇס�)r9y0���ǖ�T.���1�Fv#��E���tn�Ley'ez0k��)�������D|JCR���5'Z$��U<\��sY
Ɩ5b5�@c8@>t6�}�(���_
-h��̣2�[q6�g
83.)�jV����"Z��y;Ҽ�/�|;�IP��>m!JE�V���N8���W�(
-Dp¡���{�E�J��|��dXnײ�ʬ�������t[��؞@!-@�l
-�n�mj-d���G��*U�5�&��9�hvh��6�D�լ�Q7@
� � Az#�G�g�M�
���K��_
��U�Fʵ�0҉A��Q����2����!�b4<Q�gY,?�:U�����d���B�Q-[��T�{�����ܒ'.T��TNiE?Ͳe����3���B�T��[Q��F�����@1w�I����Ll��� 9S�#��U��"
 ?�E>���j
�,�L
��诗��/LT������V��f��iB�����5�Y��l�v�
rL� ]�k�`�[׷f��[�Q
�qR�G�;a3���I��
��G�ݷq\�n�ō�t�^B����Qe��z�z�BT��ܞ��8
-��}��٬���u����]ZV��,ZT�<�	�b�A��.=z�rrW
S��
TѹT�-���z�*����i����n�<��Z�UNe€�N� �r��X��g��b��Wۢ��v�/����wxE�P�,�C�����∻}A�c@�sx���S�[+�)��
-�����
��Ǹ��6٠����%t7�\�<i�?1ՃRLp�Ym���w�|W3R�3�[_���.��2s6������ϋ���e� �Ժ
�.�!�5�@���b  ȧ�9���E�8�
��oT�J�4�J����	7i�
�Q��	!#�W�.[� � )Z��_d��F7�cZ�G��̶�$��D)nv��ю�ڮ�
-Qw�>G�}���5�*����v2�Y��!ct׽Ö��į����#N�^��*�(*�d��ΣZD�Q���r��}�L�/������Y1�}p��3c����^��F�5�b�
wۀp�(
�� �	�@�4�;�
�ۀ�N�ۖfLu��}���:�cm
�wӈ��H��y
m��i
;��L�����
m<� 1�7y��@����<[�E��a����U�\桾W<<h(0/͹kRnCs?���lo�_���?�?~�|����> 5zJz9�AD �iu_�L�R�m	�K!#���1�K����Q�^��GJ-���6�e���I�U�Y�i
�I�[9�s�D���E8X�	P���
"Դ
�Y
�瘁^�F����t��^���o"v�݇���\����9�L8"
�2��dW)?1��A�>�2��P����l�
O�P��l^�su�Dž�Z���^q&FT{7<�,˫8����Z��?h�0ĩ�#���򱇄�Y���:[f�d-��2+6�
M��<��Ѽ=�Մ�Ne��|wxW����j����ڲ�zz���l�D Ul�]C���\53ԭ�n��H>/�3�L�����*��>%��b�l��h������ ��u-�5�D��b��i�)v%��qr��q#sݛ���;�+
����e�Yq��
\d`o�\׷a.ߛ��
-��y,��W�h�M��~o��
Ԁ�+�T���+YUX��ߜ��uH�� j�]9�(������f^�t� #����>}���5QK]�����r�K8T�)�����.�$���
#L<���g�c5Ѿ8�b�wx�o���
h
-endstream
-endobj
-15394 0 obj <<
-/Type /Page
-/Contents 15395 0 R
-/Resources 15393 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15258 0 R
-/Annots [ 15310 0 R 15311 0 R 15312 0 R 15313 0 R 15314 0 R 15315 0 R 15316 0 R 15317 0 R 15318 0 R 15344 0 R 15345 0 R 15346 0 R 15347 0 R 15348 0 R 15349 0 R 15350 0 R 15351 0 R 15352 0 R 15353 0 R 15354 0 R 15355 0 R 15356 0 R 15357 0 R 15358 0 R 15359 0 R 15360 0 R 15361 0 R 15362 0 R 15363 0 R 15364 0 R 15365 0 R 15366 0 R 15367 0 R 15368 0 R 15369 0 R 15370 0 R 15371 0 R 15372 0 R 15373 0 R 15374 0 R 15375 0 R 15376 0 R 15377 0 R 15378 0 R 15379 0 R 15380 0 R 15381 0 R 15382 0 R 15 [...]
->> endobj
-15310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 695.879 205.692 706.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 695.879 261.312 706.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0e607a3a4f75933f5770af4a1c435a2f) >>
->> endobj
-15312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 695.879 332.156 706.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-15313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 671.722 205.682 682.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-15314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 671.722 261.302 682.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a754588d1a8135cb2944e9cc0fd6ec486) >>
->> endobj
-15315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 671.722 330.462 682.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-15316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 647.565 205.692 658.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 647.565 261.312 658.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9df4749e0d54f9bb1ba38e2392697fa6) >>
->> endobj
-15318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 647.565 338.781 658.469]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-15344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 623.408 202.902 634.312]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-15345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 623.408 300.037 634.312]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7b71c85c9201eabfb945527532eaebb4) >>
->> endobj
-15346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 597.259 202.902 608.163]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-15347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 597.259 314.263 608.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a58ee2abcd4b191f32ff78c0e768b18b5) >>
->> endobj
-15348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.819 571.483 199.864 582.013]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad5999a9b4d00e7c079fb27a26b640188) >>
->> endobj
-15349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 547.326 161.677 557.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa6633280f8aef2c30ed25d9c59544c11) >>
->> endobj
-15350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 483.51 198.011 494.414]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6ef292d9fbb334ba7994b8d2b3a5e94f) >>
->> endobj
-15351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 459.727 205.752 470.257]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a05b872f147220805d2c4ee943a76ef13) >>
->> endobj
-15352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 459.727 276.595 470.257]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-15353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 435.57 236.745 446.101]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a60f11695efd1e26251b6f2463b989974) >>
->> endobj
-15354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 435.57 307.588 446.101]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-15355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 411.04 209.627 421.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae816bf5283bdc18773e7b188ef95df81) >>
->> endobj
-15356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 411.04 314.791 421.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-15357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 386.883 240.62 397.787]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9a99b2b76d216a907dcb515f5ef61cfd) >>
->> endobj
-15358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 386.883 345.785 397.787]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-15359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 362.726 212.377 373.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8fcc73a0fbbd549174fd99a848c3fa52) >>
->> endobj
-15360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 362.726 289.846 373.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-15361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 338.569 243.37 349.473]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_af32491e07197b3d96e0068b353e82211) >>
->> endobj
-15362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 338.569 320.839 349.473]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-15363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 314.412 216.252 325.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aec6ff4fd4b372a6635251b3129cadd42) >>
->> endobj
-15364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 314.412 328.042 325.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-15365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 290.256 247.246 301.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0c5d4cd9684f22f35f76212e54b6293a) >>
->> endobj
-15366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 290.256 359.035 301.159]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-15367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 266.472 193.577 277.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0ed96a7329312281236730beb476e4b1) >>
->> endobj
-15368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 266.472 232.581 277.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 253.347 248.845 263.252]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-15370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 231.357 193.577 241.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a12691e00b643410a6f401c55a2266adc) >>
->> endobj
-15371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 231.357 277.691 241.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 218.231 247.177 228.137]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-15373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 195.867 273.129 206.771]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab0a22c4feede666e4f5c3602d21b31ad) >>
->> endobj
-15374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 195.867 352.41 206.771]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 195.867 495.961 206.771]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 171.71 275.007 182.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aae1e3a3bf181638f33c685688c86e816) >>
->> endobj
-15377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 171.71 362.877 182.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 171.71 472.148 182.614]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-15379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 159.755 233.986 170.659]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-15380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 124.639 255.564 135.543]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9531e96c825c3a3ec880db64d5886bb9) >>
->> endobj
-15381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 98.49 223.465 109.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a778189ac90f9d76fcbf966965b27c791) >>
->> endobj
-15382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 98.49 326.158 109.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 217.109 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae21cdaa1460a54fb14ecb34f3ea30cb9) >>
->> endobj
-15384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 74.333 319.802 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15392 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15396 0 obj <<
-/D [15394 0 R /XYZ 89 770.89 null]
->> endobj
-15397 0 obj <<
-/D [15394 0 R /XYZ 90 638.799 null]
->> endobj
-15398 0 obj <<
-/D [15394 0 R /XYZ 90 612.649 null]
->> endobj
-15399 0 obj <<
-/D [15394 0 R /XYZ 90 562.343 null]
->> endobj
-15400 0 obj <<
-/D [15394 0 R /XYZ 90 140.03 null]
->> endobj
-15393 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15483 0 obj <<
-/Length 3428      
-/Filter /FlateDecode
->>
-stream
-x��\�����?]m ��-1�h�$M�&�ܶ���֮�ڒcɻ���;|�AY��Y]r��Ґ
g~� i<����W�\_��<`3���rv};Sxp����6��<
?]5c2DDIhe
��7ן}s�F�������+���
-��z��Ox���_�0b*�=���S��ٛ�\a�K����,�$׼���!��ȟ�<�K�Œa6/2����e�h�
-IP2�#���T
I
�D�6�-�7>�2UE�
�G,p���y��v�8/��/�������x���るy�6�GE���ܶ�쟇��Y
��[KPlc�`���9�k�z��$�$�����҂��bi�p	k���$)�ʹ��q��J��n��� �
�oc�&]��9t.�0@"����@�Z�����@RUD�
�Ī����R��s�P�%
-$ŒDB��
(^��K���&�v�V�����
�O�����quʓ�n���"^1[�"���nu#�?@���~�%i*�z�-����h����ţQ��z���)����)
-�h�U�מdH�,w0lO$�'�0�e��>���
��N��][�j�w�-�! ��l&�L
�bk��=��V�D�
��Q�@���T��K΃������ XIz��g at yQ��M���1�7Y�`� F�a#��`�F�,�km��<��g�?�
!,���y�Q5K6��C�G��^�~��
-��.n������3�ׂ2��It��l~�Lj ���#�/���֍�N�8:�>{{8�`v窫�^X94��4��I��8-V�1J���ͨ�c
�mP[/`�8����Ϋo�4�'iTd�W��>&K۳7�Ӏ3t�6�:L�n��/��ȉ�oQܿF���8B�=�?P�}���N�w�
�I'�a,'š�N���
-n�8�ձ�
/��
��������
����ct�
k�e��=qY� �
��#֖��D�
����}p���i�Q�B���$�hE�*�ۑa��q0�1�|��2M�
 cAȘRC@��
2M�2���-� �!F�p6^}O�L��(�h_E	�(fV,�g��(���‹��[v���L?kF~[�h
k�qk��˰�S> k!CAּ�;`�A.��X��~d~��1�%��7��@���9�����B�����;�O��<�o�������ǽʀ~(���p��΢?P��������'�cR��S	��hF��
���w����??��"&8��T'\��ƀl-��ٝ'�0]�\-	PV1y����JN!�TA mތ�`(���^५��e�
-- G����,l�!� zT��ϯ-r� �%3���jW!?�*�S��EFSL�Ƭ�bH
-:+9��A lb���
9���V���uճ�>��K���K���p{
k
��*�p��ls��ȶ��*0�:�`�f�ᢓ��\�|��苃�N�/X"
����OLR�}��vM@
��Ou*�Lx��y~B���7��BH��1E���c݅ѣ��pr���܅1�.w�c
wQ2�]0�[�
r�_
-�=�qE,z��(�
-�K��/B�/��/t����_�"82����2>�`�vcS��;1�m~�y��9�K�<4�E�:
-��|�
��6���{�
�L�E��3j;��'��H�>\D��=�a"z-��=vG��x���
�c<�ݝAxf��gX�ְ�#�]��a��
�Hr��$����1�I��h���{:O�}u'�;b�w���c�.o{�)>�&��~eC�#��,b�o:�PGp��Ǐ�CƄ�F4�}qy�
;�P�l��1�8T�s2�
J`6	�J=
?��m����dz�aL`���QO���}5
�:�n4�\����f�����}�&� b����=U�Y_u:��s��;�BYv^�f���0 �DخN�vu���4�N3\���nů�bE�˹�$�4^axwSM�����g�V]��	��
-G�L�j�x^��u�DC�S)���n~6*�?b�;|�B
�Sr	/�\�Q�	A
*�B,�!`�C۵!���o
��u � ������lʮ�@��'V���$A��
����N�/X�
�������c�u�门�O�&���N�q�{BN9�	9��-`��j8�7�����-`X?��r��s
�k���[�D���L5�н�=9�S;�9
-�z�֧�*ȇB1�A	sX��=j� ��XH$��=�p��C��"�uTz�� )Rc=�S�}�b���ͅˮ
-�
�dGwt����X�!����
g����}(����J��Ӯ�nԘ�u�?�
-{�M�j����J�KL7q��i׭���1M7�1g���5\�a��B�)
���У�O(�zaV�zs���ꂭ���'.��]�������x���i�
8��
R̟�{o�U�]�c.�p��ؘM����\�ٷ��Q|�*iQ�l	+��
-AE�.� ,{��\�7��	l����SA~�2�u�:��e�Ns�ԓ�)ՊUV˴��lh���b
�f��+"]�j���oF/�t�hA�'�S��=�*������0��񽭯
�.�P�� ��'�x��X��
���X���fڿ��=�!J�	��c�9��>��|��
U�C�j�8��{�P�
E���E �n}�ײ��xgݧ!��B�u:��*�/����~jRV���܌�pu�=~�f���t8���&�vwP9q�մÞt
�ݷ�~�����[���	:֗��F�*�i�E����c��p�w�t4@�W+��
-=j
-�D
\�yi5O�q�W�o	ZTW��ԁL0%�2)�h��(��/^+�f �C�6�z�:h1&��qa
�x��k��Cy�0��_��Sj(H��Z��?�}�vU��4�`��Cl2�nՂU+Zl�\t8�
�t��E 0�k{�W
-��Y�ˣ���6�\��Q�(����e�O�!�p��o�. 
y�q�� e>=�Z׼G��d x]�p��ŏ��؜�u��,��
D�[��:<���2��w� U�z(Ȇ���ÿF~]��¥'A(!!
-��*��ͥ���q��'�7f�R~Մ�!�l
Yj�4�x�,1�f���;����!!��f>��ά��&�@���Y1��T����ϝE}p`0w�:�ivL��3�u?°B���Q��<ñ�c�̶}����0
����R{��W������;VcP�C�	�Sgh����(�l��4� V�����Wa����˲�{���=��%�����߲��
�7� ��h̼�K��~�����<>�A��
��
��2`�X����"A&!B�:a
�ĥAY��[��7��A�SWpe
ۢ8|�����.��;�z�@�
-Ҥ� n��q�
�_����gs����ѻ
-endstream
-endobj
-15482 0 obj <<
-/Type /Page
-/Contents 15483 0 R
-/Resources 15481 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15258 0 R
-/Annots [ 15385 0 R 15386 0 R 15387 0 R 15388 0 R 15389 0 R 15390 0 R 15391 0 R 15420 0 R 15421 0 R 15422 0 R 15423 0 R 15424 0 R 15425 0 R 15426 0 R 15427 0 R 15428 0 R 15429 0 R 15430 0 R 15431 0 R 15432 0 R 15433 0 R 15434 0 R 15435 0 R 15436 0 R 15437 0 R 15438 0 R 15439 0 R 15440 0 R 15441 0 R 15442 0 R 15443 0 R 15444 0 R 15445 0 R 15446 0 R 15447 0 R 15448 0 R 15449 0 R 15450 0 R 15451 0 R 15485 0 R 15452 0 R 15453 0 R 15454 0 R 15455 0 R 15456 0 R 15457 0 R 15486 0 R 15458 0 R 15 [...]
->> endobj
-15385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 686.155 271.126 697.059]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae86262d281c712780a1fd78570080d6f) >>
->> endobj
-15386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.463 686.155 373.819 697.059]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.863 673.643 326.259 683.548]
-/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
->> endobj
-15388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 651.518 198.26 662.421]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_af98f757db804a7f7c7f0ca1b36198f9b) >>
->> endobj
-15389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 651.518 236.665 662.421]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 651.518 353.317 662.421]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 639.936 246.458 650.466]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-15420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.306 627.05 269.939 636.955]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-15421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 604.925 212.768 615.829]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acf126b6efb5eac0ac1b9228cfca539f4) >>
->> endobj
-15422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 604.925 252.959 615.829]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 604.925 375.145 615.829]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 593.343 286 603.874]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-15425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.401 580.457 277.928 590.362]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-15426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 558.332 250.099 569.236]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1958a70ab97d5ef79b472c38cea304cb) >>
->> endobj
-15427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 558.332 289.446 569.236]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 558.332 379.512 569.236]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-15429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 558.332 513.996 569.236]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 546.377 416.369 557.281]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-15431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.304 532.655 439.335 544.82]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 511.739 261.881 522.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7378d4cf77114743152ad5396a1b7db9) >>
->> endobj
-15433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 511.739 300.286 522.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 511.739 388.504 522.643]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-15435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 511.739 520.199 522.643]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 499.784 416.369 510.688]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-15437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.87 486.063 449.708 498.228]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 465.146 250.748 476.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a385074bda19450e4b4aba954520ae28b) >>
->> endobj
-15439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 465.146 357.317 476.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 465.146 456.145 476.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-15441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 453.191 202.344 464.095]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.005 440.679 446.071 451.635]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 418.554 261.881 429.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_adfb4df5b07b3587b3d723514dede020c) >>
->> endobj
-15444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 418.554 365.272 429.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 418.554 460.793 429.458]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-15446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 406.599 202.344 417.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.222 394.086 466.67 405.042]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 371.961 239.984 382.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_abe381af245a3eb59deda1dd8d0743c44) >>
->> endobj
-15449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 371.961 280.82 382.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 371.961 405.104 382.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 371.961 513.996 382.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 360.006 171.361 370.91]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 360.006 478.077 370.91]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-15453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 346.284 432.092 359.442]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-15454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 324.165 251.209 335.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a76fee04931b37e764744156fdc08d84a) >>
->> endobj
-15455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 324.165 290.549 335.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 324.165 409.969 335.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 324.165 513.996 335.069]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 312.21 171.361 323.114]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-15458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 312.21 478.077 323.114]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-15459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 298.489 456.992 311.647]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-15460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 276.37 224.57 287.274]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa6540753b860549e4d4be346d7cd0229) >>
->> endobj
-15461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 276.37 327.264 287.274]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 263.857 347.869 273.763]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-15463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 252.691 196.297 263.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab061759f73cfae4553fa240e8b5e24de) >>
->> endobj
-15464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.439 252.691 279.215 263.595]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.718 252.691 432.878 263.595]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-15466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.827 252.691 513.996 263.595]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-15487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 240.736 216.491 251.64]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-15467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.094 240.736 362.977 251.64]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-15468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.254 240.736 475.081 251.64]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-15469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 216.268 164.537 226.174]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-15470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 205.102 212.377 216.006]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a99f8aab5b33871c9652a9f70407b30ca) >>
->> endobj
-15471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.509 158.509 264.133 169.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ac5f23b096482951cc440f5fe9938c8b7) >>
->> endobj
-15472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.29 158.509 367.646 169.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.92 134.042 413.759 143.947]
-/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
->> endobj
-15474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 99.961 248.929 110.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1857e944bbc4d95b76cb564c647c6fa5) >>
->> endobj
-15475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.267 99.961 351.623 110.865]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.801 87.449 367.562 97.354]
-/A << /S /GoTo /D (index_pps_certificate_widening) >>
->> endobj
-15480 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15484 0 obj <<
-/D [15482 0 R /XYZ 89 770.89 null]
->> endobj
-15481 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F66 3179 0 R /F42 531 0 R /F67 3037 0 R /F38 3426 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15536 0 obj <<
-/Length 2342      
-/Filter /FlateDecode
->>
-stream
-x��Zms���_�O-5s� HO���'M/
��&ӹ�hh�����BRv��x�(��}�5��@��>�X;�v�:����ŕ��>��ەbG�q���;�`$��9���3�ݨH����b7�<��e��$wET<]^��IV�qe��W
�n�~���⊐�dԣ�q������t����
�7_��#��0�

��&*��9�ؽ��ԍ��&�b}�m���	�8[�-P� ���}y{���a�C��8��H�����%�����
�QuJ
F=��87gߝa����f��
A��*����;L�x��U�gf�:�t����4�e�z���ҾH�8+�=}��zϿka7^T���f��ʭ�W>n
��s�#1�)�W���{���_�9�ι�S
�|Fy
&���Q��'ss`
��m\D �_��}�9^����1���#���nB�	@7>S���g�9'�Lh��ZU ��
�a
'�0#܍j�K�5���5jȐ�E�{�=��Ջ!�S�NJݩ+���Ol�([
D8�ú���0��
���:�r�I���mT%w�X�����!��Z�<(�� ��[��V��߬�z����'���=���#
�J���q�fE�}=0"�
h����_d�'�H`��P���S�4�c���CLl����(}:d�K�Ua�]�|
�Ȱ� =������s
M��l "��rR�_]G���%)XNU��Lʟ$���~��	�s�.�3O�
��?��2��Ҏ��QL3诈F>^3��<
���l�:��w���t��� [���?>Y	�<|��L�{�9�r���y�����!�=��o�n
�m9dr��$���L��T�A��c6�ȫ�5n�0D�����r^�
j^C��x�2�[�n�z��e����2�I�>_.�A^����
�К��Xf2��7�oD.�u��_�h�x0����[΀�"�mp���,��`F�dn9
-4�Ȭ�-J0e##u
-��vM���p�x�G�{y��d@�>�<�.�y|m y��'�DZ_��Ã[�?��?
��q��Rn>�(�{����_^K��_e+�j�˛�T�9�}�S�_(�z�C����"(�/�m��v�"0
�x����F������l
�sd�7���G�'e�>Wr�RB>`M/@"��m�h�]�ؗCp�མ
S�Iz$��̂B�/�PA���%�V�i.!� ��{L�
�}?#��Q�D�����{�����9�{�!�^�f�s�r/06�����݄����ޱ������:.&�9!�N�A3ˋ�؍�l��Ѹl��z���d	�3��w��M�bHo��DZZ�=��GD8i�lK���=1�;���
��ߣ�t�j�E�D��-��@3�*&`u���ݴ�M7���Dz9,����
-����Zx�r��e�N�5T�~h��[,-��Ivtԏ��V/C_��Z~k�Q	�/[�A��q:�t(~�uC�.�j\���3��ךE���w�!
-�zcz��o��:���O
-Cf�<�d� Aa�P�� J
(��xSs������7��1cxu�hC-�zNԻ���]�A9�O2���0/�x�
I�0p a]2�k
� N��A������
A܄��G�`f�sSA���������̈́����9#��s�aMw��>b^����GvS�����H��e*9� 
- bǙ
?ծ���ɓt�
c�ȆǠ}X./Z�|
�E��a���
�_��� �4��
�"�ý��Φ��
]�!���m,S���z�’���Z�
���A}s�
(m,/l= 7�ֹ�
�%ڳ~_q���
0���r at q �
�������|�<�
�)�2�'�X��z)e�N �55��'y�>��`�ăQ92kjR �
,7/��!g�aO��$��Z�5,x�~�39�T�)��ܥ��ʥ��J��2YB��C�ʼ��S&5SN;��8`��
?����%��a�Gcv��:_���KxW�|=����	�.��ُ�}T�����Ϳo�$r
>�R1���]o�4��O�2l^�G݌�A��Sk	���a9�����u�����>�횸5� ����؞���Ƙ�R�r��P)��p�/C���N��W��%��=�(ˆ")bQ���=��
��{�>�ѨH>�?BPG
��N�S��w>ŝѸ��|٧�I�~��>S��
�	e��ǭ��ot�_e\�yƹ[�ϓ��-�j;�ӓ���n��V�q��Ml��Z��8����4��1�ym�uUm//.�v�e�ݣ��ޭ��u�oMͻ+["Ns��L2��FM�4i��1A�O�&@�?��!���n���Es����|����/��
�נ�
-endstream
-endobj
-15535 0 obj <<
-/Type /Page
-/Contents 15536 0 R
-/Resources 15534 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15258 0 R
-/Annots [ 15477 0 R 15478 0 R 15479 0 R 15502 0 R 15503 0 R 15504 0 R 15505 0 R 15506 0 R 15507 0 R 15508 0 R 15509 0 R 15510 0 R 15511 0 R 15512 0 R 15513 0 R 15514 0 R 15515 0 R 15516 0 R 15517 0 R 15518 0 R 15519 0 R 15520 0 R 15521 0 R 15522 0 R 15523 0 R 15524 0 R 15525 0 R 15526 0 R 15527 0 R 15528 0 R 15529 0 R 15533 0 R ]
->> endobj
-15477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 687.541 200.451 698.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.191 687.541 251.997 698.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad44e727022551209ba94ec652b950b8e) >>
->> endobj
-15479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.334 687.541 354.691 698.445]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 651.685 200.451 662.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.191 651.685 251.997 662.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aed261a7f093a3ea4eb8cc2ba5eea3732) >>
->> endobj
-15504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.334 651.685 354.691 662.589]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 616.825 180.198 627.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acda879ffdc222a06c9af2f820ac02c5a) >>
->> endobj
-15506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 616.825 259.37 627.729]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 592.924 289.866 603.828]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a41c7ca1b6cc1f391be10cd4ab3396de1) >>
->> endobj
-15508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 592.924 359.324 603.828]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 558.065 290.971 568.968]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab363ed895c854b9e8cb40960a2fc87ce) >>
->> endobj
-15510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 558.065 360.43 568.968]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 523.205 224.003 534.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3ecaca69acbfe46c80b475d99757138a) >>
->> endobj
-15512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 523.205 326.696 534.109]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 500.295 254.15 511.199]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3ac791813ad39c9adfb99a365636d1f7) >>
->> endobj
-15514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 500.295 338.263 511.199]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 477.386 284.585 488.29]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8d79ac97835780e6ca5e2022abf5ab0b) >>
->> endobj
-15516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 477.386 354.044 488.29]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 442.522 241.726 453.426]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afc2f9c2b16ce6601be8b0b685c0c11e1) >>
->> endobj
-15518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 419.612 249.318 430.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a87bccf995617f2884fa2fe2f99479e5e) >>
->> endobj
-15519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 419.612 288.321 430.516]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 419.612 371.519 430.516]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 396.703 240.62 407.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_affd60938da7b4567564d56fc29d5cedb) >>
->> endobj
-15522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 396.703 324.734 407.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-15523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 396.703 389.5 407.607]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 330.343 203.075 341.247]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-15525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 330.343 296.324 341.247]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afed62d6b4c6cd06a08a49942907135bb) >>
->> endobj
-15526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.434 224.259 300.077 235.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acc7b416e3bc54353d05447fa4cfca8a1) >>
->> endobj
-15527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.729 173.454 251.371 184.358]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad03499176ca7a20224e1be9c0bc7a8df) >>
->> endobj
-15528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.434 122.65 300.077 133.554]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acc7b416e3bc54353d05447fa4cfca8a1) >>
->> endobj
-15529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.729 86.288 251.371 97.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad03499176ca7a20224e1be9c0bc7a8df) >>
->> endobj
-15533 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15537 0 obj <<
-/D [15535 0 R /XYZ 89 770.89 null]
->> endobj
-15538 0 obj <<
-/D [15535 0 R /XYZ 90 702.119 null]
->> endobj
-15539 0 obj <<
-/D [15535 0 R /XYZ 90 678.407 null]
->> endobj
-15540 0 obj <<
-/D [15535 0 R /XYZ 90 631.592 null]
->> endobj
-15541 0 obj <<
-/D [15535 0 R /XYZ 90 607.691 null]
->> endobj
-15542 0 obj <<
-/D [15535 0 R /XYZ 90 572.831 null]
->> endobj
-15543 0 obj <<
-/D [15535 0 R /XYZ 90 348.752 null]
->> endobj
-15544 0 obj <<
-/D [15535 0 R /XYZ 90 348.752 null]
->> endobj
-15545 0 obj <<
-/D [15535 0 R /XYZ 90 280.485 null]
->> endobj
-15534 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F39 2320 0 R /F90 758 0 R /F67 3037 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15592 0 obj <<
-/Length 2086      
-/Filter /FlateDecode
->>
-stream
-x��Z�n�F}�W�ɥ�h���Qh�4�-uk}H���K�E�]��YryY���D	�O����ٙ9sf���u��WG�/�N�S,0�H*�������		�����<���I���0����ח/__^�gG//�n�<���t0[
��s��C�3:�/�N��G�
a�
��$qG'�%�L�DH��[JE�x=����Q��9qijm�x��DEl'�|�Lg
U�s]���I�Hh�Hz��$Zœ)8<�xy�#S0$��|��lw4�
-Il�)��Q
�gBq�.�n[֘����o���7���	�a�y�w��b�����eR����y:�"��s��aC0o��A<�M�3���̭9<1����s��ٰ	�ވ!+�k#|�>خ}4R��
�S�U�0�P#%/��j���� �N]�_�GٺVw��
D4��P
�BpQZ�_�>1F5R
z��`��X�D����)ᠾ��t]�OO�h���H
-�'V����S�	�k�w�c��[VT�������"��i2���w�Z��qKR��j��Y&q��ˢ�XˍE;�n�&�����8{V]�?�

K����G��DC�uj�“����Nn���x�,5�'L��:�gN�"�/8R�Aw�I�%�.%v!
.0���f{b&
��g���2Y�I�)�j�6(k �܈�la
�i8B���aT"L}��
�IN��#D���T���F3C�q������.�������0�
)����}�Q2�.��桺�
�����j��30Zu�9�M�#'(�'2؛j��&MOW�ƍc\��w.�E����5���C��[�}��ij�8
�a
��
-��=�֏�WyS���~n�2��ך�U���
J@,�ܤ�
�d�
-#ʲ<��\A�2 at P }D��J�ٻ�^јޙ�e�:e�.�
� $�"���:� �J��8�����q
0���S�P�v
-o�Jiq �
\I�~1�Qo��m}7���)�RV!�Xg��	v��V
-��C0tY�bh����t��� ;�Y�i�ɂ�������:����p(�_T�bb9��M�8�*� H�n�%;�vk�ɤIןT�Rm�e��Φb�ٔ����t������m�-�iڣC�n�*�p�^�$�
���-7�� �o��R�.���V�ا	X�iL[
�1�_$dz�����`N�n�A#j1Nx�6&$�ʗ�I��**���N��#Z&��1��fi��gl�DԺ��)�`�8���@U,�W3�|ү��V泿]�_�xy�˄�p�9���d�����0c�Ð'�"Qaeڟ���; PKc	
`	�*ž�OT8/u�lg����d��"�W�WW1�!	�~��-f=�ÄWrm�j��g1p�M-�,^��e��[$�>H��
-�߶0]�z�W�L�@�-i�Qq���2˖�M�^;���(_E�?�\#�nJ4��}����7^}�Q~��i@(I�R����2B�+C�OH�̨��`�0��<~Z^�Q>�����ҧ��cU��
6�P��~�鵆5ƽ
�J���_�ȡ��n_|l�
9�x1��U�Ch�PsY>�n>l����:=P�%�2��Z�t]r8����^���+{�D������FT���h�'��zˉ�Ͻ�� ȇظ���U��zy��z�f7��ɛ�p��y�+�ݧk�s�O��a3i�\�u��]kx^m�
��d�a� ֶ�Z���\"�v���[Bj	
��Y'�m
!���'-�ӭ<��@��#���TV�X���-ő�|Kzki��;{��ɾ2�f���2+�kKg�.Q���u�P���	�r{��^j���$�����Ve9d����Ne��(�bj��۶��1���y��g�Ȇ�/hp4�
�
2j�r�*[�+[^�9��6@��M��>Kgw���(i껛zJ
-4��~�ٙ�!L���-,��R�|ؽ.�s܍��W,8KAX+n
-�����N�Q8
�zQ����}
�_M�]���(�++KW��c
%െ���g
X4�l�Ë8v����Q��*�t� ���Ң(�ӓ���k�k4KW�SJ;٘�a��Pf��qͮpsUz�/�����An
-endstream
-endobj
-15591 0 obj <<
-/Type /Page
-/Contents 15592 0 R
-/Resources 15590 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15258 0 R
-/Annots [ 15530 0 R 15531 0 R 15532 0 R 15554 0 R 15555 0 R 15556 0 R 15557 0 R 15558 0 R 15559 0 R 15560 0 R 15561 0 R 15562 0 R 15563 0 R 15564 0 R 15565 0 R 15566 0 R 15567 0 R 15568 0 R 15569 0 R 15570 0 R 15571 0 R 15572 0 R 15573 0 R 15574 0 R 15575 0 R 15576 0 R 15577 0 R 15578 0 R 15579 0 R 15580 0 R 15581 0 R 15582 0 R 15583 0 R 15584 0 R 15585 0 R 15586 0 R 15587 0 R 15589 0 R ]
->> endobj
-15530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 696.002 156.281 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab617c0a1051fd344e4d44fa5f5415b1f) >>
->> endobj
-15531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 696.002 235.453 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.396 696.002 372.753 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 642.219 189.267 652.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 629.288 198.092 640.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.069 629.288 282.49 640.192]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a44499a9c2e1c360ce6757ec020786e36) >>
->> endobj
-15557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 598.439 212.978 609.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad7e1698be31b1b95dc7e28d13ec162d5) >>
->> endobj
-15558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.12 598.439 313.062 609.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.103 598.439 433.459 609.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.108 598.439 515.051 609.343]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.807 555.635 177.061 566.539]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 543.68 189.267 554.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.768 543.68 218.021 554.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.76 543.68 330.3 554.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a17e25309469009012f40ed891a2c3f01) >>
->> endobj
-15565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.145 543.68 378.399 554.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.957 543.68 441.211 554.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 500.877 213.576 511.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3f4e612db0eea52c329f5a6be95197b9) >>
->> endobj
-15568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.913 500.877 261.167 511.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.881 500.877 383.238 511.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.484 500.877 411.738 511.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 458.073 213.576 468.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2fa8e500a9e53318599462001f751c89) >>
->> endobj
-15572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.872 458.073 388.229 468.977]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 415.269 213.576 426.173]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2fa8e500a9e53318599462001f751c89) >>
->> endobj
-15574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.872 415.269 388.229 426.173]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.74 388.886 215.202 399.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8bef907491da530ce94e52f830e84f2c) >>
->> endobj
-15576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.791 388.886 305.347 399.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.345 388.886 432.702 399.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.575 388.886 502.131 399.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 350.547 156.281 361.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab617c0a1051fd344e4d44fa5f5415b1f) >>
->> endobj
-15580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 350.547 235.453 361.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.396 350.547 372.753 361.451]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 313.185 189.267 323.113]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 300.254 198.092 311.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.069 300.254 282.49 311.158]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a44499a9c2e1c360ce6757ec020786e36) >>
->> endobj
-15585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.039 130.001 219.763 140.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.273 130.001 307.952 140.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.463 130.001 336.366 140.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15589 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15593 0 obj <<
-/D [15591 0 R /XYZ 89 770.89 null]
->> endobj
-15594 0 obj <<
-/D [15591 0 R /XYZ 90 617.176 null]
->> endobj
-15595 0 obj <<
-/D [15591 0 R /XYZ 90 519.613 null]
->> endobj
-15596 0 obj <<
-/D [15591 0 R /XYZ 90 260.401 null]
->> endobj
-15597 0 obj <<
-/D [15591 0 R /XYZ 90 260.401 null]
->> endobj
-15598 0 obj <<
-/D [15591 0 R /XYZ 90 208.377 null]
->> endobj
-15599 0 obj <<
-/D [15591 0 R /XYZ 90 101.245 null]
->> endobj
-15259 0 obj <<
-/D [15591 0 R /XYZ 90 77.486 null]
->> endobj
-15600 0 obj <<
-/D [15591 0 R /XYZ 90 77.486 null]
->> endobj
-15590 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F90 758 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15609 0 obj <<
-/Length 2374      
-/Filter /FlateDecode
->>
-stream
-x��Zms���_�O�4S�x'鴝I
_z�%q�J��ˍ��(��D*�;��, ��"%Y���L>�������� 1��Y8X]�`u
�/&��W.s|�K*�����r		O3�ݐ`���1��F�t
<܍(
&��e8K��7�c�O�צ9��m��}�'�F�'__�"�6eq�*z���.�>0>e~����v�&�E
�b�yT��*�nGc*�p2��0\oVA����<LG�����Gɐ�D	
�N���1�����z��=vf��5�����AwZ;�2������ĺ�=Ȱ}O�*�#�H���Ps���$�~�d���e��i��Z�u9Ur$	9�TFd97��c�݃V54h7d̨DR2g
����
�sR	�����54
7��#������-#���%�g�:��Q?�)+ls��#VA?V����Xe� ��
�
~���_bV��
�Q��'�,R���T�+Ƈ��Mu�q�U(�m��W����=f��e��0�5�p�
-A��M���'J���3[Efa�����߾�����ۖ9a��攴�(�E�wQ����}�4H���(�g����fM�L�*Y�ꕬ

ɐ�`2�����]���$��.�FT
1T6�
-�Y�Ѧ�$5W�����dY�.<00�K9 �~5p��w�I�h�j)���`g�gc�|_�q�
�+��e���pk�k^[�c�ּT�@2�<�� �b@�З����;��J����
�&JY�A[�%8��<M�w뇱�1���
f-�;�y��(�/S��>�@Ե��,sh�֏a��dn���ڳ�#�<�Y�
��`����a�l�x��dSC�g�= �D�|t�
-$
-O�	Ծ%j�
-r9F[�C�(R9֔ 1�vk�/T�
�uE�7�4�	c�H��
1i;�4��ȸ�6Ӳ
�!��\�
U�� C���|�t�H��*�GX^ �hv. '�G;=�������R9<
J�S�Y�`��1Z���{(�J_���})�8iK�=(
�q�F
nͼav�W�&������T�-r�T�=�S��b3�1@�z��� P,�b�Ͽ����o��������3�q�8;�̝)��c��;�΢�!�i�Q3]>Zҝ��0�,H
�����9C%�z�a���n�r��q��������ַ�*��T%P���c ���
P�cQ����}���B ���h��Q
��`
-+Sᦎ���
�����
>'6�rOv+A��."V��J}ZQA ���dkB:x�ѣ�:f�@�)�4.����v%�',+��n�x�q��B�G�ף1#�ķ��U��\qN1�vV��ev�W�͢�ϻx��7�o�]:
�Rg�\���iI��4Y�hL�����l)���v��&a>���T%
J�M�_�߻D]2Om��~�O�T��|�8�
-
8���P�����b��n�D�m�Y�M^4�
"��}�'���܉%Rr�#�z�h0!�{^?�#�!ՙ�sô��p
-/S�
�u�J����:Xu��1�j/���"I�l��V(=
fg�
-I=�O��/��
�B�XX��s����>s��!o,��2��A�qRu׹�P:m�l�O @U�Ή	��~g�+I��
���Ǎ�y�
����sSh�"&�у�M���p����L�J�����ĭ�倌��E�ꡠ1[����(��V��6tT����dpS)a:2���
�2���U�.�E���-�9�G���Qlk�NmV�PE�_[�M�٤��X�9�qI�"�T*~

�7ZKx��m3s�ī's����Y�L

�γ�\�D7С��4�SS{[�&�o�Cַ�j�
��&'*꟪�λʳ����p��s)�8�}���%ꔑB�J���YdBp¤��S��
�hM-5���V>��dyv�r��� !����d�w�rPo���"�b�w�-R.Ө
|u�>U�r�]݈ �B�>1v��K��1�01.���	��ȷɪ�H����'F��w�����>y�z�� ������D�YM�nV��2�Й�� ɅCх���m6��^��"[>�i:�B%\�N1G
�m����
IP�@ƀ��{�@{�CQ�l�&��
t(�ss5�n���2+/�G`��
j^/	L��ߡ&��U�m
��i�6�j�G�Y�b�Z�}�q>�Q�GL^�����T����&/�ٖE��@Q�Rv������R�|?*C�7�e��ޘ��a�Wu��ǐo�xW"U&흔�UŃ�)�}�Li���)��=�x�T!*PQV��,�\_]=�[X�hj�,�J�f�_�F�'��4,j	hTES/�T	(%R����_���Ou���~Y|�7\�^3��
����w��_?
-endstream
-endobj
-15608 0 obj <<
-/Type /Page
-/Contents 15609 0 R
-/Resources 15607 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15619 0 R
-/Annots [ 15588 0 R 15606 0 R ]
->> endobj
-15588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.68 661.939 333.036 672.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15606 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15610 0 obj <<
-/D [15608 0 R /XYZ 89 770.89 null]
->> endobj
-15611 0 obj <<
-/D [15608 0 R /XYZ 90 646.048 null]
->> endobj
-15260 0 obj <<
-/D [15608 0 R /XYZ 90 587.07 null]
->> endobj
-15612 0 obj <<
-/D [15608 0 R /XYZ 90 582.586 null]
->> endobj
-15261 0 obj <<
-/D [15608 0 R /XYZ 240.245 501.32 null]
->> endobj
-15613 0 obj <<
-/D [15608 0 R /XYZ 90 494.68 null]
->> endobj
-15614 0 obj <<
-/D [15608 0 R /XYZ 90 414.151 null]
->> endobj
-15262 0 obj <<
-/D [15608 0 R /XYZ 90 367.127 null]
->> endobj
-15615 0 obj <<
-/D [15608 0 R /XYZ 90 362.644 null]
->> endobj
-15616 0 obj <<
-/D [15608 0 R /XYZ 90 238.423 null]
->> endobj
-15617 0 obj <<
-/D [15608 0 R /XYZ 90 172.38 null]
->> endobj
-15263 0 obj <<
-/D [15608 0 R /XYZ 90 81.969 null]
->> endobj
-15618 0 obj <<
-/D [15608 0 R /XYZ 90 77.486 null]
->> endobj
-15607 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15623 0 obj <<
-/Length 2279      
-/Filter /FlateDecode
->>
-stream
-x��Zmo�6��_�OWX3|�k������q�+��@k+��lɵ��Ϳ�������

-�'��p8C>
#*������E�~?]����@R��
� {>���k��N>�~�T�z��w7��ٝn]�F��4a�X�ʛ�G�?`o�?��,P�'#��8e�]yw��Gر�X:\�A�ؑ	F~�(�)���h�Y�y�-�x
RuO�G����o����G>��M���h2�B�o�g
:%G����߬�3�` #�D�N
��ux;�x���
��6�܆ۧ�K[
'y兌��)�BE�c���^�,�vdʨDR2o
-��8��$������,�=>萫
�-{���Ly ��4����K�R���ʙ�	Q�4��G���K9#~CD!�WK�y|յ�>b���J{��8��Z�Y֥�㘕=�DŽ���H�j�]�8S�a��H��������w?ݾ��כٯ
N�h�%)t��Q�K��q����C�6�#E+g_u��H�j��G�7�x
�FWc.^˦�)�0�BB������~���y�[�gSbh�N�(�c��]Yx(�$��$󲳅C� �0L���5
cf8���(2�Ae��V*.��8[^o����m�`�A�j#�P��!�%�B6�ߏ�1*ͺ��	�B
Ɖkq'�U1�"���K�y�l5�f�M?��0� ��D(�&�*�c%4�wYnKi�z��]V�
W�t
S��J�a!�H�7IM
[�ϣh�;�D��7�i���
R�Q�?3��,rq����R0ۄ󢸈�Q��i�(�u:��P�R��2��4���1e���<�5��]W_��y>׭�Q��O[P�O��� [...]
���2"�9�
3*x�Wif�����[j�
�]%Y��CM��/ Z�
�wX���Tb,����-�$�`�
9" r��@����
V�D�c�w�I��k�T�o
꘿*���;���J'��<f';�
-P)
f'k�
�_^VT 0�`
��H6�����p�
8����8H/��ono�s2�N��0����epb�����Fݭ���n�ձ����.��$�Bc�&����(Y���v;�B�\{�N1G
-2��/ 6�� c
��q�	ý����
������4��~�q�25��I��'�����Ը�#�
��j�����_������W��`[t65��T��L��j�) &�@e����a��9:�)\�k�r���|�½|
- _�|�`�ɧL!<"LZTI�C��{;>�O��):�S.�"��7H}��$T( ��m��P
[�rq�>���N$
w2(IB�ɠȠ�A��n�������Y��w2&o���E􆂖�%C�7Iˈ���T���"���쁚��E-XQ
P�(+�"5ڦ�ɔV�J��A'�,N'��j��S�E����{Q�X��Y����s��5�,�	8ߔ�u��B
1_T��kߙft^�
3fM}u��t��� *���\�Sp��r
�C�Gɩ
Ù&u��i�̒���0�,w��0X���$�
�
�np�b�J�_�s�s���q
����;��䠷��5�
E}��H�
-�`
�R�1z6k0�w%i�wg�x�œ�=0�L���kֿq@�Ȱ��
�)�A�.e�$e ٞ'>Q�n��D�=���
�.趮�4��=���dF`
-�� �� �%:�u�~ ��n�bu���u�����ދ���^��{/�Tu�7��e������p�	Y�}�<uM���8 І���(��R���|$�aMi��(�i/�B����گ�R�$@�D�)Y���IZ⣸�k��"
S{4�B�'����-:%��A�`›�	mg�`��$H*AZ$�\$F�%H�ֆ�S�	)�Sۯ_�XϧB�jnY����OUl�e�~���M��Y٫-�����8�uqOȸ�3t�^5�z)��E�+�$|2��ep�&M'�9r"%Va�Ҳ2�
s�=ӌλ�cFE�t��-���l'@�
�� .��lP��W����,�Y�
��EC�,'�ۻҁDJ��s����(�E�);�
z��N��f��b��R��,�ƲOQq�fͼ���V7}�Za��p#��^zE8U���۷��Km��1.���0ٕ�H�����đ����N���-8��]������dd
{GBT��c�o./.>�Y�,�/S��3�|�?S��U�	0Z�K�:)i?���m�@
-endstream
-endobj
-15622 0 obj <<
-/Type /Page
-/Contents 15623 0 R
-/Resources 15621 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15619 0 R
-/Annots [ 15620 0 R ]
->> endobj
-15620 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15624 0 obj <<
-/D [15622 0 R /XYZ 89 770.89 null]
->> endobj
-15625 0 obj <<
-/D [15622 0 R /XYZ 90 604.514 null]
->> endobj
-15626 0 obj <<
-/D [15622 0 R /XYZ 90 538.471 null]
->> endobj
-15264 0 obj <<
-/D [15622 0 R /XYZ 90 491.846 null]
->> endobj
-15627 0 obj <<
-/D [15622 0 R /XYZ 90 487.363 null]
->> endobj
-15628 0 obj <<
-/D [15622 0 R /XYZ 90 375.097 null]
->> endobj
-15629 0 obj <<
-/D [15622 0 R /XYZ 90 309.054 null]
->> endobj
-15265 0 obj <<
-/D [15622 0 R /XYZ 90 262.429 null]
->> endobj
-15630 0 obj <<
-/D [15622 0 R /XYZ 90 257.946 null]
->> endobj
-15631 0 obj <<
-/D [15622 0 R /XYZ 90 133.725 null]
->> endobj
-15621 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15635 0 obj <<
-/Length 2455      
-/Filter /FlateDecode
->>
-stream
-x��[mo���_�O�
���
��o�^w{�
�]��$jm�'ɻɿ��Dɢ-Y���
149��<��<�b����_/^�..���HK*�ٝ��p�����g�`�ɔ`���	�~��›�	�~�|z�Yx�!������ꎓ"�
-;�L�e�1�2���
!��(��� T)��S5��֧L�#�?��u�	Ǎ�ż^�y>�R���DS?Z��aU=�DwQ6!ʏ�9tE��53B/��.~�  {��*���W��`o�?y1��o堕�)����t�
lw�y"*L�<�/@�Vi���
C
-�J����h]�i��
-��[�Z�,��<�H���%Ծ-�/-�=� )��Nc��dG*�'ٕh��$���#
-�\��"�%�r��'F��“:���5y���ZF�}�peل
?�*/�y�b�ec�F j�}�qDdp�>ن
��c��!K'T��8'���]�,
����ùm.�U�������
I�l!�NI}&Ӽ�N!As��	>�?Z�;K���x�YU��e�h��VljV�+�a��� -j'����ӈ�30�{z�DJ�'�,���'#
�j�[�Q�l�(�{u��$�ڹ�
�
-x3�xZGI�*�H����kR�W_ps#�_7Ɛ�|H7ݭ[�b<@�
�NF�� </�Z,S�Nj�eQK��L!���S��C��m(��Ϋ��M�o�N$\���f�����)�̟C�,:ւۛ�
���|z�]X�pGqz��tmN���M)�������
- at pj t���0�:F�N��c\<�T�N��)��ȋ
��˙�]
�
����.�؛f����כ�?����_�g�v�>�&Z>"]A� �u���q���q��Ivv�ĔBҡ\�"��u�&^.l�V�u����%�ʟ�Mݸs��.�gn�Q��`J��ūu��V�"�0S̳�b�ԏ�+I�v`O���.N�[n��VWC�P.�8��{g`
K��"���I�vB�^g)�Űh�t�5����Ua��v/���e��
�M
�Y=kh��и�_�ih���W���~�Z; ��ꚤ²j..\�I��?�Z;�p
����`� ;>��.�L�3��'6,�؎DnP�$��H(�\`�S,")t����IJ�4&�
�N8Y���'��&�;��Gw�m���D"r���� �jL��+��Qe
5
-̈@��(�N /���ĝ�R7��*�
�:&�
����V����I�E��s�����
���s���%\qĔ�(�P�H��,�^@fy��`�dD��%�
��K� Z�͔�h_͔�xS��צJ�%U�H`�/谙��ke:�n��c�I+��J ��JvR%F�]:�R%�סJ̯�b�y	��nmi�>�*9�k��GP�
�L�#s�*��d̥J�KR%<�J8�Ԥ���ؒ
��'&�*���k��2�Bq,��}B��Oj��?j��{�

8D�z�I:L�hA���b����K��z��o(�W�c�M��H�^���h��t`�D����qp�{�A�Wi:a�
v�)P�rpH�k�V�
l�(���)J"cvI���)�K��-�B��Q�M#�Rb��%N�r�3$�
;�@O�812���81�-qRJr�3���L!
-l��*�����%v����F,?F�X&�
$
�$aHB�� #%R�w��1%�zt���
����������D2����K�Q�j)գ�#TC�Kĩ�ș*ub�Qilz�t�{�mD�1�s���#Tp�::9i<���Z�����HA�-��
iI<�
1���F2�}59�c�i�c�
�#u1���#'{����hvX����92��M�I������hukHS8�3Y���H�o�y²�?�5y9�P�:ߩ0D^�|�ȗ�*�lk��4]vU�Iv�G#�|��1
�6Zj�;e\ q�9 GP
q���%�&/�J
|�@�V�A�>�0�e�He�\S�=�XY�d����r��̕��*\��W��%`d�Z>���� j裖#H+�eR��k�~���Ƙ:Îx��f
+��(��٘~�l�ri�_�b�%yGa
q�0%E�����D
7��5���*'M��ڏm�����Exc
-f
z@�����8T�,�%R�'�:�(�e��0k���<�- ���
c$l�
SC���(r|�e~	�֧����/��饕1�_
-��2¤���2N&����xq�
�J�4sD3�4ӵ��2�ٕf��t�Vn
I��QH����8xJF=jE�N����4NL%I�����f;��3�ȴ�d/���j9�A<C�}�;SPv��Ǩ���S�ׯ� 8j�C}]_��̣�!|KF|
�M���&l�� �6T,
&jY��S��R��^���E	��*&?ۗBE��������P"@�~�k�a3h wW�i����\��3���@�RI띀��

�I�rD�]�XO�
��W�{��o��;���<
-endstream
-endobj
-15634 0 obj <<
-/Type /Page
-/Contents 15635 0 R
-/Resources 15633 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15619 0 R
-/Annots [ 15632 0 R ]
->> endobj
-15632 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15636 0 obj <<
-/D [15634 0 R /XYZ 89 770.89 null]
->> endobj
-15637 0 obj <<
-/D [15634 0 R /XYZ 90 718.682 null]
->> endobj
-15266 0 obj <<
-/D [15634 0 R /XYZ 90 672.057 null]
->> endobj
-15638 0 obj <<
-/D [15634 0 R /XYZ 90 667.574 null]
->> endobj
-15639 0 obj <<
-/D [15634 0 R /XYZ 90 555.308 null]
->> endobj
-15640 0 obj <<
-/D [15634 0 R /XYZ 90 489.265 null]
->> endobj
-15267 0 obj <<
-/D [15634 0 R /XYZ 90 442.64 null]
->> endobj
-15641 0 obj <<
-/D [15634 0 R /XYZ 90 438.157 null]
->> endobj
-15642 0 obj <<
-/D [15634 0 R /XYZ 90 325.891 null]
->> endobj
-15643 0 obj <<
-/D [15634 0 R /XYZ 90 259.849 null]
->> endobj
-15644 0 obj <<
-/D [15634 0 R /XYZ 90 208.616 null]
->> endobj
-15332 0 obj <<
-/D [15634 0 R /XYZ 90 184.082 null]
->> endobj
-15645 0 obj <<
-/D [15634 0 R /XYZ 90 184.082 null]
->> endobj
-15646 0 obj <<
-/D [15634 0 R /XYZ 90 111.404 null]
->> endobj
-15333 0 obj <<
-/D [15634 0 R /XYZ 90 77.486 null]
->> endobj
-15633 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15650 0 obj <<
-/Length 2470      
-/Filter /FlateDecode
->>
-stream
-x��[[sۺ~���S+�D0���L{�tz��i���3Z�m�J�BR��_�@B�D],�m�ɓh\�.�����qt������|�Xd��TF׷����		͢F���O��GLjD���������������ś��
�x)
M?�����>ˆ
=�A��S�����_/p�
FT�K�Sk�������A
��`�GU�X��*�]��Q�7�B��F�_�
�
-)
TO�$��xB9
}���G��V������
#n�|�u�M
��4�>�	
��"��aL�(�?�'�"��.�)������N��L�z�}�!)�F��c���gyW�
�N��P4��!v[m
滺��YYq���L�G?b�{� $�:��cC�
i|3��Z��F|��놸�3M"�U3�&^	��n�˷���H8c
Gk/�oI�*���h+��<��X�jw�R�8K�ނ.�f�"��O�
-
mO! n,Dߗ���
q�HK/.,ARϔf�]ڂ3,��k_a֣GF�`�}Z�)��	V������X�(�T��DXP/���4YVi�ݾ����	��ͤ$9C
-p�/+�ħ{2�Z�K˄$k"�	��'F�P�%�K6E��Z"�}�¢R$�mK�O��DE(�̊�@���)����	��x��>,�ݭIVخ��#�٠��=c�i*c
����Fb�k��}���=d{b�S�$9"F�f�fyU��S.�i�/g)8�����mO�H�R����
�]k(�_yZw�d��g�<��h �0
-q�}�>��dKֆ�F
-(=��~��k�l��
�;
7r3����(XޤH��dL��1-��?��O�g�"���Y�U��,-^e�ʿW��U{6��-���4~p[ū�Q
�vX�,|�,�
�&�"��Ii�m���d{c���3
�H^�N�Ǡ�j
-u9��\9��xLFO���~X���0g�}{���ବ�~[�
��V���x�*�i�9@�V�������΋�ԖU�M�W���Bn�,B6��������Q���˳�D?1���J/Fj�����S"(��ZT�M
-"AM�]u."�'c	����z�m�?:t�G
-��u��Sѣ�W�
ӧJ'-�
R�u�N�
�>�![Zt���(��4�{p����L2.��� H���}�AXʿ�+F�6���
�1�7�9����������y҄��lZ5��lS��QSM྄.��4�'���>�
w����}��P���O��q�z4tU{��1�lW|�a<t�V�dM2+\X��l42��3g�� mTw��&�SIZ���7L���V�l�{5$.>�y\�z���xn�Y�r88�}M:T*Fx��k�!�5��ӤSK��Wۤ'��}S�Y�A��ߞ�����t�kO�N���t���]�2h^�}�P
lk<dG�2�<n�C��-���
3��q��}HK��}������'��GE�M
=�(�Vj�`�NVl~���4_,�*����f���F���44ϒyp�A�Jv�
�����n$
�rL@�B�`rV���X&w��
��L|��aE���h"' �$"��"G���&rn=m:@�$U/��HE�5�0lp� �͆���t4�j
�ZI�Z"ϡq�@�1��҆�m�z"��X���w���
#�T�a;��d
�q*��`q���zY�"~L���f0��v%[��hb�^.�Al�:���x�G
��„,��ɭ�Ś�u�ݘ�k��Ϙ�\-�&�t��!� I�gR��l
�v�$�,�3�V%���B��r C
G\l:{գ��I^ƃX����^c�uc���ن�j���N�Î�lX
d�
�-;̆
1m6�0m6Ki͆�U�w� Z
F�8�բ�S���v���l{)
��{&	����l���ϫ���
�+B�>
��n
�]k�~�O�n�
�	��	v�����S�,V����|�|)�Ë�Jf��02F�m>�ͺ
Q�*a��7=�
t�?�G  ���!�Ӑ�%����6�Oi=̞�$�ʴ����T�tۻ=F$��g*��xwhD;�\7���\��e��Ý-؛z|]��\���L�0�'ڌ�k9x�� ��O���n�H�Đx
Z��3'H�a�
e�� @�T��ʎ��Y��C��H�r=r���q��8 �j��U�0? ����qD���jX 1"; iv��ӤImM�fI�/�쥰t�
��
D��"�
��%z0��bÀ	�k�,@�I����� ��S�S��Z�
�){�:���CR���DGA�d��6�	͓%ֿ݃�)ʎ����y��q%�3芉R�=l_���;���?.X��
���M@�d-��W�2'������c���Çw���eR�r,Ĩǟ�,����f|kT��
A����i׏Is����Ϡ��<�[� g"�G�U�����YݕIv���
[�'^�lL�$�m�dyN���E��d�
>���
-endstream
-endobj
-15649 0 obj <<
-/Type /Page
-/Contents 15650 0 R
-/Resources 15648 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15619 0 R
-/Annots [ 15647 0 R ]
->> endobj
-15647 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15651 0 obj <<
-/D [15649 0 R /XYZ 89 770.89 null]
->> endobj
-15652 0 obj <<
-/D [15649 0 R /XYZ 90 721.073 null]
->> endobj
-15653 0 obj <<
-/D [15649 0 R /XYZ 90 655.872 null]
->> endobj
-15334 0 obj <<
-/D [15649 0 R /XYZ 90 499.543 null]
->> endobj
-15655 0 obj <<
-/D [15649 0 R /XYZ 90 495.059 null]
->> endobj
-15656 0 obj <<
-/D [15649 0 R /XYZ 90 424.353 null]
->> endobj
-15335 0 obj <<
-/D [15649 0 R /XYZ 90 389.683 null]
->> endobj
-15657 0 obj <<
-/D [15649 0 R /XYZ 90 385.2 null]
->> endobj
-15658 0 obj <<
-/D [15649 0 R /XYZ 90 312.337 null]
->> endobj
-15336 0 obj <<
-/D [15649 0 R /XYZ 90 277.667 null]
->> endobj
-15659 0 obj <<
-/D [15649 0 R /XYZ 90 273.184 null]
->> endobj
-15660 0 obj <<
-/D [15649 0 R /XYZ 90 178.543 null]
->> endobj
-15648 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R /F135 15654 0 R /F8 794 0 R /F1 833 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15664 0 obj <<
-/Length 2747      
-/Filter /FlateDecode
->>
-stream
-x��[[�۸~�_���b�w�Ӣ�f�M��f�>l�Ɩg���,g2��=u7e�2�A�E���Ї��|����� �������iIep�4�HH��
-~����/�x�aN�,ʶѧs�g���c�ʢO��,�^no��$��q^�1?y�3x0�����2��P�J1�m��>0>e�����;�
�8���iT�7�h��/�������x�����>�)^�ٜ��8]�#R2�Z�7��n~�! �.�@*
�ۛ���
-
�`�t<���
>7�Ǜop���'��4�G� �Q:�c
(�P��U�ݗe��'�t_(t$�h;��Hy,�����)��3h�}m��h
H��
=!z���%�I�"��Z"��#
-�\
-��`ݒb7�cQ�"̌�������m��9�}�6��S�͙�=
�q�����9l2�:Q��ϔ1��T�f*�fH���L��1�ͩ�=��g�u�s��;N�����Sf;u�KpݺS��l��K-Q�j��'��5�a-'L��e�ǯ؟=��"I���S�'����0�4L��
t"#�(��1��ylF�����]��׮]�"�k
-IƫN�e�71;1M6�eɂ L��Ѭ/:��V���}��v[ۊ�!���g�_��16!�Uh%w
m��ctƐ$�?z�,����#:H;'�_�O�R��4
-�z\��`M�bV�j�Zp
B/
,
-S/��6��l[�LN��i퉛x���!�w�%��
۩��'���� h�
�K�WI�>(��PHg��;�/Oqm��� ��F�."���{��vl�`�����_#��w�
�����/�gm�
���0��?��-XN�!N<_p�fK�8�cM�fi�'i
e���6�mo�c�A8�կ~WMB�� �d��8�*q�9�]�е�|�����2)}ot
"�/
\�or��`!
-�
2ωPN!��:��;�e$!6Y���5O�r����Sĥ�yB��;����
&1�wM�pK+�{.&}��t
c6NwغV���/�q�U��"����V��ڏ

2 �7����i�NUg�^`�z'�e0-�OEN�;?`I��uh��w�&X\0L�LR4v��Ŷ����

A��_[��
�&{Lk at Qjv<�2
#��c�H��H�q�@�\��	�$$W�c
�� ���a�b���d�h~�RDe/�/�}���Dz���&��>�� �
�?�[4�Ǔ�L���g�
8Ap�R]T3dq8�,�r�Q<�kᬼ���b�
��	�Vɗ�� ���x��F
-�����3D�i�+�����%%�`i�'>�b��P1
�PV)bii�+F$��W*�1/������]e�p�vJ�a}cg?���%ĉW����+^�u_��u��Q8g�;�a���*�\����"C���W��e�
~l̆B��
-QF{%ڨ!_��ېۚԆ�
�%)��������h�,��
Dr.}�o�֔ WS�
���J^��2}Ԕ���mJmMjSZ��n���eL��1�� k�Ә|K,��k�,�cLD#ƌL�G'4c�t�.]�W�SG��⡅��u\��<�>etI	��~��X��㜾*��dD*�=�w��8�F��`[p�ڦ`�=4�@D�VY;j�W)�q
%���NV at .�K�'����8^�ߘ���9�l�,���p�Cj����M4���ـ)g��n�ʟ���� ��X1���u�^��?��YN0u�-$r��y��˸Z�b�z�j9
�A�WJ�dڸ@�l�>��F�5L-�h�i_T��yVLmw����<cjk�v�~
{HT�����2�D-
U��D�!=(�|B0�NU��4m��(M�\
����yjWMk��w1qa��%(�a�5*
�������K{��!+��삅����=î�?8�A��,޵</��KMT<����y�+��W�y������z������</
�Ǹ���;��e�]�R"�=I���'���)
0H˄�+y^\��8l�i��
W�'*NN����g���D��<�Dow��?�i
�{�=ν�mI_�2a$��B�j
-Y�lJ+E�I�V�(KL�,�Q�Q��@k��%!����j��E2�
^�Ts���[e�P�1F�h�����"d�5
"`’�
-K
-�h�#`c�l�/
b`�#�)$���W�@)dUE���߻Ģҥ�o���@��4�.�@�T�y�Qf:j��%�y�~

-t�:[�0��iϾ%Z{��y��(l�+p

z�&ncnkr6
:aϳ����y��ϣQ��-Q�B����↱�m�,
�JMܶ���
�:k�<��7�0�$�}
��D��Ğ^Ϡ�0��
ʩA��ѠW��A;�x�A{6w�-�a4}Y�M	D���=�d���@$$���;
D�-�|�7����g��B�H�4PK�5<�\�y�|δ"�zS��uf�T3A�wl؍@�$~/�^!�Ii^��9}eO�8�0����=>|c��sn�Ɂ{|��^s�#�l��^sa��=v��
���1m
�^qc�}�:|c�]tcO
!�7�*��g4�T��s/�WV
��yi����7?|xo������e
��oQz�6�m8Kf���9�E�h�>�q�������_-�kT!�#!�-~��۷o��8}@���{[��m�f]��]V�8x�-^>B�Iz
�0�	I������Ɣt�`
�_�]���a����[�e
�co��
�`�
-endstream
-endobj
-15663 0 obj <<
-/Type /Page
-/Contents 15664 0 R
-/Resources 15662 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15619 0 R
-/Annots [ 15661 0 R ]
->> endobj
-15661 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15665 0 obj <<
-/D [15663 0 R /XYZ 89 770.89 null]
->> endobj
-15666 0 obj <<
-/D [15663 0 R /XYZ 90 718.682 null]
->> endobj
-15337 0 obj <<
-/D [15663 0 R /XYZ 211.842 654.432 null]
->> endobj
-15667 0 obj <<
-/D [15663 0 R /XYZ 90 649.795 null]
->> endobj
-15668 0 obj <<
-/D [15663 0 R /XYZ 90 555.308 null]
->> endobj
-15669 0 obj <<
-/D [15663 0 R /XYZ 90 440.249 null]
->> endobj
-15338 0 obj <<
-/D [15663 0 R /XYZ 192.853 376 null]
->> endobj
-15670 0 obj <<
-/D [15663 0 R /XYZ 90 369.982 null]
->> endobj
-15671 0 obj <<
-/D [15663 0 R /XYZ 90 276.875 null]
->> endobj
-15672 0 obj <<
-/D [15663 0 R /XYZ 90 186.125 null]
->> endobj
-15339 0 obj <<
-/D [15663 0 R /XYZ 211.842 82.124 null]
->> endobj
-15673 0 obj <<
-/D [15663 0 R /XYZ 90 77.486 null]
->> endobj
-15662 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15677 0 obj <<
-/Length 2660      
-/Filter /FlateDecode
->>
-stream
-x��[Ks���W(�D��`�A8�=$����d3�8���)-Q6��P�z�_�n�	�e����^F4�n��F�J���O(�|{A�~�|sq�ވ�%Vs=�YM,�i����r�y*��}��~"t@������p�O�������
��1�d�����N�p�{X�`��^�L$�|����4s�
_#�c�Ȍc� �l�(��<�<��<BM���[͗�̓J�?ox�
1�~!~��p��\���O�nzdj�z�_|�#�c�~�.M��K�,3K�`�Kg�N�l�~�q:M���2
o?�wY�=__��$�Fy�~�ep�GIN)��
��Ws��s+�
��a�R��Ɖ�ǻ���I���7�S�NA�?QEgs��t�&ۼgN��L%�C�Dav���l�@�v�I��'����WF��+�5p�SS���G
.��y�~��/�(�{F��L
?z��^z���#'���<�7`l`k�q��&a�Q�ŪK�
�
��Pu�P	���8vº3c};��}@������
ہ�>�t�m�l��ݦoV%±�(�FI��y��ͨ&J
�h3�}�
�Ӣ�>x_�A�au��z����/@6�N
-���]�lK�T�}!�5u�ʳ]m=�\� �M�W����0Yi�~.��U�5�m�� ��-T��!��vX�m1f�����s���1
%��<�Hq�w�.YF���,ݔ��u:�j���=�3j�������T����\0�C:M�
��C�~�!���E��h�`S}(/���f�)��
	׻�i��xQ�<�
U\>=DY�c��t�KZ��E��!ږ��Y��"�<��hI<��YE�o��*�
-�`��j��B�G���֗���ͨ���C|�͏4�I�p��I+E���!NCp�򸃁�NJ �b�,��n$
G3�`
�6c�%���
n���/�5�i�+sSa~�R��J���p����+�/�������?�"����v
K�����~鏇�Q1��g��~�H{��x
[�ó�DKB�=
-��!��t2Ba׮����0��I?�ۚ�`Nv�2q��#�QX:݌�+�"��#bit��ˌ�%Dk�`iy��ӤK�&5��Q�B�{34�l���$	�J�C��
4N
㠉S 6d�.�b-�*���<U:�^	��*��C+�W��d���e���i��jN��ɳ�I Rq9&6ǖX`��d�������V^W�ElQy��1��ďdw���l.�]��w���"��[dSJL����x�	 ���
�'��	��
�͒
�%�K�]���.���Z��q%�
=����k
��p����L��S�`?`˲҈.p��^V��
XB������8��e="^��PQ,-
T�U�WL��"]X�VBD�'DD��+�k�t�a�9U��,��G�	(&p�ʭ�6_^_��L��u��f'��
��$?�zNa��bTK�
��*�I�C���%�#.|Ko
��Δ�e��D4u���/u��� *cƩ׵��:�9�<N����n=�DQ�<} [...]
-nG�7�@���BBaԘT�%�
*($�F��cZZQ���'RA��}T��"�
-���H��NϢ����~����qi�92_W�T7�
~�a�2K��7Zu˦1O
A�aU���ھ	��x�px��$��3��En���B��i=� ��Tw f
�W����F���;]�N�B
�������B�7��Yl��!� �z;���SM8
���<�`\�
E[:G�u�+��<�8�_	qh
�c�m��˜m�>�y�5C���SZ̞]�&q
V2���

���h
��%�8f�A�B|����P����1��0�c��W
�]�s��v�Q7l�|�z�+��}gA�
%���eO�`��!S�ޡ�S� H�a�t:�۰b���M��� �f�%� H\ �R�fo � �Nш�#��[��0���#�Ye���'&����%�.�?y��{H��8�G�!���

:����W�^
As]⯠-�-����k�����q��FL����F�
���lXn<S�\�	+_��2���Cq��m��a�Դ��/V壪�V�e��E��;�~��2z��V�o�9��>J����!�����v��(�' ��)K��yU��ۤY}@	nn܁{��I!��
-endstream
-endobj
-15676 0 obj <<
-/Type /Page
-/Contents 15677 0 R
-/Resources 15675 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15619 0 R
-/Annots [ 15674 0 R ]
->> endobj
-15674 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15678 0 obj <<
-/D [15676 0 R /XYZ 89 770.89 null]
->> endobj
-15679 0 obj <<
-/D [15676 0 R /XYZ 90 634.093 null]
->> endobj
-15680 0 obj <<
-/D [15676 0 R /XYZ 90 519.034 null]
->> endobj
-15340 0 obj <<
-/D [15676 0 R /XYZ 192.853 454.785 null]
->> endobj
-15681 0 obj <<
-/D [15676 0 R /XYZ 90 448.768 null]
->> endobj
-15682 0 obj <<
-/D [15676 0 R /XYZ 90 365.484 null]
->> endobj
-15341 0 obj <<
-/D [15676 0 R /XYZ 90 274.704 null]
->> endobj
-15683 0 obj <<
-/D [15676 0 R /XYZ 90 270.221 null]
->> endobj
-15684 0 obj <<
-/D [15676 0 R /XYZ 90 187.559 null]
->> endobj
-15675 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15688 0 obj <<
-/Length 1967      
-/Filter /FlateDecode
->>
-stream
-x��[s�F����K
��~�t��4ɴMg��NҌGӂ�9��guC+�d�ȭyB^��{�V2��
��~�
Ξ)�d$����3�S� !ᯙ�fH0Rf4&��ň���ˋ��h��	f��bq����<^��:H�9�'�A
����ΞRY�2��P��t��)�~`}�L1����I�
�8.���)���_�Gc*�p22t�n�~d#��� 
=
�)
Mɐe��N��`�d�Hio��y��
��a���I+�S�K���� �V/?��~� ��Mk�0�"
i,���5b|.�y���̳g�*�h����#lx&br�ȕ_����*�lf�6).
��#����\n���2T &y151�p��ň��{�g�]�]G嚾cÑ{�!,�"� D
�GaRxk74ED�Z89K(PI�
��_Y�3�/�$GD�cˑI2��3��h���S�0�=�0�A�6��]�Qv̸���Ƅ #�~��!K}�ϧQ������ÿ���1r���
�"{U��q�*��Ԗ�����$�˵���}!BUC���æA�.Ð�D�a�e�J��RpQ
�-�*H�b0sfQQ����o�My*�P�/�����Yv�˼ _��&��-��܅�$�yݰA�I���qY���By��&a���u)w֥�q�52f
����җ���
�aȔ
- ���V.Ʋ�^CX�L����6YD��v��N;����F at i��b[�I۶��6�����1��2����ȅ�Y}q��$u��w��8��CG̅āw]��5RV
̬�@��9�dv~����\�.�����VA�'�>P
}
-�^u��Ӻ��e�ES7���q��đm��a�ڻ)�!�$y@��
r*��,
uB"�ԃ��d�D��2�oƋp�n�dq�̿��Z�,vD�3��S0 
yL���1M����k�
#��8�t����_�|}��N��4Y�ɒɍn
�
*
SH�֛
-	nʠ�
b��T���I�,�����_��/g_?�呻�
��	�>)J��p+|*䐂R�φr�)re
��+"�A� �%��Դ �������7|(
-
���Y&�Dv
>:s��ى�ܶy�k(�N����EA�
-&;�x5.X,7�O���U ;�P�Wh'���m!L"�ס��ӡ���X48�X8�D�K
-�B�
 d� *%$�@Z�c��A����%�nw�H 
69
J�� ��e�<��b@��A?�cLx�UΘ6�Z� Y�k�-V��ݜ�5�	�v1-+S7yQ*����D˙=��ߓ� k���*u%��*M1TW�OR�ݍLkNq���h��x>����I��I�	
i�k9�_d�Q�K�/�'GUD
�Q�
�G��i�Q5U�(G�O�Q�y	�(e[Z6c�Q�t���'��{N�cdv2#��L՘�a��<���=���쏙�J?�&G3���(���L`���L+3��\�~w=
Ȥ���>dҥ
�M�&P.�I���25 ����KL���O�{�I
FL�/q��'
-��Bh�Y�O 3E&j��>��"�d�p��(�
��Դ@���"���g�Lmy)�smO���w����0
Zc�Yz��Nd"��y��"��_
3ɓ"�b��e�!�!J�g)G�}�J*^
,�
-`��(R��c�y|��ܹ�� d�$&�}|4mD&�f
�d��q2�������Lp)��C&xϧb&Y�H��m�@f�L�>�������c��@!Q�7`�Q͂�\=ĥ��������>I���'L�no.AE6��׳�Y-UŨ#\B+���pP���K�R�TO!a�ws�\\��.�\�#!�y����evm;m�2��(�����Ӌ�A���l��z���4��[\AB���&In��ή��� �#��ݦX��T_��.����"�!
��n�
-6)�ɞ�HZX��l�/h:�z�~Y�08�uż_"0�˚��!w�
-endstream
-endobj
-15687 0 obj <<
-/Type /Page
-/Contents 15688 0 R
-/Resources 15686 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15701 0 R
-/Annots [ 15685 0 R ]
->> endobj
-15685 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15689 0 obj <<
-/D [15687 0 R /XYZ 89 770.89 null]
->> endobj
-15342 0 obj <<
-/D [15687 0 R /XYZ 90 681.591 null]
->> endobj
-15690 0 obj <<
-/D [15687 0 R /XYZ 90 677.108 null]
->> endobj
-15691 0 obj <<
-/D [15687 0 R /XYZ 90 606.402 null]
->> endobj
-15343 0 obj <<
-/D [15687 0 R /XYZ 90 571.732 null]
->> endobj
-15692 0 obj <<
-/D [15687 0 R /XYZ 90 567.249 null]
->> endobj
-15693 0 obj <<
-/D [15687 0 R /XYZ 90 494.386 null]
->> endobj
-15401 0 obj <<
-/D [15687 0 R /XYZ 90 459.716 null]
->> endobj
-15694 0 obj <<
-/D [15687 0 R /XYZ 90 455.233 null]
->> endobj
-15695 0 obj <<
-/D [15687 0 R /XYZ 90 370.414 null]
->> endobj
-15402 0 obj <<
-/D [15687 0 R /XYZ 90 335.744 null]
->> endobj
-15696 0 obj <<
-/D [15687 0 R /XYZ 90 331.261 null]
->> endobj
-15697 0 obj <<
-/D [15687 0 R /XYZ 90 246.443 null]
->> endobj
-15403 0 obj <<
-/D [15687 0 R /XYZ 90 211.773 null]
->> endobj
-15698 0 obj <<
-/D [15687 0 R /XYZ 90 207.29 null]
->> endobj
-15699 0 obj <<
-/D [15687 0 R /XYZ 90 122.472 null]
->> endobj
-15404 0 obj <<
-/D [15687 0 R /XYZ 90 81.969 null]
->> endobj
-15700 0 obj <<
-/D [15687 0 R /XYZ 90 77.486 null]
->> endobj
-15686 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15705 0 obj <<
-/Length 2083      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~��SK��_4Mg���8MS�b�
�"!	�*d[��g� �%$C�w�O�@��s��
@Q��'�
�6�����.�*�d$���.18Q� !�E�~̍�|�}�0�1��/��fo~�]��Fof��G~�	q )�̗��p���������S}�2���1�
�k�=�j� �D�[�`�
b��ɔ`��U�|zL�̊r�n�<�)"��2����+��no�^��"]f�)�j|u�f��
aL�G��	1��ȋ��]3QŐ0�V�a��Xm:s��*��֞�*'��Z8�XW���z��\M(
�
_
��:��>�]���Kw�/����>�)[Å�](���g��0�;�;e�!�Y2u��v���ֻ�|Hˇ];��g$��F�s�LG��H��k�Z���?a�'SC�=#��|U��'D?�4 ua�>/
�"�P
�f��[�_{JEBp��=��z^%,&������6��ym������Vk'�}ݨ�oD�	c�ۋ��!/�= [...]
�G��t1Q�E�
-JH
-bIl�gAi����H�l���y.�U�r!��W_���~���y/�ܐ�����8�]�r?\/
A�j?���X4ŲZ� cHIvD
$�j�D
�nj*Lg� ��m���C?����4�T��pĂ9�7���S���|��#r
X�m�' &
0�}���zC����	��$B@�Ƚ����a	
�6�}�Y_�H�X� �,�롸��j�3���[^QV��˼�p<��>招t=aj|��̊�)����ގ�)�S��-U��,�>U����O=Mg�Մ���%I~�LN�ؐ�y
��"0A.w(�"���SӼ���Oi��>fh����U���I��Hq�
̃�
�xD!M}ڡ�Ҏ߀v�h�Chv9��;,��v_ at 0�)X*L=v=�lo�m��n����d�;�i���יa
�0��<��P�[=�򮨬��U��I����Oy������6�D�-�=X�̦��"���H���茅
Sgd���
-�5c�Б)c��
��>������a
�W84���h|%��-]�R��+Ê�؊�g��p�؊B��Y�kF�c+����������|�bQ����qu��q�����
�i�:`gX��/N�>'�~8�#nz��x��p
Nc�n��|�Öu�M�,4t�H"3	ȏ���@��~
Ŕ��ϻ���QV5�*�>o��?�m�_�mq	�5���̺1�
Ⱦ`�j�7j�V�8�#(�8�B�l�$�Q/�
-;-���^H�t
��脐�|�x
3c�f5���P"v|ᎎX�2FX�n=��CR =��żLÖ"���3��Y�j�*_�Y 
��i}�m~.������
�DŽr�6þHEt�h:�H:���������$z�C5���j_��1
-�RsVۃ<gVKaW�$ެ6��m�ꉳZO�/}V;?�e�Y��ӽ5�B �i܁�Y�{�	4�~�B�ז��zPK�w��ZH8��ѽ��VD��7�/%�W at W
;��
�-D��1�7�ô��,�
�:��w
��6F�k�Xo����]/!~�^�(
T�Dd�k�c��q�������6

�}�
�&�#�Mxb�#�m'�6sܟ6��j
N}�� 	�p��9��I5�;B�������(��RD�ʣyN�@ ^)��9�Դ�
�T=�s�4��;����<^�؟���Y���.
�3��"n{qfhK��aGR>���A�=���Ã?����J����y�c�Ls��ݒ%]�n
-x�
`��$H�]�@��vQ����ޝ�Xf��O�7��?��9}t��1�}��]$���M�
ډ�,k���뿝��AݓGp$D���CU=]^\�>ߗYq� w���ac��I7�[����
��L�v����/�ZD
-endstream
-endobj
-15704 0 obj <<
-/Type /Page
-/Contents 15705 0 R
-/Resources 15703 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15701 0 R
-/Annots [ 15702 0 R ]
->> endobj
-15702 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15706 0 obj <<
-/D [15704 0 R /XYZ 89 770.89 null]
->> endobj
-15405 0 obj <<
-/D [15704 0 R /XYZ 431.18 659.423 null]
->> endobj
-15707 0 obj <<
-/D [15704 0 R /XYZ 90 653.406 null]
->> endobj
-15708 0 obj <<
-/D [15704 0 R /XYZ 90 582.077 null]
->> endobj
-15406 0 obj <<
-/D [15704 0 R /XYZ 90 547.407 null]
->> endobj
-15709 0 obj <<
-/D [15704 0 R /XYZ 90 542.924 null]
->> endobj
-15710 0 obj <<
-/D [15704 0 R /XYZ 90 472.063 null]
->> endobj
-15407 0 obj <<
-/D [15704 0 R /XYZ 90 425.438 null]
->> endobj
-15711 0 obj <<
-/D [15704 0 R /XYZ 90 420.955 null]
->> endobj
-15712 0 obj <<
-/D [15704 0 R /XYZ 90 352.227 null]
->> endobj
-15713 0 obj <<
-/D [15704 0 R /XYZ 90 298.538 null]
->> endobj
-15408 0 obj <<
-/D [15704 0 R /XYZ 90 263.868 null]
->> endobj
-15714 0 obj <<
-/D [15704 0 R /XYZ 90 259.384 null]
->> endobj
-15715 0 obj <<
-/D [15704 0 R /XYZ 90 190.656 null]
->> endobj
-15716 0 obj <<
-/D [15704 0 R /XYZ 90 136.967 null]
->> endobj
-15409 0 obj <<
-/D [15704 0 R /XYZ 90 81.969 null]
->> endobj
-15717 0 obj <<
-/D [15704 0 R /XYZ 90 77.486 null]
->> endobj
-15703 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15721 0 obj <<
-/Length 1923      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�6��W�Ԓ�x?<�
�&���[+�$�-Z�T�����w��	��d
-N�NN�)�v������,��������dt�J�� #�
&ׁ���		M��!�H�hL0��YDp����,�8\/
n�i_��_�q�pzZܞ��M��c�#�I
-7���7'�iLFE\(XJ>�O�g=0?e�qv�r҅��5��{a^,��&S��Idh�,oq�w�J��4":LVWp�hJBn�
���>����H��j9z�S��\̌��AˀS���|��;{��
0\����G�#�()��U������(�r�����=�&�xi-f�ϫ��iy����s~�(���v9_#���{a��һ��
�dO��H�Bǰ	F�~��/k{NO���t�l�Q
I@�6R�]�B�Ѧ��� J!�-�w?�n:f5
	ƽ�j`Vag֫�j����! ��X�h̅,��X��u���.�6�
>٫���R�!��z�6]�nA�Ȁe��[U�;y%����`$`�`ċ.�z�)
CvS^��Í��4Y4W��ઽ<gB�絍ٺ@k���+�0�8���`�11�=�5�ͼkfʐ��9Nq�Tˡc"5�F��,��Rr?N��d�t�p�"�?;Ϣ�o�/�w�z+�BZ��W�F�� }^DD
�;l�/�@��E�qa�t�'
�
-6X2����p����c��ƪ��@
-;˘�D̗倻M2-��ש��d����"�nN��ی2�g@
F�̎풬
��;&P<�mx��Ur��av��&�� ��\~���.y�<��
���x �Iڐ��d~*4ŢI��zw�x�Y�uY
7��������b>��ӈ�pvgw�S̑�̫�``Ѷ���MR�LuO
u���Nn�uDEx�*���3�S�$9�
#��0	��
��
8P7�z�!
�e���a{6�S���j������"�W��82yLd�'�&
-�ob
��W��(oi�]�|-#�2�4R�CS��	D6��q�B�:�C��ЬW���J
- at 1�!)��m
)���%f]~�3�p-���RJ��׫�n�U�骋I����\"V
�q�
�^�v�[(�z5D4�X�1,

杴p[2��Z�3'-\h�{Hl!��,
�&g)0�,\1о�e�hg�XZ�V����.����$,��
��4�Gb* �IX�Iw�B���yi��!06[߮�ك�_������
���<)�6�П�{ߟ�d:�~3�̽�S�?�������[��j@���V����
���1k��uf���.ɀ�H�wu�p�k.�"�Ht�k�έvg����-��ٺF ��­[�3�<vڼ#���q�I�<�n�UC|3A L3���n�\Fg��YƤ#��s;ܚ���
-�s��4�i�[fk���U�
-�_��
�y�Q8׸�>[�
�cZ�� w�׹�ih��Z���6
����/Ը
�]�)d!�^��(̽҅J0����҅�.ߴt�׹���߁�й�Px�q{�� �&.ݖ;^)�>y���|�=\Ih{T�^��
����
|��-��E8c��ֈ)Z�	���1��O��
1':�]hOj
-�u<���,wu��8n�j�YƤ72+91�2����A�a���7�����4�@��2�����s��0��b��
��(<�+�M:����-SJ�RG;`ݣ
����h��F�ځ�=�
�� �x����hBq�
r��������P��{
fב�"G���з�(�.A����
t��9;{[\��$鏑ay����Eqm��爈N#���&A��A�p��$)Kj�迃���Q
j�K!N'Q�ʛ,�==9���m��
AxlS̆
�����r]I��
-n.c[�QE����&�<����D)��h^�_V�7N^/Y��
��DŽ
B=�
-endstream
-endobj
-15720 0 obj <<
-/Type /Page
-/Contents 15721 0 R
-/Resources 15719 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15701 0 R
-/Annots [ 15718 0 R ]
->> endobj
-15718 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15722 0 obj <<
-/D [15720 0 R /XYZ 89 770.89 null]
->> endobj
-15723 0 obj <<
-/D [15720 0 R /XYZ 90 660.006 null]
->> endobj
-15724 0 obj <<
-/D [15720 0 R /XYZ 90 606.317 null]
->> endobj
-15410 0 obj <<
-/D [15720 0 R /XYZ 90 571.647 null]
->> endobj
-15725 0 obj <<
-/D [15720 0 R /XYZ 90 567.164 null]
->> endobj
-15726 0 obj <<
-/D [15720 0 R /XYZ 90 494.301 null]
->> endobj
-15411 0 obj <<
-/D [15720 0 R /XYZ 90 447.676 null]
->> endobj
-15727 0 obj <<
-/D [15720 0 R /XYZ 90 443.193 null]
->> endobj
-15728 0 obj <<
-/D [15720 0 R /XYZ 90 372.462 null]
->> endobj
-15729 0 obj <<
-/D [15720 0 R /XYZ 90 318.773 null]
->> endobj
-15412 0 obj <<
-/D [15720 0 R /XYZ 90 284.103 null]
->> endobj
-15730 0 obj <<
-/D [15720 0 R /XYZ 90 279.62 null]
->> endobj
-15731 0 obj <<
-/D [15720 0 R /XYZ 90 208.889 null]
->> endobj
-15732 0 obj <<
-/D [15720 0 R /XYZ 90 155.2 null]
->> endobj
-15413 0 obj <<
-/D [15720 0 R /XYZ 90 81.969 null]
->> endobj
-15733 0 obj <<
-/D [15720 0 R /XYZ 90 77.486 null]
->> endobj
-15719 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15740 0 obj <<
-/Length 2285      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~������
車��i�hw:M7n�Ŵ[�hז\I�L��
RW:�elδ

� G"�!���HbDE�
�y|3��'<���.^*�(�T��A��C$$��ތƓ�f�LjDB	���?��]��ݘo������O8 � ����ћ�p������,���m�8e�\7�G���j2\�A�T#�T���L	�x\���**c���Kh�u�E��V�p�+��n�O�8���dJ�
_�\�dJ2æ˗2A�v�w��Y���93M4
-q+�zB�8�������q�z��yt�*�ˣ���z��e�u��1��ŀ�c���g�Q���w�8G
-��"�B���ek��e
��1M��.BG$�R�}�BQ���U�;Q
-	hoD�F�Ǥ�5�H0�e�FvF�g�2��y\�Q=�
<�r!ͧ�
p�納�V���Sn=0��
ț
i�K�� "�e�/����H�Â���V�.^J�8 V�: ��_t��„�����Ë$�M�h>�zΈ#N[#ˬ���������Dva602�Em.���
-ۀ@ά�ijkB�Dc!B��MDC�G9�2�'��
W��s0Aw_����v���n5D��|+Q/����t@�3�d(�I��U�q�V�$O��Bf����ݓE$��g��8
��T�z�v�D��wu��"^T��f����8-�~s�PiN7g���H�ޣG�,q0<��dH��@@F欎����xS&�|�G�1&B�}�շ�I?%�E�(��0�'��'�i��D���#�E#$����c�P��àV�jm�rqy	���h�,n�|��x�`�~��S̑�̫�`Ȣۦ2hO�}�nU�Q�Z:�ϳ	�Ǵ.�o*��IrD#�*�D��tQ��iC+uD
f���NX�֧���&�<[o�2�[Ň��%�q��A\@c�70ϑy��ؑ�-2#?��?5�yH-�ϣ$���� 	R�
��'!�yH"��!��4+ћ^3kC�I�K�h�NC���_@�>��0Pʠ�J�q�|Y{���ol������*Iyb �<2���n�
�3b����Ҥ��R;;l
�x^��dճ�D���d]�J�
2`G��5��B;`=�̀&�
E�L�t�Mc��êS���L����x�9�b��I\�Bzӆ�	�����Aa�-�K�0�Kly�O��%CJH����3�$+�
-Y�cǩ�
ŏ���c�Zm1�.1Ƌ�����vF*�>u��c+��P�l��

ƽ��� �
-4
�U��+��s�
-@����V<�ِ����c�.��V'��
O�>$��G��y$:�r�A�*5�*���!�r�
-�)�hv����92��8�ώb�g���^�M�#<9Dd�ۛ�JgL(���?|4��
�Cg�@�#Gs
ʈ���Qۜ��d?�!>��Q;8����l�
��a[�c��{ɵY��q�F;ۢI��M��
R C��e��9�äχzS
�*��Wyj
5�T���@��A���p#P� ��O̍h�!�j�8ֻD
٨�Hr�A��5h���O�:�9S�A~�ץ�Gq�B�OʗN�p�[�HιOG;Y�1&* |j�1Q.�l�^��G�Y���0<@��
x$c�I�S�J�ь	��xcL
�lӖ�
e�m�cr�t%;Nw�)O����*Jv
�T�j�@�8K�W6��Cx�
Ŏ���
d$���HQɇ�6����HMsPjiޞ�!L�n��(r$m;ٍv6H�~S��R6�5l���ό�O���e���s�R�S"�μ<��M8#J�Z�"[]�
��eT��T���5�r� a@騏1�9��2�!ڢ�q>0�Y7�e�)7k�5��:����(��&�]������'�����!z
�
������q#ӫ���������}���ׯ�����G�Rő�t�u�u��sHBJ�G���ǻ�S����}7թ����q�Ϲ
qW��ȳͦ��g����d����v������2Λ�^Y�HRȤ�]���h�1��#F|� �-�5�l��I�Pf��N�@Q��r�<K�A��(�r�u�>YG��Ŷ��E��n]����Y�.�K�G1�S������"<U^�to$„:5�D9����9t�
4�D�MO�����>���o�,�:a��)țv�0fJ^�
���fP�=��_U?~*����0�����qS]�� ���P�M�F�)t7��뿭��
�$��G@�m��/������ò��%}^���_=P��x]g��$��k���fQp��i\k�
-endstream
-endobj
-15739 0 obj <<
-/Type /Page
-/Contents 15740 0 R
-/Resources 15738 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15701 0 R
-/Annots [ 15734 0 R 15735 0 R 15736 0 R 15737 0 R ]
->> endobj
-15734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 510.321 212.124 521.225]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-15735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 336.795 210.103 347.699]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-15736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 233.388 485.603 245.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15737 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15741 0 obj <<
-/D [15739 0 R /XYZ 89 770.89 null]
->> endobj
-15742 0 obj <<
-/D [15739 0 R /XYZ 90 658.004 null]
->> endobj
-15743 0 obj <<
-/D [15739 0 R /XYZ 90 604.315 null]
->> endobj
-15414 0 obj <<
-/D [15739 0 R /XYZ 90 569.645 null]
->> endobj
-15744 0 obj <<
-/D [15739 0 R /XYZ 90 565.161 null]
->> endobj
-15745 0 obj <<
-/D [15739 0 R /XYZ 90 484.478 null]
->> endobj
-15746 0 obj <<
-/D [15739 0 R /XYZ 90 430.789 null]
->> endobj
-15415 0 obj <<
-/D [15739 0 R /XYZ 90 396.119 null]
->> endobj
-15747 0 obj <<
-/D [15739 0 R /XYZ 90 391.636 null]
->> endobj
-15748 0 obj <<
-/D [15739 0 R /XYZ 90 310.952 null]
->> endobj
-15749 0 obj <<
-/D [15739 0 R /XYZ 90 257.263 null]
->> endobj
-15416 0 obj <<
-/D [15739 0 R /XYZ 90 210.638 null]
->> endobj
-15750 0 obj <<
-/D [15739 0 R /XYZ 90 206.155 null]
->> endobj
-15751 0 obj <<
-/D [15739 0 R /XYZ 90 123.469 null]
->> endobj
-15738 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15757 0 obj <<
-/Length 2507      
-/Filter /FlateDecode
->>
-stream
-x��Z�o�������Z	���~
� ��.��:9�hp=�D�l%R!i���w���H�zآsm����jfv���%��
��jt�V�� #�
�����		�̓�c��2�)��/'��l
^_N(
����h�����,�
_�r�qR�Q��؟|�2X�|����-!
f�QąQJ^p[Z� �L���Û�>:
-q\���(�׫0�'S*��jb�8ZoVa����E�M�
G�
���d,0�DGo�F����q�H�`�
}���9,`Č>����
>W��я#�^"*��� �[��A�@�
w�����V�.�����S���& �f̟�.ˢ�X=�s�Q�
{e$��L7E�Wq�.��,L�(���W��hB��~B(˓Zx틦}�D��J���
=X��ޖ�"*k[�d��
"LT;�����������������fH�7r�ki���)�3��"p�m
 �h
E�4��)"�t���B!�u��x�DI�.m�����H�q�M������'�C(��b�Gk
�����O�k�I��pp3�����
m�^��g�!��n�����

��-EF�:rwc���a@� ��㝧�h�+�c6SJ�ظ�4I�
�L!a��1���!ZN��#�
�R#n�2U����M�-�����L�� �$y���BC���;�n�}����*ʯ?T�b*!ԫ���
R5���n���r�W=��}�����Sߵ+B=�T[7���pIӲypy�����
���c��@t��A��U^:�tj��@����.p�<�oʺ������E���Q�
T��j0ì'�s�Z_�mUZrPٔ��s�g�f'K�s�X������֭B�L�[�.����Y�f�8����/R�
�KOw�<�y���Ʃ;,�
S$��
�A��7i2w��қ��[�%�֭¬�� H�����nƅ�'�	 P�����먰����^h��`�[����
���(�$�z�R���RDĘ@�B
���	�T]�jYN U� �4�	]ՖN��}
-# ��� �`��d��A�8�Aa�v��q�
-��

-� A�G���B�*�^�A2mć#&n���<Χe��N̄�<���z�*����߷�"�
7��M�y+�B���ɽV��+�n��$7KԷ
-�u��D��ڦHW��eY��Eq���F��,�'�
���p�L3p��ox��S�����@&�T7{6ŧ5�sT��g5��t����lH�<Аe�4��vT#�͗lG���
�1�z�]؆�<�
��ԡ�hV�}�1J�	8W��	$����>Πψ��k|�$���� ��OU���s;�أmL�
� D9�\[*{�4"kA
�ZHb���t"lM���>��*N�O[$F1����G�7�	�6�o�F�]�]
��7U�,ݰr��B��h
�S� O�"L�}ʕH+�1Q�
-4+�
�5Y�c��RHR����1�Zw��>���ص��ls�j�E��U�m��J�n�
����KfE��GQv�
]�c/�(�7y(~�4-F2�a�T	�b�e�=Jb�t�ڪ  �j�̄mee;�y��u������PW/�[���K�>L���2��!=��@0ʀ	�wEϛ�B\��XRT�g�.yV�҃�.�+�.���0�����^]��d{J��t�T(��&)���=t�94�(/�#�+����g���p��R��B�$'r{=�Mj����Ÿ��"��ȸ��t
����n�7˜*;��DlK���gU�
-�d�/|@�/�F28
8P��J��3x$�!�����~�0�6E57�?p<a�H�5�`���}�>��~����B�a\?c�@�tI��5H��P$�,
-G�>�&0 �12��l^�m�2�x|=��:�&LAϽ�f���b3�٠'�� 
��
�
dIu��0�Q�>��m�rAgV��n1I�k �F\ցV�z�:�;̀�w�����@0y�_�! I��
���<<ز� ie:�(<��T�@����M���o�ŗƦ
)�cS~(��M��/
{`�f�
-��΂��(��}W�T��]n;�ݛo�˹� l)�B���3d�P����`
�`_i1�Ձ���
i?��oDP�o4D�
|
'�f�
-�U
���պO��~�ӷ��c)�:d�ɠ�����5,���,����q�{�,�Pw�
�b�����^�G�7�ؾa�=�<4o�Rc���.,�ڒZ��<�!g��[
畠�]�Ds{wA�;Ԥ���7����e� ��%��T<N�x.s��զ���r"�d���4KXn;�Ԑ��A�
XN��56,�,�
����u��X^��t�.[��7�� ����e�_?L��{;��Z�%E��S_®\P��$��۷%u�������oP?b����arW�s,�㧼N�a���0�9���	��z�˨�(Dp$D]o�b�����n�G��{�‹�9L�/*[���z�n0�*Y{�)i�	P�/�{
V���s�e�C�p�n͂?���;6�3�P
-endstream
-endobj
-15756 0 obj <<
-/Type /Page
-/Contents 15757 0 R
-/Resources 15755 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15701 0 R
-/Annots [ 15752 0 R 15754 0 R ]
->> endobj
-15752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.275 207.663 293.971 218.567]
-/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
->> endobj
-15754 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15758 0 obj <<
-/D [15756 0 R /XYZ 89 770.89 null]
->> endobj
-15417 0 obj <<
-/D [15756 0 R /XYZ 90 683.788 null]
->> endobj
-15759 0 obj <<
-/D [15756 0 R /XYZ 90 679.305 null]
->> endobj
-15760 0 obj <<
-/D [15756 0 R /XYZ 90 586.82 null]
->> endobj
-15418 0 obj <<
-/D [15756 0 R /XYZ 90 473.928 null]
->> endobj
-15761 0 obj <<
-/D [15756 0 R /XYZ 90 469.445 null]
->> endobj
-15419 0 obj <<
-/D [15756 0 R /XYZ 168.903 390.335 null]
->> endobj
-15762 0 obj <<
-/D [15756 0 R /XYZ 90 385.753 null]
->> endobj
-15763 0 obj <<
-/D [15756 0 R /XYZ 90 301.657 null]
->> endobj
-15488 0 obj <<
-/D [15756 0 R /XYZ 90 266.987 null]
->> endobj
-15764 0 obj <<
-/D [15756 0 R /XYZ 90 262.504 null]
->> endobj
-15765 0 obj <<
-/D [15756 0 R /XYZ 90 177.685 null]
->> endobj
-15489 0 obj <<
-/D [15756 0 R /XYZ 90 81.969 null]
->> endobj
-15766 0 obj <<
-/D [15756 0 R /XYZ 90 77.486 null]
->> endobj
-15755 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15772 0 obj <<
-/Length 2848      
-/Filter /FlateDecode
->>
-stream
-x��\[�۶~�_��V����_���6�3I�ԍ�}q2;�DI�JԆ�z���= H��@�8��
jA�� ���i��H�	���n��	�?��ܾV,1�H*��Ybp��AB�_���@`:�����I����T���߿����;{����͏7n�8)�LV7����������s�i�p��L����{���
_#B!nd��2�!Ɔ#�1
l���r�M�*�����QMQ������'\!�u�a����U:
Q�o߽�Ȕ
I"�G��	2b�
�����u�֚D��;�
<����!Ń��e�N��Û�C1.^��\s�o7��cyN
hhJ1FX���k��`���&�S��2}3���t��Ͼǘ��!H��H�D�I���B�Ѧ��!:(&H�j[Q��@��`>
�l&�b�=8�v�
��546 X6`R��Q�[�j�k(���RP�3�u��:�l�Òj��Л,O��ë�
�!�7�l�dk��jp󛐮��M�D
��]GT	��=|�N���di�
l�&�i�H�`��5{H�E�(E���q����5
�N��lcp
- ��/��'-�|��n�0M��*���u����-4x�fC��}X��(0���H�@��܍D��VDzS��o_K��)��鰄X���P���c۵���s\�iF�,�3�ui�l�����
-i-v��J[��ż��ᄎIޗʌgCjͷ�#e
�<��Xu]�z��X�[�|��r-*�fO�dk-��k5~|���㣝��Z�񉀠���� �č��&��{
e#��)���v�o�@���t��өk�����j

S�N:q���|��DZɐ�
�#P��4��7
�4
�2�=��]�X���B�v���Ɨ�
�L����I�Y��@�����_V"ds5������Ï/�9R/��
23�Hə"
���H
-�W�!}(������~�:l{�X�XK���E6YTMuo��ؖ���p�K/�N�?e@��r7F@� u�%��F!�H$�� �"� 
Q��r��U
��T&
��2
��UZTi�	��<���˧�	+����.��J
�wT
XaU�
Bk$%ƪ�ȺN� �<}d�)�%�rm6�\?�
f���++�9 j �&��
uV��O�m۷.����E�I��x��!5�>FB�ڋ%Ӊ�JD���CQ�v��O��܏#��	)��
��^�K�G��$�e:K&���e���I%p%��c-�e;�P��JF�&�~o@(�PO
���R��vzw��C�/���
-S���b�f1�i�]����2ИH�3Q?�xO�?��E����
NBp��f�
-J#�#2��zE����@~�s
-ÔX'f[�!�ƒ����*�خ\k*�6���2JM�V�n"�
�`���dT2D9�+�,��W��m�$��.�bP��#�"F�`m�L?֕�
�e�xRǏZ�&z�`$w��5�e�H���� �`m�.��y�u
�!^#�(
�5$u�oxp����<8�Gyp}*�[��kyp"�(���;�
-��wQ�\!��\86�D.
��Py��%\�=�����]ǹp02�/�¹u���­(,�Ylx��k6����']|��:,��it89�á��x�'
�������yM����&
!Nڄ89��dC
��Ɏ�.����!>

����L�B����E,ǣK,+OH����&������+�rG�
�}���S����Q�a�Kt�������g�LY�B�'įT&
��2���|:�  �ҽ���-��Jbdb��T�8��O���LB�J}��j��?C�_�R��*�)���#���Gg�!KeUT��Y�25�JQ��+qF�a��ƈG�g͈�M�2Fܛ�gF�3#��3��J����Q
�U2�2��
-]G����Öʴ<��p�G��/����� �I	��I��*Z�r�a;�=[���J��<�P�0
ed ��㍼G�K��~�c�N%�5�&��!FwX�.Cw���e�a�
IW�
�U����*Ġ����cl������
�~�O��������[��w��p���t��`�X]�
f�]�6���������X����

-������W���	r��3��:��H�s���x
s��
Ü?��Ɯ��x/�
�_�x��g0��R;V<��U
�B���N���kߙ�b0�
yI��{�u)ع��]���CD�����:�#,�j_A�a;��CB� �Vߨ�@H���ev�����m�d-��J��F�gо�qi	J�
-���հ*1l�^{�F8rJ���g��Y��.���
-������7�eY���zȽ4E��l��N��tI�
�B��}�{hB�l�>�(P��;�=��~+��c"	L/&�]bI'�r3�����'��u�q�
AF�ӣa��*���u�ͦ�� ����
bm'�җO�+67`1�y�.ѡ�)0�H_�0R����CUoܗ�S�Y�b�:m�lis��7O���vo,�a�S��
Tln΢
��!�^��u��q����s�"�/z�Y�c��'�
�(��4΅\l�rnPr>��}hF`Iq]��yhv�:aԵ�q�3r��3����
-w��
ܫp���A���Ԍ�?R3r�H
��*�R)�c?Íu�v��vc$25�Xbu���)�N��9Zr�o�	��b�-o��7�g��ۯW,����č@�h'�F���כg�
�0�zP�=�}�����&-~;bPU(�O�9���G
�����a���K������F�ޔeKK����Xl��w����4���zuH7�
6�M��j��ZՄ�
Wen�W:��� ��8
-endstream
-endobj
-15771 0 obj <<
-/Type /Page
-/Contents 15772 0 R
-/Resources 15770 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15701 0 R
-/Annots [ 15753 0 R 15767 0 R 15768 0 R 15769 0 R ]
->> endobj
-15753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.269 661.939 238.02 672.843]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-15767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.089 437.793 246.767 448.697]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-15768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.899 200.413 431.977 213.331]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15769 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15773 0 obj <<
-/D [15771 0 R /XYZ 89 770.89 null]
->> endobj
-15774 0 obj <<
-/D [15771 0 R /XYZ 90 634.093 null]
->> endobj
-15775 0 obj <<
-/D [15771 0 R /XYZ 90 555.697 null]
->> endobj
-15490 0 obj <<
-/D [15771 0 R /XYZ 90 509.072 null]
->> endobj
-15776 0 obj <<
-/D [15771 0 R /XYZ 90 504.589 null]
->> endobj
-15777 0 obj <<
-/D [15771 0 R /XYZ 90 409.947 null]
->> endobj
-15778 0 obj <<
-/D [15771 0 R /XYZ 90 331.551 null]
->> endobj
-15491 0 obj <<
-/D [15771 0 R /XYZ 90 284.926 null]
->> endobj
-15779 0 obj <<
-/D [15771 0 R /XYZ 90 280.443 null]
->> endobj
-15780 0 obj <<
-/D [15771 0 R /XYZ 90 173.846 null]
->> endobj
-15770 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15790 0 obj <<
-/Length 2961      
-/Filter /FlateDecode
->>
-stream
-x��\Yo��~���S"�v߇s �fv��pf��lǢl":��Y�Ou7��HI�z0�`
��fuu��U_UI���'�]�����[����2�Y$'�$$�5O~������xr=%x����zJ�d�|y��Ez�.�X���Օ���mVVc�+��
L����[B:�QF
-Tqs��	��)3���oo��(�q#��|�L���
-<��:�V�˴�����"+�DO��
<"�����
-�x{s��18!�T)�ܭ.~�'sx�}�3:���N\�ɇ�\����Qao��
��*�
˜'�0�����.{,��z���3���N��<�HP�W{������-c�0�퓋&�܆b	\I_�}�#�='
Q�r%�ȒEG�ߜ Q�"�@�Q��oζ�_]��)Ǔ�t��o�b����i��K�_c�A1�MfQ
-� ��J�H�o��
C�

�`�7�fJ���z:�L�Eu�D�=���>s�l�Y���~l0�"��cs8���/L�&��ܓ|J&CsI������ϏC�P����t=�c(�n���z̿�?���!��1�C�=<Y����s����̾�̨d�r��AFT���w��cZ����~��:hh%AD��s:�v006][q�M�oR�>�wՌ����!c�7��"������R�
�>em��r�����Az��E����zیF��߶�7�^W!��u��
,
�����e�F�-�/�m
&!��:���-����� !-ݶ�O^V7K���X��8��x`E��"_
c�?�Z�
�
 �e?��u*
-T�Ta��h��"=.HWH��Ǖ/��:]9ҡLj��H�#6�LА��\?O)6b@��&Rѩ
�
X�[��v8���ЌQ:�Q�Wn��,���~:��-+ ����绔���6���7
-.�4 څ
-
�RNj���
]g3si_�23����Xd�*��pkT)�Q�(p��jL�/ˀ�"Om��6B������	`$���h#����~p^hH�oҾ�ߛ!�P� _"��
��r@
�.���u��o-)��~���
"�i��!u5x�Fn6%bb�����bMƱ�
4��	�`�Kc L��jv:��O:QXW~�,Ҽ�^]5�M�(�12��
-�)����̬p���Ƕ�������
���! 3�n��U�	���r�q�;I�{zFK	(��[��C�6#��f��p���1��p	D3(�z�p_�5H�,�,�
-�����Zd�����
-����s-;�����݃tas���V�+�n���RH��
O���
�@V��wl2���n,
�K< �P֎BSH�&���:�=s8T�8���qi��L0A�^^�j

�({8�8&��wB0`��*�x�).
c��
��k�4m|g`٣+ʰ>�u`
#��
\�fn�`���2 P�$��&�	l�jPF	��N
K
W�
�5�ƕ@�J[5"�u�`��Tk,O��&���<:�DW�9�DT�
-��X �
-ȇ�������St�!f�t����M
�e�����y�����g�jj垀�
89��N�{(~w ��xE�X�8N,�%<&�bK��#rdy� �)Ȅ��+��y�[9����`W��}^�8�����ւH"cb%�@��b�I�$��ah�@�TG�C at 9O�a�t�i��~Z���z����
w�����T�a��ՎB��SE]t�u
r#i���S��0�0=�7�5����!ܝ�� �u<��%tFy��e=�
|V
V���
�`T<?ʦr�K��{.��/�=��x�|)�w�
-cO˲��Oމ��10?ٸ��6���%����9Au
-��]�F�-��� ������ˎ�s��
�aD�f̕�
��ROl`+�����������`��|F#3�~��F��d
�`2	ԃ�^S}�&�{:���5�t0�1�K�L{��D��*ں���Θ�Y�����տ$ 
fa�!��j��s`:V�T�`��R�a�c�l�L�3�������k1���u�^���msp���H�!Z>lߌ�Q�׵:y{��:���ѭN,̫m {���fu��v�<(pB������'�H�r1��� �'Z�C�2A�����j���A� @[#X��{�1;i��,��zc��^����N��ޘ&�v�Z���(�gj�X5����
-�@��aiv��wn�]3u�
k>1X凛O39�O����&Q
	�P���E�"Dt�.ߦ�;�Յ
����G�P��L5kl]5��CE)ܞ������,E���$첢6�� ��Nj,���0��ڜ�W:Y��}�J�Jd�
'��
-��$� ΀ � X
D�yz
C���M���Q���W3���^`bv�N���Z�-������Nl�D��e�� �
3K����בֿ��;��t/��R:�=�E+�G\g]I�-����/t��
��[HgX
W<�w����(#�����H���X�Dk����w���I��Ӷ_ͬ���
Y
ߟ���
�m�p��D�P���#����iO+�Ԍ�*��'�q����s<K��j0�>��j��Z
��`�y���:bԂ� vl%��Y�:pg��_�0R�%
-�*ح����"(?P���ׁe�+����L�c���~\�:�@�n�,N,�~!���J'4�^�l&a!7�3	�-�U!4h
���+[K�-À�
z)�:�����8X>�	�
��B�:�,�u`&F��3f�T�����c1\�h��+ʎ��&j��-c��
-2i��ᯯ���n��S!&�%�����j��	?��
Bfc�?��8�x�!����OR���™�U��D����������6[�#����Ӎ͋�۬�MQ-(_�Õ�;Tǯ�b�$ ���'`Q�(E݈���~�zp��K���,���=
-endstream
-endobj
-15789 0 obj <<
-/Type /Page
-/Contents 15790 0 R
-/Resources 15788 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15802 0 R
-/Annots [ 15781 0 R 15793 0 R 15782 0 R 15783 0 R 15797 0 R 15784 0 R 15785 0 R 15786 0 R 15787 0 R ]
->> endobj
-15781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [523.983 682.851 535.938 693.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 669.466 261.145 681.8]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.307 575.589 434.874 588.507]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [523.983 410.486 535.938 421.39]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 397.101 261.145 409.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.631 316.458 429.297 328.937]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 172.955 267.79 185.289]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.883 92.085 440.282 104.564]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-15787 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15791 0 obj <<
-/D [15789 0 R /XYZ 89 770.89 null]
->> endobj
-15792 0 obj <<
-/D [15789 0 R /XYZ 90 718.682 null]
->> endobj
-15492 0 obj <<
-/D [15789 0 R /XYZ 90 660.102 null]
->> endobj
-15794 0 obj <<
-/D [15789 0 R /XYZ 90 655.618 null]
->> endobj
-15795 0 obj <<
-/D [15789 0 R /XYZ 90 549.022 null]
->> endobj
-15796 0 obj <<
-/D [15789 0 R /XYZ 90 446.317 null]
->> endobj
-15493 0 obj <<
-/D [15789 0 R /XYZ 90 387.736 null]
->> endobj
-15798 0 obj <<
-/D [15789 0 R /XYZ 90 383.253 null]
->> endobj
-15799 0 obj <<
-/D [15789 0 R /XYZ 90 288.612 null]
->> endobj
-15800 0 obj <<
-/D [15789 0 R /XYZ 90 210.216 null]
->> endobj
-15494 0 obj <<
-/D [15789 0 R /XYZ 90 163.363 null]
->> endobj
-15801 0 obj <<
-/D [15789 0 R /XYZ 90 158.88 null]
->> endobj
-15788 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15809 0 obj <<
-/Length 2967      
-/Filter /FlateDecode
->>
-stream
-x��\ks���_�O�4a�~�mf�t�i��ۮ�/یG�h[S=
Z����= "%RN7���
�$xq
\�{�l:���7��x�G��zpu7pt`�#J����PQ9���ہЖ0��V���_��z���{�����ŏ
��e1vp����
Lq��%�����h1�\�s>x�
��R~�����=�ͭ��J��0A�̼y7�r8I'�d��#ƆO��=ˍ=�?�
�g{#��`f�L���Ul��A��h����U�f�)�c6��*
��DJG)��g�=�'�m�����]]u�5q|Ǐ��d4����:�z�,����l�?�܍���R���$#��?=����l�����(�	�1����&�	��3<YI�bq�$��æ!F�l
ӑ0�d��8	V��i�U͝Vi2���
P/����4�tv�}i-��1��bÈq6R�QDH������>=1���%U?�(��?�>�$@u
M��ä‚ETg��
�Z�$˖��O�ɣߤG��Nw-г��Ȟ1'�mfی [...]
��w*b�6Z��:�Z��C���#N
-A�pv���k.+/JA�+�3��UmC�eE����)kSw �H�D
MB���ԇ��ly�Z<�ܺ�'��
~��:c��0�K9��.\�E�U�d��餵�|�L�<���&}'J�N�$
�}��s1

D��q
G�D���j��LSЀj�|Ȣ;��{]�ҿ��6;

-���-e0�� �tv�n'"��
��=E{H�>r�-�&��<|h�e�6_QFq�ۣ1�����ӛd
�X��ᄙr
���Ym�%��/��Y�_&;|���U�M-�f%,�l�	+��OnW�f���-�E� �t1�F>L�9l'���n�I�ry�ݞ-�O�:o�_������)������?B��X�4-#�(��/[f�
����j��&��"�YjJ�W~�qpD
-W�f
�	�AS�����.�k�

�&�/1:���v<[LF8Gc;� �
�Oц��g�-A�ϑ�X��ć�|�M=�S���H��M�[�"݂W���H
�y��f�d�^��
1�
xm�i$
\�o���UK�t��R��Ӯ+P�L*K��/AA�ۦDŽ#3TC��y��4��k�&Y�Ѧa��V���)Mgd�Y���d�e�:m��^weh�j��-u;+�_�[O�\G_k�
-dֺ���t2[?]^�k�ӹU8
�to-�X�Z�ir�=����ys�O�#�d�Z̖���H\���P5�Ȅ<��0�&�z�L�	`a�;��gMQ@���JCVc?;Df칤ϐ�
'&sx�� ��ҳ���U'ƺ;~��ǹ�Qj�(�:E<��j�j�
-4@�8\�l�\ �����I`qpS�M�C�FB?��ŹZ���d��1��P����P�S
aZ�j0
~o�i���v���
9�-�'��}? sP7M�L��L��0Y�@�޶�8�F���B�S�)t��\f
m=Ia�o�@���mGQ�8r 8ZhKzՄ���+���V4���""��ɋ��iZKl�ep �Q��Y�^��[��'J��E���8�Y��^��1���T�LHnЭ��
��T��%��C�G*�l.R	
�ep�K��-��s��UU{��XU��QVU�}�+8m��y�"K��7/������Z�ɓ*��֎�Ĭ��Vl�����E��c[�5E\V�<y��sq����ӌ��?%Ɩ�E�T�z�P��<��%��p,ϖ�U��cm����Ƅ]l�����`����B؜	�~�4î��ɰ�<>�&�:��
 0��<&�b[� G��:�ڀ8�P
%�[�̒�"��;̀����ʐ�ݮ��2$r�'vM4�+.��I���g�&.
-|�I���N�"v���ug�8�+��:�?�'�
�J��E�N�W�j���W;7�u�.�7��`~�')���
���dTN���yª0�Pk�
�贌EU
^�f�Brb(�(�V,�V��UJMX�8�BX�h7a�6Ϊ�ʵ.�z}��M��LU["i]q���$�/�h����,1v���^��b?
�)���2���$�r�Bn�EF��j\p�T�
-� �E(j�E�tGܙ�y�m�����K�<2!�k����IڬK.w���j]I'��jf����Qp
���r�1)��k���(�X��<*�
-� �.�J�Y��٥X+�I��!�;�V��J�>�{SܘS�Xjx���C�N� �;r�bmr����˱Z�,�Zb�8A�宓�(�1�q��6걞�!��
-;z�vᜫ��qAV0���!�r
�pE����&�v�Q���z� ��\��u������Y�+�R�"��0V:?Rhd�,:͂j�d�k�hZ�<�&���9�k�a��
����8�ɢ�V�E�B
���j�&��h���&��К+I��'�斐�X.O�d
��9P
�di�Αdu�$�p�L�՟�$ˑ�Q�"H�\d��Y����I����
���y��C��9���E�d1ۈ��,I���e��+I���Z��M�w^�[̰eQJE�dh���$�ӟf�U���$��cm�e��a�b;�_����,3��BS8S���O3��|"�l�q�D�P����3�y��DLI�i
-�#;I���i\՝ϒ�)ۡ�"�c���)�[<O�
�E�ʈ�,����6�r�
-6C�0���FTd�{��S�hrl�1jl}�����?K�����)��vk�C>��E
�=L��_����Կ�T����a�~�����{�W��w�o���?�`lkn
{��"�X�+�2�����N�,�ݻﲋ<%�GJ
s,�e��
�o�g�q�t
AFhF?�
�}R{3��]��� ��?J",!��^?^�ys��J��{m�
-�}ٹ�h{W��Ūط�%n.BI�^�h�
`��N
-endstream
-endobj
-15808 0 obj <<
-/Type /Page
-/Contents 15809 0 R
-/Resources 15807 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15802 0 R
-/Annots [ 15803 0 R 15804 0 R 15805 0 R 15806 0 R ]
->> endobj
-15803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 605.157 267.79 617.491]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-15804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 511.28 422.924 525.995]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-15805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 247.827 425.662 262.543]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-15806 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15810 0 obj <<
-/D [15808 0 R /XYZ 89 770.89 null]
->> endobj
-15811 0 obj <<
-/D [15808 0 R /XYZ 90 720.814 null]
->> endobj
-15812 0 obj <<
-/D [15808 0 R /XYZ 90 642.418 null]
->> endobj
-15495 0 obj <<
-/D [15808 0 R /XYZ 90 595.792 null]
->> endobj
-15813 0 obj <<
-/D [15808 0 R /XYZ 90 591.309 null]
->> endobj
-15814 0 obj <<
-/D [15808 0 R /XYZ 90 481.67 null]
->> endobj
-15815 0 obj <<
-/D [15808 0 R /XYZ 90 378.965 null]
->> endobj
-15496 0 obj <<
-/D [15808 0 R /XYZ 90 332.34 null]
->> endobj
-15816 0 obj <<
-/D [15808 0 R /XYZ 90 327.857 null]
->> endobj
-15817 0 obj <<
-/D [15808 0 R /XYZ 90 218.218 null]
->> endobj
-15818 0 obj <<
-/D [15808 0 R /XYZ 90 115.512 null]
->> endobj
-15807 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F117 2446 0 R /F7 795 0 R /F8 794 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15828 0 obj <<
-/Length 3455      
-/Filter /FlateDecode
->>
-stream
-x��[�s��_����9� ��Mә$M:I��%�&�%�SITHʎ����$(J�m�y�)\,v�	�N�&t���/���~��&Z�jr};�t�M��_��LjQ���QJ��SF���d7�1����*_V��wżʪ�w���b��y���'y����}�5c��b
!`���;$�揹�#���z�NBm���I2_�����bI�멎�|�[gMn�����Ք�Q�]�#��,�T"ѫ���~�b@�N��$I:Yl�>~��%<�vB	����
�LD�ẞ|���:�/o��t �B
0F`��
-'�9=4��CI�1a	4 ��D�~@�˷�W��1�*4�@�Mఝ�~
��rL	)Ѵ����D)�Izj��(eO�iƅ 	0:%h)��eٮ�ݻ���0aJ�&J��8����T�h9�K@�0!�b��|���iuJXz�ic
-XT�i����-�&N�SI�3!U�(�u3�y��HT���)6I�d�	���)'��b�	wT��I$}�2�p#
GHhB�v� �!��0���Xl��6�d4�=�ۯ
���b� ���ύ
-�kJ;�
�)�ء|�
�oWݬ�ڎ	�8X�
r��������孽.��n��;��*w+CPVw�?��j�� ���@�E�^���!Ϸ#�c����c�Z\�]��L�4I��H�;�Cp ���Tqp$	Q��ywm�'�Nz�GEm���&4,�����e
-�Oa��CQ��0�2n�|xD�8ﭥ�g���[�/����7��з�˨�w&�P4��
ޱc+)QR�
��*
G��)n�&>,��[lct�{�h���ъ�'���(
^>N��(=�\�	�{ܭ'Z�Z� J?T�n,\J��r��	*_�!��LR��P>^j~4^*�^����9jV�|��7�X�I�D�'��q ��)�Q�f�k�J�r�]�˛o�M~�W7��DD�˛�1Q.�`�#2.O[U?L��悄+!T������c���y�o��)����	�m�j|rM�fO���{u^����
�S@(���͘
��h�p
  ��
E�%�� @47
kp1#N9��=��!�	�C�l��=@�D�������?���'��(1��vk�a��|6�-���t���i��YA]�Jy�E�˗c�x
-��n;G���h
ł�'�^B,\���X���r�<.
�n5��(-j�м,ףd��V�SH,4���D((5�PDRl��}��g�5*��d ኉ԃʭ���� �ɇ�zW��Sä
���4�g�P=�ƶ)s��Xelr<x���
�Y�D�������|є���-r�z2_�D��[�Y�V`�?d
�:XT�>���ڗ�n� �1�2�;$����H:��/E���1tQ��RoS!U���I0BAВI�|�
C-�b>&0� ���%�(S�hH�^�[,�]�v�F�	 �|2�r�
 ��`>lW�ٶU`9
�A���
������uv��������\t�������0A_�B�
5�ɅCJ�Γ�
��ʡ`�}�vn_��8n�L�
-!�>Ąn�������6��o!Q2�
R97
r9{7 )�F��+�3!�>D�#��`
A�y`_,���B��4�g"��-dTG*�
d�L'JpJ�O�ρ쫘�l��u���*�Yz��yf"=\�SL���4��f��wC�/K{5�EZ��9p�vd�.&��پXxǑc�/��KS����	��.�:+�,Z@��<Hyv_��8v�LX�r��
�PW����y�ʰ�p_��K�jx���;TÏ�8̢Z��ʢ�O�������b=�A(1��d|q��\JӅ9�rl/��iX�S܂�T�>���
d���qh�y_�u1_c%�d��x������y|��ˢ��ߵm����UY���{4߫s��%�v���h��S�cj[P7���
�ڞ��K}s;�
�qq���q�N�W�a�>����|�o������^�"HA�ecߍ��!k�J>g�o���;!�™
W�|��ޢ����ϫ�q�-�3�����TJ�
�!�\k��
qP
 ��= �
N�ϲ��oP���~���c?�]���>���uY��'��m���nӈ�n�UK{�7Q$�3�r? _�
-��"�wt�KNn��.�n�jc���>�8��U�뾀9F
�ݩRn�'?.q��

seoM�0�'f�<\�
˸2:[��b�
-�7��
�u��^�w�P�A���ڏr�b�x��ֲ��{v������^0��
p�7W��e�
̦ʣ�4s�1Z�uSV�p���=�y�
c�-,�q=�;۾��_�J�r��N|�@W����J�����<�gBwF�~y�8g9�C�����h#7��}�|�*�j�pAY�sî��������YVS�D��}N�磑>���)��p�d�m~��O���3}����|f���
��
���Ѫ�[�lH\�1
�oo�8k�j��Ulfcƾ�z~�u��ŝg&/��qLE�G4�
�6��2-�XI�A3ڷ��^j�s�1��n�-��N��Y��*�X�u�y�vFB�+I*�-���i�
Û~G���q�
-��n����2˶A�-�
�]�3\��Sd����&@
��f�XY�:��Uyf�w���'���(��������9�&+"ekU�3t�e�T[�
(�򒽼�S<��jj�_1
UԮ
��o�|��b��.��I��䁝�
��rz�L~�����������ʆ�
E�
7ʩt4�|r{�m��$g�
�X7�w����l],o2���>O>���B.C�%�	���ÅB�m���

��,4\����}+�%����F�K��/��B���QS��q��o���
-n�N3�L�=Rs��gV�	�v<�N��Nt�����B��<N@
zGV8/
X�%g6��x'�p��.��E	���Wx���
-(*�\�����f`"!	�"<*���w�?��
�샒���0;M���~��W��LSBaR�!�R���ܛ^S��
�����<���쁜�F
�}ǎ�38�2G������ׄI]j	W\d����i�)�֏f�f�nc��tg�3��;ȓMr�Ҏ8j�i�s�n��w��mg�f��ez�
�J�X�k��ǀ�M���=D2��e�7�;��p���)`��#��k1�3vo��[���VO??��<ԜN��yg~�*	��fL�}��0B
Lug�}i�,Luq�Wm����昖D苜��h��1�9q�>���ؒ����O��]}B[� �L��iFM����l��T����鎚K��ر{o�� *�$�����g�X�+���#�󇧡޿�����Ϋ?O%���?���M�5��]
-.������C�H���L��?lQޱ�dw&{�4�wo���wu��#�%
���:t?<�d�����7m]�}x��PF���$@��^a.�$�ѿ7/�����o6|���@m�n��
-endstream
-endobj
-15827 0 obj <<
-/Type /Page
-/Contents 15828 0 R
-/Resources 15826 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15802 0 R
-/Annots [ 15819 0 R 15820 0 R 15821 0 R 15822 0 R 15823 0 R 15825 0 R ]
->> endobj
-15819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 673.894 322.446 684.798]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-15820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.409 656.27 332.425 667.174]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-15821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 552.279 116.998 563.183]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-15822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 511.083 243.45 525.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.883 343.148 361.886 355.666]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-15825 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15829 0 obj <<
-/D [15827 0 R /XYZ 89 770.89 null]
->> endobj
-15497 0 obj <<
-/D [15827 0 R /XYZ 90 721.073 null]
->> endobj
-15830 0 obj <<
-/D [15827 0 R /XYZ 90 721.073 null]
->> endobj
-15498 0 obj <<
-/D [15827 0 R /XYZ 111.798 647.468 null]
->> endobj
-15831 0 obj <<
-/D [15827 0 R /XYZ 90 641.451 null]
->> endobj
-15832 0 obj <<
-/D [15827 0 R /XYZ 90 536.388 null]
->> endobj
-15833 0 obj <<
-/D [15827 0 R /XYZ 90 277.07 null]
->> endobj
-15499 0 obj <<
-/D [15827 0 R /XYZ 90 169.876 null]
->> endobj
-15834 0 obj <<
-/D [15827 0 R /XYZ 90 165.393 null]
->> endobj
-15500 0 obj <<
-/D [15827 0 R /XYZ 448.074 84.126 null]
->> endobj
-15835 0 obj <<
-/D [15827 0 R /XYZ 90 77.486 null]
->> endobj
-15826 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15844 0 obj <<
-/Length 3182      
-/Filter /FlateDecode
->>
-stream
-x��[[��~�_���\�I�E�$�M6M�iv� �_43Nmɑ��̿�9������^�@�y�D����
J�<(�|sC�~���y�ֈAD"����aс�Q��CE����B[�"
�\������w���͛��_o|��	(b�`����3
,��;�XDv��uZ$�����
mq�8m�#���%&"�H93J鰈כմ����o�[=�r�

<���h7�H:ϛ8����X�hx���]M�	Ր/zh��G���	AT$������r'��oٌH}:�G\���wlIØ+N�d�1
���nG���zz;�t�����E6��~9˦��d⛗I��E��|�3h�a�SJ���v��qz�9.�aϦ����W��FѮ
K&�5�H���$���F�,�J�d /Z:R,l`<bl�[�M7)��2MzXІX`�,J,�l��i�/�ј�h�O��S�pܺs��4ɋ
��PUm�K���Xt��)?~⚱��ޤ�@�4Յ0]1�<�t������L]�k�X�j�O�s�|�VD���5p��
Ϸ3!�fA�����ۤw`�Ye�	�@��]�%�V�i=��GD�p�y�%H�������2�e�̋�g
�I+E�e����^����cib�5� �ܨ/��`M�
#��&�9�eu=�"�f'X]u��Ӳ��7D�F��ϛ��vs�5}���f� [...]
-�RQ$2��k�|�ͻ;'���bˀ}
-�
-j̃���aX?���{��Ǐ&�F�U9��\�a>��d�Z��

�S��]>��DC��;�ߚ,���ܤu��`��57h"�D�N"f+�-��C`Q�:��M���H�_�G��

5�3���
{�~^��I���].
���&�}o�G2
-	(�a
�޿SLsh�����0�Y#�Z\|��r���
-^���i�[+AG
dtB���3pj��"���e�J%��b�\�X-�>�kX�
����F�'$삍�/�@RYuMA�6E'�
-=i�\��}\�a/� 5��
���<&���/�Mf����
��3p����Y�w�Cp�ZB�MHv���/1i2+e��
-�i��� �'��Y���E�e��]���]l�d�ݖ�M'f���S��_f��������{�W��}c�V|��@�'q����ɤ:��,~ �:����# �B
טM��6�����+|�Ø<�W}��UJ��vqLM~L���[y��aX����M�>�	�aWD(D�ё��Y
+�j�\��[��8�+=-ր�����,��h
-C��W�a��l��ʴ� !E��M��)z��.N��K�X}�MC��-p
-�3�&���Q�vG���ő�l�Zdm�ޮ��
��z�>`V��5߮K:�o���
��L���
��e���2��6c,j�pv?�Qf��X�(���4+*���R~ݭa�7�©
Z.���pS��\�2H�e���l�N��x/ЌI�S,��G��0��ho�p;ڳmc��dV��T�v��:OW��&�i=��
�m�گ%��+���z/墿�\K��1"'ٚ��{�i �L�k��)�f=�56J�@B�I!/t���f�w$�:!u����A�]�ޞ�'���3�<�V挀��/��q
���I©
-D�x�p$8�f/� \�`=�	h��Ï��/���<nא�
|N%�T\u��
� �]��sh�m� ���=eޒ'^ŗ}�.ND]޼�*Iʎ�{4�u9���c�Զmڀ��'�/��`�g����,��ܯB�*{]�<��8 =��6eM�-��4�9-75���rSf���Z���SSt�BMQb��5��J%v��J�?wː�
/*��~�*f���v��Eۥ�
-CT�C����~�c����T
Q��!"{_c�ð��^�-k�a���
��IE��G��Nxi�_5RqԨk��cb1�8���
Ed���ˠF��`���Q���;��03���J�3k�\#��#�c0m{�D8|�$+���? *��)�c��d`�@�,��J\�):��:ZZ�
-U�[����d0�
-�`���8`�)	���K�7�[e�y$���>a�ʬ�L1��8
vp:>n�\�Ɂ����S
�� ����j
��ɦ|�#n���qf�
-#
9/�[-z��2�FXXt� ������A�y
�?"
!u�=wA�ԇ�� �e��q2��y�X;UI�nk�WY
�^�q#�����8���^/þ:E�K��\
������	�J��
���x�ߵ��Ȅ�À���60JUZ#'�w,��o�o K���6��V� @���7�TX�HE_!b�Z��A|��:�ic|8�^�cK�v�[�:�Jŋ����r��#Ez=|�"]��W$��5�>n��L�r��BfzU�ōS)�i4÷ �7���>K�[B���
Z�4 ���:�Cj�ϑw �#
柧Y��i5��d���������t��詃

�
66��5�:���V��R
�2 wb?r�1_;�;��$p/<)�2|n�+����V7�c�V�(�	�������F\�
�K�esN�*~��9�$QF^�2�h:��,'�_�^^S��\�,x"��V.��:C����3��u��X��g��~�8��j�4_f��������O#�a�wr�= [...]
-��L|�1����W'8��
�����\��
-���7�n��@7����
>��C�����uVv!�)>�&�/�}��ϡ�k��;���_}�#�B
I
{�~��ݲMF���A�0<D�S�ٽ�L
��o[
n'*rU�_��Pf
j�g�1�)^�[���R V��qM0x6
ۯ�79
̷�6�	���~������GJ9����L�����+��j�����B@���}u���Ul���	M��S��OE���~=�>�q�H�;�V���Q�Dl
|�N��[&и./�t��X\U�
-endstream
-endobj
-15843 0 obj <<
-/Type /Page
-/Contents 15844 0 R
-/Resources 15842 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15802 0 R
-/Annots [ 15824 0 R 15836 0 R 15837 0 R 15838 0 R 15839 0 R 15851 0 R 15840 0 R 15841 0 R ]
->> endobj
-15824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.187 661.939 399.221 672.843]
-/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
->> endobj
-15836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.22 428.518 330.187 439.422]
-/A << /S /GoTo /D (index_BGP99) >>
->> endobj
-15837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.562 428.518 391.059 439.422]
-/A << /S /GoTo /D (index_BHZ03b) >>
->> endobj
-15838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.268 360.393 343.546 371.297]
-/A << /S /GoTo /D (index_pps_certificate_widening) >>
->> endobj
-15839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.153 98.623 513.996 109.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-15851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 87.644 155.195 97.571]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
->> endobj
-15840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.482 87.644 232.115 97.571]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
->> endobj
-15841 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15845 0 obj <<
-/D [15843 0 R /XYZ 89 770.89 null]
->> endobj
-15846 0 obj <<
-/D [15843 0 R /XYZ 90 634.093 null]
->> endobj
-15847 0 obj <<
-/D [15843 0 R /XYZ 90 483.966 null]
->> endobj
-15501 0 obj <<
-/D [15843 0 R /XYZ 395.641 431.672 null]
->> endobj
-15848 0 obj <<
-/D [15843 0 R /XYZ 90 425.032 null]
->> endobj
-15849 0 obj <<
-/D [15843 0 R /XYZ 90 332.547 null]
->> endobj
-15850 0 obj <<
-/D [15843 0 R /XYZ 90 206.729 null]
->> endobj
-15546 0 obj <<
-/D [15843 0 R /XYZ 90 77.486 null]
->> endobj
-15842 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15861 0 obj <<
-/Length 2752      
-/Filter /FlateDecode
->>
-stream
-x��[Yo��~���S"q���YH63�l6�3���da�ms#QZ�
��}��gSMꢳ`^L�jVW��U�'�<���/�W��d$��ۇ���
�-&��#ef�c<��<��Utw3�x�^�>ŋ,��!�Ϣ��������6��5���8���n��zOHk3�(�B+n�o�%
?�?e�Zq���m��B
�d���̷�h��]R���3C��j����!~����8��-�)�
-�,ыw��\ �'��@JO櫋O?��n?��=yq�VN\�������ԁa?�K����GlT���C^�+	MQ�#P��B��jA����heO�d�t%��#]�&pX��yF9��"��
nt9�5a���C���b�ǚ.�H���#D���,��\_���
Ԓ����q��DХ�C6C�Ѧ��]���!L�#E*�����I���X��%r
-,m�*�A\�F�IZ)$��#hL�y-C��=v�P�]EB��
Y3� a��9A.�i��ī�{��

x,H
EO��I����؄��s`/T�f�J���"�j}��)�k<��@F�EeHj
+Y�ŭ�C��U� >�Q|D�"@�H���^T2�d�`	s��($�y�ۭ;���,�>/��sb%��t}�GI/�����u�^m��$},���M�d/�6.�l=/{,]��w�O��/жE�Ԋ�]�h�T|Z$۟��y�\?c7ƒ�"u${I� ;��D��Η�hU�
-�R��1�W���Ӟ�:y��h�L#Ʉ�:u�R_S�o:ue�
-8�ρ�E4���
\WbqN�""�d��%{�M4&L
��m)H�o�HVq���
�4��C��9FY�/����J���#����5�(����Q8Fc{����J�T�S*M�?q�բ�LoU��n�y����nX-���䐷�p|��j JQ,D׸��q��s
�Iq�^�����������������zC�m)"�W��A[�Յk�d
��B�F�'B$-
����'1")�<��	$)C���mmlq�F5=y~���TN���-����y��`S�b�NN(�[��f�/�<�Y�a
-�G�
�[
��[�i�'S<���8�1�@$ץ��2�7�������dߵ4�"���o �a2lPҡJ�J��c-��>�
���œ��A(�@�(�9+�q�����1��e���������#6z�9Ҙ�yN8
�
�bm"��A}@�
���;��S��Q1}qU3�&��
-���z
HO������c�e�ڒ
-��o%�P���-W��Ն��@	
���TJj���,&EZ�>�-����-&�5�����H��苝
�y������H��ƌg���	���*c����ZO���S
*f�������S��p:PP�%a_
-yCC4���㘄"H��-�n��6X�:��Y]���Y��eF�Q��͗��1
��ʼn��d�
�s���q�û��#W��f�
��qiK����QޡP��j �"�TU�Sd]�࠳A(�p�� �j^�:˽c+�<��<U�
�m.l�*tt�� DsfFMFo@�!W�@H��B���H��kI�`��o!�a�1OZ���Q+�:p�z�N�W��
B��
{J�i��M�:)��1���
-���%�������%�
)O�n�˩"�����܋)�M0Dv0�yCL�p?�p
�S*S���C�Y��>��a�hF��4O�e ������zrVG�IfH|M��C�:��'SH�#�4 �/)dD̈�i%�?`J�Oށޫh��:�A#LN�M�gaP!݀k1*��d�rj��b�]���������&�5
ж���ve���	�:Wg��əC�u8=#�q��
dF��Z7�@h""�R�#`�5R��8�t�o��K{A�V��z
G��:��9G�eeN���C)�b:����Ǹ"�ܮ��7�îS� w��N�o�����(ך����o���AڗM��F�������rpar^��(�!d�$W�	���R�0�ߵ
:��Shv�=�Pf�;��x���AѦ�{lga2��o-a�jB�s�o
j߆��`Rw��� ě��&���`?���Ҷ_;��e�b�ysL
O����r�l��sg�
ΞG��F��{�8���4w��>J�S�Z�����#8r���m�7��U8kZ�7,�,���⏇̉O?x�� I.蘶76���@� �(�Q^kkM�ͱ������"lym.j�K�W�U7������x0w���N?G�ځ$6zLC:��q/

-�:�oK(`a�Fm���» H���۶H�ӷ�Wb�h}�1OZ�m;G=�o��m���\R��u���u�Mh�:t�W{@�{`��t]�;��x�a��tNg�������`�t������C�A��Oy%�$��3��Te����]�e3.���0���DQy�/���j��s_Ƭ���Ʌ������
�
W[��֠�R/�Wp��N���
->��\_���\Y80��
ا�B�rSmH��|��|a��r�f��T7t��tg}���l}���%P�	v�h�tS�	@pܷ
-O&X^=b��e���ae�d,y�n�B��>������m��~&����?���[Z%��5)� �X4��G店��
��3�>�����"8�
�=��������q
1�׫][i�ô�mU�Z���zg
n����j���

�N�J �_@}�(E݊�g�c�`y��o+6���h�>C�L
-endstream
-endobj
-15860 0 obj <<
-/Type /Page
-/Contents 15861 0 R
-/Resources 15859 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15802 0 R
-/Annots [ 15852 0 R 15853 0 R 15854 0 R 15855 0 R 15856 0 R 15858 0 R ]
->> endobj
-15852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.559 656.27 345.883 667.174]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-15853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 546.949 243.45 560.896]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 494.689 485.603 507.207]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.42 271.021 272.524 281.925]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5c5da855445b7c877a626d824dfce64e) >>
->> endobj
-15856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 83.303 379.76 95.637]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afed62d6b4c6cd06a08a49942907135bb) >>
->> endobj
-15858 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15862 0 obj <<
-/D [15860 0 R /XYZ 89 770.89 null]
->> endobj
-15863 0 obj <<
-/D [15860 0 R /XYZ 90 721.073 null]
->> endobj
-15547 0 obj <<
-/D [15860 0 R /XYZ 134.214 647.468 null]
->> endobj
-15864 0 obj <<
-/D [15860 0 R /XYZ 90 640.828 null]
->> endobj
-15865 0 obj <<
-/D [15860 0 R /XYZ 90 572.254 null]
->> endobj
-15866 0 obj <<
-/D [15860 0 R /XYZ 90 518.565 null]
->> endobj
-15548 0 obj <<
-/D [15860 0 R /XYZ 90 471.94 null]
->> endobj
-15867 0 obj <<
-/D [15860 0 R /XYZ 90 467.457 null]
->> endobj
-15868 0 obj <<
-/D [15860 0 R /XYZ 90 394.594 null]
->> endobj
-15549 0 obj <<
-/D [15860 0 R /XYZ 90 359.924 null]
->> endobj
-15869 0 obj <<
-/D [15860 0 R /XYZ 90 355.44 null]
->> endobj
-15550 0 obj <<
-/D [15860 0 R /XYZ 277.106 274.174 null]
->> endobj
-15870 0 obj <<
-/D [15860 0 R /XYZ 90 267.534 null]
->> endobj
-15871 0 obj <<
-/D [15860 0 R /XYZ 90 198.96 null]
->> endobj
-15872 0 obj <<
-/D [15860 0 R /XYZ 90 132.917 null]
->> endobj
-15859 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15880 0 obj <<
-/Length 2874      
-/Filter /FlateDecode
->>
-stream
-x��[ms����_�O.95����f<�&�'�����L��x �X��LR������ )��6�
@఻���޳{'���p�����'O�+�d$���Ufp��AB¯i�z$�
�9�1cR#b$|�
�ןϟ�|~fߝ<;?�pB�Έ ��������M��F����5�g�2��dg';�M[$n�B"�����j{��f$/��'�̷Q�ц#�I�fs=[�6�.*�fe��|=�P�F������ټX�g˅���?�I�ʯ	�L(�?
O����:!

!�Բ&L��S�P7�a��v8�3�vP�/�	Q�4�eӏ�*� �'�0
z�
H,I=��'� 6�ys],��p��1���Lk	��	�Y��vfL��h�M�<#�oX;cB
y̝�)�z��//N���}1&b�������~V���eb�f���<a�F\V�Xc*F�ޞr�඲t�p��3������%@G6SM�?�I��HBA���t<!R���KB C���]��ymz�{p�Z��`�m�
�m-��k�#�
D������j��aV�$_#�u���2�!A�e`�hS�oo�Mj�h�NU*��-"

-)^�b���X�s�7&G��'dJ2+4?M�
+�ǔ���2�5W0����ī1��|5�߾S<Z�|�.�������*_}>=��g�ͺ؄6���bR�c�kC��ahGo'�s���(h<��d��������t{��#�U&�@�о�bL� ��7
(�Da�tW���@bè5@l��� �&���	rt	�6	 ( ����cC ���X�=+�4R,1���Q9^*��>�);��	(D�4 %�A�f�3-�)
)���$Z$Za���0����y@�ڇ}��,~�Z�V
�E�&[��S
W� �WrS͑��
K|��[�w�#�x�x�(��x �#_A4�0�d��%�������}�&�&����˂%���M�_V"x�d�$Y��YR	�n���	��i	ĄS�I���]
#���#���wi����9�P���,���ٯ Ҝ�mj���Wq�	3�r�Z���b:[���m�	W���`��?��NH�p]'�H�؀
\���� [...]
�0�`Z�a�}�,n7e�ֽ\�0	�`1���
-�>�'���3CPS�p<���D�YC�{i%�"�X�Ux 
HJAi�K�7��S�J
�Zw3�����ѻ;�`;��
ĭ�'��C�
e
�+�z:ڪ��0����j�J6
h`��z
�OS�
�+�)\�b�tc������-��,�;�(���* ��\v��H�r��9�N�rQ�G.���PL� �A
&�LDva1
-�{���&�-�i+�Qiv��KO�oo�Ci
��8R��al�7����~@*&1=��

3��#BIw��\G,2Y=� ixO�\#M�0�׵0_
&��p�[
f�+r@]�Z�v�Ϲ��u��*���pu]��~N[���cT*q�b�y�
@�
��9 �
Z���iw����,t4�u�ܸ�Iq���PG�R�@|k�2�h��������,��,	��r��	hπ�V.�Ó��]~��%��lUM
�Mֹ�B��z7`(V����r�̃/��E�
-]I�ib��'����n��
�pH�[5�}�؞,8
��u����AU�|U���>�N���@U���0 �O�:h���E{�fr�,F�C�@�Cu��jV,��&��b�o~)l�>�x~��
I��~y���㺫h6���D��+��5�� =�X�
�XTq��ٴX�T�E��.���5g�:5�
MK�DQ*K���;ԛ��0��.v�+`�J.v��so]��f� ���
d/\�~��K(�B;��ܞ tFJWŕ�Q�
���!�O�GOO��� �n�ӹ�fk�Vd����-Jx
&� ���豿����(�	3�"�0��� ڛ	Шf���H`$$ٖg�[Z!��ʇ�7��D ��m:���oC���徜��׼�\/�|�����U
����
 ȷl�������
Tw\���0+���u@��Ô� S!^��� �U:=Ҍd�42�*���Wm��&v��� �A�p��EI�A�a���K�.�8
-w�������;��Y*�%�ѝ�	t���l>��]uf�mN\�G-���b7v�fI�B��@}t��H���"Y
Pǐ '�2a�Kh��v�" 3��Qe�{G
-"ʊ9Q���\4�;V%L	,iSe`0�b0b#����&c���ͤ���t�
�
��� �@\Be�u���
^��?N
� �$��ѫ�p�>�!l>P!�r���=�BY
�9��i��bmS����&����pi
\��O���`�'����!T .7��#�H�Ȏ�@�D�^l���v0��c䐐Z��
���2/�N��r�^�u��H3���̨�b�*���b��@h���m���
ޓΑ�"y�i��t�ĝ�ܝZ�˄��^
-v�st��]�O�k���P��n�-�
��,�5u�U���R��qT6U�+#	�JR|bQ�� )>���M�P
R�H��#�7�
A �7�t� �!�o����5���w�(R���/���B¸M��
-Ψ{ټw/�oƒ'?�Y�����& oR
,i���Yr�
5t=��Y��W/������c!F�j�|��T��E�G;�Ū�gH��up8vV���ޮ���?�8�7�
��?�n6��O�\ܽ[�*\.��Ŗ�cc`nW��
 �9�rU��x8�+7���ߖW��
-endstream
-endobj
-15879 0 obj <<
-/Type /Page
-/Contents 15880 0 R
-/Resources 15878 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15802 0 R
-/Annots [ 15857 0 R 15874 0 R 15875 0 R 15885 0 R 15876 0 R 15877 0 R ]
->> endobj
-15857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 696.002 182.164 706.906]
-/A << /S /GoTo /D (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) >>
->> endobj
-15874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 598.636 243.45 612.584]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 522.068 535.938 534.586]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 508.683 226.824 521.016]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-15876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 454.63 362.844 465.698]
-/A << /S /GoTo /D (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) >>
->> endobj
-15877 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15881 0 obj <<
-/D [15879 0 R /XYZ 89 770.89 null]
->> endobj
-15551 0 obj <<
-/D [15879 0 R /XYZ 400.69 699.155 null]
->> endobj
-15882 0 obj <<
-/D [15879 0 R /XYZ 90 692.515 null]
->> endobj
-15883 0 obj <<
-/D [15879 0 R /XYZ 90 623.941 null]
->> endobj
-15884 0 obj <<
-/D [15879 0 R /XYZ 90 545.943 null]
->> endobj
-15886 0 obj <<
-/D [15879 0 R /XYZ 90 441.056 null]
->> endobj
-15552 0 obj <<
-/D [15879 0 R /XYZ 90 418.68 null]
->> endobj
-15887 0 obj <<
-/D [15879 0 R /XYZ 90 418.68 null]
->> endobj
-15888 0 obj <<
-/D [15879 0 R /XYZ 90 348.133 null]
->> endobj
-15553 0 obj <<
-/D [15879 0 R /XYZ 90 313.463 null]
->> endobj
-15889 0 obj <<
-/D [15879 0 R /XYZ 90 308.98 null]
->> endobj
-15890 0 obj <<
-/D [15879 0 R /XYZ 90 226.294 null]
->> endobj
-15891 0 obj <<
-/D [15879 0 R /XYZ 90 159.664 null]
->> endobj
-15892 0 obj <<
-/D [15879 0 R /XYZ 90 123.439 null]
->> endobj
-15601 0 obj <<
-/D [15879 0 R /XYZ 90 77.486 null]
->> endobj
-15893 0 obj <<
-/D [15879 0 R /XYZ 90 77.486 null]
->> endobj
-15878 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15902 0 obj <<
-/Length 2745      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�8��W�+UE0ޏ��
&;Ie6��$�S&�b$��$*$����m A� �<\��J�`��F���FT,���{v��#�������b
���rqy�0x��AB��v�fI0Rf�&��Ŋ�eR�w+�����M�-�w/��ER||��5g��L+��~�.-�a�����t��".�R��wץ��O�iz\���2&G!�[1?̊y�K�r��//W�.��q�T�ky�^�Ŋ�ez�@є,6V��O�g���
�L%�ҋ����[��B��`bf���_p���n����3�[��� �o{BL-�
q$���F��P
-I�v��VH�C��
�����cF�1MF�ɴ
-��V���o��rE��.9�7��


YA'��O�
�� fj�}ǜ�#j��I�
id�N��h:��(2�5�ip�5����
T
�1C���xv�D��|��0k�t��'�(�;
A��ӛ"��}[�ZQ�OeW��^�ŚRD�v_}}WCӱ�
B5�k���Ʉ�������I���|0���j� 7�^�
��
a�LD�c^>d�33�
��xam���>~|L�""
�]*9�
Y�JR,c�C����@1L�����^��� ?�뎵j�ƌ�f�R}/�w�!M��y��`$g�h>�\(2ڴ��~B!|�he{�a�0��e�U�
-�O;|^s!���PV��^��)� F#ڂ��Ql}	Ҹ���%
�tj��" l�`y�H[��P�8s� �cPG
�0�0u�Q��1�T��#�%T��#��z�c}L�q�&!���E}#	D� <���
�1Qe��oe�����T�[Cv�^�M-�l� Uٍ�uu{�87�oEZ���K����[#F3³5_1�Y~�5��e ��?M�`��C`�ܫiy���_\{
x��l�f-m���n��1
)P����E
 ���s�EF�Ҷ�F�Z��ҬV2�����E�r�ȶcy���Q�$����EJ� �?��(Ez����@WYQV58G,d��l�� V���{�m���0k&s��6FCJ�ID���߆V��ƖJ���3L4oT�
(Ԏ7��L�"?�E�����S��y;V�+�.ݧ��-)TwY�߶Y��u~�鰍5_�>bE[q+���S���\��BT`o H�K��Ve�d�o���Ǩ�
-��O�Q��� �X��u�C�F����`��)��Դ�v��� �i1��
��dB��Dt�7�P�
�D`^�����
-)�s�Ez��
�Iz��<�q¢-��"�X��\��n�r
-- (����b����!y��{�����YZ0��ӑ��ȶ����P{�8�l؃R���C�m��C G�R��=59

f��Z�3���
e]ppu&��.h(�!r�("��<{���/��[
Ƅ���5W`s�
8�1�!ڌ�ck�P��>mv�0�O(v�|�L�f�-;8��!��0�P���%���o5�5���k|RLOx��$T՘�7A��_`\�k�/R��
;N�剒��A

-E�lm�]
�����uQ�Q(v㉧�B�h��U�+<��b��)E�t6'ԣzƸ���jc6
��h	��G���­ewn%<�sF�6ew ьL�]��?B�������]C� �- z;�'�;0R�'�;=Ʊ,�vw����
-a�=���)��S:OE�[W��γ&U��4%�M5ucs�u��Հ�dT�J��
-���M.�����v����&��D �&��\ev���4#,V0���l�5j;��
�ࠓ >F���C4�Ә�
-n昵�~�Ft�u�\3khw��
�����fǬ������C����6�<ʬ%�z&���a�lK
-��Rg�0�;w�4�,f������F���0�
�����A���
iH�H��C`$�!0R�!�pU�T�M\�uU*���.�j���x��V%Y�,�e�\

(LV�ņ�q>X첂P�6�2���O��~aR��8�"������	�;!�����Ā���J-oҍ
�?�s<j8$x��vۜ}��[	R�Zg�%��g,�9u
�R�sͤ���*�!��&J�u}l9C�!��:�Mއh�!�ep�C��UoD�L{���<��-xEX������P��dۢ���nbh?sd��@"���t�R
�y�Xy

���
-��ML�s���
o�ip����:G�S:����VF|� F��F������=�i
-��ey�w�Kۃ���� 1t�q�>��i�4���޲[q�k��r#�� �o� ��7Y��,wy镂�̝��0�jmϗ/�8>��SFOk�㼤�Տ�[�a�E�Wu���?������5����Dy�0{G

F���6�
�����
-yƊ"\}�3�X����X�i��`5�-�qK{���ZA����n�[QX�[*ܸ%?� |�!h�o����oC>YAa�\�eAg�4 j�p'\kK+���ډW����o�ׅ 4񫚄�g�n����]ϦS׳�왬���ٴw=�M\Ϧa��
L�`fG���ق�>ϱ��x��gs)�;z��gb�4��JH�e��P�u(��=D���
lk|�iO�..^���i�W����ſ��m�kN���nْ���UZ3X��iS�;��X4O�tgAw?���MU
�����.��5ڸ
�~�ߙ�=lk]兯_�=���}����4��Q`R{����w�����拾����-������E�/l(��
-endstream
-endobj
-15901 0 obj <<
-/Type /Page
-/Contents 15902 0 R
-/Resources 15900 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15914 0 R
-/Annots [ 15894 0 R 15905 0 R 15895 0 R 15896 0 R 15907 0 R 15897 0 R 15898 0 R 15909 0 R 15899 0 R ]
->> endobj
-15894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [463.555 600.1 513.996 611.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 588.767 144.794 599.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.551 588.767 236.229 599.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.228 432.28 513.996 443.184]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 422.092 138.817 431.229]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
->> endobj
-15897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.573 422.092 170.476 431.229]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-15898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.655 203.644 513.996 232.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [106.717 191.689 159.628 202.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-15899 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15903 0 obj <<
-/D [15901 0 R /XYZ 89 770.89 null]
->> endobj
-15602 0 obj <<
-/D [15901 0 R /XYZ 90 674.891 null]
->> endobj
-15904 0 obj <<
-/D [15901 0 R /XYZ 90 670.407 null]
->> endobj
-15603 0 obj <<
-/D [15901 0 R /XYZ 90 507.071 null]
->> endobj
-15906 0 obj <<
-/D [15901 0 R /XYZ 90 502.588 null]
->> endobj
-15604 0 obj <<
-/D [15901 0 R /XYZ 90 305.388 null]
->> endobj
-15908 0 obj <<
-/D [15901 0 R /XYZ 90 300.905 null]
->> endobj
-15910 0 obj <<
-/D [15901 0 R /XYZ 90 179.615 null]
->> endobj
-15605 0 obj <<
-/D [15901 0 R /XYZ 90 145.612 null]
->> endobj
-15911 0 obj <<
-/D [15901 0 R /XYZ 90 145.612 null]
->> endobj
-15912 0 obj <<
-/D [15901 0 R /XYZ 90 111.549 null]
->> endobj
-15913 0 obj <<
-/D [15901 0 R /XYZ 90 77.486 null]
->> endobj
-15900 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15948 0 obj <<
-/Length 1803      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~���0 ���!)���v��5Coi�x�CZ��$Zeɑ���;Iٲ���$Z"����e�(s�
�.������Ao�0�E�rgp�D�	�1�F��>
�8>�D
Vշ>

^

NճޫA�G�v��P(��w�	;#��6�#��֓�N@}���i�
niVk2���;���P�O0�n%Ǔ4��Re��͗
-�HH��/�������Df�Xz}�3���ՠC&���o���!4��3�j��?���C�O�:�ڲj�8sw��p�!��L�b7O���չ�����nth���hI����&GGFl:����#�ͳn�a4�Vm�.��}`
�
��uĘ^�&���U��Q�y!��FQ$��l��0aLjQ��;�M���UR%�Z}J��3����a����Y#R�v�ˇ���6���vL���N�\2cHv�M�`�a�� ��)koNi��B*?}��mC��!o�D��L�D����K��ivG�p:�Y���˼Ѓ�:)�h�ƥ�*Z��Ǖ�d�T0+�|l�J+,Ms�2�6ɮ��TTQ�
P�!�#cJY{�Y�A �LRt}���bQmQMGZ����C
 A�6�<"p�b
w0�q$�p8	������>b"\a�
�� �dq
X��)x�G�[{d�
����1�
�R�]rQ(��lQ�UB
-��K��mUt0Z�4��miSyD{��?M�80$�ቼ�BW2��΅k�} ��K�U��ï
Y�Ji~��21��Ή�Q�y
^���oC����d�t:�ʫ�;��l���j����� �q�ʥ].�`�(D��|(5̟^�u�d���^�/d�LJ�l�LV��~����A�`}������<S�*�
�N�Y���a�����ɲ

���
�;��
-PS�
�EC & Ϙ�"��	�Un-�V�jv�*J��0EIK>��h;16L�����kCC�.O�l���R
�bA $��E�T��.��S�bU5J��ޕ�"!
�N��|8k���c26�k�|*�;짼�>
����͐%"B!�@#�
`'���rQ�D)�G�aC��`+6��̛r��$���a`Z�r�C
���
V>Q�[n��pQa�`������lC��8
-7��Ee�Z�� Y�ŀE��p
��
���萵3��
cn15uAr����,�5�V	�9DQ�}�-Xq�&���v�E7U�l��� 
l
�o����P���Zi���$�@Ċ�$V�B�ұX�(�Y�jw�mP+����u�d�ߩ��Nz������
W�sY�Iu���ou7�����:�,23�U���"���~?�Ւ�|�����o,Z����
��ҝ4
�Φl�a�%�+�쿜5}�Jw5�⪳���� �<"�*ɰ����:�V�wG��Z
���Ү�aU`�q���=�jS���&J���Ŀ�32u�X���V�|P��L��b�\��jsW�����D���� ������5g��(��rn-K�?
���c[u��]�'ZA�A��}�Oy���K����5�z���8���v����2?auI!
�k����<�?c]%C(����f�|�Sy_"�Ŗ�K����3�P{
�K�()v}c�����/Pn�O������i`aa"��6��� [...]
-endstream
-endobj
-15947 0 obj <<
-/Type /Page
-/Contents 15948 0 R
-/Resources 15946 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15914 0 R
-/Annots [ 15915 0 R 15916 0 R 15917 0 R 15918 0 R 15919 0 R 15920 0 R 15921 0 R 15922 0 R 15923 0 R 15924 0 R 15925 0 R 15926 0 R 15927 0 R 15928 0 R 15929 0 R 15930 0 R 15931 0 R 15932 0 R 15933 0 R 15934 0 R 15935 0 R 15936 0 R 15937 0 R 15938 0 R 15939 0 R 15940 0 R 15945 0 R ]
->> endobj
-15915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 517.832 181.845 528.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa4b60ce3ac62aee15faac1b5035fdb4d) >>
->> endobj
-15916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 490.099 181.845 501.003]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab92b75d150bd5fbfc03cadec75d59e0f) >>
->> endobj
-15917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 462.367 154.727 473.27]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a4cc725a9fe3bdaded2c131bb8bb47ed8) >>
->> endobj
-15918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 434.634 165.446 445.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa317e5d2d782c3589c48cb3b45d6790d) >>
->> endobj
-15919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.784 434.634 273.381 445.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 407.274 150.493 417.805]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a80b9d602f99df76039d58032b20041d7) >>
->> endobj
-15921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 337.333 218.029 348.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 337.333 250.965 348.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a553ae81ae234cedad36e72b32c967e65) >>
->> endobj
-15923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 309.6 218.029 320.504]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 309.6 262.043 320.504]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a62827195c6aeacf38a8fb3df6df8ff2e) >>
->> endobj
-15925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 281.867 218.029 292.771]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 281.867 290.804 292.771]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a9f09728ae53c8e3dadeb202f28bb6fdb) >>
->> endobj
-15927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 254.134 218.029 265.038]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 254.134 266.456 265.038]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a1dd09c87a931132dbee52ea24266866a) >>
->> endobj
-15929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 226.402 218.029 237.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 226.402 255.378 237.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ac8b0d22ea3470020b35240f778c34a94) >>
->> endobj
-15931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 129.799 180.54 140.703]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e) >>
->> endobj
-15932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 129.799 288.474 140.703]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.207 129.799 410.804 140.703]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 102.066 178.239 112.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af7184f692efc0672e3213f6be9d5cf4c) >>
->> endobj
-15935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 102.066 286.173 112.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.906 102.066 408.503 112.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 194.507 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.005 74.333 245.695 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) >>
->> endobj
-15939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.032 74.333 353.629 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.362 74.333 475.959 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15945 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15949 0 obj <<
-/D [15947 0 R /XYZ 89 770.89 null]
->> endobj
-1952 0 obj <<
-/D [15947 0 R /XYZ 90 641.976 null]
->> endobj
-454 0 obj <<
-/D [15947 0 R /XYZ 90 635.124 null]
->> endobj
-15950 0 obj <<
-/D [15947 0 R /XYZ 90 536.745 null]
->> endobj
-15951 0 obj <<
-/D [15947 0 R /XYZ 90 536.745 null]
->> endobj
-15952 0 obj <<
-/D [15947 0 R /XYZ 90 507.278 null]
->> endobj
-15953 0 obj <<
-/D [15947 0 R /XYZ 90 479.545 null]
->> endobj
-15954 0 obj <<
-/D [15947 0 R /XYZ 90 451.812 null]
->> endobj
-15955 0 obj <<
-/D [15947 0 R /XYZ 90 424.079 null]
->> endobj
-15956 0 obj <<
-/D [15947 0 R /XYZ 90 356.161 null]
->> endobj
-15957 0 obj <<
-/D [15947 0 R /XYZ 90 356.161 null]
->> endobj
-15958 0 obj <<
-/D [15947 0 R /XYZ 90 326.779 null]
->> endobj
-15959 0 obj <<
-/D [15947 0 R /XYZ 90 299.046 null]
->> endobj
-15960 0 obj <<
-/D [15947 0 R /XYZ 90 271.313 null]
->> endobj
-15961 0 obj <<
-/D [15947 0 R /XYZ 90 243.58 null]
->> endobj
-15962 0 obj <<
-/D [15947 0 R /XYZ 90 175.746 null]
->> endobj
-15946 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-15985 0 obj <<
-/Length 1551      
-/Filter /FlateDecode
->>
-stream
-x��ZMs�6��W�W�)a|��$�6�3Mө�������$��H�����wI�)Jn�L��"� �]�{
<@����΋�O��SŜ �J�|��Q<@B��Թ�|�zc<>s	
��"�<s)
���f���*
�ۓ[|�,M._�8̣4q=*��Y
�V��k=әK��N&��>����_�~>}p;�rF �;����=v�P�����sS6Z8�2��Λ�#l�ս��
���8%/�Ih���(B!�Pߺ��#
O�����n��<��qU0I���ɤ
]:+�?>%7m��P�A����M�
�$%�A�L{�H�F�=��|[��0ځ�J�@�#�G>t��(��+�(����gs��#���2<K��y���Z�����Un*��3l�4:�����tx
��Hmx[8P�$��(;X����B7Q~m*����m5�6�R�7���073�������4J����CFʁ�r
�V���$]���G��nHgFѰL0CS��'CnB~`�L�qeuh�e�r�
|�y�&���|�68qp��� ���rxL��4���O�������o+.�
/(GG�
Z=���"��(*�K93v��yL 

=��Q��u
F����ԇ��$��w�v�H\�\(0\?��t�һW:���<��ei�mS�f}�,�����KZK6��"# &����X/tb�AC��j��7ly�Q�0<�j�9�"���	p�11 ���h��
-��.���0�dAˉz�����Q�Z���)�z���ǝ���[�п��R3>x#7��#+WT�	�FsA:��P��Fvm��}�����w�741މf�2F@
-`=R)s�U��T-�#

-�B`[W���8[vG�g�$��T��F	D��ޭet�
���Z��
�+�	�@'�f�Y�6����:r�,~�X�_ at h��bb��ڄ�
�Ӧ$)�-��v�3�W����w�I��|��
�]`���m��
v�
#,�#��=������D��4��4�G3�����Q>RD|��-ԤD
�A\�=r��=��h@�
�!�
t��T�O"��
IV(�@�_�(�amz�u��r��Ϲ_�'y�\��w�Đ
��L61�Y:� �����y
-S�o��tY���~��C�^{=l�
-����-�fb^�:��w��H����>  ��������d pv��	P�
p|?a�G�(��*�<<�)��|Ԇ_�6��
-�
���B⿠����RF�I�?(Yh�,�?^��ˍ6ؾ���G�g�݆�IF�>�����%
S�|�δq@�,���;�T����ʢ k�t���M�=�y��`�6��Y�.:R|��qZ�o�d�sjLc}�>%�Ǿ�/���Y.ct}ݪ�~� a�����B���l�c
-]p3U7\gg���?W:���f&�����8�\�X��V���
L��1������;���Q	y�K�XM��<_�
_��+���"~��8`��
�����
-%��~�a�K-���H at 0?�\�A�ӲE󾬴/���_�y�B��<�h��
-endstream
-endobj
-15984 0 obj <<
-/Type /Page
-/Contents 15985 0 R
-/Resources 15983 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15914 0 R
-/Annots [ 15941 0 R 15942 0 R 15943 0 R 15944 0 R 15966 0 R 15967 0 R 15968 0 R 15969 0 R 15970 0 R 15971 0 R 15972 0 R 15973 0 R 15974 0 R 15975 0 R 15976 0 R 15977 0 R 15978 0 R 15979 0 R 15980 0 R 15981 0 R 15982 0 R ]
->> endobj
-15941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 693.715 194.507 704.619]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.005 693.715 233.312 704.619]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab9da0d811233cfb64481a7fe08b7f645) >>
->> endobj
-15943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.649 693.715 341.246 704.619]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.979 693.715 463.576 704.619]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 663.238 226.034 674.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af00b427f47054a80d236d124443c580c) >>
->> endobj
-15967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 663.238 401.773 674.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 632.761 180.54 643.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e) >>
->> endobj
-15969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 632.761 288.474 643.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.207 632.761 410.804 643.665]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 618.519 178.239 629.423]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af7184f692efc0672e3213f6be9d5cf4c) >>
->> endobj
-15972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 618.519 286.173 629.423]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.906 618.519 408.503 629.423]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 604.276 194.507 615.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.005 604.276 245.695 615.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) >>
->> endobj
-15976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.032 604.276 353.629 615.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.362 604.276 475.959 615.18]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 590.034 194.507 600.938]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.005 590.034 233.312 600.938]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab9da0d811233cfb64481a7fe08b7f645) >>
->> endobj
-15980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.649 590.034 341.246 600.938]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.979 590.034 463.576 600.938]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-15982 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-15986 0 obj <<
-/D [15984 0 R /XYZ 89 770.89 null]
->> endobj
-15987 0 obj <<
-/D [15984 0 R /XYZ 90 712.265 null]
->> endobj
-15988 0 obj <<
-/D [15984 0 R /XYZ 90 573.556 null]
->> endobj
-15989 0 obj <<
-/D [15984 0 R /XYZ 90 495.903 null]
->> endobj
-15963 0 obj <<
-/D [15984 0 R /XYZ 90 472.945 null]
->> endobj
-15990 0 obj <<
-/D [15984 0 R /XYZ 90 472.945 null]
->> endobj
-15964 0 obj <<
-/D [15984 0 R /XYZ 90 419.286 null]
->> endobj
-15991 0 obj <<
-/D [15984 0 R /XYZ 90 414.802 null]
->> endobj
-15965 0 obj <<
-/D [15984 0 R /XYZ 90 363.115 null]
->> endobj
-15992 0 obj <<
-/D [15984 0 R /XYZ 90 358.632 null]
->> endobj
-15993 0 obj <<
-/D [15984 0 R /XYZ 90 306.945 null]
->> endobj
-15994 0 obj <<
-/D [15984 0 R /XYZ 90 302.462 null]
->> endobj
-15995 0 obj <<
-/D [15984 0 R /XYZ 90 258.247 null]
->> endobj
-15996 0 obj <<
-/D [15984 0 R /XYZ 90 225.245 null]
->> endobj
-15997 0 obj <<
-/D [15984 0 R /XYZ 90 191.182 null]
->> endobj
-15998 0 obj <<
-/D [15984 0 R /XYZ 90 156.118 null]
->> endobj
-1953 0 obj <<
-/D [15984 0 R /XYZ 90 68.225 null]
->> endobj
-15983 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16042 0 obj <<
-/Length 1617      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~���0 ����E��
ХM�{�x��(d�������4�~��(K�츭�bX

S"yx��\H	W6
�~����3<�9�1&���
a{�;poLN��n��`��������髗�G/'�o�h2�8"Ѕ
R
�H��,
�y�� n?50b�k\W�bæ
�#�b��7�`D�j��F3�E�8�Z5�$�V�`�kL0��Em��b]�
�n5�ao�V
qW�z
h@
�l�{j�[��idb��e�
�@���~4��v�6]
����Ϭ�kޜ�t��DPd3�U��0�i�X&kz
���gMσ	�E_��/�4�Ɣ��i��y�|-/-a�L&3Y���v|�����R��F��j���1
��R>\Meq-es���4�L���I�뿒���"�,�M�T��

�1&9Ԯ��9LfQ�z$<�r$gH `���%��
�XDh>���&N�Ϳ���
����'�M�1f@@��_N�(�Հ���Tfu��Lf
-����
X��%j�o)役ƛ1W�dQl�a��)�eW
�^W�*��Y��x�*C���
Ï�晁��5=f���cW�ȱ�&h����W2��Fwf1U����Epr2�YV���9�5�ߐ����'
-|^��L�/��Z��v$z.���b̆���[J�0Ѝ�I+	mw'F��p������6͋L�q��Q��L< ��|�XV�`Y��a��!,�
��a�E&Ł]�\����@k�a����
�%�a��U�ar5$�或R�I0�C���
a�2�޽�X����0{;:�4�Jd���x�2�Ā��7H8���

-��m
0 ��fO\����Mi^�$�4�nڮu�9DQ�w�u@\�	T�vkڛ!�!����� l����vӿzv`�?�˙
-B�kEQ�u�&�
��B_E�zT
��
��S�
j%�z�W*]����I?�l������6NKR i
�6Z�k�M[�z�-sb1�
m���`Z
�o
az�
"�a��i^ƛc߷�� }�4�T[Q�-���i-��ߩ!s?������
����:�6l#���p{�z�r��e�9�ɕNJ��A�R/�ր^:�N���N���<�}�u=n�!o~�d��]�l����:�B8r<�-*)�2�����W�
RF���X���J�[�%��yw_u���Ow
��q�
>{#Ӧ�4h&E��LP�sGG�3��m	�
e�+��c�V��<�߬��Ĺ8<
���w\䂰���P�Re���U���uX�7mT4��ls�
[n�ne۲x\a2�
-��l?d�6��!���k'}��΁cp�"��OG6n���Ι���9��ʹ�:��>�^�Ţl�phKBȗl���~�+��rW�
�Vw�x�[��~�s Q}=���eᇑ>�x(�Y.֖�~"q���+b�
�`ּ�n�e,�#�Nu�,�%�����x����E
�e�~/ҙhCY�U�|`"�:��S�in
?���0aKqc�7^
-�>>pze���7c�6??^7�`Q�� ��OJ�[P��Ie`��-�U'}�vb�B�Oj�>�j?U/����嫻yQ,N����U.�+4K�u�v�Fy��:��g�q��G�p3�8�f�	ùe
-endstream
-endobj
-16041 0 obj <<
-/Type /Page
-/Contents 16042 0 R
-/Resources 16040 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15914 0 R
-/Annots [ 15999 0 R 16000 0 R 16001 0 R 16002 0 R 16003 0 R 16004 0 R 16005 0 R 16006 0 R 16007 0 R 16008 0 R 16009 0 R 16010 0 R 16011 0 R 16012 0 R 16013 0 R 16014 0 R 16015 0 R 16016 0 R 16017 0 R 16018 0 R 16019 0 R 16020 0 R 16021 0 R 16022 0 R 16023 0 R 16024 0 R 16025 0 R 16026 0 R 16027 0 R 16028 0 R 16029 0 R 16030 0 R 16031 0 R 16032 0 R 16033 0 R 16034 0 R 16035 0 R 16036 0 R 16037 0 R 16038 0 R 16039 0 R ]
->> endobj
-15999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 612.336 181.845 623.24]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a8ede6a8a55e35d1c41065b01afac0342) >>
->> endobj
-16000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 585.716 181.845 596.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aa303fa28c55c391afe4f067f91db36ce) >>
->> endobj
-16001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 559.097 154.727 570.001]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a4f7df2a0b66616d7672e562fa8c4e8f6) >>
->> endobj
-16002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 532.477 165.446 543.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a419ea78710f4b45c1542647e1212a3f7) >>
->> endobj
-16003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.784 532.477 273.371 543.381]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 506.231 150.493 516.762]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a0ca2fc9566495b3d4ac6b970a301d9a1) >>
->> endobj
-16005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 437.904 218.019 448.808]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 437.904 250.955 448.808]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aaf9d682418e536d9a1f6bd24991e1c56) >>
->> endobj
-16007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 411.284 218.019 422.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 411.284 259.253 422.188]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_af78754c1ef47797c0acbd31cf48f9caf) >>
->> endobj
-16009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 317.966 180.54 328.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a306699ac7d5f2c2c909c3a3baf303009) >>
->> endobj
-16010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 317.966 288.464 328.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.197 317.966 410.784 328.87]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 291.346 178.239 302.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a5740d23d50b9aa7c95e8b6b51242258d) >>
->> endobj
-16013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 291.346 286.163 302.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.896 291.346 408.483 302.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 264.727 194.497 275.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.995 264.727 245.685 275.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) >>
->> endobj
-16017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.022 264.727 353.609 275.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.342 264.727 475.929 275.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 238.107 194.497 249.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.995 238.107 233.302 249.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ad99eb5124bfcd9c75379efdde73d1a1a) >>
->> endobj
-16021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.639 238.107 341.226 249.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.959 238.107 463.546 249.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 211.487 226.034 222.391]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ade82782e3363de460caad677b3583559) >>
->> endobj
-16024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 211.487 401.763 222.391]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 184.868 180.54 195.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a306699ac7d5f2c2c909c3a3baf303009) >>
->> endobj
-16026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 184.868 288.464 195.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.197 184.868 410.784 195.772]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 172.554 178.239 183.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a5740d23d50b9aa7c95e8b6b51242258d) >>
->> endobj
-16029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 172.554 286.163 183.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.896 172.554 408.483 183.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 160.241 194.497 171.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.995 160.241 245.685 171.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) >>
->> endobj
-16033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.022 160.241 353.609 171.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.342 160.241 475.929 171.145]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 147.927 194.497 158.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.995 147.927 233.302 158.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ad99eb5124bfcd9c75379efdde73d1a1a) >>
->> endobj
-16037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.639 147.927 341.226 158.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.959 147.927 463.546 158.831]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16039 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16043 0 obj <<
-/D [16041 0 R /XYZ 89 770.89 null]
->> endobj
-458 0 obj <<
-/D [16041 0 R /XYZ 90 721.073 null]
->> endobj
-16044 0 obj <<
-/D [16041 0 R /XYZ 90 630.692 null]
->> endobj
-16045 0 obj <<
-/D [16041 0 R /XYZ 90 630.692 null]
->> endobj
-16046 0 obj <<
-/D [16041 0 R /XYZ 90 602.338 null]
->> endobj
-16047 0 obj <<
-/D [16041 0 R /XYZ 90 575.719 null]
->> endobj
-16048 0 obj <<
-/D [16041 0 R /XYZ 90 549.099 null]
->> endobj
-16049 0 obj <<
-/D [16041 0 R /XYZ 90 522.479 null]
->> endobj
-16050 0 obj <<
-/D [16041 0 R /XYZ 90 456.175 null]
->> endobj
-16051 0 obj <<
-/D [16041 0 R /XYZ 90 456.175 null]
->> endobj
-16052 0 obj <<
-/D [16041 0 R /XYZ 90 427.906 null]
->> endobj
-16053 0 obj <<
-/D [16041 0 R /XYZ 90 361.687 null]
->> endobj
-16054 0 obj <<
-/D [16041 0 R /XYZ 90 254.729 null]
->> endobj
-16055 0 obj <<
-/D [16041 0 R /XYZ 90 134.927 null]
->> endobj
-16040 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-16065 0 obj <<
-/Length 1361      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�a@&�㻂v��.ź���Ð�bˉ7YJd�m��N�(Y�����P,_,���ǻ��Ի��r�����Xs/"�b�;�z����T؛xg>PbX��?	��q1�/NF�<��N&E|�zvY������p �ϳ d��?��ba�o�iR�K�q�r�Pҗ��w��F���nG��Q�&�h�磳wԛ��+�
�C5i�	��zoG�h�)J�,���"��n� �;��x\̒lR*ˌ�c6��7I/��s����Y�7��ǫy�-�j��Ű
8
- RtV%P�{��)
-�h�����y��y���J�R�?γŲ\��3@���B%�y��e�]T�ך��`6����� ��S�����0n�&
� ��G)�w*�Ƚ��-�� M	�vrmN�9��",")���:�]ǩ��j]|(�� B� 5��ӀK�X%�}����g�]��6Z0ͮ?��E
*rJ����"F��a�)je��j6�S�`r��L��˟8E�k��{&G at G�R�����g=����<�}x��
��<OF�����xo�l����(��N�`�[�n�;%T�'��Y��b�7]�����|8Nd�=�9�u��&pjC4�OZt6���Dh�G�Y���,�"��E���pQ�v��X���G3�T�����gI:�	�򺛊mm�OK;ʠ
-%฀�/
Kr=����L1
�>���Q�XI<����>
ĝ/;;���
Ϟ
�N�̚;���jp��(M��b���״
��ĝ�u(����`������U���
���7�:�6�C��:
�đ�*��=
1�i�D�&r� G�n��
����v�t�Q/+��
-�K �K�r��
���'-��
b'\8c�p
���~C(	������g��R"pL����S�����ؚP�jj=nː�RfݹJ�	I}_����ŧy���U��,��C甲49��\Rg�QI��:��<gLvg��ϸ���\_o"E֊�f�V*0�nC�Y&����**Hd��ੈO���ʉ��ᶘ�ʦkz����d%JIp�xH��o���U`�`
-�
0l+�c

l�9�_U��ꔱ�*��
-]�s�����*BoC
0��z�A�e�H�!��
�h ���T!)>��W7'��
�+�����,��I2p�b��3TX!Z4��E[O�����бF�
����߳
_9�iJ
--�ʻ�xr�����m��H����Bm���l��en��,M��e�!A�1��&ΛV�=��mT�U$�6�]/�7G�����E�]�1f�{�X���-�l<>�]Yi����F���#r?�s�@c�b�x�dՌ�v��}X
�:�ދ

����ex="
-endstream
-endobj
-16064 0 obj <<
-/Type /Page
-/Contents 16065 0 R
-/Resources 16063 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15914 0 R
-/Annots [ 16062 0 R ]
->> endobj
-16062 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16066 0 obj <<
-/D [16064 0 R /XYZ 89 770.89 null]
->> endobj
-16067 0 obj <<
-/D [16064 0 R /XYZ 90 721.073 null]
->> endobj
-16056 0 obj <<
-/D [16064 0 R /XYZ 90 687.01 null]
->> endobj
-16068 0 obj <<
-/D [16064 0 R /XYZ 90 687.01 null]
->> endobj
-16057 0 obj <<
-/D [16064 0 R /XYZ 90 633.35 null]
->> endobj
-16069 0 obj <<
-/D [16064 0 R /XYZ 90 628.867 null]
->> endobj
-16058 0 obj <<
-/D [16064 0 R /XYZ 90 577.18 null]
->> endobj
-16070 0 obj <<
-/D [16064 0 R /XYZ 90 572.697 null]
->> endobj
-16059 0 obj <<
-/D [16064 0 R /XYZ 90 521.01 null]
->> endobj
-16071 0 obj <<
-/D [16064 0 R /XYZ 90 516.527 null]
->> endobj
-16072 0 obj <<
-/D [16064 0 R /XYZ 90 472.312 null]
->> endobj
-16073 0 obj <<
-/D [16064 0 R /XYZ 90 439.31 null]
->> endobj
-16074 0 obj <<
-/D [16064 0 R /XYZ 90 405.247 null]
->> endobj
-16075 0 obj <<
-/D [16064 0 R /XYZ 90 370.183 null]
->> endobj
-1252 0 obj <<
-/D [16064 0 R /XYZ 90 208.465 null]
->> endobj
-462 0 obj <<
-/D [16064 0 R /XYZ 90 154.111 null]
->> endobj
-16063 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16109 0 obj <<
-/Length 1395      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ�S+�T0���\�4I�X}J2��%NE�!�x�_��[��8����AC�\`����R����γ����S�
y�
-gq�xؑ������y;�ĝ�_�p�P�xf����z����Ҽ�<YL>L���
p$�ē����F�S�m);.ep�8���'�k��[A�X�ϓ�΢�O=�S��a�2?�7�if3§~�ˋt�[�0�/����v����49/M����R���:
L���>L0ɨ,E���e=�zp�<��y������3�˳fƼV6�h+�
�
-fs�����&
-  TM3WMw7:�pc"�˔Wܮ��Rޛ뼝s��,��ꕱ7[U��)�L�� A��
�4�tR
�80-N[mG1��0G�'�5��¥B)QEf����lc�N`oʕ�Qz=k��jϑU�Ci�œyC�E��Q(^��Jgv�t�E�&�g��#8C�A�fQ0�]�z��
;z����z�*
��]-��\����4�7�
-C.[R
��(��<a�$Sǀ=@����9�y�9��qL�� ���b�A��֗7��fm$�"Sk�1�y�QE]zJ{�P'�&ͣde��8��r��BֵHǬ!�#�"��u�[��q��B�zs�$�
 ��"=~
- �&����h/:�
C�l�0<�^���D�cB
�� ���BQ�?
���+�ٲ�(�3�k����!a�f��p�
�G IG�V
J�:5s�J몊���]�˝�{�d~���./t<�_��4k�ߤ.����6fl*�������Z���8J�8�����*o�b]�i75�m�I16���<Ӊ�|آ�˪^���beJ�1���ـ��KϿ���|��C,
&�_����> H{(B�l
��
�X-�������������DŮ����N��(7[�탫�خ�y��ʩ�MW"��L!{h({[ȩAe��\�݌L-����j�����=\�����Q\)�Hv\�
p�����u�sL�+9�o��?	�?��s�!�}N0�gW^��'Ѡ��q5:֢Z�|�ތ �NNo�0�e��j	_�����ٝU������fmt�
-�&1(R�
�l,��#ջu�	b\��V�d0�������{U�ET>L6�>�
����۹1-B"�j�`DGL���(��(3II�^T�f�Q�i�F���ɴ�L�o���&m���ky�V\S?^Y�6����m��k��
5HZn���i�#"A���GD���SrOՇ0�HI�C�v|���g0�i
�7o���w�BfT2�#����v�O��_g�O+�_�	4xm�����.����D�0Av_ꚭ֮��4��kwo��uQܜ��]mW�NV(H���n'�G �
<�qY�f�CQ㒾{����
-endstream
-endobj
-16108 0 obj <<
-/Type /Page
-/Contents 16109 0 R
-/Resources 16107 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 15914 0 R
-/Group 16061 0 R
-/Annots [ 16076 0 R 16077 0 R 16078 0 R 16079 0 R 16080 0 R 16081 0 R 16082 0 R 16083 0 R 16084 0 R 16085 0 R 16086 0 R 16087 0 R 16088 0 R 16089 0 R 16090 0 R 16091 0 R 16092 0 R 16093 0 R 16094 0 R 16095 0 R 16096 0 R 16097 0 R 16098 0 R 16099 0 R 16100 0 R 16101 0 R 16102 0 R 16103 0 R 16106 0 R ]
->> endobj
-16060 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Polyhedron__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 16122 0 R
-/BBox [0 0 362 192]
-/Group 16061 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 16123 0 R>>
->>
-/Length 526
-/Filter /FlateDecode
->>
-stream
-x�ݔ�jA
���z�U$��
�

���B!�4�SJ\hz��W���������Z�F��O���
"HahX��+�t
�z~��;���������\�����!��1�G�J>���O�%�y��	��1k��8��)�WݍCow^`�!��=�՝3�r���:W������
X<���m�զ���\��ݼ#"nc�V�F�:���Zm�A<�����E2Ǭ��6j�
�wcʷ�⋪��]���=
�Ŋ1�����	��B���U�ֻ�m�
9pN�>��G�n�z]\s���w3=��J�l�M��$���K8�\"�f��6��J�D>fs�
��N�%
�zڔ�L��!�=5ñ��
0%�&�M�d�X�����h�划

QKW )
��w� ��@0gj&�k
QP�mƊ�z�B�L!k��[�[���ˀfuzl���
�NY}��[%�Mr����VӾ=O�;������z��"ƼG��1�4-���oa��?-�Fi�h��
���D
dN���底���b��
-endstream
-endobj
-16122 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-16123 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /AADMGF+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 16124 0 R]
-/ToUnicode 16125 0 R
->>
-endobj
-16124 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /AADMGF+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 16126 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 556 722 722]]
->>
-endobj
-16125 0 obj
-<<
-/Length 16127 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0E���Y���G�CI7^�A�~�,�A-
YY��+Ϙ*����
�;�.�K�l��#����:
p�A!�x�N%h��J��Az�%s7O�֙Q�5d�I�b�a��
� d�Ac��
-��Kǿ���?8������&�{��M���N���6��*�f�P|$5j��T������MZ�@���ʼnm�Q7��H�y�����P0툎%SŚfڳ�0
X[�Ȥ�N���tf��$��L=SŤ����fm�L��
�N9k����vL|�
-)�5�%�e���{)~<�$n
>ކ���&�
-endstream
-endobj
-16126 0 obj
-<<
-/Type /FontDescriptor
-/FontName /AADMGF+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 16128 0 R
->>
-endobj
-16127 0 obj
-303
-endobj
-16128 0 obj
-<<
-/Length 16129 0 R
-/Filter /FlateDecode
-/Length1 1760
->>
-stream
-x�UU{lSe?�w��Ѳ�r�`��]׽���ck�^���
-�c�n�c]7�c�MLL�!JL�@b�Ɛ���(���1�d!р�f@j$��|���6�;���;��9��@  ���}g*6���q��w�

���_��|@q71������E�;�
-��P��Dj�d�
E e
�ݣ�1 �e��Q�b���-*��ʫ0f���,p����/7�(�H�dXz���Wt�N<׏�x.�����f��0(E��i�&49�{;�
�'�4���W(�}B��Φm�l�h�2����@%8��0�y����U�2k[\��
O#i N��L�#8�
�������xm^��`�TF���ԥB��R�Zkú�ze�5Z4�U�&w�IW+�Ƽr[O��h]Y�-��W(U�����.}�Y5��jjC5X���Ŝ�!/ z,J�7�a$�H$�ci����ڵKzH5;6�
ڴa1���	�X8�����C[O���)�pv#�j�#�PMך�P���.
 I�'�^�b�c*����eN`_@�7��o��#�8Z2�����A�G1��a�u�T:������ѱ�#�P��uS��̼v��
ɝ�I}�Jm��1_Xg����>a-���.c%7��(�
ƨp1�	'
-䕾{�����ϩW]읦����e~��4L
�dq"wЗ�|	�_Ċ�j�l
-����uݽa��c���[tV��^���ʵ�pf֪�� �&�3�D.�
J+�S"
!%��asD��o��˩��"�t�XI�a���
����B�u5yj��ۻ5�g1�� �,�̔7�d�.'�7�
���ꃮ��{�Cã�S-�H�/bx���~�թ�7�B��x���X�@��s=�U2lMz�)IH���f�R�a�3��
Cߣ7�΄�8
��Z2��ύ��\����7���Bo���
^�LL
N��࿍��Z^#�l9}��{}��Z�R:�;0����
{+�fq��	�G�'���b/,͹���m�T���s40��
�J{��5�X�ގy_��Y�g#�h�W�"�
���Vsv��~�{�z�v`�ȡc��A~�$=�h_Ó��ő�s.���?�n���<��X�4b�'w�]F"��tR:
"S��/"��F�s��
�;A��^��G����EB&Æ]>���9
�W`'U�W.F�5h��(�����"�"Qm�7��(�B��]f��/�~Z�O�H��9E1���W��#�)~�g�N9����e��s�Ok���@+�6Z [...]
i4��ۘ�E����T��
�}�L���
~��H#d��@���&�.r	������P\.(���u�
-endstream
-endobj
-16129 0 obj
-1357
-endobj
-16061 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-16076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.279 443.392 192.296 454.296]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.794 443.392 258.726 454.296]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5dfef947c46e234a1ffd4707312332ec) >>
->> endobj
-16078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 352.145 190.738 363.049]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 352.145 261.85 363.049]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a43cd840b1ec99350c222b3f217739cea) >>
->> endobj
-16080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 326.564 190.738 337.468]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.236 326.564 262.159 337.468]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a97ddb3b93ac699eebaca7e79f691b0ad) >>
->> endobj
-16082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.225 313.101 390.082 323.006]
-/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
->> endobj
-16083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 300.983 226.443 311.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.183 300.983 282.343 311.887]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7b8d597a3c23af1fce9d8d3e1d36e11d) >>
->> endobj
-16085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 275.402 226.443 286.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.183 275.402 329.944 286.306]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab7a35f8df974c9e932df6291754859fb) >>
->> endobj
-16087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 249.821 224.76 260.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-16088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.499 249.821 278.986 260.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a2bf7987a6ee3547c1e125e83e432ee2a) >>
->> endobj
-16089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.616 224.239 224.76 235.143]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-16090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.499 224.239 326.587 235.143]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae1c5216e2ba5c80d77e128daea25b46e) >>
->> endobj
-16091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 198.658 209.547 209.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-16092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 198.658 261.831 209.562]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6fb94f0e966e97bfb9dcf43dddcf12ba) >>
->> endobj
-16093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 173.077 209.547 183.981]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-16094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.045 173.077 309.432 183.981]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac6ea1802e6a6cfb32e5af6d6d26eb424) >>
->> endobj
-16095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 136.537 205.692 147.441]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-16096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 136.537 261.312 147.441]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9f3c5474494eb306717bc3da7c109307) >>
->> endobj
-16097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 136.537 332.156 147.441]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-16098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 112.787 205.682 123.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
->> endobj
-16099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.18 112.787 261.302 123.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0514c2e57ac8154666e9fe6bb56c0e18) >>
->> endobj
-16100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.64 112.787 330.462 123.691]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-16101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 89.038 205.692 99.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
->> endobj
-16102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.19 89.038 261.312 99.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6187dbe974649c7bd4de8e66f70d3e46) >>
->> endobj
-16103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.65 89.038 338.781 99.942]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-16106 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16110 0 obj <<
-/D [16108 0 R /XYZ 89 770.89 null]
->> endobj
-16111 0 obj <<
-/D [16108 0 R /XYZ 90 460.308 null]
->> endobj
-16112 0 obj <<
-/D [16108 0 R /XYZ 90 460.308 null]
->> endobj
-16113 0 obj <<
-/D [16108 0 R /XYZ 90 392.735 null]
->> endobj
-16114 0 obj <<
-/D [16108 0 R /XYZ 90 367.143 null]
->> endobj
-16115 0 obj <<
-/D [16108 0 R /XYZ 90 341.751 null]
->> endobj
-16116 0 obj <<
-/D [16108 0 R /XYZ 90 316.17 null]
->> endobj
-16117 0 obj <<
-/D [16108 0 R /XYZ 90 290.589 null]
->> endobj
-16118 0 obj <<
-/D [16108 0 R /XYZ 90 265.007 null]
->> endobj
-16119 0 obj <<
-/D [16108 0 R /XYZ 90 239.426 null]
->> endobj
-16120 0 obj <<
-/D [16108 0 R /XYZ 90 213.845 null]
->> endobj
-16121 0 obj <<
-/D [16108 0 R /XYZ 90 188.264 null]
->> endobj
-16107 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F66 3179 0 R /F75 554 0 R >>
-/XObject << /Im25 16060 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16187 0 obj <<
-/Length 2102      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�8��W�䕪b 	�HU�����$���;�dJE���
E�|����i�h=(���x2��K�6�_� l�-l�<������X
1�����
Q���OC�Q`�.	�x�~D�0̗������,�,x����$��˗�_�H0��ѥM��u�j~�3.�锃\���:�����O׃�ͰE�&��5]>��������a�u+;--�v�3�>~`=)�=9oM�y�O"DM�m���c֧K
-��dY����s���CL%.�|�*7�O��>c�ᏨIO��(w��ϫ7̱P�s����<�X`�S����U���7���F��@��X�W�vE:����ϔFa�F�&Ղ���^������!>c�4)�"�
��8�G�Fa�P�ʎ��2�q)(�v����KBm�;64�+���U�l:\�
��O�[���\�&]���C0�#]����2��y<
�d3�&Y�����feV�fmZm7e_�.�I�K���D�РX�i���*�� !���?���fqZ�gy�<�m(
�^#
`����cps��1���
rE
�M�M�_����
��e�zN���K����h?p����
-���"M(]Y>
#L�*��	�>.$G2�1�k �/����0N�10��Ԝ���s����ƚZ��
&ӧ����]�D��s��Ӽܻ��2�*q��燿�!�[�p�4��Z�
��{��{`؁�R��$@Np���"���&���
AA@{�%A�0ө
R6�ϧ~_�^2[!��q8�ļ�
-�%�[0\�����yQ�G*I�_���8��cv��L���
~"�%k�Cf#��A����)@8�&�=�/ @���c�s���e��`�
�������pB�I��N5�D%�E��
_g|&� ,jOc~X�I�E����hILI�^���b�
�-jF��/����b�����}bƑ;�'b���N��D�
4t�@���
�iOu�
�4�J�0{�Z��A<aBOGo�(w�
�lE�l+}#�@�� vP�x��
1�'�C���"\ 5<
�(f��<4;���@S��vz�-L*��m��J
��
C�g�x&�xў��)�C��ڔ��g���X�X���RN]��[� �y��z�q�!����*4%-Ts��b=��>qG�y��ţ���2N��9�D�f@�ԕ];��[��E��Z��$[I
(�hd@�0�0��+'����
�9�
�9
�0���a�.���G9
l�:q��(G9�n���_
�'�/��_�I��SٿT�t&����Kg�9S̓���eA8p��IOU%�#7p5�y���d�p7���)h��1���&�[/��ƽMv�%#f��K
-����}�x?Q�IQ��֒��ܧ^f%����}�EO� �
-������²^E�<�*Z槲�8�/�]���5'�e�·U�T��
-��t"ؿ{��4�Yì��ĢU	��s�Lw�6��O���q�L-�敒�1�n�0��M�H> �
��"Г�WP�j�]z1��u��Ǘ�᝭���`�|��iZ�<�r$�"'�� .���r���i)Η����1�
D�lʐ����	�
��/0���c�Ϫ�-����pu'��L��H
-�:^�|�����䠚��Z
�Iˢ�~�l�V�/!��ٹ�r�x�	�xc	��e�GyDX��1^�Tq*\���B�9_��\}��/'��ћ*���Dat7�ޅ)�(�m���p��r(X@�k)8��qFѸ>�T>�Q^�
-��J��(z�?D�i�����9
T6�"���������(��mԢ��dY�;	����"�4��vN��z*^�*)�/N��'ȡ�
-��@��m�t�Y������:g�r]�fy#�@�W�����{!�p`q��p>�
��
�J,�c�" 5�+y/�Q��"�bz��K�
��v�^:4�
��E1C�N��u�x�V5���#J
$ޅ),�F�,��:���S.
 �Gn����b�֯"sҝm QZ�wQ���WW�j^�t��{W\��!�\�mf��,��N���2y��Ǝ�+�X�y3�߷e����<�����ұ~���w�:�R�?�
-endstream
-endobj
-16186 0 obj <<
-/Type /Page
-/Contents 16187 0 R
-/Resources 16185 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16196 0 R
-/Annots [ 16104 0 R 16105 0 R 16133 0 R 16134 0 R 16135 0 R 16136 0 R 16137 0 R 16138 0 R 16139 0 R 16140 0 R 16141 0 R 16142 0 R 16143 0 R 16144 0 R 16145 0 R 16146 0 R 16147 0 R 16148 0 R 16149 0 R 16150 0 R 16151 0 R 16152 0 R 16153 0 R 16154 0 R 16155 0 R 16156 0 R 16157 0 R 16158 0 R 16159 0 R 16160 0 R 16161 0 R 16162 0 R 16163 0 R 16164 0 R 16165 0 R 16166 0 R 16167 0 R 16195 0 R 16168 0 R 16169 0 R 16170 0 R 16171 0 R 16172 0 R 16173 0 R 16174 0 R 16175 0 R 16176 0 R 16177 0 R 16 [...]
->> endobj
-16104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 707.957 183.824 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad909d5b60cab5d1a6816577c97b60fcf) >>
->> endobj
-16105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 683.082 192.272 693.613]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8c33b9ea975535b5aa0882241cf78986) >>
->> endobj
-16133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 657.46 241.935 668.364]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8ed700f662722cbebdc9328344ba2839) >>
->> endobj
-16134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 632.212 213.163 643.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac251eb38d1b24b8b570d874ee11df424) >>
->> endobj
-16135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.501 632.212 288.431 643.116]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 609.003 189.901 619.533]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0d9abbf681b7b0724963d97596286ae5) >>
->> endobj
-16137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 583.754 193.229 594.285]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa0ac997a15935821583174de968e5bff) >>
->> endobj
-16138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 558.132 238.459 569.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_abbb7562de97ccf13bd97b57bb5e3ac94) >>
->> endobj
-16139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 533.258 187.689 543.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae3be29eddce8f41019e7dcb731c8ba7b) >>
->> endobj
-16140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.505 533.258 226.693 543.788]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 509.301 228.895 520.205]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af740303d5461c838735ec53c5c1f8855) >>
->> endobj
-16142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.232 509.301 333.482 520.205]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 485.718 229.503 496.622]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a31d70a625e092dfdaed4f3232701f35d) >>
->> endobj
-16144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.84 485.718 334.089 496.622]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 462.135 187.264 473.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac5c7acc50141a9104ef5b9b7598c1438) >>
->> endobj
-16146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 462.135 293.213 473.039]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 462.135 371.148 473.039]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 462.135 455.727 473.039]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.98 415.638 187.264 426.542]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae680437fdc213b7174c581caa2e0c0d3) >>
->> endobj
-16150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.963 415.638 293.213 426.542]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.131 415.638 371.148 426.542]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.711 415.638 455.727 426.542]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.235 403.682 220.058 414.586]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-16154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 369.14 186.348 380.044]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad914801461cad05325559e95b9c4d9c6) >>
->> endobj
-16155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 369.14 293.772 380.044]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 369.14 373.367 380.044]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 369.14 456.837 380.044]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.717 322.643 186.348 333.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6e73a7d462d6a9a3891fff6c4a923495) >>
->> endobj
-16159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.523 322.643 293.772 333.547]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.35 322.643 373.367 333.547]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.82 322.643 456.837 333.547]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.581 310.688 218.404 321.592]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-16163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.772 276.146 187.446 287.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7af48c81caa850300e6042bea1008a38) >>
->> endobj
-16164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.73 276.146 292.979 287.05]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.431 276.146 370.447 287.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.745 276.146 456.762 287.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 276.146 513.996 287.05]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 264.565 159.485 275.095]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.603 264.565 240.62 275.095]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 229.649 180.496 240.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5df26655af3ae7844569d7086edf8332) >>
->> endobj
-16170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.834 229.649 255.764 240.553]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 206.066 213.153 216.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac2182f38e9f8acede601c3dcfa71c3b3) >>
->> endobj
-16172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.49 206.066 288.42 216.97]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 182.483 161.677 193.387]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a13f15417d90174f6c2d3648e83d9fcf5) >>
->> endobj
-16174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 121.873 205.752 132.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0a5c586d872f15baf7fd70941fc16c41) >>
->> endobj
-16175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.089 121.873 276.595 132.403]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-16176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 97.916 204.078 108.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5d53d09dcc839672fedd4ab5d4142d57) >>
->> endobj
-16177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.415 97.916 273.238 108.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
->> endobj
-16178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 212.377 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) >>
->> endobj
-16179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.714 74.333 289.846 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-16184 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16188 0 obj <<
-/D [16186 0 R /XYZ 89 770.89 null]
->> endobj
-16189 0 obj <<
-/D [16186 0 R /XYZ 90 721.073 null]
->> endobj
-16190 0 obj <<
-/D [16186 0 R /XYZ 90 697.812 null]
->> endobj
-16191 0 obj <<
-/D [16186 0 R /XYZ 90 672.564 null]
->> endobj
-16192 0 obj <<
-/D [16186 0 R /XYZ 90 623.733 null]
->> endobj
-16193 0 obj <<
-/D [16186 0 R /XYZ 90 598.484 null]
->> endobj
-16194 0 obj <<
-/D [16186 0 R /XYZ 90 573.236 null]
->> endobj
-16185 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16265 0 obj <<
-/Length 2652      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�K͔��b�43�g���k)}q2
�)LI�H;̯��
�Z�)ʌ���g���ux���w��\\��l�0���f9
-�H�� �-FƂ���|?b�B$
�-s��������k���ۛ��
���j4�\|��p��F,T��f�f�)������?����5��l����k�Lj¥$b��b�_N������ۃ�J�ŝd��d
in���kD�1Q�k��c��2�1)��R;$Pu*�U��c曊� ˒�]�{�	Z���]@��Q!H
�3^R��K�6���%���f���I,�dr
m�O
%�h��84d�Mׇ�h�]r1Nd at P�
�kx��P ,8\`�s�T4�}��ǟ4Gi�p�4����{3�p�XLA��.���.o�C~��!�)�.�L��.��h���@�4
U�mj���X+E
-u��@h���P����.*
i~.	�5+37�ī~ �R�>0�0�5�6g��͵e%�s�.=�'D "�)�W}��HVKѺ�
�����N���x�
'�j�'M��+j�
-e_w�ݯwZk��Y�Kc���,�k
���$�vR|Z|��5�p
�	ㅼ0T
��a�Q�v���
-�\�}�(�ʨ~2$�E��������������p%Q6ۥ�c��w�cX[
�
)f&�`ZDk�aT�V��huI DK������p��D����	)X��Yb�Ɛ�R��I�(
&`�1�$L߀$����΃�b(
�
؏�n�|���t'��� h*�c�|?x���I$�{��m1|r�2�G&�����"�Jn<�d�G���Np��,�;3�LU���
-����4��OR��P�4v����UrW���[7�Y�H�Q��H�[L�H�K.Q
-'(f�"{�|��G��'�l�_���%n��I� � �f�Wl�^“ S8`����I
0���*��+��-�e���+� R����,�$�j�_+f)���|
6�A���
S���`��D�ɭ���<�e 6�)T�)��i�(�H����u�

j;
�cB�i�8�"THU���Z�/!E$�lzt9�ۚ;
����90|���S at b\��� /7[
�Z��
���7)b�ρ(yX�K�,@�Έ���6��l����8*祗��-�N)@B�{9��6Jf��7�o����f�JX���
���
`
v���M���u�`e��u�I#�
-j�b�93��:�T-�X�I4˦K�{
-���u�;����;�PT^?Z��0Z�!���%hQ6$�!�Z:���|�.�cs1
E����.�
}�&9i��%�
���
jzm�W ZY��z�Ay�
�Aђ�W�h�Y`�
�) �� �9���|p�� ޣ NX���;���&�=_�Y��+�Mӵ�/
���97
�S���|���n���yt��'
ȱf���d�q�T!I��c��n��a����:��
�m�Y��./�P���j0�U©Q�V$;��ʛ�P��1z�'ɔt�{��^p)�Rk
b�pi�Ҋs��<2�`�C\� h��,�{j at p�_MT�H��r��x�ODZ���RXE�9�#�bO:��2�qqI��v�b
�
�f���W�8!��a�D�ju��!k����ٖ�F�"�hO�z
 ���B8 P��1���/�j�g�\
wĹ1#}5|��tEW�ի?-�
-�xp��]���	��\5����I�&P�mnӵ�ˢu~�<aL&�u$��ɵA���y\ދ���'&��
1�(�6b�br�tI$_�c�R��F�

-�}oX�g�8�c��
-�b��
�u�n�ʒ�ذ�r
{���
�TR�|���w�<�?f����1��"*�f���7�ȗz���,�ճ�-��7�[��� �K�{�_FÞݮo�ߎ:r)��^1}��	��҉���H�Y�v���S�_��V{� RF���� �Xo�2Kp��!�R׾��i{��
;�>��;
��N���_��*0�C�K�I�S?O������,�g�k���]�����t���t��1V����0`~��z��Zys��ϺWA
+N;�pB�-p
rz^�!
��zR��ogs]\2:^ě(�
�:�T�Y�k�5�k �x���*��\�;�U�h���/s6
Խ��,��
-Ja�̠?a[���|z
�7��
�������F at Y�u�ZB���p�Npq��r���9�{/��l|��:�ei
�x@C��1�<��g�TZ7���!���)���ԭƄ��c�D<{�����!���U9hK�]VJ�0�w�HT�%���o����J����t�����9Hi�u�8e ��?M9K~�@AX:�������+�A�m�)���~�~�
^
-´�&ZPG�%d�ۜ�xh�0@�zjw��F��6�'�.��E�t]ֳ��k����
d��<�R�2�(3G!���.C��D��(-J�Ht
N��T�s�4n
-��b��a8&�(I�N�@��"�f;
^�xU>�����k�x�ݸz�a��@�"7z�����9hhU�A+n�Q�Mb޽��^��G�_.�(>
��,��\�����[&���A�z�	�
�:*Pm��_����p�@Y�[���n������*�������j|f�e	�e���Ht3�eeK���g�Ay�g;4
-endstream
-endobj
-16264 0 obj <<
-/Type /Page
-/Contents 16265 0 R
-/Resources 16263 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16196 0 R
-/Annots [ 16180 0 R 16181 0 R 16182 0 R 16183 0 R 16212 0 R 16213 0 R 16214 0 R 16215 0 R 16216 0 R 16217 0 R 16218 0 R 16219 0 R 16220 0 R 16221 0 R 16222 0 R 16223 0 R 16224 0 R 16225 0 R 16226 0 R 16227 0 R 16228 0 R 16229 0 R 16230 0 R 16231 0 R 16232 0 R 16233 0 R 16234 0 R 16235 0 R 16236 0 R 16237 0 R 16238 0 R 16239 0 R 16240 0 R 16241 0 R 16242 0 R 16243 0 R 16244 0 R 16245 0 R 16246 0 R 16247 0 R 16248 0 R 16249 0 R 16250 0 R 16251 0 R 16252 0 R 16253 0 R 16254 0 R 16255 0 R 16 [...]
->> endobj
-16180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 697.144 209.627 708.048]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af60c3f345fb8ec8c708e49e8fa33f737) >>
->> endobj
-16181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.964 697.144 314.791 708.048]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 662.566 248.202 673.47]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a4f9a47ba1b29f1e07a32542584d50686) >>
->> endobj
-16183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.018 662.566 329.845 673.47]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 638.948 207.953 649.852]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9a45b4b8f148a20359a2f3e2b1c2cb2d) >>
->> endobj
-16213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.291 638.948 311.434 649.852]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-16214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 615.329 246.528 626.233]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab1b315e7f04c051a36f48d344dd34052) >>
->> endobj
-16215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.344 615.329 326.488 626.233]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-16216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 591.71 216.252 602.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a96e902093a55f87f0aebc2bb13a8d740) >>
->> endobj
-16217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.59 591.71 328.042 602.614]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-16218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 557.132 254.827 568.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3569a428ad758dc9ac8273e0f1f77772) >>
->> endobj
-16219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.643 557.132 343.096 568.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-16220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 522.928 236.745 533.459]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad6a8cc7029bad7ad7ad116c90ff59aec) >>
->> endobj
-16221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.082 522.928 307.588 533.459]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
->> endobj
-16222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 498.936 243.37 509.84]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a236a18fe8cc922d00ee92a6c6e42f923) >>
->> endobj
-16223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.708 498.936 320.839 509.84]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
->> endobj
-16224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 475.317 240.62 486.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_abfd98397c137d81dcc27111fba3ccd54) >>
->> endobj
-16225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.957 475.317 345.785 486.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 451.699 247.246 462.602]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa26e1a5815b7a0c3b610395c854594bf) >>
->> endobj
-16227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.583 451.699 359.035 462.602]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
->> endobj
-16228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.378 416.125 290.595 427.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a075036249d2478e1710f5d6350c849f3) >>
->> endobj
-16229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.489 416.125 374.904 427.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.429 416.125 417.156 427.029]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.341 404.169 279.756 415.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.177 404.169 321.904 415.073]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 345.681 339.618 356.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aeeb72a31f8e1823de7a8123585a331b6) >>
->> endobj
-16234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.76 345.681 420.175 356.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.824 345.681 460.551 356.585]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.938 333.726 306.353 344.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.986 333.726 347.713 344.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 321.771 196.835 332.675]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-16239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.88 275.238 279.318 286.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a49fe44155b41ca85f41b2abc99c39e13) >>
->> endobj
-16240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.914 275.238 302.514 286.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-16241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.541 275.238 344.268 286.142]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 240.038 193.577 250.568]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3c1e5a2419a5f4a5cf89133606ed1680) >>
->> endobj
-16243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.393 240.038 232.581 250.568]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.059 227.182 248.845 237.087]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-16245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 205.46 193.577 215.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a05fba1023938607f7c5e345c0be716e3) >>
->> endobj
-16246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.915 205.46 277.691 215.991]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-16247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.391 192.604 247.177 202.51]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-16248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 170.509 223.465 181.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8132d1a9b329271fb4f7faeb59c89c39) >>
->> endobj
-16249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.802 170.509 298.732 181.413]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 146.89 215.176 157.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a4b428098e57a9101473a54cd71a0753f) >>
->> endobj
-16251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.513 146.89 290.443 157.794]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 123.272 229.552 134.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7e68bea365fe939d08c91ec4edc61a2b) >>
->> endobj
-16253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 123.272 304.82 134.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 97.952 239.804 108.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a672b0568e7a27c37b3afde649f7c0171) >>
->> endobj
-16255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.141 97.952 315.071 108.856]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 85.47 275.476 95.375]
-/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
->> endobj
-16257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 217.109 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aeb14f5522982b3874f2cd19586813421) >>
->> endobj
-16258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.446 74.333 292.376 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16262 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16266 0 obj <<
-/D [16264 0 R /XYZ 89 770.89 null]
->> endobj
-16267 0 obj <<
-/D [16264 0 R /XYZ 90 138.393 null]
->> endobj
-16268 0 obj <<
-/D [16264 0 R /XYZ 90 89.455 null]
->> endobj
-16263 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F67 3037 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16364 0 obj <<
-/Length 3344      
-/Filter /FlateDecode
->>
-stream
-x��\m�۶�~�B�\iƂ�J���3I�N��j�M�$�ѝ�;N$Q!ywQ}w�")��Yt⶞�9Q^����.@��̈́N�t����g/}1	H�qo�n5	�ėQ
|[N��2J4���tz9ct�H7��r��4Y�o�e�_�W�"�?^�=cz�lgs����"���h�ߢ�u�
-驩b���w_]|����
��	��(��������d	���P"=y0�6�|�'o/�vA�A�?� 1�0HO� ���å�a���bY��;I��W(-
--|#tc�o�?PE��#z�ٳ�
��s�9�$�̡'�]���jT�|?W�߫$Y�Q�M��7���ś�:^�û,�ބ��6�fLM�
���b%�Jfyۗ��%�F���6~9
���jĜ���Ȇj
�i�`+�']�$�i�y� J�-����ģ~Y(��3[�ٽ$��e�EϘA�M���,J�A�(�*
r��E
;T���c �k�Y0�H
���*�w]�V�R��.�"�e���E�_IJfs)�髕�-&��U[��:�\n�j�.n~�n��S�5�
��`l��@��.��^�`�)�Nc�K4���mv�~����H�
��xo ,^v[

  V3�pj�6
-���&j���p�u�3�nj1`/�������"�I:}
-�|:�����x-���_vik��n��
�z�_$Q5��8��a�.�<{������q5�`�i�RV��h�l��"O�ݣ>�&ٶGo�`s*�0\'�
Z�#s#P��S֩
^�xU����YB�փ�Aoh�7�����i|N(�F@���KXtVq�����m� ��f����/�5>�
�	W�����w��KZ]7�e� �W��
��_J(�*�@�48
-퍫�KR-I%B��8�$��U��.�#V�
�B�E�� �V��(4��������
�,�R� ��E^̓j�O��������[�ҕ���]�������Kē����zZ�x��+�r
j���v�8a�M)Q��*Ij�`Z�7�g������y��͵wvcO-��
�R�ݥ2[
n�A	\p��j̘����t<ZYy}>��`pB
GW�
{xj]���o�:�5�3�&`��e	��G]Y���/�M����_xAӈ�e�&��0!��_��	a�����m�����~�����
�Ѯ��31
-�
-�$/ �iz
��^g k:�
����(����BЃ3��+g ��;�=�΀�Bם�F�g ���xoX��D�(]��G�p8��Z�G���o=1�����&��7W��%K���Ɛ��Z9���;��0�ur��1a�QJ�vH�2o$HLס���D:�ՁmR�} A��
-H�̨Pj����V�-f)й��c[h�{���8������UB�ϔ?-�R�I��> �D�tG
���
�`�P�̘Ϧ�
-�[�Z�8P�O��&�53��
��l� ��G�Y�ʪ�,%L�*EkR��>m�
���
��AL*�-_��|p	�VZ��H�:�����PL�G�^��kճT���<c��f���ɲ�o�U�Ϣ�C
��y=a����W��i�N��r��΂��D>D�؁&Fɦ�_�꣋&�C��Lt�\4h{u���'[(�l��o�c�˜Q�-
-���>�0+��EF���NNc
A?n���S�P� �Ϣ��-18�.��
ޤ

�@tK�]�G��>`S!������8m�R�S�
�s���z�C�r�;���;�|�huZ(�X�r�
��6'١tg��2>T�f������U���{�� r=�t�A
�У^z
z(�v�fˡ���Ct�m�
]�lwD�Y������*G�޺��#T�x�a�yD��|�o
�bT(d�'Tȏ�s
m˷G��
������*�7́u:6~E G:��x3��
�ê�
V��	������
y,
-��hhT�������
�fk[x�@ÀH�N at C5��
��8
��qh�)��a�D)��*�-�S�B,}F6�77դ�CY �4\X���*l���k�s�m 0�����9
{��+7�!�
k�N�'+�sӢ;7�}6R�A�vnZ�sӢ�M��ܴ��Ҳ�[���G7Bn�1p�m�_�������G��`/t�
Hp`G�@H"�	n�1�ڳ2ES@��W
���\ڝ�Z^�ʥ�K�s�����͸
zm
�P�L�\�۳����`�]����
�h"�O��?k
���M���g%T�䘻�NR��ձ�Y�����	����Z;y��{��x�]H�y�T�юd�Vh��s�B���bLy�Vh�6C
���ZHy`',�
-'��Oa' ����d'q&*J�'�l�5'
����,��}";���9^?�Os��̂���2Q1D
Y��N�b���~�@��)y
Q�m���{�,�U X�F�)��M�"�e�����#7M;=z=���ɬV<�ݭ�3ʀ���:���r{�Mѡ��U�ܪܥ��(����� _�o���=�x���p�ySJ��}H��}D��Ye��(wf?
�j(�y���*�������
���.
-�E7&^�9zx�yj���;��C�o"t���q?�f�!Gx�d���(E�LPSG�x0���� ��ib(~
xbo�Y
�ϲsY?_���P8Z
��բ����
Z���b����
�L��_[o4��a~
�M���+�R�䥹2vo�1*�>^�-����<��:��u�~0��M��2�T�ut`u	�E�;k�XU�
<�$-k/�Ͱ�䌔i�
��i�løft��e],���7��>P�h�9�=A�g�.�⛯/_��W�sD
����%.���j�/�&���a�\:�
F焫��%`��&�m4��|
��	k���)��|��|�2�H�5�
-]�7e[hL�cܣ剃c���s��*<kplXX�*�bM*��\l�Oa���LV
-]7�N>�5lمR-c�q��XO �æ�U�q˖�Na�pU�2���e�r�2Wm[�7WI�Rl����� ��tޤj�	]'i
'��G�|8�D
�����\�`D�Sw��o��cF�.Y'7��b
^���.
�2

��D��m��U�8^�X�1�gn���TD�Ż
�S��������!�@_����<�ǚ/�e���0�F��ϖ��v�y@���Z��ƐvV��>2�
�72ΖӉ1�o �~�
P��ũ/t19�.
4!���rf./_ۋ�gQ�;|'Da'_/�w�R�%R�:�G���%.���ۨ�:+�O���/��
�Ћ�R�m��?{vuw��
�8F��8BO{�J�}��՛/V�Z���i�R��2�y��(��
J(���B�vm~,+7��ڈ�P��9�����
-endstream
-endobj
-16363 0 obj <<
-/Type /Page
-/Contents 16364 0 R
-/Resources 16362 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16196 0 R
-/Annots [ 16259 0 R 16260 0 R 16261 0 R 16287 0 R 16288 0 R 16289 0 R 16290 0 R 16291 0 R 16292 0 R 16293 0 R 16294 0 R 16295 0 R 16296 0 R 16297 0 R 16298 0 R 16299 0 R 16300 0 R 16301 0 R 16302 0 R 16303 0 R 16304 0 R 16305 0 R 16306 0 R 16307 0 R 16308 0 R 16309 0 R 16310 0 R 16311 0 R 16312 0 R 16313 0 R 16314 0 R 16315 0 R 16316 0 R 16317 0 R 16318 0 R 16319 0 R 16320 0 R 16321 0 R 16322 0 R 16323 0 R 16324 0 R 16325 0 R 16326 0 R 16366 0 R 16327 0 R 16328 0 R 16329 0 R 16330 0 R 16 [...]
->> endobj
-16259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 696.486 271.126 707.39]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa809bff4b85d09cd801e5e5cde1b8c06) >>
->> endobj
-16260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.463 696.486 346.393 707.39]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.863 684.099 326.259 694.005]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-16287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 662.1 198.26 673.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac93800b9ec7aae75937598e1f2209b1f) >>
->> endobj
-16288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.478 662.1 236.665 673.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.067 662.1 353.317 673.004]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.074 650.519 246.458 661.049]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-16291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.306 637.759 269.939 647.664]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-16292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.464 603.804 223.57 614.708]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a26cdbeaa84beec1df0c9f86b73b20cfb) >>
->> endobj
-16293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.75 603.804 262.938 614.708]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.197 603.804 359.613 614.708]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.224 603.804 400.951 614.708]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.288 581.132 212.768 592.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af47944944e16e786df5c0671e7baa995) >>
->> endobj
-16297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.771 581.132 252.959 592.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.896 581.132 375.145 592.036]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.616 569.551 286 580.081]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-16300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.401 556.791 277.928 566.696]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-16301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.443 534.792 250.099 545.696]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a4f514edad990412bd66cc666347103ab) >>
->> endobj
-16302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.258 534.792 289.446 545.696]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.772 534.792 379.512 545.696]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-16304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 534.792 513.996 545.696]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 522.837 416.369 533.74]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-16306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.304 509.241 439.335 521.406]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 488.451 261.881 499.355]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a08e91d11b3deb5b694356b5573d2547a) >>
->> endobj
-16308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.098 488.451 300.286 499.355]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.764 488.451 388.504 499.355]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-16310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.95 488.451 520.199 499.355]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.985 476.496 416.369 487.4]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-16312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.87 462.901 449.708 475.066]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.091 442.11 250.748 453.014]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a50e1047c49fffb06bc5089a06a051a3d) >>
->> endobj
-16314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.068 442.11 357.317 453.014]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.405 442.11 456.145 453.014]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-16316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 430.155 202.344 441.059]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.005 417.769 446.071 428.725]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 395.77 261.881 406.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_acbc86683af6afc0818cc9e980a84fcb8) >>
->> endobj
-16319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.022 395.77 365.272 406.674]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.052 395.77 460.793 406.674]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
->> endobj
-16321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 383.815 202.344 394.719]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.222 371.428 466.67 382.384]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.933 349.429 239.984 360.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae89cd985111a1a27c60a6fcc28ae9788) >>
->> endobj
-16324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.633 349.429 280.82 360.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.855 349.429 405.104 360.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 349.429 513.996 360.333]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 337.474 171.361 348.378]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 337.474 478.077 348.378]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-16328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.257 323.879 432.092 337.037]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-16329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.436 301.886 251.209 312.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a371deb67f73bf27ac9a7ff6f2216db9c) >>
->> endobj
-16330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.361 301.886 290.549 312.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.719 301.886 409.969 312.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 301.886 513.996 312.79]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 289.931 171.361 300.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.693 289.931 478.077 300.834]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
->> endobj
-16334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.114 276.335 456.992 289.493]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-16335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 254.342 224.57 265.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a98c785602c5af8f7e0c1be92bb5e8b71) >>
->> endobj
-16336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.908 254.342 299.838 265.246]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 241.956 347.869 251.861]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-16338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 230.916 196.297 241.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6b987d283ce345c52b5d193c0688ad28) >>
->> endobj
-16339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.439 230.916 279.215 241.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-16340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.718 230.916 432.878 241.82]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
->> endobj
-16341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.827 230.916 513.996 241.82]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-16368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 218.961 216.491 229.864]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
->> endobj
-16342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.094 218.961 362.977 229.864]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
->> endobj
-16343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.254 218.961 475.081 229.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 194.619 164.537 204.524]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-16345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 183.579 273.129 194.483]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a90016052cbe535d7e8b1e20a2c599053) >>
->> endobj
-16346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.944 183.579 352.41 194.483]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-16347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.209 183.579 495.961 194.483]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-16348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.978 160.152 275.007 171.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac26060b9b14465d4f1d948ab9c838c9c) >>
->> endobj
-16349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.101 160.152 362.877 171.056]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-16350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.682 160.152 472.148 171.056]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-16351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.234 148.197 233.986 159.101]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-16352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 113.812 255.564 124.716]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae10fbc38125e63858549f5ec8a25e046) >>
->> endobj
-16353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 88.876 255.574 99.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7366f9b91109b63f078e963bccd9f5b4) >>
->> endobj
-16354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.912 88.876 330.842 99.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 76.49 373.782 86.395]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16361 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16365 0 obj <<
-/D [16363 0 R /XYZ 89 770.89 null]
->> endobj
-16369 0 obj <<
-/D [16363 0 R /XYZ 90 128.837 null]
->> endobj
-16362 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F68 3032 0 R /F110 1507 0 R /F39 2320 0 R /F11 613 0 R /F66 3179 0 R /F42 531 0 R /F67 3037 0 R /F38 3426 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16437 0 obj <<
-/Length 2254      
-/Filter /FlateDecode
->>
-stream
-x��[[s�6~���SV��`� 2��3mRo�n�l���l���"ls+^JR���� �]$E��Ɲ�C"�< p��
%l�����חg��.rm�6.�
�r��/���`�Y�|��Am׆Q������˵|v���ٯg
a��	⎱
�>��
ng`D]�8(�аL
-�;c}��3\肛:ٸ�!
�0���
-|2M�/�W
����ċ8�gR��P탒".^�0ȅ������t#��-���^�<����e�M�]@����Q����>���
-?�{'yq�����rebs1a��R$��(߬�\���n���V�l�X�i�����Gr?B
���i5N�JqV��T
�L`!�1K�<�
�c -%���
���m[r��t��-І"
�	�R��-W��E
�9�aFܲ��"7����J�� �B-L
qLk!�WM��/D������Zn�0��AtS(򃖑�����
I8UX�J
-^�� DԳq��M��w�E~�D�F6���{�q�
*K�)G���E(dE0`��c����/"9K�\L��}xy
��,PK�ʕi"�"
-�>�,l-��}�?�,�*bX�E>���B�
�EOq��?�
M2(8]�:�Z`.�j����
-Z�]Z ����ʵ����b�M
�j�ִ ��� ��W�HKO�9j�8P2�·i��l���wha�h-H2Ѵ��>hA*�-w7�� �&�Rl����:7wPx�
�?]�����R�~u@�YpJ�I�C�MUظ֟
U��yhפ}f�E�@`%��{
�E�����|�!Z�4��_sF�xv~a:�ӧs
yr\�
�$)8l�<��7zC����U{���D*3�l�e��
-NMo�)6���چ�d�#�O�=jR��P�X
@�p��O�
�,�AT
�s�(�ʟ�#��o�C�*g}3�q�A�
3�|Z1u�ń�N2����#bO��OF	�����G%x%d�����T���~
�
-5�Z]\@?�p`+�#{'�+�LM{����e&���;ᄌ�����N��ś �7`�V�]=�iI�n�V*�n�o+�x
��b��L�Α�z�����T6ۀ�7r��Pv:8碚e��'�o|8��+�n:��g}41"�BX�A��\"R�}Ї���/�3(�S ��P��u�I��K
R���Aԑn�y�0�^��G0�_-��,Em���@��c}�XKۄ}v� �Ǣ�y5
��
, ��z�������"�/�]�x�A��!
k�$RϴOR��/����
�ʋ|1)'���
-�T��t�;��8"�G��'�/
����6k�ˎ/@MH>��1,�AmB�A�v�id������.u]k�
-;�>�_��w�t�܊t��
|�k�<�z���d��)Åޑ�nƤ:l
-W&��2�˸�S�&��Fԕ�n߶
���w':J�� eA�Pǃ�
-�������\m� �q�i�Un#�TcU�����*B��%��0��Hh5�ې�,޲*5�\U����X
$Z��#�^�i
x�M������e��_{
-�1e����i
z��kXu�K�5�=�@��V��{I7��Q�s�7�ж�"N�/ �\�?�Do� ��yG�?'4��Id�ܱ��I�g��fi���q��8�y\�?'w���N���K�m�bF}9z�+-�0����2
n"��
��V�F�N�0�rTkbF,]CQ����o"_d�cR�
��L��dU�gl�B��6�}:S�� &�
-7r�}S�� p��N&�@�h<��.ȶb��"�-���&���ރ
[���m��O��0��C�x�';�
�׮�����
�z��>��/C0��/�Mv�ٞ�<�ӟ�.��>Ȱ��f��WK�2� ��m��LncD����7
F��˓�l�A�gT��I[��FW]�Z�|���KYk
�����6���e� ���0u˲s��c���� �X�r*;f����V�}a�aT�S*�����o��kI��/��˛}�c��f̝!~
-B@����ʌ�����I�T�[
-���_d�4��y�=���f�y^����q'Μ&I!��
�����A>5����G�U?D��
�Wsn���k��
S�8R�M
��ӭ`�U=a�+�����x�\T
�e���w}��L��_*!/ڗ�<�CJ� HSMHE��(�T��/����\��8�B����<O^��_�o �7X�
��
-_�e�Ʃ(sT�*,���~�.E�
-endstream
-endobj
-16436 0 obj <<
-/Type /Page
-/Contents 16437 0 R
-/Resources 16435 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16196 0 R
-/Annots [ 16356 0 R 16357 0 R 16358 0 R 16359 0 R 16360 0 R 16385 0 R 16386 0 R 16387 0 R 16388 0 R 16389 0 R 16390 0 R 16391 0 R 16392 0 R 16393 0 R 16394 0 R 16395 0 R 16396 0 R 16397 0 R 16398 0 R 16399 0 R 16400 0 R 16401 0 R 16402 0 R 16403 0 R 16404 0 R 16405 0 R 16406 0 R 16407 0 R 16408 0 R 16409 0 R 16410 0 R 16411 0 R 16412 0 R 16413 0 R 16414 0 R 16415 0 R 16416 0 R 16417 0 R 16418 0 R 16419 0 R 16420 0 R 16421 0 R 16422 0 R 16423 0 R 16424 0 R 16425 0 R 16426 0 R 16427 0 R 16 [...]
->> endobj
-16356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.502 707.957 303.534 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a281b8db6a8e0014ab2c41dd15f8c0708) >>
->> endobj
-16357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.676 707.957 377.606 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.017 707.957 494.845 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.079 683.302 390.169 693.207]
-/A << /S /GoTo /D (index_limited_extrapolation) >>
->> endobj
-16360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 672.343 208.508 682.248]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.637 660.988 311.746 671.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1a3647877302fc6e0e583b8b881a7a4f) >>
->> endobj
-16386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.158 660.988 390.088 671.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.169 660.988 513.996 671.892]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.894 636.333 392.558 646.238]
-/A << /S /GoTo /D (index_bounded_extrapolation) >>
->> endobj
-16389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 625.374 208.508 635.279]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 614.02 236.197 624.924]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af074d4d4d406dd065812b32cc8714222) >>
->> endobj
-16391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.534 614.02 311.464 624.924]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.542 601.32 359.338 611.225]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 589.965 214.06 600.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6e9d9dd7740b414d407c16687c99a88e) >>
->> endobj
-16394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.398 589.965 289.328 600.869]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.871 563.918 284.525 574.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_acf531d280805472a54c22fed0f689932) >>
->> endobj
-16396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.405 563.918 359.335 574.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.78 563.918 477.607 574.822]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.079 539.263 390.169 549.168]
-/A << /S /GoTo /D (index_limited_extrapolation) >>
->> endobj
-16399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 528.304 192.566 538.209]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.197 516.95 291.929 527.853]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9764ef2f159cfdcca3f151e899bd43ef) >>
->> endobj
-16401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.46 516.95 369.39 527.853]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.041 516.95 491.868 527.853]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.894 492.294 392.558 502.199]
-/A << /S /GoTo /D (index_bounded_extrapolation) >>
->> endobj
-16404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.268 481.335 192.566 491.24]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 430.93 289.866 441.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a527e7c81841bbcf1963c6e260dadfe01) >>
->> endobj
-16406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.681 430.93 359.324 441.834]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 406.876 290.971 417.78]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa6b6fed08414c86d33fc4a44c59e9e22) >>
->> endobj
-16408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.787 406.876 360.43 417.78]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 382.821 224.003 393.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a87ebe6f7cd176227f61c6d0fe47a4f68) >>
->> endobj
-16410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.34 382.821 299.27 393.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.695 370.121 272.49 380.026]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-16412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 358.767 254.15 369.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3065d01256aa333117e0ee24d99b4431) >>
->> endobj
-16413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.487 358.767 338.263 369.67]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-16414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 334.712 284.585 345.616]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_adee3b5c0c3800ce2214e68a156cbcf77) >>
->> endobj
-16415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.401 334.712 354.044 345.616]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 287.743 241.726 298.647]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5c5da855445b7c877a626d824dfce64e) >>
->> endobj
-16417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.617 275.043 407.658 284.948]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-16418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 263.689 249.318 274.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6b737abc8f33b2a2362e3f9c9ab08d58) >>
->> endobj
-16419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.134 263.689 288.321 274.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.875 263.689 371.519 274.593]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 239.634 240.62 250.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a418f9959fe50f163773ad9de147821ed) >>
->> endobj
-16422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.958 239.634 324.734 250.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-16423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.313 239.634 389.5 250.538]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 176.529 180.773 187.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0c58bbc8bf8db5f570da3db42a0ae2f7) >>
->> endobj
-16425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 150.482 180.198 161.386]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9bc768bb8d7d9b971b44b8b3be738963) >>
->> endobj
-16426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 150.482 231.943 161.386]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 126.427 193.029 137.331]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a547a8d96908afe5a7f9e4ba2e10d7ac8) >>
->> endobj
-16428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 100.38 193.029 111.284]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) >>
->> endobj
-16429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 165.911 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1d7db8ee4d8972c1818a36d6517ebbff) >>
->> endobj
-16434 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16438 0 obj <<
-/D [16436 0 R /XYZ 89 770.89 null]
->> endobj
-16439 0 obj <<
-/D [16436 0 R /XYZ 90 605.305 null]
->> endobj
-16440 0 obj <<
-/D [16436 0 R /XYZ 90 193.582 null]
->> endobj
-16441 0 obj <<
-/D [16436 0 R /XYZ 90 141.767 null]
->> endobj
-16442 0 obj <<
-/D [16436 0 R /XYZ 90 115.72 null]
->> endobj
-16443 0 obj <<
-/D [16436 0 R /XYZ 90 89.672 null]
->> endobj
-16435 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16504 0 obj <<
-/Length 2154      
-/Filter /FlateDecode
->>
-stream
-x��Z�o�F��\	��s�4�M�n��7�.�H
�"�Q^�P��}�
�H����N�
֐���{׼l�,l�x�����Ǭ .u��+��g�q�)���F>�/�xv9'x�y^�)���v͓:
-ߤ�:������s���b�����"!t�
���/b�2�uf	�_�t������a�hJ
��V����
[	���ˆ��Qu�-�2�ͬ���`����b2`�L��d��Qhz� B4��uZ4B�q���{��������Lw"�z���~۩Y�f����!�%]�rl� Q�]D���Ǽ�G&s0�LǍH���t� ףm���uԔf:����f
�|3�"�cN�)�Z�l��E

-�q�Z
B�
#;J��(����Z�ef�K��рw��ԚH�ife�쏗_�V�JES�(ךv*�=��Q;ą"�&@+�
�+Z��Z��6���zn;�2��E�v�1z�מ��S~���B7�9�f��?�MԤ��&�
��"��<�o���B�ߵВM^u*A at j�(?U�Q
�9S͞lg�
Qa�|�F����1
-��M%��Rѝ��g۹��-���ԅ[����o�
?�N�'�њ#6q̅��d_���+51�n�L��
��
e����z�>�Q#�1
��錢.�)�yYoC����Ͷ����,7ee���r�pq�ִ^ȧ���L11O��b�	X�����[�	$�,�,o�j���8�T�4=j̭c�v0ů{�)+A���P�����*��mx]|>��c:�yTD2
Y�G�w���>I�|I0`�"߱�>�8
��o
�u�	� �Czp�H�0�X�ͼ��]&1��t��@�V9��\���#��?�������D"F�nj�]ɠ�ԟ]n�so���oy���T�_o�X_q@��	�H� p�	;�����9Is^X���G��������J2U3(�Qt���i�1ɖ�b>d�hRf��i��L��,.��n!��Q��h5�H�I����	�$ȴ�7?Ršǒ�m��Pb
�}�b+��'��
�2b[
#��Տ%?]��10
	tԴ�� ��y�vR�n�e"�Gu��3��鹩Z
-KJH
�s�#�졠}P{�49\Z�Me2
=��\t��O,w�ϣ���L��g�h�ki�i�Y�$C]�q�B��P����C-�.��1	�)�5�s\^��t"�Y6<nTJ�da�~h~|i���8x�BKUf�j�n8���OΦG��wAX�3�*X�x!�1<|�q،M+��c4��&͒aNW
���z��f��S�'�<۔ *^7)
-~��T�Pqt����uf� ���+�Yܦ�6�u̱Td��ۃ�ξ�ǯ��_�^�y����_G
.��ri
$Q�W��j���X�� 9�}Y���=�AT���J9�Q|c�qN4��6��#�p7����!�$b�g�w��{QT�Q��l�|�
�.
v��o�T3�Qǟ�>��ʊt٧��Π��ј&
-��ז�
J5�C���
�#��jw at E�AʥSl��Q��� ̔��3�F��ի ,�ܤJE�k�x'��܎<PmG~w �}f���f	
-�6�>��^0��~�+�޽^&yQ��~~�`�
�t?3�&�����uh-��u��:H�{�,o�
`RBRxPB����'C.�C�
���=�_!}9�yzܟ���>c��Ox��@m�U�vm
�;G�Rlu>)i
���K��J��t9�p����
��C.�
]�n�_�]�����I���zG���D<�|�M+�L�\a2d�P�9
؏C
f6�uX����NR
���
-��N#`P�W��c��=�(
�2G`
��F��	_;�Z��1?4L�S@��OMUm0qy�e�����b/3
��Y���
/�N�]����<��F,�:-��ƑU��%�	�n�U�cڬu�P
-
-�`��E�?�ewy R����+����j�0��]!G{�����vC\���FUɮzR�
˦ރ���Ғq1� @�F�ߟr)�(�zJݓr���e{���{����n�K��+y
�Ģ�Q�iO��}�����iA��j��oki��?�������
�����Q�i���f%x�Bq��uC=> g�v76$��ࢬ�chx���7��������.m%���#L<u�
-�zm��
h^�]����ﮨ��N��
-endstream
-endobj
-16503 0 obj <<
-/Type /Page
-/Contents 16504 0 R
-/Resources 16502 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16196 0 R
-/Annots [ 16430 0 R 16431 0 R 16432 0 R 16433 0 R 16457 0 R 16458 0 R 16459 0 R 16460 0 R 16461 0 R 16462 0 R 16463 0 R 16464 0 R 16465 0 R 16466 0 R 16467 0 R 16468 0 R 16469 0 R 16470 0 R 16471 0 R 16472 0 R 16473 0 R 16474 0 R 16475 0 R 16476 0 R 16477 0 R 16478 0 R 16479 0 R 16480 0 R 16481 0 R 16482 0 R 16483 0 R 16484 0 R 16485 0 R 16486 0 R 16487 0 R 16488 0 R 16516 0 R 16489 0 R 16490 0 R 16491 0 R 16492 0 R 16493 0 R 16494 0 R 16501 0 R ]
->> endobj
-16430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 696.255 187.689 706.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa38fbbd15d5dc2e98d5b24c92b06c290) >>
->> endobj
-16431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.557 682.137 476.544 692.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) >>
->> endobj
-16432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 658.779 202.902 669.683]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-16433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 658.779 300.037 669.683]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6c7c72e56241da463eaeccdff79b6d49) >>
->> endobj
-16457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 632.636 202.902 643.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-16458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 632.636 314.263 643.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa78179b1d8478dce6cf572af8e0b9cb4) >>
->> endobj
-16459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.819 606.866 199.864 617.397]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a86d2bbceaa288f2f605ac88516d313cb) >>
->> endobj
-16460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 537.671 203.075 548.575]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 537.671 296.324 548.575]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
->> endobj
-16462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.377 522.81 355.085 532.715]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 509.295 287.856 520.199]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3b49993a1cd4fc6891da88a6259b9f93) >>
->> endobj
-16464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 481.292 194.297 491.823]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa39bdf85d6db02629fa73bbcaddab6d5) >>
->> endobj
-16465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 452.916 188.759 463.446]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae58a861a42c5216a2267e3f94ecaec8c) >>
->> endobj
-16466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 424.166 294.481 435.07]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af496ec55802726ee3b39e52458ab0647) >>
->> endobj
-16467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 353.232 161.84 364.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab6ab1820f2fdf444d1431ff3af424451) >>
->> endobj
-16468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.559 353.232 297.202 364.136]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.765 353.232 456.154 364.136]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
->> endobj
-16470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 324.855 161.84 335.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab4959b3da46291de301d9150f5afc3aa) >>
->> endobj
-16471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.178 324.855 237.107 335.759]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.672 324.855 330.138 335.759]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-16473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.937 324.855 473.688 335.759]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-16474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 296.479 161.84 307.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a858e0030826ee6c29545a934166874ef) >>
->> endobj
-16475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.08 296.479 332.907 307.383]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 268.103 161.84 279.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1cecffe684d1faa9b0f6b8d4f227e9ae) >>
->> endobj
-16477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.559 268.103 309.386 279.007]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
->> endobj
-16478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.915 268.103 390.859 279.007]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-16479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 239.726 161.84 250.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad6d1e866b7ba9bf4233f3a5254cda0f9) >>
->> endobj
-16480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.08 239.726 331.224 250.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-16481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 211.35 161.84 222.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_afc2a04d2049183cddbcf70316fdf40e7) >>
->> endobj
-16482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.559 211.35 307.702 222.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
->> endobj
-16483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.789 211.35 389.734 222.254]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
->> endobj
-16484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 171.018 161.84 181.922]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1c30b772596f8f342d0f05b9b142a932) >>
->> endobj
-16485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.33 171.018 274.93 181.922]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
->> endobj
-16486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.471 171.018 316.198 181.922]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.567 171.018 431.033 181.922]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-16488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.126 171.018 513.996 181.922]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-16516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 159.437 180.102 169.967]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
->> endobj
-16489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 130.687 161.84 141.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.58 130.687 213.387 141.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af15f956dac6d4b19ecd8fee0f9718f29) >>
->> endobj
-16491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.724 130.687 288.654 141.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.43 102.31 261.459 113.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a249ea59c1765ea299f4d9471388aa5f9) >>
->> endobj
-16493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.827 102.31 344.603 113.214]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-16494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.502 102.31 455.968 113.214]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
->> endobj
-16501 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16505 0 obj <<
-/D [16503 0 R /XYZ 89 770.89 null]
->> endobj
-16506 0 obj <<
-/D [16503 0 R /XYZ 90 711.269 null]
->> endobj
-16507 0 obj <<
-/D [16503 0 R /XYZ 90 674.167 null]
->> endobj
-16508 0 obj <<
-/D [16503 0 R /XYZ 90 648.023 null]
->> endobj
-16509 0 obj <<
-/D [16503 0 R /XYZ 90 556.821 null]
->> endobj
-16510 0 obj <<
-/D [16503 0 R /XYZ 90 556.821 null]
->> endobj
-16511 0 obj <<
-/D [16503 0 R /XYZ 90 526.795 null]
->> endobj
-16512 0 obj <<
-/D [16503 0 R /XYZ 90 498.419 null]
->> endobj
-16513 0 obj <<
-/D [16503 0 R /XYZ 90 471.114 null]
->> endobj
-16514 0 obj <<
-/D [16503 0 R /XYZ 90 442.738 null]
->> endobj
-16515 0 obj <<
-/D [16503 0 R /XYZ 90 372.466 null]
->> endobj
-16517 0 obj <<
-/D [16503 0 R /XYZ 90 148.187 null]
->> endobj
-16502 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F67 3037 0 R /F60 532 0 R /F90 758 0 R /F39 2320 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16566 0 obj <<
-/Length 2400      
-/Filter /FlateDecode
->>
-stream
-x��Z[w�6~���t�s, 	^�i��&q7����ާ�G�� ��TI*���;�
E�-'�K7/
sÇ�Թu����?oN�.׉H�s߹Y9u/"‡���n"8��z���!a��T��_.o^_�\���뛓�N
Q�i����O��J�%t��P�F�s��֎�]�Ϝ���P#
m��ӖL���sC'`�0�xϹP��ijN@��2�Ϗ���\o���8��Zt< �Z�����'"
N���㵜θ�����Ŕ�IQ��Zw��.ݛ����)�8���Wŀ L0"\�.�]#��3
-�L
F"!4%�"]k��[㌷?�8�f<����?��7��xHAf9��\��|*t�i����&E^M٤
_�'��ڣ�p�^�9�k�Ə����	��I��r)	�V}1`�.ߎK��.���Y�QA<�r�2ʠ� "~v��M��ո?As���e|�L�2��"�c����26�V��t���,�1™�|Dž^�8�����xp��B����߼H��V�j�հOXG��V�
`���V���1A�0�,�%��,5R��yR��
��YX��K'�
-4��;�@S��+M�9��l����6��4D
I�@��O���3"��u�=-�u
�ilx8�RB�Lj��]?��Bi �
�Au�
]j`�q��4����ت��t?���C�z��|=��9�>��r�YąGx����
Ȟ��
���L̈H��b
2:l����Q�����
���NĐw9%^�,��
i�24��#����!=���>
@�L@��)�8 h~�4?�����B����i%)%�o�-�&�,�z�,XȤP���#��am	Hj�1�n09`�-u
�K�x���9FM����V5��R��:��ʛg
�
=
-�b,T%j_Y�
2�r�[�P8�7y����!	8
-@��@k���Z�
� Z�z�V�24�p�"�s�VBy���
R:�	�Y���,`]����R(3�
�
�ܢv���{��w�O
��F}
-~���
�¯
����t
�^r�V{O)OR�ׇ�̳��m�"��c�f�'Ύ�5g��.��L-�h~R�
jU/
b����n ���
��Dt\�������Hx�:����~��Je:��4��
�m�ݒ�"���O�}B�� ����3�^��U]�x�93��L�����B�9�^�� ���1 Ju|�tUd�;�,�9���S�NB/��8�l���gS��c
���s�{O���G�� @u��D�R
yp�SFz8�,�5qc������Mu 1b�	����( >o��>���L�j����,�eWH�
��EQd�m�o�=��Ϗ��/��>��oe�-�A/C����\]n個�
';�D��^�,��̳�I�WCkx	�t$!ߡ@Hl,��KC�z��wݨ�Lwc쭮x���c���(�ґ��������%Ơ>��3�{ч��
���A�������t�)�M9�92^�s¦3F�2�d
��M�_�*)�M�/���f���
���f�IWUs�ݨ���Ui�
v
�ʥ�aL(o��b�?��To��m��gX��X�����lj\4��=�􌤶�W�8��6�]�{��}	���
u|X$ x0��.�	�|��_��ZTĔ��#��Ʀ&�����<'�i,���62I�,T�
q��%ds���>��dyZۙ���k�V�B��e�j#��s9��\���΀�D�&lZ%��LZQ<t�#8~��c]'B�������~Hq/�&jO*� Bڴ6��w�!�jx�UzlSTU�Ȥ~�
#����}���.;"�!�oL���ꒅ�ч��
���;	�k��esal�Ӷ�
3�D�
�Y�|U�A}�Z���
��TMӗ�p6J]����,#f36hu��u ��ibH�EaH3�\���|�h�~Кa�ȍj�P��6_�ꌆG]�W���O,��Z1���YwC��\3���C7
�`f���ھel�,6j���44AW�����.
q]�����~���*��
[�]#s##�_�iu4�m�(�p�T;B�Pʤ(���
Ms'
�(
�߰�ǿux9�tT�
�v<�	
b��r��뙓H�v��
�
�G���k�%��@{O�M1�r{
ٿI<�l��ؐ�S�$!	�檙�/�h��r�]�ا��� X
rY!e�dE�

-t6V��-λ����bu�Bn��gq��r��^�����٬^6�l�l����ކ��R�4���}h��ɖ�ut��z�ud�
�?:
-��9	�$>��D�ED�>��
�:ʂ���v[
�9�����u^�l�n�f{��[�V�2H|�h7����I7�[���S!����|k���is���P ���#���k�>4b��w�
-�`�B뮮7�gg��-�t�$)֏����("t�b�I7ׅ
�4_�7
i����7�P
-endstream
-endobj
-16565 0 obj <<
-/Type /Page
-/Contents 16566 0 R
-/Resources 16564 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16196 0 R
-/Annots [ 16495 0 R 16496 0 R 16497 0 R 16498 0 R 16499 0 R 16500 0 R 16527 0 R 16528 0 R 16529 0 R 16530 0 R 16531 0 R 16532 0 R 16533 0 R 16534 0 R 16535 0 R 16536 0 R 16537 0 R 16538 0 R 16539 0 R 16540 0 R 16541 0 R 16542 0 R 16543 0 R 16544 0 R 16545 0 R 16546 0 R 16547 0 R 16548 0 R 16549 0 R 16550 0 R 16551 0 R 16552 0 R 16553 0 R 16554 0 R 16555 0 R 16556 0 R 16557 0 R 16558 0 R 16559 0 R 16560 0 R 16561 0 R 16563 0 R ]
->> endobj
-16495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.332 696.002 255.546 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af8c0f1f8dc80d82fed8943f2c5737d2d) >>
->> endobj
-16496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.716 696.002 338.132 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.795 696.002 379.522 706.906]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.623 684.047 223.266 694.951]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.7 684.047 337.116 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.973 684.047 378.699 694.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.734 588.245 280.729 599.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a76c9012a376984a1b88823a59bd5bcde) >>
->> endobj
-16528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.364 588.245 361.779 599.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.675 588.245 402.402 599.149]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.73 576.289 242.373 587.193]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.435 576.289 377.684 587.193]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.594 561.224 369.497 571.13]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.372 524.591 287.242 535.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) >>
->> endobj
-16534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.515 524.591 370.931 535.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
->> endobj
-16535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.146 524.591 412.872 535.495]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
->> endobj
-16536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.555 512.636 262.198 523.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.576 512.636 397.825 523.54]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [422.988 512.636 469.005 523.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.087 501.055 190.104 511.585]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.878 501.055 298.895 511.585]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
->> endobj
-16541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 401.511 226.034 412.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad84befb6d0ded481871cbef1b7306824) >>
->> endobj
-16542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 401.511 369.106 412.415]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 372.727 156.281 383.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a941caad4d0717e0fab30bf246adc0370) >>
->> endobj
-16544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 372.727 208.027 383.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.238 372.727 274.168 383.631]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 343.943 180.54 354.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af882ff84afd3c2507e17ffa62ffd20a0) >>
->> endobj
-16547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 343.943 255.807 354.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.54 343.943 345.47 354.847]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 315.159 178.239 326.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) >>
->> endobj
-16550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 315.159 253.506 326.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.239 315.159 343.169 326.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 286.375 156.281 297.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a941caad4d0717e0fab30bf246adc0370) >>
->> endobj
-16553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 286.375 208.027 297.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.238 286.375 274.168 297.279]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 272.979 178.239 283.883]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) >>
->> endobj
-16556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 272.979 253.506 283.883]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.239 272.979 343.169 283.883]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 197.611 225.75 208.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
->> endobj
-16559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [122.445 168.032 277.732 178.936]
-/A << /S /GoTo /D (index_representation) >>
->> endobj
-16560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [443.233 114.542 502.79 125.446]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [100.734 102.587 174.677 113.599]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
->> endobj
-16563 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16567 0 obj <<
-/D [16565 0 R /XYZ 89 770.89 null]
->> endobj
-16568 0 obj <<
-/D [16565 0 R /XYZ 90 619.553 null]
->> endobj
-16569 0 obj <<
-/D [16565 0 R /XYZ 90 448.227 null]
->> endobj
-16570 0 obj <<
-/D [16565 0 R /XYZ 90 258.405 null]
->> endobj
-16564 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F39 2320 0 R /F11 613 0 R /F93 763 0 R /F90 758 0 R /F110 1507 0 R /F32 764 0 R /F10 765 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16581 0 obj <<
-/Length 2058      
-/Filter /FlateDecode
->>
-stream
-x��Y[w۸~���[�m�  ������6g��
7q�%ٓQ��]�d*���;�
E�r�c{��� 03�|s!H�M@�7��x��,
-R�<
��AA�,)�H�m|%9_D�R^-
e��������U�N~��Zv�;^^��,�zqA��;��
�Ske�T]*�'�g�_��������h��&�dyP�/>�B�L�Pypc��A�cx������(:6.�#�MI�A�a���sa6�l��H���F��rV�M�:�WM���
���~��#��S�G�<0L�+?h�-Xo�������
-ZE^�k�M�N��j�w)A���Uݣ�AN��"0��Zր���p�j4 ^��8�Q.i��A��g~Y���*��)mh�P�%
�"q�T����]��7�U�V�Z0ޖ�E�٥j�9�
�]�<�E
-�
#�S�F:���i
.�]v�7 y��fsl�
�f���=��n�U�W�
�9	
�V�%
߃h����8��3`A�w��Vu�q��Ƨ�|
���/��s�\�p���a����?���:��Gij}c
�oF9jЄ�ɁP����Pne�Q�W�8 D!F
��٨s��
H��C	��vrm�	%��T���6���JuB���+�����6�����,�������KKY+b��ĮaFh�Ȩf$~�i��.��J��t�5{���n��
��!Q:^�ʱ¸<eR�V� �p�/^��"e5��I5�!�n�ʩx��� Ͷ�G��t�!����S�>&�Fˤ,
���c���D�Y��$<�c_:�)&�G�`�b��Uee�r��y�R�v���Y��
�[H�p(_�����޺� �]�h��k�E	#"��2A�<�ײ���tH��S�lZ<����
�[��M
g�π��3
��n�����yF۽�6=����
?tvnu B
 �.�C�38�tbV�#��F'�IO�#N�OuM4.^B��'�vc����XQ��4��|�7���}����Q��(-uZ݁�A�
c�
-²Ÿ�;K�))2hU�"#i‚���iH� 4!ID#"��f�G�l#`Q����N����b�;� ��n���M��;��-r���%t�
�xث�<T&}�s�wv9�0ދ�g<�0�xtg� ��Gs����g�J���[
���=0
�����v�4��ٮJO�(?�8"�8)8���dEa5�ٹj���oQ!:��
�s�G�ew{�) ����9�B�
�d���ޞ3����c˴=ρ,�dN]B�F�b��v�T٬��Pص}��1.1���.�m�� ���C>���q�5��h�(4�j��"
G+?�X�g�Jy��������W{;ƒj
�����fp��]Ӄ ��8���� ��{�;B��8�ҨIUk����[K�����]������	��
���3���FH�n�����p#�B���5�8N�9��$w8��1�q��\Z��hҨ��v^.m�a��
y;q��ˮ��ݥat��`q�t�07|8�suR����G�<N��۬m�`_�>��&��/��{,2�x
'�ܜ�f|�m`6Y�f��{,¹��wf!!
��hڡ��g��U�繓17&�Sn
�V��
��f��j������s�y%��ʧ�?���%��~�
-̟R�c��y�)��`4�\,��A0��͡6A�:�^F��"�Vd|J����:��S�V�٪
'`}Q|�*�T�;=t
�yQ6�i��9Z�� Y���KI�7�Կo5f�[�#�
Nk��%��b��k0/�9�y�9$��ɸ�{.[�q4�� ӻ���L�S
6"�l����)��<r`� �
Y��E�C���Zf��mjG�����u�>���w��Y~�o�8�D�T}l͙��I9���!�����
��%H��G	������
f�i!D���oY���Y�oV�[EFL� ��i�^)��U�����e�yR���1ܒm���|�ry�hUoH	��
��
����w���7�㾪aro��k����I�r�	p�g(�e7�Y�n���8�G>���?�0 
-endstream
-endobj
-16580 0 obj <<
-/Type /Page
-/Contents 16581 0 R
-/Resources 16579 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16584 0 R
-/Annots [ 16562 0 R 16583 0 R 16578 0 R ]
->> endobj
-16562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.44 684.047 513.996 694.951]
-/A << /S /GoTo /D (index_representation) >>
->> endobj
-16583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 672.092 156.301 682.996]
-/A << /S /GoTo /D (index_representation) >>
->> endobj
-16578 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16582 0 obj <<
-/D [16580 0 R /XYZ 89 770.89 null]
->> endobj
-16579 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R /F7 795 0 R /F75 554 0 R /F90 758 0 R /F32 764 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16590 0 obj <<
-/Length 2263      
-/Filter /FlateDecode
->>
-stream
-x��Y[s۸~���[���B`2ۙn���%��ƝN'���%��H��bk�
�H��m9�C3�� ��; ��?�����`A������*Hp ��Z��]�)��~�c�b�H�,���_^_]��z���.��>��1
82Xl�����%t�`��j�mQ�"x{����toD��T/+!��%�	�8
-a(��4�w�vWd�9�2dZ�1׋��	�H�$�S�03L�6�A��UUՌ��6/ת���jiof���X6f�u�vUq�d˺*ݔ�Κ]U.-��y��b����HK��`��e?Œ6�QX�EU6m��e�
��9!(���B����
>�e���iFx�Ս����v^*f/
*	�$����7C"�%�IE!�'x�PL����x��P��T��1���sB)"
f���x�o����y�9�� /�Fp1�
}^�JS�3�ߚ7��$���Jt�a>t�$:r�n_��$̚�tk�<@;m���R�2;��aeˮ�,ڴn��u�5���v�
�1v>r�,�.]d��D%�RG ���\:�k2����]]��<mm�:+�:m��1me�Թ4X���3�:=ض[�y�)���
�
��q�s�QAa������g�;Mu���տ�E��î�mY�כTX�����9A�E�7z$BD�`�}g�|f]^�%0~�샒��b3A�DF\r��`
p��G�i��y'D��J{����R�
	Ӣ�T���
X
-/�L�.��蠄�R���`��Yc��ڹ�}�Z�˥��ʎ��M���龱HS��MvX2����9#a�2}�ૼ�0#84X�|��2�<l
u���[M�/��y���4ml���(��I�]�
-�>�G�/�7mae��ڄ�����Dm�K=��m^�����͵��Ӻk
�$����WcF���>�5s���͸Q
-t�ǘ��
��\�2�`�&�vA�	у��tE���
ߓ���v�u�dm�
�n���V�5�jc�r���hTͻj&�H�'j��j"�m���&;�56��ƥ��6��GV�r�`	J�����5
-tV�^�۬l`Rs
p~�mo��Ǩ@D(-���J
�`@N�x�Jâ�x�J�����5��TЂ�_W����ct�4T�C�W����;	
�����|T6x�����H9�]�֮�U��+���i���U#����P�S�H�G����I�����ToZ�7�-]Q/�(���^Zd���q�z�4Yk�M��j�$�v�2$ҫ���ث�<��:���~
�C�T!������!��۪�jos$,R��.����K��i�
-%�G�o�Y$Gg��H�;�I(7T&���c���&P$�
-	,z4�J!C�p��ݖ_��$��_��Ns* �k_���T�D
jNXK�j�NPM
-��X�}̄x
-�L 
���
�p`%��Zb����AQ�j����^�Swr�������C�x�|���HFL*`(fSy�my�>��p�O�h�2#`��wbf�� T����n���8<�3�U"3��D6#
-�󩌤�Ʈ�2����12�z��6�FgMhw��[A%zl`% $��ץ7Cm0׺�}%��$�t��
6��}�~������r�~�Uӥ�a�S	#h��y�
�3p~"�F�S��x��\o�
���Id���h
i#��B��O'm��QҞ�s�O�|���OG�C�K��|A��d�Z��_��t�MUD	F��4����o�>��!y����
I���e=AT�%��G���V��K��˻
�s�T�dжe�y�bD��� �ueq�s{JY�J�X
vT�R_��%plaF��w��
��m���fM
G��N���B/8�����?Z���z�U	�/3}s�ڟf���ӛ"�D?N�����nbm���׷�F��k�R
�r�;4�&�?4}�>��@
�*��<�?����ᙺ{a4Us�2,�`I���_߈Q}#l}�vFB7���Q_�ꚢN��]��ve��J�z���_Uu6���g�=(T�+�=�ұ_���L��6�Q�E�6�/
Wո���s�{�D
�1�X>�
Q�LZ0A��
�/�l�Aw��0!G4�O����~��<�:��
�!�:A 
���|01�'���G(�0����
tsl��[��f=�9��
��vР
Ƒ14�=(���uۛ7?��6Y��r����ܧE�{�]/v�G6��
�6ˬ��\:�2��a�yg�M��_\���MV�Ѣ�z:mF�����U���]�������PF
-endstream
-endobj
-16589 0 obj <<
-/Type /Page
-/Contents 16590 0 R
-/Resources 16588 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16584 0 R
-/Annots [ 16585 0 R 16586 0 R 16587 0 R ]
->> endobj
-16585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 601.013 217.502 608.54]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-16586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.588 187.773 217.502 195.299]
-/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
->> endobj
-16587 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16591 0 obj <<
-/D [16589 0 R /XYZ 89 770.89 null]
->> endobj
-16588 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F32 764 0 R /F7 795 0 R /F75 554 0 R /F24 529 0 R /F8 794 0 R /F1 833 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16595 0 obj <<
-/Length 2371      
-/Filter /FlateDecode
->>
-stream
-x��ZK������-`�
������#Wm��/��5K
I$ @�VԯO�O��ؕ]�!��`�����oz�����ﯾ��z�&d^����Ƌ��� ���`�Œ`�����,�ru���/��N%�\�K�JY�^��O/H��bI���dU��Oj�̚��
-�2
_P������׷W�H�=b%(�����߰���
F,��{C��8e�̼�W����C�w(�C慄 B���
|��/Uu��4��W���Zv��V�)ݲ,e���ؖroW��zg[�;�nw�
�G����N�tU�(�Tl�K��t�2O�UP
s	G���g)����i�Z�Q�
-k���������ܰ{����#(�!|�0�dI(�D�D�!�|c�
F��
��R
�"�!@�%��W���5H�~� ��
-{�N�)��J��ۉ4_p�\᫲N�2�^�2�6�o��^;�h�.����
\ɽ���qA�@*��+;ey�@�O~��C���U5
�F�M�\���}��fBq�h��IC�҄P��[x�C�
KsDB�ωxۭ��d�z݉�
 ��������jB�e�XkΈ�\����ү�����
-�>�Tn�\G�~�!1P�
	4<'�B�C�6
�F"b��2�������^P�0}4\0��2�md�YVh�޷�\I#��.U��X��:�是���t}��Ocn�ـ�V`�t/�j�0Q�0ȓ܃F��8
��w���ݴ#
v�b�)�!���K�!�$�u�\�4�5�'���J�{�v{�S���໧yߝ>�_�p"�CÚ�_w
[f��[]� ��;S�(�f�
�Z��
-�[��S�@]�\�,'�PkyԺ�)a��(%�QJ4s����4��N�������(@P��Rx
�R�cl�y�L�jF���������~2��A2��*�����Y�;n�\
s�Ә�X�O���Z%nsщ0Q�3���f���RZ����P�y���FW�&L	P-
��a�l�J9/m1"L�XD�u�r�j�A
�Ae|<�
-�
�W�����2��9cF#����/�����F��
[aˉ���"O���:��c�)���`��g�L!����Ը�S���W�C�'
�+:ݞk�� 1� ���*kS���VO��TP��^>x�g�7�!W�xb�Tv�~
qeV#w��y5�1#����&P��??�G�����͂Q���K�/>�Uu�k�Jҽ�u
T�"����
��mI4T��*W�FY��'H�{��m5��m�Ҽ���U{(
z6=
/�t�C�Z꿚ynZ����L{���"z����^jh��cJ����^�
�s��IsA�?��жz����{U�
����{�<]`8"�|�Js�o�.���A�"޿(�� ����2�#�{�f�n�+P�͋�|à
s
6=%��1@OB�t
�s�Q�� ��1��G�� �L0�(��\����T���� �E 
-��
-��
��7�[͑��
 
�g�;J-!�}B��Q+�O�R�� 
-�I�'<�ԣ��I�ܫz.��x�R&iHQ��u�/�+���@ٚ�Ed�s��Q�6�#`:˄�D�L�>H6�h1t����6��5�
6G}��ڮ*��:瘋�5(̘�c�Ƶ+f��'�V�O�u�`��`K
w�I�	R�^�[
-,t�Y;��s������ށ8ܿ�u���|�L�*|���M�t�� J�wn�p�`���z�\�8� ࠲S
-�_?��s��֪��g{Ϸg
�8��g;�ʫ��* ���ʾ�enw�>��Z�M����~z
�N-A��wÖ��>V�j7w�x��̧��-�7O���%�O۱
\B]IRsS�(0K����E�P��n��7]m�TuɌ��x�%v^�^��.�>���������I�m>o�
zL���]
f�Q�(x�3x�
�����
.f�p�X71:�b!��d�p��u�
i�����l��J�530)
��5�lK�H����	��PE
�LB�K�"��>�,,�j
-̜�JF�	�pמ��ʧ`���#�µk� E�nS�(=�y�N����b���X�e���-�q�i��12�5��\�,0��y�"f�&,T$j�Zz�&j(jH��<gE��>�E����N�X�'w���ʪ��ŷ'�%�v��������������Ǫ�&T�a�d�む����?.h~T��u64���!@?l�ܼ��Ar��B 
��?����o�d_{��D�	�u��+��B��kF����� 
]S~Wׇ�/^�
��ʷh]���#<٦��]�/Jw�4o����F�G�	
-�h���
-C�!5��Yl6��o���{
-�~��_U�

-endstream
-endobj
-16594 0 obj <<
-/Type /Page
-/Contents 16595 0 R
-/Resources 16593 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16584 0 R
-/Annots [ 16592 0 R ]
->> endobj
-16592 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16596 0 obj <<
-/D [16594 0 R /XYZ 89 770.89 null]
->> endobj
-16593 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R /F90 758 0 R /F8 794 0 R /F1 833 0 R /F7 795 0 R /F32 764 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16600 0 obj <<
-/Length 2288      
-/Filter /FlateDecode
->>
-stream
-x��[[o�6~ϯ�SW�
爐؇v&���t&۸��A�،#Ԗ\I����
�fQ�
_���$��>��9<ߡ�����]�0��~���@R�M�� {�HH�6�>���їɏ
��@B���ͧ��ۏ�{{��vr���[�#�����˫�_�7��=�X��o�CK�Sׅw��+\a��
-��^*d`�EF"�D at 0��ј`��7I���z�'�hL���+/o���6���&��<J�|��iL9b<pކH����~�.��	 "@L�����
4�;b")bB����}7b�O#B�ͳ��=(�S= ��D�>D�i����MΈ?����"H���
���d$�y�,��Ǝ��
���f@�{1�Y��G�^>谖*$��E��,�C�Y�>�c�bL{c`T D�/
쯗}KJ�R0
�
cq�v�$8L�[
i,;����	`
a��ޚ��M���va,��F`�����{�ʧ��%0	�C�,�z�h&��fn?��$7��̾8�s�Nbg�9�
'�����h1ˀ�ay�-�Qp�?�#���Q</��Ϧ����4�
cjfU�4Y�4�L�8rg�c�p	0��k�*|9\�ܤ���k�{u���-o�{ݸ(a���(Q_`ܚ|M{�!ja�^�`��^�4��2z�yK�B" �$���|���}Se㞸�t#)DB�\$��Zy
��o�S�y[���0nA$"�޿�`�
6y*u��X�Gh��L

:e�zGp�"I,�]�څ���a\�#c�
���;Q�~]��^m�
� ��I]r������0M���/�V�L<]$�n�<��g�/���-��i:�Œ�
-���01�9���T��n�"/��K�6��fˬX��� [�o�q4��b\�U�I�1�\�}�vVG���X�y��9l�9:��g��~�I����<���F �(���K۟>��p���9�P��e��_):����jŞ4�Hpe]'�w���GD��\�@] s_w��/٬�i������B�F]'����囇7�0�z%
�iё0Ӣ�
��]���}����}����ͧ��>�����מqRL��P���P�"קt�aZ��i��ʬ����B�Ed�r�������̇U
�z΋:@�U�+��Ijfu�:�#����Uv��r�6��W�)NOv�Ԯ�F0���#��⡥�<�”H��M��?�K��AK�0���M��e��1
 ���0 ��
c�_G�+���'k�4Y:d�D8봙��uE�qŮ�(�T$ʳ
��$�M��'G޾�
����4C�
Y�b�-3E���� S
�ԉ�ˀ�f��W��
{�:�E�ɐ��b�
��0
���!�PȤ�
�v
}�7���'NFC��cՌ�d�!�~�Z:X�i 4�1jHb�m�Hդa0��U���r��Ԭ�m
h_�>&H�V�zq\�O���m��홆:���k��k�,�	G���FR�=
vZ�&�f4xM�d���&�G
�_�E4{�d��:?H|��	t�E
-�iw��q��ԡ�J7e�H'�ib++�ꌧ���l4=	�R�u3G7(q�ys4ۈ�؊�0�
��E�s�+ k��óf;�0 at Z7����J�s�B��
0I^(	�쑗�|��CEZv���J�*�D�
('H� �Rсp�Vd�֊�
���Q�-G��@�m�f��
Z.���1�0?��R�g3�L��}�Z�
�J��!�����:�.F�
^��C����'���L�J���T�/�9��$�!���'�t�[,��D�`P�	�q"Oԙ"��
�W���޿�`Rʝ�
��
	:ȩs�2�
�`|�ʼD?g� J�b
�s���3��Ƅ�w[c�9����U=�j���"Lͬg���UO=����6㣙��̔����~D���5Az�Ḭ����rnܳ���Q�"�9}�N
g�	�sWt?�� �C�m�X�'�}�ۀn` ��.�6S�
�T�!�w�6��+��J��s�M�&��i
M��bSg
OV�=�$k�u8��W�n	�aa�=�o
ee�Q����O!�9d��|���|����|� ��aK>Û,
U+�ՠ���K�=)N҆*�
8̺����bO{��z�^��^���s�����.R�
�O�VGnJ�� �!-������fݧj�~�d���m͍��xk������|*��l���A��>�~�L�7����S?��:\��m���}X#����� �$#ؿ7���%�����*H��#8���z�������z��x��ɻ��mg�X5�|���LRS�4.�?x�
X�?fQ�u
-endstream
-endobj
-16599 0 obj <<
-/Type /Page
-/Contents 16600 0 R
-/Resources 16598 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16584 0 R
-/Annots [ 16597 0 R ]
->> endobj
-16597 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16601 0 obj <<
-/D [16599 0 R /XYZ 89 770.89 null]
->> endobj
-16602 0 obj <<
-/D [16599 0 R /XYZ 90 721.073 null]
->> endobj
-16519 0 obj <<
-/D [16599 0 R /XYZ 90 704.201 null]
->> endobj
-16603 0 obj <<
-/D [16599 0 R /XYZ 90 704.201 null]
->> endobj
-16604 0 obj <<
-/D [16599 0 R /XYZ 90 633.655 null]
->> endobj
-16520 0 obj <<
-/D [16599 0 R /XYZ 90 562.322 null]
->> endobj
-16605 0 obj <<
-/D [16599 0 R /XYZ 90 557.839 null]
->> endobj
-16521 0 obj <<
-/D [16599 0 R /XYZ 240.245 488.527 null]
->> endobj
-16606 0 obj <<
-/D [16599 0 R /XYZ 90 481.887 null]
->> endobj
-16607 0 obj <<
-/D [16599 0 R /XYZ 90 395.689 null]
->> endobj
-16608 0 obj <<
-/D [16599 0 R /XYZ 90 329.646 null]
->> endobj
-16522 0 obj <<
-/D [16599 0 R /XYZ 90 294.976 null]
->> endobj
-16609 0 obj <<
-/D [16599 0 R /XYZ 90 290.493 null]
->> endobj
-16610 0 obj <<
-/D [16599 0 R /XYZ 90 202.138 null]
->> endobj
-16611 0 obj <<
-/D [16599 0 R /XYZ 90 111.786 null]
->> endobj
-16523 0 obj <<
-/D [16599 0 R /XYZ 90 77.486 null]
->> endobj
-16598 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16615 0 obj <<
-/Length 2371      
-/Filter /FlateDecode
->>
-stream
-x��[[o�6~ϯ�Ӯ
�
/�-{:ә"��n��[L�b3����Jr'��{H],:�%��݇>
�P��G�;��;��`����7���%
4҂���!�8��F\�_��sH0Rt4&��fDp���fDq��׏f��w��<��WW��Qa��Ɣ���<.���g�`�3�N
�e��!�|�����w��]@�R!�H�`����Sh�!��i|u�AD\�����.p=)�(���ROl�S$ҙ!��������sH�kĄv����Q��n�=AE�+�͈QX�!a���PL�js���T;9���gD8��v�^��_1ǣq$px;��͖�<���<.�xYg$GL
- ��\ڮ�T
}��G6�&YZ�U/��4BX���&5y\f�ݧuQ�E��1�Q��1L_s^
�SR��hMϊ
cľ��k at j��ۉ J����e��fR����
y/�
�����RD��ƾY%�i�OquY�^�x�C�-�E��>{���f�
-d1���D" �knM��$}4yR�ʦ[��'��4Y��H��
ۮ훻���o�
FZ
X�4Q��8�������oo�����zh�mG%A�$���
L��k�A�r�Q
����V���^�
5�	.;.[��ղQ��	D�aS 
����l�M?�6<��~�
 ��a��g‘�dH�
m�bfH����[K8�X7�
��y0��Ӆ�gt�c��c�&�l'��Q�:yV�Y &9QC��d�G&aJ#
�Eu���ib�%
�!���{�,W
�$�`�9g
-�
����۲J�J�-�a
��
�H�j�	
�;,���ΐ u.P�ӫ�$
E8�=�'�;��
g+8�����8B
-<n�y����2A�&�LT�	0D&����1�F��_!sa���Cuu�μ#�6C��K�0��[��8��
IQ�,�d�e\&�sS�|M�Ǟ7(ȉ��R�wP��RM�o���M�z'ք�ʹ ��@D?E��I}M���1�eY���V���Ǹ����$-�C1�U��d���g�i�~�/���<�Z9�^�ȗ��x�j�[O
@�zP^�[���V™•�•
%\��O������#�'S�
J��&��v�C�"���l&����]��U�g�����h�uH���U�.�@g�^,us3�	�kS�?4�К7�M�D�an�%S�E.�AEo��䅢�L$���C�J��tܻ�L21d�dp��<
�*���s�ݪ7�I-_�z�C�ϛ.
-���&�{�{�fw
+O���e3�+z�pބ�e� �G�|�6L�d
�f�sPP�H�w�i0H	�6��7�xU�*Ce$�U�m��4.�qQ�I��Mݸ����l  ���n�
-'�y���
��ks1�G
n��(	��t�p
z��-&%$8j���������ۚrPE�x�өX�e<)�I<�����������N�	鏍��R�]�oi��]�M8ױ<o���<y=vSL��&_Jʓ-��
-�@d��^�b����J�W�Y�*u��e���3�P
�K�7Tj�y6e����V����G���
u2{v�3X�\
#αy�
E��*C�e(Y��`�s{��E��PiuvK���T$��<�\/M
-���gtx�Z�;V��6W��}�	�����}��C�� �S1�0'I#7U��Y�*�E��jGT��|����Bp��ά��b&���٘���{�/>$��|���7�S# �Xn1��ܩ^:ס���c��c
�
N�qL���_�#l�f2[j{� ڂO��-��yJ��]�5U�a��d�pv��1;
-�
Γ�����6T픾��/wo����û_����ጂ�JF�f�W�r�GՅ@y�7/��ӎ"�;-���m>�w2\#��>N���|��p�-�ΏYQ�x���ia��"�絕tZ
�Ih��x�)�LQn����Q��X���~�w��:a���l�I�:�VƉ���
F�m��ԗQH�Y˦��7���:�8�P�ml@�2�E��IӃ8��(����3��*j�+8Oǽ{���`CV��X�<8R|��zpґ��0K��p�:���NGK

�.�-sS�"˞�w��Ư������&��j�j��+z�YB�^ M�ش��R�w�
ô� �3�
鶭������i�d�f��
U�;
���fĝ���t�ե�E&��d���h���IU�~�N��V��l�=vM�S������8ر�Ϡa
�BD5��
�j+���|�n�U���#��t��C^}2�D��7�
�mJ�FcR�1��*��	��/\���B�M���,�W����ľz�yw�!����C�S����
-�
�̨��-1AB�f%`1���DJ�zt���f`�py�`�w,�O[��_
z�
-endstream
-endobj
-16614 0 obj <<
-/Type /Page
-/Contents 16615 0 R
-/Resources 16613 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16584 0 R
-/Annots [ 16612 0 R ]
->> endobj
-16612 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16616 0 obj <<
-/D [16614 0 R /XYZ 89 770.89 null]
->> endobj
-16617 0 obj <<
-/D [16614 0 R /XYZ 90 721.073 null]
->> endobj
-16618 0 obj <<
-/D [16614 0 R /XYZ 90 640.379 null]
->> endobj
-16619 0 obj <<
-/D [16614 0 R /XYZ 90 574.337 null]
->> endobj
-16524 0 obj <<
-/D [16614 0 R /XYZ 90 527.711 null]
->> endobj
-16620 0 obj <<
-/D [16614 0 R /XYZ 90 523.228 null]
->> endobj
-16621 0 obj <<
-/D [16614 0 R /XYZ 90 434.873 null]
->> endobj
-16622 0 obj <<
-/D [16614 0 R /XYZ 90 344.521 null]
->> endobj
-16525 0 obj <<
-/D [16614 0 R /XYZ 90 297.896 null]
->> endobj
-16623 0 obj <<
-/D [16614 0 R /XYZ 90 293.413 null]
->> endobj
-16624 0 obj <<
-/D [16614 0 R /XYZ 90 181.147 null]
->> endobj
-16625 0 obj <<
-/D [16614 0 R /XYZ 90 104.543 null]
->> endobj
-16130 0 obj <<
-/D [16614 0 R /XYZ 90 77.486 null]
->> endobj
-16626 0 obj <<
-/D [16614 0 R /XYZ 90 77.486 null]
->> endobj
-16613 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16630 0 obj <<
-/Length 2133      
-/Filter /FlateDecode
->>
-stream
-x�ݛYs�6���+��J�q~l�d�����}I3
Y�e��Pr��.x��(���L'3�ab�K��aAaDE�
�}y9��-��t9:{�X`��T�7����		�����r���U��F�H�~���7���\��=�
}
�H&@ ���f����+��
|N/��2x]�F���Y��p5"��L0�1D��
�9G��BNj	��x�p�,��ކ��nG�(g͑P�6��g�f��4�2���0l�
��hS���(�%2�1�b�(�;!d�p.�6�D��������zu�̒�T��ϛ�L����yR���n
S��
��?�8�}^�n'S���o,�d�%
��h�kq��tU{U2[E����Q��KȮ D�.�2	�
���"�t�"� ��5	(Lu�fvg/d}�T�;� .F�l��pw�D[� �xwfo�۟��h�}�w��0j��� �
Xx>�u7 2��T��v��=��*���v�ͮqL�q\^4�
5�Ep&P
1Z��E�@F�j"�^�飱"SF�"
�V�O�L��/��.����}�(���o�:	)A��t�4��*ߵ�=�LH�&��� �%��|�K�4E�q5����#�E!$	����,��J��m�D��Vg�[����	��O��jqI����~Fy�[�9Ҙy��AӦ��qD��2�
l Ӹ�^�&���<hW7-1ʡ�Ir��L���]���e`Β<�+X�-�t���
��u��O0�q��"��~�t�̃�#
�]��#��� �hu,�@��P�#�i�B^T 쑘�*��
�}��r��z��|x�R�8�@��vq��=
��h�@��=�V��>{lx|+�QG$U:�{����C��0u�{T?�	?�H~��}&��L�GĕO쩉
�=��3�
{|ZZ`O�Ԟ��X�]`OW`
-(T�Fn�u�����(ɸ��� ���k���.�0��
s4�H��C��=���
�=ԏ
-{sU�=L�P/�
x��{T'�p]��,��0��-
 �� �]�i�
yΔ[�6���>R"����
g\���C�~�剃���{8d?��׌z�)�p� ̉O
�=<��*o���҂{���
���ݳ?0���$�r�����)ɘ��� ���)p;I]��)�2}
�9--
�B�F�J��
)�DC�T�U�d��*8����j�apT8
-Y�`pc��@��Q��Ul����
���
�����s����7�ݛ�=rTr?*�
-U��7g�O�[���:{E+=�<c�
-����� ht�-�A�;�!
�9�̐q�~�H�j
�'IЏ� �銄
���3�|
-;e��t=#f9��mŸ@f�N
��ߖQ%q91���FN
�,��5�'79v��&7�
n�r0R���.�mW�|p�'�&�D�L��m��X
 � Q[�p� ч��$ꃎ
��@G�(��Q�(6*�z�5^x
	ʨ��}��
-7u5�N�R�+w
�,S��Μ �$��/a�:'ߖ��C�
-{�
�걖նq�
�3��:5R!e��*�
��J��"
-�|*
����}���t�)P���i{*�D
-���
|ZZA�ԞH�X�	:b�5c4�wy:�^�w�y�Ց���-U��>�6z��{���������[�Ӄu�̃�@����3����xB�@�%�
C��ұ� �=h��r58
-���h��Pa
-IC|�Ƹ
G����x^a�ɉ�i%�7i�ygױ��S�9Gq�$�wS��Y�=^CM�%WϿܥ͔p��s
-	�	z��N�c��*g�?	�"��@�&!�Fo���U��?t2D|��-����"O�_ v���3;s� �����TKL}��^tn˩9�۔����	d�tf���Xs%q�( ��C�
�,�̵�'�����eG�mٮq��i��k�z9��\{�$�w�4Dd����'�탱�؟�Տ��I����0&*�u���O�X�ɿ8�eÂ�cV����i%��bmk/�ۧO�kr7�=���u���m��8b���f��l����������mF�)#x�.
���o�����_k�@Y
��vw�gg���m-�<�"�JW����en���&N�r_n�gJ
-?��#x�3:��
-endstream
-endobj
-16629 0 obj <<
-/Type /Page
-/Contents 16630 0 R
-/Resources 16628 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16584 0 R
-/Annots [ 16627 0 R ]
->> endobj
-16627 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16631 0 obj <<
-/D [16629 0 R /XYZ 89 770.89 null]
->> endobj
-16632 0 obj <<
-/D [16629 0 R /XYZ 90 655.872 null]
->> endobj
-16131 0 obj <<
-/D [16629 0 R /XYZ 90 621.202 null]
->> endobj
-16633 0 obj <<
-/D [16629 0 R /XYZ 90 616.718 null]
->> endobj
-16634 0 obj <<
-/D [16629 0 R /XYZ 90 543.856 null]
->> endobj
-16132 0 obj <<
-/D [16629 0 R /XYZ 90 509.186 null]
->> endobj
-16635 0 obj <<
-/D [16629 0 R /XYZ 90 504.702 null]
->> endobj
-16636 0 obj <<
-/D [16629 0 R /XYZ 90 431.839 null]
->> endobj
-16197 0 obj <<
-/D [16629 0 R /XYZ 90 397.169 null]
->> endobj
-16637 0 obj <<
-/D [16629 0 R /XYZ 90 392.686 null]
->> endobj
-16638 0 obj <<
-/D [16629 0 R /XYZ 90 331.778 null]
->> endobj
-16198 0 obj <<
-/D [16629 0 R /XYZ 90 297.109 null]
->> endobj
-16639 0 obj <<
-/D [16629 0 R /XYZ 90 292.625 null]
->> endobj
-16640 0 obj <<
-/D [16629 0 R /XYZ 90 231.718 null]
->> endobj
-16199 0 obj <<
-/D [16629 0 R /XYZ 90 197.048 null]
->> endobj
-16641 0 obj <<
-/D [16629 0 R /XYZ 90 192.564 null]
->> endobj
-16642 0 obj <<
-/D [16629 0 R /XYZ 90 119.701 null]
->> endobj
-16200 0 obj <<
-/D [16629 0 R /XYZ 90 81.969 null]
->> endobj
-16643 0 obj <<
-/D [16629 0 R /XYZ 90 77.486 null]
->> endobj
-16628 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16647 0 obj <<
-/Length 2668      
-/Filter /FlateDecode
->>
-stream
-x��\�n��}�W�)� �������b7��u�����%�V"�^]�3��T�I�M5umO�`DQTuU���SuF��S���W�^���n�W,1�H*��ibp��AB»I�q at 0�t8"��ݐ�A�\�wC����s6Y�?�
�����m����A�GT��w�t�r��dӬ�,���e\���j������W�]�
'�y"���xq��N&p�'�����-N�Γ_��z������!��Vd�!UE�Xs�1���2�]����0Vb��s�"�M�ܮ;Dd(�|�2
-8$d��v�J	&��r$4�<pk9
�A���;C"`Moo�M>Y��ƘB҈�1�����m�
X���K�Qż��ya'����X���w\䫵u����l�Q�9ͳt���ˋC�j5��Q~��h����;�!��ȈI�0���3B�G3;/���M@��'�9���<��L$���8�����r��q�l�`w��	�Ek��_��f��B#0�a����M�
�R�8&�C��K
i>qE>����!G�5�53�o�*?��Ϊa�K ��m@E� ;j�|��
�9�Tm���o
�׌�~��B�1dH��f��r��
Q%f
-.$‚:����5`n�[�{En k���%��	�ܗ���Co�r��[�DĘD2Ȕ��
O�m�%�J�&��Z&����Emd�%Ӗ�[�i�
-�c�D`W���ZOnoP
>�����/S���"��n����4fQ#�xƴ*c
����CCFf~���K���={�Ù,�I{צ��v�
���F�e漟�`�l&��q�xI׳�y����`»���L2��n�Kl
dc��
���� 

�A��{N[[԰��N��[G22 Z,!SB�

����b�o�TOGR��$��1�;��0D��R4D-�-\���7F�I87�Oi�+�)�Y:�UY���e�������K`� �	Yh��'.�?�	�K[�U/
aj�LϷ	���$N�0jwI;��u�s?�j?�
�@�r���%�m1�Y����|SJˀ�Z�t,��pd�Ô�Ӧ�
6gIi텣���>��
*
-F�
f��I�
1/��"[���n
�
Ba��̺
i5Hì�Ǭ�q

� >ۿ�j����GL=�]��\Ð02
Y��<?�� �8���ii�����~�.`�-�Ŧ*>[���7ՇuYa	�f�MN��PU[U	pWקQy��lm�(dp���>��|g�>�zH
O%�[,Ӣ ��(?�G�9�A �
-��^�/HB��'�H
-7/���(�v�*ϗ�q��v���Z
��E]��׊
�U�j���l�n�
�5�ʊ>v%���(;�`��&�~���9���
杩8`�3ɶ��m��p���(_�H�mG(�P�.�uQ���
�\���A��H����
�4��DF�I 9
�&G�2O�H�<i�4��b1��
-Kg�ѿ�'W1�ۢ��H�ժ5�
 ֦D�n
�Ǔ#��t�/������K�v�>��t0���΃�,��DG���Y����M�
-γ-
�P��0�p�a�d��7g�������۲D#�x��w��%�ou�F.o|�
�n|w"=��������_��M&�������."�
�]dtU��8
�7:ƪ)$��/�7�
��2���7���i�5�G`x���U����u`lBl��tm�p8��`Ɛ$�;��lʹQYO�J�v?�)��������v��m3��n�
q
�tT����
X�ى�lZU�|]l��Mio_����6k�Ŝ��0e

A}a��2q����Z}�<xW_zD	�m��x!�>�� 񆣒qQ
-��/p�Z ���'� UV��Epui��#l!#N��ҋ3,��8UG|��G|�l����A�B�&���U'0{�D������=��$�>J���{l71(�<<%����n^|�|�5�S5��-����b�W���s��B�� �:��/�N���0�h��9���]$�/IN?
�1���-��5� �
-NT ���t��"W��Uϕ����Y��
����
�9C�Ǖ�=�=Qk�Г0�۞|���(��
Lb
S �n�A�A�#*��+s��t�'a(�=�Fj��q�/=��&fC?�E&%3Q�&j='�M�T�<_��Ԧ��y���C	L��&Ogl�%8��?,���4BS@&�
n�J�V�{���pm�����N�$.]W4O ���,����[=x������� N��;�'k��m$.]��x^�6��k�碷@b2�����Ǽ��S(�����sנ�� ����6x��J�\0�E[���	cj:o`�%[�qSlm��Dl%��Y����1#���N�g��^��rk#���b��L��&Oߚ��
ʭ�ea���V}1�L �5=!!�
UbtXk-�~Pk
Y.{��n�W�w]_�^
�Za���pHj%HK�
}+�Zz�Vȉ2��ʑP������FP_
1M��
�������Nީbm���R�(;��B�w��]5^�
-��0�S�����.��ʖ�Z����%�7�|�f:P-�M?���c�m����YV����%�՟])�u�*�B4���^����<n�VY������=�� x��M��{Q��<���d���⚴�	���3��L?&���i]��_�n���`ɟ
-����6�T%
-endstream
-endobj
-16646 0 obj <<
-/Type /Page
-/Contents 16647 0 R
-/Resources 16645 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16657 0 R
-/Annots [ 16644 0 R ]
->> endobj
-16644 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16648 0 obj <<
-/D [16646 0 R /XYZ 89 770.89 null]
->> endobj
-16649 0 obj <<
-/D [16646 0 R /XYZ 90 655.872 null]
->> endobj
-16201 0 obj <<
-/D [16646 0 R /XYZ 90 621.202 null]
->> endobj
-16650 0 obj <<
-/D [16646 0 R /XYZ 90 616.718 null]
->> endobj
-16651 0 obj <<
-/D [16646 0 R /XYZ 90 534.032 null]
->> endobj
-16652 0 obj <<
-/D [16646 0 R /XYZ 90 443.282 null]
->> endobj
-16202 0 obj <<
-/D [16646 0 R /XYZ 211.842 379.033 null]
->> endobj
-16653 0 obj <<
-/D [16646 0 R /XYZ 90 374.395 null]
->> endobj
-16654 0 obj <<
-/D [16646 0 R /XYZ 90 279.908 null]
->> endobj
-16655 0 obj <<
-/D [16646 0 R /XYZ 90 164.85 null]
->> endobj
-16203 0 obj <<
-/D [16646 0 R /XYZ 192.853 83.504 null]
->> endobj
-16656 0 obj <<
-/D [16646 0 R /XYZ 90 77.486 null]
->> endobj
-16645 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16663 0 obj <<
-/Length 3034      
-/Filter /FlateDecode
->>
-stream
-x��\Is����W�Uf��ES�$�<�L��R9x\.�%$$`��5�_��hlM5.mM��� �����~�#*Fw#l7/��݅�o����� #�
�,G�7HH���
�'�o~1�1�*���?ݼ���=w������SxD� ��
��W����� fF�
ʋ�#NlW��W��žf�F �׈D�{2�HS���)��o�|5�R��o&��g�z�X+��Ԕ�6�t��h�h�X�%�D{J��0:5�OE@J%�Z�ЀR��R����bVL�z���z_�	�<��^�Y�N�W%n�~�Ƒ9���fk��qA��fɬ���׏ �l6i���<
��!S��w!�{	b�� �*Z�����2Ƒdd4��
-�d�
�t�&�6���
R���4[&
$ ���?q���Q�� ��Ej+���`�ƢYnOb�V�J�Pc׳�
]<
��Z-f��FP��n..�<�x�[��#)�Љ���\��OV_�.�V ���0�����{�$�#�
h�����6�'0d���-v���
-nB���'j	J3�e
��g�/n/]��)��-$"��FcЃ��jܧ�a56�Y�u;����K���g(�Ds{bW��ϸ�w�"��]��:���	��S��������0U��g�ibYj�p���ˠ8e61�{��lc��� ��I3�z׻����2[�����돻m�@
�����)F�X 
-�W���
��u�M
-6���m03hϺ���~�� hm��@/Q'��~]��[�� uP(
U�Ku��s��U��"bT��
|P��#����t�0J�D�*_��r�2P��:�V��a3w����*7(
���n��̷͵��f`"��k�bk.���0
-.��a�
HQ�
Y��2��
'
-��B��$�!��3��Q@�L�0���4H�v뤘m�
-���H�z
��6��A$�*&�bK,�$
DKF�b	C�EL���1X�P�0���4XZ$Y��k��|Cz�^��Րb�CSt�M
-4e⠉ڴ��L
��d�.���e�x�Ɠ�K��1�rw����-�\�nA6��:#��6�ޕ�0��DG���a����E��γ%����m�|$F�R7U/~�'��
��G$ł3D��_6��	c_�[�̮�3�@`K�%��Z��a��⾒Q$���u�3+�#���v�]\_C���U�� Y-S�;�
-\/�:(�Hc�N�
���g��N��;
-��v�����H���l
����㆚����!(�Q�}XQ���V�4�u�l�ޮ��dL^�����ɋ�l���`�aV��r_-��
��
�$ݶ
S����ݼHa*��gE�}�e���4�
�õv��MkG�����`��aM[k	a1~����?�(�q�S��*) Ĵ�
����3�~UHQYv��^�{PͰBS�5\���R'ړ�9b� 5�p�,�~�m����i.
l*UҼ�fû�w�j�wє���
-��Kym%id�i�
�1��
��58�w�!s��`� ��=�va�7�Ч
V)'{M�!��<2s��
d�a>�[)�:������"�
��<D� ��qC��b��$ S��
�.��5�jzx�p�/ux��B��yc��$��7�ѓHq28zM�r�{|��3�X
@���-|����\
����칀�i�3����Y��"	�?��O���dѾj#�����
��kQ�N\S6D�3�X�
fJ�jb�@MO��.T&�U���?���~�I��ɘp�-��YDe\��	�47'�MjsW�����7��A$�1	��
�8$�X��d�܈�
5	c���S�M��?� R�
��
��"*�Tvq�����B]�t����
�t
:�~,�HvX��-ѡKD�@��ʎAp
-�7
1�Ƌ֝Bx�)�r]%�u�@~Q��Ͷe�g�lv�y�,6��l���V�M�v����2jk!{����u�v;_�]���:��j%kY��>�����r2X3m{�(׳�� ���Oc\)��{�q��#EHTr�+�,
�2��I�vD^¹R�M�,��Қt�3�L�ճ��ڰ���X�2�Pe�]���
��Z�
 ^-e����'I�]��A��~Le�נ貃K�mVҴY��f�#^aŴ0��]	�z��-�Jz�����@��	�C��qb��K�\�i�,�
��_�wiq�c��Mp.*�B��t�91D�
-�G��:\b
C�
-MKQ�Ӿ�,�
-�s|O����e�|�%�|�ƶ���d�n]�w:w�b��77��f�'�OrcJf(0w�:k�(��`�q��c�JYB�����I��-5�"�R�I���g���?�lY��*�T���:δ2���w��^c9� �_
c�-�����l���o�?E�N�r��d�������/)Q�����K�W�ږE9���9��mu����SI��~ˋ��&������<J�l�
�Z��6�Ł3������ޝa��`�g۲m���@؀�	2���
-��#:��@�e���O��ĸo���2�AR�-Zl�A>1�K�@����E�X�K��k�Q�\�%RT�N�^�K����r4����
�f��-n�%���[Β*���g�ڏL�W�"".��q
���CG��E
p��_l'�t
�z�*A�uuyj��
]
Ǥ��Q�ؒ��5�ٟ����Wo�g}�&ٺ��]�%�Mzp�e�n��Ί��7�H����ֈ}b�t9!�`�+%�LZ���C���N�f���ک(�9������
H/�t��i�S�>Q�B{ľ
�\_�{ehV9���u[�텉�&S�g�ߒ"?�+:m�������>�GɎ��6����������*�
���/O��T��Z��_s֊���i+�^g`)���	���n�͛�n矛���D�q��6� Qq���u[�2~��"�^

�Mj 9��Ө���2;��n�X�ۏ�ϟ���`��!X���f�
-���5Ag�
�	�%��'>���Fxe�
-endstream
-endobj
-16662 0 obj <<
-/Type /Page
-/Contents 16663 0 R
-/Resources 16661 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16657 0 R
-/Annots [ 16658 0 R 16659 0 R 16660 0 R ]
->> endobj
-16658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.931 77.835 186.185 90.169]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
->> endobj
-16659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.668 77.835 272.341 90.169]
-/A << /S /GoTo /D (index_Grid_Frequency) >>
->> endobj
-16660 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16664 0 obj <<
-/D [16662 0 R /XYZ 89 770.89 null]
->> endobj
-16665 0 obj <<
-/D [16662 0 R /XYZ 90 646.048 null]
->> endobj
-16666 0 obj <<
-/D [16662 0 R /XYZ 90 555.298 null]
->> endobj
-16204 0 obj <<
-/D [16662 0 R /XYZ 211.842 491.049 null]
->> endobj
-16667 0 obj <<
-/D [16662 0 R /XYZ 90 486.411 null]
->> endobj
-16668 0 obj <<
-/D [16662 0 R /XYZ 90 391.924 null]
->> endobj
-16669 0 obj <<
-/D [16662 0 R /XYZ 90 276.866 null]
->> endobj
-16205 0 obj <<
-/D [16662 0 R /XYZ 192.853 212.616 null]
->> endobj
-16670 0 obj <<
-/D [16662 0 R /XYZ 90 206.599 null]
->> endobj
-16671 0 obj <<
-/D [16662 0 R /XYZ 90 127.449 null]
->> endobj
-16661 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F8 794 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16675 0 obj <<
-/Length 2576      
-/Filter /FlateDecode
->>
-stream
-x��[K�۸�ϯ�)��,�ǤrH���>Rqv''�k�#A3,K䘤���4�"(��H�%������׍~|
�8z�p���_�n��]�� #���֑���		w��Ì`��|A0Ƴ�s�gq�����)�e��'�������<�_no��s�gY:_P�g�6qQ��_��V��tiA.�R�5�w?�|ww��� 2
�D ������G
�`��#ft���8e�w�z�\+��pW���=q� �͸<�Η��1�4!Ƥ�l�
�	�V�7]�Fg��)N�
-��9S3��~U٨�%���D#q���P��a�`�׈�� ��(��si`Y�I3)��!��.O�ꍿ-����2�bov�m3��e=1��]�D#�X�
-2 �#�i3�O�D"r�A���4����pz�޳�D�l��0HA��~�ě��,��ɠWH��Kw[��e���l��E�n�p4�@]�:O�X��~"%�Sz����)�8��z��3������uH�=������M�m���5M���
_{eV�X��")�S���[�ԋ��u���A�Hr�ě�ߗ��L���v�<x�;;�P�
a��+��_a��e��)a.pI_�{�#�'��X4Br���P�'�#ƅ_��\��&�c
��>���#d�
w|�9�W6���x��GD�1UCj�
�,���)�
�Zs�d(;p��l9���9?I��t��@V�*��j���1z��VN���_�7�.�* �I�̶�q�<l,:��������a"Ÿ�ׇ��2]�	���3i�:�C�S�4�N^�
-�h�]�Ѕ�C�H�țS�S�Y]/���C��U/��V�%5޼��
٥e�[B�۸r���͂*�@ڂRD���׈!��&�!�6 �jh�)����ޘh�8ՑP�
mN�\h�:�a
$@�8Q�(�t���B#?'d�{�C"
k5J��b���|�g��B�gN�,Koo�YZ�IZx����/��3/�zՃ�"`ipK��+�gt�@�����
�������
� ���gWA<�f�z��`B!ih�3u��K�ŀW3p
�_׈��'�0�44ݼ�%'��8��W�v%�`�3o 
-�>á���F$Ѱt�!
�̂M� z�2�
dV
P`QȦd�
��0@��甓�)m`O�
	`W�c�/Ɛ�MGێ�L5�q��e�=g���%�~u��'�������t����52��X��vb�#<$L�"��1��R�� ә��3G)�!��(EQ�ɲ���
�l
-����~B�X���(r��H����3���3��q:��P�@��(�1�q��>��>$�&I��Q��5�q���O�s��G��t
�&T�����␥)����o ��B�����
-uD^C���Hr>�Rӆ
�T��
���
�K�._УQ��������J�I2�(�!��8QJ�)vXT��a� B��@8�����Je��@��5�7��ȓ]:J�i�H) �z�)��)�4סviV�հ�N�Vl��lj��勷؟�)
-�ӵΎm��C ��)�
P��0��E�T�y��ͦwޢ.#թ�<�Ӳ~�M\���*m�:Ϣ#�B���gYX&l�>
T?z�عm�.�3�&vF6����
��9�t�ӥC˖��mVx�� ��ݡ��}NfE�]�l��"�"�-2K�������
��$�~
�� �9㛂�-�|��
b,��יv���
��«,ūH�������M�+
-�֖[�Q���5��,hަ<�1�Ċ
S��Z�qJn����0�+�m�m���w�,� �{��:��s
ׁ�Q=�# =�^j���i/u�^��}y�U��sV��uZ~b���*���
���
d�7!蘴1S��{�����8
�V�t߮��x�k&T$.�=��gW.^��q�dSF��;i��
 b�1:\�*��g���|�V�
��
_��I
-~0���$e��=gEᛏ���}���˧z�Ɵ���O�k
�Mk�о$��W�c~<ߥ>�q�%�>�� ���~���̦1�>Ws6�y^uK0qk�"~�
-�{,�����:�{8����C�L/A�Ц��f��OU��+�qa��A��E�%�6q�ӂaK��j�hs���X	��+�zW�u�
���y������X}�������c�4:4�Չ��ڈC�vQ��2�%�3:)wz�Bq"�\�I	� ZI�+:)�� @U�t�Y}T����j�#q�U�)�1j�3}��i�c��s���'��6���
-�݃��?�/�|�A�3�ᨺ�蜡��j�t+��+F/al,{��E
s��gO��6t|��DW�R�v{�Ex�3<{�02M��a�n�]��vu��&i�M�s�r[�6��}ȝ�3B Sv��h*�|�5����蟹~��g�o���
1����8��ut�|q�d�"i�c	A��^0X�_���{П���'���P� r)Z�>����۷��¦��֡v�p�)�SQMf�fy�L�*
�򅚐o9
&H{�-��
��h5�{]��<X��aˢ�e`�=i�/����
-endstream
-endobj
-16674 0 obj <<
-/Type /Page
-/Contents 16675 0 R
-/Resources 16673 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16657 0 R
-/Annots [ 16672 0 R ]
->> endobj
-16672 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16676 0 obj <<
-/D [16674 0 R /XYZ 89 770.89 null]
->> endobj
-16677 0 obj <<
-/D [16674 0 R /XYZ 90 645.068 null]
->> endobj
-16206 0 obj <<
-/D [16674 0 R /XYZ 439.299 592.773 null]
->> endobj
-16678 0 obj <<
-/D [16674 0 R /XYZ 90 586.756 null]
->> endobj
-16679 0 obj <<
-/D [16674 0 R /XYZ 90 527.382 null]
->> endobj
-16207 0 obj <<
-/D [16674 0 R /XYZ 90 492.712 null]
->> endobj
-16680 0 obj <<
-/D [16674 0 R /XYZ 90 488.229 null]
->> endobj
-16681 0 obj <<
-/D [16674 0 R /XYZ 90 415.366 null]
->> endobj
-16208 0 obj <<
-/D [16674 0 R /XYZ 90 380.696 null]
->> endobj
-16682 0 obj <<
-/D [16674 0 R /XYZ 90 376.213 null]
->> endobj
-16683 0 obj <<
-/D [16674 0 R /XYZ 90 253.626 null]
->> endobj
-16209 0 obj <<
-/D [16674 0 R /XYZ 280.943 163.019 null]
->> endobj
-16684 0 obj <<
-/D [16674 0 R /XYZ 90 156.379 null]
->> endobj
-16673 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F8 794 0 R /F90 758 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16688 0 obj <<
-/Length 2406      
-/Filter /FlateDecode
->>
-stream
-x��[]���}�_�S"UY=��1o��v�q�M���v�X��P�@F��ʯ��$BRO�%Ob�9���>}NӃ�u��o������b�AFR=�
�7HH�k�8
�~�.bR#b$��N��������^{x�����K8"�@JG��Ï?�h���0bFG�]�m�)��M��������������0Oj�0�"
^E�~N�,.�mR&Ŝ����u������E{�,3���hf����|S at xG&�F"��*�&�с�z�]D0$ĉ6���eջC�D$��w!ۯ�H�
U~�/�|A�-�l_q�����K\}N7���c�6^��U�,o�����}�l���S{� �?~Cy+>*��4��'�Y�J�V+��&M��%�Wm�L)��
�gA$"w��`QZH�C���ב��ң\W����e�+Sx��l0a�K/O���HS_�%�!���0Ғ��CUe>*�_�E����y��z�0�$�4��"� �K�1��̾\==�ٜ��o�&]�s�f��m�x��)�HN�<!(
�M�1��T#��#�����K�ϩ�}��
��,�#���d��H�rq��lU=�E�縒A���e*�Na���"�P�|�o��a�f�|������]R�����Rx�{
� X����j}Ѿ��1����ć�" u�
��`��
�!��z&���"���/�0��
�S;�Qݨ�m|.�ܧ8qpŒv)�
-4�Pσ"D5~d����d��dU�@�@<D �*b������e�g���n4s"fy����j�:���ą	
�q�����6�$K���cƾ����0z���m=bۄ�b�H�
ow-�g	&���Z���&0�Q��{0�@?q� �Tڡ�S0™� D�����jUk���T�9������~&
K̀#Y'P����M�v��);Ba�)�L/���H�+��|�_k��M�t��'�֝Ћd��)m�#_�x$�ym
*9J��
.���<(c���D�h��(�Z�wH"Y at X*�$
-�g#�:��&��<ےH`9(�8<&��Ӯ�ڒ�>t�k�AX�9B5 _0��"����^��.��QD0J���W55�oog)�M��Џ
C�
ig�o�ݕ5eC�n�̳�ɪ���U$b2i7��қ.v9H׉���!0LJ��>,�݃yQrm
Bv���UZ8�Di�E6Y���^ A�a��i��o]�&�2��

���>�.�C����p٧
a��JM��F ��M�p�I�C3�)�N��+粥{�

)NB��
}��9CB�+_6\ܬf&�L����Ј�
�EP
�"��C�K�FL9)�fb��U6L��7�tb�c	�j���
b�øb�d�4-���6-�N�-%1R����Z!��'%�CG�IJ$�j�0OKZԓP<��9�U��1阱�r�W�B ��Xj����ŕ,e@�
�Q6pmvE�K�3B�����˗�����m���SƯ���s)f��3de�ҥ������b
f@���3�=�US`���Ϝ�>�9�D����M��>��v`S5!"���3�Ep�����͉> �vl��F�}rD�)`k�}5�/��s٦��\�~���c��`#�;
qQr
Z�Y
Ԟ$� �m	'����r��;	N�<�G��,�r�/�ȉy݊!��ϑ��Vg�
\2d��1�X��%Cx��d���
�BJh�R��wV0�߱1�9Gt���
����Q$���7j��w�ѻ��
���J�wV���C|��F��_d����>X�R�C^Y��#^�قB%J
~���M�IP�
�"pT��a�
� �n��l)I�i0?2��vRm
�H�}��˴m	�9hcI�/���Ct�e�!%�Z�q
�����	��=6q�6��_��0H,�.�߅y�6Q�J��6��&��|�A�o�"-�NR��M�N�&���p���!�s�Is?�"YƒK�&�
@B!��
 (&��@Ǿ�ʾ�{6����Yl�g�tԳ�#�P3�wd��0�
1u���IJ״�
-�^_�
kyԍ�.
����������2��p�
�88�b�1�
���/�5���0z]������h�L�
�v]��-��Z0��B
c�~gb�t�D s�a	��$Sw�[�rf�>А��f��L�1����4
��><��(@�YHKwB��с���C��i6~���F;�N��nn����}�k��,落����؃�l���?�)���ހ_!XL���b��]l�O<�uˢ�� v�[ ��������rs��l
�����_
�k��
1�'ǿ��k\��Z����Ӓ–Gu� \II7�~H������}
�o��[��M����/e�{z|����'�A�ہ��0=`u���)�m��y���m��z[A����"�
-endstream
-endobj
-16687 0 obj <<
-/Type /Page
-/Contents 16688 0 R
-/Resources 16686 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16657 0 R
-/Annots [ 16685 0 R ]
->> endobj
-16685 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16689 0 obj <<
-/D [16687 0 R /XYZ 89 770.89 null]
->> endobj
-16690 0 obj <<
-/D [16687 0 R /XYZ 90 720.814 null]
->> endobj
-16691 0 obj <<
-/D [16687 0 R /XYZ 90 667.125 null]
->> endobj
-16210 0 obj <<
-/D [16687 0 R /XYZ 90 620.5 null]
->> endobj
-16692 0 obj <<
-/D [16687 0 R /XYZ 90 616.017 null]
->> endobj
-16693 0 obj <<
-/D [16687 0 R /XYZ 90 555.109 null]
->> endobj
-16211 0 obj <<
-/D [16687 0 R /XYZ 90 508.484 null]
->> endobj
-16694 0 obj <<
-/D [16687 0 R /XYZ 90 504 null]
->> endobj
-16695 0 obj <<
-/D [16687 0 R /XYZ 90 443.093 null]
->> endobj
-16269 0 obj <<
-/D [16687 0 R /XYZ 90 396.468 null]
->> endobj
-16696 0 obj <<
-/D [16687 0 R /XYZ 90 391.984 null]
->> endobj
-16697 0 obj <<
-/D [16687 0 R /XYZ 90 321.253 null]
->> endobj
-16698 0 obj <<
-/D [16687 0 R /XYZ 90 267.564 null]
->> endobj
-16270 0 obj <<
-/D [16687 0 R /XYZ 90 232.894 null]
->> endobj
-16699 0 obj <<
-/D [16687 0 R /XYZ 90 228.411 null]
->> endobj
-16700 0 obj <<
-/D [16687 0 R /XYZ 90 157.68 null]
->> endobj
-16701 0 obj <<
-/D [16687 0 R /XYZ 90 103.991 null]
->> endobj
-16686 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16705 0 obj <<
-/Length 2308      
-/Filter /FlateDecode
->>
-stream
-x��Z[���~�_�S��qu�/��LvW�l�N��<lV#ڦm��w�����
-
c��fe�TC��S��U��U��o
~�����b�AFR���$$��
�	F���c
>��|}~�Q
f��:^�����<�OO��3��,�ͩ���MTn���-����"��K
-Ff?�|������8$)
,�����%��6��
|�&mN\7����<`�TsETء�xUA�QUm�<P�!��S��3FA�4IW���ǯe[�Ha�)F�p'�e
z1BA����@��vW&�
��rF�uT���������
VH�ߩ"�<ؽnQ�9]\aI�)�]��b�X�E�����J�xFD��E\a���<.���aRx�
�
�X� $����ݨ��bk
�˸(����!^"g��R��iN�E
-�"�Zn�����O3��,Y�+�O��������)N	^�5s.��6�{�:���T���
�l=(���".<N!P*� ����p�8�밊�.��Y��-g*\�BcT".��5�s�����4Σ|Pn����͹��"K�һ};1)�
-x����2>:e�u?膷u�&~�f��S �L=cU
!
\N�S %餅^��9��S)E�v��-�VI&��^���������]K�6�`U�V���`` `�
v��NM�^�u�#�������~%��\PR	y4
-f9�Gc�r�
!g������$�:ۗ���$M�ɿm.�B��b�)�j�n�
M#�(D���@��:\�Lm�2�9����p��=����L��2��
�����ПW""�.B�ۀv#Ra��-��R �x��
�@�B�ж����n�	�R"C{0>fi%�oK�k���[���K�ٸѫ�-���O�zr��q]����:h���.r)��y=�]��
F?� �	���o�
���3�Wust!=\�8Er<j�\�`��E�T�%���HC7�K�J�"��Z"���FA���q�6�P��
�0�����,�OOP%9t��&Y~�p���i9��s66������,d��T�F/��ɺ����o�"�by�fa2�@8C�L�>$4�M���� ��#���c�C^f�l���$]d�]T&����$v�2��+ �:s>x�a��{$�b3�
�(��.t��tnT�x�2zwpCk)PW
읺ر��ڪfɣ�Vg(
��#��6 ��� [...]
-3��{r���"��Ds��G�xـ��`}�JO)*4�(��հ☐wST��Ȯ��`�	 X��E��$UP58KR���������86� 	9VL�~hM13���dp��$�2c`A��[�1QbF��I�8�&�)24�(�cȺÐ���Al(@d���Á'��	���4e���u���;
�
��
X��
X��90�i3%�\b��2`֊�I90� ��[8�09p��I���E
3äw 2��<k"��"�sF� �
�RZ]�M���]um-�2pXl�{գ
���v�ɭH1.�ưy���84?����
�	�~���5�d�dB
"�
�6�y�f����X��,���;YtG�_Y�0����_�E�?�Χ5���l�Ty���
-ՐZ��������p�
�|Ћ�����)����������p�M��� �u �<o���y����U����n����dg��!@�n��������q�^�~৕i1�Y�^�� )ڨ�z��ze�'��o
�zàk%�?|D�)�ǽ��`.�Ƨ��>����z�q����5��]
m6:V&h�h��R7x�3\Z����)�wy\@�X�C;��fF�<bH
-��;�g�?��[�1��!
-~�M
���S
�O.��
�1�A>�t�����їv1��1�����l	t}����U,���ϯ2�$�"o��wK��	����� 
��iOw&�X��FB�qWp��J�~�f�N���]D
���O�d�ܻZ�����C���d��+y��S�
t�OӤ$y���K^
?[t�
����g��au��\��ݤ(
?e��0������
C�zl5r�r�g�8�gU�
�:Y����ϳi�X�>�����js���j^֝��<Z&
�P����uԳI�q�7�;D�kW
�"ʮ�
�&��R��d	���~��
�V��ogB�~=�
����f�O���H��	���ړ�Ǿ8��
�џ
*�<B!����uY�
_�+�W"�yo��H5��V;�6���
 nn��7�5��	D4�-��U����W���ܲ���Z�-O9�
-endstream
-endobj
-16704 0 obj <<
-/Type /Page
-/Contents 16705 0 R
-/Resources 16703 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16657 0 R
-/Annots [ 16702 0 R ]
->> endobj
-16702 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16706 0 obj <<
-/D [16704 0 R /XYZ 89 770.89 null]
->> endobj
-16271 0 obj <<
-/D [16704 0 R /XYZ 90 669.636 null]
->> endobj
-16707 0 obj <<
-/D [16704 0 R /XYZ 90 665.153 null]
->> endobj
-16708 0 obj <<
-/D [16704 0 R /XYZ 90 608.534 null]
->> endobj
-16709 0 obj <<
-/D [16704 0 R /XYZ 90 554.845 null]
->> endobj
-16272 0 obj <<
-/D [16704 0 R /XYZ 90 496.264 null]
->> endobj
-16710 0 obj <<
-/D [16704 0 R /XYZ 90 491.781 null]
->> endobj
-16711 0 obj <<
-/D [16704 0 R /XYZ 90 421.05 null]
->> endobj
-16712 0 obj <<
-/D [16704 0 R /XYZ 90 367.361 null]
->> endobj
-16273 0 obj <<
-/D [16704 0 R /XYZ 90 240.716 null]
->> endobj
-16713 0 obj <<
-/D [16704 0 R /XYZ 90 236.233 null]
->> endobj
-16714 0 obj <<
-/D [16704 0 R /XYZ 90 155.704 null]
->> endobj
-16715 0 obj <<
-/D [16704 0 R /XYZ 90 102.015 null]
->> endobj
-16703 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16719 0 obj <<
-/Length 2264      
-/Filter /FlateDecode
->>
-stream
-x��Zْ�}��SBUE�K�%�8e�q&5���d���ݬHT��<��� %����0��pq@��
8yNp�?=ܽ�V�� #�L
���
���S*�}~�>aR#b$�r������|�h�ݽ�����#�o@ ������g��p��#ft��5Z%�28.��w���
������![!2B!
�HS��9����(O�e>�SJ��*�W�!B������N��6;����H� ׇ��z9#$ݾy=�R�'1 P�c���:�gs�n���hfD����>�g*��1*��Q��"����]X�bjt	f)�2����XW����E���X`�b|����z��q۴���F�S����
F3B����
	Q��E���̈́1���}�H:�b؆ Jy��SY-˪���hOユD-�0��"�����<�o���})�I���FYM
o
�
L#�bx�;���7�3Ȱ�L1���B����rr(k�k���"-������
Y�O
��u�_�E���\��.��j��k�����z��k]�`¤6�"�=b�b�U�	�e�lU�Em�	-����O�C�l��%�i���<-�T������D2�����
�ЬO
��&�#e8�T�j���E /�[q
K��L�B
�A
9(܀�q�ǮA��E�fsFp�]�5*��
-<��Ze۰�;�����v=9_A$"7�����I,"��]m�Bڡ
˜'¦<օ��_�k[��3�yA
-��4|G���$�I��A1:�.��8��E�m`��'��]o�.��ӡL(°"B3(lԯL����P�8��lY�?b*}���8��s�1�9O�
8
O�1
�NLtTH
R���^Ϡ�}��KI[��+�H�K�+=W_%�rW_�*�b$
-��R�w� �
>/au�yY-֫׬-��-㚥��
��x��W�q)�6��*�\z؜a��2!��|�|�ׯP�G��_y)/���oU�c�����m��r���I���m�ۀ���ra˙�̀\�B�x�
-��ߞ�n���$
��Vw�z���'���z���㊬�–c��de at 29"�t�5�f�r���H������Hh���[ey��'}S��"gcFE��l^��x�7���Qh�6�l����U��{X��P:��s�& w&&b���
 d��h��bٱ��hZHI�G�{zq��B��Y\�$�������W���4H�0�Q�+j�)���D=��Iz=p���
��*&�5T
X��%�l��
d��A�9gT�E�pTH��sYY��?���s!��	a�����;����Ȯ�
��\L�����X���
���6���Wc���F_:���I30HGH��5�����zӈX0pu"c
W��6oR�J�O	x[* �N˹�,./�
-6
1�R�&W责�|`r��;#Ss��R�h�<�L{n>�j��OLu��3
ȹe�G�9�s�[>~I�q@������C�n��$QG�����xDa�N�(����?�0�=!ߑ�|�����4q�4�7�
���� ,��@�1������
5Bw��P"��
-|�^8j�=����G��-#�cLp�I��;���Ze�/��ѳ@%�g>	��%>��F�� ��cȡ��������h��EwԇE�>
�4��S�tć��"&�����PÐ�IƜiO|FS���3�_!>�s���E�)!��~����4�e\�r�ͳ܇BQf��G
p���C
ҫ5�N��9�}��T�"�#�$J
��
 ��}���Β���su1Ơ`���@�Q�j���ɏ��(���������G��9����x��.kD_�����#W0�v��x��\���̬��c�8�����NDa�%��F
-b �����[t|��
 W)�@�a�m6V����E�(n�1��"�1�B 4�"d�y��b��a��g�#�\�݃�РR:��ub�������q�T�I���~�ŷ�$
2���aI�1i�W����2fCcꥁ�[�a������bδ�K��^������zi���*�
� �>�~���q70o�9�.­l)�.�6?�dm���o�3���R�=
���}��ƻ�V,��������|o��c
�/��LAF�
7.~��?�Z�~&D�ǿe��mA�sK��:����n�-G��4~,�.3{\�������
P
B쾶������w��禨�x�!��w6P
����ߑ�Z�^]Vps��Z1�����`�L
-endstream
-endobj
-16718 0 obj <<
-/Type /Page
-/Contents 16719 0 R
-/Resources 16717 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16657 0 R
-/Annots [ 16716 0 R ]
->> endobj
-16716 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16720 0 obj <<
-/D [16718 0 R /XYZ 89 770.89 null]
->> endobj
-16274 0 obj <<
-/D [16718 0 R /XYZ 90 721.073 null]
->> endobj
-16721 0 obj <<
-/D [16718 0 R /XYZ 90 721.073 null]
->> endobj
-16722 0 obj <<
-/D [16718 0 R /XYZ 90 658.004 null]
->> endobj
-16723 0 obj <<
-/D [16718 0 R /XYZ 90 604.315 null]
->> endobj
-16275 0 obj <<
-/D [16718 0 R /XYZ 90 489.624 null]
->> endobj
-16724 0 obj <<
-/D [16718 0 R /XYZ 90 485.141 null]
->> endobj
-16725 0 obj <<
-/D [16718 0 R /XYZ 90 426.39 null]
->> endobj
-16276 0 obj <<
-/D [16718 0 R /XYZ 90 391.72 null]
->> endobj
-16726 0 obj <<
-/D [16718 0 R /XYZ 90 387.237 null]
->> endobj
-16727 0 obj <<
-/D [16718 0 R /XYZ 90 314.374 null]
->> endobj
-16277 0 obj <<
-/D [16718 0 R /XYZ 90 279.704 null]
->> endobj
-16728 0 obj <<
-/D [16718 0 R /XYZ 90 275.221 null]
->> endobj
-16729 0 obj <<
-/D [16718 0 R /XYZ 90 204.49 null]
->> endobj
-16730 0 obj <<
-/D [16718 0 R /XYZ 90 150.801 null]
->> endobj
-16278 0 obj <<
-/D [16718 0 R /XYZ 90 81.969 null]
->> endobj
-16731 0 obj <<
-/D [16718 0 R /XYZ 90 77.486 null]
->> endobj
-16717 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16735 0 obj <<
-/Length 3186      
-/Filter /FlateDecode
->>
-stream
-x��\[s�~���S+��0�O��6���ҙ�
�)�xh��9�-����w )�����	.�~���HQ���iD��+��p�����;#F�8���n6rtd�#J��1����5����O
g�"�?�t���>��2���x(�����{y��x��\sEǟϳ�
-�����˗�9�R��b���WW_�]�t�@3:bAE�
=.������p�+�pv��7Z�$p��>\��FC�C��#�uFF�
��.ǫb
-�:
��_8ط�1+�d�K��ӏg]��[���DR)�~"8�ℱq��p�	56��;B��4
:��c���:�`aoo��J�2���8�D;!
q,��c�y
�TIb�Hҩ2�J
u��Z>�/h�U�����k�8ު6�PJל9µ]�
�T�y+���k����H���4<�Ђ�4t��]�����,Ѽi�2?i
�o��n�k�%Q��֜0�H��wU^�6
�����k������9onwg	.�zbTW1a��o���H.�6�U��5��wp��j J�
/]�aZ�
-}.{`rMMZ�bz�
3'	NH�
����
W���q�Oox��,58K+�~o�I�_�u%��H
A�S��B뀘Xl at jbLJb���8��i�d1���zD&ô�gb= 雬XV�0�R�ӺM���'��/"�y�SB7����� �8
�
p�g�4a��n���锦~��Aܾ�S��S*G�9"E����1_o
-X��.���>�^�}Tg����"=���0�
s`pd}��\G����
S�)��l�a�P�b�A���6��[ؽ$ąټ��C<$���e�/7�͞S�D l)G
-�Y�?T��o{���T!"�H��Մ���:X/�
��HY��+ƻm�l9
�4��

�-+k9-`}*��u�|\-�٦x����p0�KLs7��[0i�y�̃)���(b�
��9�?�y�ɛ�����]�ve?
H
1Ҷ��Η��I9~�~ �
"R�52B_�� NDd��ޭ �ۄ�?���)��C6Ȃ~Ɯ'�e:0�R�PQ Ĕ���_.g>��n��n&����m�Inad{�[	�SP�bHuW
��V*��t���
-Qz{��������8W;=���8G+�r�.�Y�������r_D
-h��w����y��a���

�D���Ba����\
�l ��_ڳ�Y~�1�����7��
�dKU��}f�`�?]��pW���W�����H
�����1�Qa	n> ׍�u���!�+
́K1����xV������>�� w��2��𸐈X~�o�݊0%�(͏�
�
�T
z^�M�q�7�u4-��,�J_A�\�`�,��Tۓl��SM�0���!��D�bY��D��-kcz~�?leRZb��^��T��xO�2u��ٽFv-%�ce��<hn`Hnk���|H(%��M��� 
-i�4��3��Ou#�� /�^�6mjV��q;��@��!DZ��Ͳy���V
-vBy�@8WG��Àj�	9��\Rp��a�����DS��
-P���e��.�*ԕ����P���$T�	
�c���r��&޶����j�`FR,���*��z�ߊR��N�0�*�������?	�]#�Ɉ�hQ���rh^!����=3��#V�l����S��6P�|��;�W�%�B�t%��}�I`
,�ޜ>5��,m$��Գ�C����,6Gzܡ�
e�Xݟ�0�g������g
�-�K1x�^j�m��S��^y������4+��?�\Y}���
6�"83��l{
c?���iʢj���:/�ͪ�(5&�$�
���wє�W�
�������2����p�
�ҐB>=�f}�j�n�h�K</�%z���D3�/`��_Q`����!�\��0`�������k��[
�p���0p3
�n �i
�e����� �6�"aj½Y�T���E��˵ӾQ�d)I��b ����3�9�.�#Vځh� l.�f7�6w���Kޒ}v36͢��0��L��!�^yI5OiKgK<�0��cj�P s����̀0���))Î�K(C!�`�KF�
iC�� [...]
-Zkm��G>h�

���z/�cX&�淉�*:DH�o�1�O����|ko(Рl�������e���/�j���g���j3a�2�"^�1ܺ�7��q|����4���,
0.���o�N�O����ׇ���*����P�G,����N�ƻ�zC��$�yW�[kY換y��]�^��_�EP��k�e
k�����Z~oa�!
j
:�-|�5��j��u:
�w&��5����##�
��N�`�Q��29#�@ņ��T�
�Cj�hH'0�)T��H���'|�;�y�?>
2_I(�U�,1�^f��PPE)����q�<Iǐ�8��w�����TIzWb
-�^w��
xF.A��Z��Kt��͊
p�n~i�<�d�
�ⴥ��>Z�n��T��v;KB�_
�Q^�� �1X��'�"?� ����@�f�OS��
v�����"�:
<�<Vg��gLtiJ�xMI��o�9�
��{�p��Q��t˳�bé0{_��:h�`a%�,�2;�.��ΤӞD9�ΐ8 _���g���eo��Og�lxߒ:l����'�^�ĸQDlW�����з=X+��s?�Ʒ��Q|_,q��q/A�1��h�
�P+���� �&`Y���3�p��På�
5u�0C��L�6�a^Vj{T
�]EO*����
J0.�pך��6iݝ��������2ܭ���sȡ
-\��((�N��Վ)$R�!���6E����),4숢f��o� ��}Lºnr�����1�6%
�48q	}���@W�?#��e��^�ݶ
�M��`r�-��;�Rr�Lh�z�i
�e�
㥫ȟ���㾵q�r�o�x�NLb�/��N�E-�4B>d��� ���� j.Sg6]u��������X������Uܽ� R�+�/�>�_��C���i4+a1	�5/���8�[���	'�Uy�WD��l��� 
E��_V�z1B1���Ň<��Ġ�G���W>�ݪ”$j��<o6�ۛ����*_>pLo��8�����`pX^�Ū�Y���gǠ'iR��z(#Z�f&`2�·0��E���l
�/�|���`�����6�Y
-endstream
-endobj
-16734 0 obj <<
-/Type /Page
-/Contents 16735 0 R
-/Resources 16733 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16744 0 R
-/Annots [ 16732 0 R ]
->> endobj
-16732 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16736 0 obj <<
-/D [16734 0 R /XYZ 89 770.89 null]
->> endobj
-16737 0 obj <<
-/D [16734 0 R /XYZ 90 658.004 null]
->> endobj
-16738 0 obj <<
-/D [16734 0 R /XYZ 90 604.315 null]
->> endobj
-16279 0 obj <<
-/D [16734 0 R /XYZ 90 569.645 null]
->> endobj
-16739 0 obj <<
-/D [16734 0 R /XYZ 90 565.161 null]
->> endobj
-16740 0 obj <<
-/D [16734 0 R /XYZ 90 459.188 null]
->> endobj
-16741 0 obj <<
-/D [16734 0 R /XYZ 90 356.881 null]
->> endobj
-16280 0 obj <<
-/D [16734 0 R /XYZ 406.869 292.631 null]
->> endobj
-16742 0 obj <<
-/D [16734 0 R /XYZ 90 285.991 null]
->> endobj
-16743 0 obj <<
-/D [16734 0 R /XYZ 90 181.552 null]
->> endobj
-16733 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16751 0 obj <<
-/Length 2785      
-/Filter /FlateDecode
->>
-stream
-x��[[�۸~�_����
車�@w�,���N�龤A�����4I����ԍ�|��
ɲtxy.�w(��!�я7��ݼx�X�XRݭ�G��HH����O��w?ELjDb	O��?��׻W�޽3�ݼ������W8"N�@JG����8Z��"�X�����M�)��:zw�\��
��
j
Af����<R�!��S�՗E���<+�B{"��p#����	��jo'H�[���e�bđ�9b�|G����B�%p$�"�s=��:��,�B�$Z�����!af�(�����/_�ٔ�ɧ�:]~�S�&O�$��z
Z�9,2
j(�Dw-e�#"�1Ke�
)�e��w�E>�b�9�Ψ��te�� ��8EL�&��ɪr7��%⸽�?X���C�jn+҇�Aa1�Z���Z��
�),D	�3K�E��Ϋ�~���>�գIy`�,
�N&fC��X�FT�i9�
Cq{:�
��0w׸��5"��A��+�tQ�!�H<��XQ��{,
�C_�
���rH#F ��I�x�*pƏIQL��8�?#;|�	is�?#csIBF$�"Y�ϛ� c1���&r'sw�d�3	�}isSR�'|���
�+�P0i�4
��E'8�>ެ��e��d��-�4�O�է2Y�W�70��e5%�b��܅4��b[$ռ{���q�/��;���`����
�?�C�%żjF��=-&6�iٌ��j9��Or� q4���Z�L��|����.�%n\�SE]AyQ$�j�\_�n��K�q��+��@e�	~Y��g�!Iiu�F2$��@*��sj⓱3��h�S�������
-�Y;���!��^�1LT��Bx%NB���S�Qqwxc(�x�k��M����6�׷���2���B�8
-B)���}�M!�	���5��*�:/6v�a���!���Mf�R�����5d�7�4d������Vf�|`��B�M�
�kX9�Ys�H�!��[�i��[ġ&B ���~z�N���)!���dY
i $����s���/�}1�������&���H�ybWU���Ĥ�,�Wx��r�5�D\��jEaRW��v`L�VAI�1
�!���� h���V0�V����ڲ?2�:.E��c�����e��Z��%2u�f>A��M���_�U4�;Yѓ��e���1����i@�ƑD�
ʭ�� ��10�xg�\r5i���H�����%Wi����3)�K�v��2�	�8�~��S#R�K!��v���ˣ�&��j 
YY
 &�2��4[�Y����PTB}ک�o�V�����������R�E��)3Q
٣��n�4{"��_��v���D
�ʂ�T [&ؐ$�M:o�KZw���x�Q"v>E.�x�0$32�

�i�v�F�lI�u8�bK��5"��]���8D�;��5�l�`�2��9��g�y��=5Qh
-���u1ё7����)N
-�K�0�o�H~\��6^��9|�1$SH�>
�5
��ZȜGp-���2#�1rM�!Z ����
`k�� ����Q�õ��+P�&3�; l���6#�6�)�k:7�Ձr�̙�q
C��`��BʫxǪ�:���������t@)Sq�3æ�eO��x��7,���P)�Ej�n��a�;��`�H
'!J�B����f�ak�^���c��/sʺ&�P��I�E����L��� ��6 "���Ll9n����i�)�?!��8Ġ�Aе%{\�v�3+A��%�C���[�&��m��;jTGs�ds�T̝M��v�S��J=���G[����6�v�|��u]���[{�1Y�U��[t�,��Sc^���4 I�oi3M �����
-2m�1`�8�v'�
mtXlG;���&�o��=(��{P�œ������3
* �J
l��]��+x8��F�8��<N��y�U0 at NB�
V�Ʋ
-#N� ����lV@��Ux
-\�*f\H���e'	�-��(?�K�� �IT��<�vkh(Yu��
r>�	ⱨ����"4&ǹ��\Ĉ:�ET
"m m�xXݿ�a[.b����,{R&մ���Ѥ=�Ԧ���"Q�X�2��\����%}�қbX骑�B�R7[�g� ��A�E��VB~#�B
�Y�K�P�J�h\�,�����b���7�|��\�� q��KR���e2�M<���c
�t��/�2�$ǘ�2�ĀO�r�� � ��w���2=�}2�d��e�;����
hg�ev
m��aC���g��e(i��W� �)
"<�C��7m�>P��Y}�&0z
-�
�A�#����� )�|�k�
f��W�+��
���M�����@ș�j�

l#���C&��d�$T�㦤����%TF
e"��4;�PP�!T�g*�֍A�ɢ���gB#BIfj?dOI����r"F\����Ю|]ۣ'�ƅ7��A�>��=Ȁr���
�W��o�v�G��w.��Uz:��������f�w�G�����w�< �\w�E;6P$5[6a��c,XX$b
6m��i1dc΃��;���c�

��Z� ,�̑�➕�z�~
�z��<�vK�>��
&�|�?<�
*/��d�L�3z1H�<,'�F�Pc��������h#�M"��8�(�Ʉ�޹��y����͆E�AX'n�f����5x���\���2����N�]&ş��tG��̳���&������ �ĔY4�1�'��;��ת����>�#!�
-�XUۗ/^�?=�I���
�+w���ۭ��G޴�U��ʾk
-z��<����tv
-endstream
-endobj
-16750 0 obj <<
-/Type /Page
-/Contents 16751 0 R
-/Resources 16749 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16744 0 R
-/Annots [ 16745 0 R 16746 0 R 16747 0 R 16748 0 R ]
->> endobj
-16745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.4 472.871 212.124 483.775]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-16746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.379 311.301 210.103 322.205]
-/A << /S /GoTo /D (index_Cylindrification) >>
->> endobj
-16747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 207.893 485.603 220.411]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16748 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16752 0 obj <<
-/D [16750 0 R /XYZ 89 770.89 null]
->> endobj
-16753 0 obj <<
-/D [16750 0 R /XYZ 90 718.682 null]
->> endobj
-16281 0 obj <<
-/D [16750 0 R /XYZ 406.869 642.079 null]
->> endobj
-16754 0 obj <<
-/D [16750 0 R /XYZ 90 635.439 null]
->> endobj
-16755 0 obj <<
-/D [16750 0 R /XYZ 90 554.909 null]
->> endobj
-16282 0 obj <<
-/D [16750 0 R /XYZ 90 520.239 null]
->> endobj
-16756 0 obj <<
-/D [16750 0 R /XYZ 90 515.756 null]
->> endobj
-16757 0 obj <<
-/D [16750 0 R /XYZ 90 447.028 null]
->> endobj
-16758 0 obj <<
-/D [16750 0 R /XYZ 90 393.339 null]
->> endobj
-16283 0 obj <<
-/D [16750 0 R /XYZ 90 358.669 null]
->> endobj
-16759 0 obj <<
-/D [16750 0 R /XYZ 90 354.186 null]
->> endobj
-16760 0 obj <<
-/D [16750 0 R /XYZ 90 285.457 null]
->> endobj
-16761 0 obj <<
-/D [16750 0 R /XYZ 90 231.768 null]
->> endobj
-16284 0 obj <<
-/D [16750 0 R /XYZ 90 185.143 null]
->> endobj
-16762 0 obj <<
-/D [16750 0 R /XYZ 90 180.66 null]
->> endobj
-16763 0 obj <<
-/D [16750 0 R /XYZ 90 119.752 null]
->> endobj
-16285 0 obj <<
-/D [16750 0 R /XYZ 90 81.969 null]
->> endobj
-16764 0 obj <<
-/D [16750 0 R /XYZ 90 77.486 null]
->> endobj
-16749 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F11 613 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16772 0 obj <<
-/Length 2960      
-/Filter /FlateDecode
->>
-stream
-x��[Y��~�_����V���	�8�!G6���F��� �Lή�����98=l.g�`~"9lVWu]_U5)�jt7����ŷ����W��1r�i�G��#GGF:�4|��>�%�O��R:��0:ζ���̈́��z�t�϶��wŧm�}���>�0;^�&S����E��Uo���._��@WH��J���������/W
8�#Vq������Շ��h� 	����~�r$����觫\�@D/�Ec�0֑�{W�=N�
��0�-
�P�C���H�	��g]��!����L�S�06�����)�I�����:'S;�*
��0j�����y@R�$�##���?,�=�&��${�����fS���nU�ſ����Tz|�^�J��B�i4lQk��'�O�M�l��U+3�%�0�O�P���%���x��7��x*�!ڸ�D5կ���=�\W�p�����[�߅�� Tw
1o֔�ŮZ0�5����զ`VOS�c�q=��%��I�C��E�00��2�"Tq�U
	=�H=}M�SD �)�A��|��6ߔ�VH��+�6@��評�gç�vB#d�6Mœ�
-�س�
V3��e���$�w
��9ӥ�!��G��*t��1N�@2
DU�ٕ���b5��-�E1�qR����2_��Ž)�S	!J$��!�^OT!$
󜨡PG�%}�]O��Sx�D	�S���Ry�y�-����l�7q
����iZ�n��MV��W�m�:+@;p�`
y^�J8���=�e at R0��s/�yXi�J�CV�\d��L���C�
4�*` �J�^���f�|>1�|����	���@0���?DY���W��*nQ�ۻZ�?~5��G_`��
+hī�EQ�u>y�Zr�2s*�BN_
�)DPPX���_��Ge
-r�T&%*됼�)�*T�d�,��
*�z&*
$�
�
Ee�+�I�lZϽ��IT� �9k{��Ԩ��z����
�
-�b�e�
�	pr�� @�('`�sHߦ�� H�+��E1�A2��Z�`�X�C�
v��.����RN�-�:�]�-��2�c�R
nQ�;u��%`��`�#�=��P��|4�C���PF�Z+�1@��@(��.MH�F���8�,�n��.�>����' 
�6CDt aM 2	f:
����ǟ��b
8��ex�uM#�|7N�s��X��'5��<BN \Q�R�]�h��]�Wh�q�?F0K�e�Ym���
-�%�;��h+E]E��M�4��EH���#O�s%֗2i�LOң\�0��(�C��+� K��PnJI���L�H��
�r�W�q'�ܚ��{	͓(GY��
ʵ��G�O!]�	�q�/���=�l`�љ$,`���

��n6�侊����w�`OC��!{��W�����v����q�i��oE
�
-e��?">�C�t�*���R
o�� 
�Ȝ
��b�gۏ�}�T7
v�"�>��?ц܏sT
�<�1���C�o׹��m�d��œ%J��
-�
�H�P(�J$Eu
��mV��������ĭ�7�n�@L��o�
1��&�,_���*+},�n�Ǩ���+�c��^�1�	P�g4�:��
d g�L rk�ʶWC ���V%I��O
j*#3�o'�1�??�;h,��Ʋ L��|?�f��>�����ê��i�m6����(DdB��$@Ӗ�#�`@�E��p�ࠪr�pY>��&
���c,{|I�Ϫ��"<�u��c�!%ŝ��
�'0J�Ո�)�P����~����2/��(T��ކ�/܁�H���3���APr��x�V����`�쐒Hj
-	760���4����x�}�
�x�T��'634�������5����k�5ut�x�g8���"� )
Oiu�)VVg0'�DV�h��Z�M��VG���w3q��2Ӛ�
-j�m
�9�ˌm�Y�-�q# �Lؔf��beV��2�YQ�qג(â��e]�Oܲ����B�sl�z�(s�;xY}�2�H�%��d�0������Eٍ���z�X�
2ڳO급Ix-�ўMq`3���O�
7�[�
�=2��@ӻ���z�
� `7���'��V$7T9��l��j:)�vj(f�M=.f��H�m�*��fjX>Y(��0D����k9)��a�F0|RL�x
��tFP��GľVkːp��M�7��-
-���V�ׂp������n�!m��|�H�HI������Ǻ��YS�e�y���̥y6��LqZh��WѝjT��(G�d2�5��h�lS3���t�M��6u�/7��l�Vݬ�	3�i bd���&_A�
� ���M�	(�s�<G��|x��

-/?½Yo�YY�#N𥐩�8��6�#B�,��
��A���E!ʁ�,�]�}�;r���67�k�A��w�;�������%�L!�D
!�"
�/HT�aA�{�c!�/�QSpV�˥5_>{��f��j�-.2Y&|K
-)��~ge
�e�W�M���+0�`���C����5|�a��v��G���ă�z���E}l=/R�O� e��P�R�B�+�E�$b�}��gRמR,�IÉT6�:�Q �M��*�
_`�4lޞ|L�#|��'/�B��.=)�vH࣮����X ��r�5��<zk
-c��"Ή�צ��kSʉDצ�
v�
��L���%�������6�cR�\�z���a�
~��v��N
?�"�$�����b�[���#���
$����r��c���o�a��������o�
�}1�O�Mц�y��4��K��nn�Uo��˷��(5�+��g�����'�cI�� �Ъq3K�s���Ϩy��+4{Vp����v_���ׯ?=����
�B��I;rTwk�
qM�\o��ks�O���N��h�B�I�a���2c�_�}�l~X?x�v)F]��1�� ����
-endstream
-endobj
-16771 0 obj <<
-/Type /Page
-/Contents 16772 0 R
-/Resources 16770 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16744 0 R
-/Annots [ 16765 0 R 16766 0 R 16767 0 R 16768 0 R 16769 0 R ]
->> endobj
-16765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.334 585.789 242.487 596.693]
-/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
->> endobj
-16766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.275 473.773 293.971 484.676]
-/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
->> endobj
-16767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.269 337.846 238.02 348.75]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-16768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.953 112.215 250.388 123.119]
-/A << /S /GoTo /D (index_affine_form_relation) >>
->> endobj
-16769 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16773 0 obj <<
-/D [16771 0 R /XYZ 89 770.89 null]
->> endobj
-16774 0 obj <<
-/D [16771 0 R /XYZ 90 667.827 null]
->> endobj
-16286 0 obj <<
-/D [16771 0 R /XYZ 90 633.157 null]
->> endobj
-16775 0 obj <<
-/D [16771 0 R /XYZ 90 628.674 null]
->> endobj
-16776 0 obj <<
-/D [16771 0 R /XYZ 90 567.766 null]
->> endobj
-16370 0 obj <<
-/D [16771 0 R /XYZ 90 533.096 null]
->> endobj
-16777 0 obj <<
-/D [16771 0 R /XYZ 90 528.613 null]
->> endobj
-16778 0 obj <<
-/D [16771 0 R /XYZ 90 443.795 null]
->> endobj
-16371 0 obj <<
-/D [16771 0 R /XYZ 90 409.125 null]
->> endobj
-16779 0 obj <<
-/D [16771 0 R /XYZ 90 404.641 null]
->> endobj
-16780 0 obj <<
-/D [16771 0 R /XYZ 90 310 null]
->> endobj
-16781 0 obj <<
-/D [16771 0 R /XYZ 90 231.604 null]
->> endobj
-16372 0 obj <<
-/D [16771 0 R /XYZ 90 183.493 null]
->> endobj
-16782 0 obj <<
-/D [16771 0 R /XYZ 90 179.01 null]
->> endobj
-16770 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16790 0 obj <<
-/Length 3162      
-/Filter /FlateDecode
->>
-stream
-x��\[�۶~�_��V��`�/��C����n�ƛ�8W�V�겡��7��R�QZ	N^��%E��w���a���������d$�������		����C�����LjD�����o��������ٶ��w7��h��	��`��y�3
L��w��уO��r�)��b����78��^��^�@sǡ6c>P�!�=7oG���X�۲
2�8�('G8l����`fX#X�ޙI��[��%{d�H$��
-�	2B������
)Xg�1†���X�~��-�
^ɇ��:��b>���hL
~
Q ���Ex�]��y5��GM�bf���1]�'刈��Ǻ�l���?�6�7<{X�S�?eA$"WL�(D,I�s�.;E�:E���:�%�A' >
 �RL��^����U\$!q� �.��J��s�����-~�j��s��M����7�غ�V�����~�������v^��i�1�6Vb<�&����x0�sh@�x�����o�x��g��  �u�0��U���?���w�A�
��Jʥu
�
-�iTNA����l�d
-f���<)��C'���J2
օ��~������)���@�J�)��:�s���i��`֯�E�^R�6��f;���V#&�XT� �L
�� ����#�Y�y�l >t��qD��h��(6ܱh�w�zmE���e�+�{�U��3�4
�"t�U�@\�]��������O�>V1��BFӦ�v^m�Q��
jQ���i�c5޸ZM��Gк�K�m�g~�R`�
N���qa�>�g��V뭿)�e�XLJ���T�r�H)�<�*�p��w�N�9�N��৔53��+��"�L����r������Y5B�\B%����d�wK�a��iSN�]Z��Ͷ.&��)8`~�E��n*\��i�/�&�w:��~;�l����Y<������L�u]N����u	>�?e]<Ʈ�l\���jYl�4�9N L�r��G�A1�VO�u�����
|��_��a�E�e�(	��ZE��>�z�:��j�\�U�#MC
��c�3(��m=oB�eq�@�2H2�)16-D�����(Ȓ���x�
�>��i�`�R���9X�T#-H�›꾶
�
>����c��^����
�g-<{
�7�,f��
�� [...]
�R,k��	
���ǔ��n�?��@d�&S`:(R\_����4�#%xp�A�Blr{�.�
�@���ε�C
����!R�D��$
�/F4k5-W�e�*��ՠ�
���j*b��[
-���Lic���>[(ې.�9���M�����1/�ƾ^����kg�\�i�Z?�Q��؀��Q8��>e`��o�6��oo�
/��	��PF�
��ޕ�H�қ�8��p
�k
X�9�ײx|
Y ����z���(D.]�

���G�-����ʇm
�Ie���F�Ĵ�V�$�0�ð ��DZɔ
�)P;]�⸹��C� �	���t2vt�1c�����9g��g�_�P))^�P���dv/��7I(o� ,��O����L��>�O����M��Yo�g

"-MO �
�<���N��:f���2Ӣo��� ͻ
����x;VO�8ln�����M�Êh�!��+��~��τJ���Ⱥ��4����Ȋ��K�����]��X��\<2�^S�j�u6"��i��>y?��C�ڋW�8Ā$U4'h/��������l�@�ɬ��/@Ӊ�
�4U�
�W�
�y	���l�q�M�`o���
�yv�/)�
T���+�讯u���_K�
`��}bk��t�+~*1�iq�Ha���ƃ�"��ȮH�T	�|/!�/��Z<�Њ!�+�
	1�ln㡺�S�M�g�^��Q� ����J��q�e?ŗ+�kh��K
6�	���&)kFɩ��,9!Ե)k	$"��JYK�/2�@��=�JY�|�
-��E����&�B#�IN�$�*�.�=ism�VfX�Ԍ�G�s�2Gr�c�@m��y2wn܉����hPĆ���r�i�=/�a�ԕ@fW6����y�Jq3��P���z�6+��d��'���s��c
-�d����d���`�@����enIq��J�SF	�\9<e<2-��*O��N��-��d��7N�3*�!���R
I�s$��q����|�ԧ��m��Ej���6~,aT�IKW_���n�}�*����.�
o�ż��W,{��#!`��<��#!���E� �
��H� �%%ARq��Zr`�;����᫰d
��J�����س�E�
��@�Yo��Yp�:"�
������
�
���G0L,���{��)lb��i��X���f��u$Nz`P�nl��hw�{��V�������Lv+Cހ$X`��./�A�J�;� (���<4�����)~�h�m*�yQ	�J>�����6U�(g!
-�ۘ�C��
-P
d�b5�L�5�qV����
-�'k,;E�>
J���q>�@>l\NAiѦ���A�j9	���I����]��<,�x|k�$�Z��Nс����,Z�Oɾ�hu%3I�D̜]����y�B�RӺ|�G1bI����=��7�$��7��E� �[_TҺ��4��x����gd 
�4��� <x�g��uP�^{/#�
^�^�K
S�oorU�.^�㘔i��
���ˊ`���?���!T�or�|� M'��"NN$�C|rflG�[
4�.���#����8ϦO����L4U����"ؗ)��T�Q?{M�$� '�LR
���7<pS�K(���N�1�.���!��N��x:tڟm4(�(�'Bѐ͊=�p���fی�FŦ����•T�rj6%g���P0sT��zar?���.�u5�
�f�,*^�z��HIޚ�5$S	���*�e�����0
-	�/�rc���k�޻�����ߗl��5ۑ��`��5`Ar��%��f�8Dy�6|��㦬�8b�|�\����L��
�I������&����o��?n
�;�
�o����^�?=l��Uv��߽l���}�1kB���V��s����L�����Lx
-endstream
-endobj
-16789 0 obj <<
-/Type /Page
-/Contents 16790 0 R
-/Resources 16788 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16744 0 R
-/Annots [ 16783 0 R 16784 0 R 16785 0 R 16800 0 R 16787 0 R ]
->> endobj
-16783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.089 495.333 246.767 506.237]
-/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
->> endobj
-16784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.899 269.908 431.977 282.826]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [523.983 104.805 535.938 115.709]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 91.42 261.145 103.754]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16787 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16791 0 obj <<
-/D [16789 0 R /XYZ 89 770.89 null]
->> endobj
-16792 0 obj <<
-/D [16789 0 R /XYZ 90 720.814 null]
->> endobj
-16793 0 obj <<
-/D [16789 0 R /XYZ 90 642.816 null]
->> endobj
-16373 0 obj <<
-/D [16789 0 R /XYZ 364.289 566.611 null]
->> endobj
-16794 0 obj <<
-/D [16789 0 R /XYZ 90 559.971 null]
->> endobj
-16795 0 obj <<
-/D [16789 0 R /XYZ 90 467.487 null]
->> endobj
-16796 0 obj <<
-/D [16789 0 R /XYZ 90 389.091 null]
->> endobj
-16374 0 obj <<
-/D [16789 0 R /XYZ 90 342.465 null]
->> endobj
-16797 0 obj <<
-/D [16789 0 R /XYZ 90 337.982 null]
->> endobj
-16798 0 obj <<
-/D [16789 0 R /XYZ 90 243.341 null]
->> endobj
-16799 0 obj <<
-/D [16789 0 R /XYZ 90 140.636 null]
->> endobj
-16375 0 obj <<
-/D [16789 0 R /XYZ 90 81.969 null]
->> endobj
-16801 0 obj <<
-/D [16789 0 R /XYZ 90 77.486 null]
->> endobj
-16788 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F24 529 0 R /F117 2446 0 R /F8 794 0 R /F13 834 0 R /F11 613 0 R /F7 795 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16809 0 obj <<
-/Length 2909      
-/Filter /FlateDecode
->>
-stream
-x��\�r�}�W�)����/L�!QlWl������.D.ITp�H���93�
�,v;V�<�v����>��}%\

�_����׿�\\~c����
�<


����~�n�(�|4f�������d5��^�8
.g����������j��|uU<bv�\��\���d���o��"|V,�
-�R��f���w_�\�t��
���"����~��{<�g� �@r��l���411��i��j�Ade������~4��X���׌YA�tA�
ҏg�V�}���D	�(v=
�8blx_�5�4��;œI4�
��085Ug�
{u��?/�j2�������yE���Aú���(勢eb���f��>�V'?��)�a�q"d~��zM[j̥!:�!�)%�{�8�5����%�L}VG��P+���w\���)n���)f��t��}�y�
�k�nqn�ª��?�K����b9�n�XoZ���t5��tQLV�_��
7�z
]Zd�]��o��MM�-�
Qx�y��EH��$ D���jY��M�Ŧm/p���蹗%FQ<N�YM�����v��Xp��7zN΅"L���� -V!Ҷ!�B���b9�.&�%6>�v��G+�xl�W���].�Y`��
��U[�
���{L�lm`�=�.�щ�Wؔ�5�R��
����I�

n�q��{Rjk�PѢ�ĺ�j��i��c0��b7���Ƹ�X��|hQA#0q�]�O��S�uU�����v���(��o�X"�ͷ�wa�c��Ã�È�a_K�1�4
c�^4�X�vaKi�"��N�
N;?��D�2ӠF�xC�p�n1m�����D��ǒHY���NJ�='�!�ox\��
�6Hm�է܉bD+����}&%���l)J-C$�%pLu#v}z��mY�j��9Y�d6�8�m2-S� V��g�k
�p�����@����P&4�N�'H�
-Kv�I�4aۋ������b�J�BR6��E��:ؼ�&��O���f�9� ���S�Z��"�ו���
4u���T���J��#$I"�?��@co
-S&:���^,�9
��#E���&���x�Ļ�ɢD�zz_~��Ǭ*�
-O�S�'��?H]}c���
-g�az7V R�pˈ����3d,�#�rh�ee0]�2�*�
aOu�AXW��P�<	,���Z/�dF�d��b��d
-U�D{��h-�� 5Ru��J?eZ��(�����
�&f�m�h5}|:���SUź�4ԝmm7F��dlN��Q��i{�t.�b

E��RZ��l�(�ziӎ��6tN7�9g"����Q������v�k��R��Q��[>�@8����_��c]��\��I�C`?�6�|��D;� 9	��m7"u�21~��֌v���P*
-BT�U}��]�t$Y>!-V��d8����
��I~�a�K+;�ִ*OR�
W��߫�
ϙ$��JȪ<
 
5
JG��LW�zsu5]�$�����v��r

�=�20 9-�=@o�*�ğ搩)7A�SSKo�VK��?!z(�Ӈ6���m)�_[F�n�/o"�/�	���LGl�66#5[��
��8"�8��|�ܧt�`�YJ'�
�0�~
-0���{I�4�NQ�ϟ����G�h���.4�
.wDͤ�v�
����M�����yrWθU�T���bLI����_��t��dRNɎ��6e�"�nj���r�����N�v{]6���
�_��y4t$��/�LJ7��I�cnVӻMw=s�����f;Oi9q&�!�G�Ѯ�T�<ME��T�N
k*Jl6/�wK1
V;�N�(Rm�O���T���yۉ���Z�f�1����^"�>�?+\ä�Ϛv=FBq�
�l�����jHNn�AKj�����.G̞֭-G��e
G!�	
G���
G���
-_=��U�@�ިr��Qe�*.UG�J��>'��JU~ҲK�o[OimU���b�n�T�
-��&�����F�oRYF|
g�
�$��`T�QI7&�����J�z�3u���F��.����wh,Q�hW�
���1#�R��v����0��B& ��P�
-�e3Q��H��Oc�W��r�
�����Js%j��
��mK��!���X�,0B	��3:koG�T����NOu�1UW�o�|�=
��0q�R�����?�2E	�H؇�qy%��hGI]��Lm�����v?D���f��_Fi
��Z��6J�𕰜lï 3l3nP��3Z
��vMb�ю2N&��/��gg4���vVtv��mlv��:�-�ig
%r<���r:����;V�A�R

��<
�h�^�Ӱ*���"9���k�=1�넡rW=�](�\�Nzv,`��b����(YL-�o��={�t4��2�7H��y���XhU��[VVV
ce��A���SnY��I�,*^�r����m�D����*����ժ��a��
-�efx�r�μ�k������0O+���{������9�8OYZL��9����H�[����;�
-�֯�A�R��d�����/
���t�֜@��:M+T'M
d	
?��������΢i�o�T�Һ/��2�pX�,n�K
e
CZÄ�J�2ʼn�/�i{��ʖ$z|I��|c��/C��N�F4aS��_�1Q�_-
?���N;����'j�W�۳��Ή��#X��I���e�*hՒ;���G;J�z|Q��|k���y�q�����9¼8��f��f=�%��M�\�]�ׯ�Ϳ���#��e���ä�t|��ѻ�X�� i[���X0:|[T)jT�?�������TaJ�����f�|uy����X<���|�n���-nk���g
��4h���yT��\��
3�V���G�1<��߇������ߖX���
�;@�
-endstream
-endobj
-16808 0 obj <<
-/Type /Page
-/Contents 16809 0 R
-/Resources 16807 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16744 0 R
-/Annots [ 16786 0 R 16802 0 R 16813 0 R 16803 0 R 16804 0 R 16805 0 R 16806 0 R ]
->> endobj
-16786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.307 660.661 434.874 673.578]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [523.983 495.558 535.938 506.462]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 482.173 261.145 494.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.631 413.484 429.297 425.964]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 269.982 267.79 282.316]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.883 201.294 440.282 213.773]
-/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
->> endobj
-16806 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16810 0 obj <<
-/D [16808 0 R /XYZ 89 770.89 null]
->> endobj
-16811 0 obj <<
-/D [16808 0 R /XYZ 90 634.093 null]
->> endobj
-16812 0 obj <<
-/D [16808 0 R /XYZ 90 531.388 null]
->> endobj
-16376 0 obj <<
-/D [16808 0 R /XYZ 90 472.808 null]
->> endobj
-16814 0 obj <<
-/D [16808 0 R /XYZ 90 468.325 null]
->> endobj
-16815 0 obj <<
-/D [16808 0 R /XYZ 90 385.639 null]
->> endobj
-16816 0 obj <<
-/D [16808 0 R /XYZ 90 307.242 null]
->> endobj
-16377 0 obj <<
-/D [16808 0 R /XYZ 90 260.617 null]
->> endobj
-16817 0 obj <<
-/D [16808 0 R /XYZ 90 256.134 null]
->> endobj
-16818 0 obj <<
-/D [16808 0 R /XYZ 90 173.448 null]
->> endobj
-16807 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F8 794 0 R /F13 834 0 R /F11 613 0 R /F7 795 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16826 0 obj <<
-/Length 3061      
-/Filter /FlateDecode
->>
-stream
-x��\]s۸}���S+ͬ|t�m���6ݦ�ۗ�NF�h[S}x%9Y��� �Eʒ��i��dDS��pp��=�hr��介�_]��ֈ$%��:��MR�����,y7RŽ��>��j<�o���W�~�z�޻xuu���[4a�E�Mn��~��
��O(�M>�F�Dr��E�����z%\�K�Rx���6%���0A,U�;�~��
v��j�
�3��Eރ�`�y�����~���f?�M,F�hˉdg�&\����2���E�Xâ��$����&KnF�i��1N�����^�4����r�K:�0]�g率�0���e���շ�J,��9L
���q
-!	���8u���n��~�
s5��O5���ۋo�l<'�i��~�T�m�j�!�ee���|��	�׸��"��.gsL��`2_ݬ����z������|w���FS������%[�Yo��0"�,�l�3�?Oh*�X3t�T{��E�p������w�D` 
-NN�bi_��^<�g��z���݄+:��f
�t-*�6�b����PX�\���d���m�7���.��<-��
rx�(����ހ�,r�F
��l
N�:
M���43J�6�O��Lc.G��
������-��	�Y�=#����Y�hZy���
$B�ތ�c�F
t
.p��(.p�t�y����������e۟1S�����z���e�}�4�!�E�N8L��Mo�*���p�\t�гQ�A,�y< u���r��H-6��&������t3��p�3f�'� ܘ"���������
-��vBqo�|v
~pI�e���U6ݼ��Cغd�a ��D�ԯ�\�۵J�
�� �Z8�(N\��3n���Z ߦ2�4s8t#� 
]S}��O=A�
$1��($%�)��MR!�&Y����o��yI�Z���bC"q10�I�Q�MQQ��f:�m//��j�JpŠgvϱG�����7�-6x��V7�;k��j�Ͳ�z9_Mw��pnG��@��8
U�'����U��
�"V��(���+h�(�h�z�b��VB��$R�?�;`�n�h�գݺ���h��2Ɵ'cF��Q�w��z�/�V�ȠB�U&4uP���;�ɶ��YpS�O�}�����e�󭧷��iɿ]ѵpE��\�ᠹ�H�����]��D����|�}#[�O�v�~��ҧ�	� �"�!�%�d�q��զr���:��c
��\E.�6<E�:+�`�
Es�'�p��ӎ^�g��F����&g��j�C��͈�ZK�eH1�T%*��P1dJK �Ƙ�EЏm��Z�J
-�N`t�0GTЭ)y�g��e��6�
>S{	:8�"��!^�'�HԈn�Wc�T�%;|�*rmh�����2��
-��&�
����b�w�:L1�
�|�Ǖ���TEl��LJ�t�"��~�_we�V�l�j��I��
X?`RX
[�-����+��c
��
-����2Yf���;q�q�9�
�cM*��
�٦�X�!��"/�e��>-�Ww}�+Yq�폃��c�	LRnc�.��
v�kD$����p撺L���n�;ݨk�s4�

>%��
f?<`R��D\l�
p`�Diuz��od3��;�t�� 7̝n�5��g�?�ݬ�����pO���ht[^g'?�w�hQ�M�t-Z���vg�0��

.[O�}���r���T����
M
�&YX<�����c��ًЋ]gQ蘌�|�������=��)�"ϜHN���7�GA��"J������8Xk
M�7�R�
�y�����xr�+%/��p�cuW�l���-�4��`�_�ƕd��aG��V
����?Ң���C��0	��Һ��k�+EP��nV�`(m����,_���U��n��ڧ{6S0��yd�BWu��M��+�l����.T/�7mw*>�?3��PX���AM�2�s��?����,nH
b�Y�f�T�%��}��Ҳ�ӧ�re�9��P}����
��*�T8�$E>\��b�FpN8q91p�<*��ҳQ^z�l)�@J�B�9��
��Z�e&�H�T �9)�D�lɲB��H�1&��HO���D�O�H�=��,�D�L)�:E"��})���I��-�R�#�����y���c>:��WIi�͞� ƨ*�j~L�8�ÇZ%�
^%u�qP%E�Z%E�V�o���\�z�T>���*)�Bk�0Q\
SI
S8���=J%5DK�:}P%u�L����~�T!G�\%Uǫ��?��
-
��I|�J*ǸIOSI���J*��9��ݢ���TjET����;�����,�6��oi�珫<�1���sd�xEӪr���jQ~|�D�t�;� k��)�g�!��DL�E6�#N���:�<�qHOA���G�Ӎ��?��@z�8�����1�b9��&�@�5%��g	����\ӝ��1���E�Ǯ��:&�<��i)w�k]��)W �6}�`&%�
��$҆�)5u�Ƌ��F
g)��z�J��J�U%�rTҳ�\ot9�Q� ��ʤL��(ْI;L��a����<sߖTr�L���i�ّ2���I�m9p�H��;�J
���8�-�ۮ^�<ʊ�YH����9.�(:�J��n
-�T��;_Bw��Sr[d��z$7��`��a$����'$cZz�w ��F��4r!
�_0�V��<����������
� ��4�����u���e�� �
-�
�����kLkA+yў�^�
,
�}��DtF�2�XܟY�o��i�r?���˧k�M:]�8�O#�T�L�@�#����8K6}`�]t�9̀M7�Y^��5�lv �z�+�[?�뻧̳��
���^��1J����.��&���D���8�w����sg_���Rf��]�q��,�)n���R$X�Xmn{��`	k�~�G�l��C�Ӱ���������l��R�"��y�z,�J�=|p
*�ԧFh^0�FGo�2m�~��r�O
�
�$��0��n�p������6[� o��� 
u~�-��\�8��ps���0� ���Q.
-endstream
-endobj
-16825 0 obj <<
-/Type /Page
-/Contents 16826 0 R
-/Resources 16824 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16744 0 R
-/Annots [ 16819 0 R 16820 0 R 16821 0 R 16822 0 R 16823 0 R ]
->> endobj
-16819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 681.422 267.79 693.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
->> endobj
-16820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.059 599.5 422.924 614.215]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-16821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.333 348.002 425.662 362.718]
-/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
->> endobj
-16822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 121.694 322.446 132.598]
-/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
->> endobj
-16823 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16827 0 obj <<
-/D [16825 0 R /XYZ 89 770.89 null]
->> endobj
-16828 0 obj <<
-/D [16825 0 R /XYZ 90 718.682 null]
->> endobj
-16378 0 obj <<
-/D [16825 0 R /XYZ 90 672.057 null]
->> endobj
-16829 0 obj <<
-/D [16825 0 R /XYZ 90 667.574 null]
->> endobj
-16830 0 obj <<
-/D [16825 0 R /XYZ 90 569.89 null]
->> endobj
-16831 0 obj <<
-/D [16825 0 R /XYZ 90 467.184 null]
->> endobj
-16379 0 obj <<
-/D [16825 0 R /XYZ 90 420.559 null]
->> endobj
-16832 0 obj <<
-/D [16825 0 R /XYZ 90 416.076 null]
->> endobj
-16833 0 obj <<
-/D [16825 0 R /XYZ 90 318.392 null]
->> endobj
-16834 0 obj <<
-/D [16825 0 R /XYZ 90 215.687 null]
->> endobj
-16380 0 obj <<
-/D [16825 0 R /XYZ 90 169.062 null]
->> endobj
-16835 0 obj <<
-/D [16825 0 R /XYZ 90 164.579 null]
->> endobj
-16836 0 obj <<
-/D [16825 0 R /XYZ 90 103.671 null]
->> endobj
-16824 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R /F7 795 0 R /F8 794 0 R /F13 834 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16843 0 obj <<
-/Length 3468      
-/Filter /FlateDecode
->>
-stream
-x��[�s��_��V�9��M�3}H�i��|\sn��%�%�b+�:������ He��>$��.��,�tr7���/���x��HLbk�'W���N"��n9�4e�>�3J��Ì�iRn��3N���q�.�����L������3�"�͹��w뤪\���6���|�]!��*�~���⫫��
8��8Q$2�����ot����L(��<�N������Nj\P/%\a/^D���a�#!D/����i�-����;��Cf�<����ⓓ��-��<1�	e:`��Lp��cS7ч
p��6�p��!:Rnags3���3c
-���L���	
)3gBH"dpx��r�B�REgs��tQ�U���@�)ќ��۟f1�͒�uZ]L����Qq�ş\ƢNC��M�{D~b�z3��\�JE4��A�X)�՗�._����y�ޥ���,���mz�3jH��WC���J�f臙�ӡ1� �PM��c��n�BVi^'uJ;4h�	7팔3=<(
-S���
mJZ�J�(��08��`�L3x�f`��j'��$<j	��^e�����ǪN7�
.��,�����
�0"r�"��P$�$V@[�/Շp0�X����nȭ���"�`�H$E�
�^�x?)C�
<�P��z�r��\0E�����l�)���Y�8dG膚��!����a�#����zU�ժX�I�fp�a{eaz�N�'�I�Z��`-�Ȁ{e�t�OP5¢x�)�1'
�'��,_f��r��׸0��gFI��-�u�K�h
�^K�2�.�
-U�y�~������
�-`AO5���07U at h���^���6]d��<]��l�@A��}q;
��Gq�E]�
�d���� ��I:�$�5�	J�L�m��l��6�z����÷�%��D�E�tD��PL�'��R$
���1nO–6��u�?pc�Ah�&"������f����

��L�S�5�!�
��j��D�:�>�=~��&xq�o����(�~m
P���ù��!Y��*������l�%yz��Dv��
G
�TF���)Z
Ep��i�9�X�y+F$G�@(GM�vv�cb�]&,t�T�mBS[�����ݍ���[��+�0�w�8εz8�ވ=|�n&$�Ei����!!^��W��Q�!E�4�Bvt��vH:����;i���&�?�g11ـ	gm�xZ�ƥ�i�Ϭ�������c�ص�,v�շ���pW�]�U7#���b֧N^co_=yǑ[�X�1�;6E�]��2�`W�R�H�e<	�g�0��=
�B/ A��}/���ݤ�S	���O�r��7u��
�p"�9DC��h�e
�
��D;�
���D������Z��N�"Z*��Rr#�6�yH��� i�hј5y���)�>��a`w�PTUv��M�V�|g��m��Ddj���a�.�6���+����UQ��{T�&Y�	�iK�V�6�v��kPi�o�\�@*�?߇��B���ہl�\Nh����BaNv�|�r��<�l�^��4_��F��9\�S``��ڽ��1m��� �Xx{`���B��
�.����J=�y��q�mj�H� d�-�!D
{p,�
�b |� ����,�����;q��
�@Ӈ�A�vP�.�-�����-pz����r���
"T��i�â_����7�::�+���W۴�-ʍ�5 ��cf@?(�ϻ
�4�v} ZƔڮ
||Ў�
��5����G�$_��˝���v͖�����
�v����p��p_zlp�X�z9��E
k�t����-&�Qz|��K �o� m����+

h=؃�G�i�ߣ���(}
p�Ȫ��<ɇ������d�����:k��A�fq��N��^@�Ko4907\DŽ
s�}>�3�9;Z�
���Q?�$U$G�ܣSt�әZ��R�	뉔�P���8�&į��x\c�e9��'�Oq�gq>��ο���W$�o{��>�-*�`nv4
�
�Jc?�JS��|���
(�*�[5#8��ޡ?��F5qԬa�
J�.�̇�}[v�O!��&�����x�2���M�i	���qd<&� �b��&Af�S��׏93v��_���$�8��0�j����x$��
-�@��P��b�
�F7�����;<�������\x����M{�m<�
-Pĕ�)7DR��S? �^7���M��0�ܻ2M\�Z����Y�/�C��\�2�h����l�
-��Nӭ׮�qM��{#�֫)�X�bb0�r" 0�ρ}��"���v��A�	GJ�Bs�$�� Ȝ>' Mkq��
c/��+�S��:�s&	���(����f
6Z�3��E*�֦�����`�T�Ζ׉��w�&R>�

�n�SN�����bM
n��
�/�qh(�ժt�+�%�q�j�,��᫠�����8dk7簙��
-Bn<O��l�=�7x�._�7����ǣr
-Mh�DP�{9APk�!�!T��G�?
7����9�5��
�9
��b(.
���������㸽���qm�94�-`���R�*�
-Fa�6��`��'$�%?��QGg'�0���
�Q$�=N�a��:FJ">wB{�p�����J
;ƨ�-T8j�j�z�F���4��_��l�
�CZ�ǁ��
alI11m±m��r�`�E
-1ע h	l�;�S��tW�<T�����a�[PV�
B`#�
���r���>|�տ�_�2P`6<�ק5V�_�yk�?e�:��߂��
-!eDXw���c\�:ͫ?��Pu��ϸ�������e�I�Y]q;�b�7���r�	��a6�V��,�}L��"/F!�5��T��%
�Gܥ�N���f�G�y1� zs™
J����?���
X�R[�I~�6x��`���ξ7�;��d}W� ٍ��:�
���
����������0���6���u:����4��b
�
-�����e��[��_ެj�J�үq���ţ��M�����
�M�؄�O�7;��*r��:t
�{����
�1�a�O�xқ}ھw?e̼��\�ɣ0���/���D��-��87�d�XJB����K8���Q��a'f����N,��;
v�1��N��G�N̞�1ƌ�-d�|&�6�y�ؒF���
�A
-h��EI��?���k
��'����$�g~U�c�U������"sR �; Gl8 �`���0���=�y����HX�,E��@��g�8R#��
d�n�ȝ@؈&��-���}F�
�]�ۦ��}����
ԃ�x8���z����dGܼ���R�A =q�o�M\��G`Q]�DFV%ˆ�Ço]�UZ�y�@A��wI�k"=Te_�P�����Pc.�~L�x�1��I���;Dڳ�e�J�Z�����۷7��*����!d;r at 0��o��ٹzWS�%'��4���*)#Z�f&`2?_`�1����m͇ۗ����1�k����
��

-endstream
-endobj
-16842 0 obj <<
-/Type /Page
-/Contents 16843 0 R
-/Resources 16841 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16851 0 R
-/Annots [ 16837 0 R 16838 0 R 16839 0 R 16840 0 R ]
->> endobj
-16837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 649.984 116.998 660.888]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-16838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 608.788 243.45 622.736]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.883 440.853 361.886 453.371]
-/A << /S /GoTo /D (index_Wrapping_Operator) >>
->> endobj
-16840 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16844 0 obj <<
-/D [16842 0 R /XYZ 89 770.89 null]
->> endobj
-16381 0 obj <<
-/D [16842 0 R /XYZ 90 721.073 null]
->> endobj
-16845 0 obj <<
-/D [16842 0 R /XYZ 90 721.073 null]
->> endobj
-16846 0 obj <<
-/D [16842 0 R /XYZ 90 634.093 null]
->> endobj
-16847 0 obj <<
-/D [16842 0 R /XYZ 90 374.775 null]
->> endobj
-16382 0 obj <<
-/D [16842 0 R /XYZ 90 328.15 null]
->> endobj
-16848 0 obj <<
-/D [16842 0 R /XYZ 90 323.667 null]
->> endobj
-16849 0 obj <<
-/D [16842 0 R /XYZ 90 252.936 null]
->> endobj
-16383 0 obj <<
-/D [16842 0 R /XYZ 90 163.282 null]
->> endobj
-16850 0 obj <<
-/D [16842 0 R /XYZ 90 158.798 null]
->> endobj
-16841 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F24 529 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16863 0 obj <<
-/Length 2699      
-/Filter /FlateDecode
->>
-stream
-x��[[s��~ׯ�)����ލRy�:�f7^��V���n��I������9M�
00׶���A%`�_�� �
|{�����*�(�T�wA��C$$�̓w������&5"��Y��?��~���������Ň
?�X)
�./����9\�>���:x�-N�_o/�q�k,�D�94�j� s�P�c
(�P�-��)�(��q�SB&E�kK��
��?�߶V�5��ٹ2��֒�Y���@j���%v��ڽn[�a�&F8�v�?F������nI��YPd[�DJRՅr�%iYLg���cR>أ4Kgp=�1����lr�e�<I�2���e�=(�"���T�!%��".���6�͓e�I���(��o�I�U>��!(��V�n�|
���mD"r�6�ڕ��h��%ZSU�
-+;W^o�^c%��4��JȖ�E<�x�))�2�� 
m��x��>%�haOj�`���Zvg������b���r��ea��šFv��ƍB��P�4��%
�>$��:�� X
e��:5R8/������u��i����$�՛�
-J�Z��Ҩ����R����Wڃ�D��F�qZ��3� U�
-Z�I�ր�����eS��Ф"„�����_�����W�������!��{;�ko}o�g
v�1v��#i�d:#c��$K�l�]^_F�e�yJ�@h�K�ΰDQ���^�-�hpN�lB+����`t�-L1�����
-ĩ�j�{^'79dڙ�<]^�������o��ӿ1���
-)�u���D�c2��$���Q
�qg�($;w��"�O�}���θ4�3-�ڨ�9A�R�:3�2y [�;�a��]ܡ��;��6~��čx�j<y6 h� ����`����N���^$4wr�V���+p/��+�	�'
ph�������~�n�^��=��
-ː���/*mԁ���9��m/���%4@��:����1�
��l
�E�͗&�Kc�.&�
3��ז�ӷ��j���YǨ�.�Cn��1�ӁR
-�%?`��F�|H�i�6��-E���^`
̍[�*���ZH�/�Z	0+�`�-��W�q�^�C!���-��P�1X�vP��~��Ce�:?���Y��u
��.�.wm� ��A7�sԴ�
m�3�_�!&�� R5P��?
R1����V	"��Y1{�X:�Q����QL���%�,�<Æ�F��X�Ui��U+g+�*ހ*9)�d��è
ݤ����+E	
Z�|��&*8H��'�JTp-2��,6��7ð�Ub�sS������#�&�
=>��!Z�O�'�&��g�M�Y�3���"r�O|��&ֱ�$�HOV�3��k��u���R.L�k����m\Y�d{@Z�P)Bw¯�^}Ė��ict�B��-���/��k���C��X8!y
���WeF
�+�}�(痗��8�.����Х1��2N��fO1G3�+�����R��-���v�#eݕ^?�	N�=�[�C/����FZ6�o丘2�b&��%�i�2���4
����1��
a���H&B��{���a�H7ԼK�
�C��
���	�06�ϥvB����v$�> jGօp��H�Ii��
�b�06�'H@�%��I�^�Tc����l��2��W#���!p��0���Jw!4�p�ԋ��Ҍ�
�Y���`�I�},�
��L�Eiq��@)GX4�^�Q9�]���OE/�~wC
��w[
��s#�w�/h^�4Z
f�
e��~�/I{�ܴa���6��|\;�~�&6�@�S53lb@�]�]��
\䗐{��$�{��s����q�uq�P���n��J�
^���-�Vq
A8�(
-C
 kNa��uk��Z'��.���*����
�#(�3A
2
_)8K����fi��G;�,�2sj�t��̡�W�,��x�2�!�~&�aCo�hކ(l)�{��*���s��S�d��&����kCj�)g:��N_������
d�%Z�S�`�>�_�֑�1��y(M���+��_eOV�3@���>\9]�q�/e�?�k
-rA�ҿ�A�
:ؼC���Q��%���Z��Ԍ���q����-�q��

�~;�lS�J�a�WPļ4{���P�G%zW�G�>e�_�X�
W2����oނ��c�����d�cա�m�H�c�݀}�|����/H����	���K,
1g=b�m˜�#��K"�<�`���Z�.�ye��@0��`=��7�:���\"	�<�c�l�H�(�
}��{jkz;r��$tG^��M��
���:�7�
�Mw���S�?攙�#���0)WA �r�榎S���jS̵�\���J�y.�T���ՌqB̔�A=���5�d'�
A
���={23o1K�pǟx�����_�
5R�g��[`�hhp�ݴ��,�#��� 
Rm
_�cK1��ͣ�M<�
-ܷ���A���#��;V
-�Wy
u|
��?[ ~����
�Lj-z:	��ŽBHe�~��~yHU�)L� H!S*Z��>�~ts�
Ͽ[��/ۈ����F�Ӹ�Kns1A�(wӮƯ�^ۃq�G� k-��k�A�)��jsӖۋa�O�����K��o
�_T�G�/t��P�����o��E��#(������0Dx�MƝ{�l�5�
-�pqY�G�T��J�
-endstream
-endobj
-16862 0 obj <<
-/Type /Page
-/Contents 16863 0 R
-/Resources 16861 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16851 0 R
-/Annots [ 16852 0 R 16853 0 R 16854 0 R 16855 0 R 16870 0 R 16856 0 R 16857 0 R 16858 0 R 16860 0 R ]
->> endobj
-16852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 550.755 353.45 561.659]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 485.251 362.353 497.584]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-16854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.29 362.874 361.65 373.778]
-/A << /S /GoTo /D (index_limited_extrapolation) >>
->> endobj
-16855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.848 362.874 513.996 373.778]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 350.918 154.089 361.822]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 273.06 362.353 285.394]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-16857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.644 138.728 376.001 149.632]
-/A << /S /GoTo /D (index_bounded_extrapolation) >>
->> endobj
-16858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 126.772 167.927 137.676]
-/A << /S /GoTo /D (index_BHRZ03_widening) >>
->> endobj
-16860 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16864 0 obj <<
-/D [16862 0 R /XYZ 89 770.89 null]
->> endobj
-16865 0 obj <<
-/D [16862 0 R /XYZ 90 720.814 null]
->> endobj
-16384 0 obj <<
-/D [16862 0 R /XYZ 90 607.922 null]
->> endobj
-16866 0 obj <<
-/D [16862 0 R /XYZ 90 603.439 null]
->> endobj
-16867 0 obj <<
-/D [16862 0 R /XYZ 90 534.865 null]
->> endobj
-16868 0 obj <<
-/D [16862 0 R /XYZ 90 456.867 null]
->> endobj
-16444 0 obj <<
-/D [16862 0 R /XYZ 90 422.197 null]
->> endobj
-16869 0 obj <<
-/D [16862 0 R /XYZ 90 417.714 null]
->> endobj
-16871 0 obj <<
-/D [16862 0 R /XYZ 90 335.028 null]
->> endobj
-16872 0 obj <<
-/D [16862 0 R /XYZ 90 244.676 null]
->> endobj
-16445 0 obj <<
-/D [16862 0 R /XYZ 90 198.051 null]
->> endobj
-16873 0 obj <<
-/D [16862 0 R /XYZ 90 193.568 null]
->> endobj
-16874 0 obj <<
-/D [16862 0 R /XYZ 90 110.882 null]
->> endobj
-16861 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F93 763 0 R /F60 532 0 R /F75 554 0 R /F117 2446 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16886 0 obj <<
-/Length 2478      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���S+�T0�w����i�t��q�N2
ڢmN$RG����w�!��
�\�����`���''�	N>\�����k����2�{J
N7HH��&�F#M��1
ݎ	
��yz;�xT��^��2��6X�˷����1ѣ�O���/g�j�/�˞2���x��.�R�'������d8!
�@J'��O?�d
-��I0bF'���<���,�x��+\
-#a���
s� �Ͱ=�����1��
-�!�8�
�c�M�iO=�ƣ0E�S?����LA0KDRxx	���D���v���*/�t��e^T��p#G՘�J�֭��*.�����
-�<}�e�ɪ*�y��o���i��?4F�'�,�n�
䳭����:dV����X઴����ZQ;�C�o�rp���%�}3],fo
�Y
n���.��Y���U��w̧Y�i��W/u�-���p�k��ҷ�a��R���%hxq������a`�aL��7��7M�&4�n�
�����~��c�
2���ϾI���g���
)��$�MO7� �}�?�$�m��E��pD��m,��i��E��>`�_�U5��ɋ1��Mg��>]��=��YQ
�<�
i�b�F�Cw�GD����H�A���8�^���W %�(������VGpZ�����=�̷Q�Ն#�IӦz�W�M������P
%�i��a�0�ŦEZL;��$i���6�]H�A����e�G_��rV>�M�ⱜ/�*w\m�U.�'a
����8��܆uM��lw?Đ� &/�����l���p��a��aYR�Vކ�N�`��2������M���.�
a�
Ճ`��6�����@��nnjB�8&d���}�
-$��R
�IB>a
O��%�!�1�L�����2��U�c@�\��6����!3#"ʜ@���w�2tH׼w�Lj<ᆌ
a{�j�h���rCj
y����
ƚ
�
Q�]
x�l�K��;f�d�	��d�����t�/
x�uO�sF�bY���G܁bj�>A�e�K'H��އ0�ϸ�b��ԲcP
6i͎�U�]E"�[[O�*/��zV�k��çe�uu|�
t8�NV��U�YVt��b�
$Ʀ
�{ǃ,[+5�o�m�0�
�y�W��_F3Do�Œo:�l��s �
�pJ^+`��TF��[t9��H��@�SG��*�!H�0_����j�
At���/|�,j�lđ�%�6��5����uCáw{A�e.�v��ES��]&�M4���?SϞ?��n	����S
=�E��

-e&YL�H`��8E-�
E���Q��E��^t�����hӽx�u���#��2�bĹ�}PG���t숊�����Q�d[2��
�qi��&�
h�팴ьF�%��֌��ܥq���'�ՈK
�=��:�
W2,��V�9C�9=�c
LrW���AUV��V��}UG�aU��g�c~��#]� ;R�Q*
-��(� �Q��,�畗	v���a1�1N����F�-'	���/��Ej祙
�O�2�@M�η�[.*��2��ѕ�?��$`e�t%����;��Kd�m�LD����o��wP�a�6�����PsU��VU6�0
(���a|��NpmZ�v5/(\��m�O�"����)��y���Ek͋��9��Q�/�HfYg/��\�
�`
�H����́$`�����9����{�,A
-�+��!��\d�
-��'�n�����unK���]]�`4�1U7��)9Au�D��xWݼ*p�D������-:G��8����+X.��R��$?����v�6���˛��Av��iR�ծ�U����P�+���l�pm����6��r����*�$�1%����)���z@��i��	��e(:]/@�ە|��A�={y����
��-�&�R��%_j�(��JG?�MO::
K�'
lY�����p�3����;�<�`{��G�
�g<�Y��,2j�2�%6��D)'[�b����>$&cΝ9{��B13";VL�Q X1YB8JL~(�ŴSL�)�b�c���2D�-&K�
�R����K��)v'
#@��d�/6Z2�g�%5�%k��`�Z�����$�ђ%�
���*$xx�Ҿ��!*]�b���d�k����~q��ɮG��
fJ��h�a2����5�;b�9�0-��
-�ي˿7��y��+�AWdh��(}�|l ;U���2��Fûv�关���!�"��Il���$T�j�ɺ���e���2ݿ�m�����g���RJy���c.�(;����b��Kɛ�=��������������U����b�U��ٯ��-��C��W
'���Ǭ�I=����W�5�P����7^�jqs}��~^e�3��e?k�� �6[�Ss�k^6���
�]ʂ��a�Ҙ 	�V�L�gX>�
u-���M����?�,�[	�]��Z��,
-endstream
-endobj
-16885 0 obj <<
-/Type /Page
-/Contents 16886 0 R
-/Resources 16884 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16851 0 R
-/Annots [ 16859 0 R 16875 0 R 16876 0 R 16877 0 R 16878 0 R 16893 0 R 16879 0 R 16880 0 R 16881 0 R 16883 0 R ]
->> endobj
-16859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 686.204 362.353 698.537]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-16875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.526 551.871 335.736 562.775]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 486.366 362.353 498.7]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-16877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.631 363.989 359.783 374.893]
-/A << /S /GoTo /D (index_limited_extrapolation) >>
->> endobj
-16878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [491.531 363.989 513.996 374.893]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 352.034 128.077 362.938]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 274.176 362.353 286.509]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-16880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.644 139.843 376.001 150.747]
-/A << /S /GoTo /D (index_bounded_extrapolation) >>
->> endobj
-16881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 127.888 148.55 138.792]
-/A << /S /GoTo /D (index_H79_widening) >>
->> endobj
-16883 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16887 0 obj <<
-/D [16885 0 R /XYZ 89 770.89 null]
->> endobj
-16888 0 obj <<
-/D [16885 0 R /XYZ 90 657.82 null]
->> endobj
-16446 0 obj <<
-/D [16885 0 R /XYZ 90 611.195 null]
->> endobj
-16889 0 obj <<
-/D [16885 0 R /XYZ 90 606.711 null]
->> endobj
-16890 0 obj <<
-/D [16885 0 R /XYZ 90 535.98 null]
->> endobj
-16891 0 obj <<
-/D [16885 0 R /XYZ 90 457.983 null]
->> endobj
-16447 0 obj <<
-/D [16885 0 R /XYZ 90 423.313 null]
->> endobj
-16892 0 obj <<
-/D [16885 0 R /XYZ 90 418.829 null]
->> endobj
-16894 0 obj <<
-/D [16885 0 R /XYZ 90 336.143 null]
->> endobj
-16895 0 obj <<
-/D [16885 0 R /XYZ 90 245.792 null]
->> endobj
-16448 0 obj <<
-/D [16885 0 R /XYZ 90 199.167 null]
->> endobj
-16896 0 obj <<
-/D [16885 0 R /XYZ 90 194.683 null]
->> endobj
-16897 0 obj <<
-/D [16885 0 R /XYZ 90 111.997 null]
->> endobj
-16884 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16903 0 obj <<
-/Length 2567      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_��R3�;��S/��i������x�w�F"e��z��{p!EP�e%:�L�b �� 8�oe
=F8zw�绛�o��H*���(���	Z��c,8��x�MĤF$�0�v���ݽ����v�����
�O8"@ ������8�C�7F,�ѓ
��8e�\Fn�u��,	������N��It>"l$��V�
��e(!=L{bI�Ĉ�y��)R�����d��D$��kd��+��(�*��O�dJ���u��E�t�u�uV����	�K�����b�?�ܵ~�P�U��/3׳��*/
]�^��b��o@�חN(� �rP�?M��b��?`���*��p׉�wof
o7V
x{Zd�{K��峓ZF{��p�G�߿��>���<+��Oy��w¸����y�L���l�(���
�%���
-"��r���Ø�gW ���ASњFW-u�<����3w�o��2���|
:d#?�)�Q��/�/8��1���	P���'�#�i
D�O8�Xx�*�
�{-Bf��@��fS�oo�b��n�e>��V����*+��:O1G�1�	�����2����F�Hq��;��[T��KO�L� q�`6��-坉���7�����Dg
G�&͘z�oܘP +��j \
%��< A�
��8$-��<��$�3��T��}]��e��<͋Y�Z�un}��TV�	�0
؀�N����
kﮅ�N?�!Y����*�/ ��/�	�`
����Kj��#
z���L	�6~��M��,~oZi�J��.��Z[8��
-
�X'���B-U*����Ѹ\N��ټ�R~~(�(a2�����4����m_�	�L���M����c�;5�p��{�n�Ng����!%�(�
-	ɝ�m-s��6���ks��P'K{?�[��
6ʚ`�ڋ�.�A���$��v#|�B�S{N���u��:�$̓�;�ܐ�.��b�
	�)L��N	��d����tI�|���`���4�
Ef×KM�湄u�
.K.|�l�m�K��K��_��[*}r����z?S�f�	��(����;�)37/�\�]ݸ���Uf�0��a��K�Fa������m�(@ۤ:Q at x
?�D��&`Bw��T�z��Ej �]�bMi�aX��ҫ�|~V	v��/���/U��_V�q�'b�*�+PX�F͸��5*�%�T�X�u/��((�t.!�|xW�-��^|ʪj
��Ϫ�F�_S}�6xY��[}Q�L�Oj��04��Q��r<8�
7�
V �G��	|z2�O��A��t��#]܃� ԅh�AWf��5esW�r.u �8 at R��Jn
��o��]�S
c2�S���*Xrf=v��
�d. 8�q����j�F�aM]@���F����A�)_.ݠ{?�^���p$�c
e�Y�C���6�k��ܩ�U��j�0�����@����2
<~Z䳅���TK��4 W�N�3H��_L2����35��7u�r]&��
�\Wi^��a$4O���g�5}]������`M�'�}\4��Mo�hz�mE�<vQ�C;j�� ;�2,㷶(���@�M��̜o�d� �U�nZU�ro�
�nz�OQPF�[��
V��J�`( ��6������"Ŵuu�DĐl5
�vi� �ލry>��}�{7mh��mݗ�
�+綨��& �����6�eݐ�V�����a��"]ĩ-��Tu����/�t���|h
-Fل�]�G����Z>��'S�L�Qd��/��B���*.�
��x��n��5
��5t�	�89q㲻�?;1Ԍa��ù����R:�7
.
��)E��i�����I~� �%8�J��F�$Q��
�B���s�c߱��Br��OM쥲G��2��&�HĠ
�`�W�q	ҍrqc`�8��\Kō!���tO�c4
OFY��p����'i86�]X��`��<
(��~��pѵ���@r��('�S���C�2���e��\g��yz���i��W��@b&c�,�#ZF2,8zT��B�ġ <���R�A�.��(Mw�ʟ��]������$cj�ň/c�
�#$��#	$���Z�Lk_D1D �
��� ^����jʯ+���0v�
^����?c��e�.֟Ö� �G|�w�
s��#04�����1v�4�
Ov�
tY��!c
���g��q�7 �3v�m��ف
c���;�
4� 
cgd�?�ؙŸ;���xf���w��'c��A�����c���-�:�
��ܞA[��r{����t�=(��p{	e�r{�wUd��Q[nϼ7�0ܞ�b
��>7�����
#Q{�����̞����'����~b��)�+����Y����_��#����<��3)=0z>B��,�Z����~�����
�!�a�����c3�w��ۊE-l7����bp<��n
r$؟VY���^��ɪ?L��}=���p
Q`{�.ݩl�b;	���S�҇��]���V쿻�#��bC��Ǣ�׷�_�o7�עY��O]v�(XTˇ<4�ê������Uj�Կ�����p
-endstream
-endobj
-16902 0 obj <<
-/Type /Page
-/Contents 16903 0 R
-/Resources 16901 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16851 0 R
-/Annots [ 16882 0 R 16898 0 R 16899 0 R 16900 0 R ]
->> endobj
-16882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.673 686.204 362.353 698.537]
-/A << /S /GoTo /D (index_Widening_with_Tokens) >>
->> endobj
-16898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 445.031 379.76 457.365]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
->> endobj
-16899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 172.177 379.76 184.511]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
->> endobj
-16900 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16904 0 obj <<
-/D [16902 0 R /XYZ 89 770.89 null]
->> endobj
-16905 0 obj <<
-/D [16902 0 R /XYZ 90 657.82 null]
->> endobj
-16449 0 obj <<
-/D [16902 0 R /XYZ 90 611.195 null]
->> endobj
-16906 0 obj <<
-/D [16902 0 R /XYZ 90 606.711 null]
->> endobj
-16907 0 obj <<
-/D [16902 0 R /XYZ 90 535.98 null]
->> endobj
-16908 0 obj <<
-/D [16902 0 R /XYZ 90 482.291 null]
->> endobj
-16450 0 obj <<
-/D [16902 0 R /XYZ 90 338.341 null]
->> endobj
-16909 0 obj <<
-/D [16902 0 R /XYZ 90 333.858 null]
->> endobj
-16910 0 obj <<
-/D [16902 0 R /XYZ 90 263.127 null]
->> endobj
-16911 0 obj <<
-/D [16902 0 R /XYZ 90 209.438 null]
->> endobj
-16451 0 obj <<
-/D [16902 0 R /XYZ 90 77.486 null]
->> endobj
-16901 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F60 532 0 R /F90 758 0 R /F24 529 0 R /F75 554 0 R /F117 2446 0 R /F32 764 0 R /F7 795 0 R /F1 833 0 R /F8 794 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16921 0 obj <<
-/Length 2855      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�~���S"U�`� \�T���d��rf�}�l�h����H-I�W�>��A��lq+ɃG<�Fw����
=G8���7��4Ғ���)�8R\#!�n}��b:����~J�$)6��~J�$_�_�e�̿_=I���k?��x�g�x�uR���S���wi�H�.�RLg����������8NRq���|�GKx�]��q�jm"N����7���^(��0��Nj�B	A��$D
	���:�|����0�Ah�3BsH�;ʼn�ư>�'E:�
��<�$�:`�~�(hsJ��)��J�c��"��e���]ڐ�)��ww�<[$U���1{Lh$�(
2I��,`�j���e�x:�BN���2�t,x�J�^�G�j?	&0�P�'�q#Q�!1"R�#�=44�q3+pI��j[��(ۃg
c$�@&D�r_����
���$����
ј
f��+@���i=�zY�nL� ��cr�zn�j�~Y?}{}��
V����O=��
Q�.����$[��!Ň��=T҇����L�K} [�_ˇ�XB
b�����1�%
�n�c�܌���H�FeHi��	
�n��B��ѓ���'h
���4�:�
B.9�a4AZ�Y��K�|�"i���)5�"��ZT\�iB(�̐Q�{­NY-��`�9�d�Z�!"25y�mҬr
6� sc6�� ˜vEe

K�S����5�,���ȧTL^k��s]�R��׍�v�i
"��:��V�"�l!8=�Stz�� �5f9�A@�=�W�O�y%�8��q [...]
-��z�G$���_ŀ���
-4k_��d�_`��R3r]��,WB�n�B�N0��̻��c��2���:�X ��
`�4(����(B�5$\A�l�$b	�NX0I|\01v�`���������6_��K\���)�8LE����׾z�C4��z={
��s.y<�TH�2��HB
-i���f�l�WiP�UiJBnr�SM��V	$�r�9�z
-���@a� >�/־�
-0��R���"0��pS�E�º�S��68��!Y��Z�Õr�.V �����A�5�*�M�v�u4`q�R���i	�B�h�.���&��2[4dr� 	迥L�[�N������7:E
��Oҽ

�@��PdhB�	�õ��4F$��W2fA	�NU��Cc��f��}��������[�?�l�[�"/�����r�=7{]W����	걏�}8��\&�Z�\��a���:�-����<��y�`L��	�MB�����oIR���np�E�=�߀��&e�m@�(g]�t}_a�l?P2��@ ?��l?"�AvS�lbN�s�޽��s�.� >���ۤ0�t�4��@	���  �1���7d�d��@a����� ��o։��
-z�
�5P����W�<[q�5��B���t�bP=r�w]%� �$���RH�QX0���;,�P
$��1�7ѹ�����%-z��2K:ʼ�!�Eh�
*ôD1G\�QG� Lž[v\|ͨ$6"�T���oӾ�JB
�Ma�ٝ��>�3YBX��o�1��R�����iO=Dž���z�lUA}At�y�
-ޢ�u�pE]�h
-8�������I��
- ��hR9
~������$1�����O_� �������0�
-i��ɄY�jTb���r�b9:$e�"E��n�hZPʨ� �1�b-���Řq_>
,
S��vD}g_,�t�/bΠ/>4oE����l�r�=��"M���k�$��:��ى`���T�uoC��_�a��
b��n|
ͳpr-����TU�ٮ�����YG5*�]O>3��M:3�9K6��B�	�H�ɺ's	�KX�h���
V��q�-�&I�Ay"ESy��G2Г&��M�1uK�>Lm��#c�ĸ�ԡH@jH=
-@B+
r�B�>C��#Q/H��h{�l{L��DQ23z�)��B-)��I�K��
gZ�5�i� ���΃d�w
����8,�
�K&`� $\6~b���Y�)J���|���Ҕ-������b$�q�"ٖ���ݍ�x�lC�w<��8��MNo.o��.�뀴�Ik�d����&��9D��]��)Z�It
yA���`�i� SA�üc���
Wr���8i�
��v��=��۸CZB	fL~�C�,^���EM��K>h,��CMo4�wS<^
CMA��egax����C�`�c��Y�����mv��dm
W���ig%������f���K�,Q, at P	� 
C����Q}v�N����Wi�,e>�<����,�$�
���E��7��p�žo5��X�L"��EZ튺	�~�=����ȔMAo�
-��
ֳy�޻���;E�-�J�ԏm���
��܁�5a�k�w��ܝ��
-���t�M����߯M7՞VJ���H�� X,H��l��~{�.�^�t&��vw�'i�m���s�=˭iu�Y�L����.���iq��E�^[�����)/�s�e��Z��<��T2H�)�����7,5���]�2�é�V#L߯� s�"q����E�+Q�q�2}��6���
�*��~ì�Tv���j/�Q
���ϏwO�
o����s��|ut�"�~���㯁� }WC!��N�����]��L�ߚ��^�O�]�/
�ކ�a�W
��sZK��)����4x`�n7]k;��������"�3Z�c0ےlT5�S
D7y},x��Í=׈j�ߤ^L�4��N�̟!�cbv%͈��}Y���uâ?��C��Gd(�
-endstream
-endobj
-16920 0 obj <<
-/Type /Page
-/Contents 16921 0 R
-/Resources 16919 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16851 0 R
-/Annots [ 16912 0 R 16913 0 R 16914 0 R 16915 0 R 16916 0 R 16917 0 R 16918 0 R ]
->> endobj
-16912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.334 685.85 236.659 696.753]
-/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
->> endobj
-16913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 618.213 335.755 630.163]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
->> endobj
-16914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 508.329 243.45 522.276]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.415 456.07 485.603 468.587]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.376 238.917 385.519 249.821]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-16917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [114.11 75.416 174.682 82.942]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16918 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16922 0 obj <<
-/D [16920 0 R /XYZ 89 770.89 null]
->> endobj
-16923 0 obj <<
-/D [16920 0 R /XYZ 90 721.073 null]
->> endobj
-16924 0 obj <<
-/D [16920 0 R /XYZ 90 667.827 null]
->> endobj
-16452 0 obj <<
-/D [16920 0 R /XYZ 90 608.848 null]
->> endobj
-16925 0 obj <<
-/D [16920 0 R /XYZ 90 604.365 null]
->> endobj
-16926 0 obj <<
-/D [16920 0 R /XYZ 90 533.634 null]
->> endobj
-16927 0 obj <<
-/D [16920 0 R /XYZ 90 479.945 null]
->> endobj
-16453 0 obj <<
-/D [16920 0 R /XYZ 90 433.32 null]
->> endobj
-16928 0 obj <<
-/D [16920 0 R /XYZ 90 428.837 null]
->> endobj
-16929 0 obj <<
-/D [16920 0 R /XYZ 90 344.865 null]
->> endobj
-15873 0 obj <<
-/D [16920 0 R /XYZ 90 310.195 null]
->> endobj
-16930 0 obj <<
-/D [16920 0 R /XYZ 90 305.712 null]
->> endobj
-16931 0 obj <<
-/D [16920 0 R /XYZ 90 223.026 null]
->> endobj
-16919 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F24 529 0 R /F75 554 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16943 0 obj <<
-/Length 3271      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���S*MWX�/�Lg�4�$M�m���&�%�VV"R�&�� o�@J��Ƀ-� ���
³������w7o�Tlf��T��
g�7HH���}�
�?�}=cR#b$��n��o����
������CxF<����v7~ij5��z�3z��=��q��s;{����E�
/� B��Ez8Y�X����_�_7����eA�<�
�����
�m�=���=�|��M�叽�}R
6��y<f��&��bI��
<2 )���8��<�o��z����G�������KX��z?=<�k�P����d�M�{v��s���U��R�6�o󉘆ݠ��_<������[�DF��E"XΖ�!��g�!Ϸ�
�K���K��j�ꄝ�]|g���7�4+A�����i������n|�����{�'��x�T��s-uK�r+���3�c�h�y($tE����7�}�Hĉ��1��a�h��
#��
#
�~_�e�
�^ۑZ���$[�&e)Ij�#�j$���cG�~��qɐ�
 l"s��� {�Ͽz����b!Y�l��0���
�����
6&�1�YX�R�Q�a%{L�p�
�� z4�J��qf B!�M_IYn�9 �����8�=`�)���z�F�bv��G�1��q)
lռ��t
��ɀ6��`c� ��Ǭ�T��>H
-n�>`��jXG#1 
-4\<&�2&F�je5 ���z�Az�u�Az���>��Q�Qi�0��<
��
�� xZ����sZ�qKbƌ�ֈ+,UT^�^4�]y����/
��tu�
���'�j(�Vۼ�dO�W�����t]Xol�~)	,M!I���=W 0z�
�um8�θ��,�'7+�[�m5�6 ���j�,�f�e�늛�4��)��
�+����/�}
-/�
 ��b��0��0>�>��iĤ
-��ܧ����*9
o8�}�����U��VA�
&�|La����	<2+ĕ�$��A`� ���q|�o��K1g�%�.9
5�f���
	3pRd�iBNj<
��%e��q�n��
�
B�N�",P� %'a�R�{=��<	���v{���L��ަ�ί�
-�C�J6����4d�[��L��I�L� ���]0%i�m���x�X�/
E�$��Tw
p|�q;��W
��o"��
T��ڎd��&,�O"
�-K;�H�� aX����H�P�CC���H��D$1��������U�w`Ń@��}����<[��

J�!$4��%)"
���02Hj�p�%H��uCtm�O�ia
���I�NG��
�g��=Ϥ��&�]��/E�̌��ƨ�Y�-"���
)�?8�*��aY���k�UF-�6��8��6����^?�P
Cƶ݀#M�_��ܐ�b��z$m�<��MM�k����i4O���
�+�(�
|;�x��"�x].�ˎ���ѴҖ2�K+�kt�"�x
��$9�R�^J0�Ƨ��6�
�@��TU����U��a����m�I���x����4�qQ�
�6�$}������M8�X�4�t�8n��"�,�i��a}{
i
XN���=�
-��OG@�ø�S�]�6�:a9�>��P�8"�,4,|`��X�λ�"�n�S�3�i&����3_;��Z�Cߗ����"	??� �иa� �
-�I�mz��ޘ�.]>e��P5�
-[{?]a>>�]�:;�w���x�:A��3+%��ֹM����}Z
�fq�U�aҨm�'�ڈ����4f��0|BJ�va�=+�>ϵh�R�RG���M�ߘl�>-�q��_Wɱ���V
�+�9<�[�}<c���3e�*ze�,�դ>~q�|;=/7�}C���Jh	�j���C�Wh� JX�|�����
-��ި��K^�u%��k"oK	�żd��
l!:Z��͞<�`մZ������Z ��X��s���`�

��	5��i0^���Ȝ���I��J�n+��n�V�&����F�62�S
��İ�Rή�Q�8"D!��m��L�li
��
�0�
��C�R���������7=Zu��õ%
�~q��߁\��ǀę�\���8����4��g`��y�+�޴Ͷ�3�.��
����A�hk�C��y�zDzp�z(=��z�Og	��sv~As�B ������(�i����
�w���oQ`�8RB��Zܘ)X�-
-�u��E-�Gw��5(�/�L�
�pMd��P�B�n*9ɴ�)�ièM�Œ+ٞ.� c:ڭ(���gK��%�s�p�,�o 	��u��us���u7 T��^�8�-
��2�+�Xi.ok�|ĞV�5������6[=����	0�Mץ=�=	���^F!�Rj�
Rr��
�?P�J�HJ',�MN�e�T(���D

�0H��m��\���Z����W2�&�4��2=4E����{P�5�~��?��b��f�@����N��E7�p �F�)Uxj�^�D	�\���4��s^�k�_0���W�W�.wm��i�-ȼ��W�N��*mж���,�U?��([�){���MV�m��c��UӪ�cϧt��?鲩��U�JpX〢�S��K	^ׄ!F���'l�X���M�߁��kȲ%�zml�t(���[5alV��tM�	�Yp{
}Y7XgP��m&H:=M[x]�La
����&[�= �?��I��ՋVA�<cӹ�/L��Z�y��[�4;$��=؄
K_ɡ
;P
��";$����B<&�Axx.&#�%���o۲�O.�I�=N4,�n��:lN��u˸���b=����H_N3Z�&X`���=�n��W��|	��&ހ��.�}���J�,rs��h��T�X�� ĵů�"7��z�Q�@�ma2�|�n �n��
�F����t8��tS-4����-�p J�sdeU�X�

-���]�j��6�
��0��W<O<��
���Qn��o��y���
 ���EO� ����d������b���'�ɤ�EZ
��K��2T_����{�s��@
���~�pA;���>�	l Ø��ʔ�x.����u�&M?U% ^WWurD�����ui��.�)hpR�>7�3L��r�H�[���
��T7�~�c��@�%�z˖`�h4�\r_Z'r�zҰ����7��eZ�i!ļ��'��<���]�u/ھ�-tVq����[��dž��Nz��������۷ǧ2͞č����e�W�����$�./�Z[��.Hi�[	[��)��
-endstream
-endobj
-16942 0 obj <<
-/Type /Page
-/Contents 16943 0 R
-/Resources 16941 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16851 0 R
-/Annots [ 16932 0 R 16933 0 R 16934 0 R 16935 0 R 16936 0 R 16937 0 R 16938 0 R 16951 0 R 16939 0 R 16940 0 R ]
->> endobj
-16932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.953 673.483 216.525 681.009]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.27 673.483 291.843 681.009]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-16934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 583.353 239.856 594.257]
-/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
->> endobj
-16935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 395.635 379.76 407.969]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
->> endobj
-16936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.144 353.538 182.164 364.442]
-/A << /S /GoTo /D (index_expand_space_dimension) >>
->> endobj
-16937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 256.172 243.45 270.119]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [514.03 179.604 535.938 192.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 166.219 226.824 178.552]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-16939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.397 80.973 362.844 92.041]
-/A << /S /GoTo /D (index_fold_space_dimensions) >>
->> endobj
-16940 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16944 0 obj <<
-/D [16942 0 R /XYZ 89 770.89 null]
->> endobj
-16454 0 obj <<
-/D [16942 0 R /XYZ 244.439 586.506 null]
->> endobj
-16945 0 obj <<
-/D [16942 0 R /XYZ 90 579.866 null]
->> endobj
-16946 0 obj <<
-/D [16942 0 R /XYZ 90 511.292 null]
->> endobj
-16947 0 obj <<
-/D [16942 0 R /XYZ 90 445.249 null]
->> endobj
-16455 0 obj <<
-/D [16942 0 R /XYZ 400.69 356.691 null]
->> endobj
-16948 0 obj <<
-/D [16942 0 R /XYZ 90 350.051 null]
->> endobj
-16949 0 obj <<
-/D [16942 0 R /XYZ 90 281.477 null]
->> endobj
-16950 0 obj <<
-/D [16942 0 R /XYZ 90 203.479 null]
->> endobj
-16456 0 obj <<
-/D [16942 0 R /XYZ 487.765 84.126 null]
->> endobj
-16952 0 obj <<
-/D [16942 0 R /XYZ 90 77.486 null]
->> endobj
-16941 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F90 758 0 R /F117 2446 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16957 0 obj <<
-/Length 3185      
-/Filter /FlateDecode
->>
-stream
-x��[k���>�ŸZXs�&5H
-�i��t�N����6hl�X�-9����_�ˇdѦ3V�4�tyyy�
r1�b�8����+ln���۫�o%(�T�nF	
)� !���Ø`��dJ0��	��Z�w7����i�ͫ��]~_����u���qYL�T���˴����CfˊYr�b,���r���7�W�]�
���D �G��Շ_�h����D�>ٗV#N\���W������@F85B!��!�����8�|\�sP�j�,�e&����'V��1�(Jt�i���0C���L+N;�k@�@|��a���p|����
�%
���z}��W��Q��b��*�@����)]���ب��4AZ(��-����`,C�~��!���FD&�O	�Z�/�jī&�KM��}�C^,�"�Ś�
��od_�q���`ƈ`�|�Ɇ�vc����5�m�,�����f�{A��T� Ҿ�)o.|�ޚ�%�R#�����%�[
4�2��v%��h�u�Lȳf����H��z����Gf��k�����UV�yYL�bV��i��/3�:B��a���)�qp�)��sc}�y��]��]����ͦR$=�Nm��۔����H��$gH�����J I�b	\ɮH�]O�}N8�X�B�l�Г�R
—"̌�(|Nj���y1�P=�e>������q�и;� s�!V��)�aLw�����M5

���3�]T儊�'���C,
���.�>���A�1�|6%$���)��� X_�n�#DBE
6�.�y
I� �j�#��Q^4�F��Јrf?��2,$A��
�i4�$���A‘�2��
8F1
�e
-�Ҏ
-g!�EZ/"�
<\È�� ��ҡj�r���4!� �lu��#N��5�R�X�Ǭ�T�o-Rwatz�7�����y=�"p��X��Љ��l1�0�a�
\��gԷ�
� B��@����Y��U�D��>�����]c�0�������#�`�N���,ݝY5�WΣ��"/�+@�w���8��(-0~�eC��+*~�Wd�����^Q"��E��+j����t���@��r��[���^ɇЎ1�����*�

-��
�&
�SI0fᚣ�!�ASI��pL��٣Y�����)�1�
-< ���k	�
�~�9��S����N
-������YI����:�ա|���h��:_
�
�0Ps9��yv	����4�a�w;����`����k����s�<�9�,6%0�&>�_�)��"d�v��9lD�҇uU6٬��Nj05tU[��OAe]�~�|�䏋&+b�����a�	�:A�~�yU��y�h�b.����=�'2�ia�������>��e5ϋ����+�i-2/w�μ��}��Ʉ��=+�*��e1w��F%��	RT?����V���d�E�` h.��}0��H4S��U�斌O0Q��
~�+�[ӽ�����%�Ra��o

-
�FHP\�K�DTv
k>���MF$���i�%	�0X�Ϳ
\�RnC�YU��6��V\DŠ�<pa����'
�����6Ȧ;�w�hR�枏("A��K5LPA��X��j��O ����찧�D�Ő�3�D;���<?�g�r�� �&���U�-�'��"������v�]d�~�W�mG�"n����-�s�0]>����7���\{�{Hd�
�c/�x&���1�
-���+? ҉V����HX��3����y�,��V�m�s�>E�sݘ���q%c��}�S��|͊gǨU
-�*�
A� ��_�m�k!�.ϰEP_���������7�~{�s�/��W�gu�`yƔ�m ���j�E7�"u�a at oH@��K�_D`�Bj��4O�HW�����qt�mh��X\��q�Q�%�ߔ��7n|["�
��?A�fA��3�� *�N0
���x�mx����n���6�
�����?�Q����!�č�P�)��pYY���{��B@�L]+`�J���
"GJs�1����=3�4���PTpD���˼X�57���а�i�@�ЁJ!��Zr
�ꜲZ��q
O3�"���+��:߽1i���m�'�6�_�Zr�b�K6.P�!��F�2"�l�z,;Y��
�|d�����%�o���2ѫ��Zd�)=���4g
`ũB"�і�
��VK�JE�nS�-���D1�Z�8���n�f9_����K�-�q��x�
�5'w&�����oOC,"��jx[����h �\j�[�S2�Cq���3����"���)�l�,��ᐢ�`�Hv�	F�� [...]
-f'oS��јަ��޶�ZHm�j�iݵW�1�Ut��o�|�kw	Wϡ� 
����'lH�lp����
Z)*!΄��@
۞U�9�D��ц?��7���Nº����L�ܯv��cv�RUe�x�X8��}_n�yZ���)ݵ���`
��W�޹�
� C6�������Y�9VB����߆,�
�L���f>�LA�8$�5�D��Ԝ�#Ð\��<�&�T��w]e?��/S(��}����M�)M�z��%�S�
��q��]��{l�qg|���9�}���3�qh���93���F&,�bȨ{4bO<v��/^�N����T�[���ꦬv����|��^iI�
�w^*qߪ 
�¬#�-��uo�_��W����9�[°
w7U�Z��l�7m�=������]	�I���Y���n���oۂة
M9f�ry<��|���)�^)�/lɊ���
I���>O���Uڞ�H )f�ܔ[����)v
��!���*K����a
-��V�A
�skrܚ
�.R�z�~� n�m݁ox�.��Ƣ�)o&����6�{+>�f:X��8e��}
��fӱ�
k�YZ�Z�Yw��.-��7�
^���a�2@k�f���^���Y��8�6����Shcع���
HC
H���@�l(�ܼs7��?N���--6mOc�4�
-mK/A�����v?�)�먽�ە���*Dp$Dײ/�f}�����ΊG����� �:v{�f_���y�`�l��=u��1AR��`�����({"��������oWl�
�������C
-endstream
-endobj
-16956 0 obj <<
-/Type /Page
-/Contents 16957 0 R
-/Resources 16955 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16966 0 R
-/Annots [ 16954 0 R ]
->> endobj
-16954 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16958 0 obj <<
-/D [16956 0 R /XYZ 89 770.89 null]
->> endobj
-16959 0 obj <<
-/D [16956 0 R /XYZ 90 667.827 null]
->> endobj
-16518 0 obj <<
-/D [16956 0 R /XYZ 90 633.157 null]
->> endobj
-16960 0 obj <<
-/D [16956 0 R /XYZ 90 628.674 null]
->> endobj
-16526 0 obj <<
-/D [16956 0 R /XYZ 431.18 571.317 null]
->> endobj
-16961 0 obj <<
-/D [16956 0 R /XYZ 90 565.3 null]
->> endobj
-16962 0 obj <<
-/D [16956 0 R /XYZ 90 484.148 null]
->> endobj
-16571 0 obj <<
-/D [16956 0 R /XYZ 90 371.256 null]
->> endobj
-16963 0 obj <<
-/D [16956 0 R /XYZ 90 366.773 null]
->> endobj
-16964 0 obj <<
-/D [16956 0 R /XYZ 90 274.289 null]
->> endobj
-16572 0 obj <<
-/D [16956 0 R /XYZ 399.318 84.126 null]
->> endobj
-16965 0 obj <<
-/D [16956 0 R /XYZ 90 77.486 null]
->> endobj
-16955 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F11 613 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16970 0 obj <<
-/Length 3280      
-/Filter /FlateDecode
->>
-stream
-x��[Ys�6~��P�!+UY��Mm��pv�9f3N��$�%�bE����o7 
���'�n�A�5���|
Q���a@���
������ūk-	I"

n�	
h��������藛o"�	K"��y������������W7�]0��������Ż_�`
-o�$
<�A���^烷����fF#��k�a���(�9$JFcF)
V�b5O�
Uyu
�گ�@�Y��gv�'\-�z@��ʖ�"�����7ύ������>9I�1�Y\H�X��v]�����_�K����e���q<|?bj�Οk(l����PHN�������8sXl�	o���Z�αX�#ޏ�
����K���I&�هEuL�gћ���b>bl�4˦eH��~4P�|
�����������x�Xp�JG�1�K�
-�jvbyu5)���{���U �,&��A�$D(ynQ3��(VkV�9yB".{�Sp1�ϙ�/<ઁ��'�(8j��� G���3܄�2[�sX}�៩�����6d]Y���&
}�/����
q��rp)�oj+~yѧt�lx`�u�aK$D
���D_d(
-J\�
�d�\�-�
���'h#���q�a�B�1�ar��B
-ݤŏ
-�,i� @��!��7��Z���/�V�
1��M�
�'�5�v���n���l�ؽ�
�<����ٟ�kL��k��& ��Du�Q�2`�T�(u��x�AD�^�|�bA�8���p�ͼ
-�9�
�Ϝ��3h,TLb�
t߭���'���M1o|�2 J�lɻUYT٤ʦFXSԽ���R�J"�
�9TC4���G6_�!8�7�Ie����cf+:\��"�u@�Q"⡅�&���Y��lR�R����T>8D�����Q����n6&� �Q�U)��Z�wOւ%��y��|�`?�fn�i�,#�#uy�ɘH��g��\����a�#
���e���Ow��݂�XRH�6K�8jJS
Ah�;�}�ۯ�R���~��m�F��W�����W"
B��� ���R)
$a[Rmp���"�DB����Kȇ7����
��볮7�q<�_���X)�'�qb��=�|m?z̫�}��RQ@�1� ��
-n��r��y�5�y��'#P̀��n�zVl�S�]�1��o���6.
���޾�K��Z��I�Ng�����>+�����M|.��ye�!��!��
u{�TS[�
�k�핻�J>�N��
���=�X����J���xZǹ�NF��K4Ȅ*R��n�
����P��<��۬
f�
�@�W��=�:��
�
-�D��)"zO^����B'}��o��p��\��F�
��ׇ�r$�bb�<u�X����T5����E�
Kg������iI���;�J|��(
���:���D";�.��?@���G�.,��Y��M�����p�V�5b��"�d��J�R���.j}�w���`?����7��pE��4�&�|�,_g��N����HB`�o�X�M��؅83t���kX�b
��9ܞG�.@:5�9Ӧ��{*h�:ڧ�5��bE��S}��(��w��k��S�$�{0�&�=�^����c�=~G�X�	���%��aƸ�)
a�Mya��܎/����ⵥ#
a����]�H$��E�R���[�a�X��t��J
�<��W�.��GZ�D�XjMd����Q��
-��M*H+��0V�b{)[q/a,�>�0m��(�X��1ld��Vy�0�l
�yo��S��(;�2f��E�2����`v�(������O�l��AcE�C�ǝ����~��

�YK�Aw$KQ�p�7/׏�`�/d�>���ܛwK�ŷ�\M(m��{�� kE/�bSE@��5v��
-78��9��)� �d}
I�/S8��)	Q켈Ĝv���:/�?�|��x3��1��Ƽ�i �$�� �	K~瞁��A�]�a��
�.X�-�@8��KZg)d�<%�w:��m���-��(P�ڔ�]�u0<�@��g�@�Ɂ�]��5
�T(�n]���
��W`7v@��u�h�[�E�b��o�
�F�#���u�u
���x�.a vuy[Yۃ`�
���,2�K��a��a��
���0+�C�̊M-;+��d�w�DR(�{^�-���IOa�
gKdV����x��*
O���i�aW� 
�%�c]޺������
��1���Ӎߍ�}�g�������<&2 (J
+��q����)�cW� 
g�����ɖ��G}��o���8�z9�Qm�

��Vq�<8����	C������#���v�e���
�����F��>Tȡ�Մ�P��A��q	�pF]F��ޠ4I����n8h���r���>�bB���w�R�%L�E�m�/^��/+O���NA�u����W
8^ڮ�"?�����
sy���Y���nݙ�a
\:	�+
lj{�G
\��a�]4��(
-���F5��k��}ϒe����83��
I���
M 
�d'
��1rH���u����{A�k�%(k������S��c�W�?��l���b���dey��ܠ� �`*�MK��x]M���uUf��J�Ծ���t�[TB7�F>
�!�Dq���֦���Gx�n�:صbD�c�VT5��͈C���޷���26��5���YH;ir�~bL at Z���K���Ids��3����j����z㔲�4,�6�t3��e^�$$޷2�B�
��M:��6�|�A�T���x{-|Q���*�^'�l[���XQ6�O��, P�ۋT����2�l
R��1{��Vt�ĆNp�XUOv•CR��k0�"d���܄L�P�;�p%!a	��p��Dž���� �Ov� �Cix�J��f�c�4m�\g�î��n4�|��~ZW��~d4�g���c�|0�02/1҇~I!�|���gi`rH�c���; �1���j�r��K֨hK�G˺��GV��e��tA�so�G�|r�40�E���&��kl�<�+����σ\���G�qB [...]
-��/��}4waV�ۏ؇n?�!�V�&A�T	H�P�e�m
����x��_�w{n���P��TP�x�_��|Xǽ���B
�, at X+n
�ƭ��P�P�W�a�bF���'���޼��>���ʿ`Nsn�]�4�
-��-��0�P�X
;�6���[�~m���ِ�>
-rw�gU��z��n� ���i�9��/'��v��
�-,������\Pj{��V����?
-endstream
-endobj
-16969 0 obj <<
-/Type /Page
-/Contents 16970 0 R
-/Resources 16968 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16966 0 R
-/Annots [ 16953 0 R 16967 0 R ]
->> endobj
-16953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.602 649.984 354.851 660.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
->> endobj
-16967 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-16971 0 obj <<
-/D [16969 0 R /XYZ 89 770.89 null]
->> endobj
-16972 0 obj <<
-/D [16969 0 R /XYZ 90 624.195 null]
->> endobj
-16573 0 obj <<
-/D [16969 0 R /XYZ 277.933 523.283 null]
->> endobj
-16973 0 obj <<
-/D [16969 0 R /XYZ 90 516.643 null]
->> endobj
-16974 0 obj <<
-/D [16969 0 R /XYZ 90 412.204 null]
->> endobj
-16975 0 obj <<
-/D [16969 0 R /XYZ 90 235.331 null]
->> endobj
-16574 0 obj <<
-/D [16969 0 R /XYZ 90 209.424 null]
->> endobj
-16976 0 obj <<
-/D [16969 0 R /XYZ 90 209.424 null]
->> endobj
-16575 0 obj <<
-/D [16969 0 R /XYZ 264.215 128.341 null]
->> endobj
-16977 0 obj <<
-/D [16969 0 R /XYZ 90 121.701 null]
->> endobj
-16576 0 obj <<
-/D [16969 0 R /XYZ 90 81.969 null]
->> endobj
-16978 0 obj <<
-/D [16969 0 R /XYZ 90 77.486 null]
->> endobj
-16968 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-16999 0 obj <<
-/Length 1840      
-/Filter /FlateDecode
->>
-stream
-x��Ymo�6��_�a@'5�W�퀭]�u퐦٧�d�N�ɒ+�M��wE�Y���)����u�;>���֥����	VCx�z69:������u��ly<@
_�un�|�L	��>q��|^�8�Y���Q
^���y�og3=�V]˼�������1!
�$`��
v��?�Kz*���f��!r�F��E<K¢p�T`��	�-W�$,��9�K�;ķe��)OPn
�)����&�'�`�h����b59���_�GY�[�բ��)�gb������+W����	A`Y�i�82ޞgY*R���2�,�T�~�v�\��"K�r�~�0f
�=.ej��oz�PEx�G��^g��H����`keܤ
��������s��¾k�I���@[���R%zW���ѱ�;e�#��g������i1�c���-�ԋzB��8&fQ��X
�H�4�����B�B�1��|q�q�;�
-��7p�
!y
P�U=(�U=Z�Ǜ�H����{(`

r!<*	e*&� ",G4�k��7+���<X�߬��U��:�+݈]f`Mv���i��(��8�W2-�,���"[��2�'�g��
"�p;NkqWYQ[�
Y<�1ډ���
-;L
Hz� Y�	
-D��e�c�b1�	���üB���x���3�%�Pn8���Y?܁�<���AXវ�>$���X�6����Xp��>J��NX�Ai�L�>a��|ſ����ʽ
�>��j	�t%j�e��ő���!ľ�
��偀"�~��c������ 
8*���G���W�'^-_�h��-uܝ��0���
�����t�h�|��k�U�Y����:yY�)�<[
R�e�$�b��8��So1����tVWg�DT C�J��T�W�O o�N���M��s/Z�n�2����g�U?��D����w1�Fd_�ɐ��4eeG28�#P�)�+FW��4���@���,*P���WA�	��oW��OŸ��&v�.��#	8�4
�p0t
�2@��!�vP˙��N� fN���l�*,��8�L�
���� ���I�1��!�,��0�P?�p�N�v��>8p��Ą�*�u]5�^�/�~�K>�Dr��"򂡛{��?yC'mD
�0�|W�<}��qB�₰:�:����I���v-���2��&�)��?�K�:S�K}�\��E��{��1�/Oj�*~��:�Nw��������������u��+o�MC�ƢQ���F!�t]^�wQ �$�U.]	�%�
7d]�2wCM��~
G����
&�l+�z�n�;��6颬��L
q��p������ڊD�!��I�52���A��"����}~;��`�.n)ܯ޿b8�m�?�������Ì�l�w�
n��s�zF�o�����>X�gحQ�����j�
TcFm����M<��^�M�֛8)M��paCy'��f�-�mcp����C���'��
W%�_!rFhm
?���tۛ2�������X�#Pkq����*���4��P��t��K�f�	C\�y��lԙ*
N��]�&��b�
-C�`�'���e�I��x��T�@T
.�yV��
5�O٦��;�#�:��4�mQʕӘ�
-���@�!�vW����C*:�)y�7�͞h8 ���>��,[ow��Jb��5��\��D?
E;����.#��?��
�j]"�׆nC~''/���B�?9B�5�_���$_JkC�M5J�@���4٦V�_ˌ��T�c�
-
�*�f���\ώ���B��hѐh�|:v �yMa�T�����&WU;	������	A�'���Y1�.�u��K�a=q�NJY�3p��F�� �l
�
-endstream
-endobj
-16998 0 obj <<
-/Type /Page
-/Contents 16999 0 R
-/Resources 16997 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16966 0 R
-/Annots [ 16979 0 R 16980 0 R 16981 0 R 16982 0 R 16983 0 R 16984 0 R 16985 0 R 16986 0 R 16987 0 R 16988 0 R 16989 0 R 16990 0 R 16991 0 R 16992 0 R 16993 0 R 16994 0 R 16996 0 R ]
->> endobj
-16979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 348.037 164.319 358.941]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
->> endobj
-16980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.056 348.037 205.82 358.941]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-16981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.181 333.483 391.739 343.389]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-16982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 296.365 164.319 307.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
->> endobj
-16983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.056 296.365 231.833 307.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
->> endobj
-16984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.435 281.811 345.993 291.717]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-16985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 257.625 154.914 267.552]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-16986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.651 257.625 229.76 267.552]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) >>
->> endobj
-16987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.817 242.094 323.613 252]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-16988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 217.908 180.926 227.835]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
->> endobj
-16989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.664 217.908 281.785 227.835]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) >>
->> endobj
-16990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.817 202.377 347.024 212.283]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
->> endobj
-16991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 125.978 163.361 136.508]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a900663a0e97525c064ccf31152fa8ae7) >>
->> endobj
-16992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 99.969 163.361 110.873]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a1c71c9b7d1de1b77eeb054e1c0ac935e) >>
->> endobj
-16993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.698 99.969 228.964 110.873]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-16994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.707 163.361 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_af60bb41867a12ce28144596e3cc1406a) >>
->> endobj
-16996 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17000 0 obj <<
-/D [16998 0 R /XYZ 89 770.89 null]
->> endobj
-16577 0 obj <<
-/D [16998 0 R /XYZ 170.288 659.423 null]
->> endobj
-17001 0 obj <<
-/D [16998 0 R /XYZ 90 654.786 null]
->> endobj
-17002 0 obj <<
-/D [16998 0 R /XYZ 90 580.991 null]
->> endobj
-17003 0 obj <<
-/D [16998 0 R /XYZ 90 556.941 null]
->> endobj
-1954 0 obj <<
-/D [16998 0 R /XYZ 90 484.119 null]
->> endobj
-466 0 obj <<
-/D [16998 0 R /XYZ 90 477.312 null]
->> endobj
-17004 0 obj <<
-/D [16998 0 R /XYZ 90 376.922 null]
->> endobj
-17005 0 obj <<
-/D [16998 0 R /XYZ 90 337.468 null]
->> endobj
-17006 0 obj <<
-/D [16998 0 R /XYZ 90 285.796 null]
->> endobj
-17007 0 obj <<
-/D [16998 0 R /XYZ 90 246.079 null]
->> endobj
-17008 0 obj <<
-/D [16998 0 R /XYZ 90 166.249 null]
->> endobj
-17009 0 obj <<
-/D [16998 0 R /XYZ 90 142.519 null]
->> endobj
-17010 0 obj <<
-/D [16998 0 R /XYZ 90 115.169 null]
->> endobj
-17011 0 obj <<
-/D [16998 0 R /XYZ 90 89.534 null]
->> endobj
-16997 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F22 2996 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17053 0 obj <<
-/Length 2095      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~ׯ�SV��08	rSyI&N岽�쓝RqDh�D"e������
���5���"q4����4�
h��軛��
-���!��E�@˘�~��۱��䏛�F��!������懗7o��臛ч�G4`nEt�W��� ��?��8
->�N�@r�e�f����V�X�J��IJ845c�1'�O
��c��S�kQSס3�&!o:d�d�
�E��EU����	��m�L}��]��'��0:.�5/�*��,�s��|�;$ӒDB�O���d*`��Z"T�k�պ�
���n�OYi&L�,h�Z�W/Bڲ��3g�)(6��-��s��컹��
��5ODd����
-��Y
,#���b��G��Ko��QE��Ĩ7��YH$3e�Da즿6e��Ϋ�XO�i:����И�NB"�'�ofu
ڵ2����*+�����u�/k�V��b�3�k�S���۶w_��i��)���BK��y at g�"x����7��jj�Q��2��� h��1�����t���Κ��HY]bM�I(Yל��j���C��^�������
�2�8 �m� y�G0��$����g�ٵ�Eh>n��?}�H�둻
���N�Fa��H��A��Dȁt���UbU"��mtshv%	S�n4��
4B*���Л������S��Lp)��nZ�~�9�GE�����
-^�wK����+�Ԍ�.�~|�(5�,5)��t|� rT�	����U�������g}@]�
|��������5ll�����;b9�i�Q�E]4���6��x��t�^�^r��n7�
HY��rWVf��}�0��ﶙ=6kw)aQ+7h�k�"����X����Z��k,:�\J��0'�+���1�I�Z�Z:�	�sx� �'\�A�sW��-o-��{UڶYN��#^h�Y��P�0�
>�]���'�B�9�	�����D
͓A��/�8
��\�U�����fV����(+lQ%˙���]e��l��YZ��2h���Q=�Zi�Fa�>�~��!��@�A�p>߮3�֣���5S��RF����) (�d$
\�#X��]�M�l@�֏@��ͿJ�]�
�w@X�����R��PQ��/njhǺ�,+���T>f}�@�`�>���o�X��Uv3GX�g,0����&K��8/�m�TY���I���^�"�
��:����`vuv�g��2��]�]g�8c9He�і�Yz������n�m�1�vn����� Mw̱�HP�5�k�~b,��Gb������s��jx�6��������y� ��J���E
.�dP���U�w�J���z�ʢ�TR
T`��4��x.�e���!)�J�˅
�a׏"Gpg��3F����v�ߚx
��3�wY�gK�!V��|Y�C�)+U]V���l9e<�m9܎�͋���}�! Z>w��H�{l&�A2����E�ӭs�n���(�d�

-�^��V1��Q!�;Pи7 ���J�/�����UC��Q�K�0<\ر�͇:M���WC�ܹHc	�

�u�
бO{��RD��uRVS��#gx
-&����(��������@B�i��(��h����SPl�H#��G�w�9���
�B�٫;�`]���$=r������NS����ߓ�
6j�Iq�s(^�s�ܘ#��X�R���:��/Y��T������B�#����
��͓��T䑥"�=(q��L�OL��"&���ī%&L�L,#�V��B
{G2Q1T"[���
#A���"^��(^��~G���Fe���fQ�!fe�l|�zV�_8�5X~�jt�Y8<�o��t-�YN�V�
#�a`T[I{N�vf��#���I�޷G<�~��o<�>�
y��	���n�ulV1�,��<^���2�,�|���G��Q�
��/I�Y��ӟӸ�Iw�*��+��ӅX��K?�k
����~��aD��~�Zm��
�o\���u���|����㼰�Y[Ĉ��>V�7�WO�u���f�R�9���/�PA5R��\F�{_g��{c�3.'�_�ؿ�Y�jˣ$Q�w�j�﫫��]i�;2�
�m&��X�GЫb�
��͕=r&}�����
-endstream
-endobj
-17052 0 obj <<
-/Type /Page
-/Contents 17053 0 R
-/Resources 17051 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16966 0 R
-/Annots [ 16995 0 R 17014 0 R 17015 0 R 17016 0 R 17017 0 R 17018 0 R 17019 0 R 17020 0 R 17021 0 R 17022 0 R 17023 0 R 17024 0 R 17025 0 R 17026 0 R 17027 0 R 17028 0 R 17029 0 R 17030 0 R 17031 0 R 17032 0 R 17033 0 R 17034 0 R 17035 0 R 17036 0 R 17037 0 R 17038 0 R 17039 0 R 17040 0 R 17041 0 R 17042 0 R 17050 0 R ]
->> endobj
-16995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.454 171.11 706.984]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ac3283cf8fd0dd8ff2a319cba1dead1f2) >>
->> endobj
-17014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 634.055 215.923 644.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a411d42e5b59a492742793834efeeabc1) >>
->> endobj
-17015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.26 634.055 281.526 644.959]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 597.35 171.65 608.254]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a66e3e2f2433738665eb748d2f6c5878f) >>
->> endobj
-17017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 561.018 187.151 571.549]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ae006881831b298f0af5031e99df2bc6f) >>
->> endobj
-17018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 523.94 202.902 534.843]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 523.94 300.037 534.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5a36a32ab46d46f574f3091e931e2bd2) >>
->> endobj
-17020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 498.193 202.902 509.097]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.4 498.193 314.263 509.097]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_acdc1e9b5ac338be9d0584d50d275226e) >>
->> endobj
-17022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 472.821 161.677 483.351]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a8c82df1de8703aefeab268dc9ffc557f) >>
->> endobj
-17023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 410.422 204.985 421.326]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a7607ef1c8ef6b668dd2be62c39330406) >>
->> endobj
-17024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.214 375.631 182.698 386.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a277ba920e188477bb301196b19d63770) >>
->> endobj
-17025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 349.885 172.198 360.789]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a754f66ed06474d4b68a93131af02a86f) >>
->> endobj
-17026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 324.138 155.859 335.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.357 324.138 180.337 335.042]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab2c45cbec19ad11bf34db42b794508) >>
->> endobj
-17028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 287.807 155.859 298.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.357 287.807 172.735 298.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aa215867508a89858bcc7ab025f8d20f1) >>
->> endobj
-17030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 261.687 181.871 272.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
->> endobj
-17031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.369 261.687 206.349 272.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a272424f5d0df282c6d1ee63a5c84e3e6) >>
->> endobj
-17032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 225.356 181.871 235.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
->> endobj
-17033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.369 225.356 198.748 235.886]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a04aed5c92cf15c71ce85b8cc173a893b) >>
->> endobj
-17034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 199.236 189.204 210.14]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) >>
->> endobj
-17035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.702 199.236 216.999 210.14]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ab66151b86ac8c495eba1a3209501928a) >>
->> endobj
-17036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 162.904 189.204 173.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) >>
->> endobj
-17037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.702 162.904 209.398 173.435]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a241c65ff3d32769cbb9badd2c8e00ca5) >>
->> endobj
-17038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 136.784 215.216 147.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) >>
->> endobj
-17039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.714 136.784 243.011 147.688]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a9fb86f09111d4ac21fdc7c7baa86e622) >>
->> endobj
-17040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 100.453 215.216 110.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) >>
->> endobj
-17041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.714 100.453 235.41 110.983]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5eb3117d3d7d0566a99f9f5807276864) >>
->> endobj
-17042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 74.333 198.011 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a44b0a622563e60fe28b91b7e9ff76364) >>
->> endobj
-17050 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17054 0 obj <<
-/D [17052 0 R /XYZ 89 770.89 null]
->> endobj
-17055 0 obj <<
-/D [17052 0 R /XYZ 90 711.308 null]
->> endobj
-17056 0 obj <<
-/D [17052 0 R /XYZ 90 649.094 null]
->> endobj
-17057 0 obj <<
-/D [17052 0 R /XYZ 90 612.578 null]
->> endobj
-17058 0 obj <<
-/D [17052 0 R /XYZ 90 576.133 null]
->> endobj
-17059 0 obj <<
-/D [17052 0 R /XYZ 90 539.168 null]
->> endobj
-17060 0 obj <<
-/D [17052 0 R /XYZ 90 513.421 null]
->> endobj
-17061 0 obj <<
-/D [17052 0 R /XYZ 90 487.675 null]
->> endobj
-17062 0 obj <<
-/D [17052 0 R /XYZ 90 392.585 null]
->> endobj
-17063 0 obj <<
-/D [17052 0 R /XYZ 90 365.113 null]
->> endobj
-17064 0 obj <<
-/D [17052 0 R /XYZ 90 339.366 null]
->> endobj
-17065 0 obj <<
-/D [17052 0 R /XYZ 90 304.387 null]
->> endobj
-17066 0 obj <<
-/D [17052 0 R /XYZ 90 276.915 null]
->> endobj
-17067 0 obj <<
-/D [17052 0 R /XYZ 90 240.21 null]
->> endobj
-17068 0 obj <<
-/D [17052 0 R /XYZ 90 214.464 null]
->> endobj
-17069 0 obj <<
-/D [17052 0 R /XYZ 90 177.759 null]
->> endobj
-17070 0 obj <<
-/D [17052 0 R /XYZ 90 152.013 null]
->> endobj
-17071 0 obj <<
-/D [17052 0 R /XYZ 90 115.307 null]
->> endobj
-17072 0 obj <<
-/D [17052 0 R /XYZ 90 89.561 null]
->> endobj
-17051 0 obj <<
-/Font << /F73 552 0 R /F93 763 0 R /F110 1507 0 R /F60 532 0 R /F24 529 0 R /F68 3032 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17105 0 obj <<
-/Length 2323      
-/Filter /FlateDecode
->>
-stream
-x��Z�s�6�_���4c�8��
3�f�鑉7q����a�-��T
���� )�ԕ�m��O�@���w�Y9��n������
��G=�����]���"�ݔ`�ٜ`��73��a������<�<Ȩ
?�weXn��̰��(�Jֳ_n�|I���D0�<v����L� [R&�/F�
�%�qp�&aU�����LЩL�$��y#�e9#�TfK�9u��j�ɿn'&��1����e:y�
v"������yԓRǥ
~����l�<��B�	�\��"�z��'����(�4׹��
�>���
��1f����,y�o&�qe&�6�
�
�&Y�Dq��:[֣�2 ��|�,�
��H˲�
��[����#><��̿����2*(WVo��8��
0ײ
�<<[3U��b���;�=�؎?]b|3�e�Wq
��@�4���N��`���\��r��i^��&F
�Nz8�F��
D8;�!<���YE
g��,A���n3�8��u��C#��
 >���
X���r�����eg+�M�Y�ke�|�E��B�JhCf�>O��Q-5B�b�\�9�'��
�t ��������{��꼠�в�/�S�op��� ��
��:������tL�S����c`m
�`*n�����u��ǃ�S)A*�~Z&�HFJ(<_� ��
-=V��
�]�}�ta���o���
!."^p�ȥ����{��Y���<�B.�v������G�3P�x�^����K�TL��hb�CX��W���U
����x�dFz��ݯr� 
�
�w�驱�&�Q���
A��~0�1�����P�_� 	�/A�m#^���U���
-V��F
B��ݮ}6CLգΖ��
�����cXTc	%�<�U>����'�Y���?2�
-���3]�U�X���]�΢��؟��5y�*��;K����^�3�Zl�Q�����Q�@.�g�j+D���G���
� ���uv�QU���pk��	�D]�uB
���P]����bwy��
-�E|��*P~
-w����X�osmq��>lh���jG����V�k9F A�
���H�����ɖ����󡆞��
���À�n���3/�$�<Y>G-������{�L��l���4˕�k�cS|�H���v�Mc;k��(�7wy]���T%��Ŏ�s��K�AT/��2X?�fJg�D�yfF�:�33]7��2O�u=W�:sƑ�����J�� ���}?}�}a��(W
-U?Z�=�qӭ�3��o��]o�5��xLogn0����~��!�JQ��5,I�KUGWWI\�
���Χس����q�2b5{W}+?���ʘv������U�pA�V��O�:f$�~5N
I5}�ke�P�C��quD�����'(�a��j�G��z���
G��
�b�0�N�F�y9 ~�?��>Jk�v��Tv�\�Of:p/N���G�ˏ~����O��^����;g5qd�崝Jx�:�gv?�
��Z��jX�6�
��莎�=�ٝł�&��b{yK�Ċ6xd���ƣ����
�[�K
>���T�lF�y~��09ŝ6�X��zޔi��
���@rw�uR65��υ�+��V%s1�ڂ�g: �ݮ��r	�}��jj3����	:�7�[jz����Vo���_gs������P=���h�:9SñSs�Y�l��mx��ө��eX���5�U����6�?B
pX�X=��
{�d���m�]�I�lC|=<�ir͗�QL\�憇�
E�� v��	a-��&�n�(JY����x��zw����0?�D_p��
3s��
wa�r��Lœ�+g���U�c��(\S����鎻	.FX�]�G�_��&6��#�-���&�2�
��Afպ4��)²��Eë��]<]��S�;`)>��{\�w\Ly>{���s��,򌝜�]ͺh�O�� [...]
�5Y�Z|ga�Y��'��i9؅�f�;�.]Y��k$873���"��Ǹ���(����;�y�A�!؃{Ḵ��n��l`���~��I
�uROJ�;
����Vc�2����Ue�m��l�V.cW��8�*:��
�
�7e�^��o��5/��6.��}���������2�|Z5�|�6�U�aBPY��&A����3�:M9d���i�~TW�xO,�>�|?�uquyy�^U2[�����w^[|�;�]�4/e�xL��u�$9rL O�������I��~�/�����)s^� ���� �OD
-endstream
-endobj
-17104 0 obj <<
-/Type /Page
-/Contents 17105 0 R
-/Resources 17103 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16966 0 R
-/Annots [ 17043 0 R 17044 0 R 17045 0 R 17046 0 R 17047 0 R 17048 0 R 17049 0 R 17074 0 R 17075 0 R 17076 0 R 17077 0 R 17078 0 R 17079 0 R 17080 0 R 17081 0 R 17082 0 R 17083 0 R 17084 0 R 17085 0 R 17086 0 R 17087 0 R 17088 0 R 17089 0 R 17090 0 R 17091 0 R 17092 0 R 17093 0 R 17094 0 R 17095 0 R 17096 0 R 17097 0 R 17098 0 R 17099 0 R 17102 0 R ]
->> endobj
-17043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.346 155.859 707.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.357 696.346 213.143 707.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a386fa9c84bc37468f1a3a2b860a0bc3d) >>
->> endobj
-17045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.959 696.346 247.723 707.25]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 660.171 205.762 671.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a37703f96495cf4bcb8ced3ff20e4c396) >>
->> endobj
-17047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.577 660.171 240.341 671.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.322 660.171 292.086 671.075]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 635.33 166.449 645.86]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2edf5fe7007a3e91a404546ca2f2d98c) >>
->> endobj
-17074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 574.39 163.361 585.294]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.1 574.39 214.907 585.294]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ab955487a974e74224f3d72d743ee78a4) >>
->> endobj
-17076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.244 574.39 280.51 585.294]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 549.175 180.198 560.079]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a53acb5e9daa7c362b4d9023ae3a96447) >>
->> endobj
-17078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.013 549.175 222.279 560.079]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 523.96 252.795 534.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a113964ab3d7ea36326ce962629a322ce) >>
->> endobj
-17080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.132 523.96 318.398 534.864]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 498.744 229.552 509.648]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adef4c62b5cdf5186801c592cc62dccea) >>
->> endobj
-17082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.89 498.744 295.156 509.648]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 475.178 266.673 486.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a01b873b0e820222e07789c3ba5fa48ae) >>
->> endobj
-17084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.01 475.178 332.276 486.082]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 451.611 196.347 462.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad3bda090e4ac93d937ac4dd775c20919) >>
->> endobj
-17086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.684 451.611 261.95 462.515]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.1 426.396 179.739 437.3]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a1ee74f5687635ddbb9729be31a37e2d3) >>
->> endobj
-17088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.79 348.468 245.959 359.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
->> endobj
-17089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.256 320.916 295.178 331.82]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5534b8f8fbd973bfb7051cf5fb31f19d) >>
->> endobj
-17090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.269 293.365 347.203 304.269]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5c3bee913efb87e4661df746e184e1e1) >>
->> endobj
-17091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 224.06 210.607 234.963]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a30e0b0c2c668e73566cb1720d72cdac2) >>
->> endobj
-17092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 196.508 168.555 207.412]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aee126cc2eef44ab1d2055d0d15bc3169) >>
->> endobj
-17093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 157.997 144.674 168.901]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.173 157.997 332.409 168.901]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a660ed1cfae2599d7f9236f2084d499) >>
->> endobj
-17095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.143 157.997 417.907 168.901]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.888 157.997 469.652 168.901]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
->> endobj
-17097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 130.446 321.152 141.35]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a86f44d9d38638be46ef23422783f847e) >>
->> endobj
-17098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 90.939 226.666 101.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_affd1594c3bfb8bfc8e5c01c5bf0403b1) >>
->> endobj
-17099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.004 90.939 292.27 101.843]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17102 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17106 0 obj <<
-/D [17104 0 R /XYZ 89 770.89 null]
->> endobj
-17107 0 obj <<
-/D [17104 0 R /XYZ 90 711.441 null]
->> endobj
-17108 0 obj <<
-/D [17104 0 R /XYZ 90 675.72 null]
->> endobj
-17109 0 obj <<
-/D [17104 0 R /XYZ 90 650.051 null]
->> endobj
-17110 0 obj <<
-/D [17104 0 R /XYZ 90 589.297 null]
->> endobj
-17111 0 obj <<
-/D [17104 0 R /XYZ 90 564.27 null]
->> endobj
-17112 0 obj <<
-/D [17104 0 R /XYZ 90 539.055 null]
->> endobj
-17113 0 obj <<
-/D [17104 0 R /XYZ 90 466.706 null]
->> endobj
-17114 0 obj <<
-/D [17104 0 R /XYZ 90 441.491 null]
->> endobj
-17115 0 obj <<
-/D [17104 0 R /XYZ 90 365.292 null]
->> endobj
-17116 0 obj <<
-/D [17104 0 R /XYZ 90 338.004 null]
->> endobj
-17117 0 obj <<
-/D [17104 0 R /XYZ 90 310.453 null]
->> endobj
-17118 0 obj <<
-/D [17104 0 R /XYZ 90 242.881 null]
->> endobj
-17119 0 obj <<
-/D [17104 0 R /XYZ 90 242.881 null]
->> endobj
-17120 0 obj <<
-/D [17104 0 R /XYZ 90 213.596 null]
->> endobj
-17103 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F60 532 0 R /F90 758 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17154 0 obj <<
-/Length 2359      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~��`_Rj&�q!@қt���N/�xm�S��P"$q#�
-I���߃
AR�dg6�l�~"�����|8��
�~>�����,b^�A�w5��Ea�����{�s�'\��1#���|���7W���觫��G��G
��؛������
��0bI���Nk/�
�+���G��媨>�3�5�D��༚�52�����MS�SU�md�Ys����L�i�B{0qf	����U�v�?y���)?ne1����
��x�]���������Ŗ����
��YY4i^���.�U�
�)o���!ͷ���^��ZM�,�(p<P�!�##+�iY�l�
)T2��@a��~�+�g��^�E�5Ц�J�gH� N���K�CĽ
!
-c�vx�1�)D�n�e^�M�P$H�)�2��J�4�&,�4��c��`��F�BC�B�Rg�g�b��eQR'����v}
�2�5˴iK���ie
Ei�r=m�l�Ή���s.�0O��f/BI��b/F�p�i�z��g�˒^?�0txe�ا$�#G�v#�tmWr:B0�`<��w�`OQ
-UvHP­ �'�e�
6��Fy_��uզT�w�^N(��}�uw�@�1S�]q�̊9ɞ�F��W$�� �$^|zyx�e�3�t���{x��>�
��wlu��ʓd�=�7�
�s|>�@B�uu�7�12z9*�#T8b��Cw�CC�_���rʍ�Ҧ�^����y�͗�f����h��� _jQ�8N
wwK�0c���VŨ[�B��j�v{��n}Ef
-e��5�|4�#w����],��9>�'�<��	 l(�q�_�+��#�
Q
hϐ ��ͣ@�%a�3&|eL w���wTp!���C������n����n*��
�C�1{�� ��W��
�]��ђ�N�/�*$IH������ N���6���]%}u��5@�p]A��?opOx����I����ɓ�8c���kr����;��d��WG��m���z��
�>n�{0�',�?�r�V��cP�l�|�fvNe=��J�
C��4mn'L��r�2�଼� &#uv�3K���P �Ŏ��t����~�ֵ�x>�!�\���t2Vi"<*��&�)�Z���wȔ	Dc�I	j�t>a�t�s��Rf�
G�2,Dp�	�!
���
-��A�ߞ�~;:gK|k�;��!�-azȲcD���8�H����rЛ�;v>\muR��&��&�3Mk��w��@�L}V�Ӽ�g;e�*
By;�ɞ����
O�r�H�ajӔ��,d��L]�S�iˎ
g��7)=����L?o>��
6��5�)R�R&�cL
��P�O�o{\�YϙG�.n��
AO7�X���r�]�o50
F��x-�� �<��g"|XC�mt��� ��F��T5\+v ����V�e�,3KBK�?(���<�n�F����C�^�׉{X83�wݹ5
EvU����Jea���y�WF���ɢ'��1۞&�f�a�t�2���yY�Bj�
YS��F� mz���I�C�IM���߲
I*O����T/�"[���!��{���F��BM�r�6��� c���B����C����P�q���1�}:�L����B��0��b�X���YZ��K(O-�F�3��*o at 4J|a�_�@�R�kg�ޚ!ۺ7�%cLE�
���'�[�q�Y���%�u��C��3���΍�@mS�oV��^�Ik�벲5J$��-�Q;���
*��toMMm�v�v
��[�i���i:��N��
-�4@���m��s�PƠE`�9����櫍�S���*kn���߶N��ȩ~^��e�E���t��L
e%;;��*צ���
ݲ�#�]<����\��p�a�,t`��k�Z0L@�+�����(�+�.XZ�T2�[���m��\���Ž�޺�8v�̲����\�����Q+X�����=�ƒlD�t� ��V
#�����
=�TF�X���F���M���O����01F���
=���~
�"b
#�4v�.L��U�2����$m���V&�g���۵̔�����^�~�b�g��/��;�8C�-�L� t��v5���(v���٤�����]����ϗko�''�;���|^�"@S��
5�Z�لh�{��M��T)��H��������a��+
�w��
-
-P�
��7��':����$�O
-����nl�؊�_��;-�XG. zAGP� ����>�����wS�g-�o'���6����͕�z�m*	��F�+�V�����ߌ��s����Aòi6'�����X�=*t���bM��^
��¼�ʵ�Ѯ��7��
-endstream
-endobj
-17153 0 obj <<
-/Type /Page
-/Contents 17154 0 R
-/Resources 17152 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 16966 0 R
-/Annots [ 17100 0 R 17101 0 R 17126 0 R 17127 0 R 17128 0 R 17129 0 R 17130 0 R 17131 0 R 17132 0 R 17133 0 R 17134 0 R 17135 0 R 17136 0 R 17137 0 R 17138 0 R 17139 0 R 17140 0 R 17141 0 R 17142 0 R 17143 0 R 17144 0 R 17145 0 R 17146 0 R 17147 0 R 17148 0 R 17149 0 R 17162 0 R 17150 0 R 17151 0 R ]
->> endobj
-17100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.426 154.079 696.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
->> endobj
-17101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.578 685.426 193.083 696.33]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5d2c2fc2c077e77db657af49d332c9b5) >>
->> endobj
-17126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 659.855 167.639 668.702]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad34bafd07f582c558936f9ea8892abd6) >>
->> endobj
-17127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 549.55 156.281 560.454]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aa18495186f3f1b0fef979ec7d8147b81) >>
->> endobj
-17128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 549.55 198.363 560.454]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.246 549.55 282.512 560.454]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 509.967 180.54 520.871]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a411da088d0c6344021ea086a87a09ee4) >>
->> endobj
-17131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 509.967 246.143 520.871]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.548 509.967 353.814 520.871]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 470.384 178.239 481.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad18afd61b30d839d5b7669b3a8dea008) >>
->> endobj
-17134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 470.384 243.842 481.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.247 470.384 351.513 481.288]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 430.801 226.034 441.705]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) >>
->> endobj
-17137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 430.801 359.442 441.705]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 391.218 178.239 402.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad18afd61b30d839d5b7669b3a8dea008) >>
->> endobj
-17139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.576 391.218 243.842 402.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.247 391.218 351.513 402.122]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 366.445 156.281 377.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aa18495186f3f1b0fef979ec7d8147b81) >>
->> endobj
-17142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 366.445 198.363 377.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.246 366.445 282.512 377.349]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 341.672 180.54 352.576]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a411da088d0c6344021ea086a87a09ee4) >>
->> endobj
-17145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.877 341.672 246.143 352.576]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.548 341.672 353.814 352.576]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 316.899 226.034 327.803]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) >>
->> endobj
-17148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 316.899 359.442 327.803]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.162 218.502 513.996 229.406]
-/A << /S /GoTo /D (index_powerset) >>
->> endobj
-17162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 208.604 125.865 217.451]
-/A << /S /GoTo /D (index_powerset) >>
->> endobj
-17150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.08 188.923 366.346 199.827]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17151 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17155 0 obj <<
-/D [17153 0 R /XYZ 89 770.89 null]
->> endobj
-17156 0 obj <<
-/D [17153 0 R /XYZ 90 704.286 null]
->> endobj
-17157 0 obj <<
-/D [17153 0 R /XYZ 90 704.286 null]
->> endobj
-17158 0 obj <<
-/D [17153 0 R /XYZ 90 674.924 null]
->> endobj
-17159 0 obj <<
-/D [17153 0 R /XYZ 90 607.242 null]
->> endobj
-17160 0 obj <<
-/D [17153 0 R /XYZ 90 303.445 null]
->> endobj
-17161 0 obj <<
-/D [17153 0 R /XYZ 90 254.807 null]
->> endobj
-17152 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F39 2320 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17182 0 obj <<
-/Length 1422      
-/Filter /FlateDecode
->>
-stream
-x��Y[��4~ϯ0/�L�$[�,�� �
m�v
���+��Jme�a��αdىs�K:�X����9߹��Ε��z�^�N^��ȧ�s1s"�^��w�s�'��`H0������������L��<)��k1)�byzj�+���(���xy��$r��{��ffH�D�-�Y��&�Æ��,�K�

)���AD�<����f�
��b@�>ϧ00��#����=l�C�e
-Bg��.�c'��Fn:5Q�xԅk����õ���!�1�)`��{c`����
��>
-��	A��V@̴8��s9��w�a1|��ȅ��r�s���
$�G�_��	��3
`���@�xf.�%���Q��ȧJs�m�ݣ�3���Ӓ�˻A��Ь
� �ƫ��2x�xO
�!
-�o4��u
�Z�r��<2�lQ*3���#����4���E~U/��Z&%ZӢ�V�PB�]
�C� ����d�
��O>V�9�p�r�VR��^+��d�xy��vw�a*�Rm1hc�U���jQ�cs�M!�o'r�'f(�!��fX�iF��2�����B�`�p:]�O�� ub
���F;�Bn�\��λ>u
z)���X�y'Z�Ť�z
&&DZr�E^�U��[xRy�X"Q�+n1Lk
��q�����̀�<�4��Df�����"��k"����Z���͂�
�z�-[+5�E�[TG_ȗ�v���
����(��\$�� Zu�R�W5h�����㑹$�
�Ԙ�̬ذ#
a1�l��"
-PCK�CF�=�yEn ��n:<!L0T�����Z�\�U}��C)"��O��G�)�@T�ڒ*GO�
-�D�B�E��S$7B
c�D
-��7�b]ø�ݩ\�Ig󉕋O���}�c�2q�O
;�F��`^���b
ݛ��?e0��h)l��wI�q��h�6��~S��M�
�A������ǃ�V�
׿/�����t�K��!@�<�#��KGHjAD�[o~�o����#Ilsf^�R598(��6Feͫ�)7%!
-}�PU�����u�.����
�)�n��L%$�Xɢ�u;�@ܖ���O�Vʳ�m�S���T���qVs��>�V'#��%#�V��@[�Uon�žb
>/xY�X%���\N�[
&@a�8qyϔ~�!�U�H�C���'�ɷ���?x��܂A��6���ykb~{] ����A&E�i��BT�����&}��0ֿ�+��E;�������v�Dw��b��t_|��=�ŷ~�
҄ Mes�U�
��
-w~��
~-ya1�?�y��+��R3/�&��If����U#��
�2
ފB  ƚ#��R�ӓ���
-��v^u��n{��=�e�h�Lf�^ �	�ڑa�|�ZK�1?@C�IPM�:���z����uF
�~[�v`8`
-endstream
-endobj
-17181 0 obj <<
-/Type /Page
-/Contents 17182 0 R
-/Resources 17180 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17184 0 R
-/Annots [ 17167 0 R 17168 0 R 17169 0 R 17170 0 R 17171 0 R 17172 0 R 17173 0 R 17174 0 R 17175 0 R 17176 0 R 17177 0 R 17179 0 R ]
->> endobj
-17167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [105.741 623.617 174.682 631.143]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.874 623.617 266.737 631.143]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5a36a32ab46d46f574f3091e931e2bd2) >>
->> endobj
-17169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.662 562.103 153.761 569.63]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a66e3e2f2433738665eb748d2f6c5878f) >>
->> endobj
-17170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.662 508.717 166.314 516.087]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ae006881831b298f0af5031e99df2bc6f) >>
->> endobj
-17171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.662 455.018 203.972 462.544]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a411d42e5b59a492742793834efeeabc1) >>
->> endobj
-17172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.662 389.519 203.972 397.046]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adef4c62b5cdf5186801c592cc62dccea) >>
->> endobj
-17173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.662 335.976 174.682 343.503]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad3bda090e4ac93d937ac4dd775c20919) >>
->> endobj
-17174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.662 282.74 137.024 289.96]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a8c82df1de8703aefeab268dc9ffc557f) >>
->> endobj
-17175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [105.741 211.266 149.577 218.792]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) >>
->> endobj
-17176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [105.741 157.723 149.577 165.249]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a411da088d0c6344021ea086a87a09ee4) >>
->> endobj
-17177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [105.741 104.18 149.577 111.706]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad18afd61b30d839d5b7669b3a8dea008) >>
->> endobj
-17179 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17183 0 obj <<
-/D [17181 0 R /XYZ 89 770.89 null]
->> endobj
-17180 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F75 554 0 R /F60 532 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17190 0 obj <<
-/Length 2977      
-/Filter /FlateDecode
->>
-stream
-x��[[sۺ~���S+�D���t�&�{ڸO9�
E�6{$R!�8��]\x� Y
��y�)����v
��&��?/���x�F�(AIL���:Jp$y�D
oy�~&���1b�B$��+����~�z���;�w������.
G@ ��l}���rh�1ˆ%*�����
����ſ.��#*�O����d� B�#��/�x��^/u=_P�fWs�f���k��ʶk]�i[T��8���#Ɠ	
D<�V�7��Ն��7 � ��(��[����%��Ђxe�� �g�y�����=@����)�	���//WE��a�N�4$�@*�m�DV4ڍx;'x������9ųju��:��s�������5�Qw�ntHjc�(qL�)Ӑ�
&8�q-@�!��Y��#uy��@��#��O[]f^1��BL�r���U��V�&z��M<f�&����+��w���6՜�n�lK��'��6��sא���=�NL�V]��v�4��9� 1��
ϫ[3Z״n� [...]
1]�Ard�L�?\wQ6 
-�\�~n��7�ۆ	
����B
-�A(

-	B��A��=P0�V�i[���M�W��k`x�)Xa�C�>H��]rK
-wP�V�<�Q��9x2��X�)Ϭ*��G	���=�X�����=��4 R��`I��zhx

���c�4Q�CȻ�:�j�Ű�
�I�j���������3��9��Q=gr��|Q��{7z‹���~~�"/j�]0�t屲�aa��Ǽh��-���be��g4����o�
���ch
����P�v�����׎���,ۦ(o�O	2|7��̶
���1m��6#Fb�!YZ�U뺖ڵUU?�?�����ե��4����
I��
����Q��#B���V��no��9�\;>r���|�f�;x�w�W =䘺�������'ICbDe a�}i���i_��c# %X�0���Vi�>$8` �Ӽ��b�u�i���b]6��.���gUm�ݽ�¼W��N�[�ݽ��Y��u��Nt�
/
l2�b�Y cV͹�'���y�p��.W�����X�X�yN��*�PT�`��׏�G҅
����Z�tߡsI�I�x���	�Kp-�p�9�wVI�>���Bgc�7��Ƭ}Y�냀�.	�
-f|��7 ���u]��/�!����4�2�c�עt�����V��A��B	�x���}�FaKT�
S����Q�ʪ\��/�:�=]�ﺛ���!9�'�9��,�����%
��N���t�����KHl��t.��Nf][�3�Pt
�7���(<�H
���AK����:Y�Bm|��w��
-��7��sQ���� 4�Ѯх�D�љ{����~}�#Y<]��G�����'���
��PBv\Q�EE�^�6������{*�;���"!"�q(�bϛl�0�
@���� �Ku
-�'H����<z��Ɛ��ѧ!���@i�M1q~� $�̒�>�[V[�M��]c�����b�0h�k�4ō_��Yp��c��
��=a��?5����ⓞ�_:
-�@*x� +�F`��ݨ�
<�>�}QB�r�8F1;�\v�=����]l���9�S
C���c��ncV��,�)tH2�(I�AZ2�_��W�d�x�%!�#t���u�]����υW:m�G/����O�A���|��<��Px���}#�4��
��G,�j )
-���
�
�F&L�퍨(����!ʼn8�
��m�&l�?�?¥
-	��/#���|�� O&�0�Yxrl�)O���KjO2Ns�
�����S�ob�R�s�����M� `ԟ��^
Z�v�׺��e�L"��Em�~(CG��v=�
bv:pb���/�ޘ4��R:�D����[�ض��X���)P���@��i" �B$�(;FG�M�x�]��I�N�B���:�
Qq�7�	�<2� ��
��r���s�*�-x���S�
��9R�[�q�&�Āb;3e���c3�*0�ĊM&zu[�������iE,&�H�w5i�W�`o��EQf�z���r����,��=E+���j�O����
�u��4���y�O١�7T�c�]�K�5ИP<h<K�֮�YҀD �ɓ&�`k�X=:
H󹜅���,�d��;y0
�!ݏ�%K_�*�@0N�Q��0#Pt��j�j
ȍ'�g�K	 ��S�]�#��0�,3�  I�3�M��M���}��#	�q�
-
�x�}|�ϒ.�]}�6�r�p��{��_���a��u\H�%�`c�8ҥ�)<�"t ��)O�T�C���Vd"
C BvL�ԋo�z�wyn| !15y��D��ӄ�����_��:����٦ٮMI>@BG�
#(� WԌ����d�C�����%#0ttu ��}�n
>z; v5���H��P�
qF��E���\�sQ��#��s���\T7h�������WwE{�F�l�E	xݲ�C��R.ݳ�tҸAK��i]����❒��$�6&�xTںƞe
-�1"}Y�q�s;#�
-����F;�9L��ϴ�ʰ
vg|~�]������u���-��������</���Br�����ͫ�"���X
�$>�6.$������
�\
X�8F"�'����a

]�7���B������� 2�Oz;���s1��
^��`�v$���u]u�cK
��M�e]i���
v��[d�ׂ��S�v���8|��0�a�v��u��2�4������_��/&��,t~߹���	� ���j����m��F��L[R�9�m;�o|���,zU����-�]n�`�b�|+�)�3-Լ}�������:����/i��n4�����k���]�O#w�����:������݂�#8�W�۶�\�|���4��A�?'n|��
�n��ֹ��d�(�q�
�t[�?h�)�
-endstream
-endobj
-17189 0 obj <<
-/Type /Page
-/Contents 17190 0 R
-/Resources 17188 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17184 0 R
-/Annots [ 17178 0 R 17185 0 R 17186 0 R 17195 0 R 17187 0 R ]
->> endobj
-17178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.255 563.795 379.521 574.699]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
->> endobj
-17185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 534.839 282.279 545.12]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a386fa9c84bc37468f1a3a2b860a0bc3d) >>
->> endobj
-17186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.458 534.839 513.996 545.12]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a37703f96495cf4bcb8ced3ff20e4c396) >>
->> endobj
-17195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 522.261 120.884 533.165]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a37703f96495cf4bcb8ced3ff20e4c396) >>
->> endobj
-17187 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17191 0 obj <<
-/D [17189 0 R /XYZ 89 770.89 null]
->> endobj
-17192 0 obj <<
-/D [17189 0 R /XYZ 90 721.073 null]
->> endobj
-17012 0 obj <<
-/D [17189 0 R /XYZ 90 702.288 null]
->> endobj
-17193 0 obj <<
-/D [17189 0 R /XYZ 90 702.288 null]
->> endobj
-17013 0 obj <<
-/D [17189 0 R /XYZ 111.081 623.119 null]
->> endobj
-17194 0 obj <<
-/D [17189 0 R /XYZ 90 618.536 null]
->> endobj
-17196 0 obj <<
-/D [17189 0 R /XYZ 90 508.687 null]
->> endobj
-17073 0 obj <<
-/D [17189 0 R /XYZ 90 486.31 null]
->> endobj
-17197 0 obj <<
-/D [17189 0 R /XYZ 90 486.31 null]
->> endobj
-17121 0 obj <<
-/D [17189 0 R /XYZ 305.44 393.273 null]
->> endobj
-17198 0 obj <<
-/D [17189 0 R /XYZ 90 386.633 null]
->> endobj
-17122 0 obj <<
-/D [17189 0 R /XYZ 321.092 319.478 null]
->> endobj
-17199 0 obj <<
-/D [17189 0 R /XYZ 90 312.838 null]
->> endobj
-17200 0 obj <<
-/D [17189 0 R /XYZ 90 242.132 null]
->> endobj
-17123 0 obj <<
-/D [17189 0 R /XYZ 90 205.742 null]
->> endobj
-17201 0 obj <<
-/D [17189 0 R /XYZ 90 201.258 null]
->> endobj
-17124 0 obj <<
-/D [17189 0 R /XYZ 360.931 84.126 null]
->> endobj
-17202 0 obj <<
-/D [17189 0 R /XYZ 90 77.486 null]
->> endobj
-17188 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F24 529 0 R /F117 2446 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17206 0 obj <<
-/Length 2322      
-/Filter /FlateDecode
->>
-stream
-x��[Ys��~�`^6`�9�s�֩��qj7����>�.D���Z���`p
4$�J�*��8F�=}~� 0�|z;����l������+ɦiA��j5�x*C������: )6��q�fFp����A�����<��kr�G����^6��㼈�ه�_.^ңO4CL���"��]� ,)�͊�
"	Ւ��(�������)���L� �l�Q�+o�U�ψ
-�t�$�a�93D'��|� ���j�#�������.��/�Q���Z������z�n��;*�T
4\U�`g��C��vو�p�R"A�@�m�d�.(��8�6�;��W��DX5�4����h)K�>Ճq�h��eFZ�c�u���pN5F���9�\s~x�Fu��\^F˙
�݁��S�5b@��SP_�n����
-^�"�hi�z�*�$�a
-��MV���!_J(8�:_J8�J�|�I�]�(=��k��B^�z��m
�s|�=�U�$
��]�cAvp���r�(0��
��
��!��"K�.Bp���~h�Z��*�DHg]z���Y �I
���
-Q�F�u���4��!�P�e��C*D!�7��yVƋ2^V�ڪs�J����
1J�0����rY��2��@��C��1̼�hՊ[�%�]�p�����.
}�
RUHb9P�C�#-U��� ���&Io}�)G�)��^R�%��Z?��u�V��:��i�"J���z�g#Fu�����ѼuFdD�D)�F�(7�����c
S��c
-�E�

#�Ҝ��&^eyloD��M�Y�MI�B��l4����ޯ�UW6qy�-� 
�&��}���
�
E��6��b�j�n�������mڜ�C�O�e��� �hp�� Ұ

6��
��~l ���`�ڒyD6Z��/��$��D���Y"Q,(��5i�A���o����yTf������Z��lP0h���EQ$��O��.��[�Z�Rr����PAm��c�M!����X�FI~��Jθ��

B �0�*[�R�k�E��zF��7Cp&��0�C��u�-��
�xhpP�t~�
��f�35�긡� "Z��g
-78d(SWI�e$�
�Ɛ����
-Q� $R!�
��jG���!�._7w��G�p��l�
"S���
�	�0Q�lQO6׽q��N�'BLJB$D1e_I�P&��NA���P&��ݺi�T`
R��!���gۏ}U�T�୕۴���ō5V���
E����0��cc��]�� ���j���j�lW�&��o��J�p�lno��M������Q
��wSFɌ�����;^q�j��"}�� u��jѣŝ�f
i�5p�u�����M��u�m �v���2�N
�F�>��
�
zDQ7V����YQ[����g��x��	
����D(p
i�@ް��x�ʓ8�S��U[ocx�W�m�-=���;c ۗ�S�+K��9�s�"�_
D�
�!����-��aP
tm-�
-�x`��.��
-C�f�=��0D0v����
�?�����������
&Ao-+��$��܆��*
���-���fd[�2+hw�809i�}R���@�p,�H�ڌd�z8���P
-����&��"ZA�:6��
��ɲ���� ��s��;
͑� ��:
:����9��C��
���!��zH��{��
)`�$E�&'t�ީ2�
Ȝ�OJ �E�q���Ÿ�~N+�]<
-5��`"���}�{W

╉�
�N at 2�X�q�4�,���q
��ր"NB1�<ȢM�a�	'>�|�c�9�=@��=zn���#���Ð:�u@�@䝾�C�G�坰K�����6IڦOI��H:�c�G�>�cf '���
�c��(���YQ�q��T�?Yo�7|�^����R�^�lA��r����v�V
�&ݨ�(6��nNz�;�M���/� B��f������,!M[�\�~�+��f|׸?i؀���������S�~*ЏZ�Gz�~�
�4-{��}��2��aᛝ5a!�FNO#����[\�L=u/�@�"����Y���7/��d�<�u
Q��Y޼#мn��>��Od��85�/{O���
V�zm���ǘ��KGf3��!!�t�Q�{J���z�!��5���Yͺ��-�N�t�z�T�@��W����b�Uޛ7�ڃߋ8��i�j��3JwѺ�.��at^�:&
�ٜ�:��q�O+���?&�t�}"o�ߕ�����fw[��-Z���;����X [...]
-7Q�
��d�Gn���(��Ġ
)i��\�l���p��M_f����1���o�
-endstream
-endobj
-17205 0 obj <<
-/Type /Page
-/Contents 17206 0 R
-/Resources 17204 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17184 0 R
-/Annots [ 17203 0 R ]
->> endobj
-17203 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17207 0 obj <<
-/D [17205 0 R /XYZ 89 770.89 null]
->> endobj
-17125 0 obj <<
-/D [17205 0 R /XYZ 140.132 647.468 null]
->> endobj
-17208 0 obj <<
-/D [17205 0 R /XYZ 90 642.885 null]
->> endobj
-17209 0 obj <<
-/D [17205 0 R /XYZ 90 528.317 null]
->> endobj
-17163 0 obj <<
-/D [17205 0 R /XYZ 90 504.996 null]
->> endobj
-17210 0 obj <<
-/D [17205 0 R /XYZ 90 504.996 null]
->> endobj
-17164 0 obj <<
-/D [17205 0 R /XYZ 90 451.337 null]
->> endobj
-17211 0 obj <<
-/D [17205 0 R /XYZ 90 446.854 null]
->> endobj
-17165 0 obj <<
-/D [17205 0 R /XYZ 90 395.166 null]
->> endobj
-17212 0 obj <<
-/D [17205 0 R /XYZ 90 390.683 null]
->> endobj
-17166 0 obj <<
-/D [17205 0 R /XYZ 90 338.996 null]
->> endobj
-17213 0 obj <<
-/D [17205 0 R /XYZ 90 334.513 null]
->> endobj
-17214 0 obj <<
-/D [17205 0 R /XYZ 90 278.343 null]
->> endobj
-17215 0 obj <<
-/D [17205 0 R /XYZ 90 244.34 null]
->> endobj
-17216 0 obj <<
-/D [17205 0 R /XYZ 90 211.278 null]
->> endobj
-17217 0 obj <<
-/D [17205 0 R /XYZ 90 176.214 null]
->> endobj
-1955 0 obj <<
-/D [17205 0 R /XYZ 90 86.708 null]
->> endobj
-470 0 obj <<
-/D [17205 0 R /XYZ 90 77.486 null]
->> endobj
-17204 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17225 0 obj <<
-/Length 1978      
-/Filter /FlateDecode
->>
-stream
-x��Yk��4��_		i��#N�B�A�cvʧ]�2�ۆͣ��.��s�H��i���(�c___�{�I���������&\�Z-n�B�$8��#��� ��˹�����aA��`�������o^�
Գ�7�Ż�G�!� Ga����_��@�w�0��A�
�2�f����
y�=� �9�\�[B������c��{�w�*�O� <@Q�
�K�0ģ��g�`�|�ƽǨ[f
!�a'�j��#����v g2���+o����_ɵ���G���_"�0�qFP�q8^���F�CS�k�~%7��d�6NuȻ�
� vK���%�:��/��noMc��u��
@-L�Β�0�7�>I�u�&Ҍ�#9C!�����[!������f�0���wþ0{!YGm�C"�Pg� `��[��i&�[Y��tߤeq)r؆��]�� q3r�E�U� YSM�6��JҺI�m��;�����#��3ʢ�]Vu�<n��Jj

֙�
�F7�c [...]
-��8��t��4k���~l�P�=�݃pw

���rP�Lʵ^/�q�]���Aݥ�i�
ġ�AY�탭,d7�
�Ԫ̻����e�G���w�
�4��G�
��|��F�b
�7����K�9�t���]vV}�p/B�tB��I�W!T?�� ��2�5\�u�ˆRv�~�I�Dz
'"�(��8�R;�^A���2q ���A��	�����
P�`�"A�:9](
Qύ�R��[:g�Q�C:"����6TEB(̏\��3�8��K � �~���E�C�F����r�j�R��4��$��>x�6�@��	���b��W�
�2�%)�8-.�;��ֻ��
׻��N"Kצ��(�G�tվk

�ztBgN�'G���r4�Rmmڼ���$�#��հ3��O��%����g1>Շ����/7q�5]!�&�
1��(��
��%�G�[��}6�s�[���4H����짉J]ՂԵ=�BWYF*
۪U�X���c��}樮rЀ$�U��'4��
%��*IT�d����nH\
��wm��MjV
-��"U�Y=|��Z�쬍��6w��j��K��g��W����������1W��|����)�s�hs˶H�3�KhUK�[�/ӟv���Lo=n�����D9�K�'s,�&3wqrbYQ�O�R&�
ۧ8����D�z�z�6�5ZI�[O��^��חq����E�dB雓w����E��͠dNi
�`���L�h{Y�%��3*��tf!J.
-�i�?��y�5/)`�N�"@ �PΌ]�G�H�ȣ�T i�Ma�?Y�28FF�k��|
-���"S}�Q��k��c���8
�R�.#�^c}�AJ�����:F14���b�T4
JT-}�Qd�'--�㗢�Љ
:Cuv��PV�|8���Q�U�j��=W}3PW�v
M�ȥw�"�����)Yv0l,���N���Ɣ	:t_�v�Rm+��@SS�(�ބG\��5d��~���m}b+O�4O��Ioꀩ�3�+Ʋ�)-�3�I�g����=^i��t"N�]��Q@ X%�����z2|S�j�X�8��J��&
X�Z-b4��<��Z���
�HK�����
 Z�A_���E1tX���C���ؘ�~�q��>)5Z�U�������
Fr�Z� x6ڋ%�^�Ů�K���l��ld�ۇ�'N~o�S�u�i��
-��^����@p�e���gj��eE֫�漀
��8If�vT��&�Q+ΰ��3zh��$��8�}O���� 菲��
0�胖�w�w�h0	�w����n��y�3�cGsK��<�EX���HD@�ݢc:����4~F���ܵ��1. �^��+`˪ � ���������w���~-��}�$m��5�����c��e�E��%�8t
{�����.-�3�9O�/��|j
-endstream
-endobj
-17224 0 obj <<
-/Type /Page
-/Contents 17225 0 R
-/Resources 17223 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17184 0 R
-/Annots [ 17218 0 R 17219 0 R 17220 0 R 17221 0 R 17222 0 R ]
->> endobj
-17218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 364.159 233.78 375.063]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_aaaf6dc9a305149db551f3dff63d7e6f4) >>
->> endobj
-17219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 331.047 197.875 341.951]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_a8411ac9c6855778aa3f0f47a66bdfff6) >>
->> endobj
-17220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 276.018 241.529 286.922]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_aa8bb2afcbf530af32dd1251242a480e9) >>
->> endobj
-17221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.021 139.778 392.442 150.682]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-17222 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17226 0 obj <<
-/D [17224 0 R /XYZ 89 770.89 null]
->> endobj
-17227 0 obj <<
-/D [17224 0 R /XYZ 90 645.991 null]
->> endobj
-1956 0 obj <<
-/D [17224 0 R /XYZ 90 516.236 null]
->> endobj
-474 0 obj <<
-/D [17224 0 R /XYZ 90 506.376 null]
->> endobj
-17228 0 obj <<
-/D [17224 0 R /XYZ 90 385.761 null]
->> endobj
-17229 0 obj <<
-/D [17224 0 R /XYZ 90 385.761 null]
->> endobj
-17230 0 obj <<
-/D [17224 0 R /XYZ 90 295.886 null]
->> endobj
-17231 0 obj <<
-/D [17224 0 R /XYZ 90 241.073 null]
->> endobj
-17232 0 obj <<
-/D [17224 0 R /XYZ 90 177.791 null]
->> endobj
-17223 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F22 2996 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17241 0 obj <<
-/Length 2358      
-/Filter /FlateDecode
->>
-stream
-x��Ymo���_!�@*Y�/"%��m�
.M ���t
䕼+dWړ�6�_��ҊZym�[�Hj�p8�
�`����^\�OD��V\����Ak"���s�(IU�`���&b4̚m��&�4�7O�"o��?�wM�<]]}�f����"�/�����n�|���
F�D���o��� v�b��f�G
.ix�g������/��k���Ż�4��n�u�]�X�M�Ұ����b�B)%�^�����nDfe$I������h���%B���!�1���.~��N����!>���>c�8�^��s�������}e%lf��r�-�.��̆���1���	s;t�8��$D�t�6���$�@�=�*ۢ`� 
Ⓡ�IA���^�	S�D��~��RqO��8��|�4����E^ D�` Z�>����O�lW|��FҢ���V'M�qI�ԧdg���M^'��)��)�x�����2���cK1�4P�$��S�
��
,��vx�
-�b�R=�
*:��/T�h����|�/�H
��A3�3���AL '��8�/M8>���c	��t
�2ϗ.�+�8&T��Q�@4�ݮ�B�pYW�f����
�`!fZ�&��g,��
�EW�����+��u =IV�>�
ͷ}�)��ߥ�F,�m�"��.[�
̽}v#N��S��#�2��R^���y]��LX<��1����mչ/�*�(DxW�ܽ=���Q3A"�"w�����Gn[{���Yw��9Ϙ/��Y��~�i�,��F�5Y9�Y
�� ��P���c
n˪ܖ�E^pzP>�Ӱ}j!��wcA��1�z
��q�)0��`&��,��:����,bg,���B�}۳�Ֆ��X�n�������E¦�sj��+�
�mY������
�E�*�F�kېȶu�V@��{g�Rk*�[XG��G��*c��҉�XL����&��X��xt���st��
b!b�(�]�5C@�ڙ�N�m��T?~zc��f�f6"o3Xw{���
h,����]vOv�sJCY:
O4n+�*�s#
�����ξ<8ɻ���|,[d��Io�� 3��B�Q@�+t
��?T��
FH��
T�C)�
-�	.���}�Y�
#�C���3��N���:w
� R�����D�4M�h��P����"$k���6`a��M�
��[��M�O	9�u��Td� =��o	�:�P�P�O��Ոk�
���S(�`
-�=��ˊ)�odÏxJ���X�՘7��q6X/�]@w�[�ao��y�RMR����܈�^ �Ca��k/��gl��^��7�1o/c6�j/��g���2>���Y�cy"�J�\W�V|�Kp���&FS�
 ��&�&��‚ܔH�eSo�O�
l��#.�G[��f�Mq�yP8�Dpo��$.1|�\�T�.ܻ݆��N�G��ꌛlӣ
-�dɹ֌I=����Ǥ")�+����SJ ���7�)
-�ii�x���'�n�`³��c
8M	=

�J)�{{�i�w�fxH��=�
x�=�ä	����81a�	0.
�+�
��
��	ʗ�}�g���h�6���������}�Yc��S�^A9�L�>�Һ����i�ĕFwa�B����#�uĶ�x3�C�$3W���[��RV��>�khI��iC˿��$
�O�v %�Ayzx�p�P3�D�¹���)���7�ꛯ%���
>x�炏u�f�����fڷ�eC��G��3��S`F��I8Q1�H�p��uq��7���
��X-���4����Ӂ����l;p���D�_]���n���G�h���"�!u�&`Y׈���
�*BO��"�IvMåq�a*[A��3Өw�ӻ�{,�j�Y3G�[8
�.�OS=�9x��P:�
-��3�W�����P�
�t�
D�O*^0�c�C$�G8)���/TЙ6��R=����r9u�9�8T���jc
-�Co���rc��cP�˦ܽ���O����/��3���Xئ�g�
`�}��=l�D�qI	 O�I\
�E�A�zS'�k`r$K�R�WIs�>B�$MR����HBk����B
�:��©�$`�Z��
~�
F3��� -'i��@��O
;[O��5�|�Y(o��
#0��l�>/�L��%d٬�J[�	�wȟI�@pc�M�l6O6����4�	5p���E�sh� �]��0��\3�T�*�n��?���H�������������k
�7�CB�.ܖ��{s�
���_#)C'���j�w11�<����
����P=P'|*z�[���.L	<N�1�˄s�u��./�����V�q�W�s at JJ��98����V�s5b&}(Zoy������$�b<6/���凭�k�/������
-endstream
-endobj
-17240 0 obj <<
-/Type /Page
-/Contents 17241 0 R
-/Resources 17239 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17184 0 R
-/Annots [ 17234 0 R 17235 0 R 17236 0 R 17237 0 R 17238 0 R ]
->> endobj
-17234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 303.446 188.41 313.976]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction_aa4959b6198e090d37abbd07085b74a30) >>
->> endobj
-17235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 273.623 197.875 284.527]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction_a8041e8b3420a554e9637e4dfcf43c2b1) >>
->> endobj
-17236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 244.548 196.159 255.078]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction_aa3b0210cf6bc4dc319d24d429518c61d) >>
->> endobj
-17237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.911 127.489 391.332 138.393]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
->> endobj
-17238 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17242 0 obj <<
-/D [17240 0 R /XYZ 89 770.89 null]
->> endobj
-17243 0 obj <<
-/D [17240 0 R /XYZ 90 721.073 null]
->> endobj
-17233 0 obj <<
-/D [17240 0 R /XYZ 90 704.201 null]
->> endobj
-17244 0 obj <<
-/D [17240 0 R /XYZ 90 704.201 null]
->> endobj
-17245 0 obj <<
-/D [17240 0 R /XYZ 90 534.401 null]
->> endobj
-1957 0 obj <<
-/D [17240 0 R /XYZ 90 431.313 null]
->> endobj
-478 0 obj <<
-/D [17240 0 R /XYZ 90 423.742 null]
->> endobj
-17246 0 obj <<
-/D [17240 0 R /XYZ 90 322.843 null]
->> endobj
-17247 0 obj <<
-/D [17240 0 R /XYZ 90 322.843 null]
->> endobj
-17248 0 obj <<
-/D [17240 0 R /XYZ 90 262.211 null]
->> endobj
-17249 0 obj <<
-/D [17240 0 R /XYZ 90 215.181 null]
->> endobj
-17250 0 obj <<
-/D [17240 0 R /XYZ 90 163.794 null]
->> endobj
-17251 0 obj <<
-/D [17240 0 R /XYZ 90 100.212 null]
->> endobj
-17252 0 obj <<
-/D [17240 0 R /XYZ 90 77.486 null]
->> endobj
-17253 0 obj <<
-/D [17240 0 R /XYZ 90 77.486 null]
->> endobj
-17239 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F22 2996 0 R /F110 1507 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-17274 0 obj <<
-/Length 1908      
-/Filter /FlateDecode
->>
-stream
-x��Y[��4~ﯨ��D=�_��ZX`�-O
�2mf��mJ��e�=�v��Iڽ		�r������sq0�bz7�����[�~3�\\)65�H*��۩�S�
�V�W�2�}���I���0˽����O����&O�?'>�)�Rz��N^���+x�=,̌��q��SN\7ӗ�_&8��i2b�A���	FZ"�H:#�ʷ�MV�V��+��T
-I���_��l�oT��|�m�tF�I�{����}��:�
!
qe���F���a���X����
\�Xx��d�6[\�'���>_��������Ǚ�Ќ�]0�}�2B����/���~�"_=,�u�Q\3$�<e'���fgO�5
-��f��JNY�Z�vy�/S"���7��1J���?*��6
��@bX �ZQ$ا�vɭ�M�8�I�o�|��:r$��c�L�{��(E��EGDͨ�q�t%�Z��W2��9Œ�l�
-�~����W��`1�o����eV��
7���gw�H�j����x���&���y-�
-+��m��_�|��C�w��
׈�&�#�
Yr���n5"�H�����o�z��a� ,sl���۳�Z�5l�6Cq����[�o�i�"x`D
�sz���և�e���}_�FÄls(j��UW��x
��0��0��=� ��CX����U+X���K�_GSX�����	I0�:��$ꤤ���@H�f*1�,'NI���X��|"6�a��v�v�RDRx��j�(������)�8P5Ÿ/Nk+��#�=�\� ��p9�D�QKA�9'^��r�
,o��G�1��H����õ=�]+R���x�`�C�ZiЧe�X�k����M���C�_n���߸"�~��w�N�W�̲����m��)ɛ�`�
c��/� os6g�%���
�"
�j&����7���v� �x�Q�oj�
��hU7
u��f�("��
-,�S>��Y�A��Q�H

�p�8Ȫ�
�P��|����k�ϣ�{	�\���ҙN
�?x؎h��Z�G�ð��
-W�—�Ê����eif��1�C(Y��B��ge�\����}	�rӅA_ә"(҂
۰.���7M_qu=܃�
�<[���i��-<��Z
���6m�fDi۬���K�z6��
`�ϭІR)��
�!8H�-�$�c�����.c�
-�՘# ���t%�W[Y���‰�{�"�MU���n��l���P��&J�.Z�������4tO׎)�=p�&�a���n�yX���]J��%���ѽ'쩥��3޼Q��k�v�ά��nF�LV���
��
�\; ����
��`��3ѢO�XU���g�;K!��
^8J���2�,��ޟם)7�ޙ̹rG&- #% �]c��ν.Ov]@��R Xpw�¹c��������޻�af�����R �~9�օ��ج���� ����n�-��@'��xc9(>�J����J�
�����U���5�4�	�s�)uT�<�cG�D�y;�<�߂
B��4�chx��
�x�L�tz���Y٬���pNP��7���I��!{W�t��u(`;�n]��k�f1ػ��4l��Ѫ�Y��p�Pܥ��Tȗ�=��jD�q�
p[�
�
5x��
�R�d�pv4����֜�i�U��Zr�w"G���7��̖��eU��;��e��4��!zZJ��<�
i����?��^2�P��������(RP!����D�̄ѡp�D)ZN���‰�����@ެ�~:d�A;�������_y�Y*DRs��l� m]}`#�����М���'d�iA7��y��h��a���>�#��Ը����������!�ݡe�
2�Cm��mn�@��.�,v���k�:�ox:H
-endstream
-endobj
-17273 0 obj <<
-/Type /Page
-/Contents 17274 0 R
-/Resources 17272 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17184 0 R
-/Group 17255 0 R
-/Annots [ 17256 0 R 17257 0 R 17258 0 R 17259 0 R 17260 0 R 17261 0 R 17262 0 R 17263 0 R 17264 0 R 17265 0 R 17266 0 R 17271 0 R ]
->> endobj
-17254 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 17279 0 R
-/BBox [0 0 456 130]
-/Group 17255 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 17280 0 R>>
->>
-/Length 509
-/Filter /FlateDecode
->>
-stream
-x��U�j
1��+�Z��.:
�@��$
9Ƴ8;���wI-i:=
��5���Su�բ~�o�
D:Xl��
��_� ?Owp�F�{��o���E |�߽���[AW�<��#L|`
 �y�����Jo"*X�
�ñ�q`��3���h
��Ť�$S�Fe��[WL}���a|��zƽ������ϫJ�1�u^M
-�m�4?��
πW�!
�fK����r�$?b��u�]�v�pt�B��
$M6�SI{�C�ar1D���V��JD�=/M���$���Y~d�Q{�=��~�Q��n:A���¢��F��Ct��{8�r�-�4�2�mmiu�Ԟ��f��(�u�KM��-�֨��Ƶ�:N����Q����5�{�s�;iIwJ��3��A�]r,��%�+:S4Up��#z3៖�)=
]N��xOO�-=����
=�������z�i���^x\偦PZ�.�@���&��^�
-��>����3f�~ ��
���6���.�i:/�W�x8��
-endstream
-endobj
-17279 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-17280 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /WGBSWX+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 17281 0 R]
-/ToUnicode 17282 0 R
->>
-endobj
-17281 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /WGBSWX+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 17283 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 667 556 611 278 556 556 667 500 556 500 584 278 278 500 611 278 584]]
->>
-endobj
-17282 0 obj
-<<
-/Length 17284 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mk�0����
��E�� B�^<�n�b2n�Ct��Ƽa

(<Nf2����=wf\Y��fu��
�ю�������I�`zTk��V��I�/۲�ԙaN���>��nc�'=��0��7�ɍ��_�
>]n���DfeYҶL��˽H�*'biH>v���u;���
��%&s��fM����4WJ�̯�5�_mBF���i����
۹ߞee��*��T �A%�P�X��@��r�{IP	�AH*b�X�B���(��x��r�j���WT���x�#���"V�_

��9��x:�r8p���3���ï�������O���_N��M�W���}���9?Bax���S3�Ϸ���_Ǡ
-endstream
-endobj
-17283 0 obj
-<<
-/Type /FontDescriptor
-/FontName /WGBSWX+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 17285 0 R
->>
-endobj
-17284 0 obj
-362
-endobj
-17285 0 obj
-<<
-/Length 17286 0 R
-/Filter /FlateDecode
-/Length1 2708
->>
-stream
-x�UV{lS�?�q��81~5qpn켃��G��<�
;&6I�é!g�	�
RV
�:�U+ڲ����Mڦi�`҄:VMc��?S�t[+1�Z�`�Z�z�{�@��;�~���
��wν�c٬�q�ܓJ
 ��猭9�����O�j�
-�G�V�ܛ�������b͛Ă��|-�v�����9�Q��Г�ON��I0v�"�/���J�
����X�A�s�1>��
-90Qo��mz� �J]4!���*��n�
�nv�l
cd�Ԑ^��\f���
5�'g�o�R��!��Z[0�v��Fg�|a��srv�U���[Ys3f�.�Io]>�F(sTȃ�ݜ�k���ve�l�˻�t*�ٯ� 1^��#�+�Աx�hN^��������M�h�`��@��f��)}Pŷ��+C�.���� ?;7K�)*2;*��ﻫ��m]���
~�
IG&%��ItY���B�m�y&���q��Q�=�(�k챡�eky0˻��W?t�ʂ�D�}���7&֋�3�6VGj˃]�34��E6I�Wf����������
S�l
޺�����
�Ӌ$!~.3�q�2v^K��hF?<n�
{n������H��cG/��{�;g�њs���Tj$1-�"&w��f@�brˡ˿���kYQ�
��6R�:9�X__h���m�ծ�\�tzjmPc)�r��d��3�2`~���_��^m�j	G��`cϮ(��9�S� }��J�Z+�B�FV˜�f� ��#�`����6�`x�$͓�&:!�
-�
�>~"�-4I��A�����l�l���
�7-�Z���5���x�E��̊L��Gq�qÿE�BڏP�(��~��#S�W�c���HDƫ����S���|���ᑙ���
���	~�2�6�M�sJJ[��pV9kE��VΞ���$x^�FA��\���d&?/0ȃ��ʌ�+'G�y�I0<�7�i29w4�K�km��_�}��
�ч3Wffv�d|����Ub�q
����]J*�s"n��bN �j�
�Fʠb��$(���R2u*��^U!����������~�s�gh���]��ˁ
�����U�p��
5;�UWY���~jϷ���j�U;�5�l+ٴ��t��iR����gx�G�n"_pɶ� p)S�^��A{ds�pt���v�k�~:+���1�*y��n�9��
�_
�E� �P��_�[���ҥ��/ʧ
�(12w��=�I�7X
�+J�]]Q�m�^/6duf�Tҙ�W^a+��xkxtG���Vvl�B�-a�{��
���~9a�S�go��Y%c�6zP��˷�(�ˑV�����#㻛C�c�#��;u��f!hk
��[{���ǎ�p�G
-��W��c	���nM��R��S��e���<�v���H�/�
��qz�z��[��
��{2قA%Z|"���8qj췿
����Xܿ~��^���>[3|���}Lh�j>��L%ٛh��B�X�c�Yo����·���'��L�
����`s)e
l�zn2]
��*zV���9j£�ӿ�M��	��^��;����Wg/)�5�ۚ�b�XMy��5:в_g�ե��f��i�c7�%S
��4��ǎ����R�l3�k���k�Uwk�r7j��6A%ZI���+�3g�x��Oe��}�r+�{6�
�Ǜ�
K��
}}�H��{,)����	
��)
LN
-�Mɹr��6s!_k&_2�=u��V�B/!引�37�J�����Ͳ��0f�+�6��Y:-�

�Qf�R��?
7�Y��i�3�x��p��-�p"����,�	��
/a�l=��
i��ϗ7��
�<�m������2�T��2����F�m�lH��o�Zڬ�ry����
�7�0�e�b
*?���;���'��
0#���*!E��[1{�̦�׉g?�Æ��mK�>��z��+��Y
~g�q蹰7�y ��\p��T&u—]��#C)��@�BEY<����ڀ߳ކ ���75�k�M
oM͟�A�Y�9��߃ܖ�#��6��
�\�s��\ò�o�67
-endstream
-endobj
-17286 0 obj
-2032
-endobj
-17255 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-17256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 225.598 224.395 236.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 202.664 189.925 212.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-17258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 202.664 260.898 212.591]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5cd04912407d0b7f7c3e4bf9becff0bf) >>
->> endobj
-17259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 187.108 422.545 197.014]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 161.921 224.395 172.825]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 138.987 232.982 148.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-17262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 138.987 347.013 148.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a1e3eb354a88609b46573e1dc2ce6dba9) >>
->> endobj
-17263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 123.431 389.11 133.337]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 98.244 224.395 109.147]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 75.309 254.671 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-17266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 75.309 390.391 85.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a11a03a73950216b9010c2350cf5ea7e3) >>
->> endobj
-17271 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17275 0 obj <<
-/D [17273 0 R /XYZ 89 770.89 null]
->> endobj
-17276 0 obj <<
-/D [17273 0 R /XYZ 90 628.424 null]
->> endobj
-1234 0 obj <<
-/D [17273 0 R /XYZ 90 528.6 null]
->> endobj
-482 0 obj <<
-/D [17273 0 R /XYZ 90 521.869 null]
->> endobj
-17277 0 obj <<
-/D [17273 0 R /XYZ 90 254.507 null]
->> endobj
-17278 0 obj <<
-/D [17273 0 R /XYZ 90 254.507 null]
->> endobj
-8340 0 obj <<
-/D [17273 0 R /XYZ 90 191.094 null]
->> endobj
-8343 0 obj <<
-/D [17273 0 R /XYZ 90 127.416 null]
->> endobj
-17272 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F60 532 0 R /F75 554 0 R /F93 763 0 R /F22 2996 0 R /F67 3037 0 R >>
-/XObject << /Im26 17254 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17311 0 obj <<
-/Length 2048      
-/Filter /FlateDecode
->>
-stream
-x��Z�o�8~�_����
���8���,��=��S�0[I��%�,7���7)Y�eǾuz/}�H��p�o��q�����?���ɂ����}�@F	J��"�4$)��x8		
&�*�MB�����1]���CvW&��x|�]�n�ERe��
���짯�2$j�n6Y���O��!����
a!��Z�f�c�Ay3�f2{�Wi���R��MCɇ����81��E0"� ���&�bX�
�
;A\�F�����fď�d�	GT��4��0]��I��'���L;��GLFb(��R?M
���}��*���~��
�`�b<ՃV�
���v����u8c(�7⵽4FX�@lD�.��}_��z�Fo��x�J�f�숒
-�9�$"Q�E�Js
�YQ�AzcT@>dy��
��`�h#�!
3/��q܆�
9ȪE
�[��ߏ?�OF���
N&;�l�	b�� l�
0�(�F��![�}�TxbF�G�a��2��
\[k[K{��0�]6N��.��d��3�N$pM�HM� N�sF*"�
��'�R�����c5�+��(�`�;ۃ�=��{�S�#9>":�	9�:��:㱫�|��$E��!y$��!����p<4�[@q���Q���K=�ˬ�>#�=�f>��](��l�Q5�-]ݥ������
-4mz}�#&B��l��R�8��byx�$�`��Hٟ���~�
<���2|Ծ��Te2�f�UQ�
-��^��٘OӲ+�u
Uԓ�W��F�qD�i��G]l����u�p6�?4q�xHOu7���晹&��}I�'�m78��m
-�~z9�b���qg�f���S]�9Q#�0��m��K�F���7:F�����7'�e�(FBq.�O�zc���h*�����Z��Q�dU�٦�Ʉ�z��U�}��DQ��G�@�Մ��Yh��
Va0TA�����έr;$�I�y�6o�! ͵L d
�u/�5�Oǡ�5{	�������1�@�� M#����h��IH��%�
�
�8�U�&Ôu�9�:����<�e�R��Wm�
W9��t��TAAJ��i�g�W���1O��Y'�`�R����#�;M��l���f�
--�cf"dE�0
�\���E�h���>�a�"!Z�|��<� Jv�%�O��f>����$hĺHR�'��	ݠ���
�@B"�[��c![\O�4����ux�rR�+�9����"ɍ����Z
kt�I㚦%mz[��?�fs�zL���0)�M^ؗ����ˀF)�sƮ�6��P��I`L���A����:xP�w�D���nD���7��
R�[�x�d�Zb��ħ)�
EH��C�1�*\F?�σ�
����kuy��<�/�D�N*�촒H�
]^G�����S��[h�d��,�H���߸�}�+��wF�K1�������k}]�w{߯��������٤w�cfWS�;�8�}g����+��
-�
f�mҽ]�r��t��,M��>Lˬma�
tD�n���ob��DD�y⻴J�e#�y��+��$�}����1$v'H́������B@��鈂&���.,���QX���y�9�s���E=����~s�9R�DSCd_?�'X]B?%
-�-
�!W��T�}X��S�)��Rı��PB �G�g����k���Z��$��>�ޟ�jń�Ą�C��	MBF��R'�9=߷�S�0��\o�`�X`N�u�͉}�R�? ���MᅴK�{�S�	�+:c3 at K���]����ڒ(&��L`
U��������cU׺]�#%M!���
-�U��Sh	`"�KX@��d���Kz��D� �_�
��i��8LEp+�_�
l�I
��l[��ڳ�4�
-;7��6;KM���&�}�
����Ϩ��&v�OKjgDΖ�,��>m��&���ߛ��[(������ۺk�{/5p�r���d6�n���������Uo���D�E���XU������a��h^��}ߙG��lW
-�Y�hvM�q�Q�d�G�	�"�x��4&�Ғ�#�����C������
-p���;�3&:
-endstream
-endobj
-17310 0 obj <<
-/Type /Page
-/Contents 17311 0 R
-/Resources 17309 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17325 0 R
-/Annots [ 17267 0 R 17268 0 R 17269 0 R 17270 0 R 17287 0 R 17288 0 R 17289 0 R 17290 0 R 17291 0 R 17292 0 R 17293 0 R 17294 0 R 17295 0 R 17296 0 R 17297 0 R 17298 0 R 17299 0 R 17300 0 R 17301 0 R 17302 0 R 17303 0 R 17304 0 R 17320 0 R 17305 0 R 17306 0 R 17307 0 R 17321 0 R 17308 0 R ]
->> endobj
-17267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 708.28 465.458 718.186]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 682.207 224.395 693.111]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 658.297 181.207 669.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-17270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.706 658.297 243.464 669.201]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_aaba6bdfeae05d8463a8208b0c6b7a62a) >>
->> endobj
-17287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.518 642.833 420.593 652.738]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 616.76 224.395 627.664]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 592.849 159.628 603.753]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-17290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.127 592.849 200.306 603.753]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a74fd79622aa9418de9e842a0d72bbcbe) >>
->> endobj
-17291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.102 577.385 400.176 587.291]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 519.456 169.81 529.986]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5ac67f2c19f4e1d46eb4d81e280aa581) >>
->> endobj
-17293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 519.456 309.485 529.986]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-17294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 519.456 514.653 529.986]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-17295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 507.501 227.553 518.031]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-17296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 477.545 169.013 488.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a768d2ac67126a0515bfea7d2c4d225dc) >>
->> endobj
-17297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 477.545 306.566 488.449]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 408.88 258.832 419.784]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a7ea3fd6cffaa3a413e3c2734a43bf28e) >>
->> endobj
-17299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.453 408.88 372.937 419.784]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.56 396.925 274.045 407.829]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 370.179 266.581 381.083]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a726c33ab611816cd9b55a61621488650) >>
->> endobj
-17302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.699 260.014 156.064 270.918]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_afc1df08d5b8acdcb47dc8ba11cf9ed44) >>
->> endobj
-17303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.663 260.014 293.4 270.918]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.219 260.014 513.996 270.918]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 248.058 191.18 258.962]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.699 206.521 156.064 217.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_afc1df08d5b8acdcb47dc8ba11cf9ed44) >>
->> endobj
-17306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.663 206.521 293.4 217.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.219 206.521 513.996 217.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 194.566 191.18 205.47]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
->> endobj
-17308 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17312 0 obj <<
-/D [17310 0 R /XYZ 89 770.89 null]
->> endobj
-17313 0 obj <<
-/D [17310 0 R /XYZ 90 712.265 null]
->> endobj
-17314 0 obj <<
-/D [17310 0 R /XYZ 90 646.818 null]
->> endobj
-17315 0 obj <<
-/D [17310 0 R /XYZ 90 538.919 null]
->> endobj
-17316 0 obj <<
-/D [17310 0 R /XYZ 90 495.648 null]
->> endobj
-17317 0 obj <<
-/D [17310 0 R /XYZ 90 426.283 null]
->> endobj
-17318 0 obj <<
-/D [17310 0 R /XYZ 90 385.868 null]
->> endobj
-17319 0 obj <<
-/D [17310 0 R /XYZ 90 319.085 null]
->> endobj
-17322 0 obj <<
-/D [17310 0 R /XYZ 90 156.423 null]
->> endobj
-17323 0 obj <<
-/D [17310 0 R /XYZ 90 156.423 null]
->> endobj
-17324 0 obj <<
-/D [17310 0 R /XYZ 90 93.014 null]
->> endobj
-17309 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F93 763 0 R /F67 3037 0 R /F60 532 0 R /F90 758 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17332 0 obj <<
-/Length 3243      
-/Filter /FlateDecode
->>
-stream
-x��[mo����_��@{�����K�)�6Q��v�X)
-؆@�(��Q!yr�_���,�w:[�:}8�\���<3;�3���'ߜ�����bI�RIerq��8Q<EB��ɫ�z��⻄I�H*�-{�o�xq���������'?�x��&H�d�>y�'�p��#���
�N8e�[$/O�y�=/�/��\��!��s�S�1Oa(厛�9׳|}WdM>_P�g��;u�U�:o�jNȬ��N(�ߧgrH�(�O\!I���Ȓ�Z�g���f�e�յ�����
x��~�L�C�\#�
-�����
��ϊ�
�
�j�E�B��Uy�o��Ӽ�$[�lV��;-�+KaN�,+<��:��J_P���:Y�R!
���	지��n�lٸ���u�ڠPJ
�S�0�N��dZ��dZdi
�嘫��
i2��YY��&"F*fQ1Zr�!9{�1+�f�y멗 =wy㦶�V~�#�v'PLQ�E(�e�YVy��_h#���P���JS?��&Ϫ���m�q�`U��v�.��,�J�����jx5n1#�a�+��h���^΄*A<mżr��9Gwj���`h��
��]*O�܏��D�b��H����%q���86�e�%F�c�!�hbT�<��	
-�`i<�F��)ƒ�@�
-�d��ls
�I"���Ud]�N��
-���%
���L�d!V�Cڠ�3;PWv?��nN�t����5�
�v�;��t�pM�����wZ���w���Ŝ>�h/st�r
�

�O�ʻ�ʚ�rϜCrO=��GI@)W��������g��-�@��<<&i�F�#�WH�=E!��N_ ��r�/ �1enp�-��(, �آF�O
-[0�˃���?�D�'Z&C!�&*��$�>hqD
�EF�Rf���R���0b��8�gl4�K���+�G�}���H(���� 4�PJR�P-_F�)�sh�eg�G3y�b0�K��]���؛�o���`&��qbbCqI��
W�y��
�Q��Ts�7
-���}>%>l8S/
-hft��)�(
�uq���F6���
P]0��߬L�t?'b�o�=����f.G�k0l�[��S�B��� ~$q+�

�DFQ[����ш�����.�p?�r}W֫&��lV7s�9*O�I��ĸV,�2��2�nԆ ݰט��z�1
-b#&��������/�
"Վ9S��6�0%�sO���#����Q%
`��s,�������孬7 ݭ�n����0u�Gt�T Z
b|O�YDh�=���� �
�[s�>���=f
zncZ�,���O ��9�
-4�]tSEi ��>����boR�tJ?5x&��
�5����ؽ�?������t 
��`�_�
�
2�~�����q�F>��>��yb���D
Yi��p��Q0�U��Q09T�釯�nT��
-��o���X�L @�ݙőu
-���
uc�J�1����Sbjj<]bOIvc����_�GÎ~^حo"�#�S^X�"4Ȝ_E�Z��
T"ǢnƁ
� ���1F8�'x;��R"N̹�:���m�
УQ��e�"8m�!
6	����
-�i/BA����]gI}��\�ɲ��ɲ�2��p�W��ݬ(l����Λ���FM�C��7?|oJ�a&�GAg�+�^����������i���>_��w�pW)���̫�����h�L�::�E��)bEG�
ɍ��ːF��!{�1{
5X
EQ�N��U��eeon:���
,�n��̸��@� 넱4�]�eXh5��xT;@#��d�����z�c�("]��
 ���=��Wy�N�ζ�e_���\n���qu��=�Y��3L��'��[D���v��O^�x��2��lm����|�1D)8`إ ��}C�8�vM{���pj���Ve{h�
��o�"Ha�>
-�"	
5`��'�
�9�� �0��s=�-s�M��vÄ�#�;�9�abPԅ�We�H�JFR�A�sS6π�����YY��ͯ��5.��и�����zz�r���
վ����γw� p!bX�R��I(�Ƒ���a:����ܳ���Le|Ё�dR�>M�2�*r�T;xʨ 8涸p68�Ҕ���d� 
 �����,�[Xf�[�iJ'=Xu1u�ܨ#�`������/}\�4
�1�Q���q��v�*8X�W�
k�#-؁� ;�) ��0Cvp3Q�%ԍ��� 0�.��i��^����\+��9U
(0.cl��
�W!CE7S���a�b� �Z(}�������E�.���B�H��S"1<K�z0��  ��e[41��"w'�8a�=F+�7�W����fś}�bU���ļ
u��
-��^�R�����r�y2l1�ⶑ�	c��q�K���Y�udiTJHLba��%d��	A>ZB1j��[�M$�# LJ�-_,—I�:���U
a�H��9��lX�����<�����ľ�ה�vK�|vx{uHa��=4��
�*S���
�Ŵ�|0駝"�"
���Fj8��*���l�c`"aN�`ڵ^7�Fws����-6��x,Ga?<x۔������b�^���Y���<�T7I����{< 
}F ��]�#B�ԥ�m�����q
��3d�"�mڜ�<
-C��n�ÔB�cb��3:
I�8#���&�'
-�����v�|A�c'��!;
����ʜ����G��[��E�G�G��a�X�X�M
�ϛm��s�љ'R�~qۙ�T������@��.�y~�_?�}�C	�
_o���Qe
P�@�z��}D� )8NSa�
�	�^������z��p�ܶW���"��
����
-���a���;j?�z
c� �uA�ͪ��K���
Ԇ�>	19�
������wsݞ�0�FT
C��at�!��^^�J��f�������������*skf�˲��a�M�+9�X�q�T-Riڟ�.���oo
-l[2 x��Ùy�>ٔ���(�	\�A1���?��
Q��lԗ
-\D�m�6�<����)6ܸʽ�V�K
1
��q`

VQv藖��B"�!�O�
��ڂ �
����
��k�|U�d�t
�o�Oغmȶ���|�U�:���k��?s?�y��d/���fۆ���Ɓ��F���gA�
R���h<�?vl����?��Mtt�4w�O�^m߂�E�8M����\�����j7��
�ݷ���Dy��v��
-endstream
-endobj
-17331 0 obj <<
-/Type /Page
-/Contents 17332 0 R
-/Resources 17330 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17325 0 R
-/Annots [ 17327 0 R 17334 0 R 17328 0 R 17335 0 R 17329 0 R ]
->> endobj
-17327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.089 389.055 513.996 401.011]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-17334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 377.434 126.862 388.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) >>
->> endobj
-17328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.811 377.434 513.996 388.502]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-17335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 366.326 126.862 373.972]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) >>
->> endobj
-17329 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17333 0 obj <<
-/D [17331 0 R /XYZ 89 770.89 null]
->> endobj
-17336 0 obj <<
-/D [17331 0 R /XYZ 90 352.752 null]
->> endobj
-8370 0 obj <<
-/D [17331 0 R /XYZ 90 329.528 null]
->> endobj
-17337 0 obj <<
-/D [17331 0 R /XYZ 90 329.528 null]
->> endobj
-17338 0 obj <<
-/D [17331 0 R /XYZ 90 217.447 null]
->> endobj
-17330 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F8 794 0 R /F1 833 0 R /F10 765 0 R /F13 834 0 R /F29 938 0 R /F7 795 0 R /F24 529 0 R /F35 1248 0 R /F99 5346 0 R /F117 2446 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17345 0 obj <<
-/Length 2261      
-/Filter /FlateDecode
->>
-stream
-x��Zێ�6}�WX k1��"��L:�\��Ly�4�6��l9�<=��)^t�,��h���e�.
OU
���G�O�����HX��TDWw��Q+�|[F�S��T�9�O/gO�b��\�(��٧�^��O��"->�|y�*fDNs3�!���lN9�~��e�.��;m���~%,alʹ����a����	`8"G�����{
-��FL����D1e�Eo'�LpwN��D"�M������X� ��\�]��]^���
P��L/�7=#|�q��۴�K~�>W���郙x�wQ#Jൈ
-]�ʍ
�3����Ǹ�7�}����#�ӄ".y4'	4vc_ov���mUZ�:��޹o��D��֥��[�����r���
~[o���>� ii�i��C;S
-,k���
p��f��7���.>'����L�駝��M~�0�r�V
<�P�i|󕟦�@��	N�#��(7�͇����1 at M��"�x
-	b>.���.͊P9�z�tot�V���o���U�؛qD�
���9����"�\iXZxȀOC����'�x{�n 1?
BJ�bL#�Dbr*)RR5�h�0x2e	F��@
-L:���r���0@ �-D��@0D����Y,
��{��3
�b�Jƀ�L��������I��g�Х
2�x���n&�H�;�78�C�)�I�s�V�,H�>��~s�f[	��`3��
Ad����	;����
�|�
)��x,Pb� Ѧdr.#,Ub�
-�;@�2RZ>R:�$FqBG�y#!��
ď1���_�6��N�4i����SŐ�����R�Ṣ
-j6�)��a�KD
-��R�fg�BF���># `T�< ��V�!�<5
� Lx�(� ����kx�x���
-aٰ�!Po�Hj��
t]�������,C��Z����`��
��Ÿy��9D㎇u���ǽ	V8R�|�6�*�9�IB�B�F��A�b"��(\H�=�S5��F	<S�� �k� �ߠQ��Q8��&��s�� O�(c �%@�D�2
�Q��(G4
-�p%X��Qx
���j��%@�D�2
�Q�
�.>u�l�/��X�jzSm+͉��^ou�[#�E��5���,s
3
w�
�4�/�(fҔ����;Jy8�z�A��vZ�����ν��b�MuT�lz�P�L��l��$)�����u�!.��up�1,����J{9ct�g�0��@�c	��k!D��MԹ6�.Wy�
J@
-�(8L��� �o�i��%��"�{J��I+��h���u@W3��E���!s �)=�羵&m�^7Q��Z�
f�� \��}21E1�a#����.Ҫ�j��7=�mU at D5��ękY/�^6��v�z�__4�Xp�g��z����!��-Q��l}�6V�՜C��F��-
-Ԯx�{+�&꫶�oZ��������
�V�M�:��4}B�E�e�W�m�f�=a��,Fc<*��S@��v�
P��)~~
-S�w� � �.�s�)�
-Vf,�HAM�J_!q����$S(h���(zR�G�9|����ƈ ��[m����!��n���}"�`�����ِ��PҞ�ʃ�ɮٿڦ��TR`�I����סU��o���c��'�����(tt�?�U���=
u@�D�mws��O����c��8F�1'�!���̘с"91� �(�Mrob&~��O"�U�n��r7�i��[��Q�=K�{w����_��6flh�?5i��_�?M "ؐKa���ڊ���ť=���f��-��

�������d���N�	]b�g��
�o�y!5����s�3�
:
<cQ�b�`~���7(���f̈��7c������f
�6�&e3fl!��B�
 �}MµMoAYd��}�꾳7
���%��{ܯ����o׋��q���'O�:�!1�W_@�|���_��u�z�����Z�t^���`ꠁ
n,O͇uQ�������&.O���x�f��&] sl�F�r++w�o|=Tq�
��n�[愃V��r@�H���ƾ��R��m_����,�i�������H���JX�P[�`"N`o&{���!�?�$�3�9�6�7���O]�
j��3�;��Ewb�<���'��-��D��䪪v/_���ߗj�R�A�v�n��Կ�
?�����('�3TSP�	rZ{���yF�����������E�rpp[����`&
-endstream
-endobj
-17344 0 obj <<
-/Type /Page
-/Contents 17345 0 R
-/Resources 17343 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17325 0 R
-/Annots [ 17339 0 R 17340 0 R 17342 0 R ]
->> endobj
-17339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 690.333 501.708 701.237]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-17340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.418 91.886 204.56 102.417]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable_a14c081beabe1e165b1dc44b2a84b6c2b) >>
->> endobj
-17342 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17346 0 obj <<
-/D [17344 0 R /XYZ 89 770.89 null]
->> endobj
-17347 0 obj <<
-/D [17344 0 R /XYZ 90 676.759 null]
->> endobj
-17326 0 obj <<
-/D [17344 0 R /XYZ 90 654.382 null]
->> endobj
-17348 0 obj <<
-/D [17344 0 R /XYZ 90 654.382 null]
->> endobj
-17349 0 obj <<
-/D [17344 0 R /XYZ 90 584.284 null]
->> endobj
-1958 0 obj <<
-/D [17344 0 R /XYZ 90 487.077 null]
->> endobj
-486 0 obj <<
-/D [17344 0 R /XYZ 90 480.477 null]
->> endobj
-17350 0 obj <<
-/D [17344 0 R /XYZ 90 404.939 null]
->> endobj
-17351 0 obj <<
-/D [17344 0 R /XYZ 90 355.678 null]
->> endobj
-17352 0 obj <<
-/D [17344 0 R /XYZ 90 319.109 null]
->> endobj
-1959 0 obj <<
-/D [17344 0 R /XYZ 90 217.731 null]
->> endobj
-490 0 obj <<
-/D [17344 0 R /XYZ 90 210.628 null]
->> endobj
-17353 0 obj <<
-/D [17344 0 R /XYZ 90 110.909 null]
->> endobj
-17354 0 obj <<
-/D [17344 0 R /XYZ 90 110.909 null]
->> endobj
-17343 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F90 758 0 R /F117 2446 0 R /F22 2996 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17371 0 obj <<
-/Length 1596      
-/Filter /FlateDecode
->>
-stream
-x��XY��6~��P����KR�� �́�۬�M�@K��F�#ɻ�ߡHʒ�v7��}0H��p��7�����'��g��ǁ�D(���N���E���/qގ�����g�燈D>�j?��~5{�jv��F�f��#C�!Z GA�����{�$�������u;)w��͜��/#lt�}�|�Ӊ`1/tB!Z�w��vs��y;���Ҫو�
)������LYO��( �L�מug�  v�lU�.��k�ౘgrW�1�~d0f۳Ǒ� �gJ��R��	����܀��AZ����j7e�B�HKF�+��i����x� �c(�L�%�"�`@�lD��v�!���*]7iY
���� 14V����ְ��)����ԝ�����Y }�ϡd� �p
-qڊ��/�Zč�7�Խ8��R��M��	f8-�FM*iGnt۬J+c��i����L)U�נ&�@��,�Y��MQ橶
�Y�5�K�)��DEܜH���Ҥ���kY4���Vjc�'-\�v) 
��:��,�W�2kJ�H(��]��E�잔�&z�ee�M�5;���������H�
+�2�9��2mm���
L39
�
��=�>
-�ฃ��Z�9����
`����,�\ ��.\�Ƣ��� F8�	C��}z,�y��A���5T������5~s�zt\f��㛕L�=*P
*>��>��/ZƸ�p|3�>�י�0����M��UR.�ә&,ĉsC辑
� +Y��X̘������Q���J֠N�Q��HכLl��e�6�"ٕ�[
����Ը�j��;�c����MZ��&�z&���L� �7��=��b��
9
G����̣ 1BM47Q�b3��4��x)�y���xS�ʒ��
4̮������N��
g���
-��̃�}F�i�8�c=k�ER��T��0D<v��d�e]��	՟s�s��M뚵�Ö�)6Ƭ��o7�D8�/G}���K~R`��f5`�nXHcM�ӑ�`Оh1i��
s m6u�
-��l�b���ǎ�U��=`A
-�¦�ؑU�
D�nT�3wc�Ⱦ&�ʴ�����
.��0�������.�r �z%
�Q$I
�/��=��NtO"36QZYP%
�k�|o�#����*C(������p*�4�|{�5����!��r@���o>'�=H4�Ua��s1"�����2��*���
-���հ7#B���;-��mE%:1�Կ�TmP@�9��
�
�I�w��� M�����̛J��Bݏ����(�w6�BG�|��I�'~ۇw�=�*���/��I��${By�wǴ�O��W��.���'�3�99!o�[3���s��(d'q��ǐ6���rx�}RLe
�q�yYflj���Ϊ�++��Pw,�ś=v��y�U*
-��$t
-2 ½�V/2��'0޻���	�߻��o�u��OQ@��>+�� �}����$h;�ﷃv��p�4���%ۊ����V�}���`�0��Z�{U�ߩ:�KQt����4��3 A�?"w.�MTZ����G�DO�66v�e�4����|�b.Q��Ȑ�Z"j�m�$�˪c%|�[��]���m�
-endstream
-endobj
-17370 0 obj <<
-/Type /Page
-/Contents 17371 0 R
-/Resources 17369 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17325 0 R
-/Annots [ 17341 0 R 17355 0 R 17356 0 R 17357 0 R 17358 0 R 17359 0 R 17360 0 R 17361 0 R 17362 0 R 17363 0 R 17364 0 R 17365 0 R 17366 0 R 17367 0 R 17368 0 R ]
->> endobj
-17341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.413 708.331 194.963 718.861]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable_a5024cc2b142473f5f733a8808cb09162) >>
->> endobj
-17355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 419.903 136.585 430.433]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a67d50389960334cc0cddaf9e18cae713) >>
->> endobj
-17356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 389.269 136.585 400.173]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6137f32f30cd8f8c6081c20a5a6bb200) >>
->> endobj
-17357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 359.01 136.585 369.914]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a833c9f70c384faeb871fa267cca49df6) >>
->> endobj
-17358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 328.75 167.648 339.654]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a249e8899494cc9ee79d69b7b5eef475e) >>
->> endobj
-17359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 298.49 190.891 309.394]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a1d613c80931007bd46f479582f90542e) >>
->> endobj
-17360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.344 282.688 494.695 292.593]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a249e8899494cc9ee79d69b7b5eef475e) >>
->> endobj
-17361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 257.272 136.585 268.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
->> endobj
-17362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.325 257.272 193.75 268.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a2f9b37006a7b28800bf7c2aebb7e331d) >>
->> endobj
-17363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.087 257.272 243.762 268.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
->> endobj
-17364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 227.012 136.585 237.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
->> endobj
-17365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.325 227.012 191.25 237.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a993b094f35284bdf86bfc6a06ea69649) >>
->> endobj
-17366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.587 227.012 241.261 237.916]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
->> endobj
-17367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 197.126 150.493 207.657]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6018819ab591dad51060b4d01d989374) >>
->> endobj
-17368 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17372 0 obj <<
-/D [17370 0 R /XYZ 89 770.89 null]
->> endobj
-17373 0 obj <<
-/D [17370 0 R /XYZ 90 721.073 null]
->> endobj
-17374 0 obj <<
-/D [17370 0 R /XYZ 90 677.646 null]
->> endobj
-1992 0 obj <<
-/D [17370 0 R /XYZ 90 549.959 null]
->> endobj
-494 0 obj <<
-/D [17370 0 R /XYZ 90 541.881 null]
->> endobj
-17375 0 obj <<
-/D [17370 0 R /XYZ 90 439.705 null]
->> endobj
-17376 0 obj <<
-/D [17370 0 R /XYZ 90 439.705 null]
->> endobj
-17377 0 obj <<
-/D [17370 0 R /XYZ 90 409.437 null]
->> endobj
-17378 0 obj <<
-/D [17370 0 R /XYZ 90 377.452 null]
->> endobj
-17379 0 obj <<
-/D [17370 0 R /XYZ 90 348.918 null]
->> endobj
-17380 0 obj <<
-/D [17370 0 R /XYZ 90 316.932 null]
->> endobj
-17381 0 obj <<
-/D [17370 0 R /XYZ 90 275.714 null]
->> endobj
-17382 0 obj <<
-/D [17370 0 R /XYZ 90 245.907 null]
->> endobj
-17383 0 obj <<
-/D [17370 0 R /XYZ 90 215.194 null]
->> endobj
-17384 0 obj <<
-/D [17370 0 R /XYZ 90 164.716 null]
->> endobj
-1993 0 obj <<
-/D [17370 0 R /XYZ 90 68.334 null]
->> endobj
-17369 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F24 529 0 R /F93 763 0 R /F90 758 0 R /F75 554 0 R /F11 613 0 R /F110 1507 0 R /F68 3032 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17395 0 obj <<
-/Length 1528      
-/Filter /FlateDecode
->>
-stream
-x��Yێ�6}�W�C�sy��EQ��l�\7��%	Z��jI�$'ݿ�u�eNjA�"L)4y8sΙ������_gO�gW�R!
��;Oa/�
-�����`�H0'c��e�,��b�p��e|�*�-�����}7o6���
�T`��:�*;|��t��<Ѱ&!��"$�����׳�3��G,
-�"�%���'�-��
#����L�<N|��w��g�=FT4��=
�ERBPw>x$d�x�����!"DRJ�U��1T
	u�&�#
��E�(�3 ķ1݇@�D�<(�CH���a0�~�G3��!1"�<0$C�F0ܡ��
�;A���P�A�2~q��D�U産�-��%��
#�ƛ�:�K�P�\�AR�I���ID�mJ]Ui��
hH
0`@�(h6�!͓�v��L����B��ğ&֊��M ���~b
&�����~�I�&!N�7g
a�V/���L�q�6A��?�UR���|,���ƽ�4��]߷s�E��t^��yu�����֏�ޚ�kkV:o@:\we���j��z]T�_�|e_}Ę���(8�uę�������R1��a. �}j�7P�ܭ�MO�0�`aF�ba�Z�z������G��Yp�&6�ѹ��Ό�R���ؚQ
����2�Ћ+J��9���;V��V�n�u
-�R��UG]O-��49���Mi=�D
v�l�YǍƛ7��s#�9U)%��
)��	��@
ҹ�'q�����w.
-����@�Ea���»N[^��V���j�'��V��
�Lg�
I���I�j��ǧm�o�wA�y�f��/w�)��
��5o��/�R[���
Cn�OQ�!^D���3�����[�Ń㼶O�*Sz�Е���4"�
,�lbC9ؖ���\f��0�~<��Q�;e��g�9:A �v:�,J at R!5��Dt��
Cx +)���f�x�`s�+#i�i����=Lb�a�z=�!Av�
4zhA�c� )E]d[�'9#��
�WqK at 1���Y �E ;��
-	9�P�B��C8G���V�>�
o�ۊ֮�L%��^N}i<`���F�q�-�Cer�C�S�~�<�CҘ@�9��Qm�;�������(RR��) 	
U�N���)�ς �cb��Ԗ�z(/g@�� ��8��Myx�0%�������Tt�� !L��̍�0Db�y�͊�ߠ���Y��K`�	��3��A�Ѝ�\��(������ �\���ilY�~Z�v��۟8�)P��}ۘ,_��#}���_�'����]ZITu�M��If��ԓ[?�s���1��^�I�g�u��]{]��M���R��,G�/��k]����_�C�"�N����!
�h���֕��
�Wv��叁~ks��|��7]��i�3� ә�`��
�if
�Oύ^�
���Ȣ�\�������v��t�B	����PG
�;�Ί�=P����X;r���(p�S�"��
��$2
9���?�/�/.~˘��� ����7a�
-endstream
-endobj
-17394 0 obj <<
-/Type /Page
-/Contents 17395 0 R
-/Resources 17393 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17325 0 R
-/Annots [ 17385 0 R 17386 0 R 17387 0 R 17388 0 R 17389 0 R 17392 0 R ]
->> endobj
-17385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 412.756 226.029 423.66]
-/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) >>
->> endobj
-17386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.527 412.756 289.381 423.66]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common_a56b1bfd700c1f088b6be622b7b67a257) >>
->> endobj
-17387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 383.25 224.644 394.154]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
->> endobj
-17388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.378 371.295 208.82 382.199]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common_aba21572aebe99f81b7f09b75f3b2d903) >>
->> endobj
-17389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 91.916 177.053 102.82]
-/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare) >>
->> endobj
-17392 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17396 0 obj <<
-/D [17394 0 R /XYZ 89 770.89 null]
->> endobj
-498 0 obj <<
-/D [17394 0 R /XYZ 90 721.073 null]
->> endobj
-17397 0 obj <<
-/D [17394 0 R /XYZ 90 650.858 null]
->> endobj
-1994 0 obj <<
-/D [17394 0 R /XYZ 90 555.099 null]
->> endobj
-502 0 obj <<
-/D [17394 0 R /XYZ 90 547.492 null]
->> endobj
-17398 0 obj <<
-/D [17394 0 R /XYZ 90 432.555 null]
->> endobj
-17399 0 obj <<
-/D [17394 0 R /XYZ 90 432.555 null]
->> endobj
-17400 0 obj <<
-/D [17394 0 R /XYZ 90 401.315 null]
->> endobj
-17401 0 obj <<
-/D [17394 0 R /XYZ 90 340.482 null]
->> endobj
-17402 0 obj <<
-/D [17394 0 R /XYZ 90 290.731 null]
->> endobj
-1995 0 obj <<
-/D [17394 0 R /XYZ 90 220.312 null]
->> endobj
-506 0 obj <<
-/D [17394 0 R /XYZ 90 212.705 null]
->> endobj
-17403 0 obj <<
-/D [17394 0 R /XYZ 90 111.631 null]
->> endobj
-17393 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R /F11 613 0 R /F22 2996 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17440 0 obj <<
-/Length 1403      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�8~���)
3�,	�%ӧ��ζ�$�x�%�x0([.�s�_�؀����d&Ƞ������
��Ā�����ܳ� .v��@�s@\�+6nL�b���a�>@�+F���./��.���Y�Ӱ����#h 5�oDi��;4bq���
��c�)5
l��Ը��Ճ�0�Myі����!R\�ǖgN���c�C����e�E���:8w��B.pl��c|��n1&���M�@hr1iL��*��f�ĺ��o1��V���9����n�E<ɳ���=��w
	d<>=�/h��5N�;Ո���+�c!�̰H��t�b
���6|��HH0���>� r|���
��2'��ݩv�E�
-[��� @�-V d%�_i:��j�WS�Е(J���(�ZK�')��&����}|�'Ә)���&㡲V{JQX�gR6˳8�&�w�u��$����)aMn�,��ş���s��q6�ѧO�Dui�O� A?�����cd˝�
m�|m��Qۡ�d�r{���y���Z@�@z;'!cy����kج} �mhW־�lFtT�|-��M�/V_���x^X
{U�f�4g2�Jw��ő���*���^)pa
�>a+b#@P�c��3���K	Li��#��G����<����$��y+��U��h��
��RWe�j����a�gIL���b(҈�9�� ���e�<5�8-�_��3��Yh!hN俍���
���]���P<���l��|�Y�]~ye~��i$3�
~����Nn�
��2^�-�D4�!O����JC��OG�Q:D8�_�m�'����p�V�?r�A�;vO{W%���qQ�������\����jsM-S�o$�%r$
�F�H���lb�$��
���'ၥ^TI�{�
GS�Mb�(��V!� n����Yړ�
x>�Pc������JxC ���_S��{U�ܔ�c�sΪtuW	�Y�d\���!�+�-;�
�ޣ���hr;zk�-�=�x5ɓ�
mg�$ �.U�,��bM��ue���α����g��õGr
7X�¶�*�	��y���C^[�h��u#�y����v�:�.�}xA�͹:/��xڌ�,޴z[v*hk�x�~ ���_ʸ����~�Z$h
6�K�#!�g|	�\�x��]�N)c� �
,������i��J��UuG�)@�2�cZ�o٪ýz
��Z龦�}:������ ���tãD��ǣE�5۟N\
<l���di����\~�L�W&H��.Vc���m|��d���b��b��S�
u4��g�G},�R��՟��7��o!���a6��H2� �/Z,0e�V�}M+
�]?j��ȏVd�
� �(��9������l�<�F�bp 2�W��Z��yQW��f [...]
-endstream
-endobj
-17439 0 obj <<
-/Type /Page
-/Contents 17440 0 R
-/Resources 17438 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17325 0 R
-/Annots [ 17390 0 R 17391 0 R 17404 0 R 17405 0 R 17406 0 R 17407 0 R 17408 0 R 17409 0 R 17410 0 R 17411 0 R 17412 0 R 17413 0 R 17414 0 R 17415 0 R 17416 0 R 17417 0 R 17418 0 R 17419 0 R 17420 0 R 17421 0 R 17422 0 R 17423 0 R 17424 0 R 17425 0 R 17426 0 R 17427 0 R 17428 0 R 17429 0 R 17430 0 R 17431 0 R 17432 0 R 17433 0 R 17434 0 R 17435 0 R 17437 0 R ]
->> endobj
-17390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.284 682.095 254.064 692.999]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) >>
->> endobj
-17391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.206 682.095 384.393 692.999]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 601.93 149.098 612.834]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
->> endobj
-17405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.914 601.93 218.557 612.834]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 569.625 179.554 580.529]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 569.625 189.795 580.529]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) >>
->> endobj
-17408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 537.32 179.554 548.224]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 537.32 250.666 548.224]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a44e2225e59844067e005297572cd9ca5) >>
->> endobj
-17410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 505.016 191.718 515.919]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 505.016 288.852 515.919]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a7102c6fe85d4c8e6939d29a047becbdb) >>
->> endobj
-17412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 472.711 191.718 483.615]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 472.711 303.079 483.615]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a49b4a338d3d82bfb7a404ea87481fc4d) >>
->> endobj
-17414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 440.78 150.493 451.31]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aed0f237309569c2bfbf9e6f60740974e) >>
->> endobj
-17415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 408.101 169.013 419.005]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aae21b0f5a4289485ef86a9d11fcbfc50) >>
->> endobj
-17416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 408.101 208.017 419.005]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 327.936 203.075 338.84]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 327.936 296.324 338.84]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) >>
->> endobj
-17419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 311.11 309.384 321.016]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 295.631 239.129 306.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a5012c55d8fdb1420b80a3bfbe5a5b843) >>
->> endobj
-17421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.945 295.631 330.725 306.535]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) >>
->> endobj
-17422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.206 278.806 329.585 288.711]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 263.326 225.212 274.23]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) >>
->> endobj
-17424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.182 263.326 315.981 274.23]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a75683687bda865c93db529b76271bed2) >>
->> endobj
-17425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 155.882 226.034 166.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a4f6d85b054ae413ec0b77ff6522b7304) >>
->> endobj
-17426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 155.882 356.363 166.786]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 123.951 151.051 134.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_ad71d7986fdfd19215fc87726ebacf555) >>
->> endobj
-17428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.866 123.951 190.054 134.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.867 123.951 235.055 134.481]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 91.273 156.281 102.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a2617e76e0aef9021ef98ea381cd1ac3c) >>
->> endobj
-17431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.097 91.273 195.284 102.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.496 91.273 248.684 102.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 76.49 151.051 87.02]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a616f25ab81383a9c22ff3577a89a74c3) >>
->> endobj
-17434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.388 76.49 213.575 87.02]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.91 76.49 282.098 87.02]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17437 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17441 0 obj <<
-/D [17439 0 R /XYZ 89 770.89 null]
->> endobj
-17442 0 obj <<
-/D [17439 0 R /XYZ 90 701.296 null]
->> endobj
-17443 0 obj <<
-/D [17439 0 R /XYZ 90 701.296 null]
->> endobj
-17444 0 obj <<
-/D [17439 0 R /XYZ 90 623.128 null]
->> endobj
-17445 0 obj <<
-/D [17439 0 R /XYZ 90 589.089 null]
->> endobj
-17446 0 obj <<
-/D [17439 0 R /XYZ 90 524.48 null]
->> endobj
-17447 0 obj <<
-/D [17439 0 R /XYZ 90 492.175 null]
->> endobj
-17448 0 obj <<
-/D [17439 0 R /XYZ 90 459.87 null]
->> endobj
-17449 0 obj <<
-/D [17439 0 R /XYZ 90 427.566 null]
->> endobj
-17450 0 obj <<
-/D [17439 0 R /XYZ 90 349.049 null]
->> endobj
-17451 0 obj <<
-/D [17439 0 R /XYZ 90 349.049 null]
->> endobj
-14794 0 obj <<
-/D [17439 0 R /XYZ 90 315.095 null]
->> endobj
-17452 0 obj <<
-/D [17439 0 R /XYZ 90 282.791 null]
->> endobj
-17453 0 obj <<
-/D [17439 0 R /XYZ 90 204.359 null]
->> endobj
-17438 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F24 529 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17469 0 obj <<
-/Length 2568      
-/Filter /FlateDecode
->>
-stream
-xڵZKs�6��W��){ <�P��ĶR�:�^G���RQ3��
�
�
Y��|�Ñd[)
H�`�������:��OG?�

��"HI�(8�
-R�2%*��up
2JR�X2Ji�n�h�՛��݂Ӱ*�o��.��uVߟ���H9Lȳ�B/�\��U�5
޾�W�^�$��
-�2K
�H,>��r������h�PE�$Xm��?�`
ÿ��4	>�I�@r�"���?GԙC	W��\�q �7�1���6œu�u��^��<��fU��6�J�`���i4�H�%�D�%�����.�}����޸]�]0�U[���l��&f
#��$��	"����0��_�Պ37+�ɨ�ٿ��m�����s���/c�k��	qX�m�]�
���2�dvi����R�3�a�T�>�ݫ�nu�gNnvgw����T)�Ow#Y)x2�T��1;���e��+
�,�՟n8/q����v���4ͻ�X��B�*\U�-l�v�����Y�/q���P}�8|��n��킫!�
-�g�˰|
���A)���8���k���*��]�z���20���`��!�C9x4/�Q�>��康�9�߯�>�V��v�0X2��>�PE��u��y��
-o2w3R��2� ��6�D�g6U`�Ng<ڬ�k�����2�vS�п���Gko��S�8�.[��3��6�Ǣ�p|��L���ݵo�,oGD��>��괮qD�e�{Y��Z�C�Dg� ������y�[��Pb��5/��4������N�f��A}xy|
-8; %��D�n&��T)x7�%"c�6#��EW̪�j�$���Ւ����
��<d3J1I�A��.(0�P��Wպ<w at h�������J�8�J
�yW�T��ѻ^�c �
y �eq���=>7[��`��d�1ĸ����q��+��"�BC������1��;�l'P>/-��p�~�+pZY�� ���M�:s�0Y���
�)��z�]��$6b��)6K���Ԩj���Ze�)i��m".��x^UEQ�0�a7%�uß�ՎaV_;0�b5���N�.���T}nJV���D��tb��bj�/ ��4f�
-($&'#Hż\M�k?nX��x�gmS@�h��݌N	Q2y�e�ڟg�,%�'���"�[��
#k  
c
�6<��E�\��4�
-�V�H����(wT�@rF�?�L%�5�Ci����e�Y�yd}���?|k���M�
�
����/wxy���/��=9�����6��O��9Ap�R5�����W!��[� xï���N���Ӗ��ַ�:I�D��=L�V[)%�P^
�~8I����;
q"T�I�3��`�*�J�ع��)��I�CN�,�U�Vq�LB�.�qb��0��[���ܨ2�	O{��I�E{��
#�GD)�S6���1I�&��P`��|�</
��&Ag��AIa��O��n[䫼��P߹4��@8DM��M����
y��	�����W3(�����ƕ��z
-2?�XՁt��3��N(37�*��ܭ�m՛H=�\�ȟ
<@�L���<��d��a�W�4KIH��!�4p��epeS�滑H;� �R��j$s�KJ��W+џ�3��]�� �no.t
-��[�
��/�g���≉�*�����.|
�nj��]Kr5�9���
�@�s-dk6�VZ����6�?����&���
�E�U;�;2,Q���$M�L	�^_��	"i�<oR~��G�$��
�NQ՛K�H��\���~9Ő<��6S&]�x�Jz�C�
Z��
-�K"xA�a'�D
d@�
${:S���ϢA
E�<���ɀBj��u1��q_�����%FK��\Ŏٶz| �9��h�A�!`��R
����vW�S��U��x��UQ5��X��Z�
���@Ȩ��U��
Uۛ�4ȇUA���p8��?�9�4�������P�N�O�
��$��
�g1�
?͕
*����5b�(���J<�zN�\��!B��P��:��"k��=��d��X
-PAC����eU[]g-ҁ�
&���������ј�CBHs�5��\K6�����
-�㪟2N/�nR���w�3�̲"!R��YB3��҉����F/>��,��w
�޵�]�2�s�RO	9�K�޵֗UU����70I ���n`B��c�P��/�ٗ�Os�@�?L��?|�WX�%&H�Z��R;�ͺF�����W懬����;{�zvd��P�*w�И��)�>�ʔ���u��y�����y��w�n�R�)+��V��HN�
a�H�
ئ����=�
�(x��p�2c�m���� �o��/DJ.�x��ώ�
���h��:rc9
�
��`��3�p�K�
����̈́0���@�O�@==����I=�����z[��(��q�&��{�o�����88K~��]�G&���d��U6�7ݝ0����?�;
�����q�m�'�Ǘ��F��d;�网
���o��g�}<�����
�h|��RhH"��l��#sN[T��ѽ}�}��ވ�u<t��	:��
-endstream
-endobj
-17468 0 obj <<
-/Type /Page
-/Contents 17469 0 R
-/Resources 17467 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17482 0 R
-/Annots [ 17436 0 R 17460 0 R 17461 0 R 17462 0 R 17463 0 R 17464 0 R 17465 0 R 17466 0 R ]
->> endobj
-17436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.141 665.984 219.329 676.888]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.006 588.583 331.193 599.487]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [97.372 530.506 132.839 537.725]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
->> endobj
-17462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [97.372 522.229 132.839 529.755]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
->> endobj
-17463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [97.372 514.565 132.839 521.785]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
->> endobj
-17464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 363.301 492.188 377.249]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) >>
->> endobj
-17465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.628 265.057 201.531 274.9]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) >>
->> endobj
-17466 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17470 0 obj <<
-/D [17468 0 R /XYZ 89 770.89 null]
->> endobj
-17471 0 obj <<
-/D [17468 0 R /XYZ 90 721.073 null]
->> endobj
-17472 0 obj <<
-/D [17468 0 R /XYZ 90 484.744 null]
->> endobj
-17454 0 obj <<
-/D [17468 0 R /XYZ 90 461.285 null]
->> endobj
-17473 0 obj <<
-/D [17468 0 R /XYZ 90 461.285 null]
->> endobj
-17474 0 obj <<
-/D [17468 0 R /XYZ 90 388.606 null]
->> endobj
-17475 0 obj <<
-/D [17468 0 R /XYZ 90 348.934 null]
->> endobj
-17455 0 obj <<
-/D [17468 0 R /XYZ 90 324.321 null]
->> endobj
-17476 0 obj <<
-/D [17468 0 R /XYZ 90 324.321 null]
->> endobj
-17477 0 obj <<
-/D [17468 0 R /XYZ 90 251.088 null]
->> endobj
-17456 0 obj <<
-/D [17468 0 R /XYZ 90 227.572 null]
->> endobj
-17478 0 obj <<
-/D [17468 0 R /XYZ 90 227.572 null]
->> endobj
-17457 0 obj <<
-/D [17468 0 R /XYZ 90 185.867 null]
->> endobj
-17479 0 obj <<
-/D [17468 0 R /XYZ 90 181.384 null]
->> endobj
-17458 0 obj <<
-/D [17468 0 R /XYZ 90 141.652 null]
->> endobj
-17480 0 obj <<
-/D [17468 0 R /XYZ 90 137.169 null]
->> endobj
-17459 0 obj <<
-/D [17468 0 R /XYZ 90 115.121 null]
->> endobj
-17481 0 obj <<
-/D [17468 0 R /XYZ 90 115.121 null]
->> endobj
-17467 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F8 794 0 R /F75 554 0 R /F117 2446 0 R /F93 763 0 R /F24 529 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-17513 0 obj <<
-/Length 1401      
-/Filter /FlateDecode
->>
-stream
-x��Y�n�F}�W�CI \��"�4ri��j^�@�-ZJQ
-E���wv��H�b�ڠ͓�����sfvi
�
<<��

2��`|
(n����4�
��ч�ˀI�����=~�˛�7�
�n�l<�8 �
-�H��z1����)<~`�p��
~��b�� W��vL�b"X"�t�A�� �S*��zYp
���*C���
�¾�?��&D����73�0S�*���(&,�"�äX$�{$B"�u �DT�C;eHh�����q%�-
P�8F��2�	�ܦ�bG
k�O���;!��_I�:�2
����\̓�H�Y�#m�b�4����pγeR��ٶk�("�$�pAq�
�y^�p
�	mN�[rD�<x�yU���|�[�g甶���`�$�Sz��hQO9m�s��8�
8���"/SǣOa��AC�i��5����3����Jm�@�Z��+k�~�� PH_אoK�1�
���AA�[�g
-1o��)�*M�
e�ᦆ��=(�O�d��bJ��w�XeI��'o�PpZ��u�)����6AL9�xˏ����,��b~]-��)fU�޺:l'���E|���~��A��FN`n��<�{QlÀ F��y~��MS?��f� � ��::� �$v�8zv �Z�^�{�R�ڍ�E~
Y*��
-K8�'�"Y�?xx�,�ӑ`?-3_�'���J����%kR�)"aS
zqC�����nc%�B�:L�V?E��tR+D*d���Y��ZQ[E=���s���;�( (?���_�� �F�T!"x��]��m_3N݌�н��U�^,�
-~Z�J[ǐΩ�^׮▯Zڝ��4)]�zt�&�e�G��z���T��%���S��
Ijĥ� �~�%SŤVH
q��NJA��G�҆��%9�=[���
�p��:Y���y���
{*ڽ��h�7Rr���D)�}Ъ�f�d�3��
���l|���]�l�9����m��Y���p@(�:�U	=\�~�i[5���"���p;���2��\Ġm�̢�݉
�d�k3j��������j]�u9�(�Ez�P��qZ�<Y~��h8^R���	\*4\��F���V��Ry����B�P˺���d���
-��>�4��in��XA�
-7�
��,Dܰ�[K.�DJ��o籓I�jy�O��s�l-9mC��
��_�$E��o��QR�O�y~�| 
�M?m��Mō�������"Eٱ��[
�B���ڎ�R��}3�sqg�������xc��/B+� �����urG��~��:-���+
~N�$���X`�3-\��C�0<'(�����&����&�W������g��۲\
�ή�f�4����b[��vh��ٜX�,쑡ᤕL��
ޟl;B
-endstream
-endobj
-17512 0 obj <<
-/Type /Page
-/Contents 17513 0 R
-/Resources 17511 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17482 0 R
-/Group 17485 0 R
-/Annots [ 17483 0 R 17486 0 R 17487 0 R 17488 0 R 17489 0 R 17490 0 R 17491 0 R 17492 0 R 17493 0 R 17494 0 R 17495 0 R 17496 0 R 17497 0 R 17498 0 R 17499 0 R 17500 0 R 17501 0 R 17502 0 R 17503 0 R 17504 0 R 17505 0 R 17510 0 R ]
->> endobj
-17484 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 17519 0 R
-/BBox [0 0 418 144]
-/Group 17485 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 17520 0 R>>
->>
-/Length 557
-/Filter /FlateDecode
->>
-stream
-x��UMo�0
��W��%�aI��C�a��
�ء�!�G�!�?Җ
Ǚ�=F"J"�(?���"Z�
-�w�
�>�Ox�&|���_>�� �(�p��Tn�	?� Y�G̀��N,�;�w(^+�:�D�$���l�5�H��`r��ĒME
����U�N)��K��x���;�ݾ���S���wD�mt4m���VG�Ƴu�Z�4e#�!#Pl+�u%e�uqy��_�n�m+ۃ���EDY��C��Rq�t�a�
(�35��H�t���B�Y�*en�2m{և����Sp`�C��^�1�,�,�����|��\�g4�3�W�qj+n�X�
-�\r���0)ٟ7.›�֜�
e�5�b�BR�d��S��
��J��aZ3M�47���e���%��N��Q��F��
uLA4jxb����D�.bt��f�!�Xg
�t���� ��M���J�����B[��[h~��W�	�uQ�
=���Nz�k5E�Ioœ�dি
��X
F�F�d�N�
�O�7���jn��uD�
2����Zoo���Pv�����s��/.��|
-endstream
-endobj
-17519 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-17520 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /NQEGTO+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 17521 0 R]
-/ToUnicode 17522 0 R
->>
-endobj
-17521 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /NQEGTO+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 17523 0 R
-/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 667 611 278 556 556 667 500 556 500 584 278 278 500 611 278 584]]
->>
-endobj
-17522 0 obj
-<<
-/Length 17524 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0��>E��Š�:"���E/��br�j
�Y�����*(|���3'��/�
W�Yv��a���2߭$��u�O���?�$L��n[V�Z=�Q]�����n��枞"�X�n�Q_�����Uw7�&�+K��a���U�71�}�U.>��ѕ�e|m�X�c$9+Z��d��RT'�jX=���H��,����	�ӹKO�"i<��J�<U)(GL�
-�
��@H�N�r�;�� ��
$=塋B,t!P�l�	O<�d%~y �U��_I��W��c2�
-Ss�U�g<�e �e���/
������W���W����.�������w����Ȼ�ni���m��d���h3���߿����
-endstream
-endobj
-17523 0 obj
-<<
-/Type /FontDescriptor
-/FontName /NQEGTO+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 17525 0 R
->>
-endobj
-17524 0 obj
-356
-endobj
-17525 0 obj
-<<
-/Length 17526 0 R
-/Filter /FlateDecode
-/Length1 2532
->>
-stream
-x�UV{lS�?��#/���E��8q������~9NL쒐�3�G��QA
-Ii���Z�Z�Ж�$�=�m��V&U�c�4��DŽ�n�mt
�
-Ha�\�w��l}�����|��w�e��`
��ڱdl������au�c��ş���X��'b��j��}�2DZ�
�or
���K��#��B�9��?953c��Ʋ��N��g�k\�K�Ű9��KL�d���� ���4)�͗V�;x'� ��\6�����dp�n�Fr�<�j≹��#�:*�^k��q�Ȝ|�/���e��8�J-s+��J�a�����$��f���Y.��>�_O{��t�h3�n�^ҫL�F��ظ++�a���D��#Y9�Fז��ҝν�v�i­�]u>��ng�|����*�Fڭ΢��܌l�F[P`qV�j�wVEuy:W���V
��if=��d�'�m��H$,m��1�/x�S�=��#���
�<�
;�X��E�V
���,	xb5e
��ވ�]�H\׵�*TSh��D	�?����
WRwR!ޔzua��˛V���v3%���e�a?��!
-�&��<��Dk��
^�������]X�i
��Z��r۹��?{�2��W���ش�ELT�Rf��"����;S�I]y`$l�{��}���tzp�2�-�f(ؚS�Ã/r��S�Zka���8K�>�.#�Gy�
빢7�+z�����a:쯍��?�%����&��k0C��Ċ+�[���/�I	z��]
��E�U�'
��g�O�Jv������}}w:*Z�p��;]
��n<؟�g�y~�2<58��z����~�ջ]%��/>{|r��FK$��
-�|��~������+��
�LEg��Ы�����Q\ރ
����Y����{"�~���f8
p��p݇�D�?r�9=��3(�#j^nv��~"�??�'p�5�<F2�y��s/|e��>��23s0:��)�
�Ul
�F��Kq�~[!xv���
$�H�����~3� ��d!�
��t���FhY>B��-_�K}�}i��S�L�ja� �N��9���Y>`��������E~�Шn˨��W[^��c�����Q�Y���
�ww�w�z��mO#<9�c���.�����U0f]��W2��\�B�H&
�X��'���n�
�
��xR?�w��==-M�����_
ꖻ�"]�1���nOGG�������E�&��
���Z������8�F��֓Èa	��<
��J��%*�q�ԙџ�`tq1
-�ݿ~�r��^M��	���8�� {
�F��Lŏ
��5|Y�I$���7����=�]��
8!V�޸��@�VJ+�A�	yC�9���,�h+�
=�������=#��?9D�I�n��i;:vC{q��UVT�m�4�w�G����B��hlE�~���J��[�#�9��̼��.`�z�W����ƥ^!#�k�Ϭk�
gV�r��ҘU)�-�}�lwZ?}G� |?�3�n��f:4r���V���� ӟJ�X\��Kf��+n%G"�ȯ�ϟr��#.B憿���d�x]��6�J���u��
�Rf#e�05�_�Q-V�mK�0�TJ
����u)s��د�I��י�l C�[K�S+hٌ�0!2
��-�/Boci�4����M٣�ux��S���_���>��\��L] 6����Q���{6����O���|����W��g�
6�kXY������
��c�B+̄g��
-P(��&�>��i����� ��krEX�>�"��Jxs�=��φ���Xw���nfSk���.�.���
-Aà�#5�*|O�.�����Gj�W�
��;�:47QT@��G{y�~Z���P��.S�� �(��>k-��L�?��O
-endstream
-endobj
-17526 0 obj
-1889
-endobj
-17485 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-17483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [130.498 634.453 165.685 645.357]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 373.464 224.395 384.368]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 350.53 189.925 360.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-17488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.423 350.53 260.898 360.458]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a72b690903949d7e94dd627f7b49ab4cb) >>
->> endobj
-17489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.47 334.555 422.545 344.461]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 308.948 224.395 319.852]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 286.014 232.982 295.941]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-17492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.48 286.014 347.013 295.941]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a082d6ea17c164846898241075349cd31) >>
->> endobj
-17493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.035 270.039 389.11 279.944]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 244.431 224.395 255.335]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 221.497 254.671 231.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-17496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.169 221.497 390.391 231.425]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) >>
->> endobj
-17497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.383 205.523 465.458 215.428]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 179.915 224.395 190.819]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 156.005 181.207 166.909]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
->> endobj
-17500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.706 156.005 243.464 166.909]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a7ddc454f90fc8200f333eee7896deb1e) >>
->> endobj
-17501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.518 141.006 420.593 150.912]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 115.399 224.395 126.303]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.449 91.488 159.628 102.392]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
->> endobj
-17504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.127 91.488 200.306 102.392]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a0ca3ec141b70de5ebcbf18d22aa1242f) >>
->> endobj
-17505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.102 76.49 400.176 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
->> endobj
-17510 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17514 0 obj <<
-/D [17512 0 R /XYZ 89 770.89 null]
->> endobj
-1232 0 obj <<
-/D [17512 0 R /XYZ 90 700.606 null]
->> endobj
-510 0 obj <<
-/D [17512 0 R /XYZ 90 693.533 null]
->> endobj
-17515 0 obj <<
-/D [17512 0 R /XYZ 90 402.793 null]
->> endobj
-17516 0 obj <<
-/D [17512 0 R /XYZ 90 402.793 null]
->> endobj
-8341 0 obj <<
-/D [17512 0 R /XYZ 90 338.54 null]
->> endobj
-8344 0 obj <<
-/D [17512 0 R /XYZ 90 274.024 null]
->> endobj
-17517 0 obj <<
-/D [17512 0 R /XYZ 90 209.508 null]
->> endobj
-17518 0 obj <<
-/D [17512 0 R /XYZ 90 144.991 null]
->> endobj
-17511 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F90 758 0 R /F22 2996 0 R /F75 554 0 R /F11 613 0 R /F93 763 0 R /F67 3037 0 R >>
-/XObject << /Im27 17484 0 R /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17545 0 obj <<
-/Length 2218      
-/Filter /FlateDecode
->>
-stream
-x��Z�o���_��T��~s

-�͹�5wp�^��@K�MTu����of?(rEɺZ
-�^������cgM���&������*IF2�u2�M2����Y2]$�G��L�'�R:�
3:��U>�
s:��O�Ţ�gʛ:��޼�y�qXP�7�bv���\���庙}�mS���mY�ǿL��b��] ;#9�f����\da������)j��ъ��Mǩ
=m�׸;��5,�0F2��}Wc�F��D1"M���Y9��̷��+:����f�7���X����9N�T���
-�^|?����
�0�}�Hj�����/4Y��	%"3�W�h�H.�w�|�����a�Ǜh��
-�gު�7�t�,� 
7���
Hh�W�y��Z�Z����Jw�2M�0	l�ʰ��p�z{��蹩���ǣ�w���
-�Q�g] z�]������
�j���xD���l�:�7�OMU~�����נ�G�q�`�1����
�:����60=�	���)>�zUۇe:br�3���i-�%a��	�*f�l�
<��{�=}X����|�s�sW>a����f�

���Y�1�JC0�0�H
Gף
2���<��ݢ��a˻uLK�
� 5$��i�����ԿL-Y�ks
t {
-�Z�l{�u�scT��G���� ��ײ��l�U��p�rV�.�jӑ�C��T�X��RB6�,�DS5���-�
�
�-,:��ჾ
�:%���3r_Ͷ_m��
������nj��d�&�]�ދ6Ot�����>}�7�!++�Tv~#[�
Pb)�-��2���9p�^I UTNT���*��:a�0�gZ/��]�
C@
hR���A� �^`�� .[��b�4f
]C�
g���C��.�`�&�Ԟ"� �"��	t`����;WT o@dž�nГ
��b����{vA
-�oN7�*�
��
�W���T�E��a��1�(M%��!��G�8 O�A-��
-�
�T Pª��l�Qt=
�LF�q��Qq2�.����dv�+�w�.�������<KP���J�q�8
��ӫ����p�7P�o����c�st~0?�D���p���pOh��M�[?��~����U��17�dO��\s(nX�R�����i�%ƚB�n
O�܁��л����	úM�q�>
��5����@�%�F�֓�i
�F�ע�K�ni��	i6գ�I��?�F7Q�4D�l_׽���L|%�Ջ�5|H�}~�O��c���{���8��0�ra��"���G
-��ڌ?���������)H͞SP�����*����S�"z�Pr����b!�X��ϔ�Ĝ?b��@���/1�hY��Թ�`Ą����8��

�|骛����.�b�w
A�Q���,.wl3�0�N~W4y�
�$��妉5�b?^�{ɂ�LF&��b���
�J0�~s��Bpm��X����dm�v�ˌ��BR��{��cO
��#�p�
-��sH�!���%���qA�`H)O�
-���E( ��0���O@>�&�����
���x��1��-c�D\��s��D� n
��z,��Z���}$��C	Wip�����lm��6R�@1 ������2�`"iB�
��p����K�fnR��w��w�}?�����983�����ǹ�a"PKI�<� �R�K+Ca����o$IS֗��8%Tv	0N	i0�S��=�D��<b(��M$��Ȅ��<<X13�yʶ�:Y��Gkȹ���^�3�*	��h^��w@$G2n\0�C�ƦBjL�
�O0G�Jkm�ڵ�j�g��02�HE�����S��`�h��a�lv�/��
�ܣ��򔆤{5�k��ɘ����Z�m�
y�{�����
7.;U��a[,\���A
�£E�����"�עZ�ed�d
�2BSq�.�~�KatG��ntT�J�c�ͮ��Ԩ ��A5ZvN ���Z��8�u�����n at U
-N�=]���"4���L	�HF���PAk�B��H
-�`Mo_�)&� 8��.
���������M�I�ũ�G`C��v��L!~h���������J�|���|�`o
�=kOTԻWbFl˖�M�j����	��$��~a��iP`�Umһo�͛�˛�; �
�W���9B���o+�8]Uu�����A�dУ��h̓&@��(KSnWt��c��'.߯D���U�7����
-endstream
-endobj
-17544 0 obj <<
-/Type /Page
-/Contents 17545 0 R
-/Resources 17543 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17482 0 R
-/Annots [ 17506 0 R 17507 0 R 17508 0 R 17509 0 R 17527 0 R 17528 0 R 17529 0 R 17530 0 R 17531 0 R 17532 0 R 17533 0 R 17534 0 R 17535 0 R 17536 0 R 17537 0 R 17552 0 R 17538 0 R 17539 0 R 17540 0 R 17553 0 R 17541 0 R 17542 0 R ]
->> endobj
-17506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.517 686.092 169.81 696.622]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_aea16ed2cd1cce0f92352901ce90db8b1) >>
->> endobj
-17507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.952 686.092 309.485 696.622]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
->> endobj
-17508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.432 686.092 514.653 696.622]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-17509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 674.137 227.553 684.667]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-17527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.687 646.72 213.6 657.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a7aaa618bcb2bd6d5bf7777a277afd00f) >>
->> endobj
-17528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.48 646.72 312.955 657.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
->> endobj
-17529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.009 646.72 469.23 657.624]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
->> endobj
-17530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 607.722 169.013 618.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_af838a20e1508816e754fdfee5f4d2c1d) >>
->> endobj
-17531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.829 607.722 321.49 618.626]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 547.108 273.756 558.012]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_afcf9668b49ab7bc9559825c26963ed1a) >>
->> endobj
-17533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.093 547.108 366.736 558.012]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 511.951 281.504 522.855]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a03ef7bb6314fd8cb72c4a5d4aaa4ff99) >>
->> endobj
-17535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.174 408.272 156.539 419.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a98223468ffeb045b81898611289bd174) >>
->> endobj
-17536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.613 408.272 309.274 419.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [470.51 408.272 513.996 419.176]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 396.317 224.395 407.221]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.174 357.319 156.539 368.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a98223468ffeb045b81898611289bd174) >>
->> endobj
-17539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.613 357.319 309.274 368.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [470.51 357.319 513.996 368.222]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 345.363 224.395 356.267]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
->> endobj
-17541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [130.498 228.55 165.685 239.454]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17542 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17546 0 obj <<
-/D [17544 0 R /XYZ 89 770.89 null]
->> endobj
-17547 0 obj <<
-/D [17544 0 R /XYZ 90 704.286 null]
->> endobj
-17548 0 obj <<
-/D [17544 0 R /XYZ 90 624.555 null]
->> endobj
-17549 0 obj <<
-/D [17544 0 R /XYZ 90 563.663 null]
->> endobj
-17550 0 obj <<
-/D [17544 0 R /XYZ 90 526.792 null]
->> endobj
-17551 0 obj <<
-/D [17544 0 R /XYZ 90 464.795 null]
->> endobj
-17554 0 obj <<
-/D [17544 0 R /XYZ 90 309.881 null]
->> endobj
-17555 0 obj <<
-/D [17544 0 R /XYZ 90 309.881 null]
->> endobj
-17556 0 obj <<
-/D [17544 0 R /XYZ 90 247.23 null]
->> endobj
-17543 0 obj <<
-/Font << /F73 552 0 R /F11 613 0 R /F90 758 0 R /F60 532 0 R /F93 763 0 R /F68 3032 0 R /F110 1507 0 R /F24 529 0 R /F39 2320 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17563 0 obj <<
-/Length 3169      
-/Filter /FlateDecode
->>
-stream
-x��[Yo�~ׯ @Bf����dW�7��Yk��5�9���ВCi��>��
=�!iq�}	�0<Z��U_��ugw�^_�����b�AFR�]�fg�$$��eG�b��ꇌI����_����ǫ���`�������
_�x)�M�?�l��aČΞܠe�)��"�p��
��E�.� I�.��c*F�c"F�j<aT�r�x�_�y~�(�'�
��æ�n��U��%!-�$e��G?$�_#�D5 _͢)����z;/�|�Ͷ���ҿۖ�M�%��֤T"&$L���^�&��@�O��~����*��(��@"H��F��SB�B��l���xB��	�W&��B�ĭA8�(�
�#���Y	GXr?�����Ji��`C.FOEe��vW�����We��_�O�U�;sfj0Ҁ�	��P�%߮7˄�� 
�G�MX�!�x*��X+
x�TH���{��M
w<�oS�>���!c<Gq��7C�j2�{�/:��
��FaA��}/k���
-<�����Y�
�tU̾��� ���|[��O���m)�5۪�752?���я�ԍ��
�x=�$,đѴ�; �8m|J"�5�c2P�vry#*l�א<L{<D(��U.̌��–�e��˛b��zt�[MK�(ܻ���ݲX�yrG���)-�`�M$�0CY,yY�֫�lL�W?"Z at d���C�ʗ dt�~?�R
-p,�� !ԡ�K� �ο.�F3S�agP'�U{��
����7_$4���Q at R�`&V�j����M��>�	va
�d���
Q�c�.!��e*j`@l���%<L,�H5�f�1**Ȉ
������F��ߏ)����b�ɯ'!�I�e�)���f�o>�z����U�t}�X�WwAd���^=ꯙ�tA� jaMذjD�!� .!���$;�!
�SV��T�2
���A4�5h��
N�J�C�� �
��QHv�8�L�ӆ�:�z����v=v�1QgJf�1�MA�e��mH��Aǵw`��{q�m���?@	���e��Z�?WkTQ�AY=�;
;1�b���!��a(#�p�8��w�
- �����%�A�����:g\_��
|��8l\�l¤��/v��v�n`y�],:(Cϲ�6�S'�W�ڞ�b�H����o��%R
z�Bd
(�w�2�3צP깂��=(Dum����J���B�q�(�o$=�7�._|���N�4�J#���n��l�7sjN�O���ٗ����]܀�o�׾s�sř-���qBG�.�����6�4� �Ƀm��8ֺ޹J�t�Eg
U���z	��D�K �	DP���ɍ��*��ۄR��Ig:
-%,�"����V��֜��X CtU%P�
�"]�hK�>����_��L���$$=L�@��#{�B��DD���ঃ��B�K�R�u�&d�ō�̵��r}��
�(nŹE$�
U�FWc��0��tD"r������!4�D ���H���]P3HN�D���9O�4~�
-]�1տv�yz�޽
�� 
���
�8�
-
-r� �����@"�H0��*{
CЙ�$�S#h���-�U�҈:	8�W��� R
���y��d*�o�A�
��
-�����mV�ߩh�G�c(�}a���
����v7�Ŭ���Whb�U�
��|�M��(��u�]󟾤���K[�"Q��ǵ/�8(��x$*5y�`�~�K�֐�����������-=�
8�]
����z:�K�j�Z�y�.Jt�-�n
�|'C���F����V+������|�� b�'Q׸�"�W���B|��|>����_Ϫ�m�5�A�nUs����"Xl�
􋛁�Ї�[�O`Ί�N7�FiQ2+�|��&
�[䫸�w���u�S��C`����gk�
x>�*�Z�
ϛ�â�,r�3m��܅`���죓���T�ҫ鼚�kX����e�,�gۼ���]Ʊ�M*�% ��j���"��K�[�d
a{6�&��zшQ:����Ȟ
�{׊_�_�_���:��� ��ϯC:��,��%�:4�Ch`	v+��ץ�-%��z�u{L>�V�_�7"���-,���Ia��)^�gi���#{�aǬð_G�SLڔQ�.��4����Y�̜I�C)l�$���̰ĕDC [...]
pc��j�b4��k������*�5�1‘a��U+'J���nC�O�l+�0�ܙ!v�+D�̐��w+H�&\�^6܂���O�~5�ǎ
-d�.n�=ij�%S�P��(����t.�a���!�x+Ki���L8G��!��^��X��[|��
-�4CQ�;5f����yy��͗5o6��
�B���x�~��KY���d�
-j�?�L��&
9`;>�D��@���ax
A�51
$Sa<l�#�͙j$��H�c
�ۉUvp��D�<=����y<1�D�(��F�A�e�H4�����3Jc���Wb���w��A��C�P<[b�41�Y1��0nj.
�jZ$���T��I�
:;q 9��������F��J�����{�*7�"H�Rl��4H�F�~��v{um�t?��{�P��ys2���Q5�gD �;�Y�	H�ͷ�|3
���L�ݵC-i��`�����f[_/}k���?��%�{
QkM�U�#��{�a
G�0;�-�ה�(Q�� N 
�T����okд����:�I�� ������
��:D�(*��%J�=��-ek
�����k�IG
l�Y����K��Q̏0"�
fD@%	��^��8>���$N��n��@�pnw�
-p�(ӱ
F������1>�Z@��b5�O2v~-'�4��@�-գ<��R��`��Į03��(�,2!�$a�� �g�|����(Ȣ����MbI�a�	B	͐����E��B
A>zC���9!�@� �3��Y
����� 
*r*tL�|xr,�C�u:����-�ö�'�IH������E�Q�s���m�a	��S�>P�U�
S�B���r%+��^�/��	�|�d�wkֈ���I#���5,��nɖ�;`maLܨ��ֿ�y[l�b�6	�._�U61z�f�\�$[8�#\�=���z��V���������1ը�/ˇW/_�����M��}�4�
�7��P��M�oݺ�z�9�|)l
-endstream
-endobj
-17562 0 obj <<
-/Type /Page
-/Contents 17563 0 R
-/Resources 17561 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17482 0 R
-/Annots [ 17559 0 R 17560 0 R ]
->> endobj
-17559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.537 357.602 501.708 368.506]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
->> endobj
-17560 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17564 0 obj <<
-/D [17562 0 R /XYZ 89 770.89 null]
->> endobj
-17565 0 obj <<
-/D [17562 0 R /XYZ 90 669.64 null]
->> endobj
-8371 0 obj <<
-/D [17562 0 R /XYZ 90 648.798 null]
->> endobj
-17566 0 obj <<
-/D [17562 0 R /XYZ 90 648.798 null]
->> endobj
-17567 0 obj <<
-/D [17562 0 R /XYZ 90 536.717 null]
->> endobj
-17557 0 obj <<
-/D [17562 0 R /XYZ 90 358.598 null]
->> endobj
-17568 0 obj <<
-/D [17562 0 R /XYZ 90 354.115 null]
->> endobj
-17569 0 obj <<
-/D [17562 0 R /XYZ 90 261.631 null]
->> endobj
-17570 0 obj <<
-/D [17562 0 R /XYZ 90 165.912 null]
->> endobj
-17558 0 obj <<
-/D [17562 0 R /XYZ 90 140.944 null]
->> endobj
-17571 0 obj <<
-/D [17562 0 R /XYZ 90 140.944 null]
->> endobj
-17561 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F35 1248 0 R /F7 795 0 R /F10 765 0 R /F8 794 0 R /F24 529 0 R /F90 758 0 R /F117 2446 0 R /F75 554 0 R /F93 763 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17600 0 obj <<
-/Length 2224      
-/Filter /FlateDecode
->>
-stream
-x��Zmo�6��_!��
l����[
��5��[\n��}�]��$Bmɕ�$�dɖ_�8�ݗH���p晙g(��6��?�~�::9�,PH	*���@�@�
-q���/����c�1
\
	
��4
]
)
�ŝ
��Sz]�����ס�0 ��'�
]�jxL9
|��e�n?�]
I4�Y�A,� �
9�v��яWG�P
�)‘��dz������ #�����!ep��G�:�~OQnn���duwH"d��1D�&+=�M�J�N�`�r��H��?�
�ɰP-f:���M����b}��JĕU�a�m��H5[]�eq�:;;�*��q4�>�'=�
�����`�p�Q�jF0�3�{��p���"��!�b��P��Vg9 ��q/�Pf�����^�����a;y:v;)��

���+��	�D� �,�c�Gq�䴣ft6��*�n}��Y5��q�B�,�<�Q�p��4J�#z�*	I�b<|��I�� V�w��,
M�
B�P"ʢ�K4F����!���� jD
1�P
5��O0�~-'��e�֐Ea���}d��P�?��[!��CD����'
Fp+��@I4<������ [...]
���l�H�r�"(g3�C�
i�\CZKL"G
-L!y\
�h
-�c�=
G ���@M��Q�QSr��B�$7�`�=�(�H������]u
%�ȯ)1�%uta�6�[��c
-�Uy2�GtY�OO˚p�7�zo`Y���ܳ4k� �]��� +CuC��_�,���}��3$�*#��2�X���^�}�^!:٧�-c(�BȒ�
�G�ܺ5M�Y��k��m��g����c�
vn��&�
q��R�z�|n"�W@;��@+���u��G1ȥJ��G�Дkh������d\�$"h\�����F-
@i���
�zm�V�g�|S��f�u��ɹ?�AKH�]�Ucͨ-3�"�C�I3S<�qk]"B6��
��6
V�dP�d8��&\U��?
�m��^,���~�=�CCx���i�"��D� |�&
�0��}�P!��/@`pCǪ�O�B�4���)x�7�$?n��i#F�,`�
�Y��Q3skN]C֓Q�YW�"[��r�8�������νN��fZ�}��Z��
S�+R�y2z��z��09�+��A
����m��
o�4+u�1l������j���Ơje_���-���#�0'R��9_�.۝B �+d�S��|��!q���:��&�XU�c�ۼ+�el��'X˘Z����m6�,{-)i3 Μ��/?���[:p�K�j�`��X쵘9-��Ķq��z��h �m<���` �P<}��
ZO3ukk_��ة
-N�;Q;�b��˞�^S!���ʦg]7��ClH�i�|0�I�[�dž�,��Cn?f79�g9)p�f�b�{ֳ�x�s;�<ItY��'�{7ݞhvrO�^�
-�Q�!p����Mˎl�14H|{�l,KS=͋ŨL��O(LU^œ���f��E��?�<YMj���JUpj��-���$�YZ�v\/z0K���+�K0K	�d_��9��\��<�N��E�?���{vg�!���ns0�̙����r�=���8ߏ��.{�������N'�<�V���M�<zV�U}ԭ��U�3C=~k��,t�l��i���n����-��.�
Pq��gE���ضk-p!�xA_��	
h���m��P�U���
�E��Y�ƙ�D
-�:�cg4�
�f�>�J�6
|Qx���3������p�F�G�R��|�ɽ8!��f
R>|�Y���1�������W0�uJ}i0돨zb�v�X{��n��h{��4~
=�f_��}X,�N�ӵÖ���	'��A�:/�As7��JV�m�ic�����$:����Lh�����'w��Rߙ�Λ�8�ם����ޭ��
�>�८]��-��~>�sZ�Cėi�f�''��[�ŷ(q}~��}(�����ƀ�6<��~�=Q�i��#���
�-��
b)�
Ѿ�/������������	�G�
-endstream
-endobj
-17599 0 obj <<
-/Type /Page
-/Contents 17600 0 R
-/Resources 17598 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17482 0 R
-/Annots [ 17572 0 R 17573 0 R 17574 0 R 17575 0 R 17576 0 R 17577 0 R 17578 0 R 17579 0 R 17580 0 R 17581 0 R 17582 0 R 17583 0 R 17584 0 R 17585 0 R 17586 0 R 17587 0 R 17588 0 R 17589 0 R 17590 0 R 17591 0 R 17592 0 R 17593 0 R 17594 0 R 17597 0 R ]
->> endobj
-17572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 500.09 170.687 510.62]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371) >>
->> endobj
-17573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 470.678 170.687 481.209]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_afbcfd5d585123fad758b763b4e2ed336) >>
->> endobj
-17574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 470.678 233.211 481.209]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 441.267 170.687 451.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_ab90c3d16fa19df74d838587f40d74477) >>
->> endobj
-17576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 441.267 233.211 451.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.546 441.267 301.734 451.798]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 411.483 179.554 422.386]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.052 411.483 250.666 422.386]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a3d49b2488d36bda4fef0109bedf6b0cc) >>
->> endobj
-17580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 382.445 158.044 392.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a7176b36adef9683aae06961175ad94cb) >>
->> endobj
-17581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.86 382.445 197.048 392.975]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
->> endobj
-17582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 353.034 176.505 363.564]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4090b6696c19cb93c705d9a9e06f4915) >>
->> endobj
-17583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.408 337.282 450.955 347.187]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4c3c15515e1335fb69130aad4f371a1c) >>
->> endobj
-17584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 312.29 191.718 323.194]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 312.29 288.852 323.194]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a32b7f9e0a2f54d199ad55bc008bfa62e) >>
->> endobj
-17586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 282.879 191.718 293.783]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
->> endobj
-17587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.216 282.879 303.079 293.783]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4e8f85cded8a6be1916c2cc0bb31c540) >>
->> endobj
-17588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.114 253.841 150.493 264.372]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a3a5d4b3fb638414792155bcef8b54c1c) >>
->> endobj
-17589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 224.057 181.845 234.961]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a0b93ff227453cf62d922dab902055f8b) >>
->> endobj
-17590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 194.645 181.845 205.549]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4c3c15515e1335fb69130aad4f371a1c) >>
->> endobj
-17591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 165.234 154.727 176.138]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_aca3690ce9d77a85740cdf8a508edf127) >>
->> endobj
-17592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 91.869 203.075 102.773]
-/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
->> endobj
-17593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.573 91.869 296.324 102.773]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a587efac6e5a2fbde0a1866dbe4427224) >>
->> endobj
-17594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.005 76.49 328.312 86.395]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-17597 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17601 0 obj <<
-/D [17599 0 R /XYZ 89 770.89 null]
->> endobj
-17602 0 obj <<
-/D [17599 0 R /XYZ 90 721.073 null]
->> endobj
-1996 0 obj <<
-/D [17599 0 R /XYZ 90 627.855 null]
->> endobj
-514 0 obj <<
-/D [17599 0 R /XYZ 90 620.308 null]
->> endobj
-17603 0 obj <<
-/D [17599 0 R /XYZ 90 519.468 null]
->> endobj
-17604 0 obj <<
-/D [17599 0 R /XYZ 90 519.468 null]
->> endobj
-17605 0 obj <<
-/D [17599 0 R /XYZ 90 488.322 null]
->> endobj
-17606 0 obj <<
-/D [17599 0 R /XYZ 90 429.5 null]
->> endobj
-17607 0 obj <<
-/D [17599 0 R /XYZ 90 400.089 null]
->> endobj
-17608 0 obj <<
-/D [17599 0 R /XYZ 90 370.678 null]
->> endobj
-17609 0 obj <<
-/D [17599 0 R /XYZ 90 330.308 null]
->> endobj
-17610 0 obj <<
-/D [17599 0 R /XYZ 90 300.897 null]
->> endobj
-17611 0 obj <<
-/D [17599 0 R /XYZ 90 271.485 null]
->> endobj
-17612 0 obj <<
-/D [17599 0 R /XYZ 90 242.074 null]
->> endobj
-17613 0 obj <<
-/D [17599 0 R /XYZ 90 212.663 null]
->> endobj
-17614 0 obj <<
-/D [17599 0 R /XYZ 90 183.252 null]
->> endobj
-17615 0 obj <<
-/D [17599 0 R /XYZ 90 111.536 null]
->> endobj
-17616 0 obj <<
-/D [17599 0 R /XYZ 90 111.536 null]
->> endobj
-17598 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F11 613 0 R /F117 2446 0 R /F75 554 0 R /F60 532 0 R /F93 763 0 R /F110 1507 0 R /F68 3032 0 R /F67 3037 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17625 0 obj <<
-/Length 1807      
-/Filter /FlateDecode
->>
-stream
-xڽXmo�6��_!`@ga5����n@�4C��dM�~H�A�iG�,������;���,�^�K�P���������'O.&G�!�"	*���a/
"����.�\H���
�	�H$�z����^_��w�g����G� �B��דˏ�[��
#I�޴���7��'N��#���������e� B�oUWj��(���M6��<+k{�ģS���
PY0ǯ�J����u\�'U�Ÿ�Yn_���J�y�"Ez�="P�$(�(‘UH)�ﺜq��e�8>�˪P��H~`�i+�ط��u~����
���
Ҟ�`��.L�
�s	Q$#�W�cĔ�y��A��v��	!�$�JU�����ǭ%ޖ[�j
��'�@hg�DAy3����fS�ll8�'|§�7�rd���4�ьECh��0#�`qD���U�I�u��y���H�.#�qf
�
Z*g������7~�٬%�B�������3P{��:\�f�
S�As���I>߬UV�[���
f�����̧
i
o3�b"�8�H
-����a�m �"@Т��M9���)���Z-�(�Sy&P�&a߄��U�G�����;?�&�~8� ��H~/�! ��9�y��� >�݋W���d�Z�Y�E�"���0wT�Ώ��GraW�kjѭ/����G
�:�v��
��<�_�;�ƕʨK�dk���
b�C�ՓM�.ʦ
Y*�
-�p>-G��-�q����"_[��k��1��%

Iw��Q�5�uw���Р)Nw_��kP��5�apo] �����rDW�H�����f@@(k�戴AW�6���P�W��:��]E��':
��ӆ�%�^�O]�
�t��
u��H���1�&AaD����h�ߖ�!�ј�_�BhL�,�]� g`r���p-\f����Z�T_y���p�w��/�R
�K���nid�0����>�lS1ڽ�GEfME
�rm
��}d!�FA�}

䂐ݮ�P���!"a�>/Gy� ��o'��
�P�&�G��!G��.njc@<r��C�#��ƍ����ǽ��q�0�l%����q�7t�-fs��EB�������<�K�x�C�����ʴ���8�K�2O�\��]�����i���}
-��I�����3D at kG9�,�J�[�CZQ���
��`����V�ӱ� �����]�P/*��q&hJ@?=z��{mO\͡�^�+��Om�k
Z�+U�l����P��G9����V�FJ�V-N�1@�OI6O7
5BG�AŒ��B9�V�x=
-Q at h�:�ԝt27�{�v�?��]V WS�#+F�l�'�u��=2^kBNs���R����\n��q��cD8A�l���q�2�n at 4
��|�l��*$��
������66���^���g�X���X�V�/�4��h@��j���*��yt��b��TS	q�>�k��
-iG�r�=�0~5-�
H:(Y�Қ}w ��?�T�U^��"ݡT't
�;�7`P,d�;�=c�UhO3D���� F�l
����ƪC�z(\ g Q{A�����9�UҦ��������d��k�$K�$N���::
�Xϫ�
{:
B���)�������u�����7JG�?����
z���f$
�
�g�1�6��/���K��]8z�f�I�Zq3�7k�̓�Q�����=����y��TE�j�U�m��o\}[��E��Јh����\� �>5f�1�+y�

 ��X��㣣�ͪT�
-��Er�ǚ�Æw�^w��
�$���x��'���
-endstream
-endobj
-17624 0 obj <<
-/Type /Page
-/Contents 17625 0 R
-/Resources 17623 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17482 0 R
-/Annots [ 17595 0 R 17596 0 R 17618 0 R 17619 0 R 17620 0 R 17621 0 R 17622 0 R ]
->> endobj
-17595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.349 657.557 226.034 668.461]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a6e710cc6607e4ec2791b182707bb4f1f) >>
->> endobj
-17596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.176 657.557 377.952 668.461]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
->> endobj
-17618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 219.757 156.052 230.661]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_ae6136681f74ee2a46497793fcf6222b1) >>
->> endobj
-17619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 191.232 163.801 202.136]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_a0f5f7c074992bb3c4464fa554490fb3d) >>
->> endobj
-17620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 120.324 194.297 130.854]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_ad5a1348ca7621bbaac38c11716affd61) >>
->> endobj
-17621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.437 91.799 188.759 102.329]
-/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_ae59da834d6abca4c75ec2cba498871f5) >>
->> endobj
-17622 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17626 0 obj <<
-/D [17624 0 R /XYZ 89 770.89 null]
->> endobj
-17627 0 obj <<
-/D [17624 0 R /XYZ 90 704.144 null]
->> endobj
-17628 0 obj <<
-/D [17624 0 R /XYZ 90 628.34 null]
->> endobj
-17629 0 obj <<
-/D [17624 0 R /XYZ 90 572.681 null]
->> endobj
-17617 0 obj <<
-/D [17624 0 R /XYZ 90 548.105 null]
->> endobj
-17630 0 obj <<
-/D [17624 0 R /XYZ 90 548.105 null]
->> endobj
-17631 0 obj <<
-/D [17624 0 R /XYZ 90 461.543 null]
->> endobj
-17632 0 obj <<
-/D [17624 0 R /XYZ 90 439.025 null]
->> endobj
-17633 0 obj <<
-/D [17624 0 R /XYZ 90 439.025 null]
->> endobj
-1997 0 obj <<
-/D [17624 0 R /XYZ 90 345.502 null]
->> endobj
-518 0 obj <<
-/D [17624 0 R /XYZ 90 338.509 null]
->> endobj
-17634 0 obj <<
-/D [17624 0 R /XYZ 90 239.065 null]
->> endobj
-17635 0 obj <<
-/D [17624 0 R /XYZ 90 239.065 null]
->> endobj
-17636 0 obj <<
-/D [17624 0 R /XYZ 90 208.807 null]
->> endobj
-17637 0 obj <<
-/D [17624 0 R /XYZ 90 139.174 null]
->> endobj
-17638 0 obj <<
-/D [17624 0 R /XYZ 90 139.174 null]
->> endobj
-17639 0 obj <<
-/D [17624 0 R /XYZ 90 110.071 null]
->> endobj
-17623 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F11 613 0 R /F93 763 0 R /F117 2446 0 R /F75 554 0 R /F24 529 0 R /F110 1507 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17643 0 obj <<
-/Length 527       
-/Filter /FlateDecode
->>
-stream
-xڍ�Ms�0���
-�
-�+!	�m�N�t�m����dȆ)�����w"�ɥ'I+��}����	��ާ����B��DqE6;� �DB��UN�>�
-
 �u��OM�>�~[=:7��u�hR�Z�J�i�y�\���J�n���;m���4V b_�$��\y_6ޓ�P6j�4�IV{�{ 9���0���
���!���~z�� �r��3����1F�y�̹��}ZV:G�<�U���ЗmcNW,/ռ"�4�X��h�dA�9�e����PmHcU\�i�B���6;ֺ�S{�
�Z�J�#��B
or��n�I{ka�4m=��XU����l��; ^�ՙI�a��$��
E�q.�Om�
-�����T�Fخ���R����o"B%�\���8��i�a��H�H�cZM%�
���^�2
-g4X��Fk���L�����3)L
-*%�-+����j�|<�;��i��߽�����j���ٺ5�P�`��ݧӿ�8J`T)>�@�O��E�'�s�9%���[
���~�̻�o
-endstream
-endobj
-17642 0 obj <<
-/Type /Page
-/Contents 17643 0 R
-/Resources 17641 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17646 0 R
-/Annots [ 17640 0 R ]
->> endobj
-17640 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17644 0 obj <<
-/D [17642 0 R /XYZ 89 770.89 null]
->> endobj
-17645 0 obj <<
-/D [17642 0 R /XYZ 90 721.073 null]
->> endobj
-17641 0 obj <<
-/Font << /F73 552 0 R /F90 758 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17717 0 obj <<
-/Length 1146      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~���x�ƒ@\��d��[g׻��t'�02(�.W�6�_	p�Ʊ-c;I;;~ !qΧs�t$�H�u4���V^�;��N���
Ӳ�6��D����6�[}�BڅP���1�yMZ���gx6��@�!`XЩ����g����hx��`�Y
-Р,4� 2�iU�.޼�����hN"Z�����
�N�c�^@ո�-o>^w��r�c������
2!,̘/���ey�EX�[6�d�l^�"�X��<T���Z@�}��q�6BI؄��e�Ô����x�	8;�����CC��<�P�
@:t�UX`m�7#_�@����@
RrV�%����o������L��E�/f�y?�T5c�*l�
ƕ
-d{
��g�6�!�9em����)�� ��}�b���~�x

�;�� �D#�nK��� jo����I�<�i8h����F��#��!Ŏ�[��T��{ؠ���O��?���^!my�� �G[���06�
-᭤O�2�c�6��`���U�*����?���\V����ɵ[.���<i�4
|���Oϛ�H��$���1]��W9�rJY�fj�����d�> O}1����bچ
��l��
��ؠ���Uȶ
,�b�1p��
<
;`%v�3=C�m�������s�~}I�,益�F�QN����~H�m�G@�:�g(��/	��f��96hN��oJ�L5 at I�(��
����T�����B=�'k'~{��Ł�מ�=�{zà2�a龶�7������v��k)�X��IVY�ȧ�Iy}����)��[R���d��Z.pH�AB7����"n�}����~@y�d�㜵�#�m��G-�4+p�^���d�q�Ҥ�
�h1�Z�?��C-TN����n��WRRnB���|F*V�T�}+��',�(x“2 rN� �iW1�^|�3���r܁�`h�c`�Ղ��W :*;�����;��� 5��Y��-�zB^���ch��ٶ%�G�.4,��r��i���h4�n~5�]���j�6'Iu�;����
��!4�x�nO��O���p}y������e<�2D�&�J(Ӣ�����y�SA���1�3��.޽��L��zB1��
cE���Wز�X
-endstream
-endobj
-17716 0 obj <<
-/Type /Page
-/Contents 17717 0 R
-/Resources 17715 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17646 0 R
-/Annots [ 17647 0 R 17648 0 R 17649 0 R 17650 0 R 17651 0 R 17652 0 R 17653 0 R 17654 0 R 17655 0 R 17656 0 R 17657 0 R 17658 0 R 17659 0 R 17660 0 R 17661 0 R 17662 0 R 17663 0 R 17664 0 R 17665 0 R 17666 0 R 17667 0 R 17668 0 R 17669 0 R 17670 0 R 17671 0 R 17672 0 R 17673 0 R 17674 0 R 17675 0 R 17676 0 R 17677 0 R 17678 0 R 17679 0 R 17680 0 R 17681 0 R 17682 0 R 17683 0 R 17684 0 R 17685 0 R 17686 0 R 17687 0 R 17688 0 R 17689 0 R 17690 0 R 17691 0 R 17692 0 R 17693 0 R 17694 0 R 17 [...]
->> endobj
-17647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 659.306 223.309 670.21]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 634.84 223.309 645.744]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-17649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 610.373 313.839 621.277]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-17650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.627 598.14 296.564 609.044]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-17651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 563.656 145.791 572.622]
-/A << /S /GoTo /D (page.269) >>
->> endobj
-17652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 537.251 285.097 548.155]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-17653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 525.018 258.537 535.922]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-17654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 512.785 260.191 523.689]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-17655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 500.552 311.727 511.455]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-17656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 477.08 186.747 487.267]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-17657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 454.112 145.791 463.079]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-17658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 439.941 287.867 450.845]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-17659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 415.475 285.097 426.379]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-17660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 403.241 258.537 414.145]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-17661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 391.008 260.191 401.912]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-17662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 378.775 311.727 389.679]
-/A << /S /GoTo /D (page.413) >>
->> endobj
-17663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 355.304 186.747 365.49]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-17664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 332.336 145.791 341.302]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-17665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 318.165 287.867 329.069]
-/A << /S /GoTo /D (page.531) >>
->> endobj
-17666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 293.698 285.097 304.602]
-/A << /S /GoTo /D (page.113) >>
->> endobj
-17667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 281.465 258.537 292.369]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-17668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 269.232 260.191 280.135]
-/A << /S /GoTo /D (page.311) >>
->> endobj
-17669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 256.998 297.909 267.902]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-17670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 244.765 311.727 255.669]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-17671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 221.294 186.747 231.48]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-17672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 208.343 295.069 219.247]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-17673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 186.092 145.791 195.059]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-17674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 171.921 287.867 182.825]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-17675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 147.455 285.097 158.359]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-17676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 135.222 258.537 146.125]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-17677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 122.988 260.191 133.892]
-/A << /S /GoTo /D (page.311) >>
->> endobj
-17678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 110.755 297.909 121.659]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-17679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 98.522 311.727 109.426]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-17680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 75.05 186.747 85.237]
-/A << /S /GoTo /D (page.450) >>
->> endobj
-17681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 671.54 511.551 682.443]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-17682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 649.302 362.272 658.268]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-17683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 635.144 504.348 646.048]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-17684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 600.685 362.272 609.652]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-17685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 574.307 504.348 585.211]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-17686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 549.866 504.348 560.77]
-/A << /S /GoTo /D (page.531) >>
->> endobj
-17687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 525.426 476.672 536.33]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-17688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 500.985 476.672 511.889]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-17689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 466.527 362.272 475.493]
-/A << /S /GoTo /D (page.196) >>
->> endobj
-17690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 440.148 530.32 451.052]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-17691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 427.928 513.045 438.832]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-17692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 404.47 362.272 414.656]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-17693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 404.47 382.197 414.656]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-17694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.748 379.312 494.684 390.216]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-17695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 354.871 501.578 365.775]
-/A << /S /GoTo /D (page.115) >>
->> endobj
-17696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 342.651 475.018 353.555]
-/A << /S /GoTo /D (page.151) >>
->> endobj
-17697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 330.43 476.672 341.334]
-/A << /S /GoTo /D (page.311) >>
->> endobj
-17698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 318.21 528.208 329.114]
-/A << /S /GoTo /D (page.413) >>
->> endobj
-17699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 294.752 403.228 304.938]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-17700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 281.814 504.348 292.718]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-17701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 257.373 501.578 268.277]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-17702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 245.153 475.018 256.057]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-17703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 232.933 476.672 243.837]
-/A << /S /GoTo /D (page.312) >>
->> endobj
-17704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 220.712 528.208 231.616]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-17705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 197.254 403.228 207.441]
-/A << /S /GoTo /D (page.450) >>
->> endobj
-17706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 184.316 504.348 195.22]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-17707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 159.876 504.348 170.78]
-/A << /S /GoTo /D (page.531) >>
->> endobj
-17708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 135.435 476.672 146.339]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-17709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 110.994 501.578 121.898]
-/A << /S /GoTo /D (page.127) >>
->> endobj
-17710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 98.774 475.018 109.678]
-/A << /S /GoTo /D (page.161) >>
->> endobj
-17711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 86.554 476.672 97.457]
-/A << /S /GoTo /D (page.321) >>
->> endobj
-17712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 74.333 514.39 85.237]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-17714 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17718 0 obj <<
-/D [17716 0 R /XYZ 89 770.89 null]
->> endobj
-17719 0 obj <<
-/D [17716 0 R /XYZ 90 684.655 null]
->> endobj
-17715 0 obj <<
-/Font << /F90 758 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17783 0 obj <<
-/Length 1271      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�8~�W�ma�8�l�vޖ&M�&)ؙ��
���x�eG�M��W�m�#
$�l�����wn��16�q���G�
��L� b�G�
��LLԙo�6/�ON�n��6l� �\v;0
n��
�F����0l�� ���?��<�x�n
-
Y�b�6�<�@��6
Ms���M&CF���������` �|>>�:L�8lB{w,�g�rXr\�9k�mP�FvqC@���$c
Q��$`��3���l��vf%��&�sѮ��-I$
�6v!�_���E76��p�0g��DGL1�5R��^S	/��|�Nc6��B.�A$��	��2������آs��
-"DN}"t��u�X�3�k��?��\���.�{.'
D�S�c._P�
���\[�����@c&Y�-�d�h%̙*����<0�Ƥ#1�3.�T��iR��5V!H��[��b����� ��"� dc���;�FHø~ȹ
g�~J�Q�X�
�͢t�(����uH?O�|!;�
�������ۑ�9��U�@�rN��)OԵ,�r�N6�����Û�P,�;F]�ߨK~A/rϋ��	���������x�dB<�aƦ�L�bLG31L�n�ҷ>~���D^21��^��]�
-Y�Z4U)��
w��������
-�onSPǦ�`�ŵ_�Wb���U�e���8�ѓ��	O;�$H��������n�U4
-%�?���C�h�(��j�V�X�e��^G>?>��^�f��׬��h�Ʀ� ��,�_����iw|x�����z�Q���rd�$b~=
׀e������q�%K"�ի.�)r�
-oד�J����2
ƂʷZw���͍�z���+��i{��E�G!rW*��@�`
��@�a��a� �a�8 z�N=��m����`9�z
�ޢ>%��ф�Y�����9�b��o ����"-�����~���e�U�R��;�7߀�l�
�P�|�ȶg�`Ԁ	Q�\W�Y�3��F*^��>ŒO����
˟�^7P4����v
7vʿ��P��S �����o���
s���t�K�RX9��?U��)��HXe7�{����V	�LY�[%�-��b{5l��e�ٿ+�v����_S.kaܜ��WL��$?�0(0��|�@�C�ն��=�
=r��Fy�%�6��@l�.
��C�$>>:����cs�
Y��3��ώ"��	#Y(���Y�lf�餴#�$��P�|h @�A�
������b��"���H��n�� �&d
-endstream
-endobj
-17782 0 obj <<
-/Type /Page
-/Contents 17783 0 R
-/Resources 17781 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17646 0 R
-/Annots [ 17713 0 R 17720 0 R 17721 0 R 17722 0 R 17723 0 R 17724 0 R 17725 0 R 17726 0 R 17727 0 R 17728 0 R 17729 0 R 17730 0 R 17731 0 R 17732 0 R 17733 0 R 17734 0 R 17735 0 R 17736 0 R 17737 0 R 17738 0 R 17739 0 R 17740 0 R 17741 0 R 17742 0 R 17743 0 R 17744 0 R 17745 0 R 17746 0 R 17747 0 R 17748 0 R 17749 0 R 17750 0 R 17751 0 R 17752 0 R 17753 0 R 17754 0 R 17755 0 R 17756 0 R 17757 0 R 17758 0 R 17759 0 R 17760 0 R 17761 0 R 17762 0 R 17763 0 R 17764 0 R 17765 0 R 17766 0 R 17 [...]
->> endobj
-17713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 707.957 311.727 718.861]
-/A << /S /GoTo /D (page.424) >>
->> endobj
-17720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 684.764 186.747 694.951]
-/A << /S /GoTo /D (page.457) >>
->> endobj
-17721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 672.092 295.069 682.996]
-/A << /S /GoTo /D (page.474) >>
->> endobj
-17722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 660.136 287.867 671.04]
-/A << /S /GoTo /D (page.542) >>
->> endobj
-17723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 636.226 285.097 647.13]
-/A << /S /GoTo /D (page.127) >>
->> endobj
-17724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 624.271 258.537 635.175]
-/A << /S /GoTo /D (page.161) >>
->> endobj
-17725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 612.316 260.191 623.22]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-17726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 600.361 311.727 611.265]
-/A << /S /GoTo /D (page.424) >>
->> endobj
-17727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 577.168 186.747 587.354]
-/A << /S /GoTo /D (page.457) >>
->> endobj
-17728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 564.495 287.867 575.399]
-/A << /S /GoTo /D (page.542) >>
->> endobj
-17729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 540.585 297.909 551.489]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-17730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 516.674 295.069 527.578]
-/A << /S /GoTo /D (page.474) >>
->> endobj
-17731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 482.866 145.791 491.713]
-/A << /S /GoTo /D (page.216) >>
->> endobj
-17732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 456.899 285.097 467.803]
-/A << /S /GoTo /D (page.120) >>
->> endobj
-17733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 444.943 258.537 455.847]
-/A << /S /GoTo /D (page.155) >>
->> endobj
-17734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.416 432.988 294.352 443.892]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-17735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 421.033 311.727 431.937]
-/A << /S /GoTo /D (page.418) >>
->> endobj
-17736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 409.078 287.867 419.982]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-17737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 385.168 285.097 396.071]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-17738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 373.212 258.537 384.116]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-17739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 361.257 260.191 372.161]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-17740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 349.302 311.727 360.206]
-/A << /S /GoTo /D (page.417) >>
->> endobj
-17741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 326.109 186.747 336.296]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-17742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 303.539 145.791 312.385]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-17743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 289.526 287.867 300.43]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-17744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 265.616 285.097 276.52]
-/A << /S /GoTo /D (page.120) >>
->> endobj
-17745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 253.661 258.537 264.565]
-/A << /S /GoTo /D (page.155) >>
->> endobj
-17746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 241.706 260.191 252.609]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-17747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 229.75 311.727 240.654]
-/A << /S /GoTo /D (page.418) >>
->> endobj
-17748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 206.557 186.747 216.744]
-/A << /S /GoTo /D (page.453) >>
->> endobj
-17749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 183.987 145.791 192.834]
-/A << /S /GoTo /D (page.502) >>
->> endobj
-17750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 169.975 287.867 180.878]
-/A << /S /GoTo /D (page.536) >>
->> endobj
-17751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 146.064 223.309 156.968]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-17752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 122.154 223.309 133.058]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-17753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 98.244 223.309 109.147]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-17754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 74.333 223.309 85.237]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-17755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 685.952 362.272 694.918]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-17756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.537 648.8 407.492 658.987]
-/A << /S /GoTo /D (page.97) >>
->> endobj
-17757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 624.107 530.32 635.011]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-17758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 600.131 530.32 611.035]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-17759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 578.125 362.272 587.091]
-/A << /S /GoTo /D (page.289) >>
->> endobj
-17760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 554.182 362.272 563.148]
-/A << /S /GoTo /D (page.339) >>
->> endobj
-17761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 528.268 530.32 539.172]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-17762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 518.251 362.272 527.217]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-17763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 481.827 439.79 492.731]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 457.851 439.79 468.755]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 433.875 439.79 444.779]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 409.899 439.79 420.803]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 385.923 439.79 396.827]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 361.947 506.56 372.851]
-/A << /S /GoTo /D (page.107d) >>
->> endobj
-17769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 328.073 362.272 336.92]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-17770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 302.04 501.578 312.944]
-/A << /S /GoTo /D (page.125) >>
->> endobj
-17771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 290.052 528.208 300.956]
-/A << /S /GoTo /D (page.423) >>
->> endobj
-17772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 266.076 504.348 276.98]
-/A << /S /GoTo /D (page.540) >>
->> endobj
-17773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 232.202 362.272 241.048]
-/A << /S /GoTo /D (page.506) >>
->> endobj
-17774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 206.168 447.89 217.072]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-17775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 172.295 362.272 181.141]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-17776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 146.261 504.348 157.165]
-/A << /S /GoTo /D (page.540) >>
->> endobj
-17777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 122.285 504.348 133.189]
-/A << /S /GoTo /D (page.541) >>
->> endobj
-17778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 98.309 439.79 109.213]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 74.333 439.79 85.237]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17780 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17784 0 obj <<
-/D [17782 0 R /XYZ 89 770.89 null]
->> endobj
-17781 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17878 0 obj <<
-/Length 1392      
-/Filter /FlateDecode
->>
-stream
-x��Zmw�H���Ӯ�]�00��$��B�l�M{栌�S^,�����Fm��9�%
-�s�{�>w�Lp
p7�K�uq-���+bΚs
-�dI�fWw�F2켷^q�x��6
�w郖j�>�����/���ߺ8��~�^Tzܧ�G>'A�}z��z��D0�!"� �/�U�P�hAB;j/hD�N�����H��:�CFU` q]�P��ׯ���Ӆ��v�X�
�_�hѼ#��=�f��D�£�M���~+K��1�ߴS�kZд�
��� �%���G�Hݱ#�&F�=>P'��НFv����倘���� �69p���s<�����\�_�����,�a`{Ց�-	�����G2��jF����b�%�
-B91���$��^B�f>�X�IL�,ͻO4b{�>����o�A��H�II.��2�{Ԅ!5�ά���	��[WM�@5��D��U��&����n̟I:w��տ�1������VWa0�hB���	5��0(�����?�
�D��!��M�� �F���
W��������)&�(�=�Ƚ�G8kA���U�NA�w+���k�$���#I����u
z��)���m�
��̋��@E�����oU���ș�F>����Of󈵌Xy
���T����P��oɕ>2��f�=p�lc�S;p€d
��%
b7M�|b'��_���+�����x��j��ʎ]��7X��*�eV�Ȭ2$���U����
S�x��8?�Cv�Y&`�*�P
|� KG��
��!)��ԿY����dk%uFC_�s�����~����xW��+���1//qn�H�<;��
�cS����E���Σ~
G�i9���pVГ�e߾�X��h:���o��#!����B����e-
�Nc��=i���ڷ�	�'�	�
4�e�
I�
��~{9l�\)���o㨪*#�'����?�>
+6r�� �$VcK
�"ꝥ�jCzn���b��+-��
U�l��x�y���w�H��oizS$m|2$#]�MY9&&�/Wq�!�F�$v��&E��X�NQ�t�JåH��Dg);j���q2ȿ���PC�����V��z��L��ڸZ�5��L��٬�
Yw_��W/&�^)�:*��Rnc�v3aԁ��mV��P�
�D��fv�e���;�H��fR3��۱>������
ԉK�a
	�d�F�u�Ȩ�J�
���=��!/C��%�GJv��c
�@�e�=���=\�Sܸ�|��
�	���O��S/=^�XJO�=�� ^�b={@,2��ۘF�wj����V��X���?��(
����h��!�y}�J���8��$
!�>��$��Ղ��,�b�㌢�@�ߝ3Agd�TV8��
g<�- 6x�&��
-endstream
-endobj
-17877 0 obj <<
-/Type /Page
-/Contents 17878 0 R
-/Resources 17876 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17646 0 R
-/Annots [ 17786 0 R 17787 0 R 17788 0 R 17789 0 R 17790 0 R 17791 0 R 17792 0 R 17793 0 R 17794 0 R 17795 0 R 17796 0 R 17797 0 R 17798 0 R 17799 0 R 17800 0 R 17801 0 R 17802 0 R 17803 0 R 17804 0 R 17805 0 R 17806 0 R 17807 0 R 17808 0 R 17809 0 R 17810 0 R 17811 0 R 17812 0 R 17813 0 R 17814 0 R 17815 0 R 17816 0 R 17817 0 R 17818 0 R 17819 0 R 17820 0 R 17821 0 R 17822 0 R 17823 0 R 17824 0 R 17825 0 R 17826 0 R 17827 0 R 17828 0 R 17829 0 R 17830 0 R 17831 0 R 17832 0 R 17833 0 R 17 [...]
->> endobj
-17786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 695.71 223.309 706.614]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 671.217 285.097 682.121]
-/A << /S /GoTo /D (page.122) >>
->> endobj
-17788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 658.97 258.537 669.874]
-/A << /S /GoTo /D (page.157) >>
->> endobj
-17789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 646.723 260.191 657.627]
-/A << /S /GoTo /D (page.317) >>
->> endobj
-17790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 634.477 311.727 645.38]
-/A << /S /GoTo /D (page.419) >>
->> endobj
-17791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 610.992 186.747 621.179]
-/A << /S /GoTo /D (page.454) >>
->> endobj
-17792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 588.13 145.791 596.977]
-/A << /S /GoTo /D (page.504) >>
->> endobj
-17793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 573.826 287.867 584.73]
-/A << /S /GoTo /D (page.538) >>
->> endobj
-17794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 549.332 285.097 560.236]
-/A << /S /GoTo /D (page.122) >>
->> endobj
-17795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 537.086 258.537 547.99]
-/A << /S /GoTo /D (page.158) >>
->> endobj
-17796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 524.839 260.191 535.743]
-/A << /S /GoTo /D (page.318) >>
->> endobj
-17797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 512.592 311.727 523.496]
-/A << /S /GoTo /D (page.420) >>
->> endobj
-17798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 489.108 186.747 499.294]
-/A << /S /GoTo /D (page.455) >>
->> endobj
-17799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 466.246 145.791 475.092]
-/A << /S /GoTo /D (page.504) >>
->> endobj
-17800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 451.942 287.867 462.845]
-/A << /S /GoTo /D (page.538) >>
->> endobj
-17801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.493 415.493 175.43 426.397]
-/A << /S /GoTo /D (page.203) >>
->> endobj
-17802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.493 379.044 175.43 389.948]
-/A << /S /GoTo /D (page.203) >>
->> endobj
-17803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.493 342.596 175.43 353.499]
-/A << /S /GoTo /D (page.203) >>
->> endobj
-17804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 318.102 285.097 329.006]
-/A << /S /GoTo /D (page.110) >>
->> endobj
-17805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 305.855 258.537 316.759]
-/A << /S /GoTo /D (page.146) >>
->> endobj
-17806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 293.608 260.191 304.512]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-17807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 281.362 311.727 292.266]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-17808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 257.877 186.747 268.064]
-/A << /S /GoTo /D (page.445) >>
->> endobj
-17809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 234.896 145.791 243.862]
-/A << /S /GoTo /D (page.494) >>
->> endobj
-17810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 220.711 287.867 231.615]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-17811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 196.218 285.097 207.122]
-/A << /S /GoTo /D (page.110) >>
->> endobj
-17812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 183.971 258.537 194.875]
-/A << /S /GoTo /D (page.147) >>
->> endobj
-17813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 171.724 260.191 182.628]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-17814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 159.477 311.727 170.381]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-17815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 135.993 186.747 146.179]
-/A << /S /GoTo /D (page.446) >>
->> endobj
-17816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 113.011 145.791 121.977]
-/A << /S /GoTo /D (page.494) >>
->> endobj
-17817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 98.827 287.867 109.731]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-17818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 74.333 263.518 85.237]
-/A << /S /GoTo /D (page.143d) >>
->> endobj
-17819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.91 707.957 419.865 718.861]
-/A << /S /GoTo /D (page.65) >>
->> endobj
-17820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.151 696.719 433.106 706.906]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [467.088 684.047 479.043 694.951]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-17822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.639 672.092 502.594 682.996]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-17823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.602 660.136 512.557 671.04]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-17824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.627 648.181 476.582 659.085]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-17825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.59 636.226 486.545 647.13]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-17826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.906 624.988 383.861 635.175]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.924 613.033 378.88 623.22]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.924 601.078 378.88 611.265]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.924 589.123 378.88 599.309]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.943 577.168 373.898 587.354]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [466.282 564.495 478.237 575.399]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [488.816 552.54 500.772 563.444]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.559 540.585 465.514 551.489]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.416 529.347 386.371 539.534]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.865 516.674 415.82 527.578]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.491 505.437 374.446 515.623]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [413.788 492.764 425.743 503.668]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.042 480.809 405.997 491.713]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.155 469.571 376.11 479.758]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.145 457.272 376.1 467.803]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.242 444.943 435.198 455.847]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.883 433.362 445.838 443.892]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.977 421.75 420.932 431.937]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.59 409.795 406.546 419.982]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.609 397.84 401.564 408.027]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.294 385.885 424.249 396.071]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.908 373.93 409.863 384.116]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.668 361.631 412.623 372.161]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.313 350.019 419.268 360.206]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [462.645 338.064 474.6 348.251]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.616 326.109 370.571 336.296]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 313.81 423.153 324.34]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 302.199 398.247 312.385]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.197 290.243 418.152 300.43]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.321 278.288 414.277 288.475]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.189 266.333 428.144 276.52]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.207 253.661 418.162 264.565]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.599 242.079 401.555 252.609]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.799 230.468 470.754 240.654]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [455.482 218.512 467.437 228.699]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [448.837 206.557 460.792 216.744]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.711 194.602 459.666 204.789]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.036 182.647 436.991 192.834]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.175 169.975 477.13 180.878]
-/A << /S /GoTo /D (page.78) >>
->> endobj
-17865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [475.138 158.019 487.093 168.923]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-17866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.705 146.064 378.66 156.699]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.338 134.109 383.293 145.013]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.282 134.109 398.237 145.013]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 122.154 423.153 133.058]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.424 110.916 477.38 121.103]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.871 98.961 424.827 109.147]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.706 87.006 407.661 97.192]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.451 75.05 446.406 85.237]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17875 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17879 0 obj <<
-/D [17877 0 R /XYZ 89 770.89 null]
->> endobj
-17876 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-17971 0 obj <<
-/Length 1425      
-/Filter /FlateDecode
->>
-stream
-x�͚aw�:���)xw��0�}�B=l
��n��C1��Ip��z?�
��:�P�v@~���Ib�-9�M;c�sy�Hܐʢ�y��pJ�C�~[p�]�T���'�-�
@��+
@E�ow4��#л��ҐW\u�?nAo�� /
ܷ⥈��\qn�}�
����kr� �P�i���
W�L4�M����P֝,�"�i���!�*��yY	�sAiCK�c�M�֭Yőjp�)��A2-���jj��&��\��'
r4c�Q�"�m�f╟�1A�s��%�u�SL�Ył�t����
��4�")g�oKJ�n5���0&};d�!
���08�Z!�=v��6X��
C�}T�$q���^t����I�
-��"/�-Z��lp��L�$
Z˄�Y�u��SB�Djux�0\:sh*�Ěن6�L�ms��s������ֵG�[9��gN���COF��\6�O �X�
��87���F�b���v�1�
�f��km���K�v{L=_Xil�27�Xn�۞�A�/_�����-�n��ߠ�4�b�h3�:�*!��	��w�"ݼ�M�
I�6�y/]7�XM=vB�&Q�˺��ՠ���m���n���Q3KmC�ln��k9˝��0�`G�qD�Xl0G��b��J���h�4���ONd�?9Y�xY�����dh2��Eg�kúe
��������3�iݚ9�U�OL�r[d:��h.]ˎƯN�
!�����r�]�X��;Rom���_E~�ȎW�Ox���?y���b�?���2�#h�y�9�W*#O�~�Y���X�%��
-G���l:R�F��?U�j���
�򗫻֝S���^*�I3E��s������i���u~�
o���4
��Y��U�>��

A<�+�l
V��˘��ꪨ}Q�k��x�7��ئ
��
��{^���I ��-\`�lpu���p�}�]'#%��
�B��$�7L�	�0Ҿ����0���\�J�!?�¡�WL&O�p�'�.^ s=�j�
�8�cQ��I�I�p��C��8�ϊ���Q�W���;��.{���l at l�\����f����lT�4�����@��Z
���fٺ�l?8�/�
�WWW48i��Y�������*�1)?��RQ���J�j��n��y�5�Z�vp� �f�.J��K�
I��H��:�����c>�}@
�s#��͛^�׆O���o�+�D��~
-N)z)s|�@yE��
0�
,�CY�oO8�
���ʽ�m�l�(/�)N��A�M��3�l�Uy�@���ʹ��z_�{5��x�����]��[�=)����#OY����|�,SL�|GF
�c�e�+�'��(N�
-	��r~wTc�#/���	j���(b���u�pWp{�R�$N���?�p�m�J�
-endstream
-endobj
-17970 0 obj <<
-/Type /Page
-/Contents 17971 0 R
-/Resources 17969 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17646 0 R
-/Annots [ 17874 0 R 17881 0 R 17882 0 R 17883 0 R 17884 0 R 17885 0 R 17886 0 R 17887 0 R 17888 0 R 17889 0 R 17890 0 R 17891 0 R 17892 0 R 17893 0 R 17894 0 R 17895 0 R 17896 0 R 17897 0 R 17898 0 R 17899 0 R 17900 0 R 17901 0 R 17902 0 R 17903 0 R 17904 0 R 17905 0 R 17906 0 R 17907 0 R 17908 0 R 17909 0 R 17910 0 R 17911 0 R 17912 0 R 17913 0 R 17914 0 R 17915 0 R 17916 0 R 17917 0 R 17918 0 R 17919 0 R 17920 0 R 17921 0 R 17922 0 R 17923 0 R 17924 0 R 17925 0 R 17926 0 R 17927 0 R 17 [...]
->> endobj
-17874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.411 708.674 229.367 718.861]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.292 696.719 197.247 706.906]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.937 684.764 203.892 694.951]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.604 672.809 231.559 682.996]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.414 660.854 255.369 671.04]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.041 648.899 178.996 659.085]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.658 636.226 195.613 647.13]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.675 624.271 185.631 635.175]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.374 613.033 151.33 623.22]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.395 601.078 172.35 611.265]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.464 589.123 183.419 599.309]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.812 577.168 207.767 587.354]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.203 565.212 165.158 575.399]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.819 553.257 176.774 563.444]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.022 541.302 175.977 551.489]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.464 528.63 183.419 539.534]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.589 516.674 179.544 527.578]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.358 505.437 182.314 515.623]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.062 493.481 200.017 503.668]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.024 480.809 209.979 491.713]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.476 469.571 209.431 479.758]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.097 456.899 164.052 467.803]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.474 444.943 183.429 455.847]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.009 433.706 245.964 443.892]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.71 421.75 237.665 431.937]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.453 409.795 162.408 419.982]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.044 397.84 209.999 408.027]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-17907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.006 385.885 219.961 396.071]
-/A << /S /GoTo /D (page.78) >>
->> endobj
-17908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.723 373.93 263.678 384.116]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.521 361.975 261.476 372.161]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.203 350.019 258.158 360.206]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-17911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.165 338.064 175.12 348.251]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.819 326.109 176.774 336.296]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-17913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.823 314.154 207.778 324.34]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.782 302.199 186.737 312.385]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.848 290.243 171.803 300.43]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.365 277.945 151.32 288.475]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.585 265.989 236.54 276.52]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.844 254.034 228.799 264.565]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.365 242.423 151.32 252.609]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.365 230.468 151.32 240.654]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.585 218.512 236.54 228.699]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.617 206.557 174.573 216.744]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.726 194.602 201.681 204.789]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.85 182.647 197.805 192.834]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.358 170.692 182.313 180.878]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.246 158.737 212.201 168.923]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.524 146.781 199.479 156.968]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.259 134.826 150.214 145.013]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.452 122.871 157.407 133.058]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.259 110.916 150.214 121.103]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.29 98.961 171.245 109.147]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.738 87.006 227.693 97.192]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.321 75.05 192.276 85.237]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.145 708.674 376.1 718.861]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.846 696.719 367.801 706.906]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.908 684.764 409.863 694.951]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [393.485 672.465 405.44 682.996]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.907 660.854 492.862 671.04]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [478.705 648.899 490.66 659.085]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.874 636.943 450.829 647.13]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-17941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 612.316 498.241 623.22]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-17942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 588.405 511.551 599.309]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-17943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 564.495 511.551 575.399]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-17944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 540.585 511.551 551.489]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-17945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 516.674 511.551 527.578]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-17946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [498.56 492.764 520.477 503.668]
-/A << /S /GoTo /D (page.170d) >>
->> endobj
-17947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 468.854 501.578 479.758]
-/A << /S /GoTo /D (page.124) >>
->> endobj
-17948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 456.899 528.208 467.803]
-/A << /S /GoTo /D (page.422) >>
->> endobj
-17949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 432.988 501.578 443.892]
-/A << /S /GoTo /D (page.125) >>
->> endobj
-17950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 421.033 475.018 431.937]
-/A << /S /GoTo /D (page.160) >>
->> endobj
-17951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 409.078 528.208 419.982]
-/A << /S /GoTo /D (page.423) >>
->> endobj
-17952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 385.168 475.018 396.071]
-/A << /S /GoTo /D (page.159) >>
->> endobj
-17953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [478.007 385.168 494.943 396.071]
-/A << /S /GoTo /D (page.160) >>
->> endobj
-17954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 351.359 362.272 360.206]
-/A << /S /GoTo /D (page.200) >>
->> endobj
-17955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 325.392 530.32 336.296]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-17956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 291.464 362.272 300.43]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-17957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 265.616 530.32 276.52]
-/A << /S /GoTo /D (page.186) >>
->> endobj
-17958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 241.706 514.39 252.609]
-/A << /S /GoTo /D (page.383) >>
->> endobj
-17959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 229.75 511.551 240.654]
-/A << /S /GoTo /D (page.474) >>
->> endobj
-17960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.44 193.885 451.377 204.789]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-17961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.649 170.692 507.585 180.878]
-/A << /S /GoTo /D (page.230) >>
->> endobj
-17962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.826 146.064 497.763 156.968]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-17963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.273 146.064 517.21 156.968]
-/A << /S /GoTo /D (page.282) >>
->> endobj
-17964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 136.166 362.272 145.013]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-17965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 110.199 530.32 121.103]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-17966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 86.288 439.79 97.192]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-17968 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-17972 0 obj <<
-/D [17970 0 R /XYZ 89 770.89 null]
->> endobj
-17969 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18044 0 obj <<
-/Length 1401      
-/Filter /FlateDecode
->>
-stream
-x��Z[S�8~ϯ��&Ӎ�d]l
	)�咅tggi�cl<ul�(@�}�K 	I,�	<@|�9���;G��12�q�:�>3�pL�"j
�

;&��,0nڄ����W�r�� �Fe�O/����7Z�a�w+�
��&&�
ܺ�	�@]�j �rl�){hl`d��ȸn���@(X �:F�`��Z
Hڞ{� �f�<�{�
-O�{I<S
���
X�H�
-hW'-㦋h#��տ�R���e"�ƲL
����
O&�L��D�WK@m˲�5ua�\_-~2~��"f���/W���q!�  ߓ�]�I��ҡ��a�Um����
��=�9Քa��	d�	2�
�P�\�����:�j���a�"m��{�e�5�����z�S|�țL6L�ӧN�g^<�z#���ƒ��m�4�ֲY��?V����1|�^�{e� b���(y.O�z�T3J�[Շ�Ko��^Tn�4�����)C/�f��>���]aw �H�cš�� Qd¥��A��ą:��u�m �һ���%&i�u�
���� �ʡ$v�.u��Sη0�
݌��������^��{�M�t�Si��l"���<
-1zYX8AReri�W��rL��7�h��)
x
ƣFeI�ӡ�W''�
e�3�4��KWqx�,�"�R�YsO,����
��3�z~�W�����k��i�UHYhV����n4Y������
�X��n ����B�6�k,��rd9U
�&�P�^Ƽ�E51`�,�"\ifZ%m�l
q�l����M|��Y[�-�
K�T=P�l��V�<p/��[^�+m��J.s|P�
�~M6ј�����%%h �*���-U��&��[CXu�'�
϶��1�;���L�$r
��X���{�~�ҹ"
��h
';m6l#zjR��meզ���oB����c��1� c(2�`�~Lur!]��*��đ�J��8o��Y����5���!o�7B�Ĭx�rܿ��o̱]l�R��x.mIW��B\R�֯t�o�6�R��7D�>��!���v�7DDç�E�g2��W��c��P�:�ޥU�l�eu�e/����~����k�ԇ_�_��A��O�F���k�m+5:�l�`�n��=lnv�hH����D�&�?Y�լx�����D���vx����EEM��l?��&K��{��U�U���9�����	f���2�,�濫_�Pd2d�~a�03�8٧)�[��1��\<�n��N [...]
-endstream
-endobj
-18043 0 obj <<
-/Type /Page
-/Contents 18044 0 R
-/Resources 18042 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 17646 0 R
-/Annots [ 17967 0 R 17974 0 R 17975 0 R 17976 0 R 17977 0 R 17978 0 R 17979 0 R 17980 0 R 17981 0 R 17982 0 R 17983 0 R 17984 0 R 17985 0 R 17986 0 R 17987 0 R 17988 0 R 17989 0 R 17990 0 R 17991 0 R 17992 0 R 17993 0 R 17994 0 R 17995 0 R 17996 0 R 17997 0 R 17998 0 R 17999 0 R 18000 0 R 18001 0 R 18002 0 R 18003 0 R 18004 0 R 18005 0 R 18006 0 R 18007 0 R 18008 0 R 18009 0 R 18010 0 R 18011 0 R 18012 0 R 18013 0 R 18014 0 R 18015 0 R 18016 0 R 18017 0 R 18018 0 R 18019 0 R 18020 0 R 18 [...]
->> endobj
-17967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 707.957 290.068 718.861]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-17974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 696.002 283.443 706.906]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-17975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.823 684.047 281.759 694.951]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-17976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 672.092 304.524 682.996]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-17977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 638.283 145.791 647.13]
-/A << /S /GoTo /D (page.134) >>
->> endobj
-17978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.261 624.271 306.197 635.175]
-/A << /S /GoTo /D (page.326) >>
->> endobj
-17979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.155 612.316 305.092 623.22]
-/A << /S /GoTo /D (page.341) >>
->> endobj
-17980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.355 588.405 305.291 599.309]
-/A << /S /GoTo /D (page.484) >>
->> endobj
-17981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 564.495 223.309 575.399]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-17982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 540.585 285.097 551.489]
-/A << /S /GoTo /D (page.127) >>
->> endobj
-17983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 528.63 258.537 539.534]
-/A << /S /GoTo /D (page.161) >>
->> endobj
-17984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 516.674 260.191 527.578]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-17985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 504.719 311.727 515.623]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-17986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 481.526 186.747 491.713]
-/A << /S /GoTo /D (page.457) >>
->> endobj
-17987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 458.956 145.791 467.803]
-/A << /S /GoTo /D (page.506) >>
->> endobj
-17988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 444.943 287.867 455.847]
-/A << /S /GoTo /D (page.542) >>
->> endobj
-17989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 421.033 231.409 431.937]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-17990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 397.123 231.409 408.027]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-17991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 373.212 231.409 384.116]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-17992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.654 349.302 289.59 360.206]
-/A << /S /GoTo /D (page.208) >>
->> endobj
-17993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.101 349.302 309.037 360.206]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-17994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 314.154 145.791 324.34]
-/A << /S /GoTo /D (page.215) >>
->> endobj
-17995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 314.154 165.716 324.34]
-/A << /S /GoTo /D (page.216) >>
->> endobj
-17996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 289.526 260.191 300.43]
-/A << /S /GoTo /D (page.319) >>
->> endobj
-17997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 255.718 145.791 264.565]
-/A << /S /GoTo /D (page.220) >>
->> endobj
-17998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.158 230.468 211.095 240.654]
-/A << /S /GoTo /D (page.224) >>
->> endobj
-17999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 205.84 285.097 216.744]
-/A << /S /GoTo /D (page.113) >>
->> endobj
-18000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 193.885 258.537 204.789]
-/A << /S /GoTo /D (page.146) >>
->> endobj
-18001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 181.93 260.191 192.834]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-18002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 169.975 311.727 180.878]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-18003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 146.781 186.747 156.968]
-/A << /S /GoTo /D (page.445) >>
->> endobj
-18004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 124.092 145.791 133.058]
-/A << /S /GoTo /D (page.493) >>
->> endobj
-18005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 110.199 287.867 121.103]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-18006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.028 86.288 282.965 97.192]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.475 86.288 302.412 97.192]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 698.059 362.272 706.906]
-/A << /S /GoTo /D (page.247) >>
->> endobj
-18009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.836 672.029 521.772 682.933]
-/A << /S /GoTo /D (page.482) >>
->> endobj
-18010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 648.056 530.32 658.96]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 624.083 501.578 634.987]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 612.097 475.018 623.001]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-18013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 600.11 476.672 611.014]
-/A << /S /GoTo /D (page.309) >>
->> endobj
-18014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 588.124 528.208 599.028]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-18015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 564.899 403.228 575.086]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-18016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 542.178 362.272 551.144]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-18017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 528.254 504.348 539.158]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-18018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 504.281 514.39 515.185]
-/A << /S /GoTo /D (page.381) >>
->> endobj
-18019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 492.295 511.551 503.199]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 468.322 514.39 479.226]
-/A << /S /GoTo /D (page.381) >>
->> endobj
-18021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 456.335 511.551 467.239]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 432.362 504.348 443.266]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-18023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 408.389 504.348 419.293]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-18024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 373.932 439.79 384.836]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 349.959 506.55 360.863]
-/A << /S /GoTo /D (page.212) >>
->> endobj
-18026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 337.973 499.924 348.877]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 325.986 498.241 336.89]
-/A << /S /GoTo /D (page.286) >>
->> endobj
-18028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 314 521.005 324.904]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-18029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 290.027 439.79 300.931]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 266.054 501.578 276.958]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-18031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 254.068 475.018 264.971]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 242.081 476.672 252.985]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-18033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 230.095 528.208 240.999]
-/A << /S /GoTo /D (page.417) >>
->> endobj
-18034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 206.87 403.228 217.057]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-18035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 184.269 362.272 193.115]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-18036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 158.238 439.79 169.142]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-18037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.897 134.266 510.834 145.169]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-18038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 110.293 530.32 121.197]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 98.306 513.045 109.21]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.208 74.333 489.145 85.237]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-18041 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18045 0 obj <<
-/D [18043 0 R /XYZ 89 770.89 null]
->> endobj
-18042 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18122 0 obj <<
-/Length 1448      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�8~���m��H	�[�:�t��Mܙ�I;d–�#��_qq��
Ǚ��
��|�9�;B@�5�]��ƽ�s��
�!�h�� �2

y�iw���
���k&�u��|���-�7����C�V���i�[��F���@�d�{
�ckߋ�"�D����ާ
XB@
�:�ew^0@��/
��3��&(�GX;�7:�U�9@�g"bt���{�	F���`bqr�6�]�3N�?f��i�Ŀf���_rs�+_Nʗc\�
:Nu{�[;2
�ư�`?�����\�,[��
!
�Ȇ���@vw"�*�P�0��ᛌ�D2�iq'1
�� |.�,�g�:*@����{6�
d at dn&C���G�뱳�
�7��
�G7c~���)9�&�M����TA�Dh�d - W�����po�r��i~����D"o�841�Le�F�D噼�;�w.�I��Pf���ܛϪiG<+�
Nt�&������ף��[���7o��W,�����٥�b:����&���]���ϧW���
t4�4LNæ�_ʍ`x�u�qU��֙����2e�?�Yؑ�{�~��{��<��
�B��
���zA����I���J�ܕc3`K�����&
)d;BZ1H���KU� �h��qw�ڦU�SI���
�Lj�d�w�R3�h8��cِ������(ϗ��GM���J�eg?��ѥ
-���A���C]\���m����"
->f,�h:�)C��8�8^�K�[�
o�A���E��9"�nʡ���+(Sk*:3״��
Zf�ȊjQTa�����5#�^��yR[
�k�b��F!���	Y��$R�#��N�yPᚳ�t �K��X��N�˯�l-�W��������6�+0l��I;��]
�U�e�]2�Q"2���"��:��0Z�j�����Ɩ�I������R�<F��I>+�>��T�n���	˂اE�Q��j�Q�x��Vj�YHyZ�
-vû�ȭuV��<�;�}g[=�%V��/ ��/:ݍ����Z�y�6�
��Ys.1v���
�X+
Z�o��$\��
C�>b^���b�Mhn�fw�/ �UMi󸣘ߺ��A1��b������y�t6�n�2�>�t�4���K
���༗E�`�\C��T���=ul�+�=�xKW�{F�Ɋ���U
uq3<
o��Z�hP�H�hP�g	h��釃j0��v�ާ$|�E�u�z��JDe�_�ha�SZ��y��BŜQ>�&�r.h�U��e{�_ߥB�n!Cu��rw��;�����ұS-Ɍ�+G
��ʃ�)�
0���5��/]���A��/���2��@�C}pd��r�yeG	���<�3߱�W�@l��徜�,��
O�~�c_w��!u;

X��YYX�`���,����6$N}��g�#P'-��d>��e�����������22�w�$�i#���tc
-endstream
-endobj
-18121 0 obj <<
-/Type /Page
-/Contents 18122 0 R
-/Resources 18120 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18124 0 R
-/Annots [ 18046 0 R 18047 0 R 18048 0 R 18049 0 R 18050 0 R 18051 0 R 18052 0 R 18053 0 R 18054 0 R 18055 0 R 18056 0 R 18057 0 R 18058 0 R 18059 0 R 18060 0 R 18061 0 R 18062 0 R 18063 0 R 18064 0 R 18065 0 R 18066 0 R 18067 0 R 18068 0 R 18069 0 R 18070 0 R 18071 0 R 18072 0 R 18073 0 R 18074 0 R 18075 0 R 18076 0 R 18077 0 R 18078 0 R 18079 0 R 18080 0 R 18081 0 R 18082 0 R 18083 0 R 18084 0 R 18085 0 R 18086 0 R 18087 0 R 18088 0 R 18089 0 R 18090 0 R 18091 0 R 18092 0 R 18093 0 R 18 [...]
->> endobj
-18046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 685.952 145.791 694.918]
-/A << /S /GoTo /D (page.199) >>
->> endobj
-18047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.823 660.04 281.759 670.943]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 648.052 304.524 658.956]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-18049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 624.077 285.097 634.981]
-/A << /S /GoTo /D (page.124) >>
->> endobj
-18050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 612.09 258.537 622.994]
-/A << /S /GoTo /D (page.159) >>
->> endobj
-18051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 600.102 260.191 611.006]
-/A << /S /GoTo /D (page.319) >>
->> endobj
-18052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 588.115 311.727 599.019]
-/A << /S /GoTo /D (page.421) >>
->> endobj
-18053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 578.316 145.791 587.063]
-/A << /S /GoTo /D (page.422) >>
->> endobj
-18054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 552.934 186.747 563.121]
-/A << /S /GoTo /D (page.456) >>
->> endobj
-18055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 528.991 145.791 539.178]
-/A << /S /GoTo /D (page.500) >>
->> endobj
-18056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 528.991 165.716 539.178]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-18057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.452 516.287 287.388 527.191]
-/A << /S /GoTo /D (page.539) >>
->> endobj
-18058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.899 516.287 306.836 527.191]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-18059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 481.811 223.309 492.714]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 457.836 223.309 468.74]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 433.861 283.443 444.765]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 399.988 145.791 408.834]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-18063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 373.956 313.839 384.859]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.682 349.981 284.619 360.885]
-/A << /S /GoTo /D (page.131) >>
->> endobj
-18065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.129 349.981 304.066 360.885]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 337.993 258.537 348.897]
-/A << /S /GoTo /D (page.166) >>
->> endobj
-18067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.526 337.993 278.462 348.897]
-/A << /S /GoTo /D (page.167) >>
->> endobj
-18068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.345 326.006 281.281 336.91]
-/A << /S /GoTo /D (page.283) >>
->> endobj
-18069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.792 326.006 300.728 336.91]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 314.018 316.708 324.922]
-/A << /S /GoTo /D (page.429d) >>
->> endobj
-18071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 290.043 297.909 300.947]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-18072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 266.068 313.839 276.972]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.627 254.081 296.564 264.985]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 230.106 285.097 241.01]
-/A << /S /GoTo /D (page.129) >>
->> endobj
-18075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 218.118 258.537 229.022]
-/A << /S /GoTo /D (page.163) >>
->> endobj
-18076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 206.131 260.191 217.035]
-/A << /S /GoTo /D (page.323) >>
->> endobj
-18077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 194.143 311.727 205.047]
-/A << /S /GoTo /D (page.426) >>
->> endobj
-18078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 170.918 186.747 181.105]
-/A << /S /GoTo /D (page.458) >>
->> endobj
-18079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 148.315 145.791 157.162]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-18080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 134.271 287.867 145.175]
-/A << /S /GoTo /D (page.544) >>
->> endobj
-18081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 110.296 285.097 121.2]
-/A << /S /GoTo /D (page.117) >>
->> endobj
-18082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 98.308 311.727 109.212]
-/A << /S /GoTo /D (page.427) >>
->> endobj
-18083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 74.333 290.068 85.237]
-/A << /S /GoTo /D (page.208) >>
->> endobj
-18084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 707.957 499.924 718.861]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 695.952 498.241 706.856]
-/A << /S /GoTo /D (page.278) >>
->> endobj
-18086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 683.946 521.005 694.85]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 659.936 499.924 670.839]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 647.93 498.241 658.834]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 635.925 521.005 646.829]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-18090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 611.914 530.32 622.818]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 601.896 362.272 610.863]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 555.25 362.272 564.097]
-/A << /S /GoTo /D (page.267) >>
->> endobj
-18093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 529.182 514.39 540.086]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-18094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 505.171 439.79 516.075]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.974 469.205 391.911 480.109]
-/A << /S /GoTo /D (page.203) >>
->> endobj
-18096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 445.195 530.32 456.098]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 421.184 501.578 432.088]
-/A << /S /GoTo /D (page.129) >>
->> endobj
-18098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 409.178 475.018 420.082]
-/A << /S /GoTo /D (page.163) >>
->> endobj
-18099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 397.173 476.672 408.077]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-18100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 385.168 528.208 396.071]
-/A << /S /GoTo /D (page.426) >>
->> endobj
-18101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 361.924 403.228 372.111]
-/A << /S /GoTo /D (page.459) >>
->> endobj
-18102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 339.304 362.272 348.15]
-/A << /S /GoTo /D (page.508) >>
->> endobj
-18103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 325.241 504.348 336.145]
-/A << /S /GoTo /D (page.544) >>
->> endobj
-18104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 301.23 447.89 312.134]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-18105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 277.219 501.578 288.123]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 265.214 475.018 276.118]
-/A << /S /GoTo /D (page.148) >>
->> endobj
-18107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 253.209 476.672 264.113]
-/A << /S /GoTo /D (page.309) >>
->> endobj
-18108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 241.203 528.208 252.107]
-/A << /S /GoTo /D (page.411) >>
->> endobj
-18109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 229.198 504.348 240.102]
-/A << /S /GoTo /D (page.528) >>
->> endobj
-18110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 194.387 439.79 205.291]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 170.376 439.79 181.28]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 146.366 530.32 157.27]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 134.36 513.045 145.264]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 110.349 530.32 121.253]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 98.344 513.045 109.248]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.164 74.333 501.1 85.237]
-/A << /S /GoTo /D (page.120) >>
->> endobj
-18117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [503.611 74.333 520.547 85.237]
-/A << /S /GoTo /D (page.121) >>
->> endobj
-18119 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18123 0 obj <<
-/D [18121 0 R /XYZ 89 770.89 null]
->> endobj
-18120 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18197 0 obj <<
-/Length 1373      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�8~�W�ma�8�X6�[H�6MhCf:�v4
-�Sla�f�JƄK �"Mv�/�.�>
}�
Y�
--`�֎z��[��ȵz����6q�]`�ԉ�6~�>Z�����?>�hw���N�vWSρg���~\���@>�h�-�!/[��d]վ��2,�@^#by��z�6 �33�MG�C
Fϣ[�����Q���
�
�
L_Ok�MP��-
-�:�?MٺO�F�"
-J��p���zi
�
�e?ca����1��@u���AE��
-Ł�j��J)Wp�2��h�H��`��A37�M=ҮHe���C���;��5
�i�d��w
D�\țJ|�*�& �{�(MJ���J����6�#��B�p�F�?<�l��� J8


�,�
k ,먭� �G2_��Tj�x����i{� M
s�

�)��=Dِ���3A�������R��s�"/$Pju�-���1_�z��|��s�qڟff�vϺ�*
M�(M�E�j���6ط[��:C�
-3�O�K(C��A�Sk��q��xOLE+�XC������!
-x%!e�I&f�^DžmV�g6��<Q?�~�:�W?R
mpo=u|W��e�.�>b��LMzڏ�"h�<�ȕj��K/�x�J�Z����(�c&�䕋>s-�n�v�c=N�s5��D�Iƒ�ޫ�b��a���
�'���
C�]~�k,v�|�9V(E��Љ���.6��/<1�3e�Rxs�0���6 ��e{1�o�(K��*�!KV�?UCص
�Y.ƶ��W��� ̽�t8��z�R���.
d��n?֠���Z1��cTֳ@�
�V4�fRo�F� ��ؿ�e�����#7��
-C�j�٭9�<{�W�nڄ6�M�}��2�Ћ!���<����41�
o�hJ�D�
-�}$���fJ�&�
][EJq�H/sWDGK��x��2�5([��x+0T	]����j
�
-^�w�-����
-��Kv��W��Y�.�Y��] ^X����
}������VY9~����xΒp����3��*�~��ٜ6����\�]�n��2�N��g+3o���󓷛&w̗����
�mv��&|��VC;�z��v����%�,�7�Ǘ����.8?<�75h��D���!����@)Q��D'
-���KB�=R��zF��6f��g4\d{��X��x6���
w5`�y(�|����)

���j���EsM�^s���H��]��O����HŠ29_�aa������z��_
B���g��ݎ��; `�����fq�
�sh7�XR{�yA�
��'؟�����86!h~f�e�Ã��i8�Ih��x������
�ּ�@f�9�8ŀ�D}hb���Ґ��;��
-endstream
-endobj
-18196 0 obj <<
-/Type /Page
-/Contents 18197 0 R
-/Resources 18195 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18124 0 R
-/Annots [ 18118 0 R 18126 0 R 18127 0 R 18128 0 R 18129 0 R 18130 0 R 18131 0 R 18132 0 R 18133 0 R 18134 0 R 18135 0 R 18136 0 R 18137 0 R 18138 0 R 18139 0 R 18140 0 R 18141 0 R 18142 0 R 18143 0 R 18144 0 R 18145 0 R 18146 0 R 18147 0 R 18148 0 R 18149 0 R 18150 0 R 18151 0 R 18152 0 R 18153 0 R 18154 0 R 18155 0 R 18156 0 R 18157 0 R 18158 0 R 18159 0 R 18160 0 R 18161 0 R 18162 0 R 18163 0 R 18164 0 R 18165 0 R 18166 0 R 18167 0 R 18168 0 R 18169 0 R 18170 0 R 18171 0 R 18172 0 R 18 [...]
->> endobj
-18118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 707.957 258.537 718.861]
-/A << /S /GoTo /D (page.156) >>
->> endobj
-18126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 696.002 260.191 706.906]
-/A << /S /GoTo /D (page.316) >>
->> endobj
-18127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.179 696.002 280.116 706.906]
-/A << /S /GoTo /D (page.317) >>
->> endobj
-18128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 684.047 311.727 694.951]
-/A << /S /GoTo /D (page.418) >>
->> endobj
-18129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 674.029 145.791 682.996]
-/A << /S /GoTo /D (page.419) >>
->> endobj
-18130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 648.899 186.747 659.085]
-/A << /S /GoTo /D (page.453) >>
->> endobj
-18131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.736 648.899 206.672 659.085]
-/A << /S /GoTo /D (page.454) >>
->> endobj
-18132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 624.988 145.791 635.175]
-/A << /S /GoTo /D (page.502) >>
->> endobj
-18133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 624.988 165.716 635.175]
-/A << /S /GoTo /D (page.503) >>
->> endobj
-18134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.452 612.316 287.388 623.22]
-/A << /S /GoTo /D (page.536) >>
->> endobj
-18135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.899 612.316 306.836 623.22]
-/A << /S /GoTo /D (page.537) >>
->> endobj
-18136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.682 588.405 284.619 599.309]
-/A << /S /GoTo /D (page.121) >>
->> endobj
-18137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.129 588.405 304.066 599.309]
-/A << /S /GoTo /D (page.122) >>
->> endobj
-18138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 576.45 258.537 587.354]
-/A << /S /GoTo /D (page.156) >>
->> endobj
-18139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.526 576.45 278.462 587.354]
-/A << /S /GoTo /D (page.157) >>
->> endobj
-18140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 564.495 260.191 575.399]
-/A << /S /GoTo /D (page.316) >>
->> endobj
-18141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.179 564.495 280.116 575.399]
-/A << /S /GoTo /D (page.317) >>
->> endobj
-18142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 552.54 311.727 563.444]
-/A << /S /GoTo /D (page.419) >>
->> endobj
-18143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 542.642 145.791 551.489]
-/A << /S /GoTo /D (page.420) >>
->> endobj
-18144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 517.392 186.747 527.578]
-/A << /S /GoTo /D (page.453) >>
->> endobj
-18145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.736 517.392 206.672 527.578]
-/A << /S /GoTo /D (page.454) >>
->> endobj
-18146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 494.821 145.791 503.668]
-/A << /S /GoTo /D (page.503) >>
->> endobj
-18147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.452 480.809 287.388 491.713]
-/A << /S /GoTo /D (page.536) >>
->> endobj
-18148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.899 480.809 306.836 491.713]
-/A << /S /GoTo /D (page.537) >>
->> endobj
-18149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 456.899 285.097 467.803]
-/A << /S /GoTo /D (page.116) >>
->> endobj
-18150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 444.943 311.727 455.847]
-/A << /S /GoTo /D (page.415) >>
->> endobj
-18151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 432.988 287.867 443.892]
-/A << /S /GoTo /D (page.533) >>
->> endobj
-18152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 399.06 145.791 408.027]
-/A << /S /GoTo /D (page.479) >>
->> endobj
-18153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.823 373.212 281.759 384.116]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 339.285 145.791 348.251]
-/A << /S /GoTo /D (page.289) >>
->> endobj
-18155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 313.437 260.191 324.34]
-/A << /S /GoTo /D (page.320) >>
->> endobj
-18156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 279.509 145.791 288.475]
-/A << /S /GoTo /D (page.496) >>
->> endobj
-18157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 243.643 145.791 252.609]
-/A << /S /GoTo /D (page.496) >>
->> endobj
-18158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.602 217.795 284.539 228.699]
-/A << /S /GoTo /D (page.271) >>
->> endobj
-18159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 193.885 295.069 204.789]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-18160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.602 169.975 284.539 180.878]
-/A << /S /GoTo /D (page.270) >>
->> endobj
-18161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.602 146.064 284.539 156.968]
-/A << /S /GoTo /D (page.271) >>
->> endobj
-18162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 122.154 258.537 133.058]
-/A << /S /GoTo /D (page.163) >>
->> endobj
-18163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.602 110.199 284.539 121.103]
-/A << /S /GoTo /D (page.270) >>
->> endobj
-18164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 86.288 313.839 97.192]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 707.957 530.32 718.861]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 683.946 481.653 694.85]
-/A << /S /GoTo /D (page.303d) >>
->> endobj
-18167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 659.936 521.005 670.839]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 625.907 362.272 634.873]
-/A << /S /GoTo /D (page.339) >>
->> endobj
-18169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 599.959 521.005 610.863]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 590.061 362.272 598.907]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-18171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 563.993 525.987 574.897]
-/A << /S /GoTo /D (page.333d) >>
->> endobj
-18172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 529.182 501.578 540.086]
-/A << /S /GoTo /D (page.126) >>
->> endobj
-18173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 517.177 504.348 528.081]
-/A << /S /GoTo /D (page.541) >>
->> endobj
-18174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 493.166 475.018 504.07]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.719 469.155 507.655 480.059]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 445.144 475.018 456.048]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 421.134 501.578 432.037]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 409.128 475.018 420.032]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 397.123 476.672 408.027]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-18180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 385.117 528.208 396.021]
-/A << /S /GoTo /D (page.427) >>
->> endobj
-18181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 361.874 403.228 372.061]
-/A << /S /GoTo /D (page.459) >>
->> endobj
-18182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 339.134 362.272 348.1]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-18183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 325.191 504.348 336.095]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-18184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 290.38 439.79 301.284]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 266.369 439.79 277.273]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 242.359 439.79 253.263]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 218.348 439.79 229.252]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 194.337 439.79 205.241]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 170.326 439.79 181.23]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 146.315 439.79 157.219]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 112.506 362.272 121.253]
-/A << /S /GoTo /D (page.222) >>
->> endobj
-18192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.028 98.344 528.965 109.248]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 74.333 530.32 85.237]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18194 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18198 0 obj <<
-/D [18196 0 R /XYZ 89 770.89 null]
->> endobj
-18195 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18272 0 obj <<
-/Length 1365      
-/Filter /FlateDecode
->>
-stream
-x��ZYW�8~ϯ��$���,K�y+;� )�s���[O�Yia~��K�b�dμ�����]t� cl 㨳;�l:�pM�X��.0
�51Q�|�{r��W���a��	0Q��
-�8Yq�`Թ�@U
-
X�Ʀ�7��s�
�*�d �}�W�(2l
���q���ρ0B�b� �Le��66�T��qQ;�A�e"bt������k������-�~� �r��M�k.~ϑ�Ÿ�~q�1��,`u�
�85��=r4�%袗���k�1|�*�S.�DtDJⱘ�����!�<Z
-��
�y�8�O�x���h!W�$�3
c.�t2Q��i�S���8��
ͫ���8v���-��E&�A��`	m�{������S)��k�&F�ܓA�l����|��H���v��3c�����2�RVʀ��������֓fg��E����m
�:�0Q�r��z��ʌO.�����(�k�������8,
���B�a�0�c�3D�'�+w\ qnH&n[rA̙��Y�DDu� -�z6��̆��f����;`�x�Ƽ�u�|�-�̫
0e:��RAJ� ���Y��	��a&G�w���D+��J���6��2����X�V|m���k�h}��"z���J�2i��'q*S���l�¼�
�n�>l�CTk&e��He�E��*���(g��l k���ԑ�^�Vx��s�Ş���?7;��f��bOQ�
a,׭�E��W+�	B&��gL<n^_-"}{%'}gA��?A��x����pԪ-�(�8���8���$��n��o"���{t�� [�׼�j��f���!�ӓa�u��Q]��㹡Ak���4Yr�`=�H6�I�����Vp���DT�T�L&��*���$�~3��D�,���Qzw�;;�Pu�A
s������oY���������
|��q�*�cOok8G�ft��lsH�y'g
-S7]sZ��隥�}�l
��3$ˮf���aB�D#[�f�-�b�z���i���P�v�n��eɣ��uL��Z)�A"��N���)���{�G5a�v��d��!T�A���Ef���&��@�+)w�.2y��f&.�ADj�����W���@�����ͽ{�X���TswKZ���� �3)�ǀZ	b�uo�!�Ri�>���/��K0~츛"ܙ{�2���X�c!ݗ$�
���b�/Hl�Ī}}t[������r�[�nZ�>equ��o ���K�RB�rh����d���r���٫�

-Ķ�R���̭�������8�����G"f�pM��7jے��Q
-Ī0��gVor*
1�&!Vń"�L 
��[<��+��e��I���D��X�_���
-endstream
-endobj
-18271 0 obj <<
-/Type /Page
-/Contents 18272 0 R
-/Resources 18270 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18124 0 R
-/Annots [ 18201 0 R 18202 0 R 18203 0 R 18204 0 R 18205 0 R 18206 0 R 18207 0 R 18208 0 R 18209 0 R 18210 0 R 18211 0 R 18212 0 R 18213 0 R 18214 0 R 18215 0 R 18216 0 R 18217 0 R 18218 0 R 18219 0 R 18220 0 R 18221 0 R 18222 0 R 18223 0 R 18224 0 R 18225 0 R 18226 0 R 18227 0 R 18228 0 R 18229 0 R 18230 0 R 18231 0 R 18232 0 R 18233 0 R 18234 0 R 18235 0 R 18236 0 R 18237 0 R 18238 0 R 18239 0 R 18240 0 R 18241 0 R 18242 0 R 18243 0 R 18244 0 R 18245 0 R 18246 0 R 18247 0 R 18248 0 R 18 [...]
->> endobj
-18201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 696.002 313.839 706.906]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 685.984 145.791 694.951]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 650.239 145.791 659.085]
-/A << /S /GoTo /D (page.216) >>
->> endobj
-18204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 626.209 145.791 635.175]
-/A << /S /GoTo /D (page.339) >>
->> endobj
-18205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 600.361 285.097 611.265]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-18206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 588.405 311.727 599.309]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-18207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 564.495 285.097 575.399]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-18208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 552.54 258.537 563.444]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 540.585 260.191 551.489]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-18210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 528.63 311.727 539.534]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-18211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 505.437 186.747 515.623]
-/A << /S /GoTo /D (page.451) >>
->> endobj
-18212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 482.866 145.791 491.713]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-18213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 468.854 287.867 479.758]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-18214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 434.926 145.791 443.892]
-/A << /S /GoTo /D (page.269) >>
->> endobj
-18215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.416 421.033 294.352 431.937]
-/A << /S /GoTo /D (page.373) >>
->> endobj
-18216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 397.123 223.309 408.027]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-18217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 373.212 260.191 384.116]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-18218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 349.302 285.097 360.206]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 337.347 258.537 348.251]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-18220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 325.392 260.191 336.296]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-18221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 313.437 311.727 324.34]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-18222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 290.243 186.747 300.43]
-/A << /S /GoTo /D (page.445) >>
->> endobj
-18223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 267.554 145.791 276.52]
-/A << /S /GoTo /D (page.493) >>
->> endobj
-18224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 253.661 287.867 264.565]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-18225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 229.75 283.443 240.654]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.823 217.795 281.759 228.699]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 205.84 304.524 216.744]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-18228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 183.987 145.791 192.834]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-18229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 158.019 290.068 168.923]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 134.109 283.443 145.013]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.823 122.154 281.759 133.058]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 110.199 304.524 121.103]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-18233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 86.288 290.068 97.192]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 74.333 283.443 85.237]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 695.973 530.32 706.877]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 672.005 530.32 682.908]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 648.036 530.32 658.94]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 624.068 530.32 634.972]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 600.099 506.55 611.003]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 576.131 514.39 587.035]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-18241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 564.147 511.551 575.051]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-18242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 540.179 506.55 551.082]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 528.194 499.924 539.098]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 504.226 476.672 515.13]
-/A << /S /GoTo /D (page.306) >>
->> endobj
-18245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.028 480.258 528.965 491.162]
-/A << /S /GoTo /D (page.350) >>
->> endobj
-18246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.748 468.273 494.684 479.177]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-18247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 433.859 439.79 444.763]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 409.89 439.79 420.794]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 385.922 498.241 396.826]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 373.938 521.005 384.842]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.164 349.969 501.1 360.873]
-/A << /S /GoTo /D (page.132) >>
->> endobj
-18252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [503.611 349.969 520.547 360.873]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 337.985 479.999 348.889]
-/A << /S /GoTo /D (page.166d) >>
->> endobj
-18254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 326.001 503.222 336.905]
-/A << /S /GoTo /D (page.284d) >>
->> endobj
-18255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 314.017 533.19 324.921]
-/A << /S /GoTo /D (page.429d) >>
->> endobj
-18256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 290.049 530.32 300.952]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 278.064 513.045 288.968]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.669 254.096 491.606 265]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-18259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 230.128 530.32 241.032]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 206.159 530.32 217.063]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 182.191 501.578 193.095]
-/A << /S /GoTo /D (page.125) >>
->> endobj
-18262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 170.207 528.208 181.111]
-/A << /S /GoTo /D (page.423) >>
->> endobj
-18263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 146.238 504.348 157.142]
-/A << /S /GoTo /D (page.540) >>
->> endobj
-18264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 122.27 501.578 133.174]
-/A << /S /GoTo /D (page.126) >>
->> endobj
-18265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 110.286 475.018 121.19]
-/A << /S /GoTo /D (page.160) >>
->> endobj
-18266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 98.302 528.208 109.206]
-/A << /S /GoTo /D (page.424) >>
->> endobj
-18267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 74.333 501.578 85.237]
-/A << /S /GoTo /D (page.127) >>
->> endobj
-18269 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18273 0 obj <<
-/D [18271 0 R /XYZ 89 770.89 null]
->> endobj
-18270 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18344 0 obj <<
-/Length 1343      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~����lMtA�m����q�n��N�
F��Yn
8���
-0�!1߶}2��;G����\�E�d�9:7��tF��w�i0�P�o��v�i���?k��({e�W�g_���q�G'�4��&�iiS�s�
h3y��t�,�1k�i����n:�w�*
-V�@ ��Lu�QG=H�<�=
-��{1��}�L"
=���
X�(�/�}��h�}D@�p� [��|��
�1#�u<'3{��h!���E:�S�0py����ؙ�Y�J6�ދș5 ��@�����@�2���Eē ��}��/6�P�V��.2Y�m����{d�i��
6�H�s�t���s��s
�gOa$�L2��5�K���a�%��)� �6����&��H�>��4�&�� ��
�R�(Ry�3��O[E��w��)Py��N��V��gB(�:|�
-��
�P�s��j�o8~��۲Q��Mȣ�I6��
Z,���H�QD�O+f��y�����~�q��
��p�G���m��4�ؔ��
@���&4-��0�ݩs�2�ND�Bi	�
c
-��IG�
Bk[�e�oL6jn
d�p't�i�:�}����0���u�\X֡���3�B���k�2�V�H=������Ȟ
�s�p
P�t�X�j���`8���xp}��z��ܟ/�\��~"��
]>
a3���
��D�b�S�
w8�z\��݃+��dz���\��J���
�0�FB
O�jg���U�NF�M�v��
J#�|��IeX�b�7L��ZaG96˪�ȶ�h�^��'� ��
E�To3��h�
��<W‚-\�eE�<�M“E��\�*��C;�1{�x�O�-?��>9�o�y؄
-"ks��OM�[�6�����_O>|�6GJrҨ&d�������E�S1[�)-e��i��������;�
-V�
-VJ�'�+mfۨ�j�@���1����
%Nu֚�8�`��V�o@�5%�����	k0����kd�����َe���s(�Z��
- �_�9�,��Ws��몂(h;��T5����Cim�9;���k΁D��i�VG����
�F�����V�{1��j���W
o"����b[,�#;����\4n;V
�6���!�w�$�P���G����S�&ª�
V:�NXv<�G� �&�
�^g�>�Gk��4�j�/��_
g(,�Qjdg(,���e������x�F�����~�ҍ��C�/��_�
xH�@&k��)Wx
��P����ߍ(B�������p	Y�C
�T
"�O����h���Ÿ���+ż�
c:0���]�`d_:���W�앵^��=��
-endstream
-endobj
-18343 0 obj <<
-/Type /Page
-/Contents 18344 0 R
-/Resources 18342 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18124 0 R
-/Annots [ 18268 0 R 18276 0 R 18277 0 R 18278 0 R 18279 0 R 18280 0 R 18281 0 R 18282 0 R 18283 0 R 18284 0 R 18285 0 R 18286 0 R 18287 0 R 18288 0 R 18289 0 R 18290 0 R 18291 0 R 18292 0 R 18293 0 R 18294 0 R 18295 0 R 18296 0 R 18297 0 R 18298 0 R 18299 0 R 18300 0 R 18301 0 R 18302 0 R 18303 0 R 18304 0 R 18305 0 R 18306 0 R 18307 0 R 18308 0 R 18309 0 R 18310 0 R 18311 0 R 18312 0 R 18313 0 R 18314 0 R 18315 0 R 18316 0 R 18317 0 R 18318 0 R 18319 0 R 18320 0 R 18321 0 R 18322 0 R 18 [...]
->> endobj
-18268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 707.957 287.867 718.861]
-/A << /S /GoTo /D (page.541) >>
->> endobj
-18276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 683.97 260.191 694.874]
-/A << /S /GoTo /D (page.320) >>
->> endobj
-18277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 659.982 260.191 670.886]
-/A << /S /GoTo /D (page.321) >>
->> endobj
-18278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 635.995 260.191 646.899]
-/A << /S /GoTo /D (page.321) >>
->> endobj
-18279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.345 612.007 281.281 622.911]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.792 612.007 300.728 622.911]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 602.109 145.791 610.956]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 566.167 150.772 575.013]
-/A << /S /GoTo /D (page.358d) >>
->> endobj
-18283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.416 540.122 294.352 551.026]
-/A << /S /GoTo /D (page.372) >>
->> endobj
-18284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 504.897 145.791 515.083]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-18285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 504.897 165.716 515.083]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-18286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 470.294 145.791 479.141]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-18287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.131 432.294 221.068 443.198]
-/A << /S /GoTo /D (page.566) >>
->> endobj
-18288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 398.289 145.791 407.255]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-18289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.09 360.409 200.027 371.313]
-/A << /S /GoTo /D (page.176) >>
->> endobj
-18290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 338.517 145.791 347.364]
-/A << /S /GoTo /D (page.201) >>
->> endobj
-18291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 312.511 226.049 323.415]
-/A << /S /GoTo /D (page.233) >>
->> endobj
-18292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 288.562 226.049 299.466]
-/A << /S /GoTo /D (page.255) >>
->> endobj
-18293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 264.613 226.049 275.517]
-/A << /S /GoTo /D (page.258) >>
->> endobj
-18294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 242.722 145.791 251.568]
-/A << /S /GoTo /D (page.267) >>
->> endobj
-18295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 216.715 226.049 227.619]
-/A << /S /GoTo /D (page.389) >>
->> endobj
-18296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 192.766 226.049 203.67]
-/A << /S /GoTo /D (page.433) >>
->> endobj
-18297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.09 168.818 200.027 179.722]
-/A << /S /GoTo /D (page.558) >>
->> endobj
-18298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.131 144.869 221.068 155.773]
-/A << /S /GoTo /D (page.566) >>
->> endobj
-18299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 110.983 145.791 119.83]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-18300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 74.333 223.309 85.237]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 696.002 439.79 706.906]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 662.293 362.272 671.04]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.028 648.181 528.965 659.085]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.64 624.988 427.576 635.175]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-18305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 612.316 504.348 623.22]
-/A << /S /GoTo /D (page.544) >>
->> endobj
-18306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 588.405 514.39 599.309]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 578.508 362.272 587.354]
-/A << /S /GoTo /D (page.383) >>
->> endobj
-18308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 552.54 439.79 563.444]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 528.63 501.578 539.534]
-/A << /S /GoTo /D (page.128) >>
->> endobj
-18310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 516.674 475.018 527.578]
-/A << /S /GoTo /D (page.162) >>
->> endobj
-18311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 504.719 476.672 515.623]
-/A << /S /GoTo /D (page.323) >>
->> endobj
-18312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 492.764 528.208 503.668]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-18313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 469.571 403.228 479.758]
-/A << /S /GoTo /D (page.458) >>
->> endobj
-18314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 447.001 362.272 455.847]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-18315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 432.988 504.348 443.892]
-/A << /S /GoTo /D (page.543) >>
->> endobj
-18316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 409.078 501.578 419.982]
-/A << /S /GoTo /D (page.110) >>
->> endobj
-18317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 397.123 475.018 408.027]
-/A << /S /GoTo /D (page.147) >>
->> endobj
-18318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 385.168 476.672 396.071]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-18319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [479.661 385.168 496.597 396.071]
-/A << /S /GoTo /D (page.308) >>
->> endobj
-18320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 373.212 528.208 384.116]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-18321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 363.315 362.272 372.161]
-/A << /S /GoTo /D (page.410) >>
->> endobj
-18322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 338.064 403.228 348.251]
-/A << /S /GoTo /D (page.446) >>
->> endobj
-18323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 314.154 362.272 324.34]
-/A << /S /GoTo /D (page.494) >>
->> endobj
-18324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 314.154 382.197 324.34]
-/A << /S /GoTo /D (page.495) >>
->> endobj
-18325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 301.481 504.348 312.385]
-/A << /S /GoTo /D (page.527) >>
->> endobj
-18326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 277.571 439.79 288.475]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-18327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 253.661 501.578 264.565]
-/A << /S /GoTo /D (page.111) >>
->> endobj
-18328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 241.706 475.018 252.609]
-/A << /S /GoTo /D (page.148) >>
->> endobj
-18329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 229.75 476.672 240.654]
-/A << /S /GoTo /D (page.308) >>
->> endobj
-18330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [479.661 229.75 496.597 240.654]
-/A << /S /GoTo /D (page.309) >>
->> endobj
-18331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 217.795 528.208 228.699]
-/A << /S /GoTo /D (page.410) >>
->> endobj
-18332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 207.997 362.272 216.744]
-/A << /S /GoTo /D (page.411) >>
->> endobj
-18333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 182.647 403.228 192.834]
-/A << /S /GoTo /D (page.447) >>
->> endobj
-18334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 159.957 362.272 168.923]
-/A << /S /GoTo /D (page.495) >>
->> endobj
-18335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [486.933 146.064 503.87 156.968]
-/A << /S /GoTo /D (page.527) >>
->> endobj
-18336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [506.38 146.064 523.317 156.968]
-/A << /S /GoTo /D (page.528) >>
->> endobj
-18337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 122.154 530.32 133.058]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 110.199 513.045 121.103]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.208 86.288 489.145 97.192]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-18341 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18345 0 obj <<
-/D [18343 0 R /XYZ 89 770.89 null]
->> endobj
-18342 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18429 0 obj <<
-/Length 1425      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~�W�[aR�K��{H +'m�̎
k�I�I�_���b�73}B�՞�|��,
�@p�8
5�tL�䘃�-0!Щ�1��&��
�v�l}
�d\}�`�>ntF��RO!@��L�
0vן!���oԈi�o� PL��

�p�+@Tט
!
�X��B�i��-,o�x''�-z���O<w��@���{_.3��5BC�	���@��
���&c���4��1$�&�f0�kLF
.��e�d$������^w�WD��� ���.ߞ��V��m�`sؚ�'`#�M2��͛V4a�v�K{*㻮H���`�
�
(:݅$�z08y��s���I��
�PA�$&�����P�T��7�%q����+9��s#�
l���*X@�y��y"ܻE�~b�E����̕�_6vg뢯�`	׷D�*;����g���!6�����k�`y+U��""�]/�ai�_�mM�%�V��5���wNE�k	�����o5U
���ȄϨ��	Շ��Y������ᰫ@�5S�
�	ӕZ��Ԃv��@�xyd
�;8��ޕ�<��l����|k��°���q`O=מ��}/�%��I22
�l�� ��~-%W�r�
�\
,��Y��2��b
�A�Ja߆�~���v��ܩ�]��@-�?�k�1j)�^�,��y�ҷ��
��r�� DC&K����k�B
믺���|%ST�����y| 7���{|�+���E���±�=�QQ��
-�}	'��
/���%g����Qf�����"�N!51�kP3ggN�)��q�ph
�B�s)�6��[��Q;�J�۝�k�Ff/�yŜK7�JY)�(�
V�B�'N��6M���1����_��Z,�lhJ��Q�()��({�a���-�|��|g�@��&��`�Z��v�
߻�K'�+
�����{lT�T���e0���Gq5@��z��2Wȡ��pQf�I�+�6+��Ca:/��B1�aM_J1�&�F6hy�A���2V�l���v*��v��6��rx����-���h
-c�@%� H�$�DŽVq�"�
���-��z;�U8e	�u	Z�a�Z��V����I���_�tj�~�B����Q@�z6�z_�M \�&@Y��ص���z����(,�U&Y|?d�Je	2鶿���,DY�!J^!D1�J��.H
�W�������}
����EUԍ¡U��T3
�]���}X��o���w��ǚ�I�O�I'CY�����5��GbGwɿ,�Ջ/�����Xs��m7<	]�
~
�P%��a�P%Z�
i-�l�L�A�ջ��[���ék�������r���T{�!�z�ԟ���r�����B3�6<�V�Zzv,�A�q�S&�
��
]�ш���e�a���p�)����
�'�*
-endstream
-endobj
-18428 0 obj <<
-/Type /Page
-/Contents 18429 0 R
-/Resources 18427 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18124 0 R
-/Annots [ 18340 0 R 18347 0 R 18348 0 R 18349 0 R 18350 0 R 18351 0 R 18352 0 R 18353 0 R 18354 0 R 18355 0 R 18356 0 R 18357 0 R 18358 0 R 18359 0 R 18360 0 R 18361 0 R 18362 0 R 18363 0 R 18364 0 R 18365 0 R 18366 0 R 18367 0 R 18368 0 R 18369 0 R 18370 0 R 18371 0 R 18372 0 R 18373 0 R 18374 0 R 18375 0 R 18376 0 R 18377 0 R 18378 0 R 18379 0 R 18380 0 R 18381 0 R 18382 0 R 18383 0 R 18384 0 R 18385 0 R 18386 0 R 18387 0 R 18388 0 R 18389 0 R 18390 0 R 18391 0 R 18392 0 R 18393 0 R 18 [...]
->> endobj
-18340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 697.94 145.791 706.906]
-/A << /S /GoTo /D (page.198) >>
->> endobj
-18347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 661.191 283.443 672.095]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 637.181 223.309 648.084]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.464 613.17 318.382 624.074]
-/A << /S /GoTo /D (page.392d) >>
->> endobj
-18350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 589.159 313.839 600.063]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.627 577.153 296.564 588.057]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-18352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 553.91 145.791 564.097]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-18353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 553.91 165.716 564.097]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-18354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 529.182 290.068 540.086]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 507.279 145.791 516.126]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-18356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 481.211 313.839 492.115]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 446.4 223.309 457.304]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 422.389 223.309 433.293]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 398.379 223.309 409.282]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-18360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 374.368 223.309 385.272]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-18361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 350.357 223.309 361.261]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-18362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 326.346 260.191 337.25]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-18363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 314.341 287.867 325.245]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-18364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 290.33 316.708 301.234]
-/A << /S /GoTo /D (page.405d) >>
->> endobj
-18365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.266 266.319 278.203 277.223]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-18366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 242.308 223.309 253.212]
-/A << /S /GoTo /D (page.78) >>
->> endobj
-18367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 218.298 223.309 229.201]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-18368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 194.287 313.839 205.191]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.028 182.281 282.965 193.185]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.475 182.281 302.412 193.185]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.682 158.271 284.619 169.174]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.129 158.271 304.066 169.174]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 146.265 258.537 157.169]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-18374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.526 146.265 278.462 157.169]
-/A << /S /GoTo /D (page.168) >>
->> endobj
-18375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 134.26 313.839 145.164]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 124.242 145.791 133.208]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 110.299 290.068 121.203]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 88.396 145.791 97.243]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 74.333 283.443 85.237]
-/A << /S /GoTo /D (page.243) >>
->> endobj
-18380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 698.059 362.272 706.906]
-/A << /S /GoTo /D (page.248) >>
->> endobj
-18381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.719 684.047 507.655 694.951]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.826 672.092 497.763 682.996]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.273 672.092 517.21 682.996]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 650.119 362.272 659.085]
-/A << /S /GoTo /D (page.290) >>
->> endobj
-18385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 636.226 476.672 647.13]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-18386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 624.271 521.005 635.175]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-18387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 614.373 362.272 623.22]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-18388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 590.463 362.272 599.309]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-18389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 565.212 362.272 575.399]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-18390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 565.212 382.197 575.399]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-18391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.569 552.54 511.506 563.444]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-18392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 542.642 362.272 551.489]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-18393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 528.63 514.39 539.534]
-/A << /S /GoTo /D (page.386) >>
->> endobj
-18394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 516.674 528.208 527.578]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-18395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 506.777 362.272 515.623]
-/A << /S /GoTo /D (page.431) >>
->> endobj
-18396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 481.526 403.228 491.713]
-/A << /S /GoTo /D (page.459) >>
->> endobj
-18397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.217 481.526 423.154 491.713]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-18398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 468.854 511.551 479.758]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-18399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.836 456.899 521.772 467.803]
-/A << /S /GoTo /D (page.484) >>
->> endobj
-18400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.537 433.706 407.492 443.892]
-/A << /S /GoTo /D (page.98) >>
->> endobj
-18401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 411.135 362.272 419.982]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-18402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 387.225 362.272 396.071]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-18403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 373.212 504.348 384.116]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-18404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.748 361.257 494.684 372.161]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-18405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.669 349.302 491.606 360.206]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-18406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.258 337.347 513.194 348.251]
-/A << /S /GoTo /D (page.568) >>
->> endobj
-18407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 313.437 530.32 324.34]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.51 301.481 499.446 312.385]
-/A << /S /GoTo /D (page.242) >>
->> endobj
-18409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [501.957 301.481 518.893 312.385]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 277.571 530.32 288.475]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 265.616 504.906 276.52]
-/A << /S /GoTo /D (page.242d) >>
->> endobj
-18412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 241.706 530.32 252.609]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 231.688 362.272 240.654]
-/A << /S /GoTo /D (page.194) >>
->> endobj
-18414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 205.84 530.32 216.744]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.51 193.885 499.446 204.789]
-/A << /S /GoTo /D (page.243) >>
->> endobj
-18416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [501.957 193.885 518.893 204.789]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 158.737 362.272 168.923]
-/A << /S /GoTo /D (page.364) >>
->> endobj
-18418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 158.737 382.197 168.923]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-18419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.569 146.064 511.506 156.968]
-/A << /S /GoTo /D (page.375) >>
->> endobj
-18420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 134.826 362.272 145.013]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-18421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 134.826 382.197 145.013]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-18422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 98.961 362.272 109.147]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-18423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 98.961 382.197 109.147]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-18424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.569 86.288 511.506 97.192]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-18425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 76.39 362.272 85.237]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-18426 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18430 0 obj <<
-/D [18428 0 R /XYZ 89 770.89 null]
->> endobj
-18427 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18512 0 obj <<
-/Length 1166      
-/Filter /FlateDecode
->>
-stream
-x��mo�8
���)xs;��8~�"�ŭ�l]���tR7!�4Z�������@�&$�I{��U㇟��&��D����v���YDw��0�G��u�t e◯_Ԇ�o��:q p ����������t����v��|4������}��^��8��3��&&�s�_i�5�	�`!�P�`4籗D�
�0ջ���ǰ���Ł����
�c�=���^|��������݋ep��?3�
;���/�4���!6�m�:�b�'Gd4L� �P�� �l��>�J����Ӑ{�{�k
��b�R ���[�P���#XK�|����dA�h�X��V�U�j�8��hے
lm������'w�!Ԉ9���Q�H�i�O)E�1*�%�R	��>��e���veX�^m��Ɔ1U���;�3i��}��0X�iP��;��N7�V�X�v�-���`�xf���S�8���H����F��s,�O��s/�,�	�
$�Z
v�	���%̖M�:@¤-'Li��M�q��|�%�Z�H9f g\`] #"Q2d>�}-^ˆײ���/U:��]	0�J���P��x��jE��t��zG�ƁN��B��ϸ���)�a��l�
�H�L.��b
-���R�L�h;pl�8Lrm�������/�.&�sז�XAu
u��Ľ��漪�/F�r��F��R�E���*������67�����{((�y�j��{u�Hx 'Wd)�5�j���j�&��[�	*
���T�SEi�T�2��%����,��U��j�u�N����	U5�m�&�OLX����=#\�g��	���&m|/]�J

�a
��x��]��k�2֧q�M�Л�*�Ll+��TW��a2�f�{����1�KD)d.�T�E���	���"��%0�B���
1��
��Z�(�
-��Di�W�� �_�� �6 Ҧ��saS�5/��QS�'����(-y	�sJ���1Y��8oviX{�"1�7&e좿��\�M�0�0�{�dc�i�d�P~h@dY8{��={�
�j�
��Db���b����*6p3ӻ*�F�;\��68�[�z8<Ͽ|Y�����"���
��,��R�Oj9�V�;�@ю@G$Ph\q�U����Cz��n�PP�חu�d���n��'`
[2/l�q �����(�a�(^mh�� 
���
SX
-endstream
-endobj
-18511 0 obj <<
-/Type /Page
-/Contents 18512 0 R
-/Resources 18510 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18124 0 R
-/Annots [ 18434 0 R 18435 0 R 18436 0 R 18437 0 R 18438 0 R 18439 0 R 18440 0 R 18441 0 R 18442 0 R 18443 0 R 18444 0 R 18445 0 R 18446 0 R 18447 0 R 18448 0 R 18449 0 R 18450 0 R 18451 0 R 18452 0 R 18453 0 R 18454 0 R 18455 0 R 18456 0 R 18457 0 R 18458 0 R 18459 0 R 18460 0 R 18461 0 R 18462 0 R 18463 0 R 18464 0 R 18465 0 R 18466 0 R 18467 0 R 18468 0 R 18469 0 R 18470 0 R 18471 0 R 18472 0 R 18473 0 R 18474 0 R 18475 0 R 18476 0 R 18477 0 R 18478 0 R 18479 0 R 18480 0 R 18481 0 R 18 [...]
->> endobj
-18434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 695.64 313.839 706.544]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 685.622 145.791 694.588]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 660.129 145.791 670.316]
-/A << /S /GoTo /D (page.363) >>
->> endobj
-18437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 660.129 165.716 670.316]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-18438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.705 660.129 185.641 670.316]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-18439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.088 647.094 295.024 657.998]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-18440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 637.197 145.791 646.043]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-18441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 600.706 145.791 609.453]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.547 586.232 312.484 597.136]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.158 562.676 211.095 572.863]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-18444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.959 537.687 234.895 548.59]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-18445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.167 514.131 291.104 524.318]
-/A << /S /GoTo /D (page.230) >>
->> endobj
-18446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 477.541 145.791 487.728]
-/A << /S /GoTo /D (page.364) >>
->> endobj
-18447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 477.541 165.716 487.728]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-18448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.938 464.506 298.855 475.41]
-/A << /S /GoTo /D (page.375d) >>
->> endobj
-18449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 439.872 223.309 450.775]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-18450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 427.554 313.839 438.458]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 417.537 145.791 426.503]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 392.044 145.791 402.23]
-/A << /S /GoTo /D (page.363) >>
->> endobj
-18453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 392.044 165.716 402.23]
-/A << /S /GoTo /D (page.364) >>
->> endobj
-18454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.705 392.044 185.641 402.23]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-18455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.088 379.009 295.024 389.913]
-/A << /S /GoTo /D (page.375) >>
->> endobj
-18456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 369.111 145.791 377.958]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-18457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 344.838 145.791 353.685]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-18458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 320.566 145.791 329.412]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-18459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 284.075 145.791 292.822]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.547 269.601 312.484 280.505]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.158 246.046 211.095 256.232]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-18462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.959 221.056 234.895 231.96]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-18463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.167 197.5 291.104 207.687]
-/A << /S /GoTo /D (page.230) >>
->> endobj
-18464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 162.25 150.772 171.097]
-/A << /S /GoTo /D (page.364d) >>
->> endobj
-18465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.938 147.876 298.855 158.78]
-/A << /S /GoTo /D (page.376d) >>
->> endobj
-18466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 123.241 290.068 134.145]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 98.606 290.068 109.51]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 75.05 145.791 85.237]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-18469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 75.05 165.716 85.237]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-18470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.569 707.957 511.506 718.861]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-18471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 698.059 362.272 706.906]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-18472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 661.61 362.272 670.357]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.028 647.157 528.965 658.06]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.64 623.622 427.576 633.809]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-18475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.164 598.311 501.1 609.215]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [503.611 598.311 520.547 609.215]
-/A << /S /GoTo /D (page.132) >>
->> endobj
-18477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 586.014 475.018 596.918]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-18478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 573.718 530.32 584.622]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 551.623 362.272 560.37]
-/A << /S /GoTo /D (page.222) >>
->> endobj
-18480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.028 537.169 528.965 548.073]
-/A << /S /GoTo /D (page.352) >>
->> endobj
-18481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 524.872 506.55 535.776]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 502.678 362.272 511.524]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 488.324 504.906 499.228]
-/A << /S /GoTo /D (page.242d) >>
->> endobj
-18484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.719 476.027 507.655 486.931]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.826 463.73 497.763 474.634]
-/A << /S /GoTo /D (page.282) >>
->> endobj
-18486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.273 463.73 517.21 474.634]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 451.433 476.672 462.337]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-18488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 439.137 521.005 450.041]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-18489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 429.239 362.272 438.085]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-18490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 404.987 362.272 413.833]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-18491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.64 379.395 427.576 389.582]
-/A << /S /GoTo /D (page.226) >>
->> endobj
-18492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.44 354.426 451.377 365.33]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-18493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.649 330.891 507.585 341.078]
-/A << /S /GoTo /D (page.230) >>
->> endobj
-18494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.569 317.877 511.506 328.781]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-18495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 307.979 362.272 316.826]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-18496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.07 282.387 401.006 292.574]
-/A << /S /GoTo /D (page.228) >>
->> endobj
-18497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 269.373 528.208 280.277]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-18498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 259.475 362.272 268.322]
-/A << /S /GoTo /D (page.430) >>
->> endobj
-18499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 233.883 403.228 244.07]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-18500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.537 209.631 407.492 219.818]
-/A << /S /GoTo /D (page.97) >>
->> endobj
-18501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 186.72 362.272 195.566]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-18502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 162.468 362.272 171.314]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-18503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 148.114 504.348 159.018]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-18504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.748 135.817 494.684 146.721]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-18505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 111.223 506.55 122.127]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 86.63 439.79 97.534]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.779 86.63 454.734 97.534]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-18509 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18513 0 obj <<
-/D [18511 0 R /XYZ 89 770.89 null]
->> endobj
-18510 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18588 0 obj <<
-/Length 1326      
-/Filter /FlateDecode
->>
-stream
-x�͚Ys�:���~�0�8�"/ys�a��1&7���q@!���i�~�+/0�`�������t��# 5� �k|vW]��dZX�r�)P"/�P ���cS3n���w�
��P �/����
�i�l0�PL�ҢD�f�����/�9Y�^�J3�g9�J
�
�	"�
�gR"��
���j1��3Y���

.ҽ��
�\_�E��ϑ��n����,�d�v�A1�e�j�2�Yw&���o7jIbY�
�
�� 8�� �
�/"o�NѯK@�K�

�JU
��Y�
-��)�
�|l��mr��O�����������a�ΧO�6
ASw瓥;��'m
��ŀ�;�ǐH]�/A�D�|��7�.��F��e,W=0�
Q�K�-�Ų�H�<�

#c9{�A�V����f%Wa�R�3�����],�7���7�n���`VS��舃��C����� ��ص_�zlݩO��L/+��H��pV]�XA:u1�S��q
�t�R��
P�ei^�ާ�J_uT��4����3�
�_4E9�-1t�vg:�6�C�V
��pyo�q	��PW��;�
T
��{�1�a�� ��f�T��
# �(o��w�˦�`�}M��H�-]�ל�w��-[�hF��7S
�L[U�ԁ�ԛ���{��\
��
��M�:���4�~����.?<�]~*�>����
}6x� r�exQGJj<�B^d
;!*�e��zR�,
ݩ�@3���Vjj�Y�&�Ŵ�ڼ�e9��H	
G
,aƜ�[��an�g��'�⟅��^���ə�%�d~�� �O�q
�8*
-�!WB�7� ��#\��D����ۜXo� ���6pg���.�p�0�hi�������SWA����.a�a��z�*�W�9}׉
w8@���
�'�{C�
s�b�nô��~�K?_�l����V���ۓAz��&��M�S�g��<$FU�ve����0
-ܭld��z;T��y�r�QI
� gk�㐉&�'۫����qp����`h�(9��<p�Pt�p
-�8��<T�PC٭����%$�ٵ󒬒v��)!�DGa����y�!�&�R {��K&Z>��
�Ե
�߫�k׊��ƣ3t���i6�j
7�]?�ɛtd��M��'��fg�n�B��,r{����1V|����[`i����r�n�%Z>�f�E��Ն�
��Y:}�8��a3L?���ҝ��� مQ|��24 �
�js� =�8�G
-��Z=}�o��
-yBvu��E�뫫��$��	=�g[���!�@�Vm��^���� �7�/ڒ�az�{���0� �+%��?��(�I�����Uì�J�qԍO^���s��
-endstream
-endobj
-18587 0 obj <<
-/Type /Page
-/Contents 18588 0 R
-/Resources 18586 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18590 0 R
-/Annots [ 18508 0 R 18517 0 R 18518 0 R 18519 0 R 18520 0 R 18521 0 R 18522 0 R 18523 0 R 18524 0 R 18525 0 R 18526 0 R 18527 0 R 18528 0 R 18529 0 R 18530 0 R 18531 0 R 18532 0 R 18533 0 R 18534 0 R 18535 0 R 18536 0 R 18537 0 R 18538 0 R 18539 0 R 18540 0 R 18541 0 R 18542 0 R 18543 0 R 18544 0 R 18545 0 R 18546 0 R 18547 0 R 18548 0 R 18549 0 R 18550 0 R 18551 0 R 18552 0 R 18553 0 R 18554 0 R 18555 0 R 18556 0 R 18557 0 R 18558 0 R 18559 0 R 18560 0 R 18561 0 R 18562 0 R 18563 0 R 18 [...]
->> endobj
-18508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 698.059 145.791 706.906]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-18517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 674.117 145.791 682.964]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-18518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 648.086 297.909 658.99]
-/A << /S /GoTo /D (page.386) >>
->> endobj
-18519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 624.112 223.309 635.016]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 600.138 297.909 611.042]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-18521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 576.164 295.069 587.068]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-18522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 552.19 313.839 563.094]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 542.173 145.791 551.139]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 516.261 287.867 527.165]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-18525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 482.389 145.791 491.236]
-/A << /S /GoTo /D (page.268) >>
->> endobj
-18526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.416 468.345 294.352 479.249]
-/A << /S /GoTo /D (page.372) >>
->> endobj
-18527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 433.879 304.524 444.782]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 409.905 295.069 420.809]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 385.931 295.069 396.835]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.133 361.957 295.069 372.861]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.823 337.983 281.759 348.887]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 325.996 304.524 336.9]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 302.022 223.309 312.926]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-18534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 278.048 297.909 288.952]
-/A << /S /GoTo /D (page.381) >>
->> endobj
-18535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 254.074 297.909 264.978]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 230.1 297.909 241.004]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 206.126 297.909 217.03]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.088 182.152 295.024 193.056]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 172.254 145.791 181.101]
-/A << /S /GoTo /D (page.474) >>
->> endobj
-18540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 146.223 223.309 157.127]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-18541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 112.351 145.791 121.198]
-/A << /S /GoTo /D (page.478) >>
->> endobj
-18542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 86.32 223.309 97.224]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-18543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 707.957 439.79 718.861]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-18544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 684.047 439.79 694.951]
-/A << /S /GoTo /D (page.72) >>
->> endobj
-18545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.748 660.136 494.684 671.04]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-18546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 626.328 362.272 635.175]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-18547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 600.361 521.005 611.265]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 589.123 362.272 599.309]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-18549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 589.123 382.197 599.309]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-18550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 554.597 362.272 563.444]
-/A << /S /GoTo /D (page.478) >>
->> endobj
-18551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [429.449 529.347 441.405 539.534]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 517.392 382.745 527.578]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.379 505.437 404.334 515.623]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.709 493.481 433.664 503.668]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.974 481.526 394.929 491.713]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.491 469.227 374.446 479.758]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.491 457.616 374.446 467.803]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.491 445.661 374.446 455.847]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.385 433.706 373.34 443.892]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.578 421.75 380.533 431.937]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.385 409.795 373.34 419.982]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.491 397.84 374.446 408.027]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.743 373.586 397.679 384.116]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.134 361.631 469.071 372.161]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.555 349.676 447.492 360.206]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.092 326.109 427.029 336.296]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.076 314.154 370.013 324.34]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.721 302.199 376.658 312.385]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.423 290.243 368.359 300.43]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.076 266.333 370.013 276.52]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.725 254.378 407.661 264.565]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.721 242.423 376.658 252.609]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-18573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.242 218.512 387.178 228.699]
-/A << /S /GoTo /D (page.381) >>
->> endobj
-18574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [492.005 206.557 508.941 216.744]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.899 194.602 507.835 204.789]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [428.902 182.647 445.838 192.834]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-18577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.113 158.737 448.05 168.923]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [455.462 146.781 472.399 156.968]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [478.715 134.826 495.651 145.013]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [463.223 122.871 480.159 133.058]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.951 110.916 461.888 121.103]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.061 98.961 493.997 109.147]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.51 75.05 374.446 85.237]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-18585 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18589 0 obj <<
-/D [18587 0 R /XYZ 89 770.89 null]
->> endobj
-18586 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18706 0 obj <<
-/Length 1634      
-/Filter /FlateDecode
->>
-stream
-xڽZio�6��_�o��Z!%QG�-�d���f�b�E��յ��I��;:�Ď#�r$vd��qf8Ǔ��Ґ�btv9:y�{�ak�K�C�cy:��?_�2&�1�v�Z3=�{÷�ï�?}�O�������(?�4\~�莫-�їoH���k
��jW�I�f&�����#t�����`�c\^p6�d�d��,n�ܗ��s�������\UL.^��/S���kU��W�0\� ��=BJ�9�".@��
�v1��h!y���D�4qD�>�T�Fk�7"�;�ڏ�~�Ku�l�b�?��x�k�����e��H���-��&�E��z��M���i�%WH<`ذX�3*�,�X��y!��f��sԭ��2��
["N혚�xz�W���Z�l
p�ΒK
-���5=�%x�#{$�ԁĴ�f��y
�q�~�
��]*�

9�6��Q����0�
�۞q9qК`w���@��	v���y ��
�ݞ��׾�0�[���VgO��5Kxa�
wWa�|�.�h%7��,	al�F�.X:
Z�I&�L	f� �l���7���[5i
ݗ���ˉA�_2"�����&Z)�n�z��Qb�9 d�!Hn��
-9~=��w��W��Q�x�҈U�$Gj�2��8x��%���s��E`�t)㐲y��������1�q���'���cӲu����eUo�<K�
1)K��l��x�M�Z��y$�J(kS@�(��*�
רH
|�`k���"�Xs\��*k36�TF[�"��	
�yԠ�ÆWp,���2.�F���M���e
< �ve�Ŕ�g^
���3pV
F:���L����F�q�m
{�����ZW(�6��,]C��ʵ�����ؔ/Z�_��#��V�
rQ3z�V ��p��nZ�c�
�PdU�?;W/�ֱ!K�o�z��
f3�
=kv(�f0��3N`sf�<0����=r;�

��nyMǵ��: �_5lü�z�
\m��]ғ'G d(tغ��8��w��Uڼٺ�HZ�F=�.�v;�M�T�	�?�*k�=�?��{�>]�՚����}�"�T�I �7t��52�h�;L
-^�,�������1K����/���)�N�6�B�7�mPw��U�lȃ��i%���v\d���
���������%��:q\��5"���Hwq+!���gd�s.3���|���*2
��!#/�0aRݗZ�
v`�������U�b��+���^釪P���费��b�a ݶkö��ݫ�Ϣ�cL
�C�lc���NO��$p���vz:A��7��ހZW=����
ܳߘ�\��ᜫ��b[�� x"��\yV	��^ !�
 ���$����i��7&�
Gn����v�^@���D0���v�;-�1�m�m4�����ͥ}E44
Wš��������0�D0Ɗj`[��čr���
�v��p��
�
���
-���o�G���}\�����^�ؾ�?Wg�c�M����E
�b�x ���;ţ,�s�}���;Ձ�W��=��n
-x�;��S{.�ضUL�.�-hv�s��}�'�Rg���O)��M����X�aA��+"�,Y2��� �
��djb4��ye��׏[�o���}>0$r���:˒ӓ��f��h��T�c���x���c�~J2a,��(o�
-�L���Rq
J
-endstream
-endobj
-18705 0 obj <<
-/Type /Page
-/Contents 18706 0 R
-/Resources 18704 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18590 0 R
-/Annots [ 18584 0 R 18591 0 R 18592 0 R 18593 0 R 18594 0 R 18595 0 R 18596 0 R 18597 0 R 18598 0 R 18599 0 R 18600 0 R 18601 0 R 18602 0 R 18603 0 R 18604 0 R 18605 0 R 18606 0 R 18607 0 R 18608 0 R 18609 0 R 18610 0 R 18611 0 R 18612 0 R 18613 0 R 18614 0 R 18615 0 R 18616 0 R 18617 0 R 18618 0 R 18619 0 R 18620 0 R 18621 0 R 18622 0 R 18623 0 R 18624 0 R 18625 0 R 18626 0 R 18627 0 R 18628 0 R 18629 0 R 18630 0 R 18631 0 R 18632 0 R 18633 0 R 18634 0 R 18635 0 R 18636 0 R 18637 0 R 18 [...]
->> endobj
-18584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.528 707.957 211.484 718.861]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-18591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.018 696.719 152.974 706.906]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-18592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.488 684.047 235.444 694.951]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.036 672.092 235.992 682.996]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.036 660.136 235.992 671.04]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.008 648.181 200.963 659.085]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-18596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.825 636.226 233.78 647.13]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-18597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.944 624.988 177.899 635.175]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.119 613.033 190.074 623.22]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-18599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.986 600.361 219.941 611.265]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-18600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.679 588.405 216.634 599.309]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-18601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 566.433 140.809 575.399]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-18602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.412 540.585 233.368 551.489]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-18603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.195 516.674 196.132 527.578]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-18604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.071 504.719 200.007 515.623]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-18605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 493.481 189.506 503.668]
-/A << /S /GoTo /D (page.113) >>
->> endobj
-18606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 481.526 193.382 491.713]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-18607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.646 468.854 238.582 479.758]
-/A << /S /GoTo /D (page.115) >>
->> endobj
-18608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.02 456.899 231.957 467.803]
-/A << /S /GoTo /D (page.114) >>
->> endobj
-18609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.024 444.943 206.961 455.847]
-/A << /S /GoTo /D (page.120) >>
->> endobj
-18610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.676 432.988 182.612 443.892]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-18611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.398 421.033 195.334 431.937]
-/A << /S /GoTo /D (page.120) >>
->> endobj
-18612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 409.078 178.996 419.982]
-/A << /S /GoTo /D (page.107d) >>
->> endobj
-18613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.604 397.123 241.541 408.027]
-/A << /S /GoTo /D (page.125) >>
->> endobj
-18614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.968 385.168 221.905 396.071]
-/A << /S /GoTo /D (page.122) >>
->> endobj
-18615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.69 373.212 234.627 384.116]
-/A << /S /GoTo /D (page.122) >>
->> endobj
-18616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.514 361.975 212.451 372.161]
-/A << /S /GoTo /D (page.110) >>
->> endobj
-18617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.122 350.019 213.058 360.206]
-/A << /S /GoTo /D (page.110) >>
->> endobj
-18618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.455 337.347 241.391 348.251]
-/A << /S /GoTo /D (page.124) >>
->> endobj
-18619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [212.729 325.392 229.665 336.296]
-/A << /S /GoTo /D (page.125) >>
->> endobj
-18620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.821 313.437 207.757 324.34]
-/A << /S /GoTo /D (page.127) >>
->> endobj
-18621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.308 302.199 171.245 312.385]
-/A << /S /GoTo /D (page.113) >>
->> endobj
-18622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.115 290.243 164.052 300.43]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.927 277.571 200.863 288.475]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-18624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.603 265.616 236.539 276.52]
-/A << /S /GoTo /D (page.131) >>
->> endobj
-18625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.528 265.616 256.464 276.52]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.136 253.661 233.073 264.565]
-/A << /S /GoTo /D (page.129) >>
->> endobj
-18627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.532 241.706 239.468 252.609]
-/A << /S /GoTo /D (page.117) >>
->> endobj
-18628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.439 229.75 224.375 240.654]
-/A << /S /GoTo /D (page.129) >>
->> endobj
-18629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.591 217.795 170.528 228.699]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.574 205.84 233.511 216.744]
-/A << /S /GoTo /D (page.120) >>
->> endobj
-18631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.499 205.84 253.436 216.744]
-/A << /S /GoTo /D (page.121) >>
->> endobj
-18632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.296 193.885 246.233 204.789]
-/A << /S /GoTo /D (page.121) >>
->> endobj
-18633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.222 193.885 266.158 204.789]
-/A << /S /GoTo /D (page.122) >>
->> endobj
-18634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.015 181.93 219.952 192.834]
-/A << /S /GoTo /D (page.126) >>
->> endobj
-18635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.962 170.692 172.899 180.878]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.283 158.019 207.219 168.923]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-18637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.782 146.064 196.719 156.968]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.969 134.109 234.905 145.013]
-/A << /S /GoTo /D (page.132) >>
->> endobj
-18639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.894 134.109 254.83 145.013]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.573 122.154 268.509 133.058]
-/A << /S /GoTo /D (page.127) >>
->> endobj
-18641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.544 110.199 225.481 121.103]
-/A << /S /GoTo /D (page.128) >>
->> endobj
-18642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.202 98.961 170.139 109.147]
-/A << /S /GoTo /D (page.110) >>
->> endobj
-18643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.549 87.006 168.485 97.192]
-/A << /S /GoTo /D (page.111) >>
->> endobj
-18644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 74.333 179.539 85.237]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.528 74.333 199.465 85.237]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 707.957 391.761 718.861]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.75 707.957 411.686 718.861]
-/A << /S /GoTo /D (page.132) >>
->> endobj
-18648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.295 696.002 460.213 706.906]
-/A << /S /GoTo /D (page.130d) >>
->> endobj
-18649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [426.67 684.047 443.606 694.951]
-/A << /S /GoTo /D (page.115) >>
->> endobj
-18650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.545 672.092 447.482 682.996]
-/A << /S /GoTo /D (page.116) >>
->> endobj
-18651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.044 660.854 436.981 671.04]
-/A << /S /GoTo /D (page.115) >>
->> endobj
-18652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 648.899 440.856 659.085]
-/A << /S /GoTo /D (page.116) >>
->> endobj
-18653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.522 636.943 400.458 647.13]
-/A << /S /GoTo /D (page.113) >>
->> endobj
-18654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [467.885 624.271 484.821 635.175]
-/A << /S /GoTo /D (page.128) >>
->> endobj
-18655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.449 612.316 454.386 623.22]
-/A << /S /GoTo /D (page.128) >>
->> endobj
-18656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.226 600.361 471.162 611.265]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-18657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.254 588.405 413.19 599.309]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-18658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 576.45 367.702 587.354]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-18659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.69 576.45 387.627 587.354]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.87 564.495 424.806 575.399]
-/A << /S /GoTo /D (page.123) >>
->> endobj
-18661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.877 553.257 393.813 563.444]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-18662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.852 540.585 429.788 551.489]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-18663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.194 528.63 397.131 539.534]
-/A << /S /GoTo /D (page.123) >>
->> endobj
-18664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [491.283 516.674 503.238 527.578]
-/A << /S /GoTo /D (page.98) >>
->> endobj
-18665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.088 504.719 521.025 515.623]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-18666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.693 492.764 381.629 503.668]
-/A << /S /GoTo /D (page.134) >>
->> endobj
-18667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 470.791 362.272 479.758]
-/A << /S /GoTo /D (page.194) >>
->> endobj
-18668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.055 456.899 505.991 467.803]
-/A << /S /GoTo /D (page.135) >>
->> endobj
-18669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.582 432.988 402.519 443.892]
-/A << /S /GoTo /D (page.135) >>
->> endobj
-18670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.676 409.078 412.613 419.982]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-18671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.552 397.123 416.488 408.027]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-18672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.051 385.885 405.987 396.071]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-18673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.926 373.93 409.863 384.116]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-18674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.127 361.257 455.063 372.161]
-/A << /S /GoTo /D (page.151) >>
->> endobj
-18675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.501 349.302 448.438 360.206]
-/A << /S /GoTo /D (page.150) >>
->> endobj
-18676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.165 337.347 490.101 348.251]
-/A << /S /GoTo /D (page.161) >>
->> endobj
-18677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.271 325.392 491.207 336.296]
-/A << /S /GoTo /D (page.161) >>
->> endobj
-18678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.505 313.437 423.442 324.34]
-/A << /S /GoTo /D (page.155) >>
->> endobj
-18679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 301.481 399.093 312.385]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 289.526 411.816 300.43]
-/A << /S /GoTo /D (page.155) >>
->> endobj
-18681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 277.571 438.386 288.475]
-/A << /S /GoTo /D (page.157) >>
->> endobj
-18682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 265.616 451.108 276.52]
-/A << /S /GoTo /D (page.158) >>
->> endobj
-18683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 254.378 428.932 264.565]
-/A << /S /GoTo /D (page.146) >>
->> endobj
-18684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 242.423 429.539 252.609]
-/A << /S /GoTo /D (page.147) >>
->> endobj
-18685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.999 230.468 368.917 240.654]
-/A << /S /GoTo /D (page.143d) >>
->> endobj
-18686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [429.21 217.795 446.147 228.699]
-/A << /S /GoTo /D (page.160) >>
->> endobj
-18687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.594 205.84 442.53 216.744]
-/A << /S /GoTo /D (page.159) >>
->> endobj
-18688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.519 205.84 462.456 216.744]
-/A << /S /GoTo /D (page.160) >>
->> endobj
-18689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.302 193.885 424.239 204.789]
-/A << /S /GoTo /D (page.161) >>
->> endobj
-18690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 182.647 387.726 192.834]
-/A << /S /GoTo /D (page.146) >>
->> endobj
-18691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 170.692 380.533 180.878]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-18692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.408 158.019 417.345 168.923]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.428 146.064 473.365 156.968]
-/A << /S /GoTo /D (page.159) >>
->> endobj
-18694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.084 134.109 453.02 145.013]
-/A << /S /GoTo /D (page.166) >>
->> endobj
-18695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.009 134.109 472.946 145.013]
-/A << /S /GoTo /D (page.167) >>
->> endobj
-18696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.617 122.154 449.554 133.058]
-/A << /S /GoTo /D (page.163) >>
->> endobj
-18697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 110.199 440.856 121.103]
-/A << /S /GoTo /D (page.163) >>
->> endobj
-18698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.073 98.244 387.009 109.147]
-/A << /S /GoTo /D (page.148) >>
->> endobj
-18699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.056 86.288 449.992 97.192]
-/A << /S /GoTo /D (page.156) >>
->> endobj
-18700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.778 74.333 462.714 85.237]
-/A << /S /GoTo /D (page.156) >>
->> endobj
-18701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.703 74.333 482.639 85.237]
-/A << /S /GoTo /D (page.157) >>
->> endobj
-18703 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18707 0 obj <<
-/D [18705 0 R /XYZ 89 770.89 null]
->> endobj
-18704 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18828 0 obj <<
-/Length 1600      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�Ҥ�����g�,M���t&�`(��p3A�V����,�4�i�"�tpp���H$m$$��=�����ɔM�h���d"IWM�j�#}��~��ş�/�o$2��.��Jv{��zv;�pI��5�uC��٧/Hr��	ɊiHwy#_R�=����:$��"�5�����q��'�

[:���sE����۫��iI(�cM)����LJ
��%�fPw<f�0
�ND�1���ж�
~*N��<d�ۉ���]����+�㊿B at f7q�w��f+�Y��	�d�'V`�L5�i�v}7����5����؊B�
���[��
�� `�	I: ��ߝ�W����n��he���$��Fg/a:>�SE��I����i��x*SY��_6�

=���5�KՐ5Si
�j5�@-Q
F�f�'�0;r�y�9��)��2��%.�f��܊O��yh�b��9�ٝ�du-��)>##����o��I�b4nY�2���u`�aV)�e�m�����*������S
�
-�
�p��sov,n��Җ�k�4
*���o�#�
��U�-0�[��/���&�@R�D�:Cۗ�4�ϑ�����M��2������D��rb����GxW/+�-vz�-wb��sױ��ϟ��
k;&:,����iiG2Q�-^_�фb��ط�h@�e]��Z���:�W�t�:����0������Q�_g�c���N������v�P(Tg~~��<�9wN�v���A�q'�MT��V=;(FG���8E�:q:�7�Y=	��\�'-�/�����Y
���*����)��D6ͅ��Q:�W_NM#�.>���(�v����ZM��
DFD
*�K/s
��*?�xq�\d6�}�
Q4YE����X#ju���z���sN`�=���Q
�/`fߑ�z	��t�~�e��E\k6�@����c�Yb
C�k�^�x��� �	Y�)�'3(zm�ԩ��6  [nͲ�
�>��<?w��h�EO�hm	�
�����l�ړ��2'�;Ej�VR9L�΃TSi�ɍT��
}�f�~�@���&I��e(7�N��O���F�؊��F���`
7۔c�X{�id�o��}��ڈ�6�(Nì8*�q`y��~���.�>��L�%��)!��Q�����qz�v��s
��`�cDa�������c�^��[y�A�&CK�X��"?W˲���: X������ؐ� "���hz�7%;��'ѷ�s���z	�-3Ӕ�0($6M��41A��?{�C�}=d��RE���ǣ�ੜޛ��2R<�#�)��Q
J����ߋ���U�W�0��7���>��]��1��b6U��H#��p
���w�|���2ѽ���q2��@�����C�g�q�I���]MIؕ�if��[�M#�N��o�Uo�P�4�|�N�e
-�c�-_��_]�+.~<�iA�\��b`Q��ψ���x��3�e���X*�ꏜ��(H�����[}�
-��L)���6I��u�<��v��>SF�����XN�]�
ট�} W�Vq�˚F�H at 0ogHFX�I���:���ay�쵯H�C��˂� �K��
-endstream
-endobj
-18827 0 obj <<
-/Type /Page
-/Contents 18828 0 R
-/Resources 18826 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18590 0 R
-/Annots [ 18702 0 R 18709 0 R 18710 0 R 18711 0 R 18712 0 R 18713 0 R 18714 0 R 18715 0 R 18716 0 R 18717 0 R 18718 0 R 18719 0 R 18720 0 R 18721 0 R 18722 0 R 18723 0 R 18724 0 R 18725 0 R 18726 0 R 18727 0 R 18728 0 R 18729 0 R 18730 0 R 18731 0 R 18732 0 R 18733 0 R 18734 0 R 18735 0 R 18736 0 R 18737 0 R 18738 0 R 18739 0 R 18740 0 R 18741 0 R 18742 0 R 18743 0 R 18744 0 R 18745 0 R 18746 0 R 18747 0 R 18748 0 R 18749 0 R 18750 0 R 18751 0 R 18752 0 R 18753 0 R 18754 0 R 18755 0 R 18 [...]
->> endobj
-18702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.252 707.957 178.189 718.861]
-/A << /S /GoTo /D (page.163) >>
->> endobj
-18709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.495 696.719 201.432 706.906]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.744 684.047 201.681 694.951]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.962 672.809 172.899 682.996]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.283 660.136 207.219 671.04]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.782 648.181 196.719 659.085]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-18714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.969 636.226 239.887 647.13]
-/A << /S /GoTo /D (page.166d) >>
->> endobj
-18715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.67 624.271 274.606 635.175]
-/A << /S /GoTo /D (page.160) >>
->> endobj
-18716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.544 612.316 225.481 623.22]
-/A << /S /GoTo /D (page.162) >>
->> endobj
-18717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.202 601.078 170.139 611.265]
-/A << /S /GoTo /D (page.147) >>
->> endobj
-18718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.549 589.123 168.485 599.309]
-/A << /S /GoTo /D (page.148) >>
->> endobj
-18719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 576.45 179.539 587.354]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-18720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.528 576.45 199.465 587.354]
-/A << /S /GoTo /D (page.168) >>
->> endobj
-18721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 564.495 175.28 575.399]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-18722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.416 552.54 214.353 563.444]
-/A << /S /GoTo /D (page.152) >>
->> endobj
-18723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.292 540.585 218.228 551.489]
-/A << /S /GoTo /D (page.153) >>
->> endobj
-18724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.814 528.63 238.751 539.534]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-18725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.739 528.63 258.676 539.534]
-/A << /S /GoTo /D (page.167) >>
->> endobj
-18726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.189 516.674 227.125 527.578]
-/A << /S /GoTo /D (page.152) >>
->> endobj
-18727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.064 504.719 231 515.623]
-/A << /S /GoTo /D (page.152) >>
->> endobj
-18728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.563 493.481 220.5 503.668]
-/A << /S /GoTo /D (page.151) >>
->> endobj
-18729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.438 481.526 224.375 491.713]
-/A << /S /GoTo /D (page.151) >>
->> endobj
-18730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.04 469.571 183.977 479.758]
-/A << /S /GoTo /D (page.146) >>
->> endobj
-18731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.404 456.899 268.34 467.803]
-/A << /S /GoTo /D (page.162) >>
->> endobj
-18732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.968 444.943 237.904 455.847]
-/A << /S /GoTo /D (page.162) >>
->> endobj
-18733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.146 433.706 177.083 443.892]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-18734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.745 421.033 254.681 431.937]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.772 409.078 196.709 419.982]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-18736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 397.123 151.22 408.027]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-18737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 397.123 171.145 408.027]
-/A << /S /GoTo /D (page.168) >>
->> endobj
-18738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.389 385.168 208.325 396.071]
-/A << /S /GoTo /D (page.158) >>
->> endobj
-18739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.396 373.93 177.332 384.116]
-/A << /S /GoTo /D (page.153) >>
->> endobj
-18740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.371 361.257 213.307 372.161]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.292 349.302 250.228 360.206]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-18742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 337.347 180.65 348.251]
-/A << /S /GoTo /D (page.158) >>
->> endobj
-18743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.752 325.392 275.688 336.296]
-/A << /S /GoTo /D (page.135) >>
->> endobj
-18744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.631 313.437 279.568 324.34]
-/A << /S /GoTo /D (page.168) >>
->> endobj
-18745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.474 301.481 193.392 312.385]
-/A << /S /GoTo /D (page.170d) >>
->> endobj
-18746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.916 289.526 235.852 300.43]
-/A << /S /GoTo /D (page.173) >>
->> endobj
-18747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 267.554 145.791 276.52]
-/A << /S /GoTo /D (page.219) >>
->> endobj
-18748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.694 254.378 185.631 264.565]
-/A << /S /GoTo /D (page.220) >>
->> endobj
-18749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.898 242.423 152.834 252.609]
-/A << /S /GoTo /D (page.222) >>
->> endobj
-18750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.016 229.75 163.952 240.654]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 217.795 175.28 228.699]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.541 205.84 170.478 216.744]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.724 193.885 169.661 204.789]
-/A << /S /GoTo /D (page.221) >>
->> endobj
-18754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 181.93 175.28 192.834]
-/A << /S /GoTo /D (page.222) >>
->> endobj
-18755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.1 169.975 293.037 180.878]
-/A << /S /GoTo /D (page.349) >>
->> endobj
-18756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.898 158.737 152.834 168.923]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.682 146.781 159.618 156.968]
-/A << /S /GoTo /D (page.350) >>
->> endobj
-18758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.016 134.109 163.952 145.013]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 122.154 175.28 133.058]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.541 110.199 170.478 121.103]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.724 98.244 169.661 109.147]
-/A << /S /GoTo /D (page.351) >>
->> endobj
-18762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 86.288 175.28 97.192]
-/A << /S /GoTo /D (page.352) >>
->> endobj
-18763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.692 708.674 381.629 718.861]
-/A << /S /GoTo /D (page.176) >>
->> endobj
-18764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 695.768 367.702 706.671]
-/A << /S /GoTo /D (page.176) >>
->> endobj
-18765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [479.65 683.578 496.587 694.482]
-/A << /S /GoTo /D (page.176) >>
->> endobj
-18766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.582 659.433 402.519 670.337]
-/A << /S /GoTo /D (page.177) >>
->> endobj
-18767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.559 635.054 390.496 645.958]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.148 622.864 412.085 633.768]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.329 610.675 393.265 621.579]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 599.203 387.726 609.389]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 586.296 380.533 597.2]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.522 586.296 400.458 597.2]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.665 574.106 391.601 585.01]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.827 561.917 377.763 572.82]
-/A << /S /GoTo /D (page.186) >>
->> endobj
-18775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.547 549.727 364.484 560.631]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.914 538.255 383.851 548.441]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.962 525.348 413.898 536.252]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.97 513.158 368.907 524.062]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.615 500.969 415.552 511.873]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.262 488.779 456.199 499.683]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.188 488.779 476.124 499.683]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.098 476.589 396.035 487.493]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.665 464.4 391.602 475.304]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.69 452.21 403.626 463.114]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.888 440.021 414.824 450.925]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.184 427.831 397.121 438.735]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.772 415.642 397.709 426.545]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.875 403.452 367.811 414.356]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.8 403.452 387.736 414.356]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.534 391.262 386.471 402.166]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.149 379.073 417.086 389.977]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.572 367.6 416.508 377.787]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.398 354.694 409.335 365.598]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.223 342.504 392.159 353.408]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.176 330.314 402.112 341.218]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.472 318.842 384.409 329.029]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.98 305.935 416.917 316.839]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.516 293.746 391.452 304.65]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 281.556 386.62 292.46]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.336 269.367 388.272 280.27]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 257.177 396.021 268.081]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.01 257.177 415.946 268.081]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.954 244.987 393.891 255.891]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.336 232.798 388.272 243.702]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 220.608 396.021 231.512]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.01 220.608 415.946 231.512]
-/A << /S /GoTo /D (page.194) >>
->> endobj
-18807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.954 208.419 393.891 219.323]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.206 196.229 386.142 207.133]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.131 196.229 406.067 207.133]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.705 184.039 383.642 194.943]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.63 184.039 403.567 194.943]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 171.85 391.761 182.754]
-/A << /S /GoTo /D (page.190) >>
->> endobj
-18813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.856 159.66 372.792 170.564]
-/A << /S /GoTo /D (page.191) >>
->> endobj
-18814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.781 159.66 392.718 170.564]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.487 148.188 388.424 158.375]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.23 135.281 361.166 146.185]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.223 123.092 392.159 133.995]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.6 110.902 411.537 121.806]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-18819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 98.712 367.702 109.616]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.69 98.712 387.627 109.616]
-/A << /S /GoTo /D (page.194) >>
->> endobj
-18821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.036 86.523 441.972 97.427]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-18822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.961 86.523 461.897 97.427]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-18823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.752 74.333 397.689 85.237]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-18825 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18829 0 obj <<
-/D [18827 0 R /XYZ 89 770.89 null]
->> endobj
-18826 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-18929 0 obj <<
-/Length 1702      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~����0�i�"E)X��&)�u��x����v�Z��K�����bǖeI��n/�#K?���s(bm�a����hv#t�B�A
m��,�	f!n�K��l�i�F�-�,L����wW�e?����Qv
k�x�#aj�?��	kK��F�H�L�k~��1���F�
�1‡D
\!B"�p>!|�D�c����\F��ֻ�������t?O
˥�.��d�Q����O����	�T�q<$2�ݰ�6~1�
�a�in�)�:��/Y��znF�nL�8�;ȟk�̽��En�”Ѻ���W#�Ôr<&B�7FӦ�c6͖
-7������F2��0h�1�����ʘ�rio�@:���l��e
���8׉��`�z���қP>��@�j��΋4���F��و�w
-X��s�j�/C������t������&
E�bbb�0!�x-�:d�e
�Z���e�K>���y��2yENN��>�p���
:���m���
-�X�:O} ���Tn{�v�pC��R�C]O���C�]%�:�H�6,a&�9�&�#�� L<�,�0���ݴ�nN /��C�l�䱕nC�7
b/N:8�
m�[�ng���4����&�&\{����� ˭M�o�h6G'	��]G��N)	G
ꨎ�F*+Д�Ȱ�zB3U�3�]���
���@�~�
����e�I�Q�!�[Ǖ���e�%�[�)��V'�q_Po
ؽ#��g�D���P	�%v����B�[��G�E���>�nD%�|
\y�F�8���� �U�D���h���)T}�I(�
-1L����"+�i��pZ��^R���
�����P"���2u�-'V7O(K�[����v�2�3]�]����zK_eX��������d�h].d��z��HbT�q�@os�)[�y����Q���ޫܯ��:��>HB�C�\��:^{���\�O��
�
P]��g�`�y�V�k�.V-C?�c����ރ��E��
���N
���� �e�g�V�O<�����
Ռ�B�\�V�q�0�������U�[Y��*c�5i�ő��w�s���U.�O,R��H�a&�_�?�w�<��fߢ9g�4���Y�u+���w\�J�N���`^���8W�t죙��
mw�5;ho��0;�\P�=Tww��9�]ɭ��3�tw��rm�
�*�j��(��T��Hۊ�y���
��ݕ����I䩋Jo�;�
�A����W�/���Hr��I�*���}�l�YW=�oTW�X=a`���s#J����^/�r�#A���
����Ε��s��M�JF��W�oڲ��ܲ�|��གྷ����5�0�0Tmac�޲�����Xm�r����g�
-�Ǵ^���b���w�rb&��n����n���x
%�ǡ끔,jfѼm�᮶E���&�
ik��Z<Åx�wt�2�w[;
-�ND%�*_�P=rR5J���GiRr�0,�t���
�,���fw�.t���~}0���2�	�>X7nX����ÍPs	�w=�x� �
-��S�#�0�?4���{�����쵯kW!�=�Mo��;:	9o�8�H�3v����Ee8��-�����	����7'H�M��#�h��\���c�u�&S
��V��d��{ڿfgJ�!ΠTݫ�}�l/f��t
�`���?�}e2����/�+(�r2~�����DG@�Hc

-endstream
-endobj
-18928 0 obj <<
-/Type /Page
-/Contents 18929 0 R
-/Resources 18927 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18590 0 R
-/Annots [ 18824 0 R 18830 0 R 18831 0 R 18832 0 R 18833 0 R 18834 0 R 18835 0 R 18836 0 R 18837 0 R 18838 0 R 18839 0 R 18840 0 R 18841 0 R 18842 0 R 18843 0 R 18844 0 R 18845 0 R 18846 0 R 18847 0 R 18848 0 R 18849 0 R 18850 0 R 18851 0 R 18852 0 R 18853 0 R 18854 0 R 18855 0 R 18856 0 R 18857 0 R 18858 0 R 18859 0 R 18860 0 R 18861 0 R 18862 0 R 18863 0 R 18864 0 R 18865 0 R 18866 0 R 18867 0 R 18868 0 R 18869 0 R 18870 0 R 18871 0 R 18872 0 R 18873 0 R 18874 0 R 18875 0 R 18876 0 R 18 [...]
->> endobj
-18824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.1 696.002 173.036 706.906]
-/A << /S /GoTo /D (page.177) >>
->> endobj
-18830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.809 684.047 306.745 694.951]
-/A << /S /GoTo /D (page.195) >>
->> endobj
-18831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.578 672.809 184.515 682.996]
-/A << /S /GoTo /D (page.196) >>
->> endobj
-18832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.684 660.854 185.62 671.04]
-/A << /S /GoTo /D (page.200) >>
->> endobj
-18833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.675 648.899 182.612 659.085]
-/A << /S /GoTo /D (page.199) >>
->> endobj
-18834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 636.943 165.148 647.13]
-/A << /S /GoTo /D (page.201) >>
->> endobj
-18835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.694 624.988 185.631 635.175]
-/A << /S /GoTo /D (page.198) >>
->> endobj
-18836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.03 613.033 183.967 623.22]
-/A << /S /GoTo /D (page.197) >>
->> endobj
-18837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.101 588.405 186.037 599.309]
-/A << /S /GoTo /D (page.202) >>
->> endobj
-18838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 566.552 145.791 575.399]
-/A << /S /GoTo /D (page.202) >>
->> endobj
-18839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.361 552.54 218.298 563.444]
-/A << /S /GoTo /D (page.203) >>
->> endobj
-18840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.207 540.585 270.143 551.489]
-/A << /S /GoTo /D (page.204) >>
->> endobj
-18841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.713 529.347 172.649 539.534]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.049 516.674 178.986 527.578]
-/A << /S /GoTo /D (page.208) >>
->> endobj
-18843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.975 516.674 198.911 527.578]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.895 504.719 219.832 515.623]
-/A << /S /GoTo /D (page.212) >>
->> endobj
-18845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.184 492.764 175.12 503.668]
-/A << /S /GoTo /D (page.208) >>
->> endobj
-18846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.636 480.809 174.572 491.713]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.137 469.571 190.074 479.758]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.438 456.899 219.374 467.803]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.579 444.943 189.516 455.847]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.75 433.706 170.687 443.892]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 421.033 179.539 431.937]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.875 409.078 166.812 419.982]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.494 397.123 172.43 408.027]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 385.168 175.28 396.071]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.023 373.212 177.96 384.116]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.281 361.975 181.217 372.161]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-18857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.582 349.302 215.518 360.206]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.102 337.347 226.039 348.251]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.339 325.392 192.276 336.296]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.638 313.437 200.575 324.34]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-18861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 301.481 151.22 312.385]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-18862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 301.481 171.145 312.385]
-/A << /S /GoTo /D (page.212) >>
->> endobj
-18863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.049 289.526 303.986 300.43]
-/A << /S /GoTo /D (page.212) >>
->> endobj
-18864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.37 277.571 213.307 288.475]
-/A << /S /GoTo /D (page.215) >>
->> endobj
-18865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.296 277.571 233.232 288.475]
-/A << /S /GoTo /D (page.216) >>
->> endobj
-18866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.047 266.333 152.983 276.52]
-/A << /S /GoTo /D (page.216) >>
->> endobj
-18867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 253.661 179.539 264.565]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 241.706 175.28 252.609]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.036 229.75 240.973 240.654]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.582 217.795 215.518 228.699]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 205.84 151.22 216.744]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.588 182.647 184.525 192.834]
-/A << /S /GoTo /D (page.226) >>
->> endobj
-18873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.878 158.019 192.814 168.923]
-/A << /S /GoTo /D (page.218) >>
->> endobj
-18874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.405 134.826 190.341 145.013]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-18875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 98.961 165.148 109.147]
-/A << /S /GoTo /D (page.233) >>
->> endobj
-18876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 86.288 151.22 97.192]
-/A << /S /GoTo /D (page.233) >>
->> endobj
-18877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.581 74.333 263.518 85.237]
-/A << /S /GoTo /D (page.234) >>
->> endobj
-18878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.194 708.674 389.131 718.861]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.905 696.719 388.842 706.906]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.831 696.719 408.767 706.906]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.377 684.047 436.313 694.951]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.665 672.092 391.602 682.996]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.852 660.136 389.789 671.04]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.329 648.181 393.265 659.085]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.756 636.226 412.692 647.13]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.619 624.988 406.555 635.175]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.061 612.316 405.997 623.22]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.336 600.361 388.272 611.265]
-/A << /S /GoTo /D (page.241) >>
->> endobj
-18889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.261 600.361 408.197 611.265]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 588.405 396.021 599.309]
-/A << /S /GoTo /D (page.243) >>
->> endobj
-18891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.954 576.45 393.891 587.354]
-/A << /S /GoTo /D (page.242) >>
->> endobj
-18892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.88 576.45 413.816 587.354]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.336 564.495 393.253 575.399]
-/A << /S /GoTo /D (page.242d) >>
->> endobj
-18894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.954 552.54 393.891 563.444]
-/A << /S /GoTo /D (page.243) >>
->> endobj
-18895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.88 552.54 413.816 563.444]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 540.585 396.742 551.489]
-/A << /S /GoTo /D (page.242d) >>
->> endobj
-18897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.449 528.63 454.386 539.534]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.063 516.674 432 527.578]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.583 504.719 442.52 515.623]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-18900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 492.764 367.702 503.668]
-/A << /S /GoTo /D (page.243) >>
->> endobj
-18901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.69 492.764 387.627 503.668]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-18902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.068 480.809 367.004 491.713]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-18903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.06 468.854 513.996 479.758]
-/A << /S /GoTo /D (page.245) >>
->> endobj
-18904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.226 456.899 423.163 467.803]
-/A << /S /GoTo /D (page.247) >>
->> endobj
-18905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 444.943 396.021 455.847]
-/A << /S /GoTo /D (page.248) >>
->> endobj
-18906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 432.988 367.702 443.892]
-/A << /S /GoTo /D (page.248) >>
->> endobj
-18907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.07 409.795 401.006 419.982]
-/A << /S /GoTo /D (page.248) >>
->> endobj
-18908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.359 385.168 409.295 396.071]
-/A << /S /GoTo /D (page.249) >>
->> endobj
-18909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.886 361.975 406.823 372.161]
-/A << /S /GoTo /D (page.249) >>
->> endobj
-18910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.188 337.347 452.124 348.251]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 325.392 396.021 336.296]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 313.437 391.761 324.34]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 301.481 367.702 312.385]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-18914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 279.628 362.272 288.475]
-/A << /S /GoTo /D (page.250) >>
->> endobj
-18915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.692 242.423 381.629 252.609]
-/A << /S /GoTo /D (page.255) >>
->> endobj
-18916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 229.75 367.702 240.654]
-/A << /S /GoTo /D (page.255) >>
->> endobj
-18917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.692 194.602 381.629 204.789]
-/A << /S /GoTo /D (page.258) >>
->> endobj
-18918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 181.93 367.702 192.834]
-/A << /S /GoTo /D (page.259) >>
->> endobj
-18919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.066 158.737 375.002 168.923]
-/A << /S /GoTo /D (page.259) >>
->> endobj
-18920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.863 134.109 455.8 145.013]
-/A << /S /GoTo /D (page.271) >>
->> endobj
-18921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.343 122.154 437.28 133.058]
-/A << /S /GoTo /D (page.270) >>
->> endobj
-18922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.91 110.199 440.847 121.103]
-/A << /S /GoTo /D (page.271) >>
->> endobj
-18923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.733 98.244 394.67 109.147]
-/A << /S /GoTo /D (page.270) >>
->> endobj
-18924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [426.469 74.333 443.405 85.237]
-/A << /S /GoTo /D (page.269) >>
->> endobj
-18926 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-18930 0 obj <<
-/D [18928 0 R /XYZ 89 770.89 null]
->> endobj
-18927 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19055 0 obj <<
-/Length 1634      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~����b`QH�
�{�zAo[�f��� h�����rS�׏�%�]G�,��$v$�;߹����J-`���r=�x
8VdG>��+p#����us������~e� ������^�˳g׳��W���=;�8��| V"/����D�uW�-9�3������]">8 �
a#�j�3�s���l��	'�
[p·��ϳ�T�H�=VT�ײ)�k�
3���|1���=h�K����w��
#��~�a�N�6�1�rH�����\j����l���?5#������q=��5��YJ�#�(�=t�>؁v
5��9��cA)�EAk-o���}^s*k�aAI
y��'
Qf��b�yɵ�}�`Lʤ��
I��BOEk5�XA	7�	zY��b�����������f��
-��64`x��#>�u�W�����R���
ܓ��� &2L�B��zmB�����K�bT��y=
jF�
-w��`[�q2
?	�P�����|
�_�uE���4�lj��m��бx4I������Rl#f�	����J�Ԃ�
�J��Rl8�k�0� C��_;C4�	��mqI�*�䂁bF�s>�f�rb�U�S�,KL���ZG��I�dB���L7q�J
-�U�S�P
������P�hC/4���`�٧3��u
��nH��r$��-B�'�j<l�Y��`�vp,����j?�x�G`�n\}��w�Z�nqt��nd\��'9�Ux���%�V����=�X8	�i��85���c�v�������%�+��O���L�>���M
i�V��#��b�j2�
�]]S��A�����[#���L>��ﶢ��P�G{
"f
g%I�h�YE`J��0���N
���: ;��N�m��-_��S܎c������ʬ6�J�ch��8��M�
�B��?4K�V)�P�y5�<�	vi�Dʼn~�u 
 &&@K�pjX������
G�q�\\U
m�s�^�Chcâa�e�p�äH0�T7�
O_��,s����w
-�YNR�l��#dP�NGa�$�H��N 
6&
�^�2�d�S��pA`���Y���)�ZL*Z�_�2�Ѱ��۴��XB
���
F:�MR�U��`��$��%��x��
���k,ʜ�,0{x!�tũ&��G*�
�8�?.�,�
p�ۏ�魊�:w��U���ۻ�R�?p��K>��1N@߆��LNZz#Π�t���r[��%ABGT�
W����[��U�(T�!�������m����U��ʔ�$˶X���$��uf�r�!٭�p�V�)�
0,�/_;I'�C#����F�r�
�

�g����ӧ�_��0
ܿj��z�fh�D`؁�*5
t�����Ki��
�
�VC���$ؓwc�#��{qg]�ͣw��b�JVb��3"dbt��uƖ[�jMW��k�yx��Gv�
ӳ|��PN2�m�����M'vE����7͗��?�=�L4��%ņd�����I��TX}�@^���\���w��z4����o�չFo�
-�\���Oԭ�j}yq�ؤ��
���A��lܷ+�2��d�
-�B^��%��NEvv� �}u��Ƽ���>�'v��7��
/s�zZJ?
���s�
-endstream
-endobj
-19054 0 obj <<
-/Type /Page
-/Contents 19055 0 R
-/Resources 19053 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18590 0 R
-/Annots [ 18925 0 R 18931 0 R 18932 0 R 18933 0 R 18934 0 R 18935 0 R 18936 0 R 18937 0 R 18938 0 R 18939 0 R 18940 0 R 18941 0 R 18942 0 R 18943 0 R 18944 0 R 18945 0 R 18946 0 R 18947 0 R 18948 0 R 18949 0 R 18950 0 R 18951 0 R 18952 0 R 18953 0 R 18954 0 R 18955 0 R 18956 0 R 18957 0 R 18958 0 R 18959 0 R 18960 0 R 18961 0 R 18962 0 R 18963 0 R 18964 0 R 18965 0 R 18966 0 R 18967 0 R 18968 0 R 18969 0 R 18970 0 R 18971 0 R 18972 0 R 18973 0 R 18974 0 R 18975 0 R 18976 0 R 18977 0 R 18 [...]
->> endobj
-18925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 698.059 145.791 706.906]
-/A << /S /GoTo /D (page.263) >>
->> endobj
-18931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.412 671.852 238.349 682.756]
-/A << /S /GoTo /D (page.263) >>
->> endobj
-18932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.454 648.181 188.39 658.368]
-/A << /S /GoTo /D (page.269) >>
->> endobj
-18933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.713 635.987 172.649 646.174]
-/A << /S /GoTo /D (page.269) >>
->> endobj
-18934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 623.793 165.148 633.979]
-/A << /S /GoTo /D (page.267) >>
->> endobj
-18935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.655 611.598 169.591 621.785]
-/A << /S /GoTo /D (page.268) >>
->> endobj
-18936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.728 599.404 184.664 609.591]
-/A << /S /GoTo /D (page.268) >>
->> endobj
-18937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.702 586.493 276.639 597.397]
-/A << /S /GoTo /D (page.291) >>
->> endobj
-18938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 574.298 174.014 585.202]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-18939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.667 562.104 195.603 573.008]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.48 549.91 197.417 560.814]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.134 537.716 199.07 548.619]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.184 525.521 175.12 536.425]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.209 513.327 187.145 524.231]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.742 501.133 175.678 512.037]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.499 488.938 200.435 499.842]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.035 476.744 174.971 487.648]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-18947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.006 465.267 171.942 475.454]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-18948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.29 452.356 176.226 463.26]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-18949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.742 440.161 175.678 451.065]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.119 427.967 195.055 438.871]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-18951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.898 415.773 261.834 426.677]
-/A << /S /GoTo /D (page.271) >>
->> endobj
-18952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.146 403.579 185.083 414.482]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-18953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.072 403.579 205.008 414.482]
-/A << /S /GoTo /D (page.282) >>
->> endobj
-18954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.997 403.579 224.933 414.482]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.713 392.102 172.649 402.288]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-18956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.895 379.19 219.832 390.094]
-/A << /S /GoTo /D (page.286) >>
->> endobj
-18957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.337 367.713 158.274 377.9]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18958 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.603 354.801 236.539 365.705]
-/A << /S /GoTo /D (page.283) >>
->> endobj
-18959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.528 354.801 256.464 365.705]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.184 342.607 175.12 353.511]
-/A << /S /GoTo /D (page.278) >>
->> endobj
-18961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.371 330.413 173.307 341.317]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.741 318.936 170.677 329.123]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.848 306.024 176.784 316.928]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.274 293.83 196.211 304.734]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.969 281.636 239.887 292.54]
-/A << /S /GoTo /D (page.284d) >>
->> endobj
-18966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 270.159 145.79 280.345]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.779 270.159 165.716 280.345]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.705 270.159 185.641 280.345]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 257.247 179.539 268.151]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.528 257.247 199.465 268.151]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 245.053 175.28 255.957]
-/A << /S /GoTo /D (page.282) >>
->> endobj
-18972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.268 245.053 195.205 255.957]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.036 232.859 240.973 243.763]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-18974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.393 220.664 151.33 231.568]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.319 220.664 171.255 231.568]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.244 220.664 191.18 231.568]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.633 208.47 143.569 219.374]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.558 208.47 163.494 219.374]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.483 208.47 183.42 219.374]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.814 196.276 238.751 207.18]
-/A << /S /GoTo /D (page.282) >>
->> endobj
-18981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.739 196.276 258.676 207.18]
-/A << /S /GoTo /D (page.283) >>
->> endobj
-18982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.665 196.276 278.601 207.18]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-18983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.968 184.082 237.904 194.986]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-18984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.582 171.887 215.518 182.791]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-18985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.102 159.693 226.039 170.597]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-18986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 147.499 151.22 158.403]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-18987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 147.499 171.145 158.403]
-/A << /S /GoTo /D (page.286) >>
->> endobj
-18988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.587 135.305 150.523 146.208]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-18989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.219 123.11 296.155 134.014]
-/A << /S /GoTo /D (page.286) >>
->> endobj
-18990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.308 111.633 171.245 121.82]
-/A << /S /GoTo /D (page.289) >>
->> endobj
-18991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.061 98.722 204.998 109.626]
-/A << /S /GoTo /D (page.289) >>
->> endobj
-18992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 86.527 179.539 97.431]
-/A << /S /GoTo /D (page.290) >>
->> endobj
-18993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 74.333 151.22 85.237]
-/A << /S /GoTo /D (page.290) >>
->> endobj
-18994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.07 696.719 401.006 706.906]
-/A << /S /GoTo /D (page.290) >>
->> endobj
-18995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.81 684.047 456.747 694.951]
-/A << /S /GoTo /D (page.294) >>
->> endobj
-18996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.676 672.092 412.613 682.996]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-18997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.552 660.136 416.488 671.04]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-18998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.051 648.899 405.987 659.085]
-/A << /S /GoTo /D (page.311) >>
->> endobj
-18999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.926 636.943 409.863 647.13]
-/A << /S /GoTo /D (page.311) >>
->> endobj
-19000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.408 624.271 425.345 635.175]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-19001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.284 612.316 429.22 623.22]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-19002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.127 600.361 455.063 611.265]
-/A << /S /GoTo /D (page.311) >>
->> endobj
-19003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.501 588.405 448.438 599.309]
-/A << /S /GoTo /D (page.312) >>
->> endobj
-19004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.859 576.45 467.795 587.354]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-19005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.165 564.495 490.101 575.399]
-/A << /S /GoTo /D (page.321) >>
->> endobj
-19006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.271 552.54 491.207 563.444]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-19007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 540.585 399.093 551.489]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-19008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 528.63 411.816 539.534]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-19009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 516.674 438.386 527.578]
-/A << /S /GoTo /D (page.317) >>
->> endobj
-19010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 504.719 451.108 515.623]
-/A << /S /GoTo /D (page.318) >>
->> endobj
-19011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 493.481 428.932 503.668]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-19012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 481.526 429.539 491.713]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-19013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.302 468.854 424.239 479.758]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-19014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [448.259 456.899 465.195 467.803]
-/A << /S /GoTo /D (page.319) >>
->> endobj
-19015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 445.661 387.726 455.847]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-19016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 433.706 380.533 443.892]
-/A << /S /GoTo /D (page.309) >>
->> endobj
-19017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.408 421.033 417.345 431.937]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-19018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.428 409.078 473.365 419.982]
-/A << /S /GoTo /D (page.319) >>
->> endobj
-19019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.617 397.123 449.554 408.027]
-/A << /S /GoTo /D (page.323) >>
->> endobj
-19020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 385.168 440.856 396.071]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-19021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.073 373.212 387.009 384.116]
-/A << /S /GoTo /D (page.309) >>
->> endobj
-19022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.056 361.257 449.992 372.161]
-/A << /S /GoTo /D (page.316) >>
->> endobj
-19023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.981 361.257 469.917 372.161]
-/A << /S /GoTo /D (page.317) >>
->> endobj
-19024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.778 349.302 462.714 360.206]
-/A << /S /GoTo /D (page.316) >>
->> endobj
-19025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.703 349.302 482.639 360.206]
-/A << /S /GoTo /D (page.317) >>
->> endobj
-19026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.96 337.347 456.896 348.251]
-/A << /S /GoTo /D (page.320) >>
->> endobj
-19027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.653 326.109 370.571 336.296]
-/A << /S /GoTo /D (page.303d) >>
->> endobj
-19028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.444 314.154 389.38 324.34]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-19029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.764 301.481 423.701 312.385]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.001 290.243 389.938 300.43]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-19031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.264 277.571 413.2 288.475]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-19032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.036 265.616 441.972 276.52]
-/A << /S /GoTo /D (page.306) >>
->> endobj
-19033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.816 253.661 513.752 264.565]
-/A << /S /GoTo /D (page.320) >>
->> endobj
-19034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.917 241.706 462.853 252.609]
-/A << /S /GoTo /D (page.321) >>
->> endobj
-19035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [488.517 229.75 505.453 240.654]
-/A << /S /GoTo /D (page.321) >>
->> endobj
-19036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.026 217.795 441.962 228.699]
-/A << /S /GoTo /D (page.323) >>
->> endobj
-19037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 206.557 386.62 216.744]
-/A << /S /GoTo /D (page.307) >>
->> endobj
-19038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.609 206.557 406.545 216.744]
-/A << /S /GoTo /D (page.308) >>
->> endobj
-19039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.03 194.602 384.966 204.789]
-/A << /S /GoTo /D (page.308) >>
->> endobj
-19040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.955 194.602 404.892 204.789]
-/A << /S /GoTo /D (page.309) >>
->> endobj
-19041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.778 182.647 361.714 192.834]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-19042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 169.975 396.021 180.878]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-19043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 158.019 391.761 168.923]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-19044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [426.67 146.064 443.606 156.968]
-/A << /S /GoTo /D (page.312) >>
->> endobj
-19045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.545 134.109 447.482 145.013]
-/A << /S /GoTo /D (page.312) >>
->> endobj
-19046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.044 122.871 436.981 133.058]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-19047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 110.916 440.856 121.103]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-19048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [467.885 98.244 484.821 109.147]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-19049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.449 86.288 454.386 97.192]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-19050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.226 74.333 471.162 85.237]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-19052 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19056 0 obj <<
-/D [19054 0 R /XYZ 89 770.89 null]
->> endobj
-19053 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19172 0 obj <<
-/Length 1756      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~ׯ�ҤZ/���&�C�q�6n�N;�d��X�4\@q�_��E���
-Y틄���﹀����������ejr�����`�"�
~y�͐�l�i�V3
�
��S��__]���1���
��X�˧)�lm
n>a̓�o5�L���E�F
����~L�1\T�t
�z�k�%�<

�y
e܏�
ʽ�EE���flP<4u\-(w��1�9�Vx�#
�Rc�m����	ںq��_���i�/")'v+�*��x@(R$ҌT)|�\�ĝū��Ji'm��o]1����g=��}OD~��H��n�	_
���^���u�%OB�^�����g	O
&����ܗ"���s�	U�j�r
�K�ȡX�� �'����M�T�&Xwj\��V�I��Hx'��7KQ܎
:,X�E$5S�l5,��P�
-27�D���3?�ڙ�
I<?'����Gb��o9Yi��V�J��
���j��P���?�8�/QS��2���׊䧮��⁛Ň��=F*�'���d�vS�����Eg����~��&o_�ϟ�K��}��
-�U��4&6b�������P�
�O
�L$O`�Ǧ5a�����C��υ�Aj原��G�

��U	q��$ّ�j<�t��ο͎&G�$���1
�x��T��"�C���f"TJBL�1b۫x:�}7��'��i�Q
-�SO�SZ��6	nw��&�C�a9x�r�UŻk&�IQf�~�)1
�oj��r�j��Lz�D�+�
�K�.H_9^�w�W�)
��)�`Q(��h!C#}�x.�����<��l~�ŋ6S}�f��D�sw��~���V�uڄ͞��w~�5�3�B�am�YS4�� ��Qk��S��,�t
��
�D��(��{��
�LGİ�O��>��ߚ
'��4g��Ntox���z'��5Y�@�u�M���,Z���57��a�<�X[p��s8��M���ِi`�����*�wi�rbMo(���7-/ʧ�b1d�
-ʞ�%"����ȶ�ci��?݂����X�m�9A!�X���F&
&��ҦC�����X��	��`�I	�tG���eE�o^�2ϔ���Eګl���"
�I��GLk
�JG�Ŷm��dy2�m�iO�Bui
�^m՛Tc��I��^aM�l�
-�8� ��p
(y��jD���@
-ku�]EU�3oZ%i`��X��-��w��)M��g]�a
�C�

%��y
�l��}
Ĉ�^�"���a��`cx��
�@"x&��i퟊��z-�"��O��j4T��
���}�Qզ
�Z�uV�K�����C��뉠0�`�c
u=��3�����ð��g
�:���
���
-�ܩ��c����J:�����]��S(Gh�Z]#Q!�
W��(��� G���A��w�Ay>��=u�Fz=�:*�'P�5E<�����Ӿb�c��Ο^��\������I�� .�����O}�9\e�#ZI�9 ��6
����u?B$����?��+�#��L�
�;W���}��C�.�9]{"t;�ڐ�����������m��,�������N��FX�,����u�������Uhj�b �7��w����6�ьɒ�%�zӪa)ʶ������T$?�(
���_x�Ay�S�����ʛ:�p_G��	�� D%������_r���Q�)T�l99;������-�טq
��M+�N���0N*�|(r�+�

���
��
-endstream
-endobj
-19171 0 obj <<
-/Type /Page
-/Contents 19172 0 R
-/Resources 19170 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 18590 0 R
-/Annots [ 19051 0 R 19057 0 R 19058 0 R 19059 0 R 19060 0 R 19061 0 R 19062 0 R 19063 0 R 19064 0 R 19065 0 R 19066 0 R 19067 0 R 19068 0 R 19069 0 R 19070 0 R 19071 0 R 19072 0 R 19073 0 R 19074 0 R 19075 0 R 19076 0 R 19077 0 R 19078 0 R 19079 0 R 19080 0 R 19081 0 R 19082 0 R 19083 0 R 19084 0 R 19085 0 R 19086 0 R 19087 0 R 19088 0 R 19089 0 R 19090 0 R 19091 0 R 19092 0 R 19093 0 R 19094 0 R 19095 0 R 19096 0 R 19097 0 R 19098 0 R 19099 0 R 19100 0 R 19101 0 R 19102 0 R 19103 0 R 19 [...]
->> endobj
-19051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.772 707.957 196.709 718.861]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-19057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 696.002 151.22 706.906]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-19058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 696.002 171.145 706.906]
-/A << /S /GoTo /D (page.325) >>
->> endobj
-19059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.389 684.047 208.325 694.951]
-/A << /S /GoTo /D (page.318) >>
->> endobj
-19060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.396 672.809 177.332 682.996]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.371 660.136 213.307 671.04]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.292 648.181 250.228 659.085]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.878 636.226 197.815 647.13]
-/A << /S /GoTo /D (page.320) >>
->> endobj
-19064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 624.271 180.65 635.175]
-/A << /S /GoTo /D (page.318) >>
->> endobj
-19065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.814 612.316 286.75 623.22]
-/A << /S /GoTo /D (page.325) >>
->> endobj
-19066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 600.361 165.148 611.265]
-/A << /S /GoTo /D (page.326) >>
->> endobj
-19067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 578.388 145.791 587.354]
-/A << /S /GoTo /D (page.195) >>
->> endobj
-19068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.14 564.495 285.077 575.399]
-/A << /S /GoTo /D (page.326) >>
->> endobj
-19069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.713 553.257 172.649 563.444]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.895 540.585 219.832 551.489]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.337 529.347 158.274 539.534]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.184 516.674 175.12 527.578]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-19073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.371 504.719 173.307 515.623]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.983 493.481 193.92 503.668]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-19075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.885 480.809 166.821 491.713]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-19076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 480.809 186.747 491.713]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.424 468.854 177.342 479.758]
-/A << /S /GoTo /D (page.333d) >>
->> endobj
-19078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.848 456.899 176.784 467.803]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.274 444.943 196.211 455.847]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 432.988 179.539 443.892]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.528 432.988 199.465 443.892]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 421.033 175.28 431.937]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.268 421.033 195.205 431.937]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.74 409.078 170.677 419.982]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-19085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.666 409.078 190.602 419.982]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [193.591 409.078 210.527 419.982]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.968 397.123 237.904 408.027]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.965 385.885 195.902 396.071]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.387 373.93 174.323 384.116]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19090 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.582 361.257 215.518 372.161]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.102 349.302 226.039 360.206]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 337.347 151.22 348.251]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 337.347 171.145 348.251]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.587 325.392 150.523 336.296]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-19095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 303.539 145.791 312.385]
-/A << /S /GoTo /D (page.336) >>
->> endobj
-19096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.308 290.243 171.245 300.43]
-/A << /S /GoTo /D (page.339) >>
->> endobj
-19097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [136.047 278.288 152.983 288.475]
-/A << /S /GoTo /D (page.339) >>
->> endobj
-19098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 265.616 179.539 276.52]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-19099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 253.661 175.28 264.565]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-19100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 241.706 151.22 252.609]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-19101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.158 218.512 211.095 228.699]
-/A << /S /GoTo /D (page.228) >>
->> endobj
-19102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.708 205.84 285.644 216.744]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-19103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 193.885 165.148 204.789]
-/A << /S /GoTo /D (page.341) >>
->> endobj
-19104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 171.912 145.791 180.878]
-/A << /S /GoTo /D (page.194) >>
->> endobj
-19105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.841 158.019 271.797 168.923]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-19106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 146.064 173.457 156.968]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-19107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.909 122.154 250.846 133.058]
-/A << /S /GoTo /D (page.259) >>
->> endobj
-19108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.529 98.961 204.466 109.147]
-/A << /S /GoTo /D (page.260) >>
->> endobj
-19109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.83 75.05 238.767 85.237]
-/A << /S /GoTo /D (page.262) >>
->> endobj
-19110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.945 696.719 404.882 706.906]
-/A << /S /GoTo /D (page.341) >>
->> endobj
-19111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.875 672.092 512.812 682.996]
-/A << /S /GoTo /D (page.342) >>
->> endobj
-19112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [428.353 648.899 445.29 659.085]
-/A << /S /GoTo /D (page.344) >>
->> endobj
-19113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.577 624.271 504.513 635.175]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-19114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.369 600.361 469.305 611.265]
-/A << /S /GoTo /D (page.462) >>
->> endobj
-19115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.538 577.168 393.475 587.354]
-/A << /S /GoTo /D (page.560) >>
->> endobj
-19116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.021 564.495 506.958 575.399]
-/A << /S /GoTo /D (page.344) >>
->> endobj
-19117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.582 540.585 402.519 551.489]
-/A << /S /GoTo /D (page.345) >>
->> endobj
-19118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.762 516.674 389.699 527.578]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-19119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.781 504.719 392.717 515.623]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-19120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.864 493.481 415.8 503.668]
-/A << /S /GoTo /D (page.347) >>
->> endobj
-19121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.182 481.526 411.118 491.713]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-19122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.226 468.854 471.162 479.758]
-/A << /S /GoTo /D (page.347) >>
->> endobj
-19123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 456.899 367.702 467.803]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-19124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.066 433.706 375.002 443.892]
-/A << /S /GoTo /D (page.345) >>
->> endobj
-19125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.806 421.033 513.742 431.937]
-/A << /S /GoTo /D (page.352) >>
->> endobj
-19126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.148 409.078 412.085 419.982]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.073 409.078 432.01 419.982]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.379 397.123 369.316 408.027]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-19129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.778 385.885 361.714 396.071]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-19130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.329 373.212 393.265 384.116]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [405.649 361.257 427.567 372.161]
-/A << /S /GoTo /D (page.358d) >>
->> endobj
-19132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.369 350.019 409.305 360.206]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-19133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.294 350.019 429.23 360.206]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.524 338.064 426.46 348.251]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.715 326.109 399.652 336.296]
-/A << /S /GoTo /D (page.361) >>
->> endobj
-19136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.516 313.437 391.452 324.34]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.441 313.437 411.378 324.34]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.232 302.199 387.168 312.385]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 289.526 396.021 300.43]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.01 289.526 415.946 300.43]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.568 277.571 385.505 288.475]
-/A << /S /GoTo /D (page.364) >>
->> endobj
-19142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [388.493 277.571 405.43 288.475]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-19143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.187 265.616 391.123 276.52]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.112 265.616 411.049 276.52]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.206 253.661 386.142 264.565]
-/A << /S /GoTo /D (page.363) >>
->> endobj
-19146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.131 253.661 406.067 264.565]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.056 253.661 425.993 264.565]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-19148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 241.706 391.761 252.609]
-/A << /S /GoTo /D (page.364) >>
->> endobj
-19149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.75 241.706 411.686 252.609]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-19150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.705 229.75 383.642 240.654]
-/A << /S /GoTo /D (page.363) >>
->> endobj
-19151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.63 229.75 403.567 240.654]
-/A << /S /GoTo /D (page.364) >>
->> endobj
-19152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.556 229.75 423.492 240.654]
-/A << /S /GoTo /D (page.366) >>
->> endobj
-19153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.324 217.795 394.242 228.699]
-/A << /S /GoTo /D (page.364d) >>
->> endobj
-19154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.975 205.84 388.912 216.744]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.9 205.84 408.837 216.744]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.517 193.885 457.454 204.789]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.449 181.93 454.386 192.834]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.583 169.975 442.52 180.878]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.821 158.019 408.757 168.923]
-/A << /S /GoTo /D (page.363) >>
->> endobj
-19160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.6 146.064 411.537 156.968]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19161 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.525 146.064 431.462 156.968]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19162 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 134.109 367.702 145.013]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19163 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.69 134.109 387.627 145.013]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.07 110.916 401.006 121.103]
-/A << /S /GoTo /D (page.224) >>
->> endobj
-19165 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.175 98.961 402.112 109.147]
-/A << /S /GoTo /D (page.224) >>
->> endobj
-19166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.497 86.288 380.434 97.192]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-19167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 74.333 391.761 85.237]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-19169 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19173 0 obj <<
-/D [19171 0 R /XYZ 89 770.89 null]
->> endobj
-19170 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19292 0 obj <<
-/Length 1756      
-/Filter /FlateDecode
->>
-stream
-xڽZ[w�6
���m��Hq�Y�Ф�ҵY�f;;k{t0�
:n�4���
��&	p�bc,~��o+/&Ϯ'��ixȳ�m\/
��!f�������?��/

�3���`�#oO�_O>M����f�q� ������~i`dz�q[-�
���
o'N�.!6�!�`���pA��{����2ͧ�f?W���
o^L�w3���l���>f��1���P8j ����|�gCa6�<����C
����H-�=���D�>�J����}�*��~~wr�*L����_�\E�&�"�"�z|j��OJ0"��z~�W�i|F
������&��ܶ""|o��� :Ly���$H���aY�K)���"p����U�dz�ed�I`��VHc� J�j�N+�Z�'C�� �4�K�@����N����?B_�<�}NI�� |o
[��s�&���6�����{�i"�V�0�W*M��T�",?_�4�y.�@#+�պ�¯j����!
%�s����4��}ll
��!
r�f���F��x�mؒ��3ۃFM�
e,�la�B�K�y`�ypFsm��8N��Fr������'}=�����'j��B?�|�y$cV�k�Q���`C��w�Z����C��[�ڮYs�e(�jh.�\Yੂ�f5~@���:��y�N܇jb��%ap�[4R�M�0��=d[�q��E�t�
�.�1 [...]
-��.e����hA�Ubt�
�iR�i�7"�c���o%0�$�
��)!��XxQG��(\��������r���T�in�(`)�"k�Y�c �`a�
k���5�\[wiߐ��5�?��u�B�>���D|k�/*n�
���� �/D9�H�CA�F5�P"�~	�Bzg�
�՞�u۔:m�؃g�9��
9�F
�e����7hp���0�������Q
-�������L
v�F
GU���]� z����;�qyyz[m���ڶ�H�YH��XW~�m��@��T.�\�T�gwe �A��AL��K�3��*��h
ڌ@;�
c
U��J�rP����*M ���3�n6e�*_����*�P��nV(��
�P��!������<4�M�R]d~ �"�E"�i�}h�D<
8������L?~Є�"n�U��:�dB�E���o��Ō߆
��
-L�i�U�
�5@^`]IP��.�2Oc��w�-*\ܝ�wq�"��6C1�Mߩcs!��ޛ�Q]�h*���?�kJfj�2�l"5�
-��]�H
P��*Nd*�\��4F�G��C���"�O@��F*}
~�*)I��g7���"�~��(}}F��P
�5g2�7"���N��p�I}�{�L���i$��\|�)�J�J#��D]�<��ݾ&�⏒��Ҽ�F�
�o���a!���	j!�
��t����>V}�� #CT.P	;,���Q�%�t\n�.�b?��hL�EN�zgy
7�6�8L�6n�hlL:m�ѽ)�=X
>�t4W���E&i�hҁS�!`��D�z���!O˶��S�?��2(yB�$���w
m�
j��}��˱��˖��������j���W��_���2vTԿ_��ڏ������Qj5��n��>AәI��[!6|�D�gl�~��}�
R�c�3����N����U!�
-�xO M><���	=t�511H��
-ْVQm��ʑa�l�n%��4�ǡՊ����탛��i�� �o����N4
-endstream
-endobj
-19291 0 obj <<
-/Type /Page
-/Contents 19292 0 R
-/Resources 19290 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19294 0 R
-/Annots [ 19168 0 R 19174 0 R 19175 0 R 19176 0 R 19177 0 R 19178 0 R 19179 0 R 19180 0 R 19181 0 R 19182 0 R 19183 0 R 19184 0 R 19185 0 R 19186 0 R 19187 0 R 19188 0 R 19189 0 R 19190 0 R 19191 0 R 19192 0 R 19193 0 R 19194 0 R 19195 0 R 19196 0 R 19197 0 R 19198 0 R 19199 0 R 19200 0 R 19201 0 R 19202 0 R 19203 0 R 19204 0 R 19205 0 R 19206 0 R 19207 0 R 19208 0 R 19209 0 R 19210 0 R 19211 0 R 19212 0 R 19213 0 R 19214 0 R 19215 0 R 19216 0 R 19217 0 R 19218 0 R 19219 0 R 19220 0 R 19 [...]
->> endobj
-19168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.541 707.957 170.478 718.861]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-19174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.724 696.002 169.661 706.906]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-19175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 684.047 175.28 694.951]
-/A << /S /GoTo /D (page.226) >>
->> endobj
-19176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 672.092 151.22 682.996]
-/A << /S /GoTo /D (page.226) >>
->> endobj
-19177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.75 660.854 162.687 671.04]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-19178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.968 636.943 239.905 647.13]
-/A << /S /GoTo /D (page.222) >>
->> endobj
-19179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.489 601.078 152.426 611.265]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-19180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 588.405 175.28 599.309]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-19181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.541 576.45 170.478 587.354]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-19182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 564.495 175.28 575.399]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-19183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.75 553.257 162.687 563.444]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-19184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.889 529.347 250.825 539.534]
-/A << /S /GoTo /D (page.229) >>
->> endobj
-19185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.024 504.719 206.961 515.623]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.234 493.481 212.171 503.668]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.713 481.526 172.649 491.713]
-/A << /S /GoTo /D (page.373) >>
->> endobj
-19188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.333 469.571 183.27 479.758]
-/A << /S /GoTo /D (page.372) >>
->> endobj
-19189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 456.899 179.539 467.803]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-19190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.528 456.899 199.465 467.803]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-19191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.087 444.943 169.023 455.847]
-/A << /S /GoTo /D (page.375) >>
->> endobj
-19192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 444.943 188.949 455.847]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-19193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.937 444.943 208.874 455.847]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-19194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.706 432.988 174.642 443.892]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-19195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.631 432.988 194.567 443.892]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-19196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.724 421.033 169.661 431.937]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.65 421.033 189.586 431.937]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-19198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 409.078 180.261 419.982]
-/A << /S /GoTo /D (page.375d) >>
->> endobj
-19199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.224 397.123 167.16 408.027]
-/A << /S /GoTo /D (page.375) >>
->> endobj
-19200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.149 397.123 187.086 408.027]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-19201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.843 385.168 177.76 396.071]
-/A << /S /GoTo /D (page.376d) >>
->> endobj
-19202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.494 373.212 172.43 384.116]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-19203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.419 373.212 192.356 384.116]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-19204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 361.257 175.28 372.161]
-/A << /S /GoTo /D (page.376) >>
->> endobj
-19205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.268 361.257 195.205 372.161]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-19206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.655 350.019 169.591 360.206]
-/A << /S /GoTo /D (page.372) >>
->> endobj
-19207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.728 338.064 184.664 348.251]
-/A << /S /GoTo /D (page.373) >>
->> endobj
-19208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 325.392 151.22 336.296]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 325.392 171.145 336.296]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-19210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.371 313.437 213.307 324.34]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.94 301.481 299.876 312.385]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.525 289.526 278.462 300.43]
-/A << /S /GoTo /D (page.378) >>
->> endobj
-19213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 278.288 189.506 288.475]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-19214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 266.333 193.382 276.52]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-19215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.267 254.378 150.204 264.565]
-/A << /S /GoTo /D (page.383) >>
->> endobj
-19216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.348 242.423 235.284 252.609]
-/A << /S /GoTo /D (page.381) >>
->> endobj
-19217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.242 230.468 234.178 240.654]
-/A << /S /GoTo /D (page.381) >>
->> endobj
-19218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.899 217.795 242.836 228.699]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-19219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.358 205.84 187.294 216.744]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-19220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.386 194.602 182.323 204.789]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-19221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.368 182.647 187.304 192.834]
-/A << /S /GoTo /D (page.382) >>
->> endobj
-19222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.293 182.647 207.23 192.834]
-/A << /S /GoTo /D (page.383) >>
->> endobj
-19223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 169.975 179.539 180.878]
-/A << /S /GoTo /D (page.386) >>
->> endobj
-19224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.667 158.019 187.603 168.923]
-/A << /S /GoTo /D (page.386) >>
->> endobj
-19225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.552 146.064 199.489 156.968]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-19226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.27 134.109 221.207 145.013]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-19227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.792 122.871 151.728 133.058]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-19228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 110.199 151.22 121.103]
-/A << /S /GoTo /D (page.386) >>
->> endobj
-19229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 88.346 145.791 97.192]
-/A << /S /GoTo /D (page.227) >>
->> endobj
-19230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 74.333 175.28 85.237]
-/A << /S /GoTo /D (page.228) >>
->> endobj
-19231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.692 684.764 381.629 694.951]
-/A << /S /GoTo /D (page.389) >>
->> endobj
-19232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 672.092 367.702 682.996]
-/A << /S /GoTo /D (page.390) >>
->> endobj
-19233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.499 660.136 510.435 671.04]
-/A << /S /GoTo /D (page.390) >>
->> endobj
-19234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.341 648.181 424.259 659.085]
-/A << /S /GoTo /D (page.392d) >>
->> endobj
-19235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.359 624.271 409.295 635.175]
-/A << /S /GoTo /D (page.396) >>
->> endobj
-19236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.066 601.078 375.002 611.265]
-/A << /S /GoTo /D (page.396) >>
->> endobj
-19237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.676 576.45 412.613 587.354]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-19238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.552 564.495 416.488 575.399]
-/A << /S /GoTo /D (page.413) >>
->> endobj
-19239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.051 553.257 405.987 563.444]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-19240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.926 541.302 409.863 551.489]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-19241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.127 528.63 455.063 539.534]
-/A << /S /GoTo /D (page.413) >>
->> endobj
-19242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.501 516.674 448.438 527.578]
-/A << /S /GoTo /D (page.412) >>
->> endobj
-19243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.165 504.719 490.101 515.623]
-/A << /S /GoTo /D (page.424) >>
->> endobj
-19244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.271 492.764 491.207 503.668]
-/A << /S /GoTo /D (page.424) >>
->> endobj
-19245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.505 480.809 423.442 491.713]
-/A << /S /GoTo /D (page.418) >>
->> endobj
-19246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 468.854 399.093 479.758]
-/A << /S /GoTo /D (page.417) >>
->> endobj
-19247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 456.899 411.816 467.803]
-/A << /S /GoTo /D (page.418) >>
->> endobj
-19248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.086 444.943 458.022 455.847]
-/A << /S /GoTo /D (page.423) >>
->> endobj
-19249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 432.988 438.386 443.892]
-/A << /S /GoTo /D (page.419) >>
->> endobj
-19250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 421.033 451.108 431.937]
-/A << /S /GoTo /D (page.420) >>
->> endobj
-19251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 409.795 428.932 419.982]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-19252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 397.84 429.539 408.027]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-19253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.936 385.168 457.872 396.071]
-/A << /S /GoTo /D (page.422) >>
->> endobj
-19254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [429.21 373.212 446.147 384.116]
-/A << /S /GoTo /D (page.423) >>
->> endobj
-19255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.302 361.257 424.239 372.161]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-19256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 350.019 387.726 360.206]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-19257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 338.064 380.533 348.251]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-19258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.408 325.392 417.345 336.296]
-/A << /S /GoTo /D (page.417) >>
->> endobj
-19259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.428 313.437 473.365 324.34]
-/A << /S /GoTo /D (page.421) >>
->> endobj
-19260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [476.353 313.437 493.29 324.34]
-/A << /S /GoTo /D (page.422) >>
->> endobj
-19261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.084 301.481 458.002 312.385]
-/A << /S /GoTo /D (page.429d) >>
->> endobj
-19262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.617 289.526 449.554 300.43]
-/A << /S /GoTo /D (page.426) >>
->> endobj
-19263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.013 277.571 455.949 288.475]
-/A << /S /GoTo /D (page.427) >>
->> endobj
-19264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 265.616 440.856 276.52]
-/A << /S /GoTo /D (page.426) >>
->> endobj
-19265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.073 253.661 387.009 264.565]
-/A << /S /GoTo /D (page.411) >>
->> endobj
-19266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.056 241.706 449.992 252.609]
-/A << /S /GoTo /D (page.418) >>
->> endobj
-19267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.981 241.706 469.917 252.609]
-/A << /S /GoTo /D (page.419) >>
->> endobj
-19268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.778 229.75 462.714 240.654]
-/A << /S /GoTo /D (page.419) >>
->> endobj
-19269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.703 229.75 482.639 240.654]
-/A << /S /GoTo /D (page.420) >>
->> endobj
-19270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.444 218.512 389.38 228.699]
-/A << /S /GoTo /D (page.427) >>
->> endobj
-19271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.764 205.84 423.701 216.744]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.264 193.885 413.2 204.789]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-19273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.45 181.93 456.368 192.834]
-/A << /S /GoTo /D (page.429d) >>
->> endobj
-19274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.151 169.975 491.087 180.878]
-/A << /S /GoTo /D (page.424) >>
->> endobj
-19275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.026 158.019 441.962 168.923]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-19276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 146.781 386.62 156.968]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-19277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.609 146.781 406.545 156.968]
-/A << /S /GoTo /D (page.410) >>
->> endobj
-19278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.03 134.826 384.966 145.013]
-/A << /S /GoTo /D (page.410) >>
->> endobj
-19279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.955 134.826 404.892 145.013]
-/A << /S /GoTo /D (page.411) >>
->> endobj
-19280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.667 122.154 422.585 133.058]
-/A << /S /GoTo /D (page.405d) >>
->> endobj
-19281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 110.199 396.021 121.103]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-19282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.01 110.199 415.946 121.103]
-/A << /S /GoTo /D (page.431) >>
->> endobj
-19283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 98.244 391.761 109.147]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-19284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.75 98.244 411.686 109.147]
-/A << /S /GoTo /D (page.430) >>
->> endobj
-19285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.295 86.288 455.232 97.192]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-19286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.221 86.288 475.157 97.192]
-/A << /S /GoTo /D (page.430) >>
->> endobj
-19287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [461.837 74.333 478.774 85.237]
-/A << /S /GoTo /D (page.427) >>
->> endobj
-19289 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19293 0 obj <<
-/D [19291 0 R /XYZ 89 770.89 null]
->> endobj
-19290 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F24 529 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19407 0 obj <<
-/Length 1664      
-/Filter /FlateDecode
->>
-stream
-xڽZm��6��_���31'�i�!�$M��n������ �jx
�\.���;���_
�hw�zvW0�0^̞^�.�{��M�Z�q�100<���B�f�|����ac`b �W��o.��-_̞]�>��s`��kdz�ij�����W0m��U��p,[\#�j��


�#A �2<M�^s� +a䖗;��6߳$`�*Ij�m#��3�fi!0w��4�;?K��R���-ʜ���ڣ`G��v�F<a4'�4������/�&[$�%O��

�O�n��/���8]@4�$�����h�H�c�B4�-4��3�<�"��#��'[9�%�
}.	-
-�M���˜etW!
�*�R˧��s�i�
<�6T*R
-��mY�zZ�R�����1�
t�}g�p�u�O¾�<��
�=��D�ۜf#���5�8�J�E�U��X�S�s��=~�{P�m�Ј\�h�$��s0�"�M����c��$�`�u�C��
��
>4���3E�<4���K躦�y���q˞K�>����VȲ��%#ϣT0���U*B²��_��g������6����Fu
�_��VG��,І�
��+r�.�"o�P)9�掫�\��*O��u����x�X�
�I���`�D� ~��P�?����iLJcV
-z#�Z`�u����i��
-�e%Y�-��Y͓� ����L��𢉃�
-N�e�wЗm��{�@�L�Z��fK�7]l�Q��lT�Ѿ�c1��3�=�=tR�Y.&RE�C?�
0u�9�'A5�]<��̫F�^��+$lY"]��`��Mu���r��O

U�gO_�m�R��c��a�녍D1´F�겫� �3�Vk.�@�X�A�gԀ��[J^�?���T'�Ud1V��)�j������R�*�
-6"��_��F�"}��}�B��⦬�VE�si����Q}�
< )(Z�jX�5��pq�rF�}h�Y ��N��Ez�ԍSэd�f1��t�����'��lꇩ�LU�-�
!�3
���H�]�M�Ƅ��ֹ�Π��q�,J��ZLW]AW���~�������> �Z[�pSȫް\�Ǿ:�=�^�h�W.����M��C�Tf2���q�hp���x�g,cL�hG
�A���4����U���Ϡ��
y�\��f�D��i6ܹԳ+��e��&�P̓~0����	n��_��+%��Ux�d(\��	�;q���eP���w���W���K�y��4.5|�H�(
�-�0��M���!K��8E;7
-��q-B�,`"U�5K��uO}�>ZT2_Z���t�6�N��9lY�W04��
1�
�+Ż*핑���u�T������n���
��	�&�
1-'
64�D ���D at S�fY���E�>��z=�
�����+��=b1*Y�
��E#����/� �
�&\}Q9�4@��Uؽ��Tظ?n�
-[�Y�"�Hʁ
v�������Yv�#dG:��pu���
� z�U�<��^
�i
\��m�2`pK��| <
P�E�p�ñG�sӦ>:�cu�Y�^�7,�a�м���F�=���w �zp�j�z(‡x�����c��j�>܋��<����A����)�]Yf�/.��m������[�`l�~	|#
-�J�8��x"O�U3�<���V�
-endstream
-endobj
-19406 0 obj <<
-/Type /Page
-/Contents 19407 0 R
-/Resources 19405 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19294 0 R
-/Annots [ 19288 0 R 19295 0 R 19296 0 R 19297 0 R 19298 0 R 19299 0 R 19300 0 R 19301 0 R 19302 0 R 19303 0 R 19304 0 R 19305 0 R 19306 0 R 19307 0 R 19308 0 R 19309 0 R 19310 0 R 19311 0 R 19312 0 R 19313 0 R 19314 0 R 19315 0 R 19316 0 R 19317 0 R 19318 0 R 19319 0 R 19320 0 R 19321 0 R 19322 0 R 19323 0 R 19324 0 R 19325 0 R 19326 0 R 19327 0 R 19328 0 R 19329 0 R 19330 0 R 19331 0 R 19332 0 R 19333 0 R 19334 0 R 19335 0 R 19336 0 R 19337 0 R 19338 0 R 19339 0 R 19340 0 R 19341 0 R 19 [...]
->> endobj
-19288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.189 707.957 227.125 718.861]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.064 696.002 231 706.906]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.563 684.764 220.5 694.951]
-/A << /S /GoTo /D (page.413) >>
->> endobj
-19297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.438 672.809 224.375 682.996]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.135 660.136 273.072 671.04]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.04 648.899 183.977 659.085]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-19300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.966 648.899 203.902 659.085]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-19301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.404 636.226 268.34 647.13]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-19302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.968 624.271 237.904 635.175]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-19303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.745 612.316 254.681 623.22]
-/A << /S /GoTo /D (page.417) >>
->> endobj
-19304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.772 600.361 196.709 611.265]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-19305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 588.405 151.22 599.309]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-19306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 588.405 171.145 599.309]
-/A << /S /GoTo /D (page.431) >>
->> endobj
-19307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.389 576.45 208.325 587.354]
-/A << /S /GoTo /D (page.421) >>
->> endobj
-19308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.396 565.212 177.332 575.399]
-/A << /S /GoTo /D (page.415) >>
->> endobj
-19309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.321 565.212 197.257 575.399]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.371 552.54 213.307 563.444]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.292 540.585 250.228 551.489]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 528.63 180.65 539.534]
-/A << /S /GoTo /D (page.421) >>
->> endobj
-19313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 506.657 145.791 515.623]
-/A << /S /GoTo /D (page.396) >>
->> endobj
-19314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 469.571 165.148 479.758]
-/A << /S /GoTo /D (page.433) >>
->> endobj
-19315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 456.899 151.22 467.803]
-/A << /S /GoTo /D (page.433) >>
->> endobj
-19316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.943 444.943 302.88 455.847]
-/A << /S /GoTo /D (page.463) >>
->> endobj
-19317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.208 432.988 275.144 443.892]
-/A << /S /GoTo /D (page.464) >>
->> endobj
-19318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 421.75 189.506 431.937]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 409.795 193.382 419.982]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.267 397.84 150.204 408.027]
-/A << /S /GoTo /D (page.474) >>
->> endobj
-19321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.348 385.885 235.284 396.071]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-19322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.242 373.93 234.178 384.116]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-19323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.105 361.257 252.041 372.161]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.386 350.019 182.323 360.206]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 337.347 179.539 348.251]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.178 325.392 211.115 336.296]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.05 314.154 183.987 324.34]
-/A << /S /GoTo /D (page.473) >>
->> endobj
-19328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.976 314.154 203.912 324.34]
-/A << /S /GoTo /D (page.474) >>
->> endobj
-19329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.82 301.481 186.756 312.385]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.019 290.243 162.956 300.43]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.792 278.288 151.728 288.475]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 265.616 151.22 276.52]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.3 253.661 301.236 264.565]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.809 241.706 181.745 252.609]
-/A << /S /GoTo /D (page.479) >>
->> endobj
-19335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.696 229.75 203.633 240.654]
-/A << /S /GoTo /D (page.478) >>
->> endobj
-19336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.561 217.795 194.497 228.699]
-/A << /S /GoTo /D (page.479) >>
->> endobj
-19337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.908 205.84 285.844 216.744]
-/A << /S /GoTo /D (page.479) >>
->> endobj
-19338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.264 193.885 212.201 204.789]
-/A << /S /GoTo /D (page.484) >>
->> endobj
-19339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.078 182.647 174.014 192.834]
-/A << /S /GoTo /D (page.482) >>
->> endobj
-19340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 169.975 179.539 180.878]
-/A << /S /GoTo /D (page.484) >>
->> endobj
-19341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [132.729 158.019 149.666 168.923]
-/A << /S /GoTo /D (page.482) >>
->> endobj
-19342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.645 146.064 169.581 156.968]
-/A << /S /GoTo /D (page.483) >>
->> endobj
-19343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.792 134.826 151.728 145.013]
-/A << /S /GoTo /D (page.483) >>
->> endobj
-19344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.224 122.154 191.16 133.058]
-/A << /S /GoTo /D (page.483) >>
->> endobj
-19345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.195 98.244 196.132 109.147]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.071 86.288 200.007 97.192]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-19347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 75.05 189.506 85.237]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.926 708.674 409.863 718.861]
-/A << /S /GoTo /D (page.450) >>
->> endobj
-19349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.127 696.002 455.063 706.906]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-19350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.501 684.047 448.438 694.951]
-/A << /S /GoTo /D (page.450) >>
->> endobj
-19351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 672.092 399.093 682.996]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-19352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 660.136 411.816 671.04]
-/A << /S /GoTo /D (page.453) >>
->> endobj
-19353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 648.181 438.386 659.085]
-/A << /S /GoTo /D (page.454) >>
->> endobj
-19354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 636.226 451.108 647.13]
-/A << /S /GoTo /D (page.455) >>
->> endobj
-19355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 624.988 428.932 635.175]
-/A << /S /GoTo /D (page.445) >>
->> endobj
-19356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 613.033 429.539 623.22]
-/A << /S /GoTo /D (page.446) >>
->> endobj
-19357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.302 600.361 424.239 611.265]
-/A << /S /GoTo /D (page.457) >>
->> endobj
-19358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 589.123 387.726 599.309]
-/A << /S /GoTo /D (page.445) >>
->> endobj
-19359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 577.168 380.533 587.354]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.408 564.495 417.345 575.399]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-19361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.617 552.54 449.554 563.444]
-/A << /S /GoTo /D (page.458) >>
->> endobj
-19362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 540.585 440.856 551.489]
-/A << /S /GoTo /D (page.459) >>
->> endobj
-19363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.056 528.63 449.992 539.534]
-/A << /S /GoTo /D (page.453) >>
->> endobj
-19364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.981 528.63 469.917 539.534]
-/A << /S /GoTo /D (page.454) >>
->> endobj
-19365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.778 516.674 462.714 527.578]
-/A << /S /GoTo /D (page.453) >>
->> endobj
-19366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.703 516.674 482.639 527.578]
-/A << /S /GoTo /D (page.454) >>
->> endobj
-19367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.444 505.437 389.38 515.623]
-/A << /S /GoTo /D (page.459) >>
->> endobj
-19368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.764 492.764 423.701 503.668]
-/A << /S /GoTo /D (page.451) >>
->> endobj
-19369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.264 480.809 413.2 491.713]
-/A << /S /GoTo /D (page.445) >>
->> endobj
-19370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.026 468.854 441.962 479.758]
-/A << /S /GoTo /D (page.458) >>
->> endobj
-19371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 457.616 386.62 467.803]
-/A << /S /GoTo /D (page.446) >>
->> endobj
-19372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.03 445.661 384.966 455.847]
-/A << /S /GoTo /D (page.447) >>
->> endobj
-19373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 432.988 396.021 443.892]
-/A << /S /GoTo /D (page.459) >>
->> endobj
-19374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.01 432.988 415.946 443.892]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-19375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 421.033 391.761 431.937]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-19376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [426.67 409.078 443.606 419.982]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-19377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.545 397.123 447.482 408.027]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-19378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.044 385.885 436.981 396.071]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 373.93 440.856 384.116]
-/A << /S /GoTo /D (page.450) >>
->> endobj
-19380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.449 361.257 454.386 372.161]
-/A << /S /GoTo /D (page.457) >>
->> endobj
-19381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.254 349.302 413.19 360.206]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.765 337.347 367.702 348.251]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-19383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.87 325.392 424.806 336.296]
-/A << /S /GoTo /D (page.455) >>
->> endobj
-19384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.877 314.154 393.813 324.34]
-/A << /S /GoTo /D (page.451) >>
->> endobj
-19385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.852 301.481 429.788 312.385]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-19386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.36 289.526 414.296 300.43]
-/A << /S /GoTo /D (page.455) >>
->> endobj
-19387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [401.513 266.333 418.449 276.52]
-/A << /S /GoTo /D (page.434) >>
->> endobj
-19388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.676 241.706 412.613 252.609]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-19389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.552 229.75 416.488 240.654]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-19390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.051 218.512 405.987 228.699]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.926 206.557 409.863 216.744]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.31 193.885 398.247 204.789]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 181.93 399.093 192.834]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-19394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 169.975 411.816 180.878]
-/A << /S /GoTo /D (page.502) >>
->> endobj
-19395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.939 158.019 435.875 168.923]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-19396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.023 146.064 463.96 156.968]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-19397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.229 134.109 449.165 145.013]
-/A << /S /GoTo /D (page.506) >>
->> endobj
-19398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 122.154 438.386 133.058]
-/A << /S /GoTo /D (page.504) >>
->> endobj
-19399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 110.199 451.108 121.103]
-/A << /S /GoTo /D (page.504) >>
->> endobj
-19400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 98.961 428.932 109.147]
-/A << /S /GoTo /D (page.494) >>
->> endobj
-19401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 87.006 429.539 97.192]
-/A << /S /GoTo /D (page.494) >>
->> endobj
-19402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.86 75.05 424.797 85.237]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-19404 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19408 0 obj <<
-/D [19406 0 R /XYZ 89 770.89 null]
->> endobj
-19405 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19528 0 obj <<
-/Length 1578      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�6~ׯ�S*�T4��3I�8���MܙN�
!�)/Td���
��	��;}�DQԷ���
`l
`\L^\M�^9�pM׆�q�6\`8�5�-�����ͯ/���}�zk`�0�������oOί&7K��U�����XE�������0��0��C��!����q��
2b�F, �!1
�2-���J��X,_
"��?<��������ĸ�C���%�6�x.!��"�4���H�i�8�0~��A2]3����㘕}���H"��I�q�f�n��D~JxЄ��e�ZdA�6���e�A�b$�vKo���A�����ܰ�q�0ߣ�r> c��0%8�-;4���3=�T��P2
�h�y�$W����q�m۝v؄f7;����R��L��D�˝�
�ʤ���t5��&(���y�^� fT:,�Y��8��	Ѵ��8�ڍ�mI�T.�����
�n��|�q��Vj7�F�,"+˼�$��}n]��C�w�rV��>�r��7|��	%� [...]
6[�n���DF�gDi�=�M.�n���	�"�Y�cF���~f�)M��{����>���'m'��Zw����Fݷ4k!����zˠ�
ZU���2g
[��*+�f�̍����m�ϩ�>Xr��>=>sгWr+p�GX`��-ɳ��6�5m
�.?΋���"؄�i�t~u�6m�� ?
��^���x�Js��ƽd#��g�>T��$�Sb���6�TV�Y !�r��옌-b��)b��
/L�E0�t��e�5���C�ZL=y�{�\@����P3�����f��

5#-{�P3C��-uIߦu��}�������S���Aӫ	�.-�`b����j��1�Ɛg��~�V!많f8hвM���-
߆�a�#
-�=���ů�7�X�d�
-
C��
Oy򅭲��5�-�u�#��"����v�Pw�����5j��Ы-1�T�2�ž4�
-�ڱ��5�6w�Q!M*�
w8	K�� U.�k�T[�.�.6��pok�.YX�	�b�CG	
-W�
%�V��!~0G~��aP7o3/K���	ϙ�i�c2
-��p�|N�g �o��ۧ�30
�����&� �D�4�ǜ���Z�y��ȣr��[V
�2���0$�
�G�د̎ ��G����Xk���*h
� <��E�"� 
-�G/&j*�XLD�nwT<�̍0R at j͍tƘ}�vq����݉yz����ۓigֲ'��Q��pxLS�a���˭��wbI�&٠3Hx�
��]�u�<��O�7.[�E�Ŀ�¢ra˼\]e���f'Fށ��v�b��do\Ͷ�@���
���,
jh���w&�a��0/��1�
-�祭�T�����t �=^W�[Ȅa��|vL"�/ؾڲYA���}y�`��!SQ~�������O���4��Yy�2��o��9�5�Gƪu�L�m�W��䀕|G��pn�e�ӳ��n#X�1WI�H{
�	��a�t���HƲ�*�s)�ڬ*�r$�2m֒�¼� X��'���?V7��D�x�H;��/���
-endstream
-endobj
-19527 0 obj <<
-/Type /Page
-/Contents 19528 0 R
-/Resources 19526 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19294 0 R
-/Annots [ 19403 0 R 19409 0 R 19410 0 R 19411 0 R 19412 0 R 19413 0 R 19414 0 R 19415 0 R 19416 0 R 19417 0 R 19418 0 R 19419 0 R 19420 0 R 19421 0 R 19422 0 R 19423 0 R 19424 0 R 19425 0 R 19426 0 R 19427 0 R 19428 0 R 19429 0 R 19430 0 R 19431 0 R 19432 0 R 19433 0 R 19434 0 R 19435 0 R 19436 0 R 19437 0 R 19438 0 R 19439 0 R 19440 0 R 19441 0 R 19442 0 R 19443 0 R 19444 0 R 19445 0 R 19446 0 R 19447 0 R 19448 0 R 19449 0 R 19450 0 R 19451 0 R 19452 0 R 19453 0 R 19454 0 R 19455 0 R 19 [...]
->> endobj
-19403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.821 707.957 207.757 718.861]
-/A << /S /GoTo /D (page.506) >>
->> endobj
-19409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.308 696.719 171.245 706.906]
-/A << /S /GoTo /D (page.493) >>
->> endobj
-19410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.115 684.764 164.052 694.951]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-19411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.927 672.092 200.863 682.996]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-19412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.947 660.136 256.883 671.04]
-/A << /S /GoTo /D (page.500) >>
->> endobj
-19413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.872 660.136 276.809 671.04]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-19414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.136 648.181 233.073 659.085]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-19415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.439 636.226 224.375 647.13]
-/A << /S /GoTo /D (page.508) >>
->> endobj
-19416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.574 624.271 233.511 635.175]
-/A << /S /GoTo /D (page.502) >>
->> endobj
-19417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.499 624.271 253.436 635.175]
-/A << /S /GoTo /D (page.503) >>
->> endobj
-19418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.296 612.316 246.233 623.22]
-/A << /S /GoTo /D (page.503) >>
->> endobj
-19419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.379 600.361 216.315 611.265]
-/A << /S /GoTo /D (page.496) >>
->> endobj
-19420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [199.13 588.405 216.066 599.309]
-/A << /S /GoTo /D (page.496) >>
->> endobj
-19421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.962 577.168 172.899 587.354]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-19422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.283 564.495 207.219 575.399]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-19423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.782 552.54 196.719 563.444]
-/A << /S /GoTo /D (page.493) >>
->> endobj
-19424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.339 540.585 192.276 551.489]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-19425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.544 528.63 225.481 539.534]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-19426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.202 517.392 170.139 527.578]
-/A << /S /GoTo /D (page.494) >>
->> endobj
-19427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.128 517.392 190.064 527.578]
-/A << /S /GoTo /D (page.495) >>
->> endobj
-19428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.549 505.437 168.485 515.623]
-/A << /S /GoTo /D (page.495) >>
->> endobj
-19429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.195 492.764 196.131 503.668]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-19430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.274 481.526 209.192 491.713]
-/A << /S /GoTo /D (page.490d) >>
->> endobj
-19431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.189 468.854 227.125 479.758]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-19432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.064 456.899 231 467.803]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-19433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.563 445.661 220.5 455.847]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.438 433.706 224.375 443.892]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.04 421.75 183.977 431.937]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-19436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.404 409.078 268.34 419.982]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-19437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.968 397.123 237.904 408.027]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-19438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.745 385.168 254.681 396.071]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-19439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.772 373.212 196.709 384.116]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-19440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 361.257 151.22 372.161]
-/A << /S /GoTo /D (page.508) >>
->> endobj
-19441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 361.257 171.145 372.161]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-19442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.389 349.302 208.325 360.206]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-19443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.396 338.064 177.332 348.251]
-/A << /S /GoTo /D (page.500) >>
->> endobj
-19444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.56 326.109 189.496 336.296]
-/A << /S /GoTo /D (page.508) >>
->> endobj
-19445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 313.437 180.65 324.34]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-19446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.249 290.243 173.186 300.43]
-/A << /S /GoTo /D (page.484) >>
->> endobj
-19447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.194 277.571 300.13 288.475]
-/A << /S /GoTo /D (page.510) >>
->> endobj
-19448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 265.616 179.539 276.52]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-19449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.224 253.661 167.16 264.565]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-19450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 241.706 175.28 252.609]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-19451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.607 229.75 179.544 240.654]
-/A << /S /GoTo /D (page.511) >>
->> endobj
-19452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.184 217.795 300.12 228.699]
-/A << /S /GoTo /D (page.512) >>
->> endobj
-19453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 205.84 179.539 216.744]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-19454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.224 193.885 167.16 204.789]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-19455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 181.93 175.28 192.834]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-19456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.607 169.975 179.544 180.878]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-19457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.005 158.019 267.941 168.923]
-/A << /S /GoTo /D (page.513) >>
->> endobj
-19458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.195 146.064 196.132 156.968]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-19459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.071 134.109 200.007 145.013]
-/A << /S /GoTo /D (page.531) >>
->> endobj
-19460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 122.871 189.506 133.058]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-19461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 110.916 193.382 121.103]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-19462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.896 98.244 187.833 109.147]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-19463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.772 86.288 191.708 97.192]
-/A << /S /GoTo /D (page.531) >>
->> endobj
-19464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.646 74.333 238.582 85.237]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.501 707.957 448.438 718.861]
-/A << /S /GoTo /D (page.530) >>
->> endobj
-19466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [429.828 696.002 446.764 706.906]
-/A << /S /GoTo /D (page.531) >>
->> endobj
-19467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.165 684.047 490.101 694.951]
-/A << /S /GoTo /D (page.542) >>
->> endobj
-19468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.271 672.092 491.207 682.996]
-/A << /S /GoTo /D (page.542) >>
->> endobj
-19469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.505 660.136 423.442 671.04]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-19470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 648.181 399.093 659.085]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-19471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 636.226 411.816 647.13]
-/A << /S /GoTo /D (page.536) >>
->> endobj
-19472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.874 624.271 455.81 635.175]
-/A << /S /GoTo /D (page.540) >>
->> endobj
-19473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.509 612.316 510.445 623.22]
-/A << /S /GoTo /D (page.540) >>
->> endobj
-19474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.132 600.361 491.068 611.265]
-/A << /S /GoTo /D (page.541) >>
->> endobj
-19475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 588.405 438.386 599.309]
-/A << /S /GoTo /D (page.538) >>
->> endobj
-19476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 576.45 451.108 587.354]
-/A << /S /GoTo /D (page.538) >>
->> endobj
-19477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 565.212 428.932 575.399]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-19478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 553.257 429.539 563.444]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-19479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.302 540.585 424.239 551.489]
-/A << /S /GoTo /D (page.542) >>
->> endobj
-19480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 529.347 387.726 539.534]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-19481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 517.392 380.533 527.578]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-19482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.393 504.719 469.33 515.623]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-19483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.269 492.764 473.205 503.668]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-19484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.428 480.809 473.365 491.713]
-/A << /S /GoTo /D (page.539) >>
->> endobj
-19485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [476.353 480.809 493.29 491.713]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-19486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.617 468.854 449.554 479.758]
-/A << /S /GoTo /D (page.544) >>
->> endobj
-19487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 456.899 440.856 467.803]
-/A << /S /GoTo /D (page.544) >>
->> endobj
-19488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.073 444.943 387.009 455.847]
-/A << /S /GoTo /D (page.528) >>
->> endobj
-19489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.056 432.988 449.992 443.892]
-/A << /S /GoTo /D (page.536) >>
->> endobj
-19490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.981 432.988 469.917 443.892]
-/A << /S /GoTo /D (page.537) >>
->> endobj
-19491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.778 421.033 462.714 431.937]
-/A << /S /GoTo /D (page.536) >>
->> endobj
-19492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.703 421.033 482.639 431.937]
-/A << /S /GoTo /D (page.537) >>
->> endobj
-19493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 399.18 362.272 408.027]
-/A << /S /GoTo /D (page.533) >>
->> endobj
-19494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.497 385.168 436.433 396.071]
-/A << /S /GoTo /D (page.541) >>
->> endobj
-19495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.444 373.93 389.38 384.116]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-19496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.764 361.257 423.701 372.161]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.264 349.302 413.2 360.206]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-19498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.431 337.347 504.367 348.251]
-/A << /S /GoTo /D (page.540) >>
->> endobj
-19499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.054 325.392 484.99 336.296]
-/A << /S /GoTo /D (page.541) >>
->> endobj
-19500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.497 313.437 380.434 324.34]
-/A << /S /GoTo /D (page.544) >>
->> endobj
-19501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.026 301.481 441.962 312.385]
-/A << /S /GoTo /D (page.543) >>
->> endobj
-19502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 290.243 386.62 300.43]
-/A << /S /GoTo /D (page.527) >>
->> endobj
-19503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.03 278.288 384.966 288.475]
-/A << /S /GoTo /D (page.527) >>
->> endobj
-19504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.955 278.288 404.892 288.475]
-/A << /S /GoTo /D (page.528) >>
->> endobj
-19505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.778 266.333 361.714 276.52]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-19506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.084 253.661 396.021 264.565]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-19507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.824 241.706 391.761 252.609]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-19508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.614 229.75 466.55 240.654]
-/A << /S /GoTo /D (page.545) >>
->> endobj
-19509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.103 217.795 440.039 228.699]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-19510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.476 205.84 415.412 216.744]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.329 193.885 393.266 204.789]
-/A << /S /GoTo /D (page.524) >>
->> endobj
-19512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.254 193.885 413.191 204.789]
-/A << /S /GoTo /D (page.525) >>
->> endobj
-19513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [461.837 181.93 478.774 192.834]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [426.67 169.975 443.606 180.878]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.545 158.019 447.482 168.923]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.044 146.781 436.981 156.968]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 134.826 440.856 145.013]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.617 122.154 489.553 133.058]
-/A << /S /GoTo /D (page.533) >>
->> endobj
-19519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.522 110.916 400.458 121.103]
-/A << /S /GoTo /D (page.525) >>
->> endobj
-19520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.447 110.916 420.383 121.103]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-19521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [467.885 98.244 484.821 109.147]
-/A << /S /GoTo /D (page.543) >>
->> endobj
-19522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.449 86.288 454.386 97.192]
-/A << /S /GoTo /D (page.543) >>
->> endobj
-19523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.226 74.333 471.162 85.237]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-19525 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19529 0 obj <<
-/D [19527 0 R /XYZ 89 770.89 null]
->> endobj
-19526 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19605 0 obj <<
-/Length 1694      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~ׯ��$Z�
��'�Lb)
���Jrӎ����Z��f at q�_��l��y�v�����U�(�r�{��
}04�ADY^+���0����e[����Y*�T�we�'�����Fo�����������z��Ue�/TT�Y�r�-�
i��U��z�C D} ��7Š!�0�'��J�;�
-��v��u!�
m� �=�r������/ȹ�!'ga��w;�j����L�߸èe�8
�̵ØQ;����DP3k	�|��
��FJz5���o#;��$hws������ȳ�,p�l
��̹�����x
�߲(fI�fU�����O��$	<�v⿹�	
#��KJ�ш�w��	���&e��*�UN�";	�&}��
K�n\9^֕��VA�K
}�Qr>����p}�&_R�0
t
��%�P4AS�	��	"��}ۖ����v�['��0��.�
4�f���Jo�4��B�+��;-+^�3<&H�k���W{�����`<��8��%�<RH���
-" �^,����x���i1K�����B��*�}�r���Y�z�[�2[l��Y��
C�E�{2y�Q�.��7��NPQ�&B&'kչ����Y��|=��PU��D/�$����t�F%�
oDS=�%����z��x�Maj�T�!�Є(���!��T�5J�	A ��;�:�y��I꺳��:��6q��\�gv���l4�eJ˳��˴
�5�409�d�eQ�pgW�&8D�r��>�B����

˖U��|�����\���׮L�W.k�Rm�b>���\OI`�rQ�DOϫN���֐�
`S��e�;� ��Me�G���X*�1��B�B%� ���#ce�]e����H����]<���������s�����D%'�lRk ��r�sd���1��Ў��r[u��G�
�3`bX&)������O���)ɋ�?�
��W�9X�k����b�u���?���6m�U�s��.?�g�$[��?�c����U$����d_0kD��$���@� �)��A��!g��K�a�
��͒��&�tq'̫�T	JCШ1�iH 8e�TρL���RR�e��AVj%�F�)�ÜWH�)���t��>2�6#�t�	�wT��u�¥��,�ՓS��
*I���[�Zs�y��N�\�(��|@�x~��3�p�t�o�s��J� �4����a�

�{�N[pҬZr
�u�zi8�-�
#¨sƚMf4?U3F���5 �M$
�Ɓ�+���"��w.^S�5�4����1[kJ����T�c�
J|?o�K��(��s��I�0i
�(Qz��I.9���P}���z�d;*��q�*%�0qmJ-X.���=S���!p�d�>��t�Ũ;��ۡz*�z�d���o�5���aI(g~~1
�����hN^�ʟo���fgoX�o�',����
M��tz>� `��K:
�G��7�KZ,瓓%����-'������Wd�1sK������Xi��^A�@��{A6f��셢��
-Th(���wv�س�p4�4epb�䆜��`�֑	,B��y:t�&�ro��������4����������R����eC�<?�_�`0Ը��PU���_�ױ�C<X
�l�$<>:��mb�o�*�J:��,����u�`� �
����g���������
-endstream
-endobj
-19604 0 obj <<
-/Type /Page
-/Contents 19605 0 R
-/Resources 19603 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19294 0 R
-/Annots [ 19524 0 R 19531 0 R 19532 0 R 19533 0 R 19534 0 R 19535 0 R 19536 0 R 19537 0 R 19538 0 R 19539 0 R 19540 0 R 19541 0 R 19542 0 R 19543 0 R 19544 0 R 19545 0 R 19546 0 R 19547 0 R 19548 0 R 19549 0 R 19550 0 R 19551 0 R 19552 0 R 19553 0 R 19554 0 R 19555 0 R 19556 0 R 19557 0 R 19558 0 R 19559 0 R 19560 0 R 19561 0 R 19562 0 R 19563 0 R 19564 0 R 19565 0 R 19566 0 R 19567 0 R 19568 0 R 19569 0 R 19570 0 R 19571 0 R 19572 0 R 19573 0 R 19574 0 R 19575 0 R 19576 0 R 19577 0 R 19 [...]
->> endobj
-19524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.772 707.957 196.709 718.861]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-19531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 696.002 151.22 706.906]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-19532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.209 696.002 171.145 706.906]
-/A << /S /GoTo /D (page.547) >>
->> endobj
-19533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.389 684.047 208.325 694.951]
-/A << /S /GoTo /D (page.538) >>
->> endobj
-19534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.396 672.809 177.332 682.996]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 660.136 180.65 671.04]
-/A << /S /GoTo /D (page.539) >>
->> endobj
-19536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 626.328 145.791 635.175]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.682 613.033 159.618 623.22]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.803 600.361 188.739 611.265]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 588.405 179.539 599.309]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-19540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.343 576.45 175.28 587.354]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-19541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.669 564.495 221.605 575.399]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-19542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.087 552.54 169.023 563.444]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 540.585 151.22 551.489]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-19544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.371 528.63 213.307 539.534]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.292 516.674 250.228 527.578]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.013 504.719 285.949 515.623]
-/A << /S /GoTo /D (page.547) >>
->> endobj
-19547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.02 492.764 279.956 503.668]
-/A << /S /GoTo /D (page.554) >>
->> endobj
-19548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.878 468.854 192.814 479.758]
-/A << /S /GoTo /D (page.555) >>
->> endobj
-19549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.405 445.661 190.341 455.847]
-/A << /S /GoTo /D (page.554) >>
->> endobj
-19550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.878 421.033 192.814 431.937]
-/A << /S /GoTo /D (page.555) >>
->> endobj
-19551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.249 397.84 173.186 408.027]
-/A << /S /GoTo /D (page.555) >>
->> endobj
-19552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 373.93 165.148 384.116]
-/A << /S /GoTo /D (page.558) >>
->> endobj
-19553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 361.257 151.22 372.161]
-/A << /S /GoTo /D (page.559) >>
->> endobj
-19554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.584 338.064 158.521 348.251]
-/A << /S /GoTo /D (page.559) >>
->> endobj
-19555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.877 325.392 264.813 336.296]
-/A << /S /GoTo /D (page.559) >>
->> endobj
-19556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.352 313.437 287.289 324.34]
-/A << /S /GoTo /D (page.561) >>
->> endobj
-19557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.101 289.526 186.037 300.43]
-/A << /S /GoTo /D (page.561) >>
->> endobj
-19558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.262 277.571 255.199 288.475]
-/A << /S /GoTo /D (page.561) >>
->> endobj
-19559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 266.333 145.79 276.52]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 253.661 179.539 264.565]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.532 241.706 199.469 252.609]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 229.75 151.22 240.654]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.105 218.512 164.042 228.699]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.324 205.84 297.261 216.744]
-/A << /S /GoTo /D (page.195) >>
->> endobj
-19565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.211 170.692 165.148 180.878]
-/A << /S /GoTo /D (page.566) >>
->> endobj
-19566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 158.019 151.22 168.923]
-/A << /S /GoTo /D (page.566) >>
->> endobj
-19567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.851 146.064 276.788 156.968]
-/A << /S /GoTo /D (page.567) >>
->> endobj
-19568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.603 134.109 179.539 145.013]
-/A << /S /GoTo /D (page.568) >>
->> endobj
-19569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.694 122.871 185.631 133.058]
-/A << /S /GoTo /D (page.568) >>
->> endobj
-19570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.217 110.199 262.153 121.103]
-/A << /S /GoTo /D (page.568) >>
->> endobj
-19571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 75.05 191.728 85.237]
-/A << /S /GoTo /D (page.441d) >>
->> endobj
-19572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 686.072 362.272 694.918]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-19573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 672.027 498.241 682.931]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-19574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 650.142 362.272 658.988]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.826 624.109 497.763 635.013]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-19576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.273 624.109 517.21 635.013]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-19577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 614.211 362.272 623.058]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-19578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 578.162 367.253 587.128]
-/A << /S /GoTo /D (page.490d) >>
->> endobj
-19579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 552.249 504.348 563.153]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-19580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 528.274 504.348 539.178]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [498.56 504.299 515.496 515.203]
-/A << /S /GoTo /D (page.173) >>
->> endobj
-19582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.946 492.312 529.882 503.216]
-/A << /S /GoTo /D (page.395) >>
->> endobj
-19583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [486.933 468.337 503.87 479.241]
-/A << /S /GoTo /D (page.524) >>
->> endobj
-19584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [506.38 468.337 523.317 479.241]
-/A << /S /GoTo /D (page.525) >>
->> endobj
-19585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.836 444.362 521.772 455.266]
-/A << /S /GoTo /D (page.482) >>
->> endobj
-19586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 420.387 511.551 431.291]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.836 396.412 521.772 407.316]
-/A << /S /GoTo /D (page.483) >>
->> endobj
-19588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 362.539 362.272 371.386]
-/A << /S /GoTo /D (page.218) >>
->> endobj
-19589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 338.477 362.272 347.443]
-/A << /S /GoTo /D (page.249) >>
->> endobj
-19590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [499.107 324.552 516.044 335.456]
-/A << /S /GoTo /D (page.396) >>
->> endobj
-19591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.273 301.326 408.209 311.513]
-/A << /S /GoTo /D (page.555) >>
->> endobj
-19592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.503 288.621 530.44 299.525]
-/A << /S /GoTo /D (page.555) >>
->> endobj
-19593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 264.647 475.018 275.55]
-/A << /S /GoTo /D (page.152) >>
->> endobj
-19594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 240.672 475.018 251.576]
-/A << /S /GoTo /D (page.153) >>
->> endobj
-19595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 206.195 498.241 217.099]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-19596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 182.22 439.79 193.124]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 158.246 439.79 169.149]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 134.271 439.79 145.175]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-19599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 110.296 439.79 121.2]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-19600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 86.321 439.79 97.225]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19602 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19606 0 obj <<
-/D [19604 0 R /XYZ 89 770.89 null]
->> endobj
-19603 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F11 613 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19690 0 obj <<
-/Length 1194      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�Ҥ�� �G���IT۝錓�@"Lq�������[-+�H���L�"�X/.�9X!� 罣����E�c8
3ps
,�1(�_.��_|>9�{���#0�m@�t�<�:(����
zH�B���԰l0	{�� pu�G 
���1����ޟ=�h�
� �Ø
!���� ѾP��8�O�����J�����TN��K���c�~�
,,S^i��y�1�}�2Ca����
J�v�i�/�Tfy��MQ��~���{Ѡ��ӯ��6FFR�4��1���f���Jبq��lV�]��t���1l��:.'�����~��h"�Hߋ6s��	���{Y3,�@ws
�Ou�3����V
L6���׆�
�-�����2I�G"�Ym���V�6��Wq$y.O�2J}l�LNԏ�9���j�'�yw��_���q�*1Iy��"��v^tcނ;UT
�t�s
��"?s���m���`�^��G?��I
yj&��v
D7C����x*߭�,jQ��XFf
,��s~%��D���]�:>R����4��>��
%2�i�5!d��.;+��2�q
"%
3�u�py�I�&u�$�Lb{��l����>SҶ��:����D6ׄ��d���}���j"��S�n���0b�ic�16���n�/
-�m�����Ew�/�j�*ϭ�b�]�|���O�oJ[�Tc{���~'
�~%��qį��8�t�����Ky3���+�C�e'�bR�a�l��Ҟ

8�t�l���"�s�j ��j�^���H�v�t��Z�Y��}��).���f(>
b]W��ܵ���^�$�W��5a�Z�/
->��h=���-҈��Owl�7E?
^g��C7���T<����]?�Q���[IZ>a���I�gyxw'�v�q�tag���Rh�nag6��"�����|:�w
Y�^&���2k�+
Y���E,!-�u�\��dKnK�-��{no�wTA��*x%3D�(�77��h#Q�o��6��F�\ų�Ջ�E�_!1lX�4}�T�>�
�1�|eZ��sn�e�E�D����������ƿ�V��
6��G�`H�o��,�/����ً,�`
-��A)��]M�����`<��y�$_8b��-�*{���1av퟇�(;��Gڨ�sU~����ڙ=h at dY8ϱ���e��EH�I�
�����G
-endstream
-endobj
-19689 0 obj <<
-/Type /Page
-/Contents 19690 0 R
-/Resources 19688 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19294 0 R
-/Annots [ 19601 0 R 19608 0 R 19609 0 R 19610 0 R 19611 0 R 19612 0 R 19613 0 R 19614 0 R 19615 0 R 19616 0 R 19617 0 R 19618 0 R 19619 0 R 19620 0 R 19621 0 R 19622 0 R 19623 0 R 19624 0 R 19625 0 R 19626 0 R 19627 0 R 19628 0 R 19629 0 R 19630 0 R 19631 0 R 19632 0 R 19633 0 R 19634 0 R 19635 0 R 19636 0 R 19637 0 R 19638 0 R 19639 0 R 19640 0 R 19641 0 R 19642 0 R 19643 0 R 19644 0 R 19645 0 R 19646 0 R 19647 0 R 19648 0 R 19649 0 R 19650 0 R 19651 0 R 19652 0 R 19653 0 R 19654 0 R 19 [...]
->> endobj
-19601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 707.957 313.839 718.861]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-19608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.627 696.002 296.564 706.906]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-19609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.345 672.092 281.281 682.996]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-19610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.792 672.092 300.728 682.996]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-19611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 662.194 145.791 671.04]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-19612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 636.226 290.078 647.13]
-/A << /S /GoTo /D (page.130d) >>
->> endobj
-19613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 624.271 258.537 635.175]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-19614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.526 624.271 278.462 635.175]
-/A << /S /GoTo /D (page.167) >>
->> endobj
-19615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.345 612.316 281.281 623.22]
-/A << /S /GoTo /D (page.282) >>
->> endobj
-19616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.792 612.316 300.728 623.22]
-/A << /S /GoTo /D (page.283) >>
->> endobj
-19617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 602.418 145.791 611.265]
-/A << /S /GoTo /D (page.285) >>
->> endobj
-19618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 588.405 311.727 599.309]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-19619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 578.508 145.791 587.354]
-/A << /S /GoTo /D (page.430) >>
->> endobj
-19620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.727 552.54 272.664 563.444]
-/A << /S /GoTo /D (page.347) >>
->> endobj
-19621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 528.63 285.097 539.534]
-/A << /S /GoTo /D (page.129) >>
->> endobj
-19622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 516.674 311.727 527.578]
-/A << /S /GoTo /D (page.427) >>
->> endobj
-19623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 504.719 287.867 515.623]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.727 480.809 272.664 491.713]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-19625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 456.899 285.097 467.803]
-/A << /S /GoTo /D (page.115) >>
->> endobj
-19626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 444.943 258.537 455.847]
-/A << /S /GoTo /D (page.152) >>
->> endobj
-19627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 432.988 260.191 443.892]
-/A << /S /GoTo /D (page.312) >>
->> endobj
-19628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 421.033 311.727 431.937]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 397.84 186.747 408.027]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-19630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 375.15 145.791 384.116]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-19631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 361.257 287.867 372.161]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 337.347 285.097 348.251]
-/A << /S /GoTo /D (page.116) >>
->> endobj
-19633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 325.392 258.537 336.296]
-/A << /S /GoTo /D (page.152) >>
->> endobj
-19634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 313.437 260.191 324.34]
-/A << /S /GoTo /D (page.312) >>
->> endobj
-19635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 301.481 311.727 312.385]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 278.288 186.747 288.475]
-/A << /S /GoTo /D (page.449) >>
->> endobj
-19637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 255.598 145.791 264.565]
-/A << /S /GoTo /D (page.499) >>
->> endobj
-19638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 241.706 287.867 252.609]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 217.795 285.097 228.699]
-/A << /S /GoTo /D (page.115) >>
->> endobj
-19640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 205.84 258.537 216.744]
-/A << /S /GoTo /D (page.151) >>
->> endobj
-19641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 193.885 260.191 204.789]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-19642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 181.93 311.727 192.834]
-/A << /S /GoTo /D (page.413) >>
->> endobj
-19643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 158.737 186.747 168.923]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 136.047 145.791 145.013]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 122.154 287.867 133.058]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 98.244 285.097 109.147]
-/A << /S /GoTo /D (page.116) >>
->> endobj
-19647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 86.288 258.537 97.192]
-/A << /S /GoTo /D (page.151) >>
->> endobj
-19648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 74.333 260.191 85.237]
-/A << /S /GoTo /D (page.313) >>
->> endobj
-19649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 707.957 528.208 718.861]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 684.764 403.228 694.951]
-/A << /S /GoTo /D (page.450) >>
->> endobj
-19651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 662.074 362.272 671.04]
-/A << /S /GoTo /D (page.498) >>
->> endobj
-19652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 648.181 504.348 659.085]
-/A << /S /GoTo /D (page.532) >>
->> endobj
-19653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 624.271 501.578 635.175]
-/A << /S /GoTo /D (page.116) >>
->> endobj
-19654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 612.316 528.208 623.22]
-/A << /S /GoTo /D (page.414) >>
->> endobj
-19655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 600.361 504.348 611.265]
-/A << /S /GoTo /D (page.533) >>
->> endobj
-19656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 576.45 439.79 587.354]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-19657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 552.54 501.578 563.444]
-/A << /S /GoTo /D (page.113) >>
->> endobj
-19658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 540.585 475.018 551.489]
-/A << /S /GoTo /D (page.146) >>
->> endobj
-19659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 528.63 528.208 539.534]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-19660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 518.612 362.272 527.578]
-/A << /S /GoTo /D (page.409) >>
->> endobj
-19661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 494.702 362.272 503.668]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-19662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [486.933 480.809 503.87 491.713]
-/A << /S /GoTo /D (page.525) >>
->> endobj
-19663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [506.38 480.809 523.317 491.713]
-/A << /S /GoTo /D (page.526) >>
->> endobj
-19664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 447.001 362.272 455.847]
-/A << /S /GoTo /D (page.268) >>
->> endobj
-19665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.897 432.988 510.834 443.892]
-/A << /S /GoTo /D (page.373) >>
->> endobj
-19666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 409.078 513.045 419.982]
-/A << /S /GoTo /D (page.292) >>
->> endobj
-19667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 385.168 501.578 396.071]
-/A << /S /GoTo /D (page.128) >>
->> endobj
-19668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 373.212 475.018 384.116]
-/A << /S /GoTo /D (page.162) >>
->> endobj
-19669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 361.257 476.672 372.161]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-19670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 349.302 528.208 360.206]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-19671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 326.109 403.228 336.296]
-/A << /S /GoTo /D (page.458) >>
->> endobj
-19672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 303.539 362.272 312.385]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-19673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 289.526 504.348 300.43]
-/A << /S /GoTo /D (page.543) >>
->> endobj
-19674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 265.616 501.578 276.52]
-/A << /S /GoTo /D (page.128) >>
->> endobj
-19675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 253.661 475.018 264.565]
-/A << /S /GoTo /D (page.162) >>
->> endobj
-19676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 241.706 499.924 252.609]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-19677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 229.75 498.241 240.654]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-19678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 217.795 476.672 228.699]
-/A << /S /GoTo /D (page.322) >>
->> endobj
-19679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 205.84 521.005 216.744]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 183.987 362.272 192.834]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 169.975 528.208 180.878]
-/A << /S /GoTo /D (page.425) >>
->> endobj
-19682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 146.781 403.228 156.968]
-/A << /S /GoTo /D (page.457) >>
->> endobj
-19683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 124.211 362.272 133.058]
-/A << /S /GoTo /D (page.507) >>
->> endobj
-19684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 110.199 504.348 121.103]
-/A << /S /GoTo /D (page.543) >>
->> endobj
-19685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 86.288 439.79 97.192]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-19687 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19691 0 obj <<
-/D [19689 0 R /XYZ 89 770.89 null]
->> endobj
-19688 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19758 0 obj <<
-/Length 1290      
-/Filter /FlateDecode
->>
-stream
-x��_w�8���ܭ�Yi�?�����Yuu�tOwN��� � �v>�&�[k��XW/�J$��x��}0@
-$ �[���o�*Y��+�4�I�
͒�ξ��MYJ���Z@� dW���U�7�z��]��,�F�aJޢu�
H>;�I�j�ҏ�G
IST�I�֗X���XA��
a9�Ӂ��҅��$z���x�R�>�Z��4�p���t�Uh[j�^'ua�{��n�Z����y������ÇN������
H�͎3Bg
ڮGj0
q
|�i��-�"�0&���I��&Ơ%��]�w�C
���	:*ϩ��䱏��
�m�/;Y����?���-��3��AqBɉH�

��yz#4=�8�pL�O��3D�]N�l�QDJ3z���Q�P�<�<c��:pv~��(��������Q�
-+�������LH@���Q�+�k{��A�4$��x�;�j�E0�c�r��Q��׏�]��p���I�V��Y
��ZT��Fg	+b��އiB���i��>�	u���J[U�f����#M,���S:^{�BH�J�~NR&��p��ln�
�"y�Q	�@�.h(-
-��%�az���Yr󓍦�钮������H�<�ל�^"!$�Z�e�
-[W��X�'���9�2�
-��gy�=/�oA
�vhr�E]���.F����J�,��qM��bآW�dI������"��#Ϲ@�Q��Y��'d}m��V�.W���w*�
�)��� �>��-w
-ES�4z�������(_ܒ:
(��p�"��$*�����z�H�0&.ŽV
S>�bY��uUߴ+�%�n�R���D�Or�9��h��*��b��G����y	3L��!�nʥj��.��d�.���j.��3C�~Q_ӿ
-Q���5kZ7�f4糗�A�9kg�-_
�1���tǍ��3ƶ%� �U�� �S;�K�t�"�ʓDys��9NF��4�>�~%����5x��ӎ�ڔ<J���6���{��?:B��L��8ԅ���~)�����#9����Z�Z{"f���l�������(s̚5|�.n�A��f5_�B�
�gE�{d��1
݈����G���*��xbb?�s�fn}���)AWdCQE7%�]�2���
w- hJѸ~\4���N��
U�JXgO�uYݧW[
L��u���`BYc1^��b:�^����ה�_:����Ѝs7*������Y�
A��P�tY��'�T��\������A�<H�RV{>�Y�<?;�̓�ā�%�g�o܌e��0W��Z�,�_|�Qϸ��U[~��� y�ܙ
-endstream
-endobj
-19757 0 obj <<
-/Type /Page
-/Contents 19758 0 R
-/Resources 19756 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19294 0 R
-/Annots [ 19686 0 R 19692 0 R 19693 0 R 19694 0 R 19695 0 R 19696 0 R 19697 0 R 19698 0 R 19699 0 R 19700 0 R 19701 0 R 19702 0 R 19703 0 R 19704 0 R 19705 0 R 19706 0 R 19707 0 R 19708 0 R 19709 0 R 19710 0 R 19711 0 R 19712 0 R 19713 0 R 19714 0 R 19715 0 R 19716 0 R 19717 0 R 19718 0 R 19719 0 R 19720 0 R 19721 0 R 19722 0 R 19723 0 R 19724 0 R 19725 0 R 19726 0 R 19727 0 R 19728 0 R 19729 0 R 19730 0 R 19731 0 R 19732 0 R 19733 0 R 19734 0 R 19735 0 R 19736 0 R 19737 0 R 19738 0 R 19 [...]
->> endobj
-19686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 707.957 231.409 718.861]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-19692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 683.989 223.309 694.893]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 660.02 231.409 670.924]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 636.052 231.409 646.956]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 612.084 223.309 622.988]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 588.115 223.309 599.019]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 564.147 223.309 575.051]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 540.179 223.309 551.082]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 516.21 223.309 527.114]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 492.242 223.309 503.146]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 468.273 223.309 479.177]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 444.305 223.309 455.209]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 420.337 223.309 431.241]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 396.368 223.309 407.272]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 372.4 223.309 383.304]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 348.432 223.309 359.335]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 324.463 223.309 335.367]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 300.495 223.309 311.399]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 266.08 223.309 276.984]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-19710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 242.112 223.309 253.016]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-19711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 218.143 223.309 229.047]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-19712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.506 194.175 283.443 205.079]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-19713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 170.207 304.524 181.111]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.266 146.238 278.203 157.142]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 122.27 304.524 133.174]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 98.302 258.537 109.206]
-/A << /S /GoTo /D (page.164) >>
->> endobj
-19717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 74.333 231.409 85.237]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-19718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 696.002 506.55 706.906]
-/A << /S /GoTo /D (page.209) >>
->> endobj
-19719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 672.092 514.39 682.996]
-/A << /S /GoTo /D (page.384) >>
->> endobj
-19720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 648.181 447.89 659.085]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-19721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 624.271 506.55 635.175]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-19722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 602.418 362.272 611.265]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-19723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 588.405 499.924 599.309]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-19724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 576.45 498.241 587.354]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-19725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 564.495 521.005 575.399]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 540.585 530.32 551.489]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-19727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 516.674 506.55 527.578]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-19728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 504.719 499.924 515.623]
-/A << /S /GoTo /D (page.240) >>
->> endobj
-19729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 492.764 498.241 503.668]
-/A << /S /GoTo /D (page.280) >>
->> endobj
-19730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 480.809 521.005 491.713]
-/A << /S /GoTo /D (page.333) >>
->> endobj
-19731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 458.956 362.272 467.803]
-/A << /S /GoTo /D (page.362) >>
->> endobj
-19732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.613 432.988 506.55 443.892]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-19733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 411.135 362.272 419.982]
-/A << /S /GoTo /D (page.363) >>
->> endobj
-19734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 385.168 501.578 396.071]
-/A << /S /GoTo /D (page.119) >>
->> endobj
-19735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 373.212 475.018 384.116]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-19736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 361.257 476.672 372.161]
-/A << /S /GoTo /D (page.315) >>
->> endobj
-19737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.208 349.302 489.145 360.206]
-/A << /S /GoTo /D (page.347) >>
->> endobj
-19738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 337.347 528.208 348.251]
-/A << /S /GoTo /D (page.417) >>
->> endobj
-19739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 315.494 362.272 324.34]
-/A << /S /GoTo /D (page.501) >>
->> endobj
-19740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 301.481 504.348 312.385]
-/A << /S /GoTo /D (page.535) >>
->> endobj
-19741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 277.571 511.551 288.475]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.454 253.661 514.39 264.565]
-/A << /S /GoTo /D (page.385) >>
->> endobj
-19743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 241.706 511.551 252.609]
-/A << /S /GoTo /D (page.475) >>
->> endobj
-19744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.836 229.75 521.772 240.654]
-/A << /S /GoTo /D (page.483) >>
->> endobj
-19745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.669 205.84 491.606 216.744]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 181.93 530.32 192.834]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-19747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.109 169.975 513.045 180.878]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-19748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.093 158.737 334.048 168.923]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-19749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 134.109 501.578 145.013]
-/A << /S /GoTo /D (page.112) >>
->> endobj
-19750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 122.154 475.018 133.058]
-/A << /S /GoTo /D (page.149) >>
->> endobj
-19751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 110.199 476.672 121.103]
-/A << /S /GoTo /D (page.310) >>
->> endobj
-19752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 98.244 528.208 109.147]
-/A << /S /GoTo /D (page.408) >>
->> endobj
-19753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 75.05 403.228 85.237]
-/A << /S /GoTo /D (page.448) >>
->> endobj
-19755 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19759 0 obj <<
-/D [19757 0 R /XYZ 89 770.89 null]
->> endobj
-19756 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19840 0 obj <<
-/Length 1425      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�8~���m����������㍝�Τ
F�e�)pR�_���w�O!t>}�ʱ�6Ӏvݸ5ίL�ٺM�FS��i�:��n�=6{�N�����'� ��e����Fw��ހbh0�覥����W�M��'
�ض��l���_O6�n��@(xq��fB�C��
� i��g� ��|1��}�X�l��$1Oij"�W
��?3�9�h�By��`�:����6!��m�����b�10�@�CapP��"�I��Oٔ'b���B����3ElL��.�тc^
-A j��xn�Y��)�h
�;��DZ{��}��;�¶n�
�_xfAM��|��A�O�����1jBkK�����oN/Hx:gv\T���
��M���
-��l�~l���TJe�)�l^OY
g���LET�����E���X�MH���.Y�8W^�W�,n��	�Ҵ���0�T5|V��m8���@b(c���+����!��ǒ5.g���W"A�
���M툑eF(ojh�k���[�WU�a(8�O\��fX��tD^�|7`Ii�@P�}v�iZ�My���	l�e*�⋛J;	B[�5xĒ�,N"�r챨B
S��d�
��"%?r'e�2�V0��7��#�-�
������o���TA��p�� �ʔcX��Z�25;���v{���Mʍ/�J����t��t="C��MEk7�ټ�
�A>y�/s�CaQJ��Kܹ�E"9IF����ݍ6
�I}J�Rҝ�7����x��Dd��N�!���<�����k�/;�OT ,�Q�0q��-�{>Y����(S�2`(�s�T����ŌZ�4#Ν~8���G�� �Xp��	Z0�/���>-�h[�tT�&n�� �bZ �V�-��K
Z� $���vW,\_�p��l���
B��!O]&<�L
U``CК��4T����}<��/�->!�4�pQ|�7�ܛ�\~��ʖ�a�l�f<�ˊ�i�,m\� ~�ك�A'Eeɠr}�p��c�Ө��.��L�tH��$:�Ī���WTX�ji�d�������Ư�k��d�4�`)
-�S��a�t��yZ
-���E5��1��d���-��a��J���d��,�\�yMPR=ج�k+���K*�< �~��:�m�CQ.�q���t;N�yzwqӽ=i���_u?{��
-k�[��}���'bH�����I�	 "�^���~�BG�R�)t�����q�ta��0�1K�)5V�q
S'vo�Wz
n򋇘G�i���-
�˯� ^�}�,/��|�@�C�u��V��������W�G��(�:�iu �9I�����,��L��!���u`ZŻ�0�����ڐL�S.iu��
-
	�:��`B���t Me3�^g�W�=k�P�>q��
v�
-endstream
-endobj
-19839 0 obj <<
-/Type /Page
-/Contents 19840 0 R
-/Resources 19838 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19842 0 R
-/Annots [ 19754 0 R 19760 0 R 19761 0 R 19762 0 R 19763 0 R 19764 0 R 19765 0 R 19766 0 R 19767 0 R 19768 0 R 19769 0 R 19770 0 R 19771 0 R 19772 0 R 19773 0 R 19774 0 R 19775 0 R 19776 0 R 19777 0 R 19778 0 R 19779 0 R 19780 0 R 19781 0 R 19782 0 R 19783 0 R 19784 0 R 19785 0 R 19786 0 R 19787 0 R 19788 0 R 19789 0 R 19790 0 R 19791 0 R 19792 0 R 19793 0 R 19794 0 R 19795 0 R 19796 0 R 19797 0 R 19798 0 R 19799 0 R 19800 0 R 19801 0 R 19802 0 R 19803 0 R 19804 0 R 19805 0 R 19806 0 R 19 [...]
->> endobj
-19754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 697.94 145.791 706.906]
-/A << /S /GoTo /D (page.497) >>
->> endobj
-19760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 683.695 287.867 694.599]
-/A << /S /GoTo /D (page.529) >>
->> endobj
-19761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.132 659.082 290.068 669.985]
-/A << /S /GoTo /D (page.210) >>
->> endobj
-19762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 624.45 145.791 633.417]
-/A << /S /GoTo /D (page.197) >>
->> endobj
-19763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 597.899 313.839 608.803]
-/A << /S /GoTo /D (page.189) >>
->> endobj
-19764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.627 585.592 296.564 596.496]
-/A << /S /GoTo /D (page.293) >>
->> endobj
-19765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 562.048 145.791 572.234]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 562.048 165.716 572.234]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.682 536.717 284.619 547.621]
-/A << /S /GoTo /D (page.130) >>
->> endobj
-19768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.129 536.717 304.066 547.621]
-/A << /S /GoTo /D (page.133) >>
->> endobj
-19769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 524.41 258.537 535.314]
-/A << /S /GoTo /D (page.165) >>
->> endobj
-19770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.526 524.41 278.462 535.314]
-/A << /S /GoTo /D (page.168) >>
->> endobj
-19771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.09 500.148 200.027 511.052]
-/A << /S /GoTo /D (page.176) >>
->> endobj
-19772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.903 487.841 313.839 498.745]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-19773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 477.824 145.791 486.79]
-/A << /S /GoTo /D (page.194) >>
->> endobj
-19774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.654 463.579 289.59 474.483]
-/A << /S /GoTo /D (page.211) >>
->> endobj
-19775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.101 463.579 309.037 474.483]
-/A << /S /GoTo /D (page.212) >>
->> endobj
-19776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 441.375 145.791 450.221]
-/A << /S /GoTo /D (page.217) >>
->> endobj
-19777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 415.055 226.049 425.959]
-/A << /S /GoTo /D (page.233) >>
->> endobj
-19778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.028 402.749 282.965 413.653]
-/A << /S /GoTo /D (page.243) >>
->> endobj
-19779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.475 402.749 302.412 413.653]
-/A << /S /GoTo /D (page.244) >>
->> endobj
-19780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 380.544 145.791 389.391]
-/A << /S /GoTo /D (page.248) >>
->> endobj
-19781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.237 366.18 291.174 377.084]
-/A << /S /GoTo /D (page.252) >>
->> endobj
-19782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 341.918 226.049 352.822]
-/A << /S /GoTo /D (page.255) >>
->> endobj
-19783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 317.656 226.049 328.56]
-/A << /S /GoTo /D (page.259) >>
->> endobj
-19784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.345 305.349 281.281 316.253]
-/A << /S /GoTo /D (page.281) >>
->> endobj
-19785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.792 305.349 300.728 316.253]
-/A << /S /GoTo /D (page.286) >>
->> endobj
-19786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 283.025 145.791 291.991]
-/A << /S /GoTo /D (page.290) >>
->> endobj
-19787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 268.78 260.191 279.684]
-/A << /S /GoTo /D (page.324) >>
->> endobj
-19788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.179 268.78 280.116 279.684]
-/A << /S /GoTo /D (page.325) >>
->> endobj
-19789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.587 256.474 304.524 267.378]
-/A << /S /GoTo /D (page.334) >>
->> endobj
-19790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 246.576 145.791 255.422]
-/A << /S /GoTo /D (page.335) >>
->> endobj
-19791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 222.314 145.791 231.16]
-/A << /S /GoTo /D (page.340) >>
->> endobj
-19792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.727 207.95 272.664 218.854]
-/A << /S /GoTo /D (page.348) >>
->> endobj
-19793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 184.405 145.791 194.592]
-/A << /S /GoTo /D (page.365) >>
->> endobj
-19794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.78 184.405 165.716 194.592]
-/A << /S /GoTo /D (page.367) >>
->> endobj
-19795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.158 160.143 211.095 170.33]
-/A << /S /GoTo /D (page.226) >>
->> endobj
-19796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.088 147.119 295.024 158.023]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 137.221 145.791 146.068]
-/A << /S /GoTo /D (page.377) >>
->> endobj
-19798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.972 122.857 297.909 133.761]
-/A << /S /GoTo /D (page.386) >>
->> endobj
-19799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [209.113 98.595 226.049 109.499]
-/A << /S /GoTo /D (page.390) >>
->> endobj
-19800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 86.288 311.727 97.192]
-/A << /S /GoTo /D (page.428) >>
->> endobj
-19801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 76.39 145.791 85.237]
-/A << /S /GoTo /D (page.431) >>
->> endobj
-19802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.594 696.002 442.53 706.906]
-/A << /S /GoTo /D (page.433) >>
->> endobj
-19803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 672.756 403.228 682.943]
-/A << /S /GoTo /D (page.460) >>
->> endobj
-19804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.614 660.031 511.551 670.935]
-/A << /S /GoTo /D (page.476) >>
->> endobj
-19805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.537 636.785 407.492 646.971]
-/A << /S /GoTo /D (page.98) >>
->> endobj
-19806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 612.821 362.272 623.008]
-/A << /S /GoTo /D (page.508) >>
->> endobj
-19807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.261 612.821 382.197 623.008]
-/A << /S /GoTo /D (page.509) >>
->> endobj
-19808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [486.933 600.096 503.87 611]
-/A << /S /GoTo /D (page.546) >>
->> endobj
-19809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [506.38 600.096 523.317 611]
-/A << /S /GoTo /D (page.547) >>
->> endobj
-19810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.748 588.088 494.684 598.992]
-/A << /S /GoTo /D (page.553) >>
->> endobj
-19811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.572 564.125 416.508 575.029]
-/A << /S /GoTo /D (page.559) >>
->> endobj
-19812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.669 552.117 491.606 563.021]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.613 528.153 437.549 539.057]
-/A << /S /GoTo /D (page.566) >>
->> endobj
-19814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 493.293 439.79 504.197]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-19815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 469.277 439.79 480.181]
-/A << /S /GoTo /D (page.78) >>
->> endobj
-19816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 445.261 501.578 456.165]
-/A << /S /GoTo /D (page.123) >>
->> endobj
-19817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 433.253 475.018 444.157]
-/A << /S /GoTo /D (page.158) >>
->> endobj
-19818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.735 421.245 476.672 432.149]
-/A << /S /GoTo /D (page.318) >>
->> endobj
-19819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.272 409.237 528.208 420.141]
-/A << /S /GoTo /D (page.421) >>
->> endobj
-19820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.292 385.991 403.228 396.177]
-/A << /S /GoTo /D (page.455) >>
->> endobj
-19821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 363.367 362.272 372.214]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-19822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.411 349.302 504.348 360.206]
-/A << /S /GoTo /D (page.538) >>
->> endobj
-19823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 325.286 530.32 336.19]
-/A << /S /GoTo /D (page.187) >>
->> endobj
-19824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 315.268 362.272 324.235]
-/A << /S /GoTo /D (page.193) >>
->> endobj
-19825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [513.384 289.315 530.32 300.219]
-/A << /S /GoTo /D (page.188) >>
->> endobj
-19826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.988 265.298 499.924 276.202]
-/A << /S /GoTo /D (page.239) >>
->> endobj
-19827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.304 253.29 498.241 264.194]
-/A << /S /GoTo /D (page.279) >>
->> endobj
-19828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.069 241.282 521.005 252.186]
-/A << /S /GoTo /D (page.332) >>
->> endobj
-19829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 206.422 439.79 217.326]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-19830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 182.406 439.79 193.31]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-19831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 158.39 439.79 169.294]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-19832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 134.374 439.79 145.277]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-19833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 110.357 439.79 121.261]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-19834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.642 86.341 501.578 97.245]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-19835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.082 74.333 475.018 85.237]
-/A << /S /GoTo /D (page.153) >>
->> endobj
-19837 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19841 0 obj <<
-/D [19839 0 R /XYZ 89 770.89 null]
->> endobj
-19838 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19905 0 obj <<
-/Length 1015      
-/Filter /FlateDecode
->>
-stream
-x��[s�8���+�0]ɶ|�[
��c�m��Q@!̂��6�~�
(�$��/`KG�|:�Α-#04��@���`BS�5< ]5!��� �U��V��b"h",Ze�M�n��VHV }��rpޚ@� ��t�
��(�TL�̄&@��?�ԑ�2���@0�2:��ܪ[Ť��	�n4~~䃘Q{t�����gH9K<,����j2A��@nU�Ԅz�����'l�lL�G��w�BrE�d��]ek
��T�Q�QT����-K
\T&#6
?S�f}>�e���"u�H�${|��n�h&S����L*?y,n^�
���!�(��a���l�U[��K8�F�Y2��/��05]��
�릌n��*&4����1g��sU�Tb�ws��Pr���}4
�M����x]߿BŸbl�=\G���'�5ǎe�(�,���LO���O6���:V���k�sE��lm�R���S�_���Y7%����[&�,C�ȍ��M/�~�Ѯ�i�̽���Y8��!��a��*F��7q�C�P�֛=����%@�Zn��w��
�28�C[M��Ӧs�t��
s&�.R�*DP
-��M��w���Ыz=�/	Mw
������hPE:�j�zd��ܚ�������$�
-I�^�P��Yq�߽^�Fg�����ݰ�����Ȗ<}6߈pR�E�\9%#�
˦ݳ�[���(~�
�S��h�FfN���Ҕ�Cs,��
˳\��-'��ޔ�N=~7[��k�;������a �B�	���֕�u@�pX:6���b���;g��؟��xpr��¸}Ξ�g�{�^ȭ�Zk2�e��S륆���
w�DX��r�:���)
-.��#��E]M諽(�����45;70TE�
-��o�c�7\��/�S
�U%�2��[,��q~�/"�G�l
O�c���;D�
�jMY��pU����S�� Y�!*$D��$O���ᔇC؏&+>_�iB��Q��L����(��
��������
-endstream
-endobj
-19904 0 obj <<
-/Type /Page
-/Contents 19905 0 R
-/Resources 19903 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19842 0 R
-/Annots [ 19836 0 R 19843 0 R 19844 0 R 19845 0 R 19846 0 R 19847 0 R 19848 0 R 19849 0 R 19850 0 R 19851 0 R 19852 0 R 19853 0 R 19854 0 R 19855 0 R 19856 0 R 19857 0 R 19858 0 R 19859 0 R 19860 0 R 19861 0 R 19862 0 R 19863 0 R 19864 0 R 19865 0 R 19866 0 R 19867 0 R 19868 0 R 19869 0 R 19870 0 R 19871 0 R 19872 0 R 19873 0 R 19874 0 R 19875 0 R 19876 0 R 19877 0 R 19878 0 R 19879 0 R 19880 0 R 19881 0 R 19882 0 R 19883 0 R 19884 0 R 19885 0 R 19886 0 R 19887 0 R 19888 0 R 19889 0 R 19 [...]
->> endobj
-19836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 707.957 260.191 718.861]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 695.97 311.727 706.874]
-/A << /S /GoTo /D (page.415) >>
->> endobj
-19844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 686.072 145.791 694.919]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 660.79 186.747 670.977]
-/A << /S /GoTo /D (page.451) >>
->> endobj
-19846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 638.188 145.791 647.035]
-/A << /S /GoTo /D (page.500) >>
->> endobj
-19847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 624.144 287.867 635.048]
-/A << /S /GoTo /D (page.534) >>
->> endobj
-19848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 590.152 145.791 599.119]
-/A << /S /GoTo /D (page.479) >>
->> endobj
-19849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.355 564.241 305.291 575.145]
-/A << /S /GoTo /D (page.483) >>
->> endobj
-19850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 540.267 285.097 551.171]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-19851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 528.28 258.537 539.184]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-19852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 516.293 260.191 527.197]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.416 504.306 294.352 515.21]
-/A << /S /GoTo /D (page.374) >>
->> endobj
-19854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 492.319 311.727 503.223]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 469.094 186.747 479.281]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-19856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.266 456.39 278.203 467.294]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 432.416 285.097 443.32]
-/A << /S /GoTo /D (page.118) >>
->> endobj
-19858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 420.429 258.537 431.333]
-/A << /S /GoTo /D (page.154) >>
->> endobj
-19859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 408.442 260.191 419.346]
-/A << /S /GoTo /D (page.314) >>
->> endobj
-19860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 396.455 311.727 407.359]
-/A << /S /GoTo /D (page.416) >>
->> endobj
-19861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 373.23 186.747 383.417]
-/A << /S /GoTo /D (page.452) >>
->> endobj
-19862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.266 360.526 278.203 371.43]
-/A << /S /GoTo /D (page.552) >>
->> endobj
-19863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 326.059 223.309 336.963]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 302.086 223.309 312.989]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 278.112 223.309 289.016]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 254.138 223.309 265.042]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 230.164 223.309 241.068]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 206.19 223.309 217.094]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 182.216 223.309 193.12]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 158.242 223.309 169.146]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 134.268 223.309 145.172]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 110.294 223.309 121.198]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.354 86.32 223.309 97.224]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 707.957 439.79 718.861]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 684.047 439.79 694.951]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 660.136 439.79 671.04]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 636.226 439.79 647.13]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 612.316 439.79 623.22]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 588.405 439.79 599.309]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 564.495 439.79 575.399]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 540.585 439.79 551.489]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 516.674 439.79 527.578]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 492.764 439.79 503.668]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 468.854 439.79 479.758]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 444.943 439.79 455.847]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 421.033 439.79 431.937]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 397.123 439.79 408.027]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 373.212 439.79 384.116]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 349.302 439.79 360.206]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.835 325.392 439.79 336.296]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-19891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 301.481 447.89 312.385]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 277.571 447.89 288.475]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 253.661 447.89 264.565]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 229.75 447.89 240.654]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 205.84 447.89 216.744]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 181.93 447.89 192.834]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 158.019 447.89 168.923]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 134.109 447.89 145.013]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 110.199 447.89 121.103]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [435.935 86.288 447.89 97.192]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19902 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [334.981 43.314 433.811 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19906 0 obj <<
-/D [19904 0 R /XYZ 89 770.89 null]
->> endobj
-19903 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19926 0 obj <<
-/Length 719       
-/Filter /FlateDecode
->>
-stream
-xڵ�]o�0���+|7"
c;��pY�Ut]�
-�&u����A�Џ?'*P ��WqΉ�����9Lg����|�
��F ��L���տ<���oG��E>D��y��ti�z#���ڊ 6�)�|0N��[Bm>:�
ˏ�G?c0�~Zh����P�a
16klL[B%���y&C%�Et��z�Z�
-5�p��,p�&�R��r��M�
Pj���旽2�m��^��������k���h`��9 ��&t7=��"J�P��4W2ϣ,m��a�q��q���
-�D���
��2`����<~3����}4a��&6F-1���<Z�6�;h�	�O���PǕ��8����]��ľY�1
-e�'��+99�l�i�rYh�� <J��۶)�(Y�F�
��������A8�l�+z��YD"����
c�)ǁ��'M{�Rz�@J�w�s��)�ļ����}�@'�SSx�o�Q�����ƅ�f����B����R��s��˿6ei�u��~�l�D�B�c|\������\�ySC��zn�f�@O�^�fuK�떌�Uo�z��;�I��
.��W.���Vn��t!b3��(zX�7[�njC���mG���RVy��
}_��tSRJ�ftV�n�s���2��q��	��G �nQ���L�$SUBQ���(4'���ZG�0d��Jh1�-�<R~�:.������'8ʹ�/��� �>
-endstream
-endobj
-19925 0 obj <<
-/Type /Page
-/Contents 19926 0 R
-/Resources 19924 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 19842 0 R
-/Annots [ 19901 0 R 19907 0 R 19908 0 R 19909 0 R 19910 0 R 19911 0 R 19912 0 R 19913 0 R 19914 0 R 19915 0 R 19916 0 R 19917 0 R 19918 0 R 19919 0 R 19920 0 R 19921 0 R 19922 0 R 19923 0 R ]
->> endobj
-19901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 707.957 231.409 718.861]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.454 684.047 231.409 694.951]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-19908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.188 660.136 275.124 671.04]
-/A << /S /GoTo /D (page.563) >>
->> endobj
-19909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.158 624.988 211.095 635.175]
-/A << /S /GoTo /D (page.225) >>
->> endobj
-19910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.959 600.361 234.895 611.265]
-/A << /S /GoTo /D (page.223) >>
->> endobj
-19911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.167 577.168 291.104 587.354]
-/A << /S /GoTo /D (page.230) >>
->> endobj
-19912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.776 552.54 296.713 563.444]
-/A << /S /GoTo /D (page.568) >>
->> endobj
-19913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 508.769 145.791 517.616]
-/A << /S /GoTo /D (page.508) >>
->> endobj
-19914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 482.801 260.191 493.705]
-/A << /S /GoTo /D (page.320) >>
->> endobj
-19915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [169.81 459.608 186.747 469.795]
-/A << /S /GoTo /D (page.455) >>
->> endobj
-19916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.161 434.981 285.097 445.885]
-/A << /S /GoTo /D (page.123) >>
->> endobj
-19917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.6 423.026 258.537 433.93]
-/A << /S /GoTo /D (page.158) >>
->> endobj
-19918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.254 411.07 260.191 421.974]
-/A << /S /GoTo /D (page.318) >>
->> endobj
-19919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.79 399.115 311.727 410.019]
-/A << /S /GoTo /D (page.421) >>
->> endobj
-19920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 377.262 145.791 386.109]
-/A << /S /GoTo /D (page.505) >>
->> endobj
-19921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.93 363.25 287.867 374.154]
-/A << /S /GoTo /D (page.539) >>
->> endobj
-19922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.767 339.339 291.722 350.243]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-19923 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [243.556 43.314 342.385 56.266]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-19927 0 obj <<
-/D [19925 0 R /XYZ 89 770.89 null]
->> endobj
-19924 0 obj <<
-/Font << /F73 552 0 R /F60 532 0 R /F75 554 0 R >>
-/XObject << /Im3 547 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-19607 0 obj
-[522 0 R /Fit]
-endobj
-19530 0 obj
-[522 0 R /Fit]
-endobj
-18708 0 obj
-[522 0 R /Fit]
-endobj
-18516 0 obj
-[522 0 R /Fit]
-endobj
-18515 0 obj
-[522 0 R /Fit]
-endobj
-18514 0 obj
-[522 0 R /Fit]
-endobj
-18433 0 obj
-[522 0 R /Fit]
-endobj
-18432 0 obj
-[522 0 R /Fit]
-endobj
-18431 0 obj
-[522 0 R /Fit]
-endobj
-18346 0 obj
-[522 0 R /Fit]
-endobj
-18275 0 obj
-[522 0 R /Fit]
-endobj
-18274 0 obj
-[522 0 R /Fit]
-endobj
-18200 0 obj
-[522 0 R /Fit]
-endobj
-18199 0 obj
-[522 0 R /Fit]
-endobj
-18125 0 obj
-[522 0 R /Fit]
-endobj
-17973 0 obj
-[522 0 R /Fit]
-endobj
-17880 0 obj
-[522 0 R /Fit]
-endobj
-17785 0 obj
-[522 0 R /Fit]
-endobj
-10246 0 obj
-[522 0 R /Fit]
-endobj
-19928 0 obj
-[511.1 460 421.7 408.9]
-endobj
-19929 0 obj
-[398.6]
-endobj
-19930 0 obj
-[525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525]
-endobj
-19931 0 obj
-[611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 351.8 351.8 351.8 935.2 578.7 578.7 935.2 896.3 850.9 870.4 915.7 818.5 786.1 941.7 896.3 442.6 624.1 928.7 753.7 1090.7 896.3 935.2 818.5 935.2 883.3 675.9 870.4 896.3 896.3 1220.4 896.3 896.3 740.7 351.8 611.1 351.8 611.1 351.8 351.8 611.1 675.9 546.3 675.9 546.3 384.3 611.1 675.9 351.8 384.3 643.5 351.8 1000 675.9 611.1 675.9 643.5 481.5 488 481.5 675.9 643.5 870.4 643.5]
-endobj
-19932 0 obj
-[571 571 856.5 856.5 285.5 314 513.9 513.9 513.9 513.9 513.9 770.7 456.8 513.9 742.3 799.4 513.9 927.8 1042 799.4 285.5 285.5 513.9 856.5 513.9 856.5 799.4 285.5 399.7 399.7 513.9 799.4 285.5 342.6 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 285.5 799.4 485.3 485.3 799.4 770.7 727.9 742.3 785 699.4 670.8 806.5 770.7 371 528.1 799.2 642.3 942 770.7 799.4 699.4 799.4 756.5 571 742.3 770.7 770.7 1056.2 770.7 770.7 628.1 285.5 513.9 285.5 513.9 285.5 2 [...]
-endobj
-19933 0 obj
-[531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3]
-endobj
-19934 0 obj
-[416.4 450.6 513.2 481.1 363.8 592.2 599.5 619.2 506.9 450.6 588.2 529.4 587.7 452.4 556.3 611.7 640.8 670.5 639.4 477.1 609.5 852.5 529.4 374.4 671.1 1027.8 1027.8 1027.8 1027.8 285.5 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 799.4 513.9 799.4 513.9 543.7 770.7 777.7 733.6 847.5 756.3 656.2 804.8 850.1 449.3 566.3 870.4 699.4 992.9 821.6 782.1 656.2 810.6 777.6 627.8 599.6 699.1 599.4 970.5 849 596.5 699.2 399.7 399.7 399.7 1027.8 1027.8 4 [...]
-endobj
-19935 0 obj
-[799.4 285.5 799.4 513.9 799.4 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 513.9 513.9 799.4 799.4 799.4 799.4 799.4 799.4]
-endobj
-19936 0 obj
-[761.6 489.6 761.6]
-endobj
-19938 0 obj
-[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410]
-endobj
-19939 0 obj
-[826.4 531.3 826.4]
-endobj
-19940 0 obj
-[500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 832 667 667 667 722 667 667 722 778 389 500 667 611 889 722 722 611 722 667 556 611 722 667 889 667 611 611 333 278 333 570 500 333 500 500 444 500 444 333 500 556 278 278 500 278 778 556 500 500 500 389 389 278 556 444 667 500 444]
-endobj
-19941 0 obj
-[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
-endobj
-19942 0 obj
-[777.8 777.8 777.8 777.8 777.8 611.1 888.9 555.6 333.3 611.1 611.1 666.7 666.7 722.2 722.2 444.4 444.4 1000 777.8 666.7 666.7 611.1 611.1 777.8 777.8 777.8 777.8 777.8 777.8 500 694.4 777.8 777.8 777.8 777.8 777.8 777.8 666.7 666.7 666.7 666.7 777.8 777.8 777.8 777.8 444.4 444.4 402.8 402.8 388.9 388.9 777.8 777.8 777.8 777.8 777.8 777.8 555.6 555.6 555.6 555.6 0 0 0 0 0 1000 1000 1000 833.3 833.3 833.3 833.3 833.3 833.3 444.4 611.1 1111.1 1111.1 1111.1 1111.1 1111.1 1111.1 555.6 833.3 8 [...]
-endobj
-19943 0 obj
-[686.6]
-endobj
-19944 0 obj
-[1083.3 458.3 1083.3 736.1 1083.3 736.1 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1361.1 736.1 736.1 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1361.1 1361.1 1083.3 1083.3 1361.1 1361.1 736.1 736.1 1361.1 1361.1 1361.1 1083.3 1361.1 1361.1 875 875 1361.1 1361.1 1361.1 1083.3 441 1361.1 944.5 944.5 1222.2 1222.2 0 0 805.6 805.6 944.5 736.1 1013.9 1013.9 1083.3 1083.3 875 1113.5 919.3 782.1 1083.9 770.8 988.2 850.4 1194.5 819.5 958.3 1055 964 [...]
-endobj
-19945 0 obj
-[777.8 777.8 777.8 777.8 277.8 666.7 666.7 777.8 777.8 1000 1000 777.8 722.2 888.9 611.1 1000 1000 1000 1000 833.3 833.3 416.7 416.7 416.7 416.7 1111.1]
-endobj
-19946 0 obj
-[1109.9 1007 867.4 1064 1110.4 626.7 772.9 1138.9 955.6 1284 1075.7 1047.5 875.4 1082.2 1030 856.3 832.3 943.9 827.8 1279.2 1112.9 824.3 943.1 597.2 597.2 597.2 1361.1 1361.1 597.2 774.4 633.3 649.4 739.7 677 684 700.6 827.6 533.6 588.2 758.1 480.3 1228 880.8]
-endobj
-19947 0 obj
-[575 575 575 575 575 575 575 575 575 575 319.4 319.4 350 894.4 543.1 543.1 894.4 869.4 818.1 830.6 881.9 755.6 723.6 904.2 900 436.1 594.4 901.4 691.7 1091.7 900 863.9 786.1 863.9 862.5 638.9 800 884.7 869.4 1188.9 869.4 869.4 702.8 319.4 602.8 319.4 575 319.4 319.4 559 638.9 511.1 638.9 527.1 351.4]
-endobj
-19948 0 obj
-[760.6 659.7 590 522.2 483.3 508.3 600 561.8 412 667.6 670.8 707.9 576.8 508.3 682.4 611.8 685.9 520.8 630.6 712.5 718.1 758.3 717.8 528.8 691.6 975 611.8 423.6 747.2 1150 1150 1150 1150 319.4 319.4 575 575 575 575 575 575 575 575 575 575 575 575 319.4 319.4 894.4 575 894.4 575 628.5 869.4 866.4 816.9 938.1 810.1 688.9 886.7 982.3 511.1 631.3 971.2 755.6 1142 950.3 836.7 723.1 868.6 872.4 692.7 636.6 800.3 677.8 1093.1 947.2 674.6 772.6 447.2 447.2 447.2 1150 1150 473.6 632.9 520.8 513.4 [...]
-endobj
-19949 0 obj
-[1027.8 402.8 472.2 402.8 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 402.8 402.8 1027.8 1027.8 1027.8 645.8 1027.8 980.6 934.7 958.3 1004.2 900 865.3 1033.4 980.6 494.5 691.7 1015.3 830.6 1188.9 980.6 1027.8 900]
-endobj
-19950 0 obj
-[892.9 339.3 892.9 585.3 892.9 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 585.3 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 1138.9 892.9 892.9 1138.9 1138.9 585.3 585.3 1138.9 1138.9 1138.9 892.9 1138.9 1138.9 708.3 708.3 1138.9 1138.9 1138.9 892.9 329.4 1138.9 769.8 769.8 1015.9 1015.9 0 0 646.8 646.8 769.8 585.3 831.4 831.4 892.9 892.9 708.3 917.6 753.4 620.2 889.5 616.1 818.4 688.5 978.7 646.5 782.2 871.7 791.7 1342.7 935.6 905.8 80 [...]
-endobj
-19951 0 obj
-[458.3 458.3 416.7 416.7 472.2 472.2 472.2 472.2 583.3 583.3 472.2 472.2 333.3 555.6 577.8 577.8 597.2 597.2 736.1 736.1 527.8 527.8 583.3 583.3 583.3 583.3 750 750 750 750 1044.4 1044.4 791.7 791.7 583.3 583.3 638.9 638.9 638.9 638.9 805.6 805.6 805.6 805.6 1277.8 1277.8 811.1 811.1 875 875 666.7 666.7 666.7 666.7 666.7 666.7 888.9 888.9 888.9 888.9 888.9 888.9 888.9 666.7 875 875 875 875 611.1 611.1 833.3 1111.1 472.2 555.6 1111.1 1511.1 1111.1 1511.1 1111.1 1511.1 1055.6 944.5 472.2 8 [...]
-endobj
-19952 0 obj
-[938.5 569.5 938.5 877 323.4 446.4 446.4 569.5 877 323.4 384.9 323.4 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 323.4 323.4 323.4 877 538.7 538.7 877 843.3 798.6 815.5 860.1 767.9 737.1 883.9 843.3 412.7 583.3 874 706.4 1027.8 843.3 877 767.9 877 829.4 631 815.5 843.3 843.3 1150.8 843.3 843.3 692.5 323.4 569.5 323.4 569.5 323.4 323.4 569.5 631 507.9 631 507.9 354.2 569.5 631 323.4 354.2 600.2 323.4 938.5 631 569.5 631 600.2 446.4 452.6 446.4 631 600.2 815.5 600.2]
-endobj
-19953 0 obj
-[833.3 777.8 694.4 666.7 750 722.2 777.8 722.2 777.8 722.2 583.3 555.6 555.6 833.3 833.3 277.8 305.6 500 500 500 500 500 750 444.4 500 722.2 777.8 500 902.8 1013.9 777.8 277.8 277.8 500 833.3 500 833.3 777.8 277.8 388.9 388.9 500 777.8 277.8 333.3 277.8 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 2 [...]
-endobj
-19954 0 obj
-[592.7 662 526.8 632.9 686.9 713.8 756 719.7 539.7 689.9 950 592.7 439.2 751.4 1138.9 1138.9 1138.9 1138.9 339.3 339.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 339.3 339.3 892.9 585.3 892.9 585.3 610.1 859.1 863.2 819.4 934.1 838.7 724.5 889.4 935.6 506.3 632 959.9 783.7 1089.4 904.9 868.9 727.3 899.7 860.6 701.5 674.8 778.2 674.6 1074.4 936.9 671.5 778.4 462.3 462.3 462.3 1138.9 1138.9 478.2 619.7 502.4 510.5 594.7 542 557.1 557.3 668.8 404.2 472.7 607.3 3 [...]
-endobj
-19955 0 obj
-[777.8 555.6 722.2 666.7 722.2 722.2 666.7 611.1 777.8 777.8 388.9 500 777.8 666.7 944.5 722.2 777.8 611.1 777.8 722.2 555.6 666.7 722.2 722.2 1000 722.2 722.2 666.7]
-endobj
-19956 0 obj
-[500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389 400 275 400 541 0 0 0 333 500 556 8 [...]
-endobj
-19957 0 obj
-[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410 319 230 319 479 0 0 0 228 456 410 8 [...]
-endobj
-19958 0 obj
-[639.7 565.6 517.7 444.4 405.9 437.5 496.5 469.4 353.9 576.2 583.3 602.6 494 437.5 570 517 571.4 437.2 540.3 595.8 625.7 651.4 622.5 466.3 591.4 828.1 517 362.8 654.2 1000 1000 1000 1000 277.8 277.8 500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.3 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520 [...]
-endobj
-19959 0 obj
-[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
-endobj
-19960 0 obj
-[556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444 394 220 394 520 0 0 0 333 500 500 [...]
-endobj
-19961 0 obj
-[556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1 [...]
-endobj
-19962 0 obj
-[638.9 963 638.9 963 963 963 963 963 963 963 1222.2 638.9 638.9 963 963 963 963 963 963 963 963 963 963 963 963 1222.2 1222.2 963 963 1222.2 1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 1222.2 1222.2 963 365.7 1222.2 833.3 833.3 1092.6 1092.6 0 0 703.7 703.7 833.3 638.9 898.1 898.1 963 963 768.5 989.9 813.3 678.4 961.2 671.3 879.9 746.7 1059.3 709.3 846.3 938.8 854.5 1427.2 1005.7 973 878.4 1008.3 1061.4 762 711.3 774.4 785.2 1222.7 883.7 823.9 884 833.3 8 [...]
-endobj
-19963 0 obj
-[472.2 472.2 472.2 649.3]
-endobj
-19964 0 obj
-[777.8 277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 1000 777.8 777.8 1000 1000 500 500 1000 1000 1000 777.8 1000 1000 611.1 611.1 1000 1000 1000 777.8 275 1000 666.7 666.7 888.9 888.9 0 0 555.6 555.6 666.7 500 722.2 722.2 777.8 777.8 611.1 798.5 656.8 526.5 771.4 527.8 718.7 594.9 844.5 544.5 677.8 761.9 689.7 1200.9 820.5 796.1 695.6 816.7 847.5 605.6 544.6 625.8 612.8 987.8  [...]
-endobj
-19965 0 obj
-[222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500]
-endobj
-19966 0 obj <<
-/Length1 1425
-/Length2 6251
-/Length3 0
-/Length 7209      
-/Filter /FlateDecode
->>
-stream
-xڍtT���6a�R H3tw�4H0��03C���t��"J��R��HI#%���7���s���k}ߚ���������v��,�F|��{����IʺJ�  �����ٍ�h�o=�)��"�R��PFB�h�N��up@�

-�bR��R  I�
D � �7����p��]�AB�]��<N. at PRR���;��AB
�p@�v��c3:�a��
-Ac��S�����������Hg9.^��v
!(����
��!����.P�_#���� X
� ���.^pG�f�4u�{
�_`�� ���� ����
-���W (��3�����c�pg�	
-� ��t�Ѿh^ 
w��P�?�
����Wj� ��?��F񣠰_
~���Ypw���(�_�S�"!غc�4�
����-9A�N�h8zy����^M�?����:g�@�b ���:��J`���6
-�Rc9�y < ',
H �	��#�C��! �	��O�?%"AA���!�P8ѿ�c���dl��P_��
?A �����5v�
p����-06PU����C�_F%%�/��'*�	�� AA1@
{�g�U�o����`���GDM�����z��3�ֆ
�g=v�! ���
-$
-r�~��K����7��������7R��~�9��?v�;��������j�k��0���i���
Q�;��UF(J
�
qԇ�
\�����
��!��׃�	�@�e��QAa{�����?S��
��vO�w0	�a[��D?A�:B|�6 �G��. �\ �@�� H���-�H�W�߲ � �D�V�#���]�ߣ������ �8MM 
��V=j:�T���[
�
c_5K���B��:�q=�����y�bjo;��*��4��VC�����g�綉�#��D��ou
�o)Vw22�+��_x�����7�h��zzI��ϣ<��P���,��<�j�V!�M|^<�kcR���}�8-�54#��=_���c7s�~2k%�l�
-��X�;0Wj,�j��CgAˈp���Oi��ͤ_᫘y��l�����G
I�ڦt�����GE|�O�uZ(���8<E�L
�� ����~a��N��l���Y
Р�
6F�$s\G�wmL��;&-��I�R��_ݙe)�����O�	��G�u��:�|f�ֻwkt��y��a/*�&�ϲ��s�WG|��������V��:�}%h����k֓w�^�lIp鵬��:�
&�m��X
F
]
-'׉{ī)D�t�kI�D�V�<h��
�`�g6lp�h���0�)c�"��k������m���h�Xb�(�
� ���g!+;�R�
�z��^�*���6=�ڱٵ�	�4�ZؾHO���U��L �YfX��X���>A��ˢAp�`�VW����]k�kOC֋��0���N+c}���U
� }��D��S�#U����Li��~����`ӱJO
-
�ױ�%"��}o�<�w+/�
�=�8�$Mʼn�ۛ'��붟�rl���K���6�<Q�v��E��We�P�b�}*�����6���)
�
�y���x�
kI��,���^i���(q
�����ʩ`��e'^�w�6���v�1R�	oC��LJn_�H3o_�ҧ��R�!��������ϕ$(G
�ګ����p���IG�C�
%?*����M[����<q�l<w"�n��z
�A(��	l8dC��y�C�J������P#[#�r����_u��$[�����<��WO���+]���?R�t����a�֪V�ML
�WZ��*
�(ϖ c��.alw�[��;9��>���5�n�����`�ЫƼ�R����2:+�*k��G�R�7����`tp���cw립o�[Ӆ/����m�b����&F���mNҡ*~��E���bZ��E���w
^q
���z�'�6{-���*g�~�[�]����@U^���ޤ�x�tr��h�C�
����K㯭4B7�S�
}H���&8�t`o%
�b�&��D� 
H���Y^�[�{|�|5�L��(��À���/w#9�2t9��k((��-�ϮX!��ESu
ވ�V?�n� kaܞޔ��LU����m����ʓ���������VNo�/��ȅ
�d��Ra:`q}�u"���Q3Q���pmY�^���oC�6P�&���݇�U�
-p
��h��>PNH�
�J��H{�V�
-�+�B�Ce
NO2�R����<�����:4��}j�
��ҷ2f˾��]�����I= oƮi*�Ak����iP#�:�I^����kw��遑�F�#�k��B�+YO�ѝ��Vx����=0��}�ܒ��sM\AN
\����Vn~A\#'���#�zS�ݎ:.
-$�ۥ�Ѹ�
�މ
-��y��O���E��_!U�Vn\ι0��?�(XR�L,e9	Q>����-��+{�ղC���C��&�AW�C��{��w�O]��
�p�
lI�"+MV�#7�Q\ڶuv�[4����8�
?Z�=�.�$O��-��I���
�U��@�Sw���գ5�Ey��z��SC*}%�܏�᭗��3��j�V�.n��u�WȟI\a���qew��ZKc���m�I��?#E&��C� ��J�漽u�T���2�&�Ϋ�N>s���J�n�ȧ�y`/|�L�ဏ�شү����Vc7!�&ܲB	S�^Z"M�c<������F�j��k���$�e�aF���ı
h� ���zq�����=��Y:��Y���Mt��^�)$k��4�\|-'�K��8
Y@�K�R�aYv3�`�S.
�I|l��6N>��Cl��
=��,'1sD�h
��Z��e����]�Lt�:��_lx�D
LV/��I>����Ə���*
-�v�)�0%�8���Sܕ�
:F
 �+6A�ܫ����R��V]}�,'�����%��F�I'2t�*��Ĕ��T�tJ���
�Ս�-"�
\���I�>�y]F:ȑ��fL��S�~��`��^�[���[��}&9(qĵ������Q��,��<��J���Yv�Jj�͟yu�?��0<kZ��Q�7qߩd�#|�����w�-�,�b.�ҝL��D.�c���
��6�H:}T�u͹1��9m
�y������6Uk�K�ˢ�YΏY���z�dNu��м^`�f!��=Z�ሤA[+�83���0�X�Z�5C�2����\�ETOU㬐=f�$mc#I���Ô8���).���=�f�i琍�!-yw@��s*�Ѿ����H�YˈJN
�\R�d9�M�_Yo�ӛ%,5�v|�i�T<�n�'�ç��+
So?E=G�\�Q�u
%���kF�����ҍ��*j�!�_�ghZ�E��L
B��=^ž�8TIy�+ի=�i�J�Hכ�eOV3����s�����/^\e�:�w����`�5���m>6	�%k�_�~c��N��
L����l��@f;��q68.�6ݑ�d��J�sIq/�<K��=�!�-�;�6�8-�ý��������� [...]
-\2�J�k⥿pe
��)�v�%5��|֧Z���\��7{c�
�
-�\����r�>s�gՋ�wh�E6���P�3D��!���%+$a��
Œ�
2'�<�}�*t�WSy
-g$�⩞0�`��}�G��r8
���LYi�ގ@2g����h9ӓd�.J�ͨ���.���s>�~�����6�h��!�����B��v�
�d��K
�j7U8t
��ێ_����&y�7�VӤ�M��ݤ�uH���v�n����d��V��]�j�_��+��g1C�^��.%n-�"����sq�7nj��
̒�V��.L�{F1~���S"�W�)΀t� ��d��f�jp��#zY\��y��ہ��,�EJ����]=�9_��7z�
-#�9�j���0���+�o�����6�ڽx���S5���$�1�8$�F�VlӲ�D�|b�
񦍾ޘ��,A�s�Ȕ*9�&�o�$���$d�8�Fs���G�)h/˚1���3U�n��V̟P�>�?
�VLm��-1��%~Li AH��Z����B_ at 4�_F���$��V�7�*d�`ͻ4�Z	�,�S���u_�|*v��]>�k#y�7P��'h
K��[�2'�⺲'�F�iP��������F�}�D>�O��:
-��ZrU�\w)x.�~1�΁#���N��8%]քN^#�M���X�$٤:i��ͤ���#|9T��o_����b�
� ��F����f����k0�w���rh9�u��
1��C0%��〗�����A��
��݃�Gj'̄�����P��uu
2L���wՙݥ�V�H�@嚼��t?d�@��
�OI�@r?_I�S�����Y�f3��+�{�?���lJ>nf;n��{��T�ͼ
8;�L8�J�Ad��1%�Fe��V�o�Ϣ2��F��H�S����'�	����߻�<}�Q�����zGs����N
6Ś$��Eջ��O�92�C�b‡��ڟ��O���eD��
��U_�N�i��lt\�v�s��km�:���=��f��\��R�����!ϖ'l

��]K��LrzcV�
�
��IC=
�&��C��ѧ��zA��������"Խb�c)\���^M���0�
sk�[2�!I9�y@𥻄=�EF�g�P�M>e��U�Tߟ���V��
���Ǩ n����_�d�p�
-̐�iUXNhK�{�ڰ*���=WR\op�΃����(<9w��:z˒G�ȭ�6���8 x�����9�
-���΄dSV����P�n܈yCC?)����z�~/.��?������˲����/��
*}�I�׸$ƶ;��'��W
�e>":����'���z>{WO��QR��b1�<��B�;��v�ɹ*�gN۝@˟��<���@*�q+�'�H+��
__�8)��S�!���Fc�E\�l.�sUm���V��F��ڝ�9
���>��t���f�Y0�
�{����>*�)d��8h!-��,�@�v>k�X���(�WO|]K�����EA��	�ܪҴ�'}�vve��<�-LMD��Y���Te�r��	���,��"'�
�O�?d�:��gj����ŒC;��m/?�O��%3
�n�փ�p�Me=�5<��2ޔm��{���É����H�PI���iР�d��Ki��md�
$
K,d{`[���ft'tV/4�?c�4�U���&���Ѥkc�S&��{��*��s- at Wh,W4
�eެ/?��;����pơ��Cjܧ^�u�yH�#z0�3������+�/Wl�����Hg
�R��MW^�&W�6����A�w7�qt
�Vo�
���!)��]V|�9��mwq�u�z)�窖� �E
��QԔ6ڂ�gng��ݎ�i��M#�DJe�ړ��qa�����g���ܼ�
O&
M
�z8K1�H\��$��c���x�H[� �_a��AYs�U�,Y?s��ݨFg�������C��d���2�a� )P_�F���z�,�q���
^�v���)�v�%�d)�ھC'I.����2O
�ɯ���_�R����� ���my�Q�
�?��vߘ��܏�j�Ė�����
���d��ʯ����BS�M��
1s3�Zd	�#�n�[���cb���.Fs�
+�\o��3O�ߎL����_D��W^��nIi���q F
��I�p����v.���,:
 �g�N,�R/&�}�7����R�
�Sm�Ly��+z���7Ӯ��TI�su��
 �t�i�9W�nh�0��7 ��&��լ���)ia�'3�}�2�i���
�`t<�c������b4a��7{O�M\k��f�	n�{�L�e��	^�=g[[��\PXT�&�z�����u
u�$��N�IHkU�ęy��̳8�w�q�Z]���iޜ�*U5��:�%Aѓ�K�S�e�3�O���Z�M��/16�3e?�_�.d�UYŬ/G�G_
�[Q�rH30<�'�;r~&�y���^�P�3.�R��2�C#��!xv�{�Q�����d
-��fd�o�3e��˘d]�A��XА|��[��xs?�'���2��عs� �'u�M
-�jX
k��
���{���S=����At��ȣ�o��RR��W��<��;�a�V�PѸQ����
�NS-y��=n-Q�掞&���3�Z0�voW�\�r��J ~7��)����'عX$��

+�X�b�"uo���
��d�)JJJg��;��?���S
-���9E�����a�?�V-�X'�<�Z�_������:��9Se%��"�/g��(ۢR:N+��e��f
��Y"u���%��M����:�
R2��'�*���]�
�sd�º$���k
�	ʡ�7�$�_v���Ȕ��S�UT^{��� �78��}|��R�9����g�[.NJ|�O𧟠�x8N������LNbV;}�V� ���N�^`ݩ�z;������V`|7�E�[/�d��B�]n#�pGI�D�o!�ix���
��.�	,��qv:��'���Z
-���
�b���v���|+��0���#s-�t	�n��ʶ������%W!
w�����䑟�ߣ�	���u�ʹ��=ĵ�c�w�
;N�nN��V��}[2����or����+`d`F*E.vP
�
�K���7�
P�G�x���A���f�YߛļC%���q��)!�zN	y
ކ[�p��h�S;�R�k��4�D��5w�[���z@��z[����J
U��"e~f�"ڔ%
:��`4��/���XC
w��9���+�Ca���Z��_<�S�PY�g頞�y��WF�
&�!��C�i����?V؃�P/�x%�?QU
�#��z��U���8o�]t�G��t[���¬Ri����WN���>��$�<�Zh�ЏV
&��d��Þ���V�]�H�:|�ϾP�Q��
�s�ތ�-o�в��[I�\�mVV^&�U�s�}&ʖ�F�"�0�����d<���¸��������GD`�#��*��OTU��,��HjR�նKC�M�`�s��
˖�旉�A��*,���˚
-�����{Vєɪh��
3�y?0���3�K^8���y+��Zy�����f!W+��aQ1���n~����^��

-endstream
-endobj
-19967 0 obj <<
-/Type /FontDescriptor
-/FontName /TQEGZP+CMBX10
-/Flags 4
-/FontBBox [-56 -250 1164 750]
-/Ascent 694
-/CapHeight 686
-/Descent -194
-/ItalicAngle 0
-/StemV 114
-/XHeight 444
-/CharSet (/f/one/zero)
-/FontFile 19966 0 R
->> endobj
-19968 0 obj <<
-/Length1 1384
-/Length2 5983
-/Length3 0
-/Length 6924      
-/Filter /FlateDecode
->>
-stream
-xڍTT���P@���%%��\�Ai؅�؅e�����P at JJZJB��;TBi����}���{νg�y���<3�{f�y٘t
x�m(G�
- �%�Z
-�b ~~! ?� 
�!
�
�c�c{ E��p��PDB�(�M	�B�p���3@@  *) &�����
�@J���0[����C����>H��
-]�W �
'@@BB��W8@���ـ� -0�ꂮhv l`P�ϿRpH;�P��||^^^@��;�����x�P }�;�	��$
��@3�

`��;�	�
�0(�

���"�� 5M��+������� P��t�&���ml.�`�
n��9C: M �� �m���t<�
sCЀ_7@�z 0��z�6H�+�
�s�I��gt��ᶊ(
���~J0$��v�ߓu�#��~v0���O�
�|Fp��TM�m���fED����DE P7 ��Ɓ�gzCW�/��O3�A��+�`�&
��A�x~�`O( ����wǿOx [�
- ����x�dG��v����#a� 3~��	 ���~�@��-�����|��5u���3�ۧ����� xE��� 1@����݀�����a.��OF5�
 ��y����
$�	�wmz�� �Vߜ_����
�W����?��_���y8;�rs���7�����^eZZ�8��	}�-e�����P`�8����7��yCmua(����
�ɝap�.�
��S����Zn6N�ω;zR�\P���]Rn���);AQ ����>� �����z�Zl �@�C hr ;��<�|�lx��k�D���k���i
-�����L!l��
��ޞV��z�n
ˌ�m<L����A�x��pVd�,!��S��ϯ)s
��2^�m7���hJ�k���a���a�oz��g��|M7�m:^C�M�K7��NX�m�l�n
℺���^]*�5�%s���6�6+D5��(�5�1.�`˃dOR1c�x�q�H�yM

���\3�'r���
-��.
ƝM�.�
-��S�R�R�c
�
~`�S���N���Ua����B;z˩z�"��pS��^%i
��݋�+���B%�\z`1�!��}.\��q��sS[" ^��)D�<U—��r�jiB�
�ek�I&���ǒ&,⹍��u-�M�Z�ڗ��^�|�e���uO�)w��u��ne{ �}
���
��o�%jhe�.-�j_��
C��1���
NGO��[�N�l�0�����⚃m)J��X�|
��
p��~,�=�Z>�P�2%nO֨.�q�e1���|Fmu�h
�d�����
���F��Fѝx^��k,BY�;m�q�I���
)�O�>['���2�{T�ɽ�K:���&�{�A��o��"�ځv#�a�B����fBB��@��pWS���>�f�o����@�s�2
r!���Ar��da��6��S'x�	��C�I*���7{��M�T
��cP
t��Zm�6ٜ
fW�z<��I"�y�+w^J�s
=���� �-H�9�\�/��B[�w6�b�Q�	{)�
+�ȸp��5<�:Y[��^���|g�s�4�Rmb�9*3�P;�&����qc�`M��ny�?���2��M�[E>meT7.�v�m
�j2[� �{�TCiχ�@֡a���=�^D�0|G���M��_W�xiз��[���x�Y*�R����/�z�Byc�tc��X͵��DF�;���l{A���9G̒M*
+��G����` Q��Qd�Z��m�7
�z�!a�^؍�
fԿvC\��@'I����T̊`�OV�δ��q�%4�oh��w�9��Y;>�7�P�e�L\{2�v'�.��+H������%U��j\�o5MڈN�Ճ���@�l�!^���7b�ω5���t1۬Zk}���%��S7mj��}�
=,�,�
�����-�¬��;�M
��
�zkYSuI
x�
�s�>�̡>�#���	�7�
�!�$�8.�C:�
Ļ
�t
�}h��
-�
��0f����Խ��I�\JK���yi��YVI���a�k�B�-��y����n�\� 	͙�O$i\��|�:�c�"��¤7-Ǵfg�|_��
̌�{��#�C��}����̱
�)�&�bNp���K��;��SH�&�&�-�C:ƕ�K6&6�R�9y�ofcR����l5�ॺ�4|cŶKԢ� +\Z�5mƬ5�m����x(���7�P� ���<�J�4����)H�
F;\J�һ�<�r���
�Em��k��i�F=��é�j3ؒ���8�3
�%�a���*�hL|\n�4�$<�X�Ev0I	��	���5�Ʋ��]����(knY���,[Ec���4�R){���G�7�7&D�H8k�i�(�$��:����o�������	
���a���JZ�LϼQ���rJ�w
z
-�	Zv<�Qǣ�(^}'�+�rS�w�[1���Z���|���ֹF�gS��@KA����͏��{
�Z�
1���;��Ĕ����^a7l%d��~��e�:7�p��Ȟb81{URi�{�6h\�u�
S%����G�`Sm�����̉�w�i��T�MW=�Rߵq\,��*:U'oy�5V�S׳�3D��*hm9=]�`
7Y
0]��k�
-�U�� ��n�Y��k=��w�baU������TUf�CM�!E�t�C��"L��F'UT�INŵ�,�������R��{f�E�᭙C_PB�9Ŧ���.eL>���q��
-��F��I��=Nǝ�õi��WW���T�� �ގ�v=����и�Y-�O�z���҇d$�Ⱦ@F���R��+M����6���J
���s��?�vܪ_�8���n�؛�.$���ɚ�NXA�r
�L��W�X�M0�c�UU;�d2W��>߄��9X7x)(\��=Cn"�X�1�����
��lQ	�<�
-]�>��B����~Ѵ�Ɠ�˸��Ak����CO]I����'h\0R����Ɣ�jI�ٱ�唝i{+���Z�Q{
E���8���R���QH�d�N��L�
SrxJb�&>k�x�X��4RE�K��m+��
��͏�X4MGa�{��O{��/7�yI�.��
�9V�>�
ځ�2ߔ�(�t18���<�Ƣ�k�q�}d�"Ut|
��X��=J��D���Ƭ1��
1�֭[J��"�d�A�U�x�ʖe�
-�n��O��/���������C.pn�^w�뜱'���|�mT5�!u4,�%�jء�}L^nT=�{3W6Ñ��j�0���������:�����I,8w���<6����FJ�5��%q�}��E���nY[E,�6E� �:��T�IH��ێ�Y&�a��s��o��π<�t��������f
�)�i�x���W���
n
*M}�4���;#�d�
]�
�i%���t�������u'�=]��O^3Cb��LH�M�=kh��3�췱��q>G�{�/>ܻ�s�3s(�k�:'�٧���&D6
3���t{H�q�ȿ�J�$�����b�
���c���38.K
��wx
�7S��I���K�Tc�
K�ܠ��W�c���&�ud[£3{��`�=\r�^�g
�Aǫ�7�pc;�D��[!�˯E�՜�>��hj���Xý�V�h^9���Fz�,n��u��������I-8��H��#���<YW�Cp�z&�kk�����v�|Fs+�4�,���B�z�y�du����\w�~���L�߱�HDNL�c�'�r�:��ȗ[	�{��BjBj��7
��G�Jنkr8"-$,�uJ�C������[z
�Z�-
Ė9FK讈ɵ�/��H�Ax�8-�m�Uo)�=�n]�D�fP�W��z|{uEe@��0-���Œ���9��N�]l
�7
!X>�^���ȴ��wai�K��ئ,��Q{�e��U��_
-P��1�T�EK
:(Sc���e�Q����'BKG�l!�Z�
0�lk4�/��As�!����Ef�
���1f� �6��)9�̈́PlE�F5EEڳ^����e�BW��n
���z��s~��j񝣒��-��
���
-g��N|V�>=��YD��q�nr��c���[��L��?
�0q��
P
-�i��Ld�T_�'�p>�s
 ��FՖF|}�^�K "/��
oe���a�G�١���q��w��6�ͽ��`��9eL�ƺ��f§j
ǵ��ȝ7�Ջ��P+f?����B���+i����
<�pn�J�=>��N5X�(�̭C�����/
u�Z]�;+�C�����
�6�C�L�fC�[��g�!T�xg:-�����
M@ Ô�U��Ť�8����Y���9�0�=��C���W�����KTB���Ch����g�L�{^l�8��p��l�I�%�
Y��rm`�tfFY~�.����Xk�z�
�¶���-�ɯk;t�@CPh0�b�p�+�B�G�;Q����ߪ
-�nxA��Vjp4
-�.��`u�mk���w9��"*�\M�ҥ��\�,�#���d�e/��̐
m'�l7N[DO�bq�%�%�?B������h��؂���/�*��^�ײ�k��sY,�ڭU��
K���Ɵ��-O��ƕ�ט����
p`q2�w;t'
O�WojF�DjI�z�����wzN�z
g���(	J�u�E9�lѬ��>�
-�K9���� C�|��l�1Ej�g��M�=\��[����u�
	m�?�2L�#�IN��i�^Ө!�
�u�n�ɿ�u��U��gX2�(��u䴧mL�E�9����!/��u�����^+rb�?RIF�S�u�=�tC��땿��i0�>�
����4���X��.^jw�L���kirB<���P�̾Y�ynU�5�4'��"��S6�`[-TJp��I�W[c&f"������Ϥ�F�
V��d>��\T�EL4-�,�	�n7�TS��,�,��}ŷ�zza�y��?HC~�ߤ���M(�1��m�2ұ�׬�w�Dm���@n��
I�����c{jUu��r�����C��pE�[ߞ¯�?��бr��W�u�,��cDS�m���3Ť�ޕoW������X��j��Ŋ�P�t�ƹƞ����QʝR/�������n
��g�0�ݕw}��H�d|��Z�a�dF��w���O���=
&GV���}�Q[r�B��e@�l�M�tlI���C�s�����]��� [...]
g�g�e�
'i�`�ѵf��ǚGJ�t�7#��b1��$�
Q���雌�Y�O��~��
g�9U�f:{��Q�Af���	�4J�:ة���m�B��l�:�+i0IE	l/��Ъ����.��Ո�Z.5

�;%�5��bH�O;w39w��dX$cj2
Iy�~�_b
\?
-�8�g
�IQH�)@nQ��b�eV�(�v
���@�~Te�h�קz��"�[�������V��
���amO�tDJ?#7��gO#�`����M�'�ە�
��E݊���ˠ-��2��2��Y�=�s��<1y~����@KT�����1��G�t1>
������Z��4P��Qm�qJJ'I�<V�]
i
y�v/(
EI�"�wϦ�����R��u�.Z�&M
��-خ�#˰I�i�
��~�Cݒ%
غ�=N�0.
�h�u��ѶQ�a�'��]HM��cZ;���Ϭ^�G�^2xJ
8G�tuk��TJ��B��ZFg��P%���y>.N6k'�����=L]I�I=UllCtqܗ�
-G"1���½�&
-�05�
$ۺ�R����@|
o�.�NzcX�w
��ǻ%��M
��������w�<
-Z]]�6�ϩ%���!@x�c����C8�Э�����"�;����Ѕ�
-��Ȩ���[�Y������G!����}w����ڧg��RӴZ"� G7/������O#���}�]�s����PW�䇖W}�c/
-�*�f�
vf��B�l��@8�oN�f�V��xz�'���:V���%z�ܧ,�yq&̷�@?�mӷt7v3Y[��+\��E��blu�R�F���'���~�kS�[l��N��ҟ�\?�I{�&Z�}�UrI�
<
�_�<6jO�0�����D���7�Ie��!��)U1w��R�����h_��R|_�;���y��1)n��zO��� �6��L��$ 
��)��%����RFq!����ltp��x6A��wU�D;����r>�M�E��_$�vY�R8��F�4��[�⡎��������o�T\���C�~	E��G�B5
HL�V���Q�0f�>�ק͊����K��E}JJ?��W��Zk�		�x�f�Upkx*?�N��#�Ns<1iҏ䛅��F�k�E��&cO.��{��hn$p
-M� M��h�
��i��I���'\�[H�`in��d�̓�Y��7�Ui2�H�v�J�=�a� �#3�;~x�}q|�s`|Z8ڲ��lC��.��>�3�Y5�I���~g�N�
_�w����
	��jXi�)|w.��,ޡ�=�)�S
-�6�̓��l���~
-k�D��0�0��@�;ﬞ��� �0*k��H�z���EqBj����V��l!�V�M7�o��/˩�/�`H���
�˦7����ǸFI�
ԪU�SX;����1��[5<E��9�1�fԀ��i��XO����
/����_�2
͋���#��O�
�?��=4M�M�Ws�J�PvGL��OJY�_��e0�̳�o$�/��uB���8��V�B�x���M�|O�
���&�k<��v����Xo@��4�L�_�*�v:m<
-endstream
-endobj
-19969 0 obj <<
-/Type /FontDescriptor
-/FontName /XLOABE+CMBX7
-/Flags 4
-/FontBBox [-55 -250 1289 751]
-/Ascent 694
-/CapHeight 686
-/Descent -194
-/ItalicAngle 0
-/StemV 127
-/XHeight 444
-/CharSet (/f)
-/FontFile 19968 0 R
->> endobj
-19970 0 obj <<
-/Length1 2250
-/Length2 10984
-/Length3 0
-/Length 12226     
-/Filter /FlateDecode
->>
-stream
-xڍ�T������.�kpwww('8���n�]���B��E�;����̙s�3�]�ޕ����ϖg����J]�U���
,����
-d�H���9 

\l

�����7{�娴�`�+��Q�7
)(��,��=+�89��@. �W�'��������T 
�XT� �N�`WTZ)'go(����9�
� �� ˟� 	0br���l��-@� -'
���.�m�ܜ��===�@�lNPkQF�'���	vC=���?R��
��ƆJ
���r�r�A��g�=����l��h	�����j�`��(+�G��Wq @6����e��#��� 

'g��7��`��d��ܼ�X  G�?A��N�� �
d���'u@VB z���\-�g7W6W��9�����2��RN`G7W�?�IC�`��{���\;G'OG���� ��V�a��̮�qq+H���,B�[f
v�pp����. ���
�������?��9��:;9��� �A���?��� 0�
����
��	XB,� �`k�#��ޟ�`������x�8������'��	�tr���[�������)H2����@II'/�/+'7��S�� �����q����%�o�J�A�����R���	 �,����L<�
�������N�
0�=��
<
�_���[���������s���H����O��?
-�9@���x
hw���Pqz^������*`K��ÿQ7��H8Z����WY��R
�fa�9�o���C
��N��?�
 +���_���Y�=�+����?o�?C�8Z8Y��~�<� 
-�F}n���
|�SK�ן�
`gstr{6<���r����S^N �9d~V{�����?B{���$�������� ��,8y�	�������r��c8<_��3�ݕ��ot�N�?����
��1�?�߈���?�����F����@-����Wg{���� �V�NN�׌�/���&�la�d�Ǣ<_M�v|����E���qq����
�=/���o%�=�o���������%�?�����7�
�+� ���G��y	��F�������ßo����7���߁�Y�;>K
��� ���u�xV^RWȟw��?���
�����+�Y��?_��+�@]�s�
-�m
�� �d�
�J�������t��DJe��	^�^I�~��Zޔa�_�|�=�Ќ�1Y������Dͩ�vԅI����C��Ar2Vm�7�.ot���?�v+����c���x�y5
V~�>���Sǫ��P9��c
�n���<w��э�
�	�������W���'J�DfT��X�R_�uθ�Y��jmN�
�WĆD��8_��|%��	�}�KW�g�⬜��Č������s�y����cFl���%S�$�8R�0��:!��	���?$���R�TB"��36�����p�
�@����(�V��
�e4X���5�K H�Zh"����F+��q�ǀ�=�OFSV����!�\�]P�OU&_����g� F̻��k���j��<f�=������&�c��Y�\/�bZh.�x�:,�S\>v�
Rj�z��՝"w�!�­�G���E�M���6�l���I�Y
�߇g"~�[

*���;(�ۑ��!����� ��b#W���F����7M�O��=�7��
��P�	�
� ���<
��7ē�-�+��S�q��ۂW����%R�����h�.
Ӷ�ih����j9	"ߛ�{}Dd���2sw�K�ik4�/�8Ӥ��dk�_:����vi(���p��(��a�j1RG�+a�
�Ax�z��9յC?Bi+!�i,�8w1��s-VQ��*���z3�"{���?W6�巓
�Q��ΗתS9
�K?<������������[]�꿗3����"w���L���
?�7��8ʜrlkk�8(�I���|{wl/a�6�x�9l���r[FsL�ӹ�~�P
-&�/�`E���՘���
c�,�
��)���F�J�p�8��Yx..��ldl6��pF�Y���<N��K�4��5�ML��ֽ�m�+��=k�Vy�"z(����7����V�
��
��}�&
jb�+ц8oGTiNj�a��=?������;������A'���a�sT�1��Uiя����D#�Āۑ'��|��Y�.KL�dL��T�^��;�j[�u
v������,�A���8k�
~Z|�,~Q:XMQwk��Hx�1�X�}b�-i�hj�1T
�D�-
��Ki�z�	�~���
%��U��0�z�S]Fy�R\�b�+b�����6 at x���I����9$��҂���u��"�z�6/�4��Pq|[�أ?T��n�7�-�+y
B�T1���_�� ����dl㐾G<�8�����y����������
hE�[�
v$j�ð\�w���rn��S�*�vK�
�����R5_�B�||��a�6�Ч���f#�ɟL0d���.��B|M��p����മ���R˧Vύ���o���L�}c
�u�4�J�d9
Mȵ�cg�8��B"�_�V
��xQ��_�R,��`��3�����|�)�1����-�>�
_�73����_��
�~E���쳙���)$��k��.�}��*JT�<�
�DV�#2
��򞫆�������K	4����T�B�h�Kk����t��
�!

mg�gVvR�HxFA��i�^�1+�"^�z�?*� �����p��=#ncc���J:uj#� �3����D_�h�R�}g�W2�d [...]

L���
-� �s߇���zǗo~�T��j�x��.~g9�z�I��(:5���Q;@�{7mƎ�8��oөQ�ISg�%n�7rK������,�Kz�l �IPf����J(/�`Dzxm����j�e��De^*��I����w�
��~���q�Q���4���g��2s�r�"Ӈ(��1^�tèz�����Ȑ7uf#bx�n
�{E�
�PNơIrʷs�[���j

<�ؽ���� ��4�O��S�n�z���œR���|6��t�cs3���Hr�Ѻ�7�WTO;]���]�ĤJ{�H�Y��z��|1�
-*L��
~E
-��LH

�k\B�B,�� ���Pƽ�p���;
$����A��Q(��>�IL>V���w}�xކ4H!}��
�|��ݔL����	��&��F�
ч�
O�!r�
?6�%���e���W�
-�¨X�Ǐ��6A$_"��e���y-X/_��4go�!�&�p�!��H�C,�*�g�y���\��1�[_=C-���@+�>u9v���~˝�e��*�����㺑:em�2b��nc��bov����.sNz>���y���2�	>~hRmAA�I���E�u�L8
w�y����1Z�K�E(�<S#�0KР��G����^D�Ҡ�<ioށ^��c�I̟;�O�#���b,��w[9=`����i1̚�h �x21�T�榻�%�:=H(���m��{bc(
�sf�!�#���N;�{q�%K���R����xD0�����e*j��N��"ӳ���$J�Y����_2}�ٵO��zj�
-��Q!��S#�sͯ�
dv0�]ᷞ=�#&�O�9��|d@����
U˥��
�j���z�7�i�3��=;$��?��jJ��}|:�|f�q�|[�<M����#D�7� �Ā[x�l�B��lh����_������
���C���@98�����
�}�85Y"&|8L9qs��_ *=�寡����+k�uK����$L�ꍀ�.�8���(�5�Ъ}ɏ^/�X�W�@M5�7a�a���c����>��C#� ,pK�ׯ��b	��8�(�:���x��_d��^�m��U�
+$׮[p[
��n}�<�xkxh�
'�OQ�c�
m
I,S\�oi�;�Y��iis 	!]r�Q�

����n �0!�S��_xf�0���
-`�̶
��
�!֏�
�a��S�lP�8a�-�
�ä
2���4�<L��
��Yd�-�2ȣfȩ��H��l�st����8Qw�Q՚��d
���������1�Z��0�&��
�Ix��_>�HP²iEb|��q�R.
*�Mg_��N��U��Kl�D 
_��`	ڞl�6���$3��4�� �6h&T��ӝV�Z���y��K��>��W���)�R�pwK�zJ43
Y��4��N��:����ȝ��+ib�U.��2�U�o�ba۾������.�����6[�z�{:�x����:fN�
iE�ti�m���
���IJ9'�+o\��D6�\��a,|�q�feK�Ȗd+�������+�~W�s�q�I�M΍�ZoN˷"�CƉ�u^��#��
~|��gfk�ڡ��O`;��7Q��#T�����~q	�?݁�Z�4֫�5kg���9�E�x��ya|����N/����e
%13@u	��З��<���2�J��>'��c�l�F<!�\���h�)�||�:"���4�ug��ȱ��_ͰXPm�׌�N\Je���..!Y(h�
�_�k�l��I�|z�F*2�-
����+�
�6*
���/���":"��.;
JekIty���c.���‚k���h�
e�N6���P��_/h��L���
-!������vn��[34���1�.	����'�u]��:��`aR��Ctb��f�N�m�ڒT�T,ư>�$��C?r_6��߿ms�qP� HT
V�
_����I�q�/�
-����S+���Po�h��A�
�ż4��PJ
T<�ݘ0���ow%8��~./�x^䧧�ޥ1|�"�,3��xϠ��
�õh��sa5M6�/�ߖR��N�7�kx)ep��
���Z�z� 
U[ң^��+�%#��>ZX��=��.���4^�IQMMVlA���ʴ�y�E	���ZVհ�">T��F�i�EZ��[O6tw
-�;	
G����֜=u��z\һ ��PH�6�j
�҅��>9Δ~�a�׋�>Lo�:��0!����êQ"��1)-��3��Gæ�(
���]��n����
eگ�K	�˾z�Z�cޝcl"S���_L�Ω�$N��d�dX6�m�W��[��-�eH�
�'
-[.əy uN=��)�'�_�W�͵	���
!w����`T�TJƧ����1ԁ�9J���mvj B�<�5q*�
-e������l�i$
�:c���A���Èk�����K6�a3/��
��ɜ.����
e�nz*D��J�BC�uCe9�Gt.�N.��tm_h h!�\vAI0�
/^�������0�����w(��k�^l>‹ά@�g���
P��K
 ��Y#]Sl�f�z
cS�?�9v�a�=�=��L��������+�T���>�sԣ�!�kv�c�����,5Yfv��
-��G�_�K�D�ī/0�ݖ���
ʴ���
����	���1kMz}�mP{��S#_�u~��} b��=�p�\�hv(�����?+g�"����\�\���7`��L�Qg��4ø�Q?;��
�
 ���ȧ _��n.v���ː*�\�"N�]��<S��Pm�g��Ew�
�DZ}�r��ز2�EP�
Hh�
]��e����P��<b1kJ�{;��.Pb|��W���M2W�!Z�#`�����,����=�{5�
��xa��2}S�I��t����dUT��~
��N
Un���|�`D96Ȉ�;!�
-'Ag
�+��ö�byU/���W>w՛��c��]�D�2�ܭsBW���{�@_'9�5+P�\���_V&�c�o�e�s���Yg��
-�`���Oϭj�׻X>����7:�Q��Ae��ת����� �M3�6A�Wg���	
�n�� U��
-�P����
yce)�]��8��6���('�W����Rso��w�]��a��;wW/,��Ix4�_����Vz˰҈O���c;��+��%H��?�>dF4G�G�����G�`�-�XO�z-��p07�y3;��(�&��0�y���n�-L�ꊱii
���RF�”���Zd	[�(�~��%���OM��\/m�����s];��{|�[��˺]ىq�D�ѹ0���ݡ�K�4}��$�$-��(��?M7��>�����MzaR�����+CM,���b��I͍6J1�����}
-�
-s�M���"-�[H�
xsەµN�dh�
�%�)��A�G
-S��	2���=�N�X��׺�7ڶ�:���-ݧ��'ۡ��uޥ��P�ze]��NV8^`��/�i�&=J�%�W�y
-}���*��ɝ��?�z���v��X�#V�����\�9�?�~tǕԽ��m'�|��<�–���I���U���/J\�1��?e������^N?�����>�aQg�\#���2A�C�@�
�e��K�Zy c`t������]�[�~���,�j�L�A3l����?��sC.^�ޕ��INSqi������_)Y
g�YD�E‚2;�7��i�w��E^h�/a��u
�3T*	�U��NV�\XXd�Y�M�3u��Ԗ��U��4 �$^�
[�e��u��!�:�F���L�y�ӫ�Ehԝ�M�lqm$\S�i�T�
�
�G������H��j
-��Ŧ+�{7�)4�Д�,VV��g��~oi���b��od�W�֡��>!l���	�İ�X4
&�ϝ��7 Y�)4y�i_�nyeG�W�mS!YL�A�]2GƘ�U��S�z9H�N�"]H�BJ{��,�����W
�.��$lEt���Ԗ_�/!
��~��7�I��ԏ
��8'*0�o�D
-����|{a˜�&[�qV<����:����c��U�V�9�	�J�M����Czq�����Z
4�pT�ˊ��r
-�>�	F���2�y��L�C|��Ѹ�/A��)���Ryj �z�Df��L3i�>���;��
{���4�@`�!�F:Y1�I�k����w�'�O�#~�Ki���
0<
-;�[Fr�]0�����(1�wLyU�l�-��^�ѿ�Bn7CuI
��5�̌��,�Szb�ֈ�5O�]�x�,ϐ�r�!X�2���'�/&�,���l&�PB��"
 ߸4,�aa�r4eY�u_S�8y=Ō��Fr�&f0n-
������t.ڎv�H�+J��5�Q.o������$�Ob�|�w��>U�D��O
X�oci7��z��6E*�Ն��l��vd��M�����	�ڥ��p
~������x��O�թ������O��|	lh=�YI6�e�YQ ��N?�wՊ,��j�|�{��*�V*#���/�v��n�=�cd�+��D���+�ob�`K1]�g���r��ԛ�
m�G�,��.c��Y�9&pT��dP�5���P���������~�3���ڪ��5��(sB��!�fCP�q	f
6
Jq_
0�eȬ!"r}P�5bn��W"��G(E���pm��Y�|�$��Es�qvj*2�Ek�O�;V���&�}*�
��f6
-�5���-�7Y{�g���i1��4�!��O�
��r��4 ��$��O�1e�5�.%Hp�K�+y�N����&mk�20�u�Q���j�u/K�H� �-s�W��Ry���5en�u�����|a�M��h�¿�s��sT����]
<s�ʧ����5���C~^N�dM�6��|WV�A����ƒ�q,�"�ݲ��㎉�0�x�n�Y���"��L�f	�|��#�G����ZI64{�G����]�S [...]
-c���"2�SN8��53D�p/
-�~3�*�z�
��q�'�{�v����d��(Q�	W�I
��.D&��+l��X���Ln�W
-P��ʲGra��4�Q�}
�o����]Q�
�)-���
�u����,,�z�T�Κˍ
�5�_�9�ճҥI�X�i��
��T����.U��L'�u�B(��&>.�;�� =�F B2�h�?M^��F�׍!
o��.���|FN<��o,�YG�3R
.N���j�v�
-��dp���%y�N!2
\���e˩m�L�Y����!�0�
-��[��tGR�A���^z�u˺�௙��+=�S��@�O�a�Ȫ+����z����E®/27ٴ
-�̃�bPN]��&�iN���V*���]�~����N��U�+(���v�e*G���WA��ߙ��	Ѳq���
�Z��Ʊ*�yO��u�w;�~��� �n���mM��V����x�̈́�������zt�=d�hta,��fȰ�W���z�{b�����>�����`��ꗧ�{�#���ek��>�D�Q84L����t�'
$���S�E�p��q�
�y��t�ۻ�3�5vD����u��:�����x�5k�k��dHK�����&Bzl�F�S�Q}���X��;�׃�<��
�W�e�/�lc�i���Kx�J�%C��4�����}?b�J	+d��	ſ�3ao��44`���nAc <��3$1�#Y��[�����Ƿn6,i%�45Cn�ߏ���J�;2�H
-L��lE-I��RB����
��Ù%�I�梹?S��Y�d%\!�Q��(�j � *B��	` ~
-��?�IQ�G~1u����8
ĝ/_>܀jy�Q�xr����\׶����-G�)~Tɉd��gt�hP��f��"
r��-
k�'Ĉ�KL��\�R�r�\(O���[ƙ#BU�?��������І�H\�|���6���q)y��
 V���U ǜc��a`v��t_!�:Ά#�[\d.��00��a��h��Ó
_
0!�gE�+��W
yu
<�Suw��\	J��o� <�ɇwU����.
���MV\�l��V����!�i�w�}�&i	:W�j�y�j��������8������m���H�~�NLwX7P	9��`�-=�
���sH
�*����,���V
*�`��Ƴ4��{��ہ}�
����O�������@�CceK����w��e��dIC��b��!8
�i��$��3Md�l�7����
��q}z��I.�
35h|&�{�"�V�>�����*]��X��I3�"d��Q;�ygRY(\�;�
-/4w({�1r:����}3p��W�aYY�а]avgoǮ3c��%�2�p ���1e�bD�tj�v���DC�25�A��KvI����:�i��q��=�K�KjJmC�͛ٲZ��#>	����+����H�Z@��/�ۢ��Ȃ�����"�
@P�+=�۰z=�"Ԏ��q#C���|V����0�%K�٣��؉�ʆ�
�܋L
�H6�B��+�
S���lķ�z#h�\+�HX'�
��gh��#�W�p����o�
-_�Nl0�l}o?�Ew�`z7G]��&��c��
?��}
���
��i$癜Y�'�����v����";� �NN�� �J�6v(��x�A�
�E�6��o���D/$m��0���d"��6�|b�F���ͦmu�_�˪$ܵ�ۛ���ć?,'��y�
U4Gs���M�E�)���P��À�Ҕ"�L#C�:��ayH_��Ȣ���~������^ʹ�AWbL�|��W�'��=�%H}ˋ��/�����O:����4�|�aR=
�Q
I=��_f�
-�>��2o��
mu(��e+u�?dtoFY�U�3��X��CK ��
H|�m)u	�\n��3�L�$,�w;��(�`�i�#_
�j8��s
-�fE�n������
���zdM�n
-S{�
��ӯ8�2�};�oO�N6���IV�SFeo^��
-�
r���ۭ
�0Zդrb�ݓݍƖ�"�����Z�������Ѓ�҆��O��b���k��v1J]�N	��:�w�t)�l3��wj��p
���oE����E�a��Y��E&b�F:�9a�5<s,�v�AF8uo��/^c�;i�����{�0��*
�qT
�Ǵm�ֆ��
-ʓN\��ځ|���>"�L�_���`!oZ�
N�W'析�,EBy_���N
�m)��Ř�v����w�����>-�ꜷ;�/�z��!u�Q��ك#�7�� �+Ȱ63n���3u���Zr�<bӺ+��SZ@�E
[~ �
-�.�
��!
<#|'�L�$�"̄$z���\���jg#MZ�
is���oo
(��9�eN�3�E��zm
���ݝ�(�۞2��e���7XY�$��`'��-
?o�?Xa:HI���E}�~d������-�'�Ą��O�X��62�!nGbV�cS]u������C�M��Ұ?6P��| F�R\��:mڧ�K�l�a���ځ�5R��L�Տ��g+#"����
-�;
�0
��7�ߝ�L	BbeJ��
��7����

���ڰ�'���
G ��b�)F�s��k��0�֖Q�mdק��3�J�|���p��,��%F��_���Y�Kj6���R$�gt&�Y� ��u�-t)��ϵ�R�!b�j��`��y�
���&��=����
�y�h�,�Ƽ�V�$ *�]
�����$H=#�.ϥ?�K_h���5��
�S���/<���?��d��G��\�p

-:���A�3=�*
%��f8'��bA����6U(ʬ��٣Z
-о�-��l��d)��TX�e��
Rh���ٳ�N uu��q��Z�0J������#��/gt�X�wϖto��,�]śt/�	�3]�Q�o���T{���`����@CĆ�d(�T��HR��w�	�x�0�i�
.
iP����kBO�@�
Q at gcM
ab��4���󐡵E�
�44MLpC���7�KI���x�ȡ�p��[umfO}����Ir��݈	;>���qwR.��Ҧu"}�Y�˛�iGu�j�
u-�&[)Q�nw� Sp��0A��jS��El�
�ch�u�
����<D5.h���'�ib�1��S)�&|si�<3���ա�Ӊ��$E�W~sh�ݭ�h_q�Ƽ�\��%�Qƾ�L�W�8f�#�
�М|\ �Y8˶���Tܤ�DZ���1�+�c�å������^��*��`F"13���/��]/��;m�
T����Ht��RI
-�?�K�-�.�5i��/��J�k�cu�j5Ʈ#�R������t��V��9�Ǟ��f�J0*�-�/�.6��I�r ɽ��"etL&2w�yCٝk>c�%�M�HU�ٕ�K'�ό]�	H�E�Y@���jٽ�Y����SΜX���j�k�6'mLN�q�)�
a�w���%�^�f�o�~e.�w
�}lt��d�� ��]9q�9(��0�ó�~u6����;Q���X�f8����Η�Z��-��=�0+��HE�y�
b�n��Tm�&t#&��)�tƖ���#�ȶw�a<�֏H�
-q~���%:�����o��4�%W.����ц����xI?i�:/
-��sxʤ��X���?|g�{?WO��a)R�7gE���0�[�9��	1�i^L�c���C
-�R�%�\��jҦڨ�Y�p�g%c*-ɾ�y�Í	܎׬��d���s�ü8�>U��[�`F���,H�Y&����'x�?�������,�����"iO�Y��C�+	o4l��r����J�R.â㷲������Q�!!�>��
��]\r������-|)�c��IC�?S�Z�~KoZ��J����T��x�� �Th�%u��0@��?���|&_w%��3����M��Fށձ�ا"�dHv�����1$T�J� ��G

-endstream
-endobj
-19971 0 obj <<
-/Type /FontDescriptor
-/FontName /XGUGIB+CMEX10
-/Flags 4
-/FontBBox [-24 -2960 1454 772]
-/Ascent 40
-/CapHeight 0
-/Descent -600
-/ItalicAngle 0
-/StemV 47
-/XHeight 431
-/CharSet (/braceex/braceleftBig/braceleftBigg/braceleftbig/braceleftbigg/braceleftbt/braceleftmid/bracelefttp/bracerightBig/bracerightBigg/bracerightbig/bracerightbt/bracerightmid/bracerighttp/circleplusdisplay/floorleftbig/floorrightbig/logicalanddisplay/parenleftBig/parenleftBigg/parenleftbig/parenleftbt/parenleftex/parenlefttp/parenrightBig/parenrightBigg/parenrightbig/parenrightbt/parenrightex/parenrighttp/summationdisplay/summationtext/unionmultidisplay/vextendsingle)
-/FontFile 19970 0 R
->> endobj
-19972 0 obj <<
-/Length1 2316
-/Length2 16820
-/Length3 0
-/Length 18199     
-/Filter /FlateDecode
->>
-stream
-xڌ�p�m�
-�l��Xac۶��X�m[�m��Ѱ��4m�6��W������ޓ��>��lj�^k&$J��¦��@	{;zf&
����43���������B�����s
-
�����
�_�N@#��
HQ�� �j`f0s�0s�01X�����h��3r�4�3 d������N��.�8�yP�P���9��1��,M�� �F.@[PD#����%���\P�Y��8�02���3�:3�;�
P��-], *@g����2@���oj
 5
K�	T��\܍�� Ё��	��d�jg
-t��T�� �@�)��K���� ������ֿ
Y��cldbbo�`d�iig0��%�\<\� Fv���l��A�FnF�6F� �R7H+�@
��������ř����7G��n at e�3���ڹ8#��O��	h��'㿛kmg�n��dfigj����������+PZ��:�#�?g�@ ;'+; � z�X0���� �G���������`��4�� x;�.N�@_�������&. c���
��c�ٿ0��N�
 
&��1�~���I4a��v6���i1�������)�W("b��geг�3��ظ �������
-���?�JF����/��vf���!~� ��?L��=T��j���P�
4@�g�u�ؙL@���?o�?&�����������I����#���������������vu-��=hE����&�_-4�t���Ri#Вۙ��������_���
@S%K�
���aciT�w��}񀬘���
�{&֠��Գ���A���O{c h��7q;{��;���0rr2�D ����A�k
-��g��
v�.  ��/���	�w�9��¿���8 �"'�Q��0��q2%� V ���`���@>�� �O�?����_��`T��@��  �����_�
�i�_ZFF#�?'ܠ̍��A���.�AI����F���/��61��A���� �@�e��P
�� (]�?�72�;H���k4��@���AiYڻ����VAP��� �6��,��m�l�M��	"e�{��[�?�]����������_���Ú���h�w+@J
��t��)&+ȃ��_4��/���Rt���K
��
 ��6F�)�,��a�t
�^Z��_�?��c<�l��
�����������ݚ.NFՖ����/���/*��?�v����	���\ʠ�����
z MV��MxC�B:������������X觊��\��
�Us���~�X`�з�Qq��]_���m$n�d��'��7'6�_z�_H�# ]Bi+�L!�)sS"�F�45T�@�����-ɝ�\�S&�S����<[��[�x[ť�xDm���C޶����4�LRY���D�Z��᱑U�¾�@���s�04q�16�Z��B��2��LtocI
�#���
����K���#=��^N
�d��c�B4�UL�t����Q�?rÉ![���5�3,���WoZ˄��z~_��|v�M�֙

-���O���=�m��u3
���P���+N��M}�k\8Dn��zK��ɢÕnѩ&P��
����ʊ�f�^�����k�D��ۋ��[��cm�],z��f�Ofq��3�h�IF}�����֭O�ǖ�ܰ�}�o�W�-���2Z\�=�8��'*$��#�����@�
QD�)X�B~��u ��}'+�[y`����D&@���
���{^��
s���AD���
��4� 6[a��֖�v��n�B��]tn��PK׽i��]E!
_z�TqHA��#���b:�7������N�u���1pW��>�f5�ǻ��G&��6 ~3~�7x.B�Q��84�r�IJ|�
�ے��u��������buHr1ř)�e�{�—�y)�1ߛs�9	��)ȝ'M��Vk��ˑaz���۳e>�v[Ė�S��k���P2Y%�7h�qzޛ#`�[શ�RB���;���
�-����
�mؼ4���T�6{
b�B��4^>�	)��
���q�Y"a�qάӟ>Y����'f�{���!������
b@��>
M=2���~G�G9�ln`s��{ʮ����3[�j|�!�S���T��c�}B���:d����p�zi�&:4\�e�H�hܭ�������������<�a���~�Y]���~�S��d
�.V��p0r
2��c��~l��E�
�,�%�G
����[�>�͓[��ܮS\ے�fp����a[ɍ��>��M+1{�b�a��G�-�J|�6V��4�	�>ɯ����;����E����+�|�;m�
���ۤ��m��T�=s~�!�(
�~��x	ٱOHЇ���t҆�����Vap)g���KȦ٣o/���d�0.(U�y�Olt�l�&�E�έ�T��w��s:B7�b�j+Dm�7���(�|

~`����b�B���w+=*_�"@
Y�j��o
-�4
�9��d�%hl&>=
_߼��%��59�i��p-�<��f?�_LC��6:��Y
�B�C��>E`T��î��'��O[r֛���DC�����I��>�%�4  x��Q������-����S�7���4}R�+�>��ߴ#�1��䏊X�h����}>�p�b��ru6�!�2}�!9*X|e��N
4갦�����`,����d��I�z�9pO\�:�ۖҎ���pC���
ؕ�'�"�2�$�j��SV1v�m
F>�*nȱF�U��e���a{ȸ�h\}���24�
W�\� OU��w<�NI�8D��xR���_�x@)�C�P�
��P*8��u���ap]
-�6g���>�S�W����v�k͘XCY�~�nt���y�|`=���������lZ�:L�VX�
�

$Z��r��-��	�iu�Y; �p�G5)���WϬ����۳s�0�jv�}(+�
1�V/c�'�W{�B
e
-^��:�Ps#7��4�ᴄW2yiw��7FYH�e3��|BxO�w�� ))�F���)�I������
3-V5�i
E
�]鐺���v؂
��A2-�D0��#��F��:X^�f���i�f�4k:f����X����5�I��kZ��{t�?����
��#HQ8)��7*�������2
-L�[����+�*�rb�?G���,��`�)	&4�a+���T��]�<[D�.���64}��nfيL�?G�k?��r��2��U"jcl"����\��?��r��4yKGj���7
,[�}��"
�D?�%THn��J��ml�Ǣy?w ◣
-U:hA�O��p�WK�
��6TA;r���._�!����O���{q+m��h����0����C�h*��O]�A��:p���l$CD
-��U���qn�(D�J�;�9�y"X�>EC�e��SS��+`�j'���{�
l����A���
-��^�%�Ο:
�ͯ���/n��vN����54?g�2��Цw��H?��n`��Y�H)
G�S�pan�X3�b��3
-,�L�k�Ѐ:�c�ՂU
Y��D݄�xRtK(:�~�
u�CNl�G8=���eP��pF }�m6��E�*5h�.���R�����ӳ1�H�+���ۏ
N�pu�DW�:�U/��7����^]�{��j�Q7��KD>#�A0F���i��,�/SH���M1�r0�9"$^��dv$Q�c��m�Q
��4�УYw~i�
J�.ٺ~�"KTc�&�nP,���r�ǎ�^t8:r �킘dulo����y�y$"��j��
�����ͯl(�n^��
?
����n���۴�m�����I
-3yuq>� Y�S�^፻�aC��n+
FDl�����^�K)h
9�u�]����J���7v��C� iU
�;t���JkY�nYS,�y!��yХ^28~ݑc�[����EJ��l�(�Alk�e
��8��.������p���+�w�I]��=S\QU�wQ�t��I�6���m�� �
T�2�&r�ωR��`���Ŭ�U.*{�Y6�L
�$/�<��
���Z���
-�:���4.�?�_i��ں6����x>�^�Y��C�!!
�G�.,�c�U���j�

��Y0�ʏ�Gg�䦢�o��&�����?���'~n@���EӉ�8^�S��ha
Ie
-�C9u��h�4�����7tK��p2�v<�^���6[�zS_�Ԯ	}��pe
S<5"�O�J��'�������y��X=���Ro�6=��Op]���.
��E�4nr��4n���K�
¢��1�+�Zf2��:��}BR�b�r_�}p(�c��0%gG�;�$�^WH.�H-MO��ū��
Mߝ:o��,�^h��5��
���֞�.��n��cYG����Q�2�ꬃ��Y�e���	���	B�
�
g,��N�%<yT�RU���Jk�
��w߆�
B|m5��/�巄���
��}�scV^��ۄ0
��;!�rw$"zBPſV�ٜF�[�J��qg��S�_�諳b�:f6-ܜ�\�B�V���D��X����
-��=��
η�dg(w�����b�	�j��ij0�D�}S*��&��8�wa��ƈ�8�`�����b�ĸ�s0�l�5���irr縄K�-�a�s�h�U��g>����+��j�>;���������B�$�-~�b��d\���
.�ޮ�������E�
������`yc
�:���f ���HF�g���}�
-NI���Q|
�~n�؋�#
�,�V����
'��`xb`��8r��� C��ߝ�+�x��<X��nKI��e]��g�w	m���ըK�̋��=�6�t�W�Y
mO_s��ȶ<��z�ܨ������}�T�Px���	�m}�9`���'m!�?
\Q����PK��E�8�z:�bYí!C*	��x=
ԁ�KCXL4q}�lWW	�ބ�}"i
�į�
�	
���RZ����:�Z�=��v��Wp�ɛ��4A˨��KD4�u�^X���9d#�(+k��(8��}w�vҀ)��GU�<jVOA���0%�C���:��!
-Q�̯.�x皕��U�J� 9
��H���Ѫn`��qcEz�����e�I��<L2iRAu8�d�e�c�	�!lm�sQ4N_T$+z���)~�0�3�Ʊ��Eo�'C��#����Hx,X6���zw���~���
�P�O���_v�MP��,~Ve#�Ud��.9
<��r
�ǒk7�Ѷ�zA�c0t3
�a���N�:I�khx�>����
��xɭ�u����2���JB�]nb$��tX-V�J�/ї}كo�j�d�\x[1�)�<��c9��X�&�Iy�U���7�e2Æ��Z�*
g��
��
�-���:Ĥp�V�F L���ڱdJ�턵���8Ba
�Xxʮ5�J��i��̈́>���\V�n�/�a\�1:���מ	v5=��TQ�x]3e�9�JSU`��mY��)(Nv�b7w�Bz�eM��w�(����#�H�v-�
���K�<�.(�G
0�z�W��R|���<�j{�@rf�/	�5S�|_Z�v�3,�
��Q�Ч���,�ߐo:�	c��z�Ȳp���!%;�

a''����)
J򇿿*���eXy�����\siz��|@��TlL����S��q�6Q�;�p��z�������nE"�
Ǚ=T��T�<�"~����A���H�J
~�%��Ц��)r�	�N��"ny���{��U�C�ԻQ��n%�}�K0T0�מ�X���kO��
X[�R�D�h��Twj4i�M��~K##�!�.z�
5R�a!ʟ�B]'X��A�00�������\f�=S�nh'�h8[Τ�
���q�ݜڃ��X/���j9?�J���Zk:p�9z���
my �_�g�E@=KNc��i��z�d,\�N�S[B\�j,mPU�e��h�GW��:M�3֣�P2K����]t�l��RPʷy�i�'�?촕���
���-B��T'd��s��h:������ˏ��Ed�}Hw�%|T�D��
��-�J��CL���3�C�
-�nR�B�;��AC��~×{�
�\(�����;�'S��s��GC9��Y���
O�>�9�c���}
q�`W���Ski_>A!�U��

��K
>��\� �M�Y]Ӥ3�F�;X�0�\�]1
�'	���4����h�^���#%����U����IOc���A�`�ʊ��������w����
�t�ec��� :8�4���չ�i*�̝�1(z�{$z�B����j�ͯ7璕�48ej$	\���*�
>�����줽�J�m��y^R�r�U���V�m�����R.��GS;j�3#�c���Y�T &2
B6
I�uQ�TU�����9�A����:�1���w��ր�}�(���a?�tx�D�ʊa-w�IF��-�r* .9#κLe�$b�f��M_.���=��ì����
8�J>�@	��#�\��
{�E��Y��4�k���R��R��EE���p��3�
[;NJ�~Y�zH��F�}!
�$��ऊ�|9�f����NܡC���
;�W�n�!fӪ���ف#t
9�6G�&���~��c
$�G�S���[����8�鞤����c_�<�V�O���R
,��i�X����P��(��_�i���X|@N6G"�S�JA
�i���%��22Lj ��(H����'|��E�Ӄ긃��F�����ʍ�0�yܘ�&�QON9���E�$e��UH �@�������WQ�\�Ԃ� �1Գ�Y]?\���n���b%���6�^=���0~���%Q
0��U�<�X�E��7��Wr!�p���
� .Y(~
-�*3�9�2�OI����S���ɨ�I�q1i^�֋�\?��%u>��6�V���'�JŐ0�?���ᤨ��M�4�xVo!�(��ʄ2%\ZƎ���P����۔1�D�҇ �go�1Js{�Vi���?^vg����ڶ��6؂���C|7����,����PW�\wA��)����
����-W�;��
�b�x-�k�dp]_��AS�?���һT����i��n�^1ܧ� �F,�
)��
7.�^����t�;�SR�Uo�܆��x���*�t!
0�,|J���e�8�2�u*vo��\��_�$H �#�

m�����6힜�.{����y����9T� �<3��I�M��e2U�Ʋem�߷�4 �6�s�� �^����"�o�� ��
�>N*S�"¼�m��+
�����g
�ר��<=��j�pnF(�r`�&���cf_�o�xQI��%ɣ}��GM������rJGuʓ:n����R�USY�sX�M��ʲ2�T
-�$�>3��+Om<ő�D5���>���)I��@����S.I��@|�9e]�b�;�
-�
FD:	�w�卍ϙ-ç\+���2��ఠx�y�gxqov��wN-���wX}L�We����H�_�
!.�\d�!�
O&�M�z�	ʮSs�����-J��<��j]��p��9��/����he��I7f�it�̞5L��fKC���=��nj�|�<�kX��#h
D*�!��&�Q�T����0ߍ�+�h�|QӁAG�l=����mN^�SU�2�����@����y�V������گc�^XY�
-�5� g���K�*�e�H���ɅZ|
'��a�9�Ig���秜���_f��@��{ǍQZ� /����*'eL���J��Ks��Mߕ]L�aVZ�m��n��`Z4
�Ԣ'&�$,��&Cx<�7�q�o+:צd�/3��2�`.{Gn��:j��|�_.�������r�x�@�f���0�m�s�8�I�n�w��<&�̛0�?[��Ւ8K������y�
������	E[?�A� �.��F�
lm��
Jc֛��H�zS�z��{p�$�,�v=��|B�==Y��[cO� լ���:
1�W�fǒ+3�Jpӄ廪
��^�,�q}R���
��0�_3�`]�>Q
!��G�^Q���R?f�#U�$��E(l�%����L���w���'9�*�~�&a�cf?��0L@�

-co���1B,4��!
��L��!�� Bh��t��Ӄ؊1"�\QT4i�M~��y�"�
�	�xe$��ݥ‥�Nz�"
�s���Tw�(�
���3K� X^���U]U��_?��
�DgP.s��M1#� �M6[��mP6���4T�D����{Hֻ��8��OMy=ߪ�>aP��;'��M�
�!M׀��S��
N4Cr�Հ�WF�+�Ȁ�X��+�wd}�$���/��![
��#Y���1��R�	��W;���y(�X�^2�Uk}�M�p��	��Jwk�'��N˟e)�Т����~!�:7������n����H\W��o&�3=WkN�<�yio�«���_��8H�P�1�
�j/D�A�4������1ڠ1��Y��U���ݗoƮjҫF�ج��sD���AW���N��
���,���ƌ��Xuqb�X�l�����7UWh1
-�
n4 �?���G f���	
�}�
���\wTvU>V"f���tu��\�
4��������Iϥg�[��L?M�*��)DAɐ�`��q��'
-��
�s�8���F��:�'ڕ�1-_j<�����E�J�8�m��B1GG ��ED�
�HqM7ۺ.�H���[>�ES at L)�����J�%
�)ni��2�Y�rhI�8:��3�����Bz��,�?�$@h�d�3�/���eƄy����t��2�?���KlQ���ꐍP�Qz$�p��ʪ��KD�� �xݗ�TB�PS��>�]�•|̃�oUU�M�r�i~�"W�����Uc�k���?>r
��́���&4&�q
�L��B7{��m�ĭ$zè�����t�k%
V������
�����@��T�8���Q/Sp�^c I_�q
�1]��\���/� :U�n�F��ߏ�����	������e��a'Z�����y��SW\
F�3XՎg�6
\��/�l9a>�j	��G
���كAk����'QƭU9>��}����[(����\����p#	C���Aw��T��ǎ��Kd�1��D���	����h�'O�)�]E$z����𯑏gp�DJf�����"m
-����Su��,8�xdN�c�2�Y�]�g��(��$��t)f͌�W��.�l�"y�	U����p�A�h��>��S�)-�
�b��f=I��_�4�w����l����.�';���
�8j&�\�Z��^�Ѻb�0�Jf�e謏�IRo�LN���>�@�	39Cyx��ܽ��Lp`FJ��Q��*o�屌:��>�Ln�]��<$,�3tk�������Q`m��*�Ŏ;��}X��dzo�����3� R�.Ӟ�TE%��U�z qQW���C�W4�
נ���X_�W�
�^8.q-�rN��+���0�l
����"�
I���G	�a.4����ԛ4J���P�&L�S�����'�k%�����7»��B%�=�
`�u�6�x~*/�W���h�!�D

-��ٻ^�ꛊ.|a���1>�W<����ݮ����ν����:��Ҡ�ѱfx+�>	��#�_��+�>�G�N�Q�t)�q�mݟy	b�{/�r�s訯ʯm
8U���~ԍ�♁H�ܶ\
T�1�F{��fE&�H/�3��82*�AS�|V�؀а�x�>5�Y4�?µ�^F[��F�a�@�����d1�����U����2A���]��3���e��aa�`�!g��;i7l��7~h] ���-yPm{W�J>m��M�'��}��H�APw�v� ^�rEn���i{��\ ��Q�� �������p�����+���
Y�5
��6s|��+-uhID�!\��R��Оx��?p���i�"�5Q�{�TfD1��9����V	���@>�G�Ds��
�����,?��Q��d�10�g?
w�g�>/��c��wL}�5|�
��٤V�T3^����=�F���M�
��6j�e�ߒt���!�M2f�6��K�c|��ɀ�]鵚O�� 2���r���
fp�!�Jy�hGm��̶�Z1+3����r9���X@�|c=�O��
�M�����d�t��/�ή2��S���Z*�P�׻ )+�2�=K�30G��i	J�H�U��7�
k&�$��Nz�|M�*�
-㌞�͢BۍL��#lᣇ ��?�{��[1)x�>8S!�'�]h1��� �n.'�
�g$���_!2�/�c>Hx�À�M(��*!k�%z0��qWئÿ0��̕ ��J�� �
��=�U�k%��n��2C��;�  ����x�Q�����y�3J��U��
�qI?�E��Q��+�~Zd�m@¥sX9Q�[ ����������Z���D{
��n�y�sh0Xƺ«j\���{m�}�'���Ҹ0�Ɋ��

ۋ�g�]F�B��j���[�9���R]G�u����V�"�������϶<!�OS�O��@�:A�{�O�F~��.���M�8�K4L�a�{��j6-�	u
l�FB��)�6�fM��z�����O.C���߂�y}}��>?���`y*��o��P'$�«V�|�`��;�V����W���ö�G�[�++g`BU$�>��c�k�e���riF�ݝ
d��e�a�k#I
_\.��.<
�o�D*�)��
��7�QI+�(��O)�VR��>�$ "��&�U�t�"_��[�u�W ��i&�`Y��j�D�~
�kmL�L ��<M�49}��^�Ą5�1E�y��
���5�p�$m}�r|����yb~���b�IvH=S��a�X\�8�Q̭�2�
*�
wm^�͋��=fBS��s��FҲ�I
-����o�z�Rf���<�khEI�_��&����
i�"\C�/ơ����],�_r�AS�&���/v�:O8��r�[I�
ץ����1�WӴ��(%��� �
MZ`F~��A>4K�{�v��.�e@'J�.���2᱌��)�i:LuV>Q��ra�0���텊�" .�X�
߿.�˚
-��x����c<^ȅ��67,�s�V�aF�󿻵���x@��bױ���\�4�@�i���e~?RL��İè� ]����jR}��m�ЍDB
�NJ\���Vf�²|
�.�
�T>"���U|?��Wg���n�w�@%@R_ k�d�A��c�qPuJ'K�_�U(�@�<�Ԏ1h
���B1)�X�vE�J&C�v�:H�23@�
��㬔B�B,�C�mH�Y�B_A�
-g��i��0��Mp�
�۷,
&��h����50�y�|-]��z��~Ҿ_N��{�4s�`��@�k�`B?r8��><�:3�d�R%j]���E�b�b�sܰRѧ���ꢎ|�%��mv(j
ݕ��@"�7t�Ɛ��-�4��&,p���J^S��*IϕLm��+Jqֽ��)�Ƕ�jw�B��9��*JS�]���%��5ZC*%�I�@V�H �����;����k>�m��t���f�2��E���Qw�m�����Es�wX�L�
���_�B~�i��m��(��м=�G�B6��]]���~�&�����j
޲p `rچc��
�2WYp*�SUKqV�����5�
����%q�E������y8�m
�X�
Ѣ�_�.Z���yQk ��Ϟ̨��:��O������1�~��k
S�P6lB�9�ܪ-���r�ٷh�W2�
�~Q>���x�"���B@��)c�N�s0k;
�.��bT��=�5-
��l^U����+�IbM�R���3�xI:/�Z�#}U�
�&u��e���'��G.�����'E��<�I�]���m�@ρO�O<;
t�b-������FI�j.Ǎ�����IG
S1��|_n��ׁ��V�8Y,��#U2�xv0
-<�}��Q�Q)B�B�����r)n�!%^�úT��FVc�*ހ6�r~���N��r��a.�h2P�Ț���i�io��ΐ�Q岌y���Л7��M� �6����q�T{������9%j�5��G- �jM���.��
��7�ʱ�1�X�i�Ӆ���j�wp'�."ń3+��u=غ��C��.��ћ-βd�3d�K�xA��ah�b�Pt~!�����d�ͼȣ7b�^�
��(�pa�.���u��t�qBkj�G�oH�)�'{OV-�-��u��>��~!�:nzntp�
Ԯ
�5�@U4���V�� ���k�ٚ�qg�r���i@����U�����
�Ɓ��Q|�4c��
�,}�
�I�'d�
ͮ�p萈��A�u���Ň�(�Y�I�����#<@�o��r�¾����7J�1��ْhSy̻A�Ig>�
_����ߒ�
-�?F������޼Z��T�C)4������78��@M*�04v۸�%����9���7�`Z�Q�@�*!Y��Yf�@�f[*e�$v��?���j������eh}6��/=(3}�����V�#Q�-{
-p���+���/��Q
��$���C~���U:q������CJ��:�4�V��<��`��ܢ��D����X�~M
-�~�B�i§����Q��ד��Z%6��F�'aY��3
-
�Wm�⷟L�Z71�3����Q�?Tts�`�Ms'��p�q���4$Q���2�䦘M�`����݀�
�ݔ�
qϻ4��y�˥�Ũ���	���|�f����[R�5%0�ث`�@͒�E�mT�X�O��WuL�N�V(�O� �1���}Y˛���2��=�0�0���(�PG~���A1�@��c�[A��r���oN����s�پIV��M�c�"� .�4؜{LG�)���`KZC at .!	[H�bj�z^t���١�Ӳ��^�P/��T0�҃.
�od�`��\ ��6�����,�Y��2q���
!�oM!׭��
�^�Lc���c��E�а�m���|�
�����$?��G �"
g�UTa�'\'
���v
w�ȣ��Ǻ=�MX�E=�f
i/gl��mj�u�)�ݧ�/�Lߚq�D
*QG侸��i�V��f{����\��`�8�xT���<�ʴBRca�ւx������*y��\
-��l��~�Җ����07�3�����
t���ꧻf
-:�A��� �#��U"��m$ea2
�"~�
Td
=]�t��9����V��G�Z�6�^S�Ƅe��;0d�@0�\|f�D}
-�R�&��.�mb��Ut������A�x�'�e�ˆuؾd-)�}�g�˄�Sx���u���{���bȗ���<&��A�`��

�rIG�����'�z'OqZ#���G�A��
�^�
�EΩ߻���JB��
ܮH�*edM�PQ�^f8č��[$Kɚ��Ym
O�>w�o�K�k�\�mځ}�
-��3\�<�W1e�|]~�yK����ʕ"x�)�	i5C�F	qe(Kj���d/����j�Y6��ݾ5�_��r�G���
�>��3�Iw�n��E��^�{�:k��
v劄<��
-E�Q
���
��W�c%�:ʫ�>�C
ޓېYO��:�}���d�T��;X?�E���D� iK`�0[�׷Gp�r�I4g��R����f2`ACM[UIѢ٩��`f�
��+���
��+|�N�,!�� �r�蔏�|g�����Lb�ʼnk���1���pW�n�E�e��(Ayr����VT� �8<5)�xχ��;�xs�QAԧ��猖�{N-9fR]���<vZ�6�

צ�J�a_h��'�H��D��ۓ����t��~�.m=�W)dB��t܇P�J%U&
J���#v��
BvNYu��X�?>���'ּ�
|�����k�o
%�+A�����ը�M�0?�-y���w;?�����9��I9�����!m[ш���zf�c��
-$ý�N�8�"�|���I������ʱ(��勀.�����l������e�:�Z�(T&��'j��P�LY�C��!��I�~@�Z�u
�"��UV���(��r?p)���!^�p�f�<>�a�-�\	�g1 b�~5���i<�8d�9�,_�x��2�F3k
-��2f#�h���ñ�����&ʼn%����b�
=���a�
X8E�E��>�ҫM�{(l�"ƶ��������z+_ sJQ8M$�uۙ��(�欑.D>i��es�����T���E�l��iA�?���L�ZtZ��KD������t
��|������Fva�Ȝ\Bٌ?��hm\D
-by����Ƃ@d��{-
3�"r�����]=W�40&՛�
^^
�ՀwA����~K��$����2�8IUe���-����N���.^-Uo��jqE|̆P�%���S�`tj K�n b�ܝ�K'}����#j(rVV+��o�f�`:��X0�K��	�
@N���g�{j��1榠�P�u��@���%
-�-�xM��<�VB�����k�jc��5׮�wa9���c=�a�k�g�'��s�wm_�����O���^�0`�V��|��r4�#��>^��
�.E}J�@�`q���'sԢ{�.��G�� �}7��L{
$�F�Nv|�BQ-ֆ?��a""��n�
�r�O�(���>��U�.ȥ����5z��N�_��_�z��=7v]}�|Q?�d�@5�P��iE
-t٘J�T�Qx-�ya�#�JꨝY�z�q�_��N������'�7(H&f�H��w��]eW$�D	�=��[�hg�|xҼא!}ǿ"�r
-��T�OX��)�{dN��������~��F�ɰT�B _T{O}
��X��A?�3$m⋢��(6�}��_�������{�-"�cNx_�X]Ge�Ʊ�'�n��X0@;�7A�n�|� �w��z�p<�(ۺ�JI*�I)��M�

��
	Y�Y�
-�bvo�nF�n?-�0�n at .��>��>��;���$t���z�m�M�1��Y��)]�"s�3;M�

�Ux�+r��\�Ϫ�i��
�&�k	�j�N
���F�C@�L?u��E�
q^v'|���9���	�@��� (��Ê�pt��9��d�9�k�D�m��@w@�Qta�xUe��.d@;O��l�쫰8�JL��4f�0���M�մy|�J�y2��s~�G�a��w���%�.¡u�5�C�hE
�Td����Z#�i;��͹|�Z'�E�'iW����^���:�j��
��/.ɿ���׬�s䉓�*��^�
%�v�
���̘�l�DF8�̋R�݁ꚽ���Ӧ�q5�.L��F%uP��X��aa�6�!��H�����S�
�~n.�C��.ݕts���e��
n�T����jѰ']@�[F���YU��݈�x���*�V��!���. X&��䵭���@��_ͽ?1
cC�
��h+7�œ�~�+�;� F�y�l�.��g�D_
S [...]
-����X����.˺�U����4�~a5c�Pr��@�G��Ə�J7���Q�cv�T��~wb��}�"�r��k�Z����Mw��,
��67�C��Mb��
�
rC�~�]��
�h�rɼ<tgOe5���0��W3��k��Pf�ˑ\
�li,�<��?�����%�i�;
�
L���C�O���uC-��2����L����N��
�	1p�/��Eb�P ��h��E��ү�&US�<(���˙��'SJֽϻt+�󒶀���(5k�����I��b��j@R���)�h..J {Dc���5�j"��'
o�l�_�ÿ*��
�7���ý
5f���W1��_�3�
���E��`s���Gǃ0R�u�?

;]�"��?{u
�J��O|j��6��DA��?�2;,�_�Q+l00'��8�v��\�U�e���s`L�':1Y��Flx�sz%̝����	����zrLaw�y���E�
n_��K9����R/��{���5Ӆ��}��x����5�
��}��r0m����ܜ?mn�I���w.%
�N��U�1�rH^�r�]s4�k��}����=�:@|
-��TbA}(*\��vB������P��yP)7��q�$
j��-�.���&�y �\��;�L�`�Z�
���o
_!	#]������ط8��A���z�j�p��
Ҙ4
,Ū�7f�|��g{5�r�J!x
��U����$49�"B�H?J	�ؓa+0='p1����5{���Zʘ�gS�yC
[U�4��������@���ڂ�o��$��m_�rQ��S}�zt6 
*%��d
-�C�EB��@�{��o�]��V%�+���d��$�s�����:��K����.F�^G��;\��X�6-�%�Q�/�ρo�XR�c/���?�u�L�E����s��{?]�kbCWڿ
!����)�֑��u����H�����'��FX�.��� �5
��|f/hs���:8r�J��B�G*>
]5p}P���
�t=?�z��b�5LD���Z�V�2�
���Z%N��|��3%�w4~V-'B?6B�_Ɩ>�F6h��8R�q�K�Lf��z������P��}���F��?��	E �a�L�eP��^c�Qݸ4�Q�q��
CH?C�+�M[�=5�9jXl	A|ʨ��+��.��
-]MD�Xv��t͖O�Wu�O������
-u�E��C:P�8XE/{;"����蕳/�C_�?O���U�?��g
��b��x@�/[o���̔ٶL���B�N��.�ޗ��
��Ƽ�4��iH{
J�g0;��Z�w�6�͑k
.��
����Y��%���!�+�Fk��m����|�r�
-7]�<���� ��	1��!v����fB�fH9s	-��z��n����x�
�C\C
r���(c������lj��
s��% ��Y�Z���`�K��bd�]�gdQuk'�T7����I1VZ� � ?����+�3�4�	��7紦��٠X��Z��#�YX��]�iG
W��
��
�\��}��
T��|��-�I/Q��
�ȍ=d=H�yR�6���
��㵮�?��4�Y�E�� ���	v��驺P�����:��s]6@�hGq�m�s���7Bʽs�{���G�ۧ�z:!���3�����0�տ����&�f�<�>0�A�8����$���/u�Dٶ����2��="��r)�v���0/
=�O_�k���i�ho{S�P��IO��q��7Y/?���&#�C\BC	#j�b�<�`�������#b���Ѓ�!K������ 
�<4����R�
'*� =��_
-�n��OSx���,Eו��H��=���6�������P��I���gl�4L��������?[�S�%Ri!O'u���
 ��"�D�K�3��ߐ���X7%�
�ن�*�^D?��'<YP��>����
-1�܀��q.��uL�Wa���[
G2�c�p�`�#��������:�W?�d
;
�6-��m�`ҧtU=�X=Bo���'�b��"�u��Is�-ۥ�����X� ��øY������U��SW@�5dv��}�(�2
-�p� ,$r�������9�*����)�]�8��ho�o�HӜ����9.�	��5	�y
}G矴' k�ov:�����-n�V4��6N�vM?�\��p�\!`�2����aƫ^
[�}*����� �ҜqLuػ�?\�h��:���:�<�8"z�Z�S�B&��O�J�}[D��D�=�|��6[
u'�H�ȣ�^N���G�
-
-���u��F��b�{0f
�K�c!�^
��Cձ?�bp�^�2:�l+�[J��2�0i��㡩Q_��ʠ\�Uo#<�2;;6��4Z��� S�!��y\��8��
K��/BÐ
r^��7+YQ�66��%��]F�S�?���0�=)����^�y���gX6H���3 at RX��M����u���r�-�ǵ�t{y�,�	
��x0y.�SNA�~�]��D\����L_Uူ
�ʐ���
�-h�/�h�|%w�ҥl�LN$�"
��z~7�]����j�X�&���>c������dG[^pBo]�5G��T.��1�}��
-endstream
-endobj
-19973 0 obj <<
-/Type /FontDescriptor
-/FontName /EERJVP+CMMI10
-/Flags 4
-/FontBBox [-32 -250 1048 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 72
-/XHeight 431
-/CharSet (/A/B/C/D/G/I/J/L/M/O/P/Q/R/S/a/alpha/b/beta/c/comma/d/e/epsilon/f/g/gamma/greater/i/iota/j/k/l/lambda/less/lscript/m/mu/n/omega/p/period/phi/q/r/rho/s/slash/t/triangleleft/triangleright/u/v/w/weierstrass/x/y/z)
-/FontFile 19972 0 R
->> endobj
-19974 0 obj <<
-/Length1 1438
-/Length2 6052
-/Length3 0
-/Length 7022      
-/Filter /FlateDecode
->>
-stream
-xڍW4������n�����j�ڻ���$$���TQ{oB�Q�Z�F��=����j����}�����{O�I~�~>���|'���F���p;�
��
-I�ut4�� !!!!abNNc(�򗞘�>���a���C�0:
-��4=\ @ P\(!-$�������<�� 
�&
As*��|PG'��_� .07 (%%��+
��
-A@� @�r��b*�A. #8
-A��+��
-�&-(���% rE
-��r�| /(�	`AB�{�O� ]�+�4bN����`w at y� F�C`HL��
� `��4�zn�og��|�?� 
- �N�'�g"(�W0
����`>P�#���i
��Q| ���#�	�ă<AP�
��W� ��� �A������H��O��?�`�Yf�
wu��PH���@0��}�
�!
���Kr���
~°�p4�A�= *|0*�t�@LHRBDR
 q@��N�?
��A~�?�
~np7�$ � ���!A� 
-�	���K�@ �

-F� �P�?�1j��o3�`)�� �����5�a�p���?�F,h���kp��俍JJpo���/,& 
-	�$0����	����V�ӝ�?5`pL��(0���?����7܀�Ѕc
p��+!1!0�
��ނ_!��f�?���
�y����s�v�v�+�����
(�r��1+�OWS��ց�C=\�Ӫ�a�D�!:?PT at H�
�T�zC���(��o2�5
L
(
�GB^<�(!���av�s� 13�m!1���5ޟ2�j��C����Ia1q � �c(��� ~@���C�q
 ( ��0! 
� �
A�s��� Aǟ7
�0��:!����&~*�U
�@`��EL+ɿ��&���eœ��Z��(2x�
���}7�*�!D���>��`��5�U�6��f�ܡ���=g~��o��兏�7~�uG�g�W߰?%��0���5a囦(1K� z���;���
{�8����uO&zݾY�&�ު��YS��M�(u{��l�o�"vD{'w�5.t�UT�n��l�)q�W5�B�@�,�������!+{
(
-U�~FQ������%�[�~v�T��F:�������Iͻ�V�f�YQN��[�dmk�N��S��P���Ol�
�����7O<
�9��[Xv��9��+��ߩ�� ��;E�h�*���i
d�*�
%�X��I�:0U�;��� �=\�::�(������a}����~�`���ɪ���
D��/���dE����P��+�TARr��N���M�|b�QN�u�$]����	wO�
%����k�
ˣ�$
˷�����R�w�Zn}O�l�4>V�u�^
�j�)
���=�ъ����XT�H�}{�|�1}l%,춄���r�
g*\D	�L����|���JȂ�lӭ#�)����ÚYOo
�5����8�Wz
��BZ�E(��$>Pqci����*��f{a]���M��g� �崿K�x�J�6 '�d&[ÄS�1��ڌ�S�Z����on�Rj��t��O��Z_
��W���{�
-5�p���6E�G�+�!�3�����T<�
+�M��7D
-sP�ۻ
	ӃO
�
`�'�Ác��"�֏�e��;���'&����'��ʙ�Ƶ���h�wb�
���-�a�Ĵ�hb�4�z]^@B
�a+�HwyRl����0_��j���"�F�xM��U��
V\��g����ڴ
-Crh�%Sq��
��ܔ��,����b8��V��g�
��d�&O��
��M����M�>�,Ta���v.��
�y�_���	�\^���=r)ֹ�� J�>�����	��y�bq�
Q괹��Wz�

��O��F��H�L_&ٹ�
��HfqV
����
����
cV at sPtɚ)'lΆ
 
R����ꠔE�U�u|��"��>�����K������+�2c��	K�K
���ɭ�����r�c�
-�w�&u������|��I09k?���}�+�T
-_�5x��K}�n��aKiӞ�:>� }%�z������!��5�4�E����ym� d��m/%�h��2#�_�-�����u*7�8�
l2��
g�g�Z';����2ߣ���!į�C c�p9�����K� j��y8�g�Du�9�+-�Gi2��('��r�>DOpV���tݜ	�=�Z�'@��J#����Z�$���9Tr�IS�h

->$�m��o�,4hꖆb� Z1
���k��b��
|�3hY��������pI�-�t�}itW��gӡ�
�+ň�!�ljT4*_	�AKF�.T����aEH�̿�j�Թ�A��9׹4�	d��Pb9�|��ְw���S� ���@������e������A){��'� 
@�¦̭8Qp�IQM桓N/��h&�0�k[�RA:_xM��>p��_b=
��}Ǻ���
!b�L[N骔S�\E�1{��ᫌ
�b�c�^����l|ޛl]�L�b%MZ փ�����y�g�;7WO
YS�6��+[��[�T�,�l>@����S�MF��X5�u;���A3+��7_/I8����}����I	��\o|���˻j�.ja�
{�
�
H?�d;���~8#�U�9�s�Jn�1�L��m�Umq��@o�Q��6ix���G2�E��o��h�����h,����+˱T�x=N��`yW{

6�|p7^��ܼc����T�f��������j��=K)��4t3S⚒��#�Gt^cɮt��3�(y�1���H����x���w��ٿ�.���NtI|�Id8.���K�^�"
-�5�
��v~���m�
'��!�Ti�eM�k�2Ұ;����0MI~üIk����5�2�9����#ה7�I�f:8��Љ�d����S�����N=�f�b��U����
����
����
�\��g<
�
���=+8p�{�&|�e�ш�6I;_
'o��J0
��p/�_ҖF�%4Wf7��C�G'ih}�"��N �t���Ać�Vx6��j`(�л�`g��P�޲�n�y���1��[z�Ru�Ih�fAN��+ߖ�[��-�UBS.Ӟl&±�7%.�B���
r���w!�֞�v,=�6nsظR�B�C�}����	젘W,��3*�U+�j<,{�(�/���l�Bo��;��%_��"�MA��C���C�ӑ^�[֨(�ݖ�q���H�Z+[�B���%;��{������
������IL��j��Jús��Eu�l�U�'�>!G�t6˱c&E��1蝠OO�i�	74����?l��
��Y�:V����*˝�M��
-e���
;�]k�C�v��5���^�]��"d�0�:�
�%�5���C�^3#0P0|��a���{cX��n�[��k
��I�
���)c#�]���*
%��63 �\�c���9�M�#�4�IƙI<�x�V})���[�]��
jLzd{��LU9{�����^
üdYMq
-��������	��78<��	h���=N
-[�.�k�
�V
'�^,�Ÿ<�B'9���p#
Qc7�n~�%4@�F�+�
-ߣM�BQ���`S����C��NJC���B�(��}��izG����$��u�[c!�}v�Jj}��w.폵�ɸ �;�f\1�I�`�F�腾�20Fxm�^��Ahx�Wj�Κ���/^o�5��,�i�:VP(��]����z9���V�k��х������Z�B؇��
7�������dM�d�+��+��|Ƴ�X�o����#0k֪��w��E��T���ndI4"��T���f󍒺� 
u��D1�
��
-DХ���q��	�m��X�u_�X�`�;����ʩrg7��1

-�&��R��}��yt��/�D8!�/oN
U��o�Ҫ��m%�ow��3[D����%ϼ�~��^��m�o_P�H}����B�6�E�vt��܊�Xj]:�l��`��~��bHa�06���{V��>-�l�`�d�o�Pu΅���չ��Z-j*�X:z�l���TY�i�q;}@�w��:�^��eV���<"!�mC3�
[��J
���ԾrNS�kL
�x	�r����-oL��;
r�0�D
i��
���ڙ�v�w]��A�("=���ް�*cr������1��8�i�hm���>OhD�{�.ܯlOHB����C�
.�:�L�?�Y�%���e���K
J|/N
u
-)�lo�`�3$�
_?������H�K��֫�)<��hn�m=UDL�$���a �-�nّ���`t1�3�5꩔gN��BźCzY�=�q�9`����L"T+x4�<�b�G�Ks�(gv8�ZrO�����Ԝkx/f�S;]�h����6������F�E
Ԕ/d��l&Ɗy�R&+��
�\�fq�T�
1���`y�c��ʹ1��U����mmZ�9�-	fgd}א�˖�
��$Q�Az�+f��Z�=�l2�LT� ��-�a�!�e�"���e���O���TW��"�`r�Őj�Q�w���2���z�6x��9���s@�M�b���೽��z4��\�W$j��
����������s�⢰>Bō�g"��l)��I
NAtS�o�S�����
@�%a����s���.��U	{��\�P�/(��R�����Wķ]T-?��'��2
-�nqj{e|�0�J�Js)�5*�E?����[Nެ�#�O���`�W���������LkX)�<��+Gj���z��G*�6E�BT���FS�	�Ն���L��.�a�R3w��$���kR�x�]�����A@�]2��jHVZ���
ҹ'��{�Fc��]��o�S
-�=� �7q���&�XQ��&�S�\8#.W
-���#r"�s^�ԛ3���%�1��j�Z=>ȉ1�f�J�
�\zx;�E���j�

-��������7f9��q�w
��D^�Ǔ0:nJ����Y�}���Ɣ%�RjL �%��
]�5�ٲj�O>BD�_�X+�ͦ�e7l*�64�JְK����Rn��2��7K���>BvU�e��s�꺙�r��Ԫo���]l+#�
�J\X�\�K��֔)���-vΚ
-�
t%]u9Q	�箱a����k�}�/�:
-��I�L��e�<
��������l��?'���̛6�I�I]
ʝ�u�=� �
�7
�x����hA�
r�q X�{���xu�6|Z<�& 2Z� � ;e��z��نI����ַ��x�8��sL�����[5G)���-�|̢T�(
^M��
m[�
�cj�
F�.
�*x�e/��I�ڱ2&�"_=`���:�>�Y�S?�(�
k�g�5�4�!AԺDɯour��{��6qgLE��ǃ
hD�G�b
��	{h;�C�!>y�ַ�ү�83�e�Ė>>V�
q�xJ�e�;�^LѽM
V�Ux~M^¡3��U\�~2�'/ev^��͌��S�����~�
 �
f3C[����9}��)cc�
%���3|f
:�7*��Y��Gxx� *�AB_��ؿz~�����{E)k8ej3İ܆�	��{��b���4<�j�d��������,����N�aDJ��D �v�*��#&��+œ�Y{�������2>��˦Ix1/Ֆ^Q8�pH�)���c�–�mjKC��ͬx�����z�d���h��|�e+U��/S�D��g�
;����vVM;t�g:472����Ex�����.��q(�j.>)�o��DRl�V_s(�L��-�5F��#�7��0�M�����
�Ŕ�?�>ᓹ\8^eꀞ�w7��(<�3�"-����5�_��v�L���
��2�"j���Wr at g�K���d��o��MB�{G���O)4�k��%8Nؒz�Y뒯>8|?�/l��"�$���%��]o�5�Q�Z���\_����ŝ�i
���(��'MG������O��>L/�<��6�]��];��nP~�
e�da�/ͯ�]����A��;�u����r5�#��=@�{\|8���������]�-����ǡR���W$�J��G��ll�u�H� <�V$Վ���b���kn�vRH��;�x?|�*7o~.��{��Of��Y�d�E�
���Aϓ�� �����H��4��]��_�_��a�:��lgV�>g%�ÍHQh�*o>|d93I'�՛ϑN�GR��دh7�GE�o

4=xPx������:]鏔[{/����.
�z��~�4���c<��MpǴ7$/���w�L�Ɔ�.R�y�ْ[=_�<��-��O�U��j���'4J�уHd�[00�@;>�j2�=O2D��>,���H:M\�~A-�2�aˇ�|Mvڝ=������C<a
o+��@�.��]�S�Uur��Ƌh�i���J��z-��N�:�/L�
x�G~�:yH�qѩQ땳��DK��WH�������\
=�ؐ�i�\�n�(lN���пa��L�/�~g#[]�k�+�N�}�HD\��Õ�g����v�L��;6�xc�
$��`�9�
G��U�>7��}�Mwֽ��:�I>HM��׋P�A��L�
mV�m!\��>ꊷ7��*~}�w
g�j%��Q��F�MhQ��ȴ�S
,��=WmC��Ee�5&\�-ϛ8����N�|+w+�Y����
�� ��BcRHK%�+�ZM�ִd���{��B�h�����V��
��0��d ^��1�)6���9����z��<��6����#�("^�֝���<��'�є�Ujhᘟ��� �`�ˇ��YI+3�,���֜�i�dNT�.�sH{rw�
�
1
VT]b���)*+�U�\��nᒎ_=>�v�Q@��f�	+�r�U�4-��v^y���vx��l�s���?�%�2|��ȃcv!'q�{.�|������上ͧ4�h�7C��hL
�;	=Ż�V�L9���
�
�������G��9�Y9���]C)��p�η*�Ef+}>
�IW5���I�L��[e$�M���W��C�Y
-endstream
-endobj
-19975 0 obj <<
-/Type /FontDescriptor
-/FontName /ZGGNQH+CMMI12
-/Flags 4
-/FontBBox [-31 -250 1026 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 65
-/XHeight 431
-/CharSet (/greater/less)
-/FontFile 19974 0 R
->> endobj
-19976 0 obj <<
-/Length1 1451
-/Length2 6815
-/Length3 0
-/Length 7792      
-/Filter /FlateDecode
->>
-stream
-xڍtT�k�.)]"!9�twww��
0��H#�]"-�Ҩt�tHJwH�?�����w�Z�Y���羞��^z-]vik�%H
-��ssp� d�Օ�\\�
\\<���z`��/7&���
����Y��a�<u(��� ��p
�p
�pqx����N��� ��`k�:@
-�b��B�<]��v0�1������‚l��Ҏ �P��@���� ]���W
&1;�I�������u��`fx�av 
�+��
d
��t�AƁIг����Bm`
@ �p [� ��
-7�5� ?
����tA�$��I`�u7 n������W#0�w1��
-���x�!� �����{c !ֿ��Px=�
v Z�~O(Hk�p��s�r;�\9\�� r�j�ey��,����b��O���_�'���C�
�
0���k7'N}��
�,�W
-܅����s		�
-q@� �++;�_��<�@��ܿ�p��NP'�

�l��az��A ������mars��V0�%�
���;�
��c×�~0�s������738�������P㹚�
������@_�y�<�\p��	�/�����c�������럆�(���������/Z0�%f���Ѐ¹
0�C}S.~.+����[ �K�o�����E��
H����w��w��
��%�����B

-�S
A����9�wT��Cb
�8;7�?�U�
-d��Y��!�߻��� ������__
x��ળ��U\����%���_6.��!��Z�R#�  ���Ąn���Ჵ���w '
-�� �}6P�_kp��r��~M�i��L~ '��N�o�_3X������M
��ۿ? �+����J4�eup�e�4�����a��s
��stX��؋�D��9�
-���
-�/�h�8_�]���VC]��w�N��eKm?�p�8��}AA;�׀�k�*C%R�҅�E��C�ڶK�
χ��c&Ƀ��{A����_��g�S��Ё5Z���2��p�
Z�6�H�ȠU�|���Q�����;O�I��Z�=p��Y(�@^��B���`>�6��}7㱷�"�ԮuW�s�e�Ɖ��ɮ
�s��z�N�B5�D�����D�����	�Sea��'����HBQhF�n�D	6ԑ��=�ھ�E��
^�M�垗N�
�|0X�X|

[��x��8@����=oAe��Ad�s(j�xho{�
�e�tb���P|��e�xb>�����N��?Oqra���Ҏ�O�).��}˂77>cN����>���\^?�
��h�
S:�LA�G�<�U�Q���
-
�c�Hdz��1�
��l#��ʦ����w�/P��·�n0�Ob8�J;�@{��]B
O���6���t#J��D|_!#5.}�$�mz�2�e-�x0��s[ɡƍ�GQU�
�(�k�}�&��	>���3׮�W�S��*E��
�(ͩ�O�R�!���y��$
-oHw�_g��d���3�q3^I��=(�C�a����N�L~�f�z���E;n�]"R�I��__��:��$o�Ɍ����%�&��@62]�[7�Ƈ�if�w.z����e��y�ғ��PB����]W�	sC
q��U��i��4���TU�����7s���^O�-<\�P�@Ew�G��C�����7RC��ls��X�1V�
��g\��<���h=B^(��[N�_i��7Il�2a�[.Zʿ!�\]1�"�
i�!''~��<X����C͇�j�˰�1���
�3���T:�K|
�@ҋ G!~����PN�#X�BM���U혘I�Pn�)����kef$�xK�&-���l�>L�!����CX��CCͱ�����h�9S�á��!t�4���[��m��Oc���XC,o"UZi�O�
�*r->]ln'�c�*#����k��$��Fac?�_�m�#V/;��q�~�?�fh�̡�h[Do`��@C����>�X��f ��\
��z_8��
A/n�V�	���#
-~�
����lV�\�
-�wT+t&��*2����o�������R���L�'�+g�͉l���f��k
]S޾�L
��~�YT��ŅpVo�M/k,q�St���(�흘#j^9���g��nN�L�s��
�~�Ͳ�)ma����I�� �7+���ݕ��5-���I��yĵ�c�g�u��4�
-���<<�|J.��_�eۅ�N�ҝ��5��<�ߨq?�
f\nZp����
�\2��~|e��B��O��ԇ��#;?�E�>f�I�>�Õ�DZ���i��C�}!׃3�z��Y^]��B~
�ҙv���0��<��Π���
rt&)>e|}X�8jl
�A4��>�F*�/�D14��l�K���T%�ܿ
�MDy9!mي;�|!�P.���Du�T�?�:��B�ً�u�|��
aZ�sK\����6�˒�����Ě暲�)��vK:�/zCzϰ�2�&dGΆF18!�hu��Z���f�$���� jX�54yO�;H�j�,Ľ�gls���6��
٤���k���L����Vgf���t'Ԟ%\�,1�[�jC(��
.�����=��E
J��BN
ڞ�C�Jm͑v�u�۫i�tU-�O��؟��dڥ,�	l��xá��ݵ�q�K?ı�n�zvTC�P��u���'�����R�9�L�)^�q������_Z��0[|�HW�O�s�
sC4H�}"��Q���"-/�w�:X�2+��X�7:{���@�<e�XB��0���czc5͏k���ͫfv��C�y��_�Er�p�r���i�L��گ�j
fU��ǫ�u�C�E!�u.6��  �~G?Z�#�]�R���@����91�'�eT��ٕ`b%�83/!���9�U
�e�
D�_X�o�k���)�\�
I�F�b�-^ר-�Y�VL+�uBU�E1Q+G묝Zw�j�Ȫ��x�@Q:^ͭ%�Z �d�<G볧Ċ|�C�+I���-��n�B�A���
��	����(W�sgo��Xה����wudt��0����Vd~8�
ɬV XI��7Ƅ9�pS�rn�^q�����e8��f�b�Oc
�������3K�
���|!��x��6�U֪7;o0��� [...]
w?G��P��O�� ����Y�����n#��r7��\,>3����80���1�Cl
SwR��y���o���5�l�E�u+x�a�u?0���?��͘#m�#�7�5���������##�+��Ҽ�A(O��(u!
��`:
6ui�C�x㒞Q���Ž{^t�՞c�����)�.f,�sQ$+g������j�l�[���댋B���
���1���{�l��%b��9�F�}�*|�^y�ҩEm�0yA����'yJ�!���
f�I֥�{j8cfm��O#��m�����&���Qy�է:�W��鎮H�����X��C����#-Ւ�/ ��dz�uu�q�#o�˃��%�Һ��lg�6�Bp!>]���u�����
�����nQ�3	"
�T[O�Zw�:
��N��NӶ��r�*

�JF�#�5�
-0=L:��G
�&�T�
�|���5�Q�b�3&e=��z�\�Y��������W�ѓW
�o�
�&�/,����i�*z�5D��{�U�<#��cUl��B�w<� _�z��*���c����}ʤ7��00nЮi=�ɜ���G�
�&���54,|�
+I�����g�7Q
�_�2����d���d�o��4Jy`�5� o�ט"
�1��ͫ0���x	��e��7U
>�TNbd��<�/�\��<rj��up
���+���(�4}��]Jsz���K
�/=v3�!eKL3��u���9o����*�o
��&]xm:���$Xk��"PY�GL���)瞪�D<�^���f!›z���^/�rn at oh=�P�r1�R��|����� ���K�����q�Hc�Y�
�y��aV[
�s
F
-g���#�vX�-�

��h���ҫ�`���/}�Dž)��'��骲���J
E<(�r�{��.�-���������g��"j_����%��,�
_�����'�C�O�J
��1�e��
�^�1�ݪ��-���P���K�9��u�)�[8
�ӯ��aX�H��y�#}d��2�4�Ϡؗ!�s[�5�3�gA�B��B�S\����`޵s�ɹ"i�縨�)��/��W
-`�;��L�ƕg�jX�t�
�&UH��8^"~�b2?�O�}�C�	�^.��|���*D���]Y������=�Ga�����
mQ4
�ۊ�#�}���P�˺;1�%�^~��*�o����#��l��~I�7V���Ǝ�5k��
?H������Z�PP�7K��?'o��kZ�]Ɔn�R�h�'�����{N
��
l6�^����B��]����a���n�ʶ��Z3��+	�����To������.�I�����F��U�s���ޚ$r�|�
�֥���k����U`]O�q��D�w���J���v|��z%G9ۺ�Q��վ9��m8c�щ�!�AQ<��A7ݠv�u�"�
-�1���
3NV��ʡ�'�;R��IT�;�X��'}#L��������&�m�ȫ�qR�����@N߯1��ʉx$��5�
YQ!)���j7lbx�4�
�#�-�7E�z�x�c�Alx����o��t/����މ�if�յ?~B
��x����v1�4�(�o�e� (#�1~pw�+�̜J�߭=�D��=ڔ޽0c�z���7��
-N��e�R�F�
8�
|����<�q(8�)SDh
 �4��@�5�VM�2��-��\�	��ܿ���vD\�A��W�v�A��
��	ȓ�9�ؿ����3�Lk�bRPg�0�
RU9�:j���[,�
�
�/�J:�+�0�K��1�	��H�;�{d&��$�nN�m���	�\���d���W��x����
&?��4� 
s,i�D��f���R�3T��Y�3O�[�n�TmUՋ����b�}
7@��8
��M�M'��/b��c������?����]+���_�
��G\>�a��p�b�
\���s\�_ePV�jz�b�޵S���I���
���gΪ��g�C�5Bю�B�p����9���Թy6'�!�FG%�w]�b�5-xH�$�?��1Y�fR�
S7��U,���U!�mS�l�s\�K�93h��ъ�"����y�^)�����2���Mx"sKԯ��F��G7�x\�</����:xފ"iOo��(�(�,?1���,Fu;6?�eFUx��ط��?��`��P����d2*�
���ѡ}�LtG��
���'��	�a	���U
��
-M������S�UA/̐|�'��j��������=\r0���n#�Ǖk.)Q���vM�׌#C���o2��|"����I��s�ඃk��R���������$'�8��_g6�;f�y9����f�$z��(����'ʚ�טK��N���py.��Dh/�
���JxJP�K���
56�c�F֮W[C\��Z��b�����m-^���ߊ�ڴ�5�K�tn�l;Z�9Ω=��E�f��$�~WFt� Z���;~�?3庫��{��ep��Ρ�����G�\O�ή�)
-�2��K�������NK���
'�4'm
7}�����!6�4M��h�|�3�Țj [?�a�%ӊ&���\+��N���
-�D��O�D#"�q���4�y�f�ջ�(�#tT�Ƣg�����ku
�[�`R��Ei@��2CI��L�M�w��s���w<]m�.){c�Ly$.y��
��ޞ�(j]���N�w,����3��M��l����}W ������;�ra���Z&��@���O��΅�|ӓ���E�Hu���@�?��=�M�
{� T#0% �y,$&��sޗ����%DK��B5�Tz^�'��m��]:Ħ�o�$�r&0�Rt@�1(��*�bC2���'���N�V"o�#MJ$����Ey"��J2;y�qg�=��
b�'[�*B扮]
��IEh��C�ѡ���f,~�k�ϸ�)��!a%�4���&����Ќ��"��⛫.�����	�Ź��1��[+�7��_$D\;�1��Ċ!�/R1�K���Uq^,���潛�M��
cJ�T�b:����ĆM���;�]9��
þ�"'�
�U>���s����q�؊.��+8tK�jC�$`�\��YВ.2��ʛ
-����-H�7�'<"ă�
�T��I�(��Y��'�}7�&�T�t� 4�Za��0+T�a��h
�%�?�'z��j�ڂ��
-4���ib_�(�mSr����-� �=���
��>�~݀
-�]���	�"��30��
���T���2t]zʨ?�cG���ɭ:��
נ��^��
���}v�#�
g�}�B2O�=�+����
7	�బa%�O۷؀�njC�8���"{��Y%�mP��6At�E�w&\ӎؗG��-���O�k�˅IO�^���1���
-�R����yB.\=1�M�l����%�f~�]�ɕ
Ќj(��T!G�^��ǫ�m�_�=&�:Q��6��A8W
/��漊�T�' �0.3����ͼ��'q�Qq�pz�'�x���	�ɫ8�(�<�?/�2��o9���9(��^KJ�]�]~/9 K͍��JxJ/��~�V��x{H0O�2��z��;@FƲ���p���9害
��P��-��/����i&Q�0œ|C6�ǩg�x���3޸��
-%O��:�� �[���� �R �j�����„�9J�/�
��Tп�>w�qL��f��W*R�a��B�����#��>{ϕ½`�Z<��Z@����t�5E�}gA��� 6��(�����
D7��'�_�z
�/����ei_��uVY$�w�3
�v謒R~^P�-}_k�ݤ2�f�y%��Eh�u�ԑ�H֧����YC��{������2~�[�X�o�
����
�I��4�n�#3�ޅ���W�'���]:2��W<4��}I>�״�
-�*��WnaX��|��,���?H�
z�ނ�>��$S,���{k7x*.��
��P��E�<WNm��¦[�ǩ5)��F��ʾ
6���e-�c�$����7q"��QN��\��
v��Y^��t���
�Wk(u&��p�]G��Q�I���
Y����I���iܥ�UTj�+V�+m����d5'^W�¹�VU���EI�T��
͊��]
]����(���O���ẾM�ߪ� �!GYy' 9"ϑ���k��Y?=���N�B:�F�FHW�2Z9O>�
�����X<%l��_�"�)�
	��y�>O��&��1ª7���]]�X��`��l�m���se,8&w
-yZ�ms�T��=̹���񤪛(Ȃ_,
�����[?
~�S�v���i��
�;������S4���Q6�*=
:Rb�
�V�ң�w�(ov�{��+��D�)��ќ�!᜶r�:��E�4w)�?+���-������b>b��W�d�~�
�xp���?�D1�
-endstream
-endobj
-19977 0 obj <<
-/Type /FontDescriptor
-/FontName /WNXLJT+CMMI5
-/Flags 4
-/FontBBox [37 -250 1349 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 90
-/XHeight 431
-/CharSet (/D/d/i/n)
-/FontFile 19976 0 R
->> endobj
-19978 0 obj <<
-/Length1 1728
-/Length2 10259
-/Length3 0
-/Length 11364     
-/Filter /FlateDecode
->>
-stream
-xڍ�P��-�Bpڸ����h��ƥq
\�k��A�
�!�;�呙�3s��W�W]��Y���{*2U
&1sS���=����� ��$�`e�`feeG���ClA����A�.`{�H8����$�b��`�w��q ظ��x�YY쬬|�1tp�H��� %f���=��J����liyI�#�֌�������;@��
6���+��KF3�-@��

�x�WZA+đ����ݝh����l)L�pC� � ���
�0@h��3@�
-��\���t^�`3��ˋ���9��
�!�Pq��i���#௻�1��
�/�߁��8��
�
���`{K��P�Vd�x@@{�߆@[��l
4}1��r @ZL
 |!�=3g�#ą�l��"��0/�,eo.�`g��� ��O�
2{�vO�?;kc��n��� ۛ[�&a��Ȣevr�I�e�"B�Gf	� �Xyy8x� ' ��̊�wxMOG�J����ގ� � _������@�]A���V�7Bbc���  S�%�
��/b�ş����`����X��>�{/s{[����/������,ß��։�;x ��� L�\� 66
6 ���������?��������O at 9{
 �
^.�?<��
ڿV���)�
^f��g�
Y�X�^>l��
����������-H����5����h�����e�]!/k���
��k��s��@�`W����A�/�!fo�2�Ll�̬���.�`��*bf�� ��/9l�� U���ŋ��t/[gf�򪸼t�O��e!4�7�,��!eo�`�{ٹ�@gg�'��@� .�7��ښ�<��w 
�������`�����\/#�[�'�����x_��߈����X��F\�������͍��_�
�b�/���/����_�%�Ϳ /����_�����Kyq���=���KEv����f��|���_����7d��l��/���_��^�q�|�����Ƙ�:;�t�}z���o&�2C��q0��
n��#tg��?I��eg�7B��JM��kde.(�J���IYw(�;�|Z���ެ#���b"�޵$5��y���J�&"�Ak���I'�/r�R%�D��Z�ܲW�
-͇��{.���X�G>�U��[uq�".���:�����%>M��]l�F�ax�r:��`�-R�{�����K=ĝ��n�[�� R߉$9����P����1�Me��e�
&���2zu��B���]?
t�[�>d�-�s�9f��
�m
��\,�_�>���j���8�Dr�.��JTe�S�
-�Z'Ҹ�g�L=K��
CV>;X��5�L�]p���tB}�Kf�hP�>��2a�z� "��@�I�
O�ޗ
?\��f��;����ĐY�0S�X���\K>�+�h�f>>U�,�F�7�g�k�.����.\����%|�1
�{o�L�u@g}�]q�%'��I
��G�]Z��8=�/�%
a��{%��\�����V��R�h���ތ�4��T`n�:}��y=��K�#UH5B�L��M��/_Q�G��;%�AR�a��+8ԧ�d�S��TU=��f��Gp�+<^(�U��
u��31C��[�
�
�m�;x�n�̉�U)��P�탲
-�e�TS�v(o
-�3//5L
jX��lr�@�CY1�{��K٢M956?���6�����˃�_�w�8�k5�/8�0O�cnD7,�	�0��D

�%GCˍ�0�i�M�
xCGP��:�
���0#|J9�%��9׵﫻�)��T�]�����B������,�T|��؝���f6'Ż��,S'�>�?��0Č�4<�Iq^@���o��/@���M.\Ճ䒡x��ݹ����L�W	�K��I���6�n�ϋb�X�È0q�₱��x{<�����r�^3d�'-�W���`�@=`d�
�	�*�,�X?
��8Xe"���
�,�?�ע�Y��N���E?�L�7�璁��#��U��ek���d�u����`̝�vx$
J8�g~�yG�g���i��!��B�t��h�^��9�z��KkK��H�=�b�
l����7�4E�vT�5�q�ħ��fr�
\��(Q[7;C)t
�qC
/g{+��2���e����>�)u��QW�[8m6��{�}Q�k���q�NX���z�|�����K�'^��7�����^ԯ�

-��I�]��)���3�a=��/

�;�O����:��m��]o���p���Az���Î�ߪ,��a��hQ����L9C�[|)ψ��0�`%p�pq�&M����=����VS

{
-��c�B~�Zp��i�C�����Y[8�)ja�8����O;����l
�!Rm&�X��������S�=�u���䑨���L�%/�B5���l}
"
�+}<���<�~�w�.<	
����%�CH��Xpw
62˝��{�]��.
&�
-�[<1|�TNu�~C���c��dP̡{4׶�#I}N��l��݆n�G�N*�„)_���&�Q#Kru����K ��k����!l?�a3�������Qj*��0c�(��B#&UQ��k���)[�=T�����ä\}ו`
g�Ċ%%=��oC
���"���3p%���e��Tc�#�h�ZY(��
�TLQLx���
�
#N���x������d
m�
-�4���%(�kxQy
�oH��	q��C��E�|�
�X��U 
-�-�"p�o�	�<1��J��'q���}
S�g.T�eO-�ya1�Uf�/M��d�J8�m
-
-���d��3��y�LW|��!%��jHh�́a�T�U�k�v��Y�S�@U��B��)N1��p9�4-,���C�%s<7��oD�SΡ��w�F�X|7M�@�C�0�����]�S��
ev.�����0��ZZx�m�!D���>�bF-��!�\�u�z\�e��z}qH
�{�pc
-�!���
-P�XCƍ���%
1��x��]�BG=v����M:��S�h�w�l�x#f�Rs��4�8ڸ!_s#'M~6>�Ћi�
-5�����b|}�a����$���@ީw7�h��
�?���>��
 E#~�v��aa+��.����oX�zR$�p����
��X�l�WK��d56�v��Ո\s �LN��h ���g�Ir�l�~V�9"�����mы6��#q;�q��G���
J��:��S���	�@yk�ƐѬ9	
�qB�aYUĩ/vfA��׏jg�`�R�c�3:$�uqUP��no$�
���E8g4����Q�����
�WӴ�;�緖
��$�)$4؂
ɚY
�=	�A���u
!�~3�dQ!�P
H"���
�I�|�Tߐ���;T\��&�]��^���o��8���u�U���8c@�d�������[��B�{�>���Q�hb@��[�<��y�U{]D�����]K)��M��g�xG� \Gj
>�E
5��LJ�d�X%�w���[@'-i�Ú��O��<˺t�s�-b"�����G��
�����W�>=%L��s
2G�'�eh�Y~"4;��
^s����	�7���9[��uM���b_$�+Ғ��>��9�b�*�s�i�;&� {G47+��31)�.�X�߲7��3�)�Z��2����]�N
^ �I�!=�/��@ۍ�f�Qj��P�վ�Y�=Jv�����>�xY�{��"��.8Ǔ��]5x6
�����14��� [...]
��іI�y�]m��{��,_X�
�'�ν�)��M���E��]{^S��b�7��@^
-��`�S�	�8jQ`>%:�JR�G
��*8y��+:"�nzb{�
I��
#$w�EI+���3��%
��B[]`kOܐ䠄�y��zZ�ә� ���-{q[ED��겚s�D�<����;'����A�a���
U5u
}iZ�P����
�^Y� ���e�o�D.6y��g�|d�7s"�
��)�R
�
�
���񟮚䅩�������0K���|K2���%�e'���j5���ǦDg�w:�H�z�H��b��9�oJ}2k���KX�D6���jU}ms��Ѻ��K�DC�-��'
GmC��v�ڐr�
{R��`�G=8�qU�]��>�����0���{��^
-&�s��M0���~�W&L.:�M��
'"i�������֥���,jxśf,�Cz��h����բR�����:1��6r���t%-���	��/C
o
� K/�
$7Q_�2�n����@]e"
x+��J�ת3�lR1�=Ub�Ϭ����z��
�l��9��R�ӆ�ڍvp��Qj
mb��a*!<�6�J1=��Ĵ%U�!�j
bձ��S�Ӱ�QD�Rq|���-c�Jx��
v7e�>[�
-R��MO��A)��WX�
��5z�9&]�
]�"P“�Z/��%Qڹ�C�'�R&��|3�m9�drT�o		Y�M��@��]�Z
9��w�W,�����I�{�A^Ҋ��T��;Q�'����
Y_
�����q�
-��(���n/g�;���Pe�j���500y���S�ԋY���
T��E��6�L
�����r�DE�����N���W��H��M�6
�#�(9���iEG;�#pf �\��\=�0����(������}���~�#׽w�*LK
`j�W0$�r�v�)�5!~.�c���Y���;��MJO����H:�xx'V�_�{=�K�m���
HFB\a+9:
$�E) �bs���¯[$� 1�9
����_���c�a"�fƣ�ywH�۴�����i���J�H�M�GD
-��;��f�s[�_m-]^M=����q�b?�eڃbK1+�o5?���&����7�.7�m�;��
-�]��ms}��SZ<	�6$�A��G�+�"���}M׉���Sk���Nl�F'Qr�������X�u�H�@W!F񄝼W���2<����B`��U�$�I�
E���_��6�G2`�N�Ե�]a����!��4//3����9
���x&�o�%��ߏ���"���)_����
��jy_�ޚf��p�?��Z��.���f��"#��iԸ�HWqY:�D�Q޺5���O�u�ڳ&o��[�Ќ���c��_��&c_}�f�rr4�Jw�vs�N�1�]$ʑ���d��.}�7��"�͈V
W�W����2+�\�G��
�Cf����?�P
&���w
-�f'�7{&��1)�"ݚ,V]N�Ʈ0�M����FZ�xB+M]tk�rYC��eqξ3Đ��#�7��S�(F��ܑ8ٺdx�=web���
�kKH��@�X�������3T��k
�G���
5������wYg�%W����{�
h/����u��Q��k86�
�\䶅�=�ق(0��RW���M�!�����{��Д���M�wl�rHw�.JmV!vJ�6[ �|�yI�ʝz}�EtcAk9k!��s"T�s~��
�I��+khm���/zvg���&K�*�Eb�— ~$�1�g�AN��/%�#���-6f*N7Q����E�tr
����9QHv�B���N�~N�$��[���,�D�]��B���
�F��F�綳#���M�i�c�}͵��W�kT�T\e؟��v�"����
,�B̘�;
7E�!޲DV9R}��-�y^|M�J��4lu˝ʸ�PH��ݻR�&lmq��Q�@��Xq稷h�
k������:��s��,�
;��	ko �ۏ&u�ʁptWoA���X_vqc�i���Lɂ���C�D������S�И��������%���R���wa�\�[:�X��j�͓P�; [...]
-�8�o��

;e��0<��
�c�B
-�Z�`Bݩ
�c����kB1�g�
�|="h��Ef��
���DG�5^X# ��u�����T��l�_�}��}� �	�q�HA��f&
V]T��SL�0r�U旿�����d�
����oU�c]���V����s�rNS����Ơ"S7�[�m�s*�P����~ʛm��^�L{��	%��8���-U�o�`j�*�
�0�*kI��%������%-�*�)2��6cn�

V8��b�"՞d�_���
��<���I����~/���6��I�Q+
��3]�
z�KR��	���J�L��V���T��O_��Cb�5I���E&դ���W������C�\�$����๠yG��ء%�[��&���1��<I>�wP�M1Tzy���k��*���X0�灦elG���|?߇Ÿ����~�;U�)�U�ut��$��KD1AM��~P�7
������-o/Q/�M����T,���=y�XBN,ɘ-6E�~
n����u�n�7�}������W�Ro[�L4\�
�`�,d� B�U�Z�NY�3K�a���aWQ

�;�6�H5�(��u0xwD�yz������ ��������8����S��;��֍�)FR�GJv�<D�PPZԕDX[�E���
V�7]Aq�m�v�u� ��n�p6?f�*˭0�Ӝ��b5�	e,��C���(��)/�RS���#��_?���<��f����(�L��%��b�|�݉�
^�0!�}��!�d\��\M�T���
\�����ۚ�䎩>o�k�Nv���/��\�:d�G3���(\��18��eOx���U�UT\�T�仢����5qv{(:i�I���tU�Z"X^��V���(ޓuPߩ2
�4�d�`|���q|0�H���!�
-ፆ2J���kv�c��u'(��,ʹ���
-�g6=4m_b��=�\��+΋g���z
S���	���	
�[���
Q9co�45%tv��t\�oOS"P2~&��Z�q��s�1��Ք���b�j��A���~�74;W��Cq� >l�R%��L��
o>c��iʼ��>�6���!���_!����Dw���Pd�L�+ �tKw:#�Ed�x��iR�����3<Q�4G��ې�;s*"��_=(��*ڌ'�J�8Ag�"��X�6^�,��>�kVV�
�!�qo-7��վ��+��
�>鹫���o�M[8��.��Ѻ~���1���=���
WV4��m9,����UH�%�3Q�^��m<��sfF�#Q
7�a��Wb2N�u�Δ9��Pj4��3F��X�<�:�^W��S�ʨ�Y����ڢ��W��,2�Y�:wH��F�/א+G�P��o`T(�d�4�ʔ!A}"O��{k3BϘ��c��I�oآКj�JPN���8B��z��~h��v
Q-����isX@}�AG٠;m�酭�!���v0z3� [...]
-䊯���q{�*�B�$C��^2�Yc��QH�/�K	�mf^Qɵ����˺�
-�1V���m���:�BZ�f���v��3��(��fy�ǰ'��g	�m�&9��Z�&z~Ʈvo �<Y�e���yM?����z���/��Jd�i�jϑ����Ii��i�C��|�q�(��Z䅇
�q5$��>�͔���f
aPw��U
-~�/�+�L"-z�������/�E��Guޡ�Q݄(����C
,�*���mP[��:xo��LU�(�og9���GC���2�
�ߊ��e,hs�Me�<"(��n��C럿�
�PQ|\!ϲE79�vX��
]��~�ug�����
@�	��"��,^P��g/�Zs[�/�=�/3j
~�m��=��5B�Pc�ۨƢ�-4�:������w~��m�4�H'dӱ7���U
���ö�pHo\f�n����Q�l��UP ������ֻ�iɝ�b��٣>;�n���#�����Z�r-�@﹎�`�o
pu�}!�<�G�ݤ��!��~�T��t��a�
 v������h>�`g�q8q�\2.;^"�]�F<TV&A����0Â�Է;
w/-�t=|�g֫JIY�7&�8$�O]�=ao:���R���V���+��_��@lk$��`9>�h��Oϊ�s��i%oY<+��>�=���}�Ea�y;uÔÚJ>,ǔ@�v�{xJ��.��$|j��/J\P�M [...]
;�!��hQ���`!J�7�s�g��<��}f?�v�n�7�0�����Zi-F
-�����p��
����/�M1�
�����c�w_��WVP��{kv�0��Bɝ�$�b$��`M��|[-��^	��&�hkcP��-��I���a�2���*��{FOx�S��^��DXk���z�ܦ��|U��v!���T��5Vs����ٸר{>�Z8�'�u.^x��
Ju:��F�� �/1�+�<���0w�ܤ)�-���ߠ����
ȹ��>�K
(�����+)�VX45���PS�SS"�j������W�t?������8��2�lȼ�U�e,X[���u�}�"gѳ��o�"��>H��eeNz��U�����㶂B;����)�C�ۓ/X���\_�f�T
_�H�
e��tC�o-�����'��\<l���UkG
6C} ѹ��2&��U�gB��l��j���Is,��1[p�d�є��`��

HAiQzēX���R&X�>8Қӌ�.�Y��L�F�i
�G2
S�	
�#��Q�SO.���]�ú˜g���y�andg
ox��
ω-���h7��4�C�$�J�P�� Q��-��GY���X���gV�0���o���m\��=����'�䖋���_� ���wgNك���SM�z%�G
-��)_�`Z?�p۶��6��#��膾j��麟Ih�	MRh
��f·\
-E��No��bQ�{��yF�u�(�*c������Zr�܊�q�������:Z�Q�˥�1lS'^�{	�3� �O&C����
8�A��RF�~D��Ar�L�0U�%Z#6u�{"2����4�?�+���y��]^b���F�.�����
���.���&j��Y9�1�
�ĩ����<��͹�֭�{Qw�n�o�����`�ؙ����kȐ�
����Ѧ��cY��k��/ڡ��b6�+'��
!�~U�j^}��c{>p���V��
��xu�}x��W*x[T澔W�o.8;䡀��
fV��xSV߀���@�qS/پ��m�~�lt�Ǐ�F����\�9��L=���<̐����d���鰖Q+{����_�h�䵗,K*����r㺗X��(ɗ>���N���D;�$���s�� �8���Zq_��1W9"-�-�i&ƭ	���k��`���I������<�&1b�I �S
`M��#/0��+C��b/���
�$E�h��}��hh�
[VD1�Y��;�vZޱR��t>u��+,�
&E�8��T��M�F�~�k�2��LJ��5��1�ntPXbe0T�0ɍ,|�U��!�2
m�OR��)c��(�u�p��׷��: �N�(>��y���⼮e�^�a��B޼àAM���
ٗ>j
�Q��£_���9����yS���*��B1˨-!��&��j(���(�I�"R� �����w�շ�o+:������O$"�U��)^q��!��y��4�
��I���Q�f��X��u�"&�FC�b��n=�� #�e�Z�N�\%�頝�����)��h�U+�
�I�"�33gK
�z/r&W5|�2�
-�n0ɴ���WR�S�܆i4)�;������F-��p��>��<WN��;$����(�EKFu1�>
�/��0u�3��W��r�ƃ�])�
d������!u�9?3y�+`|]Eyrl����8�=��$���˲:L���LV���*4�����
-}J��ed��d�&(Ʈ��;
�c°����C��6��`�!�5^��v����Re	��Q�[����Q
ާ
��	M�~��vM� �Q�3�'M�D�M��[啸��1ꙝZ���Z��K
���C�j$�N����9�%�$���s����&Ēx� p�
Eֺ9�Rr`(-i}���ؒ�k(�~�_H}��S��Ρ�u@�}�f���(7F�j�{*�j_�
�	!�eA���U8�3��8>4��<�ƭ�!	YsH��X!ԥ�1z/:�k7@�k7
zr��Q-ƀ4��CQa)]bT�Wҿ2|P=f_,���y�-��Iίl�����퐗�g���)dYE������m�
-�=P:k_�q�����ݐaw�p��;�']"��
c�O	(�F{4hz<V=I"2t����t�)8��I�I�pxw'�o揵�%�O0��%@�e�`�g�
�Q"pf����9$�6_
R34	�H(B9�{�K�I���
-\��,ԙ
۳�I4Ҟ�E�xW���T$x
-��v�6߼�!5
"��xZ�
RV��.���k�..����EQq�T��ܕO�J�����+K.T��ueP
�vCU�d4_�L
�*#���Dc���O|���5<��c]���2�u�H���I����j�׌P�L����o؊U�C���l.{�ϰ�	�#�t�
��}����*s��"��<y�	,>��U��?P���g��(�ޒ��R�p����oH6��_'�j�T<T
���=�T!<���
-LP,r�	�B����*�â�`�ેO�q�H�V&I#�w���l����]��(�G��M4v��A��r�bd���I��M���w
����x.0�z�z���7g
-endstream
-endobj
-19979 0 obj <<
-/Type /FontDescriptor
-/FontName /AXPGTH+CMMI7
-/Flags 4
-/FontBBox [-1 -250 1171 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 81
-/XHeight 431
-/CharSet (/A/B/V/a/c/comma/d/f/i/j/k/l/less/lscript/m/n/p/q/rho/t/v/w)
-/FontFile 19978 0 R
->> endobj
-19980 0 obj <<
-/Length1 1430
-/Length2 6052
-/Length3 0
-/Length 7024      
-/Filter /FlateDecode
->>
-stream
-xڍtT�k�.�H(RJ�/
�3�t�tw9� �
0Cw#!���t	**HI�t
-
-H�t�������uΚ��y�Y׀O�
e
SA!1|~�����&��B�`� 1�!
����&f3�y��(���rP�A1X����B!uO  ���`0 ���� ��^p{@�PG!ahb6E�����	�-���� ��wy��0�
	hA1N0WlE;(0@��a���r�`�$������h~���
/�
�8�04��
f�
hC]a����Np����
��XnC���H{��-�i:n0�g�?��_w@�!�I�W�Dp��`��
��
��#
8�h�c|0� i���@���P/(
��:��

-���P,����<�n4?��Q�W�-+#�Q��0$M��?%��{�&�Dy#��
�H{�_ �=���pwO���_.X�?:G��`� ���I�WzC_7�o#�� ��
�8`A��0��?�0
��@��m��D
� �p;
`
s�#��ɎU�
����{�} 
0�{ ������^�($�����0��4R�����?6���'(
�	���b��N�
��o�.�Ws�2�!
P 6�o�����_���kg����Fa�
8��%Xl��@��7�w�����������
�x"�͜�����
-G����'�Z(�v ����g��`�pO����a����G:b9��
����*p��.
c��I�[G�tQh��'��
�vv.�g�����A�����a�-�w�H;���u�

P_b,!�����=��7�~$
-�
����1�
-���6�5`
t`@ �_�U�������$�V���0�̎xze'�\
�x\%O�ͷ�Q
-+��T��c�5!�Cy�f�����r��v���s����q���=���;��‡|wTV
��&M\
^{���2A�'�$M�I�ԣG�1���H�ޱÀ�4�����co�[e*w�#��Z�ʲ5�č�/�c��v.���p�.�&���|���ɢ!�tB�Ȼ�l���{����5.T�+ly�5
-C�,�͠$LPi<[p�<��k#���V�R��@+�Y���[� ����9���9���c�
���ߊ�P!�'B"m�b�c,ю���Rs*�!Mo'�{G�����{��[�8�AN��v����
�3^ڙ����&(��)����׏ުBҥ|r:�v3�"%���#1i�3Q��]��L�
e�I��=�\V��r[<
��Q���e
��Nq
��F�S0=��J+��<�1!�Y-6S�_�
�
�qc����-�;���r���m��|�0
���y��+&
�a��C��=��0��G���hOF>]}����ʎo*����CN��	���P�]~F������ɓ���#XzCf֒Ol��ǩ�a��r
�v9�bJNb��gyn~_�25��T�[�/e46�ZЛ�毞��Z}H9�cmv���O�A6��.��K����r��d�nX24�6�[
��e�(D����F%��[b��/g�`�
VU� �	��0hU|q�N!(�<eU)N͖���5�뢼�%g�P�C�jZ��I6�^�(�e�nr���n=��m����������LM��v��C�w��
�Zė�>z{�+�U{f+���
-��8���7�0X���t �̵
��L�S����f%��xZ|
������&[@Q�~���'��l�$Y:d,�߽�����O~>�$���Rn\�����I�KN���ø��{�؁yX{�r%6DžA�B�<NAW|���zy�(,��.���uy}�ď���q��9A�*]~���C�t�U�þ�N_
��i�ζt\�s$���r)����D.�'%h<Di}Y�`u���
|7Õf9B-��m������֓��R�
�O��
���/����D�2����mB�
}Œ���qgL�1�b�� �yf[a� Ǯ$bB���.
o��
E� d�o�픝�u9�HxM���nĆ;s�,�AD�fP����?�o�11+�����
�jAT�U����Q�
-x�l$Bf]K��ƕI�!��{��Wj2�~Z�H�B�Y�M~uZ^�۱c�d��
�ۧ�V��d�Hd�Yp4��ĄG�8��q��>7`M^�������9u�n#�e�����g������
�ѮF�:7掃��Fiߊ��hg�E5���Q) Q���dvҪ�|���4�*�4�~�v���*'V����D�{
|
R
mTL�$\����ΚA�Oi%ꃈ�-˔�F+l��I	6���i�j���_�
=a�w(
-��3
-��='�T���;S���񹊽 էU� V��ơ~�s�

��l�ć8;��=>��x�jC��A)��䖧ɜDZ��f]
8c����U/
�X9/ٮ��E�y*%d��Tv
�_.�m+�7��h�(�j����i�w �7\���U�$��ez���4ͳ�d�����A��lG!��\�1̫�]���&�>\�3�
}$
��4��-�QDt����g��gv��Ù�@��V��߾�
]�iX����i0>��9F��]Щ	H��
u3p��@�.�N��,U�����
-��Y%M h^�Q���P��y)���g��4˕��l�����&~2zaDޥ����Rˎ��b{C�{��E�I�1�
-3� ���'�R��f�T�d:ER�|�W��8z��[�t,��N���.�WxNj-�e�����˽��W�
,�Z
/Z
&�[h�S��>��~��j呱v����X��>d�l�z�̜\Y
A�B.-��w�G6a�Ԏys���]&�L��u�>���\d3��b at w[(f��������rL�N�}ɑf�+��|��?��i<��͖�u�{7��>���ݵܭ���l�}B߼(�����1�{#w�l�6�
���盇%
�ͥ�TH�;_�151S�.X%`�9x#�z�p� ���S}^ݤBݙ
�m��A��
�ۜ�k4���f+�
^d�I�|��F0usg�E��M�K|
�ZsF�tI��S7#M
-x4s��]���x\D"��8��ήk6��賮~�-@��H�O������Z��qJ�5�Q�og�1�>�㾙TڴxT��r+�Y��V�E+ AR�S���FC�
 rp��}~����Ff]�AD�ҊY�0]/�In���ۮ��7)6���9���<�����b^v�(#�s�z�pu��F�j��ݷ0݋��M�Yĕ�q��
�iY�ȋ�

�M��ҙ���l�%7�7
7��*��rnF�P�����'�Y�]�!x&�u�OeUR�Zp�&??]ϯ�D�Lݕ�{�}�S.f
- r8�ʻ��uS��?"z�f�������CL���`�*���,Q��A�{�7{� Id�{_�A
j�vS�7ŀu�Kv��U�3)�=�|/�.�.��w� $�0�z�Vc���
�
h l�P��fӟ�s̶R������d�$��6R����%�����}Pt�k
-�+��������5SGL���u��*��ߝ��]� ��E̅A��B
-%�/ڵ>6�E��:�
�=��[-�]��_H��g�}
�PS�C��b޴�j~��
��F�M�TW�
�m7��4z6t~�c���>���EMd�Ey���
NG���;?��[Gd:C\�{4�7�ܨ����>j�G~Ԭa�)η�i�c�J���p��n�v�7��Ċv�+��JD�qg�w������8�����Feu�?�j�&_U��+�8�!W���6����|~��$�3�[��>ؕ�޵+	MdH�
~gk^����j/�3
��,�^2�/߉#L{���k�
--����$���F�˖��&3�Ր=w|�X�ܑ,��_����镆&R���Ɲo6F_v�8�?L;�>��NM�����㚫rG|\i<�����%"�~A3�e3���(�6^�RX��b���/Z��E��o{'�_�O�gj8�t�:ǥ
���(;�	nC�`�/���X[@��"�d�4�7Ydؤ�䈿o�Ĩ��ibv�T���
�Վ
��[W�-�U��R_�1�

-%��
�(�W�dk
���]ǩ����|�p�X��

�Ԣ�D;� �/N� /��
5/@�+��> �=�ͥ��5��1�d�c� "�d��~�:�I?~�z�
-q81�S�ѝ�(~У�ȅ��]S}��<����r��r��f)�|�'ǻ���gW�
q�j��<{
-����K�;�k���F��
���ʭ��*��>�eCU��H�F�~~2��v�<$������<��� L
u:��V+(
��<�7��$��$�2 at Y/��WȮ��3���"A*.�A��<�<���dN� [�O�U�W2�T
-�H�]�#�}�"�Ҥ(�n�Xƒ�

����4�����9��w�����5?���)��&ؘ���W_�߅�55���Nϧ`��	Bl�#

fH�V��o����M�i-P�W
��m~ ,r�KÔVäy��y��#
ʯn���}MN^��d�S��%*Z�r@>�b1�N$��$�Bw��J�)珥t0�a%�n���ﺆSs?�a��
�j���eށ�
�����y/g�v�<�!}	<e
e�0��/4���ό�H~�>���^%v���h���3�"�����6�Xw�W}����u7���_d�r��K�6��6������j���T�R�m�~�d���|a2|*�h*�a���6��-k���3
m�Rc �%PCO=��٬H�V�'�w-���y�����ᗴ�ۡ����)#O��|�޳��T�
�����#?A�~ۭ��4�������#����C/�mwR��W�2P��"��_����
[�zI��=(�Z&��Hr}�vI�9�-}�S���
��
i�>��c�1ϲ��5Y����|�X���
I���
?E𬹝���m��Bp�L
dU޸5�
�
9���C�s�G�y5�)�|h���J}�vu$qt/{����4����z��+_E��M�t1/��fTĔ��`��LDξ���v��P���	&'1�r�P�<x�Mbs�j$�f�ph�O����*џ��dBg{7Џ=�$l�@w��N��
-!��Ƶ�%v>+ʪ+y����u:2�Ew�
+��$
e �i�(��W�Z�,�v�l��k
�����@��>Dq�A�d�g�Ed��nM)e�4�dp��՚\mF�
?'�j��PYT�^T��
k}��k�`*�)N�m� T�D���~
���

�-Oè��фz����
-e����7�/����1z͘��S:*�2 Qr]#�+,���Yo��bf�OZ9��S�n"YA�#��[�Z?ϭ��	��68�Nx�N,��0-$��ϲ����r̓�>���,*�x�}��<C3�r����4�";�l���x�2E徟;�_
-��|*F*3��GY̥���C��c2�3�h���b��%�(����2Ƒ~3���R
��q�!���w�X���߆
�IE�p�2W�~�f�tѫ
�u;���;w�Ƅ���sp���{�\����K���
�|N�
���9
!�d?�W�ةo��f�������y���ݣ�
�M>�Q�8�b
�-H���t�l
'�ءW��T�\���7%y�A���~񌀄3+�	���)�/֦k d<1љ&��9�K�3�N�/E|途�T�Q���Z(l�#��i����GP�=1�p'�g*?����X����d���<G����s�Q���^�ǭ�\�j(�T��
�9�H{
0� �h�G��$�[I�G5x��L��rY��1E"�/x�ǘk�Q�=�xe�����}|�k����m��ct
�[��i�����d���|�Ȓ\P+�6Yu��
LFw�Ѓ�ӞZ7�/�Ɖ�U�gH�����¯������?N$�m[�P���Q���
<>w͒���B������г~Π�tg+�`2 [...]
�?Q�Z�oț<<}9RR��^���p� 4˲7��>rrnb#B��$���1`XVN��:	�Ɖ~ˏ���L߾n��w��A7i�a�d�NE����tf�CD�͛��b�B;����K	�
��>���
�C�G��)c&�kc�M<4�
/R5�M�'r��p
�Q۶x�Wě��.�&q�J1�sX�������w��~�M[�y��X���Y��V��r[�\I�B�hAI�f�ޏ��-H��e7M�����C�*�
-dX�?�2��
�.Y�7�Ӧ$x
n(�KX��+6�����p;��8Q²����{��E Em�H������t})�3�C�Ԯ4u!6{*�%0��f�+�U`��zh��y�{]bmP�"&�n���@�_�����ꚇ�iVA��g�����Υ�Pք�ʼv���I��]|+�Zޑ~L���s!a�fe�u�|䓓�ދ��
�掲X�vͧ-C�qj�zi�Z��N�/(���%���fG	q
-�DULFł{
-?%j)�}GYL�`����tzA��k�)�`ʷisj&��\Fq�����d9���vn�{�.i��]���N:�Ue(s-��4�!���s�M/��>��(<YD�o!��������:S��>�.�|�I(ƃ�Q7hc���0����w��J�t�Z`��N�T�N��p�7^mȍN����e
���#�f�p
��Of��-h�˟�l��0W��|5̟��y$��}��}����:����<�m�c���:C�o�0�s�=*{�_�n�B�p$�%2%�x)��H�V�%�a�<'\����H)ۄB�Ŧ[3iA���[�Å��̳$
zy�틟4]x��޶�U��1�gV��7&�ω,�劾�~�9]
�L��yT�W�p��?����
-endstream
-endobj
-19981 0 obj <<
-/Type /FontDescriptor
-/FontName /ZRLUIR+CMMI8
-/Flags 4
-/FontBBox [-24 -250 1110 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 78
-/XHeight 431
-/CharSet (/greater/less)
-/FontFile 19980 0 R
->> endobj
-19982 0 obj <<
-/Length1 1597
-/Length2 7380
-/Length3 0
-/Length 8434      
-/Filter /FlateDecode
->>
-stream
-xڍtT�_�.�R�
)��!�
��0
0�
0C�4ҩt*(]�� "(-���J�7�?���w�{k
���8g��<��QW�G�nQ�Ð<��@	�����8 �XY
�Hg�_0��
��$�W��;�Da� $*N
�{8��"��@ @ �;�.PyBmZ� u8
� `U����C�
��c����9 ���ܿ�r.w(h��ԉ`�3@�B�>�Q�]��t�������� x����
� /(�����{Bl�h�\ :�%`8@p}�
�
�� g(C�2<`�w �p���&@����'���l ������+�W!(�w2
����`>P�=��
�(k�"��� ��W �G�<APg�
*���A e9= ��_�!��PW$�u��"߯2�)+�l�..A��~�Pw5v�?�u���`~vP��ݯ&l=\�
aP7���_!(��_�
��Dń 7 ��������+䷓��� ���
-�C5	��AP�� O ��	��ߎ�����P0`�������!vl��ݡ� s �{� ௿�,Q�Ü}�
��_>
mEUc�?
�㓗�{�x�<�@ ?PT ����2�
����� �_��[Q
fG���jz7��/���
�?�І��
���}
�0�����V����U�q��/�����������A.Pg��P\�@�t�G��ߡƐ?Zւ�B=\�۫���!�Gq��_���t�e�7�V�;�a�߻@��
�At��'���%;��YA�6��B�4����_6�����

��%Ga ��
�C�"���tk
��Mx /
�D� P= �����,*�������|(����A�Q��k
-�,W�j�0�@ ����5�0 ���W#�d����׏*�p!
�A�D|(��~M�b���!�����)���������=��QS��e����?X�7L�y~�X�vV-wߋgsT� ��D�g��
-ٯ4n�����=�Q����_�ʱS[��,wi���[�:�
�m{�������S:�i�&��T�o���t�cH��el���YI���Φx�Q+����iwtUgkRщ�=F6�
l
-��~����
k���ɤ!�qN��UE�28<�@�G�
���y��$Sz4D�(�[e���*��n&����]�]���e�ԳZ�c���]KFN���F�>��"M�䧙��ɲ���'YL�?�-Qx�v�8yWьDǟG
��
j�m /��XvW?W�#���`9�U

{���w�؋,9�
��[p(���
Z�`X�kqpp�DŽ�K����
-/VN-�h�����$��}%�)�Ù,����s|���Y��0r�-�e�����^�
-~�>{������O�@��`U5N���HC^�Ǵ��%��Eⱀ
�@�L�xk܋c4G�h\Ɛq�:�`D>��	Mke�_�@	����tm�b�>Ġw%Q��̩�
-m�������b��KDϫ2(���9v����ktu�*>��W��NZ�@��
y�k�+�y
�D��SV�!�lz*��%y
�
��kR?�S�Q�� �Ŋ\��
����
-���
�wddY�̚s2r(�/�X�ݙ�
B:a
T�g�\�g:��9!��s���%�M�1}�p��i���\&�!x��<�
S{;��M�	ʣ�����Ū��8h���3��L
-�YE��fʸN���k�����D�7y
$��Mߞߏ�����6Q|���y�v�
ŗ�����{�^'@{����Gtm/
>r1��G�eԎZ��,6�6|�����9�JL�����Y�dh�%`TiXPrK��n�����V���+�_�֙	��ĥ�*sܡhn���2�p�La�wso�Ry
��(�%�Y�b��Y<��f�*a�"
NuЋ��9���g�����">
U�u߄���3��T��ʊLu4�
�����櫭��ƾ��%<o7�=z�*&q�~wn�2o�>�̫w��g��r(z
-��q����e�rd����
-��D2p��b��-02���3���7��5��6?
�y���{f�q����n��Q��7��g.�ʋ��$,�Xq���W�l��ƌ}T��ɰ�/�-�>�oUu��u�J	���K� :�9�a�	
&Z��O�E^(�v
�h�Г��CH������H��Rv/<<��҉%AIԼS���޵{	
��K�9S?�-�O�`+��+���.�<7�����N��f�	w��c�0g��B����N�}
b_�=�e,���z�k�=����	���&�X�z
)!!7�-&�6	�
EΓ֔����2�E��iď���=v_�������R����~��Ў�]
�\�^�c����¢҈Ӓtn����L|�EL�/|
��Kc�>�'l���T�OM?uԀk&��d4_�< �z+Lrs���'��^f�n���f{����Y;%�<2�e��rjI$��Û$��
Єm
��
l
�$?�䕲�s0P��v�&�5���[%w�֬��ܻi�"�� ��eM�&G�`��
x��3�B#F��n�q$��QF9��p��6k�
���
5��O&��V�V���Lrg�Dw�˹"i5;��H�n�'\{/ؓ+���#W��-��li-U5�/�Î֑�x�Bd���
iشl�XO[R�BأR"�B
����A;L����Om[��s�Y{�+_��Bw�S��5)�M��}r���m��E�a걇����g#8r��o�!����c��l�F�)�vhǺ"��MJ�Q7Ž$i���ĿG�������$�X�1'�a����l*5g�����I����6�9�)	�E��L�~��
澚DIO���Ϣ�	����R�����&���b�O�/Nn"����|��g �O+%x{��H��S�W
S���y�Pї�d.����
gSj�p�
-�j��C�3�d��@X�YPGp^���z�[���Wz�h�B�:��%�F{��j��7&uS�|,T�<$��y��N��{=��C�yDr`p
��;M�j�M	�݇F���
����ϝi���[L~*�rO@�#4�
4�6]"���� �gW��U [v���Iz����4
���op<
�q���rȕ�,r|K���5W/mb
�ĪRC��fr=��=�]�9I*ŝ�5���v�L���hx���D\�b�5�@��E�U�uk�����b:7\uj�;�3�8���<���%[�H.����ƿ�iǜ���K�������l�]��t�y�m�j�
�1�Q�#ѕD�Y�76���ϔ"\3߾��|���G
d'��T(�
�J�}�N�9� 0�����Ťwp�Ҫtk�b�=qg�"�P�\x�<aM�Cy�8!�*��T/�����J��*̾
-a?��Ր�ݢn/{��a4��`�o6'؛�+>k��O�0��%듷��{�H�A<`�[�ZC����ש�=5!�#+YB�t���j���M#�Ls`�E\w�I�rNa�n�'�&��T~�(�}�����(��j�������ą�я8�H��	>l.Ք�dߔGX#
��bE��T���9-�?8I_�w�ة��k��f�UtQ�W2�2��KJ�]h�ȵ\ݛw�����Lm<Q��������=G�����&���\��\�G��]�6[�M��|���������C/~Y�$�>^x���›O��MK"����i�Y��0lGñgj���6�Ǎ�ى��m�}J[�
ʬ@��e�,�����e:�Ǥ�[/YK
�Yŗ�n�j���`���sL۩��a�K]�ʜ5ⷎ=�Ć�]�&�.+%e����(����%S�,�/�Q�{(G#D�G�4	^19�~�I�
��6Ef;��yO���^�z��<�$��M[oB��x	X�\���V@��U�ξUj
-*^.�YpZ����MH�3�0����o,s���L����”�x�N�{g
���l�I�.8�l�_P.��)4:��
-�<9�-�t���+?�s=� !�6�}�����q�K-�1a]�Y�X$Y%�o��t�M�GD��:w��������k_�g�'�m��
6.?a��P(ȍ�e�;�k&3=���|�N�P� ̃9��s�;����&�
-^bI�U�fl�Ġ�/�O+
�P��������}��V���*UF��LSɥ�C!�q4���i�
-�[�.t☺R�j��S��yC����Y��2�A�}-�`q[��/!�!

g�`��
lûf'��_�����b%ɴP�\?#ۈ�`N]s�_UB�����;�֙!H�%:1
ڪ��� x$�(!%rM۟{����^M���C�ǜB��K�l���u�

u�§C2��
tUr��?�.��C��^�.
(Uj��4!^#��+. 
-�O��1X��K�R�3�7�%c
�Ցe��̙	;�1
mSɄ�'��y h_T�����p!�4Ɖj2����S�(�˝��N���<A]�@lU�w�Knf:>$,_R��AK�#z�
�x�l�X�����3��݋��Dޮo.��-�ۛ�X�U('��1���������E�y�`l>(&�fX�:���-��zz\<'�ꭰ�ށd���Z�$'\���2��;��G�d�ө�7hf�R�dkR�߲Ǩ�u��	v8�L,��/!�[��1�*�v�>O��FÂ�W�]
�����]���B�^�����
8lg�nV+�<� 	��㴥���m`1d�k�
��D��

��*��GM���[X
19�c��(9v�)u�$2��s���O���6��Лۘtչ��d�l
/
`�W�
e�����n8�hm��� 3po�Ihb�
�Y|�:�!��H�.��`U:ǃ.��G�Ϋ
eU|V}9nvj���
s�,�sbU���Cf��ٲ�N|8�l�%Z`hTJ��P�E7�4.F��
��^@�\%[]

��Z}��#����<���rk��g��z�8�%N�F�FK�P�68����.㛴k����J#O�~��:.�N'�>-4����L6.H>S
�|a�#��z�|Ɲ[%@"�Z�2JGQ�[3
�Kf6�o~(w��龘��N{����"Q�k�����
-���l��Dx6w}�
΍;��>��q��Cy.��1;���B�Z�
"�3o,�ف1��ˏG~�� ��&��*8�}fO�?��R\�a
9a>��5�{,����ݚ�[����C���G9i�E���:�j���_��k�F�����9<���B�0�����9��Y[�#��`��>�
W3Ь_<����/��KDa4���>U`���0�s��"R�N��y��Gsey�)B�������t|u��@ǃ
���[Ɇ��
-L��j�
7d4�e���J���Y-�ClsY�w�e��x��CIi���+���̙	J�U1
-oH6�r�~���Sw� y���{�H��Bv�s�䉘6�t�/���;��c�bX��r�x�l�,���6�ԙ,L/�3�jlk����5�� /�?t�.̛�8��tbIf��	n���c�$�JC��鰷�ɸ�9j:�O w�!�&¡��21�������{5/�tV��k
J�"�%0�Plf�����>��6���$�$<0E��іi1I���"
-����/� jky�<�[�����̗;���0�4�<����$U�N��Բ�u]���ԧ
7N�����������Fk֯
'�b���Se
��d�q����{Z�
峕�(���q
-\1���y�$�%��Vزv��'�}�,b��f��>
tR�L`Rp�NHpL����"��VX^=6�
[�f#�R[t���
��*�=�޼0���S��9����h��򆀝h�;�j���C��ڐEN�wS��2Z��/�7�.�H6Ί;T O�Sď4g7�KW
-��=V���tƑr��/Bgc&{ 2M���޾��%��:ۈ"
�)�n%i��e':��t0E-�Oq\no�n��ާәt�i��Uw(�'?DO
��H�a��-�yF���
y��;�������p=��M�'޾b��L#�NP#y��̣E�G(;�#� �����."��t—pSJ�OJ�J�˒c'����"��6ѩ��?
�-��7O���٢��_�p��\�luPN7�A�\W�uw�
��s��)&�L�~M�A��
uM���f�������

#��Y�Y�7w��Jx$1����<e":}�\���nTW���?�w�
w5�~��ah'������S�7����7a_��1w���rz�[5��(���V��y���5[
|R��eX
�A�'���o"!_ٷ �캸��s.���g�an).�IS�_
I�����$5�%3hh��7bn����D�rfÕq�SL����0�|r���.���g�g���X��vz^�=����i�ijR {v�ɼa�׬����ַ��,V}!�W9ȚT��D�.�u 8{�E���>�k=|`��l���:�Z~�N2�c�	T���f
-zlp'i
{F
����y�ȵ��7�|
J�Irt�	T�=�D*�I'�}��L�@���Y�: ����۾�>C
���ҫw�C�<�>��,g~&�
��i�yy��Es_�q:��仂�!
ayQw��� �G؋$��T�*evn��<0���
_���UW<�y���&h�U
O�9%���l
R���ܐ�I�3��L
+�хn?�A`J<[���`7	�Zm����� v"�x���#]dk�l����'"�]�Z��&"33M<���8�а^�T��(AK��֨C�� �.�G	r�:�F*?��7�s���;�lv�����r&
�g4�z����f���̟��x�����L(�Z��ED��jj{��EW�!!,�Fĩ��

	2"�B[i�o5,��f=�{
,����˽C�>�]��O�S��NJLJ&k;0�L�������E1��9�
Q��
-�o�Wn��7b6e��,���n�#o_�?c #3��Q��f���Ķ����$[��"!ۤ ��g�vj�[�3uaUB3e<U���X� "�OeN���\�y��e��
�k�a�U/�����_7)_�,�8M<`���g��j@�>��!�ܾF�D������V�����Nm�
�
,�6��'�ac:f�2��0g՞�s���g�g�	��^ԥ�U�)#F�Հ��H-�7�{�� $�,�)��,�^
��O���޼��
�
���\�:x/䕮���9	H.����"�2��y��6��C
��L!i�1k�]O;*(��qW�
"v��dˇ�)תʿE���=ƕ ν`r�LJ���l�-��,/Y o���
�;b^�rr�P"��F�'@;9\����2�G���{F��le�h#"�ZԯK������A��N�
�ߊ��W��[6��3muRA���7�y�/�nYЫ^������"o�w�#	
���0����W�m(Nq*Ӳ}��C�	U [...]
�8�W�G����h�:U����&q&a?3�Xw?�v�P����Psf���ʍ�
�!�vt�j���ѥ��|�� �@�W�����w���]�OR�o
�
E0i��H� %BR��
-�j
d#�ny�vy����S)T��R�--�v� �Ǯ#c�/LnU�ã�.�
�}k�)�h�<H
�9�Ǧ
�r����,�?�'���*"����k=E�)�����d�7�k�����}�!�$�	+�6���͙?���}"R�Ѳ���ﶟ�b`%��Ϻ.�\
�]fy8���&��[]�cU��S.�a�zbT�L =�����rj�W�
�
��&�y�͂e��
�$M��mj(b�7"���@�M�A}M�L���::�1�n�/�v�b��kD�U��[�
��fZaWNB߮I��Ф��G�K���#CJ�8� v~?t*��0�h~�Es��y�~
~�x�NUM
���6�C-�
����e����� �4�6S<+�0��i>�����~K>�.�M6�l
-���!��)@Q!��)D�ݾ�R�WP��E
}��ZMy	w��դ���z�G:��Z�d
#�#��$ /Ŝz���βt,�s��E"��vz$٬ӺaA��JͽC
vƄk�7™�V
m<56�2�������n5Ub�i�0ќ�
U�G\u]zB_
+�=T3
-endstream
-endobj
-19983 0 obj <<
-/Type /FontDescriptor
-/FontName /KGNDHW+CMMI9
-/Flags 4
-/FontBBox [-29 -250 1075 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 74
-/XHeight 431
-/CharSet (/L/comma/e/epsilon1/greater/less/n/slash/triangleleft/triangleright/y)
-/FontFile 19982 0 R
->> endobj
-19984 0 obj <<
-/Length1 1546
-/Length2 8458
-/Length3 0
-/Length 9471      
-/Filter /FlateDecode
->>
-stream
-xڍwT�k�.]R��� 9twJ��5
300��!H#%ҥ����4HIHK�tH7�?�����s�:g�Z3�u?ם�u�Z/��!��
���Dx��$J���@������ 
��
�<6#��;
���E�
�)�<��H�'
  E%�b� A���H7I�2�
f��<F" �xlJH_7����}���`. PBB��w��3�
! � ��}F00D�a��
-�)����"������rv�C���r� �a
 �;��
b��4@�
��7><6����'�H��7�
�7�a`����aqܧjht] �?�Zx M ��'�_޿�8��`��
�
C��08�������� !�~Apw�?�
��l�	��*�@�-�ՠ;�
�������n��w��9� 씐����;����an���}���_'����!젿��t����zB4��"ݛ����C< "�bB� �+ �v���≯
�C�o�}��\�. �}#��0(����
�x�yB�����
���= �{���f�O|/7��\�^�@�����,�Ef�D�}���q��:
-O͸���?���H�/P�+("  
-Eb���;�F�w�X�@����WD
	������݉�_���ku� ��Ay�i��� ��������G����.I������� ��ap߿(����_m��� �7���Z+"�v��L�t�&
-�{���������Ua>;=���O1�i������C��� �H���%("
- ���|���
� ���{h��C� ~>���p_�s ����$� ��ߦ?н"�Ap�,� ~�����^����{.�_��.��B ~�Aa �ۿ�}
���������z� �>�������~X��~P�?�w oz	�
-s�
k��I�֛wmPP���(��xU��kC?DI��X�}̔B��z��"ɶ`�]��	���Ղz�$�tu&�v���D�r�]�Sp]����FagO�_o��}"?�E��z�6��SM�����a��v�m06�J\\-�Y!��L�Bat������n"��ϋ��>A�宙b
T�R:�����I֖l�f�(���0`�m�]��*�3�),��ֽ_/�Ts3c�ۗ�h*]��j��
-��@�c'�/�S���h��m빐�bw��I푟X�M`��鯩�u���ݏ⒡.�XQ5w+���Ad�K-��[�5��)����;�n�n-�(9Č���r�U*E�G��h/�������Dd�x�9��|�+�ø��آ
dT��^�k�r�מ2�L�������E���/0(/HR- � �cGy#�+��wrn@'NS�mإ#��y3Ҁ�T^
_�mQ_����ڔ�>@�����w�Afm3;�{ۤpPO4�x0!ʀ�A^h18�^X�\���Π���\�8gd�R~VlJ
������r�3D̵�L��T�M��ώ�"�>�Ojb#�n�U��W���11�Ȳ
-�h����������؂S���C�z�y88M6XR��1
�Vs��3����Pv�F>�ߊ��m8��w�)Qg�4�ם�2L߲��~șP�ОV�ݚѯE�J%ڽ9�ϑ������R#���d���7i陲R�.O�!!r#!΀t��43B��i�'�Z����T�_�b�lfl��%ō9��a.h�rKX��X?�Cۋ�)�&��"BC� t��Q,��#�6���p����N��ں2���_�����7]TQ�>�h_��m�'S<���S8 vE�w�����
�j/�":���̜���������
��v�{z~(�P���E�/���u�>(�����S�g�ز$;
�����'�n�����E9��ʹ���KZV�t=�ul�H����.'t��~&�)N�m4��
��/��̎�-����TO����0�w�Pd74�qD����F'
�&�Cv�G$�6o���4O/۩��#WӰ�4������aކ�w
-M���
z���u�#�;m"p(��XJ':�V
��{�����c'�> =�w�;%�@�7y��v��
N�'�,�?����j�X�z�yq�����Kz
27���r�CAe���P��Q����f�1���U|��
\
K����b�.��ʈ?z
%��)*
U��/�;f�
{Ac)_Z����f铚�7LS*�)�H�YZ��
&>(��D���:�Qc
-�I4`]�f
1s��
&
���`[�����45�>�{BX{.��h�qQ���^6<��w5ť�cV{�]W#�]4��8��Ѿ�n^�EC���9�
-���T�����
v{2(-���>�:<�mr
N w�OR��#�ض���R�Ÿ8�.'�M�e�_�R��*A�/_Yz��cW�U������Z-F/��?F��I
�Z��{��"Y�� �y�
�a����(*��$E�kP�c��Q��3r��HQg�aH�D|z�<�&;�
Sv�!}���Jox�*j�am�ԵUkRx��p9�8 �ם0�w�J:z�{��/$��C�Ga��ne����/Y�$:�1�b_��
�¦o�����ަ�X��x��ϞR=�9��ͩݫ�u4��\A��o����.a�5���v4�j�cC�$R�Z�Th�ד��+��}��Hv��S ��5N��z�G�F�S$:T"ܿ��p�v0�Y��q�����;W���c�g��]�g��@�y)Ԙ�ڴ�C�역�i�.9�d��b�l�
x��6ۊ�
4A+y7R���_�w(8��͞�u�F�|3疳%�UP{3��|�cL���.�-���PQb��i:�l�W�7��M޳����C��4�Kb�e�
o��p#�5L����N�F�&èS+]��ψw$v� ��]��_��+� `H��v")�B)��9֋fY�qR�
��.�&�Nl����	g�A�'u�h�" �ɵ�U�z��l�������d�5=�k�P 
�ݗ!��IS���HӀ�C��Q�� G �	�`�)%�A�
����`0����L
������T�?�X���`}�8kY��~uة�f���U+\
���\?�JD���((8~�a*ϕb�`+{B���'b`0Ͳ�G	}cb�z���]�݄�\���gb�A�zY�
-)#�G�C;��B�.�8Q�3�ٕ	CS�
n4��
-�U�^Fu�x����K'�eǜ�݃
-�>�����ǝC��e?Pol���3z�3�o};�jgy��x��P��h���7J���u�%�b�.���J�U/�}%��Gk��+�%KUj�E'��
6�d`
�R�B�ʾ�����D}j
̺�&̰�~���/9�b���A	/�
c5������@#z~���=o~&wZ�n�9^�K
��d�-4�i��S��|�ü���r�v�nS��]�P9����9c.ǯBV	�E|�$����.b�n��H�j��3��
^�6L�a_�����qd���"��'$�Ko"�Dk�C��|����׽��>��������=�E����&-_��e���
2�Q��MT_dy*�F�l<���}_���	���a��Q�
�^Z�K����lɟ[�J���i"�o1s)�:tV��/��s͕:kW�v��Řf��o��=�������U�:��圡�گ�
��R�DWc����ɪ[���ǘ^��NLD%���M�$Ixس�P&�v�
t�վ�U_�ɰ��X�
�.�{5%�W;���R|�'�
�'�X
�‰뷀�p&<���Û�vm�f�8����T��*"�ic� �F�0��0�m�whYؐ'g��KF�Q:���d����l�g�a����C�O͢C��3��$$

->�(ܶrX��q834�ݴ���{6����ELv"ɜ�̨��qݰ��x�͋�MHM�%[)��d�`���^�*��h8��g&�h~����w�%3+f˗oGa���\I��
�+������U��Ou��+
S��=�LJ}�8��fFh�M��{z��Ћ
�ehJ�U��Ԕ$@�[�ʒ�O+�L\߿K���1�E*��|�a��X�H>��:
���������IV��
ґ���l[� �z:�&c�!KU�����}i
���bP]��*x��O�Mr�ɱ�ZN�`=��6} Ԟ�"N��"ԜgN�x��E���9��0o�
��dR�^���h^�6T�A-�K�R�z%b�̯�נ��V�~5bG���,���^=ohљ��`���)dL���) 3/d����ۿ�VLd��#�#���$c��i�X����3�V1��AE�n�b��%���
̐}�n�
-��|�{I|8%�noqX
Y�����'Kb�QuǴ'pX�{r�e+Y�GY<���Q�Sd�=���r>_�!d�:y���)�y+l01��Q]�l�����!�
�xRL
�KK�k?�
B�F� }/�V���>���^��
n�h	���%t���E�6HY��%�����/{m��Nܑ9:bی��VQ�Yc��wv^ȝ|G��O�l�j��fz�
-�H�Z�.���g
���"s�6��Q����C�9�	���G��I���=)�o�0�nW�(Vb6@����`�Fj3K�4.�������
��@
T�V�Ǔ	�f�@��b�4��#+�_��U]��au�W-,�G��_���}
�u}t��q��>��!ds)/�/�������߮5,6����
fAh3�$-�/�����<'�����jw���
�~�_NKU�h�2��ܑ.d����j\�R㹋̈́���_����R�b�Do��%(�2�?3�$K�����f;�-�µ�Du�Xu������/�̨�_�oג^��j b���'9r��W��
I��Xw�B��.Tc1rYSZe_(!
-[�� �ͪ��*�G
s&./pTx�F�����'K�Q|@�6-a��t(�s��s�NG�t�����k��MS069�$��P�f���$ɽ[.�hߨW�s
)hnC��
�*�	{2��|&4�
5��p�<��H���V�U�s�랠���ya��u
�ܶ΅E��އu6���D�kZF鿸yA�\O�]%�XG�L�W���^3�oS)�뉣5�0OoD�Y�,�9;��:Jhܨ�V�~1��Pp+�X��O

gk�.�{�N��n�
>
�3'Tq(�V�:_$�WB��`Y�i�eѦ�<�I
��$� F���2i<��#ְ����rm��gP�~�9��L�i7�n��9𥾥4�b�
3$ҳ�J���[�yJB
A^��A��!��՝:N%������.1���,�gn ��jcWt��G�y�,k�i ̲���
m�ojA{�Hb�޶������h9vc��7X����
k�D�������d2�J6�
��
-��;����.(;S7�]���E���r}��j���j��^�
X�a�Ùξ�Y��ìp����gʯC��:��j��!N\�V��x����L��΢r{�sU���3Di��6�=��5�2X����KY�(ѻt16���e9(M ��rघ���ԃ��׋�t��@.�ױU�&��kO)O��^�%h���r��jr�G_� p<r/�!��������ċ���uѣNv�DU$�<�v�N�
�}z�
P��A'�`v���@
�3��A������Ŧ�!<]�;�����ZS����5��
��׍��/T{�N�X��^���
M	=�I�W�� �.P�z�Q����9�_L8�P�{�$F���0uÐ�uGA���ԳY�����[�5S�����X?C��m���k�/�}���b�oq�_O��Ȥ�E
aG� 
X>���>�A���^-8��_�nJ�3{�����8�8F
�
�_��r�;
4���f��o%�-.��{�J(
<�Q�Ƽҫ�Y�郈0P���]�JT�cZF��x@�u�,_8�A���;1����c�f^�;�K�^��F�1��
�\��ꠣ�xT4fa�ɐ�֚U�d��;�7�������z>�R�بo
�K��]�(���7��P���@��?����\%�#b_�~�Df�#�X\@n���
}�ێ� 65�[,v=�t�a�R�L����q�A��d�6���ȧ�Φ����[
�ɗ����4�<��I�W�W�p�V
x���,QIH#8��Х!|���_X��Z/�# ��3V� �
.\r�
�
����
x�S-XYLU��hnȂ�vD�V#<G���u��@Uk<u�����U�Z�}$5�@HF3]�B(ڦ�2x��"���balK ʏ���Zς�H� f�m��\X��:���S���5W�I�����-�����CP��]�ѩ�z|��7�:�	�����
-w&����.h�.P�G��Uې��)
-vm��`��e�P ���짼���β
�ܚ��XL��n�4��}`Rf���1F>Z��������մ���k!�$����L�VV��~�]
W)=�9�QcF���)c �3�g
�T�7bD���H��7�9OX�p7��	>������
��1hn����uZ2)����ᡈ�(7�!s���{�)	��|V�
��S
��	o�����g�I*6kK71v��)�af��;5�,}\�El�n�uט
}�m�t�V�y��M-@��<N�ڴ��s&#9!M���u����2~�Jf��=@/���ƣ���/簛�O�Ӝ��7�����H�YY��W�cA9N�߉�w�Ws2���A��+�/P�<)~��nz!���YH0+��%뜿�$���Y�#���i����l���fUHڪ�
���G���Î@4� �RRo��1-լ�c=D�/�3�N��	��
wpwkP�x����=cD�b�j��y��&�k���!�
?�U[Ϟ�Yﴽ�QN��g
��M_B'?j��p�����R�<hr��ȼf,q��i�p����fw��";Jyk��m
q}���c
%@n
a�b��1��g��Cs�����j�'Q�MӮ�Uϛ��H:l�dQ4�M6vo3��i;{���:� �%�C�W�"A
O�kږ�� sY�PB��U�!N�47~�Fg��Ѕ������¢/$�kQ,:OJ��p��E��>d�=2߻����iE�LL��I	�A2�KSy|�W>#� �G�Z�m�.�#(����K_ਏ85&���%*�{ ��ͺ���6K�1i�ܔ,��7����J��grZ-Ե7��u�[��?�d�Hk�ݑ�5��u�,�0�oY���y������B�N������m$
�7׎א�Q
���i�_>c6ޘ�[�� �Jq�6�i'�ւ�u�FV��P����!?��li���h���#���R%1񰟓�����4�c�?"��
c�F��T��S- �D9�,���5T��t�������U-I�����-�Zv�E���:�F���~�W
��rs�7�O�FzkxU���z	
_��Oģ ���qH}��21�G�\ͻI���0
<���'��������B����vz;���(
5����E����Sĥ�KY�k�72 
�z���=��l�A���|A��^���(y���/Z��kx�T{;/�}�J��U�R8 �[�ҫ����[�
��Ҟ��G�{D�DC��y��k7� �
4
��D,s�U�Y��*8��h�X�����RbM�[�������d�)�h^�,*k��2!M�+
���$�H2�=�*y�Y�<�4���j�����j}�����Wyk��a��
R'����nX{E��^��$�w��f�
Dzi>���M�Aơ���+�;��g�|�k燕�����X珩�6�)��֔��5yy�&� f��[�������0סg;c$��sȼ��Ub����
��p^$�?}G
�|
��X�.h����Մ��a	VZJE2�����f����w9,��7�̱Bj6U��(��@;��t�!rs�\����ar E�+�:Z��D��l)�5��YY
t-����It8ߩ	7��y2Ѯl����
~)�%��1��`�{G
���{Ppk�� �;̩X����~�h����V��
A���w#�<1��4+~����yS�5߄?t�l�ZGL�t����E =(���
������#�k�Qy��x�BPRn&��
��< �R
Z)ĭ�Bo��@ͽ+Lu��xi�kFtSN̾��h�q����(�%S�&����_+v�
��?�_K,��
�
-c�Ш� [...]
-"�>�m�z�������B$�}�AJn���Gߕ��K�,w��sn��I7��2�ܲʽ�Rɛ
-߮v6��������O_���>=Y����N�ry�?E�F�0�K�Rl5Ms��,
Ba
�4񝖸pG���[+gGt
�)������� m���j�
�ڬny�S�����~���5�4w1�]��+����y�v�+�K��M�'�
��	��NU
-zIY�F)�q��]8H��Wg��ɦ��q;_�
�ϯ2�{�b
��0�b{�j�����oz\���:4�*C���Ͷ()��GU":|�C'�ۃ��|dÃ�ȯSB
+�Ԟ��qG���������01T�g�|~��M�ru
����|-Ta��u���uD�,��p7��7:�9KSx�7~�0eu��Яna;[�׬�r�dw<]�F���.�<�96>v��AM�\�  �����
����V�o
��K	18�r���w�n�Q4��zO��׮ܣT_��Ҭ�Q[X$�̋�#������LZ9��§�ɷ�
-4���:
㣵Q��m��
y�Pq��Z6m�г&�?J�Rn��hմ�v��` �K�/� ���q:b_*So�"y�_�&�虣���$(���̦�������e/c����9b��˫V������oPIsZ'���
-�,��<=�ʟ`�����Ez�{DȡD��ܾ�	!
�cv��R���ˇ
�YypR�����M}hۺ�4��@��8��-`>\�[<�<�\��$�b�"W�\{���=uԤ[Vg�Np�a������X���O�]]i�

-�A�bI�)��zT�_�Md��#ʫf,��_�+
���bG��%���sh.�P��A�]����)���B&w�n@/�s]����Hf6�Kګs�����S
k�����:��nY��
�	�T�O��
y���`��6�U<�--����/�
Qhv��ӂb�eaVۦ%O��[�5J��ji̤�0�)�:�]��謇y��Ӌ$ރl���>H`��[���W�R�įv��Ǒ�3�V� 
����V�=خG�,�I:�p$YX[z�+`��
F�=~6�L��A��lam8-���jʃӥ�=��Yu��Z'
�|Wu��d�[�=)���m �`�k������_�1;J˻�|���!�_��-Gc�
-�tc��bb�L�6�a �6�#����u�[^��9����K��t���~H��hU-�ˀ��v�w]
-endstream
-endobj
-19985 0 obj <<
-/Type /FontDescriptor
-/FontName /NAIRUZ+CMMIB10
-/Flags 4
-/FontBBox [-15 -250 1216 750]
-/Ascent 694
-/CapHeight 686
-/Descent -194
-/ItalicAngle -14
-/StemV 113
-/XHeight 444
-/CharSet (/a/alpha/b/c/e/l/p/q/r/u/v/w/x)
-/FontFile 19984 0 R
->> endobj
-19986 0 obj <<
-/Length1 1358
-/Length2 6062
-/Length3 0
-/Length 6991      
-/Filter /FlateDecode
->>
-stream
-xڍwT�k�-�tA����kB/�	HoR�J �H�7�
�4��Q@��"UA�&E@���?���|��u��Z�;3{f��̞��pq
);"�`
%�����U����	���ȸ�L`(w��~2.S��7
��_U/(��AP8�.��q � @IY����( $**�7�%
P���
�� -
�Mƥ�@�{��]P�>?x
� @)�_� e���BP.P\G�;�� ����U�W��Bʊ���ha���0��Y�O���\ FPo��/��2@��CM��
`���
0F8��/( �p�9@�޸�#�
��0���GB��:���?� 
-�S�O��B0��d���	����� '�;��F����O ���ˇ�B`�{
���! ��! �c�����
�������(�
��Ꭺ(
�M��|j0/����E�
�
�@����`pG��4
}�"��0O�]�?����3�����@=P?��
L���_A�O7�Cp �8�h@�aNP�Y�7�
- at y�@��w��p�9� �Pg���87�鷍���`%�� ���'k��
pw��F,r�P���H���UT~�@!)�HB'Yq @
-���2�������@`'�O��p'@�7�������0x�l
��
�89C���������
����R�o��Y�����>����W��7���C<`��89��p����-���f�����pw���]� �pg�ȅ��¢b�0o0��h C9��V�o?��N�_S�iCq
���p����IH ^^2�dq� �[AG��/�D��.�;{0�	�E�s`@  ���#�W]//\�_��5�����P�ԁlz
-� �Z���V�-�<|g�k�,�O(p���	%q:_Mn؜סrz��럖�y�f��7�_?jI5l=
:�M6]n%��g�dC�E7+)����Jйg�i�A3~�W���4�Aэ�~/�+?FM-��Hj��U�	�ߋ�Z6�Uh�7��I�b%���88
��k�]+Y�,x3^�4�r
�p<0�����t�ɒ���fp�;Pe�����כ����Ϸ��C��2C�K���9
i����R�mO����UM)�[�^x����k~�`��SFߓΡ����&�C	y3�}d�
-��K�F\H�D���5��ZG@dϱ����8W
-4����L��ke�k�Hɍ�*��ԙB�36�
,9����
t
�Ib#\���"6Ϯ-J�<��z%E�Y9��^y�����}��=x�3~,�$���fR2$djǬ`���

V��H��P��M�4�0.
���E�	�?�?̀�oLgbl����8Y�K
̂�����hp,���(�*����:]s�ɧWgr.�G&K�@��U�d_�$��8[-�
�͙��1���#��a'�EKg�̍6��a,?�l��	8�V6tHF�&���gAsn����6Իnr��	5ι�z{��h &A:�*&�M�=(���V�-Q��x����{\��օ�
�6���M
†s
���
��������s�͚�[�e�;����_���,��>jy`4O��.�ly�q�@�ƳK6R���u2TPf�$��X�D�l�D���D�\��*^K���;��O�M��?e
)�
�婉x-�m�fBx
D4a�3��6s�ͧ��ƆAF�3�<tu��)��V�C��&��g�F����W�#?��N��
����hT1N�z슑��ے2�>�p|�/����)�_�
%��V��@tS����s�dz�	�*�g��Dj�\���E{���	V���rY#)�Ǻ���g{���GZmO|�����,ԝg���=�6�f�D������%��
�}���+�%t��_�о��U�x�9�T�ؙ�I+�tg�����R53�_��]�T��EE���՚q [...]
9���\�Dm�qGb�s/�\���W�f ��ϰCC���ߵg�%aھ�Uxj�HA<�
-�����O=�TT
BA���mS�.fgu��Ę��ɸ��XԮ�%�K/�3꾞�G<�*�F�𗎛�wȶ��R�Xۙ�=�L��4.���w*\�Ƿ�
�����$[

߭O�*9�,��*��\șV��85�0�R��3�s�\��2H�&[grf6{


d]\TB��
-JsKA�
d
-~����-c�1=�V����d�<㏈Y���-5
��m��d�8�]G�Z�%2����9?
l^�}/}Hw�N�2F}��2�6���|��lkS{0 
a5
\�Q
��IÄ�0���黛�
O�qt�T�?
,�_���Kg��s����c;�
mɚ��Q��l���r>�r��YC}��JhF�|z��N9)E2���a[AA{���]��J2,
)2 �'9j	�/܇�
���"�����M���nn����<$���Z���.��@Q����U�6�؉a�*޻S��Ri$�-x�:�rA.[��p,��.�r
1��\^�w0�K
-***��r�(�Ԃ
ۼ��-�q�+&���lx����Q<N)�2m��(S�F�ꪶ���
�m� ?K�o�o�Nߪ��^�+�
	ר�Y
�Nw����.2�iB3�ǻ�='{�u��T��Q|�+��|k�+}�>�4Z'i��|��W������ݕ��u��j0p]{,����	{Ix���}��™
�-3��އ$2[��H��y~��O��a��'25��
#�����
�k��Ji3��ف#�$ləϙ׉x#V�z��
Xoh�DW�<�]�_ t.K�}�*��
�d��+I��Ę�dK�דGe��-Y��q|�_<")��誁*�C��\�4T[��;5��I��^~l&e�;xğwC�2̽�a�Hb�#׍�BP����)e;ɰ2����W.�+�_��n���`N�����&�K=�󽜈���4{��Q��I��:��

T��7�;ۑ�R�]���H��e8M�o^���h����>{�)�I�HYo��W�	;Iw���Y�w7���4��A��}d�h�w8L�#�:�]X�_ڡ��p�ӻ�&�����&��\��=-��Q9��_�8#�OsI�![z�U`§(z�C느�-��o���C2���t5���a�Hs��6��x�dx����d�l�����i�+=�����Lok��1��jp'tw����<���|7J��׏
�r�k����B�`ж@Hh;�XȈ���
�Z���3��OpΧ��zKn����ʴ��>hq��_{��[{{͐�M�R���/ƍgՅg1e7�17!�R��ī�^�
-��80
0�
-
/P/r��-ss��V��6�n?}
�2�2H�^~E`��(�1�+��;���6>Q��ާG!��������h��T��
�5_�ۘ�-�E����>�/�X�+sK���-jO_�,�����B
�3���@��L�>S�9@��,�"��
��7���x��
�G��9�4.E�����Ģ&�V�do�.���0v�fN��w�''�(��x�&�쮫_v4�Vp$2Q���UN�y�
�J1]	�Y~��vϘ�;�I(
�F
-�1
-����O��
`±����"VB�
-���0�g�[��/z"�����8{�]_
�,�����8�ꥰ�̨i&�V �%�+�{�	�b����
�g���o�D(���M��������
-�OQJ�W� ˴�:LGvs�\�1�N���}U�G%���/��u�N|�[	f��?'d��Sp?��䫓u�/�kڍ��-d
C�����WM�������o��'��c��)��:AF-�
����r�z��6��Y�z����1\����Vo^�j��35B"�:�)Y��~ړ1�ϩ+=o�F̵��-������lV�n���{�9�t�l�<*I�V�J�q|KS1�-P�`k�
-��b
Z%��B⟬oEwא<�]}���WE��=NMk4�s{ļ�\�|?e��I^L"����d�u�`��v �d�>��ǧ��@V�*��O�
XV�^hb!�a�{��_���6
��ߺ
�"IC���ٜ�۔���)/�(NI������*����U�1�o��;`9�~C=��U��y���덲
z &�F��B�!Ջ+����(����rPq
�I
t�����2�H��i���7��i�5<�ĭ�2_< �P���g�h5��
���G���
����*G���Oc� O��G���6�9�;|p�����i��Z��x�4���Q
,�Q��JU.�jH�O�$Y{�;H�w��]���i^c����q��`rQ����D�� E�%�S߹%??���絵 X�8�T���>�Z�_>TAh+�v];;Q��6:�������z����L��*V��V߭�@'u��_
i�D7�s��ڍ?-w���
-�TX\�/^�h���Q�t
�l��rҲ+�p��-��t!��,ME^tU
�����?S���
с(�U���q��w|�r���>.7��N�[���?E�n�Q?�qh2o\�٘�KVe���!������0�^��3e۠�QN��v>��d���4k�U�"��m͞&�;.��&`�U&��8%[��)G
-�Eq��(��X`��Yw���'[�V
-i;S�?�(�i�f�t��k�TF4?ZB���IP��o�_��gE�SԵ�T�>�Y���S���}L�V�.�k9J2;�.�A<�f�M�1#y�amY���0�~yM�����&c����ʩ�8{�h
��7�G�!��E�\`��\�i�D�
�M醺���4ߪf�$�
�k�h�I`l(f��Ƹ��L
����aW xf��S��	�֏��q�(�μ��
�
	�%��
~��8N~��6�C��z貺d�C�T�4c&O��y�5��M ~����tUf
�et�r`��
�U��d5�)W6zC#Q�@����W<� �A���J�e_����n����C0��d��S��W������m����h'��g��M`�?�k_Y��䘼
�r���q�'�i���
(4�!�w����20�0�� �.����ս��ˁ<���Ĵ�
[�P��>��D�*�]F��,�����Oޖ>/1
��Ċ<c��C/���j��ʑ�UI
��w*��C~��\���l[$��k�?o�MS �L�� I�`�;;4=l
�OL6I�|�T�^h��zk��/�_{˪y�x�͈��>�x��_��]����@	��yY6�������Ac�x{�4���,�m
Fg;�߽^��4�Z��i!Mhv���$�H�~
���3�����wSD�Ҽ8&-/�fV����+0#��9n�~;$Q���%�d&���0�7ɨ
D�bf��$��tK��NJ��],�%aB��v_�a켓h���#S�xpc<�ZyE1��Ws$�"vq>Y��z�w8V��������'۵���Ut�'
�Ucg�T���{��X�G�3�4U��}	���g[�E���ц8�W�mp�?K7
=��,z!����*me�c���͇�>N��9�3���/>�WX�!k�f��0+��4�D(�[�`�;���4;��W�!��^;�^g/�?q��`�CY��Z�8P1-�+�eE�2���k>�'��p��[CI�Ӎ�7�/Z��"F#��۟2"��L�&e��
ߒ2�՛���.�b寙Or�{C���\�=���(h‘*jwy˜^U(R�
R!>U
^��Ɵ�EW���߮��]>�'|y�
-��S7!�T������O�F�^�A����ڤ��Ǐ�blA�=����
2����,�'X�>�"	�NϨ95䆺<*A�Ն����KT^^�ȿ���6�i�p�I�E03e��w�L���9^��P��n��Ӡ������R9�+Nź�s}'
-; �D=a��%Y�J�d�t��A��GѤm��(˫�z�԰
k:�]���5��"��n�1٫'�
�9�D��>S���RI���A;f�zf9�����E]2z�5야1�t���-j��ǚ�N�]�H}��2}���*1+�*8S�� {O7�0�S{F�u���~��sHd� ��C��
������cI��W� �3M�M}��
�έ�9|�ϖ�BB �j�@�g����r��:J��c���G��Ϥ���g��\���^����x��x��#3�k�Z����3MO�xC�Djȟ�'�4�5�偊�ս9�g�]/�H�5�s��+��)�1
��i)���s#�P��SӇ��j�~���i���#g�خٶ�
���g�SCi�:�z���{ʂ�r6����&��p/���]�ϼ��M��0v qi�++��	s��h�h�[�{��{Ú�6H�%�m~�	�{���
b�ȪJ�y1���{G���_QG�6Á<�L� ��H��I9m��z��f
z����l��o1&�3��?���
-��M
��
�����ؽ
�^=#��5f�]?����#|����~��I�Z9�ߕHV��>A6.��,|��g�|&E��rQ '���
��\Ϣ� 2����4��O��F�FAE��	c�Bx�hi�Q����@֢/瑱����ݹGy��O�j��MQ ;�E���1��ն�ss��AE�B
6���ٱ�0*R~=��C�����?��
-endstream
-endobj
-19987 0 obj <<
-/Type /FontDescriptor
-/FontName /UQOYSR+CMMIB7
-/Flags 4
-/FontBBox [-7 -250 1341 750]
-/Ascent 694
-/CapHeight 686
-/Descent -194
-/ItalicAngle -14
-/StemV 63
-/XHeight 444
-/CharSet (/p)
-/FontFile 19986 0 R
->> endobj
-19988 0 obj <<
-/Length1 2131
-/Length2 16352
-/Length3 0
-/Length 17640     
-/Filter /FlateDecode
->>
-stream
-xڌ�T&��
g�5�ɶm�5O�mM�lk�f�m��LvMx�8g������w�V=���ƯV��J��¦��@	{;zf&
���
-3���������\������\��lio��/Q'��ˇL����N�� �j`f0s�0s�01X����ch��3r�4�3 d���p���N��.i��@eB
`�����
 l
t�41���X m?2�� T�M,�.�������Ł����ݝ��֙���\���n�bP:�܀��?�l�1c�#�YX:�%W�7sq7r>6�&@;�W;S��#9 at UZ�� ���X�/:�߽030�7�������������������
`fi(J�1�x����L�04�q���7r3��12�0��r#���2�����M�,
\��-m����G��.�ۙ�����\����O��	h��vOƿ&kmg�n��70��35����������+PZ�o��?2s�
������� t =L,���� �S���������������
������
pqr�z�[���`ji�0�[����C
4�

������{� �?���I�c�L��l<�1�s���JZ��h�b�_��������	@���`�c�8?>��o��6�?���*Y�]ܿ"Jۙ�����Ѽ��p�{-��>j��fP���e ����ebg2������ �t����D�[��[����͟j�?��?j#[KϿ
>V����,��?�����j�:ey�������J�}�������h�,a�4U�t1��k��3���6�v@%{g�?
 ��������L�?
�Y��~�����3�7���X�9 FNNF�p��@� o�
5z��� F;{��=_����e0�m\����%`0*����ps��� ����c'#k�Ǔj������
-n ���G0{������o�/�� ��=���x
�
]?�� ��?���Y������Y��n�J�����_�>L��?Z�
����ѿk��k�����pe�h��ǔ�+`��e�jk��y���'���!�GL�y1�A���G�������������Q����E���_W�%�����0������
g����Α���_�� �/�?a>��O֏�����	��I|qq����G�����v�����_c���'ۇ���`�s@&�N]q�������?��
@��E{���!폵Ÿ��&���4Ө�W�:\�����k����GzQ��ĩ�V�^���C��&*���y1�W�9h�[���*�%�c� �^M�����G#���K�<�ѕ
I� �ѽ_���@��x���a
�,�K�,}�z�n`�<y�q�	�
=

ڥ����
Z��;�L<-��i
k���m��O
^�j,�ݸd��q����g(�E�Sd���K���=Z���r�R��Q�Y2k,U������W:���!�����ʚ0
�H1k�
��]�X��ǝf"��=fV���ܳ?�����{��;n���?���>�4����j�⛻3ӈ[�D���d�B��L�uk�1P�Vݒ�^ �B����D��w���>sA���㟳��\}��j�T�ܞG]�qG�
~�Px7�J��,µ`7�
-�������K���
�0\�x�]�� V�I$��˾|5DV�&-�w�T=��i��]�p�Q���^�L�E?q�8,
��}oz�{_Q!��yb��tY�
!2�uG�3$�K�J at n��b��pط���>Xc�357bۦXdM5�罉�o/�t��b��+��'|�>+z�b�}��BX_�X�w(>R� d�l|%�:\'5�iҸz�����X@�
ҷ4;�G<6�G�mS�[���
�e�N��� ^�
ȸ�⧊�|3�l�Tw�_ů˜n��C��Bw�2aL�J��(�6�i1�s�v�����b����u�ob��V��vk��m�	F����>|�HΝ���W������oYC���C�4'��]����z�W�OM
m�cr��Ƿ@�1�=6�J]�U<�8����u�mZI��r�����$��K9E�7'T
G

i��t�t���E��O�7Q�e�HK��$�I��W�d>5���|�G����3�~�|ل�Le>0��|m'��MO�Y�#��y![U'0

����#���7�)���
�� u�;o�<��ؘn�]�
�@V�y9�[�}�d]�OXg���@Zf`�K�T}�����!\|�3!$��r��mm=dSds#��4x�n-���Q�9xh�ǴEPq-/�$���T9
��ͱ������ s�u
� a�� O�V�ՖeX���9B�C�-9*�m!�YD2����s�
-)R�2��E�iN#��CZ������se3}"��N7ίy��H��

���
�y�q�W���8n:����|%K?�צkBz^�<MF�7ā^Ċ�w���-��B�$,j����
�K�\�*
-����S�����~�w$
���*�6gM�*�/N	k�x
s9˙�V�}���Ϭ�=,�/Tw�|F̔У�o��Dv�4�0@�_�53�龳�âg_޷�6x��Cv=��=����i`F�YN1�)��x�^�H ����ٱ�^�S������ɑ�z,����?L��O5��.�b��\�软�@Jc�s3Y�ń�l��M1L"�Ӷ_�Is!�
-���vݘ�i%
���0�t~�V"��]_�M��8K>��0���
�!_9�9;z�h�p��C�
o��X7<i���T	LHH��ʲ}jO�6վ��%��𛿬��<���\�&��~|����;G at E^�~ǃ�K��"�|�l�+��FVOB��=dy��iɁϯ:ඕ�^S��P�h6�O$�2�@�e
�XM|�#
�8�u��5K\����͒
4�f��6��!���l��9�� �G�o8:�Z��C7��y5�jJ�wn�yOp�Q���U�`'����DW����hCZo<����b���6+�Ԗ��ی���Am����
-fB������Xy�!c��0^��q��*eV�c

������9$D�jEŜmK�v.��E��Ӿ�P�\~]�m!��gY�G�|��i��_m�l̫{�W�g�b6����R�tw^��ؔ��k�� ܻ���%�ŀg}�gӯ�vH^�=0�U�GE<��r9^�z_Q/˝�#�
ʃ��:��%9�ɤ�,�(���?���px�����J(6\���
�R�(R�*,�3���9kS at q��}�TO�2	��:}L�]�(
x���`���\�u�5��������*^�e��d����h��pav�*�Fp�b�a+T]f1vO�5���+ �p,��ƿo�����W��r:��{�i�J��o��WO�'b������H6<�\�P
-#�4�Ϝ3�s�2ܸҞﭐ<��^��{��ϐ�ٷ�l�y�3�9�.�i2KxL���n��l�c<4<�VQg�I�H��pRK
ܮ{�	����J�D���a�5k�V�2?����
-�>�r�L[+��G�ւ���v��O�	�x���_�V���ʻ�Sl�V���
4�
-�e��=�o�[~�� zz9�s�7n��XDQq�P���펑~rL��I�b{�����`���V��%�%���1��᠔�{U���N��O<
-Iŧ��swCIMDBPf�Y���,l�he6^�d�,����7BO���
H�墏Nh��H��m0~3�,�V���I�UN��$AS�n��us�� �75(�7
.
-S%W���*�[C���x��T��2�}7�~���m�[�G(�zX�Wz���� U/8�y����
�^@�����  �YYhYzeۅ�p�=%�[�������%�b�.��D�r~ͨ�Q��R��~+����.\F.

�*E��Q��t\U����D��ڥ�u��f��O?�3C��B=�5�"�|Ж�4��
�������[�42t'[��s�d����k��[�4�m�e��w����B���0Ģ�DQ��&0
���O/���෍
B͝��L��gt�k&�3)��
� К�m�|Z�2빎�F�Si�&��<K݂�v
��xU���ݲ�ͷ�@���i�[
-��5*$��](��KY
�1w_!���y�<����T��
-�K�z��Y<�L�%J�v#fz:n��H
-B��z>/�2҉2{T�`
�
-����	��Rϻ&I�����N�*r˾r�r��#�K2W��Ȝ2�~f®��]� ��)�&�z���~
�hNu[恩L��"�S��5�(�<�
�C�BƭǁA�l�YMmـ�6rb�{�Y%ׯ"�O�"bd����Aޒv6�wv������5��Hh�mU�
��K3Z�n���n&�����.�_T�j!���*9B
w�.�j��^`X�ƿZ�ìpJA1�=�[�A�T|�sV���C�K�J�4���7]3�Hh�����1$��>+�	߼� �7����7�	$
�t);ć�U��Qw�5f?5_3��B��R"����@��Y	����,N�$9�;ي�����l(�Z���2�7�/����k����(s�V?�}/�1~��q�8Pp?jڋYT���P��Ϗ8��2�Z!�"�:�lCu5�@C�
-
Q>`�uP`���|F�P��-oEJ�Tmn��as�Q���?�-��P���h'��y"�����>(��ŕ%?6)�i>%���/�2.��)@��@z3׊j�4��
&gQ�M����i��WҖ,[��%䆈�׃(�����
-bH�ؚ�ƒ{̊���
n��
-/@�s�t�
�XO�;d�X�^��ɟ�N�^���H�!�;Zͨ��Q���Kxe6
5	�I���JQ��C�'�C ��@���%��u�4��Yn����==��x��h1rL�
=.!S�������0���n�d��6�G"Y��ZuDi&�<=O������r��Ԭ���0�Dn51D,�y�(�32���1��8�����L�[>��@�uR8��r�5JQ
�@�t�U�W����ڞ+��*�l�
��� z�ta�Ȱ{M�zy��X('���5åi;mo�5CV07�j�VJi��W��:�����9���S�(�
�I�c}��e�_����M�{��U\���dN�)7ɮpf�&�}��=�~įz
�ϟ
�O���@;]�-y���:C�ר�
���'�o��PX������<;W�^�9��R�u�c��ܖ�A����q��Db<��v�Y�q��~m
��b�$<b�ϱ�<X�-I	���M�Z7�0�ʼ{u�
�e@��P��k_��|!��L�*@о[�Q5`{Ҡ�X#��n �	�ذ���7�
c�<��v���%�6ۗ:�*���b�P��f���dϥ�zB�O����-�����PE�C�� ���
/�KŸ́���Q-]+z7���;f.NgѴ�PN���ybcVM	�U��7 ��.������0�w[�ʋFZ-v��u�K\�aT�p�epCP��dˌ�����G�uv�<�>9zBHS���[��˕�Kw�4��Xv��{��O�ƹ�i��v�V~晼8�*�b�n��_v5t}��<%�\\�8���_��tΘ�9����2��0b�N�d$��l�xNa�;^��'�|�C�k9�l4_��ڣ�߅���
ȇ�����v��_Ә�h���jl?�y�D%��E	4q�9���P
 [...]
��|�I�\|U
�)U06
�]k��
ɱ'��Y)Q�m���1�i>a��5ε^"o&��]��s���r왦
l����MP�E�7��T*c� s�:C�g�Qh�=+M����8!a�S�z��&]�..���J����[,L�����U~`�����[�okni���²������ߴ�+ߴ�OKRP�~�wO���Ȭ�r"u�j���C^X�!P̮� �V
Ft�������ߥ(��q�}W�S�F�B��S-���6Yr~$�	2Ey����/�m�!)�HG{��Y)�V����\�X�1rj=�\����+D��E������{,�,$`Eͧia�/�
!�T0���>��Y�Imm�B��)u�
�
T
>�7�yK+LHR�兌$�k���#��W�kB�xx�=�{}ПO'���M�������B�r��xW
x�N��Vf
6�� m�J�zC�:�Sne�z�F��"�(0���~�Eऱ؋�W��.@�{��Ӡ`���n߉�s�?-��B�@QJ�nY�[���#}- [...]
�Z_r��0�����>�B�8�(�m��6|�
-$���w����}V�q����M{��0[�� ӣ'&\=�'�R+�a(<DRY}�C^�(=�h�^�gD��7؈��7ni&_��]�eL�
V�U����}�,3���;���Qj�.���gw��Ks��1L�y�mS+�▚u�
h�!��vg{D��8YpI��=�*��p������k/g�� ��~��zU��b� �����^a֋��KUx�~~��E��Mˉ/2Y��?���LNWq^��}��\:��g3����"1��g��p�e�z�d�|@a��C��56����^2�C�u�7��{�x�!�V�Mh�ɷ�`���ETٹ�
�{~�Ɣ��-�g�0?V;i���7.�
��Z��NC�v��|<�ƌ�N�
��P v����*�+��vJ�6��d��
Go ���
��F
�̒eã����]��,V=P���.��
���_��1=;.~��<-��ك]Cx���9B�]bM\>~I/cX��n.��
9�r���!�������i���ꐷ�7�� [...]
-*:%���E���
�
��;UxB�GK����x��G����M��.�㋡m�����͚=�:��� �_֓R"��sLpD~�O��_�	��!Rg%�1�o�M��,Ė=AE��X��v����Ƒ,t�D)arA,s}��n�'����x���μ-������w���h���f!����M��m-�!�ɡ�I�	N�O��G�5_˖mI�e�bHY�����ؚr���ӎ�j

R�q 4K��;�UFviT
-A��"nǿ���tM��K�!�
�&_F!��5>7�f���V��{
�R�yUV��=!^tp/�b@�szX��������d/�ag�%�>���S �~
�������% NE3����[��R�s@�_G=ys�)�7Ii�:C��D�+���8N����[�J��j';�I� ;�
$1�_�&(D�V�?�7��{+��w��+P���� 
FUAO���i�ð�T���vו��A�����b��K#s�Sa�#�uV#R��)e�\��ZЖn� R6"䖜�,�Ƴ�75�ȍ@���Ո�݁w�	Es|FG�sG[�}�dbMϝ�M� �}�х��
�a]�Y��/G*صX�a�0D����y�Lw鴏������FdZS"��Qy���
X�P���xi��2���'S~]��V\
D���fR�)
U��*�T��=Jb����]��ZcW鱻`��{����G�D�
1� ��ק�Þ�e���5�~|{�7
-�1'n����	%���,"p�P��*�n�����ϑ�� �a�p��u �.WT�
�@5�
-
Mp55k�tQ� �Hl[ڦ���
�h�=
��s���}m.��ľ��9�}͏�7L(�4
Cy��q[
��	�|ڬƧ�
c��
Ed��i�p
�
��V�
9��ȥ�^9��.ES��,ĵu��#���㨴^�Ҹ��"B�:���ћ�U����4���;��92
�,�L0�3��xLA��r�$�#�#VV JD�v(�
-*TTJΠB�@��K�ȹd.����@�ܺ��8q���΃���
G�6�S��̢v;�E:�A�$X�
-qrF��)Li�4'�Nv��
-=�(�
.���Қ����<,!�@q����|�Q��������3��
�.w���E�ȕ��qx,��Qу����7|��+M�	�1� U���� e	�up?Ⓕ�.>��m_0|l*���+]�m
V
��S����|�k�_	۸4��U(;?ٸ��@�{tHr�̝�$��,
��,��l����Q�I5��/F���`�i��gvQ��m��`��)����j$��%��)k�-�5��Lt�oD}
v�a������,Z�Ͳ����t_=#����� ����[��Kh����yﱚ�XfC+,�ГK���	����6�mQ��Y�K2]pic(�
��g��>ˋ�%���-i����^B��pɶ"���j�q� _��N����C}�������j782���J[��baY�rޑ0�Aテ���Ҳ,\U ������1��9X�!���#���;
-��H��s3&��Q��1�2.^����V1ʐQA�,a
��v���g�:�tg���\zـ���ܥb���^���Vm�[���u
-�~�M���e_����\
P���pn���XL��;
��;
<�4���sj��2l��������.+�� �
-�%���ͺ @
2dg�7M
��|��4�j[��k �?�
�`o̿z�7PX��{��>g�Jl�V���u�#�VKՍ ��aLV2o��j=|�y0R
�O��}�5R{,������ّ�D��d#��%�fK
-��+Y��g
�i���dﱳ�)�
���6��B���Gm��e��3NA�Oߧ:� KoqE�/��:�n+�屆���^�C�y��q��L~:��|ey�:����
aD{p�mr7��NԆ�; ���v�Ԩ�r�n�IA���U�\��Qd��f�.�� ��{R��K�Ľ(�l��?/� 7�.=�cM�VS VN��D���H-�[�ܧ��j�0�)�����$V/ [��
��Ny��WUTq�
j\1R��|����W��Ŋʱ��g�6�O:1���W��(��-�\�>z�
B9���N(Z�^��|�!�����E�vo�
=��w�,�揝}�´e�_S�F��%;*���cđ�>	���lAN�����N�m����Y6;��3D�•Dr}`��z-&��*��k�����~��z Mb�q����o�kf�\��A
�^^,L�
I
7�=��K��O��|w2� m�r�4U�
1�,�b��j���K��T�O�
��H�Nq��]d�;�PU�\8��ƴ樔��!b� �8G��t
V��!{?O©���覦[�]Nǵ9kԘ���Tb���5������4�o~�h���X��S�_��I{(�f<���gI6�C�p�?�\c�h8����N�o�
��o�f@����a~����y�##��}�.����P��_,#�)���I��e�
��
�3��Uw�l�3
U��
��|�g �R����۩��B_ū֥�0��}��t�J� A�҄j�%~����,#T��
��!�KOŗ���~Ϻ�R�����5�o��Z7��b�i2YY�u����������4���9�#�R�SڀE
�P�'*��?�u$|�x^2�4=7a/������:�KE�ͼ
Q�zg���g��c�yl��
��_�z'��<�-�
w-�ܹ��U�O�n� *�?BwCM��O����rT�?�P�5\ �F �W��0�L����\�,�4W�lo��R0G����Za�GC�q�q�:\0�z�����P��:	3�a]2�Э�9
v�{�ʽG.� *e��0��7�ǐk��H�_PJs�qWu��wr�&��?�O��4٫���)�#�Kk�០Xe¡�LV6^_�s�����*����l�|d� �p�����}w�N�%q�,oB����mn�E������W�Sܐ��B<�G ���
��2N߰ӹ�
�A�r����$�yA�k1
-�޴X{î�Rqfl
��4!uk�3ٻ�;X}�ΡOЈȚqr��G�\w��8��;
%
�;���;ػ 延N�N3��f��� �wC/!ߣ�νC=�ģh!���hg�G
-t��9�5�k�U��9&�a�L�@7C�"y� �۸=e�fW'�E���}���u�>{�W�N�(��8�f��,�Ш�H
��G��
-5��֕N�8-��
X�}H
��׍)ҟ�/.R��Z�(nxZ����ʮ��������h*�"v����G�T�We�e�t�S�*bsm<U��`RN�V�'��� �
YGL�w˶�ߙ�qD}�G:ł�d�����o��12E�Ҕ
,��֓)��4�K��3Ģ*�[����m}�9P�&��C��g
�_�I«�v���Y�����#��'��A,�x�.!w7P�����$����	�
���Ej
�mEt��[��r�f7����	fԀ��a�
-�ȸ�zp9�R'`�uSp���>��aÁQ�g���G�9�g��KM���C��
�.y�m?Ш?H6B�U-*^�
z⨹W���5��Z0�Q�rA_Jƽ���(�b�¯\kK�8�n��hH�h�W5�6FϜ�z`׉퉘.�0��?%1H��K��� \
P���
;R�2��]ң��X�SS�^��§��`2ڔZ�-��H5�,�����G�
�D:8O_~
�H7+��.Nk7S�զ��me�ܴyv�m���/�;����(��P��9�Mw�*��x��+ at i,��@I>�f�x�-oƯ�n�~&#�ѓ
8-��
qz�
Μ��1,�չx�c����צ�-7��CL�x�i�����P-�TȮ����&Z/;�;�Xs����Z;���3�c��po�ONc�l���ś�(Ժ;3�8`
�R9�q�iϲ�������r���mQWS`t���5�"���
-Z
4ͯxJ��
-X�{�jA���LM���
�[$��k�S;`��.c���^�؟1r�4��h�
��cRиڰ4t��-�-��#�
�7�*����
-#��]�6������˨���T�'Зu}
B��ğ�to�x�v�D^���J�Ԛ�k�}�����T�cV
-�jc�)�
l�x�M��L��Y�����LȞ��y�"�(m�ǟ�FJdQ���ͤ�ٸ�G ���
�$�AMy��&_N;��iXH��q�7��>����z�3K��
�^�IZ�C
!4U�c	ݏb�����DC��Ǹǧu�c���6�h6��6&��n���$q�8��o���w[��j*�ʆDr�T���<�C
-�wZ>h���t��݉��@���ނ�H��v�N�Y�v#�ی��a9RCH�m���\C~�]5:w���?T�#�|L�FIⵆG�r���t����Ao"�f�UJ��Ps�Mp���q�_
������x� �]
ѱ��n�Hß�*
��~zDe�j��s�4����?f_�5�
ZfW}�8��
�����m̊�*�3���m�`{�8�ػ��ye5�dT�L��fj;+����eL�RԣL (v�:t�K��~�W�_�羬|��
/�D�˘ڜ�4�,�
-��3B|_�YWW���~$�w�^�[��A-�È�Y���":-)��.m���{R:Fcn��<��*fo���1�U�Dk�oӃ0���X����8��MiH
/��5H�߀R�xSA;��lۨː��t�+ɾ<��g`�t�
-Xd�xH1�R�臀LN��%�C�ߙ�a���M
b>�=ʻ
�A�y����>�h�)0
�
�O�0����L�
-_�):�%&�_}Q�ag�nK��ec�쐠��sV�.��|��u/{�=TT��^=��[�tt
}
V�˺LH���	+��#!����g)H����
-t��GV$
K�5�ri. _�mѯ��D
9�X��o��o�H=x�6�7��]�~���x����'
-:���~�J
{| ���	ɩ�A���(��)+w�*߽)<�� ��Q��Ǐ��8��N(3����Y�o���DCN^�g���
9yRe(|��ua!�S�2�k�j=8V*|M��@h�ʂ8L;%A�"
c�Y�q���([�=��P���%�s펀���k��
�m�%�j?�>U���Q�1���yVdfu���wfw�ii*%������
l��'���:q�h�#��$�)5��X2��?Sx�!���<�l�����i�
�v�!A���X���t
-�`��u�5
-�1Ǚ�W��x�;��}�(����5e���_�^)������̰N'[��G'��]N�$[���$�����<����}-�
�G�JL]�+
\� a��g��\
8H ]"�ึ?�Ui�lb�Hn�(.-�{c1����z"@
-��P	�S�@�L˙�2��-U�wq����P6�
Խ$}{��.ak˸�bǯlm�-��b�<�
-�����2~䚵�LByd+���|����y�
^j
%���t��r�娄6��M/[~��׵��
aMˁtN��
p�^�����B��4�L\Z��2����hq��uS���l�WC��>M>%�$2�6P��̏%�,d��
�6ۃˮ�d2�L�X#�=6vN�C��VT�ކmb��8�y�P�����Rx֠���a�ɞ8�LB�4bN�l���	d��y�DyYo�c�;.�#�79�k��e��G_�5מ� ��C�ƪ��dJX�����";Md�T*v��4!��%6�/�:�
��o��ҖI֧ARM�_7�%���
	_�F�V����]o���a���6��F0���8�V��'E�����W kx���g�P�����.�1�� b���UKh��ϕH�w���=?(�F
��
�U���|�͉�.�����U+u�D�J"٘q�%%I*�4�w�����c��
	�>���u�Wpc �F}�5&�R_�@R���
p��$ �C��R�=�^OR6�dyu��{��TN�H��|��.����y�!�n�h/��|�
�Z4�
.����@}�a���-� .�-��_ A�2`{��(����c��*�m��̐�z)$�o�7
�'�QxM�v;я��O��~�%)�؄�c�P
6�
2X
��m'F��3�%���֕�΄��<��Խ��T���=�!���i�a�Y��9ւz��de2!������F�.��Qc$�/ZĤs��cb�0�x"�f! `�ֆƥ�	����
� ^H�y�R�l��&��n�q
��w�Ԙ����E��	���`I|7N(u��2��&gk�k�9E���IM0d�.R��l���I�y��v/��f�x"c�FXX��.j���g!�Uj��n���պ���w��˃V�ǁ�2�A����<F��,i�V�
b�o��G]B'�/�ggl�B�������B�
-�p�[����.M�0�

^ӕ�ڭK��ɔA6��&y?$_n�U��ǝg�?��
W�\�F}�|9
�6udH+
���t���z��ڇ�}M�����L�G���3�WgcH�F褨s�������9��|�
&�����\���۶�9gu4��;�j覡vd�����;3U�یgI�5ڷ�M(L�
�y2f�3�

-Vc6�V���&v�����&11��I���R�uM��tx��$/�5�
��c�1�,���L��үn�}��K� ��}���v��n��L���3}=nA
�W�h#b'3x>�l����[����A�ԇf�:qjg
-�J�w�2�����D!�f��s2,Bo����T���(䙴�iM���%�f��A�bA�{�_���b?>-���E.CE����?��L��@�GIJ�(JI�YY�����,���	C��gA�~�L�o
���?��ϛ�yX
���>���ِm��
s�alOv��8P�V)�\7��҇��S���0�$Ru+-�M��H����ž�1"jb�D%є��3	iaI���vl�b����
-nrk�DɅ�$��e{�KN�H�k
�~�JTp4��\5�B%`G_�����3�/��~w
d��TD*�ۯ��|�e&a
b~w|�� �jf�06Ok�|-��m�W���7���ܘ�ξ1��p���:`y�[��Ƶ�
%ӱ�eU7�JgX�A�
�
G�,_�LS����^�˿�8ҥ9�[�,�`�U�e+"IS6̣�x�6�h��Um!�dA���C�\
�w�=M�j	~+t>��}��޹�!����Z]ڥY�h�O�S
!����*c�
�Q��M3�/=�儜0�
	ۈ���K?�lX��!}�>��V�����{;l��j�'>�V�"i��
-�#�rz��t� /������FZ/bz`?
��"�(
��M\pi>�}��D��
�8
���f�
�

ރx3)�Of���x��!�m�ǯ�T]�>
��%����#���JW�� 6�_]u_��
��{7�*�7��C
���f�N�
��ʴ�1cy��69q��T�0�v	
���V�\�`��nf��/�Z�W�b`��?Qk]������_{0? ��[Od\�
�U��쮍:���+X�\���m��}l��o�;� b@�E�P��@�zI;�|�9�Y��۸n4&(�beU1C��SK�yê�Z|
o9�	)�]�6,�Z�µ��Nq\`��Ru1:���=�G���HChU�BI[����gs�m�����p�a/�JG�x���A����O���#%�UwVoG�l�����SxR���N�1�
-sC��M
-�v�	 � d|���Ze0
�E
*�=�
-%���"~�>��w�� �]��K3��÷_Q at B&b$<���I�;��@��P� K���h�5�w�=l��'gnf��3��ʊ�/`��`?;W���͒n��}[��-�b���8�I��]�_���`r
�5��f�
�.�
�|s�#Q�T�owv��=��>���7z�D ��|�IYy���H�Sy�R�S�t�y���a	?�A
wb� c���;�'T�`B�l��[	Mΐ������,�L3_�!t�{���Y��M��8*G�!�=V*'��o�p����"��F�s
��O*.^�S�v��Tu�s�x�"�D�?M&��Ҽ�S#z�/Y:����,o���
ô
��d��Bg�ܔ�����1�V�D�r�]�n�,-�d�ϹOD�-�	͵*�Pw����\���t���e�UjY<�ISIDf���(WnG��,� �� ���ϯ��U��yT�Uh䰋|��e���l�
2ˊB��6��Ի$�����W�E�aK��s�`���F��J�ij6���$)����˭G+m�
-r]4���:�
R�����M�&��n�:��3^"Z���
�o�-�]�#��z�o^�}��V6��FJ��H_6��q�V:{,R����c�
-�;J�T
!�^c��5�%,}�[$�2�v�
�+7���9�g7s���3A��e��
�
�'s�ơ'��F�*�.�n"
����hb� J�Gf�J? X�C�[A�*1P�v/�)tp.�+����$�Rj�f|��>}4/�zp[�#
dJݑ-
1��
L���0�4B9��U�3������Ȑ�I������G�b�0�lΤ�s|
��|�5��H
-��
��t�����i�B�q>�>7��yB��'ϲ���Ռ�������m�F
��k���a�U�=��G��SΥu�t�j.!7N�g�t�|nR��*���2pV}�2b����D����H�b
.�K�`X̍5� ׵����
�������De�
-�ˁA�	:diĄv(��A+��;���{z���%�/��@��Y2E9Mr"]K!��vłEGф�N/� Z��F���8�x�9:�mb�����n�i3s�}�A;e�_�t��
A��w�??!8
w�,��eʋ�
�b)�2�[�a�c�"pZb�E^��\��i����Qxi�P�@��l���z	sQ$��e\�A���.g��޸υ{.˞���9��J�Y��6�����alb����p߃EnT���R��P�9�������$f���$� ���x��8�)�Q�.��)l^̒��ĠKCF`XAL#Q֜`��W��*w�8dn��$\q�{�q�+	�m>�3	����
�ꈅK��]�4S!�e���
�w+ː��7l��ą���,�Ţ��Ec�zű� �C%��~��I��󬳛rً����_�iz�Y

M֔���eD;�tw�
@*��X�6(�h,{ɞ�
A�J����� �Ɇ5��I؍
3��Ș
a�f��X��9~��������B�v��7�H�i�}ŜhKa��+l$0
��a����!��E�t�M�����>WH���s�.��U� �u6v(γc���@"�+�愩��8�W��#�p�o�k�ƞ�Nj����iO6˓�8�
-��xf�S�d�~c[
�U�R`rk;���Sڽ��,p!��Q�z�=��Ny��ZT�f��2�xC@����z)���
�+ع�#��X�T�J�Ѐw�z���q��N{��Q��T?�
{;���BOsT
�c��x�U���v��|nv`D|99�MU�d+�#sK٧O��	���&�a(�J�૔��gU �K����F��\��[^�w�u[��9O >'Ϩ����k��M_*��J�ل(���yN��k
-�j?}�×��’{��F�
����>�K�nD$�˟R�ȷ�]
m��ר�����/m��#B��)����-@
.5?e��<e�B��S�&����P2����q�2������M��X#2���@��'�Mir��&�(,T�<���i�d�Z�f��
-	VL�Ǵ�!�(��B�߃+�s~
b�˨�؉�TC��,
G)Y�O c��=�{�r�^���r��5K�D�U���Y��u��
�8��coG�$Z?���
 �Z2-���0��4�������fr��i��5�L�����-���
%@�s���?�vE��Hv		�ٟ��ST��=�67FG��i��:}�X�x�b5w��{F�n�F��
���<
џ�}欎��x���畉q��Ƿm�6vP���6��o��|F@��N4 ��.�V����o|\y|�>�i�=����Y��eV��;�(��)5�ѵ��	<�ʓ������A?�%>�
gk��*9G����G^Q�
d�HG�̅}��
�ۓ�g���?�Gހ��g��:�u�1�����A�i��j�fAֹ��
�ǫ��89�U��l	�c"�:����(`on��
}����Ƶ�w�2d�`^7�[�����Y��ܹ`��
/�`Ӧ8��:�zP�Zsr뇙��'�ANO>�!�CKb�D1������I(�8Z��H� ��M����t���䬫�D�вT¢a�\ R��捊���/e�ƙ5\/��EC�a��(
u��i��H��4��
O�zsY� [...]
-endstream
-endobj
-19989 0 obj <<
-/Type /FontDescriptor
-/FontName /CPXVZD+CMR10
-/Flags 4
-/FontBBox [-40 -250 1009 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 69
-/XHeight 431
-/CharSet (/Delta/Omega/a/b/bracketleft/bracketright/c/colon/d/e/eight/equal/f/ffi/fi/five/four/g/h/i/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/plus/r/s/semicolon/seven/six/t/three/two/u/v/w/x/zero)
-/FontFile 19988 0 R
->> endobj
-19990 0 obj <<
-/Length1 1427
-/Length2 6368
-/Length3 0
-/Length 7335      
-/Filter /FlateDecode
->>
-stream
-xڍWT\���;���[BBJ�����ah�T�K钔n�S�����A�~������[�s�>qϾg��6&m=^y[�5H
-��
-�%�4uE @�(��Ʀ�;��@��
A0w0"���` +8S��#�4����3@@  *) &	�@��
�0I���'���P�B@�xl���>0��
y�_K �
@@BB��w8@��XA �Vp�
�D+g�
�
���+��
�*������g�����?��x�� ]�;�	���
xb��M��
�� v�փ����`  pۀ �� �-@�
�S� h�� 8k�����j |��3�W"0�w���
���
-������ ���������r�rv�"�<���V�H�߅[��u VH~�s���]��|�`�_
��A^����������O
� o݇�w[� P/��k;0���[W~����������"@ PL\
 r��m
�%��q�6
-������B]vH
-� �
����n�	�a
� ��n��O@ `
���A�`�?ّ0��=��0�7���  �����
�-[(��������x���������&�7��W �"�
-�!���7����F�����'�*�
-����������&8�
.��OxE���G��@�
���[��C�7������?�Q�pv�m��e�V+��ϟv��=�ȉЄ"��OA
�&����VU�r2�!��_"�]�
���m
��_=@�wC@�Pw�g�l�?l�Y�qB>%��N�6�����#� 6P�_3'("
-����|�G�D ~��y��5���#C Hz ;(
�W?Ł ~�_���t���:{����}A0�o�_��x�`���-d��� �7�oaj#�X�vU-O�Ż=.�m��+.^�X��;��*+d
v!�:�C����y.�x��o��=vxK�N���D���V���T���u}
��x���ߺ�;�7�v���y�i�_y��x���-������R%����l�7� �4�x��u�

3����wo���Odo&~�WK��
8�*�3^����]��t�e�5�a@?'�d�S�IS���+)\��n�.����'}���oG�uX7����st�C�sn* �����srMi#��Y����"�
^#�b��SX�2՝e�K:�)�/� Gg�K��K��
������M��8�Lhf�fϿ�إ�;�7� Bw�=M"h���w�~~�z����i˳�"N�L^����
Q�[Z������f���{b
���J�m#��,z]Bg�Y5�W��������AX
b����)�O���8� **D�
��-s�f��6;�3��J'&Nł���l�^�a�>u�T���P�[Q��TN
R��q��{I���Qヘ�yC9�����,)y?�v�,�Tb�y*��칀���WF�[DR��
`Q2��
/����|�W�����?��~�<ָ����BzZdF7M�����c��.���9��k�R����ŭI��8o�Ҋ��0�[���=
0"�

HgQ"�'WQ�+1��|�? r���fYK��(S�,�Cwq�,aD�(����$�v~����eX9���:~%�!ӓ=+�4u�f�TZ.��Ƀ�ۖs#��{�8�'��˧�yt�
-G;��荒lP�����
"#'��
��;3ɑG�)~�$��%�3
�[�Z�3����=*�T��yro3z��e.Qv��p�uO���f��_GIA��&��(��5�FZ�j�-����BR�-����uv�9��_��h��4��9ܞ?��ԏg�;$���e�8W�4xjh-9^6?��/#�yc_���=��>�t�.Th2�Xc�{
{��}�]�P���kޢ���ζ
�X�����v����G_�z��V�VUV����ug�6�I|5�=r�
m��Rx4|H>>2�
�ӲI��ÑqIa�Dh�Rk���X�k��F���Dp��nj�B��?���
c"�c��$��Ӕ4%�h��E"J/�9y�������X��Q�xTD�~g���0����Ƽ����:���Eesy$�t��d�/�
X�EC��9Wt�0x�.vw��>+ӥ
� [_rh?`��L���\1��V���
���B�i����8A�Ib[��	©�+�Cn����N�*V��sT��3��m��%.\�˙X���vՎ�Z���^��T����X�,���A���xlaVi\�
Y����nj��ץ6��8"�u'�����*��i$'LC�
�nQ�GO�ܰ;%q�!�������N��
�c
F�
-���ȟJi|��ݖ�_�d'Զc��!���
�z<
�$
{���$X��&����3�a;�a��6eyi�$��j�
fD,ꘚE�i�8��;q5��T����D]���8��v�97��bbF����x���)��ۗ�f-�)���bsi���޶�
4���V�Icit	�l���9I3V��4k~68�c����і�)�ʾksc��
-U`,:�%��D��8V���ӣPz��
-�G��O�1_ڪ4�6ǂ;⁧�����;�M	�ΙRT��p�
-����*PS�c�~� ��єCs�ڊH'욟~�ʛ��AW¶C�/�򐴡
-������R\q�M��^�n2�r�m�k��|IY��Z����4�=L&4�T,��ɓ����+�:Y�s�/�2%�e���1����~*�Ǫ-e
-��}�D=uM����ǂ�O��+��B��}�YBi�{�,CRh�T���\�1�E��,��̊ek3�Ꞃ�?��|�LDb�e@���"6߳+��k�I2�1T�6bɏ�	��z75�j��
��Z����ј
/���'�o�nF����r`�LI'r���N���:��Qw�{~m1�|v��OʹZ!Sש}�=�a'-rB5��d�j�����f��|��ŝ���ʆ�D&�樦�.�ר �
���mr2\
�����4���ļ�Z��a�5��<DR����(�,^K�����eD{k���
:c.�]}���R�����
�w���T������)(t�r|8��̢��w%9>�5a�*�f�`K�*C�
�`_F����*�q�Vi���
��8���!S{p�˥q:��XYԔ&eI�A!�K93��zO2L���3
�y6����֬�8���l�q��D�A���"�r4�5unw ��pc��̳�'���i��`HPn
���v���.��̤�U~?q}3�&�i0�v{:Tb<w��R����M3 ��\T�M
�k��FY�'�>�|<�ɰ�X��#&�~ɕ�.D+BP|�f��
��q_��[�F�
-�ĕ#j����缧rķ;�&�t�<�t�11e���
ʣ�4�G�I��g916�S��Cߝ�����~�T�?��^�u��}%}��/aĺt�9��z&�U9~(������-&�%� ��j#�e� �G���I���緟�KS+�eJ�^����Q/PY

w�*Y�
Ĩ��~���'庒zM�ͭ^���
�u������;���'���3�͹En�34Ԩi�6Sj̇�6��ԟ5Ҷ*H���1q����zw�K>
	�����E,V

W乔�&K"
�
S�;R�[������U��5ip���`��f���:�$�
�Z~%�>�)�}��A�P�!1�ul��
3���x.Z��+�1�=O�v���6����NxY�6	��(��6i6�9�O�,1��`('bc�'y̐�y�j�
-Pt§
-aX����O �F��#����uy���!�j��oKH5I��!#�Ӛ
-�%%B�K��s3�{W���}��iz���^��� S�c�黱]��s9��ģWޚo�*��TRTMu��/َɪã"�
��z
і
-ڻ��%� Ю ۙ׭(b��t���6x��t
��m�v�0Nݭ���n�0�č/�aqRe4��9���H)#���囆��s��
E��c���w
{���]�)��B�d.୯
aS뒀������lH��m�:�i�� �܃
?}j�y��-�#�|K���.MB����{t��D5�]�[��x�Nn� )
�0{Iqz737��-k\.��ɘ[�l�mL��@����Ӹ&E�X��D�Qxu�-��A
%0i��)_�j�N$,
Y��/�bz���n2��)�n��ܺZ���
��E���9r�Zޠ�U,�1����|*g��N&kqHpJ9����%��h���kx��8t_����>�}<C�^ ��G��^Z�o��4L$dcyz�����g+���n9ѥ���p"�N�E��P}J~t
��YŊ9�T��$Jf��vCP�"��~��,���n~���
�?����2��1�޻=E���ȴ{ԡW��HdT6Jq��n�|J5��mC_]
-l�-G%�hj��-��a�
E�N]���Ha�e��Dȳ�ƛ�벼�v�:�?��"tW	-���^sx�v���+md��w��8sSKš�,�)����EgzNo�e|��,�s
��˦�� ���z�Ԝc�}�ZI��%��޸����x�(
�����(*��]~^�dX�|y/�ޟ?���ZV��"Kk����{���N
�ke��/�XX䤉\f���X�|)�����RG�I����G(�y����s���[�>#2|�wW;D�o��֪�
�"�tR�g�!�$�]_,jTH�]���0�4MW�-$��
U^�{�)�
g�-�;�P�L_Z����T*{}��� �"�F���}b�_&�?8'�
-
8}2�BE^���$����kYiY�2y7/	ԴNF��I�ݮ��\����lmajP�ar����ǵ*���\��n�49����X�ԛ0�-𬝙��E�+�m����p��MFO��7�x
?R3��o2�UKy�ۤx	..�O����.:��dž׌D-,l��
��L��8�D���;kqP�rvfN+��MM�&I��ܮ�
�/��+��o�hL�
��>��1�C|"���жB&4N�r������
���~�s)�tyA^оS�����~Td�
Jo��gyl?e?SV��6�u�y3��
�iL�ʈ΅��Sg��\�n�|�
|4�;�i��9��N�c��h�q
��������e��a
]�#�l��?�
�a΍
�H�n�\|҉�>��K|�
���p�1f-�GsL��a>��j]F}���.6 ��,F���{�x�l���>$̔	9H��
=��L@�B���É#7=�-�����Si�@.��b�sa�sIR���������BK�'�s ���G�$��@4��w��	�B
-&�DŽ۵�����Ln�E�w��끝q�fooB�;�[�-~ؗ4�3��
�N:+�
�_��+��5�D1��8�������C>�J=>|֡�,�Va�Ƚ��A�l�i�F���گ~���nZ0�
2d,^�`O�
-��leǷbFy-D�-
-�������@qZ
�dŊz���
�M�w
Ƃo|�\n��u����w�u�8٤gk[!z!:�°f��ۨ⒚2&����+�f:Rէ!��}�����s����465�s���o���5�[�j~�H�X�&�3:r�4Q'��-ܿ�oS��P�J�kF��a����u׎�*��5o�t�����+���P�.7��r^��+�c�¤�~�QT��*4�Yf�jI�|xC#C�)Є��ή�Ώ�ی��˵�"��=�*&O��N7]G��d0�+
_
 җX�6Ql�Ҽq��|��Pۗ	L
x���(�^�\53Ӗ��ϭ�@��K�l\��v�/%8�Q�o
U�t��4q�d}�/�Uݖ^o4\�F�
���F�p����:�N�ۋ\爋��eK9A�Ko��n�sͻ8�w���O�^I�JG
��*+}�N
��3X�%���nW�(�೼�	~���hU���^�x��8��+�;����~�N�u�d:	;�cqTP�h��+ϻ�( %�l���6�s K��@x�&��P�1Lm�Ќ	�&����� vFE?i�LYt�����
;M�oU���>�������1>VZ���ur[�4���7�����
�i#���"��,����BlЮ��x���I���>3L��
�ӷU�č^��>�f}�5#B"�(��E
D��_��c�k8�/��VuP~H����.��YPO�ͬ�w/pK�s���}�G��b�/^�2v]�6[�_����`���&��g�U6b���Hm��M~[�}��!����yx`%��eU�&�<q���!͝��;(��u�y��U�%�T
?m�R�
@[n�g��<j\�uʹ<դD,����E�eU��� �
�;������`r:
-Hnd�L�򢟵~�h�
�����/�'*�N�F��K�r_�(������g5�z
v�ώ��9ם�N��(�4qk7S=��'����Q�Q�g�ޜ	�����†q+	.���
�I�j,!�
-����b�T7=��tj�,
����<���!ի���R�d\�{����`��@��Ο9/bJq��jT�w_L	�*~
��X.E1^ȡwO	�+�ʛ��p|�"�Pj�nY��U� g^\$W=譪0>/�b�8�cڽ0XD�	`�zlO��i�큲Xq�":�΋٦Q_a&�
%�^p��WUe�� >M��pa������p�/7�9߆DĨ��j�
��:��?V�;�{��e�s�������
�z,W�=��X�y�Y�U���*�#�:�w�k(>�Ps�i�ƈٽ6���o�]SW�)B
|�2
eĺ�S�	i�/��
�d
�dh����{��"l��)��H�C��yS��r_p��y�ȟ�,�� *x���痓�t[�S����z۰�923B�U�h� �Zb��^���!
-����
+k,��$$�`΋4,J�Xw�Ɍ|qё�i�DjW"L���m��vch�O���k|��@|.��C#�p;B�ڒP�P2�p-��$���c*[��@����+�d��	�8��ث�'��L�˧����b�EG�_�0����}��i���z�;y����g���ɇ3ia4���H�*�4yFJ����Ƹ�4�1{9���D�>�Im\�Nϳu��/�W�I�5�<;
�~}M;���3�E��nE�
���>yd�MxŦL�K�TSx/U��l)�E�
F<�KK�X&u_ɷF݄I�&E�)i�@ꨪ- E�6����I��K��b�L�������ș�nivzf���A9�oK�R�-
�Z��
-�7�Y%��pଘ�Fڭ���]܊=����ꑔ�:�J�
{X�9����[O��"\���(�T��;u����Ԕ�2���pE#��E��c���"\K�
-endstream
-endobj
-19991 0 obj <<
-/Type /FontDescriptor
-/FontName /LYFRJR+CMR5
-/Flags 4
-/FontBBox [-10 -250 1304 750]
-/Ascent 694
-/CapHeight 680
-/Descent -194
-/ItalicAngle 0
-/StemV 89
-/XHeight 431
-/CharSet (/P/one/plus/zero)
-/FontFile 19990 0 R
->> endobj
-19992 0 obj <<
-/Length1 1620
-/Length2 8625
-/Length3 0
-/Length 9672      
-/Filter /FlateDecode
->>
-stream
-xڍ�T��6N��t�0�����)��p��n$iD�;��CZ��x�o���s����s����
�6FZ-]Ni�XEprs�D ��: ��
��adԃ 
�Hq
�p
*�/�,
l����Y"���aP���#���- �-(x@ �
ap������P�A�.8��0gO8��
q�_� kV ��� �ow������-�`���-
�0k���,b�������e�����I�r �!{��
w� ~�hX:���a��C\���l�p0�^��C]�
\�6`8��l���@�
��X����psq�
�O�_� ����0'gK�'j��8��
-j\�j�����v�o�f	q���7���%@AZ`y��Ov.�p�3
����!�W��"�CmdaNN`(��W~r8������mu��ܡ�<�B�6��(ظ:����`e�?-�E8���� ?�_ �
���_��<����ܿ����z;Ü����[����������}����/����@� +�
��O�{1��|�y8�`�<n ����'��ٲ�A
=�1��\������
�o��dd`
 oN
�������?��7������[�e	�37�?���0���k�
�?g���ua��
��
�,���)�d}����<��]��f�W�����o>
-�����,��������O���"�7B
v���55����`����j����!
�s�����F
����c����}xG�s���f �� ����w����*q���o�~��{�<�f�k�x� �p��'�}��?���~9m�
�� ���.�{z� [
�W?�@�_�?� h�7����_� �
����{_�Aa ���}
-�/x
-�7价��1��� ��� @���  ���W�p��K}O��x�
@�����

���?��v���o�ߓ~_���

� [�,���EC�ׄ�]VI?v��
�f�4Lc��^������La��
Z�_H�
v?Z�,�r.����{��3�%I���ϵy���f+��i�x��tm�l*N=�-��>�����Us_�
-�i�]��(z���,���mjoU
-��^�Lq��ǘ�0�Ye͒�a 8�`�
{�Ϝ_L��Ѩ$������z���]�z����tR0P�?A='
�d��~�B6���p
>�:K�>�����⵩�s	�����q\���
�J�

�֢��TD����u�����M��ʅC3r��(X�V6��vˊ�������d�箼
oBT3FlS��D��e��nʣ�
]6M��m��k��gU�9�14�T����?�1.��v�BHj.F��&�d�JUΠ��p��M�m��KQ���/�ˆ�˜����Z�5
8�WL?�Uy*f��e��$���kP
-����������P�h��,�.77�n����`��ɤ�X��
�΀85W����VR�1t,6�Y��b~���כ.3�j���NJ�^,��3l�
�O��^�j��p�X��:�ёh��
�A��gҀ�3�
�ko
y^]
�;��(v�d�B͛|�
�µt=M���)ڰ�_��Q+��V���B������<��.c���m�
�V;��U�DZvU�&�]D��V��x%������b�̍�N��N���썎֕��1�rr��gs�^�D �0�3��s�`?
t��P-H>Ã9�I�
ՉV��Q�O�Q�4PLJ8��-pC��vu��h}
O��d�m�^AU�y��h%(�9�q�ׂϒx[�/�K�����3�v#���4sDP����琧�I��0�LY>�n7=dA�&咧�zi�A��1�� �яm^^t��݄lE~��3���E+��=mq�]
}�
-
��贆(2�ہ�T�
oQ���%�(�l?-�N}
Y�~�h���^-x�7�#n��c
oC��ƶ��'��M������c����w�'��<���}o�,(א���{���"���f��	�h}��I��]O�wD��juD���
�I�fv	U�D�3�o`.�%I�������B��Q���Y��Ix���
+��C���_G�R
��-�G�"҇���
L���
F�t�f��f/@@�$Nܮ�A�d�|�L����~L���SXvv�%�l�'�ķoʝ���`p/4�T��b��͕/�|ym
6H`�^�����Q
2�
�� 7κt0�#�w7X,��u���.^���a�-�)
FBG�5ZI�س��`QeԂ�F
��_Up�؞?o;?L]��lm̛��^d��_��qa_gK���̬�Y�7�a���3�a��^eDC��b������*-~ů��[;ա
߾t��Ї�ҿ��x��h�d�-Z�7>e\��ʈ{3�u�]��3��Y'&�
�՜�;�7
$��TO��
�����	Rb��9����N�`�}����y��Y�n҆D��8�~3*��&
I�6���]�(��Nr��X�pi�5/�
-�<���
2�%*��{�Ӡǖī�iu�Y?H�:��Қ|Z\�E���tC���㻡�#
��.�Ï� Õ�����<�~����zCѽ�l�)UP��V��¢���r-��Q�Vϻ��"1�����Ⲋ
�c�WMR6�]��~�����BAҜ>k�V�^��ϑ u��^�>���?�������5]��.�����ׯ��r�G�j麳��e^�[�R�n阛55�_����ۛ�=����o���zk�!C�����؃�5����
s+���;�\ܓ���
���`5��
-j�C5b�E��1dy��t��S��PF�^��# F�ju�%#��w�
Ld�qM,���5�e47*b%�b���г*��d:v���S�����4���J�J���ͥ��$�<ߟ��
yJߤv�}�OٗR�iwg��؏M�ɆM��)���:nmz���Is�U6
���j�;��O"�,*�)��ak�i᣼4�<Eh���N���
-m�X,�%���
-���O&_�@���X���(&�L-�	u��UXA
-�SNrs��ٵ]��C����d��Gܩb:ts�̶�rN�L=0kc��i�>�@^��F
�)
WrV7����<��;���y�j�t\�'�e����y?d������$�}��B�L�v�N��N��s�tۑ����k^Q�A�
��ЙT�Ͷ9pK6�Y0�^2�*�.��r^mN���P�
5y}���M���)���S�Fk����{���r���򻵊0S��C:�
-�-7<�
l��FΙ�Zfw�>w�>p͏�����;2 ��XU��ܽ0�� Y��Ο��

-I�m�f�~��<�[�g��ǹ?��V���A�he�1
-�h�P��ڛ����<����L6�	5����8�ɪ��������8���f�X�L
?zk#�F$F�|��#���-�@d
�C�D�h���)�d=mL�G��W�

��-�A�ڗ�Xw_�P6��k]"	6F=^� ���
-���m���w N�LE�'�S!�,ylW'��m�5���|�4MK��w=�G�D9�͌ޜ��y?,J�V6�D?����PP�<^}�sj�L�~l'���΀���b��(I�T���Il�^4�S��
U���%��6���������)^��G't�(ÿ�-�t�a"w�<�(�
�q��[���>4���^*�$VNm��ux���W
-фn̔Ŝ�-���0d�
-M�ȎJ?�+
P>�wS,�^��%ח����WRV���������ʩ�b
-�3h at v�����y{]\��/a�O
0��m�*��	��R
-��4 at d��53p�	���R5<��FsĨɺٱ��A

c��
종���%}	�x�,yyj�( 
(�]�
�b���!Y����r��=��nԈ
u7k	
RC�w�e��{pu�rK컇ʤNn�~h�vн��!
-a�e��kY=*V�4J
���g�Tc��,��F"R��Iķc��O�&2�$<��Qc񤠮i�jS
$r���#�13
MH⮾)�N
)O�=�>�x��m������^$�7�x�l#
���m�f��ڄ�,��o
k	z�uD:�Q;�}
���ag�D:�Ƣ�Y����Hn{Y���S\]G�����e$�i�b��|{�������� ��
2RQ9RA�+H4�K*ٹ�Q�E��l��p�
��*C���>Wis��
�[�c��`�9IB['�d��^�ʂr�/z�
���K<�zϬ����̞�Ͷl%v|�&\!�'�>�3�����&t G��D�;M�D0e0?���5�a	��4h��-���$7G��{���ͷ՜���*l�{HP����ؗC�~S���z{�{��s�q;�
�;��P�8���+�UL��
�N"�`���g�Q\�)׷-2)����,�n}��J���w~Hr9�
����-?��M<�J���5!y<�A����u���s�&��=BG�����
(+�U������5V[�{L
�G��Q����x%���鷫rخ�x��K;��0L���QH-)!��'��n�Ix�O�~L\��1�ȇ1���z�s�hC;N�x��
��?)<M��0X�t����G�c�e�����doŅ�yV��6�Ik�e�n�R���*�~�9����>�)��
�?�o
^f�l�k!��m�]ĞPF���

{U$B
��
�o/'�/�Rh򄉂>�<9�\]�ZrҚ�����O��Q��8N�_�������J�L�H}K�^�in��m�U�g �G�p���U�c�bH�����`��?�!����vC�j]J�]'^�-'��
�R�d݀	򮛢���0�K��G:b
�$�_V�7x�,���.�Hs�
egr/��64�

-�
-6З�|��S�>?�\֫��"�6�39ڜ��M\�UZ<oFH�]��w|6�%��;T���#��>`ӫ|�4`��?>�P���P�<��q��3fb!˴K���a�5s
M���ļ{S�Ԋ�!��

�FG�'K���3��q�6r�+Ng^��s=f�$a5�s��^����h
�$8��"gg�-��N��|��%F
�yW�Z�қկ���^���Ͽ�L���"秇;}��,?ƃ1�����L�{	A���瓵�ٓ,��=�,
��o5y�qw���ֹܴ���^�
&t
� �Q~ݺ�Pî��	#�H[�_44��p��z�� �O����m�
��L� �]�GF����K��h;�i����C��6Ư����H�2�
��߱XV*�ҙ�𞥟�eGk�=7߮^�.�
�y��΄�-5�<>���

�f.ڂ����8��9�y�MS��Aע�a)��$6�$��-��K��-�O�֢S�ow'0µr�^P�N��kC��鼱Ǟ�C8�Ƴ�4g�g�x�v�
(�렟rf�95�NɱWZ3�����cK���q-��H����Z� HXw���� �:�kև#�M���w',�F6�$3��B�O��i��%j|�S����g�̽բ�{"�@k#��%�Wnf�h�i����-s5����NB=������s�C�.�Y��\6���'[����˪�_�yD+eW�~V�<t�%|Y�@7M�gR�)W�2�A?j��
i
a�&� XKS�"�

7��9��",�̪L��@��3
|wU/�qKd������#��}c��/FsEL�M���v�
��
��"T�*]���b�q[�����e��9���'�9<��|�çu [...]
-�ʲc�Nn�/�
��"��s�f|4�
{d�
�_���-������!�D&�庒f�d|���/
���
1� pq
� /?W�������G;���&;�s��P������2��`������C
RW,8����zO�����yI4;�n���b����B���ٱ��W�IV)#kx������66!\���J�"U�c
mX<r,��7o�K�K��UaeY
Y�E��D#5&F� �
-�LĔ���~�n�������{��%��O�O�s	O�3h �薛[�1������ϼ��UYj���g�a�����6Wn>�*
Y����IDך0�k�6"
���;D�Cgף��\��{]#�U�F3�ƴ�e���1]�M%b��+�b(ؚ�R����NH�1���n����^��&b�z}�@��X=�1�@t����
nC6�u���)�YΛ�,�B��,u�uˈG�ԗ��#���‘s���\�~����U�c�}�t��xۇ�!Q�{��Ȁ>��UD���b
��\&
M�u��H�
����[I~Dz)�sL�${��,���ㅊ�<
��P�����ч��=�������p�e�D�g�DP5zUЈ;��
-�@����QkE��"_y��A/���U<×�/�sJ���-ߝ��s`��:���3��׺�l��U���ҋfdw����FMZ#����
-�
-�T�|(�df�5�6�XZ�b%)ބWl�O]F���ٲq
��nR
-]��
 �3]*@ٮ
���5�|NW(�}�)�f�X"q��Ӧ�Ѧ�Oy��`.���0[\��B/���}�b4��p���,�kZ��wYᕢm��J��M�ƻ�mds��dm�p�c'��
�S�q�<�qbd�
n��r�F�]{�eV�v=�j_h�`³"��w!9��ˋR;$����tӄ�(�H��ف�`+OFl���<���xq"y�)���s|��;��rX�D���o$���;'-l��
ҋ������g�%�$M��3	�~����jP�4I��j�j��C�d��>
-�x(l�K��wIN-?��A]�O����c[�Wz��=1�����0�]Ĝ����}����$��kl�g�Q�ȉ�|ꠃb���{�V�?��v����3����
�f͢����C�D��]u���� N�
(����0ܚ"��;��s���k�Z�
���:O#:a���/w����w��pR��?0
��.�h }!�RA���<ޡ���M7�R�
{�Y�9��S��J��g���m۾�\��n�����f�Y6/�w��(�@.�&n�B4$
��c
-g������I-ރ�e���ص�pT���=���	�Zi�ɫ���v�_�||'3߳��!�X��

��q��dj-y@U�Z��zZ4
-��Q	ZCڧM���!&��
���
�����t�d}b�C��Vk&���r��֊c���`M@��̻��v�u"��e��c��8�h�="��I�v;n���u>d�y<��u8�Ao�ip�����<,�T��nUZ��Ň��T*D��޽��&�|�W��U�@�n^�Ԫ!�`������OBO�e�J��h�-��y�ܴ�li	8WX['Z(�6����$��_�DW
]��=�;=����@w紆g�3�ې�dҚsLg��c��^�BYJA�8�cܿ���U�y}F-iX��C�N�P�1�hg$��
����N�x�K�%�1�&LѨeOc����߸_,e��v�� ��\p�����|M���?��
�dzǂ�EP
-��4K}FVh��:g��8VJ��h,^{ObQ�����\3	�1��7�W,��$�R�T��T�?��.���O������eNr<�¹\\{_�ý�e
{�MMs޵8��n�zL���9�Cěb����w�U�
��v��g-�9#g'���3���+���
-�cB�>�|xb�k�j�
�IX���&v+�@l��3k��9R<)��^� x
-<�����p쎽�[B@]<ӣ����(�+O����`��zЛ�b<��풲�@+;�S�
>cS����vvݧ{���IP=
��gu}\� �:2��b��}VƉ ��{�*�,���_����?���KE�ã�ɬ�S$��c�N�ܩ'j��%D�eN����4Ղ�~)�3A(����h��Jb����RW���2?�P�R�1
-_+���en�PQ܃�;x�l�!��7�o���>��4ý�Q;���
-
-8��C/������S�o�)
m�W��]�n�֜������8����A�ܚwҜpWܹ��T�ܙ��Z���%��σ�gi`W{�t�u�d���(�b� )���gڥ
UF�ر(��:4����(/`�I���A��8����l�jK<��~���t�=S~�~�h��Q_�c�xE�����w�SPhD��qm��6
/�{f-B�b��g��"��/��q›��_s�FP)>���=�\�]KZ���.���"_k�-
�H�O����:�g���)�͋�����6��^�l��͒(�Er�g^�eUrc+�S65�w�<��Q�R�A9�0��n��P����$U���C�������u�ۖ^��2�;�C�U�&r��˵�3'���NQdng�*%��/9VՓ]{܁4�.d�Ik2�L�<§���ڝNgLO�*W�ڼ��7�]Z������ȦX�=9�
�
�Yǯ�!O����ѯٌ�5��zO����љ
w�
�Q�?��
C�6�h at W�unE��/���a��FR3��rY=V֖rP�YN���R����'�w�U��xf�kW�b���*�+�v%b���%*N��Œƫ��z� ��Q���ow�H��as�
�0+�
� [...]
-���R��Jm�q��6a>(Ӱ��a�5$�'�1��ȳF=^�� חv����u���f�+
M�\�r

Eˢ�@R�[׊����N鞛�!�)剉X��
z�f��fc1���7�V�͖M��&(��p�&�m�;#�

�m���חG�
'�
-�2�5`�F�,%���oJ���y�UU-ƻW=�
�9��l�y��
��QR����bҖ�M��uҠ`���N
������]���������0bd�q�3L�.�L�˴ij���L���0<R�SE;iw
�(o|�����W����A�� �
��C�z��gz��ψx�,�
-2'�
�<�3Ծ���FQ�5�C��4�LY�ʵs��
n�G�?B��]�)�T�� s!f��'K�LC�I�h<jB���LJ�H>�%��v2Ʃ���m}X�X!;��%��T�n���
*�y�E��}Z�q#�?]x�Q
fV #��‚'�I�]�u
HZ�h�p�n]��i�%���2ɪ��5uZ��c�l�O��^�b�E�

a�T�O
c4�FRv�0�$
/U��V�F�
.�	
-.	����$�O��bƐ�
/)��>�:��_��1�'xa�
꡴×�y&��pVf-R��?�
9BW���X�8��w����xCu�e&P�|w
�~Β�b�΢�?�Y�5�m+DE?ϱ�
-BӲ��,aZ!�W�Z�h���aE���hi(�_�OF�9)�/q���i���FD���*߀93эXehv�"x�8ŋ�E��U:�{R3�6Ԫ�u$k�nʗ�L�
��\�:�;�y����'Ү���
x{s��/6����.�- ^$h�r�0�7/"�J
�}�]\v0ˠ�T�6/Y{��1��.[�!g�v�r-�l�=�~{�
�թY�ZE_��q�DYgMdq�l}��g�5鯧�+��<Tu[�}$�����9�3�C��"��
-endstream
-endobj
-19993 0 obj <<
-/Type /FontDescriptor
-/FontName /YPFGSD+CMR6
-/Flags 4
-/FontBBox [-20 -250 1193 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 83
-/XHeight 431
-/CharSet (/a/b/d/e/i/l/m/n/o/one/p/r/t/two/u/x/zero)
-/FontFile 19992 0 R
->> endobj
-19994 0 obj <<
-/Length1 1865
-/Length2 11015
-/Length3 0
-/Length 12188     
-/Filter /FlateDecode
->>
-stream
-xڍ�P
�-Jpw�иK���=X
4ָ�[���
N�.�	ܝ�Gf��̽�W�W]E��}��i�Ե�$,��`Y����S ������f���B��ӆ�ك�����]\!PG��\� �g�4���L�Pt� �@>! �''���S�?�P!�4�b	Pa(B
���tRP'o����s��
�L �� ?�� 	�
��P�ـ
�3Z��ZP
����B0
-۸�9	qpxzz��
\١.֢L� O��
@�
-v� [~���
�cG�h�@\�kA��<A.`���
bvt}vpw�� �s��jN`�?���4`�� �
�w����8��
���:8�
�!�� +�=�&������
- 9Z�6ٻB��A
 �=�����A Y	
 ��_�\-\ Nn����
9~�yn�����������>i�
����
\��#����ϳ����7Kw'
G��;XA�/�g�?2k������_� v��,l8~��v���?����uX=S �C���_��� 0���
���o�#T `	�p���!���D�����7����|
< �������lYB
��1��r9��$��Y� ��JR��e���q�r�@.. ���������?����� ���ODG+(@�O
-Ͻ�
��f��ua�wU��
�����'/�����������7��_���u���C��[��т
 ��韧���y#T��{����z�?�Xl	qw�_���y3$
���n"�U��T��Y��9@������G�:�����99�G��kv�O���M��?����q��Z��9.^> ����|�ψ�
|^NK��s
�`w��=� �����.���S����[��p��A �� ���o�V�A ��7����ݟ��. ��ߐ��A<��������������_���|���џ�s���s�'�3+��n�-�~����`�{��
���\6�o��
�/��mp8��~�����:ڃ�������9����8ٻ��+�s����\ҿ�| ����������v='w���ᙣ�?��Y��O��f��]�4���pwy����~����?�o0�
l�:?
�xf[�v]%A�ɶ5&2E������;���~������}Ȋ˥D�P��
�
��߃�:�Ȗd��;�{�$�ɭVԹ	�/�$j�)P�ٴŷ�
��t���_t*��:�
`���]{��y���-�D�nil�SB�/���F'�(�x�.���
15�23�����n���b
����B_�U�����
-m.�.ZCb
-�
ܑIz_��4E��%���F�E��?�`��f�Q���!I�b�pT��kW��hMÎ�rQ�
i�X�+�`y�w�9/r��}g)�pj�;�?�K]׽#X�R��"�`H�<u�]�]��;'I����������T�
��pxIƜ�e̦���v�*�≢�ܣX&�*��ׇ������������~c&C�U�egS:k�������Ԏ�5y�T,����P��K�dG�ˢ���d��䴙XJ�.�1
-�"�7v�i�1�fGo
?5��r�'h�b��1����#Z�!m�l��[C;���
fH�V֘wCl���
UX�۰�
&ټ�<�����A���[%�s�]N��&3ۓ��M����n�r
&(��~��)����Ul�bWS���v�
bK�7�)��
�'�!wiK��9�x
��tIC-+ow
�����բ���I��ǜ8�
ٷ�<�5�T~�)��fQ:��]��@�9��-�wOL��
-tcOΫo�hj�Tp��wu���0{��ŗۦ���(���|Z_��X�ZA��I���z�,�s�;�
(ϱ�^���Sp&�"\X�����'ͷ�Y�n���/�e2���w�[�Ix�t�JW�&��
��'�9Hf�3)i����j"bj� ����`�q���ᤅĪ�	�\3����l9�Q[�����^��ۯ�!>Js*Ք��Յ�O��PXL��f=$j�P�2Ïr^�e
�G��
-^�Cgzu9�ogD��z�:x'�CS�O�<�L���o���
-�<R��'yX�
-B�=?ۦZ
��84�7���k����i=8ޔ�#ײ�� {�

h/~d�!L�g憶�Uf�L�p�����>����GE1��7((ޑ��Z�DJQ�:9�T�r� Q|�oEd�l+`y.�
U�r��|�P
-`�
n{|qN�q��&�.7^����9j
�S��7&���zw2���s\�1y)U^|=�º&J�p�c>�	�W��e
-�䰯��7��:$�l�1w�bz�2��L�H�2�X
-��iA��
�R�)
rH`TAZ󻲆�c�'�X9��巭�[�c�����x�<�m
��7N��{D{��?���C9{�)�d�U0�+X���q*�#��^P�,�Y���gO�S}�SM����IM�N������HO\6���R�E7˱(y����\
-����J0�
*3�={���~�fH��LK&Z�,f�r�w{�f��R�Uq���(���͟�x��h���̭g"	S��a���ؠf�ƑsV�Os7AkM
�
�f���0ݰ���!5*��X�1�Ud��i!w �� ٷ���Ȯ�QHpHj�;������ �
����*#yz�+�|�-A�<y5���Jd0.�>r\YQ?ߖ��ցc�Dn����w����Q�Y2�Q�쳚^�<$-v+ی�0�xY��ܜ*7�ep�9��kF201$�.�O��u+��.�
�Fݎ��PHW�GX�7�/|�A���.���P_K�+gO;v�T�� ��j?~1�m
�ƪ�vGw�r&�|ٖ_d
-�:��f�9�:"�.&c
�%@��!7WK_|��	�X�SҴ�>��AkJ�S�u��]�s1�2Io�d���Wfۊ�
�Y�8tZ��!v��t�2'{�d���ޖ�����vL����L��7
^��)��G;��.��i��q��Nx���^
Q��I	��ȲP�b�NL�
Df8��K��k��
^��8,��T�����#��O�r���urx�I�Zءcɿ��d�~�I*{�[�gٯ
�.3
���u�V
��3t���>��r*��"���'���0���8�N_�7.�I�L-�5>
���&�m�����ʳs��w��x��u&�1��Y+�4�'�z���O
�J�6Z�2��
��r��>�xSgG#��Ұ
�
���M
M	�N�)K5�h�R�."]��uBֽ;��|��W06���y�Y_�ض�U���;�}�
A�Ƽ_Bڑ��yJ�������5N�+��r�����>�]�ҔB_"-O��2�WO���?NOtz��G-�y��8й*� ��:��00􃒶X�ui�� ���@��e����t��W�=~Vo�a'�:!U�tJ)�%�%y#v\��M��S��mm:��pw��.�p����k󽂈�ǘ��.���]���
�a���ǁ��ʖ����\zgY8�<���ǭ&t�̅�����~'�b�Ga�a�z���Й1���7�ö�7ѫh>�
xש�K��oE)~�K�戩�>��M@�FϔbR�c,�b.)`.�Q~��D��: [...]
�w�ǀc���P at X�0Y�_�i�K�S�ĦG�q�O�O������0�7���0{�Z�sT��F]��PX�6�"0�R!M�{���C����7�g4[�/��2w*�S�N��e#�2F�}�w,s�i_M�Z5��}B5��1Ɖ!�Pɷ�E�rs
i��	t{�:�(�O��5O�O3M�����h">uF�V�z��o5j���V��e�M��|�~rF���3�z�J�s�2�9���H}櫛��͋�����5MV����X2�0!��-���"���Y7�H�N�g��_���h�jJ�
�r�-#�"�͈�cQ;/3bMJ�ED^��]���S.dӔ����vF�r��#�`��JmU�K
-���[(�a9nA�TGT��Ɍf�ß���Gh
�x�l��~�;�+�^��Z݌���
-so�Q����
'
-�*���+?�`���i'�+��Ht(�G8�h�
^�7�A���
��64~3������p��k	�n6-���(� L�*J
��c�b�%$3Ӹ?�
v�V�v���
����^�G�
-�51+ίS���7
w�R�;1E���/,^Ҙ}����5)�n����!��_Ux���h��
�%���'ʂd��D&e�NW�����m�j����I^�HZ�M��
lt\�"�zi��,����bcb�@�=�:�&^�ު��e�.��ܴ(~P�(/��$��c���:�z2�������h�#궋��sC#^�A�
��([���-�;�q4U=FR�[��2+����G���C��X����
�X�IoX�zO��T��q:Q���g��O��y}���K(�OQ&
-���qD��;DL)��|'�����'��qߨ�~b.V�J�6��扔;=����*p�X����KŻ���)6��,�1�4)�m�� ���;��I}Q�"hP�%$�7�Ջ����HafőG�P�k�����좹
�W�S�h��.�����E�X�1�Yd����~
�?}�[��\�[�3D at Ou� ��ο�ь�/J���̮�X=q�
��J;��{%;�Rn��'�C�PMi�%�!�~丣�Bۅ�hI��3�19��R�Jk��ͩQX����f(�T^���a��
���y}�_Cz��Z��R?z \S�9`��D%
���f��
9��
�
�i��ˁxˮ�ov�#ּ��^�8�7�f����('l:^4���k���-@1PP�
U:�=�jL�9�#��lzܾaOik�
"�ݳ���q��=�kliQ������%+�a&
�b�����nYĸ�����G�
f��3
]�q�B}�Ɉ��
@���-�F����2~.�p
�Ic@�}ah�]M�M�ovk9bm��Oh�
�
mT��^!�6��I��I�5P�p�>�M������Y�MK��1�%�_t�ukb�`��֚�
-iI�t,8�a�|#���
-*�X,�F�{�6S��`빁z��
�n~�wm�m-�at��~x�]���
?����X�����5m�Z�bn{�
���FH��+1	C��C�RŲ�!@L­^��II����x�3 �#|�AS��;y� uY3�x�($�l�uë������ב��{M�̌�ԭ����󅆘�>�d����Ĉd��S�HI:�Zϐ]������
w�)-��Y6�+��y��G�����<����3�az�C�'9q�8B���Z]RA����
f%���ir��A7��|)
O�ʢ<���1`"�;v����>�o�
 Y�`�e�����R�a>~���[�Y	�HP�n�mb���4��Lڢʿ�+MHQPј��gô�:6V�H�Q�$��Y�Vd���l�V�,�ۆ�r�����w�e�ڪ3p@E����
K�*-[��9`Jv��ˆ�Y�U�9�y	�o�:��������Xo�@�D�a��0�H�ʙ vo%�T� ���热36Hl
�����#g���DI*��C@ǃ"�8Pb?5�g�5|��Wo[�j����I�	���� .%��m_A�wxQ&�
cqf5d�
)����ڀj@��(�
-k�uQG��eS��]� �I���bg���=ܯy���W�J�W������*����Z�� уX���g�W��O�,��:�s3��:�2�K�K1�ʞ�p��@��/�s+Q��6m)_�ub�Cj3�	G
3^���*Yyѣú%-Rmr	-.g
<x{֞�q_��Hv��
e���H?{Cb�3+�'�l���Q�_�G�F���)-�!<Dz���_��Nj�c8��k��M
~/�[
}K�
R��
D���M�ҵ��:0��'n�N�),ez(ڋG�!`!������0�1G�e�����ǜ"��D�2�����;"Ӊ�q�3wzvذ��e
-.�l��~88�Q�%��[l{��P�a
�p!S.xE�-��`�X��*��)]�\�ϐ��݄<��}��m�/��
F ��Z��BAM��Y_�{g8V-�x�gˎ�`���?����q���I��Ӗ�X6
�
-0
�&Ǫճ(2x:�J�T���?��'�"�6�D�����|b3� �D��E,���ohSt�������T
C�}�f�
W^�E�.��0 at O퍘.2w?7�*�l�T�{��H����ѩ[�]
*���2�}���)I�v���Mo;Є7�P��4�>=^H
�ⴹȭ	W>	��cx��}A�6jS_�9��h6�4 T^�����`WIuȚ��٫h��y�N�2��w����J�����m~l�n!�P-xJR[�-<�|�K������P��S�"	wDɐA�(�})���YK�@�ER��u��
�$n����6�촃<�
�$����"\<���j�G.�I4ˇ��+�����İ�I_��;w�	a�
slVf�2�O=�I��V�2AQ�V���֘y�f�������%.h�[8s��.-<�$qZl�:�C�D�^���Of#�4�+[���c0	�:�%:���@f�	h�R��b��YU�mu�C \���F(g?���o|��(7[$�}��Q��|��X��ug�1Q���Qv-�wFjI��"4hJ-���.ͯo���)���N�7�u�ilh��8
��ggVxioD�
w�h��-��
-\�2&j�i�f܎�1Y�P�U�¢ɥܶ�:�%w��dN��XSHֆ�^gG�h�ct��wTj,k�L/w�ֲ�F"�!�M0��Y�ё�T�$�oj�1�2*Ձ��Ҍ?��&k*��H'��6��{2}(�Aof.�N-t��ұF�1������W���:�}$���T�mK����Z�T����
-\؊��8l߀Ҧb�F ��
bܵH�B�p��-A����hFM�w��F~��W��"�Q���`xޯu%�i���R���F��
�$7��j�������6���0`E at NK�h�z����Ǟ��2���Oi9�����,c6�":U��y��Q\�W4��'Ku~�A��5�O�z��uQD&S�[�������m���"-Ӱ��(��kzj'8�{�)��׫Kg��'#�m�'�a�;��q7�2�W��a-嗩ʬ�E���<z������O�k{׆
�DaJ=h��|P�
�:�0��-���z��N~j:�_X�
�� �
��鑝(:�Edj�^A,!�؛�#��_&Z�
	w͉
^֤Gˬ7�k������
?�!!���hA�9GN����}���n]5j3�c�o_uo���
xi�\ó!��Y��;���I
-,��c\8�%8����$�ݖnF�?V)� ���׽�ދ<�L���
�KͷS"��3������&��z
D���"�0��g�w��^c����w��[��rDP�9-��w`Q‚��*>�D�1	��~5=��
y��
[�E.;�T��G���Pkz_h��|L��t]�
NV�g^�X���/=�N7�yլlZ�̋���c�Vf���^ۇ����EY�tQ
�}~��)EE�
j����5_j1��}�v��^%�
�O�8N�8Y��$���G�Lj�e(v]�
-�VE]U�^�MZ��5��dñ��]}�0iMYPD^�[�������Jr��`?+�
��{$l��O
��œ���̍����r3������/�e��~�����s�
��Y�����W���7�/��<����~pm]��	ٝ�,+�����YR5�hMGk�4���*��gA�ohĺ
F�(�탟��Y���~���>j�%��ө�/���H���od��>В�r�Fǧ<+�/a�O�E�r#%�ƁuR8�ٰ�0���
�N6!.$-�����=�]4Go�M�W���Y� U�։��Iߗ١��W�j~`����#�c�L��O������]3�[�D	����}��k��"�w��BkLb���n�$CbT3��
-��U�7/�ntЍ8�
�5�1=VP!"˕X��@s�c�7�*�C��^�©���)?ǃf��E�F�O���
Q5EZ��ӊF�NVXL7���-b�Ρ�c�8�\Gҁ�0H�jL
-q�W����0~��a_k*������[:\�"�-,��g)�
���
�j˱4�%+3����4����W�o�L@�ߠ��d���<�^R�K�I\\�
���K��K�8�x�CAm]$���iN��W9t�
(��g������ǟ�̫%o"�zTvY�qh9����޶�X�^-/��[��E��t��̯�u��”��e��jl���xI�:l5�.B@����_H�4�V�v����@�!�M�� 
 �BAeT���..�Ϣ�{O��P��Z�Fm
(3lh���e�No��� z
-$Rn�db��2F����l*���:�pʕ�3��iL���
�5d�yi^n�<,?����KW���.���jLO��7O~W�`��x�<{�І�~��`��5��E�Z��Xbwe:�⥏������q%r!�O�)��n�
�S�
=E��u5����"b�����0��]
-iK_�
�Hi���6L��a,���[��fT��ffl�=8�������:�B�*���z�J��WR�g�E��
�7?|Y1��bk	��)V�z�R��3�k��J(#���HI���Ӈ)S��`?gj� :h�T��T�����̄�3�!��")�Ҝ����>�G�H�)��g�B&`
�3�NW�������ī{�.��Qp
�#yqI�O'c'��|zz���u#���y�n�
W�����^3`Hc��5����i#]Ēg��Mn�`B
���r\ŌHZ�
����T
17��T�[i9�,��
�۰�;b�sp#Ar�\�
��jM���r7A�A���	R�{kE�]�s��s�Z��k�7%R��Jm)��<ž���Ѫ]7k���m«\C����7d
J�K-�����C��nm�Pn�Elc߶����M�D�*�jv��]���tm��D�3�$��
Fc/q\˜=�T�
-᧶���]JD�3{!稷���?�}�t�_�wtc���~��2�0a�
�
-��˞�������Pn�8d�M�;)βd�Y���@b�W�ͫ*�,�u~Oɵ
�;���D������:#�[hҷ�y_�I&���BآT~��\��Jݖ����H��j��i���{������
�f��o
]�Wڡ#a�%���ъg�\	��*��R�Ŝ.�t'��\
-���KmDZd�O�S!��pw��Ĉ��c��q��"?Բ��n����C)D����E+�(����U_Ja
9ٕy�����T�3~:�
:�u(�'���
-��%|���6FUqN��|����Z��T�ћ��*�+#ܵk����a���V���JE�����έ|�M�%�����;�4d��

�=�۵~�)����5���b4�
X�hP�1^
-�N�Z��",&g��N���x#e��<~��'��ih�K,�	
q������l�9#���q kS�
z��d�X�\j�yM�(��᥂��#eI���|�q��G'ݺF���l���+U�����
��kTA85��]`���g�%���Z�$�9���ЧRO�A���Gg����H�f�}�W����	����{�,��� ��7&�K_�<���2�
-�_�M

8��Y��lOy�'jXЊ�	}��Y��O+5�(bǏ
���Ե&-M+��#\@i��0͂+���Ei>�cX<����Ӥꜣ]ٙ�I�Nu���^�k�^
�߃`C����G
o�� �����-��x���{�W��$��U���*��M�yQ@�|��� jD�Y�
����k���ڲ2
�UA O5�Qz�r_�%کY}� ӳ��+��R�h�sT�g�������ն	Yy櫇�o��TR^���\IP�4Z�
,�6{,���
9���Vw��T�/!n�8���p(���7���,_Z\�6�1џ�fs����Q�*,��ZW���+����p�o'O�k��qN4���@E�n5�e
T#ߩ��-�����C�B���4F�k����d4�P���R2i$�c
�h
�Ĕ��s��$�P�K2<ʝ/ص�v��k|�-jL�󝬀�T&�
ٌ��\+ 'm�e��?WD�%��W]��H)�fr�D��
�r+�ik���B
�ߖ�Z<����v7��T����b����J�4�V�;3ʋ��?=�npld����
�����2{�M�u�]/h[R�T~t.7L��W�O12�n��e����1"!�{�n
�98�=1����f
��"{�n���9�	dΆB%u���I�n��I.�Kv�?T��
>Fp��џ���y�N
��������vB��(��c�?0]��B���"�
�ـ�Yj�˻����0����s�+OQ����y���kҽ��sK�^
�( A9 ��$�ef��)
�`W�Q+y&�v2�C]��� p)D�fT'�
U��$Q�	�O
f��*�U'�9n�y�
%Qv�)}k�f���Ox��X�6���ղ
ߗ
�\�i���6��~H��B�X���t<"TF5[*K�V1�؆��pY��#񗎱=��3i;�R1�f
�:
p?����E������DN�����I5^�9)�~�~�!D��GF'��@q��o|��!`j5���<�Jh�f���n�.��D8�QY
-7o�m�����e5�☀��˵�=݄�*d��Lg��h��^ŵFi���c���[*
o�4���.Q6�W6t�z�c�
-T�����E����/��Ypz�[�p�_s��h
M�|�ѕ�
�Fb��Q^��ۙ���Uk�qCH��u"�J�?��+������
�ƋV�j��]Gpō�p�T�&�)p�g�G�(��>rf��
K�#�Fu��T2Pz8 �]��p=�	���-+!-W��<���J����u�ƾc�S����
�P�
�D�2��h���*�df�W9~�_�3;�_�
��0	��Y�S�c"�q�,x(��4�������<��%j|����#a
�]0VKO}]���V���DH�����m��c
-���[T�D>�!��v����q�
&����Q듄r��E���ØY�8����n�])���mZl�|cgQ
���>�U&�=Q�c�R��YB(�w�lH37��7�g�qFkKJj�T6Q�iʞ�
UI
-wA�IZ��>�.'�ؒ���yK�:�~m
-��8P�|ը�Vu�1Ӓf�u�I���/V��'��o�~��ofpm�(�Y��d�K
#O6or��W1��}tV~�9�2\�*���4

���7�ޤ��+�c��em�6��8�t8�_��+;�S���
��o��]��@ۃc6�!�v�*?13�24�x�p�2�!y��T�uW�HN��/RJ]�
I�d{�!�A�1�rv�:/��&ܠpH_�^~�ɘ>.V���G���9���f$94K2~ЯUX7/ ���w���fi6
RK�/
������F�P��2w*q�%ՙ
�I��fLĤ�O��!
�ө
-l��
�����
ٍ���@��ŝ._I#Z
�Mt�4
]��W=sD�7G&o�*�.����ً�"l`�
����j�}��LMf�k��l-�c$S%�
H
^����%�N�_�����pC��

��,
q�+b$K������4L�^G�����
C;��@q��Z���<z��p��c�O���\Tm���j��f����r)���T�G 䍼�IU1I�O�A�0�{_g���69�)��0j����
z��I%��;�����^��N͉�@V����/+�f��lʼ�^�Ԭ>�� �3�ep�x	�&�R��yA��cka��|��Y�����2F�x N�e�N6�M�)jW^r��FwB�֞U�4m���>��n�����r��?�A�d�OƵ<^��XC��

O�+u?�j鬪�U��+��`^M�TO���d�i�t�1�R�Ȩ�)&����;4�S뗃ME���tM�/傞xb�e��(�!%\�E���
�s�g&�*����n���W���qP�$9]<�Z6?4O�����+_����\G�zo0��
-m#�Nm���.��l���p^
6� �?��
-endstream
-endobj
-19995 0 obj <<
-/Type /FontDescriptor
-/FontName /SWADHT+CMR7
-/Flags 4
-/FontBBox [-27 -250 1122 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 79
-/XHeight 431
-/CharSet (/T/a/b/c/d/e/equal/f/five/four/g/i/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/plus/r/s/t/three/two/u/x/zero)
-/FontFile 19994 0 R
->> endobj
-19996 0 obj <<
-/Length1 1678
-/Length2 9808
-/Length3 0
-/Length 10897     
-/Filter /FlateDecode
->>
-stream
-xڍ�P
�-�wָ������F���-hp�'@<�-�[��n��	{df�����{�U�g���}��4uؤl V at y����)
�Q�pr�srr���邠N�?��t�@7w,�/����,���>�� `�������/�% ��	�����&
���� ���0�
�N������>{���h��`��:@�����,��@�g�֖N 
�5��/���P��0������;;��N��������@7O�
�w� uKg�����t�A��u �P/K7 �Y���ݟ/x�m�n�g� 
%U��
�'Y�O+�� �ع�6���߆@�?.[Z[C�],�> �
��hȫ�C��� K��o���;�����%�����G� y)-��s~e�n�r������~g����s���62gg ��;>Y�����>
��
���y��ml�`��¡�z �d�b<�P���� >NNN!n � ���m\�������9� ?�
��9` ������n�	@�<�~�V�7B��؀�� +�
����g1��O��y7�7���y� ��?�L�g�v����Gs9t��du�Y�H�o��4����#`���pq����m������RMK�_�q�cQ	l
���s�����_3��׺0�ۃ:�y�� ���'��������q��o�[������#���������t9����b��F�A����T�K��y8��V	j��R`;���r�y [...]
-Yu��J
��^ڐc��\�|�;h�EzӔ��|�o��=�Ռ:���o,�@���
��MWr����_?���]�.��CS3�ƫG����tq8bfKk��_�t�-N/�Up�]�Շib�P6rdf�So����I܏cO�ʉ,��q<~�k��Ӿ�_t��;HhI����p�����wӔ�f��
���E
(?b��/�a��rgV��c�
�U���m\�9��0�>��䪒|s7j
��f�<h�#�|��Vz��Z���!�lAh��	0-@�\��
�5�l(܁Γ�1_��d$�(�
-����-��=у��CvGO��a�e���"�E�t�k���%S*j�����q7�C婂X	����[�D�Q0���g�f��m1D���7��t�^�~@�ht\ݶl�1ئYF�p���D
]
0�]�!H7q�N�2�2GC::�Ó�3B:�ǿ�l�s��3J��4��)����f�K��&Ƣe�=�/�[�pd��P)���Gf":%Z/��셬����^2������/��=Rt��.=��G��#�}��C*6�߶l��?��K�����
_�:��I?8m+^f�
�附ˇT�Xh]�0Y��-��� I��
������Hc���x#T
��0�:烾��L�H��أ}��:{�!�vW�I�U��
FRU�(�%�Ⱦt�_��+�'[�|Ο�1���דC,�
�I�ͯ��I
-`�ܲ��1���I��P�4���譴�Ŭ�A�ցր
-��u
-~������ܹ��J���.�n��!`諪.��1�) ��
�{o�F�j���-�C5q�5&
fcGIX�2������9i�q%2z$�.���#��Ql����|�`h�:
� �D1|
(�,�s0{����$����L��]�E�b]�[�H�8m c���H* &�)� ��LֻӒ���̪kq|��"J�s����"콳���[Kkbo�2��edUit����
Ԙop�Ud��5�!i�-ַ����N�q$Y�Tw��g�W6
�)������R>M�;���qU�(9
����3�����!�1��� q��Qf�w�9
-�U�‡�g۟ {�6}��i�7zI|�KŎ�'��JH��|)(��?#�-��kmT+�ԉ�ZH��v�A�65{aG�d�B/F�0�=����7�~�t.6V
���z�K|�R�v�::o�dS
L��Ad����ȸT7N�U�r�m�Lnٌ�";\��0o&B� ���_+^�t/����"��UuP�>lhE6ً
ۻ��i-9�΃kDگ��=Qƴ]�+϶#N ��h��qzX�V�����+#�I��V.kr�,G��8e�R�6���>g��ٚ�\��
�=�+��:��
w�P/8�wP��,y[M�t�S7yd��qOO�=��8�������
�϶x~5�@�$�O�[�u�,���9�atb|�^��3~�F�z&b۬>����b�?���>��})hB�w����	?��oJH�Ё@�����d�]��t�~�s�JԚ
�zN���̀�콏?�7J?�#�z�#�: �.�dc)���dg��xM
'(U�
۶��ko^[i0��=ҵ�hP�ʀ����#�{��Jۇ��_8��X7ƗK_l��fdlm��t�}r��!Y4oDT(vp�����ɀ��˓�}z�>�d��`�AQQ^� 4Q������ϕ
$�Y�erg�� o��~*vc�e����_(���/E�<�(d�m��X)b *��_K���)z�N:ģR�_8��&��ijU���2)�P�/����ӹ��H��ゃI^F��F��a���M幈�`���s!� ����
�T�w?\��w���]}֋�Fb:�?-Z�.��8p�ke����O�D�������fJ��|�k��ZĨ_��y'�r��u����;���ej�ش�����EW�Rd��.&���c�J��"���l���B�U�N���0_Ƞ. ���1=c�0�;ѕq��L
���xH o)R�kԻսF�J��F��	�[z��
�9j
=�
�A�\������RdmD���PL�
��"��NL
�?!|������C+��D�����YK,�T�J��d�h���U�~k/��
�gA�5�����Lz��J���
k�zF���E.G}_�(f���d�@?����sX��߿#�X
��y;�Ʈ
��LTeE��;C3�66��`��s��P�V��jr��K�ݬ��,��[���
-�u��'�[\OM�W��+-`���cΫ��ռ
��

-_;lQa
-�y@B���C>�f�
�՜���2��>ox�1z
-�|]=�U�߭
'�
nhʪS����U}�
� ���+:ܽ�*d��]wp�] D��zy������)
4��9��H4+�y�B�
w4`s�؁�Ʀ�kƓE�Q=�
"�ЉuW��m��-p��*a�
&��%S��[�k��|��S�yw�g?�~��̈́���u
�䝑>{��I�
Z#셃#��`�Y�P���]�KY��r�P冥X�^�,�^�u�R��칉���
�}_�/{�4�䠎��b
-!y��{���C�?D]��^���A��B����8�"c�KKFp�a�~��ra���D�B('A'?��Q��"��]TR���<�0�bР"�[I�/=��f���4�+��H�g2�Bx;_�Tu�
����jZPfp�U��c��O����g.I��g�
����}Q�jnWm��W�uL�Y���C�H�ӟ�
�#�G��u��y���-�@�j���q��6�LI
-��C�!�Pq
sT�8� k*1}T
��J���,n�s� �[[y�i�n% �8P�V��s�(�?=�
�]6S�*���
-
T�|Y�Z�Ҡ�s@��f����)@@���?U8��jA�@�-�*��ۑ�s��AU�*�yP�a�"VH��|?[i�SF�Ǫ�\(��~L
{2v�8�߭Q
�c�i���!�jw����7@���Eqj!�L������.�H�ר~�:�0�.&�ҩo�![L��$����2�[�Ӌy*�
hu󜭲)I8#��7n�%&�W� G�M�Q�������lʰ���c����zx365G���e���@��D/>v��*!Kl�V�������9Tm��6
B(��Ė���hĄ�N�P�U=���6*�z���1�t��ML���V�2�ߊ�bQ�b�C}����d�+�
��<�ø����`T�_�zY

DRH
뷷��b]
�z���՛f0J�4�"
Ќ|9��Y�����ge��z	��u���졡��9�d�ur,ey�(Z2����f
��@&���z�p�
�+�
7�*%�ou�<#�EX\���Ĺ7�o��'�.��ܭ<�Q�����-=��>�bl?�w��ȶS.)J~l�h����\�
-A�w��E���!��� Ŗ�
L��
��G�%���/�Ͷ�ab}�~(s.h�n�X�2�X$��my at 6{�
-&�
e�����QṚ����tؿ�vU8
�'�"m� ���'x8��F�17�%��A���f:'����g
- T�Z�{�g����TL�M�>�,��ot<����Ĵ,�{
O��7Jk�:&2C��Zϻ���}�v��-
-���P�"
^�;�K�PTJ搝�^1�Z^D߃-L�0+�S2O�He]9_�UCs;
���v�����e���wF�hd:��BY��
5��pH1.O7֢�ߊ�$dǃ�.M+n�3�P��	3���$��k����Br7:�L��қ�����p�]�Y�tsR�GF
���L�4U�&�Is��v]��r~!x���=�kا�Vd��U՛�&zO�VR�jN(48���*s3.�&I� �R{KN��z�2
G�|�|թy�CsY,�N���QL�J�ڼx�fߤ1���g��U_��و�"�j]�#����w��Dl�^�_�+�,/O/�_�-D<�.SZf�3Gb�k���v�z�����/rΩMl���b:��W���*j� �$B�{�$E��	v "����%5�*�$�#W9�*5`�m����FP�?p\���wz��3@\~)gB�MN��+2ŔO�KW�h5x4��Ӄ�H5I7}e(�0�'y7��
���[mezި����7���?�Wo�R�j �^
5 [...]
't��z

p1�9��y�iJ"_͞LM.��0�
)�����G�� \��ko��k�d�+��|!)
���v�S1
ֲ-�6�r?��],Z����
��W��=����d�!	 ������D��M1�dk���q��P)�1}���
��/}��p��=l�������ޚ>Q�7}�k2
�jx���B9��*H�D,n��Ѐ�o�7ĥY8�0ɢ�^��"�Y�:��|�n�r�W��8cL�^*^�����[��8K$TO����j]�\3�5���c���慖�^ ��=J3^�
^S+���mm�Gɔ��}�3W��Q3�v�ő��|��x�VE��#2�o�~��Z�}{+��C����#-w���H��ps
�P�ؤ���3q�9�SJ�|
�^62_<��G���VTd%���F�R���;3D�G�����+kkL��2_�� M��k��0�
-N����	��K�b�Lm���
7�Q�+�pDL���ؙGu�h
l�Es޾�
�tv
œs�h����^�=}L$�-2����
ivG
-H���#T��P�af�T��c��[d�$�������k��V��g�.J)3��&g�p
�eV�U|�1�ѢRj�-""��Oʪ<}�k\}�k
ͽ0�V;"ZdY:6�
S��L~�"5Q�2�l��.]�<	AJ`{����a�K{�K�x����<B���ǡ��{�
�0W6yG����|�r��
W��KuZe�R�_`U�M?iW�o�$�u��F�
n��GaW�6�
�j���;ej�s\�QC�����/L�'�|e���4I�h4�̰o����X�+3׆0�k���
-�q�U�(XbS�Z� q��Րgl�k&����2�0Z��?��R�T5'����IFF.�i��t�2��V+r/E
�8�*�,����9vФ(�������8�Q�{�)]y��kR��S��v�
�
��2ŷ��Bͪ�wI�}��lq��Ҙn�
�����XIkڈVl�MijNRau�zNo9ϡ)S%V1��Wq�T�
t���

��,j����fQ�9���	#Ϗ"w�drŽ�;:i��
"KJ�ѵCiOL�ɟ�TeG�o"���Qe���8
RD(
o�ϴd1�
-������&F�_[R�P���Y��ĦF�$��$R���\i뫹����8����U|���,�݂��
ڑ�jA|6��{]� �ڲ`�}����^Ӏo�7�W4*�
�#����4<���o0
a���?���4�)�E��U��{0
��,o��|6h:�2/�=X'�� �$=Vkt⫞qӎV��Ty�+.���ǜI�	-N	���IT9�8�Z�]7��
r���C-l�O�0���?�?ԑ�
-�Q$:���5�4hAI7>��G����8�e���k�Rlˈ�掉 �[�d_�Mfw.�^#dv��
��T����~�C��L�����x�N�'A=”&ﳲd�W��,%�V�?������Y�[�7��]8��0�V���>r��ͯ	+�
��Kr>�g��x�}����+��5{8d�8\���Yi���v�8��>^�Ԣg�
��-dT�]�F�C:
]�Wck��/�*���M.�1�'�d�e��k ��x�&�l�:��_W�}�jO�M��3���d�$
����\�#m�ה6�����do����ɛ-��U���37]��J�d� K^N�
��^�{dܱ7w|`�"���
^/bR�Z7?��� ^G�L(�:���U�o(߭uʕ�@&��U��]ض�����r�[����G�j@)�͘�nM�wtV^�� ���k���Cg� �N�n��l�
X5�#"��BW��u�fJ���'���d�-O9刜.�jڵ���Qy2��2+�Ro�V�`� [...]
-�T�SֶRy��
=�L�����z>��snK_D*�5�eL
ƨB���ŋ{
��{W����jf���=����TwEw��wg�g|}T��	����Z�ٍ7���u��\���{���Unss1u/�8+R��~�äk�*~��,���q孮7�=����{�哑��h���?+�^4͗���Z[�_��8F��;b��u{$��?L�8
�'&�zK0��K��R��Yu�p��L���
-�o�)@�^ej�AX#g5��m�m]�c�MI����^
)���w��Ά��s�0ǰ���(Q-�Du
�,�# i�����VzC~�>Me!~)4Rjw�`R��+�2���uT��
.ݱj�{ԶK���{~�	�P/��D�p�ء�HJ�����V��:��C�*_DT�o\V,�Y
}J��G��V��&�Q�^��5�d�q����P���S�
-�
2c�I�{?�r���6P�.6�e�yr>ֆ#
i��	�fA�A
Uf�l3M�.�N)�t�FdO� �̑a#h&H
-��:q|F�Xb��(
��J����������}6��rH^
�nBH��b�>c�$�����o��=~2��B$�R!�.F�yAۓ�����m�P�	�2� �
-��|oY�)|n��u�lL?
-t�z�ьv1��-�īG��}#)~�J���0��bB��j,��_hUv[k�
�^\�ք���}M�2q�3����,ƾ���
�}�}�l{���#��w�Yn�&�
�i��
���7����k�/��	���[�$Rp_�G��/Z��	����
~�
fƠ���*�b/�`
ZUӕ2;+�K��N�+�Қ�
�혒�	|w���a��
��C�b�=5`�s��:.��2oi�SĴƧ0����>��˧��H�c���ɂcCl�6*鉫����w�z?�
-�Z�ks��l�JU�D�b~�v�
aϟY����8�x��-��I���?�h��ֹ��D�6	�k��h�3)���bX�u?&+-
��X�}yν1=f�bc#��!��ס��C0azM�0��/��꺶��v��	X>���tC�9���*�� �M��#v�=;M�I|V
�	�
ȭ�2����&�Ƅ��u�wf�*ag
-�AL�~E�
-�}�"�8�n��r��痚S�9J���Ȏ�X��S0�o.4񇌠ڮ��P��
-�͖D�`��F����\�[��8�bžh?6z`��U�8�7�u4�ڀ�f[�br�3k��Hq�i
-)^8\WZ�Ć����@�9Զ��
k�/�y�u�e�mX�~��5��V_P��f�[�{�E�
9N '�\��	; k��@��gHsL$�	��i
�!ն�e�q�VH�vgQ���~�I���;�5!ͫ
aB�!��!��4��X�\�O�œ�3w��PS��l4MQ2���
���=%x*�؀�����\y`H%
	��ύ��p�~��Hb��k��f5�cg�
R���D�s�P,��U9�܊��WF�:X��6
���i5��
�P�yL;آXJ�y9E-��S����
e5�O�\�G��i�ܛۆ�qߠ	l��w6�9�eFkqO<e�}>�DhQbv��t��eCV“��ѕ��f�V1�!����}5k�	k!YO+џ`�=
t�Çe�:U9����d�R�h.,�=X�'(��E?��5

-w�]�ԟ�c��kӵXN��VD�*k
n�%F��b9[g�=lפ�D���r}5�I]#���kW8I�k>>��̓U�{���
�U\X�����-A|�@jox�Ko
������v���`���|�����T��C��_jN�
c
%5}�K��s����抔x����

T _㭉�t��9�0�K=�8��\Ik�yq���f�
`��=�.��ezK)[����r+_?A�p�%(-i��
:O��mg
�,�O�м��nP ���X�~��LKTTa~t�����n.ǩ7]���������������#�{@韆�n�	g�yW�ć��Jw�wlF !��ڸE�Av��"_
i
Qb�r&<��7V���&�2�\���#v��U	�u�S����z0�
^*o�y��aQ�*Q�7�)\���\L
��V��.8��6Ÿ
��6���Rإ'���<����Mfk�o�d��r�J��o��v�7��z�M�
z�;5z1,����[�4�ɓ�2�B�O�
|ٸl�'H>�pƝ5��Y_��C��|Txɒ}����K͸sF]�d�%��Q7�L�2�٫�~ew'�ܡz�����W��5���`L6�4L��>���t�}�Q���I at 4|)TB��&(d0E*��et֧A�`׊��e釒7�t˵Q�)"�=�IV�Y�g
?�b���Kd��͛
-�
���T�8^�0R�f�d��
p���͎P�j�<
m�l;�3	��EZW�

-��B�|
!�x�jG2q9&y��
�|�4��%4*���*<�_��%l�<��%-���#ӶM{�9�%�~G����~�����'N��r�����>;6�b�E����BUyr��%9FV�x��g�'*d����Y��fK�G���3��,f2m��z�q���G��'�(����uꗅJ�t���"�
)��2b���߀��VA�Zr at Lˋ,��2;+[̰���lКϏ�~�?���΂��]��W�wtI������*��SU^�����{��[��s�ռ�T�]^�j��_A�I&[�z�
xLh#5��4<[q8��:���,W��%����� �S��S�f�9=e%�ye�1�&��f��do� �3dtq�d�iy��]4فl駫I���n�s���S�ѿ�6>ob���O��xe�ē�����՜S�L�(�^�|�*�4�O[�5"SX
��~�!�����+�i*�";��ea�h	�wL^�|�#5Zw�C��4�����ۑe�
-�t��|��e/:,���&f5
-�aY��|����c�p=�X.,;�K�E�v�
YDJS2�����;Fk��L�Ԉl���~!�Aa�/+����?qy\J�4♿�(+�5�

-�"���(�أ׻�I�c/f󂑿;��ew�)�`�=��
9J�~���ʺQ�?ޜ�yj�I�]�v,�g�Ƽm��7K����SĿh�Qjq�n��-R�g��۽S�_�l��
9%�E��X+��:3nTF=O�u�ȇ)o�?�GX��1(
_r
M���C�9]�����A�R?��i��ȑ�՚|�}y�k����GV�z*��컈[b��	�o��u����2���<�H��O�j�u�M�������r���1=n�B���5�0\�^'�i�Y:��؍���{�r
�w
-��
�}��l���Y��N
�hkQ

����0��x���s��笰�QX���-�0./� 
"���<Z\�f�n9���ٛ�mm���kA�y��,�S2�,�zKR��`�[?]wT
���@��
$v��C��K�$~u8� u��B��o at K3g���)Ig[l	$�}��m�1���<I=?�N[�m�n[�;���;	�񄁖��0�_��[�\�弲���i�?���9o��۫D<�o�T�ļZ�LU�I��g�!�{y	�_�`:�"d�����猰_Z=��
-X~��u�G�K
�>
o���U�{0�4{���
)?��H�
��s��]��Ry���X�n.VP
]� Š�0�ԡ�Yi��R��Ee�+����V�n��q�h�@<2B��� �6.�
-endstream
-endobj
-19997 0 obj <<
-/Type /FontDescriptor
-/FontName /SRQDSN+CMR9
-/Flags 4
-/FontBBox [-39 -250 1036 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 74
-/XHeight 431
-/CharSet (/a/bracketleft/d/equal/fi/h/l/m/o/one/parenleft/parenright/r/s/t/two/u/v/zero)
-/FontFile 19996 0 R
->> endobj
-19998 0 obj <<
-/Length1 2493
-/Length2 13753
-/Length3 0
-/Length 15228     
-/Filter /FlateDecode
->>
-stream
-xڍ�T\.����
Cw
H�tw7C
0C�t�t#�ݝ"!� %�)!��~���w���]��g�>�>g��RU�U�l�;BY9�8 �Jz�
 n6.4ZZM[(�_
�V��;
-��B�h�ao͠0C%�#@���p�
-p�	pp �88��kv �5s��(����@�$������
-���_
� N~~>�?��@[
3G���� �hah�-l�P��`��B��������
 l`kF��-��� ]܀���-��
��ƆF
��G������ 0 dkt��\\
-�. Xv���"@�	��c��� �
����pz�d��������������`e
T�٠
P����oC3
�7s3����
�(�
 -�0�u�g
['(�
b
��#��0�1K9ZJ�

��P����ں -`s�d��p�
������l
-�~�a��Į�h��
-�{��

B��B<
���<� �3 �aa��;�����0�_o'��
-����
-���
1s�.�@_�*�-�qr,m-� s���#���a0��?2��]l= 
0�q8~����a�`G����
1������
�-���� { �Y�����
 NNN^ ���q�����U5����D�s����lz�m��Of0��6��gP��
0�MC

�7���%���������_���I��@��c���
lA�Z���
-���!��k���B+-m]
�W+5�툸�5�笜��8^���H�z -Um�6����d�TCl�;0/����V��
v�@`G��
-۬�r� [�^A.
^�����'�0���	�UK����9��0 �G_��������%~C��� �I|�0��-q�e��`~�K� v���7
 vտ%X��%X��%n ���,��_'l��f���.f�@��m���矺�P��װ�A��-�A��z�����.�|j
�.0F�A����S�?
0�-�
�_��+��%�9�*�
����7�� 6�����1�?���](��. �`��/�q[GW�?�������N0��5��j�@�p��
V����� �� �]m��@@G��s���=la�;Bma��W-��V 0��_-������#.XGֿ_R�
,�?�����:®s[��E�s�a���{Y�
-�[���Q��}��~��*
�3'�s���`����qr��9ž0��C�F��|b����;�Nl	{07�wz^�?T�v�����9~���T�u�< ���?�6g���
-��������
���u���K uuq�@a����
ք��?����'��p�
���w�����v�puq�M�g���?>- �
@
��y��`�]}p�m�8�;��'����x��p
(�B���"r�̌���e�x��bY��)���a_V�j�l.NjhS�5��E�5��Lb��/5b�$A�
�� р>Ig�!���{��G�c7dG�� � (�ƢL!�ƈ�t�G�QҬC��
�bq\
�\5�>?�G���HtF���4�M���c��P*�y��@
oU(.1��<e�x�1~B�|
�N��Z�,9����!�n��o�~�`�#a�۵�ZY2���D�k�g^8�����V��Ovt�����T	�K�뱴�nP� "9 ��{�Ii\Rz����
���m�c���4&#���(Y�f��	^U�Ӹ���P2 ��WUA��n�u�����Ðm�.E���n��α��S0�1�L@�nW���~B�
��lm&)^h���DŽ1.'n�_=7Q��[FP_�q�*N�3_{ASq.MUO D��,��qY�r%�D�p`�p�w
~+S��ު
�a�m�P����8��唝
�X!�[�ƴD�^
�:޶� �aWBo&�o~5W◖�	n��a�U�}���e�I��xC�>(�}ό��ɇ	�.���Wi�S�]��;
�Mw׈���c2#T�E���8�v�o��Z�f����(.�V͗?_r���
-p2�mR>q�/w�x
���_
��ެRzG���2\��-��
t���@�yG68�f�-���2A��MTk$vÝ������o��u���G�,n���ܻ�r�ή����S
�Sw�w�c��L�6P�
)\��Z�Eh+v�^��D���ԩ�#צ	Wۋ��2�l�7'��
1��>}O�+�O���NG��L=C��y�Qz[�,��=���4�����"6��
g5�t��Yq�g_�0����h��%����
8���3Q���E��
H��j8�q���z��r��-�/�%�
-�*�3��r/��g��w��Ա�@gu�{&��F\��ˡL%��/��}6���|͸��KA��o<+I�
g���:��U�
��ګS��%����
�+n�9����
�)�g�	�a	
�,��6���ٜ�A8�~��M]2y�1K�
1Ƭ�	K��xf�=A��hG\�V���!�})��RnT�˞��;��>�<r4�PcLKU���[a���$���'����#�C�����m��䭊�*�b�A�I8B�����W���X�i�l�J�D/Dד�����0�WT9!��2�Ib�ʉ<Ƨ����
o��C$�j�aAm*����
|�?fh1BP�e^�%�{}�������2�~k��Rh��;=}C"y|���wx)�eE/yṺQk2R=[-fdA�&�Α�ϙ>���3����*„G�*�� ��_A,�T�RQ��?�ῤ3a�8#,S"
�ܵL.���;�hZ袷/΍�߀��Z mt��}��ƌ��ۃ���/��+����	�4���v�\��4"��y��y%��W
-�
W�57Q����>wR�Lߔ��#}b����

˝Ma�z�a�����l��qte�q���w9�rY ܉
-�g��i �ma]�� pk�R{ykr$�Ǭ,��rWt��%�ѹ94��f�ś���oR���7���0FP=�Ts�A�'�is���,j�O���r[$��
K�$���$H�vta�dG|ę5%p�
lT�-��KFR��6���ȝr�.�o�x���.͏�6���/��]�Rԋ�E���=��m�/?r���h�b}ÖzH���t�� ,P�x��r)�b���3o	�22SQ��K���ˋ�
ƴ+d�
�
=��O
E����pM�&�MY��9p��
I�/�>�M]�A5JG
1-E����#�2��
��+�4��
I/
-�J�6���7�
 ��1,�}6�Z���x<t����8�g?
��&V�nǯ
-�����I�[v��9a��/�%|/�d��~	!Qi�`��Ꚍ� ��� 
�]R�l�sS>ޡ���}Y|�~���c�ę/N����g��a�M{�l-R����`E����kr$|/C�M_�z<TW	P��C4�\zB�����y�kFq@?ا-��3��׬�?�9����#I�5�Z/�G��*Q�>�/��o�o�낂��&e�
�4< �Jd!�L�y@`Y\�Uq7���r��,'#Ji�-U���I 
�⯀ƊmQ�

����7�C>=E"�Ov��1M�#?R׉�K&�%Lj.N{�3��{=���
�\�g���'
��>/�1
��G�|������h
)\�z�巳�� }�e6笝�?{9 �	z�x����
pӬ����<����ZC�
r��bD��D3I�P�Z���cS��$�Eh~!H�zYSN�3} ���>���ª|p��S��Mܐ������,&Nc\�@������������~��
n
��@f��F�x�lTŦ�
e&�j-���I��z��b�ǐ�!��<�l�Aq�f>U3��xU��W|mɩ�[`_Q1i�Ϳ� �ԑË�\��l��9�%���LGm��+x�H��mQ�����*��1���
q�:b� ���,�-�ԗ�D'�i��ҫ��4��Y�IG>���3V�AL5���W�;"#�L�Vɬ�?���'ҙ%�	2�y�wp��2N-�'Z�*0��*�ïh7�{-�_L��-3�:
_~�0���
{ =~Eqr
C���|���m�A� D(�k+W?�ުV؝O&\
-5�O
���i��}g� ߛ���
��~
��]H�Y	y���v����;�Z�>a�
-.
l��@�̫���')5M�������إKIIG��9
-R��Y���lT�܁/mH�{0T����
�Ώ����b�u)O&���3��%j�{=�ڗ~4��R��v�hQF����lo��5&�<�7E��ֳ=
��%�w�2�K+pֻ��?��cR���N�nB�$+��:�V�"��Zy�2�1��{����U�Ka�A·>7��/;���c/{�=ndh�rI���?���M��x�RJ��s�����u	��DU}V���(�ƻ�ِ�wܑ#�ߴ3�--Eex�[�v�
(��9��|� �K��!x6&6	"��y��і�ݽ�~�Şp.Ṑ�m��+��{���Ү!���x�rc�`8��
��^\�(��P�ӿY��Ǔ^ʒcI`
Rz�
])�q,�H���
��]˨����Pa�M7�4�Q-���R9�{
��w�B�~����t�� ~'J�n����-�b�L�Ɠ��i"�C��z�q
/�uE��D��
�V�
y�e�N��Lh�� B��i7�{�}�'�-x#��+��E��f?z�[���[��w/�H��,��NJ�����ӱ�h��wlH�Y�^�4��4F�j�O-�Z��j�:$uR���/�S�(@j5yIj?�#��K�ٝ.�5]��Lr~�h�kN
;��� W�
�S��B�7����\OR�����-��g�ƃ�g�L�κ�4�9�C�H����QD˸
�s�?[]��
%�o�zR3l֘�.{��b�Pv��g�s�A�<�.�v$*�+�\�N��N
����*
-�b�>����
�|\�ݷ�`�2�.'I�؟{5Gˤ�+�j�$}�(GP���z��Q�.�ZN<��\il��p�4�H��fC�0�݉����W�	Evc�
C�]fQ�
%�v���`t�a7�暱ɵmne�fE}H�����w���s�jN3kvUY�VTj��֭*U��dh(sE�^7�W���!��֒�4C�Q��
���AO�5>dZ}u,h:���C|
-EV��:o]O�̜3�i�CvĻ�=hD�Xo:��-�F��K��ۥsmQ�sd���6<�UZi����a�0���|�EU�?�F�VD�1���w�(��^�3V�;�B�)�������R������hL}�Q�0���
K�ao(s�[�]�]�����������{.�Vt���fW�E�bʔ΍~
-�
�a�Qć`�=��|
,A��Q��Ǧ�.'(�K�Y`{�!8D��2ڪJ�֍���1���7��;%���pM(�f��$B��1zt�Tܥ.D�|;T��p����f1w�b �AP�j
�	�*�%�`�z�b:�\�ŕ�j�A��FrJ�[���Õ�_�h�|P{�4�[-���%�W��`b��يiჀ3���Q�X�h}��r���W��oT�;���?�i���xYs%vQKeU�_d�$0�z�l�sg{l0	Y37Z��A��zC
i�g�&.,5�Χ6��'�/��L��⛜�}��$%��5;BhI�� ��s���Q�Ѥѐ��Q��bI�[�تSTu�n©4���
��_�;���U�������!�J���
���:���M\����
-��a�eC���e;��b�Y���s�f�T��
->�j
-��
>n���
�J���{�8����q��cǜ�M‚�_��Y��(Oq8
��R�MUd���UNzG@��~1
ICKe�bÎK����{�
-�H��Ν}QAY��n
}P�1Y1A&~��VI����E���
-d�+L�e:5)�Y�4�^7���Y���Ty
	%�2�����y�C[6{��3����X�"K7�(=�P$���_�`'�˽t�t�A�l>iQ0��A;UL���*��>�$����ɡ%���KA	c�8��$�=L/��\
;hZ��1��rMT���L��Q������㫱m+5 ��.������6=#�:��B0�,6?�A}��د0������2̌�u}�_^k�9�.�X>�W��X!�R�\��
:��i�
)(tΐ���|sz�\I[���i��^n�K�_�*ŷ��5u;�|�

k�xjϷ+-
�*i�qy
?��;2j�?�i�
���������_��DM�,�h�R�1�s	��x
��I+`on�->�tdS�M�w�(΁eu�F�UG'aR�����fL�t뫻�vv��\ ��V�gMu+�}�d*B�#�Ra�;bj��x{����/~�:+�aA'*�_cV
l��2��9���HT��g�8c(%N�iޭk�r���)
-�����x�_�4��T�ݓOK*^\$�x���~�.&
�n]�|N��G�%�$�)ԧY�s��=�-�r�����<��I >�J&U��.f�)�3���1'�j��@��i�W�iI�T���y�O%�hT����|�W�^���
-2q_�U&�����U�v�x�����A4���=rcLqn�Jԑ
�L���W�\��^�y�mk��ލs,}�3���|f����9q��Y�b?Ǔj�.~h�0"�
/��SG��4|K�.�f�S���S���
��R�
��N9�0�+Q�yĵ�>+
�r���j����庵o��	�U��
���>��
-�=Gc
�@����D�s��-*qm�*�w\X����
wP(�ՆP.�%��6:5
;r2��A���^�muir�s�R
����#�\J�^��!���z��@cP����dG���N�#��K��TD\M�hiR�D�[���ZH��9=	
-^][�U��
�p�z���Z
N���5 ���
ٍk�݆-����2^~d����
��>2�&P�k[X��ˈ� o1���P`�Dk�k�Ud�3|�cf��N{^����t�k&��v6��
;��ztk_?��
�
���#Jo���x��"��8&�&
�̞%�0���ndakTf�C�aQ� �'��4p�P��-��=p�gEf�r%U�&�[���9�o�t�*��v��
(E�$�Vm��QE�|L�7W	
I���->L�8�d������C�8�o���w�*s3�N	^E^�e���O[>.�	936�֗��-�~5-����f�Y?�����8���r_�r�D�7�lj��7yesI�,?_�
�0t���&����"���%t�wJp+Q㷭���܈B�!�������X�6Ϩ�?�z�N
�0���ŗ^V~p
�mM
�
-a� k��[x��.��M���|����V�y��:�&�S/����5�rY.���a�8c(m�H����e�Pǜ-p��8�i��_��f�M֝ws�=_����d�E�;��]�%:F��Xa���B�-S�7b����t�Ľ�pxw~E\%!�>���-�Mp�Z1=�w�g���\�U�m��[UyAԝ�xf��PVH�D
�Cm�M��
!Pِ��{�|�]x����Bty��@
Æ�\�e�;ښ�7�����Zt�z�7�YMr����4����d>�˕
�hinf�7���g���d��˩Wt��h\Tw�����K<.S,(.7Xx�󏕀���
����[+VfО�����I+�H���ǿXa�;&ʖ8>ﱏ��r�uu`� �pR���w KB� Fr=*�� q��&fO����9E7�k�Q�4��u�Z9��g�A
�4E�t�P��{ui� A�xsx<QL�=o�U*
0w`p�����2
�����B춪�ڕ���Ec��Zp��Kn��mZ }y��,����Qp�["u #��;�0����GwB�	
y�����B����1���^��R�d�/_�l\:.�=N�,o�0�����ha+zp5����
�@d��M�GY�L�^y;8g�azi0cYS�c��Zt�-ָG��
_\g�Hf��
bk�;̈́�ئE��
c2���C�iB� ���xM���/���
�,nЍj��S�A�z/���Α$`5�5�9&�O"����d��Y�K"��SDxT���ș�E�V��ɽ��FfK.v��\������m_�s��G�{�k �vt��I��h�'�h$������-��P_E�����g���)�9,6�a�y�j��3�g�gj������'�;���d�Wc6PR�z�d3;OQ�+�����F1���EP
�5M]�[p��!�\I߱vx�2�U�FĠ���A}^�@ܾ7��p��Ip��z���i��
y6_��q��آD���
 F+����iv�<��q�G�1�>�dH*��su�t��P��wޭױ]
��sZ�ד���`m{ͥ+��%�u
�����u�z�–Τ�@�0�T�<3��pw>`jͫ|�:qؤI/�!ol�Q/a�m�t�ݗg���,<�.1g��[�s�G��-%4Q�\�z(d�>�T��ұ���l;�
o�K�%�<����ũA<U&��,��~�P�x;��P�c=�j�8/
�z�c�&���
������ݧ�Y�����1'��JMm����rȁC[�N�oC���2��<�
yWj�op�n���rk��I)^;��JP�鈺<�u>Nd�4����N�y�8�9�}˦�^��4sb���
B�B��V��[x�d�5�1L�^���!E��sn�oW{*�Ȱ��[�^�1}�r��t
�kq8 ���T���0��>��^��V������]�t_lS���&�K:�\@h�o>���������r�4ʡҲ�N�8p�<�2
�w��0�Q�IB�I����_s
��kr|l}��VD����
E%�I����`LΡ�L��Z�V���|�vw�vS�z=v���։W�O�Iu����/Q��>�ob2�ë��bQ+�ЎPW���&�X��/���}W#��Υ-Z����dï3ٍ��>{Ge��p��L�W�,y.��
�\�jN�G`ݸ�!�"�G3��Oj5���8�.��IƎ��wԴ�S���G��mn��{^��*r��=�
�w�>����

�8�ޘ;?�^���i�	9n-�~�
���[
i���ڡ|�
-��ӣ>�v�%^�����
K4�0��B?lL
(��|��Y
A�4�~�����fA�ɍ�m�>�(�2`���:�B\��%B��U�Ԯ����œ���*ˏ�+��W�^�j�"�.���TR٩���!V�*AI�г~
���q��C��M��/RkaWH3HZ���-F>�J7δ
�t�˒O�9l�$B!)r���/f��
�
���2~c�P��9�� .�)��w=��#�� ���S0���g�q76%�߰V��ү�&���i3�z��=�Q����lGj_�ݰ~���r�0�=�"׃E �s��D�j���lmTf���pL�?cٯ3���V�~�fs�
(�!��I��~e�
/"]�5�\��"�ٴMFI��㷇m��11�0u
-4W�;������Vܧ6�5���b������SL���;���Y�#�u5���EN_G���ͭ���0E"��S'�J~b�gӿ?1l�w+!�/:E.6���K��VI�ae���
��e���ê�u�
���6L�41��X
��A��$��
��م���n�F���"�#Q��5td.����S6.�
�([!�C�l�T
J��Q��	���"~���"
D!����r�^镏�!��:.,SٓV׬:<vʈ���+�`��|�J�F�	H��u�.P�}�-���e�+!k˼�V�;G�ʢ�BO��W�����ܝ<�؛�?a��s�4O-�f��#�Ҭ�b#'�p��H�>/�����I2��`�
2�;L䂏�k�!Zq�n�������ܫg)L�4xiiSw��w��9��O�#T�z�m���
~�2���M�߷�x���=g��[���h���~{Qe��c��݀�[��3��6"�5p�JzX�+�@�|��k
#G��
я�Ðv���O
�

�p�e�ە
<L
E�xW��ݵ������5�>zT��
-hQ31��GT�#M�a��m��U!p�A?rE��
@���
K���"6p��"�t����^�˳
dy��bole�q
F�K}�WO���<�p1*c�Xčitk��ES����

�J
w���ǁܝ=�����E
-&&αJ/��(��˟iy���|#Gx��	� wPK4���#x
C?��Mz#O�7P�7<D*xPI�h/�
c�VR<g���EU�_�
e5[�}�F
�
��v��-?:}��P�丬����"d��vۍ>��°�w��o�T������>K4@Â��w��R��S�?�x�x�]�˴�N)��R� ���8������I�
I�z��ll���2�](v�Jn�ZY}�gG)��
�Ek�=���e����p@�-���G��v�v�K���
�!6���'$YpT��U1
�c;�t[��+��W+4
nqt��[�<�%\1��!R�mP"�*�H��FD
�ϵ�������<�^��A�2��B�eU��!y)�2���;�&�����U���[Hc`�
!}��OL����-Y�!}�a���癱�%N�p�]3��&�c�|nTK\�/��s;�
�e��d�f"�N0�I��7H���#�D(��!��:�%,j��w
�Cr6�I�ñ'C.Ir���d�c8_U
-�0�h9W
�<��O˳�1x����
�	�j�W�(~��?�V��"�-Ω6w��:e� >�vcX�"�ޓ�*�B��}�&���}�}G|�ZS�u�ÄoI�Y�
�9�8V����dGrCy�N�O��aG�lCi#�fy�e�D/|�.D^��@^'�%��-J�2:��xd�'�B5�|�a�v���W�󵇎ۙ5W�2=s�y~��"���!�[�Ʊ���Ǐ
�-Q�D���w�"�W[�q�^ȝ�����LMB�H�f�GG<Α�"'��h����e h����\�i��j
-7>v��Vk0j���
W=�L�&$�PB���ڌ��Q�-��U$#�G4>%
����
�̣���Bs����A�N�N-y��)�	���r
���?Y����o��0����\
�R�4��VJ���\�[�
F�+���a�.�c�O�.�کm�!�-4)��/̐O�Xo������+O1>
/+!�y���&ѡ�)�4`�7���;9�ǮS�)ַxې ǝ����D�-�X�#�Ut�$�J��q�b���:3c
�ڻC'F����m�Dnn�1a9K�
������B�s�~�¨��~�R�����圞6������;;�S9�P���`�_
��R�>��%HDU����~{ ΃� �;Q�͒}Lw�Y����j��Ӿ����b^6f#����Z�4��#���2
-��H� ����\�f���[�a�������HS�ZW�"{�oV"΂��m
GF���w�
�Z>��E-cc1������~��=xz�u
-�
�1"v��]*��x�=���
-�ȹWn��bR�w���ϕ�l(}��E�<����$k��Y_�^���fr*��yc��������m�
���E9r7�۽�2XQcI*՗�
P#�����@�uI^���f��Ca�s�㩯����R��Rw/�=��T���A�Z�e�6M~�O�Q��3v�CxV���f�l��v _�+Uc;W`�M�WKo�W֔H�h~�5_���R�9�M�F3	E͂���H
������%�W�+���9BY�
2���k�;�����xʭ8�x���V�_��565=�̵�9���	h�1��P*�r�:NL�
ԕ�Ƅ���H�x��	�}�2IT�)�Dyf�uS�4>h��`���.Vs�[3R\Ŭ�1f�H�.PEF�
�غ��d
��	����B��TsN(�U����Ny7�JC&4l�ҧ_$�a�ﮯ��0r�q�:���d��D�U��z�0�
%��w2��Y:�<���K=햲�������34䉈pQI6}��%f�^�ˑ�J
�F��z��>��<�]
j���g� ����T�<�I/2i�[���wŘ�=ʐ��`��B�R˥��<K�
-g�;��X9���]�tF
-��E����%�h
_Uu9g5�*A�I��<�vAR�Z��!�o���A�J
��/����x!��O������zr/�9Ҟ�|t������o�K���[���۬�G��2�N+�G
�ݥ�㨺��__�&&
p��^��3ܾ�L����9Ri�
-���Hy�	S=c����H/U����h��#̝3����3�g��!i�7V��(��Ŗ�|��₏�έ&�:�Wk�κ7�Q��Γ��>1��;�B��nI�$U����!�YL��)��M8C�m٫S��
��ʇ���^�
s�/��
l�Χ9x���
-���?
�&r흴~
���:KU��_�eu[�#���
-�
7�$���lEY,ȟO,��:N������
�d|����2��
��D����9���/��E2/��ZM1�2�ݥ*i�.e�Q���c8�X���u�̈��mK �0�����э���
��KX!�
�j9y�N�.�'��3��/��{�
O��h��&R��g߼�h��.�a�ȕ��LQә�o >��#�{d�4���f%���fW���������:_�TH����8����5���"�q�-�vN;�0'����|�ߛ-��ehF�j��y�5w�a��UŲ
>�$m���[�8���@�@��\�@��bD`L�7�t�k`���i>
Rۓ�+��9��(�q˒� �v1S$7/W�&X��M��C�f��cou���{_^~�,�
����l{�vz��k�;H5��ް�&���=�ȁ1���Č�ͪ�@�\��\|����!���r�v�����'���3#6�����Ju��w�=M}Ɨ��!�D�L��8��sQ�J>
IQ|�;��ڡ�7
7��o�xK��z��kQ�ik���LR������%�����\Z7v��9�bt��1Q�%DD�Q�2۱܏修�Q�*���_|��əxi8�\�����5�����k�F�
�Ĝ�JS��E{{+=e�.�3�\
�MO���3�gF��TBs�^4�ܭ���D�i�vI���2V�˸�q
-���p�G�ܞ�MdU$#6���t#2�fP

̡/Z�r��&J逻��#Ln���*.%�D;vcYM}��
"^�k-����
�5BJ
-0n
[�z�������M�?*�w!@�
ex�5��7�#�|Z{�

Ml��ҏn��v]���O>T���_�\�i���d�Y��
s�׸O97�1q�߷{
Z��
�O�E���G���ؗ�)��hzf��d��ba����X�n
��*��n��7|��)Ļ�B��l�#�J��fpuaT��PB5z�M�v~�
�~�����x�|��?�_R��І
[�'���R��っ�8N�iN�-�x��f������+�G͹/;�2�o�9T��+~(��5r��
f�{%m>{��[��N\�-6�,^x����{,=I�
B�(����<��o���1ZX(�
-��.JS�w����<�Y_�z1#X1��P�$���Fy,JY.`mHKW�+��!�c'�AB�p^P]�k/�|��#)K4�Rʿ���
2
���!���Z?��3���w(�D��Ůϭ
�:
H�R 
�RHB��K��P���(䧄�O6Z�&�I��'um��J�������j
��t�fx�w�q�1vD�?Ɍ1���I
��d���v��E�_��X}יu
1Z�������I�f�u���*st�Ҝ�-�Z�b���~����CdT��#-�K���]��2��g~�O<����
-���3N�£�{�Kx	���5񢹮�7��צ�G��3e��Xd�#��1��?zr�M
-��
1
�)���Rʬاj�Ez)�Yg�hf]�����j6Mc���X�t�q��i����	��:*JQ���3�
��*�'yF��3������
�+�
31/�ž��w��d^��@���-ہ3�|%�Λ2�

�� ���G�GnX��\-l
�q��%�f�E�7rz�
��S��J&��:�Yv
6��R�O`��S��X�ů��CV�=J��)5۰�z|O���7�)�2i'h"D\ip�#O���y��x�a��J?b�Q.�_*nO-@�7��0=kQ5�$
rq��ր��{��L�S�*�k�Ks�_U��ݘ�H�%�G�R�7\N��i��
	K��.Ow?����愩��j+�x���R���.~m���L� ��@4>ւa/��ޣ�*�'97�
-
����h���t�Сfɓ�a2�U��^"JP'�D��:ѹ���A�֋�����х�!'�U���KD'E'g��g�Ms�Ɲ��B
-�#��
��.�3�B�	��H�G�C��8�/����1��6�:=��W��.�µ���Rf��MLo���W$D}��u���4�)�LX
-#��OƒQW�
�3�ۆ��������D�$���ȅ����	�;��w"i�����h4��(^�#�x����/i�s���ܶ�g�G	SR���U�~ㄟyv=�O(�;�e�1��V���N�q'Q���ҳ��[1��]
�	�1Q��w�TEj�@A��>�����~�S�$��#Z�+=�C��/�
�^��*`e)!�i-ά��	�m��ڒv�n�:
_YYmy
��8���
b�ɫ])դ
`{m?�N�L
���E#���t\Z��λ��ٯ�i�ͤms���U����g��r��|i��
��t1
d� �����z�gvV��-U@�G�KY��!���x<�B�y���L�
�<�����Z)t��<���7Q�N��od�L���I㌄]>~+s�f���Λ���xT�9I��Lko��jG�;t]p�wJ��,�d����\�����.�:'�ǟA�D�kTk��0CZ<<�E3P��l/�
�&>�����ec��G��
��ș&��
�l��'�V|�Un���~Z�e{�|܉1�ث¸�%��0us@�lD"K]�C����<A&Vd}����J�ӯ�1�c�(E$$m(�X���|���b�~R �
�Z��
-Rr��9�[g5���
���Y�@7Q�[‹�m�K��b<%�����>s{N��遍��T���m] ;~�p�I]0Q�ڳ,/��C�z^�i�_=J
{��-qnZ
��n�~;<G��o��ƌ��
�Cl�l���������&<��NB���q�RE�o�tH���/�:r!Ԃq��U�~&�OTq[��J����ֈ�O�._���z�|GKN6U�"�g�C�2W2��Zz�l����
8
-endstream
-endobj
-19999 0 obj <<
-/Type /FontDescriptor
-/FontName /GXJSMI+CMSY10
-/Flags 4
-/FontBBox [-29 -960 1116 775]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 40
-/XHeight 431
-/CharSet (/B/C/G/H/L/O/P/Q/R/S/V/angbracketleft/angbracketright/arrowdblleft/arrowdblright/arrownortheast/arrowright/asteriskmath/backslash/bar/braceleft/braceright/circledivide/circleminus/circlemultiply/circleplus/element/equivalence/existential/floorleft/floorright/greaterequal/infinity/intersection/lessequal/logicaland/mapsto/minus/multiply/nabla/negationslash/periodcentered/perpendicular/plusminus/propersubset/reflexsubset/reflexsuperset/similar/turnstileleft/union/unionmulti/universal)
-/FontFile 19998 0 R
->> endobj
-20000 0 obj <<
-/Length1 1436
-/Length2 6211
-/Length3 0
-/Length 7187      
-/Filter /FlateDecode
->>
-stream
-xڍvT�[�6(H���<H8t�4H!]#3�30
ݥ��H)ҝ�tJ�t
-Hw)�4�7�9�����k����f�}�y�}��v�>�<���D�yx�%E-}��_���_���� �v����Pnp$B�9(�`4S��1~ZH�����b���� ?��ߎH�$��C-^@
����+"]�Qp;{4��ߏ �
  !!�
�;�PpЂ��aΘ�6'@i������S�
�v�������8��"Qv��@�'
m���`(�EІ8��0�%d
��np}�-����	nC�a"�P
-���4
⏳���� ��I�W�Dp��`��
����#� [�
�Q��E{�A ��qrCb�!
����w�@E^�`�E��wA����~Q�������"���@���O	���`�ݛ���:"��߿�p��	��
�C��
���
"����~	QQaQ �
-��l��~�7�v��6
-��1
�}]�.�-��n
����A<` ����߆� (�
<�����d��0�?k���^�?F{ ����,0�"N����>_>�����{�Ǧ���| 
	aa@@XX
� ����?����C����OB5�-��C�w���K�M
��
-�H��a �?�7���|	���w��M��������
��;9�6s���f�3���/���ј��Bbf�߮F�?����ݝ�۪��`�C
a�Q8��0/��
���A�p���
�}�Np
�t���p0Q���e�
��#�Rq�
�o
3S�����AB
���( A� ބ��	�� ��)�¼~���E ј ���E�
+?��
G���B���������(�3�N0[�o˿��qG�0#�[,��^��`0/�
��$�F*̡:��R���gm���RKd�IW��c*��^�ꨫ�5������#�~
�_N���Ӄ�d����V�y^8��n�
E��
��D�P|M�e"�6�1��h4y.�!�Q�����m�Tbp��Y��O�3Zv�E���-��L��co��R�
�
��
�=Qh��;�^1�M뛛�M��J:���-{LIG�Β��Y
uB��;7,�cŢ��;tyΏ9�[��_�ew7&����i+��uC�{S�x/��9�ٮ_
�&k��ľ��"h�
�dH�/�N'��U�y��
-h_���a�T�)
��&f����-��N����5"1�O��n��i��hw�ns�����d
"�ՅD�����W
-	��
�������[u�HϤi�6;F�n��
1[�A!
DŽ�:ר�@�6����Ĩ���3
�n����#�=V˱_e�/�������-هl�_N4<|a02�
.�=g���M;%W���k���\Fl�j����ɡMP�W������.T^�BYn:��
��'}?�~�����F�.i����^_Pm�b�K�붲hPw�qb���i�n���
���QU��L�S�
����˛�b�	fImn�U�m�
?���4�������:~����X%��m:����oat2����Ff:W��E-�z?)�,���ԡ�l��R8j�� 
���y����6�)��3�3�_�ƫ�tE����(���F�z�C�ѼbLY~bcO���`�է�?��$z{�$>�ɟ���V��Q_�q���S��K�=��%�2
�<1x�9=�ƍ��G��7��
�
��7/��[z�X�( y�w���N1tC���
-�O��>/RS<��^}D�
��-���'��"��#�zj��ά���o8�{./�V�Ch�j���ʰZ
�
1��
�`'���/�J�y����a���P��:�� [���-��ȏ�����Ck?q��#=��m��G"���Z{ŵ
-��hʬm�2Al�%F��O��*��|D��%W47�	Y��j���|�i����Z���
��}��RhΧ4�QG
��t�#��ZH�~��`�Р� OR�J���{,�92��ɾ5��w��
(��h���?!T�~��/�)���]
-�Q��$��ղ -{�|��(��q��X�=!��p��"\u�'���(z�Έl�y
�;�Q�t7���SSU��R��S�,����w�]e��`/{���E �r��4�����E�E���+:+�M^�-�ʛ���z�\ˊ�[U�����b�
P�p?}V.�
�@YK�O:s��E_�J����-I�Ŷ��>+�m���;���i��0�Re��r��#z</
�
��~H���+fCi�C�+{m5֎h�'������k�Jw�D���ן3�ح��myԣ����ཌ@�֏��;U�*�GB�z�U�
�źLÓ�b��_��9P$���ҷ�h;5�����q��̕� ٱ�������
���s�T~P4�p1Ae��o4
G��
Qй�K?�`�$�����1���`���I"���mB���6����k��z/�s4�|��4F�Z�X�܀@E�ԩ�ֳ7�c�ɮ>��ꇖ�Xg
D8�gd)_2$.*A���'��W0
�
.�X��3�
ؿªM�~�!8͕8�?�7�

C����KŪ}�qq-�����T��i���i}��NA�>&�UB�}�*���h�x�8�mW��(�LZ���e	V��{�4��i�"@�ZĠ)�jǼL���
�e��[ڿǦ�#|B="%�s%dj]��n�$o*q2&	�{$,4h�Rف���}��pmU��Z_�a�B~�^F����1UW��h�3�B
�9�ҝI^��������9�G��,�,7�䚼Qi���.�����N�$J����Q3[��2 at E��I
�z;�j��(�����,W8d��:a���xL�?z���|nA�h�U�����D�h��D�L�{�a
��k+
�O�Ր��b�����y]��YB0��5_aQ�(��55�-[����\���l=djKe?�������������H�
���P4�CT�'���5�4]��$��+Y��,:�8fֳ�
a����Xpj?[	���[��
�O@������I����D�@�ګ
��X��0���`Y��jQ>a�����M�0Ah_��������x [...]
-���ª`�C�������;>�4S����������E]ܛW���k
4,.8��b��_�;�0�^�0�H�=
=��q�r�C�%�J��`E�
-�8ר���9Ug݋��o��	��uF7��T@>����,�ĸ��Υ�_X8m���b��
-����i�)xoR��Pi��9�ݰj E#��r# ���l���NE���`sW 6#-wH��T �����t␒����S���@�x�(n�e�@
Q�y{��<��� ^��x�����`��>j�"y�.]�1�>�UN@�j��)h�Ek �W��u��>��\g}
k[pT[~}���Dw=���g�,.i����٧�6��̷�u�u�8g�8�<7�
|
��X4Zm"BF����o�u�ݻ
-5�&�:rmC1u����fʁ"�ۭ]�'�SqUH�#2灗A�ʸ(�c�ֳ,�>
-[�5S�,�8	ȫm���Y�m���zs�>�F�L������_�B�k>7 � �n��A�,nu��2
�X���_5�))��4z+��
-���u�֚���6qN&ڴ/�Hq	[>���R�p�7(G�~�}�����֏5_n *�	�󫬉x,�
��n��ִ�J�;qT���b
�
�L�qa��&�v�5�@:#Q
���R�B��� BL��,l�
���]�����lOdd�*~�V$�Y,�2d܋{ �7xtB��e��1/�z���F��e0�`>���4�`A�D#7GluK��w0~Ƙ�Jq�Fp���$�d�gPno�s&�vk��5�9�2`_�U;�DX��W|rTz��&��ǩ6(���T!�x�kATy4������-���HApsR��k��QA���ڶ��
����H��x��:���7�o�\jݮHvCn�4j�S
%k*�T(_y{p�[5R��o�~d�upʐR��e��h�0+ǻޞ���c�(UX@!��N
�n����Ԅ���G�O����h
V}Z���ĦH�u5خp�����%
�\ Y�;�nƟ�
E>rJ 	��:dq;$L�w[�x�!~/&a�����o���I� >dֿ�����4	-��(b[2�Y�c�����үkpG�Rr����2
��
Et3�r�A�Ke�r�����"'��
~��q[��C}��N�����K�%mҨ٫��
y/EI6݁c�D.�j�ZmHGg<�A]�ׂ���͜;�S�Lfͭ�5�(������l0]f�"
-�����M���7�����{�)��^��2|���5���B��"V�T|GuJ(𫋄I2J&��&g���v��%�cS��L��?�!,%:_=q�';?t �Y�%��j��ۅ�~꿯N���1#��<{Mo���_3�V�b��ήMU�^��6x�>���b:G<;���֊������O훞B�� ��8�~ȔnaV�o��nz�n,�O
�u��2W
-���$g�&6���X�t3�@h׾VZ����
�Y��(���c��}�	�-�r�ݡN�۟.
��Z�`+jP�v��gcN�
-����
��t�/�V��U�W�z�S�3*7��
�۽G�
-PO*L�
kP
F����O��{�EB
�P�g�w�浚t��(_?���$
�"�s�
wP-����ޫ2�6�7-N��go�P==�\N����3_0Icɂ�����H�;�A
ʨ�
X�ȼ�X~�	v��Ε���D^Iz#�{H松
��~�:�Nj-�y�76�H��$���ht��)���X,G�gLN��vѾX�z6q���m���Y��1x�knl���*�q�K����@�7t1�O�X=�>�
ͽe�0���-�aJ�]M'�-�̚N��}
-:�ezt���g�0�8��!&>�
���lZ���&j��F>	p�}E.�
�o�o�M��%K-�
h�����Q���ӊC�t
r����P~�.K�����߸#i9��Z�7ѡ���N����Į�m�uP@��V,k�'L�p5�m��#s���u�!������C�rND�'6��xL�e��ڋ�דsވ
��v}}����X�
p���6�P�������p�k��*e��ui
��F[��>	�kgsQZL�
�
�/Mm�XVN��q��ꂆ��,O��۷=�p��Q�$&K��%�]>j�K�e��'��r�~��K��.skA]������]���l�]�h��F��T���6
�;������
��C�{���p
Q
L�����tj����
-[�Ir
��@�g�Ǘ�Y���9k�GpD@:�1l�С�������D�
��~c>r�!�[X���˘�G'�2��#M�dG[�|̅�O���i�^�h���,���Z5d��j6�E<�!s��
s~��j��Q��i����p��7�� %\�\����n�o��Kcc���4C�����P���C8s�E��Js~��HE�yϣ2�
��X�~��m8���q�O����������؈��l�������%�y5~�m_����'V����E��8>�(:�Qb�R-cf}(+�
�e���^j�Z��-��]���ᚽ}
�ݽ��`�ғ��_[/���"ߩ߮��wM��W�2�u#\�`��9�u}�����y��~J���S�erZ8Nqr�y����I���{����GA}�R����ޒ�ũ��� �ns�T��O����;q31�s�Jz�`ŧ��w*�4���b\	��׺�Y�Kf�<A�ƣX,~��/�Jig�7 0|�Ҳ����z�I���9�o�_E�]o�atC�� [...]
-bckg}S�x˼����#/f�3�C	�X��繜F���3�85�]�B��5\��S���"�^I2�P�$tO�@��3�7ye/i/��T�>$|K�.
P?��
�Kr
4��2�<�g��6��v�r}��X�G��� לTVB�&�y
��~c�h��X<�񙎪W�uJ��h�h#���Am��Q��]�3&����Λ�C�)F,�oc��L*�{����"N�ZQ��T��lK�4
-���4A�}����*�9�s�W��Ǘ;}��:%,%|955�����ݘ��z(�u��j"�k��έH���^�����w�7r�Qx��5Ʒ7[�/���T��}눺��
�~�]���[z"[p�Eq���ȴL�	�:�F_LWd���J�>��X��F�5��E���cl�ҷ�0H���Ǝ�&����*Y
-6K偳�[T�!����t
=����#�[�qf��"ig�Hk+}n�iޛ���$��V�Gѹ��
-2�T�k#�샫��H]�����77���x�rbs�7�?�af}�)}�x�E��n��1k��~�t�e����)>�q�ن}����A���;ɏ�^�fAgS�qh�;Zy�>;����ζ{��
�9�M����@�A�_�$����ۧ���br����*ҜHQz��8&)���5�)�d�^t�mb�)�)wNJ{΂�c~Y�A穀aCS
߮���$��㑰�i����|�
q3k���1q�!��F�[BjwmB,��x�ߥ8_̍��`j���
�e�ԗ�|�
-���5��S.&h���
-l�Z�P*1��i���ܦ�5�-�I
��9Ѣ8�Q���֑�,��'#9���|ήҨ/+��5!�x%
�$r_�A
�kl��1#vC,R͜�O(QE���R��l�����O�\�S�I	*E<FϮ�VZ�g^�$X�
A[iٍ��SꂙV�
��F{#upZy�QR�P"2k�i
-p�{���k�Ur��d����L�i���i\�c;g�,�ߺ�SyM��`�k-��lEa>�洕	�
����Q����wl��`)�Gb�O�$�

-endstream
-endobj
-20001 0 obj <<
-/Type /FontDescriptor
-/FontName /TPJSSH+CMSY5
-/Flags 4
-/FontBBox [21 -944 1448 791]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 56
-/XHeight 431
-/CharSet (/minus/prime/turnstileleft)
-/FontFile 20000 0 R
->> endobj
-20002 0 obj <<
-/Length1 1525
-/Length2 7290
-/Length3 0
-/Length 8322      
-/Filter /FlateDecode
->>
-stream
-xڍvT���6�)-��{0���.i0a�� (�!
R��H�H�����R�)� ��<��������=;g�~��>�}_����E�H@����"hPH��cd.
-		qp�Юп`"S�
-�DH�/%(����h����t�D  qi����@XHH�oG��4@�� t� M$�"�PB��z���ј2?�
x  ))	��� 8�� F t�hg(
S��
-0B:��h���uF�ݤ����`8
-��p���x��� C(
-��� ~���?̀D
 cg�n�tD{�=� 
�
-s�"P�O��ih�ܠ�?��
�� �����_�`���`$�
��!� �0W(@OU��A���/G�+
-��{�a�`{���
- 0��_�P
074
-�����(�+
��*��"�(�_�S�y@
0m��3Y�������8�"�t4A��=���` �0'( &$%..*���>΂����AA�`
�@7��Cs�b~��Q`/( ��	
��߆��@  ��C�`��c`��3f�
0��F{ ����1� �������������1����)*"} �� )QI�\�� ���g�����F�����&�OB
�# ���w���K�m
��t�)C��(�JHL����������e�)��/������������p���_%{�1[�����]͠6Y
-�y��۪�c�C�Q� H($���Ta>P�>
���GG�S����#Q�_/
L����0K��y��0�m�bv��uUHȯ��=<��DB�	���A�-�@}~� D ј �c ��A�k�" A0
-��r�L����7!`''L;����� ����E� �0f�`������� ;y���I�Ѧ��
��
� �(�N�j�/�_�
<=<0��[����h�P����A���ڧ-�5
-��+�x�m����bh��������F�� ���i�S�a#����C>V�Y��R�s�X*�K�{y�g�N�;�m�Oi�K��
���,q-���&.B%�D֪V
/�PkR[ 8����%�
��Ӷ�
m�¾��3�����a��i�a��;w���p�d��7;�1�Cw��~�ֻj��0*j?M����
��,�F��رRiJ<+C<�s^;bbb�{� �0=�W�E�H�P!wg�a�\�l� |��_���p��<u仙�P
��"ok*=�C� �R�=K��:s�j5ۏS�� ��T�̑n��-�&pg<z�2��>�}4�Я���٦^ۉG����l�8rlz}��v�
�q�3��%��nm�j�V曽ׅ��l��R[
�_��O��;��y`
Ҕ�Ʒ=Vs8܄���qgࣛ%�1C��:W���Y�,��JS��t�u-+j�Q�/��H�G
��
}1��(����>��T�6\��mz[
��a�m��{

�!�wJv24x���F��b [...]
-�
ҷ��M����9��m;&d�#z��?���d�vx�$��8��^��.�l!,M'(#�qZ҈ܭwQ�`l_e�r����tm�ﯶH�L稼L0|��o��/�`��$ZUc���m�N��_��]֢�Qf
�g��d�G<��n)�C�~��������q����R�W��P�n��#�|�r�� �:h��&��<��H}%��?�RS2�"b*�z$諸�5���za�����F�o��D��
�E^6�Z�:�2e����-,lB*K[g*�t}�
/"���X�HL4i���	V����=z[>k��Q�=������0����xe�M��r=.#O;�h=�vD`;_sqE�{,6խ3k�?T'
�i/>�
������z��e��ú��Ȣ
�5���(g�>ei�a#!�ɌRh��̓
-9֭��
c�JK�RT�U[Ί�SFuq�`]�E;�.��ϖղ7�~f���������Г��
�_PL�h�W�~�8<��

-�e!~+h޶V#�����Q(�'��(�*�2%�z���
+�Sd	�~��T.�|�3��V�y-
��*Q^��qs���S{[@U�v��K$	ŝz��Z��a��l�������Ŀ%�9��I&1��fh��o�*��'�(�Lu��5�W.-���w���~� c+�5��=��Z���Qk����_n2m
V}�ש�f���3Ac�y�J�ŧU�፧��?�CBq�[KŽ�Q��~?�I���ZB���
����w��
p��(sg���?�~6L�~��k=]x�����k�G��1��D�b5bx{�A�!Lݽ�j�_���ĕ7}.\
%T�ǒ/��$�M�v%c���?|��g��
�e��}rƚN"�z��\n{��X��i�焛��K�� Q���B���k�U�8��tB$��������NM0[Z>��#k�^5�!�C���]٣ߕk�s�J�ҳ��)>�ˮCN����a;%�@P�(�Tasn�F����"^���d�	Ǹ`Q
I��)�t��� [...]

�$�EnZƓ

���x�}]g;����W�A��7�m=	���*�~{읎�|��ho�������>�	Fmx�]P�ښ����؛���nSyF����p��n%��쨯�v��|�}�����12Mt;7����r�P�	�	(���t�vd��~���gc+��_�vrG���	VJ��D˼�h���0N\��f����75��e�7�,Q��Z�}C�-��0=�Q�
��Un'S�0�\��i�Y�"k?$_����Dc����u��ki˫���Lo4t��uq��_%Q�{�:�f�շ�����9�|l��
�5�Z�xC����R��*t�Y�c��-��z`�@�Ģ��z��3�.����>,��Ak�@��������9Wj��/�q����3�ě���/)��/��ς�*���.Vv7�kNG�
��_E����.�z��N��<�ӗL�6�%͐Em�f�.u�1��1�;���C$8O�NV��uȧ�I����/G6�GF$�R

ai�ֽ7�
_5�����
��������}�qzjB�ЅF����}h�,�5~���b���.�$6��n�~97����>
-rHMl����q�kPE�V�}
'KApD�2�`M�}�o�2����(�@����.G���i���\��CH��L��i���9���>�t����\ ��;�vj�
���J
�4�g��+
:��������
-��;+�y�+5W�+��^����
{G?"�-O�Qj����5�eE@����@<�"u
�찇8�U��@��Ն�Xwg�>�Xh��1;��9z�4��	�6uQO��t�!�m�̳�p�!i��N1���/��9�PG��-]�E.W�>(2
=���qm�Q';�t��baR�� \��
��qe�'��
�|o�>��p��AWk�R�`��S�6SҮ��,*Es�>=��x������/�{r�AĀ_2�����NYɬ"��&�R�����=���W�$~r�+�^����(�uea�7|�5rY�طc?�.�wƞ��D?R�N�1�LJI.F�Ί�-��%�g��D�
@r�Ȟ?ˆſP
.y��S�R�b�gC̯;�-�â`�\af6�ie���m|��G/4N?�u��7d�*�z�-����9��74�ck����{d����;��|��kt���
g�)�� �"MX���8LȨ0�P��
x��Xӈ
-K�N at 4 /�q[�z�
�j�r*˯�XA�3�z�@��/L�c��܃�
-�!�jl.���v;+������,������1s���@!�-![�ۯ��O�'�w�F����
lJ;�?�j�z�	��=$���4 �/>?���ޢJ:�/�ڥ9;�XsP⼵�Tb6ݣ�{f ������s�fVT�`SDC�����R����\��9$.1k4}�~�&��'�`��:�Ef���Μ�O��ڊH��c9|���������l:
V�,��
q��춖��
-!��
-�x���~��B쵖 ��
x(��Xm��n^n�K�A��[�O�O�_���-�32�a������T��f�w�&�DR�����<њ�o�
�S\Ʋ"[��3����Etݙ�T�M~�_�����?��U��/I�͕A~����2C��7�?�V^&�D2�M���GF�
-4�_4
�T>
���d��D�RX��B��f�O�:e��e�i����XL���<[!�#F�p�ϛ8' e�U�$�0�y��q`]H�fڀ�;'����n�i�N���v��lǺPI�7�.�6��ԫ�
��Y�pI�
hy�~q�{�🐹��ר�J�Zt��T}-�+5ĹhO7��|Zi�?}���t
%h7xpe���ȝ����n�Xnx':M)K1&����w�!�稴��:`Ktk>5?PkÐ�Q�{WJy�e��ղ�~J�����+�������+�b#sauV\�����-6������7��bg߹Nk��{t��>�R�!�?��G�-�r��f�T�q�Ue��>iD�3�1��K�D\]�������81v�>z���*s���dw�7�,��v�:�{@��m?Nx|w{�]�Y{�V�
-qo^��0�Fշ��Q%/�!�T��'�;܉]���
D�t�	s^壉h{!�,�gE0.�"�w��,WGEB[�:�+��]5��b��2�aL��kƋ3�t>�
-�d>���%�U^�?)�u>0N����]�8��1Q�{K�.?�#�E�2�*�*g���M��"��^)~(a��}B�c��eG]��v_	�f�&�ś���T���,���^˾��'�G?�-&Ū��i�&�g�w"+�d�
V
-��Qab&���=�����vy�O8
ē]�-�-*�
����J�).{H
-‡�?v������GI6��<Cؤ�/ѽ
�W�y��+���is���|��U9�t���Vi8
X&��[���q�:���I�?D���T8�=��:�V��?��G�#�|E�~|�A��8o|�bօf0tH��1�+JY����8-sd�m�P�6V̓r�~��4��l��/�%vt&!�!��&[�k�Z��T73ym��W�����m�P*����;x��ʹ�,�R�
���=�q�ϟ\� �SF��]A ��!|
;I ���J��
l�^����	\���|f|+�q�[q��5���'�C
_������Ӥ�
�YN�v٩��W���ckPذ���y�;��g�/�X��
/=}�^hL�-=�V� M&��E�y�{Zr�O��7yS3��aOp��UP!��ю�d��v�߰У-��l�b���ˆ�
]�r�!�����C�6�Դ�cK:ex�#�vxIRq��|����g
�9*��&6�
y��_��;򸮙Yd��T��5��C� ���i�U�A��^����nz^�@�/����
l^�*@R0ߦ`�Lx1كY�{]���o�yg��	�
U at KM�q#u��g$K�dє�o�4^ZY
*?�& ��M��'��?^'Z�fV�E�'�U�u:O��1�_y)�%�>����|�Ҽ��L=�
0>��x��x����t7m��-uCz��Kث!J�.��;^mi��˽���C4S�C~�ԟVC�>���f�*�mW)#�l&wm��

�
���!��n�{��x?{�M�
uU�L�r�Rk3
d"k�S��:-�\��ן��DN�z�䧯^s���G�<�+	OӾ�
���m:�a6�L�P��G��
q��Gu^�B�U�
���*n�
-q K�IF B"
�P[�)�������[
-��_�u�Ћ9�'<����_a
��i���%!���CJ
��0��Oe),*���C�w��UM5i�HK���Z������qIy����H�=�
��
-(��L���E m�p�� {�� ]�R�0�[�^ɮ�+��6�]
1],.�is�Uy��P�6C0��^�X>7�B��1]���,�TQ���ܡ	4�w�`h�����Z��L(?�r�[����nz�rD��������\�ό��~����>����Oq�`���cNs���$CYYS6Ƴz썸v�J�H��͆�0��ƊxNf)<�ek�A0�_vQ��H�ǖт�
~tl헥}�
-��
|x�ձ1���T��X5�V����/
�솂��&�
í��2׉�����{v��TLX��?[�V�Ԯ��W��7$��
�<rQ���_m�����C�����
ǯ>\f���d7�v?�C�
G�ulū2��|l[�i�-�3�ݹ��hQ��k���1	�,������J�
�Z�Iz4�CK�8�h-<�̱+=Tny�{�,��漶�[�vL���|a%Ϝ�,�\��������,�{�b�]~I*�<a���jqD�.W'Ą��'�ٕ�
�r_V�8�::!Z��߱��J-��{Q�dҌwE�7|�ByY��D�$�����Z3��G���O�?p���>8v�[_�Js�>��7E��x
�VK�wƺof�<JޅȬ�d���
#϶��7�r�fI��7cS��b���\�)�@����;v>���+\`;J
a��������N�U��=*hH�qz����sF�s�f+�
��B�?����1�Ӷ8-*9�{G(��d��j��{�JԖ��ԧ��뫪=QB��͍��!9��ύ�,]zCM����5���]�E���Si��g9�
򐬰ͭġӶ�]vqm�
��J��g���%�6��V��4l�j�jM�u�W���1��T�b,����޲�*�F�w=�Z�(3j\
�V�p/M�E,�K$d����h��k�2���G�R<��K��J��w���퍑W^
]Y�*��O%�H���b:��	� ^m�O���GX�Ot��\��a��vޟsP4�f�e����Y���
�]:��3��_M�Z����gF���f�M�ӃYd]O+���[
-���Ұ[�!+�K
��۞T�Z��cyW!�DH�����Ji����̈́�X6�U�j
+�Z�7�X��s�$��{vh�����mH��G�(ё�ǀ�ʴ�3��Y9[�X���v����G�6��~�Y�X�G֡q!#)�҇�(Gl�@���g3����K�����
��S��FO�s�oO
?�X���`ƹ�#wY0
�+��Y���s�!�^ ��F!�e��D��z���P����ޗ�~-F�lW�$�[ɼ"ъ�m�9
=2�ٰ���@y�f�z�K�7���9m�6J�g�M�2��R1Y�5cK
-���%���'(������cKǨIwO%�ip�pVJ�<�P����
��9K�s��_ګW���:~���;�l�
-��(
=M̼�m����9��+!
-md>C�<]�7��찷KӦ����u�m
�F�W�и�E�o�G�*����k�%7�.]g+QӇS_yR��R�
�-O�;���e��O?)�|�Z��8DA#���Q^�ǥP�(�tZ��
�ٕc׾�f
.h����R� =�]E���^H ��y�<8H�&���*��i�qRRYL6J��s)h�
��.����Lw�t?�8� XV�\�s��}����|���r�4��B��eR��^v)\Qy
� ��%{�7��D� "�V!�A������
�`��?

>�%��n���nTP
�q>ҳ1�*�h*��#�f��1����p���0}�O���r�~�]�l�
dJ���<-
K_WZ�86��'<�
��D-8����SA:��i:$��u����pv�\/g�!u�k���>[�v��E�9[4|r�CYşA/� �1��k��n��-l
�
-�
!@����f��6v��uh��^0Q;�!q~�U
,CY�3�t[��l`{������{�x���5}�Ni��<�d��%C��H�P�#��B��ҕ�9��ѩ��&�@����"�Wi
/�C��h���6��$�X���o”���쎲�l( ���R*[MN
�Jj,��
o2���9��o^�
� wtd�
@|u�Ӑ0����`ӻ�B�D-:����*����r�|��`�\�0a�sT)[_G�_�A�(�u�
i�[�98�K_��_-j���s��h��p�L�?W̏Oз�ħ��
N��_=�Z��I�_�,�!�k�\P�
�:v9]�o��%|��LW&j.Hm3���GM:��	�_V��U�A���`��2�g~�t0�o7�����W��y�z��;4b�J
�
��
8"gq/���j 

-endstream
-endobj
-20003 0 obj <<
-/Type /FontDescriptor
-/FontName /TOOBUT+CMSY6
-/Flags 4
-/FontBBox [-4 -948 1329 786]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 52
-/XHeight 431
-/CharSet (/asteriskmath/dagger/daggerdbl/infinity/paragraph/prime/section)
-/FontFile 20002 0 R
->> endobj
-20004 0 obj <<
-/Length1 1580
-/Length2 7255
-/Length3 0
-/Length 8316      
-/Filter /FlateDecode
->>
-stream
-xڍtT�m�.]�堀�0tIwJJ
� C��0tw# �"%J� �)�tI#݂��?��~��~�u�z�z��v�}훅IK�K�nQ�Ð\��<b 9
]#a ?7
�
i�
&`ч ��p���R�C@@H&B��4�0���=���+$�+,������[�ȃ\�� 
n�*
q&`��;z ��6HT��l`v ������� 
-�  �
�
����P��_.��m�HG1 ��͍���
GXK�?�A�6 
�3�
-��*�� �S7
@���ׅ[!�@ �C��3��f	A P��*� MG쏲��ǀ�z��������9��~��`��#��Y������:7�
� �Y�R�;�Q� W�
d�R��9�(�
 �
-��<g0�t�v���*��
��
-0K9���t&���<����3Y;�
����
-
-���U���#�
��Q��K��YC� A
Q!! �	 q� ���p�����Q�x9�
V�" >P+�C��
r� �������D��
���� 
�5F�w
��sF
u���
������9�^�p���?��
�1PT7���S�d��pw�� �KT��ˇz	��|���?
���ߨ�Wr<�xT�Y��j at 5��:\���_+��w��p�! ��o�#�F�x��������������	)��������b����/�]���Ѐ���ߪ�?�����8��T	B��
�Eq.^n
�?8�Y��Ԃ"�6���(P1�0�����AY����
�u`;ԭ��o�T��� �-m�� �@�<xP$�x�������  7
�D� P5� ���_c �A�O��< �l�lr���
-��C~��0Q 
-C�
5��A>��=*]��
j���(n�kĿ.��a������5
-p�GB
���(���A����N
-�^�#��/�_M� �\sձ�Ͽ�'�
&������V7�W�йq}�Y\n��3�
-D�N���Q�MWu�}aYJݟ�5]
:2�MDZ>�nږ�����DS�Z�=�����f
a���Z
�D��
�k3�}a�e������v������f�
c�
���	S2
2F&�y#ʈ�y�gdJK�0Iu�Sy6|��=�m����X5�M뛟����J�?~��Q.Tz���S�)�?�3
E|�j�3����⤸4��
�U���̱�4<�"z�~h8zB��pMC�� k�8�OO��,�č�$M�GZ���(�o^o>�P���8��:�2bΊ��|Hݿ��&��`�t�L�T�2ri�--αA:���v������z����<$:�����
�K22j��G��S�JG;���� �D\�
�
��Gh
-&������
BŜ�{���ً��
-_H[������_�j���^F+U�.�|5�1~���X����z�/
�����I2\�{}O֢Y'��k��;�;���5�TX~d}��\���t�J#�k���&ci�
E��M�NK#��)Up�
-j�g�(=��ݗo��-R���*�$�zE�w@*�"��(�"��C�9��Q3�����v�K�qƭT�N�ٽ��Ջc@f�ݐ,箯�����rp֏c݃����ݱ8�K���t��wٕ{��O�@It�R���O������~ĨzS�$�F�^���!Ƀ�
�Ɛ
�ή)m���Cb�?,�7t��l�@r����:I�>�,��4߼�y�X�6���r���E����
�?��
�H0�ۚ��CM1U[�����N��!���f�F-�<<�C}6�M���A+H��x�\e����8������9��,x�)�7w���E,�x`�~�An5
�o���R<g��(��5���;
��X�=a�W��_��}�~����3;�
v5�0
=
-�>~�qq�rd^x�v�1y�$
D���tZ�
C&��t��Dxۏ���(����0&5$
����	9�L��Xyz
KE����!���d7��U�#���HZB��������Z
��}
-&�JP%�%
s{$��C��5���10�Տ0��XB?%9�pe�ݪp���8����/��г�9���P���]x(Ϋ��jeA��Y�M�{���əG�:����!�$�ܾ$]����0MS�-���ֳO�q�
��xNj��w1O�
be���s����
���;�ڍ�g_\7�UQaU���N�b��B�D�X[sheG�z�	���#
b�h���/p�՗lW�-F_�y�B��F�X�Jy����

��Sޏ��_!�� ����{u��fϯ
鷆�^gh%
�]R
-
�?�H>����'���t�Zl�^0�?[�&�m����P_���w��i�T��草.��_�ˤ�1-7�w/��6��v-��9���Ζ�]�ICQ!�G�[�I��x������$��n�L�C5�{%˃���/eWa

W�����o�&sz
��Ը#x�$Cu�I[�?:�C=E�|%�z,�F�'�"����fv�׻�B����7���{/��R�F3�b��KF�`���r��zd ���7��
��^��^B�*C옳z�*�������������f��I>\O�0*U`"�W>��b�s�s�;�
�}J��
�%�2~���="~�A��=�����ZU:�W�Z�Բ�����ţ��S7��b���)�:�`�����^�
�\�ȡ$S���n��0Y N�9&��n�ޣ�}{Pr�]W�P�ߒ.�$��3|��8�%-w
"CC�Zv�F��K3����=4�!�]�J��!�K��C��
XяJ!�ς	]��@	��B���M;(*Z$�
�����X�f-�ofT�(2
K/
������tR��;H�T�a�
-2Xb�^z:7�����kQ�4���Sf�A>��.�N
dH6Dr��3o�ש{��ZN��]`6�Q�O#��M�fV��
��Ң�[�w�����A������A-�������}��t?>[�>�l�S<AI��sK�~���!Xb�,�_z
�H�� '
ؙ�7U&RV������|�X��ŮeHȤ1
-׆Y�XwsFʓC���Dr&�/�,�~j�dpm=�)V��a0Pd�=2���6��߁c�sk��Xm�]�V*!c�$ym�D6o�k��&��cX�yC�l�-�����]��k�EX�)��
�U��^)N.��[\k!
-�Q��v�!I�/L;�DkϽ��
~�b[�x��I܍�,y��������$��,<TB���}��,r��-
_��H�a�5�9���Y|��� ����<ߔ��)N�v�Ǔ��yĹ�5&l?�Q0.�(_�-��l��
��?[}r�1ʖ���cҭErC�ŃG]�
/$r���[]���dz=��N(�A�	��a��4��?xFK���KA�B*'�j�TU�|��~��t��
������e)�S�����J�Oh�ݶS���[����ܽ�-�N{��ˣ���)5
�`��ԟ�L����kP���4���A&��f�9e��O�|�����g�,|�6��)T����{�Q��
�1�z���ҹ�L��p���MZU��L>��KNAVܚ�e,e!�O�8�o�.��bv�\?�+�(�$�
 *k|���!BM��Dv���k�����ߤKP"x�����S<���8w��9H8o��d���y��0��c���>W�4\�{�1E��Ɂ��e����gĂQ�T�w [...]
-��h�<�X��Q�E]צ}95�*�����%�7�{�z���|�����kC�k�*���M����\�[�P�
��iѷWyϷ��(�g� \��^g�bU�E	�h9�Z�b|�d�+���ag�w�IYq�WN,=Ō�}d��:B�����5��fǩ�Ir�]�xm0Xxy�9 ��Gy�-Y�T†=�p(J+��=��f׌-��2Ҭ�3�coa��[I/��7OXu����b��Q��[�4�FM\2�!(
q�����`h<˘���X�d-�9��s蒇���6��;�ç�)�c�BC��
{�W�z�+u�f
Yi}f��;@0�_��bl��B���=f2����䢔��}��{Ou�KG�CK��ɥ%�v��o�c��9�Uއ�kf�+�Ԗ��'?
%�7a����
-��]b�.�����*��<�I�?���wg�y�~n�|?)<|�=��㺪Ck򢾆1���l{
g�����b}@2���9�c���ׅ�[7;7¨�bk����e��`f�
�N8�-��'Nctf�R�������҉|��d;��l�(|*�d�
8�AE�O4�H/�Z!n�4��{1XK/\����~��
v9��*!�9�M�`�3V&�PU at o�(��Vn� #�N�Pۦ��ه��⢐O��
��Fy�� ���)�G�S��g�Zے>9�<wB�kE�<!���N+��&a8c�8�a �[�#�`Ao�#c��~r��-ddG��4���j�|�T-��#A��
Q�@;�x��}��������
�u:�q?��A��=�q����7���:K5
�߸"��� 	���,/
0u����ɂ�	\�}����׸
-�o�a
�D
��
7�b�j[��Fz�-��gy�(�����v����2�]R����G9��KuIO�;�%���P$|8V����]���$��ZtK�
imy%}�q�G��#���
-^@]�	)��G
-�YoN�Ϟ@��ƹ�Mr��U*

ڵ2q`
-��l~��#�4�r�i~�V�q���O37�`l����~
���
�8�I0�n''*��^��&��׿̓����2�ũ�e�M�����(
I���:�d~ �O�A�{�zcu�E(�ws$�gW_SY,��,�V5�-��E�n�->9T?p�\^b��>�Y�J�;ﮡ�N��ީ`�N�OW]��$��:N
-�S ۪_7�9��vh�c��s5F��V
�����t����*~��Z�܉�o��;�ِ�
��-��3G�����~�A�)��XEUC��˄>z�Բlfu���Z~��F�0�E��8<��	�d�����EË2���d��x�`ٚ6/M��
-7��FKە&r;f��8�g�|%�ǟmac�Sf���l�Z<��S�\J�Wϯ�����h�0��QM�
�˖�徔�y:�{d�i@"��̺�\���;Xv"�Lk��yZA�
)���[�Γ�\Hu�[#}�.f��1 �>�lJ%�C�7��h�˽#�K�L��R��y�֗���⚮�}�ʽR_�g	+F�
ǃ;��߉;+Whm5��
-�\`��W**5�f5%���%Er���]u慙~�[��;%Zf��7���z#n^�<'Lݿ�f
+�b���1,C�f�6
� ���u��jg�tF�x�b�����l���*�g�`�K��3x�c!�v5�:{
����;T/�!��&��>�}o|X��y
�Yl�'ۧ������R@�=̒5_�.=!��EEw�d���k�r8�	�͝�YI;�4I�3��F���j�o���se�K2�D�l(�/_�C�i��E��3�k�I�s�
55
[aId�I76� �}��
��?�6��Z���^k/h���˝��߳�:��p�(U2e���C��
^}|v�9�RV8�!ۀ
�$hܾ1;�q�|D""P
��`��/]+�ŻC�sAO6j+Kg�p*��_s�HfU��}��׺���{CG�g€�!��QZ�x���m�v��E�
�	�
�����hs��V
F�WE�]��\�%	�R:��V������uʁA���
����R`R
8���*�T � 9E��� 2_�Gd5=�=L�Ιܫ�#6�n����v��LC
O{��xe���}�Ն��5�5�dIim8@¿g�qs��|{n_���{\*�{+��FA~#>���åT4�)��r�8�_rxj�gK��I��kjj��
x ��6�� 3�y�%c̽�Ed|�%�M"sY�:�Q����[��f�(vm+{���/�
����Z�W�h�j���ѿz���x=₈�����9�1 ��;��^ZR�������kf��`���xݓq�

���#����}2�X�ϑ8#�2�% �pǣ�HҊ;��3I�Q��畐�O�m��}�Qp��i�
�*p��V��~�y]�o-��Dn��S�0	?�,4��!�ܽ�a���z[5��
��Q�Л3 b�6�~0u��������[��S��oJ
1.|'�7����O��<;	U�m
-�%vUZU��0����ٚ�n�M�YKG��U�C��9��{�YB��7*�#�A�b]u�Uat��xK&y�/t0�Ax�[-�P���
�ۃ@���2����Igc��"���E�"��Cn�ݴ�v�6

-�I֧�&n����vؽ^�\.jY*6�e<�
p_��	���K:��� �2��;��d�e�����K��6��ҳ�3-��كv{rGTO�-xb��?88�_l�Љ@CS���>��Y\��)2A���;w�C|'͎1�s����G�@�5�* `�jn+�V�+�j�N�Ww�(8j82gx�}B�3��
S
7ڱ�9r]�<��6�Qc�H�ڎ�ѽhר������A&MHO�*2�[��T��11Kv��16豇��'S����\;���}���[޼��5��������7_�~��'r"����r{��-�3��j�ϦM,�zs�ZV�r�=b��$�v��j�w�"7"6�^[����Ї��
Wj��$�������]B���A��������[_W>��j�;/T���{)V����
~��_�:C���n�	�}͙�86d�\-�Ƣ�
�[��SS�Wpu�BnZcbHO���ͅ����n�Z��
}˞�P��͸��M�>��T
��2?\tݲ
8�o�l�
�9�E�>��IIVܿ�ףn�-��G��V�Q��L�ޞ˜
-��8����
��!?�q�gu��P�����P�%O�Ǜn��'�YO1�{�e=�r$�.��8�[_"��q)��Fg���#-�g��3�x�+�(�k�b�Z^U��X�(]3�BЍ�$7�F��ٓ8*���c4��#�je
DRg�{��������w��u���شT��י�_MwWr����K�(������<0�ۈ�<ru����
>.��Z�.@���@�I��i]7�$j�#�=
�m��H��
<��N�ꫡ^O#KHG���
��&�u��X6����T��
T%�/�j���w
���*���0xz���iҨi�/�g
��<o���^���(
5�	�?Q^��R���A�Bh6e0�m�H[칗�
PU_E~[��?��:q�}���o�m��l�h�ԅ�rk4ӕ�6q����
-��K���^��&�+��	�&7*���—r�nF(���9��f��t�&��y7�7��N}�G�&�5ҩ�0+n��{Sq�"7P�����)n�pwԼ��I��vٽ�'t������~��Yc°���me�q��A:�
���;~ 
�<
F�`QV
u�|��n*�)�6#3�S?�,�����<
��f]:�
-ݛބ�18Ap��j�E�(��SS8,O���� EkȻQ��œ�3����ˣ@�
��
�I5)%$u��G�j%��hJ'��$B����v%w�Ȩ�LC��D�[{<w�ZER!�.��|�5A�L���i�
�4<>�m�w�����1��
O`��ǥɦ��FɧQ�� sUK�P-Tr�_|�.�
�a>9�G��a4��m���.=݂�Y:��w��!����.��='&�����l&�~ߔzh:�NP�\�rsGE�����D��#�z�vQ
-_-6�����Q������� �u���x�;�+�߃/���0���
�D3�]
?1�+�2��dj(
>*�-�5�*����z0�%n�!^
��.�irV��C�VW
-�{��6���v`�^傱�L	�B at 2
��x�R㖀5�k���}��]�,^e3+�G���=t]xٓ-}��tK:�扛
-E^�b��ɀ��)����yM���7jAVQs:T�����
7Y���2�
-endstream
-endobj
-20005 0 obj <<
-/Type /FontDescriptor
-/FontName /RWFLWS+CMSY7
-/Flags 4
-/FontBBox [-15 -951 1251 782]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 49
-/XHeight 431
-/CharSet (/V/backslash/element/infinity/lessequal/logicaland/minus/multiply/negationslash/prime)
-/FontFile 20004 0 R
->> endobj
-20006 0 obj <<
-/Length1 1463
-/Length2 6796
-/Length3 0
-/Length 7790      
-/Filter /FlateDecode
->>
-stream
-xڍuX�m�>
N�	at��n�AR�6ƈ
�� �HIH�"
"%-
"��� !�H�ߌ�}��������
�v_篮���
������F!�"� 1�����
PLL$&&��@`�a` �
�A��
-�������8L�����@}ow��$P\FA\VAL
(!&&�w"
-� �� �@#P��a <(O4�ō��� ����
-�*�y��	4c]`
���;�
A����h����z*�������

-
W�"�. at 3���A�?	o�=`��� <@
�7n�r����0 pG@`H
��	�����@s=C��'
�;��w�0��� �A��j���g#�W1Ayx���$
�p���
AX?�0���L�cP�z��v�%��9��f
-�������X
�p�IQ�g�)k!�(��ܟ&
���_��ͺ!Q���?
g�����S�����i�I�A�cp(-&/##%�ya~џ�-�=a���?a
��@O�'�G�p��~ ��
�E{�3��@\
E@�@'
���;�9�^�.��ډ�'���דN^P������WTS��L�J�7����Q~�@I1����4P\\N(++
�g�
����&`ğ͉���
����wx���#
�?� �s�-N�0 ���o/&-�}���
������]�7�������������0����''eo,�F(�9���j
�me#����Q=,g5$
'qq)���o
��F���&,�巐��
-�
wf�� ~�qpUbb�ù�{�`p�+Ù�s����$�e�`4�ÉL��@q�M�0�_����(,���
tF�?�U\B
(
-��8ڸ�L�o
����$P����`O���ŀ��+r�	�co4��_2�m����W
�� �M� ���u���5j,�"�GH?�ǥ���Jcyg�����Lz�߅V^�2�}=1
�"�}<�gߙ�!S�1O�wY}G�`�d�c����c�Yq���RMoP޵#��{`=}
%�%�V�Z|юY���z K�82Y�����7	l8�?bm쩒h�v�-�,�.IGꭉL'��vIك

���z�$w

��e*�i���9�����S��0x��҇�2R8��zD�~ �v���o~��3������ݤ�A��b�>;�/
v��[0��F#޺[ I;]�����H�Y�.�4 eT�Ժ�$�lŚ�үAIFQ���~�ٯ��լM
�U�
-)Wx>P9�����}��W{@BYC�p��6�"�������-x&��]�k�0�5�[Э}���ԙV1�J�^
����n�)�?秸����9v��$"�`i$�y�}�8C��3wM�!f��Ҋδ��6�'�G�J��}\s�&5}���
m]�T����ӶA�0C�2���}+ap7���R�H��/�ݳW#��7�y����)Q4�

}x�H9r�|�j���^Bx��e(qw��K���=�_�$�6�>A]j�aq��0�Sd�n���4;�������x�p��^%�mQ�J�����t��i
�.�a�?�`���\�
�
"E������R'�;Y�O&�ڤyf罃|Z�ܵw�'��ʣ��&�&�L�M�����*����.܃�Q9=Qe��
W����g_h��.���M�M�㽔��;v�Lm
�����>��6�-Kv��p$��0�x�@,�KZq���b�K���e2;t����G�t\@i���(s����tF�Cٱh�Y�7u�6zөX���wDaJg^Y;�����h?z�ԅ������뿄)�Z���P
�d�IM
-�������%�

�N��fQ�2�y������?05	�d��C���_SL�dr�~�t��G���b�X�
I�����IӢ��Cg��'R
�?���Y	*d����x���ތ;�
I!u0�.���L%A{vL�&
{k-V:�}�4���k�|�¾#��]�B1DvJ׮_�qp�n`�
L�O��? �W at S��Gٚ��H�ri�oa<�8D7�
<�R�eX�o^�����ɠ����s��m�Zt�s(��38����;+���J��m�>r̞�'�+-k(N����nh��`2Ag
-��ĖH���m2�c�C�
4[�6
�m�n>�o���JCy
-Ҩ��
8M�(=h��#�%P�an�t8�!���4dʹ�_ɿ��1q��6�8`�\��HQj%��q���7ϳr/uM 
%�l��
=���#�!Է�Nz�5����f�4�n�����b���pL�l[o�x����#�g�����xHw\q�C��6�;�1�v쟿X�ZPW�܈u���U����pyY0��gr�g���cv3|�+��6�s?�*���Q��
WD�
M�I��J�0������3O�
8m{�C��Lo�����si��^�/�j>y6#�[����.�Y\��8��G`-1����Bm�)�=Y�����L�
�#���"#M	�	ֳ�bf�T�K���Q��DjN�e�"���^N^K������{c�m8ض<DMgo9���u�$l���Rt��a{u��K�
�人>�͘�uD��~H��Si��k2�?fR75g���J�f'jm�?���
�����dP�}gv
�j�+��\�r�	�lNA�8��̈
�K߮2x��|��9�s=
K�G���+��
n���ɮ�˫6;ľ����%]�z,���ۮpEw�G
��8A�� �
��-��o'����~�����
d�}�
-�&�-�y}�&�A�P�}��"��Ҹ��Qu
�2��%qmnZ/���J���n�
-W
-�1WX�ۥ�@Å�
:g%[���
�t"X�n4ߡ)�uWy�._��Ǐ���
z�|ӢXW����A�hؖ9�̺��_�/K}�{\��*K��������W/�9Y�Z8��MXI�|�D�u�g�_
-�w�
gɌ
�_&R�1a�p/f���d��c�apQ��7���
s�	�����O�<nw�]�g���}۟�ĉ
V�i�5������%K���+���a�
��	Fi0�E���o�J��xH��{�7B�{�����^��A��E=X+���i�j-F��"�
�?k�L;{��
���n�i���-a蒲��0���
�b*{��(Ke�'sh
|�V��:Ft�δip{�
U��5_T2	�}H�mMBn��4ܬ�#C�p_���"^y��ce at hőKfQٵ�
�e�J���,!����8�+o^L��â���2��Ӫl�N?ʿ��J�d��$�ɯ��h~�za��\^u9	�JΧ��Њrsg�:�P>��F�6�f�P������㪇��4
�����q���i��y�|����;�p'�u�A��Xc/~h
L,Hyska�TO�(,CL���16���ׄ���tk� ��C�걻?�*+�� �
gYT��2&ԛ�G荸�
-䘳�Yw�:^�
ý�5���cU���*ZOA2+�.�I
$*
Q\v|�t˝N������U�=gõ���٨���O����S|�imGwDf�
^y^bqZ��2��?��ĊJx����)��
Oo�hN9�5:�,Z�u���/qY0��~w(X���qrh�E)yFe�
<�@x�4��8]'�� [x29BP�΀�Ǘ黻�
'FY1�kMEr����̢����:.3��)����I4�D���*�C/F#u;�r���$Z�����*��a4@�٪5����Fn��o����c]�W�xx��H۹�Ų�G�X��e�'Ɖ�	%6
-3�BK���b���@�1}00+�s�n\� 7�х@x�\V��KÁd��سRq��i'u�\��.�
(��u/����B�{�`}�!�a`
5e��g���e
,bo~p|�<���EJ�}y�M��V��1bI��_ZHn-O���1VƧ|G
�i�yz<S�yw��҇
,f~Q&n�ۚ
-������F���M%S�R�
p�>�
-ֱ�ς/#_�>6��,jYl)}�9SV���G�s�WM�������(��f�����	����z�S�˪6���ό7�&M
�,�����3X�{��
-�Ca��d��4�'
��N�x����>����m�i:��_���y��
,��
�g&T������LHg5�N�5��X�����@��؍F����'�*��3�dfk+J������8}���.,�� �?�h=.[H�I�
7�4W벜O��ߧ�Ԝ����ai�n��e�
���ٕE�I�qf� �� DSDS�Y����)pk�,]��ޯ�%�I��W���_�v��RpF�[
-�*NP&��\��DG[�۝�dK�Ѳ�a�B�^�ب߸�8���k�O��B����P1��
�
-�����(�c�[FHV�"�(���c
������̈́Q`�j�Mѽ�Ϛמ�

�%��p�қ�]p'�U�%\��rs���g��H-�}i�G��GQݥ���x;�MmEȾ��7݂�������)�\�-��(:7K.�1m:}[��q*7�1�|��.�o}�_�����4kZ
d�gB�?�l
����w������Aq�Jƕ�������d����WA��{��'\D��uxGNE3��0C�B�
Z>3��}�=M-��]n��=$���ˬi�g{j

-
-s
-��\��
-P���
Sn�</HK�

������{������/J�(��;f��Cw-s���31�.�1��`�x,s�FG����ȋC{���c���̵d�l�H|twM���|5�{�Di���a���G�v��7"*��|
s��z�:�5�O��Q��`6Q�y���<�VZG��)��(�L�J��
�`b���{^�ԞV/.,Y� 4�W��_�k��_�m1GU�GK����
�g�
�&$���5
-���pZ<K�׏1bݸ��S��I{�A�F�e�&�W�@���6E~TN�g�� �
�֜��u�k—�S�^�������~��dVE��C��j���9g��kϘ�W�';NQ���V�����T�^4<��]5""�\�	������ ��c�k�#�
�2�1=l�%�� ��s8JN�j�/ņ�nH���Ӏ2'�t�
W�.�%|#�������[���#�o	�m�6���=񫆣�0��o^5]��(��O
&:�2��a��"{�Z�敏�1��'�
�����V������,E�
&�����X��/�r���p�g�Vn�z����C&H��;
���#��FR��{�=t���
�$q�Ӆ"Y�lS��F]��^w
s�G_��.�I�1�v�/
��B��x��hg����9�d����$�������f*٧��A�
e 	�Up|����dpebh+�n�OR�^@pR51͛��GV#���kx'����� !��<����@J�B.4k#���L%�����݇�rn%i�_
�=���
~=*E�j 1��q�z<��M��^�u'�X�d�pq�
-�q�QVv,�
-��EvK�4|�?�2�� ���_QKv��P��C�N?,x}�X�C\��9� L�n�&?���ڮ��)��+����
�4�� �
����j�I�7����
��y_[c#�> "fr�����K
-�Wc��D
N���fL1[M!����c�y_�&F�wW��+��5��T�l+^/l���}�
i�`ً��F��^iO�/V8�@�����g��
�ݙo���n��
+s?�ۣ���W��-?|{��/����D��f�p����i��&�
���_��k���l'.l���Ƴ�|
�a|0�;���oo���Y��a���w��4�'z���2de����
��n��nr��������RxLDŽE�����g��K�L?>����P�
s����y;�a�l�0��]!������\�
6��ʹ�c�r��5�wb�l�"��0J�s���?x�Ŋ�o�
��V�������[�zT�*��}��b�.ɢk���������v�:Yu���Eϰ�[�BW�?�PJE0}I��687
/�q��pG��,~�7�<�d����Z�^c)	^�UՈ�m���چ�Wg}��&�K��V�]
TvKZ���)�B�r�lN�ܟ�Zr]���)D_�{`���>��%�
N鯑��
�/��׬{H1&��i��N
��Eo����i��p��	��*E��ϘI�"��*�
��J/�4���y�Vp���akup{��x#�S�v
� ���,�`��'�x��2�ևo^F����
��h�Y�L����*��0X�I4�_��B�	֣�k�����r��U�+�!YI��T��������m1��/��\
�+���I%���aX���k���k�^�3
-)Ӈ���
�
�3H�&����A�q�����l��}H��&��;���6~����Ʊ�y��a'����
�g��j̔��wRȔ�vDr�����5d�:4~~��S-�����#�X����V<z���jk�o�h�:��L�$#^��/�
j�8.\�%�U����<���&�H7��/�&hW�ҵ����]����5b�u��
-r���
'�9�(�(n��_��R��x}U��ጽ'��Pe���ni�dؼJ���D�N-͸�Dj��u�hE;����&U�
�@|sf��X�	;� _I
����Б��
�������B�
_Ǯ�Z�}�E��b��x5+}�����x�d��%�YC�iP�
E ^�N����`���h�>�=z�^�mKV�y�[0s�%�J�Q��8�� `my���r��
�� 
G��B
Y��6C�_��vʩcDONX-x��.u�
o�_��
��4�	�m�7�J����S�!
��D!C��1_o�j�
-�B�1�`Pu
���fw3�`�lV��v����I-�Ur�⑲����_68��Ig��>a��IN+ܶ���y�����늘|��d�$`�}@0z��Pm���|:bz{�wә|�&|$LQ;�R�zmu��^D��e�
��PυwuCц�h�[+�m%ƫ}��Bߓ��U�7
�w� ��3�@�E��A��ث��|7��4��V-<7Nk>S'��J0���QGa�r9�>z,V�uޓz�T��,[��_�I6`9�H
r��&B��<NPXHP
tW9��
��N��㱢
E�s���r�\.|x=�f
���
�=t�e��F�w��C�3�Βx4Hv
��[P)�����)���/d����孤��2mT��f��Δ+��T��`����k��j��F�E���'�	5���|�7���cjac��!x,�;�8e��Z�?
�Φ_�*�h�����K��d\�cxN}P�Δ&��ԛ��9a#�no��V����W�I�3��o\k/����k�
��nmgOm��%2_X���Ũ@tE�>EJ�%2�xI�#��!4�n�|��J���c"�$�5�ы	ڬ�p�{�
K�~�\�c���{�
��W�jRS���9H�����ܷ�9�s}�x�g�%Z�#��B�#�u��.�
Z����)Ց��)�
-�ݘ� �k%�b��
���%���_I?��0h!OV���[���U�݂��6��w)��)��NM؉�i9~?Ts�$�kg�>�?{��a�槮9��|]�TU��x��rE-̐:H@���i7�û)�V�ճ)��W��Y�8��R�
-�z��6�j�[}�8䫓6|��ܨO���7�8A�@���E
��
��t�i[�o�0�2�okE��)���5u�ɽ#���Imަyz��!�v�5*:
-@
���/C3 at L�#&M[��Q��HZ/���"B��hkw�<���7�a$}p��� SZ�
-endstream
-endobj
-20007 0 obj <<
-/Type /FontDescriptor
-/FontName /DFVRAV+CMSY8
-/Flags 4
-/FontBBox [-30 -955 1185 779]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 46
-/XHeight 431
-/CharSet (/dagger/daggerdbl/paragraph/section)
-/FontFile 20006 0 R
->> endobj
-20008 0 obj <<
-/Length1 1587
-/Length2 7216
-/Length3 0
-/Length 8262      
-/Filter /FlateDecode
->>
-stream
-xڍwT��>)��5���-��2����6�E��n��NA�$D�T�����=��9�{v�v��������9��04T� 
�HFPD(
P�3�� �bB@�(	�)
��	��CQh!��((���@��
��D� "��"R�@ @��������`��@���IxT��(��3��G ?�@DFFJ�;@�
���A�
�
u�f�� $���+��3�.+,���-rC
!QN
-� �0�3�������/� }��eB$< Sg������ , ���4���� �� m]��;���?� "$�w�?��!~;��`��;�
C8
ap(�@CW� ��_� 8��y�`p�����A 
e# +�Oyh0
-�A
�a�_���޲:��ts�"0h�_�S���`��
-�QYW����#
q�%��.l��yxB���4�B$�`NP
@(#))@= P������ߤ�/� ��
�pĊ��
��4�

-��<����I���DD ��1 �
A�Ot,
u��
[|�`
��� �����-�� H�����ֱ2ӷR���9��_PT (#!
�HII�
��
�K�o���p�"j#
� �?4`/�/
^���#s
��
�Hl/C����
P�~��������E��Z����	������
r��}�4���';zH�p �����(�A!0O��f�1 �x(#��-.(".���5`>P�!
v����*6
��"Ѱ_����:�+v���
-�
��UG���_�'*!	 �P _ ��D%$ �"�1�@}~�7 at X��`] X�� G$��WY� � 4V3
튭��/�7�m_a0
�c�b��oB�/�
��D�c���c`����EI�Ÿ���A�������
����M`#�����b��Jv�
	���_1 ���
��’�[{q��^SP�L�q	�{�R���V��[pu���bGd�e_��w&��Y�(Ss�C�
R�0�f��,|b:���׳Q���B�R�r08�}�*��y��^;A� H&�1���e��#V
-{kk�$����R�b��k�W
�u+�m�����#��T9�c/ڒ�{3hiCK��N�4�6�‹�Ş���0��.[�f
~���ٛ�4���{=5�U�4�7�t8���i��4�qxU$NT�R�9���y����O�y��/��䤯Jj4�³
�%)�T�e�go��j��L.O�z�{H�l�
�!X�s at ua�&DuI��h���s0ĝ����@�S���AB��
��'9K
� �*o�6����Eb}�������ʙ�^Y-��()��������.J�}�.�s�s�F��Js��V:����}J�
-	�5}B�Z2��1[���ѩ�SvT�5��}T���u�V��ʇN�_�
+S
~sKO	���U��4���s_6ɀ`���0����J��2�[��x�,�£��="[� A����C�����}��G��/S����1������}�:zlJ�5-�IV~�8�er$�~��z�O��~��1F���c�?�W?vzyy�����yȂC����[���������3�+���#k<}�Ծ�7#ZP��{��i��`q�
�7� ��������
������������@��eWU�ԯ����\y��xk�]b>ߌ
Pp=�0
�ۭ��|b���t�k���.P�Lw��sU�e8�i�;�qIP
-��!�-t,��`
ǚM�&�Nsr[)ПG؞��Ze��v%�;�CP�#}7f��=��1@��F 
-��.P%RZu������Ȝ���w�~c4�7,ߢ��`��ku)<��:����d��S]�Kg��	H���
�*��o���'�Pz�{J�>8��wOJ���1� :�-�]��
-��igmĩ�}d�)J2��g��l݃{�I��x��C�\��M�,���]Od!�

��
-N�:3�Ƀ jytb�Өi$�ꧤXP�׹Fs�眧d[�[J��sq��%�d��T3�ol��f>_�%f����������K��I�MQ����}�r���$�����O4��W8�7ajle��VFW=�f�L/�U,
jB���5�J�	�%�9��^$v����H%�X�x�4��Cp{�^@%&*���R���o+l��!��	黏Zl���UZx��
tw��KHE�f&i�9��f�?�u���I�m9 
�Aj����(=*��~�25޴� rӏBj�x
�~��?�环�?m_p�������g&���-��DN�+���(O����ɽ�5�~-?b���Z]Fnt�q����K��B S�]��v��J�B�N�h�"���1�h��Ņ�j?��`�����Ib9_Mh���F����i�[�/�	�
rMV�'��XS�R�zخ�
Ho3|���e�3�l}�d���|�M��|X�e9w*q�;aSz8��ӍL�q�Za3�x��HHX�`иt
����������<��h��I���x�%S_��Z$G^�u�Ơ�7�� �9���j���Ç:�o�*w��3#UQa�����ٽ:��%����e���9�ܥK?������h��
}�hq0��~���Lw y.�2��LC�����9�<�
V�>ЗZ��&�9Te�����CA���c����Vu�/7jj��Z3
-�Z�ꀳ�J"�>,�پun�^�p^�l�8D��{&0�ky�3�r<�
�Yؼ����@�~wr���
E�#Ԋ�oF����S�&J�3��I��:N]v���Ї�$�ۦA���GO>_81�5���fQq��u6�|Zϖ�њa�"-�БK�U�dEߦm�{��O1�Ry]G�N�N0����b>Lc/>
�N��v at .^�fPT�
-kL
��
-�����#E�n�r�\ጋ����h;9��R�s��*ݾ7B��q]"��}(�I�i��JGmnUq�;���&�qiI��θ�J�����md$
��h�y�)�Xn��V�^(
�
ft��)���V�e��]m\Tb&��_�ě/�P�R�m!
t��� ��?F�Ze*�
	�����Ñc���u�4ff����(��V#���dZ���R�<┙o]dW����ig��T����Q�
-��B�}��1�E�m#������QĞc���f���
D`FKlNy�+ƺh�s��b\�J5��ӝ����Z<仍��Ԛ�dx&׮',G��s{�
M�
P�e	�d�U�6x'|t��G������
n��A
���u\�[��ׂ9�b�)�le�x���3�Q��7��

q�N��uW��Q�^�h?3���'CM> �ؐ�g.�R��Ʈ܌�eq
b!� ^u{:d4|�N[�D�����ҹk�����G�K�ާ��C�(w!��a�������^�t:f�/�
�v��*�NH��.y
��Tu����{��
-���֮?���=V֞�
_�`w��e�:�gw|^
�✻�(�;S���Oܐ�w�4�	��77r�"QbǛb�����^�.>��;37y2�C��
G���EAL������9ՙƹ����Ь��Sj�q��"�}�>��E��cp?�H�,���N��?�v!�s
.���I�CLo����r�ǧ���Կ�Ԭѐ�P$EA_��{�Յ`N�b��#�)��.Ȫ�|�� �Գ��(��S�u�q��q�B
A(ģ������C�t�U�[���Iq1�J��!+v�'��Y�V@�[��(�#Ҁ|厰6+}�P��ٙ�����r�*oB��B'��j�M*u��<��3d�v��� 	�nJ�)x�_mQ��gE����H7o2�f��@C3�^t~�^MfWE�.����
�iu���sc"�ٽH�6S'CZ��������.)IO��D/Ì,a}�e�ƍE4ΐ��bnQ�K
���h��r��y[q��%�BG�b�%�c~EQ>�f��>E!-^R�;� [...]
-
��r
��I?����=��3K�I�v��5UDs���Q�Ō߹��xcw�"|��_#^�~!6ޛ4��ub�=�G'"���g�D4gYu�
:��wBؾE��>䨆��`��Q�B�����f��~pIT��wݜ��|ȑ�X1>>�h���PޓAB��=�f�W�Z������-�i�Y]-nڪ��H5��zq
�CX����TZ2,-���#�K&�Z�5��p;��
��p"��SR���Y�(!ep��"~���:�3�^��N�G�jD59��Ēb������=?�2 d|>/���~�)3����<K
�OW�M
��pq��C٫��~�U��e����d��ϻcv`��А�
"�w��.�tc
H�`��
K���b�3��k�t����:�<n��{gUb`�[[u�
LjIС
-��u6D_�&c�n��D�ί�.�%�*Ͽ������"�'f	7�2���J�k��\S�L13#�y\f��yfCt�m�g��﯇�%��ܯ	c`�Y���Z.���ӑ��������X-B&�2����<�@�O�	}p�
�3u*LV�
��Q:�}��:
��|��:�<��D�Dr<Kx���ad"wG��-%Q���5=O����u���E�4�W���;v��.��9��ݲr�S�k��2�
J�h��u�L�&��d̨���=�eg��
�1��OB�-�=����E:ޓ�Ό���^
3�V�eݝ#�@��m�xR����L�K虒��
=j���q_<�jX�\(���
Qf!q�yQ|�$����i�f,�������w��x��W׵����boFxn^>Ί�I.3��
O�ZVSl��,J������r"�Qt��Ήۄ��������~]be��b>V\(�('� u�Q�%S� �ޯt^�
?-Th�8дh�h��-_���;"����"�z5Nm�:���w<O�PRIFm9�Z����jB�aO�v�g^�
���~�DS�g�
-ڔ/�^&ܖ:Oz2�N"��q
�
�
n����{o�AK?g�^yB�u��]a�䰘L�H�d���9���$�/�o\�I��Oi
�o�ַ3�iS}iz ��V/����
A�_!⫝���yB#�'in�r��y?����j�����9i���4յ�R-����E�d�D�hn�,�[0P���N|�'�t��»
=A�G�r�E
��¶f`{��d��R4�u�R���
�R�M(xGB���x�I��}��IE:�Ӈ@��P��9�<�hw����F����
�o3�g���̯,Ъ��%0`z�>�}7��V�.k˧?�3�
=�#�ji�Oo��`�%�q�

U�b�:a�pK�Iqs��73�)
D����[��}<�+��{�
�M�a�D��~-�V�we8��n��Y�{nF��Z���X_3'J�=��g��z�[Ps�L�G�����#�d5�
ƛ/�'�˻��v��Mk6b�
�
x
4�R��̥�:����>V:W�J3���i�s9?��
-F�t��W���X^���-
W7@^�q37�it%Z���~
\��(��	�.3=x�p��r����,
d�K
z��l� ]���ֳ��Ɏ�N�i2�r�*���s��U��*I`������ͷ$�BE gw�Ts:&
)�y���
e/�"����rD��㯷X��۾32�y(g��F�>7\g�mW|qp�z��������㝈�0;��������F������(��]�o�h����̎z
Z�u�uc���g��z K���U��l���k
��E_-1H�y'ŲZ�t
-�+��oZ�N�+����>�G�v�A�F
�
-#U�}��bi��p\n���
��
-B�8�����:?y
A��:`$��g$B�(��f��*����~Ն
�c���@Bg?�l
#
-|��J��Q���݄<���O

�Ę�zwE׋�J�(�]�)���T�[7����
-�2)�0q�
R�["h#W�P�.ڻ/yGٲ8b����3�߰�I�ڈ_3.�+ٹ������
c�
-&;af���Wҩl��|�*���v�㝱Id ���ָ�'z�Sej�]���j��x�c�=d۬�4w&��l� $<j{W�*�^T�&+p��
�^�$��K�W��̠3�!3��nXd�Q�=K��X�.�������$$W��3�Sx�z��j�ϫj��*� ȩ�s3�"���|
�])S�!��G�k�y���G�}��0b�݀��KJ��Q"hB|���n{7}�0=ׇ�������J
n_rᯄfS�+�~��ǬƜ$��bT��|s�GS~: �
���a�ZÒ\?���Q��g���3�*�Jd��w�g���Og�aoF�����֕���^��Ҏ����o)��5$ ��C��	�T�v�Jш\C0WU�1��
�<|=%)�}�
O�&�.��CR-l]�'
�1��o%5`~�ǵ�ܰd�%ƓTF�0-�����~
-��⢁/
��.�mtUgҧ�uM�Ħf�T�KW���
ic
-�vɂ,�͸P{\�op�
~e�)~��=w�[U�#���
�TV�e�
f�9�}���%Õ�3�׿��1m�R}*/Z�H�K���^j�8@e;ʈn��=
���ou1䶟WIg���\�p�n��
<5����d������\c]o�(�)�M��G})g����yD�-ip�<*�OY>����JDY+���s/�D�MQ��UZ���w1�KIԕ�Y�4d6)J���ioU�q��;T}J���s ϗ�ZR��_lZާ�
	�`+�:wTi�Ү1�s�.��f/�n7,=I��
����T��V��1="L��
}�柏��I6h&W��{
��d�)L�$ا	V�4<�c�pwc	��Qs\���@�e���F�A�~�|�1�q�g�%-�($T���qC`��F�
-�	Cl*�����>�W8�1��e2%}
�
pfH��?��1��˶�>З�"�� \��T�9`��g'cDW:ܡ 
�
Wg�6�*�sr���mvf��">d���Ϙ�?�-B��,y�Y�k;Y�e�
�|Nt��n8bJ��7�-ov+Ys�к����ɨѣ��LS��Z1� v�X�;>*"z4�2 at .���f��E�P��b��*���~�hwe�z�viڃ��#"�~��� �� �;�.ŃMl�ˋ�SD���
y�Al�2I���
�-Х�c��}Ӭ�܄��d"��ڢd�5'��'劗 ��+JT�
-���m޽�v���x�H��n���w�H�@�q��&���o=��{����rv�l�	��/�5 ����n�t*�ޯz�w
�
�z_�=
�#
-��_*�bռ���&8�D5�Vx�ʼnTt��1W~6T�(tG4���W�^��j�
!.Mƞ����e��T�
�i�����
�U�.�Cd6����'�,�v�D���
��u�
p�.�Ao��f�s�p
�V�
����;Z��b�ʶG���w'B��K�2��T<��\JYPc{�ӻc��b9�����L�r�qȟ�
-ߟ��(�Z�v#:=io92$�am�S��!S�8�j��{|w�
_����2O�W�����i۾f��8/��辯�K�㺨�-𗼾��M��
1[��\
(i�l��L�T��I,�ٜ���z�;�oAޯЃ�6̜p1���:��F�n|uN����
���uC�Zb�e�
��/�����QOwg
��(��X�7)�?]h
�'h��Q��a�V�Wc̬^�tl��^�EO�R�H�,¤�P$�r����<l�Db×�6N�Y�����d���/uq�>�
-=�i9�oT!��,���7&w�']#
�n��[�e���t&���q8��<��2iy�11\�ŀ��<;[�L�e��
ZLLë�o����iZ
Y9����\��<J��m
͍Xv_�V�kzgg��EyB&�D�#�^w���8�k
�r��y�nw�6��*
2��k�X�A6(�;�
�U�
-�Z����At�
,�K�i��_�[kǽ�����=q���y#)RI�9������-���ϷoC�
߽��ቍ��1e�vjn�G�|Nv4UU�9����NQ�>C����0��$�w�89���f�n�YMU�F����M
U�̻�.�NN���|�R��y֘��Nj�!()6Y.m�]2�v8i�R-�eT�
�c��
��s
��s蝊���9i
�
-endstream
-endobj
-20009 0 obj <<
-/Type /FontDescriptor
-/FontName /JZUNZD+CMSY9
-/Flags 4
-/FontBBox [-29 -958 1146 777]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 43
-/XHeight 431
-/CharSet (/asteriskmath/circledivide/circleminus/circlemultiply/circleplus/greaterequal/lessequal/minus/periodcentered)
-/FontFile 20008 0 R
->> endobj
-20010 0 obj <<
-/Length1 1414
-/Length2 7012
-/Length3 0
-/Length 7971      
-/Filter /FlateDecode
->>
-stream
-xڍtT���6!�
�<4CHwJ��R�0�3�
�RR"
-H�tJ�HKw*Jw~��{�y����}k�z��{_{�����6&
��r�+�2��/��/(h�	������� |66������	C�����
-�n|�`�
P
�9������q~~ ��/�7�*(��aր&/��"���^�0[;�M��_N  &���w: �u�A�p@���:�t��
}Ey����

-�,������
vB�"\m��x �Ѓ"���Pk�e@
��C��
0��!�
-�#lP
`W(p�p�A�p�M���
-�t��4 mg(�/��_ 
��� ��*�'�W!�w2A89��^0�-`s����(O �[��
���|�;����>:P���7
��CB\a�($/���#߯27׬�V at 89A�($���)�\���{���3\8���e�[���a���g���A��`n\����BQ�0??�(H�� PO�
߯^���A�_�~>�g���f����A�ݡ ��
���Z��5
����08���߸�6�7�w�yO�o�' �������Fa���׿�Ģ�e�g�������O�羠0p$����7/~������o���t�QQ
n� ��"qs{q��
�?k�����F�P����7���<��K�;����_U�W������

�9��?q�����F�n����D�l���FпZj
ss��
-|�#rp�������C*�<��:0��/-�=��
�08T������d���W�f� 7����~��7��ϾJp���
-��E ��+�
�F7�0�#p���P���x��M
-p���A����V >�_�?�0���m��
����f���
ۿ�

-��B����򐆓R��
�������"p�V����t�$O��EMʵ�~�:]$��_�8S�;�/��D�SOU6`�X����K�m"5�@�ԛ�[
-­m��k�>y
Ȏp���~
K[W�d�->�`���Q���c :
-�VTT�#�Q.��X�Lnd�I��';�3���iJg/Hx�k��
��r{c��Y� mC���6zu�!`�m�M���g�AC�SN+d��
�D�����j���m�j�"fg2���
�E<���V
�����?FN%�x

-s��PH)�tL�)�)�}K��Q�3
on�LJI���M����������F���x������Ʊ�p��
D�f7����1�D���d	z���+2�է"ˤJ�;�k���D
Ϸ�V�E��n}�����0ꍲP	��o�xS&t�`vcꟽ���G�e�V���W�$�CǞT0d2r�n���;��$�ٌ\֭0�>3�������(��N}阾c�|
zǰ��&.���o0�%�
�*�>�'��W��{A&�~syaG��!kb����u�\�9~�kƷ��t�d6�������
��e���X������+o@[��a��K����e,��R�86�V�{#��V��T��l�X}�9ʬ���6����� ��b�Uq����n���{��
*B�ؤ��t��9Y�nj���=GFo�ܺ����_J���v�w�����L�^S�"h6X"I:��M�	��8����
L��Cq��ڏ�tg���i�GN���D�p燖�$(���2��]��4Rד [...]
���D�[��[\��w���6e_8d�|a\��b��Qd��v��i���;W��<�m!>h�L)�F���e���^��Qi��,��
�iC�x�a��^��1Fհ���aAq�w�D��u�Ec��
s�
-�I\W2��V��uỤȋ�X2�Xn��
Ff�oi(�ߵM���w)�5�	�l�{�}�4E��Ĕ�n�j6�Y!Ƃ������d=}��A@��|d]0�hɬ���I��ν���B��v�⶷um_g��qPZ�/?�1ױ�+��e�.lH#_��2��ŴѲ�H}��_���y
����2�yƓ?�~�V-"",
#�H���9DC�#���7����ٝ�}X���Ɏ֫GRf���4��}�Kє��މ�3f�@�5�;���u��+���O&��LQk�y\^����o�G�m�
��n��̞qfS�1۳�8��P����rb�J�b���&�دHo���y>W�_ SX2s�,B
C*����
-3�3���^�@r��
弪����Й�U��S���؍y~��>
����V����E�#;^:tvH���|ZN{�1!T�d�$�a>�����ˆ�"�C�x���;_���	
H��"m�Ӝ2��Y�m<�h�������$�n�	�ц�v%���D}���_�
6�̓G���>��e?�UM�uK_�
-,ү�A<�3������\�.nZdG��$�U��)��
+sm�C���W�z/ �_�ʆ��d���V�t�sP�kdWف6���m�LJ�6���=S���ƀ/��R�������Ɯ�b�bAv�}�P!]q�n�W
��p�Q��q�ME�x2����+���΄Vt�Q@~-o�
,�����m�n�ks���V��%�[��n	Xv�D������#��&$�����
-�c��FB�o��V$���K��՜�}AF�N<��6Uj�
n���}F�~�K���kŧ��L�I�	��P�YK3��
�l��k��c$�=��X*Fǝk㾒_�Š*95�cV���eP;tN�;̣��WW ��a��'��wdA�]Jf�oWa��r��{$�Z`a`���9Y�vy� �-&�m^9�uQ�)�>T6�s������4�f��O�7\?��&M�?iJ
��4{c3f�M����n��$���P�l�i�,���K���8��~^J"���-�J��>8,t^�C���1�B�}K[)z�b�9.|��r%����g4�T57%�`���m[��V�Xa\l%1S�����k{�x�7`���jK�	e�h�����
^��W�3Qޓ-ǟ%m$���ddq�|E'��%8R8A:f�xK�㑲�|G�����E�wIK��8|� ��B�ƅѡ+��y��P�s����r��d��,����,�$8�ǂ@�ұ���"l�
�jnF����`�k��C�����AU_� [...]
-�S�ܣD���o��aj0f`��n���tʏ
-��ӧ�D��au\�j~��J�s����^�kH=.�:��v7�JC�+����H

*��b�ؘ�R��;&?�
�����x�忝Z�9]*G�Q�5s�(�<T�A��r�%�cI�T��1�GG��������how��/1��ܛ
�z\2��^@
�[����9��G��\�Y耨}���?rz��{�
�u������k�H0,KI}%����O�qO
�{�M�_Գ0�/zb(���b�x��u�k� �-��y��s���e��h4�U
�b��%�_���3����ǐ��Ux��lp��Q�s�L_��[��P�o�w
=�E^�?|$���"�@]��vw7��j

�^5k��
6�n�
x�
������J
\/Zh$Ɇ�
z�k}���S��6�����
����m{��#X3Ҟ�ɗ�Űkeu7@��*5�2_dcC�B�j�u���R�d����F�����EV"�<?'-<Q�{
�t�8)��q
D�U��8�
-枬
=n��z�Npy
���Tn[I�a�.�R�Q��HS�z<v�:>d����dA��Z6y�����;j�9
�[n	� SR6ZwFuiE�������t �s�_Xq��(��Ux�I`�^C��^��3��
��WG�o��5���W�3�-�
o+ڜ0-.H�F��N�c��_�&p6�=�l��W!�F�ߵH���P�C`˰·C[!�=N������nFuk��c��6룂a12�����
U�פw�(���j�P!c��.}�?�R��8@���|���|��>�b\j��|��2�tW�����E�)��%&-�)'*�� �=�&.-����Y�����LTrb�B��J]�#�������;t
�
��O�l>;_�+��ٽ�p��K���
5��
墷��C�g���O�p�rx�=
*e��K�p��ZD�F��+Y
�֬Ϫ�Ǔ���z�
hC��P����T�� !w;��7��[���"��K����
�Ƨjٍ�cF{r�2g
bxd
�C%<���
F��n�zj�[�
��
�b�9�C���w�����c��4/��:��H���U�T���8P�F�F�ß/����Yub�Њ]h-�`FW����Mװ��Ý�p&������J!��8�kD���!���ç
MIY�᠐��F
Q��:i����B���h�@u����f�fS"�;ѬɣS=��?�4��۔��"��X&Dѡ�=��	��eI�Z���������yXi	3��r�1X֒�4�+�w�
�Hhf�{��04��_V����OL��mz��Z��k��e
-Ar5k�3
��U�> �yH��2��
�
4�l�Y�
6�A\��� 
rB��%�q��bJC_�A
8}���)T��h�=	��(
9!���f{*�LrGv��!�eތ�4��0�]�
m�)z�|�+�U�i�� �Y&��%�в�]�^�9ᘃ`O�>#1~3ѐҿ�n�z�$%���Ȕ:� _�*����
-g��
����`s�b�~O
p�A�4�!��o:Qm�q
 Ƕ��V�\B�*c��T�����xo$c�+zS�=��itɅ)�T�6��P
:!�
�7Xc�–kuy�s�dz�~|;��]�O�Bߵծe�C�v5jcґ����-Z��9>Y�a�*�wS��R�����ƚ
��v�ǭ=�������Lj6Zl4?Ao���鸨��Jg�Z�״)���d�L�mY�g]qH��6O�C��k�a�ɡ^��X��x�;2Tdҝ0��kto]�M�b;�8�<%��ޞ)t���x�1�S�#��?�wzj�V�Ӭ��A,g��1�n(��I ���N��ʕ�������]�a'<���}/3U�Ks	-b/U�x,�9f��cרZ�mނ�����T�G��D�;>�^
-s�
-V�QCM�Hk�S$�V�
P8�&$f��_�o�
�5�Z}��3jA��M
�V,��5V=#O3��I��o
-��e�_r8hMT��yg%Nz��sj��0*ma�![Y���$n��6���ډ���ʊ[���%=��G�<�./�z�f17#�օ��
�p�ZV�P$C�f���>�%2�ļ�i�.�u�}�8Ǟ�FIO
��k�!��� ��
n�%ʭ&�ab��N1[�(a����� x�
m�,yݎ�^j��ܽ9�C)���?
Eb�l�sR��'���
-��`27�"diPK>��r�r��^��8
��d�H������ŦU�琍!�ƋX#2��lY�0���"�Й�����j�]I�
&#:���'9���@����:���c&�3ڻ���^��&p1��c��X%���8����#N�b�����?�
o��} lg;$�R���]�n&c���ɋlW��׭O3x>���	*W{�
*� �?X�~��s�}Tq��<:��!
�-zס�
-$�� ��ϙn���Z��zH���:��&v׆�VxԟK���$F�]�� �XNr� �d���)M���V�]/{�ɢ^��u>��)�
�|��
H�U)$P���[�P�:�A�� 2���g"Y�)��YJN��p�[Ѽz*+��ra�������uP��
_|u��2��a��H��E�9�)UVL7!�f��aʨD��dw����� QSh&6
��eN�?{�vT�r>*M�J�s��
��|�U��W���V�q�\ȑ���X�{�W��*�'�n�P)3<�L8�	�'�W��n�BM����
�{ZA9�Gk�{�mK��YV�\̼�I��	�T P���ϥ1��8M�6�e�^_ 
A�Ҷ��+4}�c �7u~p
��4�y���uT�*�QȭбQ��;z݋7�
���S�ir]Ѫ���/[���~ʞ�g���ζmu��x������k�|&(٦
^� �S�v] ��>D3��*%�D�V�fh���h�@��ƅ�ں/�^|c[�I5���JP��}��6��k�A�s�QE���2�����h�oȤ�UG6�� 
�Z�T
-;��0�ud���JHumy8�`�crQ9��D�ǚv�_:)
�8��8Zɰ���_u�CÇ�`o&h(/6]	J�H�N�n�MM��)�me&�ky}��G��r\�8=���=�A� �
;v[|'@�f1�w~��8u�\Ee�Exhi��|��V�}d�ѷ=�[��WJ�V�6�=�\>��U6T�sGO9
o��	}3�
-���޼.F?J�pDF��yP�bhud
�
����!]7E1����y����g��/�(�>��7K��������_k����=1�$��&�4�*
ЗiE{�1�5%c�gȯ���"_�ˎo��L�q�9�x�L(���|� ����`�X�l�ۂJ��
{aI�BG��0KW�i�����Д��#Rq��ift��z?�;�Ƈ�E)f2>,
����Õrfc���\��+=�
�=��B= �+��r� ߈�b�w>L��Ԁ��{q^6�Ҕ̞z`"�?����K�Z0�H���,}�Uc*�����F�#�V��-~����5G��7*+���_�
���X
�$�
v�j(=�Aw^���ȹ�Em�dJ:���Ho���Q�dؚ�x�: �w�4aN�d���j��
Ln�*=Og#}8����p,�����������w,5_ߡA�`��
Ė�wF�o�.@����Ϊ;�\�ǟr��Ț�
e����}-���p^1}#�~e`�"�dlp/~8���a�6�[��U�N4�������ھf��k���{��$�4�����0�
���5���U������1�jͦ�R��c��\Ȗ
CN*��R�ĕw�W�*�u+�7n
-��Zas��c������ڨ-1!�Ջ͊�V;�T��f;���ճ�
����u/a���� �1!7��=KOt`����L��~�y�}9�\�-
c�����¤���rd��	��1*}�[9*�
]Tޮd��M�~�Nc��	v��
C-f
pF�?
��=f���"࿛���S��CR\Yk�x�6�'�ۼ�q
���v_<��۹�bH����l�5��?
-��m}/Z\�	�|Z��d�L��h�ѤȆ��)���c���`��f�1OR�g�
h^����~o��6E��?A�C�t���0P�H��Wl
=�
-���3�w����z
iL;k0:p(���i�?�i���d�Id��+m�C;�X����Q����O�
"E��=����W$s����
¤�h��ܭL�DE��ha�{��
��VWķ�zl��%
~�H�>�=��3��q�I3�Ŕg�y�K��_p��|;Zo%�
�M�}k'SԢ�M�Hī�C8�����D��:?���Z�cg�3�K���
)��	�|m�ڱ��F���"
��*�����R�\?NC;�s��R��K�|%(Jy����k�6a��g�>�����a,�5D`F�V��{���\J��cm�}Qx�3�X�_1Y�0Iz��ݙ,3*?^����g7��-�:��c��P�A��ա4
��F�Ahy��7�Դ~�����I�A���t�B"w^
-��\P��~��.h��<�MoC���Ɗ�0C�k��>��t�b�PN�IS�B��%9m&��.�(���� n-8aմC���{�=5
��o?$����_*��ʹ�8u��Dn,�DK��I\|2�#�C7�Y����h�^
=6z�s[>'TZn�Y�Z���WĖ3�*�O�M&r�01����y
-endstream
-endobj
-20011 0 obj <<
-/Type /FontDescriptor
-/FontName /KNYRWO+CMTI10
-/Flags 4
-/FontBBox [-35 -250 1124 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 68
-/XHeight 431
-/CharSet (/p/s)
-/FontFile 20010 0 R
->> endobj
-20012 0 obj <<
-/Length1 1481
-/Length2 7969
-/Length3 0
-/Length 8957      
-/Filter /FlateDecode
->>
-stream
-xڍ�T��6Nw7�� �ݒ�

H,�K-,K.�J� %҈��(ݍ���4R��������?��Ξ��33����=�<�Lz��
-`�
D����(i�� a>!<VV �
�Ǐ�j
�{@a�R��P�C@�{��
�
shx:��bR��R !��0��	�

-h�4`�<V%��/
j���+�Ö ())��'
���CmA� m��r���
0��B!��*�!�@�I��{{{�\<�`p{YN
�7� 0�x@�^0�7e���75><V ���W�f���!�{�3���q���
-������Z ]7��_`�� <��/ �'��rg�.u��
������\}��� ;�3����A� @���@���>��:�l���(�@�
���a
��!<�<�ο9��.s�ʮ`%��
����|O�p�������=\'W��+���
-��M���o�
-u���?�s�����
� �
-H
 � �����@_7ȟ��o�=� ��
`wO �����!=@^ �		@�g�-<AA j� �@졮x��~���e����
��O ����7�{��a�ξ���1�������ߔ�TT�� ��" ^!aa���8 at LR
��U�����z ��g��z�v0��_���^�����w
ؽ�! ���������C��y����)�w������D*����
�?q�
���oĽ�=���
������@�Zgm���Qu�~C\��u�P��E�:�Q�?c���
u���<���7 ^A���ݯ����7��~XB�����ʮ�0�����p�/�����DEH��
C|�H���
-Cܧ �� �`p��#��?��oS���o�^����0E ���0� ���B ~��0�s}���ub[O8�~�����?��/����6��w�	�|�^�Λwm��8�I'/����%v*gUv�"�T!���d~U��D~����X�
�)Y�����*�`l�	of��{�pG���!.=/P~�����8�	��E�5��S�H���ܻSէ��ln0rjM�JL���+o�Qܳ��	�|�ד4�Xއ8\d>�'��d�#w���x���o�fKB/.&�*�B
��,�f4�O��ؐ��i��Ȓ�����9�|(��]��-L?�̵�ɨ���$UY�j�C�v�f�Z�qո�M�p�y{���~,�\��=��s���^b��"ח�a���h���1��7�[��[��oP\xr�
@��E�.��_�U�R��p
�u�Y�1��]���I��]��ILB^��8k_�I5��3�*�&�gm��}��*Fs|��"?��2$4������}�SF��Em�
 [...]
-�!݄>F�"FMԔvUƬ��p�0?�+��Ny���0[^�:~�����)a��4b7'��h
��lV*����*�v9{�L��Z��C	2��z�[�_V�}|R�b>Hߑ�������A��6��~�ު�����'��[(Yld�k�&��%�"�.�[:�@'S�|V7��y�j��
�������/�Ƶƹ|\>NR���K��ݝ'䃯�W$��!����ɗo�n�����jv��;/6P����^s�%���r��d>�:v���Ppp���`a���������>��@u�ȷ��T at q�y�+]=�>�
	qj���ȧ�9�5I�9�]�OO��=�?��ir�KPT�\��c��.�w��/"`���91)r�i�K�m��#�U��k���ѯ}�i�o���
�3c>�d/�r}{����~k
�Ћ ��z.B�
�wX�����hl��t'Ύ뢜�I}!�d��^���"+[t��� n��{��m�;P��t��^RNZԱ� ?ʨ{���Q��계F���H [...]
-H�
%
�8�ȳ&[8�Z
�>�^ ��0�E/q<�(7l\?-�g�2VQ¿�{�	�c�fۥG�s�hvI�)�B�4%
Z|ԺxɽV��'D|�D��^�}�t
��8���,�n3`��Γ�v��M~�)ѵ����zf֩z����9���S=����|�f�5�GG�Æ�
����F������B�v>P�'�W #�D��H�G*<��^}h- %ȩ�%�';�&C!+��:[�q5+�╫���zF�1���W�����n�,��](�7�_���%4�#���b� ~�*��㷬U�V4�u�Z�o���{:�(�qJ�Q�FXs�ö�m�༫$
�^g�
�q�o�'``s�!��
��o�������?UW�n��P��v	w3��\'�
��E|0��?�
��jt랹����^L5ɠw�����
��O���^�w
-��t8��ƝC��{�K��o(�3�Å�K/^v��
F�@-đ_DVi�}'�83�d%'[�t�
���
-��\Dd����Mp�6#�;I�ܩ	�w˞�"���K�0Z��!�����-"�������v���r�O�<{}�Tm����M��"2a<���o���4�ؒv8���<��[��l�邿�i����L��>���h��쮸Ѯ�V�P��r�4�(׏:ģ�Âq�6�L�w��b�|�3�'(����▼�%'��U%�k�]\$,	!lo�a���_!��[��Wؚ���)���7�+0.4_,Ƀ�@|���l�6d��)SQ���M[#������o���1ȿ�KݨlkT�1���Y���b��
;�ʹ�
�&�
F�I�L&��o|o֊��
�DK���bЌ�~wr�or�:�4%��e&J�ڦO�m�N��Jq�aJÀU̜��S�);~��Ś]���
���g�6y��£n��` �
}
3�
�,��i1[�As�r��E��V�vd'������ %�"��.�4-����@t���A[�+�� ���E1ʆ���EA�5芸��
K�H5�}]-`�Tk��k8詿	k�Z8z|�^�n��cհ`H�/����wN|�Ulأ_��XC�M�z�d_���
P[nS�7S?���0��e�N9]�Q�
��S
�����L���k�2��P�b���a,�<A&9�%�e�ƴ5*�#��%*9�Ʊ�T�����߫\�JD �с3���.�#�eNx�n��׉�ga��Mnl.ԧζ{�>G�oݠ'$R���"{I�r��J�'�P�p��y�B�fʲa�Y�^y2�I3-�C�גJj�n at f1�����s��ho���
����k[�/Ϧ�EKg-tso);��
-�������EZ&
�Z��V�`�"�O�{�W Ԓ��J7#ӀT]�Q��
�

-ߏ
��0-8a0�]�
-v��yW �I�W,�e�%�Q@�����g���U�U��j�P�L��
`[(�����
5f���Ï��Wjmd�PW�)+BÍw�V$��X�xtY��M�*Qb��@���|ty]�B���'q�5@�z7�IYP��S�*1�;n@?��G�
�o�pgNM�X_|̺�(���:B���$�54RG��~�6v�(�&O�ҩ���Yױ%�˃w����u�&���
�ړ�鱜e�i�ږ��4M��$�v[�n���4���ȵ�z�ș��l��ۈ����lF�s�u_��e����EM�4G
��
Z���
���E'�<�B�N�)����V>�:�/x���J�ɏ��#	`qN
MY���j��U_l���G&Xb����C4>�vt�_/��5Ǧ�ç�[��
_����>��C�6��Կ
�uҳ�	�A��ȯn�8/�[U�d
-'�}�5(c�y�Z�˟���R��¦��%�V��s���mt��+�>3�ɓ�-�2�^l��X�rǻk'r5��D��7�I�o�ѺҨ|d��H��'�]<_G�]�n�*�m��H'_�Z	�����a�щl1�|HUX3Z�}�LDDX
-��Ha���B��ob�q�=����'�
5,��x���n	J<�����Α�f��b�b֖�b��ݚ^q��Q���-�0�@��,9����eO���+�e�uoY�;&�����o#� Q����A촿@f� �
���S�
��a�`�W�4f}�o�a�,��I���g���'%��u�E��2#
���.�DU[��!$V	�aK|:F+\p:�s9�� {o�7֝�*��AM��J��
-s[����i��3��{�HH��^i�B?���^��:��y�EW4O���Bƾ�� #��T�����\�@��c
�֍N��~�<����z& �b`�U�]���#���HIw���y�uP�򴮚p��œ�֚,(�
�Yd:yR���\�ޖ��U%JQ���)[B���΀����
�Σ|�i����W�..���椕+���;-���+
���WG5 
��`��<�+^�x���M\�AtRCw��
-�=+9
-7#���Y?�0	��(��I20�f�����@P�pthtn��
eք}nQ�����"+nD�`���r��|�6l�}^by��
��@i�����q�Y�'��KrǾ�R
-4�/�V]��4��4�o�Z\:
��o.�
�z�
��
����`4�����;�
fr����y5^Ý�!_��g��(�`��T�Mm4EIr����!�!��z�*u��� ��^ղ���6��Go
�2Xs��-uے�iē�d��),rv
�
鳯H����mFo_g��p# ��'��>�*�ISX�ɀT
-O�����*�
-�����aR�dh�'�v�c�F�7�����6
-L�^�1h�4� 
�+��U�Rs��a�D?�eS�S�Cz��
���-��;
-��b�R]���.i�\���
�J�7r�9&k��ғ������R���?�lj^
{��"�8�hl#��.���
-{��	���Em�w.�d���Z�im"Br3��z:�+�q�OŽf-�82q����.���*塄}�:*ˉ*O�ݠ��o��vQ6u�
�m�<��_i��ė5�$���pF��'@��0�P�OzF{�i6��
	�ɔ=�|�m�SF[��O!�y
A4	-{���q����d\T��}�$e����~>��
W� 0� �ST6�MNx
�}�l��3�49y9��WB�v���������a�j��ѵ�^~�Y]a��o�"/�Kz!�6g��ʍ٫@>�
�\�CT�=��M���kJJ��ߥ�|e�����6Tz������o?����Մ�
o� �{Q���ڤ�꼲�T�)�{(�Q�G�d�{l��/�#
UF��_,~��jR$E�.���W1qGj��zf��7�Vz�ڰ����v5�u�(~З�ֆ}�ˋD�^���.;q=S�3͓K�W��j��g��,A� ���;c
���v�*&�^����\"p9��;�W����Q, at p��ɧ'��&y�>+�Ơ��R�>��}nj]�a�a�X���P<�~�E.A�$��w4�C���٢�}Vѳ��eӒR��I�B��4���]nj�a�'�
	'�M��'4�?�#=(g�,%^G5����O?�Ğ��N�{c�ͭ��v
#�߽�M-�*aב�&֎f��V��Ë�gG�8^�_��
*�
1%xa]�BpV=�
�?��/e��X����t>0s��Q�%��

�x[m�=�*��
x̲kp�p�[;_q�Y�ˎ��!e�X&\j'���T/%��� �K���,D�[� '��e"
-�4NӋ����
h��p�������(���\����7_�U��v	
�<Ap��C@�T�x���u�G��L������E�A���(�K�!�ô��7
(��p��4�!��6����,�[�eS�ƻ 
�4�����oV�sHO��
-�L�
�)�ug���l����nO�^R
-
�j���f^-:�z� �<g���o[�Gu�w/�����
-1���t!�{�
�y�an[U���I����IU!��n�h�=�"��ߎ��3�h�
-�f����D �M�[����WV6K\xAvc�N at x?��3۬L�Z�Q�k���jD����~.~��Ra���k��n�KFY1�B4;8��-�1�7�"8�@��q��-Hd���Y��V��Tj�~0b��RT�0�
�p\�S%*���^� rZ���C#�2�l�:��`R��
{�7?4+鬘F�f���m;}����
-���
Yb�	[�ea�v$�$��3�M�������5��U���V���>ѨJ�\t[{皎��-���v�
/(��:�fo�<�'Dn
�ڐ~�N)���;c��h^�W�̐�����7�l�ɒyI�
�J� ��H�
e�F"���v
*�����p@��	S3SE8��|��)2S/%���H�� �)�W{{�5��V�y�F���oN2̌c3
�Y�'@
�JxW�oאۤպp��όW6��nS����щd�a���'�ɲY�zaK[C�_;��>WN��ȣ�
����>�m24N��+h
í�\MZ�_�m�Zn�fO�����t^
^O

i����
)4t�4��lxL�'�FyM�W\�ڞ�.�̧�S{I����\��
���9��]��J�<��G��d�M�)��>������!.����S�
�|;	�e�
z�T�N��Lj��k�_��4�
�!g�=gs2Y!����-��Z��~
p����${D��v��J��}N\Q�W9?&��[5՜�?G��KD�e���Iy��:_�L�:�'�46�UUטW�n}E*T��3�uyU��8�у�a�rI��*p�2}��&/֍�T�J������u�-��z�*lZ��Xz�f�2�d�ܖ���d�>ț�3���}LH�Q�klvJsG��eͰ�ES [...]
0�� $go�0���1�YBN��K2J�J��q�y��|=�!���$���j���prX�H�:�����Ѫ������?���
f$C��{�;�H� �����,/���T���
-/8��c�MnZ��*e�|��5z�*V�������}�ު^��Ļ0�Yz�~�0�����C5��S��ȓ��
-��!b/1�|ތ�H%��B^s���a&�=}�$-��c
J,Ls�#y,~���`�Hȱķ�U��J-4��	D=���,0�f�W7'���
�A�1���&����bG�X��iu��jg��
-�ZE��_�fya�g���MﭴBQN=~���Y&��D�><pb-�Tղ`eg+FO�
y� p��YWn�CF�EG�>�w��vu�
-'�I��U�̉��ȇ���pK�za�7�T1� ��e8l]KM�i�#N7�h�Fs�*j$��锥���]yKCO^�����>)�<���􇩥��uܥ�����1B�*��OO[�+�5P���`�����7��"2LK
DMf(�QUyO��w�I�X��acU��+�ў�zi�m�!�4��/�C���D�������1����씹����3qD2�x���K����Pv]���6��ۭd�7��R���$jʼ;k� 2BL+fWӲ���;zK�9<m�÷�A~��
-_uFi1Ƽ*�dt�m��2s���]\5���(��'��DҮ8��e�S���z�q�ß:�a�Y1��3ǚ
��U,~w���VE�]�)}� ���c��{pO�s\��pĶ
-�BI���7:�B
��d�
�
-�X+U��)��wd��Q���D�����3-6���
�'
-�
ǿ
`X/�KT�4;�E#���\�������{"��hm����f�,�U'�Q�|"ju۫��d�s��,#&p� |�@X^����V��ͤ#l��I:0S�*����qG�
-
�߱B&uCUq�2�-3Q˨���.�Za�=�R,됻���C�|�i��T�N6�[�����Ϭ��������m9�#d���Jaӱ+%�
-��1KќWV]:ۃ������E��2z�9��!��%��
��F
���.Yr�0�>��y��P���	�\�Β<儧c��`3X�
RЊ
������
�1/-
-�Jh�`*\m��x�ߢݾ��H� f�4�C�v�~�'�,9�,�P����M,�ɏ.MU�#a<��*�7|:}�}V��9��������N����Ψޱ�vB�q? \��kIj�c��g~$׽?�J/L��<��͋��D"%��K���^���e�l�=/�<u\
E��$�s�f&tk�����﷈E8@�'E�;d������e����Q��o5���I
R�oDK��=���~�o��wcp�+
~
z� #��*����#��!�=5�����%
�{ݤ�<	�#9���@�����d%
-endstream
-endobj
-20013 0 obj <<
-/Type /FontDescriptor
-/FontName /BKKFBC+CMTT10
-/Flags 4
-/FontBBox [-4 -233 537 696]
-/Ascent 611
-/CapHeight 611
-/Descent -222
-/ItalicAngle 0
-/StemV 69
-/XHeight 431
-/CharSet (/e/l/o/r/t/x/y)
-/FontFile 20012 0 R
->> endobj
-20014 0 obj <<
-/Length1 1503
-/Length2 2523
-/Length3 0
-/Length 3465      
-/Filter /FlateDecode
->>
-stream
-xڍT	8T��&e��-G��a��
��ʚD���2��a�
f3Y�PLY��R*J+�V��R>�,iO%�"���i���������3�~��y��~��9z:n�h
��#�ЈhL�6.

� �lL �0zz
��
N�1z�@� B`�/>��1[�� 0���d�hB%�R	�D �}'"|*`�
�8��1��� �g�����]��+�e D33S�T9@�|�̈́�0 �+��\`#†@���X� �0��LJ��3yc��� �C� �
��0�L
-\�<�2c�
� 	��7"~�p&� b�� ��9 @6:8�A���L�
@4&�h7]=�����l6�
f�b�� .��w6��8�	s&�L� A�aL��d����3{���
-��'`�`��X q'%�'۠�lsl
�����l!>�F�]��v�A0GL?��M���=a($t����!�Ϙ?((a� �! (b�'�{����$q2�*��F�?T���&B�
!?���5�;�� b
������0��
��χD�7�
 L�~����� 0W��>u���47G;�o�䬭aD�Hd@YIL�̀�ߛ���]�Tԍ	Mo��� f��G�]Eش)��c ���+�:�?�� Pl�A���?U���~��3��7d��N��S���f� �x��9T��
���o��m�]@��w�A�D���s
#$��D �
�������\�4����¿r贱�Я� ������+��l�39u$�	���b
5�B"��xr@є��1�� U�!|��N���LƦ!���@3 ��	�(��d�H����� ��
4�?!	m%����a����O�
O}R at P�1
��<.�8��"�v�ѫz��95�F佺�4��l���OΕ��n����?S�%��z9��N��42KBU�()���z��lT]��W�
Jz�TQ�/���^q�>b�l��
~� ��Z
�+c��_�3�=�~�Dn��U��3��i����i�-�
t���3ٿ
Ϫ�G���yx'
=�����4�ݳfw����o#Ь�Ui�`";R�e	���g�/��L�����K�T���c)���v���¦̤�y� ��G'��^��
����W��,�z����U΅su{�I�~~bm�5� �Ȓ
g��#i
�
��,��8T/M��0�Iz�y�
����m�a�􃏟u�MOd�)�'��0L�6�7
��e>��v�Ƕ�.qcϘ���PfBr"WB�˰�f
�(���~͌�����,�_{�=�B���US�k響��=+�Ky�M�A���(�"e�Z%??lqG
�:d�mi|�z��2��¢�������ix���
�Y��,j��յ�M)��j���l���2��^�W�ӑa �VbH��L��s�A��K��ػGr2�+�Ǝ����rcn���G�>�O�5Rz��E+�j��+��
s���������m[��x��v8�����"Ƿ�
��-SfXb�������r��l�R�tU�^Al���N᫪B\ov��aE���
֝���Q}�+Q�٭�
ޭm�t�S�K,
�T��ѵZ{?��n�y^�.�j�$��d��?�����_�Ƽ�?�jB��w�na���JM-��~�U�5��$vh���ҫҸ댉B�a�YC���`����A�y�R•맩w�L��g�C\�q�D]���ze'w:��7ٗ4�� Ke��H��4Ho?�n0�E�}Bc|i��-��ŨY�e6���	u1�Z�}���DGf3�
ᑥyI��#^+�K�k��Uw%ŝ�n���_���5�����ϴ��s��|y�u�\ⱪ�:��m|	j)�Ew��x
-��B��
�4����cd���k%i1�#9�$�A��w�p
����t�19�٩���%�j���^��د�y�U����5r�0(]#^���f6W��~Y����2��q��ѓ�Hm��	�9Av
��8��"ل�J֑�9�����
VS��
��J̪]>~U�幜��)����duP�T�v��R
-�&n3(k��jH��u�u��
ܓ�)��T����Z�ޜ`p�&�ȧj�[a�ވԡ���]��Y����\�'��NKj���{��]a�l����������&��Wm�
-Z}w�=�� ʡG�Z^:z�w�%�[��b}����a��yy�f��Ie�S��׋��џ��<>�?bɊ�Yd&i(&_&o۶*]�e�g�R.|3�1w6����s|l����������-��
-.Y��v}<
�%���{�)t9^{��nߴr-��a)��C��j
c�,/���$�55
/H�U�Fc�
�ؔ�8'��i
��E&q
էT��5��])�> &�͙�Vq�/�����~��������r���*R����_��Y��Y�]h�q~�;#��_���T��
����s�w�R���Ɇ�������y/7�/0�X�A�f��6�o�q�8�͜��+�������B��:Hq�8��{�����}�rb��;
�g8����'�kv_�wy)
\�~�G�p
-�
�}o�ǖ���}������k^���k�KR���"�:�Z���#��5kL#<wz|�8SM{T�z,�!e�W��'���*��z��>ٛq�ؤ�Р��m��0��=������53
#�Y�7Z��9cO)�0y���������\l�l�KY��S8�
c8kX�5�˺ögc�Z��n����E�
������i�O�
J�p'`Ge��ۘ�1b������8�����o�UTA$͑��
ԃS���1�$��u΀�̘E�/�Y2񵷎)�S4<���uVi[�����n{JRU}V�[�"�Y���uy����#�z�u)�T��4-��Nϑ��]z�j��&Pj��g��5+p/�ݿ^7^U
� ��d;v�e{�D��{�1�=�N/K�=J8�ž�Ԯ�y��p�N�6�q�bً���o�oe�r�:�	l=n]h;��)��pu��9���������=&�
ߒRncW<<�is�K�^���0��<-��a�9G�Ԑ�s=�ߠ�p惷�a�.L�EC�޴�M����kvsSo|f|����

��[����M2&�Ҷ��X�?ci��}�Zv]�疞��
-�*�
WU���ʒ+�]�$�T��J1���(�>7#{��L�釧�qJ�
�
�R!q�L����\柂�����=]�`a7Ʀ�5�[�.��9���J������|�iz�;�!�>�.Q����TU���PUI�&Һz�H��ر���=�6
;ev*�iu���e��s;�������ҭ��ij��hq�8�t9B�=��ycS���hx�A;Wǭ֩u�^߮#�4߰�b��]r��I��e���~��:s'R��N��ž=��\���E�}��[��e���΂����F�*Ҹc�x���t̾
-endstream
-endobj
-20015 0 obj <<
-/Type /FontDescriptor
-/FontName /SIAPJE+CMTT8
-/Flags 4
-/FontBBox [-5 -232 545 699]
-/Ascent 611
-/CapHeight 611
-/Descent -222
-/ItalicAngle 0
-/StemV 76
-/XHeight 431
-/CharSet (/d/e/m/n/o/p/r/u/x)
-/FontFile 20014 0 R
->> endobj
-20016 0 obj <<
-/Length1 1431
-/Length2 6799
-/Length3 0
-/Length 7755      
-/Filter /FlateDecode
->>
-stream
-xڍtTZ�6!]� ��
��4�)R��
00����p�n�.	�I��[:%DE����������}k֚���g�s�}�}�Xt�y��K�2���J4��4�  P�$dc3��a��pB�'$
-��K�C	�o0E�'�9� B QI1I  J�ED %� (��PC�!(B6��;jc�����a�	������s� �V 8@���8��h��VP��_%8�m�hGI~~WWW>��������BѶ =
-�t��?%�@����� �Pԟ}�5��� n �
-Gݤ8��$�fw��c
��#�'Y�O�ws |������+de�pp�ݡp�5h+k���< 
����7� ��!�::�,�
 �(��e��:�Q|((�F��enڬ+ 

 p4�����H��M���_�=
�
-��ke
���� ;;�¡NΐNJ�97�?�


-	H�
  N ���-��

�
!����
ޞ�G���
�7�r�C��@ h�3���?�^
- �P+4�b��S��X����$�
`
-���  ����?���p��?�_W�o�D�PQ���促��7��8�WX�ƮBB �_��]���%����>�|
�F ���pӼ�t��6����{-č�! ��oZ�|	��g�W����?������);�`��
��8�
-s����
� ��`�s�5!`���G�A7�!����>(J��@�V�z����*����#("
- !� wB�AED �7C����&���@ߤ 
��� k�����o�������7�_��7���fA�	�QN�7O�����
CC
o��w�_G�o���o�Dތ�/��h�k��
�@� V��3+� �ꀖ�J9Wޭ���l[F/9y=瑭��x���/V��r���n��P�8y��|��T��&^����E���V3��M��}��������������c7a���e;9����R��v���t/�l�nW��}/��4�0�+�b˱̘����潋�E�ɍl��t�"k�Y-���� R(��dU0�|�c��@�A�JoBw��bh��S~7I�vֳ(�}Ϝ[#ʮ�x�
-�7��R��ҟ�b
I4�:"�X�ک��$�A�`�J�δ�F���K�
����D�jy���`��������8��z4P�i"x��;dNa7oNޗK�8����$i���p	��7nw�s>��̞v]xћ�|�$#�H�_����q�سzy;&4�L}��lI���x�GD"�VM��`�
sv��dp��JN�qU��z5�hUH�d_����1�F�9�$���]]���Pn�f�!�����q�����
-ho-�
:���n���t�M\�nl���a��P���~ɇ�k�5�b�C��v����3�CR�Dѭ�i�H��5Gr�y�pַ��~�<��h���|�}zut�v����9dM�����As1�~
X�[a���oMr��X��#!Ӕl�͉��}p���|Ƴ.x�=�/|ϋjL��Qi

��>^-.B�ě�FV�#%�%����)=
��׼�g�S��m�϶�
��Q�fωA?�g����q"�!����t�7$1�������x�,�ߏ���a�vӅ��G�Ld�G}�:qE�(�_Y�IK���!
�
�c��#�3b���$���
-�F�4>4���A��.D���խ�XR,
��ᤡ
�@&
.39���(��
��Xt}�;�j^8�PY6y�Z
� }
w��N��>�x��sNʹ~-��q}aޮ��il��*���V���G-3_h�E���q��#�
ܟ�-�����N:ޱ%�{���v~��G�
-&Ҿ5-��(fO����'�·/B�����'�չ�����7�ُ�����}�	��8gI[[��,��n�ȩ��Pf���:�1De��S��=�\��Uu��F�U��d�
��L훒����ۘ.�|V�7
G��5������)�4#M.o��罏L+��oϝ����c\W
�0I��0�m˜�U#��|8��^
-���@�߄��UIV��N
-}j��nZ�f�XE`�#��m�E���i����"���ߵ2?8�0�CQX���n�
-�
D!��	{�(;��4-e�9�a��<���<ɕh��4u��ǵ�GV��-�&���
-S7��l�Q����
pu��un�_+��͡!�
��qs�rNM���L+�<�o��=�9v��Da�=+.��f��1�)��#H�3�*n��]�U�����a�|wL�8���<A-�hSB_V��t
�Y���w�N��ռЬ��yo���
������W��	�ר���C�ԂA�0
�<�fqɊ4�ڬkO
�'
򍯊��g�y���w1}.��YZ$�t>7�����~ER�=�ˮ�
^5�
�J���0c�CRq]�����繒�
�w�y��':�"�5�R\��*sigk��_r�))9B<<*�G_'��1�����p��	,��)�u˫�ϛ����7ryeP_L��M��V=X
�
��
�K�5�x����O�����"*CK�w5�^Z�66���1�����h4��5�]�ׂ� �
�<�C}[��{}
h�h�|�&����S�Y�f�l�3�)�%
x$w�h�O-�.S�hB�b|VM'�6��sWQ����;�-�%�	�w��#�)^|o#�kY
Hef���������K�Ir�rO�e{� ;����Geũ
��])��"���p1�B�r�\���No��~�I���،�<H���7I
�~�zD�i2+ 2wlH8��R����������q��}���f��l_�@F_��#�yh��FK��{�
��Bw4��8ZC>����#���?p%����(�����U*��#qR
�R@���k9��*q����p�M�

�5��@�d�e
�X*"�k�}�����U�z� 8w���D�^�9��V���	�C!J�T>���
-'�40}�.�A�PƆ����
:����u��a[݈pǶ�mȝ��L
��a��[.�T�<s�cg�=Xy�
�����uU�ֆ̴x��K��q/D[ȵ_��9��N�pL��LD�mh$��5�6�q�<�
��:

w���rl�?��0��4_$�
��4$E�IT�w�!�X}�n�A�ܼ�}����I�%TY}��i���`�0�
-��n��qD��b��6E�;�ډQ �q��ޘO at b����⚙[�3hG����+� J~�O(p�a��Y�ד�l��yxט�!�K��LK�1R!P��qK��X�Y��)ϲ=� �V`e�^��4�l	�
�|fm��vx�@V��	k��e]w��q ,��(���e�p&~�t�s�[��T*��^)�׃P�N	PL�� �3{�w���^�VV��zҜ$�>�bΆ�
M��
�]b��i�uHW�ھR�{��x��^qt���W��.�-�`
S�;��������Xd6�L;�$��a#1�

�wG����/?)�Yg�O=(�B��Zk���%Gfq7d���V^ݝY���N_�|����&뿇�nZ*T��b�`"u/���l(�?4�p���#�u;V��c����S��e|5	ZY��O�!z���t�Cce۟w�X�_
�0��3 [...]
�V����9
-�T2:9��N�%O�e��$+y[Z
�P�j�S�)Fk��cw�)b�V!gӰeSX�Wz,� t�j��
V��S3�HyZ��l%�߼xy]�k��y5ݦz�.��d5z�
0�'R�J?������h.yC�)Ew7���r�ț��37�g.���
��d	����y���$Q�cU�YU��"���
!ᴕ�/O:��o�*��W?����SY߮�G�*�5��1Zf�%׉�8��|��I���H?�!J��y���8T`���v:�E��G|D��N��L���z>�T�э�<�>yn�+����P?�o^�X��QŠߋ����шM�B��[���	����÷��rkץ�l�lw7�HI��� �͔Q��_��ZS1��ӭ��L���"��K	���yX��b���]�Љp$�٨�۽�9��!��B��C@)�M��>���B�u�U���#QY�%���j��A@���1����}��q��Vih�ք���v�pL
�����u�;a�5˗�<'�Y�1cK���`��c��k�Ac~�
-~Vfʶ+�)+b���˂�J/�
���@O6���ֻ�#���	�A�a�'N�a,|&�%�8�D(K]7���r
QX�dz�!R4Q�� ��d����U^c0O�_�i9�y�w%�r��S�@<���S�R�mj�
���%*҂�w�X�.
J-�>��P5���Mkh0���ſ]-�g��m=r�a. ����3��
��	�/eun���*Q�1�:�L�hN9������Cl.�5|$nO#�51v��[��=&Rg͖�@���>���e[}x<��
��iY���D����'Ѯ$���HtZ`�v;�Zdl �4�[��Th}lܻ2&�rA
ݽH��g��"��|w'�kA��׸�W&�Bm�{�QNx� ��b��u���9{�, at l�(��L3�W��E����K�tbn��x4���Pj�!/�
K�LW��A�_;KcP&2Ltx[�9>��#zwV�)`��-�_r�:f༔9
;�-챪W�ۢN,E
-~^������|��s��[���v���"�e<����
�={)�iI�}�=<���(�2��"��U`Aؠ���{
�(��7�:����sQ^f癝��
-���H�6�X�������>}
:�]S/��V��V�[۵gx6C��&>�M
��S�C�>�cg�� ��Z��
-§����j))PPoυAS���w���9�Z3h?N}aq�G�m�ϥ����H0FLP8��/�l%��
�
i�cx�t�baq���r?;�P��H��s"�N�Nᔰ3e�Ӷ�!Ғʾ�p��Q�ȝ�Ṉ����9^
���FO�+^�`Y�RUQ��UI[vseXd��|��4Yw��`��l
y��=8]����d at E���f/ZJ�7�
A-o�	

-R�q� ���ۃ�Ռ�M�|�\Pͽ6�H8�iml�dwL=+Ǿ_���)����t�Ih��Ǒ$|
-�=��J\�\�"���}B�}ć�\f�Z;�Q��:��g�$	�"��cU�A�g��Z��1���q�kM{�l2����赐M[3%���"Ay>ǴO#�
�]G�	��^�	�������.fE.Ý8�~�)mꃒ�!%
Y�-pq���d�3�d{6eiY²
-�3o�;�o�
��;
v�u�Y���4`d�h�7��6 ���
)9�S��Cޜ3
)�$Z�/�4QZ(��}��w�;YIXѧP�a:{/,}���3z߲��rQ���c��
ljte��J1��y;��d�p�K��,�����\�[�g.@%(%���$;�!&x�@}T��5>����%��'~�����o>�ŵ,�i}
�ۻ
B��
�ƇP	��$
-�>�6���U��
ڒ\�K)�^��L��sTόq�ɲaLF�^S�y Eܘ"�31���m��:��
#��OB�=�H30����B�p	�
�
n�B�K�i��i
M�a��x�%V;�3�(3q��u�Z��+|Ĥ5���<�pj
-7��2��߬kB��M����I.��s93oU����!�ٷ�	�c��狷?��/�t�æ
h��xѼ��o��#�dj��DO-�j�YGH���ںj�?�Q
��L�:��;y��O�x[��u�;ų(�����6'w�
��
�)�`�a���{�B;���ʶZw���S��{4I��Om
J��e��E41�Z�3�x9���m���
B
��wƾ��梠P�,zj�r�,�߯�Z�_��w������n�� �G۰+�B�A+�,�t�^�1:�eI���9���#<B�h�`��d�6��ξ��o&[�,d���Z��� B3�6\&R�'-����O�UJ�I�$�uT���o����?�r 
-co�G�tѤ��5���;� ��Y��m9d������IY�d�-�gz#�i`�BB�Z��tv�~X�}A�6����t��T[	
�se��W+��u+n{R(���
>�f�zc�s

O�o����7�{9%��9\�kc
�k&�M_�1���>"o�,Za���y����{��о�%<B�
�G�ܷ�}@�T�?Wh��)Ql ���C2,�V]W
-�3w�=����Ř\Xա�ύ��]�Ԫ��~"
�]��X��Âfl���|"�.Y���U~ZԠ�F7���O��c+�
�+fR��go���'��Hz�\�:�)
�f�\��"��
-���!�Nc";������p���G�z��ȉ�(���wBdG�do�~��
�z�MF��u��X��@���6
�:��`�eeŒ1?�O]_�
i�/?��엝bU�MG�*
�Q
zl�/�3<

��H2p��?3�0H������
�����uV��m	��xa
-Xz߼4���O�������0>6]dLV��}����W[��U!+%�R⯑I�[pI��@�R2�'���'�}�
-��~:�%of���h�l��
[|����ó�A�ڑ�y��m�f��|�]�E�C��̢-@����w��C��������3�ǝ�	�����fj�

2�<���

���>4�{V|7F�J���uf���_a��8�����'�j�M����C�
��aNw
{:���`]
���X�z!�{�����(�q������"�݊��UHU_����+����
����@�^;z�G%�
}":�T(I��-��+�Ċ����
�i�ބ|�����*�=%k��/������	�����CB����}
�Wo|����Yr6�;�

uE�=�.*Er���ɂ���	�W���0��Ae����@B��P�@(E�IT3���U�A�[�"ڛ�"�ˉѠ�o�{�0���ý��C��d��>�>��y#(�'}���
A�g؎�qyZDdj�Px�����e
d�vw�[rbvn%��}I��u�ye��%=yr�"��\���	bZ)�`�jHW���F.{�����|x��>IѦ��k	�M�U)��8G���'�ތ׾j��~�$X��u���4��Sgĸ/��:e��o^��,v�/���)�bk���a�z¿�4�)�����
)��ˡ��t�Jb�.�0ٖ�p��=>pqY�zZ3!����[����uo�
��5��ݒ��+�ڟ�eJ
����̹*m���S��W���L�}��S��R�r�Bwc��5�-��W����v�ju�
����Q��φ˷�vK�q�Ï/m1�g�eWdT�-���`��ǬS��.��gq��סP��/P��5meD�F�ѧ9���F��u ��#vG��=r�k(G���Ȅ'�������ymG����
}=�F�
�I��N��S�4�oy�f�rh5.Q�eZw��NM�V��)�}M�ջÈ�
�tQ��2 ؍�/��
-endstream
-endobj
-20017 0 obj <<
-/Type /FontDescriptor
-/FontName /TVEUDK+MSAM10
-/Flags 4
-/FontBBox [8 -463 1331 1003]
-/Ascent 692
-/CapHeight 550
-/Descent 0
-/ItalicAngle 0
-/StemV 40
-/XHeight 431
-/CharSet (/arrowtailright/forces/squareminus/squaremultiply/squareplus)
-/FontFile 20016 0 R
->> endobj
-20018 0 obj <<
-/Length1 1489
-/Length2 5062
-/Length3 0
-/Length 6031      
-/Filter /FlateDecode
->>
-stream
-xڍtT�]�6% ��tܔ���
�H�� 
13L�)HK)�` �������4J�H�H|c<�>����}k֚9׮s���=���ׅT��-8
-$
-�
���� ""� 1nn3(�򏝄��DA�0���PGB�h�M����0���8 *%'*-'"�����G�`�3` ��a	�:
Ꮔ����?G�׉������zA�P'0
0 �� ^�����u����W	^74!',���
{�@p��� �
E���q~P
�^���@$܀���q
��#! ��	u��P�
�����u�#�+X�W� �9�(H�O���?
-Aa?��NNp/���.PO`��B��0��G ���}�PO�#6�������	 �2��億"�(
-�����2�6kœ��^^E��}P$�	�w������}a� (���
g
B�
��@t5~�`M$m�4 )".*+#@������
����N�f,�� 
�`i@��.�I 
-��H
$(�?
�F$���3�	
8B\�0��ձf��/��?�؊`�'
-����9��*�����s����V&��)�q����� !II at HB
�Sq	q@{�w�?
���O�1��u�QQ����v�">����{m���`�����������K���?S���Q����H
������+��񃽠���"41��XB~������o�.��
U����AQZP?��1���K<?��N�;W�w��<b�R ����`"�
c�(v˜!~?�	�`p46@`�A�

I�c$RҀ���O$-k�E����_$��ER���_$�A2�*����_$��Eؚ�� Yl��$��A�hv�~���	�Db�����M����@� N$�p'��Wo�^�2�
--��I�u���[.h2�,���+|�?��<�����/bOϫ=�hE<n~
-̊���x�悋�`��e��/(}�ؒ^S���8�ٕv�ƴ�wOe��N�{{q$wU[�jM��s�M"��u)^_B<���8)^D�jnC�Z���p�.jG��k*��귬�
1ɹ��bA\�l��Bo/wM)s�U�Q�a �^hդ�����&"���{]Q{û�i��f�x(�{�q��>�h���sCVCEZ%q�!
�q��V��S��>�� }6���3�x�Z

�S�v��)�q{�\�uN8-��]�8
/Il\�R��e�6�
7;��ȅ%-]v+Ykez
-���,�_
-z+JS��S�|�V��������
�f�:'�ޥ���h��F��R���u&?
X:��
�GvOx߀�:����I��xw����iћf�L����v1�gUmK~/]�!�۰�G-�>1�V�.�b���V
��
�ʁ�[�g�Z�]j�
2��b�@�%9�C�����H�N�O�߽�Dqo7x�d�[�ٍ�W*1a|���ƹ��ǵƔ
�����
:���
ȂvL��bMto=E�29dtg�pZ&�*Y:?�
 L[�[#�>D~m�iA6��/\�M�����z���9I'}�ln�����2+�K#-Jŏ�b��xe��K�d���dn��R3gv���%1�

��ԗf
-��I:]�/��8E%1:�W�ľ��ŕ�.�7
-

��/��2푺Pc�gZD�&�1�*��E�ڠ�O<�W)�X$r���ϻ�ک*2\��"�4�I�a6���
����l�s����u{��6����T_�7���
-�dQ�xı]LV�kz�`��2&�����z`%�����Dj2��+�5�,���18�۫l�)�Rig�* ����O�=k��_	O	�d�)�7\긴,bI�V!/���*����%>��
�Y�-�p�
#��"�OO��l4���+:����B|v�8���Y�3��i�I��B������2���������r�
ޜ+��z_
-ہ��N��+:x��{�1z�)'�.�*���HN���
4����g�9�7b���{�EӬ�qK�I{&�
-�����WW�����:]
�B��o8a�e-�
�޷�0�$�Z^�����1��H�����ʼ���T$�F��w<���Wr����v?�|Q��M�g*BI�!�b�I�a{2��$l�d�ݝ�X�Gt�g�ʲ��d�QZ[����8qⵙh[IE��Z�ϼ�)���{6;3��C�u��Z�r�eִ�"Kԙ.��O��~�\�\a���tD at 2������A̩i�W�H��W�|�Ql�� 緛��Zih��0����"�!���x1�B�b����W܈�I�=��G�_��"�����ƫ{L��5���d{gV
-�k�e��Μ�>iK�&`\c	o�Nx�y��@��ci���C��\���G�M�J���Ӻ*���&BM�y^k�7L0=!����'
8k�o^��SO�{�߫���\�M�˶��@���	�%9<�W�+�i5�]Ío�
R��A�
ޫ'��V�8B�����,w�-����9����x\U�B�/_�ē$#Q܉�"r�7�3p��֊���H�ۼy�*��wO��ݚ��5�o�}e���۠�HfD8^�^I�����'K\>�Y����U
�Q��kƦ+c����
6^*۶v�dЖK/�E��?`�e��k;��
�=qa��P�[�E*��6o��>��3�XK܋Z!���zw����� � X�}q�x-���
}�0je"�йj@=��OZ�u�
/���/��1o�c6N��
��w'&��N��l�c��fXq���G��
vM#�[B�+kμ)*� }.�@}G��o���X�p�;e��>x=i�Rm���Q�{��h}��9�
#h�tH����G�l�4O��	yn�5���2�Z�^���%����
\��
-#��Ix�V�f;_��#��KV�|AZ�	O�b��6��w�M'�=��Ɣ
-M=4�+�z��S���{΍��0r݁�a2g���� ��vJ����,��zv��|�S;�z���8q$fEw�
�hV�,��M�-iMf
��C�� O+�Z�N��H�����t�+�X��eޚ��0�`����E<=�V������O�f�k]
���(lK����V�0�]^����J�$\�����e
-֨k�()�NP�F��r����J��>T
Vۭgb�D����d���I �f�v�3�W�E�
�S���]r.g�
�lx'���W������zN1��WwJZ�r�5�>��g昍�{�+��,����BjM�#�[�T���l^�ٛ_F8:KQ�GE�bC(��lm�����ͦ:G�3�:տ5�$�H���` ʴ�>S����OP�� ��W>1�p�`�gO
�c��o&�ݫ>��G�Í��u=W�SV�L�y�j���e�u�W���Lw�ioǭ4z���~Ѷvw��}�&?�,�a�;C�w���>���O���ڤPX�v�$I�
�J*�;�~
�4��
?i��̳��辫ʽ`t	�Vp2��Ϗ�n�d†�ym�J����ԫI���A���,�	l���
��
Ъ�d5<
X�-�O��ҧ��e� �[q����S�K�^u�C���P��R��5v���9;��:N�G���¨8i��Y�G
��x�V�
����]�L-HC�|�C�͠K��x
-w�t
�K�F�6�F׼+�.}�NK.������U��+�����`},��z��̵D�݅�C�!�w[q���x,6���3ޯI�e?��}`��5ÐE at g���b�ڥh�{񭬻k����
2��q�P0Kt������w`�t��˭�Q+�}7{CN�d�=ޘ�<�
M
{�A�MX�#����P�
�� ��#bgu*�����"��sJBC*�4�
�(|�{j��{����Fh��6�۝Chs�#a�{䗌_f��
.�=�L����zY9��{�����;�(�d�}�όe��&8�9��_�L`l�:j���Ţ��Go���+n4�vs���a�X�Z£o��D������^���Q��~�f, ��է�,��my�h�� /�8z!�R�[��
v��/K��F�_�ũ�Bd:�7�ϔ.�S�ʶ��d
�'�d�?��3��Iw���#�iC�”�4
�t^w�S��
�byގ��&�!��	}B�S��~��m=e�2A���mb���I�:��Ɛ�a�e����+�[V�.j��Gs�ÝĽ��^'��
5��֋�����tHu�X�KYў�\T�o�i}~��>`�Bv�>@��@IRh�ƹ�gާQlo��J�}S��Nǟs/�g$ɭ3V�6���F?�����n}M���=�W_ό�7��U���O�:���[Usv�Z��SM��H�����pYso6�y��7���_�E�q�gq�O[:Q�K�JC��N�I}��Y]9�ofp at Y�k��x�yg"�]�,�O��-?s*�;�d�fbkĥpe�%�xGey3��VIeb���8VmO�
�<X�;�������a��U�׾8C�7���ԩ��H	���0
-�lW2��%��o�Y#�����iM{���킛��@�t�&�G��i����,)M<��O1�Ҧ��ۣ�el�q�� G9yn6�:��d/?ߕO�	�jK1_:
ؒ%�^��aG4�"� )�{cś�k.Nv#�O�
מ�M�{�{-�3E����W$R�
������zXJ��N�^x�ldo_m�頼�q
c�d���b��H�����Y���ښ���z���e���
-��2�EN�7`�N���u�G��W'Ƿ'ť�"��r�F�p�/-DopNo�x�u�Eهs׳��ӂ�ꆿl�!k���e�A�M��Y�5����2M�[����yD
�B]�2\KO�t�0-����$Ȼ-~Z�|�]�E*�
t������j�<����%Kf
�8WS��Z3w4�
SRA={;5!GЬ�c�'`�d��m^Q�%y�A{:�~�ǡ�D����q-Nv捾
-��B¸���#�C��=�&[5
$�ZIP�3�:n��$@�}�cv�WsV��w�ɸ|
��;�ѱ[����
!����da�!
V�͝aOג

̀�c��c]m��>��C�W'��u�>�����Cc��N}�n\k�n1Z�2J�7���s�zB^�f�S<�
��������XcBg�[�&5||�����E�
�������xJ�B>��/���a�
�+�ºrh�����).�M�l\�w��>~B�2�nhR�R�0�e at 1����f1ݰ\1�L�6V�-���D�<�$�:c��������(�Y����<^��I]����c*+���
k_d��KL)�-W���v�9w�l�҅���VeF��Q,��d����7W�v��;��H��~t�,�����\hM�,a&��ڹM
#TY(c
�4�=5��[T|,�؈���)͕,��*����=Lv��䬖jh���o���.M@�T�L�9C
*��ztɞD�pR��U�q�)z/�o4�9-!��2�Q8��Wq�g���f�~GO��/��G
���7�*%�QH�?�7ѡ	r`bP4�

-TQ�Q�h�T@�3o_�|��C��t��`Ps���Ʒ9�
5?]��WY�������/QrQ�gl1�e?98v�*ސ�K����׹�O�ȝo\U����
音�'��sd_r���FmX}��·�ؓ�`�Z��&#�V�0��Q��T�bA�6�@>�n�Y�s��'��D&
ޱ.���yE�Y�k�ڈ�3�e�yL��qK�ߺv����\��P��^�
:��k�v�s�1Oۊ�#j�z:���W�]G�7��ߺj���D�"��J�ե�1�ڔ�mp8
�(�_bf��Ǵ���ѿ`x��T)��e�å����;l�gZ,Q(�J��r.�B;j�NM +�9O'g��4+G�@�wr�u���;/+�q�֘I�|̓�Y
��ܒL�5�>B4
�'�Y�6M�%]�7�
-ɗS��
g
�����x�u��,�����9]��tԬ���jI��2��2G��ȁ
�\7��=���jU�D�d�}��8?ږ���L6�'b˹z	=|g1���b(͐�v�kg��X�� �Ʃ�
-endstream
-endobj
-20019 0 obj <<
-/Type /FontDescriptor
-/FontName /UDLXQN+MSBM10
-/Flags 4
-/FontBBox [-55 -420 2343 920]
-/Ascent 464
-/CapHeight 689
-/Descent 0
-/ItalicAngle 0
-/StemV 40
-/XHeight 463
-/CharSet (/C/F/G/I/L/N/P/Q/R/S/Z/emptyset)
-/FontFile 20018 0 R
->> endobj
-20020 0 obj <<
-/Length1 953
-/Length2 1757
-/Length3 0
-/Length 2422      
-/Filter /FlateDecode
->>
-stream
-x�}S{<TywKLmԪ&��
���1
FH��ȥ��1s���3�ܚ�����ץtѶjCmx�K*%*�&a\ze��UEYރ������~��<���{����`L�����ž<Td
ڐ
��
	d 	 ���D��!<���@� `k
�$G
-�Hv @*�#���P
�m��$ �̼p �����G���A�< \?�g���1	,bJ�Ŝ:h	`�,
ʑ,��#���2/,�y�g6�
pa��
-L�@
�X0��,��3
R��3
� ?e�ϯ
�!Lx���\(���<8a6�`��6�&���"Bd�̯�)�p!.V��F��q���s|DanB�80@�K!BOD
-�興�!��ˇ�,X�AP��"3�
�I�yXh<�L at a�����
��Dž�y�0ʚ�3��َ��na�a^V_�2
�P&���q�-��H��\�E 	�
) K���6(O�
�b�
���fL b� �C�8�É@�X4C��0��a�|��
 ��B$������
��(
"¿�.�G�>(
BPQ���e�3����_q $ R �4cU��=��������xR ��%ֶT
-vmH�b
H�='c�im�n`��s�F0��f�:����+���|�ɦV�ȇ���䕶�֏R}
��73S�&�a0�c^%U��h���&3�Y�[�Kv��I#���y���ր���ÙWs�n�rHխ 㒯�������0Ot����#B�D�.��uo�
-�t�B�4���sm.�Z_�.U����ui?�0حBnd1F�朊�Rs��
e����<")]ϟm��b
�h��?x�}L=�s{Y6�Y|i���O��ۭ�	o�o��F\԰�b�T�^4ңI\t���J�=��Z�^�Ve9�u�Q-__�N�X��
��* ?[�iuR��>��4�Y�%�K��do#)�n��
ٵ��kl��A+��p)cx����M�ҽ%uG�:�
'���F�S��MJN�*i��}�j�e�HEOY�͹����� Ciu�֏�F��Bg����	�w���=�j]�U^��cv��,\�#���������H�k�WQ�{��ejA9ڈQ��8�0$6S�g�ι�j#��.����aT�9�t��qݺ��E�M\"�w߼➾y˨��]��Q���&�w�Q�w�{�z�w��o`�=F�&�5|\����}�i���Q���L��/��\S���M���=��*%�B�u�#����j����m��F?��k5��ǃ h�Ǜ��C�?L�Ot3V. [...]
-��e�i���z2���mg�Ҥ�b#�X�3�.d�6���K0y�o�����į=�#�s��;�n�i��N��r�ig�M�z�a	�Ԅ�5�i�i˖���;
Aj��O�n
-;1�v�A������s��R��*e�j��
ѿ�b��[�J|�?kYݮ`�
3
�^��Y�x#OEbAI;:ب���
-�Y�E�i��zx':��em��6!�0������&�?
��� #�F�j����޲u�k�j��GU��2a�^��3�
�8��T7w�[
]&g�kn��˳]9fib��	U<���N��Qw�����o�.�&^�V|~���)��x��jږM��-�������P���^�UOk�������>�c,��VQo���*�P\����X���Ƿ�C�x	�����Ke�k�Y$�@3|��+y:��ȩ)p�!Wl
~��EIt�*G.�&K~�C�µ�ۙ'��e�`+.�GϽ�_���6^vQTܗǜ
-�VM/�א��\\ǃ{��[��^��@���?���+a���Z���M��{���u�Ӎ9#��d�#/[��c���R���
Ws�
�쩄�O�?P�
r��v?�}dV�8T�Y+K�iM��֩�}:�5_E�
��胆vŅL2��"�X��4�s�/�����o�ҡꝥ�3= (A�P{H����lQ�����Q���s�=3�lO_�&�t^�Խ�����S��֜��M�}w�Ӣ���	��T
)	+�;Y�x�PR�wu �ӹ6t-��#�]�H��u9�O��i��}�F����G���"^6-�SRW1�au/�V��Jݾ��tzƥ]:'�
3I��
-endstream
-endobj
-20021 0 obj <<
-/Type /FontDescriptor
-/FontName /FBUTUG+stmary10
-/Flags 4
-/FontBBox [-123 -2958 1055 803]
-/Ascent 100
-/CapHeight 750
-/Descent -1160
-/ItalicAngle 0
-/StemV 25
-/XHeight 431
-/CharSet (/Largellbracket/Largerrbracket/boxslash/llparenthesis/rrparenthesis)
-/FontFile 20020 0 R
->> endobj
-20022 0 obj <<
-/Length1 1612
-/Length2 18815
-/Length3 0
-/Length 19656     
-/Filter /FlateDecode
->>
-stream
-xڬ�ct�]�-�v�ضm���6;
۶����8
�v:�����}ƾ��9w�x�xVU�Y�j�Zc,
-e5sGS����
#3/@�����U��A�Ah��k䀣�s��Y;:���yZ at s�8�
��
-`��ၣ �9:y�X[Z��5T�h������O���z��t��t P��� �9:�
��B�_oTnV@���
 ���#�(��R� H
�.&v ewS;k3�����H�pt���`��`n�Oi���D\& W'����m@/3��?.z��������?��`�b����n� k3;w���[8�K����o��_�_0eGW7W3k'7�߬���������ܮ�� G����f�����/�_�����+�
���O.S ��������o�`N.���pw�v��O� �����
���/�_���u���M�������o���`��
-��`�ca�����onKk8�E������vsw���� ��� �f��/	sG;o�9��I���oJ ���ʌ�}"�7H��"���������o����y��В�vv�&��?.��� �玱3q����[�y�6��@-������q3��
˿�032����U��
h�l�ff�0��۩��@;k�_E�m&�������ԭ��l
�i=�������_����$�$/��D�_�����j������(E���-��u��2�=�
�l\ ο	�YX�����a�ϵ�����@�o��,��?��\�	3G�fE������x�/�?n3w����{���?��:�4�[]r4�
����tk�����g
w*oV/)
-�s�
̈��6~�gl�����^<s�8��=�ُeG՗�*$�'�(Bݤ��;
a2,G�<���{� �
��ɬy�;��jX�E8���s�DD�Q�A��`���������2���jx|lt��r� �./
���; ��$�����O��'���.�J(J
8�yJ�w��n��:#"��"�Q!\Em68�s*�y�n�j�X�㥅A�K��4Ӄ-̷S ���X
-���f
�mSH�
�vK΍�8A����}�V���o�{�Dd��C��]��f��]�vy��k��0���YA�%���"w��.�l&Ǡ�@�2�NJI���m�����Z��g�
:�z�%���s�>�9 �y�2��Go >��	2�)���j������=p��҈H44C��3`��,�HeB�=wG�n-�f{��
��!��JF�}H�A�f'ﱭt3���0eT�2���
��?E���Rj*��rA��*yC�X�`��h�u/�pwX��p��Ɓx:˥@����7�Z�S�I̙�:FIu���Y�~@�
-
��9;�@��{G��Q?��;�
��KE��e@�?<>�^�Qs
*g
����b.x�R�p���ʄޟ�4�ZA�À�š2����
-����a��pSu��=D�NK>8蠕�xa�m�5qa��R�r-�ƪ/��oZ߆��'�S
4�Vw'��y��i�Q6���=��=f�f��0
-�_R�*��$N5�m�]k�
�fo��V[w!s�-j,:�}�m�iћ�'��8�9��y#k��y�;�|S�k�����z���7}Dq4��^�*"-�k93Z�
CJFf��C�U%��ȏ��v��
-W�l�#y�O�Zv0,������&��I<Mظ[��|)T�w��<���/}?�Д����ߍJ�ؖ�ߎ��*c
��},
�d>bG-�m2l�}
���4�ŋ�u�;!�8����'�
���2��rz�a�O
����s͖ߢq����@�0�����
����4px$I�P�r��/��a%[�^H]"�a�x�A����*{�W��
D��a���+���
Z����5K
և�U�it
W\�=1)rd�
�)8�
�
Rf#��ܸ�?30�N�S at E��&�	H�]�s��jd���k��KVx4%���
x��N`U�u�h�nt��9sϧ�3�{�,T���I��w�	�g�
����i��Yli��M��
e ��d������y�Z�k ��@���DR:�ƪ����݅�F�,��_�e���tP���l���QДT,�����Mq!�lj��X
gMH���yj �?��'�

-��w`ۂ�g:��d��i�:�:	��
h�+�f�}4ↄ)|M�
-�'��;a1�z.�Y����(:�wM��|�_=ӎ/��>l���pk=�ޭ���8��(���<��.�}�@wԃ���S�y
[d\����D>��&������v�̒>�# ļ���}@:J������/�����6'��Y�}���5���4%���C[�����7j+A8�m��rTB���
��LeR�Q5h�1��;l�g-b���f���*�Yw.z+W��EH��H �j�����4o�{/��Yw�i�	�w���͞7�)��nQu��]�Vg[B���"�vA��iX��H�
�	4"+N
~�W_�9�:�w˒*%0�"[��a mU�P��j
wU�'��܇�W
-�L�Ũ�a����/h�p���J�A=75��}�EL����o�	
-����gS�b�Jo�|_�W"�PA�3��
�N���3�O_���3>���Y�q��
�Eg�9�z�����ɰ@ُGT
>�^)3��%�̹Ӗ~m0�� q�Ƽ!��\]_�zaD�ِ�Ѯ$y���GH����/�s�o���C����R^\G=�|��۫��f�O吤(��"�t�Al�I	�g�ػk�b�
t��җ�5!��|�gec�p�[w�R�B���D;�\p�b_�6����f�\����
�<����
��ՎdI���IJ,La?�}�x�j���X뙜tj>A5����zGȷP��涮!휎b���R�q�}�����,f��WU�x��
� ��T�*��
-������ؗ@��,8PQ��h�F��9�Es�:H�&fsv��ݗ�4�{�c��a���ok��c��2�+S7~�
^
-��N��~�<�X�}�}s
��D:09����,�kH��zm��-��Ƴ5�q?:�L$2��-e�W��g�尤!�&��TFD�_�q��y~B23[ؐ��I����v���Z����3F� r�k �[��;uI�&�JA�k�$A�`%
B[yI)�d�>;Cr������iَ(J�_�'tX�
�U_
-��d7�r�X�0�s�ןQmi��0u_}s8.��:
{�"v$	�v�I�!M0 v�
n��j�IeF�9���T5�)ಐ���z��{����F��m�wû���帻�VNj���CSϭÅ�Se�)���ue����eV|�b��\��f�.?�\J_��I�\V̶N,Н̟��VGJ@�6�P*�s��:D��ѵS��Gz-x����X(@}��G�e�eʰ�ݒ�,V�
�K�Z�\���=�
�7��B�Q�':���I%?'G�
������JBC����Q�p|��C�����{���5��=Oœ�/h�b�����;)Mi�
�uv �(
z�w*?A4@��9|X�X��?��fY����E����sd2�U�
�[ب"1f�(���1�)ˋƴ�f
�%n$��Ef���:�|g��ڳ*�yɈaK��"��Ў�hR���aY�og}2p�o����flē� �HXI߃m
��$�S��e*\����,�awպ''�[G�|�4Di�"&UKw&��� [...]
-1��H}ۡ�Ol�П����4CGܜ�b|2&(�*kaes�(�w�8�Hʅ����DzoC������B ș�
�j�	-Mf`G�}
�g�>p�-��>b=��M��z��&�g"����K�gf$��(��9tN\N�r�Wr�B���w<�� �$��ߩv4UU�ڛ�����ܧ[+�e�qt
-只�����:Q�b=��B�d
���\I��%�;x+
-[?/

*�R�9��^���1��~އ����L���'p�-M���i�����z����2
z����
���
-�'��,�'��p�l֫��3�)6\�Z�.@/K��%"bW����10��?E
щ��P��J}0��m�
�j�����*��T�޳�U�۵F
Ƞ���lݕ���x�0ѺkSFOv�eq�ui��Ď
=���`�gK�j��l�
�x2픶�9d��
-6,����~�5J�"_�kj�a�z-
߫{�C�:�b
Z����@[��D�����k-{��33��0q
m�1MH��9W�6��W�OԸ��ȵ]E�x.��:��H�������~#|��z��;���o�y
]�"t�	�������(�bG�2��DCҗ

8�uҌ`R��-���.p���-8�A�L��J�-̯��C��oۃ16��e�t��SG�D��5�:�T�GB��ʥe� 햌�ᔦ� �>	���Rg�#5p�gv�6��8��c-Q3d���{���
-��@=�ɏ�w���$1I)e�r�Ջ�?�st<4�2un�҆Aۺ�8P͠|k�R�D�'Lگ�L�(�
ǰ�4�6��\��(���&
qϨ������2E
k.sZPQ�/�����;0�Ձ�]~U4�rg9;�lܡ>}w:~��=���N�����y��#�G;d��j"�o1[��׭
��ۦ��v��٥B>�yI�6
X�����B_z=�]�>m=��~�-�Wb��$��XAI&�F���6P�[�V�_A��4P�
-ɿ4�Hun�m����$aB^�����5��n���w��Ԁ�
)����c�\bK/·%���>EJQ,8���.RW�y��~?{�Pۊ:`�ӘhK#��2	�y2��Na�������!`M�ПGM���9�ciz��ښ�7-�\O,F���ȓ1Z��I��/@5I
�3�[��P��]�7�@�a��6�ţ*U�k1N��X�$�fE#�v7}3�1�fT�~!
�y�/G˔�vu�;�������H
]�72g}���tPU�=/��k��]��(�O�bn܅� ����^��g��ɛ�HܶEUgҔ@�
N릐et3���gjo�>�e�>�Ԁ���,]!,9Lk�
�.�9F
��MP
<Oh X<�5��iBF��ބ�9N,�FƊ�
�H!�؋XTV=�4�\�=39+�.O#����TPaℕ%ME�o�����!2�s�
.�0ՊNbO�V1�`�rG(*������H�CÓ��$ҟw`;k�ݕ��n��XN�}�tz�s��

���J6����pG�́,R˱J%� [...]
-�������]�a���|q���\
m���r��|t�dvF��a���y�)=��@M\�c�2�pX����|Ư͠��8,$#��Xc`�\Q�W\�#s�Qkꑼɉ�
A[(!�ʫ������dt8y���v}�U��7:��r�ٞ,B�:�R����;��J�
3e
]����+�12C�}:@�FCU/�אI���J�^�jhآb�h��:":g ��J�s��b��E��c��z�C,�ϫ�h20����x�k������
�{���c,��s��7wTa��X�L���A=%�P���Դ��
-M{z��X���?f8ΫH�����G^k��˥W-T<cN]����@��AB��
!�uv����u
0m]s3-ANN\e���={�����h����������ցJ�+Zf<�3b������xq�!�jx��X��zi.�� S3!�W^ɰ����zx �5�w�5���}{&i͠U5q
cm�P�{��H~����/���o�:v���sC��t��N��S
�1�ƒG;�Hu՜58�uRޖ}����)9����('�+?��V�W�
>(�Kc�"s��AE
E��͇�����!,_B&|�Z]e
/��HC|ۂS�\!Rq���o�����
{���]��U]}�tOH�b̥���b�Q��A:�Z�ea!GVHVm�`P:��,��T)�T��R'񊽽?еMc[�>/����=oZ>�TRY�0���o�8�b<���r�<�]��&������\ix��9-��I%���ړ�sh_`]5J���4�Rj|=Nl�ڣqI`�����������U����ȑ]L?x��n��"��&^Y���c��}�����Q������a�M^���w�L�Y�q�[�>�gl�=��*
a�,h�u��y8eÛ��r��+g��BLDy�1GĠ��_"|�b��?��<�&����\��#�~i��j��9 �vau���
~7X��4?��V��	]� �
]��4.���wV2lM%N��9��B��Iu�������ip�N�U�g{�Yw�N�<e"�e�lB���բ��ҏ�Ye'H^(̐�5z���sOT��ȥ�y�[`��
�-5~�?����C�
M�Z`|ML�����i�
[�	��78fۗ�� �O4�squ�9�j���
-��%�}��l����炀m�4(
�Z�\��]�&=
�MQ
-&<V��
'�w�阮�2qm�h
���{��i&��JrM#�/�/:�9vQ	$%Zi��I�觅�}V&��
�?��R=S����1
�����
-�\�e'ʼ���0SM=wY
z룅�:��	��.� ���˴+:X���Kk�ʤ�j6�2��]�ݩ�_3�@%���@L/1����v0,��Mq�f�ۆ���j�A�h��V��2�*ZcZ�*����*�Ao
��\�A-����2$Q��>x�k�
�!|_�6�o�p��j���V�0&������1l��;��Å�?���柱8��ʰ�3��NB2A��p��+�{��,�Z7�ۍHĬ]��-���\�A�"k�!J����q5�m0�Kv@`��?ME�<j9�b0�K0v�!M��ı� f�����8
��ڽx���%�]&�]4��
c��'fӕ@B�h;c��d��
Vln�o��(L�;
�
�w�R�,�6�Ś[��x���C^C�W*�Y�yf�Ž��Ř�'��Ҳm:�ޅ�͵�K"�z�ܨ�ʂ-;�6�
-���3�'�*�#��#ꏌ�
��E�o�K�C*(y��e߫~ʶ����_�e�?��;!だ��/^O)y��#y�M��,��R�h���1GO�j��.����e��q�T����p
W�U�lD:.�
!��p4=�2S����0�]�۸���eB�'e�\I���KA�v]Ж�v�
�&m�/
-���~
�譒�4HoC�����d�iⱔ�
�6��*eu�t�x'?}s��
2/�����܍��:/�=d饮_�۪�
-���8���V~�)y���Xd�a�Υ��)�#O��I֙䡧�w���]�S�6
-l��@ǽ8���L��5ʽ\��
/L��JA��d0�]�&q��
	�n��?�{�$6,�p��ߡ��V?�u��j�1+Z�P��
-5E�hQ�:���И�&��*CV��[��ՙ�QJ���@���"O��{z7״��y�-5�Ue�V��|�M%�$'K�l�ie2&9�`S,$��=��po���C+ڦ������
�F� ~���
���-Nu/p�nS�8���1b�i�,��w��
�e^�<�'��$�o������!y�?͋��
-�6�e0����T��+x:��,�3�Ǿ 3����}��,�R���^>Wx�A�
��nWr���)�\�n�
��F��y����n�z{t�bȓ�����
��B�>��5_��"��h��u�xx"0��u��
/�����'rf�[��ޫ!F�me	&��:�N���P��K�#J
:d�4C��+C��V�?,i#�Փ0��.B_詺(����
���^�Ò<��
����%,��alO��֒L��{��
�f�c��^<G�S�/Fy����F.���
���^�ɢI�J: C^������7���⣣��(��E��&B5��ǷWO��(68%���]��J�����G5�bhr�
����ג�Y8����j8�H�۠m��9̅ �a���ǘ���^�'!��(��w�o`�q���]#`S��tr�5��#‚HQ���?$��T�|�l_�w\4����^\��q�TC!���>��\&?5�=ȩ�|�ʛ��K��$��W!]F8 [...]
-�*�"���^0�h,��nX�UC���o�p����宅�N�<4y%��
`�=�0;/���7ͼ���X �����/����D��0E�f��
�_�5r�<���m�k����^�c?����v�����1�)Z<�$m��p��Y�Qg)���@
�����
��\"ЀP��K��Vrb��!Ch�!�{�mB%�0���;��m鼒��	� ,
�e/���m����r�>΁�P�
?\�aO+����3X�.���hQ���r	9Y}�$�%q�E��Y@������‚��d~�\^ݮ�r}��s51<���3��e�\tFٵ�)�ݧ��u�,���"�~1n4\��h�h8ٱ��'����]J�D`���!v�G9�C_m���o엾6�

�L
-�Ӻ�����׋���
-���X�k?�H0�sB�H��o7�3Ql �P��&Q��V0�0(G�i��a��7Lh�V�!S�;-�?B��
�U�!�dH[u�j�`78}߂�f��Ģ��!�`��Ƥ1�\�յ0�J^m
�,+ Iՙ�.�#]0j��v3_T��
-r�*�Y"5�=x��"LH�X���	���TI���-e��~�Ktx�d��
��[$o�O at D��/��s֧!o\y_l^�������
(i�N�}�]�����"�j>�L��t'�.��d�FY�o�hj�����6^�1�d�����_S�!�h��ɱ
�؉wq��4R`[�_3

��m%1X_�υ[��+�e�t���G�1
�+�����C�������o�9�冂��C��J��O?
�:�h9m�?i�."Mh�F_��
���(
-��ucpg���e��B:��j�
�S�
�,��

%���� З�Lo�kT�س3�]�L%,:<8,��,oyi�
c�Ь�Q�;I�XG��O�*�t�E�o���k˺ڰɘ�t���y���j����+�D}��?�t��-���&ܑ�OF����<�B^qج���� 
�Z���z�Y+%q��R7� Uм�w���O�7��%'� L�c˭7s�@{�X��Cj�a�4DݘS����i#йh2��a�� F�B��߅�!Z^k�'�7>��ι�D�)�̑�z
�dV��)@�>3F����Դb�x����^��
-Bԋ-��|��1���z3��P�&5����
�N
\��#f	7\� }L
����%��b%��A���U,�/��O��\��.���N�o�H3=W_�tD?��� &�8ӡʵHI
&��^	7��L?�L#N�nU/���F�8��$~��c�V��V�1�"�J�\�.ŀ�7�-���)���C�A���
�Ǫ:׆.z�y7)�
�jm+NX�t�T������+%���w��N/��6��ݫ��y$4
-�'`��T�HY0���m$�hSr;$t܂l��♎h
I�=�K.~�'T:L����áԕ�!^dB���
Sc�+:\x�e���P�HA�!@L�m�~#C~2))���rv�Fi
r=�cR��rw�. �#�ᵠ�+#���Ѿʌ�]՗�	NK�'�g|��n�ȥ�@�oh���J?��7�>���F^�z�Zgq���S�k�frv�p3Uxw3W��=`���m�/�% 
-���z�y�RS���x
9�K��4���f�A�����
*�D�x�U�� CA9���]�L(�4�T��灤?{�}�V6N���`X�'
�
QޯOؤ���`�ч���U"]71�-��^.�F"X��`�=�Ή�
W�����m�[^��~�ωo���ͨ����+❊f��f���J!Օ��j`�e��c�7��:�-BE-�!��M�N߷
���.0��{��~���TU4$'�<V�#?A�E�!hY��G�HRLS�#��|*���dy�q�w�+A���$[\�?�?B[Z	����� �O��\b=����p��G���P��ծH��h?�.�3rPT�w�t�����$P b�I���=�v�X��ߢ�z��L�H&%�Y�-mӬ
�;����ݿ�:zS�'� ��<�%��t���4U�9���˝O�ԞiJ�EZow]u�`(�\�nD���Qn+�iW���0?�B�l�����A����P�~m�9�0�Vb��6l6�)����Y�\�s:�~1��
 #uY�ct������z��ʖ����٘Fiu��!!����-1(ȣ�����ukcOFX�4j��҃7��/}Mg:_ɫa���Q"�����	I����V�1�
��"W�#�m�r�q�X9�p�c*r�)-��Lv�j�;�����
�u�>���t�K�t8tO�]��
-ߦ��J����8�S
���5����J��g�iSeW�jN\f�Fw��i�x�:�fc��~L���fx�
-���io˳

�+F�W�p���f9*�ͅ|s�=�k��ilm��	^Ӓ$xt�x+�e5x�fAwP��=�z[0Dy~�O�]VE ��7�j9 �̶�*%��
���
]O�����c+\8_���~�$��>\�a/y@�/B��{7�Q#S�
�j����4�o����2Ƞ�^8a�s�
�
��)��
-�-I�Z�:�1ڃ9�]�2�	LC�Z�L�iQ�P>o;nY��/�C޴��1�Nv�x���
�D`��XAK؟d[ǔ'�*5��G���y�؜6�g}�T5a2u��/�N�=��*R&�\֘�æ|�����SO��M��X5�q�-ȹ��9t�<<�~�ł����mv�
�)-
F���
-Z�?������c��!v�
��Du�z#|�a�F����v��&��8
t���U�q f���|�9
-	j�D�����Z�����A���)=��o[lS�6��^#�"�G���pܯ,�Fr�M�g��d���,Q6�S!��2oi�y�ur�W\��T}�q'�l�403��gY��s,�8����OSu!��N��Y%ZQa|J��Hl�~_p���r�����3�9s��ީs�5���=h�S2~縩G�Ac�N��kq�n��3��l�ś,W?DZ�x�μe�+��X�t	?� �p�����W��/Z��?���(�+߮0�E7pq.;5o���y�ȇ6���4���k��>�O��DKG�-A��kt���>�R��Wuֻ�{�om�yu��5ܭ������[���e�Y��ņ�zuT�'�V�qy�S�/դ�G�
ÊDv���l��)� D<�.9�ɓݨ�{8<
xJ�1B���
-&Y(�$#��&7��.|��XϽ
� &���ω�(�gg�Z5׀���YS'��
��[$�����^v�ʝ���t
[1	���F9dzɋV���#L���L����!��`'����Fi�j�2Q%
�������yM��Vo���Lv�+o
Z���>�aݢ����m�w�1]��[�I�
�T�u������S1�����H&�P#�?<����H(�`��ʸ�_JL\��������8����f��n�#f�?⫼�
�k�&�ϥ�mm��f/��4Z�
��>\�ѥ�IA���;޹����k����?-ݣ��xgW�C�ȥ_d�A��U	9
��J�
M���"R%+�ˋ �Ќ�]�i�v�+R��j`��2�kn�pa�̩�!�\�!���@�{{�Y����Y�HU�[���������$�6_%�\Tì��	9bE��2e�Bo�
R�!���r�3�Ĝb��B����
�_�1�� �F륲��Sna(5%i�6�1�f
:�s����$f�x��<�銤�=(�t�X �s3�'��Q��n�«7(IMh�ւ6��8c
Q�GC>�	���#�"��'�K�s����0Xz�S3���
4A|Z���(!�F���[���ꁗ�G&���8=ɳ�e�k�U(DQ���$TY��
�(O�� k�i' �c���o�F�h�0����.� nE�,n�o�1h�U��T���U6�
��$��l�
W"��4��U�o�E���q����h��8l
'���#(�nv/��
ֈI/��"
-&*�G3����U���l
��>��,����S��a�)���mR�
�W�>�iʜ�Q��m�
O�fuI���M].����w�,�:�)vk����7ÇO��=��m*y��v3	b����YS�i-���/��ō�xvZ1�e�g*�zKU�@
�>a��w.u6z��7�g2,�Zd�8��Q.��7=�
:��n��4��Y��ioG�]��Ėw},��l9���B-ؙϷ����z����U�7j�?\M����	?y˰I��9WwN��
�&b����b�9'�8j?����j��ܚq�{�E)��E��gI�G��F_
�׍a��@K�1ϖ/lNı4����
��_��w���GMiH)W�5�
(7=CB��\�_l���<�@����z�k��P�f]���a��Q�|F��Ka�4+
��C�1ujzn��<��b�Ly�����l�L/09�,=�~"�1U� �)�V��n-ϸNʾj�y�m�c�2�s�8�y���ʳ.k�3d��V�:DQ�CS[�[ʌ�iX���1iD [...]
-��m�*���R�2�"�ޥŰ��Ǵ�W/>�6�9)�f��eQ�7Ҷ`��.Q�Sl8]g�Ƃd�N�G���&Σ
n�ݵ��Z�9Q��h�+ʼni�Qub���㢷���\�v�תdJ �m��_�~�bnlvͰ(�}�X��*U@,p��ę2���P��	z����R�:)�:éLi�-�|���97�D
E�yp
)�1��q�
@.<H�À"���ċ�ւ�@s�O'�I���}z��`$
5x��9ߌ�b9��5i��l����*⇉�U��e�
�B��l�H�]J-�a2��pk��������2�Ws�@g]ϭz��)*����12�C)G�p�
bX.�|@]h���Q�~|e���n�GH��;Sca��b�V���#��
��	����]�]��Ni�-׃6���J�)��tț�8s
oI���A�%	��sȏEI��0&���ln9�li�����C�
D��h�ضz~;�
<�1��O��
��^�#Lu憈��p�o4���>C���ٱ��&#2A�T�7F�W�/�T�K��W�@��LG܅�@5�
r|:̇��P���hT�!����S�~�]NM�c�

_����!W��unh��&~+�>NF����:5֨�!���E�h���^R�ۿ�յ(}oFm��W�V�A��١������O
E 
ŀ

@B�
���J��P�0KHh�G���sS0��M	�lv1�KN��!\$
f�O&!˶:}6O_�0o���($�'l�O�^��9��S�`�#�7���ށ@*u�IF�Zw��`�"��z��)��2�z5U�`�
M�4ė����æ���L�Z\�r왽��<��
�'��Y��%�
��`|�Q:� A���QS2*"�m/r�R�g��i��.�2�H o�v%�d���zT����O�a�ל��cI]�5KH㾨�I�t�7�S�zפ5H
]�|��⪧fr��up]����\z����ư\e�*��'g�X��M�����j{<�nf��{�wc2�
-��T���W��Q�D�Fb�	B�����6��©qC�Fy�Q49�ߪCf۸x
+��0WR�_��E�f,�p����<ov����t� �ګ����%
���7���
����e�ͩp�
m
ֱ�e
��(�� \8es��a)�`b�z�ddTH�=��JHy
��.���IԂ�
k�x�$�~��)c+�'Cj4v�}^B�x�JJ|�zk�L
m�8G�U�8q���7Ɔ�P��!�:��?I h_�$�
���[���t`@���6���nȠL	�StdJU?b�d�)V��1o)
a(���U�=�*��Yjg��4`߭�lx�gZ�851��+�W���aUo��B7G*8���F��������Ʋ3�z���Q<���@���H���k>�E=~�XG8���4D����ۓ���(W�S�s�����N`�X"�$�O�!y?	T)wT6$i��Ht�)<�D�9����.V�^?��
U�D����j|
-
�]�Þ�f\�Q�Q�p���̈́��|�����wZ���H�Ӊht����[�o=/�[�����n�$��t/�˩iz_���� ������4���
-���
:_��H�d�\�
��(b��T:Y߻Y)F��&�����D�q���;
����L�j1x��<r/X��^��YV��θ��ا�9�'^���ou�a؆��4X,��P*�g�H]�i9�+��t�@ܩf=r������	2]����Ͳ�w�
v��5H�->k���$l�
-���4���{�K��� iQ��P�b�B��ٝ\ȏHΰ5h�m"�RVf�U�=-7��06�U+?]dy2��˴2��M�J��SXV�N�I�7-B��E0���/�?Y�����*��D�y�[��^��?��|}�j�Q*�?��>�^���f��eu	Q�6����1w&UN��6�a��Ю�К	�t�s��g��2C.Σ��
MA4���~u��;����O��v<�z�FB6�[�V�K��%�q�=��_��e
�*��#d
���
-�B�
���l
U��rX�}�����
���V�V�q�M)�F�`��{-��鮳�y	/����Qd������w)�!3��l{��R�NÑu
w[�������0���q�v{!o��36�g}7ai
�ZOgϻ�Ƀ�^������Cӹ�����kO�r���[��X���z0�G.���m�.�
�@v�Ϲ�AF��=��%�}.4E�Q���Ye�[�߆���Y
-|T�
h1E*o��
��8�K���O��.zؖx����#�����P�NM��lx)
ҬNY����?��ӀN��c�I��$Ƅ.��N �z�p򾫙�V��2�I��)�y��3a�CAȩ
�`� v��3?�kgA�Tn?J
-3|}�\I������&��e���Y�
- ��(��=hK�V�Iܳ?86� �N�q��'o �h�
-�'7a��Ć�Ӎ��i���Z o�
-v���b�+�=��5�2v�e��WT�������\ܬ��)՚ 
ߎ��.�{��]�QY1
�l�
�S��;��$q�%�h���jw���5�r��]�3��h|�>~�&
��t�+���s������n��ss�'8�>��3���
&=A
�i!��s�|���
-��\��tH�A�����4�'����b
-��uJ��pP��)6v��wr'
�Ǡ��3�5
�E�p�R/�_������ʉ��!ލ�j3����R�{X�Qg	�?6a)�t<hl>��Ả8XͰ�P�z�Tm:0�V�e4�2�Ѵ��X��4�j_F��
-q]�!d�
Xe��"q.�5�U N��2
ah��DR�����1K��4���p��_'i\�w��b�N�<�O�N�s��c+<�,&sz�τzT`�ڇ���,
��Ff�u���X���7��P^X~5����fZk��/��;�"E�=s���~���B��7}}���h�26`���B���z
8)&\��Ӆ��5���h�V0�������Tb�-A��*���]\™�Y�����e)E”��\i\���cW��q�4X늎p��o7����v�Ank��'q?��?���u�R���pW�x��@�@�76F�/��ŒS�x�m�N������s
][�U󨒏�	uE����1}q0\!�C6 p�����Z�y`K�@^Wҟ,��T����B{��na9�+k�}2��F�F+a��Fr�3ް� � K��棗� S0�~~�ӞT�z����$�]=�Z6�8j���~��զ3{Ȭ�	"�����3�=��!�؟z	�&%��G���� �
ևuT,��Ƶ�
��Sm
J��2>�W�!
+A�ͫ�.��"�bHj7�Ca
�g
�B�w2N]��������D6���;6���ѭ5R+���a���I�L�k�&�m}c7��.S}�7C\��
!�������4rY�r���%�D1w�����y�"���˗��t�y��/�?c=gxP�
-'g�eV��U�� �
:�����&o:�·�SALvG^[?�-2�_�]O���I�w�,{G���w;�i��.�8�
�����]4A�	/��w
�r :>�8�9i}?WL���[���=g)v�6o/�f��	���`2s��1% C�1�~FG5��W�
��EhR�Cz���~����+N;k���9�\�K.pM�Ī'!Uw�X1�j^_~b�̡(�
V���?
��x
�ԛ-Y��J= ��H���!���!@��b��8g�9 v����o��.�����o��ɧ��^���2�{����_�
x��#f��?Y���"Ĩ
�[�{�4
n at ob at -`�z����b!�s��7��q�\-uJ0
�Ç,
-;w 9Й<��S�$t�<Kko
��iL�U/u��A��B��H�~\��
-��Sϖ �^�
��a28y�Qe�%��������$ܱ{�Q-
�q[=�x
�3z���%�L8����3��	ѷQGL<:����k�������݆ 1��@[���v�*����{�
o�����M��-����I[`�s���Y�`u<�4�j'nj��삑eϾ[O+�841���P���7C��oI�
bhC�A�6�
Q����cq���͵��w� `��
�N�rӬqN#�Vo�N
�:�:ux�`9��/��{�c<������
#`��'ߴ
�u,���op�ʻ2�� ��Fk���N�(��7��M3��>*B�]��eV����S*,�ԧ��u�<z�)��%�O�ӚX�.�2
�
-`�M${"�g ��H��7P��\_���
�����O"^�C�5�;�ӃC���T*�Ht(��81��R{�
-]p
��I����3��5�k�5�:i�5�z��
���q�f�Wy�t0/��i"�V�!�&��T�W��&���p�bnj���>�xI�$�
�����
��'
-�h
-�(j�(nQP��Ohf�%���"9>8�	��H���{����8/ͩ����J#�����

��d�۠dQ% !W0�[�+�8\�8�v�1rxH}�u��<!s}��:r�m���:����)@K�6����Mu{5��XBT�1lFC)_v�K�^?c�ݎT��B��vѪ�27`Gt�Z
��g�Z~V���y>GŹl�k��rX�
��ny� sr^�[f
�&k�U;)n��7kܽ��g�b�POS��r�
hlP���
D2�ƞh��� K�(� ���`�[-��Z��N�Y"`�~%�@��u�:�v�H��q�b3>x��--��1���Ud�?fb
�D�Te ��콯����xRN
��ƶW�8.���v(Y5>CSK�0/|��c���9bͭ8�<�V�4��i��$p���Pb0
&�HZ�)R�&�\�&��&�啤��M�m��nX>���2����vޣ�,Xa��m��n�.�kQ�'r
��P�l�l�t>�v�Q�H �M��U�4!���sE�(ש*j�3q�$�T��.r�;w���\�����6�ݗ�N��
jL�������H���mV������<٬:����0[hYO`ika�h(jr�h��Ѩ��m��
8OG�唌��
�;�f�՛-k�D�$�M>���V@���/�M,�”|m�Uo+����4q���
u����CmX��&�DŽ^o���p�wft�Be�|�k�	*G)�J)nɹ�*
�y*R~fgu�r綟޵ƾVh��W't���f�Y}��򷯼9
�~����2̢�1��L��2tՀ�-cTl�/�.�-މY�C�qƾQ��X��
 ��Xr
6|���v&��������q�o�Zy���4�4����?`	���M�A((
c��o�'��vG���!-8����Z��e�zf*OUOs�U��y]?Q���or�
��z#���פ����		*�L�E6I��w�
�o	����!�;����Waz�p��3��&��烢W�K��:T������2M�d��ƃ�������Y쟓5�o�j��z��I����
-�y��R���CA�g����/}�	�c{b��
W�(�a@�[� D
-�_fP�z�\����?;� [����m�~T
���V�z8�#��
���0�2g�57Y/���
? E�s#�5��
-JҶ�7	a�o.�
�$��ѫ�D�e`����7C2�U&e�ͪ��m�����f&�d�oMm�P[�]Q3Z��X�3�����s!�[86�Ц�̵/��"�B^��{�rM���$N\ y��Fm,s��&�d#Z�&
s���_�	T�#,8��u#!�g䷶!`Fw���w2]�YE ��3:
�0R]�=K�Xds8�Pd�SWw��I�dO����
$
��
-�k���I�o,$,�h?����-���w�_�[��Y��B��U	W�

��5 ;6��5!��HϾ��see<r���[;R�
�&�;��apW�T�o�,�82F��#D	v͔�cf�J����ٓ�

9(n·�)B=(}�!��w�Lz1'�9m��.���`7�#�$�'��J�z�#�6*��
�]!X܅ʹ�4�����w��$�|�1+2�ɻB��ꉽ���0+0��GFum
�m l2^�:����-���~Uq8(wj����N�C=J� �iW�')܌8��*�Kbh�26���̻����J��R]�g�L [...]
-�� �O�&zv�,z6 �F\OV�a
H��O ��j��1���p8 ��YD�V�/����#Z
9�v6Ց�Wys	\�ĩ��I��'r����
-endstream
-endobj
-20023 0 obj <<
-/Type /FontDescriptor
-/FontName /EOLHYO+NimbusMonL-Regu
-/Flags 4
-/FontBBox [-12 -237 650 811]
-/Ascent 625
-/CapHeight 557
-/Descent -147
-/ItalicAngle 0
-/StemV 41
-/XHeight 426
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/ampersand/asciicircum/asterisk/b/bar/braceleft/braceright/bracketleft/bracketright/c/colon/comma/d/e/eight/equal/exclam/f/five/four/g/greater/h/hyphen/i/j/k/l/less/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/quotedbl/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 20022 0 R
->> endobj
-20024 0 obj <<
-/Length1 1630
-/Length2 12615
-/Length3 0
-/Length 13467     
-/Filter /FlateDecode
->>
-stream
-xڭweT��5��N��.��݂C�4и����w�wA�w��;w��ͯ��ѽާv�.��>���BM�E���
(�rc�`e��:���*;��X4������w���F
4s�uI���@K����	�@�H:9{�m�m� ���
LL�����0��'�
�jk
о?x 
��
� �w��q�&p��l
� IU5}yY ���6@��
 j��X �l-� W ��	
p��`�����5W�w.qW���ha�
� :�1��`G[W��g��+�lr{����d��n�W�v+��
r;�{8�c�djN�n�`[g7�{V5)���fc��WnW�w�d��i�d��WKc�4福�-���r�+�9`i���`������l�w �U�
 ����@W�w�w�>��{3gg ̄�����l�\�V�H
��9-��s[ۂ���Zy�����vKw�b
@����kgދ0�t9x,�VHl*Nn�)��3�Y��D�?���D��y�w���F��%�߾��N-���b��� ��d ﷌@	��=�`�u׸���03G[��&��
u��(�?��
�w3{�8��]NV��m]el���j�n6 +3����m�Y�� ໶��=����0-[
{�_"���,���w��.�MW^KO [...]
�����o2�M�񯳲���
𑝕������ϿNF�F#
�p��ks4��@�������`
w0�]������y�{�@/��򂓅P�]Fv�[-~����=
ЃaΥ
Z_�V;uʈ��f�\��8)���=������;܃�@ם<-$�b����F��Ǵ�f\���G���ٜ��/���ָ��q�3
�d;��!���K ��3Z�Ez}<nF#Vm���䃻[�������
��
b��xD!3���#�7oS�u��+��疐zF%4럔����n�g��M�0⃑�|_��h2g�?����k��q��/�41L�hd����qo��G~NW����W�B.C��:�,�'�<�
M
)>O��g5�K��]�H��D�`"���o��]4C���w�_��5~:�[P�^���eP#Y�<��������f'�����5%%@'+��$��a���#o��V�}
i�ઘ���
g�A��d�����[N�&�ǭ�����Ŧ�j���?I��>����´�$�6@��	���֧�Ők���w�4�� ���:z��	�i�E���)�5zH�ܮ��<�@e��ҏ�%��aLǀ�:�<"8��9ϐ��Z-8����t����k��
X3J#���냞~�A@�I5
�I�3)��4�;�.�
4Abr.�C�
d�J�
�ppt�O�����8 j{e���P��7�I�t�|&?�)ͥ����8���B
�_g?���a�{|Yx�/z+u�:?XY?�a���ɡ��#
g�xS�\�
� q�%I�vb�
�!��߰�x�۵̳JQ����0��`;��Ǽ9�D���_����{�8� ����Y5�t
`f2Z�u%g<���}�9���:	F��$91I��VBZ��	Dc0lմ�2f

�&�]O��˔��қ�X��
f_m��.��.#��u�i'
}�n^X2�2;j��إ��J�����B�f��d�`P��9MJZC
�a��#Wb���]�T/{��#�/��k� ��ה�
<u��Xi�8ƈ��q�R/Qι?�
��T��w
���a�ڂ�.����r].N�M ����k}ۍe�m��9zh�^(o��c�1S��ZF檧��|i�b�\��n�f��l�M�(�B��=hux�Ki]�_��,^4��z�
-vw��d#�77��½Ã� V��
3�	U"��zww���Y�
-!�4ܛ'~|�k8��T�� ������ӎ�#
bV_o�XM�
�>X}�Ԋx��>���l���8�����݋���y�*�Zy�Q�i�-�@�w�9�D/c�H�q��;����l4��DB�=s���g
ic�6���r��
A�~�A}T�]�t��8{p�k�܃9r_�[�N��I'8]�dvy������� ��.�!Ў3^6@'
h�J.G�dj�Cw��L"ɴc@�c
��!�sD��3��nD#�@���W#%=J�s�f��
-"i;>T;F��.i��Ê��a��B�����KÅ�@o�X��<R���}�+�87-���rNu�|�>t�a����~+��P�}}u�c�fz$01\�&��=�(�5Z���F�Y���¤��0p���+,'�����ڇ�����qB��cZc����ǒ�
u.ɏ�Ȩ���
�����?��~�׫G��(�fI/6�
��^��r��+��.���s'}�$M��$¶j�Ȃ?EՒ��K�f�8sx�� ��4fCA�[�
-Լ~w��b�i���A��P���q����N#l��ԍș	sA
��IA�2}�sc-���V�%~��
��^�<SGd�a�X�b��j`��R�P���U9u�&xy�=�B ӓ�
-%0{�6��cx�„�Ŏ��;�=��`f�Q��(�8��3U�<�AF��-�m��z>
z�=�th4@���)@Y؋V
�
��A�����O����i��f���M.H]G�*k��`������e �5�kWB�<N/)#�&
B������Pݛ@T�=3h^��Ǧ/�

�;��r�����!,|�34�mi.�&j��
ԇ��~����Ȍ�B�4|�8ޖ8W��3��u�r��L��3�)a������1炌ɓ:m��h]l__[}F��Յ�
�Y
#c�t �7K?��~�$��ɇ"�

�7%'���s�8$QZ���Ă	�� b��;d�����gJr�h\n�^j���3���pv���q	�{�
��z��w��}B
-iL�T�&��
UN�W�}��]i1�H;ھ�c$;��\�';�k�"�
Dr�����fT>�
t�KF�1�*�y�M�����V1~�t���V���
i���F
B�,���x{�՚�[񑐘� �
��\�r^%JC�У0Ud�؊Lb
�'��)�?_S�>}=/B��p?4�����R�>��L
-�4]�VK�yʌa�~D�3�
_W>EL��ءO��N
ф������{bҸ^���^�}���F��mk{�<�l��
r�y�K�9V�r�!F �h�o*�}�s�v3����r�,��Y�k�s��@��
-�2.���|j>�lKg_NFr/�$R�`A�%:b'�X=b�$��qB�G��+8<�7n�X�$�a+Զ��NO����M�>�
�?�'ӯ�*����\�[Oa�e��3&<_�u�~�o�5���8�M�N�
-�xL���`��1z���������GX���g��y�=,C��*�~G�j�9e#v����jo�k��.Q\�M��y,_>>�+�vBŁ����
)^�%��%+��z,��#��_p�+yZx�
'o��u�3��4���6���\�ߒEܝ@K�U>��:r"�.�oF�qf������U�6+�<��2cEOX��΅�#WI>�CЃ�A5Wlv'7`+�>�.*i�mb˞�XI����ژ��\]�ZO5���[��y�$]|��
�Zx;*d� ��R�"� T������
�kݝ��&�Q�—ߘ����mp	�&_���M�n�j�4ƮQ��{u��U;��r՞��Pa
-�8ѹ�׎
Y�����h=`�Cj>_�8�q4y+*�lG��j�X��-�B�k
�~�E�������ڟ��h�}�kZ{��߶�9ݭs�]E�%K.��-��L�8U-
�?c���"bm#&u�])��꽯%���CLqFg�b$7�̼�,V)Ɵ���|�i����吖���P���3�o�N�L,sd_/C�&���Y��~���
l�J���~3~��R�QEח�
��9�j�<�x$�U�y
4���^�r~?uF��G���~s��'������}:T�n�HF��b�P9����\�~�@x�,\�(�e'F�� ��uX�s2]�����]��B�]c�XH���1V�U/�NBrd
-��U�@w���D�q��8f
�j	=]�2��7�l�ՈҌyҢ\^:J�jk��,�@�d��y75|2F��T
-��
�
Mm�
Y��У��Ǵ��_EqҦ���,H/q0�+A�U
�O�(Z�P ��:|�.*b8r�]'��#d�k?axc�(�i��C�f��-kp�)�}���Ȳ7lU�
�ŰR�i�"J 2�
`���Z�|;�5(ΫQI����*�O�9F�P���*
)�c�&�o��
�]��?�U�n�/�
���
�q�{�D�y��W�KNy{�Z��4X�!��t7�����=�)���a�9��59@�����!̺
-3��.��C��>fix�� �k��u
��t���p��<
�
o�F�L�X
-�9
-6������:V>�����Ϻ���/n�bZ^�"����,�`��e�L
�o��
�b�����=n�ߝtp>P��Q �2����
�,ҥMvE���&�4�^�*�|n���e,6%�(�!����� X�X
-~�&i.�鮢�
�e�l�R�U�=b+N�=0k�y&y�X n\ƥ���ᒋ�
#u�0�%
j�d����}���I
',Ǭ3[����
tUPrp�2 ��
]���^��$p�-|J��.����$A�N�K�yv��ˮ�#��ދ;���������HF���1�{xz��dş�/�;f���F�$����ԜJ����#٘���U�������;�;
�
�%����&�	cm
��N*Z�Ɔ�d�"R�
�+a�2�p��{2eh�o������ɍ��79�K7��nc�$yI��b�hD�\�x�?G��$4o
���eD��_�{���w����S]��b����m��͕CQ>䨣���)}��y
���]x��;�@`�S���<W]�4r�`c�� \��lK?�<YF�����"�qG
����5Ξ�RE咭dXG��hGrF
�K����d}
�7��苪"��+h�����(1s���K�{������xa��6�MӉ��ό���$v*Y
������O>�[�j�S���h�T٪{P�dž���|�a-i

r10YlՒ�����O]{��$���#�|c���^�>:P�1On�&�ڶF_� SGP��ifv��{i�:�E��{<z��7�\z���O:Ʃd����g
�(��b�I����D�A�%��W�E��*�4�~��wrn=��u9��8|�	V!����Tш"�(�����ʐPI@����^M at z�jT[�U��\V4X!#�oC�3x0�{l�AqT
	.�98b��{��]0� 2F���-�p��}���j�A�R�Q%UޟS�����	�6~ȝ�q�
�a��rTGuo~:
z���z�H����(�ܷ.\K��׊%p~ȥ�N�����[h�qS�1DFQU��F��Xkc�2&��\�1�-;'H*ׇt^�<����D��׳;���^���LŜ�n�a1r��@U��
W
�f8,��w4��!��%��(���_
��#d�]��x���j�|��l��&��L\�
T��r���R�Y3'"Yj�
�	���)�B_� �51ͪ��B+m��U�n��3�ð��ۙ
��ZPIY�2�����ւ�
��,�s;۱��JW*���ܗn�9;U�KBw�r�r�2-���;��ϭ5�
�lJ*0�&&2��j��IM���E=�]� VH9Kk{B��(kUJ`��ls�
-�^e��Tt�o��7�Y��YxOM҅�K��YIauT����}%k
����}̠��>�@������[e��
�*W���5���K8v���@�P�q�h6oKyc5MJ3ߢImf��o�uw)&*\�zK�ψׄ�
���Rm\+��K�a
�Rݰ���������5A�C�<�1�
��ʨ>�J�ޥ������G��!+�O=��u�!�Єk�C��_�^�z���S�.I�s�H]|�c� b��ӆ�z���^R��b) .NHQ���ul�]	���\!l�Lk��aLӥ�
BP������jy� �e�>�e�k��ķ��1�#w�9'p����}�;�p�!������.Ue���#Y
������v�~�^`cpc��M��)�����%�����o׏m�n1j;��e
-��J��1���װ�ƻ���oRa-�4C���s 闸%ywU� �N����
�� �3q�8<��[�@(M����
-G��ō�]
-۷�
�� >�='Tg��(v�[��
,���|���9R��|�C	]G5�ZPǟ?t%ۗ�Wx��*�U55�H��ʽu�-n�O��|*�
�*�ǝr3v8
��z����jk7�������"��������#*Y�
�
	�c:r��gj��Bҩ�:��0�l���
�uZ�
-�@�h��(�����j���xT��2jϐ�8T���v3䬞
E�Rݘ�V_
n. G�4
	����]_S�����"����v�4���KQo�[Y��[eJA��VB��ސ�^]�hW2�����㻻���
�T�A!���N�b���j��1�?�mN����۵���r�}JF�V�ψ7�T�Y/��e�x��o1s5 �H�����%��<��lK�q��I[⠳�U"?��0t�=S����{��;г��ZV4.��7�(c
-
-�;�HmHOߞ�ʯ�䍂xʃUܷ�&Z؏5�N�
�HWks��\"!Q�񪧘�.[&/%�`#��A�$f#�I D
�}
-��J���>��Q�C]�Hkb���yK�͘��2�yn3��^��AY�1�#����GS�=�
:�ݵX�-Gȟ7�% ��g
-��ʔі�q �h�QxK�Xs/��Ę����9b����Bw�Ţ�Y�ʣ���QjL�%����u�pn���WECI�}�&#����7K��o��v|wq%=P�{�hc%,���K)ub#��IRĺD�
�%bV�*�\���H��iV���k��34zLwZ�2s��w&�D����3��O,.���0��:�>�{��������ov�#�m�M�2b4j�(��c��`��z�~.m7nI%a��� ��z��5�t�S��L?bpP�AoDy��N8$
��
S�a[����R�z9�߯a�
����m6y�N��'�Us,^M��������mpj�U7J�Q�h��FMd�g������g�yueU1��{��(��R�����‡ƽfD�)ܴ<�+>��<���7��{7��3b&J_�#7?���Xҷ��^_H��N����ݻQZx�)�/�P9nd?�
Iz��2�Y�
��NIC�`"6m܂��m����P�/l&���z�r�� [...]
TpլIK���Q}�ծ,V�ˬٯS���n*�>�<hm5���xk�#A�0G�Ï�5X�_��8<ۗ�䨴Α{
�Z 8]�*9�c�A��"��U�1��۾pR甩�!e��5���duX�	��2��z*�Ek��h~�&��kD�U�6#	�-�T2�
�RS
=y�N����h��+���
�Q[��ȱ57,2q���	�?�[O��
�ܙ8(�0��׉�i$��b�Al�%>t8�)�,(g��
-mN�1�����N���^�i0�]�
-)�<
�-����+R+�e�6v>(o���������L{|ĵmX��YR��Jv�WR'1�������O�e1�۫��3�
���Z½q
%���}�Z=��*�k��S���W���̈8�JA�ꝔxO
���@/�%���F��j�j�M�GRjA+�ئc��}��,ׂa������ 
O��ǔg��?���}���.�$â�h���M[�cb|
-7�7x�aN�wd��s�|8��Y^���+2FXC*��EƜL��
�Z'�,zcL
A��X�;�m��.;��VaX��
C��~6�7��ƈ���Ƅ2���a{^1=וN�q`}�gwGG!'Ќ���'����x��X����l�
�e����H��i��1��G�~j4��^v�WE�W�m?(�Od����z]�f�w�fA ��Z�{sj�
���{lB���&��9�{���I-|
�%$;��1_f���S�8���l�


d(�gL�R�z��}�
��0�w�&uDW�m\�wI��-�{m�i�pqi��7�O�z�0fI�C�"!D|��#�f?G\I�%~Ŗi;�4��%3�-}W�,
-JRn�ɟD
�j
]SR�]�	�^��r��E��������'$0��QV�e$;���_�7Ci�9�d�r�&����o'�
C8_���o$�W'�:�x�/�9;����:�?�����z�VrA*�)����ן�M2��

-ary7ad���s�ӭ����6"�.��5L�̈́��������C�H�]/��
GU�EeG�W�f�O®���C(��O�������]˂z��� h�ᥭ9{|�ΪU�8�1Q��I��0}&��gˍm#�
�h�G�����_�Kϔ��q�7��
X;W
��ki^*���������)]c���%��r���C�]��
���7��z�7���_6V�ۭ#�;-k��*���x��<%���g�{�S�����s+яyc
-l�����뢑T
�[Y��c�O`Q
m�����[N/PSo7+8��# DK�E����g�����3���~�����T`%"]�Q��Al�u���2	���!G�ձ	�x.�|�)�S�l����"�
�|�S��ϵ�s
Uw��
�.���Q�s�7��Q
Ǘ��z#��>+�����pӃ�B��*��)f��<a��\��K�����7{���+�R
”�/�E��=�7ڤx����v����'���� 5iS^ߠ+�c?>�*���*�[���壦ђ�(�߶�p3z��f#o�_g�8<��h�<�zX�ҴɊ�z�o��%x�.��L�����WG��=5]��[@ ��ɔ���62n�iM+t�?
U~��
���n���
u��<7�~>���U�Y�1��%�#=�m�'�qh>'w}B�&"������ϊ$嗟
$��<Z$"�/���Gh������_|0����X wfw��7���@��dm�ri=j߿��IT�*\�:B���<�DhQ�|�MK
'�nCP&��ݢȥ�a?Rʩ���>Sh�	��L���S
s��20�@V�|>ȃi�#+�$�ɂyypPdhZ迳�_�>E&"8��]����UP0�;4�q(�7 ���C�������0�
���V��h
����`�`�ʰW�4{��i�b2 ���,
E��N �i���]�Q�gKoG�}��V�(��֗�݌�{N�.;ł�?��x
�[4{?��'޽*�8�(���oǎ�['��~��8y>o�)I)�P�;.���}�+J�[n�X�"W��u�y���'}E
2XP�̏"at$i��Ʌ�{��Q �vz0��!�I�oa�r�
��*y�VUN�#��18#;�=q�{�Z�{plB�O�����	o:�>:�W
������k�����L����-#6nxc��Ls��	��!�i����>��1 ��o��6��n��7��q�/�x�	�?Gx_FMGP���+�SYy�
f(�Ơ���ieM��d�d�~��u�H>;/+�q�B<�*���mqA����&0�kj�G�eT�v�|�V�Cos�S�͜Q�
�c���a	Z��	E%��n�(
�
�yZ�
*��nr���t�9���B�2k,
-��U~�$\����u�KDE)���Uʹ�
���RR�����X�9
�˸��]�� �J�R
�2��|8s�
��UJ�h8�]��z
mC
G���- &@�yP
�e��:Jݻ�2��
�g�mȌ�*(� "��	�}��m��y��
�Me���e�ê�<
�-� �O�~=;+�W����d�����G�QP��iV�&/�kK[Dz��1�1,�1��z�&t�m�L�F��10����,Zj����W�x[�6�����#��
�޿��
v��o�L��;j�}˜�arjIՐ
��{(<��4g'�9�oD���
A
DI��*�`��3 Ж0�%���C+���z#|)h���ؠa!�¿t��0>�7[����wZ�~�N�U�Q 
v�:��Y�j$Fk�����S3����M�+v�
i�
�&H��l�d�g���!�K�P��a
��8=U֜��C�z�O`���i�
-�1�;����\���
-$	�1��F��P5�;4�"t�K��
��b>��$%\�Ix�}�-�pp���f�
�D~�H���0
P����N��şK9Nz�c�}�Y���#jUtu���
�
.z:E��I���<櫈��
I�ף�l�af���?
+�-J�9�dû�]�*v	�HByJ���
�����fR���[���顔�*`q��L�*�����k��#��G�$���w��p�bvLȅCxw&���P��qA#�����@����GNp^���fK���
�Gj2
n��?K]��(2.�A6
�M�WdP���J
��]�1�y
-ϵ��}���;:B�<V����)�<�BIw&
VP������:0'�S_�D�
|�L1�z�����8
RP�h��
-Hp��
P���z�B�lk
ߢ�~����� e�=C�(�8�c�o�ٝ��L&��
i� @��ߑ�'ؕ��ۿi���l	�I]em�=��-�o��.n�`.u3��-���,Ow�I-� ��
����)�M��g=q����&K5*���)]g9���Ty
-^zh�VrH��3�
��
����ૂ�>Z16�u��8��4E��ݲm��"R�V���Xex�c�uPڈ��
xg6��c�m	Ѽ���P�"����U-�!ݧ�A�1J'z��i�$�b�>����[�L��
��cu��Ǟ�$|
+]�b�����VDT��`�+���^��k�c���
%�@�^�46S��-z`WP�ΙG���"��'��u����+����Wh�	y?�C6#Sg�Kݞ�Դ����,FaR��ٰ�x�X�f�/������4�/-8���o�H� �
.�������#M���['C�Һ
-����~+�TҬ���~��F�b�7��+<D�Ƨ��S�͝�
�zE�����b1b��YQ�yz�ag�H�W��`�PS��.�̡�{x!ȩ2c[&'m'�Rxgː��P^��~��@��-�6��6Dgۃ����G�
-$B&�V6w1�EkC��>?Jc��1!�����<��E~���%P>f�����S���n�toC��s��e�u�
����n?���a ��-��2��W���
�
]���7}X�O���ȣ��Ka!(`����yT�ȃl�,Yu<��e��W3��?���s��*�d%�n��(��b?�*h&
�Rޜ�h��a:}���/��K���h���
ebLS��{���ݓC^��0�ۗ�U����JB)��
-c�
�Ӌ����¼���f�/���U�o���*	*�hS�_��k3(KA�����iHzJ�G�T]6}П6��1uV]f4K>Ec��L�VW]q���!��!
;�d
��3z:�)���,����Uܽ��2�t۹�3���
�n!x:
���.Qt�M����ԽІ
�+�5�tP�{蚚�!;����>��헆��1[��&O����� �K�ۉc*�ѧ;�
��������97<����mI�)^��֥:�����Ն��oD/��
!~nj�K/Mʔ��p`
b�Fn�rT[#�ŰK�x�&�r*$i"��F���_��j�<lh�\T6

��*�z6�Y��t
��i�{/����
��Fr�{JX������f��c%d�
-P�$�=g�s��E�Z�f�+r����{ʘ�Z�M���Ig�
-�x�=��I�5%���V�%`h6��er ��>��*i�e�X����LQ��V�:�;�����'�}kD��!t��ۧ�d��ѯ�H�N��ZH�Wx("�[jA�;�`�]
���Y&��%�<�P�,;UL��L�$I�1
-��=p�����ƯD���܀�ׇ�
�o�%�g���X-�zg��^��^m��4xo��6��>W�
��$� �
M
-'.[�P�*�</��ٴ�7(��b������Yɯ"�mγ�sQݣ8H�3�Bp��,[-ِI�0sGP�_^��m
�{C������$ ��
-��`;@
�߼
�h>��X�Ss8�0Z����k@���H�!v_��\܀�����
�<
EJ)�AQ%�a���F�#��z�b�VNx3׺�I"����~ӒW:��ȉ�ϱ� �Ln��Ż7A)U�]N�&K�=
-�s�mN�đ�%���
��Za$�q�g��
-�	<�|�H�~uuze)u���G���M/;M���
���*�
-*�YW��]�r1
x�V,$�
3I�.M��v���+1"�_~8��'T
r�7�O�a‰���C�55��d�Wj�H�ͻ�y���p���d���|�h���
-��;z�–�A����i%C:���X���5��/'��	
u���W������5��b��]1�-�'�Uʼny�,e����S���lL��a/�et%(�?�J�4
ie��s&�;l
�T7�P�B\�W�/�
�*F�w�ď�oP��H=R���\�DXţ
��XZo�5���u�Wˬ�$:L}�8IY�@��m�,<&|<
-���1Y�X9ӯ&ח�!U=�!r�ĺE�
���jΛ~����ߗei��FM�0���I\\�	��_}{W$��H�5���6����}<�s_�jݍO���P��]��yI� (2��YG�;I�������/��tE=���pm�?�AG�w:q��ڸ%��V�
�/U�J����g��~�[��
dܮ��4�c
5+�,
B��HO�X���=F���}��!�9/�
��/4r�.���J
-�8�v�gX����q>����d��^��
�
-�>��b
�l�!��X$IO)'Ѳ�o�*�-��TH��p]��d>��隼��ѣ[9�lb�ee��.�
����
Q�(�
�w�m"Z���"%S�_�Ą���.�	���
��@*�\P
-�^�v��6��x^�
����d[
CM�͖'��`ɭ����#�:|��_�����D�z�(l�
�$���yO\�QpLd���)�=�e7�%O�F
��CT��
d���4�P���3�*V�k�7ܯ��:�[rC��αl������s��	%��:��u��9צ���d�-����*����|�a��ݱ���
whx8��^Oы	Q~��_ ��
�'�N���H�d�~��:0�o����@�:�4X,O����1
-�E`C_�@�y��*dx��^E$�0G�b��␱�����8��
-endstream
-endobj
-20025 0 obj <<
-/Type /FontDescriptor
-/FontName /WITXSS+NimbusMonL-ReguObli
-/Flags 4
-/FontBBox [-61 -237 774 811]
-/Ascent 625
-/CapHeight 557
-/Descent -147
-/ItalicAngle -12
-/StemV 43
-/XHeight 426
-/CharSet (/A/C/D/E/F/G/H/I/L/M/N/O/P/Q/R/S/T/U/X/Y/a/b/c/colon/d/e/equal/f/g/h/hyphen/i/j/k/l/m/n/o/one/p/parenleft/parenright/period/plus/q/quoteright/r/s/t/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 20024 0 R
->> endobj
-20026 0 obj <<
-/Length1 1625
-/Length2 14063
-/Length3 0
-/Length 14908     
-/Filter /FlateDecode
->>
-stream
-xڭyeP�]�%��N���w��.�KCpw'H��ww
n��!�Cp�~s������?��9{�����ꮦ"SQg�d�hj!�� bbcf�(�M�\�M
��
���

� ����	�� a��h[�$,� �� 6>>>*�����
����TӦc``�/�_��� 7]�V �w
;G'{
����Eu

 ��`	�� �+���*Ih��4�.&v 7S;�@hf��jA�tt��� 0���75W��O� �����㚅����_��d�btu�x ]V.&���
@3;7�>얎�rrq����>�T
]A�f.@'�#���Կt��M@c�?`��凧����ߔ��>h>P�	�� �� ��ej0�:ٙx~�� sr�#���`�_
-.V&.�v��4���_y���M���<������j �\-�,���?b��>b[
X�����#���_vs7����-\�)�ߙ��ab��`�	0��D`Qr}����u�����-�i��H{�����=�?^�����ߩ����L�?�_K�e\
-��{�w��l��2��y�7���Q��_Z���;&
2�(�'����2���t�zX�� Af� K��j�c��P�bt����?0�����a
4�u�[~�A��ߔ4��,bZ*�J
��n��S�c@�N��w.����y��#&���fb��0q�� x?�.���
��:+��\�
 ���Y������d�o4�f���F
d�`�1g�i�
����|���W�#��8�3�
f�
�f!6i��ܜ�q	��
6��P��z����*�n���-�r��P�I��V��c��=9���

;��T��<"_
-��|�u�v
�� �b����9�M(]nV���qU5�/0ē�
.p�t��X��P�̾��cw�5�a�
�P'
����9248�}ݻGȐ
O%`��rL�
�4v��7{�~r疿y�
j�|*g|��~i�c�_/i�)@f��
��U� ��MR����1��҅�`V�R��.���s(ʨ(�G��������ӟq����X�ـI���Yx!-<�
�ҳ���Ll#��<E�
���hzK#ܕ
5�!=>��ue�'�4/�U$u�,�Eq8�h�"��e�GG�b
Q��>�t텝��I]J��|I����n_Gx��ؕ���߹����dK���w�(�M��3~�lx�<�|������� �]����
O`�.��G�:
��jX�e�	"9j	����Ws�̋�2�1ѵ�L�iO�<V������%G��
YTZ�5�}ۙqy�
�[7 at eޘ���k����]18�7�|e(�HJ��ف	=��s��c#�#�C�
�Lh�V73ڳغJ�,�=gv�J�p�65
l�(��pR��j2�?'A�Z�˶�3�nj�"�Ӿ����ѕ�q�(G���{i�)y3w��e�����r�`�Cq�f����*e��:��W�Rxrkx����%�yK�O���u�_�jO
�� 8u��u
I���m���sZtIG��=�c�Pr�#�⅐ 
���zZ��ԷSF�s�H=H�,r�W%���<F1�Dvk��*i�$�P˸x
-�6��Q�
�:�8����AӇ�K����#^�����cĖD'K������_���O�z?�V�-~�
��\$,I�}�ؒcrp���:�_nX���7������������
���
+��N*I
C��$#cן�^�i�:2�|F�B2q��
)#��cL��Ӥ�ރlY����@7�¦q����������:�����pK��N_�$E�n���)[g'��t#'=�!�7;1��a)3�+H�lӷ����2��72�I���
=UN֛|g7��Ikȹ�0�	=�܄����s�Z �d��6T��qo"�)W?���
ѹ���gk3�O��U����Q�\T_U[�<��c���ˆRZ�E��z����t�1��s��y����`f�����!
�k�A���յ��T��(Vkg�5�?u��z�	i�`�7�!AQ�9MU䧣�#�~��DCa�<�ASo���R�EJ�c���ݿtnv���	�aY�6����FZ��:?�z�������l�Ѱ|��JX9�-�G [...]
6�F'_�Ku�#岍B���.k
-�������^���7���W?
(^� `Q2z����E��!4\��
�$�I
�b!4�l)�zg�O��z�XVw���JV�������qN�_3R�J[fTTkN<i���9�6X���a�e��Q�C>��X��&�n��>��e.��m��`

-bC���	�֓��_c)+�c����J0���ѷRj)�~L�N�3]��F���T�#|~󒏴Ȟو;*�N���!f!��N�2�z�YR(�*����!iw(
-IT�E����X�f�R���l���o3���~O�
=�"W$I��&�ٵ�k�8;$ۃ�f��!B�4��b.;��`�p��O��7�\~2c��=���jf��X��ɠ)ei��
u-�qXVe~�
-��B�(�7�b`l��j�
�=u��4:�
Š�PW�l}�#3oC�hڲ)�$�X��d�.?'j6����w<��~�>�t�
�����%بj�LY�,@�g���!�cd�BzB��Hs%j?�2 �eۜ1Q�aU0+�M�ؾ)��q��I��dߚ���
-��Bn�2���Xb���B��0�M��9�C��X4�x���c0�ww�>���H��IH`ɑ�df�
)#�k۶Y+�nE��%	N��j�.�mX���x�!�}�#����X����.�3'��4
{�\ť�E�p��E��
-�!�o6i|Պ�p���'j����K؝U����{����z9�7?<��.ѧ�H��i����f�+��r1M*J�:6�UX�
װ[Sf��'n�I~H3����b�M
�5
-�n��͜_���.�g0M<�G�7]f�wCnn�[����mGs�5 ��LW
��{���\�4F
���j]��j�=�w���e�(��kIƅ� �H��R�ᔺ�J�>��
(�ͶW�}�-�~h�uHU��܀���Aϊ��1���o��:5\�K�V�
��;
-p�bL�
�d!��P��%�@�\�4
-v����
�}%9����.K=?���N���
E����r#{(�ɋ-D����l&�5��x
4���pa��u����$e��=��5n����q@=_�'���M��3�*8���@_(�0�Ё������
h��hh����Zڃ���4#�Y"�2[S��M�uɂ>=Y��%Ľ�A(Q@�o@;����XR�f�ႎ�|�@������!�1�0�{WzY|��g
AUik�
��	4�Ƈ�÷���N9Wzśi]��4��Ӈt����ʢ�|�;w��$�(	M#��$~5𘵄��hh��f
S��)��DJ�
`T�u��&
ɴ���X*Ry�����
/
-�N�L��g��H\m�ͭ������y
�X����A���9��{�5���jM7�h?pA{���h�h\vL^s�]�%��*Kp K�m��qYfQ��@�i�l���x�Y��(;
C�T`X��#K���fK!��8T��A��e�Y�\���ן.w�6�\ڱ�{D��U�U"l

�9cJ9UN^%v�
@L�Y;�a��/ϣ`�~>3�5L"�_%��)��Ou�T
���Q���C#\���'tIoF7=V��
H���]ag��Ƚ�h
�P
+8�e��>a7�ԓr��L;-�a�E'����
W���Utƹ�U*�MRl}˩�1.U�7�
C�[���.�SB~]'�3X
:�n�CL�k��G�>�.�/cY<[��6<w�o|��?��L�2íGm���ܯf���!A7���1I���t
o�����N��i�!X�ӄ�8g��ӡ�n�Q�V/�HB�f
�zX��#sΖN
l(SmY�_,�gܨ��#�
1�iu!f��(܁k�o23(%?��eN��~Z���m�㌋���IjW\��.��I#i
7�y��X��5�R�
4���'�'{�tlr(���CTU�Wp\2���#��S��BZ�5�e4\�=�T
\���9��Q�
|����[Yj�-���%I
 jy�Ƌ�#KiaC���[�f�����
\]�
�ѫ.
iv����� ~�D�l��Q
-��j��ջ�o#e�$Ƶ�S,��
#U2�
��9Ÿ�h��#p�~�sF�k>��H�џ�bl�4��cj5'a�J@;Eoۼ��9%�-r��A~;�v"K�J�Ij�c��m
���
�����ٲ��_���5
Ԫ�6@����j�W�)���M�_�Ǚ�]�.�Mo��y��"K����29
�� ��fp�
��ˉz���ɚ�/��
~���_�0���
\��Ys��3��q��%	7���O�r�]��z&�dcx�'�ǰd��
-�m|��D��_
c�}
��"H�Z.��	M
\v�r#��oa{$�x�{y���}�
��3�G��rS	)��H�j*�	M��Q�񮖈ce���q��)�}�2�
#�*>SS\���PS���a�d�qJ��ދ�W t_Uk�7�|
-���
)䬪W*k6���зMm�Mg*|a���T�@��KM=��`s���'R�m�
-U�78��pT�m<��&�Hl���e�KFӅ���r�7X�CZ[����\o뗨�+ύ�[rMQ<A���5�95K,����r���Y�9df���N]G���x"�%o.)4
:"L�NZ���n
.kD=���ߣ�?���x
��(��
��������G7�h�������E�O����ͣuz>�B�UuSe��ԃ��<s
�� �\��j��E7�Yp:��U�ƾ�

�G��+���!,������i�qq>w� ��#��F=ff�0�9(l�w0��tSH���z�~ ��"���I9�|�
lUX0��,U`�Z>#��!B,����ɟU0����i:s�I�{��������w����R9PQ�A�
���bO��Y�q��Ú�6ۖG\��mi�d��
�,
9�׃�j�*���!��S4�Y�>@I\ڟ0�J>e�Ƀ�W�?�E�r�KOz���ŏ�9����i>Y��:�[N���
W�	��n,�bظ��v)��V(�࿞�=�gQB�4r�4*` [...]
-��šI�Uy����3]�Z\�Xe�֟/�"��E�_
�\����P�q�X���s��㐅�I(�h&l9��+]G��I�1��"��Y
-�	��q6W�
jǘ��+Ť��F
\7;�{���&ͦ�\�E��4�	���e)l�=ؑ��T�"�mL,m��K �Ч�	M�z��g|�B�)��~c(��+P;XQ<�N�AB�vR���+U���a�^﵃q/�h"$�lON�vA��>]��~g/��'� ���E,��ʳgY�ֽٟ�2��BTy:N����T�8��0
-�B�;<fpQG�u<~N-��JX%�3�?dQ����:����<����E��
Zsy�99A'��Z��yK���Oγ�X�������5ʩ
-�MW�]6QR�P����h��JU�m��7�
9�gp��������d*�\����F#�m�K�a�TV9��]����4��(��
-q�@pZ�!\�h����Y�i��Џ����(Q+C�H��e�9��ݞ�'�Stq�c���. �᫮�|���#�â�v�
-*�D�6�eմ)�$m��#�:�NXZ��ƨn
[�5˂��J��1
OYCq
-��Jd��p{SW:$��q�7Gi|�ϖ8
�T����[ޘ�
�F�y��j/�'��X�
�����a�>��췛���
-ͺr�o)���Gol\(��~��2�_&�>������+LSt�]U�1OLA�W�=���H�gȋ�c�0d��j�!�Վ��3Ѣ��Z�!����뺙���~�|K��Dn�l��,&� ���k)�r��'h��j��z�`�rm��H�E3�?aӣ�Nv��]�74�9C1�{A����^�sd�z��i�Ź��iM���}�`B����g
[U?T	��AQ���p���q
�߃x�|h-��2��
z�MY�����
��|���-���Rm��K���A_�f��Y
d�7��I4��i��/�\�mةwM�݂uPZM��d�� \��B����w��|n�
,'�x�~}�P��J����>����=��'�Y�u�:�Kc/c&4q��•��j�y��^�,C
HX�}�:ޜC1;u%���M�Q�^oJD�H�$�ڄٶ=���s��
��b*�J���L1tRؼw�fT�ә�#�:��z�!�M�u�bT�+�+��E��8*M��q/
�pݫM���Z�Ec�Ii��>��
����In��\Bݾ�i��mm�����
.}oؕ֡B[R(yO��
�.�t�z�Q+������Փ�3��Mj�T�Zխ� �='e5ݜ��Z2j��l���ܗ0�h�*��
N
dw"I%���z_�ح-��P����8���␐Xs�d�\l2k&�3������ʞ�
-��
H
�s��3����������2%ދm��F��P���%�����$��8V���y.{?�e"�(���b+\�.�t
��t��~ڴq�L���5s!A
:�r{���R�������/]̗�%���B��w0 -�=u_SϺf�������m�y�Xn�94�G5�QL�W�^���3.�5=�=��:3��h��'�w}��4[�t�
�C��m�$j^�S�_}y/�
�~�C�
��0z3t�{wQJ�.�$�W����
cȾ/��~�	K�s����M��/��k7��
e��ƙ�ݸ���"�R6�J�Г=���b̥���e������k��pkoy��\?�׶���ְ��9)d��:m7F�s1�
'o->-�{�V�dCHіu�@��X��#���D?�
�CZ*�k&!Ҽ�����檔^ߧ�]��
6�d�=�mh�c�n�3]�ag�$��P��	����K��e3��
��}��Qy$��+���f��Ie-���~I��R�;��‘@�vih]��\�EWC􀊼�
����������C�W��a�b�#�BX��A}���M�h��.����/��L�\^
�
]]S
P�
���2[A�W%j��cI��6.}G�3���ST��~��G
^��]�ur��}z5�|�6
�{�V`d�WX���h����~�~
d\�U����Yq ݥl|�,
�;/s��QTT��6q}um�F���6�p��U��y=mfV��DB�ŝ>G��mΒ
�	�Kj��n��ƉS�N�����8o<��=�
-"�
-C�S
|g
ff'?�}���E�<3C��h=s46�v��셯��,�A�MG�[�2LМ����Ҁҟl��(Ґ����s;2f
����%�Jd��?*�u�D^i 6=�(�hk�9�������P�n�0�I����:Dt8����Vm
]��S��&�-
�,mD�V�`l�M'����J������g�>=(�aÜD��ȭ�y��Y}~��;W�V�Y��&��Md�X]ӯL-�[~������\R��F���ۧ�:��"��QY>�޵8G�X�|Hy��v�Z�]��*�k�#nb���U-wo���J>k�
�c�����Py�$Ԕ-͘�6�GԸ�� s��ش|��G
J^#�p�O
��Uq���I�+�(*�r^�5,Q�c-n�þ�sA��w$�����X��aҒ('�Cz���l���vdFg��&��r䠕:	*�������D1¬̤�ϋi��
|ї����1��dX��o�m7�*��;
�`��4��5���m��`&
3����/��B�@�f��d�	l��`���|
\\�_O۳���ɨ��
�F���F
-�BI�||-�)�|��
��5E,ɴ�E����Z��g������$��%����
-��^��ŏk��rY
�
�CF�o�d�x��=���b�G�"�Չ��"��F��x���s�.[�V�*��c
�:m���]@�^�j�!邨�g�{q״fM�2�96���T�$��yo�f
�1O���:��
-��3&z���J"� l~��4%�sx��x�#�?ŷ��������S5���r@����ߩX}�a�

~�P�r���{�n��`z�
�!�� p����z"l���n�$�X�q���rC�b��!GlbO������\����Y�|�^5W+
%(�~�n|��S��
�#
~�[�I6k� ��-NJ������n!������|na��7E
ߛ�{LS��60����ss���V�\�	S �I��o<�Es8
�i"Up-a��AH�uf��1�\A�U�"_�:5����ϐ�����?�m���+�����������/���w��l�HP$�N>~z��b��Eq�Q��]EZ�c���Y4q�N
�'�+�|+"kL&���&�y
 *}-E�f�S�����'��*�
�6Fv�H~ �k?&GP�o:��pYo�&��R��w+8W��^�Տ��>q�/���ÃzId���X1=��$����/�R��g��-�U�ىi�
aL�~�5�- ��Y\=�)Nx��7C�R7`h�L�G󀆍H#�D�����uv�^�k$J���#�l��
Ar_ ��Ol5*g�7�t�E�W�U
ɒ�DdS�Ot��M����
�.t1�S��iW�S��Uڽ�,.��
]&�OX�O,��I^|�<�^d[��m<-��;)0o��flZ��uoE�l��kn鉸��9�q��/�c���8�@g�Ŷɩ9���?�OL_��2�U輋L�I��ݠi���$�l������=��iG}Y�v�Шa��M�?`&���'�����|ISիu�:F���KI�-�OCҲ2n<��h}��Oc%4���
���z�����q4���Z+�����/�Ї�b`M9��@�:3��-��H��"L�ʙUF|e����yQ�WƯ�]�%<�=�άCkJ��'R���ދy{�8P4�����n��B�f:�Ce]�WW%�W�������	aI���Ik�D@Ֆ���ϼ�s��%Iߔ9����qpȾ=�=$�'9��B����ddv�^:M�B�LM�2�v�r���	ee�7Jxw>_�m�8#�3Rb¯��?�Mk�	���җG����J��s�eb����3^	�m�
�s�hOO)�tg�ձ� ��1����=B�TX�� ��� [...]
��֋����-�O
�ff�����:w}��
��Qʀi@^���*���
>i�
u�_7�v��[|
ަ�&I�~�$/ӎ�6�#��'	���
-�_�K��� ���r���V/���l)�ƽU����<z�b/�n{��ВZOa�@O�����71~4$��EL١�2[A\�
���{7D��y+9?V���	Nj.�-��"��%��Ͼ�Ԉ6����c&�g�����CM�|@����h~�81�q���'�f1���W�0�OF^柹(�h��bu���*E��py�j�{	�u'Š���<�N�#RTK�f]'���H
-�,�gL�L�#
���Y�4K��4u�kAg�Cr�/��~���LW��MLR�
��
��2�S+�y�f#��F�H�!������ICݬ>��-����
F����tᵄ�� ���߉ƥ<��
-n4���.q\�����n����f�`��ʉ��S��Q25�J��re"Q���R�����q�%���}���~4Z�v�
)�Q������
f�QUMB�ż>/s
1
��ʉO(����"�"Jr����m b03�~
�1e�w�D����B�o�)��z�1���
4���HRm?�LW�4�D�E{��[~���'�_o���.�Uc�L�%
-`�9�� ������
2$�u��@
�/���Z�Ւuz�+��%@�I�'�1��zf at Z�`����<"��㱢��9H�0��0�W���~�H�_���p�ZDT��#Kq����pc�+�3U���᥇�C6���+m�F��*2Y�G)�@���(��V���ߕ���uJR�D�2��>��H�����E�3]�_8�$�����ei�&y=��2҂���cȺ&��K�=��I��I@|�\!�C���Z>�
1��&����co�c|2;�a��j��yL�֝}�I�ÆK�V��H�ima�;���Ё�Y1��T�aI��L�
���Eu9��
�7nH&��(]
5/���F�q��@
��M;N�S0�C�kx�T&A��Xn��xb�Y=���&��
a
���\Z	{�%��ʌ
{
��HX�-&��8 @����QD��&�G�<
����+
�\z�[6v�eL.�OA�|n��}��#��Yc4Jv'n�n���'
д>���Y�YhO{�t
P��+:�+���?�+K*�V���оI󘛄�'�*�0��8�M%u�C>���ޠqm�x
"B��:�=\���x��؜'ZwkK�𓛡�sG��ܹG��E�wmP�����
F��Ibr��$��IMg���ck��&7 �Ƽ�7���
-�wD�v��K�#q�40�΂� �Uoyv;�U��5K5(�
��7�B0� h�6���J:b҃�T����q����|��]�^��p�����
����
�4�]�cW-m�<���A�\/س�4�s���1U2��# G�w� ų��t���m4�s�
n(:�q�J
2�)�����W�)J�	���7��	��b��Z�*+����&��NP��jD
�ϳ��C��)A�g]I�4�s
#͹�T�n�,V��Gg�~����26�zU�oB��Y׿���k#;�ܕ���M��U,�	v�.����(��S��G�j�D�#¾��
H~
�@�^$v�w��R;��5
�X�bʌ�}$+���Nƾ���z[>�g��������Y��'�D�8�/q�CZC���B���j-E����l)��_☛��O����/OZz����*%�@3�J�Q�
H?e<��s�K�|��y9�r���F
Y���ɿHk��:��r���Ͷ=�A@
��N�S�0 ��p�c5����V��z'�z���8�
��k���u�7G �F�[
A��#y��_�'9p����
��Q�B!���&����}q
�a�#C�

����nr��	�$���<���ܬr�[l��d
RX#�
�ۦD���@�2ʴd���+{]��0~��*��m��\�b{��iF���tK��R��w��Q�F
v��ݗ�p�$b��o?��Y)�����tO�'
-/���3��_7�v�	h�a�l��N=��
�����
1�
-����eF<�}v3<X������k7��i��e�i�˜i��"j�M�ș�;���ˑ�H�o���>�_��VW	P4Q�DS4X��X-Am��Ziv�
�(ߨx��L��{�|P��&�'.�TS��<.dm� �]F1����fhe�����@�� �M6��"��Y��^�:����~`NKH�aO��_~0���a߬Jz
��-��~����gj�V-������r ܥ8�]1�O��,r�
-2�x��O��it�A�~��C-�t~L�w��N��?I.p3�SD2�t����5�,&YY|!��)�� ��;?Q���p���P��?
�Lt��
a
��]�VU��x
4"U2]X]���+e�� S{
�~D��
�
-n
-"*
�����*��)��7�@v�=���b[�'�^��|Dx at 8�9탋��Z�U���U��E��
��X�@�[�
R5��� z�3�i�<ɋVs�Ƙ�m��qv
-$y͡RQ{�
1� �������&#Bݦ��(E�c]d� ��<����a�[��>�J�q��H��~��VJ3����]�VA���L����c�C� ]
��z��N��b�Bـ6<J�|6�)��)X��D�
"Ӊ��#���&��\FY��=�"b
����iu��~���_��s 2
H����A�o�Y�QۦRK�K��^���0�����(��!�:�2r�1�
.	84�_��n���A�':�����px_J�:���ՙmla�&
1�lx��탓-��6Ҷ�p͢�^��w'T�w�X��qS at Yj1�
i��"Kr I�ݗ��E&�O�v)&=��i�2Sq�&�u?^*�`�A��"U�Upkem��d�S�$Cz��
D���C�c�iL���	��
�(��g��|.޾��w�o�ij��^������&N��޿�;��
�A��1�B�@�-�D��l���Z�����i�4f�D��+�5�1
7��U!�$�V���n�L��W+ɵߊW	�3�f�[����������LK��e����t��9Ɠ��V����]���M�
Zۃ^]x#���8���
����t~(�59�|��
	W7��L�/Bx=���M�Y}�#�́xF��ۘ�����.����׻��aL��Q�\���4g��\/{�n\
Ӽ���n��D\[jCĺTiВ_�ͻܖ���v	���.��r�B���~����zʐf������:sT2qz��T�<���l���GiP��8�e�Hv�L(�l��������X�nfR�^Ʊ

]���<�MWB��갡f�������TƼ
-5�y���I��>��z����e��B�k8+���K�K��#�)]Wj׉�~2���I��]��3�vZ��u��}�Ie)q�G_K��i����F�~�/Ā������kR�A���
-�������
'���!˃�呝
��>˭)%Utu�;��M�W����b�	��@��
�C/g��!���Z�c�Y�x�Z�V�rg�ׅ��T���v��-f�;�/�
Aj��U/|�P�s�~��d|[{����.�"�\T�5҇���%/���p�u(���j���Z�˛�9
-�
�%�x�.f9�<c�@�]v�g6/S�Z�X�
����L�2���M��K�c��/"�w<�!�Y�"��3���>�>�k�TM������!w�-�F��J��LDŽ:���ujwp��.
v����_�)�U��i�ea��\
�W�ܘ!��@�>�Y
KPy1�k�t
G��s�ҩa i˺`����)(��@�|�!e�xO2iB��$^X�4��t4@�O.�V���m�GV���'x&��-)O��

b��m�V����]Kp�
d1���HMO�j�m��lJ�y�y5b���v8o�z^5��%ʯWD��T)�ᅌ2��J�4�Uۋ�Q�2�zB�iq�'<rk垒Um�Ͽcc��ϕ��z�z��0��\��9�����U
��g���ʪR�4�8�u0�UTMW^�
��Yi��؅%<:�c�L�]V�R
-"���
U2�#"�T���"Ѡ���J�*#U�[qM�(r�4��e}��MM��|���1�`�_3�2�����V��.�Sn�����D�9�T���%ZwU���ZCV0�l_
��}�����
ˡIs�
��z��w'���6�,E������+��o5"�����	�<L�$_O�9
b|��p��
��倻�xtu��
���D�
��~��Z�-�0���L���=2���t���|�X�l8�#��P�7����Fy����qٗ`��1�ԯ(��
-}��
����1�@���
�L��|�]��$j��z�.��󮏡���d�ASL"_�[�S���s7����薎�1���6F~�R�o�v,G0+rF���E���um�	C5?,EA��°��|S~��|gܨ��1j����͛I�
�+��Ýf��%/
%~���Ί��5�4�(�G�ܯ�=g�
^T�L�,h�e�u�̑�6�Vu�r�����ѭ�n4�\�ؠ��@��v���Ok ����mU
g��A�{�T���6�
?f���l�XzZ������Ojl�@�[F][�RVQ�.k�v���s*z�Hf�H,��p0~	W��Zyd(���ZS�;d�����V�D��9s�s�볼�E�
Ի\1-zB���b
=�ʃc-w��9FR���AV�V�
d")�O�_k at F
�q_��
,��=��h⋃���X�ѵ:A�+�X�wxKL�TƂ��Z�,���
��쫰�<�2 ��� ��)[𪈌'^qH}�,��a��u(劢����W}��P��ΐ"�׏�ݕ,���%�G��X���R�7
w^
��U{@���1^�^���6Rf(@)�g�<w�`t�8N���v/1[������RxX�tñ?�
�(z��.@�
��v�0w���H�
PO���?����@{�'@_��HZ��1�Vf�����o[_X^��jľ�T=|��-����Q�NNH�$�eٝy��D��Mk�
�LM#��
|co�T���
.��#Ņ�&&�/�5|sG؏VgT
_��t5L�Ů"��Fq�
�Y�T~��[���\Z�ބԍ�7�Ӌ=��� ��;E��6Urdt�̾��{���ɷ_��袕�ۘ
����M��D	.��yWM����PS�(
���r_�`ȁ��/�A=P#>"P��SR�"��ߡ.d�����z����rf}�PHɡd�r_�{�gt/��0�O�u,Z��z�Ea����4_Tk�G\	��
��(>�u�^Zw�Y��Mr|�E�5�)��
�8&��(B�_�W�v
-endstream
-endobj
-20027 0 obj <<
-/Type /FontDescriptor
-/FontName /BVTPQN+NimbusSanL-BoldCond
-/Flags 4
-/FontBBox [-139 -307 822 975]
-/Ascent 722
-/CapHeight 722
-/Descent -217
-/ItalicAngle 0
-/StemV 114
-/XHeight 532
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/Y/Z/a/ampersand/b/c/colon/comma/d/e/eight/equal/exclam/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/quotedblright/quoteright/r/s/seven/six/slash/t/three/two/u/v/w/x/y/z/zero)
-/FontFile 20026 0 R
->> endobj
-20028 0 obj <<
-/Length1 1641
-/Length2 7948
-/Length3 0
-/Length 8787      
-/Filter /FlateDecode
->>
-stream
-xڭteT�۲-��i
��[pw
o���	4
,�ww���A
��

�~��;���Ͻ�G��VͪYUk�*zj
m6)+�P�e�b���
,\]��
U�^A�V�G+E�9�
���K;͡ ���9(
�Zd�� nn ���=@���
����t��YXX���vXx�
y�t�8�?܀`����L�?�P[ ���5
��L�j� y�#���	
W
0���:� ��g ����S���\؟��\ � '�%�9
�a	t�
���� ��o �`�l�}�( r��Z�.��n
�S��3����{&Ӏ�@],�ANP�sV
���ښC�v=� �������wK�g�gjrt@�
�߹,� +�����9�3��3�O�. G��+`8m̝��@�g�g�߷�w���ҽ����O4�׿k A]�`kv4.�眖���6 G4����h
pq�e�ru��t�sAL�g���s+�#�`�F�P�@�S��g*���D�H��?"��N�j�_
���=��Z�
V3wx
��
�yӸ T �w
����]����Y�?�� ���OG}�_%�f�'����ͳ6lB�BYA.r ��ji
�6?����sE�`�#�Y�?
`�����c
��w�-�_��꟥?
��p%5]mu
��ߞ���<P
O' ����W�X�����+��������-$��	
-��7i��p�}V5�:�< F�윜\�����>�����%��� iC�
��g�߆߰�������s��:��~ �h��mb)d����%�
�1���
v*��)����|�K
[�0{�	fo�"�����������nB0�d�q
�-sO���v���
&%�i��Q�'�*�^�s�m��ij�? Q|i�qF9�f��u��ǧ�r��L�KЁ� �[[ppȐ�w}��?248���g��%;�^Ĝ�7�:�i�|Qo�
�΍_��&�}�]�m��C�%��Ji
a&�;��
�2se-���<I8�9���0��?��9ecO�UU��1��?m���K�jLv�
�Mr��g�Z���YP at I�\��\��=#!�Y��i���l2�Z�Q�
-
�7k�:y�\�
-�T^ 
^[�RWE�/}O�C�
x
Q�ݴ_��k
n���4�o�\�O�h���}?��q�mt�UE-���E;���b-H�p��u$t�S�-%r=b����(
r����MĄ���s�=dk
��{�R2�Vu���b�ؿ���U�Y�����d���qy��F9��"x��[��ŷ������Mh�3������<�E�J�*��fY28S[�e�N!I;�i����~������>��H��"�`]g7��8ھY�W��7�;� )�,�4��p�f�S��t�]ǭ���Q��eG]�,C*�ț�)����f[[*�����iO�Z���B�"4ʓ��\u�D�\��bﺒ���
�,���q��� �
8
�h	�7�nW'�VKf31���:�Z1;������C	��׉/��\=��b'�U��ᴅ)��^��=��&�3}3]�>cS�/�e�O1��V���R��E���
?g���#&�ke�E�濌�
���ũ��u:�0���:+��)���>؟WN ��ͤ��f�y�v������
-)�q�8
-9���q��r2	OW���+��,C
��װ����j�/'
ts���w����H$9s5�rGG�q=�� �\<��ԍ��C��8W�A��L�D��Y�n-wQ&f�7Eo)0(B]��v�LbN��#��e��oީw���TD(r
Ի�kg4�'%
twl9��v�`�޶%M�M�T��ٲ��Vn��㐠lى|b��Y����ئ	ٹFǏ����j��}e�5�����O\
����x8r#�
���e-*S?K|w
cF��4��Q��)���,?p�s��Lf����Re�^B7�^.A3F���J���j?*O��x?��
I�c��T�܊[2�$�܇��
)�.$�B���[�æ�]���
}DE�0E��.|#_�
�H[���:�Д;qT|_w�߆�'ڏP

~J�j�ׄi���Y�
-5
�T���-N�c����}Z�Tz�����d�Q4�-+�L���C\�7�^���8nW
d�dEK�f��w���e%���>Y1+�S��ޙ�}���6��x.h*$��+�V���1�N΃�U�nH 
h �۽>
���L�f�e�z�Y�,���fO��������
��BY�ʭ"�4���7%k��ڊh�
>�>���╂��B�
��Nu�m��1�x
�۫�7s�i�[�F5��� �����#��t�N�-c�O����G|�<H�L,�E6J<��!Ê��
-_e��ٺ� tV�g.Ћ�6���vHcJ����z_���xH�&��쏽��|��ymG[�?,��}/�l�
1�JIJ
v���;f,�痊b�:��c'�m����s�Tđ�%�Y��
����
�Ҋ٧#8�������M0;�E��6���Fb>O'�o[O�b
�t�^�Q�N�H}O�2~E��ۦP�k�yW���,�-3��,�}4�~��
	�}��
�9�]�� �#���IQ��6U��W
xWXˣx�ܾ�w�-5�dp����>�����痣��U#�3�`{�~̼ɁPn�J<�<S�`�aeHi'
�	��R4Z?�y��2Ǹ+
Z�=i�hx���P�Lz�c+
h��7[�&�����4
WQ�����wmq!K���
��z?��U�}�x�m0ي�YߑP	jX���
�٧�)���JM�R�Ava�ӌ�ġ#���灵����!|��ׯD�������L' .� ��"}H+F �e����Nh�3�hg�����~t(��0�����5?](1%1߸��jL��Y/#o�jB�v
��]m�9�(��Ć�p�4�����\��ݚM��]b��h�6c� �T酩u�
|Ζ�艎�a���X/�|��
o��*��
l�F��]��l�Od��ax����Vk-
-[{�E׶��vn(U\B

H��yCL��S�s ,{A���gx����toE.:/��w��T�
0c�|7��	_cD�:I1�!g�^Z��ϴ� !���9v��|���g�4!tM��?�2X�('��Q�DE��3v�!2倫�ʇ06�n#8kɹ�q���k=��>���d

s�^q/���b�6!�(�IÆ(��T�ԟo��MPf��rt=�g:�
[��Y�U���
�Lx��>�[-ώ�rP�j�>�%�<�Z֩��ʙ�{����
[ڷS��*�B�4�������#����&^���\��8���E\�G��>�xM�m���g�P>��@���@D�}�v��?�#�ȹjfў�����xd�('��T�l�bq
U~4��d��0�hS»*_b���s�g��~ok�Vf�KJZVʜ��j��ڒ0C�*�*
z�����iPL0�Tj�0���"Q
]H���E&gҔ͍��
���~g��t���V���+̸^��E>W��lج<+�X|�2!Ӱ�5W̑t��E�]�
�[q/9�ՄoX������͙��O�2�����I
��p?D��[:��:�8��}&C(��3�M�V����Y�95S�NfoDI��0n����ὔ0*{�0��C��$N��[7S)�vr8Z�f������)J%�D�&C���"�:�]���oˣ
I�=��*�@6:10����X�
������0��6l+q��rgU`��Dz
kg�h|.��c.��'�ő�ˏ��4NH��-
˔'�N��+�K�<�b���2��$�0:��w��
+5���z
3k�@Q�����e��rF��-cw2������|}
�=MYO�$d�W?��NX�x
p4�����p
u؉0�O,�~�����
��y0g J��	��R�٢PȬ+�K�p�SD����u:��&�������4#�U	�Q�c|�cm��
����y���G�IM [...]
%Ӫ���]zd���u�U
-�'
��"}N��
�c'�
h������yh1�Xe0!����A��=��	
^5R��b_-p�K^��]�M[>�evq�#՛SQAj=7d�u
@�a�r#+�@&a�p��hf�Q�軘E|79� ��\}��#.
-�\�f�n����%H�&�
sV@
kt�S$%���g�]�/�֤e-ր��uĶmJ��*���n�5��*���o�V)f�P͓�C�	��?�^�uCHH�U2�d�����Z����&oT
��JA�(��[m��Kn>Gԇ�B��|�*O�Ì�C��N�WϢ�6�NbjQ�[]��2�$t�ӧI�~��3���8K����t*��~Q��R��
.ͷ�-_b/-�+dS�U�$�)�����_���Y���Q����;�O2
���|�yt*�:s�BckNh�
��
�5)��hv����i�.�'��	�r,/3��R(n�3A�DM$��H �[�����!b�N�
-Jۤ<I�Y�%@�H}��I�`4UX�'����n5�Lt�%ߎ�G����2�TP����v|OF#��q��A�R�
-f�����
&%j:�5�;z�۞��n�b��o-�H�d�U:���O
�R�M�%��녞6#���1
��O���
�W�Uǻ*�4�6� �f�H�dq���"g��q����_p�;��M�E
-}�7[z0Ys=��9
�,
r����I�Ch�
-����_�T
�	����0<����c
i�����
-r?F0M�����"��|��jcQ�(� Y0��sw"w鸓_�ϼ��wI6R
�'��0EF�E�;5���cH8��?x�w/����8US�0
.
-��=���9�����-���#
F�l	����"�A�v3�
�/����N��J�L�N	����Ox��abQ�ޏ^{i����b4�6
$�`��`�1��'�k��ɶ)Ƅ1/���&��O��:��
�����}^IA1`/��1;l�.8����k)%�B�#Z�1$
�L���+Jz�֥
d���T�9�mۻ����<^��JOb�۞R���a�M��P4)�_KG���@�
KP?Bk/)�;p6HMk�G���*-F:Q�g*��[/��L�"e�&��|����mv�7�?�
J�h�M��M�R<w����e��c���x���v��'�q�%
`�(�?��΂+3�u����Ҿ��z����q��Tn��/�Yls��J �to����4�2.�f
7��z\
T1��ra�$r�����]@
�Ӵ�gʗ��_�@`���'�uB8F�VC��On����ɤ}0��7]K��{uf��lCz����3����|��N���ŶBү���҆

	f�>����%�{���^�h�\E6�h�
-Lۋ�M�7w�J�/��n!:�ѡt�o�S5�?#
�W	�t=i2���v��k��F�x�%��ԝ\�n1�"�;���ؾ�#M�!�S!�q*�C�b9�)+W.��~�!��aر���4������h��r��o9��*��pin��t�����6��L}@ä1���7%��ؚ����.D��f��C>6S�Z�c�Z Af�����w�C��:a���o&R��'Ө[AC
�d
�^
	��p$��Hޒ4�p��*��To&҈]��ǎ�{G��&����6Z�5~Pl_�j	�a
-��
�a�@�ޯ� �by{zO��fX�-��91���s'�j��ˏI���(�^9�3�n���Kdv��^NAF���^��F��[�?�QS�3�a�۶�[
Ny����[�M��?bPhE\�̏K/7��uLB�B�}H�ŏ��=L���w��P�s>��p�E9����x��(�2¥��61�9�'ZOo�O��M�y� �}��½uo>.��r��<C:�3� ך�����
�kO
gK�}���H]wL��`zn"F�"��8���?��jU�4

,6)a���:Ƶi���6"�
W��"K���0��jSIh�c9՛�8�u���U�Ǟ�f.�����Qha��|dsɈ�%�B�q������X��h��:��j��Y�_��	�����R�
-I� [X
-��jxǥB�
�(B�V����L��Iih��*E�*T9`�qji	
�XEg��P\�v
/�z�t� \j��jn��S���ڲ}=H�;��Ǜ��4���Kk
˃��� V'�l
�ӭ�;ё��Rɯn���#�$tttx�zN��zf
��
b&ʕ9� (Jm�O|$]��"�|:$��P�뒚P_�=bRԐ�� _d b�N����+�T����A��	�
,/���h�g��Z%���[g��_��b띁lr@���?M�
��c8t�p��R�ba
`gs��5����t^�T�WEN��X#�����Mgg�G@
^�z��0t��	&��k�Ę�9�=�ϩ�}�(��Y�q!�)�k�	5���d��+��#����O����#���J��NN{D_�\��;Q��}�>�+t��ށ�,w�$W�B��~b3�G��Yl��=
I
���%p�p�y����:�1I������Vߛ��Ɛ�`D�
���7��
����|o�Y�Aϛ�-���zT��s{_(V��c��+N�a�����;ž����i����b���7�ї�i��#q�XJwI
�,W`R�S�A
L��
>
-�1ޢU��߂M`���5�
-��t�X��e�#	a�JM�~q�e{
)�
<4m�����*K�/u���q��v��r��ӼO���"����A�G=1T�VǢ
����3}H�ϷW��S_W!#��:ج��>�ȯ����A�+~!1���6N$�O�u\����X�������-�IRX��o��;��E�%=�[phwYU��g��Sy����+M
B��:J��m�ŚaP��_�$h��>4 D���pQ��/.(�O#
�6g�L?*�
��f$n&���x���u� /��}�"9��>�
W�w��X5�<�uv(w'1]�t�*	پe�h�,�Sˤ_���X���h���m8�.�GJT��Y�BO�HYV�b�"�!ѵ�g7韷'a���["���:�����$̵�ݦZu{�vm�	�������4�e�����Lc��v�����JaE� ?YE;j���-@�wO��D8stvkV#{�ݯ(�tҶ7y��W'S�#Z��_h�O,/
:
�sz�lK�G�׽!W
r4��
��G#g�v���d"~T���RG_�X}O�����{<ձ��#�D��gQ�G��_�4�H�1�nx�
-]��N�yK#�7��;���y
��^E�0{�Q�
��s��Ќ��[A
-�5���p�iX%lnwq6Ͻd$�]0���g���s��a^�)5��/��a�a�nK��]�دzK�r,��|�(�^P\ކ(��L�9�J���g�v���yU��/�
�Ӱ����U0إ³29���Mfa8�}\��/�97=N�%�=��v�$)bY~�=16d5�X��8)�N��"t�

���`4mA��d'��)�	Ɨ�ӦW�O�`g�'����eİR,�
���)H��V)��{-9���ۥ���ʧ:��(��h�
-�фIlr
-��4��
'*W����0��qA��I��n�;��,���@��t~�/�r�^
�-k�� ��I
}UIU�'�w��D�$\oe�໎
���d�d�uA��k/,&��ȱ4K*.()Z�
��%1��`�����o��!�����r�6�����`J8��Z��wJ��,0�
���G�Ý���5����G���#���LU^ء��qcc�
�6D1c

�"�|����{�c]t���L9�!C*�D����
���`C��cl0�&Q;��$˔�E �:����yIӞ��m�"S��Sn`�e�
V�u�����>��q K.zN|-��E?
8��-	!&5�:g��m��n\
�c)�șT��
 
W����OB�ҋ���>Z��o���ӫ��u(+�I����������P��ܘ9h�%��$ڐYh,�m-:�"/&j5��������ҚI�W`�r�������D�_�N�I+�Un(J��1�?���v3��Vb��W�η�a#1��S�c��/��P�Ϗs������Vq�	i�]
*2�/�D9I���G�B�QuF�R�H� �/�ϯo͛�6�u16tJ:rj�l����!0�E�k�ڞ��P�S����|C��}|y��к��x�LV��ˁ0�
-Z�1����{�j2/'���/��"�]�)�ӒV���}�� ��.�$���Gg4a�4=�.�RUl���F�k�U��zF��cp�I�P�s���j
~�g\\��W� sY=h�4S�JY$C�dM��{q^��l�G@��E$�v����
�w�;R��� �N�oF�R��.m�|��'�M]���d�j�	R�<�Uc`��6¥�	�H�򻾇�M�@Ъ�
B��"@\��Wh�؝���4c���AJ�[���d���U�/����ĵ69K+
T�Ld�6�3���$w�K��^o��9���<�h����o|l	�/;�}/�e�)�9ńw˟�#I��M�X�W(��3
	�E��������
���5�)�W��
��t
�wV��|��̜�ط��6�����/*�ѕ�!eu�N�mƂaF�e���'��(N~/Q-m��K@���Qʧ�����t34��p/"�=��x#�����=����%N�8��#��b����R4H���D�;�̆��P�2
-endstream
-endobj
-20029 0 obj <<
-/Type /FontDescriptor
-/FontName /JNUSOP+NimbusSanL-BoldCondItal
-/Flags 4
-/FontBBox [-143 -298 913 989]
-/Ascent 722
-/CapHeight 722
-/Descent -217
-/ItalicAngle -9
-/StemV 120
-/XHeight 532
-/CharSet (/a/b/c/comma/d/e/equal/f/fi/g/h/i/j/k/l/m/n/o/one/p/q/r/s/t/two/u/v/w/x/y/z/zero)
-/FontFile 20028 0 R
->> endobj
-20030 0 obj <<
-/Length1 1166
-/Length2 6130
-/Length3 0
-/Length 6897      
-/Filter /FlateDecode
->>
-stream
-x�uSu\�ۺ�FB�n���[i�`��aJ����Ni��AP��SZ)��{�}�=�������z�w��g1�j� ��!� �3
���%P;Y��t,�Հ� [8���bd��
A�A?�P�

q���=�vp�

(��
��%�%$�������+hB�N/�&�:��(9��	�
Ӂ��8�A�� 7
jr�<t��U�lk��i�>��7�-,,
�D�� �@n`[g ���
�q�]�!�"�}h��w�����5�{\ �

�"���bcz�8�l8�A0NևF坭e!N��a��L
Y=
����n�g���m����d
w��s��A�r�� a��ق` ~.
.a.
 � ���]R�����
[8[�z�@\ 6�n _�
����f���p����%�}���
�[� � ۇk�;�
��s��{��8���\���L.����;\��	�TP�U��|����%#yH	�� y����Q�������_:��jZ���O��S*;�@ ����_#���n���acV���W���V  ���1���zp���Z����j��P�;:��
-˟r 
�p�~+�h��p
'�#�
�g�>�O��?y�a�`+ig[��vS {��5�0+�?�����C�&�
��%������t��V� 7�����9[�������l
Ё=��j�/�7m�B���
����?4y����!V���5�-�U�
��a�n��{8
V�#�:r�:�C	_�O��L9�;�
-c�(H�q�1�
�2�
�!��J��9j��Ep�1YFO����IS���"z��h��
%d��uB!D��.��w\5�)����k�L�
-_
j(9�i��O~m��
K�Vi��bV1®�~APފ�jj�G���d�"��ؒ°DP�m���ڮUU�
��� 2�y��s�n�+�$:ib<��Rґ ~5'�9+L��ܞ�1��8B�@i�W���
t��^%Y��p5
ŕ����A����Y�͙�itpaKc�U��i'��qӁ-wٮ6����G�&ԏ�(_C*��!�{>�:�yi���|����bGu����*�20i����Gt��N͘��5��{�g��o��!j�-�,9�J�3���u���
2@�QԈ&G��,8����Q�s@�yH��1%������Z*f��J�8���9���2��8�}
W���tGjf}눘|��l%�ݩ���_:��_�M-�����Qpr���W&��m�UHt�p,��ރ
�O!~��'Y�N���
������b�Tq�Au����	����Na.�K8=:�REl��5�Tv���L�j�uO�їF�C��H^�ۊ?������Y���
��Y ^e�4�}vD]��OGV!Ҷ�(f�Z�ďm�!ix������`�6{3��)�4!wC�@���Q�G3)&QmS�2
-«��K�0�^�ȱ�A|;�#+�c�v�Ν�b
5`�^	*���D{����H,a�J	�`�^��.%�B	v��<;;/��`�p�V���r4���ۡ�R$B��U�+��v�28j\�flX�mV7HHo�f~�@�k�|NCʁ�)�D�$!(zi��S���):/S�����?8�]۽`0~T�m8�8qB�u`GS$CG6r��i�������7؈�)M�G��#g�{�2IlN��ͨ.���E�Ӄ,ռ-�t���"s��n�q��͋L�|�kB3-��ɷ�uc�Dה쇖2��dK�g��i�^���&L�' 1��A�\}гF��J�)#ߖ������>(,��X��/�ꢚ��]�e"�1�(t��7�z�ڈf�tu6�����/ۼ_}�⎓0��,�(`�"����?���R��mPX��E��َU⫏���Q���cv¯�0�wZc�0˒/_�K($Zþk�
��ߒ��� ��<��@�D��(��YǦg
�AzWH��ח<�\7
�y�&w$�E�!ީ@u՝ [...]
2鼛*NL�'�_#�%�
:�U���Mw(�bN�c�I�3��7y��j'�&yDs�a�J��#�\�0청�e�r�P"9�z�
�2�E#zKM/]	�&�x
R��׀����C,7$"Ld�d|���U	��$¯��]DeƓYp�H�l̾�Y5/�'�V#�H�s�-���v��g�',�
�OÀ�

�Mu��"H_p�)r�JG�>oc�}�>97˗��N��ѱ:�j�
�L�*���~�RH�Ϳ��:��ĩ���7�*1�V��	$"���
�ą =K*�����5:�ݱ�X��w|=a�L�����3��iIB����L�س0�A�����v��
���2�J�Q��X_�����f;�e��qr$+�rf��
k�,���p�U��FX��w�t>�a��8r<���M���kB��K���C���
C7
gBȆ�߱n���@�\RD�����R��J�s�Y�N]�}��s���w���$��+2��-��,�sU� Y/U�q�����^��f�-�J����$
r�hGykE�̧j�T��{`��r
���Hz�W��t߲��]Y$�,�Z2�Ns�n��E��
�c�-r)E���L��Ѱ��xG���h�f�[�;	j(�I|�pLkD���
����f$x#na��_ԯ Y҆I��DV�5�z��2z!��2�2hOVo
�{���l�J4i�si���ںˋ��{���m�g5�*(��r�^|J9�ǜ7>�
S�����f4��?�Gd+���m��e���j�cd

.Sz���~2��K�4�����,R
/��h����������\�|�
~[�����+s�B(��gÎ
-+�Z���9f�?{Þ[�~v�M ��N3y>ؼWI�A�ؓ�r
�i�y2	���2���;��ѷ
2
-�Z
-�\��.�I5L]���mL
��ѸI|���x���NK^h���
gU>�<~񴤽31�ʃ����;fY*�}����W
? -ʻ]�T*J^�b/�(����,ue�!uX�
ߧt-��v�jʱ�I,��R��Q�}~��EB�q�8mT�*�9��I3�Z>����o5��(�o� D�~ ��0�*�����
o�87.j��>%
�
�tUl�a�geAOL��g�[�X��Pu@6nv�3n���U����n7���dA���;� ����k��t�2Nz?�L�������X��
k�l�S>�[�!mdFQ��aT����e
���H
���%��ZV�y��dS��K�L����Y�y�k<�ޏ��fٝܺ���#[�\U����85{����]�t��jm������'�fN/z��bgY�H�
-9�*Y83�M[����F��-=�e�Ϝ˂Ч���
���ݬ:<��#EC0�Zƫ{�/s�G9�2��j
05XK���>�~�PzK���!a�8(D5;�,3�kwʟ�
�6�K?,�U�j��0�Fz��h x�F��΍�U �ޏk�梟=Ÿ����=e1d�)u���<�SK��B�}�O��T2
��9����KXF���_j��b5EJdT	�ߕ��幰��
��C`/URKz�C�Y�M�ir�T�؆�
��B���(��74l
Y�
�O�hhZ]��N�����h��L}�c�a�jORvT��T��}�b�%��É+&yʯ)dž��|���۶A�wq�)K
-D#�Y
k�|o�@{����ie�8�̢��;��Q}OԎ��RAK�b�`Y���E�Ld�Ɍ<#�
2�y�Y���{�
��O3��E�?:���}"X	�ѫ�{�w�l��B�9	
���vm��V�Iu["�냦42����`^u6`'�&����7ݛ<�c
6��
�+s0��Q�h��å�i^2a,�X���
���s7Ք`�������p�S�,qX>�)Y�:����
�y/컢�Sl���֊c_��k\����vē��f5�A�
k�g�:�ۼ��ji��$�!C���|!�F�w�ݣ61��'�9B\���ف��طI��������A1����*;ޯU݅�$I������(V�?>�
1�D-Cy�B.{ҕ����u�m]'�d���X(=b�e{~o�w�Z!�\��]Y�_C׹��oa�>CT�{�%��
��/�����n&�D�
-��<A)�T1ہ"c�m1lS��8V�`-��T�H�F��zH�ɕ͊�1�z�G��s�!��2}��v�]a��@O�����H���Qp�&#"���k����n�a؁�BZO��F
�
�K��۫��Z��6
{]P��/K >#��^
0Ņ~�54��ç6r:6g���s�i������_w/� �ӎ�����]!RL���]��W��BY��-H4!gA�	H��v���#PtZhm�_�r2�n��|+�;EB=���
.β�
��n%�pj(������œ<	L�l2��������]؀8��
-��Q#�	���a��M'+v��D��	g�
-5�3�-���6!
�é�ɧ�'��]�mZ|�a��&h�l���u09r����4�
-J�e?���r<^f=���un��_��%��%��{��Έ<����Ϫ�t�i �6|UZ�*/�]K��?V��b��y�rw�^6������{n[�t�j��+!���g��A�#�}���zc��w���v��U��	gΥ��c� �CK
s���
3ԩ��*!O�.7Q�sA
��L�xY�<��z�+

�gtk_+pq/o���
}���X4
|��7I ��Uއ��л
9��ٺb��lD,�-
��F���Pn#�h:����4o1�sC�P
\��i!�&�MG�R���h4w	#n[-^�۴���o~J���ٴ����r(�G�8v*ߤ�\
-{@�G���K�Cx��<�o�����v��gX�E�(M
-��`�� ���+��r�c*�ˀ]�	ya�^<��S+�� �AY,�5a�f�2q�YEIz�����$��*�_^�'��#5�QOr���W0�
����	_M?ݽ�$A�F�D���
3�D� �爖7}cF��	�
-t[Q��
{}��bGCHN}��~X�ambDY��4�Go��o�5������D�!DU�3œy�s�׆��:�-e���if����S��jJ����F��D�%�S�� 9ܗ]��mt/	��ߌ�V>г����=��T'���HH�����t�sE�=�
xT\��?BO.H!c%¾o��VC�܉�&8ْ�h��	/d�ݨQ]�
-�r3>��k+R_C
�$���h�
6��+��A�ő߮X��m������t�!ͨ�fŬ�ģ�j�
�i�T�c$
Fxr�6P�/
�mC^�.Ff���;��	��#�U(-���9���+b8�_Z��`�u��P��r쭧͌ˇ~a
Q��i�l����IP�D�DS;�Bׯn�%<�S%�>e/��
�T�8
j=�	]�k(�alȌIq謃oŸ{]H�UJ�=���Ẍ́=E-�@6�EHfʍB���,��
�-p�^5���We�@���W{�%�ԽQSq?��%(S�l���^@�����
�K�g�I�>$�����!�}��lɰC'�r�'�?��ݗY��w�}@���h+�X��L`���z��ON�h7y��{��0���a�^/�*6�N��Z�X��?`�E�M��G�e�,XJ�Lgھ9N���Ǜ���b��1��p��Z$�*nO�2�=�c�G�SyDL�Qv^��=挙gz�:
-���'���)s�B�?aH�$�qb�=5�pܸM��'�(r��A���ˢY;��
9
�� ��
-���D��d8	"g4��=����~�n��%�p�Q�)�}��}���ģhcT�s\9���w��ʋ��{�Bx���
��dđ
H�Uwy5��u�
-�F8;��x<n��|�gp�H�
��BVcl{��HF���N2EM�!'���n��
r��I��zS��:�uTT��
����
-�R�g�&��(g�W�z��}�M��{fl���=S0��2��Y�[��^�oqS
��� ��_|��	���m�q��W[����<V��+ϰᵔ�f0 	*i\�]���q���R*X������L��ո�m�\��&�|S�t.�_��aH��.��[|�����<�}�

�����>
-�LƟ=O@��d�"�jD�ҷ�`�@���04�\;6'a�j�K&������3�|��D$��m^���$��|��#1����yp��=^�*Ӈo�b��(sF���p�w��7
X��"IS� K�!3C�%?�x�K�
{;ބ
-�_W*��5��C�$SgP땭�j��b��"~��*�^���.煄�o��ܱ7�ܒ�^[�xǨ�T.��l
�+讼EZ���(���4P�al|�[�H�I�%5J�G��u�?�Z�S=)A�.�Q����)J�^�!��s��ܮ�BC��h�=
���]��V�b�]�pf3��VI�Qָ�I]�HX�R��z\�7[��W�-���
^����x
-
~�_��5U;-�X2:�@�}wA�� D㖬�� ��2Qk�JY̭�T
�0��L�D��e����
�w`��
��#1��w��C���TυP���ǒ��Jy%i	o
/aXg
S�4�$I1ͦ
�$��Z�r�@x* ��"�
�ķ,=��F7=�.�V���
aT����^4j�W�6͖���'z�[]"��עt�
4�ᜑ
��q��%(���u%�%
�ܕ�tј}*��8c_��eD�v7Į�s�EMH3���8)�h	��3=cz�B��Dž���=5��Ǩ��a���qBm����BF���-�q7�U�6�W�Ā�h�>��΢�OIp~}��� ��n�
-endstream
-endobj
-20031 0 obj <<
-/Type /FontDescriptor
-/FontName /FICHDP+NimbusSanL-Regu
-/Flags 4
-/FontBBox [-174 -285 1001 953]
-/Ascent 712
-/CapHeight 712
-/Descent -213
-/ItalicAngle 0
-/StemV 85
-/XHeight 523
-/CharSet (/A/B/E/H/J/L/M/P/R/T/U/Z/a/b/c/comma/d/e/eight/f/g/h/i/l/m/n/o/one/parenleft/parenright/period/quoteright/r/s/t/two/u/v/y/zero)
-/FontFile 20030 0 R
->> endobj
-20032 0 obj <<
-/Length1 1626
-/Length2 16613
-/Length3 0
-/Length 17469     
-/Filter /FlateDecode
->>
-stream
-xڬ�ct���&�vv��m�bۨ`'ٱmۨضm۬�bUT�X���t���ܾ_����5��g�g�56%������	P��΅������5quV��U��gT �� ���_���. {;qc @
h��� ���������N 
K ���-==�Y�	�x�O��Lg��
�������h����:Q
�X�  ૒�����FJQ �:� �]Ml@� y�)��H
0�w��� 0��3�Ӛ3�_,Qg�1��h
-���0:��b 8 �lA��� g���������@v�6�f��k7��!'���}���]�M�@.��U��%��������Π�n����H3{S�Z���/�_��1����p���	`rv�1��[�/���_4\�Av�ŀ��0v2�:;������t��O��ֽ����翲����8�\��6�L�lk����m�C`�gWd����,����:�O���_��ggh��06��������]����ߩ���'����-�����O���������BK���(��]��1�����
��;���и���R�mA6��_I���7[1{���ɸ�
����_YX�X�m9K�<�f� SK�����y�ˮagt�������YYX�çn	2���G ���vf�I��T�"Ϭ�*���I�x\���w	\�=
�r��(؛���?0bb�
 oFV.
 #;�߻��/����俀X��`��� ��훅�_�����
�F�� [...]
-9�P֤^\Pk���=�'oշ��P��Y��ϕs��CY���~
�4�U�/�@!�6U7�Q�arƅV�����.�.���޴��a�
�l���#m �[a ֗?���x�n�f0����
�����ቱё�[�CB��xxJ~c\��s��oN�L?�_ܸ
�4&\
te7�2%��tf*��l��g1��h3���>��*�jĈ�>����֝.6H9B�
��5%d�U@�h$�?ƶ�@�O
? �s�p2�C˲W׷�DZ�cF��1�B��yp$Lx	�q��6��q*�	�d
E{�
����^B�dz������l�hW
-�ݒ�J4w����P���������7���#�?1�vB;��	�x�y��N
c����'�,hs+�h'M��E5��� ��Z0>��38�rɂ<�%�$�W`[��=˫� q�=���
��N�

F���\�<o� ��6N.�
��h,�{�e��3�e�l�F:�W%�*Fj��� �@W��
��(�2��ŝf%'8��_��L��"�>\�"���-\1{���#�/���f%p�EUE�A�솗��	�m�?
�=ۆ����
$��	�c��4e���/:j��ü<
�`�)�uI�q>�2G����X�;}�} 3�Ѝ���ⓝP�k�-�0���Y�xD�1��6ڒ.��üo��!�z�6��OӽJ������d'��+�i��R��7�&4wzw^��A�y�N�����P��o�i����IV���t�N��_D����6�Ϝs
��{���z�?�����O����ґ�
�c�{i�\M~�<��3��-6�Md�v7+`�����n�"; [...]
�B�u�g�PPr�4�b2��X�����G�v�Smz�I:Dw�X_�"�z�CΎ�3�l��W���R
�#�+(ú������~����������6�Rq��m�
-X���?$�����\H
����U�u��
�
:�hx�
&��/�� uc(dYpL��K�_?z
��M�P�o��ޓ&��l�u��%��[
Eرߚ��b�Vz�֦*��h��Gk��D��=�j����1�Y��5��#V�1�	-�o
-~����7*����,aZ��C�t/V%-��Y?�
>�m*W#�Z��`�,���@�T�H�jU^q�\+���Q�3B�j�4����
V�jn
-p����i0>�X<x�.�G�{i�����' Ev�䐻stJt{:��*�nl	�]�(��
��o�\�aj(BL.&�N��Bq��,�}�GK̮��$���
�J��-Ō�@~i�������'ӄ#_ʙ�Ãh��/CG#���]���F�����R��2���d�����k�d��)͂/?�-+��گͿS�Pn����+�ϵ��TFk�>L�ECm��TS6n��P������-C�����U~H.&��bt/p!�I�bxx��z�QAv��|���'_�֊���OW	�
OO�F��:�	U��F�/lqD��H��Y"��`i�
-6�:� �_���
Ѩp`N���Mj�t
�
-:����|opuJe�q�x�z��
��ez�>[{\�k��I`{r#<34�L�虵�P��5��<�y�F�,�$��'��4m�t��r(�v��oF�(Kܡ�IApoq����U�<D�Y8}vP&��7rK\��
���Q��b�kN=\4���}��s�D� �m͒�w����2�HΗ��iǥnPEX?8
%K��<Gj�]�DD��6f.lcPY������|H5�:�7)���� �f�3���yd�t�
%������9�|�
�����n��c���[{��q��� K�T-��3y�~`�MLU�yZZ�:�-.�%�,o̮FWx����3�J.��.Le��R�6seV���X&�g�Nj]��U�8���i�A6�����߹
-�K��?3���MbBs3�l]�o?�x���5ң�mZ/K�!kkX?;7(y.]��vB0�lCFX�ڲE���k��MHO	�&�-�d�j��f�o�e�0#^
�1�6���2��
-�=lE��#�
W(o��ɝ�W�
-�#��R�n
-~��/����DZ�Y&�&w|QN�Ђ�O`*^�N�7d .UsV�("B
4�4��
8�AY[�cq���o�R6/-"i*��һ%���J�ɩ�]�oK�h6"�~�n?4]�5D�'|
r�Oɲ���W�$���(��c��?N����06���J�ug�:�*
>�/\1ri�t�Z
뢰�z�
����(�0���Ѩ-��q���~�e��,�V�
W1��9Ie�ɘ[?��}=�f2w$��oi0���
-��S�`�1�3�cG\T�T��C����v�V胱�`�8ܮ�s�K�[�rMp�-t*�ae�M֢�{��D#������+s08�rd�F��Pƥak����H�
�ǟ���̸I�/�Т�KԜZ��IE���i|5hk�l\/p7K���D�#�B

<}�$
%L.p�?�U�z�%���"�
���}L3�eٯ�^#+7�Rd[rj��F�X
9��~7O���
D�"l4s�_7�e��%E�f)3�l �B!��fF��{�D���O���8uS�=%fꣅw8��Q�-�����M�fU#�8<�}���&�A~�p8tr7Ҿ�
�h�
�>5s���5O[Z^P�Z�ʇ��DS�%##�kr��[�FA��>��W����h��IF��l�͑cRn�
|x�w�Y�����:��+�8���Or�z����~�0�A�̽ʞ�	�@Rt��!�o��r�Y��������h U�0�����5!X犡y��%����?PY.��2�U�,b�t�\��w�|jj��͂n]A�	�л�TB�#�F����va���P�g��VB�}��n�!4��
į�^��{d��	�4
�7�"x��c��UX_��]10.���7j6E�(�ꀑ�i ERh7��@]X�'�CX���6%�VO��ό�$�R����Y������%�:�R}
\Z������~AU*���Tglr~�OA��闆�A�ջ�*����yC�I���o��m��?*�t�@��~��ĕ
��_>7r)N����r�C�	�u�b�Y7�M��u��+���ug���&�$���/�`�Y��Zr�
�ڶΠ��������t��X�zDDߊ�����I� [...]
ɭ��
�.�MN�d)�X.!}�*�����%�awڅ�,\mtڨB�YhԘ��b��;53�*��*�y
�il=��"�����r:O�|����
E���1�.�F���pâ�]m\�7c��-]��ƻm)�Yz�.!���\7��=u+'Z.�c}��k�'{�կ�E��F4࠽L��M�9�nT��f�Q�0M�0V�G���;e�y1v��
,�҉���
�f^��p֝4.G����`\8����d�z�����U:��*a�H�h�>�L.IY��x���U��Ң9�{E����!��./-49+̨����*f���&��^r��~M�&�\�t�U�Jn�ޕ����U�g�Fи58���t��e3�*8�����s���(|�̋��9":Q�)?�Z�.8J
���p��:�\/�$}��*a�	���l��A0���p%��P��=�j.N� ���F
�:��X;
�b��ĵ�E���CԙD��H�6��R���\)��̏�������
-��6\H���ƀ64'�ZF�1J+��֕dH�.C�%�B���8��3*9�eZ�n�2��.D
-o�!�_�u����� ȟx�h����KdH�(�Pn��f!s"�m�E6+a��:t�R,�̌�
-�
	�w�ON�AV�J�jY�n�Q�w�3���锄�NP�}ʜb�T�#�(�HYni����|6�P4PB��m�gA������^o���y�)/�H12G��kΧ�$ 2�k��=�
��Y�
���;"b�m��
F��^]^:�o0�,GԾzO���z4>5�	;j"Y��g��1U��
_������*�&�#�
^@w�ﺵ����)3��>e��B�t/0�w��G�lrj h\��cxs�2�'���L�#�2�0�DS�7�_Z�)3 �?�!�:`(�	{僫�VN���&|k�
s�t���ȭ���0)ug
���hQ��C㳤��2��2}p�k �8����"簹�H��>xb�8H���90G\\�`�zc|���W�ۄ!/�q�U�ם݁Zw�D�*UbQ�T܂�گ��`�b��>�ȼ�-���"�
~��碥6��	d��{ EҘa9��Rns٬�
{�ER�Ʃk�V�����b��쌈�9�b
r:k>�
-3j_���_�3��T2TLQ�g� �
v�J不[*�ťa�TEJ,d�Yȳ4�4�댮y����jE�3=�ð=���+k*
;�/��<���nW�q���q,�!M5�gɿ[o�C�x
Ti�cn��b��I*�bb>]�>ǺF����T]N�-���e"����R��>�V�� �1�ʯdά��ҳ�S�vݨ��E�[gi�o"���م�r����ۼ�
-�:2�P��c��(�W8Z
���O߹�Q$sG_����V�j����C�����4|Gт�����(�8
���,�����)/�<��b�6=:
[�m�}�����Jya�;��>/6�����䞋��[������P��z����l��ʤQ<t�6�������ʒ��|��g�J�
��o�e|(O�E��K�m�#�fV���S��V�Yi��M!@v<5���*�u!��O��-�9��V���ǐ�U���
�Ѳw�u�O�J}MZ��&�*�Y22�5�q����;���в���4akY;L͌�-�3p[f�i��R��������� �]�_
�����l�1��q�`(s�̾�W*��筬s�h�?J��p�;�з�>C_HR+����}$�/vQ��~}�3�]�W��Z�?��
P�\�^��!g�R��?�~�:2��k�s�����A��	f�ԣ�.
Z8Lb�J���ފ�olUA��i�]��н^yN��4w�n�^�o f��}=��	��Ro����D��vh<�5��o�rnS��4L��D�塌��#{��'d ��]��
��
=Z����x׾�d�曰�R伡V����H���R�w�3�
����[����H�&���s
-
-[C}�o�.��S�R_3�5��:�c
	�6g�H;�@���*��4nbH�ob�H<O��&"��\�f�f���4UY���<�N��lL�6Є�����
<v�86E�Ec��k��f��:7�*y�%>Nx�̯�\4
�m��#w�y�m-�i�wY�"8�Jt�յ�t1w�PC������MF;�<W��9Y̲6��:20����T�|bQ���w�d;I#���8�N<M6���	�>�C
��X�9q���,T���Qa���Z:h���t������!
,I��$س�
W�pyѩ5QQ�&m+|I�/���5��v�A��da�H6�Fut�,�	n}��0A�#Vd������B�A�V�1�ʜ���[b2��5X�-wpXTy��g��r� 
����tnO�΍�����]����ō�W2��'��TƐ3;����>���U�.��^��[���Z?C���P���|�-�Kk��t��h�5,ka�
|L�%tR��k���
�
���0k�: ��Z3x���� ��-5�i�^��Sʪ���U���y��)4��S(��!~4�&�,6��;y��cC�XZ
-�+��Vm���hʺ��5w���6lj%Ƕ��R	I1�rE'ȱ>{��I
-������h�����6|�L����([�����8z>^���`��g�p���	�~@�E���0��QA��
'�ߋ5��
b�*��C��t
)���t<CI/B4ʡ
��+{h
[�MG�߁9�6d��@Y�e
5�)�$�zM�u�+V(�4
g!{�
����4^dEo��'vyL��ه�o�ڼ%��'�xu�
-@���ݎ�
\��{UW6�S���f~�EL��>�N��k>�?��I]o���2z���}
�l|c�z�T���QDP�y:R����>���5�x7'
:�9̥-���*a���
��v2���������g�i�����J�Z�)�7%�"�oC�Pr�$p�(�_$
{B!�M�:���z�~��$ ����=ǥ<�`g*v��� �#G�8�?�]������N�����}�tҘ��[�����Q�j��
��><���
�NH��h6N�����α�/~
�7R�
-M��32!�g�:n�*��
��@��](�E�R\W$�L������	��7G��n�rEofI9}-��4y����Q?����M��e��3;a�?U�;�fl�†��Rl�*
G`kn]�]Ո2k�xl�
q&Ǜ�F����T���U�=I&U�rCj�����\�_�64֖��s�Wt15k�w�s[�M_�l�?�i�����{�$��ު&D+(b���\	�Eۄ�G�EE�J<�[�B[�63��`�=�
��pŇڻL������ngI�k2����l#z�����s��
!1��g�Ie������<����#�^��ǭ���T����|O�T�k�?I@��1}�9��ׁ��S1۴quۆs�V�`�*�g/I�$�0�:me���_Q�p&(~� T7}��~ޮA�s��f��>��
H΀�Zq�%�_��G�g���5�
mYO^t���woxa� k7^�Y��Z��|T�v��n�6��#(��G��;��'������8A��myy��R�)
Ou�Ҳ�q1
�ڏ���g�g��κ���qd��q2wUzLA
]f
9+������Zgc<�S��
-�,���ڹ��W�X���1,�m��
���|��k���1�Dj���x
|���[_÷�>�c>۶XV�-ʞ�L��kjn�|SXV�*��1�ĦM��%ŭ���a���ʮ
�c[V�q���{X����ɯYw��2�ub��	Wd�8�عu�j *�����7�Xi%�B��Zj��U��J���_�
j��R�%F�V��
�
	�d�8�q�(?VS�9s���[]ż�F���.�z㶙��/40{6��
�U�7:�4Bz ģĝ go��
�gw��;�8yxś�|Xn��ɇ�z"N֒\X,Lj�ՠ�&莻pE_���W���5�"��.v*�T�Z�c�8�x����e����3'�4��Z��
��+<�Rѝ�kr1�WXm����U0�Z���p�C��
Ǥ��V
-ߏ�K�AL��OM?Z;��'2�j�ޱ����;�
� �#0-/+��LZ
�wy��j�f���L&�O���I�mrB���#Є�U�Vrk���a/x,--�&� AAS���9Ƙ,t�'�YIg��~RI<��
uj� ��
��?(���b��Ü���}��	��$�G�Ч��%C��<:p����[Q�W���.vQ=J6�dD:Ɵ��F�~3�a}�rI�h��P�Pŀ^4|�})O���ͷL�S����K
b��)G���b�(-�[�:p4/�Ub�/�q�����n^&'=t,5%F7��ؐ4>��d==U�G��Rс
-R��kR�˾�C�`�א�W���%��Yhv�7�R�tW ���޼�1,H����v�Cd6��iG
/�湗��1����s�/��{�c9�/�~�b�sܫ��`�F%�-w�Uڶ�a�.E@�����K�JGrG�ޏ�#G�*S�|��a��
��4��X�~�k�0�l���	X���
w
Nԑ�tT+kY�����Y�3
2���w��I�Gӕ�H#���$w�i7���hK�m�sE-U��j]
c�w���U*��d �{�� �����3��@����c��|7r��E��ӱ
�<Gc�!��M��<F�W{b��N��
P�Z
-�n�z���/Am�D]���z}�"u�[�S;���i&����x��쿻ݣ�o���1���̶�Ok�h���V�����
�b��ŧa+V�����~�=�_�ѾJ�] ̳�#MK�0�i��͗a�#�s�� ����U��qi��F�<��`�ar���H�/��OUX��0��
g�2k� ����<��� �m+ٻ��mq�8�Fy�x�IN�y���ۄ�Jݦ��^��N \���Q?�
-k/�:��b���#
<@��
��?��kE(�����hPg�*/~"��j&�z��GC�:S��`9Ǟ=����*�����
�;7�k��!�F)��q��g��U��s�M�e������5	��9Ss���iz��ja)-3t��9'���+j7�8��
��X�fΠ

֯����"mC���u
<[���4��+l?W⬕�y�y_���
0[TgY��}{0��׭��Xt���v<ᯜ\�
vV*q��
 �s��� �/�����1`�.۱0HG�(
�~s��X���F����<��;���059�q�"t,��@�j)
-Ç�Ɍ:~�w�ĸ!�n�H�u�B��k�U��ց�(�4��"��	�J[O� �Wم�q���ħ�r(T�
�f�_|
��ʖ�p���_����NI��6v��|�IdX>��;�q���1����8J���~��-e P�\�Rzш[
��X�67�%f얕t�#�:�����r
�1�i���Db�l�'S�Dk�R�B �J���R\�|�$�Y��n�>_��=�;>E�=�� �/�[�m�cֱ�����&ap~���	'�d���t�<+��*}�J�U٢����
̮���L�C菚K�VU#��B��� X�;8
-�v�yw��k��
1v>�
��PZPf�*ȴ�f��"ף���
D1�^��,�Ν~Cj��wz�VϠ�\	H�	��7�,
Z_�W�e���T��W�.��:���SO�RF�P�pT�f����X�2U�}��N��^��O�bs&rE
_� ܕ5S�K�2�g�����px��B���zHRg�D
-� *Af7P*Be�m����$l��S�W��ݩ\��N�	�5���J:���.��Y at bi�<@Xg�}����+�����K񞵬�?����H�,I��A�}�G!��Y>L��V#
?��#A3�_?9R�Sׯw�-Y��?�p��؝�'����u��ڝ�9��'�(|��Lkx�Eja�mZr땔=陲d'
o���� �*
�2�5����G�,#�JΗU
.P/�H	ۅG�]�W@'�O���4V�t�
-c�@���x��� z���[簟c�tkOT
�F���
���
��wk蛷��(��AK=���I�Ycr�mk��b0r�<�!�u≔$	��`9�?n���(
=e�'&��`֦Z̽G��,�pUkT?a�����î��̌�O�^�	}T�_
7��8����덤	�s�㈶��
	�
���2�v�6Hsf��
D�s���ai{��H�5�Kq��ĉ����_h�%��8
��	���I��~�|,�D�N�2y�
�g��04B$��.��>�"�/
- ����Jo6X^�
"㻩� ����}J��~�ާ
-��N6Wވ����O(
p�.�����Y����QD<��4Oz;�j x��
���Vۮf at m�;���N�M��˸̠��//_�5�����rg�~�c��ү��ɴ5_����g�ISzC
-����2m�A*���r�|��ʒp;��x��G"O?!���	�lg����~|-�<�Y=V���NZ�%��v�$���ɶצ��y.�\q#�,4UDr��Z(��D�4�`��8����%�%�s�uR.��Ex��ٹ�չ,E��	��
��� ��@�At�_KL�Q��
UҺRD;
l�/v�9ɔ{�s�+!���0��� ���n$
ޠ��n'�^x:V_��2�Xl�W�D,K�K�b|y������h���\ɿ�΍eg�{��BZ�J72h�ȶ��9:�4[�e3	�/����;��QYI"�]%��{$#�o;*��yi��J՝9V�I; ����eP;�����HG�Q9
�߂���
-d?'��g����/=�v���
|j�>\鰝�Ӵ����S�D��'�/x�%DK�;�P��8�=�'�(A�)��d��Ա�
�s��s�y|M��];��z(l �\��UQ� ��MS��*�	̮����^���=�KL��U�N�_
-��)B��%1�'�x�*�
k��O��ri��M�͔	������L5GҰ�P�L�>��e����r#
�p�=7d�
:��{��7¿��\����]�"{뭣���t|�sE�1��{K�ڂ�m�MѿZ5s|WH_Y+wF�F�ˤ�&|��(�
0/<&���=8~�5���\6�e4Q�T� kB˽�7h���+?�g���hӋ�6	w��q	�"���w�m|�jek�
[,�i�L6
- �h-��R�b[�ws�"B2W�ڂwB�Z������gں�t�q��Ca�V���/�b��]~Ez���1�oD�闍�g���}�5�A������\yMT#1\�	Ž>Q��
��lk��FХr�mwۍ������N��R
�Qb��>
�u��n��M��L�7UY�ٳ�H0O��n�`�����(�2V<@w����1��{�/-FkoԆc#I�<�֡�Ȳ�`2t�+,�~�-))绩 sN�ٓ}�3�o�
-s%Kh�F:"ɵV�/7fE�Nrw��(�b�Q�|��w|�H-��
-�UE?��cZ�.
-�$ke�o?Di�K���W"������2��w�^>�n�)�E�c�B�0�յ�Z&nR�����H�m� �
T4���f%�!��:��f'D�;l������$�{M��K�
C��X��KV�w1n�Ey���N9|
�;93��
'�̥2R���i�%��
�[b1��7���N
-�Z?�!�X^�x���S�#�vUw~ۆr
�������.P�>2�Rp���֠�c�\�ӊ�OH}o��͡1��.��cZt|��m�P�,��}=�6D+"uE.����I�`o=��D��tMS�䤾�)T%*���)�acI
�<F�A-��b�#1ld?���}�!~��t�i�$D�\M��3Rjm�� ��I��m�D#3~��˘aA4�G�������Y
(0W�Ћ[ꛦ�+z2%R���Y�
�n���&��:� /Ӵ� ��{�C�,���eq�Mә�`�	��
����n'&̏)�Ze�DŽ�8�;�INgK���f��s$��el�;�:G:�r7���M#i�b#�2]K}S�_A��w�C<iA�U�B���Y�?���S(=�<@��ѪU,\�9е��{}4���t�$q�p���nvWV#�WtQ�����;�Oۗ���㯞K�Hc�9��Zɴ-���Ƈ�ѩ����p�*'{ZĖ����4Qq��rV�#��s�(��u��j�/zg��<5ui
������:�R�W.A��e^ե����% ��
���Z���5p��B?�aɆ�R�f�x���[�U�
����C�~XM�N���+X螀
��1�(��L�;�
@V��JǙ����H�K��W��xIHZ
@ƺ���1�h��t����4΢$O�|
�䔶�Zs�!��IC��ˋ05e�=�f�
-Z{��l�U�5t�N�vUu欯S �<�(%-�N�B�
�N�6�=����мQ��
�
�.3%r�6��/|f�	;!����V��*T�Gp��,�٫%��՝u���C�iioR�u��F!'�r��
و
'�1NV�'|omDޮ���q����
����V��%o���zo2b'�=Pv&? >�F\�1��N�p�]b� ��a�Iͤ�_��m	��CR�-�a�C�vI͍�����f��"L�Ycq�@+�4��,�8���,��Xy�)�ԀT<aKk ��������>�g��E�8ڱ��L<B��~�Q:L��17$<P�,�0�Iy[�S��6k�a<k�I*EL�|��C���.6�}���dX��\��?*�=�}9�:v��\٨K�׸D�^%�w�>WN�I%��p�rD�q|�K����mp�i�+E�&�g3��"3��E����{v,�.IX�����Q�>���`n���G ��n@>̡�f��F�!X��
�|9Y��c2�
Ĵ�{3z����@ 
�V���-Cw
+��n;�̲<��st�i�����(���iB|����0UBW�#f�l�,�����ܦn��u��Qq�1�3�SF_Cf
�jB�
j
��n�|#�E�/֞�o)�:i��p¿�����
vZ��xiV�N�
Ar/!���S�8���^�}6l��FkSç
���
_F��
��Fu;-�@�C/u^0
-l���	Ki���!��3Rq��.^Q C���
-d�M���L�U��	�N�RBE�q�Ӌς�
-p�� ������X����`z�"�s�p� �$�<;���ִ(�Ʋf�<~��]
1�[�E>�yG��C��]�
-?
Ɇ��c�r�������~���S
Ē8��Yc�
`+�
����N�ϣ�B+	��vK���K�rD�1P?�G��
��]>�
[�^n�����m��6�m��|T��s�/Y���iR֎OX����4M�!��na��Ƞj�"L�����|�"�ܴ6����w
���``!�	-ˍp�gx���"/�
-"c��(�S�p�e�@|q�W�ů�����"�� '�X�<�Ý&�
�0ŏ��a�~�����ʓ<�
LNj�t,��b�eQJ�"䧔��H�H3�����v �D�A�B�������bvP2�\?V��7��4�1^0H��1$�[�8�;�x��O��%�V��1

��Ṽs�OHRJ�.�iݠ�Kz�T�D
OHri��3�-�)
��.=wPʌi�#H��V�E�Ǵ�_�s1&#S�1ó�uV��
�y)���Լ��'HR
-jO �ޞ.镄��Mx
�"�1���Ay���}��d
��.f>��Δ\�_w�?6sj���%�O�J�H`�n�JɎ�߰M��+L��D��"+_b��q�Ķ��4ϖ
� 0�y0��g��*,�3�]Y�����B|կJ��
�=}`y��W�z-JR�H6<�
�r�����XT,{j�$,�*�s	��Zv������
�6��>
_��|�r�
)x��]��
���O|���qkhd���������
_�	V�dGpX"P�c�^�{=p�\�����B���D���>�fD��8Ԇ1OM��ތ�g�����3��� ��
��tC��n�eU
�����S�pD��ˏ���@&�rЩ�HVc2�
p�"q'��a��i�;�E�+�'��Y��0v
�>4w�J\�i��S6��w|�se��s��I8I��8�pc�_pp��dVf�\rn�b��RȽ.��}՛��nQ.�>�d�
��	�qS��̘/r�2�k���-{
-�I!-|�(̼�y7W֛
�HM�I��U
Pc�8
/,��J�o	/j �B(�?,�����V��+2e��L��V/Wwc��
��Q-�핋x J!:�V�E�����J��>+��;|L�0��Z��> pƕ� Q%��/�Ʌavd=_U�%�n{t��V��C��A�D�q����#ć�����	*Aߟ.)��,NK~�3h+d�-��Z���;��iK|�F|�Ŭ=$>�)�]ޓ������J�~���c�'C����2
#ޕx�ړV��:���)�y8�
K2|�1tH��_�79\���N�\d��r�b^�溓C�&F[>��ͣN�N£*�p.8o��$e�	qo�퐾z���Pb��	�\�g��6��
-�
�#�
=������ W&�g�g�l��^�s�LdG��Ao�l�a+��	�������7��ET	w���sh
#CV�*/H���䞒���l�
&HS��C`���[�]�b[��J=p��ҮH<�X�ў 7+���u
�l��

p�e+�
ᣙ��ʑ���y�5�O\2=#Ye�'�A_95N�+,6��@
�"-V��q`V�?�3�LZ��3�S��e-m���AB��B�;@(Px�)�!�`��tȷ�o��8�h"�Jv�1�ѮnȦu'�����V�-K�����
nI(S�Z�X�PO��)�p7����T�d��6�9������97��w��:�뤑W���y5λ���z$x4�aO�}B�

|\�[H�C��Z����Q��:]��=�G�w�屈�I�}_4�I���,��)y�����ι�#�!Cs:X1|Qh�6�ݯ�e���w��
zsQ���g�~�U����S#%ڷE��/��	@3���;Hh?B�'�j^B��>��?aWeTӯo��9/���i
�m�͞Y�����i�٣X��!{�4��eRK�w��.���Ш��
G�R��UՓ�����N��/u��)�]ɺ�Q�{u;����;�
^�*g��%Y��ݤ4_����U,>X��.���D�x#�����u=�ټ�G���e [...]
�ͷ:�,^�R;�ʆ�\�^Pc��!b0;z����;���Q-~i�D"������Bs�ncCb�j��:+�v�4z��H=�L���մ/C��mzl�г*�a�
��r�s��>>���7 ��V�-|��(�<~��O�Úˑ�P
�� U�>o������g
��ZXQ�ͻW�д��c��u�;hl�
s�Fx��}� �Z��]N�0�)�?�;�4O���ɥ�RI����)��.n�����3(��3�9
-��by�N*^�e�����`�@ �jO�(�
-��>��<	������)�ܔf����}�lu º���ՂK�ﭷh��?�A��Lm�c�#���
(���

-W֮M�)60
�2�O��b-����R\�h݀��Hb(��q�{&lj����
0��B�Gw	6.1�!v�6G�\Ye�N�@E�Sk�0n^���im��hMn2j����;CI��N��F<m�&wf3��OГE|���
Y�����?��J����oWdjD�Wĺˋ���#O��6��Y}
�5�'N���J���� �ƬR�;I͟���
ECd*���
-I:��n��N�-8R\"nҵ��#��	�k���:Q;v2�6m��
D׶p,��2��eԫ�W�g�&�]�U��Z�$J��^�P�<b�`.�}����F<�[�K����.@��x�[��:��Z��3�{<�$�>������
�ٽ\�g
�lWH���f_!:���P߭
- �W��Kn��꾆�X5�T�K�(��K�v����b
b�D�4�C����{�v�kOnvv!7�ީO���"VNhsd�@�� b��eZ��;���7=�|
�^
�=���0�Ů_�gl�
~�ٕQ�\r���?P��$�G�)���Pa�)]|.LT��"�Z��.u�	0�
�յdH��H"풂{�wR�7@��s��G��a�v�xc1��2i�l���N׻�Z�z���B�C�tb!���X��=7�qe��`���|��cI��k0�W���IO�IiP�-Ow��J�
�����;����Y��@<�F��w�P܏5
�q8v��ߟi��o��{<
���lAFA�ȵ~E���̭��2}�hG"��~n�2!}Dͨ�]�m�
�j�O :���>��<u�M�Q��h�#a�
/k�i
���*s�6�����
�PJetI�m�������_�]iEM�	f��w�Jͨ:@�*[zj^�殯]VF�$d�G�m$ˈ"�۔���Q�J���� [...]
�ěo
�?�+�t�֒IBއe@ˊ^�{5X�a����x��4;[؁
 -`D��b�c�ʣ�+D0q{�#�gF�|�h����lb�y. W�	bCK�ڵ~� �w���n�y`b:9
�%k�
�{����P��Kȍ�
י���
`�"��̐��q�g�{=*
��h-��ǔ��zgyR�M��ֵ�+
�Ag���9�(�/�Ў��{8eф�+#�bϣ�
	�|g���H�W�Z��hhm�
-_
:�T�&b�!�Y����5,� ��;������*	N�w\���S
-��M�g��Py���v�]}<
C�8r�E՚u*^2&��̠
-���_A���B��''Q<�͑
rH���N��
k�Z�	
[
-�,K��]b��hb�Fc��ɯ)S�/:N
GJ��ڳX����
-�14��w8��o��g�8�x�y��h��~��X���J�%����Sy�U�5B
-Aϕ�
����pn����4A�Fϓmڎɬ�m�|��[�~
�j�.�sw4�$
h˜�		t�~����(��{x!vt
�Ȃ5'J�F
�Q���/@�� JA��_�d�5I��א*�����2L�u�?��5M#���-�4Wm~���;��$iY��vIv��Q>Zd����?A7;���$Z��_���X:8燁T�&�Mt�{�n�l�A�&ף�%�=�U
�����e�mZ��2
 M�"�u�3b�����
-endstream
-endobj
-20033 0 obj <<
-/Type /FontDescriptor
-/FontName /URKSXV+NimbusRomNo9L-Medi
-/Flags 4
-/FontBBox [-168 -341 1000 960]
-/Ascent 690
-/CapHeight 690
-/Descent -209
-/ItalicAngle 0
-/StemV 140
-/XHeight 461
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/b/bracketleft/bracketright/c/colon/comma/d/e/eight/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quoteright/r/s/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 20032 0 R
->> endobj
-20034 0 obj <<
-/Length1 1642
-/Length2 11972
-/Length3 0
-/Length 12819     
-/Filter /FlateDecode
->>
-stream
-xڭweT\�-���Bpww���P�B��(\������
��!��!x��9�ݾ=�{���T������d���شoյX%�!�@9����!P9Z��hB
� �*��@k�"������JC�0,c
-�� ���
�)((�N
��8yBAla 
M=Fff�Y�����'���� н<�
 N�@0���`�@�
��~�n��&`�W���@�Kꮖ +�
-�
-v2l P��? +��Wi.l/\�. 
���
-���:�� ��PG����3 �� � �^z � @`+W�x��@�N�	
-y�������C\`.VP�
�U]F�y�l-`�v�� ���Mk���_%���м�0
� z���e	X�\�
,<_b��9AA����W, (������B���Ww�U'�?Uo������7��[���t�aC��z�i{��Fg�k^�6 '�?�֮N��܀п����0�$aa
;x��6��j�KH �Oe��=��$�_�E�������z�����S˹:8�Y8�
�?�
�e�X�/���kٸ:��7 ��������_���m=�?���8X�;�~I�uX9yٸ�a�ȁ<��� ��-����q�u��@�
|��޾8qp��m
�����?  ���
x����ٵ������M��e����i{:�7��*��?QIIA< ެ\/��rs� � �|<�����p��j��< F
l

������u2�7Y����҂Y��_��?
�V�P��/����y�{��@����J8�.5#
VK�38&c�q0ĩ�^�0߿��15lM����&��aB��s���qK�i{��Ё�;x�G����7�];?�v �i	Vڡ^����*�!�������i�
-�D;7�����[�?>͵��UʗX���7��t	{7���#C���Ƚ[d�ٱ�h�-����&�<͡��VO��n�Л+I�o��e����2�������7�~	
U���a�&K�2��f�r�&��V�03s.�"����5
���f�W��W}�9U��z!��g�����î=_�I��Q�y��v�r�Ki�<{猝�f�u2��{EȰ�iH=�ngu�
�X�1.��i��'D�>=	�r�<;���^qD 5��ٳF������ҍ�PZ�$1��i��K��d�l�]�:.9x
D_sV}00�3Ȓ~���
�H���%ЁJ��"-d�X2��@T����|(�q��M]\
��0e)W�2���dU+�|��'D��+G��Sm�sK�����(JB-�'�8��9��4��rӅ&5,P�d��*Q3����FIPj
�}�ib�f#m�
�($�@b�ŗ%V��0�M�иm�:��"����zO�5
U���}�A9�+��ώ왏�Ϋ�h�J���m�P��?";��7����A:&x at r&��s�ϭb��)�x�Lد�Z�i1P1$4
:�o�Bt����!��W��$��QP�w���<X����I�O6�
-$H��F���ʸ=�14���z��>L�qn�ڶ��>��m]��X���-eS�El)���t8͞���)rl*1z̜����lNݏ��U��.�H��IXߓq'^�g%.x���|n�B�ٻRH�v
��Z;��#�����<9�)Vׯ3���ُ��q�iZ"���Ƥƅ���z�N+Re
���\�rZ��B�n�����5̙i
�����$>����6��-[�f��.��E��y�p�a���O��3f������4.g�`:��N9�a�o/�
y��E�!��VƓL5��#��ʨ�
V�� �m��n��
�J�
��/�LI\V�
-��x�u���QĞ)N�X*1�z�ÙLҬ�䨔E
���[���q�ژ�G.��כ��o��L�
��ܖη�^��|2��C3^to��Wc���gNSG���m��!��)L�nM
dW���-D:Ä0n�*��=xF����5�(���]��h�R�y��Qnl��6�P�,nBC��ӛI+6���0l�rNU��pAWe�l_Py&7�i�����)�1�� �AG�}6
�8z�kx˲��Ɂun�`AW�]��8'2���9d†�r2h�Vl����Kx���U�QpѐL�p�~�7���B�?����#�!��#!��
[���DY9Y�(�����k��+K�Z�8Fm�0���E��
Fz\\:¾-�����&x26�K��D�'�́��#���5S̅7����To�J�Rr��Lt�1�9F��\�M�fX��E�S�ָ�vZ�������
�G%"'��y"wb$�W+��W�.�v��J�ͭ��ME9[�
&ؒF�B3���
��x��⭈�CP�`�Sǫ�5�ǟ$����2�j��b�KSd	�5�a�5IS�KK� ' ~�A�%3Oj���LFZ�vi�c���2y���FA)
K���x��,����Y��YB>�D��O�1��
���'@�[{T��>��.C���
�6Ly-B?)��	4�ˀ/ }T{sE�n�h����N�*����
���x؊�Q����	Nr#����"�,���ˣR�S�3̨��P�����X�"��a>�w8~+�<ZI��ͮno�\

�o͡N�y�z[ߙ��x$�6 C%������Ԝq\"���

�\̸{��R_Yg�Ֆ��}�샋��Hld���-��
�l���|�a��.
-[GT�����ܔ��Q�O����
r�ė�Ӎ��Y���F�z��cK��(Y���S|Wd��!גi�Qp�(jfu�
�Cyo���S���/�%�5bgĀE���a)Yq]
�4�]�r6�Ć��T�L�o��6HM��j���m�ˢnXM�)W�g++�Rt��c[�\��)�1d�y����bp�n�"��")!Kn|R�\7t��&Uz
-YѼ#K�?�iEPI��w~m{;�
��{�C���׎�sƉep�DJ�4x
���d�J����`5�
Z��{S�?��H�`�H��_�m�ڢ�[�0!E�
-ea%�$�	'��~�T]��p�ѱ��,�U �Y��b�_Gȫ$�G�L�-� އK~�g�$����^qF�&��8$
�
�1����BopQ��n"�m 'g2PC����hD���'���U�P�`;z�b�j�!9�*��v5
��Z�g9���,4����jnh�&���E���.}~�bs1�n�qH'
}��:���bA�%rƜV�OP��Z�m9`��o��CNs�Z$�
-
�V*s�@����
=���
��HD|^֣�����������``���oaT�,6�Som���]�!��l_+�U�&bPAѺ�2�X�^�������1G_ڊw��c�#b�O�O!>�kQ�Q
}z�����������*�#�n
�nK�&�q&��	������yR��N;��`��qg�m�J�i�[����ڵx��J�KH��W�q���Q��g��$�7ٍ����8��
\
-���j��P��8����p
-sz=:�U��Ѧ:�[�}f��&9�T�
�&�.�	��!̑��L�
��A[�5J���z����@�%�"P����J������J���YZY�%�
���q\���y�18m�.!^
���
�w���������e�B�q�����XEG
K?��ž�X�W
 ��H�n��d��l���=������q�m�`�����J?fzM�fj�q�>�(�!m��,UhO:b}�������e{;������*`%�\`tu9��J�=9j��I��"�&5�]�����v>3��Gn�����I�/������
�S���XA�aR6yak��V�
�M�u����z��Ԫcf>|��3bC�GȺI�,����b���=�뢆��L92a4F�	T�U��+�8U�/��nc���T��
��Q��sN
Kh8E)�PeY�[Bzw�=`H��#�I`�w3�p�s���6L��w���(p�ɚ%�9	��
�3�C�
�
n$X�h2>p&�����~�w�ji�
�i�֢���}K?޾ii�/��E��R���m�Lj��|�9!<N�ܽ�������
��V�0���
��f�t�p��
h����rn2���/�ִU�fѷ'��|
z�C�o..y�&��3Q(�1A�N��vw�
O���>m�[
�{Z�����[�����|ɤ]L6�v�~�rfߒ�F,��X���H�d�~��Z�:��"�Q-$�R�z�T#�U����ޏ�<�1�>�0��G�l-�[Y	��:�ݍ��zF�����qjlq���.ݦW��i��E�Kɱ6�W/{Z(v��IhaSrwR����k�:~��-����
M��O�
-�i�G� R\�	蚽��7#uj_vG�X��<�_
�ܒu���O��YP�4Vne�s�D#���ZM�r��-��8v��L�#������-���֌�W�&g~FU�&�i�T���q�����[tk������ŬeZ;���J�.�*u����2R����7aECT��V�@
d��&|�7g&E���tQt��
dFD.P�>���
0r�c�-���'�9�#�j�!�z�}��@4�c�Y�O�Q�w�N�ɮ��CL����!i��:��!�
�D��i��6�a�u��CZ�{�[
Ʊә���1̫��b~�M
��=`�@̂(��`�Λ����Ͼ�__썯a@�	��ve��3�\)ʳE���U�%)�+�ȳ�J������H�o��Wj1�;MC���oέjA��{��L!`��|ƕJ���� :t�˥�{2��P>�?cc��
�VQ���UpV���b5s�M�1jv}y����+�e�O�d�/�@�]\ԟ���n���]�&�̳GU��Z�3�t������� [...]
����$�
8V
��;��Y�1G��OC����?�
�;�[8
�Y
�Й��$Po�2ݩ�r�9���fva�^�$��p &9����z�W������k��m���@��W�{���y?. ��{�ϛ���%�Q-��)
��q	����A�A�|u퍳D�4�|*[s7P.C
'd*`O��Uѱ�:����m"ކ����J��\ļl,�;}dzL֋0��)IP��^z���W;ǚ����t��E�G�I�޲�>9e$ʷ���h��l^lg�n-��Ogf5�+��LhTB��0[^c�XĹ��O��{6�/��f;��?[�|��p
-�P�>ºH|�Vn|��g�����/Jp���׃Y)6<Ƹs���&^���h��t�b�0�/yC?�㱟{i�Z#1
U�����+
�ռ
-���Q��.<ʃ��7fJ�uDfppg���
-�E.�@zk�.hp��1d�_��#��H�Ie��ϓ���Sj �W�B|ʩ
C��O���-����.�e��b��݄?����R
u7,6{A�y#����A��eMpQ���wiW�G�@���7��7�9f
O[-��~��'�����*y]�fH�35b}�6+�g|=b��
ep���f5A�G���H�����;
�mpP��Ɲ�y�FBP������	i�P��9��;�hs��c��{1+9�~p��l������=j:���2����An�4�P�k"5�T#���fc% >�i���x�O�!j��,I��=w���KT���v�u�K&��i���>.�G1\:u��&ja���.m�V��a+ �@��O`>V�X�n��l"{j����و�:��c4��
�֙�Wu�laQl_F�kH{V��l5��g�� �����
f����epG�$�BzI�4�@�݇N��D
39�:�k�V+Z�jB�Z	 <�9D ��[�l���ޟ
-*Si���߱|��;���
l$^����I�`s��*T�Z���3O�=;H
��!��<���v�ɀ?����9�����5c�p7҃.�C�X�&l8��*8B��ދ��}�^h�
-N�܌-M������-��D
���w}������b��b5_
�������o���B9�mpo��$��lc�Dz̲��m�8Qy[8�HU�&�[�x���l�<7����sz ��c;�731��.���9��
h}:�b���O>�#T���{fP|;]Z�1C��=��';��l{
�-��E����cۈ�/�zh�f���_��׶�kX���z�U�]���ʈ�_�*c�\� 8^�>���i1L����k�׶��sWl����lM�%oᚕ7���;�j�����Y�����Bu]�8����#]Q0�H�*C)M]�n���¥�{1�߬�#�}�
*'��K.&�3���Q��p�3f�
���S{d\����
Z�X�� 4
���$��1���j��NX��p���ņ��cXy
F��n
�
���'����3����K�����-'mK�X�����Iy4���NTR�"�
�b�Tt�1��R��O�+�M^|¤}˭p�
�g�G�OmP:P�� [...]
:;��G0��gW�̤s1�b���[�P�c�1	=rG@ʽ~�k��p���*m�&����L�Eڜ��c���Zk�`�lr��o�OS�5�;,}W
-=E^�%�BA�~�����Ӎqh;���$���!Z�z��
۷�K�v&�=�9�H�#+�*�)�$��W����@qcED�,{�<����||J	���k�vb��j��X��ACq���n�s�(7>����,�i8��WԼw(:�By��͐pޞt
e7,a��R�%�
*�B�8�
�e� m{��M���]m_#�{��
-���m�P%,���
-'u�Us�(nh
9����2� �!s��u�X
{Qe�K=f�^�C�7�,���,���S�>��S<q"�`Ubp����i��c��ϔl���v~6��{�
-��β3�� �����B��b�^y���I���H-<L\�����$j}��g�B�Ŏ�K���䈣G���j�"�BV$�᭏�~�"S��K�E�v
�����=��


`�&���'��R/I�.9���`�
�R�P�o
š
o�]f����?!4��a
�d%�v�8;���F
/�
���L��3p�-B��z>u#o+�RA�T0���ҲDQ�@x�j�v�

��ͩã�O��a�d��.y��%B��L:J�:�q�f����m�_����'��U�e�(��
f�����t
b����y
�RM�(��k�c��2�$>֙Gn��wk�q�&�aj�:5X}��,��IO37�=6
ی
�\�����	
}�3𬟎dd�Z�QP��X�o)<�-�����}����p�Y��0R���,�-֘ʀ
��j:-C(a�C
mY6���ʇ4��*c��X=`$�
�ӷ\�uP�;&��z�����W��]f��X}E;}L�)աp6�j�
\5�����B^U��A�������96W��T5����k-�����#�y��RA���TD�Ýp�L'OB�[�	��F���^w��b� ��x����1��va1r6w���":\C$�+�W;�I�q�f�^o���ic�#&E�jYJ���5�)*_/G�!I�.r��+��̠����dD[H��
F=�1_)���u|:�S�_mk��
3���5~�M`��$���.+�I���<�E".t
��!�l�Xqa.k
-�Z�U�
���^����
���:׷���TD�&�JX��!X���|�h��z��[�|KZ��E�ģfѓ����x{��Y)�;qZ��DZ��	t�����X-�Cy�i=�]�הj���x`�)��(�Y��
�
��

-4�e�ߛ�
�cD�+1Zq�C	B�XhIFg���O���U�;nǟeu�Y5�p�f��9k�[@�
��������D?�~�
�'Rp���[2�t���`vŽo��6�տr��%��_x#��w
�G�]	;6��}�Q`@��t-_�����
��tJ$�X�Ֆ���s��������k#����i+��=E��F	�`F'�#?RG���m���Đ�����%
��~�(����!
-/�R�_��U�]�d U@����3��<�ܫ�!������|���wjy.o|��K°zH�,/�
V�j�U,��Q�\}�7o��
����8UQ	0�PM���m�>?�d0
�"�Ѵ�[J�
�}b}p�9@�sз<�s�v y-[k[�
��J(��K�zw����5#��#
=��o�V�_�M���~&S^ �+�K[k���`�f�xs�9
�l�% �:G�6����uV���GJ��:�����έx�g0�W
���Hk�O�i{��1��|�����b�c�k��d
-��3��P_�B����5ь2Y��nt�/rm������f>N	��g�t
K�Lq�Wh7�{Ÿ����,a}�rr�P�����
-c�%��L�@e�
- ��N,f�k�Yv�}~jr��{�'t���d6R��)�ݨ��[Ũ}�J(U���.q5����V�J�s��YϱR��CG/SR�����h��*���q��U��mK��1_M�Ɍe��ư<7����Cu��w$�H~��\�=qmvkI��1�{��5�~�;Ó
�Y
E�?�d
!��QI
���?9�pQ���%���'�m�N���TNB�y[�,��,��^�s��a�R��cW���D���YV���^o�ԡ0;7� h����KLz���	I'bi���=�7
-��$}BN�>:���(U����L���QR�K,I�)�wie,cm�3)U'�:'V��nŃ k�<��)��qh����������դ���|S��g?�@v!���?��,q
��=.S�y�\�ʌ{AH�^��0a\�'!��xԟ,�m��]ɞ��+`MՈ��.6�!<7Nax��xkL[��?:�%[y͛�gao�MN�M��"Z[�Y���UE~�F%��@]]�#�Xs���&��n��z��]R��+˝�Mi����M��*�"}��o��{�̕��1:ʛ
[y�
���.7t�º�XM%x&k9r����\WރTMZ�j
g���O܈�Md�fz�[��Us��Z���Bn8v��
���t���H�lN5
<o�%�,��FFf����)(^�C�p�P�� 9�V`[�A�}�m�d#�I�
`�7kC���>��Yb�)��Ad�S4�<���;�Ҁ�����e�6D������i�-�8t��Y� j�L���΂Ż�v��B�
�
b�����h���\j�5��7W�|e�G:
q�e
��෡b#M�7oU�ɖ*U�bd���Tљ�b3=J�s�	C�W	�M
�:L�8T�8�T3��i�]o�t�iZ��A�0���Zӯ��F!p���[4r�{���"e��_&I#�G�^w{�Z����4Z�,�‹:�!$�]�Cz�4]~�>�x�J6
�-M
����/����l�K���Q{Q�/o��E����3<��ja�,0��,�ѝ
6����4I�"��d$%�?�g��mxF#_wӯ:���|�I!�*�Gn
�?���>=�F��Cu�5�iaY��TN�4��
-k���r}~j��T��������k��8
�O�9DF!��4]>��ZH�˰�$�Pfʆ�M'�
-�TM��C��Zc���L�2I5�bo��Ԡ� 40�����Q��K��+��f�i����u��� Ŧ�n�r�Uj��ny��	6�5�
>).��dHLbX0�G��������r�*���z�r��q�=5��hG+�Š�eY|R9�6_bԶ�_��#�4����7�����9���q�ߡnyZD
��lF�q�[���o!�K���6~�۳����KԸ~CH��v��r�G�Q�;;��̹řU���9^��NG6
-�J)+-���c{�	�� fA�<)��9�e-��M�Y�����.n�N�
��A&�=�d�
�|���	������(��-s�8��
-?@[���u6|ui@���
�YGT;��)�����'9{��D�G�������n_ю|���A
{bn%'��b��d4���"{�x�ժp�C_%)'Z`�x9�N]��6��1_��뤳�e���{A���K��[߹T���Z��05��k��$V����Q���
�vb����N�����Qz�
S��o��}5  ?p���5q
�ǝ�p{��t��P�g=�Y
-Gt�{)��2��q�i��h�<B
D�
uݥԒċ�h�>αV��cC��	
�ZL�|wM�U�#F��4�
�S�<�� �o����
>��7BE�
�,1��z�Z�̆:�!��\͖�c���\��
��Q���gm�2�̣�i���V�OJ��]o-F��H�\wt��\����p��I�=��}j�&��h;=
�OTO�׮s�#�<���Y:z�=�o�
����m��6�T�`o�ޒ���Z�3��:4$׭E~�+��
rf
�+���=-^*��.ŕv�O�^O���7ݤ�r��qTY`b=^F1V��2
!ϙN��9Q��y�8��e�E�J�n~�4ΐS����DjHQyh�9�v����[]�5c���,
���Ѽ�*a5p$��7\�̃Y�5 �V>�V��=�]��ouL�
x~�ĉ2;�6�41&�1�A�
-g��g8J�
�eL;J�b���J��‹ �'ڏ��M��[�N�6p��.8���TCr�}V7�U�O-�'1����0l
b�
�F�U��°��%XdîuG��}����M���&
-OP(v^r�zztQs�F�7��?�Y�1<ǃ��/
��TP��
^��fd#�rS�rU�"7�
��c!�
���tp���C���fpF*�
v	���*b��c�;��b�V(s�#4�Q�&�-=����x{��:�}��V�\�/��c�٥Eg
5�`�]����U�x�

��p?��G��E�M���g
ur��4����p���Zi�kH�E�L�ٴ����XBvQ����Nm�:��"*�Ä��@:"J�������Ȏ�.��i�k3�}�
->�+��)�­ri�t]�At��ð�������ex���{J �"J\&�"���P5�׹
۟���\
���"�G3��|B��x~fO��b��
-S'�
�}�5%�p����qB}�p�*U�1g֑A
zT���BI���n�����}�U�����i_R�+�sg/I�ܨ��0��5�T��Ԫ�q.�"!
%�*y����E�v�v}y5�cYG������[���J*d7�o����\ģ�ǮOV��u��z���e�����7*��?{��q�nG�ś8��*r��H~c)pi�D�osD�8�ܗ�!�g�����:tAb��0��R^��I�.����LA�
-��C�N3n�[�K³�).d�0s&��o]�4�r�
�
- ��^u��o�si{3^�aY�I=�������l����o���2�R���dLMڌ�C�)U����$��P@`
������OB�lZ��4�tI�)0=I���0Cֿ5��Q��
�8��1nm�A_^����n��Q����wPۑݛ8����:��)̀�A5O��ݘg����k��C�0-)�O���Z�
�H�OJ
C�ޕ�q�w�5�
�?p��_��kfPl��#N�PLR=�=`���
2�X��yױ�
-�E�-4{��#:A"D����n��2cia
~e¹➏�[�&X�uZ0�g������Ӡ�9�7����N��w;Vf�"P9��xE�f҃���:
ҨU�����L��]:�e8��LP�B&
vl��㉲��>�W��KN��w|��ŕ�u��I�e�v��燫p������'yH[3^��o��
-����TX�h֛a{�^�RQ�6iE
'�߮�Sо5������b[�����	�g���r�۵|�
1p�
-�I
-��Q7,"ʹI?$
�Ԝ�G�eJMt ���>0��&YE���O��T}��x�q��.wd��
*�a���4L�Qɗ�ˇ}�D�I�����4�}M�*:�����
m� S���;��w̠
s��tb;�m;�iួz�Xn�
-�3����Jڨ<ϫ��Z���;��ȕ��3�@=�Q�
~���{�9�&
�#
-$��S��-�Q;�6��'������{zv��~e"�M"�����4��=�y8�vY�T���a�BOV������~o�WO�M1�O�
2*�X��m�G(�
���[�
��yޑ��!��� ��2�S>+i�(�R�r,o_�
��uF�4?+$�
6�U%��B.��g���Q������;g�5����`|� rm�Ҽ�~.8?ˉ�ͬžƷ�����|�%Md�.ko�����#��kpg��v�+_�8C�V-@�Ԯ�C�md��NIˊ�A�g���
�WM�1�����Y��]T���o�3�7)��$�/�"������Yv7�|�R%�Y4�{����J�Fd,�g��+��B�P�G
���A}it�5�K���t�oc��
>�i=��\�~���)մ��1#�ȑ�֩���0���������Q��7ٽ�0����4&��XH3vf�|�y�Q4SV)b�k
���A�"�]�k���
���Q+1%qB��<�R�.�ԑu�Ğ�
V�c�F0��\5�dּ�D���u5zK�Y�J~�$"��'�{�SC��īm��> ^Y�OKt����] ���c@=����+��+.�r,�O+��1�4iw�G�d-U21ᦣt�%��e�
ş=\��ƺ%
���p��o�s$��
Eե��_�>��&'~�<���OaX
6PyFܔE�����{
-endstream
-endobj
-20035 0 obj <<
-/Type /FontDescriptor
-/FontName /SBCPHW+NimbusRomNo9L-MediItal
-/Flags 4
-/FontBBox [-200 -324 996 964]
-/Ascent 688
-/CapHeight 688
-/Descent -209
-/ItalicAngle -15
-/StemV 120
-/XHeight 462
-/CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/c/d/e/eight/five/four/i/m/n/o/one/r/s/seven/six/t/three/two/underscore/y)
-/FontFile 20034 0 R
->> endobj
-20036 0 obj <<
-/Length1 1630
-/Length2 21405
-/Length3 0
-/Length 22250     
-/Filter /FlateDecode
->>
-stream
-xڬ�c�e�&�f�핕�m�Ҷm۶]i۶m۬�}�ۻO��s��t�+b���3�wF,B9E#[cQ['ZzN�����������-�4����3௜��D��X����FX�ɘ�jl6602888`H B�v��fN reU
-**����c0p��_OGsS ��c+[;kc���׎��� '3c����1 at HVN]BF
@.&�
3�1vз�9X���
�m
�) &� � ��6F����H�K��p�364��f�fhl���`g�`m����`�0uзq��'[�������?	�����+!;ۿ�u��l
�


�� ��	��;O'3}�b;��UlM�Z�:�Sҿta�j���m
N�nN��20�;�Y��������_i8;�ۘ�g� cS}#+cGǿ0�����	�_�׷��r�����g�N��V&�0
�c:��mjnC�ϬHؘ���-7r�����ÿD���P�MB�����
`dlC'c��7$����e��>��(�o!�����7r�+G��K���>�WhQg++}���
��d�m �
@�Ϣ��w����[�[�����������?�I8��m����_j�i��-4w5w36�3w24��[��ٿ��6F�V�6���W[4
���E�dfnhi�	,�V���
-������e�%�$��7
�_�r�I���on���_�F������������
@��������#���&俀���K����
���nz�U�?~�y��/0"6��F���������i���Ԇ�I���[���5���nƆ0k˶�\Ai��N�9Óš��
���v%
J��~ն=�ia�
z5���Ӝ_m�K�v����G���Vd=)�Wy��D}�H[�
lTGt:%p��Q�׋�;`��*G{��
-:�x�
LP��~D.�~��Ov�>����h���@ȵ�����Od�c#�C=��}�8Tٱ�$\�>��IN�z
�_�o.l��KY-��H�ʮ
8���ď1�(
�L��������R�W�!�1��	���B3J�:u������y9�,3W9b�a�#��҈
-Y���T���35B��U�����U"yfؘ��HDx�#�k��ʓ����u:���x������~_��
��D3
�F<�s���[�P^D=A�)�1���sc��l5�
�OYT���C�5�t!ոJ]
�0�a�"�oY7pFI��{�'��hvu����-��͜�7J�A�7
��w_�JA�����0'k\|�/�
56RkF�j�V�d�
�d�D��'q�e�����I]���R��B�",�b�j�%ǀu�L��$�ՠ�\
���&�/y"� ��{��S��B� *� I���mv��$v�^..�Kq�9UhD]�K�AνM����sEZv
�v�3.Y)qf�����x�)`�(JS�]�M�8en9.nJ��O�Y����$�Q\R^T=UbFDjC���Eҿ��X���CJu���
U�\��P
���� �
j������/U?Q�#�́�0u�����!@�re�}�Zk.�dir�^���m�
um��љ����b7Ly�,��y���#��-����V�� ��hg�Ik��
	���嬆h,ʴQ�/d��Hj�Ӣ���
pq؞1o��nC/���]oK�n	2�J�O]�7�,<��V�0B������#,ŔS����׊���_����N�V�$T��Q"_L�K�P�X��TO��1MQi�S��m�2U�XŨ���ʕ�������*v�ل7L���Ȅư�y�]/�
-2n�K=����4[�B�b��泦���:�3.,`�}���c0xw�����j��p��ʄ�>W����ݞb{��ۚ���.���ߙ��������TH؏ n��h[�x�
�e2ۜ��Ky�v�۳4�?�
�f�C[�9�l��E�3�m����V�ko2l{ؾ/}.z��0BT1��T'\RZ�_�Lb�	��\8���k:
� �U :hE�@.G~5C���7�kr�
�yw�%�\ϝ�9�m��+�2ż.o�6�&D6�,�������}��s��v%s�e��Fc
B��� ɛ�%yj
�S��
)g�X���0J
.䄰f
ḇ!�Z�2E�An����JW�敜�:c��KT�~CLB
��#�N�,�I}�uj��x�J�0�o�R��uj��,*����@���jsǯ���`�Y،�f
-� N� ��
���U,x���?/�v��b� Q��Ta���q��#f5���kj:F
?H�Q*uA��d�D~K{l��/ϡ��7x}+q�4k��A�κP��J�G��*v&"��%��g���hя��o�"o(��u�30���_��6�����#��
t�Qܗ���g��3k�����(�aQ�h9hR�;�4�j�(,N��Mn+)/-mI$�5��
]v;V3],���;����7P��_����(pxQ���V�t��Һ����J��ףx���C� =�H�A����C΁
��MB
->�	�O%�rGA1���{.��faY��qi{�Y��o.�j�:*�/eb���Ǡ�5[
r�y��
�鐇F�`�f��1S��ǘe�&}h�������)KR��(���{x�Qqy0&-�V�
� ر^�	���<���eJO|ۤ�|� ���$�B��� Bu����� ����^ ���`�^�P
�r k�χ�s�p��j�����tG��[R��5���H�Czħ~L�"'�F}�1�5�h �!�&ڬ
���ʁXl^i	d|es�T�S	�K�s��K�T� ��ƾ�q;�J<J,��<��:0���=U�	Lk7ax�
o�7V
����*V*1����R��?(gj�
ès��!�|��
�?_!vl�Op��}
�V�R�uQ 8'
P�}�4"�<����7����]�옠̹�H����^􂙮��#Op���[��E$�
�@ ��D\;�N}0��!�.���j��w�J6����] &6;��2�.��`d���C��d���O�T��3}S���9Ӭ�F����(B�2�~�F��O��G
��
�vwc�Ng3�ϳ�6h/���@�8
Y��)�g�ß
F
-�2���
c�R���M`bk��
e�q���X��Ҕ�nN �n�;O�sYv��蝇s£}��^\�M
������MƵ�l�腭Ԍ3n��.�Y2��S9�8�caW'(x�a{�>Zn5�
B�!v\�������Gޤ�n����me
�v|�:������;VlA���*�Z��][�`Z*nU��LqdR	����8w�����A�	��@D6�6��A���
#s��
��Ujja|��,ć��ӳ��u�t�Z�������g�8jW	����m�(Z���"ן�VUC�+��n��:5�]���DI��
kcU�	k5'�"�mҮ�l}���aGh
t��波uE��M&��jO���5�$�GK�������:� M%��N�����p4ct�OA��
��}sԧ�nhW�
�� �[�D����X�����2�{�O!�N"Ѵ�/ �<6�� rj�J�a��V�z�Aw���>�Q
70y-[p��]�c�EB��
�ـߔp�aa����uF3+�
�v�����I�q�]!¯q�߅��z��tq�LJw䲊�q��#�J�lV`�
�I��/���%���*L�F˂��1C-��7 H�9I/]�$�5��흡<
�OW
-C��
��P��G
5=<}��o�j��m�T�=���ʢ�1e��GөraV�&��F3x�<�/�ز 7И�
�w��2�^���o���������g 'd��w��ͦΖ���i	��K���M�sz�
�	P��>Bs~d}P&�� ˃W�������h��G
�
^a6��j�`�X���������>
=�0��W�±�5v����by:e`(|�"�i��[
��D���*�
�*�+O�����ʲ����=
-�nzg7#�n�y
�̬��ݡ�8ʛ��k`����>��e�۴~t���7������QHw բ��e��6
���O���&�?!��%}���d�0���ҍ��$j���%Ӕ?>
gd���/o:syL4Sd�C���=��s1��Ir"��.
W�4��	9Jsا��N��W�8A
-�1Z�n%.gŎ]q�u�ú�-��Lk�l7h�:�c�����>Cꐾ���7v���'閳�mf���S]�C�r��
-�=�X�5YU�lP%	�������<��w���b>��_\��\(D�!��P���:r�]�!�#�9�c^��w#�ZOO\
s͹��'5��&Z��{����G���z�
-���Z�=�K��w��2�P
-v�x�XI����at~���O
+�FLX�{eS���"�v�Ɔ����[#��;����xD�L���u'���*��ʁ��@��t�fR�η�
)H
.�/�n�w��E�ư�FiT!*�߸+nYm�2�������
���
���~|��ϭP��)�i0'�q^XuO�~
-��t��xJC�1	��_E-2�)��aA$V35ݫ
�� ���Y,/�e׾g��ځr��,Q�H��S�����d�*����o�ℳ K���-M �����K?c��7
��/��2 ��y��]�Q�'|G�b㭏v��s�H��Ĝ���ƴ+
���z��3�=Le������W��2�%fޡۆԣ0�r�=��捸�^5����iҒo�OT�
�Tr-��<�.-�z�
���θCg>Z�����������p
\�-\��-�8+ at 0��
R(�t��'�@�* D
�w��������糉U��Q\z�W)E�շ���c
����v��8�x��c��֥UH	=[>��g'��+v����˵�a�8Tm�ښD� h����ɤK!5�[$r�R2�;
-ӎމ'{�H�锲|*}6���x�[�����X=]W�)�q��M��]
�O�b��L�9nT����d��S8T
-�<Q 
�CE���w9*"�?����H����Î�������g��B<?�U.�_����d��q�3ՌH��ͺY;��L� ;���� [�㒓�ѦCYʂ���.���m�ݲJ�����_,O�����z�Z�\���+��r��K���q�E�b��gtk�Hn��
u��� =�{B�|�P��@L���	<c���,,
-�떥��?�2a�cXV��Ć��
�|K����(�$r�����f���y>3�]1%�n�#d[�;��L?l��7�x��
-!I+K,#��䃵����M�������4�:_8w
��\fCLgjf��'���FZǼ�hj�
�{m��Wv�Y���J������/��R�$B�a�����S
�Y2R��bt�D�'%�r���ט�!U�*Fu�;T��z�з/0�=_u�k�R��
-�\��
��+=�Xi���XPt%�BRL���ۢ��u<uV*y�\1V�kc�hw~���tgv
�
h�s�{8�
-��ؠ�:*^c$�pultY\��㑧oI	]��v5�j֍K;%P�
:kt`�d\\PZ�z���8�!�
)ɰ��U6n4�P�����f�|[��K���w��
�����KWR~����%�?�9�t/�W�	]��p�ێ�F?�a���a{f�l￵��L.טQ9XtAfU��W��)��
t�4�`�,�G$8��6u�M�H�@"��U��P�C�G^.�
xw��C��3O��r�+;����37����z�Bly
�c'�"|)M
-�C2ӎYD�M���� PN
U~�f�OXU��j��
�;`�9���4a�fS���E���$��ޏ�D�X�;���~�)UC�V
�eu/q�v�F��h�{H	J���ꏻ3�����2���+%fu���Y��뉽�Tu���@�]�n��
-�'o�����v��>3�c�Eٛ������rP�
�u�E~^��mV�f6~��4��G���6!��E-P�ʩ�
-TH�
G�}�3?vL�d�u�z��?����� �XP7W�M
��A���^�ֳ΍̘ĭ�� �9K�F���(� ��۵�� �
���5����Mdž�j)J^E�d�]�, �TUbBw��6꼺s�
-c�B��������p��k{��GE��6�i}���۱��];��Z�%�O|<��	P��itߦyw�3����E���y�έ.Л�
LQ��P�Gq{Ԕ6��ŵD'�Q�廣�zw�3=�i���>%��@�V
!A�U��8GKԃ(�d
-���+�c3Xq^���A�ٟ�š�<꘍���=P���fתY��3ta�ڽ��:'�s�f�ֿF2wۜ�b�
�Jd+�m�.��x��x�'/��i�Ujͭ
�����lj�q�G�h��P!6/��|c[!�3�re7�O�x��[j�zU�Z7��
�R�H<���0
a��&Β$mA��S!.�͸�,V��7s^��FnX��4!w������!�bV�
W⤳?���u�s{*4�r05�Z�
�Y���-.I.��Ϫ�������~NY��ZTm����¹ѕ���$Y�>T>�9 ��Zie�1��>���hDG�w�%���9��͠R�$`pP�{�uD������G�\<\p�'C5u���Le?\[�Q�M�03�#���A�'��D��
-��(��0�.<Р^j f�r�\
-������X�,.��ADGΆ]��J�����l����Mp�L����<kwH]@���֩�T���u7��
���
��`d}y.ҏ��;�yP	�N�����=��O���93'��ki�4���;\$��=
Y��_CEX���wHE冂<'
'_���F���
-ݭ~���T&:
�3I�JT}�XR�dI���
�`~/�c�>���[
��
���SQw���FPc�"M��r�Oth����P�
V#�K���҇���)�
E@��@�
�����F'��1bv���v�l���#d���y��\Ʉ"�$.�M���r�� -�
}n
�K���9�����Ͱ�����/}3����Yͼň��w�!�qq5
�sK�v~X �{b
-傌���_�w;�� 
)!^�ّS��p��}le`vͪ�is��R{n�_(��˧/$G��H
\)B<���W��>�>�x�A�`�9԰�A����D��4��b��[@���

�C�Tf�5Xam�+s��B���fb
- �@Z�syt~x
B
g�٘j��DBzF�<{xs@��?�gI�ޕ�Qy��X�((
���B ��t���T���W�ɠ��!u��A�{(r[��u�(��>�Ÿ6��-q�Q�#�$�o���R�d��В�gH�-�2��q�Z"P��7��p��	��
{�6Iޞ�R��d���O�|�����>�1R��%��y���N���
��$:�I����}&2㉒�ͳU߇�Fq��o��"��
-U�Q�UlR6�P�?��e��)\Ϲ|4�'߃�d)���-R>�4=�&�c=O 
0
�8�1��Xle�*4W�t_��[d��tG���Sj�� ��
�}Z��<�b�.�� ��	��v�y3� j
�����rw�+;��m�+"z9��\Db��ԉ16�K����4ƍ��<]W��lmlg-4�L��

�h�����)

ZǺ:���!=;�0q� 5,��)4
Og0�3�ޣ)�'�џ�c������l�t��=��^�]Q��yb%:��i+��"�k<�w_E\�y���
S� �\[�ts��\o� �_��
�ճ��۝C�
^%�5�L�	�?���
ӕV��lK}����q�~YQÅ��r�FF S��G�<�
���o894^������K�"j�&�x��
�a
�k>Y�P
Nu�#$��e��mHj�f�#vNTx 
v�9�Cŀ�}O��d���6U	��_"M{�$T��J
9�g�� KPη��;d����&�ݐ�{Jɾ�D<�f�8*�
G�T}���
s~
�0�=3E%�@'Gd+)�V at a��-�z_� d�_۰��� f�.�]����q�K�\ڑ� [...]
D�)p����m�m�,	�Qg��+V�X�B��Ӫ�z�����&��X���Ur'�ؘN��I�tB��Ń
wS:�o������\�����>���V��c��
v
!V�p2:q9�Ex3<��j9%ʭgL+�@�Oe���ߖ�./�C� ��;l\������T��Co��P&�$4�
��E�
*2`��`t3������?��w�@���?�����^2L�{��-0K�*V\d�G�wW{�`��i�BL��i0�����F�/�~�s�R�
'�p<��,���H���,��g�\�+%k ����va�#�U�����<�w���
�4c׌X�y�Z
r �s��L��=6��<C����I2y:(* HƦ����d���'<J��
�GSq�k�xB��k~�n����y
$Sf��
��˼�d
"�k<m�jG����J�T��vޏX�����d�� ,v}S`J�2?�E�
��pR�ʐ�mkd��3�^$�f,9X0!' �qy'��`"�v��0�);���r&cT�8OwК��T�D��U���̀�h�b����
v���(�</K�=\�D����D��5�U�`68��
���z���^ЌF� �dvR-���
 \7aH8X�J=NF
�5k蟷	.a��R��o����h�vN�Τ�Xa�f�|�,��eϦ�z�Wd�Lc9�/��C�/�"e�
�K��L��9l�|0A���yȐ��2ä�_q�-�2���H�QuV�b+�Y������Pˊ��n'����׺$�c��%.m>:�<�B�E`�e-�#
�}�����m���ϩt�
hJ*��L{�i�,�� ����x0Xonw܊p�H"vj�5�e`���F��ܒ���]4�yA��.]Z
K7L>7�Ю���Gt݁.l���}���Ӥ˭@I���얗��y�>�ɲ��e6�����>L�m�KF�$�tYr��x�N�F:l��
-���Fv&m�:�,:N�aw�s���4�u��
O���j|i��ɭ�ֱ�[�j�����a|�#��[At�
f�@�N`t�]���L
��N�T���o�B
-̏�K���T'	�ս) ř@��٧z
��G��=�@Se����_	��y(I,�cib'>�$�+ĥ4s�uo�ta��6/��SѺ��!y��s*��.ߕ�
*�
Ѯv�My��� �E{y�s��M���o�%O�u
-��4I�
-�`�!�,ʏk^��❇c��~t!zPv%*��9T���RU������IH!
��w;�G�]:�8
ɗ\�R�39ƒ��*O��Z�-
f����x����,c��-p�~�7
�x����؎�<
�/-���a�d,Z��O�S�io�ʽ
�L,��ʙ�E$��s�5m�^^;�_wx	S|nS�zu��c���Fk�Ť~
�
�	&dHn����1%��O%
朱71�x$�e�`Q��^wl�PQ�]^��
b�ܗ���O#�bGb!
�Y���P�J^�
�����b���S�<v�|�
O>Eԑ(��<
-xD4,tY�� �=�7�t���k��'˔��
��@��[��{����__O����	�7W���S�k����R�;b�kG��JC���i:@ �[��B�����-�by�!`��7�з=��%�
u����sjʸ�#��Q��6��?���f<�Ie_Li
�9J��c\���`e���G�z�<~�

�YWo5�VNx)�r(y���W0|;[�)]�4�,ðų��Kڰ��?�w8_�&�I�o7�>�?ē6tGOM�

X��E$r���8
\=ŀY�/�c����*"Z�`
-��ӹ���Bܒ���u�E�&���uQ����t�̶
!��c~�ʮ��j$
�(���r݃kk��
p&��V�͉
-��Bf�4�-'~h��le[z���Fe��1c����:C��8|��TM\�u�
6
�zN�1G����=��Gz�\�$	����f�*�_����F<A�N���`�2(�:{�;�\	�I�V0�X���%
���)�%
Tb��z�K“\�W9��3'����2JAI�R����i6A�`�9+bv`Q�Xw�Iӎ�E��,�L
��kV\��2Oݗ4��Z�lz�fYz�7i��d�U�)a�S����6�#8d���p���v�]Nz*V��9:�q

�c���DŽq����-"{�X��Е���&n�7 at 7�c&]���u��"
�"�O�����W	2w�1#��y�Մҥ8�������~�g�x$S�΁�td�w��i����f;�
t:�THw�M�����0P�X�P������:��B=�ȺP�)LC��p鵟cᓽ!�e�����)0"=*�������A�1ˋ�.W�5����E��Ϣg����cE��E�Jen�e��I6C=Ti�(�	m9*�h	
�d
��+��t��c#5vmo���%��?�jjJ{篻� '
-�#hc-J=[�A�iէ
2������˾X��1p�;�F暈6�]���
�oxg0x��(D�[��IIc��-
Y�(���E�c/W�6�OH��䪺W��G��G��4����� K��R�e���J��5|c���_i)���(+�Q�,��HL��y4#�"�fA��Y���_/�fZ��9D�|6���녡kG�]&�Sͫ5�
�(IX�Dž����K0x�Q
-����e���H�{�Z
f�M�i��L���$��Y�e��B�h��-z���������d��U����u�!R����C�@?*����������n[�
6y���ɶ�睨�X	Z���<�7�0:�yi���J
�>
�S�V�Ѹ�	]�������u��,���,|`�S#q3��BUg�"�1tn��?
-���W�M84i:7
��Cƅ�Rm$�����<���"�˜��˜u�y�l�I#��%XVR�~��CM�q��GF�5����k�b�6I*�/�ň�G�[���l'��s)2b�xb�R|k�v7o�����
%����*�þ;*#
��y��xN�֬��K_��.
7zd�^K��_�Q
��,6��o�M;��/k��!��K��f��
��܀�&���4$A�
��U��Y�f|����E֟���3���_��v�g��

�v�Z�����F~��6��~l��%L<X@��5?Q��C��^�S����H7�P�����{�`��%}��KU�!P*$g��i��U�fL8�C
Cp�rl+��r�¾/����\]�7�Mvd����L]��pZ��ۮ+ �_ ��q�K¾�.�Է7
K�,6��K
-��Eq�i��a�������P]���	Oùq����ߣ�0ZrJ�9��G	�(ֳ��vK:�����wbVٖ�j
����Y�)�
�d���VG
-��<��ٰ\'��ػK�d�Q$>G{m�,��`�`��j��l���}Zcf��Cd�}kԚzW������`ɡ�y����<R�b|4�-GQ�}t��.1㗾yF�?	-#>�(�9b ~T1�nuU?�c8����3���܌��Xx_�ѼH?��K�$��Y[(�2�:l� ��nt�vԒR|`��� �k��rRڪ���Ѯ?�

-�E�H��`�<ͦ;�X�dZ�d٨2��R�
�ӱ݀���,<�2Z����6��X�.���c���>��(��-�!�K�>�X�H~c��AFX	Y at d��	����T(�`a���Y�U/�%�"2u�|�eh!�
��А�B������a��J(����Bu����1K����$�	��f
\D��?)�R{g[��Jh��sk���e
�5
�|��Z���?�Vt��N�)�/G��IJO�Y"ш�r��0���54�+mš~ڼ๒
��Q)K�^�}��|4�6�w5��
.��kϾZe�,���(ѼP��nl�	9HQO����v��X
-�i>&S�jG�)��r��mOf�w���yi�
�g^^9����|��r��p_Y0����Z��&�f
�!n�Gk"�bkG�!��[�z�keI�]!�F�C�
-���<�|=����]��SzJ�1��de���B�xX���w$„1�ߒ�ف���_L��⏨�����P=���r�����z=e�ۗ9�{�:Ѕ���LƸ0�󲳈�&��s�>@��ʫD�y���#��1���Ǎ��h�9{0P������
- ��+
����늙i}�yq��>�y5)fJ�-�&�F�u�L�\����7LyI�p�K	����B���άɟ�-EF
ZT���
-?L ��ב�hz��Z�8,s��EuK:�^1���Kf5�u3Bht<��(F�D?8�:
���Tܶ�X�k���>�ޱ=�������=���Ʒq�����5\����
�[�Ћ�cf�
�v�����M��b�v$���='F/
˂�OA$��QDV�^=�P �vh�;X ��Hd���1��
-�܏��2������+����o�'�J�N�I�gO�(�p��A���;\�+�/�P]ޞ���0y1��sA1�V�
R�BX"/9�����=Jۉo� Y�L��q��>7
-��#�1�<$�]\H��
-+���y��M�2��H�X`�tg���$�N���{Y�ztN�4�]���J�n�2e�"���v�rs���\��G���
Ғ�4$
-�9N�?)~x{�g ]4�l/X
_���K�3XLX�^/�džWAg#[ L�ر�h�U�c��*Jغw�z�J�V�(x��L�oe����؜B���NJ�8+��
���ڳ��#5�i̴�A�h�����8�t�}}�2�Z���"p3��#�~/�Y#��*

�2�*v��X3�3
-Z28u5�na(��-p%�o��N���g�Mu
O#��v���6nyĊ�Tg�����⟯��M�Z:x�߲���"��
U��ޙ���6���
��,l�G��������>tc>�xv����ST�����J94�Wۥ9��
+Ɩ���l?��f,���
;��y�S�˯���Q�D���%o�-~2(eVpʼ3`s�ޡ�~R2������2Fݱ*�����]	��$>O�Z�;�dO*$&�=��Z0/�6E��q�ٺ2Zl�yq��˵4:6!�'�
{G�#0�k���
)4�h��]����\0��*ܻ-���
�a֥H��h4W��dV 9��
Y�/�F@�<’�ei��'p���g�^ݬTqW��X���Ӆ�ز��j�r
P+��)`����c���%��<YOj�	�0Zi��#����{WO��|��G#�:ܡ�
4s0�6>2�d
۽���S��r
����D������4����@	8��:ƛC�΁�m�[�WLP�.:�!�]�j��o���O�?��q�b�
��u���t��R�yg�X��׌�c�X
~���rNٍ��b^󻼞ܙ�e�?�3}6Oӎ�5�TeZW���3}P�٢��A�E��2�Y�XY�)�A�]s-a�����~�Z��\���{:-K���\@Wu)wﵬ���UB�z��5���S%a��	���/~�

"`�3�J���Eh�j�/��ѯP
nޝ�F"���vVӬn|"
-��g3�v�pb��72�G������T9w1���_���a����]��0bJ�W�>����%n�X�4�XE ��7n��x׼5��|�0*樶b�y���+(��&?U�M��=W݈]�
-�v��8��(�=�?��S;�4���	�^�P�H�����U��z��y��r�߶�#�CW٣j��Mp	4ZJ�趶R�'�}Ҳ�K���WE��1y��,������q��o�Ş���c�Gl۠��N�:ӳ�Ta3E�\d �+���鲯�F_��d���/�GCwEG��5
�Ɍ���A�6��K����U*Q�SN��s�P2�4�n2�
b�:
�/E���,�(n�~�ހ	��R�.y>)�k�^E���B�b�s�]2u����Iו��mUC�/�k,l[�+bt���Vg:��O�
0�|;��QT��|��k��
-���?�\t�V�4�0�
��	$�WE��m�,�G��Eu���$�_"?6;��M�3o�U�Ѩ��;�i~F
-���CJY��}����uż���	������E�e�M���x�}�5W?,�
{���'7�H<x�8�V��
�k��?0��a�e���ɂ�WQ�4��:��Z{+|/r}p
kҖ�����"��v���.�;�,���<�S��<GU�W��v��
��;j�?0V$X�����z
BM�>�/�/k����A�d
�0}���n��s����
��О�ܾ`<&�:����r`I�:�4ć�lVX�ͺ�6l-�|��K�G
-�`�6x��|�q䧆^�.���$��2��_�e�
tV�6� ��g
-�l�.�x����]�i0hо{?[>��y=(&,t{���rqP������

+j�i���
,��)�
��藐�(2�a��CE�}øaF9���@8�V-Atud�ơ�x�m��7��n�I3}(���%����Q��&[��io
#�
���<11��~��E
պU%�ܻ7]��H
w#]=З�,�x���t@�e�,�8�,����>'ݟHkMl��	�e.l���DĖA	DkA����Q�&�Do��x�:��#��|�
��^�Y�,�K_��!L��\
���v�Y��Q#jLdF8��nA9��yO򵹯ǟ6*2����`{2PY�~��=
-��������G��7
�^L����
�b�
��E�y��O5�(��%u��Dpe'Ҹ
�|�f��{�_B
�_� A�o	\�	G�D�
�g����kP�}³ʗ>e�$�?T-I�
-�Py�
�
F���L
/,Z.��!�bi��>Q�u:��܃^�۠�
�|�*����ܣ�K�2����m;�Ȓ)3I}�g79^���|�||R�M�B��W���ʺ���v�Y-�Ė �*E=Q�յ~E>�C5�ݾ/�琛����ӟ%
+�X�ę@��0L��f��#*|Z���N��-��S�	ҳ*��T��2�|�#���B����=H
-	��"������ ōzg*B�Р&�ܩ����L��Y���B�Hx\+�t��ď�
ѷ
y�,��kru�һ,B3�ӄ�8���
-�y
-�6��N��Q.r	�4�H�i��>
ԩM�y=t{�i
��[�
��2&��£4E���
�TxWR+	P����J�o��.I�6��������!�=V�F�o�&fKE^�&?���n!����<C�^��ct
+���g�&5��`t��.�@���峹�a�pN��E�"{"Im��QT��ə���%�戀u4\B��:E��^+d�3c�E��1��T�j��@e
-��r�DΣ7|�ӌ!+
,��!

p�q"��?� �d��=���;x \��M

�'��>b`절B(
Zvr��s�R�A������
{�J++�
w%��ye��
F��i*�X���RXc1f�JmkD,�
|QD�}�)l�ձ���`ď��y_�4M�>0�Z�]��><��g�e��THRګ��)��u�v&"��%g�"��\��b�x��;�\u�pI}�	7�X��X���D�,25�
�
��;l	 �j/t<����!S�m��ݛ�
��Y+37��
�ۢf�e�
u6��l��ֶ����^m����M]��T�l-�]$Y���m|znu�T|��)ʼZ����%oo�6�md�-�V�����ډ���2.������	Yz��>��Ŀ
����Ͻj��/�m_5�x����9�}=��`�X����c�{:({�{��k7
O�
#WK4E�z/�
:�Q��;�S�:��d�s`@cpu{忼����fE��kF�.F/��B"�c��39�x��
�
'�|O��h�"B������&��0>��Zh�}n�j���.
�5.���Ɠ$��v�o��_1|%�-�B-���v���\L�?�,/,-�%`
Q*դ^���^
-���o�h��F�Ѡ��)���E�ɏ�x���|��p��
~d�1<.y�ƙ��:
D�@Z1�B����$	d9S%��
���E���i��q���
j\�~������t
-�'y�K?U�u�h��Ұ>��!�
S)�L�<K����<Y�Hh�J�ͺ�9a4Ć$���<����ق
u�
-�ٓ���d������n_����V�������G�G`��;�r�����6^%���c*�M�_ï�=�Y�o��
0��l�t�'\�6H!Ȁ\�nB���:��<�X��6g�5<�Ny������
-7K8[Z��x�T\��O��G��L�
'<"&AǦ_��0��4
�ٰ��������-�
q<��@K�bK��-�轫�E
S�3S�@�
4�[>|n�W�z�F1�x@�_���� ����p��D�@���� ܊�o�D��'Oo������qQ�$�P����p6�$}Kb�⿀�N�ʒ�'뼖��
�L���f�<<-C��m&���ƻ&huٴ�M30q��-K@
?^'�P�-Fc���{�JEG��2�p/���`	��;ԙf?����uȷN at 9Ho
��h�2ȠI��%�eN��DN�"�ՠPk�����"���,��y�,��?VL�:�F
ߣ�yƼV���Y
�;�Uƫ����H�fI���
���#+��.%"��f�'B�B��`h2vy2���b�f��K��ۆ>6�
-���E���X��`1�
-6cW-C��H�ϼ�r���ߗ��W�Y�1=b����Xog%
-ƙ	D�
-�=#�Y���(_��5ǂ��t�q�h�� �L[\�\: z�x��

U���*5Ž
- N`nT}�Y�LO�s�2ڙ���9�`�|�U+Vw���V0��䩨|U�=D����ǖ
�
-i�"��@S�/=Tk���A0![�!ܸ�

��U�)�
-�R���<�Pz+Jvي���*�Nz�~C��;��%b�pѭ������Aa��.��,DJ`��	���O4���o�!���ٗ���;����Z����ޕMi��`P4Kb
g)|c[!m����,&
s�r��
,�fj�%����v;-Oڷ�N�# &��?Z%�\��Ч��]nX
��
-����I9���������
�� �m
���N��`�'ճ�ޢ��΢�z�m
�P�iL
�F�d�>�&�ݮ�y҃�Wec�-
-����fڐ��W��d�^ph�,��ӊ+zE���L�.�S�
ޮ����T��� �B1��$
�8��z��ޢ�`����|�3�_��b��r�.�1
�{��2�
x�e��W�K���Cr����a��%�'��N��J��/6� c�)�m�#�����p	.A�.jd
7�����DŅ���|(�-Q�;��l<�tۣ.��9R���<�V��pc��My�H�G�
d}g�v�)Ć�W�E)땱�Ҋ�F�_f�0>H��!*0�9�"S
e������*c�M���F� ��,&�q��}�EKv�]��+W�⭝�����Kq��=�p�
���xY. �
h}xl�����U

Ǽ�>����V���..
�E^��M��`���4�
�-	"Z�9
-��Xa�>	s��E�tـ�ޒy3�.Ӛ�\O
�~
�4�Ӿ�2����I�� �vD��7�`�}sv<t�!}��Mo��
�[}fx�����f��Vu|Ö�Ӓ�ZgM�8�K|?ye���SN���;�υ����|_��ddg�����c{�q�\O��0���C
�Íd�����y9C5�7�.+OO��t�����r@�_�`J�eG^/R3�
D 5
�p-�){̦I
�@Z
��N��n"��df�m�� ��7ʺ����9�6V�b����p�E��U�b�)��H詂y}�Wl��v��ub�����y��d Z6��>���؏P 
� �EP�7!�&k Ƅ7
��~�޼8	Q"��
��B<
-R귞t{�W��E��u_��:�I�!s�Q=��:Q=ˆ�d�AG����ŗ	
'�u�A���9
���.k�J�4g�v����%�r�f��5pvE���p��7oH�z9�`�k�F�=	*AZF
-�C��21q2�m�K�i��x���b���q�=
�u6
��6�-AM��#��"���.��
	�
�ҳ��ڜ��#����2M�x�BÌ
P+��8�F���"
զ��3�3}8>��6�.�/
�T]����K_�c?M_C��&)��*��b�\-u�|�	-cFh4& �Z
��-��r�V
-{���M]�p�Cn���U��";4��K}/X!�9[k�	�#�7�Qdσ�ު?J�5�D?��O,`Ta꒟��_��o��kͨML� ���߽xP�{�诤��;!���k+��8ԋ�*���T at t��ħ147�dYsg�����x4�[!I��5�������]Z��F͵7B�~(n`�FUy��'gT�Pƀ��F(�k��Z�(�C�������ś4|�,n��F�)�
�F$6Qع�b�dQ�B�
�W+�>⋧C����e���Q���!��nU�%ފQ�<��&�L�b����*Q,��V�>����
�OFWbiԌ�9)��ȴ��X����P.#y�Q ��R�����r.�n�4��-��N	
M��&��&��F�g���Z����k`��& ��]��O
vƷ���`����m��T���v�� ˕����`�ul��5{�IW�-���F�U덠������P8����џg�D��@ii�U�C�� (~b=w�VwݎJ�8)�V/�r:[��
-߰�L9gH�c'�q؍�m1\BM�H�d�@�вmD����Zxg,cM8����
3��뫶�DeFq�@v<6(2@j���
���7i䀱�K�@�q��O(y��P�C��.�ha
AN�
����WI��5��|\���
�Rjb�ʡ@�����kMj�zHՎ��h�������.�
-��������[3Bp��VÅW
s:��;ۑ�^���`�mk�6i} |
-uݝ�����2jY�X�}�Y�0�yC�K<��
�9��+HM�
޶_���K/�"���'�ې=��ž>


`�A�8�wE�����u�����?�@��-�
�9H*�>�
>AO��d��d�Xs;HOQ4��0��2�q�˳}-j�m�$n������2�
m��t-@)�C��?�~@��9A��Y%!o�j�Vd�
�����~��}8��́S4VZ�\��Q�.��qY��VI�c�r���E�5C$)��5�j�m�9-RyE2��<�^6#4��HzßU��h>��|ms:a���(���OU�F���
Y2T0�I�d AQ�
-��s�����$ss�&�b9;V�ݴք��0P�z��������c��
���S�x��01<�`�d��/%/*3��	��=��-�������a
-VN�O�ٿ�V�yu�� �B��˞vY�9���^\����S���L���P��V��G�߄�l
}κ+�+!J��A��l�5�$��T0����
ms��s
I
�쮘_��s�J��p�ϻo�͟@�Pu�+��>�ܱȃV!*����q��wx�Bh����" 4��y�3�
�v%�Zm���~��J�ܘx�3��$�񪨀�Kys�WX�2G�"cl��+~��4���p
 �X����sELc�����g	�
�G�NNť����T=��\�i�n��_U�S�s-Y�
Ÿ~鯇<,�P%BY��j��m�]1�kH��k�
�T
�
�кY��^���]{o�f�˯���#���Ԇi�߰���d"�������GC��H��JS1�82çzR"D����_�)���,3a�dgp�E|˝t� �{�+z���!>�����c�mCO�;O�QLNzj�X�eX�#�&P~
���iυ=�#6����S톎��Դ��Ud���}IȄ�.�ж�͹6
�wSO��Fɿ�;���v�/lL�$�qK7
-���'dD�L.5)��*��ZL�F����U�ˠ��vb���r�0�ԙ����E����
�
�}G�����o$j��D�I� C���"��
쇶�����f��}��7���
�O�ܲ�
�z#�~h�"�z�$Sp��3� ȹCS�t�un�-s�$ީ�K����VC�ZO�������I�b%��B��j�즯�/3�#�P{���/�H���
����F������
�*�xS;��ܝ���6�����Z9U��:t(��0n2.[J�{4������'�gj��t��F�g&m��42���J�4ۏ����C;����icf0d��99����n�	u.QЛ���.��
� �~�C���2�(ܵ�G��%����
�
�jG����L3��
�ô4@�+�Sx�t�7��;��>��g�ï�L�!��o��D�͆�’ 7^�c_��'�ϑ
�ߗ?�'�s�}9�
kc
E�۝s�+�*��~A'1^T�
-�Y�Ѩ`j���	.�vD��ڗ�l%\�炭R�iX:�;��U�2�8V��K+�
�3�����
V>��]8�8s9"��My�K0<��<c78B
�t�8Ǻ!��C���סhv�P���5�"p�[K�!Z��u��ioa����[�W���]֞!Gi��[�x�
�-�s�?;�q�	$r�`�x\��|ŵ�o����p"bi��"ws��b�Ļ~�M0�[
��`���M.)���W?�f��1RY��a�,ښ�֊�>�:^�=v\b��pʀc�M±䠃jP�I�H���#
�G=e����tvN�!�<�2G�W�s:|�
��
oƀ���~̳%m�{Q7��
-=��|�"k�e|Ӥu���(�����`�ˇ�
���s#�.1ڍ���5�@L9)���b�'@��qn�at1�LO,�R��$�%5v/4@�<JS�a&�N�O�8�2�O��f���Xkh0)AfY��
&�3�����}��c�
9��aL�޺1%FW/_�x1
-���#ei�!��d6����/6n����ˇ�N��� 6�
^G��;�1�db�7>I�3k?X�\�:����v�#��{��V޳�Gc����9�zbp�s&}��Ea
�/6�Zrp��숂��b��"Vu��;a/K��,�}�(��/}k���tp��
���L?vaPЖ��>�����_투�/|K̆�U��eR-&��f�Đ��b���4#�
z�4�o
��|Z�CNd����}��|w�>��z%�{����f]�=jOH�6X�:��bYua5 0ԩ!
�Q~g�z4���\jl��fA;y��J���7���6Q[W*
��ƻ���$�7��>!�� 	*6&^���
�LR8��$6��zE��$b�'�冲j<����]�&
ʱ��=�kU�m� ^+�W�Ma��5�~x�%�|�^���eI7eZ���J��-l����x_�
pwIZX�CJ�
-��C˦bn�������f��}T�|#@���-��GC�����ר!��t5Tu���]8�AجQ��PO�c=��*N��t����̴wى�%Ko��P�4����ӢƼ���x9ZJ��ԡ��lܘ!!s�>(�d���
�l��j�tЄ,+Cq~a�jY�e}�Ѐ%"��39y�Q�@#�hwm����k9�7�t�
�
l�x���1�;�s��%
�w��
s���cV+6	 �F�[Ky=��г�yi�����J��M�rq�=���1:�n�NTU5�U&�S;�*Y���B~1�<�If��)�}v�{�+
w��_M�O
%�Aخ�����|%s�5{ ]#��C;������2,�
�
�T�%S���8nF�s1u���X.a�I#����g�I�-��1V0+�B��τFJ{�-ʖ3`�%)�h'�UG����t�{��8�*�)��d� ��b�T���N!���h1pD��5��Ƕ�M;c
<�9�%��3$�<Q2P2����׶�x�3�ۋ�m
��y�p.v��]L��)�1�#3o�������Q�	�1q/�URqņ �8~X��C�Qb�.o�0�+v��3�9�_yI%1�[���4N]�
�I�
-endstream
-endobj
-20037 0 obj <<
-/Type /FontDescriptor
-/FontName /DODIPJ+NimbusRomNo9L-Regu
-/Flags 4
-/FontBBox [-168 -281 1000 924]
-/Ascent 678
-/CapHeight 651
-/Descent -216
-/ItalicAngle 0
-/StemV 85
-/XHeight 450
-/CharSet (/A/AE/B/C/D/E/Eacute/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/aacute/adieresis/agrave/ampersand/at/b/backslash/braceleft/braceright/bracketleft/bracketright/bullet/c/colon/comma/copyright/d/e/eacute/egrave/eight/emdash/endash/equal/exclam/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/quotedbl/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 20036 0 R
->> endobj
-20038 0 obj <<
-/Length1 1647
-/Length2 18029
-/Length3 0
-/Length 18888     
-/Filter /FlateDecode
->>
-stream
-xڬ�c�eݲ%����i�vVfVڶm۶�J۶+mVڶ���ӷo?���O�����f�#"�k��+�	�����:�1�3rd-l
]��ld��M�\$�
�1622Gg
;[Qgn���1@����
`���!���{8Z��;(Uըhhh������� =�,�l�\M���mLl��R�_;*�� ��M ��& 9y
I� ��*�&�&���w1��0H[��:�PL�
��^ ��l�-�)͉�/��� �dobd���������`o�hc����`�0s4�u�{�v 
[#k��k7��WB��vw�������99;9Z�;�F��w������v��
�L��4�3r���ai����N gw�b� �-��
<���Kf�h�4\�,l��3Z�����������_�������	�ߪ7�������ݿv��
,��L�M�a����4r������~��5�01��n�b������򟞡������������A���oH ������}"�7H��"����o��W���K��z��+�������������
4���� 
�g�X8�8F�W
k����ݭf���'���
B���BtLl�l�6[8�[���[8�L
��
޿�*��&���&E����ubd�/�������?j��2�5��5���_0��++�P��?L�m�����
�&��IM���-���sx�1�s�9�^ƿב�����'쿈��s-c��h��b�gdd������t�
������?}��l`k��������������+����.������ڲ�O�ezV�s
f�Ȥ��@�H�}i��B��^���
�J�����i�v��3��)�ñ>
k��T��<��B�?�
4��
����j�^׋��`�쌪���
-��%�ӝ,�P��T�$���h�O��Fi
q�]HM@(uEg��I'�OC�#ý����4�q�d<��)gD��
���F_�o�
.�n�^��.$���v"���������A���iN�k�M���#�"|$�0���L� �:�X���GDF��-)��nWu����TxoqJ��
I�;�|5uV�V
�uJ�
�,X�'a��?
�Ă��ɑ����چ���Ŷb	'����n'%�2��SP,���d(�	yo��O�Š5J�
�g���%��k�w�
�
�ӊh=���>�C�U�ޣ�
ϭL-5������"[�X���!�� WI��Ԃ�)
-��`j�175%��HK �/����
��z�3�6~��FL�ƙ��y�P(�
-<cj�4�x�x_��X��E�K`�_chQ�~Z�X��0^S��qˢ���Ѕ�uX�F�������jZ���h�9�|����5e��Wi�
��
�t����XYp�캝B@᧚Z�@G4K�'�����ʥQ�6��C�5}P>�+��x�
�'�(
2n�\8 ���+䆦��gP��V?4ԣ�L*
�=r����dV8�ڥ|�Z#�SĜ�
�T7Չ�6��Ȑ&�.rA�G?�kwsq�3�C�X�Z L��FW:UH-z��yT�
*�Jc�q������4
vdo�$���@C��0��0o��Q2�m`FPy�N���p�
��DB�y8�W��*
ldQ�b5��麚�:���G}M_m��y�0_
�45�;�w	 ��i�Vs~�8��l��z#�Vf��H	�!0���fs��Q0f��D
=3�
-	
l�.��#Ԇ0?X3��xc�r@�
v�4�곜!�)�Z� �iω!%�(3�t*�"�:|�?+�eu%Z�sm=�9Ǭ��й�Q��gS�_�O��~�K��Qmt3�:|�<�*�~Z���� ��*��L���T�i��a2"N�'c�W�u-�v�lm�/�Q9�䣮lm؞�#�����a�ĭ�SF��IuCؽ�8b��Gn54�y'���Ja�F�:3w"�s-N�O�
-����ѕ��=F$s�↿�8
�=�ˀ���'?��W]� Yfr2Y!#控gv�\�@�i��B�T���]>Vw����8+�Ս�x�
1�!>T#��)��쒝�W�0s��wcN����OD���
Q-q�J���[
rT��Ц���♍q�:_|Y�8Q'8{�Ջ��o���椗.C����7B�qH�۷��
��x6 �=p]��+�db��t�P���Q��lW%�G~��õץhn�p� 3�?��O�J*
��U��`,��ڔ������q�����SP� ��s�ړ�)����T.���Nڔ8�������.�v�`ʢHծ)jyM4���W����| �Q,ğ"�@b���s�����W��b��@\���ؔ��J ,�?5�I�,����ٚi�=U��5�ĕ�6
<F��&��y�����J5{�M��Q��9���vy��������r:QI�
9C"����B���v�l��,�h��
w���uD;��s$�T�4E�R�>�L�
�#�L

QQJf"-�8f;:���},kw8��
�n��`���؈m��K@�eR}�*Jl����)[�+b�0d�=6K� �]�l�&W�ٽA�?�+��#��<�k��W�XK�'ԟ��-�0�
�.�RTs�uL���`j���L
����Fw��-�G+�Y������5�>�?<�M7�7��ݭOwv����F�V��,��M�w $�+oQ��А�K�)j)�5c9�,"�Xs����?a��c����;��|�zN���I��XB��Co�%m��Z���!e�]uI̻��4�\jm�!�~(���!��H-�g�g�/J �	خ�(�@�Z�Vd��ﻍ�*���3�
W�~Gn�'���9�#�
�.��m@�1-rc<�Q����r4(0k�r� e0�$�n�H�]p	V��q3���v���qd_�#���0�P�ӧW��E0u.�R���Յ�[j�+���3a��]���� �J����?�[��(����=�=%�Bq����3`����e [...]
-�s�N����./�+�T��X'�;q�P���l�C��
��\�%ӎ�]*��L3��/c��UK#ZxX�-��,�s��UT�h��W�jY��x��}��Jy��1n�r#5y(O�<�eqj��i���Yn.���+J�Ǔ��f}��k�1�I{�W�<��Jݞ�I,;{���r��w(��]�[�金��0|:��8"�{��k��縸 �IHݠ�;R;C9
b
l�B9�r���
-ގ�5�&��{�������G�P��ګr��8�s#[�����v��Q��bhR��ի�NК�F�<Y�+�vS�n��m3?Zb��%J_�€ve���1>��BE�|skk�x�Ilk��A�F��&� ���)��g�܆z�Y�H����~�ubX^x�Y�DGW�� N��6���r��B����
l#հ�.� �m���I�!R�[8�/����_�[s�t��mT���R[F���Q���>nS�]i���O��La�y�U�
���t��e�t-G"
�&�$K�Z�qWR�Ϩ~&[�hi����-��� b_��H�Ðv���P��g�L犁a��pTj���=7)�hW�KL^���Ģ���ZiX�D��3��g����
��;��V�D���LR��e�B՞^��*��Z��+GH�"�1Y�]\+/	�
���o�L쯉s�3Ϯ[Ѓ)K5u�w������O��w�(r�t�B���	�F�`�i�\���N,,��|Q��%
�թ��V)�Ja��&��,�⽣�#�\{�gNUҬ���1����h������
��x��ڐ#0Wpԯ
<��@�	2m�H~�9�znq���j�o�=8Kҋ���.4H߾�%�
i�91��b��Tpi��.:�RΩ, �!n�ģЫf�I�Hx�:qm�(�|	��/f�W�
��p�E�Kt?�����f#��
�ڃ؎�:��o$�QV�����פ����f�T,�a�����d at o�e~@G"ӆ/
�25]���e�iъ{�8?�YG�
\g��p��*��@�G־�Wh���m
��I���iA��.�L��Tu��ힲ@���l�vЖ�����E��r�3n)�K������m���?#�\|5�6��	L�>�i�r�
uľ/;�D/���#�"����-��!���K�����A��y
C�jvk5�H�W�a�. at Y^\ԇ�cx>ٌ��>��*�`��5����B!OPkh at 4#�/V��u��h��]_���c5�cՄ>�v\�5ia��\iK
�N<C��1�9qP�\7T)�\��C7[9w$m���FM��\���ǫ�H-�����f�f;T�Cs����z0H?
v�m�~k���
-��,|��W4�
͵�
R���5��v�5���&tϽ�����S�.���UFiF��1"KP����Sw��$�
`5�_�?�j�"�~�q]'��@�:m��={%�|$�
-�J9�T�M��	�},���K

�xEh_�9z����-���Jt
����k��A�&>W2נ.��}z� ޶�Xg�3�V�OB'/$�����6	ה���6���tLw`Hb�G�X
���i;��>Qb��a!W���f�K�I�p��iЄ��w�wN_�2����
�[-���
-��6�'͔����0���m�+���lH������1
w�ث~�p㦽��#�ی��<�ь��8+O���4�
-��Ψ��`�&T�:���������;-��"}Ceɽ�.��A><D�2d�ʟ�}1	H��ǡ+T2n#��B�PH���I�){��HJԑ�@�9f�[�Tƺ��	ŸcidW�ݙ=��������C9 .O��㐞�
-]����
-�
�R�����}������Ʉ����0��$"9�&��
-��B&ҟ�aC}{��#�q'n�18�𪭜�C�s���3������皐�b�;�H⍒]���<��~�4��[8F����
�̱�ʊqRf�ȩ���1^���4s��&ᅬAi�[���)oH��ה�,���{���Z5,!��9;�{j�T��3���wuʟ��	��G��s���$�

G3�

-Wl�5hܼr9KVty��nr}�9����X��b
k��Y H+X���d�K�$�H��.o�e�8�
h� �H�ߤ�-c���M��S���8W��]n��掼�69?
���Tߟmr��CUn��z�
-^l��ΙJ��3�rv
`�`���v��򓬼��7�@��փ����3�Ř_vٚ]����" Q�O��y�V-p����
��ie�,)��}�L���4�iٽ���J��E(
6����r�05R���W��[VE�W�
�f���{$F����Q
���(3�xs����ߐb-Ro
��/����
2��
jA硼7�%���B�(�6a���h
5��.
-��N@�ګ�h�z��Ó��������9e�����c��A}NU�ǾRx��g�����HP�N}�p�
���5?�)sϴ��@�Ϻ��JRFK�*c؃y���w�/�욲�STZX��Ӈjw$�Qe���BT(2�=eO0Wm�|��N�T2Z��@;ѱ{�
-�g
��33�:*��}F���p����
��}�E�+
}�A� �!�`R^t]�w�c�91!��2q�+���P='0��GO?�"�Fqd�[��2���,?�Xy�~��0��8l��7//�7�Ed�ĺ��e)ad3ɽU��N�\
�r,{�p
�(��%�7�H
-��V
- wv�%��W󨂦z~� ]R�]�1��,�2�J��3�R
u�����K�B[�L�8
-�j��c:h�rM��ݑ���l�.+*� ��B*����f?��vj$�i�i�6�j�l6[��]�os����/��N�U1���:�{‡
�.�+齷۩spX�vk�������ii*^%H�vC�cd����3wemE���?�KU��ew���3;����%�����|˄Ү]9�uc��赊=����@t�T�O0���d���w�P���;�Y
���0��d�e�`�O����Y��Bz��<���Cr��FY��]�ͤ�`.���2lϮz����g7Ft5�
�f��!���|���'�5T�Bꂇ|�	�E��"���Q	�U����*���H��o�;]�0��i�;I,�4�|q���(W3�o8���Q]>�O2J
F�� ��+q��g^�O|�aa��)���{a+��:}Χ
�;��+�!'�b����^����)��!�!�k����>�
��E�iU��
�5��.�T����@���ީ'�e�)��Nb�Ac�up�<���C��?Y���s 3���u��.�
-�1h�w[�<<�,�����EA2iK���
%�!:
�a���2�:��>
 &���hП���j��`��a�5�ȝJ`��m�^��)V�R�(�Ҿ�P���M��f~ �{��1���y{It�
�QZ*jH���n�4w�澳+=�N�UA�4���̀Q����Fn���t.\iRE)�'wP��[��Yu�䆋f�Œp
@�&M<�Y�]�rG2ػ ��@d�γW����j��EF��<�w��yV��D��/^T�ns��x�<
���ZTVaq%�Q�q4i%
U����a�xb{-ט��,'������u�NdT�-��-@�.�;�$�k O�=������$�ب���ZU��_ĉ�+�I���R��s��Ƶ�j�p=D�5�xM�GȖ[��;/�岌�g�Q�l�<xq3ZC��s�����
�
-mR���\ ��N8�_:�4�Y
ƍ  u���N/�&VD�w�‪�ȏ�d��`��M�=����~�F⃃2��0������Shpz�tF,T��H�9����1�*�(����`BZ���@-��z^�b�
����5�"P{�#2E
y7�F����W�N��(P��m*�U��<x#MXI_���>|j&���vӶ�����B�B��L�y`.hNtDl
G_�%�T�ˡs��Ν�ڱ.����ļ:(a|��3��/�c{�B��������b*��բ����"�{�)
��;I�|���k�S�
-��}>`��B+
,���9Γ
-�m�
�(ŽB�y�$�%�7�wz4�
t�l�X!w�<�	NTsR���GI0c"
��:�5���ɝ�H/��́
N>֧n�3��_�Pԛ6N� �vu���]�t��#�
-�M
8��%k?���Cvb��̓�Ź�Ɋ_4ߔ����z�ib"�U����i�=��<[1�i=��	Oz�4���8��^#�y�����&�5�3w��c7M`���}�PRa���\�W����
�~M|Աk��7�?~9���óm�)H[�^K��
�7�“��OF(�)����� F�Y�'�D���@��T�+L�
ai���)$���H-��r��
9rp��^��
���@�>�޶@")���<�7U��[p�h�@c�~�,�ޣ?�Q8���&��sc��Tr���mq^
j�[�N5��ث�ڍ�%·;{�o$�����
�\��N��\��");���t�lE�X*�3I
~w3
�D�[0�ם��!�I�l���!��ZN��
%A�!
-��"F#����A�����B	f����
D�
@��lV�����䋻0�)`�t�jg�J�=,�u��.ǭ�JY��(��]�T������������h3�~F��!��8��j8Ш��uK����6�H���P���<J�m��:�?6U}�zk0���#"�C�i�eoa+���&���XpU�|��W!`�٭�P(vt�'�
�|�!��&
-̒J���U!�P�a�TjS���̨�p����
o�{���iA
��C��
p�ޟ��8�T���_����fq�+��8�R3"��z�'��7MSi>���gTb�9���2���֞��W��0m)�Pj�t�a�L����TA�f�&<������� ��G�ں�~�L�S:n��O��|�˟�<w>T��WB�gW�h<4�Ԗz�+i"ٌ����z;ӥ���e�)aޣEc�����_W��[��r��J1
-��Vѯ2�^+&WY�n4��
����#ix�%��^�1���{҅���"�Y��v-N�
�F!R���[��ڈ���?W�ҐN�
΂��Z:AH�U��T�;x�=l��"���b
�-��sL
F"���w���/�!�gD�����d�<�[����
���p�fq͓��������7���.zza�
����^�*��v�`:�R��r�y��^�ݡ~����`S[�%��wQ�R�&�������o�y����Y��X�D�_�a
��>�1�
��&lr�)#�%�7�.`�
{�8�@��*b�,���t���Z]��I_ڂQ�H��h�
Q�g
��>�~"Y_VgX<
�,�
|P�"�ߑ����@:]�Q�F�`�W��Zp��QoWéG�N*X.�WJo��J.����I~�ތ�2�O.�*�DD+�8����sŒ�c�.����_�"X�&4t0�
���Qּ���
s �
-F���/<l�6�e����hMv0�X�����pJԤ�h/���@�3|뽊�y�p�����{l��тm �+u�!U�R�6�_
O|BKA��vUA���<]�j��y�$�C��=Y��C�7,&���R��j-��
*�i��W
QǼ@�q:f���%�n�4R��5�u
�$�X��c6h��R������
K����襽5��#{�/��~R��pP ��\�+�O@�a��w�
,�I
�.�EMeɯ-ø05U�|9�\x�$m���_2>��vń.i��$f���.���D|������[��
��BU��2�������\a��}�������z�p
�}&`�Mtع�;n����(��?P�M}��,4��5�3�	Qm},DG0���Ւ.�D��k��_Ej�
Y�`#�S��
�����
-�����Әȓ��w����S,���\�売�d�
�,�Ӄ
S��:�@��1Ͼm.N݀���~[����R�*�Iz��S��?@��3�'mf�c*DjԞ@�%'
�� �r��Y��I���3(N	�}z?���(e�\�ٙsF?�a+F�@0\���J�7�
����Cz���|�W�e�����eص���TDä
}� ���n�WN��ݾ-��������T������R
��=*`�m^����rQY��6TB��
іt��>�<rl�ٮ&V�p�Mf2ʜ�'H���v~k��rG�1M>R��L
���8)+���9��
(3FU����O��>��ʛ�_e>0>�2��kw��f�5_
�8zy�Ѿ�����vK���z�z��HO�o� ��5�}�Z�z�v} \7��x�
-![2���@Ћ�Y��r�K�|���[@��V�?su��O����a�j����r�Ћ��{�+v{�.�����
|h�<h�-;�klg9P����tI�u�Rʩ��T�4e��OM�Rcǁ�����f�T��#�� �(
m��8
-`Զ��{#��rjD"u��Y�	Ѩ�;
-�4�g�k
ޏ����_5�
-{��#O�
�UM�rr
-��z;wԴ_}Pl1,���H�ċ3'�W�0�V �
k	̟k��K��PF}6�1j�*��X��\$�e6x��0�8>�מ2t�����D}���߾V��U��K
����O@��+��]
���w�g�R�g�Mggq���B�O�/��q��j��6���g���l泿ԥ
ɡ�8:��������Eg��RP�-w/.�K����V����ʽ�S�M�땊��ҡ���M��jG6��M��z�/�u�ʡJ�\�ݍ�5P�Aw�cI=e�XWD+b�a܄@j�M�����4-Br��D�o!��0p꼷�
ܱ)�z)��j!���[�DlO��!��!-Fy�^��1py7?�]�
�)�'�
-��8��4qm�
Y"c]rߴ��AE�F#�Ə�R�[�lŜt����Wdvz������&����zI�[/�Q���8�~�'��.�
e�eD��]��w�ʋ^BsX\Q���G�hMK[Ѯ\�H����h�!�gv�

Q����&
v_l��lɭ
'Ƹ�޴�9���@�R��Lt�tT�ikI�s��N�u�v����cB�
���<t���G�b�
-�jPY?g(�$Y�C��
nc�u�zP���/Gd��H���� ���Ngo�ӆ��j3
�2̈́�4�hx�G���;��8T�p����.l2ܐ�(��)�2��N����"�o�T)`�lu�HӀ2�H�sdk�8�}�
epq0��9�"?b53�������f?���z�����	���#��K^�R��
Z
�M�:�b�l��k�˂y"�id{9ww��<A��z�S����x��0r˰�xyU��Ͱ)�:
i�+ZG�L
�@�����ʎ�!����;MU!� ګ�T�;��ڭ5�_ԭ�?���%�+�]�5�ιL���.�
Ns䓊�4��& ,�4�vEp�����ɠ�zܶZ
fZE٤{�ΕՠWd
-�O�Ngȉ�o@�*e��n�N��̄����V�|5�#,�G	�/+,�%�P�u�t�c�E��]pDV� �Z�%�!p�?b�6
;t���F�	��v�
���w騫Jo&���0�Ҏ[?�I�[ɀ#җ��3��x;JЩ-.ܫ��Z�
d�:`Q�h�zH�~�̲��
-m�ٷ0��Z�1�I�w$�UUMd��!�ՆPm��c�?�����;�P+������
<w�N�����Cɂ��*�������0��VI[�
���Z���@�d
^4a#��lY
]W	��J�q͗5��C��;j��2\�-�#�O����h� L����V��d�ޗ�����?���C�B5�j�����7řO`�z+�)��$�x\E���W-�v)aڊ��Ub����2��Ͽ��ʏE�itf� ��|\a��̕P�x6��<bH#hF2
nوS資��L�BA���/�\?�j�Əy�0�Ԣ#6yNYFR��Dh|�w�R ?ФHנ�2!�����I���
c�`��ouh���M��f��>Si|������K}�<�{J�4Q�
����_
��R��A��zo0]!o�]r���3�W=]��$= ,��o͝�%� i")�
Ex�2?(d�d"zN��nzC@�z�S�=R3�wL����ȭ̑H������/I����;��F�h����[�[�h˅���99u��X�s�4�����rV��S|&t�aj�&�Uf
m)�K7"
�����De>���yǸ�ph�eN@ܑ��o�(!l�69��	|7cJ��~హ�K�\?`�qtԴ�5��b$����L��-�Ϥ�k�^&��\5�U��H:
�ơ0��Db�^
�Vh}�4~�{�
���;��"^i$™UזJ�
ړ�?�;)��?�Ԙ�����$�	�z�q���>+���	�C�қ��
�_zj�1�#{�����HN&���`����]i��
��)��M��+��{J�B[�b����w�iہ
�
-��2i
ZP��w���6�1T->A�wÜ"8��1�~���͒9�tD�0mWn± [�FC�A}�k4D��'��W5�����F����E3���p��-ARW@�?o�nO��b�id���I���<؏��tPX���id7�/��A�[���Y�A�7L���:�2�=�D��
!��;,|I0oeT�dD~KA�3
f:�7�h��dz|}�U����k��J���B^��6�,��M#���A�-���r��|9ލ	k1�ǘn at l޸=�LI	2�]w���?�wc��D�R�B@�
��cAi���d
-;�KWj�W��81F�Fr�����F�R6����5��$�x�/�m�sׄ:N�+����m]�N-�13�
�r_3�5�e�� B�n}�S�̻t�Q����s�
�==�t���݈�Hƃ/�'��*?R���
�}�x�M
�	���]�4ڗ)��|�i�i�,\��_�]3��`v
XY֧�m����Z��
>Rq��\��t.y8V�X��[��!]���n�g��ˠ(���oc����b�< �Mh?=�����hvY�(�*!�쁓a��v�yp��ϼá��$��e�
��DV�FCt�2�
��5q�m�F�#��ص�#v�-WLv+.��8���xPk�r����)"����ca��g�h����$�z�i���U�Ǚ��C�uE^xZ��JgǬ����-�H������k�`��4��kMY*�M#?W��/
����Ά(�\QRϽ���P���z��sϗ
-���p	�l,�
�JWWy��F�d'<�w�@��_	��(��e������)v>�EJAqM?�,u$�H���#�)C�5
���<{
gɦ����|�7�޶�
;R8�&�< �;=�a
Լ z������B������ :	�4)!�F��%?�%��ަkM��iL.��Z6��q����̪��s���@����fT��o���%)sŁ�������=�
!��I���o�z5U57�����K����j7��Vx����~�T"a�J��
e��Qr'���49ю���#�z�X��.��Z0�/
s�>g������O]j��i\
�G�;��H�r��|�G����$�I,�\��UpR�m�n��tiîA�Ka�&��qK|Jm���a�uC���s��#��YY�
X�j,�B�J��
-ʷmW�(�֪5�h������wT�:����V�Ō\zا�#�`��x��L��H�_yJ 	�U��
��x�1�oaD��
%* ��K�P�q��R�՘cn�<�:�6�r$�ܓz����,\�d£����E�s�{��o��P��
�I\Ɖk��h|��:��%��E�9�D
�\�_���d{�w
�fI�	")l�t�
-[�-�{���kT��V��|�C��3$��$W�C�V�F+�X��
�ךK])��,����U�����3E�����D
-��l>Ge�q�s�MXK
-�qb<��z�Kp�
-���
-�ި�h2����E"�b���
T���Ǝ2�A�O�����d���V�������/‚�9������S���/B
�ѽL�$� +�y���ރR\����2
-d�g�D�<�t��
ͥH����]{J�7A��C�AB8�Ա��8m$r�N�ͳ�l��Кs��C����
-Q!B�Wk�F�6�
�%�����Oi롨K��_�Ξ�$_��b|
-��_X�h�pM#;"
�՟vCw��oð�P�y�Lz
��c�j� `���

���4����a��2>�=�7�B��F/���ib�9E|�.�0�8
4��bԆ�9],�����:�Ny� &W⭿��^�dWbP4��~:�mzΝ���$e�i��!�a���"�WihN4c�d���9.s��U�,E�j���>Ĉ�\,S�b�g
g/��d0� �'~6Oa�[���!�i�r���h^�$v;�τ`L�_|��,��W�]�8�Ǝ�Z�m���=����e/Bv�K"'�n��`V:�ܷ<]�V���a�#e�V������r�q�2Vv<�~O�l<��d+����t*�D�-@�D�H!aj̶歛e{��H�Q�]�,t����	��;97D��نd�D�����Rۄ-�~X�9��da�X
�ΰS�i�����{
-}�x�C�J��¬蜏#
��[Nv͚�,��ct囌37]å�ҫ1
-��!�"�8[��x��y�}Do0� h^�!��ޚ���
��bK�o��4JL���k����ڗ!;a�v���&0���M����t��/��È"�Z�^5
��
<�����Ƀ�	[

)rذ�eݸ�'��x�w
+�
-a l��%l,�������x1P���ke���k�5a ?)�j
-�M�[��k�H>
�߯� q���ږ����_,��v�����R�NY�
RM��S��Qlc�P/n̾<B^�[tM��	���L���d&y�\N�V�6m���|�!U�7���X��	��d����w���.Le4VXw� �npU����$��iF���	�A V<���`��V�w���:ϼY
0�Ii�����	�]5��+��_��M�!����l �
�(U�V��
	&�)�]
-�Od '�`p\+���Zo�r�����ٿ���v�mL���*4jM�nf��GWw��f�ub��Y���r.c��ƍ§Q��܇��
H�C�����clԝ
��p�QP�bRbCINt@?c�^s ij���m�9�i�X`�`E8h�����V%	C
�u�հ���	a��.D+E�J᎙��ݨ���	?n]������h*��Jx�
�\M\�gx�
�
.>��->�DңmҲ����Y
���5ԩ͉x�lE���&�� ����^�7d���*��)`����6�]����.A�.��F�
q��'
"P��D�s|�c|���h�P(���to^Gz�	�1��)E"0�1��N��S�>�x<�!�#
P��ꍻnOI��
V��"uj6a�3��ԋnGN�x�b3+VV�դO�q �����y�{p�6}[��ݿ�����4#�����t��a�@׊�-bƒ��ˑ�JK
�F젻

a��� �>ė�1���:�����r�=Q��+���7�ږ���TT/1�n8���, c
ч��:����v�ۖ�Ji���>���T
�uһS���QȜZj�-;Nh��������g;H�};n4 ���Ь1��d���<��>]�a�mM
-�D
(�-{vk��M�����,���U�{s��
M��C;�\��Ɵg'�S���>k�x�9���q���۫���X/���`3�gl�X ݬ�>l���qe��j���q/�����F1����G|B@#�5���le�,<>��N�'��O��~]_3#)���/������O��I�dW�%mw�R��&�eM�⏵�B2��י&9U�it�@�"1�\k{a9��c2��<�U�����i��
,Uz���
�3ܥ9��bS+�	�ش�&{s��x��8��QĐ
-�_�Z�x����
�ލ�e�ɣ��j`/�4�M�׼P�2U�<�*��D���<a�RX�?�e��K���[�$���n���3F����dD�<UC��o�H�gD�	���JG�,T�46�����M��
�y�2�Jm�g&
�<���/��6��烑\c��G1~���ng����>1�
lߨC�*��;M� [��Tw���Y%�J�T�/���fpʻ4�^7�K�����
(������#Us��߬�e@�ב��"�����^>t�8��
-�E�){�ۃ�=ȹ��ӂr^E�l�:K4�α��*	�����A�ۗ�O���1�����8K���T
M����O`G@�~�}�:[U
�j��PTf
-f��IkP1��*�wfؘ��jK��D�e�/�a�(�,
�=+u��%=�w!ٷk��*?�f4;K�ɋ��7�n$w��o
S�1j����\�$aւ�2t�:O��h�9RM�Gμ �T��c%
�<�Jw�&s��]-s���R��vZD��^�b�G,���
U��u ��jO}4ƨ>�V�Go+��B�����ڲ�4n���jXä���
n �QZ��:
DG
 �h"�Lk�i��T!lS�H\IƟ���
�2���')����A�pRmrx_0�cxu�A�"K��
k�A��٥�B�+��qZkWǂ�= �/C5�<�������ԡ����c�K�0��#�s�[�I ��vc��1��3~� }�	�5�4��Q����f��C� >��
�k����)�]�ӟ��+B�T\/��Q9׋�ʁ��`Uż��)�����~s��ۥّ���6Xz-̠�3���4/����!�ϕ
O��]�hj���}2���؃�}�
�����:>�R���nn�*>�����D:Dy�6(0̂2lm5^b z݇�~@�n�ρY_��d�y�
��o9D�6}{�0YY�#�����#u��C�q�q`�];%j�&�������[c8l��ȁ���f�<�^
FmOj�V��cK.�*3��0��n�uP}�j��>�Ր���G�Q�L�px�sg3�V�`��
���+c*�r��
Z?��}w�$V�-b%��a�8���B��(]�
-���j�<�k.��Pk�^�LU��#�LC�Vb�א%4�����߉/�ˈ�9�L^��?!��S��]7bR�P=��~��@�Җw3O
ϴ}�2n���v��[:R�
��ܘ5D���I��
����ș_�ϒlbT��'�
k�Y\�%��Y`݈{d�(�~�%��ƀ�~�|Ɂ�).�?�}�z��(��k&Ow��m��$R�_��k�Yz�Q8��g�!�C,ːrV�4i��v80����;�1ߍ��%2��Kܖ��w$e��u�Y��~�2��|
�jȴiYqo���#$h&B|��[O�;^
6kw�Ob��vJUP��҃��A�p�'y=�W��@��Ս���
���w���|�| ������@��Q"��E۲��Tb�o3��M
dKr��
龄pu�+/����۔y��I���Gz������?t��C��ś{bA��-��V�����ڰ��{t��G(��v�� k�Yt|�8�6��%K�O�t�
X���
��+l

==�HK��+�� $�-:�0�
�@�V��c�����Yo�B�麗)�K��z�+S�3��l�V�‘�<
-nN�6i����}�!7�ָfm
��o���nD�v���2:A2��g�	���?���}��AA�QhZ��ڣ�|`��� KeA�](���Q�ϐ����AF��d/�$%q�m%g�F��"��.����O��P�3��Ľ�up�ٸJ-Q3�щ�i9�8;��7O|>k�1_$�$��DQ�$��H`�:F0�@�*ѡ��Bf~y�+&��|�
�uT
���Zh
-���a�D\4�eMBMşq��mRc̫
�U�I��b�KiU���"���D�/�]tD�ў�)��狏�����,�R
 �P�
"�÷���S���ǚ�X��ҹ:�ul,��9$(�76�`�(8���W[ӽ$`��
��9(>�N����ˋ����f�˺N	ym�����P(U(��h?�{٦ >��,-����Ǵ6~�y}��o�q�� BM�Ma�6��5��T�	��G����L�AO��
- �$�o��ퟂ��tg���p�:��u.�F��8<�-�l�|&��qn� �a4���Ν�A��22#&=_;3p�|��`�����Z�S�a�1�6uA6<��:?A[�
�Xw�`��q-=�UD v� }ʟъ��h��0
-)+gZ�-���?I�t�8�:j,��ΡiB�B��'*z
�Ѝ��0L���wJ�m��n96C�y��ݱµ�4�΅��V���6S�MN-��N�
�����"vN]�dw�aB�rlM�_L����ʐ
����Js��M	�>�Ɯ��Z���
e��]��y�S�B#Jy�Ε]��A�;Ӯ�K��W0����n
�Q_�zX4O�{����VB�=�q�+�=�Uy�k�\��L<�
-��,a���m
��-�^���9e��2��-0hK�B�-P�W�M�|O�P! �d^ip��F"-+ͺ�
��rQh�%q^y W���7�Bd���
����k�w�J��
'
��t�6�-���tC�����\l�p��U���
-��+��=��_��C�H�
-q��
�G+.�B>�2�
�i�
�#V�6��g�(��Ѓ	�Y�u`.uh�.j:���ƫ5���8��j at lL��z�2����-������
ƶ��bP�{[�
�_�͊�U!�ӟ_|�7��-c�H���vg?6~�4B��Zs}�QT�l׫���.(��m8���'��eB#7
)k��,��%�
q�Ȥ
�s3w�
�~8���1W���N
D
|lp𚧝Kv�_�
>I���΀��O����4z��#ǢZ2�B�����B��i��(�E������
-̈́N3g�Mkf���J�5t	���oT�m�4e��:璣�_J{��kG��ڐ��ʸ
�v��$2��Ί�
�(K
 ����(�L��c��g��׌��j=�0/侮��\�rt�:����������]�ӭ����
-<:�+#zg\f� ��s��If�
���e�+fc4������G�V�7k�?5���T=Ӕ�檾�F�B�xI�*{=<L��ؽ�	��:�r������'
Ui�
\�����oNQ��>fޕW�bU�J�<���z��������b����2�F�1�º�#
;,*@�eY��ӹZ�}-�qu�����=�Ɂ�J�A�.]a�y���B4�Ŀ�[�-����
ʽ�>>-@
J�K0������an7��_d��˼�ܤ�ۼ���˒�.gV���%��h�0�\@����
-Jg�g�Z�y
��N�?f�|����L
�lf��:�CȢ��
���;o���OJM�!���TX�Խz"���~�5A���wfp+���,��i3s9�B�6$ʗ�,�(KF��Q�k<�2����)'� ˱�]��UW�	`�N�yO#�B\'��T3e��}M/ N���2��r	�0˻��_,�
-��_�
�Ə��8
nF��h�L���$���aߍ7=�ZQN�8;
|�x}T�	ȸ�)0��X�<�����j,dq_o{�]@x_���
�ϥ$ȳt��jC���O��iԨ��7}�6f�΄{��Y.A��ET��/�`a�,S�^O$F~�QP3,3Xd�/Զ��M|�W>/�
v_���Q'*�����\NX*�"�$Gf������*���
-endstream
-endobj
-20039 0 obj <<
-/Type /FontDescriptor
-/FontName /EFTTGV+NimbusRomNo9L-ReguItal
-/Flags 4
-/FontBBox [-169 -270 1010 924]
-/Ascent 669
-/CapHeight 669
-/Descent -193
-/ItalicAngle -15
-/StemV 78
-/XHeight 441
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/Y/Z/a/agrave/ampersand/b/backslash/bracketleft/bracketright/c/colon/comma/d/e/eacute/eight/equal/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quotedblleft/quotedblright/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 20038 0 R
->> endobj
-19937 0 obj <<
-/Type /Encoding
-/Differences [2/fi/fl 33/exclam/quotedbl/numbersign 37/percent/ampersand/quoteright/parenleft/parenright/asterisk/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon/less/equal/greater/question/at/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore/quoteleft/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/braceleft/bar/braceright 147/quotedblleft/quotedblright/bullet/endash/emdash 1 [...]
->> endobj
-863 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /TQEGZP+CMBX10
-/FontDescriptor 19967 0 R
-/FirstChar 48
-/LastChar 102
-/Widths 19947 0 R
->> endobj
-5346 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /XLOABE+CMBX7
-/FontDescriptor 19969 0 R
-/FirstChar 102
-/LastChar 102
-/Widths 19929 0 R
->> endobj
-833 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /XGUGIB+CMEX10
-/FontDescriptor 19971 0 R
-/FirstChar 0
-/LastChar 111
-/Widths 19951 0 R
->> endobj
-613 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /EERJVP+CMMI10
-/FontDescriptor 19973 0 R
-/FirstChar 11
-/LastChar 125
-/Widths 19958 0 R
->> endobj
-2996 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ZGGNQH+CMMI12
-/FontDescriptor 19975 0 R
-/FirstChar 60
-/LastChar 62
-/Widths 19936 0 R
->> endobj
-879 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /WNXLJT+CMMI5
-/FontDescriptor 19977 0 R
-/FirstChar 68
-/LastChar 110
-/Widths 19946 0 R
->> endobj
-765 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /AXPGTH+CMMI7
-/FontDescriptor 19979 0 R
-/FirstChar 26
-/LastChar 119
-/Widths 19954 0 R
->> endobj
-2320 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ZRLUIR+CMMI8
-/FontDescriptor 19981 0 R
-/FirstChar 60
-/LastChar 62
-/Widths 19939 0 R
->> endobj
-3037 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /KGNDHW+CMMI9
-/FontDescriptor 19983 0 R
-/FirstChar 15
-/LastChar 121
-/Widths 19934 0 R
->> endobj
-862 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /NAIRUZ+CMMIB10
-/FontDescriptor 19985 0 R
-/FirstChar 11
-/LastChar 120
-/Widths 19948 0 R
->> endobj
-1082 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UQOYSR+CMMIB7
-/FontDescriptor 19987 0 R
-/FirstChar 112
-/LastChar 112
-/Widths 19943 0 R
->> endobj
-794 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /CPXVZD+CMR10
-/FontDescriptor 19989 0 R
-/FirstChar 1
-/LastChar 120
-/Widths 19953 0 R
->> endobj
-861 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /LYFRJR+CMR5
-/FontDescriptor 19991 0 R
-/FirstChar 43
-/LastChar 80
-/Widths 19949 0 R
->> endobj
-3426 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /YPFGSD+CMR6
-/FontDescriptor 19993 0 R
-/FirstChar 48
-/LastChar 120
-/Widths 19931 0 R
->> endobj
-795 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /SWADHT+CMR7
-/FontDescriptor 19995 0 R
-/FirstChar 35
-/LastChar 120
-/Widths 19952 0 R
->> endobj
-3179 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /SRQDSN+CMR9
-/FontDescriptor 19997 0 R
-/FirstChar 12
-/LastChar 118
-/Widths 19932 0 R
->> endobj
-529 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /GXJSMI+CMSY10
-/FontDescriptor 19999 0 R
-/FirstChar 0
-/LastChar 114
-/Widths 19964 0 R
->> endobj
-939 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /TPJSSH+CMSY5
-/FontDescriptor 20001 0 R
-/FirstChar 0
-/LastChar 96
-/Widths 19944 0 R
->> endobj
-531 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /TOOBUT+CMSY6
-/FontDescriptor 20003 0 R
-/FirstChar 3
-/LastChar 123
-/Widths 19962 0 R
->> endobj
-834 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /RWFLWS+CMSY7
-/FontDescriptor 20005 0 R
-/FirstChar 0
-/LastChar 110
-/Widths 19950 0 R
->> endobj
-530 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /DFVRAV+CMSY8
-/FontDescriptor 20007 0 R
-/FirstChar 120
-/LastChar 123
-/Widths 19963 0 R
->> endobj
-3032 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /JZUNZD+CMSY9
-/FontDescriptor 20009 0 R
-/FirstChar 0
-/LastChar 21
-/Widths 19935 0 R
->> endobj
-15654 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /KNYRWO+CMTI10
-/FontDescriptor 20011 0 R
-/FirstChar 112
-/LastChar 115
-/Widths 19928 0 R
->> endobj
-4003 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /BKKFBC+CMTT10
-/FontDescriptor 20013 0 R
-/FirstChar 101
-/LastChar 121
-/Widths 19930 0 R
->> endobj
-3070 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /SIAPJE+CMTT8
-/FontDescriptor 20015 0 R
-/FirstChar 100
-/LastChar 120
-/Widths 19933 0 R
->> endobj
-938 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /TVEUDK+MSAM10
-/FontDescriptor 20017 0 R
-/FirstChar 1
-/LastChar 26
-/Widths 19945 0 R
->> endobj
-764 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UDLXQN+MSBM10
-/FontDescriptor 20019 0 R
-/FirstChar 63
-/LastChar 90
-/Widths 19955 0 R
->> endobj
-554 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /EOLHYO+NimbusMonL-Regu
-/FontDescriptor 20023 0 R
-/FirstChar 33
-/LastChar 125
-/Widths 19959 0 R
-/Encoding 19937 0 R
->> endobj
-1507 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /WITXSS+NimbusMonL-ReguObli
-/FontDescriptor 20025 0 R
-/FirstChar 39
-/LastChar 122
-/Widths 19941 0 R
-/Encoding 19937 0 R
->> endobj
-758 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /BVTPQN+NimbusSanL-BoldCond
-/FontDescriptor 20027 0 R
-/FirstChar 2
-/LastChar 148
-/Widths 19957 0 R
-/Encoding 19937 0 R
->> endobj
-2446 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /JNUSOP+NimbusSanL-BoldCondItal
-/FontDescriptor 20029 0 R
-/FirstChar 2
-/LastChar 122
-/Widths 19938 0 R
-/Encoding 19937 0 R
->> endobj
-528 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /FICHDP+NimbusSanL-Regu
-/FontDescriptor 20031 0 R
-/FirstChar 39
-/LastChar 121
-/Widths 19965 0 R
-/Encoding 19937 0 R
->> endobj
-552 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /URKSXV+NimbusRomNo9L-Medi
-/FontDescriptor 20033 0 R
-/FirstChar 2
-/LastChar 150
-/Widths 19960 0 R
-/Encoding 19937 0 R
->> endobj
-1773 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /SBCPHW+NimbusRomNo9L-MediItal
-/FontDescriptor 20035 0 R
-/FirstChar 49
-/LastChar 121
-/Widths 19940 0 R
-/Encoding 19937 0 R
->> endobj
-532 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /DODIPJ+NimbusRomNo9L-Regu
-/FontDescriptor 20037 0 R
-/FirstChar 2
-/LastChar 233
-/Widths 19961 0 R
-/Encoding 19937 0 R
->> endobj
-763 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /EFTTGV+NimbusRomNo9L-ReguItal
-/FontDescriptor 20039 0 R
-/FirstChar 2
-/LastChar 233
-/Widths 19956 0 R
-/Encoding 19937 0 R
->> endobj
-1248 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /FBUTUG+stmary10
-/FontDescriptor 20021 0 R
-/FirstChar 27
-/LastChar 122
-/Widths 19942 0 R
->> endobj
-533 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20040 0 R
-/Kids [522 0 R 537 0 R 549 0 R 562 0 R 610 0 R 657 0 R]
->> endobj
-734 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20040 0 R
-/Kids [721 0 R 741 0 R 756 0 R 778 0 R 792 0 R 802 0 R]
->> endobj
-820 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20040 0 R
-/Kids [813 0 R 825 0 R 843 0 R 858 0 R 871 0 R 885 0 R]
->> endobj
-903 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20040 0 R
-/Kids [897 0 R 906 0 R 919 0 R 933 0 R 951 0 R 959 0 R]
->> endobj
-982 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20040 0 R
-/Kids [972 0 R 990 0 R 1011 0 R 1028 0 R 1046 0 R 1063 0 R]
->> endobj
-1092 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20040 0 R
-/Kids [1078 0 R 1098 0 R 1110 0 R 1123 0 R 1138 0 R 1157 0 R]
->> endobj
-1201 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20041 0 R
-/Kids [1185 0 R 1220 0 R 1245 0 R 1255 0 R 1267 0 R 1283 0 R]
->> endobj
-1324 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20041 0 R
-/Kids [1309 0 R 1337 0 R 1356 0 R 1374 0 R 1395 0 R 1418 0 R]
->> endobj
-1445 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20041 0 R
-/Kids [1438 0 R 1448 0 R 1456 0 R 1464 0 R 1471 0 R 1477 0 R]
->> endobj
-1489 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20041 0 R
-/Kids [1483 0 R 1492 0 R 1500 0 R 1513 0 R 1519 0 R 1524 0 R]
->> endobj
-1532 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20041 0 R
-/Kids [1529 0 R 1535 0 R 1542 0 R 1572 0 R 1607 0 R 1639 0 R]
->> endobj
-1672 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20041 0 R
-/Kids [1669 0 R 1712 0 R 1769 0 R 1829 0 R 1887 0 R 1942 0 R]
->> endobj
-1991 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20042 0 R
-/Kids [1984 0 R 2024 0 R 2051 0 R 2107 0 R 2211 0 R 2313 0 R]
->> endobj
-2381 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20042 0 R
-/Kids [2372 0 R 2391 0 R 2406 0 R 2415 0 R 2426 0 R 2438 0 R]
->> endobj
-2473 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20042 0 R
-/Kids [2451 0 R 2478 0 R 2488 0 R 2499 0 R 2511 0 R 2522 0 R]
->> endobj
-2538 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20042 0 R
-/Kids [2531 0 R 2557 0 R 2587 0 R 2618 0 R 2655 0 R 2747 0 R]
->> endobj
-2827 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20042 0 R
-/Kids [2810 0 R 2885 0 R 2934 0 R 2948 0 R 2964 0 R 2980 0 R]
->> endobj
-2999 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20042 0 R
-/Kids [2992 0 R 3024 0 R 3061 0 R 3091 0 R 3168 0 R 3246 0 R]
->> endobj
-3328 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20043 0 R
-/Kids [3325 0 R 3423 0 R 3498 0 R 3568 0 R 3658 0 R 3691 0 R]
->> endobj
-3707 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20043 0 R
-/Kids [3698 0 R 3710 0 R 3724 0 R 3736 0 R 3751 0 R 3765 0 R]
->> endobj
-3794 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20043 0 R
-/Kids [3779 0 R 3797 0 R 3812 0 R 3829 0 R 3848 0 R 3862 0 R]
->> endobj
-3891 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20043 0 R
-/Kids [3880 0 R 3897 0 R 3913 0 R 3928 0 R 3945 0 R 3959 0 R]
->> endobj
-3991 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20043 0 R
-/Kids [3979 0 R 3998 0 R 4013 0 R 4034 0 R 4054 0 R 4067 0 R]
->> endobj
-4088 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20043 0 R
-/Kids [4080 0 R 4091 0 R 4103 0 R 4129 0 R 4152 0 R 4222 0 R]
->> endobj
-4320 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20044 0 R
-/Kids [4304 0 R 4390 0 R 4481 0 R 4549 0 R 4617 0 R 4706 0 R]
->> endobj
-4741 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20044 0 R
-/Kids [4731 0 R 4746 0 R 4760 0 R 4773 0 R 4789 0 R 4803 0 R]
->> endobj
-4830 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20044 0 R
-/Kids [4817 0 R 4834 0 R 4849 0 R 4865 0 R 4884 0 R 4901 0 R]
->> endobj
-4929 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20044 0 R
-/Kids [4919 0 R 4935 0 R 4950 0 R 4968 0 R 4983 0 R 4999 0 R]
->> endobj
-5024 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20044 0 R
-/Kids [5014 0 R 5033 0 R 5051 0 R 5064 0 R 5074 0 R 5088 0 R]
->> endobj
-5109 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20044 0 R
-/Kids [5097 0 R 5123 0 R 5190 0 R 5216 0 R 5229 0 R 5244 0 R]
->> endobj
-5270 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20045 0 R
-/Kids [5259 0 R 5293 0 R 5325 0 R 5343 0 R 5374 0 R 5432 0 R]
->> endobj
-5511 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20045 0 R
-/Kids [5488 0 R 5543 0 R 5585 0 R 5647 0 R 5711 0 R 5751 0 R]
->> endobj
-5778 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20045 0 R
-/Kids [5775 0 R 5802 0 R 5811 0 R 5829 0 R 5845 0 R 5859 0 R]
->> endobj
-5884 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20045 0 R
-/Kids [5875 0 R 5887 0 R 5892 0 R 5918 0 R 5940 0 R 5988 0 R]
->> endobj
-6013 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20045 0 R
-/Kids [6007 0 R 6020 0 R 6032 0 R 6042 0 R 6053 0 R 6080 0 R]
->> endobj
-6123 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20045 0 R
-/Kids [6107 0 R 6164 0 R 6243 0 R 6332 0 R 6364 0 R 6379 0 R]
->> endobj
-6407 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20046 0 R
-/Kids [6395 0 R 6410 0 R 6423 0 R 6469 0 R 6529 0 R 6590 0 R]
->> endobj
-6622 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20046 0 R
-/Kids [6615 0 R 6626 0 R 6640 0 R 6657 0 R 6705 0 R 6732 0 R]
->> endobj
-6761 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20046 0 R
-/Kids [6748 0 R 6771 0 R 6787 0 R 6829 0 R 6850 0 R 6874 0 R]
->> endobj
-6934 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20046 0 R
-/Kids [6917 0 R 6949 0 R 6991 0 R 7016 0 R 7056 0 R 7094 0 R]
->> endobj
-7124 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20046 0 R
-/Kids [7115 0 R 7178 0 R 7243 0 R 7338 0 R 7466 0 R 7497 0 R]
->> endobj
-7519 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20046 0 R
-/Kids [7510 0 R 7524 0 R 7540 0 R 7554 0 R 7572 0 R 7593 0 R]
->> endobj
-7668 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20047 0 R
-/Kids [7649 0 R 7704 0 R 7729 0 R 7757 0 R 7783 0 R 7821 0 R]
->> endobj
-7893 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20047 0 R
-/Kids [7878 0 R 7902 0 R 7947 0 R 7976 0 R 7993 0 R 8032 0 R]
->> endobj
-8076 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20047 0 R
-/Kids [8063 0 R 8085 0 R 8099 0 R 8120 0 R 8163 0 R 8213 0 R]
->> endobj
-8248 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20047 0 R
-/Kids [8237 0 R 8253 0 R 8260 0 R 8295 0 R 8323 0 R 8355 0 R]
->> endobj
-8384 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20047 0 R
-/Kids [8376 0 R 8396 0 R 8428 0 R 8491 0 R 8579 0 R 8681 0 R]
->> endobj
-8795 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20047 0 R
-/Kids [8788 0 R 8841 0 R 8882 0 R 8901 0 R 8912 0 R 8930 0 R]
->> endobj
-8962 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20048 0 R
-/Kids [8948 0 R 8966 0 R 8978 0 R 8986 0 R 8994 0 R 9035 0 R]
->> endobj
-9112 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20048 0 R
-/Kids [9088 0 R 9128 0 R 9142 0 R 9171 0 R 9223 0 R 9265 0 R]
->> endobj
-9300 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20048 0 R
-/Kids [9287 0 R 9355 0 R 9431 0 R 9509 0 R 9609 0 R 9683 0 R]
->> endobj
-9751 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20048 0 R
-/Kids [9737 0 R 9764 0 R 9778 0 R 9786 0 R 9791 0 R 9804 0 R]
->> endobj
-9831 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20048 0 R
-/Kids [9819 0 R 9834 0 R 9849 0 R 9867 0 R 9881 0 R 9894 0 R]
->> endobj
-9921 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20048 0 R
-/Kids [9909 0 R 9924 0 R 9939 0 R 9959 0 R 9980 0 R 9996 0 R]
->> endobj
-10023 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20049 0 R
-/Kids [10011 0 R 10033 0 R 10049 0 R 10067 0 R 10087 0 R 10109 0 R]
->> endobj
-10137 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20049 0 R
-/Kids [10128 0 R 10145 0 R 10177 0 R 10231 0 R 10292 0 R 10379 0 R]
->> endobj
-10495 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20049 0 R
-/Kids [10481 0 R 10530 0 R 10549 0 R 10560 0 R 10579 0 R 10598 0 R]
->> endobj
-10631 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20049 0 R
-/Kids [10614 0 R 10679 0 R 10743 0 R 10773 0 R 10785 0 R 10805 0 R]
->> endobj
-10838 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20049 0 R
-/Kids [10829 0 R 10846 0 R 10867 0 R 10890 0 R 10917 0 R 10945 0 R]
->> endobj
-10971 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20049 0 R
-/Kids [10963 0 R 10975 0 R 11016 0 R 11040 0 R 11056 0 R 11073 0 R]
->> endobj
-11116 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20050 0 R
-/Kids [11109 0 R 11192 0 R 11262 0 R 11376 0 R 11521 0 R 11557 0 R]
->> endobj
-11579 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20050 0 R
-/Kids [11567 0 R 11585 0 R 11599 0 R 11612 0 R 11625 0 R 11645 0 R]
->> endobj
-11680 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20050 0 R
-/Kids [11663 0 R 11683 0 R 11723 0 R 11787 0 R 11864 0 R 11950 0 R]
->> endobj
-12026 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20050 0 R
-/Kids [12021 0 R 12037 0 R 12050 0 R 12059 0 R 12075 0 R 12092 0 R]
->> endobj
-12131 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20050 0 R
-/Kids [12110 0 R 12143 0 R 12218 0 R 12281 0 R 12315 0 R 12328 0 R]
->> endobj
-12354 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20050 0 R
-/Kids [12342 0 R 12358 0 R 12373 0 R 12388 0 R 12430 0 R 12456 0 R]
->> endobj
-12482 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20051 0 R
-/Kids [12473 0 R 12494 0 R 12563 0 R 12592 0 R 12606 0 R 12621 0 R]
->> endobj
-12645 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20051 0 R
-/Kids [12635 0 R 12656 0 R 12722 0 R 12806 0 R 12885 0 R 12978 0 R]
->> endobj
-13062 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20051 0 R
-/Kids [13056 0 R 13122 0 R 13213 0 R 13242 0 R 13254 0 R 13263 0 R]
->> endobj
-13288 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20051 0 R
-/Kids [13276 0 R 13291 0 R 13306 0 R 13323 0 R 13336 0 R 13348 0 R]
->> endobj
-13376 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20051 0 R
-/Kids [13363 0 R 13379 0 R 13397 0 R 13411 0 R 13431 0 R 13446 0 R]
->> endobj
-13474 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20051 0 R
-/Kids [13462 0 R 13479 0 R 13495 0 R 13510 0 R 13528 0 R 13544 0 R]
->> endobj
-13575 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20052 0 R
-/Kids [13563 0 R 13587 0 R 13603 0 R 13615 0 R 13627 0 R 13636 0 R]
->> endobj
-13665 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20052 0 R
-/Kids [13656 0 R 13687 0 R 13704 0 R 13763 0 R 13842 0 R 13914 0 R]
->> endobj
-14015 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20052 0 R
-/Kids [14009 0 R 14063 0 R 14115 0 R 14144 0 R 14151 0 R 14161 0 R]
->> endobj
-14187 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20052 0 R
-/Kids [14176 0 R 14190 0 R 14204 0 R 14218 0 R 14230 0 R 14242 0 R]
->> endobj
-14272 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20052 0 R
-/Kids [14258 0 R 14275 0 R 14292 0 R 14307 0 R 14328 0 R 14350 0 R]
->> endobj
-14378 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20052 0 R
-/Kids [14367 0 R 14382 0 R 14397 0 R 14418 0 R 14435 0 R 14452 0 R]
->> endobj
-14491 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20053 0 R
-/Kids [14479 0 R 14526 0 R 14568 0 R 14625 0 R 14698 0 R 14747 0 R]
->> endobj
-14769 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20053 0 R
-/Kids [14766 0 R 14777 0 R 14789 0 R 14803 0 R 14812 0 R 14818 0 R]
->> endobj
-14834 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20053 0 R
-/Kids [14825 0 R 14840 0 R 14855 0 R 14872 0 R 14906 0 R 14962 0 R]
->> endobj
-14997 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20053 0 R
-/Kids [14988 0 R 15020 0 R 15084 0 R 15122 0 R 15147 0 R 15165 0 R]
->> endobj
-15258 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20053 0 R
-/Kids [15239 0 R 15321 0 R 15394 0 R 15482 0 R 15535 0 R 15591 0 R]
->> endobj
-15619 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20053 0 R
-/Kids [15608 0 R 15622 0 R 15634 0 R 15649 0 R 15663 0 R 15676 0 R]
->> endobj
-15701 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20054 0 R
-/Kids [15687 0 R 15704 0 R 15720 0 R 15739 0 R 15756 0 R 15771 0 R]
->> endobj
-15802 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20054 0 R
-/Kids [15789 0 R 15808 0 R 15827 0 R 15843 0 R 15860 0 R 15879 0 R]
->> endobj
-15914 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20054 0 R
-/Kids [15901 0 R 15947 0 R 15984 0 R 16041 0 R 16064 0 R 16108 0 R]
->> endobj
-16196 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20054 0 R
-/Kids [16186 0 R 16264 0 R 16363 0 R 16436 0 R 16503 0 R 16565 0 R]
->> endobj
-16584 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20054 0 R
-/Kids [16580 0 R 16589 0 R 16594 0 R 16599 0 R 16614 0 R 16629 0 R]
->> endobj
-16657 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20054 0 R
-/Kids [16646 0 R 16662 0 R 16674 0 R 16687 0 R 16704 0 R 16718 0 R]
->> endobj
-16744 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20055 0 R
-/Kids [16734 0 R 16750 0 R 16771 0 R 16789 0 R 16808 0 R 16825 0 R]
->> endobj
-16851 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20055 0 R
-/Kids [16842 0 R 16862 0 R 16885 0 R 16902 0 R 16920 0 R 16942 0 R]
->> endobj
-16966 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20055 0 R
-/Kids [16956 0 R 16969 0 R 16998 0 R 17052 0 R 17104 0 R 17153 0 R]
->> endobj
-17184 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20055 0 R
-/Kids [17181 0 R 17189 0 R 17205 0 R 17224 0 R 17240 0 R 17273 0 R]
->> endobj
-17325 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20055 0 R
-/Kids [17310 0 R 17331 0 R 17344 0 R 17370 0 R 17394 0 R 17439 0 R]
->> endobj
-17482 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20055 0 R
-/Kids [17468 0 R 17512 0 R 17544 0 R 17562 0 R 17599 0 R 17624 0 R]
->> endobj
-17646 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20056 0 R
-/Kids [17642 0 R 17716 0 R 17782 0 R 17877 0 R 17970 0 R 18043 0 R]
->> endobj
-18124 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20056 0 R
-/Kids [18121 0 R 18196 0 R 18271 0 R 18343 0 R 18428 0 R 18511 0 R]
->> endobj
-18590 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20056 0 R
-/Kids [18587 0 R 18705 0 R 18827 0 R 18928 0 R 19054 0 R 19171 0 R]
->> endobj
-19294 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 20056 0 R
-/Kids [19291 0 R 19406 0 R 19527 0 R 19604 0 R 19689 0 R 19757 0 R]
->> endobj
-19842 0 obj <<
-/Type /Pages
-/Count 3
-/Parent 20056 0 R
-/Kids [19839 0 R 19904 0 R 19925 0 R]
->> endobj
-20040 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20057 0 R
-/Kids [533 0 R 734 0 R 820 0 R 903 0 R 982 0 R 1092 0 R]
->> endobj
-20041 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20057 0 R
-/Kids [1201 0 R 1324 0 R 1445 0 R 1489 0 R 1532 0 R 1672 0 R]
->> endobj
-20042 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20057 0 R
-/Kids [1991 0 R 2381 0 R 2473 0 R 2538 0 R 2827 0 R 2999 0 R]
->> endobj
-20043 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20057 0 R
-/Kids [3328 0 R 3707 0 R 3794 0 R 3891 0 R 3991 0 R 4088 0 R]
->> endobj
-20044 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20057 0 R
-/Kids [4320 0 R 4741 0 R 4830 0 R 4929 0 R 5024 0 R 5109 0 R]
->> endobj
-20045 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20057 0 R
-/Kids [5270 0 R 5511 0 R 5778 0 R 5884 0 R 6013 0 R 6123 0 R]
->> endobj
-20046 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20058 0 R
-/Kids [6407 0 R 6622 0 R 6761 0 R 6934 0 R 7124 0 R 7519 0 R]
->> endobj
-20047 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20058 0 R
-/Kids [7668 0 R 7893 0 R 8076 0 R 8248 0 R 8384 0 R 8795 0 R]
->> endobj
-20048 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20058 0 R
-/Kids [8962 0 R 9112 0 R 9300 0 R 9751 0 R 9831 0 R 9921 0 R]
->> endobj
-20049 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20058 0 R
-/Kids [10023 0 R 10137 0 R 10495 0 R 10631 0 R 10838 0 R 10971 0 R]
->> endobj
-20050 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20058 0 R
-/Kids [11116 0 R 11579 0 R 11680 0 R 12026 0 R 12131 0 R 12354 0 R]
->> endobj
-20051 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20058 0 R
-/Kids [12482 0 R 12645 0 R 13062 0 R 13288 0 R 13376 0 R 13474 0 R]
->> endobj
-20052 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20059 0 R
-/Kids [13575 0 R 13665 0 R 14015 0 R 14187 0 R 14272 0 R 14378 0 R]
->> endobj
-20053 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20059 0 R
-/Kids [14491 0 R 14769 0 R 14834 0 R 14997 0 R 15258 0 R 15619 0 R]
->> endobj
-20054 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20059 0 R
-/Kids [15701 0 R 15802 0 R 15914 0 R 16196 0 R 16584 0 R 16657 0 R]
->> endobj
-20055 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 20059 0 R
-/Kids [16744 0 R 16851 0 R 16966 0 R 17184 0 R 17325 0 R 17482 0 R]
->> endobj
-20056 0 obj <<
-/Type /Pages
-/Count 27
-/Parent 20059 0 R
-/Kids [17646 0 R 18124 0 R 18590 0 R 19294 0 R 19842 0 R]
->> endobj
-20057 0 obj <<
-/Type /Pages
-/Count 216
-/Parent 20060 0 R
-/Kids [20040 0 R 20041 0 R 20042 0 R 20043 0 R 20044 0 R 20045 0 R]
->> endobj
-20058 0 obj <<
-/Type /Pages
-/Count 216
-/Parent 20060 0 R
-/Kids [20046 0 R 20047 0 R 20048 0 R 20049 0 R 20050 0 R 20051 0 R]
->> endobj
-20059 0 obj <<
-/Type /Pages
-/Count 171
-/Parent 20060 0 R
-/Kids [20052 0 R 20053 0 R 20054 0 R 20055 0 R 20056 0 R]
->> endobj
-20060 0 obj <<
-/Type /Pages
-/Count 603
-/Kids [20057 0 R 20058 0 R 20059 0 R]
->> endobj
-20061 0 obj <<
-/Type /Outlines
-/First 3 0 R
-/Last 135 0 R
-/Count 10
->> endobj
-519 0 obj <<
-/Title 520 0 R
-/A 517 0 R
-/Parent 135 0 R
-/Prev 515 0 R
->> endobj
-515 0 obj <<
-/Title 516 0 R
-/A 513 0 R
-/Parent 135 0 R
-/Prev 511 0 R
-/Next 519 0 R
->> endobj
-511 0 obj <<
-/Title 512 0 R
-/A 509 0 R
-/Parent 135 0 R
-/Prev 507 0 R
-/Next 515 0 R
->> endobj
-507 0 obj <<
-/Title 508 0 R
-/A 505 0 R
-/Parent 135 0 R
-/Prev 503 0 R
-/Next 511 0 R
->> endobj
-503 0 obj <<
-/Title 504 0 R
-/A 501 0 R
-/Parent 135 0 R
-/Prev 499 0 R
-/Next 507 0 R
->> endobj
-499 0 obj <<
-/Title 500 0 R
-/A 497 0 R
-/Parent 135 0 R
-/Prev 495 0 R
-/Next 503 0 R
->> endobj
-495 0 obj <<
-/Title 496 0 R
-/A 493 0 R
-/Parent 135 0 R
-/Prev 491 0 R
-/Next 499 0 R
->> endobj
-491 0 obj <<
-/Title 492 0 R
-/A 489 0 R
-/Parent 135 0 R
-/Prev 487 0 R
-/Next 495 0 R
->> endobj
-487 0 obj <<
-/Title 488 0 R
-/A 485 0 R
-/Parent 135 0 R
-/Prev 483 0 R
-/Next 491 0 R
->> endobj
-483 0 obj <<
-/Title 484 0 R
-/A 481 0 R
-/Parent 135 0 R
-/Prev 479 0 R
-/Next 487 0 R
->> endobj
-479 0 obj <<
-/Title 480 0 R
-/A 477 0 R
-/Parent 135 0 R
-/Prev 475 0 R
-/Next 483 0 R
->> endobj
-475 0 obj <<
-/Title 476 0 R
-/A 473 0 R
-/Parent 135 0 R
-/Prev 471 0 R
-/Next 479 0 R
->> endobj
-471 0 obj <<
-/Title 472 0 R
-/A 469 0 R
-/Parent 135 0 R
-/Prev 467 0 R
-/Next 475 0 R
->> endobj
-467 0 obj <<
-/Title 468 0 R
-/A 465 0 R
-/Parent 135 0 R
-/Prev 463 0 R
-/Next 471 0 R
->> endobj
-463 0 obj <<
-/Title 464 0 R
-/A 461 0 R
-/Parent 135 0 R
-/Prev 459 0 R
-/Next 467 0 R
->> endobj
-459 0 obj <<
-/Title 460 0 R
-/A 457 0 R
-/Parent 135 0 R
-/Prev 455 0 R
-/Next 463 0 R
->> endobj
-455 0 obj <<
-/Title 456 0 R
-/A 453 0 R
-/Parent 135 0 R
-/Prev 451 0 R
-/Next 459 0 R
->> endobj
-451 0 obj <<
-/Title 452 0 R
-/A 449 0 R
-/Parent 135 0 R
-/Prev 447 0 R
-/Next 455 0 R
->> endobj
-447 0 obj <<
-/Title 448 0 R
-/A 445 0 R
-/Parent 135 0 R
-/Prev 443 0 R
-/Next 451 0 R
->> endobj
-443 0 obj <<
-/Title 444 0 R
-/A 441 0 R
-/Parent 135 0 R
-/Prev 439 0 R
-/Next 447 0 R
->> endobj
-439 0 obj <<
-/Title 440 0 R
-/A 437 0 R
-/Parent 135 0 R
-/Prev 435 0 R
-/Next 443 0 R
->> endobj
-435 0 obj <<
-/Title 436 0 R
-/A 433 0 R
-/Parent 135 0 R
-/Prev 431 0 R
-/Next 439 0 R
->> endobj
-431 0 obj <<
-/Title 432 0 R
-/A 429 0 R
-/Parent 135 0 R
-/Prev 427 0 R
-/Next 435 0 R
->> endobj
-427 0 obj <<
-/Title 428 0 R
-/A 425 0 R
-/Parent 135 0 R
-/Prev 423 0 R
-/Next 431 0 R
->> endobj
-423 0 obj <<
-/Title 424 0 R
-/A 421 0 R
-/Parent 135 0 R
-/Prev 419 0 R
-/Next 427 0 R
->> endobj
-419 0 obj <<
-/Title 420 0 R
-/A 417 0 R
-/Parent 135 0 R
-/Prev 415 0 R
-/Next 423 0 R
->> endobj
-415 0 obj <<
-/Title 416 0 R
-/A 413 0 R
-/Parent 135 0 R
-/Prev 411 0 R
-/Next 419 0 R
->> endobj
-411 0 obj <<
-/Title 412 0 R
-/A 409 0 R
-/Parent 135 0 R
-/Prev 407 0 R
-/Next 415 0 R
->> endobj
-407 0 obj <<
-/Title 408 0 R
-/A 405 0 R
-/Parent 135 0 R
-/Prev 403 0 R
-/Next 411 0 R
->> endobj
-403 0 obj <<
-/Title 404 0 R
-/A 401 0 R
-/Parent 135 0 R
-/Prev 399 0 R
-/Next 407 0 R
->> endobj
-399 0 obj <<
-/Title 400 0 R
-/A 397 0 R
-/Parent 135 0 R
-/Prev 395 0 R
-/Next 403 0 R
->> endobj
-395 0 obj <<
-/Title 396 0 R
-/A 393 0 R
-/Parent 135 0 R
-/Prev 391 0 R
-/Next 399 0 R
->> endobj
-391 0 obj <<
-/Title 392 0 R
-/A 389 0 R
-/Parent 135 0 R
-/Prev 387 0 R
-/Next 395 0 R
->> endobj
-387 0 obj <<
-/Title 388 0 R
-/A 385 0 R
-/Parent 135 0 R
-/Prev 383 0 R
-/Next 391 0 R
->> endobj
-383 0 obj <<
-/Title 384 0 R
-/A 381 0 R
-/Parent 135 0 R
-/Prev 379 0 R
-/Next 387 0 R
->> endobj
-379 0 obj <<
-/Title 380 0 R
-/A 377 0 R
-/Parent 135 0 R
-/Prev 375 0 R
-/Next 383 0 R
->> endobj
-375 0 obj <<
-/Title 376 0 R
-/A 373 0 R
-/Parent 135 0 R
-/Prev 371 0 R
-/Next 379 0 R
->> endobj
-371 0 obj <<
-/Title 372 0 R
-/A 369 0 R
-/Parent 135 0 R
-/Prev 367 0 R
-/Next 375 0 R
->> endobj
-367 0 obj <<
-/Title 368 0 R
-/A 365 0 R
-/Parent 135 0 R
-/Prev 363 0 R
-/Next 371 0 R
->> endobj
-363 0 obj <<
-/Title 364 0 R
-/A 361 0 R
-/Parent 135 0 R
-/Prev 359 0 R
-/Next 367 0 R
->> endobj
-359 0 obj <<
-/Title 360 0 R
-/A 357 0 R
-/Parent 135 0 R
-/Prev 355 0 R
-/Next 363 0 R
->> endobj
-355 0 obj <<
-/Title 356 0 R
-/A 353 0 R
-/Parent 135 0 R
-/Prev 351 0 R
-/Next 359 0 R
->> endobj
-351 0 obj <<
-/Title 352 0 R
-/A 349 0 R
-/Parent 135 0 R
-/Prev 347 0 R
-/Next 355 0 R
->> endobj
-347 0 obj <<
-/Title 348 0 R
-/A 345 0 R
-/Parent 135 0 R
-/Prev 343 0 R
-/Next 351 0 R
->> endobj
-343 0 obj <<
-/Title 344 0 R
-/A 341 0 R
-/Parent 135 0 R
-/Prev 339 0 R
-/Next 347 0 R
->> endobj
-339 0 obj <<
-/Title 340 0 R
-/A 337 0 R
-/Parent 135 0 R
-/Prev 335 0 R
-/Next 343 0 R
->> endobj
-335 0 obj <<
-/Title 336 0 R
-/A 333 0 R
-/Parent 135 0 R
-/Prev 331 0 R
-/Next 339 0 R
->> endobj
-331 0 obj <<
-/Title 332 0 R
-/A 329 0 R
-/Parent 135 0 R
-/Prev 327 0 R
-/Next 335 0 R
->> endobj
-327 0 obj <<
-/Title 328 0 R
-/A 325 0 R
-/Parent 135 0 R
-/Prev 323 0 R
-/Next 331 0 R
->> endobj
-323 0 obj <<
-/Title 324 0 R
-/A 321 0 R
-/Parent 135 0 R
-/Prev 319 0 R
-/Next 327 0 R
->> endobj
-319 0 obj <<
-/Title 320 0 R
-/A 317 0 R
-/Parent 135 0 R
-/Prev 315 0 R
-/Next 323 0 R
->> endobj
-315 0 obj <<
-/Title 316 0 R
-/A 313 0 R
-/Parent 135 0 R
-/Prev 311 0 R
-/Next 319 0 R
->> endobj
-311 0 obj <<
-/Title 312 0 R
-/A 309 0 R
-/Parent 135 0 R
-/Prev 307 0 R
-/Next 315 0 R
->> endobj
-307 0 obj <<
-/Title 308 0 R
-/A 305 0 R
-/Parent 135 0 R
-/Prev 303 0 R
-/Next 311 0 R
->> endobj
-303 0 obj <<
-/Title 304 0 R
-/A 301 0 R
-/Parent 135 0 R
-/Prev 299 0 R
-/Next 307 0 R
->> endobj
-299 0 obj <<
-/Title 300 0 R
-/A 297 0 R
-/Parent 135 0 R
-/Prev 295 0 R
-/Next 303 0 R
->> endobj
-295 0 obj <<
-/Title 296 0 R
-/A 293 0 R
-/Parent 135 0 R
-/Prev 291 0 R
-/Next 299 0 R
->> endobj
-291 0 obj <<
-/Title 292 0 R
-/A 289 0 R
-/Parent 135 0 R
-/Prev 287 0 R
-/Next 295 0 R
->> endobj
-287 0 obj <<
-/Title 288 0 R
-/A 285 0 R
-/Parent 135 0 R
-/Prev 283 0 R
-/Next 291 0 R
->> endobj
-283 0 obj <<
-/Title 284 0 R
-/A 281 0 R
-/Parent 135 0 R
-/Prev 279 0 R
-/Next 287 0 R
->> endobj
-279 0 obj <<
-/Title 280 0 R
-/A 277 0 R
-/Parent 135 0 R
-/Prev 275 0 R
-/Next 283 0 R
->> endobj
-275 0 obj <<
-/Title 276 0 R
-/A 273 0 R
-/Parent 135 0 R
-/Prev 271 0 R
-/Next 279 0 R
->> endobj
-271 0 obj <<
-/Title 272 0 R
-/A 269 0 R
-/Parent 135 0 R
-/Prev 267 0 R
-/Next 275 0 R
->> endobj
-267 0 obj <<
-/Title 268 0 R
-/A 265 0 R
-/Parent 135 0 R
-/Prev 263 0 R
-/Next 271 0 R
->> endobj
-263 0 obj <<
-/Title 264 0 R
-/A 261 0 R
-/Parent 135 0 R
-/Prev 259 0 R
-/Next 267 0 R
->> endobj
-259 0 obj <<
-/Title 260 0 R
-/A 257 0 R
-/Parent 135 0 R
-/Prev 255 0 R
-/Next 263 0 R
->> endobj
-255 0 obj <<
-/Title 256 0 R
-/A 253 0 R
-/Parent 135 0 R
-/Prev 251 0 R
-/Next 259 0 R
->> endobj
-251 0 obj <<
-/Title 252 0 R
-/A 249 0 R
-/Parent 135 0 R
-/Prev 247 0 R
-/Next 255 0 R
->> endobj
-247 0 obj <<
-/Title 248 0 R
-/A 245 0 R
-/Parent 135 0 R
-/Prev 243 0 R
-/Next 251 0 R
->> endobj
-243 0 obj <<
-/Title 244 0 R
-/A 241 0 R
-/Parent 135 0 R
-/Prev 239 0 R
-/Next 247 0 R
->> endobj
-239 0 obj <<
-/Title 240 0 R
-/A 237 0 R
-/Parent 135 0 R
-/Prev 235 0 R
-/Next 243 0 R
->> endobj
-235 0 obj <<
-/Title 236 0 R
-/A 233 0 R
-/Parent 135 0 R
-/Prev 231 0 R
-/Next 239 0 R
->> endobj
-231 0 obj <<
-/Title 232 0 R
-/A 229 0 R
-/Parent 135 0 R
-/Prev 227 0 R
-/Next 235 0 R
->> endobj
-227 0 obj <<
-/Title 228 0 R
-/A 225 0 R
-/Parent 135 0 R
-/Prev 223 0 R
-/Next 231 0 R
->> endobj
-223 0 obj <<
-/Title 224 0 R
-/A 221 0 R
-/Parent 135 0 R
-/Prev 219 0 R
-/Next 227 0 R
->> endobj
-219 0 obj <<
-/Title 220 0 R
-/A 217 0 R
-/Parent 135 0 R
-/Prev 215 0 R
-/Next 223 0 R
->> endobj
-215 0 obj <<
-/Title 216 0 R
-/A 213 0 R
-/Parent 135 0 R
-/Prev 211 0 R
-/Next 219 0 R
->> endobj
-211 0 obj <<
-/Title 212 0 R
-/A 209 0 R
-/Parent 135 0 R
-/Prev 207 0 R
-/Next 215 0 R
->> endobj
-207 0 obj <<
-/Title 208 0 R
-/A 205 0 R
-/Parent 135 0 R
-/Prev 203 0 R
-/Next 211 0 R
->> endobj
-203 0 obj <<
-/Title 204 0 R
-/A 201 0 R
-/Parent 135 0 R
-/Prev 199 0 R
-/Next 207 0 R
->> endobj
-199 0 obj <<
-/Title 200 0 R
-/A 197 0 R
-/Parent 135 0 R
-/Prev 195 0 R
-/Next 203 0 R
->> endobj
-195 0 obj <<
-/Title 196 0 R
-/A 193 0 R
-/Parent 135 0 R
-/Prev 191 0 R
-/Next 199 0 R
->> endobj
-191 0 obj <<
-/Title 192 0 R
-/A 189 0 R
-/Parent 135 0 R
-/Prev 187 0 R
-/Next 195 0 R
->> endobj
-187 0 obj <<
-/Title 188 0 R
-/A 185 0 R
-/Parent 135 0 R
-/Prev 183 0 R
-/Next 191 0 R
->> endobj
-183 0 obj <<
-/Title 184 0 R
-/A 181 0 R
-/Parent 135 0 R
-/Prev 179 0 R
-/Next 187 0 R
->> endobj
-179 0 obj <<
-/Title 180 0 R
-/A 177 0 R
-/Parent 135 0 R
-/Prev 175 0 R
-/Next 183 0 R
->> endobj
-175 0 obj <<
-/Title 176 0 R
-/A 173 0 R
-/Parent 135 0 R
-/Prev 171 0 R
-/Next 179 0 R
->> endobj
-171 0 obj <<
-/Title 172 0 R
-/A 169 0 R
-/Parent 135 0 R
-/Prev 167 0 R
-/Next 175 0 R
->> endobj
-167 0 obj <<
-/Title 168 0 R
-/A 165 0 R
-/Parent 135 0 R
-/Prev 163 0 R
-/Next 171 0 R
->> endobj
-163 0 obj <<
-/Title 164 0 R
-/A 161 0 R
-/Parent 135 0 R
-/Prev 159 0 R
-/Next 167 0 R
->> endobj
-159 0 obj <<
-/Title 160 0 R
-/A 157 0 R
-/Parent 135 0 R
-/Prev 155 0 R
-/Next 163 0 R
->> endobj
-155 0 obj <<
-/Title 156 0 R
-/A 153 0 R
-/Parent 135 0 R
-/Prev 151 0 R
-/Next 159 0 R
->> endobj
-151 0 obj <<
-/Title 152 0 R
-/A 149 0 R
-/Parent 135 0 R
-/Prev 147 0 R
-/Next 155 0 R
->> endobj
-147 0 obj <<
-/Title 148 0 R
-/A 145 0 R
-/Parent 135 0 R
-/Prev 143 0 R
-/Next 151 0 R
->> endobj
-143 0 obj <<
-/Title 144 0 R
-/A 141 0 R
-/Parent 135 0 R
-/Prev 139 0 R
-/Next 147 0 R
->> endobj
-139 0 obj <<
-/Title 140 0 R
-/A 137 0 R
-/Parent 135 0 R
-/Next 143 0 R
->> endobj
-135 0 obj <<
-/Title 136 0 R
-/A 133 0 R
-/Parent 20061 0 R
-/Prev 119 0 R
-/First 139 0 R
-/Last 519 0 R
-/Count -96
->> endobj
-131 0 obj <<
-/Title 132 0 R
-/A 129 0 R
-/Parent 119 0 R
-/Prev 127 0 R
->> endobj
-127 0 obj <<
-/Title 128 0 R
-/A 125 0 R
-/Parent 119 0 R
-/Prev 123 0 R
-/Next 131 0 R
->> endobj
-123 0 obj <<
-/Title 124 0 R
-/A 121 0 R
-/Parent 119 0 R
-/Next 127 0 R
->> endobj
-119 0 obj <<
-/Title 120 0 R
-/A 117 0 R
-/Parent 20061 0 R
-/Prev 111 0 R
-/Next 135 0 R
-/First 123 0 R
-/Last 131 0 R
-/Count -3
->> endobj
-115 0 obj <<
-/Title 116 0 R
-/A 113 0 R
-/Parent 111 0 R
->> endobj
-111 0 obj <<
-/Title 112 0 R
-/A 109 0 R
-/Parent 20061 0 R
-/Prev 103 0 R
-/Next 119 0 R
-/First 115 0 R
-/Last 115 0 R
-/Count -1
->> endobj
-107 0 obj <<
-/Title 108 0 R
-/A 105 0 R
-/Parent 103 0 R
->> endobj
-103 0 obj <<
-/Title 104 0 R
-/A 101 0 R
-/Parent 20061 0 R
-/Prev 95 0 R
-/Next 111 0 R
-/First 107 0 R
-/Last 107 0 R
-/Count -1
->> endobj
-99 0 obj <<
-/Title 100 0 R
-/A 97 0 R
-/Parent 95 0 R
->> endobj
-95 0 obj <<
-/Title 96 0 R
-/A 93 0 R
-/Parent 20061 0 R
-/Prev 87 0 R
-/Next 103 0 R
-/First 99 0 R
-/Last 99 0 R
-/Count -1
->> endobj
-91 0 obj <<
-/Title 92 0 R
-/A 89 0 R
-/Parent 87 0 R
->> endobj
-87 0 obj <<
-/Title 88 0 R
-/A 85 0 R
-/Parent 20061 0 R
-/Prev 79 0 R
-/Next 95 0 R
-/First 91 0 R
-/Last 91 0 R
-/Count -1
->> endobj
-83 0 obj <<
-/Title 84 0 R
-/A 81 0 R
-/Parent 79 0 R
->> endobj
-79 0 obj <<
-/Title 80 0 R
-/A 77 0 R
-/Parent 20061 0 R
-/Prev 75 0 R
-/Next 87 0 R
-/First 83 0 R
-/Last 83 0 R
-/Count -1
->> endobj
-75 0 obj <<
-/Title 76 0 R
-/A 73 0 R
-/Parent 20061 0 R
-/Prev 71 0 R
-/Next 79 0 R
->> endobj
-71 0 obj <<
-/Title 72 0 R
-/A 69 0 R
-/Parent 20061 0 R
-/Prev 3 0 R
-/Next 75 0 R
->> endobj
-67 0 obj <<
-/Title 68 0 R
-/A 65 0 R
-/Parent 3 0 R
-/Prev 63 0 R
->> endobj
-63 0 obj <<
-/Title 64 0 R
-/A 61 0 R
-/Parent 3 0 R
-/Prev 59 0 R
-/Next 67 0 R
->> endobj
-59 0 obj <<
-/Title 60 0 R
-/A 57 0 R
-/Parent 3 0 R
-/Prev 55 0 R
-/Next 63 0 R
->> endobj
-55 0 obj <<
-/Title 56 0 R
-/A 53 0 R
-/Parent 3 0 R
-/Prev 51 0 R
-/Next 59 0 R
->> endobj
-51 0 obj <<
-/Title 52 0 R
-/A 49 0 R
-/Parent 3 0 R
-/Prev 47 0 R
-/Next 55 0 R
->> endobj
-47 0 obj <<
-/Title 48 0 R
-/A 45 0 R
-/Parent 3 0 R
-/Prev 43 0 R
-/Next 51 0 R
->> endobj
-43 0 obj <<
-/Title 44 0 R
-/A 41 0 R
-/Parent 3 0 R
-/Prev 39 0 R
-/Next 47 0 R
->> endobj
-39 0 obj <<
-/Title 40 0 R
-/A 37 0 R
-/Parent 3 0 R
-/Prev 35 0 R
-/Next 43 0 R
->> endobj
-35 0 obj <<
-/Title 36 0 R
-/A 33 0 R
-/Parent 3 0 R
-/Prev 31 0 R
-/Next 39 0 R
->> endobj
-31 0 obj <<
-/Title 32 0 R
-/A 29 0 R
-/Parent 3 0 R
-/Prev 27 0 R
-/Next 35 0 R
->> endobj
-27 0 obj <<
-/Title 28 0 R
-/A 25 0 R
-/Parent 3 0 R
-/Prev 23 0 R
-/Next 31 0 R
->> endobj
-23 0 obj <<
-/Title 24 0 R
-/A 21 0 R
-/Parent 3 0 R
-/Prev 19 0 R
-/Next 27 0 R
->> endobj
-19 0 obj <<
-/Title 20 0 R
-/A 17 0 R
-/Parent 3 0 R
-/Prev 15 0 R
-/Next 23 0 R
->> endobj
-15 0 obj <<
-/Title 16 0 R
-/A 13 0 R
-/Parent 3 0 R
-/Prev 11 0 R
-/Next 19 0 R
->> endobj
-11 0 obj <<
-/Title 12 0 R
-/A 9 0 R
-/Parent 3 0 R
-/Prev 7 0 R
-/Next 15 0 R
->> endobj
-7 0 obj <<
-/Title 8 0 R
-/A 5 0 R
-/Parent 3 0 R
-/Next 11 0 R
->> endobj
-3 0 obj <<
-/Title 4 0 R
-/A 1 0 R
-/Parent 20061 0 R
-/Next 71 0 R
-/First 7 0 R
-/Last 67 0 R
-/Count -16
->> endobj
-20062 0 obj <<
-/Names [(Doc-Start) 527 0 R (GFDL) 1516 0 R (GFDL_GFDL) 559 0 R (GPL) 1443 0 R (GPL_GPL) 560 0 R (Item.1) 807 0 R]
-/Limits [(Doc-Start) (Item.1)]
->> endobj
-20063 0 obj <<
-/Names [(Item.2) 808 0 R (Item.3) 816 0 R (Item.4) 817 0 R (Item.5) 818 0 R (classParma__Polyhedra__Library_1_1Approximable__Reference) 1716 0 R (classParma__Polyhedra__Library_1_1Approximable__Reference__Common) 1717 0 R]
-/Limits [(Item.2) (classParma__Polyhedra__Library_1_1Approximable__Reference__Common)]
->> endobj
-20064 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape) 770 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a00b832cc0784b7b30f4d4a2f738a3032) 3501 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a01e1250fa095e6dac631943527b5e41c) 3587 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a033967c42f02b6029fc4d6153eb8072a) 3106 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0442c5079b3de8dcac61c224ee7a2e6f) 3345 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a07cc48290e435dfb739fb565ff1a [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape) (classParma__Polyhedra__Library_1_1BD__Shape_a07cc48290e435dfb739fb565ff1aa3fa)]
->> endobj
-20065 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a0a486044e2b8a3efc48b5d73b6af3267) 3519 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0aa903d00357007b8ef684059f92a8d6) 3682 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0acf1147e3f81830606dec4cc8faddd4) 3436 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0badc932380dcb7f72ea50ca922d9d4b) 3517 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0cc08ca5d72d5cf465eb7812ffbb156a) 3333 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a0a486044e2b8a3efc48b5d73b6af3267) (classParma__Polyhedra__Library_1_1BD__Shape_a0ff8a3e3f7c118f923482924b1862c2e)]
->> endobj
-20066 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a128b2fafec11e096e41f78710ba2ff0a) 3187 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a12dc6df3a06f4c97c6bb2264bbad05ac) 3100 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a15b3e8152862a6b98ecf1c4f4a142634) 3188 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a16f61fdba7e14a67990a84e93be00efb) 3270 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a178a6a88143f44b43939d36024af6162) 3440 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a128b2fafec11e096e41f78710ba2ff0a) (classParma__Polyhedra__Library_1_1BD__Shape_a198e5e17ee2a7484f89d293b8bbf5ccf)]
->> endobj
-20067 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a1a02b17cbccf348192f3e7f776b3b3fd) 3505 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a1a6088f536e9340145630576cfd6e6b9) 3105 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a1d00782cbab77286295552af7dba7ed8) 3263 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a1d502ed8aa71e78a52f33d9b16704974) 3681 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a1e645f35cbeedf3341428988157f71ab) 3180 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a1a02b17cbccf348192f3e7f776b3b3fd) (classParma__Polyhedra__Library_1_1BD__Shape_a1f8426558552c358c30b6263c758fe51)]
->> endobj
-20068 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a20814dec69b3a6602b70a9ad50db9b2a) 3329 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a21d79f277ceee36111baef3184e8d2cd) 3675 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a2204d6d24f9c68fdb6a72062afe9a209) 3444 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a242d9bf0b5b215d4aa771e9f8595baea) 3253 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a24fbe68af11e373092f23f59b6cfd3e1) 3181 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a20814dec69b3a6602b70a9ad50db9b2a) (classParma__Polyhedra__Library_1_1BD__Shape_a25a2d683973c6c6901e47c4fe90cf2b1)]
->> endobj
-20069 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a25c5ef784f17646705c76a5be6c724a3) 3171 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a26a38ad6506b5c3154e90e696ea6dc88) 3186 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a26ed8b6a9eba118ffd48ecfd8bb74bbf) 3589 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a28b268e37d25a0cfa2b5bf39e85c758d) 3331 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a29212d49685544d8a3c71993bd30f467) 3257 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a25c5ef784f17646705c76a5be6c724a3) (classParma__Polyhedra__Library_1_1BD__Shape_a2af430cd70ac416ca0907312b65812e6)]
->> endobj
-20070 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a32c0ddfdabd75501718ed9f44f6d9ae2) 3676 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a33daeddebffc6eb847edd92c3ba045dc) 3262 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a35f19d0e7190c5a18aebc9ced95d554e) 3338 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a3825b4905d72422089bf28d3c95c2964) 3185 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a396bd79b5d57d54685d9c1b9d970c00e) 3256 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a32c0ddfdabd75501718ed9f44f6d9ae2) (classParma__Polyhedra__Library_1_1BD__Shape_a3e0339ccaf8da39b9fd21ff8777e99e4)]
->> endobj
-20071 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a43c478e6516cd11d378e25f16e669514) 3680 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a45fd50a7deed65baf4e64b803a595c29) 3583 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a4780bcf6d4bced818a0cc1b6ed7c97d2) 3516 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a4ac2269cb78d6549ccb1d573929be1c7) 3684 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a4aef1a4f6e9bed5d473e98320401e0e5) 3269 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a43c478e6516cd11d378e25f16e669514) (classParma__Polyhedra__Library_1_1BD__Shape_a4b7615a8ec5120dc083f368ecfe2d1da)]
->> endobj
-20072 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a4e04c3a6c835332c31dfbb928b31144e) 3432 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a535090b407c713681228d6ab2b835e36) 3332 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a54d9925e5f42a7730cfa90a3d537f1a0) 3582 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a54f33edf5fdf4c6f606136b882be9f1d) 3254 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a5851243f84aa67103a7f805232daecad) 3340 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a4e04c3a6c835332c31dfbb928b31144e) (classParma__Polyhedra__Library_1_1BD__Shape_a587ebb6173af401b6fc9d274bb839608)]
->> endobj
-20073 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a5a66e6f883c7310ddbc312f78bb0970f) 3441 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a5d71f71f50ba04fe5f810acf0cf1e294) 3509 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a5e972fbb672e9b2faec34b949c9a2918) 3267 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a620d5cdb01b8b20848ca01f4e4c05b4f) 3252 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a63e8c0f76da4e9b3520aa338d152d253) 3514 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a5a66e6f883c7310ddbc312f78bb0970f) (classParma__Polyhedra__Library_1_1BD__Shape_a641b55dd6c26bce06bd8041b38aec873)]
->> endobj
-20074 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a668cbd7cea86f47c4e2b303468083712) 3342 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a6a3dd351c33d66250d2b4ac639768f07) 3265 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a6ef0e7043830c5e6b9ffd67697d22c04) 3347 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a75188bcee0bfc88a4c8571acc04a1826) 3268 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a79a586ca093d218e5603380ac0475717) 3258 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a668cbd7cea86f47c4e2b303468083712) (classParma__Polyhedra__Library_1_1BD__Shape_a79acafbe4f67eb7e2710287bcd60db96)]
->> endobj
-20075 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a8101d965bc32e4ab1df6aa445730769b) 3177 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a82b35fc075e1e9542d4cc5cff2e236f8) 3103 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a830339e65ebcd4c100c672487dc63f33) 3677 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a84a9c57aa31433a277d9be6b0077065a) 3431 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a867bed09df5c122833745b9a4cbfa3ea) 3175 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a8101d965bc32e4ab1df6aa445730769b) (classParma__Polyhedra__Library_1_1BD__Shape_a86dd59c40a3c9867c2979ff24ba342c2)]
->> endobj
-20076 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a894e92407922be006a76577cf47b8589) 3348 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8a1cd7df2586fcb1c129b1ec5a28fe9f) 3580 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8a87935278cb7b1290301e96cb82fcb1) 3266 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8c73e2c464d5e93dc55862d00d5478f8) 3255 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8c7ffb3e15a1f5746c633af2af465556) 3504 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a894e92407922be006a76577cf47b8589) (classParma__Polyhedra__Library_1_1BD__Shape_a8c89ddcd2fc4311af0e358477630d7d9)]
->> endobj
-20077 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a8e13e7d3536de2745bc9e58a25b75b77) 3337 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8e28c15a0d7487efa59258598e2f78b2) 3585 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8ede75fbd470fa30f11d4c02672883f5) 3335 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8f0bdfca2a6993bfa08358319d589ab6) 3249 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a900609f82bcb2d07dab53d7bd2035ec8) 3679 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a8e13e7d3536de2745bc9e58a25b75b77) (classParma__Polyhedra__Library_1_1BD__Shape_a91187ba19738062968cc1cb26b135a6a)]
->> endobj
-20078 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a93c1c491c0035f6c38b9ee036184aa7e) 3104 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a9507085c5b0efd13c80f08a22b0f5529) 3445 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a96f9f41695040221ad560cb4ec452ef9) 3193 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a9743d54c550c39688a16670c49d7272e) 3433 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a988ff507806fa8126649f463ef6a1f31) 3437 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a93c1c491c0035f6c38b9ee036184aa7e) (classParma__Polyhedra__Library_1_1BD__Shape_a9c0703b2311336754e28a7f739b7e685)]
->> endobj
-20079 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a9f427e126a129393342ba033e08c5d39) 3341 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aa78a6abbbb3c425992ca644f732e69e8) 3176 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aa7b3a5c12ea008b78eed88a621c1fab1) 3260 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aa85819690f928a46e3f437bfe629e976) 3334 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aab3964a5c29992e6476852c9d246fe6f) 3184 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a9f427e126a129393342ba033e08c5d39) (classParma__Polyhedra__Library_1_1BD__Shape_aaf0d15460d44b410c5a223d13b447b1a)]
->> endobj
-20080 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ab054f67fb31ea4e860dd7c24c0b56676) 3515 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ab0a670aeef72d808d620bbc33a5e8cd7) 3513 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ab109e8a2fca1324773e2a5777f75c852) 3442 0 R (classParma__Polyhedra__Library_1_1BD__Shape_abe5a9b3a09856b591bf8d94b53d1e673) 3588 0 R (classParma__Polyhedra__Library_1_1BD__Shape_abee6d42dd6f94979bcc7fb3d51102864) 3174 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ab054f67fb31ea4e860dd7c24c0b56676) (classParma__Polyhedra__Library_1_1BD__Shape_ac68574b9eea6918a73dca2ce92a82fd7)]
->> endobj
-20081 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ac7f89b09f6755cdcd97daa3a92522b00) 3182 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aca71bae643870b4a7aaaabbab838c330) 3264 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acaa538c9c00b2f69301365d916bb49e8) 3251 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acad0e332f148041d23f17cdf85b80568) 3584 0 R (classParma__Polyhedra__Library_1_1BD__Shape_accbd8986577794cea90edef63e859ab1) 3510 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ac7f89b09f6755cdcd97daa3a92522b00) (classParma__Polyhedra__Library_1_1BD__Shape_acda762f8c081fed2862260211618fce0)]
->> endobj
-20082 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ace010a880cb8574335f1be294907de89) 3336 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acf4dc2de16f4a54ca03daa6ac1d31ce2) 3330 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acfed8bc19e046453778c9d99d84df283) 3099 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ad09a9ccc89ace499a888b6b1a1f4ce44) 3178 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ad2e535d5b20d25d36b4744da392edf02) 3343 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ace010a880cb8574335f1be294907de89) (classParma__Polyhedra__Library_1_1BD__Shape_ad369744c43a49ebac904bc3e17de0478)]
->> endobj
-20083 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ad80989353ea3738abdb6b605d27cc8fa) 3430 0 R (classParma__Polyhedra__Library_1_1BD__Shape_adbf2609849c95cfb7277df1edc69534f) 3189 0 R (classParma__Polyhedra__Library_1_1BD__Shape_adf3cfc56df68bc8063e6e9eb3d0ad3f1) 3507 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ae0a1b4b4a344cad01c58e8e006a7ff16) 3183 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ae0ba85e8cab7e4e95ec001bde5bdd99d) 3435 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ad80989353ea3738abdb6b605d27cc8fa) (classParma__Polyhedra__Library_1_1BD__Shape_ae61fdcc22d1e0fe43b94194f2eadaa1a)]
->> endobj
-20084 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ae68d61763922cee018cbba3834b2085c) 3503 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ae748c3f5082b158453fbb3ccf57c8f70) 3571 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aeda87d46bc3b54b420a475934e0e1cb6) 3506 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aedabe8ecd0866b972e97709e17f94681) 3102 0 R (classParma__Polyhedra__Library_1_1BD__Shape_af0d016bccf8f6a9323cdbd4743003eb2) 3586 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ae68d61763922cee018cbba3834b2085c) (classParma__Polyhedra__Library_1_1BD__Shape_afa8a10ff4b09f8a87e3c558a39f5888e)]
->> endobj
-20085 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BD__Shape_afaa5d6b3c1b3b83161b619c28c5f9936) 3190 0 R (classParma__Polyhedra__Library_1_1BD__Shape_afd263c6cdcbb67035989078c9058bb19) 3674 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) 1204 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a35ea0c10995c89f8a11a2e8bb5dc7f17) 4141 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a5ebec8f5ff32009c4cf98dead90f4a3c) 4135 0 R (classParma__Polyhedra__Library_1_1BHRZ03__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_afaa5d6b3c1b3b83161b619c28c5f9936) (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a67b4e0eba7692bced073431cd3cc22ae)]
->> endobj
-20086 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a6ab41afc79135511037718442fcad4d4) 4138 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a97b2101d371edae52746a53cf34e4b67) 4137 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_af2ec3c62388f9aef1414a527e82cd1a7) 4136 0 R (classParma__Polyhedra__Library_1_1Binary__Operator) 1719 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Common) 1720 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Co [...]
-/Limits [(classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a6ab41afc79135511037718442fcad4d4) (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a35b06cfa8331827b55846da95b222287)]
->> endobj
-20087 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Binary__Operator__Common_a5621564b142adc0eaee14971b379084c) 4159 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Common_aa26b7ac0a5822f668664afb29033b4e0) 4158 0 R (classParma__Polyhedra__Library_1_1Box) 772 0 R (classParma__Polyhedra__Library_1_1Box_a04732c1c89db2f6d76b3b9479ec2fb99) 4322 0 R (classParma__Polyhedra__Library_1_1Box_a055f3030915a1b7de0cc50761d9a3245) 4319 0 R (classParma__Polyhedra__Library_1_1Box_a06c2ce3f0789aba0294da4 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Binary__Operator__Common_a5621564b142adc0eaee14971b379084c) (classParma__Polyhedra__Library_1_1Box_a06c2ce3f0789aba0294da43628b50226)]
->> endobj
-20088 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a070e05c80af78d7c91bee958b9848080) 4565 0 R (classParma__Polyhedra__Library_1_1Box_a0acf30ed848cc95eb3c888c0e16952ec) 4328 0 R (classParma__Polyhedra__Library_1_1Box_a0cb0abcc152d2d7c95a116efd3ea989a) 4626 0 R (classParma__Polyhedra__Library_1_1Box_a0fc52076243c0da6c56397ae37cd5194) 4633 0 R (classParma__Polyhedra__Library_1_1Box_a1039be5680ea8eceb903367e1e7aa13f) 4398 0 R (classParma__Polyhedra__Library_1_1Box_a108121fbb775ce12e17480900dc32 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a070e05c80af78d7c91bee958b9848080) (classParma__Polyhedra__Library_1_1Box_a108121fbb775ce12e17480900dc32516)]
->> endobj
-20089 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a1089c9be5304fd1f8bba20e462be1528) 4721 0 R (classParma__Polyhedra__Library_1_1Box_a13a65e37276cb17bf0f92c33e4d135fa) 4722 0 R (classParma__Polyhedra__Library_1_1Box_a15090c11a17afcd60289117320991a0a) 4238 0 R (classParma__Polyhedra__Library_1_1Box_a161c87c94b78fd1111365e185d0a3ae7) 4493 0 R (classParma__Polyhedra__Library_1_1Box_a17182f3f0d9242d5821ba59b2773ae55) 4499 0 R (classParma__Polyhedra__Library_1_1Box_a1d20ad17015746b2d9e0290631fc1 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a1089c9be5304fd1f8bba20e462be1528) (classParma__Polyhedra__Library_1_1Box_a1d20ad17015746b2d9e0290631fc175b)]
->> endobj
-20090 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a21711374269e4bc42c158e233fd8d384) 4566 0 R (classParma__Polyhedra__Library_1_1Box_a2206a2c7921d483451f7e2366f0f8166) 4560 0 R (classParma__Polyhedra__Library_1_1Box_a22f9ceb879f1c8d892f60fb3d9577d81) 4413 0 R (classParma__Polyhedra__Library_1_1Box_a286412c3f05e82abdf69c5e5562ff949) 4312 0 R (classParma__Polyhedra__Library_1_1Box_a2e233c23c81273bd776c73cff35ec60e) 4557 0 R (classParma__Polyhedra__Library_1_1Box_a2ebf93b52454102cd99eaa211ad6f [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a21711374269e4bc42c158e233fd8d384) (classParma__Polyhedra__Library_1_1Box_a2ebf93b52454102cd99eaa211ad6ff71)]
->> endobj
-20091 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a2ece0bdf729fb3120ccc49ba616371ad) 4628 0 R (classParma__Polyhedra__Library_1_1Box_a2f964d43c2798bde1924e82d88971ea2) 4394 0 R (classParma__Polyhedra__Library_1_1Box_a30fb611cd3b23f903e1b5f285c238c38) 4631 0 R (classParma__Polyhedra__Library_1_1Box_a319084c6ac93db482a8742a58e2e01f3) 4228 0 R (classParma__Polyhedra__Library_1_1Box_a3271b453d7283448ee3b26406f027c41) 4718 0 R (classParma__Polyhedra__Library_1_1Box_a339a341a2f7d60de83e4feb3e8986 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a2ece0bdf729fb3120ccc49ba616371ad) (classParma__Polyhedra__Library_1_1Box_a339a341a2f7d60de83e4feb3e8986558)]
->> endobj
-20092 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a36a9d0801d846225758faab4be3cc7e4) 4635 0 R (classParma__Polyhedra__Library_1_1Box_a36e39f75a5b973533a044d606444db4f) 4332 0 R (classParma__Polyhedra__Library_1_1Box_a389e6681289ba2b90a1eaad6eff80a50) 4243 0 R (classParma__Polyhedra__Library_1_1Box_a3a1140c13e71533dd97cc2406cb8fd79) 4632 0 R (classParma__Polyhedra__Library_1_1Box_a3c827da439e915a61c30e404828e8d32) 4327 0 R (classParma__Polyhedra__Library_1_1Box_a3c8e578089e8420dc286b27411fde [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a36a9d0801d846225758faab4be3cc7e4) (classParma__Polyhedra__Library_1_1Box_a3c8e578089e8420dc286b27411fde2fd)]
->> endobj
-20093 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a3d107d8f8a78a3925031545c8e1d1a73) 4503 0 R (classParma__Polyhedra__Library_1_1Box_a3daaa36a6bf749e0b4d66ce57878e2d0) 4490 0 R (classParma__Polyhedra__Library_1_1Box_a3f2210364b954a8d532905d09bcb7149) 4244 0 R (classParma__Polyhedra__Library_1_1Box_a40ab06947d065a171792da1ce6ed2505) 4396 0 R (classParma__Polyhedra__Library_1_1Box_a4aa52c6b939cf0076740afb33dd454e5) 4564 0 R (classParma__Polyhedra__Library_1_1Box_a4cd79f95aeca1043d5e56dcc194bf [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a3d107d8f8a78a3925031545c8e1d1a73) (classParma__Polyhedra__Library_1_1Box_a4cd79f95aeca1043d5e56dcc194bf096)]
->> endobj
-20094 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a4e6787c98290a49ce80b90c008aac5a8) 4621 0 R (classParma__Polyhedra__Library_1_1Box_a50155ea93e900c22ab4251298fa70bb0) 4625 0 R (classParma__Polyhedra__Library_1_1Box_a507389e04ae54928ad21bae9f8caf354) 4713 0 R (classParma__Polyhedra__Library_1_1Box_a5307e5cfaad0770ede6799ad31962d71) 4401 0 R (classParma__Polyhedra__Library_1_1Box_a5418f668bf3b5a8590ac6d5d483d5ea3) 4709 0 R (classParma__Polyhedra__Library_1_1Box_a54ee0d81e7047f0c89c29fd63af3b [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a4e6787c98290a49ce80b90c008aac5a8) (classParma__Polyhedra__Library_1_1Box_a54ee0d81e7047f0c89c29fd63af3b778)]
->> endobj
-20095 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a5659d55fb93c1fe31b82a674e2630c13) 4622 0 R (classParma__Polyhedra__Library_1_1Box_a573ac186b0da77408bcb80531ca0090c) 4329 0 R (classParma__Polyhedra__Library_1_1Box_a5f1ce9b2af5f6ba550cd9080ff83077c) 4229 0 R (classParma__Polyhedra__Library_1_1Box_a685232ed211cce61f5d27727d979df94) 4486 0 R (classParma__Polyhedra__Library_1_1Box_a6919ec5aef8459ad9c65bc36e8100d58) 4554 0 R (classParma__Polyhedra__Library_1_1Box_a6d2f7819b7359865679b24e683231 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a5659d55fb93c1fe31b82a674e2630c13) (classParma__Polyhedra__Library_1_1Box_a6d2f7819b7359865679b24e683231303)]
->> endobj
-20096 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a6d5097ef9a821f98cb97571eb52a49aa) 4555 0 R (classParma__Polyhedra__Library_1_1Box_a6f66ccd85fdb7cc3afdfe9a9eec33805) 4630 0 R (classParma__Polyhedra__Library_1_1Box_a70638e55ff0529f6f481db703645be05) 4317 0 R (classParma__Polyhedra__Library_1_1Box_a7321e2cdc1f62423eef211a89ff5a93d) 4629 0 R (classParma__Polyhedra__Library_1_1Box_a736577ec65f40b0637f13486e64f051a) 4409 0 R (classParma__Polyhedra__Library_1_1Box_a7a1255c5cac46f6115750121e9713 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a6d5097ef9a821f98cb97571eb52a49aa) (classParma__Polyhedra__Library_1_1Box_a7a1255c5cac46f6115750121e97136e6)]
->> endobj
-20097 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a7ded037fa4c26b2e12565d3aa2c6b70b) 4246 0 R (classParma__Polyhedra__Library_1_1Box_a7e1a00f36570e89ee95817d898587743) 4313 0 R (classParma__Polyhedra__Library_1_1Box_a7fff251a8cd2ecd8b928175af94d7069) 4245 0 R (classParma__Polyhedra__Library_1_1Box_a818b1050a44c6fb4d635a6fc088eeeca) 4232 0 R (classParma__Polyhedra__Library_1_1Box_a84d340c4e2a8a35e81d0fb91ff2c466e) 4233 0 R (classParma__Polyhedra__Library_1_1Box_a857138d532c5352b43623e6b5e5a6 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a7ded037fa4c26b2e12565d3aa2c6b70b) (classParma__Polyhedra__Library_1_1Box_a857138d532c5352b43623e6b5e5a629b)]
->> endobj
-20098 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a87e906459b095e23114ee8f0025086cb) 4488 0 R (classParma__Polyhedra__Library_1_1Box_a88ea295438ef6e62d77b24c099f2b9c0) 4240 0 R (classParma__Polyhedra__Library_1_1Box_a8e45baf04a16a09cfa25bac864515832) 4330 0 R (classParma__Polyhedra__Library_1_1Box_a901382835b88fb9969d88eea101ae7cf) 4315 0 R (classParma__Polyhedra__Library_1_1Box_a90cc17398be6745eb507339397381d7a) 4397 0 R (classParma__Polyhedra__Library_1_1Box_a929caef76be87459ac964105f4c75 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a87e906459b095e23114ee8f0025086cb) (classParma__Polyhedra__Library_1_1Box_a929caef76be87459ac964105f4c75cf4)]
->> endobj
-20099 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a92ef9a99d160f55e3fc44a4bd1ae78f2) 4408 0 R (classParma__Polyhedra__Library_1_1Box_a944e2c41213d3ea40e74930a90de97bf) 4412 0 R (classParma__Polyhedra__Library_1_1Box_a96038eb89649898faa9a4355206b72d3) 4552 0 R (classParma__Polyhedra__Library_1_1Box_a9de293fc5ed59d0122ccd78839b1a668) 4321 0 R (classParma__Polyhedra__Library_1_1Box_a9e6044d3d1b8cd66b7e150763a0cce2a) 4236 0 R (classParma__Polyhedra__Library_1_1Box_a9ff61047ef1f0f33fe206ab471aa4 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a92ef9a99d160f55e3fc44a4bd1ae78f2) (classParma__Polyhedra__Library_1_1Box_a9ff61047ef1f0f33fe206ab471aa4025)]
->> endobj
-20100 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_a9ffb692c7f3bd8af9b81135e38b38dd7) 4399 0 R (classParma__Polyhedra__Library_1_1Box_aa366a38561684a64bc0a042702534a07) 4406 0 R (classParma__Polyhedra__Library_1_1Box_aa50c3a8544e3182f11f4b971c2b185e6) 4634 0 R (classParma__Polyhedra__Library_1_1Box_aaba1e38f6fda99261ed2bd61ec99e369) 4714 0 R (classParma__Polyhedra__Library_1_1Box_aac61a0c0f3a687ef1d79d9014238554c) 4227 0 R (classParma__Polyhedra__Library_1_1Box_aace7b1f85601837554656295b9c90 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a9ffb692c7f3bd8af9b81135e38b38dd7) (classParma__Polyhedra__Library_1_1Box_aace7b1f85601837554656295b9c90dce)]
->> endobj
-20101 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_aacf7b2a7e0bb5007ce8cd9506d06137d) 4405 0 R (classParma__Polyhedra__Library_1_1Box_ab34fdd45afee329b70aa329b05ecab5b) 4556 0 R (classParma__Polyhedra__Library_1_1Box_ab4addfca3eaf252964b09cb03b12f701) 4711 0 R (classParma__Polyhedra__Library_1_1Box_ab4b097033191e38bbb59add2ebba3e70) 4241 0 R (classParma__Polyhedra__Library_1_1Box_ab76731fc33f60619d339fd146af90e7f) 4226 0 R (classParma__Polyhedra__Library_1_1Box_ab81be8ef47b7e0e260d2d9a361eb6 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_aacf7b2a7e0bb5007ce8cd9506d06137d) (classParma__Polyhedra__Library_1_1Box_ab81be8ef47b7e0e260d2d9a361eb6e8b)]
->> endobj
-20102 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_ab85f80c281c840eedb4f228757b8515a) 4407 0 R (classParma__Polyhedra__Library_1_1Box_aba476c1ff2b0f1cd58f6e76b981cafac) 4563 0 R (classParma__Polyhedra__Library_1_1Box_abb6e0e38bda55fc988819da21f2689eb) 4395 0 R (classParma__Polyhedra__Library_1_1Box_abd0fb1fa2293b2ca367d1ba5eba12106) 4487 0 R (classParma__Polyhedra__Library_1_1Box_abd266a7d827fb77e09de63dfea2f9d58) 4498 0 R (classParma__Polyhedra__Library_1_1Box_abd6b88d6fd6e0259faa544106b08a [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_ab85f80c281c840eedb4f228757b8515a) (classParma__Polyhedra__Library_1_1Box_abd6b88d6fd6e0259faa544106b08aeaa)]
->> endobj
-20103 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_abe59d09769e8f4ee38d79b45a6295756) 4558 0 R (classParma__Polyhedra__Library_1_1Box_abeb3e0b3cafb96de2ab53e985c574bb7) 4235 0 R (classParma__Polyhedra__Library_1_1Box_abf26ba6f468ba6cfd016cf8b8ca51b92) 4719 0 R (classParma__Polyhedra__Library_1_1Box_ac5eb33b72a86a33d7ae4685d376b50a6) 4404 0 R (classParma__Polyhedra__Library_1_1Box_ac72c231542712976d1f9223d0537f5d5) 4234 0 R (classParma__Polyhedra__Library_1_1Box_ac86971c152fbb8d2d486d7396ad6b [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_abe59d09769e8f4ee38d79b45a6295756) (classParma__Polyhedra__Library_1_1Box_ac86971c152fbb8d2d486d7396ad6b142)]
->> endobj
-20104 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_ac8a2f81fc1c5b99600d406300792119f) 4310 0 R (classParma__Polyhedra__Library_1_1Box_acbf26ad2a67dbfbd24eb9c89448a793b) 4163 0 R (classParma__Polyhedra__Library_1_1Box_acddbfcdd0e7dd70c2258493ef67d0911) 4242 0 R (classParma__Polyhedra__Library_1_1Box_ace7b6bb6c1aabdf57f1643e88a834aac) 4333 0 R (classParma__Polyhedra__Library_1_1Box_ad02ce2da26b1d9dcd0d45042b9f5c3e5) 4237 0 R (classParma__Polyhedra__Library_1_1Box_ad303b49ba5f16febd5aba07ba6d1b [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_ac8a2f81fc1c5b99600d406300792119f) (classParma__Polyhedra__Library_1_1Box_ad303b49ba5f16febd5aba07ba6d1b656)]
->> endobj
-20105 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_ad9dba7a094763a47be44e246c1120fa7) 4492 0 R (classParma__Polyhedra__Library_1_1Box_adcd50fc4fa1b8e5533d7af0513d1a833) 4231 0 R (classParma__Polyhedra__Library_1_1Box_addca3baab772ce17fb5133b0c4e60c33) 4323 0 R (classParma__Polyhedra__Library_1_1Box_ae02fa938635a4847617bc270ce5d61f1) 4710 0 R (classParma__Polyhedra__Library_1_1Box_ae0cdf58c61934d284e497bb509596fde) 4239 0 R (classParma__Polyhedra__Library_1_1Box_ae1509738a054a1ffeb070a35c41db [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_ad9dba7a094763a47be44e246c1120fa7) (classParma__Polyhedra__Library_1_1Box_ae1509738a054a1ffeb070a35c41db257)]
->> endobj
-20106 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_ae51d28e968849dc1fc4ac29475dd89d1) 4720 0 R (classParma__Polyhedra__Library_1_1Box_ae627d4ce07125a5bf6dbe4c4464bfacf) 4230 0 R (classParma__Polyhedra__Library_1_1Box_ae70fafb10013762e436a434564d7e931) 4491 0 R (classParma__Polyhedra__Library_1_1Box_ae862a635387c2458da51889c20465f0c) 4410 0 R (classParma__Polyhedra__Library_1_1Box_ae8b96392adb007f1c59758cba8cbc886) 4501 0 R (classParma__Polyhedra__Library_1_1Box_aeb7acbeca4ad92485f92bf3ea7bcc [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_ae51d28e968849dc1fc4ac29475dd89d1) (classParma__Polyhedra__Library_1_1Box_aeb7acbeca4ad92485f92bf3ea7bcc60c)]
->> endobj
-20107 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_aec5e83677f965ea4672262477c3e9737) 4715 0 R (classParma__Polyhedra__Library_1_1Box_af0b5a67b4316f5fabc76dddc85e01f95) 4627 0 R (classParma__Polyhedra__Library_1_1Box_af3171c1a2a80a801ffef9d620bbe1eb9) 4559 0 R (classParma__Polyhedra__Library_1_1Box_af5edabe0fbfa14196208041ded356c65) 4561 0 R (classParma__Polyhedra__Library_1_1Box_af623edfed6d4816ac5573f42a6a1e801) 4326 0 R (classParma__Polyhedra__Library_1_1Box_afb683aefdda7a1c5dcf92ee2a03da [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_aec5e83677f965ea4672262477c3e9737) (classParma__Polyhedra__Library_1_1Box_afb683aefdda7a1c5dcf92ee2a03daf81)]
->> endobj
-20108 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Box_afcfef0ae2edb80d19b21b211f7523971) 4311 0 R (classParma__Polyhedra__Library_1_1Box_afd20bc6142cb1206b51b0b449ebf4273) 4502 0 R (classParma__Polyhedra__Library_1_1Box_afe3a91955f4b6b81c8572e60b3e263dc) 4402 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) 1780 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a0ec1eb879aa24c8e3f8b9abc08a51f27) 6720 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__i [...]
-/Limits [(classParma__Polyhedra__Library_1_1Box_afcfef0ae2edb80d19b21b211f7523971) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1ddeb95722df9e5f35009c6e017e2404)]
->> endobj
-20109 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1e45c485643b62ed4d751fd0bfaa3677) 6723 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a2c9678fbda42018549d63c11e4c806a6) 6712 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a412d0108a72eca07f0075f7a60662e34) 6718 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a4db44a79e5e6eea466723a565634b017) 6725 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__it [...]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1e45c485643b62ed4d751fd0bfaa3677) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_abed774daa9ed3c470c7fd237bf40e28c)]
->> endobj
-20110 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) 6721 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac8af5985d99461f4c7d765a67da5f02c) 6714 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_acade7cd192977aa0b43a42bbaafe1c27) 6722 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ad9a4e7c1648f42300ec153db346dffb2) 6709 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__it [...]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_adf87eef74d0ff9ff35e15aeea0a361c7)]
->> endobj
-20111 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) 6713 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_aef8ddf62527c76662e377fdc9b46b928) 6719 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) 1899 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a150a3fcf4b23e91a58c5acb8a455fec2) 11029 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ba31de49e0fcff11975c0e8670269b9) 11025 0 R (c [...]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ffe9c9777d454e5bc5d0ad41887ae8c)]
->> endobj
-20112 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a27ebe448697b1357cb06c60b471f4045) 11020 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a64ca0878a1f4a3c338b920ecb7c56c4e) 11026 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a701efa51459fa5353f1620f9a1524f52) 11030 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a939f1c932a39f3ac0d579352534ee0d8) 11031 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aa29c608bc5c4c8d0b1d42da [...]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a27ebe448697b1357cb06c60b471f4045) (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aadf870c4d6fea9b5650aa888c2e79ca2)]
->> endobj
-20113 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab18c32ab9d8e6a7fc785165b6aa4db56) 11028 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab331b1dede4f6e83d3eefb864929a9d9) 11024 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad4a1398505beae32e88bdc66625dcf92) 11035 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad9420cd4a63cbe1e155a94a8064f86b5) 11021 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae432dca61c738591a5c53f1 [...]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab18c32ab9d8e6a7fc785165b6aa4db56) (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae6ce7cc93a11ff81885948a776dd0e56)]
->> endobj
-20114 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae8f1b6153c04bde0aac8592ff6edbe36) 11032 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_af7e70970808607a85d1daa4548c400d9) 11036 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron) 768 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a09726be54fe2a591787de59eeffdd2ea) 5199 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a2b220dabc613a89a062968101429e58c) 5201 0 R (classParma__Polyhedra__Library_1_1C__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae8f1b6153c04bde0aac8592ff6edbe36) (classParma__Polyhedra__Library_1_1C__Polyhedron_a2d68c082ea8fcddda6aa41afdd7ab476)]
->> endobj
-20115 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1C__Polyhedron_a33d58476db85f48e4ad680c69bca524f) 5140 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a4b841053fdf5718c17a018ff650b550a) 5139 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a59d06e9b429faef7a632d58e4a0b12bd) 5197 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a5eb7f86790ada6549123a0225d68a4de) 5212 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a6424da8931d774f6a2e403c1e2f0d09a) 5200 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_a33d58476db85f48e4ad680c69bca524f) (classParma__Polyhedra__Library_1_1C__Polyhedron_a6f581bf46ab0488f444977453ba2ea2d)]
->> endobj
-20116 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) 5209 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a8a6c3f01edb04382620066f17b63b20c) 5203 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a9720487deabf813a31afd4e9cfe695aa) 5206 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a9eb55b3f27138d74d5002cc9782fd381) 5207 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_ac3126925bcd3349b150771d52c19639d) 5205 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) (classParma__Polyhedra__Library_1_1C__Polyhedron_ac86d25d06285c9a2e890770fed084574)]
->> endobj
-20117 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) 5202 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_ae46f7a91b9fac1a62ef875ec5c72aab6) 5204 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_afaae25a26dbecf9341c7fb2c2575f81f) 5211 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) 1230 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a22e9347af75b6aac3d63edecff007a34) 5330 0 R (classParma__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a2c0a4ef9e072d80fed2be806ed3eb825)]
->> endobj
-20118 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a311e87a81daa4ca81dfb5ff62bd29b0f) 5299 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a56648c2436a8c8b290e54ff23a69d7a9) 5298 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_ac2aa68157ca89c0b63725c3efcdd9200) 5328 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_ae1df79fdf94dd23fac62d57fe0681842) 5313 0 R (classParma__Polyhedra__Library_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a311e87a81daa4ca81dfb5ff62bd29b0f) (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_aef498310bbb162748eb0cc7c1bb07fd8)]
->> endobj
-20119 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Cast__Operator) 1721 0 R (classParma__Polyhedra__Library_1_1Cast__Operator__Common) 1722 0 R (classParma__Polyhedra__Library_1_1Checked__Number) 1723 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a009f1dc78c8b168cb2256481169157ac) 5384 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a00f887bfb5c61faba29a67def563c786) 5504 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a01655d2b2c4a079c9474d9072891e007) 5453 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Cast__Operator) (classParma__Polyhedra__Library_1_1Checked__Number_a01655d2b2c4a079c9474d9072891e007)]
->> endobj
-20120 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a02949da26a3761489d2fb98018010990) 5548 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a04f1fafc7f28579ed19eea062a2b13c0) 5653 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a0673c1c20598ea950f352d2d5ea2689c) 5786 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a06c0a4ba25cbc3d59797bf1c73c49497) 5590 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a0803532e7523865597c394e1371d2b16) 5591 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a02949da26a3761489d2fb98018010990) (classParma__Polyhedra__Library_1_1Checked__Number_a0a674e95cda0698184161e3e009aa570)]
->> endobj
-20121 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a0edbf435f928c1702dc879bc4862bbf8) 5555 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a164f8732d5fe6b526a34e168145a95ad) 5495 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a1a79ab4c49d7ae4406b56dc2b3d94463) 5557 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a1b71d709b44273380a21cd197d3ebb85) 5715 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a1bdc1023fb4478270594d0e965eb90c9) 5443 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a0edbf435f928c1702dc879bc4862bbf8) (classParma__Polyhedra__Library_1_1Checked__Number_a1c255ab3c82434e261f010d0590810c0)]
->> endobj
-20122 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a1ccbc462776ddeb1052d4c4fb35da65a) 5655 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a1e526c2cec217592b49a1636bd5f497d) 5595 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a2024878c4c26cb836d454e2e93f40c8f) 5439 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a249c56a7ba2a6ad434338028cbdd00fc) 5654 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a24e90bb8bb38d248aca79c76a1717d9d) 5457 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a1ccbc462776ddeb1052d4c4fb35da65a) (classParma__Polyhedra__Library_1_1Checked__Number_a257a415453078f71a54d6d0b3b57ff4d)]
->> endobj
-20123 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a262ceb2e6dc438920274528c8d324344) 5661 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a26483f6bea8469aa377bf4a8fa77f64d) 5763 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a268aa30d717cdc7d07e60cf7c56712e6) 5505 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a298300b8f88eb674c317b99ad09a474b) 5438 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a339b5de27c5e23c9ac925b0a7f5bedcd) 5764 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a262ceb2e6dc438920274528c8d324344) (classParma__Polyhedra__Library_1_1Checked__Number_a33a5462cd5398fdbd61989d17aeeaa72)]
->> endobj
-20124 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a3cb9b031ec4e6fd7e53e53da5b0f04a1) 5588 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a3dc4a1fb95b9f86f622fbe557265f85d) 5547 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a3f0416bda0c321489e3eb1fdad315c2c) 5558 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a3f13c2c23ad04a1ca900396fc27d0150) 5652 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a404beea19c04f4e7bbcfe81aae0d6a7d) 5450 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a3cb9b031ec4e6fd7e53e53da5b0f04a1) (classParma__Polyhedra__Library_1_1Checked__Number_a45a8595dfc15e72d28fd31b5f4561bdd)]
->> endobj
-20125 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a461dbfcb8f68886137794e4a408fc55e) 5444 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a4ab8f30000aaa8dd4ee1d92dc1afc37e) 5599 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a4b2839dbccb2736dccbb58b0e589b5e3) 5781 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a4bed59d493c4fd91537602efb267c938) 5436 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a4bffbfaa7f512a0a886493a1a057b135) 5503 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a461dbfcb8f68886137794e4a408fc55e) (classParma__Polyhedra__Library_1_1Checked__Number_a4ce2f9170fb3470ba10d87607c3c0bf3)]
->> endobj
-20126 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a4f3206ab2d3c47e2014e5b306167c7c0) 5440 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a5371b59fd606148bacb3cd9ec41c5306) 5660 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a53e464cc638472234a399bfcc3fb4fd9) 5755 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a55e9dfdf5da9a55b7523bda6b7f56c78) 5458 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a589cc1d8001fd57ded3f964928e66738) 5549 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a4f3206ab2d3c47e2014e5b306167c7c0) (classParma__Polyhedra__Library_1_1Checked__Number_a5a4741faa2f2e8ebf45ed4e3cc044fe6)]
->> endobj
-20127 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a5d0001ad77e62cf77498a9504d793c61) 5722 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a5dcbfe8e54c7b465495bc71274c62a98) 5757 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a5dee740c35d52d07415f0ba91e15b648) 5725 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a610ebadc0a8c71ad8575ea198e800655) 5656 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a627ac77a4752fde3c10792ee9f1673a4) 5506 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a5d0001ad77e62cf77498a9504d793c61) (classParma__Polyhedra__Library_1_1Checked__Number_a65b1cc4ac0c0c8a2efcbf3d36d4ac0ac)]
->> endobj
-20128 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a6957dba3dbf92459a364893d7ecfb897) 5446 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6a2d561ac8088ed64a0bb51d8fffcd9b) 5554 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6afe848ad84ff68d48142caf0599760a) 5501 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6b608bb6b2030aafbc57964f63f9a6de) 5779 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6e4e84f9ccaf35d6c56acc6c6c3de53c) 5550 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a6957dba3dbf92459a364893d7ecfb897) (classParma__Polyhedra__Library_1_1Checked__Number_a7148f41de04826e832fe479a0e859f46)]
->> endobj
-20129 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a7341b0f373b6f29aabb059318c838dd0) 5762 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a749193ffeb01c2c18a87d7f2965d5dc5) 5600 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a74af0786f5787a7f7db0a2b6232e56a9) 5716 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a74b0a8cfdec7831e7a3e296b3e3751dd) 5445 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a77a2c5c27e9c0838fea6e6447b20c320) 5449 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a7341b0f373b6f29aabb059318c838dd0) (classParma__Polyhedra__Library_1_1Checked__Number_a79f64d099a652834da74cc8fd68f2452)]
->> endobj
-20130 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a7a8a423b9e5236053b363400e7789fad) 5784 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a7c476dda1d63f9a52caece85a3a905d1) 5759 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a7c68cdeac59035fabf1603a87f313f66) 5718 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a7ce6dfd81e04c3eb8d196bf13a96ebe6) 5551 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a7e4efb96f10ef03b316495c90ae4313d) 5717 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a7a8a423b9e5236053b363400e7789fad) (classParma__Polyhedra__Library_1_1Checked__Number_a7f00bb47581722220814a6a59803e255)]
->> endobj
-20131 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a80f6de87ec43c33fac3832b14a507c0b) 5437 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a8772f767006f16e376d8eca9b1578b73) 5510 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a8abdf2e292960e1fb216ce3c2c0816ff) 5491 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a91459c49e4f7d7fc2dea0347e0489ce5) 5502 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a91dd10f097f76e4ffba7e5760368a526) 5596 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a80f6de87ec43c33fac3832b14a507c0b) (classParma__Polyhedra__Library_1_1Checked__Number_a93329bd6701b72b26d8336d090f04c86)]
->> endobj
-20132 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a98dae78cdd16f7127a4b3e18c3976562) 5496 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a9d2cd0aa9626fd28ec99bde5bff4c020) 5454 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aa03c7854d954ddbffa13a2aca58f22d0) 5724 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aa0952cbf70240edacf4abd0f460f98c0) 5601 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aa27860086ead05da8ac152dbd2d6fabe) 5783 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a98dae78cdd16f7127a4b3e18c3976562) (classParma__Polyhedra__Library_1_1Checked__Number_aa3de5a2fe7f06d0aa3e4972be2023933)]
->> endobj
-20133 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_aa49993578916331f71d60ff1b9a3951d) 5782 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aa5caf9c1465a76332b9b809a1bf9f9a2) 5714 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aaf7ee24b1de8cacef61bc37c4d280bd6) 5780 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aafe0bdaacef3657f8ed1368c3d1f374a) 5552 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab19be1f26efb21370e8460b325a7f57c) 5499 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_aa49993578916331f71d60ff1b9a3951d) (classParma__Polyhedra__Library_1_1Checked__Number_ab2c74f72a54a0b6a18906c124de256a9)]
->> endobj
-20134 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_ab45faf2ccad8057c7b27e0c999eb063b) 5507 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab4d4a0ebee3fcc93490aa029028a810b) 5442 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab65c6e56b8c876fadd996e950403e318) 5760 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab74908b692bc6f8112f5d27b96141431) 5385 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab75c0e7d52f4b166574fa66584ce92e4) 5556 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ab45faf2ccad8057c7b27e0c999eb063b) (classParma__Polyhedra__Library_1_1Checked__Number_abdf3631e599e5641e1fea94cfd46a3a2)]
->> endobj
-20135 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_abe7d7a2cba56d2668ac3306afeb98e38) 5598 0 R (classParma__Polyhedra__Library_1_1Checked__Number_abf60cc7fa60d33c4fe958126d55cbac2) 5448 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ac0ef828e81a5c7625db3abadcafc8438) 5383 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ac8b0427ab092068fffe6c4db194e9602) 5553 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aca7c785640663dd43199b6f4c9262b99) 5452 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_abe7d7a2cba56d2668ac3306afeb98e38) (classParma__Polyhedra__Library_1_1Checked__Number_acca11ef67e39b711f96604b6bf806feb)]
->> endobj
-20136 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_aceae8deb3688022d007eec835d772695) 5719 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ada0964a53a3426e1fc35355ed38a235c) 5451 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ade1c60421ba77dae4f75a2bf42e8511d) 5597 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ade4a2cd219350c0e41006c642f27bbd1) 5593 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ade4a5582f82333f20fd6a8be13ff8d7f) 5589 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_aceae8deb3688022d007eec835d772695) (classParma__Polyhedra__Library_1_1Checked__Number_ae0c5fe9f35e5e632c14c559b3f8b4723)]
->> endobj
-20137 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_ae14ac67511e816b1a2f336a54695cddb) 5508 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ae15725ff36519df514dce8b2a52c8f9e) 821 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ae4cfb147e2773008ad585185d07e1b79) 5659 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aefab59adcb013d5714004cd6b196483e) 5650 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af0647cd431d30a9658d4bdc77e32d9e4) 5498 0 R (classParm [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ae14ac67511e816b1a2f336a54695cddb) (classParma__Polyhedra__Library_1_1Checked__Number_af1faacdc4d1bd9cc6efa3df48b9ab40d)]
->> endobj
-20138 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_af3c2c2bca173e0697358e9c76afd4a60) 5658 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af47ee9cf59cfac8a346660698c61d113) 5447 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af5e8cc3b25cdc1ef3e37bb82a4e8c7c8) 822 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af9d7eaecf113e25020c55ed0bf79eb03) 5492 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af9daca45c3c1d0d1afd57ab47c6cacd4) 5497 0 R (classParm [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_af3c2c2bca173e0697358e9c76afd4a60) (classParma__Polyhedra__Library_1_1Checked__Number_afad3fbdebb1ba319083c56fa2ae679e6)]
->> endobj
-20139 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Checked__Number_afb84ec3fc2c8fedbb685c29bbdc7f3a8) 5723 0 R (classParma__Polyhedra__Library_1_1Checked__Number_afc3e3bc6e3d2c5b002d930b32b9631bd) 5720 0 R (classParma__Polyhedra__Library_1_1Checked__Number_afcb46dd5c0701130f067f577f99ef27f) 5456 0 R (classParma__Polyhedra__Library_1_1Checked__Number_afcba1dd5e579752d6dcc40ef4d5799b8) 5382 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression) 1774 0 R (classParma__Polyhedra__Library_1_1Con [...]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_afb84ec3fc2c8fedbb685c29bbdc7f3a8) (classParma__Polyhedra__Library_1_1Concrete__Expression__Common)]
->> endobj
-20140 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a603e2a97c5ea7e4e81bad4464a9aba2b) 6085 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a6ceeebd94402797c5ad4a69f8bb73bcf) 6088 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a9eeea4961725654dcc5f4526fa729df1) 6087 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_aa1ae2d642bd66d32f64b708c28fbf044) 6084 0 R (classParma__Polyhedra__Library_1_1Concrete__Express [...]
-/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a603e2a97c5ea7e4e81bad4464a9aba2b) (classParma__Polyhedra__Library_1_1Concrete__Expression__Type)]
->> endobj
-20141 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a0c0e22bb6388967d928cb6cde46b9196) 6112 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1558ce3303b13a4d17df20c2f4d20ada) 6093 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1b95213b929e61be2683bf1d9c220d70) 6114 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a5d1e8bb981043726cc2ffacfdd3c3013) 6094 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Typ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a0c0e22bb6388967d928cb6cde46b9196) (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a722647b9832d183eedcc441913b25edb)]
->> endobj
-20142 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a7d15247c02efb42a971a2cddbd7ff70e) 6121 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_abf158dc171228668bd20a36339b60f10) 6110 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_aef17a5e76a36d74b648706582fd2487d) 6095 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_a307595e3959d8b493eef756efaf0631b) 5999 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_a34ee73e8a [...]
-/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a7d15247c02efb42a971a2cddbd7ff70e) (classParma__Polyhedra__Library_1_1Concrete__Expression_a51da7be45180533a6f05d193a193fde5)]
->> endobj
-20143 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression_a837cb016717cabc430d6309b2d5bd28f) 6000 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_aa13879760b95faeaebfcd40e1723005b) 6001 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_ae9988816fab7d8ef0cae14eab37167fe) 5998 0 R (classParma__Polyhedra__Library_1_1Congruence) 1777 0 R (classParma__Polyhedra__Library_1_1Congruence__System) 1778 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression_a837cb016717cabc430d6309b2d5bd28f) (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator)]
->> endobj
-20144 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a0ac88c873a13c4afa6f99d3d436e13a3) 6925 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a12f3d0ee3885355092a65262f24d46af) 6886 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a192ff11375b59075c9ea19a8c2b5511e) 6922 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a400c02f876d8f4e3f6aef2bfc5fb16cb) 6921 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a0ac88c873a13c4afa6f99d3d436e13a3) (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a97586e332fd16ccf6e7d642bb4bbf83e)]
->> endobj
-20145 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_adca809f9ebacacf70bc610d41bbaff47) 6888 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae575efc6c01c4bf9968c7e27bb94951b) 6920 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae7c03963759dfdb937135a7f99165361) 6885 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_af0ea51d59b5026db43b2edd4cee928ba) 6887 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_adca809f9ebacacf70bc610d41bbaff47) (classParma__Polyhedra__Library_1_1Congruence__System_a0a4f8e3f3469f021594ea9311c21aadd)]
->> endobj
-20146 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a0bf701759fc56f8fb215c273e53b46ae) 6540 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a0dd6aa622dcadcee1746650f8ca164eb) 6536 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a11de7a0cc309058d6aee273d613c9432) 6601 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a1557515cde9d0030743cd45ce2471e0a) 6481 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a1685b5eb65ba36a9e715a8e3344dbcd8) 654 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a0bf701759fc56f8fb215c273e53b46ae) (classParma__Polyhedra__Library_1_1Congruence__System_a1a897aa9f5d0da382de3c8baafba247c)]
->> endobj
-20147 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a20b0080e4a1abdb68ce945191c540b2e) 6607 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a21f1586e66349acf7aa0d70c77f92b60) 6598 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) 6545 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a32012e3b09434b858367d216108e42c6) 6596 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a339fab488002bb5b341e1bb82edee103) 660 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a20b0080e4a1abdb68ce945191c540b2e) (classParma__Polyhedra__Library_1_1Congruence__System_a3fe60e1a76b2a92143004e52ccfcb7c7)]
->> endobj
-20148 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a548ae200545f7d25b875f190b5611368) 6593 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a562fa08178e809398402920e5e674ff8) 6543 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a5c85932f5fb67a78d1faf8165783d5d3) 6542 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a6605130131af1ca6e54f8ce1e71a993b) 6606 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a6e742d7ffa4f4b7037760cf3ebf62348) 659 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a548ae200545f7d25b875f190b5611368) (classParma__Polyhedra__Library_1_1Congruence__System_a705b9ccde802cccb058145896a399b50)]
->> endobj
-20149 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a77c72d8473dc3e9856d7ff6c05ce7b07) 6548 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a7c083d56e96fb1b5bc3c5fb23350f0a2) 6551 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a87998e7258a2c529be20f456ded30c90) 6605 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a8bca7707491a770d78b523ae5570b139) 6479 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a8f66b17d5e71aebc89be0af0e3a4c7df) 655 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a77c72d8473dc3e9856d7ff6c05ce7b07) (classParma__Polyhedra__Library_1_1Congruence__System_a8f78066abbc29188a3dccfad42477aec)]
->> endobj
-20150 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a9d7fe3b07d9e1d35c04fa2d81e32bf34) 6482 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a9e8a61b2b759dde8f65219688548ffaa) 6544 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) 6549 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aa83361b2264ca8ed30599dca32447874) 6603 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) 647 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a9d7fe3b07d9e1d35c04fa2d81e32bf34) (classParma__Polyhedra__Library_1_1Congruence__System_aaf3b18ae83d99811dad22d336a1a117f)]
->> endobj
-20151 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_ab8ae5d861fb56c8ed906f604be7c4f02) 6534 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ac759e2fa9ea2058d86292dc3c5b43a7a) 6533 0 R (classParma__Polyhedra__Library_1_1Congruence__System_acf4cf2f1d8c3e1d339b1eddc94139272) 6484 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ad05bc9046303661aa532423ac5a5c16d) 6546 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ad7c61256a3d02a8f345701bf5eabdf6b) 659 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_ab8ae5d861fb56c8ed906f604be7c4f02) (classParma__Polyhedra__Library_1_1Congruence__System_ae4a4890ceb257496b788e0d31dbf6d7f)]
->> endobj
-20152 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_aea6d543c90be52299d6ffc57fc9ba5d1) 6547 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aeb80e8469483bf1408d49901fee73802) 6483 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aec5860620ae92988c1740dc393064fe7) 6594 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aedf8e546cc63ff0ade5d34cb995beb09) 6608 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aee8ca9a278a53c88ad387a619bc80f27) 653 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_aea6d543c90be52299d6ffc57fc9ba5d1) (classParma__Polyhedra__Library_1_1Congruence__System_af97f2d43a487ec81e040aec36bbc6ebe)]
->> endobj
-20153 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence__System_afefca839fc7b4d2d166e7a1fe6196fd5) 6535 0 R (classParma__Polyhedra__Library_1_1Congruence_a016c2304fe3a1a73988eb83b2ccf1fe9) 6336 0 R (classParma__Polyhedra__Library_1_1Congruence_a07bb90eb18242945afb161e4deadb09e) 6265 0 R (classParma__Polyhedra__Library_1_1Congruence_a0ff04e47054c14b2edf29096ecc95ab7) 6247 0 R (classParma__Polyhedra__Library_1_1Congruence_a11d3ecf7df43ab6f40620de32004f339) 6184 0 R (classParma__Polyhedra__Li [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_afefca839fc7b4d2d166e7a1fe6196fd5) (classParma__Polyhedra__Library_1_1Congruence_a146b211f83e22bd011d3de2e5975073b)]
->> endobj
-20154 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_a29c63b939ed830a0395170835e60beaf) 6268 0 R (classParma__Polyhedra__Library_1_1Congruence_a29c6deef0eb3911adbb08d36a8f0b3f2) 6188 0 R (classParma__Polyhedra__Library_1_1Congruence_a2ca2446f563956eb2b92ddd17e5c0b2c) 6260 0 R (classParma__Polyhedra__Library_1_1Congruence_a2cb39e7c88e9e724e7970d0e953f2c81) 6350 0 R (classParma__Polyhedra__Library_1_1Congruence_a33e6005a1fe40cb202eb619912c25c3c) 6248 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_a29c63b939ed830a0395170835e60beaf) (classParma__Polyhedra__Library_1_1Congruence_a39b6f38fff55dd953ec509b3739dd17d)]
->> endobj
-20155 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_a3c9879f0c9dcb81fe1bbf78828509ef6) 6176 0 R (classParma__Polyhedra__Library_1_1Congruence_a408ca35042312cfb3c8fb63d41ed2bf5) 6351 0 R (classParma__Polyhedra__Library_1_1Congruence_a42e13324ee4f4b86975c282078a646fb) 6174 0 R (classParma__Polyhedra__Library_1_1Congruence_a43983a6ee447e480f8700915bccb4811) 6249 0 R (classParma__Polyhedra__Library_1_1Congruence_a484373d269a31c21efae44a83f8be6f0) 6246 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_a3c9879f0c9dcb81fe1bbf78828509ef6) (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974)]
->> endobj
-20156 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) 6348 0 R (classParma__Polyhedra__Library_1_1Congruence_a584cb5084fe5479b0c373e3d17fe5ffd) 6175 0 R (classParma__Polyhedra__Library_1_1Congruence_a5a207ecd92e9fd8f3b1937a5064746a9) 6258 0 R (classParma__Polyhedra__Library_1_1Congruence_a5f3003416d324720351da9235a0a3802) 6338 0 R (classParma__Polyhedra__Library_1_1Congruence_a6609e54e84d50cd074c2dd65f38b47da) 6189 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) (classParma__Polyhedra__Library_1_1Congruence_a6a24743a95176da13995bb6c17151c9b)]
->> endobj
-20157 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849) 6347 0 R (classParma__Polyhedra__Library_1_1Congruence_a77a4ec4e4b5b11f3ce61f6c6701d8a7d) 6262 0 R (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) 6180 0 R (classParma__Polyhedra__Library_1_1Congruence_a79c648d88214174287e3763b804f4aaf) 6183 0 R (classParma__Polyhedra__Library_1_1Congruence_a844aeb45177c00f4d4ad0755509d9e69) 6178 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849) (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735)]
->> endobj
-20158 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_a94b3624c208219e401569cd289049b38) 6252 0 R (classParma__Polyhedra__Library_1_1Congruence_a95560c356a7aa70cccb41b866a8455c0) 6172 0 R (classParma__Polyhedra__Library_1_1Congruence_a9aa9789183ac22bcb28a092c3e1f804f) 6256 0 R (classParma__Polyhedra__Library_1_1Congruence_aa03b119140132112557907b772102b33) 6185 0 R (classParma__Polyhedra__Library_1_1Congruence_aa948df90fc7880e7e52ceef297ee9bbf) 6349 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_a94b3624c208219e401569cd289049b38) (classParma__Polyhedra__Library_1_1Congruence_aaf7dc46b2cfbd6650ac1d2035d331f15)]
->> endobj
-20159 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_ab45e800217e1c61d8595e2ffc51a83ad) 6171 0 R (classParma__Polyhedra__Library_1_1Congruence_ab6054ead00332969adad17cdf785088b) 6340 0 R (classParma__Polyhedra__Library_1_1Congruence_ab917a480b6afe7e2750aa2862c6783cf) 6259 0 R (classParma__Polyhedra__Library_1_1Congruence_aba7dbedd485eab91821f129132a04723) 6181 0 R (classParma__Polyhedra__Library_1_1Congruence_aba9d8397055aa341d1ffc6702f67e60f) 6264 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_ab45e800217e1c61d8595e2ffc51a83ad) (classParma__Polyhedra__Library_1_1Congruence_ac26379e5f82fd0223682b11b9e052ea5)]
->> endobj
-20160 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_ac53e4323b140cdd4ba1ac96e7204d93a) 6250 0 R (classParma__Polyhedra__Library_1_1Congruence_ad07dc0dabac5685f9db8d9dc11e513f1) 6261 0 R (classParma__Polyhedra__Library_1_1Congruence_ad76648f21279e7e7c852cfc1daa1887f) 6173 0 R (classParma__Polyhedra__Library_1_1Congruence_ad8229aed551687502c5af78a4143254f) 6253 0 R (classParma__Polyhedra__Library_1_1Congruence_adeee840f3313b6050d439dbe5fe2fdd7) 6344 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_ac53e4323b140cdd4ba1ac96e7204d93a) (classParma__Polyhedra__Library_1_1Congruence_ae0c9395c1ac4d96e245be43fcd76424c)]
->> endobj
-20161 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_ae79e04eb36dcf5595f3c664093686c3f) 6179 0 R (classParma__Polyhedra__Library_1_1Congruence_ae96eebded76c559c95910dc233c68f06) 6186 0 R (classParma__Polyhedra__Library_1_1Congruence_aeb05cfafe5dbcb57a7f831180204ef7f) 6170 0 R (classParma__Polyhedra__Library_1_1Congruence_aed38df906a6f7c01305168df91d7d095) 6263 0 R (classParma__Polyhedra__Library_1_1Congruence_aef9838273809d695f9c52a96b37123b6) 6182 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_ae79e04eb36dcf5595f3c664093686c3f) (classParma__Polyhedra__Library_1_1Congruence_af66a2692f29cc03aa773c48a2cc644ab)]
->> endobj
-20162 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Congruence_afcf86304f17dc474e1e5bbe0486c1b59) 6269 0 R (classParma__Polyhedra__Library_1_1Congruence_afd55d0cb3ab31c5e800c18eb849aa295) 6254 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction) 1779 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction_a1b6e413a75c138ef87cc373df0d25194) 6662 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction_a302c20124e5caa73cb5a860a57d6be5e) 6666 0 R (classParma__Polyhedra__Library_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_afcf86304f17dc474e1e5bbe0486c1b59) (classParma__Polyhedra__Library_1_1Congruences__Reduction_ac1c1301f7ca50550e48eb2e0e57528d0)]
->> endobj
-20163 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) 1231 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a017b50a53d3f73e61cb5c9d787cb1907) 7064 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a20a1a23e17edcba771385da4510f4786) 7061 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a4ea19117641ead1de64af7d71bf323fc) 7099 0 R (classParma__Polyhedra__Library_1_1Constant__Float [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a79a27720fc3f7a3e989f10ebdb6b2800)]
->> endobj
-20164 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a843388f4bb21a15bf18a841237a8a617) 7102 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a8669f7f8a54a22c294c94b36106edfb4) 7063 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aa272377eb99f1a8b4b48114da9bc6051) 7062 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aade09211d1e3917155860ba21f953756) 7101 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a843388f4bb21a15bf18a841237a8a617) (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_ae6c6807b378b537aea1651c3940c0161)]
->> endobj
-20165 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint) 1787 0 R (classParma__Polyhedra__Library_1_1Constraint__System) 1788 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) 1789 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a168ed0cbd2cf59717febf52a6d6e107a) 7770 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a177ecd1fb2bec07a416a3369f22d068d) 7774 0 R (classParma__Polyhedra__Library_1_1Constraint__System [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint) (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a40dee04f6adce4b8c60a569662f37f96)]
->> endobj
-20166 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a4948dd7324bd5d7a28e142a66ba5f875) 7767 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a6d8bd16c6f8ccff0228956f76a9b7464) 7773 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a8ab042e81927db600ee725d3c983b252) 7766 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aa1ff4528466150c5a3ce8d110c0c92e1) 7765 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a4948dd7324bd5d7a28e142a66ba5f875) (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_acefade434fe64088a872391d152455c1)]
->> endobj
-20167 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aeeafd2e88e461b1f480c37995d105714) 7772 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a09afd391300355989769ad52d3cc97aa) 7659 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a2552e7a194f5fb0d591bafb591b91968) 7712 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a2b451e6b09162c7c19b0a2ad36545c69) 7714 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a2b9db6ddc26573299d41 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aeeafd2e88e461b1f480c37995d105714) (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48)]
->> endobj
-20168 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a314eb5fed86c6bbe4a7223ca8362f0a9) 7666 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a32d97203a9cbf1abf97af74fc70df05b) 7656 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a3410a53827de9155ac7d6cbd84263364) 7667 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a5498315352fd30826df848010c6bac1d) 7655 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a5a79ce2b52efebd42da2736164a043ad) 771 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a314eb5fed86c6bbe4a7223ca8362f0a9) (classParma__Polyhedra__Library_1_1Constraint__System_a5cebd3d6d6ec070c47682e77b0248f22)]
->> endobj
-20169 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a5fbb0274f3a0a91ad283aef6e608909a) 7663 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a6293b813e42a59a9795cafe0efa762cc) 7721 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) 7711 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a6aec148aa41935a4072c64a43c51c577) 7664 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a70e9ad42674d62ed9bd73268e3af7064) 771 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a5fbb0274f3a0a91ad283aef6e608909a) (classParma__Polyhedra__Library_1_1Constraint__System_a78a4d5f5e4702a16d6aae656293ec7ad)]
->> endobj
-20170 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) 7661 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a8388d0d6d7ff68c627d516ec17f56b4c) 7665 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a92333180e0163e9c87f2220dceef012d) 7669 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a964e4bcbbfde58f43977d0a8e686ec35) 7657 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a999f627225c179795a8922d8335065fe) 771 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) (classParma__Polyhedra__Library_1_1Constraint__System_ab79c93f68d0f4589de855e872f9e72f6)]
->> endobj
-20171 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System_ac3223cf8c7d19b02b5e3c04038024b47) 7718 0 R (classParma__Polyhedra__Library_1_1Constraint__System_ad350b84c25b7c37693d2e7a08d3165ca) 7709 0 R (classParma__Polyhedra__Library_1_1Constraint__System_ad876557324aba0b545e25ebabe5a064b) 7660 0 R (classParma__Polyhedra__Library_1_1Constraint__System_add9738866968b13e938d5669dd94a55e) 7723 0 R (classParma__Polyhedra__Library_1_1Constraint__System_adfa7b03e2ac3a6666a7538431f1bdee9) 765 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_ac3223cf8c7d19b02b5e3c04038024b47) (classParma__Polyhedra__Library_1_1Constraint__System_ae36d644db84375b3aed9a748c6dff35b)]
->> endobj
-20172 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint__System_aea9a4fb9807eb61cda3eedf8e5a7acae) 7720 0 R (classParma__Polyhedra__Library_1_1Constraint__System_af2d6708545759fc6836df550bab529a0) 7654 0 R (classParma__Polyhedra__Library_1_1Constraint__System_af59c44aeed3fb4b88852730664a84e9e) 7707 0 R (classParma__Polyhedra__Library_1_1Constraint_a01c6cce6c756073f1684c4e7debd554e) 7199 0 R (classParma__Polyhedra__Library_1_1Constraint_a047a99eb91872d19730f4fd14a81f55c) 7355 0 R (classParm [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_aea9a4fb9807eb61cda3eedf8e5a7acae) (classParma__Polyhedra__Library_1_1Constraint_a097e454cd31f0dddb7e7a7ceab1a2511)]
->> endobj
-20173 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a09c8fc0753a389cc42f84c12f7920832) 7259 0 R (classParma__Polyhedra__Library_1_1Constraint_a0ab383f3930179982937f7733a283a03) 7251 0 R (classParma__Polyhedra__Library_1_1Constraint_a0ab38d6ea061e7c2cb1595ba9cf2fd42) 7260 0 R (classParma__Polyhedra__Library_1_1Constraint_a0d50a5df6b31c6de90fe366e18e750ff) 7256 0 R (classParma__Polyhedra__Library_1_1Constraint_a0e0942b92b2f099b4ad4897d2b986dea) 7202 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a09c8fc0753a389cc42f84c12f7920832) (classParma__Polyhedra__Library_1_1Constraint_a182ea33f63c0eea708e02a32b0904f30)]
->> endobj
-20174 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a19173722ebe43fed184ef76abfb1c28c) 7268 0 R (classParma__Polyhedra__Library_1_1Constraint_a1e7682395739069fa5bee820540b2bd3) 7257 0 R (classParma__Polyhedra__Library_1_1Constraint_a239b0622fbcfe1638b4246deab2caa29) 7193 0 R (classParma__Polyhedra__Library_1_1Constraint_a2679da4dbd5b8c33ef607aee49690c2a) 7263 0 R (classParma__Polyhedra__Library_1_1Constraint_a29202eb817eb5c9d59433abeeb4f2eea) 7264 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a19173722ebe43fed184ef76abfb1c28c) (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d)]
->> endobj
-20175 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a2fb9117b8937e3d9a9b4d3ae397bb79a) 7359 0 R (classParma__Polyhedra__Library_1_1Constraint_a32d23987abcbb26d66dcc31aa003b70d) 7482 0 R (classParma__Polyhedra__Library_1_1Constraint_a340e8b886fb185bed798dcbc1391c126) 7476 0 R (classParma__Polyhedra__Library_1_1Constraint_a36a0c8ccab7923610bd27f637af63e1d) 7201 0 R (classParma__Polyhedra__Library_1_1Constraint_a3c1dcd74ba0b2509f45aad45a5d922ce) 7190 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a2fb9117b8937e3d9a9b4d3ae397bb79a) (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e)]
->> endobj
-20176 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a405f3dfb1b620defbadb0b2f103b8f28) 7206 0 R (classParma__Polyhedra__Library_1_1Constraint_a423e3bb0d9886c630c3c227def9f2073) 7360 0 R (classParma__Polyhedra__Library_1_1Constraint_a442aecbe0ce384a7c1add146fb125ed6) 7248 0 R (classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) 7357 0 R (classParma__Polyhedra__Library_1_1Constraint_a4b4c0277d3b6c85ab6633ae9f5e235c6) 7347 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a405f3dfb1b620defbadb0b2f103b8f28) (classParma__Polyhedra__Library_1_1Constraint_a50213d8479884e1f0d7fae1c4f817943)]
->> endobj
-20177 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) 7349 0 R (classParma__Polyhedra__Library_1_1Constraint_a600a652347fb8718e0bc05f7230b8d8a) 7471 0 R (classParma__Polyhedra__Library_1_1Constraint_a61208276a246a505bd753ffbb568bfe7) 7351 0 R (classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) 7470 0 R (classParma__Polyhedra__Library_1_1Constraint_a660c04b4c90264ea97b3367acb01e8a9) 7185 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) (classParma__Polyhedra__Library_1_1Constraint_a6742bd7f3f2cb079b96900dda0147940)]
->> endobj
-20178 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a745ac1cdddf74c6f387cfbbbc566dc78) 7194 0 R (classParma__Polyhedra__Library_1_1Constraint_a78c24741e21a4406ea8ad1588c768147) 7250 0 R (classParma__Polyhedra__Library_1_1Constraint_a7bdaff085ea6859cdec9b27bffb6de4b) 7254 0 R (classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) 7346 0 R (classParma__Polyhedra__Library_1_1Constraint_a858b9fe39b14cf51d179a84be1605436) 7481 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a745ac1cdddf74c6f387cfbbbc566dc78) (classParma__Polyhedra__Library_1_1Constraint_a85ca415a40fbd066ad850e26b1fe1653)]
->> endobj
-20179 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) 7353 0 R (classParma__Polyhedra__Library_1_1Constraint_a8d9338b98f6d33e111c0c0d70508b4ee) 7187 0 R (classParma__Polyhedra__Library_1_1Constraint_a8e5a205098d89ad9473676ae57f29ac5) 7342 0 R (classParma__Polyhedra__Library_1_1Constraint_a93d5d6abf06ec551294c4c18abb4349d) 7255 0 R (classParma__Polyhedra__Library_1_1Constraint_a9960963fb1f8fb56631e0402557065ae) 7249 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852)]
->> endobj
-20180 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_a9dc926136daee1f47975434ee45298ec) 7189 0 R (classParma__Polyhedra__Library_1_1Constraint_aa8a21b3b30b29ca087ecc032d1a3f922) 7267 0 R (classParma__Polyhedra__Library_1_1Constraint_aaf207e746f4a3dc2722e254612dab3b3) 7261 0 R (classParma__Polyhedra__Library_1_1Constraint_ab0f18894c8f97fa0cd38736462f36132) 7253 0 R (classParma__Polyhedra__Library_1_1Constraint_ab12acbd3962ac07c4db8f1994351668b) 7478 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a9dc926136daee1f47975434ee45298ec) (classParma__Polyhedra__Library_1_1Constraint_ab3186208850238a080373f035cd532cc)]
->> endobj
-20181 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_ab6976f576e6e50941ee7a7b1a737c0eb) 7246 0 R (classParma__Polyhedra__Library_1_1Constraint_abbde4b86cfca3e29a917650f4c9c62d5) 7341 0 R (classParma__Polyhedra__Library_1_1Constraint_abdd61469bc5c6dfc6e97f306a751035c) 7469 0 R (classParma__Polyhedra__Library_1_1Constraint_ac7bf9d127644aa14a09eab633e87f544) 7186 0 R (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) 7195 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_ab6976f576e6e50941ee7a7b1a737c0eb) (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6aba7491a8ba26958c3e27bed23b7eef1a7e)]
->> endobj
-20182 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abab5b32713c840499d9e29facf95a17f41) 7196 0 R (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abac1539389d3643cf986ef5bb99697d1cc) 7197 0 R (classParma__Polyhedra__Library_1_1Constraint_acc5c5125e7237c5913981b99a502f332) 7350 0 R (classParma__Polyhedra__Library_1_1Constraint_accc738986aa1e74d232da8c9cc10966a) 7192 0 R (classParma__Polyhedra__Library_1_1Constraint_acedadd7f774 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abab5b32713c840499d9e29facf95a17f41) (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727)]
->> endobj
-20183 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) 7354 0 R (classParma__Polyhedra__Library_1_1Constraint_adda5908777a9d901f2e7bcf7f61b9d67) 7480 0 R (classParma__Polyhedra__Library_1_1Constraint_ae3674890a93b407b8080fdd7ea85d93f) 7184 0 R (classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) 7472 0 R (classParma__Polyhedra__Library_1_1Constraint_ae615df068adfbb40a0b0b7a993579d22) 7473 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) (classParma__Polyhedra__Library_1_1Constraint_ae73aae9c2283b936cdaf92e13ab5d727)]
->> endobj
-20184 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) 7477 0 R (classParma__Polyhedra__Library_1_1Constraint_aea0fedb82a525e6ada13cd7fd2d03225) 7265 0 R (classParma__Polyhedra__Library_1_1Constraint_af023b7e8ad5a15b2617878bf2bf93d5c) 7343 0 R (classParma__Polyhedra__Library_1_1Constraint_af06b2331eb3d080794682080b7f7eb1d) 7358 0 R (classParma__Polyhedra__Library_1_1Constraint_af245f065572b31c8ca97e196e45f9cf9) 7352 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) (classParma__Polyhedra__Library_1_1Constraint_af2eb5d22ef23937a261cfe3f6bc435e6)]
->> endobj
-20185 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) 7266 0 R (classParma__Polyhedra__Library_1_1Constraint_afbee4abe5b3b83f47971e19f47f3bb53) 7205 0 R (classParma__Polyhedra__Library_1_1Constraint_afe7cc9f7ed389844bb2484ba6bebdde0) 7479 0 R (classParma__Polyhedra__Library_1_1Constraints__Reduction) 1790 0 R (classParma__Polyhedra__Library_1_1Constraints__Reduction_a383574ff4028da9048235b061a613b99) 7793 0 R (classParma__Polyhedra__Library_1_1Constrain [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) (classParma__Polyhedra__Library_1_1Constraints__Reduction_a87f25b7a2988f918a20b3d09047b08ab)]
->> endobj
-20186 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Constraints__Reduction_a898fefd81641cf4f6b854e85412a415c) 7789 0 R (classParma__Polyhedra__Library_1_1Determinate) 1791 0 R (classParma__Polyhedra__Library_1_1Determinate_a062f93b32c2103c74d7a91cfa027a82a) 7883 0 R (classParma__Polyhedra__Library_1_1Determinate_a079249fd8d7a54f2b876c1cecd42ab77) 7833 0 R (classParma__Polyhedra__Library_1_1Determinate_a086c7f397ab21146fde044139d607227) 7826 0 R (classParma__Polyhedra__Library_1_1Determinate_a0aec [...]
-/Limits [(classParma__Polyhedra__Library_1_1Constraints__Reduction_a898fefd81641cf4f6b854e85412a415c) (classParma__Polyhedra__Library_1_1Determinate_a0aec62be016edf40df1aeab68610290d)]
->> endobj
-20187 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Determinate_a2cca0fbafd235d3e82edcbc0f3c41d3c) 7886 0 R (classParma__Polyhedra__Library_1_1Determinate_a3596cd03bb91402d705bbf959506cb4b) 7836 0 R (classParma__Polyhedra__Library_1_1Determinate_a452974abf6ea3b81ac94e4c004bac876) 7897 0 R (classParma__Polyhedra__Library_1_1Determinate_a46f440596ccf2c1f53a4d312af97cc0c) 7889 0 R (classParma__Polyhedra__Library_1_1Determinate_a5c44d3d0955540b98975a14f5b97e942) 7895 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Determinate_a2cca0fbafd235d3e82edcbc0f3c41d3c) (classParma__Polyhedra__Library_1_1Determinate_a5fc66875bf8b6a2838028fc66ce3f2be)]
->> endobj
-20188 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Determinate_a6c75bb083e814ae12c8df6a2cd63fda6) 7885 0 R (classParma__Polyhedra__Library_1_1Determinate_a773a5ffce9cb4be2b75dfb92177d9ec5) 7891 0 R (classParma__Polyhedra__Library_1_1Determinate_a775560d42dce1a47cd1cdedafb46d0fc) 7835 0 R (classParma__Polyhedra__Library_1_1Determinate_a92fe35a10fee9c27d0958a9d4a3b5bf4) 7830 0 R (classParma__Polyhedra__Library_1_1Determinate_a97bcf298710d2a89ee8c29d457fc925b) 7888 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Determinate_a6c75bb083e814ae12c8df6a2cd63fda6) (classParma__Polyhedra__Library_1_1Determinate_ab922f32fb84e011b67fee7ac6b69d509)]
->> endobj
-20189 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Determinate_abbd1a3e57c1f33d638b4ae3aa852416f) 7896 0 R (classParma__Polyhedra__Library_1_1Determinate_aced7c94ba2c14044e98327ac0bd11dd6) 7894 0 R (classParma__Polyhedra__Library_1_1Determinate_ad353ea3809ab22bb775fc17e65b6ab94) 7827 0 R (classParma__Polyhedra__Library_1_1Determinate_ad35fd6a6bd2b3ddf76f6a85e33ada2cd) 7834 0 R (classParma__Polyhedra__Library_1_1Determinate_ad4366a1eb42053ac30ef197d59f92707) 7838 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Determinate_abbd1a3e57c1f33d638b4ae3aa852416f) (classParma__Polyhedra__Library_1_1Determinate_ad97c1aed499bc56468b3ab250b235b38)]
->> endobj
-20190 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Determinate_ae04186768b7847971b787e23badc4682) 7831 0 R (classParma__Polyhedra__Library_1_1Determinate_ae8fb80899b7c136573ec8f42beb8a207) 7887 0 R (classParma__Polyhedra__Library_1_1Determinate_af01a65d9370eabfc5e47d8b613b37b0a) 7882 0 R (classParma__Polyhedra__Library_1_1Determinate_af537493853b0d1460f9d868c122ae4c1) 7890 0 R (classParma__Polyhedra__Library_1_1Determinate_afa57568993488dd0803021cbaa06f3fa) 7828 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Determinate_ae04186768b7847971b787e23badc4682) (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression)]
->> endobj
-20191 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a02d8b929a48de1c69e0e0d702359ec53) 7966 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1a5c8e881f8449ae038fc40642062df6) 7951 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1f3d0a78d4643a39b5bb1e57e9f75966) 7979 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a3ae2260455d60d464a71a9b82e49cc9e) 7954 0 R (classPa [...]
-/Limits [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a02d8b929a48de1c69e0e0d702359ec53) (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a8ce651047fdd482308082762faeaa1f2)]
->> endobj
-20192 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_aac178c76c46ac4796dc7c382ec2169ae) 7957 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_ab156f789e720f2d04086a672448ded40) 7952 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_abd3924517707378fc8a0addaeda7281d) 7987 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_af0800054c69699766ed5188e3e11641c) 7955 0 R (classPa [...]
-/Limits [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_aac178c76c46ac4796dc7c382ec2169ae) (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a164b02df3563d0cac9dcf896537051c8)]
->> endobj
-20193 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a443736bb8156073cf1c5f672737eb02b) 8039 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a4e31289c7f2b430f3ee16db365000bef) 8069 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a5c97434b373dda7d6f4f882478dcca61) 8067 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a6cfe9f46fa0f15b09149f89ef35430c4) 8040 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a443736bb8156073cf1c5f672737eb02b) (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_aadb6d4669e8aa852e2f3d11e40c8c211)]
->> endobj
-20194 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) 8038 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_abf9798785b87d68e6ff2db95401536a7) 8077 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_adaf83ce888c996163559b520ebda628c) 8037 0 R (classParma__Polyhedra__Library_1_1Domain__Product) 1834 0 R (classParma__Polyhedra__Library_1_1FP__Oracle) 1840 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) (classParma__Polyhedra__Library_1_1FP__Oracle_a34f9d9a55678514e434ebed37cf89f01)]
->> endobj
-20195 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1FP__Oracle_a534e99d940f191cba72c31acb19989cc) 8403 0 R (classParma__Polyhedra__Library_1_1FP__Oracle_a70b0fbcc1272e8bb764a95cb3f1e2d17) 8385 0 R (classParma__Polyhedra__Library_1_1FP__Oracle_ae11646b9e6b853245a5d04301f39c134) 8405 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Constant) 1838 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Constant__Common) 1839 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression)  [...]
-/Limits [(classParma__Polyhedra__Library_1_1FP__Oracle_a534e99d940f191cba72c31acb19989cc) (classParma__Polyhedra__Library_1_1Floating__Point__Expression)]
->> endobj
-20196 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) 8094 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) 5311 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) 5357 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) 7073 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expr [...]
-/Limits [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_a0b4f0cf30d6df8fd251719d179ab71dd) (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a66d27330f68cd1e721e3253daa389416)]
->> endobj
-20197 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) 5355 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a8bd1db7ffbb10f889201b84ebac733bf) 5356 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) 5312 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) 7109 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expr [...]
-/Limits [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_a7b182efb244aa0474fe13b0971599240) (classParma__Polyhedra__Library_1_1GMP__Integer)]
->> endobj
-20198 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1GMP__Integer_a01c5bdd401e8bc17ea983d941be2aa49) 9283 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a081a1af02e55d9903d0bf3816a6e91f1) 9281 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a11810ad660a4aa63766e8ebb0334b7d6) 9234 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a29b14636d21c90e28ee1821666dc1d64) 9235 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a2f220b5f73e79a2e6feab3a97a7e2445) 9236 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a01c5bdd401e8bc17ea983d941be2aa49) (classParma__Polyhedra__Library_1_1GMP__Integer_a38ab8dc3ca19cacef112ca316bc7ce09)]
->> endobj
-20199 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1GMP__Integer_a4039bbdc92a28fade431cb98f20b0fa6) 9233 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a6d5c75bcc32f8aea006e8da4b3f736b2) 9268 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a6e613e3f02e896503d38da788ad593b8) 9229 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a7f9dc23eef0ab2ef9d07f4d53177afce) 9277 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a83b02e8cbb5d14a2ebf2843e6551391d) 9279 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a4039bbdc92a28fade431cb98f20b0fa6) (classParma__Polyhedra__Library_1_1GMP__Integer_a84565fd9471a52f83618d0d5ce461c3c)]
->> endobj
-20200 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1GMP__Integer_a952922658abcdfb880fcf0a8483c9620) 9278 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a9a22818e12d0abab8d8a8e0d3346f51a) 9231 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_ab8dbbfce1fd68d57df6b05d5cc74c012) 9230 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_abc1d7e892f343522c751d672d5632f17) 9282 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_acf54a358f4ddf09f56364da87de68a49) 9232 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a952922658abcdfb880fcf0a8483c9620) (classParma__Polyhedra__Library_1_1Generator)]
->> endobj
-20201 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System) 1842 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) 1843 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a53db1aeb67216c949d1aa627299ab5bf) 9188 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a71f52ba9ef61e0f336d025241003646c) 9187 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a76aee99fe2a1984162c8efbf867a97b2) 9184 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System) (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a7ec7cf59ce4c8e5902704637c02f39bd)]
->> endobj
-20202 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a8ba666eb5beace7b116d9f9e16e9a742) 9181 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a94534f2d8132436533398ce6cdca13c8) 9180 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_acd703faaddfab4f29bdd2958b4a9d1c3) 9179 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ad21fe8d252487a1df3b3c90f94fbcfb0) 9185 0 R (classParma__Polyhedra__Libr [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a8ba666eb5beace7b116d9f9e16e9a742) (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_aff430afd2381244ef77bb37670ce5627)]
->> endobj
-20203 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System_a02b52b4ef5b1806566495cb7b6d35abb) 9110 0 R (classParma__Polyhedra__Library_1_1Generator__System_a071ec60375df0a0f5051dc431f445e37) 9109 0 R (classParma__Polyhedra__Library_1_1Generator__System_a25fce97f25e1814c62ec46b7a04ee942) 9103 0 R (classParma__Polyhedra__Library_1_1Generator__System_a2b29f5668213f9171cfdc666ef4142ea) 9098 0 R (classParma__Polyhedra__Library_1_1Generator__System_a37abf9e26c109cf608ec7829284883ec) 9113 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a02b52b4ef5b1806566495cb7b6d35abb) (classParma__Polyhedra__Library_1_1Generator__System_a558bee1e7045c2ed558e68002cb3dd4f)]
->> endobj
-20204 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) 9044 0 R (classParma__Polyhedra__Library_1_1Generator__System_a6135986b7669c295a1855279a9347433) 9047 0 R (classParma__Polyhedra__Library_1_1Generator__System_a6b57cf93153051d3aa63c33e34ee4127) 9100 0 R (classParma__Polyhedra__Library_1_1Generator__System_a6e9c19c25562f9d1a71523d00b337450) 9111 0 R (classParma__Polyhedra__Library_1_1Generator__System_a7072dc2f1979eb1198aea49e10bcd59d) 9105 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f)]
->> endobj
-20205 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System_a7bda239eefab2b9cc9cabc123bbaef31) 9093 0 R (classParma__Polyhedra__Library_1_1Generator__System_a804b0e848b19f18d99664d5bbd57a3f1) 9048 0 R (classParma__Polyhedra__Library_1_1Generator__System_a92ed2a28d3c4689eec62eae04cdc2520) 9091 0 R (classParma__Polyhedra__Library_1_1Generator__System_a9eef881b5ea4e9dae4b2ff713a43af79) 9096 0 R (classParma__Polyhedra__Library_1_1Generator__System_a9fe4a78fa5899317f5a060d7b607b5c1) 9101 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a7bda239eefab2b9cc9cabc123bbaef31) (classParma__Polyhedra__Library_1_1Generator__System_aa33b89d7143376193110dde339707b0d)]
->> endobj
-20206 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3) 9097 0 R (classParma__Polyhedra__Library_1_1Generator__System_aaf6afcf59d181946f02b27418d9b651a) 9092 0 R (classParma__Polyhedra__Library_1_1Generator__System_ab0063024b3761b3ff89c3f259ebac6fe) 9104 0 R (classParma__Polyhedra__Library_1_1Generator__System_ab174d3f8d008aca83801ae0de294528d) 9099 0 R (classParma__Polyhedra__Library_1_1Generator__System_ab9156785517cdd6c775b365ea12d2d18) 9106 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3) (classParma__Polyhedra__Library_1_1Generator__System_acb15b3a65e5dba1c113539f2912c75f8)]
->> endobj
-20207 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator__System_acce6ad80815e7d09970ed92968967585) 9095 0 R (classParma__Polyhedra__Library_1_1Generator__System_acea4ab79eb91ca6bad6a126f08de1cc5) 9046 0 R (classParma__Polyhedra__Library_1_1Generator__System_ad53075833d1bde0c9e36dd70afb4b967) 9108 0 R (classParma__Polyhedra__Library_1_1Generator__System_adcd147a1c5474a820c7379514f629fda) 9133 0 R (classParma__Polyhedra__Library_1_1Generator__System_aed024de0dc1ad69e380f706d25740cb0) 9050 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_acce6ad80815e7d09970ed92968967585) (classParma__Polyhedra__Library_1_1Generator__System_afb150cd8c06fd986b4b57ffe29bc871e)]
->> endobj
-20208 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) 8600 0 R (classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) 8699 0 R (classParma__Polyhedra__Library_1_1Generator_a137b1f86858576e71034aec1ce54fd65) 8852 0 R (classParma__Polyhedra__Library_1_1Generator_a13c726daa7d565ded0b177e24b6d1104) 8582 0 R (classParma__Polyhedra__Library_1_1Generator_a1ad16d1e8a395685314dedffe17fbb8c) 8702 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) (classParma__Polyhedra__Library_1_1Generator_a1b5063a9931b8a9d4a0db756c0b1c9e6)]
->> endobj
-20209 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a1c884f5152f75040139ec3d9ec8ac293) 8500 0 R (classParma__Polyhedra__Library_1_1Generator_a2673a95cb7d41f3c6078024874d1f8b1) 8695 0 R (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) 8601 0 R (classParma__Polyhedra__Library_1_1Generator_a2aba27eb7310045e1a35c7e68af01ab2) 8506 0 R (classParma__Polyhedra__Library_1_1Generator_a2c0762c7e8b14cb1d2032bf920b57732) 8499 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a1c884f5152f75040139ec3d9ec8ac293) (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a)]
->> endobj
-20210 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a2ef38aca6ca4ade62193017e6e794c94) 8586 0 R (classParma__Polyhedra__Library_1_1Generator_a303b4ed4262469c1834228e0f88dba74) 8692 0 R (classParma__Polyhedra__Library_1_1Generator_a37b12f6fbf02f9a3a51dee028128d446) 8495 0 R (classParma__Polyhedra__Library_1_1Generator_a37eddcfd7d63573ae2bf02e2f5ed6d50) 8799 0 R (classParma__Polyhedra__Library_1_1Generator_a39da685d64f5bc693cfe8869ee4fe9bc) 8851 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a2ef38aca6ca4ade62193017e6e794c94) (classParma__Polyhedra__Library_1_1Generator_a3bc88b2886b0b86865186d142e5ee414)]
->> endobj
-20211 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a3e575c477cd1ab90e4aaa2997d8163f8) 8597 0 R (classParma__Polyhedra__Library_1_1Generator_a3f29f8b40d09b17eaa4cbaac069f72a0) 8510 0 R (classParma__Polyhedra__Library_1_1Generator_a42867df59ec40173391b76074f9f0fb2) 8518 0 R (classParma__Polyhedra__Library_1_1Generator_a42b10b56cb7a582076a2d279ae07cf85) 8850 0 R (classParma__Polyhedra__Library_1_1Generator_a43a020d3bbe2b93b7ffa78a1c817b647) 8804 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a3e575c477cd1ab90e4aaa2997d8163f8) (classParma__Polyhedra__Library_1_1Generator_a475ead5848d02d5c879bb96f22ce1cc5)]
->> endobj
-20212 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a4904a65badd41facf2b598f09eb726a5) 8494 0 R (classParma__Polyhedra__Library_1_1Generator_a497cd4705484de0b938f6e03fd2ff460) 8514 0 R (classParma__Polyhedra__Library_1_1Generator_a4da7504ef9aeba8a782d47c83ce1abe7) 8519 0 R (classParma__Polyhedra__Library_1_1Generator_a4f591f8dde74ad99d0fb16a8c7e4a59c) 8701 0 R (classParma__Polyhedra__Library_1_1Generator_a4fb7d78e7b37d7f4b99babdc5cc84783) 8497 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a4904a65badd41facf2b598f09eb726a5) (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5)]
->> endobj
-20213 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a05abaa6ff4aa204c25c94719e8a2b6f4) 8438 0 R (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a4312979a12cae5ebb0791496e1ccce7a) 8437 0 R (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5ab7fe867b1243e111ef4364e3ef5b5329) 8439 0 R (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5abed2d3fff60e7c0b8fc325bf46f9725f) 8440  [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a05abaa6ff4aa204c25c94719e8a2b6f4) (classParma__Polyhedra__Library_1_1Generator_a5a20d28505fdda8702b48c35d08cfddd)]
->> endobj
-20214 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a5c96c17c3224a111a56381a75f564896) 8694 0 R (classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) 8691 0 R (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) 8595 0 R (classParma__Polyhedra__Library_1_1Generator_a66af65679979f949af0457fbcb07dcca) 8512 0 R (classParma__Polyhedra__Library_1_1Generator_a6804f93015ae6e1dc0c2e42e726380c4) 8596 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a5c96c17c3224a111a56381a75f564896) (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d)]
->> endobj
-20215 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a75190def344d4c1ba6c59a6f0fcf7420) 8801 0 R (classParma__Polyhedra__Library_1_1Generator_a76769b829453746113dd32f9fe880c9d) 8689 0 R (classParma__Polyhedra__Library_1_1Generator_a77fc44f44b1bdda486e19e30310634e2) 8508 0 R (classParma__Polyhedra__Library_1_1Generator_a787318df4682a2571d9cad8fc37c8fd6) 8848 0 R (classParma__Polyhedra__Library_1_1Generator_a78d14a45bade2c29f565fe13390ab13c) 8808 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a75190def344d4c1ba6c59a6f0fcf7420) (classParma__Polyhedra__Library_1_1Generator_a7c502c8d46ed2f68679404fdfdf8e0bf)]
->> endobj
-20216 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_a855eb1638a9b23f78fac816e8c9f7a05) 8807 0 R (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) 8435 0 R (classParma__Polyhedra__Library_1_1Generator_a8d0452265a9138357bbccc5902f80d97) 8501 0 R (classParma__Polyhedra__Library_1_1Generator_a9518a0d513563a1a7c144f35d639695f) 8686 0 R (classParma__Polyhedra__Library_1_1Generator_a95bad70fc4276b46478ff7100cbce347) 8802 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a855eb1638a9b23f78fac816e8c9f7a05) (classParma__Polyhedra__Library_1_1Generator_a974166a1fe54f72e254c8f02687084e6)]
->> endobj
-20217 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) 8798 0 R (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) 8442 0 R (classParma__Polyhedra__Library_1_1Generator_aa40eabb29ea4abe082c3a2e6dc820276) 8583 0 R (classParma__Polyhedra__Library_1_1Generator_aab2bceb460b09e14922ef0ad8011e74b) 8688 0 R (classParma__Polyhedra__Library_1_1Generator_ab339ccb929a7255295ad19a5b168d5d0) 8496 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e)]
->> endobj
-20218 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) 8697 0 R (classParma__Polyhedra__Library_1_1Generator_abb59cb64a8f7864eac1bb8253d164db0) 8591 0 R (classParma__Polyhedra__Library_1_1Generator_abc8ae851f2a0a6260d954b3bd8505249) 8585 0 R (classParma__Polyhedra__Library_1_1Generator_abccc1b3be92c83b70dd47667198d62cf) 8498 0 R (classParma__Polyhedra__Library_1_1Generator_abed1f1d1ff610a4d56c514a7b75509ab) 8796 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) (classParma__Polyhedra__Library_1_1Generator_ac240ffbfd08a91635aada843229f6814)]
->> endobj
-20219 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) 8693 0 R (classParma__Polyhedra__Library_1_1Generator_ac5a61f5b91d0db37a1a2fa6c843a26a8) 8700 0 R (classParma__Polyhedra__Library_1_1Generator_ad006db44540ea4786f611e882bfe8da5) 8800 0 R (classParma__Polyhedra__Library_1_1Generator_ad593d3aa49a632911d8d49c83b3f4985) 8592 0 R (classParma__Polyhedra__Library_1_1Generator_ad7552a414d66f92897d12767579fa3ca) 8698 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) (classParma__Polyhedra__Library_1_1Generator_ad7576379843ab0fb9a33484bd4d68e71)]
->> endobj
-20220 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_ad8cee05f88ad5aea288c1f6b8bf7cdc7) 8503 0 R (classParma__Polyhedra__Library_1_1Generator_ade2531310fd7806c9e4f745cab145926) 8584 0 R (classParma__Polyhedra__Library_1_1Generator_ade98f4e320d7d21e223afb83240b3800) 8507 0 R (classParma__Polyhedra__Library_1_1Generator_ae5902ab7e2d3304037a56ecda7fc22a4) 8504 0 R (classParma__Polyhedra__Library_1_1Generator_ae6e33f7246f4e3683fdab905d2e26819) 8515 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_ad8cee05f88ad5aea288c1f6b8bf7cdc7) (classParma__Polyhedra__Library_1_1Generator_aebb212a14f52ed934059925c1f5f2010)]
->> endobj
-20221 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_aec5862748da509cc5dbf2ccd7280a92d) 8441 0 R (classParma__Polyhedra__Library_1_1Generator_aeff190ba56f86d3425859043689d499a) 8517 0 R (classParma__Polyhedra__Library_1_1Generator_af1827b1f7a42393a2526944530559c5a) 8505 0 R (classParma__Polyhedra__Library_1_1Generator_af1bf8c762c6f36b30f2abcaffe591acb) 8509 0 R (classParma__Polyhedra__Library_1_1Generator_af4f9b4584e455154e3f201876af1848f) 8806 0 R (classParma__Polyhedra__Library_1_1Gene [...]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_aec5862748da509cc5dbf2ccd7280a92d) (classParma__Polyhedra__Library_1_1Generator_af64f0b6ef53df6ef8024b03b187d197c)]
->> endobj
-20222 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) 8598 0 R (classParma__Polyhedra__Library_1_1Generator_afceefab91d648d188e42e5a75a3a977e) 8516 0 R (classParma__Polyhedra__Library_1_1Generator_afed6e254937adbecd53072747e51cb3f) 8696 0 R (classParma__Polyhedra__Library_1_1Grid) 786 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate) 1845 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_a3b727ab728f8758af9fb217eca9d791a) 10188 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) (classParma__Polyhedra__Library_1_1Grid__Certificate_a3b727ab728f8758af9fb217eca9d791a)]
->> endobj
-20223 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f) 10186 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) 10190 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_ac03d43b46ab7f9e5d0ea3c46a5eab7b3) 10184 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_acf34edb23c376600051bbc563e4122c4) 10185 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_adf9fc5ac7e45f36bc03af31b98b31a72) 1018 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f) (classParma__Polyhedra__Library_1_1Grid__Generator)]
->> endobj
-20224 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System) 1893 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) 1785 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a26673943182a6efc6cc6e3aad8c731a7) 7004 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a2be2c8b9d00f81fc24dcbc36ad05afea) 7000 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a41cb [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System) (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a47def4dcb522c046a6f3a432d72008ed)]
->> endobj
-20225 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a61b27b2ed8bbc9a128f9001d160b078d) 6999 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9571074ab0249afc1e440c8c5eb5d429) 6998 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9af54d524de94ada872d460c1dbd5cc0) 6996 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa6e183ba7e931dc88e16fb9ecfa8b3c7) 7001  [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a61b27b2ed8bbc9a128f9001d160b078d) (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_affa77e724493813cddf9740767c2473e)]
->> endobj
-20226 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a023dc725ab60578fb2161f06211fa023) 10693 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a102ffa79248502b4998a70fba5f13d98) 10747 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f0983add75d3a9c3663fbf925739212) 10754 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f6d9240b4cf201eee98359c903c1918) 10694 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a023dc725ab60578fb2161f06211fa023) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4254da492e5eeb1c12d8d87b997cd229)]
->> endobj
-20227 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a465d046e2570dea82e57ab6af9b179e9) 10701 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a494a5dcf815a292978b1864d2d7f77ae) 10749 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4e6c82baa2eac91c07d9ae925b8d42b2) 10690 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a62e7b71f72659356d1d732236ed5f330) 10759 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a63fd9651 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a465d046e2570dea82e57ab6af9b179e9) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a6a5f64baba3ae5704d9645db684434d3)]
->> endobj
-20228 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a773be362898fec2d48f0948c89870cf6) 10695 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a7d4c3ba6b9e9b575d07b2e87b69a24e3) 10756 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8530a0719104225bd022dbe9529ae527) 10758 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a864a52992178820135a7ae3a75e65377) 10760 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8a0c95f4 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a773be362898fec2d48f0948c89870cf6) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8cf170e729ac4e4576624d6ed7d4b44d)]
->> endobj
-20229 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a8e247a33c9eb40439c706a98c5d363d0) 10764 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8f29bc3aa01b8f5c67a3323189f9cf9e) 10688 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a90e26e60ccfbe3c6ab8d91b5bf06dab5) 10761 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a998804f094e131a7f06d05c6e9eb5f5c) 10700 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a9e847f0b [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a8e247a33c9eb40439c706a98c5d363d0) (classParma__Polyhedra__Library_1_1Grid__Generator__System_aa09a1ddc7936a5377e838cb44610548e)]
->> endobj
-20230 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) 10765 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) 10684 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab289fda31b27c62873b4542280a90719) 10685 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_abba3cc93433c6564ba34c1fdd360bde9) 10698 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac485f37c [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac53b2bea17ae404e291cbcb7033dbaf2)]
->> endobj
-20231 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_ac5764ede75697ec70757c5e208945ca2) 10751 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_aca9c22c405ba1378296cc85f850aff21) 10686 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ace4c05e99016850c16c2bdaff5914afd) 10697 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_adfc60b971ed974350d241482f15f46ac) 10753 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ae64d3d01 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_ac5764ede75697ec70757c5e208945ca2) (classParma__Polyhedra__Library_1_1Grid__Generator__System_aefcc22cba81dc18bc3e25d399127f3f4)]
->> endobj
-20232 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_af1afb697fed68cd53ff8d90b1d7cbc28) 10687 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a00017ad58d66a7948b0355b3e02c750b) 10241 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a041afb1a2cc7277572fb7235cf08cf64) 10388 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a081718c23b5785da17c63ffec13536cc) 10306 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a082a74ad0ce931ec2e517bf0f009daa2) 10399  [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_af1afb697fed68cd53ff8d90b1d7cbc28) (classParma__Polyhedra__Library_1_1Grid__Generator_a091c62cb35ccf09353d79a532e6c1758)]
->> endobj
-20233 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a0f19da4c46bb8b3be01875eff4c00538) 10309 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) 10247 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a25b86c6f0633416506503de2bf693876) 10250 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a4ac3b90df83c2e43249ccfa2702640de) 10249 0 R (classParma__Polyhedra__Library_1_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a0f19da4c46bb8b3be01875eff4c00538) (classParma__Polyhedra__Library_1_1Grid__Generator_a1177f236d8c66c01bbb43b37ff90bc7d)]
->> endobj
-20234 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a13419c5d820bde20af5eabd23e479ec8) 10303 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a164c38a51c8718e6ac3a3f3e4af77bf0) 10307 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a1aabacaac0806d617f53db4b34b3349e) 10297 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a1f0828932daf26d10e94120c1f4a4d6b) 10318 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a271a32761c20049948570491e6b5b9dd) 10254 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a13419c5d820bde20af5eabd23e479ec8) (classParma__Polyhedra__Library_1_1Grid__Generator_a2a0bc130f7cf6a0678ee3b982fcc7ab6)]
->> endobj
-20235 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) 10386 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a3024467f23276b9db83e3bbb6fc05b12) 10313 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a3075c67d9868fc0b483db13256fb4e0c) 10498 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a32364020a67e8172442cbd9d1077cf44) 10393 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) 10397 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) (classParma__Polyhedra__Library_1_1Grid__Generator_a41227446c918730e97998799bfe04da6)]
->> endobj
-20236 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) 10244 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a4be36a9309c5ecfa863e326c44296391) 10488 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a4c001b3abe941fc38c182ed23c7bca2b) 10251 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a4cf4938d837fcf701695a0828bf56cef) 10296 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a538c16dacec86f66e9520c728a7c5f35) 10496 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) (classParma__Polyhedra__Library_1_1Grid__Generator_a58b86510b9c4dc05004c0fc01622430b)]
->> endobj
-20237 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a5f47fcccf4795964925294d448335f0a) 10312 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a60d9658ef91fbd3a1b0064253246f36b) 10245 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a622b8ffad2bd654696c12d7d07ba51c6) 10489 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a64600674ceb04a95caa3db13515aa9ff) 10311 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) 10252 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a5f47fcccf4795964925294d448335f0a) (classParma__Polyhedra__Library_1_1Grid__Generator_a6fb154017052c68b63121cef49c568ce)]
->> endobj
-20238 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a76fce1702224700691a26cf5e780a1dd) 10300 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) 10308 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a7718a50034230b311e3f3cc35d7709e9) 10240 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a77a904793c99cfb1d61fadd277d59471) 10305 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) 10383 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a76fce1702224700691a26cf5e780a1dd) (classParma__Polyhedra__Library_1_1Grid__Generator_a80ef003442edc6db8e77caa4de7f7ef1)]
->> endobj
-20239 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a811f6f947785240bcb76bfca023fed17) 10302 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a82f262d4a5b57ea92ef25f5f49006ffe) 10501 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a875a737ccb94634bd7f5fd577d7d9657) 10395 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a8950f38d19f1b721d66b756b0ae10cb3) 10384 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a8ab7b9abebd48fe0ad129a237338aa96) 10499 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a811f6f947785240bcb76bfca023fed17) (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21)]
->> endobj
-20240 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a9188a38b44fd9b356f73459148e5f57e) 10502 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) 10238 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ab1db3272b7beca7b1d9d17f23d22ecbd) 10253 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_aba6b40a4b9708e94d6cd10f54144ed70) 10317 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_abaa6c80abf60b23dd19db6cc042719b0) 10243 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a9188a38b44fd9b356f73459148e5f57e) (classParma__Polyhedra__Library_1_1Grid__Generator_ac1e87cdf51be31f4c9c43c4c86bccb66)]
->> endobj
-20241 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_ac3e03bc2df621903d136c689c38bdb6f) 10304 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ac74dafaa0b06e9cd3d15ea0d2af1b213) 10387 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ac915c8d26a7dbcdbbd0c4985ec5b7d4b) 10301 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_aca47a151389a78c2474186b9628ab5cc) 10497 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_acb1fb1a16ca8e051a815ae73b178dd62) 10246 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ac3e03bc2df621903d136c689c38bdb6f) (classParma__Polyhedra__Library_1_1Grid__Generator_acdc0aeddab3d98e336719f42e6e5b06c)]
->> endobj
-20242 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) 10491 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ad350a787056fefe667783a60a9f2923e) 10394 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) 10385 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_add0d04eab672e924694d77cc48921add) 10239 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ae94a99f8e8d290b5791baa01fd540a14) 10389 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) (classParma__Polyhedra__Library_1_1Grid__Generator_aeabcfd0fb026563fd3464f04d32c8e60)]
->> endobj
-20243 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_aeca84d3bda389453f22a494ab9923088) 10484 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) 10400 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) 10390 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) 10396 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_af4e7705af87f5eb64d2ebdc60cd7a36e) 10315 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_aeca84d3bda389453f22a494ab9923088) (classParma__Polyhedra__Library_1_1Grid_a0047a6aa4f26d9133b9d741f68384f38)]
->> endobj
-20244 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) 9363 0 R (classParma__Polyhedra__Library_1_1Grid_a042613c3f4ad30b298d70143c935d7cd) 9455 0 R (classParma__Polyhedra__Library_1_1Grid_a0441c9c3b0ab0d55165bb6b4fd107f64) 9625 0 R (classParma__Polyhedra__Library_1_1Grid_a06894477c4e748b61eb0779ea8c0600f) 9702 0 R (classParma__Polyhedra__Library_1_1Grid_a071aa57e439ba4f358c7fd43b03a6a49) 9618 0 R (classParma__Polyhedra__Library_1_1Grid_a07bdac3717a59f64634da7d [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) (classParma__Polyhedra__Library_1_1Grid_a07bdac3717a59f64634da7d9b1cfaefd)]
->> endobj
-20245 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a092f5c04d267ab5709dda2d3e51aaeb9) 9359 0 R (classParma__Polyhedra__Library_1_1Grid_a0c02302b6281fa91ef9275bd37e43efc) 9366 0 R (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) 9628 0 R (classParma__Polyhedra__Library_1_1Grid_a0d8ed7a0e48fe76e7221842c780192b0) 9513 0 R (classParma__Polyhedra__Library_1_1Grid_a10e3116398b920cb137cf576a073cc68) 9697 0 R (classParma__Polyhedra__Library_1_1Grid_a1287b254a91451368e7e2e4 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a092f5c04d267ab5709dda2d3e51aaeb9) (classParma__Polyhedra__Library_1_1Grid_a1287b254a91451368e7e2e456f448114)]
->> endobj
-20246 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a145cc7c23d407576222e5af347f401c1) 9525 0 R (classParma__Polyhedra__Library_1_1Grid_a19422844125a988daaf489cbaff3835b) 9530 0 R (classParma__Polyhedra__Library_1_1Grid_a1a26d0018999e56d94a7e96db2b6e553) 9742 0 R (classParma__Polyhedra__Library_1_1Grid_a1a5606b64a035977b9d76b1932227246) 9447 0 R (classParma__Polyhedra__Library_1_1Grid_a1b528a2e8d4d096f62535454e05b74ba) 9699 0 R (classParma__Polyhedra__Library_1_1Grid_a1ba97c180500b43954b0953 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a145cc7c23d407576222e5af347f401c1) (classParma__Polyhedra__Library_1_1Grid_a1ba97c180500b43954b09532151f6c9d)]
->> endobj
-20247 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25055e33235) 9753 0 R (classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) 9740 0 R (classParma__Polyhedra__Library_1_1Grid_a214e376adb9dc271c61b58f8b2c927f0) 9531 0 R (classParma__Polyhedra__Library_1_1Grid_a2528b5f433e743dda827b1028b6c74cd) 9451 0 R (classParma__Polyhedra__Library_1_1Grid_a2581586de73769088ece60dc01409a08) 9686 0 R (classParma__Polyhedra__Library_1_1Grid_a2d4a31320735e93af31c8d2 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25055e33235) (classParma__Polyhedra__Library_1_1Grid_a2d4a31320735e93af31c8d2cc7e78329)]
->> endobj
-20248 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0b193ae8bc) 9445 0 R (classParma__Polyhedra__Library_1_1Grid_a31603d81a2b0571a82c4c79b8c6e4564) 9365 0 R (classParma__Polyhedra__Library_1_1Grid_a323efbe5d43695cc65f8cd5935da94dc) 9695 0 R (classParma__Polyhedra__Library_1_1Grid_a3628b6d6e250d4c6b8301173c6ecc777) 9748 0 R (classParma__Polyhedra__Library_1_1Grid_a36cc3783cdc92ab5fc69904c298ed12c) 9373 0 R (classParma__Polyhedra__Library_1_1Grid_a3ac47497148e61f3d7a3da0 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0b193ae8bc) (classParma__Polyhedra__Library_1_1Grid_a3ac47497148e61f3d7a3da09d17a03bf)]
->> endobj
-20249 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b) 9754 0 R (classParma__Polyhedra__Library_1_1Grid_a453e51570268eb4d63fc529130a54440) 9438 0 R (classParma__Polyhedra__Library_1_1Grid_a508103dc808fc747a90b573083a60461) 9690 0 R (classParma__Polyhedra__Library_1_1Grid_a527ffa31e1581a8beb83a832244dada8) 9367 0 R (classParma__Polyhedra__Library_1_1Grid_a53b24395ac61f8b2b2accc5a3900bf69) 9435 0 R (classParma__Polyhedra__Library_1_1Grid_a53f980fb1ac8fa21265bec9 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b) (classParma__Polyhedra__Library_1_1Grid_a53f980fb1ac8fa21265bec985bd1382f)]
->> endobj
-20250 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a59634a195948ff0617177d0a41e30602) 9446 0 R (classParma__Polyhedra__Library_1_1Grid_a596fc5b3ee0d04895aca9139cb6cbcb6) 9693 0 R (classParma__Polyhedra__Library_1_1Grid_a5cdf44f392505e1371a85b1245775224) 9700 0 R (classParma__Polyhedra__Library_1_1Grid_a5f6fcc1dab2b08eff20b41d1412d1e2d) 9752 0 R (classParma__Polyhedra__Library_1_1Grid_a621d377682c2c67051c24b1cc8a03497) 9450 0 R (classParma__Polyhedra__Library_1_1Grid_a659cb16eede4860a0c35976 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a59634a195948ff0617177d0a41e30602) (classParma__Polyhedra__Library_1_1Grid_a659cb16eede4860a0c3597638ca77830)]
->> endobj
-20251 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a65f00faeb048901323ffd316d30d61a4) 9369 0 R (classParma__Polyhedra__Library_1_1Grid_a68665d093308c111817eca341b98d70a) 9616 0 R (classParma__Polyhedra__Library_1_1Grid_a688572fbdc35859515f5ea8ba583a45a) 9704 0 R (classParma__Polyhedra__Library_1_1Grid_a69a6e807d63018625b02e06c07a578db) 9368 0 R (classParma__Polyhedra__Library_1_1Grid_a6ae1850664122e9917f174d10fd3bf06) 9440 0 R (classParma__Polyhedra__Library_1_1Grid_a6f703ba611b9e5ff613f4df [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a65f00faeb048901323ffd316d30d61a4) (classParma__Polyhedra__Library_1_1Grid_a6f703ba611b9e5ff613f4df35347ee95)]
->> endobj
-20252 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a727dc2405cfc5f2252e6f21aa0f18074) 9364 0 R (classParma__Polyhedra__Library_1_1Grid_a7fc86a6331f34f34a506ab2b0609ac37) 9747 0 R (classParma__Polyhedra__Library_1_1Grid_a7ff92e5d40e6faf667a0b1f6b8fad791) 9701 0 R (classParma__Polyhedra__Library_1_1Grid_a803035024ab9670971868f4b1092f7c5) 9442 0 R (classParma__Polyhedra__Library_1_1Grid_a82b76e3f18679ea161b53bfa80349009) 9528 0 R (classParma__Polyhedra__Library_1_1Grid_a85b2560352485ac05d10aab [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a727dc2405cfc5f2252e6f21aa0f18074) (classParma__Polyhedra__Library_1_1Grid_a85b2560352485ac05d10aab0ee483252)]
->> endobj
-20253 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816d72524790) 9437 0 R (classParma__Polyhedra__Library_1_1Grid_a87d004db7f8febf6f9c96b4a2a1c85e5) 9755 0 R (classParma__Polyhedra__Library_1_1Grid_a880344de195aef75a6b3f2a4db4787b4) 9436 0 R (classParma__Polyhedra__Library_1_1Grid_a8865893c48cc07adae5dca6b35081751) 9439 0 R (classParma__Polyhedra__Library_1_1Grid_a8d060ee1328743ae25698bc5835a5703) 9372 0 R (classParma__Polyhedra__Library_1_1Grid_a8d2cc5d18d050975101f286 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816d72524790) (classParma__Polyhedra__Library_1_1Grid_a8d2cc5d18d050975101f2860f2919da8)]
->> endobj
-20254 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814eaad72499) 9518 0 R (classParma__Polyhedra__Library_1_1Grid_a8f97dbc7a7c307fa72f7e904b2cbf21b) 9529 0 R (classParma__Polyhedra__Library_1_1Grid_a8fa02815bb561135934f91c9adcd0cb5) 9456 0 R (classParma__Polyhedra__Library_1_1Grid_a90ca2b1613fda31a2ac7e79d9388680d) 9434 0 R (classParma__Polyhedra__Library_1_1Grid_a90e87cbe8ae0717fa09ff51b70d64b47) 9620 0 R (classParma__Polyhedra__Library_1_1Grid_a943c42b0d1b3580e54b3ab6 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814eaad72499) (classParma__Polyhedra__Library_1_1Grid_a943c42b0d1b3580e54b3ab60aa55255f)]
->> endobj
-20255 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_a953a608f6f9d413870fb3eee5cc6ad1e) 9526 0 R (classParma__Polyhedra__Library_1_1Grid_a9831db06919c6ee05360b08e84cccbb7) 9615 0 R (classParma__Polyhedra__Library_1_1Grid_a9bdab8408169307fbd899ec3670cb2bf) 9696 0 R (classParma__Polyhedra__Library_1_1Grid_a9e17201a9a12235a9a96cc31cfffd38f) 9756 0 R (classParma__Polyhedra__Library_1_1Grid_a9e4e32230b187284ac0b9ca8efba8f82) 9626 0 R (classParma__Polyhedra__Library_1_1Grid_a9e87405c740d202951ba788 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a953a608f6f9d413870fb3eee5cc6ad1e) (classParma__Polyhedra__Library_1_1Grid_a9e87405c740d202951ba788f9e52cbf7)]
->> endobj
-20256 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_aa033cfca735240b3699b523d60ad692a) 9453 0 R (classParma__Polyhedra__Library_1_1Grid_aa26f672c32271db69ed68fc60eee8cff) 9521 0 R (classParma__Polyhedra__Library_1_1Grid_aa28d735beef86789b73b41dbbde71abf) 9374 0 R (classParma__Polyhedra__Library_1_1Grid_aa76828d01f5c454221427eef68227f78) 9630 0 R (classParma__Polyhedra__Library_1_1Grid_aa9c12ecd84df4ed86b5676a09fa39208) 9623 0 R (classParma__Polyhedra__Library_1_1Grid_ab602d97b867b5d2ea800ea7 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_aa033cfca735240b3699b523d60ad692a) (classParma__Polyhedra__Library_1_1Grid_ab602d97b867b5d2ea800ea7ceef4c6b5)]
->> endobj
-20257 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_ab6bba83ceaafdb71df04b77e43bed022) 9691 0 R (classParma__Polyhedra__Library_1_1Grid_abb10ea556dd34e0c1e13f7e99b9efe70) 9619 0 R (classParma__Polyhedra__Library_1_1Grid_abd8e73adc9b36c272118525242f9b50a) 9689 0 R (classParma__Polyhedra__Library_1_1Grid_ac009459805692e582a00d4b5954ab8e5) 9627 0 R (classParma__Polyhedra__Library_1_1Grid_ac418d88df400bcd2233fb6281debb08f) 9533 0 R (classParma__Polyhedra__Library_1_1Grid_ac4e1b49845e553ff84dc73e [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_ab6bba83ceaafdb71df04b77e43bed022) (classParma__Polyhedra__Library_1_1Grid_ac4e1b49845e553ff84dc73e710def76c)]
->> endobj
-20258 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_ac9d9eaf8b76024bc20ce524e13bf86a6) 9534 0 R (classParma__Polyhedra__Library_1_1Grid_ace98c3e57a1237e6dd5042b5a0919193) 9444 0 R (classParma__Polyhedra__Library_1_1Grid_ad09e4e3f9a9da562c6cdb73dd7b47fbe) 9520 0 R (classParma__Polyhedra__Library_1_1Grid_ad14942b33fb82bb3e6a13e5e92ada475) 9441 0 R (classParma__Polyhedra__Library_1_1Grid_ad42265530a9e3b2f3bda9ab40d4a835b) 9621 0 R (classParma__Polyhedra__Library_1_1Grid_ad743f8b71eb68f6b41f7ea7 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_ac9d9eaf8b76024bc20ce524e13bf86a6) (classParma__Polyhedra__Library_1_1Grid_ad743f8b71eb68f6b41f7ea7b5d21dc22)]
->> endobj
-20259 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6) 9449 0 R (classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) 9370 0 R (classParma__Polyhedra__Library_1_1Grid_ae47fdbff76383891b3896ac5fc213d5d) 9694 0 R (classParma__Polyhedra__Library_1_1Grid_ae5955a311fc4fde1edf2d5460f0a8356) 9617 0 R (classParma__Polyhedra__Library_1_1Grid_ae5dc5003b3652660bc4ff4a15e4060af) 9532 0 R (classParma__Polyhedra__Library_1_1Grid_ae8d42fcd571a9c9d64f0e7f [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6) (classParma__Polyhedra__Library_1_1Grid_ae8d42fcd571a9c9d64f0e7ffe67e995e)]
->> endobj
-20260 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549bdba93fede) 9744 0 R (classParma__Polyhedra__Library_1_1Grid_aee33974909cfc1cba605734a57d44df0) 9741 0 R (classParma__Polyhedra__Library_1_1Grid_af1ab967a6606266f7e583fc9752667fe) 9527 0 R (classParma__Polyhedra__Library_1_1Grid_af39e1b0519a47aafb9dba4121dc41a9c) 9743 0 R (classParma__Polyhedra__Library_1_1Grid_af6df34e5e4ab9beab41cd76897d64c72) 9703 0 R (classParma__Polyhedra__Library_1_1Grid_afae3a58c19c9a3b9916f29b [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549bdba93fede) (classParma__Polyhedra__Library_1_1Grid_afae3a58c19c9a3b9916f29b7aca4d0e0)]
->> endobj
-20261 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Grid_afb9d83c4e182f640833116dc2f725076) 9624 0 R (classParma__Polyhedra__Library_1_1Grid_afc06f600e94b7bedb91d0371a51f4c38) 9362 0 R (classParma__Polyhedra__Library_1_1Grid_afde364ce088f82cf2b9a231e7d9f2abc) 9454 0 R (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) 9746 0 R (classParma__Polyhedra__Library_1_1H79__Certificate) 1205 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a061c4c3b4f1eef970794b274dae62504) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_afb9d83c4e182f640833116dc2f725076) (classParma__Polyhedra__Library_1_1H79__Certificate_a061c4c3b4f1eef970794b274dae62504)]
->> endobj
-20262 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1H79__Certificate_a1e1a505b4cd4a4ac97d3a38864bd3977) 10832 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a517f4965fd423413531cd1d2058748de) 10820 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a553c3b19a36235d228039a6bb3452918) 10833 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a5cca0390f76c0a92703e65d3707f157a) 10817 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a7e6d252ce9557b9d73833ef594f6276b) 10836 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1H79__Certificate_a1e1a505b4cd4a4ac97d3a38864bd3977) (classParma__Polyhedra__Library_1_1H79__Certificate_aab939414cdbcf1ba174334859443a72c)]
->> endobj
-20263 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1H79__Certificate_ab8bee5e53740adc193668686030bb4bb) 10818 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object) 1835 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_a2a9693ada9db53099a8f7bc3b4e4b14f) 8126 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_a5d81385e212eb6794b6eccbff7d75f40) 8125 0 R (classParma__Polyhedra__L [...]
-/Limits [(classParma__Polyhedra__Library_1_1H79__Certificate_ab8bee5e53740adc193668686030bb4bb) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_ad381baaa75c172ef8deb34e3663e3ad6)]
->> endobj
-20264 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_ade93b18091b0c0255f9edf5635671e5e) 8124 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_afc08222c6448a38d82487f73f0d2cd4a) 8128 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList) 1836 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator) 1837 0 R (classParma__Polyhedra__Library_1_1Implementatio [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Doubly__Linked__Object_ade93b18091b0c0255f9edf5635671e5e) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a0b8c563512e846bce0d716066f049fcd)]
->> endobj
-20265 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a37513851388458132d6e62bab159032b) 8226 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a5a9d9c2da332d66b23af51d8977c5d74) 8225 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a95e8dcda2a5e9efd485371dad792eb71) 8242 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a9d011856be076fcc65af3573afe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_a37513851388458132d6e62bab159032b) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ac3cebc5fc52879ce539aaf78bf585f1e)]
->> endobj
-20266 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ad2f6505da3244481da4a207f727147c0) 8229 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_af03e6b7aee6649e2eb37ad0e9afc8c62) 8231 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_af4621fadbf4b3fd92473f5a2a6eda95f) 8224 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a0a109855a36749a7f7b68bcf254bc759) 816 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ad2f6505da3244481da4a207f727147c0) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a28e363b5aa72287de3d6633631885818)]
->> endobj
-20267 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a3b132b18d2e068b93f1e066cca596309) 8167 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a5e82ce331187ceffa3d71586cf6ab43d) 8176 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a6050f0724f65d27096693d5ca74f498a) 8174 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a6d27040392d25412134c73a31eb623c1) 8217 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a3b132b18d2e068b93f1e066cca596309) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a81b221513817c76fd3b8fd7dc404244e)]
->> endobj
-20268 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a962fddfb4d1f0a4815fd08ab41789d4e) 8177 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a9e757d2cec432015a32ad41c1158f391) 8186 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_abf7fe1e5877e16e79af6547d6f94e16a) 8216 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_ad6d0f3a9509993f4064a876841e24db3) 8172 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList_a962fddfb4d1f0a4815fd08ab41789d4e) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler)]
->> endobj
-20269 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) 1895 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_ad7aedf33c2b21bb5c7d9c3b441348e87) 10872 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_ae5713be75588690281277d5fe7954a34) 10871 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function) 1896 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1W [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function_ae0f59cc4089db649e630a00531827ca9)]
->> endobj
-20270 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_a3690915d5c30a08607ade652aa157cd3) 10850 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_add9a15bae9fb3c788a0ae526ef65733d) 10851 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) 1946 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a153e3f99decdc5f5e6783237f663aa09) 14483 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_a3690915d5c30a08607ade652aa157cd3) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a4be685ffc90e4a9b9d45930ca3d75a25)]
->> endobj
-20271 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ab604291f1f371f7c8bdf7c4f4d799954) 14487 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ade76cae38d35a93f595ca57a1be076d9) 14484 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_af28c7cc73f024d7be76270575e408e07) 14488 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List) 1947 0 R (classParma__P [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ab604291f1f371f7c8bdf7c4f4d799954) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7e590338a93fccabc6523fde997f8d73)]
->> endobj
-20272 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a80ba640b32901e54e1d60d760c74fa90) 14539 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a820628e94b7462dfe1b6f779e42d6ba5) 14538 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a91570d4eb002ad004ea2fdef91ad6dde) 14531 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_aa5c76d2c66f8173ec0dd35acc844db46 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a80ba640b32901e54e1d60d760c74fa90) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_add253088cfcc2b16bb6393925f956b8c)]
->> endobj
-20273 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ae955347d214b5ca7f04fcd6b7d53ee9f) 14537 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_afd76da49bf16b0f9548e9b2d8e37ac54) 14530 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) 1992 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a1d613c80931007bd46f479582f90542e) 17380 0 R (classParma__Polyhedra__Library_1_1Implem [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ae955347d214b5ca7f04fcd6b7d53ee9f) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a2f9b37006a7b28800bf7c2aebb7e331d)]
->> endobj
-20274 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6018819ab591dad51060b4d01d989374) 17383 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6137f32f30cd8f8c6081c20a5a6bb200) 17377 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a67d50389960334cc0cddaf9e18cae713) 17376 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a833c9f70c384faeb871fa267cca49df6) 17378 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6018819ab591dad51060b4d01d989374) (classParma__Polyhedra__Library_1_1Integer__Constant)]
->> endobj
-20275 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Integer__Constant__Common) 1898 0 R (classParma__Polyhedra__Library_1_1Interval) 787 0 R (classParma__Polyhedra__Library_1_1Interval_a0392d17d04d6a71534e7edc09d5a2de4) 10953 0 R (classParma__Polyhedra__Library_1_1Interval_a112e023392095ec2ae4e8d3ac7cc8eee) 10955 0 R (classParma__Polyhedra__Library_1_1Interval_a252ec311fb17e29a3ddcad44b746404d) 10972 0 R (classParma__Polyhedra__Library_1_1Interval_a2f75012f0260eb29d28e3f6ef60c97f4) 10956 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Integer__Constant__Common) (classParma__Polyhedra__Library_1_1Interval_a2f75012f0260eb29d28e3f6ef60c97f4)]
->> endobj
-20276 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Interval_a348c6523b219aee93545bb401dc0b813) 10926 0 R (classParma__Polyhedra__Library_1_1Interval_a479e61ba0938cd3303c57f1881d8f2ab) 10928 0 R (classParma__Polyhedra__Library_1_1Interval_a53dfdee0a44161ba830690eada3b59e2) 10948 0 R (classParma__Polyhedra__Library_1_1Interval_a546174614e2bea37b0f6f5717a90c218) 10929 0 R (classParma__Polyhedra__Library_1_1Interval_aaeb70a45d5ee0c7fac5f5d6c659fc69e) 10927 0 R (classParma__Polyhedra__Library_1_1Inte [...]
-/Limits [(classParma__Polyhedra__Library_1_1Interval_a348c6523b219aee93545bb401dc0b813) (classParma__Polyhedra__Library_1_1Interval_ab5e4dd91b02f044f26a9fcf244ec0c5f)]
->> endobj
-20277 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Interval_ac6f109ff4cedf174407647a6a1ff1566) 10924 0 R (classParma__Polyhedra__Library_1_1Interval_ad7a9b929f459945a7578b161edcf5d4b) 10949 0 R (classParma__Polyhedra__Library_1_1Interval_adb7748cb7d0260ae8e1428698a3076e8) 10950 0 R (classParma__Polyhedra__Library_1_1Interval_af859c3d302c3573b8e2183e4370321b0) 10954 0 R (classParma__Polyhedra__Library_1_1Interval_afb730d60db4b7e1ddd4c9994ec077cf6) 10925 0 R (classParma__Polyhedra__Library_1_1Line [...]
-/Limits [(classParma__Polyhedra__Library_1_1Interval_ac6f109ff4cedf174407647a6a1ff1566) (classParma__Polyhedra__Library_1_1Linear__Expression)]
->> endobj
-20278 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) 1782 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a030483dd2c1346262825de9b2a7f985f) 6843 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a47dc6fa13c0ff235b9ad27ae26973bc7) 6842 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a50973a7d753dc94afb42a610aa71d68d) 6846 0 R (classParma__Polyhedra__Library_1_1Linear__Express [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a81fad4c0c11e6214ddf1851573e56b5f)]
->> endobj
-20279 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ab02f5557504544356029b3bad5f64942) 6844 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac54489beb3010518b290d6afa08902b5) 6837 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8179a7265eb8cfa0fbb55b7f46c18b0) 6839 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8d7d3ac7c1bf2bab50a5594a41a2f25) 6845 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ab02f5557504544356029b3bad5f64942) (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_aeafa7f136ae6eb82b0b996a2df4c6606)]
->> endobj
-20280 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator) 1781 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a21c60e2a5b7d04de458f4d6ff0c3bd9b) 6781 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a2eb19a01c9b844f52f86464fc8f0ddd3) 6797 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a5bfc7fe8384a4382f89fdb9dc06d7f77) 6782 0 R (classParma__Polyhedra__Li [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator) (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_ad7326cf3c2ddd70745aa4a527ece65be)]
->> endobj
-20281 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_af71ceaa08677639eff48aa5929df1c58) 6780 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) 1786 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a0c5be0f5a6fef022b59c78a41f1fa0a1) 7031 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a4fd7b6cb64e68a51df8a7 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_af71ceaa08677639eff48aa5929df1c58) (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_ab758d05c4671c852880999550882f33a)]
->> endobj
-20282 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_af0b2ceba470bdb52cdf9bafa45e76b4a) 7025 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_afd298b0bb1553ae69fdf50038423813d) 7029 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) 11385 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a033a152c478db97a4e08bc562dbff4b1) 11215 0 R (classPa [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_af0b2ceba470bdb52cdf9bafa45e76b4a) (classParma__Polyhedra__Library_1_1Linear__Expression_a0540634ba6d2d2175bf25e92a0831af1)]
->> endobj
-20283 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) 11272 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a0dddfc1f0ff6f55a90c4ea8829b9752b) 11526 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a0ed481e43baf024d4a5b5e86e85c4a87) 11201 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a114f91c420cc8060d6834730c8e55721) 11389 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a158df02c8c54fa5a9286836fb01563cd) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) (classParma__Polyhedra__Library_1_1Linear__Expression_a15c22785d951d9f8f6ec2e14f07b2dc1)]
->> endobj
-20284 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) 11396 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a298a32e26d8133869f28560cca4ba73b) 11274 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a29d81c4c365b593f707cbfd0f960631f) 11563 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) 11388 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3024f7593cf48937f80197fb8030c290) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) (classParma__Polyhedra__Library_1_1Linear__Expression_a3221626e22e187252b866eb371001183)]
->> endobj
-20285 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) 11394 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3393f0e95870b681e528c15803a26f60) 11535 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a34bbf3ed8e75730f44ca8a461881adb6) 11286 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) 11114 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a37de3f55cf5e917e32f7f2f9c6d34840) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) (classParma__Polyhedra__Library_1_1Linear__Expression_a37e6e92bcce55054b61338c740ecabe6)]
->> endobj
-20286 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a385e4d3cfe442f4fcbeefd9acf5c10eb) 11397 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3878ace0dfcc23f80d55d206d2117c84) 11287 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a38856ca7f9129f389b4dee5a5a6da8d4) 11207 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a392d8d530782ff1240e73a9fb15f7975) 11529 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3a808cf2742df02d856a8d9882845861) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a385e4d3cfe442f4fcbeefd9acf5c10eb) (classParma__Polyhedra__Library_1_1Linear__Expression_a4124a10b953c4c49984524875a257f3a)]
->> endobj
-20287 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) 11392 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a447ce24e7e4fdf595ebaa4cf5d1c38b8) 11537 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) 11280 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a49574f120ec3f9fbfda58d6f826587e9) 11384 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a4d372c4dff7d328d3da118817ed3d8b7) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) (classParma__Polyhedra__Library_1_1Linear__Expression_a51f1b18014b098a53242c06d657040c6)]
->> endobj
-20288 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a54156857db022ca821506d19162ebd5a) 11133 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a5812366691d9099f839e01326923425f) 11198 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a58ce6d6e87e4bf19e99478994bbb6010) 11564 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a5a74ca4d6d20b677bd8e4bf05dd45760) 11206 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a5bb7f6903958069b19f70d1391987a51) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a54156857db022ca821506d19162ebd5a) (classParma__Polyhedra__Library_1_1Linear__Expression_a5c4134b034447fcf2b7b154102233dcf)]
->> endobj
-20289 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a61a01c066394a2b9ee5d797f6733c5e4) 11278 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) 11380 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a65766b549090f6b52281c99cfba9eed3) 11401 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a691b91bcd9b5c336892574e975235de5) 11400 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a695843d7e86aecb1d5e9632aae3eec88) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a61a01c066394a2b9ee5d797f6733c5e4) (classParma__Polyhedra__Library_1_1Linear__Expression_a6e35bc42eb22008e842e81b150eeab6f)]
->> endobj
-20290 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) 11395 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) 6368 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a701574facbfd5461d399dccbc88a2999) 11125 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a703e355f3726c0cace243d4fe4b74125) 11542 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a72b6b45299672d85c7984392454296d6)  [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) (classParma__Polyhedra__Library_1_1Linear__Expression_a74deedff2114e5a1c72305ba6c6e42ed)]
->> endobj
-20291 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) 11528 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a789ef1b22376ead412872189bc809269) 11130 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a80d43634ca26fd76dcb1fdede6363dc5) 11399 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a89a4a8da07d80da533b024f24f4864ae) 11129 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a8a1eeaa7f9845c9d33a22c8c5f5acab2) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) (classParma__Polyhedra__Library_1_1Linear__Expression_a8ae08699620424e3c3c97dd7a3885d02)]
->> endobj
-20292 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a8d443d5098921978efd7b625000f3b68) 11391 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a8e50cf8481eaf61b281c180029b36fe3) 11132 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a9075dd07574234cc124e6076c272e987) 11390 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) 11386 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a97f2c2912a13988f28555bee4fe96ef4) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a8d443d5098921978efd7b625000f3b68) (classParma__Polyhedra__Library_1_1Linear__Expression_a98b5ccd1157e6ec8beec7702af9acb36)]
->> endobj
-20293 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a9dd6ce1cb02b58fd3b973e40867362ac) 11382 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aa65a75af714fc5abd032b312a647fe3c) 11211 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aa66d8fe880ea6f99aa1a70805427d9d6) 11285 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aa74c2bb5c2c947d02fabe33f854fa7d6) 11204 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aa8f43e35dec15be4374b207a9440eb2c) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a9dd6ce1cb02b58fd3b973e40867362ac) (classParma__Polyhedra__Library_1_1Linear__Expression_aadaa110a051cded2af6bb04516e8b72e)]
->> endobj
-20294 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_ab1a39b5a84040af5feee0336b275fa95) 11541 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab33dcdd2d3caf28d71cf7d3f2270535d) 11115 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab4396e8bfbdd5831fd37d13c19194cc4) 11393 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab48b93c69098ab1dccd8d063f9c41575) 11271 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab60766264325cf8fc82be004b2565ddb) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ab1a39b5a84040af5feee0336b275fa95) (classParma__Polyhedra__Library_1_1Linear__Expression_abaf335015f8c71026d2bee65ce4d109f)]
->> endobj
-20295 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_abc403edfa30e7e93cfc3aa20be9e3a65) 11209 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_abca5613972564c8ec5c832bc8ff200d6) 11268 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ac1b93dcadc82e52690114301554801b0) 11199 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ac220e6f2cf884a8b2bb4017fc9ae53da) 11266 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ac455ad97639d9e7f59dbdc22e35dc1e7) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_abc403edfa30e7e93cfc3aa20be9e3a65) (classParma__Polyhedra__Library_1_1Linear__Expression_ac9ef23a57b1e85eb8c0e905b16feda93)]
->> endobj
-20296 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_aca00917f32f160b28b9870beb5ce5f8d) 11214 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_acf61af4e3287846f0ca79140ff00a2d5) 11131 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ad44ed4e61b7e7c0c86918b66f44ec665) 11200 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ad4d28b09f6a6ccc12af382b731824efc) 11127 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ad5080c3ee416a445b60ac48971d9b808) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_aca00917f32f160b28b9870beb5ce5f8d) (classParma__Polyhedra__Library_1_1Linear__Expression_ad54fa1aa395d8a01b1d40cef5e307653)]
->> endobj
-20297 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae) 11197 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) 11273 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae25d01221fd2014bead64c551c33c9c5) 11267 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae2f034a1e5e025d25025f71b644d1133) 11213 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae9cc837bbae1745ada3780634c73858f) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae) (classParma__Polyhedra__Library_1_1Linear__Expression_ae9de3534d98524f48d9f6c0cdfbf239c)]
->> endobj
-20298 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_aea20a64dc7e9dd789fb069c7b8faca16) 11282 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aea8819f3edb590eff758fe295c7f3300) 11265 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aea92b7e986d474c9f9e92f3fa2ea56e8) 11126 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aeba04371a7fce3d1b5a20b287937feea) 11289 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_af0d240ef2e0e5d6771cb1767f6fa64b3) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_aea20a64dc7e9dd789fb069c7b8faca16) (classParma__Polyhedra__Library_1_1Linear__Expression_af5bbfb14fef626aee9f34e71a78c0d7d)]
->> endobj
-20299 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_afda2273cf9b1d62249e3604c2c538d92) 11202 0 R (classParma__Polyhedra__Library_1_1Linear__Form) 1238 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0801eaf17912403e4e1028f8a369d340) 11962 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a091ead8d6024998d0b42d3414af7024a) 11736 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0aae60933043b8a5733655f003b49855) 11795 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_afda2273cf9b1d62249e3604c2c538d92) (classParma__Polyhedra__Library_1_1Linear__Form_a0b17cb50f319bb1942e2d93bb03b39f9)]
->> endobj
-20300 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a0fb5c6814551962ec105ad073103cdbf) 11963 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a11faeb0d0bdf510639755bdfa3da44fc) 11792 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a1969778eca91e2d869a184cd86a28b7f) 11741 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a1a3e8432869205057fe502d63327562f) 12031 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a1a88e1933993c8562b586eb50efb635b) 11956 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a0fb5c6814551962ec105ad073103cdbf) (classParma__Polyhedra__Library_1_1Linear__Form_a1dd1c5b1e1b88d96d7aa8eae595625a9)]
->> endobj
-20301 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a249b83627bd1fc3a6e8cff5566de8e1a) 11954 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a25f7695aa23ee1eebaab53c180512003) 11955 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a31950d4b043d6b2e30a6186c68cb0df0) 12027 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a4544162241c2aaa453bf739e3cdbeccc) 11800 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a464efe235d459d13d155c27608940e02) 11804 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a249b83627bd1fc3a6e8cff5566de8e1a) (classParma__Polyhedra__Library_1_1Linear__Form_a4d12b35e0dd97b7319d536f692f50150)]
->> endobj
-20302 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a4dbb70694594789f52b71511d56b9e30) 11796 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a50e316ac5412563b194a422ed639db97) 11875 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a532a142d9884da79dd7c66643aad74ed) 11805 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a55cc14142958a8c9fbab183d63a18d87) 11960 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a61ff1698fe2e74953ee823d59d2ddb31) 11873 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a4dbb70694594789f52b71511d56b9e30) (classParma__Polyhedra__Library_1_1Linear__Form_a62e142e1c4c2cb1a57bf9cb8d47efac2)]
->> endobj
-20303 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a6377f256c9f9706efe893c170dcf4169) 11738 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a6c1cece5e5e0195baa563da3574b2e42) 11869 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a6c53f6f9c17b44e920dbcca5b02b6267) 11872 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a6cd1d9123d91ad11263872e5745a3212) 11961 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a6ffe3fb5134511834617a887244e645f) 11734 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a6377f256c9f9706efe893c170dcf4169) (classParma__Polyhedra__Library_1_1Linear__Form_a705817841ed4087af706fb138250677d)]
->> endobj
-20304 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a768af1a1ab63ec4ae39ec442ec69ffb2) 11793 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a7fea886a5a8d881aaea0392ad771b0de) 11806 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a8121efae2cfdf708bc80df0a29ecace0) 11953 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a8452faaee93aca528132796ec28951ef) 11957 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a868c5d2bfed1531f600d5550a15c9282) 11791 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a768af1a1ab63ec4ae39ec442ec69ffb2) (classParma__Polyhedra__Library_1_1Linear__Form_a8a6be57b7127b316a2d1a9155218cdfb)]
->> endobj
-20305 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a8b1538f5a312dfe26223d4979e615bc3) 12029 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a8e65c033489da565762e3bde7d374d73) 11878 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a928bfef936763acd21344f469b74e83a) 11959 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a97c956c3432528492b019a33b6d4394e) 11881 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a9a97dfad75b130ba9af2bf837221f571) 11790 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a8b1538f5a312dfe26223d4979e615bc3) (classParma__Polyhedra__Library_1_1Linear__Form_aa40049de444ed76982f6b4bd21aa5cfd)]
->> endobj
-20306 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_aa6ff88fd77ab673abc05ffdcf583b957) 12030 0 R (classParma__Polyhedra__Library_1_1Linear__Form_aa79bd8215768f99b2f4955d80abe19bd) 11737 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ab010a109cfc8c298bec09df604e9c6ca) 11797 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ab5a66f5a68773b7bc33d39bdad1a9fb9) 11964 0 R (classParma__Polyhedra__Library_1_1Linear__Form_abbd8b9f2542dfd695e350d178acdb21a) 11739 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_aa6ff88fd77ab673abc05ffdcf583b957) (classParma__Polyhedra__Library_1_1Linear__Form_ac298af7d04123bec59f2a70423c0e4c1)]
->> endobj
-20307 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_ac35d5925785d796c12dc79c193263580) 11742 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ac6910bddc1f60dd99cd77eeaca296341) 11880 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ac6b95d89c30f7eae0d0a6b8b017f3bb6) 11794 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ac9b28fec0aa459e25cf267c3ed31a0e5) 11877 0 R (classParma__Polyhedra__Library_1_1Linear__Form_ace7d8219031e05879897cd3443d35ed8) 11802 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_ac35d5925785d796c12dc79c193263580) (classParma__Polyhedra__Library_1_1Linear__Form_ad326f3bec17300467f639ba345f2dd22)]
->> endobj
-20308 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Linear__Form_adb40b5b841a737ad5e7b8924335eef3a) 11879 0 R (classParma__Polyhedra__Library_1_1Linear__Form_adcca8dd406de66be709434ebb479c9eb) 11868 0 R (classParma__Polyhedra__Library_1_1Linear__Form_aecaf3176848b7bc62927a36ab60067ed) 11870 0 R (classParma__Polyhedra__Library_1_1Linear__Form_afa15deb19dfecdd98737b7375b1ce79e) 11867 0 R (classParma__Polyhedra__Library_1_1Linear__Form_aff8503daaa036375be162237f0d7c87b) 11874 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_adb40b5b841a737ad5e7b8924335eef3a) (classParma__Polyhedra__Library_1_1Linear__Form_affe69279c3c6de02262f18195a95e271)]
->> endobj
-20309 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem) 1901 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) 1784 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a108e6a6005f1a43bf906d349b9c40ea1) 6957 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a2d2a836128949f204da12c2fd3aa4f1c) 6930 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a3d8ac57c5e5aa2a5c2f5576d490c4f11) 6953 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem) (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a400322acab704cef7a052982929182ff)]
->> endobj
-20310 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4699390a942c1aaeaccd2b89b67e5855) 6954 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4734a40ed0f8923109e02efe4cedc4c2) 6963 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a73e4d633b9400d175d45eb4e16f694d3) 6955 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a83032ffb501255f28077473407e1df81) 6932 0 R (classParma__Polyhedra__Library_1_1MIP__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4699390a942c1aaeaccd2b89b67e5855) (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_ad9dae1bccc03e59bf39357297de71360)]
->> endobj
-20311 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_add6624f4b11313bba2819951fb70ea2f) 6929 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af47168d758e7b40a1a458f985427ae28) 6956 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af6ff26a7d66d601d93e6548e8472c892) 6933 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a01993c545c5d4dc725147ac29b1d26e5) 12235 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a0bf7e46a6 [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_add6624f4b11313bba2819951fb70ea2f) (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983a)]
->> endobj
-20312 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983aac4528dcb9794c502cf7c9bd65e9c54ae) 12159 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a162d95e1149e222a317370e2fa25a120) 12233 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a1e73b39b2848f8141aa58219cf97dead) 12294 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a1ee38be62a49852994bf906003b0c23c) 12234 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a1ef2a882e1f0a3121f94eea90a9a16 [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983aac4528dcb9794c502cf7c9bd65e9c54ae) (classParma__Polyhedra__Library_1_1MIP__Problem_a21e9dae374ecb009d8f7f268f5e673e7)]
->> endobj
-20313 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a25be5d5e126674d8aca8b9ec828e289f) 12291 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) 12297 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3601b97efe162fca1df11d70b0b3d607) 12302 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3800cc1eb2fb15d0c42dd71740bb661a) 12232 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3805575c5d920cbc808cf34e44c11fee) 12225 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a25be5d5e126674d8aca8b9ec828e289f) (classParma__Polyhedra__Library_1_1MIP__Problem_a3a010e69cfabe1a026ee21f7639207e3)]
->> endobj
-20314 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) 12303 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3aa58c4d8ded71e574db9d1c59533300) 12239 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a40f18b846fb1fe73b63da7fa7cbbbbca) 12227 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a42acbf3b42263a3dc137395dc8fe1421) 12295 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a485bfce228009ebec2a7bd83d695eddd) 12301 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) (classParma__Polyhedra__Library_1_1MIP__Problem_a49625522da117289c0312c67060210f2)]
->> endobj
-20315 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) 12238 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a57dab2bd4d371c36b4ebf610a6c85759) 12323 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a5da8e430d26c6471590e2c7ae5f7d82e) 12237 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a797f9cf758c537ea0abaffe280cc9682) 12293 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a8a238e31c3b4acf8a023a6346bbf752f) 12289 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) (classParma__Polyhedra__Library_1_1MIP__Problem_a8ccc13c9fa8f27701c935b481a371f89)]
->> endobj
-20316 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a97539a3abb32c8f6dee940d553cec62b) 12300 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aa4a79e7bb87171b31d49429f9d875dcb) 12226 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aa9f9e9fbb372e1f21bd0472b2db20567) 12229 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) 12160 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da4d21924dceed7aac6368d4bc5affec [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a97539a3abb32c8f6dee940d553cec62b) (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da6a4badcfd0bb8d6e536fa16b2d5108d0)]
->> endobj
-20317 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) 12162 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aabfec033a504656ea05620f485442b1e) 12290 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_ab151aa3732a4737e63c5142b42159dc3) 12292 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_ab5ff957e959947c6016cd28be6e2fadd) 12286 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_abd1a41cf267b29ebf81851eb096dc6 [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) (classParma__Polyhedra__Library_1_1MIP__Problem_ae60e06beac90231262189084333bda57)]
->> endobj
-20318 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_aea40406b8f95d9ca4f61f23598448cd5) 12243 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aedfa8f360379ceb195993b2ef04424d4) 12236 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_af46e579954688eec46ac0a43029fdaa1) 12231 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_af9e8e2ee2a429df52a8755417e8c8df6) 12322 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_afc1e5cbd96d9c2819ba1ec2151f3897e) 12284 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_aea40406b8f95d9ca4f61f23598448cd5) (classParma__Polyhedra__Library_1_1MIP__Problem_aff27d012a01487b7c9c14a9a3b40d9b1)]
->> endobj
-20319 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) 1236 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a07785ee99516a90ab920842fa3ab54d1) 12459 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a12e89691311b8923ae33e930a7c89f4b) 8339 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a247581d9877a1544797ef8388c86f6f4) 12460 0 R (classParma__Polyhedra__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a598c3862b9f9e720061d5d3e87995840)]
->> endobj
-20320 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a7ff53437f750fd3ce8781dd441d7c304) 12467 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a89dba3caf804c7ca6db844c67de99371) 12434 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) 8342 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ae0f8501bc09bd6e6247c5d92476a03a1) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a7ff53437f750fd3ce8781dd441d7c304) (classParma__Polyhedra__Library_1_1NNC__Polyhedron)]
->> endobj
-20321 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a163f5dff452c6cf2e3a0c929eb2b8187) 12570 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a16829d6b83d0c21f3d3e1f87c46ac239) 12510 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a2f41d86c5a949d903179e82072854ef4) 12573 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a35d0734550a70a165a87b145be5e8728) 12584 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a42e87760e6f69306e6322cc77f20d162) 12580 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a163f5dff452c6cf2e3a0c929eb2b8187) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a56849f08cce0bbdb7b8118abb30471c2)]
->> endobj
-20322 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a60ae86027d4480aec07a5eed85f6977a) 12509 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a691bb5ef88a4c9638034de4c1b9532cc) 12583 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a6b1f2d6606a0b4d4fc8bbde3b24ce553) 12575 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a7358056031cb08692ae07044715987cd) 12577 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a86c7ff797f1b5e1b31217a176176eb4c) 12585 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a60ae86027d4480aec07a5eed85f6977a) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a89d5bd03139c8fcaf1ab035208d680dd)]
->> endobj
-20323 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a8ee7e3364443dc8cd55f3f6388c81ecf) 12581 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a91cfad066b0e12cdaf7454fe4585cfc5) 12572 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a9dc9e3a464def0e2d929fab9cae6e360) 12574 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_ad5c6d64b009045df8248bcb8ffeea69e) 12579 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_aee8ba0ffc68e00046b55e12427c582cd) 12586 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a8ee7e3364443dc8cd55f3f6388c81ecf) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_af5aee1171c6c67b9c57f3949b7b75be8)]
->> endobj
-20324 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1No__Reduction) 1903 0 R (classParma__Polyhedra__Library_1_1No__Reduction_a5a0edbc51074f6e9e1a908fa292abe13) 12661 0 R (classParma__Polyhedra__Library_1_1No__Reduction_a77067a656a3aa9381a93a23dfba036e4) 12660 0 R (classParma__Polyhedra__Library_1_1No__Reduction_af38e352895f910cc9556dc7ac0d8f39d) 12665 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape) 771 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a003331e749ebf3ac37f3d5d010053 [...]
-/Limits [(classParma__Polyhedra__Library_1_1No__Reduction) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a003331e749ebf3ac37f3d5d01005321a)]
->> endobj
-20325 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a04704288741dbaf6f50e8fc09c43f737) 12728 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a07210f7190db4ecbd9af64ae673e7c00) 13231 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0851645a537132ba61da46cf65011cd8) 13250 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0a0d8c78069019f44dc34ebab82ecfc6) 12989 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0a7f222ac228554b369d460087815b87) 12738 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a04704288741dbaf6f50e8fc09c43f737) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d1677ef76c939ca2025722d2ee249e2)]
->> endobj
-20326 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d4db6f54c7332e1a2e0bc85e16ba176) 12998 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e09e7efc2f63aba534614086427bf49) 12896 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e90a75aac44c14997804b8911ff7bbb) 12831 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e984df6be52ebfb7284efb4c31d8e76) 13131 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e9ecea59dea0ccb1cc3600bc11f1056) 12897 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d4db6f54c7332e1a2e0bc85e16ba176) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a100662089d61a01ea43a28a944da266c)]
->> endobj
-20327 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a107c769c3c982506e2abf6979b9e92f6) 12983 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1091bf4d0e8ce7672f907cf5e7921120) 12730 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a11b4e4651b98d2af87bbc3ac55d76bbb) 13137 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a173628da404c1dc2c4d423cad7f9f960) 13061 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1910bb42882fe059a2ed18f5bad0a501) 12905 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a107c769c3c982506e2abf6979b9e92f6) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a196d1efc79437ca1d96b79b7cd60387f)]
->> endobj
-20328 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a197fc2645bde64519a993bebc73f2caa) 13135 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1ae372d4f3b58cfa4af6edd51d845209) 12830 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1cd37a76428add108f267548ae76664b) 12899 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1d5a47e2290eea8e036bd1623aba53d5) 13063 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1d780ef5b99cc9752eb322353b7b6b08) 13066 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a197fc2645bde64519a993bebc73f2caa) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1f116cd62c9c54702aeafb564bf8e400)]
->> endobj
-20329 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a204fb0538d07ee8ac3d5f2724419928b) 13073 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a217e4addfae235df12c449320e65f891) 12892 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a22b6ac7ec1477dc82d6db22900b59be2) 12821 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a25f104e58f88e05dfcb905bcd66e493b) 12997 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2b05cfa517e14902fe16c4c32c2cb543) 13249 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a204fb0538d07ee8ac3d5f2724419928b) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2d266342acc104c59dc0046242ccdac8)]
->> endobj
-20330 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a2f13e4ffe7b47ec50721791877b41622) 13128 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a353fe86259fbb2dd09d451e9dd468676) 12816 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a35518da8c480784110d40b680256bd61) 12889 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a38da38d0fab7eed9ee09fdb11f88fd15) 13126 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3905c42e02befd8a894c57abd9f972f5) 12820 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a2f13e4ffe7b47ec50721791877b41622) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3b9f6fbac96e03a00d061a2cd2ca2baf)]
->> endobj
-20331 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a44e10aa0180433db7d19fb8e473dc829) 12999 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a46797ad634dc267c1264aa046c69f9f8) 12747 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a46a4105c8476e5f5260a775777398586) 12827 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a46d5dc7df45abdea275f0295fee58c23) 13070 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4b561b7d32821298049fd05598b965f3) 12991 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a44e10aa0180433db7d19fb8e473dc829) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a508d952b878adf2e55d70d6ca1e64d04)]
->> endobj
-20332 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a50ca45a8cfc186aa1fd90160b643d766) 13222 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a51fb0220102e525b11cdb06dcbe322c7) 13127 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a52516b2247ed249d7989a7048a677614) 13064 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a580264341ec83f4bf3d6da1205939b0a) 12901 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a594973c5284386e52b8c33b206a47907) 12900 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a50ca45a8cfc186aa1fd90160b643d766) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5d905934786546ee29986ddc15e2536b)]
->> endobj
-20333 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a5e74729a5f7cabef57fb795cc728869c) 12745 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6156f452e023eb181658f23bde09ec15) 13079 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a634913398afa411ada69f973e0acdb3f) 13134 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a65fe7fbf38e2395261aefa548bf71e94) 13130 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6f9c769f48ed91cd71bec247b7733430) 12740 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a5e74729a5f7cabef57fb795cc728869c) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a702b00ff42a88c23ab25eecf0e9acef0)]
->> endobj
-20334 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a703f57855b17ef63b28f88fe13a51870) 13072 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a72782e7d9a6612efd73b253b0f862c6b) 12988 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a74d2b64496aa448a85ec0b370cee0977) 12819 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a79864149b95e4560a85aa80eb9c1303a) 12987 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7ae373e57180f03b09aa0e38d1f19811) 12829 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a703f57855b17ef63b28f88fe13a51870) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7dcb9b448c8c0171e18f29551077d133)]
->> endobj
-20335 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a81c8a26a02090eb4fb9255dd814514a8) 12825 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a87aadd3a9d47e978a32c9867b13220a4) 13071 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a891529f721ff485fe2ec90ac48952cc6) 12669 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8a329c1ea10527cde394abab15b67356) 12746 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8b99abb6e15eedbdb94e2466e8304c52) 12811 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a81c8a26a02090eb4fb9255dd814514a8) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a934cc1f45a6d438f5d468276140cd5a8)]
->> endobj
-20336 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a940509da64dedf971ad0e8c07fa75bc6) 12742 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a96bae54a01fe00bad4306bec61bb4687) 12668 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9a6c3fb1249ffaf38f7ed7498c138557) 13136 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9b7061aa20aa4b513216bcdb1a905ce7) 13068 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9ff9fc541a420e15ea669068b9c9cc69) 12750 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a940509da64dedf971ad0e8c07fa75bc6) (classParma__Polyhedra__Library_1_1Octagonal__Shape_aa317313059bdf973567d2fcf5e030212)]
->> endobj
-20337 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aa493e3939364ce0db66b42f0ef6511d0) 12898 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaae8e418bb3d7a1432117530eaea7ec4) 12817 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaccc951498a59150e2297e6a9a3843a9) 12743 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aae058fd9619a17e121c3aab9b0612d81) 12894 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaec5aac18085c547d9e8a207e2a91a2a) 13225 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aa493e3939364ce0db66b42f0ef6511d0) (classParma__Polyhedra__Library_1_1Octagonal__Shape_aafdd0083c1c10d49e06f4718a826ae1b)]
->> endobj
-20338 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ab030b7a285d9b5e6470263311eeb87f4) 13228 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab38e5d3ce8cc120ce4b534bc43d90d34) 12741 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab499fba7b7be2932147748248180e057) 12995 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab5dfec17f683d1cbe01cfc71d601108c) 12812 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab7c86f7ff6b09ff72e3ee3382b4c933b) 12815 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ab030b7a285d9b5e6470263311eeb87f4) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab88fa5dbd9a213a4826f1c766d547b55)]
->> endobj
-20339 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aba8ba56b075b2be7b6309cfaed039070) 13076 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aba9abb279871c30a4f0c6cbb188fecc1) 12992 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_abfb434e3d574f4bd53314ac8749c4731) 12986 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_abfde1aac87d8218fce0fa9b4ea8a5eb1) 12984 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac0753202309a8659d436445a609d8ebd) 13230 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aba8ba56b075b2be7b6309cfaed039070) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6376a87e99d3cdabaa6ee7542474849)]
->> endobj
-20340 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_acb19de0243a618e9bf3d62e2ee04ae01) 12890 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_accc6c6488ea9d8555ea8e978cf188749) 12990 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_acfec639e917dfd6eb63c4006ac55b807) 12891 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad178f59cac52085594b73fcdff001cab) 13226 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad423a6ddce01a2f2efb34b826d0de921) 12828 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_acb19de0243a618e9bf3d62e2ee04ae01) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad597da38af773e6cd9335ffd866fa32a)]
->> endobj
-20341 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ad8d04d80653fb850dd92468af1995f97) 13060 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad96422b035879adfe42f8ffd3ac2bcd4) 13227 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad9e4b27a90287bc7f17da3de37be34d2) 13132 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_adb81ef7bfbf3fbe1cedb4776c558c869) 13077 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_adbbe0f9a58b8cfa5c92d54082f2955f2) 13065 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ad8d04d80653fb850dd92468af1995f97) (classParma__Polyhedra__Library_1_1Octagonal__Shape_adc269190695c1745ab086168fcf35835)]
->> endobj
-20342 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ae37107ec8d1402bb69ac6462d7f4646d) 12744 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae3a252c7d19e09650769922c1874a2ad) 13224 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae3be22e7dcdf54fdc0fb976fd755d0c7) 12818 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae85fbe787fa3e172ecf6a63b2847d69a) 12822 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aec298ee7df246c945e6a56442e04176d) 12985 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ae37107ec8d1402bb69ac6462d7f4646d) (classParma__Polyhedra__Library_1_1Octagonal__Shape_aed38463ae788879580d6372653452603)]
->> endobj
-20343 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aedd7f0d898b4ab1df6dfa90605fede79) 13221 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aee949687b91366506561d398d257483b) 13139 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af01e11ba0928481fccc99a0c1cace0d9) 12748 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af14ea5b6122685afd62a3df786512d77) 12813 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af1921cd40fb0920e1173cf67418c63fe) 12809 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aedd7f0d898b4ab1df6dfa90605fede79) (classParma__Polyhedra__Library_1_1Octagonal__Shape_af2c70f89a472f7fa34ba64817693776a)]
->> endobj
-20344 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_af3135ed5b5cb04d1e8a54fa9be77b90f) 13075 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af34d4911235992f1f10dcf2f772ffe05) 13220 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af41476c22751c8d79e8599443aea93da) 13074 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af53fae5a9b3291b56e90e544402f2c0b) 13067 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af7fd07f1f8d91c830130c061da7b6c56) 12814 0 R [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_af3135ed5b5cb04d1e8a54fa9be77b90f) (classParma__Polyhedra__Library_1_1Octagonal__Shape_af9503f2a0fd1535ce7cb9465908006dc)]
->> endobj
-20345 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_afa62abe41a99d6a01cca319ed860bb5b) 13069 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_afa8decb7c7093c9cde1255a6c1af62d4) 12749 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_afb32b5b308dcb625f5a62006c6f3625a) 13138 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_afea57a711a6b7a5d501112b84b246759) 12906 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) 1233 0 R (classParma__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_afa62abe41a99d6a01cca319ed860bb5b) (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a47224e5fc07b3798eb4f2f5837073894)]
->> endobj
-20346 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8684a78903049fa062f98ada32e1a1f4) 13693 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_abb2196b5d457aab2d16ee39b6c0710aa) 13700 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_ac63c0ad7c349a9bc2071d7ed158d9ba0) 13692 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_af3e260242ad3eb13cbe5281f3c51abb5) 13691 0 R (classParma_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8684a78903049fa062f98ada32e1a1f4) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a031ecc9f79496b10a1b48d6626fd98aa)]
->> endobj
-20347 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a058de183d237813010822dc5c734ce5c) 14576 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) 14578 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a3d06dcc99da3a287c6881d2b1e43935a) 14577 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a47e031aae6928828862422b0ceedec71) 14574 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a4d75a1f9b3e618d337fde1b4de9f [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a058de183d237813010822dc5c734ce5c) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a81497d1095efd042cd3034335a3d19e6)]
->> endobj
-20348 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) 14633 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aa5e48e146300e08949a783b435f7672c) 14572 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ab6e5b1dd2b5b7cc9dae9b4ca656cd05a) 14582 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ad096a02cc969dcd4b8606cd77d501070) 14573 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aebe39b79533783e53ef583a9ea30 [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_af6356910030e23dc05bd4e500f073428)]
->> endobj
-20349 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_af8feb908f5def7ba99abb739dd2dc6cc) 14575 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_afab20885083717c18371349d4c182481) 14632 0 R (classParma__Polyhedra__Library_1_1PIP__Problem) 1949 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a04f2cd33bf24eddaa306c392810004ef) 14713 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) 14652 0 R (classParma__Polyhedra__Library_1_1PIP__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_af8feb908f5def7ba99abb739dd2dc6cc) (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece)]
->> endobj
-20350 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) 14645 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1eceaed708535b4103023ee1a5d24ea5ff7b3) 14644 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a08ee3b2a32e3b7b8088a84a8beaca0f4) 14721 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a1c6db3c7a9e8bcc79574dfbb087cf996) 14717 0 R (classParma__Polyhedra__Library_1_1PIP__Proble [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) (classParma__Polyhedra__Library_1_1PIP__Problem_a1fefbce40046822771b243b1d2f1277e)]
->> endobj
-20351 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a25cc092f9c3d26be5b6dac41eb54186c) 14704 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a26a3ca0eb57793c00b0517a6856b8c10) 14710 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a2a7a0b9f3dc8cd6d55e839e20fa28f12) 14751 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a2f2683794347b7bceb41d88e1b1412d8) 14712 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a38cc9e4158abcf9fa6fb719d079108d1) 14702 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a25cc092f9c3d26be5b6dac41eb54186c) (classParma__Polyhedra__Library_1_1PIP__Problem_a56ce97c41ec068deda3ccfd81766ff83)]
->> endobj
-20352 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) 14762 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a5fdacdaf0ba18f647ac7bf95a2624af0) 14761 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a62d38f242bfeb5c6d1a4ccdb28518538) 14701 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a6dd86308a6aa3b0a99e7464fa6d64534) 14718 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a6ffb7a29c69bf20f56f8ba9f16dc74b8) 14714 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) (classParma__Polyhedra__Library_1_1PIP__Problem_a77a39c345913dd490ff33b698d45b7e2)]
->> endobj
-20353 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a785a8dddb80c0cf25b4b02f3f38b0631) 14707 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) 14755 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) 14646 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a2b86312f1e0350f49b28c23bd3815e9c) 14647 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7 [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a785a8dddb80c0cf25b4b02f3f38b0631) (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1)]
->> endobj
-20354 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) 14650 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2adf2b5f608f0f0f055f58d9bedb694855) 14651 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a920510b7460ca0933ea807b88484ed8c) 14752 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a934053580363fb6c281a614d593231f2) 14716 0 R (classParma__Polyhedra__Library_1_1PIP__Proble [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) (classParma__Polyhedra__Library_1_1PIP__Problem_aa7ceb834deaff6303def1cbe95373edc)]
->> endobj
-20355 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_ab9663a6c08e6c35bea0da7fa41c81393) 14722 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) 14757 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abac8b241f6c2a61248fa768b9157203d) 14719 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) 14638 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abfb5615fad7429cb2c340d763df8a43b) 14753 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_ab9663a6c08e6c35bea0da7fa41c81393) (classParma__Polyhedra__Library_1_1PIP__Problem_ad750455647786b5cb28c5422930f0ec0)]
->> endobj
-20356 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) 14708 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_ae6a4663bfee916adb9330010328493d6) 14754 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_ae9d3cb337b4a4a0fc296d2b5b742b7f2) 14711 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_aeffbd9c469a175051d71f3fd7fb525d4) 14653 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_af353ca460687792eb573428e18467f44) 14703 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) (classParma__Polyhedra__Library_1_1PIP__Solution__Node)]
->> endobj
-20357 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a02d378f2284277bd0cf98f4f5e9daa37) 14977 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a082a2f74f2c88339b84f233dc45e3370) 14919 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a49e1548e93467d9fd12ba992f8712c56) 14915 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4ec7c4c8093efb70675c35a17d6a7e28) 14807 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4f54448c4e6823e33a0f5121e5d2 [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a02d378f2284277bd0cf98f4f5e9daa37) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a50a4be6352d2c6b88989c7a49bae79cf)]
->> endobj
-20358 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) 14917 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a68753415da58ce7afaf72efc835a65be) 14982 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c1045d83957e66a37f4b9605431945c) 14913 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c2621d99e009a3c99558671ab046b9b) 14971 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a727cd68e90dd481583b6a2bd5fdf [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a7ef6a6a1d69f65fd28e518f0de795ffa)]
->> endobj
-20359 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a8db329a321108295b995b5af1058ff37) 14911 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a996dc24a90ed7bf0e7231563f3c78975) 14912 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ab41e16bb175c436813472be1b131f853) 14920 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb1b3eeef8a1a793899d9b66f1200fb0) 14914 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb91a97e6b843121536f02146fb4 [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a8db329a321108295b995b5af1058ff37) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac3cf88993e63370f39ad5ea8915ba2af)]
->> endobj
-20360 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) 14973 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) 14969 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) 14972 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node) 1951 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) 1718 0 R (classParma__Polyhedra__Library_1_1PI [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a022891f0008542ea787d812e6e6f9e48)]
->> endobj
-20361 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a243d9267fe6a9414af634749b27dac8d) 3030 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a2bd978ad611c80d14315255b1577772d) 3033 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a3611ca64bf028cea3b37bbfe3c5f84e6) 3039 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a514da3c88769e7584fe9d6da6f2cb003) 3029 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a243d9267fe6a9414af634749b27dac8d) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a6cb598653a5f9e64b0b42b88e5a9b5d1)]
->> endobj
-20362 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) 3028 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a8ca5257af8014cbcb2b4723340b9139d) 3038 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9561e112f9dc57e63230b0fda3858e1a) 3040 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9b395593b699094656f3cc00361976f4) 3035 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ac2c8b1fa8685b79a6e0dac07128b24d9)]
->> endobj
-20363 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_acd547a5df8e528ed1ab16c8f19c97685) 3031 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ad59c13d00ea95d4ed045bca314f5e5fc) 3075 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_adcaa7cd147b3ebb7c52d232824de49e4) 3064 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a048588fb0ac55c4315b0ce6cb1ec274b) 15031 0 R (classParma__Polyhedra__Libr [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_acd547a5df8e528ed1ab16c8f19c97685) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1)]
->> endobj
-20364 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a2d4cc0630c7f91e7e490a1322c53e5c0) 15101 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3b556a97f08c7fc9cbf0e4e9e7b6d901) 15127 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd1af04908aea1d1e5deda23b627a24) 15137 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd966830899423f741449e6567241cd) 15093 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a43eb178d5fe05266ba5f76962e836bfe) 14795 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a2d4cc0630c7f91e7e490a1322c53e5c0) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a454c2aefff18b334bc3e37c1f6e2fb77)]
->> endobj
-20365 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a48b522405ad8896775cbe6d2344bba4a) 15032 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a4a60232026ce7d82ef5a4cee5e482fa9) 15132 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a675704312a01f43f3f2d23f1f24c50c2) 15130 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a6ff7edd489b1d20b1bca1f4431d802f1) 15094 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) 14642 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a48b522405ad8896775cbe6d2344bba4a) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a77459bc72a66ade5bdb58c0ce1aaf020)]
->> endobj
-20366 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) 15030 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a850e5f1b5da521aff7ff926c0b54aa7a) 15104 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a8cd66485ef35802c6c117eab5f641d08) 15089 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9579b18f0878bf26e817c7215ceb4aa3) 15126 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a97ccf10304ef9ba8b58549f7570b8cea) 14806 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9957fb5cc207114f8401d86fd66c7fba)]
->> endobj
-20367 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9ac8b3ffed6355e1de3f16b194a90a42) 15103 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aa53032d6032bb4c199a517187c46636e) 15027 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aafa858d51c2ba75d0778692e95c895c7) 15097 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ab57aada46f9e76478cf7db1ca6ec9091) 15096 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac5612e1699099eb4ce49e81b696ae89f) 15029 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9ac8b3ffed6355e1de3f16b194a90a42) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44)]
->> endobj
-20368 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) 15129 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad0f4f20d94ed76c2a147a571e3f44e6c) 15138 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad2e8f2d9c5b2732df9e001bb155320ca) 15025 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ade3035e2021726b1d2c0c563d6c1216e) 15087 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ae3905fc4ad45180a029f856c7ca7a2fc) 15028 0 R (cla [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af0d04edca3b2e3d30f5d6de7499396b5)]
->> endobj
-20369 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_af46a1a2668f581e1bc158db432912f35) 15088 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af6518b1b7e729018dfc57b6800d904f8) 15095 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) 14640 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) 789 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0477081337723b88cfe4e8a6e8f2929d) 13920 0 R (classParma__Pol [...]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_af46a1a2668f581e1bc158db432912f35) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0c2c96efcf10102068f754c608a12427)]
->> endobj
-20370 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0ea21bf85aa2e90c449435cfedcef181) 13936 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1190fcf4794305386f8475f9ac51ce00) 13859 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a15b21e990e26976e615a7d3244ed843e) 14016 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a187bdab1051f58af280af66645ce1fed) 13845 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0ea21bf85aa2e90c449435cfedcef181) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1d1ef9ef2a29c5aafe1baa14d0e49f23)]
->> endobj
-20371 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1d52cb88936eb0f5bde559b39f8ec42c) 13927 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1daec40615d5a93ce0de360865d93497) 13779 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1dc5b9db43a16365ba0773a96fe1b799) 13851 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a201ee4c814267695f31b30be833917bf) 13926 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1d52cb88936eb0f5bde559b39f8ec42c) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a269f357fca785afae3774b1e084d9b93)]
->> endobj
-20372 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a28f6854a94a3a7d58034cb1d51ae9c7c) 13777 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a294875fd6b469d8949f08c24b5893b6e) 13850 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2c47f2f619b1d0f322b742891920735f) 14022 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2d12805af932544a4fc1575f8db62a3d) 14124 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a28f6854a94a3a7d58034cb1d51ae9c7c) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2fe458f016db5eeeb95bee46f1800533)]
->> endobj
-20373 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a343e039e48425126b187827066d12bf2) 14077 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a38a5f3efb1fe599046d2ed48223bfa41) 13847 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3a031a8e65176b8bd80d2857bd9a68b6) 13931 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3a03cd3ea1b11c1c8dbdf462959d79df) 13867 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a343e039e48425126b187827066d12bf2) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3b90222087f1b165953960beac112e72)]
->> endobj
-20374 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3be7b3a04406453631aef24b817565a5) 13856 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3cad64f36f7df128cc7637c9e0910bf1) 14084 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a41c9a9dc63e253ac5ed21cbdad4e2640) 13860 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a41d30675a3c28980af0f087b06a1f4c1) 13917 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3be7b3a04406453631aef24b817565a5) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a43ab45399b7e22ffcd6403b7e59a473c)]
->> endobj
-20375 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a46f912e8b181561f68062e183005c8bc) 13848 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4857c775f03d5b4ff084723eed2b5e31) 13778 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4a53183970490595ac39c8c070601c6f) 14075 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4ac4e4131c756f0ffce85b9dec7d2b3a) 14078 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a46f912e8b181561f68062e183005c8bc) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a640fe823a102e14522990200193c6701)]
->> endobj
-20376 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6713cca018bed4091ffafb98ca4833d0) 13776 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a676b331ee61606b74be4cd1f90756839) 13935 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6bd361a7c7e187c0ff63c62894e741f8) 13853 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6cd12c70f251a340295cb737ae2deace) 14134 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6713cca018bed4091ffafb98ca4833d0) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a77a2a8e38120a21ac0d5f19eb6e1668b)]
->> endobj
-20377 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a78e60691cfc6b6b52a34cc7952380a84) 13922 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7982064b912c7e29608acf2e4c0a29b4) 14132 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7999968db9fb568980215d2c84393358) 14018 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7a1f9b31c3ed7dc3e7691b9110ddbedb) 14083 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a78e60691cfc6b6b52a34cc7952380a84) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a804363984fe210abe47624522dfb7a92)]
->> endobj
-20378 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a885e896b320d1f4285b5dc92a20f8884) 14070 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a888509fe116790d0b9a267e614be10ec) 13921 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8b2ee24610cb804238f33581093948c1) 14017 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8eb19423295d8af4d69f144fc227128f) 14073 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a885e896b320d1f4285b5dc92a20f8884) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a940db627ef73d29e63fed31acc7553f7)]
->> endobj
-20379 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a964b893c418b1885f22f833e42cd730d) 13787 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a97cc0d02a88d52e79cbb6615a3bbab42) 14021 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a99247c74022e8d51cd0a2d93a87bcfe5) 14026 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a99dc4fb442b60dc9c694d7abc853a3dc) 13865 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a964b893c418b1885f22f833e42cd730d) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9be620ae3a5afa0a9d5b89acfdae387a)]
->> endobj
-20380 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa2a8683afd33a1d57db43c9db16de1f5) 14125 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa8128b9910f31bc963842e48c44a863e) 13866 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aad10819182a33870e4b0a7e3b2bca564) 13858 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aafc9294d3fb5f2c0fd8d4e4d22c283b6) 13932 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa2a8683afd33a1d57db43c9db16de1f5) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab3b8f7e6fdd123f510ba85f4527bdee3)]
->> endobj
-20381 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab73df10027395d3b2c9fbd3f3e77944e) 13919 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aba9a62afaaf44d400bb19bc9af041182) 13785 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abad856c82bc5ed461fed87d318fb5950) 13784 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abb5709426ac80aa0bcf907b4f1d4a577) 14019 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab73df10027395d3b2c9fbd3f3e77944e) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac088d51ee5a9963244f0816e1558c80b)]
->> endobj
-20382 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac238f59379434b7fbfd7dccd74be1cd6) 13934 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2583843b139ce11b842155b35d60332) 13849 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2f1209d77894eb265d41b923b74f9d9) 14131 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac5ec610fb42e16beaac59b537a71f187) 14079 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac238f59379434b7fbfd7dccd74be1cd6) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac7b41dba5d22086cb9715c3f51248f98)]
->> endobj
-20383 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acbcc65a843515d547f055b687d1e6d5f) 14066 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acc8d0378d1cb13b5ddc04dd12cf18ebe) 13855 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad3a8f10409a9fd73afb6691686d6862c) 13925 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad3e2a76d26bef272d0a13fa3bae9a5c2) 13857 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acbcc65a843515d547f055b687d1e6d5f) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adb0fa15c5f30fc4be6a94ce2606208ef)]
->> endobj
-20384 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adb466cb206f1d16d24257a838d130cf2) 13863 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adca9874a75b5ba09114b8495a23c4edd) 13782 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adea57326388915780370a677453778b3) 14072 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adf7bd95cb0014251d60d1fd82c1d3932) 13861 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adb466cb206f1d16d24257a838d130cf2) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae274e65fc3f012ab21bcffa3177228c5)]
->> endobj
-20385 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae386245235cada70fc797b0747b0d326) 13864 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae8be1647844c9837446b9c735f11672b) 14027 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aea7119974f9313e4c93908a2955c4186) 13929 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aef3ebc0ed74af80cd3653321153360bd) 13783 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae386245235cada70fc797b0747b0d326) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af633b1416a118a2ac3146ec4a4fd4298)]
->> endobj
-20386 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afaf0bc4f0e0a036dbc3852b3e4490243) 13928 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afb7b94b681c4d195080fa81ed1480cc2) 13862 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_affd7d0678df82882b006ea7b02771f98) 13923 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset) 788 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a05b872f147220805d2c4ee943a76ef13) 15406 0  [...]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afaf0bc4f0e0a036dbc3852b3e4490243) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0aa45bed5fe5f850d404fa9f415c4b0f)]
->> endobj
-20387 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a0c5d4cd9684f22f35f76212e54b6293a) 15413 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0e607a3a4f75933f5770af4a1c435a2f) 15401 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0ed96a7329312281236730beb476e4b1) 15414 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a12691e00b643410a6f401c55a2266adc) 15415 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a14552a788e6f0f23a513ba57c1ed9129) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a0c5d4cd9684f22f35f76212e54b6293a) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a17e25309469009012f40ed891a2c3f01)]
->> endobj
-20388 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a1857e944bbc4d95b76cb564c647c6fa5) 15501 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1958a70ab97d5ef79b472c38cea304cb) 15491 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2620151d844d477b43ae04337c554e99) 15246 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2915faf8e749672c943206607eb29f4b) 15266 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2fa8e500a9e53318599462001f751c89) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a1857e944bbc4d95b76cb564c647c6fa5) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a34d86332404f9819605dbce5ab19f684)]
->> endobj
-20389 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a37fa37c5d3937c14095868add547dac7) 15343 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a385074bda19450e4b4aba954520ae28b) 15493 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3ac791813ad39c9adfb99a365636d1f7) 15547 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3ecaca69acbfe46c80b475d99757138a) 15546 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3f4e612db0eea52c329f5a6be95197b9) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a37fa37c5d3937c14095868add547dac7) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a410bfbb102ec5ec854351c383685ca91)]
->> endobj
-20390 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a41c7ca1b6cc1f391be10cd4ab3396de1) 15541 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a43d9dc891079233f9ec0618bd5d4b46c) 15328 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a44499a9c2e1c360ce6757ec020786e36) 15602 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a58e593961a5e7c1f92670c9cbcd6b633) 15267 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a58ee2abcd4b191f32ff78c0e768b18b5) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a41c7ca1b6cc1f391be10cd4ab3396de1) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a60f11695efd1e26251b6f2463b989974)]
->> endobj
-20391 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a65234fd4b0ac6aa8765dc960489104c2) 15341 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a69b8be312d167dfebfba35b91c7c9f95) 15324 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6ef292d9fbb334ba7994b8d2b3a5e94f) 15405 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7347d9123ff2c5b816d45a40d74717a9) 15264 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7378d4cf77114743152ad5396a1b7db9) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a65234fd4b0ac6aa8765dc960489104c2) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a741a79dbeefc27764532e2be63120ff8)]
->> endobj
-20392 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a754588d1a8135cb2944e9cc0fd6ec486) 15402 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a76fee04931b37e764744156fdc08d84a) 15496 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a778189ac90f9d76fcbf966965b27c791) 15418 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7b71c85c9201eabfb945527532eaebb4) 15397 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7e6ce9a6495c9482980e3d2f76d948a9) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a754588d1a8135cb2944e9cc0fd6ec486) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a81171c017292bad186bd36d04e0450e2)]
->> endobj
-20393 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a87bccf995617f2884fa2fe2f99479e5e) 15550 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a88358b265bd62da2cd81c56fcd645ff4) 15243 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8b27f6597e651407b433a5098a47a76f) 15263 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8bef907491da530ce94e52f830e84f2c) 15605 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8d79ac97835780e6ca5e2022abf5ab0b) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a87bccf995617f2884fa2fe2f99479e5e) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8fcc73a0fbbd549174fd99a848c3fa52)]
->> endobj
-20394 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a92c73441367e1d9c77bc360a009820b8) 15340 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9531e96c825c3a3ec880db64d5886bb9) 15400 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9639bd96c993f44bae8ec9185cf00d45) 15259 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a98db63b080d0117099060e3faa4f0278) 15251 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a99f8aab5b33871c9652a9f70407b30ca) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a92c73441367e1d9c77bc360a009820b8) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9a99b2b76d216a907dcb515f5ef61cfd)]
->> endobj
-20395 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a9df4749e0d54f9bb1ba38e2392697fa6) 15403 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9fddb040df547f46e9581e9ff7f80107) 15330 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa0bf2a85994114dfd0e8574b94c0843e) 15252 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa1a9bfc80ee005c6dcf60ad60fbcedfd) 15342 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa1b0f7ebce9dd3f01d55861ea1698fdc) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a9df4749e0d54f9bb1ba38e2392697fa6) (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa6540753b860549e4d4be346d7cd0229)]
->> endobj
-20396 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_aa6633280f8aef2c30ed25d9c59544c11) 15399 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aae1e3a3bf181638f33c685688c86e816) 15417 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab061759f73cfae4553fa240e8b5e24de) 15498 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab0a22c4feede666e4f5c3602d21b31ad) 15416 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab3118b07bb55902e522ddf0375eac899) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_aa6633280f8aef2c30ed25d9c59544c11) (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab363ed895c854b9e8cb40960a2fc87ce)]
->> endobj
-20397 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ab617c0a1051fd344e4d44fa5f5415b1f) 15601 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_abe381af245a3eb59deda1dd8d0743c44) 15495 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ac5f23b096482951cc440f5fe9938c8b7) 15500 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_acc7b416e3bc54353d05447fa4cfca8a1) 15552 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_acda879ffdc222a06c9af2f820ac02c5a) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ab617c0a1051fd344e4d44fa5f5415b1f) (classParma__Polyhedra__Library_1_1Pointset__Powerset_acf126b6efb5eac0ac1b9228cfca539f4)]
->> endobj
-20398 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_acfb675b82bc6829361d1647880a2e00d) 15336 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad03499176ca7a20224e1be9c0bc7a8df) 15553 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad1574856ed0bd50691f53d457f7050a3) 15245 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad1e68150be7e04e59627d8ee19c76d10) 15326 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad2b46dff4ba33746c2e55f7767627227) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_acfb675b82bc6829361d1647880a2e00d) (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad44e727022551209ba94ec652b950b8e)]
->> endobj
-20399 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ad5999a9b4d00e7c079fb27a26b640188) 15404 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad7e1698be31b1b95dc7e28d13ec162d5) 15594 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ade90870acddf26103903da3d9e270088) 15329 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_adfb4df5b07b3587b3d723514dede020c) 15494 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae21cdaa1460a54fb14ecb34f3ea30cb9) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ad5999a9b4d00e7c079fb27a26b640188) (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae2abdfa9b2796151d2d8940d14129568)]
->> endobj
-20400 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ae4d04c972b69315f7f82ef303f1b31e7) 15334 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae54a4b74cd6e303628d06baa3014a4a9) 15337 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae816bf5283bdc18773e7b188ef95df81) 15408 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae86262d281c712780a1fd78570080d6f) 15488 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aec6ff4fd4b372a6635251b3129cadd42) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ae4d04c972b69315f7f82ef303f1b31e7) (classParma__Polyhedra__Library_1_1Pointset__Powerset_aed261a7f093a3ea4eb8cc2ba5eea3732)]
->> endobj
-20401 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_aee7b076885815e52c4678cfc0fb9e5a4) 15260 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_af32491e07197b3d96e0068b353e82211) 15411 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_af98f757db804a7f7c7f0ca1b36198f9b) 15489 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_afbae47064f15bcfd238fbb8e778e4ea1) 15335 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_afc2f9c2b16ce6601be8b0b685c0c11e1) [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_aee7b076885815e52c4678cfc0fb9e5a4) (classParma__Polyhedra__Library_1_1Pointset__Powerset_afed62d6b4c6cd06a08a49942907135bb)]
->> endobj
-20402 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_affd60938da7b4567564d56fc29d5cedb) 15551 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_afffb0b03585f4317ffa46aff429b2c6c) 15331 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation) 1952 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a1dd09c87a931132dbee52ea24266866a) 15960 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a4cc725a9fe3bdaded2c131bb8bb47ed8) 15953 0 R (classParma__Polyhedr [...]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_affd60938da7b4567564d56fc29d5cedb) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a553ae81ae234cedad36e72b32c967e65)]
->> endobj
-20403 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a62827195c6aeacf38a8fb3df6df8ff2e) 15958 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a80b9d602f99df76039d58032b20041d7) 15955 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e) 15963 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a9f09728ae53c8e3dadeb202f28bb6fdb) 15959 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa317e5d2d782c3589c48cb3b45d6 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a62827195c6aeacf38a8fb3df6df8ff2e) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa4b60ce3ac62aee15faac1b5035fdb4d)]
->> endobj
-20404 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab92b75d150bd5fbfc03cadec75d59e0f) 15952 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab9da0d811233cfb64481a7fe08b7f645) 15987 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ac8b0d22ea3470020b35240f778c34a94) 15961 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) 15965 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af00b427f47054a80d236d124443c [...]
-/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab92b75d150bd5fbfc03cadec75d59e0f) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af7184f692efc0672e3213f6be9d5cf4c)]
->> endobj
-20405 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation) 1953 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a0ca2fc9566495b3d4ac6b970a301d9a1) 16049 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a306699ac7d5f2c2c909c3a3baf303009) 16056 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a419ea78710f4b45c1542647e1212a3f7) 16048 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a4f7df2a0b66616d7672e562fa8c4e8f6) 16047 0 R (classParma__Polyhe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation) (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a5740d23d50b9aa7c95e8b6b51242258d)]
->> endobj
-20406 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) 16058 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a8ede6a8a55e35d1c41065b01afac0342) 16045 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aa303fa28c55c391afe4f067f91db36ce) 16046 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aaf9d682418e536d9a1f6bd24991e1c56) 16051 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ad99eb5124bfcd9c75379efdde73d [...]
-/Limits [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ade82782e3363de460caad677b3583559)]
->> endobj
-20407 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_af78754c1ef47797c0acbd31cf48f9caf) 16052 0 R (classParma__Polyhedra__Library_1_1Polyhedron) 1252 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a0514c2e57ac8154666e9fe6bb56c0e18) 16131 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a05fba1023938607f7c5e345c0be716e3) 16283 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a075036249d2478e1710f5d6350c849f3) 16279 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a08e91d11 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_af78754c1ef47797c0acbd31cf48f9caf) (classParma__Polyhedra__Library_1_1Polyhedron_a08e91d11b3deb5b694356b5573d2547a)]
->> endobj
-20408 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a0a5c586d872f15baf7fd70941fc16c41) 16209 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a0c58bbc8bf8db5f570da3db42a0ae2f7) 16440 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a0d9abbf681b7b0724963d97596286ae5) 16192 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a13f15417d90174f6c2d3648e83d9fcf5) 16208 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a1a3647877302fc6e0e583b8b881a7a4f) 16445 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a0a5c586d872f15baf7fd70941fc16c41) (classParma__Polyhedra__Library_1_1Polyhedron_a1c30b772596f8f342d0f05b9b142a932)]
->> endobj
-20409 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a1cecffe684d1faa9b0f6b8d4f227e9ae) 16522 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a1d7db8ee4d8972c1818a36d6517ebbff) 16443 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a236a18fe8cc922d00ee92a6c6e42f923) 16276 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a249ea59c1765ea299f4d9471388aa5f9) 16526 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a26cdbeaa84beec1df0c9f86b73b20cfb) 16372 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a1cecffe684d1faa9b0f6b8d4f227e9ae) (classParma__Polyhedra__Library_1_1Polyhedron_a281b8db6a8e0014ab2c41dd15f8c0708)]
->> endobj
-20410 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a2bf7987a6ee3547c1e125e83e432ee2a) 16118 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a3065d01256aa333117e0ee24d99b4431) 16452 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a31d70a625e092dfdaed4f3232701f35d) 16200 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a3569a428ad758dc9ac8273e0f1f77772) 16274 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a371deb67f73bf27ac9a7ff6f2216db9c) 16379 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a2bf7987a6ee3547c1e125e83e432ee2a) (classParma__Polyhedra__Library_1_1Polyhedron_a3b49993a1cd4fc6891da88a6259b9f93)]
->> endobj
-20411 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a3c1e5a2419a5f4a5cf89133606ed1680) 16282 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a418f9959fe50f163773ad9de147821ed) 16455 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a43cd840b1ec99350c222b3f217739cea) 16114 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a49fe44155b41ca85f41b2abc99c39e13) 16281 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a4b428098e57a9101473a54cd71a0753f) 16285 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a3c1e5a2419a5f4a5cf89133606ed1680) (classParma__Polyhedra__Library_1_1Polyhedron_a4f514edad990412bd66cc666347103ab)]
->> endobj
-20412 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a4f9a47ba1b29f1e07a32542584d50686) 16270 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a50e1047c49fffb06bc5089a06a051a3d) 16376 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a527e7c81841bbcf1963c6e260dadfe01) 16449 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a547a8d96908afe5a7f9e4ba2e10d7ac8) 16441 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a5c5da855445b7c877a626d824dfce64e) 15873 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a4f9a47ba1b29f1e07a32542584d50686) (classParma__Polyhedra__Library_1_1Polyhedron_a5d53d09dcc839672fedd4ab5d4142d57)]
->> endobj
-20413 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a5df26655af3ae7844569d7086edf8332) 16206 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a5dfef947c46e234a1ffd4707312332ec) 16112 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6187dbe974649c7bd4de8e66f70d3e46) 16132 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a672b0568e7a27c37b3afde649f7c0171) 16286 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6b737abc8f33b2a2362e3f9c9ab08d58) 16454 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a5df26655af3ae7844569d7086edf8332) (classParma__Polyhedra__Library_1_1Polyhedron_a6b987d283ce345c52b5d193c0688ad28)]
->> endobj
-20414 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a6c7c72e56241da463eaeccdff79b6d49) 16507 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6e73a7d462d6a9a3891fff6c4a923495) 16204 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6e9d9dd7740b414d407c16687c99a88e) 16439 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6fb94f0e966e97bfb9dcf43dddcf12ba) 16120 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7366f9b91109b63f078e963bccd9f5b4) 16384 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a6c7c72e56241da463eaeccdff79b6d49) (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7)]
->> endobj
-20415 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a76c9012a376984a1b88823a59bd5bcde) 16572 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7af48c81caa850300e6042bea1008a38) 16205 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7b8d597a3c23af1fce9d8d3e1d36e11d) 16116 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) 16211 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7e68bea365fe939d08c91ec4edc61a2b) 16267 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a76c9012a376984a1b88823a59bd5bcde) (classParma__Polyhedra__Library_1_1Polyhedron_a8132d1a9b329271fb4f7faeb59c89c39)]
->> endobj
-20416 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a858e0030826ee6c29545a934166874ef) 16521 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a86d2bbceaa288f2f605ac88516d313cb) 16518 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a87ebe6f7cd176227f61c6d0fe47a4f68) 16451 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) 16577 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a8c33b9ea975535b5aa0882241cf78986) 16190 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a858e0030826ee6c29545a934166874ef) (classParma__Polyhedra__Library_1_1Polyhedron_a8ed700f662722cbebdc9328344ba2839)]
->> endobj
-20417 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a90016052cbe535d7e8b1e20a2c599053) 16382 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a941caad4d0717e0fab30bf246adc0370) 16575 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a96e902093a55f87f0aebc2bb13a8d740) 16273 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a9764ef2f159cfdcca3f151e899bd43ef) 16448 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a97ddb3b93ac699eebaca7e79f691b0ad) 16115 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a90016052cbe535d7e8b1e20a2c599053) (classParma__Polyhedra__Library_1_1Polyhedron_a98c785602c5af8f7e0c1be92bb5e8b71)]
->> endobj
-20418 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a9a45b4b8f148a20359a2f3e2b1c2cb2d) 16271 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a9bc768bb8d7d9b971b44b8b3be738963) 16456 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a9f3c5474494eb306717bc3da7c109307) 16130 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa0ac997a15935821583174de968e5bff) 16193 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa26e1a5815b7a0c3b610395c854594bf) 16278 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a9a45b4b8f148a20359a2f3e2b1c2cb2d) (classParma__Polyhedra__Library_1_1Polyhedron_aa38fbbd15d5dc2e98d5b24c92b06c290)]
->> endobj
-20419 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_aa39bdf85d6db02629fa73bbcaddab6d5) 16512 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa6b6fed08414c86d33fc4a44c59e9e22) 16450 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa78179b1d8478dce6cf572af8e0b9cb4) 16508 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa809bff4b85d09cd801e5e5cde1b8c06) 16370 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ab1b315e7f04c051a36f48d344dd34052) 16272 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_aa39bdf85d6db02629fa73bbcaddab6d5) (classParma__Polyhedra__Library_1_1Polyhedron_ab4959b3da46291de301d9150f5afc3aa)]
->> endobj
-20420 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ab6ab1820f2fdf444d1431ff3af424451) 16519 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ab7a35f8df974c9e932df6291754859fb) 16117 0 R (classParma__Polyhedra__Library_1_1Polyhedron_abbb7562de97ccf13bd97b57bb5e3ac94) 16194 0 R (classParma__Polyhedra__Library_1_1Polyhedron_abfd98397c137d81dcc27111fba3ccd54) 16277 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac2182f38e9f8acede601c3dcfa71c3b3) 16207 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ab6ab1820f2fdf444d1431ff3af424451) (classParma__Polyhedra__Library_1_1Polyhedron_ac251eb38d1b24b8b570d874ee11df424)]
->> endobj
-20421 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ac26060b9b14465d4f1d948ab9c838c9c) 16383 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac5c7acc50141a9104ef5b9b7598c1438) 16201 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac6ea1802e6a6cfb32e5af6d6d26eb424) 16121 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac93800b9ec7aae75937598e1f2209b1f) 16371 0 R (classParma__Polyhedra__Library_1_1Polyhedron_acbc86683af6afc0818cc9e980a84fcb8) 16377 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ac26060b9b14465d4f1d948ab9c838c9c) (classParma__Polyhedra__Library_1_1Polyhedron_acf531d280805472a54c22fed0f689932)]
->> endobj
-20422 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) 16573 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad6a8cc7029bad7ad7ad116c90ff59aec) 16275 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad6d1e866b7ba9bf4233f3a5254cda0f9) 16523 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad84befb6d0ded481871cbef1b7306824) 16574 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad909d5b60cab5d1a6816577c97b60fcf) 16189 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) (classParma__Polyhedra__Library_1_1Polyhedron_ad914801461cad05325559e95b9c4d9c6)]
->> endobj
-20423 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_adee3b5c0c3800ce2214e68a156cbcf77) 16453 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae10fbc38125e63858549f5ec8a25e046) 16369 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae1c5216e2ba5c80d77e128daea25b46e) 16119 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae3be29eddce8f41019e7dcb731c8ba7b) 16198 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae58a861a42c5216a2267e3f94ecaec8c) 16513 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_adee3b5c0c3800ce2214e68a156cbcf77) (classParma__Polyhedra__Library_1_1Polyhedron_ae680437fdc213b7174c581caa2e0c0d3)]
->> endobj
-20424 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ae89cd985111a1a27c60a6fcc28ae9788) 16378 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aeb14f5522982b3874f2cd19586813421) 16268 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aeeb72a31f8e1823de7a8123585a331b6) 16280 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) 16442 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af074d4d4d406dd065812b32cc8714222) 16446 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ae89cd985111a1a27c60a6fcc28ae9788) (classParma__Polyhedra__Library_1_1Polyhedron_af15f956dac6d4b19ecd8fee0f9718f29)]
->> endobj
-20425 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_af47944944e16e786df5c0671e7baa995) 16373 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af496ec55802726ee3b39e52458ab0647) 16514 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af60c3f345fb8ec8c708e49e8fa33f737) 16269 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af740303d5461c838735ec53c5c1f8855) 16199 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af882ff84afd3c2507e17ffa62ffd20a0) 16576 0 R (classParma__Polyhedra__Libra [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_af47944944e16e786df5c0671e7baa995) (classParma__Polyhedra__Library_1_1Polyhedron_af8c0f1f8dc80d82fed8943f2c5737d2d)]
->> endobj
-20426 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Polyhedron_afc2a04d2049183cddbcf70316fdf40e7) 16524 0 R (classParma__Polyhedra__Library_1_1Powerset) 1954 0 R (classParma__Polyhedra__Library_1_1Powerset_a01b873b0e820222e07789c3ba5fa48ae) 17122 0 R (classParma__Polyhedra__Library_1_1Powerset_a04aed5c92cf15c71ce85b8cc173a893b) 17067 0 R (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) 17166 0 R (classParma__Polyhedra__Library_1_1Powerset_a0a660ed1cfae2599d7f9236f208 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_afc2a04d2049183cddbcf70316fdf40e7) (classParma__Polyhedra__Library_1_1Powerset_a0a660ed1cfae2599d7f9236f2084d499)]
->> endobj
-20427 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_a113964ab3d7ea36326ce962629a322ce) 17112 0 R (classParma__Polyhedra__Library_1_1Powerset_a1c71c9b7d1de1b77eeb054e1c0ac935e) 17010 0 R (classParma__Polyhedra__Library_1_1Powerset_a1ee74f5687635ddbb9729be31a37e2d3) 17114 0 R (classParma__Polyhedra__Library_1_1Powerset_a241c65ff3d32769cbb9badd2c8e00ca5) 17069 0 R (classParma__Polyhedra__Library_1_1Powerset_a272424f5d0df282c6d1ee63a5c84e3e6) 17066 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_a113964ab3d7ea36326ce962629a322ce) (classParma__Polyhedra__Library_1_1Powerset_a277ba920e188477bb301196b19d63770)]
->> endobj
-20428 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_a2edf5fe7007a3e91a404546ca2f2d98c) 17109 0 R (classParma__Polyhedra__Library_1_1Powerset_a30e0b0c2c668e73566cb1720d72cdac2) 17119 0 R (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) 17006 0 R (classParma__Polyhedra__Library_1_1Powerset_a37703f96495cf4bcb8ced3ff20e4c396) 17108 0 R (classParma__Polyhedra__Library_1_1Powerset_a386fa9c84bc37468f1a3a2b860a0bc3d) 17107 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_a2edf5fe7007a3e91a404546ca2f2d98c) (classParma__Polyhedra__Library_1_1Powerset_a411d42e5b59a492742793834efeeabc1)]
->> endobj
-20429 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_a411da088d0c6344021ea086a87a09ee4) 17164 0 R (classParma__Polyhedra__Library_1_1Powerset_a44b0a622563e60fe28b91b7e9ff76364) 17072 0 R (classParma__Polyhedra__Library_1_1Powerset_a53acb5e9daa7c362b4d9023ae3a96447) 17111 0 R (classParma__Polyhedra__Library_1_1Powerset_a5534b8f8fbd973bfb7051cf5fb31f19d) 17116 0 R (classParma__Polyhedra__Library_1_1Powerset_a5a36a32ab46d46f574f3091e931e2bd2) 17059 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_a411da088d0c6344021ea086a87a09ee4) (classParma__Polyhedra__Library_1_1Powerset_a5c3bee913efb87e4661df746e184e1e1)]
->> endobj
-20430 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_a5d2c2fc2c077e77db657af49d332c9b5) 17157 0 R (classParma__Polyhedra__Library_1_1Powerset_a5eb3117d3d7d0566a99f9f5807276864) 17071 0 R (classParma__Polyhedra__Library_1_1Powerset_a66e3e2f2433738665eb748d2f6c5878f) 17057 0 R (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) 17007 0 R (classParma__Polyhedra__Library_1_1Powerset_a754f66ed06474d4b68a93131af02a86f) 17063 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_a5d2c2fc2c077e77db657af49d332c9b5) (classParma__Polyhedra__Library_1_1Powerset_a7607ef1c8ef6b668dd2be62c39330406)]
->> endobj
-20431 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_a86f44d9d38638be46ef23422783f847e) 17124 0 R (classParma__Polyhedra__Library_1_1Powerset_a8c82df1de8703aefeab268dc9ffc557f) 17061 0 R (classParma__Polyhedra__Library_1_1Powerset_a900663a0e97525c064ccf31152fa8ae7) 17009 0 R (classParma__Polyhedra__Library_1_1Powerset_a9fb86f09111d4ac21fdc7c7baa86e622) 17070 0 R (classParma__Polyhedra__Library_1_1Powerset_aa18495186f3f1b0fef979ec7d8147b81) 17163 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_a86f44d9d38638be46ef23422783f847e) (classParma__Polyhedra__Library_1_1Powerset_aa215867508a89858bcc7ab025f8d20f1)]
->> endobj
-20432 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) 17013 0 R (classParma__Polyhedra__Library_1_1Powerset_ab66151b86ac8c495eba1a3209501928a) 17068 0 R (classParma__Polyhedra__Library_1_1Powerset_ab955487a974e74224f3d72d743ee78a4) 17110 0 R (classParma__Polyhedra__Library_1_1Powerset_ac3283cf8fd0dd8ff2a319cba1dead1f2) 17055 0 R (classParma__Polyhedra__Library_1_1Powerset_acdc1e9b5ac338be9d0584d50d275226e) 17060 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) (classParma__Polyhedra__Library_1_1Powerset_ad18afd61b30d839d5b7669b3a8dea008)]
->> endobj
-20433 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) 17012 0 R (classParma__Polyhedra__Library_1_1Powerset_ad34bafd07f582c558936f9ea8892abd6) 17158 0 R (classParma__Polyhedra__Library_1_1Powerset_ad3bda090e4ac93d937ac4dd775c20919) 17113 0 R (classParma__Polyhedra__Library_1_1Powerset_adab2c45cbec19ad11bf34db42b794508) 17064 0 R (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) 17005 0 R (classParma__Polyhedra__Library_1_1Powe [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) (classParma__Polyhedra__Library_1_1Powerset_adef4c62b5cdf5186801c592cc62dccea)]
->> endobj
-20434 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Powerset_ae006881831b298f0af5031e99df2bc6f) 17058 0 R (classParma__Polyhedra__Library_1_1Powerset_aee126cc2eef44ab1d2055d0d15bc3169) 17120 0 R (classParma__Polyhedra__Library_1_1Powerset_af60bb41867a12ce28144596e3cc1406a) 17011 0 R (classParma__Polyhedra__Library_1_1Powerset_affd1594c3bfb8bfc8e5c01c5bf0403b1) 17125 0 R (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) 1956 0 R (classParma__Polyhedra__Library_1_1Shape__Preserving__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_ae006881831b298f0af5031e99df2bc6f) (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_a8411ac9c6855778aa3f0f47a66bdfff6)]
->> endobj
-20435 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_aa8bb2afcbf530af32dd1251242a480e9) 17230 0 R (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_aaaf6dc9a305149db551f3dff63d7e6f4) 17229 0 R (classParma__Polyhedra__Library_1_1Smash__Reduction) 1957 0 R (classParma__Polyhedra__Library_1_1Smash__Reduction_a8041e8b3420a554e9637e4dfcf43c2b1) 17252 0 R (classParma__Polyhedra__Library_1_1Smash__Reduction_aa3b0210cf6bc4dc319d24d429518c61d) 17248 0 R (classParm [...]
-/Limits [(classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_aa8bb2afcbf530af32dd1251242a480e9) (classParma__Polyhedra__Library_1_1Smash__Reduction_aa4959b6198e090d37abbd07085b74a30)]
->> endobj
-20436 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) 1234 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a11a03a73950216b9010c2350cf5ea7e3) 8343 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a1e3eb354a88609b46573e1dc2ce6dba9) 8340 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5ac67f2c19f4e1d46eb4d81e280aa581) 8370 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a726c33ab611816cd9b55a61621488650)]
->> endobj
-20437 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a74fd79622aa9418de9e842a0d72bbcbe) 17314 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a768d2ac67126a0515bfea7d2c4d225dc) 17316 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a7ea3fd6cffaa3a413e3c2734a43bf28e) 17317 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_aaba6bdfeae05d8463a8208b0c6b7a62a) 17313 0 R (classParma__Polyhedra__Library_ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a74fd79622aa9418de9e842a0d72bbcbe) (classParma__Polyhedra__Library_1_1Threshold__Watcher)]
->> endobj
-20438 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Throwable) 1959 0 R (classParma__Polyhedra__Library_1_1Throwable_a14c081beabe1e165b1dc44b2a84b6c2b) 17354 0 R (classParma__Polyhedra__Library_1_1Throwable_a5024cc2b142473f5f733a8808cb09162) 17373 0 R (classParma__Polyhedra__Library_1_1Unary__Operator) 1993 0 R (classParma__Polyhedra__Library_1_1Unary__Operator__Common) 1994 0 R (classParma__Polyhedra__Library_1_1Unary__Operator__Common_a56b1bfd700c1f088b6be622b7b67a257) 17399 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Throwable) (classParma__Polyhedra__Library_1_1Unary__Operator__Common_a56b1bfd700c1f088b6be622b7b67a257)]
->> endobj
-20439 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Unary__Operator__Common_aba21572aebe99f81b7f09b75f3b2d903) 17400 0 R (classParma__Polyhedra__Library_1_1Variable) 1995 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) 1232 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a03ef7bb6314fd8cb72c4a5d4aaa4ff99) 17550 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a082d6ea17c164846898241075349cd31) 8341 0 R (classPa [...]
-/Limits [(classParma__Polyhedra__Library_1_1Unary__Operator__Common_aba21572aebe99f81b7f09b75f3b2d903) (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a0ca3ec141b70de5ebcbf18d22aa1242f)]
->> endobj
-20440 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) 8344 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a72b690903949d7e94dd627f7b49ab4cb) 17516 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a7aaa618bcb2bd6d5bf7777a277afd00f) 17557 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a7ddc454f90fc8200f333eee7896deb1e) 17517 0 R (classParma__ [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_aea16ed2cd1cce0f92352901ce90db8b1)]
->> endobj
-20441 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_af838a20e1508816e754fdfee5f4d2c1d) 17548 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_afcf9668b49ab7bc9559825c26963ed1a) 17549 0 R (classParma__Polyhedra__Library_1_1Variable_a2617e76e0aef9021ef98ea381cd1ac3c) 17458 0 R (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) 17443 0 R (classParma__Polyhedra__Library_1_1Variable_a44e2225e59844067e00529757 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_af838a20e1508816e754fdfee5f4d2c1d) (classParma__Polyhedra__Library_1_1Variable_a49b4a338d3d82bfb7a404ea87481fc4d)]
->> endobj
-20442 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variable_a4f6d85b054ae413ec0b77ff6522b7304) 17456 0 R (classParma__Polyhedra__Library_1_1Variable_a5012c55d8fdb1420b80a3bfbe5a5b843) 14794 0 R (classParma__Polyhedra__Library_1_1Variable_a616f25ab81383a9c22ff3577a89a74c3) 17459 0 R (classParma__Polyhedra__Library_1_1Variable_a7102c6fe85d4c8e6939d29a047becbdb) 17446 0 R (classParma__Polyhedra__Library_1_1Variable_a75683687bda865c93db529b76271bed2) 17452 0 R (classParma__Polyhedra__Library_1_1Vari [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variable_a4f6d85b054ae413ec0b77ff6522b7304) (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c)]
->> endobj
-20443 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) 17451 0 R (classParma__Polyhedra__Library_1_1Variable_aae21b0f5a4289485ef86a9d11fcbfc50) 17449 0 R (classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) 17445 0 R (classParma__Polyhedra__Library_1_1Variable_ad71d7986fdfd19215fc87726ebacf555) 17457 0 R (classParma__Polyhedra__Library_1_1Variable_aed0f237309569c2bfbf9e6f60740974e) 17448 0 R (classParma__Polyhedra__Library_1_1Vari [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) (classParma__Polyhedra__Library_1_1Variables__Set)]
->> endobj
-20444 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variables__Set_a0b93ff227453cf62d922dab902055f8b) 17612 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a32b7f9e0a2f54d199ad55bc008bfa62e) 17609 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a3a5d4b3fb638414792155bcef8b54c1c) 17611 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a3d49b2488d36bda4fef0109bedf6b0cc) 17606 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a4090b6696c19cb93c705d9a9e06f4915) 17608 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_a0b93ff227453cf62d922dab902055f8b) (classParma__Polyhedra__Library_1_1Variables__Set_a4c3c15515e1335fb69130aad4f371a1c)]
->> endobj
-20445 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variables__Set_a4e8f85cded8a6be1916c2cc0bb31c540) 17610 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a587efac6e5a2fbde0a1866dbe4427224) 17616 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a6e710cc6607e4ec2791b182707bb4f1f) 17632 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a7176b36adef9683aae06961175ad94cb) 17607 0 R (classParma__Polyhedra__Library_1_1Variables__Set_ab90c3d16fa19df74d838587f40d74477) 17617 0 R (classPar [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_a4e8f85cded8a6be1916c2cc0bb31c540) (classParma__Polyhedra__Library_1_1Variables__Set_aca3690ce9d77a85740cdf8a508edf127)]
->> endobj
-20446 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371) 17604 0 R (classParma__Polyhedra__Library_1_1Variables__Set_afbcfd5d585123fad758b763b4e2ed336) 17605 0 R (classParma__Polyhedra__Library_1_1Watchdog) 1997 0 R (classParma__Polyhedra__Library_1_1Watchdog_a0f5f7c074992bb3c4464fa554490fb3d) 17636 0 R (classParma__Polyhedra__Library_1_1Watchdog_ad5a1348ca7621bbaac38c11716affd61) 17638 0 R (classParma__Polyhedra__Library_1_1Watchdog_ae59da834d6abca4c7 [...]
-/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371) (classParma__Polyhedra__Library_1_1Watchdog_ae59da834d6abca4c75ec2cba498871f5)]
->> endobj
-20447 0 obj <<
-/Names [(classParma__Polyhedra__Library_1_1Watchdog_ae6136681f74ee2a46497793fcf6222b1) 17635 0 R (group__PPL__CXX__interface) 1988 0 R (group__PPL__CXX__interface_ga00a906832c41c42a70a5c9d194e07a7d) 2321 0 R (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) 2246 0 R (group__PPL__CXX__interface_ga13bf4cf2db045bfd362c5c8aae7f785b) 2327 0 R (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e) 2322 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Watchdog_ae6136681f74ee2a46497793fcf6222b1) (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e)]
->> endobj
-20448 0 obj <<
-/Names [(group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) 2239 0 R (group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) 2378 0 R (group__PPL__CXX__interface_ga233295f67896774a4fa42920a4b8522b) 2379 0 R (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) 2230 0 R (group__PPL__CXX__interface_ga266a81f442cf72bfded10a4ecb79f130) 2323 0 R (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142) 2340 0 R]
-/Limits [(group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142)]
->> endobj
-20449 0 obj <<
-/Names [(group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) 2266 0 R (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) 2130 0 R (group__PPL__CXX__interface_ga34d9dfd53548ce172ae94462d24f41e6) 2338 0 R (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) 2384 0 R (group__PPL__CXX__interface_ga3ccd0ef2cbdc282106525b2f0e734c7e) 2335 0 R (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d) 2376 0 R]
-/Limits [(group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d)]
->> endobj
-20450 0 obj <<
-/Names [(group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) 2269 0 R (group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) 2375 0 R (group__PPL__CXX__interface_ga470bfc567789301bfdc28fd70ed82f92) 2386 0 R (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) 2343 0 R (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) 2383 0 R (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae) 2330 0 R]
-/Limits [(group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae)]
->> endobj
-20451 0 obj <<
-/Names [(group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) 2331 0 R (group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) 2329 0 R (group__PPL__CXX__interface_ga60f87e33c0dde9f5c2c7d3b4b78818ab) 2385 0 R (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) 2259 0 R (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) 2236 0 R (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e) 2336 0 R]
-/Limits [(group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e)]
->> endobj
-20452 0 obj <<
-/Names [(group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) 2332 0 R (group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) 2339 0 R (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) 2253 0 R (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) 2129 0 R (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) 2341 0 R (group__PPL__CXX__interface_ga79bd3696a302bb721ef8168fa5d650fb) 2127 0 R]
-/Limits [(group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) (group__PPL__CXX__interface_ga79bd3696a302bb721ef8168fa5d650fb)]
->> endobj
-20453 0 obj <<
-/Names [(group__PPL__CXX__interface_ga7a529f51bfebdd4b3e69c866dced9bc1) 2112 0 R (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) 2382 0 R (group__PPL__CXX__interface_ga809c78f95611c4b838b4e8f097a03e32) 2334 0 R (group__PPL__CXX__interface_ga8458e58a5e857de11c35ce3076a70ab8) 2125 0 R (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) 2262 0 R (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) 2128 0 R]
-/Limits [(group__PPL__CXX__interface_ga7a529f51bfebdd4b3e69c866dced9bc1) (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de)]
->> endobj
-20454 0 obj <<
-/Names [(group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) 2377 0 R (group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) 2325 0 R (group__PPL__CXX__interface_ga984f2c32e934b6510731f6a7faf28296) 2328 0 R (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) 2277 0 R (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) 2131 0 R (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) 2250 0 R]
-/Limits [(group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654)]
->> endobj
-20455 0 obj <<
-/Names [(group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) 2337 0 R (group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) 2380 0 R (group__PPL__CXX__interface_gabadfeba0a415d210cdd6d7309365e800) 2126 0 R (group__PPL__CXX__interface_gac40e401b77b5ec6e9625c317ce6d760d) 2326 0 R (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) 2280 0 R (group__PPL__CXX__interface_gae19dfe022c51c874d905e2a7c81c18f1) 2124 0 R]
-/Limits [(group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) (group__PPL__CXX__interface_gae19dfe022c51c874d905e2a7c81c18f1)]
->> endobj
-20456 0 obj <<
-/Names [(group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) 2324 0 R (group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) 2333 0 R (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) 2342 0 R (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) 2249 0 R (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) 2247 0 R (group__PPL__CXX__interface_gga113f1e845cba6b1c3c57 [...]
-/Limits [(group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1ab39e3c667ce455313f8ff578722af2e9)]
->> endobj
-20457 0 obj <<
-/Names [(group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab) 2244 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) 2240 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea556cc08f48e769b9c15bea83d5d883a1) 2241 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea8191bdbdcd041a9859ed465d16062ab1) 2245 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667 [...]
-/Limits [(group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab) (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416)]
->> endobj
-20458 0 obj <<
-/Names [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) 2233 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) 2232 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2abeee33de6f8542b0228161d044640eaa) 2231 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2ae0c0414fd69996a2edb8ea476ab236e1) 2235 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd82 [...]
-/Limits [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13a39adc66b0a3d8cae2a7dc2abc8885c69)]
->> endobj
-20459 0 obj <<
-/Names [(group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) 2268 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) 2270 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) 2275 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa8d3ab7646117632841be76c043efc39b) 2276 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb686 [...]
-/Limits [(group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fab25413bda9bbd45d2f22366d0e0ef831)]
->> endobj
-20460 0 obj <<
-/Names [(group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d) 2271 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) 2273 0 R (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) 2260 0 R (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaf4462ec77078de4bbabb446cf61e5123) 2261 0 R (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e7 [...]
-/Limits [(group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d) (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370)]
->> endobj
-20461 0 obj <<
-/Names [(group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559) 2257 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) 2254 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda9a59b7fa00c2cf8df942badc9c414aef) 2258 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdac58a6ff6765224e937fefbadf45a4860) 2255 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152b [...]
-/Limits [(group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559) (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7869fdfe9b1ace668a0a7b1d2faba812)]
->> endobj
-20462 0 obj <<
-/Names [(group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) 2265 0 R (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) 2263 0 R (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a3b60d6dfe175b3a5d48361ac121f23ae) 2279 0 R (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) 2278 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
-/Limits [(group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a057025d0ff550a2226a0a1273c84b4f6)]
->> endobj
-20463 0 obj <<
-/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) 2157 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) 2139 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a202263943c451b9fdfe003b2bc8d0b1f) 2158 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a261922c7bb53bf71459671df868e55da) 2156 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
-/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4194f750c76fb24d6e5930e1696076c4)]
->> endobj
-20464 0 obj <<
-/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) 2143 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) 2142 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a5912e00d1de38a643d48af1f0e5dd35f) 2151 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) 2138 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
-/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a9f5dce9506b72773425c0504845d8e4e)]
->> endobj
-20465 0 obj <<
-/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab) 2155 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) 2150 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) 2147 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) 2134 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
-/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6)]
->> endobj
-20466 0 obj <<
-/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b) 2137 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) 2144 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) 2159 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ad5e386c6a05c9656eac42fe9e2cdd8b5) 2136 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
-/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae0c660bfcbcd3d10c3e764e22f41d0a1)]
->> endobj
-20467 0 obj <<
-/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3) 2135 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) 2152 0 R (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) 2252 0 R (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) 2251 0 R (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170 [...]
-/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3) (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05)]
->> endobj
-20468 0 obj <<
-/Names [(group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) 2282 0 R (index) 759 0 R (index_A_Note_on_the_Implementation_of_the_Operators) 1258 0 R (index_Adding_New_Dimensions_to_the_Vector_Space) 925 0 R (index_Adding_a_Disjunct) 1162 0 R (index_Affine_Hyperplanes_and_Half_spaces) 864 0 R]
-/Limits [(group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) (index_Affine_Hyperplanes_and_Half_spaces)]
->> endobj
-20469 0 obj <<
-/Names [(index_Affine_Independence_and_Affine_Dimension) 909 0 R (index_Anc91) 1272 0 R (index_Approximating_Bounded_Integers) 831 0 R (index_Approximating_Integers) 828 0 R (index_BA05) 1273 0 R (index_BCCetal02) 1039 0 R]
-/Limits [(index_Affine_Independence_and_Affine_Dimension) (index_BCCetal02)]
->> endobj
-20470 0 obj <<
-/Names [(index_BDHetal05) 1060 0 R (index_BDHetal06) 1286 0 R (index_BDHetal07) 1288 0 R (index_BFT00) 1289 0 R (index_BFT01) 1290 0 R (index_BGP99) 1202 0 R]
-/Limits [(index_BDHetal05) (index_BGP99)]
->> endobj
-20471 0 obj <<
-/Names [(index_BHMZ04) 1291 0 R (index_BHMZ05_widening) 1053 0 R (index_BHMZ05a) 1059 0 R (index_BHMZ05b) 1292 0 R (index_BHRZ03_widening) 1000 0 R (index_BHRZ03a) 1003 0 R]
-/Limits [(index_BHMZ04) (index_BHRZ03a)]
->> endobj
-20472 0 obj <<
-/Names [(index_BHRZ03b) 1293 0 R (index_BHRZ05) 1294 0 R (index_BHZ02a) 1295 0 R (index_BHZ02b) 1312 0 R (index_BHZ03a) 1313 0 R (index_BHZ03b) 1203 0 R]
-/Limits [(index_BHRZ03b) (index_BHZ03b)]
->> endobj
-20473 0 obj <<
-/Names [(index_BHZ04) 1149 0 R (index_BHZ05) 1315 0 R (index_BHZ06a) 1316 0 R (index_BHZ06b) 1318 0 R (index_BHZ07a) 1319 0 R (index_BHZ07b) 1320 0 R]
-/Limits [(index_BHZ04) (index_BHZ07b)]
->> endobj
-20474 0 obj <<
-/Names [(index_BHZ07c) 1321 0 R (index_BHZ08a) 1322 0 R (index_BHZ08b) 1323 0 R (index_BHZ09a) 1340 0 R (index_BHZ09b) 1341 0 R (index_BHZ09c) 1342 0 R]
-/Limits [(index_BHZ07c) (index_BHZ09c)]
->> endobj
-20475 0 obj <<
-/Names [(index_BHZ09d) 1344 0 R (index_BHZ10) 1345 0 R (index_BJT99) 1346 0 R (index_BK89) 1347 0 R (index_BMPZ10) 1348 0 R (index_BMPZ12a) 1349 0 R]
-/Limits [(index_BHZ09d) (index_BMPZ12a)]
->> endobj
-20476 0 obj <<
-/Names [(index_BMPZ12b) 1350 0 R (index_BRZH02a) 1351 0 R (index_BRZH02b) 851 0 R (index_BRZH02c) 1352 0 R (index_Bag97) 1274 0 R (index_Bag98) 1148 0 R]
-/Limits [(index_BMPZ12b) (index_Bag98)]
->> endobj
-20477 0 obj <<
-/Names [(index_Basic_Geometric_Descriptors) 782 0 R (index_Bounded_Difference_Shapes) 1034 0 R (index_Bounded_Polyhedra) 874 0 R (index_CC76) 1038 0 R (index_CC76_extrapolation) 1054 0 R (index_CC76_interval_widening) 1023 0 R]
-/Limits [(index_Basic_Geometric_Descriptors) (index_CC76_interval_widening)]
->> endobj
-20478 0 obj <<
-/Names [(index_CC79) 1359 0 R (index_CC92) 1360 0 R (index_CH78) 1058 0 R (index_Certificate_Based_Widenings) 1197 0 R (index_Che64) 1361 0 R (index_Che65) 1362 0 R]
-/Limits [(index_CC79) (index_Che65)]
->> endobj
-20479 0 obj <<
-/Names [(index_Che68) 1363 0 R (index_Collapsing_a_Powerset_Element) 1165 0 R (index_Combinations_and_Hulls) 880 0 R (index_Concatenating_Polyhedra) 923 0 R (index_Congruence_Relations) 1056 0 R (index_Constraint_Geometric_Descriptors) 784 0 R]
-/Limits [(index_Che68) (index_Constraint_Geometric_Descriptors)]
->> endobj
-20480 0 obj <<
-/Names [(index_Constraints_Representation) 877 0 R (index_Convex_Polyhedra) 866 0 R (index_Convex_Polyhedral_Difference) 916 0 R (index_Cylindrification) 976 0 R (index_Dan63) 1364 0 R (index_Double_Description) 893 0 R]
-/Limits [(index_Constraints_Representation) (index_Double_Description)]
->> endobj
-20481 0 obj <<
-/Names [(index_Dropping_Non_Integer_Points) 829 0 R (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) 941 0 R (index_Extrapolation_Operators) 1017 0 R (index_FCB07) 1365 0 R (index_FP96) 1367 0 R (index_Fea88) 1366 0 R]
-/Limits [(index_Dropping_Non_Integer_Points) (index_Fea88)]
->> endobj
-20482 0 obj <<
-/Names [(index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) 944 0 R (index_Fuk98) 852 0 R (index_GDDetal04) 948 0 R (index_GJ00) 1369 0 R (index_GJ01) 1370 0 R (index_GR77) 1371 0 R]
-/Limits [(index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) (index_GR77)]
->> endobj
-20483 0 obj <<
-/Names [(index_Generalized_Affine_Relations) 966 0 R (index_Generator_Geometric_Descriptors) 796 0 R (index_Generators_Representation) 889 0 R (index_Generic_Operations_on_Semantic_Geometric_Descriptors) 805 0 R (index_Geometric_Comparisons) 1172 0 R (index_Gra91) 1377 0 R]
-/Limits [(index_Generalized_Affine_Relations) (index_Gra91)]
->> endobj
-20484 0 obj <<
-/Names [(index_Gra97) 1378 0 R (index_Grid_Affine_Dimension) 1089 0 R (index_Grid_Affine_Transformation) 1101 0 R (index_Grid_Extrapolation) 1131 0 R (index_Grid_Frequency) 1105 0 R (index_Grid_Generalized_Image) 1103 0 R]
-/Limits [(index_Gra97) (index_Grid_Generalized_Image)]
->> endobj
-20485 0 obj <<
-/Names [(index_Grid_Generator_Representation) 1072 0 R (index_Grid_Minimized_Representations) 1083 0 R (index_Grid_Relation_With) 1115 0 R (index_Grid_Space_Dimensions) 1087 0 R (index_Grid_Time_Elapse) 1113 0 R (index_Grid_Widening) 1127 0 R]
-/Limits [(index_Grid_Generator_Representation) (index_Grid_Widening)]
->> endobj
-20486 0 obj <<
-/Names [(index_Grid_Widening_with_Tokens) 1129 0 R (index_Grid_Wrapping_Operator) 1117 0 R (index_Grids_Double_Description_Grids) 1085 0 R (index_H79_widening) 999 0 R (index_HH95) 1380 0 R (index_HHL90) 1381 0 R]
-/Limits [(index_Grid_Widening_with_Tokens) (index_HHL90)]
->> endobj
-20487 0 obj <<
-/Names [(index_HKP95) 1382 0 R (index_HLW94) 1383 0 R (index_HMT71) 983 0 R (index_HPR94) 1384 0 R (index_HPR97) 984 0 R (index_HPWT01) 1385 0 R]
-/Limits [(index_HKP95) (index_HPWT01)]
->> endobj
-20488 0 obj <<
-/Names [(index_Hal79) 1002 0 R (index_Hal93) 1379 0 R (index_Images_and_Preimages_of_Affine_Transfer_Relations) 947 0 R (index_Integer_Combinations) 1068 0 R (index_Intersection_and_Convex_Polyhedral_Hull) 914 0 R (index_Intervals_and_Boxes) 1021 0 R]
-/Limits [(index_Hal79) (index_Intervals_and_Boxes)]
->> endobj
-20489 0 obj <<
-/Names [(index_JMSY94) 1387 0 R (index_Jea02) 1386 0 R (index_KBBetal06) 1388 0 R (index_Kuh56) 1398 0 R (index_LW97) 1402 0 R (index_Le) 1399 0 R]
-/Limits [(index_JMSY94) (index_Le)]
->> endobj
-20490 0 obj <<
-/Names [(index_Loe99) 1400 0 R (index_MRTT53) 1408 0 R (index_Mapping_the_Dimensions_of_the_Vector_Space) 936 0 R (index_Mas92) 1403 0 R (index_Mas93) 1404 0 R (index_Meet_Preserving_Simplification) 980 0 R]
-/Limits [(index_Loe99) (index_Meet_Preserving_Simplification)]
->> endobj
-20491 0 obj <<
-/Names [(index_Meet_and_Upper_Bound) 1147 0 R (index_Min01a) 1405 0 R (index_Min01b) 1406 0 R (index_Min02) 1407 0 R (index_Min04) 1227 0 R (index_Min05) 1228 0 R]
-/Limits [(index_Meet_and_Upper_Bound) (index_Min05)]
->> endobj
-20492 0 obj <<
-/Names [(index_Minimized_Representations) 891 0 R (index_NF01) 1409 0 R (index_NJPF99) 1410 0 R (index_NO77) 1411 0 R (index_NO80) 1412 0 R (index_NR00) 1421 0 R]
-/Limits [(index_Minimized_Representations) (index_NR00)]
->> endobj
-20493 0 obj <<
-/Names [(index_NW88) 853 0 R (index_Octagonal_Shapes) 1036 0 R (index_On_Const_Correctness_A_Warning_about_the_Use_of_References_and_Iterators) 1264 0 R (index_On_Object_Orientation_and_Polymorphism_A_Disclaimer) 1262 0 R (index_On_Pointset_Powerset_and_Partially_Reduced_Product_Domains_A_Warning) 1260 0 R (index_Operations_on_Convex_Polyhedra) 913 0 R]
-/Limits [(index_NW88) (index_Operations_on_Convex_Polyhedra)]
->> endobj
-20494 0 obj <<
-/Names [(index_PS98) 1423 0 R (index_Pairwise_Merge) 1190 0 R (index_Points_Closure_Points_Rays_and_Lines) 882 0 R (index_Points_Parameters_Lines) 1070 0 R (index_Powerset_Extrapolation_Operators) 1193 0 R (index_Powerset_Meet_Preserving_Simplification) 1001 0 R]
-/Limits [(index_PS98) (index_Powerset_Meet_Preserving_Simplification)]
->> endobj
-20495 0 obj <<
-/Names [(index_Pra77) 1422 0 R (index_QRR96) 1424 0 R (index_QRR97) 1425 0 R (index_QRW00) 1426 0 R (index_RBL06) 1427 0 R (index_Rational_Grids) 1066 0 R]
-/Limits [(index_Pra77) (index_Rational_Grids)]
->> endobj
-20496 0 obj <<
-/Names [(index_Rational_Polyhedra) 911 0 R (index_Relation_With_Operators) 995 0 R (index_Removing_Dimensions_from_the_Vector_Space) 927 0 R (index_Ric02) 1428 0 R (index_SK07) 850 0 R (index_SS07a) 1431 0 R]
-/Limits [(index_Rational_Polyhedra) (index_SS07a)]
->> endobj
-20497 0 obj <<
-/Names [(index_SS07b) 1432 0 R (index_SW70) 1433 0 R (index_Sch99) 1093 0 R (index_Semantic_Geometric_Descriptors) 761 0 R (index_Sho81) 1429 0 R (index_Single_Update_Affine_Functions) 955 0 R]
-/Limits [(index_SS07b) (index_Single_Update_Affine_Functions)]
->> endobj
-20498 0 obj <<
-/Names [(index_Single_Update_Bounded_Affine_Relations) 962 0 R (index_Space_Dimensions_and_Dimension_Compatibility) 901 0 R (index_Sri93) 1430 0 R (index_Syntactic_Geometric_Descriptors) 780 0 R (index_The_Powerset_Domain) 1143 0 R (index_Time_Elapse_Operator) 978 0 R]
-/Limits [(index_Single_Update_Bounded_Affine_Relations) (index_Time_Elapse_Operator)]
->> endobj
-20499 0 obj <<
-/Names [(index_Topologies_and_Topological_compatibility) 868 0 R (index_Upward_Approximation) 819 0 R (index_Vectors_Matrices_and_Scalar_Products) 848 0 R (index_War03) 1434 0 R (index_Weakly_Relational_Shape_Interface) 1049 0 R (index_Weakly_Relational_Shapes) 1033 0 R]
-/Limits [(index_Topologies_and_Topological_compatibility) (index_Weakly_Relational_Shapes)]
->> endobj
-20500 0 obj <<
-/Names [(index_Wey35) 1441 0 R (index_Wey50) 1442 0 R (index_Widening_Operators) 997 0 R (index_Widening_and_Extrapolation_Operators_on_Boxes) 1031 0 R (index_Widening_and_Extrapolation_Operators_on_WR_Shapes) 1051 0 R (index_Widening_with_Tokens) 1014 0 R]
-/Limits [(index_Wey35) (index_Widening_with_Tokens)]
->> endobj
-20501 0 obj <<
-/Names [(index_Wil93) 854 0 R (index_Wrapping_Operator) 846 0 R (index_affine_form_relation) 964 0 R (index_affine_relation) 946 0 R (index_bibliography) 1271 0 R (index_bounded_extrapolation) 1020 0 R]
-/Limits [(index_Wil93) (index_bounded_extrapolation)]
->> endobj
-20502 0 obj <<
-/Names [(index_convex_polys) 766 0 R (index_expand_space_dimension) 940 0 R (index_floating_point) 1223 0 R (index_fold_space_dimensions) 943 0 R (index_fp_abstract_domains) 1249 0 R (index_interval_linear_forms) 1224 0 R]
-/Limits [(index_convex_polys) (index_interval_linear_forms)]
->> endobj
-20503 0 obj <<
-/Names [(index_intervals) 1022 0 R (index_limited_extrapolation) 1019 0 R (index_pointset_powerset) 1150 0 R (index_powerset) 1141 0 R (index_powerset_domain) 1142 0 R (index_pps_bgp99_extrapolation) 1192 0 R]
-/Limits [(index_intervals) (index_pps_bgp99_extrapolation)]
->> endobj
-20504 0 obj <<
-/Names [(index_pps_certificate_widening) 1196 0 R (index_pps_geometric) 1171 0 R (index_pps_pairwise_merge) 1189 0 R (index_preamble) 760 0 R (index_ps_add_disjunct) 1161 0 R (index_ps_collapse) 1164 0 R]
-/Limits [(index_pps_certificate_widening) (index_ps_collapse)]
->> endobj
-20505 0 obj <<
-/Names [(index_ps_meet_upper_bound) 1146 0 R (index_ps_operations) 1145 0 R (index_rational_grid_operations) 1091 0 R (index_relation_with) 994 0 R (index_representation) 876 0 R (index_sect_rational_grids) 1055 0 R]
-/Limits [(index_ps_meet_upper_bound) (index_sect_rational_grids)]
->> endobj
-20506 0 obj <<
-/Names [(index_use_of_library) 767 0 R (namespaceParma__Polyhedra__Library) 1575 0 R (namespaceParma__Polyhedra__Library_1_1IO__Operators) 1576 0 R (namespaceParma__Polyhedra__Library_1_1IO__Operators_a9ccf426c9d89537e0351aac50a333e95) 2976 0 R (namespaceParma__Polyhedra__Library_a03ed91fbbeb6d32952c5d2a30bfd3830) 2817 0 R (namespaceParma__Polyhedra__Library_a05dd6b345e96427a50b45f9756e302ab) 2818 0 R]
-/Limits [(index_use_of_library) (namespaceParma__Polyhedra__Library_a05dd6b345e96427a50b45f9756e302ab)]
->> endobj
-20507 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_a0adf6106892886dc859985042b8a7433) 2822 0 R (namespaceParma__Polyhedra__Library_a19b0ebdb3476fe1feb0f51d9328fd384) 2895 0 R (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) 2815 0 R (namespaceParma__Polyhedra__Library_a30a5addfb775d0e3586f1575ece47bf6) 2816 0 R (namespaceParma__Polyhedra__Library_a3bb2c0ddb1b766959ee6149bb52a7e61) 2660 0 R (namespaceParma__Polyhedra__Library_a3e6dcd6f5d8e3ea263c9205b21a83e48) 2892 0 R]
-/Limits [(namespaceParma__Polyhedra__Library_a0adf6106892886dc859985042b8a7433) (namespaceParma__Polyhedra__Library_a3e6dcd6f5d8e3ea263c9205b21a83e48)]
->> endobj
-20508 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_a5604f97d216583cdf012a50d2f8cdbde) 2824 0 R (namespaceParma__Polyhedra__Library_a5e801a56c2c3dcec13d2d87adf07ac47) 2894 0 R (namespaceParma__Polyhedra__Library_a63bd7c7767faf3c219f9c2762095e2dd) 2829 0 R (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) 2820 0 R (namespaceParma__Polyhedra__Library_a6a54c55d8b52ef353df7cefdfa632d8d) 2893 0 R (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) 2830 0 R]
-/Limits [(namespaceParma__Polyhedra__Library_a5604f97d216583cdf012a50d2f8cdbde) (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee)]
->> endobj
-20509 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_a74074a5ed3718745a4d82bacd5b381ed) 2891 0 R (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) 2819 0 R (namespaceParma__Polyhedra__Library_a99e9dc5df3cf7c0ab581e602d1176e41) 2826 0 R (namespaceParma__Polyhedra__Library_a9c118832fed4c0b9b40547578459dad4) 2889 0 R (namespaceParma__Polyhedra__Library_abdd9791a8d91b11a5bd3a6ef0770bc86) 2828 0 R (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833) 2659 0 R]
-/Limits [(namespaceParma__Polyhedra__Library_a74074a5ed3718745a4d82bacd5b381ed) (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833)]
->> endobj
-20510 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_aca6003248d614d68c07f5330b468a242) 2821 0 R (namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) 2661 0 R (namespaceParma__Polyhedra__Library_ace0cdceaa0c7eea84cc1c38cf5bea680) 2888 0 R (namespaceParma__Polyhedra__Library_ad31eeb0067d6cad2eb2ea5ab5bd0a2b2) 2890 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8) 2754 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a9606fc251d7670 [...]
-/Limits [(namespaceParma__Polyhedra__Library_aca6003248d614d68c07f5330b468a242) (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a9606fc251d767040929d3e2645dbb446)]
->> endobj
-20511 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a96b8890edb38e9960c455aa178e508ba) 2755 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a979f37a289d4cb316643f1dcc07ec7cd) 2757 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8abd640c30f757e4ecccd08ac527536ca6) 2756 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98) 2759 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a0 [...]
-/Limits [(namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a96b8890edb38e9960c455aa178e508ba) (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a468389fd24e4a478d296cbcf6b104eb0)]
->> endobj
-20512 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c) 2766 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9223ac459b80b2eb397dd7810be7aa07) 2764 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9afce68d66f8c8eedec345f8df2e822f) 2761 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98accf532c4e56a06e520b6b3f638371667) 2763 0 R (namespaceParma__Polyhedra__Libr [...]
-/Limits [(namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c) (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98af4fca65e2503d4afea11aa9b9da7d51e)]
->> endobj
-20513 0 obj <<
-/Names [(namespaceParma__Polyhedra__Library_aee4e9b54e65780ac3010fda40ea235a6) 2831 0 R (namespaceParma__Polyhedra__Library_af127b16b1a8e300aa97caca515284b6f) 2825 0 R (namespaceParma__Polyhedra__Library_af9dd9190c5f29dbbfa3d6e442dea7e7d) 2823 0 R (namespacestd) 1577 0 R (page.1) 526 0 R (page.10) 887 0 R]
-/Limits [(namespaceParma__Polyhedra__Library_aee4e9b54e65780ac3010fda40ea235a6) (page.10)]
->> endobj
-20514 0 obj <<
-/Names [(page.100) 3248 0 R (page.101) 3327 0 R (page.102) 3425 0 R (page.103) 3500 0 R (page.104) 3570 0 R (page.105) 3660 0 R]
-/Limits [(page.100) (page.105)]
->> endobj
-20515 0 obj <<
-/Names [(page.106) 3693 0 R (page.107) 3700 0 R (page.107d) 17785 0 R (page.108) 3712 0 R (page.109) 3726 0 R (page.11) 899 0 R]
-/Limits [(page.106) (page.11)]
->> endobj
-20516 0 obj <<
-/Names [(page.110) 3738 0 R (page.111) 3753 0 R (page.112) 3767 0 R (page.113) 3781 0 R (page.114) 3799 0 R (page.115) 3814 0 R]
-/Limits [(page.110) (page.115)]
->> endobj
-20517 0 obj <<
-/Names [(page.116) 3831 0 R (page.117) 3850 0 R (page.118) 3864 0 R (page.119) 3882 0 R (page.12) 908 0 R (page.120) 3899 0 R]
-/Limits [(page.116) (page.120)]
->> endobj
-20518 0 obj <<
-/Names [(page.121) 3915 0 R (page.122) 3930 0 R (page.123) 3947 0 R (page.124) 3961 0 R (page.125) 3981 0 R (page.126) 4000 0 R]
-/Limits [(page.121) (page.126)]
->> endobj
-20519 0 obj <<
-/Names [(page.127) 4015 0 R (page.128) 4036 0 R (page.129) 4056 0 R (page.13) 921 0 R (page.130) 4069 0 R (page.130d) 18708 0 R]
-/Limits [(page.127) (page.130d)]
->> endobj
-20520 0 obj <<
-/Names [(page.131) 4082 0 R (page.132) 4093 0 R (page.133) 4105 0 R (page.134) 4131 0 R (page.135) 4154 0 R (page.136) 4224 0 R]
-/Limits [(page.131) (page.136)]
->> endobj
-20521 0 obj <<
-/Names [(page.137) 4306 0 R (page.138) 4392 0 R (page.139) 4483 0 R (page.14) 935 0 R (page.140) 4551 0 R (page.141) 4619 0 R]
-/Limits [(page.137) (page.141)]
->> endobj
-20522 0 obj <<
-/Names [(page.142) 4708 0 R (page.143) 4733 0 R (page.143d) 17880 0 R (page.144) 4748 0 R (page.145) 4762 0 R (page.146) 4775 0 R]
-/Limits [(page.142) (page.146)]
->> endobj
-20523 0 obj <<
-/Names [(page.147) 4791 0 R (page.148) 4805 0 R (page.149) 4819 0 R (page.15) 953 0 R (page.150) 4836 0 R (page.151) 4851 0 R]
-/Limits [(page.147) (page.151)]
->> endobj
-20524 0 obj <<
-/Names [(page.152) 4867 0 R (page.153) 4886 0 R (page.154) 4903 0 R (page.155) 4921 0 R (page.156) 4937 0 R (page.157) 4952 0 R]
-/Limits [(page.152) (page.157)]
->> endobj
-20525 0 obj <<
-/Names [(page.158) 4970 0 R (page.159) 4985 0 R (page.16) 961 0 R (page.160) 5001 0 R (page.161) 5016 0 R (page.162) 5035 0 R]
-/Limits [(page.158) (page.162)]
->> endobj
-20526 0 obj <<
-/Names [(page.163) 5053 0 R (page.164) 5066 0 R (page.165) 5076 0 R (page.166) 5090 0 R (page.166d) 18274 0 R (page.167) 5099 0 R]
-/Limits [(page.163) (page.167)]
->> endobj
-20527 0 obj <<
-/Names [(page.168) 5125 0 R (page.169) 5192 0 R (page.17) 974 0 R (page.170) 5218 0 R (page.170d) 17973 0 R (page.171) 5231 0 R]
-/Limits [(page.168) (page.171)]
->> endobj
-20528 0 obj <<
-/Names [(page.172) 5246 0 R (page.173) 5261 0 R (page.174) 5295 0 R (page.175) 5327 0 R (page.176) 5345 0 R (page.177) 5376 0 R]
-/Limits [(page.172) (page.177)]
->> endobj
-20529 0 obj <<
-/Names [(page.178) 5434 0 R (page.179) 5490 0 R (page.18) 992 0 R (page.180) 5545 0 R (page.181) 5587 0 R (page.182) 5649 0 R]
-/Limits [(page.178) (page.182)]
->> endobj
-20530 0 obj <<
-/Names [(page.183) 5713 0 R (page.184) 5753 0 R (page.185) 5777 0 R (page.186) 5804 0 R (page.187) 5813 0 R (page.188) 5831 0 R]
-/Limits [(page.183) (page.188)]
->> endobj
-20531 0 obj <<
-/Names [(page.189) 5847 0 R (page.19) 1013 0 R (page.190) 5861 0 R (page.191) 5877 0 R (page.192) 5889 0 R (page.193) 5894 0 R]
-/Limits [(page.189) (page.193)]
->> endobj
-20532 0 obj <<
-/Names [(page.194) 5920 0 R (page.195) 5942 0 R (page.196) 5990 0 R (page.197) 6009 0 R (page.198) 6022 0 R (page.199) 6034 0 R]
-/Limits [(page.194) (page.199)]
->> endobj
-20533 0 obj <<
-/Names [(page.2) 539 0 R (page.20) 1030 0 R (page.200) 6044 0 R (page.201) 6055 0 R (page.202) 6082 0 R (page.203) 6109 0 R]
-/Limits [(page.2) (page.203)]
->> endobj
-20534 0 obj <<
-/Names [(page.204) 6166 0 R (page.205) 6245 0 R (page.206) 6334 0 R (page.207) 6366 0 R (page.208) 6381 0 R (page.209) 6397 0 R]
-/Limits [(page.204) (page.209)]
->> endobj
-20535 0 obj <<
-/Names [(page.21) 1048 0 R (page.210) 6412 0 R (page.211) 6425 0 R (page.212) 6471 0 R (page.213) 6531 0 R (page.214) 6592 0 R]
-/Limits [(page.21) (page.214)]
->> endobj
-20536 0 obj <<
-/Names [(page.215) 6617 0 R (page.216) 6628 0 R (page.217) 6642 0 R (page.218) 6659 0 R (page.219) 6707 0 R (page.22) 1065 0 R]
-/Limits [(page.215) (page.22)]
->> endobj
-20537 0 obj <<
-/Names [(page.220) 6734 0 R (page.221) 6750 0 R (page.222) 6773 0 R (page.223) 6789 0 R (page.224) 6831 0 R (page.225) 6852 0 R]
-/Limits [(page.220) (page.225)]
->> endobj
-20538 0 obj <<
-/Names [(page.226) 6876 0 R (page.227) 6919 0 R (page.228) 6951 0 R (page.229) 6993 0 R (page.23) 1080 0 R (page.230) 7018 0 R]
-/Limits [(page.226) (page.230)]
->> endobj
-20539 0 obj <<
-/Names [(page.231) 7058 0 R (page.232) 7096 0 R (page.233) 7117 0 R (page.234) 7180 0 R (page.235) 7245 0 R (page.236) 7340 0 R]
-/Limits [(page.231) (page.236)]
->> endobj
-20540 0 obj <<
-/Names [(page.237) 7468 0 R (page.238) 7499 0 R (page.239) 7512 0 R (page.24) 1100 0 R (page.240) 7526 0 R (page.241) 7542 0 R]
-/Limits [(page.237) (page.241)]
->> endobj
-20541 0 obj <<
-/Names [(page.242) 7556 0 R (page.242d) 18433 0 R (page.243) 7574 0 R (page.244) 7595 0 R (page.245) 7651 0 R (page.246) 7706 0 R]
-/Limits [(page.242) (page.246)]
->> endobj
-20542 0 obj <<
-/Names [(page.247) 7731 0 R (page.248) 7759 0 R (page.249) 7785 0 R (page.25) 1112 0 R (page.250) 7823 0 R (page.251) 7880 0 R]
-/Limits [(page.247) (page.251)]
->> endobj
-20543 0 obj <<
-/Names [(page.252) 7904 0 R (page.253) 7949 0 R (page.254) 7978 0 R (page.255) 7995 0 R (page.256) 8034 0 R (page.257) 8065 0 R]
-/Limits [(page.252) (page.257)]
->> endobj
-20544 0 obj <<
-/Names [(page.258) 8087 0 R (page.259) 8101 0 R (page.26) 1125 0 R (page.260) 8122 0 R (page.261) 8165 0 R (page.262) 8215 0 R]
-/Limits [(page.258) (page.262)]
->> endobj
-20545 0 obj <<
-/Names [(page.263) 8239 0 R (page.264) 8255 0 R (page.265) 8262 0 R (page.266) 8297 0 R (page.267) 8325 0 R (page.268) 8357 0 R]
-/Limits [(page.263) (page.268)]
->> endobj
-20546 0 obj <<
-/Names [(page.269) 8378 0 R (page.27) 1140 0 R (page.270) 8398 0 R (page.271) 8430 0 R (page.272) 8493 0 R (page.273) 8581 0 R]
-/Limits [(page.269) (page.273)]
->> endobj
-20547 0 obj <<
-/Names [(page.274) 8683 0 R (page.275) 8790 0 R (page.276) 8843 0 R (page.277) 8884 0 R (page.278) 8903 0 R (page.279) 8914 0 R]
-/Limits [(page.274) (page.279)]
->> endobj
-20548 0 obj <<
-/Names [(page.28) 1159 0 R (page.280) 8932 0 R (page.281) 8950 0 R (page.282) 8968 0 R (page.283) 8980 0 R (page.284) 8988 0 R]
-/Limits [(page.28) (page.284)]
->> endobj
-20549 0 obj <<
-/Names [(page.284d) 18275 0 R (page.285) 8996 0 R (page.286) 9037 0 R (page.287) 9090 0 R (page.288) 9130 0 R (page.289) 9144 0 R]
-/Limits [(page.284d) (page.289)]
->> endobj
-20550 0 obj <<
-/Names [(page.29) 1187 0 R (page.290) 9173 0 R (page.291) 9225 0 R (page.292) 9267 0 R (page.293) 9289 0 R (page.294) 9357 0 R]
-/Limits [(page.29) (page.294)]
->> endobj
-20551 0 obj <<
-/Names [(page.295) 9433 0 R (page.296) 9511 0 R (page.297) 9611 0 R (page.298) 9685 0 R (page.299) 9739 0 R (page.3) 551 0 R]
-/Limits [(page.295) (page.3)]
->> endobj
-20552 0 obj <<
-/Names [(page.30) 1222 0 R (page.300) 9766 0 R (page.301) 9780 0 R (page.302) 9788 0 R (page.303) 9793 0 R (page.303d) 18199 0 R]
-/Limits [(page.30) (page.303d)]
->> endobj
-20553 0 obj <<
-/Names [(page.304) 9806 0 R (page.305) 9821 0 R (page.306) 9836 0 R (page.307) 9851 0 R (page.308) 9869 0 R (page.309) 9883 0 R]
-/Limits [(page.304) (page.309)]
->> endobj
-20554 0 obj <<
-/Names [(page.31) 1247 0 R (page.310) 9896 0 R (page.311) 9911 0 R (page.312) 9926 0 R (page.313) 9941 0 R (page.314) 9961 0 R]
-/Limits [(page.31) (page.314)]
->> endobj
-20555 0 obj <<
-/Names [(page.315) 9982 0 R (page.316) 9998 0 R (page.317) 10013 0 R (page.318) 10035 0 R (page.319) 10051 0 R (page.32) 1257 0 R]
-/Limits [(page.315) (page.32)]
->> endobj
-20556 0 obj <<
-/Names [(page.320) 10069 0 R (page.321) 10089 0 R (page.322) 10111 0 R (page.323) 10130 0 R (page.324) 10147 0 R (page.325) 10179 0 R]
-/Limits [(page.320) (page.325)]
->> endobj
-20557 0 obj <<
-/Names [(page.326) 10233 0 R (page.327) 10294 0 R (page.328) 10381 0 R (page.329) 10483 0 R (page.33) 1269 0 R (page.330) 10532 0 R]
-/Limits [(page.326) (page.330)]
->> endobj
-20558 0 obj <<
-/Names [(page.331) 10551 0 R (page.332) 10562 0 R (page.333) 10581 0 R (page.333d) 18200 0 R (page.334) 10600 0 R (page.335) 10616 0 R]
-/Limits [(page.331) (page.335)]
->> endobj
-20559 0 obj <<
-/Names [(page.336) 10681 0 R (page.337) 10745 0 R (page.338) 10775 0 R (page.339) 10787 0 R (page.34) 1285 0 R (page.340) 10807 0 R]
-/Limits [(page.336) (page.340)]
->> endobj
-20560 0 obj <<
-/Names [(page.341) 10831 0 R (page.342) 10848 0 R (page.343) 10869 0 R (page.344) 10892 0 R (page.345) 10919 0 R (page.346) 10947 0 R]
-/Limits [(page.341) (page.346)]
->> endobj
-20561 0 obj <<
-/Names [(page.347) 10965 0 R (page.348) 10977 0 R (page.349) 11018 0 R (page.35) 1311 0 R (page.350) 11042 0 R (page.351) 11058 0 R]
-/Limits [(page.347) (page.351)]
->> endobj
-20562 0 obj <<
-/Names [(page.352) 11075 0 R (page.353) 11111 0 R (page.354) 11194 0 R (page.355) 11264 0 R (page.356) 11378 0 R (page.357) 11523 0 R]
-/Limits [(page.352) (page.357)]
->> endobj
-20563 0 obj <<
-/Names [(page.358) 11559 0 R (page.358d) 18346 0 R (page.359) 11569 0 R (page.36) 1339 0 R (page.360) 11587 0 R (page.361) 11601 0 R]
-/Limits [(page.358) (page.361)]
->> endobj
-20564 0 obj <<
-/Names [(page.362) 11614 0 R (page.363) 11627 0 R (page.364) 11647 0 R (page.364d) 18515 0 R (page.365) 11665 0 R (page.366) 11685 0 R]
-/Limits [(page.362) (page.366)]
->> endobj
-20565 0 obj <<
-/Names [(page.367) 11725 0 R (page.368) 11789 0 R (page.369) 11866 0 R (page.37) 1358 0 R (page.370) 11952 0 R (page.371) 12023 0 R]
-/Limits [(page.367) (page.371)]
->> endobj
-20566 0 obj <<
-/Names [(page.372) 12039 0 R (page.373) 12052 0 R (page.374) 12061 0 R (page.375) 12077 0 R (page.375d) 18514 0 R (page.376) 12094 0 R]
-/Limits [(page.372) (page.376)]
->> endobj
-20567 0 obj <<
-/Names [(page.376d) 18516 0 R (page.377) 12112 0 R (page.378) 12145 0 R (page.379) 12220 0 R (page.38) 1376 0 R (page.380) 12283 0 R]
-/Limits [(page.376d) (page.380)]
->> endobj
-20568 0 obj <<
-/Names [(page.381) 12317 0 R (page.382) 12330 0 R (page.383) 12344 0 R (page.384) 12360 0 R (page.385) 12375 0 R (page.386) 12390 0 R]
-/Limits [(page.381) (page.386)]
->> endobj
-20569 0 obj <<
-/Names [(page.387) 12432 0 R (page.388) 12458 0 R (page.389) 12475 0 R (page.39) 1397 0 R (page.390) 12496 0 R (page.391) 12565 0 R]
-/Limits [(page.387) (page.391)]
->> endobj
-20570 0 obj <<
-/Names [(page.392) 12594 0 R (page.392d) 18431 0 R (page.393) 12608 0 R (page.394) 12623 0 R (page.395) 12637 0 R (page.396) 12658 0 R]
-/Limits [(page.392) (page.396)]
->> endobj
-20571 0 obj <<
-/Names [(page.397) 12724 0 R (page.398) 12808 0 R (page.399) 12887 0 R (page.4) 564 0 R (page.40) 1420 0 R (page.400) 12980 0 R]
-/Limits [(page.397) (page.400)]
->> endobj
-20572 0 obj <<
-/Names [(page.401) 13058 0 R (page.402) 13124 0 R (page.403) 13215 0 R (page.404) 13244 0 R (page.405) 13256 0 R (page.405d) 18432 0 R]
-/Limits [(page.401) (page.405d)]
->> endobj
-20573 0 obj <<
-/Names [(page.406) 13265 0 R (page.407) 13278 0 R (page.408) 13293 0 R (page.409) 13308 0 R (page.41) 1440 0 R (page.410) 13325 0 R]
-/Limits [(page.406) (page.410)]
->> endobj
-20574 0 obj <<
-/Names [(page.411) 13338 0 R (page.412) 13350 0 R (page.413) 13365 0 R (page.414) 13381 0 R (page.415) 13399 0 R (page.416) 13413 0 R]
-/Limits [(page.411) (page.416)]
->> endobj
-20575 0 obj <<
-/Names [(page.417) 13433 0 R (page.418) 13448 0 R (page.419) 13464 0 R (page.42) 1450 0 R (page.420) 13481 0 R (page.421) 13497 0 R]
-/Limits [(page.417) (page.421)]
->> endobj
-20576 0 obj <<
-/Names [(page.422) 13512 0 R (page.423) 13530 0 R (page.424) 13546 0 R (page.425) 13565 0 R (page.426) 13589 0 R (page.427) 13605 0 R]
-/Limits [(page.422) (page.427)]
->> endobj
-20577 0 obj <<
-/Names [(page.428) 13617 0 R (page.429) 13629 0 R (page.429d) 18125 0 R (page.43) 1458 0 R (page.430) 13638 0 R (page.431) 13658 0 R]
-/Limits [(page.428) (page.431)]
->> endobj
-20578 0 obj <<
-/Names [(page.432) 13689 0 R (page.433) 13706 0 R (page.434) 13765 0 R (page.435) 13844 0 R (page.436) 13916 0 R (page.437) 14011 0 R]
-/Limits [(page.432) (page.437)]
->> endobj
-20579 0 obj <<
-/Names [(page.438) 14065 0 R (page.439) 14117 0 R (page.44) 1466 0 R (page.440) 14146 0 R (page.441) 14153 0 R (page.441d) 19607 0 R]
-/Limits [(page.438) (page.441d)]
->> endobj
-20580 0 obj <<
-/Names [(page.442) 14163 0 R (page.443) 14178 0 R (page.444) 14192 0 R (page.445) 14206 0 R (page.446) 14220 0 R (page.447) 14232 0 R]
-/Limits [(page.442) (page.447)]
->> endobj
-20581 0 obj <<
-/Names [(page.448) 14244 0 R (page.449) 14260 0 R (page.45) 1473 0 R (page.450) 14277 0 R (page.451) 14294 0 R (page.452) 14309 0 R]
-/Limits [(page.448) (page.452)]
->> endobj
-20582 0 obj <<
-/Names [(page.453) 14330 0 R (page.454) 14352 0 R (page.455) 14369 0 R (page.456) 14384 0 R (page.457) 14399 0 R (page.458) 14420 0 R]
-/Limits [(page.453) (page.458)]
->> endobj
-20583 0 obj <<
-/Names [(page.459) 14437 0 R (page.46) 1479 0 R (page.460) 14454 0 R (page.461) 14481 0 R (page.462) 14528 0 R (page.463) 14570 0 R]
-/Limits [(page.459) (page.463)]
->> endobj
-20584 0 obj <<
-/Names [(page.464) 14627 0 R (page.465) 14700 0 R (page.466) 14749 0 R (page.467) 14768 0 R (page.468) 14779 0 R (page.469) 14791 0 R]
-/Limits [(page.464) (page.469)]
->> endobj
-20585 0 obj <<
-/Names [(page.47) 1485 0 R (page.470) 14805 0 R (page.471) 14814 0 R (page.472) 14820 0 R (page.473) 14827 0 R (page.474) 14842 0 R]
-/Limits [(page.47) (page.474)]
->> endobj
-20586 0 obj <<
-/Names [(page.475) 14857 0 R (page.476) 14874 0 R (page.477) 14908 0 R (page.478) 14964 0 R (page.479) 14990 0 R (page.48) 1494 0 R]
-/Limits [(page.475) (page.48)]
->> endobj
-20587 0 obj <<
-/Names [(page.480) 15022 0 R (page.481) 15086 0 R (page.482) 15124 0 R (page.483) 15149 0 R (page.484) 15167 0 R (page.485) 15241 0 R]
-/Limits [(page.480) (page.485)]
->> endobj
-20588 0 obj <<
-/Names [(page.486) 15323 0 R (page.487) 15396 0 R (page.488) 15484 0 R (page.489) 15537 0 R (page.49) 1502 0 R (page.490) 15593 0 R]
-/Limits [(page.486) (page.490)]
->> endobj
-20589 0 obj <<
-/Names [(page.490d) 19530 0 R (page.491) 15610 0 R (page.492) 15624 0 R (page.493) 15636 0 R (page.494) 15651 0 R (page.495) 15665 0 R]
-/Limits [(page.490d) (page.495)]
->> endobj
-20590 0 obj <<
-/Names [(page.496) 15678 0 R (page.497) 15689 0 R (page.498) 15706 0 R (page.499) 15722 0 R (page.5) 815 0 R (page.50) 1515 0 R]
-/Limits [(page.496) (page.50)]
->> endobj
-20591 0 obj <<
-/Names [(page.500) 15741 0 R (page.501) 15758 0 R (page.502) 15773 0 R (page.503) 15791 0 R (page.504) 15810 0 R (page.505) 15829 0 R]
-/Limits [(page.500) (page.505)]
->> endobj
-20592 0 obj <<
-/Names [(page.506) 15845 0 R (page.507) 15862 0 R (page.508) 15881 0 R (page.509) 15903 0 R (page.51) 1521 0 R (page.510) 15949 0 R]
-/Limits [(page.506) (page.510)]
->> endobj
-20593 0 obj <<
-/Names [(page.511) 15986 0 R (page.512) 16043 0 R (page.513) 16066 0 R (page.514) 16110 0 R (page.515) 16188 0 R (page.516) 16266 0 R]
-/Limits [(page.511) (page.516)]
->> endobj
-20594 0 obj <<
-/Names [(page.517) 16365 0 R (page.518) 16438 0 R (page.519) 16505 0 R (page.52) 1526 0 R (page.520) 16567 0 R (page.521) 16582 0 R]
-/Limits [(page.517) (page.521)]
->> endobj
-20595 0 obj <<
-/Names [(page.522) 16591 0 R (page.523) 16596 0 R (page.524) 16601 0 R (page.525) 16616 0 R (page.526) 16631 0 R (page.527) 16648 0 R]
-/Limits [(page.522) (page.527)]
->> endobj
-20596 0 obj <<
-/Names [(page.528) 16664 0 R (page.529) 16676 0 R (page.53) 1531 0 R (page.530) 16689 0 R (page.531) 16706 0 R (page.532) 16720 0 R]
-/Limits [(page.528) (page.532)]
->> endobj
-20597 0 obj <<
-/Names [(page.533) 16736 0 R (page.534) 16752 0 R (page.535) 16773 0 R (page.536) 16791 0 R (page.537) 16810 0 R (page.538) 16827 0 R]
-/Limits [(page.533) (page.538)]
->> endobj
-20598 0 obj <<
-/Names [(page.539) 16844 0 R (page.54) 1537 0 R (page.540) 16864 0 R (page.541) 16887 0 R (page.542) 16904 0 R (page.543) 16922 0 R]
-/Limits [(page.539) (page.543)]
->> endobj
-20599 0 obj <<
-/Names [(page.544) 16944 0 R (page.545) 16958 0 R (page.546) 16971 0 R (page.547) 17000 0 R (page.548) 17054 0 R (page.549) 17106 0 R]
-/Limits [(page.544) (page.549)]
->> endobj
-20600 0 obj <<
-/Names [(page.55) 1544 0 R (page.550) 17155 0 R (page.551) 17183 0 R (page.552) 17191 0 R (page.553) 17207 0 R (page.554) 17226 0 R]
-/Limits [(page.55) (page.554)]
->> endobj
-20601 0 obj <<
-/Names [(page.555) 17242 0 R (page.556) 17275 0 R (page.557) 17312 0 R (page.558) 17333 0 R (page.559) 17346 0 R (page.56) 1574 0 R]
-/Limits [(page.555) (page.56)]
->> endobj
-20602 0 obj <<
-/Names [(page.560) 17372 0 R (page.561) 17396 0 R (page.562) 17441 0 R (page.563) 17470 0 R (page.564) 17514 0 R (page.565) 17546 0 R]
-/Limits [(page.560) (page.565)]
->> endobj
-20603 0 obj <<
-/Names [(page.566) 17564 0 R (page.567) 17601 0 R (page.568) 17626 0 R (page.569) 17644 0 R (page.57) 1609 0 R (page.570) 17718 0 R]
-/Limits [(page.566) (page.570)]
->> endobj
-20604 0 obj <<
-/Names [(page.571) 17784 0 R (page.572) 17879 0 R (page.573) 17972 0 R (page.574) 18045 0 R (page.575) 18123 0 R (page.576) 18198 0 R]
-/Limits [(page.571) (page.576)]
->> endobj
-20605 0 obj <<
-/Names [(page.577) 18273 0 R (page.578) 18345 0 R (page.579) 18430 0 R (page.58) 1641 0 R (page.580) 18513 0 R (page.581) 18589 0 R]
-/Limits [(page.577) (page.581)]
->> endobj
-20606 0 obj <<
-/Names [(page.582) 18707 0 R (page.583) 18829 0 R (page.584) 18930 0 R (page.585) 19056 0 R (page.586) 19173 0 R (page.587) 19293 0 R]
-/Limits [(page.582) (page.587)]
->> endobj
-20607 0 obj <<
-/Names [(page.588) 19408 0 R (page.589) 19529 0 R (page.59) 1671 0 R (page.590) 19606 0 R (page.591) 19691 0 R (page.592) 19759 0 R]
-/Limits [(page.588) (page.592)]
->> endobj
-20608 0 obj <<
-/Names [(page.593) 19841 0 R (page.594) 19906 0 R (page.595) 19927 0 R (page.6) 827 0 R (page.60) 1714 0 R (page.61) 1771 0 R]
-/Limits [(page.593) (page.61)]
->> endobj
-20609 0 obj <<
-/Names [(page.62) 1831 0 R (page.63) 1889 0 R (page.64) 1944 0 R (page.65) 1986 0 R (page.66) 2026 0 R (page.67) 2053 0 R]
-/Limits [(page.62) (page.67)]
->> endobj
-20610 0 obj <<
-/Names [(page.68) 2109 0 R (page.69) 2213 0 R (page.7) 845 0 R (page.70) 2315 0 R (page.71) 2374 0 R (page.72) 2393 0 R]
-/Limits [(page.68) (page.72)]
->> endobj
-20611 0 obj <<
-/Names [(page.73) 2408 0 R (page.74) 2417 0 R (page.75) 2428 0 R (page.76) 2440 0 R (page.77) 2453 0 R (page.78) 2480 0 R]
-/Limits [(page.73) (page.78)]
->> endobj
-20612 0 obj <<
-/Names [(page.79) 2490 0 R (page.8) 860 0 R (page.80) 2501 0 R (page.81) 2513 0 R (page.82) 2524 0 R (page.83) 2533 0 R]
-/Limits [(page.79) (page.83)]
->> endobj
-20613 0 obj <<
-/Names [(page.84) 2559 0 R (page.85) 2589 0 R (page.86) 2620 0 R (page.87) 2657 0 R (page.88) 2749 0 R (page.89) 2812 0 R]
-/Limits [(page.84) (page.89)]
->> endobj
-20614 0 obj <<
-/Names [(page.9) 873 0 R (page.90) 2887 0 R (page.91) 2936 0 R (page.92) 2950 0 R (page.93) 2966 0 R (page.94) 2982 0 R]
-/Limits [(page.9) (page.94)]
->> endobj
-20615 0 obj <<
-/Names [(page.95) 2994 0 R (page.96) 3026 0 R (page.97) 3063 0 R (page.98) 3093 0 R (page.99) 3170 0 R (page.i) 612 0 R]
-/Limits [(page.95) (page.i)]
->> endobj
-20616 0 obj <<
-/Names [(page.ii) 659 0 R (page.iii) 723 0 R (page.iv) 743 0 R (paragraph.1.1.2.1) 783 0 R (paragraph.1.1.2.2) 785 0 R (paragraph.1.1.2.3) 804 0 R]
-/Limits [(page.ii) (paragraph.1.1.2.3)]
->> endobj
-20617 0 obj <<
-/Names [(paragraph.1.3.2.1) 847 0 R (paragraph.10.10.2.1) 5350 0 R (paragraph.10.10.3.1) 5353 0 R (paragraph.10.10.3.2) 5354 0 R (paragraph.10.13.2.1) 5808 0 R (paragraph.10.13.3.1) 5815 0 R]
-/Limits [(paragraph.1.3.2.1) (paragraph.10.13.3.1)]
->> endobj
-20618 0 obj <<
-/Names [(paragraph.10.13.3.10) 5824 0 R (paragraph.10.13.3.11) 5825 0 R (paragraph.10.13.3.12) 5826 0 R (paragraph.10.13.3.13) 5832 0 R (paragraph.10.13.3.14) 5833 0 R (paragraph.10.13.3.15) 5834 0 R]
-/Limits [(paragraph.10.13.3.10) (paragraph.10.13.3.15)]
->> endobj
-20619 0 obj <<
-/Names [(paragraph.10.13.3.16) 5835 0 R (paragraph.10.13.3.17) 5836 0 R (paragraph.10.13.3.18) 5837 0 R (paragraph.10.13.3.19) 5838 0 R (paragraph.10.13.3.2) 5816 0 R (paragraph.10.13.3.20) 5839 0 R]
-/Limits [(paragraph.10.13.3.16) (paragraph.10.13.3.20)]
->> endobj
-20620 0 obj <<
-/Names [(paragraph.10.13.3.21) 5840 0 R (paragraph.10.13.3.22) 5841 0 R (paragraph.10.13.3.23) 5842 0 R (paragraph.10.13.3.24) 5848 0 R (paragraph.10.13.3.25) 5849 0 R (paragraph.10.13.3.26) 5850 0 R]
-/Limits [(paragraph.10.13.3.21) (paragraph.10.13.3.26)]
->> endobj
-20621 0 obj <<
-/Names [(paragraph.10.13.3.27) 5851 0 R (paragraph.10.13.3.28) 5852 0 R (paragraph.10.13.3.29) 5853 0 R (paragraph.10.13.3.3) 5817 0 R (paragraph.10.13.3.30) 5854 0 R (paragraph.10.13.3.31) 5855 0 R]
-/Limits [(paragraph.10.13.3.27) (paragraph.10.13.3.31)]
->> endobj
-20622 0 obj <<
-/Names [(paragraph.10.13.3.32) 5856 0 R (paragraph.10.13.3.33) 5862 0 R (paragraph.10.13.3.34) 5863 0 R (paragraph.10.13.3.35) 5864 0 R (paragraph.10.13.3.36) 5865 0 R (paragraph.10.13.3.37) 5866 0 R]
-/Limits [(paragraph.10.13.3.32) (paragraph.10.13.3.37)]
->> endobj
-20623 0 obj <<
-/Names [(paragraph.10.13.3.38) 5867 0 R (paragraph.10.13.3.39) 5868 0 R (paragraph.10.13.3.4) 5818 0 R (paragraph.10.13.3.40) 5869 0 R (paragraph.10.13.3.41) 5870 0 R (paragraph.10.13.3.42) 5871 0 R]
-/Limits [(paragraph.10.13.3.38) (paragraph.10.13.3.42)]
->> endobj
-20624 0 obj <<
-/Names [(paragraph.10.13.3.43) 5872 0 R (paragraph.10.13.3.44) 5878 0 R (paragraph.10.13.3.45) 5879 0 R (paragraph.10.13.3.46) 5880 0 R (paragraph.10.13.3.47) 5881 0 R (paragraph.10.13.3.48) 5882 0 R]
-/Limits [(paragraph.10.13.3.43) (paragraph.10.13.3.48)]
->> endobj
-20625 0 obj <<
-/Names [(paragraph.10.13.3.49) 5895 0 R (paragraph.10.13.3.5) 5819 0 R (paragraph.10.13.3.50) 5896 0 R (paragraph.10.13.3.51) 5897 0 R (paragraph.10.13.3.52) 5898 0 R (paragraph.10.13.3.53) 5899 0 R]
-/Limits [(paragraph.10.13.3.49) (paragraph.10.13.3.53)]
->> endobj
-20626 0 obj <<
-/Names [(paragraph.10.13.3.54) 5900 0 R (paragraph.10.13.3.55) 5901 0 R (paragraph.10.13.3.56) 5902 0 R (paragraph.10.13.3.57) 5903 0 R (paragraph.10.13.3.58) 5904 0 R (paragraph.10.13.3.59) 5905 0 R]
-/Limits [(paragraph.10.13.3.54) (paragraph.10.13.3.59)]
->> endobj
-20627 0 obj <<
-/Names [(paragraph.10.13.3.6) 5820 0 R (paragraph.10.13.3.60) 5906 0 R (paragraph.10.13.3.61) 5907 0 R (paragraph.10.13.3.62) 5908 0 R (paragraph.10.13.3.63) 5909 0 R (paragraph.10.13.3.64) 5921 0 R]
-/Limits [(paragraph.10.13.3.6) (paragraph.10.13.3.64)]
->> endobj
-20628 0 obj <<
-/Names [(paragraph.10.13.3.65) 5922 0 R (paragraph.10.13.3.7) 5821 0 R (paragraph.10.13.3.8) 5822 0 R (paragraph.10.13.3.9) 5823 0 R (paragraph.10.18.2.1) 5995 0 R (paragraph.10.18.2.2) 6011 0 R]
-/Limits [(paragraph.10.13.3.65) (paragraph.10.18.2.2)]
->> endobj
-20629 0 obj <<
-/Names [(paragraph.10.18.2.3) 6024 0 R (paragraph.10.18.2.4) 6035 0 R (paragraph.10.18.2.5) 6046 0 R (paragraph.10.18.2.6) 6058 0 R (paragraph.10.20.2.1) 6117 0 R (paragraph.10.20.2.2) 6118 0 R]
-/Limits [(paragraph.10.18.2.3) (paragraph.10.20.2.2)]
->> endobj
-20630 0 obj <<
-/Names [(paragraph.10.20.2.3) 6120 0 R (paragraph.10.20.2.4) 6122 0 R (paragraph.10.21.2.1) 6383 0 R (paragraph.10.21.3.1) 6385 0 R (paragraph.10.21.3.2) 6386 0 R (paragraph.10.21.3.3) 6388 0 R]
-/Limits [(paragraph.10.20.2.3) (paragraph.10.21.3.3)]
->> endobj
-20631 0 obj <<
-/Names [(paragraph.10.21.3.4) 6398 0 R (paragraph.10.21.3.5) 6399 0 R (paragraph.10.21.4.1) 6402 0 R (paragraph.10.21.4.10) 6418 0 R (paragraph.10.21.4.11) 6419 0 R (paragraph.10.21.4.12) 6420 0 R]
-/Limits [(paragraph.10.21.3.4) (paragraph.10.21.4.12)]
->> endobj
-20632 0 obj <<
-/Names [(paragraph.10.21.4.2) 6404 0 R (paragraph.10.21.4.3) 6405 0 R (paragraph.10.21.4.4) 6406 0 R (paragraph.10.21.4.5) 6413 0 R (paragraph.10.21.4.6) 6414 0 R (paragraph.10.21.4.7) 6415 0 R]
-/Limits [(paragraph.10.21.4.2) (paragraph.10.21.4.7)]
->> endobj
-20633 0 obj <<
-/Names [(paragraph.10.21.4.8) 6416 0 R (paragraph.10.21.4.9) 6417 0 R (paragraph.10.21.5.1) 6427 0 R (paragraph.10.21.5.10) 6436 0 R (paragraph.10.21.5.11) 6437 0 R (paragraph.10.21.5.12) 6438 0 R]
-/Limits [(paragraph.10.21.4.8) (paragraph.10.21.5.12)]
->> endobj
-20634 0 obj <<
-/Names [(paragraph.10.21.5.13) 6439 0 R (paragraph.10.21.5.14) 6440 0 R (paragraph.10.21.5.15) 6472 0 R (paragraph.10.21.5.2) 6428 0 R (paragraph.10.21.5.3) 6429 0 R (paragraph.10.21.5.4) 6430 0 R]
-/Limits [(paragraph.10.21.5.13) (paragraph.10.21.5.4)]
->> endobj
-20635 0 obj <<
-/Names [(paragraph.10.21.5.5) 6431 0 R (paragraph.10.21.5.6) 6432 0 R (paragraph.10.21.5.7) 6433 0 R (paragraph.10.21.5.8) 6434 0 R (paragraph.10.21.5.9) 6435 0 R (paragraph.10.21.6.1) 6474 0 R]
-/Limits [(paragraph.10.21.5.5) (paragraph.10.21.6.1)]
->> endobj
-20636 0 obj <<
-/Names [(paragraph.10.22.2.1) 6620 0 R (paragraph.10.22.2.2) 6629 0 R (paragraph.10.22.3.1) 6631 0 R (paragraph.10.22.3.2) 6632 0 R (paragraph.10.22.3.3) 6633 0 R (paragraph.10.22.3.4) 6635 0 R]
-/Limits [(paragraph.10.22.2.1) (paragraph.10.22.3.4)]
->> endobj
-20637 0 obj <<
-/Names [(paragraph.10.22.3.5) 6636 0 R (paragraph.10.22.3.6) 6644 0 R (paragraph.10.22.3.7) 6646 0 R (paragraph.10.22.4.1) 6648 0 R (paragraph.10.22.4.2) 6649 0 R (paragraph.10.22.4.3) 6650 0 R]
-/Limits [(paragraph.10.22.3.5) (paragraph.10.22.4.3)]
->> endobj
-20638 0 obj <<
-/Names [(paragraph.10.22.4.4) 6651 0 R (paragraph.10.23.2.1) 6667 0 R (paragraph.10.24.2.1) 6736 0 R (paragraph.10.24.2.2) 6737 0 R (paragraph.10.24.2.3) 6739 0 R (paragraph.10.24.2.4) 6741 0 R]
-/Limits [(paragraph.10.22.4.4) (paragraph.10.24.2.4)]
->> endobj
-20639 0 obj <<
-/Names [(paragraph.10.24.2.5) 6743 0 R (paragraph.10.24.3.1) 6751 0 R (paragraph.10.24.3.10) 6777 0 R (paragraph.10.24.3.2) 6753 0 R (paragraph.10.24.3.3) 6755 0 R (paragraph.10.24.3.4) 6757 0 R]
-/Limits [(paragraph.10.24.2.5) (paragraph.10.24.3.4)]
->> endobj
-20640 0 obj <<
-/Names [(paragraph.10.24.3.5) 6758 0 R (paragraph.10.24.3.6) 6759 0 R (paragraph.10.24.3.7) 6760 0 R (paragraph.10.24.3.8) 6774 0 R (paragraph.10.24.3.9) 6775 0 R (paragraph.10.25.2.1) 6793 0 R]
-/Limits [(paragraph.10.24.3.5) (paragraph.10.25.2.1)]
->> endobj
-20641 0 obj <<
-/Names [(paragraph.10.25.2.2) 6794 0 R (paragraph.10.25.2.3) 6795 0 R (paragraph.10.25.2.4) 6796 0 R (paragraph.10.25.2.5) 6798 0 R (paragraph.10.26.2.1) 6838 0 R (paragraph.10.26.2.2) 6853 0 R]
-/Limits [(paragraph.10.25.2.2) (paragraph.10.26.2.2)]
->> endobj
-20642 0 obj <<
-/Names [(paragraph.10.26.3.1) 6856 0 R (paragraph.10.26.3.2) 6858 0 R (paragraph.10.26.3.3) 6860 0 R (paragraph.10.26.3.4) 6861 0 R (paragraph.10.26.3.5) 6862 0 R (paragraph.10.26.3.6) 6877 0 R]
-/Limits [(paragraph.10.26.3.1) (paragraph.10.26.3.6)]
->> endobj
-20643 0 obj <<
-/Names [(paragraph.10.26.3.7) 6879 0 R (paragraph.10.26.4.1) 6882 0 R (paragraph.10.26.4.2) 6883 0 R (paragraph.10.28.2.1) 6961 0 R (paragraph.10.28.2.2) 6964 0 R (paragraph.10.3.2.1) 3069 0 R]
-/Limits [(paragraph.10.26.3.7) (paragraph.10.3.2.1)]
->> endobj
-20644 0 obj <<
-/Names [(paragraph.10.3.3.1) 3074 0 R (paragraph.10.3.4.1) 3095 0 R (paragraph.10.3.4.2) 3096 0 R (paragraph.10.3.4.3) 3097 0 R (paragraph.10.30.2.1) 7024 0 R (paragraph.10.30.2.2) 7026 0 R]
-/Limits [(paragraph.10.3.3.1) (paragraph.10.30.2.2)]
->> endobj
-20645 0 obj <<
-/Names [(paragraph.10.30.2.3) 7028 0 R (paragraph.10.30.2.4) 7030 0 R (paragraph.10.30.2.5) 7032 0 R (paragraph.10.31.2.1) 7119 0 R (paragraph.10.31.3.1) 7122 0 R (paragraph.10.31.3.2) 7123 0 R]
-/Limits [(paragraph.10.30.2.3) (paragraph.10.31.3.2)]
->> endobj
-20646 0 obj <<
-/Names [(paragraph.10.32.2.1) 7514 0 R (paragraph.10.32.3.1) 7516 0 R (paragraph.10.32.4.1) 7518 0 R (paragraph.10.32.4.2) 7527 0 R (paragraph.10.32.4.3) 7528 0 R (paragraph.10.32.5.1) 7531 0 R]
-/Limits [(paragraph.10.32.2.1) (paragraph.10.32.5.1)]
->> endobj
-20647 0 obj <<
-/Names [(paragraph.10.32.5.2) 7532 0 R (paragraph.10.32.5.3) 7533 0 R (paragraph.10.32.5.4) 7534 0 R (paragraph.10.32.5.5) 7543 0 R (paragraph.10.32.5.6) 7544 0 R (paragraph.10.32.5.7) 7545 0 R]
-/Limits [(paragraph.10.32.5.2) (paragraph.10.32.5.7)]
->> endobj
-20648 0 obj <<
-/Names [(paragraph.10.32.5.8) 7546 0 R (paragraph.10.32.5.9) 7547 0 R (paragraph.10.32.6.1) 7549 0 R (paragraph.10.32.6.10) 7563 0 R (paragraph.10.32.6.11) 7564 0 R (paragraph.10.32.6.12) 7565 0 R]
-/Limits [(paragraph.10.32.5.8) (paragraph.10.32.6.12)]
->> endobj
-20649 0 obj <<
-/Names [(paragraph.10.32.6.13) 7566 0 R (paragraph.10.32.6.14) 7567 0 R (paragraph.10.32.6.15) 7568 0 R (paragraph.10.32.6.16) 7569 0 R (paragraph.10.32.6.17) 7575 0 R (paragraph.10.32.6.18) 7576 0 R]
-/Limits [(paragraph.10.32.6.13) (paragraph.10.32.6.18)]
->> endobj
-20650 0 obj <<
-/Names [(paragraph.10.32.6.19) 7577 0 R (paragraph.10.32.6.2) 7550 0 R (paragraph.10.32.6.20) 7578 0 R (paragraph.10.32.6.21) 7579 0 R (paragraph.10.32.6.22) 7580 0 R (paragraph.10.32.6.23) 7581 0 R]
-/Limits [(paragraph.10.32.6.19) (paragraph.10.32.6.23)]
->> endobj
-20651 0 obj <<
-/Names [(paragraph.10.32.6.24) 7582 0 R (paragraph.10.32.6.25) 7583 0 R (paragraph.10.32.6.26) 7584 0 R (paragraph.10.32.6.27) 7585 0 R (paragraph.10.32.6.28) 7586 0 R (paragraph.10.32.6.29) 7587 0 R]
-/Limits [(paragraph.10.32.6.24) (paragraph.10.32.6.29)]
->> endobj
-20652 0 obj <<
-/Names [(paragraph.10.32.6.3) 7551 0 R (paragraph.10.32.6.30) 7588 0 R (paragraph.10.32.6.31) 7589 0 R (paragraph.10.32.6.32) 7590 0 R (paragraph.10.32.6.33) 7596 0 R (paragraph.10.32.6.34) 7597 0 R]
-/Limits [(paragraph.10.32.6.3) (paragraph.10.32.6.34)]
->> endobj
-20653 0 obj <<
-/Names [(paragraph.10.32.6.35) 7598 0 R (paragraph.10.32.6.36) 7599 0 R (paragraph.10.32.6.37) 7600 0 R (paragraph.10.32.6.38) 7601 0 R (paragraph.10.32.6.39) 7602 0 R (paragraph.10.32.6.4) 7557 0 R]
-/Limits [(paragraph.10.32.6.35) (paragraph.10.32.6.4)]
->> endobj
-20654 0 obj <<
-/Names [(paragraph.10.32.6.40) 7603 0 R (paragraph.10.32.6.41) 7604 0 R (paragraph.10.32.6.42) 7605 0 R (paragraph.10.32.6.43) 7606 0 R (paragraph.10.32.6.44) 7607 0 R (paragraph.10.32.6.45) 7608 0 R]
-/Limits [(paragraph.10.32.6.40) (paragraph.10.32.6.45)]
->> endobj
-20655 0 obj <<
-/Names [(paragraph.10.32.6.46) 7609 0 R (paragraph.10.32.6.47) 7610 0 R (paragraph.10.32.6.48) 7611 0 R (paragraph.10.32.6.5) 7558 0 R (paragraph.10.32.6.6) 7559 0 R (paragraph.10.32.6.7) 7560 0 R]
-/Limits [(paragraph.10.32.6.46) (paragraph.10.32.6.7)]
->> endobj
-20656 0 obj <<
-/Names [(paragraph.10.32.6.8) 7561 0 R (paragraph.10.32.6.9) 7562 0 R (paragraph.10.32.7.1) 7613 0 R (paragraph.10.33.2.1) 7734 0 R (paragraph.10.33.3.1) 7761 0 R (paragraph.10.33.3.2) 7762 0 R]
-/Limits [(paragraph.10.32.6.8) (paragraph.10.33.3.2)]
->> endobj
-20657 0 obj <<
-/Names [(paragraph.10.33.3.3) 7763 0 R (paragraph.10.35.2.1) 7794 0 R (paragraph.10.36.2.1) 7908 0 R (paragraph.10.36.3.1) 7910 0 R (paragraph.10.36.3.2) 7911 0 R (paragraph.10.36.3.3) 7912 0 R]
-/Limits [(paragraph.10.33.3.3) (paragraph.10.36.3.3)]
->> endobj
-20658 0 obj <<
-/Names [(paragraph.10.36.3.4) 7913 0 R (paragraph.10.36.3.5) 7914 0 R (paragraph.10.36.3.6) 7915 0 R (paragraph.10.37.2.1) 7999 0 R (paragraph.10.37.3.1) 8002 0 R (paragraph.10.37.3.2) 8003 0 R]
-/Limits [(paragraph.10.36.3.4) (paragraph.10.37.3.2)]
->> endobj
-20659 0 obj <<
-/Names [(paragraph.10.38.2.1) 8092 0 R (paragraph.10.38.3.1) 8103 0 R (paragraph.10.38.3.2) 8104 0 R (paragraph.10.4.2.1) 3702 0 R (paragraph.10.4.2.10) 3732 0 R (paragraph.10.4.2.2) 3704 0 R]
-/Limits [(paragraph.10.38.2.1) (paragraph.10.4.2.2)]
->> endobj
-20660 0 obj <<
-/Names [(paragraph.10.4.2.3) 3705 0 R (paragraph.10.4.2.4) 3706 0 R (paragraph.10.4.2.5) 3715 0 R (paragraph.10.4.2.6) 3718 0 R (paragraph.10.4.2.7) 3720 0 R (paragraph.10.4.2.8) 3721 0 R]
-/Limits [(paragraph.10.4.2.3) (paragraph.10.4.2.8)]
->> endobj
-20661 0 obj <<
-/Names [(paragraph.10.4.2.9) 3729 0 R (paragraph.10.4.3.1) 3741 0 R (paragraph.10.4.3.10) 3776 0 R (paragraph.10.4.3.11) 3783 0 R (paragraph.10.4.3.12) 3785 0 R (paragraph.10.4.3.13) 3787 0 R]
-/Limits [(paragraph.10.4.2.9) (paragraph.10.4.3.13)]
->> endobj
-20662 0 obj <<
-/Names [(paragraph.10.4.3.14) 3789 0 R (paragraph.10.4.3.15) 3791 0 R (paragraph.10.4.3.16) 3800 0 R (paragraph.10.4.3.17) 3803 0 R (paragraph.10.4.3.18) 3806 0 R (paragraph.10.4.3.19) 3809 0 R]
-/Limits [(paragraph.10.4.3.14) (paragraph.10.4.3.19)]
->> endobj
-20663 0 obj <<
-/Names [(paragraph.10.4.3.2) 3743 0 R (paragraph.10.4.3.20) 3817 0 R (paragraph.10.4.3.21) 3820 0 R (paragraph.10.4.3.22) 3823 0 R (paragraph.10.4.3.23) 3833 0 R (paragraph.10.4.3.24) 3836 0 R]
-/Limits [(paragraph.10.4.3.2) (paragraph.10.4.3.24)]
->> endobj
-20664 0 obj <<
-/Names [(paragraph.10.4.3.25) 3839 0 R (paragraph.10.4.3.26) 3851 0 R (paragraph.10.4.3.27) 3854 0 R (paragraph.10.4.3.28) 3865 0 R (paragraph.10.4.3.29) 3868 0 R (paragraph.10.4.3.3) 3745 0 R]
-/Limits [(paragraph.10.4.3.25) (paragraph.10.4.3.3)]
->> endobj
-20665 0 obj <<
-/Names [(paragraph.10.4.3.30) 3871 0 R (paragraph.10.4.3.31) 3873 0 R (paragraph.10.4.3.32) 3875 0 R (paragraph.10.4.3.33) 3884 0 R (paragraph.10.4.3.34) 3886 0 R (paragraph.10.4.3.35) 3888 0 R]
-/Limits [(paragraph.10.4.3.30) (paragraph.10.4.3.35)]
->> endobj
-20666 0 obj <<
-/Names [(paragraph.10.4.3.36) 3890 0 R (paragraph.10.4.3.37) 3902 0 R (paragraph.10.4.3.38) 3905 0 R (paragraph.10.4.3.39) 3908 0 R (paragraph.10.4.3.4) 3748 0 R (paragraph.10.4.3.40) 3918 0 R]
-/Limits [(paragraph.10.4.3.36) (paragraph.10.4.3.40)]
->> endobj
-20667 0 obj <<
-/Names [(paragraph.10.4.3.41) 3921 0 R (paragraph.10.4.3.42) 3932 0 R (paragraph.10.4.3.43) 3935 0 R (paragraph.10.4.3.44) 3938 0 R (paragraph.10.4.3.45) 3950 0 R (paragraph.10.4.3.46) 3952 0 R]
-/Limits [(paragraph.10.4.3.41) (paragraph.10.4.3.46)]
->> endobj
-20668 0 obj <<
-/Names [(paragraph.10.4.3.47) 3963 0 R (paragraph.10.4.3.48) 3965 0 R (paragraph.10.4.3.49) 3967 0 R (paragraph.10.4.3.5) 3756 0 R (paragraph.10.4.3.50) 3970 0 R (paragraph.10.4.3.51) 3984 0 R]
-/Limits [(paragraph.10.4.3.47) (paragraph.10.4.3.51)]
->> endobj
-20669 0 obj <<
-/Names [(paragraph.10.4.3.52) 3987 0 R (paragraph.10.4.3.53) 3990 0 R (paragraph.10.4.3.54) 4004 0 R (paragraph.10.4.3.55) 4007 0 R (paragraph.10.4.3.56) 4017 0 R (paragraph.10.4.3.57) 4020 0 R]
-/Limits [(paragraph.10.4.3.52) (paragraph.10.4.3.57)]
->> endobj
-20670 0 obj <<
-/Names [(paragraph.10.4.3.58) 4022 0 R (paragraph.10.4.3.59) 4037 0 R (paragraph.10.4.3.6) 3759 0 R (paragraph.10.4.3.60) 4039 0 R (paragraph.10.4.3.61) 4042 0 R (paragraph.10.4.3.62) 4044 0 R]
-/Limits [(paragraph.10.4.3.58) (paragraph.10.4.3.62)]
->> endobj
-20671 0 obj <<
-/Names [(paragraph.10.4.3.63) 4057 0 R (paragraph.10.4.3.64) 4060 0 R (paragraph.10.4.3.65) 4064 0 R (paragraph.10.4.3.66) 4071 0 R (paragraph.10.4.3.7) 3769 0 R (paragraph.10.4.3.8) 3772 0 R]
-/Limits [(paragraph.10.4.3.63) (paragraph.10.4.3.8)]
->> endobj
-20672 0 obj <<
-/Names [(paragraph.10.4.3.9) 3774 0 R (paragraph.10.4.4.1) 4073 0 R (paragraph.10.4.4.10) 4087 0 R (paragraph.10.4.4.11) 4094 0 R (paragraph.10.4.4.12) 4095 0 R (paragraph.10.4.4.13) 4096 0 R]
-/Limits [(paragraph.10.4.3.9) (paragraph.10.4.4.13)]
->> endobj
-20673 0 obj <<
-/Names [(paragraph.10.4.4.14) 4097 0 R (paragraph.10.4.4.15) 4098 0 R (paragraph.10.4.4.16) 4099 0 R (paragraph.10.4.4.17) 4106 0 R (paragraph.10.4.4.18) 4107 0 R (paragraph.10.4.4.19) 4108 0 R]
-/Limits [(paragraph.10.4.4.14) (paragraph.10.4.4.19)]
->> endobj
-20674 0 obj <<
-/Names [(paragraph.10.4.4.2) 4074 0 R (paragraph.10.4.4.20) 4109 0 R (paragraph.10.4.4.21) 4110 0 R (paragraph.10.4.4.22) 4111 0 R (paragraph.10.4.4.23) 4112 0 R (paragraph.10.4.4.24) 4113 0 R]
-/Limits [(paragraph.10.4.4.2) (paragraph.10.4.4.24)]
->> endobj
-20675 0 obj <<
-/Names [(paragraph.10.4.4.25) 4114 0 R (paragraph.10.4.4.26) 4115 0 R (paragraph.10.4.4.3) 4075 0 R (paragraph.10.4.4.4) 4076 0 R (paragraph.10.4.4.5) 4077 0 R (paragraph.10.4.4.6) 4083 0 R]
-/Limits [(paragraph.10.4.4.25) (paragraph.10.4.4.6)]
->> endobj
-20676 0 obj <<
-/Names [(paragraph.10.4.4.7) 4084 0 R (paragraph.10.4.4.8) 4085 0 R (paragraph.10.4.4.9) 4086 0 R (paragraph.10.45.2.1) 8327 0 R (paragraph.10.45.2.2) 8332 0 R (paragraph.10.45.3.1) 8338 0 R]
-/Limits [(paragraph.10.4.4.7) (paragraph.10.45.3.1)]
->> endobj
-20677 0 obj <<
-/Names [(paragraph.10.45.3.2) 8364 0 R (paragraph.10.45.3.3) 8366 0 R (paragraph.10.45.3.4) 8379 0 R (paragraph.10.45.4.1) 8382 0 R (paragraph.10.46.2.1) 8402 0 R (paragraph.10.46.2.2) 8404 0 R]
-/Limits [(paragraph.10.45.3.2) (paragraph.10.46.2.2)]
->> endobj
-20678 0 obj <<
-/Names [(paragraph.10.46.2.3) 8431 0 R (paragraph.10.46.2.4) 8432 0 R (paragraph.10.47.2.1) 8905 0 R (paragraph.10.47.3.1) 8916 0 R (paragraph.10.47.4.1) 8918 0 R (paragraph.10.47.4.2) 8919 0 R]
-/Limits [(paragraph.10.46.2.3) (paragraph.10.47.4.2)]
->> endobj
-20679 0 obj <<
-/Names [(paragraph.10.47.5.1) 8921 0 R (paragraph.10.47.5.10) 8952 0 R (paragraph.10.47.5.11) 8954 0 R (paragraph.10.47.5.12) 8955 0 R (paragraph.10.47.5.13) 8956 0 R (paragraph.10.47.5.2) 8923 0 R]
-/Limits [(paragraph.10.47.5.1) (paragraph.10.47.5.2)]
->> endobj
-20680 0 obj <<
-/Names [(paragraph.10.47.5.3) 8925 0 R (paragraph.10.47.5.4) 8934 0 R (paragraph.10.47.5.5) 8936 0 R (paragraph.10.47.5.6) 8937 0 R (paragraph.10.47.5.7) 8938 0 R (paragraph.10.47.5.8) 8940 0 R]
-/Limits [(paragraph.10.47.5.3) (paragraph.10.47.5.8)]
->> endobj
-20681 0 obj <<
-/Names [(paragraph.10.47.5.9) 8941 0 R (paragraph.10.47.6.1) 8958 0 R (paragraph.10.47.6.10) 8974 0 R (paragraph.10.47.6.11) 8975 0 R (paragraph.10.47.6.12) 8981 0 R (paragraph.10.47.6.13) 8982 0 R]
-/Limits [(paragraph.10.47.5.9) (paragraph.10.47.6.13)]
->> endobj
-20682 0 obj <<
-/Names [(paragraph.10.47.6.14) 8983 0 R (paragraph.10.47.6.15) 8989 0 R (paragraph.10.47.6.16) 8990 0 R (paragraph.10.47.6.17) 8991 0 R (paragraph.10.47.6.18) 8997 0 R (paragraph.10.47.6.19) 8998 0 R]
-/Limits [(paragraph.10.47.6.14) (paragraph.10.47.6.19)]
->> endobj
-20683 0 obj <<
-/Names [(paragraph.10.47.6.2) 8959 0 R (paragraph.10.47.6.20) 8999 0 R (paragraph.10.47.6.21) 9000 0 R (paragraph.10.47.6.22) 9001 0 R (paragraph.10.47.6.23) 9002 0 R (paragraph.10.47.6.24) 9003 0 R]
-/Limits [(paragraph.10.47.6.2) (paragraph.10.47.6.24)]
->> endobj
-20684 0 obj <<
-/Names [(paragraph.10.47.6.25) 9004 0 R (paragraph.10.47.6.26) 9005 0 R (paragraph.10.47.6.27) 9006 0 R (paragraph.10.47.6.28) 9007 0 R (paragraph.10.47.6.29) 9008 0 R (paragraph.10.47.6.3) 8960 0 R]
-/Limits [(paragraph.10.47.6.25) (paragraph.10.47.6.3)]
->> endobj
-20685 0 obj <<
-/Names [(paragraph.10.47.6.30) 9009 0 R (paragraph.10.47.6.31) 9010 0 R (paragraph.10.47.6.32) 9011 0 R (paragraph.10.47.6.33) 9012 0 R (paragraph.10.47.6.34) 9013 0 R (paragraph.10.47.6.35) 9014 0 R]
-/Limits [(paragraph.10.47.6.30) (paragraph.10.47.6.35)]
->> endobj
-20686 0 obj <<
-/Names [(paragraph.10.47.6.36) 9038 0 R (paragraph.10.47.6.37) 9039 0 R (paragraph.10.47.6.38) 9040 0 R (paragraph.10.47.6.4) 8961 0 R (paragraph.10.47.6.5) 8969 0 R (paragraph.10.47.6.6) 8970 0 R]
-/Limits [(paragraph.10.47.6.36) (paragraph.10.47.6.6)]
->> endobj
-20687 0 obj <<
-/Names [(paragraph.10.47.6.7) 8971 0 R (paragraph.10.47.6.8) 8972 0 R (paragraph.10.47.6.9) 8973 0 R (paragraph.10.47.7.1) 9042 0 R (paragraph.10.48.2.1) 9146 0 R (paragraph.10.48.3.1) 9148 0 R]
-/Limits [(paragraph.10.47.6.7) (paragraph.10.48.3.1)]
->> endobj
-20688 0 obj <<
-/Names [(paragraph.10.48.4.1) 9175 0 R (paragraph.10.48.4.2) 9176 0 R (paragraph.10.48.4.3) 9177 0 R (paragraph.10.5.2.1) 4142 0 R (paragraph.10.50.2.1) 9271 0 R (paragraph.10.50.2.10) 9293 0 R]
-/Limits [(paragraph.10.48.4.1) (paragraph.10.50.2.10)]
->> endobj
-20689 0 obj <<
-/Names [(paragraph.10.50.2.11) 9294 0 R (paragraph.10.50.2.12) 9295 0 R (paragraph.10.50.2.13) 9296 0 R (paragraph.10.50.2.14) 9297 0 R (paragraph.10.50.2.15) 9298 0 R (paragraph.10.50.2.16) 9299 0 R]
-/Limits [(paragraph.10.50.2.11) (paragraph.10.50.2.16)]
->> endobj
-20690 0 obj <<
-/Names [(paragraph.10.50.2.2) 9272 0 R (paragraph.10.50.2.3) 9273 0 R (paragraph.10.50.2.4) 9274 0 R (paragraph.10.50.2.5) 9275 0 R (paragraph.10.50.2.6) 9276 0 R (paragraph.10.50.2.7) 9290 0 R]
-/Limits [(paragraph.10.50.2.2) (paragraph.10.50.2.7)]
->> endobj
-20691 0 obj <<
-/Names [(paragraph.10.50.2.8) 9291 0 R (paragraph.10.50.2.9) 9292 0 R (paragraph.10.51.2.1) 9795 0 R (paragraph.10.51.2.10) 9838 0 R (paragraph.10.51.2.11) 9841 0 R (paragraph.10.51.2.12) 9844 0 R]
-/Limits [(paragraph.10.50.2.8) (paragraph.10.51.2.12)]
->> endobj
-20692 0 obj <<
-/Names [(paragraph.10.51.2.2) 9798 0 R (paragraph.10.51.2.3) 9801 0 R (paragraph.10.51.2.4) 9809 0 R (paragraph.10.51.2.5) 9812 0 R (paragraph.10.51.2.6) 9815 0 R (paragraph.10.51.2.7) 9823 0 R]
-/Limits [(paragraph.10.51.2.2) (paragraph.10.51.2.7)]
->> endobj
-20693 0 obj <<
-/Names [(paragraph.10.51.2.8) 9826 0 R (paragraph.10.51.2.9) 9829 0 R (paragraph.10.51.3.1) 9846 0 R (paragraph.10.51.3.10) 9885 0 R (paragraph.10.51.3.11) 9888 0 R (paragraph.10.51.3.12) 9891 0 R]
-/Limits [(paragraph.10.51.2.8) (paragraph.10.51.3.12)]
->> endobj
-20694 0 obj <<
-/Names [(paragraph.10.51.3.13) 9898 0 R (paragraph.10.51.3.14) 9900 0 R (paragraph.10.51.3.15) 9902 0 R (paragraph.10.51.3.16) 9904 0 R (paragraph.10.51.3.17) 9906 0 R (paragraph.10.51.3.18) 9914 0 R]
-/Limits [(paragraph.10.51.3.13) (paragraph.10.51.3.18)]
->> endobj
-20695 0 obj <<
-/Names [(paragraph.10.51.3.19) 9917 0 R (paragraph.10.51.3.2) 9852 0 R (paragraph.10.51.3.20) 9920 0 R (paragraph.10.51.3.21) 9929 0 R (paragraph.10.51.3.22) 9932 0 R (paragraph.10.51.3.23) 9935 0 R]
-/Limits [(paragraph.10.51.3.19) (paragraph.10.51.3.23)]
->> endobj
-20696 0 obj <<
-/Names [(paragraph.10.51.3.24) 9943 0 R (paragraph.10.51.3.25) 9946 0 R (paragraph.10.51.3.26) 9949 0 R (paragraph.10.51.3.27) 9952 0 R (paragraph.10.51.3.28) 9963 0 R (paragraph.10.51.3.29) 9966 0 R]
-/Limits [(paragraph.10.51.3.24) (paragraph.10.51.3.29)]
->> endobj
-20697 0 obj <<
-/Names [(paragraph.10.51.3.3) 9854 0 R (paragraph.10.51.3.30) 9969 0 R (paragraph.10.51.3.31) 9971 0 R (paragraph.10.51.3.32) 9973 0 R (paragraph.10.51.3.33) 9984 0 R (paragraph.10.51.3.34) 9986 0 R]
-/Limits [(paragraph.10.51.3.3) (paragraph.10.51.3.34)]
->> endobj
-20698 0 obj <<
-/Names [(paragraph.10.51.3.35) 9988 0 R (paragraph.10.51.3.36) 9991 0 R (paragraph.10.51.3.37) 10001 0 R (paragraph.10.51.3.38) 10004 0 R (paragraph.10.51.3.39) 10015 0 R (paragraph.10.51.3.4) 9855 0 R]
-/Limits [(paragraph.10.51.3.35) (paragraph.10.51.3.4)]
->> endobj
-20699 0 obj <<
-/Names [(paragraph.10.51.3.40) 10018 0 R (paragraph.10.51.3.41) 10021 0 R (paragraph.10.51.3.42) 10037 0 R (paragraph.10.51.3.43) 10040 0 R (paragraph.10.51.3.44) 10042 0 R (paragraph.10.51.3.45) 10053 0 R]
-/Limits [(paragraph.10.51.3.40) (paragraph.10.51.3.45)]
->> endobj
-20700 0 obj <<
-/Names [(paragraph.10.51.3.46) 10055 0 R (paragraph.10.51.3.47) 10057 0 R (paragraph.10.51.3.48) 10071 0 R (paragraph.10.51.3.49) 10074 0 R (paragraph.10.51.3.5) 9857 0 R (paragraph.10.51.3.50) 10077 0 R]
-/Limits [(paragraph.10.51.3.46) (paragraph.10.51.3.50)]
->> endobj
-20701 0 obj <<
-/Names [(paragraph.10.51.3.51) 10091 0 R (paragraph.10.51.3.52) 10094 0 R (paragraph.10.51.3.53) 10097 0 R (paragraph.10.51.3.54) 10112 0 R (paragraph.10.51.3.55) 10115 0 R (paragraph.10.51.3.56) 10117 0 R]
-/Limits [(paragraph.10.51.3.51) (paragraph.10.51.3.56)]
->> endobj
-20702 0 obj <<
-/Names [(paragraph.10.51.3.57) 10120 0 R (paragraph.10.51.3.58) 10133 0 R (paragraph.10.51.3.59) 10135 0 R (paragraph.10.51.3.6) 9859 0 R (paragraph.10.51.3.60) 10149 0 R (paragraph.10.51.3.61) 10153 0 R]
-/Limits [(paragraph.10.51.3.57) (paragraph.10.51.3.61)]
->> endobj
-20703 0 obj <<
-/Names [(paragraph.10.51.3.7) 9861 0 R (paragraph.10.51.3.8) 9872 0 R (paragraph.10.51.3.9) 9875 0 R (paragraph.10.51.4.1) 10155 0 R (paragraph.10.51.4.2) 10156 0 R (paragraph.10.51.4.3) 10157 0 R]
-/Limits [(paragraph.10.51.3.7) (paragraph.10.51.4.3)]
->> endobj
-20704 0 obj <<
-/Names [(paragraph.10.51.4.4) 10158 0 R (paragraph.10.51.4.5) 10180 0 R (paragraph.10.51.4.6) 10181 0 R (paragraph.10.52.2.1) 10235 0 R (paragraph.10.53.2.1) 10564 0 R (paragraph.10.53.3.1) 10566 0 R]
-/Limits [(paragraph.10.51.4.4) (paragraph.10.53.3.1)]
->> endobj
-20705 0 obj <<
-/Names [(paragraph.10.53.4.1) 10568 0 R (paragraph.10.53.4.2) 10569 0 R (paragraph.10.53.5.1) 10571 0 R (paragraph.10.53.5.10) 10601 0 R (paragraph.10.53.5.11) 10602 0 R (paragraph.10.53.5.12) 10603 0 R]
-/Limits [(paragraph.10.53.4.1) (paragraph.10.53.5.12)]
->> endobj
-20706 0 obj <<
-/Names [(paragraph.10.53.5.13) 10605 0 R (paragraph.10.53.5.2) 10573 0 R (paragraph.10.53.5.3) 10583 0 R (paragraph.10.53.5.4) 10585 0 R (paragraph.10.53.5.5) 10586 0 R (paragraph.10.53.5.6) 10587 0 R]
-/Limits [(paragraph.10.53.5.13) (paragraph.10.53.5.6)]
->> endobj
-20707 0 obj <<
-/Names [(paragraph.10.53.5.7) 10588 0 R (paragraph.10.53.5.8) 10590 0 R (paragraph.10.53.5.9) 10592 0 R (paragraph.10.53.6.1) 10607 0 R (paragraph.10.53.6.10) 10621 0 R (paragraph.10.53.6.11) 10622 0 R]
-/Limits [(paragraph.10.53.5.7) (paragraph.10.53.6.11)]
->> endobj
-20708 0 obj <<
-/Names [(paragraph.10.53.6.12) 10623 0 R (paragraph.10.53.6.13) 10624 0 R (paragraph.10.53.6.14) 10625 0 R (paragraph.10.53.6.15) 10626 0 R (paragraph.10.53.6.16) 10627 0 R (paragraph.10.53.6.17) 10628 0 R]
-/Limits [(paragraph.10.53.6.12) (paragraph.10.53.6.17)]
->> endobj
-20709 0 obj <<
-/Names [(paragraph.10.53.6.2) 10608 0 R (paragraph.10.53.6.3) 10609 0 R (paragraph.10.53.6.4) 10610 0 R (paragraph.10.53.6.5) 10611 0 R (paragraph.10.53.6.6) 10617 0 R (paragraph.10.53.6.7) 10618 0 R]
-/Limits [(paragraph.10.53.6.2) (paragraph.10.53.6.7)]
->> endobj
-20710 0 obj <<
-/Names [(paragraph.10.53.6.8) 10619 0 R (paragraph.10.53.6.9) 10620 0 R (paragraph.10.53.7.1) 10630 0 R (paragraph.10.54.2.1) 10789 0 R (paragraph.10.54.3.1) 10791 0 R (paragraph.10.54.3.2) 10792 0 R]
-/Limits [(paragraph.10.53.6.8) (paragraph.10.54.3.2)]
->> endobj
-20711 0 obj <<
-/Names [(paragraph.10.54.4.1) 10809 0 R (paragraph.10.54.4.2) 10810 0 R (paragraph.10.54.4.3) 10811 0 R (paragraph.10.54.4.4) 10812 0 R (paragraph.10.54.4.5) 10813 0 R (paragraph.10.55.2.1) 10837 0 R]
-/Limits [(paragraph.10.54.4.1) (paragraph.10.55.2.1)]
->> endobj
-20712 0 obj <<
-/Names [(paragraph.10.61.2.1) 10969 0 R (paragraph.10.61.2.2) 10970 0 R (paragraph.10.61.2.3) 10978 0 R (paragraph.10.61.2.4) 10979 0 R (paragraph.10.61.2.5) 10980 0 R (paragraph.10.61.3.1) 10982 0 R]
-/Limits [(paragraph.10.61.2.1) (paragraph.10.61.3.1)]
->> endobj
-20713 0 obj <<
-/Names [(paragraph.10.61.3.2) 10983 0 R (paragraph.10.62.2.1) 11044 0 R (paragraph.10.62.2.2) 11045 0 R (paragraph.10.62.2.3) 11047 0 R (paragraph.10.62.2.4) 11049 0 R (paragraph.10.62.2.5) 11051 0 R]
-/Limits [(paragraph.10.61.3.2) (paragraph.10.62.2.5)]
->> endobj
-20714 0 obj <<
-/Names [(paragraph.10.62.3.1) 11059 0 R (paragraph.10.62.3.10) 11079 0 R (paragraph.10.62.3.2) 11061 0 R (paragraph.10.62.3.3) 11063 0 R (paragraph.10.62.3.4) 11065 0 R (paragraph.10.62.3.5) 11066 0 R]
-/Limits [(paragraph.10.62.3.1) (paragraph.10.62.3.5)]
->> endobj
-20715 0 obj <<
-/Names [(paragraph.10.62.3.6) 11067 0 R (paragraph.10.62.3.7) 11068 0 R (paragraph.10.62.3.8) 11076 0 R (paragraph.10.62.3.9) 11077 0 R (paragraph.10.63.2.1) 11562 0 R (paragraph.10.63.2.10) 11578 0 R]
-/Limits [(paragraph.10.62.3.6) (paragraph.10.63.2.10)]
->> endobj
-20716 0 obj <<
-/Names [(paragraph.10.63.2.11) 11590 0 R (paragraph.10.63.2.12) 11591 0 R (paragraph.10.63.2.13) 11592 0 R (paragraph.10.63.2.14) 11593 0 R (paragraph.10.63.2.15) 11594 0 R (paragraph.10.63.2.16) 11602 0 R]
-/Limits [(paragraph.10.63.2.11) (paragraph.10.63.2.16)]
->> endobj
-20717 0 obj <<
-/Names [(paragraph.10.63.2.17) 11603 0 R (paragraph.10.63.2.18) 11604 0 R (paragraph.10.63.2.2) 11570 0 R (paragraph.10.63.2.3) 11571 0 R (paragraph.10.63.2.4) 11572 0 R (paragraph.10.63.2.5) 11573 0 R]
-/Limits [(paragraph.10.63.2.17) (paragraph.10.63.2.5)]
->> endobj
-20718 0 obj <<
-/Names [(paragraph.10.63.2.6) 11574 0 R (paragraph.10.63.2.7) 11575 0 R (paragraph.10.63.2.8) 11576 0 R (paragraph.10.63.2.9) 11577 0 R (paragraph.10.63.3.1) 11606 0 R (paragraph.10.63.3.10) 11622 0 R]
-/Limits [(paragraph.10.63.2.6) (paragraph.10.63.3.10)]
->> endobj
-20719 0 obj <<
-/Names [(paragraph.10.63.3.11) 11628 0 R (paragraph.10.63.3.12) 11629 0 R (paragraph.10.63.3.2) 11607 0 R (paragraph.10.63.3.3) 11608 0 R (paragraph.10.63.3.4) 11609 0 R (paragraph.10.63.3.5) 11616 0 R]
-/Limits [(paragraph.10.63.3.11) (paragraph.10.63.3.5)]
->> endobj
-20720 0 obj <<
-/Names [(paragraph.10.63.3.6) 11617 0 R (paragraph.10.63.3.7) 11618 0 R (paragraph.10.63.3.8) 11619 0 R (paragraph.10.63.3.9) 11620 0 R (paragraph.10.63.4.1) 11631 0 R (paragraph.10.63.4.10) 11640 0 R]
-/Limits [(paragraph.10.63.3.6) (paragraph.10.63.4.10)]
->> endobj
-20721 0 obj <<
-/Names [(paragraph.10.63.4.11) 11641 0 R (paragraph.10.63.4.12) 11648 0 R (paragraph.10.63.4.13) 11649 0 R (paragraph.10.63.4.14) 11650 0 R (paragraph.10.63.4.15) 11651 0 R (paragraph.10.63.4.16) 11652 0 R]
-/Limits [(paragraph.10.63.4.11) (paragraph.10.63.4.16)]
->> endobj
-20722 0 obj <<
-/Names [(paragraph.10.63.4.17) 11653 0 R (paragraph.10.63.4.18) 11654 0 R (paragraph.10.63.4.19) 11657 0 R (paragraph.10.63.4.2) 11632 0 R (paragraph.10.63.4.20) 11658 0 R (paragraph.10.63.4.21) 11659 0 R]
-/Limits [(paragraph.10.63.4.17) (paragraph.10.63.4.21)]
->> endobj
-20723 0 obj <<
-/Names [(paragraph.10.63.4.22) 11668 0 R (paragraph.10.63.4.23) 11669 0 R (paragraph.10.63.4.24) 11670 0 R (paragraph.10.63.4.25) 11671 0 R (paragraph.10.63.4.26) 11672 0 R (paragraph.10.63.4.27) 11673 0 R]
-/Limits [(paragraph.10.63.4.22) (paragraph.10.63.4.27)]
->> endobj
-20724 0 obj <<
-/Names [(paragraph.10.63.4.28) 11674 0 R (paragraph.10.63.4.29) 11675 0 R (paragraph.10.63.4.3) 11633 0 R (paragraph.10.63.4.30) 11676 0 R (paragraph.10.63.4.31) 11677 0 R (paragraph.10.63.4.32) 11678 0 R]
-/Limits [(paragraph.10.63.4.28) (paragraph.10.63.4.32)]
->> endobj
-20725 0 obj <<
-/Names [(paragraph.10.63.4.33) 11679 0 R (paragraph.10.63.4.34) 11686 0 R (paragraph.10.63.4.35) 11687 0 R (paragraph.10.63.4.36) 11688 0 R (paragraph.10.63.4.37) 11689 0 R (paragraph.10.63.4.38) 11690 0 R]
-/Limits [(paragraph.10.63.4.33) (paragraph.10.63.4.38)]
->> endobj
-20726 0 obj <<
-/Names [(paragraph.10.63.4.39) 11691 0 R (paragraph.10.63.4.4) 11634 0 R (paragraph.10.63.4.40) 11692 0 R (paragraph.10.63.4.41) 11693 0 R (paragraph.10.63.4.42) 11694 0 R (paragraph.10.63.4.43) 11695 0 R]
-/Limits [(paragraph.10.63.4.39) (paragraph.10.63.4.43)]
->> endobj
-20727 0 obj <<
-/Names [(paragraph.10.63.4.44) 11696 0 R (paragraph.10.63.4.45) 11697 0 R (paragraph.10.63.4.46) 11698 0 R (paragraph.10.63.4.47) 11699 0 R (paragraph.10.63.4.48) 11700 0 R (paragraph.10.63.4.49) 11701 0 R]
-/Limits [(paragraph.10.63.4.44) (paragraph.10.63.4.49)]
->> endobj
-20728 0 obj <<
-/Names [(paragraph.10.63.4.5) 11635 0 R (paragraph.10.63.4.50) 11702 0 R (paragraph.10.63.4.51) 11703 0 R (paragraph.10.63.4.52) 11704 0 R (paragraph.10.63.4.53) 11705 0 R (paragraph.10.63.4.54) 11726 0 R]
-/Limits [(paragraph.10.63.4.5) (paragraph.10.63.4.54)]
->> endobj
-20729 0 obj <<
-/Names [(paragraph.10.63.4.55) 11727 0 R (paragraph.10.63.4.56) 11728 0 R (paragraph.10.63.4.57) 11729 0 R (paragraph.10.63.4.58) 11730 0 R (paragraph.10.63.4.59) 11731 0 R (paragraph.10.63.4.6) 11636 0 R]
-/Limits [(paragraph.10.63.4.55) (paragraph.10.63.4.6)]
->> endobj
-20730 0 obj <<
-/Names [(paragraph.10.63.4.60) 11732 0 R (paragraph.10.63.4.7) 11637 0 R (paragraph.10.63.4.8) 11638 0 R (paragraph.10.63.4.9) 11639 0 R (paragraph.10.64.2.1) 12041 0 R (paragraph.10.64.3.1) 12045 0 R]
-/Limits [(paragraph.10.63.4.60) (paragraph.10.64.3.1)]
->> endobj
-20731 0 obj <<
-/Names [(paragraph.10.64.3.2) 12053 0 R (paragraph.10.64.3.3) 12055 0 R (paragraph.10.64.4.1) 12063 0 R (paragraph.10.64.4.10) 12072 0 R (paragraph.10.64.4.11) 12078 0 R (paragraph.10.64.4.12) 12079 0 R]
-/Limits [(paragraph.10.64.3.2) (paragraph.10.64.4.12)]
->> endobj
-20732 0 obj <<
-/Names [(paragraph.10.64.4.13) 12080 0 R (paragraph.10.64.4.14) 12081 0 R (paragraph.10.64.4.15) 12082 0 R (paragraph.10.64.4.16) 12083 0 R (paragraph.10.64.4.17) 12084 0 R (paragraph.10.64.4.18) 12085 0 R]
-/Limits [(paragraph.10.64.4.13) (paragraph.10.64.4.18)]
->> endobj
-20733 0 obj <<
-/Names [(paragraph.10.64.4.19) 12086 0 R (paragraph.10.64.4.2) 12064 0 R (paragraph.10.64.4.20) 12087 0 R (paragraph.10.64.4.21) 12097 0 R (paragraph.10.64.4.22) 12098 0 R (paragraph.10.64.4.23) 12099 0 R]
-/Limits [(paragraph.10.64.4.19) (paragraph.10.64.4.23)]
->> endobj
-20734 0 obj <<
-/Names [(paragraph.10.64.4.24) 12102 0 R (paragraph.10.64.4.25) 12103 0 R (paragraph.10.64.4.26) 12104 0 R (paragraph.10.64.4.27) 12105 0 R (paragraph.10.64.4.28) 12106 0 R (paragraph.10.64.4.29) 12107 0 R]
-/Limits [(paragraph.10.64.4.24) (paragraph.10.64.4.29)]
->> endobj
-20735 0 obj <<
-/Names [(paragraph.10.64.4.3) 12065 0 R (paragraph.10.64.4.30) 12113 0 R (paragraph.10.64.4.31) 12114 0 R (paragraph.10.64.4.32) 12115 0 R (paragraph.10.64.4.33) 12116 0 R (paragraph.10.64.4.34) 12117 0 R]
-/Limits [(paragraph.10.64.4.3) (paragraph.10.64.4.34)]
->> endobj
-20736 0 obj <<
-/Names [(paragraph.10.64.4.35) 12118 0 R (paragraph.10.64.4.36) 12119 0 R (paragraph.10.64.4.37) 12120 0 R (paragraph.10.64.4.38) 12121 0 R (paragraph.10.64.4.39) 12122 0 R (paragraph.10.64.4.4) 12066 0 R]
-/Limits [(paragraph.10.64.4.35) (paragraph.10.64.4.4)]
->> endobj
-20737 0 obj <<
-/Names [(paragraph.10.64.4.40) 12123 0 R (paragraph.10.64.4.41) 12124 0 R (paragraph.10.64.4.42) 12125 0 R (paragraph.10.64.4.43) 12126 0 R (paragraph.10.64.4.44) 12127 0 R (paragraph.10.64.4.45) 12128 0 R]
-/Limits [(paragraph.10.64.4.40) (paragraph.10.64.4.45)]
->> endobj
-20738 0 obj <<
-/Names [(paragraph.10.64.4.46) 12129 0 R (paragraph.10.64.4.47) 12130 0 R (paragraph.10.64.4.48) 12146 0 R (paragraph.10.64.4.49) 12147 0 R (paragraph.10.64.4.5) 12067 0 R (paragraph.10.64.4.50) 12148 0 R]
-/Limits [(paragraph.10.64.4.46) (paragraph.10.64.4.50)]
->> endobj
-20739 0 obj <<
-/Names [(paragraph.10.64.4.51) 12149 0 R (paragraph.10.64.4.52) 12150 0 R (paragraph.10.64.4.53) 12151 0 R (paragraph.10.64.4.54) 12152 0 R (paragraph.10.64.4.55) 12153 0 R (paragraph.10.64.4.56) 12154 0 R]
-/Limits [(paragraph.10.64.4.51) (paragraph.10.64.4.56)]
->> endobj
-20740 0 obj <<
-/Names [(paragraph.10.64.4.6) 12068 0 R (paragraph.10.64.4.7) 12069 0 R (paragraph.10.64.4.8) 12070 0 R (paragraph.10.64.4.9) 12071 0 R (paragraph.10.65.2.1) 12321 0 R (paragraph.10.65.2.2) 12331 0 R]
-/Limits [(paragraph.10.64.4.6) (paragraph.10.65.2.2)]
->> endobj
-20741 0 obj <<
-/Names [(paragraph.10.65.3.1) 12333 0 R (paragraph.10.65.3.2) 12336 0 R (paragraph.10.65.3.3) 12346 0 R (paragraph.10.65.3.4) 12349 0 R (paragraph.10.65.4.1) 12353 0 R (paragraph.10.65.4.10) 12382 0 R]
-/Limits [(paragraph.10.65.3.1) (paragraph.10.65.4.10)]
->> endobj
-20742 0 obj <<
-/Names [(paragraph.10.65.4.11) 12391 0 R (paragraph.10.65.4.12) 12393 0 R (paragraph.10.65.4.2) 12361 0 R (paragraph.10.65.4.3) 12364 0 R (paragraph.10.65.4.4) 12366 0 R (paragraph.10.65.4.5) 12368 0 R]
-/Limits [(paragraph.10.65.4.11) (paragraph.10.65.4.5)]
->> endobj
-20743 0 obj <<
-/Names [(paragraph.10.65.4.6) 12370 0 R (paragraph.10.65.4.7) 12377 0 R (paragraph.10.65.4.8) 12378 0 R (paragraph.10.65.4.9) 12379 0 R (paragraph.10.65.5.1) 12396 0 R (paragraph.10.65.5.2) 12397 0 R]
-/Limits [(paragraph.10.65.4.6) (paragraph.10.65.5.2)]
->> endobj
-20744 0 obj <<
-/Names [(paragraph.10.65.5.3) 12398 0 R (paragraph.10.66.2.1) 12480 0 R (paragraph.10.66.3.1) 12498 0 R (paragraph.10.66.3.2) 12499 0 R (paragraph.10.67.2.1) 12598 0 R (paragraph.10.67.2.10) 12630 0 R]
-/Limits [(paragraph.10.65.5.3) (paragraph.10.67.2.10)]
->> endobj
-20745 0 obj <<
-/Names [(paragraph.10.67.2.11) 12632 0 R (paragraph.10.67.2.12) 12639 0 R (paragraph.10.67.2.2) 12601 0 R (paragraph.10.67.2.3) 12603 0 R (paragraph.10.67.2.4) 12610 0 R (paragraph.10.67.2.5) 12613 0 R]
-/Limits [(paragraph.10.67.2.11) (paragraph.10.67.2.5)]
->> endobj
-20746 0 obj <<
-/Names [(paragraph.10.67.2.6) 12616 0 R (paragraph.10.67.2.7) 12618 0 R (paragraph.10.67.2.8) 12625 0 R (paragraph.10.67.2.9) 12627 0 R (paragraph.10.67.3.1) 12642 0 R (paragraph.10.69.2.1) 12666 0 R]
-/Limits [(paragraph.10.67.2.6) (paragraph.10.69.2.1)]
->> endobj
-20747 0 obj <<
-/Names [(paragraph.10.70.2.1) 13258 0 R (paragraph.10.70.2.10) 13287 0 R (paragraph.10.70.2.2) 13260 0 R (paragraph.10.70.2.3) 13266 0 R (paragraph.10.70.2.4) 13267 0 R (paragraph.10.70.2.5) 13270 0 R]
-/Limits [(paragraph.10.70.2.1) (paragraph.10.70.2.5)]
->> endobj
-20748 0 obj <<
-/Names [(paragraph.10.70.2.6) 13273 0 R (paragraph.10.70.2.7) 13280 0 R (paragraph.10.70.2.8) 13281 0 R (paragraph.10.70.2.9) 13284 0 R (paragraph.10.70.3.1) 13297 0 R (paragraph.10.70.3.10) 13320 0 R]
-/Limits [(paragraph.10.70.2.6) (paragraph.10.70.3.10)]
->> endobj
-20749 0 obj <<
-/Names [(paragraph.10.70.3.11) 13328 0 R (paragraph.10.70.3.12) 13331 0 R (paragraph.10.70.3.13) 13341 0 R (paragraph.10.70.3.14) 13344 0 R (paragraph.10.70.3.15) 13352 0 R (paragraph.10.70.3.16) 13355 0 R]
-/Limits [(paragraph.10.70.3.11) (paragraph.10.70.3.16)]
->> endobj
-20750 0 obj <<
-/Names [(paragraph.10.70.3.17) 13358 0 R (paragraph.10.70.3.18) 13366 0 R (paragraph.10.70.3.19) 13369 0 R (paragraph.10.70.3.2) 13299 0 R (paragraph.10.70.3.20) 13372 0 R (paragraph.10.70.3.21) 13375 0 R]
-/Limits [(paragraph.10.70.3.17) (paragraph.10.70.3.21)]
->> endobj
-20751 0 obj <<
-/Names [(paragraph.10.70.3.22) 13384 0 R (paragraph.10.70.3.23) 13387 0 R (paragraph.10.70.3.24) 13390 0 R (paragraph.10.70.3.25) 13393 0 R (paragraph.10.70.3.26) 13402 0 R (paragraph.10.70.3.27) 13405 0 R]
-/Limits [(paragraph.10.70.3.22) (paragraph.10.70.3.27)]
->> endobj
-20752 0 obj <<
-/Names [(paragraph.10.70.3.28) 13416 0 R (paragraph.10.70.3.29) 13419 0 R (paragraph.10.70.3.3) 13301 0 R (paragraph.10.70.3.30) 13421 0 R (paragraph.10.70.3.31) 13423 0 R (paragraph.10.70.3.32) 13425 0 R]
-/Limits [(paragraph.10.70.3.28) (paragraph.10.70.3.32)]
->> endobj
-20753 0 obj <<
-/Names [(paragraph.10.70.3.33) 13435 0 R (paragraph.10.70.3.34) 13437 0 R (paragraph.10.70.3.35) 13439 0 R (paragraph.10.70.3.36) 13450 0 R (paragraph.10.70.3.37) 13453 0 R (paragraph.10.70.3.38) 13456 0 R]
-/Limits [(paragraph.10.70.3.33) (paragraph.10.70.3.38)]
->> endobj
-20754 0 obj <<
-/Names [(paragraph.10.70.3.39) 13467 0 R (paragraph.10.70.3.4) 13303 0 R (paragraph.10.70.3.40) 13470 0 R (paragraph.10.70.3.41) 13473 0 R (paragraph.10.70.3.42) 13484 0 R (paragraph.10.70.3.43) 13487 0 R]
-/Limits [(paragraph.10.70.3.39) (paragraph.10.70.3.43)]
->> endobj
-20755 0 obj <<
-/Names [(paragraph.10.70.3.44) 13499 0 R (paragraph.10.70.3.45) 13501 0 R (paragraph.10.70.3.46) 13504 0 R (paragraph.10.70.3.47) 13514 0 R (paragraph.10.70.3.48) 13516 0 R (paragraph.10.70.3.49) 13519 0 R]
-/Limits [(paragraph.10.70.3.44) (paragraph.10.70.3.49)]
->> endobj
-20756 0 obj <<
-/Names [(paragraph.10.70.3.5) 13310 0 R (paragraph.10.70.3.50) 13533 0 R (paragraph.10.70.3.51) 13536 0 R (paragraph.10.70.3.52) 13539 0 R (paragraph.10.70.3.53) 13549 0 R (paragraph.10.70.3.54) 13552 0 R]
-/Limits [(paragraph.10.70.3.5) (paragraph.10.70.3.54)]
->> endobj
-20757 0 obj <<
-/Names [(paragraph.10.70.3.55) 13554 0 R (paragraph.10.70.3.56) 13566 0 R (paragraph.10.70.3.57) 13568 0 R (paragraph.10.70.3.58) 13571 0 R (paragraph.10.70.3.59) 13573 0 R (paragraph.10.70.3.6) 13312 0 R]
-/Limits [(paragraph.10.70.3.55) (paragraph.10.70.3.6)]
->> endobj
-20758 0 obj <<
-/Names [(paragraph.10.70.3.60) 13590 0 R (paragraph.10.70.3.61) 13593 0 R (paragraph.10.70.3.62) 13606 0 R (paragraph.10.70.3.63) 13609 0 R (paragraph.10.70.3.64) 13611 0 R (paragraph.10.70.3.7) 13314 0 R]
-/Limits [(paragraph.10.70.3.60) (paragraph.10.70.3.7)]
->> endobj
-20759 0 obj <<
-/Names [(paragraph.10.70.3.8) 13316 0 R (paragraph.10.70.3.9) 13318 0 R (paragraph.10.70.4.1) 13618 0 R (paragraph.10.70.4.10) 13632 0 R (paragraph.10.70.4.11) 13633 0 R (paragraph.10.70.4.12) 13639 0 R]
-/Limits [(paragraph.10.70.3.8) (paragraph.10.70.4.12)]
->> endobj
-20760 0 obj <<
-/Names [(paragraph.10.70.4.13) 13640 0 R (paragraph.10.70.4.14) 13641 0 R (paragraph.10.70.4.15) 13642 0 R (paragraph.10.70.4.16) 13643 0 R (paragraph.10.70.4.17) 13644 0 R (paragraph.10.70.4.18) 13645 0 R]
-/Limits [(paragraph.10.70.4.13) (paragraph.10.70.4.18)]
->> endobj
-20761 0 obj <<
-/Names [(paragraph.10.70.4.19) 13646 0 R (paragraph.10.70.4.2) 13619 0 R (paragraph.10.70.4.20) 13647 0 R (paragraph.10.70.4.21) 13659 0 R (paragraph.10.70.4.22) 13660 0 R (paragraph.10.70.4.23) 13661 0 R]
-/Limits [(paragraph.10.70.4.19) (paragraph.10.70.4.23)]
->> endobj
-20762 0 obj <<
-/Names [(paragraph.10.70.4.24) 13662 0 R (paragraph.10.70.4.25) 13663 0 R (paragraph.10.70.4.26) 13664 0 R (paragraph.10.70.4.3) 13620 0 R (paragraph.10.70.4.4) 13621 0 R (paragraph.10.70.4.5) 13622 0 R]
-/Limits [(paragraph.10.70.4.24) (paragraph.10.70.4.5)]
->> endobj
-20763 0 obj <<
-/Names [(paragraph.10.70.4.6) 13623 0 R (paragraph.10.70.4.7) 13624 0 R (paragraph.10.70.4.8) 13630 0 R (paragraph.10.70.4.9) 13631 0 R (paragraph.10.71.2.1) 13708 0 R (paragraph.10.71.3.1) 13711 0 R]
-/Limits [(paragraph.10.70.4.6) (paragraph.10.71.3.1)]
->> endobj
-20764 0 obj <<
-/Names [(paragraph.10.71.3.2) 13712 0 R (paragraph.10.72.2.1) 14155 0 R (paragraph.10.72.2.10) 14198 0 R (paragraph.10.72.2.11) 14201 0 R (paragraph.10.72.2.12) 14209 0 R (paragraph.10.72.2.2) 14158 0 R]
-/Limits [(paragraph.10.71.3.2) (paragraph.10.72.2.2)]
->> endobj
-20765 0 obj <<
-/Names [(paragraph.10.72.2.3) 14166 0 R (paragraph.10.72.2.4) 14169 0 R (paragraph.10.72.2.5) 14172 0 R (paragraph.10.72.2.6) 14180 0 R (paragraph.10.72.2.7) 14183 0 R (paragraph.10.72.2.8) 14186 0 R]
-/Limits [(paragraph.10.72.2.3) (paragraph.10.72.2.8)]
->> endobj
-20766 0 obj <<
-/Names [(paragraph.10.72.2.9) 14195 0 R (paragraph.10.72.3.1) 14211 0 R (paragraph.10.72.3.10) 14248 0 R (paragraph.10.72.3.11) 14250 0 R (paragraph.10.72.3.12) 14252 0 R (paragraph.10.72.3.13) 14255 0 R]
-/Limits [(paragraph.10.72.2.9) (paragraph.10.72.3.13)]
->> endobj
-20767 0 obj <<
-/Names [(paragraph.10.72.3.14) 14262 0 R (paragraph.10.72.3.15) 14265 0 R (paragraph.10.72.3.16) 14268 0 R (paragraph.10.72.3.17) 14271 0 R (paragraph.10.72.3.18) 14280 0 R (paragraph.10.72.3.19) 14283 0 R]
-/Limits [(paragraph.10.72.3.14) (paragraph.10.72.3.19)]
->> endobj
-20768 0 obj <<
-/Names [(paragraph.10.72.3.2) 14213 0 R (paragraph.10.72.3.20) 14286 0 R (paragraph.10.72.3.21) 14297 0 R (paragraph.10.72.3.22) 14300 0 R (paragraph.10.72.3.23) 14303 0 R (paragraph.10.72.3.24) 14311 0 R]
-/Limits [(paragraph.10.72.3.2) (paragraph.10.72.3.24)]
->> endobj
-20769 0 obj <<
-/Names [(paragraph.10.72.3.25) 14313 0 R (paragraph.10.72.3.26) 14315 0 R (paragraph.10.72.3.27) 14317 0 R (paragraph.10.72.3.28) 14331 0 R (paragraph.10.72.3.29) 14334 0 R (paragraph.10.72.3.3) 14215 0 R]
-/Limits [(paragraph.10.72.3.25) (paragraph.10.72.3.3)]
->> endobj
-20770 0 obj <<
-/Names [(paragraph.10.72.3.30) 14338 0 R (paragraph.10.72.3.31) 14355 0 R (paragraph.10.72.3.32) 14358 0 R (paragraph.10.72.3.33) 14361 0 R (paragraph.10.72.3.34) 14372 0 R (paragraph.10.72.3.35) 14375 0 R]
-/Limits [(paragraph.10.72.3.30) (paragraph.10.72.3.35)]
->> endobj
-20771 0 obj <<
-/Names [(paragraph.10.72.3.36) 14377 0 R (paragraph.10.72.3.37) 14387 0 R (paragraph.10.72.3.38) 14389 0 R (paragraph.10.72.3.39) 14400 0 R (paragraph.10.72.3.4) 14222 0 R (paragraph.10.72.3.40) 14403 0 R]
-/Limits [(paragraph.10.72.3.36) (paragraph.10.72.3.40)]
->> endobj
-20772 0 obj <<
-/Names [(paragraph.10.72.3.41) 14406 0 R (paragraph.10.72.3.42) 14408 0 R (paragraph.10.72.3.43) 14423 0 R (paragraph.10.72.3.44) 14425 0 R (paragraph.10.72.3.45) 14438 0 R (paragraph.10.72.3.46) 14441 0 R]
-/Limits [(paragraph.10.72.3.41) (paragraph.10.72.3.46)]
->> endobj
-20773 0 obj <<
-/Names [(paragraph.10.72.3.47) 14445 0 R (paragraph.10.72.3.5) 14224 0 R (paragraph.10.72.3.6) 14227 0 R (paragraph.10.72.3.7) 14235 0 R (paragraph.10.72.3.8) 14238 0 R (paragraph.10.72.3.9) 14246 0 R]
-/Limits [(paragraph.10.72.3.47) (paragraph.10.72.3.9)]
->> endobj
-20774 0 obj <<
-/Names [(paragraph.10.72.4.1) 14447 0 R (paragraph.10.72.4.2) 14455 0 R (paragraph.10.72.4.3) 14456 0 R (paragraph.10.72.4.4) 14457 0 R (paragraph.10.72.4.5) 14458 0 R (paragraph.10.72.4.6) 14459 0 R]
-/Limits [(paragraph.10.72.4.1) (paragraph.10.72.4.6)]
->> endobj
-20775 0 obj <<
-/Names [(paragraph.10.72.4.7) 14460 0 R (paragraph.10.72.4.8) 14461 0 R (paragraph.10.76.2.1) 14829 0 R (paragraph.10.76.2.2) 14830 0 R (paragraph.10.76.3.1) 14832 0 R (paragraph.10.76.3.2) 14844 0 R]
-/Limits [(paragraph.10.72.4.7) (paragraph.10.76.3.2)]
->> endobj
-20776 0 obj <<
-/Names [(paragraph.10.76.4.1) 14848 0 R (paragraph.10.76.4.10) 14875 0 R (paragraph.10.76.4.11) 14878 0 R (paragraph.10.76.4.2) 14849 0 R (paragraph.10.76.4.3) 14852 0 R (paragraph.10.76.4.4) 14859 0 R]
-/Limits [(paragraph.10.76.4.1) (paragraph.10.76.4.4)]
->> endobj
-20777 0 obj <<
-/Names [(paragraph.10.76.4.5) 14861 0 R (paragraph.10.76.4.6) 14863 0 R (paragraph.10.76.4.7) 14864 0 R (paragraph.10.76.4.8) 14865 0 R (paragraph.10.76.4.9) 14866 0 R (paragraph.10.76.5.1) 14880 0 R]
-/Limits [(paragraph.10.76.4.5) (paragraph.10.76.5.1)]
->> endobj
-20778 0 obj <<
-/Names [(paragraph.10.76.5.2) 14881 0 R (paragraph.10.76.5.3) 14882 0 R (paragraph.10.77.2.1) 14978 0 R (paragraph.10.77.3.1) 14980 0 R (paragraph.10.77.3.2) 14993 0 R (paragraph.10.77.3.3) 14995 0 R]
-/Limits [(paragraph.10.76.5.2) (paragraph.10.77.3.3)]
->> endobj
-20779 0 obj <<
-/Names [(paragraph.10.78.2.1) 15136 0 R (paragraph.10.78.2.2) 15150 0 R (paragraph.10.78.2.3) 15152 0 R (paragraph.10.78.2.4) 15155 0 R (paragraph.10.78.2.5) 15158 0 R (paragraph.10.78.2.6) 15170 0 R]
-/Limits [(paragraph.10.78.2.1) (paragraph.10.78.2.6)]
->> endobj
-20780 0 obj <<
-/Names [(paragraph.10.78.3.1) 15172 0 R (paragraph.10.79.2.1) 15600 0 R (paragraph.10.79.2.2) 15612 0 R (paragraph.10.79.2.3) 15613 0 R (paragraph.10.79.2.4) 15615 0 R (paragraph.10.79.2.5) 15618 0 R]
-/Limits [(paragraph.10.78.3.1) (paragraph.10.79.2.5)]
->> endobj
-20781 0 obj <<
-/Names [(paragraph.10.79.2.6) 15627 0 R (paragraph.10.79.2.7) 15630 0 R (paragraph.10.79.2.8) 15638 0 R (paragraph.10.79.2.9) 15641 0 R (paragraph.10.79.3.1) 15645 0 R (paragraph.10.79.3.10) 15683 0 R]
-/Limits [(paragraph.10.79.2.6) (paragraph.10.79.3.10)]
->> endobj
-20782 0 obj <<
-/Names [(paragraph.10.79.3.11) 15690 0 R (paragraph.10.79.3.12) 15692 0 R (paragraph.10.79.3.13) 15694 0 R (paragraph.10.79.3.14) 15696 0 R (paragraph.10.79.3.15) 15698 0 R (paragraph.10.79.3.16) 15700 0 R]
-/Limits [(paragraph.10.79.3.11) (paragraph.10.79.3.16)]
->> endobj
-20783 0 obj <<
-/Names [(paragraph.10.79.3.17) 15707 0 R (paragraph.10.79.3.18) 15709 0 R (paragraph.10.79.3.19) 15711 0 R (paragraph.10.79.3.2) 15652 0 R (paragraph.10.79.3.20) 15714 0 R (paragraph.10.79.3.21) 15717 0 R]
-/Limits [(paragraph.10.79.3.17) (paragraph.10.79.3.21)]
->> endobj
-20784 0 obj <<
-/Names [(paragraph.10.79.3.22) 15725 0 R (paragraph.10.79.3.23) 15727 0 R (paragraph.10.79.3.24) 15730 0 R (paragraph.10.79.3.25) 15733 0 R (paragraph.10.79.3.26) 15744 0 R (paragraph.10.79.3.27) 15747 0 R]
-/Limits [(paragraph.10.79.3.22) (paragraph.10.79.3.27)]
->> endobj
-20785 0 obj <<
-/Names [(paragraph.10.79.3.28) 15750 0 R (paragraph.10.79.3.29) 15759 0 R (paragraph.10.79.3.3) 15655 0 R (paragraph.10.79.3.30) 15761 0 R (paragraph.10.79.3.31) 15762 0 R (paragraph.10.79.3.32) 15764 0 R]
-/Limits [(paragraph.10.79.3.28) (paragraph.10.79.3.32)]
->> endobj
-20786 0 obj <<
-/Names [(paragraph.10.79.3.33) 15766 0 R (paragraph.10.79.3.34) 15776 0 R (paragraph.10.79.3.35) 15779 0 R (paragraph.10.79.3.36) 15794 0 R (paragraph.10.79.3.37) 15798 0 R (paragraph.10.79.3.38) 15801 0 R]
-/Limits [(paragraph.10.79.3.33) (paragraph.10.79.3.38)]
->> endobj
-20787 0 obj <<
-/Names [(paragraph.10.79.3.39) 15813 0 R (paragraph.10.79.3.4) 15657 0 R (paragraph.10.79.3.40) 15816 0 R (paragraph.10.79.3.41) 15830 0 R (paragraph.10.79.3.42) 15831 0 R (paragraph.10.79.3.43) 15834 0 R]
-/Limits [(paragraph.10.79.3.39) (paragraph.10.79.3.43)]
->> endobj
-20788 0 obj <<
-/Names [(paragraph.10.79.3.44) 15835 0 R (paragraph.10.79.3.45) 15848 0 R (paragraph.10.79.3.46) 15863 0 R (paragraph.10.79.3.47) 15864 0 R (paragraph.10.79.3.48) 15867 0 R (paragraph.10.79.3.49) 15869 0 R]
-/Limits [(paragraph.10.79.3.44) (paragraph.10.79.3.49)]
->> endobj
-20789 0 obj <<
-/Names [(paragraph.10.79.3.5) 15659 0 R (paragraph.10.79.3.50) 15870 0 R (paragraph.10.79.3.51) 15882 0 R (paragraph.10.79.3.6) 15667 0 R (paragraph.10.79.3.7) 15670 0 R (paragraph.10.79.3.8) 15673 0 R]
-/Limits [(paragraph.10.79.3.5) (paragraph.10.79.3.8)]
->> endobj
-20790 0 obj <<
-/Names [(paragraph.10.79.3.9) 15681 0 R (paragraph.10.79.4.1) 15887 0 R (paragraph.10.79.4.10) 15911 0 R (paragraph.10.79.4.11) 15912 0 R (paragraph.10.79.4.12) 15913 0 R (paragraph.10.79.4.2) 15889 0 R]
-/Limits [(paragraph.10.79.3.9) (paragraph.10.79.4.2)]
->> endobj
-20791 0 obj <<
-/Names [(paragraph.10.79.4.3) 15891 0 R (paragraph.10.79.4.4) 15892 0 R (paragraph.10.79.4.5) 15893 0 R (paragraph.10.79.4.6) 15904 0 R (paragraph.10.79.4.7) 15906 0 R (paragraph.10.79.4.8) 15908 0 R]
-/Limits [(paragraph.10.79.4.3) (paragraph.10.79.4.8)]
->> endobj
-20792 0 obj <<
-/Names [(paragraph.10.79.4.9) 15910 0 R (paragraph.10.8.2.1) 4737 0 R (paragraph.10.8.2.10) 4767 0 R (paragraph.10.8.2.11) 4768 0 R (paragraph.10.8.2.12) 4769 0 R (paragraph.10.8.2.13) 4770 0 R]
-/Limits [(paragraph.10.79.4.9) (paragraph.10.8.2.13)]
->> endobj
-20793 0 obj <<
-/Names [(paragraph.10.8.2.14) 4776 0 R (paragraph.10.8.2.2) 4739 0 R (paragraph.10.8.2.3) 4740 0 R (paragraph.10.8.2.4) 4749 0 R (paragraph.10.8.2.5) 4751 0 R (paragraph.10.8.2.6) 4753 0 R]
-/Limits [(paragraph.10.8.2.14) (paragraph.10.8.2.6)]
->> endobj
-20794 0 obj <<
-/Names [(paragraph.10.8.2.7) 4755 0 R (paragraph.10.8.2.8) 4763 0 R (paragraph.10.8.2.9) 4765 0 R (paragraph.10.8.3.1) 4778 0 R (paragraph.10.8.3.10) 4809 0 R (paragraph.10.8.3.11) 4812 0 R]
-/Limits [(paragraph.10.8.2.7) (paragraph.10.8.3.11)]
->> endobj
-20795 0 obj <<
-/Names [(paragraph.10.8.3.12) 4822 0 R (paragraph.10.8.3.13) 4824 0 R (paragraph.10.8.3.14) 4826 0 R (paragraph.10.8.3.15) 4828 0 R (paragraph.10.8.3.16) 4838 0 R (paragraph.10.8.3.17) 4841 0 R]
-/Limits [(paragraph.10.8.3.12) (paragraph.10.8.3.17)]
->> endobj
-20796 0 obj <<
-/Names [(paragraph.10.8.3.18) 4844 0 R (paragraph.10.8.3.19) 4852 0 R (paragraph.10.8.3.2) 4780 0 R (paragraph.10.8.3.20) 4855 0 R (paragraph.10.8.3.21) 4858 0 R (paragraph.10.8.3.22) 4861 0 R]
-/Limits [(paragraph.10.8.3.18) (paragraph.10.8.3.22)]
->> endobj
-20797 0 obj <<
-/Names [(paragraph.10.8.3.23) 4871 0 R (paragraph.10.8.3.24) 4874 0 R (paragraph.10.8.3.25) 4877 0 R (paragraph.10.8.3.26) 4888 0 R (paragraph.10.8.3.27) 4891 0 R (paragraph.10.8.3.28) 4894 0 R]
-/Limits [(paragraph.10.8.3.23) (paragraph.10.8.3.28)]
->> endobj
-20798 0 obj <<
-/Names [(paragraph.10.8.3.29) 4904 0 R (paragraph.10.8.3.3) 4782 0 R (paragraph.10.8.3.30) 4906 0 R (paragraph.10.8.3.31) 4908 0 R (paragraph.10.8.3.32) 4910 0 R (paragraph.10.8.3.33) 4912 0 R]
-/Limits [(paragraph.10.8.3.29) (paragraph.10.8.3.33)]
->> endobj
-20799 0 obj <<
-/Names [(paragraph.10.8.3.34) 4914 0 R (paragraph.10.8.3.35) 4924 0 R (paragraph.10.8.3.36) 4927 0 R (paragraph.10.8.3.37) 4939 0 R (paragraph.10.8.3.38) 4942 0 R (paragraph.10.8.3.39) 4945 0 R]
-/Limits [(paragraph.10.8.3.34) (paragraph.10.8.3.39)]
->> endobj
-20800 0 obj <<
-/Names [(paragraph.10.8.3.4) 4784 0 R (paragraph.10.8.3.40) 4955 0 R (paragraph.10.8.3.41) 4958 0 R (paragraph.10.8.3.42) 4972 0 R (paragraph.10.8.3.43) 4975 0 R (paragraph.10.8.3.44) 4977 0 R]
-/Limits [(paragraph.10.8.3.4) (paragraph.10.8.3.44)]
->> endobj
-20801 0 obj <<
-/Names [(paragraph.10.8.3.45) 4987 0 R (paragraph.10.8.3.46) 4989 0 R (paragraph.10.8.3.47) 4991 0 R (paragraph.10.8.3.48) 5004 0 R (paragraph.10.8.3.49) 5007 0 R (paragraph.10.8.3.5) 4786 0 R]
-/Limits [(paragraph.10.8.3.45) (paragraph.10.8.3.5)]
->> endobj
-20802 0 obj <<
-/Names [(paragraph.10.8.3.50) 5010 0 R (paragraph.10.8.3.51) 5019 0 R (paragraph.10.8.3.52) 5021 0 R (paragraph.10.8.3.53) 5023 0 R (paragraph.10.8.3.54) 5036 0 R (paragraph.10.8.3.55) 5039 0 R]
-/Limits [(paragraph.10.8.3.50) (paragraph.10.8.3.55)]
->> endobj
-20803 0 obj <<
-/Names [(paragraph.10.8.3.56) 5041 0 R (paragraph.10.8.3.57) 5054 0 R (paragraph.10.8.3.58) 5057 0 R (paragraph.10.8.3.59) 5061 0 R (paragraph.10.8.3.6) 4793 0 R (paragraph.10.8.3.60) 5068 0 R]
-/Limits [(paragraph.10.8.3.56) (paragraph.10.8.3.60)]
->> endobj
-20804 0 obj <<
-/Names [(paragraph.10.8.3.61) 5070 0 R (paragraph.10.8.3.62) 5071 0 R (paragraph.10.8.3.63) 5077 0 R (paragraph.10.8.3.7) 4795 0 R (paragraph.10.8.3.8) 4798 0 R (paragraph.10.8.3.9) 4806 0 R]
-/Limits [(paragraph.10.8.3.61) (paragraph.10.8.3.9)]
->> endobj
-20805 0 obj <<
-/Names [(paragraph.10.8.4.1) 5079 0 R (paragraph.10.8.4.10) 5093 0 R (paragraph.10.8.4.11) 5094 0 R (paragraph.10.8.4.12) 5100 0 R (paragraph.10.8.4.13) 5101 0 R (paragraph.10.8.4.14) 5102 0 R]
-/Limits [(paragraph.10.8.4.1) (paragraph.10.8.4.14)]
->> endobj
-20806 0 obj <<
-/Names [(paragraph.10.8.4.15) 5103 0 R (paragraph.10.8.4.16) 5104 0 R (paragraph.10.8.4.17) 5105 0 R (paragraph.10.8.4.18) 5106 0 R (paragraph.10.8.4.19) 5107 0 R (paragraph.10.8.4.2) 5080 0 R]
-/Limits [(paragraph.10.8.4.15) (paragraph.10.8.4.2)]
->> endobj
-20807 0 obj <<
-/Names [(paragraph.10.8.4.20) 5108 0 R (paragraph.10.8.4.21) 5126 0 R (paragraph.10.8.4.22) 5127 0 R (paragraph.10.8.4.23) 5128 0 R (paragraph.10.8.4.24) 5129 0 R (paragraph.10.8.4.3) 5081 0 R]
-/Limits [(paragraph.10.8.4.20) (paragraph.10.8.4.3)]
->> endobj
-20808 0 obj <<
-/Names [(paragraph.10.8.4.4) 5082 0 R (paragraph.10.8.4.5) 5083 0 R (paragraph.10.8.4.6) 5084 0 R (paragraph.10.8.4.7) 5085 0 R (paragraph.10.8.4.8) 5091 0 R (paragraph.10.8.4.9) 5092 0 R]
-/Limits [(paragraph.10.8.4.4) (paragraph.10.8.4.9)]
->> endobj
-20809 0 obj <<
-/Names [(paragraph.10.80.2.1) 15990 0 R (paragraph.10.80.2.2) 15991 0 R (paragraph.10.80.2.3) 15992 0 R (paragraph.10.80.2.4) 15994 0 R (paragraph.10.80.2.5) 15995 0 R (paragraph.10.80.2.6) 15996 0 R]
-/Limits [(paragraph.10.80.2.1) (paragraph.10.80.2.6)]
->> endobj
-20810 0 obj <<
-/Names [(paragraph.10.80.2.7) 15997 0 R (paragraph.10.80.2.8) 15998 0 R (paragraph.10.81.2.1) 16068 0 R (paragraph.10.81.2.2) 16069 0 R (paragraph.10.81.2.3) 16070 0 R (paragraph.10.81.2.4) 16071 0 R]
-/Limits [(paragraph.10.80.2.7) (paragraph.10.81.2.4)]
->> endobj
-20811 0 obj <<
-/Names [(paragraph.10.81.2.5) 16072 0 R (paragraph.10.81.2.6) 16073 0 R (paragraph.10.81.2.7) 16074 0 R (paragraph.10.81.2.8) 16075 0 R (paragraph.10.82.2.1) 16603 0 R (paragraph.10.82.2.2) 16605 0 R]
-/Limits [(paragraph.10.81.2.5) (paragraph.10.82.2.2)]
->> endobj
-20812 0 obj <<
-/Names [(paragraph.10.82.2.3) 16606 0 R (paragraph.10.82.2.4) 16609 0 R (paragraph.10.82.2.5) 16617 0 R (paragraph.10.82.2.6) 16620 0 R (paragraph.10.82.2.7) 16623 0 R (paragraph.10.82.3.1) 16626 0 R]
-/Limits [(paragraph.10.82.2.3) (paragraph.10.82.3.1)]
->> endobj
-20813 0 obj <<
-/Names [(paragraph.10.82.3.10) 16656 0 R (paragraph.10.82.3.11) 16667 0 R (paragraph.10.82.3.12) 16670 0 R (paragraph.10.82.3.13) 16678 0 R (paragraph.10.82.3.14) 16680 0 R (paragraph.10.82.3.15) 16682 0 R]
-/Limits [(paragraph.10.82.3.10) (paragraph.10.82.3.15)]
->> endobj
-20814 0 obj <<
-/Names [(paragraph.10.82.3.16) 16684 0 R (paragraph.10.82.3.17) 16692 0 R (paragraph.10.82.3.18) 16694 0 R (paragraph.10.82.3.19) 16696 0 R (paragraph.10.82.3.2) 16633 0 R (paragraph.10.82.3.20) 16699 0 R]
-/Limits [(paragraph.10.82.3.16) (paragraph.10.82.3.20)]
->> endobj
-20815 0 obj <<
-/Names [(paragraph.10.82.3.21) 16707 0 R (paragraph.10.82.3.22) 16710 0 R (paragraph.10.82.3.23) 16713 0 R (paragraph.10.82.3.24) 16721 0 R (paragraph.10.82.3.25) 16724 0 R (paragraph.10.82.3.26) 16726 0 R]
-/Limits [(paragraph.10.82.3.21) (paragraph.10.82.3.26)]
->> endobj
-20816 0 obj <<
-/Names [(paragraph.10.82.3.27) 16728 0 R (paragraph.10.82.3.28) 16731 0 R (paragraph.10.82.3.29) 16739 0 R (paragraph.10.82.3.3) 16635 0 R (paragraph.10.82.3.30) 16742 0 R (paragraph.10.82.3.31) 16754 0 R]
-/Limits [(paragraph.10.82.3.27) (paragraph.10.82.3.31)]
->> endobj
-20817 0 obj <<
-/Names [(paragraph.10.82.3.32) 16756 0 R (paragraph.10.82.3.33) 16759 0 R (paragraph.10.82.3.34) 16762 0 R (paragraph.10.82.3.35) 16764 0 R (paragraph.10.82.3.36) 16775 0 R (paragraph.10.82.3.37) 16777 0 R]
-/Limits [(paragraph.10.82.3.32) (paragraph.10.82.3.37)]
->> endobj
-20818 0 obj <<
-/Names [(paragraph.10.82.3.38) 16779 0 R (paragraph.10.82.3.39) 16782 0 R (paragraph.10.82.3.4) 16637 0 R (paragraph.10.82.3.40) 16794 0 R (paragraph.10.82.3.41) 16797 0 R (paragraph.10.82.3.42) 16801 0 R]
-/Limits [(paragraph.10.82.3.38) (paragraph.10.82.3.42)]
->> endobj
-20819 0 obj <<
-/Names [(paragraph.10.82.3.43) 16814 0 R (paragraph.10.82.3.44) 16817 0 R (paragraph.10.82.3.45) 16829 0 R (paragraph.10.82.3.46) 16832 0 R (paragraph.10.82.3.47) 16835 0 R (paragraph.10.82.3.48) 16845 0 R]
-/Limits [(paragraph.10.82.3.43) (paragraph.10.82.3.48)]
->> endobj
-20820 0 obj <<
-/Names [(paragraph.10.82.3.49) 16848 0 R (paragraph.10.82.3.5) 16639 0 R (paragraph.10.82.3.50) 16850 0 R (paragraph.10.82.3.51) 16866 0 R (paragraph.10.82.3.52) 16869 0 R (paragraph.10.82.3.53) 16873 0 R]
-/Limits [(paragraph.10.82.3.49) (paragraph.10.82.3.53)]
->> endobj
-20821 0 obj <<
-/Names [(paragraph.10.82.3.54) 16889 0 R (paragraph.10.82.3.55) 16892 0 R (paragraph.10.82.3.56) 16896 0 R (paragraph.10.82.3.57) 16906 0 R (paragraph.10.82.3.58) 16909 0 R (paragraph.10.82.3.59) 16923 0 R]
-/Limits [(paragraph.10.82.3.54) (paragraph.10.82.3.59)]
->> endobj
-20822 0 obj <<
-/Names [(paragraph.10.82.3.6) 16641 0 R (paragraph.10.82.3.60) 16925 0 R (paragraph.10.82.3.61) 16928 0 R (paragraph.10.82.3.62) 16930 0 R (paragraph.10.82.3.63) 16945 0 R (paragraph.10.82.3.64) 16948 0 R]
-/Limits [(paragraph.10.82.3.6) (paragraph.10.82.3.64)]
->> endobj
-20823 0 obj <<
-/Names [(paragraph.10.82.3.65) 16952 0 R (paragraph.10.82.3.66) 16960 0 R (paragraph.10.82.3.67) 16961 0 R (paragraph.10.82.3.68) 16963 0 R (paragraph.10.82.3.69) 16965 0 R (paragraph.10.82.3.7) 16643 0 R]
-/Limits [(paragraph.10.82.3.65) (paragraph.10.82.3.7)]
->> endobj
-20824 0 obj <<
-/Names [(paragraph.10.82.3.70) 16973 0 R (paragraph.10.82.3.8) 16650 0 R (paragraph.10.82.3.9) 16653 0 R (paragraph.10.82.4.1) 16976 0 R (paragraph.10.82.4.2) 16977 0 R (paragraph.10.82.4.3) 16978 0 R]
-/Limits [(paragraph.10.82.3.70) (paragraph.10.82.4.3)]
->> endobj
-20825 0 obj <<
-/Names [(paragraph.10.82.4.4) 17001 0 R (paragraph.10.82.4.5) 17002 0 R (paragraph.10.82.4.6) 17003 0 R (paragraph.10.83.2.1) 17193 0 R (paragraph.10.83.2.2) 17194 0 R (paragraph.10.83.3.1) 17197 0 R]
-/Limits [(paragraph.10.82.4.4) (paragraph.10.83.3.1)]
->> endobj
-20826 0 obj <<
-/Names [(paragraph.10.83.3.2) 17198 0 R (paragraph.10.83.3.3) 17199 0 R (paragraph.10.83.3.4) 17201 0 R (paragraph.10.83.3.5) 17202 0 R (paragraph.10.83.3.6) 17208 0 R (paragraph.10.83.4.1) 17210 0 R]
-/Limits [(paragraph.10.83.3.2) (paragraph.10.83.4.1)]
->> endobj
-20827 0 obj <<
-/Names [(paragraph.10.83.4.2) 17211 0 R (paragraph.10.83.4.3) 17212 0 R (paragraph.10.83.4.4) 17213 0 R (paragraph.10.83.4.5) 17214 0 R (paragraph.10.83.4.6) 17215 0 R (paragraph.10.83.4.7) 17216 0 R]
-/Limits [(paragraph.10.83.4.2) (paragraph.10.83.4.7)]
->> endobj
-20828 0 obj <<
-/Names [(paragraph.10.83.4.8) 17217 0 R (paragraph.10.85.2.1) 17244 0 R (paragraph.10.86.2.1) 17253 0 R (paragraph.10.87.2.1) 17337 0 R (paragraph.10.87.3.1) 17348 0 R (paragraph.10.87.3.2) 17349 0 R]
-/Limits [(paragraph.10.83.4.8) (paragraph.10.87.3.2)]
->> endobj
-20829 0 obj <<
-/Names [(paragraph.10.9.2.1) 5222 0 R (paragraph.10.9.2.10) 5256 0 R (paragraph.10.9.2.11) 5263 0 R (paragraph.10.9.2.12) 5265 0 R (paragraph.10.9.2.13) 5267 0 R (paragraph.10.9.2.2) 5225 0 R]
-/Limits [(paragraph.10.9.2.1) (paragraph.10.9.2.2)]
->> endobj
-20830 0 obj <<
-/Names [(paragraph.10.9.2.3) 5233 0 R (paragraph.10.9.2.4) 5236 0 R (paragraph.10.9.2.5) 5239 0 R (paragraph.10.9.2.6) 5247 0 R (paragraph.10.9.2.7) 5249 0 R (paragraph.10.9.2.8) 5251 0 R]
-/Limits [(paragraph.10.9.2.3) (paragraph.10.9.2.8)]
->> endobj
-20831 0 obj <<
-/Names [(paragraph.10.9.2.9) 5253 0 R (paragraph.10.9.3.1) 5269 0 R (paragraph.10.93.2.1) 17473 0 R (paragraph.10.93.3.1) 17476 0 R (paragraph.10.93.4.1) 17478 0 R (paragraph.10.93.4.2) 17479 0 R]
-/Limits [(paragraph.10.9.2.9) (paragraph.10.93.4.2)]
->> endobj
-20832 0 obj <<
-/Names [(paragraph.10.93.4.3) 17480 0 R (paragraph.10.93.4.4) 17481 0 R (paragraph.10.94.2.1) 17566 0 R (paragraph.10.94.2.2) 17568 0 R (paragraph.10.94.3.1) 17571 0 R (paragraph.10.94.3.2) 17602 0 R]
-/Limits [(paragraph.10.93.4.3) (paragraph.10.94.3.2)]
->> endobj
-20833 0 obj <<
-/Names [(paragraph.10.95.2.1) 17630 0 R (paragraph.10.95.3.1) 17633 0 R (paragraph.8.1.2.1) 2396 0 R (paragraph.8.1.2.2) 2397 0 R (paragraph.8.1.2.3) 2398 0 R (paragraph.8.1.2.4) 2399 0 R]
-/Limits [(paragraph.10.95.2.1) (paragraph.8.1.2.4)]
->> endobj
-20834 0 obj <<
-/Names [(paragraph.8.1.3.1) 2401 0 R (paragraph.8.1.3.2) 2402 0 R (paragraph.8.1.3.3) 2403 0 R (paragraph.8.1.4.1) 2410 0 R (paragraph.8.1.4.10) 2432 0 R (paragraph.8.1.4.11) 2441 0 R]
-/Limits [(paragraph.8.1.3.1) (paragraph.8.1.4.11)]
->> endobj
-20835 0 obj <<
-/Names [(paragraph.8.1.4.12) 2442 0 R (paragraph.8.1.4.13) 2443 0 R (paragraph.8.1.4.2) 2411 0 R (paragraph.8.1.4.3) 2418 0 R (paragraph.8.1.4.4) 2419 0 R (paragraph.8.1.4.5) 2420 0 R]
-/Limits [(paragraph.8.1.4.12) (paragraph.8.1.4.5)]
->> endobj
-20836 0 obj <<
-/Names [(paragraph.8.1.4.6) 2421 0 R (paragraph.8.1.4.7) 2429 0 R (paragraph.8.1.4.8) 2430 0 R (paragraph.8.1.4.9) 2431 0 R (paragraph.8.1.5.1) 2445 0 R (paragraph.8.1.5.10) 2461 0 R]
-/Limits [(paragraph.8.1.4.6) (paragraph.8.1.5.10)]
->> endobj
-20837 0 obj <<
-/Names [(paragraph.8.1.5.11) 2462 0 R (paragraph.8.1.5.12) 2463 0 R (paragraph.8.1.5.13) 2464 0 R (paragraph.8.1.5.14) 2465 0 R (paragraph.8.1.5.15) 2466 0 R (paragraph.8.1.5.16) 2467 0 R]
-/Limits [(paragraph.8.1.5.11) (paragraph.8.1.5.16)]
->> endobj
-20838 0 obj <<
-/Names [(paragraph.8.1.5.17) 2468 0 R (paragraph.8.1.5.18) 2469 0 R (paragraph.8.1.5.19) 2470 0 R (paragraph.8.1.5.2) 2447 0 R (paragraph.8.1.5.20) 2471 0 R (paragraph.8.1.5.21) 2482 0 R]
-/Limits [(paragraph.8.1.5.17) (paragraph.8.1.5.21)]
->> endobj
-20839 0 obj <<
-/Names [(paragraph.8.1.5.22) 2491 0 R (paragraph.8.1.5.23) 2494 0 R (paragraph.8.1.5.24) 2504 0 R (paragraph.8.1.5.25) 2514 0 R (paragraph.8.1.5.26) 2518 0 R (paragraph.8.1.5.27) 2527 0 R]
-/Limits [(paragraph.8.1.5.22) (paragraph.8.1.5.27)]
->> endobj
-20840 0 obj <<
-/Names [(paragraph.8.1.5.3) 2454 0 R (paragraph.8.1.5.4) 2455 0 R (paragraph.8.1.5.5) 2456 0 R (paragraph.8.1.5.6) 2457 0 R (paragraph.8.1.5.7) 2458 0 R (paragraph.8.1.5.8) 2459 0 R]
-/Limits [(paragraph.8.1.5.3) (paragraph.8.1.5.8)]
->> endobj
-20841 0 obj <<
-/Names [(paragraph.8.1.5.9) 2460 0 R (paragraph.8.1.6.1) 2537 0 R (paragraph.9.1.2.1) 2953 0 R (paragraph.9.1.2.2) 2954 0 R (paragraph.9.1.2.3) 2955 0 R (paragraph.9.1.3.1) 2957 0 R]
-/Limits [(paragraph.8.1.5.9) (paragraph.9.1.3.1)]
->> endobj
-20842 0 obj <<
-/Names [(paragraph.9.1.3.2) 2958 0 R (paragraph.9.1.4.1) 2968 0 R (paragraph.9.1.4.2) 2969 0 R (paragraph.9.1.4.3) 2970 0 R (paragraph.9.1.4.4) 2972 0 R (paragraph.9.1.4.5) 2974 0 R]
-/Limits [(paragraph.9.1.3.2) (paragraph.9.1.4.5)]
->> endobj
-20843 0 obj <<
-/Names [(paragraph.9.2.2.1) 2985 0 R (section*.1) 1444 0 R (section*.10) 1474 0 R (section*.100) 7103 0 R (section*.101) 7106 0 R (section*.102) 7108 0 R]
-/Limits [(paragraph.9.2.2.1) (section*.102)]
->> endobj
-20844 0 obj <<
-/Names [(section*.103) 7181 0 R (section*.104) 7182 0 R (section*.105) 7258 0 R (section*.106) 7344 0 R (section*.107) 7345 0 R (section*.108) 7652 0 R]
-/Limits [(section*.103) (section*.108)]
->> endobj
-20845 0 obj <<
-/Names [(section*.109) 7717 0 R (section*.11) 1480 0 R (section*.110) 7722 0 R (section*.111) 7764 0 R (section*.112) 7787 0 R (section*.113) 7791 0 R]
-/Limits [(section*.109) (section*.113)]
->> endobj
-20846 0 obj <<
-/Names [(section*.114) 7825 0 R (section*.115) 7881 0 R (section*.116) 7884 0 R (section*.117) 7906 0 R (section*.118) 7950 0 R (section*.119) 7956 0 R]
-/Limits [(section*.114) (section*.119)]
->> endobj
-20847 0 obj <<
-/Names [(section*.12) 1486 0 R (section*.120) 7981 0 R (section*.121) 7984 0 R (section*.122) 7986 0 R (section*.123) 8035 0 R (section*.124) 8066 0 R]
-/Limits [(section*.12) (section*.124)]
->> endobj
-20848 0 obj <<
-/Names [(section*.125) 8070 0 R (section*.126) 8073 0 R (section*.127) 8075 0 R (section*.128) 8106 0 R (section*.129) 8123 0 R (section*.13) 1487 0 R]
-/Limits [(section*.125) (section*.13)]
->> endobj
-20849 0 obj <<
-/Names [(section*.130) 8166 0 R (section*.131) 8169 0 R (section*.132) 8219 0 R (section*.133) 8221 0 R (section*.134) 8222 0 R (section*.135) 8240 0 R]
-/Limits [(section*.130) (section*.135)]
->> endobj
-20850 0 obj <<
-/Names [(section*.136) 8244 0 R (section*.137) 8247 0 R (section*.138) 8263 0 R (section*.139) 8298 0 R (section*.14) 1488 0 R (section*.140) 8301 0 R]
-/Limits [(section*.136) (section*.140)]
->> endobj
-20851 0 obj <<
-/Names [(section*.141) 8302 0 R (section*.142) 8304 0 R (section*.143) 8383 0 R (section*.144) 8400 0 R (section*.145) 8433 0 R (section*.146) 8434 0 R]
-/Limits [(section*.141) (section*.146)]
->> endobj
-20852 0 obj <<
-/Names [(section*.147) 8587 0 R (section*.148) 8684 0 R (section*.149) 8685 0 R (section*.15) 1495 0 R (section*.150) 9043 0 R (section*.151) 9107 0 R]
-/Limits [(section*.147) (section*.151)]
->> endobj
-20853 0 obj <<
-/Names [(section*.152) 9131 0 R (section*.153) 9178 0 R (section*.154) 9228 0 R (section*.155) 9358 0 R (section*.156) 9360 0 R (section*.157) 9745 0 R]
-/Limits [(section*.152) (section*.157)]
->> endobj
-20854 0 obj <<
-/Names [(section*.158) 9749 0 R (section*.159) 10182 0 R (section*.16) 1496 0 R (section*.160) 10183 0 R (section*.161) 10236 0 R (section*.162) 10237 0 R]
-/Limits [(section*.158) (section*.162)]
->> endobj
-20855 0 obj <<
-/Names [(section*.163) 10382 0 R (section*.164) 10391 0 R (section*.165) 10392 0 R (section*.166) 10682 0 R (section*.167) 10683 0 R (section*.168) 10757 0 R]
-/Limits [(section*.163) (section*.168)]
->> endobj
-20856 0 obj <<
-/Names [(section*.169) 10762 0 R (section*.17) 1497 0 R (section*.170) 10814 0 R (section*.171) 10815 0 R (section*.172) 10849 0 R (section*.173) 10870 0 R]
-/Limits [(section*.169) (section*.173)]
->> endobj
-20857 0 obj <<
-/Names [(section*.174) 10874 0 R (section*.175) 10893 0 R (section*.176) 10922 0 R (section*.177) 10923 0 R (section*.178) 10951 0 R (section*.179) 10967 0 R]
-/Limits [(section*.174) (section*.179)]
->> endobj
-20858 0 obj <<
-/Names [(section*.18) 1503 0 R (section*.180) 11019 0 R (section*.181) 11112 0 R (section*.182) 11113 0 R (section*.183) 11279 0 R (section*.184) 11379 0 R]
-/Limits [(section*.18) (section*.184)]
->> endobj
-20859 0 obj <<
-/Names [(section*.185) 11733 0 R (section*.186) 11799 0 R (section*.187) 11801 0 R (section*.188) 12025 0 R (section*.189) 12155 0 R (section*.19) 1504 0 R]
-/Limits [(section*.185) (section*.19)]
->> endobj
-20860 0 obj <<
-/Names [(section*.190) 12156 0 R (section*.191) 12221 0 R (section*.192) 12296 0 R (section*.193) 12318 0 R (section*.194) 12433 0 R (section*.195) 12437 0 R]
-/Limits [(section*.190) (section*.195)]
->> endobj
-20861 0 obj <<
-/Names [(section*.196) 12461 0 R (section*.197) 12464 0 R (section*.198) 12466 0 R (section*.199) 12500 0 R (section*.2) 1451 0 R (section*.20) 1505 0 R]
-/Limits [(section*.196) (section*.20)]
->> endobj
-20862 0 obj <<
-/Names [(section*.200) 12595 0 R (section*.201) 12659 0 R (section*.202) 12663 0 R (section*.203) 12667 0 R (section*.204) 12725 0 R (section*.205) 13125 0 R]
-/Limits [(section*.200) (section*.205)]
->> endobj
-20863 0 obj <<
-/Names [(section*.206) 13129 0 R (section*.207) 13248 0 R (section*.208) 13690 0 R (section*.209) 13694 0 R (section*.21) 1506 0 R (section*.210) 13697 0 R]
-/Limits [(section*.206) (section*.210)]
->> endobj
-20864 0 obj <<
-/Names [(section*.211) 13699 0 R (section*.212) 13766 0 R (section*.213) 14074 0 R (section*.214) 14076 0 R (section*.215) 14118 0 R (section*.216) 14122 0 R]
-/Limits [(section*.211) (section*.216)]
->> endobj
-20865 0 obj <<
-/Names [(section*.217) 14126 0 R (section*.218) 14148 0 R (section*.219) 14482 0 R (section*.22) 1545 0 R (section*.220) 14490 0 R (section*.221) 14529 0 R]
-/Limits [(section*.217) (section*.221)]
->> endobj
-20866 0 obj <<
-/Names [(section*.222) 14532 0 R (section*.223) 14542 0 R (section*.224) 14571 0 R (section*.225) 14628 0 R (section*.226) 14634 0 R (section*.227) 14636 0 R]
-/Limits [(section*.222) (section*.227)]
->> endobj
-20867 0 obj <<
-/Names [(section*.228) 14639 0 R (section*.229) 14756 0 R (section*.23) 1989 0 R (section*.230) 14758 0 R (section*.231) 14909 0 R (section*.232) 14910 0 R]
-/Limits [(section*.228) (section*.232)]
->> endobj
-20868 0 obj <<
-/Names [(section*.233) 14965 0 R (section*.234) 14974 0 R (section*.235) 15023 0 R (section*.236) 15024 0 R (section*.237) 15026 0 R (section*.238) 15091 0 R]
-/Limits [(section*.233) (section*.238)]
->> endobj
-20869 0 obj <<
-/Names [(section*.239) 15092 0 R (section*.24) 1990 0 R (section*.240) 15125 0 R (section*.241) 15128 0 R (section*.242) 15133 0 R (section*.243) 15242 0 R]
-/Limits [(section*.239) (section*.243)]
->> endobj
-20870 0 obj <<
-/Names [(section*.244) 15543 0 R (section*.245) 15545 0 R (section*.246) 15596 0 R (section*.247) 15598 0 R (section*.248) 15950 0 R (section*.249) 15956 0 R]
-/Limits [(section*.244) (section*.249)]
->> endobj
-20871 0 obj <<
-/Names [(section*.25) 2111 0 R (section*.250) 15962 0 R (section*.251) 16044 0 R (section*.252) 16050 0 R (section*.253) 16053 0 R (section*.254) 16111 0 R]
-/Limits [(section*.25) (section*.254)]
->> endobj
-20872 0 obj <<
-/Names [(section*.255) 16113 0 R (section*.256) 16509 0 R (section*.257) 16515 0 R (section*.258) 16568 0 R (section*.259) 16569 0 R (section*.26) 2113 0 R]
-/Limits [(section*.255) (section*.26)]
->> endobj
-20873 0 obj <<
-/Names [(section*.260) 17004 0 R (section*.261) 17008 0 R (section*.262) 17115 0 R (section*.263) 17118 0 R (section*.264) 17156 0 R (section*.265) 17159 0 R]
-/Limits [(section*.260) (section*.265)]
->> endobj
-20874 0 obj <<
-/Names [(section*.266) 17161 0 R (section*.267) 17228 0 R (section*.268) 17232 0 R (section*.269) 17246 0 R (section*.27) 2114 0 R (section*.270) 17250 0 R]
-/Limits [(section*.266) (section*.270)]
->> endobj
-20875 0 obj <<
-/Names [(section*.271) 17277 0 R (section*.272) 17315 0 R (section*.273) 17319 0 R (section*.274) 17322 0 R (section*.275) 17324 0 R (section*.276) 17351 0 R]
-/Limits [(section*.271) (section*.276)]
->> endobj
-20876 0 obj <<
-/Names [(section*.277) 17353 0 R (section*.278) 17375 0 R (section*.279) 17398 0 R (section*.28) 2316 0 R (section*.280) 17402 0 R (section*.281) 17403 0 R]
-/Limits [(section*.277) (section*.281)]
->> endobj
-20877 0 obj <<
-/Names [(section*.282) 17442 0 R (section*.283) 17444 0 R (section*.284) 17450 0 R (section*.285) 17453 0 R (section*.286) 17515 0 R (section*.287) 17547 0 R]
-/Limits [(section*.282) (section*.287)]
->> endobj
-20878 0 obj <<
-/Names [(section*.288) 17551 0 R (section*.289) 17554 0 R (section*.29) 2317 0 R (section*.290) 17556 0 R (section*.291) 17603 0 R (section*.292) 17615 0 R]
-/Limits [(section*.288) (section*.292)]
->> endobj
-20879 0 obj <<
-/Names [(section*.293) 17627 0 R (section*.294) 17634 0 R (section*.295) 17637 0 R (section*.296) 17719 0 R (section*.3) 1452 0 R (section*.30) 2318 0 R]
-/Limits [(section*.293) (section*.30)]
->> endobj
-20880 0 obj <<
-/Names [(section*.31) 2319 0 R (section*.32) 2560 0 R (section*.33) 2561 0 R (section*.34) 2658 0 R (section*.35) 2750 0 R (section*.36) 2814 0 R]
-/Limits [(section*.31) (section*.36)]
->> endobj
-20881 0 obj <<
-/Names [(section*.37) 2938 0 R (section*.38) 2975 0 R (section*.39) 2998 0 R (section*.4) 1453 0 R (section*.40) 3027 0 R (section*.41) 3065 0 R]
-/Limits [(section*.37) (section*.41)]
->> endobj
-20882 0 obj <<
-/Names [(section*.42) 3066 0 R (section*.43) 3098 0 R (section*.44) 3101 0 R (section*.45) 3502 0 R (section*.46) 3573 0 R (section*.47) 3695 0 R]
-/Limits [(section*.42) (section*.47)]
->> endobj
-20883 0 obj <<
-/Names [(section*.48) 4132 0 R (section*.49) 4133 0 R (section*.5) 1459 0 R (section*.50) 4156 0 R (section*.51) 4161 0 R (section*.52) 4162 0 R]
-/Limits [(section*.48) (section*.52)]
->> endobj
-20884 0 obj <<
-/Names [(section*.53) 4225 0 R (section*.54) 4620 0 R (section*.55) 4624 0 R (section*.56) 4735 0 R (section*.57) 5130 0 R (section*.58) 5219 0 R]
-/Limits [(section*.53) (section*.58)]
->> endobj
-20885 0 obj <<
-/Names [(section*.59) 5297 0 R (section*.6) 1460 0 R (section*.60) 5301 0 R (section*.61) 5331 0 R (section*.62) 5334 0 R (section*.63) 5336 0 R]
-/Limits [(section*.59) (section*.63)]
->> endobj
-20886 0 obj <<
-/Names [(section*.64) 5379 0 R (section*.65) 5380 0 R (section*.66) 5592 0 R (section*.67) 5806 0 R (section*.68) 5923 0 R (section*.69) 5926 0 R]
-/Limits [(section*.64) (section*.69)]
->> endobj
-20887 0 obj <<
-/Names [(section*.7) 1461 0 R (section*.70) 5943 0 R (section*.71) 5946 0 R (section*.72) 5991 0 R (section*.73) 6083 0 R (section*.74) 6090 0 R]
-/Limits [(section*.7) (section*.74)]
->> endobj
-20888 0 obj <<
-/Names [(section*.75) 6091 0 R (section*.76) 6111 0 R (section*.77) 6167 0 R (section*.78) 6168 0 R (section*.79) 6257 0 R (section*.8) 1467 0 R]
-/Limits [(section*.75) (section*.8)]
->> endobj
-20889 0 obj <<
-/Names [(section*.80) 6342 0 R (section*.81) 6343 0 R (section*.82) 6475 0 R (section*.83) 6476 0 R (section*.84) 6597 0 R (section*.85) 6602 0 R]
-/Limits [(section*.80) (section*.85)]
->> endobj
-20890 0 obj <<
-/Names [(section*.86) 6604 0 R (section*.87) 6660 0 R (section*.88) 6664 0 R (section*.89) 6708 0 R (section*.9) 1468 0 R (section*.90) 6779 0 R]
-/Limits [(section*.86) (section*.90)]
->> endobj
-20891 0 obj <<
-/Names [(section*.91) 6791 0 R (section*.92) 6832 0 R (section*.93) 6834 0 R (section*.94) 6884 0 R (section*.95) 6928 0 R (section*.96) 6994 0 R]
-/Limits [(section*.91) (section*.96)]
->> endobj
-20892 0 obj <<
-/Names [(section*.97) 7019 0 R (section*.98) 7060 0 R (section*.99) 7098 0 R (section.1) 2 0 R (section.10) 134 0 R (section.2) 70 0 R]
-/Limits [(section*.97) (section.2)]
->> endobj
-20893 0 obj <<
-/Names [(section.3) 74 0 R (section.4) 78 0 R (section.5) 86 0 R (section.6) 94 0 R (section.7) 102 0 R (section.8) 110 0 R]
-/Limits [(section.3) (section.8)]
->> endobj
-20894 0 obj <<
-/Names [(section.9) 118 0 R (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) 1724 0 R (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare_a98c515b16e12424b273eaff073b31f3b) 5924 0 R (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) 1726 0 R (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare_a92edb0b8b1e2097c5d20795e576517cf) 5944 0 R (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) 1725 0 R]
-/Limits [(section.9) (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare)]
->> endobj
-20895 0 obj <<
-/Names [(structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare_abf5e694ab674c48a452893f021986318) 5927 0 R (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) 1902 0 R (structParma__Polyhedra__Library_1_1Recycle__Input) 1955 0 R (structParma__Polyhedra__Library_1_1Variable_1_1Compare) 1727 0 R (structParma__Polyhedra__Library_1_1Variable_1_1Compare_af6c069432956f215967c61be24a40939) 5947 0 R (subsection.1.1) 6 0 R]
-/Limits [(structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare_abf5e694ab674c48a452893f021986318) (subsection.1.1)]
->> endobj
-20896 0 obj <<
-/Names [(subsection.1.10) 42 0 R (subsection.1.11) 46 0 R (subsection.1.12) 50 0 R (subsection.1.13) 54 0 R (subsection.1.14) 58 0 R (subsection.1.15) 62 0 R]
-/Limits [(subsection.1.10) (subsection.1.15)]
->> endobj
-20897 0 obj <<
-/Names [(subsection.1.16) 66 0 R (subsection.1.2) 10 0 R (subsection.1.3) 14 0 R (subsection.1.4) 18 0 R (subsection.1.5) 22 0 R (subsection.1.6) 26 0 R]
-/Limits [(subsection.1.16) (subsection.1.6)]
->> endobj
-20898 0 obj <<
-/Names [(subsection.1.7) 30 0 R (subsection.1.8) 34 0 R (subsection.1.9) 38 0 R (subsection.10.1) 138 0 R (subsection.10.10) 174 0 R (subsection.10.11) 178 0 R]
-/Limits [(subsection.1.7) (subsection.10.11)]
->> endobj
-20899 0 obj <<
-/Names [(subsection.10.12) 182 0 R (subsection.10.13) 186 0 R (subsection.10.14) 190 0 R (subsection.10.15) 194 0 R (subsection.10.16) 198 0 R (subsection.10.17) 202 0 R]
-/Limits [(subsection.10.12) (subsection.10.17)]
->> endobj
-20900 0 obj <<
-/Names [(subsection.10.18) 206 0 R (subsection.10.19) 210 0 R (subsection.10.2) 142 0 R (subsection.10.20) 214 0 R (subsection.10.21) 218 0 R (subsection.10.22) 222 0 R]
-/Limits [(subsection.10.18) (subsection.10.22)]
->> endobj
-20901 0 obj <<
-/Names [(subsection.10.23) 226 0 R (subsection.10.24) 230 0 R (subsection.10.25) 234 0 R (subsection.10.26) 238 0 R (subsection.10.27) 242 0 R (subsection.10.28) 246 0 R]
-/Limits [(subsection.10.23) (subsection.10.28)]
->> endobj
-20902 0 obj <<
-/Names [(subsection.10.29) 250 0 R (subsection.10.3) 146 0 R (subsection.10.30) 254 0 R (subsection.10.31) 258 0 R (subsection.10.32) 262 0 R (subsection.10.33) 266 0 R]
-/Limits [(subsection.10.29) (subsection.10.33)]
->> endobj
-20903 0 obj <<
-/Names [(subsection.10.34) 270 0 R (subsection.10.35) 274 0 R (subsection.10.36) 278 0 R (subsection.10.37) 282 0 R (subsection.10.38) 286 0 R (subsection.10.39) 290 0 R]
-/Limits [(subsection.10.34) (subsection.10.39)]
->> endobj
-20904 0 obj <<
-/Names [(subsection.10.4) 150 0 R (subsection.10.40) 294 0 R (subsection.10.41) 298 0 R (subsection.10.42) 302 0 R (subsection.10.43) 306 0 R (subsection.10.44) 310 0 R]
-/Limits [(subsection.10.4) (subsection.10.44)]
->> endobj
-20905 0 obj <<
-/Names [(subsection.10.45) 314 0 R (subsection.10.46) 318 0 R (subsection.10.47) 322 0 R (subsection.10.48) 326 0 R (subsection.10.49) 330 0 R (subsection.10.5) 154 0 R]
-/Limits [(subsection.10.45) (subsection.10.5)]
->> endobj
-20906 0 obj <<
-/Names [(subsection.10.50) 334 0 R (subsection.10.51) 338 0 R (subsection.10.52) 342 0 R (subsection.10.53) 346 0 R (subsection.10.54) 350 0 R (subsection.10.55) 354 0 R]
-/Limits [(subsection.10.50) (subsection.10.55)]
->> endobj
-20907 0 obj <<
-/Names [(subsection.10.56) 358 0 R (subsection.10.57) 362 0 R (subsection.10.58) 366 0 R (subsection.10.59) 370 0 R (subsection.10.6) 158 0 R (subsection.10.60) 374 0 R]
-/Limits [(subsection.10.56) (subsection.10.60)]
->> endobj
-20908 0 obj <<
-/Names [(subsection.10.61) 378 0 R (subsection.10.62) 382 0 R (subsection.10.63) 386 0 R (subsection.10.64) 390 0 R (subsection.10.65) 394 0 R (subsection.10.66) 398 0 R]
-/Limits [(subsection.10.61) (subsection.10.66)]
->> endobj
-20909 0 obj <<
-/Names [(subsection.10.67) 402 0 R (subsection.10.68) 406 0 R (subsection.10.69) 410 0 R (subsection.10.7) 162 0 R (subsection.10.70) 414 0 R (subsection.10.71) 418 0 R]
-/Limits [(subsection.10.67) (subsection.10.71)]
->> endobj
-20910 0 obj <<
-/Names [(subsection.10.72) 422 0 R (subsection.10.73) 426 0 R (subsection.10.74) 430 0 R (subsection.10.75) 434 0 R (subsection.10.76) 438 0 R (subsection.10.77) 442 0 R]
-/Limits [(subsection.10.72) (subsection.10.77)]
->> endobj
-20911 0 obj <<
-/Names [(subsection.10.78) 446 0 R (subsection.10.79) 450 0 R (subsection.10.8) 166 0 R (subsection.10.80) 454 0 R (subsection.10.81) 458 0 R (subsection.10.82) 462 0 R]
-/Limits [(subsection.10.78) (subsection.10.82)]
->> endobj
-20912 0 obj <<
-/Names [(subsection.10.83) 466 0 R (subsection.10.84) 470 0 R (subsection.10.85) 474 0 R (subsection.10.86) 478 0 R (subsection.10.87) 482 0 R (subsection.10.88) 486 0 R]
-/Limits [(subsection.10.83) (subsection.10.88)]
->> endobj
-20913 0 obj <<
-/Names [(subsection.10.89) 490 0 R (subsection.10.9) 170 0 R (subsection.10.90) 494 0 R (subsection.10.91) 498 0 R (subsection.10.92) 502 0 R (subsection.10.93) 506 0 R]
-/Limits [(subsection.10.89) (subsection.10.93)]
->> endobj
-20914 0 obj <<
-/Names [(subsection.10.94) 510 0 R (subsection.10.95) 514 0 R (subsection.10.96) 518 0 R (subsection.4.1) 82 0 R (subsection.5.1) 90 0 R (subsection.6.1) 98 0 R]
-/Limits [(subsection.10.94) (subsection.6.1)]
->> endobj
-20915 0 obj <<
-/Names [(subsection.7.1) 106 0 R (subsection.8.1) 114 0 R (subsection.9.1) 122 0 R (subsection.9.2) 126 0 R (subsection.9.3) 130 0 R (subsubsection.1.1.1) 762 0 R]
-/Limits [(subsection.7.1) (subsubsection.1.1.1)]
->> endobj
-20916 0 obj <<
-/Names [(subsubsection.1.1.2) 781 0 R (subsubsection.1.1.3) 806 0 R (subsubsection.1.10.1) 1102 0 R (subsubsection.1.10.2) 1104 0 R (subsubsection.1.10.3) 1106 0 R (subsubsection.1.10.4) 1114 0 R]
-/Limits [(subsubsection.1.1.2) (subsubsection.1.10.4)]
->> endobj
-20917 0 obj <<
-/Names [(subsubsection.1.10.5) 1116 0 R (subsubsection.1.10.6) 1126 0 R (subsubsection.1.10.7) 1128 0 R (subsubsection.1.10.8) 1130 0 R (subsubsection.1.10.9) 1132 0 R (subsubsection.1.11.1) 1144 0 R]
-/Limits [(subsubsection.1.10.5) (subsubsection.1.11.1)]
->> endobj
-20918 0 obj <<
-/Names [(subsubsection.1.12.1) 1160 0 R (subsubsection.1.12.2) 1163 0 R (subsubsection.1.12.3) 1166 0 R (subsubsection.1.13.1) 1170 0 R (subsubsection.1.13.2) 1188 0 R (subsubsection.1.13.3) 1191 0 R]
-/Limits [(subsubsection.1.12.1) (subsubsection.1.13.3)]
->> endobj
-20919 0 obj <<
-/Names [(subsubsection.1.13.4) 1194 0 R (subsubsection.1.13.5) 1198 0 R (subsubsection.1.14.1) 1225 0 R (subsubsection.1.14.2) 1250 0 R (subsubsection.1.15.1) 1259 0 R (subsubsection.1.15.2) 1261 0 R]
-/Limits [(subsubsection.1.13.4) (subsubsection.1.15.2)]
->> endobj
-20920 0 obj <<
-/Names [(subsubsection.1.15.3) 1263 0 R (subsubsection.1.15.4) 1270 0 R (subsubsection.1.3.1) 830 0 R (subsubsection.1.3.2) 832 0 R (subsubsection.1.4.1) 849 0 R (subsubsection.1.4.2) 865 0 R]
-/Limits [(subsubsection.1.15.3) (subsubsection.1.4.2)]
->> endobj
-20921 0 obj <<
-/Names [(subsubsection.1.4.3) 867 0 R (subsubsection.1.4.4) 875 0 R (subsubsection.1.5.1) 878 0 R (subsubsection.1.5.10) 912 0 R (subsubsection.1.5.2) 881 0 R (subsubsection.1.5.3) 888 0 R]
-/Limits [(subsubsection.1.4.3) (subsubsection.1.5.3)]
->> endobj
-20922 0 obj <<
-/Names [(subsubsection.1.5.4) 890 0 R (subsubsection.1.5.5) 892 0 R (subsubsection.1.5.6) 894 0 R (subsubsection.1.5.7) 900 0 R (subsubsection.1.5.8) 902 0 R (subsubsection.1.5.9) 910 0 R]
-/Limits [(subsubsection.1.5.4) (subsubsection.1.5.9)]
->> endobj
-20923 0 obj <<
-/Names [(subsubsection.1.6.1) 915 0 R (subsubsection.1.6.10) 956 0 R (subsubsection.1.6.11) 963 0 R (subsubsection.1.6.12) 965 0 R (subsubsection.1.6.13) 975 0 R (subsubsection.1.6.14) 977 0 R]
-/Limits [(subsubsection.1.6.1) (subsubsection.1.6.14)]
->> endobj
-20924 0 obj <<
-/Names [(subsubsection.1.6.15) 979 0 R (subsubsection.1.6.16) 981 0 R (subsubsection.1.6.17) 996 0 R (subsubsection.1.6.18) 998 0 R (subsubsection.1.6.19) 1015 0 R (subsubsection.1.6.2) 922 0 R]
-/Limits [(subsubsection.1.6.15) (subsubsection.1.6.2)]
->> endobj
-20925 0 obj <<
-/Names [(subsubsection.1.6.20) 1018 0 R (subsubsection.1.6.3) 924 0 R (subsubsection.1.6.4) 926 0 R (subsubsection.1.6.5) 928 0 R (subsubsection.1.6.6) 937 0 R (subsubsection.1.6.7) 942 0 R]
-/Limits [(subsubsection.1.6.20) (subsubsection.1.6.7)]
->> endobj
-20926 0 obj <<
-/Names [(subsubsection.1.6.8) 945 0 R (subsubsection.1.6.9) 954 0 R (subsubsection.1.7.1) 1032 0 R (subsubsection.1.8.1) 1035 0 R (subsubsection.1.8.2) 1037 0 R (subsubsection.1.8.3) 1050 0 R]
-/Limits [(subsubsection.1.6.8) (subsubsection.1.8.3)]
->> endobj
-20927 0 obj <<
-/Names [(subsubsection.1.8.4) 1052 0 R (subsubsection.1.9.1) 1057 0 R (subsubsection.1.9.2) 1067 0 R (subsubsection.1.9.3) 1069 0 R (subsubsection.1.9.4) 1071 0 R (subsubsection.1.9.5) 1081 0 R]
-/Limits [(subsubsection.1.8.4) (subsubsection.1.9.5)]
->> endobj
-20928 0 obj <<
-/Names [(subsubsection.1.9.6) 1084 0 R (subsubsection.1.9.7) 1086 0 R (subsubsection.1.9.8) 1088 0 R (subsubsection.1.9.9) 1090 0 R (subsubsection.10.1.1) 2995 0 R (subsubsection.10.10.1) 5335 0 R]
-/Limits [(subsubsection.1.9.6) (subsubsection.10.10.1)]
->> endobj
-20929 0 obj <<
-/Names [(subsubsection.10.10.2) 5349 0 R (subsubsection.10.10.3) 5352 0 R (subsubsection.10.11.1) 5377 0 R (subsubsection.10.12.1) 5378 0 R (subsubsection.10.13.1) 5805 0 R (subsubsection.10.13.2) 5807 0 R]
-/Limits [(subsubsection.10.10.2) (subsubsection.10.13.2)]
->> endobj
-20930 0 obj <<
-/Names [(subsubsection.10.13.3) 5814 0 R (subsubsection.10.14.1) 5925 0 R (subsubsection.10.15.1) 5928 0 R (subsubsection.10.16.1) 5945 0 R (subsubsection.10.17.1) 5948 0 R (subsubsection.10.18.1) 5992 0 R]
-/Limits [(subsubsection.10.13.3) (subsubsection.10.18.1)]
->> endobj
-20931 0 obj <<
-/Names [(subsubsection.10.18.2) 5993 0 R (subsubsection.10.19.1) 6089 0 R (subsubsection.10.2.1) 2997 0 R (subsubsection.10.20.1) 6115 0 R (subsubsection.10.20.2) 6116 0 R (subsubsection.10.21.1) 6367 0 R]
-/Limits [(subsubsection.10.18.2) (subsubsection.10.21.1)]
->> endobj
-20932 0 obj <<
-/Names [(subsubsection.10.21.2) 6382 0 R (subsubsection.10.21.3) 6384 0 R (subsubsection.10.21.4) 6401 0 R (subsubsection.10.21.5) 6426 0 R (subsubsection.10.21.6) 6473 0 R (subsubsection.10.22.1) 6618 0 R]
-/Limits [(subsubsection.10.21.2) (subsubsection.10.22.1)]
->> endobj
-20933 0 obj <<
-/Names [(subsubsection.10.22.2) 6619 0 R (subsubsection.10.22.3) 6630 0 R (subsubsection.10.22.4) 6647 0 R (subsubsection.10.23.1) 6663 0 R (subsubsection.10.23.2) 6665 0 R (subsubsection.10.24.1) 6710 0 R]
-/Limits [(subsubsection.10.22.2) (subsubsection.10.24.1)]
->> endobj
-20934 0 obj <<
-/Names [(subsubsection.10.24.2) 6735 0 R (subsubsection.10.24.3) 6745 0 R (subsubsection.10.25.1) 6790 0 R (subsubsection.10.25.2) 6792 0 R (subsubsection.10.26.1) 6835 0 R (subsubsection.10.26.2) 6836 0 R]
-/Limits [(subsubsection.10.24.2) (subsubsection.10.26.2)]
->> endobj
-20935 0 obj <<
-/Names [(subsubsection.10.26.3) 6855 0 R (subsubsection.10.26.4) 6881 0 R (subsubsection.10.27.1) 6926 0 R (subsubsection.10.28.1) 6958 0 R (subsubsection.10.28.2) 6959 0 R (subsubsection.10.29.1) 7005 0 R]
-/Limits [(subsubsection.10.26.3) (subsubsection.10.29.1)]
->> endobj
-20936 0 obj <<
-/Names [(subsubsection.10.3.1) 3067 0 R (subsubsection.10.3.2) 3068 0 R (subsubsection.10.3.3) 3073 0 R (subsubsection.10.3.4) 3094 0 R (subsubsection.10.30.1) 7021 0 R (subsubsection.10.30.2) 7022 0 R]
-/Limits [(subsubsection.10.3.1) (subsubsection.10.30.2)]
->> endobj
-20937 0 obj <<
-/Names [(subsubsection.10.31.1) 7107 0 R (subsubsection.10.31.2) 7118 0 R (subsubsection.10.31.3) 7121 0 R (subsubsection.10.32.1) 7500 0 R (subsubsection.10.32.2) 7513 0 R (subsubsection.10.32.3) 7515 0 R]
-/Limits [(subsubsection.10.31.1) (subsubsection.10.32.3)]
->> endobj
-20938 0 obj <<
-/Names [(subsubsection.10.32.4) 7517 0 R (subsubsection.10.32.5) 7530 0 R (subsubsection.10.32.6) 7548 0 R (subsubsection.10.32.7) 7612 0 R (subsubsection.10.33.1) 7732 0 R (subsubsection.10.33.2) 7733 0 R]
-/Limits [(subsubsection.10.32.4) (subsubsection.10.33.2)]
->> endobj
-20939 0 obj <<
-/Names [(subsubsection.10.33.3) 7760 0 R (subsubsection.10.34.1) 7786 0 R (subsubsection.10.35.1) 7790 0 R (subsubsection.10.35.2) 7792 0 R (subsubsection.10.36.1) 7905 0 R (subsubsection.10.36.2) 7907 0 R]
-/Limits [(subsubsection.10.33.3) (subsubsection.10.36.2)]
->> endobj
-20940 0 obj <<
-/Names [(subsubsection.10.36.3) 7909 0 R (subsubsection.10.37.1) 7985 0 R (subsubsection.10.37.2) 7998 0 R (subsubsection.10.37.3) 8001 0 R (subsubsection.10.38.1) 8074 0 R (subsubsection.10.38.2) 8091 0 R]
-/Limits [(subsubsection.10.36.3) (subsubsection.10.38.2)]
->> endobj
-20941 0 obj <<
-/Names [(subsubsection.10.38.3) 8102 0 R (subsubsection.10.39.1) 8105 0 R (subsubsection.10.4.1) 3694 0 R (subsubsection.10.4.2) 3701 0 R (subsubsection.10.4.3) 3740 0 R (subsubsection.10.4.4) 4072 0 R]
-/Limits [(subsubsection.10.38.3) (subsubsection.10.4.4)]
->> endobj
-20942 0 obj <<
-/Names [(subsubsection.10.40.1) 8130 0 R (subsubsection.10.41.1) 8220 0 R (subsubsection.10.42.1) 8243 0 R (subsubsection.10.43.1) 8245 0 R (subsubsection.10.44.1) 8246 0 R (subsubsection.10.45.1) 8303 0 R]
-/Limits [(subsubsection.10.40.1) (subsubsection.10.45.1)]
->> endobj
-20943 0 obj <<
-/Names [(subsubsection.10.45.2) 8326 0 R (subsubsection.10.45.3) 8337 0 R (subsubsection.10.45.4) 8381 0 R (subsubsection.10.46.1) 8399 0 R (subsubsection.10.46.2) 8401 0 R (subsubsection.10.47.1) 8847 0 R]
-/Limits [(subsubsection.10.45.2) (subsubsection.10.47.1)]
->> endobj
-20944 0 obj <<
-/Names [(subsubsection.10.47.2) 8904 0 R (subsubsection.10.47.3) 8915 0 R (subsubsection.10.47.4) 8917 0 R (subsubsection.10.47.5) 8920 0 R (subsubsection.10.47.6) 8957 0 R (subsubsection.10.47.7) 9041 0 R]
-/Limits [(subsubsection.10.47.2) (subsubsection.10.47.7)]
->> endobj
-20945 0 obj <<
-/Names [(subsubsection.10.48.1) 9132 0 R (subsubsection.10.48.2) 9145 0 R (subsubsection.10.48.3) 9147 0 R (subsubsection.10.48.4) 9174 0 R (subsubsection.10.49.1) 9226 0 R (subsubsection.10.5.1) 4139 0 R]
-/Limits [(subsubsection.10.48.1) (subsubsection.10.5.1)]
->> endobj
-20946 0 obj <<
-/Names [(subsubsection.10.5.2) 4140 0 R (subsubsection.10.50.1) 9269 0 R (subsubsection.10.50.2) 9270 0 R (subsubsection.10.51.1) 9750 0 R (subsubsection.10.51.2) 9794 0 R (subsubsection.10.51.3) 9845 0 R]
-/Limits [(subsubsection.10.5.2) (subsubsection.10.51.3)]
->> endobj
-20947 0 obj <<
-/Names [(subsubsection.10.51.4) 10154 0 R (subsubsection.10.52.1) 10189 0 R (subsubsection.10.52.2) 10234 0 R (subsubsection.10.53.1) 10494 0 R (subsubsection.10.53.2) 10563 0 R (subsubsection.10.53.3) 10565 0 R]
-/Limits [(subsubsection.10.51.4) (subsubsection.10.53.3)]
->> endobj
-20948 0 obj <<
-/Names [(subsubsection.10.53.4) 10567 0 R (subsubsection.10.53.5) 10570 0 R (subsubsection.10.53.6) 10606 0 R (subsubsection.10.53.7) 10629 0 R (subsubsection.10.54.1) 10776 0 R (subsubsection.10.54.2) 10788 0 R]
-/Limits [(subsubsection.10.53.4) (subsubsection.10.54.2)]
->> endobj
-20949 0 obj <<
-/Names [(subsubsection.10.54.3) 10790 0 R (subsubsection.10.54.4) 10808 0 R (subsubsection.10.55.1) 10834 0 R (subsubsection.10.55.2) 10835 0 R (subsubsection.10.56.1) 10852 0 R (subsubsection.10.57.1) 10873 0 R]
-/Limits [(subsubsection.10.54.3) (subsubsection.10.57.1)]
->> endobj
-20950 0 obj <<
-/Names [(subsubsection.10.58.1) 10896 0 R (subsubsection.10.59.1) 10920 0 R (subsubsection.10.6.1) 4155 0 R (subsubsection.10.60.1) 10921 0 R (subsubsection.10.61.1) 10966 0 R (subsubsection.10.61.2) 10968 0 R]
-/Limits [(subsubsection.10.58.1) (subsubsection.10.61.2)]
->> endobj
-20951 0 obj <<
-/Names [(subsubsection.10.61.3) 10981 0 R (subsubsection.10.62.1) 11022 0 R (subsubsection.10.62.2) 11043 0 R (subsubsection.10.62.3) 11053 0 R (subsubsection.10.63.1) 11560 0 R (subsubsection.10.63.2) 11561 0 R]
-/Limits [(subsubsection.10.61.3) (subsubsection.10.63.2)]
->> endobj
-20952 0 obj <<
-/Names [(subsubsection.10.63.3) 11605 0 R (subsubsection.10.63.4) 11630 0 R (subsubsection.10.64.1) 12024 0 R (subsubsection.10.64.2) 12040 0 R (subsubsection.10.64.3) 12044 0 R (subsubsection.10.64.4) 12062 0 R]
-/Limits [(subsubsection.10.63.3) (subsubsection.10.64.4)]
->> endobj
-20953 0 obj <<
-/Names [(subsubsection.10.65.1) 12319 0 R (subsubsection.10.65.2) 12320 0 R (subsubsection.10.65.3) 12332 0 R (subsubsection.10.65.4) 12352 0 R (subsubsection.10.65.5) 12395 0 R (subsubsection.10.66.1) 12465 0 R]
-/Limits [(subsubsection.10.65.1) (subsubsection.10.66.1)]
->> endobj
-20954 0 obj <<
-/Names [(subsubsection.10.66.2) 12479 0 R (subsubsection.10.66.3) 12497 0 R (subsubsection.10.67.1) 12596 0 R (subsubsection.10.67.2) 12597 0 R (subsubsection.10.67.3) 12641 0 R (subsubsection.10.68.1) 12644 0 R]
-/Limits [(subsubsection.10.66.2) (subsubsection.10.68.1)]
->> endobj
-20955 0 obj <<
-/Names [(subsubsection.10.69.1) 12662 0 R (subsubsection.10.69.2) 12664 0 R (subsubsection.10.7.1) 4160 0 R (subsubsection.10.70.1) 13247 0 R (subsubsection.10.70.2) 13257 0 R (subsubsection.10.70.3) 13296 0 R]
-/Limits [(subsubsection.10.69.1) (subsubsection.10.70.3)]
->> endobj
-20956 0 obj <<
-/Names [(subsubsection.10.70.4) 13612 0 R (subsubsection.10.71.1) 13698 0 R (subsubsection.10.71.2) 13707 0 R (subsubsection.10.71.3) 13710 0 R (subsubsection.10.72.1) 14147 0 R (subsubsection.10.72.2) 14154 0 R]
-/Limits [(subsubsection.10.70.4) (subsubsection.10.72.2)]
->> endobj
-20957 0 obj <<
-/Names [(subsubsection.10.72.3) 14210 0 R (subsubsection.10.72.4) 14446 0 R (subsubsection.10.73.1) 14489 0 R (subsubsection.10.74.1) 14541 0 R (subsubsection.10.75.1) 14635 0 R (subsubsection.10.76.1) 14759 0 R]
-/Limits [(subsubsection.10.72.3) (subsubsection.10.76.1)]
->> endobj
-20958 0 obj <<
-/Names [(subsubsection.10.76.2) 14828 0 R (subsubsection.10.76.3) 14831 0 R (subsubsection.10.76.4) 14847 0 R (subsubsection.10.76.5) 14879 0 R (subsubsection.10.77.1) 14975 0 R (subsubsection.10.77.2) 14976 0 R]
-/Limits [(subsubsection.10.76.2) (subsubsection.10.77.2)]
->> endobj
-20959 0 obj <<
-/Names [(subsubsection.10.77.3) 14979 0 R (subsubsection.10.78.1) 15134 0 R (subsubsection.10.78.2) 15135 0 R (subsubsection.10.78.3) 15171 0 R (subsubsection.10.79.1) 15597 0 R (subsubsection.10.79.2) 15599 0 R]
-/Limits [(subsubsection.10.77.3) (subsubsection.10.79.2)]
->> endobj
-20960 0 obj <<
-/Names [(subsubsection.10.79.3) 15644 0 R (subsubsection.10.79.4) 15886 0 R (subsubsection.10.8.1) 4734 0 R (subsubsection.10.8.2) 4736 0 R (subsubsection.10.8.3) 4777 0 R (subsubsection.10.8.4) 5078 0 R]
-/Limits [(subsubsection.10.79.3) (subsubsection.10.8.4)]
->> endobj
-20961 0 obj <<
-/Names [(subsubsection.10.80.1) 15988 0 R (subsubsection.10.80.2) 15989 0 R (subsubsection.10.81.1) 16055 0 R (subsubsection.10.81.2) 16067 0 R (subsubsection.10.82.1) 16570 0 R (subsubsection.10.82.2) 16602 0 R]
-/Limits [(subsubsection.10.80.1) (subsubsection.10.82.2)]
->> endobj
-20962 0 obj <<
-/Names [(subsubsection.10.82.3) 16625 0 R (subsubsection.10.82.4) 16975 0 R (subsubsection.10.83.1) 17160 0 R (subsubsection.10.83.2) 17192 0 R (subsubsection.10.83.3) 17196 0 R (subsubsection.10.83.4) 17209 0 R]
-/Limits [(subsubsection.10.82.3) (subsubsection.10.83.4)]
->> endobj
-20963 0 obj <<
-/Names [(subsubsection.10.84.1) 17227 0 R (subsubsection.10.85.1) 17231 0 R (subsubsection.10.85.2) 17243 0 R (subsubsection.10.86.1) 17249 0 R (subsubsection.10.86.2) 17251 0 R (subsubsection.10.87.1) 17323 0 R]
-/Limits [(subsubsection.10.84.1) (subsubsection.10.87.1)]
->> endobj
-20964 0 obj <<
-/Names [(subsubsection.10.87.2) 17336 0 R (subsubsection.10.87.3) 17347 0 R (subsubsection.10.88.1) 17350 0 R (subsubsection.10.89.1) 17374 0 R (subsubsection.10.9.1) 5220 0 R (subsubsection.10.9.2) 5221 0 R]
-/Limits [(subsubsection.10.87.2) (subsubsection.10.9.2)]
->> endobj
-20965 0 obj <<
-/Names [(subsubsection.10.9.3) 5268 0 R (subsubsection.10.90.1) 17384 0 R (subsubsection.10.91.1) 17397 0 R (subsubsection.10.92.1) 17401 0 R (subsubsection.10.93.1) 17471 0 R (subsubsection.10.93.2) 17472 0 R]
-/Limits [(subsubsection.10.9.3) (subsubsection.10.93.2)]
->> endobj
-20966 0 obj <<
-/Names [(subsubsection.10.93.3) 17475 0 R (subsubsection.10.93.4) 17477 0 R (subsubsection.10.94.1) 17555 0 R (subsubsection.10.94.2) 17565 0 R (subsubsection.10.94.3) 17570 0 R (subsubsection.10.95.1) 17628 0 R]
-/Limits [(subsubsection.10.93.3) (subsubsection.10.95.1)]
->> endobj
-20967 0 obj <<
-/Names [(subsubsection.10.95.2) 17629 0 R (subsubsection.10.95.3) 17631 0 R (subsubsection.10.96.1) 17645 0 R (subsubsection.8.1.1) 2394 0 R (subsubsection.8.1.2) 2395 0 R (subsubsection.8.1.3) 2400 0 R]
-/Limits [(subsubsection.10.95.2) (subsubsection.8.1.3)]
->> endobj
-20968 0 obj <<
-/Names [(subsubsection.8.1.4) 2409 0 R (subsubsection.8.1.5) 2444 0 R (subsubsection.8.1.6) 2536 0 R (subsubsection.9.1.1) 2951 0 R (subsubsection.9.1.2) 2952 0 R (subsubsection.9.1.3) 2956 0 R]
-/Limits [(subsubsection.8.1.4) (subsubsection.9.1.3)]
->> endobj
-20969 0 obj <<
-/Names [(subsubsection.9.1.4) 2967 0 R (subsubsection.9.2.1) 2983 0 R (subsubsection.9.2.2) 2984 0 R (subsubsection.9.3.1) 2987 0 R (table.1) 2472 0 R (table.10) 2505 0 R]
-/Limits [(subsubsection.9.1.4) (table.10)]
->> endobj
-20970 0 obj <<
-/Names [(table.100) 3920 0 R (table.101) 3922 0 R (table.102) 3931 0 R (table.103) 3933 0 R (table.104) 3934 0 R (table.105) 3936 0 R]
-/Limits [(table.100) (table.105)]
->> endobj
-20971 0 obj <<
-/Names [(table.106) 3937 0 R (table.107) 3948 0 R (table.108) 3949 0 R (table.109) 3951 0 R (table.11) 2506 0 R (table.110) 3953 0 R]
-/Limits [(table.106) (table.110)]
->> endobj
-20972 0 obj <<
-/Names [(table.111) 3962 0 R (table.112) 3964 0 R (table.113) 3966 0 R (table.114) 3968 0 R (table.115) 3969 0 R (table.116) 3982 0 R]
-/Limits [(table.111) (table.116)]
->> endobj
-20973 0 obj <<
-/Names [(table.117) 3983 0 R (table.118) 3985 0 R (table.119) 3986 0 R (table.12) 2515 0 R (table.120) 3988 0 R (table.121) 3989 0 R]
-/Limits [(table.117) (table.121)]
->> endobj
-20974 0 obj <<
-/Names [(table.122) 4001 0 R (table.123) 4002 0 R (table.124) 4005 0 R (table.125) 4006 0 R (table.126) 4008 0 R (table.127) 4016 0 R]
-/Limits [(table.122) (table.127)]
->> endobj
-20975 0 obj <<
-/Names [(table.128) 4018 0 R (table.129) 4019 0 R (table.13) 2516 0 R (table.130) 4021 0 R (table.131) 4023 0 R (table.132) 4038 0 R]
-/Limits [(table.128) (table.132)]
->> endobj
-20976 0 obj <<
-/Names [(table.133) 4040 0 R (table.134) 4041 0 R (table.135) 4043 0 R (table.136) 4045 0 R (table.137) 4058 0 R (table.138) 4059 0 R]
-/Limits [(table.133) (table.138)]
->> endobj
-20977 0 obj <<
-/Names [(table.139) 4061 0 R (table.14) 2517 0 R (table.140) 4062 0 R (table.141) 4070 0 R (table.142) 4738 0 R (table.143) 4750 0 R]
-/Limits [(table.139) (table.143)]
->> endobj
-20978 0 obj <<
-/Names [(table.144) 4752 0 R (table.145) 4754 0 R (table.146) 4756 0 R (table.147) 4757 0 R (table.148) 4764 0 R (table.149) 4766 0 R]
-/Limits [(table.144) (table.149)]
->> endobj
-20979 0 obj <<
-/Names [(table.15) 2525 0 R (table.150) 4779 0 R (table.151) 4781 0 R (table.152) 4783 0 R (table.153) 4785 0 R (table.154) 4792 0 R]
-/Limits [(table.15) (table.154)]
->> endobj
-20980 0 obj <<
-/Names [(table.155) 4794 0 R (table.156) 4796 0 R (table.157) 4797 0 R (table.158) 4799 0 R (table.159) 4800 0 R (table.16) 2526 0 R]
-/Limits [(table.155) (table.16)]
->> endobj
-20981 0 obj <<
-/Names [(table.160) 4807 0 R (table.161) 4808 0 R (table.162) 4810 0 R (table.163) 4811 0 R (table.164) 4820 0 R (table.165) 4821 0 R]
-/Limits [(table.160) (table.165)]
->> endobj
-20982 0 obj <<
-/Names [(table.166) 4823 0 R (table.167) 4825 0 R (table.168) 4827 0 R (table.169) 4829 0 R (table.17) 2528 0 R (table.170) 4837 0 R]
-/Limits [(table.166) (table.170)]
->> endobj
-20983 0 obj <<
-/Names [(table.171) 4839 0 R (table.172) 4840 0 R (table.173) 4842 0 R (table.174) 4843 0 R (table.175) 4845 0 R (table.176) 4846 0 R]
-/Limits [(table.171) (table.176)]
->> endobj
-20984 0 obj <<
-/Names [(table.177) 4853 0 R (table.178) 4854 0 R (table.179) 4856 0 R (table.18) 2534 0 R (table.180) 4857 0 R (table.181) 4859 0 R]
-/Limits [(table.177) (table.181)]
->> endobj
-20985 0 obj <<
-/Names [(table.182) 4860 0 R (table.183) 4868 0 R (table.184) 4869 0 R (table.185) 4872 0 R (table.186) 4873 0 R (table.187) 4875 0 R]
-/Limits [(table.182) (table.187)]
->> endobj
-20986 0 obj <<
-/Names [(table.188) 4876 0 R (table.189) 4878 0 R (table.19) 2535 0 R (table.190) 4887 0 R (table.191) 4889 0 R (table.192) 4890 0 R]
-/Limits [(table.188) (table.192)]
->> endobj
-20987 0 obj <<
-/Names [(table.193) 4892 0 R (table.194) 4893 0 R (table.195) 4895 0 R (table.196) 4896 0 R (table.197) 4905 0 R (table.198) 4907 0 R]
-/Limits [(table.193) (table.198)]
->> endobj
-20988 0 obj <<
-/Names [(table.199) 4909 0 R (table.2) 2481 0 R (table.20) 2971 0 R (table.200) 4911 0 R (table.201) 4913 0 R (table.202) 4922 0 R]
-/Limits [(table.199) (table.202)]
->> endobj
-20989 0 obj <<
-/Names [(table.203) 4923 0 R (table.204) 4925 0 R (table.205) 4926 0 R (table.206) 4928 0 R (table.207) 4938 0 R (table.208) 4940 0 R]
-/Limits [(table.203) (table.208)]
->> endobj
-20990 0 obj <<
-/Names [(table.209) 4941 0 R (table.21) 2986 0 R (table.210) 4943 0 R (table.211) 4944 0 R (table.212) 4953 0 R (table.213) 4954 0 R]
-/Limits [(table.209) (table.213)]
->> endobj
-20991 0 obj <<
-/Names [(table.214) 4956 0 R (table.215) 4957 0 R (table.216) 4959 0 R (table.217) 4971 0 R (table.218) 4973 0 R (table.219) 4974 0 R]
-/Limits [(table.214) (table.219)]
->> endobj
-20992 0 obj <<
-/Names [(table.22) 3071 0 R (table.220) 4976 0 R (table.221) 4978 0 R (table.222) 4986 0 R (table.223) 4988 0 R (table.224) 4990 0 R]
-/Limits [(table.22) (table.224)]
->> endobj
-20993 0 obj <<
-/Names [(table.225) 5002 0 R (table.226) 5003 0 R (table.227) 5005 0 R (table.228) 5006 0 R (table.229) 5008 0 R (table.23) 3072 0 R]
-/Limits [(table.225) (table.23)]
->> endobj
-20994 0 obj <<
-/Names [(table.230) 5009 0 R (table.231) 5017 0 R (table.232) 5018 0 R (table.233) 5020 0 R (table.234) 5022 0 R (table.235) 5037 0 R]
-/Limits [(table.230) (table.235)]
->> endobj
-20995 0 obj <<
-/Names [(table.236) 5038 0 R (table.237) 5040 0 R (table.238) 5042 0 R (table.239) 5055 0 R (table.24) 3703 0 R (table.240) 5056 0 R]
-/Limits [(table.236) (table.240)]
->> endobj
-20996 0 obj <<
-/Names [(table.241) 5058 0 R (table.242) 5059 0 R (table.243) 5067 0 R (table.244) 5069 0 R (table.245) 5223 0 R (table.246) 5224 0 R]
-/Limits [(table.241) (table.246)]
->> endobj
-20997 0 obj <<
-/Names [(table.247) 5226 0 R (table.248) 5232 0 R (table.249) 5234 0 R (table.25) 3713 0 R (table.250) 5235 0 R (table.251) 5237 0 R]
-/Limits [(table.247) (table.251)]
->> endobj
-20998 0 obj <<
-/Names [(table.252) 5238 0 R (table.253) 5240 0 R (table.254) 5241 0 R (table.255) 5248 0 R (table.256) 5250 0 R (table.257) 5252 0 R]
-/Limits [(table.252) (table.257)]
->> endobj
-20999 0 obj <<
-/Names [(table.258) 5254 0 R (table.259) 5255 0 R (table.26) 3714 0 R (table.260) 5262 0 R (table.261) 5264 0 R (table.262) 5266 0 R]
-/Limits [(table.258) (table.262)]
->> endobj
-21000 0 obj <<
-/Names [(table.263) 5296 0 R (table.264) 5351 0 R (table.265) 5883 0 R (table.266) 5996 0 R (table.267) 6010 0 R (table.268) 6012 0 R]
-/Limits [(table.263) (table.268)]
->> endobj
-21001 0 obj <<
-/Names [(table.269) 6023 0 R (table.27) 3716 0 R (table.270) 6025 0 R (table.271) 6026 0 R (table.272) 6036 0 R (table.273) 6045 0 R]
-/Limits [(table.269) (table.273)]
->> endobj
-21002 0 obj <<
-/Names [(table.274) 6056 0 R (table.275) 6057 0 R (table.276) 6059 0 R (table.277) 6060 0 R (table.278) 6387 0 R (table.279) 6400 0 R]
-/Limits [(table.274) (table.279)]
->> endobj
-21003 0 obj <<
-/Names [(table.28) 3717 0 R (table.280) 6403 0 R (table.281) 6621 0 R (table.282) 6634 0 R (table.283) 6643 0 R (table.284) 6645 0 R]
-/Limits [(table.28) (table.284)]
->> endobj
-21004 0 obj <<
-/Names [(table.285) 6668 0 R (table.286) 6738 0 R (table.287) 6740 0 R (table.288) 6742 0 R (table.289) 6744 0 R (table.29) 3719 0 R]
-/Limits [(table.285) (table.29)]
->> endobj
-21005 0 obj <<
-/Names [(table.290) 6752 0 R (table.291) 6754 0 R (table.292) 6756 0 R (table.293) 6776 0 R (table.294) 6778 0 R (table.295) 6799 0 R]
-/Limits [(table.290) (table.295)]
->> endobj
-21006 0 obj <<
-/Names [(table.296) 6854 0 R (table.297) 6857 0 R (table.298) 6859 0 R (table.299) 6878 0 R (table.3) 2483 0 R (table.30) 3727 0 R]
-/Limits [(table.296) (table.30)]
->> endobj
-21007 0 obj <<
-/Names [(table.300) 6880 0 R (table.301) 6962 0 R (table.302) 6965 0 R (table.303) 7059 0 R (table.304) 7120 0 R (table.305) 7529 0 R]
-/Limits [(table.300) (table.305)]
->> endobj
-21008 0 obj <<
-/Names [(table.306) 7535 0 R (table.307) 7824 0 R (table.308) 8000 0 R (table.309) 8093 0 R (table.31) 3728 0 R (table.310) 8358 0 R]
-/Limits [(table.306) (table.310)]
->> endobj
-21009 0 obj <<
-/Names [(table.311) 8365 0 R (table.312) 8367 0 R (table.313) 8380 0 R (table.314) 8922 0 R (table.315) 8924 0 R (table.316) 8933 0 R]
-/Limits [(table.311) (table.316)]
->> endobj
-21010 0 obj <<
-/Names [(table.317) 8935 0 R (table.318) 8939 0 R (table.319) 8951 0 R (table.32) 3730 0 R (table.320) 8953 0 R (table.321) 9796 0 R]
-/Limits [(table.317) (table.321)]
->> endobj
-21011 0 obj <<
-/Names [(table.322) 9797 0 R (table.323) 9799 0 R (table.324) 9800 0 R (table.325) 9807 0 R (table.326) 9808 0 R (table.327) 9810 0 R]
-/Limits [(table.322) (table.327)]
->> endobj
-21012 0 obj <<
-/Names [(table.328) 9811 0 R (table.329) 9813 0 R (table.33) 3731 0 R (table.330) 9814 0 R (table.331) 9816 0 R (table.332) 9822 0 R]
-/Limits [(table.328) (table.332)]
->> endobj
-21013 0 obj <<
-/Names [(table.333) 9824 0 R (table.334) 9825 0 R (table.335) 9827 0 R (table.336) 9828 0 R (table.337) 9830 0 R (table.338) 9837 0 R]
-/Limits [(table.333) (table.338)]
->> endobj
-21014 0 obj <<
-/Names [(table.339) 9839 0 R (table.34) 3733 0 R (table.340) 9840 0 R (table.341) 9842 0 R (table.342) 9843 0 R (table.343) 9853 0 R]
-/Limits [(table.339) (table.343)]
->> endobj
-21015 0 obj <<
-/Names [(table.344) 9856 0 R (table.345) 9858 0 R (table.346) 9860 0 R (table.347) 9870 0 R (table.348) 9871 0 R (table.349) 9873 0 R]
-/Limits [(table.344) (table.349)]
->> endobj
-21016 0 obj <<
-/Names [(table.35) 3739 0 R (table.350) 9874 0 R (table.351) 9876 0 R (table.352) 9884 0 R (table.353) 9886 0 R (table.354) 9887 0 R]
-/Limits [(table.35) (table.354)]
->> endobj
-21017 0 obj <<
-/Names [(table.355) 9889 0 R (table.356) 9890 0 R (table.357) 9897 0 R (table.358) 9899 0 R (table.359) 9901 0 R (table.36) 3742 0 R]
-/Limits [(table.355) (table.36)]
->> endobj
-21018 0 obj <<
-/Names [(table.360) 9903 0 R (table.361) 9905 0 R (table.362) 9912 0 R (table.363) 9913 0 R (table.364) 9915 0 R (table.365) 9916 0 R]
-/Limits [(table.360) (table.365)]
->> endobj
-21019 0 obj <<
-/Names [(table.366) 9918 0 R (table.367) 9919 0 R (table.368) 9927 0 R (table.369) 9928 0 R (table.37) 3744 0 R (table.370) 9930 0 R]
-/Limits [(table.366) (table.370)]
->> endobj
-21020 0 obj <<
-/Names [(table.371) 9931 0 R (table.372) 9933 0 R (table.373) 9934 0 R (table.374) 9936 0 R (table.375) 9942 0 R (table.376) 9944 0 R]
-/Limits [(table.371) (table.376)]
->> endobj
-21021 0 obj <<
-/Names [(table.377) 9945 0 R (table.378) 9947 0 R (table.379) 9948 0 R (table.38) 3746 0 R (table.380) 9950 0 R (table.381) 9951 0 R]
-/Limits [(table.377) (table.381)]
->> endobj
-21022 0 obj <<
-/Names [(table.382) 9953 0 R (table.383) 9962 0 R (table.384) 9964 0 R (table.385) 9965 0 R (table.386) 9967 0 R (table.387) 9968 0 R]
-/Limits [(table.382) (table.387)]
->> endobj
-21023 0 obj <<
-/Names [(table.388) 9970 0 R (table.389) 9972 0 R (table.39) 3747 0 R (table.390) 9983 0 R (table.391) 9985 0 R (table.392) 9987 0 R]
-/Limits [(table.388) (table.392)]
->> endobj
-21024 0 obj <<
-/Names [(table.393) 9989 0 R (table.394) 9990 0 R (table.395) 9999 0 R (table.396) 10000 0 R (table.397) 10002 0 R (table.398) 10003 0 R]
-/Limits [(table.393) (table.398)]
->> endobj
-21025 0 obj <<
-/Names [(table.399) 10005 0 R (table.4) 2484 0 R (table.40) 3754 0 R (table.400) 10014 0 R (table.401) 10016 0 R (table.402) 10017 0 R]
-/Limits [(table.399) (table.402)]
->> endobj
-21026 0 obj <<
-/Names [(table.403) 10019 0 R (table.404) 10020 0 R (table.405) 10022 0 R (table.406) 10036 0 R (table.407) 10038 0 R (table.408) 10039 0 R]
-/Limits [(table.403) (table.408)]
->> endobj
-21027 0 obj <<
-/Names [(table.409) 10041 0 R (table.41) 3755 0 R (table.410) 10043 0 R (table.411) 10052 0 R (table.412) 10054 0 R (table.413) 10056 0 R]
-/Limits [(table.409) (table.413)]
->> endobj
-21028 0 obj <<
-/Names [(table.414) 10058 0 R (table.415) 10070 0 R (table.416) 10072 0 R (table.417) 10073 0 R (table.418) 10075 0 R (table.419) 10076 0 R]
-/Limits [(table.414) (table.419)]
->> endobj
-21029 0 obj <<
-/Names [(table.42) 3757 0 R (table.420) 10078 0 R (table.421) 10090 0 R (table.422) 10092 0 R (table.423) 10093 0 R (table.424) 10095 0 R]
-/Limits [(table.42) (table.424)]
->> endobj
-21030 0 obj <<
-/Names [(table.425) 10096 0 R (table.426) 10098 0 R (table.427) 10099 0 R (table.428) 10113 0 R (table.429) 10114 0 R (table.43) 3758 0 R]
-/Limits [(table.425) (table.43)]
->> endobj
-21031 0 obj <<
-/Names [(table.430) 10116 0 R (table.431) 10118 0 R (table.432) 10119 0 R (table.433) 10132 0 R (table.434) 10134 0 R (table.435) 10136 0 R]
-/Limits [(table.430) (table.435)]
->> endobj
-21032 0 obj <<
-/Names [(table.436) 10148 0 R (table.437) 10150 0 R (table.438) 10151 0 R (table.439) 10572 0 R (table.44) 3760 0 R (table.440) 10582 0 R]
-/Limits [(table.436) (table.440)]
->> endobj
-21033 0 obj <<
-/Names [(table.441) 10584 0 R (table.442) 10589 0 R (table.443) 10591 0 R (table.444) 10604 0 R (table.445) 11046 0 R (table.446) 11048 0 R]
-/Limits [(table.441) (table.446)]
->> endobj
-21034 0 obj <<
-/Names [(table.447) 11050 0 R (table.448) 11052 0 R (table.449) 11060 0 R (table.45) 3768 0 R (table.450) 11062 0 R (table.451) 11064 0 R]
-/Limits [(table.447) (table.451)]
->> endobj
-21035 0 obj <<
-/Names [(table.452) 11078 0 R (table.453) 11080 0 R (table.454) 11588 0 R (table.455) 11615 0 R (table.456) 11621 0 R (table.457) 11655 0 R]
-/Limits [(table.452) (table.457)]
->> endobj
-21036 0 obj <<
-/Names [(table.458) 11666 0 R (table.459) 12042 0 R (table.46) 3770 0 R (table.460) 12054 0 R (table.461) 12056 0 R (table.462) 12095 0 R]
-/Limits [(table.458) (table.462)]
->> endobj
-21037 0 obj <<
-/Names [(table.463) 12100 0 R (table.464) 12334 0 R (table.465) 12335 0 R (table.466) 12337 0 R (table.467) 12345 0 R (table.468) 12347 0 R]
-/Limits [(table.463) (table.468)]
->> endobj
-21038 0 obj <<
-/Names [(table.469) 12348 0 R (table.47) 3771 0 R (table.470) 12350 0 R (table.471) 12351 0 R (table.472) 12362 0 R (table.473) 12363 0 R]
-/Limits [(table.469) (table.473)]
->> endobj
-21039 0 obj <<
-/Names [(table.474) 12365 0 R (table.475) 12367 0 R (table.476) 12369 0 R (table.477) 12376 0 R (table.478) 12380 0 R (table.479) 12381 0 R]
-/Limits [(table.474) (table.479)]
->> endobj
-21040 0 obj <<
-/Names [(table.48) 3773 0 R (table.480) 12383 0 R (table.481) 12392 0 R (table.482) 12394 0 R (table.483) 12481 0 R (table.484) 12599 0 R]
-/Limits [(table.48) (table.484)]
->> endobj
-21041 0 obj <<
-/Names [(table.485) 12600 0 R (table.486) 12602 0 R (table.487) 12609 0 R (table.488) 12611 0 R (table.489) 12612 0 R (table.49) 3775 0 R]
-/Limits [(table.485) (table.49)]
->> endobj
-21042 0 obj <<
-/Names [(table.490) 12614 0 R (table.491) 12615 0 R (table.492) 12617 0 R (table.493) 12624 0 R (table.494) 12626 0 R (table.495) 12628 0 R]
-/Limits [(table.490) (table.495)]
->> endobj
-21043 0 obj <<
-/Names [(table.496) 12629 0 R (table.497) 12631 0 R (table.498) 12638 0 R (table.499) 12640 0 R (table.5) 2492 0 R (table.50) 3782 0 R]
-/Limits [(table.496) (table.50)]
->> endobj
-21044 0 obj <<
-/Names [(table.500) 12643 0 R (table.501) 13259 0 R (table.502) 13268 0 R (table.503) 13269 0 R (table.504) 13271 0 R (table.505) 13272 0 R]
-/Limits [(table.500) (table.505)]
->> endobj
-21045 0 obj <<
-/Names [(table.506) 13279 0 R (table.507) 13282 0 R (table.508) 13283 0 R (table.509) 13285 0 R (table.51) 3784 0 R (table.510) 13286 0 R]
-/Limits [(table.506) (table.510)]
->> endobj
-21046 0 obj <<
-/Names [(table.511) 13294 0 R (table.512) 13295 0 R (table.513) 13298 0 R (table.514) 13300 0 R (table.515) 13302 0 R (table.516) 13309 0 R]
-/Limits [(table.511) (table.516)]
->> endobj
-21047 0 obj <<
-/Names [(table.517) 13311 0 R (table.518) 13313 0 R (table.519) 13315 0 R (table.52) 3786 0 R (table.520) 13317 0 R (table.521) 13319 0 R]
-/Limits [(table.517) (table.521)]
->> endobj
-21048 0 obj <<
-/Names [(table.522) 13326 0 R (table.523) 13327 0 R (table.524) 13329 0 R (table.525) 13330 0 R (table.526) 13339 0 R (table.527) 13340 0 R]
-/Limits [(table.522) (table.527)]
->> endobj
-21049 0 obj <<
-/Names [(table.528) 13342 0 R (table.529) 13343 0 R (table.53) 3788 0 R (table.530) 13345 0 R (table.531) 13351 0 R (table.532) 13353 0 R]
-/Limits [(table.528) (table.532)]
->> endobj
-21050 0 obj <<
-/Names [(table.533) 13354 0 R (table.534) 13356 0 R (table.535) 13357 0 R (table.536) 13359 0 R (table.537) 13360 0 R (table.538) 13367 0 R]
-/Limits [(table.533) (table.538)]
->> endobj
-21051 0 obj <<
-/Names [(table.539) 13368 0 R (table.54) 3790 0 R (table.540) 13370 0 R (table.541) 13371 0 R (table.542) 13373 0 R (table.543) 13374 0 R]
-/Limits [(table.539) (table.543)]
->> endobj
-21052 0 obj <<
-/Names [(table.544) 13382 0 R (table.545) 13383 0 R (table.546) 13385 0 R (table.547) 13386 0 R (table.548) 13388 0 R (table.549) 13389 0 R]
-/Limits [(table.544) (table.549)]
->> endobj
-21053 0 obj <<
-/Names [(table.55) 3792 0 R (table.550) 13391 0 R (table.551) 13392 0 R (table.552) 13400 0 R (table.553) 13401 0 R (table.554) 13403 0 R]
-/Limits [(table.55) (table.554)]
->> endobj
-21054 0 obj <<
-/Names [(table.555) 13404 0 R (table.556) 13414 0 R (table.557) 13415 0 R (table.558) 13417 0 R (table.559) 13418 0 R (table.56) 3793 0 R]
-/Limits [(table.555) (table.56)]
->> endobj
-21055 0 obj <<
-/Names [(table.560) 13420 0 R (table.561) 13422 0 R (table.562) 13424 0 R (table.563) 13434 0 R (table.564) 13436 0 R (table.565) 13438 0 R]
-/Limits [(table.560) (table.565)]
->> endobj
-21056 0 obj <<
-/Names [(table.566) 13440 0 R (table.567) 13449 0 R (table.568) 13451 0 R (table.569) 13452 0 R (table.57) 3801 0 R (table.570) 13454 0 R]
-/Limits [(table.566) (table.570)]
->> endobj
-21057 0 obj <<
-/Names [(table.571) 13455 0 R (table.572) 13465 0 R (table.573) 13466 0 R (table.574) 13468 0 R (table.575) 13469 0 R (table.576) 13471 0 R]
-/Limits [(table.571) (table.576)]
->> endobj
-21058 0 obj <<
-/Names [(table.577) 13472 0 R (table.578) 13482 0 R (table.579) 13483 0 R (table.58) 3802 0 R (table.580) 13485 0 R (table.581) 13486 0 R]
-/Limits [(table.577) (table.581)]
->> endobj
-21059 0 obj <<
-/Names [(table.582) 13488 0 R (table.583) 13498 0 R (table.584) 13500 0 R (table.585) 13502 0 R (table.586) 13503 0 R (table.587) 13513 0 R]
-/Limits [(table.582) (table.587)]
->> endobj
-21060 0 obj <<
-/Names [(table.588) 13515 0 R (table.589) 13517 0 R (table.59) 3804 0 R (table.590) 13518 0 R (table.591) 13531 0 R (table.592) 13532 0 R]
-/Limits [(table.588) (table.592)]
->> endobj
-21061 0 obj <<
-/Names [(table.593) 13534 0 R (table.594) 13535 0 R (table.595) 13537 0 R (table.596) 13538 0 R (table.597) 13547 0 R (table.598) 13548 0 R]
-/Limits [(table.593) (table.598)]
->> endobj
-21062 0 obj <<
-/Names [(table.599) 13550 0 R (table.6) 2493 0 R (table.60) 3805 0 R (table.600) 13551 0 R (table.601) 13553 0 R (table.602) 13555 0 R]
-/Limits [(table.599) (table.602)]
->> endobj
-21063 0 obj <<
-/Names [(table.603) 13567 0 R (table.604) 13569 0 R (table.605) 13570 0 R (table.606) 13572 0 R (table.607) 13574 0 R (table.608) 13591 0 R]
-/Limits [(table.603) (table.608)]
->> endobj
-21064 0 obj <<
-/Names [(table.609) 13592 0 R (table.61) 3807 0 R (table.610) 13594 0 R (table.611) 13595 0 R (table.612) 13607 0 R (table.613) 13608 0 R]
-/Limits [(table.609) (table.613)]
->> endobj
-21065 0 obj <<
-/Names [(table.614) 13610 0 R (table.615) 13709 0 R (table.616) 14156 0 R (table.617) 14157 0 R (table.618) 14164 0 R (table.619) 14165 0 R]
-/Limits [(table.614) (table.619)]
->> endobj
-21066 0 obj <<
-/Names [(table.62) 3808 0 R (table.620) 14167 0 R (table.621) 14168 0 R (table.622) 14170 0 R (table.623) 14171 0 R (table.624) 14173 0 R]
-/Limits [(table.62) (table.624)]
->> endobj
-21067 0 obj <<
-/Names [(table.625) 14179 0 R (table.626) 14181 0 R (table.627) 14182 0 R (table.628) 14184 0 R (table.629) 14185 0 R (table.63) 3815 0 R]
-/Limits [(table.625) (table.63)]
->> endobj
-21068 0 obj <<
-/Names [(table.630) 14193 0 R (table.631) 14194 0 R (table.632) 14196 0 R (table.633) 14197 0 R (table.634) 14199 0 R (table.635) 14200 0 R]
-/Limits [(table.630) (table.635)]
->> endobj
-21069 0 obj <<
-/Names [(table.636) 14207 0 R (table.637) 14208 0 R (table.638) 14212 0 R (table.639) 14214 0 R (table.64) 3816 0 R (table.640) 14221 0 R]
-/Limits [(table.636) (table.640)]
->> endobj
-21070 0 obj <<
-/Names [(table.641) 14223 0 R (table.642) 14225 0 R (table.643) 14226 0 R (table.644) 14233 0 R (table.645) 14234 0 R (table.646) 14236 0 R]
-/Limits [(table.641) (table.646)]
->> endobj
-21071 0 obj <<
-/Names [(table.647) 14237 0 R (table.648) 14239 0 R (table.649) 14245 0 R (table.65) 3818 0 R (table.650) 14247 0 R (table.651) 14249 0 R]
-/Limits [(table.647) (table.651)]
->> endobj
-21072 0 obj <<
-/Names [(table.652) 14251 0 R (table.653) 14253 0 R (table.654) 14254 0 R (table.655) 14261 0 R (table.656) 14263 0 R (table.657) 14264 0 R]
-/Limits [(table.652) (table.657)]
->> endobj
-21073 0 obj <<
-/Names [(table.658) 14266 0 R (table.659) 14267 0 R (table.66) 3819 0 R (table.660) 14269 0 R (table.661) 14270 0 R (table.662) 14278 0 R]
-/Limits [(table.658) (table.662)]
->> endobj
-21074 0 obj <<
-/Names [(table.663) 14279 0 R (table.664) 14281 0 R (table.665) 14282 0 R (table.666) 14284 0 R (table.667) 14285 0 R (table.668) 14295 0 R]
-/Limits [(table.663) (table.668)]
->> endobj
-21075 0 obj <<
-/Names [(table.669) 14296 0 R (table.67) 3821 0 R (table.670) 14298 0 R (table.671) 14299 0 R (table.672) 14301 0 R (table.673) 14302 0 R]
-/Limits [(table.669) (table.673)]
->> endobj
-21076 0 obj <<
-/Names [(table.674) 14310 0 R (table.675) 14312 0 R (table.676) 14314 0 R (table.677) 14316 0 R (table.678) 14318 0 R (table.679) 14319 0 R]
-/Limits [(table.674) (table.679)]
->> endobj
-21077 0 obj <<
-/Names [(table.68) 3822 0 R (table.680) 14332 0 R (table.681) 14333 0 R (table.682) 14335 0 R (table.683) 14336 0 R (table.684) 14339 0 R]
-/Limits [(table.68) (table.684)]
->> endobj
-21078 0 obj <<
-/Names [(table.685) 14353 0 R (table.686) 14356 0 R (table.687) 14357 0 R (table.688) 14359 0 R (table.689) 14360 0 R (table.69) 3824 0 R]
-/Limits [(table.685) (table.69)]
->> endobj
-21079 0 obj <<
-/Names [(table.690) 14370 0 R (table.691) 14371 0 R (table.692) 14373 0 R (table.693) 14374 0 R (table.694) 14376 0 R (table.695) 14385 0 R]
-/Limits [(table.690) (table.695)]
->> endobj
-21080 0 obj <<
-/Names [(table.696) 14386 0 R (table.697) 14388 0 R (table.698) 14390 0 R (table.699) 14401 0 R (table.7) 2495 0 R (table.70) 3832 0 R]
-/Limits [(table.696) (table.70)]
->> endobj
-21081 0 obj <<
-/Names [(table.700) 14402 0 R (table.701) 14404 0 R (table.702) 14405 0 R (table.703) 14407 0 R (table.704) 14421 0 R (table.705) 14422 0 R]
-/Limits [(table.700) (table.705)]
->> endobj
-21082 0 obj <<
-/Names [(table.706) 14424 0 R (table.707) 14426 0 R (table.708) 14439 0 R (table.709) 14440 0 R (table.71) 3834 0 R (table.710) 14442 0 R]
-/Limits [(table.706) (table.710)]
->> endobj
-21083 0 obj <<
-/Names [(table.711) 14443 0 R (table.712) 14833 0 R (table.713) 14843 0 R (table.714) 14845 0 R (table.715) 14846 0 R (table.716) 14850 0 R]
-/Limits [(table.711) (table.716)]
->> endobj
-21084 0 obj <<
-/Names [(table.717) 14851 0 R (table.718) 14858 0 R (table.719) 14860 0 R (table.72) 3835 0 R (table.720) 14862 0 R (table.721) 14876 0 R]
-/Limits [(table.717) (table.721)]
->> endobj
-21085 0 obj <<
-/Names [(table.722) 14877 0 R (table.723) 14991 0 R (table.724) 14992 0 R (table.725) 14994 0 R (table.726) 14996 0 R (table.727) 15151 0 R]
-/Limits [(table.722) (table.727)]
->> endobj
-21086 0 obj <<
-/Names [(table.728) 15153 0 R (table.729) 15156 0 R (table.73) 3837 0 R (table.730) 15168 0 R (table.731) 15611 0 R (table.732) 15614 0 R]
-/Limits [(table.728) (table.732)]
->> endobj
-21087 0 obj <<
-/Names [(table.733) 15616 0 R (table.734) 15617 0 R (table.735) 15625 0 R (table.736) 15626 0 R (table.737) 15628 0 R (table.738) 15629 0 R]
-/Limits [(table.733) (table.738)]
->> endobj
-21088 0 obj <<
-/Names [(table.739) 15631 0 R (table.74) 3838 0 R (table.740) 15637 0 R (table.741) 15639 0 R (table.742) 15640 0 R (table.743) 15642 0 R]
-/Limits [(table.739) (table.743)]
->> endobj
-21089 0 obj <<
-/Names [(table.744) 15643 0 R (table.745) 15646 0 R (table.746) 15653 0 R (table.747) 15656 0 R (table.748) 15658 0 R (table.749) 15660 0 R]
-/Limits [(table.744) (table.749)]
->> endobj
-21090 0 obj <<
-/Names [(table.75) 3840 0 R (table.750) 15666 0 R (table.751) 15668 0 R (table.752) 15669 0 R (table.753) 15671 0 R (table.754) 15672 0 R]
-/Limits [(table.75) (table.754)]
->> endobj
-21091 0 obj <<
-/Names [(table.755) 15679 0 R (table.756) 15680 0 R (table.757) 15682 0 R (table.758) 15684 0 R (table.759) 15691 0 R (table.76) 3841 0 R]
-/Limits [(table.755) (table.76)]
->> endobj
-21092 0 obj <<
-/Names [(table.760) 15693 0 R (table.761) 15695 0 R (table.762) 15697 0 R (table.763) 15699 0 R (table.764) 15708 0 R (table.765) 15710 0 R]
-/Limits [(table.760) (table.765)]
->> endobj
-21093 0 obj <<
-/Names [(table.766) 15712 0 R (table.767) 15713 0 R (table.768) 15715 0 R (table.769) 15716 0 R (table.77) 3852 0 R (table.770) 15723 0 R]
-/Limits [(table.766) (table.770)]
->> endobj
-21094 0 obj <<
-/Names [(table.771) 15724 0 R (table.772) 15726 0 R (table.773) 15728 0 R (table.774) 15729 0 R (table.775) 15731 0 R (table.776) 15732 0 R]
-/Limits [(table.771) (table.776)]
->> endobj
-21095 0 obj <<
-/Names [(table.777) 15742 0 R (table.778) 15743 0 R (table.779) 15745 0 R (table.78) 3853 0 R (table.780) 15746 0 R (table.781) 15748 0 R]
-/Limits [(table.777) (table.781)]
->> endobj
-21096 0 obj <<
-/Names [(table.782) 15749 0 R (table.783) 15751 0 R (table.784) 15760 0 R (table.785) 15763 0 R (table.786) 15765 0 R (table.787) 15774 0 R]
-/Limits [(table.782) (table.787)]
->> endobj
-21097 0 obj <<
-/Names [(table.788) 15775 0 R (table.789) 15777 0 R (table.79) 3855 0 R (table.790) 15778 0 R (table.791) 15780 0 R (table.792) 15792 0 R]
-/Limits [(table.788) (table.792)]
->> endobj
-21098 0 obj <<
-/Names [(table.793) 15795 0 R (table.794) 15796 0 R (table.795) 15799 0 R (table.796) 15800 0 R (table.797) 15811 0 R (table.798) 15812 0 R]
-/Limits [(table.793) (table.798)]
->> endobj
-21099 0 obj <<
-/Names [(table.799) 15814 0 R (table.8) 2502 0 R (table.80) 3856 0 R (table.800) 15815 0 R (table.801) 15817 0 R (table.802) 15818 0 R]
-/Limits [(table.799) (table.802)]
->> endobj
-21100 0 obj <<
-/Names [(table.803) 15832 0 R (table.804) 15833 0 R (table.805) 15846 0 R (table.806) 15847 0 R (table.807) 15849 0 R (table.808) 15850 0 R]
-/Limits [(table.803) (table.808)]
->> endobj
-21101 0 obj <<
-/Names [(table.809) 15865 0 R (table.81) 3866 0 R (table.810) 15866 0 R (table.811) 15868 0 R (table.812) 15871 0 R (table.813) 15872 0 R]
-/Limits [(table.809) (table.813)]
->> endobj
-21102 0 obj <<
-/Names [(table.814) 15883 0 R (table.815) 15884 0 R (table.816) 15888 0 R (table.817) 15890 0 R (table.818) 16604 0 R (table.819) 16607 0 R]
-/Limits [(table.814) (table.819)]
->> endobj
-21103 0 obj <<
-/Names [(table.82) 3867 0 R (table.820) 16608 0 R (table.821) 16610 0 R (table.822) 16611 0 R (table.823) 16618 0 R (table.824) 16619 0 R]
-/Limits [(table.82) (table.824)]
->> endobj
-21104 0 obj <<
-/Names [(table.825) 16621 0 R (table.826) 16622 0 R (table.827) 16624 0 R (table.828) 16632 0 R (table.829) 16634 0 R (table.83) 3869 0 R]
-/Limits [(table.825) (table.83)]
->> endobj
-21105 0 obj <<
-/Names [(table.830) 16636 0 R (table.831) 16638 0 R (table.832) 16640 0 R (table.833) 16642 0 R (table.834) 16649 0 R (table.835) 16651 0 R]
-/Limits [(table.830) (table.835)]
->> endobj
-21106 0 obj <<
-/Names [(table.836) 16652 0 R (table.837) 16654 0 R (table.838) 16655 0 R (table.839) 16665 0 R (table.84) 3870 0 R (table.840) 16666 0 R]
-/Limits [(table.836) (table.840)]
->> endobj
-21107 0 obj <<
-/Names [(table.841) 16668 0 R (table.842) 16669 0 R (table.843) 16671 0 R (table.844) 16677 0 R (table.845) 16679 0 R (table.846) 16681 0 R]
-/Limits [(table.841) (table.846)]
->> endobj
-21108 0 obj <<
-/Names [(table.847) 16683 0 R (table.848) 16690 0 R (table.849) 16691 0 R (table.85) 3872 0 R (table.850) 16693 0 R (table.851) 16695 0 R]
-/Limits [(table.847) (table.851)]
->> endobj
-21109 0 obj <<
-/Names [(table.852) 16697 0 R (table.853) 16698 0 R (table.854) 16700 0 R (table.855) 16701 0 R (table.856) 16708 0 R (table.857) 16709 0 R]
-/Limits [(table.852) (table.857)]
->> endobj
-21110 0 obj <<
-/Names [(table.858) 16711 0 R (table.859) 16712 0 R (table.86) 3874 0 R (table.860) 16714 0 R (table.861) 16715 0 R (table.862) 16722 0 R]
-/Limits [(table.858) (table.862)]
->> endobj
-21111 0 obj <<
-/Names [(table.863) 16723 0 R (table.864) 16725 0 R (table.865) 16727 0 R (table.866) 16729 0 R (table.867) 16730 0 R (table.868) 16737 0 R]
-/Limits [(table.863) (table.868)]
->> endobj
-21112 0 obj <<
-/Names [(table.869) 16738 0 R (table.87) 3883 0 R (table.870) 16740 0 R (table.871) 16741 0 R (table.872) 16743 0 R (table.873) 16753 0 R]
-/Limits [(table.869) (table.873)]
->> endobj
-21113 0 obj <<
-/Names [(table.874) 16755 0 R (table.875) 16757 0 R (table.876) 16758 0 R (table.877) 16760 0 R (table.878) 16761 0 R (table.879) 16763 0 R]
-/Limits [(table.874) (table.879)]
->> endobj
-21114 0 obj <<
-/Names [(table.88) 3885 0 R (table.880) 16774 0 R (table.881) 16776 0 R (table.882) 16778 0 R (table.883) 16780 0 R (table.884) 16781 0 R]
-/Limits [(table.88) (table.884)]
->> endobj
-21115 0 obj <<
-/Names [(table.885) 16792 0 R (table.886) 16793 0 R (table.887) 16795 0 R (table.888) 16796 0 R (table.889) 16798 0 R (table.89) 3887 0 R]
-/Limits [(table.885) (table.89)]
->> endobj
-21116 0 obj <<
-/Names [(table.890) 16799 0 R (table.891) 16811 0 R (table.892) 16812 0 R (table.893) 16815 0 R (table.894) 16816 0 R (table.895) 16818 0 R]
-/Limits [(table.890) (table.895)]
->> endobj
-21117 0 obj <<
-/Names [(table.896) 16828 0 R (table.897) 16830 0 R (table.898) 16831 0 R (table.899) 16833 0 R (table.9) 2503 0 R (table.90) 3889 0 R]
-/Limits [(table.896) (table.90)]
->> endobj
-21118 0 obj <<
-/Names [(table.900) 16834 0 R (table.901) 16836 0 R (table.902) 16846 0 R (table.903) 16847 0 R (table.904) 16849 0 R (table.905) 16865 0 R]
-/Limits [(table.900) (table.905)]
->> endobj
-21119 0 obj <<
-/Names [(table.906) 16867 0 R (table.907) 16868 0 R (table.908) 16871 0 R (table.909) 16872 0 R (table.91) 3900 0 R (table.910) 16874 0 R]
-/Limits [(table.906) (table.910)]
->> endobj
-21120 0 obj <<
-/Names [(table.911) 16888 0 R (table.912) 16890 0 R (table.913) 16891 0 R (table.914) 16894 0 R (table.915) 16895 0 R (table.916) 16897 0 R]
-/Limits [(table.911) (table.916)]
->> endobj
-21121 0 obj <<
-/Names [(table.917) 16905 0 R (table.918) 16907 0 R (table.919) 16908 0 R (table.92) 3901 0 R (table.920) 16910 0 R (table.921) 16911 0 R]
-/Limits [(table.917) (table.921)]
->> endobj
-21122 0 obj <<
-/Names [(table.922) 16924 0 R (table.923) 16926 0 R (table.924) 16927 0 R (table.925) 16929 0 R (table.926) 16931 0 R (table.927) 16946 0 R]
-/Limits [(table.922) (table.927)]
->> endobj
-21123 0 obj <<
-/Names [(table.928) 16947 0 R (table.929) 16949 0 R (table.93) 3903 0 R (table.930) 16950 0 R (table.931) 16959 0 R (table.932) 16962 0 R]
-/Limits [(table.928) (table.932)]
->> endobj
-21124 0 obj <<
-/Names [(table.933) 16964 0 R (table.934) 16972 0 R (table.935) 16974 0 R (table.936) 17200 0 R (table.937) 17245 0 R (table.938) 17276 0 R]
-/Limits [(table.933) (table.938)]
->> endobj
-21125 0 obj <<
-/Names [(table.939) 17338 0 R (table.94) 3904 0 R (table.940) 17352 0 R (table.941) 17474 0 R (table.942) 17567 0 R (table.943) 17569 0 R]
-/Limits [(table.939) (table.943)]
->> endobj
-21126 0 obj <<
-/Names [(table.95) 3906 0 R (table.96) 3907 0 R (table.97) 3916 0 R (table.98) 3917 0 R (table.99) 3919 0 R]
-/Limits [(table.95) (table.99)]
->> endobj
-21127 0 obj <<
-/Kids [20062 0 R 20063 0 R 20064 0 R 20065 0 R 20066 0 R 20067 0 R]
-/Limits [(Doc-Start) (classParma__Polyhedra__Library_1_1BD__Shape_a1f8426558552c358c30b6263c758fe51)]
->> endobj
-21128 0 obj <<
-/Kids [20068 0 R 20069 0 R 20070 0 R 20071 0 R 20072 0 R 20073 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a20814dec69b3a6602b70a9ad50db9b2a) (classParma__Polyhedra__Library_1_1BD__Shape_a641b55dd6c26bce06bd8041b38aec873)]
->> endobj
-21129 0 obj <<
-/Kids [20074 0 R 20075 0 R 20076 0 R 20077 0 R 20078 0 R 20079 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a668cbd7cea86f47c4e2b303468083712) (classParma__Polyhedra__Library_1_1BD__Shape_aaf0d15460d44b410c5a223d13b447b1a)]
->> endobj
-21130 0 obj <<
-/Kids [20080 0 R 20081 0 R 20082 0 R 20083 0 R 20084 0 R 20085 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ab054f67fb31ea4e860dd7c24c0b56676) (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a67b4e0eba7692bced073431cd3cc22ae)]
->> endobj
-21131 0 obj <<
-/Kids [20086 0 R 20087 0 R 20088 0 R 20089 0 R 20090 0 R 20091 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a6ab41afc79135511037718442fcad4d4) (classParma__Polyhedra__Library_1_1Box_a339a341a2f7d60de83e4feb3e8986558)]
->> endobj
-21132 0 obj <<
-/Kids [20092 0 R 20093 0 R 20094 0 R 20095 0 R 20096 0 R 20097 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a36a9d0801d846225758faab4be3cc7e4) (classParma__Polyhedra__Library_1_1Box_a857138d532c5352b43623e6b5e5a629b)]
->> endobj
-21133 0 obj <<
-/Kids [20098 0 R 20099 0 R 20100 0 R 20101 0 R 20102 0 R 20103 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a87e906459b095e23114ee8f0025086cb) (classParma__Polyhedra__Library_1_1Box_ac86971c152fbb8d2d486d7396ad6b142)]
->> endobj
-21134 0 obj <<
-/Kids [20104 0 R 20105 0 R 20106 0 R 20107 0 R 20108 0 R 20109 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Box_ac8a2f81fc1c5b99600d406300792119f) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_abed774daa9ed3c470c7fd237bf40e28c)]
->> endobj
-21135 0 obj <<
-/Kids [20110 0 R 20111 0 R 20112 0 R 20113 0 R 20114 0 R 20115 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) (classParma__Polyhedra__Library_1_1C__Polyhedron_a6f581bf46ab0488f444977453ba2ea2d)]
->> endobj
-21136 0 obj <<
-/Kids [20116 0 R 20117 0 R 20118 0 R 20119 0 R 20120 0 R 20121 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) (classParma__Polyhedra__Library_1_1Checked__Number_a1c255ab3c82434e261f010d0590810c0)]
->> endobj
-21137 0 obj <<
-/Kids [20122 0 R 20123 0 R 20124 0 R 20125 0 R 20126 0 R 20127 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a1ccbc462776ddeb1052d4c4fb35da65a) (classParma__Polyhedra__Library_1_1Checked__Number_a65b1cc4ac0c0c8a2efcbf3d36d4ac0ac)]
->> endobj
-21138 0 obj <<
-/Kids [20128 0 R 20129 0 R 20130 0 R 20131 0 R 20132 0 R 20133 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a6957dba3dbf92459a364893d7ecfb897) (classParma__Polyhedra__Library_1_1Checked__Number_ab2c74f72a54a0b6a18906c124de256a9)]
->> endobj
-21139 0 obj <<
-/Kids [20134 0 R 20135 0 R 20136 0 R 20137 0 R 20138 0 R 20139 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ab45faf2ccad8057c7b27e0c999eb063b) (classParma__Polyhedra__Library_1_1Concrete__Expression__Common)]
->> endobj
-21140 0 obj <<
-/Kids [20140 0 R 20141 0 R 20142 0 R 20143 0 R 20144 0 R 20145 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a603e2a97c5ea7e4e81bad4464a9aba2b) (classParma__Polyhedra__Library_1_1Congruence__System_a0a4f8e3f3469f021594ea9311c21aadd)]
->> endobj
-21141 0 obj <<
-/Kids [20146 0 R 20147 0 R 20148 0 R 20149 0 R 20150 0 R 20151 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a0bf701759fc56f8fb215c273e53b46ae) (classParma__Polyhedra__Library_1_1Congruence__System_ae4a4890ceb257496b788e0d31dbf6d7f)]
->> endobj
-21142 0 obj <<
-/Kids [20152 0 R 20153 0 R 20154 0 R 20155 0 R 20156 0 R 20157 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_aea6d543c90be52299d6ffc57fc9ba5d1) (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735)]
->> endobj
-21143 0 obj <<
-/Kids [20158 0 R 20159 0 R 20160 0 R 20161 0 R 20162 0 R 20163 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Congruence_a94b3624c208219e401569cd289049b38) (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a79a27720fc3f7a3e989f10ebdb6b2800)]
->> endobj
-21144 0 obj <<
-/Kids [20164 0 R 20165 0 R 20166 0 R 20167 0 R 20168 0 R 20169 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a843388f4bb21a15bf18a841237a8a617) (classParma__Polyhedra__Library_1_1Constraint__System_a78a4d5f5e4702a16d6aae656293ec7ad)]
->> endobj
-21145 0 obj <<
-/Kids [20170 0 R 20171 0 R 20172 0 R 20173 0 R 20174 0 R 20175 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e)]
->> endobj
-21146 0 obj <<
-/Kids [20176 0 R 20177 0 R 20178 0 R 20179 0 R 20180 0 R 20181 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_a405f3dfb1b620defbadb0b2f103b8f28) (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6aba7491a8ba26958c3e27bed23b7eef1a7e)]
->> endobj
-21147 0 obj <<
-/Kids [20182 0 R 20183 0 R 20184 0 R 20185 0 R 20186 0 R 20187 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abab5b32713c840499d9e29facf95a17f41) (classParma__Polyhedra__Library_1_1Determinate_a5fc66875bf8b6a2838028fc66ce3f2be)]
->> endobj
-21148 0 obj <<
-/Kids [20188 0 R 20189 0 R 20190 0 R 20191 0 R 20192 0 R 20193 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Determinate_a6c75bb083e814ae12c8df6a2cd63fda6) (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_aadb6d4669e8aa852e2f3d11e40c8c211)]
->> endobj
-21149 0 obj <<
-/Kids [20194 0 R 20195 0 R 20196 0 R 20197 0 R 20198 0 R 20199 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) (classParma__Polyhedra__Library_1_1GMP__Integer_a84565fd9471a52f83618d0d5ce461c3c)]
->> endobj
-21150 0 obj <<
-/Kids [20200 0 R 20201 0 R 20202 0 R 20203 0 R 20204 0 R 20205 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a952922658abcdfb880fcf0a8483c9620) (classParma__Polyhedra__Library_1_1Generator__System_aa33b89d7143376193110dde339707b0d)]
->> endobj
-21151 0 obj <<
-/Kids [20206 0 R 20207 0 R 20208 0 R 20209 0 R 20210 0 R 20211 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3) (classParma__Polyhedra__Library_1_1Generator_a475ead5848d02d5c879bb96f22ce1cc5)]
->> endobj
-21152 0 obj <<
-/Kids [20212 0 R 20213 0 R 20214 0 R 20215 0 R 20216 0 R 20217 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_a4904a65badd41facf2b598f09eb726a5) (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e)]
->> endobj
-21153 0 obj <<
-/Kids [20218 0 R 20219 0 R 20220 0 R 20221 0 R 20222 0 R 20223 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) (classParma__Polyhedra__Library_1_1Grid__Generator)]
->> endobj
-21154 0 obj <<
-/Kids [20224 0 R 20225 0 R 20226 0 R 20227 0 R 20228 0 R 20229 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System) (classParma__Polyhedra__Library_1_1Grid__Generator__System_aa09a1ddc7936a5377e838cb44610548e)]
->> endobj
-21155 0 obj <<
-/Kids [20230 0 R 20231 0 R 20232 0 R 20233 0 R 20234 0 R 20235 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) (classParma__Polyhedra__Library_1_1Grid__Generator_a41227446c918730e97998799bfe04da6)]
->> endobj
-21156 0 obj <<
-/Kids [20236 0 R 20237 0 R 20238 0 R 20239 0 R 20240 0 R 20241 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) (classParma__Polyhedra__Library_1_1Grid__Generator_acdc0aeddab3d98e336719f42e6e5b06c)]
->> endobj
-21157 0 obj <<
-/Kids [20242 0 R 20243 0 R 20244 0 R 20245 0 R 20246 0 R 20247 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) (classParma__Polyhedra__Library_1_1Grid_a2d4a31320735e93af31c8d2cc7e78329)]
->> endobj
-21158 0 obj <<
-/Kids [20248 0 R 20249 0 R 20250 0 R 20251 0 R 20252 0 R 20253 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0b193ae8bc) (classParma__Polyhedra__Library_1_1Grid_a8d2cc5d18d050975101f2860f2919da8)]
->> endobj
-21159 0 obj <<
-/Kids [20254 0 R 20255 0 R 20256 0 R 20257 0 R 20258 0 R 20259 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814eaad72499) (classParma__Polyhedra__Library_1_1Grid_ae8d42fcd571a9c9d64f0e7ffe67e995e)]
->> endobj
-21160 0 obj <<
-/Kids [20260 0 R 20261 0 R 20262 0 R 20263 0 R 20264 0 R 20265 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549bdba93fede) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ac3cebc5fc52879ce539aaf78bf585f1e)]
->> endobj
-21161 0 obj <<
-/Kids [20266 0 R 20267 0 R 20268 0 R 20269 0 R 20270 0 R 20271 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1EList__Iterator_ad2f6505da3244481da4a207f727147c0) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7e590338a93fccabc6523fde997f8d73)]
->> endobj
-21162 0 obj <<
-/Kids [20272 0 R 20273 0 R 20274 0 R 20275 0 R 20276 0 R 20277 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a80ba640b32901e54e1d60d760c74fa90) (classParma__Polyhedra__Library_1_1Linear__Expression)]
->> endobj
-21163 0 obj <<
-/Kids [20278 0 R 20279 0 R 20280 0 R 20281 0 R 20282 0 R 20283 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) (classParma__Polyhedra__Library_1_1Linear__Expression_a15c22785d951d9f8f6ec2e14f07b2dc1)]
->> endobj
-21164 0 obj <<
-/Kids [20284 0 R 20285 0 R 20286 0 R 20287 0 R 20288 0 R 20289 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) (classParma__Polyhedra__Library_1_1Linear__Expression_a6e35bc42eb22008e842e81b150eeab6f)]
->> endobj
-21165 0 obj <<
-/Kids [20290 0 R 20291 0 R 20292 0 R 20293 0 R 20294 0 R 20295 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) (classParma__Polyhedra__Library_1_1Linear__Expression_ac9ef23a57b1e85eb8c0e905b16feda93)]
->> endobj
-21166 0 obj <<
-/Kids [20296 0 R 20297 0 R 20298 0 R 20299 0 R 20300 0 R 20301 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_aca00917f32f160b28b9870beb5ce5f8d) (classParma__Polyhedra__Library_1_1Linear__Form_a4d12b35e0dd97b7319d536f692f50150)]
->> endobj
-21167 0 obj <<
-/Kids [20302 0 R 20303 0 R 20304 0 R 20305 0 R 20306 0 R 20307 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a4dbb70694594789f52b71511d56b9e30) (classParma__Polyhedra__Library_1_1Linear__Form_ad326f3bec17300467f639ba345f2dd22)]
->> endobj
-21168 0 obj <<
-/Kids [20308 0 R 20309 0 R 20310 0 R 20311 0 R 20312 0 R 20313 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_adb40b5b841a737ad5e7b8924335eef3a) (classParma__Polyhedra__Library_1_1MIP__Problem_a3a010e69cfabe1a026ee21f7639207e3)]
->> endobj
-21169 0 obj <<
-/Kids [20314 0 R 20315 0 R 20316 0 R 20317 0 R 20318 0 R 20319 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a598c3862b9f9e720061d5d3e87995840)]
->> endobj
-21170 0 obj <<
-/Kids [20320 0 R 20321 0 R 20322 0 R 20323 0 R 20324 0 R 20325 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a7ff53437f750fd3ce8781dd441d7c304) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d1677ef76c939ca2025722d2ee249e2)]
->> endobj
-21171 0 obj <<
-/Kids [20326 0 R 20327 0 R 20328 0 R 20329 0 R 20330 0 R 20331 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a0d4db6f54c7332e1a2e0bc85e16ba176) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a508d952b878adf2e55d70d6ca1e64d04)]
->> endobj
-21172 0 obj <<
-/Kids [20332 0 R 20333 0 R 20334 0 R 20335 0 R 20336 0 R 20337 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a50ca45a8cfc186aa1fd90160b643d766) (classParma__Polyhedra__Library_1_1Octagonal__Shape_aafdd0083c1c10d49e06f4718a826ae1b)]
->> endobj
-21173 0 obj <<
-/Kids [20338 0 R 20339 0 R 20340 0 R 20341 0 R 20342 0 R 20343 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ab030b7a285d9b5e6470263311eeb87f4) (classParma__Polyhedra__Library_1_1Octagonal__Shape_af2c70f89a472f7fa34ba64817693776a)]
->> endobj
-21174 0 obj <<
-/Kids [20344 0 R 20345 0 R 20346 0 R 20347 0 R 20348 0 R 20349 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_af3135ed5b5cb04d1e8a54fa9be77b90f) (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece)]
->> endobj
-21175 0 obj <<
-/Kids [20350 0 R 20351 0 R 20352 0 R 20353 0 R 20354 0 R 20355 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) (classParma__Polyhedra__Library_1_1PIP__Problem_ad750455647786b5cb28c5422930f0ec0)]
->> endobj
-21176 0 obj <<
-/Kids [20356 0 R 20357 0 R 20358 0 R 20359 0 R 20360 0 R 20361 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a6cb598653a5f9e64b0b42b88e5a9b5d1)]
->> endobj
-21177 0 obj <<
-/Kids [20362 0 R 20363 0 R 20364 0 R 20365 0 R 20366 0 R 20367 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44)]
->> endobj
-21178 0 obj <<
-/Kids [20368 0 R 20369 0 R 20370 0 R 20371 0 R 20372 0 R 20373 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3b90222087f1b165953960beac112e72)]
->> endobj
-21179 0 obj <<
-/Kids [20374 0 R 20375 0 R 20376 0 R 20377 0 R 20378 0 R 20379 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3be7b3a04406453631aef24b817565a5) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9be620ae3a5afa0a9d5b89acfdae387a)]
->> endobj
-21180 0 obj <<
-/Kids [20380 0 R 20381 0 R 20382 0 R 20383 0 R 20384 0 R 20385 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa2a8683afd33a1d57db43c9db16de1f5) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af633b1416a118a2ac3146ec4a4fd4298)]
->> endobj
-21181 0 obj <<
-/Kids [20386 0 R 20387 0 R 20388 0 R 20389 0 R 20390 0 R 20391 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afaf0bc4f0e0a036dbc3852b3e4490243) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a741a79dbeefc27764532e2be63120ff8)]
->> endobj
-21182 0 obj <<
-/Kids [20392 0 R 20393 0 R 20394 0 R 20395 0 R 20396 0 R 20397 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a754588d1a8135cb2944e9cc0fd6ec486) (classParma__Polyhedra__Library_1_1Pointset__Powerset_acf126b6efb5eac0ac1b9228cfca539f4)]
->> endobj
-21183 0 obj <<
-/Kids [20398 0 R 20399 0 R 20400 0 R 20401 0 R 20402 0 R 20403 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_acfb675b82bc6829361d1647880a2e00d) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa4b60ce3ac62aee15faac1b5035fdb4d)]
->> endobj
-21184 0 obj <<
-/Kids [20404 0 R 20405 0 R 20406 0 R 20407 0 R 20408 0 R 20409 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab92b75d150bd5fbfc03cadec75d59e0f) (classParma__Polyhedra__Library_1_1Polyhedron_a281b8db6a8e0014ab2c41dd15f8c0708)]
->> endobj
-21185 0 obj <<
-/Kids [20410 0 R 20411 0 R 20412 0 R 20413 0 R 20414 0 R 20415 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a2bf7987a6ee3547c1e125e83e432ee2a) (classParma__Polyhedra__Library_1_1Polyhedron_a8132d1a9b329271fb4f7faeb59c89c39)]
->> endobj
-21186 0 obj <<
-/Kids [20416 0 R 20417 0 R 20418 0 R 20419 0 R 20420 0 R 20421 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a858e0030826ee6c29545a934166874ef) (classParma__Polyhedra__Library_1_1Polyhedron_acf531d280805472a54c22fed0f689932)]
->> endobj
-21187 0 obj <<
-/Kids [20422 0 R 20423 0 R 20424 0 R 20425 0 R 20426 0 R 20427 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) (classParma__Polyhedra__Library_1_1Powerset_a277ba920e188477bb301196b19d63770)]
->> endobj
-21188 0 obj <<
-/Kids [20428 0 R 20429 0 R 20430 0 R 20431 0 R 20432 0 R 20433 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_a2edf5fe7007a3e91a404546ca2f2d98c) (classParma__Polyhedra__Library_1_1Powerset_adef4c62b5cdf5186801c592cc62dccea)]
->> endobj
-21189 0 obj <<
-/Kids [20434 0 R 20435 0 R 20436 0 R 20437 0 R 20438 0 R 20439 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Powerset_ae006881831b298f0af5031e99df2bc6f) (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a0ca3ec141b70de5ebcbf18d22aa1242f)]
->> endobj
-21190 0 obj <<
-/Kids [20440 0 R 20441 0 R 20442 0 R 20443 0 R 20444 0 R 20445 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) (classParma__Polyhedra__Library_1_1Variables__Set_aca3690ce9d77a85740cdf8a508edf127)]
->> endobj
-21191 0 obj <<
-/Kids [20446 0 R 20447 0 R 20448 0 R 20449 0 R 20450 0 R 20451 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371) (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e)]
->> endobj
-21192 0 obj <<
-/Kids [20452 0 R 20453 0 R 20454 0 R 20455 0 R 20456 0 R 20457 0 R]
-/Limits [(group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416)]
->> endobj
-21193 0 obj <<
-/Kids [20458 0 R 20459 0 R 20460 0 R 20461 0 R 20462 0 R 20463 0 R]
-/Limits [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4194f750c76fb24d6e5930e1696076c4)]
->> endobj
-21194 0 obj <<
-/Kids [20464 0 R 20465 0 R 20466 0 R 20467 0 R 20468 0 R 20469 0 R]
-/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) (index_BCCetal02)]
->> endobj
-21195 0 obj <<
-/Kids [20470 0 R 20471 0 R 20472 0 R 20473 0 R 20474 0 R 20475 0 R]
-/Limits [(index_BDHetal05) (index_BMPZ12a)]
->> endobj
-21196 0 obj <<
-/Kids [20476 0 R 20477 0 R 20478 0 R 20479 0 R 20480 0 R 20481 0 R]
-/Limits [(index_BMPZ12b) (index_Fea88)]
->> endobj
-21197 0 obj <<
-/Kids [20482 0 R 20483 0 R 20484 0 R 20485 0 R 20486 0 R 20487 0 R]
-/Limits [(index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) (index_HPWT01)]
->> endobj
-21198 0 obj <<
-/Kids [20488 0 R 20489 0 R 20490 0 R 20491 0 R 20492 0 R 20493 0 R]
-/Limits [(index_Hal79) (index_Operations_on_Convex_Polyhedra)]
->> endobj
-21199 0 obj <<
-/Kids [20494 0 R 20495 0 R 20496 0 R 20497 0 R 20498 0 R 20499 0 R]
-/Limits [(index_PS98) (index_Weakly_Relational_Shapes)]
->> endobj
-21200 0 obj <<
-/Kids [20500 0 R 20501 0 R 20502 0 R 20503 0 R 20504 0 R 20505 0 R]
-/Limits [(index_Wey35) (index_sect_rational_grids)]
->> endobj
-21201 0 obj <<
-/Kids [20506 0 R 20507 0 R 20508 0 R 20509 0 R 20510 0 R 20511 0 R]
-/Limits [(index_use_of_library) (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a468389fd24e4a478d296cbcf6b104eb0)]
->> endobj
-21202 0 obj <<
-/Kids [20512 0 R 20513 0 R 20514 0 R 20515 0 R 20516 0 R 20517 0 R]
-/Limits [(namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c) (page.120)]
->> endobj
-21203 0 obj <<
-/Kids [20518 0 R 20519 0 R 20520 0 R 20521 0 R 20522 0 R 20523 0 R]
-/Limits [(page.121) (page.151)]
->> endobj
-21204 0 obj <<
-/Kids [20524 0 R 20525 0 R 20526 0 R 20527 0 R 20528 0 R 20529 0 R]
-/Limits [(page.152) (page.182)]
->> endobj
-21205 0 obj <<
-/Kids [20530 0 R 20531 0 R 20532 0 R 20533 0 R 20534 0 R 20535 0 R]
-/Limits [(page.183) (page.214)]
->> endobj
-21206 0 obj <<
-/Kids [20536 0 R 20537 0 R 20538 0 R 20539 0 R 20540 0 R 20541 0 R]
-/Limits [(page.215) (page.246)]
->> endobj
-21207 0 obj <<
-/Kids [20542 0 R 20543 0 R 20544 0 R 20545 0 R 20546 0 R 20547 0 R]
-/Limits [(page.247) (page.279)]
->> endobj
-21208 0 obj <<
-/Kids [20548 0 R 20549 0 R 20550 0 R 20551 0 R 20552 0 R 20553 0 R]
-/Limits [(page.28) (page.309)]
->> endobj
-21209 0 obj <<
-/Kids [20554 0 R 20555 0 R 20556 0 R 20557 0 R 20558 0 R 20559 0 R]
-/Limits [(page.31) (page.340)]
->> endobj
-21210 0 obj <<
-/Kids [20560 0 R 20561 0 R 20562 0 R 20563 0 R 20564 0 R 20565 0 R]
-/Limits [(page.341) (page.371)]
->> endobj
-21211 0 obj <<
-/Kids [20566 0 R 20567 0 R 20568 0 R 20569 0 R 20570 0 R 20571 0 R]
-/Limits [(page.372) (page.400)]
->> endobj
-21212 0 obj <<
-/Kids [20572 0 R 20573 0 R 20574 0 R 20575 0 R 20576 0 R 20577 0 R]
-/Limits [(page.401) (page.431)]
->> endobj
-21213 0 obj <<
-/Kids [20578 0 R 20579 0 R 20580 0 R 20581 0 R 20582 0 R 20583 0 R]
-/Limits [(page.432) (page.463)]
->> endobj
-21214 0 obj <<
-/Kids [20584 0 R 20585 0 R 20586 0 R 20587 0 R 20588 0 R 20589 0 R]
-/Limits [(page.464) (page.495)]
->> endobj
-21215 0 obj <<
-/Kids [20590 0 R 20591 0 R 20592 0 R 20593 0 R 20594 0 R 20595 0 R]
-/Limits [(page.496) (page.527)]
->> endobj
-21216 0 obj <<
-/Kids [20596 0 R 20597 0 R 20598 0 R 20599 0 R 20600 0 R 20601 0 R]
-/Limits [(page.528) (page.56)]
->> endobj
-21217 0 obj <<
-/Kids [20602 0 R 20603 0 R 20604 0 R 20605 0 R 20606 0 R 20607 0 R]
-/Limits [(page.560) (page.592)]
->> endobj
-21218 0 obj <<
-/Kids [20608 0 R 20609 0 R 20610 0 R 20611 0 R 20612 0 R 20613 0 R]
-/Limits [(page.593) (page.89)]
->> endobj
-21219 0 obj <<
-/Kids [20614 0 R 20615 0 R 20616 0 R 20617 0 R 20618 0 R 20619 0 R]
-/Limits [(page.9) (paragraph.10.13.3.20)]
->> endobj
-21220 0 obj <<
-/Kids [20620 0 R 20621 0 R 20622 0 R 20623 0 R 20624 0 R 20625 0 R]
-/Limits [(paragraph.10.13.3.21) (paragraph.10.13.3.53)]
->> endobj
-21221 0 obj <<
-/Kids [20626 0 R 20627 0 R 20628 0 R 20629 0 R 20630 0 R 20631 0 R]
-/Limits [(paragraph.10.13.3.54) (paragraph.10.21.4.12)]
->> endobj
-21222 0 obj <<
-/Kids [20632 0 R 20633 0 R 20634 0 R 20635 0 R 20636 0 R 20637 0 R]
-/Limits [(paragraph.10.21.4.2) (paragraph.10.22.4.3)]
->> endobj
-21223 0 obj <<
-/Kids [20638 0 R 20639 0 R 20640 0 R 20641 0 R 20642 0 R 20643 0 R]
-/Limits [(paragraph.10.22.4.4) (paragraph.10.3.2.1)]
->> endobj
-21224 0 obj <<
-/Kids [20644 0 R 20645 0 R 20646 0 R 20647 0 R 20648 0 R 20649 0 R]
-/Limits [(paragraph.10.3.3.1) (paragraph.10.32.6.18)]
->> endobj
-21225 0 obj <<
-/Kids [20650 0 R 20651 0 R 20652 0 R 20653 0 R 20654 0 R 20655 0 R]
-/Limits [(paragraph.10.32.6.19) (paragraph.10.32.6.7)]
->> endobj
-21226 0 obj <<
-/Kids [20656 0 R 20657 0 R 20658 0 R 20659 0 R 20660 0 R 20661 0 R]
-/Limits [(paragraph.10.32.6.8) (paragraph.10.4.3.13)]
->> endobj
-21227 0 obj <<
-/Kids [20662 0 R 20663 0 R 20664 0 R 20665 0 R 20666 0 R 20667 0 R]
-/Limits [(paragraph.10.4.3.14) (paragraph.10.4.3.46)]
->> endobj
-21228 0 obj <<
-/Kids [20668 0 R 20669 0 R 20670 0 R 20671 0 R 20672 0 R 20673 0 R]
-/Limits [(paragraph.10.4.3.47) (paragraph.10.4.4.19)]
->> endobj
-21229 0 obj <<
-/Kids [20674 0 R 20675 0 R 20676 0 R 20677 0 R 20678 0 R 20679 0 R]
-/Limits [(paragraph.10.4.4.2) (paragraph.10.47.5.2)]
->> endobj
-21230 0 obj <<
-/Kids [20680 0 R 20681 0 R 20682 0 R 20683 0 R 20684 0 R 20685 0 R]
-/Limits [(paragraph.10.47.5.3) (paragraph.10.47.6.35)]
->> endobj
-21231 0 obj <<
-/Kids [20686 0 R 20687 0 R 20688 0 R 20689 0 R 20690 0 R 20691 0 R]
-/Limits [(paragraph.10.47.6.36) (paragraph.10.51.2.12)]
->> endobj
-21232 0 obj <<
-/Kids [20692 0 R 20693 0 R 20694 0 R 20695 0 R 20696 0 R 20697 0 R]
-/Limits [(paragraph.10.51.2.2) (paragraph.10.51.3.34)]
->> endobj
-21233 0 obj <<
-/Kids [20698 0 R 20699 0 R 20700 0 R 20701 0 R 20702 0 R 20703 0 R]
-/Limits [(paragraph.10.51.3.35) (paragraph.10.51.4.3)]
->> endobj
-21234 0 obj <<
-/Kids [20704 0 R 20705 0 R 20706 0 R 20707 0 R 20708 0 R 20709 0 R]
-/Limits [(paragraph.10.51.4.4) (paragraph.10.53.6.7)]
->> endobj
-21235 0 obj <<
-/Kids [20710 0 R 20711 0 R 20712 0 R 20713 0 R 20714 0 R 20715 0 R]
-/Limits [(paragraph.10.53.6.8) (paragraph.10.63.2.10)]
->> endobj
-21236 0 obj <<
-/Kids [20716 0 R 20717 0 R 20718 0 R 20719 0 R 20720 0 R 20721 0 R]
-/Limits [(paragraph.10.63.2.11) (paragraph.10.63.4.16)]
->> endobj
-21237 0 obj <<
-/Kids [20722 0 R 20723 0 R 20724 0 R 20725 0 R 20726 0 R 20727 0 R]
-/Limits [(paragraph.10.63.4.17) (paragraph.10.63.4.49)]
->> endobj
-21238 0 obj <<
-/Kids [20728 0 R 20729 0 R 20730 0 R 20731 0 R 20732 0 R 20733 0 R]
-/Limits [(paragraph.10.63.4.5) (paragraph.10.64.4.23)]
->> endobj
-21239 0 obj <<
-/Kids [20734 0 R 20735 0 R 20736 0 R 20737 0 R 20738 0 R 20739 0 R]
-/Limits [(paragraph.10.64.4.24) (paragraph.10.64.4.56)]
->> endobj
-21240 0 obj <<
-/Kids [20740 0 R 20741 0 R 20742 0 R 20743 0 R 20744 0 R 20745 0 R]
-/Limits [(paragraph.10.64.4.6) (paragraph.10.67.2.5)]
->> endobj
-21241 0 obj <<
-/Kids [20746 0 R 20747 0 R 20748 0 R 20749 0 R 20750 0 R 20751 0 R]
-/Limits [(paragraph.10.67.2.6) (paragraph.10.70.3.27)]
->> endobj
-21242 0 obj <<
-/Kids [20752 0 R 20753 0 R 20754 0 R 20755 0 R 20756 0 R 20757 0 R]
-/Limits [(paragraph.10.70.3.28) (paragraph.10.70.3.6)]
->> endobj
-21243 0 obj <<
-/Kids [20758 0 R 20759 0 R 20760 0 R 20761 0 R 20762 0 R 20763 0 R]
-/Limits [(paragraph.10.70.3.60) (paragraph.10.71.3.1)]
->> endobj
-21244 0 obj <<
-/Kids [20764 0 R 20765 0 R 20766 0 R 20767 0 R 20768 0 R 20769 0 R]
-/Limits [(paragraph.10.71.3.2) (paragraph.10.72.3.3)]
->> endobj
-21245 0 obj <<
-/Kids [20770 0 R 20771 0 R 20772 0 R 20773 0 R 20774 0 R 20775 0 R]
-/Limits [(paragraph.10.72.3.30) (paragraph.10.76.3.2)]
->> endobj
-21246 0 obj <<
-/Kids [20776 0 R 20777 0 R 20778 0 R 20779 0 R 20780 0 R 20781 0 R]
-/Limits [(paragraph.10.76.4.1) (paragraph.10.79.3.10)]
->> endobj
-21247 0 obj <<
-/Kids [20782 0 R 20783 0 R 20784 0 R 20785 0 R 20786 0 R 20787 0 R]
-/Limits [(paragraph.10.79.3.11) (paragraph.10.79.3.43)]
->> endobj
-21248 0 obj <<
-/Kids [20788 0 R 20789 0 R 20790 0 R 20791 0 R 20792 0 R 20793 0 R]
-/Limits [(paragraph.10.79.3.44) (paragraph.10.8.2.6)]
->> endobj
-21249 0 obj <<
-/Kids [20794 0 R 20795 0 R 20796 0 R 20797 0 R 20798 0 R 20799 0 R]
-/Limits [(paragraph.10.8.2.7) (paragraph.10.8.3.39)]
->> endobj
-21250 0 obj <<
-/Kids [20800 0 R 20801 0 R 20802 0 R 20803 0 R 20804 0 R 20805 0 R]
-/Limits [(paragraph.10.8.3.4) (paragraph.10.8.4.14)]
->> endobj
-21251 0 obj <<
-/Kids [20806 0 R 20807 0 R 20808 0 R 20809 0 R 20810 0 R 20811 0 R]
-/Limits [(paragraph.10.8.4.15) (paragraph.10.82.2.2)]
->> endobj
-21252 0 obj <<
-/Kids [20812 0 R 20813 0 R 20814 0 R 20815 0 R 20816 0 R 20817 0 R]
-/Limits [(paragraph.10.82.2.3) (paragraph.10.82.3.37)]
->> endobj
-21253 0 obj <<
-/Kids [20818 0 R 20819 0 R 20820 0 R 20821 0 R 20822 0 R 20823 0 R]
-/Limits [(paragraph.10.82.3.38) (paragraph.10.82.3.7)]
->> endobj
-21254 0 obj <<
-/Kids [20824 0 R 20825 0 R 20826 0 R 20827 0 R 20828 0 R 20829 0 R]
-/Limits [(paragraph.10.82.3.70) (paragraph.10.9.2.2)]
->> endobj
-21255 0 obj <<
-/Kids [20830 0 R 20831 0 R 20832 0 R 20833 0 R 20834 0 R 20835 0 R]
-/Limits [(paragraph.10.9.2.3) (paragraph.8.1.4.5)]
->> endobj
-21256 0 obj <<
-/Kids [20836 0 R 20837 0 R 20838 0 R 20839 0 R 20840 0 R 20841 0 R]
-/Limits [(paragraph.8.1.4.6) (paragraph.9.1.3.1)]
->> endobj
-21257 0 obj <<
-/Kids [20842 0 R 20843 0 R 20844 0 R 20845 0 R 20846 0 R 20847 0 R]
-/Limits [(paragraph.9.1.3.2) (section*.124)]
->> endobj
-21258 0 obj <<
-/Kids [20848 0 R 20849 0 R 20850 0 R 20851 0 R 20852 0 R 20853 0 R]
-/Limits [(section*.125) (section*.157)]
->> endobj
-21259 0 obj <<
-/Kids [20854 0 R 20855 0 R 20856 0 R 20857 0 R 20858 0 R 20859 0 R]
-/Limits [(section*.158) (section*.19)]
->> endobj
-21260 0 obj <<
-/Kids [20860 0 R 20861 0 R 20862 0 R 20863 0 R 20864 0 R 20865 0 R]
-/Limits [(section*.190) (section*.221)]
->> endobj
-21261 0 obj <<
-/Kids [20866 0 R 20867 0 R 20868 0 R 20869 0 R 20870 0 R 20871 0 R]
-/Limits [(section*.222) (section*.254)]
->> endobj
-21262 0 obj <<
-/Kids [20872 0 R 20873 0 R 20874 0 R 20875 0 R 20876 0 R 20877 0 R]
-/Limits [(section*.255) (section*.287)]
->> endobj
-21263 0 obj <<
-/Kids [20878 0 R 20879 0 R 20880 0 R 20881 0 R 20882 0 R 20883 0 R]
-/Limits [(section*.288) (section*.52)]
->> endobj
-21264 0 obj <<
-/Kids [20884 0 R 20885 0 R 20886 0 R 20887 0 R 20888 0 R 20889 0 R]
-/Limits [(section*.53) (section*.85)]
->> endobj
-21265 0 obj <<
-/Kids [20890 0 R 20891 0 R 20892 0 R 20893 0 R 20894 0 R 20895 0 R]
-/Limits [(section*.86) (subsection.1.1)]
->> endobj
-21266 0 obj <<
-/Kids [20896 0 R 20897 0 R 20898 0 R 20899 0 R 20900 0 R 20901 0 R]
-/Limits [(subsection.1.10) (subsection.10.28)]
->> endobj
-21267 0 obj <<
-/Kids [20902 0 R 20903 0 R 20904 0 R 20905 0 R 20906 0 R 20907 0 R]
-/Limits [(subsection.10.29) (subsection.10.60)]
->> endobj
-21268 0 obj <<
-/Kids [20908 0 R 20909 0 R 20910 0 R 20911 0 R 20912 0 R 20913 0 R]
-/Limits [(subsection.10.61) (subsection.10.93)]
->> endobj
-21269 0 obj <<
-/Kids [20914 0 R 20915 0 R 20916 0 R 20917 0 R 20918 0 R 20919 0 R]
-/Limits [(subsection.10.94) (subsubsection.1.15.2)]
->> endobj
-21270 0 obj <<
-/Kids [20920 0 R 20921 0 R 20922 0 R 20923 0 R 20924 0 R 20925 0 R]
-/Limits [(subsubsection.1.15.3) (subsubsection.1.6.7)]
->> endobj
-21271 0 obj <<
-/Kids [20926 0 R 20927 0 R 20928 0 R 20929 0 R 20930 0 R 20931 0 R]
-/Limits [(subsubsection.1.6.8) (subsubsection.10.21.1)]
->> endobj
-21272 0 obj <<
-/Kids [20932 0 R 20933 0 R 20934 0 R 20935 0 R 20936 0 R 20937 0 R]
-/Limits [(subsubsection.10.21.2) (subsubsection.10.32.3)]
->> endobj
-21273 0 obj <<
-/Kids [20938 0 R 20939 0 R 20940 0 R 20941 0 R 20942 0 R 20943 0 R]
-/Limits [(subsubsection.10.32.4) (subsubsection.10.47.1)]
->> endobj
-21274 0 obj <<
-/Kids [20944 0 R 20945 0 R 20946 0 R 20947 0 R 20948 0 R 20949 0 R]
-/Limits [(subsubsection.10.47.2) (subsubsection.10.57.1)]
->> endobj
-21275 0 obj <<
-/Kids [20950 0 R 20951 0 R 20952 0 R 20953 0 R 20954 0 R 20955 0 R]
-/Limits [(subsubsection.10.58.1) (subsubsection.10.70.3)]
->> endobj
-21276 0 obj <<
-/Kids [20956 0 R 20957 0 R 20958 0 R 20959 0 R 20960 0 R 20961 0 R]
-/Limits [(subsubsection.10.70.4) (subsubsection.10.82.2)]
->> endobj
-21277 0 obj <<
-/Kids [20962 0 R 20963 0 R 20964 0 R 20965 0 R 20966 0 R 20967 0 R]
-/Limits [(subsubsection.10.82.3) (subsubsection.8.1.3)]
->> endobj
-21278 0 obj <<
-/Kids [20968 0 R 20969 0 R 20970 0 R 20971 0 R 20972 0 R 20973 0 R]
-/Limits [(subsubsection.8.1.4) (table.121)]
->> endobj
-21279 0 obj <<
-/Kids [20974 0 R 20975 0 R 20976 0 R 20977 0 R 20978 0 R 20979 0 R]
-/Limits [(table.122) (table.154)]
->> endobj
-21280 0 obj <<
-/Kids [20980 0 R 20981 0 R 20982 0 R 20983 0 R 20984 0 R 20985 0 R]
-/Limits [(table.155) (table.187)]
->> endobj
-21281 0 obj <<
-/Kids [20986 0 R 20987 0 R 20988 0 R 20989 0 R 20990 0 R 20991 0 R]
-/Limits [(table.188) (table.219)]
->> endobj
-21282 0 obj <<
-/Kids [20992 0 R 20993 0 R 20994 0 R 20995 0 R 20996 0 R 20997 0 R]
-/Limits [(table.22) (table.251)]
->> endobj
-21283 0 obj <<
-/Kids [20998 0 R 20999 0 R 21000 0 R 21001 0 R 21002 0 R 21003 0 R]
-/Limits [(table.252) (table.284)]
->> endobj
-21284 0 obj <<
-/Kids [21004 0 R 21005 0 R 21006 0 R 21007 0 R 21008 0 R 21009 0 R]
-/Limits [(table.285) (table.316)]
->> endobj
-21285 0 obj <<
-/Kids [21010 0 R 21011 0 R 21012 0 R 21013 0 R 21014 0 R 21015 0 R]
-/Limits [(table.317) (table.349)]
->> endobj
-21286 0 obj <<
-/Kids [21016 0 R 21017 0 R 21018 0 R 21019 0 R 21020 0 R 21021 0 R]
-/Limits [(table.35) (table.381)]
->> endobj
-21287 0 obj <<
-/Kids [21022 0 R 21023 0 R 21024 0 R 21025 0 R 21026 0 R 21027 0 R]
-/Limits [(table.382) (table.413)]
->> endobj
-21288 0 obj <<
-/Kids [21028 0 R 21029 0 R 21030 0 R 21031 0 R 21032 0 R 21033 0 R]
-/Limits [(table.414) (table.446)]
->> endobj
-21289 0 obj <<
-/Kids [21034 0 R 21035 0 R 21036 0 R 21037 0 R 21038 0 R 21039 0 R]
-/Limits [(table.447) (table.479)]
->> endobj
-21290 0 obj <<
-/Kids [21040 0 R 21041 0 R 21042 0 R 21043 0 R 21044 0 R 21045 0 R]
-/Limits [(table.48) (table.510)]
->> endobj
-21291 0 obj <<
-/Kids [21046 0 R 21047 0 R 21048 0 R 21049 0 R 21050 0 R 21051 0 R]
-/Limits [(table.511) (table.543)]
->> endobj
-21292 0 obj <<
-/Kids [21052 0 R 21053 0 R 21054 0 R 21055 0 R 21056 0 R 21057 0 R]
-/Limits [(table.544) (table.576)]
->> endobj
-21293 0 obj <<
-/Kids [21058 0 R 21059 0 R 21060 0 R 21061 0 R 21062 0 R 21063 0 R]
-/Limits [(table.577) (table.608)]
->> endobj
-21294 0 obj <<
-/Kids [21064 0 R 21065 0 R 21066 0 R 21067 0 R 21068 0 R 21069 0 R]
-/Limits [(table.609) (table.640)]
->> endobj
-21295 0 obj <<
-/Kids [21070 0 R 21071 0 R 21072 0 R 21073 0 R 21074 0 R 21075 0 R]
-/Limits [(table.641) (table.673)]
->> endobj
-21296 0 obj <<
-/Kids [21076 0 R 21077 0 R 21078 0 R 21079 0 R 21080 0 R 21081 0 R]
-/Limits [(table.674) (table.705)]
->> endobj
-21297 0 obj <<
-/Kids [21082 0 R 21083 0 R 21084 0 R 21085 0 R 21086 0 R 21087 0 R]
-/Limits [(table.706) (table.738)]
->> endobj
-21298 0 obj <<
-/Kids [21088 0 R 21089 0 R 21090 0 R 21091 0 R 21092 0 R 21093 0 R]
-/Limits [(table.739) (table.770)]
->> endobj
-21299 0 obj <<
-/Kids [21094 0 R 21095 0 R 21096 0 R 21097 0 R 21098 0 R 21099 0 R]
-/Limits [(table.771) (table.802)]
->> endobj
-21300 0 obj <<
-/Kids [21100 0 R 21101 0 R 21102 0 R 21103 0 R 21104 0 R 21105 0 R]
-/Limits [(table.803) (table.835)]
->> endobj
-21301 0 obj <<
-/Kids [21106 0 R 21107 0 R 21108 0 R 21109 0 R 21110 0 R 21111 0 R]
-/Limits [(table.836) (table.868)]
->> endobj
-21302 0 obj <<
-/Kids [21112 0 R 21113 0 R 21114 0 R 21115 0 R 21116 0 R 21117 0 R]
-/Limits [(table.869) (table.90)]
->> endobj
-21303 0 obj <<
-/Kids [21118 0 R 21119 0 R 21120 0 R 21121 0 R 21122 0 R 21123 0 R]
-/Limits [(table.900) (table.932)]
->> endobj
-21304 0 obj <<
-/Kids [21124 0 R 21125 0 R 21126 0 R]
-/Limits [(table.933) (table.99)]
->> endobj
-21305 0 obj <<
-/Kids [21127 0 R 21128 0 R 21129 0 R 21130 0 R 21131 0 R 21132 0 R]
-/Limits [(Doc-Start) (classParma__Polyhedra__Library_1_1Box_a857138d532c5352b43623e6b5e5a629b)]
->> endobj
-21306 0 obj <<
-/Kids [21133 0 R 21134 0 R 21135 0 R 21136 0 R 21137 0 R 21138 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Box_a87e906459b095e23114ee8f0025086cb) (classParma__Polyhedra__Library_1_1Checked__Number_ab2c74f72a54a0b6a18906c124de256a9)]
->> endobj
-21307 0 obj <<
-/Kids [21139 0 R 21140 0 R 21141 0 R 21142 0 R 21143 0 R 21144 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ab45faf2ccad8057c7b27e0c999eb063b) (classParma__Polyhedra__Library_1_1Constraint__System_a78a4d5f5e4702a16d6aae656293ec7ad)]
->> endobj
-21308 0 obj <<
-/Kids [21145 0 R 21146 0 R 21147 0 R 21148 0 R 21149 0 R 21150 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) (classParma__Polyhedra__Library_1_1Generator__System_aa33b89d7143376193110dde339707b0d)]
->> endobj
-21309 0 obj <<
-/Kids [21151 0 R 21152 0 R 21153 0 R 21154 0 R 21155 0 R 21156 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3) (classParma__Polyhedra__Library_1_1Grid__Generator_acdc0aeddab3d98e336719f42e6e5b06c)]
->> endobj
-21310 0 obj <<
-/Kids [21157 0 R 21158 0 R 21159 0 R 21160 0 R 21161 0 R 21162 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) (classParma__Polyhedra__Library_1_1Linear__Expression)]
->> endobj
-21311 0 obj <<
-/Kids [21163 0 R 21164 0 R 21165 0 R 21166 0 R 21167 0 R 21168 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) (classParma__Polyhedra__Library_1_1MIP__Problem_a3a010e69cfabe1a026ee21f7639207e3)]
->> endobj
-21312 0 obj <<
-/Kids [21169 0 R 21170 0 R 21171 0 R 21172 0 R 21173 0 R 21174 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece)]
->> endobj
-21313 0 obj <<
-/Kids [21175 0 R 21176 0 R 21177 0 R 21178 0 R 21179 0 R 21180 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af633b1416a118a2ac3146ec4a4fd4298)]
->> endobj
-21314 0 obj <<
-/Kids [21181 0 R 21182 0 R 21183 0 R 21184 0 R 21185 0 R 21186 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afaf0bc4f0e0a036dbc3852b3e4490243) (classParma__Polyhedra__Library_1_1Polyhedron_acf531d280805472a54c22fed0f689932)]
->> endobj
-21315 0 obj <<
-/Kids [21187 0 R 21188 0 R 21189 0 R 21190 0 R 21191 0 R 21192 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416)]
->> endobj
-21316 0 obj <<
-/Kids [21193 0 R 21194 0 R 21195 0 R 21196 0 R 21197 0 R 21198 0 R]
-/Limits [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) (index_Operations_on_Convex_Polyhedra)]
->> endobj
-21317 0 obj <<
-/Kids [21199 0 R 21200 0 R 21201 0 R 21202 0 R 21203 0 R 21204 0 R]
-/Limits [(index_PS98) (page.182)]
->> endobj
-21318 0 obj <<
-/Kids [21205 0 R 21206 0 R 21207 0 R 21208 0 R 21209 0 R 21210 0 R]
-/Limits [(page.183) (page.371)]
->> endobj
-21319 0 obj <<
-/Kids [21211 0 R 21212 0 R 21213 0 R 21214 0 R 21215 0 R 21216 0 R]
-/Limits [(page.372) (page.56)]
->> endobj
-21320 0 obj <<
-/Kids [21217 0 R 21218 0 R 21219 0 R 21220 0 R 21221 0 R 21222 0 R]
-/Limits [(page.560) (paragraph.10.22.4.3)]
->> endobj
-21321 0 obj <<
-/Kids [21223 0 R 21224 0 R 21225 0 R 21226 0 R 21227 0 R 21228 0 R]
-/Limits [(paragraph.10.22.4.4) (paragraph.10.4.4.19)]
->> endobj
-21322 0 obj <<
-/Kids [21229 0 R 21230 0 R 21231 0 R 21232 0 R 21233 0 R 21234 0 R]
-/Limits [(paragraph.10.4.4.2) (paragraph.10.53.6.7)]
->> endobj
-21323 0 obj <<
-/Kids [21235 0 R 21236 0 R 21237 0 R 21238 0 R 21239 0 R 21240 0 R]
-/Limits [(paragraph.10.53.6.8) (paragraph.10.67.2.5)]
->> endobj
-21324 0 obj <<
-/Kids [21241 0 R 21242 0 R 21243 0 R 21244 0 R 21245 0 R 21246 0 R]
-/Limits [(paragraph.10.67.2.6) (paragraph.10.79.3.10)]
->> endobj
-21325 0 obj <<
-/Kids [21247 0 R 21248 0 R 21249 0 R 21250 0 R 21251 0 R 21252 0 R]
-/Limits [(paragraph.10.79.3.11) (paragraph.10.82.3.37)]
->> endobj
-21326 0 obj <<
-/Kids [21253 0 R 21254 0 R 21255 0 R 21256 0 R 21257 0 R 21258 0 R]
-/Limits [(paragraph.10.82.3.38) (section*.157)]
->> endobj
-21327 0 obj <<
-/Kids [21259 0 R 21260 0 R 21261 0 R 21262 0 R 21263 0 R 21264 0 R]
-/Limits [(section*.158) (section*.85)]
->> endobj
-21328 0 obj <<
-/Kids [21265 0 R 21266 0 R 21267 0 R 21268 0 R 21269 0 R 21270 0 R]
-/Limits [(section*.86) (subsubsection.1.6.7)]
->> endobj
-21329 0 obj <<
-/Kids [21271 0 R 21272 0 R 21273 0 R 21274 0 R 21275 0 R 21276 0 R]
-/Limits [(subsubsection.1.6.8) (subsubsection.10.82.2)]
->> endobj
-21330 0 obj <<
-/Kids [21277 0 R 21278 0 R 21279 0 R 21280 0 R 21281 0 R 21282 0 R]
-/Limits [(subsubsection.10.82.3) (table.251)]
->> endobj
-21331 0 obj <<
-/Kids [21283 0 R 21284 0 R 21285 0 R 21286 0 R 21287 0 R 21288 0 R]
-/Limits [(table.252) (table.446)]
->> endobj
-21332 0 obj <<
-/Kids [21289 0 R 21290 0 R 21291 0 R 21292 0 R 21293 0 R 21294 0 R]
-/Limits [(table.447) (table.640)]
->> endobj
-21333 0 obj <<
-/Kids [21295 0 R 21296 0 R 21297 0 R 21298 0 R 21299 0 R 21300 0 R]
-/Limits [(table.641) (table.835)]
->> endobj
-21334 0 obj <<
-/Kids [21301 0 R 21302 0 R 21303 0 R 21304 0 R]
-/Limits [(table.836) (table.99)]
->> endobj
-21335 0 obj <<
-/Kids [21305 0 R 21306 0 R 21307 0 R 21308 0 R 21309 0 R 21310 0 R]
-/Limits [(Doc-Start) (classParma__Polyhedra__Library_1_1Linear__Expression)]
->> endobj
-21336 0 obj <<
-/Kids [21311 0 R 21312 0 R 21313 0 R 21314 0 R 21315 0 R 21316 0 R]
-/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) (index_Operations_on_Convex_Polyhedra)]
->> endobj
-21337 0 obj <<
-/Kids [21317 0 R 21318 0 R 21319 0 R 21320 0 R 21321 0 R 21322 0 R]
-/Limits [(index_PS98) (paragraph.10.53.6.7)]
->> endobj
-21338 0 obj <<
-/Kids [21323 0 R 21324 0 R 21325 0 R 21326 0 R 21327 0 R 21328 0 R]
-/Limits [(paragraph.10.53.6.8) (subsubsection.1.6.7)]
->> endobj
-21339 0 obj <<
-/Kids [21329 0 R 21330 0 R 21331 0 R 21332 0 R 21333 0 R 21334 0 R]
-/Limits [(subsubsection.1.6.8) (table.99)]
->> endobj
-21340 0 obj <<
-/Kids [21335 0 R 21336 0 R 21337 0 R 21338 0 R 21339 0 R]
-/Limits [(Doc-Start) (table.99)]
->> endobj
-21341 0 obj <<
-/Dests 21340 0 R
->> endobj
-21342 0 obj <<
-/Type /Catalog
-/Pages 20060 0 R
-/Outlines 20061 0 R
-/Names 21341 0 R
-/PageMode/UseOutlines/PageLabels<</Nums[0<</S/D>>4<</S/r>>8<</S/D>>]>>
-/OpenAction 521 0 R
->> endobj
-21343 0 obj <<
-/Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords()
-/CreationDate (D:20120628125818+02'00')
-/ModDate (D:20120628125818+02'00')
-/Trapped /False
-/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0)
->> endobj
-xref
-0 21344
-0000000000 65535 f 
-0000000015 00000 n 
-0000104884 00000 n 
-0004884302 00000 n 
-0000000060 00000 n 
-0000000248 00000 n 
-0000105053 00000 n 
-0004884232 00000 n 
-0000000298 00000 n 
-0000000415 00000 n 
-0000124180 00000 n 
-0004884148 00000 n 
-0000000465 00000 n 
-0000000595 00000 n 
-0000124298 00000 n 
-0004884062 00000 n 
-0000000646 00000 n 
-0000000786 00000 n 
-0000130224 00000 n 
-0004883976 00000 n 
-0000000837 00000 n 
-0000000947 00000 n 
-0000140427 00000 n 
-0004883890 00000 n 
-0000000998 00000 n 
-0000001209 00000 n 
-0000154503 00000 n 
-0004883804 00000 n 
-0000001260 00000 n 
-0000001446 00000 n 
-0000192198 00000 n 
-0004883718 00000 n 
-0000001497 00000 n 
-0000001625 00000 n 
-0000197392 00000 n 
-0004883632 00000 n 
-0000001676 00000 n 
-0000001826 00000 n 
-0000202766 00000 n 
-0004883546 00000 n 
-0000001877 00000 n 
-0000001977 00000 n 
-0000213174 00000 n 
-0004883460 00000 n 
-0000002029 00000 n 
-0000002205 00000 n 
-0000235319 00000 n 
-0004883374 00000 n 
-0000002257 00000 n 
-0000002415 00000 n 
-0000235609 00000 n 
-0004883288 00000 n 
-0000002467 00000 n 
-0000002701 00000 n 
-0000241230 00000 n 
-0004883202 00000 n 
-0000002753 00000 n 
-0000002929 00000 n 
-0000254957 00000 n 
-0004883116 00000 n 
-0000002981 00000 n 
-0000003215 00000 n 
-0000264052 00000 n 
-0004883030 00000 n 
-0000003267 00000 n 
-0000003385 00000 n 
-0000268769 00000 n 
-0004882957 00000 n 
-0000003437 00000 n 
-0000003524 00000 n 
-0000315213 00000 n 
-0004882868 00000 n 
-0000003570 00000 n 
-0000003736 00000 n 
-0000350055 00000 n 
-0004882778 00000 n 
-0000003782 00000 n 
-0000003968 00000 n 
-0000369430 00000 n 
-0004882651 00000 n 
-0000004014 00000 n 
-0000004104 00000 n 
-0000369487 00000 n 
-0004882590 00000 n 
-0000004155 00000 n 
-0000004217 00000 n 
-0000375268 00000 n 
-0004882463 00000 n 
-0000004263 00000 n 
-0000004368 00000 n 
-0000375325 00000 n 
-0004882402 00000 n 
-0000004419 00000 n 
-0000004519 00000 n 
-0000375382 00000 n 
-0004882274 00000 n 
-0000004565 00000 n 
-0000004650 00000 n 
-0000375439 00000 n 
-0004882212 00000 n 
-0000004701 00000 n 
-0000004807 00000 n 
-0000394447 00000 n 
-0004882079 00000 n 
-0000004854 00000 n 
-0000004940 00000 n 
-0000394505 00000 n 
-0004882014 00000 n 
-0000004992 00000 n 
-0000005073 00000 n 
-0000448262 00000 n 
-0004881880 00000 n 
-0000005120 00000 n 
-0000005251 00000 n 
-0000448379 00000 n 
-0004881815 00000 n 
-0000005303 00000 n 
-0000005447 00000 n 
-0000570534 00000 n 
-0004881681 00000 n 
-0000005494 00000 n 
-0000005640 00000 n 
-0000570651 00000 n 
-0004881602 00000 n 
-0000005692 00000 n 
-0000005947 00000 n 
-0000662300 00000 n 
-0004881509 00000 n 
-0000005999 00000 n 
-0000006327 00000 n 
-0000666039 00000 n 
-0004881430 00000 n 
-0000006379 00000 n 
-0000006528 00000 n 
-0000668345 00000 n 
-0004881309 00000 n 
-0000006576 00000 n 
-0000006702 00000 n 
-0000668462 00000 n 
-0004881230 00000 n 
-0000006755 00000 n 
-0000007113 00000 n 
-0000668638 00000 n 
-0004881137 00000 n 
-0000007166 00000 n 
-0000007666 00000 n 
-0000668873 00000 n 
-0004881044 00000 n 
-0000007719 00000 n 
-0000008148 00000 n 
-0000692326 00000 n 
-0004880951 00000 n 
-0000008201 00000 n 
-0000008568 00000 n 
-0000926047 00000 n 
-0004880858 00000 n 
-0000008621 00000 n 
-0000008959 00000 n 
-0000935715 00000 n 
-0004880765 00000 n 
-0000009012 00000 n 
-0000009335 00000 n 
-0000935891 00000 n 
-0004880672 00000 n 
-0000009388 00000 n 
-0000009853 00000 n 
-0000936359 00000 n 
-0004880579 00000 n 
-0000009906 00000 n 
-0000010255 00000 n 
-0001159455 00000 n 
-0004880486 00000 n 
-0000010308 00000 n 
-0000010616 00000 n 
-0001199508 00000 n 
-0004880393 00000 n 
-0000010670 00000 n 
-0000011295 00000 n 
-0001212035 00000 n 
-0004880300 00000 n 
-0000011349 00000 n 
-0000011662 00000 n 
-0001216927 00000 n 
-0004880207 00000 n 
-0000011716 00000 n 
-0000012171 00000 n 
-0001217162 00000 n 
-0004880114 00000 n 
-0000012225 00000 n 
-0000012665 00000 n 
-0001332350 00000 n 
-0004880021 00000 n 
-0000012719 00000 n 
-0000013107 00000 n 
-0001332644 00000 n 
-0004879928 00000 n 
-0000013161 00000 n 
-0000013534 00000 n 
-0001336746 00000 n 
-0004879835 00000 n 
-0000013588 00000 n 
-0000013966 00000 n 
-0001337040 00000 n 
-0004879742 00000 n 
-0000014020 00000 n 
-0000014355 00000 n 
-0001337334 00000 n 
-0004879649 00000 n 
-0000014409 00000 n 
-0000014752 00000 n 
-0001380591 00000 n 
-0004879556 00000 n 
-0000014806 00000 n 
-0000015291 00000 n 
-0001381178 00000 n 
-0004879463 00000 n 
-0000015345 00000 n 
-0000015716 00000 n 
-0001398669 00000 n 
-0004879370 00000 n 
-0000015770 00000 n 
-0000016065 00000 n 
-0001462378 00000 n 
-0004879277 00000 n 
-0000016119 00000 n 
-0000016452 00000 n 
-0001499821 00000 n 
-0004879184 00000 n 
-0000016506 00000 n 
-0000016966 00000 n 
-0001514697 00000 n 
-0004879091 00000 n 
-0000017020 00000 n 
-0000017386 00000 n 
-0001527515 00000 n 
-0004878998 00000 n 
-0000017440 00000 n 
-0000017925 00000 n 
-0001540989 00000 n 
-0004878905 00000 n 
-0000017979 00000 n 
-0000018395 00000 n 
-0001549903 00000 n 
-0004878812 00000 n 
-0000018449 00000 n 
-0000018865 00000 n 
-0001558894 00000 n 
-0004878719 00000 n 
-0000018919 00000 n 
-0000019305 00000 n 
-0001566401 00000 n 
-0004878626 00000 n 
-0000019359 00000 n 
-0000019798 00000 n 
-0001575060 00000 n 
-0004878533 00000 n 
-0000019852 00000 n 
-0000020374 00000 n 
-0001591886 00000 n 
-0004878440 00000 n 
-0000020428 00000 n 
-0000021073 00000 n 
-0001618627 00000 n 
-0004878347 00000 n 
-0000021127 00000 n 
-0000021422 00000 n 
-0001710997 00000 n 
-0004878254 00000 n 
-0000021476 00000 n 
-0000021809 00000 n 
-0001733655 00000 n 
-0004878161 00000 n 
-0000021863 00000 n 
-0000022277 00000 n 
-0001738285 00000 n 
-0004878068 00000 n 
-0000022331 00000 n 
-0000022791 00000 n 
-0001747428 00000 n 
-0004877975 00000 n 
-0000022845 00000 n 
-0000023239 00000 n 
-0001763109 00000 n 
-0004877882 00000 n 
-0000023293 00000 n 
-0000023948 00000 n 
-0001799535 00000 n 
-0004877789 00000 n 
-0000024002 00000 n 
-0000024647 00000 n 
-0001816738 00000 n 
-0004877696 00000 n 
-0000024701 00000 n 
-0000025126 00000 n 
-0001816973 00000 n 
-0004877603 00000 n 
-0000025180 00000 n 
-0000025661 00000 n 
-0001827360 00000 n 
-0004877510 00000 n 
-0000025715 00000 n 
-0000026194 00000 n 
-0001847903 00000 n 
-0004877417 00000 n 
-0000026248 00000 n 
-0000026775 00000 n 
-0001852560 00000 n 
-0004877324 00000 n 
-0000026829 00000 n 
-0000027195 00000 n 
-0001852735 00000 n 
-0004877231 00000 n 
-0000027249 00000 n 
-0000027757 00000 n 
-0001854433 00000 n 
-0004877138 00000 n 
-0000027811 00000 n 
-0000028408 00000 n 
-0001892872 00000 n 
-0004877045 00000 n 
-0000028462 00000 n 
-0000028958 00000 n 
-0001904807 00000 n 
-0004876952 00000 n 
-0000029012 00000 n 
-0000029302 00000 n 
-0002038216 00000 n 
-0004876859 00000 n 
-0000029356 00000 n 
-0000029684 00000 n 
-0002068525 00000 n 
-0004876766 00000 n 
-0000029738 00000 n 
-0000030147 00000 n 
-0002076892 00000 n 
-0004876673 00000 n 
-0000030201 00000 n 
-0000030504 00000 n 
-0002092033 00000 n 
-0004876580 00000 n 
-0000030558 00000 n 
-0000030823 00000 n 
-0002296672 00000 n 
-0004876487 00000 n 
-0000030877 00000 n 
-0000031205 00000 n 
-0002307466 00000 n 
-0004876394 00000 n 
-0000031259 00000 n 
-0000031577 00000 n 
-0002394139 00000 n 
-0004876301 00000 n 
-0000031631 00000 n 
-0000031987 00000 n 
-0002434737 00000 n 
-0004876208 00000 n 
-0000032041 00000 n 
-0000032364 00000 n 
-0002439417 00000 n 
-0004876115 00000 n 
-0000032418 00000 n 
-0000032828 00000 n 
-0002447008 00000 n 
-0004876022 00000 n 
-0000032882 00000 n 
-0000033475 00000 n 
-0002462003 00000 n 
-0004875929 00000 n 
-0000033529 00000 n 
-0000033987 00000 n 
-0002462366 00000 n 
-0004875836 00000 n 
-0000034041 00000 n 
-0000034369 00000 n 
-0002467228 00000 n 
-0004875743 00000 n 
-0000034423 00000 n 
-0000034893 00000 n 
-0002467468 00000 n 
-0004875650 00000 n 
-0000034947 00000 n 
-0000035379 00000 n 
-0002492049 00000 n 
-0004875557 00000 n 
-0000035433 00000 n 
-0000035766 00000 n 
-0002502040 00000 n 
-0004875464 00000 n 
-0000035820 00000 n 
-0000036153 00000 n 
-0002638548 00000 n 
-0004875371 00000 n 
-0000036207 00000 n 
-0000036589 00000 n 
-0002726775 00000 n 
-0004875278 00000 n 
-0000036643 00000 n 
-0000036946 00000 n 
-0002781200 00000 n 
-0004875185 00000 n 
-0000037000 00000 n 
-0000037675 00000 n 
-0002814642 00000 n 
-0004875092 00000 n 
-0000037729 00000 n 
-0000038047 00000 n 
-0002845080 00000 n 
-0004874999 00000 n 
-0000038101 00000 n 
-0000038525 00000 n 
-0002849327 00000 n 
-0004874906 00000 n 
-0000038579 00000 n 
-0000038994 00000 n 
-0002849931 00000 n 
-0004874813 00000 n 
-0000039048 00000 n 
-0000039450 00000 n 
-0003089184 00000 n 
-0004874720 00000 n 
-0000039504 00000 n 
-0000040149 00000 n 
-0003115962 00000 n 
-0004874627 00000 n 
-0000040203 00000 n 
-0000040704 00000 n 
-0003275378 00000 n 
-0004874534 00000 n 
-0000040758 00000 n 
-0000041330 00000 n 
-0003295323 00000 n 
-0004874441 00000 n 
-0000041384 00000 n 
-0000041926 00000 n 
-0003306840 00000 n 
-0004874348 00000 n 
-0000041980 00000 n 
-0000042316 00000 n 
-0003319133 00000 n 
-0004874255 00000 n 
-0000042370 00000 n 
-0000042673 00000 n 
-0003382667 00000 n 
-0004874162 00000 n 
-0000042727 00000 n 
-0000043063 00000 n 
-0003409762 00000 n 
-0004874069 00000 n 
-0000043117 00000 n 
-0000043433 00000 n 
-0003456200 00000 n 
-0004873976 00000 n 
-0000043487 00000 n 
-0000043914 00000 n 
-0003634916 00000 n 
-0004873883 00000 n 
-0000043968 00000 n 
-0000044304 00000 n 
-0003654453 00000 n 
-0004873790 00000 n 
-0000044358 00000 n 
-0000044694 00000 n 
-0003658121 00000 n 
-0004873697 00000 n 
-0000044748 00000 n 
-0000045043 00000 n 
-0003881207 00000 n 
-0004873604 00000 n 
-0000045097 00000 n 
-0000045461 00000 n 
-0003926868 00000 n 
-0004873511 00000 n 
-0000045515 00000 n 
-0000045833 00000 n 
-0003930631 00000 n 
-0004873418 00000 n 
-0000045887 00000 n 
-0000046375 00000 n 
-0003935239 00000 n 
-0004873325 00000 n 
-0000046429 00000 n 
-0000046859 00000 n 
-0003945535 00000 n 
-0004873232 00000 n 
-0000046913 00000 n 
-0000047533 00000 n 
-0003964489 00000 n 
-0004873139 00000 n 
-0000047587 00000 n 
-0000048024 00000 n 
-0003964791 00000 n 
-0004873046 00000 n 
-0000048078 00000 n 
-0000048368 00000 n 
-0003970831 00000 n 
-0004872953 00000 n 
-0000048422 00000 n 
-0000048817 00000 n 
-0003974880 00000 n 
-0004872860 00000 n 
-0000048871 00000 n 
-0000049189 00000 n 
-0003975060 00000 n 
-0004872767 00000 n 
-0000049243 00000 n 
-0000049703 00000 n 
-0003975484 00000 n 
-0004872674 00000 n 
-0000049757 00000 n 
-0000050042 00000 n 
-0004003029 00000 n 
-0004872581 00000 n 
-0000050096 00000 n 
-0000050741 00000 n 
-0004024790 00000 n 
-0004872488 00000 n 
-0000050795 00000 n 
-0000051108 00000 n 
-0004030099 00000 n 
-0004872409 00000 n 
-0000051162 00000 n 
-0000051447 00000 n 
-0000052934 00000 n 
-0000053053 00000 n 
-0000056391 00000 n 
-0000051499 00000 n 
-0000056278 00000 n 
-0000056334 00000 n 
-0004855592 00000 n 
-0004853247 00000 n 
-0004853831 00000 n 
-0004853539 00000 n 
-0004856133 00000 n 
-0004856646 00000 n 
-0000056047 00000 n 
-0000056231 00000 n 
-0000056818 00000 n 
-0000056643 00000 n 
-0000056543 00000 n 
-0000056762 00000 n 
-0000063842 00000 n 
-0000064008 00000 n 
-0000064160 00000 n 
-0000064326 00000 n 
-0000064624 00000 n 
-0000058663 00000 n 
-0000064804 00000 n 
-0000060866 00000 n 
-0000065024 00000 n 
-0000058476 00000 n 
-0000056859 00000 n 
-0000064968 00000 n 
-0004855769 00000 n 
-0000064476 00000 n 
-0004854868 00000 n 
-0000060635 00000 n 
-0000060819 00000 n 
-0000063611 00000 n 
-0000063795 00000 n 
-0000350171 00000 n 
-0000315329 00000 n 
-0000065438 00000 n 
-0000065263 00000 n 
-0000065163 00000 n 
-0000065382 00000 n 
-0000067735 00000 n 
-0000067886 00000 n 
-0000068043 00000 n 
-0000068200 00000 n 
-0000068355 00000 n 
-0000068512 00000 n 
-0000068669 00000 n 
-0000068826 00000 n 
-0000068983 00000 n 
-0000069140 00000 n 
-0000069296 00000 n 
-0000069453 00000 n 
-0000069610 00000 n 
-0000069768 00000 n 
-0000069925 00000 n 
-0000070082 00000 n 
-0000070240 00000 n 
-0000070397 00000 n 
-0000070548 00000 n 
-0000070699 00000 n 
-0000070850 00000 n 
-0000071007 00000 n 
-0000071158 00000 n 
-0000071313 00000 n 
-0000071464 00000 n 
-0000071621 00000 n 
-0000071772 00000 n 
-0000071929 00000 n 
-0000072080 00000 n 
-0000072237 00000 n 
-0000072388 00000 n 
-0000072545 00000 n 
-0000072701 00000 n 
-0000072856 00000 n 
-0000073005 00000 n 
-0000073162 00000 n 
-0000073477 00000 n 
-0000073634 00000 n 
-0000073792 00000 n 
-0000073950 00000 n 
-0000074108 00000 n 
-0000074420 00000 n 
-0000077522 00000 n 
-0000074576 00000 n 
-0000074796 00000 n 
-0000067244 00000 n 
-0000065479 00000 n 
-0000074740 00000 n 
-0004851332 00000 n 
-0000073320 00000 n 
-0000074265 00000 n 
-0000077680 00000 n 
-0000077997 00000 n 
-0000078156 00000 n 
-0000078472 00000 n 
-0000078630 00000 n 
-0000078789 00000 n 
-0000078947 00000 n 
-0000079106 00000 n 
-0000079265 00000 n 
-0000079423 00000 n 
-0000079740 00000 n 
-0000079899 00000 n 
-0000080057 00000 n 
-0000080216 00000 n 
-0000080533 00000 n 
-0000080692 00000 n 
-0000081009 00000 n 
-0000081168 00000 n 
-0000081326 00000 n 
-0000081485 00000 n 
-0000081644 00000 n 
-0000081961 00000 n 
-0000082278 00000 n 
-0000082437 00000 n 
-0000082596 00000 n 
-0000082755 00000 n 
-0000082913 00000 n 
-0000083072 00000 n 
-0000083388 00000 n 
-0000083704 00000 n 
-0000083863 00000 n 
-0000084179 00000 n 
-0000084495 00000 n 
-0000084811 00000 n 
-0000084970 00000 n 
-0000085287 00000 n 
-0000085604 00000 n 
-0000085918 00000 n 
-0000089198 00000 n 
-0000086075 00000 n 
-0000086295 00000 n 
-0000076951 00000 n 
-0000074935 00000 n 
-0000086239 00000 n 
-0000077839 00000 n 
-0000078314 00000 n 
-0000079582 00000 n 
-0000080375 00000 n 
-0000080851 00000 n 
-0000081803 00000 n 
-0000082120 00000 n 
-0000083230 00000 n 
-0000083546 00000 n 
-0000084021 00000 n 
-0000084337 00000 n 
-0000084653 00000 n 
-0000085129 00000 n 
-0000085446 00000 n 
-0000085762 00000 n 
-0000089357 00000 n 
-0000089516 00000 n 
-0000089675 00000 n 
-0000089834 00000 n 
-0000089992 00000 n 
-0000090150 00000 n 
-0000090308 00000 n 
-0000090467 00000 n 
-0000090625 00000 n 
-0000090942 00000 n 
-0000091258 00000 n 
-0000091415 00000 n 
-0000091732 00000 n 
-0000091891 00000 n 
-0000092049 00000 n 
-0000092208 00000 n 
-0000092367 00000 n 
-0000092526 00000 n 
-0000092843 00000 n 
-0000093002 00000 n 
-0000093161 00000 n 
-0000093319 00000 n 
-0000093478 00000 n 
-0000093795 00000 n 
-0000094112 00000 n 
-0000094429 00000 n 
-0000094745 00000 n 
-0000094903 00000 n 
-0000095062 00000 n 
-0000095220 00000 n 
-0000095379 00000 n 
-0000095538 00000 n 
-0000095696 00000 n 
-0000095855 00000 n 
-0000096013 00000 n 
-0000096172 00000 n 
-0000096330 00000 n 
-0000096647 00000 n 
-0000096806 00000 n 
-0000097123 00000 n 
-0000097282 00000 n 
-0000097440 00000 n 
-0000097597 00000 n 
-0000099109 00000 n 
-0000097754 00000 n 
-0000097974 00000 n 
-0000088627 00000 n 
-0000086434 00000 n 
-0000097918 00000 n 
-0000090784 00000 n 
-0000091100 00000 n 
-0000091574 00000 n 
-0000092685 00000 n 
-0000093637 00000 n 
-0000093954 00000 n 
-0000094271 00000 n 
-0000094587 00000 n 
-0000096489 00000 n 
-0000096965 00000 n 
-0004856765 00000 n 
-0000099426 00000 n 
-0000099585 00000 n 
-0000099901 00000 n 
-0000100060 00000 n 
-0000100218 00000 n 
-0000100438 00000 n 
-0000098914 00000 n 
-0000098113 00000 n 
-0000100382 00000 n 
-0000099268 00000 n 
-0000099744 00000 n 
-0000103465 00000 n 
-0000103626 00000 n 
-0000103789 00000 n 
-0000103978 00000 n 
-0000104168 00000 n 
-0000104353 00000 n 
-0000104544 00000 n 
-0000107960 00000 n 
-0000104720 00000 n 
-0000105227 00000 n 
-0000103270 00000 n 
-0000100577 00000 n 
-0004855227 00000 n 
-0000104939 00000 n 
-0000104996 00000 n 
-0000105108 00000 n 
-0000105170 00000 n 
-0004856312 00000 n 
-0004854721 00000 n 
-0004851775 00000 n 
-0000130162 00000 n 
-0000259714 00000 n 
-0001159397 00000 n 
-0002814583 00000 n 
-0000692269 00000 n 
-0002849872 00000 n 
-0000936301 00000 n 
-0000108140 00000 n 
-0000108325 00000 n 
-0000108518 00000 n 
-0000108721 00000 n 
-0000109240 00000 n 
-0000107789 00000 n 
-0000105431 00000 n 
-0000108885 00000 n 
-0000108947 00000 n 
-0000109004 00000 n 
-0000109065 00000 n 
-0000109121 00000 n 
-0000109183 00000 n 
-0002091976 00000 n 
-0002467409 00000 n 
-0003456141 00000 n 
-0003115903 00000 n 
-0000112138 00000 n 
-0000112358 00000 n 
-0000111999 00000 n 
-0000109405 00000 n 
-0004852516 00000 n 
-0004852954 00000 n 
-0000112302 00000 n 
-0000115259 00000 n 
-0000119322 00000 n 
-0000119547 00000 n 
-0000115705 00000 n 
-0000116159 00000 n 
-0000115104 00000 n 
-0000112560 00000 n 
-0000115869 00000 n 
-0000115926 00000 n 
-0000115988 00000 n 
-0000116045 00000 n 
-0000116102 00000 n 
-0000115482 00000 n 
-0002708232 00000 n 
-0000119771 00000 n 
-0000120218 00000 n 
-0000119167 00000 n 
-0000116311 00000 n 
-0000119935 00000 n 
-0000119991 00000 n 
-0000120048 00000 n 
-0000120105 00000 n 
-0000120162 00000 n 
-0004856884 00000 n 
-0001327331 00000 n 
-0001319776 00000 n 
-0000123960 00000 n 
-0000124592 00000 n 
-0000123821 00000 n 
-0000120370 00000 n 
-0000124124 00000 n 
-0000124236 00000 n 
-0000124354 00000 n 
-0000124416 00000 n 
-0000124473 00000 n 
-0000124535 00000 n 
-0004851185 00000 n 
-0004853685 00000 n 
-0000128887 00000 n 
-0000129039 00000 n 
-0000129215 00000 n 
-0000129370 00000 n 
-0000129523 00000 n 
-0000129675 00000 n 
-0000129828 00000 n 
-0000130397 00000 n 
-0000128700 00000 n 
-0000124845 00000 n 
-0000129992 00000 n 
-0000130048 00000 n 
-0000130105 00000 n 
-0000130280 00000 n 
-0000130341 00000 n 
-0000310310 00000 n 
-0000288741 00000 n 
-0000293975 00000 n 
-0000309724 00000 n 
-0000315155 00000 n 
-0000135150 00000 n 
-0000135337 00000 n 
-0000135794 00000 n 
-0000135003 00000 n 
-0000130637 00000 n 
-0000135501 00000 n 
-0004852662 00000 n 
-0004852217 00000 n 
-0004850888 00000 n 
-0000135557 00000 n 
-0000135619 00000 n 
-0000135676 00000 n 
-0000135737 00000 n 
-0000149859 00000 n 
-0000140031 00000 n 
-0000140782 00000 n 
-0000139892 00000 n 
-0000136086 00000 n 
-0000140195 00000 n 
-0000140251 00000 n 
-0000140308 00000 n 
-0000140365 00000 n 
-0000140483 00000 n 
-0000140545 00000 n 
-0004851628 00000 n 
-0000140602 00000 n 
-0000140664 00000 n 
-0000140721 00000 n 
-0000145442 00000 n 
-0000146075 00000 n 
-0000145303 00000 n 
-0000141060 00000 n 
-0000145606 00000 n 
-0000145662 00000 n 
-0000145719 00000 n 
-0000145781 00000 n 
-0000145838 00000 n 
-0000145900 00000 n 
-0000145957 00000 n 
-0000146019 00000 n 
-0000149639 00000 n 
-0000150094 00000 n 
-0000149500 00000 n 
-0000146367 00000 n 
-0000149803 00000 n 
-0000149919 00000 n 
-0000149976 00000 n 
-0000150037 00000 n 
-0004857003 00000 n 
-0000153990 00000 n 
-0000154739 00000 n 
-0000153851 00000 n 
-0000150324 00000 n 
-0000154154 00000 n 
-0000154210 00000 n 
-0000154270 00000 n 
-0000154327 00000 n 
-0000154384 00000 n 
-0000154441 00000 n 
-0000154559 00000 n 
-0000154621 00000 n 
-0000154678 00000 n 
-0000158849 00000 n 
-0000159477 00000 n 
-0000158710 00000 n 
-0000155006 00000 n 
-0000159013 00000 n 
-0000159069 00000 n 
-0000159126 00000 n 
-0000159187 00000 n 
-0000159244 00000 n 
-0000159306 00000 n 
-0000159363 00000 n 
-0000159420 00000 n 
-0000163714 00000 n 
-0000163871 00000 n 
-0000164027 00000 n 
-0000164813 00000 n 
-0000163559 00000 n 
-0000159730 00000 n 
-0000164191 00000 n 
-0000164247 00000 n 
-0000164304 00000 n 
-0004854575 00000 n 
-0004853394 00000 n 
-0000164359 00000 n 
-0000164416 00000 n 
-0000164473 00000 n 
-0000164530 00000 n 
-0000164587 00000 n 
-0000164644 00000 n 
-0000164701 00000 n 
-0000164757 00000 n 
-0000294033 00000 n 
-0000169763 00000 n 
-0000170159 00000 n 
-0000169624 00000 n 
-0000165117 00000 n 
-0000169927 00000 n 
-0000169983 00000 n 
-0000170040 00000 n 
-0000170102 00000 n 
-0000175203 00000 n 
-0000175715 00000 n 
-0000175064 00000 n 
-0000170426 00000 n 
-0000175367 00000 n 
-0000175423 00000 n 
-0000175484 00000 n 
-0000175541 00000 n 
-0000175598 00000 n 
-0000175654 00000 n 
-0000179990 00000 n 
-0000180144 00000 n 
-0000184709 00000 n 
-0000180298 00000 n 
-0000180931 00000 n 
-0000179835 00000 n 
-0000175982 00000 n 
-0000180462 00000 n 
-0000180518 00000 n 
-0000180575 00000 n 
-0000180637 00000 n 
-0000180694 00000 n 
-0000180756 00000 n 
-0000180812 00000 n 
-0000180874 00000 n 
-0004857122 00000 n 
-0000299018 00000 n 
-0000299135 00000 n 
-0000185084 00000 n 
-0000185238 00000 n 
-0000185391 00000 n 
-0000185545 00000 n 
-0000186175 00000 n 
-0000184530 00000 n 
-0000181222 00000 n 
-0000185709 00000 n 
-0000184897 00000 n 
-0000185765 00000 n 
-0000185822 00000 n 
-0000185879 00000 n 
-0000185936 00000 n 
-0000185998 00000 n 
-0000186055 00000 n 
-0000186117 00000 n 
-0000241287 00000 n 
-0000298665 00000 n 
-0000274774 00000 n 
-0000190593 00000 n 
-0000190906 00000 n 
-0000191061 00000 n 
-0000191215 00000 n 
-0000191386 00000 n 
-0000191553 00000 n 
-0000192314 00000 n 
-0000190396 00000 n 
-0000186417 00000 n 
-0000191718 00000 n 
-0000191776 00000 n 
-0000191834 00000 n 
-0000190750 00000 n 
-0000191893 00000 n 
-0000191957 00000 n 
-0000192016 00000 n 
-0000192075 00000 n 
-0000192134 00000 n 
-0000192255 00000 n 
-0000197152 00000 n 
-0000196616 00000 n 
-0000196770 00000 n 
-0000196929 00000 n 
-0000197694 00000 n 
-0000196455 00000 n 
-0000192545 00000 n 
-0000197094 00000 n 
-0000197211 00000 n 
-0000197270 00000 n 
-0000197329 00000 n 
-0000197449 00000 n 
-0000197513 00000 n 
-0000197571 00000 n 
-0000197635 00000 n 
-0000288858 00000 n 
-0000269062 00000 n 
-0000201497 00000 n 
-0000201651 00000 n 
-0000201808 00000 n 
-0000201962 00000 n 
-0000202117 00000 n 
-0000202946 00000 n 
-0000201318 00000 n 
-0000197937 00000 n 
-0000202282 00000 n 
-0000202340 00000 n 
-0000202403 00000 n 
-0000202462 00000 n 
-0000202526 00000 n 
-0000202585 00000 n 
-0000202643 00000 n 
-0000202702 00000 n 
-0000202823 00000 n 
-0000202887 00000 n 
-0000293503 00000 n 
-0000274656 00000 n 
-0000274245 00000 n 
-0000207336 00000 n 
-0000207986 00000 n 
-0000207193 00000 n 
-0000203163 00000 n 
-0000207501 00000 n 
-0000207559 00000 n 
-0000207623 00000 n 
-0000207682 00000 n 
-0000207746 00000 n 
-0000207805 00000 n 
-0000207869 00000 n 
-0000207928 00000 n 
-0000212025 00000 n 
-0000212179 00000 n 
-0000218650 00000 n 
-0000212338 00000 n 
-0000213230 00000 n 
-0000211863 00000 n 
-0000208254 00000 n 
-0000212503 00000 n 
-0000212561 00000 n 
-0004852366 00000 n 
-0000212620 00000 n 
-0000212684 00000 n 
-0000212743 00000 n 
-0000212807 00000 n 
-0000212866 00000 n 
-0000212930 00000 n 
-0000212989 00000 n 
-0000213052 00000 n 
-0000213111 00000 n 
-0004857245 00000 n 
-0000310193 00000 n 
-0000218829 00000 n 
-0000219009 00000 n 
-0000219186 00000 n 
-0000219778 00000 n 
-0000218479 00000 n 
-0000213489 00000 n 
-0000219351 00000 n 
-0000219409 00000 n 
-0000219473 00000 n 
-0000219532 00000 n 
-0000219596 00000 n 
-0000219655 00000 n 
-0000219719 00000 n 
-0000228694 00000 n 
-0000223742 00000 n 
-0000224269 00000 n 
-0000223598 00000 n 
-0000220058 00000 n 
-0000223907 00000 n 
-0000223965 00000 n 
-0000224029 00000 n 
-0000224088 00000 n 
-0000224147 00000 n 
-0000224206 00000 n 
-0000228861 00000 n 
-0000229020 00000 n 
-0000234403 00000 n 
-0000229188 00000 n 
-0000229829 00000 n 
-0000228523 00000 n 
-0000224524 00000 n 
-0000229353 00000 n 
-0000229411 00000 n 
-0000229470 00000 n 
-0000229529 00000 n 
-0000229588 00000 n 
-0000229647 00000 n 
-0000229706 00000 n 
-0000229770 00000 n 
-0000234558 00000 n 
-0000234712 00000 n 
-0000234865 00000 n 
-0000235032 00000 n 
-0000235782 00000 n 
-0000234223 00000 n 
-0000230071 00000 n 
-0000235197 00000 n 
-0000235255 00000 n 
-0000235376 00000 n 
-0000235434 00000 n 
-0000235492 00000 n 
-0000235551 00000 n 
-0000235666 00000 n 
-0000235724 00000 n 
-0000269003 00000 n 
-0000281170 00000 n 
-0000241166 00000 n 
-0000239307 00000 n 
-0000239622 00000 n 
-0000239802 00000 n 
-0000240127 00000 n 
-0000240530 00000 n 
-0000241526 00000 n 
-0000239100 00000 n 
-0000236048 00000 n 
-0000240695 00000 n 
-0000240753 00000 n 
-0000240812 00000 n 
-0000240871 00000 n 
-0000240930 00000 n 
-0000240989 00000 n 
-0000241048 00000 n 
-0000241107 00000 n 
-0000239465 00000 n 
-0000239965 00000 n 
-0000240329 00000 n 
-0000241351 00000 n 
-0000241410 00000 n 
-0000241468 00000 n 
-0000245669 00000 n 
-0000245892 00000 n 
-0000246201 00000 n 
-0000246356 00000 n 
-0000246512 00000 n 
-0000246857 00000 n 
-0000247025 00000 n 
-0000247179 00000 n 
-0000247333 00000 n 
-0000247726 00000 n 
-0000247919 00000 n 
-0000248730 00000 n 
-0000245408 00000 n 
-0000241791 00000 n 
-0000248084 00000 n 
-0000248142 00000 n 
-0000248201 00000 n 
-0000248260 00000 n 
-0000248319 00000 n 
-0000248378 00000 n 
-0000248436 00000 n 
-0000248494 00000 n 
-0000246047 00000 n 
-0000248553 00000 n 
-0000248612 00000 n 
-0000248671 00000 n 
-0000246685 00000 n 
-0000247530 00000 n 
-0004857371 00000 n 
-0000274539 00000 n 
-0000281112 00000 n 
-0000925989 00000 n 
-0002434677 00000 n 
-0000252054 00000 n 
-0000252209 00000 n 
-0000252364 00000 n 
-0000252772 00000 n 
-0000252982 00000 n 
-0000253196 00000 n 
-0000253410 00000 n 
-0000253624 00000 n 
-0000253833 00000 n 
-0000254048 00000 n 
-0000254268 00000 n 
-0000254482 00000 n 
-0000254670 00000 n 
-0000255136 00000 n 
-0000251793 00000 n 
-0000248933 00000 n 
-0000254835 00000 n 
-0000254893 00000 n 
-0000255014 00000 n 
-0000255077 00000 n 
-0000252569 00000 n 
-0000304887 00000 n 
-0000304944 00000 n 
-0001852911 00000 n 
-0001199449 00000 n 
-0001591827 00000 n 
-0004002969 00000 n 
-0003089124 00000 n 
-0003945477 00000 n 
-0001763050 00000 n 
-0002781140 00000 n 
-0001788369 00000 n 
-0002638488 00000 n 
-0000258439 00000 n 
-0000258618 00000 n 
-0000258805 00000 n 
-0000258999 00000 n 
-0000259373 00000 n 
-0000259776 00000 n 
-0000258250 00000 n 
-0000255378 00000 n 
-0000259538 00000 n 
-0004856495 00000 n 
-0000259596 00000 n 
-0000259655 00000 n 
-0000259187 00000 n 
-0003658061 00000 n 
-0000263829 00000 n 
-0000264526 00000 n 
-0000263685 00000 n 
-0000260057 00000 n 
-0000263994 00000 n 
-0000264109 00000 n 
-0000264168 00000 n 
-0000264227 00000 n 
-0000264286 00000 n 
-0000264345 00000 n 
-0000264404 00000 n 
-0000264463 00000 n 
-0000268423 00000 n 
-0000269121 00000 n 
-0000268279 00000 n 
-0000264692 00000 n 
-0000268588 00000 n 
-0000268646 00000 n 
-0000268705 00000 n 
-0000268826 00000 n 
-0000268885 00000 n 
-0000268944 00000 n 
-0000272724 00000 n 
-0000273122 00000 n 
-0000273288 00000 n 
-0000273469 00000 n 
-0000273654 00000 n 
-0000273839 00000 n 
-0000274022 00000 n 
-0000275009 00000 n 
-0000272517 00000 n 
-0000269274 00000 n 
-0000274187 00000 n 
-0000274303 00000 n 
-0000272924 00000 n 
-0000274362 00000 n 
-0000274421 00000 n 
-0000274480 00000 n 
-0000274597 00000 n 
-0000274715 00000 n 
-0000274833 00000 n 
-0000274891 00000 n 
-0000274950 00000 n 
-0000278858 00000 n 
-0000279226 00000 n 
-0000279594 00000 n 
-0000279759 00000 n 
-0000279915 00000 n 
-0000280099 00000 n 
-0000280265 00000 n 
-0000280449 00000 n 
-0000280615 00000 n 
-0000285680 00000 n 
-0000285864 00000 n 
-0000280771 00000 n 
-0000281701 00000 n 
-0000278615 00000 n 
-0000275149 00000 n 
-0000280936 00000 n 
-0000280994 00000 n 
-0000281053 00000 n 
-0000279042 00000 n 
-0000281229 00000 n 
-0000281288 00000 n 
-0000279410 00000 n 
-0000281347 00000 n 
-0000281406 00000 n 
-0000281465 00000 n 
-0000281524 00000 n 
-0000281583 00000 n 
-0000281642 00000 n 
-0004857497 00000 n 
-0000286020 00000 n 
-0000286351 00000 n 
-0000286532 00000 n 
-0000286688 00000 n 
-0000286854 00000 n 
-0000287034 00000 n 
-0000287190 00000 n 
-0000287346 00000 n 
-0000287530 00000 n 
-0000287715 00000 n 
-0000287872 00000 n 
-0000288917 00000 n 
-0000285419 00000 n 
-0000281841 00000 n 
-0000288037 00000 n 
-0000288095 00000 n 
-0000288154 00000 n 
-0000288213 00000 n 
-0000286186 00000 n 
-0000288272 00000 n 
-0000288331 00000 n 
-0000288390 00000 n 
-0000288447 00000 n 
-0000288506 00000 n 
-0000288565 00000 n 
-0000288624 00000 n 
-0000288683 00000 n 
-0000288799 00000 n 
-0000292752 00000 n 
-0000293162 00000 n 
-0000294268 00000 n 
-0000292590 00000 n 
-0000289057 00000 n 
-0000293327 00000 n 
-0000293385 00000 n 
-0000293444 00000 n 
-0000293562 00000 n 
-0000293621 00000 n 
-0000293680 00000 n 
-0000293739 00000 n 
-0000293798 00000 n 
-0000293857 00000 n 
-0000293916 00000 n 
-0000292958 00000 n 
-0000294091 00000 n 
-0000294150 00000 n 
-0000294209 00000 n 
-0000298324 00000 n 
-0000299428 00000 n 
-0000298180 00000 n 
-0000294421 00000 n 
-0000298489 00000 n 
-0000298547 00000 n 
-0000298606 00000 n 
-0000298723 00000 n 
-0000298782 00000 n 
-0000298841 00000 n 
-0000298900 00000 n 
-0000298959 00000 n 
-0000299076 00000 n 
-0000299193 00000 n 
-0000299252 00000 n 
-0000299311 00000 n 
-0000299369 00000 n 
-0000303446 00000 n 
-0000303827 00000 n 
-0000303982 00000 n 
-0000309077 00000 n 
-0000304133 00000 n 
-0000305237 00000 n 
-0000303266 00000 n 
-0000299568 00000 n 
-0000304298 00000 n 
-0000304356 00000 n 
-0000304415 00000 n 
-0000304474 00000 n 
-0000303638 00000 n 
-0000304533 00000 n 
-0000304592 00000 n 
-0000304651 00000 n 
-0000304710 00000 n 
-0000304769 00000 n 
-0000304828 00000 n 
-0000305003 00000 n 
-0000305062 00000 n 
-0000305120 00000 n 
-0000305179 00000 n 
-0000309607 00000 n 
-0000309231 00000 n 
-0000314340 00000 n 
-0000314495 00000 n 
-0000309384 00000 n 
-0000310663 00000 n 
-0000308915 00000 n 
-0000305390 00000 n 
-0000309549 00000 n 
-0000309666 00000 n 
-0000309782 00000 n 
-0000309841 00000 n 
-0000309900 00000 n 
-0000309959 00000 n 
-0000310016 00000 n 
-0000310075 00000 n 
-0000310134 00000 n 
-0000310252 00000 n 
-0000310368 00000 n 
-0000310427 00000 n 
-0000310486 00000 n 
-0000310545 00000 n 
-0000310604 00000 n 
-0000314650 00000 n 
-0000314814 00000 n 
-0000315446 00000 n 
-0000314169 00000 n 
-0000310803 00000 n 
-0000314979 00000 n 
-0000315037 00000 n 
-0000315096 00000 n 
-0000315270 00000 n 
-0000315387 00000 n 
-0004857623 00000 n 
-0000318957 00000 n 
-0000319357 00000 n 
-0000318813 00000 n 
-0000315599 00000 n 
-0000319122 00000 n 
-0000319180 00000 n 
-0000319239 00000 n 
-0000319298 00000 n 
-0000322727 00000 n 
-0000323127 00000 n 
-0000322583 00000 n 
-0000319497 00000 n 
-0000322892 00000 n 
-0000322950 00000 n 
-0000323009 00000 n 
-0000323068 00000 n 
-0000326556 00000 n 
-0000326897 00000 n 
-0000326412 00000 n 
-0000323267 00000 n 
-0000326721 00000 n 
-0000326779 00000 n 
-0000326838 00000 n 
-0000330696 00000 n 
-0000330978 00000 n 
-0000330552 00000 n 
-0000327037 00000 n 
-0000330861 00000 n 
-0000330919 00000 n 
-0000334353 00000 n 
-0000334635 00000 n 
-0000334209 00000 n 
-0000331118 00000 n 
-0000334518 00000 n 
-0000334576 00000 n 
-0000338287 00000 n 
-0000338687 00000 n 
-0000338143 00000 n 
-0000334775 00000 n 
-0000338452 00000 n 
-0000338510 00000 n 
-0000338569 00000 n 
-0000338628 00000 n 
-0004857749 00000 n 
-0000342314 00000 n 
-0000342714 00000 n 
-0000342170 00000 n 
-0000338827 00000 n 
-0000342479 00000 n 
-0000342537 00000 n 
-0000342596 00000 n 
-0000342655 00000 n 
-0000345803 00000 n 
-0000346262 00000 n 
-0000345659 00000 n 
-0000342854 00000 n 
-0000345968 00000 n 
-0000346026 00000 n 
-0000346085 00000 n 
-0000346144 00000 n 
-0000346203 00000 n 
-0004855045 00000 n 
-0000349282 00000 n 
-0000349459 00000 n 
-0000349636 00000 n 
-0000349832 00000 n 
-0000350229 00000 n 
-0000349111 00000 n 
-0000346417 00000 n 
-0000349997 00000 n 
-0000350112 00000 n 
-0000354302 00000 n 
-0000354525 00000 n 
-0000354158 00000 n 
-0000350384 00000 n 
-0000354467 00000 n 
-0000358463 00000 n 
-0000358686 00000 n 
-0000358319 00000 n 
-0000354652 00000 n 
-0000358628 00000 n 
-0000362104 00000 n 
-0000362327 00000 n 
-0000361960 00000 n 
-0000358813 00000 n 
-0000362269 00000 n 
-0004857875 00000 n 
-0000365765 00000 n 
-0000365988 00000 n 
-0000365621 00000 n 
-0000362454 00000 n 
-0000365930 00000 n 
-0000368815 00000 n 
-0000368992 00000 n 
-0000369148 00000 n 
-0000369544 00000 n 
-0000368653 00000 n 
-0000366115 00000 n 
-0000369313 00000 n 
-0000369371 00000 n 
-0000371347 00000 n 
-0000371525 00000 n 
-0000371683 00000 n 
-0000371878 00000 n 
-0000372036 00000 n 
-0000372192 00000 n 
-0000372349 00000 n 
-0000372508 00000 n 
-0000372666 00000 n 
-0000372825 00000 n 
-0000372983 00000 n 
-0000373141 00000 n 
-0000373299 00000 n 
-0000373457 00000 n 
-0000373616 00000 n 
-0000373775 00000 n 
-0000373934 00000 n 
-0000374093 00000 n 
-0000374252 00000 n 
-0000374411 00000 n 
-0000374570 00000 n 
-0000374729 00000 n 
-0000374888 00000 n 
-0000377416 00000 n 
-0000375045 00000 n 
-0000375496 00000 n 
-0000370996 00000 n 
-0000369684 00000 n 
-0000375210 00000 n 
-0000570592 00000 n 
-0000662236 00000 n 
-0000665980 00000 n 
-0000377575 00000 n 
-0000377734 00000 n 
-0000377892 00000 n 
-0000378051 00000 n 
-0000378210 00000 n 
-0000378369 00000 n 
-0000378527 00000 n 
-0000378686 00000 n 
-0000378844 00000 n 
-0000379003 00000 n 
-0000379162 00000 n 
-0000379320 00000 n 
-0000379479 00000 n 
-0000379637 00000 n 
-0000379796 00000 n 
-0000379955 00000 n 
-0000380114 00000 n 
-0000380273 00000 n 
-0000380432 00000 n 
-0000380589 00000 n 
-0000380748 00000 n 
-0000380907 00000 n 
-0000381066 00000 n 
-0000381225 00000 n 
-0000381384 00000 n 
-0000381543 00000 n 
-0000383811 00000 n 
-0000381700 00000 n 
-0000381923 00000 n 
-0000377029 00000 n 
-0000375649 00000 n 
-0000381865 00000 n 
-0000383970 00000 n 
-0000384129 00000 n 
-0000384288 00000 n 
-0000384446 00000 n 
-0000384605 00000 n 
-0000384764 00000 n 
-0000384922 00000 n 
-0000385081 00000 n 
-0000385240 00000 n 
-0000385398 00000 n 
-0000385557 00000 n 
-0000385716 00000 n 
-0000385874 00000 n 
-0000386033 00000 n 
-0000386192 00000 n 
-0000386351 00000 n 
-0000386510 00000 n 
-0000386669 00000 n 
-0000386828 00000 n 
-0000386987 00000 n 
-0000387146 00000 n 
-0000387305 00000 n 
-0000387464 00000 n 
-0000387623 00000 n 
-0000387781 00000 n 
-0000387940 00000 n 
-0000390097 00000 n 
-0000388097 00000 n 
-0000388320 00000 n 
-0000383424 00000 n 
-0000382063 00000 n 
-0000388262 00000 n 
-0000390256 00000 n 
-0000390415 00000 n 
-0000390574 00000 n 
-0000390733 00000 n 
-0000390892 00000 n 
-0000391051 00000 n 
-0000391209 00000 n 
-0000391368 00000 n 
-0000391527 00000 n 
-0000391686 00000 n 
-0000391843 00000 n 
-0000392002 00000 n 
-0000392161 00000 n 
-0000392320 00000 n 
-0000392479 00000 n 
-0000392638 00000 n 
-0000392795 00000 n 
-0000392954 00000 n 
-0000393113 00000 n 
-0000393272 00000 n 
-0000393430 00000 n 
-0000393589 00000 n 
-0000393748 00000 n 
-0000393907 00000 n 
-0000394065 00000 n 
-0000394224 00000 n 
-0000394562 00000 n 
-0000389719 00000 n 
-0000388460 00000 n 
-0000394389 00000 n 
-0004858001 00000 n 
-0000396722 00000 n 
-0000396923 00000 n 
-0000397082 00000 n 
-0000397290 00000 n 
-0000397449 00000 n 
-0000397666 00000 n 
-0000397825 00000 n 
-0000398011 00000 n 
-0000398170 00000 n 
-0000398366 00000 n 
-0000398524 00000 n 
-0000398716 00000 n 
-0000398874 00000 n 
-0000399072 00000 n 
-0000399230 00000 n 
-0000399410 00000 n 
-0000399568 00000 n 
-0000399757 00000 n 
-0000399915 00000 n 
-0000400336 00000 n 
-0000400495 00000 n 
-0000400687 00000 n 
-0000400846 00000 n 
-0000401046 00000 n 
-0000401205 00000 n 
-0000401398 00000 n 
-0000401557 00000 n 
-0000401766 00000 n 
-0000401925 00000 n 
-0000402131 00000 n 
-0000402290 00000 n 
-0000402497 00000 n 
-0000402677 00000 n 
-0000402836 00000 n 
-0000403032 00000 n 
-0000405525 00000 n 
-0000405723 00000 n 
-0000403189 00000 n 
-0000403412 00000 n 
-0000396254 00000 n 
-0000394715 00000 n 
-0000403354 00000 n 
-0000400125 00000 n 
-0000668403 00000 n 
-0000668579 00000 n 
-0000668814 00000 n 
-0000931748 00000 n 
-0000935832 00000 n 
-0001211976 00000 n 
-0001216868 00000 n 
-0001217103 00000 n 
-0001332291 00000 n 
-0001332585 00000 n 
-0001336687 00000 n 
-0001336981 00000 n 
-0000405882 00000 n 
-0000406088 00000 n 
-0000406246 00000 n 
-0000406450 00000 n 
-0000406609 00000 n 
-0000406797 00000 n 
-0000406956 00000 n 
-0000407152 00000 n 
-0000407310 00000 n 
-0000407510 00000 n 
-0000407669 00000 n 
-0000407874 00000 n 
-0000408033 00000 n 
-0000408254 00000 n 
-0000408413 00000 n 
-0000408628 00000 n 
-0000408787 00000 n 
-0000409001 00000 n 
-0000409160 00000 n 
-0000409369 00000 n 
-0000409528 00000 n 
-0000409748 00000 n 
-0000409907 00000 n 
-0000410144 00000 n 
-0000410303 00000 n 
-0000410730 00000 n 
-0000410889 00000 n 
-0000411077 00000 n 
-0000411235 00000 n 
-0000411431 00000 n 
-0000411590 00000 n 
-0000411802 00000 n 
-0000411961 00000 n 
-0000412161 00000 n 
-0000412320 00000 n 
-0000412507 00000 n 
-0000412659 00000 n 
-0000415417 00000 n 
-0000415851 00000 n 
-0000412816 00000 n 
-0000413039 00000 n 
-0000405021 00000 n 
-0000403565 00000 n 
-0000412981 00000 n 
-0000410515 00000 n 
-0004855948 00000 n 
-0001337275 00000 n 
-0001374868 00000 n 
-0001381119 00000 n 
-0001388303 00000 n 
-0001462319 00000 n 
-0001499762 00000 n 
-0001514638 00000 n 
-0001527457 00000 n 
-0001532130 00000 n 
-0001549844 00000 n 
-0001558836 00000 n 
-0001566342 00000 n 
-0001575001 00000 n 
-0001605203 00000 n 
-0001710938 00000 n 
-0001733596 00000 n 
-0001738226 00000 n 
-0001747369 00000 n 
-0000416009 00000 n 
-0000416439 00000 n 
-0000416597 00000 n 
-0000416790 00000 n 
-0000416949 00000 n 
-0000417179 00000 n 
-0000417337 00000 n 
-0000417550 00000 n 
-0000417708 00000 n 
-0000417931 00000 n 
-0000418090 00000 n 
-0000418293 00000 n 
-0000418451 00000 n 
-0000418662 00000 n 
-0000418821 00000 n 
-0000419025 00000 n 
-0000419184 00000 n 
-0000419372 00000 n 
-0000419531 00000 n 
-0000419718 00000 n 
-0000419877 00000 n 
-0000420072 00000 n 
-0000420231 00000 n 
-0000420443 00000 n 
-0000420602 00000 n 
-0000420792 00000 n 
-0000420951 00000 n 
-0000421133 00000 n 
-0000421292 00000 n 
-0000421486 00000 n 
-0000421668 00000 n 
-0000421827 00000 n 
-0000422018 00000 n 
-0000424721 00000 n 
-0000424922 00000 n 
-0000422175 00000 n 
-0000422398 00000 n 
-0000414940 00000 n 
-0000413194 00000 n 
-0000422340 00000 n 
-0000415634 00000 n 
-0000416224 00000 n 
-0001816679 00000 n 
-0001816914 00000 n 
-0001827301 00000 n 
-0001847844 00000 n 
-0001852501 00000 n 
-0001852677 00000 n 
-0001892813 00000 n 
-0001904748 00000 n 
-0002038157 00000 n 
-0002068466 00000 n 
-0002076834 00000 n 
-0002296612 00000 n 
-0002307406 00000 n 
-0000425081 00000 n 
-0000425275 00000 n 
-0000425434 00000 n 
-0000425649 00000 n 
-0000425808 00000 n 
-0000426250 00000 n 
-0000426464 00000 n 
-0000426622 00000 n 
-0000426847 00000 n 
-0000427060 00000 n 
-0000427217 00000 n 
-0000427412 00000 n 
-0000427570 00000 n 
-0000427773 00000 n 
-0000427931 00000 n 
-0000428117 00000 n 
-0000428275 00000 n 
-0000428473 00000 n 
-0000428631 00000 n 
-0000428827 00000 n 
-0000428982 00000 n 
-0000429172 00000 n 
-0000429330 00000 n 
-0000429520 00000 n 
-0000429678 00000 n 
-0000430119 00000 n 
-0000430278 00000 n 
-0000430470 00000 n 
-0000430629 00000 n 
-0000430844 00000 n 
-0000431003 00000 n 
-0000431192 00000 n 
-0000431351 00000 n 
-0000431543 00000 n 
-0000431702 00000 n 
-0000432128 00000 n 
-0000434736 00000 n 
-0000434941 00000 n 
-0000432285 00000 n 
-0000432508 00000 n 
-0000424208 00000 n 
-0000422538 00000 n 
-0000432450 00000 n 
-0000426029 00000 n 
-0000429899 00000 n 
-0000431915 00000 n 
-0002394080 00000 n 
-0002439357 00000 n 
-0002446948 00000 n 
-0002455059 00000 n 
-0002462306 00000 n 
-0002467169 00000 n 
-0002482942 00000 n 
-0002501980 00000 n 
-0002726715 00000 n 
-0002845020 00000 n 
-0002845200 00000 n 
-0000435100 00000 n 
-0000435324 00000 n 
-0000435483 00000 n 
-0000435704 00000 n 
-0000435863 00000 n 
-0000436060 00000 n 
-0000436217 00000 n 
-0000436407 00000 n 
-0000436566 00000 n 
-0000436763 00000 n 
-0000436922 00000 n 
-0000437115 00000 n 
-0000437273 00000 n 
-0000437469 00000 n 
-0000437627 00000 n 
-0000437820 00000 n 
-0000437979 00000 n 
-0000438172 00000 n 
-0000438330 00000 n 
-0000438518 00000 n 
-0000438676 00000 n 
-0000438861 00000 n 
-0000439020 00000 n 
-0000439213 00000 n 
-0000439372 00000 n 
-0000439578 00000 n 
-0000439736 00000 n 
-0000439929 00000 n 
-0000440088 00000 n 
-0000440508 00000 n 
-0000440667 00000 n 
-0000440863 00000 n 
-0000441022 00000 n 
-0000441207 00000 n 
-0000443650 00000 n 
-0000443862 00000 n 
-0000441364 00000 n 
-0000441587 00000 n 
-0000434259 00000 n 
-0000432648 00000 n 
-0000441529 00000 n 
-0000440298 00000 n 
-0003275318 00000 n 
-0003286631 00000 n 
-0003296236 00000 n 
-0003319073 00000 n 
-0003382607 00000 n 
-0003409702 00000 n 
-0003634856 00000 n 
-0003643272 00000 n 
-0003881147 00000 n 
-0003926809 00000 n 
-0003930571 00000 n 
-0003935179 00000 n 
-0003964429 00000 n 
-0003964731 00000 n 
-0000444021 00000 n 
-0000444214 00000 n 
-0000444373 00000 n 
-0000444574 00000 n 
-0000444733 00000 n 
-0000444918 00000 n 
-0000445077 00000 n 
-0000445506 00000 n 
-0000445692 00000 n 
-0000445851 00000 n 
-0000446040 00000 n 
-0000446199 00000 n 
-0000446385 00000 n 
-0000446544 00000 n 
-0000446738 00000 n 
-0000446894 00000 n 
-0000447080 00000 n 
-0000447278 00000 n 
-0000447465 00000 n 
-0000447658 00000 n 
-0000447847 00000 n 
-0000450312 00000 n 
-0000448039 00000 n 
-0000448555 00000 n 
-0000443290 00000 n 
-0000441727 00000 n 
-0000448204 00000 n 
-0000445292 00000 n 
-0000448320 00000 n 
-0000448437 00000 n 
-0000448496 00000 n 
-0004858127 00000 n 
-0003970771 00000 n 
-0003971500 00000 n 
-0003975000 00000 n 
-0003975424 00000 n 
-0004024730 00000 n 
-0004030039 00000 n 
-0000450497 00000 n 
-0000450691 00000 n 
-0000450878 00000 n 
-0000451065 00000 n 
-0000451257 00000 n 
-0000451445 00000 n 
-0000451626 00000 n 
-0000451821 00000 n 
-0000452034 00000 n 
-0000452230 00000 n 
-0000452445 00000 n 
-0000452642 00000 n 
-0000452837 00000 n 
-0000453049 00000 n 
-0000453246 00000 n 
-0000453433 00000 n 
-0000453623 00000 n 
-0000453824 00000 n 
-0000454006 00000 n 
-0000454193 00000 n 
-0000454384 00000 n 
-0000454577 00000 n 
-0000457197 00000 n 
-0000457394 00000 n 
-0000454766 00000 n 
-0000454989 00000 n 
-0000449961 00000 n 
-0000448721 00000 n 
-0000454931 00000 n 
-0000457588 00000 n 
-0000457783 00000 n 
-0000457965 00000 n 
-0000458158 00000 n 
-0000458352 00000 n 
-0000458552 00000 n 
-0000458752 00000 n 
-0000458958 00000 n 
-0000459148 00000 n 
-0000459353 00000 n 
-0000459542 00000 n 
-0000459697 00000 n 
-0000459883 00000 n 
-0000460079 00000 n 
-0000460500 00000 n 
-0000460928 00000 n 
-0000461355 00000 n 
-0000461541 00000 n 
-0000461960 00000 n 
-0000462392 00000 n 
-0000462833 00000 n 
-0000465771 00000 n 
-0000463259 00000 n 
-0000463482 00000 n 
-0000456783 00000 n 
-0000455142 00000 n 
-0000463424 00000 n 
-0000460290 00000 n 
-0000460714 00000 n 
-0000461142 00000 n 
-0000461751 00000 n 
-0000462176 00000 n 
-0000462613 00000 n 
-0000463047 00000 n 
-0000466199 00000 n 
-0000466389 00000 n 
-0000466594 00000 n 
-0000466799 00000 n 
-0000467003 00000 n 
-0000467208 00000 n 
-0000467413 00000 n 
-0000467618 00000 n 
-0000467823 00000 n 
-0000468028 00000 n 
-0000468233 00000 n 
-0000468471 00000 n 
-0000468710 00000 n 
-0000469187 00000 n 
-0000469426 00000 n 
-0000469663 00000 n 
-0000469901 00000 n 
-0000470378 00000 n 
-0000470617 00000 n 
-0000470855 00000 n 
-0000471094 00000 n 
-0000471571 00000 n 
-0000471810 00000 n 
-0000472047 00000 n 
-0000472523 00000 n 
-0000472757 00000 n 
-0000473233 00000 n 
-0000473470 00000 n 
-0000473708 00000 n 
-0000474184 00000 n 
-0000474423 00000 n 
-0000474660 00000 n 
-0000474898 00000 n 
-0000475374 00000 n 
-0000475613 00000 n 
-0000475851 00000 n 
-0000476327 00000 n 
-0000476564 00000 n 
-0000480153 00000 n 
-0000480358 00000 n 
-0000480596 00000 n 
-0000480835 00000 n 
-0000481312 00000 n 
-0000481551 00000 n 
-0000477039 00000 n 
-0000477498 00000 n 
-0000465186 00000 n 
-0000463635 00000 n 
-0000477204 00000 n 
-0000465985 00000 n 
-0000477262 00000 n 
-0000477321 00000 n 
-0000477380 00000 n 
-0000477439 00000 n 
-0000468949 00000 n 
-0000470140 00000 n 
-0000471333 00000 n 
-0000472286 00000 n 
-0000472995 00000 n 
-0000473946 00000 n 
-0000475136 00000 n 
-0000476090 00000 n 
-0000476802 00000 n 
-0000515820 00000 n 
-0000515938 00000 n 
-0000516056 00000 n 
-0000516174 00000 n 
-0000516350 00000 n 
-0000516468 00000 n 
-0000516585 00000 n 
-0000518923 00000 n 
-0000519041 00000 n 
-0000519104 00000 n 
-0000519168 00000 n 
-0000519231 00000 n 
-0000519295 00000 n 
-0000519359 00000 n 
-0000519423 00000 n 
-0000519487 00000 n 
-0000519551 00000 n 
-0000519615 00000 n 
-0000519679 00000 n 
-0000519743 00000 n 
-0000519807 00000 n 
-0000519871 00000 n 
-0000519935 00000 n 
-0000519999 00000 n 
-0000520062 00000 n 
-0000520126 00000 n 
-0000520190 00000 n 
-0000520254 00000 n 
-0000520318 00000 n 
-0000520382 00000 n 
-0000520446 00000 n 
-0000520510 00000 n 
-0000520574 00000 n 
-0000520638 00000 n 
-0000520702 00000 n 
-0000520766 00000 n 
-0000481789 00000 n 
-0000481993 00000 n 
-0000482232 00000 n 
-0000482709 00000 n 
-0000482913 00000 n 
-0000483151 00000 n 
-0000483390 00000 n 
-0000483867 00000 n 
-0000484106 00000 n 
-0000484344 00000 n 
-0000484583 00000 n 
-0000484788 00000 n 
-0000485265 00000 n 
-0000485504 00000 n 
-0000485980 00000 n 
-0000486185 00000 n 
-0000486661 00000 n 
-0000486900 00000 n 
-0000487104 00000 n 
-0000487342 00000 n 
-0000487581 00000 n 
-0000488058 00000 n 
-0000488297 00000 n 
-0000488535 00000 n 
-0000488738 00000 n 
-0000489215 00000 n 
-0000489453 00000 n 
-0000489658 00000 n 
-0000490134 00000 n 
-0000490372 00000 n 
-0000490848 00000 n 
-0000491051 00000 n 
-0000491289 00000 n 
-0000491765 00000 n 
-0000491970 00000 n 
-0000492208 00000 n 
-0000492447 00000 n 
-0000492923 00000 n 
-0000493162 00000 n 
-0000493400 00000 n 
-0000493875 00000 n 
-0000494114 00000 n 
-0000494319 00000 n 
-0000494795 00000 n 
-0000495033 00000 n 
-0000495238 00000 n 
-0000495715 00000 n 
-0000495954 00000 n 
-0000498902 00000 n 
-0000496430 00000 n 
-0000496653 00000 n 
-0000479379 00000 n 
-0000477664 00000 n 
-0000496595 00000 n 
-0000481074 00000 n 
-0000482471 00000 n 
-0000483629 00000 n 
-0000485027 00000 n 
-0000485742 00000 n 
-0000486423 00000 n 
-0000487820 00000 n 
-0000488977 00000 n 
-0000489897 00000 n 
-0000490610 00000 n 
-0000491528 00000 n 
-0000492685 00000 n 
-0000493638 00000 n 
-0000494557 00000 n 
-0000495477 00000 n 
-0000496193 00000 n 
-0000520830 00000 n 
-0000520947 00000 n 
-0000521010 00000 n 
-0000523099 00000 n 
-0000523162 00000 n 
-0000523226 00000 n 
-0000523290 00000 n 
-0000523408 00000 n 
-0000523472 00000 n 
-0000523536 00000 n 
-0000523654 00000 n 
-0000523718 00000 n 
-0000523782 00000 n 
-0000523845 00000 n 
-0000523909 00000 n 
-0000523973 00000 n 
-0000524037 00000 n 
-0000524155 00000 n 
-0000524219 00000 n 
-0000524283 00000 n 
-0000524346 00000 n 
-0000524463 00000 n 
-0000524527 00000 n 
-0000524590 00000 n 
-0000527735 00000 n 
-0000527798 00000 n 
-0000527862 00000 n 
-0000527926 00000 n 
-0000527990 00000 n 
-0000528054 00000 n 
-0000528172 00000 n 
-0000528236 00000 n 
-0000528300 00000 n 
-0000528418 00000 n 
-0000528482 00000 n 
-0000528546 00000 n 
-0000528610 00000 n 
-0000531852 00000 n 
-0000531916 00000 n 
-0000531979 00000 n 
-0000532097 00000 n 
-0000532161 00000 n 
-0000532225 00000 n 
-0000532289 00000 n 
-0000532353 00000 n 
-0000532417 00000 n 
-0000532479 00000 n 
-0000532543 00000 n 
-0000532660 00000 n 
-0000532724 00000 n 
-0000532788 00000 n 
-0000532906 00000 n 
-0000532970 00000 n 
-0000533034 00000 n 
-0000499106 00000 n 
-0000499311 00000 n 
-0000499516 00000 n 
-0000499721 00000 n 
-0000499926 00000 n 
-0000500131 00000 n 
-0000500336 00000 n 
-0000500541 00000 n 
-0000500745 00000 n 
-0000500949 00000 n 
-0000501154 00000 n 
-0000501359 00000 n 
-0000501564 00000 n 
-0000501769 00000 n 
-0000501972 00000 n 
-0000502177 00000 n 
-0000502381 00000 n 
-0000502586 00000 n 
-0000502791 00000 n 
-0000502996 00000 n 
-0000503201 00000 n 
-0000503357 00000 n 
-0000503561 00000 n 
-0000503716 00000 n 
-0000503921 00000 n 
-0000506609 00000 n 
-0000506814 00000 n 
-0000504074 00000 n 
-0000504533 00000 n 
-0000498524 00000 n 
-0000496793 00000 n 
-0000504239 00000 n 
-0000504297 00000 n 
-0000504356 00000 n 
-0000504415 00000 n 
-0000504474 00000 n 
-0004851922 00000 n 
-0000565339 00000 n 
-0000533157 00000 n 
-0000533275 00000 n 
-0000537043 00000 n 
-0000537161 00000 n 
-0000537279 00000 n 
-0000537397 00000 n 
-0000537515 00000 n 
-0000537633 00000 n 
-0000537751 00000 n 
-0000537867 00000 n 
-0000537985 00000 n 
-0000538103 00000 n 
-0000538221 00000 n 
-0000538339 00000 n 
-0000538457 00000 n 
-0000538575 00000 n 
-0000538693 00000 n 
-0000538811 00000 n 
-0000538929 00000 n 
-0000539047 00000 n 
-0000542827 00000 n 
-0000543062 00000 n 
-0000506970 00000 n 
-0000507175 00000 n 
-0000507331 00000 n 
-0000507535 00000 n 
-0000507691 00000 n 
-0000507896 00000 n 
-0000508052 00000 n 
-0000508257 00000 n 
-0000508413 00000 n 
-0000508618 00000 n 
-0000508823 00000 n 
-0000508979 00000 n 
-0000509184 00000 n 
-0000509389 00000 n 
-0000509545 00000 n 
-0000509750 00000 n 
-0000509955 00000 n 
-0000510111 00000 n 
-0000510314 00000 n 
-0000510518 00000 n 
-0000510674 00000 n 
-0000510879 00000 n 
-0000511083 00000 n 
-0000511238 00000 n 
-0000511443 00000 n 
-0000511646 00000 n 
-0000511799 00000 n 
-0000512375 00000 n 
-0000506213 00000 n 
-0000504728 00000 n 
-0000511964 00000 n 
-0000512022 00000 n 
-0000512081 00000 n 
-0000512140 00000 n 
-0000512199 00000 n 
-0000512258 00000 n 
-0000512317 00000 n 
-0004858253 00000 n 
-0000547184 00000 n 
-0000551495 00000 n 
-0000556078 00000 n 
-0000556371 00000 n 
-0000561089 00000 n 
-0000515096 00000 n 
-0000515286 00000 n 
-0000515479 00000 n 
-0000516703 00000 n 
-0000514934 00000 n 
-0000512529 00000 n 
-0000515644 00000 n 
-0000515702 00000 n 
-0000515761 00000 n 
-0000515879 00000 n 
-0000515997 00000 n 
-0000516115 00000 n 
-0000516233 00000 n 
-0000516292 00000 n 
-0000516409 00000 n 
-0000516527 00000 n 
-0000516644 00000 n 
-0000518641 00000 n 
-0000521073 00000 n 
-0000518497 00000 n 
-0000516843 00000 n 
-0000518806 00000 n 
-0000518864 00000 n 
-0000518982 00000 n 
-0000520889 00000 n 
-0000526914 00000 n 
-0000522876 00000 n 
-0000524648 00000 n 
-0000522732 00000 n 
-0000521253 00000 n 
-0000523041 00000 n 
-0000523349 00000 n 
-0000523595 00000 n 
-0000524096 00000 n 
-0000524404 00000 n 
-0000527094 00000 n 
-0000527274 00000 n 
-0000527453 00000 n 
-0000528726 00000 n 
-0000526743 00000 n 
-0000524803 00000 n 
-0000527618 00000 n 
-0000527676 00000 n 
-0000528113 00000 n 
-0000528359 00000 n 
-0000528667 00000 n 
-0000531087 00000 n 
-0000531249 00000 n 
-0000531439 00000 n 
-0000531629 00000 n 
-0000533391 00000 n 
-0000530916 00000 n 
-0000528919 00000 n 
-0000531794 00000 n 
-0000532038 00000 n 
-0000532601 00000 n 
-0000532847 00000 n 
-0000533098 00000 n 
-0000533216 00000 n 
-0004855407 00000 n 
-0000533333 00000 n 
-0000536664 00000 n 
-0000536820 00000 n 
-0000539224 00000 n 
-0000536511 00000 n 
-0000533561 00000 n 
-0000536985 00000 n 
-0000537102 00000 n 
-0000537220 00000 n 
-0000537338 00000 n 
-0000537456 00000 n 
-0000537574 00000 n 
-0000537692 00000 n 
-0000537809 00000 n 
-0000537926 00000 n 
-0000538044 00000 n 
-0000538162 00000 n 
-0000538280 00000 n 
-0000538398 00000 n 
-0000538516 00000 n 
-0000538634 00000 n 
-0000538752 00000 n 
-0000538870 00000 n 
-0000538988 00000 n 
-0000539106 00000 n 
-0000539165 00000 n 
-0004858379 00000 n 
-0000542389 00000 n 
-0000546473 00000 n 
-0000542545 00000 n 
-0000543120 00000 n 
-0000542236 00000 n 
-0000539418 00000 n 
-0000542710 00000 n 
-0000542768 00000 n 
-0000542886 00000 n 
-0000542945 00000 n 
-0000543003 00000 n 
-0000546629 00000 n 
-0000546784 00000 n 
-0000547361 00000 n 
-0000546311 00000 n 
-0000543364 00000 n 
-0000546949 00000 n 
-0000547007 00000 n 
-0000547066 00000 n 
-0000547125 00000 n 
-0000547243 00000 n 
-0000547302 00000 n 
-0000550998 00000 n 
-0000551154 00000 n 
-0000551731 00000 n 
-0000550845 00000 n 
-0000547617 00000 n 
-0000551319 00000 n 
-0000551377 00000 n 
-0000551436 00000 n 
-0000551554 00000 n 
-0000551613 00000 n 
-0000551672 00000 n 
-0000555699 00000 n 
-0000560436 00000 n 
-0000555855 00000 n 
-0000556487 00000 n 
-0000555546 00000 n 
-0000551987 00000 n 
-0000556020 00000 n 
-0000556137 00000 n 
-0000556196 00000 n 
-0000556255 00000 n 
-0000556314 00000 n 
-0000556429 00000 n 
-0000560592 00000 n 
-0000560748 00000 n 
-0000561271 00000 n 
-0000560274 00000 n 
-0000556743 00000 n 
-0000560913 00000 n 
-0000560971 00000 n 
-0000561030 00000 n 
-0000561153 00000 n 
-0000561212 00000 n 
-0000564939 00000 n 
-0000565457 00000 n 
-0000564795 00000 n 
-0000561527 00000 n 
-0000565104 00000 n 
-0000565162 00000 n 
-0000565221 00000 n 
-0000565280 00000 n 
-0000565398 00000 n 
-0004858505 00000 n 
-0000567659 00000 n 
-0000567854 00000 n 
-0000568040 00000 n 
-0000568226 00000 n 
-0000568411 00000 n 
-0000568603 00000 n 
-0000568793 00000 n 
-0000568985 00000 n 
-0000569171 00000 n 
-0000569363 00000 n 
-0000569558 00000 n 
-0000569746 00000 n 
-0000569933 00000 n 
-0000570126 00000 n 
-0000572484 00000 n 
-0000572665 00000 n 
-0000570311 00000 n 
-0000570826 00000 n 
-0000567389 00000 n 
-0000565698 00000 n 
-0000570476 00000 n 
-0000570709 00000 n 
-0000570767 00000 n 
-0000572861 00000 n 
-0000573072 00000 n 
-0000573267 00000 n 
-0000573463 00000 n 
-0000573658 00000 n 
-0000573870 00000 n 
-0000574066 00000 n 
-0000574254 00000 n 
-0000574444 00000 n 
-0000574649 00000 n 
-0000574850 00000 n 
-0000575032 00000 n 
-0000575219 00000 n 
-0000575410 00000 n 
-0000575604 00000 n 
-0000575808 00000 n 
-0000576014 00000 n 
-0000576216 00000 n 
-0000576417 00000 n 
-0000576617 00000 n 
-0000576819 00000 n 
-0000579163 00000 n 
-0000579372 00000 n 
-0000577029 00000 n 
-0000577252 00000 n 
-0000572133 00000 n 
-0000570979 00000 n 
-0000577194 00000 n 
-0000579562 00000 n 
-0000579755 00000 n 
-0000579952 00000 n 
-0000580149 00000 n 
-0000580346 00000 n 
-0000580540 00000 n 
-0000580735 00000 n 
-0000580917 00000 n 
-0000581109 00000 n 
-0000581303 00000 n 
-0000581503 00000 n 
-0000581702 00000 n 
-0000581906 00000 n 
-0000582097 00000 n 
-0000582302 00000 n 
-0000582495 00000 n 
-0000582684 00000 n 
-0000582838 00000 n 
-0000583023 00000 n 
-0000583219 00000 n 
-0000583430 00000 n 
-0000583644 00000 n 
-0000583859 00000 n 
-0000584045 00000 n 
-0000586203 00000 n 
-0000586420 00000 n 
-0000584254 00000 n 
-0000584477 00000 n 
-0000578785 00000 n 
-0000577392 00000 n 
-0000584419 00000 n 
-0000586641 00000 n 
-0000586856 00000 n 
-0000587071 00000 n 
-0000587256 00000 n 
-0000587452 00000 n 
-0000587648 00000 n 
-0000587841 00000 n 
-0000588033 00000 n 
-0000588224 00000 n 
-0000588418 00000 n 
-0000588620 00000 n 
-0000588820 00000 n 
-0000589009 00000 n 
-0000589214 00000 n 
-0000589419 00000 n 
-0000589630 00000 n 
-0000589840 00000 n 
-0000590051 00000 n 
-0000593518 00000 n 
-0000593730 00000 n 
-0000593975 00000 n 
-0000594220 00000 n 
-0000594465 00000 n 
-0000594710 00000 n 
-0000594922 00000 n 
-0000595165 00000 n 
-0000595409 00000 n 
-0000595653 00000 n 
-0000595896 00000 n 
-0000596140 00000 n 
-0000596385 00000 n 
-0000596630 00000 n 
-0000590255 00000 n 
-0000590537 00000 n 
-0000585879 00000 n 
-0000584617 00000 n 
-0000590420 00000 n 
-0000590478 00000 n 
-0000655882 00000 n 
-0000656000 00000 n 
-0000656123 00000 n 
-0000596875 00000 n 
-0000597080 00000 n 
-0000597315 00000 n 
-0000597552 00000 n 
-0000597789 00000 n 
-0000598026 00000 n 
-0000598264 00000 n 
-0000598503 00000 n 
-0000598742 00000 n 
-0000598981 00000 n 
-0000599218 00000 n 
-0000599455 00000 n 
-0000599693 00000 n 
-0000599931 00000 n 
-0000600169 00000 n 
-0000600408 00000 n 
-0000600647 00000 n 
-0000600886 00000 n 
-0000601123 00000 n 
-0000601361 00000 n 
-0000601599 00000 n 
-0000601837 00000 n 
-0000602075 00000 n 
-0000602313 00000 n 
-0000602552 00000 n 
-0000602791 00000 n 
-0000603029 00000 n 
-0000603268 00000 n 
-0000603506 00000 n 
-0000603983 00000 n 
-0000604186 00000 n 
-0000604424 00000 n 
-0000604663 00000 n 
-0000604902 00000 n 
-0000605140 00000 n 
-0000605378 00000 n 
-0000605582 00000 n 
-0000605820 00000 n 
-0000606057 00000 n 
-0000606261 00000 n 
-0000606499 00000 n 
-0000606738 00000 n 
-0000606977 00000 n 
-0000607216 00000 n 
-0000607454 00000 n 
-0000607693 00000 n 
-0000607898 00000 n 
-0000608137 00000 n 
-0000608376 00000 n 
-0000608853 00000 n 
-0000609058 00000 n 
-0000609297 00000 n 
-0000609536 00000 n 
-0000609741 00000 n 
-0000609979 00000 n 
-0000610218 00000 n 
-0000610457 00000 n 
-0000610696 00000 n 
-0000610934 00000 n 
-0000611139 00000 n 
-0000611378 00000 n 
-0000611617 00000 n 
-0000611821 00000 n 
-0000612060 00000 n 
-0000612299 00000 n 
-0000612776 00000 n 
-0000612981 00000 n 
-0000613220 00000 n 
-0000613459 00000 n 
-0000613664 00000 n 
-0000613902 00000 n 
-0000614141 00000 n 
-0000614380 00000 n 
-0000614619 00000 n 
-0000614857 00000 n 
-0000615096 00000 n 
-0000615335 00000 n 
-0000615538 00000 n 
-0000615776 00000 n 
-0000618593 00000 n 
-0000618798 00000 n 
-0000619037 00000 n 
-0000619513 00000 n 
-0000616014 00000 n 
-0000616296 00000 n 
-0000592510 00000 n 
-0000590690 00000 n 
-0000616179 00000 n 
-0000616237 00000 n 
-0000603745 00000 n 
-0000608615 00000 n 
-0000612538 00000 n 
-0000656305 00000 n 
-0000656423 00000 n 
-0000656487 00000 n 
-0000656550 00000 n 
-0000656614 00000 n 
-0000656677 00000 n 
-0000656795 00000 n 
-0000656859 00000 n 
-0000656923 00000 n 
-0000656987 00000 n 
-0000657051 00000 n 
-0000657115 00000 n 
-0000657179 00000 n 
-0000657242 00000 n 
-0000619752 00000 n 
-0000619956 00000 n 
-0000620168 00000 n 
-0000620380 00000 n 
-0000620592 00000 n 
-0000620804 00000 n 
-0000621016 00000 n 
-0000621228 00000 n 
-0000621440 00000 n 
-0000621652 00000 n 
-0000621864 00000 n 
-0000622068 00000 n 
-0000622280 00000 n 
-0000622491 00000 n 
-0000622702 00000 n 
-0000622913 00000 n 
-0000623124 00000 n 
-0000623336 00000 n 
-0000623548 00000 n 
-0000623753 00000 n 
-0000623958 00000 n 
-0000624162 00000 n 
-0000624367 00000 n 
-0000624572 00000 n 
-0000624777 00000 n 
-0000624981 00000 n 
-0000625186 00000 n 
-0000625390 00000 n 
-0000625594 00000 n 
-0000625798 00000 n 
-0000626002 00000 n 
-0000626210 00000 n 
-0000626411 00000 n 
-0000630228 00000 n 
-0000630440 00000 n 
-0000630645 00000 n 
-0000630850 00000 n 
-0000631054 00000 n 
-0000631258 00000 n 
-0000631462 00000 n 
-0000626612 00000 n 
-0000627602 00000 n 
-0000618107 00000 n 
-0000616449 00000 n 
-0000626777 00000 n 
-0000619276 00000 n 
-0000626835 00000 n 
-0000626894 00000 n 
-0000626953 00000 n 
-0000627012 00000 n 
-0000627071 00000 n 
-0000627130 00000 n 
-0000627189 00000 n 
-0000627248 00000 n 
-0000627307 00000 n 
-0000627366 00000 n 
-0000627425 00000 n 
-0000627484 00000 n 
-0000627543 00000 n 
-0004858631 00000 n 
-0000661813 00000 n 
-0000661995 00000 n 
-0000662113 00000 n 
-0000661577 00000 n 
-0000631672 00000 n 
-0000631884 00000 n 
-0000632094 00000 n 
-0000632306 00000 n 
-0000632518 00000 n 
-0000632728 00000 n 
-0000632938 00000 n 
-0000633150 00000 n 
-0000633355 00000 n 
-0000633560 00000 n 
-0000633764 00000 n 
-0000633968 00000 n 
-0000634172 00000 n 
-0000634376 00000 n 
-0000634579 00000 n 
-0000634783 00000 n 
-0000634988 00000 n 
-0000635193 00000 n 
-0000635398 00000 n 
-0000635603 00000 n 
-0000635808 00000 n 
-0000636012 00000 n 
-0000636217 00000 n 
-0000636422 00000 n 
-0000636627 00000 n 
-0000636831 00000 n 
-0000637034 00000 n 
-0000637238 00000 n 
-0000637442 00000 n 
-0000637646 00000 n 
-0000637851 00000 n 
-0000638056 00000 n 
-0000638259 00000 n 
-0000638464 00000 n 
-0000638669 00000 n 
-0000638874 00000 n 
-0000639079 00000 n 
-0000639284 00000 n 
-0000639489 00000 n 
-0000639694 00000 n 
-0000639899 00000 n 
-0000640054 00000 n 
-0000640259 00000 n 
-0000640415 00000 n 
-0000640618 00000 n 
-0000640802 00000 n 
-0000644017 00000 n 
-0000644221 00000 n 
-0000644407 00000 n 
-0000644563 00000 n 
-0000644765 00000 n 
-0000640955 00000 n 
-0000641589 00000 n 
-0000629607 00000 n 
-0000627783 00000 n 
-0000641120 00000 n 
-0000641178 00000 n 
-0000641237 00000 n 
-0000641295 00000 n 
-0000641354 00000 n 
-0000641412 00000 n 
-0000641471 00000 n 
-0000641530 00000 n 
-0000661695 00000 n 
-0000644954 00000 n 
-0000645110 00000 n 
-0000645315 00000 n 
-0000645505 00000 n 
-0000645660 00000 n 
-0000645865 00000 n 
-0000646054 00000 n 
-0000646245 00000 n 
-0000646400 00000 n 
-0000646605 00000 n 
-0000646796 00000 n 
-0000646987 00000 n 
-0000647143 00000 n 
-0000647348 00000 n 
-0000647551 00000 n 
-0000647705 00000 n 
-0000647910 00000 n 
-0000648115 00000 n 
-0000648271 00000 n 
-0000648475 00000 n 
-0000648661 00000 n 
-0000648865 00000 n 
-0000649021 00000 n 
-0000649226 00000 n 
-0000649413 00000 n 
-0000649616 00000 n 
-0000649772 00000 n 
-0000649975 00000 n 
-0000650167 00000 n 
-0000650370 00000 n 
-0000650525 00000 n 
-0000650726 00000 n 
-0000651112 00000 n 
-0000651316 00000 n 
-0000651472 00000 n 
-0000651658 00000 n 
-0000651862 00000 n 
-0000652144 00000 n 
-0000643495 00000 n 
-0000641771 00000 n 
-0000652027 00000 n 
-0000650919 00000 n 
-0000652085 00000 n 
-0000654170 00000 n 
-0000654364 00000 n 
-0000654556 00000 n 
-0000654748 00000 n 
-0000654943 00000 n 
-0000655146 00000 n 
-0000655347 00000 n 
-0000655541 00000 n 
-0000657305 00000 n 
-0000653963 00000 n 
-0000652324 00000 n 
-0000655706 00000 n 
-0000655764 00000 n 
-0000655823 00000 n 
-0000655941 00000 n 
-0000656064 00000 n 
-0000656187 00000 n 
-0000656246 00000 n 
-0000656364 00000 n 
-0000656736 00000 n 
-0000660431 00000 n 
-0000660854 00000 n 
-0000661066 00000 n 
-0000661295 00000 n 
-0000662417 00000 n 
-0000660251 00000 n 
-0000657473 00000 n 
-0000661460 00000 n 
-0000661518 00000 n 
-0000661636 00000 n 
-0000661754 00000 n 
-0000661877 00000 n 
-0000661936 00000 n 
-0000662054 00000 n 
-0000660643 00000 n 
-0000662177 00000 n 
-0000662358 00000 n 
-0000665803 00000 n 
-0000665284 00000 n 
-0000665462 00000 n 
-0000666156 00000 n 
-0000665131 00000 n 
-0000662598 00000 n 
-0000665627 00000 n 
-0000665685 00000 n 
-0000665744 00000 n 
-0000665862 00000 n 
-0000665921 00000 n 
-0000666097 00000 n 
-0000671005 00000 n 
-0000675082 00000 n 
-0000668122 00000 n 
-0000668931 00000 n 
-0000667978 00000 n 
-0000666338 00000 n 
-0000668287 00000 n 
-0000668520 00000 n 
-0004851480 00000 n 
-0000668696 00000 n 
-0000668755 00000 n 
-0004858757 00000 n 
-0000675150 00000 n 
-0000675401 00000 n 
-0000675652 00000 n 
-0000675848 00000 n 
-0000676099 00000 n 
-0000676317 00000 n 
-0000676569 00000 n 
-0000676821 00000 n 
-0000677039 00000 n 
-0000677290 00000 n 
-0000677508 00000 n 
-0000677760 00000 n 
-0000677978 00000 n 
-0000678229 00000 n 
-0000678481 00000 n 
-0000678733 00000 n 
-0000678985 00000 n 
-0000679236 00000 n 
-0000679440 00000 n 
-0000679692 00000 n 
-0000679894 00000 n 
-0000683812 00000 n 
-0000680144 00000 n 
-0000681073 00000 n 
-0000670656 00000 n 
-0000669098 00000 n 
-0000680309 00000 n 
-0000680367 00000 n 
-0000680426 00000 n 
-0000680485 00000 n 
-0000680544 00000 n 
-0000680603 00000 n 
-0004853979 00000 n 
-0000680662 00000 n 
-0000680721 00000 n 
-0000680780 00000 n 
-0000680839 00000 n 
-0004852069 00000 n 
-0000680897 00000 n 
-0000680956 00000 n 
-0000681015 00000 n 
-0000671880 00000 n 
-0000672011 00000 n 
-0000672161 00000 n 
-0000672469 00000 n 
-0000672892 00000 n 
-0000673130 00000 n 
-0000673152 00000 n 
-0000675059 00000 n 
-0000686427 00000 n 
-0000686722 00000 n 
-0000684063 00000 n 
-0000684315 00000 n 
-0000684533 00000 n 
-0000684751 00000 n 
-0000685003 00000 n 
-0000685221 00000 n 
-0000685473 00000 n 
-0000685691 00000 n 
-0000685909 00000 n 
-0000686838 00000 n 
-0000683587 00000 n 
-0000681283 00000 n 
-0000686074 00000 n 
-0000686132 00000 n 
-0000686191 00000 n 
-0000686250 00000 n 
-0000686309 00000 n 
-0000686368 00000 n 
-0000686486 00000 n 
-0004854426 00000 n 
-0000686545 00000 n 
-0000686604 00000 n 
-0000686663 00000 n 
-0000686780 00000 n 
-0000691974 00000 n 
-0000692092 00000 n 
-0000689532 00000 n 
-0000689753 00000 n 
-0000689946 00000 n 
-0000690167 00000 n 
-0000690388 00000 n 
-0000690609 00000 n 
-0000690830 00000 n 
-0000691051 00000 n 
-0000691271 00000 n 
-0000691473 00000 n 
-0000695993 00000 n 
-0000696197 00000 n 
-0000691692 00000 n 
-0000692914 00000 n 
-0000689298 00000 n 
-0000687063 00000 n 
-0000691857 00000 n 
-0000691915 00000 n 
-0000692033 00000 n 
-0000692151 00000 n 
-0000692210 00000 n 
-0000692384 00000 n 
-0000692443 00000 n 
-0000692502 00000 n 
-0000692561 00000 n 
-0000692620 00000 n 
-0000692679 00000 n 
-0000692738 00000 n 
-0000692797 00000 n 
-0000692856 00000 n 
-0000696418 00000 n 
-0000696639 00000 n 
-0000696860 00000 n 
-0000697065 00000 n 
-0000697270 00000 n 
-0000697509 00000 n 
-0000697730 00000 n 
-0000697917 00000 n 
-0000698122 00000 n 
-0000698361 00000 n 
-0000698582 00000 n 
-0000698769 00000 n 
-0000698974 00000 n 
-0000699213 00000 n 
-0000699434 00000 n 
-0000699630 00000 n 
-0000699851 00000 n 
-0000700047 00000 n 
-0000700266 00000 n 
-0000700459 00000 n 
-0000700680 00000 n 
-0000700868 00000 n 
-0000701073 00000 n 
-0000701311 00000 n 
-0000701532 00000 n 
-0000701713 00000 n 
-0000701899 00000 n 
-0000702104 00000 n 
-0000702580 00000 n 
-0000702800 00000 n 
-0000702981 00000 n 
-0000703185 00000 n 
-0000703423 00000 n 
-0000703643 00000 n 
-0000703836 00000 n 
-0000704040 00000 n 
-0000704517 00000 n 
-0000704704 00000 n 
-0000704925 00000 n 
-0000705112 00000 n 
-0000705331 00000 n 
-0000705518 00000 n 
-0000705739 00000 n 
-0000705944 00000 n 
-0000706164 00000 n 
-0000706368 00000 n 
-0000706588 00000 n 
-0000706778 00000 n 
-0000706974 00000 n 
-0000707193 00000 n 
-0000707389 00000 n 
-0000707609 00000 n 
-0000707804 00000 n 
-0000711779 00000 n 
-0000711975 00000 n 
-0000712196 00000 n 
-0000712417 00000 n 
-0000712613 00000 n 
-0000712834 00000 n 
-0000708024 00000 n 
-0000708777 00000 n 
-0000695336 00000 n 
-0000693165 00000 n 
-0000708189 00000 n 
-0000708247 00000 n 
-0000702342 00000 n 
-0000704278 00000 n 
-0000708306 00000 n 
-0000708365 00000 n 
-0000708423 00000 n 
-0000708482 00000 n 
-0000708541 00000 n 
-0004853100 00000 n 
-0000708600 00000 n 
-0000708659 00000 n 
-0000708718 00000 n 
-0000914183 00000 n 
-0000811055 00000 n 
-0000811232 00000 n 
-0000811350 00000 n 
-0000811473 00000 n 
-0000814392 00000 n 
-0000814628 00000 n 
-0000814805 00000 n 
-0000814923 00000 n 
-0000818043 00000 n 
-0000818278 00000 n 
-0000713029 00000 n 
-0000713249 00000 n 
-0000713445 00000 n 
-0000713650 00000 n 
-0000713855 00000 n 
-0000714075 00000 n 
-0000714271 00000 n 
-0000714476 00000 n 
-0000714681 00000 n 
-0000714868 00000 n 
-0000715089 00000 n 
-0000715285 00000 n 
-0000715489 00000 n 
-0000715693 00000 n 
-0000715914 00000 n 
-0000716110 00000 n 
-0000716314 00000 n 
-0000716518 00000 n 
-0000716705 00000 n 
-0000716926 00000 n 
-0000717121 00000 n 
-0000717326 00000 n 
-0000717531 00000 n 
-0000717940 00000 n 
-0000718144 00000 n 
-0000718365 00000 n 
-0000718552 00000 n 
-0000718773 00000 n 
-0000718959 00000 n 
-0000719180 00000 n 
-0000719367 00000 n 
-0000719564 00000 n 
-0000719784 00000 n 
-0000719971 00000 n 
-0000720168 00000 n 
-0000720388 00000 n 
-0000720575 00000 n 
-0000720771 00000 n 
-0000720990 00000 n 
-0000721175 00000 n 
-0000721395 00000 n 
-0000721612 00000 n 
-0000721833 00000 n 
-0000722053 00000 n 
-0000722269 00000 n 
-0000722490 00000 n 
-0000722710 00000 n 
-0000722895 00000 n 
-0000727304 00000 n 
-0000727523 00000 n 
-0000723114 00000 n 
-0000723808 00000 n 
-0000711140 00000 n 
-0000709000 00000 n 
-0000723279 00000 n 
-0000723337 00000 n 
-0000717735 00000 n 
-0000723396 00000 n 
-0000723455 00000 n 
-0000723514 00000 n 
-0000723573 00000 n 
-0000723632 00000 n 
-0000723691 00000 n 
-0000723750 00000 n 
-0000821748 00000 n 
-0000821925 00000 n 
-0000822102 00000 n 
-0000822338 00000 n 
-0000826020 00000 n 
-0000826261 00000 n 
-0000830213 00000 n 
-0000830453 00000 n 
-0000830634 00000 n 
-0000830811 00000 n 
-0000833879 00000 n 
-0000834056 00000 n 
-0000834232 00000 n 
-0000834408 00000 n 
-0000727711 00000 n 
-0000727930 00000 n 
-0000728118 00000 n 
-0000728337 00000 n 
-0000728533 00000 n 
-0000728752 00000 n 
-0000728948 00000 n 
-0000729167 00000 n 
-0000729362 00000 n 
-0000729581 00000 n 
-0000729777 00000 n 
-0000729996 00000 n 
-0000730184 00000 n 
-0000730402 00000 n 
-0000730590 00000 n 
-0000730808 00000 n 
-0000731004 00000 n 
-0000731223 00000 n 
-0000731419 00000 n 
-0000731640 00000 n 
-0000731830 00000 n 
-0000732016 00000 n 
-0000732206 00000 n 
-0000732392 00000 n 
-0000732579 00000 n 
-0000732800 00000 n 
-0000732990 00000 n 
-0000733176 00000 n 
-0000733366 00000 n 
-0000733552 00000 n 
-0000733757 00000 n 
-0000733942 00000 n 
-0000734160 00000 n 
-0000734379 00000 n 
-0000734565 00000 n 
-0000734731 00000 n 
-0000734950 00000 n 
-0000735142 00000 n 
-0000735308 00000 n 
-0000735527 00000 n 
-0000735714 00000 n 
-0000735933 00000 n 
-0000736118 00000 n 
-0000736339 00000 n 
-0000736524 00000 n 
-0000736745 00000 n 
-0000736932 00000 n 
-0000737149 00000 n 
-0000742072 00000 n 
-0000742293 00000 n 
-0000742480 00000 n 
-0000737334 00000 n 
-0000737557 00000 n 
-0000726710 00000 n 
-0000723977 00000 n 
-0000737499 00000 n 
-0004858883 00000 n 
-0000834584 00000 n 
-0000837642 00000 n 
-0000837878 00000 n 
-0000838114 00000 n 
-0000838350 00000 n 
-0000841527 00000 n 
-0000841761 00000 n 
-0000841997 00000 n 
-0000845818 00000 n 
-0000846054 00000 n 
-0000846285 00000 n 
-0000846521 00000 n 
-0000851243 00000 n 
-0000855187 00000 n 
-0000855428 00000 n 
-0000855664 00000 n 
-0000855841 00000 n 
-0000856018 00000 n 
-0000859964 00000 n 
-0000860140 00000 n 
-0000742660 00000 n 
-0000742880 00000 n 
-0000743066 00000 n 
-0000743262 00000 n 
-0000743474 00000 n 
-0000743654 00000 n 
-0000743874 00000 n 
-0000744059 00000 n 
-0000744247 00000 n 
-0000744431 00000 n 
-0000744601 00000 n 
-0000744822 00000 n 
-0000745008 00000 n 
-0000745204 00000 n 
-0000745412 00000 n 
-0000745592 00000 n 
-0000745813 00000 n 
-0000745999 00000 n 
-0000746204 00000 n 
-0000746400 00000 n 
-0000746610 00000 n 
-0000746787 00000 n 
-0000747008 00000 n 
-0000747204 00000 n 
-0000747409 00000 n 
-0000747605 00000 n 
-0000747783 00000 n 
-0000748003 00000 n 
-0000748188 00000 n 
-0000748392 00000 n 
-0000748586 00000 n 
-0000748798 00000 n 
-0000748975 00000 n 
-0000749196 00000 n 
-0000749392 00000 n 
-0000749597 00000 n 
-0000749792 00000 n 
-0000749970 00000 n 
-0000750191 00000 n 
-0000750376 00000 n 
-0000750572 00000 n 
-0000750964 00000 n 
-0000751176 00000 n 
-0000751364 00000 n 
-0000751585 00000 n 
-0000751771 00000 n 
-0000751967 00000 n 
-0000752359 00000 n 
-0000752571 00000 n 
-0000752759 00000 n 
-0000752977 00000 n 
-0000753164 00000 n 
-0000753334 00000 n 
-0000753555 00000 n 
-0000753747 00000 n 
-0000753952 00000 n 
-0000754362 00000 n 
-0000754567 00000 n 
-0000754763 00000 n 
-0000754930 00000 n 
-0000755149 00000 n 
-0000755353 00000 n 
-0000755592 00000 n 
-0000755813 00000 n 
-0000756005 00000 n 
-0000756210 00000 n 
-0000756448 00000 n 
-0000756666 00000 n 
-0000756883 00000 n 
-0000760867 00000 n 
-0000761034 00000 n 
-0000761253 00000 n 
-0000757068 00000 n 
-0000757350 00000 n 
-0000741253 00000 n 
-0000737767 00000 n 
-0000757233 00000 n 
-0004852807 00000 n 
-0000750768 00000 n 
-0000752163 00000 n 
-0000754157 00000 n 
-0000757291 00000 n 
-0000860317 00000 n 
-0000860494 00000 n 
-0000864383 00000 n 
-0000864618 00000 n 
-0000864854 00000 n 
-0000869250 00000 n 
-0000869486 00000 n 
-0000874265 00000 n 
-0000874501 00000 n 
-0000874737 00000 n 
-0000879867 00000 n 
-0000880040 00000 n 
-0000883781 00000 n 
-0000883958 00000 n 
-0000884134 00000 n 
-0000761439 00000 n 
-0000761606 00000 n 
-0000761825 00000 n 
-0000762012 00000 n 
-0000762175 00000 n 
-0000762395 00000 n 
-0000762581 00000 n 
-0000762775 00000 n 
-0000762938 00000 n 
-0000763157 00000 n 
-0000763344 00000 n 
-0000763512 00000 n 
-0000763733 00000 n 
-0000763920 00000 n 
-0000764116 00000 n 
-0000764284 00000 n 
-0000764503 00000 n 
-0000764690 00000 n 
-0000764851 00000 n 
-0000765069 00000 n 
-0000765256 00000 n 
-0000765477 00000 n 
-0000765664 00000 n 
-0000765860 00000 n 
-0000766019 00000 n 
-0000766238 00000 n 
-0000766443 00000 n 
-0000766662 00000 n 
-0000766866 00000 n 
-0000767085 00000 n 
-0000767269 00000 n 
-0000767441 00000 n 
-0000767659 00000 n 
-0000767851 00000 n 
-0000768070 00000 n 
-0000768275 00000 n 
-0000768494 00000 n 
-0000768686 00000 n 
-0000768905 00000 n 
-0000769091 00000 n 
-0000769296 00000 n 
-0000769514 00000 n 
-0000769706 00000 n 
-0000769890 00000 n 
-0000770109 00000 n 
-0000770290 00000 n 
-0000770474 00000 n 
-0000770677 00000 n 
-0000773878 00000 n 
-0000774099 00000 n 
-0000770896 00000 n 
-0000771294 00000 n 
-0000760264 00000 n 
-0000757614 00000 n 
-0000771061 00000 n 
-0000771119 00000 n 
-0000771178 00000 n 
-0000771236 00000 n 
-0000884368 00000 n 
-0000888984 00000 n 
-0000889219 00000 n 
-0000889455 00000 n 
-0000893992 00000 n 
-0000894228 00000 n 
-0000898421 00000 n 
-0000898657 00000 n 
-0000898834 00000 n 
-0000899011 00000 n 
-0000903781 00000 n 
-0000904017 00000 n 
-0000904194 00000 n 
-0000909994 00000 n 
-0000910234 00000 n 
-0000910474 00000 n 
-0000774320 00000 n 
-0000774540 00000 n 
-0000774726 00000 n 
-0000774947 00000 n 
-0000775134 00000 n 
-0000775321 00000 n 
-0000775541 00000 n 
-0000775728 00000 n 
-0000775915 00000 n 
-0000776136 00000 n 
-0000776323 00000 n 
-0000776510 00000 n 
-0000776731 00000 n 
-0000776924 00000 n 
-0000777297 00000 n 
-0000777484 00000 n 
-0000777689 00000 n 
-0000777910 00000 n 
-0000778103 00000 n 
-0000778476 00000 n 
-0000778663 00000 n 
-0000778868 00000 n 
-0000779089 00000 n 
-0000779282 00000 n 
-0000779655 00000 n 
-0000779841 00000 n 
-0000780046 00000 n 
-0000780267 00000 n 
-0000780460 00000 n 
-0000780833 00000 n 
-0000781020 00000 n 
-0000781225 00000 n 
-0000781445 00000 n 
-0000781637 00000 n 
-0000782009 00000 n 
-0000782196 00000 n 
-0000782401 00000 n 
-0000782622 00000 n 
-0000782815 00000 n 
-0000783187 00000 n 
-0000783372 00000 n 
-0000786734 00000 n 
-0000786955 00000 n 
-0000787148 00000 n 
-0000787521 00000 n 
-0000787708 00000 n 
-0000783576 00000 n 
-0000783976 00000 n 
-0000773293 00000 n 
-0000771516 00000 n 
-0000783741 00000 n 
-0000783799 00000 n 
-0000783858 00000 n 
-0000783917 00000 n 
-0000777111 00000 n 
-0000778290 00000 n 
-0000779469 00000 n 
-0000780647 00000 n 
-0000781823 00000 n 
-0000783002 00000 n 
-0000914360 00000 n 
-0000914478 00000 n 
-0000914600 00000 n 
-0000914718 00000 n 
-0000914839 00000 n 
-0000917753 00000 n 
-0000917871 00000 n 
-0000917994 00000 n 
-0000918117 00000 n 
-0000918235 00000 n 
-0000787913 00000 n 
-0000788134 00000 n 
-0000788327 00000 n 
-0000788700 00000 n 
-0000788887 00000 n 
-0000789092 00000 n 
-0000789313 00000 n 
-0000789506 00000 n 
-0000789879 00000 n 
-0000790065 00000 n 
-0000790270 00000 n 
-0000790490 00000 n 
-0000790677 00000 n 
-0000790864 00000 n 
-0000791085 00000 n 
-0000791272 00000 n 
-0000791459 00000 n 
-0000791680 00000 n 
-0000791873 00000 n 
-0000792245 00000 n 
-0000792431 00000 n 
-0000792635 00000 n 
-0000792854 00000 n 
-0000793045 00000 n 
-0000793416 00000 n 
-0000793603 00000 n 
-0000793808 00000 n 
-0000794029 00000 n 
-0000794222 00000 n 
-0000794595 00000 n 
-0000794782 00000 n 
-0000794987 00000 n 
-0000795208 00000 n 
-0000795401 00000 n 
-0000795774 00000 n 
-0000795961 00000 n 
-0000796166 00000 n 
-0000796387 00000 n 
-0000796580 00000 n 
-0000796953 00000 n 
-0000797140 00000 n 
-0000797345 00000 n 
-0000797566 00000 n 
-0000797759 00000 n 
-0000798132 00000 n 
-0000798319 00000 n 
-0000798524 00000 n 
-0000798745 00000 n 
-0000798938 00000 n 
-0000799311 00000 n 
-0000799498 00000 n 
-0000799703 00000 n 
-0000799924 00000 n 
-0000800117 00000 n 
-0000800490 00000 n 
-0000800677 00000 n 
-0000800882 00000 n 
-0000801103 00000 n 
-0000801296 00000 n 
-0000801669 00000 n 
-0000801856 00000 n 
-0000802061 00000 n 
-0000802282 00000 n 
-0000802469 00000 n 
-0000802656 00000 n 
-0000802874 00000 n 
-0000803058 00000 n 
-0000803281 00000 n 
-0000785843 00000 n 
-0000784171 00000 n 
-0000803223 00000 n 
-0000787335 00000 n 
-0000788514 00000 n 
-0000789693 00000 n 
-0000792060 00000 n 
-0000793230 00000 n 
-0000794409 00000 n 
-0000795588 00000 n 
-0000796767 00000 n 
-0000797946 00000 n 
-0000799125 00000 n 
-0000800304 00000 n 
-0000801483 00000 n 
-0000921296 00000 n 
-0000921419 00000 n 
-0000921535 00000 n 
-0000921776 00000 n 
-0000924930 00000 n 
-0000925048 00000 n 
-0000925166 00000 n 
-0000925284 00000 n 
-0000925402 00000 n 
-0000925520 00000 n 
-0000925636 00000 n 
-0000925754 00000 n 
-0000807080 00000 n 
-0000807271 00000 n 
-0000807459 00000 n 
-0000807647 00000 n 
-0000807835 00000 n 
-0000808176 00000 n 
-0000806900 00000 n 
-0000803490 00000 n 
-0000808000 00000 n 
-0000808058 00000 n 
-0000808117 00000 n 
-0000810773 00000 n 
-0000811594 00000 n 
-0000810629 00000 n 
-0000808392 00000 n 
-0000810938 00000 n 
-0000810996 00000 n 
-0000811114 00000 n 
-0000811173 00000 n 
-0000811291 00000 n 
-0000811414 00000 n 
-0000811536 00000 n 
-0004859009 00000 n 
-0000814052 00000 n 
-0000815044 00000 n 
-0000813908 00000 n 
-0000811800 00000 n 
-0000814217 00000 n 
-0000814275 00000 n 
-0000814334 00000 n 
-0000814451 00000 n 
-0000814510 00000 n 
-0000814569 00000 n 
-0000814687 00000 n 
-0000814746 00000 n 
-0000814864 00000 n 
-0000814986 00000 n 
-0000817702 00000 n 
-0000818455 00000 n 
-0000817558 00000 n 
-0000815225 00000 n 
-0000817867 00000 n 
-0000817925 00000 n 
-0000817984 00000 n 
-0000818102 00000 n 
-0000818161 00000 n 
-0000818219 00000 n 
-0000818337 00000 n 
-0000818396 00000 n 
-0000821407 00000 n 
-0000822461 00000 n 
-0000821263 00000 n 
-0000818636 00000 n 
-0000821572 00000 n 
-0000821630 00000 n 
-0000821689 00000 n 
-0000821807 00000 n 
-0000821866 00000 n 
-0000821984 00000 n 
-0000822043 00000 n 
-0000822161 00000 n 
-0000822220 00000 n 
-0000822279 00000 n 
-0000822402 00000 n 
-0000825679 00000 n 
-0000826443 00000 n 
-0000825535 00000 n 
-0000822655 00000 n 
-0000825844 00000 n 
-0000825902 00000 n 
-0000825961 00000 n 
-0000826084 00000 n 
-0000826143 00000 n 
-0000826202 00000 n 
-0000826325 00000 n 
-0000826384 00000 n 
-0000829587 00000 n 
-0000829768 00000 n 
-0000829931 00000 n 
-0000830929 00000 n 
-0000829425 00000 n 
-0000826637 00000 n 
-0000830096 00000 n 
-0000830154 00000 n 
-0000830277 00000 n 
-0000830336 00000 n 
-0000830394 00000 n 
-0000830517 00000 n 
-0000830575 00000 n 
-0000830693 00000 n 
-0000830752 00000 n 
-0000830870 00000 n 
-0000833597 00000 n 
-0000834820 00000 n 
-0000833453 00000 n 
-0000831135 00000 n 
-0000833762 00000 n 
-0000833820 00000 n 
-0000833938 00000 n 
-0000833997 00000 n 
-0000834115 00000 n 
-0000834174 00000 n 
-0000834290 00000 n 
-0000834349 00000 n 
-0000834467 00000 n 
-0000834525 00000 n 
-0000834643 00000 n 
-0000834702 00000 n 
-0000834761 00000 n 
-0004859135 00000 n 
-0000837419 00000 n 
-0000838468 00000 n 
-0000837275 00000 n 
-0000835014 00000 n 
-0000837584 00000 n 
-0000837701 00000 n 
-0000837760 00000 n 
-0000837819 00000 n 
-0000837937 00000 n 
-0000837996 00000 n 
-0000838055 00000 n 
-0000838173 00000 n 
-0000838232 00000 n 
-0000838291 00000 n 
-0000838409 00000 n 
-0000841186 00000 n 
-0000842174 00000 n 
-0000841042 00000 n 
-0000838662 00000 n 
-0000841351 00000 n 
-0000841409 00000 n 
-0000841468 00000 n 
-0000841584 00000 n 
-0000841643 00000 n 
-0000841702 00000 n 
-0000841820 00000 n 
-0000841879 00000 n 
-0000841938 00000 n 
-0000842056 00000 n 
-0000842115 00000 n 
-0000845349 00000 n 
-0000850028 00000 n 
-0000845536 00000 n 
-0000846584 00000 n 
-0000845196 00000 n 
-0000842368 00000 n 
-0000845701 00000 n 
-0000845759 00000 n 
-0000845877 00000 n 
-0000845936 00000 n 
-0000845995 00000 n 
-0000846113 00000 n 
-0000846168 00000 n 
-0000846226 00000 n 
-0000846344 00000 n 
-0000846403 00000 n 
-0000846462 00000 n 
-0000850215 00000 n 
-0000850418 00000 n 
-0000850638 00000 n 
-0000854244 00000 n 
-0000850843 00000 n 
-0000851483 00000 n 
-0000849848 00000 n 
-0000846778 00000 n 
-0000851008 00000 n 
-0000851066 00000 n 
-0000851125 00000 n 
-0000851184 00000 n 
-0000851307 00000 n 
-0000851366 00000 n 
-0000851425 00000 n 
-0000854448 00000 n 
-0000854612 00000 n 
-0000854778 00000 n 
-0000854964 00000 n 
-0000856134 00000 n 
-0000854064 00000 n 
-0000851677 00000 n 
-0000855129 00000 n 
-0000855251 00000 n 
-0000855310 00000 n 
-0000855369 00000 n 
-0000855487 00000 n 
-0000855546 00000 n 
-0000855605 00000 n 
-0000855723 00000 n 
-0000855782 00000 n 
-0000855900 00000 n 
-0000855959 00000 n 
-0000856076 00000 n 
-0000859322 00000 n 
-0000859502 00000 n 
-0000859682 00000 n 
-0000860611 00000 n 
-0000859160 00000 n 
-0000856328 00000 n 
-0000859847 00000 n 
-0000859905 00000 n 
-0000860023 00000 n 
-0000860082 00000 n 
-0000860199 00000 n 
-0000860258 00000 n 
-0000860376 00000 n 
-0000860435 00000 n 
-0000860553 00000 n 
-0004859261 00000 n 
-0000863693 00000 n 
-0000863863 00000 n 
-0000868375 00000 n 
-0000864042 00000 n 
-0000864970 00000 n 
-0000863531 00000 n 
-0000860805 00000 n 
-0000864207 00000 n 
-0000864265 00000 n 
-0000864324 00000 n 
-0000864442 00000 n 
-0000864501 00000 n 
-0000864560 00000 n 
-0000864677 00000 n 
-0000864736 00000 n 
-0000864795 00000 n 
-0000864912 00000 n 
-0000868553 00000 n 
-0000868731 00000 n 
-0000868909 00000 n 
-0000869663 00000 n 
-0000868204 00000 n 
-0000865164 00000 n 
-0000869074 00000 n 
-0000869132 00000 n 
-0000869191 00000 n 
-0000869309 00000 n 
-0000869368 00000 n 
-0000869427 00000 n 
-0000869545 00000 n 
-0000869604 00000 n 
-0000873430 00000 n 
-0000873608 00000 n 
-0000873796 00000 n 
-0000873983 00000 n 
-0000874855 00000 n 
-0000873259 00000 n 
-0000869894 00000 n 
-0000874148 00000 n 
-0000874206 00000 n 
-0000874324 00000 n 
-0000874383 00000 n 
-0000874442 00000 n 
-0000874560 00000 n 
-0000874619 00000 n 
-0000874678 00000 n 
-0000874796 00000 n 
-0000878840 00000 n 
-0000879009 00000 n 
-0000879175 00000 n 
-0000879359 00000 n 
-0000879526 00000 n 
-0000880217 00000 n 
-0000878660 00000 n 
-0000875086 00000 n 
-0000879691 00000 n 
-0000879749 00000 n 
-0000879808 00000 n 
-0000879926 00000 n 
-0000879981 00000 n 
-0000880099 00000 n 
-0000880158 00000 n 
-0000883161 00000 n 
-0000883329 00000 n 
-0000887636 00000 n 
-0000883499 00000 n 
-0000884484 00000 n 
-0000882999 00000 n 
-0000880411 00000 n 
-0000883664 00000 n 
-0000883722 00000 n 
-0000883840 00000 n 
-0000883899 00000 n 
-0000884016 00000 n 
-0000884075 00000 n 
-0000884191 00000 n 
-0000884250 00000 n 
-0000884309 00000 n 
-0000884426 00000 n 
-0000887804 00000 n 
-0000887974 00000 n 
-0000888138 00000 n 
-0000888308 00000 n 
-0000888473 00000 n 
-0000892813 00000 n 
-0000888643 00000 n 
-0000889571 00000 n 
-0000887438 00000 n 
-0000884678 00000 n 
-0000888808 00000 n 
-0000888866 00000 n 
-0000888925 00000 n 
-0000889043 00000 n 
-0000889101 00000 n 
-0000889160 00000 n 
-0000889278 00000 n 
-0000889337 00000 n 
-0000889396 00000 n 
-0000889513 00000 n 
-0004859387 00000 n 
-0000892981 00000 n 
-0000893149 00000 n 
-0000893319 00000 n 
-0000893481 00000 n 
-0000893651 00000 n 
-0000894405 00000 n 
-0000892624 00000 n 
-0000889765 00000 n 
-0000893816 00000 n 
-0000893874 00000 n 
-0000893933 00000 n 
-0004854276 00000 n 
-0000894051 00000 n 
-0000894110 00000 n 
-0000894169 00000 n 
-0000894287 00000 n 
-0000894346 00000 n 
-0000897809 00000 n 
-0000897970 00000 n 
-0000898139 00000 n 
-0000899069 00000 n 
-0000897647 00000 n 
-0000894626 00000 n 
-0000898304 00000 n 
-0000898362 00000 n 
-0000898480 00000 n 
-0000898539 00000 n 
-0000898598 00000 n 
-0000898716 00000 n 
-0000898775 00000 n 
-0000898893 00000 n 
-0000898952 00000 n 
-0000902281 00000 n 
-0000902454 00000 n 
-0000902675 00000 n 
-0000902860 00000 n 
-0000903046 00000 n 
-0000903238 00000 n 
-0000908055 00000 n 
-0000908260 00000 n 
-0000903440 00000 n 
-0000904371 00000 n 
-0000902083 00000 n 
-0000899312 00000 n 
-0000903605 00000 n 
-0000903663 00000 n 
-0000903722 00000 n 
-0000903840 00000 n 
-0000903899 00000 n 
-0000903958 00000 n 
-0000904076 00000 n 
-0000904135 00000 n 
-0000904253 00000 n 
-0000904312 00000 n 
-0000908464 00000 n 
-0000908655 00000 n 
-0000908875 00000 n 
-0000909047 00000 n 
-0000909231 00000 n 
-0000909602 00000 n 
-0000909771 00000 n 
-0000910595 00000 n 
-0000907830 00000 n 
-0000904565 00000 n 
-0000909936 00000 n 
-0000910058 00000 n 
-0000910117 00000 n 
-0000910176 00000 n 
-0000910297 00000 n 
-0000910356 00000 n 
-0000910415 00000 n 
-0000909416 00000 n 
-0000910537 00000 n 
-0000913901 00000 n 
-0000914962 00000 n 
-0000913757 00000 n 
-0000910801 00000 n 
-0000914066 00000 n 
-0000914124 00000 n 
-0000914242 00000 n 
-0000914301 00000 n 
-0000914419 00000 n 
-0000914541 00000 n 
-0000914659 00000 n 
-0000914781 00000 n 
-0000914903 00000 n 
-0000917530 00000 n 
-0000918356 00000 n 
-0000917386 00000 n 
-0000915156 00000 n 
-0000917695 00000 n 
-0000917812 00000 n 
-0000917935 00000 n 
-0000918058 00000 n 
-0000918176 00000 n 
-0000918298 00000 n 
-0004859513 00000 n 
-0000921073 00000 n 
-0000921892 00000 n 
-0000920929 00000 n 
-0000918524 00000 n 
-0000921238 00000 n 
-0000921360 00000 n 
-0000921476 00000 n 
-0000921599 00000 n 
-0000921658 00000 n 
-0000921717 00000 n 
-0000921834 00000 n 
-0000928321 00000 n 
-0000924707 00000 n 
-0000926105 00000 n 
-0000924563 00000 n 
-0000922073 00000 n 
-0000924872 00000 n 
-0000924989 00000 n 
-0000925107 00000 n 
-0000925225 00000 n 
-0000925343 00000 n 
-0000925461 00000 n 
-0000925578 00000 n 
-0000925695 00000 n 
-0000925813 00000 n 
-0000925872 00000 n 
-0000925931 00000 n 
-0000928530 00000 n 
-0000928759 00000 n 
-0000928989 00000 n 
-0000929177 00000 n 
-0000929407 00000 n 
-0000929604 00000 n 
-0000929834 00000 n 
-0000930065 00000 n 
-0000930262 00000 n 
-0000930493 00000 n 
-0000930681 00000 n 
-0000930878 00000 n 
-0000931806 00000 n 
-0000928069 00000 n 
-0000926273 00000 n 
-0000931043 00000 n 
-0000931101 00000 n 
-0000931160 00000 n 
-0000931218 00000 n 
-0000931276 00000 n 
-0000931335 00000 n 
-0000931394 00000 n 
-0000931453 00000 n 
-0000931512 00000 n 
-0000931571 00000 n 
-0000931630 00000 n 
-0000931689 00000 n 
-0000933964 00000 n 
-0000934175 00000 n 
-0000934411 00000 n 
-0000934609 00000 n 
-0000934844 00000 n 
-0000935042 00000 n 
-0000935278 00000 n 
-0000935492 00000 n 
-0000936535 00000 n 
-0000933757 00000 n 
-0000932028 00000 n 
-0000935657 00000 n 
-0000935773 00000 n 
-0000935949 00000 n 
-0000936008 00000 n 
-0000936067 00000 n 
-0000936124 00000 n 
-0000936183 00000 n 
-0000936242 00000 n 
-0000936417 00000 n 
-0000936476 00000 n 
-0000939561 00000 n 
-0000939776 00000 n 
-0000939962 00000 n 
-0000940177 00000 n 
-0000940363 00000 n 
-0000940578 00000 n 
-0000940764 00000 n 
-0000940969 00000 n 
-0000941174 00000 n 
-0000941389 00000 n 
-0000941575 00000 n 
-0000941780 00000 n 
-0000941985 00000 n 
-0000942180 00000 n 
-0000942395 00000 n 
-0000942590 00000 n 
-0000942805 00000 n 
-0000943000 00000 n 
-0000943215 00000 n 
-0000943410 00000 n 
-0000943625 00000 n 
-0000943829 00000 n 
-0000944044 00000 n 
-0000944248 00000 n 
-0000944463 00000 n 
-0000944678 00000 n 
-0000944893 00000 n 
-0000945108 00000 n 
-0000945322 00000 n 
-0000945537 00000 n 
-0000945752 00000 n 
-0000945957 00000 n 
-0000946162 00000 n 
-0000946401 00000 n 
-0000946616 00000 n 
-0000946797 00000 n 
-0000947002 00000 n 
-0000947241 00000 n 
-0000947456 00000 n 
-0000947637 00000 n 
-0000947842 00000 n 
-0000948081 00000 n 
-0000948296 00000 n 
-0000948492 00000 n 
-0000948706 00000 n 
-0000948901 00000 n 
-0000949093 00000 n 
-0000949306 00000 n 
-0000953570 00000 n 
-0000953785 00000 n 
-0000953980 00000 n 
-0000954173 00000 n 
-0000954388 00000 n 
-0000954584 00000 n 
-0000954799 00000 n 
-0000954995 00000 n 
-0000949499 00000 n 
-0000950370 00000 n 
-0000938985 00000 n 
-0000936757 00000 n 
-0000949664 00000 n 
-0000949722 00000 n 
-0000949781 00000 n 
-0000949840 00000 n 
-0000949899 00000 n 
-0000949958 00000 n 
-0000950017 00000 n 
-0000950076 00000 n 
-0000950135 00000 n 
-0000950194 00000 n 
-0000950253 00000 n 
-0000950312 00000 n 
-0001135278 00000 n 
-0001138855 00000 n 
-0001139032 00000 n 
-0001139150 00000 n 
-0001139268 00000 n 
-0001046000 00000 n 
-0001046177 00000 n 
-0001046295 00000 n 
-0001049353 00000 n 
-0001049533 00000 n 
-0001049710 00000 n 
-0000955187 00000 n 
-0000955401 00000 n 
-0000955587 00000 n 
-0000955791 00000 n 
-0000956268 00000 n 
-0000956483 00000 n 
-0000956677 00000 n 
-0000956882 00000 n 
-0000957358 00000 n 
-0000957573 00000 n 
-0000957761 00000 n 
-0000957966 00000 n 
-0000958204 00000 n 
-0000958419 00000 n 
-0000958601 00000 n 
-0000958806 00000 n 
-0000959045 00000 n 
-0000959259 00000 n 
-0000959463 00000 n 
-0000959667 00000 n 
-0000960141 00000 n 
-0000960322 00000 n 
-0000960537 00000 n 
-0000960718 00000 n 
-0000960931 00000 n 
-0000961112 00000 n 
-0000961317 00000 n 
-0000961531 00000 n 
-0000961736 00000 n 
-0000961951 00000 n 
-0000962141 00000 n 
-0000962354 00000 n 
-0000962569 00000 n 
-0000962784 00000 n 
-0000962999 00000 n 
-0000963214 00000 n 
-0000963429 00000 n 
-0000963642 00000 n 
-0000963826 00000 n 
-0000964023 00000 n 
-0000964237 00000 n 
-0000964424 00000 n 
-0000964620 00000 n 
-0000964833 00000 n 
-0000965019 00000 n 
-0000965215 00000 n 
-0000965428 00000 n 
-0000965613 00000 n 
-0000965826 00000 n 
-0000969754 00000 n 
-0000969969 00000 n 
-0000970164 00000 n 
-0000970378 00000 n 
-0000970574 00000 n 
-0000970779 00000 n 
-0000966020 00000 n 
-0000966832 00000 n 
-0000952886 00000 n 
-0000950593 00000 n 
-0000966185 00000 n 
-0000956029 00000 n 
-0000957121 00000 n 
-0000959903 00000 n 
-0000966243 00000 n 
-0000966302 00000 n 
-0000966361 00000 n 
-0000966420 00000 n 
-0000966479 00000 n 
-0000966538 00000 n 
-0000966597 00000 n 
-0000966656 00000 n 
-0000966714 00000 n 
-0000966773 00000 n 
-0004859639 00000 n 
-0001049887 00000 n 
-0001050123 00000 n 
-0001053332 00000 n 
-0001053508 00000 n 
-0001053626 00000 n 
-0001053749 00000 n 
-0001053872 00000 n 
-0001053995 00000 n 
-0001057087 00000 n 
-0001057263 00000 n 
-0001057439 00000 n 
-0001057616 00000 n 
-0001057793 00000 n 
-0000970984 00000 n 
-0000971198 00000 n 
-0000971394 00000 n 
-0000971599 00000 n 
-0000971804 00000 n 
-0000971991 00000 n 
-0000972206 00000 n 
-0000972402 00000 n 
-0000972606 00000 n 
-0000972810 00000 n 
-0000973025 00000 n 
-0000973221 00000 n 
-0000973425 00000 n 
-0000973629 00000 n 
-0000973816 00000 n 
-0000974031 00000 n 
-0000974226 00000 n 
-0000974431 00000 n 
-0000974636 00000 n 
-0000975045 00000 n 
-0000975249 00000 n 
-0000975464 00000 n 
-0000975645 00000 n 
-0000975860 00000 n 
-0000976040 00000 n 
-0000976255 00000 n 
-0000976436 00000 n 
-0000976651 00000 n 
-0000976864 00000 n 
-0000977052 00000 n 
-0000977265 00000 n 
-0000977461 00000 n 
-0000977674 00000 n 
-0000977870 00000 n 
-0000978083 00000 n 
-0000978271 00000 n 
-0000978484 00000 n 
-0000978679 00000 n 
-0000978892 00000 n 
-0000979088 00000 n 
-0000979301 00000 n 
-0000979489 00000 n 
-0000979700 00000 n 
-0000979895 00000 n 
-0000980107 00000 n 
-0000980295 00000 n 
-0000980507 00000 n 
-0000985118 00000 n 
-0000985331 00000 n 
-0000985519 00000 n 
-0000985732 00000 n 
-0000985928 00000 n 
-0000986132 00000 n 
-0000986345 00000 n 
-0000980702 00000 n 
-0000980984 00000 n 
-0000969124 00000 n 
-0000967042 00000 n 
-0000980867 00000 n 
-0000974840 00000 n 
-0000980925 00000 n 
-0001061304 00000 n 
-0001061481 00000 n 
-0001061717 00000 n 
-0001065493 00000 n 
-0001065734 00000 n 
-0001065975 00000 n 
-0001069679 00000 n 
-0001069861 00000 n 
-0001070038 00000 n 
-0001070215 00000 n 
-0001073464 00000 n 
-0001073700 00000 n 
-0001073936 00000 n 
-0001074172 00000 n 
-0001077264 00000 n 
-0001077500 00000 n 
-0001077736 00000 n 
-0001081267 00000 n 
-0001081503 00000 n 
-0000986531 00000 n 
-0000986696 00000 n 
-0000986909 00000 n 
-0000987101 00000 n 
-0000987267 00000 n 
-0000987480 00000 n 
-0000987661 00000 n 
-0000987874 00000 n 
-0000988053 00000 n 
-0000988268 00000 n 
-0000988447 00000 n 
-0000988660 00000 n 
-0000988841 00000 n 
-0000989056 00000 n 
-0000989237 00000 n 
-0000989417 00000 n 
-0000989631 00000 n 
-0000989817 00000 n 
-0000990013 00000 n 
-0000990225 00000 n 
-0000990405 00000 n 
-0000990618 00000 n 
-0000990804 00000 n 
-0000990992 00000 n 
-0000991162 00000 n 
-0000991377 00000 n 
-0000991563 00000 n 
-0000991759 00000 n 
-0000991967 00000 n 
-0000992146 00000 n 
-0000992361 00000 n 
-0000992547 00000 n 
-0000992752 00000 n 
-0000992948 00000 n 
-0000993160 00000 n 
-0000993338 00000 n 
-0000993552 00000 n 
-0000993737 00000 n 
-0000993941 00000 n 
-0000994135 00000 n 
-0000994347 00000 n 
-0000994524 00000 n 
-0000994739 00000 n 
-0000994935 00000 n 
-0000995140 00000 n 
-0000995336 00000 n 
-0000995513 00000 n 
-0000995728 00000 n 
-0000995924 00000 n 
-0000996129 00000 n 
-0000996325 00000 n 
-0000996502 00000 n 
-0000996717 00000 n 
-0000996902 00000 n 
-0000997098 00000 n 
-0000997489 00000 n 
-0000997700 00000 n 
-0000997888 00000 n 
-0000998101 00000 n 
-0000998285 00000 n 
-0000998479 00000 n 
-0000998867 00000 n 
-0001002900 00000 n 
-0001003088 00000 n 
-0001003300 00000 n 
-0000999077 00000 n 
-0000999300 00000 n 
-0000984335 00000 n 
-0000981153 00000 n 
-0000999242 00000 n 
-0000997294 00000 n 
-0000998673 00000 n 
-0001081739 00000 n 
-0001085642 00000 n 
-0001085877 00000 n 
-0001086110 00000 n 
-0001089239 00000 n 
-0001089416 00000 n 
-0001089593 00000 n 
-0001089770 00000 n 
-0001089947 00000 n 
-0001090124 00000 n 
-0001094398 00000 n 
-0001094634 00000 n 
-0001098346 00000 n 
-0001098582 00000 n 
-0001098818 00000 n 
-0001103182 00000 n 
-0001103418 00000 n 
-0001108372 00000 n 
-0001003481 00000 n 
-0001003651 00000 n 
-0001003864 00000 n 
-0001004079 00000 n 
-0001004271 00000 n 
-0001004476 00000 n 
-0001004886 00000 n 
-0001005091 00000 n 
-0001005287 00000 n 
-0001005454 00000 n 
-0001005667 00000 n 
-0001005871 00000 n 
-0001006110 00000 n 
-0001006325 00000 n 
-0001006517 00000 n 
-0001006722 00000 n 
-0001006961 00000 n 
-0001007142 00000 n 
-0001007357 00000 n 
-0001007525 00000 n 
-0001007706 00000 n 
-0001007921 00000 n 
-0001008089 00000 n 
-0001008301 00000 n 
-0001008482 00000 n 
-0001008693 00000 n 
-0001008870 00000 n 
-0001009062 00000 n 
-0001009230 00000 n 
-0001009411 00000 n 
-0001009626 00000 n 
-0001009794 00000 n 
-0001010007 00000 n 
-0001010212 00000 n 
-0001010425 00000 n 
-0001010629 00000 n 
-0001010842 00000 n 
-0001011021 00000 n 
-0001011232 00000 n 
-0001011423 00000 n 
-0001011634 00000 n 
-0001015116 00000 n 
-0001015328 00000 n 
-0001011837 00000 n 
-0001012178 00000 n 
-0001002351 00000 n 
-0000999537 00000 n 
-0001012002 00000 n 
-0001012060 00000 n 
-0001004681 00000 n 
-0001012119 00000 n 
-0001108608 00000 n 
-0001108785 00000 n 
-0001113528 00000 n 
-0001113705 00000 n 
-0001113882 00000 n 
-0001118787 00000 n 
-0001119023 00000 n 
-0001119259 00000 n 
-0001123221 00000 n 
-0001123398 00000 n 
-0001123575 00000 n 
-0001128371 00000 n 
-0001128611 00000 n 
-0001015520 00000 n 
-0001015733 00000 n 
-0001015919 00000 n 
-0001016124 00000 n 
-0001016335 00000 n 
-0001016526 00000 n 
-0001016709 00000 n 
-0001016914 00000 n 
-0001017129 00000 n 
-0001017310 00000 n 
-0001017524 00000 n 
-0001017739 00000 n 
-0001017953 00000 n 
-0001018133 00000 n 
-0001018313 00000 n 
-0001018527 00000 n 
-0001018708 00000 n 
-0001018889 00000 n 
-0001019104 00000 n 
-0001019285 00000 n 
-0001019466 00000 n 
-0001019681 00000 n 
-0001019862 00000 n 
-0001020077 00000 n 
-0001020270 00000 n 
-0001020449 00000 n 
-0001020627 00000 n 
-0001020831 00000 n 
-0001021046 00000 n 
-0001021239 00000 n 
-0001021419 00000 n 
-0001021598 00000 n 
-0001021803 00000 n 
-0001022017 00000 n 
-0001022209 00000 n 
-0001022389 00000 n 
-0001022568 00000 n 
-0001022773 00000 n 
-0001022985 00000 n 
-0001023176 00000 n 
-0001023354 00000 n 
-0001023531 00000 n 
-0001026833 00000 n 
-0001027047 00000 n 
-0001027240 00000 n 
-0001027420 00000 n 
-0001027599 00000 n 
-0001023734 00000 n 
-0001024250 00000 n 
-0001014576 00000 n 
-0001012428 00000 n 
-0001023899 00000 n 
-0001023957 00000 n 
-0001024015 00000 n 
-0001024073 00000 n 
-0001024132 00000 n 
-0001024191 00000 n 
-0001128788 00000 n 
-0001134797 00000 n 
-0001135038 00000 n 
-0001142636 00000 n 
-0001142754 00000 n 
-0001142872 00000 n 
-0001142995 00000 n 
-0001143118 00000 n 
-0001143236 00000 n 
-0001143354 00000 n 
-0001146658 00000 n 
-0001027804 00000 n 
-0001028018 00000 n 
-0001028211 00000 n 
-0001028390 00000 n 
-0001028568 00000 n 
-0001028772 00000 n 
-0001028987 00000 n 
-0001029180 00000 n 
-0001029361 00000 n 
-0001029541 00000 n 
-0001029744 00000 n 
-0001029959 00000 n 
-0001030152 00000 n 
-0001030333 00000 n 
-0001030514 00000 n 
-0001030718 00000 n 
-0001030933 00000 n 
-0001031126 00000 n 
-0001031307 00000 n 
-0001031486 00000 n 
-0001031691 00000 n 
-0001031906 00000 n 
-0001032099 00000 n 
-0001032279 00000 n 
-0001032460 00000 n 
-0001032664 00000 n 
-0001032877 00000 n 
-0001033068 00000 n 
-0001033248 00000 n 
-0001033427 00000 n 
-0001033632 00000 n 
-0001033845 00000 n 
-0001034036 00000 n 
-0001034216 00000 n 
-0001034395 00000 n 
-0001034600 00000 n 
-0001034814 00000 n 
-0001035007 00000 n 
-0001035187 00000 n 
-0001035368 00000 n 
-0001035572 00000 n 
-0001035786 00000 n 
-0001035979 00000 n 
-0001036159 00000 n 
-0001036338 00000 n 
-0001036543 00000 n 
-0001036757 00000 n 
-0001036950 00000 n 
-0001037130 00000 n 
-0001037309 00000 n 
-0001037514 00000 n 
-0001037729 00000 n 
-0001037922 00000 n 
-0001038103 00000 n 
-0001038284 00000 n 
-0001038489 00000 n 
-0001038704 00000 n 
-0001038897 00000 n 
-0001039078 00000 n 
-0001039259 00000 n 
-0001039464 00000 n 
-0001039677 00000 n 
-0001039868 00000 n 
-0001040047 00000 n 
-0001040226 00000 n 
-0001043898 00000 n 
-0001044113 00000 n 
-0001044294 00000 n 
-0001040429 00000 n 
-0001040652 00000 n 
-0001026059 00000 n 
-0001024445 00000 n 
-0001040594 00000 n 
-0001146781 00000 n 
-0001146899 00000 n 
-0001147022 00000 n 
-0001150434 00000 n 
-0001150552 00000 n 
-0001150675 00000 n 
-0001150798 00000 n 
-0001150916 00000 n 
-0001151034 00000 n 
-0001151152 00000 n 
-0001151270 00000 n 
-0001151388 00000 n 
-0001159043 00000 n 
-0001159161 00000 n 
-0001044475 00000 n 
-0001044690 00000 n 
-0001044871 00000 n 
-0001045051 00000 n 
-0001045232 00000 n 
-0001045409 00000 n 
-0001045600 00000 n 
-0001046418 00000 n 
-0001043673 00000 n 
-0001040861 00000 n 
-0001045765 00000 n 
-0001045823 00000 n 
-0001045882 00000 n 
-0001045941 00000 n 
-0001046059 00000 n 
-0001046118 00000 n 
-0001046236 00000 n 
-0001046359 00000 n 
-0004859765 00000 n 
-0001048812 00000 n 
-0001048971 00000 n 
-0001049130 00000 n 
-0001050181 00000 n 
-0001048650 00000 n 
-0001046613 00000 n 
-0001049295 00000 n 
-0001049416 00000 n 
-0001049474 00000 n 
-0001049592 00000 n 
-0001049651 00000 n 
-0001049769 00000 n 
-0001049828 00000 n 
-0001049946 00000 n 
-0001050005 00000 n 
-0001050064 00000 n 
-0001052991 00000 n 
-0001054058 00000 n 
-0001052847 00000 n 
-0001050362 00000 n 
-0001053156 00000 n 
-0001053214 00000 n 
-0001053273 00000 n 
-0001053391 00000 n 
-0001053449 00000 n 
-0001053567 00000 n 
-0001053690 00000 n 
-0001053813 00000 n 
-0001053936 00000 n 
-0001056746 00000 n 
-0001057907 00000 n 
-0001056602 00000 n 
-0001054239 00000 n 
-0001056911 00000 n 
-0001056969 00000 n 
-0001057028 00000 n 
-0001057146 00000 n 
-0001057205 00000 n 
-0001057321 00000 n 
-0001057380 00000 n 
-0001057498 00000 n 
-0001057557 00000 n 
-0001057675 00000 n 
-0001057734 00000 n 
-0001057848 00000 n 
-0001061022 00000 n 
-0001061958 00000 n 
-0001060878 00000 n 
-0001058101 00000 n 
-0001061187 00000 n 
-0001061245 00000 n 
-0001061363 00000 n 
-0001061422 00000 n 
-0001061540 00000 n 
-0001061599 00000 n 
-0001061658 00000 n 
-0001061781 00000 n 
-0001061840 00000 n 
-0001061899 00000 n 
-0001065270 00000 n 
-0001066098 00000 n 
-0001065126 00000 n 
-0001062152 00000 n 
-0001065435 00000 n 
-0001065557 00000 n 
-0001065616 00000 n 
-0001065675 00000 n 
-0001065798 00000 n 
-0001065857 00000 n 
-0001065916 00000 n 
-0001066039 00000 n 
-0001068996 00000 n 
-0001069176 00000 n 
-0001069338 00000 n 
-0001070392 00000 n 
-0001068834 00000 n 
-0001066292 00000 n 
-0001069503 00000 n 
-0001069561 00000 n 
-0001069620 00000 n 
-0001069743 00000 n 
-0001069802 00000 n 
-0001069920 00000 n 
-0001069979 00000 n 
-0001070097 00000 n 
-0001070156 00000 n 
-0001070274 00000 n 
-0001070333 00000 n 
-0004859891 00000 n 
-0001073003 00000 n 
-0001073182 00000 n 
-0001074230 00000 n 
-0001072850 00000 n 
-0001070598 00000 n 
-0001073347 00000 n 
-0001073405 00000 n 
-0001073523 00000 n 
-0001073582 00000 n 
-0001073641 00000 n 
-0001073759 00000 n 
-0001073818 00000 n 
-0001073877 00000 n 
-0001073995 00000 n 
-0001074054 00000 n 
-0001074113 00000 n 
-0001076864 00000 n 
-0001077853 00000 n 
-0001076720 00000 n 
-0001074424 00000 n 
-0001077029 00000 n 
-0001077087 00000 n 
-0001077146 00000 n 
-0001077205 00000 n 
-0001077323 00000 n 
-0001077382 00000 n 
-0001077441 00000 n 
-0001077559 00000 n 
-0001077618 00000 n 
-0001077677 00000 n 
-0001077795 00000 n 
-0001080499 00000 n 
-0001080927 00000 n 
-0001081916 00000 n 
-0001080337 00000 n 
-0001078047 00000 n 
-0001081092 00000 n 
-0001081150 00000 n 
-0001081209 00000 n 
-0001080712 00000 n 
-0001081326 00000 n 
-0001081385 00000 n 
-0001081444 00000 n 
-0001081562 00000 n 
-0001081621 00000 n 
-0001081680 00000 n 
-0001081798 00000 n 
-0001081857 00000 n 
-0001084847 00000 n 
-0001085011 00000 n 
-0001085177 00000 n 
-0001085360 00000 n 
-0001086346 00000 n 
-0001084676 00000 n 
-0001082110 00000 n 
-0001085525 00000 n 
-0001085583 00000 n 
-0001085701 00000 n 
-0001085760 00000 n 
-0001085819 00000 n 
-0001085935 00000 n 
-0001085994 00000 n 
-0001086051 00000 n 
-0001086169 00000 n 
-0001086228 00000 n 
-0001086287 00000 n 
-0001088836 00000 n 
-0001093528 00000 n 
-0001089016 00000 n 
-0001090240 00000 n 
-0001088683 00000 n 
-0001086540 00000 n 
-0001089181 00000 n 
-0001089298 00000 n 
-0001089357 00000 n 
-0001089475 00000 n 
-0001089534 00000 n 
-0001089652 00000 n 
-0001089711 00000 n 
-0001089829 00000 n 
-0001089888 00000 n 
-0001090006 00000 n 
-0001090065 00000 n 
-0001090182 00000 n 
-0001093707 00000 n 
-0001093877 00000 n 
-0001094057 00000 n 
-0001094813 00000 n 
-0001093357 00000 n 
-0001090434 00000 n 
-0001094222 00000 n 
-0001094280 00000 n 
-0001094339 00000 n 
-0001094457 00000 n 
-0001094516 00000 n 
-0001094575 00000 n 
-0001094696 00000 n 
-0001094754 00000 n 
-0004860017 00000 n 
-0001097708 00000 n 
-0001097886 00000 n 
-0001102297 00000 n 
-0001098064 00000 n 
-0001098934 00000 n 
-0001097546 00000 n 
-0001095007 00000 n 
-0001098229 00000 n 
-0001098287 00000 n 
-0001098405 00000 n 
-0001098464 00000 n 
-0001098523 00000 n 
-0001098641 00000 n 
-0001098700 00000 n 
-0001098759 00000 n 
-0001098876 00000 n 
-0001102475 00000 n 
-0001102653 00000 n 
-0001102841 00000 n 
-0001103595 00000 n 
-0001102126 00000 n 
-0001099165 00000 n 
-0001103006 00000 n 
-0001103064 00000 n 
-0001103123 00000 n 
-0001103241 00000 n 
-0001103300 00000 n 
-0001103359 00000 n 
-0001103477 00000 n 
-0001103536 00000 n 
-0001107382 00000 n 
-0001107569 00000 n 
-0001107739 00000 n 
-0001107905 00000 n 
-0001112534 00000 n 
-0001112715 00000 n 
-0001108090 00000 n 
-0001108962 00000 n 
-0001107202 00000 n 
-0001103826 00000 n 
-0001108255 00000 n 
-0001108313 00000 n 
-0001108431 00000 n 
-0001108490 00000 n 
-0001108549 00000 n 
-0001108667 00000 n 
-0001108726 00000 n 
-0001108844 00000 n 
-0001108903 00000 n 
-0001112895 00000 n 
-0001113081 00000 n 
-0001113246 00000 n 
-0001113999 00000 n 
-0001112354 00000 n 
-0001109193 00000 n 
-0001113411 00000 n 
-0001113469 00000 n 
-0001113587 00000 n 
-0001113646 00000 n 
-0001113764 00000 n 
-0001113823 00000 n 
-0001113940 00000 n 
-0001117607 00000 n 
-0001117775 00000 n 
-0001117942 00000 n 
-0001118110 00000 n 
-0001118280 00000 n 
-0001118446 00000 n 
-0001119377 00000 n 
-0001117418 00000 n 
-0001114193 00000 n 
-0001118611 00000 n 
-0001118669 00000 n 
-0001118728 00000 n 
-0001118846 00000 n 
-0001118905 00000 n 
-0001118964 00000 n 
-0001119082 00000 n 
-0001119141 00000 n 
-0001119200 00000 n 
-0001119318 00000 n 
-0001122699 00000 n 
-0001122880 00000 n 
-0001123693 00000 n 
-0001122546 00000 n 
-0001119571 00000 n 
-0001123045 00000 n 
-0001123103 00000 n 
-0001123162 00000 n 
-0001123280 00000 n 
-0001123339 00000 n 
-0001123457 00000 n 
-0001123516 00000 n 
-0001123634 00000 n 
-0004860143 00000 n 
-0001127382 00000 n 
-0001127567 00000 n 
-0001127753 00000 n 
-0001127944 00000 n 
-0001132864 00000 n 
-0001133068 00000 n 
-0001128148 00000 n 
-0001128965 00000 n 
-0001127202 00000 n 
-0001123951 00000 n 
-0001128313 00000 n 
-0001128435 00000 n 
-0001128494 00000 n 
-0001128553 00000 n 
-0001128670 00000 n 
-0001128729 00000 n 
-0001128847 00000 n 
-0001128906 00000 n 
-0001133271 00000 n 
-0001133462 00000 n 
-0001133676 00000 n 
-0001133847 00000 n 
-0001134032 00000 n 
-0001134403 00000 n 
-0001134574 00000 n 
-0001135401 00000 n 
-0001132639 00000 n 
-0001129221 00000 n 
-0001134739 00000 n 
-0001134861 00000 n 
-0001134920 00000 n 
-0001134979 00000 n 
-0001135101 00000 n 
-0001135160 00000 n 
-0001135219 00000 n 
-0001134217 00000 n 
-0001135342 00000 n 
-0001138573 00000 n 
-0001139326 00000 n 
-0001138429 00000 n 
-0001135607 00000 n 
-0001138738 00000 n 
-0001138796 00000 n 
-0001138914 00000 n 
-0001138973 00000 n 
-0001139091 00000 n 
-0001139209 00000 n 
-0001142295 00000 n 
-0001143475 00000 n 
-0001142151 00000 n 
-0001139520 00000 n 
-0001142460 00000 n 
-0001142518 00000 n 
-0001142577 00000 n 
-0001142695 00000 n 
-0001142813 00000 n 
-0001142936 00000 n 
-0001143059 00000 n 
-0001143177 00000 n 
-0001143295 00000 n 
-0001143417 00000 n 
-0001146435 00000 n 
-0001147145 00000 n 
-0001146291 00000 n 
-0001143656 00000 n 
-0001146600 00000 n 
-0001146722 00000 n 
-0001146840 00000 n 
-0001146963 00000 n 
-0001147086 00000 n 
-0001150211 00000 n 
-0001151502 00000 n 
-0001150067 00000 n 
-0001147326 00000 n 
-0001150376 00000 n 
-0001150493 00000 n 
-0001150616 00000 n 
-0001150739 00000 n 
-0001150857 00000 n 
-0001150975 00000 n 
-0001151093 00000 n 
-0001151211 00000 n 
-0001151329 00000 n 
-0001151445 00000 n 
-0004860269 00000 n 
-0001154083 00000 n 
-0001157463 00000 n 
-0001157531 00000 n 
-0001157755 00000 n 
-0001157960 00000 n 
-0001158165 00000 n 
-0001158404 00000 n 
-0001158626 00000 n 
-0001162070 00000 n 
-0001162294 00000 n 
-0001162490 00000 n 
-0001158820 00000 n 
-0001159572 00000 n 
-0001153869 00000 n 
-0001151684 00000 n 
-0001158985 00000 n 
-0001159102 00000 n 
-0001159220 00000 n 
-0001159279 00000 n 
-0001159338 00000 n 
-0001159513 00000 n 
-0001154839 00000 n 
-0001154970 00000 n 
-0001155120 00000 n 
-0001155388 00000 n 
-0001155766 00000 n 
-0001156004 00000 n 
-0001156026 00000 n 
-0001157440 00000 n 
-0001177441 00000 n 
-0001177677 00000 n 
-0001162683 00000 n 
-0001162905 00000 n 
-0001163098 00000 n 
-0001163322 00000 n 
-0001163517 00000 n 
-0001163710 00000 n 
-0001163934 00000 n 
-0001164130 00000 n 
-0001164354 00000 n 
-0001164550 00000 n 
-0001164742 00000 n 
-0001164965 00000 n 
-0001165157 00000 n 
-0001165361 00000 n 
-0001165836 00000 n 
-0001166060 00000 n 
-0001166241 00000 n 
-0001166427 00000 n 
-0001166632 00000 n 
-0001167108 00000 n 
-0001167331 00000 n 
-0001167517 00000 n 
-0001167721 00000 n 
-0001168196 00000 n 
-0001168420 00000 n 
-0001168614 00000 n 
-0001168818 00000 n 
-0001169295 00000 n 
-0001169519 00000 n 
-0001169701 00000 n 
-0001169906 00000 n 
-0001170145 00000 n 
-0001170368 00000 n 
-0001170557 00000 n 
-0001170760 00000 n 
-0001170998 00000 n 
-0001171188 00000 n 
-0001171413 00000 n 
-0001171603 00000 n 
-0001171793 00000 n 
-0001172018 00000 n 
-0001172210 00000 n 
-0001172434 00000 n 
-0001172659 00000 n 
-0001172850 00000 n 
-0001173074 00000 n 
-0001176658 00000 n 
-0001173264 00000 n 
-0001173722 00000 n 
-0001161449 00000 n 
-0001159767 00000 n 
-0001173429 00000 n 
-0001165598 00000 n 
-0001166870 00000 n 
-0001167958 00000 n 
-0001169057 00000 n 
-0001173487 00000 n 
-0001173546 00000 n 
-0001173604 00000 n 
-0001173663 00000 n 
-0001180657 00000 n 
-0001180893 00000 n 
-0001181129 00000 n 
-0001184385 00000 n 
-0001184562 00000 n 
-0001184739 00000 n 
-0001184916 00000 n 
-0001185152 00000 n 
-0001188237 00000 n 
-0001188412 00000 n 
-0001188588 00000 n 
-0001188765 00000 n 
-0001176848 00000 n 
-0001177041 00000 n 
-0001177858 00000 n 
-0001176496 00000 n 
-0001173931 00000 n 
-0001177206 00000 n 
-0001177264 00000 n 
-0001177323 00000 n 
-0001177382 00000 n 
-0001177500 00000 n 
-0001177559 00000 n 
-0001177618 00000 n 
-0001177741 00000 n 
-0001177800 00000 n 
-0001180375 00000 n 
-0001181364 00000 n 
-0001180231 00000 n 
-0001178052 00000 n 
-0001180540 00000 n 
-0001180598 00000 n 
-0001180716 00000 n 
-0001180775 00000 n 
-0001180834 00000 n 
-0001180952 00000 n 
-0001181011 00000 n 
-0001181070 00000 n 
-0001181188 00000 n 
-0001181246 00000 n 
-0001181305 00000 n 
-0001184162 00000 n 
-0001185268 00000 n 
-0001184018 00000 n 
-0001181532 00000 n 
-0001184327 00000 n 
-0001184444 00000 n 
-0001184503 00000 n 
-0001184621 00000 n 
-0001184680 00000 n 
-0001184798 00000 n 
-0001184857 00000 n 
-0001184975 00000 n 
-0001185034 00000 n 
-0001185093 00000 n 
-0001185210 00000 n 
-0001187955 00000 n 
-0001188883 00000 n 
-0001187811 00000 n 
-0001185449 00000 n 
-0001188120 00000 n 
-0001188178 00000 n 
-0001188294 00000 n 
-0001188353 00000 n 
-0001188471 00000 n 
-0001188530 00000 n 
-0001188647 00000 n 
-0001188706 00000 n 
-0001188824 00000 n 
-0004860395 00000 n 
-0001191164 00000 n 
-0001195472 00000 n 
-0001195540 00000 n 
-0001195744 00000 n 
-0001195983 00000 n 
-0001196228 00000 n 
-0001196431 00000 n 
-0001196634 00000 n 
-0001196873 00000 n 
-0001197117 00000 n 
-0001197321 00000 n 
-0001197525 00000 n 
-0001197764 00000 n 
-0001198009 00000 n 
-0001198214 00000 n 
-0001198456 00000 n 
-0001198693 00000 n 
-0001198930 00000 n 
-0001202888 00000 n 
-0001203133 00000 n 
-0001199167 00000 n 
-0001199861 00000 n 
-0001190860 00000 n 
-0001189078 00000 n 
-0001199332 00000 n 
-0001199390 00000 n 
-0001199566 00000 n 
-0001199625 00000 n 
-0001199684 00000 n 
-0001199743 00000 n 
-0001199802 00000 n 
-0001192106 00000 n 
-0001192237 00000 n 
-0001192387 00000 n 
-0001192711 00000 n 
-0001193148 00000 n 
-0001193386 00000 n 
-0001193408 00000 n 
-0001195449 00000 n 
-0001862290 00000 n 
-0001880011 00000 n 
-0001880129 00000 n 
-0001211563 00000 n 
-0001203344 00000 n 
-0001203589 00000 n 
-0001203794 00000 n 
-0001204039 00000 n 
-0001204283 00000 n 
-0001204493 00000 n 
-0001204912 00000 n 
-0001205157 00000 n 
-0001205368 00000 n 
-0001205788 00000 n 
-0001206423 00000 n 
-0001202627 00000 n 
-0001200082 00000 n 
-0001205953 00000 n 
-0001206011 00000 n 
-0001206070 00000 n 
-0001206128 00000 n 
-0001206187 00000 n 
-0001204703 00000 n 
-0001205579 00000 n 
-0001206246 00000 n 
-0001206305 00000 n 
-0001206364 00000 n 
-0001211799 00000 n 
-0001210091 00000 n 
-0001210567 00000 n 
-0001211043 00000 n 
-0001211281 00000 n 
-0001212093 00000 n 
-0001209902 00000 n 
-0001206720 00000 n 
-0001211446 00000 n 
-0004851036 00000 n 
-0001210330 00000 n 
-0001210805 00000 n 
-0001211504 00000 n 
-0001211622 00000 n 
-0001211681 00000 n 
-0001211740 00000 n 
-0001211858 00000 n 
-0001211917 00000 n 
-0001887591 00000 n 
-0001892697 00000 n 
-0001880306 00000 n 
-0001214470 00000 n 
-0001214697 00000 n 
-0001214901 00000 n 
-0001215128 00000 n 
-0001215355 00000 n 
-0001215582 00000 n 
-0001215775 00000 n 
-0001216001 00000 n 
-0001216193 00000 n 
-0001216397 00000 n 
-0001219501 00000 n 
-0001219728 00000 n 
-0001219933 00000 n 
-0001220160 00000 n 
-0001216586 00000 n 
-0001217512 00000 n 
-0001214236 00000 n 
-0001212377 00000 n 
-0001216751 00000 n 
-0001216809 00000 n 
-0001216985 00000 n 
-0001217044 00000 n 
-0001217220 00000 n 
-0001217278 00000 n 
-0001217336 00000 n 
-0001217395 00000 n 
-0001217453 00000 n 
-0001298106 00000 n 
-0001220365 00000 n 
-0001220592 00000 n 
-0001220797 00000 n 
-0001221024 00000 n 
-0001221228 00000 n 
-0001221455 00000 n 
-0001221660 00000 n 
-0001221886 00000 n 
-0001222090 00000 n 
-0001222316 00000 n 
-0001222520 00000 n 
-0001222747 00000 n 
-0001222952 00000 n 
-0001223179 00000 n 
-0001223384 00000 n 
-0001223611 00000 n 
-0001223816 00000 n 
-0001224041 00000 n 
-0001224243 00000 n 
-0001224469 00000 n 
-0001224672 00000 n 
-0001224899 00000 n 
-0001225104 00000 n 
-0001225331 00000 n 
-0001225536 00000 n 
-0001225763 00000 n 
-0001225968 00000 n 
-0001226195 00000 n 
-0001226400 00000 n 
-0001226627 00000 n 
-0001226832 00000 n 
-0001227059 00000 n 
-0001227264 00000 n 
-0001227491 00000 n 
-0001227684 00000 n 
-0001227876 00000 n 
-0001228103 00000 n 
-0001228330 00000 n 
-0001228557 00000 n 
-0001228784 00000 n 
-0001232669 00000 n 
-0001232896 00000 n 
-0001233123 00000 n 
-0001233350 00000 n 
-0001229010 00000 n 
-0001230645 00000 n 
-0001218961 00000 n 
-0001217720 00000 n 
-0001229175 00000 n 
-0001229233 00000 n 
-0001229292 00000 n 
-0001229351 00000 n 
-0001229410 00000 n 
-0001229469 00000 n 
-0001229528 00000 n 
-0001229587 00000 n 
-0001229646 00000 n 
-0001229705 00000 n 
-0001229764 00000 n 
-0001229823 00000 n 
-0001229882 00000 n 
-0001229939 00000 n 
-0001229998 00000 n 
-0001230057 00000 n 
-0001230116 00000 n 
-0001230175 00000 n 
-0001230233 00000 n 
-0001230292 00000 n 
-0001230351 00000 n 
-0001230410 00000 n 
-0001230468 00000 n 
-0001230527 00000 n 
-0001230586 00000 n 
-0001233577 00000 n 
-0001233804 00000 n 
-0001234031 00000 n 
-0001234257 00000 n 
-0001234483 00000 n 
-0001234710 00000 n 
-0001234937 00000 n 
-0001235164 00000 n 
-0001235391 00000 n 
-0001235618 00000 n 
-0001235844 00000 n 
-0001236071 00000 n 
-0001236298 00000 n 
-0001236491 00000 n 
-0001236718 00000 n 
-0001236911 00000 n 
-0001237104 00000 n 
-0001237331 00000 n 
-0001237524 00000 n 
-0001237750 00000 n 
-0001237943 00000 n 
-0001238135 00000 n 
-0001241524 00000 n 
-0001241717 00000 n 
-0001241942 00000 n 
-0001242135 00000 n 
-0001242361 00000 n 
-0001238360 00000 n 
-0001239759 00000 n 
-0001232291 00000 n 
-0001230825 00000 n 
-0001238525 00000 n 
-0001238583 00000 n 
-0001238642 00000 n 
-0001238701 00000 n 
-0001238760 00000 n 
-0001238819 00000 n 
-0001238878 00000 n 
-0001238936 00000 n 
-0001238994 00000 n 
-0001239053 00000 n 
-0001239112 00000 n 
-0001239171 00000 n 
-0001239230 00000 n 
-0001239289 00000 n 
-0001239348 00000 n 
-0001239407 00000 n 
-0001239465 00000 n 
-0001239523 00000 n 
-0001239582 00000 n 
-0001239641 00000 n 
-0001239700 00000 n 
-0004860521 00000 n 
-0001242554 00000 n 
-0001242747 00000 n 
-0001242973 00000 n 
-0001243166 00000 n 
-0001243392 00000 n 
-0001243585 00000 n 
-0001243812 00000 n 
-0001244004 00000 n 
-0001244196 00000 n 
-0001244422 00000 n 
-0001244615 00000 n 
-0001244841 00000 n 
-0001245033 00000 n 
-0001245259 00000 n 
-0001245451 00000 n 
-0001245644 00000 n 
-0001245871 00000 n 
-0001246063 00000 n 
-0001246290 00000 n 
-0001246483 00000 n 
-0001246709 00000 n 
-0001246902 00000 n 
-0001247095 00000 n 
-0001247321 00000 n 
-0001247514 00000 n 
-0001250643 00000 n 
-0001250836 00000 n 
-0001251062 00000 n 
-0001251255 00000 n 
-0001247740 00000 n 
-0001248730 00000 n 
-0001241110 00000 n 
-0001239939 00000 n 
-0001247905 00000 n 
-0001247963 00000 n 
-0001248022 00000 n 
-0001248081 00000 n 
-0001248140 00000 n 
-0001248199 00000 n 
-0001248258 00000 n 
-0001248317 00000 n 
-0001248376 00000 n 
-0001248435 00000 n 
-0001248494 00000 n 
-0001248553 00000 n 
-0001248612 00000 n 
-0001248671 00000 n 
-0001251482 00000 n 
-0001251675 00000 n 
-0001251902 00000 n 
-0001252095 00000 n 
-0001252322 00000 n 
-0001252549 00000 n 
-0001252776 00000 n 
-0001253003 00000 n 
-0001253230 00000 n 
-0001253457 00000 n 
-0001253661 00000 n 
-0001253888 00000 n 
-0001254093 00000 n 
-0001254297 00000 n 
-0001254524 00000 n 
-0001254729 00000 n 
-0001254933 00000 n 
-0001255160 00000 n 
-0001255365 00000 n 
-0001255567 00000 n 
-0001255792 00000 n 
-0001259000 00000 n 
-0001259227 00000 n 
-0001259420 00000 n 
-0001255995 00000 n 
-0001256513 00000 n 
-0001250274 00000 n 
-0001248910 00000 n 
-0001256160 00000 n 
-0001256218 00000 n 
-0001256277 00000 n 
-0001256336 00000 n 
-0001256395 00000 n 
-0001256454 00000 n 
-0001302109 00000 n 
-0001302227 00000 n 
-0001302345 00000 n 
-0001302463 00000 n 
-0001302581 00000 n 
-0001302697 00000 n 
-0001302815 00000 n 
-0001302931 00000 n 
-0001303049 00000 n 
-0001259613 00000 n 
-0001259840 00000 n 
-0001260033 00000 n 
-0001260259 00000 n 
-0001260452 00000 n 
-0001260656 00000 n 
-0001260883 00000 n 
-0001261074 00000 n 
-0001261278 00000 n 
-0001261505 00000 n 
-0001261698 00000 n 
-0001261902 00000 n 
-0001262129 00000 n 
-0001262334 00000 n 
-0001262526 00000 n 
-0001262752 00000 n 
-0001262945 00000 n 
-0001263137 00000 n 
-0001263363 00000 n 
-0001263556 00000 n 
-0001263783 00000 n 
-0001264010 00000 n 
-0001264215 00000 n 
-0001264442 00000 n 
-0001264645 00000 n 
-0001264872 00000 n 
-0001265065 00000 n 
-0001265269 00000 n 
-0001265496 00000 n 
-0001265700 00000 n 
-0001265926 00000 n 
-0001266114 00000 n 
-0001266341 00000 n 
-0001266534 00000 n 
-0001266727 00000 n 
-0001266932 00000 n 
-0001267157 00000 n 
-0001267350 00000 n 
-0001267554 00000 n 
-0001267778 00000 n 
-0001270757 00000 n 
-0001270950 00000 n 
-0001271177 00000 n 
-0001267970 00000 n 
-0001268193 00000 n 
-0001258469 00000 n 
-0001256706 00000 n 
-0001268135 00000 n 
-0001327447 00000 n 
-0001327565 00000 n 
-0001327682 00000 n 
-0001303167 00000 n 
-0001303285 00000 n 
-0001303402 00000 n 
-0001305649 00000 n 
-0001292010 00000 n 
-0001297870 00000 n 
-0001319540 00000 n 
-0001319658 00000 n 
-0001319893 00000 n 
-0001327214 00000 n 
-0001271370 00000 n 
-0001271561 00000 n 
-0001271786 00000 n 
-0001271977 00000 n 
-0001272201 00000 n 
-0001272393 00000 n 
-0001272620 00000 n 
-0001272813 00000 n 
-0001273006 00000 n 
-0001273231 00000 n 
-0001273424 00000 n 
-0001273649 00000 n 
-0001273840 00000 n 
-0001274031 00000 n 
-0001274256 00000 n 
-0001274449 00000 n 
-0001274675 00000 n 
-0001274868 00000 n 
-0001275061 00000 n 
-0001275286 00000 n 
-0001275479 00000 n 
-0001275705 00000 n 
-0001275897 00000 n 
-0001276089 00000 n 
-0001276313 00000 n 
-0001276506 00000 n 
-0001276733 00000 n 
-0001276925 00000 n 
-0001277117 00000 n 
-0001277344 00000 n 
-0001277537 00000 n 
-0001277730 00000 n 
-0001277922 00000 n 
-0001278148 00000 n 
-0001278339 00000 n 
-0001278531 00000 n 
-0001278724 00000 n 
-0001278949 00000 n 
-0001279140 00000 n 
-0001279331 00000 n 
-0001282429 00000 n 
-0001282656 00000 n 
-0001282849 00000 n 
-0001283042 00000 n 
-0001283235 00000 n 
-0001283428 00000 n 
-0001279522 00000 n 
-0001279745 00000 n 
-0001270226 00000 n 
-0001268388 00000 n 
-0001279687 00000 n 
-0001305767 00000 n 
-0001305884 00000 n 
-0001306001 00000 n 
-0001306118 00000 n 
-0001306235 00000 n 
-0001306353 00000 n 
-0001306471 00000 n 
-0001306589 00000 n 
-0001306707 00000 n 
-0001306825 00000 n 
-0001309821 00000 n 
-0001309939 00000 n 
-0001310057 00000 n 
-0001283814 00000 n 
-0001284041 00000 n 
-0001284234 00000 n 
-0001284427 00000 n 
-0001284620 00000 n 
-0001284847 00000 n 
-0001285040 00000 n 
-0001285233 00000 n 
-0001285459 00000 n 
-0001285651 00000 n 
-0001285843 00000 n 
-0001286069 00000 n 
-0001286262 00000 n 
-0001286453 00000 n 
-0001286646 00000 n 
-0001286873 00000 n 
-0001287066 00000 n 
-0001287259 00000 n 
-0001287483 00000 n 
-0001287709 00000 n 
-0001287934 00000 n 
-0001289984 00000 n 
-0001288158 00000 n 
-0001288381 00000 n 
-0001282033 00000 n 
-0001279941 00000 n 
-0001288323 00000 n 
-0001283621 00000 n 
-0001310174 00000 n 
-0001310292 00000 n 
-0001310410 00000 n 
-0001310528 00000 n 
-0001310646 00000 n 
-0001310764 00000 n 
-0001314117 00000 n 
-0001314235 00000 n 
-0001314353 00000 n 
-0001314471 00000 n 
-0001290208 00000 n 
-0001290434 00000 n 
-0001290659 00000 n 
-0001290885 00000 n 
-0001291110 00000 n 
-0001291336 00000 n 
-0001291561 00000 n 
-0001294630 00000 n 
-0001291787 00000 n 
-0001292069 00000 n 
-0001289768 00000 n 
-0001288633 00000 n 
-0001291952 00000 n 
-0004860647 00000 n 
-0001314589 00000 n 
-0001314707 00000 n 
-0001314825 00000 n 
-0001314943 00000 n 
-0001315061 00000 n 
-0001315179 00000 n 
-0001315297 00000 n 
-0001319422 00000 n 
-0001294855 00000 n 
-0001295082 00000 n 
-0001295286 00000 n 
-0001295513 00000 n 
-0001295718 00000 n 
-0001295944 00000 n 
-0001296136 00000 n 
-0001296363 00000 n 
-0001296568 00000 n 
-0001296795 00000 n 
-0001297000 00000 n 
-0001297227 00000 n 
-0001297420 00000 n 
-0001297647 00000 n 
-0001298222 00000 n 
-0001294360 00000 n 
-0001292249 00000 n 
-0001297812 00000 n 
-0001297929 00000 n 
-0001297988 00000 n 
-0001298047 00000 n 
-0001298164 00000 n 
-0001301827 00000 n 
-0001303518 00000 n 
-0001301683 00000 n 
-0001298445 00000 n 
-0001301992 00000 n 
-0001302050 00000 n 
-0001302168 00000 n 
-0001302286 00000 n 
-0001302404 00000 n 
-0001302522 00000 n 
-0001302639 00000 n 
-0001302756 00000 n 
-0001302873 00000 n 
-0001302990 00000 n 
-0001303108 00000 n 
-0001303226 00000 n 
-0001303343 00000 n 
-0001303460 00000 n 
-0001305426 00000 n 
-0001306943 00000 n 
-0001305282 00000 n 
-0001303699 00000 n 
-0001305591 00000 n 
-0001305708 00000 n 
-0001305825 00000 n 
-0001305942 00000 n 
-0001306059 00000 n 
-0001306176 00000 n 
-0001306294 00000 n 
-0001306412 00000 n 
-0001306530 00000 n 
-0001306648 00000 n 
-0001306766 00000 n 
-0001306884 00000 n 
-0001309598 00000 n 
-0001310887 00000 n 
-0001309454 00000 n 
-0001307111 00000 n 
-0001309763 00000 n 
-0001309880 00000 n 
-0001309998 00000 n 
-0001310115 00000 n 
-0001310233 00000 n 
-0001310351 00000 n 
-0001310469 00000 n 
-0001310587 00000 n 
-0001310705 00000 n 
-0001310828 00000 n 
-0001313894 00000 n 
-0001315413 00000 n 
-0001313750 00000 n 
-0001311095 00000 n 
-0001314059 00000 n 
-0001314176 00000 n 
-0001314294 00000 n 
-0001314412 00000 n 
-0001314530 00000 n 
-0001314648 00000 n 
-0001314766 00000 n 
-0001314884 00000 n 
-0001315002 00000 n 
-0001315120 00000 n 
-0001315238 00000 n 
-0001315355 00000 n 
-0001319199 00000 n 
-0001320070 00000 n 
-0001319055 00000 n 
-0001315594 00000 n 
-0001319364 00000 n 
-0001319481 00000 n 
-0001319599 00000 n 
-0001319717 00000 n 
-0001319834 00000 n 
-0001319952 00000 n 
-0001320011 00000 n 
-0004860773 00000 n 
-0001323411 00000 n 
-0001323634 00000 n 
-0001323267 00000 n 
-0001320301 00000 n 
-0001323576 00000 n 
-0001326991 00000 n 
-0001328386 00000 n 
-0001326847 00000 n 
-0001323825 00000 n 
-0001327156 00000 n 
-0001327272 00000 n 
-0001327388 00000 n 
-0001327506 00000 n 
-0001327623 00000 n 
-0001327741 00000 n 
-0001327800 00000 n 
-0001327859 00000 n 
-0001327918 00000 n 
-0001327977 00000 n 
-0001328036 00000 n 
-0001328094 00000 n 
-0001328153 00000 n 
-0001328211 00000 n 
-0001328270 00000 n 
-0001328328 00000 n 
-0001330685 00000 n 
-0001330928 00000 n 
-0001331125 00000 n 
-0001331322 00000 n 
-0001331562 00000 n 
-0001331756 00000 n 
-0001331950 00000 n 
-0001332879 00000 n 
-0001330487 00000 n 
-0001328567 00000 n 
-0001332115 00000 n 
-0001332173 00000 n 
-0001332232 00000 n 
-0001332408 00000 n 
-0001332467 00000 n 
-0001332526 00000 n 
-0001332702 00000 n 
-0001332761 00000 n 
-0001332820 00000 n 
-0001334694 00000 n 
-0001334876 00000 n 
-0001335116 00000 n 
-0001335310 00000 n 
-0001335504 00000 n 
-0001335686 00000 n 
-0001335867 00000 n 
-0001336097 00000 n 
-0001336280 00000 n 
-0001336464 00000 n 
-0001337392 00000 n 
-0001334469 00000 n 
-0001333075 00000 n 
-0001336629 00000 n 
-0001336804 00000 n 
-0001336863 00000 n 
-0001336922 00000 n 
-0001337098 00000 n 
-0001337157 00000 n 
-0001337216 00000 n 
-0001340795 00000 n 
-0001341027 00000 n 
-0001341220 00000 n 
-0001341408 00000 n 
-0001341613 00000 n 
-0001341803 00000 n 
-0001341993 00000 n 
-0001342225 00000 n 
-0001342419 00000 n 
-0001342607 00000 n 
-0001342811 00000 n 
-0001343000 00000 n 
-0001343190 00000 n 
-0001343422 00000 n 
-0001343615 00000 n 
-0001343803 00000 n 
-0001344008 00000 n 
-0001344198 00000 n 
-0001344388 00000 n 
-0001344619 00000 n 
-0001344813 00000 n 
-0001345001 00000 n 
-0001345206 00000 n 
-0001345396 00000 n 
-0001345586 00000 n 
-0001345818 00000 n 
-0001346009 00000 n 
-0001346196 00000 n 
-0001346401 00000 n 
-0001346591 00000 n 
-0001346780 00000 n 
-0001347012 00000 n 
-0001347209 00000 n 
-0001347397 00000 n 
-0001347602 00000 n 
-0001347791 00000 n 
-0001347981 00000 n 
-0001348178 00000 n 
-0001348755 00000 n 
-0001340318 00000 n 
-0001337573 00000 n 
-0001348343 00000 n 
-0001348401 00000 n 
-0001348460 00000 n 
-0001348519 00000 n 
-0001348578 00000 n 
-0001348637 00000 n 
-0001348696 00000 n 
-0001353644 00000 n 
-0001358900 00000 n 
-0001364244 00000 n 
-0001370002 00000 n 
-0001374632 00000 n 
-0001352788 00000 n 
-0001352976 00000 n 
-0001353166 00000 n 
-0001353362 00000 n 
-0001353826 00000 n 
-0001352617 00000 n 
-0001348963 00000 n 
-0001353527 00000 n 
-0001353585 00000 n 
-0001353708 00000 n 
-0001353767 00000 n 
-0004860899 00000 n 
-0001358045 00000 n 
-0001358231 00000 n 
-0001358421 00000 n 
-0001363454 00000 n 
-0001358618 00000 n 
-0001359141 00000 n 
-0001357874 00000 n 
-0001354123 00000 n 
-0001358783 00000 n 
-0001358841 00000 n 
-0001358964 00000 n 
-0001359023 00000 n 
-0001359082 00000 n 
-0001363642 00000 n 
-0001363832 00000 n 
-0001368955 00000 n 
-0001364021 00000 n 
-0001364424 00000 n 
-0001363283 00000 n 
-0001359438 00000 n 
-0001364186 00000 n 
-0001364308 00000 n 
-0001364367 00000 n 
-0001369152 00000 n 
-0001369340 00000 n 
-0001369530 00000 n 
-0001369720 00000 n 
-0001370125 00000 n 
-0001368775 00000 n 
-0001364721 00000 n 
-0001369885 00000 n 
-0001369943 00000 n 
-0001370066 00000 n 
-0001373523 00000 n 
-0001373720 00000 n 
-0001373908 00000 n 
-0001374105 00000 n 
-0001374293 00000 n 
-0001374926 00000 n 
-0001373343 00000 n 
-0001370422 00000 n 
-0001374458 00000 n 
-0001374516 00000 n 
-0001374575 00000 n 
-0001374691 00000 n 
-0001374750 00000 n 
-0001374809 00000 n 
-0001377402 00000 n 
-0001377603 00000 n 
-0001377842 00000 n 
-0001378053 00000 n 
-0001378293 00000 n 
-0001378533 00000 n 
-0001378772 00000 n 
-0001379011 00000 n 
-0001379249 00000 n 
-0001379487 00000 n 
-0001379690 00000 n 
-0001379928 00000 n 
-0001380131 00000 n 
-0001384213 00000 n 
-0001384417 00000 n 
-0001384654 00000 n 
-0001384858 00000 n 
-0001380368 00000 n 
-0001381412 00000 n 
-0001377141 00000 n 
-0001375146 00000 n 
-0001380533 00000 n 
-0001380649 00000 n 
-0001380708 00000 n 
-0001380767 00000 n 
-0001380826 00000 n 
-0001380885 00000 n 
-0001380944 00000 n 
-0001381002 00000 n 
-0001381061 00000 n 
-0001381236 00000 n 
-0001381295 00000 n 
-0001381354 00000 n 
-0001387818 00000 n 
-0001387936 00000 n 
-0001385096 00000 n 
-0001385334 00000 n 
-0001385538 00000 n 
-0001385776 00000 n 
-0001385981 00000 n 
-0001386390 00000 n 
-0001386594 00000 n 
-0001386798 00000 n 
-0001387036 00000 n 
-0001387241 00000 n 
-0001388361 00000 n 
-0001383943 00000 n 
-0001381662 00000 n 
-0001387406 00000 n 
-0001387464 00000 n 
-0001387523 00000 n 
-0001387582 00000 n 
-0001386186 00000 n 
-0001387641 00000 n 
-0001387700 00000 n 
-0001387759 00000 n 
-0001387877 00000 n 
-0001388000 00000 n 
-0001388059 00000 n 
-0001388122 00000 n 
-0001388180 00000 n 
-0001388244 00000 n 
-0004861025 00000 n 
-0001390837 00000 n 
-0001391033 00000 n 
-0001391255 00000 n 
-0001391476 00000 n 
-0001391681 00000 n 
-0001391902 00000 n 
-0001392123 00000 n 
-0001392311 00000 n 
-0001392532 00000 n 
-0001392720 00000 n 
-0001392925 00000 n 
-0001393146 00000 n 
-0001393334 00000 n 
-0001393539 00000 n 
-0001393761 00000 n 
-0001393982 00000 n 
-0001394169 00000 n 
-0001394391 00000 n 
-0001394579 00000 n 
-0001394783 00000 n 
-0001395005 00000 n 
-0001395227 00000 n 
-0001395432 00000 n 
-0001395635 00000 n 
-0001395856 00000 n 
-0001396078 00000 n 
-0001396264 00000 n 
-0001396485 00000 n 
-0001396707 00000 n 
-0001396929 00000 n 
-0001397151 00000 n 
-0001397338 00000 n 
-0001397560 00000 n 
-0001397782 00000 n 
-0001398004 00000 n 
-0001398226 00000 n 
-0001402222 00000 n 
-0001402426 00000 n 
-0001398446 00000 n 
-0001399434 00000 n 
-0001390369 00000 n 
-0001388556 00000 n 
-0001398611 00000 n 
-0001398727 00000 n 
-0001398786 00000 n 
-0001398845 00000 n 
-0001398904 00000 n 
-0001398963 00000 n 
-0001399022 00000 n 
-0001399081 00000 n 
-0001399140 00000 n 
-0001399199 00000 n 
-0001399258 00000 n 
-0001399316 00000 n 
-0001399375 00000 n 
-0001441085 00000 n 
-0001462201 00000 n 
-0001441260 00000 n 
-0001441378 00000 n 
-0001446218 00000 n 
-0001446395 00000 n 
-0001446512 00000 n 
-0001446633 00000 n 
-0001449720 00000 n 
-0001449838 00000 n 
-0001449956 00000 n 
-0001402648 00000 n 
-0001402851 00000 n 
-0001403072 00000 n 
-0001403294 00000 n 
-0001403516 00000 n 
-0001403738 00000 n 
-0001403960 00000 n 
-0001404182 00000 n 
-0001404404 00000 n 
-0001404592 00000 n 
-0001404813 00000 n 
-0001405001 00000 n 
-0001405206 00000 n 
-0001405427 00000 n 
-0001405615 00000 n 
-0001405820 00000 n 
-0001406024 00000 n 
-0001406245 00000 n 
-0001406432 00000 n 
-0001406637 00000 n 
-0001406842 00000 n 
-0001407285 00000 n 
-0001407506 00000 n 
-0001407702 00000 n 
-0001407894 00000 n 
-0001408089 00000 n 
-0001408310 00000 n 
-0001408496 00000 n 
-0001408682 00000 n 
-0001408904 00000 n 
-0001409109 00000 n 
-0001409328 00000 n 
-0001409513 00000 n 
-0001409717 00000 n 
-0001409938 00000 n 
-0001410159 00000 n 
-0001410381 00000 n 
-0001410586 00000 n 
-0001410808 00000 n 
-0001410996 00000 n 
-0001411218 00000 n 
-0001411440 00000 n 
-0001411628 00000 n 
-0001415613 00000 n 
-0001415801 00000 n 
-0001416023 00000 n 
-0001416211 00000 n 
-0001416433 00000 n 
-0001416629 00000 n 
-0001416825 00000 n 
-0001417234 00000 n 
-0001411850 00000 n 
-0001412957 00000 n 
-0001401664 00000 n 
-0001399642 00000 n 
-0001412015 00000 n 
-0001412073 00000 n 
-0001412132 00000 n 
-0001412191 00000 n 
-0001412250 00000 n 
-0001412309 00000 n 
-0001412368 00000 n 
-0001412427 00000 n 
-0001412486 00000 n 
-0001412545 00000 n 
-0001407064 00000 n 
-0001412604 00000 n 
-0001412663 00000 n 
-0001412722 00000 n 
-0001412781 00000 n 
-0001412840 00000 n 
-0001412899 00000 n 
-0001441554 00000 n 
-0001445859 00000 n 
-0001445977 00000 n 
-0001450079 00000 n 
-0001450202 00000 n 
-0001450325 00000 n 
-0001450448 00000 n 
-0001450571 00000 n 
-0001417456 00000 n 
-0001417642 00000 n 
-0001417863 00000 n 
-0001418058 00000 n 
-0001418466 00000 n 
-0001418687 00000 n 
-0001418874 00000 n 
-0001419096 00000 n 
-0001419292 00000 n 
-0001419701 00000 n 
-0001419922 00000 n 
-0001420127 00000 n 
-0001420349 00000 n 
-0001420588 00000 n 
-0001420809 00000 n 
-0001420997 00000 n 
-0001421185 00000 n 
-0001421407 00000 n 
-0001421595 00000 n 
-0001421783 00000 n 
-0001422004 00000 n 
-0001422191 00000 n 
-0001422378 00000 n 
-0001422599 00000 n 
-0001422795 00000 n 
-0001422991 00000 n 
-0001423178 00000 n 
-0001423399 00000 n 
-0001423595 00000 n 
-0001423782 00000 n 
-0001424003 00000 n 
-0001424191 00000 n 
-0001424378 00000 n 
-0001424599 00000 n 
-0001424787 00000 n 
-0001425008 00000 n 
-0001425195 00000 n 
-0001425381 00000 n 
-0001425568 00000 n 
-0001425789 00000 n 
-0001425985 00000 n 
-0001426181 00000 n 
-0001426367 00000 n 
-0001426587 00000 n 
-0001426782 00000 n 
-0001426968 00000 n 
-0001427188 00000 n 
-0001427375 00000 n 
-0001427562 00000 n 
-0001427783 00000 n 
-0001427971 00000 n 
-0001428191 00000 n 
-0001428378 00000 n 
-0001428565 00000 n 
-0001428786 00000 n 
-0001428973 00000 n 
-0001429160 00000 n 
-0001429379 00000 n 
-0001429564 00000 n 
-0001433397 00000 n 
-0001429748 00000 n 
-0001430324 00000 n 
-0001414839 00000 n 
-0001413167 00000 n 
-0001429913 00000 n 
-0001429971 00000 n 
-0001430030 00000 n 
-0001417030 00000 n 
-0001430088 00000 n 
-0001418262 00000 n 
-0001430147 00000 n 
-0001419497 00000 n 
-0001430206 00000 n 
-0001430265 00000 n 
-0001453615 00000 n 
-0001453733 00000 n 
-0001453851 00000 n 
-0001453969 00000 n 
-0001454087 00000 n 
-0001454205 00000 n 
-0001454323 00000 n 
-0001454446 00000 n 
-0001433584 00000 n 
-0001433806 00000 n 
-0001434028 00000 n 
-0001434249 00000 n 
-0001434471 00000 n 
-0001434693 00000 n 
-0001434915 00000 n 
-0001435145 00000 n 
-0001435367 00000 n 
-0001435597 00000 n 
-0001435819 00000 n 
-0001436101 00000 n 
-0001433154 00000 n 
-0001430533 00000 n 
-0001435984 00000 n 
-0001436042 00000 n 
-0002542508 00000 n 
-0001439126 00000 n 
-0001439348 00000 n 
-0001439553 00000 n 
-0001439758 00000 n 
-0001439978 00000 n 
-0001440200 00000 n 
-0001440422 00000 n 
-0001440616 00000 n 
-0001440803 00000 n 
-0001441670 00000 n 
-0001438910 00000 n 
-0001436342 00000 n 
-0001440968 00000 n 
-0001441026 00000 n 
-0001441143 00000 n 
-0001441201 00000 n 
-0001441319 00000 n 
-0001441437 00000 n 
-0001441496 00000 n 
-0001441612 00000 n 
-0001444871 00000 n 
-0001445059 00000 n 
-0001445254 00000 n 
-0001445442 00000 n 
-0001445636 00000 n 
-0001446753 00000 n 
-0001444691 00000 n 
-0001441876 00000 n 
-0001445801 00000 n 
-0001445918 00000 n 
-0001446041 00000 n 
-0001446100 00000 n 
-0001446159 00000 n 
-0001446277 00000 n 
-0001446336 00000 n 
-0001446453 00000 n 
-0001446575 00000 n 
-0001446695 00000 n 
-0004861151 00000 n 
-0001449497 00000 n 
-0001450694 00000 n 
-0001449353 00000 n 
-0001446971 00000 n 
-0001449662 00000 n 
-0001449779 00000 n 
-0001449897 00000 n 
-0001450020 00000 n 
-0001450143 00000 n 
-0001450266 00000 n 
-0001450389 00000 n 
-0001450512 00000 n 
-0001450635 00000 n 
-0001453333 00000 n 
-0001454917 00000 n 
-0001453189 00000 n 
-0001450937 00000 n 
-0001453498 00000 n 
-0001453556 00000 n 
-0001453674 00000 n 
-0001453792 00000 n 
-0001453910 00000 n 
-0001454028 00000 n 
-0001454146 00000 n 
-0001454264 00000 n 
-0001454387 00000 n 
-0001454505 00000 n 
-0001454564 00000 n 
-0001454623 00000 n 
-0001454682 00000 n 
-0001454741 00000 n 
-0001454800 00000 n 
-0001454859 00000 n 
-0001457432 00000 n 
-0001457646 00000 n 
-0001457875 00000 n 
-0001458080 00000 n 
-0001458309 00000 n 
-0001458514 00000 n 
-0001458718 00000 n 
-0001458946 00000 n 
-0001459131 00000 n 
-0001459335 00000 n 
-0001459564 00000 n 
-0001459750 00000 n 
-0001459954 00000 n 
-0001460183 00000 n 
-0001460377 00000 n 
-0001460582 00000 n 
-0001460811 00000 n 
-0001461005 00000 n 
-0001461234 00000 n 
-0001461428 00000 n 
-0001461633 00000 n 
-0001465799 00000 n 
-0001465994 00000 n 
-0001466224 00000 n 
-0001466420 00000 n 
-0001466624 00000 n 
-0001461861 00000 n 
-0001462908 00000 n 
-0001457099 00000 n 
-0001455109 00000 n 
-0001462026 00000 n 
-0001462084 00000 n 
-0001462142 00000 n 
-0001462260 00000 n 
-0001462436 00000 n 
-0001462495 00000 n 
-0001462554 00000 n 
-0001462613 00000 n 
-0001462672 00000 n 
-0001462731 00000 n 
-0001462790 00000 n 
-0001462849 00000 n 
-0001491229 00000 n 
-0001494548 00000 n 
-0001466854 00000 n 
-0001467084 00000 n 
-0001467289 00000 n 
-0001467493 00000 n 
-0001467723 00000 n 
-0001467952 00000 n 
-0001468147 00000 n 
-0001468376 00000 n 
-0001468604 00000 n 
-0001468834 00000 n 
-0001469022 00000 n 
-0001469251 00000 n 
-0001469437 00000 n 
-0001469629 00000 n 
-0001469859 00000 n 
-0001470047 00000 n 
-0001470277 00000 n 
-0001470473 00000 n 
-0001470703 00000 n 
-0001470898 00000 n 
-0001471091 00000 n 
-0001471321 00000 n 
-0001471535 00000 n 
-0001471765 00000 n 
-0001471980 00000 n 
-0001472195 00000 n 
-0001472409 00000 n 
-0001472639 00000 n 
-0001472854 00000 n 
-0001473084 00000 n 
-0001473314 00000 n 
-0001473544 00000 n 
-0001473774 00000 n 
-0001474004 00000 n 
-0001474234 00000 n 
-0001474438 00000 n 
-0001474668 00000 n 
-0001474870 00000 n 
-0001478673 00000 n 
-0001478876 00000 n 
-0001479105 00000 n 
-0001479309 00000 n 
-0001475098 00000 n 
-0001476382 00000 n 
-0001465268 00000 n 
-0001463159 00000 n 
-0001475263 00000 n 
-0001475321 00000 n 
-0001475380 00000 n 
-0001475439 00000 n 
-0001475498 00000 n 
-0001475557 00000 n 
-0001475616 00000 n 
-0001475675 00000 n 
-0001475734 00000 n 
-0001475793 00000 n 
-0001475852 00000 n 
-0001475911 00000 n 
-0001475970 00000 n 
-0001476029 00000 n 
-0001476088 00000 n 
-0001476147 00000 n 
-0001476206 00000 n 
-0001476265 00000 n 
-0001476324 00000 n 
-0001494725 00000 n 
-0001494843 00000 n 
-0001494966 00000 n 
-0001495148 00000 n 
-0001479539 00000 n 
-0001479769 00000 n 
-0001479965 00000 n 
-0001480195 00000 n 
-0001480400 00000 n 
-0001480630 00000 n 
-0001480815 00000 n 
-0001481044 00000 n 
-0001481230 00000 n 
-0001481416 00000 n 
-0001481646 00000 n 
-0001481851 00000 n 
-0001482056 00000 n 
-0001482286 00000 n 
-0001482482 00000 n 
-0001482712 00000 n 
-0001482942 00000 n 
-0001483137 00000 n 
-0001483366 00000 n 
-0001483588 00000 n 
-0001483817 00000 n 
-0001484009 00000 n 
-0001484238 00000 n 
-0001484433 00000 n 
-0001484629 00000 n 
-0001484859 00000 n 
-0001485055 00000 n 
-0001485284 00000 n 
-0001485479 00000 n 
-0001485674 00000 n 
-0001485901 00000 n 
-0001486094 00000 n 
-0001490045 00000 n 
-0001490240 00000 n 
-0001486287 00000 n 
-0001487218 00000 n 
-0001478205 00000 n 
-0001476565 00000 n 
-0001486452 00000 n 
-0001486510 00000 n 
-0001486569 00000 n 
-0001486628 00000 n 
-0001486687 00000 n 
-0001486746 00000 n 
-0001486805 00000 n 
-0001486864 00000 n 
-0001486923 00000 n 
-0001486982 00000 n 
-0001487041 00000 n 
-0001487100 00000 n 
-0001487159 00000 n 
-0001495266 00000 n 
-0001498981 00000 n 
-0001499162 00000 n 
-0001499344 00000 n 
-0001499462 00000 n 
-0001499580 00000 n 
-0001490428 00000 n 
-0001490658 00000 n 
-0001490888 00000 n 
-0001491405 00000 n 
-0001489865 00000 n 
-0001487413 00000 n 
-0001491053 00000 n 
-0001491111 00000 n 
-0001491170 00000 n 
-0001491288 00000 n 
-0001491347 00000 n 
-0004861277 00000 n 
-0001494130 00000 n 
-0001494325 00000 n 
-0001495387 00000 n 
-0001493977 00000 n 
-0001491623 00000 n 
-0001494490 00000 n 
-0001494607 00000 n 
-0001494666 00000 n 
-0001494784 00000 n 
-0001494907 00000 n 
-0001495030 00000 n 
-0001495089 00000 n 
-0001495207 00000 n 
-0001495329 00000 n 
-0001502971 00000 n 
-0001498699 00000 n 
-0001499879 00000 n 
-0001498555 00000 n 
-0001495568 00000 n 
-0001498864 00000 n 
-0001498922 00000 n 
-0001499044 00000 n 
-0001499103 00000 n 
-0001499226 00000 n 
-0001499285 00000 n 
-0001499403 00000 n 
-0001499521 00000 n 
-0001499644 00000 n 
-0001499703 00000 n 
-0001503204 00000 n 
-0001503438 00000 n 
-0001503671 00000 n 
-0001503876 00000 n 
-0001504630 00000 n 
-0001502791 00000 n 
-0001500136 00000 n 
-0001504041 00000 n 
-0001504099 00000 n 
-0001504158 00000 n 
-0001504217 00000 n 
-0001504276 00000 n 
-0001504335 00000 n 
-0001504394 00000 n 
-0001504453 00000 n 
-0001504512 00000 n 
-0001504571 00000 n 
-0001506939 00000 n 
-0001507177 00000 n 
-0001507382 00000 n 
-0001507620 00000 n 
-0001507858 00000 n 
-0001508063 00000 n 
-0001508267 00000 n 
-0001508505 00000 n 
-0001508708 00000 n 
-0001508946 00000 n 
-0001509144 00000 n 
-0001509349 00000 n 
-0001509588 00000 n 
-0001509793 00000 n 
-0001509996 00000 n 
-0001510234 00000 n 
-0001510437 00000 n 
-0001510641 00000 n 
-0001510880 00000 n 
-0001511077 00000 n 
-0001511281 00000 n 
-0001511520 00000 n 
-0001511724 00000 n 
-0001511962 00000 n 
-0001512166 00000 n 
-0001512404 00000 n 
-0001512608 00000 n 
-0001512847 00000 n 
-0001513085 00000 n 
-0001513289 00000 n 
-0001513528 00000 n 
-0001513766 00000 n 
-0001513971 00000 n 
-0001514210 00000 n 
-0001514415 00000 n 
-0001514932 00000 n 
-0001506489 00000 n 
-0001504824 00000 n 
-0001514580 00000 n 
-0001514755 00000 n 
-0001514814 00000 n 
-0001514873 00000 n 
-0001518373 00000 n 
-0001518491 00000 n 
-0001518670 00000 n 
-0001518852 00000 n 
-0001519034 00000 n 
-0001521662 00000 n 
-0001521839 00000 n 
-0001522020 00000 n 
-0001522202 00000 n 
-0001522324 00000 n 
-0001522447 00000 n 
-0001522570 00000 n 
-0001526982 00000 n 
-0001527105 00000 n 
-0001527280 00000 n 
-0001517271 00000 n 
-0001517476 00000 n 
-0001517681 00000 n 
-0001517886 00000 n 
-0001518091 00000 n 
-0001519274 00000 n 
-0001517091 00000 n 
-0001515152 00000 n 
-0001518256 00000 n 
-0001518314 00000 n 
-0001518432 00000 n 
-0001518555 00000 n 
-0001518612 00000 n 
-0001518734 00000 n 
-0001518793 00000 n 
-0001518916 00000 n 
-0001518975 00000 n 
-0001519098 00000 n 
-0001519157 00000 n 
-0001519216 00000 n 
-0001521439 00000 n 
-0001522690 00000 n 
-0001521295 00000 n 
-0001519467 00000 n 
-0001521604 00000 n 
-0001521721 00000 n 
-0001521780 00000 n 
-0001521902 00000 n 
-0001521961 00000 n 
-0001522084 00000 n 
-0001522143 00000 n 
-0001522266 00000 n 
-0001522388 00000 n 
-0001522511 00000 n 
-0001522632 00000 n 
-0004861403 00000 n 
-0001525302 00000 n 
-0001525556 00000 n 
-0001525810 00000 n 
-0001526065 00000 n 
-0001526320 00000 n 
-0001526505 00000 n 
-0001530811 00000 n 
-0001526759 00000 n 
-0001527690 00000 n 
-0001525104 00000 n 
-0001522896 00000 n 
-0001526924 00000 n 
-0001527046 00000 n 
-0001527164 00000 n 
-0001527221 00000 n 
-0001527339 00000 n 
-0001527398 00000 n 
-0001527572 00000 n 
-0001527631 00000 n 
-0001531466 00000 n 
-0001531584 00000 n 
-0001531707 00000 n 
-0001531830 00000 n 
-0001531066 00000 n 
-0001532188 00000 n 
-0001530658 00000 n 
-0001527939 00000 n 
-0001531231 00000 n 
-0001531289 00000 n 
-0001531348 00000 n 
-0001531407 00000 n 
-0001531525 00000 n 
-0001531648 00000 n 
-0001531771 00000 n 
-0001531894 00000 n 
-0001531953 00000 n 
-0001532012 00000 n 
-0001532071 00000 n 
-0001534598 00000 n 
-0001534844 00000 n 
-0001535059 00000 n 
-0001535307 00000 n 
-0001535520 00000 n 
-0001535769 00000 n 
-0001535984 00000 n 
-0001536198 00000 n 
-0001536447 00000 n 
-0001536661 00000 n 
-0001536875 00000 n 
-0001537124 00000 n 
-0001537338 00000 n 
-0001537586 00000 n 
-0001537835 00000 n 
-0001538020 00000 n 
-0001538269 00000 n 
-0001538516 00000 n 
-0001538730 00000 n 
-0001538979 00000 n 
-0001539194 00000 n 
-0001539443 00000 n 
-0001539658 00000 n 
-0001539873 00000 n 
-0001540122 00000 n 
-0001540337 00000 n 
-0001540552 00000 n 
-0001540766 00000 n 
-0001541522 00000 n 
-0001534211 00000 n 
-0001532411 00000 n 
-0001540931 00000 n 
-0001541047 00000 n 
-0001541106 00000 n 
-0001541165 00000 n 
-0001541224 00000 n 
-0001541283 00000 n 
-0001541341 00000 n 
-0001541400 00000 n 
-0001541459 00000 n 
-0001544395 00000 n 
-0001544572 00000 n 
-0001544754 00000 n 
-0001544877 00000 n 
-0001545000 00000 n 
-0001549254 00000 n 
-0001549431 00000 n 
-0001549667 00000 n 
-0001543995 00000 n 
-0001545123 00000 n 
-0001543851 00000 n 
-0001541742 00000 n 
-0001544160 00000 n 
-0001544218 00000 n 
-0001544277 00000 n 
-0001544336 00000 n 
-0001544454 00000 n 
-0001544513 00000 n 
-0001544636 00000 n 
-0001544695 00000 n 
-0001544818 00000 n 
-0001544941 00000 n 
-0001545064 00000 n 
-0001547403 00000 n 
-0001547651 00000 n 
-0001547899 00000 n 
-0001548112 00000 n 
-0001548360 00000 n 
-0001548572 00000 n 
-0001548819 00000 n 
-0001552625 00000 n 
-0001552813 00000 n 
-0001549031 00000 n 
-0001550255 00000 n 
-0001547196 00000 n 
-0001545329 00000 n 
-0001549196 00000 n 
-0001549313 00000 n 
-0001549372 00000 n 
-0001549490 00000 n 
-0001549549 00000 n 
-0001549608 00000 n 
-0001549726 00000 n 
-0001549785 00000 n 
-0001549960 00000 n 
-0001550019 00000 n 
-0001550078 00000 n 
-0001550137 00000 n 
-0001550196 00000 n 
-0001553062 00000 n 
-0001553250 00000 n 
-0001553499 00000 n 
-0001553713 00000 n 
-0001553962 00000 n 
-0001554176 00000 n 
-0001554424 00000 n 
-0001554672 00000 n 
-0001554887 00000 n 
-0001555136 00000 n 
-0001555351 00000 n 
-0001555565 00000 n 
-0001555955 00000 n 
-0001556197 00000 n 
-0001556404 00000 n 
-0001556612 00000 n 
-0001556855 00000 n 
-0001557062 00000 n 
-0001557303 00000 n 
-0001557511 00000 n 
-0001557753 00000 n 
-0001557959 00000 n 
-0001561733 00000 n 
-0001561941 00000 n 
-0001562184 00000 n 
-0001562392 00000 n 
-0001558200 00000 n 
-0001559305 00000 n 
-0001552256 00000 n 
-0001550449 00000 n 
-0001558365 00000 n 
-0001558423 00000 n 
-0001558482 00000 n 
-0001558541 00000 n 
-0001558600 00000 n 
-0001558659 00000 n 
-0001558718 00000 n 
-0001558777 00000 n 
-0001555761 00000 n 
-0001558952 00000 n 
-0001559011 00000 n 
-0001559070 00000 n 
-0001559129 00000 n 
-0001559188 00000 n 
-0001559247 00000 n 
-0004861529 00000 n 
-0001562635 00000 n 
-0001562842 00000 n 
-0001563084 00000 n 
-0001563292 00000 n 
-0001563535 00000 n 
-0001563722 00000 n 
-0001563965 00000 n 
-0001564151 00000 n 
-0001564392 00000 n 
-0001564634 00000 n 
-0001564843 00000 n 
-0001565086 00000 n 
-0001565295 00000 n 
-0001566458 00000 n 
-0001561445 00000 n 
-0001559513 00000 n 
-0001565460 00000 n 
-0001565518 00000 n 
-0001565577 00000 n 
-0001565636 00000 n 
-0001565695 00000 n 
-0001565754 00000 n 
-0001565813 00000 n 
-0001565871 00000 n 
-0001565930 00000 n 
-0001565989 00000 n 
-0001566048 00000 n 
-0001566107 00000 n 
-0001566166 00000 n 
-0001566225 00000 n 
-0001566284 00000 n 
-0001568999 00000 n 
-0001569252 00000 n 
-0001569505 00000 n 
-0001569723 00000 n 
-0001569976 00000 n 
-0001570195 00000 n 
-0001570449 00000 n 
-0001570668 00000 n 
-0001570861 00000 n 
-0001571115 00000 n 
-0001571308 00000 n 
-0001571562 00000 n 
-0001571781 00000 n 
-0001572035 00000 n 
-0001572253 00000 n 
-0001572505 00000 n 
-0001572758 00000 n 
-0001572978 00000 n 
-0001573232 00000 n 
-0001573452 00000 n 
-0001573670 00000 n 
-0001578001 00000 n 
-0001578237 00000 n 
-0001574071 00000 n 
-0001575118 00000 n 
-0001568657 00000 n 
-0001566681 00000 n 
-0001574236 00000 n 
-0001574294 00000 n 
-0001574353 00000 n 
-0001574412 00000 n 
-0001574471 00000 n 
-0001574530 00000 n 
-0001574588 00000 n 
-0001574647 00000 n 
-0001574706 00000 n 
-0001574765 00000 n 
-0001574824 00000 n 
-0001574883 00000 n 
-0001574942 00000 n 
-0001573871 00000 n 
-0001578507 00000 n 
-0001578778 00000 n 
-0001579048 00000 n 
-0001579319 00000 n 
-0001579503 00000 n 
-0001579772 00000 n 
-0001580043 00000 n 
-0001580279 00000 n 
-0001581343 00000 n 
-0001577776 00000 n 
-0001575339 00000 n 
-0001580444 00000 n 
-0001580502 00000 n 
-0001580561 00000 n 
-0001580620 00000 n 
-0001580679 00000 n 
-0001580738 00000 n 
-0001580797 00000 n 
-0001580856 00000 n 
-0001580920 00000 n 
-0001580979 00000 n 
-0001581043 00000 n 
-0001581102 00000 n 
-0001581166 00000 n 
-0001581225 00000 n 
-0001581284 00000 n 
-0001583593 00000 n 
-0001587907 00000 n 
-0001587975 00000 n 
-0001588179 00000 n 
-0001588418 00000 n 
-0001588667 00000 n 
-0001588871 00000 n 
-0001589075 00000 n 
-0001589313 00000 n 
-0001589560 00000 n 
-0001589764 00000 n 
-0001589964 00000 n 
-0001590202 00000 n 
-0001590450 00000 n 
-0001590654 00000 n 
-0001590857 00000 n 
-0001591095 00000 n 
-0001591343 00000 n 
-0001594905 00000 n 
-0001595109 00000 n 
-0001595348 00000 n 
-0001591545 00000 n 
-0001592237 00000 n 
-0001583289 00000 n 
-0001581554 00000 n 
-0001591710 00000 n 
-0001591768 00000 n 
-0001591942 00000 n 
-0001592001 00000 n 
-0001592060 00000 n 
-0001592119 00000 n 
-0001592178 00000 n 
-0001584539 00000 n 
-0001584670 00000 n 
-0001584820 00000 n 
-0001585144 00000 n 
-0001585581 00000 n 
-0001585819 00000 n 
-0001585841 00000 n 
-0001587884 00000 n 
-0001870355 00000 n 
-0001595597 00000 n 
-0001595802 00000 n 
-0001596050 00000 n 
-0001596289 00000 n 
-0001596528 00000 n 
-0001596767 00000 n 
-0001597015 00000 n 
-0001597229 00000 n 
-0001597478 00000 n 
-0001597717 00000 n 
-0001597956 00000 n 
-0001598205 00000 n 
-0001598453 00000 n 
-0001598702 00000 n 
-0001598917 00000 n 
-0001599345 00000 n 
-0001599594 00000 n 
-0001599809 00000 n 
-0001600237 00000 n 
-0001601047 00000 n 
-0001594554 00000 n 
-0001592458 00000 n 
-0001600402 00000 n 
-0001600460 00000 n 
-0001600519 00000 n 
-0001600578 00000 n 
-0001600637 00000 n 
-0001600695 00000 n 
-0001600754 00000 n 
-0001600813 00000 n 
-0001599131 00000 n 
-0001600023 00000 n 
-0001600872 00000 n 
-0001600930 00000 n 
-0001600988 00000 n 
-0001870414 00000 n 
-0001604791 00000 n 
-0001605027 00000 n 
-0001604270 00000 n 
-0001604509 00000 n 
-0001605261 00000 n 
-0001604117 00000 n 
-0001601269 00000 n 
-0001604674 00000 n 
-0001604732 00000 n 
-0001604850 00000 n 
-0001604909 00000 n 
-0001604968 00000 n 
-0001605086 00000 n 
-0001605145 00000 n 
-0004861655 00000 n 
-0001607868 00000 n 
-0001608090 00000 n 
-0001608345 00000 n 
-0001608599 00000 n 
-0001608853 00000 n 
-0001609047 00000 n 
-0001609268 00000 n 
-0001609489 00000 n 
-0001609693 00000 n 
-0001609915 00000 n 
-0001610136 00000 n 
-0001610323 00000 n 
-0001610544 00000 n 
-0001610731 00000 n 
-0001610936 00000 n 
-0001611157 00000 n 
-0001611344 00000 n 
-0001611549 00000 n 
-0001611770 00000 n 
-0001611957 00000 n 
-0001612162 00000 n 
-0001612367 00000 n 
-0001612588 00000 n 
-0001612776 00000 n 
-0001612980 00000 n 
-0001613201 00000 n 
-0001613422 00000 n 
-0001613625 00000 n 
-0001613846 00000 n 
-0001614067 00000 n 
-0001614271 00000 n 
-0001614458 00000 n 
-0001614680 00000 n 
-0001614866 00000 n 
-0001615070 00000 n 
-0001615292 00000 n 
-0001615514 00000 n 
-0001615719 00000 n 
-0001615939 00000 n 
-0001616124 00000 n 
-0001616309 00000 n 
-0001616531 00000 n 
-0001616723 00000 n 
-0001616945 00000 n 
-0001617130 00000 n 
-0001617350 00000 n 
-0001617536 00000 n 
-0001617741 00000 n 
-0001617962 00000 n 
-0001618184 00000 n 
-0001622070 00000 n 
-0001618404 00000 n 
-0001619509 00000 n 
-0001607274 00000 n 
-0001605467 00000 n 
-0001618569 00000 n 
-0001618685 00000 n 
-0001618744 00000 n 
-0001618803 00000 n 
-0001618862 00000 n 
-0001618921 00000 n 
-0001618980 00000 n 
-0001619039 00000 n 
-0001619098 00000 n 
-0001619156 00000 n 
-0001619215 00000 n 
-0001619274 00000 n 
-0001619333 00000 n 
-0001619392 00000 n 
-0001619451 00000 n 
-0001680819 00000 n 
-0001680937 00000 n 
-0001681001 00000 n 
-0001681065 00000 n 
-0001680642 00000 n 
-0001701490 00000 n 
-0001681188 00000 n 
-0001685101 00000 n 
-0001685218 00000 n 
-0001685454 00000 n 
-0001685572 00000 n 
-0001685695 00000 n 
-0001622292 00000 n 
-0001622514 00000 n 
-0001622736 00000 n 
-0001622958 00000 n 
-0001623144 00000 n 
-0001623366 00000 n 
-0001623570 00000 n 
-0001623792 00000 n 
-0001623996 00000 n 
-0001624218 00000 n 
-0001624439 00000 n 
-0001624661 00000 n 
-0001624881 00000 n 
-0001625067 00000 n 
-0001625289 00000 n 
-0001625477 00000 n 
-0001625699 00000 n 
-0001625921 00000 n 
-0001626143 00000 n 
-0001626365 00000 n 
-0001626587 00000 n 
-0001626809 00000 n 
-0001627030 00000 n 
-0001627217 00000 n 
-0001627439 00000 n 
-0001627660 00000 n 
-0001627865 00000 n 
-0001628087 00000 n 
-0001628275 00000 n 
-0001628497 00000 n 
-0001628717 00000 n 
-0001628903 00000 n 
-0001632723 00000 n 
-0001632910 00000 n 
-0001629123 00000 n 
-0001630343 00000 n 
-0001621629 00000 n 
-0001619745 00000 n 
-0001629288 00000 n 
-0001629346 00000 n 
-0001629405 00000 n 
-0001629464 00000 n 
-0001629523 00000 n 
-0001629582 00000 n 
-0001629639 00000 n 
-0001629698 00000 n 
-0001629757 00000 n 
-0001629816 00000 n 
-0001629875 00000 n 
-0001629934 00000 n 
-0001629992 00000 n 
-0001630051 00000 n 
-0001630109 00000 n 
-0001630167 00000 n 
-0001630226 00000 n 
-0001630285 00000 n 
-0001685817 00000 n 
-0001685999 00000 n 
-0001689554 00000 n 
-0001689672 00000 n 
-0001689788 00000 n 
-0001689911 00000 n 
-0001633129 00000 n 
-0001633317 00000 n 
-0001633539 00000 n 
-0001633727 00000 n 
-0001633949 00000 n 
-0001634154 00000 n 
-0001634376 00000 n 
-0001634615 00000 n 
-0001634802 00000 n 
-0001635024 00000 n 
-0001635220 00000 n 
-0001635416 00000 n 
-0001635603 00000 n 
-0001635825 00000 n 
-0001636011 00000 n 
-0001636197 00000 n 
-0001636384 00000 n 
-0001636606 00000 n 
-0001636802 00000 n 
-0001636989 00000 n 
-0001637211 00000 n 
-0001637407 00000 n 
-0001637593 00000 n 
-0001637814 00000 n 
-0001638009 00000 n 
-0001638204 00000 n 
-0001638391 00000 n 
-0001638613 00000 n 
-0001638799 00000 n 
-0001638985 00000 n 
-0001639172 00000 n 
-0001639394 00000 n 
-0001639590 00000 n 
-0001639777 00000 n 
-0001639999 00000 n 
-0001640195 00000 n 
-0001640382 00000 n 
-0001640603 00000 n 
-0001640799 00000 n 
-0001640995 00000 n 
-0001641181 00000 n 
-0001641401 00000 n 
-0001641586 00000 n 
-0001641771 00000 n 
-0001641958 00000 n 
-0001642179 00000 n 
-0001642375 00000 n 
-0001642562 00000 n 
-0001642783 00000 n 
-0001642979 00000 n 
-0001643166 00000 n 
-0001643387 00000 n 
-0001643583 00000 n 
-0001643779 00000 n 
-0001643965 00000 n 
-0001644185 00000 n 
-0001644370 00000 n 
-0001644555 00000 n 
-0001644740 00000 n 
-0001644959 00000 n 
-0001648289 00000 n 
-0001648476 00000 n 
-0001648697 00000 n 
-0001648893 00000 n 
-0001649080 00000 n 
-0001649301 00000 n 
-0001649497 00000 n 
-0001645153 00000 n 
-0001645670 00000 n 
-0001632021 00000 n 
-0001630539 00000 n 
-0001645318 00000 n 
-0001645376 00000 n 
-0001645435 00000 n 
-0001645494 00000 n 
-0001645553 00000 n 
-0001645611 00000 n 
-0001690093 00000 n 
-0001690211 00000 n 
-0001690329 00000 n 
-0001690447 00000 n 
-0001692801 00000 n 
-0001692919 00000 n 
-0001693037 00000 n 
-0001693155 00000 n 
-0001693273 00000 n 
-0001693391 00000 n 
-0001693509 00000 n 
-0001693627 00000 n 
-0001693745 00000 n 
-0001693863 00000 n 
-0001693981 00000 n 
-0001649693 00000 n 
-0001649880 00000 n 
-0001650101 00000 n 
-0001650287 00000 n 
-0001650473 00000 n 
-0001650660 00000 n 
-0001650881 00000 n 
-0001651077 00000 n 
-0001651264 00000 n 
-0001651485 00000 n 
-0001651681 00000 n 
-0001651903 00000 n 
-0001652091 00000 n 
-0001652313 00000 n 
-0001652535 00000 n 
-0001652755 00000 n 
-0001652942 00000 n 
-0001653129 00000 n 
-0001653351 00000 n 
-0001653539 00000 n 
-0001653727 00000 n 
-0001653949 00000 n 
-0001654137 00000 n 
-0001654325 00000 n 
-0001654546 00000 n 
-0001654734 00000 n 
-0001654922 00000 n 
-0001655144 00000 n 
-0001655332 00000 n 
-0001655520 00000 n 
-0001655707 00000 n 
-0001655928 00000 n 
-0001656124 00000 n 
-0001656320 00000 n 
-0001656507 00000 n 
-0001656728 00000 n 
-0001656914 00000 n 
-0001657100 00000 n 
-0001657287 00000 n 
-0001657508 00000 n 
-0001657704 00000 n 
-0001657900 00000 n 
-0001658087 00000 n 
-0001658308 00000 n 
-0001658494 00000 n 
-0001658680 00000 n 
-0001658867 00000 n 
-0001659089 00000 n 
-0001659285 00000 n 
-0001659481 00000 n 
-0001659668 00000 n 
-0001659890 00000 n 
-0001660076 00000 n 
-0001660261 00000 n 
-0001660448 00000 n 
-0001660669 00000 n 
-0001660865 00000 n 
-0001661052 00000 n 
-0001661273 00000 n 
-0001661469 00000 n 
-0001661656 00000 n 
-0001661878 00000 n 
-0001662074 00000 n 
-0001662261 00000 n 
-0001662482 00000 n 
-0001662678 00000 n 
-0001662864 00000 n 
-0001663084 00000 n 
-0001663279 00000 n 
-0001663466 00000 n 
-0001663688 00000 n 
-0001663884 00000 n 
-0001664071 00000 n 
-0001664292 00000 n 
-0001664488 00000 n 
-0001664684 00000 n 
-0001664870 00000 n 
-0001665090 00000 n 
-0001665275 00000 n 
-0001665460 00000 n 
-0001665647 00000 n 
-0001665868 00000 n 
-0001666064 00000 n 
-0001666250 00000 n 
-0001666470 00000 n 
-0001666665 00000 n 
-0001666852 00000 n 
-0001667074 00000 n 
-0001667270 00000 n 
-0001667466 00000 n 
-0001667653 00000 n 
-0001667875 00000 n 
-0001668061 00000 n 
-0001668246 00000 n 
-0001668432 00000 n 
-0001668653 00000 n 
-0001668848 00000 n 
-0001669034 00000 n 
-0001669255 00000 n 
-0001669450 00000 n 
-0001669669 00000 n 
-0001669854 00000 n 
-0001673088 00000 n 
-0001670039 00000 n 
-0001670262 00000 n 
-0001647164 00000 n 
-0001645893 00000 n 
-0001670204 00000 n 
-0001694099 00000 n 
-0001696412 00000 n 
-0001696530 00000 n 
-0001696648 00000 n 
-0001696766 00000 n 
-0001696884 00000 n 
-0001697002 00000 n 
-0001697119 00000 n 
-0001697237 00000 n 
-0001697354 00000 n 
-0001697767 00000 n 
-0001700311 00000 n 
-0001700841 00000 n 
-0001701136 00000 n 
-0001673274 00000 n 
-0001673496 00000 n 
-0001673718 00000 n 
-0001673940 00000 n 
-0001674162 00000 n 
-0001674384 00000 n 
-0001674605 00000 n 
-0001674834 00000 n 
-0001675055 00000 n 
-0001675284 00000 n 
-0001675504 00000 n 
-0001675732 00000 n 
-0001675951 00000 n 
-0001676233 00000 n 
-0001672827 00000 n 
-0001670444 00000 n 
-0001676116 00000 n 
-0001676174 00000 n 
-0001679075 00000 n 
-0001679297 00000 n 
-0001679502 00000 n 
-0001679723 00000 n 
-0001679944 00000 n 
-0001680166 00000 n 
-0001684316 00000 n 
-0001680360 00000 n 
-0001681306 00000 n 
-0001678877 00000 n 
-0001676474 00000 n 
-0001680525 00000 n 
-0001680583 00000 n 
-0001680701 00000 n 
-0001680760 00000 n 
-0001680878 00000 n 
-0001681129 00000 n 
-0001681247 00000 n 
-0004861781 00000 n 
-0001684504 00000 n 
-0001684692 00000 n 
-0001684878 00000 n 
-0001686057 00000 n 
-0001684145 00000 n 
-0001681514 00000 n 
-0001685043 00000 n 
-0001685160 00000 n 
-0001685277 00000 n 
-0001685336 00000 n 
-0001685395 00000 n 
-0001685513 00000 n 
-0001685636 00000 n 
-0001685758 00000 n 
-0001685881 00000 n 
-0001685940 00000 n 
-0001688854 00000 n 
-0001689076 00000 n 
-0001689272 00000 n 
-0001690505 00000 n 
-0001688692 00000 n 
-0001686238 00000 n 
-0001689437 00000 n 
-0001689495 00000 n 
-0001689613 00000 n 
-0001689731 00000 n 
-0001689852 00000 n 
-0001689975 00000 n 
-0001690034 00000 n 
-0001690152 00000 n 
-0001690270 00000 n 
-0001690388 00000 n 
-0001692519 00000 n 
-0001694215 00000 n 
-0001692375 00000 n 
-0001690748 00000 n 
-0001692684 00000 n 
-0001692742 00000 n 
-0001692860 00000 n 
-0001692978 00000 n 
-0001693096 00000 n 
-0001693214 00000 n 
-0001693332 00000 n 
-0001693450 00000 n 
-0001693568 00000 n 
-0001693686 00000 n 
-0001693804 00000 n 
-0001693922 00000 n 
-0001694040 00000 n 
-0001694157 00000 n 
-0001696189 00000 n 
-0001697944 00000 n 
-0001696045 00000 n 
-0001694383 00000 n 
-0001696354 00000 n 
-0001696471 00000 n 
-0001696589 00000 n 
-0001696707 00000 n 
-0001696825 00000 n 
-0001696943 00000 n 
-0001697060 00000 n 
-0001697178 00000 n 
-0001697295 00000 n 
-0001697413 00000 n 
-0001697472 00000 n 
-0001697531 00000 n 
-0001697590 00000 n 
-0001697649 00000 n 
-0001697708 00000 n 
-0001697826 00000 n 
-0001697885 00000 n 
-0001700088 00000 n 
-0001701608 00000 n 
-0001699944 00000 n 
-0001698112 00000 n 
-0001700253 00000 n 
-0001700370 00000 n 
-0001700429 00000 n 
-0001700488 00000 n 
-0001700547 00000 n 
-0001700606 00000 n 
-0001700664 00000 n 
-0001700723 00000 n 
-0001700782 00000 n 
-0001700900 00000 n 
-0001700959 00000 n 
-0001701018 00000 n 
-0001701077 00000 n 
-0001701195 00000 n 
-0001701254 00000 n 
-0001701313 00000 n 
-0001701372 00000 n 
-0001701431 00000 n 
-0001701549 00000 n 
-0001704058 00000 n 
-0001704286 00000 n 
-0001704490 00000 n 
-0001704719 00000 n 
-0001704907 00000 n 
-0001705112 00000 n 
-0001705341 00000 n 
-0001705537 00000 n 
-0001705742 00000 n 
-0001705971 00000 n 
-0001706167 00000 n 
-0001706395 00000 n 
-0001706590 00000 n 
-0001706794 00000 n 
-0001707023 00000 n 
-0001707218 00000 n 
-0001707448 00000 n 
-0001707644 00000 n 
-0001707848 00000 n 
-0001708078 00000 n 
-0001708307 00000 n 
-0001708511 00000 n 
-0001708715 00000 n 
-0001708945 00000 n 
-0001709175 00000 n 
-0001709380 00000 n 
-0001709610 00000 n 
-0001709840 00000 n 
-0001710070 00000 n 
-0001710258 00000 n 
-0001710487 00000 n 
-0001714409 00000 n 
-0001714621 00000 n 
-0001710715 00000 n 
-0001711997 00000 n 
-0001703635 00000 n 
-0001701776 00000 n 
-0001710880 00000 n 
-0001711055 00000 n 
-0001711114 00000 n 
-0001711173 00000 n 
-0001711232 00000 n 
-0001711291 00000 n 
-0001711350 00000 n 
-0001711409 00000 n 
-0001711467 00000 n 
-0001711526 00000 n 
-0001711585 00000 n 
-0001711644 00000 n 
-0001711703 00000 n 
-0001711762 00000 n 
-0001711821 00000 n 
-0001711880 00000 n 
-0001711939 00000 n 
-0004861907 00000 n 
-0001726241 00000 n 
-0001714851 00000 n 
-0001715063 00000 n 
-0001715293 00000 n 
-0001715523 00000 n 
-0001715753 00000 n 
-0001715983 00000 n 
-0001716213 00000 n 
-0001716443 00000 n 
-0001716671 00000 n 
-0001716875 00000 n 
-0001717105 00000 n 
-0001717309 00000 n 
-0001717539 00000 n 
-0001717769 00000 n 
-0001717965 00000 n 
-0001718169 00000 n 
-0001718398 00000 n 
-0001718594 00000 n 
-0001718824 00000 n 
-0001719054 00000 n 
-0001719249 00000 n 
-0001719478 00000 n 
-0001719700 00000 n 
-0001719930 00000 n 
-0001720126 00000 n 
-0001720355 00000 n 
-0001720550 00000 n 
-0001720745 00000 n 
-0001720972 00000 n 
-0001721165 00000 n 
-0001725059 00000 n 
-0001725254 00000 n 
-0001721358 00000 n 
-0001722524 00000 n 
-0001713977 00000 n 
-0001712205 00000 n 
-0001721523 00000 n 
-0001721581 00000 n 
-0001721640 00000 n 
-0001721699 00000 n 
-0001721758 00000 n 
-0001721817 00000 n 
-0001721876 00000 n 
-0001721935 00000 n 
-0001721994 00000 n 
-0001722053 00000 n 
-0001722112 00000 n 
-0001722171 00000 n 
-0001722230 00000 n 
-0001722289 00000 n 
-0001722348 00000 n 
-0001722407 00000 n 
-0001722465 00000 n 
-0001733297 00000 n 
-0001733415 00000 n 
-0001725440 00000 n 
-0001725670 00000 n 
-0001725900 00000 n 
-0001726359 00000 n 
-0001724879 00000 n 
-0001722733 00000 n 
-0001726065 00000 n 
-0001726123 00000 n 
-0001726182 00000 n 
-0001726300 00000 n 
-0001728692 00000 n 
-0001728937 00000 n 
-0001729183 00000 n 
-0001729395 00000 n 
-0001729640 00000 n 
-0001729852 00000 n 
-0001730099 00000 n 
-0001730312 00000 n 
-0001730500 00000 n 
-0001730747 00000 n 
-0001730935 00000 n 
-0001731182 00000 n 
-0001731394 00000 n 
-0001731641 00000 n 
-0001731853 00000 n 
-0001732100 00000 n 
-0001732345 00000 n 
-0001732557 00000 n 
-0001732803 00000 n 
-0001736845 00000 n 
-0001733015 00000 n 
-0001734361 00000 n 
-0001728377 00000 n 
-0001726564 00000 n 
-0001733180 00000 n 
-0001733238 00000 n 
-0001733356 00000 n 
-0001733478 00000 n 
-0001733537 00000 n 
-0001733713 00000 n 
-0001733772 00000 n 
-0001733831 00000 n 
-0001733890 00000 n 
-0001733949 00000 n 
-0001734008 00000 n 
-0001734067 00000 n 
-0001734126 00000 n 
-0001734185 00000 n 
-0001734243 00000 n 
-0001734302 00000 n 
-0001737040 00000 n 
-0001737273 00000 n 
-0001737506 00000 n 
-0001737739 00000 n 
-0001741835 00000 n 
-0001742016 00000 n 
-0001737944 00000 n 
-0001738814 00000 n 
-0001736656 00000 n 
-0001734584 00000 n 
-0001738109 00000 n 
-0001738167 00000 n 
-0001738343 00000 n 
-0001738402 00000 n 
-0001738461 00000 n 
-0001738519 00000 n 
-0001738578 00000 n 
-0001738637 00000 n 
-0001738696 00000 n 
-0001738755 00000 n 
-0001742203 00000 n 
-0001742357 00000 n 
-0001742579 00000 n 
-0001742802 00000 n 
-0001742998 00000 n 
-0001743221 00000 n 
-0001743417 00000 n 
-0001743640 00000 n 
-0001743829 00000 n 
-0001744051 00000 n 
-0001744271 00000 n 
-0001744458 00000 n 
-0001744679 00000 n 
-0001744868 00000 n 
-0001745089 00000 n 
-0001745278 00000 n 
-0001745499 00000 n 
-0001745687 00000 n 
-0001745859 00000 n 
-0001746080 00000 n 
-0001746269 00000 n 
-0001746492 00000 n 
-0001746681 00000 n 
-0001746900 00000 n 
-0001747087 00000 n 
-0001748310 00000 n 
-0001741457 00000 n 
-0001739022 00000 n 
-0001747252 00000 n 
-0001747310 00000 n 
-0001747486 00000 n 
-0001747545 00000 n 
-0001747604 00000 n 
-0001747663 00000 n 
-0001747722 00000 n 
-0001747780 00000 n 
-0001747839 00000 n 
-0001747898 00000 n 
-0001747957 00000 n 
-0001748016 00000 n 
-0001748075 00000 n 
-0001748134 00000 n 
-0001748193 00000 n 
-0001748252 00000 n 
-0001750755 00000 n 
-0001750978 00000 n 
-0001751167 00000 n 
-0001751356 00000 n 
-0001751577 00000 n 
-0001751765 00000 n 
-0001751953 00000 n 
-0001752176 00000 n 
-0001752365 00000 n 
-0001752554 00000 n 
-0001752775 00000 n 
-0001752962 00000 n 
-0001753185 00000 n 
-0001753374 00000 n 
-0001753596 00000 n 
-0001753785 00000 n 
-0001753974 00000 n 
-0001754197 00000 n 
-0001754386 00000 n 
-0001754575 00000 n 
-0001754798 00000 n 
-0001754987 00000 n 
-0001755176 00000 n 
-0001755398 00000 n 
-0001755621 00000 n 
-0001755842 00000 n 
-0001756065 00000 n 
-0001756254 00000 n 
-0001756476 00000 n 
-0001756664 00000 n 
-0001756868 00000 n 
-0001757091 00000 n 
-0001757295 00000 n 
-0001757518 00000 n 
-0001757741 00000 n 
-0001761633 00000 n 
-0001761787 00000 n 
-0001757961 00000 n 
-0001758892 00000 n 
-0001750296 00000 n 
-0001748532 00000 n 
-0001758126 00000 n 
-0001758184 00000 n 
-0001758243 00000 n 
-0001758302 00000 n 
-0001758361 00000 n 
-0001758420 00000 n 
-0001758479 00000 n 
-0001758538 00000 n 
-0001758597 00000 n 
-0001758656 00000 n 
-0001758715 00000 n 
-0001758774 00000 n 
-0001758833 00000 n 
-0004862033 00000 n 
-0001762519 00000 n 
-0001762637 00000 n 
-0001762755 00000 n 
-0001762342 00000 n 
-0001765156 00000 n 
-0001769592 00000 n 
-0001761942 00000 n 
-0001763167 00000 n 
-0001761471 00000 n 
-0001759102 00000 n 
-0001762107 00000 n 
-0001762165 00000 n 
-0001762224 00000 n 
-0001762283 00000 n 
-0001762401 00000 n 
-0001762460 00000 n 
-0001762578 00000 n 
-0001762696 00000 n 
-0001762814 00000 n 
-0001762873 00000 n 
-0001762932 00000 n 
-0001762991 00000 n 
-0001769660 00000 n 
-0001769863 00000 n 
-0001770102 00000 n 
-0001770353 00000 n 
-0001770556 00000 n 
-0001770760 00000 n 
-0001770999 00000 n 
-0001771249 00000 n 
-0001771453 00000 n 
-0001771657 00000 n 
-0001771896 00000 n 
-0001772147 00000 n 
-0001772352 00000 n 
-0001772556 00000 n 
-0001772795 00000 n 
-0001773046 00000 n 
-0001773251 00000 n 
-0001773455 00000 n 
-0001773694 00000 n 
-0001773945 00000 n 
-0001774150 00000 n 
-0001774400 00000 n 
-0001774639 00000 n 
-0001774878 00000 n 
-0001775117 00000 n 
-0001775367 00000 n 
-0001779283 00000 n 
-0001779534 00000 n 
-0001779739 00000 n 
-0001775583 00000 n 
-0001776277 00000 n 
-0001764762 00000 n 
-0001763362 00000 n 
-0001775748 00000 n 
-0001775806 00000 n 
-0001775865 00000 n 
-0001775924 00000 n 
-0001775982 00000 n 
-0001776041 00000 n 
-0001776100 00000 n 
-0001776159 00000 n 
-0001776218 00000 n 
-0001766110 00000 n 
-0001766241 00000 n 
-0001766391 00000 n 
-0001766723 00000 n 
-0001767171 00000 n 
-0001767409 00000 n 
-0001767431 00000 n 
-0001769569 00000 n 
-0001787956 00000 n 
-0001779942 00000 n 
-0001780192 00000 n 
-0001780443 00000 n 
-0001780660 00000 n 
-0001781093 00000 n 
-0001781344 00000 n 
-0001781561 00000 n 
-0001781994 00000 n 
-0001782570 00000 n 
-0001779031 00000 n 
-0001776500 00000 n 
-0001782159 00000 n 
-0001782217 00000 n 
-0001782276 00000 n 
-0001782334 00000 n 
-0001780877 00000 n 
-0001781778 00000 n 
-0001782393 00000 n 
-0001782452 00000 n 
-0001782511 00000 n 
-0001788192 00000 n 
-0001786483 00000 n 
-0001786959 00000 n 
-0001787435 00000 n 
-0001787674 00000 n 
-0001788427 00000 n 
-0001786294 00000 n 
-0001782867 00000 n 
-0001787839 00000 n 
-0001786722 00000 n 
-0001787197 00000 n 
-0001787897 00000 n 
-0001788015 00000 n 
-0001788074 00000 n 
-0001788133 00000 n 
-0001788251 00000 n 
-0001788310 00000 n 
-0001790489 00000 n 
-0001794768 00000 n 
-0001794836 00000 n 
-0001795040 00000 n 
-0001795279 00000 n 
-0001795528 00000 n 
-0001795731 00000 n 
-0001795935 00000 n 
-0001796174 00000 n 
-0001796422 00000 n 
-0001796626 00000 n 
-0001796830 00000 n 
-0001797069 00000 n 
-0001797318 00000 n 
-0001797523 00000 n 
-0001797727 00000 n 
-0001797966 00000 n 
-0001798215 00000 n 
-0001798420 00000 n 
-0001798624 00000 n 
-0001798862 00000 n 
-0001799110 00000 n 
-0001802689 00000 n 
-0001802937 00000 n 
-0001803176 00000 n 
-0001803415 00000 n 
-0001799312 00000 n 
-0001799947 00000 n 
-0001790149 00000 n 
-0001788712 00000 n 
-0001799477 00000 n 
-0001799593 00000 n 
-0001799652 00000 n 
-0001799711 00000 n 
-0001799770 00000 n 
-0001799829 00000 n 
-0001799888 00000 n 
-0001791435 00000 n 
-0001791566 00000 n 
-0001791716 00000 n 
-0001792040 00000 n 
-0001792476 00000 n 
-0001792714 00000 n 
-0001792736 00000 n 
-0001794745 00000 n 
-0001803653 00000 n 
-0001803902 00000 n 
-0001804117 00000 n 
-0001804366 00000 n 
-0001804570 00000 n 
-0001804775 00000 n 
-0001805023 00000 n 
-0001805271 00000 n 
-0001805486 00000 n 
-0001805915 00000 n 
-0001806163 00000 n 
-0001806378 00000 n 
-0001806807 00000 n 
-0001807502 00000 n 
-0001802383 00000 n 
-0001800155 00000 n 
-0001806972 00000 n 
-0001807030 00000 n 
-0001807089 00000 n 
-0001807148 00000 n 
-0001807207 00000 n 
-0001807266 00000 n 
-0001805701 00000 n 
-0001806593 00000 n 
-0001807325 00000 n 
-0001807384 00000 n 
-0001807443 00000 n 
-0004862159 00000 n 
-0001813581 00000 n 
-0001816502 00000 n 
-0001811632 00000 n 
-0001812109 00000 n 
-0001812586 00000 n 
-0001813062 00000 n 
-0001813299 00000 n 
-0001813758 00000 n 
-0001811425 00000 n 
-0001807724 00000 n 
-0001813464 00000 n 
-0001811871 00000 n 
-0001812348 00000 n 
-0001812825 00000 n 
-0001813522 00000 n 
-0001813640 00000 n 
-0001813699 00000 n 
-0001892456 00000 n 
-0001819020 00000 n 
-0001823811 00000 n 
-0001816220 00000 n 
-0001817031 00000 n 
-0001816076 00000 n 
-0001814056 00000 n 
-0001816385 00000 n 
-0001816443 00000 n 
-0001816561 00000 n 
-0001816620 00000 n 
-0001816796 00000 n 
-0001816855 00000 n 
-0001823879 00000 n 
-0001824141 00000 n 
-0001824404 00000 n 
-0001824634 00000 n 
-0001824864 00000 n 
-0001825127 00000 n 
-0001825357 00000 n 
-0001825621 00000 n 
-0001825850 00000 n 
-0001826079 00000 n 
-0001826343 00000 n 
-0001826606 00000 n 
-0001827418 00000 n 
-0001818761 00000 n 
-0001817213 00000 n 
-0001826771 00000 n 
-0001826829 00000 n 
-0001826888 00000 n 
-0001826947 00000 n 
-0001827006 00000 n 
-0001827065 00000 n 
-0001827124 00000 n 
-0001827183 00000 n 
-0001827242 00000 n 
-0001820282 00000 n 
-0001820413 00000 n 
-0001820563 00000 n 
-0001820895 00000 n 
-0001821339 00000 n 
-0001821577 00000 n 
-0001821599 00000 n 
-0001823788 00000 n 
-0001829447 00000 n 
-0001833855 00000 n 
-0001833923 00000 n 
-0001834146 00000 n 
-0001834393 00000 n 
-0001834616 00000 n 
-0001834863 00000 n 
-0001835109 00000 n 
-0001835354 00000 n 
-0001835601 00000 n 
-0001835848 00000 n 
-0001836094 00000 n 
-0001836340 00000 n 
-0001836587 00000 n 
-0001836833 00000 n 
-0001837080 00000 n 
-0001837327 00000 n 
-0001837572 00000 n 
-0001837819 00000 n 
-0001838063 00000 n 
-0001841616 00000 n 
-0001841862 00000 n 
-0001838308 00000 n 
-0001839238 00000 n 
-0001829125 00000 n 
-0001827643 00000 n 
-0001838473 00000 n 
-0001838531 00000 n 
-0001838590 00000 n 
-0001838649 00000 n 
-0001838708 00000 n 
-0001838767 00000 n 
-0001838826 00000 n 
-0001838885 00000 n 
-0001838944 00000 n 
-0001839003 00000 n 
-0001839062 00000 n 
-0001839121 00000 n 
-0001839180 00000 n 
-0001830326 00000 n 
-0001830457 00000 n 
-0001830607 00000 n 
-0001830939 00000 n 
-0001831384 00000 n 
-0001831622 00000 n 
-0001831644 00000 n 
-0001833832 00000 n 
-0001847432 00000 n 
-0001842109 00000 n 
-0001842355 00000 n 
-0001842602 00000 n 
-0001842848 00000 n 
-0001843095 00000 n 
-0001843339 00000 n 
-0001843595 00000 n 
-0001843850 00000 n 
-0001844079 00000 n 
-0001844300 00000 n 
-0001844556 00000 n 
-0001844785 00000 n 
-0001845041 00000 n 
-0001845297 00000 n 
-0001845518 00000 n 
-0001845774 00000 n 
-0001845996 00000 n 
-0001846253 00000 n 
-0001846475 00000 n 
-0001846732 00000 n 
-0001846953 00000 n 
-0001850579 00000 n 
-0001850835 00000 n 
-0001851058 00000 n 
-0001847209 00000 n 
-0001848550 00000 n 
-0001841265 00000 n 
-0001839447 00000 n 
-0001847374 00000 n 
-0001847491 00000 n 
-0001847550 00000 n 
-0001847609 00000 n 
-0001847667 00000 n 
-0001847726 00000 n 
-0001847785 00000 n 
-0001847961 00000 n 
-0001848020 00000 n 
-0001848079 00000 n 
-0001848138 00000 n 
-0001848196 00000 n 
-0001848255 00000 n 
-0001848314 00000 n 
-0001848373 00000 n 
-0001848432 00000 n 
-0001848491 00000 n 
-0001851281 00000 n 
-0001851538 00000 n 
-0001851761 00000 n 
-0001851984 00000 n 
-0001852968 00000 n 
-0001850381 00000 n 
-0001848772 00000 n 
-0001852149 00000 n 
-0001852207 00000 n 
-0001852266 00000 n 
-0001852325 00000 n 
-0001852384 00000 n 
-0001852443 00000 n 
-0001852618 00000 n 
-0001852793 00000 n 
-0001852852 00000 n 
-0004862285 00000 n 
-0001855585 00000 n 
-0001861515 00000 n 
-0001854210 00000 n 
-0001854491 00000 n 
-0001854066 00000 n 
-0001853164 00000 n 
-0001854375 00000 n 
-0001861583 00000 n 
-0001861771 00000 n 
-0001862008 00000 n 
-0001862349 00000 n 
-0001855407 00000 n 
-0001854658 00000 n 
-0001862173 00000 n 
-0001862231 00000 n 
-0001857584 00000 n 
-0001857715 00000 n 
-0001857865 00000 n 
-0001858221 00000 n 
-0001858696 00000 n 
-0001858934 00000 n 
-0001858956 00000 n 
-0001861492 00000 n 
-0001864982 00000 n 
-0001865163 00000 n 
-0001865401 00000 n 
-0001865605 00000 n 
-0001865842 00000 n 
-0001866080 00000 n 
-0001866318 00000 n 
-0001866557 00000 n 
-0001866796 00000 n 
-0001867035 00000 n 
-0001867273 00000 n 
-0001867750 00000 n 
-0001867989 00000 n 
-0001868226 00000 n 
-0001868462 00000 n 
-0001868701 00000 n 
-0001868940 00000 n 
-0001869179 00000 n 
-0001869418 00000 n 
-0001869657 00000 n 
-0001869896 00000 n 
-0001870132 00000 n 
-0001870826 00000 n 
-0001864640 00000 n 
-0001862517 00000 n 
-0001870297 00000 n 
-0001870473 00000 n 
-0001870532 00000 n 
-0001867512 00000 n 
-0001870591 00000 n 
-0001870649 00000 n 
-0001870708 00000 n 
-0001870767 00000 n 
-0001887414 00000 n 
-0001874096 00000 n 
-0001874276 00000 n 
-0001874772 00000 n 
-0001875281 00000 n 
-0001875781 00000 n 
-0001876266 00000 n 
-0001876515 00000 n 
-0001876761 00000 n 
-0001877005 00000 n 
-0001877500 00000 n 
-0001878008 00000 n 
-0001878507 00000 n 
-0001878991 00000 n 
-0001879240 00000 n 
-0001879486 00000 n 
-0001879729 00000 n 
-0001880424 00000 n 
-0001873745 00000 n 
-0001871020 00000 n 
-0001879894 00000 n 
-0001879952 00000 n 
-0001880070 00000 n 
-0001874525 00000 n 
-0001875027 00000 n 
-0001875532 00000 n 
-0001876024 00000 n 
-0001880188 00000 n 
-0001877254 00000 n 
-0001877754 00000 n 
-0001878259 00000 n 
-0001878749 00000 n 
-0001880247 00000 n 
-0001880365 00000 n 
-0002794110 00000 n 
-0003945716 00000 n 
-0004003210 00000 n 
-0002794169 00000 n 
-0003945776 00000 n 
-0004003269 00000 n 
-0001883903 00000 n 
-0001884400 00000 n 
-0001884897 00000 n 
-0001885405 00000 n 
-0001885906 00000 n 
-0001886392 00000 n 
-0001886641 00000 n 
-0001886888 00000 n 
-0001887132 00000 n 
-0001887768 00000 n 
-0001883642 00000 n 
-0001880592 00000 n 
-0001887297 00000 n 
-0001887355 00000 n 
-0001884152 00000 n 
-0001884649 00000 n 
-0001885151 00000 n 
-0001885656 00000 n 
-0001886150 00000 n 
-0001887473 00000 n 
-0001887532 00000 n 
-0001887650 00000 n 
-0001887709 00000 n 
-0003100735 00000 n 
-0002806441 00000 n 
-0003960506 00000 n 
-0004016036 00000 n 
-0001891811 00000 n 
-0001892031 00000 n 
-0001892233 00000 n 
-0001892988 00000 n 
-0001891649 00000 n 
-0001888001 00000 n 
-0001892398 00000 n 
-0001892520 00000 n 
-0001892579 00000 n 
-0001892638 00000 n 
-0001892755 00000 n 
-0001892930 00000 n 
-0004862411 00000 n 
-0001898646 00000 n 
-0001896582 00000 n 
-0001896804 00000 n 
-0001897007 00000 n 
-0001897227 00000 n 
-0001897423 00000 n 
-0001897644 00000 n 
-0001897844 00000 n 
-0001898048 00000 n 
-0001898246 00000 n 
-0001898882 00000 n 
-0001896366 00000 n 
-0001893285 00000 n 
-0001898411 00000 n 
-0001898469 00000 n 
-0001898528 00000 n 
-0001898587 00000 n 
-0001898705 00000 n 
-0001898764 00000 n 
-0001898823 00000 n 
-0001904512 00000 n 
-0001904630 00000 n 
-0001901783 00000 n 
-0001901994 00000 n 
-0001902215 00000 n 
-0001902469 00000 n 
-0001902723 00000 n 
-0001902977 00000 n 
-0001903230 00000 n 
-0001903425 00000 n 
-0001903646 00000 n 
-0001903865 00000 n 
-0001904069 00000 n 
-0001907551 00000 n 
-0001907771 00000 n 
-0001907957 00000 n 
-0001908177 00000 n 
-0001908363 00000 n 
-0001908568 00000 n 
-0001908787 00000 n 
-0001908972 00000 n 
-0001904289 00000 n 
-0001905042 00000 n 
-0001901540 00000 n 
-0001899078 00000 n 
-0001904454 00000 n 
-0001904571 00000 n 
-0001904689 00000 n 
-0001904865 00000 n 
-0001904924 00000 n 
-0001904983 00000 n 
-0002005336 00000 n 
-0002005454 00000 n 
-0002005518 00000 n 
-0002005582 00000 n 
-0002005646 00000 n 
-0002001430 00000 n 
-0002038039 00000 n 
-0001909176 00000 n 
-0001909396 00000 n 
-0001909582 00000 n 
-0001909787 00000 n 
-0001909992 00000 n 
-0001910212 00000 n 
-0001910398 00000 n 
-0001910619 00000 n 
-0001910806 00000 n 
-0001911010 00000 n 
-0001911231 00000 n 
-0001911452 00000 n 
-0001911657 00000 n 
-0001911861 00000 n 
-0001912082 00000 n 
-0001912303 00000 n 
-0001912508 00000 n 
-0001912728 00000 n 
-0001912914 00000 n 
-0001913100 00000 n 
-0001913320 00000 n 
-0001913511 00000 n 
-0001913732 00000 n 
-0001913917 00000 n 
-0001914136 00000 n 
-0001914322 00000 n 
-0001914527 00000 n 
-0001914747 00000 n 
-0001914968 00000 n 
-0001915189 00000 n 
-0001915410 00000 n 
-0001915630 00000 n 
-0001915851 00000 n 
-0001916070 00000 n 
-0001916254 00000 n 
-0001916475 00000 n 
-0001916679 00000 n 
-0001916900 00000 n 
-0001917102 00000 n 
-0001917321 00000 n 
-0001917542 00000 n 
-0001917729 00000 n 
-0001917950 00000 n 
-0001918137 00000 n 
-0001922188 00000 n 
-0001922405 00000 n 
-0001918356 00000 n 
-0001919520 00000 n 
-0001906939 00000 n 
-0001905223 00000 n 
-0001918521 00000 n 
-0001918579 00000 n 
-0001918638 00000 n 
-0001918697 00000 n 
-0001918756 00000 n 
-0001918814 00000 n 
-0001918873 00000 n 
-0001918931 00000 n 
-0001918990 00000 n 
-0001919049 00000 n 
-0001919108 00000 n 
-0001919167 00000 n 
-0001919226 00000 n 
-0001919285 00000 n 
-0001919344 00000 n 
-0001919403 00000 n 
-0001919462 00000 n 
-0002005769 00000 n 
-0002005887 00000 n 
-0002010775 00000 n 
-0002010892 00000 n 
-0002011015 00000 n 
-0002011193 00000 n 
-0002011316 00000 n 
-0002015271 00000 n 
-0002015448 00000 n 
-0002015566 00000 n 
-0001922626 00000 n 
-0001922847 00000 n 
-0001923066 00000 n 
-0001923286 00000 n 
-0001923506 00000 n 
-0001923692 00000 n 
-0001923913 00000 n 
-0001924133 00000 n 
-0001924319 00000 n 
-0001924539 00000 n 
-0001924734 00000 n 
-0001924938 00000 n 
-0001925158 00000 n 
-0001925345 00000 n 
-0001925566 00000 n 
-0001925762 00000 n 
-0001925967 00000 n 
-0001926186 00000 n 
-0001926373 00000 n 
-0001926594 00000 n 
-0001926790 00000 n 
-0001927020 00000 n 
-0001927232 00000 n 
-0001927437 00000 n 
-0001927658 00000 n 
-0001927845 00000 n 
-0001928066 00000 n 
-0001928271 00000 n 
-0001928458 00000 n 
-0001928679 00000 n 
-0001928875 00000 n 
-0001929080 00000 n 
-0001929266 00000 n 
-0001929486 00000 n 
-0001929681 00000 n 
-0001929909 00000 n 
-0001930121 00000 n 
-0001930326 00000 n 
-0001930547 00000 n 
-0001930734 00000 n 
-0001930955 00000 n 
-0001931160 00000 n 
-0001931347 00000 n 
-0001931568 00000 n 
-0001931764 00000 n 
-0001931969 00000 n 
-0001932174 00000 n 
-0001932395 00000 n 
-0001932582 00000 n 
-0001932803 00000 n 
-0001933024 00000 n 
-0001933211 00000 n 
-0001933432 00000 n 
-0001933618 00000 n 
-0001937845 00000 n 
-0001938050 00000 n 
-0001938271 00000 n 
-0001933838 00000 n 
-0001934942 00000 n 
-0001921540 00000 n 
-0001919715 00000 n 
-0001934003 00000 n 
-0001934061 00000 n 
-0001934120 00000 n 
-0001934179 00000 n 
-0001934237 00000 n 
-0001934296 00000 n 
-0001934355 00000 n 
-0001934414 00000 n 
-0001934473 00000 n 
-0001934530 00000 n 
-0001934589 00000 n 
-0001934648 00000 n 
-0001934707 00000 n 
-0001934766 00000 n 
-0001934824 00000 n 
-0001934883 00000 n 
-0002015689 00000 n 
-0002006069 00000 n 
-0002006246 00000 n 
-0002006422 00000 n 
-0002010598 00000 n 
-0001938510 00000 n 
-0001938731 00000 n 
-0001938918 00000 n 
-0001939139 00000 n 
-0001939325 00000 n 
-0001939512 00000 n 
-0001939698 00000 n 
-0001939918 00000 n 
-0001940114 00000 n 
-0001940319 00000 n 
-0001940539 00000 n 
-0001940760 00000 n 
-0001940945 00000 n 
-0001941164 00000 n 
-0001941357 00000 n 
-0001941561 00000 n 
-0001941780 00000 n 
-0001942001 00000 n 
-0001942187 00000 n 
-0001942407 00000 n 
-0001942603 00000 n 
-0001942833 00000 n 
-0001943045 00000 n 
-0001943250 00000 n 
-0001943470 00000 n 
-0001943912 00000 n 
-0001944098 00000 n 
-0001944319 00000 n 
-0001944523 00000 n 
-0001944742 00000 n 
-0001944927 00000 n 
-0001945147 00000 n 
-0001945342 00000 n 
-0001945546 00000 n 
-0001945766 00000 n 
-0001945951 00000 n 
-0001946171 00000 n 
-0001946366 00000 n 
-0001946595 00000 n 
-0001946807 00000 n 
-0001947012 00000 n 
-0001947232 00000 n 
-0001947674 00000 n 
-0001947860 00000 n 
-0001948080 00000 n 
-0001948285 00000 n 
-0001948506 00000 n 
-0001948692 00000 n 
-0001948912 00000 n 
-0001949108 00000 n 
-0001949311 00000 n 
-0001949532 00000 n 
-0001949748 00000 n 
-0001949929 00000 n 
-0001950112 00000 n 
-0001950332 00000 n 
-0001950518 00000 n 
-0001950704 00000 n 
-0001950925 00000 n 
-0001951118 00000 n 
-0001951304 00000 n 
-0001951491 00000 n 
-0001951696 00000 n 
-0001951917 00000 n 
-0001952110 00000 n 
-0001952296 00000 n 
-0001952483 00000 n 
-0001952688 00000 n 
-0001952907 00000 n 
-0001953098 00000 n 
-0001953282 00000 n 
-0001953467 00000 n 
-0001957036 00000 n 
-0001957256 00000 n 
-0001957449 00000 n 
-0001957635 00000 n 
-0001957822 00000 n 
-0001953670 00000 n 
-0001954246 00000 n 
-0001937008 00000 n 
-0001935165 00000 n 
-0001953835 00000 n 
-0001953893 00000 n 
-0001953952 00000 n 
-0001954010 00000 n 
-0001943691 00000 n 
-0001954069 00000 n 
-0001954128 00000 n 
-0001947453 00000 n 
-0001954187 00000 n 
-0002015869 00000 n 
-0002015985 00000 n 
-0002016103 00000 n 
-0002016220 00000 n 
-0002016336 00000 n 
-0002019712 00000 n 
-0002019830 00000 n 
-0002019948 00000 n 
-0002020066 00000 n 
-0002020184 00000 n 
-0002020302 00000 n 
-0001958027 00000 n 
-0001958248 00000 n 
-0001958441 00000 n 
-0001958626 00000 n 
-0001958812 00000 n 
-0001959016 00000 n 
-0001959236 00000 n 
-0001959429 00000 n 
-0001959615 00000 n 
-0001959802 00000 n 
-0001960007 00000 n 
-0001960227 00000 n 
-0001960419 00000 n 
-0001960791 00000 n 
-0001960978 00000 n 
-0001961183 00000 n 
-0001961404 00000 n 
-0001961597 00000 n 
-0001961970 00000 n 
-0001962157 00000 n 
-0001962362 00000 n 
-0001962582 00000 n 
-0001962774 00000 n 
-0001963146 00000 n 
-0001963333 00000 n 
-0001963538 00000 n 
-0001963759 00000 n 
-0001963980 00000 n 
-0001964165 00000 n 
-0001964385 00000 n 
-0001964580 00000 n 
-0001964784 00000 n 
-0001964970 00000 n 
-0001965191 00000 n 
-0001965387 00000 n 
-0001965592 00000 n 
-0001965778 00000 n 
-0001965999 00000 n 
-0001966195 00000 n 
-0001966400 00000 n 
-0001966586 00000 n 
-0001966807 00000 n 
-0001967011 00000 n 
-0001967197 00000 n 
-0001967418 00000 n 
-0001967614 00000 n 
-0001967819 00000 n 
-0001968005 00000 n 
-0001968226 00000 n 
-0001968422 00000 n 
-0001968831 00000 n 
-0001969017 00000 n 
-0001969237 00000 n 
-0001969442 00000 n 
-0001969628 00000 n 
-0001969848 00000 n 
-0001970044 00000 n 
-0001970247 00000 n 
-0001970467 00000 n 
-0001970652 00000 n 
-0001970839 00000 n 
-0001971060 00000 n 
-0001971247 00000 n 
-0001971434 00000 n 
-0001971655 00000 n 
-0001971848 00000 n 
-0001972034 00000 n 
-0001972221 00000 n 
-0001972425 00000 n 
-0001972646 00000 n 
-0001972839 00000 n 
-0001973023 00000 n 
-0001973208 00000 n 
-0001973411 00000 n 
-0001973630 00000 n 
-0001973821 00000 n 
-0001974005 00000 n 
-0001974190 00000 n 
-0001978125 00000 n 
-0001978345 00000 n 
-0001978538 00000 n 
-0001978724 00000 n 
-0001978911 00000 n 
-0001974393 00000 n 
-0001974616 00000 n 
-0001956109 00000 n 
-0001954441 00000 n 
-0001974558 00000 n 
-0001960605 00000 n 
-0001961784 00000 n 
-0001962960 00000 n 
-0001968627 00000 n 
-0004862537 00000 n 
-0002023138 00000 n 
-0002023314 00000 n 
-0002026098 00000 n 
-0002026216 00000 n 
-0002026334 00000 n 
-0002029476 00000 n 
-0002029594 00000 n 
-0002029711 00000 n 
-0002029829 00000 n 
-0002030065 00000 n 
-0002030419 00000 n 
-0002030537 00000 n 
-0002030655 00000 n 
-0001979115 00000 n 
-0001979333 00000 n 
-0001979524 00000 n 
-0001979709 00000 n 
-0001979895 00000 n 
-0001980099 00000 n 
-0001980319 00000 n 
-0001980512 00000 n 
-0001980698 00000 n 
-0001980885 00000 n 
-0001981090 00000 n 
-0001981311 00000 n 
-0001981504 00000 n 
-0001981877 00000 n 
-0001982064 00000 n 
-0001982269 00000 n 
-0001982490 00000 n 
-0001982683 00000 n 
-0001983056 00000 n 
-0001983243 00000 n 
-0001983448 00000 n 
-0001983669 00000 n 
-0001983862 00000 n 
-0001984234 00000 n 
-0001984420 00000 n 
-0001984624 00000 n 
-0001984845 00000 n 
-0001985031 00000 n 
-0001985218 00000 n 
-0001985403 00000 n 
-0001985566 00000 n 
-0001985847 00000 n 
-0001977639 00000 n 
-0001974825 00000 n 
-0001985731 00000 n 
-0001981691 00000 n 
-0001982870 00000 n 
-0001984049 00000 n 
-0001985789 00000 n 
-0002030773 00000 n 
-0002030891 00000 n 
-0002031009 00000 n 
-0002031127 00000 n 
-0002037685 00000 n 
-0002037803 00000 n 
-0001988677 00000 n 
-0001988898 00000 n 
-0001989119 00000 n 
-0001989340 00000 n 
-0001989561 00000 n 
-0001989782 00000 n 
-0001990003 00000 n 
-0001990224 00000 n 
-0001990445 00000 n 
-0001990666 00000 n 
-0001990886 00000 n 
-0001991105 00000 n 
-0001991323 00000 n 
-0001991543 00000 n 
-0001991763 00000 n 
-0001991983 00000 n 
-0001992203 00000 n 
-0001992424 00000 n 
-0001992645 00000 n 
-0001992866 00000 n 
-0001993087 00000 n 
-0001993308 00000 n 
-0001993529 00000 n 
-0001993748 00000 n 
-0001997664 00000 n 
-0001997885 00000 n 
-0001993966 00000 n 
-0001994189 00000 n 
-0001988317 00000 n 
-0001986141 00000 n 
-0001994131 00000 n 
-0001998105 00000 n 
-0001998325 00000 n 
-0001998545 00000 n 
-0001998766 00000 n 
-0001998987 00000 n 
-0001999208 00000 n 
-0001999429 00000 n 
-0001999634 00000 n 
-0001999855 00000 n 
-0002000076 00000 n 
-0002000297 00000 n 
-0002000517 00000 n 
-0002000737 00000 n 
-0002000956 00000 n 
-0002001148 00000 n 
-0002001548 00000 n 
-0001997376 00000 n 
-0001994419 00000 n 
-0002001313 00000 n 
-0002001371 00000 n 
-0002001489 00000 n 
-0002004243 00000 n 
-0002004430 00000 n 
-0002004616 00000 n 
-0002004844 00000 n 
-0002005054 00000 n 
-0002006540 00000 n 
-0002004063 00000 n 
-0002001804 00000 n 
-0002005219 00000 n 
-0002005277 00000 n 
-0002005395 00000 n 
-0002005710 00000 n 
-0002005828 00000 n 
-0002005951 00000 n 
-0002006010 00000 n 
-0002006128 00000 n 
-0002006187 00000 n 
-0002006305 00000 n 
-0002006364 00000 n 
-0002006481 00000 n 
-0002009874 00000 n 
-0002010104 00000 n 
-0002010316 00000 n 
-0002011437 00000 n 
-0002009712 00000 n 
-0002006723 00000 n 
-0002010481 00000 n 
-0002010539 00000 n 
-0002010657 00000 n 
-0002010716 00000 n 
-0002010834 00000 n 
-0002010956 00000 n 
-0002011079 00000 n 
-0002011138 00000 n 
-0002011257 00000 n 
-0002011379 00000 n 
-0002014329 00000 n 
-0002014549 00000 n 
-0002014770 00000 n 
-0002018989 00000 n 
-0002014989 00000 n 
-0002016394 00000 n 
-0002014158 00000 n 
-0002011643 00000 n 
-0002015154 00000 n 
-0002015212 00000 n 
-0002015330 00000 n 
-0002015389 00000 n 
-0002015507 00000 n 
-0002015630 00000 n 
-0002015752 00000 n 
-0002015810 00000 n 
-0002015927 00000 n 
-0002016044 00000 n 
-0002016161 00000 n 
-0002016277 00000 n 
-0004862663 00000 n 
-0002019209 00000 n 
-0002019430 00000 n 
-0002020420 00000 n 
-0002018827 00000 n 
-0002016588 00000 n 
-0002019595 00000 n 
-0002019653 00000 n 
-0002019771 00000 n 
-0002019889 00000 n 
-0002020007 00000 n 
-0002020125 00000 n 
-0002020243 00000 n 
-0002020361 00000 n 
-0002022915 00000 n 
-0002023432 00000 n 
-0002022771 00000 n 
-0002020601 00000 n 
-0002023080 00000 n 
-0002023197 00000 n 
-0002023255 00000 n 
-0002023373 00000 n 
-0002025875 00000 n 
-0002026452 00000 n 
-0002025731 00000 n 
-0002023613 00000 n 
-0002026040 00000 n 
-0002026157 00000 n 
-0002026275 00000 n 
-0002026393 00000 n 
-0002029253 00000 n 
-0002031243 00000 n 
-0002029109 00000 n 
-0002026646 00000 n 
-0002029418 00000 n 
-0002029535 00000 n 
-0002029653 00000 n 
-0002029770 00000 n 
-0002029888 00000 n 
-0002029947 00000 n 
-0002030006 00000 n 
-0002030124 00000 n 
-0002030183 00000 n 
-0002030242 00000 n 
-0002030301 00000 n 
-0002030360 00000 n 
-0002030478 00000 n 
-0002030596 00000 n 
-0002030714 00000 n 
-0002030832 00000 n 
-0002030950 00000 n 
-0002031068 00000 n 
-0002031185 00000 n 
-0002034087 00000 n 
-0002034315 00000 n 
-0002034519 00000 n 
-0002034747 00000 n 
-0002034934 00000 n 
-0002035139 00000 n 
-0002035367 00000 n 
-0002035562 00000 n 
-0002035790 00000 n 
-0002035985 00000 n 
-0002036190 00000 n 
-0002036418 00000 n 
-0002036611 00000 n 
-0002036837 00000 n 
-0002037031 00000 n 
-0002037234 00000 n 
-0002041492 00000 n 
-0002041721 00000 n 
-0002037462 00000 n 
-0002038685 00000 n 
-0002033799 00000 n 
-0002031424 00000 n 
-0002037627 00000 n 
-0002037744 00000 n 
-0002037862 00000 n 
-0002037921 00000 n 
-0002037980 00000 n 
-0002038098 00000 n 
-0002038274 00000 n 
-0002038332 00000 n 
-0002038390 00000 n 
-0002038449 00000 n 
-0002038508 00000 n 
-0002038567 00000 n 
-0002038626 00000 n 
-0002060959 00000 n 
-0002041926 00000 n 
-0002042130 00000 n 
-0002042359 00000 n 
-0002042588 00000 n 
-0002042793 00000 n 
-0002043022 00000 n 
-0002043251 00000 n 
-0002043438 00000 n 
-0002043667 00000 n 
-0002043853 00000 n 
-0002044046 00000 n 
-0002044275 00000 n 
-0002044486 00000 n 
-0002044715 00000 n 
-0002044926 00000 n 
-0002045155 00000 n 
-0002045384 00000 n 
-0002045613 00000 n 
-0002045841 00000 n 
-0002046070 00000 n 
-0002046299 00000 n 
-0002046527 00000 n 
-0002046731 00000 n 
-0002046960 00000 n 
-0002047164 00000 n 
-0002047393 00000 n 
-0002047621 00000 n 
-0002047815 00000 n 
-0002048019 00000 n 
-0002048247 00000 n 
-0002048442 00000 n 
-0002048671 00000 n 
-0002048900 00000 n 
-0002049094 00000 n 
-0002049322 00000 n 
-0002049540 00000 n 
-0002050997 00000 n 
-0002041015 00000 n 
-0002038908 00000 n 
-0002049705 00000 n 
-0002049763 00000 n 
-0002049822 00000 n 
-0002049879 00000 n 
-0002049938 00000 n 
-0002049997 00000 n 
-0002050056 00000 n 
-0002050115 00000 n 
-0002050174 00000 n 
-0002050233 00000 n 
-0002050292 00000 n 
-0002050350 00000 n 
-0002050409 00000 n 
-0002050468 00000 n 
-0002050527 00000 n 
-0002050586 00000 n 
-0002050645 00000 n 
-0002050704 00000 n 
-0002050762 00000 n 
-0002050820 00000 n 
-0002050879 00000 n 
-0002050938 00000 n 
-0004862789 00000 n 
-0002061136 00000 n 
-0002053850 00000 n 
-0002054079 00000 n 
-0002054273 00000 n 
-0002054502 00000 n 
-0002054696 00000 n 
-0002054891 00000 n 
-0002055120 00000 n 
-0002055314 00000 n 
-0002055509 00000 n 
-0002055703 00000 n 
-0002055889 00000 n 
-0002056118 00000 n 
-0002056347 00000 n 
-0002056688 00000 n 
-0002053598 00000 n 
-0002051193 00000 n 
-0002056512 00000 n 
-0002056570 00000 n 
-0002056629 00000 n 
-0002068166 00000 n 
-0002068284 00000 n 
-0002059567 00000 n 
-0002059796 00000 n 
-0002060024 00000 n 
-0002060253 00000 n 
-0002060448 00000 n 
-0002060677 00000 n 
-0002061254 00000 n 
-0002059378 00000 n 
-0002056916 00000 n 
-0002060842 00000 n 
-0002060900 00000 n 
-0002061018 00000 n 
-0002061077 00000 n 
-0002061195 00000 n 
-0002063580 00000 n 
-0002063824 00000 n 
-0002064069 00000 n 
-0002064281 00000 n 
-0002064525 00000 n 
-0002064736 00000 n 
-0002064982 00000 n 
-0002065194 00000 n 
-0002065381 00000 n 
-0002065627 00000 n 
-0002065814 00000 n 
-0002066059 00000 n 
-0002066270 00000 n 
-0002066516 00000 n 
-0002066727 00000 n 
-0002066973 00000 n 
-0002067217 00000 n 
-0002067428 00000 n 
-0002067673 00000 n 
-0002071744 00000 n 
-0002067884 00000 n 
-0002069231 00000 n 
-0002063265 00000 n 
-0002061460 00000 n 
-0002068049 00000 n 
-0002068107 00000 n 
-0002068225 00000 n 
-0002068348 00000 n 
-0002068407 00000 n 
-0002068583 00000 n 
-0002068642 00000 n 
-0002068701 00000 n 
-0002068760 00000 n 
-0002068819 00000 n 
-0002068878 00000 n 
-0002068937 00000 n 
-0002068996 00000 n 
-0002069055 00000 n 
-0002069113 00000 n 
-0002069172 00000 n 
-0002072133 00000 n 
-0002072356 00000 n 
-0002072546 00000 n 
-0002072769 00000 n 
-0002072958 00000 n 
-0002073180 00000 n 
-0002073370 00000 n 
-0002073592 00000 n 
-0002073782 00000 n 
-0002073971 00000 n 
-0002074191 00000 n 
-0002074380 00000 n 
-0002074601 00000 n 
-0002074791 00000 n 
-0002074981 00000 n 
-0002075202 00000 n 
-0002075391 00000 n 
-0002075580 00000 n 
-0002075768 00000 n 
-0002075988 00000 n 
-0002076176 00000 n 
-0002076364 00000 n 
-0002079741 00000 n 
-0002079965 00000 n 
-0002080154 00000 n 
-0002080344 00000 n 
-0002080534 00000 n 
-0002080724 00000 n 
-0002080914 00000 n 
-0002081136 00000 n 
-0002081326 00000 n 
-0002081516 00000 n 
-0002076552 00000 n 
-0002077008 00000 n 
-0002071384 00000 n 
-0002069454 00000 n 
-0002076717 00000 n 
-0002076775 00000 n 
-0002071939 00000 n 
-0002076949 00000 n 
-0002087245 00000 n 
-0002087363 00000 n 
-0002087481 00000 n 
-0002087598 00000 n 
-0002087716 00000 n 
-0002087833 00000 n 
-0002087951 00000 n 
-0002090910 00000 n 
-0002081705 00000 n 
-0002081927 00000 n 
-0002082117 00000 n 
-0002082307 00000 n 
-0002082497 00000 n 
-0002082719 00000 n 
-0002082909 00000 n 
-0002083099 00000 n 
-0002083288 00000 n 
-0002083510 00000 n 
-0002083700 00000 n 
-0002083890 00000 n 
-0002084112 00000 n 
-0002084302 00000 n 
-0002084492 00000 n 
-0002084714 00000 n 
-0002084904 00000 n 
-0002085094 00000 n 
-0002085284 00000 n 
-0002085506 00000 n 
-0002085696 00000 n 
-0002085886 00000 n 
-0002086110 00000 n 
-0002086300 00000 n 
-0002086490 00000 n 
-0002086679 00000 n 
-0002086845 00000 n 
-0002088009 00000 n 
-0002079273 00000 n 
-0002077202 00000 n 
-0002087010 00000 n 
-0002087068 00000 n 
-0002087127 00000 n 
-0002087186 00000 n 
-0002087304 00000 n 
-0002087422 00000 n 
-0002087539 00000 n 
-0002087657 00000 n 
-0002087774 00000 n 
-0002087892 00000 n 
-0002091028 00000 n 
-0002091145 00000 n 
-0002091268 00000 n 
-0002091384 00000 n 
-0002091501 00000 n 
-0002091618 00000 n 
-0002091735 00000 n 
-0002091853 00000 n 
-0002090628 00000 n 
-0002092090 00000 n 
-0002090484 00000 n 
-0002088249 00000 n 
-0002090793 00000 n 
-0002090851 00000 n 
-0002090969 00000 n 
-0002091086 00000 n 
-0002091209 00000 n 
-0002091325 00000 n 
-0002091442 00000 n 
-0002091559 00000 n 
-0002091676 00000 n 
-0002091794 00000 n 
-0002091917 00000 n 
-0004862915 00000 n 
-0002094806 00000 n 
-0002095011 00000 n 
-0002095227 00000 n 
-0002095441 00000 n 
-0002095644 00000 n 
-0002095848 00000 n 
-0002096086 00000 n 
-0002096301 00000 n 
-0002096497 00000 n 
-0002096712 00000 n 
-0002096907 00000 n 
-0002097100 00000 n 
-0002097313 00000 n 
-0002097507 00000 n 
-0002097722 00000 n 
-0002097917 00000 n 
-0002098110 00000 n 
-0002098325 00000 n 
-0002098526 00000 n 
-0002098741 00000 n 
-0002098941 00000 n 
-0002099134 00000 n 
-0002099349 00000 n 
-0002099530 00000 n 
-0002099716 00000 n 
-0002099921 00000 n 
-0002100160 00000 n 
-0002100375 00000 n 
-0002100562 00000 n 
-0002100767 00000 n 
-0002101006 00000 n 
-0002101221 00000 n 
-0002101415 00000 n 
-0002101620 00000 n 
-0002101859 00000 n 
-0002102074 00000 n 
-0002102262 00000 n 
-0002102466 00000 n 
-0002102705 00000 n 
-0002102920 00000 n 
-0002103102 00000 n 
-0002103307 00000 n 
-0002103546 00000 n 
-0002103727 00000 n 
-0002103942 00000 n 
-0002104124 00000 n 
-0002104328 00000 n 
-0002107781 00000 n 
-0002107986 00000 n 
-0002108202 00000 n 
-0002108373 00000 n 
-0002108569 00000 n 
-0002104542 00000 n 
-0002105060 00000 n 
-0002094239 00000 n 
-0002092298 00000 n 
-0002104707 00000 n 
-0002104765 00000 n 
-0002104824 00000 n 
-0002104883 00000 n 
-0002104942 00000 n 
-0002105001 00000 n 
-0002193156 00000 n 
-0002193391 00000 n 
-0002193626 00000 n 
-0002196636 00000 n 
-0002196872 00000 n 
-0002197107 00000 n 
-0002200540 00000 n 
-0002200775 00000 n 
-0002201011 00000 n 
-0002204331 00000 n 
-0002204567 00000 n 
-0002204802 00000 n 
-0002108783 00000 n 
-0002108978 00000 n 
-0002109192 00000 n 
-0002109388 00000 n 
-0002109604 00000 n 
-0002109798 00000 n 
-0002110012 00000 n 
-0002110212 00000 n 
-0002110426 00000 n 
-0002110627 00000 n 
-0002110842 00000 n 
-0002111039 00000 n 
-0002111254 00000 n 
-0002111441 00000 n 
-0002111638 00000 n 
-0002111853 00000 n 
-0002112045 00000 n 
-0002112242 00000 n 
-0002112457 00000 n 
-0002112643 00000 n 
-0002112840 00000 n 
-0002113055 00000 n 
-0002113242 00000 n 
-0002113458 00000 n 
-0002113674 00000 n 
-0002113890 00000 n 
-0002114106 00000 n 
-0002114288 00000 n 
-0002114504 00000 n 
-0002114718 00000 n 
-0002114934 00000 n 
-0002115150 00000 n 
-0002115336 00000 n 
-0002115552 00000 n 
-0002115748 00000 n 
-0002115964 00000 n 
-0002116159 00000 n 
-0002116373 00000 n 
-0002116568 00000 n 
-0002116772 00000 n 
-0002116976 00000 n 
-0002117191 00000 n 
-0002117387 00000 n 
-0002117592 00000 n 
-0002117797 00000 n 
-0002122243 00000 n 
-0002122459 00000 n 
-0002122655 00000 n 
-0002122859 00000 n 
-0002123063 00000 n 
-0002123279 00000 n 
-0002123475 00000 n 
-0002123679 00000 n 
-0002123883 00000 n 
-0002117984 00000 n 
-0002119089 00000 n 
-0002107187 00000 n 
-0002105269 00000 n 
-0002118149 00000 n 
-0002118207 00000 n 
-0002118266 00000 n 
-0002118325 00000 n 
-0002118384 00000 n 
-0002118442 00000 n 
-0002118501 00000 n 
-0002118560 00000 n 
-0002118619 00000 n 
-0002118678 00000 n 
-0002118737 00000 n 
-0002118796 00000 n 
-0002118855 00000 n 
-0002118913 00000 n 
-0002118972 00000 n 
-0002119030 00000 n 
-0002204978 00000 n 
-0002208008 00000 n 
-0002208188 00000 n 
-0002208306 00000 n 
-0002208488 00000 n 
-0002208665 00000 n 
-0002208841 00000 n 
-0002213301 00000 n 
-0002124070 00000 n 
-0002124285 00000 n 
-0002124479 00000 n 
-0002124683 00000 n 
-0002124887 00000 n 
-0002125295 00000 n 
-0002125499 00000 n 
-0002125662 00000 n 
-0002125878 00000 n 
-0002126060 00000 n 
-0002126276 00000 n 
-0002126457 00000 n 
-0002126673 00000 n 
-0002126887 00000 n 
-0002127075 00000 n 
-0002127289 00000 n 
-0002127482 00000 n 
-0002127695 00000 n 
-0002127889 00000 n 
-0002128103 00000 n 
-0002128299 00000 n 
-0002128513 00000 n 
-0002128701 00000 n 
-0002128915 00000 n 
-0002129111 00000 n 
-0002129325 00000 n 
-0002129521 00000 n 
-0002129734 00000 n 
-0002129922 00000 n 
-0002130136 00000 n 
-0002130332 00000 n 
-0002130544 00000 n 
-0002130730 00000 n 
-0002130943 00000 n 
-0002131139 00000 n 
-0002131353 00000 n 
-0002131554 00000 n 
-0002131768 00000 n 
-0002131969 00000 n 
-0002132183 00000 n 
-0002132369 00000 n 
-0002132534 00000 n 
-0002132745 00000 n 
-0002132934 00000 n 
-0002133099 00000 n 
-0002133311 00000 n 
-0002137867 00000 n 
-0002138081 00000 n 
-0002138262 00000 n 
-0002138478 00000 n 
-0002133491 00000 n 
-0002133714 00000 n 
-0002121595 00000 n 
-0002119272 00000 n 
-0002133656 00000 n 
-0002125090 00000 n 
-0002213542 00000 n 
-0002217971 00000 n 
-0002218212 00000 n 
-0002218453 00000 n 
-0002221734 00000 n 
-0002221911 00000 n 
-0002222088 00000 n 
-0002222269 00000 n 
-0002222445 00000 n 
-0002225464 00000 n 
-0002225700 00000 n 
-0002225935 00000 n 
-0002228892 00000 n 
-0002229126 00000 n 
-0002229361 00000 n 
-0002232459 00000 n 
-0002232695 00000 n 
-0002232930 00000 n 
-0002233166 00000 n 
-0002236788 00000 n 
-0002237024 00000 n 
-0002237259 00000 n 
-0002138659 00000 n 
-0002138873 00000 n 
-0002139053 00000 n 
-0002139231 00000 n 
-0002139446 00000 n 
-0002139627 00000 n 
-0002139807 00000 n 
-0002140022 00000 n 
-0002140208 00000 n 
-0002140404 00000 n 
-0002140616 00000 n 
-0002140792 00000 n 
-0002141008 00000 n 
-0002141194 00000 n 
-0002141390 00000 n 
-0002141597 00000 n 
-0002141773 00000 n 
-0002141989 00000 n 
-0002142175 00000 n 
-0002142380 00000 n 
-0002142576 00000 n 
-0002142788 00000 n 
-0002142998 00000 n 
-0002143170 00000 n 
-0002143386 00000 n 
-0002143572 00000 n 
-0002143777 00000 n 
-0002143972 00000 n 
-0002144184 00000 n 
-0002144394 00000 n 
-0002144565 00000 n 
-0002144781 00000 n 
-0002144977 00000 n 
-0002145182 00000 n 
-0002145378 00000 n 
-0002145590 00000 n 
-0002145762 00000 n 
-0002145978 00000 n 
-0002146174 00000 n 
-0002146379 00000 n 
-0002146575 00000 n 
-0002146787 00000 n 
-0002146958 00000 n 
-0002147174 00000 n 
-0002147359 00000 n 
-0002147555 00000 n 
-0002147947 00000 n 
-0002148159 00000 n 
-0002148347 00000 n 
-0002148563 00000 n 
-0002148749 00000 n 
-0002148945 00000 n 
-0002149337 00000 n 
-0002149549 00000 n 
-0002149737 00000 n 
-0002149950 00000 n 
-0002150132 00000 n 
-0002150298 00000 n 
-0002150513 00000 n 
-0002150704 00000 n 
-0002150908 00000 n 
-0002151317 00000 n 
-0002151522 00000 n 
-0002151718 00000 n 
-0002151885 00000 n 
-0002152099 00000 n 
-0002152303 00000 n 
-0002152542 00000 n 
-0002152756 00000 n 
-0002152946 00000 n 
-0002153149 00000 n 
-0002157062 00000 n 
-0002153386 00000 n 
-0002153609 00000 n 
-0002137021 00000 n 
-0002133883 00000 n 
-0002153551 00000 n 
-0002147751 00000 n 
-0002149141 00000 n 
-0002151112 00000 n 
-0002237436 00000 n 
-0002237613 00000 n 
-0002242114 00000 n 
-0002242291 00000 n 
-0002242467 00000 n 
-0002242703 00000 n 
-0002246773 00000 n 
-0002247012 00000 n 
-0002251610 00000 n 
-0002251853 00000 n 
-0002252095 00000 n 
-0002257009 00000 n 
-0002257252 00000 n 
-0002257433 00000 n 
-0002262707 00000 n 
-0002262888 00000 n 
-0002157276 00000 n 
-0002157490 00000 n 
-0002157671 00000 n 
-0002157834 00000 n 
-0002158047 00000 n 
-0002158229 00000 n 
-0002158390 00000 n 
-0002158603 00000 n 
-0002158785 00000 n 
-0002158948 00000 n 
-0002159163 00000 n 
-0002159344 00000 n 
-0002159539 00000 n 
-0002159701 00000 n 
-0002159917 00000 n 
-0002160099 00000 n 
-0002160295 00000 n 
-0002160458 00000 n 
-0002160673 00000 n 
-0002160855 00000 n 
-0002161051 00000 n 
-0002161213 00000 n 
-0002161427 00000 n 
-0002161632 00000 n 
-0002161823 00000 n 
-0002162036 00000 n 
-0002162239 00000 n 
-0002162430 00000 n 
-0002162644 00000 n 
-0002162825 00000 n 
-0002162996 00000 n 
-0002163209 00000 n 
-0002163401 00000 n 
-0002163614 00000 n 
-0002163818 00000 n 
-0002164197 00000 n 
-0002164411 00000 n 
-0002164603 00000 n 
-0002164816 00000 n 
-0002165001 00000 n 
-0002165205 00000 n 
-0002165418 00000 n 
-0002165610 00000 n 
-0002165794 00000 n 
-0002166010 00000 n 
-0002166223 00000 n 
-0002166404 00000 n 
-0002169606 00000 n 
-0002169820 00000 n 
-0002170034 00000 n 
-0002166617 00000 n 
-0002167076 00000 n 
-0002156477 00000 n 
-0002153832 00000 n 
-0002166782 00000 n 
-0002166840 00000 n 
-0002164009 00000 n 
-0002166899 00000 n 
-0002166958 00000 n 
-0002167017 00000 n 
-0002263070 00000 n 
-0002267527 00000 n 
-0002267768 00000 n 
-0002268011 00000 n 
-0002272707 00000 n 
-0002272950 00000 n 
-0002273191 00000 n 
-0002278026 00000 n 
-0002278269 00000 n 
-0002278450 00000 n 
-0002278693 00000 n 
-0002284113 00000 n 
-0002284294 00000 n 
-0002289711 00000 n 
-0002170250 00000 n 
-0002170466 00000 n 
-0002170671 00000 n 
-0002170885 00000 n 
-0002171090 00000 n 
-0002171304 00000 n 
-0002171520 00000 n 
-0002171725 00000 n 
-0002171941 00000 n 
-0002172123 00000 n 
-0002172339 00000 n 
-0002172555 00000 n 
-0002172771 00000 n 
-0002172952 00000 n 
-0002173168 00000 n 
-0002173350 00000 n 
-0002173532 00000 n 
-0002173747 00000 n 
-0002173929 00000 n 
-0002174111 00000 n 
-0002174327 00000 n 
-0002174508 00000 n 
-0002174690 00000 n 
-0002174905 00000 n 
-0002175085 00000 n 
-0002175266 00000 n 
-0002175482 00000 n 
-0002175664 00000 n 
-0002175846 00000 n 
-0002179729 00000 n 
-0002176027 00000 n 
-0002176896 00000 n 
-0002169174 00000 n 
-0002167272 00000 n 
-0002176192 00000 n 
-0002176250 00000 n 
-0002176309 00000 n 
-0002176368 00000 n 
-0002176426 00000 n 
-0002176485 00000 n 
-0002176544 00000 n 
-0002176602 00000 n 
-0002176660 00000 n 
-0002176719 00000 n 
-0002176778 00000 n 
-0002176837 00000 n 
-0004863041 00000 n 
-0002289958 00000 n 
-0002290145 00000 n 
-0002290266 00000 n 
-0002290392 00000 n 
-0002290513 00000 n 
-0002179897 00000 n 
-0002180068 00000 n 
-0002180284 00000 n 
-0002180500 00000 n 
-0002183578 00000 n 
-0002180716 00000 n 
-0002180939 00000 n 
-0002179540 00000 n 
-0002177105 00000 n 
-0002180881 00000 n 
-0002183793 00000 n 
-0002184009 00000 n 
-0002184225 00000 n 
-0002184441 00000 n 
-0002184657 00000 n 
-0002184896 00000 n 
-0002185112 00000 n 
-0002188443 00000 n 
-0002188659 00000 n 
-0002185328 00000 n 
-0002185551 00000 n 
-0002183362 00000 n 
-0002181143 00000 n 
-0002185493 00000 n 
-0002188898 00000 n 
-0002189114 00000 n 
-0002189353 00000 n 
-0002189569 00000 n 
-0002189792 00000 n 
-0002188254 00000 n 
-0002185766 00000 n 
-0002189734 00000 n 
-0002192874 00000 n 
-0002193744 00000 n 
-0002192730 00000 n 
-0002189995 00000 n 
-0002193039 00000 n 
-0002193097 00000 n 
-0002193215 00000 n 
-0002193274 00000 n 
-0002193333 00000 n 
-0002193449 00000 n 
-0002193508 00000 n 
-0002193567 00000 n 
-0002193685 00000 n 
-0002196295 00000 n 
-0002197284 00000 n 
-0002196151 00000 n 
-0002193987 00000 n 
-0002196460 00000 n 
-0002196518 00000 n 
-0002196577 00000 n 
-0002196695 00000 n 
-0002196754 00000 n 
-0002196813 00000 n 
-0002196930 00000 n 
-0002196989 00000 n 
-0002197048 00000 n 
-0002197166 00000 n 
-0002197225 00000 n 
-0002200258 00000 n 
-0002201188 00000 n 
-0002200114 00000 n 
-0002197452 00000 n 
-0002200423 00000 n 
-0002200481 00000 n 
-0002200599 00000 n 
-0002200658 00000 n 
-0002200716 00000 n 
-0002200834 00000 n 
-0002200893 00000 n 
-0002200952 00000 n 
-0002201070 00000 n 
-0002201129 00000 n 
-0004863167 00000 n 
-0002204049 00000 n 
-0002205096 00000 n 
-0002203905 00000 n 
-0002201369 00000 n 
-0002204214 00000 n 
-0002204272 00000 n 
-0002204390 00000 n 
-0002204449 00000 n 
-0002204508 00000 n 
-0002204625 00000 n 
-0002204684 00000 n 
-0002204743 00000 n 
-0002204861 00000 n 
-0002204920 00000 n 
-0002205037 00000 n 
-0002207785 00000 n 
-0002208959 00000 n 
-0002207641 00000 n 
-0002205290 00000 n 
-0002207950 00000 n 
-0002208071 00000 n 
-0002208129 00000 n 
-0002208247 00000 n 
-0002208370 00000 n 
-0002208429 00000 n 
-0002208547 00000 n 
-0002208606 00000 n 
-0002208723 00000 n 
-0002208782 00000 n 
-0002208900 00000 n 
-0002212397 00000 n 
-0002212585 00000 n 
-0002212773 00000 n 
-0002212960 00000 n 
-0002213724 00000 n 
-0002212226 00000 n 
-0002209140 00000 n 
-0002213125 00000 n 
-0002213183 00000 n 
-0002213242 00000 n 
-0002213365 00000 n 
-0002213424 00000 n 
-0002213483 00000 n 
-0002213606 00000 n 
-0002213665 00000 n 
-0002217337 00000 n 
-0002217525 00000 n 
-0002217689 00000 n 
-0002218574 00000 n 
-0002217175 00000 n 
-0002213905 00000 n 
-0002217854 00000 n 
-0002217912 00000 n 
-0002218035 00000 n 
-0002218094 00000 n 
-0002218153 00000 n 
-0002218276 00000 n 
-0002218335 00000 n 
-0002218394 00000 n 
-0002218516 00000 n 
-0002221452 00000 n 
-0002222561 00000 n 
-0002221308 00000 n 
-0002218755 00000 n 
-0002221617 00000 n 
-0002221675 00000 n 
-0002221793 00000 n 
-0002221852 00000 n 
-0002221970 00000 n 
-0002222029 00000 n 
-0002222152 00000 n 
-0002222211 00000 n 
-0002222327 00000 n 
-0002222386 00000 n 
-0002222503 00000 n 
-0002225123 00000 n 
-0002226053 00000 n 
-0002224979 00000 n 
-0002222742 00000 n 
-0002225288 00000 n 
-0002225346 00000 n 
-0002225405 00000 n 
-0002225523 00000 n 
-0002225582 00000 n 
-0002225641 00000 n 
-0002225759 00000 n 
-0002225818 00000 n 
-0002225877 00000 n 
-0002225994 00000 n 
-0004863293 00000 n 
-0002228551 00000 n 
-0002229537 00000 n 
-0002228407 00000 n 
-0002226234 00000 n 
-0002228716 00000 n 
-0002228774 00000 n 
-0002228833 00000 n 
-0002228949 00000 n 
-0002229008 00000 n 
-0002229067 00000 n 
-0002229185 00000 n 
-0002229244 00000 n 
-0002229303 00000 n 
-0002229419 00000 n 
-0002229478 00000 n 
-0002232177 00000 n 
-0002233343 00000 n 
-0002232033 00000 n 
-0002229718 00000 n 
-0002232342 00000 n 
-0002232400 00000 n 
-0002232518 00000 n 
-0002232577 00000 n 
-0002232636 00000 n 
-0002232754 00000 n 
-0002232813 00000 n 
-0002232871 00000 n 
-0002232989 00000 n 
-0002233048 00000 n 
-0002233107 00000 n 
-0002233225 00000 n 
-0002233284 00000 n 
-0002235990 00000 n 
-0002236154 00000 n 
-0002236320 00000 n 
-0002236506 00000 n 
-0002237729 00000 n 
-0002235819 00000 n 
-0002233524 00000 n 
-0002236671 00000 n 
-0002236729 00000 n 
-0002236847 00000 n 
-0002236906 00000 n 
-0002236965 00000 n 
-0002237083 00000 n 
-0002237141 00000 n 
-0002237200 00000 n 
-0002237318 00000 n 
-0002237377 00000 n 
-0002237495 00000 n 
-0002237554 00000 n 
-0002237671 00000 n 
-0002241125 00000 n 
-0002241302 00000 n 
-0002241482 00000 n 
-0002241657 00000 n 
-0002241832 00000 n 
-0002242820 00000 n 
-0002240945 00000 n 
-0002237910 00000 n 
-0002241997 00000 n 
-0002242055 00000 n 
-0002242173 00000 n 
-0002242232 00000 n 
-0002242350 00000 n 
-0002242408 00000 n 
-0002242526 00000 n 
-0002242585 00000 n 
-0002242644 00000 n 
-0002242761 00000 n 
-0002246089 00000 n 
-0002246259 00000 n 
-0002246431 00000 n 
-0002247190 00000 n 
-0002245927 00000 n 
-0002243001 00000 n 
-0002246596 00000 n 
-0002246654 00000 n 
-0002246713 00000 n 
-0002246832 00000 n 
-0002246892 00000 n 
-0002246952 00000 n 
-0002247070 00000 n 
-0002247130 00000 n 
-0002250790 00000 n 
-0002250963 00000 n 
-0002251134 00000 n 
-0002251323 00000 n 
-0002252277 00000 n 
-0002250611 00000 n 
-0002247408 00000 n 
-0002251489 00000 n 
-0002251549 00000 n 
-0002251670 00000 n 
-0002251731 00000 n 
-0002251792 00000 n 
-0002251913 00000 n 
-0002251974 00000 n 
-0002252034 00000 n 
-0002252155 00000 n 
-0002252216 00000 n 
-0004863419 00000 n 
-0002256013 00000 n 
-0002256202 00000 n 
-0002256369 00000 n 
-0002256536 00000 n 
-0002261295 00000 n 
-0002261512 00000 n 
-0002261680 00000 n 
-0002256722 00000 n 
-0002257615 00000 n 
-0002255824 00000 n 
-0002252496 00000 n 
-0002256888 00000 n 
-0002256948 00000 n 
-0002257069 00000 n 
-0002257130 00000 n 
-0002257191 00000 n 
-0002257312 00000 n 
-0002257372 00000 n 
-0002257493 00000 n 
-0002257554 00000 n 
-0002261896 00000 n 
-0002262083 00000 n 
-0002262246 00000 n 
-0002262420 00000 n 
-0002263252 00000 n 
-0002261086 00000 n 
-0002257834 00000 n 
-0002262586 00000 n 
-0002262646 00000 n 
-0002262767 00000 n 
-0002262827 00000 n 
-0002262948 00000 n 
-0002263009 00000 n 
-0002263130 00000 n 
-0002263191 00000 n 
-0002266222 00000 n 
-0002266386 00000 n 
-0002266561 00000 n 
-0002266725 00000 n 
-0002266901 00000 n 
-0002267064 00000 n 
-0002267240 00000 n 
-0002268193 00000 n 
-0002266013 00000 n 
-0002263434 00000 n 
-0002267406 00000 n 
-0002267466 00000 n 
-0002267587 00000 n 
-0002267648 00000 n 
-0002267707 00000 n 
-0002267828 00000 n 
-0002267889 00000 n 
-0002267950 00000 n 
-0002268071 00000 n 
-0002268132 00000 n 
-0002271335 00000 n 
-0002271499 00000 n 
-0002271675 00000 n 
-0002271838 00000 n 
-0002272014 00000 n 
-0002272205 00000 n 
-0002272420 00000 n 
-0002273433 00000 n 
-0002271126 00000 n 
-0002268375 00000 n 
-0002272586 00000 n 
-0002272646 00000 n 
-0002272767 00000 n 
-0002272828 00000 n 
-0002272889 00000 n 
-0002273010 00000 n 
-0002273071 00000 n 
-0002273132 00000 n 
-0002273250 00000 n 
-0002273311 00000 n 
-0002273372 00000 n 
-0002276630 00000 n 
-0002276821 00000 n 
-0002277037 00000 n 
-0002277211 00000 n 
-0002277427 00000 n 
-0002277613 00000 n 
-0002282445 00000 n 
-0002277800 00000 n 
-0002278812 00000 n 
-0002276421 00000 n 
-0002273615 00000 n 
-0002277966 00000 n 
-0002278086 00000 n 
-0002278147 00000 n 
-0002278208 00000 n 
-0002278329 00000 n 
-0002278390 00000 n 
-0002278510 00000 n 
-0002278571 00000 n 
-0002278632 00000 n 
-0002278752 00000 n 
-0002282827 00000 n 
-0002283019 00000 n 
-0002283223 00000 n 
-0002283429 00000 n 
-0002283634 00000 n 
-0002283826 00000 n 
-0002284481 00000 n 
-0002282226 00000 n 
-0002279056 00000 n 
-0002283992 00000 n 
-0002282637 00000 n 
-0002284052 00000 n 
-0002284173 00000 n 
-0002284233 00000 n 
-0002284359 00000 n 
-0002284420 00000 n 
-0004863552 00000 n 
-0002288217 00000 n 
-0002288433 00000 n 
-0002288649 00000 n 
-0002288835 00000 n 
-0002289208 00000 n 
-0002289424 00000 n 
-0002290637 00000 n 
-0002288008 00000 n 
-0002284688 00000 n 
-0002289590 00000 n 
-0002289650 00000 n 
-0002289775 00000 n 
-0002289836 00000 n 
-0002289897 00000 n 
-0002289021 00000 n 
-0002290023 00000 n 
-0002290084 00000 n 
-0002290205 00000 n 
-0002290331 00000 n 
-0002290452 00000 n 
-0002290577 00000 n 
-0002293004 00000 n 
-0002293187 00000 n 
-0002293395 00000 n 
-0002293578 00000 n 
-0002293805 00000 n 
-0002294034 00000 n 
-0002294216 00000 n 
-0002294445 00000 n 
-0002294641 00000 n 
-0002294870 00000 n 
-0002295100 00000 n 
-0002295296 00000 n 
-0002295526 00000 n 
-0002295709 00000 n 
-0002295892 00000 n 
-0002296085 00000 n 
-0002296264 00000 n 
-0002297214 00000 n 
-0002292695 00000 n 
-0002290844 00000 n 
-0002296430 00000 n 
-0002296490 00000 n 
-0002296551 00000 n 
-0002296731 00000 n 
-0002296790 00000 n 
-0002296851 00000 n 
-0002296912 00000 n 
-0002296973 00000 n 
-0002297034 00000 n 
-0002297095 00000 n 
-0002297154 00000 n 
-0002307284 00000 n 
-0002299843 00000 n 
-0002300071 00000 n 
-0002300265 00000 n 
-0002300493 00000 n 
-0002300754 00000 n 
-0002301015 00000 n 
-0002301275 00000 n 
-0002301470 00000 n 
-0002301697 00000 n 
-0002301924 00000 n 
-0002302130 00000 n 
-0002302358 00000 n 
-0002302585 00000 n 
-0002302779 00000 n 
-0002303006 00000 n 
-0002303200 00000 n 
-0002303405 00000 n 
-0002303632 00000 n 
-0002303826 00000 n 
-0002304031 00000 n 
-0002304258 00000 n 
-0002304452 00000 n 
-0002304657 00000 n 
-0002304862 00000 n 
-0002305089 00000 n 
-0002305281 00000 n 
-0002305508 00000 n 
-0002305701 00000 n 
-0002305906 00000 n 
-0002306134 00000 n 
-0002306362 00000 n 
-0002306568 00000 n 
-0002306771 00000 n 
-0002310942 00000 n 
-0002311169 00000 n 
-0002311374 00000 n 
-0002311601 00000 n 
-0002311788 00000 n 
-0002306997 00000 n 
-0002308132 00000 n 
-0002299364 00000 n 
-0002297438 00000 n 
-0002307163 00000 n 
-0002307223 00000 n 
-0002307345 00000 n 
-0002307525 00000 n 
-0002307586 00000 n 
-0002307647 00000 n 
-0002307708 00000 n 
-0002307769 00000 n 
-0002307830 00000 n 
-0002307890 00000 n 
-0002307950 00000 n 
-0002308011 00000 n 
-0002308072 00000 n 
-0004430060 00000 n 
-0002378756 00000 n 
-0002378878 00000 n 
-0002378944 00000 n 
-0002379010 00000 n 
-0002378573 00000 n 
-0002393958 00000 n 
-0002379137 00000 n 
-0002379259 00000 n 
-0002311975 00000 n 
-0002312202 00000 n 
-0002312394 00000 n 
-0002312622 00000 n 
-0002312808 00000 n 
-0002313034 00000 n 
-0002313221 00000 n 
-0002313427 00000 n 
-0002313654 00000 n 
-0002313882 00000 n 
-0002314110 00000 n 
-0002314338 00000 n 
-0002314566 00000 n 
-0002314794 00000 n 
-0002315022 00000 n 
-0002315250 00000 n 
-0002315437 00000 n 
-0002315665 00000 n 
-0002315869 00000 n 
-0002316096 00000 n 
-0002316301 00000 n 
-0002316529 00000 n 
-0002316757 00000 n 
-0002316951 00000 n 
-0002317178 00000 n 
-0002317371 00000 n 
-0002317599 00000 n 
-0002317824 00000 n 
-0002318052 00000 n 
-0002318280 00000 n 
-0002318507 00000 n 
-0002318735 00000 n 
-0002318962 00000 n 
-0002319188 00000 n 
-0002323291 00000 n 
-0002319380 00000 n 
-0002320641 00000 n 
-0002310403 00000 n 
-0002308380 00000 n 
-0002319546 00000 n 
-0002319606 00000 n 
-0002319667 00000 n 
-0002319728 00000 n 
-0002319789 00000 n 
-0002319850 00000 n 
-0002319911 00000 n 
-0002319971 00000 n 
-0002320032 00000 n 
-0002320093 00000 n 
-0002320154 00000 n 
-0002320215 00000 n 
-0002320276 00000 n 
-0002320337 00000 n 
-0002320398 00000 n 
-0002320459 00000 n 
-0002320520 00000 n 
-0002320581 00000 n 
-0002384194 00000 n 
-0002384316 00000 n 
-0002384443 00000 n 
-0002384569 00000 n 
-0002384757 00000 n 
-0002384940 00000 n 
-0002389013 00000 n 
-0002323519 00000 n 
-0002323747 00000 n 
-0002323975 00000 n 
-0002324202 00000 n 
-0002324395 00000 n 
-0002324620 00000 n 
-0002324816 00000 n 
-0002325021 00000 n 
-0002325247 00000 n 
-0002325440 00000 n 
-0002325665 00000 n 
-0002325861 00000 n 
-0002326091 00000 n 
-0002326304 00000 n 
-0002326510 00000 n 
-0002326738 00000 n 
-0002326932 00000 n 
-0002327160 00000 n 
-0002327366 00000 n 
-0002327597 00000 n 
-0002327789 00000 n 
-0002328015 00000 n 
-0002328210 00000 n 
-0002328414 00000 n 
-0002328608 00000 n 
-0002328834 00000 n 
-0002329031 00000 n 
-0002329262 00000 n 
-0002329475 00000 n 
-0002329681 00000 n 
-0002329909 00000 n 
-0002330103 00000 n 
-0002330331 00000 n 
-0002330537 00000 n 
-0002330731 00000 n 
-0002330959 00000 n 
-0002331156 00000 n 
-0002331360 00000 n 
-0002331566 00000 n 
-0002331794 00000 n 
-0002331988 00000 n 
-0002332216 00000 n 
-0002332444 00000 n 
-0002332638 00000 n 
-0002332866 00000 n 
-0002333071 00000 n 
-0002333298 00000 n 
-0002333537 00000 n 
-0002333765 00000 n 
-0002333959 00000 n 
-0002334185 00000 n 
-0002334377 00000 n 
-0002338573 00000 n 
-0002338765 00000 n 
-0002338992 00000 n 
-0002339188 00000 n 
-0002339393 00000 n 
-0002339847 00000 n 
-0002334569 00000 n 
-0002335465 00000 n 
-0002322612 00000 n 
-0002320852 00000 n 
-0002334735 00000 n 
-0002334795 00000 n 
-0002334856 00000 n 
-0002334916 00000 n 
-0002334977 00000 n 
-0002335038 00000 n 
-0002335099 00000 n 
-0002335160 00000 n 
-0002335221 00000 n 
-0002335282 00000 n 
-0002335343 00000 n 
-0002335404 00000 n 
-0002389140 00000 n 
-0002389267 00000 n 
-0002389453 00000 n 
-0002379445 00000 n 
-0002379628 00000 n 
-0002384011 00000 n 
-0002389636 00000 n 
-0002389758 00000 n 
-0002340075 00000 n 
-0002340268 00000 n 
-0002340495 00000 n 
-0002340692 00000 n 
-0002340923 00000 n 
-0002341135 00000 n 
-0002341340 00000 n 
-0002341568 00000 n 
-0002342024 00000 n 
-0002342217 00000 n 
-0002342445 00000 n 
-0002342650 00000 n 
-0002342878 00000 n 
-0002343071 00000 n 
-0002343299 00000 n 
-0002343496 00000 n 
-0002343702 00000 n 
-0002343930 00000 n 
-0002344123 00000 n 
-0002344351 00000 n 
-0002344548 00000 n 
-0002344779 00000 n 
-0002344990 00000 n 
-0002345194 00000 n 
-0002345421 00000 n 
-0002345877 00000 n 
-0002346070 00000 n 
-0002346297 00000 n 
-0002346503 00000 n 
-0002346731 00000 n 
-0002346924 00000 n 
-0002347151 00000 n 
-0002347348 00000 n 
-0002347554 00000 n 
-0002347782 00000 n 
-0002348009 00000 n 
-0002348203 00000 n 
-0002348397 00000 n 
-0002348625 00000 n 
-0002348819 00000 n 
-0002349012 00000 n 
-0002349240 00000 n 
-0002349468 00000 n 
-0002349695 00000 n 
-0002349889 00000 n 
-0002350083 00000 n 
-0002350311 00000 n 
-0002350505 00000 n 
-0002350698 00000 n 
-0002350891 00000 n 
-0002351119 00000 n 
-0002351316 00000 n 
-0002351522 00000 n 
-0002351715 00000 n 
-0002351942 00000 n 
-0002352139 00000 n 
-0002352548 00000 n 
-0002352741 00000 n 
-0002352969 00000 n 
-0002353174 00000 n 
-0002353367 00000 n 
-0002353595 00000 n 
-0002353792 00000 n 
-0002353998 00000 n 
-0002354191 00000 n 
-0002354419 00000 n 
-0002354616 00000 n 
-0002355027 00000 n 
-0002355220 00000 n 
-0002355447 00000 n 
-0002355653 00000 n 
-0002355846 00000 n 
-0002356073 00000 n 
-0002356270 00000 n 
-0002356476 00000 n 
-0002356704 00000 n 
-0002356898 00000 n 
-0002357092 00000 n 
-0002357285 00000 n 
-0002357876 00000 n 
-0002337534 00000 n 
-0002335688 00000 n 
-0002357451 00000 n 
-0002357511 00000 n 
-0002339620 00000 n 
-0002357572 00000 n 
-0002341796 00000 n 
-0002357633 00000 n 
-0002357694 00000 n 
-0002345649 00000 n 
-0002357754 00000 n 
-0002352345 00000 n 
-0002354822 00000 n 
-0002357815 00000 n 
-0004863685 00000 n 
-0002389880 00000 n 
-0002390000 00000 n 
-0002390122 00000 n 
-0002392863 00000 n 
-0002392985 00000 n 
-0002393228 00000 n 
-0002393350 00000 n 
-0002393592 00000 n 
-0002361200 00000 n 
-0002361428 00000 n 
-0002361656 00000 n 
-0002361884 00000 n 
-0002362112 00000 n 
-0002362340 00000 n 
-0002362568 00000 n 
-0002362796 00000 n 
-0002363024 00000 n 
-0002363252 00000 n 
-0002363480 00000 n 
-0002363707 00000 n 
-0002363934 00000 n 
-0002364162 00000 n 
-0002364390 00000 n 
-0002364618 00000 n 
-0002364846 00000 n 
-0002365073 00000 n 
-0002369330 00000 n 
-0002369557 00000 n 
-0002369784 00000 n 
-0002370011 00000 n 
-0002370238 00000 n 
-0002370465 00000 n 
-0002365300 00000 n 
-0002365526 00000 n 
-0002360871 00000 n 
-0002358159 00000 n 
-0002365466 00000 n 
-0002370692 00000 n 
-0002370920 00000 n 
-0002371148 00000 n 
-0002371376 00000 n 
-0002371604 00000 n 
-0002371831 00000 n 
-0002372058 00000 n 
-0002372286 00000 n 
-0002372514 00000 n 
-0002372720 00000 n 
-0002372948 00000 n 
-0002373176 00000 n 
-0002373404 00000 n 
-0002373632 00000 n 
-0002373860 00000 n 
-0002374086 00000 n 
-0002368981 00000 n 
-0002365820 00000 n 
-0002374026 00000 n 
-0002377033 00000 n 
-0002377261 00000 n 
-0002377456 00000 n 
-0002377649 00000 n 
-0002377842 00000 n 
-0002378073 00000 n 
-0002378286 00000 n 
-0002379750 00000 n 
-0002376824 00000 n 
-0002374356 00000 n 
-0002378452 00000 n 
-0002378512 00000 n 
-0002378634 00000 n 
-0002378695 00000 n 
-0002378817 00000 n 
-0002379076 00000 n 
-0002379198 00000 n 
-0002379324 00000 n 
-0002379384 00000 n 
-0002379506 00000 n 
-0002379567 00000 n 
-0002379689 00000 n 
-0002383093 00000 n 
-0002383324 00000 n 
-0002383537 00000 n 
-0002383724 00000 n 
-0002385060 00000 n 
-0002382914 00000 n 
-0002379947 00000 n 
-0002383890 00000 n 
-0002383950 00000 n 
-0002384072 00000 n 
-0002384133 00000 n 
-0002384255 00000 n 
-0002384382 00000 n 
-0002384508 00000 n 
-0002384635 00000 n 
-0002384696 00000 n 
-0002384818 00000 n 
-0002384879 00000 n 
-0002385000 00000 n 
-0002388107 00000 n 
-0002388335 00000 n 
-0002388561 00000 n 
-0002388787 00000 n 
-0002390242 00000 n 
-0002387928 00000 n 
-0002385242 00000 n 
-0002388953 00000 n 
-0002389079 00000 n 
-0002389206 00000 n 
-0002389332 00000 n 
-0002389393 00000 n 
-0002389514 00000 n 
-0002389575 00000 n 
-0002389697 00000 n 
-0002389819 00000 n 
-0002389939 00000 n 
-0002390061 00000 n 
-0002390182 00000 n 
-0002392637 00000 n 
-0002394197 00000 n 
-0002392488 00000 n 
-0002390437 00000 n 
-0002392803 00000 n 
-0002392924 00000 n 
-0002393046 00000 n 
-0002393107 00000 n 
-0002393168 00000 n 
-0002393289 00000 n 
-0002393410 00000 n 
-0002393470 00000 n 
-0002393531 00000 n 
-0002393653 00000 n 
-0002393714 00000 n 
-0002393775 00000 n 
-0002393836 00000 n 
-0002393897 00000 n 
-0002394019 00000 n 
-0004863818 00000 n 
-0002396793 00000 n 
-0002397014 00000 n 
-0002397249 00000 n 
-0002397454 00000 n 
-0002397688 00000 n 
-0002397881 00000 n 
-0002398086 00000 n 
-0002398320 00000 n 
-0002398525 00000 n 
-0002398730 00000 n 
-0002398965 00000 n 
-0002399166 00000 n 
-0002399401 00000 n 
-0002399602 00000 n 
-0002399808 00000 n 
-0002400043 00000 n 
-0002400243 00000 n 
-0002400478 00000 n 
-0002400678 00000 n 
-0002400883 00000 n 
-0002401119 00000 n 
-0002401355 00000 n 
-0002401561 00000 n 
-0002401765 00000 n 
-0002402000 00000 n 
-0002402234 00000 n 
-0002402470 00000 n 
-0002402664 00000 n 
-0002402900 00000 n 
-0002403093 00000 n 
-0002403287 00000 n 
-0002403522 00000 n 
-0002403722 00000 n 
-0002403915 00000 n 
-0002404151 00000 n 
-0002404371 00000 n 
-0002404607 00000 n 
-0002404828 00000 n 
-0002405049 00000 n 
-0002405268 00000 n 
-0002405503 00000 n 
-0002405722 00000 n 
-0002405925 00000 n 
-0002410014 00000 n 
-0002410219 00000 n 
-0002406159 00000 n 
-0002407474 00000 n 
-0002396214 00000 n 
-0002394366 00000 n 
-0002406325 00000 n 
-0002406385 00000 n 
-0002406445 00000 n 
-0002406506 00000 n 
-0002406567 00000 n 
-0002406628 00000 n 
-0002406688 00000 n 
-0002406749 00000 n 
-0002406810 00000 n 
-0002406870 00000 n 
-0002406929 00000 n 
-0002406990 00000 n 
-0002407051 00000 n 
-0002407111 00000 n 
-0002407172 00000 n 
-0002407232 00000 n 
-0002407293 00000 n 
-0002407354 00000 n 
-0002407414 00000 n 
-0002429436 00000 n 
-0002429619 00000 n 
-0002410455 00000 n 
-0002410660 00000 n 
-0002410896 00000 n 
-0002411131 00000 n 
-0002411367 00000 n 
-0002411569 00000 n 
-0002411805 00000 n 
-0002412041 00000 n 
-0002412277 00000 n 
-0002412513 00000 n 
-0002412749 00000 n 
-0002412984 00000 n 
-0002413189 00000 n 
-0002413425 00000 n 
-0002413630 00000 n 
-0002413866 00000 n 
-0002414102 00000 n 
-0002414304 00000 n 
-0002414509 00000 n 
-0002414744 00000 n 
-0002414946 00000 n 
-0002415182 00000 n 
-0002415418 00000 n 
-0002415619 00000 n 
-0002415855 00000 n 
-0002416083 00000 n 
-0002416319 00000 n 
-0002416521 00000 n 
-0002416756 00000 n 
-0002416957 00000 n 
-0002421402 00000 n 
-0002421637 00000 n 
-0002421839 00000 n 
-0002422041 00000 n 
-0002422276 00000 n 
-0002422478 00000 n 
-0002422680 00000 n 
-0002422916 00000 n 
-0002423118 00000 n 
-0002417158 00000 n 
-0002418419 00000 n 
-0002409545 00000 n 
-0002407683 00000 n 
-0002417324 00000 n 
-0002417384 00000 n 
-0002417445 00000 n 
-0002417506 00000 n 
-0002417565 00000 n 
-0002417626 00000 n 
-0002417687 00000 n 
-0002417748 00000 n 
-0002417809 00000 n 
-0002417870 00000 n 
-0002417931 00000 n 
-0002417992 00000 n 
-0002418053 00000 n 
-0002418114 00000 n 
-0002418175 00000 n 
-0002418236 00000 n 
-0002418297 00000 n 
-0002418358 00000 n 
-0002429741 00000 n 
-0002434186 00000 n 
-0002434306 00000 n 
-0002423320 00000 n 
-0002423522 00000 n 
-0002423715 00000 n 
-0002423951 00000 n 
-0002427768 00000 n 
-0002424187 00000 n 
-0002424474 00000 n 
-0002421123 00000 n 
-0002418629 00000 n 
-0002424353 00000 n 
-0002424413 00000 n 
-0002434433 00000 n 
-0002428003 00000 n 
-0002428239 00000 n 
-0002428475 00000 n 
-0002428711 00000 n 
-0002428913 00000 n 
-0002429149 00000 n 
-0002429868 00000 n 
-0002427559 00000 n 
-0002424718 00000 n 
-0002429315 00000 n 
-0002429375 00000 n 
-0002429497 00000 n 
-0002429558 00000 n 
-0002429680 00000 n 
-0002429807 00000 n 
-0002432170 00000 n 
-0002432377 00000 n 
-0002432605 00000 n 
-0002432833 00000 n 
-0002433061 00000 n 
-0002433250 00000 n 
-0002433478 00000 n 
-0002433673 00000 n 
-0002437499 00000 n 
-0002437728 00000 n 
-0002433899 00000 n 
-0002435223 00000 n 
-0002431941 00000 n 
-0002430100 00000 n 
-0002434065 00000 n 
-0002434125 00000 n 
-0002434246 00000 n 
-0002434372 00000 n 
-0002434494 00000 n 
-0002434555 00000 n 
-0002434616 00000 n 
-0002434796 00000 n 
-0002434857 00000 n 
-0002434918 00000 n 
-0002434979 00000 n 
-0002435040 00000 n 
-0002435101 00000 n 
-0002435162 00000 n 
-0002437923 00000 n 
-0002438152 00000 n 
-0002438380 00000 n 
-0002438568 00000 n 
-0002441214 00000 n 
-0002445695 00000 n 
-0002438766 00000 n 
-0002439476 00000 n 
-0002437290 00000 n 
-0002435448 00000 n 
-0002438932 00000 n 
-0002438992 00000 n 
-0002439052 00000 n 
-0002439113 00000 n 
-0002439174 00000 n 
-0002439235 00000 n 
-0002439296 00000 n 
-0004863951 00000 n 
-0002445764 00000 n 
-0002446014 00000 n 
-0002446264 00000 n 
-0002449451 00000 n 
-0002453734 00000 n 
-0002446480 00000 n 
-0002447067 00000 n 
-0002441018 00000 n 
-0002439727 00000 n 
-0002446646 00000 n 
-0002446706 00000 n 
-0002446766 00000 n 
-0002446826 00000 n 
-0002446887 00000 n 
-0002442254 00000 n 
-0002442386 00000 n 
-0002442539 00000 n 
-0002442865 00000 n 
-0002443303 00000 n 
-0002443543 00000 n 
-0002443566 00000 n 
-0002445671 00000 n 
-0002453803 00000 n 
-0002454058 00000 n 
-0002454314 00000 n 
-0002460828 00000 n 
-0002454530 00000 n 
-0002455118 00000 n 
-0002449255 00000 n 
-0002447277 00000 n 
-0002454696 00000 n 
-0002454756 00000 n 
-0002454816 00000 n 
-0002454876 00000 n 
-0002454937 00000 n 
-0002454998 00000 n 
-0002450353 00000 n 
-0002450485 00000 n 
-0002450638 00000 n 
-0002450960 00000 n 
-0002451395 00000 n 
-0002451635 00000 n 
-0002451658 00000 n 
-0002453710 00000 n 
-0002456801 00000 n 
-0002460759 00000 n 
-0002461044 00000 n 
-0002461301 00000 n 
-0002461561 00000 n 
-0002461777 00000 n 
-0002462425 00000 n 
-0002456595 00000 n 
-0002455315 00000 n 
-0002461943 00000 n 
-0002462062 00000 n 
-0002462123 00000 n 
-0002462184 00000 n 
-0002462245 00000 n 
-0002457665 00000 n 
-0002457797 00000 n 
-0002457950 00000 n 
-0002458252 00000 n 
-0002458667 00000 n 
-0002458907 00000 n 
-0002458930 00000 n 
-0002460735 00000 n 
-0002464962 00000 n 
-0002465183 00000 n 
-0002465370 00000 n 
-0002465590 00000 n 
-0002465795 00000 n 
-0002466016 00000 n 
-0002466221 00000 n 
-0002466442 00000 n 
-0002466662 00000 n 
-0002470118 00000 n 
-0002466882 00000 n 
-0002467953 00000 n 
-0002464723 00000 n 
-0002462621 00000 n 
-0002467048 00000 n 
-0002467108 00000 n 
-0002467287 00000 n 
-0002467348 00000 n 
-0002467526 00000 n 
-0002467587 00000 n 
-0002467648 00000 n 
-0002467709 00000 n 
-0002467770 00000 n 
-0002467831 00000 n 
-0002467892 00000 n 
-0002470338 00000 n 
-0002470559 00000 n 
-0002470779 00000 n 
-0002470960 00000 n 
-0002471180 00000 n 
-0002471401 00000 n 
-0002471607 00000 n 
-0002471826 00000 n 
-0002472030 00000 n 
-0002472251 00000 n 
-0002476563 00000 n 
-0002476784 00000 n 
-0002476971 00000 n 
-0002472472 00000 n 
-0002472941 00000 n 
-0002469859 00000 n 
-0002468190 00000 n 
-0002472638 00000 n 
-0002472698 00000 n 
-0002472759 00000 n 
-0002472820 00000 n 
-0002472881 00000 n 
-0002478343 00000 n 
-0002478465 00000 n 
-0002482328 00000 n 
-0002482450 00000 n 
-0002482571 00000 n 
-0002477158 00000 n 
-0002477379 00000 n 
-0002477566 00000 n 
-0002477753 00000 n 
-0002477934 00000 n 
-0002478587 00000 n 
-0002476344 00000 n 
-0002473164 00000 n 
-0002478100 00000 n 
-0002478160 00000 n 
-0002478221 00000 n 
-0002478282 00000 n 
-0002478404 00000 n 
-0002478526 00000 n 
-0004864084 00000 n 
-0002482759 00000 n 
-0002482102 00000 n 
-0002483001 00000 n 
-0002481953 00000 n 
-0002478826 00000 n 
-0002482268 00000 n 
-0002482389 00000 n 
-0002482511 00000 n 
-0002482637 00000 n 
-0002482698 00000 n 
-0002482820 00000 n 
-0002482881 00000 n 
-0002485279 00000 n 
-0002485510 00000 n 
-0002485742 00000 n 
-0002485974 00000 n 
-0002486180 00000 n 
-0002486412 00000 n 
-0002486644 00000 n 
-0002486843 00000 n 
-0002487076 00000 n 
-0002487275 00000 n 
-0002487473 00000 n 
-0002487706 00000 n 
-0002487905 00000 n 
-0002488103 00000 n 
-0002488336 00000 n 
-0002488534 00000 n 
-0002488767 00000 n 
-0002488965 00000 n 
-0002489198 00000 n 
-0002489395 00000 n 
-0002489627 00000 n 
-0002489825 00000 n 
-0002490058 00000 n 
-0002490290 00000 n 
-0002490523 00000 n 
-0002490728 00000 n 
-0002490961 00000 n 
-0002491193 00000 n 
-0002491392 00000 n 
-0002491625 00000 n 
-0002491823 00000 n 
-0002492352 00000 n 
-0002484830 00000 n 
-0002483210 00000 n 
-0002491989 00000 n 
-0002492108 00000 n 
-0002492169 00000 n 
-0002492230 00000 n 
-0002492291 00000 n 
-0002494893 00000 n 
-0002495015 00000 n 
-0002495203 00000 n 
-0002495391 00000 n 
-0002495578 00000 n 
-0002498291 00000 n 
-0002498473 00000 n 
-0002498661 00000 n 
-0002498849 00000 n 
-0002498976 00000 n 
-0002499102 00000 n 
-0002499228 00000 n 
-0002499355 00000 n 
-0002501615 00000 n 
-0002501797 00000 n 
-0002494606 00000 n 
-0002495826 00000 n 
-0002494457 00000 n 
-0002492573 00000 n 
-0002494772 00000 n 
-0002494832 00000 n 
-0002494954 00000 n 
-0002495081 00000 n 
-0002495142 00000 n 
-0002495269 00000 n 
-0002495330 00000 n 
-0002495457 00000 n 
-0002495517 00000 n 
-0002495644 00000 n 
-0002495705 00000 n 
-0002495766 00000 n 
-0002498065 00000 n 
-0002499420 00000 n 
-0002497916 00000 n 
-0002496020 00000 n 
-0002498231 00000 n 
-0002498352 00000 n 
-0002498413 00000 n 
-0002498539 00000 n 
-0002498600 00000 n 
-0002498727 00000 n 
-0002498788 00000 n 
-0002498915 00000 n 
-0002499041 00000 n 
-0002499167 00000 n 
-0002499294 00000 n 
-0002503904 00000 n 
-0002507971 00000 n 
-0002501328 00000 n 
-0002502099 00000 n 
-0002501179 00000 n 
-0002499628 00000 n 
-0002501494 00000 n 
-0002501554 00000 n 
-0002501676 00000 n 
-0002501736 00000 n 
-0002501858 00000 n 
-0002501919 00000 n 
-0002508040 00000 n 
-0002508255 00000 n 
-0002508483 00000 n 
-0002508688 00000 n 
-0002508918 00000 n 
-0002509146 00000 n 
-0002509342 00000 n 
-0002509571 00000 n 
-0002509768 00000 n 
-0002509972 00000 n 
-0002510201 00000 n 
-0002510429 00000 n 
-0002510633 00000 n 
-0002510862 00000 n 
-0002511068 00000 n 
-0002511297 00000 n 
-0002511503 00000 n 
-0002511709 00000 n 
-0002511938 00000 n 
-0002512167 00000 n 
-0002512373 00000 n 
-0002512602 00000 n 
-0002512808 00000 n 
-0002513035 00000 n 
-0002513239 00000 n 
-0002516444 00000 n 
-0002513442 00000 n 
-0002513912 00000 n 
-0002503488 00000 n 
-0002502294 00000 n 
-0002513608 00000 n 
-0002513668 00000 n 
-0002513729 00000 n 
-0002513790 00000 n 
-0002513851 00000 n 
-0004864217 00000 n 
-0002504758 00000 n 
-0002504890 00000 n 
-0002505043 00000 n 
-0002505353 00000 n 
-0002505779 00000 n 
-0002506019 00000 n 
-0002506042 00000 n 
-0002507947 00000 n 
-0002596275 00000 n 
-0002596397 00000 n 
-0002599727 00000 n 
-0002599854 00000 n 
-0002599981 00000 n 
-0002600108 00000 n 
-0002600235 00000 n 
-0002600361 00000 n 
-0002600487 00000 n 
-0002516674 00000 n 
-0002516903 00000 n 
-0002517109 00000 n 
-0002517337 00000 n 
-0002517523 00000 n 
-0002517728 00000 n 
-0002517956 00000 n 
-0002518144 00000 n 
-0002518373 00000 n 
-0002518562 00000 n 
-0002518768 00000 n 
-0002518997 00000 n 
-0002519184 00000 n 
-0002519413 00000 n 
-0002519600 00000 n 
-0002519806 00000 n 
-0002520033 00000 n 
-0002520225 00000 n 
-0002520454 00000 n 
-0002520648 00000 n 
-0002520854 00000 n 
-0002521083 00000 n 
-0002521272 00000 n 
-0002521501 00000 n 
-0002521690 00000 n 
-0002521896 00000 n 
-0002522100 00000 n 
-0002522330 00000 n 
-0002522561 00000 n 
-0002522767 00000 n 
-0002522982 00000 n 
-0002523213 00000 n 
-0002523428 00000 n 
-0002523659 00000 n 
-0002523874 00000 n 
-0002524105 00000 n 
-0002524292 00000 n 
-0002524497 00000 n 
-0002524728 00000 n 
-0002524959 00000 n 
-0002525165 00000 n 
-0002525396 00000 n 
-0002525583 00000 n 
-0002525813 00000 n 
-0002526000 00000 n 
-0002526230 00000 n 
-0002526461 00000 n 
-0002526691 00000 n 
-0002526887 00000 n 
-0002527073 00000 n 
-0002527302 00000 n 
-0002531258 00000 n 
-0002531489 00000 n 
-0002531686 00000 n 
-0002531916 00000 n 
-0002532103 00000 n 
-0002527497 00000 n 
-0002528333 00000 n 
-0002515775 00000 n 
-0002514109 00000 n 
-0002527663 00000 n 
-0002527723 00000 n 
-0002527784 00000 n 
-0002527845 00000 n 
-0002527906 00000 n 
-0002527967 00000 n 
-0002528028 00000 n 
-0002528089 00000 n 
-0002528150 00000 n 
-0002528211 00000 n 
-0002528272 00000 n 
-0002600614 00000 n 
-0002605031 00000 n 
-0002605153 00000 n 
-0002605278 00000 n 
-0002605405 00000 n 
-0002605532 00000 n 
-0002609214 00000 n 
-0002609341 00000 n 
-0002609468 00000 n 
-0002609656 00000 n 
-0002609776 00000 n 
-0002609903 00000 n 
-0002610030 00000 n 
-0002614135 00000 n 
-0002532290 00000 n 
-0002532521 00000 n 
-0002532714 00000 n 
-0002532942 00000 n 
-0002533128 00000 n 
-0002533333 00000 n 
-0002533563 00000 n 
-0002533748 00000 n 
-0002533979 00000 n 
-0002534210 00000 n 
-0002534414 00000 n 
-0002534644 00000 n 
-0002534849 00000 n 
-0002535080 00000 n 
-0002535311 00000 n 
-0002535542 00000 n 
-0002535773 00000 n 
-0002536003 00000 n 
-0002536234 00000 n 
-0002536465 00000 n 
-0002536696 00000 n 
-0002536893 00000 n 
-0002537121 00000 n 
-0002537317 00000 n 
-0002537520 00000 n 
-0002537749 00000 n 
-0002537946 00000 n 
-0002538150 00000 n 
-0002538355 00000 n 
-0002538586 00000 n 
-0002538783 00000 n 
-0002539014 00000 n 
-0002539245 00000 n 
-0002539475 00000 n 
-0002539667 00000 n 
-0002539873 00000 n 
-0002540104 00000 n 
-0002540301 00000 n 
-0002540532 00000 n 
-0002540763 00000 n 
-0002540959 00000 n 
-0002541188 00000 n 
-0002542568 00000 n 
-0002530649 00000 n 
-0002528516 00000 n 
-0002541354 00000 n 
-0002541414 00000 n 
-0002541475 00000 n 
-0002541536 00000 n 
-0002541597 00000 n 
-0002541658 00000 n 
-0002541719 00000 n 
-0002541780 00000 n 
-0002541840 00000 n 
-0002541901 00000 n 
-0002541962 00000 n 
-0002542023 00000 n 
-0002542084 00000 n 
-0002542145 00000 n 
-0002542206 00000 n 
-0002542266 00000 n 
-0002542326 00000 n 
-0002542386 00000 n 
-0002542447 00000 n 
-0002614262 00000 n 
-0002614389 00000 n 
-0002614513 00000 n 
-0002614640 00000 n 
-0002614828 00000 n 
-0002614955 00000 n 
-0002617517 00000 n 
-0002544942 00000 n 
-0002545137 00000 n 
-0002545368 00000 n 
-0002545565 00000 n 
-0002545762 00000 n 
-0002545957 00000 n 
-0002546188 00000 n 
-0002546374 00000 n 
-0002546561 00000 n 
-0002546756 00000 n 
-0002546987 00000 n 
-0002547173 00000 n 
-0002547370 00000 n 
-0002547565 00000 n 
-0002547796 00000 n 
-0002547993 00000 n 
-0002548180 00000 n 
-0002548374 00000 n 
-0002548604 00000 n 
-0002548800 00000 n 
-0002548995 00000 n 
-0002549226 00000 n 
-0002549420 00000 n 
-0002549614 00000 n 
-0002549844 00000 n 
-0002550040 00000 n 
-0002550234 00000 n 
-0002550464 00000 n 
-0002550660 00000 n 
-0002550855 00000 n 
-0002551086 00000 n 
-0002551283 00000 n 
-0002551480 00000 n 
-0002551674 00000 n 
-0002551904 00000 n 
-0002552089 00000 n 
-0002552275 00000 n 
-0002552470 00000 n 
-0002552701 00000 n 
-0002552887 00000 n 
-0002553084 00000 n 
-0002553279 00000 n 
-0002553510 00000 n 
-0002553707 00000 n 
-0002553894 00000 n 
-0002554089 00000 n 
-0002554320 00000 n 
-0002554517 00000 n 
-0002554712 00000 n 
-0002554943 00000 n 
-0002555140 00000 n 
-0002555335 00000 n 
-0002555566 00000 n 
-0002555763 00000 n 
-0002555958 00000 n 
-0002556189 00000 n 
-0002556386 00000 n 
-0002556581 00000 n 
-0002556810 00000 n 
-0002557006 00000 n 
-0002557203 00000 n 
-0002557398 00000 n 
-0002557627 00000 n 
-0002557823 00000 n 
-0002558010 00000 n 
-0002558205 00000 n 
-0002558434 00000 n 
-0002558630 00000 n 
-0002558825 00000 n 
-0002559054 00000 n 
-0002559249 00000 n 
-0002559446 00000 n 
-0002559640 00000 n 
-0002559868 00000 n 
-0002560062 00000 n 
-0002560248 00000 n 
-0002560441 00000 n 
-0002560668 00000 n 
-0002564191 00000 n 
-0002564386 00000 n 
-0002564615 00000 n 
-0002564812 00000 n 
-0002565006 00000 n 
-0002565234 00000 n 
-0002560861 00000 n 
-0002561148 00000 n 
-0002544013 00000 n 
-0002542792 00000 n 
-0002561027 00000 n 
-0002561087 00000 n 
-0002617705 00000 n 
-0002617825 00000 n 
-0002617947 00000 n 
-0002618069 00000 n 
-0002618191 00000 n 
-0002618313 00000 n 
-0002618435 00000 n 
-0002618557 00000 n 
-0002618678 00000 n 
-0002618800 00000 n 
-0002618922 00000 n 
-0002621848 00000 n 
-0002621970 00000 n 
-0002622092 00000 n 
-0002622213 00000 n 
-0002622334 00000 n 
-0002622455 00000 n 
-0002622576 00000 n 
-0002622759 00000 n 
-0002622881 00000 n 
-0002623003 00000 n 
-0002626524 00000 n 
-0002565430 00000 n 
-0002565661 00000 n 
-0002565858 00000 n 
-0002566053 00000 n 
-0002566284 00000 n 
-0002566481 00000 n 
-0002566667 00000 n 
-0002566898 00000 n 
-0002567095 00000 n 
-0002567486 00000 n 
-0002567717 00000 n 
-0002567914 00000 n 
-0002568306 00000 n 
-0002568501 00000 n 
-0002568732 00000 n 
-0002568929 00000 n 
-0002569115 00000 n 
-0002569346 00000 n 
-0002569543 00000 n 
-0002569774 00000 n 
-0002569971 00000 n 
-0002570168 00000 n 
-0002570363 00000 n 
-0002570594 00000 n 
-0002570791 00000 n 
-0002570986 00000 n 
-0002571217 00000 n 
-0002571414 00000 n 
-0002571609 00000 n 
-0002571840 00000 n 
-0002572037 00000 n 
-0002572224 00000 n 
-0002572419 00000 n 
-0002572650 00000 n 
-0002572847 00000 n 
-0002573042 00000 n 
-0002573273 00000 n 
-0002573460 00000 n 
-0002573647 00000 n 
-0002573842 00000 n 
-0002574073 00000 n 
-0002574270 00000 n 
-0002574464 00000 n 
-0002574692 00000 n 
-0002574887 00000 n 
-0002575081 00000 n 
-0002575309 00000 n 
-0002575503 00000 n 
-0002575698 00000 n 
-0002575929 00000 n 
-0002576126 00000 n 
-0002576323 00000 n 
-0002576518 00000 n 
-0002576749 00000 n 
-0002576936 00000 n 
-0002577133 00000 n 
-0002577328 00000 n 
-0002577559 00000 n 
-0002577756 00000 n 
-0002577951 00000 n 
-0002578182 00000 n 
-0002578369 00000 n 
-0002578556 00000 n 
-0002578751 00000 n 
-0002578982 00000 n 
-0002579179 00000 n 
-0002579374 00000 n 
-0002579605 00000 n 
-0002579802 00000 n 
-0002579999 00000 n 
-0002580192 00000 n 
-0002580421 00000 n 
-0002580606 00000 n 
-0002580801 00000 n 
-0002580995 00000 n 
-0002581225 00000 n 
-0002581421 00000 n 
-0002581607 00000 n 
-0002581802 00000 n 
-0002582033 00000 n 
-0002582230 00000 n 
-0002582425 00000 n 
-0002582656 00000 n 
-0002582852 00000 n 
-0002583047 00000 n 
-0002583276 00000 n 
-0002583472 00000 n 
-0002583669 00000 n 
-0002583864 00000 n 
-0002584093 00000 n 
-0002584289 00000 n 
-0002584476 00000 n 
-0002584671 00000 n 
-0002584900 00000 n 
-0002585095 00000 n 
-0002585292 00000 n 
-0002585487 00000 n 
-0002585716 00000 n 
-0002585911 00000 n 
-0002586098 00000 n 
-0002586292 00000 n 
-0002586520 00000 n 
-0002586716 00000 n 
-0002586909 00000 n 
-0002587136 00000 n 
-0002587331 00000 n 
-0002587560 00000 n 
-0002591301 00000 n 
-0002591496 00000 n 
-0002591727 00000 n 
-0002591924 00000 n 
-0002592111 00000 n 
-0002592306 00000 n 
-0002592537 00000 n 
-0002592734 00000 n 
-0002592921 00000 n 
-0002593151 00000 n 
-0002587755 00000 n 
-0002587981 00000 n 
-0002562892 00000 n 
-0002561344 00000 n 
-0002587921 00000 n 
-0002567291 00000 n 
-0002568111 00000 n 
-0002626646 00000 n 
-0002626768 00000 n 
-0002626890 00000 n 
-0002627012 00000 n 
-0002627132 00000 n 
-0002627253 00000 n 
-0002627374 00000 n 
-0002627495 00000 n 
-0002627617 00000 n 
-0002630256 00000 n 
-0002630439 00000 n 
-0002630805 00000 n 
-0002630988 00000 n 
-0002631231 00000 n 
-0002631353 00000 n 
-0002631656 00000 n 
-0002631839 00000 n 
-0002593347 00000 n 
-0002593578 00000 n 
-0002593775 00000 n 
-0002593972 00000 n 
-0002594168 00000 n 
-0002594355 00000 n 
-0002594541 00000 n 
-0002594772 00000 n 
-0002595003 00000 n 
-0002595234 00000 n 
-0002595465 00000 n 
-0002595696 00000 n 
-0002595927 00000 n 
-0002596462 00000 n 
-0002590932 00000 n 
-0002588177 00000 n 
-0002596093 00000 n 
-0002596153 00000 n 
-0002596214 00000 n 
-0002596336 00000 n 
-0002638122 00000 n 
-0002638244 00000 n 
-0002599440 00000 n 
-0002600740 00000 n 
-0002599291 00000 n 
-0002596706 00000 n 
-0002599606 00000 n 
-0002599666 00000 n 
-0002599793 00000 n 
-0002599920 00000 n 
-0002600047 00000 n 
-0002600174 00000 n 
-0002600300 00000 n 
-0002600426 00000 n 
-0002600553 00000 n 
-0002600680 00000 n 
-0004864350 00000 n 
-0002603888 00000 n 
-0002604350 00000 n 
-0002604547 00000 n 
-0002604744 00000 n 
-0002605657 00000 n 
-0002603699 00000 n 
-0002600909 00000 n 
-0002604910 00000 n 
-0002604970 00000 n 
-0002604119 00000 n 
-0002605092 00000 n 
-0002605218 00000 n 
-0002605344 00000 n 
-0002605471 00000 n 
-0002605597 00000 n 
-0002608595 00000 n 
-0002608792 00000 n 
-0002608988 00000 n 
-0002610155 00000 n 
-0002608426 00000 n 
-0002605951 00000 n 
-0002609154 00000 n 
-0002609280 00000 n 
-0002609407 00000 n 
-0002609534 00000 n 
-0002609595 00000 n 
-0002609716 00000 n 
-0002609842 00000 n 
-0002609969 00000 n 
-0002610095 00000 n 
-0002613848 00000 n 
-0002615019 00000 n 
-0002613699 00000 n 
-0002610423 00000 n 
-0002614014 00000 n 
-0002614074 00000 n 
-0002614201 00000 n 
-0002614328 00000 n 
-0002614453 00000 n 
-0002614579 00000 n 
-0002614706 00000 n 
-0002614767 00000 n 
-0002614894 00000 n 
-0002617230 00000 n 
-0002619042 00000 n 
-0002617081 00000 n 
-0002615238 00000 n 
-0002617396 00000 n 
-0002617456 00000 n 
-0002617583 00000 n 
-0002617644 00000 n 
-0002617765 00000 n 
-0002617886 00000 n 
-0002618008 00000 n 
-0002618130 00000 n 
-0002618252 00000 n 
-0002618374 00000 n 
-0002618496 00000 n 
-0002618617 00000 n 
-0002618739 00000 n 
-0002618861 00000 n 
-0002618982 00000 n 
-0002621161 00000 n 
-0002621622 00000 n 
-0002623125 00000 n 
-0002620992 00000 n 
-0002619198 00000 n 
-0002621788 00000 n 
-0002621909 00000 n 
-0002622031 00000 n 
-0002622152 00000 n 
-0002622273 00000 n 
-0002622394 00000 n 
-0002622515 00000 n 
-0002622637 00000 n 
-0002622698 00000 n 
-0002621391 00000 n 
-0002622820 00000 n 
-0002622942 00000 n 
-0002623064 00000 n 
-0002625775 00000 n 
-0002626237 00000 n 
-0002627859 00000 n 
-0002625606 00000 n 
-0002623307 00000 n 
-0002626403 00000 n 
-0002626463 00000 n 
-0002626006 00000 n 
-0002626585 00000 n 
-0002626707 00000 n 
-0002626829 00000 n 
-0002626951 00000 n 
-0002627073 00000 n 
-0002627193 00000 n 
-0002627314 00000 n 
-0002627435 00000 n 
-0002627556 00000 n 
-0002627678 00000 n 
-0002627739 00000 n 
-0002627799 00000 n 
-0004864483 00000 n 
-0002630030 00000 n 
-0002631959 00000 n 
-0002629881 00000 n 
-0002628054 00000 n 
-0002630196 00000 n 
-0002630317 00000 n 
-0002630378 00000 n 
-0002630500 00000 n 
-0002630561 00000 n 
-0002630622 00000 n 
-0002630683 00000 n 
-0002630744 00000 n 
-0002630866 00000 n 
-0002630927 00000 n 
-0002631049 00000 n 
-0002631110 00000 n 
-0002631171 00000 n 
-0002631292 00000 n 
-0002631414 00000 n 
-0002631475 00000 n 
-0002631536 00000 n 
-0002631595 00000 n 
-0002631717 00000 n 
-0002631778 00000 n 
-0002631899 00000 n 
-0002634731 00000 n 
-0002634955 00000 n 
-0002635179 00000 n 
-0002635370 00000 n 
-0002635594 00000 n 
-0002635817 00000 n 
-0002636041 00000 n 
-0002636228 00000 n 
-0002636452 00000 n 
-0002636649 00000 n 
-0002636854 00000 n 
-0002637079 00000 n 
-0002637304 00000 n 
-0002637490 00000 n 
-0002642241 00000 n 
-0002637713 00000 n 
-0002639155 00000 n 
-0002634442 00000 n 
-0002632128 00000 n 
-0002637879 00000 n 
-0002637939 00000 n 
-0002638000 00000 n 
-0002638061 00000 n 
-0002638183 00000 n 
-0002638305 00000 n 
-0002638366 00000 n 
-0002638427 00000 n 
-0002638607 00000 n 
-0002638668 00000 n 
-0002638729 00000 n 
-0002638790 00000 n 
-0002638851 00000 n 
-0002638912 00000 n 
-0002638973 00000 n 
-0002639034 00000 n 
-0002639095 00000 n 
-0002699537 00000 n 
-0002642466 00000 n 
-0002642671 00000 n 
-0002642896 00000 n 
-0002643101 00000 n 
-0002643326 00000 n 
-0002643550 00000 n 
-0002643775 00000 n 
-0002644000 00000 n 
-0002644225 00000 n 
-0002644450 00000 n 
-0002644675 00000 n 
-0002644900 00000 n 
-0002645091 00000 n 
-0002645315 00000 n 
-0002645540 00000 n 
-0002645746 00000 n 
-0002645937 00000 n 
-0002646160 00000 n 
-0002646348 00000 n 
-0002646554 00000 n 
-0002646779 00000 n 
-0002646970 00000 n 
-0002647195 00000 n 
-0002647400 00000 n 
-0002647591 00000 n 
-0002647777 00000 n 
-0002648001 00000 n 
-0002648207 00000 n 
-0002648398 00000 n 
-0002648585 00000 n 
-0002648776 00000 n 
-0002648998 00000 n 
-0002649201 00000 n 
-0002649389 00000 n 
-0002649593 00000 n 
-0002653076 00000 n 
-0002653301 00000 n 
-0002653492 00000 n 
-0002653683 00000 n 
-0002653873 00000 n 
-0002654098 00000 n 
-0002654289 00000 n 
-0002649782 00000 n 
-0002650738 00000 n 
-0002641732 00000 n 
-0002639393 00000 n 
-0002649948 00000 n 
-0002650008 00000 n 
-0002650069 00000 n 
-0002650130 00000 n 
-0002650190 00000 n 
-0002650251 00000 n 
-0002650312 00000 n 
-0002650373 00000 n 
-0002650433 00000 n 
-0002650494 00000 n 
-0002650555 00000 n 
-0002650616 00000 n 
-0002650677 00000 n 
-0002699781 00000 n 
-0002704135 00000 n 
-0002704321 00000 n 
-0002707983 00000 n 
-0002708105 00000 n 
-0002654480 00000 n 
-0002654669 00000 n 
-0002654893 00000 n 
-0002655078 00000 n 
-0002655268 00000 n 
-0002655457 00000 n 
-0002655681 00000 n 
-0002655871 00000 n 
-0002656057 00000 n 
-0002656247 00000 n 
-0002656472 00000 n 
-0002656663 00000 n 
-0002656853 00000 n 
-0002657078 00000 n 
-0002657269 00000 n 
-0002657459 00000 n 
-0002657684 00000 n 
-0002657875 00000 n 
-0002658065 00000 n 
-0002658290 00000 n 
-0002658481 00000 n 
-0002658670 00000 n 
-0002658894 00000 n 
-0002659084 00000 n 
-0002659274 00000 n 
-0002659464 00000 n 
-0002659689 00000 n 
-0002659875 00000 n 
-0002660066 00000 n 
-0002660256 00000 n 
-0002660481 00000 n 
-0002660672 00000 n 
-0002660859 00000 n 
-0002661049 00000 n 
-0002661274 00000 n 
-0002661465 00000 n 
-0002661655 00000 n 
-0002661880 00000 n 
-0002662071 00000 n 
-0002662261 00000 n 
-0002662486 00000 n 
-0002662676 00000 n 
-0002662866 00000 n 
-0002663091 00000 n 
-0002663281 00000 n 
-0002663470 00000 n 
-0002663694 00000 n 
-0002663883 00000 n 
-0002666799 00000 n 
-0002666989 00000 n 
-0002667214 00000 n 
-0002667404 00000 n 
-0002667591 00000 n 
-0002667780 00000 n 
-0002668004 00000 n 
-0002664072 00000 n 
-0002664298 00000 n 
-0002652377 00000 n 
-0002650962 00000 n 
-0002664238 00000 n 
-0002708357 00000 n 
-0002708484 00000 n 
-0002708605 00000 n 
-0002708726 00000 n 
-0002708848 00000 n 
-0002708970 00000 n 
-0002709091 00000 n 
-0002711479 00000 n 
-0002711601 00000 n 
-0002711723 00000 n 
-0002711845 00000 n 
-0002711967 00000 n 
-0002712089 00000 n 
-0002712211 00000 n 
-0002712333 00000 n 
-0002712455 00000 n 
-0002668193 00000 n 
-0002668383 00000 n 
-0002668608 00000 n 
-0002668798 00000 n 
-0002668988 00000 n 
-0002669177 00000 n 
-0002669401 00000 n 
-0002669590 00000 n 
-0002669776 00000 n 
-0002669966 00000 n 
-0002670191 00000 n 
-0002670381 00000 n 
-0002670571 00000 n 
-0002670796 00000 n 
-0002670987 00000 n 
-0002671177 00000 n 
-0002671402 00000 n 
-0002671593 00000 n 
-0002671817 00000 n 
-0002672008 00000 n 
-0002672199 00000 n 
-0002672424 00000 n 
-0002672615 00000 n 
-0002672806 00000 n 
-0002673031 00000 n 
-0002673222 00000 n 
-0002673412 00000 n 
-0002673637 00000 n 
-0002673828 00000 n 
-0002674018 00000 n 
-0002674243 00000 n 
-0002674434 00000 n 
-0002674624 00000 n 
-0002674849 00000 n 
-0002675040 00000 n 
-0002675225 00000 n 
-0002675415 00000 n 
-0002675640 00000 n 
-0002675831 00000 n 
-0002676021 00000 n 
-0002676246 00000 n 
-0002676433 00000 n 
-0002676620 00000 n 
-0002676810 00000 n 
-0002677035 00000 n 
-0002677225 00000 n 
-0002677414 00000 n 
-0002677638 00000 n 
-0002677827 00000 n 
-0002678017 00000 n 
-0002678242 00000 n 
-0002678432 00000 n 
-0002678656 00000 n 
-0002678846 00000 n 
-0002679036 00000 n 
-0002679259 00000 n 
-0002679448 00000 n 
-0002683051 00000 n 
-0002683241 00000 n 
-0002683466 00000 n 
-0002683657 00000 n 
-0002683848 00000 n 
-0002684038 00000 n 
-0002684263 00000 n 
-0002684450 00000 n 
-0002679637 00000 n 
-0002679863 00000 n 
-0002666010 00000 n 
-0002664508 00000 n 
-0002679803 00000 n 
-0002712577 00000 n 
-0002716253 00000 n 
-0002716375 00000 n 
-0002716496 00000 n 
-0002716678 00000 n 
-0002716800 00000 n 
-0002716921 00000 n 
-0002717042 00000 n 
-0002717169 00000 n 
-0002717290 00000 n 
-0002720074 00000 n 
-0002720257 00000 n 
-0002684641 00000 n 
-0002684831 00000 n 
-0002685056 00000 n 
-0002685247 00000 n 
-0002685436 00000 n 
-0002685660 00000 n 
-0002685850 00000 n 
-0002686039 00000 n 
-0002686263 00000 n 
-0002686453 00000 n 
-0002686643 00000 n 
-0002686833 00000 n 
-0002687058 00000 n 
-0002687245 00000 n 
-0002687436 00000 n 
-0002687626 00000 n 
-0002687851 00000 n 
-0002688042 00000 n 
-0002688227 00000 n 
-0002688417 00000 n 
-0002688642 00000 n 
-0002688833 00000 n 
-0002689023 00000 n 
-0002689248 00000 n 
-0002689438 00000 n 
-0002689628 00000 n 
-0002689853 00000 n 
-0002690043 00000 n 
-0002690233 00000 n 
-0002690423 00000 n 
-0002690648 00000 n 
-0002690838 00000 n 
-0002691025 00000 n 
-0002691215 00000 n 
-0002691440 00000 n 
-0002691630 00000 n 
-0002691820 00000 n 
-0002692010 00000 n 
-0002692235 00000 n 
-0002692425 00000 n 
-0002692612 00000 n 
-0002692802 00000 n 
-0002693027 00000 n 
-0002693218 00000 n 
-0002693408 00000 n 
-0002693633 00000 n 
-0002693824 00000 n 
-0002694048 00000 n 
-0002694239 00000 n 
-0002694430 00000 n 
-0002694655 00000 n 
-0002694846 00000 n 
-0002695036 00000 n 
-0002695222 00000 n 
-0002695407 00000 n 
-0002695755 00000 n 
-0002682282 00000 n 
-0002680073 00000 n 
-0002695573 00000 n 
-0002695633 00000 n 
-0002695694 00000 n 
-0004864616 00000 n 
-0002720745 00000 n 
-0002721050 00000 n 
-0002721172 00000 n 
-0002726166 00000 n 
-0002726349 00000 n 
-0002698389 00000 n 
-0002698576 00000 n 
-0002698801 00000 n 
-0002699250 00000 n 
-0002699903 00000 n 
-0002698200 00000 n 
-0002695998 00000 n 
-0002699416 00000 n 
-0002699476 00000 n 
-0002699598 00000 n 
-0002699659 00000 n 
-0002699026 00000 n 
-0002699720 00000 n 
-0002699842 00000 n 
-0002703521 00000 n 
-0002703710 00000 n 
-0002703909 00000 n 
-0002704509 00000 n 
-0002703352 00000 n 
-0002700135 00000 n 
-0002704075 00000 n 
-0002704200 00000 n 
-0002704260 00000 n 
-0002704387 00000 n 
-0002704448 00000 n 
-0002707696 00000 n 
-0002709211 00000 n 
-0002707547 00000 n 
-0002704793 00000 n 
-0002707862 00000 n 
-0002707922 00000 n 
-0002708044 00000 n 
-0002708171 00000 n 
-0002708296 00000 n 
-0002708423 00000 n 
-0002708545 00000 n 
-0002708665 00000 n 
-0002708787 00000 n 
-0002708909 00000 n 
-0002709030 00000 n 
-0002709151 00000 n 
-0002711253 00000 n 
-0002712699 00000 n 
-0002711104 00000 n 
-0002709404 00000 n 
-0002711419 00000 n 
-0002711540 00000 n 
-0002711662 00000 n 
-0002711784 00000 n 
-0002711906 00000 n 
-0002712028 00000 n 
-0002712150 00000 n 
-0002712272 00000 n 
-0002712394 00000 n 
-0002712516 00000 n 
-0002712638 00000 n 
-0002715070 00000 n 
-0002715519 00000 n 
-0002715966 00000 n 
-0002717410 00000 n 
-0002714881 00000 n 
-0002712881 00000 n 
-0002716132 00000 n 
-0002716192 00000 n 
-0002715295 00000 n 
-0002716314 00000 n 
-0002716435 00000 n 
-0002716557 00000 n 
-0002716618 00000 n 
-0002715744 00000 n 
-0002716739 00000 n 
-0002716860 00000 n 
-0002716981 00000 n 
-0002717108 00000 n 
-0002717229 00000 n 
-0002717350 00000 n 
-0002719726 00000 n 
-0002721354 00000 n 
-0002719577 00000 n 
-0002717605 00000 n 
-0002719892 00000 n 
-0002719952 00000 n 
-0002720013 00000 n 
-0002720135 00000 n 
-0002720196 00000 n 
-0002720318 00000 n 
-0002720379 00000 n 
-0002720440 00000 n 
-0002720501 00000 n 
-0002720562 00000 n 
-0002720623 00000 n 
-0002720684 00000 n 
-0002720806 00000 n 
-0002720867 00000 n 
-0002720928 00000 n 
-0002720989 00000 n 
-0002721111 00000 n 
-0002721233 00000 n 
-0002721294 00000 n 
-0004864749 00000 n 
-0002723872 00000 n 
-0002724082 00000 n 
-0002724307 00000 n 
-0002724565 00000 n 
-0002724790 00000 n 
-0002725048 00000 n 
-0002725562 00000 n 
-0002729974 00000 n 
-0002730197 00000 n 
-0002725818 00000 n 
-0002726955 00000 n 
-0002723643 00000 n 
-0002721536 00000 n 
-0002725984 00000 n 
-0002726044 00000 n 
-0002726105 00000 n 
-0002726227 00000 n 
-0002726288 00000 n 
-0002726410 00000 n 
-0002726471 00000 n 
-0002726532 00000 n 
-0002726593 00000 n 
-0002726654 00000 n 
-0002726833 00000 n 
-0002726894 00000 n 
-0002725306 00000 n 
-0002759235 00000 n 
-0002759357 00000 n 
-0002759422 00000 n 
-0002763265 00000 n 
-0002763331 00000 n 
-0002763397 00000 n 
-0002730402 00000 n 
-0002730625 00000 n 
-0002730830 00000 n 
-0002731022 00000 n 
-0002731414 00000 n 
-0002731644 00000 n 
-0002731850 00000 n 
-0002732090 00000 n 
-0002732314 00000 n 
-0002732520 00000 n 
-0002732716 00000 n 
-0002733177 00000 n 
-0002733382 00000 n 
-0002733622 00000 n 
-0002733846 00000 n 
-0002734052 00000 n 
-0002734249 00000 n 
-0002734446 00000 n 
-0002734907 00000 n 
-0002735113 00000 n 
-0002735353 00000 n 
-0002735577 00000 n 
-0002735768 00000 n 
-0002735992 00000 n 
-0002736181 00000 n 
-0002736403 00000 n 
-0002736593 00000 n 
-0002736798 00000 n 
-0002737023 00000 n 
-0002737215 00000 n 
-0002737439 00000 n 
-0002737647 00000 n 
-0002737871 00000 n 
-0002738080 00000 n 
-0002738305 00000 n 
-0002738501 00000 n 
-0002738725 00000 n 
-0002738930 00000 n 
-0002739155 00000 n 
-0002739379 00000 n 
-0002739604 00000 n 
-0002739809 00000 n 
-0002740034 00000 n 
-0002740226 00000 n 
-0002740451 00000 n 
-0002740640 00000 n 
-0002740865 00000 n 
-0002741061 00000 n 
-0002741284 00000 n 
-0002745188 00000 n 
-0002745413 00000 n 
-0002745618 00000 n 
-0002741479 00000 n 
-0002742313 00000 n 
-0002729285 00000 n 
-0002727150 00000 n 
-0002741645 00000 n 
-0002741705 00000 n 
-0002731218 00000 n 
-0002732947 00000 n 
-0002734677 00000 n 
-0002741766 00000 n 
-0002741827 00000 n 
-0002741888 00000 n 
-0002741949 00000 n 
-0002742010 00000 n 
-0002742070 00000 n 
-0002742131 00000 n 
-0002742191 00000 n 
-0002742252 00000 n 
-0002763524 00000 n 
-0002763768 00000 n 
-0002768521 00000 n 
-0002768764 00000 n 
-0002769069 00000 n 
-0002772657 00000 n 
-0002772906 00000 n 
-0002773092 00000 n 
-0002773275 00000 n 
-0002773456 00000 n 
-0002745843 00000 n 
-0002746046 00000 n 
-0002746271 00000 n 
-0002746496 00000 n 
-0002746684 00000 n 
-0002746890 00000 n 
-0002747298 00000 n 
-0002747486 00000 n 
-0002747711 00000 n 
-0002747897 00000 n 
-0002748120 00000 n 
-0002748344 00000 n 
-0002748548 00000 n 
-0002748751 00000 n 
-0002748976 00000 n 
-0002749201 00000 n 
-0002749426 00000 n 
-0002749651 00000 n 
-0002749876 00000 n 
-0002750099 00000 n 
-0002750304 00000 n 
-0002750529 00000 n 
-0002750734 00000 n 
-0002750959 00000 n 
-0002751184 00000 n 
-0002751375 00000 n 
-0002751599 00000 n 
-0002751824 00000 n 
-0002752049 00000 n 
-0002752274 00000 n 
-0002752499 00000 n 
-0002752704 00000 n 
-0002752928 00000 n 
-0002756620 00000 n 
-0002756844 00000 n 
-0002753116 00000 n 
-0002754135 00000 n 
-0002744669 00000 n 
-0002742551 00000 n 
-0002753282 00000 n 
-0002753342 00000 n 
-0002747096 00000 n 
-0002753403 00000 n 
-0002753464 00000 n 
-0002753525 00000 n 
-0002753586 00000 n 
-0002753647 00000 n 
-0002753708 00000 n 
-0002753769 00000 n 
-0002753830 00000 n 
-0002753891 00000 n 
-0002753952 00000 n 
-0002754013 00000 n 
-0002754074 00000 n 
-0002776895 00000 n 
-0002777017 00000 n 
-0002777139 00000 n 
-0002777383 00000 n 
-0002777566 00000 n 
-0002780593 00000 n 
-0002757034 00000 n 
-0002757259 00000 n 
-0002757450 00000 n 
-0002757641 00000 n 
-0002757866 00000 n 
-0002758057 00000 n 
-0002758248 00000 n 
-0002758444 00000 n 
-0002758635 00000 n 
-0002758826 00000 n 
-0002759482 00000 n 
-0002756361 00000 n 
-0002754347 00000 n 
-0002758992 00000 n 
-0002759052 00000 n 
-0002759113 00000 n 
-0002759174 00000 n 
-0002759296 00000 n 
-0002780837 00000 n 
-0002780959 00000 n 
-0002762753 00000 n 
-0002767559 00000 n 
-0002762978 00000 n 
-0002763951 00000 n 
-0002762594 00000 n 
-0002759679 00000 n 
-0002763144 00000 n 
-0002763204 00000 n 
-0002763463 00000 n 
-0002763585 00000 n 
-0002763646 00000 n 
-0002763707 00000 n 
-0002763829 00000 n 
-0002763890 00000 n 
-0002767784 00000 n 
-0002768009 00000 n 
-0002768234 00000 n 
-0002769189 00000 n 
-0002767380 00000 n 
-0002764173 00000 n 
-0002768400 00000 n 
-0002768460 00000 n 
-0002768582 00000 n 
-0002768643 00000 n 
-0002768704 00000 n 
-0002768825 00000 n 
-0002768886 00000 n 
-0002768947 00000 n 
-0002769008 00000 n 
-0002769129 00000 n 
-0004864882 00000 n 
-0002772207 00000 n 
-0002772431 00000 n 
-0002773576 00000 n 
-0002772048 00000 n 
-0002769396 00000 n 
-0002772597 00000 n 
-0002772723 00000 n 
-0002772784 00000 n 
-0002772845 00000 n 
-0002772971 00000 n 
-0002773031 00000 n 
-0002773153 00000 n 
-0002773214 00000 n 
-0002773336 00000 n 
-0002773395 00000 n 
-0002773516 00000 n 
-0002776608 00000 n 
-0002777626 00000 n 
-0002776459 00000 n 
-0002773770 00000 n 
-0002776774 00000 n 
-0002776834 00000 n 
-0002776956 00000 n 
-0002777078 00000 n 
-0002777200 00000 n 
-0002777261 00000 n 
-0002777322 00000 n 
-0002777444 00000 n 
-0002777505 00000 n 
-0002783287 00000 n 
-0002787719 00000 n 
-0002780245 00000 n 
-0002781259 00000 n 
-0002780096 00000 n 
-0002777824 00000 n 
-0002780411 00000 n 
-0002780471 00000 n 
-0002780532 00000 n 
-0002780654 00000 n 
-0002780715 00000 n 
-0002780776 00000 n 
-0002780898 00000 n 
-0002781020 00000 n 
-0002781081 00000 n 
-0002787788 00000 n 
-0002787993 00000 n 
-0002788231 00000 n 
-0002788485 00000 n 
-0002788689 00000 n 
-0002788894 00000 n 
-0002789133 00000 n 
-0002789387 00000 n 
-0002789592 00000 n 
-0002789797 00000 n 
-0002790037 00000 n 
-0002790293 00000 n 
-0002790497 00000 n 
-0002790701 00000 n 
-0002790941 00000 n 
-0002791197 00000 n 
-0002791403 00000 n 
-0002791608 00000 n 
-0002791848 00000 n 
-0002792104 00000 n 
-0002792310 00000 n 
-0002792565 00000 n 
-0002792805 00000 n 
-0002793045 00000 n 
-0002793285 00000 n 
-0002793541 00000 n 
-0002797511 00000 n 
-0002797767 00000 n 
-0002797971 00000 n 
-0002793762 00000 n 
-0002794473 00000 n 
-0002782861 00000 n 
-0002781483 00000 n 
-0002793928 00000 n 
-0002793988 00000 n 
-0002794049 00000 n 
-0002794229 00000 n 
-0002794290 00000 n 
-0002794351 00000 n 
-0002794412 00000 n 
-0002784252 00000 n 
-0002784384 00000 n 
-0002784537 00000 n 
-0002784871 00000 n 
-0002785319 00000 n 
-0002785559 00000 n 
-0002785582 00000 n 
-0002787695 00000 n 
-0002798177 00000 n 
-0002798433 00000 n 
-0002798689 00000 n 
-0002798911 00000 n 
-0002799354 00000 n 
-0002799610 00000 n 
-0002799832 00000 n 
-0002800275 00000 n 
-0002800867 00000 n 
-0002797242 00000 n 
-0002794699 00000 n 
-0002800441 00000 n 
-0002800501 00000 n 
-0002800562 00000 n 
-0002800623 00000 n 
-0002799133 00000 n 
-0002800054 00000 n 
-0002800684 00000 n 
-0002800745 00000 n 
-0002800806 00000 n 
-0002814400 00000 n 
-0002804717 00000 n 
-0002805196 00000 n 
-0002805675 00000 n 
-0002806154 00000 n 
-0002806623 00000 n 
-0002804508 00000 n 
-0002801165 00000 n 
-0002806320 00000 n 
-0002804957 00000 n 
-0002805436 00000 n 
-0002805915 00000 n 
-0002806380 00000 n 
-0002806501 00000 n 
-0002806562 00000 n 
-0004865015 00000 n 
-0002812576 00000 n 
-0002809054 00000 n 
-0002812507 00000 n 
-0002812816 00000 n 
-0002813043 00000 n 
-0002813249 00000 n 
-0002813455 00000 n 
-0002813695 00000 n 
-0002813920 00000 n 
-0002814114 00000 n 
-0002814762 00000 n 
-0002808818 00000 n 
-0002806909 00000 n 
-0002814280 00000 n 
-0002814340 00000 n 
-0002814461 00000 n 
-0002814522 00000 n 
-0002814701 00000 n 
-0002809820 00000 n 
-0002809952 00000 n 
-0002810105 00000 n 
-0002810379 00000 n 
-0002810764 00000 n 
-0002811004 00000 n 
-0002811027 00000 n 
-0002812483 00000 n 
-0002833443 00000 n 
-0002833687 00000 n 
-0002817359 00000 n 
-0002817586 00000 n 
-0002817783 00000 n 
-0002817977 00000 n 
-0002818204 00000 n 
-0002818399 00000 n 
-0002818626 00000 n 
-0002818822 00000 n 
-0002819016 00000 n 
-0002819243 00000 n 
-0002819439 00000 n 
-0002819666 00000 n 
-0002819863 00000 n 
-0002820057 00000 n 
-0002820284 00000 n 
-0002820476 00000 n 
-0002820682 00000 n 
-0002821160 00000 n 
-0002821387 00000 n 
-0002821569 00000 n 
-0002821756 00000 n 
-0002821962 00000 n 
-0002822441 00000 n 
-0002822668 00000 n 
-0002822850 00000 n 
-0002823055 00000 n 
-0002823294 00000 n 
-0002823521 00000 n 
-0002823709 00000 n 
-0002823915 00000 n 
-0002824394 00000 n 
-0002824621 00000 n 
-0002824816 00000 n 
-0002825021 00000 n 
-0002825499 00000 n 
-0002825726 00000 n 
-0002825920 00000 n 
-0002826126 00000 n 
-0002826603 00000 n 
-0002826796 00000 n 
-0002827024 00000 n 
-0002827218 00000 n 
-0002827411 00000 n 
-0002827639 00000 n 
-0002827831 00000 n 
-0002828058 00000 n 
-0002828286 00000 n 
-0002828480 00000 n 
-0002828707 00000 n 
-0002832264 00000 n 
-0002828900 00000 n 
-0002829431 00000 n 
-0002816670 00000 n 
-0002814960 00000 n 
-0002829066 00000 n 
-0002820921 00000 n 
-0002822202 00000 n 
-0002824155 00000 n 
-0002825261 00000 n 
-0002829126 00000 n 
-0002826366 00000 n 
-0002829187 00000 n 
-0002829248 00000 n 
-0002829309 00000 n 
-0002829370 00000 n 
-0002833874 00000 n 
-0002836805 00000 n 
-0002837049 00000 n 
-0002837293 00000 n 
-0002837476 00000 n 
-0002840799 00000 n 
-0002840982 00000 n 
-0002841225 00000 n 
-0002841407 00000 n 
-0002844593 00000 n 
-0002844837 00000 n 
-0002832458 00000 n 
-0002832649 00000 n 
-0002832843 00000 n 
-0002833034 00000 n 
-0002833996 00000 n 
-0002832075 00000 n 
-0002829641 00000 n 
-0002833200 00000 n 
-0002833260 00000 n 
-0002833321 00000 n 
-0002833382 00000 n 
-0002833504 00000 n 
-0002833565 00000 n 
-0002833626 00000 n 
-0002833753 00000 n 
-0002833814 00000 n 
-0002833935 00000 n 
-0002836518 00000 n 
-0002837598 00000 n 
-0002836369 00000 n 
-0002834191 00000 n 
-0002836684 00000 n 
-0002836744 00000 n 
-0002836866 00000 n 
-0002836927 00000 n 
-0002836988 00000 n 
-0002837110 00000 n 
-0002837171 00000 n 
-0002837232 00000 n 
-0002837354 00000 n 
-0002837415 00000 n 
-0002837537 00000 n 
-0002840512 00000 n 
-0002841529 00000 n 
-0002840363 00000 n 
-0002837767 00000 n 
-0002840678 00000 n 
-0002840738 00000 n 
-0002840860 00000 n 
-0002840921 00000 n 
-0002841042 00000 n 
-0002841103 00000 n 
-0002841164 00000 n 
-0002841286 00000 n 
-0002841347 00000 n 
-0002841468 00000 n 
-0002844306 00000 n 
-0002845259 00000 n 
-0002844157 00000 n 
-0002841711 00000 n 
-0002844472 00000 n 
-0002844532 00000 n 
-0002844654 00000 n 
-0002844715 00000 n 
-0002844776 00000 n 
-0002844898 00000 n 
-0002844959 00000 n 
-0002845139 00000 n 
-0004865148 00000 n 
-0002847573 00000 n 
-0002847798 00000 n 
-0002848024 00000 n 
-0002848249 00000 n 
-0002848453 00000 n 
-0002848682 00000 n 
-0002848874 00000 n 
-0002853405 00000 n 
-0002849101 00000 n 
-0002850172 00000 n 
-0002847354 00000 n 
-0002845454 00000 n 
-0002849267 00000 n 
-0002849386 00000 n 
-0002849447 00000 n 
-0002849508 00000 n 
-0002849569 00000 n 
-0002849628 00000 n 
-0002849689 00000 n 
-0002849750 00000 n 
-0002849811 00000 n 
-0002849990 00000 n 
-0002850051 00000 n 
-0002850112 00000 n 
-0002853634 00000 n 
-0002853863 00000 n 
-0002854092 00000 n 
-0002854321 00000 n 
-0002854549 00000 n 
-0002854754 00000 n 
-0002854983 00000 n 
-0002855188 00000 n 
-0002855417 00000 n 
-0002855646 00000 n 
-0002855875 00000 n 
-0002856081 00000 n 
-0002856287 00000 n 
-0002856767 00000 n 
-0002856996 00000 n 
-0002857191 00000 n 
-0002857397 00000 n 
-0002857877 00000 n 
-0002858105 00000 n 
-0002858299 00000 n 
-0002858503 00000 n 
-0002858982 00000 n 
-0002859211 00000 n 
-0002859406 00000 n 
-0002859635 00000 n 
-0002859830 00000 n 
-0002860059 00000 n 
-0002860253 00000 n 
-0002860482 00000 n 
-0002860671 00000 n 
-0002860877 00000 n 
-0002861355 00000 n 
-0002861584 00000 n 
-0002861766 00000 n 
-0002861953 00000 n 
-0002862159 00000 n 
-0002862638 00000 n 
-0002862867 00000 n 
-0002863048 00000 n 
-0002863252 00000 n 
-0002863492 00000 n 
-0002863721 00000 n 
-0002863909 00000 n 
-0002864115 00000 n 
-0002864595 00000 n 
-0002864789 00000 n 
-0002865017 00000 n 
-0002865211 00000 n 
-0002865436 00000 n 
-0002869348 00000 n 
-0002865629 00000 n 
-0002866403 00000 n 
-0002852696 00000 n 
-0002850381 00000 n 
-0002865795 00000 n 
-0002865855 00000 n 
-0002865916 00000 n 
-0002865977 00000 n 
-0002866038 00000 n 
-0002866099 00000 n 
-0002866160 00000 n 
-0002866221 00000 n 
-0002856527 00000 n 
-0002857637 00000 n 
-0002858742 00000 n 
-0002861116 00000 n 
-0002862399 00000 n 
-0002864355 00000 n 
-0002866282 00000 n 
-0002866343 00000 n 
-0003069141 00000 n 
-0002970047 00000 n 
-0002970230 00000 n 
-0002973039 00000 n 
-0002973166 00000 n 
-0002973414 00000 n 
-0002973658 00000 n 
-0002976860 00000 n 
-0002976982 00000 n 
-0002977231 00000 n 
-0002977474 00000 n 
-0002869577 00000 n 
-0002869783 00000 n 
-0002870011 00000 n 
-0002870217 00000 n 
-0002870446 00000 n 
-0002870637 00000 n 
-0002870833 00000 n 
-0002871059 00000 n 
-0002871256 00000 n 
-0002871484 00000 n 
-0002871681 00000 n 
-0002871910 00000 n 
-0002872107 00000 n 
-0002872336 00000 n 
-0002872565 00000 n 
-0002872760 00000 n 
-0002872989 00000 n 
-0002873183 00000 n 
-0002873412 00000 n 
-0002873607 00000 n 
-0002873804 00000 n 
-0002874031 00000 n 
-0002874218 00000 n 
-0002874414 00000 n 
-0002874640 00000 n 
-0002874826 00000 n 
-0002875024 00000 n 
-0002875252 00000 n 
-0002875439 00000 n 
-0002875668 00000 n 
-0002875897 00000 n 
-0002876126 00000 n 
-0002876355 00000 n 
-0002876584 00000 n 
-0002876813 00000 n 
-0002877040 00000 n 
-0002877225 00000 n 
-0002877454 00000 n 
-0002877651 00000 n 
-0002877880 00000 n 
-0002878076 00000 n 
-0002878304 00000 n 
-0002878501 00000 n 
-0002878707 00000 n 
-0002883593 00000 n 
-0002883821 00000 n 
-0002884018 00000 n 
-0002884224 00000 n 
-0002884430 00000 n 
-0002884618 00000 n 
-0002884847 00000 n 
-0002885044 00000 n 
-0002885249 00000 n 
-0002878913 00000 n 
-0002879930 00000 n 
-0002868749 00000 n 
-0002866627 00000 n 
-0002879079 00000 n 
-0002879139 00000 n 
-0002879199 00000 n 
-0002879259 00000 n 
-0002879320 00000 n 
-0002879381 00000 n 
-0002879442 00000 n 
-0002879503 00000 n 
-0002879564 00000 n 
-0002879625 00000 n 
-0002879686 00000 n 
-0002879747 00000 n 
-0002879808 00000 n 
-0002879869 00000 n 
-0002980840 00000 n 
-0002981021 00000 n 
-0002981204 00000 n 
-0002981387 00000 n 
-0002984319 00000 n 
-0002984502 00000 n 
-0002984685 00000 n 
-0002984868 00000 n 
-0002985050 00000 n 
-0002985233 00000 n 
-0002885454 00000 n 
-0002885683 00000 n 
-0002885880 00000 n 
-0002886085 00000 n 
-0002886290 00000 n 
-0002886478 00000 n 
-0002886707 00000 n 
-0002886903 00000 n 
-0002887109 00000 n 
-0002887315 00000 n 
-0002887726 00000 n 
-0002887931 00000 n 
-0002888160 00000 n 
-0002888387 00000 n 
-0002888576 00000 n 
-0002888803 00000 n 
-0002889000 00000 n 
-0002889227 00000 n 
-0002889424 00000 n 
-0002889650 00000 n 
-0002889838 00000 n 
-0002890064 00000 n 
-0002890259 00000 n 
-0002890485 00000 n 
-0002890681 00000 n 
-0002890908 00000 n 
-0002891097 00000 n 
-0002891323 00000 n 
-0002891512 00000 n 
-0002891738 00000 n 
-0002891935 00000 n 
-0002892162 00000 n 
-0002892359 00000 n 
-0002892588 00000 n 
-0002892779 00000 n 
-0002892966 00000 n 
-0002893157 00000 n 
-0002893344 00000 n 
-0002893573 00000 n 
-0002893764 00000 n 
-0002893951 00000 n 
-0002894142 00000 n 
-0002894329 00000 n 
-0002894535 00000 n 
-0002894761 00000 n 
-0002894947 00000 n 
-0002899777 00000 n 
-0002900004 00000 n 
-0002900197 00000 n 
-0002900364 00000 n 
-0002900590 00000 n 
-0002895111 00000 n 
-0002895398 00000 n 
-0002882884 00000 n 
-0002880127 00000 n 
-0002895277 00000 n 
-0002887520 00000 n 
-0002895337 00000 n 
-0002988714 00000 n 
-0002988962 00000 n 
-0002993382 00000 n 
-0002993630 00000 n 
-0002996717 00000 n 
-0002996965 00000 n 
-0002997209 00000 n 
-0002997453 00000 n 
-0003000517 00000 n 
-0003000761 00000 n 
-0003001005 00000 n 
-0003003857 00000 n 
-0003004101 00000 n 
-0003004345 00000 n 
-0003004588 00000 n 
-0003008619 00000 n 
-0003008868 00000 n 
-0002900783 00000 n 
-0002901010 00000 n 
-0002901204 00000 n 
-0002901433 00000 n 
-0002901627 00000 n 
-0002901855 00000 n 
-0002902049 00000 n 
-0002902276 00000 n 
-0002902471 00000 n 
-0002902700 00000 n 
-0002902895 00000 n 
-0002903076 00000 n 
-0002903303 00000 n 
-0002903489 00000 n 
-0002903685 00000 n 
-0002903898 00000 n 
-0002904064 00000 n 
-0002904293 00000 n 
-0002904480 00000 n 
-0002904670 00000 n 
-0002904856 00000 n 
-0002905026 00000 n 
-0002905255 00000 n 
-0002905442 00000 n 
-0002905639 00000 n 
-0002905848 00000 n 
-0002906014 00000 n 
-0002906243 00000 n 
-0002906430 00000 n 
-0002906636 00000 n 
-0002906833 00000 n 
-0002907046 00000 n 
-0002907224 00000 n 
-0002907452 00000 n 
-0002907648 00000 n 
-0002907853 00000 n 
-0002908050 00000 n 
-0002908229 00000 n 
-0002908458 00000 n 
-0002908644 00000 n 
-0002908841 00000 n 
-0002909235 00000 n 
-0002909448 00000 n 
-0002909637 00000 n 
-0002909866 00000 n 
-0002910053 00000 n 
-0002910259 00000 n 
-0002910455 00000 n 
-0002910667 00000 n 
-0002910846 00000 n 
-0002911075 00000 n 
-0002911272 00000 n 
-0002911478 00000 n 
-0002911675 00000 n 
-0002911853 00000 n 
-0002912082 00000 n 
-0002912269 00000 n 
-0002912466 00000 n 
-0002912860 00000 n 
-0002913073 00000 n 
-0002913261 00000 n 
-0002913485 00000 n 
-0002917612 00000 n 
-0002917782 00000 n 
-0002918011 00000 n 
-0002918204 00000 n 
-0002918410 00000 n 
-0002918820 00000 n 
-0002919024 00000 n 
-0002913678 00000 n 
-0002913904 00000 n 
-0002898938 00000 n 
-0002895609 00000 n 
-0002913844 00000 n 
-0002909038 00000 n 
-0002912663 00000 n 
-0003012591 00000 n 
-0003012835 00000 n 
-0003013018 00000 n 
-0003013201 00000 n 
-0003013384 00000 n 
-0003017656 00000 n 
-0003017843 00000 n 
-0003018026 00000 n 
-0003022610 00000 n 
-0003022854 00000 n 
-0003023101 00000 n 
-0003027633 00000 n 
-0003027873 00000 n 
-0003028116 00000 n 
-0003032741 00000 n 
-0003032985 00000 n 
-0003038115 00000 n 
-0002919219 00000 n 
-0002919387 00000 n 
-0002919614 00000 n 
-0002919819 00000 n 
-0002920059 00000 n 
-0002920288 00000 n 
-0002920481 00000 n 
-0002920687 00000 n 
-0002920925 00000 n 
-0002921151 00000 n 
-0002921378 00000 n 
-0002921573 00000 n 
-0002921741 00000 n 
-0002921970 00000 n 
-0002922165 00000 n 
-0002922334 00000 n 
-0002922561 00000 n 
-0002922756 00000 n 
-0002922922 00000 n 
-0002923147 00000 n 
-0002923341 00000 n 
-0002923570 00000 n 
-0002923765 00000 n 
-0002923962 00000 n 
-0002924126 00000 n 
-0002924352 00000 n 
-0002924546 00000 n 
-0002924715 00000 n 
-0002924943 00000 n 
-0002925138 00000 n 
-0002925335 00000 n 
-0002925504 00000 n 
-0002925731 00000 n 
-0002925937 00000 n 
-0002926164 00000 n 
-0002926369 00000 n 
-0002926596 00000 n 
-0002926790 00000 n 
-0002926963 00000 n 
-0002927189 00000 n 
-0002927382 00000 n 
-0002927609 00000 n 
-0002927815 00000 n 
-0002928042 00000 n 
-0002928235 00000 n 
-0002928462 00000 n 
-0002928649 00000 n 
-0002928855 00000 n 
-0002929080 00000 n 
-0002929272 00000 n 
-0002932635 00000 n 
-0002932862 00000 n 
-0002933089 00000 n 
-0002933271 00000 n 
-0002929456 00000 n 
-0002929804 00000 n 
-0002916883 00000 n 
-0002914156 00000 n 
-0002929622 00000 n 
-0002918616 00000 n 
-0002929682 00000 n 
-0002929743 00000 n 
-0004865281 00000 n 
-0003038298 00000 n 
-0003038542 00000 n 
-0003042472 00000 n 
-0003042655 00000 n 
-0003042899 00000 n 
-0003047497 00000 n 
-0003047741 00000 n 
-0003047985 00000 n 
-0003052030 00000 n 
-0003052273 00000 n 
-0003052455 00000 n 
-0003057272 00000 n 
-0003057455 00000 n 
-0003057699 00000 n 
-0003057882 00000 n 
-0003063985 00000 n 
-0003064233 00000 n 
-0002933456 00000 n 
-0002933662 00000 n 
-0002933891 00000 n 
-0002934120 00000 n 
-0002934349 00000 n 
-0002934578 00000 n 
-0002934773 00000 n 
-0002935002 00000 n 
-0002935197 00000 n 
-0002935392 00000 n 
-0002935620 00000 n 
-0002935815 00000 n 
-0002936010 00000 n 
-0002936239 00000 n 
-0002936434 00000 n 
-0002936629 00000 n 
-0002936858 00000 n 
-0002937052 00000 n 
-0002937246 00000 n 
-0002937441 00000 n 
-0002937647 00000 n 
-0002937876 00000 n 
-0002938070 00000 n 
-0002938264 00000 n 
-0002938459 00000 n 
-0002938665 00000 n 
-0002938894 00000 n 
-0002939088 00000 n 
-0002939281 00000 n 
-0002939475 00000 n 
-0002939680 00000 n 
-0002939908 00000 n 
-0002940102 00000 n 
-0002940295 00000 n 
-0002940489 00000 n 
-0002943988 00000 n 
-0002944216 00000 n 
-0002944410 00000 n 
-0002944604 00000 n 
-0002944799 00000 n 
-0002940694 00000 n 
-0002941225 00000 n 
-0002932096 00000 n 
-0002930014 00000 n 
-0002940860 00000 n 
-0002940920 00000 n 
-0002940981 00000 n 
-0002941042 00000 n 
-0002941103 00000 n 
-0002941164 00000 n 
-0003068706 00000 n 
-0003068953 00000 n 
-0003072407 00000 n 
-0003072529 00000 n 
-0003072655 00000 n 
-0003072777 00000 n 
-0003072904 00000 n 
-0003073031 00000 n 
-0003073153 00000 n 
-0003076476 00000 n 
-0002945005 00000 n 
-0002945233 00000 n 
-0002945427 00000 n 
-0002945621 00000 n 
-0002945816 00000 n 
-0002946022 00000 n 
-0002946251 00000 n 
-0002946445 00000 n 
-0002946834 00000 n 
-0002947027 00000 n 
-0002947232 00000 n 
-0002947461 00000 n 
-0002947655 00000 n 
-0002948044 00000 n 
-0002948237 00000 n 
-0002948442 00000 n 
-0002948671 00000 n 
-0002948865 00000 n 
-0002949254 00000 n 
-0002949448 00000 n 
-0002949653 00000 n 
-0002949881 00000 n 
-0002950076 00000 n 
-0002950271 00000 n 
-0002950499 00000 n 
-0002950693 00000 n 
-0002950887 00000 n 
-0002951115 00000 n 
-0002951308 00000 n 
-0002951502 00000 n 
-0002951697 00000 n 
-0002951903 00000 n 
-0002952132 00000 n 
-0002952326 00000 n 
-0002952520 00000 n 
-0002952715 00000 n 
-0002952921 00000 n 
-0002953150 00000 n 
-0002953344 00000 n 
-0002953538 00000 n 
-0002953733 00000 n 
-0002953939 00000 n 
-0002954167 00000 n 
-0002954361 00000 n 
-0002954554 00000 n 
-0002954748 00000 n 
-0002954953 00000 n 
-0002955181 00000 n 
-0002955375 00000 n 
-0002955568 00000 n 
-0002955762 00000 n 
-0002955967 00000 n 
-0002956195 00000 n 
-0002956389 00000 n 
-0002956583 00000 n 
-0002956778 00000 n 
-0002956984 00000 n 
-0002957212 00000 n 
-0002957405 00000 n 
-0002957791 00000 n 
-0002957984 00000 n 
-0002962182 00000 n 
-0002962411 00000 n 
-0002962605 00000 n 
-0002962994 00000 n 
-0002963187 00000 n 
-0002963393 00000 n 
-0002963622 00000 n 
-0002963816 00000 n 
-0002964205 00000 n 
-0002964398 00000 n 
-0002958188 00000 n 
-0002958414 00000 n 
-0002943139 00000 n 
-0002941435 00000 n 
-0002958354 00000 n 
-0002946640 00000 n 
-0002947850 00000 n 
-0002949060 00000 n 
-0002957599 00000 n 
-0003076603 00000 n 
-0003076723 00000 n 
-0003076850 00000 n 
-0003080093 00000 n 
-0003080215 00000 n 
-0003080463 00000 n 
-0003080585 00000 n 
-0003080707 00000 n 
-0003080829 00000 n 
-0003080951 00000 n 
-0003088517 00000 n 
-0003088637 00000 n 
-0002964604 00000 n 
-0002964832 00000 n 
-0002965026 00000 n 
-0002965220 00000 n 
-0002965449 00000 n 
-0002965644 00000 n 
-0002965835 00000 n 
-0002969382 00000 n 
-0002966022 00000 n 
-0002966370 00000 n 
-0002961843 00000 n 
-0002958624 00000 n 
-0002966188 00000 n 
-0002962800 00000 n 
-0002964011 00000 n 
-0002966248 00000 n 
-0002966309 00000 n 
-0003088759 00000 n 
-0003088881 00000 n 
-0002969571 00000 n 
-0002969760 00000 n 
-0002970350 00000 n 
-0002969213 00000 n 
-0002966589 00000 n 
-0002969926 00000 n 
-0002969986 00000 n 
-0002970108 00000 n 
-0002970169 00000 n 
-0002970290 00000 n 
-0002972813 00000 n 
-0002973780 00000 n 
-0002972664 00000 n 
-0002970582 00000 n 
-0002972979 00000 n 
-0002973105 00000 n 
-0002973232 00000 n 
-0002973293 00000 n 
-0002973353 00000 n 
-0002973475 00000 n 
-0002973536 00000 n 
-0002973597 00000 n 
-0002973719 00000 n 
-0002976573 00000 n 
-0002977594 00000 n 
-0002976424 00000 n 
-0002973962 00000 n 
-0002976739 00000 n 
-0002976799 00000 n 
-0002976921 00000 n 
-0002977048 00000 n 
-0002977109 00000 n 
-0002977170 00000 n 
-0002977291 00000 n 
-0002977352 00000 n 
-0002977413 00000 n 
-0002977534 00000 n 
-0004865414 00000 n 
-0002980431 00000 n 
-0002981509 00000 n 
-0002980282 00000 n 
-0002977776 00000 n 
-0002980597 00000 n 
-0002980657 00000 n 
-0002980718 00000 n 
-0002980779 00000 n 
-0002980900 00000 n 
-0002980960 00000 n 
-0002981082 00000 n 
-0002981143 00000 n 
-0002981265 00000 n 
-0002981326 00000 n 
-0002981448 00000 n 
-0002984032 00000 n 
-0002985353 00000 n 
-0002983883 00000 n 
-0002981704 00000 n 
-0002984198 00000 n 
-0002984258 00000 n 
-0002984380 00000 n 
-0002984441 00000 n 
-0002984563 00000 n 
-0002984624 00000 n 
-0002984746 00000 n 
-0002984807 00000 n 
-0002984929 00000 n 
-0002984989 00000 n 
-0002985111 00000 n 
-0002985172 00000 n 
-0002985293 00000 n 
-0002988366 00000 n 
-0002989089 00000 n 
-0002988217 00000 n 
-0002985548 00000 n 
-0002988532 00000 n 
-0002988592 00000 n 
-0002988653 00000 n 
-0002988780 00000 n 
-0002988841 00000 n 
-0002988902 00000 n 
-0002989028 00000 n 
-0002992686 00000 n 
-0002992869 00000 n 
-0002993034 00000 n 
-0002993817 00000 n 
-0002992517 00000 n 
-0002989284 00000 n 
-0002993200 00000 n 
-0002993260 00000 n 
-0002993321 00000 n 
-0002993448 00000 n 
-0002993509 00000 n 
-0002993569 00000 n 
-0002993696 00000 n 
-0002993757 00000 n 
-0002996430 00000 n 
-0002997513 00000 n 
-0002996281 00000 n 
-0002994024 00000 n 
-0002996596 00000 n 
-0002996656 00000 n 
-0002996783 00000 n 
-0002996843 00000 n 
-0002996904 00000 n 
-0002997026 00000 n 
-0002997087 00000 n 
-0002997148 00000 n 
-0002997270 00000 n 
-0002997331 00000 n 
-0002997392 00000 n 
-0003000108 00000 n 
-0003001127 00000 n 
-0002999959 00000 n 
-0002997708 00000 n 
-0003000274 00000 n 
-0003000334 00000 n 
-0003000395 00000 n 
-0003000456 00000 n 
-0003000578 00000 n 
-0003000639 00000 n 
-0003000700 00000 n 
-0003000822 00000 n 
-0003000883 00000 n 
-0003000944 00000 n 
-0003001066 00000 n 
-0004865547 00000 n 
-0003003509 00000 n 
-0003004708 00000 n 
-0003003360 00000 n 
-0003001322 00000 n 
-0003003675 00000 n 
-0003003735 00000 n 
-0003003796 00000 n 
-0003003918 00000 n 
-0003003979 00000 n 
-0003004040 00000 n 
-0003004162 00000 n 
-0003004223 00000 n 
-0003004284 00000 n 
-0003004406 00000 n 
-0003004467 00000 n 
-0003004528 00000 n 
-0003004648 00000 n 
-0003008107 00000 n 
-0003008271 00000 n 
-0003008995 00000 n 
-0003007948 00000 n 
-0003004903 00000 n 
-0003008437 00000 n 
-0003008497 00000 n 
-0003008558 00000 n 
-0003008685 00000 n 
-0003008746 00000 n 
-0003008807 00000 n 
-0003008934 00000 n 
-0003011735 00000 n 
-0003011902 00000 n 
-0003012089 00000 n 
-0003012243 00000 n 
-0003013508 00000 n 
-0003011556 00000 n 
-0003009190 00000 n 
-0003012409 00000 n 
-0003012469 00000 n 
-0003012530 00000 n 
-0003012652 00000 n 
-0003012713 00000 n 
-0003012774 00000 n 
-0003012896 00000 n 
-0003012957 00000 n 
-0003013079 00000 n 
-0003013140 00000 n 
-0003013262 00000 n 
-0003013323 00000 n 
-0003013448 00000 n 
-0003016867 00000 n 
-0003017022 00000 n 
-0003017203 00000 n 
-0003017369 00000 n 
-0003018209 00000 n 
-0003016688 00000 n 
-0003013703 00000 n 
-0003017535 00000 n 
-0003017595 00000 n 
-0003017721 00000 n 
-0003017782 00000 n 
-0003017904 00000 n 
-0003017965 00000 n 
-0003018087 00000 n 
-0003018148 00000 n 
-0003021809 00000 n 
-0003021980 00000 n 
-0003022146 00000 n 
-0003022323 00000 n 
-0003023223 00000 n 
-0003021630 00000 n 
-0003018404 00000 n 
-0003022489 00000 n 
-0003022549 00000 n 
-0003022671 00000 n 
-0003022732 00000 n 
-0003022793 00000 n 
-0003022919 00000 n 
-0003022979 00000 n 
-0003023040 00000 n 
-0003023162 00000 n 
-0003026917 00000 n 
-0003027096 00000 n 
-0003031846 00000 n 
-0003027285 00000 n 
-0003028236 00000 n 
-0003026748 00000 n 
-0003023455 00000 n 
-0003027451 00000 n 
-0003027511 00000 n 
-0003027572 00000 n 
-0003027694 00000 n 
-0003027751 00000 n 
-0003027812 00000 n 
-0003027934 00000 n 
-0003027995 00000 n 
-0003028056 00000 n 
-0003028176 00000 n 
-0004865680 00000 n 
-0003032025 00000 n 
-0003032204 00000 n 
-0003032393 00000 n 
-0003033167 00000 n 
-0003031667 00000 n 
-0003028468 00000 n 
-0003032559 00000 n 
-0003032619 00000 n 
-0003032680 00000 n 
-0003032802 00000 n 
-0003032863 00000 n 
-0003032924 00000 n 
-0003033046 00000 n 
-0003033107 00000 n 
-0003037138 00000 n 
-0003037309 00000 n 
-0003037475 00000 n 
-0003037661 00000 n 
-0003037829 00000 n 
-0003038662 00000 n 
-0003036949 00000 n 
-0003033399 00000 n 
-0003037995 00000 n 
-0003038055 00000 n 
-0003038176 00000 n 
-0003038237 00000 n 
-0003038359 00000 n 
-0003038420 00000 n 
-0003038481 00000 n 
-0003038602 00000 n 
-0003041680 00000 n 
-0003041849 00000 n 
-0003042019 00000 n 
-0003042185 00000 n 
-0003043021 00000 n 
-0003041501 00000 n 
-0003038857 00000 n 
-0003042351 00000 n 
-0003042411 00000 n 
-0003042533 00000 n 
-0003042594 00000 n 
-0003042716 00000 n 
-0003042777 00000 n 
-0003042838 00000 n 
-0003042960 00000 n 
-0003046136 00000 n 
-0003046307 00000 n 
-0003046473 00000 n 
-0003046644 00000 n 
-0003046810 00000 n 
-0003046981 00000 n 
-0003047149 00000 n 
-0003048107 00000 n 
-0003045927 00000 n 
-0003043216 00000 n 
-0003047315 00000 n 
-0003047375 00000 n 
-0003047436 00000 n 
-0003047558 00000 n 
-0003047619 00000 n 
-0003047680 00000 n 
-0003047802 00000 n 
-0003047863 00000 n 
-0003047924 00000 n 
-0003048046 00000 n 
-0003051343 00000 n 
-0003051511 00000 n 
-0003051682 00000 n 
-0003052638 00000 n 
-0003051174 00000 n 
-0003048302 00000 n 
-0003051848 00000 n 
-0003051908 00000 n 
-0003051969 00000 n 
-0003052091 00000 n 
-0003052152 00000 n 
-0003052212 00000 n 
-0003052334 00000 n 
-0003052395 00000 n 
-0003052516 00000 n 
-0003052577 00000 n 
-0003056078 00000 n 
-0003056252 00000 n 
-0003056480 00000 n 
-0003056666 00000 n 
-0003056853 00000 n 
-0003057046 00000 n 
-0003058065 00000 n 
-0003055879 00000 n 
-0003052882 00000 n 
-0003057212 00000 n 
-0003057333 00000 n 
-0003057394 00000 n 
-0003057516 00000 n 
-0003057577 00000 n 
-0003057638 00000 n 
-0003057760 00000 n 
-0003057821 00000 n 
-0003057943 00000 n 
-0003058004 00000 n 
-0004865813 00000 n 
-0003061994 00000 n 
-0003062199 00000 n 
-0003062405 00000 n 
-0003062610 00000 n 
-0003062802 00000 n 
-0003063029 00000 n 
-0003063202 00000 n 
-0003063387 00000 n 
-0003067463 00000 n 
-0003063759 00000 n 
-0003064480 00000 n 
-0003061755 00000 n 
-0003058309 00000 n 
-0003063925 00000 n 
-0003064051 00000 n 
-0003064112 00000 n 
-0003064173 00000 n 
-0003064298 00000 n 
-0003064359 00000 n 
-0003064420 00000 n 
-0003063573 00000 n 
-0003067635 00000 n 
-0003067840 00000 n 
-0003068069 00000 n 
-0003068275 00000 n 
-0003068480 00000 n 
-0003069323 00000 n 
-0003067264 00000 n 
-0003064687 00000 n 
-0003068646 00000 n 
-0003068771 00000 n 
-0003068831 00000 n 
-0003068892 00000 n 
-0003069019 00000 n 
-0003069080 00000 n 
-0003069202 00000 n 
-0003069263 00000 n 
-0003072181 00000 n 
-0003073278 00000 n 
-0003072032 00000 n 
-0003069518 00000 n 
-0003072347 00000 n 
-0003072468 00000 n 
-0003072594 00000 n 
-0003072716 00000 n 
-0003072843 00000 n 
-0003072970 00000 n 
-0003073092 00000 n 
-0003073218 00000 n 
-0003076250 00000 n 
-0003076977 00000 n 
-0003076101 00000 n 
-0003073447 00000 n 
-0003076416 00000 n 
-0003076542 00000 n 
-0003076662 00000 n 
-0003076789 00000 n 
-0003076916 00000 n 
-0003079867 00000 n 
-0003081071 00000 n 
-0003079718 00000 n 
-0003077159 00000 n 
-0003080033 00000 n 
-0003080154 00000 n 
-0003080281 00000 n 
-0003080342 00000 n 
-0003080403 00000 n 
-0003080524 00000 n 
-0003080646 00000 n 
-0003080768 00000 n 
-0003080890 00000 n 
-0003081011 00000 n 
-0003083912 00000 n 
-0003088222 00000 n 
-0003091835 00000 n 
-0003092084 00000 n 
-0003092324 00000 n 
-0003092564 00000 n 
-0003088291 00000 n 
-0003089243 00000 n 
-0003083746 00000 n 
-0003081254 00000 n 
-0003088457 00000 n 
-0003088577 00000 n 
-0003088698 00000 n 
-0003088820 00000 n 
-0003088942 00000 n 
-0003089003 00000 n 
-0003089064 00000 n 
-0004865946 00000 n 
-0003084862 00000 n 
-0003084994 00000 n 
-0003085147 00000 n 
-0003085473 00000 n 
-0003085912 00000 n 
-0003086152 00000 n 
-0003086175 00000 n 
-0003088198 00000 n 
-0003092801 00000 n 
-0003093051 00000 n 
-0003093266 00000 n 
-0003093516 00000 n 
-0003093722 00000 n 
-0003093972 00000 n 
-0003094222 00000 n 
-0003094436 00000 n 
-0003094867 00000 n 
-0003095117 00000 n 
-0003095331 00000 n 
-0003095761 00000 n 
-0003096475 00000 n 
-0003091516 00000 n 
-0003089442 00000 n 
-0003095927 00000 n 
-0003095987 00000 n 
-0003096048 00000 n 
-0003096109 00000 n 
-0003096170 00000 n 
-0003096231 00000 n 
-0003094652 00000 n 
-0003095547 00000 n 
-0003096292 00000 n 
-0003096353 00000 n 
-0003096414 00000 n 
-0003100978 00000 n 
-0003100212 00000 n 
-0003100448 00000 n 
-0003101159 00000 n 
-0003100053 00000 n 
-0003096698 00000 n 
-0003100614 00000 n 
-0003100674 00000 n 
-0003100795 00000 n 
-0003100856 00000 n 
-0003100917 00000 n 
-0003101038 00000 n 
-0003101098 00000 n 
-0003103962 00000 n 
-0003104200 00000 n 
-0003104405 00000 n 
-0003104610 00000 n 
-0003105088 00000 n 
-0003105327 00000 n 
-0003105524 00000 n 
-0003105763 00000 n 
-0003105958 00000 n 
-0003106197 00000 n 
-0003106394 00000 n 
-0003106633 00000 n 
-0003106830 00000 n 
-0003107068 00000 n 
-0003107258 00000 n 
-0003107463 00000 n 
-0003107941 00000 n 
-0003108180 00000 n 
-0003108374 00000 n 
-0003108580 00000 n 
-0003109059 00000 n 
-0003109296 00000 n 
-0003109477 00000 n 
-0003109680 00000 n 
-0003110156 00000 n 
-0003110394 00000 n 
-0003110575 00000 n 
-0003110760 00000 n 
-0003110965 00000 n 
-0003111443 00000 n 
-0003111682 00000 n 
-0003111870 00000 n 
-0003112075 00000 n 
-0003112554 00000 n 
-0003112792 00000 n 
-0003112986 00000 n 
-0003113191 00000 n 
-0003113669 00000 n 
-0003113908 00000 n 
-0003114114 00000 n 
-0003114320 00000 n 
-0003114795 00000 n 
-0003115032 00000 n 
-0003115236 00000 n 
-0003115439 00000 n 
-0003118982 00000 n 
-0003119187 00000 n 
-0003119427 00000 n 
-0003115677 00000 n 
-0003116143 00000 n 
-0003103283 00000 n 
-0003101443 00000 n 
-0003115843 00000 n 
-0003116021 00000 n 
-0003104849 00000 n 
-0003107702 00000 n 
-0003108820 00000 n 
-0003109917 00000 n 
-0003111204 00000 n 
-0003112315 00000 n 
-0003113430 00000 n 
-0003116082 00000 n 
-0003114559 00000 n 
-0003193449 00000 n 
-0003193693 00000 n 
-0003196338 00000 n 
-0003196582 00000 n 
-0003196826 00000 n 
-0003199779 00000 n 
-0003200022 00000 n 
-0003200266 00000 n 
-0003203166 00000 n 
-0003203410 00000 n 
-0003203654 00000 n 
-0003206964 00000 n 
-0003119633 00000 n 
-0003119873 00000 n 
-0003120079 00000 n 
-0003120318 00000 n 
-0003120524 00000 n 
-0003120764 00000 n 
-0003120955 00000 n 
-0003121127 00000 n 
-0003121367 00000 n 
-0003121607 00000 n 
-0003121804 00000 n 
-0003122042 00000 n 
-0003122239 00000 n 
-0003122478 00000 n 
-0003122675 00000 n 
-0003122915 00000 n 
-0003123112 00000 n 
-0003123352 00000 n 
-0003123549 00000 n 
-0003123787 00000 n 
-0003123974 00000 n 
-0003124171 00000 n 
-0003124409 00000 n 
-0003124596 00000 n 
-0003124793 00000 n 
-0003125031 00000 n 
-0003125217 00000 n 
-0003125457 00000 n 
-0003125697 00000 n 
-0003125937 00000 n 
-0003126177 00000 n 
-0003126383 00000 n 
-0003126621 00000 n 
-0003126859 00000 n 
-0003127098 00000 n 
-0003127284 00000 n 
-0003127523 00000 n 
-0003127719 00000 n 
-0003127959 00000 n 
-0003128155 00000 n 
-0003128392 00000 n 
-0003128587 00000 n 
-0003128791 00000 n 
-0003133499 00000 n 
-0003133738 00000 n 
-0003133935 00000 n 
-0003134141 00000 n 
-0003134347 00000 n 
-0003134535 00000 n 
-0003134775 00000 n 
-0003134972 00000 n 
-0003135177 00000 n 
-0003128995 00000 n 
-0003130315 00000 n 
-0003118373 00000 n 
-0003116338 00000 n 
-0003129161 00000 n 
-0003129221 00000 n 
-0003129282 00000 n 
-0003129343 00000 n 
-0003129404 00000 n 
-0003129464 00000 n 
-0003129524 00000 n 
-0003129583 00000 n 
-0003129644 00000 n 
-0003129705 00000 n 
-0003129766 00000 n 
-0003129827 00000 n 
-0003129888 00000 n 
-0003129949 00000 n 
-0003130010 00000 n 
-0003130071 00000 n 
-0003130132 00000 n 
-0003130193 00000 n 
-0003130254 00000 n 
-0003207147 00000 n 
-0003207330 00000 n 
-0003207513 00000 n 
-0003210707 00000 n 
-0003210890 00000 n 
-0003135382 00000 n 
-0003135622 00000 n 
-0003135819 00000 n 
-0003136024 00000 n 
-0003136229 00000 n 
-0003136417 00000 n 
-0003136657 00000 n 
-0003136863 00000 n 
-0003137103 00000 n 
-0003137308 00000 n 
-0003137548 00000 n 
-0003137786 00000 n 
-0003137975 00000 n 
-0003138213 00000 n 
-0003138402 00000 n 
-0003138639 00000 n 
-0003138827 00000 n 
-0003139064 00000 n 
-0003139253 00000 n 
-0003139491 00000 n 
-0003139687 00000 n 
-0003139925 00000 n 
-0003140122 00000 n 
-0003140360 00000 n 
-0003140557 00000 n 
-0003140795 00000 n 
-0003140992 00000 n 
-0003141229 00000 n 
-0003141426 00000 n 
-0003141663 00000 n 
-0003141859 00000 n 
-0003142096 00000 n 
-0003142282 00000 n 
-0003142449 00000 n 
-0003142687 00000 n 
-0003142880 00000 n 
-0003143047 00000 n 
-0003143285 00000 n 
-0003143491 00000 n 
-0003143728 00000 n 
-0003143932 00000 n 
-0003144170 00000 n 
-0003149109 00000 n 
-0003149347 00000 n 
-0003144373 00000 n 
-0003144660 00000 n 
-0003132840 00000 n 
-0003130498 00000 n 
-0003144539 00000 n 
-0003144599 00000 n 
-0003211134 00000 n 
-0003214884 00000 n 
-0003215133 00000 n 
-0003218311 00000 n 
-0003218499 00000 n 
-0003218682 00000 n 
-0003218865 00000 n 
-0003219109 00000 n 
-0003221994 00000 n 
-0003222238 00000 n 
-0003222481 00000 n 
-0003222724 00000 n 
-0003225749 00000 n 
-0003225993 00000 n 
-0003226236 00000 n 
-0003230001 00000 n 
-0003230244 00000 n 
-0003230488 00000 n 
-0003234271 00000 n 
-0003234454 00000 n 
-0003149553 00000 n 
-0003149792 00000 n 
-0003149979 00000 n 
-0003150176 00000 n 
-0003150389 00000 n 
-0003150570 00000 n 
-0003150810 00000 n 
-0003150997 00000 n 
-0003151194 00000 n 
-0003151403 00000 n 
-0003151584 00000 n 
-0003151824 00000 n 
-0003152011 00000 n 
-0003152217 00000 n 
-0003152414 00000 n 
-0003152626 00000 n 
-0003152805 00000 n 
-0003152978 00000 n 
-0003153218 00000 n 
-0003153405 00000 n 
-0003153611 00000 n 
-0003153807 00000 n 
-0003154020 00000 n 
-0003154198 00000 n 
-0003154370 00000 n 
-0003154610 00000 n 
-0003154807 00000 n 
-0003155013 00000 n 
-0003155210 00000 n 
-0003155389 00000 n 
-0003155562 00000 n 
-0003155802 00000 n 
-0003155999 00000 n 
-0003156205 00000 n 
-0003156402 00000 n 
-0003156579 00000 n 
-0003156750 00000 n 
-0003156990 00000 n 
-0003157176 00000 n 
-0003157373 00000 n 
-0003157765 00000 n 
-0003157976 00000 n 
-0003158165 00000 n 
-0003158405 00000 n 
-0003158592 00000 n 
-0003158789 00000 n 
-0003159183 00000 n 
-0003159396 00000 n 
-0003159585 00000 n 
-0003159822 00000 n 
-0003160028 00000 n 
-0003160199 00000 n 
-0003160366 00000 n 
-0003160604 00000 n 
-0003160840 00000 n 
-0003161045 00000 n 
-0003161283 00000 n 
-0003161488 00000 n 
-0003161728 00000 n 
-0003161968 00000 n 
-0003162161 00000 n 
-0003162367 00000 n 
-0003162607 00000 n 
-0003162844 00000 n 
-0003163049 00000 n 
-0003163285 00000 n 
-0003166796 00000 n 
-0003167034 00000 n 
-0003167239 00000 n 
-0003163488 00000 n 
-0003163775 00000 n 
-0003148260 00000 n 
-0003144830 00000 n 
-0003163654 00000 n 
-0003157570 00000 n 
-0003158986 00000 n 
-0003163714 00000 n 
-0004866079 00000 n 
-0003234637 00000 n 
-0003234820 00000 n 
-0003240172 00000 n 
-0003240416 00000 n 
-0003240660 00000 n 
-0003245742 00000 n 
-0003245985 00000 n 
-0003246229 00000 n 
-0003250982 00000 n 
-0003251226 00000 n 
-0003251409 00000 n 
-0003255129 00000 n 
-0003255312 00000 n 
-0003259497 00000 n 
-0003259741 00000 n 
-0003167411 00000 n 
-0003167648 00000 n 
-0003167841 00000 n 
-0003168079 00000 n 
-0003168285 00000 n 
-0003168523 00000 n 
-0003168716 00000 n 
-0003168954 00000 n 
-0003169141 00000 n 
-0003169347 00000 n 
-0003169584 00000 n 
-0003169777 00000 n 
-0003169962 00000 n 
-0003170202 00000 n 
-0003170440 00000 n 
-0003170646 00000 n 
-0003170884 00000 n 
-0003171122 00000 n 
-0003171360 00000 n 
-0003171600 00000 n 
-0003171839 00000 n 
-0003172045 00000 n 
-0003172283 00000 n 
-0003172489 00000 n 
-0003172727 00000 n 
-0003172967 00000 n 
-0003173172 00000 n 
-0003173411 00000 n 
-0003173650 00000 n 
-0003177362 00000 n 
-0003173889 00000 n 
-0003174906 00000 n 
-0003166327 00000 n 
-0003164026 00000 n 
-0003174055 00000 n 
-0003174115 00000 n 
-0003174176 00000 n 
-0003174236 00000 n 
-0003174296 00000 n 
-0003174357 00000 n 
-0003174418 00000 n 
-0003174479 00000 n 
-0003174540 00000 n 
-0003174601 00000 n 
-0003174662 00000 n 
-0003174723 00000 n 
-0003174784 00000 n 
-0003174845 00000 n 
-0003259985 00000 n 
-0003260168 00000 n 
-0003265868 00000 n 
-0003266048 00000 n 
-0003266230 00000 n 
-0003271547 00000 n 
-0003271794 00000 n 
-0003177602 00000 n 
-0003177842 00000 n 
-0003178082 00000 n 
-0003178321 00000 n 
-0003178560 00000 n 
-0003178799 00000 n 
-0003179039 00000 n 
-0003179245 00000 n 
-0003179485 00000 n 
-0003179691 00000 n 
-0003179897 00000 n 
-0003180137 00000 n 
-0003180342 00000 n 
-0003180752 00000 n 
-0003180992 00000 n 
-0003181198 00000 n 
-0003181609 00000 n 
-0003181849 00000 n 
-0003182054 00000 n 
-0003182465 00000 n 
-0003182705 00000 n 
-0003182911 00000 n 
-0003183322 00000 n 
-0003183561 00000 n 
-0003183767 00000 n 
-0003184005 00000 n 
-0003184209 00000 n 
-0003184413 00000 n 
-0003185187 00000 n 
-0003176893 00000 n 
-0003175130 00000 n 
-0003184579 00000 n 
-0003184639 00000 n 
-0003184700 00000 n 
-0003184761 00000 n 
-0003184821 00000 n 
-0003184882 00000 n 
-0003184943 00000 n 
-0003185004 00000 n 
-0003185065 00000 n 
-0003185126 00000 n 
-0003180548 00000 n 
-0003181404 00000 n 
-0003182260 00000 n 
-0003183117 00000 n 
-0003271982 00000 n 
-0003274700 00000 n 
-0003274827 00000 n 
-0003274949 00000 n 
-0003189010 00000 n 
-0003189202 00000 n 
-0003189396 00000 n 
-0003189579 00000 n 
-0003189734 00000 n 
-0003189973 00000 n 
-0003190156 00000 n 
-0003190345 00000 n 
-0003190693 00000 n 
-0003188791 00000 n 
-0003185383 00000 n 
-0003190511 00000 n 
-0003190571 00000 n 
-0003190632 00000 n 
-0003193162 00000 n 
-0003193815 00000 n 
-0003193013 00000 n 
-0003190910 00000 n 
-0003193328 00000 n 
-0003193388 00000 n 
-0003193510 00000 n 
-0003193571 00000 n 
-0003193632 00000 n 
-0003193754 00000 n 
-0003195990 00000 n 
-0003197009 00000 n 
-0003195841 00000 n 
-0003193997 00000 n 
-0003196156 00000 n 
-0003196216 00000 n 
-0003196277 00000 n 
-0003196399 00000 n 
-0003196460 00000 n 
-0003196521 00000 n 
-0003196643 00000 n 
-0003196704 00000 n 
-0003196765 00000 n 
-0003196887 00000 n 
-0003196948 00000 n 
-0003199492 00000 n 
-0003200388 00000 n 
-0003199343 00000 n 
-0003197191 00000 n 
-0003199658 00000 n 
-0003199718 00000 n 
-0003199840 00000 n 
-0003199901 00000 n 
-0003199962 00000 n 
-0003200083 00000 n 
-0003200144 00000 n 
-0003200205 00000 n 
-0003200327 00000 n 
-0004866212 00000 n 
-0003202818 00000 n 
-0003203774 00000 n 
-0003202669 00000 n 
-0003200570 00000 n 
-0003202984 00000 n 
-0003203044 00000 n 
-0003203105 00000 n 
-0003203227 00000 n 
-0003203288 00000 n 
-0003203349 00000 n 
-0003203471 00000 n 
-0003203532 00000 n 
-0003203593 00000 n 
-0003203714 00000 n 
-0003206616 00000 n 
-0003207633 00000 n 
-0003206467 00000 n 
-0003203956 00000 n 
-0003206782 00000 n 
-0003206842 00000 n 
-0003206903 00000 n 
-0003207025 00000 n 
-0003207086 00000 n 
-0003207208 00000 n 
-0003207269 00000 n 
-0003207391 00000 n 
-0003207452 00000 n 
-0003207573 00000 n 
-0003210420 00000 n 
-0003211261 00000 n 
-0003210271 00000 n 
-0003207828 00000 n 
-0003210586 00000 n 
-0003210646 00000 n 
-0003210768 00000 n 
-0003210829 00000 n 
-0003210951 00000 n 
-0003211012 00000 n 
-0003211073 00000 n 
-0003211200 00000 n 
-0003214536 00000 n 
-0003215321 00000 n 
-0003214387 00000 n 
-0003211456 00000 n 
-0003214702 00000 n 
-0003214762 00000 n 
-0003214823 00000 n 
-0003214950 00000 n 
-0003215011 00000 n 
-0003215072 00000 n 
-0003215199 00000 n 
-0003215260 00000 n 
-0003218024 00000 n 
-0003219229 00000 n 
-0003217875 00000 n 
-0003215516 00000 n 
-0003218190 00000 n 
-0003218250 00000 n 
-0003218377 00000 n 
-0003218438 00000 n 
-0003218560 00000 n 
-0003218621 00000 n 
-0003218743 00000 n 
-0003218804 00000 n 
-0003218926 00000 n 
-0003218987 00000 n 
-0003219048 00000 n 
-0003219169 00000 n 
-0003221707 00000 n 
-0003222844 00000 n 
-0003221558 00000 n 
-0003219424 00000 n 
-0003221873 00000 n 
-0003221933 00000 n 
-0003222055 00000 n 
-0003222116 00000 n 
-0003222177 00000 n 
-0003222299 00000 n 
-0003222360 00000 n 
-0003222421 00000 n 
-0003222541 00000 n 
-0003222602 00000 n 
-0003222663 00000 n 
-0003222784 00000 n 
-0004866345 00000 n 
-0003225401 00000 n 
-0003226358 00000 n 
-0003225252 00000 n 
-0003223039 00000 n 
-0003225567 00000 n 
-0003225627 00000 n 
-0003225688 00000 n 
-0003225810 00000 n 
-0003225871 00000 n 
-0003225932 00000 n 
-0003226054 00000 n 
-0003226114 00000 n 
-0003226175 00000 n 
-0003226297 00000 n 
-0003229134 00000 n 
-0003229299 00000 n 
-0003229466 00000 n 
-0003229653 00000 n 
-0003230609 00000 n 
-0003228955 00000 n 
-0003226553 00000 n 
-0003229819 00000 n 
-0003229879 00000 n 
-0003229940 00000 n 
-0003230061 00000 n 
-0003230122 00000 n 
-0003230183 00000 n 
-0003230305 00000 n 
-0003230366 00000 n 
-0003230427 00000 n 
-0003230548 00000 n 
-0003233804 00000 n 
-0003233984 00000 n 
-0003235063 00000 n 
-0003233645 00000 n 
-0003230804 00000 n 
-0003234150 00000 n 
-0003234210 00000 n 
-0003234332 00000 n 
-0003234393 00000 n 
-0003234515 00000 n 
-0003234576 00000 n 
-0003234698 00000 n 
-0003234759 00000 n 
-0003234881 00000 n 
-0003234941 00000 n 
-0003235002 00000 n 
-0003238678 00000 n 
-0003238859 00000 n 
-0003239038 00000 n 
-0003239211 00000 n 
-0003239594 00000 n 
-0003239773 00000 n 
-0003239946 00000 n 
-0003240843 00000 n 
-0003238459 00000 n 
-0003235258 00000 n 
-0003240112 00000 n 
-0003240233 00000 n 
-0003240294 00000 n 
-0003240355 00000 n 
-0003240477 00000 n 
-0003240538 00000 n 
-0003240599 00000 n 
-0003239403 00000 n 
-0003240721 00000 n 
-0003240782 00000 n 
-0003243989 00000 n 
-0003244373 00000 n 
-0003244552 00000 n 
-0003244725 00000 n 
-0003244916 00000 n 
-0003245094 00000 n 
-0003245264 00000 n 
-0003249920 00000 n 
-0003245455 00000 n 
-0003246349 00000 n 
-0003243760 00000 n 
-0003241075 00000 n 
-0003245621 00000 n 
-0003245681 00000 n 
-0003244181 00000 n 
-0003245803 00000 n 
-0003245864 00000 n 
-0003245925 00000 n 
-0003246046 00000 n 
-0003246107 00000 n 
-0003246168 00000 n 
-0003246289 00000 n 
-0003250109 00000 n 
-0003250298 00000 n 
-0003250469 00000 n 
-0003250635 00000 n 
-0003251529 00000 n 
-0003249731 00000 n 
-0003246569 00000 n 
-0003250801 00000 n 
-0003250861 00000 n 
-0003250922 00000 n 
-0003251043 00000 n 
-0003251104 00000 n 
-0003251165 00000 n 
-0003251287 00000 n 
-0003251348 00000 n 
-0003251469 00000 n 
-0004866478 00000 n 
-0003254610 00000 n 
-0003254781 00000 n 
-0003255495 00000 n 
-0003254451 00000 n 
-0003251761 00000 n 
-0003254947 00000 n 
-0003255007 00000 n 
-0003255068 00000 n 
-0003255190 00000 n 
-0003255251 00000 n 
-0003255373 00000 n 
-0003255434 00000 n 
-0003258380 00000 n 
-0003258618 00000 n 
-0003258857 00000 n 
-0003259031 00000 n 
-0003259271 00000 n 
-0003260290 00000 n 
-0003258191 00000 n 
-0003255690 00000 n 
-0003259437 00000 n 
-0003259558 00000 n 
-0003259619 00000 n 
-0003259680 00000 n 
-0003259802 00000 n 
-0003259863 00000 n 
-0003259924 00000 n 
-0003260046 00000 n 
-0003260107 00000 n 
-0003260229 00000 n 
-0003263959 00000 n 
-0003264145 00000 n 
-0003264331 00000 n 
-0003264524 00000 n 
-0003264728 00000 n 
-0003264934 00000 n 
-0003265139 00000 n 
-0003265520 00000 n 
-0003266295 00000 n 
-0003263730 00000 n 
-0003260485 00000 n 
-0003265686 00000 n 
-0003265746 00000 n 
-0003265807 00000 n 
-0003265927 00000 n 
-0003265988 00000 n 
-0003266108 00000 n 
-0003266169 00000 n 
-0003265330 00000 n 
-0003269907 00000 n 
-0003270146 00000 n 
-0003270363 00000 n 
-0003270549 00000 n 
-0003270921 00000 n 
-0003271138 00000 n 
-0003272102 00000 n 
-0003269698 00000 n 
-0003266502 00000 n 
-0003271304 00000 n 
-0003271364 00000 n 
-0003271425 00000 n 
-0003271486 00000 n 
-0003271612 00000 n 
-0003271673 00000 n 
-0003271734 00000 n 
-0003270735 00000 n 
-0003271860 00000 n 
-0003271921 00000 n 
-0003272042 00000 n 
-0003277570 00000 n 
-0003282036 00000 n 
-0003274474 00000 n 
-0003275437 00000 n 
-0003274325 00000 n 
-0003272310 00000 n 
-0003274640 00000 n 
-0003274766 00000 n 
-0003274888 00000 n 
-0003275015 00000 n 
-0003275076 00000 n 
-0003275137 00000 n 
-0003275196 00000 n 
-0003275257 00000 n 
-0003282105 00000 n 
-0003282363 00000 n 
-0003282622 00000 n 
-0003282838 00000 n 
-0003283095 00000 n 
-0003283353 00000 n 
-0003283612 00000 n 
-0003283871 00000 n 
-0003284087 00000 n 
-0003284346 00000 n 
-0003284605 00000 n 
-0003284864 00000 n 
-0003285080 00000 n 
-0003285339 00000 n 
-0003285597 00000 n 
-0003285856 00000 n 
-0003286690 00000 n 
-0003277254 00000 n 
-0003275620 00000 n 
-0003286022 00000 n 
-0003286082 00000 n 
-0003286143 00000 n 
-0003286204 00000 n 
-0003286265 00000 n 
-0003286326 00000 n 
-0003286387 00000 n 
-0003286448 00000 n 
-0003286509 00000 n 
-0003286570 00000 n 
-0004866611 00000 n 
-0003278492 00000 n 
-0003278624 00000 n 
-0003278777 00000 n 
-0003279111 00000 n 
-0003279559 00000 n 
-0003279799 00000 n 
-0003279822 00000 n 
-0003282012 00000 n 
-0003289192 00000 n 
-0003289404 00000 n 
-0003289628 00000 n 
-0003289883 00000 n 
-0003290138 00000 n 
-0003290350 00000 n 
-0003290574 00000 n 
-0003290830 00000 n 
-0003291086 00000 n 
-0003291339 00000 n 
-0003291594 00000 n 
-0003291849 00000 n 
-0003292105 00000 n 
-0003292321 00000 n 
-0003292546 00000 n 
-0003292800 00000 n 
-0003293055 00000 n 
-0003293310 00000 n 
-0003293566 00000 n 
-0003293822 00000 n 
-0003294077 00000 n 
-0003294333 00000 n 
-0003294588 00000 n 
-0003294844 00000 n 
-0003295097 00000 n 
-0003296295 00000 n 
-0003288803 00000 n 
-0003286902 00000 n 
-0003295263 00000 n 
-0003295382 00000 n 
-0003295443 00000 n 
-0003295504 00000 n 
-0003295565 00000 n 
-0003295626 00000 n 
-0003295687 00000 n 
-0003295748 00000 n 
-0003295809 00000 n 
-0003295870 00000 n 
-0003295931 00000 n 
-0003295992 00000 n 
-0003296053 00000 n 
-0003296114 00000 n 
-0003296175 00000 n 
-0003298688 00000 n 
-0003302379 00000 n 
-0003302448 00000 n 
-0003302642 00000 n 
-0003302874 00000 n 
-0003303106 00000 n 
-0003303338 00000 n 
-0003303536 00000 n 
-0003303768 00000 n 
-0003303966 00000 n 
-0003304198 00000 n 
-0003304392 00000 n 
-0003304624 00000 n 
-0003304816 00000 n 
-0003305047 00000 n 
-0003305279 00000 n 
-0003305511 00000 n 
-0003305742 00000 n 
-0003305947 00000 n 
-0003306179 00000 n 
-0003306383 00000 n 
-0003310470 00000 n 
-0003310700 00000 n 
-0003306614 00000 n 
-0003307628 00000 n 
-0003298332 00000 n 
-0003296505 00000 n 
-0003306780 00000 n 
-0003306899 00000 n 
-0003306960 00000 n 
-0003307021 00000 n 
-0003307082 00000 n 
-0003307143 00000 n 
-0003307204 00000 n 
-0003307264 00000 n 
-0003307323 00000 n 
-0003307384 00000 n 
-0003307445 00000 n 
-0003307506 00000 n 
-0003307567 00000 n 
-0003299483 00000 n 
-0003299615 00000 n 
-0003299768 00000 n 
-0003300058 00000 n 
-0003300459 00000 n 
-0003300699 00000 n 
-0003300722 00000 n 
-0003302355 00000 n 
-0003310897 00000 n 
-0003311129 00000 n 
-0003311319 00000 n 
-0003311525 00000 n 
-0003311934 00000 n 
-0003312160 00000 n 
-0003312352 00000 n 
-0003312580 00000 n 
-0003312774 00000 n 
-0003313006 00000 n 
-0003313197 00000 n 
-0003313389 00000 n 
-0003313594 00000 n 
-0003313822 00000 n 
-0003314054 00000 n 
-0003314259 00000 n 
-0003314484 00000 n 
-0003314742 00000 n 
-0003315000 00000 n 
-0003315190 00000 n 
-0003315415 00000 n 
-0003315672 00000 n 
-0003315930 00000 n 
-0003316445 00000 n 
-0003316702 00000 n 
-0003316959 00000 n 
-0003317148 00000 n 
-0003317373 00000 n 
-0003317597 00000 n 
-0003317803 00000 n 
-0003318025 00000 n 
-0003318229 00000 n 
-0003318420 00000 n 
-0003319374 00000 n 
-0003309961 00000 n 
-0003307853 00000 n 
-0003318586 00000 n 
-0003318646 00000 n 
-0003318707 00000 n 
-0003318768 00000 n 
-0003311731 00000 n 
-0003318829 00000 n 
-0003318890 00000 n 
-0003318951 00000 n 
-0003319012 00000 n 
-0003319192 00000 n 
-0003316188 00000 n 
-0003319252 00000 n 
-0003319313 00000 n 
-0003433585 00000 n 
-0003447128 00000 n 
-0003447311 00000 n 
-0003368761 00000 n 
-0003368883 00000 n 
-0003368948 00000 n 
-0003369013 00000 n 
-0003369135 00000 n 
-0003369201 00000 n 
-0003369267 00000 n 
-0003369333 00000 n 
-0003369399 00000 n 
-0003369526 00000 n 
-0003374201 00000 n 
-0003322141 00000 n 
-0003322364 00000 n 
-0003322553 00000 n 
-0003322777 00000 n 
-0003322966 00000 n 
-0003323190 00000 n 
-0003323380 00000 n 
-0003323585 00000 n 
-0003323810 00000 n 
-0003324003 00000 n 
-0003324228 00000 n 
-0003324452 00000 n 
-0003324677 00000 n 
-0003324901 00000 n 
-0003325126 00000 n 
-0003325351 00000 n 
-0003325576 00000 n 
-0003325781 00000 n 
-0003325985 00000 n 
-0003326210 00000 n 
-0003326403 00000 n 
-0003326628 00000 n 
-0003326817 00000 n 
-0003327042 00000 n 
-0003327238 00000 n 
-0003327463 00000 n 
-0003327668 00000 n 
-0003327893 00000 n 
-0003328086 00000 n 
-0003328311 00000 n 
-0003328503 00000 n 
-0003328727 00000 n 
-0003328952 00000 n 
-0003329177 00000 n 
-0003329401 00000 n 
-0003329626 00000 n 
-0003329851 00000 n 
-0003333738 00000 n 
-0003333962 00000 n 
-0003334167 00000 n 
-0003334392 00000 n 
-0003334597 00000 n 
-0003330074 00000 n 
-0003331029 00000 n 
-0003321622 00000 n 
-0003319597 00000 n 
-0003330240 00000 n 
-0003330300 00000 n 
-0003330361 00000 n 
-0003330422 00000 n 
-0003330483 00000 n 
-0003330544 00000 n 
-0003330605 00000 n 
-0003330666 00000 n 
-0003330726 00000 n 
-0003330787 00000 n 
-0003330848 00000 n 
-0003330908 00000 n 
-0003330969 00000 n 
-0003374506 00000 n 
-0003374628 00000 n 
-0003374877 00000 n 
-0003378097 00000 n 
-0003378280 00000 n 
-0003378462 00000 n 
-0003378584 00000 n 
-0003378705 00000 n 
-0003378827 00000 n 
-0003381872 00000 n 
-0003334822 00000 n 
-0003335047 00000 n 
-0003335238 00000 n 
-0003335462 00000 n 
-0003335687 00000 n 
-0003335912 00000 n 
-0003336136 00000 n 
-0003336360 00000 n 
-0003336585 00000 n 
-0003336791 00000 n 
-0003336996 00000 n 
-0003337221 00000 n 
-0003337426 00000 n 
-0003337650 00000 n 
-0003337839 00000 n 
-0003338064 00000 n 
-0003338255 00000 n 
-0003338479 00000 n 
-0003338668 00000 n 
-0003338858 00000 n 
-0003339083 00000 n 
-0003339273 00000 n 
-0003339464 00000 n 
-0003340300 00000 n 
-0003333319 00000 n 
-0003331240 00000 n 
-0003339630 00000 n 
-0003339690 00000 n 
-0003339751 00000 n 
-0003339812 00000 n 
-0003339873 00000 n 
-0003339934 00000 n 
-0003339995 00000 n 
-0003340056 00000 n 
-0003340117 00000 n 
-0003340178 00000 n 
-0003340239 00000 n 
-0003382119 00000 n 
-0003382302 00000 n 
-0003382424 00000 n 
-0003343517 00000 n 
-0003343707 00000 n 
-0003343933 00000 n 
-0003343358 00000 n 
-0003340496 00000 n 
-0003343873 00000 n 
-0004866744 00000 n 
-0003346823 00000 n 
-0003347012 00000 n 
-0003347237 00000 n 
-0003347428 00000 n 
-0003347653 00000 n 
-0003347859 00000 n 
-0003348085 00000 n 
-0003346624 00000 n 
-0003344087 00000 n 
-0003348025 00000 n 
-0003351291 00000 n 
-0003351510 00000 n 
-0003351737 00000 n 
-0003351965 00000 n 
-0003352429 00000 n 
-0003352648 00000 n 
-0003356683 00000 n 
-0003353041 00000 n 
-0003353267 00000 n 
-0003351062 00000 n 
-0003348265 00000 n 
-0003353207 00000 n 
-0003352197 00000 n 
-0003352845 00000 n 
-0003985654 00000 n 
-0003420570 00000 n 
-0003420509 00000 n 
-0003356873 00000 n 
-0003357063 00000 n 
-0003357291 00000 n 
-0003357522 00000 n 
-0003357747 00000 n 
-0003357973 00000 n 
-0003356484 00000 n 
-0003353421 00000 n 
-0003357913 00000 n 
-0003441181 00000 n 
-0003405385 00000 n 
-0003361014 00000 n 
-0003361239 00000 n 
-0003361464 00000 n 
-0003361690 00000 n 
-0003360845 00000 n 
-0003358191 00000 n 
-0003361630 00000 n 
-0003364773 00000 n 
-0003364998 00000 n 
-0003365224 00000 n 
-0003364614 00000 n 
-0003361919 00000 n 
-0003365164 00000 n 
-0003368092 00000 n 
-0003368283 00000 n 
-0003368474 00000 n 
-0003369709 00000 n 
-0003367923 00000 n 
-0003365453 00000 n 
-0003368640 00000 n 
-0003368700 00000 n 
-0003368822 00000 n 
-0003369074 00000 n 
-0003369465 00000 n 
-0003369587 00000 n 
-0003369648 00000 n 
-0004866877 00000 n 
-0003373239 00000 n 
-0003373464 00000 n 
-0003373689 00000 n 
-0003373914 00000 n 
-0003375002 00000 n 
-0003373060 00000 n 
-0003369956 00000 n 
-0003374080 00000 n 
-0003374140 00000 n 
-0003374262 00000 n 
-0003374323 00000 n 
-0003374384 00000 n 
-0003374445 00000 n 
-0003374567 00000 n 
-0003374694 00000 n 
-0003374755 00000 n 
-0003374816 00000 n 
-0003374942 00000 n 
-0003377810 00000 n 
-0003378954 00000 n 
-0003377661 00000 n 
-0003375209 00000 n 
-0003377976 00000 n 
-0003378036 00000 n 
-0003378158 00000 n 
-0003378219 00000 n 
-0003378340 00000 n 
-0003378401 00000 n 
-0003378523 00000 n 
-0003378644 00000 n 
-0003378766 00000 n 
-0003378893 00000 n 
-0003381434 00000 n 
-0003385067 00000 n 
-0003388779 00000 n 
-0003381646 00000 n 
-0003382726 00000 n 
-0003381275 00000 n 
-0003379137 00000 n 
-0003381812 00000 n 
-0003381937 00000 n 
-0003381997 00000 n 
-0003382058 00000 n 
-0003382180 00000 n 
-0003382241 00000 n 
-0003382363 00000 n 
-0003382485 00000 n 
-0003382546 00000 n 
-0003388848 00000 n 
-0003389066 00000 n 
-0003389297 00000 n 
-0003389487 00000 n 
-0003389681 00000 n 
-0003389913 00000 n 
-0003390145 00000 n 
-0003390377 00000 n 
-0003390575 00000 n 
-0003390807 00000 n 
-0003391005 00000 n 
-0003391237 00000 n 
-0003391434 00000 n 
-0003391664 00000 n 
-0003391851 00000 n 
-0003392083 00000 n 
-0003392315 00000 n 
-0003392547 00000 n 
-0003392752 00000 n 
-0003392984 00000 n 
-0003393188 00000 n 
-0003393419 00000 n 
-0003394376 00000 n 
-0003384691 00000 n 
-0003382921 00000 n 
-0003393585 00000 n 
-0003393645 00000 n 
-0003393706 00000 n 
-0003393767 00000 n 
-0003393828 00000 n 
-0003393889 00000 n 
-0003393950 00000 n 
-0003394011 00000 n 
-0003394072 00000 n 
-0003394133 00000 n 
-0003394193 00000 n 
-0003394254 00000 n 
-0003394315 00000 n 
-0003385861 00000 n 
-0003385993 00000 n 
-0003386146 00000 n 
-0003386436 00000 n 
-0003386839 00000 n 
-0003387079 00000 n 
-0003387102 00000 n 
-0003388755 00000 n 
-0003397538 00000 n 
-0003397769 00000 n 
-0003397966 00000 n 
-0003398196 00000 n 
-0003398392 00000 n 
-0003398609 00000 n 
-0003398841 00000 n 
-0003399032 00000 n 
-0003399221 00000 n 
-0003399453 00000 n 
-0003399644 00000 n 
-0003399875 00000 n 
-0003400064 00000 n 
-0003400269 00000 n 
-0003400678 00000 n 
-0003400905 00000 n 
-0003401098 00000 n 
-0003401325 00000 n 
-0003401557 00000 n 
-0003401789 00000 n 
-0003401983 00000 n 
-0003402215 00000 n 
-0003402406 00000 n 
-0003402599 00000 n 
-0003402805 00000 n 
-0003403033 00000 n 
-0003403265 00000 n 
-0003403471 00000 n 
-0003403664 00000 n 
-0003403868 00000 n 
-0003404100 00000 n 
-0003404305 00000 n 
-0003405507 00000 n 
-0003397069 00000 n 
-0003394588 00000 n 
-0003404471 00000 n 
-0003404531 00000 n 
-0003404592 00000 n 
-0003404653 00000 n 
-0003404714 00000 n 
-0003404775 00000 n 
-0003400474 00000 n 
-0003404836 00000 n 
-0003404897 00000 n 
-0003404958 00000 n 
-0003405019 00000 n 
-0003405080 00000 n 
-0003405141 00000 n 
-0003405202 00000 n 
-0003405263 00000 n 
-0003405324 00000 n 
-0003405446 00000 n 
-0003409336 00000 n 
-0003409519 00000 n 
-0003408798 00000 n 
-0003411779 00000 n 
-0003415865 00000 n 
-0003408988 00000 n 
-0003409820 00000 n 
-0003408639 00000 n 
-0003405732 00000 n 
-0003409154 00000 n 
-0003409214 00000 n 
-0003409275 00000 n 
-0003409397 00000 n 
-0003409458 00000 n 
-0003409580 00000 n 
-0003409641 00000 n 
-0004867010 00000 n 
-0003415934 00000 n 
-0003416153 00000 n 
-0003416371 00000 n 
-0003416599 00000 n 
-0003416818 00000 n 
-0003417012 00000 n 
-0003417240 00000 n 
-0003417468 00000 n 
-0003417696 00000 n 
-0003417894 00000 n 
-0003418122 00000 n 
-0003418320 00000 n 
-0003418548 00000 n 
-0003418744 00000 n 
-0003418971 00000 n 
-0003419199 00000 n 
-0003419427 00000 n 
-0003419630 00000 n 
-0003424001 00000 n 
-0003424229 00000 n 
-0003419856 00000 n 
-0003420814 00000 n 
-0003411433 00000 n 
-0003410002 00000 n 
-0003420022 00000 n 
-0003420082 00000 n 
-0003420143 00000 n 
-0003420204 00000 n 
-0003420265 00000 n 
-0003420326 00000 n 
-0003420387 00000 n 
-0003420448 00000 n 
-0003420631 00000 n 
-0003420692 00000 n 
-0003420753 00000 n 
-0003412707 00000 n 
-0003412839 00000 n 
-0003412992 00000 n 
-0003413294 00000 n 
-0003413707 00000 n 
-0003413947 00000 n 
-0003413970 00000 n 
-0003415841 00000 n 
-0003424456 00000 n 
-0003424682 00000 n 
-0003424910 00000 n 
-0003425114 00000 n 
-0003425341 00000 n 
-0003425546 00000 n 
-0003425774 00000 n 
-0003425962 00000 n 
-0003426190 00000 n 
-0003426417 00000 n 
-0003426607 00000 n 
-0003426833 00000 n 
-0003427025 00000 n 
-0003427215 00000 n 
-0003427441 00000 n 
-0003427630 00000 n 
-0003427858 00000 n 
-0003428049 00000 n 
-0003428240 00000 n 
-0003428468 00000 n 
-0003428659 00000 n 
-0003428857 00000 n 
-0003429085 00000 n 
-0003429313 00000 n 
-0003429511 00000 n 
-0003429739 00000 n 
-0003429929 00000 n 
-0003430135 00000 n 
-0003430545 00000 n 
-0003430772 00000 n 
-0003430965 00000 n 
-0003431159 00000 n 
-0003431387 00000 n 
-0003431578 00000 n 
-0003431770 00000 n 
-0003431975 00000 n 
-0003432203 00000 n 
-0003432395 00000 n 
-0003432623 00000 n 
-0003432851 00000 n 
-0003436872 00000 n 
-0003433055 00000 n 
-0003434255 00000 n 
-0003423422 00000 n 
-0003421039 00000 n 
-0003433221 00000 n 
-0003433281 00000 n 
-0003433342 00000 n 
-0003433403 00000 n 
-0003433464 00000 n 
-0003433525 00000 n 
-0003433645 00000 n 
-0003433706 00000 n 
-0003433767 00000 n 
-0003433828 00000 n 
-0003433889 00000 n 
-0003433950 00000 n 
-0003434011 00000 n 
-0003434072 00000 n 
-0003430341 00000 n 
-0003434133 00000 n 
-0003434194 00000 n 
-0003441303 00000 n 
-0003447494 00000 n 
-0003437100 00000 n 
-0003437328 00000 n 
-0003437556 00000 n 
-0003437747 00000 n 
-0003437975 00000 n 
-0003438166 00000 n 
-0003438364 00000 n 
-0003438592 00000 n 
-0003438788 00000 n 
-0003439016 00000 n 
-0003439243 00000 n 
-0003439471 00000 n 
-0003439698 00000 n 
-0003439890 00000 n 
-0003440087 00000 n 
-0003440284 00000 n 
-0003441368 00000 n 
-0003436563 00000 n 
-0003434464 00000 n 
-0003440450 00000 n 
-0003440510 00000 n 
-0003440571 00000 n 
-0003440632 00000 n 
-0003440693 00000 n 
-0003440754 00000 n 
-0003440815 00000 n 
-0003440876 00000 n 
-0003440937 00000 n 
-0003440998 00000 n 
-0003441059 00000 n 
-0003441120 00000 n 
-0003441242 00000 n 
-0003455838 00000 n 
-0003456021 00000 n 
-0003445012 00000 n 
-0003445203 00000 n 
-0003445435 00000 n 
-0003445898 00000 n 
-0003446089 00000 n 
-0003446320 00000 n 
-0003446780 00000 n 
-0003447614 00000 n 
-0003444783 00000 n 
-0003441577 00000 n 
-0003446946 00000 n 
-0003447006 00000 n 
-0003447067 00000 n 
-0003447189 00000 n 
-0003447250 00000 n 
-0003445667 00000 n 
-0003447372 00000 n 
-0003447433 00000 n 
-0003446551 00000 n 
-0003447554 00000 n 
-0003454856 00000 n 
-0003455088 00000 n 
-0003450771 00000 n 
-0003454787 00000 n 
-0003455551 00000 n 
-0003456259 00000 n 
-0003450575 00000 n 
-0003447810 00000 n 
-0003455717 00000 n 
-0003455777 00000 n 
-0003455320 00000 n 
-0003455899 00000 n 
-0003455960 00000 n 
-0003456081 00000 n 
-0003451629 00000 n 
-0003451761 00000 n 
-0003451914 00000 n 
-0003452220 00000 n 
-0003452641 00000 n 
-0003452881 00000 n 
-0003452904 00000 n 
-0003454763 00000 n 
-0003459650 00000 n 
-0003459881 00000 n 
-0003460112 00000 n 
-0003460342 00000 n 
-0003460573 00000 n 
-0003460804 00000 n 
-0003461034 00000 n 
-0003461238 00000 n 
-0003461443 00000 n 
-0003461922 00000 n 
-0003462119 00000 n 
-0003462350 00000 n 
-0003462547 00000 n 
-0003462753 00000 n 
-0003463233 00000 n 
-0003463464 00000 n 
-0003463661 00000 n 
-0003463867 00000 n 
-0003464347 00000 n 
-0003464578 00000 n 
-0003464784 00000 n 
-0003464989 00000 n 
-0003465229 00000 n 
-0003465426 00000 n 
-0003465657 00000 n 
-0003465854 00000 n 
-0003466051 00000 n 
-0003466282 00000 n 
-0003466479 00000 n 
-0003466675 00000 n 
-0003466906 00000 n 
-0003467098 00000 n 
-0003467304 00000 n 
-0003467784 00000 n 
-0003468015 00000 n 
-0003468209 00000 n 
-0003468415 00000 n 
-0003468895 00000 n 
-0003469125 00000 n 
-0003469307 00000 n 
-0003469512 00000 n 
-0003469750 00000 n 
-0003469981 00000 n 
-0003470176 00000 n 
-0003470382 00000 n 
-0003470862 00000 n 
-0003471093 00000 n 
-0003471281 00000 n 
-0003471487 00000 n 
-0003471967 00000 n 
-0003472196 00000 n 
-0003472376 00000 n 
-0003472561 00000 n 
-0003472765 00000 n 
-0003476884 00000 n 
-0003477090 00000 n 
-0003473241 00000 n 
-0003473955 00000 n 
-0003458881 00000 n 
-0003456484 00000 n 
-0003473407 00000 n 
-0003473467 00000 n 
-0003473528 00000 n 
-0003473589 00000 n 
-0003473650 00000 n 
-0003473711 00000 n 
-0003461682 00000 n 
-0003462993 00000 n 
-0003464107 00000 n 
-0003473772 00000 n 
-0003473833 00000 n 
-0003473894 00000 n 
-0003467544 00000 n 
-0003468655 00000 n 
-0003470622 00000 n 
-0003471727 00000 n 
-0003473003 00000 n 
-0004867143 00000 n 
-0003540939 00000 n 
-0003544354 00000 n 
-0003544475 00000 n 
-0003544661 00000 n 
-0003544904 00000 n 
-0003548065 00000 n 
-0003548309 00000 n 
-0003551648 00000 n 
-0003551892 00000 n 
-0003477320 00000 n 
-0003477526 00000 n 
-0003477757 00000 n 
-0003477987 00000 n 
-0003478218 00000 n 
-0003478449 00000 n 
-0003478680 00000 n 
-0003478911 00000 n 
-0003479108 00000 n 
-0003479339 00000 n 
-0003479570 00000 n 
-0003479757 00000 n 
-0003479988 00000 n 
-0003480185 00000 n 
-0003480416 00000 n 
-0003480612 00000 n 
-0003480841 00000 n 
-0003481037 00000 n 
-0003481242 00000 n 
-0003481447 00000 n 
-0003481676 00000 n 
-0003481872 00000 n 
-0003482077 00000 n 
-0003482282 00000 n 
-0003482470 00000 n 
-0003482701 00000 n 
-0003482898 00000 n 
-0003483103 00000 n 
-0003483308 00000 n 
-0003483539 00000 n 
-0003483736 00000 n 
-0003483941 00000 n 
-0003484146 00000 n 
-0003484334 00000 n 
-0003484564 00000 n 
-0003484761 00000 n 
-0003484992 00000 n 
-0003485189 00000 n 
-0003485420 00000 n 
-0003485616 00000 n 
-0003485846 00000 n 
-0003486041 00000 n 
-0003490174 00000 n 
-0003490372 00000 n 
-0003490602 00000 n 
-0003490790 00000 n 
-0003490988 00000 n 
-0003491218 00000 n 
-0003491405 00000 n 
-0003491603 00000 n 
-0003491833 00000 n 
-0003486270 00000 n 
-0003486982 00000 n 
-0003476295 00000 n 
-0003474179 00000 n 
-0003486436 00000 n 
-0003486496 00000 n 
-0003486557 00000 n 
-0003486618 00000 n 
-0003486679 00000 n 
-0003486740 00000 n 
-0003486801 00000 n 
-0003486862 00000 n 
-0003486923 00000 n 
-0003552196 00000 n 
-0003552379 00000 n 
-0003555684 00000 n 
-0003555867 00000 n 
-0003556048 00000 n 
-0003559732 00000 n 
-0003559981 00000 n 
-0003560226 00000 n 
-0003563786 00000 n 
-0003563974 00000 n 
-0003566777 00000 n 
-0003566960 00000 n 
-0003492021 00000 n 
-0003492227 00000 n 
-0003492456 00000 n 
-0003492662 00000 n 
-0003492891 00000 n 
-0003493122 00000 n 
-0003493353 00000 n 
-0003493581 00000 n 
-0003493810 00000 n 
-0003493999 00000 n 
-0003494227 00000 n 
-0003494415 00000 n 
-0003494643 00000 n 
-0003494839 00000 n 
-0003495067 00000 n 
-0003495264 00000 n 
-0003495492 00000 n 
-0003495680 00000 n 
-0003495908 00000 n 
-0003496097 00000 n 
-0003496326 00000 n 
-0003496522 00000 n 
-0003496751 00000 n 
-0003496948 00000 n 
-0003497177 00000 n 
-0003497364 00000 n 
-0003497531 00000 n 
-0003497760 00000 n 
-0003497953 00000 n 
-0003498120 00000 n 
-0003498349 00000 n 
-0003498554 00000 n 
-0003498794 00000 n 
-0003499024 00000 n 
-0003499216 00000 n 
-0003499421 00000 n 
-0003499661 00000 n 
-0003499890 00000 n 
-0003500117 00000 n 
-0003500312 00000 n 
-0003500539 00000 n 
-0003505716 00000 n 
-0003505947 00000 n 
-0003506144 00000 n 
-0003506334 00000 n 
-0003506564 00000 n 
-0003506751 00000 n 
-0003506948 00000 n 
-0003500734 00000 n 
-0003501203 00000 n 
-0003489525 00000 n 
-0003487152 00000 n 
-0003500900 00000 n 
-0003500960 00000 n 
-0003501021 00000 n 
-0003501082 00000 n 
-0003501143 00000 n 
-0003567143 00000 n 
-0003567326 00000 n 
-0003567509 00000 n 
-0003567691 00000 n 
-0003570547 00000 n 
-0003570734 00000 n 
-0003570917 00000 n 
-0003571161 00000 n 
-0003571405 00000 n 
-0003574223 00000 n 
-0003574406 00000 n 
-0003574650 00000 n 
-0003574891 00000 n 
-0003578620 00000 n 
-0003578864 00000 n 
-0003579108 00000 n 
-0003582651 00000 n 
-0003582833 00000 n 
-0003582955 00000 n 
-0003507161 00000 n 
-0003507341 00000 n 
-0003507572 00000 n 
-0003507759 00000 n 
-0003507956 00000 n 
-0003508165 00000 n 
-0003508346 00000 n 
-0003508577 00000 n 
-0003508764 00000 n 
-0003508970 00000 n 
-0003509167 00000 n 
-0003509380 00000 n 
-0003509558 00000 n 
-0003509789 00000 n 
-0003509976 00000 n 
-0003510182 00000 n 
-0003510378 00000 n 
-0003510591 00000 n 
-0003510769 00000 n 
-0003510999 00000 n 
-0003511195 00000 n 
-0003511400 00000 n 
-0003511597 00000 n 
-0003511776 00000 n 
-0003512007 00000 n 
-0003512204 00000 n 
-0003512410 00000 n 
-0003512607 00000 n 
-0003512785 00000 n 
-0003513016 00000 n 
-0003513202 00000 n 
-0003513399 00000 n 
-0003513792 00000 n 
-0003514004 00000 n 
-0003514193 00000 n 
-0003514424 00000 n 
-0003514611 00000 n 
-0003514808 00000 n 
-0003515201 00000 n 
-0003515413 00000 n 
-0003515602 00000 n 
-0003515829 00000 n 
-0003516025 00000 n 
-0003516196 00000 n 
-0003516427 00000 n 
-0003516620 00000 n 
-0003516826 00000 n 
-0003517237 00000 n 
-0003517442 00000 n 
-0003517638 00000 n 
-0003517806 00000 n 
-0003518035 00000 n 
-0003518266 00000 n 
-0003518462 00000 n 
-0003518635 00000 n 
-0003518863 00000 n 
-0003519059 00000 n 
-0003522594 00000 n 
-0003522791 00000 n 
-0003523022 00000 n 
-0003519232 00000 n 
-0003519458 00000 n 
-0003504897 00000 n 
-0003501386 00000 n 
-0003519398 00000 n 
-0003513596 00000 n 
-0003515005 00000 n 
-0003517032 00000 n 
-0003583143 00000 n 
-0003583326 00000 n 
-0003587639 00000 n 
-0003587883 00000 n 
-0003593350 00000 n 
-0003593594 00000 n 
-0003593838 00000 n 
-0003598336 00000 n 
-0003598579 00000 n 
-0003603879 00000 n 
-0003604001 00000 n 
-0003604249 00000 n 
-0003604371 00000 n 
-0003609782 00000 n 
-0003523219 00000 n 
-0003523416 00000 n 
-0003523647 00000 n 
-0003523844 00000 n 
-0003524073 00000 n 
-0003524269 00000 n 
-0003524498 00000 n 
-0003524704 00000 n 
-0003524933 00000 n 
-0003525138 00000 n 
-0003525367 00000 n 
-0003525563 00000 n 
-0003525791 00000 n 
-0003525984 00000 n 
-0003526212 00000 n 
-0003526417 00000 n 
-0003526646 00000 n 
-0003526875 00000 n 
-0003527062 00000 n 
-0003527268 00000 n 
-0003527496 00000 n 
-0003527689 00000 n 
-0003527874 00000 n 
-0003528080 00000 n 
-0003528311 00000 n 
-0003528542 00000 n 
-0003528773 00000 n 
-0003529003 00000 n 
-0003532871 00000 n 
-0003533102 00000 n 
-0003533299 00000 n 
-0003529232 00000 n 
-0003529946 00000 n 
-0003522135 00000 n 
-0003519710 00000 n 
-0003529398 00000 n 
-0003529458 00000 n 
-0003529519 00000 n 
-0003529580 00000 n 
-0003529641 00000 n 
-0003529702 00000 n 
-0003529763 00000 n 
-0003529824 00000 n 
-0003529885 00000 n 
-0003610031 00000 n 
-0003614603 00000 n 
-0003614852 00000 n 
-0003615034 00000 n 
-0003615155 00000 n 
-0003619972 00000 n 
-0003620281 00000 n 
-0003620462 00000 n 
-0003533496 00000 n 
-0003533692 00000 n 
-0003533885 00000 n 
-0003534115 00000 n 
-0003534346 00000 n 
-0003534539 00000 n 
-0003534736 00000 n 
-0003534930 00000 n 
-0003535113 00000 n 
-0003535308 00000 n 
-0003535490 00000 n 
-0003535717 00000 n 
-0003535899 00000 n 
-0003536081 00000 n 
-0003536311 00000 n 
-0003536493 00000 n 
-0003536689 00000 n 
-0003536871 00000 n 
-0003537102 00000 n 
-0003537299 00000 n 
-0003537530 00000 n 
-0003537727 00000 n 
-0003537956 00000 n 
-0003538147 00000 n 
-0003538343 00000 n 
-0003538534 00000 n 
-0003538765 00000 n 
-0003538962 00000 n 
-0003539159 00000 n 
-0003539355 00000 n 
-0003539548 00000 n 
-0003539778 00000 n 
-0003539970 00000 n 
-0003540164 00000 n 
-0003543871 00000 n 
-0003540347 00000 n 
-0003541059 00000 n 
-0003532352 00000 n 
-0003530183 00000 n 
-0003540513 00000 n 
-0003540573 00000 n 
-0003540634 00000 n 
-0003540695 00000 n 
-0003540756 00000 n 
-0003540817 00000 n 
-0003540878 00000 n 
-0003540999 00000 n 
-0003620766 00000 n 
-0003625924 00000 n 
-0003626046 00000 n 
-0003626168 00000 n 
-0003626351 00000 n 
-0003544067 00000 n 
-0003545024 00000 n 
-0003543712 00000 n 
-0003541255 00000 n 
-0003544233 00000 n 
-0003544293 00000 n 
-0003544414 00000 n 
-0003544540 00000 n 
-0003544600 00000 n 
-0003544722 00000 n 
-0003544783 00000 n 
-0003544844 00000 n 
-0003544964 00000 n 
-0004867276 00000 n 
-0003547717 00000 n 
-0003548492 00000 n 
-0003547568 00000 n 
-0003545206 00000 n 
-0003547883 00000 n 
-0003547943 00000 n 
-0003548004 00000 n 
-0003548126 00000 n 
-0003548187 00000 n 
-0003548248 00000 n 
-0003548370 00000 n 
-0003548431 00000 n 
-0003551361 00000 n 
-0003552439 00000 n 
-0003551212 00000 n 
-0003548674 00000 n 
-0003551527 00000 n 
-0003551587 00000 n 
-0003551709 00000 n 
-0003551770 00000 n 
-0003551831 00000 n 
-0003551952 00000 n 
-0003552013 00000 n 
-0003552074 00000 n 
-0003552135 00000 n 
-0003552257 00000 n 
-0003552318 00000 n 
-0003555336 00000 n 
-0003556231 00000 n 
-0003555187 00000 n 
-0003552634 00000 n 
-0003555502 00000 n 
-0003555562 00000 n 
-0003555623 00000 n 
-0004854125 00000 n 
-0003555745 00000 n 
-0003555806 00000 n 
-0003555928 00000 n 
-0003555987 00000 n 
-0003556109 00000 n 
-0003556170 00000 n 
-0003559445 00000 n 
-0003560351 00000 n 
-0003559296 00000 n 
-0003556466 00000 n 
-0003559611 00000 n 
-0003559671 00000 n 
-0003559798 00000 n 
-0003559859 00000 n 
-0003559920 00000 n 
-0003560043 00000 n 
-0003560104 00000 n 
-0003560165 00000 n 
-0003560291 00000 n 
-0003563438 00000 n 
-0003564157 00000 n 
-0003563289 00000 n 
-0003560546 00000 n 
-0003563604 00000 n 
-0003563664 00000 n 
-0003563725 00000 n 
-0003563852 00000 n 
-0003563913 00000 n 
-0003564035 00000 n 
-0003564096 00000 n 
-0003566551 00000 n 
-0003567811 00000 n 
-0003566402 00000 n 
-0003564352 00000 n 
-0003566717 00000 n 
-0003566838 00000 n 
-0003566899 00000 n 
-0003567021 00000 n 
-0003567082 00000 n 
-0003567204 00000 n 
-0003567265 00000 n 
-0003567387 00000 n 
-0003567448 00000 n 
-0003567570 00000 n 
-0003567630 00000 n 
-0003567751 00000 n 
-0004867409 00000 n 
-0003570321 00000 n 
-0003571525 00000 n 
-0003570172 00000 n 
-0003568006 00000 n 
-0003570487 00000 n 
-0003570612 00000 n 
-0003570673 00000 n 
-0003570795 00000 n 
-0003570856 00000 n 
-0003570978 00000 n 
-0003571039 00000 n 
-0003571100 00000 n 
-0003571222 00000 n 
-0003571283 00000 n 
-0003571344 00000 n 
-0003571465 00000 n 
-0003573875 00000 n 
-0003575011 00000 n 
-0003573726 00000 n 
-0003571720 00000 n 
-0003574041 00000 n 
-0003574101 00000 n 
-0003574162 00000 n 
-0003574284 00000 n 
-0003574345 00000 n 
-0003574467 00000 n 
-0003574528 00000 n 
-0003574589 00000 n 
-0003574711 00000 n 
-0003574771 00000 n 
-0003574832 00000 n 
-0003574951 00000 n 
-0003577753 00000 n 
-0003577918 00000 n 
-0003578085 00000 n 
-0003578272 00000 n 
-0003579291 00000 n 
-0003577574 00000 n 
-0003575206 00000 n 
-0003578438 00000 n 
-0003578498 00000 n 
-0003578559 00000 n 
-0003578681 00000 n 
-0003578742 00000 n 
-0003578803 00000 n 
-0003578925 00000 n 
-0003578986 00000 n 
-0003579047 00000 n 
-0003579169 00000 n 
-0003579230 00000 n 
-0003582235 00000 n 
-0003586751 00000 n 
-0003582425 00000 n 
-0003583446 00000 n 
-0003582076 00000 n 
-0003579486 00000 n 
-0003582591 00000 n 
-0003582712 00000 n 
-0003582773 00000 n 
-0003582894 00000 n 
-0003583021 00000 n 
-0003583082 00000 n 
-0003583204 00000 n 
-0003583265 00000 n 
-0003583386 00000 n 
-0003586931 00000 n 
-0003587112 00000 n 
-0003587291 00000 n 
-0003588066 00000 n 
-0003586572 00000 n 
-0003583641 00000 n 
-0003587457 00000 n 
-0003587517 00000 n 
-0003587578 00000 n 
-0003587700 00000 n 
-0003587761 00000 n 
-0003587822 00000 n 
-0003587944 00000 n 
-0003588005 00000 n 
-0003591571 00000 n 
-0003591953 00000 n 
-0003592132 00000 n 
-0003592515 00000 n 
-0003592694 00000 n 
-0003592885 00000 n 
-0003593063 00000 n 
-0003593959 00000 n 
-0003591342 00000 n 
-0003588298 00000 n 
-0003593229 00000 n 
-0003593289 00000 n 
-0003591763 00000 n 
-0003593411 00000 n 
-0003593472 00000 n 
-0003593533 00000 n 
-0003592323 00000 n 
-0003593655 00000 n 
-0003593716 00000 n 
-0003593777 00000 n 
-0003593899 00000 n 
-0004867542 00000 n 
-0003597420 00000 n 
-0003597611 00000 n 
-0003597799 00000 n 
-0003597988 00000 n 
-0003598822 00000 n 
-0003597241 00000 n 
-0003594191 00000 n 
-0003598154 00000 n 
-0003598214 00000 n 
-0003598275 00000 n 
-0003598397 00000 n 
-0003598458 00000 n 
-0003598518 00000 n 
-0003598639 00000 n 
-0003598700 00000 n 
-0003598761 00000 n 
-0003602791 00000 n 
-0003602962 00000 n 
-0003603132 00000 n 
-0003603299 00000 n 
-0003603485 00000 n 
-0003608187 00000 n 
-0003603653 00000 n 
-0003604496 00000 n 
-0003602592 00000 n 
-0003599054 00000 n 
-0003603819 00000 n 
-0003603940 00000 n 
-0003604067 00000 n 
-0003604128 00000 n 
-0003604189 00000 n 
-0003604310 00000 n 
-0003604436 00000 n 
-0003608361 00000 n 
-0003608516 00000 n 
-0003608673 00000 n 
-0003608848 00000 n 
-0003609241 00000 n 
-0003609434 00000 n 
-0003610091 00000 n 
-0003607968 00000 n 
-0003604703 00000 n 
-0003609600 00000 n 
-0003609660 00000 n 
-0003609721 00000 n 
-0003609848 00000 n 
-0003609909 00000 n 
-0003609970 00000 n 
-0003609045 00000 n 
-0003613320 00000 n 
-0003613493 00000 n 
-0003613679 00000 n 
-0003613866 00000 n 
-0003614088 00000 n 
-0003618754 00000 n 
-0003614316 00000 n 
-0003615403 00000 n 
-0003613121 00000 n 
-0003610286 00000 n 
-0003614482 00000 n 
-0003614542 00000 n 
-0003614669 00000 n 
-0003614730 00000 n 
-0003614791 00000 n 
-0003614912 00000 n 
-0003614973 00000 n 
-0003615095 00000 n 
-0003615221 00000 n 
-0003615282 00000 n 
-0003615342 00000 n 
-0003858947 00000 n 
-0003618971 00000 n 
-0003619157 00000 n 
-0003619530 00000 n 
-0003619746 00000 n 
-0003620886 00000 n 
-0003618555 00000 n 
-0003615598 00000 n 
-0003619912 00000 n 
-0003620037 00000 n 
-0003620098 00000 n 
-0003620159 00000 n 
-0003619343 00000 n 
-0003620220 00000 n 
-0003620341 00000 n 
-0003620401 00000 n 
-0003620523 00000 n 
-0003620583 00000 n 
-0003620644 00000 n 
-0003620705 00000 n 
-0003620826 00000 n 
-0003624150 00000 n 
-0003624541 00000 n 
-0003624735 00000 n 
-0003625127 00000 n 
-0003625310 00000 n 
-0003625698 00000 n 
-0003626594 00000 n 
-0003623921 00000 n 
-0003621093 00000 n 
-0003625864 00000 n 
-0003625985 00000 n 
-0003624345 00000 n 
-0003626107 00000 n 
-0003624931 00000 n 
-0003626229 00000 n 
-0003625504 00000 n 
-0003626290 00000 n 
-0003626412 00000 n 
-0003626473 00000 n 
-0003626534 00000 n 
-0004867675 00000 n 
-0003629058 00000 n 
-0003629290 00000 n 
-0003629522 00000 n 
-0003629753 00000 n 
-0003629985 00000 n 
-0003630183 00000 n 
-0003630415 00000 n 
-0003630613 00000 n 
-0003630845 00000 n 
-0003631041 00000 n 
-0003631271 00000 n 
-0003631469 00000 n 
-0003631701 00000 n 
-0003631899 00000 n 
-0003632131 00000 n 
-0003632329 00000 n 
-0003632561 00000 n 
-0003632792 00000 n 
-0003632990 00000 n 
-0003633188 00000 n 
-0003633419 00000 n 
-0003633616 00000 n 
-0003633813 00000 n 
-0003634008 00000 n 
-0003634238 00000 n 
-0003634434 00000 n 
-0003637975 00000 n 
-0003638172 00000 n 
-0003638404 00000 n 
-0003638602 00000 n 
-0003634630 00000 n 
-0003635767 00000 n 
-0003628649 00000 n 
-0003626763 00000 n 
-0003634796 00000 n 
-0003634975 00000 n 
-0003635036 00000 n 
-0003635097 00000 n 
-0003635158 00000 n 
-0003635219 00000 n 
-0003635280 00000 n 
-0003635341 00000 n 
-0003635402 00000 n 
-0003635463 00000 n 
-0003635524 00000 n 
-0003635585 00000 n 
-0003635646 00000 n 
-0003635706 00000 n 
-0003642540 00000 n 
-0003642662 00000 n 
-0003642784 00000 n 
-0003638800 00000 n 
-0003639032 00000 n 
-0003639230 00000 n 
-0003639461 00000 n 
-0003639659 00000 n 
-0003639857 00000 n 
-0003640089 00000 n 
-0003640287 00000 n 
-0003640485 00000 n 
-0003640681 00000 n 
-0003640912 00000 n 
-0003641109 00000 n 
-0003641306 00000 n 
-0003641503 00000 n 
-0003641735 00000 n 
-0003641933 00000 n 
-0003642131 00000 n 
-0003643331 00000 n 
-0003637626 00000 n 
-0003635992 00000 n 
-0003642297 00000 n 
-0003642357 00000 n 
-0003642418 00000 n 
-0003642479 00000 n 
-0003642601 00000 n 
-0003642723 00000 n 
-0003642845 00000 n 
-0003642906 00000 n 
-0003642967 00000 n 
-0003643028 00000 n 
-0003643089 00000 n 
-0003643150 00000 n 
-0003643211 00000 n 
-0003645777 00000 n 
-0003646008 00000 n 
-0003646239 00000 n 
-0003646471 00000 n 
-0003646703 00000 n 
-0003646901 00000 n 
-0003647133 00000 n 
-0003647331 00000 n 
-0003647563 00000 n 
-0003647761 00000 n 
-0003647993 00000 n 
-0003648223 00000 n 
-0003648420 00000 n 
-0003648617 00000 n 
-0003648848 00000 n 
-0003649045 00000 n 
-0003649242 00000 n 
-0003649439 00000 n 
-0003649671 00000 n 
-0003649869 00000 n 
-0003650067 00000 n 
-0003650264 00000 n 
-0003650496 00000 n 
-0003650694 00000 n 
-0003650892 00000 n 
-0003651124 00000 n 
-0003651322 00000 n 
-0003651553 00000 n 
-0003651751 00000 n 
-0003651949 00000 n 
-0003652181 00000 n 
-0003652379 00000 n 
-0003652577 00000 n 
-0003652774 00000 n 
-0003653006 00000 n 
-0003653204 00000 n 
-0003653402 00000 n 
-0003653599 00000 n 
-0003653831 00000 n 
-0003654029 00000 n 
-0003654227 00000 n 
-0003655244 00000 n 
-0003645228 00000 n 
-0003643528 00000 n 
-0003654393 00000 n 
-0003654512 00000 n 
-0003654573 00000 n 
-0003654634 00000 n 
-0003654695 00000 n 
-0003654756 00000 n 
-0003654817 00000 n 
-0003654878 00000 n 
-0003654939 00000 n 
-0003655000 00000 n 
-0003655061 00000 n 
-0003655122 00000 n 
-0003655183 00000 n 
-0003657335 00000 n 
-0003657455 00000 n 
-0003657576 00000 n 
-0003657697 00000 n 
-0003660273 00000 n 
-0003663849 00000 n 
-0003657048 00000 n 
-0003658180 00000 n 
-0003656899 00000 n 
-0003655455 00000 n 
-0003657214 00000 n 
-0003657274 00000 n 
-0003657395 00000 n 
-0003657515 00000 n 
-0003657636 00000 n 
-0003657757 00000 n 
-0003657818 00000 n 
-0003657879 00000 n 
-0003657939 00000 n 
-0003658000 00000 n 
-0003663918 00000 n 
-0003664124 00000 n 
-0003664347 00000 n 
-0003664553 00000 n 
-0003664775 00000 n 
-0003664981 00000 n 
-0003665204 00000 n 
-0003665395 00000 n 
-0003665592 00000 n 
-0003665815 00000 n 
-0003666012 00000 n 
-0003666235 00000 n 
-0003666430 00000 n 
-0003666653 00000 n 
-0003666848 00000 n 
-0003667071 00000 n 
-0003667268 00000 n 
-0003667491 00000 n 
-0003667688 00000 n 
-0003667911 00000 n 
-0003668109 00000 n 
-0003668331 00000 n 
-0003668519 00000 n 
-0003668717 00000 n 
-0003668939 00000 n 
-0003669126 00000 n 
-0003669322 00000 n 
-0003669542 00000 n 
-0003673671 00000 n 
-0003673894 00000 n 
-0003669728 00000 n 
-0003670624 00000 n 
-0003659827 00000 n 
-0003658349 00000 n 
-0003669894 00000 n 
-0003669954 00000 n 
-0003670015 00000 n 
-0003670076 00000 n 
-0003670137 00000 n 
-0003670198 00000 n 
-0003670259 00000 n 
-0003670319 00000 n 
-0003670380 00000 n 
-0003670441 00000 n 
-0003670502 00000 n 
-0003670563 00000 n 
-0003661165 00000 n 
-0003661297 00000 n 
-0003661450 00000 n 
-0003661724 00000 n 
-0003662109 00000 n 
-0003662349 00000 n 
-0003662372 00000 n 
-0003663825 00000 n 
-0003774386 00000 n 
-0003777340 00000 n 
-0003777523 00000 n 
-0003674117 00000 n 
-0003674339 00000 n 
-0003674562 00000 n 
-0003674751 00000 n 
-0003674974 00000 n 
-0003675197 00000 n 
-0003675420 00000 n 
-0003675643 00000 n 
-0003675830 00000 n 
-0003676053 00000 n 
-0003676250 00000 n 
-0003676473 00000 n 
-0003676669 00000 n 
-0003676891 00000 n 
-0003677088 00000 n 
-0003677294 00000 n 
-0003677500 00000 n 
-0003677722 00000 n 
-0003677919 00000 n 
-0003678125 00000 n 
-0003678331 00000 n 
-0003678519 00000 n 
-0003678741 00000 n 
-0003678937 00000 n 
-0003679141 00000 n 
-0003679345 00000 n 
-0003679568 00000 n 
-0003679765 00000 n 
-0003679970 00000 n 
-0003680175 00000 n 
-0003680363 00000 n 
-0003680585 00000 n 
-0003680780 00000 n 
-0003680985 00000 n 
-0003681190 00000 n 
-0003681600 00000 n 
-0003681805 00000 n 
-0003682028 00000 n 
-0003682217 00000 n 
-0003682439 00000 n 
-0003682625 00000 n 
-0003682848 00000 n 
-0003683069 00000 n 
-0003683258 00000 n 
-0003683477 00000 n 
-0003683663 00000 n 
-0003683882 00000 n 
-0003688225 00000 n 
-0003688446 00000 n 
-0003688643 00000 n 
-0003688863 00000 n 
-0003684069 00000 n 
-0003684661 00000 n 
-0003673022 00000 n 
-0003670837 00000 n 
-0003684235 00000 n 
-0003684295 00000 n 
-0003684356 00000 n 
-0003684417 00000 n 
-0003684478 00000 n 
-0003684539 00000 n 
-0003684600 00000 n 
-0003681394 00000 n 
-0004867808 00000 n 
-0003777706 00000 n 
-0003777889 00000 n 
-0003778072 00000 n 
-0003778255 00000 n 
-0003781744 00000 n 
-0003781988 00000 n 
-0003782236 00000 n 
-0003786521 00000 n 
-0003786770 00000 n 
-0003790247 00000 n 
-0003790435 00000 n 
-0003790618 00000 n 
-0003790801 00000 n 
-0003794108 00000 n 
-0003794289 00000 n 
-0003689059 00000 n 
-0003689280 00000 n 
-0003689476 00000 n 
-0003689697 00000 n 
-0003689893 00000 n 
-0003690113 00000 n 
-0003690308 00000 n 
-0003690529 00000 n 
-0003690726 00000 n 
-0003690947 00000 n 
-0003691136 00000 n 
-0003691355 00000 n 
-0003691543 00000 n 
-0003691763 00000 n 
-0003691960 00000 n 
-0003692181 00000 n 
-0003692378 00000 n 
-0003692601 00000 n 
-0003692792 00000 n 
-0003692979 00000 n 
-0003693170 00000 n 
-0003693357 00000 n 
-0003693580 00000 n 
-0003693770 00000 n 
-0003693957 00000 n 
-0003694147 00000 n 
-0003694333 00000 n 
-0003694539 00000 n 
-0003694761 00000 n 
-0003694943 00000 n 
-0003695130 00000 n 
-0003695351 00000 n 
-0003695538 00000 n 
-0003695705 00000 n 
-0003695925 00000 n 
-0003696117 00000 n 
-0003696283 00000 n 
-0003696504 00000 n 
-0003696693 00000 n 
-0003696913 00000 n 
-0003697101 00000 n 
-0003697322 00000 n 
-0003697509 00000 n 
-0003697729 00000 n 
-0003697917 00000 n 
-0003698093 00000 n 
-0003698312 00000 n 
-0003703383 00000 n 
-0003703605 00000 n 
-0003703793 00000 n 
-0003698499 00000 n 
-0003698846 00000 n 
-0003687566 00000 n 
-0003684831 00000 n 
-0003698665 00000 n 
-0003698725 00000 n 
-0003698786 00000 n 
-0003794468 00000 n 
-0003794712 00000 n 
-0003797903 00000 n 
-0003798147 00000 n 
-0003798390 00000 n 
-0003801538 00000 n 
-0003801782 00000 n 
-0003801964 00000 n 
-0003802146 00000 n 
-0003802389 00000 n 
-0003806457 00000 n 
-0003806701 00000 n 
-0003810937 00000 n 
-0003811125 00000 n 
-0003811369 00000 n 
-0003811613 00000 n 
-0003811795 00000 n 
-0003816339 00000 n 
-0003703974 00000 n 
-0003704194 00000 n 
-0003704379 00000 n 
-0003704574 00000 n 
-0003704787 00000 n 
-0003704968 00000 n 
-0003705190 00000 n 
-0003705376 00000 n 
-0003705567 00000 n 
-0003705754 00000 n 
-0003705977 00000 n 
-0003706164 00000 n 
-0003706361 00000 n 
-0003706570 00000 n 
-0003706751 00000 n 
-0003706974 00000 n 
-0003707161 00000 n 
-0003707367 00000 n 
-0003707564 00000 n 
-0003707776 00000 n 
-0003707955 00000 n 
-0003708178 00000 n 
-0003708365 00000 n 
-0003708571 00000 n 
-0003708767 00000 n 
-0003708978 00000 n 
-0003709156 00000 n 
-0003709378 00000 n 
-0003709574 00000 n 
-0003709779 00000 n 
-0003709976 00000 n 
-0003710155 00000 n 
-0003710377 00000 n 
-0003710573 00000 n 
-0003710778 00000 n 
-0003710975 00000 n 
-0003711153 00000 n 
-0003711376 00000 n 
-0003711562 00000 n 
-0003711759 00000 n 
-0003712153 00000 n 
-0003712366 00000 n 
-0003712555 00000 n 
-0003712777 00000 n 
-0003712963 00000 n 
-0003713159 00000 n 
-0003713552 00000 n 
-0003713765 00000 n 
-0003713954 00000 n 
-0003714174 00000 n 
-0003714363 00000 n 
-0003714534 00000 n 
-0003714756 00000 n 
-0003714948 00000 n 
-0003715153 00000 n 
-0003715564 00000 n 
-0003715770 00000 n 
-0003715967 00000 n 
-0003716135 00000 n 
-0003716356 00000 n 
-0003716561 00000 n 
-0003716801 00000 n 
-0003717024 00000 n 
-0003717217 00000 n 
-0003717423 00000 n 
-0003717663 00000 n 
-0003717884 00000 n 
-0003718102 00000 n 
-0003718288 00000 n 
-0003721989 00000 n 
-0003722212 00000 n 
-0003722401 00000 n 
-0003722598 00000 n 
-0003722770 00000 n 
-0003718451 00000 n 
-0003718738 00000 n 
-0003702484 00000 n 
-0003699057 00000 n 
-0003718617 00000 n 
-0003711956 00000 n 
-0003713355 00000 n 
-0003715358 00000 n 
-0003718677 00000 n 
-0003816522 00000 n 
-0003816705 00000 n 
-0003816945 00000 n 
-0003821785 00000 n 
-0003822034 00000 n 
-0003822278 00000 n 
-0003827291 00000 n 
-0003827535 00000 n 
-0003832308 00000 n 
-0003832551 00000 n 
-0003832795 00000 n 
-0003837674 00000 n 
-0003837918 00000 n 
-0003838100 00000 n 
-0003843046 00000 n 
-0003722936 00000 n 
-0003723159 00000 n 
-0003723348 00000 n 
-0003723545 00000 n 
-0003723717 00000 n 
-0003723883 00000 n 
-0003724103 00000 n 
-0003724291 00000 n 
-0003724453 00000 n 
-0003724673 00000 n 
-0003724862 00000 n 
-0003725085 00000 n 
-0003725274 00000 n 
-0003725470 00000 n 
-0003725642 00000 n 
-0003725805 00000 n 
-0003726027 00000 n 
-0003726213 00000 n 
-0003726409 00000 n 
-0003726581 00000 n 
-0003726743 00000 n 
-0003726963 00000 n 
-0003727168 00000 n 
-0003727388 00000 n 
-0003727592 00000 n 
-0003727813 00000 n 
-0003728000 00000 n 
-0003728173 00000 n 
-0003728392 00000 n 
-0003728584 00000 n 
-0003728805 00000 n 
-0003729011 00000 n 
-0003729232 00000 n 
-0003729425 00000 n 
-0003729646 00000 n 
-0003729833 00000 n 
-0003730039 00000 n 
-0003730259 00000 n 
-0003730452 00000 n 
-0003730637 00000 n 
-0003730860 00000 n 
-0003731081 00000 n 
-0003731270 00000 n 
-0003731491 00000 n 
-0003731711 00000 n 
-0003735472 00000 n 
-0003735695 00000 n 
-0003735918 00000 n 
-0003736124 00000 n 
-0003731930 00000 n 
-0003732459 00000 n 
-0003721340 00000 n 
-0003719003 00000 n 
-0003732096 00000 n 
-0003732156 00000 n 
-0003732217 00000 n 
-0003732278 00000 n 
-0003732339 00000 n 
-0003732399 00000 n 
-0003843290 00000 n 
-0003843534 00000 n 
-0003848489 00000 n 
-0003848732 00000 n 
-0003848976 00000 n 
-0003853071 00000 n 
-0003853314 00000 n 
-0003853558 00000 n 
-0003858521 00000 n 
-0003858765 00000 n 
-0003864871 00000 n 
-0003865120 00000 n 
-0003865368 00000 n 
-0003736345 00000 n 
-0003736550 00000 n 
-0003736770 00000 n 
-0003736993 00000 n 
-0003737199 00000 n 
-0003737422 00000 n 
-0003737610 00000 n 
-0003737833 00000 n 
-0003738056 00000 n 
-0003738279 00000 n 
-0003738501 00000 n 
-0003738722 00000 n 
-0003738928 00000 n 
-0003739134 00000 n 
-0003739355 00000 n 
-0003739544 00000 n 
-0003739750 00000 n 
-0003739990 00000 n 
-0003740211 00000 n 
-0003740407 00000 n 
-0003740628 00000 n 
-0003740825 00000 n 
-0003741019 00000 n 
-0003741239 00000 n 
-0003741433 00000 n 
-0003741653 00000 n 
-0003741848 00000 n 
-0003742041 00000 n 
-0003742262 00000 n 
-0003742442 00000 n 
-0003742629 00000 n 
-0003742835 00000 n 
-0003743314 00000 n 
-0003743501 00000 n 
-0003743723 00000 n 
-0003743912 00000 n 
-0003744133 00000 n 
-0003744325 00000 n 
-0003748706 00000 n 
-0003748929 00000 n 
-0003749120 00000 n 
-0003749307 00000 n 
-0003749513 00000 n 
-0003749702 00000 n 
-0003744530 00000 n 
-0003745427 00000 n 
-0003734893 00000 n 
-0003732656 00000 n 
-0003744696 00000 n 
-0003744756 00000 n 
-0003744817 00000 n 
-0003744878 00000 n 
-0003744939 00000 n 
-0003745000 00000 n 
-0003745061 00000 n 
-0003745122 00000 n 
-0003745183 00000 n 
-0003745244 00000 n 
-0003745305 00000 n 
-0003743075 00000 n 
-0003745366 00000 n 
-0003869404 00000 n 
-0003769859 00000 n 
-0003770042 00000 n 
-0003770164 00000 n 
-0003770413 00000 n 
-0003770657 00000 n 
-0003773898 00000 n 
-0003774142 00000 n 
-0003869526 00000 n 
-0003749889 00000 n 
-0003750112 00000 n 
-0003750303 00000 n 
-0003750490 00000 n 
-0003750695 00000 n 
-0003750892 00000 n 
-0003751088 00000 n 
-0003751311 00000 n 
-0003751502 00000 n 
-0003751689 00000 n 
-0003751894 00000 n 
-0003752090 00000 n 
-0003752295 00000 n 
-0003752501 00000 n 
-0003752707 00000 n 
-0003752930 00000 n 
-0003753119 00000 n 
-0003753342 00000 n 
-0003753531 00000 n 
-0003753720 00000 n 
-0003753942 00000 n 
-0003754131 00000 n 
-0003754318 00000 n 
-0003754541 00000 n 
-0003754730 00000 n 
-0003754919 00000 n 
-0003755142 00000 n 
-0003755331 00000 n 
-0003755520 00000 n 
-0003755743 00000 n 
-0003755932 00000 n 
-0003756121 00000 n 
-0003756308 00000 n 
-0003756473 00000 n 
-0003756664 00000 n 
-0003759812 00000 n 
-0003756858 00000 n 
-0003757267 00000 n 
-0003748147 00000 n 
-0003745664 00000 n 
-0003757024 00000 n 
-0003757084 00000 n 
-0003757145 00000 n 
-0003757206 00000 n 
-0003869711 00000 n 
-0003869894 00000 n 
-0003874220 00000 n 
-0003874469 00000 n 
-0003874591 00000 n 
-0003874718 00000 n 
-0003880898 00000 n 
-0003760140 00000 n 
-0003760366 00000 n 
-0003759643 00000 n 
-0003757502 00000 n 
-0003760306 00000 n 
-0003759976 00000 n 
-0004867941 00000 n 
-0003763073 00000 n 
-0003763312 00000 n 
-0003763552 00000 n 
-0003763778 00000 n 
-0003762904 00000 n 
-0003760558 00000 n 
-0003763718 00000 n 
-0003766597 00000 n 
-0003766823 00000 n 
-0003766448 00000 n 
-0003763994 00000 n 
-0003766763 00000 n 
-0003769572 00000 n 
-0003770717 00000 n 
-0003769423 00000 n 
-0003767052 00000 n 
-0003769738 00000 n 
-0003769798 00000 n 
-0003769920 00000 n 
-0003769981 00000 n 
-0003770103 00000 n 
-0003770230 00000 n 
-0003770291 00000 n 
-0003770352 00000 n 
-0003770474 00000 n 
-0003770535 00000 n 
-0003770596 00000 n 
-0003773489 00000 n 
-0003774506 00000 n 
-0003773340 00000 n 
-0003770886 00000 n 
-0003773655 00000 n 
-0003773715 00000 n 
-0003773776 00000 n 
-0003773837 00000 n 
-0003773959 00000 n 
-0003774020 00000 n 
-0003774081 00000 n 
-0003774203 00000 n 
-0003774264 00000 n 
-0003774325 00000 n 
-0003774446 00000 n 
-0003777053 00000 n 
-0003778375 00000 n 
-0003776904 00000 n 
-0003774688 00000 n 
-0003777219 00000 n 
-0003777279 00000 n 
-0003777401 00000 n 
-0003777462 00000 n 
-0003777584 00000 n 
-0003777645 00000 n 
-0003777767 00000 n 
-0003777828 00000 n 
-0003777950 00000 n 
-0003778011 00000 n 
-0003778133 00000 n 
-0003778194 00000 n 
-0003778315 00000 n 
-0003781457 00000 n 
-0003782361 00000 n 
-0003781308 00000 n 
-0003778557 00000 n 
-0003781623 00000 n 
-0003781683 00000 n 
-0003781805 00000 n 
-0003781866 00000 n 
-0003781927 00000 n 
-0003782054 00000 n 
-0003782115 00000 n 
-0003782176 00000 n 
-0003782301 00000 n 
-0004868074 00000 n 
-0003785829 00000 n 
-0003786010 00000 n 
-0003786173 00000 n 
-0003786958 00000 n 
-0003785660 00000 n 
-0003782543 00000 n 
-0003786339 00000 n 
-0003786399 00000 n 
-0003786460 00000 n 
-0003786587 00000 n 
-0003786648 00000 n 
-0003786709 00000 n 
-0003786836 00000 n 
-0003786897 00000 n 
-0003789960 00000 n 
-0003790928 00000 n 
-0003789811 00000 n 
-0003787152 00000 n 
-0003790126 00000 n 
-0003790186 00000 n 
-0003790313 00000 n 
-0003790374 00000 n 
-0003790496 00000 n 
-0003790557 00000 n 
-0003790679 00000 n 
-0003790740 00000 n 
-0003790867 00000 n 
-0003793760 00000 n 
-0003794955 00000 n 
-0003793611 00000 n 
-0003791122 00000 n 
-0003793926 00000 n 
-0003793986 00000 n 
-0003794047 00000 n 
-0003794167 00000 n 
-0003794228 00000 n 
-0003794350 00000 n 
-0003794407 00000 n 
-0003794529 00000 n 
-0003794590 00000 n 
-0003794651 00000 n 
-0003794773 00000 n 
-0003794834 00000 n 
-0003794894 00000 n 
-0003797677 00000 n 
-0003798634 00000 n 
-0003797528 00000 n 
-0003795137 00000 n 
-0003797843 00000 n 
-0003797964 00000 n 
-0003798025 00000 n 
-0003798086 00000 n 
-0003798208 00000 n 
-0003798269 00000 n 
-0003798329 00000 n 
-0003798451 00000 n 
-0003798512 00000 n 
-0003798573 00000 n 
-0003801312 00000 n 
-0003802509 00000 n 
-0003801163 00000 n 
-0003798816 00000 n 
-0003801478 00000 n 
-0003801599 00000 n 
-0003801660 00000 n 
-0003801721 00000 n 
-0003801843 00000 n 
-0003801904 00000 n 
-0003802024 00000 n 
-0003802085 00000 n 
-0003802207 00000 n 
-0003802268 00000 n 
-0003802328 00000 n 
-0003802449 00000 n 
-0003806109 00000 n 
-0003806889 00000 n 
-0003805960 00000 n 
-0003802691 00000 n 
-0003806275 00000 n 
-0003806335 00000 n 
-0003806396 00000 n 
-0003806518 00000 n 
-0003806579 00000 n 
-0003806640 00000 n 
-0003806767 00000 n 
-0003806828 00000 n 
-0004868207 00000 n 
-0003810131 00000 n 
-0003810296 00000 n 
-0003810463 00000 n 
-0003810650 00000 n 
-0003811915 00000 n 
-0003809952 00000 n 
-0003807084 00000 n 
-0003810816 00000 n 
-0003810876 00000 n 
-0003811003 00000 n 
-0003811064 00000 n 
-0003811186 00000 n 
-0003811247 00000 n 
-0003811308 00000 n 
-0003811430 00000 n 
-0003811491 00000 n 
-0003811552 00000 n 
-0003811674 00000 n 
-0003811734 00000 n 
-0003811855 00000 n 
-0003815342 00000 n 
-0003815521 00000 n 
-0003815702 00000 n 
-0003815881 00000 n 
-0003816052 00000 n 
-0003817066 00000 n 
-0003815153 00000 n 
-0003812110 00000 n 
-0003816218 00000 n 
-0003816278 00000 n 
-0003816400 00000 n 
-0003816461 00000 n 
-0003816583 00000 n 
-0003816644 00000 n 
-0003816766 00000 n 
-0003816827 00000 n 
-0003816884 00000 n 
-0003817006 00000 n 
-0003820695 00000 n 
-0003820876 00000 n 
-0003821055 00000 n 
-0003825831 00000 n 
-0003821437 00000 n 
-0003822398 00000 n 
-0003820506 00000 n 
-0003817261 00000 n 
-0003821603 00000 n 
-0003821663 00000 n 
-0003821724 00000 n 
-0003821851 00000 n 
-0003821912 00000 n 
-0003821973 00000 n 
-0003822095 00000 n 
-0003822156 00000 n 
-0003822217 00000 n 
-0003821247 00000 n 
-0003822338 00000 n 
-0003826010 00000 n 
-0003826394 00000 n 
-0003826573 00000 n 
-0003826764 00000 n 
-0003826943 00000 n 
-0003827718 00000 n 
-0003825622 00000 n 
-0003822630 00000 n 
-0003827109 00000 n 
-0003827169 00000 n 
-0003827230 00000 n 
-0003826202 00000 n 
-0003827352 00000 n 
-0003827413 00000 n 
-0003827474 00000 n 
-0003827596 00000 n 
-0003827657 00000 n 
-0003831283 00000 n 
-0003831474 00000 n 
-0003831661 00000 n 
-0003831850 00000 n 
-0003832021 00000 n 
-0003832978 00000 n 
-0003831094 00000 n 
-0003827950 00000 n 
-0003832187 00000 n 
-0003832247 00000 n 
-0003832369 00000 n 
-0003832430 00000 n 
-0003832490 00000 n 
-0003832612 00000 n 
-0003832673 00000 n 
-0003832734 00000 n 
-0003832856 00000 n 
-0003832917 00000 n 
-0003836927 00000 n 
-0003837094 00000 n 
-0003837280 00000 n 
-0003837448 00000 n 
-0003838222 00000 n 
-0003836748 00000 n 
-0003833197 00000 n 
-0003837614 00000 n 
-0003837735 00000 n 
-0003837796 00000 n 
-0003837857 00000 n 
-0003837978 00000 n 
-0003838039 00000 n 
-0003838161 00000 n 
-0004868340 00000 n 
-0003841415 00000 n 
-0003841580 00000 n 
-0003841751 00000 n 
-0003841921 00000 n 
-0003842252 00000 n 
-0003842422 00000 n 
-0003842594 00000 n 
-0003846699 00000 n 
-0003842759 00000 n 
-0003843717 00000 n 
-0003841186 00000 n 
-0003838404 00000 n 
-0003842925 00000 n 
-0003842985 00000 n 
-0003843107 00000 n 
-0003843168 00000 n 
-0003843229 00000 n 
-0003843351 00000 n 
-0003842087 00000 n 
-0003843412 00000 n 
-0003843473 00000 n 
-0003843595 00000 n 
-0003843656 00000 n 
-0003846870 00000 n 
-0003847033 00000 n 
-0003847202 00000 n 
-0003847374 00000 n 
-0003847699 00000 n 
-0003847870 00000 n 
-0003848042 00000 n 
-0003852170 00000 n 
-0003848203 00000 n 
-0003849159 00000 n 
-0003846460 00000 n 
-0003843899 00000 n 
-0003848369 00000 n 
-0003848429 00000 n 
-0003848550 00000 n 
-0003848611 00000 n 
-0003848671 00000 n 
-0003848793 00000 n 
-0003847537 00000 n 
-0003848854 00000 n 
-0003848915 00000 n 
-0003849037 00000 n 
-0003849098 00000 n 
-0003852341 00000 n 
-0003852563 00000 n 
-0003852785 00000 n 
-0003853618 00000 n 
-0003851991 00000 n 
-0003849341 00000 n 
-0003852951 00000 n 
-0003853011 00000 n 
-0003853132 00000 n 
-0003853193 00000 n 
-0003853253 00000 n 
-0003853375 00000 n 
-0003853436 00000 n 
-0003853497 00000 n 
-0003857009 00000 n 
-0003857182 00000 n 
-0003857405 00000 n 
-0003857591 00000 n 
-0003857777 00000 n 
-0003857970 00000 n 
-0003858173 00000 n 
-0003859130 00000 n 
-0003856800 00000 n 
-0003853862 00000 n 
-0003858339 00000 n 
-0003858399 00000 n 
-0003858460 00000 n 
-0003858582 00000 n 
-0003858643 00000 n 
-0003858704 00000 n 
-0003858825 00000 n 
-0003858886 00000 n 
-0003859008 00000 n 
-0003859069 00000 n 
-0003862918 00000 n 
-0003863124 00000 n 
-0003863329 00000 n 
-0003863521 00000 n 
-0003863743 00000 n 
-0003863916 00000 n 
-0003864102 00000 n 
-0003864475 00000 n 
-0003864645 00000 n 
-0003865493 00000 n 
-0003862679 00000 n 
-0003859325 00000 n 
-0003864811 00000 n 
-0003864937 00000 n 
-0003864998 00000 n 
-0003865059 00000 n 
-0003865185 00000 n 
-0003865246 00000 n 
-0003865307 00000 n 
-0003864288 00000 n 
-0003865433 00000 n 
-0003873736 00000 n 
-0003869117 00000 n 
-0003870019 00000 n 
-0003868968 00000 n 
-0003865700 00000 n 
-0003869283 00000 n 
-0003869343 00000 n 
-0003869465 00000 n 
-0003869591 00000 n 
-0003869650 00000 n 
-0003869772 00000 n 
-0003869833 00000 n 
-0003869959 00000 n 
-0004868473 00000 n 
-0003873933 00000 n 
-0003874838 00000 n 
-0003873577 00000 n 
-0003870214 00000 n 
-0003874099 00000 n 
-0003874159 00000 n 
-0003874286 00000 n 
-0003874347 00000 n 
-0003874408 00000 n 
-0003874530 00000 n 
-0003874657 00000 n 
-0003874778 00000 n 
-0003877252 00000 n 
-0003877472 00000 n 
-0003877692 00000 n 
-0003877879 00000 n 
-0003878099 00000 n 
-0003878320 00000 n 
-0003878507 00000 n 
-0003878727 00000 n 
-0003878947 00000 n 
-0003879164 00000 n 
-0003879384 00000 n 
-0003879605 00000 n 
-0003879826 00000 n 
-0003880047 00000 n 
-0003880267 00000 n 
-0003880453 00000 n 
-0003884576 00000 n 
-0003880672 00000 n 
-0003881753 00000 n 
-0003876943 00000 n 
-0003875020 00000 n 
-0003880838 00000 n 
-0003880964 00000 n 
-0003881025 00000 n 
-0003881086 00000 n 
-0003881266 00000 n 
-0003881327 00000 n 
-0003881388 00000 n 
-0003881449 00000 n 
-0003881510 00000 n 
-0003881571 00000 n 
-0003881632 00000 n 
-0003881693 00000 n 
-0003921924 00000 n 
-0003922046 00000 n 
-0003884796 00000 n 
-0003885017 00000 n 
-0003885203 00000 n 
-0003885422 00000 n 
-0003885643 00000 n 
-0003885848 00000 n 
-0003886066 00000 n 
-0003886272 00000 n 
-0003886491 00000 n 
-0003886712 00000 n 
-0003886931 00000 n 
-0003887152 00000 n 
-0003887373 00000 n 
-0003887594 00000 n 
-0003887815 00000 n 
-0003888036 00000 n 
-0003888257 00000 n 
-0003888478 00000 n 
-0003888699 00000 n 
-0003888920 00000 n 
-0003889141 00000 n 
-0003889361 00000 n 
-0003889581 00000 n 
-0003889802 00000 n 
-0003890023 00000 n 
-0003890244 00000 n 
-0003890465 00000 n 
-0003890686 00000 n 
-0003890906 00000 n 
-0003895513 00000 n 
-0003895733 00000 n 
-0003895953 00000 n 
-0003896173 00000 n 
-0003896392 00000 n 
-0003896613 00000 n 
-0003896834 00000 n 
-0003891123 00000 n 
-0003892445 00000 n 
-0003884127 00000 n 
-0003881949 00000 n 
-0003891289 00000 n 
-0003891349 00000 n 
-0003891410 00000 n 
-0003891471 00000 n 
-0003891532 00000 n 
-0003891593 00000 n 
-0003891654 00000 n 
-0003891715 00000 n 
-0003891776 00000 n 
-0003891837 00000 n 
-0003891898 00000 n 
-0003891959 00000 n 
-0003892020 00000 n 
-0003892081 00000 n 
-0003892141 00000 n 
-0003892202 00000 n 
-0003892263 00000 n 
-0003892324 00000 n 
-0003892385 00000 n 
-0003922234 00000 n 
-0003897051 00000 n 
-0003897237 00000 n 
-0003897455 00000 n 
-0003897640 00000 n 
-0003897859 00000 n 
-0003898046 00000 n 
-0003898264 00000 n 
-0003898450 00000 n 
-0003898669 00000 n 
-0003898855 00000 n 
-0003899076 00000 n 
-0003899262 00000 n 
-0003899481 00000 n 
-0003899667 00000 n 
-0003899884 00000 n 
-0003900104 00000 n 
-0003900324 00000 n 
-0003900545 00000 n 
-0003900765 00000 n 
-0003900986 00000 n 
-0003901206 00000 n 
-0003901427 00000 n 
-0003901648 00000 n 
-0003901869 00000 n 
-0003902089 00000 n 
-0003902309 00000 n 
-0003906653 00000 n 
-0003906872 00000 n 
-0003902494 00000 n 
-0003903572 00000 n 
-0003895034 00000 n 
-0003892628 00000 n 
-0003902660 00000 n 
-0003902720 00000 n 
-0003902781 00000 n 
-0003902841 00000 n 
-0003902902 00000 n 
-0003902963 00000 n 
-0003903023 00000 n 
-0003903084 00000 n 
-0003903145 00000 n 
-0003903206 00000 n 
-0003903267 00000 n 
-0003903328 00000 n 
-0003903389 00000 n 
-0003903450 00000 n 
-0003903511 00000 n 
-0003922354 00000 n 
-0003922480 00000 n 
-0003922668 00000 n 
-0003922790 00000 n 
-0003925890 00000 n 
-0003907092 00000 n 
-0003907313 00000 n 
-0003907533 00000 n 
-0003907719 00000 n 
-0003907905 00000 n 
-0003908125 00000 n 
-0003908312 00000 n 
-0003908499 00000 n 
-0003908720 00000 n 
-0003908907 00000 n 
-0003909094 00000 n 
-0003909315 00000 n 
-0003909502 00000 n 
-0003909723 00000 n 
-0003909910 00000 n 
-0003910097 00000 n 
-0003910318 00000 n 
-0003910505 00000 n 
-0003910692 00000 n 
-0003910912 00000 n 
-0003911099 00000 n 
-0003911286 00000 n 
-0003911507 00000 n 
-0003911694 00000 n 
-0003912011 00000 n 
-0003912197 00000 n 
-0003912789 00000 n 
-0003906224 00000 n 
-0003903782 00000 n 
-0003912363 00000 n 
-0003912423 00000 n 
-0003912484 00000 n 
-0003912545 00000 n 
-0003912606 00000 n 
-0003912667 00000 n 
-0003912728 00000 n 
-0003911853 00000 n 
-0003926078 00000 n 
-0003926200 00000 n 
-0003926322 00000 n 
-0003926444 00000 n 
-0003914763 00000 n 
-0003914969 00000 n 
-0003915190 00000 n 
-0003915410 00000 n 
-0003915631 00000 n 
-0003915852 00000 n 
-0003916073 00000 n 
-0003916294 00000 n 
-0003916513 00000 n 
-0003916734 00000 n 
-0003916955 00000 n 
-0003920791 00000 n 
-0003917175 00000 n 
-0003917401 00000 n 
-0003914504 00000 n 
-0003912999 00000 n 
-0003917341 00000 n 
-0004868606 00000 n 
-0003920978 00000 n 
-0003921197 00000 n 
-0003921637 00000 n 
-0003922915 00000 n 
-0003920602 00000 n 
-0003917542 00000 n 
-0003921803 00000 n 
-0003921863 00000 n 
-0003921985 00000 n 
-0003922112 00000 n 
-0003921417 00000 n 
-0003922173 00000 n 
-0003922294 00000 n 
-0003922419 00000 n 
-0003922546 00000 n 
-0003922607 00000 n 
-0003922729 00000 n 
-0003922855 00000 n 
-0003925664 00000 n 
-0003926926 00000 n 
-0003925515 00000 n 
-0003923110 00000 n 
-0003925830 00000 n 
-0003925956 00000 n 
-0003926017 00000 n 
-0003926139 00000 n 
-0003926261 00000 n 
-0003926383 00000 n 
-0003926505 00000 n 
-0003926566 00000 n 
-0003926627 00000 n 
-0003926687 00000 n 
-0003926748 00000 n 
-0003929358 00000 n 
-0003929597 00000 n 
-0003929838 00000 n 
-0003930078 00000 n 
-0003930284 00000 n 
-0003930995 00000 n 
-0003929169 00000 n 
-0003927108 00000 n 
-0003930450 00000 n 
-0003930510 00000 n 
-0003930690 00000 n 
-0003930751 00000 n 
-0003930812 00000 n 
-0003930873 00000 n 
-0003930934 00000 n 
-0003934996 00000 n 
-0003933819 00000 n 
-0003934046 00000 n 
-0003934275 00000 n 
-0003934503 00000 n 
-0003934709 00000 n 
-0003935784 00000 n 
-0003933630 00000 n 
-0003931189 00000 n 
-0003934875 00000 n 
-0003934935 00000 n 
-0003935057 00000 n 
-0003935118 00000 n 
-0003935298 00000 n 
-0003935359 00000 n 
-0003935420 00000 n 
-0003935481 00000 n 
-0003935542 00000 n 
-0003935603 00000 n 
-0003935664 00000 n 
-0003935724 00000 n 
-0003938276 00000 n 
-0003942647 00000 n 
-0003942716 00000 n 
-0003942921 00000 n 
-0003943161 00000 n 
-0003943406 00000 n 
-0003943611 00000 n 
-0003943816 00000 n 
-0003944056 00000 n 
-0003944300 00000 n 
-0003944505 00000 n 
-0003944709 00000 n 
-0003944947 00000 n 
-0003948612 00000 n 
-0003948817 00000 n 
-0003949022 00000 n 
-0003949262 00000 n 
-0003945190 00000 n 
-0003945836 00000 n 
-0003938000 00000 n 
-0003936009 00000 n 
-0003945356 00000 n 
-0003945416 00000 n 
-0003945594 00000 n 
-0003945655 00000 n 
-0003939173 00000 n 
-0003939305 00000 n 
-0003939458 00000 n 
-0003939788 00000 n 
-0003940232 00000 n 
-0003940472 00000 n 
-0003940495 00000 n 
-0003942623 00000 n 
-0003949507 00000 n 
-0003949713 00000 n 
-0003949917 00000 n 
-0003950157 00000 n 
-0003950402 00000 n 
-0003950608 00000 n 
-0003950852 00000 n 
-0003951092 00000 n 
-0003951332 00000 n 
-0003951572 00000 n 
-0003951817 00000 n 
-0003952028 00000 n 
-0003952272 00000 n 
-0003952477 00000 n 
-0003952682 00000 n 
-0003952927 00000 n 
-0003953172 00000 n 
-0003953381 00000 n 
-0003953801 00000 n 
-0003954046 00000 n 
-0003954255 00000 n 
-0003954674 00000 n 
-0003955509 00000 n 
-0003948193 00000 n 
-0003946062 00000 n 
-0003954840 00000 n 
-0003954900 00000 n 
-0003954961 00000 n 
-0003955022 00000 n 
-0003955083 00000 n 
-0003955144 00000 n 
-0003955205 00000 n 
-0003955266 00000 n 
-0003953592 00000 n 
-0003954466 00000 n 
-0003955327 00000 n 
-0003955388 00000 n 
-0003955449 00000 n 
-0004868739 00000 n 
-0003964246 00000 n 
-0003959261 00000 n 
-0003959740 00000 n 
-0003960219 00000 n 
-0003960688 00000 n 
-0003959072 00000 n 
-0003955746 00000 n 
-0003960385 00000 n 
-0003959501 00000 n 
-0003959980 00000 n 
-0003960445 00000 n 
-0003960566 00000 n 
-0003960627 00000 n 
-0003963499 00000 n 
-0003963739 00000 n 
-0003967136 00000 n 
-0003963959 00000 n 
-0003964972 00000 n 
-0003963330 00000 n 
-0003960986 00000 n 
-0003964125 00000 n 
-0003964185 00000 n 
-0003964307 00000 n 
-0003964368 00000 n 
-0003964548 00000 n 
-0003964609 00000 n 
-0003964670 00000 n 
-0003964850 00000 n 
-0003964911 00000 n 
-0003967358 00000 n 
-0003967604 00000 n 
-0003967850 00000 n 
-0003968095 00000 n 
-0003968341 00000 n 
-0003968587 00000 n 
-0003968834 00000 n 
-0003969046 00000 n 
-0003969292 00000 n 
-0003969505 00000 n 
-0003969717 00000 n 
-0003969963 00000 n 
-0003970176 00000 n 
-0003970423 00000 n 
-0003971559 00000 n 
-0003966847 00000 n 
-0003965168 00000 n 
-0003970589 00000 n 
-0003970649 00000 n 
-0003970710 00000 n 
-0003970890 00000 n 
-0003970951 00000 n 
-0003971012 00000 n 
-0003971073 00000 n 
-0003971134 00000 n 
-0003971195 00000 n 
-0003971256 00000 n 
-0003971317 00000 n 
-0003971378 00000 n 
-0003971439 00000 n 
-0003973578 00000 n 
-0003973789 00000 n 
-0003974024 00000 n 
-0003974222 00000 n 
-0003974457 00000 n 
-0003977802 00000 n 
-0003978023 00000 n 
-0003974654 00000 n 
-0003975604 00000 n 
-0003973379 00000 n 
-0003971768 00000 n 
-0003974820 00000 n 
-0003974939 00000 n 
-0003975119 00000 n 
-0003975180 00000 n 
-0003975241 00000 n 
-0003975302 00000 n 
-0003975363 00000 n 
-0003975543 00000 n 
-0003978210 00000 n 
-0003978429 00000 n 
-0003978634 00000 n 
-0003978839 00000 n 
-0003979060 00000 n 
-0003979264 00000 n 
-0003979484 00000 n 
-0003979689 00000 n 
-0003979910 00000 n 
-0003980115 00000 n 
-0003980336 00000 n 
-0003980555 00000 n 
-0003980776 00000 n 
-0003980963 00000 n 
-0003981168 00000 n 
-0003981388 00000 n 
-0003981574 00000 n 
-0003981795 00000 n 
-0003982016 00000 n 
-0003982203 00000 n 
-0003982423 00000 n 
-0003982643 00000 n 
-0003982864 00000 n 
-0003983051 00000 n 
-0003983272 00000 n 
-0003983459 00000 n 
-0003983646 00000 n 
-0003983866 00000 n 
-0003984052 00000 n 
-0003984238 00000 n 
-0003984455 00000 n 
-0003984638 00000 n 
-0003988916 00000 n 
-0003984820 00000 n 
-0003985837 00000 n 
-0003977313 00000 n 
-0003975827 00000 n 
-0003984986 00000 n 
-0003985046 00000 n 
-0003985107 00000 n 
-0003985168 00000 n 
-0003985229 00000 n 
-0003985290 00000 n 
-0003985350 00000 n 
-0003985411 00000 n 
-0003985471 00000 n 
-0003985532 00000 n 
-0003985593 00000 n 
-0003985715 00000 n 
-0003985776 00000 n 
-0003990738 00000 n 
-0003990982 00000 n 
-0003991165 00000 n 
-0003991287 00000 n 
-0003991409 00000 n 
-0003991531 00000 n 
-0003989103 00000 n 
-0003989290 00000 n 
-0003989510 00000 n 
-0003989730 00000 n 
-0003989950 00000 n 
-0003990171 00000 n 
-0003990390 00000 n 
-0003991653 00000 n 
-0003988697 00000 n 
-0003986046 00000 n 
-0003990556 00000 n 
-0003990616 00000 n 
-0003990677 00000 n 
-0003990799 00000 n 
-0003990860 00000 n 
-0003990921 00000 n 
-0003991043 00000 n 
-0003991104 00000 n 
-0003991226 00000 n 
-0003991348 00000 n 
-0003991470 00000 n 
-0003991592 00000 n 
-0004868872 00000 n 
-0003998061 00000 n 
-0003993721 00000 n 
-0003997992 00000 n 
-0003998248 00000 n 
-0003998453 00000 n 
-0003998692 00000 n 
-0003998941 00000 n 
-0003999146 00000 n 
-0003999351 00000 n 
-0003999591 00000 n 
-0003999840 00000 n 
-0004000045 00000 n 
-0004000250 00000 n 
-0004000490 00000 n 
-0004000740 00000 n 
-0004000946 00000 n 
-0004001151 00000 n 
-0004001391 00000 n 
-0004001641 00000 n 
-0004001847 00000 n 
-0004002052 00000 n 
-0004002291 00000 n 
-0004002540 00000 n 
-0004006322 00000 n 
-0004006571 00000 n 
-0004006811 00000 n 
-0004007051 00000 n 
-0004002743 00000 n 
-0004003451 00000 n 
-0003993345 00000 n 
-0003991861 00000 n 
-0004002909 00000 n 
-0004003088 00000 n 
-0004003149 00000 n 
-0004003329 00000 n 
-0004003390 00000 n 
-0003994671 00000 n 
-0003994803 00000 n 
-0003994956 00000 n 
-0003995282 00000 n 
-0003995720 00000 n 
-0003995960 00000 n 
-0003995983 00000 n 
-0003997968 00000 n 
-0004007291 00000 n 
-0004007538 00000 n 
-0004007776 00000 n 
-0004008014 00000 n 
-0004008264 00000 n 
-0004008479 00000 n 
-0004008729 00000 n 
-0004008935 00000 n 
-0004009185 00000 n 
-0004009435 00000 n 
-0004009651 00000 n 
-0004010081 00000 n 
-0004010331 00000 n 
-0004010547 00000 n 
-0004010977 00000 n 
-0004011163 00000 n 
-0004011876 00000 n 
-0004005963 00000 n 
-0004003662 00000 n 
-0004011329 00000 n 
-0004011389 00000 n 
-0004011450 00000 n 
-0004011511 00000 n 
-0004011572 00000 n 
-0004011633 00000 n 
-0004009866 00000 n 
-0004010762 00000 n 
-0004011694 00000 n 
-0004011755 00000 n 
-0004011816 00000 n 
-0004016218 00000 n 
-0004016462 00000 n 
-0004015510 00000 n 
-0004015750 00000 n 
-0004016584 00000 n 
-0004015351 00000 n 
-0004012099 00000 n 
-0004015916 00000 n 
-0004015976 00000 n 
-0004016096 00000 n 
-0004016157 00000 n 
-0004016279 00000 n 
-0004016340 00000 n 
-0004016401 00000 n 
-0004016523 00000 n 
-0004019516 00000 n 
-0004019740 00000 n 
-0004019966 00000 n 
-0004020153 00000 n 
-0004020379 00000 n 
-0004020566 00000 n 
-0004020753 00000 n 
-0004020958 00000 n 
-0004021185 00000 n 
-0004021412 00000 n 
-0004021598 00000 n 
-0004021825 00000 n 
-0004022052 00000 n 
-0004022256 00000 n 
-0004022482 00000 n 
-0004022687 00000 n 
-0004022914 00000 n 
-0004023141 00000 n 
-0004023368 00000 n 
-0004023595 00000 n 
-0004023822 00000 n 
-0004024027 00000 n 
-0004024253 00000 n 
-0004028025 00000 n 
-0004028252 00000 n 
-0004024443 00000 n 
-0004025701 00000 n 
-0004019137 00000 n 
-0004016830 00000 n 
-0004024609 00000 n 
-0004024669 00000 n 
-0004024849 00000 n 
-0004024910 00000 n 
-0004024971 00000 n 
-0004025032 00000 n 
-0004025091 00000 n 
-0004025152 00000 n 
-0004025213 00000 n 
-0004025274 00000 n 
-0004025335 00000 n 
-0004025396 00000 n 
-0004025457 00000 n 
-0004025518 00000 n 
-0004025579 00000 n 
-0004025640 00000 n 
-0004029734 00000 n 
-0004028445 00000 n 
-0004028665 00000 n 
-0004028885 00000 n 
-0004029106 00000 n 
-0004029326 00000 n 
-0004030524 00000 n 
-0004027816 00000 n 
-0004025926 00000 n 
-0004029492 00000 n 
-0004029552 00000 n 
-0004029613 00000 n 
-0004029673 00000 n 
-0004029795 00000 n 
-0004029856 00000 n 
-0004029917 00000 n 
-0004029978 00000 n 
-0004030158 00000 n 
-0004030219 00000 n 
-0004030280 00000 n 
-0004030341 00000 n 
-0004030402 00000 n 
-0004030463 00000 n 
-0004031493 00000 n 
-0004031780 00000 n 
-0004031344 00000 n 
-0004030734 00000 n 
-0004031659 00000 n 
-0004031719 00000 n 
-0004869005 00000 n 
-0004033959 00000 n 
-0004034110 00000 n 
-0004034261 00000 n 
-0004034414 00000 n 
-0004034566 00000 n 
-0004034719 00000 n 
-0004034872 00000 n 
-0004035023 00000 n 
-0004035176 00000 n 
-0004035328 00000 n 
-0004035479 00000 n 
-0004035632 00000 n 
-0004035784 00000 n 
-0004035937 00000 n 
-0004036088 00000 n 
-0004036241 00000 n 
-0004036393 00000 n 
-0004036544 00000 n 
-0004036697 00000 n 
-0004036849 00000 n 
-0004037002 00000 n 
-0004037153 00000 n 
-0004037306 00000 n 
-0004037459 00000 n 
-0004037611 00000 n 
-0004037762 00000 n 
-0004037915 00000 n 
-0004038068 00000 n 
-0004038220 00000 n 
-0004038373 00000 n 
-0004038524 00000 n 
-0004038677 00000 n 
-0004038830 00000 n 
-0004038981 00000 n 
-0004039130 00000 n 
-0004039282 00000 n 
-0004039435 00000 n 
-0004039588 00000 n 
-0004039741 00000 n 
-0004039894 00000 n 
-0004040046 00000 n 
-0004040198 00000 n 
-0004040351 00000 n 
-0004040504 00000 n 
-0004040656 00000 n 
-0004040809 00000 n 
-0004040961 00000 n 
-0004041113 00000 n 
-0004041266 00000 n 
-0004041419 00000 n 
-0004041572 00000 n 
-0004041724 00000 n 
-0004041876 00000 n 
-0004042029 00000 n 
-0004042182 00000 n 
-0004042335 00000 n 
-0004042488 00000 n 
-0004042641 00000 n 
-0004042794 00000 n 
-0004042947 00000 n 
-0004043099 00000 n 
-0004043251 00000 n 
-0004043404 00000 n 
-0004043557 00000 n 
-0004043709 00000 n 
-0004043860 00000 n 
-0004046538 00000 n 
-0004044010 00000 n 
-0004044297 00000 n 
-0004033150 00000 n 
-0004031921 00000 n 
-0004044176 00000 n 
-0004044236 00000 n 
-0004046690 00000 n 
-0004046842 00000 n 
-0004046995 00000 n 
-0004047146 00000 n 
-0004047298 00000 n 
-0004047449 00000 n 
-0004047601 00000 n 
-0004047753 00000 n 
-0004047905 00000 n 
-0004048057 00000 n 
-0004048210 00000 n 
-0004048363 00000 n 
-0004048516 00000 n 
-0004048669 00000 n 
-0004048820 00000 n 
-0004048973 00000 n 
-0004049125 00000 n 
-0004049277 00000 n 
-0004049430 00000 n 
-0004049581 00000 n 
-0004049734 00000 n 
-0004049886 00000 n 
-0004050038 00000 n 
-0004050191 00000 n 
-0004050342 00000 n 
-0004050494 00000 n 
-0004050645 00000 n 
-0004050798 00000 n 
-0004050949 00000 n 
-0004051101 00000 n 
-0004051254 00000 n 
-0004051406 00000 n 
-0004051558 00000 n 
-0004051710 00000 n 
-0004051861 00000 n 
-0004052011 00000 n 
-0004052164 00000 n 
-0004052314 00000 n 
-0004052466 00000 n 
-0004052618 00000 n 
-0004052771 00000 n 
-0004052924 00000 n 
-0004053076 00000 n 
-0004053229 00000 n 
-0004053380 00000 n 
-0004053531 00000 n 
-0004053682 00000 n 
-0004053833 00000 n 
-0004053984 00000 n 
-0004054137 00000 n 
-0004054289 00000 n 
-0004054441 00000 n 
-0004054594 00000 n 
-0004054746 00000 n 
-0004054899 00000 n 
-0004055050 00000 n 
-0004055203 00000 n 
-0004055356 00000 n 
-0004055509 00000 n 
-0004055659 00000 n 
-0004055808 00000 n 
-0004056034 00000 n 
-0004045779 00000 n 
-0004044425 00000 n 
-0004055974 00000 n 
-0004430026 00000 n 
-0004058666 00000 n 
-0004058817 00000 n 
-0004058970 00000 n 
-0004059120 00000 n 
-0004059273 00000 n 
-0004059424 00000 n 
-0004059576 00000 n 
-0004059728 00000 n 
-0004059879 00000 n 
-0004060032 00000 n 
-0004060182 00000 n 
-0004060335 00000 n 
-0004060487 00000 n 
-0004060639 00000 n 
-0004060792 00000 n 
-0004060944 00000 n 
-0004061096 00000 n 
-0004061248 00000 n 
-0004061400 00000 n 
-0004061553 00000 n 
-0004061704 00000 n 
-0004061857 00000 n 
-0004062009 00000 n 
-0004062161 00000 n 
-0004062314 00000 n 
-0004062466 00000 n 
-0004062619 00000 n 
-0004062770 00000 n 
-0004062923 00000 n 
-0004063075 00000 n 
-0004063227 00000 n 
-0004063380 00000 n 
-0004063531 00000 n 
-0004063681 00000 n 
-0004063832 00000 n 
-0004063984 00000 n 
-0004064136 00000 n 
-0004064288 00000 n 
-0004064439 00000 n 
-0004064591 00000 n 
-0004064741 00000 n 
-0004064893 00000 n 
-0004065043 00000 n 
-0004065194 00000 n 
-0004065345 00000 n 
-0004065497 00000 n 
-0004065649 00000 n 
-0004065800 00000 n 
-0004065952 00000 n 
-0004066104 00000 n 
-0004066255 00000 n 
-0004066407 00000 n 
-0004066559 00000 n 
-0004066711 00000 n 
-0004066862 00000 n 
-0004067012 00000 n 
-0004067164 00000 n 
-0004067316 00000 n 
-0004067467 00000 n 
-0004067618 00000 n 
-0004067769 00000 n 
-0004067921 00000 n 
-0004068072 00000 n 
-0004068224 00000 n 
-0004068376 00000 n 
-0004068526 00000 n 
-0004068678 00000 n 
-0004068828 00000 n 
-0004068980 00000 n 
-0004069131 00000 n 
-0004069283 00000 n 
-0004069434 00000 n 
-0004069586 00000 n 
-0004069738 00000 n 
-0004069890 00000 n 
-0004070042 00000 n 
-0004070194 00000 n 
-0004070346 00000 n 
-0004070498 00000 n 
-0004070649 00000 n 
-0004070801 00000 n 
-0004070952 00000 n 
-0004071104 00000 n 
-0004071256 00000 n 
-0004071408 00000 n 
-0004071559 00000 n 
-0004071710 00000 n 
-0004071860 00000 n 
-0004074890 00000 n 
-0004072009 00000 n 
-0004072235 00000 n 
-0004057637 00000 n 
-0004056162 00000 n 
-0004072175 00000 n 
-0004429992 00000 n 
-0004075042 00000 n 
-0004075194 00000 n 
-0004075346 00000 n 
-0004075498 00000 n 
-0004075649 00000 n 
-0004075801 00000 n 
-0004075952 00000 n 
-0004076104 00000 n 
-0004076254 00000 n 
-0004076405 00000 n 
-0004076557 00000 n 
-0004076709 00000 n 
-0004076861 00000 n 
-0004077013 00000 n 
-0004077165 00000 n 
-0004077316 00000 n 
-0004077468 00000 n 
-0004077620 00000 n 
-0004077772 00000 n 
-0004077924 00000 n 
-0004078076 00000 n 
-0004078228 00000 n 
-0004078380 00000 n 
-0004078532 00000 n 
-0004078682 00000 n 
-0004078834 00000 n 
-0004078985 00000 n 
-0004079137 00000 n 
-0004079288 00000 n 
-0004079440 00000 n 
-0004079592 00000 n 
-0004079743 00000 n 
-0004079895 00000 n 
-0004080046 00000 n 
-0004080198 00000 n 
-0004080349 00000 n 
-0004080500 00000 n 
-0004080650 00000 n 
-0004080802 00000 n 
-0004080953 00000 n 
-0004081104 00000 n 
-0004081255 00000 n 
-0004081407 00000 n 
-0004081559 00000 n 
-0004081710 00000 n 
-0004081862 00000 n 
-0004082014 00000 n 
-0004082166 00000 n 
-0004082318 00000 n 
-0004082470 00000 n 
-0004082622 00000 n 
-0004082772 00000 n 
-0004082922 00000 n 
-0004083071 00000 n 
-0004083221 00000 n 
-0004083373 00000 n 
-0004083525 00000 n 
-0004083676 00000 n 
-0004083827 00000 n 
-0004083978 00000 n 
-0004084129 00000 n 
-0004084281 00000 n 
-0004084434 00000 n 
-0004084587 00000 n 
-0004084740 00000 n 
-0004084893 00000 n 
-0004085046 00000 n 
-0004085199 00000 n 
-0004085352 00000 n 
-0004085505 00000 n 
-0004085658 00000 n 
-0004085811 00000 n 
-0004085964 00000 n 
-0004086117 00000 n 
-0004086270 00000 n 
-0004086422 00000 n 
-0004086574 00000 n 
-0004086725 00000 n 
-0004086877 00000 n 
-0004087029 00000 n 
-0004087181 00000 n 
-0004087334 00000 n 
-0004087487 00000 n 
-0004087639 00000 n 
-0004087792 00000 n 
-0004087944 00000 n 
-0004090760 00000 n 
-0004088093 00000 n 
-0004088319 00000 n 
-0004073871 00000 n 
-0004072363 00000 n 
-0004088259 00000 n 
-0004429958 00000 n 
-0004090913 00000 n 
-0004091066 00000 n 
-0004091219 00000 n 
-0004091372 00000 n 
-0004091524 00000 n 
-0004091677 00000 n 
-0004091829 00000 n 
-0004091982 00000 n 
-0004092134 00000 n 
-0004092287 00000 n 
-0004092437 00000 n 
-0004092590 00000 n 
-0004092742 00000 n 
-0004092894 00000 n 
-0004093047 00000 n 
-0004093199 00000 n 
-0004093351 00000 n 
-0004093503 00000 n 
-0004093655 00000 n 
-0004093807 00000 n 
-0004093960 00000 n 
-0004094112 00000 n 
-0004094263 00000 n 
-0004094415 00000 n 
-0004094568 00000 n 
-0004094721 00000 n 
-0004094873 00000 n 
-0004095024 00000 n 
-0004095176 00000 n 
-0004095328 00000 n 
-0004095480 00000 n 
-0004095633 00000 n 
-0004095785 00000 n 
-0004095936 00000 n 
-0004096087 00000 n 
-0004096240 00000 n 
-0004096393 00000 n 
-0004096544 00000 n 
-0004096697 00000 n 
-0004096850 00000 n 
-0004097002 00000 n 
-0004097155 00000 n 
-0004097308 00000 n 
-0004097461 00000 n 
-0004097614 00000 n 
-0004097766 00000 n 
-0004097919 00000 n 
-0004098071 00000 n 
-0004098224 00000 n 
-0004098377 00000 n 
-0004098530 00000 n 
-0004098681 00000 n 
-0004098833 00000 n 
-0004098986 00000 n 
-0004099138 00000 n 
-0004099287 00000 n 
-0004099438 00000 n 
-0004099591 00000 n 
-0004099744 00000 n 
-0004099897 00000 n 
-0004100050 00000 n 
-0004100202 00000 n 
-0004100355 00000 n 
-0004100506 00000 n 
-0004100659 00000 n 
-0004100811 00000 n 
-0004100962 00000 n 
-0004101113 00000 n 
-0004101339 00000 n 
-0004089931 00000 n 
-0004088447 00000 n 
-0004101279 00000 n 
-0004103867 00000 n 
-0004104020 00000 n 
-0004104172 00000 n 
-0004104325 00000 n 
-0004104478 00000 n 
-0004104628 00000 n 
-0004104781 00000 n 
-0004104933 00000 n 
-0004105086 00000 n 
-0004105238 00000 n 
-0004105391 00000 n 
-0004105543 00000 n 
-0004105696 00000 n 
-0004105849 00000 n 
-0004106001 00000 n 
-0004106152 00000 n 
-0004106305 00000 n 
-0004106458 00000 n 
-0004106611 00000 n 
-0004106764 00000 n 
-0004106917 00000 n 
-0004107068 00000 n 
-0004107221 00000 n 
-0004107373 00000 n 
-0004107525 00000 n 
-0004107678 00000 n 
-0004107831 00000 n 
-0004107984 00000 n 
-0004108137 00000 n 
-0004108289 00000 n 
-0004108440 00000 n 
-0004108593 00000 n 
-0004108745 00000 n 
-0004108897 00000 n 
-0004109050 00000 n 
-0004109202 00000 n 
-0004109353 00000 n 
-0004109504 00000 n 
-0004109655 00000 n 
-0004109808 00000 n 
-0004109961 00000 n 
-0004110113 00000 n 
-0004110266 00000 n 
-0004110418 00000 n 
-0004110571 00000 n 
-0004110723 00000 n 
-0004110876 00000 n 
-0004111028 00000 n 
-0004111180 00000 n 
-0004111331 00000 n 
-0004111484 00000 n 
-0004111636 00000 n 
-0004111789 00000 n 
-0004111942 00000 n 
-0004112095 00000 n 
-0004112248 00000 n 
-0004112401 00000 n 
-0004112553 00000 n 
-0004112706 00000 n 
-0004112856 00000 n 
-0004113009 00000 n 
-0004113162 00000 n 
-0004113315 00000 n 
-0004113468 00000 n 
-0004113621 00000 n 
-0004113772 00000 n 
-0004113922 00000 n 
-0004114073 00000 n 
-0004114225 00000 n 
-0004114377 00000 n 
-0004114529 00000 n 
-0004114678 00000 n 
-0004117478 00000 n 
-0004114829 00000 n 
-0004115055 00000 n 
-0004102998 00000 n 
-0004101467 00000 n 
-0004114995 00000 n 
-0004869138 00000 n 
-0004429924 00000 n 
-0004117629 00000 n 
-0004117782 00000 n 
-0004117935 00000 n 
-0004118087 00000 n 
-0004118240 00000 n 
-0004118392 00000 n 
-0004118545 00000 n 
-0004118698 00000 n 
-0004118850 00000 n 
-0004119002 00000 n 
-0004119154 00000 n 
-0004119307 00000 n 
-0004119460 00000 n 
-0004119610 00000 n 
-0004119762 00000 n 
-0004119915 00000 n 
-0004120068 00000 n 
-0004120219 00000 n 
-0004120372 00000 n 
-0004120524 00000 n 
-0004120677 00000 n 
-0004120830 00000 n 
-0004120983 00000 n 
-0004121136 00000 n 
-0004121289 00000 n 
-0004121441 00000 n 
-0004121593 00000 n 
-0004121745 00000 n 
-0004121898 00000 n 
-0004122051 00000 n 
-0004122203 00000 n 
-0004122356 00000 n 
-0004122509 00000 n 
-0004122662 00000 n 
-0004122815 00000 n 
-0004122968 00000 n 
-0004123121 00000 n 
-0004123272 00000 n 
-0004123425 00000 n 
-0004123576 00000 n 
-0004123728 00000 n 
-0004123881 00000 n 
-0004124034 00000 n 
-0004124187 00000 n 
-0004124340 00000 n 
-0004124493 00000 n 
-0004124647 00000 n 
-0004124800 00000 n 
-0004124953 00000 n 
-0004125105 00000 n 
-0004125258 00000 n 
-0004125411 00000 n 
-0004125564 00000 n 
-0004125717 00000 n 
-0004125870 00000 n 
-0004126023 00000 n 
-0004126176 00000 n 
-0004126327 00000 n 
-0004126480 00000 n 
-0004126630 00000 n 
-0004126781 00000 n 
-0004126932 00000 n 
-0004127083 00000 n 
-0004127234 00000 n 
-0004127384 00000 n 
-0004127535 00000 n 
-0004127688 00000 n 
-0004127840 00000 n 
-0004127990 00000 n 
-0004128216 00000 n 
-0004116639 00000 n 
-0004115183 00000 n 
-0004128156 00000 n 
-0004429890 00000 n 
-0004429856 00000 n 
-0004130611 00000 n 
-0004130764 00000 n 
-0004130917 00000 n 
-0004131070 00000 n 
-0004131223 00000 n 
-0004131376 00000 n 
-0004131528 00000 n 
-0004131681 00000 n 
-0004131831 00000 n 
-0004131984 00000 n 
-0004132135 00000 n 
-0004132287 00000 n 
-0004132440 00000 n 
-0004132592 00000 n 
-0004132745 00000 n 
-0004132898 00000 n 
-0004133050 00000 n 
-0004133203 00000 n 
-0004133356 00000 n 
-0004133507 00000 n 
-0004133660 00000 n 
-0004133811 00000 n 
-0004133962 00000 n 
-0004134114 00000 n 
-0004134266 00000 n 
-0004134418 00000 n 
-0004134571 00000 n 
-0004134723 00000 n 
-0004134876 00000 n 
-0004135029 00000 n 
-0004135182 00000 n 
-0004135335 00000 n 
-0004135488 00000 n 
-0004135639 00000 n 
-0004135790 00000 n 
-0004135942 00000 n 
-0004136094 00000 n 
-0004136245 00000 n 
-0004136397 00000 n 
-0004136549 00000 n 
-0004136701 00000 n 
-0004136854 00000 n 
-0004137006 00000 n 
-0004137159 00000 n 
-0004137311 00000 n 
-0004137464 00000 n 
-0004137617 00000 n 
-0004137768 00000 n 
-0004137918 00000 n 
-0004138071 00000 n 
-0004138224 00000 n 
-0004138375 00000 n 
-0004138528 00000 n 
-0004138682 00000 n 
-0004138836 00000 n 
-0004138989 00000 n 
-0004139141 00000 n 
-0004139294 00000 n 
-0004139443 00000 n 
-0004139595 00000 n 
-0004139747 00000 n 
-0004139900 00000 n 
-0004140053 00000 n 
-0004140206 00000 n 
-0004140358 00000 n 
-0004140510 00000 n 
-0004140662 00000 n 
-0004143392 00000 n 
-0004140813 00000 n 
-0004141039 00000 n 
-0004129792 00000 n 
-0004128344 00000 n 
-0004140979 00000 n 
-0004429822 00000 n 
-0004429788 00000 n 
-0004143544 00000 n 
-0004143696 00000 n 
-0004143849 00000 n 
-0004144002 00000 n 
-0004144155 00000 n 
-0004144308 00000 n 
-0004144461 00000 n 
-0004144615 00000 n 
-0004144768 00000 n 
-0004144921 00000 n 
-0004145073 00000 n 
-0004145226 00000 n 
-0004145379 00000 n 
-0004145532 00000 n 
-0004145684 00000 n 
-0004145837 00000 n 
-0004145990 00000 n 
-0004146143 00000 n 
-0004146296 00000 n 
-0004146449 00000 n 
-0004146602 00000 n 
-0004146754 00000 n 
-0004146906 00000 n 
-0004147059 00000 n 
-0004147211 00000 n 
-0004147361 00000 n 
-0004147512 00000 n 
-0004147664 00000 n 
-0004147817 00000 n 
-0004147969 00000 n 
-0004148121 00000 n 
-0004148273 00000 n 
-0004148426 00000 n 
-0004148576 00000 n 
-0004148728 00000 n 
-0004148881 00000 n 
-0004149034 00000 n 
-0004149187 00000 n 
-0004149340 00000 n 
-0004149493 00000 n 
-0004149646 00000 n 
-0004149799 00000 n 
-0004149952 00000 n 
-0004150105 00000 n 
-0004150258 00000 n 
-0004150411 00000 n 
-0004150564 00000 n 
-0004150717 00000 n 
-0004150869 00000 n 
-0004151021 00000 n 
-0004151174 00000 n 
-0004151325 00000 n 
-0004151478 00000 n 
-0004151631 00000 n 
-0004151783 00000 n 
-0004151935 00000 n 
-0004152088 00000 n 
-0004152241 00000 n 
-0004152394 00000 n 
-0004152547 00000 n 
-0004152699 00000 n 
-0004152851 00000 n 
-0004153003 00000 n 
-0004153156 00000 n 
-0004156118 00000 n 
-0004153307 00000 n 
-0004153533 00000 n 
-0004142593 00000 n 
-0004141167 00000 n 
-0004153473 00000 n 
-0004429754 00000 n 
-0004156270 00000 n 
-0004156423 00000 n 
-0004156575 00000 n 
-0004156728 00000 n 
-0004156881 00000 n 
-0004157034 00000 n 
-0004157186 00000 n 
-0004157337 00000 n 
-0004157490 00000 n 
-0004157643 00000 n 
-0004157796 00000 n 
-0004157946 00000 n 
-0004158098 00000 n 
-0004158250 00000 n 
-0004158402 00000 n 
-0004158554 00000 n 
-0004158706 00000 n 
-0004158858 00000 n 
-0004159010 00000 n 
-0004159163 00000 n 
-0004159315 00000 n 
-0004159467 00000 n 
-0004159620 00000 n 
-0004159773 00000 n 
-0004159926 00000 n 
-0004160079 00000 n 
-0004160232 00000 n 
-0004160383 00000 n 
-0004160536 00000 n 
-0004160688 00000 n 
-0004160841 00000 n 
-0004160994 00000 n 
-0004161145 00000 n 
-0004161296 00000 n 
-0004161449 00000 n 
-0004161602 00000 n 
-0004161755 00000 n 
-0004161907 00000 n 
-0004162060 00000 n 
-0004162212 00000 n 
-0004162365 00000 n 
-0004162517 00000 n 
-0004162670 00000 n 
-0004162823 00000 n 
-0004162976 00000 n 
-0004163128 00000 n 
-0004163281 00000 n 
-0004163432 00000 n 
-0004163585 00000 n 
-0004163738 00000 n 
-0004163891 00000 n 
-0004164044 00000 n 
-0004164197 00000 n 
-0004164350 00000 n 
-0004164502 00000 n 
-0004164655 00000 n 
-0004164808 00000 n 
-0004164961 00000 n 
-0004165114 00000 n 
-0004165267 00000 n 
-0004165420 00000 n 
-0004165571 00000 n 
-0004165723 00000 n 
-0004165876 00000 n 
-0004166028 00000 n 
-0004166181 00000 n 
-0004166333 00000 n 
-0004166486 00000 n 
-0004166637 00000 n 
-0004166789 00000 n 
-0004166942 00000 n 
-0004167095 00000 n 
-0004167248 00000 n 
-0004167401 00000 n 
-0004167554 00000 n 
-0004167707 00000 n 
-0004167859 00000 n 
-0004168011 00000 n 
-0004168162 00000 n 
-0004168312 00000 n 
-0004168538 00000 n 
-0004155169 00000 n 
-0004153661 00000 n 
-0004168478 00000 n 
-0004429720 00000 n 
-0004429686 00000 n 
-0004429652 00000 n 
-0004170829 00000 n 
-0004170981 00000 n 
-0004171134 00000 n 
-0004171287 00000 n 
-0004171439 00000 n 
-0004171592 00000 n 
-0004171745 00000 n 
-0004171898 00000 n 
-0004172051 00000 n 
-0004172204 00000 n 
-0004172357 00000 n 
-0004172509 00000 n 
-0004172662 00000 n 
-0004172815 00000 n 
-0004172967 00000 n 
-0004173120 00000 n 
-0004173272 00000 n 
-0004173425 00000 n 
-0004173578 00000 n 
-0004173730 00000 n 
-0004173881 00000 n 
-0004174033 00000 n 
-0004174186 00000 n 
-0004174339 00000 n 
-0004174492 00000 n 
-0004174645 00000 n 
-0004174798 00000 n 
-0004174951 00000 n 
-0004175104 00000 n 
-0004175256 00000 n 
-0004175407 00000 n 
-0004175560 00000 n 
-0004175713 00000 n 
-0004175866 00000 n 
-0004176017 00000 n 
-0004176167 00000 n 
-0004176316 00000 n 
-0004176469 00000 n 
-0004176622 00000 n 
-0004176774 00000 n 
-0004176926 00000 n 
-0004177078 00000 n 
-0004177229 00000 n 
-0004177382 00000 n 
-0004177535 00000 n 
-0004177687 00000 n 
-0004177839 00000 n 
-0004177992 00000 n 
-0004178144 00000 n 
-0004178297 00000 n 
-0004178451 00000 n 
-0004178604 00000 n 
-0004178756 00000 n 
-0004178907 00000 n 
-0004179060 00000 n 
-0004179213 00000 n 
-0004179366 00000 n 
-0004179519 00000 n 
-0004179671 00000 n 
-0004179822 00000 n 
-0004179975 00000 n 
-0004180128 00000 n 
-0004180281 00000 n 
-0004180433 00000 n 
-0004180586 00000 n 
-0004180739 00000 n 
-0004180891 00000 n 
-0004181043 00000 n 
-0004181195 00000 n 
-0004181348 00000 n 
-0004181501 00000 n 
-0004181654 00000 n 
-0004181806 00000 n 
-0004181954 00000 n 
-0004184695 00000 n 
-0004182103 00000 n 
-0004182329 00000 n 
-0004169940 00000 n 
-0004168692 00000 n 
-0004182269 00000 n 
-0004429618 00000 n 
-0004429584 00000 n 
-0004429550 00000 n 
-0004184848 00000 n 
-0004185001 00000 n 
-0004185153 00000 n 
-0004185305 00000 n 
-0004185458 00000 n 
-0004185611 00000 n 
-0004185763 00000 n 
-0004185916 00000 n 
-0004186068 00000 n 
-0004186221 00000 n 
-0004186374 00000 n 
-0004186527 00000 n 
-0004186680 00000 n 
-0004186833 00000 n 
-0004186986 00000 n 
-0004187139 00000 n 
-0004187290 00000 n 
-0004187442 00000 n 
-0004187595 00000 n 
-0004187748 00000 n 
-0004187899 00000 n 
-0004188051 00000 n 
-0004188204 00000 n 
-0004188357 00000 n 
-0004188509 00000 n 
-0004188662 00000 n 
-0004188811 00000 n 
-0004188962 00000 n 
-0004189113 00000 n 
-0004189265 00000 n 
-0004189418 00000 n 
-0004189571 00000 n 
-0004189724 00000 n 
-0004189877 00000 n 
-0004190030 00000 n 
-0004190182 00000 n 
-0004190333 00000 n 
-0004190485 00000 n 
-0004190637 00000 n 
-0004190789 00000 n 
-0004190941 00000 n 
-0004191093 00000 n 
-0004191245 00000 n 
-0004191396 00000 n 
-0004191547 00000 n 
-0004191698 00000 n 
-0004191849 00000 n 
-0004192002 00000 n 
-0004192155 00000 n 
-0004192308 00000 n 
-0004192461 00000 n 
-0004192613 00000 n 
-0004192766 00000 n 
-0004192918 00000 n 
-0004193070 00000 n 
-0004193223 00000 n 
-0004193376 00000 n 
-0004193529 00000 n 
-0004193682 00000 n 
-0004193835 00000 n 
-0004193988 00000 n 
-0004194140 00000 n 
-0004194293 00000 n 
-0004194446 00000 n 
-0004194599 00000 n 
-0004194752 00000 n 
-0004194904 00000 n 
-0004198393 00000 n 
-0004195053 00000 n 
-0004195279 00000 n 
-0004183866 00000 n 
-0004182457 00000 n 
-0004195219 00000 n 
-0004869271 00000 n 
-0004198545 00000 n 
-0004198697 00000 n 
-0004198849 00000 n 
-0004199001 00000 n 
-0004199152 00000 n 
-0004199304 00000 n 
-0004199454 00000 n 
-0004199606 00000 n 
-0004199757 00000 n 
-0004199909 00000 n 
-0004200061 00000 n 
-0004200213 00000 n 
-0004200365 00000 n 
-0004200518 00000 n 
-0004200671 00000 n 
-0004200823 00000 n 
-0004200976 00000 n 
-0004201129 00000 n 
-0004201281 00000 n 
-0004201434 00000 n 
-0004201587 00000 n 
-0004201740 00000 n 
-0004201894 00000 n 
-0004202047 00000 n 
-0004202200 00000 n 
-0004202352 00000 n 
-0004202505 00000 n 
-0004202658 00000 n 
-0004202811 00000 n 
-0004202964 00000 n 
-0004203116 00000 n 
-0004203269 00000 n 
-0004203421 00000 n 
-0004203574 00000 n 
-0004203726 00000 n 
-0004203878 00000 n 
-0004204031 00000 n 
-0004204184 00000 n 
-0004204336 00000 n 
-0004204489 00000 n 
-0004204641 00000 n 
-0004204793 00000 n 
-0004204946 00000 n 
-0004205099 00000 n 
-0004205251 00000 n 
-0004205404 00000 n 
-0004205557 00000 n 
-0004205710 00000 n 
-0004205863 00000 n 
-0004206015 00000 n 
-0004206168 00000 n 
-0004206321 00000 n 
-0004206473 00000 n 
-0004206624 00000 n 
-0004206775 00000 n 
-0004206926 00000 n 
-0004207079 00000 n 
-0004207231 00000 n 
-0004207385 00000 n 
-0004207537 00000 n 
-0004207690 00000 n 
-0004207842 00000 n 
-0004207994 00000 n 
-0004208146 00000 n 
-0004208299 00000 n 
-0004208451 00000 n 
-0004208604 00000 n 
-0004208756 00000 n 
-0004208908 00000 n 
-0004209059 00000 n 
-0004209211 00000 n 
-0004209364 00000 n 
-0004209517 00000 n 
-0004209669 00000 n 
-0004209821 00000 n 
-0004209974 00000 n 
-0004210127 00000 n 
-0004210280 00000 n 
-0004210433 00000 n 
-0004210586 00000 n 
-0004210739 00000 n 
-0004210892 00000 n 
-0004211045 00000 n 
-0004211197 00000 n 
-0004211350 00000 n 
-0004211503 00000 n 
-0004211656 00000 n 
-0004211809 00000 n 
-0004211961 00000 n 
-0004212114 00000 n 
-0004212266 00000 n 
-0004212418 00000 n 
-0004212570 00000 n 
-0004212723 00000 n 
-0004212876 00000 n 
-0004213030 00000 n 
-0004213182 00000 n 
-0004213333 00000 n 
-0004213485 00000 n 
-0004213638 00000 n 
-0004213790 00000 n 
-0004213943 00000 n 
-0004214096 00000 n 
-0004214249 00000 n 
-0004214401 00000 n 
-0004214554 00000 n 
-0004214707 00000 n 
-0004214859 00000 n 
-0004215011 00000 n 
-0004215162 00000 n 
-0004215313 00000 n 
-0004218823 00000 n 
-0004215464 00000 n 
-0004215690 00000 n 
-0004197124 00000 n 
-0004195407 00000 n 
-0004215630 00000 n 
-0004429516 00000 n 
-0004218976 00000 n 
-0004219129 00000 n 
-0004219282 00000 n 
-0004219435 00000 n 
-0004219587 00000 n 
-0004219740 00000 n 
-0004219893 00000 n 
-0004220045 00000 n 
-0004220197 00000 n 
-0004220350 00000 n 
-0004220503 00000 n 
-0004220655 00000 n 
-0004220807 00000 n 
-0004220959 00000 n 
-0004221111 00000 n 
-0004221264 00000 n 
-0004221416 00000 n 
-0004221568 00000 n 
-0004221721 00000 n 
-0004221870 00000 n 
-0004222021 00000 n 
-0004222174 00000 n 
-0004222326 00000 n 
-0004222478 00000 n 
-0004222631 00000 n 
-0004222784 00000 n 
-0004222937 00000 n 
-0004223090 00000 n 
-0004223242 00000 n 
-0004223395 00000 n 
-0004223548 00000 n 
-0004223700 00000 n 
-0004223853 00000 n 
-0004224006 00000 n 
-0004224158 00000 n 
-0004224311 00000 n 
-0004224463 00000 n 
-0004224617 00000 n 
-0004224769 00000 n 
-0004224921 00000 n 
-0004225074 00000 n 
-0004225227 00000 n 
-0004225379 00000 n 
-0004225531 00000 n 
-0004225683 00000 n 
-0004225836 00000 n 
-0004225987 00000 n 
-0004226138 00000 n 
-0004226291 00000 n 
-0004226444 00000 n 
-0004226597 00000 n 
-0004226749 00000 n 
-0004226902 00000 n 
-0004227054 00000 n 
-0004227204 00000 n 
-0004227357 00000 n 
-0004227510 00000 n 
-0004227662 00000 n 
-0004227815 00000 n 
-0004227968 00000 n 
-0004228121 00000 n 
-0004228274 00000 n 
-0004228426 00000 n 
-0004228577 00000 n 
-0004228728 00000 n 
-0004228880 00000 n 
-0004229032 00000 n 
-0004229185 00000 n 
-0004229338 00000 n 
-0004229491 00000 n 
-0004229643 00000 n 
-0004229796 00000 n 
-0004229949 00000 n 
-0004230102 00000 n 
-0004230255 00000 n 
-0004230406 00000 n 
-0004230557 00000 n 
-0004230710 00000 n 
-0004230863 00000 n 
-0004231016 00000 n 
-0004231169 00000 n 
-0004231320 00000 n 
-0004231473 00000 n 
-0004231626 00000 n 
-0004231777 00000 n 
-0004231930 00000 n 
-0004232083 00000 n 
-0004232236 00000 n 
-0004232389 00000 n 
-0004232541 00000 n 
-0004232693 00000 n 
-0004232844 00000 n 
-0004232996 00000 n 
-0004233149 00000 n 
-0004233301 00000 n 
-0004233454 00000 n 
-0004233607 00000 n 
-0004233760 00000 n 
-0004233912 00000 n 
-0004234065 00000 n 
-0004234218 00000 n 
-0004234371 00000 n 
-0004234524 00000 n 
-0004234676 00000 n 
-0004234828 00000 n 
-0004234980 00000 n 
-0004235132 00000 n 
-0004235285 00000 n 
-0004235437 00000 n 
-0004235590 00000 n 
-0004235741 00000 n 
-0004235893 00000 n 
-0004236044 00000 n 
-0004236195 00000 n 
-0004236346 00000 n 
-0004239758 00000 n 
-0004236497 00000 n 
-0004236723 00000 n 
-0004217514 00000 n 
-0004215831 00000 n 
-0004236663 00000 n 
-0004239909 00000 n 
-0004240062 00000 n 
-0004240215 00000 n 
-0004240366 00000 n 
-0004240519 00000 n 
-0004240671 00000 n 
-0004240824 00000 n 
-0004240975 00000 n 
-0004241128 00000 n 
-0004241281 00000 n 
-0004241433 00000 n 
-0004241586 00000 n 
-0004241739 00000 n 
-0004241892 00000 n 
-0004242045 00000 n 
-0004242198 00000 n 
-0004242350 00000 n 
-0004242503 00000 n 
-0004242656 00000 n 
-0004242809 00000 n 
-0004242962 00000 n 
-0004243114 00000 n 
-0004243267 00000 n 
-0004243420 00000 n 
-0004243572 00000 n 
-0004243724 00000 n 
-0004243876 00000 n 
-0004244029 00000 n 
-0004244182 00000 n 
-0004244335 00000 n 
-0004244488 00000 n 
-0004244640 00000 n 
-0004244792 00000 n 
-0004244945 00000 n 
-0004245097 00000 n 
-0004245249 00000 n 
-0004245402 00000 n 
-0004245554 00000 n 
-0004245707 00000 n 
-0004245859 00000 n 
-0004246011 00000 n 
-0004246164 00000 n 
-0004246315 00000 n 
-0004246468 00000 n 
-0004246621 00000 n 
-0004246774 00000 n 
-0004246926 00000 n 
-0004247076 00000 n 
-0004247227 00000 n 
-0004247380 00000 n 
-0004247533 00000 n 
-0004247686 00000 n 
-0004247839 00000 n 
-0004247992 00000 n 
-0004248144 00000 n 
-0004248297 00000 n 
-0004248449 00000 n 
-0004248602 00000 n 
-0004248754 00000 n 
-0004248907 00000 n 
-0004249060 00000 n 
-0004249213 00000 n 
-0004249365 00000 n 
-0004249516 00000 n 
-0004249670 00000 n 
-0004249822 00000 n 
-0004249973 00000 n 
-0004250127 00000 n 
-0004250279 00000 n 
-0004250428 00000 n 
-0004250580 00000 n 
-0004250733 00000 n 
-0004250885 00000 n 
-0004251038 00000 n 
-0004251190 00000 n 
-0004251343 00000 n 
-0004251496 00000 n 
-0004251649 00000 n 
-0004251801 00000 n 
-0004251954 00000 n 
-0004252107 00000 n 
-0004252260 00000 n 
-0004252413 00000 n 
-0004252565 00000 n 
-0004252718 00000 n 
-0004252871 00000 n 
-0004253024 00000 n 
-0004253176 00000 n 
-0004253329 00000 n 
-0004253481 00000 n 
-0004253634 00000 n 
-0004253785 00000 n 
-0004253937 00000 n 
-0004254089 00000 n 
-0004254240 00000 n 
-0004257834 00000 n 
-0004254391 00000 n 
-0004254617 00000 n 
-0004238649 00000 n 
-0004236864 00000 n 
-0004254557 00000 n 
-0004257987 00000 n 
-0004258140 00000 n 
-0004258292 00000 n 
-0004258445 00000 n 
-0004258598 00000 n 
-0004258751 00000 n 
-0004258904 00000 n 
-0004259057 00000 n 
-0004259210 00000 n 
-0004259363 00000 n 
-0004259514 00000 n 
-0004259666 00000 n 
-0004259818 00000 n 
-0004259971 00000 n 
-0004260124 00000 n 
-0004260277 00000 n 
-0004260430 00000 n 
-0004260583 00000 n 
-0004260734 00000 n 
-0004260887 00000 n 
-0004261040 00000 n 
-0004261193 00000 n 
-0004261346 00000 n 
-0004261499 00000 n 
-0004261652 00000 n 
-0004261805 00000 n 
-0004261957 00000 n 
-0004262108 00000 n 
-0004262261 00000 n 
-0004262414 00000 n 
-0004262566 00000 n 
-0004262719 00000 n 
-0004262872 00000 n 
-0004263025 00000 n 
-0004263177 00000 n 
-0004263330 00000 n 
-0004263482 00000 n 
-0004263635 00000 n 
-0004263788 00000 n 
-0004263941 00000 n 
-0004264094 00000 n 
-0004264246 00000 n 
-0004264399 00000 n 
-0004264552 00000 n 
-0004264704 00000 n 
-0004264857 00000 n 
-0004265009 00000 n 
-0004265161 00000 n 
-0004265313 00000 n 
-0004265464 00000 n 
-0004265616 00000 n 
-0004265768 00000 n 
-0004265920 00000 n 
-0004266073 00000 n 
-0004266226 00000 n 
-0004266379 00000 n 
-0004266531 00000 n 
-0004266684 00000 n 
-0004266837 00000 n 
-0004266989 00000 n 
-0004267141 00000 n 
-0004267293 00000 n 
-0004267444 00000 n 
-0004267594 00000 n 
-0004267746 00000 n 
-0004267898 00000 n 
-0004268051 00000 n 
-0004268203 00000 n 
-0004268356 00000 n 
-0004268508 00000 n 
-0004268661 00000 n 
-0004268812 00000 n 
-0004268965 00000 n 
-0004269118 00000 n 
-0004269270 00000 n 
-0004269423 00000 n 
-0004269575 00000 n 
-0004269728 00000 n 
-0004269880 00000 n 
-0004270032 00000 n 
-0004270185 00000 n 
-0004270338 00000 n 
-0004270491 00000 n 
-0004270644 00000 n 
-0004270797 00000 n 
-0004270949 00000 n 
-0004271102 00000 n 
-0004271255 00000 n 
-0004271408 00000 n 
-0004271561 00000 n 
-0004271713 00000 n 
-0004271866 00000 n 
-0004272019 00000 n 
-0004272172 00000 n 
-0004272325 00000 n 
-0004272478 00000 n 
-0004272630 00000 n 
-0004272784 00000 n 
-0004272935 00000 n 
-0004273088 00000 n 
-0004273240 00000 n 
-0004273391 00000 n 
-0004273543 00000 n 
-0004273696 00000 n 
-0004273849 00000 n 
-0004274001 00000 n 
-0004274154 00000 n 
-0004274306 00000 n 
-0004274459 00000 n 
-0004274611 00000 n 
-0004274764 00000 n 
-0004274917 00000 n 
-0004275070 00000 n 
-0004275223 00000 n 
-0004275375 00000 n 
-0004275528 00000 n 
-0004275681 00000 n 
-0004275833 00000 n 
-0004275985 00000 n 
-0004276136 00000 n 
-0004279762 00000 n 
-0004276287 00000 n 
-0004276513 00000 n 
-0004256475 00000 n 
-0004254758 00000 n 
-0004276453 00000 n 
-0004279915 00000 n 
-0004280067 00000 n 
-0004280220 00000 n 
-0004280373 00000 n 
-0004280526 00000 n 
-0004280678 00000 n 
-0004280831 00000 n 
-0004280983 00000 n 
-0004281135 00000 n 
-0004281286 00000 n 
-0004281439 00000 n 
-0004281592 00000 n 
-0004281744 00000 n 
-0004281897 00000 n 
-0004282050 00000 n 
-0004282203 00000 n 
-0004282355 00000 n 
-0004282508 00000 n 
-0004282660 00000 n 
-0004282813 00000 n 
-0004282965 00000 n 
-0004283119 00000 n 
-0004283272 00000 n 
-0004283425 00000 n 
-0004283578 00000 n 
-0004283731 00000 n 
-0004283883 00000 n 
-0004284036 00000 n 
-0004284188 00000 n 
-0004284341 00000 n 
-0004284494 00000 n 
-0004284647 00000 n 
-0004284800 00000 n 
-0004284952 00000 n 
-0004285105 00000 n 
-0004285258 00000 n 
-0004285410 00000 n 
-0004285563 00000 n 
-0004285716 00000 n 
-0004285869 00000 n 
-0004286021 00000 n 
-0004286174 00000 n 
-0004286326 00000 n 
-0004286478 00000 n 
-0004286630 00000 n 
-0004286783 00000 n 
-0004286935 00000 n 
-0004287088 00000 n 
-0004287241 00000 n 
-0004287393 00000 n 
-0004287545 00000 n 
-0004287698 00000 n 
-0004287850 00000 n 
-0004287999 00000 n 
-0004288152 00000 n 
-0004288305 00000 n 
-0004288457 00000 n 
-0004288610 00000 n 
-0004288763 00000 n 
-0004288916 00000 n 
-0004289069 00000 n 
-0004289222 00000 n 
-0004289375 00000 n 
-0004289528 00000 n 
-0004289679 00000 n 
-0004289832 00000 n 
-0004289985 00000 n 
-0004290138 00000 n 
-0004290291 00000 n 
-0004290444 00000 n 
-0004290597 00000 n 
-0004290749 00000 n 
-0004290902 00000 n 
-0004291055 00000 n 
-0004291208 00000 n 
-0004291362 00000 n 
-0004291515 00000 n 
-0004291667 00000 n 
-0004291819 00000 n 
-0004291972 00000 n 
-0004292124 00000 n 
-0004292276 00000 n 
-0004292429 00000 n 
-0004292581 00000 n 
-0004292732 00000 n 
-0004292885 00000 n 
-0004293037 00000 n 
-0004293189 00000 n 
-0004293341 00000 n 
-0004293494 00000 n 
-0004293647 00000 n 
-0004293800 00000 n 
-0004293953 00000 n 
-0004294105 00000 n 
-0004294257 00000 n 
-0004294408 00000 n 
-0004294560 00000 n 
-0004294714 00000 n 
-0004294866 00000 n 
-0004295016 00000 n 
-0004295169 00000 n 
-0004295321 00000 n 
-0004295473 00000 n 
-0004295626 00000 n 
-0004295777 00000 n 
-0004295930 00000 n 
-0004296083 00000 n 
-0004296235 00000 n 
-0004296387 00000 n 
-0004296539 00000 n 
-0004296690 00000 n 
-0004300359 00000 n 
-0004296841 00000 n 
-0004297067 00000 n 
-0004278493 00000 n 
-0004276654 00000 n 
-0004297007 00000 n 
-0004300512 00000 n 
-0004300665 00000 n 
-0004300817 00000 n 
-0004300969 00000 n 
-0004301120 00000 n 
-0004301272 00000 n 
-0004301425 00000 n 
-0004301577 00000 n 
-0004301729 00000 n 
-0004301881 00000 n 
-0004302033 00000 n 
-0004302186 00000 n 
-0004302339 00000 n 
-0004302492 00000 n 
-0004302645 00000 n 
-0004302797 00000 n 
-0004302950 00000 n 
-0004303103 00000 n 
-0004303256 00000 n 
-0004303409 00000 n 
-0004303562 00000 n 
-0004303715 00000 n 
-0004303868 00000 n 
-0004304021 00000 n 
-0004304173 00000 n 
-0004304327 00000 n 
-0004304479 00000 n 
-0004304632 00000 n 
-0004304785 00000 n 
-0004304937 00000 n 
-0004305090 00000 n 
-0004305242 00000 n 
-0004305395 00000 n 
-0004305548 00000 n 
-0004305701 00000 n 
-0004305853 00000 n 
-0004306006 00000 n 
-0004306158 00000 n 
-0004306310 00000 n 
-0004306462 00000 n 
-0004306614 00000 n 
-0004306766 00000 n 
-0004306919 00000 n 
-0004307072 00000 n 
-0004307225 00000 n 
-0004307378 00000 n 
-0004307530 00000 n 
-0004307683 00000 n 
-0004307836 00000 n 
-0004307988 00000 n 
-0004308141 00000 n 
-0004308294 00000 n 
-0004308447 00000 n 
-0004308599 00000 n 
-0004308752 00000 n 
-0004308904 00000 n 
-0004309055 00000 n 
-0004309205 00000 n 
-0004309358 00000 n 
-0004309511 00000 n 
-0004309663 00000 n 
-0004309817 00000 n 
-0004309970 00000 n 
-0004310123 00000 n 
-0004310275 00000 n 
-0004310428 00000 n 
-0004310581 00000 n 
-0004310734 00000 n 
-0004310886 00000 n 
-0004311039 00000 n 
-0004311192 00000 n 
-0004311345 00000 n 
-0004311498 00000 n 
-0004311651 00000 n 
-0004311804 00000 n 
-0004311957 00000 n 
-0004312109 00000 n 
-0004312262 00000 n 
-0004312415 00000 n 
-0004312567 00000 n 
-0004312720 00000 n 
-0004312872 00000 n 
-0004313025 00000 n 
-0004313177 00000 n 
-0004313330 00000 n 
-0004313483 00000 n 
-0004313635 00000 n 
-0004313786 00000 n 
-0004313940 00000 n 
-0004314092 00000 n 
-0004314245 00000 n 
-0004314396 00000 n 
-0004314549 00000 n 
-0004314702 00000 n 
-0004314855 00000 n 
-0004315007 00000 n 
-0004315159 00000 n 
-0004315311 00000 n 
-0004315463 00000 n 
-0004315614 00000 n 
-0004315766 00000 n 
-0004315919 00000 n 
-0004316072 00000 n 
-0004316224 00000 n 
-0004316377 00000 n 
-0004316529 00000 n 
-0004316682 00000 n 
-0004316836 00000 n 
-0004316989 00000 n 
-0004317141 00000 n 
-0004317293 00000 n 
-0004317444 00000 n 
-0004317595 00000 n 
-0004317746 00000 n 
-0004321263 00000 n 
-0004317897 00000 n 
-0004318123 00000 n 
-0004299060 00000 n 
-0004297221 00000 n 
-0004318063 00000 n 
-0004869404 00000 n 
-0004321416 00000 n 
-0004321565 00000 n 
-0004321716 00000 n 
-0004321869 00000 n 
-0004322021 00000 n 
-0004322173 00000 n 
-0004322326 00000 n 
-0004322477 00000 n 
-0004322630 00000 n 
-0004322782 00000 n 
-0004322935 00000 n 
-0004323087 00000 n 
-0004323240 00000 n 
-0004323392 00000 n 
-0004323545 00000 n 
-0004323698 00000 n 
-0004323850 00000 n 
-0004324003 00000 n 
-0004324154 00000 n 
-0004324307 00000 n 
-0004324460 00000 n 
-0004324612 00000 n 
-0004324764 00000 n 
-0004324917 00000 n 
-0004325068 00000 n 
-0004325221 00000 n 
-0004325373 00000 n 
-0004325526 00000 n 
-0004325678 00000 n 
-0004325831 00000 n 
-0004325984 00000 n 
-0004326137 00000 n 
-0004326290 00000 n 
-0004326441 00000 n 
-0004326593 00000 n 
-0004326745 00000 n 
-0004326897 00000 n 
-0004327050 00000 n 
-0004327201 00000 n 
-0004327352 00000 n 
-0004327505 00000 n 
-0004327657 00000 n 
-0004327810 00000 n 
-0004327962 00000 n 
-0004328115 00000 n 
-0004328268 00000 n 
-0004328421 00000 n 
-0004328574 00000 n 
-0004328727 00000 n 
-0004328880 00000 n 
-0004329032 00000 n 
-0004329184 00000 n 
-0004329335 00000 n 
-0004329484 00000 n 
-0004329637 00000 n 
-0004329790 00000 n 
-0004329943 00000 n 
-0004330096 00000 n 
-0004330248 00000 n 
-0004330400 00000 n 
-0004330552 00000 n 
-0004330705 00000 n 
-0004330857 00000 n 
-0004331010 00000 n 
-0004331162 00000 n 
-0004331315 00000 n 
-0004331468 00000 n 
-0004331620 00000 n 
-0004331772 00000 n 
-0004331924 00000 n 
-0004332076 00000 n 
-0004332229 00000 n 
-0004332382 00000 n 
-0004332534 00000 n 
-0004332687 00000 n 
-0004332838 00000 n 
-0004332991 00000 n 
-0004333143 00000 n 
-0004333295 00000 n 
-0004333448 00000 n 
-0004333600 00000 n 
-0004333753 00000 n 
-0004333905 00000 n 
-0004334058 00000 n 
-0004334211 00000 n 
-0004334362 00000 n 
-0004334515 00000 n 
-0004334667 00000 n 
-0004334820 00000 n 
-0004334972 00000 n 
-0004335124 00000 n 
-0004335277 00000 n 
-0004335428 00000 n 
-0004335580 00000 n 
-0004335733 00000 n 
-0004335885 00000 n 
-0004336038 00000 n 
-0004336191 00000 n 
-0004336343 00000 n 
-0004336495 00000 n 
-0004336648 00000 n 
-0004336801 00000 n 
-0004336953 00000 n 
-0004337106 00000 n 
-0004337258 00000 n 
-0004337411 00000 n 
-0004337563 00000 n 
-0004337714 00000 n 
-0004341200 00000 n 
-0004337863 00000 n 
-0004338089 00000 n 
-0004320024 00000 n 
-0004318277 00000 n 
-0004338029 00000 n 
-0004341353 00000 n 
-0004341506 00000 n 
-0004341659 00000 n 
-0004341812 00000 n 
-0004341964 00000 n 
-0004342116 00000 n 
-0004342269 00000 n 
-0004342421 00000 n 
-0004342574 00000 n 
-0004342727 00000 n 
-0004342879 00000 n 
-0004343032 00000 n 
-0004343184 00000 n 
-0004343337 00000 n 
-0004343490 00000 n 
-0004343642 00000 n 
-0004343795 00000 n 
-0004343947 00000 n 
-0004344100 00000 n 
-0004344253 00000 n 
-0004344406 00000 n 
-0004344559 00000 n 
-0004344713 00000 n 
-0004344866 00000 n 
-0004345015 00000 n 
-0004345166 00000 n 
-0004345319 00000 n 
-0004345470 00000 n 
-0004345622 00000 n 
-0004345775 00000 n 
-0004345928 00000 n 
-0004346081 00000 n 
-0004346233 00000 n 
-0004346386 00000 n 
-0004346539 00000 n 
-0004346692 00000 n 
-0004346844 00000 n 
-0004346995 00000 n 
-0004347147 00000 n 
-0004347299 00000 n 
-0004347451 00000 n 
-0004347603 00000 n 
-0004347755 00000 n 
-0004347907 00000 n 
-0004348059 00000 n 
-0004348211 00000 n 
-0004348363 00000 n 
-0004348514 00000 n 
-0004348667 00000 n 
-0004348820 00000 n 
-0004348973 00000 n 
-0004349126 00000 n 
-0004349278 00000 n 
-0004349431 00000 n 
-0004349583 00000 n 
-0004349734 00000 n 
-0004349885 00000 n 
-0004350038 00000 n 
-0004350191 00000 n 
-0004350344 00000 n 
-0004350497 00000 n 
-0004350649 00000 n 
-0004350802 00000 n 
-0004350954 00000 n 
-0004351106 00000 n 
-0004351258 00000 n 
-0004351411 00000 n 
-0004351563 00000 n 
-0004351715 00000 n 
-0004351868 00000 n 
-0004352021 00000 n 
-0004352174 00000 n 
-0004352326 00000 n 
-0004352479 00000 n 
-0004352631 00000 n 
-0004352784 00000 n 
-0004352937 00000 n 
-0004353089 00000 n 
-0004353242 00000 n 
-0004353394 00000 n 
-0004353547 00000 n 
-0004353700 00000 n 
-0004353853 00000 n 
-0004354006 00000 n 
-0004354159 00000 n 
-0004354311 00000 n 
-0004354464 00000 n 
-0004354615 00000 n 
-0004354768 00000 n 
-0004354919 00000 n 
-0004355072 00000 n 
-0004355224 00000 n 
-0004355376 00000 n 
-0004355529 00000 n 
-0004355680 00000 n 
-0004355832 00000 n 
-0004355985 00000 n 
-0004356137 00000 n 
-0004356290 00000 n 
-0004356443 00000 n 
-0004356594 00000 n 
-0004356747 00000 n 
-0004356899 00000 n 
-0004357052 00000 n 
-0004357205 00000 n 
-0004357357 00000 n 
-0004357509 00000 n 
-0004357662 00000 n 
-0004357815 00000 n 
-0004357967 00000 n 
-0004358120 00000 n 
-0004358273 00000 n 
-0004358426 00000 n 
-0004358578 00000 n 
-0004358729 00000 n 
-0004361883 00000 n 
-0004358880 00000 n 
-0004359106 00000 n 
-0004339891 00000 n 
-0004338230 00000 n 
-0004359046 00000 n 
-0004429482 00000 n 
-0004362036 00000 n 
-0004362188 00000 n 
-0004362341 00000 n 
-0004362494 00000 n 
-0004362647 00000 n 
-0004362798 00000 n 
-0004362951 00000 n 
-0004363103 00000 n 
-0004363256 00000 n 
-0004363409 00000 n 
-0004363560 00000 n 
-0004363713 00000 n 
-0004363865 00000 n 
-0004364017 00000 n 
-0004364169 00000 n 
-0004364322 00000 n 
-0004364475 00000 n 
-0004364627 00000 n 
-0004364780 00000 n 
-0004364933 00000 n 
-0004365086 00000 n 
-0004365238 00000 n 
-0004365390 00000 n 
-0004365542 00000 n 
-0004365695 00000 n 
-0004365848 00000 n 
-0004366000 00000 n 
-0004366152 00000 n 
-0004366305 00000 n 
-0004366456 00000 n 
-0004366609 00000 n 
-0004366762 00000 n 
-0004366913 00000 n 
-0004367066 00000 n 
-0004367218 00000 n 
-0004367371 00000 n 
-0004367523 00000 n 
-0004367676 00000 n 
-0004367829 00000 n 
-0004367982 00000 n 
-0004368135 00000 n 
-0004368285 00000 n 
-0004368438 00000 n 
-0004368591 00000 n 
-0004368744 00000 n 
-0004368897 00000 n 
-0004369049 00000 n 
-0004369202 00000 n 
-0004369356 00000 n 
-0004369509 00000 n 
-0004369662 00000 n 
-0004369814 00000 n 
-0004369967 00000 n 
-0004370119 00000 n 
-0004370271 00000 n 
-0004370424 00000 n 
-0004370577 00000 n 
-0004370730 00000 n 
-0004370883 00000 n 
-0004371036 00000 n 
-0004371189 00000 n 
-0004371342 00000 n 
-0004371494 00000 n 
-0004371646 00000 n 
-0004371799 00000 n 
-0004371952 00000 n 
-0004372102 00000 n 
-0004372253 00000 n 
-0004372404 00000 n 
-0004372553 00000 n 
-0004375285 00000 n 
-0004372702 00000 n 
-0004372928 00000 n 
-0004361024 00000 n 
-0004359247 00000 n 
-0004372868 00000 n 
-0004429448 00000 n 
-0004375438 00000 n 
-0004375591 00000 n 
-0004375744 00000 n 
-0004375897 00000 n 
-0004376049 00000 n 
-0004376202 00000 n 
-0004376353 00000 n 
-0004376506 00000 n 
-0004376658 00000 n 
-0004376810 00000 n 
-0004376963 00000 n 
-0004377115 00000 n 
-0004377268 00000 n 
-0004377420 00000 n 
-0004377572 00000 n 
-0004377724 00000 n 
-0004377876 00000 n 
-0004378029 00000 n 
-0004378182 00000 n 
-0004378333 00000 n 
-0004378486 00000 n 
-0004378638 00000 n 
-0004378789 00000 n 
-0004378941 00000 n 
-0004379093 00000 n 
-0004379246 00000 n 
-0004379397 00000 n 
-0004379549 00000 n 
-0004379701 00000 n 
-0004379853 00000 n 
-0004380006 00000 n 
-0004380158 00000 n 
-0004380311 00000 n 
-0004380461 00000 n 
-0004380614 00000 n 
-0004380765 00000 n 
-0004380917 00000 n 
-0004381070 00000 n 
-0004381222 00000 n 
-0004381374 00000 n 
-0004381523 00000 n 
-0004381674 00000 n 
-0004381827 00000 n 
-0004381980 00000 n 
-0004382132 00000 n 
-0004382285 00000 n 
-0004382438 00000 n 
-0004382590 00000 n 
-0004382743 00000 n 
-0004382893 00000 n 
-0004383045 00000 n 
-0004383198 00000 n 
-0004383350 00000 n 
-0004383503 00000 n 
-0004383656 00000 n 
-0004383808 00000 n 
-0004383960 00000 n 
-0004384113 00000 n 
-0004384266 00000 n 
-0004384419 00000 n 
-0004384572 00000 n 
-0004384725 00000 n 
-0004384878 00000 n 
-0004385031 00000 n 
-0004385184 00000 n 
-0004385337 00000 n 
-0004385489 00000 n 
-0004385641 00000 n 
-0004385794 00000 n 
-0004385947 00000 n 
-0004386099 00000 n 
-0004386252 00000 n 
-0004386404 00000 n 
-0004386557 00000 n 
-0004386710 00000 n 
-0004386863 00000 n 
-0004387016 00000 n 
-0004387169 00000 n 
-0004389824 00000 n 
-0004387318 00000 n 
-0004387544 00000 n 
-0004374346 00000 n 
-0004373069 00000 n 
-0004387484 00000 n 
-0004389976 00000 n 
-0004390128 00000 n 
-0004390279 00000 n 
-0004390431 00000 n 
-0004390583 00000 n 
-0004390735 00000 n 
-0004390887 00000 n 
-0004391039 00000 n 
-0004391190 00000 n 
-0004391342 00000 n 
-0004391494 00000 n 
-0004391646 00000 n 
-0004391798 00000 n 
-0004391950 00000 n 
-0004392100 00000 n 
-0004392252 00000 n 
-0004392404 00000 n 
-0004392556 00000 n 
-0004392707 00000 n 
-0004392859 00000 n 
-0004393011 00000 n 
-0004393164 00000 n 
-0004393317 00000 n 
-0004393470 00000 n 
-0004393622 00000 n 
-0004393772 00000 n 
-0004393922 00000 n 
-0004394074 00000 n 
-0004394226 00000 n 
-0004394377 00000 n 
-0004394529 00000 n 
-0004394682 00000 n 
-0004394835 00000 n 
-0004394987 00000 n 
-0004395140 00000 n 
-0004395292 00000 n 
-0004395444 00000 n 
-0004395597 00000 n 
-0004395750 00000 n 
-0004395903 00000 n 
-0004396056 00000 n 
-0004396208 00000 n 
-0004396361 00000 n 
-0004396514 00000 n 
-0004396667 00000 n 
-0004396820 00000 n 
-0004396973 00000 n 
-0004397126 00000 n 
-0004397278 00000 n 
-0004397431 00000 n 
-0004397584 00000 n 
-0004397736 00000 n 
-0004397889 00000 n 
-0004398041 00000 n 
-0004398193 00000 n 
-0004398344 00000 n 
-0004398497 00000 n 
-0004398649 00000 n 
-0004398802 00000 n 
-0004398955 00000 n 
-0004399108 00000 n 
-0004399260 00000 n 
-0004402191 00000 n 
-0004399410 00000 n 
-0004399636 00000 n 
-0004389045 00000 n 
-0004387672 00000 n 
-0004399576 00000 n 
-0004402343 00000 n 
-0004402495 00000 n 
-0004402648 00000 n 
-0004402800 00000 n 
-0004402953 00000 n 
-0004403106 00000 n 
-0004403259 00000 n 
-0004403411 00000 n 
-0004403564 00000 n 
-0004403717 00000 n 
-0004403867 00000 n 
-0004404019 00000 n 
-0004404171 00000 n 
-0004404324 00000 n 
-0004404476 00000 n 
-0004404628 00000 n 
-0004404781 00000 n 
-0004404934 00000 n 
-0004405087 00000 n 
-0004405240 00000 n 
-0004405393 00000 n 
-0004405546 00000 n 
-0004405698 00000 n 
-0004405851 00000 n 
-0004406003 00000 n 
-0004406156 00000 n 
-0004406309 00000 n 
-0004406462 00000 n 
-0004406614 00000 n 
-0004406766 00000 n 
-0004406919 00000 n 
-0004407072 00000 n 
-0004407224 00000 n 
-0004407376 00000 n 
-0004407529 00000 n 
-0004407681 00000 n 
-0004407833 00000 n 
-0004407986 00000 n 
-0004408139 00000 n 
-0004408292 00000 n 
-0004408444 00000 n 
-0004408594 00000 n 
-0004408744 00000 n 
-0004408896 00000 n 
-0004409049 00000 n 
-0004409202 00000 n 
-0004409354 00000 n 
-0004409507 00000 n 
-0004409660 00000 n 
-0004409808 00000 n 
-0004409956 00000 n 
-0004410109 00000 n 
-0004410262 00000 n 
-0004410415 00000 n 
-0004410568 00000 n 
-0004410719 00000 n 
-0004410870 00000 n 
-0004411023 00000 n 
-0004411176 00000 n 
-0004411329 00000 n 
-0004411482 00000 n 
-0004411635 00000 n 
-0004411788 00000 n 
-0004411941 00000 n 
-0004412092 00000 n 
-0004412245 00000 n 
-0004412397 00000 n 
-0004412550 00000 n 
-0004412702 00000 n 
-0004412855 00000 n 
-0004413006 00000 n 
-0004413156 00000 n 
-0004413306 00000 n 
-0004413457 00000 n 
-0004413608 00000 n 
-0004413759 00000 n 
-0004416101 00000 n 
-0004413910 00000 n 
-0004414136 00000 n 
-0004401272 00000 n 
-0004399764 00000 n 
-0004414076 00000 n 
-0004869537 00000 n 
-0004416254 00000 n 
-0004416405 00000 n 
-0004416558 00000 n 
-0004416709 00000 n 
-0004416862 00000 n 
-0004417014 00000 n 
-0004417167 00000 n 
-0004417320 00000 n 
-0004417473 00000 n 
-0004417623 00000 n 
-0004417776 00000 n 
-0004417928 00000 n 
-0004418080 00000 n 
-0004418232 00000 n 
-0004418384 00000 n 
-0004418536 00000 n 
-0004418687 00000 n 
-0004418840 00000 n 
-0004418992 00000 n 
-0004419143 00000 n 
-0004419295 00000 n 
-0004419447 00000 n 
-0004419599 00000 n 
-0004419751 00000 n 
-0004419903 00000 n 
-0004420055 00000 n 
-0004420206 00000 n 
-0004420357 00000 n 
-0004420509 00000 n 
-0004420661 00000 n 
-0004420813 00000 n 
-0004420962 00000 n 
-0004421113 00000 n 
-0004421264 00000 n 
-0004421414 00000 n 
-0004421564 00000 n 
-0004421714 00000 n 
-0004421865 00000 n 
-0004422016 00000 n 
-0004422167 00000 n 
-0004422318 00000 n 
-0004422469 00000 n 
-0004422620 00000 n 
-0004422771 00000 n 
-0004422922 00000 n 
-0004423073 00000 n 
-0004423224 00000 n 
-0004423375 00000 n 
-0004423526 00000 n 
-0004423677 00000 n 
-0004423828 00000 n 
-0004423979 00000 n 
-0004424129 00000 n 
-0004424279 00000 n 
-0004424429 00000 n 
-0004424580 00000 n 
-0004424731 00000 n 
-0004424882 00000 n 
-0004426506 00000 n 
-0004425031 00000 n 
-0004425257 00000 n 
-0004415362 00000 n 
-0004414264 00000 n 
-0004425197 00000 n 
-0004426658 00000 n 
-0004426810 00000 n 
-0004426962 00000 n 
-0004427115 00000 n 
-0004427268 00000 n 
-0004427421 00000 n 
-0004427573 00000 n 
-0004427726 00000 n 
-0004427879 00000 n 
-0004428031 00000 n 
-0004428184 00000 n 
-0004428334 00000 n 
-0004428486 00000 n 
-0004428638 00000 n 
-0004428791 00000 n 
-0004428942 00000 n 
-0004429094 00000 n 
-0004429320 00000 n 
-0004426187 00000 n 
-0004425385 00000 n 
-0004429260 00000 n 
-0004430094 00000 n 
-0004430137 00000 n 
-0004430164 00000 n 
-0004430269 00000 n 
-0004430727 00000 n 
-0004431358 00000 n 
-0004431505 00000 n 
-0004432170 00000 n 
-0004432324 00000 n 
-0004850273 00000 n 
-0004432363 00000 n 
-0004432840 00000 n 
-0004432879 00000 n 
-0004433192 00000 n 
-0004433549 00000 n 
-0004434127 00000 n 
-0004434154 00000 n 
-0004434791 00000 n 
-0004434963 00000 n 
-0004435243 00000 n 
-0004435564 00000 n 
-0004436198 00000 n 
-0004436453 00000 n 
-0004437148 00000 n 
-0004437841 00000 n 
-0004438352 00000 n 
-0004439023 00000 n 
-0004439607 00000 n 
-0004439793 00000 n 
-0004440691 00000 n 
-0004441254 00000 n 
-0004441913 00000 n 
-0004442306 00000 n 
-0004442882 00000 n 
-0004443782 00000 n 
-0004444481 00000 n 
-0004444526 00000 n 
-0004445188 00000 n 
-0004445542 00000 n 
-0004452873 00000 n 
-0004453107 00000 n 
-0004460153 00000 n 
-0004460377 00000 n 
-0004472726 00000 n 
-0004473412 00000 n 
-0004491734 00000 n 
-0004492167 00000 n 
-0004499311 00000 n 
-0004499548 00000 n 
-0004507462 00000 n 
-0004507692 00000 n 
-0004519179 00000 n 
-0004519460 00000 n 
-0004526606 00000 n 
-0004526842 00000 n 
-0004535398 00000 n 
-0004535690 00000 n 
-0004545283 00000 n 
-0004545539 00000 n 
-0004552652 00000 n 
-0004552877 00000 n 
-0004570640 00000 n 
-0004571064 00000 n 
-0004578521 00000 n 
-0004578757 00000 n 
-0004588551 00000 n 
-0004588812 00000 n 
-0004601123 00000 n 
-0004601458 00000 n 
-0004612477 00000 n 
-0004612774 00000 n 
-0004628125 00000 n 
-0004628834 00000 n 
-0004636143 00000 n 
-0004636391 00000 n 
-0004644835 00000 n 
-0004645120 00000 n 
-0004653558 00000 n 
-0004653866 00000 n 
-0004661778 00000 n 
-0004662036 00000 n 
-0004670420 00000 n 
-0004670751 00000 n 
-0004678844 00000 n 
-0004679072 00000 n 
-0004688151 00000 n 
-0004688385 00000 n 
-0004691972 00000 n 
-0004692209 00000 n 
-0004700086 00000 n 
-0004700364 00000 n 
-0004706517 00000 n 
-0004706767 00000 n 
-0004709310 00000 n 
-0004709604 00000 n 
-0004729383 00000 n 
-0004730011 00000 n 
-0004743601 00000 n 
-0004744016 00000 n 
-0004759047 00000 n 
-0004759566 00000 n 
-0004768475 00000 n 
-0004768796 00000 n 
-0004775815 00000 n 
-0004776173 00000 n 
-0004793765 00000 n 
-0004794273 00000 n 
-0004807214 00000 n 
-0004807580 00000 n 
-0004829952 00000 n 
-0004830672 00000 n 
-0004849683 00000 n 
-0004869640 00000 n 
-0004869763 00000 n 
-0004869891 00000 n 
-0004870019 00000 n 
-0004870147 00000 n 
-0004870275 00000 n 
-0004870403 00000 n 
-0004870531 00000 n 
-0004870659 00000 n 
-0004870787 00000 n 
-0004870921 00000 n 
-0004871055 00000 n 
-0004871189 00000 n 
-0004871323 00000 n 
-0004871457 00000 n 
-0004871591 00000 n 
-0004871725 00000 n 
-0004871849 00000 n 
-0004871984 00000 n 
-0004872119 00000 n 
-0004872244 00000 n 
-0004872331 00000 n 
-0004884413 00000 n 
-0004884584 00000 n 
-0004884919 00000 n 
-0004885588 00000 n 
-0004886326 00000 n 
-0004887064 00000 n 
-0004887802 00000 n 
-0004888540 00000 n 
-0004889278 00000 n 
-0004890016 00000 n 
-0004890754 00000 n 
-0004891492 00000 n 
-0004892230 00000 n 
-0004892968 00000 n 
-0004893706 00000 n 
-0004894444 00000 n 
-0004895182 00000 n 
-0004895920 00000 n 
-0004896658 00000 n 
-0004897396 00000 n 
-0004898134 00000 n 
-0004898872 00000 n 
-0004899610 00000 n 
-0004900348 00000 n 
-0004901102 00000 n 
-0004901864 00000 n 
-0004902582 00000 n 
-0004903272 00000 n 
-0004903962 00000 n 
-0004904652 00000 n 
-0004905342 00000 n 
-0004906032 00000 n 
-0004906722 00000 n 
-0004907412 00000 n 
-0004908102 00000 n 
-0004908792 00000 n 
-0004909482 00000 n 
-0004910172 00000 n 
-0004910862 00000 n 
-0004911552 00000 n 
-0004912242 00000 n 
-0004912932 00000 n 
-0004913622 00000 n 
-0004914312 00000 n 
-0004915002 00000 n 
-0004915692 00000 n 
-0004916382 00000 n 
-0004917134 00000 n 
-0004918016 00000 n 
-0004918898 00000 n 
-0004919714 00000 n 
-0004920546 00000 n 
-0004921378 00000 n 
-0004922136 00000 n 
-0004922906 00000 n 
-0004923676 00000 n 
-0004924492 00000 n 
-0004925422 00000 n 
-0004926077 00000 n 
-0004926863 00000 n 
-0004927649 00000 n 
-0004928435 00000 n 
-0004929221 00000 n 
-0004930007 00000 n 
-0004930793 00000 n 
-0004931579 00000 n 
-0004932365 00000 n 
-0004933151 00000 n 
-0004933937 00000 n 
-0004934723 00000 n 
-0004935509 00000 n 
-0004936295 00000 n 
-0004937081 00000 n 
-0004937867 00000 n 
-0004938653 00000 n 
-0004939439 00000 n 
-0004940224 00000 n 
-0004941009 00000 n 
-0004941724 00000 n 
-0004942542 00000 n 
-0004943416 00000 n 
-0004944266 00000 n 
-0004944978 00000 n 
-0004945940 00000 n 
-0004946845 00000 n 
-0004947655 00000 n 
-0004948465 00000 n 
-0004949275 00000 n 
-0004950085 00000 n 
-0004950895 00000 n 
-0004951705 00000 n 
-0004952515 00000 n 
-0004953277 00000 n 
-0004954023 00000 n 
-0004954769 00000 n 
-0004955515 00000 n 
-0004956261 00000 n 
-0004957007 00000 n 
-0004957753 00000 n 
-0004958499 00000 n 
-0004959245 00000 n 
-0004960017 00000 n 
-0004960911 00000 n 
-0004961873 00000 n 
-0004962616 00000 n 
-0004963562 00000 n 
-0004964406 00000 n 
-0004965216 00000 n 
-0004966026 00000 n 
-0004966836 00000 n 
-0004967646 00000 n 
-0004968424 00000 n 
-0004969170 00000 n 
-0004969916 00000 n 
-0004970662 00000 n 
-0004971408 00000 n 
-0004972154 00000 n 
-0004972900 00000 n 
-0004973646 00000 n 
-0004974392 00000 n 
-0004975204 00000 n 
-0004976049 00000 n 
-0004976795 00000 n 
-0004977541 00000 n 
-0004978301 00000 n 
-0004979043 00000 n 
-0004979797 00000 n 
-0004980551 00000 n 
-0004981305 00000 n 
-0004982047 00000 n 
-0004983025 00000 n 
-0004983963 00000 n 
-0004984925 00000 n 
-0004985716 00000 n 
-0004986398 00000 n 
-0004987280 00000 n 
-0004988064 00000 n 
-0004988826 00000 n 
-0004989588 00000 n 
-0004990276 00000 n 
-0004991078 00000 n 
-0004992016 00000 n 
-0004992818 00000 n 
-0004993620 00000 n 
-0004994422 00000 n 
-0004995224 00000 n 
-0004996026 00000 n 
-0004996764 00000 n 
-0004997502 00000 n 
-0004998240 00000 n 
-0004998978 00000 n 
-0004999716 00000 n 
-0005000619 00000 n 
-0005001357 00000 n 
-0005002095 00000 n 
-0005002833 00000 n 
-0005003571 00000 n 
-0005004309 00000 n 
-0005005047 00000 n 
-0005005785 00000 n 
-0005006523 00000 n 
-0005007212 00000 n 
-0005007947 00000 n 
-0005008809 00000 n 
-0005009811 00000 n 
-0005010667 00000 n 
-0005011523 00000 n 
-0005012379 00000 n 
-0005013235 00000 n 
-0005014091 00000 n 
-0005014947 00000 n 
-0005015755 00000 n 
-0005016646 00000 n 
-0005017438 00000 n 
-0005018230 00000 n 
-0005019022 00000 n 
-0005019814 00000 n 
-0005020606 00000 n 
-0005021398 00000 n 
-0005022190 00000 n 
-0005022982 00000 n 
-0005023774 00000 n 
-0005024543 00000 n 
-0005025241 00000 n 
-0005025939 00000 n 
-0005026637 00000 n 
-0005027335 00000 n 
-0005028033 00000 n 
-0005028731 00000 n 
-0005029429 00000 n 
-0005030127 00000 n 
-0005030825 00000 n 
-0005031523 00000 n 
-0005032221 00000 n 
-0005032919 00000 n 
-0005033617 00000 n 
-0005034315 00000 n 
-0005035013 00000 n 
-0005035711 00000 n 
-0005036409 00000 n 
-0005037110 00000 n 
-0005037910 00000 n 
-0005038887 00000 n 
-0005039856 00000 n 
-0005040882 00000 n 
-0005041868 00000 n 
-0005042814 00000 n 
-0005043696 00000 n 
-0005044624 00000 n 
-0005045602 00000 n 
-0005046595 00000 n 
-0005047611 00000 n 
-0005048547 00000 n 
-0005049388 00000 n 
-0005050053 00000 n 
-0005050789 00000 n 
-0005051476 00000 n 
-0005052370 00000 n 
-0005053332 00000 n 
-0005054274 00000 n 
-0005055346 00000 n 
-0005056283 00000 n 
-0005057099 00000 n 
-0005057915 00000 n 
-0005058731 00000 n 
-0005059547 00000 n 
-0005060363 00000 n 
-0005061179 00000 n 
-0005061995 00000 n 
-0005062810 00000 n 
-0005063626 00000 n 
-0005064442 00000 n 
-0005065258 00000 n 
-0005066074 00000 n 
-0005066890 00000 n 
-0005067706 00000 n 
-0005068522 00000 n 
-0005069338 00000 n 
-0005070083 00000 n 
-0005070851 00000 n 
-0005071619 00000 n 
-0005072387 00000 n 
-0005073155 00000 n 
-0005073923 00000 n 
-0005074691 00000 n 
-0005075459 00000 n 
-0005076225 00000 n 
-0005076993 00000 n 
-0005077767 00000 n 
-0005078681 00000 n 
-0005079522 00000 n 
-0005080356 00000 n 
-0005081124 00000 n 
-0005081892 00000 n 
-0005082660 00000 n 
-0005083527 00000 n 
-0005084361 00000 n 
-0005085129 00000 n 
-0005086075 00000 n 
-0005086963 00000 n 
-0005087755 00000 n 
-0005088547 00000 n 
-0005089339 00000 n 
-0005090019 00000 n 
-0005090819 00000 n 
-0005091619 00000 n 
-0005092419 00000 n 
-0005093219 00000 n 
-0005094019 00000 n 
-0005094819 00000 n 
-0005095619 00000 n 
-0005096419 00000 n 
-0005097219 00000 n 
-0005098019 00000 n 
-0005098819 00000 n 
-0005099619 00000 n 
-0005100419 00000 n 
-0005101219 00000 n 
-0005102019 00000 n 
-0005102819 00000 n 
-0005103619 00000 n 
-0005104419 00000 n 
-0005105219 00000 n 
-0005106019 00000 n 
-0005106846 00000 n 
-0005107725 00000 n 
-0005108549 00000 n 
-0005109373 00000 n 
-0005110127 00000 n 
-0005110994 00000 n 
-0005111762 00000 n 
-0005112530 00000 n 
-0005113430 00000 n 
-0005114297 00000 n 
-0005115065 00000 n 
-0005115778 00000 n 
-0005116602 00000 n 
-0005117426 00000 n 
-0005118250 00000 n 
-0005119062 00000 n 
-0005120048 00000 n 
-0005121034 00000 n 
-0005121923 00000 n 
-0005122715 00000 n 
-0005123507 00000 n 
-0005124299 00000 n 
-0005125091 00000 n 
-0005125883 00000 n 
-0005126687 00000 n 
-0005127575 00000 n 
-0005128463 00000 n 
-0005129351 00000 n 
-0005130239 00000 n 
-0005131127 00000 n 
-0005132015 00000 n 
-0005132903 00000 n 
-0005133791 00000 n 
-0005134679 00000 n 
-0005135567 00000 n 
-0005136455 00000 n 
-0005137343 00000 n 
-0005138231 00000 n 
-0005139119 00000 n 
-0005140007 00000 n 
-0005140895 00000 n 
-0005141711 00000 n 
-0005142527 00000 n 
-0005143343 00000 n 
-0005144159 00000 n 
-0005144975 00000 n 
-0005145791 00000 n 
-0005146607 00000 n 
-0005147423 00000 n 
-0005148239 00000 n 
-0005149055 00000 n 
-0005149871 00000 n 
-0005150687 00000 n 
-0005151503 00000 n 
-0005152319 00000 n 
-0005153135 00000 n 
-0005153951 00000 n 
-0005154737 00000 n 
-0005155561 00000 n 
-0005156385 00000 n 
-0005157140 00000 n 
-0005157964 00000 n 
-0005158699 00000 n 
-0005159451 00000 n 
-0005160203 00000 n 
-0005160955 00000 n 
-0005161707 00000 n 
-0005162459 00000 n 
-0005163211 00000 n 
-0005163963 00000 n 
-0005164715 00000 n 
-0005165467 00000 n 
-0005166219 00000 n 
-0005166971 00000 n 
-0005167723 00000 n 
-0005168475 00000 n 
-0005169227 00000 n 
-0005169979 00000 n 
-0005170731 00000 n 
-0005171483 00000 n 
-0005172235 00000 n 
-0005172940 00000 n 
-0005173676 00000 n 
-0005174412 00000 n 
-0005175148 00000 n 
-0005175884 00000 n 
-0005176620 00000 n 
-0005177356 00000 n 
-0005178092 00000 n 
-0005178853 00000 n 
-0005179654 00000 n 
-0005180510 00000 n 
-0005181341 00000 n 
-0005181994 00000 n 
-0005182834 00000 n 
-0005183800 00000 n 
-0005184623 00000 n 
-0005185359 00000 n 
-0005186038 00000 n 
-0005186822 00000 n 
-0005187606 00000 n 
-0005188325 00000 n 
-0005188931 00000 n 
-0005189541 00000 n 
-0005190151 00000 n 
-0005190761 00000 n 
-0005191371 00000 n 
-0005191981 00000 n 
-0005192591 00000 n 
-0005193201 00000 n 
-0005193811 00000 n 
-0005194557 00000 n 
-0005195439 00000 n 
-0005196321 00000 n 
-0005197203 00000 n 
-0005198085 00000 n 
-0005198967 00000 n 
-0005199849 00000 n 
-0005200731 00000 n 
-0005201613 00000 n 
-0005202495 00000 n 
-0005203377 00000 n 
-0005204259 00000 n 
-0005204774 00000 n 
-0005205100 00000 n 
-0005205326 00000 n 
-0005205566 00000 n 
-0005205786 00000 n 
-0005206001 00000 n 
-0005206219 00000 n 
-0005206435 00000 n 
-0005206654 00000 n 
-0005206984 00000 n 
-0005207212 00000 n 
-0005207547 00000 n 
-0005207865 00000 n 
-0005208195 00000 n 
-0005208524 00000 n 
-0005208885 00000 n 
-0005209188 00000 n 
-0005209527 00000 n 
-0005209824 00000 n 
-0005210034 00000 n 
-0005210363 00000 n 
-0005210572 00000 n 
-0005210868 00000 n 
-0005211110 00000 n 
-0005211355 00000 n 
-0005211798 00000 n 
-0005212158 00000 n 
-0005212386 00000 n 
-0005212671 00000 n 
-0005212953 00000 n 
-0005213334 00000 n 
-0005213723 00000 n 
-0005214059 00000 n 
-0005214341 00000 n 
-0005214650 00000 n 
-0005214945 00000 n 
-0005215238 00000 n 
-0005215546 00000 n 
-0005216081 00000 n 
-0005216747 00000 n 
-0005217413 00000 n 
-0005218079 00000 n 
-0005218811 00000 n 
-0005219708 00000 n 
-0005220638 00000 n 
-0005221062 00000 n 
-0005221248 00000 n 
-0005221433 00000 n 
-0005221619 00000 n 
-0005221803 00000 n 
-0005221989 00000 n 
-0005222176 00000 n 
-0005222362 00000 n 
-0005222546 00000 n 
-0005222734 00000 n 
-0005222918 00000 n 
-0005223104 00000 n 
-0005223288 00000 n 
-0005223476 00000 n 
-0005223662 00000 n 
-0005223848 00000 n 
-0005224032 00000 n 
-0005224218 00000 n 
-0005224403 00000 n 
-0005224589 00000 n 
-0005224769 00000 n 
-0005224955 00000 n 
-0005225139 00000 n 
-0005225323 00000 n 
-0005225509 00000 n 
-0005225694 00000 n 
-0005225880 00000 n 
-0005226065 00000 n 
-0005226253 00000 n 
-0005226438 00000 n 
-0005226624 00000 n 
-0005226809 00000 n 
-0005226995 00000 n 
-0005227180 00000 n 
-0005227366 00000 n 
-0005227550 00000 n 
-0005227739 00000 n 
-0005227923 00000 n 
-0005228104 00000 n 
-0005228291 00000 n 
-0005228477 00000 n 
-0005228661 00000 n 
-0005228848 00000 n 
-0005229040 00000 n 
-0005229230 00000 n 
-0005229423 00000 n 
-0005229613 00000 n 
-0005229805 00000 n 
-0005229995 00000 n 
-0005230187 00000 n 
-0005230378 00000 n 
-0005230571 00000 n 
-0005230761 00000 n 
-0005230954 00000 n 
-0005231146 00000 n 
-0005231338 00000 n 
-0005231528 00000 n 
-0005231721 00000 n 
-0005231907 00000 n 
-0005232101 00000 n 
-0005232291 00000 n 
-0005232483 00000 n 
-0005232673 00000 n 
-0005232865 00000 n 
-0005233056 00000 n 
-0005233248 00000 n 
-0005233440 00000 n 
-0005233632 00000 n 
-0005233822 00000 n 
-0005234014 00000 n 
-0005234204 00000 n 
-0005234396 00000 n 
-0005234585 00000 n 
-0005234774 00000 n 
-0005234966 00000 n 
-0005235156 00000 n 
-0005235350 00000 n 
-0005235535 00000 n 
-0005235727 00000 n 
-0005235917 00000 n 
-0005236109 00000 n 
-0005236299 00000 n 
-0005236491 00000 n 
-0005236681 00000 n 
-0005236873 00000 n 
-0005237063 00000 n 
-0005237255 00000 n 
-0005237444 00000 n 
-0005237633 00000 n 
-0005237825 00000 n 
-0005238015 00000 n 
-0005238207 00000 n 
-0005238397 00000 n 
-0005238589 00000 n 
-0005238779 00000 n 
-0005238962 00000 n 
-0005239140 00000 n 
-0005239316 00000 n 
-0005239494 00000 n 
-0005239670 00000 n 
-0005239848 00000 n 
-0005240023 00000 n 
-0005240198 00000 n 
-0005240411 00000 n 
-0005240680 00000 n 
-0005240962 00000 n 
-0005241243 00000 n 
-0005241525 00000 n 
-0005241806 00000 n 
-0005242088 00000 n 
-0005242369 00000 n 
-0005242651 00000 n 
-0005242932 00000 n 
-0005243214 00000 n 
-0005243494 00000 n 
-0005243770 00000 n 
-0005244044 00000 n 
-0005244318 00000 n 
-0005244596 00000 n 
-0005244870 00000 n 
-0005245148 00000 n 
-0005245426 00000 n 
-0005245700 00000 n 
-0005245974 00000 n 
-0005246248 00000 n 
-0005246522 00000 n 
-0005246797 00000 n 
-0005247071 00000 n 
-0005247345 00000 n 
-0005247619 00000 n 
-0005247891 00000 n 
-0005248160 00000 n 
-0005248434 00000 n 
-0005248708 00000 n 
-0005248982 00000 n 
-0005249260 00000 n 
-0005249542 00000 n 
-0005249823 00000 n 
-0005250105 00000 n 
-0005250385 00000 n 
-0005250665 00000 n 
-0005250947 00000 n 
-0005251225 00000 n 
-0005251499 00000 n 
-0005251773 00000 n 
-0005252047 00000 n 
-0005252318 00000 n 
-0005252584 00000 n 
-0005252855 00000 n 
-0005253129 00000 n 
-0005253401 00000 n 
-0005253673 00000 n 
-0005253947 00000 n 
-0005254220 00000 n 
-0005254494 00000 n 
-0005254767 00000 n 
-0005255041 00000 n 
-0005255314 00000 n 
-0005255585 00000 n 
-0005255856 00000 n 
-0005256130 00000 n 
-0005256402 00000 n 
-0005256671 00000 n 
-0005256941 00000 n 
-0005257215 00000 n 
-0005257489 00000 n 
-0005257767 00000 n 
-0005258041 00000 n 
-0005258320 00000 n 
-0005258602 00000 n 
-0005258882 00000 n 
-0005259162 00000 n 
-0005259444 00000 n 
-0005259722 00000 n 
-0005259996 00000 n 
-0005260271 00000 n 
-0005260553 00000 n 
-0005260827 00000 n 
-0005261105 00000 n 
-0005261379 00000 n 
-0005261657 00000 n 
-0005261939 00000 n 
-0005262220 00000 n 
-0005262502 00000 n 
-0005262782 00000 n 
-0005263065 00000 n 
-0005263353 00000 n 
-0005263639 00000 n 
-0005263927 00000 n 
-0005264213 00000 n 
-0005264490 00000 n 
-0005264770 00000 n 
-0005265054 00000 n 
-0005265336 00000 n 
-0005265619 00000 n 
-0005265907 00000 n 
-0005266187 00000 n 
-0005266467 00000 n 
-0005266747 00000 n 
-0005267027 00000 n 
-0005267307 00000 n 
-0005267588 00000 n 
-0005267870 00000 n 
-0005268158 00000 n 
-0005268441 00000 n 
-0005268723 00000 n 
-0005269006 00000 n 
-0005269288 00000 n 
-0005269576 00000 n 
-0005269863 00000 n 
-0005270151 00000 n 
-0005270438 00000 n 
-0005270726 00000 n 
-0005271013 00000 n 
-0005271301 00000 n 
-0005271587 00000 n 
-0005271873 00000 n 
-0005272155 00000 n 
-0005272439 00000 n 
-0005272727 00000 n 
-0005273014 00000 n 
-0005273302 00000 n 
-0005273588 00000 n 
-0005273874 00000 n 
-0005274162 00000 n 
-0005274449 00000 n 
-0005274737 00000 n 
-0005275017 00000 n 
-0005275299 00000 n 
-0005275582 00000 n 
-0005275862 00000 n 
-0005276144 00000 n 
-0005276427 00000 n 
-0005276707 00000 n 
-0005276988 00000 n 
-0005277270 00000 n 
-0005277558 00000 n 
-0005277845 00000 n 
-0005278133 00000 n 
-0005278420 00000 n 
-0005278708 00000 n 
-0005278995 00000 n 
-0005279283 00000 n 
-0005279569 00000 n 
-0005279855 00000 n 
-0005280141 00000 n 
-0005280425 00000 n 
-0005280713 00000 n 
-0005281000 00000 n 
-0005281284 00000 n 
-0005281564 00000 n 
-0005281847 00000 n 
-0005282127 00000 n 
-0005282412 00000 n 
-0005282700 00000 n 
-0005282986 00000 n 
-0005283272 00000 n 
-0005283560 00000 n 
-0005283847 00000 n 
-0005284135 00000 n 
-0005284417 00000 n 
-0005284697 00000 n 
-0005284977 00000 n 
-0005285259 00000 n 
-0005285539 00000 n 
-0005285819 00000 n 
-0005286099 00000 n 
-0005286379 00000 n 
-0005286661 00000 n 
-0005286949 00000 n 
-0005287236 00000 n 
-0005287524 00000 n 
-0005287811 00000 n 
-0005288099 00000 n 
-0005288386 00000 n 
-0005288674 00000 n 
-0005288956 00000 n 
-0005289239 00000 n 
-0005289519 00000 n 
-0005289793 00000 n 
-0005290061 00000 n 
-0005290330 00000 n 
-0005290604 00000 n 
-0005290877 00000 n 
-0005291151 00000 n 
-0005291424 00000 n 
-0005291698 00000 n 
-0005291970 00000 n 
-0005292242 00000 n 
-0005292516 00000 n 
-0005292789 00000 n 
-0005293059 00000 n 
-0005293331 00000 n 
-0005293603 00000 n 
-0005293875 00000 n 
-0005294141 00000 n 
-0005294421 00000 n 
-0005294701 00000 n 
-0005294981 00000 n 
-0005295261 00000 n 
-0005295549 00000 n 
-0005295836 00000 n 
-0005296124 00000 n 
-0005296411 00000 n 
-0005296699 00000 n 
-0005296986 00000 n 
-0005297274 00000 n 
-0005297561 00000 n 
-0005297849 00000 n 
-0005298135 00000 n 
-0005298421 00000 n 
-0005298703 00000 n 
-0005298983 00000 n 
-0005299263 00000 n 
-0005299543 00000 n 
-0005299823 00000 n 
-0005300093 00000 n 
-0005300359 00000 n 
-0005300634 00000 n 
-0005300914 00000 n 
-0005301180 00000 n 
-0005301441 00000 n 
-0005301702 00000 n 
-0005301962 00000 n 
-0005302228 00000 n 
-0005302493 00000 n 
-0005302759 00000 n 
-0005303017 00000 n 
-0005303275 00000 n 
-0005303533 00000 n 
-0005303758 00000 n 
-0005303976 00000 n 
-0005304193 00000 n 
-0005304411 00000 n 
-0005304627 00000 n 
-0005304843 00000 n 
-0005305061 00000 n 
-0005305278 00000 n 
-0005305496 00000 n 
-0005305713 00000 n 
-0005305931 00000 n 
-0005306152 00000 n 
-0005306376 00000 n 
-0005306598 00000 n 
-0005306822 00000 n 
-0005307043 00000 n 
-0005307264 00000 n 
-0005307488 00000 n 
-0005307706 00000 n 
-0005307930 00000 n 
-0005308152 00000 n 
-0005308376 00000 n 
-0005308598 00000 n 
-0005308822 00000 n 
-0005309044 00000 n 
-0005309268 00000 n 
-0005309490 00000 n 
-0005309714 00000 n 
-0005309935 00000 n 
-0005310156 00000 n 
-0005310380 00000 n 
-0005310602 00000 n 
-0005310826 00000 n 
-0005311048 00000 n 
-0005311272 00000 n 
-0005311494 00000 n 
-0005311712 00000 n 
-0005311922 00000 n 
-0005312131 00000 n 
-0005312341 00000 n 
-0005312550 00000 n 
-0005312760 00000 n 
-0005312969 00000 n 
-0005313179 00000 n 
-0005313387 00000 n 
-0005313595 00000 n 
-0005313805 00000 n 
-0005314014 00000 n 
-0005314224 00000 n 
-0005314421 00000 n 
-0005314605 00000 n 
-0005315192 00000 n 
-0005315795 00000 n 
-0005316025 00000 n 
-0005316249 00000 n 
-0005316481 00000 n 
-0005316725 00000 n 
-0005316968 00000 n 
-0005317212 00000 n 
-0005317455 00000 n 
-0005317699 00000 n 
-0005317941 00000 n 
-0005318183 00000 n 
-0005318427 00000 n 
-0005318670 00000 n 
-0005318914 00000 n 
-0005319157 00000 n 
-0005319401 00000 n 
-0005319644 00000 n 
-0005319888 00000 n 
-0005320131 00000 n 
-0005320364 00000 n 
-0005320602 00000 n 
-0005320879 00000 n 
-0005321161 00000 n 
-0005321443 00000 n 
-0005321725 00000 n 
-0005321998 00000 n 
-0005322267 00000 n 
-0005322535 00000 n 
-0005322809 00000 n 
-0005323084 00000 n 
-0005323355 00000 n 
-0005323627 00000 n 
-0005323901 00000 n 
-0005324180 00000 n 
-0005324470 00000 n 
-0005324760 00000 n 
-0005325049 00000 n 
-0005325339 00000 n 
-0005325629 00000 n 
-0005325919 00000 n 
-0005326209 00000 n 
-0005326494 00000 n 
-0005326784 00000 n 
-0005327074 00000 n 
-0005327364 00000 n 
-0005327654 00000 n 
-0005327939 00000 n 
-0005328229 00000 n 
-0005328519 00000 n 
-0005328809 00000 n 
-0005329097 00000 n 
-0005329385 00000 n 
-0005329681 00000 n 
-0005329977 00000 n 
-0005330273 00000 n 
-0005330567 00000 n 
-0005330863 00000 n 
-0005331159 00000 n 
-0005331455 00000 n 
-0005331751 00000 n 
-0005332045 00000 n 
-0005332341 00000 n 
-0005332637 00000 n 
-0005332933 00000 n 
-0005333229 00000 n 
-0005333516 00000 n 
-0005333812 00000 n 
-0005334108 00000 n 
-0005334404 00000 n 
-0005334695 00000 n 
-0005334988 00000 n 
-0005335284 00000 n 
-0005335569 00000 n 
-0005335843 00000 n 
-0005336083 00000 n 
-0005336277 00000 n 
-0005336470 00000 n 
-0005336664 00000 n 
-0005336857 00000 n 
-0005337051 00000 n 
-0005337244 00000 n 
-0005337438 00000 n 
-0005337631 00000 n 
-0005337825 00000 n 
-0005338017 00000 n 
-0005338209 00000 n 
-0005338403 00000 n 
-0005338596 00000 n 
-0005338790 00000 n 
-0005338983 00000 n 
-0005339177 00000 n 
-0005339370 00000 n 
-0005339564 00000 n 
-0005339755 00000 n 
-0005339949 00000 n 
-0005340142 00000 n 
-0005340336 00000 n 
-0005340528 00000 n 
-0005340720 00000 n 
-0005340914 00000 n 
-0005341107 00000 n 
-0005341301 00000 n 
-0005341494 00000 n 
-0005341688 00000 n 
-0005341881 00000 n 
-0005342075 00000 n 
-0005342268 00000 n 
-0005342462 00000 n 
-0005342654 00000 n 
-0005342846 00000 n 
-0005343040 00000 n 
-0005343230 00000 n 
-0005343424 00000 n 
-0005343617 00000 n 
-0005343811 00000 n 
-0005344004 00000 n 
-0005344198 00000 n 
-0005344391 00000 n 
-0005344585 00000 n 
-0005344778 00000 n 
-0005344972 00000 n 
-0005345164 00000 n 
-0005345356 00000 n 
-0005345550 00000 n 
-0005345743 00000 n 
-0005345937 00000 n 
-0005346130 00000 n 
-0005346324 00000 n 
-0005346517 00000 n 
-0005346714 00000 n 
-0005346909 00000 n 
-0005347109 00000 n 
-0005347307 00000 n 
-0005347507 00000 n 
-0005347704 00000 n 
-0005347901 00000 n 
-0005348101 00000 n 
-0005348299 00000 n 
-0005348499 00000 n 
-0005348697 00000 n 
-0005348897 00000 n 
-0005349095 00000 n 
-0005349295 00000 n 
-0005349493 00000 n 
-0005349693 00000 n 
-0005349890 00000 n 
-0005350087 00000 n 
-0005350287 00000 n 
-0005350481 00000 n 
-0005350681 00000 n 
-0005350879 00000 n 
-0005351079 00000 n 
-0005351277 00000 n 
-0005351477 00000 n 
-0005351675 00000 n 
-0005351875 00000 n 
-0005352073 00000 n 
-0005352273 00000 n 
-0005352470 00000 n 
-0005352667 00000 n 
-0005352867 00000 n 
-0005353065 00000 n 
-0005353265 00000 n 
-0005353463 00000 n 
-0005353663 00000 n 
-0005353861 00000 n 
-0005354061 00000 n 
-0005354256 00000 n 
-0005354456 00000 n 
-0005354654 00000 n 
-0005354854 00000 n 
-0005355051 00000 n 
-0005355248 00000 n 
-0005355448 00000 n 
-0005355646 00000 n 
-0005355846 00000 n 
-0005356044 00000 n 
-0005356244 00000 n 
-0005356442 00000 n 
-0005356642 00000 n 
-0005356840 00000 n 
-0005357040 00000 n 
-0005357237 00000 n 
-0005357434 00000 n 
-0005357634 00000 n 
-0005357828 00000 n 
-0005358028 00000 n 
-0005358226 00000 n 
-0005358426 00000 n 
-0005358624 00000 n 
-0005358824 00000 n 
-0005359022 00000 n 
-0005359222 00000 n 
-0005359420 00000 n 
-0005359620 00000 n 
-0005359817 00000 n 
-0005360014 00000 n 
-0005360214 00000 n 
-0005360412 00000 n 
-0005360612 00000 n 
-0005360810 00000 n 
-0005361010 00000 n 
-0005361208 00000 n 
-0005361408 00000 n 
-0005361603 00000 n 
-0005361803 00000 n 
-0005362001 00000 n 
-0005362201 00000 n 
-0005362398 00000 n 
-0005362595 00000 n 
-0005362795 00000 n 
-0005362993 00000 n 
-0005363193 00000 n 
-0005363391 00000 n 
-0005363591 00000 n 
-0005363789 00000 n 
-0005363989 00000 n 
-0005364187 00000 n 
-0005364387 00000 n 
-0005364584 00000 n 
-0005364781 00000 n 
-0005364981 00000 n 
-0005365175 00000 n 
-0005365375 00000 n 
-0005365573 00000 n 
-0005365773 00000 n 
-0005365971 00000 n 
-0005366171 00000 n 
-0005366369 00000 n 
-0005366569 00000 n 
-0005366767 00000 n 
-0005366933 00000 n 
-0005367128 00000 n 
-0005367391 00000 n 
-0005367654 00000 n 
-0005367927 00000 n 
-0005368194 00000 n 
-0005368445 00000 n 
-0005368696 00000 n 
-0005368971 00000 n 
-0005369256 00000 n 
-0005369529 00000 n 
-0005369804 00000 n 
-0005370079 00000 n 
-0005370333 00000 n 
-0005370624 00000 n 
-0005370905 00000 n 
-0005371178 00000 n 
-0005371470 00000 n 
-0005371770 00000 n 
-0005372043 00000 n 
-0005372341 00000 n 
-0005372640 00000 n 
-0005372933 00000 n 
-0005373227 00000 n 
-0005373501 00000 n 
-0005373772 00000 n 
-0005374035 00000 n 
-0005374270 00000 n 
-0005374527 00000 n 
-0005374810 00000 n 
-0005375085 00000 n 
-0005375349 00000 n 
-0005375602 00000 n 
-0005375855 00000 n 
-0005376149 00000 n 
-0005376482 00000 n 
-0005376754 00000 n 
-0005377020 00000 n 
-0005377301 00000 n 
-0005377582 00000 n 
-0005377857 00000 n 
-0005378126 00000 n 
-0005378395 00000 n 
-0005378695 00000 n 
-0005378999 00000 n 
-0005379276 00000 n 
-0005379553 00000 n 
-0005379830 00000 n 
-0005380103 00000 n 
-0005380405 00000 n 
-0005380702 00000 n 
-0005381002 00000 n 
-0005381289 00000 n 
-0005381588 00000 n 
-0005381887 00000 n 
-0005382177 00000 n 
-0005382458 00000 n 
-0005382740 00000 n 
-0005383014 00000 n 
-0005383279 00000 n 
-0005383544 00000 n 
-0005383807 00000 n 
-0005384068 00000 n 
-0005384358 00000 n 
-0005384654 00000 n 
-0005384906 00000 n 
-0005385171 00000 n 
-0005385470 00000 n 
-0005385689 00000 n 
-0005385826 00000 n 
-0005385959 00000 n 
-0005386152 00000 n 
-0005386308 00000 n 
-0005386457 00000 n 
-0005386602 00000 n 
-0005386832 00000 n 
-0005387050 00000 n 
-0005387175 00000 n 
-0005387300 00000 n 
-0005387425 00000 n 
-0005387550 00000 n 
-0005387675 00000 n 
-0005387799 00000 n 
-0005387923 00000 n 
-0005388048 00000 n 
-0005388173 00000 n 
-0005388298 00000 n 
-0005388423 00000 n 
-0005388548 00000 n 
-0005388673 00000 n 
-0005388797 00000 n 
-0005388922 00000 n 
-0005389046 00000 n 
-0005389181 00000 n 
-0005389330 00000 n 
-0005389479 00000 n 
-0005389626 00000 n 
-0005389772 00000 n 
-0005389919 00000 n 
-0005390067 00000 n 
-0005390214 00000 n 
-0005390361 00000 n 
-0005390508 00000 n 
-0005390654 00000 n 
-0005390802 00000 n 
-0005390951 00000 n 
-0005391099 00000 n 
-0005391247 00000 n 
-0005391394 00000 n 
-0005391542 00000 n 
-0005391691 00000 n 
-0005391840 00000 n 
-0005391988 00000 n 
-0005392137 00000 n 
-0005392284 00000 n 
-0005392432 00000 n 
-0005392580 00000 n 
-0005392728 00000 n 
-0005392875 00000 n 
-0005393023 00000 n 
-0005393171 00000 n 
-0005393320 00000 n 
-0005393467 00000 n 
-0005393613 00000 n 
-0005393759 00000 n 
-0005393906 00000 n 
-0005394054 00000 n 
-0005394202 00000 n 
-0005394349 00000 n 
-0005394493 00000 n 
-0005394636 00000 n 
-0005394774 00000 n 
-0005394907 00000 n 
-0005395039 00000 n 
-0005395172 00000 n 
-0005395305 00000 n 
-0005395438 00000 n 
-0005395570 00000 n 
-0005395701 00000 n 
-0005395835 00000 n 
-0005395975 00000 n 
-0005396116 00000 n 
-0005396257 00000 n 
-0005396402 00000 n 
-0005396550 00000 n 
-0005396699 00000 n 
-0005396850 00000 n 
-0005397001 00000 n 
-0005397152 00000 n 
-0005397303 00000 n 
-0005397454 00000 n 
-0005397603 00000 n 
-0005397740 00000 n 
-0005397867 00000 n 
-0005397994 00000 n 
-0005398121 00000 n 
-0005398247 00000 n 
-0005398374 00000 n 
-0005398501 00000 n 
-0005398628 00000 n 
-0005398754 00000 n 
-0005398881 00000 n 
-0005399008 00000 n 
-0005399135 00000 n 
-0005399261 00000 n 
-0005399388 00000 n 
-0005399515 00000 n 
-0005399642 00000 n 
-0005399769 00000 n 
-0005399896 00000 n 
-0005400023 00000 n 
-0005400150 00000 n 
-0005400277 00000 n 
-0005400404 00000 n 
-0005400531 00000 n 
-0005400658 00000 n 
-0005400784 00000 n 
-0005400911 00000 n 
-0005401007 00000 n 
-0005401196 00000 n 
-0005401459 00000 n 
-0005401737 00000 n 
-0005402017 00000 n 
-0005402294 00000 n 
-0005402538 00000 n 
-0005402798 00000 n 
-0005403067 00000 n 
-0005403384 00000 n 
-0005403666 00000 n 
-0005403948 00000 n 
-0005404188 00000 n 
-0005404315 00000 n 
-0005404440 00000 n 
-0005404564 00000 n 
-0005404700 00000 n 
-0005404847 00000 n 
-0005404993 00000 n 
-0005405140 00000 n 
-0005405288 00000 n 
-0005405437 00000 n 
-0005405578 00000 n 
-0005405710 00000 n 
-0005405849 00000 n 
-0005405998 00000 n 
-0005406137 00000 n 
-0005406264 00000 n 
-0005406391 00000 n 
-0005406518 00000 n 
-0005406624 00000 n 
-0005406794 00000 n 
-0005407010 00000 n 
-0005407148 00000 n 
-0005407295 00000 n 
-0005407431 00000 n 
-0005407547 00000 n 
-0005407589 00000 n 
-0005407774 00000 n 
-trailer
-<< /Size 21344
-/Root 21342 0 R
-/Info 21343 0 R
-/ID [<9ECED437ABB04C9C3DEE03769AAED80B> <9ECED437ABB04C9C3DEE03769AAED80B>] >>
-startxref
-5408102
-%%EOF
diff --git a/doc/ppl-user-1.0.ps.gz b/doc/ppl-user-1.0.ps.gz
deleted file mode 100644
index 0527884..0000000
Binary files a/doc/ppl-user-1.0.ps.gz and /dev/null differ
diff --git a/doc/ppl-user-1.1pre8-html.tar.gz b/doc/ppl-user-1.1pre8-html.tar.gz
new file mode 100644
index 0000000..03d3b94
Binary files /dev/null and b/doc/ppl-user-1.1pre8-html.tar.gz differ
diff --git a/doc/ppl-user-1.1pre8.pdf b/doc/ppl-user-1.1pre8.pdf
new file mode 100644
index 0000000..61eae8d
--- /dev/null
+++ b/doc/ppl-user-1.1pre8.pdf
@@ -0,0 +1,133937 @@
+%PDF-1.4
+%����
+1 0 obj
+<< /S /GoTo /D (section.1) >>
+endobj
+4 0 obj
+(\376\377\000G\000e\000n\000e\000r\000a\000l\000\040\000I\000n\000f\000o\000r\000m\000a\000t\000i\000o\000n\000\040\000o\000n\000\040\000t\000h\000e\000\040\000P\000P\000L)
+endobj
+5 0 obj
+<< /S /GoTo /D (subsection.1.1) >>
+endobj
+8 0 obj
+(\376\377\000T\000h\000e\000\040\000M\000a\000i\000n\000\040\000F\000e\000a\000t\000u\000r\000e\000s)
+endobj
+9 0 obj
+<< /S /GoTo /D (subsection.1.2) >>
+endobj
+12 0 obj
+(\376\377\000U\000p\000w\000a\000r\000d\000\040\000A\000p\000p\000r\000o\000x\000i\000m\000a\000t\000i\000o\000n)
+endobj
+13 0 obj
+<< /S /GoTo /D (subsection.1.3) >>
+endobj
+16 0 obj
+(\376\377\000A\000p\000p\000r\000o\000x\000i\000m\000a\000t\000i\000n\000g\000\040\000I\000n\000t\000e\000g\000e\000r\000s)
+endobj
+17 0 obj
+<< /S /GoTo /D (subsection.1.4) >>
+endobj
+20 0 obj
+(\376\377\000C\000o\000n\000v\000e\000x\000\040\000P\000o\000l\000y\000h\000e\000d\000r\000a)
+endobj
+21 0 obj
+<< /S /GoTo /D (subsection.1.5) >>
+endobj
+24 0 obj
+(\376\377\000R\000e\000p\000r\000e\000s\000e\000n\000t\000a\000t\000i\000o\000n\000s\000\040\000o\000f\000\040\000C\000o\000n\000v\000e\000x\000\040\000P\000o\000l\000y\000h\000e\000d\000r\000a)
+endobj
+25 0 obj
+<< /S /GoTo /D (subsection.1.6) >>
+endobj
+28 0 obj
+(\376\377\000O\000p\000e\000r\000a\000t\000i\000o\000n\000s\000\040\000o\000n\000\040\000C\000o\000n\000v\000e\000x\000\040\000P\000o\000l\000y\000h\000e\000d\000r\000a)
+endobj
+29 0 obj
+<< /S /GoTo /D (subsection.1.7) >>
+endobj
+32 0 obj
+(\376\377\000I\000n\000t\000e\000r\000v\000a\000l\000s\000\040\000a\000n\000d\000\040\000B\000o\000x\000e\000s)
+endobj
+33 0 obj
+<< /S /GoTo /D (subsection.1.8) >>
+endobj
+36 0 obj
+(\376\377\000W\000e\000a\000k\000l\000y\000-\000R\000e\000l\000a\000t\000i\000o\000n\000a\000l\000\040\000S\000h\000a\000p\000e\000s)
+endobj
+37 0 obj
+<< /S /GoTo /D (subsection.1.9) >>
+endobj
+40 0 obj
+(\376\377\000R\000a\000t\000i\000o\000n\000a\000l\000\040\000G\000r\000i\000d\000s)
+endobj
+41 0 obj
+<< /S /GoTo /D (subsection.1.10) >>
+endobj
+44 0 obj
+(\376\377\000O\000p\000e\000r\000a\000t\000i\000o\000n\000s\000\040\000o\000n\000\040\000R\000a\000t\000i\000o\000n\000a\000l\000\040\000G\000r\000i\000d\000s)
+endobj
+45 0 obj
+<< /S /GoTo /D (subsection.1.11) >>
+endobj
+48 0 obj
+(\376\377\000T\000h\000e\000\040\000P\000o\000w\000e\000r\000s\000e\000t\000\040\000C\000o\000n\000s\000t\000r\000u\000c\000t\000i\000o\000n)
+endobj
+49 0 obj
+<< /S /GoTo /D (subsection.1.12) >>
+endobj
+52 0 obj
+(\376\377\000O\000p\000e\000r\000a\000t\000i\000o\000n\000s\000\040\000o\000n\000\040\000t\000h\000e\000\040\000P\000o\000w\000e\000r\000s\000e\000t\000\040\000C\000o\000n\000s\000t\000r\000u\000c\000t\000i\000o\000n)
+endobj
+53 0 obj
+<< /S /GoTo /D (subsection.1.13) >>
+endobj
+56 0 obj
+(\376\377\000T\000h\000e\000\040\000P\000o\000i\000n\000t\000s\000e\000t\000\040\000P\000o\000w\000e\000r\000s\000e\000t\000\040\000D\000o\000m\000a\000i\000n)
+endobj
+57 0 obj
+<< /S /GoTo /D (subsection.1.14) >>
+endobj
+60 0 obj
+(\376\377\000A\000n\000a\000l\000y\000s\000i\000s\000\040\000o\000f\000\040\000f\000l\000o\000a\000t\000i\000n\000g\000\040\000p\000o\000i\000n\000t\000\040\000c\000o\000m\000p\000u\000t\000a\000t\000i\000o\000n\000s)
+endobj
+61 0 obj
+<< /S /GoTo /D (subsection.1.15) >>
+endobj
+64 0 obj
+(\376\377\000U\000s\000i\000n\000g\000\040\000t\000h\000e\000\040\000L\000i\000b\000r\000a\000r\000y)
+endobj
+65 0 obj
+<< /S /GoTo /D (subsection.1.16) >>
+endobj
+68 0 obj
+(\376\377\000B\000i\000b\000l\000i\000o\000g\000r\000a\000p\000h\000y)
+endobj
+69 0 obj
+<< /S /GoTo /D (section.2) >>
+endobj
+72 0 obj
+(\376\377\000G\000N\000U\000\040\000G\000e\000n\000e\000r\000a\000l\000\040\000P\000u\000b\000l\000i\000c\000\040\000L\000i\000c\000e\000n\000s\000e)
+endobj
+73 0 obj
+<< /S /GoTo /D (section.3) >>
+endobj
+76 0 obj
+(\376\377\000G\000N\000U\000\040\000F\000r\000e\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000L\000i\000c\000e\000n\000s\000e)
+endobj
+77 0 obj
+<< /S /GoTo /D (section.4) >>
+endobj
+80 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+81 0 obj
+<< /S /GoTo /D (subsection.4.1) >>
+endobj
+84 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000s)
+endobj
+85 0 obj
+<< /S /GoTo /D (section.5) >>
+endobj
+88 0 obj
+(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+89 0 obj
+<< /S /GoTo /D (subsection.5.1) >>
+endobj
+92 0 obj
+(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000L\000i\000s\000t)
+endobj
+93 0 obj
+<< /S /GoTo /D (section.6) >>
+endobj
+96 0 obj
+(\376\377\000H\000i\000e\000r\000a\000r\000c\000h\000i\000c\000a\000l\000\040\000I\000n\000d\000e\000x)
+endobj
+97 0 obj
+<< /S /GoTo /D (subsection.6.1) >>
+endobj
+100 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000H\000i\000e\000r\000a\000r\000c\000h\000y)
+endobj
+101 0 obj
+<< /S /GoTo /D (section.7) >>
+endobj
+104 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
+endobj
+105 0 obj
+<< /S /GoTo /D (subsection.7.1) >>
+endobj
+108 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000L\000i\000s\000t)
+endobj
+109 0 obj
+<< /S /GoTo /D (section.8) >>
+endobj
+112 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+113 0 obj
+<< /S /GoTo /D (subsection.8.1) >>
+endobj
+116 0 obj
+(\376\377\000C\000+\000+\000\040\000L\000a\000n\000g\000u\000a\000g\000e\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e)
+endobj
+117 0 obj
+<< /S /GoTo /D (section.9) >>
+endobj
+120 0 obj
+(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+121 0 obj
+<< /S /GoTo /D (subsection.9.1) >>
+endobj
+124 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000\040\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+125 0 obj
+<< /S /GoTo /D (subsection.9.2) >>
+endobj
+128 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000O\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000s\000\040\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+129 0 obj
+<< /S /GoTo /D (subsection.9.3) >>
+endobj
+132 0 obj
+(\376\377\000s\000t\000d\000\040\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+133 0 obj
+<< /S /GoTo /D (section.10) >>
+endobj
+136 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+137 0 obj
+<< /S /GoTo /D (subsection.10.1) >>
+endobj
+140 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000A\000p\000p\000r\000o\000x\000i\000m\000a\000b\000l\000e\000\137\000R\000e\000f\000e\000r\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+141 0 obj
+<< /S /GoTo /D (subsection.10.2) >>
+endobj
+144 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000A\000p\000p\000r\000o\000x\000i\000m\000a\000b\000l\000e\000\137\000R\000e\000f\000e\000r\000e\000n\000c\000e\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+145 0 obj
+<< /S /GoTo /D (subsection.10.3) >>
+endobj
+148 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000:\000:\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+149 0 obj
+<< /S /GoTo /D (subsection.10.4) >>
+endobj
+152 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000D\000\137\000S\000h\000a\000p\000e\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+153 0 obj
+<< /S /GoTo /D (subsection.10.5) >>
+endobj
+156 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000H\000R\000Z\0000\0003\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+157 0 obj
+<< /S /GoTo /D (subsection.10.6) >>
+endobj
+160 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000i\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+161 0 obj
+<< /S /GoTo /D (subsection.10.7) >>
+endobj
+164 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000i\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+165 0 obj
+<< /S /GoTo /D (subsection.10.8) >>
+endobj
+168 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000o\000x\000<\000\040\000I\000T\000V\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+169 0 obj
+<< /S /GoTo /D (subsection.10.9) >>
+endobj
+172 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+173 0 obj
+<< /S /GoTo /D (subsection.10.10) >>
+endobj
+176 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000a\000s\000t\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000>\000\040\000C\000l\0 [...]
+endobj
+177 0 obj
+<< /S /GoTo /D (subsection.10.11) >>
+endobj
+180 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000a\000s\000t\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+181 0 obj
+<< /S /GoTo /D (subsection.10.12) >>
+endobj
+184 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000a\000s\000t\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+185 0 obj
+<< /S /GoTo /D (subsection.10.13) >>
+endobj
+188 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000h\000e\000c\000k\000e\000d\000\137\000N\000u\000m\000b\000e\000r\000<\000\040\000T\000,\000\040\000P\000o\000l\000i\000c\000y\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+189 0 obj
+<< /S /GoTo /D (subsection.10.14) >>
+endobj
+192 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+193 0 obj
+<< /S /GoTo /D (subsection.10.15) >>
+endobj
+196 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000B\000H\000R\000Z\0000\0003\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+197 0 obj
+<< /S /GoTo /D (subsection.10.16) >>
+endobj
+200 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000H\0007\0009\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+201 0 obj
+<< /S /GoTo /D (subsection.10.17) >>
+endobj
+204 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000:\000:\000C\000o\000m\000p\000a\000r\000e\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+205 0 obj
+<< /S /GoTo /D (subsection.10.18) >>
+endobj
+208 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000c\000r\000e\000t\000e\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+209 0 obj
+<< /S /GoTo /D (subsection.10.19) >>
+endobj
+212 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000c\000r\000e\000t\000e\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+213 0 obj
+<< /S /GoTo /D (subsection.10.20) >>
+endobj
+216 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000c\000r\000e\000t\000e\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000T\000y\000p\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+217 0 obj
+<< /S /GoTo /D (subsection.10.21) >>
+endobj
+220 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+221 0 obj
+<< /S /GoTo /D (subsection.10.22) >>
+endobj
+224 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+225 0 obj
+<< /S /GoTo /D (subsection.10.23) >>
+endobj
+228 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000s\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+229 0 obj
+<< /S /GoTo /D (subsection.10.24) >>
+endobj
+232 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+233 0 obj
+<< /S /GoTo /D (subsection.10.25) >>
+endobj
+236 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+237 0 obj
+<< /S /GoTo /D (subsection.10.26) >>
+endobj
+240 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000O\000\137\000T\000r\000e\000e\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+241 0 obj
+<< /S /GoTo /D (subsection.10.27) >>
+endobj
+244 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000I\000m\000p\000l\000<\000\040\000R\000o\000w\000\040\000>\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+245 0 obj
+<< /S /GoTo /D (subsection.10.28) >>
+endobj
+248 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+249 0 obj
+<< /S /GoTo /D (subsection.10.29) >>
+endobj
+252 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+253 0 obj
+<< /S /GoTo /D (subsection.10.30) >>
+endobj
+256 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000I\000n\000t\000e\000r\000f\000a\000c\000e\000:\000:\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000i\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000 [...]
+endobj
+257 0 obj
+<< /S /GoTo /D (subsection.10.31) >>
+endobj
+260 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000a\000n\000t\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
+endobj
+261 0 obj
+<< /S /GoTo /D (subsection.10.32) >>
+endobj
+264 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+265 0 obj
+<< /S /GoTo /D (subsection.10.33) >>
+endobj
+268 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+269 0 obj
+<< /S /GoTo /D (subsection.10.34) >>
+endobj
+272 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+273 0 obj
+<< /S /GoTo /D (subsection.10.35) >>
+endobj
+276 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000s\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+277 0 obj
+<< /S /GoTo /D (subsection.10.36) >>
+endobj
+280 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000e\000t\000e\000r\000m\000i\000n\000a\000t\000e\000<\000\040\000P\000S\000E\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+281 0 obj
+<< /S /GoTo /D (subsection.10.37) >>
+endobj
+284 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000i\000f\000f\000e\000r\000e\000n\000c\000e\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\00 [...]
+endobj
+285 0 obj
+<< /S /GoTo /D (subsection.10.38) >>
+endobj
+288 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000i\000v\000i\000s\000i\000o\000n\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
+endobj
+289 0 obj
+<< /S /GoTo /D (subsection.10.39) >>
+endobj
+292 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000D\000o\000m\000a\000i\000n\000\137\000P\000r\000o\000d\000u\000c\000t\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+293 0 obj
+<< /S /GoTo /D (subsection.10.40) >>
+endobj
+296 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000D\000o\000u\000b\000l\000y\000\137\000L\000i\000n\000k\000e\000d\000\137\000O\000b\000j\000e\000c\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+297 0 obj
+<< /S /GoTo /D (subsection.10.41) >>
+endobj
+300 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000E\000L\000i\000s\000t\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+301 0 obj
+<< /S /GoTo /D (subsection.10.42) >>
+endobj
+304 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000E\000L\000i\000s\000t\000\137\000I\000t\000e\000r\000a\000t\000o\000r\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+305 0 obj
+<< /S /GoTo /D (subsection.10.43) >>
+endobj
+308 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+309 0 obj
+<< /S /GoTo /D (subsection.10.44) >>
+endobj
+312 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+313 0 obj
+<< /S /GoTo /D (subsection.10.45) >>
+endobj
+316 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\0 [...]
+endobj
+317 0 obj
+<< /S /GoTo /D (subsection.10.46) >>
+endobj
+320 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000F\000P\000\137\000O\000r\000a\000c\000l\000e\000<\000\040\000T\000a\000r\000g\000e\000t\000,\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+321 0 obj
+<< /S /GoTo /D (subsection.10.47) >>
+endobj
+324 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+325 0 obj
+<< /S /GoTo /D (subsection.10.48) >>
+endobj
+328 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+329 0 obj
+<< /S /GoTo /D (subsection.10.49) >>
+endobj
+332 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+333 0 obj
+<< /S /GoTo /D (subsection.10.50) >>
+endobj
+336 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000M\000P\000\137\000I\000n\000t\000e\000g\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+337 0 obj
+<< /S /GoTo /D (subsection.10.51) >>
+endobj
+340 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+341 0 obj
+<< /S /GoTo /D (subsection.10.52) >>
+endobj
+344 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+345 0 obj
+<< /S /GoTo /D (subsection.10.53) >>
+endobj
+348 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+349 0 obj
+<< /S /GoTo /D (subsection.10.54) >>
+endobj
+352 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+353 0 obj
+<< /S /GoTo /D (subsection.10.55) >>
+endobj
+356 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000H\0007\0009\000\137\000C\000e\000r\000t\000i\000f\000i\000c\000a\000t\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+357 0 obj
+<< /S /GoTo /D (subsection.10.56) >>
+endobj
+360 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000H\000a\000n\000d\000l\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+361 0 obj
+<< /S /GoTo /D (subsection.10.57) >>
+endobj
+364 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000H\000a\000n\000d\000l\000e\000r\000\137\000F\000l\000a\000g\000<\000\040\000F\000l\000a\000g\000\137\000B\000a\000s\000e\000,\000\040\000F\000l\000a\000g\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\ [...]
+endobj
+365 0 obj
+<< /S /GoTo /D (subsection.10.58) >>
+endobj
+368 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000H\000a\000n\000d\000l\000e\000r\000\137\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+369 0 obj
+<< /S /GoTo /D (subsection.10.59) >>
+endobj
+372 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000n\000t\000e\000g\000e\000r\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+373 0 obj
+<< /S /GoTo /D (subsection.10.60) >>
+endobj
+376 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000n\000t\000e\000g\000e\000r\000\137\000C\000o\000n\000s\000t\000a\000n\000t\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+377 0 obj
+<< /S /GoTo /D (subsection.10.61) >>
+endobj
+380 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000n\000t\000e\000r\000v\000a\000l\000<\000\040\000B\000o\000u\000n\000d\000a\000r\000y\000,\000\040\000I\000n\000f\000o\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+381 0 obj
+<< /S /GoTo /D (subsection.10.62) >>
+endobj
+384 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000C\000O\000\137\000T\000r\000e\000e\000:\000:\000i\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+385 0 obj
+<< /S /GoTo /D (subsection.10.63) >>
+endobj
+388 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+389 0 obj
+<< /S /GoTo /D (subsection.10.64) >>
+endobj
+392 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000L\000i\000n\000e\000a\000r\000\137\000F\000o\000r\000m\000<\000\040\000C\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+393 0 obj
+<< /S /GoTo /D (subsection.10.65) >>
+endobj
+396 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+397 0 obj
+<< /S /GoTo /D (subsection.10.66) >>
+endobj
+400 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000M\000u\000l\000t\000i\000p\000l\000i\000c\000a\000t\000i\000o\000n\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\00 [...]
+endobj
+401 0 obj
+<< /S /GoTo /D (subsection.10.67) >>
+endobj
+404 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000N\000N\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+405 0 obj
+<< /S /GoTo /D (subsection.10.68) >>
+endobj
+408 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000:\000:\000N\000o\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000s\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+409 0 obj
+<< /S /GoTo /D (subsection.10.69) >>
+endobj
+412 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000N\000o\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+413 0 obj
+<< /S /GoTo /D (subsection.10.70) >>
+endobj
+416 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000O\000c\000t\000a\000g\000o\000n\000a\000l\000\137\000S\000h\000a\000p\000e\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+417 0 obj
+<< /S /GoTo /D (subsection.10.71) >>
+endobj
+420 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000O\000p\000p\000o\000s\000i\000t\000e\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
+endobj
+421 0 obj
+<< /S /GoTo /D (subsection.10.72) >>
+endobj
+424 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000a\000r\000t\000i\000a\000l\000l\000y\000\137\000R\000e\000d\000u\000c\000e\000d\000\137\000P\000r\000o\000d\000u\000c\000t\000<\000\040\000D\0001\000,\000\040\000D\0002\000,\000\040\000R\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+425 0 obj
+<< /S /GoTo /D (subsection.10.73) >>
+endobj
+428 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000P\000e\000n\000d\000i\000n\000g\000\137\000E\000l\000e\000m\000e\000n\000t\000<\000\040\000T\000h\000r\000e\000s\000h\000o\000l\000d\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\0 [...]
+endobj
+429 0 obj
+<< /S /GoTo /D (subsection.10.74) >>
+endobj
+432 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000P\000e\000n\000d\000i\000n\000g\000\137\000L\000i\000s\000t\000<\000\040\000T\000r\000a\000i\000t\000s\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000 [...]
+endobj
+433 0 obj
+<< /S /GoTo /D (subsection.10.75) >>
+endobj
+436 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000D\000e\000c\000i\000s\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+437 0 obj
+<< /S /GoTo /D (subsection.10.76) >>
+endobj
+440 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+441 0 obj
+<< /S /GoTo /D (subsection.10.77) >>
+endobj
+444 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+445 0 obj
+<< /S /GoTo /D (subsection.10.78) >>
+endobj
+448 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+449 0 obj
+<< /S /GoTo /D (subsection.10.79) >>
+endobj
+452 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000<\000\040\000P\000S\000E\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+453 0 obj
+<< /S /GoTo /D (subsection.10.80) >>
+endobj
+456 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000l\000y\000\137\000C\000o\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+457 0 obj
+<< /S /GoTo /D (subsection.10.81) >>
+endobj
+460 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000l\000y\000\137\000G\000e\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+461 0 obj
+<< /S /GoTo /D (subsection.10.82) >>
+endobj
+464 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+465 0 obj
+<< /S /GoTo /D (subsection.10.83) >>
+endobj
+468 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000P\000o\000w\000e\000r\000s\000e\000t\000<\000\040\000D\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+469 0 obj
+<< /S /GoTo /D (subsection.10.84) >>
+endobj
+472 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000R\000e\000c\000y\000c\000l\000e\000\137\000I\000n\000p\000u\000t\000\040\000S\000t\000r\000u\000c\000t\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+473 0 obj
+<< /S /GoTo /D (subsection.10.85) >>
+endobj
+476 0 obj
+(\376\377\000S\000e\000l\000e\000c\000t\000\137\000T\000e\000m\000p\000\137\000B\000o\000u\000n\000d\000a\000r\000y\000\137\000T\000y\000p\000e\000<\000\040\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000B\000o\000u\000n\000d\000a\000r\000y\000\137\000T\000y\000p\000e\000\040\000>\000\040\000S\000t\000r\000u\000c\000t\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+477 0 obj
+<< /S /GoTo /D (subsection.10.86) >>
+endobj
+480 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000S\000h\000a\000p\000e\000\137\000P\000r\000e\000s\000e\000r\000v\000i\000n\000g\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+481 0 obj
+<< /S /GoTo /D (subsection.10.87) >>
+endobj
+484 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000S\000m\000a\000s\000h\000\137\000R\000e\000d\000u\000c\000t\000i\000o\000n\000<\000\040\000D\0001\000,\000\040\000D\0002\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+485 0 obj
+<< /S /GoTo /D (subsection.10.88) >>
+endobj
+488 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000S\000u\000m\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000>\000\040\000C\000l\000a\0 [...]
+endobj
+489 0 obj
+<< /S /GoTo /D (subsection.10.89) >>
+endobj
+492 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000T\000h\000r\000e\000s\000h\000o\000l\000d\000\137\000W\000a\000t\000c\000h\000e\000r\000<\000\040\000T\000r\000a\000i\000t\000s\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+493 0 obj
+<< /S /GoTo /D (subsection.10.90) >>
+endobj
+496 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000T\000h\000r\000o\000w\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+497 0 obj
+<< /S /GoTo /D (subsection.10.91) >>
+endobj
+500 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000I\000m\000p\000l\000e\000m\000e\000n\000t\000a\000t\000i\000o\000n\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000:\000:\000T\000i\000m\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+501 0 obj
+<< /S /GoTo /D (subsection.10.92) >>
+endobj
+504 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000U\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+505 0 obj
+<< /S /GoTo /D (subsection.10.93) >>
+endobj
+508 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000U\000n\000a\000r\000y\000\137\000O\000p\000e\000r\000a\000t\000o\000r\000\137\000C\000o\000m\000m\000o\000n\000<\000\040\000T\000a\000r\000g\000e\000t\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000T\000e\000m\000p\000l\000a\000t\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+509 0 obj
+<< /S /GoTo /D (subsection.10.94) >>
+endobj
+512 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+513 0 obj
+<< /S /GoTo /D (subsection.10.95) >>
+endobj
+516 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000\137\000F\000l\000o\000a\000t\000i\000n\000g\000\137\000P\000o\000i\000n\000t\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000<\000\040\000F\000P\000\137\000I\000n\000t\000e\000r\000v\000a\000l\000\137\000T\000y\000p\000e\000,\000\040\000F\000P\000\137\000F\000o\000r\000m\000a\000t\000\040\000> [...]
+endobj
+517 0 obj
+<< /S /GoTo /D (subsection.10.96) >>
+endobj
+520 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000V\000a\000r\000i\000a\000b\000l\000e\000s\000\137\000S\000e\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+521 0 obj
+<< /S /GoTo /D (subsection.10.97) >>
+endobj
+524 0 obj
+(\376\377\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000:\000:\000W\000a\000t\000c\000h\000d\000o\000g\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+525 0 obj
+<< /S /GoTo /D (subsubsection.10.97.1) >>
+endobj
+528 0 obj
+(\376\377\000I\000n\000d\000e\000x)
+endobj
+529 0 obj
+<< /S /GoTo /D [530 0 R  /Fit ] >>
+endobj
+533 0 obj <<
+/Length 1358      
+/Filter /FlateDecode
+>>
+stream
+x��WKs�6��W��)5c!x��^"?�L�Q-���9 at 4$�%	������]`A���I�[�3&����
����G�;_�i�N�<
+"�����>
Q"h�FNd�v���'���Yp��~���5jO�G�.�,`)�,���2`YNb ��.�`~|�k5�4
������M
ֲ��4��n���6�ߖ
܂���n�q�&�S�	8�H�2T~۩�g��Ãײ�網�G^]��
��;�hF�	�Q�
+��T��~(c�r"x
+�2’�������ڮ�
�d�mZ��=i�	�D0��zn�BAh��Qɉ\5ҧ�)�X����Y
�O�'AD��Q�q&H
+c�9y'�i7`��aY�>�����Uu�b��qgѧ���4')��-�7�y/��P6��
 � �/�KH�}3����RH	��0����H�8�K�$�>M6>{Z����)s�y������r��q�S�.>���ol�Yp��%��<�u̠�\[E<���4A�Rh�
�	����M� J�Y̒����J�
���ަF���"\�N�!��~��K�=pT���4�;��We'�ySE	��g���ݔMO�4w���
+e
�8�V���tf�Ãn�g�G��q)��+
 �� �3�@C"'Qa���0(�Ҏ�(J5H���T;�v��F�ƦIJ�_���mJ����7^^/Qpj��%L�8�&.��"�+J՘��
d��S�-�ރV��
+�;d�U�E���-��\L��B�l���ͦ*��@��f�jHUсx��
Ŝ�Av}{3��t.��ȩ�y�l�v�<m���5
8U���	�9Yt�����ƨ�d�$:錿o�F<Sc�@c��n�Pd����8}퍪;w�4	OucZ]�/*m+z��I#�]Wv��B�>ZV��
9
�U�ʶ�5������v�s�o��lC�Pd�[\��z�5@�E���V��9SE�n����T+ݖfm�1����a����ά%��!\]o+Sv�tǸ��K�#
d�O���� ��%g�2���)��c
h?��>�!��0�V;PS(�-k_�'g����K4	�?C�Mu�B��r��1,H��B/����|:�9E���]�G:��M��Xg�������F
��>m{�/g��T�V�u�?k�F��k3�K.*�G�cS�S��L6k���s�"��Z��?A��Ar���������uёmS�E
+㑔�͞);|k��x�q:a^�� 
�x
�^��@@�$��qT����^���]���V�
�X�~���7�֢�d
/��
���U��)t}��}`{�o9���ri��t s���a�F����z x/5��\ �5��/K�͟X���i�>
+endstream
+endobj
+530 0 obj <<
+/Type /Page
+/Contents 533 0 R
+/Resources 532 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 541 0 R
+>> endobj
+531 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/ppl_logo.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 542 0 R
+/BBox [0 0 640 829]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 543 0 R
+>>>>
+/Length 2688
+/Filter /FlateDecode
+>>
+stream
+x�m�K�#�
D�ZEm�4	�
{�(�#�sD��'�*�>��j�V��L��ǑS9���������9����qӸל�i�Қǟ�>�u��V���)�2k�%[�׍�jk
e���<F��bȣ��u��5�ID���q�^��%�R��ˬ���|�T�4��yԮ������hYϔc�ԭ��V�»�>�������������J�k�>�si���3�4���Hݏ��{�l��V����^.&ϩ�<&;�����u��I
@����Z�KD�P���\�i����s|��R4�h}�9��艥����b\K��؆��j�ik�L���=�̸�"ؼZI��(	���%s6W���+�y�1�H')�ql�
��g���y�Qs�_7������/�;ji�y�'x���k%_�J>8{w@�wv�NQȁ�l�=("JY�s����Iy
ǹ�k�S���+���}hk�>"���Rd�'n$�4��
�įGh
�Y�ϲ����Ȭbeh&f������3(0Ϝw�9��Б ��‘�^@�A}� �T�4D�߶V�?5�$��[e��!�f�b[�l��E�4����Y4�9p��	���n<���
��9;�D4%�q�+^�kK��%��9�5��|?ĝS�Ī��@.�"�A���T�5&�%^�n59:�/H��(%�~����a	Z=�d�I��fJ+�^+�︌�B2X����#ѥ�S�����0V[-NS� �(b&�C��*�s�

��*d�K
��5ɫ�6�؄KC�hz�4��)�
�y� DF^Akz�\3W��m9�`����@�l:�MYe��B�:x6+b� h�6$sܨ��W�Z�^,����Ddx&hI���
��$�a"q���
�:��RSH�2<Z<�H�r{v%��.W次�8��?�BJ6
b�H4
,Fߎ� �Ԛ�������2��B�Z�	�.Ŋ�>@��񸵊��d�J�
�S����Q��ufG�.-�+���]��ҢxR�ِNV1�0	K��r�ہ�
��.�Q�<��͙N��*7b�_<��6���G"Cd�t�6 D�x�RkT����`; F'���́�����Gy����.C��EK�+��
(�eC�K8T�2�Q)� [...]
���B[�}��T�<��W��Z�.q[C�T"WCNҵ�e;WCk��KC�CV �E���*!��h�n�o�v������"?�1˪���롋q� vZ��K�	��.����_�6=:�+Ң�y�����
���K�4zx��
�L�ť���IoOCE
;Q6M�`]�����TD��s��E��a�,|ʙd9�Iङ��CK-���{|�׎�Aг�=GD�~W�#�J�6l=��W#,�8�$���9G�=UT�����o	���2+�S�2��Q{��u���QnU=�Qc����0Wv�b�0�����J
�QK
Ց7�4<�U��
�Sz
�j}��RdJ-��U"�
Yl���U-��q"N)����I�+�F�ۜ+����Ӽ
��M�תoÂ���l6����Q�j�q�'���}BR�
PKǧ��ѓ�%2V����,^��
j�b�K����L�N͙
�q����MW��.�P��W$������
+D���5G�\����84I���$�h<u�k�L59�0%Q��)�FX�C��ӻ�
�����
���a:׊]G'�u
��Z��B�^LE��e����Z7D�C���c�I��
U��]��iQ8s�2��*'��X�"���h6b�B��k���L2(:����I�1�s�˹�����{�uo:�k�%�.�k[��x�R�����u�
�<�����-�o�ͻ�m���

�	x���}�H�e�.��XD
�8r�D��\�%#
����k�6
%o؁zW>
 ><�ϸ�x�G���/�#�"pb:�h]�F��7��>��KHݗT��r�kwت �ӠD���Ւy��K���կ���,�G��C�Ss|��<g��uo?�������K@�
��	4�ͺ'��)�$&O:3
��.��[�G�¸���E�;{
��*����Kw�-K���T@�O���+LH�㛃��ӊwĪfgh*�� Mj�TV���F1�k
I
�?5ڮ����åےT�ѻP.d�wѩ/��"\G�
���
��G"�
�u��+��t�bg��[����pS�jeg)s_�螢bM��R
-εQo��
}� ���������@1n�M͢
���6"�-lW�Z7U���
;���mD+�|G�F��Z��@
����Q�5����(g�`R���X�6T�����.��|��6���ч��
�?��3
o���3��� m�B ��MY:c�q�P}E'�-2���
+@!S#����s����I���U$ZJZ$��\!X��P8���+�x^�|�f�:��d|?@__��h���^�a9��n]چ�*5s|Y��E���v_�#^��[�/�s͢O��
�?v�s`\�ؿ��^X{��~Ej�aW�K/Tz�
����Z���\��j�
|��>�?��a��x(~?�B�
<q����
T��5F#��
�s�B�
+����[���N��o�ِW]r�a'tܯ�_�|�"�8w�VۥDD�#��n���f���?�
�
+endstream
+endobj
+542 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100336+01'00')
+/ModDate (D:20111106100336+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+543 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+534 0 obj <<
+/D [530 0 R /XYZ 89 770.89 null]
+>> endobj
+535 0 obj <<
+/D [530 0 R /XYZ 90 721.073 null]
+>> endobj
+532 0 obj <<
+/Font << /F58 536 0 R /F24 537 0 R /F41 538 0 R /F42 539 0 R /F60 540 0 R >>
+/XObject << /Im1 531 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+546 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+545 0 obj <<
+/Type /Page
+/Contents 546 0 R
+/Resources 544 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 541 0 R
+>> endobj
+547 0 obj <<
+/D [545 0 R /XYZ 89 770.89 null]
+>> endobj
+544 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+558 0 obj <<
+/Length 1539      
+/Filter /FlateDecode
+>>
+stream
+xڝWQs�6
~���ۤ�X&)ɒ��9���KS�v��}�e��U�\I^�?� -�q�ݞH  �@�Y�Yw��EopzV��C1�k+`��xl�~�C ��϶�|]����=��ŭ��H����z��2k��s�8������cn�{�X��uL�*�]���M�w8���l�m����E�f�1�E��`�eV.eՔ��N6ER%z
ؒ���{(�}���f
�8�	<��8~�6gڶ�͡���|�pG���[�ۦٿ
��`�aS�b����t��O�۬���2=�d��d�V�Rjf��4�:<��j�;-��\���g�*��[g��{�잘֧��j��uVN�g�
7UR4r�
nc����9����٫�n�Eu�F�XR�eE�]����4o�F{{LT(V�2"ZG~i�r}�����#Qn+)/��V�4�\����������ܖU}�sW

GBR`��i�'����ݹ?,��b�p��[�[D��2��{�g%��W�y�n�0�I�)�h����H��+
+E�S�l/��@HD�=)
����%KTYy.STZc0��Q��*��S�e}Jd
�2["����p����j�1J����K
aWGS�N߇<��u�*���T*v��9Z(��X��a1�p��8�KM��E��-D��tp1=�F���
+�*43�b/K���:���/Bn�������ke��b��$ۋ��I�IA�J�@*kh<���7�k��Ƞ�ר�Y�#��D�J�K��"RL�8��Nj"v�d �, �S ������JUX���A�Gt*>a��w�F̨7 �jҐ(����r�������~�����
W !��ha�+�)
�„���p4�P"��
�.Z ��O 7ݍƳ����?^�On4$&7����AB�1AB�
���̂��& l˽4$�j���9͖Z�P��!��DRM��&�w$6z�����l6zX|rb�*ʧ�[���,%��
]R���>� ���/�g�P	�����
tb�����d�I
T4�N��\/>�h2�a�n�fΐً����H��������%s�}��;����
��a@��}j����M%�
�I��v/�z&x�0��&���&�
�!����I%S��^ц���
V*��,
�Dy�e	���P.`�,;7Ias� [...]
�l��m�Vn�4/!п5뺬���#���Q�{,Ԍ���"bɷ��݁N�
����皓P
�έY�s��Wm
�}s�]���
ߜ����<p� �@�ĺ̓�}��U�:�M=����+�h�ߑ�	��CϷ�/\/
+���\!�(��\1�NMLv�z[¯��7�B}�~HF����~��
+������_A�@%����u�s��,�.jY��?*�7�����:{&3x`�}%#���=��|��W)k��!s���J�N�s~��eal�^hR��t�o��+`
�,L4t:C����_I�w�����;
+endstream
+endobj
+557 0 obj <<
+/Type /Page
+/Contents 558 0 R
+/Resources 556 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 541 0 R
+/Annots [ 548 0 R 549 0 R 550 0 R 551 0 R 561 0 R 552 0 R 554 0 R ]
+>> endobj
+553 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/bugseng_logo.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 563 0 R
+/BBox [0 0 640 166]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 564 0 R
+>>>>
+/Length 1662
+/Filter /FlateDecode
+>>
+stream
+x�}W[�
7
��S�	��8F�
�c6���)R"��Y��Z��J$U��ʩ\Y��Ϗ�o��ۿ��|��r)�j5�hu�9��]^�<r9��m)S�M�:)��v��� j��a+%�z}
$�$�/�*i^�jjS.*s&,t���R�<+h�:��wݱ��)�Z��
i%�z-�{�
Q݆��V,�Y���W���I_���'�ԫq�"��
��'
�*���b.i��\O�>���%�h�&�Ȥ�~˄@�D���N���$�_�&a#��e�Uj�|[Q�^o��2o���îi!cZ�ף����
i����s4eW

E����݆��
�<+Z
I��P꽇�8Y�Ɨ��3����4�W)�����/r�]w��<�ʶ�q�<��~�t��
�_u)�V��Y�U�����
+����/ 8� &���Ua���j��Je��+%
+��̉�)i�U
�
�S���F_@��rG�T���HE�
nw�6[.�:�o��@r�������ЊCAT���F_�n�n��)|�d�Q��
H�i��?
�h=�8�8΍=U��UPC%Ӎ�.
��(R�ae*77=�󱁉�S�^�
+��3��j_
��
�Z�|>j�$�3�#a���>�׹2D���'N)�
�+ }��"��{�7��Aw�a���mŏ�
+FVCg��
�ԭ����)_����'�\G�^����\��1B��g��n�\ڠ�NY�
:��Yq�&�Fa�-��� B��S��f���7�G	#S���
٬7��E�� 9�D��M
+G
+�20��Ci�e�+������D�����ô b�~#����z�'�\.���F�է��]xv���i�@ I�8a�=�z[PjVkn��w|0S��t�h�m�ل֩�H�F��@0#����5�jN�1�-�R�F;p1jվ(�֙EHG´��i
�;i�`
 {��&4X��s[4�I�
d�!
޴r/^�a��@��Ƕ�?Zr�W��U��PǗ}2
��di8�ÍU���Q{?��b:���H��l�D��
�0ձ�vxk�ڱ�ʜ�

ו��^Y�"Ƃ۸���8�z��Hح�(;�����_۲h��a
�
+�e���f���hX�R�iqV`z��!��9s���}���g�z^���A�.a?�S�*To
+�W�h@�+V�C�`�x�k��a�<��]a�M�:r�#�`[�{���T�|�W��$̽�g����+�xآ%��
-$�*^*��w��+�M��M1����Q���o*Z6�P)�P�n�+T�`����jV�
+	�
+�,r ��U��W
O�qj�T�M�J�p/������5쐯�kC����u�%��u_(�@�3~Gvig\��W�A�^���j;+t,q�pLM{9i�I�s$��!w�tꡎ�+�!�HB�$���� ������d�_
d7e"�yξ��W��w$����+N�n�� 8�uXl���W(��DY6�~٭����Ȧ�<6��IJGfQ%?4�
�
��L+Bt���{1m�8�MS&L��r9=56*�Q�*�RȾ�{O�C=��P���Yb���
���h��k
9K,k�8�n#�f:Vl07�:��+��i�v,��~"[
�k�� :)��
z��U����3���b��X��?k���1�G���f��σo��?Q��B
+endstream
+endobj
+563 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100335+01'00')
+/ModDate (D:20111106100335+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+564 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+555 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/ppl_logo_no_ppl.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 565 0 R
+/BBox [0 0 640 640]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 566 0 R
+>>>>
+/Length 2432
+/Filter /FlateDecode
+>>
+stream
+x�m�]�$7���y��%R����
+��C��s���ʬ��6
�Z��"#�d�u�Tά������ۿ����_G>K>{���gM^ο�8�s��(�czʥ����z���-U[�%�b�
9'cYSu��ó�T�*�^���δ��i��O/<��Y�J�8�|�6�i�G����T�2
�Q��R�RNk
]ΙϞ=��ǟ\�ۡ�Z��~��(�����YZ�<k�-����5k��Z��Q����~]7���Z
F���~��f��|����B5n��1�Sֈ�g
�
k+���㨥���h}�Sd�R�6{��X7S0�>��zʤ�@�����X�k���bq��x����e��2�ݒ9O�~&3y�-�qN�\Vy�V6����׍��}�p��
FX��k�0H
m֖F�uM@��办®�M쒑Rqp,�񶖕���y���W�2��
����:9FLs9o���n�	��S(v�A'{��� �\w|Q���҆�<i=ML�ZR�%��
+�&�
/81���L�n������``^I���*��g
��l���q��Ǘ�_� ������Q�Ov��vT�p���в8>���
d��o�ўAC�+���
b�8�$=��Zs����	~�4��ɓd�7^�ۣ�� X�~�����>�v��Я*�6[�h�b��h�G2o '
L4��dV2��?�i=�kq���@�7Ye�i���
�|G`ped�m��ڵ��\*'3�	
+�V/#�0�ۜ��!0�x/uA�N��ㄵ�"3 H�W�
v"젰aC"`� 6����{	�T�g��H]~!
b��S'����Z���>���]<ˀ����'
?��M��������
q�K�ؓc<1�c�3����x�h�H/r�ђ�'�
��(
���4��-0Y�~�BJ�1L��	�
^,t�����

"��bQ�N�b�3J"�� ����B	���
�����6\�h,�0pRٖ��Ѡ= Pz=�%�B�Mޑ�>ؙ�/1��
#��@ңvR��`r+pB���{Qo`
	@���_轁D^��j�J��H���(�B�3qy_�
�����G��K�cG� ��-TlFq�4T�G08��2�
�,E�
⃝VTD�
JY��&x;w+d�H\��)SU�t�����_!ԙ�q��P��h�[z
I��f�Q�M�sTQ؜���"�Ch&,�ɮ� ������M�k���C[�}���<��N�Ӑ7�}���C<;�d��./�F\KXS�>�"�
+}W,T&w�>8�[�����
+wx�_R�O;��{U�⑨���A��Wn�_N����#b��,���n~v�7�hI�W�{�Zw�LV1'�HI(6�;�C���
JBCFU$�=z����Ԝ�� ��8 ��{S�b�wH�g�Uk"�n�)[dA4ohw�@M�z�|��Z?��v#�քD�v��V�S"�Ed��
�5���:ND
,��	��{�!���}����?>'��+�S�2����mj� ��A�U=�Zf�wH�x�d��y�J����H#��� �Ҙ�
y�NP�'
b���#�U�
�\_j���D�[���</������r뤈J�o���jQ�e
+��3��˵O�yK�b���C���C�a��!쩨.6%g�'���Ս��@�/��4qS�@
bgS}w�}-���Cw#B�ZD�k�B�,&%U4�һbܴ������!'QE��n���	�� )�rO��1
h���m@��P�&�q��S��J��Yn��PxV��S;uc��D���z�S�_b
���-�]���8,�@GC�U���$�
zٲ�4w����L�@ԁ���SQ�H&�0�tJZ�*6�?�R���A��e� �!�0nI��-���R��ʵ� ĞƮ'*اq��n/���u�!m� 
����ss
 =��-
+ z�`�k�,�~�D�x�mC�`M�`�+_���x?�d�։U�uh�g}P�d�v-���q����:(��ڕ/�Ƿ�'��_�D�Q�fBc��/�fMj%�i���	%�8���U`�ԏ�a�l� 0v��s��DRn��h|�n�r��6pd�q�e�c�h�v0��Af�
���� ��jw-:��v��{�Њ$�&H��

�|��|�zL�w�zW|ׄ����_�N+��H�z)x_�{h ��\1Dz^ �Kc��!�aw�w�h
�(��.����
m��HA3À%�br�\�g�(���N�m��Ppn��
�88}�B?
+��?��"�`�����tu8��5���w\�S��i��h�R;�%{��.�L�
�
����3Lp	�rp
3Z[���&=K٣�E'h�>��o��4�	���^4�ѵlP���m�
�p#�י)ח�,�����M��ڮ5unT��7���*�G�F�Xjf%�A�H�K�;�4�ьw��
�JV��q��
<��d��������S2
�
+endstream
+endobj
+565 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100336+01'00')
+/ModDate (D:20111106100336+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+566 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+548 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [385.063 648.798 490.947 659.702]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
+>> endobj
+549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 626.945 322.585 635.792]
+/A << /S /GoTo /D (GFDL_GFDL) >>
+>> endobj
+550 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [231.464 595.308 337.877 606.212]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
+>> endobj
+551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [440.112 583.353 513.996 594.257]
+/A << /S /GoTo /D (GPL_GPL) >>
+>> endobj
+561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 573.455 169.87 582.302]
+/A << /S /GoTo /D (GPL_GPL) >>
+>> endobj
+552 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [204.862 457.687 398.138 467.585]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
+>> endobj
+554 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+559 0 obj <<
+/D [557 0 R /XYZ 89 770.89 null]
+>> endobj
+556 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im2 553 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+571 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+570 0 obj <<
+/Type /Page
+/Contents 571 0 R
+/Resources 569 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 541 0 R
+>> endobj
+572 0 obj <<
+/D [570 0 R /XYZ 89 770.89 null]
+>> endobj
+569 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+619 0 obj <<
+/Length 1702      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�H~�W�mA��_��JMڤ�i6!�Ҷr`B��M�i��c{l��@*mC�l��r��˜�@o�A�q�i


�)�8�^��S�T�ͯ���y����s���y�Q
&�e�W�>k��4�5�y=��f at H�7j|���y�΃�(���^�^�.��e��LQ@(��LىDa��d�
���'U1���PH�ƨ�F��u�[m�`�4�ia֌⑟Q�?,�ɭ�o����!�z�ژ3
+M��f���L�D�R��0�
�� 3!
M�b�~`G>�~2���:*��	Zmf�xZ���H�ո�:_[���?Z���s�_��qtX�W`�B��|��@�XD�
�5%��Xs��%�JI�1]�Rj15�e����
�;뀢��������>;�p��Y�/��8XM20���&�>X��_�
A�� �E�����y��-�S�?N"�F'��Fa�L=g�=ME����m�:��2(�\*Vb�?�۝����OK¦����z���H	/o�q]��+�Cg��›. at x������֝���SYM���:(A1�K�
B�r�u
����I]uR�IO{uKB��p�=�5�o=G����RU�{R��2�0)�Y�u4J�UVB���[��7���2��~T����hn�:N��o{�h<-�$ �_1�ϰS�dd��I	Pi���؏G���
��Q�[���a
b|�b�%�����J��[I�]Tb�
ø(
�]��i�B|>5j����p���a�)٤����Hu�㸅dS�³����.�~\�%k2�q�
�CԟuQ����~)" QT�s�q��� *��oZV��QkR��~
����f�3��3�'c��Z�ƙcJ����67X���x�I�DcC�g�?�������8�̻�n��lӫN�H*���m��K�
��͸��jCV���X��:V�spp�j+_
Y��:;����<
+�
�5q~1�X�C)x��`�rƁ/,�p0�z�3�d;���<�s�Gz��w��>��ױ$7%�>��R���v���n���-օ�L*��7:���)��7]eڑ�q����
�`�����n^����"�ɝI��cIE������0�@�`�9��,D�?[
�km���o+��GHu�.���
��L�y�v6ە����\��E��Ru���(���9���6m�=ed(.�N�˘�����(���x���
X���i	�ԣv�Q��i�6B at 1��=
��F�Ⱦ/���x%���H!*�f�
��Oϻ�a�X��Y�׆�q|��ص��_5ْ�u���4�P=�d�������x
��4+�UWX&jf
˝H���`�V�!�8�����D����ro���YK����ۋ!�
��8ND����(���}+
�$g�k���(!��
#X�
,�xM�a0�ьf�`�#�&�¸jUTV���T16�`.�t1䬰8�����l��8$����9pn��?��]׍Pn�۬��8�������!�Ǩ�i�ct�g��
Fh�0rN�Q* 3��V;� ������c�Iq ���f�OO�]!�8�����
���R8���w�
67
$Lėe�y�$����D�ЋF
`Te1*�o
+�=�b+T�G*@qB���A8��o
 go��g
탃��^G��ё� 
x�
+endstream
+endobj
+618 0 obj <<
+/Type /Page
+/Contents 619 0 R
+/Resources 617 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 541 0 R
+/Annots [ 573 0 R 574 0 R 575 0 R 576 0 R 577 0 R 578 0 R 579 0 R 580 0 R 581 0 R 582 0 R 583 0 R 584 0 R 585 0 R 586 0 R 587 0 R 588 0 R 589 0 R 590 0 R 591 0 R 592 0 R 593 0 R 594 0 R 595 0 R 596 0 R 597 0 R 598 0 R 599 0 R 600 0 R 601 0 R 602 0 R 603 0 R 604 0 R 605 0 R 606 0 R 607 0 R 608 0 R 622 0 R 609 0 R 610 0 R 611 0 R 612 0 R 613 0 R 623 0 R 614 0 R 616 0 R ]
+>> endobj
+573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 687.591 244.609 696.567]
+/A << /S /GoTo /D (section.1) >>
+>> endobj
+574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 675.558 214.074 684.405]
+/A << /S /GoTo /D (subsection.1.1) >>
+>> endobj
+575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 661.449 234.179 672.353]
+/A << /S /GoTo /D (subsection.1.2) >>
+>> endobj
+576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 649.396 234.129 660.3]
+/A << /S /GoTo /D (subsection.1.3) >>
+>> endobj
+577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 637.344 212.002 648.248]
+/A << /S /GoTo /D (subsection.1.4) >>
+>> endobj
+578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 625.291 288.923 636.195]
+/A << /S /GoTo /D (subsection.1.5) >>
+>> endobj
+579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 613.239 270.662 624.143]
+/A << /S /GoTo /D (subsection.1.6) >>
+>> endobj
+580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 603.124 217.551 612.091]
+/A << /S /GoTo /D (subsection.1.7) >>
+>> endobj
+581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 589.134 243.991 600.038]
+/A << /S /GoTo /D (subsection.1.8) >>
+>> endobj
+582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 579.02 197.207 587.986]
+/A << /S /GoTo /D (subsection.1.9) >>
+>> endobj
+583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 565.03 255.867 575.934]
+/A << /S /GoTo /D (subsection.1.10) >>
+>> endobj
+584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 555.035 247.04 563.881]
+/A << /S /GoTo /D (subsection.1.11) >>
+>> endobj
+585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 540.925 302.382 551.829]
+/A << /S /GoTo /D (subsection.1.12) >>
+>> endobj
+586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 530.93 262.263 539.777]
+/A << /S /GoTo /D (subsection.1.13) >>
+>> endobj
+587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 516.82 296.564 527.724]
+/A << /S /GoTo /D (subsection.1.14) >>
+>> endobj
+588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 504.768 209.651 515.672]
+/A << /S /GoTo /D (subsection.1.15) >>
+>> endobj
+589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 492.716 191.35 503.619]
+/A << /S /GoTo /D (subsection.1.16) >>
+>> endobj
+590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 472.349 229.087 481.325]
+/A << /S /GoTo /D (section.2) >>
+>> endobj
+591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 449.945 252.131 458.921]
+/A << /S /GoTo /D (section.3) >>
+>> endobj
+592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 427.541 165.446 436.518]
+/A << /S /GoTo /D (section.4) >>
+>> endobj
+593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 415.509 173.686 424.356]
+/A << /S /GoTo /D (subsection.4.1) >>
+>> endobj
+594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 391.182 180.928 402.062]
+/A << /S /GoTo /D (section.5) >>
+>> endobj
+595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 378.996 202.726 389.9]
+/A << /S /GoTo /D (subsection.5.1) >>
+>> endobj
+596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 358.629 186.288 367.605]
+/A << /S /GoTo /D (section.6) >>
+>> endobj
+597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 344.539 202.677 355.443]
+/A << /S /GoTo /D (subsection.6.1) >>
+>> endobj
+598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 324.173 155.484 333.149]
+/A << /S /GoTo /D (section.7) >>
+>> endobj
+599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 312.021 178.398 320.987]
+/A << /S /GoTo /D (subsection.7.1) >>
+>> endobj
+600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 289.717 206.393 298.693]
+/A << /S /GoTo /D (section.8) >>
+>> endobj
+601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 275.627 236.261 286.531]
+/A << /S /GoTo /D (subsection.8.1) >>
+>> endobj
+602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 253.358 221.874 264.237]
+/A << /S /GoTo /D (section.9) >>
+>> endobj
+603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 241.171 335.637 252.075]
+/A << /S /GoTo /D (subsection.9.1) >>
+>> endobj
+604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 229.119 395.95 240.023]
+/A << /S /GoTo /D (subsection.9.2) >>
+>> endobj
+605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 217.066 241.72 227.97]
+/A << /S /GoTo /D (subsection.9.3) >>
+>> endobj
+606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 196.7 196.43 205.676]
+/A << /S /GoTo /D (section.10) >>
+>> endobj
+607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 182.61 419.761 193.514]
+/A << /S /GoTo /D (subsection.10.1) >>
+>> endobj
+608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 170.558 513.996 181.462]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 158.603 201.053 169.506]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 146.55 467.421 157.454]
+/A << /S /GoTo /D (subsection.10.3) >>
+>> endobj
+610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 134.498 426.003 145.402]
+/A << /S /GoTo /D (subsection.10.4) >>
+>> endobj
+611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 122.445 399.865 133.349]
+/A << /S /GoTo /D (subsection.10.5) >>
+>> endobj
+612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 110.393 384.354 121.297]
+/A << /S /GoTo /D (subsection.10.6) >>
+>> endobj
+613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 98.341 513.996 109.245]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 88.443 164.809 97.289]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 74.333 409.953 85.237]
+/A << /S /GoTo /D (subsection.10.8) >>
+>> endobj
+616 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+620 0 obj <<
+/D [618 0 R /XYZ 89 770.89 null]
+>> endobj
+617 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+668 0 obj <<
+/Length 1980      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�F~ׯ��L������C}I�:�j�}h�a��
]
����� BB�]l%����,����
��y�{��y�98U�3�H*��g���AB�7އn�����Ԉ	e�
]���^��:'����C�#��)�&�a�~~�a���N�x�2�
{W�_;x!J~y|�X�r!��%���p�)B!�(#��!pw�#�ē��ƏÛ8�ϣ�8���?Φ�>�ӏ��|��
o�8���L�B$�C�a�E�����?�1�?*��DȅU��gT7B,u'�Ǎ���?
ς$���	�4�O�����<s��N��+KS%�K���Rq�zy���?�&a��GA��?�i�}�_�����p?
$07C�uENS�g |R#
gg���S�(��ep��:�)�
'�� 	�<�Ⱦ<��>6]"���+��i#��u
]܇q��b�
2F�
�RG�ԑ+������l2�O�a�!a��Y�q���]�Ԧ Ҋ6�}i��ZV�^��==��EJ at d��C�6-����≘�:��[��Qp���Ff��ѧ
�!���?L���5!D$b\5%嫘T��*Oh�g4J%x��d`L6A2"s�V��݌P�H�iGnc��{�8���:���B��$~%
R
+���hƁ
�~s�f�Q'џ�����3K}��6��Q��Z������UG٨�:�n����+�Vr�����t�IXf��tBP��<S�AO�R�
�ADi"�L���h"0������T@:�
V�־=�z�	v�@)W~@q��+z2���<
@�}bQb��]���k�	7�[Enc_
(u���8O‰�!,�v; �����M˹�@��2��:i�N�8㘤$���1��7(�Dn�j�QX��*�弦�"@��K����0g`�jޝ
�A<�narx8�M�%�C&t{@5�!ф5�|
NC�
R�k�����p�ي�]@=c��a{I53���W��[� ��4
�r?d��?�0���$� /g�����0��>�_R�M��4|�
_�
WȘ*��''/���(�ΐ�[����!6��5�(�S�M7H��
��i�m:
F�G���
敃A��rϖγ^f��̓`����-�i*
+��
Ŵ{��p��
���K��<-� ���Ď�ԡ�9Rr3l�u��D�C�L�7̾<�
�Č�¹[VD�UY�,o��ߺ�c���3_&�thh�� 
+ӴK��5 o����Mɾ7)�f|��,���b��Vm�q~�D��䶢!t�؉��W'�:�
h����8�(���i
�Z�a��mZR:a��b�P���$LW��4U_������0�k���'�&m.6��0m6��D[w
���$m��4���ܞ3v�s+�?�^�x6�◎��W���"̘�����g'+�a<�}��
���n�,�c�pN� Ɇdz���#
�;f.��G��j!�&e㤍�'�Ѽ��#���v��54J���La;�R�6�3����l�Ɗ���f�	”"kvZqm���:�+2j�3R���eF��
s��p�
�R��������Q�}C���۱�E
$�l�2ʹ�vAiCΕ,rN�"�Y�0CWx��~D�^�j3��sB�!��1

+��gc�
���QR�}Sn���sz��	�
R���!�ʋ8�k�!�ii?!_��U�ԆR��p�;���������K�ɪHs���/��YY'� g�ͷ�s��4��z�
: �d��lZ�K�LW�{��6����k���U��+��kJ�e��k�.�
+	�������
(��J�W��
,�Y�pp6a��
[--# �r���O
�(y�R�}iq�
�?.j�`p��m
�?��.l�.�>�����/�c�x�� �B�1���Waa�\�OK�Iߕe�T�K��1I�������f�5�W2�U'~[8~2+v�G�ی������� M��
+endstream
+endobj
+667 0 obj <<
+/Type /Page
+/Contents 668 0 R
+/Resources 666 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 541 0 R
+/Annots [ 615 0 R 624 0 R 670 0 R 625 0 R 626 0 R 671 0 R 627 0 R 628 0 R 629 0 R 630 0 R 631 0 R 632 0 R 633 0 R 672 0 R 634 0 R 635 0 R 636 0 R 637 0 R 673 0 R 638 0 R 639 0 R 640 0 R 641 0 R 674 0 R 642 0 R 643 0 R 644 0 R 675 0 R 645 0 R 676 0 R 646 0 R 647 0 R 648 0 R 649 0 R 650 0 R 651 0 R 677 0 R 652 0 R 678 0 R 653 0 R 654 0 R 655 0 R 656 0 R 679 0 R 657 0 R 658 0 R 680 0 R 659 0 R 681 0 R 660 0 R 682 0 R 661 0 R 662 0 R 663 0 R 665 0 R ]
+>> endobj
+615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 707.957 374.411 718.861]
+/A << /S /GoTo /D (subsection.10.9) >>
+>> endobj
+624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 696.002 513.996 706.906]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 684.047 284.058 694.951]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 672.092 374.949 682.996]
+/A << /S /GoTo /D (subsection.10.11) >>
+>> endobj
+626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 660.136 513.996 671.04]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 650.239 157.068 659.085]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 636.226 484.782 647.13]
+/A << /S /GoTo /D (subsection.10.13) >>
+>> endobj
+628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 624.271 394.316 635.175]
+/A << /S /GoTo /D (subsection.10.14) >>
+>> endobj
+629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 612.316 444.139 623.22]
+/A << /S /GoTo /D (subsection.10.15) >>
+>> endobj
+630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 600.361 424.761 611.265]
+/A << /S /GoTo /D (subsection.10.16) >>
+>> endobj
+631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 588.405 425.867 599.309]
+/A << /S /GoTo /D (subsection.10.17) >>
+>> endobj
+632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 576.45 402.067 587.354]
+/A << /S /GoTo /D (subsection.10.18) >>
+>> endobj
+633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 564.495 513.996 575.399]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 554.597 179.195 563.444]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 540.585 426.725 551.489]
+/A << /S /GoTo /D (subsection.10.20) >>
+>> endobj
+635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 528.63 364.987 539.534]
+/A << /S /GoTo /D (subsection.10.21) >>
+>> endobj
+636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 516.674 399.307 527.578]
+/A << /S /GoTo /D (subsection.10.22) >>
+>> endobj
+637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 504.719 513.996 515.623]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 494.702 157.068 503.668]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 480.809 433.628 491.713]
+/A << /S /GoTo /D (subsection.10.24) >>
+>> endobj
+639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 468.854 474.564 479.758]
+/A << /S /GoTo /D (subsection.10.25) >>
+>> endobj
+640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 456.899 413.892 467.803]
+/A << /S /GoTo /D (subsection.10.26) >>
+>> endobj
+641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 444.943 513.996 455.847]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 435.046 164.809 443.892]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 421.033 452.427 431.937]
+/A << /S /GoTo /D (subsection.10.28) >>
+>> endobj
+643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 409.078 459.63 419.982]
+/A << /S /GoTo /D (subsection.10.29) >>
+>> endobj
+644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 397.123 513.996 408.027]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 387.225 179.195 396.071]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 373.212 513.996 384.116]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 361.257 294.579 372.161]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 349.302 358.361 360.206]
+/A << /S /GoTo /D (subsection.10.32) >>
+>> endobj
+647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 337.347 392.682 348.251]
+/A << /S /GoTo /D (subsection.10.33) >>
+>> endobj
+648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 325.392 452.447 336.296]
+/A << /S /GoTo /D (subsection.10.34) >>
+>> endobj
+649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 313.437 497.404 324.34]
+/A << /S /GoTo /D (subsection.10.35) >>
+>> endobj
+650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 301.481 449.245 312.385]
+/A << /S /GoTo /D (subsection.10.36) >>
+>> endobj
+651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 289.526 513.996 300.43]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 277.571 300.118 288.475]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 265.616 513.996 276.52]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 253.661 294.579 264.565]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 241.706 474.152 252.609]
+/A << /S /GoTo /D (subsection.10.39) >>
+>> endobj
+654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 229.75 480.014 240.654]
+/A << /S /GoTo /D (subsection.10.40) >>
+>> endobj
+655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 217.795 473.055 228.699]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 205.84 513.996 216.744]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 195.942 164.809 204.789]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 181.93 416.493 192.834]
+/A << /S /GoTo /D (subsection.10.43) >>
+>> endobj
+658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 169.975 513.996 180.878]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 158.019 201.053 168.923]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 146.064 513.996 156.968]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 134.109 252.935 145.013]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 122.154 513.996 133.058]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 112.256 164.809 121.103]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 98.244 356.678 109.147]
+/A << /S /GoTo /D (subsection.10.47) >>
+>> endobj
+662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 86.288 390.998 97.192]
+/A << /S /GoTo /D (subsection.10.48) >>
+>> endobj
+663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 74.333 450.764 85.237]
+/A << /S /GoTo /D (subsection.10.49) >>
+>> endobj
+665 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+669 0 obj <<
+/D [667 0 R /XYZ 89 770.89 null]
+>> endobj
+666 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+729 0 obj <<
+/Length 2131      
+/Filter /FlateDecode
+>>
+stream
+x��[�r�F}�+��
+�_\�<�/'�61��IQZcU�D�������
+ن�n�@b��9}�O�{#{ooz��k�<�����=x{�$$|z�w����^��{�G���!���\�ύ�^��F�+�H1�@J{�q������?z1�����
�
>C�������R�=�ǹ�?��+OG0G�sO�)��`$p�M���N������~'�
�0����<���}���D�ͮ٤զ�ПN��{�`
lnT�Xއ�0��Zm��>�1+��M*��16��mB�K��I0t��ud�����q�-�,�B]�ҿ�I��1
� g/1FN	#�!��Mk#��i���9����l^��~�i�ڱ���W�03���	�~P�X朞nR!�K�oƓЎm��iG�翶4n���q��/~4
�p>ӻ'Ya��g�j�C������21�� ,Y���+.Y˝IN�
�a�o�����isǰm�
�T�E!�?_1:��Q�|��Z
+7-ض �
Z�1�
���
߅�6gP��-��WD�,d糉`�YbŜ�(n��B�Q��Z���(����1��>r�YʹS���e�ۿ��i�G�;�)�N��{%'�s͆�� ��mTp|e1]�Z/��E4�!�Q!�ey��,'��M��_`z�XlS���UD�\���Z����
+D����$��L>�(\V ��LP��
���g�nI�����!�YR��8��gl�ծ4�ۡT(���I'�vq�ﵘh&֞�im�"���Nƹ8�NJ�]Y?�_�=I�t:��t��Qy��’װ�:�&N�Uac$b�:��E�v0>���Ck��
+��.
+(�
+�C�I����;I�1�#v9a'�}1fj�N���,L�I
��TT
�.
�FX	�*i�����ZtE��.c����lx���*��!�����?%���ʂ+D�x?Z�0_���;�(m�1f6N����b�s
�eB�"Nv�^'�����,��x9�6.j�ćH���M�� =�w؎��}L�w���pVHۊ�
S�9�.���%�W������إ50/�UX
��,��D�� �Gq��}�'�ʝ@�t�;��W1�FB�#�ԉ=�n���}�-W:�w�I<��V���!��{'og�){��TE�[:����c�HD|�YG�@͑���)'�3?�~>�f�Y�\e�A1����b����n�k�WM�@J���2�|�Q�_�Ok��Fyw���k�_T�B��
D�^�M��h���UqMU�� �(s��{�@��q8�"<�ٛnیk �
x=��*���Jx����
���w��90����lF�X�Y/��2�`F	�{)le�/9]1
+x�r
O5 at d���
+dɺ������i)O��!�(��%|%]��ݦQ��[�8��m���?kHnj�j,s���Yk��욶rz­��7x��\�U�Ԧp.-�dZ��Fb��
�N��WY!C����Z�
����-,%C��Mj��@P"�6��Z��,�}_�&ζ��ϳ�
�V�����ֺ�FE��ڌ��l����{��,Pk0�e�ʏ�Gg#�K�
���m�ަ�����O���o��,���5'��*0w��������~9W�r�|��•` ��Zk�9�SD�r���l��
����[�*��[�s�M�0T�v
+�g*no�]�zy@�I��v�P�U���L
Ps+��
)����m�4�{RP]0�O�{R��Ԧ��Aw�O��Hĥt��oX�a\lо�{v���X�N��;�[�PP7� '�vX�``�.#�n�xX��K0+�ģM�"_�&c�����⹟6�$�m����g�*�P\�Z!�����oe�k�^
/���H�ުr
v�cQ綀/��a
�O5��y!�w��	1��
�
�����f����!N��(��&uw%R�N9d���oof;G�j
��,������� �
+	�~��3��N�]q�
�ߴ�h���ޏf~X
�>����B��C��p��l�1��K��W
����*V
�(���>
�tr~v�q6��h��x����ՂX
�9
��ܨ z�S<+*߅-})pV�����?a�ͯX=�O���pv3f�e
N^�$�
�ܓ
+endstream
+endobj
+728 0 obj <<
+/Type /Page
+/Contents 729 0 R
+/Resources 727 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 741 0 R
+/Annots [ 664 0 R 683 0 R 684 0 R 685 0 R 686 0 R 687 0 R 688 0 R 689 0 R 731 0 R 690 0 R 732 0 R 691 0 R 692 0 R 733 0 R 693 0 R 694 0 R 695 0 R 696 0 R 697 0 R 698 0 R 734 0 R 699 0 R 700 0 R 701 0 R 702 0 R 703 0 R 735 0 R 704 0 R 736 0 R 705 0 R 737 0 R 706 0 R 738 0 R 707 0 R 708 0 R 709 0 R 710 0 R 711 0 R 712 0 R 713 0 R 714 0 R 715 0 R 716 0 R 717 0 R 718 0 R 739 0 R 719 0 R 720 0 R 740 0 R 721 0 R 722 0 R 723 0 R 724 0 R 726 0 R ]
+>> endobj
+664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 707.957 371.482 718.861]
+/A << /S /GoTo /D (subsection.10.50) >>
+>> endobj
+683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 695.717 335.109 706.621]
+/A << /S /GoTo /D (subsection.10.51) >>
+>> endobj
+684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 683.477 381.594 694.381]
+/A << /S /GoTo /D (subsection.10.52) >>
+>> endobj
+685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 671.238 379.92 682.142]
+/A << /S /GoTo /D (subsection.10.53) >>
+>> endobj
+686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 658.998 414.241 669.902]
+/A << /S /GoTo /D (subsection.10.54) >>
+>> endobj
+687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 646.758 380.488 657.662]
+/A << /S /GoTo /D (subsection.10.55) >>
+>> endobj
+688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 634.518 463.257 645.422]
+/A << /S /GoTo /D (subsection.10.56) >>
+>> endobj
+689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 622.278 513.996 633.182]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 610.323 252.935 621.227]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 598.083 513.996 608.987]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 588.186 157.068 597.032]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 573.888 385.32 584.792]
+/A << /S /GoTo /D (subsection.10.59) >>
+>> endobj
+692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 561.649 513.996 572.553]
+/A << /S /GoTo /D (subsection.10.60) >>
+>> endobj
+733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 551.751 164.809 560.597]
+/A << /S /GoTo /D (subsection.10.60) >>
+>> endobj
+693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 537.454 467.706 548.358]
+/A << /S /GoTo /D (subsection.10.61) >>
+>> endobj
+694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 525.214 387.88 536.118]
+/A << /S /GoTo /D (subsection.10.62) >>
+>> endobj
+695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 512.974 392.104 523.878]
+/A << /S /GoTo /D (subsection.10.63) >>
+>> endobj
+696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 500.734 435.816 511.638]
+/A << /S /GoTo /D (subsection.10.64) >>
+>> endobj
+697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 488.494 373.305 499.398]
+/A << /S /GoTo /D (subsection.10.65) >>
+>> endobj
+698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 476.255 513.996 487.158]
+/A << /S /GoTo /D (subsection.10.66) >>
+>> endobj
+734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 464.299 300.118 475.203]
+/A << /S /GoTo /D (subsection.10.66) >>
+>> endobj
+699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 452.06 388.797 462.964]
+/A << /S /GoTo /D (subsection.10.67) >>
+>> endobj
+700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 439.82 466.853 450.724]
+/A << /S /GoTo /D (subsection.10.68) >>
+>> endobj
+701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 427.58 464.19 438.484]
+/A << /S /GoTo /D (subsection.10.69) >>
+>> endobj
+702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 415.34 453.111 426.244]
+/A << /S /GoTo /D (subsection.10.70) >>
+>> endobj
+703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 403.1 513.996 414.004]
+/A << /S /GoTo /D (subsection.10.71) >>
+>> endobj
+735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 391.145 294.579 402.049]
+/A << /S /GoTo /D (subsection.10.71) >>
+>> endobj
+704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 378.905 513.996 389.809]
+/A << /S /GoTo /D (subsection.10.72) >>
+>> endobj
+736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 368.888 179.195 377.854]
+/A << /S /GoTo /D (subsection.10.72) >>
+>> endobj
+705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 354.71 513.996 365.614]
+/A << /S /GoTo /D (subsection.10.73) >>
+>> endobj
+737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 342.755 242.696 353.659]
+/A << /S /GoTo /D (subsection.10.73) >>
+>> endobj
+706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 330.515 513.996 341.419]
+/A << /S /GoTo /D (subsection.10.74) >>
+>> endobj
+738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 318.56 218.617 329.464]
+/A << /S /GoTo /D (subsection.10.74) >>
+>> endobj
+707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 306.32 398.202 317.224]
+/A << /S /GoTo /D (subsection.10.75) >>
+>> endobj
+708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 294.081 369.988 304.984]
+/A << /S /GoTo /D (subsection.10.76) >>
+>> endobj
+709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 281.841 396.558 292.745]
+/A << /S /GoTo /D (subsection.10.77) >>
+>> endobj
+710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 269.601 380.688 280.505]
+/A << /S /GoTo /D (subsection.10.78) >>
+>> endobj
+711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 257.361 473.364 268.265]
+/A << /S /GoTo /D (subsection.10.79) >>
+>> endobj
+712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 245.121 395.452 256.025]
+/A << /S /GoTo /D (subsection.10.80) >>
+>> endobj
+713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 232.881 395.442 243.785]
+/A << /S /GoTo /D (subsection.10.81) >>
+>> endobj
+714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 220.642 362.785 231.546]
+/A << /S /GoTo /D (subsection.10.82) >>
+>> endobj
+715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 208.402 420.214 219.306]
+/A << /S /GoTo /D (subsection.10.83) >>
+>> endobj
+716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 196.162 377.011 207.066]
+/A << /S /GoTo /D (subsection.10.84) >>
+>> endobj
+717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 183.922 488.349 194.826]
+/A << /S /GoTo /D (subsection.10.85) >>
+>> endobj
+718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 171.682 513.996 182.586]
+/A << /S /GoTo /D (subsection.10.86) >>
+>> endobj
+739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 161.785 179.195 170.631]
+/A << /S /GoTo /D (subsection.10.86) >>
+>> endobj
+719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 147.487 478.585 158.391]
+/A << /S /GoTo /D (subsection.10.87) >>
+>> endobj
+720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 135.248 513.996 146.152]
+/A << /S /GoTo /D (subsection.10.88) >>
+>> endobj
+740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 123.292 284.058 134.196]
+/A << /S /GoTo /D (subsection.10.88) >>
+>> endobj
+721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 111.053 477.967 121.957]
+/A << /S /GoTo /D (subsection.10.89) >>
+>> endobj
+722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 98.813 359.657 109.717]
+/A << /S /GoTo /D (subsection.10.90) >>
+>> endobj
+723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 86.573 451.849 97.477]
+/A << /S /GoTo /D (subsection.10.91) >>
+>> endobj
+724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 74.333 382.132 85.237]
+/A << /S /GoTo /D (subsection.10.92) >>
+>> endobj
+726 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+730 0 obj <<
+/D [728 0 R /XYZ 89 770.89 null]
+>> endobj
+727 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+750 0 obj <<
+/Length 756       
+/Filter /FlateDecode
+>>
+stream
+x��VKS�0��W�V{�V$�e1�
JIJ!%�=P�c�1�#8&�ߵ�$3�2�ɲv���v��4B}r>�V[1����D�!�)����7@�ģĝ{��#�d���p�J�OOz'�n%szεCAD�m�B�O��K��}�f:D��R�x������!�;��b��9k
�d�AJ8֜#E)��v����S"���p�"��N�܍͠����Uw{{�|�ө)�2/��<M�
+��[���bF����U���R.5z^H�V���Ȕ�,*�u���)�j�n�f�h�qM:M���;gf�۔��TX��>����Ϛ�d}c�@]��S{� ��p���1�/(m�\/N� �J=D�*F�M1~�(� ��WI�X�_d
����y�:|}@_ �<�D�
I�N�d#Мdetp;-�l6��X
�	�s��X�`���D�Yi���;Id	|75o}��~1
4�4=��� rb�9���
T�:��5�?W!8��S
eß�Sȱ��kG�\;��
mxkN���U��;�Gm�w�
+��� ��x�N>��Nj,��9>�_x�0S���
���r�V,ׂ�9EX� �圲r�+,�
p�
�	U*��յ.�4�Ô��9�7�=���b�	��%��B
+̡
5:��1nZD�s\/�g�x�	�6	�g7qR�@�̫�1�m�v(�!�($�A"�fQ
�o?���R!V}R�p9 ��r��j]݌f&�~�>�}- �1��9;̋ڡ4/��&�жW��'�7�Zh/
+endstream
+endobj
+749 0 obj <<
+/Type /Page
+/Contents 750 0 R
+/Resources 748 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 741 0 R
+/Annots [ 725 0 R 752 0 R 742 0 R 743 0 R 753 0 R 744 0 R 745 0 R 746 0 R 747 0 R ]
+>> endobj
+725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 707.957 513.996 718.861]
+/A << /S /GoTo /D (subsection.10.93) >>
+>> endobj
+752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 698.059 164.809 706.906]
+/A << /S /GoTo /D (subsection.10.93) >>
+>> endobj
+742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 684.047 350.042 694.951]
+/A << /S /GoTo /D (subsection.10.94) >>
+>> endobj
+743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 672.092 513.996 682.996]
+/A << /S /GoTo /D (subsection.10.95) >>
+>> endobj
+753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 660.136 294.579 671.04]
+/A << /S /GoTo /D (subsection.10.95) >>
+>> endobj
+744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 648.181 371.631 659.085]
+/A << /S /GoTo /D (subsection.10.96) >>
+>> endobj
+745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 636.226 356.997 647.13]
+/A << /S /GoTo /D (subsection.10.97) >>
+>> endobj
+746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 603.868 120.226 614.241]
+/A << /S /GoTo /D (subsubsection.10.97.1) >>
+>> endobj
+747 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+751 0 obj <<
+/D [749 0 R /XYZ 89 770.89 null]
+>> endobj
+748 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+765 0 obj <<
+/Length 2617      
+/Filter /FlateDecode
+>>
+stream
+x��YYsI~��跕����
;08`�a�f_`b��]�j�C�G��7�2��-�x�u�yg~U��9�g?ܞ]=KC'w�$H�ۍ�{N�n�@�tޭ��� �Vײ�����ٜ��j1���A�
v�o޼�F�

��틳o�>��@�s|��i��ٻ_<�����y���E�!|+����g
��A�M�� ����FI`$�=7�+��yS�L���D�A�%��" �˴����q�	{�e ��|��ʷ�WB1�gR
c'���W�ob
+</r#/���/^�A�p�ݶ:�d�q��Zw�;P�{ ||P=}��hU���z��5��	����`�עQ��2z��vC�f�e�
+�c��l�~AL���E�
;1�B?X���Zҷ�{ЍlY�r㇫}����1ś���x��3ߟh�O"�����5�d���e�/KU˦^5�p�'T�,� ���t�����y
#� �B^`7/b)�Z�i�

|8���ĭ(�<B;�&�\/
N�{�4�h
+3oՏ�}ۡp퉣�L
A����Q�/���2��o�jt
\��r2���(V�-���g�;����yp����
��
��P��X숺�_o�\rY�w�΀27��%f!b�� �:�� @C�F��M���C�{�

+�٬L��DW�!��|k�n��T��{ppT�,Yݩa�$���+E�Pq�>�4��b/[�z/ьG1/PU�j36��n����ݪ���]��D]��*�lG��=��b׵M;2q�`�+�"Dv������@lh���gG���
 �h�nޝ��;���1�E
�IF>rص�vg�|E�9
+Gu��ij�R4�b�ia�� �s?[m�@}t��[�E7�r[G� ֺ�5
+��
��Wۆ�:��tD���d��Q���話���U���`���<R���j�6R�L�PŹ%�Z��J�N�"� *����N
ߩ��	B/��s2L*^L�
0i��"�Wwڎ'
�e�C��ZR�FZ��落c>�w���D�}�$�[ӂ@^���Z�
�r/
�^꣡�� ���$��7�
�4A,UI��D�AG�>+�n� m��	�H���V��;n�y����XQ�n'ˡ�!m�T/@Iw�rS��+UV%C�
}1���8���� VI�kɦn�ST+ka�l
6�
nI�
��7�޴�k�2H�x^�č�
`
 ?�a�� �O��e
�I
,:�:�B�dSV��Pڑ��:50H�)7�sS�R%p�#��!�& �e�E�
�F 
,�8�Ό��L߬�}	Ԑ��-
�� �͂�?��	 !ktM·N��h��9�-0�un�� 
�0���~|�!!*���ЈZlHq
 � ���
����s-!'
�Z�ksp�j5L.':
L�Z�7wr�ٰ�=��:i�t��J9��Z
�L�t'�� �Y��G]���
+�L:
O]I�Q��V(�����~e�b
ƗLBAx\��
�3��T�gZK#Q7�
|�
W��B�Q����H栙BHv
)>�6ȁ��6
W���ފ答�����6IKlM=ԆiǦ�>�A���BIr0��0Gw��
T���k��y�8�
�%�d�j�}\�^�P�&��k}�c���ľ?q�
+�=H.m�
Ѯv$4�8L<�%j��7(
���sA�ͱ^O�Z�0g�
͙���QB�������N?��#^L2�᠟����UdTX&��ﵡ�L��0�u���(�球��iv�Ɩ�NZ�8^�؎��N�a${$D�<M����!�q���‹ԛq]i�헪��.]�U/@����I��&�
��\Ϸ`=��!� �:��9��iz���▦�&z'��pb�ip�JW�(�4����e�Ğn�
@r�2��G��I28�M�f�fŤv���L�Z[�7�sl�׽�Wv
+Va?ǝ���yk�R����h��e��
+F�=[����=[ஷ=������ƒ���d�,����cY*��aF��T�s�D�{��J"m�ݗ�gυ �"��|�� y#S�=(� r��t��?Ay����H2��̧8_^}�a{K/�[]a,q
*���cT�6I�at��
��
����a0}�K]?��f8�9����4X���	�ď�����d�W9]���}���>���껸Y���z�TU�O9l�%�ͣp�3�ۡyv����bX�� h�R
5�#/6�=@� Q�%|hi���N�w+s½m�������
+'!"�Ȭ6{Ѓ�v��(����H�z���5qr���ki�&����)�t҂57
�S��O�p��3�����F�I<�ռ���[i����&�gk�������r�%��&q�G`��]�����z�}�U?J������ۅ �R{���
�,�-�Y8��&���kȃ�g��$����������5|��ңG
+1��F~���	���5M������W�/�3S�m	D3 �D��%�v
���r�����_
r~|%�*���k��M�������FJ����ֿ�,Gv�Ϩ(�/M�a�?��Z��^6[�h��
+�Ȓ�^jh8�W��?���k��2�|���h�p��i�WL�z�l䁫�u�<mA��������A
+endstream
+endobj
+764 0 obj <<
+/Type /Page
+/Contents 765 0 R
+/Resources 763 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 741 0 R
+/Annots [ 754 0 R 755 0 R 756 0 R 757 0 R 758 0 R 759 0 R 760 0 R 762 0 R ]
+>> endobj
+754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.351 628.995 427.818 639.899]
+/A << /S /GoTo /D (index_convex_polys) >>
+>> endobj
+755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.548 273.425 337.122 284.329]
+/A << /S /GoTo /D (index_use_of_library) >>
+>> endobj
+756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 155.605 190.125 165.503]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 135.443 202.08 145.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 115.281 187.689 125.178]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 95.118 229.532 105.016]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 75.05 169.757 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+762 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2 0 obj <<
+/D [764 0 R /XYZ 90 721.073 null]
+>> endobj
+767 0 obj <<
+/D [764 0 R /XYZ 90 699.812 null]
+>> endobj
+768 0 obj <<
+/D [764 0 R /XYZ 90 699.812 null]
+>> endobj
+6 0 obj <<
+/D [764 0 R /XYZ 90 699.812 null]
+>> endobj
+769 0 obj <<
+/D [764 0 R /XYZ 159.628 264.623 null]
+>> endobj
+770 0 obj <<
+/D [764 0 R /XYZ 90 247.629 null]
+>> endobj
+763 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R /F32 772 0 R /F10 773 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+787 0 obj <<
+/Length 2279      
+/Filter /FlateDecode
+>>
+stream
+xڭYYs��~ׯ�[�*s4��JU��*�$������R��HB-� h-���==8	Q^��1gOO_w���q�����叡�b2���^̽Џ����>.����O�
+"&� �������~����.ޭ/>_�➠횅���.>�ʽ-
��q���{��v�/|s���_�q‡
|����U�B0!��ORj{x�
O�

��^z@%b~��_W�v�}r���hW��"Xi����� 
+ISO��2�G�<A��:�
��[��	G1
�jd�r��x�Ч8�L���i�{��/�Dz6�[�+�";:W��)�����{��I]�0�
A�C�LhL�=��߉R�=f�\
o�T3=΋˪��"cE_�VV��!�{q��X�X��Ko�
kM+�N;c���y��(l<G$da�G��<��'�yYQ;)�B/��)���<j��cj\�{�6�}ʶ�#5A
v��X���|>dK�_�$7ES��/�H B����
+ˢ���+_
+\-�����bK��%���*P�H����G��x���v��yW�+'�op�����)�3���t�fE�$Ej����/ʟN}	�
z��A՗$?�oZ��wvژ�>Ow�u[F2!�
c�/�hY�hQ�]R4=R����!�jY��1�G@Ι�;K�ݾ<�ڐ�=���E��Á򥒋���m��_��Cژ-q����`
v�2顪�I�����f@��U��V���?���F
v��p=�����M��4?lφ�]B�M	~P���|24H�(��
ݖ?�x"�D����w�2�:g��9�I��k�cBi
�����CR5��x��l����T%4f�	��^�G��J�� t%]��
�q\{Q<�$��~��R3��
p,�����X�Ќ��%�����
+���
"`1�ns%�#�!��V�Z�����+Z�ƒ
|�`�wB�0�XL��(����N����ro���6%�"����>�,��$)Q��XppB�b!u��.�?E}��;�2G��w��
+Q�ߡ� ����vԆr�RӸM �=%�%��Ep�ަ�H+;�0x�"�5�h�ZX��7��f��$K��8<]�D��ժ�Y�
���Q���X]-}n�c���n`4#��5{c�
N����RVn�>�MRgw��e�zr
>q.��U���*ۘ��N�0��$��A<�
��
+�eP�0�\A���=�E�ܙ�j�W��}�bQ�
���@�3���
C.�9��"K���;	��g�
�G�'��=�]�f�fA�Ez�f�GkFmZ�fF{�6nB`�c�<�3��ڢ%-�:�TƸ���a<��߲b���T,* ����Lf
+
 ���3DC��N:��>Oϗ����G� =
�U�	�s�w�#
�P�'�>N�B��%d�!�
aų�!��
*P����6A��&�8�Tsic�3ާ�

 ��BAbsr#o�� ��Y9=�$���_�ƚ>S2�����
+�*\Q�94٠�kl �
8��a����~�4����W���qTMu��
e���)�UL�e������{���'�rԽ���I���
�E�P.�;����l�
+¡�K�<ݦ�A�9`>FÃHC3���5����
�{��m�p$h�tX6��a3�)�A�Z�j���ʇ��}A�(�*���Tҥ
+8~�]��D�)�s�}�i��%Gظ}�S8��piUC�`��#m�
����1X�Æ~�N�`�[Oq�nC3́�u�Y����d�L(J����x���ÿu�
���G��1
G&\x������xB��p-�yN�H�
R�de%�\~
I����9N2���8�T�T
zWn^���`��LQCn�f���P^9J�@����$��N��=s����4�A�kd �o#�g �B��G:s��U&�2|��v�2�V1�S�Mk�{,�۷�ŶO�5���b���
�g��
&�΃`�C+�
s4躌5����l����%D�C�o�0�%�`s����vp"Ezw�[0��O���6M!�8g�/���0c�S�)������o�W�.N���y��'7��A��Lz*!��}���#ٿ��tN2� \�ga�_�-c�9{�cw��VHp-���
6�����G��`\����
�v���.��wU���
+�z��/P � ��C3<׭yF���M����
��&$@}�u�l��
�#�WD�`��L��K��ֱ�wz��bz�U�M�}y�9<Ԧx`i�;��~s
3�'����pV�k�uH6U�� 	p�
+endstream
+endobj
+786 0 obj <<
+/Type /Page
+/Contents 787 0 R
+/Resources 785 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 741 0 R
+/Annots [ 761 0 R 781 0 R 782 0 R 783 0 R 784 0 R ]
+>> endobj
+761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 708.674 142.304 718.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.957 613.938 268.261 624.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 552.315 259.42 562.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 532.496 337.129 542.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+784 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+788 0 obj <<
+/D [786 0 R /XYZ 496.074 468.299 null]
+>> endobj
+789 0 obj <<
+/D [786 0 R /XYZ 90 451.663 null]
+>> endobj
+790 0 obj <<
+/D [786 0 R /XYZ 390.898 352.07 null]
+>> endobj
+791 0 obj <<
+/D [786 0 R /XYZ 90 345.43 null]
+>> endobj
+792 0 obj <<
+/D [786 0 R /XYZ 338.874 146.894 null]
+>> endobj
+793 0 obj <<
+/D [786 0 R /XYZ 90 140.254 null]
+>> endobj
+785 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F11 621 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+801 0 obj <<
+/Length 2517      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۸~?�Bؗ�h�#��.I�Rdt�-�H�>$��l��je�+�9��
��(G�I[�x�ƙ�􉂛 
+�^������T9���wA
i�3�@�
>���՚GQ����Z�(�kQ5�z�*��p�V<
u�ZK��$�����p����_�8���*�f��p���((a�� b2ς[Ctb!�[��~Y#_�$�D�Q�b�)!9��Qe6w˂k��U����޶�Mw��V3$
֜��$�A��/�{P<��b��C��_4��h��Nݰ׎�.���EB�42���!�cmcy�v�����Β��6m]�h��ʱ���Pl�jk����^�k�djr�+E꽜i�w��j�
+U?h��5��JO#iv�^���7��4��<B7�M"��G�2�@G�1").�DL���"�G��OL5�e�U�8��b����y(NC[�7ն������St����x�sN:'�y��'��Ǫ
gЗ6gq6��yA�
b�{��dq�>�ϛ�Ԕ�\��5����s�W)����O�d��Q��Ŵ
�yф���9xJ>҂�v(n��y1�A�hn���h���ﰘ|�b�W9h������Ǚ̯M��SQW��9֓	S�}֛
�?�4[T�C��{�K�FR=N��m֠F�������A�L�7�g��쮐�
����.���L�������w�@��_���!{{Y0e
�a��SB=)�Y�'�A�������&�a_
�e�&4E���MkI˪�W
fd#�JY",�zW
�����*Q�
�(��n �Tj�T��Mm&m��
S��G�:L��n�`J��h�0����{MS��&L� !'�|m0i-�`�]��)��M 
MAʑd�!�ų`�W
�ɣ��*�	g"��|� [...]
g�HD�	��I6!�-b1�q�?��RE�����u�s��yC �I�GV�gۗcB����U��M
c^�Pyx�3�'��H+iA���L���[j����L�����������Ě�T�嵅l�!uCv5��$|��PW�BA;�cdV�P �e�ѻ~MHFU��JD��f�^�Rڌu
��7��\݌�GK�s(󸁽���
q��*�T�$���<�EWʔë=�R��2�%c�X{�;S9Q����e*g�*'Ny�`"��nt�d��gHK\c�+mx�
b���l�!%�?�r���4j�qf�yx���vTR�;��w��ƒ.��f������x�4�Yf��at�
��A�l��%�{��nt?��x
1$��nQ
�]j�V�t>v�X��g� Cx�e`).�
fb;Km�eY��Z�
�a
�7�;D�9�t
+ph�/|H�N���:�,�Ͻn�� ��h�C����G
��{�lee
+&9�� ;��J
s�zу]�
�,TM-����E{}�
(�ui�b
V��VuMc^@nM	��*�+��OՊ2�T��z	�pޜ�2ð�<pi0�}D&Wm������[wc���	;��< �0���
I�)zl&"�xU����8^#�SE���w&�7(��9�
+�E,�=a�
�3'*�(Q���z(
m�7�1ǃ׬��f c-��E�.���f����G"�i
h1�-`z��.y>]M��_
�_4%5��^�
%�p,����-�\��ݱ��O��Йćee
����ŧn+^�{8�i���(�牵Bn�i5}u�]R�W�4br'EY��%�/3V13�"4�ˌA�����

��
� -�`k<u�NѸ�
L�����9�T�Վ�h{JMػ�DA��>5���Se��k�g��:���,��7S��98iI�^ё�uW�|�����^/&sG�wz�����L.����0]:S0>ݿ.8��T.9SQz�U��z5
1
�>�3����C
���,1.��/�*$�i
�xi
z&�a��ї�NV����٘~4N�hUJ
N�P���zL��_
z�;
�
��=LX2d~ӹ�v��mW�K�q�$
��_t�����"�
+?
	?
!��B8Z�v����=�vy
�L8�4D3���͞8P�A����b8@�N�_�O.�x�A�_f�S
4�B �,NG&ۢ��Ɩ�N;��fХ� �Գ�� �1�A
��;���EE�4��,R ���Xɇ��lv���P����+�־xp�%�T��c��g���L+Kw�/,��Z�r/�	��Y��
YA�Y�
���3
�nzJ{/�2y��	s���]VY�U��f���'�A�B�A^:A�B��I&oh��^���(�Ӹ{��V��%ҟ.�C�����q�ͷ)�Q��ɮk�Q�;�ݽe���� l��=�{[� m=��S׍�cʴ�iw��=]h����<V/��#,�����#� ��7��I
�u��
E`ߟ~�
5����w+E��Jsr�X\l��G��U
LF�
�B����\��+S�'q�������������
�
+<3ƥ.9��1���U�
��W0�a�����8K �Zk�A����dS��ͤ[h��|����<�� �]0�
+endstream
+endobj
+800 0 obj <<
+/Type /Page
+/Contents 801 0 R
+/Resources 799 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 741 0 R
+/Annots [ 798 0 R ]
+>> endobj
+798 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+804 0 obj <<
+/D [800 0 R /XYZ 90 67.689 null]
+>> endobj
+799 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F8 802 0 R /F24 537 0 R /F11 621 0 R /F7 803 0 R /F94 771 0 R /F75 562 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+808 0 obj <<
+/Length 2448      
+/Filter /FlateDecode
+>>
+stream
+x��ZI���ϯ�-�*�C6{un�WV罙w�S*�EI���^,O~} .���
{.�\��
+�$� E�]�������ǀ/"���x�-"�܈x>Զ��K��χ��	�|�������?�c��7ot���=��8�y�']l���%<
+G5([��o�����
5�P�xXď�+b�#�i	�D
�oW�R�|+sY���nW�B��dS%����u\%%v3���Ж�ݏ>
p�
�A
4���
]��ǯ��U%�&}�պ-ˢjj]k���.
32u-MO����@P��}S�
��`>qyRp�|OK��q���+V]��An+1���v�A�� k#��La2�,���_�J%
��"��B���v����$�qN�}�l��Տ
�T�J�I��`D��j�e��꿰��:z(�twB׵r@�.e�|�ԉu]��Pfݐ��'E.
�Zf�h8Ύ��+�+*��o��|��b��E��á��8.
7���3Z��9���Ģ?�
��ܮ<�/�uK\�M%�xs�]�ZOi%�֐,�bS�|��?��y�HL?�6�֌}8��ܰgۙ[=Z��:�cs��*�HkcCj/T)ɑ`�;�VF}⻑E�=Z*H��L�;�񻱝A%*'�V�	M at h�xH"��p{,!��w
m]/r����yhu��C\�����v�NY�� KS��:�2Dh��ֱ�_Y;�x%����ׯA��
���6����-�U�m
+X���(��\�h{Q�|���6��Fɴb�,�K�[F��7"
��'29
�(���l������C��I�V���z��	
�"�~�G�(�ģ|@�����A@=�hS�)�I,��q
���
�	�}�m6 �|M��� hq�1��M��ۋ��]�8
+
; qV$y���{Y�b^��
+|PT��4�6z����)_����
+�I��E������J�܊�$p�/PӦhD��dVT�����$�t�< n�]��n��g����X�b !b��i����f����	��E�6���#;��J����w�\X 
iJ|���p�.

��ԅ^����߃03��|BT)�]XE����Z%�
+�4��FA�*�%�w���5�@!UĐl�$9����

+
3<��	,	�U<~Y� ��]Q�Rw���r�b��[p����x�f�5���ʏmR����B��q��
�EelXȋ|u*�BL��&�p^�ԕ'\wN�Q�8X4��nR�"�Rqe#%��cS��q3�� ����{z��Y���,����?a�A���}��z���D����"�3C>�y�ef�l�V���W\Z�
�\"�g��as�K� ����'�d]�\>�fs��]�6��.
�x��x?�yg�|��N���&;̧"O+1�-`q��XG��
%r&r����G�1�3�&�ސ�'�<F�׉�	
b)JCU�> N[DqlՄ�5o�D*ݨ�6�6:6f�R`Ku:�u0�[R�E�թO2�f���n�J�&5`�	T�%�?�"��hb���B{�c0@/�!�o���!C�qP��7f�N@�Gᙚ�륀 ̒ٵy�{o�*��8�S
 �+�Q��(�4V�{�`��_�j
��������̏uB����]Ud]Yfٙ'�����v�l�<�`�M'G����O#q���]���]�r���k`��/B�
�k���=ƅ�T�=�:$��3��PK�c�`�:c�� ���\� Z�xΎ)m���6`�k����E<"���&~�(�e���"D��xq4�l0�X42���`�ٺ>��;�`>1`�`/گ�3.@荽���1�X]�]��뱍Ghׯ
�V���N�ϑ�ȴ8�
�L|N2H���9AnȉN�$K��6O
�q�=�W
�+��lu9�!�̄	 [...]
+NFN�bh�FO��	�DD5���|�N쭧�`䓀��&�9i!j]/���D6���ҹ�x�W�F�	UX�5�H�ٔ�sW
+Z�]ϔ�y
qY0�

XX�鹐;:S���Eċ�K`�Pg/�3�����,`�p��,ˍN��WW�Bk�Jv7x�P��-�}f��J��6Ln8�6
�5��
Dݓɮ9<;�a6�s�?H�N��•��g
%~<���i��T/��TϏTF<I��_�T��
+sl
�3�8�w
I����DL*���Ķc����1� OJu������!��V[B��7���T��\��lS�������d�G�vo.P[��]�4xj)!��.��30:ޗ1�Nl�; �|�-]4x�+��7�����ߠ�:�
�p�S�o
+ ֓[�UOP�x�3��y�: �"�2=�ۊ�ղ�����^�7���F
M�>Jv��
"$�ۂ{)�vi���D�E;��L%n�1MS���۴{P�=�����D��x
���щ�������/it@�
+endstream
+endobj
+807 0 obj <<
+/Type /Page
+/Contents 808 0 R
+/Resources 806 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 741 0 R
+/Annots [ 805 0 R ]
+>> endobj
+805 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+809 0 obj <<
+/D [807 0 R /XYZ 90 721.073 null]
+>> endobj
+810 0 obj <<
+/D [807 0 R /XYZ 292.568 600.052 null]
+>> endobj
+811 0 obj <<
+/D [807 0 R /XYZ 90 583.872 null]
+>> endobj
+812 0 obj <<
+/D [807 0 R /XYZ 90 557.291 null]
+>> endobj
+813 0 obj <<
+/D [807 0 R /XYZ 90 538.521 null]
+>> endobj
+806 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+817 0 obj <<
+/Length 2748      
+/Filter /FlateDecode
+>>
+stream
+x���r۶��_��#�D0 �s��8�q�&��<t���� �S�TI*��ן],@��,�I�C��������A|r7ᓷg?.���D�$aI(��b5I�$��0ZN>O���Ok5�ˀON�zof2�����3OU3�{"��i0�}�������3�� ���I�9��;�,a�݄3/�'�h3�m1�>����#r��!w�*d̼ �D)�_����2 /p���c����&��J�_x��_���.�`�'�1��$�C���f{�<
+Y$��\x,���6�m-�5.���vך�rI�j�v��V�i�We��O�ϼH�V	�IB[y#��� �
+V��.k�%��jEmJM�6i����^�@��*MdE���ڜ��ʙ�{3	|�
�l6��j�؍�r���&0?�F�����%���խ��}���J⻒���	#���>�g^4]�t��g>��W�ќ&L��怘��wug��t��2/�k�N[�S�1�bPfg�g0�<�6�;N�G,�����]Z��Q�V�z��շ'Ӣ0_���y[�e�Ф�����vu�h�9��#���ۙ�STI
l���o�=�l�Z�.���F=�d��pC��>�P%=�ZW(ǯ�R�*� �f[h���{
LبVk
��vmz�<[�:"�l�E�Y��D��0������|pt#8���VY�F"�ӥ��`5�r���7��;��uw��l�hz�'�]Cj4\=b|���s���#o�[��:�A*P��:�C���1|���̮��ѹa�;7���ъmU��j��hV� M�C��5� ͳT��
}�
m@^t���	0��vu�IC${)5�]Mv`�i�40`
{� [...]
��@�AZ��(H��M���E��p���J�1qa
��'2'G�	���It4aƑ��������\� ��VAk� |Oi�� �������ʍ��a��Ti}x]�oZePW�s�n�c�0��;U�E�"1���>FJ>�@	��ۘ�d�q��
��
��W�*	�g
+ Spֱds�mA�
+�h��Vu{H��F
+: ��s�& h�`�3��o/^�@be��R� �eՎ��
{a�����$�E�|lwR�Lm��p�i�@7,�/�(a��𣹒�@`�Ҭ��V��J�#R
hn4�X�U,1�Y,�{E�k.�7�&Gb�$`�/�Ǜ��m� \�P$��
�k���-����z��u 0
+��������X�
��'O�b�0�����#���Őa�0����x�
X�&A��j�*
��
���ԑU��9�w!4�(z`�B�
���#
K(�V/��Cq�?�
�s;\�+����E���e�e�X�
�%:�I�d��}
+���X*���b��\ǣ�u�0͓�f+R���n��tizl�8)GN[��@L���0U�vW�HM�ˀ�f�+�2pA��&Z0��H�
�j�un�8�t�t,}��o���r�Ț�A�B��� j�������
��=X�,���
�*��@~�|��ls�p�`���_����ST��G�Uz�u�#�K�A6��Ȁ��0<�I��o�w�.��Ԋ�;K
���v?�@��7��� ������چVs����Kj�OYUת��`���K�
�
���tK$�cI'�/�{�
���OP�
�4�x��l4It�IBAݽN�F'ẇ0�@ЎF"
��ҩؘ8�ә
�)5E��[
E��%�;�5�0�X�ҳk�qs�^�㤖��`��m�
��C�;�i�
+�X�(J�V[I���b����%u�T[ƒ�26��B��W&h��ۚ3bmb��G�=��
�	rPj��<�|��%F��p�8X�"�q������j`R�5dI�Ũd��$�_yܼ�`#��
�HbB�ILN�� �M

�
>�Y��]bT�Q�l�|'%�����3�]<���^���lA8��g�O����I
9S�X���w�;uR{�\bx0�[l]��w@�3y�ԍ�ؤ����2�`͒z}'@�4����Ǯ2c
+��ųtX>�*��3%��n��b�1G��
+�N���Rw1�&/�����
�����?-��G��d�	�|)+���,p��ARu���fd0sM��<�.`Qi�5��46�o���]}�� t,��E����f��o���J�����h##��odk
q�x�
#�+��iR`����di3�|��G��_�B
ׂ���W�B�0m뎰/NX��	39`ނ�,�rJo%f�b��f~�`�i�YF͚�¦�v�<ˎ3���%E�B:UQZ㬖�������-��77��А�:�C���Ō��!�Z�<�� :�V�����ë��.^_|g.�Nx�?,>]��x}}e�Pp�Vν��3zy�^\]�Z��
��x}u�����.�u�	#�p�qqy��# ?���y\>YYJ�;����?��
Ax,��1�����FT��4�g��yw,X4�*�z�#^��m��G��Z��jN�TiQ�P'q@�-�2`��B_���.
��b�i��`QC�E������O?WP�	�`���Y
�*�'0>��)H_����
{�p���x���?�	%��;�G<�G;1�v�~_�G, x[զ}��=u>5���,����Q����'
+�릫�
+& <�).���I������O�
+�㈈�!غm�/��oww�*�XVmF~dHK�x_��^���!/1
�z��O�,/|]��0�O����z�9}��.4�orQ���J�����
+endstream
+endobj
+816 0 obj <<
+/Type /Page
+/Contents 817 0 R
+/Resources 815 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 823 0 R
+/Annots [ 814 0 R ]
+>> endobj
+814 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+818 0 obj <<
+/D [816 0 R /XYZ 89 770.89 null]
+>> endobj
+819 0 obj <<
+/D [816 0 R /XYZ 90 691.846 null]
+>> endobj
+820 0 obj <<
+/D [816 0 R /XYZ 90 589.061 null]
+>> endobj
+821 0 obj <<
+/D [816 0 R /XYZ 90 546.051 null]
+>> endobj
+822 0 obj <<
+/D [816 0 R /XYZ 90 69.588 null]
+>> endobj
+815 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+827 0 obj <<
+/Length 3373      
+/Filter /FlateDecode
+>>
+stream
+x��ɲ����B��U�0�u
�-e�O����vMQ%�,�.~~�����8�]N��'�F��{C
W�U����'wϿH�*Wyb���~���4�U��l��!H�z�je�L�<�=����|���>�{s�a)\i�
�4[m�w?��v �j*�g�GB:�"c������_w�p*���\��Vy
�L�f�2�k
�a���h�u
����d��.�6�&
+~��E_55q��z�EN�
��&R�͘�ñ�y�B*E{.dڜ��宕��զ-ڧ�$���a웖��c�	�mѕ
�e+Т��O����<m�n8�nc]72�8b��2��N�U���݉��]�m�c�B���X�|7�p�S���~mC��s�wp��
/$7�D4�6�J����@�)�����#�T�W�#e���f�;�8���,u���<��T��JW�����<��g�#T��\uG� ӈT�����aR9��q�4bMM��si��ڜ�x��m�Z�p)ۮ��n<Tt�ri���<��e�D\6LT�N^�f
���h��U
+���J�\mI�J��z�4���]_���)�����Ab�ƨĘ�
���<^6�ܜf�4z z��k
�:
Fd�tiT�/�N�wU[�Xa
b�4�#�0PԵ`�&�U�x���zb����P��i��
��8�ԚEa8
+�(J��ٙ}D����x�F9yG3�7��@
tp�������� ����^��v
ŻM�E�-F
$����f�F�x���
� ��9V��������K��tf?��f �	Fq:4-ĩs'�Z<>ޮr\�
�/��q��<	���m�<��f�;4���G�`w;�κ�	�c�\��@�GkU
��$A� J�v1�f�Kт�'0�(
h��
������ld+��.U��N�(�|�{�t�x��tK�<���v$Qˮ��U`]���
��4����hڒC-�v�
ﱇ�VoI�f9V"Y��=��@k>��;Gտt��YpΠ%�+6��~z"��8�(
gW��ߞ�ty�+x*2���$�
+ֈ��Ȅ�kL��myE:�dG`�O����<6�s0��C�fk�4,�c��
'��T�nX��[�
o%���S A	�s���"��7�l�Ņ�1�d�0f�,
���_�,�]���NR���� ���#t��V�4
�g
\ m���n�6�r�A���>`�(��x@��u at t�[�8�� 
`.����
��

�m)`���Q�}��
94�).\g��ue
��Xi�
+c+��B!Laj�/뾄a�,5��^
���8~[yLk�xE��q�
��S\�҈|�P�
�0洄��l_#zj����@�b�V��i;v%*���;�rk��J�!����nEw��*��b
&.�����NP9�o����
+�)�Z�o�����3V���5����S��ս5W����T%�
�G�t��D����;
q�V#%/̔�o���3��8�
_%�x- at k�����妧iwU]pm��IԦ)�;��� �V
�\`n��+�G
+I�A�5q��Y숲
A�aR]���� |.�x�Y�[���N�*C7�Ȧ"��
�
�_�t��a���PU��7
�NKX��xZ~���#6U�=wc"t���j
4*��xڽ��N��]�\^w`I�Aw���v8�[���닷��~&�V�W�hm*����Y_
�T�j�*�M-��E�.K�,

E��`�C���J!5��g|5arv3�XB/���"A��|`txӯ�2�!X�4C��t��,��h�
+\Ŕ�M��>u�
("�� `W��(�"\r���BGO��WG/t�p�alLmr
p�'���
+�A�S���V�M�P�b��

+SJ��

U�	
+�!
چ\�ƾ�����UZk���YA���(��gģ��9��džJn{(�҅"�|�����_K�Gy�'��a ���%S��3������%�'ޜ����@�6�L2{>�U_��U`�e(�~��n&I
�tP��0��6�m!N��:�&��5�A��:�kx���̃}���
+
թ������d
��2Ŏ�p6d�� NE
J>Py� +�r
�3
6U����c[9 ���:��5���?%:�A��R����ѵ��
G��Gz��X��
+�e�&�aEo�)�f�R��1�QE
6�w��"͡v҃ �{vs���
�³����TiSnЯȚ(��X�y��J�<�+_��/�,|�&�^�*��ۂ�ċwyE
9=s���r�ˋ$
}c�E-
��/�ԟ�L��Qz\X��B���f�֘ �|��B���O�j
Ꭵ�����;:9�EJ
�ҧv��0�<�Ӈɥ
$*�g�hdq��7JjhkI�6�ʘhn"�4!���o�.t�.����]��u�F���R헞
+s���尡
ՐƳ��ˮQ�1w�����K�˱Qq��<kQ�ɃG4M�I�[9.M����ド�KpB����C��
�KR�A��O
�j�L��&���f2%�X��3��&��
/�"2���lA�%�:7]�
�J㺂8���v�boR��9S��Rt�7�

���3*�"��'E��8��
��a�g��{f7�4 A;�G/(�2�ߡ(I�h�o9NTiD�R'����Zz���}���G�QB�1�,����=
o����"����q� 1�	�f��HA���x�ޡJF	�=�x���}̼X0~0�D�90Ha��T�׿z��x>>T��O��3����y��������~�;trw�����&�|�#eh�%�*?2 �I�{kt	���i�⼡�q>Z0j�(k}
��K�S����	�_#O�����ۄ	��b�t�6��M�� ��"L�<�~t��Z'�N[̒��Q�+����
fL�ZP�~g���5[R�t4��Ǫ+ջ���ZE�� Uq$ [...]
���R�k[��?cy-
i��p��rGJ�nu������~�ěe_��É����O��p�:�R0�'țg�'���=�گ�ڱp��ӏ{Tʟ��^pHh�|J��I��_�,<|.�1���55���c|*�/�<=7�&�
e[5C��"���5S<�<9��e@�M�iuqz�=���G�;�Av�
����R
�
?
_	�]^�Q'�����&#�>_{sBӟ���cZt{��˳]}� ����G��U�O�D�I��ܸC'hPh�;
�I�?0q�Ϣ
��1���t�V�J_�2�/F聤,E\��Ϟ���{���4TQ�S̱�//�?�
���
+
�6
���2��ݻ�����G �k��V�昑�
+endstream
+endobj
+826 0 obj <<
+/Type /Page
+/Contents 827 0 R
+/Resources 825 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 823 0 R
+/Annots [ 824 0 R ]
+>> endobj
+824 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+828 0 obj <<
+/D [826 0 R /XYZ 89 770.89 null]
+>> endobj
+10 0 obj <<
+/D [826 0 R /XYZ 90 721.073 null]
+>> endobj
+829 0 obj <<
+/D [826 0 R /XYZ 327.954 555.065 null]
+>> endobj
+14 0 obj <<
+/D [826 0 R /XYZ 90 537.395 null]
+>> endobj
+830 0 obj <<
+/D [826 0 R /XYZ 376.313 483.442 null]
+>> endobj
+831 0 obj <<
+/D [826 0 R /XYZ 90 465.771 null]
+>> endobj
+832 0 obj <<
+/D [826 0 R /XYZ 234.018 354.034 null]
+>> endobj
+833 0 obj <<
+/D [826 0 R /XYZ 90 336.363 null]
+>> endobj
+825 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F32 772 0 R /F10 773 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F7 803 0 R /F24 537 0 R /F1 834 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+845 0 obj <<
+/Length 3775      
+/Filter /FlateDecode
+>>
+stream
+xڕZI����ϯ�-�*
�n���NbGqb�
�TI��!a� �E����m�hp0rr!������
7�M����77/�ϢM�N7o
6E���"HR��6�*�o�T�ۿt�m
n?ߪpk����$ܾ���k
����ۻH*�f�����oon>�(�%�(^5	�|�?ݼ�n*h��&
�"�\h�i�����旛�?`zT*�0�dJJ�!��2��P���s%۝9�x��u�����
�J�G�
t�gi��y�}��M���ƣ���05� �J0�d�z/�gӗcݵC ������
�0/�R"I�
X�
��]��#
)��
E�'���-���M�_c�ݦ
�^F��r��0������0����#
^�w���C̽[#��-�
{�T&��-�p>�ݗ�T��
+HU���T�N���ļ�ӹ�3���j�BK�,��zh�x$�g!3>-�H6�@3a�`����ڔ�a*F�_D{p��[�Ϣ[M@�����^b'|�
�+��Q�}�Yf?��`�Ƞ�f	��
Z�:[��r��Ge
+fO���-
�'N�u[�{�9~gV7୔KP"Yjp��|�A�4J���#����YD �!;�ٚ���F�UM2��^ѧ�t�;
� T#�9ˮd��T�T
|�vjU��@���tQ�%��-ʭn��η?�!�
�S98����,-�s��%і��Z24��QQD�%�g5(n���M=0]p-���"ݡ/O�*b�~:��%��b�M��ƺ�n����[p_�`k���b�.�8
�4�S�B�,��H)�Gn�̰��
;
�
+12�	��p�yG����f�����d�����T����t�T�0t��h���\��XU}��~ϟ!:Z/��cj/=�K�9���s�L���Ѕ,��Y�C���3�q��^ .5��Π-r�,�.�8/슿��Y��� �7إ���~�qᖺ�
?p��nW��Ob
�Ck�/z�zA�ll� Á��t
*΅�2:��J
+�r�➦ܙ�����
�)~F-w_�7�8�}Y!8	�‘���!V?���Q���� �y�^OS��@P3��Ė��;~k����C7�Y�p���k%��.? n�Y����fB�����Y�c0�
+a	`>�=�<@�
Š��>Ԛ�Dz�͂p����j�*
�0������Y���x���F�P�L#2P9�/e7�{��e��߂�/�q��,l���P�<,_R�7w�
��a�E�8L� U�&�_��I�
�Q�RX�Xح�[�p& id��+���<s����u�E͢N�S�A�)P��#?�A$�g���AJ���Z�b�q`j��zex�ٕΪ�q���Z5�
����`��1��bgQ�ZWv�P8H~A����7���>.�[F`8�@(��'`��#��o ����w?���i���ʛW�h+�
$"���i�iD�b��!�Gޅ6���r
�hL�(,�C���û�p��cA~}t
� [��v�
<T�$�y��7�3������q� �w��tO��
�bT sE��<!��{���
"��񶷘
?8{����$	y���}��
�3�E0^���9I_m�/�D�qg��y1M�o.�CE�CP�Z�:����t�h.�Mp�+GI"���B܇xL�.l:
o
�y7
�ׇ�xw�#kԘ���ul[-��
|v [�1
���ޞ6H���I6�rw�+w*�h5��= �
V����(���rh���ÆluE2� b?0�����n�
�
e�8�� 
�o'6-�ӓ��������&�M
�9
R�'�	�C��B<�c+Ux�0�'�6�dr�q4���#��CA�{
�����"7��W�t�c
�@�C�x��6wg�/�?�s�8�l2
eR�����FL��CӾ빞R1�qx�]3 ϒE:ģ
�F�(�F���@�e:88A:G�sg[�S�qE�Uw,��`1�"�ܘ�D]�����wY��Fr����(h��ԣ
+*c�)����\�T�0ߗ�t��R!�	2���
+-��w�^����w먼�����}wځ�H��.����9�
������
T�����(�� ���2��a��/��P�p�¹�`dƞ�v����T�;�����.`x
Bi���6ׄW/�\a"���#��U;�$��Njm."�H���H^Oگ����`���m�W�p�-�R��8ȖO�u�o�me��j1�b��s.4���8���/�IT��h�-�
����b�G/��f�P��/�����(
���/d{�+G��� ���f��lȚh
>�'�
�D��m֥��]�m��|���Z��"� �����
 L���9�M��1�:�5RH� ����5�X5с��0�}ů6��%^���WE����t$��B���]MH�8c ��T3A/�ɩ��_
�6
c�
��̞��/t~�i������z�V1I�
���B�	e3*8���3�A�B�?#��8����pu�����ȝF6U�^�H�G�ZJ?�z�=qZ�i��@mIaAD��/|����^�'<�&�����Uˇ�+7|侢��,�?;�l�G�}�}���{��3f�aRWPE�b�M~R�=����"=G{P=Lb@�_@^�5�5����Q��#@����.6�G���3S��D
q�
z��0��.02�N��ʍ˳s�x�
��b�Vl�+�
���*Y�G�u�wS	)c�R�{��֥ˮ����ψy�(����w]��Y%V2��	��(�J]�PI�]�1[�����n*~'���/�&.�Ƅ
��zq*Js;��기�".�[�X�n1�r��v P4��Çq�ľyY
�7�%�Ǘ
+�����
К���|!x���i�/n‖%ޒ뵟��Aj�I�l�	��=��恉w�9(�#�b.�L��(h�lAγ]c+U<n�D��1�9���<{��L"`�gx:��nʷ
�<�
+ŷ�,���>?M���z�KS�zL~X�2�7�l������_��t��2=��=s�e-N��
�� ^CQ���E{�zF\~�(�-=	����B�nx��7���J��\�v˹j�^V�#Obw1p��V
D �FkJ������!i�(�w���ߐ�sW�;f�z1b6Kh#ֈ[�:#Mۍր ���4�5�6��5��n��v�KoN>>]�V�0��P���
W՜�1D�̞�����cs� � '������0��3��z��t���r%�>��e+�Yol�Ǒ���אo6�1YG�RG�'(]9%����+���r�	�o�r�Km��Y݇��+����9�/
z���*	[+)q�+
�^a��СK���R�����%�
��Auvm�s�M
��GY�B�=�
��S._�R�VV
+;��`5�b�SC;y���睵Tm�"��x�H #?új��K����ȿ���>	�\.
^�6v��\��B�q�!�D�E�(�ag�?(*Oq�D�c���k���Y�.h0��	��6
+�f,��a����q׮�Ƭ�a¯�v\5�-M*ŵ���FQY����_9����
+Z���]������=Ի'��/�`����"��g��6_������(ֺ)��������n�2
���s��o�AG�X��gAR��9����m8���U��u_\V�KzШ�0g�M���ɍ�qc�~�����8*
�`�m�q
�߼|�����
�੽y�t_�;�k��)i`�5hy��*HSm�
�"U�i�S��(
/_���_;`�/W��/r
�
+endstream
+endobj
+844 0 obj <<
+/Type /Page
+/Contents 845 0 R
+/Resources 843 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 823 0 R
+/Annots [ 836 0 R 837 0 R 838 0 R 839 0 R 840 0 R 841 0 R 842 0 R ]
+>> endobj
+836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.728 573.012 314.05 583.916]
+/A << /S /GoTo /D (index_SK07) >>
+>> endobj
+837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.144 203.018 490.683 213.922]
+/A << /S /GoTo /D (index_Dropping_Non_Integer_Points) >>
+>> endobj
+838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.353 96.717 378.495 107.063]
+/A << /S /GoTo /D (index_BRZH02b) >>
+>> endobj
+839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.484 96.717 415.576 107.063]
+/A << /S /GoTo /D (index_Fuk98) >>
+>> endobj
+840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.565 96.717 453.752 107.063]
+/A << /S /GoTo /D (index_NW88) >>
+>> endobj
+841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [473.618 96.717 506.753 107.063]
+/A << /S /GoTo /D (index_Wil93) >>
+>> endobj
+842 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+846 0 obj <<
+/D [844 0 R /XYZ 89 770.89 null]
+>> endobj
+847 0 obj <<
+/D [844 0 R /XYZ 90 625.695 null]
+>> endobj
+848 0 obj <<
+/D [844 0 R /XYZ 90 625.695 null]
+>> endobj
+774 0 obj <<
+/D [844 0 R /XYZ 258.486 176.592 null]
+>> endobj
+18 0 obj <<
+/D [844 0 R /XYZ 90 154.208 null]
+>> endobj
+849 0 obj <<
+/D [844 0 R /XYZ 508.248 99.312 null]
+>> endobj
+850 0 obj <<
+/D [844 0 R /XYZ 90 77.486 null]
+>> endobj
+843 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F75 562 0 R /F11 621 0 R /F24 537 0 R /F32 772 0 R /F1 834 0 R /F8 802 0 R /F7 803 0 R /F10 773 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+860 0 obj <<
+/Length 4295      
+/Filter /FlateDecode
+>>
+stream
+x��\[s��u~�_�7��aO�/��6ol�;�x�8U�~�DHB��9Z����
��"5�+~Pl4�r��9} ����Ͱ���lo���Wo�}��� #��]��
�)n���k5�a����I����k��??^����g���������#<#�u����l���7<[A�aZf���u��8ep]�>���78[�[�!����3�Y,	�x��
���;�-��oKJ���j�kn����ڕ��|S�����/�y�:��{��H�w�I�̍gK�����ׅ��`�竺���^ͯ� �c4yW $����A�L"���=PT��D�N��-A!n�l�����a��L�#�y��4�@���|�j6u�7][��~�X�xZ�=���&l�k��N�n~Ę�������]
�j��z�hBa���	Q&�M��r��yݮ��z�gxh��ٚ`�{�t�[9i]2B�2�%��nݶ[ww�
)�h�d�̯��p��{{��n�Z���I۵˶�Ĺ[�y�o�B<�|O����6�����7��q|D��G6
+��݄����SI�,�6����_N]��$�3$�@����<�!�PC
+#/n}?����*�å��b�߀�J5o/�_T���7���0��

DV��N
:G
+�d+�+P4���(���
ij2�5�y$�$e��� He�*$A;2�.
�q��nu�12��6ۮ�۽�I���f�B��G,�M�>lZ�#�ab�NS1&B"m̄�P-b��%��MT2a��ԓ�-
�&%�W�#�[���\����2T
�e�n�(U��O����h�����UA���
D#u�`���!/�NYW�NH>�J+W�UZy���&�prJL
H6�A�
Z6�(�E?LF��N�zW�)FO|
`�u�
+[M�B�G�潗]9 �ysהffifR�����ZP<�Ҵw~ �R%�����C
�;�{�묟�|���tF�5ܳ��gR����S
s���׀!e
@��j��k�9p�a�M��w�]�=��Q�����L�Z�ݏL
�7r#W
���p'�r�A/�Sj�fr`�1{k��a]��ۆ��ۭ@\֏���;ٱ�A�l��{����f��M�^�`��ʵ�(2!��z�l��Me}k�;�x�Uz�z
+�L��X�0}D��.
t
+
0T
�z�Y
�v�}���~��qq�m�bb�b�xSN��	�c}5O9zUt�D��(Ȗ`H	��
Z�G�
>��Jᰒ�&�݂���47}6X�h'Z����p�7�.�V�
B����!��=�qv�d�3v�I�w_ڞ���L!
�5�`�	tKv��
+���8�Zp�c��R��!&)P	h�O
+����3��G
ҝt{(����
+�!�1Dg\�c*9��X��n�LA����?�A/D�Qb2���Q�ǰ�C�Bp
@%�E��f��5K:=�5T��C�/ݒr�0�L��"�Z� �YY��4P��s�U�{&O�v���€V���F�]7ò����	,�¯o��e[o��ì�7�O
���C�S�+��
+:�6%׏!T:6�䔽W&^
�j��:��\�� �`��_�4����LgsI���~]���}Ͷ�Sb��
�%2x[6���G)l�����}����_���-�%@�ų�"��E��L��K
����9 p�.�`��+Z���L
�Υ����y����0�/�,͘��!��ͭ
3j�����"�u�
%�_�o�.%��|}���ςZ0~&ڕ�::г*�� �g@�O<'D��w��;��8D�H
���(RX?{�Og聤��ELM�
OANQs�yl��Of�#k6�S�#�Ԩ�a�o�l�A6( �uc
�7�ݺ�q<ZX��
�$F�T�)t��9�<��f{L2ۉ��#N
�'y�ߖ�M��irGŀs@� �,�ݴu�fo���h�i�%Kz"��ZU���Gj��?��td2G⏣,��Q�2�Ah�G?�+u�>3g��;�l� a����r���R`��=2��GR�
��� �hJCy��<����4a���'F��Fo���iAYf5�T�1V��\e}`�L�ab�Q> [...]
��@��1Y �#���Ha2���,�f���+���J�K��vD�肌���6&$L�0a!a�-x{`_ۊ�_B5�m�0Z
��ծ� E"�cH
��
�f@5���";r*��
=�
�E˘��h�Yf���� ��m
��v�C��0xY{$�ؒ�bGBh�H�YK�"R#1�{cS�
{�2����o/
\*$F���M��e�}������Zr�a?]w�A�
�'렕�Lq�uN�
�ǀ"�� ���UG����}��(�?�La�	��8�j�\�A��ǚYGK��`���9�Î"�b�8`��(��~y�l���d�$58�m&%�:����q��"�	G��Y��G,�X����g��.0wK^�*�S_c+B���5�p�5�V9M	�[�Nν3�a�<�9(+D�F���QT�+��Y�A678or�N���H�%�O'&�bl'�D
+s\N�"��*��L�rY �
+~��&
��[=��)#�G�5&Uȱ�����\�S��yv|E��,��$��If��gLO��3��zxDNf��u�2�1��-3
y
��(D夬mj�
��ڈ�h�01���)���&�s
���ij_ʍ���_+e�q"�+�
+&TN
2At�sm)F25�L�A6��΅��5%���4c���\�Șz
�<Q�z��N���g�9@
�ge�P˯3�ߖ�
a�j�զ�j�0�����On2��U����F'�rڲPI#mY�������U���Y$
��1�a'�j�,�d
c�̨����q����$�5Kk7^�s�\��X��A����	l����۝��
Ȓ�G�ej�ol�v����6Y�a0�򛻻�q��7��:|WW�Z�1t|�/�J�Գ�%7
��Y���v���`��3�3u��
+��9�zyA	8���Yv��o�T��bco����C8�#9���i�R��Dd��.�l��i
AZ�����v�ޞx��z��ߖ���I�
Jz�V�C�2O
���B��A�ɡ]����d�	�TD�NK*�h��9�
(����7�yZ
^�)y$w�Q�+
ɐ�y:uĘY�.�#"�s�>���X������qe@���pۭ��SL�[�����Cx��X�`�*q��
��Z����?��}W����3�� �_ @ê�T��.��2�rkШ���}S;�k3�_�t\��_Zp	�V�ѳ[���
�����%Fl����EC��e���Z���h��]_�ք:�'85{+�uv�/���D� VE�7}��w��l�/2�
v�a���8оs¥(����%@j�F�,I��yR�{z0L��
�l�F����{�{h����_�ǩ|�ͺ�|[_o��űXB�Dh
:]������{ZP��<϶z�����-�@:�lCҾ�zi���݅�����m�+�] A��q��=��@����
�~ݸ�����}M�
d��ӡf]�!�e�������ucS� 
+|U��N
+�d���
�����em�]
����P�a����Qv�ډa��׈���q;���<s�\�o��Ap����GAR��
\��9�q���g��(E����=�wذٿu0�8��[���� װqɽ'�eh�4�&?}����K_�~�"��_���:x��Aȥ��D��Ac��~���X�tM
+��������wׇ; �
�?>!_�h��
�1��B�q
4n��@S���+f
+endstream
+endobj
+859 0 obj <<
+/Type /Page
+/Contents 860 0 R
+/Resources 858 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 823 0 R
+/Annots [ 856 0 R 857 0 R ]
+>> endobj
+856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.096 86.288 457.668 97.192]
+/A << /S /GoTo /D (index_Topologies_and_Topological_compatibility) >>
+>> endobj
+857 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+861 0 obj <<
+/D [859 0 R /XYZ 89 770.89 null]
+>> endobj
+865 0 obj <<
+/D [859 0 R /XYZ 506.258 542.516 null]
+>> endobj
+866 0 obj <<
+/D [859 0 R /XYZ 90 525.581 null]
+>> endobj
+867 0 obj <<
+/D [859 0 R /XYZ 155.86 348.917 null]
+>> endobj
+868 0 obj <<
+/D [859 0 R /XYZ 90 332.316 null]
+>> endobj
+858 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F32 772 0 R /F10 773 0 R /F11 621 0 R /F6 862 0 R /F24 537 0 R /F8 802 0 R /F102 863 0 R /F7 803 0 R /F13 835 0 R /F99 864 0 R /F94 771 0 R /F1 834 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+873 0 obj <<
+/Length 3732      
+/Filter /FlateDecode
+>>
+stream
+x��[�s�6�_����,� �Io�ܵ�^/�kҹ���L�L%�����oA�$@�$;m:��L�����Hg�3:���7gO�5b��\s={s5���Ȝ(
]��f����QJ����͜٬l�z[l��n�
�h�\�닦�K�}�3��w�ޫ9�	����rS�-a����/o~8�Ǜ����Ag̿Vcg����_��n�0�D�v�����I.ບ�>���9�4�QC
3�a�s�.��v�*��%ai�n6�����s����/+`lu?�*#�,{��م�lv��e���٭/���fU�w��6~Vq{���������j�GM
/�&���'���@H���ȕ�|lo��|!��
+G�l�Es
�Y�%�rմ�%�%������Ym����٭.��]�/sm��]���e�.��Q��[�#!sc��N{
]/^�9��4ɍ��"�V D���
K%�R��5��W�e?�U}��x�����
���<�DQ��*��pS.����/;�Í*X,��:i��uӽ�
�Mx���l�_e]:c��?�6�:L�	KT�rSm��b��m��
�>��3~J�r�.߁�,�Ȃy
^A�f�#J"�+~��3܂�	.6g,
g�����$�r�����	�
z7AS\F?��Pez��
h�q�:
��a�m�J�z�P�M��Y4�+
���&t��� ��ń�-�7P[�����j�!���X5��\�~�w�+LNDA 
s0��D��H�I�[Pz�6�c����Fm,�v���*�O�LS"%8
+�D
+�(�	��
sF(�n	�y�4��Fy�,i�lͼCHȉ�lh>Nb:^:b�H,�����D�� ��}@U��MoO�
�	2x��pS�?��9Y�Q��`�wӊh���$ޣt�Z�&����O�K�~Ü�f��Z�C@��&gy�il�ɑA���
+��6�Sw��b��W�&��MkԘM�
F��o7�h95v���e��?E$�
��"q��!�
1<
�>��!hՆ,����R� Ȕ"��p
2(�8n���s0
�T�}ذ��B�KI
���R���P!$��KPw�?e�T�y�ܟˢ����_��rY�T݉�=��םn����ëM�f�V���&���<H�>ѻ7½��Q�0��;�h��c���e��{,Zm����A���R\���f�bx�3�bS���Z�Wu�'&���N��",(�E�%(/��#4��á,P0���o�r�p*�����1r����>��T��w�
�a����0�~B'47p��z:Avp�=_�E=.�����?9���ԪN\;^�W���m劌`����F��>E����U�I�hY9���H��*���Q�~{8�@�$J
���#ة
	#�YR��0"# 2��j
�7]����8ו3�w.��� 
<<
+<�D2&, ,�k= \����HMb	��
M�2��]�*�ݭ��KA���jj�ڰ��6���k������o��!N�D��N�`��$A���}v���B��-	Kr�si� qՈ3v��O��	�u'��u�#�Ĕo
+W�{��TJ�Ja.a�%
+3q�
+�0�%T�{��
9mM{���k0�+
�z@�
 �Z�6�|��&�Ga��
=�^��
3�g(,Sk�ÐS��3l�NS �ا=q=
Z1&�%�A�;g��r�1�
Vꈇ�	q��1�
��x
��[����h
’n�5*(uG��"g@�]x���GW�;��eW�,�d�EW�gXb�PQT��بF_H�3,�@�0ӂ�+6U��>}L�n�!b]c�:~�9�Ԁ(3
#��5�#�D���}�O[C
���gz�L!�I��^
J�\&H�j/Xi,�Q�(�c
=
�#�p�`!�-�Y?b���r�i�r*	\�1W�*�$�D,�ୣ ����| m�q,1�Yu:c�Y�	ŒzH�6���@�y���4���
���� �@_P� ��n�\�'sb\"{�,���|Rj�K�;uS/ZWan'e�����[��"X����9R��]_Tuܚ�����ժ}D�c�źWj�A+��$���	xJ���%�Q`����}K�`�Ӧ�Qt�
�kCȀ|�D~�U�Oȯxւu�IPY(Ţ.tZ�	bFp��!P��I�v�"�[W4��DE���yn�
�]�U.]'�#�D����a�H׺�e�e�*6-j,���^S�e]5�겻C��}P^�U��nl�^F���c~Bwu����U��'�%�Y�Bp�V�v�̇}���1z˳�Fo �
�
l�Yn#@�H0..��r��f��\��c�)q�g
�:߯:���{<:�<�
:�[+m/m� [...]
;�
�&;��ژ;�������;C�2
�*]���]x~Tw��M��E���7F]�
�I�Q
���2lA��;	���[��T�M��ن�����!m����t��3����o��Hn�Pl@��B3��4�) �\Յd,��O�^�)r�P励HHiJp��ɠ ��I+m�Y3��xG���ɴ��|�Ke��
w��Wb�^�:����?5��J���Jƃ=�ѕQɔ�� Y��
���Ѹq�/·��pjU�`(�i
��
���G��F�/��v�&��x�����q�

�p�}1.9А�

Ԫ=|�3��]S�*��GX����^
�Y�E7;��_ �����3���X?�.�R�1��j�3�D�VqӨ����E���ʘ�$��9�)��A��#r������Νa��j^V7�?���(���ा��{��Ÿ���
+�|���;
�[#�i����c�~r~��<��_#��Pb
��h?E�2>��?5����my�J���QG��L|y��y�@hU
����VY8s�
* ��}��0�x�ir�
S3�Ӛ+��r�F�<Mko
����P�ӄt�*�
���8F���)��g��;lf:���x���
{��K׺0&{飍��&�B at 0��~T�	gQ��:�
�ޮ�!>�IJ�;i��'!ʏ%!�CqԫqG�;
+j��,�
(TUjzf�ə�xV��x�ȱ�Wh(_��
���3�EpЂ����V}&�Ě:v�W��Uw=gn������ƈB46~��
�}f
7�џ?�B#�
�ۄds(<D��O�J)}q��ϊ+���sXb��־�>�2�p�t�Upm.�r�Så����\a��n��18���c�B\��;�m�,��c�}n��^�~P��?>�
�}���.�C%Q��ɘ��nk�)�ŵ
@�����c�~�&�_W����b�/'��
�.�H~I`�2�>t� I�x��^��෻�7���h��ձteLh���+�^��?C���\�,������ko�vب��x�)m����^���y�������UD3�� ������'�붬�	 ��3#/ ��
���L~���u��iH�����h�{i�@;��2�u �_4�
�?
7�|���7 ����k
+��
+endstream
+endobj
+872 0 obj <<
+/Type /Page
+/Contents 873 0 R
+/Resources 871 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 823 0 R
+/Annots [ 870 0 R ]
+>> endobj
+870 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+874 0 obj <<
+/D [872 0 R /XYZ 89 770.89 null]
+>> endobj
+875 0 obj <<
+/D [872 0 R /XYZ 90 674.303 null]
+>> endobj
+876 0 obj <<
+/D [872 0 R /XYZ 90 669.307 null]
+>> endobj
+877 0 obj <<
+/D [872 0 R /XYZ 282.028 584.385 null]
+>> endobj
+22 0 obj <<
+/D [872 0 R /XYZ 90 566.491 null]
+>> endobj
+878 0 obj <<
+/D [872 0 R /XYZ 325.434 512.494 null]
+>> endobj
+879 0 obj <<
+/D [872 0 R /XYZ 90 494.601 null]
+>> endobj
+881 0 obj <<
+/D [872 0 R /XYZ 481.318 353.504 null]
+>> endobj
+882 0 obj <<
+/D [872 0 R /XYZ 90 335.611 null]
+>> endobj
+883 0 obj <<
+/D [872 0 R /XYZ 480.615 77.486 null]
+>> endobj
+871 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F32 772 0 R /F10 773 0 R /F91 766 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R /F6 862 0 R /F1 834 0 R /F102 863 0 R /F8 802 0 R /F7 803 0 R /F9 880 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+887 0 obj <<
+/Length 4165      
+/Filter /FlateDecode
+>>
+stream
+x��\[s�6~���[�i����N��4�vӬ7��>4}�-��T�\Qn���{p� P )�N��R

��w.4�������?.N^�RlV�BR9���x�x���O��/s�O��iƤF���#���_o/~x{��|w�����'��3�~/�ҳ���/���
�4Èz��Z�8ep]�ޟ��{R0��ܚ�'� =�A�x��@�tA0���SF盺ٵ_�.(��զ��V������S"���T6Kw�n��n�#��+�#
+�lA9b�p��vf�W�G��]��O�
&񜺁�����hG<��PL�a�g
�x�ݨƍJ�R� |
�4�6�oߞ������Zn7
��_�VM��ق1��p8����t�/
\/ݬfVW�Ͷ�B�KN���&�2��H	�
�0��
3�m�$p��[��U�ZUK�_�����3�?�;#��)5<�Fm�sNJ�*z��;�u7�
W��HK7���3��*C�BZ���C�+��
�ˈ��3�$Sҷ�F=�h�;�
+{�Լ�d5T�HN��Q�ѳ��Y�vK�;m;�#J��Ə��z*wЩ�M
{���
7<C�ˆ�IQ*�D�)�0aG�)�(�)ժ[o��Q&�.K�ʒ
�%��_XD����z���fHg��L�����Ħ���"Z�r"Ȟ38K��{���V~
�;0�Y &�pD�CNX"x?���N���p���q�t�k�|��6���R�&c�2FY�(9c�ww>[V�
�S���n��3A$b��ob:$�z`_�H����N����	=Z�Ɯ腈�� �+�X`���Bx�zm�Z��*�Km�<�㓝��Y���s��
z`]oa�豖D�8*4ؼ�S�1їY��Dǘ��!��?�C^e��I�39dy�C�Op�+ �y���h=�������ns|� ��į2�L���,�4I��
+��qn�����7.e���C;��9G"�u��#g�J!�zH�{0��u����o�뛫��nL��s�`
B

Ym�uV&!��O)�d�R �+d���DV�[�j��N)����� r��%��b�Ӭ
�]�U��vU6��ߛp�\+���m�����H�+`&��
�ϊb�
I
��f}Y7�s�T
�
�L���ܺۻ�޺n$�����j�w�ގ�s�J1�n�x��-8�F����|�E�K�_�id�l��sT
+�q��Bp��|f�&#3����O�$f��u�w8�8�����n�
N����e
K'[X8ق�{ق{+[p��
��_��r�i�]}JE'^n�X�̯���_uBd>x!��!�YQ��c|�����U�C��ѢAC(̸	����1�u�w&�3$cr�';��ng /�Q  "S	��}��F�����I&X+'O���"f�W��@C�(���6�tY\_
%�0��Oє�1��9�����Q����|�k�'�>��
�@�6���q�/��>X6p� #רBF�
�
��l5X��j[77���ߨ�d�0<m:��#ק|�����p(���4m����F
�V�LR[��4q;r�H��e�1X&�Q!#�}F�u�T��I��'��U�U������?�W��%r�J���H�]rJ�� "�#S�#IH
��+���-���m�w{ڝ���T��Vaqd���ڜzJ��܇�o�тJRCu���'`X(���+�Io�$@R�f�~
XI,Ӹ
6�e/
�Q
+,a��
�I!�
+
�,�f b������4�/v�w�*3���R���>4�`C���&D�ɝ<hƞ�7߀�Ig�Psn��>Ȏ:E'�D�]���0)�Վ���H.� ����e��E��.��>��j��4`�"^o�ޟ#��cp�ͯ7}�W5��
���ڂ2B���\ɂz0c���p��)
+�]�i~}8
E*���)
��j5 `�i Kor��`\f��]��]�Q�W9M���P��p���
��4Y���R8�H ՌL
(RJҊ'Ŕ���$�T�\0ГӇ���g_��p�$9X/�<\#��M�� Z���R?��oFa7�|l��8bޙ����ii�
��$������n?; N�P�Sh�u��=����2a`.�nY��+ۜR�.���h��O��
+�}e�j3��lP
�ħ�/
�5�tF���湍
�:��i���>�q<���_2���V�4�nϔc�I��8r�廙]��+�X<��b5���qNᨬ��������K2|��2 U@�W>�
Lj��p��F�#6�߸'�~���a6�͔#��1�1�J���*m��r�~�ߖ&g棞��X{+��=�|�V�C=�&����t�t��S��`�������
T�Y�=��C4y�ۧ��~!��H����}{ C!˙��B��}ȴ`������G4��5�d2�2��c����X&�����{�2��ւ������������3�D\��
ur~�OB؏��K��q6��#� �
�3<׀MїǷ��f�
�&�1+Sc��
�0c��E����u%s�5�$'!X�9H�j�D5FbO{ �����v��g�
+m!Y���7��P
Z߷F�	1�wWZkD�oÀ���o�v��E�
X
0w��M7Z���jw�����	�QUu�L.)F<V��M���w���
,�A?�
���Lʣ@�G�$�@R�"Wƭ�U��M�
��Z�Mo���5�Җ���"�HaSR����}�;K�R�PY�$R �"SN�؛(�Űӕ]E���hR�E�T
�m_4x�
�6G� �P7�L�7��HG��^�w�E{0��^�f���'�U�}o�� ���up!d� �B�v�i�6�N���.D��FoV��$�w�r���w�:��h1&�*}�0��
C'�S�sɢ�K>�l6�m(v|�A�G��K�Q�u^ϧň��J?���	��\X痨a{oJ�42x)���1lnN���z�"�m�a�H��<�Z�H�	L��~�q�&� R��3�#V
7G���V q3�����l�Z��rn|�	 �O\���H�TF��%#ϳ�zR"��I�����G0R
�H�c�ͩ��y��ѫ�XE�������&U�ܹ�T���h�|�I���'p���w��du%\��E�z�0�Uf�!i6��w �%��6�
L
+YL��
�
�M��n[Ee䑸TQĂ(
ה8^��_�ЯI
_���n�u��Ӆ�W�\I�1/_��5�#�к�A�@*�ų|#[ e��Z{��-*=Q��
G�J��Y���W!�����V�=���dr�F&�t��U�\�C"��k��.20\�n�*ϲ����v�
�&��{�DN��>*�ɘ;ƵM{��э��Ƕ暼�"E��y|[��Uv0�-Y!�h�I�� ��Y�Dx�1
(CpPئ�ϟѴ�4�e�4�W�4�`\i��TS��r�_Dr��H��� �^i�r�4�$�4 at G�i�)͂i�0穼ږQ��o��.#��ܘā�s��Dy�^�;��tO#�2OG�
�B��a	�L~%zW ��ڤ��Aߚ�a6"x���h�U!D;\4�H�֯h�^�'$�"�O��<?%şN�����Lp�pƠx�w>��2�
�Tx[�u6U/�NJO$E���ш=��`�(���iӗ��Ҝ�&l����M�圄^W��<�(�I�r�fp�M��H��Ô�z���(O��C)���|>°���AC�h��g��,����
�@�C�,=H~���<U���/��j[�
ٰ�7�}x9��7�0�p�q>�F�Bx�1�oƀ��z��n�p�o}��>0M@��<��P!op��O� �LE�M�ȱU4�M�1Kh|��-�M۽�f����I�U��T��U�ؾR��JEs���T(K+0|Ɂ��{[ȥ_�t��i�	t�8���w���Y�l�ީ^�"-x�)��94Ut [...]
+lU�V%w�S�7��_h�����7��?m����~.������ֱ
D �׮i�v侯*�.G�o{��i�݌�i2�-�=�v����ŋ����jn��f}h�!p����W�כ��_7�pm�
���|��
+endstream
+endobj
+886 0 obj <<
+/Type /Page
+/Contents 887 0 R
+/Resources 885 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 823 0 R
+/Annots [ 884 0 R ]
+>> endobj
+884 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+888 0 obj <<
+/D [886 0 R /XYZ 89 770.89 null]
+>> endobj
+889 0 obj <<
+/D [886 0 R /XYZ 90 721.073 null]
+>> endobj
+890 0 obj <<
+/D [886 0 R /XYZ 213.944 517.221 null]
+>> endobj
+891 0 obj <<
+/D [886 0 R /XYZ 90 500.572 null]
+>> endobj
+892 0 obj <<
+/D [886 0 R /XYZ 252.717 255.864 null]
+>> endobj
+893 0 obj <<
+/D [886 0 R /XYZ 90 239.215 null]
+>> endobj
+894 0 obj <<
+/D [886 0 R /XYZ 175.241 145.908 null]
+>> endobj
+895 0 obj <<
+/D [886 0 R /XYZ 90 130.06 null]
+>> endobj
+885 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F32 772 0 R /F10 773 0 R /F102 863 0 R /F94 771 0 R /F8 802 0 R /F99 864 0 R /F11 621 0 R /F6 862 0 R /F7 803 0 R /F1 834 0 R /F13 835 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+899 0 obj <<
+/Length 3056      
+/Filter /FlateDecode
+>>
+stream
+x���r����-P�r�<f`WR�h�.;�k�����DdA�@k��O�t0 !j�[��Ḅ1���
V�ꫫ�]ݼ��*Y�����*
W:�D��l��9�"�^�0
��c{-MPtE��}����Z%a���󶩯�0��Z�A���^+ ���Ů�a)R2	�����]�v%�p%��Dh��
�~�5\�`��U(�̬
-�a�����տ�B��4�� ���(���&x,�j��n�U<ָ�y7�MW 0�

+���E�}��+�i��T�
�v{:��h����+�{(q��i��
�{_�;^���=2��;�h��
�?�~
dfIBt��CӖ�� EQ�7-�`�
�����9=��$b�{p
����'B�4nH�CY���|E
lཥ[����mq �Ay�bw�wy��t
�m^�}w�P�E��Mۉ�,-R�g�;m��K��~(:� }��ӎk@́F9=�[=F��h��#�J~���.
�Uq�
�.;�wHsd�y���K��3����@J��D�Ke@�0������5
�m�0h;T�4:�|'wg�}�v�֙4nY��=Dg�?U�
Y壝���+v��c��i/�G�����dq���K�E�ea�fg\U)X��Z�:R���YJ3
��=���i��5=�y٢CJu7��)�����$py{:l�s��BSP\�i�c��=&I��W� �������e�shpp�8��,4;�����<���J�4
�MpZkt��MY��]�Nt�A�B�4��¿�݆���sz�7N��#�i�ۙh��O��8p�
���oިػQfJ$J���Ʒ2AJ�„�A��S]l���۲z��m�t�ΡS�æ|������+'�zl��X��U�(��g�T�V�r��s4
<N���m
�(��p(���?�	e���+*��IB������d�`���#���k
��-�oh����J(9���
"HEy��Lt1Ʒ����c*N,S�!%��W]�#�^L���E6�&�0�Kj��eV%�R� ��#��iз%8�s�$Rġ�i^`$��/s���H�0�/0|r� 5i�Bm����`ݯ���L)
��2cü8n�\'̭�J
+�c �e�qfhΫ{�
�T7�w�-o��vʫ�B�Z���dԃG�U����	�ʢ �����=�=Os���>�t��tr\wȫʺu�̳\��0�5��Өd��?�n)�Y\��D��;�G�u(���+D�B���0�z>b�Ҵ���QF���!8>�8N��:K�E�oې
���k� �1���u54��ɺ�8rYK
%yg9
c�@خ�M�[��^v���D&���,�^xy5A��Tԏ!��1u�`'&�{B(�‡�Q]ؚ2ߚ���}
���ܠ��8���:?h
�F�2f�q}u��f�8�
��O�&
؛v�ܖ+�%7�є�azQ���#��7OΉ�m;�!�,
��
�,�ʻ�M{ƕp�p�{`�������Ӓ���N��p�"�	�Ŝ�Ǵ��U[�!
Ny�K�����D3[ 9����d!6�)�M��f �*���َ��-OE
�L젧�F
�C��.)[@�-��_�&)�ܮ��K�M���

�8
SM�X�
�&����L�#���ԏu���ޯ9� [...]
+�J���l�«��8 ��V*4
+<W�pm�)��>�q�Ҟ��7��+�&��o�j���5Yk%ق&/��g����p��I8��rC
T����൒)���$
}�n��=�c(�
V���܊"�����3
�>���0����)�XD@���˔�+33�H4���ű' ��0	�D�ܧŃ\A��KO�
6��J�Y�q�
�Mpoದy�Ep���ܸ��L,�f�3��v��"��e��R
��S*�qj,
3�n�ѭ
k��.Q	`L%���
/l *���.o����Y�t5���Y����m���	^� "]�x���>��s%4M?`�P��f�,*w�"��Zj�!�}�
h��
}�S�����7�ǻ�E�
Ѥ0_V��a��m�bdh�Nw`
�٢�kHL
��?Ҟ0ܞxw̷��!�
G"�K1l���6)��łזFD�P�v��Q�n�u!���{�C����

e"6N�.74�DDZ�E�:�+���:J!U4��dI`�����`h�4�Ŝ�,!m�����Z�A�
+eԔ��ADA�^�y�,��4�.!#�L�"��
��
+I[�7k�'�:JB���,)�!./��r�}�\MGc�@)ސ�QF2ek���:j�˅��;�?,�U
�%+H.d�W�
�->�5�["3��N
=^���i4	�A���J��7����30̰g_�G4:b���
+L���[��@��k���������%4}+ѱ�4���
Tv���il��(N/�� �yY�9Bn����f����U
>'ބ�O�;�V���`����K!�
 _.
��
�Kh�ϼ���p�:�c=���lB�G�`�|�;��TZ�c�p�.�Ǖ�cVt��yU�s3��&_�"�qj�0��؉%�^>�vu��
�z`��b�G����������o.I���z!�%����>��5���Dۢ������Q�Ы$����/�K��%��a���$+
��˾���$��/~�)O�%4A*2��e�4��Q��1������QkA�RL��K��A_R�
R���
#��(E�蹀;�5}
+H��2�|�L0w�䟺��b�G��L�('�L�}���u�AP��� �5L�W����������#�?H�
? ��?��y������^��5��
���� o���[� ����v<��gZC?�+�'M�p������y�������ˎ���s��A �?_�Jh���+��+�����X[�
�q���oi�cW��?<0?����؀��&
7`j�c[䎠h�(�B��ʍ��cK<t���f����񋛛��+�|;�,x�dVs�]���`$'l�۔]���9^&�i�
7���]�"�Z+
��{�n�>D��
0y���� �OY
+endstream
+endobj
+898 0 obj <<
+/Type /Page
+/Contents 899 0 R
+/Resources 897 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 904 0 R
+/Annots [ 896 0 R ]
+>> endobj
+896 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+900 0 obj <<
+/D [898 0 R /XYZ 89 770.89 null]
+>> endobj
+869 0 obj <<
+/D [898 0 R /XYZ 175.23 633.71 null]
+>> endobj
+901 0 obj <<
+/D [898 0 R /XYZ 90 615.685 null]
+>> endobj
+902 0 obj <<
+/D [898 0 R /XYZ 316.33 314.352 null]
+>> endobj
+903 0 obj <<
+/D [898 0 R /XYZ 90 296.327 null]
+>> endobj
+897 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F8 802 0 R /F11 621 0 R /F94 771 0 R /F32 772 0 R /F10 773 0 R /F102 863 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+908 0 obj <<
+/Length 3450      
+/Filter /FlateDecode
+>>
+stream
+x��[[�۶~�_��J��I �<�^�����Ig�<Pw�X"e��z��{����v҇�gV$���w�0����컫/o��}���&:����v��,��$)�mf��_�z��L��0�� ���/o�yy��|�������Ot�p|B25[�~���6��������v��$𻛽���II��c����rW,�<�nk�=�k׶)�EՖu���-���u]Wm��e�]��̷�U��]ݸQM0�}h�b߯�~ֲ�������+��n��6�
a�;�o��HgK؋N�LU�bch��mG�~;�8��څ�����P�
�Ŧ�׹�WY:�i�&Zo��Βc��b����î\���a�kq�vs
�_MmF�^�-�Z���;|:
�C�Ċ	%<1�6?��5��	�B;�#	ы%��ο�}C)��v����6š�?�ڵ��Ž_� �ŝ�MD
��h��_��,��iʮ������� ~5�Qk�}�-���TBX¼��bF��
,��
�G6K�΄2�S�yKF�v�27

f����:=�@�?3?)�d��y��	�CB}����-�~`�Q���Rp!��]��e�p`�[��Ȳ��d&Hʼ�`��m`��h-G�J�=&N����oL!k
�#�ɲ�.�� Bf~|yk�U	'�04&����z�)�����l��Tyz�.rp���1
j��l�A��a��(����Oƌ,E*	���&���`W�jGv�RJ�^3�%2����Qm�J�
˿#�Q�I�g�3׭<�����<�/ƉA����t����2X/�Q?��F�.�i8�͔��x�ϝ��1� *�=<�l�:�!x
c
h���'�L�LB(A���+��F�3xPDQo���w�v������"_o#�P)I���Q�4��DE� 7����M�����������/���<x��M.n�����
��U��X2 ��In�A����r��Kuܯ
+�����O�~��~

	�Lj��G��?���=�q&���
����{U�NA5�����j&�%�(�P���
+� �>t:��`Q��_���e�?t�u cHE���˯ �H�8�=uV� ��h_-�	D�1��<ʡc̈R�͏a�	���汨��D�,v�6��t·����3�S�z���X@!�����<�P�
d��Y�!q�p*2IBh�+����}�B��'`�`�L��0$l���z���Dh��R
D�����	s`|�%f+��O��@J'p�*

L�em~��ɏ�f��S*B���Xb,�`����[��}j���C�´��)�צp���ɥ����{?3I����~n�J޸)A8�-H���R$�
�9AF$��A
ck�Q�
�<�%��>Q�u ������씞ЇUQ�8��K���K�[YH�X�Y|3�g���KB�☎�"��cP��w[>�!_
����-��ݶ>�m�s�#�p.��;6�
%~�"ή���b�	�ԝw�5�>�ch�_0����)8n�G?�����aq�
�dR�1+Ū
"`�G1�$,f��A�G
-�@���T6�����^����Z�3l��ெ(L [C�D \�HX9����6���D��Gu��!�6ܳ�VH�(��h��3"���L�B��� �Aʸ?�
�i-��|�0��=�����}�m�{療�Ht���
(�c,�B���U�����H'I��\gJ\��ߖkc4x�V��NE�a������ߋj��۲��v4k,��
�)� ��<~tU
�
V�0����
+	8�MW����1��o�@j�
����{K~j �\���1��� ����t:�[ϓ#(�Cu��hf3��@N 4$�}�����mb�D]�����#b��f����$|H 0�
�u�?��[�
+Hѹ�n�w�v�qKM�_�h�<C�����$n�#�,%B��*˲6���yАw��
"8�AL�?%��k7{LpM�$� ���̆���͕"� <=\aԝ��dc�|��&�k׻cs�O�� ��3�0�1�=6�権��2g�N���z�"`@B:����E:\ܚC�`�
3i̡)Z�m�ǃ
�,�|�
U�	!~��j��ޜ��޻
~G7���ҔhpY�8�9��)
m�miz��ۺ.�Hh��� �-x�������&[F��S��ͨ{��S�!w
�'��:�LȠ�
����� ���bq���+�����
y�
+��_�t}#足=���q.���+�
o�UO����e�4���U�7���T����P76�����'�S��R�A	�\�l�l�{2�!��C�l���7��Oa�]�p�AK�5rte�9vx���l��z��
js̍�@Lєk7�1e�;h�z��s M�]׎��p�ݱl,˵cy���`YS�y���qĶG™eۘ��Rp��0���
���v6;����V�m����鬅Eb�?�� _0o[SgX���'Xִbԩ�_���
cd���}ѻ���-�CZ{ﶶjJ�x����ZZ�i5�n�5�;���W��v@��=��N���n�
X�
�/��4�a��{ OB�9��
���`k����Wx{��C^�f�������P<#������ �;sV
�}ϣg����V��zs�irF|��I:�/����:]#���;
4Iӡ��B2�C�dA�$4��q�D�;��Cgl����R��phR�	e���"�'3����>�=x���T
�\���f���
S���s0��)�_*>
+�ʎ�oY�����
-��*+�0ɼC*�;�e�n�k]����Qg�'��B�2�$���I���]�ހ��-��.ov}�]�3����ދ�'&�x�j��
B�=�b��RN�降q�`|#�/I2h�
��L
.El.��������&����H��c�����
�c2
�Q5
���㽰���Q}�f'ށ�d���ƦdQ]�γ��(�l����;��۽I+��Q�uj����5�:��9�˜,<�TXJ�H"LՍ�.9��N�`#����
#��%6C���3=����Ý�)��h���&�I�8%0s��{�R��I��F���Թ�0�"cix�i�h�X��p�`��66mE�o��2wy�L4�0]�O#M�(�1_G�؎
+�LU;b�eUV&t>5}"�$n)�"v��s"�����t|DΉ�*4�g�4�	��鷺�1�պ/�S�Q�1�yו뢍Œ`�p}c���?
�O�K/�����5<j�^�O9ɠ��͏J�B���� ��
k��o�l?�1��ً��}]�d�tK�o9L�/�+�T*
sNJ�E��T�^����_ ����̫�/�/�ӽ�a�
�Bၤ�T�
�����I���?
ɘ&��z�m���ٳg��][Twd]�O3�a�ք
�%�}����0�
�
+endstream
+endobj
+907 0 obj <<
+/Type /Page
+/Contents 908 0 R
+/Resources 906 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 904 0 R
+/Annots [ 905 0 R ]
+>> endobj
+905 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+909 0 obj <<
+/D [907 0 R /XYZ 89 770.89 null]
+>> endobj
+910 0 obj <<
+/D [907 0 R /XYZ 155.574 687.2 null]
+>> endobj
+911 0 obj <<
+/D [907 0 R /XYZ 90 667.229 null]
+>> endobj
+912 0 obj <<
+/D [907 0 R /XYZ 90 377.062 null]
+>> endobj
+913 0 obj <<
+/D [907 0 R /XYZ 90 371.373 null]
+>> endobj
+914 0 obj <<
+/D [907 0 R /XYZ 317.494 265.796 null]
+>> endobj
+26 0 obj <<
+/D [907 0 R /XYZ 90 245.825 null]
+>> endobj
+915 0 obj <<
+/D [907 0 R /XYZ 474.355 203.368 null]
+>> endobj
+916 0 obj <<
+/D [907 0 R /XYZ 90 183.397 null]
+>> endobj
+917 0 obj <<
+/D [907 0 R /XYZ 285.407 77.486 null]
+>> endobj
+906 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F102 863 0 R /F7 803 0 R /F11 621 0 R /F10 773 0 R /F32 772 0 R /F94 771 0 R /F1 834 0 R /F8 802 0 R /F99 864 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+921 0 obj <<
+/Length 3626      
+/Filter /FlateDecode
+>>
+stream
+x��[ݓ۶��Bo���o���!M�L�ֵ�k^���'Qwl$�BR���. � Q�咉�3&��~�v���̾������ϲ$SLͮ7��̴���m=�iN�XRB��?�E��e�oK&ɼ����d�nAɼ�`�^/
�>��:7]��S����۫^_�vEay2�v9��t��]��
�����Ix��ޛA��`
���Wo����$Lbn
�҄�~	sA�9��+�Α`���Sm�����_���Bϋ�د
+C~G��x�ْ	`�]���yU�
���{|{�1��K�]m��ի/�O=�`��/��,KA6��_�!z��L�G@�e�%MD&ݞ� �E$Bϼ1�Eւ1,���Xd��Z͎q�o�$Dd��(	#i,�����u��
X��y{W�љO#�U)3t��@��`e҉gTij.7
��7E��NF�P�����?I@
�I��dٓ��-/�_f�Vқ���Q���$yLe�%�����ߔ3�|������O��"XFY�qcJ�r��τ�}�����F)�F�˷ۢi�۪wLr^��9u��
�k�r_�o���^��h˕� ��$
+��:��	��"���s�e{�
ܘǠ�Q�4��Ns�}���d~[�!,l�޴ 6s,����]u���МM����g��T���;
��rh�������y�ެ��94ʁ���b
-���
�.
C+���\��cLQ�|��czP��HD�2���z/(0��.��ב[�S	�OQ�4ɤ
ݥoU��V���]��Z/>���m�j����b�,��c� j�ꦨ�����5N���]��ZU��Ck
؎/��;Ɲ�pK&��G
S9X:
�O�9l˛:����r���b����3�
;��=ԃ	��Esض����
�}�l at 9|@9��-���K�\h���q�@�ƾ�[F
zb
�豻�~��F�;����
��mc�,ۦ��ܷ
F5�����e�4�|���1��bsغI+��l�uQ�^�
+��'����
�4(�����>W!?�+��gU�zv<w �to�W!�m%Y��;���I�k�Na�L&0�V:*���P ��Q`���!��U"�
+������4���M�:�dT|l�{��*���Sv�����bXx)S�0T�6��d:<���v;�b��!3Iz���g-�MJ�����.{���'|�=:
��p�����3Ā��A`J����6PCF�+@%f̺pH+��ODʥ7�s�� }J(�`F��gF�\N�Q�~J<;8�b϶Ǥ5�
Y�I��gcK���>�}����������X�D�)Y�&1$�X/���GC���T�1�?�qr|a��ρt��ЏfA�0���f�u�
R��!oT
Q
+:����-�$Oe�44r�%�iM�o*��)a�4ޭ��CAR���6�֦�\c�UMO�Zh�uM>F�Lhy
��y �;�>�R6$T��!��i*���Ae����DL4K	C\a��89�q/�E�!�KM���/���0�$��L�\1�MQ�tÁw�l�3w�M��V&�h^X
�U��qËݍIf���JLr��8�c���ܢr�؇�aWm�v���&s����d򉎀�L8K��u��8�#�J+�ūo<�P�r�*
 ��]U��e��l��r���2��kW
������i(�Rm�cN��P�yd
B>
 z����0sAz�I|"�me��e�_���e��LM�}W�w�k컑>>����#2:���F���mV��R ���2�
䠘��?��
+�seNQ����S��������%��a\$�
z
ͩH��4Pw��͵�C�#Ϧ��
J��L� p��ɣ�Q�:��e吝�
b��u<�]jx��}�;�Z�1͜/���>���a����i�i�J?#�D��v*
��ǣ��Vp0� aE�	sq�7��mk��r\c���[�u���ANyBɨ:��Uԧ>ݔ���lV5�y��̻���]y{�W����\M�Ws�P-}+��Y�c���	�3Ԣa�o
Yo�ݼ���F��aN
+�����
kb��>퇵
a�J�x�ՙ�J�8ȼ��͆^��V��
+ü/�>2�d
�Y�S>һ4�V���08��������~@]]��ڨ��N5;S`���zڛ8G����9��7v��|���������@I@��S�f�$�4 !�P^�,e�
$
���b? &�tY�Es_�]��Q&��i0���
lޭ]B��7T��&XfO��n����~U<���H�-����r4tl�j������b��RM��g¢��.g�
Z�Rh�QQy�Lr�
�1X�=��ޕ������}����n���
��x
PX�ڝ�ʝ
�>����H���.w'��hȦ!����J��$
A�觌=���#fdSy��,��}�g�b �'�:X�K['
\3
U�Gp��2��h�#e&.��,���!I!�6SR	�#���$I<+g0P��|���\n���C&�9f��%�k�K&'�d:�(D���t�^88
+�$��!*�TY哰�&l(Xd/3m�Aı
6��P�;O�9X]��� X�I\���0��aQ: J����K��3��E�IX�a�����0�r
�
��ء��KEc2a�|�f�J����#�
�h)S��)Љ

a���0y�_mk�4�p<Qͷ'H15�4
����ٛ^^`b�*���.��m��|f��W�xv�H
���a�d�������l�����,~;���'��fܻj�
z�LuW,�DomO��n��
r�� �I���%hM�%�Z�"�Ck�SDk�(ڟ����&/;� �H�����.D_��%/:U;��>�>�䢣T>u��d��L��e0
/H��0ԫ��W_�\y�+Y���s����ת�_��V
?�j�ٯU��V
�u�	���,�QeY�]���
=��*�Ԗy*�iyՐ��{H�'��!5e��X�
����l�~Ph6%ɾ4�VA� &�ػ�gS{*��7��Ewzd�`�����,
`��%D(��	q�+�$�o�'G����*
˽_��de����
[��Bd�,("N�G|��Oh
)�V������8bm]�
��$���[<-�
Wo�U����S�mɒ+7#t�K��e�����`���)��g�
�=�ͷE۞8
d2��͕��F�'/��(�KYp
�o	(�+�Uԇ㈜dg��:�S<��p\x�"�|�#�����N��`�W��>�Jh�xGxX�FC��Y�:v�� �%L��VX��m�x��4}�u���w�/�~�������p	A{w�Ix�_�v u%��ٜ��E��>9�c�O-�o��9f#~�gH�z���)c�Zfڂ�?��}�	���'�.V*>�:>$��թ�qe:�W~-�E Uǟ�*�h�^~j>��Яc��=�Ndw��S�ׯ�e�m��o
)��f���ݧ(£�04��u�v�\��(:�m	�uֵ��2 a �j���iwm{�����mS�o��=�
+q���
d�#�M�Wv=�,�
���  �>��x)	$�u� ��	
���������]��ov|�UL
���? •�
+endstream
+endobj
+920 0 obj <<
+/Type /Page
+/Contents 921 0 R
+/Resources 919 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 904 0 R
+/Annots [ 918 0 R ]
+>> endobj
+918 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+922 0 obj <<
+/D [920 0 R /XYZ 89 770.89 null]
+>> endobj
+923 0 obj <<
+/D [920 0 R /XYZ 90 721.073 null]
+>> endobj
+924 0 obj <<
+/D [920 0 R /XYZ 409.479 633.06 null]
+>> endobj
+925 0 obj <<
+/D [920 0 R /XYZ 90 615.275 null]
+>> endobj
+926 0 obj <<
+/D [920 0 R /XYZ 392.938 489.429 null]
+>> endobj
+927 0 obj <<
+/D [920 0 R /XYZ 90 471.645 null]
+>> endobj
+928 0 obj <<
+/D [920 0 R /XYZ 90 211.176 null]
+>> endobj
+929 0 obj <<
+/D [920 0 R /XYZ 90 195.549 null]
+>> endobj
+919 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F7 803 0 R /F11 621 0 R /F32 772 0 R /F10 773 0 R /F94 771 0 R /F8 802 0 R /F1 834 0 R /F13 835 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+935 0 obj <<
+/Length 3754      
+/Filter /FlateDecode
+>>
+stream
+x��\Ys7~ׯ`�>,U1a܇
�îcW��ĉ���xS49�hKC���x�6�
/[��R)=�p�F���1ƒ�
<;����ç�

2��������		���WC�O_�7`R#b$��=��ߟ���K���7�'���
+���@J&7'�^��
7��=�s�n�2�^^��x�SQ$.D!��|6;�b����aӞ���ñ���I�o����]�歕��S�m�`���
n|�lH�
+յ�nV+���j
��/����v|
����֡�E�$���_�j��y���f�h��5��Q"�R�0��4��f����jvy�,GnUF���@pSs
q���WŪ6Q�Q\N۵իW.̙1�EdLv�ϒ>���)������7���٤��rٌ�Ͳ��j��͗�mР�r^Y.��j�ri�x�Z�tV;|j���9q
��i��Y�Z��Ic�BX���N�uOyҽ�v̻�_��J�o�h**���_ˁDF1�zBXk�q���(��$����` m3��b�㕿�i.��N�7��Y{�a)�z�߹�O�W����ܧ�����E�D�*������1�ex��ܾ4���(X�C[�^�{���L�D��u7�v
ü+�D$�Y���~�H���,��'�7D�Ma����	��G M���f��.5Ң�a�6;���x	�B6�����r��|Sn	.,N
�&Ei$���5cz���)�r� �Vf��0Z���
�S�Ƿ�g��M�#Xe�������<
����x���Cu0+�y��%���ߴ���h&����K�Ҝ<!���A�lG�v�

�宅��
z3^
�)E��Z,��Mힷ��m��N��ٛ�x��(����E[�/���O֝�$
+��E
Yu
+*=
G��Apa
�%	=�U���f��O&��ԯ,85R���q1^�g.�‡Y��O��|q���z�I޻��1���Q����
�g~Q��F�Ww��$���
+Ɓ���]
��mE��?�8����M�d�t��d��D]Du�n���|_Ye��镾��\���0iS=L����$�D��Cw
+(�g�k��,�,˥~��ڔ4�
+�
G!�����2Ԉ�����c�G�P�MM}
��ʳw�X����^�-���;�
T���_DY)��i`��E��8��C` p� ��68Kx��
��{�<
/����
�)��/�	Ch��^,4'#���S�)
+�NAbV�I��ۋ*j�I��D��*�`
YJ��'
�1�dԠ��"1��E{�#�(H4�ث�z[���vz�&�>hb�Z~��L�	�
m!Q���`�VE������-��:4�Pu��	%N1������܆�--s�,������o�m�)?�F�3ܐ
�����|Sx�l�����z("3?��8Uy$"{_e���P˻٪)D�L�p���
���~��%idQlS��[�, ��j��dJ�6�m��G�
FZ�,wJ5�r'�Ir�e��� @
"GҪ�eQD��
�X
l|�و�
ԥ�/"K��WTǑ��&5D�QP�ohw-lC�Qe�L �I%Qc0�[���q���H !�J�; B֦I�V�C���<پy�=�4~�,γ"��h��l�A�;1$��=gMh5C&9�ю��D?*�g4[3i
�0P�}�[�6J���q�W�M
@��
�e�i�{�����١�怽���d��{j+k��а}
K��;�� ^9��T�z�a�o��������!�4љ�q��a�Q���1����#��DC����Q=��-y��h
�f��-����$F�$;��;�в�͵q�)��Z�b
Es��;�#3�
+3�=�a?���U͛Գ�h7�/ph[��|�]� FM���ө
7�X;�9Ӹlqj1���E
d&S���w�
d=�Yٚ���T&f$ ��o���Ò�^��<+
���sPե"pWRa9�gHashz�҃�XPv�s4Ư,0ҝK*S�#�>�j~��{�
+)e{rTF�^2"��a���9�.�7
o.`���*J �O']���d
���
���e2_̺��W�<^�h����<��������*�A�m���/j) �XE��\hQqSd���]}1_ތ��?�J�K��a
a�2�vB�
���e�I G��@w�j�ߺg����A�o���s{�j�A�n�5���藭�`��ѷl���� Xw��:i	��j���gH���?b�i�I�T4���B���8�Ȑ��B)�(��]؂X�Z�y0
�9wd+gq��V���Y�b����Q��^vogNZ��on�AX�(�]"�_
��r�ܺ�0����9)˞;hɐ1Tb`fA�W^$R�p~<w�s�E:��2������dg(g�)1Du߰fJ�
�V�m͒
���,���oIDa�l��cL�]
�м��עޖR�_;I
�>W�]5wL�&7G‡�YMq&�xWk��$(S�
Z�f�<3�w5 ��=����u����A
+R-f�di�: �<>�<�z�#�'5���D(�p�[���98$�=����/

��b��6�6������2
��������ճ'O�����Y����^��T	�"q�q�t~
i��T���Ŭ��
+r�)
��P�{uu|��a�4`�#�)�i����ݡ9���%+o��e'�@�'�#�  ���`�\
WP8�D�	l!F�R�{�yRfgHL�L���8�L�nݮ��e��ņ�f�?;KS��b���(R���]-�H�v�k
-�)N�l?>�K�.୧��Fӷu>�:"s���i�|5_(D�ܲ´X�m
$�:I��Y}�/5뵮���vZ3 ��I0�;�i����%��^8�֌'5���0�X�LE
+b+���jZ�g&dc�sN4�z�!��8�Up�4
@~
{���_����D*
+
���5��	I:g�l�Ct�~�l~�~�r���뮇�L-���L) 
���
�x�%�Q��E�s��R
#�A�ו�`�
{�
 �Ūz�x��1��ኻ�ѹ��4�6���i
Q�D�x�rZ&��)i
�FⰡE��b��t@���=f

��uќ�����~^F�
+^���V�9~�
�O�l������DPi�y(��>:1�9���s��������P\���(��aԡ��L�=�=����e�s/�A=��ϑp̿��nI��ŷ8
����
pd6�p��9�⃾�RC,
�_����a;�8���e�1�GM1��ҽ�Z͑�ӵ�*�H�E
���C}
��Ϙ}@�V�b��1�~��ҟ1�c|aH,M"��
�EX��(0a������v��*�g\������T��Q5�Kv�\F���
ҏ�.v@i���
��
�=/��;$h��
�;h{�%�*&۾��N���Xf�"}ʹ�FB
i�j��Ah`�����;��$G��/U���F����;��XZ?�+P
+-���(Z
��NG
[�YqM
*`�T�zڎ7�j��e<�C��^��B�ۏ����HDߴ�u|g*0���}u|=[�<V��l
>�RD�5s$��%
��f���K-�P����d�0<(�Շ�H��9�_}$?�
+���!��`�����_r��~
<���
�̡������$⪾��� �ii7hr����ſ�ͿW��B
�2����/>�����V<�i�b�h�l�b~�t/�{��������!���X׸Z�g���\5�%��o6���� 

�$�{}�	�Y��Z�X��p�?r
+endstream
+endobj
+934 0 obj <<
+/Type /Page
+/Contents 935 0 R
+/Resources 933 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 904 0 R
+/Annots [ 930 0 R 931 0 R 932 0 R ]
+>> endobj
+930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.653 358.91 290.207 369.814]
+/A << /S /GoTo /D (index_GDDetal04) >>
+>> endobj
+931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.653 74.333 290.207 85.237]
+/A << /S /GoTo /D (index_GDDetal04) >>
+>> endobj
+932 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+936 0 obj <<
+/D [934 0 R /XYZ 89 770.89 null]
+>> endobj
+937 0 obj <<
+/D [934 0 R /XYZ 90 647.598 null]
+>> endobj
+938 0 obj <<
+/D [934 0 R /XYZ 90 633.7 null]
+>> endobj
+941 0 obj <<
+/D [934 0 R /XYZ 90 504.666 null]
+>> endobj
+942 0 obj <<
+/D [934 0 R /XYZ 90 504.666 null]
+>> endobj
+943 0 obj <<
+/D [934 0 R /XYZ 90 490.768 null]
+>> endobj
+944 0 obj <<
+/D [934 0 R /XYZ 90 359.906 null]
+>> endobj
+945 0 obj <<
+/D [934 0 R /XYZ 90 359.906 null]
+>> endobj
+946 0 obj <<
+/D [934 0 R /XYZ 90 346.008 null]
+>> endobj
+947 0 obj <<
+/D [934 0 R /XYZ 90 75.329 null]
+>> endobj
+948 0 obj <<
+/D [934 0 R /XYZ 90 75.329 null]
+>> endobj
+933 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F8 802 0 R /F1 834 0 R /F91 766 0 R /F10 773 0 R /F29 939 0 R /F12 940 0 R /F6 862 0 R /F13 835 0 R /F102 863 0 R /F9 880 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+953 0 obj <<
+/Length 4430      
+/Filter /FlateDecode
+>>
+stream
+x��
�r۸�=_�>U�]!� ��3�m��^�i�>m۩,�6gu�rl�}.$�P�me;����~#��zFg���O�^��b��\q5�t5��L˜d
+~�g?�Q
F)���8,��~W],xF����~
7��?_0:/
�؇
6�7���tCF�Yv��Ox��O�~z�`{:c~��h3[m_��O:[��f�����ݤ�Lr���㫿��rJxfo�%�#g�s0Fk�A�p���
=��X�ya���|�[�����?�_��7W����
+��Ӆ��宺�������$ٳ�о~�h
�-�$B�
��,����ru��a)����,>��	3
+�q��*���e4�Me;�s?G�h�$c�B
[�`K
cgh��l&�b���C�R���"�d�l`K��ݶ~R�>
�i���	>��Y��1�_>"��r����?�!��P�Qd
A�nP����"ʈh
��NI~~2a�ˉ)�7���� 1I�l�cd��	8�*WD���}�[�,�Q
�c(O�2�ӆ?j��0���8b40Dd�C��9��Y�9H�ψ�U1��Z���W��v��<Z��5r�W�p��91@���1e�1ut`˗
6S��i�⪿(V�xM{��'q��� nؑ�PS�H�ԠHډ�9A�
nj�q5#i>.-̃L���,!��$�F�1i�Y�
D�&
��55 l��<�
;rF2�p�g\��9mB����
��A(B-8�7	8	�|�L����-��Ӓ�����8z�VLXj%��1���{�����`1�x2С:���r[n��Z����L\��	�5�ч�I˧^ԭ:Q�]���rިM��8PD�^-�Q��u�F�7h�B��'�����a�԰b�$Q�a�|J5�=\p��
� 9c�0#L�@�c�_���(A=h
�;4z�aT�]6����x�<�����"3�p��]�Ң�VcҢNK
�,3��"���t�k̝5�#��c}����!��^l�U��]fs�b����~�)K<�#:)S"a�7��	9Řgc�\��s=͘�Qc.(�^����P�X�)v��uξÕu�=���htb�k��͉\���	v���
�jY��>��`6Q�X�V��U���bW�u"(X˪8|.w�
�aT�q����@�2M��4��%9�7�$��b>F��/tǦdA�
��� [...]
�
��6��PVG��gV5T�7�?r6=��
�{�6[Vݹ[�{��[p	�88Y����pk�
���G��H��v�fM��}
��
+�qR|`
���ª�A;����16���C�F������L�h��
�2���d&I|d0�ֹ�$7����؂:9Zp��־�	nv+����FϬ���g'g���Y�ь�
+
�&����b%�
P���'	�(�EL@
�^#@"`c�g��@�ch�l�`�/���8̭��Xj�z���W��D��9����tN�f�R�2!�Jy�L�u	��v�S�L�w&
�����Y�_�y��
�D��&�F�����I���sM	
��X�� os�C,�=]\��k���G$n ��i��-�^�(���Wo1
�	ӑ	�
J �1
�l��̻���
�� Pd�P,,=z$,tI#�iW�dk�[[�E�-�����孩�4�T�ͻ�xc/�_t}y���W�Z�B/!�'�<�^�9�� B�
�\
�{Ū\n��jYpzɘM��6��]"��X�~��_\����R�f�[�O*�Ax�"O6,k�b�$�%
����ۭ�0L��q�wY{2�w�G?��:B�CM���~�<
��ZiD�<�Uu=�`������f �s��k�I
�c�lR9!k�������h�:�h�,�j�K4����sV�
&2,>�
�%�6�
'��c����sK�bR�,^
 ���;!��2��M��dv2B��ԭE�NI6���f���7Eo��W8��끦,�Z����� ?D�d2Γ
+��$�(��l
�h��j#�s�C�ǙIBGۛc����o퍞߶�~��3r�|��W����¨{|��^��nʕ�ܓz�r��.*?�m
޺�f��
���
�i;�.�ϑڗ;ckզ���
�ik�
/��
����C`i*C~fV�m�q{������o֕��~"��l>Lʼne��j��b�b�p���e
_ե�����&��S� ���u��!� �"E\��� I0Ѻ���v����W��n��0ۓO�
V�V
����LW�
���M��9�&
�+��-Fb.`�F��z ����(������ʔM�s&��c@�u��C�A
+��������Wk��j�ݯ�����
��8,���n
Vs|`������P�Q�.��ۭ6wk/�x]
�ö܁�X��в���
Hѱ]:Td��t$��X���
�S��\���L`�]�v&�
���
D�
�|�
���
��ίuE�#D��oBQ�D�+�
�kV,ˈ��g��=Wъ?)]3�8�y���m����bݴO��X6��W��]��������o�
l��J��� (����A;�����#O��
����
lkP�}�J�C�$�����C?5�������.�앤yGX�A#fj��Ir
u5=�=-�o���
Q��	���:�g�.�\v���e�� "��?4�/?[=�<��ˍ{7 ��
נ���jF�S
����pT�H�Q$��נC�H"X�^�~�[P��$ ��%
i	Hڈ�vD�6X� 
�f����Ǽ���hwL�S,g�����
+�*�ZB?�]c*Ȯ1�E��)��3�N�T�}��C��f
+�
�r�
.:ѰP�1�̝J�d�{9 ���ԀDZ6,��K���Q�#�Dڟ�qU3�X,��w+�ԅR^"UG"���.N	$%T�	��RYrL�6
�ƣ����G|������z�pȝ	�7���� Ϥ�iՎ�?� �M�
o�w�q�	½�:��#�2�}���W�ZP�X�Lm_	���壇��v�@���;�ܚ�m!r�ى�,{��wW�
s�
.�@DA���B�|�umZ�̣c��	���0p�¡M<I�5՝�KT�R)��ug��I���q�r
����
�ç�r>j�6Y�x�d�z
q�J���%��r�n浈�X�޽��IV�3��<�褭�[����qT�� ;㾴����M��*������R��B;R�'e�¦�G�>�-��$_$��ݣ���7վ	���T�.�&�;��$�l�y	`z����I���x��0�ۦ�,�zEns4>am�+��rW�{��ۍ��q�=��������儊	�\);��>Y
+����+å6�?g��ޑ�
t�v�&*��sF�ʧq�z���CI�|*���]�0r�i�
+����S��� ?�1�4�
+,rEГā��s:Pf8Ǥag��й�L�<�
���vĶ��r�B2��9X�˼
� �#�Fž��u�M�O9�m�N�_=v�v?}�Z[����N_wKiK	�o�L*����W���
'2Q'H�L-���f�&d��_vԾ�bh�z�yʻ��(A�ef_�WfI^u�n�&�
��6��#�fH�w+�:I,���s
^<i���{mp
/�
cX�`��j�1�{�w@� n�υW�A��n�G�N(��LC�F
+��G�,�]~^
6��?�嶾���(+3 i���&����$〺t�K���)����I�9��yJ���J�ޣ��r���BEg�%
+C�
��D4�S
+�����{�;L��4gDg2m
��n����<,���r��ە�+��w;��#�����X+p�;��Er��+��MT<��F�%v��Kb�
��5
a���r��8���z��!�T�
�~�������ju(/kWv_��׸�ʼn��&���|Êڞ������#Va�M����zY�(�:���)Z�'|���e�h�Y�J��R@�~$ ʁC鳢�~
G�p�QV���s���0
�����GJڑ���B!�?���ԗ�/�L��Pݖ���@rZ���j����g�]�26�C�� �^�-��i�r�g1�γӟ�J^�}��~f�I�*8�S��9/#���S��;�:���UFRg{��G	y�����~'��;\ܷ#���/��R��$�}��͔��\	��i
3g�x�y��M��Vt?k!��ɽяZ���E������ٝ�f��WL��M��oe*N4S��龊	|i`+����*���M'|���O�������"��]�����-r� ��zK�00���ٶ�2�L�"���㬾����h�ô�76ļ9
o߼~}yw]� ���w]���<�5/cm��gʝ����
_
�q�Q� F
+� ���e���{����0������vHn?I�G��

+endstream
+endobj
+952 0 obj <<
+/Type /Page
+/Contents 953 0 R
+/Resources 951 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 904 0 R
+/Annots [ 950 0 R ]
+>> endobj
+950 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+954 0 obj <<
+/D [952 0 R /XYZ 89 770.89 null]
+>> endobj
+955 0 obj <<
+/D [952 0 R /XYZ 90 721.073 null]
+>> endobj
+956 0 obj <<
+/D [952 0 R /XYZ 395.521 157.573 null]
+>> endobj
+957 0 obj <<
+/D [952 0 R /XYZ 90 141.213 null]
+>> endobj
+951 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F32 772 0 R /F10 773 0 R /F8 802 0 R /F94 771 0 R /F7 803 0 R /F1 834 0 R /F102 863 0 R /F13 835 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+961 0 obj <<
+/Length 4556      
+/Filter /FlateDecode
+>>
+stream
+x��\�s7�����ߎ��c��m�%�u*��m�u6�U�4�X�H���x����`�
ʲ��֕��!��~��� ��N�介o�\�xe��W�3ys3�lb����Oד�M������M�q�^
+����Oo~��7?�w�}s����؄��ue�����og�kh�݄Uһ�c�t?QB���䇋��`))��p^q
�|��w5N��4�ݬ������:��:�sI7�*�Z�ӌ������=W�
Kg������ߴ����m�̶_�]SI�l�,��jba�T3��)n-�b&���%/^'�}��q�e폌�K���ɴOJ�ac�q@�֕�6��7����rR��m(���V�m&*�|�nc�K��0�4�3���$��cm�VY�����g\���n9w��:v"SA��W����y�i#W]�`Xf�Ye�e��R��I��K�"@\g�8;I�ۦ�Lz
L%�d�՘J�n&���B��cIz���Q�E��
[����P���
ہ|�kr�8cl��*�b�\�R���9[I��R
?ŒLuT���utW
VVrڪ���N���d�x��Pc��P��@.�sm���r'���B�
����kv��gA�� aՉ����[�1K8�Ѷ_��|M
pD�n�o�}��HU^UR˖��!�A���u
+}��r��/�<p@��ơ��f�
h
倅�ͺ�<#���kH��7q����
M�uhs�Z���"����ma�������
^I��OCSKbj����f�z����� �
s���*au�#4�K�\]=���r]��@�L��}J�e�l��MS��_���f�-�ȻJ�p���6�BO;�	L�|絨M�Ё�+i�
+c��v�_
��u1Cf�-����u�]�+^]�$s�7w�8����갼��
�kP�@b�����|ی<__r=}?������V at jWqer;p�ξ� �>��	�0�N�>_E �2����'�3�\�	x
�^?�14��
��������d�LyCn�K3Kz
6C�k �o��LP�kM8���mQgl�:g[4
0�����y
cV
�
����kb;$pX���,��l*�4tՒ�
�#*�;��
�2��lB��d�
ݒ<�?%�Ý\F�2OG���.<֋����I�	{���ʬ>���bn<�ֲS-N�\P��ƛ\�s
+�q����%���<.��L���Z�(�Ð}��;\�X��<,�.�痜Mo�r:8ؽ��ֻ9������~�p���:xx`8	x�b���qs����f����޵+�~pT����)�����u��p
�N�~&AW�gƖB����(�$�
�EXy\- ��h���\N$�:�� ��pŊ32
hZ7���l׃*2$uZ�a�Nr �+��:D�0�)�*.x���a���9I���-�'
.���p@�J��b�wr
3��h?�����fw__�/��lz9���0�5�[0'EF��(�[�_����MNdB��3�~[�Q[���;��C|j�\�C��}M�Ι�pqF��Ej��Q�ˁ@�B鎉$�A��bF�d�kl��B���$�#$���/��%�
.k���0��[��@��h0NZk�k4;ZL��?R4�%�Q��
@�;�o��r�X5�.����:��?S� ���
#`�����q�Dž�j��?o!݇��8�\U�O�>� [...]
+4ⲳ��$�,#������m86�86�+&&r� �\���j��hL@��d��xYj
�x�O�1A���q�Z5B��`��<)�I��L��ڔ�X(���n��jU�6���=1���<��"/��*�K�% C �
�Ç 0��=0��#�,�;.x	.�s}�!#!X�Qs�H2'�y�V�~4x�����|_m?9���$s���L
}`8J3��<�E}����w��F��4�@I�EG�\
�oy
�t���E��Ѕ$��Z��?=$/�c{kZ�16���f�\S'B�����i'��,ۊ9��?#ݩ4]�L̠�[�2[�����7W:��o�
k���yQC٘wa]%���,%��j�܅U��PÅ���P
+���WV��g`q�K����!w[:Fl�����I
+��!I0�^<{?02.���ERih&*mF���2���t✯�Z3����	�JO�ϝxA�&�UO�<��
�b]�D��r}?�L�̄7�D�7�*������	�`:|�l(��p*�^/緛u���)@��h3���
��g�F��U��9�Qʃ���vZ�%V
���ab���=��\�g��n�k�@��|y2�*8`V7�$r<��+n>Zn՜8�50
�V���j<��
�U;�[5's��Ͻ
9M���sw<)+r���R
ͭ
+!�ܪ +������v64?ֱe�ݮ�Ǧ(�ؖ�#�{yDZz����3b�m����U��
9�Ċ]8�ʌ����v�|���6����$k�\4�K�G���|Fi��Kmw����)�9{�P��4��e�NI�w���7@(i>�e�3#�[P
�F¹
	z���8/�=
��/J2���1��!�M)�얷�Χ4��:�`�
��+�
[̯���b6��i���X4
�v��$.ts��A��foI
:]
#�y��t��%-��j�
��bCT�T=
ߢia͘�
�Ӟ�Gb�G��K�k�PU,�R��<MS[�1�jL=%�#N
+�j�3�d�L
�l�L
+$��}���t�-�ͻ��a�c����&bx\X�@���8G�_}���
+��L�g>9VvcrKvtai�^E=�8�fe�
+`��1��z�ab%Z�O����-��n)�"M ��t�jY����p�̚D��B	$�⟈c3r֘�صt��7��*��+�D�k��w�Y��Y�6_f���R��B蘊���Ǻ�M�;��hR�1���h
u�Z�e;���DY�o(
+em=.�
�
�y����-�z���5��ź�7������7
Q��/�j�D�Y��}�a>,WM��w8CN�� l��:���Ӕ[���|Zo��Ђ
<bܵ��?�S�K��d��
u�����##�����D}��S���u�#�OV��s]���k g}?�bZvma<l�"+9��a2͟ʹ�#%��?��
��,p���iѩ{�0�����CT{�<,w#
+���,�,□�]-�}Ӏ)��넒���10O4EZ�H����<,��c
Q_՘��:��݁=��B�.b��u��G
n;���y�S��� ʌ|��/��2�a.,8/J`s��{೤׸�y�`*���}zs	��1Sr_�bJ�����������#E�6Y��2.F�S���r�,V6�ep��i�2U��$꧋!���g�#9�l�5s#�wX�\�<� ΰW���JI��%�Qv��
�Jr����wp�
�#
vgs�z(r:
�SU�
 >���p����
x:&C֤�-o�1
�fx�A7�%�.�,2�g�S�ꄂ
�ѱ���WKb ,��̀��ʋ��������{��[�i�c���*/�S�'�
 �!���#WO^��K �x%�E�YH�DM������fw������*����_���
+
�oHH-dv�9�6���X~!D���4���gr�u�e�p��w��aWcx�<�lM[��m
�����
˟ۣ�Tr���	ةU�,.�H�	�ֹ}��9|3O�
e�WM���%̚`��j�_S�O��1>s Z�#��GW%+-tQ���<�{�X{�y5_�����D at ay�m��$���Z�	��e��m���wM�Ն.�w}>~
:�HW��J[�i#޳|[���~���ܿ$�� �������pF
9�`/|�ގ{�~��^H+Ϲ��<��
2ٱՈT�,.�
�ˬ�
)�$(��/���:�3��-
?�M���G�ř��b�����^���
z8�Gt E_��%��I=ڑ���L�ď�d4�1|'���4&��_��箯�&kӰ�*� 
��R���>uϓ:Q�SV)�r玙/�88ٷ�0�\s���d�y̎c)��]l輦���3P���1��t4	�l���d}6����
���d��x�f��&e�
���a�df�|ʂ���?-�J�&GB�K��Io+��ɓ
�ڛ�O�\�;r�&��:V]�
Q]����%��ŀ����`���,U�R���F�+R�Jn�7j�
W$��4Q���$M��F�	sӇ��5Ru�NW���mB�	  ��+rH�0S@��Em��H}��@��_=ͣ��7B
���s#4y�ч�	"t�m�-�_�
�l�i^|/'������f0ެ��R��ƨ�5�+D;iW�������׻���z��f���XS��I�;����b���
+X��aW��mG���ZuJ�e�JN����/�e�V`��Y��e�Ai�(�u���]�Fb1Z��t
+endstream
+endobj
+960 0 obj <<
+/Type /Page
+/Contents 961 0 R
+/Resources 959 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 904 0 R
+/Annots [ 958 0 R ]
+>> endobj
+958 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+962 0 obj <<
+/D [960 0 R /XYZ 89 770.89 null]
+>> endobj
+963 0 obj <<
+/D [960 0 R /XYZ 199.887 353.06 null]
+>> endobj
+964 0 obj <<
+/D [960 0 R /XYZ 90 338.514 null]
+>> endobj
+965 0 obj <<
+/D [960 0 R /XYZ 90 235.527 null]
+>> endobj
+966 0 obj <<
+/D [960 0 R /XYZ 90 221.08 null]
+>> endobj
+967 0 obj <<
+/D [960 0 R /XYZ 139.584 77.486 null]
+>> endobj
+959 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F1 834 0 R /F24 537 0 R /F7 803 0 R /F10 773 0 R /F13 835 0 R /F102 863 0 R /F94 771 0 R /F32 772 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+974 0 obj <<
+/Length 3837      
+/Filter /FlateDecode
+>>
+stream
+x��[Y�ܸ~�_�/A�X7�C<d�l6{A
��Bӭ�V�/K�'�>�K"%�L��
����U�:�*���z�g�\�����%��T�^�g�ɼ@\��j�:#H�c���X5eW��|A9�{{�nr����U���9�ۻM�jJ�J���_^}�ի����3b��H��rw��<[���g�B�n͠�,�
���ˋ��q���V_�
�A"��$��ڃ(��?�ʪ�GU���
�t_٧��ʊ
�~��_

L�g
�#�v����ޖ��n.x�I�u�JS ���C.P�8|o��6���g�/ÓPY����|	�5s&3Ǜ�KB�	��I�	��L�Q*T
�̏x6_0��
�x�i
E6��L��ns5�QΝE�ļ
)U��(4'�����(��Eo6-�M�H�D"�?�i�vS5Ք&��b��jA�T��Hj
���Ѝ�ӐR�gp����~��	PU~��<�'QO%�������J#\�˸J(P"ũP�W���s,�=j���A���|	���j�M������9QH¬
�Ԃs'OS��.I����^���Tm;�^ߣ�9��WR�#��0�`�T۾��)�}z3��i�ED�! �<AF"����Q�u�C�8�@�F�����B+�/�DC�L�~.{c����K㣧yj�vW��#��G�*��+�a�`�{�2 C�
�RV�g�ݿK�{SdXm3��(b��"��9�%f�QK��E0�a�M�&��`WE:!E���:S�؆9q1R�(��3��
I
��l�g�Q�9
�&b#�s��c
�˂���Cz`}
+8�h�Fc�t?
7ø�I�M�:�?�cuo �wA�36qO
�C�����Ӗ���#���R_M� G��� m� �+�ה�� L�᪏�Ƥf��:/"`6$ ��H�Q��ǘ1D�
�H"1���������Sg�H\(
���0FE!"�h6�
o�,�cAn	��3?%��cZy��]�|�y��#��q�
+�ʑ�Ej.1#R'F�Y�P��`����I
+�4�0���Nc��T�@M�����vɔ�0�n�>!+G��#YKfw
�
:� ,��~�%�4�Rc�EF((��.1F�44���"P��R�ܔW�)����+9��0(�1�tU-����ۛZ��+�վ�D��h���_o���qUv~�p"��`,
+�1
^��'jP�-����&�̐ �����@���Fe,x��}-�f꘩�By^�I��eV!�f_��ݵӠ^��u�5P�w�94:5����"����Cnumh��}l;S'�=�Ҍ��[א
���!
�s��
@��z�MJm
�M�Tr���[CS�W[c(2���M�n�zo�qE�py
����;�z�m�df�w[�qrl�1�D2������� ���J,RM$��d�<�|@
#t$��n���d��S�[������J0*�3��Yה�v]�Q�q�D�)`΂N4yDyX�DGf
9tF
)V�	���=� ��21㐥 �~
����
#��%읉
j8[R2z��Е�׶{��Qrԃ�&�z���A~y�����֑v�9U��
+u~����u"���~x��!���``��7"�B!��&y�x�U�4>��5�r*�F7|�k��}1K�}
P���?���H��Vεf�����;���u���~{���
m���[W>�`��F�
M�1�՝�����Hy.��u�<4�r��z�i�Y�'�0�
� ��C�s�`
'kj����2�����bjq�����
\�-�?���}�u�x!�o2���y�|S���>�o�ʚ�~�5���ֵ�1r�p-�S�l�Kae���Z�N�*z&n��REG�
+]�뉾{���ԾL������SE$Iv	F��M�e�>l�����I�&)���#�k���0nWLJWA��/Iv�,�A�{���
hn
Fqw+��q��N��[&0m����PPI���H�2��i���Gc���R
+ni_J��SO�G'�,<^��,���C���;oR���''T�?��~��F��ew
�T�3��NZ����F�M�S��<5��F���R�F{�\��E�;a���HOҝ�F��0g�%�_.l@ͥ���yU펇�Px��O��p=�MW/o�%T%͜�� ��V��-3�]e��`�ʾ�z�u�lLƊ�5U��[{,���Saf]A��o�(P��|�A�h��z_n��Z �ʩȾ����lD���N����y�(�e�u�[��$N��h�2%�Y8�8ӡS�
��፶r�,��cxynM����������myl��UKL�� 
����Tv�D�K'�>,
�SX�b �Ue�*�*@��>U+ ������E!�UAf$�ʾXv7!&����C�͋�5]D4֔��
+WwIB9�Ը�`�c�l[_5esg����,<<���z���k����3 �wN�*�Ѝ����v$�m{��\K���q�
p�7�NK�E�}�������-���{��L�8�%cp����m�O����n��O~�������G�7j�l(����n�*Y�a��FLE���I�$�"P.蠂T�C�������=E�A�
V\P
+��OV�)�L���yc�X
jiu�[��q�l
�Q��� �@a�����zo;r���G�)��
�
)%�����c
+�PL
�]���	#0��{���d�wW"��?����!�"�
"}����S �\��|��B+
��s>���Z�
���"�S�+�$>�.�D��@�DF�D���ͺ�'������
\��g
B|�s�nu���\��
��^
u�>���ψ�TU���nv+Ȧ���|�ߖ͜(��˝��
���zw�N{�瀖}���#)�C�I}@r�R�"�^ܛ�=�KvOv����0��%�,������pj�z��
+�
N�o�u�`IF~���G�Q#g(g�63
�f��;mJG{��ɘR�W-L��Þ`
+�'�W�����4�C�i�쥳����ʽ���<MVg��(#��4{CXn�M2�Q>�gI���༧ɒ�꓿<>���ȡ���a6����V(	N1W&���ؓ�&�$�0���N�I��!�ڹ�-�9�FY�HcUC>��Q�X�g9���H��PՌ���S\�IĆ3Tm"L���Ϡ��'5�Oi����R�4U��h��ak7
o�C'bA;b8�~L����1

O��D0%l����v�&u�vK���h��(z�n�e��-���+�������v �w�g�Cl��� ��v>���i�oBև&�T�	����'
%%�}�%�GQ&�s�� r�[$d
��0��M�-{�%�EM�`C����}eO/���C[������q
����wnJ�l�Ҝ/ (wh� �5��6��ɂ����z���;�ԟ�1�l�
���L�X�Ժib:�a��e�>������iw
?GB�~f	ق�դ�C�D?
�־)��
+��z6�i8

�u��^�k}���Ὶ��>��9�&����g�'�<��N�[���j ��$였a)ѝ�;H�#�T�M�w-��^�N#<�n��&l�#�k/�k�����mޚ&�&�9�z@Ӻo
�����A	s
+jzа�
��v����E��s
f~���.tUf~�C��
����������?�9�
g?��ӧ����7�? �
+W�̗��/���`�m��~�0�9�C$����Ǐ�n�!�^��a7-{Y
+�e�
mg����w���TB�yZ�^�
CP��i��<L�i�¿�����^<�n�f;��������
+endstream
+endobj
+973 0 obj <<
+/Type /Page
+/Contents 974 0 R
+/Resources 972 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 983 0 R
+/Annots [ 968 0 R 969 0 R 971 0 R ]
+>> endobj
+968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.648 512.289 370.375 523.193]
+/A << /S /GoTo /D (index_HMT71) >>
+>> endobj
+969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.151 366.699 315.118 377.603]
+/A << /S /GoTo /D (index_HPR97) >>
+>> endobj
+971 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+975 0 obj <<
+/D [973 0 R /XYZ 89 770.89 null]
+>> endobj
+976 0 obj <<
+/D [973 0 R /XYZ 90 721.073 null]
+>> endobj
+977 0 obj <<
+/D [973 0 R /XYZ 175.548 571.77 null]
+>> endobj
+978 0 obj <<
+/D [973 0 R /XYZ 90 555.259 null]
+>> endobj
+979 0 obj <<
+/D [973 0 R /XYZ 291.462 426.181 null]
+>> endobj
+980 0 obj <<
+/D [973 0 R /XYZ 90 409.669 null]
+>> endobj
+981 0 obj <<
+/D [973 0 R /XYZ 319.647 304.818 null]
+>> endobj
+982 0 obj <<
+/D [973 0 R /XYZ 90 288.306 null]
+>> endobj
+972 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F8 802 0 R /F13 835 0 R /F24 537 0 R /F102 863 0 R /F32 772 0 R /F10 773 0 R /F1 834 0 R /F7 803 0 R /F9 880 0 R /F75 562 0 R /F6 862 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+992 0 obj <<
+/Length 3756      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۶~�_��rg"7`3m�N�8i�8�;����PW�F"e��f�}��x�B��d�틄q9�;W�/�
������g1j��<�����"�
�s�fP�,�$�޾{��Be��<��\�g߼|�����c���o����
Aߧ���z��
_l���g*��7h��R��n��ͷ7|����lE&�����]��&�^��
+&i�q_���Ж]�~��-5���ho�M�徬�E��ޮ�v�[��諦��b�5~��ˎ�����.`a(�Զ*�jM�M�/��s4�%l?OS��[��U��H�����l�j��?����i�4��6u����8�
�"��2�Y�}Y��U�kne�<���������XW���∦�a�a$)�{��J�l����}y�x���:r֧��)��a�@�-ۮ�eB�0�&Slÿ/%���VV�i�=^YƄ�]
+�y�]�s�/��{XH��C�=lD�d��	�`^���f�>	
�U��h�rh��j�8�������@��r���
(�B�wH��f�Ƭ���,}O��_��̯��
��MK�z�`GY0�W1� ���j{���-kO�4%��	
ˤ'���á�J�z�h
i�2���$^шUgZ�0�B*e9���t��O���.'B�J)��e�ZX�hWU�y��sz���cח{�kK���8?݀QL�K�5
�i r
zt�mƩ,��EO3�)�A�2f`�9i��-�����D3b1`��gyPH�G���_N��ٸ��Y���l<c�>�M�%�-�
�J��Y�01ҟ݊�$π��$�RfUvBe��rFTc����2&y@��]�xnN��1�s����=���Zq�cqn�F��� 0o�L�O��m�1�m	�v`�6�~eF��0�P�0�۸ʰ�0�4'МL0�6
�GGmN�h����1rL!@x�s�#+k���
+oν
�%@��j�sj�4�G
+/��w
+ʽ#��S"4`�ބ/N)9?O�]:
��y���z�
�y�݈������

"
Ry�H��~��d���#���H#�+��M��
c��H����G� ��
�J��.�0Ǝ[_*���Bi� T��T0et�'��������k��S"��1�*�
�6���խb��?����F�Q&/�S%�n+���hi{�.�ܣ�������~�/�4�
���LX��,���]��
�%O@8I�}�GR]�&��q��+�Hـ#�Eo@$�S8)�$�/�I0��%8�V�*��m�-Wh�2
UL)Dv�:j��.��P�<j3�u~���5�f�����d�
ja�G���=�I
�t;:	�3s���7��
k�b�+�A����0{ȏ�
�B#0̖���D�rU�w�M��)�壍��a�i��\%�)R��H��6�6 uE��Pweq+��ͧ�Iøʯ9
+�c��m���
A��G��: ����Q����X�C,h.˾���q+���Bg�Dž�2y��k6������рV1n����ﮧ���P|��i�x(�î�K���q]n��H���"�ف���vU��*V2W�a?�kƂK�,xͤ�8p��<�C4�%L��P(��]�;�N0�c6X���xr
B�'v�T�Y; |e�
�p�:v�:&h
��3��<3��х<KC��ih��4̠�^ӫZ_��d�D�Ju1o���\'Y��zu	Ü��I0�2�x
�f.�yY�����
W�q3G gy���2,?����$M�
q��s1��nʳ�SYf����0��櫑C�P�����
Y9(_�ʥH*{�JN��i�#3�M�U!��r
��cF�33R�gO��K9mX��T�̶�d���l�Pmʚ4ȯMj+�Ƥ6V�Imeu�?`��P�ð4�&�n�������������
+^
+v�4���������m�EH��l~��눐���_�|9l7����&VSf*��:7
B�IJU
��\��7`��pV���W��-]�gu,h{ɨ��ح
ŋ�}w�.?ycM����ğ�%�
��Qg����j�\�z�w?s��ћ���ͻ�W4K�U��50�3�f�-%5����؇�6�q��?"�pl.jB1a�1u�ȥ:�F H�hl��<Ò#�-U����k�W�:�u�'2ڃ��G���h���M1i�1��+�:
Y�
+�
�z
+o
���j
T�V�V��wd�/
e�kD�j5���k|p8c�+
+���)'�u�b_�
��;��A�D�]���u��9n�����1��^3G�������13U��W��
/2��g�	��D
bOP���;�s�����3J
o�����/��'W����	NC\�qU���:��E��K;n|�Q�(0h�)0�Ѡ%s^�2��:B��I�'i�t$��.܅�
���24����:�z��L�C���I��́5�\��)��A����,���:�
�������}�61�H��
+�NH	�=�|J��Z߇�ON�.�`�~��GT�I �T��1�~��8�S{.��
:�',�J�Gjt�"����b�԰��x�#��{,%"�P�
��hՒ݀�����t��'�\n=;b�x��u���5]�{
ݽ����m��KL�QB�cx7U�!���(��
)>�sQ�=����EG�9]`U7��X
� I��	*3��
��ñmI]��K���+��0tXӃ�]�W��ز�3���cz�`/g�E7�zb��:� .����S' ��4@ى�F���|�K�w2np���
I�m���4����g��l� ��&��pw���,�-������Oi��ل�
F?*O-�{���9f�}˪�{'I��cc߶
p�-9�:P�0��N	h1�u��,�&�9�<�x9���/z �	���8�!
�
qV���+���3�ă^e�Մš�J��cKx�51@�sG�l���?����
��m՗�da����]����N$��������e
+Q+eg駝G'D�$��$��[���z)O?M���t_R9���}�
�
�
�
��]JK����8�R����+��% Z�+b,��
��
�C�~��kO�]��z�6�O=�(�P��_~A1y��
+� iX �w���S��l1�;�T�i�dO�V�j�A&�9��!�3w�Z�&q����x/�cA5�)v�J|F����\��� 9�� UԹ2(9���g�
��
��������Ȧ�#g��:eY>\<T�
-L���~�r�Np|oqz'՞�B‰yZ�jX��SK2�4B��#�1����K��F��&�Ck���
�U��:sk��xSm���3m�ŝ�z�={�܅�Y��-g��3����]J.Y��s��7���z+ӛ\�W�8��
�f���w���n��u/}3iQ���=��z�R�X�[kh8vG��׍�1��W��E�,�
��M����'ɬ��]�{2������
+ec�M�\n��� �R^�EjO�e v
+
���{_���3�j
���~d�
�T.�̆pxν�fӐ򆭬&�
+�N���7�����qC\�1uGN߷CH����|�>�P����a�{�0F��i�u�o|ó��j�y���-a��8ax=o�|�&�2�˰��3O^���q��� �^��XF�L|ZjL�{m=;u|�N䢽�4l��7�=0�v������=[
��o������<g|Tj�[�}
�U54�ks��	�C
+endstream
+endobj
+991 0 obj <<
+/Type /Page
+/Contents 992 0 R
+/Resources 990 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 983 0 R
+/Annots [ 970 0 R 994 0 R 986 0 R 987 0 R 988 0 R 989 0 R ]
+>> endobj
+970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.267 696.002 513.996 706.906]
+/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
+>> endobj
+994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 684.047 234.367 694.951]
+/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
+>> endobj
+986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.859 345.008 492.835 355.912]
+/A << /S /GoTo /D (index_Hal79) >>
+>> endobj
+987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.791 333.053 180.758 344.01]
+/A << /S /GoTo /D (index_HPR97) >>
+>> endobj
+988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.388 279.563 148.972 290.52]
+/A << /S /GoTo /D (index_BHRZ03a) >>
+>> endobj
+989 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+993 0 obj <<
+/D [991 0 R /XYZ 89 770.89 null]
+>> endobj
+995 0 obj <<
+/D [991 0 R /XYZ 90 685.043 null]
+>> endobj
+996 0 obj <<
+/D [991 0 R /XYZ 90 685.043 null]
+>> endobj
+997 0 obj <<
+/D [991 0 R /XYZ 90 670.184 null]
+>> endobj
+998 0 obj <<
+/D [991 0 R /XYZ 130.944 417.007 null]
+>> endobj
+999 0 obj <<
+/D [991 0 R /XYZ 90 399.99 null]
+>> endobj
+1000 0 obj <<
+/D [991 0 R /XYZ 404.764 360.116 null]
+>> endobj
+1001 0 obj <<
+/D [991 0 R /XYZ 90 310.138 null]
+>> endobj
+990 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F11 621 0 R /F8 802 0 R /F1 834 0 R /F102 863 0 R /F94 771 0 R /F32 772 0 R /F10 773 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1013 0 obj <<
+/Length 4320      
+/Filter /FlateDecode
+>>
+stream
+x��[m�䶑�>���E��p�&Q���9�v����=��h�5��vKmI��s�>U,R�4��u� #���b�^�*���a�7�ܼ|}��Fm*V�ؼ��T|ct��j�͛L0�����nj����;�W��̡�����@��ԙ�������ׯo~�0�:g���N7o~�=4�iÙ���{���R�����
SY�J�
3Bm�L��
qJXN���Jn`��̾5��޷��k������>t?��
+�}��譌�߷v�2;�o����"�zj��r���v�t��g�e���
�3k�";�[Qe�Z(��V��3젲��v����(���ݾ�ھ#:���y�
p�R�9����V�2��K��*�>�D��X��o�G�C	d6��٩
G$
ېU��،#�k'j?��sӹ��PO	�BYI?�#��{V��w�25Ƣ��ՔL�y�qS��6�2{}p��SCD�wc3���<�-W��C܏��
6Ŷ՞%����J� ��V�6�R*ƕX򾿇�E��6R��
+  y�a�st�csn�z¡m��>
PJ����95��n���}*
ۻ�

W���\��{���]_��E����kFf��3��j��P�J,D�T�VL��9+R00	dH~r,��e	
�Tz�-���dgqڿ�a�O�0���C�[�L28��p�V��jz������R�yןΗ��:t���'�g��ż
��*�h@;��;ջ��Q;�l�=z��w��q/I�f�#	��$7�k>4X�Q�2([c�����9֏T�?�
۝�/�L��h�vR�Lf�7i
���?�eo�;�'�,v
���P<t VgE,1Z2�.��oZmXU�
f��wd�]�+���q������Jn3V����!%g��[+�9�Ad�y�P��0V
+�d��
+�p�=��������;z�$	��b����x;�ɚ��G�&ۢpf;�wD��
+��U��UB1)��
�yHS�4���fME�><8?��ΖS|6�o^~{K��\�\�����?���,L ��
WU�{��E ���HϚ
#�KƊ;��[�SiW�
�����B����~?4�#�=4����z1�p�X�p����?V
���
�A�g 
��tv�_Pα52W��7��
^�|���||!�
-�k?�t���%�˩�[�cߑ2a齳�:LE���8�P�s���q�l�%j��+�P��[���b�؏�'i�܃���3��8��B��@1U����c[S(�d�
8�!v��|���A��T���#��X=
8�U��FJ�E쇰�a@�;jG��O4
��"x�\� .��(=��_fk7/��a��s�î��t�"i�Om�D ��c}w�A��� �j��w�yH��nPH�S��4V���r�ξ�=�(��X_x|;SK�o��/pW��"�jz��sf
s~�+V��9?R�d�
�W�LS �<�,9V4�d7
���Xj����31il���V܁%;ӡ�0�/t��
+�d!�A�Ulql��8_���+� �Y�Q?��a�H�G�$
+$%w@��~
�?NQ�Bd�F�lF �:_���
�:j���
+�1�{7�{7��4�ؠʐ�
�/�U�� #
�,��N � Y+2I�춪<\m�
D	躷:��#�j	�J�V>B���u_�dR�>�$��;�qX�qU���K�B�*���H���h����^�Ð�1�ڳ�'.	E-���Ig���ރ��L���6q���F ��9�s�n
|��
�d���*
�Da%f��NB��!�U���EϘ  v&Dŀ(�yӏ�ES�ps�)��H=�A�h�Cai����J-q
9$p��6���&t�==��������T���`�z
+D�!⾜i����N�
��|�fw�Z�/�~
*��;Ok�]���7���o�U�6�U�}Mێ��m��h�e|EiXY�Rn�
+;`kSM�x�jM�p0(�8��� �'��v��sX�S�� ��h�^[��57I�F����ӈ־<�Bz�MZ��c�
��!���Xz�
K�MцCϙy��VU�����������|�4D=�v@

}B�
�.�4S�wp�I�\
�Ԍ�v��j��	d{hw>!<����D�!��7� �`{׮�%�v��.-vVhMZ�?�X���%N����|��! � 3l>C<#��%�}O�T-�(;�FLУ�}�
�@YM��lX�k��qC��]{3
+�%�Á�W=.gB
��&�5�������C���H��c��Y���E���UBƀ
����?U��P[>ي5*���69
r̍��&�7�\�bf����w�L�H���
���v�Sx�UX��)z��W�28��#y���C<�]��u��j��PIO�n���o�G3pu����)ng
�V	
�_!��ҍ���qq9��15&H+ġ
"�0#
+\H�Q
p�����*�&�H�!W�~nK:���Sb(��D~ؚ5�ϣn��
+�}��_�p
�4d+t���,�O�Q���m��g��t}w;4$���A۾?���`�(l���$x3sݽ�E�pޱ���O�n2|t��
¼c?ֺ̻�МAa����
+m��K�����
�J�44Dm&t�.J.�Sx5g�^��8�
#�Cy6���ij����R]2���
SȒ�rNZ�d�%2�����ؿ��rL�j�l��#
3sn����@�I=�B�Z�p�q��
vAg�lZ�fdա�9,��� .��ySQ�)�Wx�A1MJ����x!�}!"�J�-
�
%+t
7ڈ:�:^<3��=�j.+�֭��)+k
��y��Z*�Mm
愾��Hc�C�֎	
+�J�?����9�|UAx�8X�M�hi|k+.�����*���U�
$b�X���b�<�x���!h����4�i9ۆ:q�
+�V�S���)�2
�o
+VUb+�;�i0.A��^��
��W΋BR�.A�E�ʹ_g��
:v�����P��x�돩���`�D�A��E��[+')M|�82׬�jud���\��/Si��2������"�_�Ȇ��.�C���U�X1�yW���+�P����7����$G�XO��WLY��ʇ9��"��b�gy��iXD�Ev�gAߔZ�3�
�vO%�(�i�
�~U
S�W1�gd`�#�Z�6�w)�4"p��i����v��J�7��M���Y1i��"�ΑĞ���LVs?��	 Wr%��㣠��/�1u��pQA8OP™
+�"�O��?������B�}J�~�Ak`��ǔ�T��Xe�ަ�3Ϋ��:WI�L��_����l�gl��-�j�ߏR�&2��� ?er<��B�Vt H���K+�)�Yϔ]�ګ/|2葽��t�bS.�#�#��%�
O�-�:FǕ���M\�B�e�d[��%��W4�b���P�c�/S�
�5XK���r}k	�c5�������<��0^������B<�s1h�Vɝ4F>����N�����	
������Oz\���\��#Z�:�Ո_=3��1�g��s:$��G��!����:�Pu0ܟ
+Е�
+b�R,�i�i>5Z�"����I 'Wi�ۂٔy|ZW����	�2
�K�B,d$F7��ܗ�,�LD�X);�g�\�@��Z-7Q�/��`Ě��k���)�L��_�f�����C�m"� �!��P˧ߒ[n��F�����y
Z�ɠ���0|b|�?' x=,��ne������ŕ} )<@�6�3�f:���ɝtj
g�X���~l]N�:v�F��7CO���7>��Gj�]��~ �iU�q+=�#������L��"�&������dG��O�ys�*���Y�!0ìyC��foo%��8� �V�҅��ł:lY
�jw�H�͢p�^���Kp\������#ɏ}=TL	C�<�̟�9!,��I�i5S{�3 R�K�%�
Rb��l��i�nv����"��;����<
��l�������Z�LK^*�%�M�� �(
vv^�R6�W�;��ᓸ�����mrq�E�B~u%��">�9�sw4�K�B���q��؞�c=
��`���s�]��s��T�n	��
SO�!�`s,�K�.���Fؑ+h%�s�<�Z��� [...]
����������Z(
_���sH"��Ɨ�|c����
��0M��_���<�M��v���\���f�YՉ��&_��R8�Bnz^�
P$8z�
`�7���y�������5���6������?���
+endstream
+endobj
+1012 0 obj <<
+/Type /Page
+/Contents 1013 0 R
+/Resources 1011 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 983 0 R
+/Annots [ 1005 0 R 1017 0 R 1006 0 R 1007 0 R 1008 0 R 1009 0 R 1010 0 R ]
+>> endobj
+1005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [491.531 568.939 513.996 579.843]
+/A << /S /GoTo /D (index_BHRZ03a) >>
+>> endobj
+1017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 556.984 121.432 567.887]
+/A << /S /GoTo /D (index_BHRZ03a) >>
+>> endobj
+1006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.089 370.145 416.057 381.048]
+/A << /S /GoTo /D (index_HPR97) >>
+>> endobj
+1007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 322.324 126.971 333.228]
+/A << /S /GoTo /D (index_HPR97) >>
+>> endobj
+1008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.445 280.789 242.088 291.693]
+/A << /S /GoTo /D (index_CC76_interval_widening) >>
+>> endobj
+1009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.64 280.789 327.726 291.693]
+/A << /S /GoTo /D (index_Intervals_and_Boxes) >>
+>> endobj
+1010 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1014 0 obj <<
+/D [1012 0 R /XYZ 89 770.89 null]
+>> endobj
+1015 0 obj <<
+/D [1012 0 R /XYZ 90 662.363 null]
+>> endobj
+1016 0 obj <<
+/D [1012 0 R /XYZ 90 656.346 null]
+>> endobj
+1018 0 obj <<
+/D [1012 0 R /XYZ 233.411 488.406 null]
+>> endobj
+1019 0 obj <<
+/D [1012 0 R /XYZ 90 467.45 null]
+>> endobj
+1020 0 obj <<
+/D [1012 0 R /XYZ 90 400.72 null]
+>> endobj
+1021 0 obj <<
+/D [1012 0 R /XYZ 90 323.32 null]
+>> endobj
+1022 0 obj <<
+/D [1012 0 R /XYZ 484.168 283.942 null]
+>> endobj
+30 0 obj <<
+/D [1012 0 R /XYZ 90 262.986 null]
+>> endobj
+1023 0 obj <<
+/D [1012 0 R /XYZ 90 206.22 null]
+>> endobj
+1011 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F8 802 0 R /F91 766 0 R /F11 621 0 R /F94 771 0 R /F32 772 0 R /F102 863 0 R /F10 773 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1030 0 obj <<
+/Length 3312      
+/Filter /FlateDecode
+>>
+stream
+x��[ݓ۶��Bo�f"
�I�u;9;�4mc7w�>�y�Iԝb��E*���]`A����δ�4��V�b�_?,�N�&t�������TLr�k�'7�IN'�̉�𵘼M8��t��D茰\Ïl��?�|��͵�������.:a�{E�l2�\���N�����g���h3�\�s=����
Y�t�
+c�1���W�r��t�U����yQɼ���f[W�Uug�t���r�˔��XwDU��
+�p
�/�w��\`sј]~�e����n��H�((�R�Q�
�D�<�!PD15�1"s�T+G���N�g��$�<�&��W��ynb�h�J��)�ir	�ϲ�����2�ȝ�?ޗ�2�Fr!;��p�d�K����:q��w{[/��o����3�%��H�T
+,�w��I�t���R)Is0w(ܜ0���r���c�@�U�
>
|��u��G��7�*a%�
+�xdryr�
+������	J�iN��gJ4w��
�����TR�&�@��O�]&�z�p_.v�}(�,�=�Xz3�I*�t"�ln��u�ś�!1Ax&ђܖW!���hI*P4�)V
中������C�UJ����֟b�N��
+�
������؄]2)W�̻��(QY/����T
L�EӀ���Ŗ�����}����n�����U[��
�A�3&��q��
�Uh��j�Hw1�B{�t;�
�J�^��t&�JhL�J�
��
iv$KG������
*�%���9�G
+�'�
�U�����DI���}<����	c0�"�ׄ�b�)��d
QQp\
��i��UK��YU1� ��\��M��M��c�Ɂ�Y at u,�p/P�:�Lp�y�b:3��5���H1G���sWn!�(A�]2p��
yM�a_VsG
&�s�	��c[�%x/�ޞb�Fh�����p�M�N웠b�o�1�>�1)�eqJ�����"���aKni��Qe�����4 ݕ�
���P��b�6)��	����b�s�A����ݵֻq��t��Q�p{�Z��<^A
+��5S��B��eF�4�3F)M��Z�&�<ss�˷��+��
 �����-��X�`S�uUO��P�� O.'Ʌɓ\���Ƅ
�i�^��
+�oB��vW�}�k����GϪ��;v쏖�ES���4�T�ȓW�^3*$i?N�
?:�tS�He���r��g��Ќ%dio3G<t���
�R��hHtJz�_�W�
���ȭ�`p=/^�z��ɩ!�>O)���ʏ�����b~�o#�$�8�"�J��*�
���w@�FA$
;��b�
+���b�X/F��
�������k���@?1�
+&��P���Lab��>_�=���*Ц͔ �m
�X��4Ƭ~��@v��za-Ř� 8g1X=�4���z�l�5����n;{�+sM���l	S�H��I�1�C��Cҳ��
g|�yv�$ٱ9�ع�/
�G�
pM
+e���i�S(�iE
�5:�4
�دێԩ~z,�

�z�F
+)<B�I��.Td]����/��k��f?�l"=�����Ο�,y��o慎
��j�[0�?�#2t�z�ݷEM���!xV�M�[�-O@��7�:
M{_��
Q���\�sL�����G�9
P��[)F�rM�)!l[�ͻ���S�cc��DL�F$;�$Gaތw��u��;�e�~m��uR1�u�O��;��r�^?tst
2�"�A{�Ä������0�4簻�/Ӥ{�D��V�#���ε�0��x^���-�c��������
bI;FѺ����%B�δ�>� ��V3߭�~o�^$&�[����,���Ky���וO���^��K�D�
Nx�]q
�d���\3'�y����LPKH | (��V<S#�6�	����N��w�h�0%��4`�E�t at r��ё��6E?���g6�48„��3�<�vg\���m���=�Y����0R3��)A��Ւ�>�{
�rp�pF��*�9��	,w���b�����:p;GO���9:�T� [...]
d�c><3�9j>�V��v�m\__�����J��`��
��ڰ�xi6�>\}��X�DF~��Y��gC�j5�\G�([�Tv�Zgg2�JJ�c0R�q4�Q鑺d>�KRˍ7^���IՇ��ә���ܦq�7:�

ߣ���;�����ޕ�"T����Ɯx�h*o�/��k����T�kq�p~~-N>~�-�=5��0��ԼY�İg���4'��ԐGB)N`r��Y�&�����^���
+��e�� ]��!o&�Z�*7+����j�*�V�
G�}���Oy���3�%bY�
+���=75
D?�d�
dW�{L� l�\V��!Ň��/�߷��; ��0���G�l3��%��
f�T �����I��G���EP��U>����WOqF)��TD�l|�
�A��� y��3�M)��@��
D��H}�5����D�'��*�4#)�\��= ʻ�o
���=��c��f4��@�����\�y��
�(����7�Oՙ�/��C�����
+���_s��I�����@N�9�Љ�<^���[������K�D��k%�8t'�SJ�1p2��
��-�	���/�w&i�^P�k��OPY`� $�vmdw��Ǡ�(
b�u�P
D��lWD��/G/nѮ�IF�ǥ�L
+j��n ���ä��ȵ���#P���bFe ��P�y�����d
CC闣�ld�"�P��B�5�3�*����Y�
v��>i?�������>��պ��
+���ÍɃ�qS�zy
����r?��k�]X ���ؔ��)���m�
��zm}
^��z�o�C��`j�،��
+�����#�r���s7"w�_=�On�� ���(�[��)�Ҷ���{�Uc+���K)7uӒA����� H��?	~(���oK>\�Im���w����5\�e#&/k�n����?@�@��aZ�1��w��
`�x�^�ٔ�?L�J�������0^�]kl�sa��?ʌ۴��hr]�N\��{��_��稐���y�o��ח�������(��1A��<���Ӈ�M����-l=�����
+endstream
+endobj
+1029 0 obj <<
+/Type /Page
+/Contents 1030 0 R
+/Resources 1028 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 983 0 R
+/Annots [ 1025 0 R 1026 0 R 1027 0 R ]
+>> endobj
+1025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.462 558.505 244.342 569.409]
+/A << /S /GoTo /D (index_CC76) >>
+>> endobj
+1026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.855 546.216 194.766 558.171]
+/A << /S /GoTo /D (index_BCCetal02) >>
+>> endobj
+1027 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1031 0 obj <<
+/D [1029 0 R /XYZ 89 770.89 null]
+>> endobj
+1024 0 obj <<
+/D [1029 0 R /XYZ 90 643.508 null]
+>> endobj
+1032 0 obj <<
+/D [1029 0 R /XYZ 90 643.508 null]
+>> endobj
+1033 0 obj <<
+/D [1029 0 R /XYZ 90 625.977 null]
+>> endobj
+1034 0 obj <<
+/D [1029 0 R /XYZ 434.16 549.703 null]
+>> endobj
+34 0 obj <<
+/D [1029 0 R /XYZ 90 529.681 null]
+>> endobj
+1035 0 obj <<
+/D [1029 0 R /XYZ 253.525 451.748 null]
+>> endobj
+1036 0 obj <<
+/D [1029 0 R /XYZ 90 434.117 null]
+>> endobj
+1037 0 obj <<
+/D [1029 0 R /XYZ 138.148 279.407 null]
+>> endobj
+1038 0 obj <<
+/D [1029 0 R /XYZ 90 261.062 null]
+>> endobj
+1039 0 obj <<
+/D [1029 0 R /XYZ 121.551 77.486 null]
+>> endobj
+1028 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F24 537 0 R /F102 863 0 R /F10 773 0 R /F11 621 0 R /F32 772 0 R /F94 771 0 R /F8 802 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1049 0 obj <<
+/Length 3688      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�ܶ~�_1oբ
�I]lE�Ĺ4A
�A�8y��pf�h�������=���m���hP,���ṟ����⫯�^��z�*����I����W9_�*g:�_���H��z-8�ћ�/����ױ��Wm��{��J	ɸL��}!�{�廫W:�JQ��l�=^����v���3�g�Ov�q�b	�j����+���,��ć�6
n�`Bxf3&
�?_�Yd�߫k!���S����ۛ�d:jS���[c9�k?}���R|���*��^�^�%P�6u׷�-�~]q��Б
�ы/��Ħ���w��`���mGc}sj��Pn����TMgv�z��8���G��1�8wg�
Iv�wk����g�x��O��@ P]�5	d	�J�۱RQ��`� KGC�r�[ӝ����P
t	�����QT�Gԇ���������+OT
s͔H�'��)����2�))y��,��&�L��,��dV�9Q�!p���:yo��GA/
����ߎ:��W�)���߿X��l����-�8��u����.�����y>7�]��)'c*Q3��u�1���&7
:O�����<
�0p]�����_�z�z"xp�#��4�Ph5����]�i��F�H����9���f=�;�U��%z������
g��T~���;!GM&=��UtQ�ՙ�Z�#��Β���Y�t��=
z���Q���O�.���0���y>�0}`sӜ�ON�-lvX���<u�s��W���
� Jаoj�Ł�,?��1?���M�rG�����Q�ʖ
��i4�)��
�ͮ[ߜ!;]�Jj&T�'Nع$
+A,�m���49�s9�)�
+��@U)KbE��@!s�mbo�G�:�x�h�	��𱵉��6�IqԎ�
����96S����A���5���Z��fG?v�
�roZSo

��
/v�@q�*W�u?7!�oM[����lVT!���L��
,B�]�@Q2�L@�I��o��e
�6d妁0p|��$���TQVŦ2�Q[q�g���6����^e����z>��Z��
$��۲�]����:�- ��s2��I@`��:��=����`��b�s��d���v-N�E�IQ�,�[)�
XMD.�Z<����րvhieyi)ʶnpo}Z�Z�A���zJ�<���\�.
iDz�����N;5��Jp(�E�*�A�k�&!Q5'��x
��5�P�
!�d
K
�6����k�gX����ѩh�*��kW�`�ril����s��17��}�k\kN�M�(_�`�]�|ws�_$�މb[-�cXe�������|��m㐶}ݲ[���94��)�b
NR�˸6�zT
.��z�ܑo���~<	����+�ָ�@ؾ�dh'E\&���X�0%C���l3_�
%?�3.�E+� =�b��
�O��o�:��ԟ[�-��U� ��
5�?��uq�@�\
m>p�'d�H���)�����+ϑDzrI.n	��M�
�J�M-�����^y-"tL
G���j�R�y�{B���B9C"�q�v0
�
FV�#�~¥K�V
�p1��۝Z�A
=�=���ڲ���-ͯ�~ݜzX�r
A�6�I6J��m��s���>�`�I��hB�A�n�.$�����E
<�Q
ŋ�\z?6;�+,r~S�aا�6+=s˻�WwF��ሃ)
��6;?X

�D$R�xx���^?q�S}��C���~�N��
'��ǝ@<��a�72��~h
�X�McW���<3.�*>y�*7m���+���_�����er\dB�Ӡ-;<�%��{��6X��?���[MJ�T X
E	ʠ��;u�R{p�Ko,j���_~�f�-�
n=u.;�%zD���rU��I$
��v�D.��t� #*z�����xB��OO�1՝+���r�&���X�����Z8(v0U���̾�^v9W,�"v�
Y�5%3�qv+NS�[ą9t��!T�V�
+�B�b�!J/6=�-�q�ut(�����/+G��ݹ
����Z���ݱ��o
<z��h��q�!���͉���j����G�
XB���l��4�������-6�A5	);<�� o
��9d�y���_q��˗i
+
++g�[
{
+'n?��c�֭��<EO#��zk�I
�͛�K��L�^���i$�t���&�)�_;�
�x��8��or��v�u�T�73���g@�`3��4����րu�q�ݤ�Y�A�N�utg�#yb_�$�e~��>���`��U	!T����i�n�L�P�	��6��UtO��0x�kځ�Y�F,dH=z�vt�(s
�5n���
T޿��k��K��(�`^Aw0���P
+�-O��̩D{O�;�\T��|:5m�*qo㪡�y�t3�
\{���y��+�,�i
x�=;�
/v����]�<��
I�x6��#?D��� �F[��_&�%*�W��9��)9lx�|�|�a�
���\蒍6�MY�X���UY��
�yP�-\v#�qo�_�,��C��h���.�'�at�"�2���6���x�ls&\��
(w
p�r�&�~3��BT�����ۧ\ʘ�|�y�%i���$rg���V5�1N�s�x��:Z�
+�Ց��$��by6�t�	Ь����M��
Lj}����>�T
+y8^M&mBG�,M%
hz3��#���
��$*�栌<��fZ���IPi*
m�_��&<��r%�bzd�� 1h
w4!�)��G�
�������
ғ
]�
+�1����·�	|P�۠^s��z�
�B\B3>�яA?K������8[D͌�S�9<��Y��K���X��]D&���.p������g!/�Y������P�,<ɭ/�H2g���ԝ�:#���B�ї
v"��,���T�q=�#muۢ*�.���
+e��ƥ�P��b0�4�*[�z��>�+)w�($
��Y�k߄L.a�ZX|&i�䨙�!3�
`#a:H�Lw�nOك�;���$oH6�`t<� 4��N���W$�X2
+�X�2lxV����H�i�
9����s<�`�ť���Ϯ���#�2(�.1

L L�Hkp�����ᢕ�H>�P H�L3s�
���xV
�k��ͻ/|�C�[����Y�e�Iz�S��cXc#<,/k[����0Vҿ>�>&�A�aLlN<
@\��hO=�y � ��,��10/S��0u��?��
+�
+�H.����:�}���#�S�
p w{�,.
�����
��-*��i��# >ѧ�%�%1�;Y�E��/~
r[�''T�X��im�D��7a
�B4>P� 9Ma�p����}po�f
����G{���������&�5�EU��ݭ��L-
��Ҕ�C�L��@uo�Y<z�&��4�m<.��
w&��K�����Uޕ�
���ezxoO �Ž��1�#�m�r����ٝ�s�j�x63
3����Yܧ7ؒ���;��a�
]�:>�9tm� �����ٕ�
�
^<e�	����&��Tsz���\:�a� ����0��z�>����쪂G�_G��:����ݑ��E}�4����L�Z��go��
O[Ib���o��*�vDʙ�F����gO�n·���m��gLYr�G'����pP^�x��T�>>���\@)��6@��`�#R�~�oҶ��E���\}р�ǯ��
�e�|
+endstream
+endobj
+1048 0 obj <<
+/Type /Page
+/Contents 1049 0 R
+/Resources 1047 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 983 0 R
+/Annots [ 1042 0 R 1043 0 R 1044 0 R 1045 0 R 1046 0 R ]
+>> endobj
+1042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.191 378.503 208.619 389.407]
+/A << /S /GoTo /D (index_CH78) >>
+>> endobj
+1043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.494 378.503 511.506 389.407]
+/A << /S /GoTo /D (index_BHMZ05a) >>
+>> endobj
+1044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [460.906 336.968 492.786 347.872]
+/A << /S /GoTo /D (index_CC76) >>
+>> endobj
+1045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.084 254.77 458.091 265.674]
+/A << /S /GoTo /D (index_BDHetal05) >>
+>> endobj
+1046 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1050 0 obj <<
+/D [1048 0 R /XYZ 89 770.89 null]
+>> endobj
+1051 0 obj <<
+/D [1048 0 R /XYZ 90 721.073 null]
+>> endobj
+1052 0 obj <<
+/D [1048 0 R /XYZ 480.711 449.906 null]
+>> endobj
+1053 0 obj <<
+/D [1048 0 R /XYZ 90 433.428 null]
+>> endobj
+1054 0 obj <<
+/D [1048 0 R /XYZ 90 409.074 null]
+>> endobj
+1055 0 obj <<
+/D [1048 0 R /XYZ 90 355.589 null]
+>> endobj
+1056 0 obj <<
+/D [1048 0 R /XYZ 438.959 316.211 null]
+>> endobj
+38 0 obj <<
+/D [1048 0 R /XYZ 90 299.732 null]
+>> endobj
+1057 0 obj <<
+/D [1048 0 R /XYZ 505.567 216.389 null]
+>> endobj
+1058 0 obj <<
+/D [1048 0 R /XYZ 90 199.91 null]
+>> endobj
+1047 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F32 772 0 R /F10 773 0 R /F94 771 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F102 863 0 R /F99 864 0 R /F1 834 0 R /F7 803 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1067 0 obj <<
+/Length 3629      
+/Filter /FlateDecode
+>>
+stream
+x��[�s�6�_����B|�t:s�6����|�t�>�6m�'Q�('�� ���ع�?�&A`����o`1����'}w��'�g�������3-
�
+����6gl����g\��/��?��w?���}v�㻓?O(<*fԿ/�.g��~/f�p��YA�)g]��L0���ۓ�'E*
+-�HJ	�~�ʎ��'&�&�Ь�J�e��}��<��t�S�[�"ia�o�l�d���nj��Wծٴ�X���-��qRjѷS�����b�օ ���'D
��14h at j]�����A�y�t!`�fKJ���"�&��Y��
Q�"Z
b]��u7R^W������VW
&羱�s�����z{����^�t�
��aZ����X,�Ҷ�Q	e��/K0�Ǯ�<�:�g���vQ���7�!��s�Q��
҃��}�
u���#�,*
4�,��s
\�׾pO��R�i���D�H�d`M4J�(�$z�'��
'�(�i�{:�֊e�t�,IJ�R�x��6�#\��1����WJ��r�8ٴ4)D�|�-5Ѣ�ܲ|�+1(Ĕ,B�T
ۀ� +���'
+d�Z~�O��@,�t��A�]�X����r^o��Ē��ߠ
J�U*l�E����-�VU{9��^���,
�i����&.2���j^Bx5�b��Ԅ�
������	�q�ZA߬���6���6�����L	��zzg%�0
�ӕ�A���OKA�]i̿��
e�iU��jI�,�VC����7Y��D��V�v�u�w�A
c�.�0���q&�vu�o���Ʈ�z�*<��t,�)B?��׻�!��ل���^�6�дi14�֯���M��@��ս������5;�T��D��.���]��L	���TN�E��Ŧ�����ň��G��&l ��{�
�N���f�x
x;E�҅��"8����ٔCCk�3R��jdoef7#>2RN�G�G�m���L0�
D^R� ҿ.J���
W�& ]uߣ`�a�@����j���
c{����ms^�=�Ǻf �mL�*~HR���QwF�3�^�
+�����j��	-��Ї��.?
�
p\"k##��xi��
:z�n��Jbr���{])
��})i�
�5V���1���.��1	�;�T�o�w�%��)��^�e�0V��
S�"
+`J$+����S�Dy.:<؋�@
�ay��Lؔ�d�Cl���A�l���Wn�%1�R�iҴ?�	5���N[/�Ǡ�:NvԗK	R
���C�]Gnݴ�]�ow��e,O]2S���
\�	Z�>U��U�,8����&��)����߯=�rCJ@�,�²�I.��Ϫ���|B�����{���Ly�5>�M�TG>�²�l�f�d��m�k��Բd����t��?j��Ĩ�Qf�4�m]��V�
U6�����<~IE@�� ���}��
4{N,��W7{�
����r%
_q&_���y/9��j�Thl"4B�9�����zle�c��Oy�U�/>�B��s��>5��0y���v[w��,�6�.�r
:9�<�o?�u��O5���2\T�0X|-�0�N�X����4���_M���r�
��/���WZ������^Mz�]\G��-�/
��� �Vw݂ν^t$W�yQ$�QlwC�!�'(�3}�n��EL��NS�b*
��.ЂP	��yt6m���{_���Msq�Ӆ�+e�z��d�
OfyO��_;
j��1Z��h!�?0Z��[`_�;q
�[PJR&[�/�t|��q�n

���P>WJ:o������^��v�E%3�\�.�d���>�4��i�
[��S#p��
#���_�*8��C�|a��
+�LS����ߵ͇z����0�"e�}�N���Q���
�[ �f[>����u�
+:A8*�ǯYL�*�24&`� )��	�%���k4QN�G�]�$��Pwձ��C��U��˹���6��
��ذ�rڣ
1>g�v�)#�
z�0
"��+��$�	�����%B-rn!T�?^�ͽo��?��A)��Ī�'İ����
)�mX )�ޒ5'1��b��09�p
 �=[55&�G؛>V�m�*�FR���R�4�6se�"8h��Pc���6n��kY����݌�e�cU;�f��A؜R�<\��=�>
Uƒ�X�6�
+L �1�\����㄃
�.>���r��;-�j"t�^9ö�|+��
+l9�� c�M��t	�\�ѱ�%1!g
�ڌMa�Mc[��
+�$����?��)K���U}
r�c�Z�` ����� /PS��qn�b��""t^�M�¨���*����{�+�5��oң5t�P�v�
�}};;)P�J�D
4x�8}�o�ݰ��Ǎ��n��T銁c��-z��L��%E㽈��v KA�3D2[a3O;�
+R]���� @FLy
+E�G**�>x�nm��!v�
;������	0��z�$�(,�
|����{z�j
�MJ�&��=Ε�q����J<s�Cԍ�ĚN��E�ng
*Et�<u;[�=�m��w�g���}����i7}.��C��~p{'���@�d�}r�f�ؒ���d �,���ɼ�oKY
�=
�~� �-~�'�K�w5��o�ӓݼ4€
���>խ]5����#�}�9�Zn����j���=e����U�~K3��'�`#>Q����U}Q����xSok�F
+\,n��
|�ɖ��>AZgX������

(V1�~[�3#����N�]f
vj�X��/��/y!0�0}`o?Q���i
� n6d

�����#�<���LD�J�BY~�0r�#\��� �|l�f���m$ÅC�� u[�Y��ѰG''
�,y0	�=����	��L��<�x��O	�
+=X�c-i�& 7�O�K"����
z��V�B8?Sy�ﭚ-�i"�6��pv� �q�(V��#�
+�1� �)��
+���
��0��ݡX!�!��2-^Hl
�3u��L���S����o�Ӏvm=����XYX|�]!͏�Ħ
�y�A�����=�#T��+�6G��4e�y�!��L)�
�ۗ���pU����uy��Mm7��v7|�q��x
+M�K��^Cv�:��]K�(=N�n��
% 7�>�(�@���u�Ώ�
[R���<�uȭԼ�'�t0Nw���
�󗮟l��ũ6󺺸I���
U̕e2�j��;�Ʉ��7
Â;��]=��n�
+�V��n�pxU����^Dغ�~Np#��Љ�޷q�!�o��Sح[E!
�
ْ�uV$���l�ӗ�夦?q�ͩO_:t�������4�b_����xZ�t{�n�7���l�3���cA� ���p�?ߺ��-�?����:�m�F.R�����S�У�J؀e
B���E-���=�v@��|�}��
#�ZB
(���R�<�&�T���]�_F(j�NG~��(,t�T�yb�t���%��a�N���՚�����bw@�g�ء��
��9)�S
H�
��sXW>;;�����_R΃���j�z@���?� �
+a��J
+���u
��e�� ���g�2�	(�(�e���n�}������5��F����_��s�oׯ7=�5-�\;�%��/��
+endstream
+endobj
+1066 0 obj <<
+/Type /Page
+/Contents 1067 0 R
+/Resources 1065 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 983 0 R
+/Annots [ 1064 0 R ]
+>> endobj
+1064 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1068 0 obj <<
+/D [1066 0 R /XYZ 89 770.89 null]
+>> endobj
+1069 0 obj <<
+/D [1066 0 R /XYZ 393.496 666.42 null]
+>> endobj
+1070 0 obj <<
+/D [1066 0 R /XYZ 90 648.038 null]
+>> endobj
+1071 0 obj <<
+/D [1066 0 R /XYZ 322.875 448.869 null]
+>> endobj
+1072 0 obj <<
+/D [1066 0 R /XYZ 90 431.843 null]
+>> endobj
+1073 0 obj <<
+/D [1066 0 R /XYZ 222.161 348.253 null]
+>> endobj
+1074 0 obj <<
+/D [1066 0 R /XYZ 90 332.622 null]
+>> endobj
+1075 0 obj <<
+/D [1066 0 R /XYZ 90 190.277 null]
+>> endobj
+1076 0 obj <<
+/D [1066 0 R /XYZ 90 183.142 null]
+>> endobj
+1065 0 obj <<
+/Font << /F73 560 0 R /F102 863 0 R /F24 537 0 R /F8 802 0 R /F99 864 0 R /F60 540 0 R /F11 621 0 R /F10 773 0 R /F1 834 0 R /F32 772 0 R /F91 766 0 R /F94 771 0 R /F7 803 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1082 0 obj <<
+/Length 3631      
+/Filter /FlateDecode
+>>
+stream
+xڵ[�s�6�_��{�<W!� H�7�N�\}�='N��>P-3�HU������ł$@A����3& ��b��]@|�������o/����I��T������O�$g:��r�n*��3�9��g[�}����Lj>mjz���ŚjW�j�
R.�T�����t�Ϸ\��O͠Yf&��Ż��d	�?M8S��|��6�D*x�'7�/�Ol�G�
+�P���]y9S:���\���̛5��Bb��h��b2�ax;�ߩC0Gƀ]��h�eY7��
M�sU���K����W�ZO]����J�c��摉7�КI����r�d|*���^O)�1Y��z>IY�)3�<,��UGVfX�'^�ʑZ�c�o+�V��T��kޖn�7�{Q%a	N3�I�Y�P `톷4\��VN�\]L��ϧ�nwy���D[�^5΍�u�P�z�l��r�s35���,߿�W�/�\�g
	l7���S�f��v]

�L%pNu��Lq!�^��,���Hi6}m����xT%�̥7�������MBۢr<�;��
+"��M�,ME7��[�B�-�rw)��7;�O�&�&2����ݗ�}2g at x7�-
2���J6��(9Si�J+ h]>��ed\�X���5�����9
���jU֧60aJ�O�A���X�#

�m
2�J��_�� ���Q���
6�m;fA{��p at p�$�c���Y������;��-�e�6���f�z�[Z;	p�����D�<����Xs�1̶l��޷�ŊD2�z��T@%�E�=�}��OA������9)K�Q*R at NzL/������)6K88q92�
��C��:�Ap
}�N�;ש<�)$�5�s�2����Ȥ����R�(�!c��~
p�&
�v��fSv
�y�š����tO��IF��Y���c�0�p
���� ��
La�v����$>���4�3=��m�%,M�#�<��
G����Q�z��}l0�J?4�y��� �]��XE�-�F@���,��+ ڹ?#�=X
+�(%��r�h�
 �V�꿗33-��Jc#*�)���-�
|�5��z}w��w삀_�{��y�el�	3yχES�v��^ .�u�_B���

�(6����۬�s �Ո�!U��
�R��A�%ѵ
� �l0.�J᫖fFf�5R�L1�ڗ
�q���() �{CĜ`�}w
+��}z��d��-�����@�r�#���穷w�DK0�2� x�O�
|�X��aɲ<�0z��8p�D����T�ր�P�e���uS���vOU��tW����kӴ���L�E����^Q��e��Q�+פ��vyso`��bH.�d�#�P��q����DNW����VOڀ\0=��(�
(y�Μ
+�q��t�1i
4A\�L�

�U|d
+��Dv&�#n��G�UDARpɤ i� !�ڐ~����謰��I�Q<�L��0�	?w�����Xϳ�x�GCՒ
&�(���`ԓ�W�4T�l�/�i�έ�?�������7L�,��x��Չ0Hz*3���!.}�4���Ѻe�����15�|�~45��&(˽ܥ�qcI��>E�/ξ�
�?/�e"��ԕ��|xǎ�
<����C'i硡Tt)1�r����m�����y����n
*hv`������fj���	2�9K
�}R�|aJ�4fj 
��Ԯ��lQ��o�]�)��C
� �5��k��yDÏ̅/���2��K
+8^��bWm);�
��д�
L��X@�"n, �L��O
����}۬����@,+X6����'�u"��
p��I,���x6�
ϥ]���
6�t&�
ڪ^QS�S�Ax~�H.�� H���'��;J;V!�M
�~O��9�e�І��U<Ŭ�����0n��pt���ٺ�==7ea�Ϡh����|e$�� ��W�%ȷn�`74l��M���ŋ�u�
f�� ��,=8��!bS(��Sj�# ��	X����Ty�JA��F9�1�I�j:1rZ
r"O0XwM,��
�)��N�N*e�36�X4�uw,���FSh
|_-�Q)4����޻�ɚ��雖""�a�
д%��Ɉ�"l�m�������A��2�Ѿ̲��W4hMo�����Ces�e�?����a,�/v��b�jv��n��
ZE���l�������s:�����(�n1/��Rz��L���	��Jᜣp5�
�!@!���w6n��
+� �*�8�&|�����P���=b.;���ߖ^U�:�Ɔ�v]n���6�w��t�ْ�

�w"�Ig���v��&8�{�
�@����3(��y �8p�-
 �`٭�� u��1C��̫u�ɒ���F	Ϸ��ȖT2�.;:b�3�[g�_�n�LO����<qy@�A5_��@
+Ìo��	P:Zax��>���|1$`b+��鐿�%���#>��-�
h۶�����
)�p:�i�"S�M��&�E1�RĘ��s	��!��|d��RHf/F�c���"M���ާ��%����GS-����X��������u5�跰R�^��7�eM����n�t��|�T��[��T�e�,�%��;;��}������

D�
L�pCcH�FӔY���h���
‹Q��A'�C�mH��9�� ��N�FL�f�p�[ 1e�x�fg��g�zR?���[-� R��~�@����[K"p~�>@�#�p
�p
�~&}�¶vߞ����3cd'�
��
RgͰ�)>U�Æ*�a3/��;@j8=�I�&�kR�][;�Y�J��N-WQ[� �R�\�e�Lq�F������C,M,����1�*��	P�ᐗ!�)b���L+�,(V�3x����(���?񬜭NW64�:�g?��� �'y���N�]q){y|(�!(�]&�^I�j���g�_T�#��i� [...]
+���9X�k�}L��]=y9;[c��@�� �_�A�� �/��Rw�h0��C���.y�-	z2
n>��xc��0�,��]مN.&���gյ
cTm%yz�#�zŽkޖ���emM�v�
�Q�˟�s�qզ�̦+{�c
P]��*x�����s^,��hlr��]@>)J��@�����]��Ǧ�ۏ-?
���g���
+�a���\KҮA����[Eq4:�e劖[�
p+�e���� ���.GB�_�
�����LJ9
a0����ywkytx����~��D��<���!��R-��������L��Y����WBO��b��P��>�.v�*H1����R��A��Sԫ�o#:$��
�!�<1\ܙGog�, |F����ē�MU��˄��;��E*����آ����4M܏,��i�?D�hg�[�¯m��~�������)�U��l��X	���+P��^������o�����A�
���~�ͳg�ê-�[4�c�%g|���t�=X#�	7k�Y�ӕ���
����0�0�\d6�^پ�>t
�^n��EL
~��?�H�;
+endstream
+endobj
+1081 0 obj <<
+/Type /Page
+/Contents 1082 0 R
+/Resources 1080 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1096 0 R
+/Annots [ 1062 0 R 1063 0 R 1077 0 R 1078 0 R 1079 0 R ]
+>> endobj
+1062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.832 695.668 133.366 707.623]
+/A << /S /GoTo /D (index_Sch99) >>
+>> endobj
+1063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.954 695.668 292.961 707.623]
+/A << /S /GoTo /D (index_BDHetal05) >>
+>> endobj
+1077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.78 154.853 389.769 165.757]
+/A << /S /GoTo /D (index_Operations_on_Convex_Polyhedra) >>
+>> endobj
+1078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.559 86.288 333.579 97.192]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+1079 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1083 0 obj <<
+/D [1081 0 R /XYZ 89 770.89 null]
+>> endobj
+1085 0 obj <<
+/D [1081 0 R /XYZ 393.867 657.62 null]
+>> endobj
+1086 0 obj <<
+/D [1081 0 R /XYZ 90 640.145 null]
+>> endobj
+1087 0 obj <<
+/D [1081 0 R /XYZ 116.849 523.611 null]
+>> endobj
+1088 0 obj <<
+/D [1081 0 R /XYZ 90 506.829 null]
+>> endobj
+1089 0 obj <<
+/D [1081 0 R /XYZ 353.539 389.602 null]
+>> endobj
+1090 0 obj <<
+/D [1081 0 R /XYZ 90 372.82 null]
+>> endobj
+1091 0 obj <<
+/D [1081 0 R /XYZ 127.27 309.082 null]
+>> endobj
+1092 0 obj <<
+/D [1081 0 R /XYZ 90 292.301 null]
+>> endobj
+1093 0 obj <<
+/D [1081 0 R /XYZ 195.948 228.563 null]
+>> endobj
+42 0 obj <<
+/D [1081 0 R /XYZ 90 211.447 null]
+>> endobj
+1094 0 obj <<
+/D [1081 0 R /XYZ 439.645 146.051 null]
+>> endobj
+1095 0 obj <<
+/D [1081 0 R /XYZ 90 129.269 null]
+>> endobj
+1080 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F8 802 0 R /F24 537 0 R /F32 772 0 R /F10 773 0 R /F11 621 0 R /F94 771 0 R /F103 1084 0 R /F102 863 0 R /F91 766 0 R /F13 835 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1102 0 obj <<
+/Length 5073      
+/Filter /FlateDecode
+>>
+stream
+x��\[��6�~�_�}Z��E7Hv
�2ve6�x�Sf��-��K�"Jn���= �
AIm;�-W�I�s���g�|���?�ݼz]���TA�ٻ���g%W�(�n=�eN��o��<c�̈*�G��?��ݟ~x�3>��ӻ��n<�g��^d����7��-����ϳ<cJΞt��S7��o�r���yD
+!!f��~A���yN�z�d��U�������Z���k��F�eF��k�
+�I�}�2����='y&H��&�sqX�r�t�>�NlVd�d;��P|Ʋ����GʽN�lYd��aޏI.��P3�IJ�)�m_챟�z]X&K����Td,}�oSC�S���� �Ьd;4�w)�\�!A���;܍��g��������6�v�Ӈ��uV�)�3%Ȁ�M���hAfK�׿$�"��9����W4���X
#���}�.��?����i��u"9�1WNdD�בq��`:�
�
XS͖��!��;ǁ��N�.��(ak�Oa����oM��BQ�,d0]��=�)*܋�B��]d��}��(��!�a��x{�.�s�&�;״v���]��J*t���y84따Kص��1'E�]J��,�+�%L6�
M훀
��\�kX@�e�r��9�#�)�S	ݬ�q1[�T�Ʒ	α:rIa_��`*\/"�^ߞ�f<(u2H�SKF�
�`�)�B͝����{K�$嘑`�S�5��&�_#�H_V��,m���/�7ė���ޠ�l���0�E���∌2�__�Z蛄�/�B��" [...]
U�~w��1�n;d��b�J�:M�
�vU�{,��[{hmfw��w
�
��p)�8�P�[�	~�	�̤
�Ύ:�zm
4�}�h	hw��Po�;RmL��Ewk�� �<��9
H��K at B
�P�(�=�w��]}4-Z�<B����X��*a`05��R��){ �
_����$3)b^�S�����Q$�VJmz�.��EHf_�d6Arq���SWyD1�� $!)���?U
+�S{
���`KJJðx�ڵ]
9�?��Mu��=
+�DŽ"��o��ʑrO8+Š�h ��v
X�7M[W�X�"��?�]��	�֓�[`���,	w���g)�Cy�����b	�MS
����-IOX�'L1x:�
�;��rp��i�p;��}*�#D�b;�]���%�:�&}
HT�5��9�	e&h�&��Ԯ�$Y���X]�Sө�e4�]�sI�̷
�\\[T-(�en����X/
�ĮO�fcY�1X�:��
+�S����C�ǁ�,E���L�p�~�,Ij3"[MH ��T�#
4
+��7�ASJ������`�7�L�o\
��7�S��Ķ�|�U��v��
��Ά!���̾Ɂ�&yZ!KV~�u)���[���� <
�<=6�G�{���-�ҁ-��H���dϩ�d	��X[��N��x�+����$,!es_
�m}�	ϋ,g�5�,����	9%OZ��n=���9��"5��� K�z~<��}``�6��-�Rh
> ��7�2��׵�ks{g�
'�@Ňé���w�ݱ�&����+����+�W0��xAܒ��:fk�@K�e�B#�����c�8sq>��ʁ���k�W�U>S�*oq���d�X����
1�����
+6�E�x
L�^�h���֙��||�
%����6�X�ӝ���҃H��S� "YJ4�����2�tnK��}�z�^���4v�Ô��L�$�a:�E�<xg�s$
���+�"�,΀����ډ��;�{k�h'�a4
x����.�5N�c�>��	d+Ე/B�4�
*�>�ղ�cm<�:�X5��
dR#{�������QG��w�u���Ϫ�}ݵ@<
��t{�, a4���,
Z���,#���$�Ƶ9�Zm.�l醶Ny�࿒2.���l�s2dB��5����x��܅����8���
�De��^�
�yqz���9
��0<�&T��{Q�h���D�Jv1Th����#Z)ł��,��2��K�^C6F�(J2D��Ux��	v���6-�~����!h�:���;z~-����촦c����qp�CgI0���7��3�Dh�j��뜼�$�Iw�[��h���:�4S*�fG�k
$E���1~ɴ`
0J^ji�����)v�����Kdt�B [...]

Сe �>�p��áв;4�N���I<���$�C5�s���{iN�?tTi���$;�:��G`F���J8\��W���E���т��R����~h����CS�#�yW��[��P����`��$�Td�#�%��d
ن��9��j@̒1Ļ"�𗄏c�"��e_���Ey���E�2��
�e�&�Y�O��M��7�+��+�utGs�mdN
�	�^'����T��
ĵ��HO  �#&�Wi&�Y<��
g����ؗ�Z��2�vx�`!�lqi�  �7�A;y�s~���3Dtyo�91�a�������<Z��A�WM�
��
¹8�~���}r�A����`π�9��sʭ�p?ɝLr2���AܹNE��>�P�q�dR��,Y��BMk
���6=4�m�V\�ñZ�� �X̋�ܼz��E��c`�y/�>��<��с�M��R�MxP���~���V
�u�Cgf�u�Ѣ�< 3���Q?7�fS
L����»wЫh��w���z}�L7��ֵ�˛����77�_�o�M����j���M�O�, $�ˈ�
<B�Msw�φ��;�OX��37��cC�l���� 9�{6K�����Xr�Ѩ0���B��ק�Z
�
&����rxoX(
w�
�s��j|��=�N.�
X�U���vهj��q
p-�n���I�Ѕr'	�O���)a�A�I��s
@��<v�B$tN(�!�b����� ;��� [...]
��>e�ț��
+�\Z�RkCG��l� �q���j����z�҉i�;�z��<I.'�N�A�b]6�1P6���8�f ����ĸ�Ң�s�qK�U�4��FK�

[�
XS=�vl
&y���̫�	�R��o���{��A����KP�D*u�4�g��nV��
�����۸(�ŷ�V
�-:a@ƪ��u���R^
���
�2R�$ �gR��~HJV�
���
U��!I�^��͌d�#�Y�x�� �~a4n^���9�R���$VT�~Y;}���dwq�ȕ���U*j�gD�89q����zFbA�૨�I�ʉ��
T��������H&u�����ɥ���~E�>� ��fJ)hմ��$���
�6:8���[���jeҺL��ʤ��q�*&�0�����O� 
�yg4�4��X�0�3��"������pB&�+q�&yd�x�:s��)`(���{��;�	�=;mu5PMh�B�����<�:TǼ��H
�~?�)q� ��E&���O�L�w���ܩpq
�:Wmק��L�<�3
w��v��>lY�V��[�v'���(D?����#Vw�u�T�Ϻ-�NFّM`OM����Ɔ�10��x��y�/Bǯ�U��'���&S^��`Kf"�Ȝ��t�4�Y�I^����|ؘ���hFH��W���u!ƍ�L�+�����11s�K,�=s�3�¬�=AF�uț�Z�A:�|�l)$(���1E{} n��բ�?��ُ^h��x���1YP
f�
���I\�����f$��F�eP�^s�zG��C��vԷd8�B'|L
��6мG��?�Y!��O;f/8�p^������� R�������׸c� aZO����`����D���mS:�(�\E�_a�*dh��By��*H�a�U�.�xk��:��
�P�bҀ�3i�V�.TЁ��|�W�8>uK�jSV��"L�M���%!�۠�i� ?�%< ��T8���
%�� ��6Z�m��ٞ�)B(pg
���;HߝtUs1�=Ko�Y��g���f݅��pE�8&��%�஄�����>��S [...]
H��`������ۅ߲Y��9�ﳁBW{�� O��.���ѧ�2�s�2�
+\�
y�B�%
P^���W¾���:��s4	�
�)��b��
��_rIJB2�n�t�lC$>��@
m?<�W��mk�c���7�Y�].��_ޠ{����>��L�
��T7��S0���~��١ڞ���
��n��&���l�m�&���nu�
�9~�w�վ�l��n�4�6������G��q�.��A
���U�՝_�m���#�ū���+�w��zI
�^g�<f_��(�j`i�� ��K���
~H��)���͡�@E�ӎ"x�I�M�Q
.9��5�q�9����9M.do��hp�
>:��(�d�̟S�����Ev=�$���(���p��r"� �]��m�h�����%��@^
�����8�� N��K�F��u/2���x^�G���M���]
�LjI���zԃ�
'��]�y��&r�m�1��
̧�� \!�*Ym�-Mg�O)TC�+?����|?��?jb���ϻ���؆W�m��v0�n	�-݀����w��yk�
����|�������^��B������ړV�p�
g
ʺ��
|�����<��@o�<�b����7~�R�4�wƝc�x<�y�������C��m�A1�c���A{����vקߛv��m��L���
+endstream
+endobj
+1101 0 obj <<
+/Type /Page
+/Contents 1102 0 R
+/Resources 1100 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1096 0 R
+/Annots [ 1098 0 R 1099 0 R ]
+>> endobj
+1098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.336 385.337 346.916 396.241]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+1099 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1103 0 obj <<
+/D [1101 0 R /XYZ 89 770.89 null]
+>> endobj
+1104 0 obj <<
+/D [1101 0 R /XYZ 225.341 448.813 null]
+>> endobj
+1105 0 obj <<
+/D [1101 0 R /XYZ 90 430.994 null]
+>> endobj
+1106 0 obj <<
+/D [1101 0 R /XYZ 150.808 269.192 null]
+>> endobj
+1107 0 obj <<
+/D [1101 0 R /XYZ 90 249.316 null]
+>> endobj
+1108 0 obj <<
+/D [1101 0 R /XYZ 453.524 77.486 null]
+>> endobj
+1100 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F1 834 0 R /F13 835 0 R /F10 773 0 R /F24 537 0 R /F102 863 0 R /F32 772 0 R /F7 803 0 R /F94 771 0 R /F91 766 0 R /F9 880 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1113 0 obj <<
+/Length 3860      
+/Filter /FlateDecode
+>>
+stream
+x��[[�۶~�_��N��ƅ ��i�M�L�t�8�t�v�Õ(-
��E����
\H��(�cg��R$���\��C:YM�䫛���y�4����ɋ夠�<+�T�k1y9e�����N��U��Po��v�%�n{}n
�k��}���21�����n�|q����t����z2�ܼ��N��لQ�Ƀi��d\�u=�����&K	�x�7��
��`���9���_ԛj��ܵ̍k�����Ϗ�䩢A�t2�Ya;|z����,�l��;���p�@
��� �}�gAo9'J�Щ���"�(R�BcEt�'3F�"sK��X�ʌd���>K����0���.��i#�C���~��܄i0VN P�X�m�Z���'N���m]�3cQ��
ps+���=g�d��]ux��&�Z!���QBc�ᠽ
+�Q6��`
;��g�ⵑ,OmQ5�C�W��}@x��h����s�����kV��-�n{
t��P�;� �F�A���`�
 y4�
ר	�mÝm��6�pʼ����Cs���\�FR��N�o��D����yR�X!A|
�5�.��
+h"���a+�pz����*�o	wɕ��}���pP,�A�
5r�2�q������S�WMi�T
�|��D~���;�gV�c6'%)I4�����h��
8�/��1�ό"��R:�
�)z��C}�xLƦ�#��
��E1]�w�r�.����~��m��Z�z��om����|~_�����e� �߻�����µѝ�7oJ{1füE�ܿ����Y�U3���X\�NI����iU5N�V���=�˺9�i�~E%�m����~��/�LZף�Sҍ�ŝ1���m�w�
z��&���n�ԩ���i���b��q~�MI0�
H�H�N	坅�������v��g/a;V��=T�n_��U[5ܽ�
�H.�h=�k at ng�g���l����
��C�ԃ�d�)��-��'��(
+����	�ugK)MF`Bzy�2a�O�-�L��+�58k;C�sb&
+f�uQ#�Z-��%
f�[�21)m�M���TVṊ�MEK��kb�-w0*�h
.�P��1N	�0����Jv�~
�::\��V|+����񚯂��t���<�8Z���*����
8�
h���� cУ��[�_^�n��G�L0�>���Uo9	��ɡ�>fx�L
+g��6�{,�.z\n���-�Ӈ�D�
��7�Wi�xk��qƪ�ʊxoD�vQ��������uVt��nN��A�R�
+�qB���^�C�< �������Kh
+xr�D�'U��nG���D̃����I{�d��w.�/�
x�Xt�"����
�B:lS؅��w)����˪Fd��p�r{}
��j�;��	� ����8�U<�z
��)\�K��a�s �0����h���=�c��F�Ȍ+
�`!�Wl
�I�
7h�6u��G~?$>�NC�X���1���"'B�Pm��jÅS1�6��D۝T�����j
��讥�4@?��`D
�9�
+
zՃV��_�r�����Hz(J	��#B�Xg��!��u6�9�f�>.|>'�
@�E�7I�̣����FuD"��I5�Ry2�`��b������*o9��{�
+@��O���f0]U��AAXYx��>���p��B�C�pB�d8��ՠ�.O�8���1���W,S�¼�s�[����$����Op��|��8a��z�
L؈�ͱ\�>��y��/�xދf.�͆'
B��ED�K葐� �r
�<�Ca�
K;L�<A�dl�zog�{�7
x��9B"�fS
Bv	<���V}j
�[2r�i�'�	��@|.E0�?a��{n
�-�����R

�s�	��dw�yBq�
\�Lt,S.��� �)5{���_��D� ��gDߧ�ox�ݚ'm��K{�!�l���~�.�%�
+��@�Y�œ� *��d
d�1��2l<��.B<�X��A]O�
�)��0��=>W�?x� ;�DR$
.IẐ/J|�pY'd򗱮H]O"�L����q�,"Œc�Ba�○Y���X>�q��R"�=�NOp��B��?��
���M)��3����J�x�G0#$4'JL�8��P��C巸��8�(��Y^�`'�\@���|bu�P
*MiK����{�IĬ� ���d�0+�mh{�k���CG��I���.!c&�
j&�
�B1
a�N�e� �A��������k���ܼ����ie��8珥��b�
;n�����&�����M
�N�i|!�������aC�l�R�*����a�֗v������ƭ���
������A[�>���'Ndžy'�"�A�`�oM��{��ݶ��:��34��N
�
͆�U4� �Y˼����C
_]�t��|<ZV�
,԰c���,�@=�8��g�P� ��4�(!����o
AnE� 
5YZ�R,o��҄{+e�Ci��G�:�Q� ̉+2딳^F����g ����ܙ����DUi�0�	7C�Fa"��j��NC:�@�&���0Q�$���>�K?pd@�H.ú$����/w;+��+�5,Ud�+7r�kV�H��v�!�S�]��Vx�iUM
;�
���9s|���p);�i���'l�j_ol��~�
+��C���4x�҈�—���ئ�T(L
��/s
+���@djx���JS����Mմ���o,���a���B���R~��V%�&<�i죻�1�Ⱥ��ʜ���۹�)C����nD�}���5����;b��Ṱ�vW���_�2ZL�n��/���~a����$�nʟ�M���=�Z� 0�֦L%wi|ocWփ�<��n�m����O�0~.��3����X XҲ2�sФv�ۍ�� �a�x.i0\`g��p�mM���T�|
j���-�*i�/=n��z�u|q%��XɆ$�
�Q�r������K�є����Nf3�p�� �pϒ@2"zr�,g�Mଠ/��xoĘ�N��2~�;��F��%"��,b�"**��נ�Ko~�e/��|f6鐴���s�z+�,��
�W��c0O
?@g��?�[�������
`!H�`?
�)t�N]{��C�ć�w�w�n������L�[�5���i�y�#���5�\�ܜQ��rP=
W�
8�0��$��
`���'�}��AR��`v�3Y);V�:q�
Q�
 zX����,��U�~�'�1!��|/&2;�”V��=8�A4̂V�ぼ�����rF�9�lq��֎�jzl0h1���i
�%aZ�A���,.��R�
aԟ���I��
+�vP�	��1?L�����6�����F��F2���Hq�)�g����X$�t
��WE�<R*䯵�|܊c�d��3@���
u[JI�_���m�p.-��?�'�?L�]JX�O^'�_�O~���Y�*"M�^X~�,��k��u��b� "�E�M��ETK�:I���Ji��0��	G���뤷U}��K!1��{Ql��		��#U��ϺIb@/�1���ˮ�d�����u~�t�1�bL9���%\��wi��P.��Y�{=�ь�^�'U$8�7��g4n$?��NPH6��~�uj 6���!�!H�R�@雄���>�d4�a'�*�w�9�t�X�}W��Um�ɮ�c<��'$����?)��"�8G����,��{����`�ŵ�8���a9@�������B�_Q�,���{�϶��
���?���?��t�[E���
 ��c�����'������ߘ�H?
���՝g�?
v�>yrw\�U�"sK(�
L��",����f�O��
n
��b��R����:i� [...]
+endstream
+endobj
+1112 0 obj <<
+/Type /Page
+/Contents 1113 0 R
+/Resources 1111 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1096 0 R
+/Annots [ 1109 0 R 1110 0 R ]
+>> endobj
+1109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.077 193.268 412.698 204.172]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+1110 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1114 0 obj <<
+/D [1112 0 R /XYZ 89 770.89 null]
+>> endobj
+1115 0 obj <<
+/D [1112 0 R /XYZ 90 721.073 null]
+>> endobj
+1116 0 obj <<
+/D [1112 0 R /XYZ 90 647.801 null]
+>> endobj
+1117 0 obj <<
+/D [1112 0 R /XYZ 90 633.669 null]
+>> endobj
+1118 0 obj <<
+/D [1112 0 R /XYZ 491.236 252.526 null]
+>> endobj
+1119 0 obj <<
+/D [1112 0 R /XYZ 90 236.238 null]
+>> endobj
+1111 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F7 803 0 R /F11 621 0 R /F32 772 0 R /F10 773 0 R /F94 771 0 R /F1 834 0 R /F102 863 0 R /F8 802 0 R /F75 562 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1129 0 obj <<
+/Length 3562      
+/Filter /FlateDecode
+>>
+stream
+x��[[w�~���[�Ә�+A&'M��7�&��9��-�2��%�u�_�
@�${��y��@\��|3��b�`��.>��x񥑋"-2�-�o[U�:����u"��_��]�,Oy�� [���?\����gl�xy}��C[p�S�/�ۋ׿��
+��]�T���v�.���Y�|�
�Ha!I
H�,K����s"��.�-^_iƒ�_r�T��d{)try%�H�����fS��W��䛆����O�e_}�E��UQ�H�64�8�t
����w�nW7k�Z��c�\�K��譟����^�6^|)T�c�L��s�{�2cJ�
+S�w�#����{$���+{xWR�ajq
,��A�m�3㨁����DK��%3�fl���[dia�x��JsQ�*��m�_#�gi��"�T7�te��Q�Yʄ���ۤ�����8ma��)c�<����V����Pmw��eFg�1<��D�e�
�щ#(ᅰ�a�@m3;M't�y*�ȧ2<�jd��LQ�F�;	*?2/���9�æ
?y�3b�������?�o}��Y�/�N��5s���ݾ�Pqhc�j@����Щ�D������u�5�c�i��iJ�1.���@M�#�Q�|���$0l��i�p4Ϟ|:��_q�:�
83�y�͖ɾYUP'�j53�r4�24�d��V��Zϩ�`<e\�;!0&�h�q��Y�J�T�	π݇6�n��]�pJ�B��F�+7�$�U���1�ܸ��
�@>E����H��0
)=�9�)��sd*>��E��&��FK���B�?
�=(ct'Y*�x����q���brd ��`�5�rX�� K�ҏ1�e�5|�u at M�x{3�u���_7�[�V�`�
+veWn���Ϙ+n����
�O��FQ�f�1�d�c��'�K��I
+b�������1��^7�+f���WDhR����$=s��S
9�K?"
VL��s
>#��|����+��u��[��cϓ�\C7�.��kM�USu�`�?z�~��T
m�ܷ���?߹�25����rkx{�ך��9�%��x�Է�-H !+�m!O� ��tU�z���K��Cݣk�z�r�n�u���eL8lX<���e@��|���
�Y6*��"O�<I)G���K�����GO^��	
�;�ȿvc6%��:�
+�:�xt�
}������
��B�8?�(:h���q�
8γ
C]

� ����Y!0�9+ظ4��:i��s�}=�`�t��U
:ϙ�S0��s�gU�qe���:,��b&�Ǽq%�"�G�u0�
+4�|$!���	��D���N8%q�:�C�Eq�q�s΀
D������>��N�
+�Ӊ�1�OA91�v(�Y~��C  u�立_�|
�x4G"�^E�.���Q2�E��WUCS�~?�
ɜ>	a�!
P
+�K_�L��o��e�E��A�{X���j���zTCW�9�=I��#�j
�=��� �
<5�v[b ���-��:���'��5� �
���š�)�S^1��x��}د�v��'|�$�J�]��.
�MO��VTCɻ
J�wk����"\l��_WC�a�� l�ZZ�vqI ��*F侯��U��"w���
�&ac��"��aE���K��H���z���)�y����OA\ �Ntb5!t캼kkO at 9�VW1�ۊ���Ϛ��fCM4�N6���&*�d.$��;�M�����:KÒڡ�����M��a�"�d~�P�y�:�O{�!�|��c�M2�!���Zu�_��'���ÊTd[���X�S]P�YH�p�D����@"�%�̕vn׊
���-�9�
+�-��d��&4�
�Ȅ �
+5�QDͩɋpF܍5�
!����Ɂ�U&�牤�]?i%��=�|q���
�j��(9;�?��	��(��e�U ٫z �u�|�Q�~,�
bReR%;
+1
�O	�,���	qN�$���"��SYN:O]�w�ZA��){=q�Z��q���~O
+c\Ac��6&sv.��`
&7��������?v
��mi�תڞBOS���r����}W�8�_�������������0'%�<Y�qA�1G�=�a��������f�J�N�|#�V��ݦ^z�nO�qk?�%����ޏ��W\�{;����W����Z�9��nKdo-˸�����՘�(~�n t
����E�L�Z���b�
��K	i�ֻq���ؾ���JK�G�61�`[4h=�|?��Heb����P���k�C��
�t�� �?�x ^b
�A$�_�1FAh�DG5���
S�g�a=-۴��ʂW���Yn]��髎��H���ݐ�K�	\]D�Eh6X��my)
	TBK
+َ�: �P���MCWb�סY#�kߒ�|%	���Y��C��4-��)�J!n�f�/���[�/��܁72\F��<ܑm��5��h�V͇�x������,�=�h��h����~�p�n}�
��6��!���
�T��±��t��@������(�
�B������&q��rӷT尧���h��M$��;�)�Y���q���H..�`�0�vT����:ZշH�-�ր����
�o�n��L1M�ʨ
��F�{��ݫ�rӒ6I��w��u�ލ����޹8�V-���R%l߹�4���z�J���
�!�6��M�$�� L�
ՎT��6i&\o�[��`Zr���
` y�s��d�L`?��$��ԈR�g
�,*�aa,�
lZ-�e����m~v��ۣ�b
㈴�c^fSok�����Φ
v������	���
�}sJ�8!��2
h�,�˷����˖�⤖�*�%n �L���C�!�;7��/s��L76C��k�w�*����7��s	l����
+K�h�:/Q�="�0K
r�
Sy���bTa�4�dl{j,�6L�`������wm��
+�5���)A�K��aX=�=
E.�U�
'.ߺﭗV2�
�
�x��Vo�<A�C]m(I����q�\�mUp��5��
�F�;
en��A��V��	J��v�#�	V�|���jc�N[#i
+m�� 
\$C���W����5M�%�e���������a����^A�▲w�v�ۑ����j3f+5�\;�I�on
��F�J��ƞ�	oN���*3�s�9�Op�.��� D�"?n�E��s�{��K�?$�-���z�=f	n��
4���:R��͙ջ��O@"�v�����gIs������Ɔ1͍}Q��߭�r��v��5�Q�i�p�Gע��A��`ݞ
,|����}dO��b�T��D�ye罴���Y��dӍ��u��e���q^+��=�A��g.�mwu����g"5B>��|0P�T���;aƍ}�
A�6�1���7[����ɦ�`��iB�"?nd���
sD�/:I)ꔕR,�
��?�b9��kٌof����o@%h�y���a�|��h{;��
��i2,U�x�wð��ŋ��dh�.
i�4�(Rf��%hK�5%�����ovS7	
+endstream
+endobj
+1128 0 obj <<
+/Type /Page
+/Contents 1129 0 R
+/Resources 1127 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1096 0 R
+/Annots [ 1120 0 R 1121 0 R 1122 0 R 1126 0 R ]
+>> endobj
+1120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.366 511.642 371.373 522.546]
+/A << /S /GoTo /D (index_BDHetal05) >>
+>> endobj
+1121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.24 303.542 230.92 314.446]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+1122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [448.533 193.077 486.501 203.981]
+/A << /S /GoTo /D (index_HPR97) >>
+>> endobj
+1126 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1130 0 obj <<
+/D [1128 0 R /XYZ 89 770.89 null]
+>> endobj
+1131 0 obj <<
+/D [1128 0 R /XYZ 90 570.673 null]
+>> endobj
+1132 0 obj <<
+/D [1128 0 R /XYZ 90 565.945 null]
+>> endobj
+1133 0 obj <<
+/D [1128 0 R /XYZ 90 351.311 null]
+>> endobj
+1134 0 obj <<
+/D [1128 0 R /XYZ 90 346.584 null]
+>> endobj
+1135 0 obj <<
+/D [1128 0 R /XYZ 319.418 306.695 null]
+>> endobj
+1136 0 obj <<
+/D [1128 0 R /XYZ 90 289.609 null]
+>> endobj
+1137 0 obj <<
+/D [1128 0 R /XYZ 296.413 148.409 null]
+>> endobj
+46 0 obj <<
+/D [1128 0 R /XYZ 90 131.323 null]
+>> endobj
+1127 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F10 773 0 R /F13 835 0 R /F8 802 0 R /F32 772 0 R /F91 766 0 R /F94 771 0 R /F7 803 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1141 0 obj <<
+/Length 3925      
+/Filter /FlateDecode
+>>
+stream
+x��ks����)��	�7���C�4פM��._zIZ�e&��R
g&���I��
�}��=#�žw�g����������26�HK*goog�2���p����D���`��_�&ߗu�^/���r����]|}Ma���}Ѵ�ލ�^�7��yF���f�߿���/o�~�"�	���@��-�W�dz
1Èi5����3N�nfo��y��MH<�̉��m����T��s&���\�]S��;w�*�eS�+w[VI�]��h~��j��g�w��k����
.��
x[�y�ik�=l�yS�z\	p��/��p����)�=t���V6�+���>T{wS�@ d�B8����hʥ9!6�/WEUV����֍����;G��P�|Uo�r��a��zk�R��zW��˼�p��nW7{Cs��)�}���U�)���j_��
{�v�Yz�]Ɯ#������)ܜ��d&���>����X���=�!� �r��
+3n~^+k�2�Q�IՋ#�{�tP�Ǩ<b�5?nmx�X{$+� �K�p0
NX1�`f��������mSo�U���bQ\1��l��P���-���a��V �^~F�=S&� P�(}�DX˺
����{������+�[T���l��o�)6
��+?��(V�dH	��	�$�Ju(}��
���ؠ�ԧ�M����
�;]&C������띻(6���T��3`�Lv`Hb
��"�:~��K�M���ÿd-�
P�G֢�ZV,��!�5>C�z�
�d�2��~�!9
�����$8�h�3����*:K��p'�0�2>b��B�� I��b�[�
�$;[��c)٣]�բ�fټX
�h�|���rR���M��@əп�L�������O Ry� ;~����<�
h�F
[#*�	��@�^#��ˆH���9�`8
�u�)��G ���� 2��Θrω�)�y$c�x�,��!�v��	�I�"�4�A��hNH5���_%���:�E���I�~H��������hI��F�p��Dl;Hg�&��~�)��`���Ka0y�QKѤ"
1��sh�x?��
Ӫ���V���Ľq���Z7��Mទ������ԫ"�"�U=��4"=��
l�B+=�����������V��H�G��C�YP����������{⢏*�
��"E�{71
oZ9v��5�7�#�������x=j/��'�2D���}%
̱™:�1 (s
+�̎+(*�ߦ��x(2�ӕ�%a0�y�"�`�l�O)I�
��1�#	�&�O��?u!����?
K}��a@�� _AP��|��~N����k���*�|�:��ݏ�u�d�9�jCs\����X:�TH`n
�����f�7�}�}�.�\v�b�u`��lR	��>�c!�M��
+&��D@\ ���
6�x��Z@,�@� 9�@�p��i�#2yy�h�oDG��&%SS
+�'"9k.���"q$|�f�\B�Y�&Tg��Y���� �|����
|h����~Lu���:�oݞ�Th�!>}���\9}��l1�+J�����"��S�d�r;��H�A�<CD2�ђ�ۀ<�8-�*��ɘ$��_%N"
+3�`(��.c�	
9�z�tz�$���'��/	D�
�r
a�Rvi*�	
��#�D	q�ԦH��O-���
�:����*
�������(�1��?J��
�}l�'�>;�LBo_T+��p[lM�w�g�p~s7w�;�}>���U"�D������&�Y�k�����d
We�c D��b ��2`QͼW�-l:P�Hjy*N��a�N�����*'GR��(�F:.���"2X`nK9��������C����s\��m����8j�g=v�)��R�� J�� �sg�{pg�;t��ܧ�x��D�x"�K ���������A�)
�1
n��FN�� ��������we�(��Q i�vߔ��H�LvR"Cn��C
5& `Ų��߹5���&C�N6�����U ��eW]���v���6
B��%1a�׶э+��6��!в�u�̀�{��	h ���9�LU
$���E��+����X64S.�@*��C�7G��XP�����9���F>-#��ڃ�?[��)��`
+v T|��4%,9��<;�*��y*��iW2(��U�^L��Vx����׍�+�"�+ao�Y��>1)��j?��Rn�MTak������@I�ң2L�w56��R���2Jn�9��	���m
Sp�l��onj���X�s��
��Ⱦ�	7��|�~��
��G
+ÂE^���>0
0�J�,h̉��4���ն7��
�%Gq�a��m�g��5�8’��T2U
ѿ��x�@4�\Ej�룂W
8hh�
�C����5uO�܏�.î����Y�� 0w�l>�
r6�,F�N��4�x����?��

kl����� &z$U�m���*@�$����Ѳ#��Q��d����t��g�~>�y�2`�r�c�9�d��I�/�$�JLz
�G�UG%��v�0�
�&+�T�X�y�2����,;�˪��
+�T"+hJ��� �K�"���gCN�Κ��P�Ͼ���L ��"�'�x�_�=:}��d��8�ѣA�0llH�z`S��,F�I�ɨlSlM8RD�s5ɨi�j�S�f�!��G�h���G+����y�˝l�[暛XJ��`�c��;���ϔ�1C�
w�`�nr?h�a`���7Y���?�k5��-���H�����ɛqU����<&3
AuO�M��CʡQ����fZ#
J��; ?�
K��b9`%�K
+j�O'uy�.{���)�6�K�
�u$� w?;8���9����3�j���3�
�].���Ҳ,��K��`���Ŧܖ�T[j�{�
�
9��{����86i&�?y���R�Ǯs��}d"<���z[���X�(\đ
U�铓a���.��Kj6���,k��6��a�;�ݠo2��#6Y��&�I;��8äV�rBc�}���w���U�<�
���hc�F��
@�s�ȃ7�����=�7�BԦ�/�p/}�D����������]�'VE�ꚉ�"��]S+
��u�R�Q��	 
B%INw�S�p����f�����
���
�ϡ&����/��MSڴփ�c[��ʛ�
8Ɓ�}ﹹ���Y
Ը�ڌ�V���a��2@eN���$+r���'NwP�aM�
�ͺ
���'��M��X�J�26���M�
'�j�N���/��ԝE��ow;f��O�
@.d��#:�$�K~c'�= $}r�$�����In�'GN�Ђ&k�
?O�M��	��3�8����m*O���C
lO(}�P�&�ޱĸfJ�潭�-�˜ᆛ��=H e�)���jGS��SrBt��~�L!e
+Mj���B�N}����e�W�l��S{g��qN��
�.�
�0����}ϧ��,F;�I�=o#�D<C�<LB�d�zʂN)
�,�N'a��,�G=S�sG�T�J�veN�)yqF��Nj�;��:G�UGI#�*\ČvI5��8F<).2���a�%L}�~��Fw�[{���q�S�|_{�4T���M�0�9���"{�-��'!�?鶍w1ʐf6'riO�Ů��~~�C�$_�
��c
[n��Xn�Zd�]�A�nB:�G)��g
�y8e7� 2�q�s2�(��K�<�q�]���U�=~�֟���SK��]�1u�5�4��~D�3$�
+?
5�~�ww�m[4\
1�
�e^
����龰���<���5�r_�.1�vy2��O���oW6�1�CL��@ƻ�~���˛ú-�5Z�۩�
���h=���޶On��I�@u��w������g�٘d6���}ؽ�^~�e�Ok ����� ��?�
+endstream
+endobj
+1140 0 obj <<
+/Type /Page
+/Contents 1141 0 R
+/Resources 1139 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1096 0 R
+/Annots [ 1123 0 R 1124 0 R 1125 0 R 1138 0 R ]
+>> endobj
+1123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.495 707.957 266.135 718.861]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+1124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.01 707.957 392.525 718.861]
+/A << /S /GoTo /D (index_BHZ04) >>
+>> endobj
+1125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.467 684.42 428.905 694.951]
+/A << /S /GoTo /D (index_pointset_powerset) >>
+>> endobj
+1138 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1142 0 obj <<
+/D [1140 0 R /XYZ 89 770.89 null]
+>> endobj
+1143 0 obj <<
+/D [1140 0 R /XYZ 90 685.417 null]
+>> endobj
+1144 0 obj <<
+/D [1140 0 R /XYZ 90 685.417 null]
+>> endobj
+1145 0 obj <<
+/D [1140 0 R /XYZ 90 670.273 null]
+>> endobj
+1146 0 obj <<
+/D [1140 0 R /XYZ 90 274.538 null]
+>> endobj
+50 0 obj <<
+/D [1140 0 R /XYZ 90 269.739 null]
+>> endobj
+1147 0 obj <<
+/D [1140 0 R /XYZ 90 213.703 null]
+>> endobj
+1148 0 obj <<
+/D [1140 0 R /XYZ 90 213.703 null]
+>> endobj
+1149 0 obj <<
+/D [1140 0 R /XYZ 90 198.56 null]
+>> endobj
+1150 0 obj <<
+/D [1140 0 R /XYZ 90 143.186 null]
+>> endobj
+1151 0 obj <<
+/D [1140 0 R /XYZ 90 143.186 null]
+>> endobj
+1152 0 obj <<
+/D [1140 0 R /XYZ 90 128.043 null]
+>> endobj
+1153 0 obj <<
+/D [1140 0 R /XYZ 90 73.999 null]
+>> endobj
+1154 0 obj <<
+/D [1140 0 R /XYZ 90 73.999 null]
+>> endobj
+1139 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F94 771 0 R /F7 803 0 R /F12 940 0 R /F9 880 0 R /F13 835 0 R /F29 939 0 R /F6 862 0 R /F75 562 0 R /F1 834 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1165 0 obj <<
+/Length 3119      
+/Filter /FlateDecode
+>>
+stream
+xڽ]��6�}ż
S��"		�Խ$�}I�d���\�
;K������_�>@�fwmoR< ��VwK�j��W�/����|��UF2����v�ū4Ɉ��[�1��������L�$���/?_���[��������xE�|AR��
.~�-^���ULx�V�z�a�0�j�����E%&L�'�,b�!F)��` _�����q
}�TU~��z��0��ܼ�֜E͚��h������*E�k�
��d���W��d���03�QW��}�f"�sMET��Ģc�M ���A����μ���
��ǵ�
�W�v=B܀���1I��1akvmGN��d��z`s,ڼoZ�v[��&�a�*��"��ʶ�7Z�,�$��6��L�+���_�Qsk�ymާ#`�fq��iN�n6��̇�>ve�����
1
�H�
�Y>��b
'�z�A
ʺ�^0^6���?A.
� ���egV6�m�r�g�+v���y�n���5�ޘo-8~�8fu�O��.��3
0�����e� [...]
a4 Aͨ����|��M���ը2Cv._Q��,%2K�X�
>hH���	+6ua?n
hCIh�Vy��ߛ�4
�/��o_4��oͯ�vE�m�#�Sg�!V$Q3u�@

++�Ղ�ɭ
���~_Na�&��F,�F
!'i��v�
`f�j� 
�>@g:�o4��}�-�?a_ԅA
+Zg�݃�Aoi�>�y��@���R��H�%�E���AQ[�ib�ıWWȯ���iі��l
<l
|���9~���_�
�ɶ�µy�ح/`���
OE����޾?u��r
7�UQ��H����ܬd�[@�T�
Ҹ���a��Ȁ]1�s��O�0g`����jM�OE�o�ڢ�Q�R�-ǪDc����c�|�|�
���"�5#ҕ$Y��$�
��۹(3H��
�<]yc��HF��6`�)�언B�
�2[%�����@U�F_�K�W�^_�F
��
4���
�J!�T>�}��Ov�"��$2f�����a�������
� Xhu`W�`L�I�}��.D
H�9#|��'�
xw!�J>���'��
�W��ڇ�� �S�;m1Wq�ˡ@��_�(ߴ���
zljљ?
]�ۘDZJMM�g�!���m
�����\�B
������+�

�ߡ:
����$
+"	�� 혥�;���O��:L�jB>�Y��
���SF�dȉ���c�+
�i
�5O#t
�i�LA�t_�wf:x�#�8��`�F��J����	)ar"�'��\H�z-0�
9+!	���Xɇ(o�M~bH�_Z.x��Ƨ�1S=bi`�Wl�3{(>���h���S6�&
��za7-�oZ�4|��܇�r�9C
Ь4�$`,�v�J���(2D[ R��ܪ��I
+'�a�)4�2g
U ؛C��h��2��Q���Ae��S|�.�
5i驔�
�!��s��,	��1�W=��O2����8p
�
��31��\���`}��N�HW2�Cv[w<��TBr�g�s��� p���b}N��x��[�PEf�n�eT�ۻP 
c�,
��&c
d��#�T6���M³0��
��k<� b.�1ծ��.��'�0�L��P�y�4d-�RO'+���8��J��X�e��i��(q��^�.�-[��
[ҔdL���[8���=�=Eb���;c�'��E {A�J�&Sb"S3Jfb�T�f9��SYO]��5�(V�L�\O�wf�B�uw����j�Y"�4	�lc���)��1��i��amMI)H*
����h6ɏM�o�2B�� ے�����[�)�dV���ܼn���L����3��@�6ʇ������&�59
)�v�S"�ttQ�,li�%� +�$E�M�̉W
�,T6�S��,:�9¶��qWj-�������\Ot�($�e�
+
q�nυ�u�`M�ב`H39I){,ံ��U��=���Q�Ǭ� ����Ȼ��O
�ߟ���⊒9�ɤ�v'׆A�t'rqd&Yh�8�E
O��U�.]��+���qXA��4f�
}�=�^@�I
s����a��?�"���iwE;��?����,1�^&�U�#�t�N�o�m~ꊩ(�we�b��-a��tJ��l�X�ε�ϵ�m+�e����ԕm�/�j���	hhQ�V	U
�ݕ0���q�n �Rݚ��"|�->���j4��h�T��ms8�m�aQ����׳�f�l���Lh��ԅrC
�e�D�,��
h~n�,{1��ih��4oЬ:���V��)X���X�om�q�U�q��[�;�[���u��*�0:AA�\� -�\�|w�G�J�w
+IJ_��:FȦ!��:#$�N��Jk��m��O�/���"u�
ŕ>X)B<��'-ĆH}���]s�4t.�D����ą�g�],bX��W]c�
��*rX�2,f<<�f6et��L��Ōqua
��OT�WY�YJ=CqR�IEc?�>k���>I�|�P9[GLR�������'�y���J���Jqf��]�L���l;
�.�
tA���"�
05:�qe�9�2��L�My؍��<�u~�֐�e{_v���O�v�
��/p��pW&�6I���rB�GJ݌�x����%��{WU`���}�
$p4y���E������Y*,�g�&�#
`ơЕ9#
�
+(��!]�T3�r\�Y�=�C�e�� 4w[cWH�v�*��^F���

~R.W�.��{w�	�37����;Wx�+4�D�G}
�,ب
+k�+�2����ϔ�`'
�2�I�)o��儉�n���܏ϖYI �Y2/�i���y�w]����:�
��b��u��L��G�ɂk	��=�q�

6��&��*-�ek�@�7�۴E�F��j�§�a`[
+
+�����sk�g~KV2����-Yo"�7"��k?�Ōi��<޷�tsl����z��b�rXo3.�o�UP�Z-J
	s@�*�v#��_ȳ��@?��S^����"D�\ސM�݆�\!��1���h���?^h��p�hY
~��_]^ޜ�]Q�ɶ9,-�89�H<�$��
�5m�n�A�A�
Ȝ��x�7�
+endstream
+endobj
+1164 0 obj <<
+/Type /Page
+/Contents 1165 0 R
+/Resources 1163 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1096 0 R
+/Annots [ 1158 0 R 1168 0 R 1159 0 R 1160 0 R 1169 0 R 1161 0 R 1170 0 R 1162 0 R ]
+>> endobj
+1158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.512 613.254 513.996 624.157]
+/A << /S /GoTo /D (index_powerset) >>
+>> endobj
+1168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 601.298 181.006 612.255]
+/A << /S /GoTo /D (index_powerset) >>
+>> endobj
+1159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.703 589.343 287.736 600.247]
+/A << /S /GoTo /D (index_Semantic_Geometric_Descriptors) >>
+>> endobj
+1160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.972 571.719 513.996 582.623]
+/A << /S /GoTo /D (index_ps_operations) >>
+>> endobj
+1169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 559.764 164.282 570.668]
+/A << /S /GoTo /D (index_ps_operations) >>
+>> endobj
+1161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.712 559.764 513.996 570.668]
+/A << /S /GoTo /D (index_Generic_Operations_on_Semantic_Geometric_Descriptors) >>
+>> endobj
+1170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 547.808 181.684 558.712]
+/A << /S /GoTo /D (index_Generic_Operations_on_Semantic_Geometric_Descriptors) >>
+>> endobj
+1162 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1166 0 obj <<
+/D [1164 0 R /XYZ 89 770.89 null]
+>> endobj
+1167 0 obj <<
+/D [1164 0 R /XYZ 90 721.073 null]
+>> endobj
+1157 0 obj <<
+/D [1164 0 R /XYZ 270.222 674.806 null]
+>> endobj
+54 0 obj <<
+/D [1164 0 R /XYZ 90 658.216 null]
+>> endobj
+1002 0 obj <<
+/D [1164 0 R /XYZ 122.378 539.006 null]
+>> endobj
+1171 0 obj <<
+/D [1164 0 R /XYZ 90 524.474 null]
+>> endobj
+1172 0 obj <<
+/D [1164 0 R /XYZ 90 249.976 null]
+>> endobj
+1173 0 obj <<
+/D [1164 0 R /XYZ 90 249.976 null]
+>> endobj
+1174 0 obj <<
+/D [1164 0 R /XYZ 90 235.543 null]
+>> endobj
+1175 0 obj <<
+/D [1164 0 R /XYZ 90 155.766 null]
+>> endobj
+1176 0 obj <<
+/D [1164 0 R /XYZ 90 155.766 null]
+>> endobj
+1177 0 obj <<
+/D [1164 0 R /XYZ 90 141.333 null]
+>> endobj
+1163 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F24 537 0 R /F7 803 0 R /F8 802 0 R /F10 773 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1193 0 obj <<
+/Length 3458      
+/Filter /FlateDecode
+>>
+stream
+xڝk�۶���
+M��7�h��p����q��N�63�x<���H�LR�(����(��'��b߻��=������ۛ�/�dV�E����Y�f�.B�Bo5��0ҷ�H)|Z��cWu��ب�Y��G����������{n.�����XS�Xi���_�|����M8�Y�g�0�g����;5[���
+�"�=Ҥ�L�	|���o��Q>��:C?�#��P����<I���POU����\ڝeD���T����j���v�ml�_n#���������vq�nZ��r��־�Z����	;�
&Q�v�O��i�x��"Q���Ll@����~��t��`_�|�~3\�;leng]8f6��<́�s�Sa
�h�e��6Vr�
$&T&����f �����-�p8T&�&v� ��MHyB�+7����#�(�=���/ ��!8b�	�|��8�����+����p����l��0I�A���i֛�$��(>��n������m�o��D
��޶e��<>]��
O��a��&�%�PY��m�
�S��[҄��%~����pʶ��

C$����F��
A���
kl�oP��|9Z5�����}��ή�Zn���}C�ݫ��=����I��X�_�)�w#������Z��#�c<�o�A?�p��ֿ���몇zJaM���dR�]��c�e[�l�VK�`qdx��2e؄�ISz� [...]
��ޚ)c��E����zF���G s\��?�^�;	����Y�ny�?�j�Þp�c��&������Q����}>��(L�|�Y����V
� `�_r��Zٚ9
�f�8Ur��7ZH�Bӕ�Jp�B�W$X�(Q`~t>&�e��:�鰭DŽ4	�e]7�ҩ
 �uo-w��(�H{	������,e�l
�ջ�U�G�Mxg?
N�+���Eᯫ�2�>��
o��v����&�{���/�hS
+^p���%�DS��G;k�(�p���~b���#\��pF��gx�����
'x�D���g�
6�8��B�e���;w<�
����#:X8
,�Z�	��
+�moe��
� Ur�[��Y�� �����
��Ir}�MY��k4�}�<l�%X�A{�q��hG�# q�u�
+�`�w�8��U����d�|үB��4<�-���� ��Ҭq�v"!HݺE�����i��% X�`yn�_u�N��ń�%�d�y��)]t����(�8�ܓ�&������
+�Q�)3e����b�S$���Y��
�O�
{,d����-���(�����
�
+,
:4����q�;`V X��$
+M�]rlI*8�0de�9+�s�8N�+��@�f��*:)@���U5rėw
!svF4�d'���M ����wI
��}����c�o��XAcٴ���z�����ϡ��0�!��,H�y��626�}T*�0b^le
� 	��^�M��
3��
$þ�Bo26H��$���$�
!+E!�Yy��J �}�J�q��'d�qT����.{s%����矡'�����*�RQWX"�.
�˳+w��
��z�`~��܋���.2��Q��

��/LZ�р�e ��iY�HU��n�iw6
�\bػ҆�&��ږjI��9g� <v�I��z
�a��WқXC�By�1
+��T�8(�_'v���џ�b�+V+q\QQ���L��!��<�>-�E�����l�ƊD���~�T�c�u0 
_
+ec1�Q��?@\��oSC�<�Bv
�k8�C�����P$�>��#�Ʉ1y��38�^�v#���5}+��Eң'��F�3�N0�����-:W8����D���Zr�

��;A��hJƧ��ׂY�@|�H
�(�mG��v�4 椸�
��W��R�bQ�N�&�A]8�Dm��ᨶ��O��Y�p�g��.�E0��դVC���d`_U�p�ƸXi)0	�J�a/h邪�0X��ۣ���RC��Ǫ��f'���lT)1:x�晋},�N<���L\��N��)��K�P礍�M�|����S�M�;E3Jbo�<=ZŞ��]-�?��'��
0%18��D�9-����8�5�
+Z�*h�m�N�W=P*��Nb��1� ?�o5{�E�m�ԅ��ْ�����5^x
q#{��xO
�oѹ,��$v�Ƥ�e��&Y���t״�ve�m�
�/��
~:t�8��1��<S�����ҕ�
�5K'��әι ׫��
+0�p��%����g�7@:��-�&�دDd�
iMG��BJu�֕�bW|d����T��
�7�������U���(
+K�Pj
+�Ԥ�|?���kN�_����;
P>;O�|S�aX�"�?M����j
�Q
+���v�)��8�q�aC�oR�)��j'Kh�
+W �2+��E��2]���W�����
� �"2\�O${]��$آ!lo�Aۮ!��Ƙ���C����
��4$T&<��
��,CE�L
�p���8+
�fn�-�Cu�62���@o�L��_��A�M��mG�=q� ��1�E����;��@�3��L���}�fZ���B+� �͛��OȽ� �=��;�d+��+b8
+��Y- ��xq�,�4��`��cR�m��?
�V�Xα�	�R��
>H������{Ǔ��="P �R��Ť
v�v��ʓcWoMC�k��_���;���7���w���?��9�
ѧ\:`��m��ݙ�P���`�1�R�qxU��&�'1\qk�䉜��Nn� �vؗ�aSn7i�孟�.	ɺf�a�`�l�	�$�/��*s4�n\z5��
�HB
G��p�
k��o���Th�#0��;
�ؕ�
?� s��{r�ŴA
'�#�fÌ)�q�U\�E6Tm�3��VÄ!��Z������g�A~��
r�l+,mIn�r�acb�oV�0`�C[�詵�pG6��n
ɼ�d��$K�N��
+�,EZ����r|�
+u��u{J�,�33�&
5C~' �S  c��Nr�J�J�~,�C�1�2q�@�bR5P��@![�N3ʩh
+6r\���
"֪�N{��CH��c
%pͳ
+X|h��UD<��n��&�
���H�O�f�$��Y�<�`�ǐ9�1�O$F8�
|�GDc*c� ��3
cNgt�Q	t������=Y���04f��:4Yz^���d<�7ʗ}�r��%��Q��W����0��ae�"A��Z�n�6$ ���ST4��|�*f�����RP�����ɟs�:_4i�P��
����`i
fq���?�r8.����B�l
+h�o���7�_�8PH�MYʭc�Q�W?B�om�O�����y�Z�����	�(S�·7�M��_<�8<t�~1xxw)B��_�!ɒI X��6����Ҩ(L��Q�X��,�i�ߦA�P �_���
��3����
+endstream
+endobj
+1192 0 obj <<
+/Type /Page
+/Contents 1193 0 R
+/Resources 1191 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1207 0 R
+/Annots [ 1178 0 R 1198 0 R 1179 0 R 1180 0 R 1181 0 R 1202 0 R 1182 0 R 1183 0 R 1184 0 R 1185 0 R 1203 0 R 1186 0 R 1187 0 R 1188 0 R 1190 0 R ]
+>> endobj
+1178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [498.724 636.893 513.996 647.797]
+/A << /S /GoTo /D (index_BGP99) >>
+>> endobj
+1198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 624.937 117.009 635.841]
+/A << /S /GoTo /D (index_BGP99) >>
+>> endobj
+1179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.136 577.117 238.651 588.021]
+/A << /S /GoTo /D (index_BHZ04) >>
+>> endobj
+1180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.642 494.097 266.138 505.001]
+/A << /S /GoTo /D (index_BHZ03b) >>
+>> endobj
+1181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.848 363.207 513.996 374.111]
+/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
+>> endobj
+1202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 351.252 197.394 362.156]
+/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
+>> endobj
+1182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.115 351.252 375.525 362.156]
+/A << /S /GoTo /D (index_pps_pairwise_merge) >>
+>> endobj
+1183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [470.5 315.386 513.996 326.29]
+/A << /S /GoTo /D (index_BHZ03b) >>
+>> endobj
+1184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [105.88 303.989 144.396 314.335]
+/A << /S /GoTo /D (index_BHZ04) >>
+>> endobj
+1185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.381 285.807 513.996 296.711]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+1203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 273.852 259.791 284.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+1186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.892 261.897 272.525 272.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+1187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.002 141.019 381.199 151.923]
+/A << /S /GoTo /D (index_Min04) >>
+>> endobj
+1188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.308 141.019 511.506 151.923]
+/A << /S /GoTo /D (index_Min05) >>
+>> endobj
+1190 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1194 0 obj <<
+/D [1192 0 R /XYZ 89 770.89 null]
+>> endobj
+1195 0 obj <<
+/D [1192 0 R /XYZ 90 697.218 null]
+>> endobj
+1196 0 obj <<
+/D [1192 0 R /XYZ 90 697.218 null]
+>> endobj
+1197 0 obj <<
+/D [1192 0 R /XYZ 90 680.51 null]
+>> endobj
+1199 0 obj <<
+/D [1192 0 R /XYZ 90 578.113 null]
+>> endobj
+1200 0 obj <<
+/D [1192 0 R /XYZ 90 578.113 null]
+>> endobj
+1201 0 obj <<
+/D [1192 0 R /XYZ 90 561.405 null]
+>> endobj
+1204 0 obj <<
+/D [1192 0 R /XYZ 126.802 217.229 null]
+>> endobj
+58 0 obj <<
+/D [1192 0 R /XYZ 90 200.421 null]
+>> endobj
+1205 0 obj <<
+/D [1192 0 R /XYZ 461.12 96.351 null]
+>> endobj
+1206 0 obj <<
+/D [1192 0 R /XYZ 90 77.486 null]
+>> endobj
+1191 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F91 766 0 R /F75 562 0 R /F94 771 0 R /F32 772 0 R /F10 773 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1226 0 obj <<
+/Length 2671      
+/Filter /FlateDecode
+>>
+stream
+x��Zݓ۶��B�<T�F0>	Н�4�3N�ĭ�ig⌇'��8�H��|�����IH�Y֝=��/,�����$%\M�&��?�؄����=z��$%i“���$�-S�xZN~�
+:�����H
ai�l�w?�t���W8v�����3Ct��|E��,�g��F'K�����Ln,�z"���������h$�(e;1Fs��%	���t��(��97��SӪ^7��h�]�(�
h��
Rd+׻���ה�E��mc����YB�ɜK���>/�X�)�U�E��9���`Z���
8�*k�����T �k�3N��7�L�i�4EU6n�HF9Q�!�^U:��4�Ց<s�N�ja�L��t2gD��Q�#���IV�N�:��y�ʗ������׹W z@}�]��J�+Mt�	�ry�����{\
��1�܀�p�`$UAċ���h�+0�*k2�
F����wK٧%�p���d��N�����H�	$�DH�><^s�"��Ȥ��wYӾ9Ì��	
}��f!ܠ�`I�@‚k�Yy���*�s
�4�D�_���.V�W#�ϛM��=NS�

�"!83�
�L
�l�m��F�#"^�0pm���*�-���=��r�@skT��; [...]
+H\��)�-V&�\�2!������X2��:1�_����f�S~V;�e�|����{��
3���J�����^-H�i�V��!=]d���
����
��Xg���T��*�홖D���_�cL��#ȈV�:Zt��N��
N����p0���pb�Au��}��$
�={�k��<���KS�!��-��c�5,*45�M����.
��
���'�Nt�!B���D:�����8�
m�y21 �B40㿌I�I��-��Y��D
+
�Ļ�Ť�]D4\��A�
+�!	�~7�9z���JL�Žލ,

+�NG2\��m+.1p$4�{�R��R8��U�.�Ðb
4�p�;6��tg�C�wm�B> 궟��=�[�O��bE|����Q!�V��X �i+

+�e�bp��@-�	/��r�ph

����AlN��"C<h
غ���
i��%�ګ�P"0���1:=��&!�^�j������|9���@T�1j�qK�\CH"���`�Xk�@��n_t��:o���G at 8
�Jƪ��p?�V��
\��A��{O�<�S��j{u
��5���Ʊuv���\�����n���[�6����Lv�W�6~�bU56�A���ܑfY-�P�8c��(�qX�do��]�99�7�K䢽�%ʆ
+
��Þ!�]���vKlK��N|�/>
	Z�^�9m;O�C�� ���dc�k�����3�y)��_3�mq����0Ji��rԔ�Rd4��B]Ɔ����D
�gu
�G�uw �&�
�
f<8�Jf/F�%�<Z�˜qAR�}�Ⱦ2>��'����g��:t`Д0�% �xL��`��W~
��Z��r��U~QgxыC
��Ɂ��$�XK>v�r[m
��:a4[.�TO�l/\�j5U�".e����
�	�B�R�%X���{�\D�
�������նl��5 �@�b?�O0h�06n�"
��m�
+k@��s���ُ�I)
<���Q��������6�뭶���ZZ
 �� �,�Z
1�@��)hE� �C*��#�Ը㝕����텴���Ø���flA��!�*��ew��Є5V�
+�o����xb��Ux�%PY�w��Tq��,�}�m���
�Y�����\��	ҁa��p��{Ed��
+���T��AkH���J$�D�8�`�o�y��Xi�j�H�N�t�
(��D_�+
����zB�N��1�
��;}E����@���g���e~�oF�`�������p �|p;:*?����r+‚הяp�}
z�G�fX 
�)��ڇ���&�����

Z�f�� /2/�K3��&6gbqZ���O	���P	�\Gʊ�{Xtݣ�e
+E��$R�e��:��@"��$�2y�c)�D*�I��w�c6?��s'Rs\"5G$R}$
���(��=�����#��/�u�E�	`w ���<���i�7�DőIT��P|A��fp���b<��w���{c��!�?��GA�����,t��O������"��h�Ϗ�����	�
 �_t&J8
��S���(�Lkn�m;���G��b�����޼_�~)�P�}��Y
\2Q�Oy`�u�ס/_�p�6y�G�����?f�6��⷏����
#lS�������

'��N�W�4%��tݶ�Ǐ
]l����"�j��E?9M�J���&ZW��0���f�k����w
+endstream
+endobj
+1225 0 obj <<
+/Type /Page
+/Contents 1226 0 R
+/Resources 1224 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1207 0 R
+/Annots [ 1189 0 R 1228 0 R 1214 0 R 1215 0 R 1216 0 R 1217 0 R 1218 0 R 1219 0 R 1220 0 R 1221 0 R 1222 0 R 1223 0 R ]
+>> endobj
+1189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.723 683.275 513.996 694.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+1228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 673.377 90.996 682.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+1214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 645.607 297.721 655.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+1215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 624.2 321.631 634.098]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+1216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 602.794 321.631 612.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+1217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 580.764 321.898 591.668]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+1218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 547.402 291.743 558.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+1219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 525.996 334.671 536.9]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+1220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 492.634 357.021 503.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+1221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 459.272 321.488 470.176]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+1222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.691 249.264 176.633 260.168]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+1223 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1227 0 obj <<
+/D [1225 0 R /XYZ 89 770.89 null]
+>> endobj
+1224 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F32 772 0 R /F10 773 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F1 834 0 R /F13 835 0 R /F24 537 0 R /F29 939 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1246 0 obj <<
+/Length 3487      
+/Filter /FlateDecode
+>>
+stream
+x��Zm����~�BE?�B-z_�\�E?$H_�:�[�M�$(�w"L�2IŹ����̒K
�IQ
p\.������Pbu��?�|������^�q��t��v���M�ؤp�_}�X��F
+!��Us��(#��P��U���~��R$*�r���/n�������
�JҊ&��jw���;����+�<[}pD�U�4\�՛��߈�9�&�<��yl�!���M�4��q���F�Xh>JEdY at e�4���{�;^&�Q���0���ݿ�H��8�:C���3	�)kKd?0�ȒXi�7S
�X��'��¡�Xdr%e�
3;�l
'Z���$O�܄k%���j�h&
���P��!"8�LHRȹ��Z�
8�1��,%�����Xf at U-����0c
G4�i���C�q
+̣%dD��;P������	�(Tt��DǬ���}+�Ae����•Tls���'�CI�������>�0٥�<����g��_�%��i�A��u
�ʮ�D
�vLc�l(� ���
"ME@
+!����Fk�S�ׇ�+Ģr�&�zq��5���.2	h!����vI��,�M^�������w�	>�p��nE�_`B�U���%�f[�;kkg
�^и!
�u�ڮ+�S��
>�g�슡j���"����~X+u�7&M���øb1�k��z���L,���g�^K}��}��DF]{��PE�ZF�XԌ�O��DL^�8����v�ߖ�@O��ݾ_w�&��\3i*+iB���Ě�Χm�
�~��@�Yz�bf����`�3�oI:.Q5�s��8�	�W�

+x�4�M�P� \�lb7�M��	�U�N]�cut*��B�A�T�
+�yr3b�
Om_
%�H�EX��naY�QE�ZP5=*�����Ŏg�����F�0R�z�Gi��ʹ/���.���*�|�,v"��bCV�����ڇj�ת��ڝAz�P߳ɧ9���
�]Cvѐ�/�x<z�Q:����4NA(@w"���3�wf��ͩ��E���l �@�W:�r��P�̩����fA����)�3��nt�/Ԥ3u��yr���>���F.�l�a�^,fuc�46�HG,����XCf—�("��
E
6��)���Q�ѐ����&�3dRH�L
+�ؤh60X�m�ƉH�6��glg�o&]VH�j� �6y�"
AD&���)
�9�o��H�
�⣆!E
+�˟bPe�<�����3ghS_�


�Q�QV���l: w��j�
8V�
5
H"�n: <6
]�̰���L���h:V�:��^�h3�H
+�8d.�<~|�� ���qz'��
G1G�ӵ+O =�9
d8��̽��
��;��3v;f�k�f���Y���l/�7��c`I�fa��{���� ���9�桪Kϣ��&cg�$(	�j�\Gy�D�Q
�.�õ���Nq�q{KWB0x3�Ҟ�ޮ-��TS���IM�y��r 3�W�\{��OKՀ�Q��r8��}W�?W�B�۶.���C1��BA=�_����Pf�����s|]�E�s`Y^����Q���H單����8
K�C?����k�|��Gk��qJ�
*vy
r�<�$�
=G�������g

]0���u>�o�;�
��G�A�X��΅��:V�4arZ�[��IR
�
���*��WR�㮬�Cz�V6���v��+P
�O��]�|~�U]��,�}ٴ���S at M9�.�Ź�w���Ҏ�	��Z�
�sa�%�0y~�0���+h𿬅�_4�'��N��;}�3P
֨�WK�~�O��2ǜ]�����@� �b�-X��*������)1�rE�q�Uav�������
F���@a�:�Lh�?�<��h��\�b+��-"nju�*����Oô(NV�׷���:�WN�վ�W[�eN������~(C����ؚ�uL�C%��
�<�R9P��=g��@��#
Be���
+顣a��n�

���-�e�YSS��K4�ʑ�}_��b�AIm|�JNJ>_>�z�
$�����^�~�3�O�P��|4��>��͡8�;�A=�� ��hU��|������f9��܄֟����
+wkFcz����r�и�#$.
+uѬ㖍Q�.��g(��*�-��7��NCu\ɽ<B�=7��-����G��|LAhO;�rVE}�[�΁����rh�L��u@
��gf;޵+w���
��k�oE�	^�!�9���$�㙀7���
��;�BM��d�4�>'w�fT��r�Ʉ���ܞ��W?]�/�~޶���q��Z��*�~j^�]$n�!A����_X�W9�M��,���N�O[Ē7��֥n�
��Ŗ/��*�cQt$�ʵ�A�=/_S���
=�
8���}{��#��~�U'f#SSIc���vU6T�����g\�d�(�:

+\B�'���\L�T,���0N��B��J��~�ό=���]�cq��*,����D��]��M�'�@�9ȡk��GS^�=�vrjF�/8	N�.�Z"�c~�aS>��|�>��
rp-껶����q�?k��t]���6;r������P9�I
p5=�_�'�x�O!!H!9�r�Tͻ~��@
��C�):����'lT?��
}����u�5=	�/M
���T�Ϯ��$~r����8�s�p�=<��u�/����a���CBP��l��;��v�"���N7��l(�~�s�K\,�#��u�M3/՞�
;�9
H�
�'�����|��:��l�0�����u���sY+�f2\��$H���`����.�k��b����rhg�Uc#!8-mȠ�MU�
�Y�n�%���ٿs��[��f�o��h��x���?�Y�߬f���L�F��+
dA�/�O�n�B�LC&���~'��X5�,�_ ҋlB�ԏ�[�:p�
+\��6���V��
F���M�����Yh����n�
Al�&�:S��,���E�ܐ���K_
q�P�'�)��?\������3����A����%iKY�N
<hvh�M
8�.��]s�s}V����V�!`f1Q&@xGA�Z�GX�%�ss{�	�6�<���`(j���>k����~11t>�+��|��t��R�`�SZ�2�R�
bj�m��iB
#
"��/6�R����P��9N�0
+�p$�g��l�o��s N�r N�r �N9��a	w��mY2mWbPoJ^�Y#�;TA^����c�I
VF�;����%��0r�Q��J� :J0�g�
�
����g
h���9G�<���pϩЀy�
޶fX�����H�ӇI�m�5ϧm���|<����L~��_z�_xB �  b����4���g�qȯT��覟m��ˢ9�$����7a@:��
�N�ѽ)}�L��[��_��ؑV����0
�ϟo�w ��b0Ї=8
v����S
+
����2NS�}����3�
���'��<���-y�A� ��@
+endstream
+endobj
+1245 0 obj <<
+/Type /Page
+/Contents 1246 0 R
+/Resources 1244 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1207 0 R
+/Annots [ 1239 0 R 1240 0 R 1241 0 R 1242 0 R 1251 0 R 1243 0 R ]
+>> endobj
+1239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.681 512.017 301.234 522.921]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+1240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.196 347.875 335.441 358.405]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+1241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.382 347.875 432.469 358.405]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+1242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.228 347.875 513.996 358.405]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+1251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 335.546 90.996 346.45]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+1243 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1247 0 obj <<
+/D [1245 0 R /XYZ 89 770.89 null]
+>> endobj
+1249 0 obj <<
+/D [1245 0 R /XYZ 90 398.391 null]
+>> endobj
+1250 0 obj <<
+/D [1245 0 R /XYZ 90 390.471 null]
+>> endobj
+775 0 obj <<
+/D [1245 0 R /XYZ 335.706 309.12 null]
+>> endobj
+62 0 obj <<
+/D [1245 0 R /XYZ 90 294.833 null]
+>> endobj
+1252 0 obj <<
+/D [1245 0 R /XYZ 90 265.997 null]
+>> endobj
+1253 0 obj <<
+/D [1245 0 R /XYZ 90 265.997 null]
+>> endobj
+1244 0 obj <<
+/Font << /F73 560 0 R /F1 834 0 R /F11 621 0 R /F8 802 0 R /F10 773 0 R /F13 835 0 R /F35 1248 0 R /F7 803 0 R /F24 537 0 R /F60 540 0 R /F94 771 0 R /F32 772 0 R /F75 562 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1258 0 obj <<
+/Length 3656      
+/Filter /FlateDecode
+>>
+stream
+x��ZY�ܶ~�_1y�9e
�o9N�cY��XR�M��vm�
�
-
c
^�}�ə��M�U�@
��Fw�C��j��V/��rsu�<	V���*^��V��J�̍b�ڮ�w����U����0�Z�|��櫗7o��ꫛ���|��V>Ϗ�$]����?z�-4��� KW�4�Z�*��\���Ǖ7g%�.X�}��y�W�Yo�4v�
��Arݙ���SsMKi�޴2���C�������z�v}Q�Ҫ߭}�❩;�Y�7e�yW7k9�5���y΄	2��2�*p��r����z�q&��Nـ�(�Ƕ���X�Y�"��Y�u�p�ԧu
9�z����|�GN��Q]���<Yo��s�
7����
�Zy�/8�p���ړuYp^մ��E���I�(�)��֚�t0�V�Uy��z�ި cnT��bڦޗ'n��+qW�=7/�Ԛn(��[�
*�[Mu�Oܬw=��jn���܆R�2���sQ;П��d
+8Px��|NK�5w�.p��҂>r�3~�
M�k�
+�F:O\�,�z�,*
��6�pG�
��|��
�XN�`��$*t�b\Z&��uQ����e��16�����8������A����ZZA�E=�&���y٠]�`��t�^�O�&;��aS�iG��7m�f�d�rw2��n��EZ�^RIi��Q�
;ƫE
mA�U�-�c_�;I��)}���k%��Xy�K�LH
5ѹKm4�\a�!
�"ƅx�Q������n
(G���2��"����x��\��ㄊ��׾C2B�5���ϩL��@
+�>}��46B4�v��m�6
vmS��sK�.��=�"��V��Pw�n)�	U���_��~1��;�Y�^deJ"�/�
+׸�R�����2�0Y
+|����\�
B��[�x�)�'�\�O��
��n���B�Oآq4��
S;f�F&l�f�zx �p���%�5�v
@
�u[�p�0pS�/�?#nBO�
7)ĐDz��ؚ�n弽�B�O����M��Ĝ��u�D|�P��V֑V�Bcfo�ho�waoٛ/~�A��A�~ '�r�P��H����<���y�^�@0�L�
� �R/XE!� �>�����و�
���'��d�H�q�,��k���b�\_|���5���) ���CVU,�����{n笾1�!gC�X8���wQ�ʠ��\E-5X\4��8螲����
���Ly�
��Zv630��Z����u�B���`����sņ;��d�:��C;����
���H���#�m��4�y��Z� -4�\o�
V�K�;�P̰"a��g��>�
�6�A_	N�-��-��?�;�-�
��FzCIh��p<6-D' 	A�9~g��—��\�g! ���� ¤� �Y��1#���
������S�ΔL�c��[�܆�,��)��ppJ at X��"�Ζu��9�ր��A 
:3FR�]���욲d���AY��
|��KGf�idO���t_7��^?���绱��)Z 
+�=
�~�����e��
�c�ơ��U�
%�B�_H,�}-~� �����B<���c8��)��Y�p���J
�� K`��y�hjtUtM�ހ���r
[ ����

��������D� �.�,�'P����6�	�7L��6]
+=��4���Q�a�Fv�n���ɔ��jڰf��
���6�NR=Sp�~�|	.��^�WE�Af=Y���7�}��#��������^���<�y��z�Ժ�� �
��y{�G���lb�h�Z
+	��%�
��~H�̸
yv�>f�ĝ��_�����@n���L�k>GI�S���݃
����'���Wm�l/)���5#�i�pϩ�q㳢����L�!��c��a*�P�  ��HA#��CP�\�E�L|�mP9]��4]ˁ�JyS�-_�`�V�B�?
MB

Q�׫��4�jt�*�ev�
+
�-�^S
X%/
&a�,c]be�Zޢ,�Eٗ
��D��h
��A!�JA/�T@\����dI��\�
���â�3RӼ;Y�0�a��7
պ��ìe�(�9�ݻR�����Oh��Pٚ�o����z("b���!y	�K�_y�O������
,������h���5/"w
˼���"��5��5��Q���0�� ��U3Zs�'v;�:�i��2���c)�jz)����Q��pW�PН� �u�=���,ϝ�,�iϖޚ���� &@i��#�-��ͅa

+(�8�כZĘt�"7��O��+�nE 7��x��cN>v��
+<���7��r�0���
+�h\RFVŜ�T(�@�
ݪX��y4�
�4���CM�)E����e�d�
+3�p_)��3�2tf׶Z�o�;>D�3�����ێ�+����P�æF�AS��!���3���Ё��C<]́�S:�Lh�����zc-�S^����K��@Ij|���c1�yn���!^
b_n�7_6m
B`J���
>��A2!�M����
+�^�1�5XskjN��ů{�rc��?8񾥈�g�J��1�e����;"�S�;a6֖���M*�c
Ӎ�O��x�c�
2W��s���<ļ 8�;�m���>^�Dl"#�A<�#����=�+6���h�G|��#��"ͦ�
tkI��
=��m�K�0NƜ϶9>�-oD�Z̍ϞICЁ�u��@!'�3J�bG%�5�e�a��
��Ś�>��|�Sn��a 
ʍ2��CSne
�`�� qS�1�rY�'K��c$�
?5�
���H
�X���,������Y�X �Y�j
�
Npk@�Yr0�
\�����"934�C�zɸ�+������(��R��€u��7W;�<ʢ�x
mN
���!��zk� ��x
���
#F�g܀T�0G6�Y�1����
+'5K	G����/	g�������
ǀ��a�O{���k��F��gM�೶���$���o �*Y� T�f[�N$���7G�^p�Jncxh���l�h �R�p�0#�$D�i�P���Ҵ:
@3�E�Mg�tx�q�F�K�Ո�Pb��ނW��'�o�~�L!Ɓ�G�f�Ji��
+��Ҏ
�$h�Y��\,�&c�8�v����EaK��(�E˯�I6�?y���3'?k'
��l";�%���b�
��Io<><>�,��2��Oh�G���Y2�-Ɉ߉w|�]��yc�Ѯ�{
_�E(��MwO
ϱ����u:^&ͩ�i	_�>��>�ac�hvd)�f\�>�6�����F�F�"����#��b7K����Mb�#�ל(}^�_`Ms1�z�D�� 
��E$�UzJ�*���0��	����u<|r�t�Q���v2���g��'r/�Wܾ���G^e�q��0qp'�A�@
��ʴ�%��Oi�[k�L�8����;�/�3��3�t嚾
�&�7��!�DZ��n��ʉ'h�8������Ӥ��O
r�9#���M)Q�c�n�M
7�跸�A/��$�:�u�s����*X=k��Dn�6A��\
+�;9O
w�L�EgI�Ⱦ:B��	Iq�ou=hy_G�=x@�;��t�Nxk���y{7��7��O	�j�;���O���=��{���׉ir��ޔ*���l��I����)F)�ox��x
+endstream
+endobj
+1257 0 obj <<
+/Type /Page
+/Contents 1258 0 R
+/Resources 1256 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1207 0 R
+/Annots [ 1255 0 R ]
+>> endobj
+1255 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1259 0 obj <<
+/D [1257 0 R /XYZ 89 770.89 null]
+>> endobj
+1260 0 obj <<
+/D [1257 0 R /XYZ 90 568.825 null]
+>> endobj
+1261 0 obj <<
+/D [1257 0 R /XYZ 90 564.134 null]
+>> endobj
+1262 0 obj <<
+/D [1257 0 R /XYZ 90 394.56 null]
+>> endobj
+1263 0 obj <<
+/D [1257 0 R /XYZ 90 389.869 null]
+>> endobj
+1264 0 obj <<
+/D [1257 0 R /XYZ 475.551 289.604 null]
+>> endobj
+1265 0 obj <<
+/D [1257 0 R /XYZ 90 272.628 null]
+>> endobj
+1256 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F75 562 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1270 0 obj <<
+/Length 3508      
+/Filter /FlateDecode
+>>
+stream
+xڽZ[w�
~��P_�Q7�s�n��K�8��4����dOKi(��hF;�x��� J#Yq���>$C� 	��r0Z��ы�ӛ��T�r?O�dt3��(�r?N�W�>x��x"� �Nʹ4��Q��X������W�HH?�)�f٥D���_����%c?�F��ч_�Q�W���y6��L�QJ���룿,]�g���i���w�ǣ��S�Y�3_&�( � i��J��}�$p��A
��_L��um���O�?bd�n��&)lK{L�n���g�v����)�l�Ȭ��/t����Ƕ��ϟ����`�!-�'2�/�x����
+�g���&� ���
�y��RS���(�ZK�zN���O��|���W
�l��?���N����֝����9C>z���AO�ny��4
��Oj�PCU�ޜF�u���v:y���o�H5�HUӷ���f>����jc!ê�>�k
+��pZ�y�?�
�0�L[7N��ú*�G��a"B�s��Xzn*�2N�R}2u�B�L�}g��C�|��I0�6�0��(�h�P�L�������4R�e��>�v�#�l�Q���RM]y]�{�\E�H�ִ��LE3y�Y�Z���[5��a�}�隩jWFvJ+�j�J�g��XHp��" �P0�[mO�I�޺�mLݷ%�HT&�n,e�u5OT
�zlZ
��z�
��+�+/�8
�L��Tkf�D8ҠC+�O�$��֝v;�O'�~�lV�0��a���j]2AMk$�ްF�G[�
��Yd��,�o-���,��{@���^1�̧�
^ߝ-�V���~��1��N-�	�¯!�
���D$���V�8!���.�
+?s7w}`�n�&��h��;!w�
p��1��O2{�hKU��a�ҺЅe�[��
���5x!K�����
��~!S}f���S=w�T�n�V��:��~,���A
1�a¶OIV�p��1��鶣
Q���͝�
	������2S-�>�eغ���^6���E\��R'f��]����e ��k ��=}��n�uI~��p�
+j��b��/�[0��`�ݙ:�˲Fd��e��%�w�?Dw�
�$�7�''���vӇ�CǍ�= �0[��i��2�A
mS}YK{_uj֙��c�n-���zm!(
O��V���n�?Ah vmx��9:���^��[�yoλ
�yi��j���L�cT;~P��ڑ�O��P�0N�U�![�=uG��x�'�,�<�#LwcDg�Dp`^�7�
����B?�7^|�����tq�P}W���k��
�Wh@�m��H
M�Z����װ?
���3k�6 �L���0
/��A3V(Ū6�X�
�`�)�����T�TI
{�3P�
�2l�ny��c�A��Ώ��&
Mk:ܝ���|g�XL��O�O��ܿh�#w�T3�;-�\�{�۱�$�����~�p����$�����1��!_�)�(��{�ﺩ
+�"_$9���ߘ�j�}��	R�
��,��Z5�^!��d�N��+���eB���� ���{oF;���r vm�l<���;S�m"���]��L�K��+�EBz��OA�˭+�s.�
��5l�FkQ�mM�wK]S�����Ƌ�f_�	����B�|{�;�%��y�
	n��<��,r��u?��4��
�E�(E�!�	 �^ZD����f����p�:�U�^<��P<Rݔj�?��A��j���cP�'�d�)�`^��g0(�	�Sp�;�wR��5-���A����u5���Q'
3��B�P0QU�^��

+�� �H!!.�A
+)��`�cؙe��i���n�+��!x�^:ǚ��#B�p�;�:�A��
̾
1���C
'
�1�^׈�ؾ9��cd�jȾ���&Q.�".
�s< fB�
�"���Xp��R�]":
d�%"����9\���[��[�b?Mٚ��WZ��z�u#ȆĦ2��΍���|��?���V��R��@
p�K��1	m�	0�O7�Ͼ`O�����gg��kH(�ؓ���5?I`΀
���?ɷ��'�)hr��X�FRb�
��T�y����PK8��]�~ZDV��Nܘ��
S�
��*��ߘ�a��R�,ك��P)��|am���
�a���c+<X|#��:��"��s൞UN�}��f"N�ߺ�\qE֙�.��#O�溻����R�d��XbN:��y���^MuQXX�+����H��VB�uY���8��68飄�JͫbPkÐ
H��}����M��(��/y�%�h	�}���ŒY!FcJ���
�Kɩ� 
~�#���S�twͪݾ��dH-3��8���.�p��6y+au]a$��^����?q}߷ڔ��*%^��@��H,��
h�3�nͦ�^��E������К��[���CP����!�

S����@'	�N����!	��m��Y�S�M��)�e2,� ؠ�h�}@y�e"��$
�@)�@�{9P
9P��z

�~�T��,vhLa�)���L(�oR��� �8���`F8��/��8ha-
\
D��s�5Sϡr&��asy����,��-骯
+���
���<�g5G����F
�p|Sz�P
�)����sX�!8�mx�{EE0�T?秊(��B+Թ`���^θ�{�acQ�23���e�nR൉l�<�
�J]�4��
��<��������	6�������3ɷ�L|�A>ԍ� q�30r�_���%�8��m�Jn��<|�mRP�	���|���ng̓����н�A�߄�x�
���o�l�����1f�)=��
+���F��ގ\����3o0��ln�u�g��www>>��%��ω���=���o��pO�ߩ58���~�e�*3�H%Ԯ���17������o�C���J%�!\�-v�ü����؅�W<i�H%'��<�0v���1E�
K��:$B��.X��}0v��qt�c�5�C��=�
+#J���O�w���T�%�����è�O
����
+�jZ�a�@�\�WT��y����->��X��H0͐��+;F�[�6+�QM�:T9����|�q�a�+DQ�R�`��~�'S�éJg�
�M��I;���
��be� �����r�PTA���jTf�_��ߒ�|�0��
�o��M<^rK?�6%�	C��5
+W���+�/�۾��Xp�"�]�s���>$�McZ�Bb�$�~��Fm���V/*Ï��W��e n�W���?�2���8�5�����G��DH��	?K�\�]u�M��FA��?
����������K������~G[U�֬������'	�4�_��<�/u�f�,��o��ԏ��)����NNZ�<�{ۺ���W|:|��;�X��nt�o�#�~<�m���GY����
+�����78
�k������lU7|���j� ��t�S�
+��(�������Ȅ�˕
�נ��M�%א

+endstream
+endobj
+1269 0 obj <<
+/Type /Page
+/Contents 1270 0 R
+/Resources 1268 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1207 0 R
+/Annots [ 1266 0 R 1277 0 R 1267 0 R ]
+>> endobj
+1266 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.519 172.232 513.996 183.136]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.comp.leeds.ac.uk/hill/Papers/papers.html)>>
+>> endobj
+1277 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [113.91 160.9 289.253 170.797]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.comp.leeds.ac.uk/hill/Papers/papers.html)>>
+>> endobj
+1267 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1271 0 obj <<
+/D [1269 0 R /XYZ 89 770.89 null]
+>> endobj
+1272 0 obj <<
+/D [1269 0 R /XYZ 118.403 503.32 null]
+>> endobj
+66 0 obj <<
+/D [1269 0 R /XYZ 90 486.981 null]
+>> endobj
+1273 0 obj <<
+/D [1269 0 R /XYZ 90 458.086 null]
+>> endobj
+1274 0 obj <<
+/D [1269 0 R /XYZ 90 428.224 null]
+>> endobj
+1275 0 obj <<
+/D [1269 0 R /XYZ 90 384.535 null]
+>> endobj
+1155 0 obj <<
+/D [1269 0 R /XYZ 90 353.518 null]
+>> endobj
+1041 0 obj <<
+/D [1269 0 R /XYZ 90 322.501 null]
+>> endobj
+1061 0 obj <<
+/D [1269 0 R /XYZ 90 243.664 null]
+>> endobj
+1276 0 obj <<
+/D [1269 0 R /XYZ 90 201.409 null]
+>> endobj
+1278 0 obj <<
+/D [1269 0 R /XYZ 90 158.343 null]
+>> endobj
+1279 0 obj <<
+/D [1269 0 R /XYZ 90 102.793 null]
+>> endobj
+1268 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1291 0 obj <<
+/Length 3505      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�F��W�4�L�W,�i��X�(���r�D�"�$� �e���{ݯ����T3��{��l�0a��G�wG�oB9��8����$f�Pž�m9�Փj���OD>�hdJ��yswqs7G������G
Dl�m{��d�9��76YB�O��8�<�J���ד���G���N�s�s;���o���
�
�	X����R���?�IƼ�t�-�d�
+^���Q�ݗ�21��K�%�r��4b
�8��;,+�2�2(Q�Ί|���uʵ��Ϸ�~���tQ<�Y�ASP|���*�C��=ٶX?��e�����7��j�#_+��~�5
D����GI�ә��{���.�^�`ҫ�(��ȬN��u�0�*;Ro�
|I���l#
}b�I�᯹�3�Ic�
H�gBr@ �=�a��A������|��y�MC�g"��Nw�:�q|8���P������!�]0T��4����a������e��ro�X��/Y�`�Y�bW�i^��SU��ʾ<f��>���b�/S#�k���r��`_�B{I�%�봂#R����澀�(�m�V0�=
L�%�mY|�6�B�VA�ۦe���k�S�T�aI
+ᇢ�ٓ�k��n��WboI^%� ��kaWC�� ��M�^1�=�֛��M^%��.12�I�紻�8��9���C����0T�,�b��8����g�Lz@���#S���\��X�E�i�'eb�z�SιG�k��1[�I~�D�dTF����3B�3nU���ub� ���2�	��W��'uQ`��碴�i�e�4+ӵS
���E}8�
���/���
����Tfm�&�ݣ���
I�g__/*���)$�c�ɥ�C�9O)jE�]|�SK��|Hʶ.���`�ΨU�*��0
��.p'�k��/���_k˼ՠ��(�T�bk�
������n�������Npֆ�ږ��$�+�@�)� P�� �o�'�?0m �VFeT��S�ψ�,�C%�k�%���@l��k��AhԣVekTD�zR�-�2qO��)�
���������[��/ʇ�CD�
0�.�������������
��\�uu
���
b ok��
�$�t�1����:#�U
vu�aGg���:E��O:�ND:ˌ��B'
�����U;:_�����+Pvq_�w�	p3�*�hOq�M�y�,�W�� �ؐ]{��6)kc�H����uV �X$T�C�᪬sUVY�I*�oC��@�8�3�,��4�^�h�zE#06�)G>C<>>����ۖ~V���7�  ���^' �_
�
��A@`����Rv�]@*�l 8���A� )I��� [...]
����dN`�OU��
�,-R�- ��5�-фZP� \��)�
�-��U�یY^��t-o! �X���
d
+�#�/1T~7�J�����7E��
>��,mx����"K�E::=�GB
��M
R�}�ϛ��Ŧ���|Y�����>���6f+��b0����j��K���(?f�
��d�;�����&
mh��hC;�¯�
+��T�>[,2*k�U'
��
+��@4�Uw>6�3�g�?|5��Z�����>�M���u&��R
�n��P
vUQ�VG�8d��}�q���YC#�K#��>�L
d
�h���h
���
�:� $�]n iWkp��^L���V,�O�4
+����8����<��F�v�FҗQϽ��"h�=)Cp��D�R�"|��H�
a
�%�
 �g	��a~B[!8��
h,`��[w��"%{�Z���$؃6Z�����q ����q�X;G�p�q��8��2ߺa[L.>
`\,����1.�;��σ�ze�w�DȌ�uz�V}��º�
��[��t�N��;X#ڟp������VoK��
#9B}��(Y�ْ���5�h}IZ_�Z�T�`P����N8�A�� ��h}����i}����wr0Y�4D�M��T�a��њu�ڡҘ��Ӧ
H�h���3a�B"���
<cX���#/Xvp�c��3@�NV(�Dx(�����<��d��)#
�2�<E�}�m-�V����+�l���%m���yQ��iE
� J���;�*)���M�/�Ee�2b
$����T�{1 8�&�!E�
+��� �����m�L
<���{�b��+��4&��,�Z���m�ZN/E.�
��=�B_� \�[��-���E6�	-2m]@f?�4�!��m������
*aU.��P�,)���w��
���,Vi��$kb�w�읩���dG�C�a�'�[��B���С�[��W5M���J�&�i��_o�患�[���-��l��f���C,����Ĺ�Xrn��k�.�{�\v
.��DE�
�.��*/�v�O��ujh��l��wn�T��"���N f>gaW�Ck�q�
�
+g\K\'�2[���$�I������nM�%���{�~���#�gW���Z2r�i6=�3�Y˄.:n�5*0�9h[�$�ӛ��>�+�e��e;�%�QI�%���p��¨	�5�G=S��i���m�5�_��
+�Y8�8��m��۫H��G��Ua��K��j
P#��U���W#M�ƚ��'��-Zy��~i_�Ck��Sp2榥 ��Re�e��>
w
 �>
D�e���+�Y���q�e��x�g<
H0/v�*�lkJ�h��c�==�v	��Kp�o��������
[τ�'
����#ۙ�_e�5�Q�Mۊ!1�rMU\�V���.��(!C
R�X�,@6X��ma8
[��V��7]ؓ@e5b�II��!�S;�4�ē�{K5��f�jb�(��ۨ�R����~�
s����y:�)����V	a.J�.I����0ID����q
�ISI�������?�vTDA;�\��\�W�C��g�g��Q��Uȸ��2�cL
���)�؏$MYakJY�ɨ�Nʊ���р���$�Ѓ �k㥞q�r�t�`SS*q���Y)�})��A q{ej���YU�MII����� �ДdU�sV������N�	ZZ

�$ƚ-���&���|�
�T�r���lS
����;=�m��f����b�݀Wt,��
�?��"�e Fb9wEzJ�/�yx�ڏZ^�^%T�
�^���
ؤ�~�"������хy��`P�g>N	 %7&rS��
�k"7�'���l�fX�|c
v�b���˴Z����#�ۤ��X�%��ۅ��~p�a��S���N�-��j,U�L:�G~���r!jhJF	����t����~i��Pv��ױ����#p�y
+#�>�kCǗ99/���;m&��C�Y&�;�u�}�� N�:�
�
����NUZ���U.��wn�q��N��|[�}�bTv�
�qgN!X�(x��}��ga�[�P*JZTf�/C�����
+endstream
+endobj
+1290 0 obj <<
+/Type /Page
+/Contents 1291 0 R
+/Resources 1289 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1207 0 R
+/Annots [ 1280 0 R 1281 0 R 1282 0 R 1283 0 R 1284 0 R 1285 0 R 1301 0 R 1288 0 R ]
+>> endobj
+1280 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [225.322 597.602 328.933 608.506]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1281 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [345.113 597.602 538.388 608.506]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
+>> endobj
+1282 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [211.932 554.379 429.117 565.283]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1283 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [123.594 401.424 340.779 411.322]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1284 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [211.932 326.311 429.117 337.215]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1285 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [440.273 117.556 513.996 128.46]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1301 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [113.91 106.223 265.342 116.121]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1288 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1292 0 obj <<
+/D [1290 0 R /XYZ 89 770.89 null]
+>> endobj
+1293 0 obj <<
+/D [1290 0 R /XYZ 90 721.073 null]
+>> endobj
+1208 0 obj <<
+/D [1290 0 R /XYZ 90 693.439 null]
+>> endobj
+1294 0 obj <<
+/D [1290 0 R /XYZ 90 650.217 null]
+>> endobj
+1060 0 obj <<
+/D [1290 0 R /XYZ 90 594.919 null]
+>> endobj
+1295 0 obj <<
+/D [1290 0 R /XYZ 90 551.697 null]
+>> endobj
+1004 0 obj <<
+/D [1290 0 R /XYZ 90 496.519 null]
+>> endobj
+1296 0 obj <<
+/D [1290 0 R /XYZ 90 441.342 null]
+>> endobj
+1297 0 obj <<
+/D [1290 0 R /XYZ 90 398.742 null]
+>> endobj
+1298 0 obj <<
+/D [1290 0 R /XYZ 90 366.852 null]
+>> endobj
+1299 0 obj <<
+/D [1290 0 R /XYZ 90 323.629 null]
+>> endobj
+1300 0 obj <<
+/D [1290 0 R /XYZ 90 257.214 null]
+>> endobj
+1209 0 obj <<
+/D [1290 0 R /XYZ 90 201.319 null]
+>> endobj
+1156 0 obj <<
+/D [1290 0 R /XYZ 90 146.141 null]
+>> endobj
+1302 0 obj <<
+/D [1290 0 R /XYZ 90 103.541 null]
+>> endobj
+1289 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1316 0 obj <<
+/Length 3414      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�6~�_���f"
+�A��I�4��&����I
h��x�H�������ʔc{�7���K ��v�#�d5!�7'/�O��OLlS��ۉ!-L,��������(!$z��y����zJet7�|�n"(�	נ��{OίO~?��I&ԩ��N&�����d���ws�L��A��`
����ɏ'į�<�J
+K��_��Q�g{�n��B�`�$11�[�O�tƴ�^��2���Jt�aJ)��������������{�o����vJ	��HA�����N!�RFi�I݄Uq�Ζ�o��o괾;�I*���0�B�߬�z�t���j�-�6��>c2�������nWMւ&
Jn���du�H
���қ���E�We��V��hq�x��iq��M�Z��������HQ�S��i
�����6�m;5wM�m���
���.]fuY��
���p����u�M�6�de�e���_��
��H��
�/���O\���c�S޶�멒�m����Q
+A����
�y���Ӑ��ڜ��tW�Dc����������v;sϰ�
�t>���[�h�]�o�8o�v�y�ԛ�CFN
�Y��r�R;(82
+W[TԀ�fڠ���jF;i����),��jNe$�n��R�n�
a`���O��rBc��߲�챮6�=WAb#Tx�pti�G�5�����Dh����i8v�53�t,4��NƄ�s�=�Qr�8L��ÌE
yѥ���qw��q�!4�u
+��/�2/Wnh��괭��i����[1�س�6i^:�_/�1�q�
+}9��\GYg� l�zjXTU�K<ʰ��g
t�uY�bu�ɤ�j�es��cf���:J>I�\�=�̄RV�tn,��ޖ�6��b[�e����=VT~��5;<��@�Y��iZ�>{���p���Y��{�]o�zn��tW�f[�#
������[����=^i{�vMVdM��Gc�3��2o��=��G�ޜL>�)�|�bh���&bC�#�'�^���'P�^X���y�<�νl��޳�v��N
>L���o��Qwm?�F6�࿍�p��pv<�H�X��OiK�
+���`�0X�h,��Y
A&d����axM6���0<���c��Q��
�%j
�%c
+�L��K���`I
bP���Qxh��
0����ꢤ��>Jbs<J�sq/J�z3'� ���EITF��EB%���	��|%��'BnT������Qt������e��w�e���KtV�O�r�i��m�Z��rQT�Φ��H�UU��z��w�P
`p��Z�a��p
UQ�h�UU�L�j@�Sm���+�	
�Bټ66t\T�n�c�y-
=��A^
SW
�}�
+҇ǵa�ю
~ˤ����-Һ(�+pQ��1MD��<v��(i���
n+c�h��� D��__}
�cȉD�w�c�ĉTc��xБ��Q�r>Hi�
+9�)-�SZ��P}�^v$��)-���Ki���D��	����)-#ݭ��XJ�d�Oi���C[���`���¥���V�;�e����mܽ =�g| -X�
Ъ��rnj�&�V�M���c]��W=8�����	e��RJh�v(}B)��RRo� ;��q;��qV��#���]D���b����5�ǂ�m���j1�`� ��*����‰�U
J.�:����jU��g�����P#,m_�u
ꅿ�_�,[��`/F
�>�
R�<����j��%�Z�o 0~�>�y�]�n��!Ee=f�aZ�۬�:�t��)FTH꩐pz,�\5n��� "�2:L��V���0�UU�W��r�ǣ��r���k��a}IG\�+3��#�`�U����č�R"�?Ӹ�������}�hw
��U-�H��ze+��@��"��A�*h�v���)�b@��^��SwQ�P̔��YT^����
'���Xt�>�f
'0�6�����=rh9E����%4��`�TF���B�Wy�W��/�_��#�'OO�j5$~Ր�U◍�0��G��i�ߘ�=���Դ3ak
�n���ʱ���\�
�̘Փ����M3�u:c6�rg�(p&�0%��X%d�������M�PdK!�;c�;_�8A
3j�J$L�O
��L���Ո�=�5�z�A�qOV�ٌe$o�����
��!�a��Q�G`���	g��0�h=��

+3H�%�]Th#]!!T%�)Ttl&�	��<��S���E�4�4�"�.
��}AMi祉��c�V��X
c�Sـ���G
��cx�K��vOq��n���?
�'#hV����Z�8���l,CB
�l��	1�Y:�
��Ph
���9
+
���6vy�(!)���j-b����ڭѮiQ�5<S����%��^��
\bb-�ܐFO�ͦ�ؕzQV׎d!.��.��i���sM�Z�5.�NʹM��,
d����.@ ���P� 
�t�
�U���C\�[�wU�I�������b�7z޿9��HFw����F؛���<�!c�<�

��'�Qv�e�
��x��Y 0���=c`�(�@�1�
+0�
�G1�+5̕�a��I�S���v�b�RƄ�Q��)ᣱ|fY��PCI3�Ʃ'�q:��x��8�	�3�_�?�G���
��
�٭��\Ő{�����E��!cy��y.�c���/�X2��%���Kҕ
��������KE�_1���/�ݬΊ}��s�u����7�������
�o�S	�)�&,s@`��q��ޡe�5��5�etϪ]�6!9��Y85�Y����F���yes;w�:k�U9J�&1�i��.��ʴ�q�_x�,VJ����`%%C%DTJ��倊҃//{*J�+��6�1*
+0�C%�qP�4���K���ي��P��۰
e�
,:3�|�
�b��a0
@�}�0 s�ɼ�+�n����d�����wavP�ܷ
F�/�,�� @��|��S�=n
���C;xwm��v�b.ho����RD/�c,5�
+�><E/�#(4�e%���b'�Ƴ`�tL�<A�Kf
+��Z�"���<(q�Sb)U.�uUV�ƍ+�r�C�Ǫ�H':�Fǂ�a"t�K�	<ȺWu
�Pn�7^z����@�d"�P���i,��3�z�
�_�<�P���>���
p�,��Tt]�m ��w�1#��.;p�
q@��*#P?�����;
��
�
Z�x<6���1{
�B���� F��2_d~��s7hCT7�;�d��cp��}
�w�%�b�f��_��/?a������O�c	㻒ߓA޻������w��eZ�:�AT�(�Ic���d��#�M�
�	�<��܇�`/&&z�N�$�Tu��Aю����,%��S�;
8��OHL��̎�����;�o7|�C�?��/��Q
+endstream
+endobj
+1315 0 obj <<
+/Type /Page
+/Contents 1316 0 R
+/Resources 1314 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1333 0 R
+/Annots [ 1286 0 R 1319 0 R 1287 0 R 1303 0 R 1304 0 R 1305 0 R 1306 0 R 1307 0 R 1308 0 R 1309 0 R 1310 0 R 1311 0 R 1329 0 R 1312 0 R 1313 0 R ]
+>> endobj
+1286 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [482.116 684.047 513.996 694.951]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1319 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [113.91 672.092 307.186 682.996]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1287 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [154.856 660.759 258.468 671.04]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.646 617.297 426.585 628.201]
+/A << /S /GoTo /D (index_BHZ07c) >>
+>> endobj
+1304 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [294.32 574.458 511.506 585.362]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1305 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [365.665 562.503 469.276 573.406]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1306 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [194.168 519.663 411.353 530.567]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1307 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [316.241 508.331 419.852 518.612]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.098 476.824 414.595 487.728]
+/A << /S /GoTo /D (index_BHZ06b) >>
+>> endobj
+1309 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [188.47 269.601 405.656 280.505]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.587 245.691 394.526 256.595]
+/A << /S /GoTo /D (index_BHZ09c) >>
+>> endobj
+1311 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [482.116 214.806 513.996 225.71]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1329 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [113.91 203.474 193.611 213.755]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1312 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [210.986 203.474 404.261 213.755]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
+>> endobj
+1313 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1317 0 obj <<
+/D [1315 0 R /XYZ 89 770.89 null]
+>> endobj
+1318 0 obj <<
+/D [1315 0 R /XYZ 90 721.073 null]
+>> endobj
+1320 0 obj <<
+/D [1315 0 R /XYZ 90 658.268 null]
+>> endobj
+1321 0 obj <<
+/D [1315 0 R /XYZ 90 614.806 null]
+>> endobj
+1322 0 obj <<
+/D [1315 0 R /XYZ 90 560.012 null]
+>> endobj
+1323 0 obj <<
+/D [1315 0 R /XYZ 90 505.84 null]
+>> endobj
+1324 0 obj <<
+/D [1315 0 R /XYZ 90 462.378 null]
+>> endobj
+1325 0 obj <<
+/D [1315 0 R /XYZ 90 395.628 null]
+>> endobj
+1326 0 obj <<
+/D [1315 0 R /XYZ 90 352.908 null]
+>> endobj
+1327 0 obj <<
+/D [1315 0 R /XYZ 90 310.667 null]
+>> endobj
+1328 0 obj <<
+/D [1315 0 R /XYZ 90 243.2 null]
+>> endobj
+1330 0 obj <<
+/D [1315 0 R /XYZ 90 200.983 null]
+>> endobj
+1331 0 obj <<
+/D [1315 0 R /XYZ 90 159.459 null]
+>> endobj
+1332 0 obj <<
+/D [1315 0 R /XYZ 90 126.757 null]
+>> endobj
+1314 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1345 0 obj <<
+/Length 3367      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s۶~���[��ƅ ��ٹ��S�v{:M�@Q��	E*$����g����4��v�3&��;�����gt�������u(f�h����n��,
4�
+J�ه�P��n�	�4r����}�����^�
}>b��3��%	�Y�9����@�����WWi3
��g6�9�����ЃSb�0�c8{���M��׊���J6s�}�����1�b~gq��WqoP�+|y竼[p97ynV
%m�@��)*k����睱E>�+J�W��&.ӿ�|��U\�~�$1U5,��dW/�����c���L)#x2����Yf�����P�L��<q�0��e�W0�M\�E^����9j�6z�K�
V��ܬ����3;��k
���

�f/������F���Ί;?�A��K|�9suq���H�j|g�ռ(�;S.D+I�^�0@�O?܂���\09�7�aP^��z;��皪�KS�k�
w^�7��lL^�MA�G*����sx2\�C4 T�f�ϰ�{4E������v�>����0�:Ļ����aH�����[�I:_�)�gbz!'�G��A�m�6��X
+/�*�:����_Jc�r]�^��ͩc:�!���
]��KF�6��c
&$
/�䍕^^���A;��D�5���#� Lt��y>C�^Dt�5����kN���T���ԋݡ[�+��3��}gA�&�bkp���P#�Յ����CP�R
o)� ��܀m"�C��`xr`x������.O�>#�
Dz���X�}i���2]��
+�_�ɘ��������]�2e^�>Б]&��/SpujA�u���qm�jbgϰ��i���v;ڑ�"�xԮ{�����xX��q�|�/sʨ���n
���[ ����m,(�>(\�9�}pz�����i
F�����]�!�H��8�C
�^
1�� &<�@ڇX@=�@���'!&A��}�A�1(:���1���j�D4����+�C̖�Q8�XȢ��ق�@'ʾ��Y�e�����"W'�Z�6�Ox'&BDA�pEZEG��ĭ=6Na`=,`/��ef� f����b|�5o�F��a;�}]o������
)���!�0*	�ܽ=��
�E�4��.w���kGq�-��.����6;<��x�9�k���
$��7��Ѣ ��S�H�=c\
6�X��������5F���jN��g�V�A>@c��Ic4t��XȊ����ӱ�_�d�
M��2!
�g���{zkv�]p�Bk�d�,0�^��]:�[2��q����|�̈́	2����L>�cv��? [...]
+~��[����
�^�]��@Az�&����m�&��W@�
� N��/}Wo�,��4WEU�K]�B^�X#Ɋ��.ؼ��
��ʷE�poVe�:c`�#�Ӑ���K7}���/�e�MN!�DV���2[xkJ�H��lU��
�v�3K�3�S�j�&���t�����:9�!�~[t���Z�B�Q`C� 
a��M��\��(9�k /�q����Ͷ���f��j��>�
Đt��y���l[���$��
l��TؑM��-�4�.�$�rD˓ԥ'S�	����9ǜk���W�}�f�yk��7�j[��Lw7e�}�3(��a��� 
&�v�$_
+|��>%�ՠ�ic���l�hm#t[P�5Z[��Oo�\˞�Z�3Z���{�0Z+��}G*%FT�a��Ѻbׇ-�֦�
!�z
)�@�F���,���>!wU�Pp�I�`V�I���9�jHT
c|�Ȫ��� �L�L�1��w�1��#21�F_�~%@"wy�-IZ�\��
��/´� ?e0��	$�M@���ÔA
R承��VO6
�,���A��.���[<��*Kw{d��ɾ��S��(K$���#碅%"��
�HA���:�0 ���GG;���.0/�!�
�,�cHf_�Փ7��[�֥���*約n�)�\�Q:>��l+���M�7DO൚S=����:uѥW	��2�T�k�,��̏{],���ϺK�@���-`�<�[@.�L��^n
����x�S�< �;z�� 
���M�1�Xy��QK�^�=jZ5�(
�k���5��Ĵ�a@%~/wy�D�^G��m�A��:��B��e��愗��]I��ʇT��
RxwgO�
[P��#�{q��wPçN�#E���L7���߄U�:ڏ�����k�5O���&��%������@�
�g��K�X���
�����=�Yl^��Z�V_+OݾB=���O�A���&���+n��ʮ� q�@��X��c�N6��;�=����'{��
�G
��8.
��K����!@�g���R��$MV��
��+�C���e����o�qr�g2���m��^Vu'5�R����t�4�	*
	��Y�{ȋb����$�+�Ǻ�[�x6	פˌ8	B���ˉ}�͐��9�(:��w����}�+:4ꍀ�`�|����?�X���r���^A��׻u S
[(N°��wh%���X�`H�'S>O�@&S>�Ƨ|
Rn����.�s���
�Ѓ�,��41�q���W\�
�z���˙��p"^ʹ�/���x�l��`�
��I����m
6{
<=xd�B��
�\>��W�����`��z����w�풠*��T���
ڏ*�*8�0�4�+?�pP�
Y-SKV�~' �����B��l
-z
�@�N���H�X�@d�ȓ9g���Za�Q���w�vA߄(�B�
�>�������}�A�۸��=Q+ w�����(8֪	Dv�]R�	O��o�5]P�~ ()/b����7*8π�]�8�S�n�d8�N�<��	�͢�~X��4[eZ�o�.�T��G�/�:C(��X�ܔΩb��.�!P�E~���0^���f�ͥ?Xl��0��5�
�F�k�]!��|���o��Z��ݣ��<�
����qu

:��a
�T+�����`]���@�)T�gH��wq��5w�!'R�ѥ"��ɨE�
+~Ľ����H4~��
�[d!��6{�Ɛ"��}
aH�Gt�!�|��0�C�儃[��K�!>�� �i�U?�<��Ð���WC�?Ő=
���bH*:��E(@� �hb�V�F��w�H�����!�c|��T>v1d
+ at P	��f
+@�����14��/W#h��� n�}��
Yh(
�����了㏆�?�u�e�\|��z
�
��Y��#
+|)t�
�z�Nٴ�󍘽,����c������
�
\S� �N%	4ouk�ߐ�ݺ��Ybeʟ�U��z��v�
}�Cdw�=�X�s�כSHI�����O�X��|
�n&�)J������� �
��@~
+endstream
+endobj
+1344 0 obj <<
+/Type /Page
+/Contents 1345 0 R
+/Resources 1343 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1333 0 R
+/Annots [ 1334 0 R 1335 0 R 1336 0 R 1337 0 R 1338 0 R 1339 0 R 1340 0 R 1341 0 R 1342 0 R ]
+>> endobj
+1334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.005 627.03 357.146 637.934]
+/A << /S /GoTo /D (index_BMPZ12a) >>
+>> endobj
+1335 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [194.985 582.591 298.596 592.872]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://arxiv.org/)>>
+>> endobj
+1336 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [318.23 582.591 511.506 592.872]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
+>> endobj
+1337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.297 570.013 243.016 580.917]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+1338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.831 435.385 224.415 445.731]
+/A << /S /GoTo /D (index_BRZH02c) >>
+>> endobj
+1339 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [277.924 435.385 495.109 445.731]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1340 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [188.779 402.279 405.964 412.625]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.cs.unipr.it/Publications/)>>
+>> endobj
+1341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.334 402.279 501.476 412.625]
+/A << /S /GoTo /D (index_BRZH02b) >>
+>> endobj
+1342 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1346 0 obj <<
+/D [1344 0 R /XYZ 89 770.89 null]
+>> endobj
+1347 0 obj <<
+/D [1344 0 R /XYZ 90 721.073 null]
+>> endobj
+1348 0 obj <<
+/D [1344 0 R /XYZ 90 668.49 null]
+>> endobj
+1349 0 obj <<
+/D [1344 0 R /XYZ 90 623.428 null]
+>> endobj
+1350 0 obj <<
+/D [1344 0 R /XYZ 90 566.411 null]
+>> endobj
+1351 0 obj <<
+/D [1344 0 R /XYZ 90 533.304 null]
+>> endobj
+852 0 obj <<
+/D [1344 0 R /XYZ 90 476.287 null]
+>> endobj
+1352 0 obj <<
+/D [1344 0 R /XYZ 90 431.784 null]
+>> endobj
+1040 0 obj <<
+/D [1344 0 R /XYZ 90 398.677 null]
+>> endobj
+1353 0 obj <<
+/D [1344 0 R /XYZ 90 353.774 null]
+>> endobj
+1354 0 obj <<
+/D [1344 0 R /XYZ 90 308.713 null]
+>> endobj
+1059 0 obj <<
+/D [1344 0 R /XYZ 90 241.081 null]
+>> endobj
+1355 0 obj <<
+/D [1344 0 R /XYZ 90 193.962 null]
+>> endobj
+1356 0 obj <<
+/D [1344 0 R /XYZ 90 149.617 null]
+>> endobj
+1357 0 obj <<
+/D [1344 0 R /XYZ 90 104.555 null]
+>> endobj
+1343 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1362 0 obj <<
+/Length 3610      
+/Filter /FlateDecode
+>>
+stream
+xڭZIw�H��W��MD�­rS�ر��;r���Nh�,�"�����@Jd����U��@�(��j$F�'/oON/"=2�	U8��1�|�!�?�ғ�d*���]��2ٮ'2?M���
�R{BG����#����=�t"�(F��
�(
-6'�%FK _���M<zt�6#_i��F�_Os'�r)�5I��y����
�,:���
+_�a�қL��_��h
��/���
N/��0^
��·in��ߔ?)ƫ%�l6i��
�|I�^�]ۼJ����;\I?�Tl�݁-
l��
[9��[�NT0��GزJ��|[Uϛ6/������z�Jp?z4q� �K5��z�����p�'�F�g/Et\��3&h>�f"�t�_�dW����1p�}=����X4SΊ,Kʥ�I�����ˤ��]6tI2
+�x����M�}�޽�L�P�g����>��n���7�@��g��ѯ��"�+��f_��d+
HI�]��T!͢��n�t �pA-��i
\5�2�S�V�]�'j)!"�
0w�V���D��KL�5�J����=q���<�����$����6���+PR�@8��qH�lE��R=�W(v$lKt;N������[�0���
-�`��6�ј�4����$]J8�Yf�LT��
���Qr��G
�
��
+c68���þ���؛j~c��=��
koP�
_�
v˄�dDL�o�bY�Љ��;�JX�jQ�[�F��.��@)8�t�5�������p��I�vYk�HGn�r��!ht��T�B�I^�*yH���BQV�����^
+g��.���.*��	0�)�7_��&�7�����j(�F�(��
�m���������8�|��:�mTC�=��!'1�:"V5�;�Nt��W���4`�?�͹��
L!��Sa�!�"pH����gt/E��0�R*A��~�J`�@�mԄ�w�E��}Qۊ��W^�S�4'W��/�5�5�B����B��
+�pM#a{��r��X��>h���O�̒/{	��� ��{�2�
��r�`������h�*��t�Q
�ZdOk�,��N	Y��=����Ӫb�]�v�U^�i
"�.\����DY�Ȋ��$
Hff�6�U	�B��7��Ӫ��؁���p���
J1_2%A�~F���Y⼌����B��aԴޠd�C���m Y�������㣗B��6I���C}��SR	�E�[�~ZФ��X��s�d���'��_�-4Njٕ���d�.Y
�=���N,�c/��Xpy~�8�qj/������J�
ЅT~O+�sT$p��x9�
|͐~��K҂�7Ģq�H�����մ?�m�S�
�͓c�0 �
���!( ��&I�:�i�U�6��L�XVP���s"�t���CP���$��5
[�Q��o��ͪ�
?��Gz; )W�&���E��N��
ϲ�z����0P#&A
+��r�a拾���|�,O��*E鄚�;[|�j@�(�0
K�djh�ܹ�
�4
~`���l6�� h�CQ"
�w��u�
 /�m��� �
G	XMQ�-����Jy����&"�Ea��0H5
�iAR.l���|��q��#�����
��
!��B|�Ţ5�W�D��A�c�f�#QI��]�c����.�R�Uft���aH���ƪ� H���w����� ����;�@u��`_�%!e*�
�r���DG�bkъC��W�	2�@��&\:���$Y�b3h��c�U�GJI�D��{��ex�|��M��N�іS:�Aq��XW)�$�d"}����(��F�{�-İ0`	����돐?���Xc�O������R�-D*�h��iG�P��?W�
� ~���B�,�ԫ
���]�j8Щ��کhRZ�@
��x��y5i����w�VW�؀fCF���5?f��{@��a2
+�0_�ܺ
H�yt�Uy�kΜ?m�E��6�n��÷�F3���s�
8u�5��S'�#��
�A�ӕR�%+�;�+_6�7~�����@��ٻ���Q���~�h��"[��Uc%D�G��)o���M����p�L */�
aDX
V_O�re��n�Y㸐�4�~�d�
d=A[Uxh��ݟ���Ť��`^/�t��WM�/+IW���l�C	�)[X
+Z}
�� @�5��21򻉎(	� 6��EN�� �9��FB7`H��7�,�!j�ʝ�����'���N-�I6�
0Фd�L1�hv�cB?\fb^�@ɏ�%?s�^��`~�@�pG!�2f���Lſ�����9Y������
�vv3������X�
���䄧��0�W�H�(�"��&��9�P�C�.'u�~o׶ ���0a%mECi����
�l�`;��;S�
 k
0
�
:�c�O
 q���H��p�i��[�����R��PQ�rF��;����å|��&s6�݀��p�l- ��dz:
0���Fӆ�X8��(
�¸��0�#�a/��
{%V�>w�^=4��z�

d쪁�e�Z�m
��7�lV��������w����Ǖ���(�
����qǭ�kx��-ɭ�y�4S�
+f�͝-y
+j
����K˯A�
$x`!�H��1?s�-��#qG��k���O����H	�
x
z�N���h����)�`��)p��{"��\`l�E F�Q�q	x?0�H����%����7
H����$�$؀Dǀ�q��18D�%��R��U𓆫\c��Ě-w�`"W��G
�af
�=x��V�:�"�=�D��x�b�ú;ȋu5�>
+i�i��
U@��4�B%n2���Χ��ǿ���6sS+�Ms�#I�N�w�5�G!�,O�P㬝HF҄y'�@k���g�
K��ϸCZ��çZe4�A`GЫ@�>	57�q�NO����,� �(\�t�?��W����r':���x�Ӗ{
\�6o� ���׃l�-���n���'�b��C�sZg�j�2��uS���'O4��
_��,
��S�X�>
��\���;�CΊ]�(vw��G&�q
+�̚��&r��X�~�.%�5�iI�N���р���
.,#�
��9���:
���N#���3��Z��!M�${������D��0h�����&Q��;z����?��#��߮�i�����b�/����V������H�.9��k�����j����s��)�ߠ��k���@M� <�~^��h9��e(�D�w�r[��M	f�8��ځy�j���<�]���	���Q�Oa?^]q8���K�5���U�Q�
��� ��w�b��!���@~o�biy>�w��yt�T5�9,��c^y�l0�6���Os;Q�:WWC�d�����7�З�+f�A��ݭ������#Ϸ
Ej�B��
F��5���+̤�?��/�/^�;V4A��_���E�v�fq�ܼ�
���3�U��P���"o��E���
��/���s�
	���g�
y�[U6_y�b�|���h,��6Ei��eHP��i6�
��R�4@��Nx�(Rn�a�
6
�pz�ѣ����Ϻ���
+endstream
+endobj
+1361 0 obj <<
+/Type /Page
+/Contents 1362 0 R
+/Resources 1360 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1333 0 R
+/Annots [ 1358 0 R 1368 0 R 1359 0 R ]
+>> endobj
+1358 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [243.563 536.609 513.996 546.891]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html)>>
+>> endobj
+1368 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [113.91 524.749 139.813 534.935]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.ifor.math.ethz.ch/~fukuda/polyfaq/polyfaq.html)>>
+>> endobj
+1359 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1363 0 obj <<
+/D [1361 0 R /XYZ 89 770.89 null]
+>> endobj
+1364 0 obj <<
+/D [1361 0 R /XYZ 90 721.073 null]
+>> endobj
+1365 0 obj <<
+/D [1361 0 R /XYZ 90 693.878 null]
+>> endobj
+1366 0 obj <<
+/D [1361 0 R /XYZ 90 657.914 null]
+>> endobj
+1367 0 obj <<
+/D [1361 0 R /XYZ 90 625.825 null]
+>> endobj
+853 0 obj <<
+/D [1361 0 R /XYZ 90 565.951 null]
+>> endobj
+949 0 obj <<
+/D [1361 0 R /XYZ 90 520.687 null]
+>> endobj
+1369 0 obj <<
+/D [1361 0 R /XYZ 90 462.033 null]
+>> endobj
+1370 0 obj <<
+/D [1361 0 R /XYZ 90 416.769 null]
+>> endobj
+1371 0 obj <<
+/D [1361 0 R /XYZ 90 370.788 null]
+>> endobj
+1372 0 obj <<
+/D [1361 0 R /XYZ 90 336.164 null]
+>> endobj
+1373 0 obj <<
+/D [1361 0 R /XYZ 90 266.152 null]
+>> endobj
+1003 0 obj <<
+/D [1361 0 R /XYZ 90 210.273 null]
+>> endobj
+1374 0 obj <<
+/D [1361 0 R /XYZ 90 162.952 null]
+>> endobj
+1375 0 obj <<
+/D [1361 0 R /XYZ 90 116.253 null]
+>> endobj
+1360 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1381 0 obj <<
+/Length 3744      
+/Filter /FlateDecode
+>>
+stream
+xڽZYs�8~����R�#� 
y���Nl�k{&5��D����Ȍ��o7�D��'y�JU�"���_7�#o�������m(F�<==�bo��+x��>;"���~$��eq �L��ǻ�˻�G
;�|:�z�`�1Z/�0%���x�9t�y���џf�j�s�����?'�=�w�H���ѻ?_]������ӷ����\κ�޸�	��s�謚�r�"g��_�7�E;��m�����ގݨ����3߹�K%5v��\�u>�y�i��U��Ҋ��*�v�����$���J�t=1�p�
+/
M঱�t�(���8�
�,�4Q�x"�z]�5�c'�%
^����kU�+��4�x���j��p{����xn���<
s�|3��J�M��9i�9�ɮ�U�*�	O������s��S��n셰*v}
���p�㊕n �V�w �R���1�@���TS�L͘p>��t9+UmG�vq��c�cǝ\ک�e��lƁt��O�����Y�
ھ����X���(8E�^��ŵ��Z�i��
{���ؗN��w�.��tc޾���6f�.ӕZ��'Br�������T�S.��2��:��Q���p��Kj�yZ�En�>�u�W�*�2�%��sQ$

]�ݾ�zA�i��\+jUES׀vR��XD�Z�ͧ�?n��n���	?$6��x�|a�#W.���ݙ-2�� 
^����
�g"<��Śf亪iN���&(���1s
��Ьu��A�Ɓ,3-�k0Ǖ��u~��2���:�
�<���ng��𬮯���}� #*jϭ�δj�T7vʃ����gp`%�q3�
h��o�Bv\ǡ�=4¹���#`��v���s[�/fȺ;�M휧q�-��t�ɥp��m�,��e���i�0�>#�ޠ	0瞶�i���_��%�l��8��{9�*�
Ni�2]U���ZYO��F��ؐ�
��?��N�e
��
 ��>zœ]��)�u!3f��L�΃ڬ�|�q-�����xkǸ��
��kUR{9��fV�sکڀ�V��6��*���<�,~_rf[/@"<6(����������
�Obb~ĝ���􋸁��KU�o��ޙs���8�.Τ+��
G�kj���!��D�a�|Q�
:|D�

���c�9
����-��ͥ
}@�߬ [...]
��:�j���YҍN�
�?jZsWԺ�}Ҝ�v
+
��`���P�n�톜
t};p�V�V! �8p�hϡ�t� Q����u	�m�5�8l�
 �IW
�%?t�0�"�9pŖ��X���P4+������/ �9쐤e���*��)Y�qBx����o�눥�v�VK�� 9� j�� ����1ʕ����V��b^���2s*j_@ ^�C�$0�`ǐ���Oz
�co�
',�[�_Q� Z
��ӓw<�I�
@�}���Ȃ^ ��M�h�F�&���}��
+.i�Iٸ���	�🉉}Ejr
+Ra�3HJ �h618l�0
�5��O��#Au[�5�1��|(�2WFqG��NE-U�9�W/�k�獁0h���&T1I�Y�ӊ
��D~E��쒚ޘ
X��qZ@�-���<�B�1G"{���l�/\��>�n!�e����a�%�����	��M�R
?jZ"�IJ3�3�b��
�d��!�$�Eǀl�Ԉ��b�w,y���ћ��"�ߡ@[��W�!� Pc�*M[C��;I	DŽ�D���7��0!�6��Yh<F5, ������ĝF�����^�����P3����´$�t�
���y��
·��%��L𻉷j�w�;\ߝ�X7	%g��6
�tb�0��.��K��/���Z���q��P��08�i�i�X�԰%�{�Ӝ���(sp�6������WHS�JOn�"͓t��Gr��i

��^�
+���d��|U�h�e;A �c3��
+�+@�!(��
lK��N��톀u�nJ�����8��^�%$��>"��"�
?���]x�(�1̻B�
� ��5�wa������(>ʻ�+D�w:
��`�$�m�CQ�_�2-l��2Qv�uE�I	2x��>n����%���vy����}8;3�A!��p��пM���~/8����B�{YlȝK�q�F�;O����3��aD���Tv^�w��T�a.��0�-��û���&K��;��L�$`Te5l�=��
21�B!��ZE"n�]�R1ȍ�C�%
+]�u��H����-��j���.g��w(K=
^�BEA�G� R�R�m�T�&T ���4��W�$�8<0�X���u�v FHض�&ǣ�,
���5K��C��%vL�m����碤F�/c[m(�����l��A�-��m�7]�KL!
ߪzi�Lt�{X��sґs��2��z���ށx�Y�4��t
�
 Alh׮Zn�-ůP�xAh1�E"����l���I�|gJcyQ�Y����
�r���[�~H��C �h��E���Ր�!��=�`׫��ڣ�=HOڅ�0IKo�{x�����
�C�RL�}�����	t�)t
wHY|X����d	�"
�n�����9

+��ʝk���
S�-�B+7�l]�w gN�M�"(�U� ��M�&t��]Êl
+9
C��Yf������˨m}@I�]�"W��4�u�~:s|�i�9=M�u�6�>��-���$�{��@�;I�G�z/����dV�xG���1E2Hm�h�ߑy�6�P���c��2U�����t�L���ЙizV�P���
�}?K�f��@��>T�
��������lK��蛦)����z���A
��϶&n���qa�?��Oc`&�~��0�L�0���Ϸ��)��Ծh7��S
�2�ܥ�y�������H�`@yX�59��͑�Lgmf<H��7�����7���H.'ҏ�q��q,��=Mު�@b�1ۖ��Z6���f��Dr"s�e�64Z�
��
�����&��ڂ4+��9�����יz	�����0rx�X�
���iX���`?\��v5}��"
��C�j0�%���Ը�/_�	LC��5�
+8�pp�Y�Pbx�p���-� t9	lx ���yE
��t=�{/�8J>���tɶ����%~Ʋ����5�z��te
0:�JZ|�ω��Ã-Ś� ����`t��4x��$.�Y���t]���s�0FӋ��
+=�X�5�l5�^�a���
����"�WY�7�W�?c9�N�6--�"K�Lw�
S��wfNf*���
1�E�O��~}��So�{L���*a�ٯ)���pG�R�~J�yW���,o��g4�
R=�F ?�6%,l�<�"�.��&��i�F�bI�/�����.�P��OV"��I[{f�n͜�����Kj����S
�y �߯
3�
���0
`߾n�5�&��;K�V��^�����>�����vc
��^|��ڣ�`��d��V��=Pb�2H�������A<\ǁ�m
�MC�N
���qD�F^�w�3a)��SU.C��h�|e�;/���`�7��@�'�4�V@��?�����~���=��H:Yh�c�o�m�5���z%Fl��n�M��?V�F \�bn ]?��K�sβ��M*]v)!�Ɋ>j����
�.u�����>�9�)D
v3�f͢��
�zP��`�^ؕUl�9����'7
�š���
+endstream
+endobj
+1380 0 obj <<
+/Type /Page
+/Contents 1381 0 R
+/Resources 1379 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1333 0 R
+/Annots [ 1376 0 R 1394 0 R 1377 0 R 1378 0 R ]
+>> endobj
+1376 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [482.116 259.638 513.996 270.652]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://icps.u-strasbg.fr/~loechner/polylib/)>>
+>> endobj
+1394 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [113.91 248.306 350.8 258.587]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://icps.u-strasbg.fr/~loechner/polylib/)>>
+>> endobj
+1377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 236.286 195.753 246.632]
+/A << /S /GoTo /D (index_Wil93) >>
+>> endobj
+1378 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1382 0 obj <<
+/D [1380 0 R /XYZ 89 770.89 null]
+>> endobj
+1383 0 obj <<
+/D [1380 0 R /XYZ 90 721.073 null]
+>> endobj
+1384 0 obj <<
+/D [1380 0 R /XYZ 90 683.245 null]
+>> endobj
+1385 0 obj <<
+/D [1380 0 R /XYZ 90 649.925 null]
+>> endobj
+984 0 obj <<
+/D [1380 0 R /XYZ 90 618.542 null]
+>> endobj
+1386 0 obj <<
+/D [1380 0 R /XYZ 90 589.098 null]
+>> endobj
+985 0 obj <<
+/D [1380 0 R /XYZ 90 531.867 null]
+>> endobj
+1387 0 obj <<
+/D [1380 0 R /XYZ 90 500.485 null]
+>> endobj
+1388 0 obj <<
+/D [1380 0 R /XYZ 90 457.148 null]
+>> endobj
+1389 0 obj <<
+/D [1380 0 R /XYZ 90 425.765 null]
+>> endobj
+1390 0 obj <<
+/D [1380 0 R /XYZ 90 370.473 null]
+>> endobj
+1391 0 obj <<
+/D [1380 0 R /XYZ 90 339.09 null]
+>> endobj
+1392 0 obj <<
+/D [1380 0 R /XYZ 90 307.828 null]
+>> endobj
+1393 0 obj <<
+/D [1380 0 R /XYZ 90 277.043 null]
+>> endobj
+1395 0 obj <<
+/D [1380 0 R /XYZ 90 233.546 null]
+>> endobj
+1396 0 obj <<
+/D [1380 0 R /XYZ 90 201.725 null]
+>> endobj
+1397 0 obj <<
+/D [1380 0 R /XYZ 90 158.268 null]
+>> endobj
+1398 0 obj <<
+/D [1380 0 R /XYZ 90 126.886 null]
+>> endobj
+1379 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1405 0 obj <<
+/Length 3468      
+/Filter /FlateDecode
+>>
+stream
+xڭZIw�8��W�4M��b ����i;��vOޛ��KlS��K2�_?U�I-������	�����(1YN���ѫ��g���~���n��I
������|��/��L
+!�W�m�W�:۬�R{�?o.&�T�P1�f��[�No��>��(&���~�L������/&�Wi2�f�'a��YL��~?�;��.%lM�[?��K!o���v�^�Eb4%�}n���t�����_��P��ػYj��m��J�d�M[g�k�[T�,/��;/�/��p�&�~�ܛ.�i�aAcy�lx�;Z�u/<͗�vE�O�F��0�^W坩�*�L97��g��~��
�!՚�E;�+��
+s���
+흖˼4��eC������_�����lݙ
�c�����dK��J���)w\�]�.���ꖛޘz����B�+��;?==����֛��=��Wo�ﺚ�}��-�bM��;"�B�,�T�𔾖�+��P� V5�J�#����cj�3�@{ߨbUcv�5fA
�)�6�ʬ�z٭���: 
k���d�[����� ���ܪ)���y��x�r�w�I
�ձ
���2�.;s[d � P
@����� �5\Y�-�cN+
�q
��y	U��
�q
��߁����-�%��
n��֛�ɻ�Z���#⾿N�U�&��qܿx�,3��V��6�ޙyۑV�>T-��yI�
��v
�c�S��z�K�z�E)�Tw��u������eЋ���AE�7�Ig |)=SْG��
+Z���/#�;}���_���R&1X��*�c	c�T��jC��M
w�[kUk
�����U��lS�%�Uw���<��5 �7A�w�,��{���V�|��(�C�4�A�'�Ύ�F
��QӲ�ښN\�]V.����s,��[�֬QE(澊��"�$��TVG`�ӎ&lLV���3:+�q먬<3�
+���������~��&>����rA�D��C
+%��q@�p+s�ߠXX{B�T�hgw�X8S�ḓ��zn
+��tSJ���������?m{���U6 at g�l�w
�@�,U0�}�@������c�R����ršz��S
���i�1� �V'4`
>�W"(_���0�uY��2��3,�@� G�
�K���.��|Vg���H��U/(�3�us�Փ��즿͛)��J{��z���{��J�߸�*����ߡ�Yo
+h��y��7U��d
p2���Wܬ�(P�B��E���F,L3��
�L�\�vU-|���z�=$!�7ф.��[�V<�v͖�@�x�
�n~om
�M�� 2��w��]�:�E��p�
��V�6�~�=wU?P�5���&[[�
+M3j!�t�����!�(I�V���J�ͨ�]�jǐ�ZG|j�P?.A�j������}���;��.rc��
�:���
+ś [��m�
�Q���(S7��0�r[^��b������!�pk�1ٶ�#����|8�I�QP�=Չ`��}V��*�*;ŀ
g�}�Ȭ�C�ZtEE
9rïx:K
qn��+ ����Z0�mx�fS��cՀ�,��1T]�=g=dPg2��p'Ҹ�j푩,�l�_#Ab�v/�b��MC<��8`q3/����&+A7�~���0�P-� �e��DŃ
���V
?IX������Y�>� ��ɞx�x/�xo���2��[N��a�����T 솇�0�������hd�u��1B�\�B�@
z��1�@�w<����T�;U<P�s�p^A-�ـ֙�e��p�P�ф#4�b��$@ ����Y��L	�G�d��T���\����vR3�c���r
+�##��c��;���غ�ہ�54�.
+�����4�X�A�k?�����
+���.c �O�,���-٦�[z�+��W�1�J��͊
dR�+��ǽ�KS;ۜ���l���^g>����ܰ�On�@�g,2M��B�;��D����L))
xgV^MK#f�7y�@���El��R
P�!
+=�����r��ĪR!��cX%�	!V�N�ɦ��Kc����)����Nh
|[�,���᩺r��}ʼnn�Atv	�l�����׿��#�+�(��-�C�
+�N��P��o�Ӻ�Y�|a��b�yu�-xx�2�c
He�̂���ֻ�p��N��#4�Uu5�v��t�T;�
��U�Pi�m�
򆑉��zɉ׫7G�
`��m[r���`o���!��@=�C�� O���R9R4+5�t�Վ$:uHX
�9��e�tp�9��p�(�����.�69�0+%����ͷ�Ƃ�9~��
��юW�"�^
��|jo��ҌL.L��c[�3
��6n����l�X�g!�jW�H ���5\�����+o�٬����v
��2C�*o����cj+��:�QT����f  +���V��Y���
B���^B6"�!q��P�"�b�s&��p�% �;����y�^g`.Xt
�Y2�xȕ)Ks0R(~F�?%�s�	��[,E�Ð�*��2�R_����
������%��\����\ ��psɑ��+����@��Z�B�G���?$��

�@���~�W���.myW3��@v
�V;i$S绹�
�t�������^oo����Z�"�[��9�R6�}H~B�u�<��Q��O*�m���H�Z��ߠh���*�4Y�@��y{EX����W((�Yv�۠!�1��^��͚D:�
r�s X&�
+�0�w#?�;���	�Ae��,c���晷m����	��R�fӚ��3�D~\l���z��](�����NI�M� еu^u���W��p����"o�9��Z�q�I�m��cT���|�c����=%r��_�x
�"��E�J���AE���'�F
���b;�i
`��sWyUaC�����WWi���@
��C��{��PIdݠ҉w��U��VSP|�}
�����r��"yKj\CH��
+���ZF^���"pz��RB�26���K�;I)d����K`eym���w����x�e����P�
+~<
��	qh����j�l$
	E��
+���-#��]��q�<+����d0R����'+~'���ÿ�r���ޙ��?
r�b�S�n�de"g2
�l��ɓqHY�m���
��h4�{�w��c;�������&؟�:
�S712P'<����`0�B�)�8R��0�؏_��9��	0o���v���MC���jM��'�L�N��{���~,�1[S�9�q�2roO�;>�$����X&Ah��0Jga�<JNw�~
���o��/���������a<�*](vy��m��_0��8jF�	,���)�KP;<���ǵ1|���ĕ�"��h;�VIO�Wm�y���m�m]�@�a=:
�Cڂ"�кrF5�ξ����K-$���
��q
���t����ZMN*���/X�
˚m
+endstream
+endobj
+1404 0 obj <<
+/Type /Page
+/Contents 1405 0 R
+/Resources 1403 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1333 0 R
+/Annots [ 1399 0 R 1400 0 R 1401 0 R 1402 0 R ]
+>> endobj
+1399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 342.687 146.887 353.033]
+/A << /S /GoTo /D (index_NO80) >>
+>> endobj
+1400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.327 308.654 411.303 319.558]
+/A << /S /GoTo /D (index_NO77) >>
+>> endobj
+1401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.77 208.231 290.746 219.135]
+/A << /S /GoTo /D (index_NO77) >>
+>> endobj
+1402 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1406 0 obj <<
+/D [1404 0 R /XYZ 89 770.89 null]
+>> endobj
+1407 0 obj <<
+/D [1404 0 R /XYZ 90 721.073 null]
+>> endobj
+1408 0 obj <<
+/D [1404 0 R /XYZ 90 680.261 null]
+>> endobj
+1212 0 obj <<
+/D [1404 0 R /XYZ 90 634.831 null]
+>> endobj
+1213 0 obj <<
+/D [1404 0 R /XYZ 90 577.447 null]
+>> endobj
+1409 0 obj <<
+/D [1404 0 R /XYZ 90 544.689 null]
+>> endobj
+1410 0 obj <<
+/D [1404 0 R /XYZ 90 486.587 null]
+>> endobj
+1411 0 obj <<
+/D [1404 0 R /XYZ 90 453.232 null]
+>> endobj
+1412 0 obj <<
+/D [1404 0 R /XYZ 90 395.728 null]
+>> endobj
+1413 0 obj <<
+/D [1404 0 R /XYZ 90 338.901 null]
+>> endobj
+1414 0 obj <<
+/D [1404 0 R /XYZ 90 304.869 null]
+>> endobj
+854 0 obj <<
+/D [1404 0 R /XYZ 90 271.394 null]
+>> endobj
+1415 0 obj <<
+/D [1404 0 R /XYZ 90 237.92 null]
+>> endobj
+1416 0 obj <<
+/D [1404 0 R /XYZ 90 204.445 null]
+>> endobj
+1417 0 obj <<
+/D [1404 0 R /XYZ 90 171.688 null]
+>> endobj
+1418 0 obj <<
+/D [1404 0 R /XYZ 90 137.496 null]
+>> endobj
+1419 0 obj <<
+/D [1404 0 R /XYZ 90 104.141 null]
+>> endobj
+1403 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1426 0 obj <<
+/Length 3260      
+/Filter /FlateDecode
+>>
+stream
+xڝZIw7��W�4i���@����"Y�=�2~�
ZM�ĸ��8ʯ�*T���V"_� �P�W
$&ˉ�\
�}8:�H�$�XƓ��I&&I��Q
��O^(��?\OT��A�"�{������a�cG�G_����G~�N�����b�����U�N��I�$�
+��d~��#�G/
)� ��?ݿ���vk���"[+�Џ"��0MBϟ�d�x��t�{��~�f��K�z�����t�:��P����Ʈy΍���2�]սn+�0y�g�^���u����ij��fD��G�����6��f*#�����Y���,��8���Y�E�f�qk�`k� S:|���4OH�	{2>7
]LS�񴇩�<�ƫ)�����
���Y��� �~6r�C;
#�)4���
�jx�~��C
+S�����7'w4��i?w�f�$��yۛ�ݞ�߹��y90sU�U�xs]�uo�n��wzA�|�i �e���+��k�
J"d/��:R	?
+#ws�T(�����!�X����]���1o�~E3O�v
+=3��#�s��4u�҈�����[�H�3��8	}@�:O�w�d&C?	|_���)�|�XT��h��q�z��0Ў�л��N���i���
+�ٔ�#
C_�6z���

+��ss�� H^��3��)��Ҹa�X��eC2�	!�|܍tF�]���f��Ue��7���8�0]�[2W'��l
��L�L�V�QV��ʉl��U����8����P>�"�|k�<���+d�L��*�^�) x8��X�R
�k���v�(����~����n�q�7�֠ڶ��,�x�hq�Ga r�� ;ݶ>)�G�h 
a��f��+��
ͷ}@�Ķ��{f���p"2�P��
wU�6�r�
�]�׽��_V1Xf�͊��$��}�Mݱ܃,�~D��&
^vl�d�t��}�6+c�w}�~E*��ta�iN�B�y��2����o8��L#ES��~��A����Y
�;�12K����ф��3���7H�:
+�@P�V��e�^+:�E~,$��c��&"Ÿ�Mg�$�F��`�;��lO���
s
+�77�u`� X�H��!7�
��Y�}�U���&����r�$#
P�{�cKkK0���_U�	Z
��_|ZqoLG=wF�]��8�qa��T0�	��i_�
��U�:N�=
4��;y?w�{2��!�!	���Bt�زv][�C��	�s�n:3T��t
0%�-7-���mS�c�;{�t L
�]�C;U�ǰ�1��{1�]�[��6*�ީ5�R�
ՠ } �: u at .�;��c��L�8���a���K]w��
"�s�|t�g������
�M�������k�D�3����|��χٹ�[�a�6���ˆ�)�3��
�+�CB� ���E ��a��BS��n��
�E
���da��O-�b��7��������`#p
*�z90�a䫱!8��-F�s���,ڏ��
�1L�$��F
���F��B'�0�X{�(�(KC
�;���~��Z�΢��^� ��Pm
��9'��	��s���T"_]S��'R�S����֚��ï"��?m�R
}�Xj��І~

I
Q EO�E[�]��$�͚6f�ä´$-�b�4ėR
)1~ѣ�
3D�oeg�.�w3(���Q	v�Ј�`����������A��{O��I^�X��y��
��"S�|��U���Z|��k�ޅ�w
I���PyOMK����
"�eM��P���Oߟ��D
ԯ�:�I�m+%���ת
��3��L�y�E���F4
�Ɲ���3f�g'T�7*�0��9Զ�?����i�������&�f[ڎ�wn�F������;m����ؿ�\�w��=-
#�e��bU��"
+̺׳QѓtOϛ������t~2{���
f�
�y��5$�&��l9D�5w�:Na܆i���^H�^@6�;��
H�t�b��L���-@�
Fٴ��Rܤ�ɏH�c"^�h]�t�o�탔/
}�<F	D���<�6�v���jm�7k�ڜ�0�t']�!��
�
S�G�yf at VV%h��P`%b?Qr;�
�
E at t�G"�5=�"FG~�����!Nފ���P�Ɉ/+1?Rm��V���_7��
4H7�����ڟP
�<��W���
+�n1/�!2^,
��3{ݍ�#���Ȯ�j?>
���V���o�
�*>�mC�&��8����P=I�(����^�|[�ë�{��I��y�)�VӔ
+
���š
�Zno�llg[���M��߯_H)�0	7�SѶ���M�eh�_t	��m{��0��8�r_
+\~���R�m��Ff\U<꾊��p^/Q��qJݕ�\

�fFc!�]rE���h�Ɏ�bk��KV�^
���#�:�4�q(�pLz���������r��[)�~��J/ڜ��47�[�r��pݰ�R}�y+R=��;�-�վ5�h�CO�h�ڰ`1�M��$�[!H
�b����w�W6���>�.�7 ����f�C�h3�@��g�[�
����;����y?,��5� .P� ����
�ОJ�X
�����{UQN�J��ÿ���W.��*�Mm4�"�Va_%�4�?���[�>F�G>��
[�c݁�ӝFp����T7�U���J��w��:"?耓���<�d6Rr�
����C�
ͣ���Z�B:&t
	4�+�ǎ��f@��3=��o��DO/ʖp45�ي�4�'�ùӦ�,
�R�*�E�vX�Ԥ�
+��Y��I�5Թ&�g�n2� ����j~r���e��Y�5
�d%}���8�~�A�$������u�|=T�n0�IFv�f��>~P� ����X�h����K	9�»���$r�k��L�2�����7�՝~I� *�)����.8�F��r}��G	|�qA�Y'~�h�6kt�ϭ�r�T��Nm��Yi[�֮����u���1Ԅf��o,��}����ĵޡ�E;�h�M�q���7��Oݓߴ�㗸2sK�b�"?�ڧ*����U�'�n��[0'h�q>
m|Sbҏp׊��bz�Ȩn	�܎%��6ŀ
�
�xL�ϰ�Ԇ���r�
ʉ��&Io�z�
p���1�v���c���0[���_�
D�$�n��[�
�W���5 at lCn�f��_ @�)�3���!0�9�i�}χ�x�-�ŵzp�3T�ٜi@�n5��vEs�_Vέ3AF��r>�N�K��ז~ng�($�b�Á��َ���|CoP{�? pwl
+endstream
+endobj
+1425 0 obj <<
+/Type /Page
+/Contents 1426 0 R
+/Resources 1424 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1333 0 R
+/Annots [ 1420 0 R 1421 0 R 1422 0 R 1423 0 R ]
+>> endobj
+1420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.101 280.722 304.554 291.626]
+/A << /S /GoTo /D (index_Wey50) >>
+>> endobj
+1421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.932 235.607 405.385 246.511]
+/A << /S /GoTo /D (index_Wey35) >>
+>> endobj
+1422 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [297.062 103.913 388.718 114.817]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://fsf.org/)>>
+>> endobj
+1423 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1427 0 obj <<
+/D [1425 0 R /XYZ 89 770.89 null]
+>> endobj
+1428 0 obj <<
+/D [1425 0 R /XYZ 90 721.073 null]
+>> endobj
+1429 0 obj <<
+/D [1425 0 R /XYZ 90 669.181 null]
+>> endobj
+1097 0 obj <<
+/D [1425 0 R /XYZ 90 635.304 null]
+>> endobj
+1430 0 obj <<
+/D [1425 0 R /XYZ 90 602.144 null]
+>> endobj
+851 0 obj <<
+/D [1425 0 R /XYZ 90 569.359 null]
+>> endobj
+1431 0 obj <<
+/D [1425 0 R /XYZ 90 513.973 null]
+>> endobj
+1432 0 obj <<
+/D [1425 0 R /XYZ 90 478.875 null]
+>> endobj
+1433 0 obj <<
+/D [1425 0 R /XYZ 90 421.686 null]
+>> endobj
+1434 0 obj <<
+/D [1425 0 R /XYZ 90 376.572 null]
+>> endobj
+1435 0 obj <<
+/D [1425 0 R /XYZ 90 344.129 null]
+>> endobj
+1436 0 obj <<
+/D [1425 0 R /XYZ 90 310.97 null]
+>> endobj
+1437 0 obj <<
+/D [1425 0 R /XYZ 90 277.093 null]
+>> endobj
+855 0 obj <<
+/D [1425 0 R /XYZ 90 231.979 null]
+>> endobj
+70 0 obj <<
+/D [1425 0 R /XYZ 90 175.076 null]
+>> endobj
+1438 0 obj <<
+/D [1425 0 R /XYZ 90 142.049 null]
+>> endobj
+568 0 obj <<
+/D [1425 0 R /XYZ 90 142.049 null]
+>> endobj
+1424 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1442 0 obj <<
+/Length 3193      
+/Filter /FlateDecode
+>>
+stream
+xڕ�r�6���m�*[��#{J2Ij��dv�Tj+�MBjDR!�8ޯ�~ez+��@h4�݀��ql�������y�)�ee��æ
6yR��
z���m����`�݇���:5Tg�|�
Ϻ���Vݨ�S�I�M��o��|�p��M{��q������ͯ����o�}\�'��n�(��ys�@�
�Q�M��e�	�}�����a�D
T�>���Y��o��;k����}������a��G�V�9
J�r��/�0�>���0��/<�7��`�pf5�P�5���IɬϺkd���_Z���=���,J�e��u�
o
��
��  
K@m/CU]C`�m.+��F���)Yoz�V�q�E�
SFP=3也�,d`ӷ���	��C����L(`�OUwT�6t�0�t����g��wf�F���b;?�cÉ
:N�ОE�I� ԝQ]����ǩ*��rB�'\9�-9/5���wB����9��Q���R�^q�2�ǡj?EQf���,p��w�c�
���E���ĥ����e��F�M#\O�x�ˮ��n��B���b�-m����64�g짮�

d�)n��	�Vxر�ö
v��8,�����4p�?�? �F�$
�.���Z���س����3
���M[��ޠΪ���9Y�2
+t
�˜Fܓ9�����g"�I<l̓�Z�pI��%�DU�[;�_�+��b���QrЌ��>3��/wj�����:V$�3���
�K�	0Y����/��[�۟��ܷ�ܳX@����`�7�9�$�����$�5
?U�[��ih��]�5�t�
���]��E�_�vh�h��k'#!lh"7v&���
+ȧ 
�I�bp
;PϣP�&J4�v�5	,��@�I�'@"��̞՟1�Z�]����jTK��i��!E��Q	6m�/���unё���:�m��DЂQL̊�'��뵺���X��Q���Os�_�
��h�2	�]�x~a��u
'e	O�
_���Ziyz�j�
k�����d�2�X v�݌h"�V�H;�B�j��a �V�؝����
+�d&�n+h��j���F �0��
+I�|&h��Ӡ�
<GO~%�#Ɖ��ֈ�Z
�B)5^ ^�G}ֆl
���_���8	�'�{Y��ruq
o9�,�����}p�
��/���6����z�I�2���
+$sl
8=R���j/g"?(�:a��U�/

:�Ur�y�T�R1 at L䖏�tRa�F��B
+�-���,IBJ�m'�_�u�Ƒg�
C�I�iQ.r�j
dw��X��v�Z�%�
.�\X�Е#l0&���a��	���+@}߅�3#��� 
�e�b_���Z���E0��E �n�UP�!ޚʔFI��u\�/	����;.
+'/
���n0+��,��iI=�Y�h�;�/��
�#���%d52������1;G�s���R�~��$x8/c\�Q�-2�)Ԇ
y
�
�n�b�0�JRƙ��T��j��E�2��`�F'�9G\��GV���3	�Ì]"�L�X>,��=��A�Lצϑ�-c�>l5\��&�fi5V�	Hԟ���r�L�4�
�D�\�Y�,�|[C2=P�
P�l���5��k�N�r.� ԉ�EXX�	"ɧr�za�"L_�Tf���ؓ��K�b�
���
���w�qC{\ �q�E�Oz 7
8g�$�OA)A{U0ŒG%3�����8gW����
ϨAH�ge=“>��q"����"�)�X �}��i�u����/�g�

�sկ��������쯌$c,w�\F���J“u5���1d����&pP����qc!
�p%
����Q������Ѝz�߷6'=ۦ���z7
[m��^�F�^"ă�}��X��H�����o/�A�V��[�9U���!�4x��4]�߿"J���uE at b����6�>���=�ko�ʚ�@0��;\x�6��V�
+:�꾮'E1W���[���k�ڬ��O�RUw�x�f�ΔwĮ��o9�?�4�+d��GE �4�ax�L�"�P_/�)Q5
.j�I���6O|��v�+'��� �� ��.E�2����'�������f9��4��dX��zՠ��qz�
�Q�h)w5+e3���S,|�0W`�
�F�<3�����P�lKe'8��Ny��	${2\˼�d�^�%I�{D\�0���eP%S�9�v9�_�4��o-�����D\D[/���r-�Ew�9�5'�%p
�
�uߑ�δ(�1�/
#��e�
��@WpB2;��#l }6=E��Z�X-( �B�B�ā��p��R����K�@J� ��9��G�Ϻ�Lå��ЭB�
P�b�H��<H�m�[�A�e���%O2��<2�_Sp�x��u�K��-��t�
+�ݮ\��~ ��`�+�Xzr� ��'��O�4�	gi�@IJ
^����Cu�2�@
+�� �˒9�\~pr}{���0z�x
8^g?��E_�:�|���x��X��x��Rw�l�?�<��z�s5�M��������y�R}W8L6k��y��;�!���������g�<�{���?ޣK*�_~xǍ��������>�/
�V���`�
��B�;f��o�
~�����`b�wP����2� ^zI�W3X��k��d��,�'�_�T�G�D�;kgV�F�Or2S���A,oq��
ɛ$A�uOn�o�P�/�yѨZ���z�F���W�4Yȼ8�~t/[	Ga'
+$Q�w~y��%*NN�������6�d�D���rB�o��(�
+Z
��,���� 
�+���A���d!��g��o	`|p�X��=�7��e*�F�����+�j��.�A��5��-�*�x섞�6��uw
ԓ{�R

J8_S]����Ɏ��`���^��ؗ�(�q��dJ��W$
M|}�"�E�-�����,���l]
Z���"�w��kVʨ��_��i�S�۾q:��;b!�� �D�U�u)Pd��jK�Ȍi�]��6�
t�W��A� _Z�/��gF��S��
Vm
��7;�ȸ�#ԣ��%�
W�C�tލ���+�7&��ƶ��oI=r�<�'E
+CD�ɘ�o�>N�Qu�}�o�˸���yi�
�k��Y [2������e��,�,7���C
�<�h�ߦA�P o߷��]L���?���
+endstream
+endobj
+1441 0 obj <<
+/Type /Page
+/Contents 1442 0 R
+/Resources 1440 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1447 0 R
+/Annots [ 1439 0 R ]
+>> endobj
+1439 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1443 0 obj <<
+/D [1441 0 R /XYZ 89 770.89 null]
+>> endobj
+1444 0 obj <<
+/D [1441 0 R /XYZ 90 703.758 null]
+>> endobj
+1445 0 obj <<
+/D [1441 0 R /XYZ 90 208.485 null]
+>> endobj
+1446 0 obj <<
+/D [1441 0 R /XYZ 90 183.665 null]
+>> endobj
+1440 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1451 0 obj <<
+/Length 3188      
+/Filter /FlateDecode
+>>
+stream
+xڕɖ���_�[���5\DR��vl��؞��l�$���i.�(_�� .��g_D� 
+�WQ��
v��}�x��,���<����e���������St����]���a��&�~�ӏ�_�����~���.��`��䘝wE}�����������
-�w�(�g��x��`NJ�H	�c�ó><DI�ת����������o�@���/Q?�^������q���!̎itbr����!L���
z�y:����r����٣�������k�������Z�,�[$|���v

☯�vM���d�͔�Q�G��H|���� Jy*���
��^e+\�ך�!ó�ax�i���6}o����cU��Z}B��շf��M�����K��<�K"����u��Ru� �WF=U�'/n����ֵ�/m�eR�me�iWѴHͭ3��A��˿
�d�$k����wR�b
�Gx�
����u;@��n���8��p���:���
"T̈��@G1�w<<$�	�	����آK��s�	N�;���~���!��v�$���
u3�2���
�������:��p
+��T�{R�f����¹�MV���=�M-�f�@�cl&[T��,3��V�|�U��	�
��{8��Ē�
,�Y �%��XÁ%��
Cڵ�`
�g�E�&��R
_��
�3;
+DT #Ң4D=M��a�q!&	?��sl
E�9��z0�Xc?�����Y���f��xt�Fg��;`���@-�Mj.L��n�ZP�r��
�$�%�,�	��[r��U!�`+m�nx|�����|Ѣ4;C����
$݊!?6�)t/! ���|�=�JrU<�dd>n2d�*~,nn
n߰A1��]m,�B�%1�Go��sj5���# ��
B�o~�1�)�P�`B�ʡ�ZK\ !&����G���������Tm�mD"���i�Y�S
��pcU\����1�Zx�8���o���E�Wg8L
I����LÔ�d�IrB �O�^����m�k�w�#�E��‡?���.|�'�;q�T���Y�8m�
��F����H�k��8b
<8D�kKP��
���J��
+B�f������/��E�֋���y�K��x��x��3�z�|�"�
z7�<V���� �t
!}���B֜���.��I,�
�{�9�l�EM������Fa�����Rp@%�4�$��QD>�����M��Q*��C��	�.
��(a rGι3#�yD2��\��'�t�[f�f at u
+B��OO�AҸ��
-3w�9���x�_G��J"�*�,'�>
+Ԓ!��\��|��+ȍ�sm
+ G
#_l�^��t�e�
E
��
"�0kI4���&��Bs�����>l1��q�jJ�9KgD/[F�


+(lxD,�O˻
+ʾ��T9�#��(*�J	�嚨f�@��uTW툲�7
+a���^��n����Tݸ��S�P5P��K��Y����G�v�I
�Ϭ7���
��7O���V4@�:x���,@$��̸r.�
C��- �-*;�>�>� ݺ�&Jr�9��4��TZ�ȵs."E�

S��|}��1�?C9���%�>#��2fm'H��O���R�I9���~��w��=7w
+ý�9<��l0йB
��@=c�;K��ǿ��E��q��8�$9N�Gw�G=O7��LJ!xr��#N&�(s�&[���'� w.#p��ᒸt���HS���ʈCm	m����ҭ!(s�9�-�H� �����an�2<s���|c pe(��w� +(
+%����_>sI�Zt�JthlT�Ǭ��Y�7Ppe��d
�p0-����*CpX���ː[f$r��np�Y]	��]��z�
4�Z�8�F�>˺E��g�cN��-�

�$�sp�a��pq�¸����9:Oglz�h�B }7r*Ǭ�{�A�J
P�1
��|~9��Oݸ���=7��
'
�,���R_�N���(�j�n��8�q�U�P�.%<唾�
 �%�q
�njGq.Q4�ȥN��ޚG.������a�����b�պ� �m?|^�EmЛ�
c!'�*r��� 䣨%�r;s5��-
�ž���
++��8�
 �8frqZ΋�
+�'w�V{gRG"9�px�e=��-&�g3]�C���6����I�y������)�.`D�Tr�Q.�
+,Q9�Sd�����a>��>�Xs�Z�Ў]�	
����u���*�^9`\u鴌$��y�
�0�E-�NJ-�q��+M�)�Z�"	R�b³j���)\.�l�7:���`p�2�;($�b&�0;�A�q(
Em�)
+��~m���3'�z2�J�C�t�xYD)z�v��o
+왔[�tPdo�0��.=]�����E���$
\�`��ϊ�7WN�x��Uެ�M���
-�0YЏO^_6�����`�$�t
�S���r�czs��X�s�_~M�9h$�=�s��S��� #�צ�6: J5(^�M�њ·d%lД�=��捻=��Ek_�AR�abɲ�=k[�����ӷ���Eao�RX9��!�E��P�ta���>��.��9l��<,��à�V��
ޡơ�:��e���yė���[W_[!��Ro�෶�"��q�׆iǔ)L
ӯ��^�["�KݞH�=_��H�������Z�W�=_PN���������I2Xxq��Էa$m;~a'��
+S����&Τ�z��U'��j�|�D��:G3?Ԁ$�pt�1!�4]�W���R�k
��k-��;-�t��KI�ddrƌL~A4�J�ݾӑ�ò��hr������ξ�
+y͖��\3w��<ZY�)�M��g�� I�8������
+-�B�=�
S��7�|ќ�%Ă<�Zs)�j��3N�+m��I

+��ܚ�ξ�X�7��DT�Y����
��
����p��x��
+��e�D5")>Yv�.���Fގ��
?9�Y�E�g������5}ݭ�j���J��O��1��%��^z���;��E��s�l�);&9�+�wpiA�eM��4����wu��G�&t��aB��:rG��Б�ir<�;t��?|xσ�@d�Ys�];R4�/9����
C(��X�
�k�Qka��ɓ�/�gM2�)
����
��0���i�B�=B��3O���dg�ׇ���>�bl�
� �)C�l
+endstream
+endobj
+1450 0 obj <<
+/Type /Page
+/Contents 1451 0 R
+/Resources 1449 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1447 0 R
+/Annots [ 1448 0 R ]
+>> endobj
+1448 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1452 0 obj <<
+/D [1450 0 R /XYZ 89 770.89 null]
+>> endobj
+1453 0 obj <<
+/D [1450 0 R /XYZ 90 498.259 null]
+>> endobj
+1454 0 obj <<
+/D [1450 0 R /XYZ 90 142.832 null]
+>> endobj
+1449 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1458 0 obj <<
+/Length 2969      
+/Filter /FlateDecode
+>>
+stream
+xڝ˒�6�>_�[�*ͧH&�]g�r��z�Φ��
(�P�C&)O���/����rr�F���'�
7�������=�)�7�_����aS�,)�t�z�����Qx/��*թ�lx���ot��׺Rݨ`��I�%����?�������
+6!�N�,�T�݇߃M
�7��恐�M���l����.p��7l�������ax�e{��זW
�0���z�8�K���<���M�rR�T��0���5(A{@*��id��TN�p�#s�������m�@��v�z�ȃ�N�Eh f�'�wB}RM�
��e	���+i�w��$��#z���I
���7���D�tǿ�~����Ow�+:@g��
+��� ]��t�
VF&
G��I
�FF��p��K�@�r�Tn#�F�H�
���bt,���� �@C�'B8]Ꮺ��z��+/2o�5�d
Cr4���� �8�e;�_V�-��$�\'\��<qM+ at 8>J��!��\������=�p���2ɗv��
y�R�5-��[a�f�ˏuN�#J�4<h�SM v�5����N<�b�	��P�C��,l��L�(�렏��Gi�{�-O�
2��ob� J�ï�1�*�|d���X*N��T
!�e�Х�w��I"V��]4{ګS�
H��w�j%��փ�0
�BDL��,[�f�2(���^O�.������J�N�F� �]\`k�Vn��
6p�"�p2��28F���A5%���>3D
Fp�o���]��q/��JЁ$
������Cuiǩ�*��j�=�
��7�)ƣ���0�
�8����ݻWM�F�A
�7��w�
���ׄ(�07�+~��1-U����L����lײ\A�M�r�2/� [...]
+���
+���l�w��:�T�����ku$���?h
#��-���M���&����2H�Dr�82�JƿI��c��q�1�o0���J2�qq��'
+]8�+���j
�
0
�9g��
��*�ןݝ�@&��o���J�ݪr�
�.�#�$w��|�(���5%.>�����`k�
D�&�T$��
C����p�ya({��9��z�/
-�X�UNW!W�g�n$��B`��`a�ޜ
��S��W�2�V7�D ��X��X�z(�i�ռ�~�Z�fo�X�.r�$��&��X��IQ	$Y4��'
+��+��z'�&��Bji	�\�
� p:�4���Y�}`��"�M{-��
QH��ea�+*0Be�@�ڲ@R��y.���U�g�p�u�� �_]�,�J��G�&Nd����
+�
��$��!#�8�1k��T�ߢ�HZ �j=VM��G:�ir�nl��'��C2)
�
�딣7Js�u��(
<��N�D����j
�8+�3P�O�.J�1�mSHv
�@@e��"Hz0[�P��$��li����y���
�%Vny_y���3q�D�� �/
+3�զ����a
+�|��J�?���*J#n�p�Y.�i�$L�� �pD�L
���?ek��TU)���Q)�W�	�j���g|U��c�ļ����E��'�<�P���y<���_F����p
���P$NRg�Ya�4�x�EA䩲:j��d��o��e��������BI�y	��\$\)$��
y�u
g�$5�?�� ؈��+����v�Tn��2; !.�isM�
�UGPU�����D�LE��L0��
���
L��d~�M�#\�И��Y�T.�r?��R���\�0��t�S��e�
��p�����$'��wcKv��ɜL���M51w
�f�q�ղ�qp8�

��T5a�
/̞0�J�OC��GK܀�@�
��FO7#��՜�����m.��K¢d-܌��&�ť��
+�7����l�̕��-G����$Qn�r�
&*�Z�pjL�6���;�ETI�
�^rg<gl�ˑ_iL{��G��X��އ��e}0�jo���R	&w����<C;,�5��ޔ�6�6�̵��"�����C��V����('��o���jn}����Ѳf����݄;?�sP+8lΗ�=���} ��A2���R�.�y����
��>��:�N�"	�d�'�ٺ�K}��
-��>�(��!tkHzK�&�� )�~�=�=�s�{�/Ze ��q$wǡsw��� �ϙ1���9�*�
+ބ]��g�-��;)47�!�m<E3��dWܾC92Eh�gTD�z:[(�3�4I����(�F�|уjY��o&l��p�)Ϧ�'$
#�)h#�9v��3���EȰ7������~]ߕ�zV�A.�&�f�dc�����A�N��W��R��éo�,��s/W�߄L�i�D�NY*�P���� �{y?[1�Q�#
>�~~KCL�(?�%Al���=&L
4ɝE0(�����V�K�h�y��|�a
xp>[L2���h�u
+�!
+X����cy3�d6�v��J
]2cTx���c+�G�`Ӷ��Ĺ�~�GM{�i��
��SyT5�zB�-B�#�[�eb�2��v9=���ٝ�C@��ug.�N�0���}܆�y6إ�*��{�����h��hu?�5Y�T`4nt����[	`��[�>�d��e[3L���
Q
+X�o6����PKP�
+�Ձ�'y�^�O�<����P޼�"�
8(�L�iű��L^�-�
�
�X�.�l� Z,_ �
Bj�v���Ȁ*y�Tx��
�W�%>>���zA�`�ehQ�����70_|��r8Y\ї�C�
�GE���:Ɋu�X��\0���Iʻ�7���\n���"?��o�"o���PP���d~ZH�e몷o_� ?̏��K�]̳�c �
�/
~x
T���H�)%w`�?m����
��N�~���D윦��������ԣ)�qs�ܥ�0{mo�rJ@��Ƕ��u����e��ni�@?C�Y�;�E�Q �_����
�<������
+endstream
+endobj
+1457 0 obj <<
+/Type /Page
+/Contents 1458 0 R
+/Resources 1456 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1447 0 R
+/Annots [ 1455 0 R ]
+>> endobj
+1455 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1459 0 obj <<
+/D [1457 0 R /XYZ 89 770.89 null]
+>> endobj
+1460 0 obj <<
+/D [1457 0 R /XYZ 90 568.551 null]
+>> endobj
+1461 0 obj <<
+/D [1457 0 R /XYZ 90 422.485 null]
+>> endobj
+1462 0 obj <<
+/D [1457 0 R /XYZ 90 288.373 null]
+>> endobj
+1456 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1466 0 obj <<
+/Length 3433      
+/Filter /FlateDecode
+>>
+stream
+xڥْ��}�Bo�T����9��Z�q6��C����$�<d��x���
$(q�[q��h4��Fߤ�;��ݷ~~x�M�
+�H�t�|��.�
/IaV�~����O���4��"�M���?<���G\{���ᗇ ��]��/�wU���O���w;ߋ�|�BH�.#�mv��໬��
+A�?���C��o��)G�w
�O��K��$�_�T���������2��E��5�Шk9��b���]��
+�u㚔y�y���J����A�
����c�<�+�	�P��� �+������F�8�y<D�O���	0��x�jy��,a�YxC�
a�B@�G�)�J2���u3U)�0�������BS�A�?�,|
��P�O[��xmE��/\��K���1��4S�d��Z6c?�g�60��f
�wN� mU��E�{mxKU6
)��Oa���@�??��F��wha�n k
�Xѣ�:��Ԍ�;V���+^��ϗ�A�80`Ł�d�K���ѭ�Ef�U�2��$
�[�� ���1؟�.��#�P�K�9ן
�dofN
��k�	k/�r\
X|+k@ƣCPW]O�M���0�U
p.����}W5�!��)@w��{�w����p{��Z�J��ƀ�K8'��-���
+��-��m
��.
+I�h��\� �a4=ݠ���S��0Aψ?߂g,�3Q�q�L�
�G��
+�	�`��
+�����|F��
���'����0��������ۣ`ߖx��<��K!�`x�x��8Z9㈯
w����j��j�#v58���ʢ��cxHb�5D�}"4��P$责
1�k�Ԉ�L�W8��M7ݟ�g�����j�����.�\�*�����W� ��
+D�� ��J��+Z��[,����H�5���}'{�
�lF
����|�R�]�zq���'IȨ��5֏�h���$@�R�[��Ej=g�\1��a�;�љ�s��
�Z��N�r� �_/`&�FW%ȸ��ד�

�
	
Aw[���Q��i���<�D�
+�e�1�Q΁>*�j�W�8��q����jP0����4���d�7 1?�XM[�p��f��Jb
+p
��4�
�tW]����aw��ɽ��doi��jE��VK<]�"��"��
�A�ՊpY����jW%�{��}����T	��k� oL*��$��
z�܎a`�O`� $P��B�ٺf�#�H~	 �*�Ƞ�2(��WUrx�9+�V�BK)�<MϹ���y�6a��͕��6����UV�w�^�a���∗
\��I
�ޠˆ�(�Μ9���:�2��7F�}� �fm؄
0�^i��`V�&�h.,�)�|�q8�|���ёZ#�;�1>X�X�_�D9D��k��qR��0����%h��,��	�����w`�6�0[�,Z���%�SV�aps�0w݋00#
���:I׳��=g�h�³���@�5}'g�ѣ�q�9�8�"��L4$E�) o��^3��g�ň�Ѣ*��Jh���o��f������v%K�@�|�[�"��S��^��W����h�{���p��u���>�+ά�h
�+�IXȜ���a!��;�J�4�
7�:SY�.���
+�N2��!G�/au#��&�W�x��3+Q��Ju�ڣ>k����ǵ��
�VM�Ȫ*�"��ꋛ��� �ǭ4��	��<���w�@���_)�5T�
���R�^ij-P�
�2��~us���p�[�ʡ��q��������Y+� ��J�K���<��У�͇�
 ���1!A��TF�ᾹF��צ��"��� � {�_

H�9f))Ft�oh�J�ጿLr��	p�
+a�0�1���緾��_Cy�
�)[I
aׇ~:_�Di;�V�Y[���cs���S�$����;EŽ�����@]/�T�M�I
���#���|[�9A
�%gP8������S,���fy|��
`}
�Y���cB��	邹P�fcLٗ$\&��M H�@`-2_h�řԉ3��[ɅuԊ-l���F�wa���F�n��K�5J�p���g`��*!�VlP��S:-�F/	�
QO���n���i�Q���'����g��k�>ی�y'
^����:Ɓ�V�B׊#S2�8~k�ݍudW�PZ_�ƽ9q*��si>
u��!���e��������%֣��pp����n�ْ��?6Z�_���
�7��˥k�k�����ҍ$�n�[
+�TA��
�$?2�OKZf�
��]Zt) F��Ϝ~'#��xkHd��|e�4��CٙV�"�h.n�_����4i���4Ғ����D�^O[f�	
��kp��gr�/T.' |T�=Y" �P,:��8�
Në�	���F��CK�6�4"�R��T�:g���;h_�C�=�%�����ǎ���
�'N��5�a
�Y9�l
���o���R�������E�Y�����jF%%���8�Ü��A�rC��8��f����r�3rQQof6��0^D���_�.f���7=�Tչ��-NK � '��U3��{�n�}/��*;�-=
��Pk�T
,B�rmf� ��m5�
7G;0Z.pƥ8�8��:��6�z.ȸ)8v p��q��+蛹�rJ\|��
�4��SI�-'v���,t���_����-��S7Jt0g�_T��31-L!��Za�\w��Q���wn�e�a���`� 
���8���נ@S��\���F��=n0���k��ϥk�ɍH�RΤ���[=%e�q
�y
���L�t5�KY� [...]
+�P��(����BM�����D�#
+9�G���땛K8�S��Ҷ-�6��d�$;(��RՔƬ�K�Q�wy͚�bBf,��ŕ$B��V�?���u���b)�������
����+�(�[&���]�����
�
�F�����`��D�"�$�X�s��Kg2��+�Vw�;���氕lJo.�#E�(ߥ�/��e
|����C:}"͐'�\��'��[�~��+v�c~Qb�l�&WM��{͔^����X�ξuA�1M�J���Q˾
��z���|nXK�2z߁��{�< fp���|��!�H3�0
�6Rũ�>^��?y!;�T
���,��?��s�X�N+7?
�9�tN�k�QB�b�@G�	g�i 
+NN���3��$M��$��6!��\e��� �I>S�U�
�@��"L�-�L�9����J������~(�l�3/)�
�_
|��,�EwL�v� ޽o��_z ��; ��B�~��{E���!@�&^\���tS�V=?|��(��������+ž#y^ ��c��(H��R".������Wj��S�{q>�v����
�3��٫n�~s����,�{�P�+P6:�w{�����
+endstream
+endobj
+1465 0 obj <<
+/Type /Page
+/Contents 1466 0 R
+/Resources 1464 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1447 0 R
+/Annots [ 1463 0 R ]
+>> endobj
+1463 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1467 0 obj <<
+/D [1465 0 R /XYZ 89 770.89 null]
+>> endobj
+1468 0 obj <<
+/D [1465 0 R /XYZ 90 610.8 null]
+>> endobj
+1464 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1472 0 obj <<
+/Length 3094      
+/Filter /FlateDecode
+>>
+stream
+xڭ˒ܶ�_1�p����dljK��(�\������0�Aj����
$HQ��,�F����'f���)8}s��ۻ���S�Y���^Nepʓ�O3�է���|�����?�@wzT-O��mS��uS��h�qRxIz���w}{��.���SȴS?/N����_�S
�oO���鉐n�$��۞~���]ಙ;6��C�R!�w��� �t���0��h��C@��^h&Ã�����wu�=2��~
+���(��^���.�xS����f3��̗s�zxp%�S�_��<Z�UM��d�V}75�
삮@�{�LS��2w
nj%93_�������]M<��Z�5�@�w�`(#����i!7
+ �=Z�S3]yd�V��<~Е�͎�J��f�xWex𠵀n���]��E��]^�=�3@}�$���3�U��E�K� �?�� d{������J���ѕe1�_� c}  �߁̠+�m���]d����2��7c_����HY���Y��
g��d#��W�<FS�a�'��!D	�QuF����t��tm�+��������������4d���ˎ
+�| �( ���,��
Y^
�V�@�`0�ڇlV6v�
�8�in�gއ7��
(���FZ���
ov)
FR��,j�[�T�]�ڣ�<�Xr�z (ʖ�W]�Xzl��k8,�Hbp�s�!)��'qp�����
P
��F$6j.F��^�� ����o���.<�Jv ȫ�L`�6"f%@���3K��扗ĵ2���s3��Y�^�kY�z�a 'Xs�5
NG��
 h�@��������!��3��zRMg,ʡL�i�h⒍
�۰�
tC..��k
b�	�� ���:����&a���7uZ��ux�[C"R�D0�L	���fkz����whh�ؚ��bw?i.���$�#�����  ��6G��na��6�dR�s-���s�͏�����<
�(�@��0��[�
�

+�
�)`ԅ7����܆�7i�X�yn3X�d�]^N
�Rrn�6<�\����%�!kY�lEn�)m�r�J`�N(��K@'�,1���w��;� s���.��*
+��F��������Q�T���w�!aOW{�'
r�#$I)�n����
"(h��.�8	ᠶ�^֨P���HԆ�R�sF٬�[�c���e���ska�Ё7�O}շR���Ab�o��k*�I�{#xb,��ѡG�G
Fk����a'�E����p�8
�d
_�텇�!�SF!�U#� >��ɒ�pBY��
�vʂ͹���␥Ի �9�DRb���-na���ʼnT�e��#��a��5�h�*
,H5�zh�)� �@�o96���laJ&p�J�n��K���l���K����e����v��k��X��
�zV�ž�l7�n��	`�I�v�P�C{��o�=+C�=��O�e�}l
!p�gH
+
��ky{�f�.#T��۵{@/J�"��%��s =�X�a�wk� 5��0P��`�ŝ�![
�0[�6���;lj�hW#���8����ޱ�`�ɼ��'�.c;���C��Y�q�E�h!�P���
+��h�JӤܨ 
0	������`\�J'�؂ �Fc�!�<���
�*��		��}
�
c\??^�gX��ٚ3[�vfwrK�h����~�:��'� 2'?�Zc 0�q�ȁK�m������OX/���0ZG	Zu�曛��r)kK,툣G M�	=���� �� X����lp��-Ѐ�
1��J�yVP:�7�05��cWD��>,���6s0X�ƫ���+��ڸ���sqG%*@�i�u{�i�)cD�큛>L���i�����
9
&�Q!1�1�|��?6
22�
΢#2���R@�=��=(�ˣ����!�`K�u�PeLl{˃k������%�F�Q
Z���U(����?,��k��A	Ui&�+#̰� �������
+Y.|��f��*���k�{Įn�)n�yUy�a�M�f�Uz�f'1����z4�-fB�噁Rm�OH>�k�6
��C�͌)Uo�
��d�&>d�N��wv3��}!�u�a0�i�U��$�`�`S��
+�X��

zW�x��6Հ���Y_��j����r�$�R����~B����>��cv0��1 O�
+T^ys������M��2��γE�<c��fڤМ����B�*��V"l0@?h.��
39z �7��]���k�B �f�����@��,&��n���ΆNc���h\
�=_l*�S��I\@�V�a�h������/0�S����g��9�V���-`M
^�,�48��n[J��l� Ĭ��<�g��=��o�t�a&l\,��#i�'Y��A�ן7�/;�����*z�W�z?�{�{�����Q�r�y��ݏ�c4�U����#M�k>m��'@^���1OyR����*@TMg�P�̾x�^O�֕ �t;k�r6^�
0,X&�v��y�:��u����4�pC�����k�`��ǫ�z�u�[�?#��,?�`fm
���oDnX�$�L(�m�7oN��ӗY���bf����J5IБ��z{y[��gѽZn�qP�:����6��������_X�F��k(qO����Cn�9��t
z�w�S�=��@�/Zȱ/}n�Vퟐ5�}v�E�8���Uk�
�8����0��R���	sT������Єu��b�8 0�M���C [...]
+5haX=�:k���mlo�:������X��E^[�ՏpF����}�?]������R��jW���
�i�
��
q����d�$O]@7�oS�%���o�KƲ?ؤ�\���v�5{����8(�\��������C�5.�t�l.0`��yŌ�̳�v>�<��%o_���ѐE~
ſ�?�2~�e��'C��)�?�ޛ7�y�O�:c^��w�[��k���C�~���z��
����w';�;��G�恟),;�i�x��a~����W���}�sd)� /��%��{g�'B����4�,��6@���?�<"
wL�v� ^��ŧ�{P���#�T���
+endstream
+endobj
+1471 0 obj <<
+/Type /Page
+/Contents 1472 0 R
+/Resources 1470 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1447 0 R
+/Annots [ 1469 0 R ]
+>> endobj
+1469 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1473 0 obj <<
+/D [1471 0 R /XYZ 89 770.89 null]
+>> endobj
+1474 0 obj <<
+/D [1471 0 R /XYZ 90 448.985 null]
+>> endobj
+1470 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1478 0 obj <<
+/Length 3125      
+/Filter /FlateDecode
+>>
+stream
+xڕK�۶�B�Rߗ�I���:i^����C�8��Vl(B��[��w^ A�i��
�y���yn�}���ë��j���}��<�6y�Iu�K�0;n~�~�����vQ��M}��wO߼{��k�<=|z�`)�D�?٥٦�<��K�9��M�Sy�y!��F�
+������
B��}�`%�vQ�g����c����Ϧ�ac�ǫi/U�m����I�y%����x���6������VpJ�t�Ѵ��}
|�cu���t}[�H��E�З�?W��=�{1ES5��承�)I�����'	�	"FD�n��R|b L��}k����Т���<hMi�;Z�_�`�V�5�|c�ע�lO
|�D_T��R�}U
w}����Ǣw�t%;�-��<��c�p[™v�i��i:<)�Em�
���� T"��1�e�LX`
�B���E���R�
���{y 
�J
+cV�
+Ʃ'���h��b�~�x�Ҹ[)5q�0��p��a0�<!;�;��>�ԁ�Vh�)[
�[��G��9�IJĎ@;�E%	��$�bHo
�����n��I�*	^�xA�+�.Ȱ"O*+68���q 
C2W�u�I�0q�'�f������v ���
ƻ8g2��jX���d)��������C��̣��@�����ڍ���}��P2�HG���'"
ZY��R��R �"@�����`���sN�A
s������Z��e&�E�
+�6,
�S4=/wvhK���qm:!P��
��!�
�^�ˇ `�qA���
+����&��-Z���q�A�d���ca��B��*]8��03��䚣;E��x ���Cdzn ��z��"Ɣ�-p��"I �%���b��D#�8�/؏)���(8���g�Х��@���$e���U��^�X�rs��0.���5�]�+��?1�yA��<n��}���EH8�#�J\
��
p�}���


+�|
I
y	���]�d�r	!���i�� ��Ƞ��fQ� �X�\����cn�H�
5��@��[p��0��<�\�:�V����orwD�);;�b�_W�ƣ� ��>B(�$�S
��JcE���ύ�Tp/����a <�.!��ᮋ0*7 F���'$I[
ѐ58�
��TT0F1���]]
�^�%
@Dky���ϽP��x�kMU
X��0	�������
&W8���!� �	E^3��;�7r8�=:*m�WI.�I�B4O�x�V3�w}��L��
��N�
+���Pޔ���)*�j^�\ٺ�*���_��8�
+MYV0Ÿ1�n�Z{�#x�Ԫ
�&���F�a���(���ib�b
�>��
+�
OG�(����(%@&JdR8��B��s�
����F��Zpߪ'���
e1J��R�%q�T[c
e�&���ow��Q	Ԋ
n�y͉W��I���5�?�O!���m���
+�!a�� 
�v�
+N���Ah��@�
�������|�!����S�8%hq
+�Kg�ɶ���	G��0ՙ0a[%�K��l�Kyh�'F����։(
+$`�
+cܓ����W��*Bck5�0g
3g��̟CV~YM�੉VH1�(��J V���fd�m��j_]̂�s���%n\��h��.a~宾��b�i�
+XMq:eG9qq���q6�K�"����7�ٝ��e�|�D�2�]����8J2X��<?��
+���ɋ�R�R����0zKs�
��P�M�
��E����1G�cS�N���E0�~)���0�웺F^RL��(y���r�<����j~%RJKˬ���XR��J��6���ګ{�<��L���\�9@�2"Rt�8�S�v5�ֳ��r�1�P��f q�.��OCQs����Bh������J�d��+.2�Z�y3�M��Qj�|�\J��%�E�]X������\�yv»p��A���q��o���J��]��/"��JŢ"z�q��ۊ�墔B�{oQS B��a ���ˌ��
�ɁC#g��$�:�"�a �+"k�A�^Be\��������%���� ��g �-!ص������!$"
�Fb �O�!���/
ݸ�j at 8�A��}�1!�P2w��:>At��4�Tq��=�!��~��>7'^�R.|i�o!5�$�f��(�1
 ����B�G)Ӻ0X4Ls��^�R�%�������'g�����ekG����Z��Kq��gz�=�B}:�xR�
9�U�	�/G-� [...]
+��Lk >)u����,t%�: �M��r�
��<gN��Wc����dx&Y�
?V�\����ZI�]������(jncHc�s|�=H�R0��k���2
+�|Z�
+"&X������ш
�TR���=^��e�IC_�:��(�?�0{Bb���.�u���F4uŽJ=����W���^�R),E"��iy�P�Z��`��׼[�4
���/ȝ���K2��d��(��T��T���e�+���e<�`._�/��B9>a����1���'	�Вн3��FFW�����}��
�X�(�(� �Q�vC$�9,<�p�M'�O���.��yB�%�����f����O!o�J�C[D��
+�{�� ��3��/s�
>�P0�K���
�l��{%ʉ
B_e'޻_
�FF��l�0
�=�f�dw9��	���<X�~*H��z���h�X��
��#_G(۽
+
�ly�p
��/��|#��W:Z�h�
�#��ROh��:�+�Sw�Es�3^��^^���w-*/ͤ�A�w�����m���
+�7�\a�.U��P5PV�3�&�<`4,��Z@��1��dl<��;TvXU���HA���M���
C�I,���Ŵ�1h�Lol��
�>�@J��	_糂r
�>�\\�S��Z�'�Q��gdpv�:T��ǺB�g��1���?��o
'�4��e�\���>ޥ������6�t������8�4�i�Ӣ�#�W�_��k
�&r�@�q"��##�
�ט�}��y��7'�������i�a����\S�O/�<���"PC�O�Y��1".��ב��V��4��l�ϔs�_����ax�L��u_�L��|���;���ʥ*̅���u@��&
��
+endstream
+endobj
+1477 0 obj <<
+/Type /Page
+/Contents 1478 0 R
+/Resources 1476 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1447 0 R
+/Annots [ 1475 0 R ]
+>> endobj
+1475 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1479 0 obj <<
+/D [1477 0 R /XYZ 89 770.89 null]
+>> endobj
+1480 0 obj <<
+/D [1477 0 R /XYZ 90 541.253 null]
+>> endobj
+1481 0 obj <<
+/D [1477 0 R /XYZ 90 310.443 null]
+>> endobj
+1482 0 obj <<
+/D [1477 0 R /XYZ 90 194.259 null]
+>> endobj
+1476 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1486 0 obj <<
+/Length 3473      
+/Filter /FlateDecode
+>>
+stream
+xڍْ��}�Bo��v� �3o9�-��.�R�0"4b--�'_�� B'ɋ6
t�oJ�wj����
�]�]u��$�}:�*�+����V�~���c���Ï����v4-�|\������'
/�N�(-�����O_
b�K�b��
�rw�
~�]�j �S]��B�vi����~~��A�����1���|���XEò�:�:�ʃ~�y�t�φc���,"

��q>ۑgF;�cs����2��

X\�'����8���ml�ϳ�x
M?�Z0G�ל�I��T2vnn�kw���L(?��ج���!��Y����
�"��t�־H�F�,���C;y�@
pFj���X�#2{��i��}�Eu�Nxit<�q�ѳ#q}�k��"2�$����[���d��IΔh�*��7�o
�8h�fn�ly}
/��,2x���T�ۥn�g~
�a�
��i:
r���9G?��.n�[�AQ�LK3�f1b�
�-��Yv����e��+�\��=M$���s�g�KMGO��3��rJ�h�ܸ�&۶��@Jy��?ʼn���dH�K@�C㌨!��6��E� [...]
W��o��q��<�-�0(�Ɍ
H���B�AZ��eU��� ��|
���vb��
e�����0�}��#�M3
+aȪU����z�<�0~��~K_���̂޾(:	<��dk����
f�XY<H}M∺]�lv#߿�,�
����B&����g�8�I�0Uo��)$o�	t��(�����D�����݌Vm˃{l�2����*N��Q��I�D�q�}���nޙg
̘v��~��㗥)�8�
P���4�����Ž�������d�x��${MC'��!��ɋ
�f�H��^��`%�y8o�މ��S!�y*BA<�4��S
+#D��끟

�X�:r�������
F��6�c�U���ٷ�<a&�~�sO��b���O�y	 ��n0U8J�BF,%�ȶD ����s�9L_��ɓ���tc��!0��@�80֡e�A<��VV��2I����y֙�'J+Q;&G��
����%�Lnm�4�y�x�FK��at��9��\��Ť��+C�R�{/@b	�hI�N�J��GΆ@@S��/�2��9ֶ~ij�a��x�eJ>
��O�������9�n�&�F�&����Rt}c���Q��� �������
+��P8�`0'q0����	���.h
����8\
�rv�������_�g3�|��I����	�=��T4Gw�Ë
h����)n��-y+�w�W���s
��Z� ������ �mI���L����3�e�3�ЮZ8nI����5=�
CG��������p���h��uƘSO
YM�
��=?��� �;�5P(�&�
+�NHu4P������R�
+��H�������=
O
�J,��� @��Q���Sr�F��%���E���(�0i���L��y�p�q~eHgM?�H�24ؤ��U6�t�j��x2�q����
���
���&���Cոm6'��L%?��+���SW��;EU�Y�\�
'
�{ow�Լ�m_�
�����
�_)pɳh�Eq�a#�
}-�t��\��}��hf�Zq��PN=�'A��|��<���kh�k���	
+�j�?\i
	��A�T�D��	�pP�M�������K � g����
��y�o��WG��nB��LBqn�P:���
�c!d��  �~�����_�	����Ş��f8�L3S���ȅ�9�

�h��F
q�Xl9}�1�H�,���N�R���
�4����<��e
�#��SX2fk��d{J����,�y
�8v^*��5��˙R
+k��֌�
Xf�♙?-����'H�8I����6
+�<"Oy
���4���R�2�-�4hme��pH��jǣl�F�<pڈ1��k)��s�:6��{�O%����㑟�� ��.'� ;��ȵ�B	���k7��֤G9��P�y�VDI.��s���A�BT7�߻m6�<]���n}�\���+ӊR1��pG>\��E�� D�݊v��z5��#�WG*�H��rw�*	kg��܀��Y�@4�0
+�{ȳ�
�
"�E-�%��w�͹��p��`�FU 
�NN���b��m{�J2izp�~�m��J������•\^pl�K��٨�
�G�`.�Z�e
 ��'���dl�V:���*�����Ÿ�R�e7�
+q�w\��F{O�pͮ�n�`Ýt½MTTu��$>��V,��Z��J�f JFI�@�[�섩j�0�aB�x�&��������ɶ]�!u<E�Ti��0O��N��+�*1�*�L�p���t����}��DN�;t��c�4�vv�ߥ�k���J\0
���g��:�ϴ�4���{�bq�Hdst����m_��2t�|�� ��u=uq������S̚�24�Np	�%N�LDZ��p_]�
+8'�if~�+�8�E�f(���r%4�2pٲ���M
�����A����<	V�����J�W�	'��& �j��XSË�V��Kڪ��sO�-TG\A�⩹�
$ONO�W�U�K��l�Y�
*
+�e�
QC[��"1��0شQn���0�Q�D}@�ۄ�Yi����A3�C��^HsڇS�	|���;���� aD2P�N��N�<"�QBWOP�%����p��AՉ�O�0뾯(�N8ju�<�
+SJ���4�
6،�r�V,�a�����K���	 Z94��
N�f:�s{�
+�B ��{���V�w
KǔH�(�8�BX$�ho��� ��'7�5
CItt���و
+�J�S�8t<)R-���=!�V�C�� 2Rh&�c�	|v�����S��B�&�
 �1ʭ�Q]E�j�z

},��D:��q��z��Բ˄�0p�t��!%�q�h �')�2l�5��V���c��@��36Y�_�����*_ L�r�f�|&���@�-�@<q4�Ϧ��?�7����[>K߲���������M��]> �S�
�����'�]�'쌦 G�-�OH6MJ~�`F�!8Q��L�
0>?���+j���ѐ��9����`��]�܌,��AjO��P
�4{��	�~�]�^�
��y],M"
��$ߐ����=���[Ys0�k�EP��Z�w��P�>ct^�\�����:��!�_z�����T�ɡH����*�O��P�y*��J�CVɟ �W�����/���@����04����C|m��*��Z���΍����e�q�B
�2�)�b���������0��?t�TUTn��i��[��b+�#�?���9Yf*>�y��W��H#
Ӥ[(���tz����������

+endstream
+endobj
+1485 0 obj <<
+/Type /Page
+/Contents 1486 0 R
+/Resources 1484 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1489 0 R
+/Annots [ 1483 0 R ]
+>> endobj
+1483 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1487 0 obj <<
+/D [1485 0 R /XYZ 89 770.89 null]
+>> endobj
+1488 0 obj <<
+/D [1485 0 R /XYZ 90 620.673 null]
+>> endobj
+1484 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1493 0 obj <<
+/Length 2886      
+/Filter /FlateDecode
+>>
+stream
+xڥ]s�H�ݿ��U6ַ���c�bp�Im�A�0��H⼾_�5����d�iz�gz�k�{$}`:������+
A?,�n�=�7�\��-w�������qa�������_��{�;
#6v2�-��r��+y��� ��3x�3����Ͽ��пù�h�{�E��mZ0���է+�L0hd\d��
sп1��6�a4���Tq��
��;
��
P����1⾈�m~��J��{Wo���nL{�ڢ{ �,��6y�M�$�J�;ZT�LHǼ����3F��'�����IZ�~S�NE�`^�䶮]�ol�բ�g5Yx#�פ�����jU�xUm�Mŋa-�
�Í
��\
�,�c�O3M6qV�$�El
G{c�6�1�+����T�<�MmW��Yh?}4���<1|��&���VN����(M-�nh�
qL-�S�|�:��;��\v�<V2/�*)w®L����8?���@:t���Ӥoh/}[��h
+�G&�eee��l������.}�qQ%���t�KB��
�3
�\�d���
�N�Xe��g��d`��_Y�ΰ�O�
�1M�F�
�
Wa�"��#:
�X�Jv,K}&�:�hs��Pv���n�Öƴw��
��$O�xS15b\���ߢ�zcĎ
i;��tCy��I�"�(��}^��#G��^ki��7�K�
�����d
�ݥ��
���$h#��)t�N�qu��d
Đ�A�.�uLNJfUGe}Z�{�8�<񮈒�'�I����#�ۘ��E���L"9��0\T�`YwhIU��*�HH��	�

+w >�V
�w���ay�xZ��E����z�lxZ�p�_)��B)JH[#�mn��JZg���L��	DQ)�Q\�mz�,�G}��3-�,qHʆ�
�4ɾ
�Wn����;��w���qM"5��2�P�K��3r��oy�$F$�"- ,^B�{�� ��x�7
m�j���Ǯ����
iIV����%&��%�y
+�����R�^��u�����/��
+���K�#

?�^�յ%/��
+�ex-��C���_p��� E�c�v.d�N9FE��)��
zҀl�g��1���m�����p<UL�w��x���`R@������@z�׳��r�m$�ކI�m�[��(�`Hux԰�9��6q��?`!�y!�}��^�<�x��ـ�
+�6���X��7-jxSq��<m����L�������B� o@���!(�/w"��X����k��Ȣ�!S[�;�	��D��
+�\F
5���N+���
���Gܪ[LO�2#�+Z��d
*��*%
*H���	J뎸��e�I�@��@�8`�jAo�8�|-�i�"YB��0�N2I��'TByL
+j�L�9q/;��4��I��a�h�6 s�6Q����m\EI�Y�%`��,U�+�`5j��!Qi�P9��z״����,�;��nƗ��Od!a�n
A�S�	B�nh'��tX���1|�@���A:*���	e�o�nƥZF�(8.b(SQo�p�~�؜�,ە�A�H��F$�hDB� �7Ӵ����5 ��݂״��,����B6�"����4�H9�pM-i~�D
�;�.t�9gKې�d�ʕ�J������'���Rىu� �v&�yG ��bcӨ�$����ٻ��l��[#|�S9�a�p�ӰA8�i�
+FC
+7$�]J
n8������
+P�ԧ7�ҹи������	\��
 KXu�Ԫ��j�\�7x��omY������*��m]G�ۮzbO�.�鼷gG� ��*�Öu�ˌTP�Bp�����6QƸ-l�
+;�� zw�N$��]&r[�g[v`'��nG�ag�Q_-HH�\\��O��`�,�o��JA(� ó��/E8��-�f�ű�/���L.%
~R��מ��X$���X���4�*`:���;;U0:�{���ʍ�xI�~W]z�Pa
@���?
T�(q�(�
�-�AJ�%`��SI�6<�3�Y��G;|�g��8���LW
�W���H�5븋���{��E����t��j0�o巇p��ɠh%��V�@���XIA���?hb
ib�r���:��O��}�KQV��]��zUOz�?��Z����fs�?��p<[~���<d2�`�S8���y��_��/�\���c�\�w���
?=M�I�r�a�|,W����Тx���O������9��
,d�b9� d�s,��G����b2����O��p�)���M`=>A�U��2���|�|���E;�zla��B�-��������|�䅍���{
dz�]��������
G��_,��F
D�<��}�!�M��;0��?��
��Lp�b��_���v7]���.l'xh�6������i@�
���`9�eB�G2����t
�|>����l
f�x
(�uO
��
�+p���q|Z�Y,K�
�
�<�gY�ڜ�
��@��s�:_
��[�󧨻#��t�V� ��g�ο�'����)Ƌ��ѿ�2�/��"���I3F
��q������csY�?���Ṍ�y�(��?Ho���)<�*��o��i��4�����
?�`2È�?S2B�j6��rA�O+�;�|P!Hy�S}P�ā2b�1�y�Ka�8>��h�
��;��W�Z	[
N@�L��L�Y���0���0g���.�r}���6J΢�f���B��Q����k<���?����7pF�k��nx�I�6LD�G��������aw�n���\>��6��p��=2աͷꝞ�
�ʸ�{D�?F�)��Q��]f
�c�O"
�q,�bپע������L�>����}U
�u{�>��q�2���1�l
��7T{�~��]P�C�h;�Q���
+endstream
+endobj
+1492 0 obj <<
+/Type /Page
+/Contents 1493 0 R
+/Resources 1491 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1489 0 R
+/Annots [ 1490 0 R ]
+>> endobj
+1490 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1494 0 obj <<
+/D [1492 0 R /XYZ 89 770.89 null]
+>> endobj
+1495 0 obj <<
+/D [1492 0 R /XYZ 90 703.904 null]
+>> endobj
+1496 0 obj <<
+/D [1492 0 R /XYZ 90 573.844 null]
+>> endobj
+1497 0 obj <<
+/D [1492 0 R /XYZ 90 467.779 null]
+>> endobj
+1498 0 obj <<
+/D [1492 0 R /XYZ 90 246.984 null]
+>> endobj
+1499 0 obj <<
+/D [1492 0 R /XYZ 90 104.969 null]
+>> endobj
+1491 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1505 0 obj <<
+/Length 2626      
+/Filter /FlateDecode
+>>
+stream
+xڵ]s�H�=���1U��O0;ON�$�c 
f�R3[u�4�Zc���RKm
빛��{��jI�V뫍������Cts�<�{#}4��h���3���V�/�տ�\C{�,�(�&o�e�&��D䕀�g;����G���͟7&�e�L���C���n��n�V���g����
%Ѯ�X6�Yo~�ۍ�Vs`\�i��i��o�����Կ�
C��4��OaO�~�~n	~h
���hJ��tA��tF����	��N
Nj�p��b'�xR���.i�L��?F
���o�c��@B�L"Ls�����<�m+�Z�i���9�L���g�נK��
�g
]�
����a�Ӂ<6�:�#�ƨ8�j�F�������d��8����
<���Ā�"��KQ?�a��HQ{gW���6�,�<3�,�Y
3?
+h�X=�'Z
��b
��X���;��5�y��p�t����?�By�Mw�Oó���מi�D�얈E����/�ˆ�g��@�#��
�9߼�Y�9� � �����L�u:~�� ;U#�O�Δ2bJ���9���A.�M��70o���):�#]09��2'��b`���=2[�
"lS8
�0�:fK
�Z��R�q�9�,O+�4�E�Ȋf�Kc��1�}9�\���rt�ю!���Vo��J�$�ӝ(i�`�c�4��,�>F�,Y�K��m�,��i�*�}Y�MW���3�K�� �$��&xɸMڷU�[	fe����M��F��~
f���8I�r��0�cju���HKF�rW�"lk��{�r86\Iq(�8�m�e�����D k�Y�
Y�6�	�CIVT�
�Q��]\����<.�";Ԣ���zZ���p�wa4�""�Iyھ# Ks�*�܌�Ǵ��
+9
+ oe�)�L�v�3QU�3ϥǠ2�T\U���,��l+�qB���>�Si�������F'�� q
RSmR�&x<
!�%�kԪ%o-���?����g�D2��A���5�iOaBe�Q�ӑ,�6?W�WS�	D�tK}�(D�hm�l:�C߁�z����L
��fђ�V�gHsT?�"�s���v*�+q��
�/WcZ�)N�o<�r,NP at C�l�R�fíX�
���O7
+�M)06�m_TU��x� ����f:ټ�.
vIr�����<)

$٦��+GK�ը�w�(����нJ���X�
#�9n�dK`k��T�L�čC���tٷ��5/���n�F
�(������9�~
�=0:P

m%GTE�
 r�:�*�"V�E���k�áA�h�..
�:���5a��`��5�J�����bv,�h0�Z�%K�nk�ѷ��H:��Wð2Yl,)G�ζa��I+�f'"�
kŹe@��Iv��$Z\�vN�ˠ6����
U5�Xa��jU��1�6�[?WM�
5�d"��+m�Z��rd�n�5 �.+di~�G��E��ȥ{��W�v}���Dp�|�99g 
7
����)���hy��]wH��(+���&��0[��>T4��
/��I��e��
K:F�9�j-�x\��^�nK�;W�=0����ؓʼn������=C��� Γ��ڦw���)>�[�Y�f�ԉ�����d�j����H�O�����ʴ��LB4IH&������XV��t}Ϋ-�(j�P�WSek��Y��s	��9N��
��u.�Q�E�j+����:5�<7v��
�N,��[Bh����DI1���r�N7y���򼓬�V�L҅��'����R�;�di�y_8_/�,ͯβ-�M�]G�1��j�L�2�mׁa��'�|��D�%֟��I��Q��P
⛸V+��T)}lzP����?��Wؠ�V�WCW
F� _�r��K��
>�c��o���m���#Z��c����sT)�\�#1ͪ���wĪ��K�U�,E" �^&H(
��9;�
g�
�>��+�T�
yo(,
9�|f���GOA���}!�m]���?
��&?�E���H����`�g��V��2u�
Ɇ�um�t�U�#\���nf�
���q[���U:�u�
7���2!Q [...]
�r��.���X���
=�L�0��r�b
�'���
:*���0�Q !(���!=�J��pI>}�����EH�2#��+*imOT�u�FZ��B��W<��l#d�-���貎^��3��e��:ꏜsL�g��#��5���mL��ec=�����	3��Bc��
&"�"�Z��ūc
��\���Z.�J�
n�Zg��p�x��hԙ\E]�=�l��>X�`�?o
�0�CKR�a��q���SF>�o�oɹ1
+endstream
+endobj
+1504 0 obj <<
+/Type /Page
+/Contents 1505 0 R
+/Resources 1503 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1489 0 R
+/Annots [ 1500 0 R 1502 0 R ]
+>> endobj
+1500 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [314.956 234.138 472.963 243.245]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
+>> endobj
+1502 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1506 0 obj <<
+/D [1504 0 R /XYZ 89 770.89 null]
+>> endobj
+1507 0 obj <<
+/D [1504 0 R /XYZ 90 598.909 null]
+>> endobj
+1508 0 obj <<
+/D [1504 0 R /XYZ 90 486.932 null]
+>> endobj
+1503 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1514 0 obj <<
+/Length 3272      
+/Filter /FlateDecode
+>>
+stream
+xڍ�r�6��_���JU���>y���8�kg�RI
 ��C�
+AF��o_ )
=�r�4�F�O��b�p�_�{���O�E�d�/^���]$a�D1��/��]����"�S��b�D��?>�||zyƱ��/W�_y0�.<�9I��W���.
+ ��p� K'B:,B?�o�x���;e%v/X�<��x͟W��.�~���hi�M_�V�i���
7^���V�ԇcլ`�ny�W7r��Ǎ�4��h�˟c��Zu8��z
k����MSݬց/-YU�< �����t����������͑8l�ݾ#y��5l=�"�{Q��R%2��!LL��8H�e��
6o��2/ �u��Q-q�֡�-�=��.M��RYу�ʕ�lj��ׅUJ#�U]0l߬|
��0P
�ի4�^�
+iNс뙝~���G���Ϗ7�2�0�P�P�,l����De��q��j����ޞN'gW�N��n�2׵��V(��](�'N����C|���uB`s�%N�
�/({/˄o�ֵnU����V��#/͝�ц��c�Q��R�e�7�i�(�
�F"��D�
�ؖ�Ó��g
T�`��������d}�*�~�6=0�\��V4
+ɷ����8yS�� �C�
CE� ����+�� "�Ue����M���he��s��JX
9˖���c+C�)��'	GPJ�f����x��� 4VU
���HQA �ed�T� �`�$ZE��(�d���tZ<��
��9�3iO��]�1�W��[�{��VL=Z�H�/ږ�N��0�㾬�
������4{]펕��շ�
\����]����gd��
� �}���
+#7\����|�g`	.� �;]޷Z�������;��� +�op��'
$�B�lk��&���K=5�S��}��!��?[`\���Bqh��8���o�
�1�#�{=���
�x7D~��Vq���v'�J���v}À�:w5�G�Dz�~ߪ�
X��d�}�E;�f�4���5�H�f\b��-��O�w��~�C��M-̢"㗝@�
���+�(�`"cז��
+ at n�=
Jp�3�)1�]��fGdE]dc�^N"߫zG.�����&_N�UUs���"�“��8H�����}�����#ϸTB
+9�$��!8�
B�����
�t�FB�f�x���tb2�,���2��Q���6M�E@�0�
[ˋl�:G�"?��(���ŵ�� L�]oAS��
��꜏��F6 M�|qr�
��$"�� Tӷ��1�`;�:���8�����xF[&i���B�?=�h��w��}8\���t���:��MQn_9�%�I��R�`4��3/A���DNF�>���峆\����H��VC���$�>hM,��%Xx��z�D;�L�2F2#|��Z��ה@�D��l
�r�f�@Y4�E�v2��N+Og4���ac�E~ѐx肩�Ǝ��I�(x
���|a�lT�ٕo^�K�oFgv�
�hc��ݰtc���--N���
 �ȵճJo�k�h�F�=�
���&�Ӡ���IQb�Q
+
�Vn�|->���0|����ѕU��l4�-�L�
/B�86�:Ȑ��$���Cǣ�������l�o�
	vl����XY��"���]c)C�1�Ubi,�Hg"[\a�3,C0�������1�g��G
�h�W��Y d��=6Bl
F�
b��%΄��p:���`�m.�r2К22
!u��\
�1�dT�4,u��'�yK2#p�a
���
��m��mP-GI^��=fRnUd�bmAB�e0E������1���iÔ6�9u
�i�N�e���O���+����%d[*�H�$��y8!5衽Q8��=�]

�̩���[��h�
+*�#
z�Bm�_��܁�#�C�����vJA,��u�w�����P��1�$@�1l`0 ���W-Xb�z|�X�n^
%N�u��o왍�=@�By��y7$�N��A�\���M
���������ݻ�LJ������n|�x���������7R��8��;)�ZF�/�wP
�`��:>����4�Q���+���`p�A
��*kY\1.�?�Ǡc�r:iho��w<��]�G�
+ at 9��\(L/L k�g�W��P��Ĵ�Y2��A2�7sd9�瞢m�ڄ��A�(VM�E�U1{q�
�x�����^�P�!	N_�>$�9�oѷ�x�Sq- �;hH2 ��
&�� ��l��7#�7P
k��
�
��c*1fvtm�h�O�u%Wzr�	02
���m�O�W at wI�<h���,��.���wә)������@�#�H��K
�YA�������*��i
+�6��`y����(� ;���<�ǎ�,kh
�$v�Z8����XT�
�P� 
��`�U�1]azc
��d�*�|;C�{_�hS3�Jm3�hXʼnܯ����8q�1��1��'ɬ9���nN���nyh���lz6��1�M
<�[b��ļ��+�
�v��6��]󎫴�T�t�ps
;���M\ʋ[�ځW1��!�#�<�ږ�$�z׫���:�P���-�^���)�]s�S�M"^֐69
!��b�&x��
�kr���a+��4F�3XI�М�yX�c�W���4�"��;�-�g`�:X`�+�La�呁t�#V:֢��$u
�Tƚ7fMT'��ݹ῭"Ș��x�Kň6���%^�56Rɕ
m�F2����о���$K���Rb!���А'��UL	�VG�
Y�e}9��̈́��
]-g��˾7r1D�-|3�O�•�

e�?��c�b���H�\�N�2���q��K씩���4I���#��C�bY�:�q��?�#���b��A	�d=
nI�"���2��i˜�
k�����
Q��^`�
���qܾB�x�
K��\����P�eBuc��W�pÏ


����M�� �Ļ
=�YA2u݇7nU�<���P�BWn;ڒ^`.�m��K�V 9M�ێϘ���ប	��ʮ���(W*�}�sR�^;�9И�
�~4p���Y��Ml�1��C�P
+I���6L�
�JA�����{�y�E��(��Q
�J�Ŝ>g\��Ǿ���_}��L
'��~�r
�K���&m�sp�p 6�[��H��g����őf�]tbҠ�P�q�'����C�����F(.r��
[��Ӱ��{���N���k�~gt�s��~�'g��&���P
�c+��������/�
+endstream
+endobj
+1513 0 obj <<
+/Type /Page
+/Contents 1514 0 R
+/Resources 1512 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1489 0 R
+/Annots [ 1501 0 R 1510 0 R 1511 0 R ]
+>> endobj
+1501 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [152.087 684.669 321.452 694.951]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
+>> endobj
+1510 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [225.562 630.557 508.501 641.461]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/philosophy/why-not-lgpl.html)>>
+>> endobj
+1511 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1515 0 obj <<
+/D [1513 0 R /XYZ 89 770.89 null]
+>> endobj
+74 0 obj <<
+/D [1513 0 R /XYZ 90 616.033 null]
+>> endobj
+1516 0 obj <<
+/D [1513 0 R /XYZ 90 584.011 null]
+>> endobj
+567 0 obj <<
+/D [1513 0 R /XYZ 90 584.011 null]
+>> endobj
+1512 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1520 0 obj <<
+/Length 3650      
+/Filter /FlateDecode
+>>
+stream
+xڍZ[w�6~�����R��
+I�"�͉���$u7�n�m(��xB*/u��~����h&�
`0wȝ=���ۋ���o��l�XG~4��gkw�E�����,��~�:o?�,�7��[9Y&�[��Ǭl�&7����iV�4
���	���.^o.���;�d�p�f��������f�b�^�
�8
�%�����O�p��;ڮ�-<Ov�3Y=�^�S�F������I#ٚ�:ҏ�v!��
� f/ߏYj�]R=uD!W��xɤ(����l�s�|��bu�P&�
O��]9\l
s�*O�f1��\��`��"xp�î�PNk�^���1y���`�M���_Vi=#.�8
���R��r���ͼ��p_Lp>-5�
F�.���ԧ�,�얜:���	�J�,��Ҕ٢�/"_�m�j��s�jp���6���=�WS_
+�IR#�*�uꃩi���N
X��ca��Q2�;$͈\�׸�+t���+�o*\���v�+���$�<�2��3X�B��>�W�UA)-��L�:y��0�
o
�\��Ȓ���zm��s�<���iZB�n8y~n_)��vR�y�������q��ݎ�@"S�!�	v2|�"�;@ck��ٚ�x�s�
d�7$�s���VIY� %eC�\AKO4�I�X� @>f�.�B���u�%�d[謎h:$���;;UY
Jll�ò
+�t��:&����ԓl�OY���L�������|hyN^�v��

+x�ʬJ
+��m��t_�ge�l��m����Ԁ������y� :�^hi~S%�á�L����Og�S��7L�#�^�R'
�:
e��1U-C� sCW6`~sA�9��(�/�K�S��^Qc�'c�%� C��T��*9*=��`���U	�{#ks���G��Bu���rw]�?$(xrh��W���Ug&C�^��I.O�5.F0�L�_�Uj at d��SH�� �yDTH�
+�)�A�6
+X��e�{��I�h�]�`�w
�Bv9����{'G
�p#�nGd�vJ�U�6WJߐ�{��L�#C1u<�Aާ�����h.7�I��=���xL�����<c
�Y��8�A+�����1
�{Puj��,���Դ�@�u�5�h�p��ٍ

+
.�g�9d�D
 ��+�F䎹D�&���Z(d,����e��EK͎7�k ��5gr��)'u4m���u��
ڮǂB�^P$Ɱ����1�D�x)B�L
�叧l����^��
OG5�z
7ʿT�U�K8�F��n��eZ�,��>S~���ݝ4��V)����{C7��{c)��M0XvHS��y���_ȇ�J�
�h�����w������K���G\S�d���%�o7�
�b	DR�Taw��V'�S�4�K�u�������ﮤw��cZ�F�,~�s�F �:�],�	�=�Q!عfQX����N(,��՜) ��`�H��ד����^�~�;��^	��Wo��a���p�v! O�v�6���;�������_��V'���Mn

�p��d������Ѻ�1��0�fu�H�J�XĊf�U�"V�[��!OҔXe��#��ET����uLQ+�@h�I�����8�����,}副�&5l )�L�!�,�h��$�6� �޵����-p ­
� [...]
+�ߓ���_J��+IV�"N�
H�L��1�������I��kSg��J,ةhk׭� YT[
�{�ي��o���,ۍ�w�P�}0%��
+�'�Ї|[��_�6��Holr���m�x_�����+I�}]�t:eI%0�-x���1M:
+��
���
����9�^�	��dBMw�����0w*�R����^w�\/@�l��Mp��
P��Lͺ��A�
�W�K�I���%b� ��v�
L8
+�a6�:s*^W��c�"���Y
TND(��K��"P��X�t8f��>N��h}�U-��\�.y[
0��~��
t�
Y��)����A�
�e��7B��$s��6����\4��h���Z�D�l��~t������h�g��H� �L� c��@"��z&ji��}�xR�>:"�Vt��/%z�K�k8�F�@!F-���P�.���j��k��6t�.�f
A�*xF�
+@�����!��_��z�˛�s)x����.��T��[ȦD 
+[���`�;ĉ���,�������B�h#D\A^i
�Qu�P5��N_J��\|��J`�A�G)��dZY�)*k�Q�eгu�����O:�*;���E��F(n(��H���p�����6�֮��
#w�T��D�A�v�C|�ԯ��[dv��]NV
+fk��t6d����eM
ՇD�.ۉ����
�`�]|���^ou��(��}:0S��8��8@_��A�#��;��n���+�t���"�=��]g$k�s������U1���2�R���0�jY�9��Z�v�IZB
Q���w��*��!2a14Ԥ�#�Y7��rp�E�{�5<�Hz&�f�I�4`�ݨ@˅Iv��ɨ�6��(Һ	�f��J����uk��f��~���7���2�Տ���>���g�M�d���#M�b�mZ��a���%� �ښ*���dP����
0��<��!P�;��[�~��+5G�J�K�O�FGJS�
�9��3D*\�E�W�U�U�E�Q/��B�%��O\Q�U��Ԋ,����Z4�>�{���:y��elY;
F�Qg��}~�l�jE
��ۤ��R���NRٸ�םR�TW�/A3v:V�Z]s�
\"���)�n�GP��԰�� �l�
+R�sC�΄
���O-�c/���WӾ��t��̽5�0�C	
P(f�ԭ��k
��d��6չ���be
+�#i����2u���J��'��c�{�Q�����
�.�d�"�z�U�E#y���!�����|��T�G��a�S#@*݃��@²��Tz������.dú��^�i��Í�� 
(~]PhV���Ʊ=n훕5y�M��C�ql�+UR��f�6j
YRPc㒼�L���ā�
��E��Z�N��c_
�ۨ%��b��FDg���g��g;�kx
#����C���� �� �K��w����76w�O_qJ�%�_���{�ڱu�t��6%��?��@�K
!��&F<
5��7�Xm� ��H\��[�:˚��FdS�;��Y�)��K�y�{�ƛo,�e����L��{��$�	�������8�ᠭ�r��x�0u�ϯ�!yǒg�s���R�L]�%��@�/�n~�x6Q���5r=�_��7��)�#�������
��w��&���(�Ŝzް��7u����@5�R���
8[̕���!�C�闆C�	$�)��z6:�g�`��!�呠��
+��!u�.��$�Z��=M,�>l�z?y��'P�0�#naT��5o~����c�zK�F�͚��
��� �;���9`�	@�8$�?gٿW������_��?i�?g�`�@��ċ��,�����4~F?�o�Oʖ�������\�����*���L� �<���_���v��]�C��4��/�������<c��,���ܮ<���]��2mNܴ�
]oE���Dž�p�8�c��A;Q/��٭�����zDŽ
+endstream
+endobj
+1519 0 obj <<
+/Type /Page
+/Contents 1520 0 R
+/Resources 1518 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1489 0 R
+/Annots [ 1517 0 R ]
+>> endobj
+1517 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1521 0 obj <<
+/D [1519 0 R /XYZ 89 770.89 null]
+>> endobj
+1518 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1525 0 obj <<
+/Length 3314      
+/Filter /FlateDecode
+>>
+stream
+xڭZݏ�6��"��e������ݏvzmw;=����+_
;k;����~��-;��b[`0�(�)�"�x�������ۻ��o�p��l� Y��W[o�F�M��W�~]����w?��$��������wo~��@cWo�>^��V�̏7i��
�~��[ ���6�6[=2�q!����տ�<w+�7ۊ�o|_�<�ͱ�M�_߄�����t�������l�oR�[�����us��c���E!��?�V�Ǽ7m�W���Ÿ4v͵�������re_65M�����t�U���A����Ty�`:���?�8���X��
+�`�7���1]��u��`��JԲ��'�ZәV&���e_i����^7��%̤k�[��ew��O~7�I���.�e��,�ܷ&�cO���2y�e�ٹ% 	��z|��'��ͰN�I]�X
����x.[^9��=
�}'�����)�>ړ�iy�����Ɵ�6U���͹������^&V�����:��,�p�DjJ�ݡ9W��O�~�u��vJ���.S��H�Qb/_T�#�C�‘���1�:��@�W)��e
4oן�P�l\�D
s�A
+Bݗ���h�zK�EDs���;Q8�N9,ez��x�!�d��!P���� P:=��H[�ӑ�{#��N�G�J�'z*Iz<G)��q�}���=��3�ǦU��@
+N0���y9�:�;����p e�������9}��ƕ��n78��ad��F��uw�걘0���P_��x
�g at M`���DUA�g�ф��{�bS���'�.�7n.�����5G�5䁓��M�H(M��&pf��\������x(i=j�)��Ԧe�
�C����a̺����4�w�ۙ�"�}+�� ��U�^��4�Di�@Lu��� ��V��ͮ�:���!�+�㌍ .NU����ꉯ�Fɠ�8�Rܷ�L1q%�b��5�!͌�3Ʊ:�8�F j����^�l�nNt4/&sbUt���A�6Bkt&2zj�굢�]�������e�@�^}d-݉1�v,��X��J
���\h���
.�?��Ic��ݙ�:�a۽m���_Z �

�cYUo�1�5��YI��b��ER+�L�o��F�2}� ��*�n�=���V��s�a
�&ඵ3�
И{P^JW��y� 0B�O��u�W
+i�U���pVY���u�S3\�}^V|�Kio/�\�
#�����}#&�

?\�!�K��N�Ђ�#��*�uӏ�E0Ұ�^�h���R:�4�3?4�.ȼ�N�ޣa��)����#�Om��>�~I�	~�)"�[m*N��S!>����QĪ�Y��p��t��e�j�6 �0A��S1F�6�
Ns<l�d��9�Yf�BD���ӻ׷oo_}sw���2m�_̔b�
�(�+�Iڎ�G��9 _K�.��~j��b,����?2
f0RO G >�Td�D�8���D���l����;A
G��{x�d�ޡu��	
y
cǵ1a���X~B�̮�
�
+&�V�֏%B��nG5�s��b�M]?I9�*1�����a���=:rn� ��?�@��
h]\T
���Q7=8�$�\k��.�Qjp��ƌ���}j�����^�;k���Wc��mD.:�bf����(j���
��覙�`���wy��
���Mf+�{�e���[����g�(�ں�7�;��M
(�ЦC/�\޳!��U/�1�ߓL��q��%t8V�lX�%��zm(����Yn2��u�q-�!$�L�������~�[G=i1�)ʍr;Q!���-U�O�
Y�JI`1�x�Np�{
�	A�UR�,`6��i���m�q]�G��5��P�
�M�$P�oî��A����A†f�$���"���a�s���-{2Z_� O�E��� |춪Bs��DT�I
�f$s�"��`'������^�jr'�
ˮ�z�Ğn�8��m��
���g�	�ע�Xr�K�d-_����=�k�6��Ј�"�&Ć���W3o��e�
+���%�G�JB@�P� {�
�*������3��dۙ�&aoտe�<���7
���t~K�����
��W@�(^�=��k��zX�S
gQ��"�qeN�y+�wA��2G$^�bM�HI$‘u�p���sR��9c�W2m4�l!����ڂI4c�,�I�*����1�7�ԑ2
� ����Ū���C����īgL�O#��Ak)K�4�&l�k�Q�Z��
ױ8����Ŵ �@�r.+)�B���i���hQb8�tp"��j�gU�6j�8ӃF"H��u��1L����/0������zn��\-������4T��� $�H{o
s�43������
���-�S
O��҂�֖HsvZtud�o7���F��E1y� N-ޭ�B92@p<"Å�85H��|�Zחfl`LՀ�pɑ��C��)�Kٖ
	8ި2��u!۟���V�
�<
�DA�!wx=ry@}8�qn���/�s�.Gi!4���t/0���.Ί}o*A� �����E7^�<c�Mj�IsO@Ɠ�
ɂ���?��`܎+I���f@�MDp���j-�}���>u��<���	(��|J����XnDV����j�Ebd
�?����
���},�?�#�ԧv9+� �����S��-�{�}�
��_�������,�*�2
I�tL%���8���W�s|EAI,P����WT�
1 ��T�i�
�m��hԢ�T�	��IQ��
+�	S
FH����{�
����_���l��v�=�Ъf8�$�x��B
$�Y:�C����D ]���9U
���8�i��Ts��x� �!^S!��p�:Y�t3Ӽ���i����p2�Y�V���<
F1/��ط���/H��Z7�N^�1̑�3��Z�X!��F�w2-��䭅�Э�JI� ��vmy��Ⱛ�U��fW�a��rMhVs t0n�Oz�/�D~x6 ��|�

+S��hL����
���s�^���F*o��ɫsj�U4�'L"l_.S)�3L>���X�Q�&%kx����ZV
+mY)����ed�W���o);3�̤D���Rw.
������'�@c�+����b�x]|yG��G2/�
+��7���0iX�B�W��B`](�Z���t�d��Za��[p	���(�ʤ��Nd�����T	U����=�31J7������x~�<�y��Q���c�z݀�H��nF���ZiZ��ěh�E�h���4~�����Oy=�����.�UP�L�yT��`��K��ǰ��+��=������}���������f�
g~d��v������ۗI)H�W��;�/�n8��tLb�
+endstream
+endobj
+1524 0 obj <<
+/Type /Page
+/Contents 1525 0 R
+/Resources 1523 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1489 0 R
+/Annots [ 1522 0 R ]
+>> endobj
+1522 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1526 0 obj <<
+/D [1524 0 R /XYZ 89 770.89 null]
+>> endobj
+1523 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1530 0 obj <<
+/Length 3138      
+/Filter /FlateDecode
+>>
+stream
+xڭZݓ۸
߿³/�gv
}�j�����%��증��
h���Ȓ#JIݿ� J����L�dA�!����_�t������,Z�<
���n���,�WI
+�b�-o���~��H���2X{RR�u�펲jE��H��VV�S?J�$Z����՛��/W��/Z#Ye���x��o�� ��
���7�t\�a������W��n�;�A���l��*H��Z}����
6bOP��2��L�� Z6t��|�6��YP��R�֊�X�Y���m$�&�dI��FDV����:a�j@�M�ԍګJ�h;��-�.Oڞխ!{�;������
O6�?��o#w�h��5���2Lx
+�dsT����Y�/n׫8����fe>�a2⚸M��#pz��*�S��51f�ROT�;c'����ț�Umi������\ո�o@�K���&N+���,���F�G����Z6�y�DF��%�..Atcd ��͍9�[���D�ڭ��ƫ�cOU4BҠ1�
FEYN���nE���䶮���CR,o{�
9ۺj�Y��׵�0(m�vsn��������nT���H��}��3>��#�2>�(]�I�aL���j�U�E���(ͽG:MLh��,{�� Ty
��vY�(
+������O�jT#�|ĉΦW�?�~��
�{�V�q��e{*}�_:>�^I��a��f
+x�Vm��}Ѵτ��h�������+�]��Z��E����;���
�w��*�FsXX����{��5A13��L
�
oxQUmˮ���M�r��ׅ���!0�I�����e
��	
Y
�&��m
�l)�a�7*��W�VU{��%mx�`v��N4t�af��֊ԖUQV��7�
ƪ�+�{v�R�����Ѧ~x��Q8���}:�\��R6�)S^+�-�:�sp(��U���m��
rK�p��������VS��{���
+�GѶ�(p�� ��
���IV��BN��҉RA�ٝ��9��uU���wI�|rA�h��UI
JDPN�y���(^%����
�R7F�I���
+9�
�p&��d#[�M�}%Z���#�(�&�����W�;����ᚬ�st�B@����PoQo{P��F-
+�a�&
+3k�S0bKC�fs
�
5s�&�
׹��u�?-� �Z�� J7���
�ɘ��"�>v���G
w�L�'=�Bu����Q
nQ�j��
�Dp�(��-�a
l�3D�p��idC0� �j��*,�n�e���c
(�B��u�#�(����ke���D~<��Hٜ�מz�i"`�WRC�Kw�c��x*%n
+�y ;�^!� ��-%�iL,��lH1\<F!�Z� ��A�܍���8��>zغ&�2Xٜ{��8T�/a�����$z�eD�
�����Zh���0�"!�nH
�Z�{���[qľA���Z�%ьM�؝�or#�QW;
��k�Y�f��}kB�+�R
�?-3�O�`�4a,:�uT�X��B%Ȏ�jD��\L���{	�K��K�b^&`o���
+�F�E7lY]/�FKh"��;��FW�cpv��
�*ϼV%/�e4�����'#��Bg
���
��oV�46,|N��
}��f	����y�쇋��
+i'ô�*: ��i�S4� ���3H;0p���C;����ř:N1C�
������=*�
KĞG97�)���*������d��IB�i���ݽc@`�2�_��IRfK
@`ݲ̚�Pi! �#
[��8jbQ�H� �
�Li
S	���Z2NjH�ɔA0
iyx��L��[#O���I�K��p�7���Os6'� ��4���ɼ��S�u.��a �czN����d8Ӑc?^M�
��O�
1P B�֊q�z��/
�̩��Ap�r���^�
�&J)�"g���D�W�s1ggKf�=�/�63���
�)��<�A$�\�b�B����v򊚜L�������w�w�?�S�����o�
g^Y�f�з@�G�u�(�|�>�S����%�-��f�,�x�u_�;�����
.^�ˈŮ���
1�D09B���ȅ��Ml�`F$�n�8�y
�8U`}Cyj�Pm��Ñ��$�*C�2�ؤ�jqe-�
�_��>\=�ܲ[� 3��
�v����B{W
�`eX��n aG��:�) �'Z2F
+�KlΛc��;�|uH�ld*�
�f�K7�����OZZYFnz��}��cU��X�%�
����*i��Ga��33$�3�L��/_
h9�gmC1;ve�N%
��l�5E �νe���!�<&���6����%
Sj�
��
	�d�~�l2@��l�<�R7O��A{��y�
�1\���s)�8[U߲�{&xj�K�@
��T�绁ݣ��������z6)�G��@��燾5<��R�/���S�<t�$���]D�+K���R,
��+H_���Y�5�*L6��؀=���Rs�g,\	�2�l3�os0l��TF�u/M��W�8�%�:=VIV��;��V��\�,���vȿ6o�*?1='׃�$��r��r.B�3_
�#�lĹ3U'k�u�&S K8�S[)Z�	~�~,�
w�)k�
���n��ԥ���! ��%Hp�
+���3sf���t	┃`�~��G�/cGD�1V��G�ݔ�
+�����S��gS�_Go���L �;=rG8�F�U�9plT�+�7Q}W�[g[]�>�L{(��ݛWOw��$����*��>�7�f�B�07�e��_i��d�y�}��������h.�b�B�L'��C�=O�i 

s���\��
$����qД�5�띝�4��_3HV�H��� ��
�L�-A?6���
p��� �h����{X�{\����_�����9\ᲬmA3�-�ͽ�3���1Ŕ�&$���
ܑ�Չ6�U`��r��R�I�s81��TNU
 �	
0�V;�;N��0��DZ�Y��Ic��P���w $����;j|��_
��(�N���Ծ��J�
+ ޮ�Η�QJ�)�ya[��w��Q'��U�N�g�C۞���Ŧ�kY�WF'��{�W~������~=W�x1|SkZ[&~�J��Z
���_�A����m�A;�	/���u
F
���?l��
+endstream
+endobj
+1529 0 obj <<
+/Type /Page
+/Contents 1530 0 R
+/Resources 1528 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1532 0 R
+/Annots [ 1527 0 R ]
+>> endobj
+1527 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1531 0 obj <<
+/D [1529 0 R /XYZ 89 770.89 null]
+>> endobj
+1528 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1537 0 obj <<
+/Length 3231      
+/Filter /FlateDecode
+>>
+stream
+xڍZYs�F~ׯ`�e�*�}�MѶG�J�RI
@$g
4 Fѿ߾@��r�9�s����uC�b�po/����z���N#/Z�w��Y�Aj��?�0X���e�G��,"���֫���]��_/\r.��8Y�Nj?�r[ ��pl?M�4�<~����.
��ș�⺶��/]ױ������1{�F`K7���,�x$�VU�������Ǣ�xŮ��2��E���eY䝪�WHH�������Yz�u�
+���DUm��
�������S�նhxbwP-߫����	�Y����a�<55�v)�� ����P��鸍�>�zZ�<��X��WN�����w�� $Cn�8-&�{�݁��,]��;>~�
�0_p^3w٦hO i�$t����ph���c��H,�M֩#S��)to��Y�-}	O�(7�ۑ'<����]�}{�z{���p�{|�]��������
+��[�Ї�_x둲����;~�'Uf�P�	�/
�3@��P�Ъ�Y-@�X��?؇�(�𨺃lM�&b[��&������8�-��<
�
���Ϊ)����4�~�����h"u	���n4�vu���#�Rz�c�U��+|��BuCb���J[���l�74�+.���h6-�i���1	��\v�O3WO�h�I�ɋ���Vu�3�-�.���TG%���~K�S-O#5�
�c��-��j��aaC{>Օ���Fa
�����U�w�dx�֩h��� t�󡨘,{&�
+CO�*U��=ReQVq�b�r�D��8����Iݡ%R��N'r�@c13C��$�i� �5/]b��G��)W��(L�Fh��=�E9�$���v��������¦���:�c�g��+��^Ǝv�Li��g��LH�e���
w|�![KY�*�6������[!�E��
o�sv3ē���.�(c�.
+�>q�h1m�p���`�!+wB��I`#�ȴ9�sB=��O
-9w"_�f�Wf
���
{*�
�i����[�sW�8��
��
*J�M|1	~@L.���ɬY
��Ǜ�
+<M]�\��(���!���
ث��X엪��8��>b ���9J`������b0tp�;�[�A��"�e�S�����	�#�0��i����|�5� �H���뻇�
/�

�K?���j�8�S�G�:l�9

닪��0dSo՟���:b��Y�\��y��KG�44�a\�u/��
A�����c�;�����:�'�2ˆ]�Z��@8�}�6DP��V���lTF�
f?�Җ{
�p��q
(=��
+#
N��j[�"��?N�
+ݬ�
N��
+�o�x�%���$ol��q��H�N�u9���>ʜZ&x�Cs2�qC&�π
Wm�J��8y鑼�9\JU���MG� �A��؜aɚ�?1�8d݋�AH�d�
�
ap���0
�)���ta����хc,�.a���k�
���{OGf�
�������	�F�y��#���
��!/��9)+�B�5��{������
+r^բ��hL �
+"�z��
��
eP��~�t�Zo�
s��v�AH�Vx�3�Ro��]
6��
���>7E�X
�k���G��B-�0
i�DH4���Y�
!�j&f���2��b�h��a�"��8Sf  ������*��0
����8��T�Fz�$"'5��#�
�+ K
%XH��οT��mO�o/�F��]�@~����4.|�0�{���T�Έ�O't���P\��5�~^4&�V��@������a�A���I�R��Rq(���/6
yBޝ������$��
�����
�ռbW�e�I�����hqL�7"�=o��K��H��Y�����0h����ũ�iYk�A7ۖ�?�q@��޷�����5L6��k�`}'�y
�ʺ�8�:�SV�SY�n:���
d�k� =���

D�d�4�:���Q��N�5s����G�Q5�����LbD��t) �RF�����AL��wl�Őgj��'�uʚ�s��-7�j��0R�-��O���Kyĭd�d�J@��\B)E�����,�}2�O�{%��JM��G)|���p�X �J��z� �Q��9�bJ 7��d �#F�������w�_�������ވ�zw+���?��
V?�+���{}�[��P�:*/p��P�5���0�
	
��
/ �*��+���������'8��=xx ���4eJP�A�?��E7G�(���5`��
kwR��{�	)M��a�/hmd�V
UI9#�,!�T���'j؅NN
+�#9��>��	�;dlWLN�
���B�
���
+
Tm�GH�ޔ�Q�����
�lx���d{��d�˗�n��_|BC��(���ӟv]w��������Wg�n�W���b�]ɖ��f��n���
@����XoWY�m�t�P5l�~��Y4��{���q��|���@H`4暚	|
�H���Ƶ��_��\�3��P>O{�1;�J�=4�#�/k٦O7�W�c�K���;��;���/Ή��	�!�N��ߜ��e�qG�h�}�$:�Ja��
J�y �Cڀ�"����S�0�עt�t�t��C0ƴL�`"1���
���$(��Z�%��v
�K�n�x�E����h�h�IXI:��'�LDF�QI
[=G$��ӈ-��3�F,�`h|s�
��u��x.�N
�u�!<4ra�1�cT/��C�8�-�.���
�RaTNh�4��{NM�̆h


��8�����". Z��aF>;�����
h
�:;:����Ƴ��o�p���ؠ��@��tR9��q�o�*�B���R!
_�}
Ѡ1A[@y�H���
�Jİ��ڗҌ��
+��%��Gg�'��8��oT����1?	K�bg%uߡ�ßl����
��]�?��tCy���O���	�h��L�'^��[�v�z�g8���a���"�
�_]���O�<����Ր�; y��s�@����w�%'�#�R�/��Wܔ܆��t�P
�-	/=�
��1�=�+�ȳc��ѿ�0�
���!_��
7&� ��6
�5B��=���6�{
��
6�C2���v�z�P6c%��{n|j�F���oY����h��2��
L�-p<Ŏ
$�pm�{��{;���
���v�D��i�w�u�BU��tp���
��
+endstream
+endobj
+1536 0 obj <<
+/Type /Page
+/Contents 1537 0 R
+/Resources 1535 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1532 0 R
+/Annots [ 1533 0 R 1534 0 R ]
+>> endobj
+1533 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [258.676 256.745 428.041 267.648]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/copyleft/)>>
+>> endobj
+1534 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1538 0 obj <<
+/D [1536 0 R /XYZ 89 770.89 null]
+>> endobj
+1539 0 obj <<
+/D [1536 0 R /XYZ 90 141.639 null]
+>> endobj
+1535 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1552 0 obj <<
+/Length 1560      
+/Filter /FlateDecode
+>>
+stream
+xڵX[w�8~����e��ZA�f�O��u7m���/mO��e�S
T@�����4�n�	1�F3�|3��9�F�����w�D,r�+'�8HH������	
=�m�ls�dzb)n�_�o�����cP�ֆ!JG/�o#
+BϡZ_H⩓nG��x��o
���ԹQ��N�|x���译�3-t�`Z�i�1��ĉ)%��#[�E�'���F����Z��`�ջ�zp.��(�v+��7YYh�E���O���B��%L��9�$L�
�1�;=�yc
�~��jyVo�R�.v�v]���K+/�Ue��οɚ�^X��9+�s��1�D���'�U�,����5v.n�����g<�j�Am%�	e��ޑ���P�d����eE��K�NV
���
�1˚
�
�2ն�<*�'u��G�A&L|M�	���p>��wwe��n��A��4t���� %,t-�(>��h;nԻ�^7��J K}������
 E��Th
+>\y�4!��v�=�g�蠤 etH-L�f��g*�m��� S%!E�"�x���]4�
�k���ܰ����3��/^^�����q�=iH�#���ʎ���G,�D�X,	�©#�B�
4܆����PEw��Ūt�\]n��R��F���EV��AA��k(h6�`F��ѩ��ʺO�P��܌)T�*�C��#�5mmm�fV�m�X�;�ΚVYE:�1�Xp g�!�R��&��[
+d�-��V4R���\�4F|[�ʘ�j�a���Z�U�D�Y����I��QK�B�\�Zq_��Z
9�H�a�cQ�V\�<h�\x8a�a�)�Th��d+U�PR�E�������~cq �-�ޡa��u��W��.�K��EO�����
+��

�FdRǰ�M0��ag2���d�+a!|`�I�C�Ô�C����b��y]
���eL�{�/`G�*k;�
�UKhOq�S5�r������zk����Cn9��
l�)���þ
��  W��>��w��떯��
n���֋m�\�~�ë��	3<
+�(|�}&��uh�zǷ��ԅ�bv��@<�߸�b�m
+���ac.d&�S�U�X���H�D�/u�l��%�e���R��l!���BI�rnK*�S�|

���*�g�c�uݖhl
`��.:�������p�b��G pv6{�
�oJY?
�S䬨��.Ӫ�<�h:
��kp���	�o�b������w�4�w��'�fa
�n�?�T�>��~͎L:�� e�wc:��M��[����+�s^�Z��@
�
Q@�]��ڦ
�L��%u)��!�v��w�(t��j��l+��R
[�F����h�|��o���)�EU��^�f[�����ҍ�(~H�h�n
5n�� b$���O�s ���� AL�d: ���
|���m
��	�[^����g/�L����QH	����
��Z����V�ձ�?����=LC�gd�4����]עX�]�
��><��U)m;�]U���ѴX�
%$�A �I��8fj��XMڍFp:��΋@����7�)
+endstream
+endobj
+1551 0 obj <<
+/Type /Page
+/Contents 1552 0 R
+/Resources 1550 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1532 0 R
+/Annots [ 1540 0 R 1541 0 R 1542 0 R 1543 0 R 1544 0 R 1545 0 R 1546 0 R 1547 0 R 1549 0 R ]
+>> endobj
+1540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 390.802 513.996 399.778]
+/A << /S /GoTo /D (subsection.8.1) >>
+>> endobj
+1541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 272.649 221.094 283.528]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library) >>
+>> endobj
+1542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 262.597 513.996 271.573]
+/A << /S /GoTo /D (subsection.9.1) >>
+>> endobj
+1543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 238.672 288.052 249.551]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators) >>
+>> endobj
+1544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 228.62 513.996 237.596]
+/A << /S /GoTo /D (subsection.9.2) >>
+>> endobj
+1545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 206.598 117.901 215.574]
+/A << /S /GoTo /D (namespacestd) >>
+>> endobj
+1546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 194.642 513.996 203.619]
+/A << /S /GoTo /D (subsection.9.3) >>
+>> endobj
+1547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.1) >>
+>> endobj
+1549 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1553 0 obj <<
+/D [1551 0 R /XYZ 89 770.89 null]
+>> endobj
+78 0 obj <<
+/D [1551 0 R /XYZ 90 491.907 null]
+>> endobj
+82 0 obj <<
+/D [1551 0 R /XYZ 90 457.856 null]
+>> endobj
+86 0 obj <<
+/D [1551 0 R /XYZ 90 373.735 null]
+>> endobj
+90 0 obj <<
+/D [1551 0 R /XYZ 90 338.73 null]
+>> endobj
+94 0 obj <<
+/D [1551 0 R /XYZ 90 177.575 null]
+>> endobj
+98 0 obj <<
+/D [1551 0 R /XYZ 90 145.325 null]
+>> endobj
+1550 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1589 0 obj <<
+/Length 1128      
+/Filter /FlateDecode
+>>
+stream
+x��X[S�F~��ط�3���
��L	!%@��CIF#��h�$G
��
I����H�'I{;�9���튠"�h�n<���9��*���Y���X*���+O���'ĕ��*�T�
���ߟ�/�����ǀBA��/�6h
��4��O�`n
�Y
��`
�w�r�׀,�l?_B�D`
+-�RLi	�|H��Q���[7M�$�N��q��!��|���0
+���n\�����(J�ܕ���� �3�v��r�&aW#�C� M�i沊9
z5��"|e���2�G�~��`�IV,gU�
� ��(�F�a)u�8�;�/o��� M�Ƃ�]a�(�\�b�eK�e��v\���Nj�\��_	a� s��CW#ja
e;��� ����ܥA��5����f����פ� �Z�uJ��Ԡ@
A�j��x 786��ݖ�*8�Y���p<�RIBD۔`3�6~�^�>Y22�-���&�3�5T��Z��^��q�N�d?;r�&��An��G�.�"���M�5IN-�_�#&��4
N
�B���mh�������i��R�k�+;*��A��uU�J
�l�U�BJ�"��}��mp���ٚt
�(
�o�#9�
�AOJә��?��D�X�e�y�<T�kڭ�`���RC>��[��A\��Z�Sk"TT��y=��6�Sh������dD0m�2�_>.2�qVR���B��;��~���4e
++bK�!]��!��(ņ��i��эL[ދ}>>��˻&�Q��?Ib8̄��s�(bE���˳TI���
+PɎisV�k���
��تn񜄱
��r
��*�l�R��|���V-D������X�u�n
%i9�١�#�
ܡt�j��Lh�hϥ�"��[@$���W8��`��~��y
)7P����n��د0�rӶ/ӻ���h���D��x�U���/QŰf��/�'����R
&p�bE����s5gٰw
qt��b��F��h�`�Ud������'��le�<0޺�����|�{��_�p[Y�ߟ��>�+߿I�
R鹴8D��y�
�Q<
qؒK��y������p˧�4�¬��m�������g
��$����!��.�7���(I�N�14FA~l���
����

+endstream
+endobj
+1588 0 obj <<
+/Type /Page
+/Contents 1589 0 R
+/Resources 1587 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1532 0 R
+/Annots [ 1548 0 R 1557 0 R 1558 0 R 1559 0 R 1560 0 R 1561 0 R 1562 0 R 1563 0 R 1564 0 R 1565 0 R 1566 0 R 1567 0 R 1568 0 R 1569 0 R 1570 0 R 1571 0 R 1572 0 R 1573 0 R 1574 0 R 1575 0 R 1576 0 R 1577 0 R 1578 0 R 1579 0 R 1580 0 R 1581 0 R 1582 0 R 1583 0 R 1584 0 R 1586 0 R ]
+>> endobj
+1548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 709.994 513.996 718.971]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+1557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 687.437 513.996 696.413]
+/A << /S /GoTo /D (subsection.10.4) >>
+>> endobj
+1558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 665 513.996 673.856]
+/A << /S /GoTo /D (subsection.10.5) >>
+>> endobj
+1559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 642.323 513.996 651.299]
+/A << /S /GoTo /D (subsection.10.6) >>
+>> endobj
+1560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 619.766 513.996 628.742]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+1561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 597.208 513.996 606.185]
+/A << /S /GoTo /D (subsection.10.8) >>
+>> endobj
+1562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 574.651 513.996 583.627]
+/A << /S /GoTo /D (subsection.10.11) >>
+>> endobj
+1563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 552.094 513.996 561.07]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+1564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 529.537 513.996 538.513]
+/A << /S /GoTo /D (subsection.10.13) >>
+>> endobj
+1565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 506.98 513.996 515.956]
+/A << /S /GoTo /D (subsection.10.14) >>
+>> endobj
+1566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 484.422 513.996 493.399]
+/A << /S /GoTo /D (subsection.10.15) >>
+>> endobj
+1567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 461.865 513.996 470.841]
+/A << /S /GoTo /D (subsection.10.16) >>
+>> endobj
+1568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 439.308 513.996 448.284]
+/A << /S /GoTo /D (subsection.10.17) >>
+>> endobj
+1569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 416.87 513.996 425.727]
+/A << /S /GoTo /D (subsection.10.18) >>
+>> endobj
+1570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 394.313 513.996 403.17]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+1571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 371.636 513.996 380.613]
+/A << /S /GoTo /D (subsection.10.20) >>
+>> endobj
+1572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 349.079 513.996 358.056]
+/A << /S /GoTo /D (subsection.10.21) >>
+>> endobj
+1573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 326.522 513.996 335.498]
+/A << /S /GoTo /D (subsection.10.22) >>
+>> endobj
+1574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 303.965 513.996 312.941]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+1575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 281.408 513.996 290.384]
+/A << /S /GoTo /D (subsection.10.24) >>
+>> endobj
+1576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 258.85 513.996 267.827]
+/A << /S /GoTo /D (subsection.10.25) >>
+>> endobj
+1577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 236.293 513.996 245.27]
+/A << /S /GoTo /D (subsection.10.26) >>
+>> endobj
+1578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 213.736 513.996 222.712]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+1579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 191.179 513.996 200.155]
+/A << /S /GoTo /D (subsection.10.28) >>
+>> endobj
+1580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 168.622 513.996 177.598]
+/A << /S /GoTo /D (subsection.10.29) >>
+>> endobj
+1581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 146.065 513.996 155.041]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+1582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 123.507 513.996 132.484]
+/A << /S /GoTo /D (subsection.10.32) >>
+>> endobj
+1583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 100.95 513.996 109.926]
+/A << /S /GoTo /D (subsection.10.33) >>
+>> endobj
+1584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.34) >>
+>> endobj
+1586 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1590 0 obj <<
+/D [1588 0 R /XYZ 89 770.89 null]
+>> endobj
+1587 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1618 0 obj <<
+/Length 1343      
+/Filter /FlateDecode
+>>
+stream
+x��Y�r�F��+���v��T?�����d�LQXj�dxh���
HB�0B(�^	�}��ϥ�3w�s6�e28:U�1�H*�ɝc���AB¿�s�JD�!���`��T`���fA��N�="�Go�(����4y?8�
�
��
R�(���4
�|��
n�w0bF;��/��
~#�z�� ��{��m�sD�"R<�v�,��G��F��v��Ex
1?�F��d�gA��K���=L�0M���N���sJ	����e�?U�<Q�~��X�sLzci�~���
+�l�����7�c)��R�j׌�3d�!��3�Q�����6��$�mC�D	$U
+l����d҄�B
�� h
LT5 � ���KF�#�p0q&�b>��x����`�<��Edc��A�>��#<O>M�̿���V(5��
�Ժ=<Re��
��"\��
ܩnZ/�$��d9�Mfa2�O�z�d��d-�nF�6	b
j�;�wAy��h7Ўig�e��ڌF����vy�F�� Er[LJ��I!F(º�֪)� E�n��hl��D�謬i��(��I���~��G���`D,�fqu��H��3���
ɑ��`8�"?%y�sؤ�<͚X$
pD�>��(��aQ?��i����9��0A�C���@HrwH��b��8nvR�!^�ԾuN<C��`bwn��XήnBb����V����*+�߱�L!F��>
��	�C��2��/7�nV�^9��pS���0�Jwe<�����l�}
z �~�� ��U	!���

�{5x/
�y"��1�M��bF�g�M+"i[�&i�YCeT�%���n�+t�X)h��6
����"��e
Ų|�û;[��L�(��W/�r�p�-P����Ɇ��a�T[���!��=]�"H)���9�~g�AdjOF���ˇ(Q8--�AP3�1��>0M�
Xo�M��Su��4E
w��)��rc��W�E�
�CU#n�Kk31��U��^���!>�^�V{QWkmj��s{a^�^�
���
|�F�Xi�4ޢ+���W�<=��UL��϶Ro޵�U�6
+����
+L���W���lRAh.���(�9{٢y3����m��j7P��T�~���ü
��vA�^8�ˊWs�k1-C6/��#&	�)e�
1�GI;HXԥ�WH����h�ʀ�����}i�<!���e�<Qu��kqf�R�ʛ O��jxF�7d ɵ���T�v�W��[�۸�8��<_���n�K���4����|.f������i��T�ܕz�����K��"��� @�
0�D)Z��}]>\7\�8:��s���I��

�
+endstream
+endobj
+1617 0 obj <<
+/Type /Page
+/Contents 1618 0 R
+/Resources 1616 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1532 0 R
+/Annots [ 1585 0 R 1591 0 R 1592 0 R 1593 0 R 1594 0 R 1595 0 R 1596 0 R 1597 0 R 1598 0 R 1599 0 R 1600 0 R 1601 0 R 1602 0 R 1603 0 R 1604 0 R 1605 0 R 1606 0 R 1607 0 R 1608 0 R 1609 0 R 1610 0 R 1611 0 R 1612 0 R 1613 0 R 1615 0 R ]
+>> endobj
+1585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 710.114 513.996 718.971]
+/A << /S /GoTo /D (subsection.10.35) >>
+>> endobj
+1591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 687.731 513.996 696.708]
+/A << /S /GoTo /D (subsection.10.36) >>
+>> endobj
+1592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 665.468 513.996 674.445]
+/A << /S /GoTo /D (subsection.10.39) >>
+>> endobj
+1593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 643.205 513.996 652.182]
+/A << /S /GoTo /D (subsection.10.40) >>
+>> endobj
+1594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 608.987 513.996 617.963]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+1595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 586.724 513.996 595.7]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+1596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 552.625 513.996 561.482]
+/A << /S /GoTo /D (subsection.10.73) >>
+>> endobj
+1597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 530.243 513.996 539.219]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+1598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 507.98 513.996 516.956]
+/A << /S /GoTo /D (subsection.10.43) >>
+>> endobj
+1599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 485.717 513.996 494.693]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+1600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 463.454 513.996 472.43]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+1601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 429.236 513.996 438.212]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+1602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 395.017 513.996 403.994]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+1603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 360.919 513.996 369.775]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+1604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 326.581 513.996 335.557]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+1605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 292.363 513.996 301.339]
+/A << /S /GoTo /D (subsection.10.66) >>
+>> endobj
+1606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 258.145 513.996 267.121]
+/A << /S /GoTo /D (subsection.10.71) >>
+>> endobj
+1607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 223.926 513.996 232.903]
+/A << /S /GoTo /D (subsection.10.88) >>
+>> endobj
+1608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 189.708 513.996 198.684]
+/A << /S /GoTo /D (subsection.10.95) >>
+>> endobj
+1609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 167.565 513.996 176.421]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+1610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 145.182 513.996 154.158]
+/A << /S /GoTo /D (subsection.10.47) >>
+>> endobj
+1611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 122.919 513.996 131.895]
+/A << /S /GoTo /D (subsection.10.48) >>
+>> endobj
+1612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 100.656 513.996 109.632]
+/A << /S /GoTo /D (subsection.10.49) >>
+>> endobj
+1613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.50) >>
+>> endobj
+1615 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1619 0 obj <<
+/D [1617 0 R /XYZ 89 770.89 null]
+>> endobj
+1616 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1652 0 obj <<
+/Length 1201      
+/Filter /FlateDecode
+>>
+stream
+xڵX�n�V}�+�V#��s���RC&i����>dF�'�*�3�i�����PDZ#xs��u�^{cg�`�bp:��+�d$����1�Q� !��ҹs�
~�v�Ԉ	���������|��
>����C��)�,���7�,����3���:�2�^;���\A���?4�9"ТA��@�C�]?	}o:�؍�Ϗv���Up����x|��e	/YU8o/�݈
+��K���4C�����
{z�d�W����l
L4v���Gpa#��Y���N����w�f�if÷A)��;��z�*����.#�4\�Ok�(� ���?�R�~�x\�+��G˵m9B�6 ���"eP

�w��W��'�m�0dX"J�N�S9ⵇ ���*ީ������7V
1���ʁ�����ߠgoC&9R�v'Fx;g#�
R���:���y��+8c��
�}�`�̮ �$��̏�u���a}gxÒ���  �MF#��v�|h(�#X٬Q���Z
�A�4��V�|O9�!�?p,򿋑��DH$y��
po�%,>��#K`�2zR��
�K� ���F���G�fr�͇����v�
��콬E
ӹv�a�UY?�>��TbI��0&�pH[��<���"Ż����/�d�k�Z�m֚E0f�5�fS�u^�.	�D
6�%�,�I��L4�\��U���c(�
�Ҵ8��~�V�PB8�k��Y���٦R�u\Zo�Q���\H��ú?�~k��:��A3�9�n�g�r�3����ܻ:��2�
�4��!��i7��_�D����M\��6}�_Sh�;�)ؘ�
�T20��s)
+��K��Ɗ CM&?$���aYΐ1�'KF#�j�a�
�*h�'�I6Z�
+���CTtv�2��Ai
��+����$(��.+x����u�Y���u��d�z�4܅�8e��]���[
^1��
+up*^e�6 �R��)<:+�jΓ
���o�p�=ZI���^�k�vys!-(eTqxeN�>@����%o���׉�"EY�׉/&r��)�C~`��(E�Η�E�vN�pr2�,��vˍ`��n�����		�mQX�
�nZ�-��tzU>�����ʖ���������W,0��k���Q4D�������1��6�Jl����Y�Ĥ0�Ψ�Y�4>9�߬R��"_����AX��� ��P'՟
+"h

գW
��pK��
+endstream
+endobj
+1651 0 obj <<
+/Type /Page
+/Contents 1652 0 R
+/Resources 1650 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1532 0 R
+/Annots [ 1614 0 R 1620 0 R 1621 0 R 1622 0 R 1623 0 R 1624 0 R 1625 0 R 1626 0 R 1627 0 R 1628 0 R 1629 0 R 1630 0 R 1631 0 R 1632 0 R 1633 0 R 1634 0 R 1635 0 R 1636 0 R 1637 0 R 1638 0 R 1639 0 R 1640 0 R 1641 0 R 1642 0 R 1643 0 R 1644 0 R 1645 0 R 1646 0 R 1647 0 R 1649 0 R ]
+>> endobj
+1614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 709.994 513.996 718.971]
+/A << /S /GoTo /D (subsection.10.51) >>
+>> endobj
+1620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 687.864 513.996 696.84]
+/A << /S /GoTo /D (subsection.10.52) >>
+>> endobj
+1621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 665.734 513.996 674.71]
+/A << /S /GoTo /D (subsection.10.53) >>
+>> endobj
+1622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 643.604 513.996 652.58]
+/A << /S /GoTo /D (subsection.10.54) >>
+>> endobj
+1623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 621.474 513.996 630.45]
+/A << /S /GoTo /D (subsection.10.55) >>
+>> endobj
+1624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 599.343 513.996 608.32]
+/A << /S /GoTo /D (subsection.10.56) >>
+>> endobj
+1625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 565.258 513.996 574.234]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+1626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 543.128 513.996 552.104]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+1627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 520.997 513.996 529.974]
+/A << /S /GoTo /D (subsection.10.59) >>
+>> endobj
+1628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 498.867 513.996 507.843]
+/A << /S /GoTo /D (subsection.10.60) >>
+>> endobj
+1629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 476.737 513.996 485.713]
+/A << /S /GoTo /D (subsection.10.61) >>
+>> endobj
+1630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 454.607 513.996 463.583]
+/A << /S /GoTo /D (subsection.10.62) >>
+>> endobj
+1631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 432.477 513.996 441.453]
+/A << /S /GoTo /D (subsection.10.63) >>
+>> endobj
+1632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 410.346 513.996 419.323]
+/A << /S /GoTo /D (subsection.10.3) >>
+>> endobj
+1633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 388.216 513.996 397.192]
+/A << /S /GoTo /D (subsection.10.64) >>
+>> endobj
+1634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 366.086 513.996 375.062]
+/A << /S /GoTo /D (subsection.10.65) >>
+>> endobj
+1635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 343.956 513.996 352.932]
+/A << /S /GoTo /D (subsection.10.68) >>
+>> endobj
+1636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 321.825 513.996 330.802]
+/A << /S /GoTo /D (subsection.10.69) >>
+>> endobj
+1637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 299.695 513.996 308.671]
+/A << /S /GoTo /D (subsection.10.70) >>
+>> endobj
+1638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 277.565 513.996 286.541]
+/A << /S /GoTo /D (subsection.10.72) >>
+>> endobj
+1639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 255.435 513.996 264.411]
+/A << /S /GoTo /D (subsection.10.74) >>
+>> endobj
+1640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 233.305 513.996 242.281]
+/A << /S /GoTo /D (subsection.10.76) >>
+>> endobj
+1641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 211.174 513.996 220.151]
+/A << /S /GoTo /D (subsection.10.78) >>
+>> endobj
+1642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 189.164 513.996 198.02]
+/A << /S /GoTo /D (subsection.10.75) >>
+>> endobj
+1643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 166.914 513.996 175.89]
+/A << /S /GoTo /D (subsection.10.77) >>
+>> endobj
+1644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 144.784 513.996 153.76]
+/A << /S /GoTo /D (subsection.10.80) >>
+>> endobj
+1645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 122.653 513.996 131.63]
+/A << /S /GoTo /D (subsection.10.81) >>
+>> endobj
+1646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 100.523 513.996 109.499]
+/A << /S /GoTo /D (subsection.10.82) >>
+>> endobj
+1647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.9) >>
+>> endobj
+1649 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1653 0 obj <<
+/D [1651 0 R /XYZ 89 770.89 null]
+>> endobj
+1650 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1684 0 obj <<
+/Length 1418      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6}�W��L�B��ә��ũ�����4�ph
+�8/!����.	@��('N���b����]`g�`���d<8z%�#���Ď�$�>��8\1
Q���ETUzy�M��������0 �}��fw�r<�< ��
��q$'N>ag�o
��
�/�K��Q�
�z�� ���>Ԕ� 1�w!����`7*�(�
R�拻���Qx�ܔQyw|����֣!	�<k��
+�3�����aDʤ�86�t+猈�h7��a�t���[_TY��9����a��A
���_ن#���:dH�̾��#��J	�!V�z2�c?�
��@�
+�<�LժL�,�U�y�#ߗ�w�r�!g�<ID!2�ܷ���	LH2y��D�<�IV�a�P�� �k��
+�aq`X�lF�Ǟ%,�T|/Tx���qj���˱�[l7
u�*���PRW�Ex�/�	

;�s�Π���1?� �3�km]�;d`�?�%>��꫽p<�%��P�eKת2�%�,�R�e\'��'�$A�$?��<�
�A=
̐�|
pҨ��D�H��?N�l��}��xnd�/&��C��Q
�!\�xL N{c��M%u��e��'�/<Xc"�#6
$�ӣ����g�K�r���YO��b�R��Q���+�L���(��;�"�{��V}C�}ְ��*�:/w��1ap<���l�
��i��`, at B���ߖ����Yg�fMP\v���׹�����_Z�dO�2{�
B�px^��u�4�iHl�Ů
� ��{}��Y6?��$vif#ڶ�v6�<�ܼ�XG0^�u4h�!!��^�MG�[�`$DT -����C�IUo�<z���j��a#�*�.?�]�s����2婪K�x��2~1#j�M�"i�i�}���/I=׫�2QS���*.�������%��G�C�ݢ�
}��M�A%�*]ȲXm�Ҝ!=�
��<��W�AK��
VM[���
��
M��l�M�
r�y�Z��S��SW��
;>
YcJ����[��_��nmlI�D�@���sO�j3��r��U��a��{�
_����
K�*|�O8����9q�����#%6�ն�������-L�e�J���R��
|h��WX����
�yEҌ�䐨�$"���D��h'	�4s�2�;I�x��F<��3�J�]����?����F���
[�U1�`�̈�
�쌷�>��UI�J��4Qي���)!�3��n�����	��z�ö��P�p�a���w����^�����!�ɱߣli��#���ԺD�R�����z at +��cW�5q�7�!#o}4������f9��6Cq�>�96l���XS�4�-G��f��,��j[,9&ȇ�ʠ�~�6	!h���}h?4G�)s�r y}��?9�
+endstream
+endobj
+1683 0 obj <<
+/Type /Page
+/Contents 1684 0 R
+/Resources 1682 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1686 0 R
+/Annots [ 1648 0 R 1654 0 R 1655 0 R 1656 0 R 1657 0 R 1658 0 R 1659 0 R 1660 0 R 1661 0 R 1662 0 R 1663 0 R 1664 0 R 1665 0 R 1666 0 R 1667 0 R 1668 0 R 1669 0 R 1670 0 R 1671 0 R 1672 0 R 1673 0 R 1674 0 R 1675 0 R 1676 0 R 1677 0 R 1678 0 R 1681 0 R ]
+>> endobj
+1648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 709.994 513.996 718.971]
+/A << /S /GoTo /D (subsection.10.67) >>
+>> endobj
+1654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 687.014 513.996 695.99]
+/A << /S /GoTo /D (subsection.10.83) >>
+>> endobj
+1655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 652.079 513.996 661.055]
+/A << /S /GoTo /D (subsection.10.83) >>
+>> endobj
+1656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 629.098 513.996 638.075]
+/A << /S /GoTo /D (subsection.10.79) >>
+>> endobj
+1657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 606.118 513.996 615.094]
+/A << /S /GoTo /D (subsection.10.84) >>
+>> endobj
+1658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 583.138 513.996 592.114]
+/A << /S /GoTo /D (subsection.10.85) >>
+>> endobj
+1659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 560.157 513.996 569.134]
+/A << /S /GoTo /D (subsection.10.86) >>
+>> endobj
+1660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 537.177 513.996 546.153]
+/A << /S /GoTo /D (subsection.10.87) >>
+>> endobj
+1661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 514.197 513.996 523.173]
+/A << /S /GoTo /D (subsection.10.89) >>
+>> endobj
+1662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 491.216 513.996 500.193]
+/A << /S /GoTo /D (subsection.10.90) >>
+>> endobj
+1663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 468.236 513.996 477.212]
+/A << /S /GoTo /D (subsection.10.91) >>
+>> endobj
+1664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 445.256 513.996 454.232]
+/A << /S /GoTo /D (subsection.10.92) >>
+>> endobj
+1665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 422.275 513.996 431.252]
+/A << /S /GoTo /D (subsection.10.93) >>
+>> endobj
+1666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 399.295 513.996 408.271]
+/A << /S /GoTo /D (subsection.10.94) >>
+>> endobj
+1667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 376.315 513.996 385.291]
+/A << /S /GoTo /D (subsection.10.96) >>
+>> endobj
+1668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 353.334 513.996 362.311]
+/A << /S /GoTo /D (subsection.10.97) >>
+>> endobj
+1669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 228.187 336.132 239.066]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
+>> endobj
+1670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 218.135 513.996 227.111]
+/A << /S /GoTo /D (subsection.10.1) >>
+>> endobj
+1671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 193.252 428.64 204.131]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference__Common) >>
+>> endobj
+1672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 183.199 513.996 192.176]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+1673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 158.316 389.939 169.195]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+1674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 148.264 513.996 157.24]
+/A << /S /GoTo /D (subsection.10.3) >>
+>> endobj
+1675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 123.381 299.694 134.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+1676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 113.328 513.996 122.305]
+/A << /S /GoTo /D (subsection.10.4) >>
+>> endobj
+1677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 315.718 99.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+1678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.512 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.5) >>
+>> endobj
+1681 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1685 0 obj <<
+/D [1683 0 R /XYZ 89 770.89 null]
+>> endobj
+102 0 obj <<
+/D [1683 0 R /XYZ 90 331.955 null]
+>> endobj
+106 0 obj <<
+/D [1683 0 R /XYZ 90 298.843 null]
+>> endobj
+1682 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1730 0 obj <<
+/Length 1357      
+/Filter /FlateDecode
+>>
+stream
+x��X[s�8~���m�Z���Pggg6�^��6�>l�a(6S..����{@;8�:O ��9��霃�5���bt<
�
ےHrʭٍ%�%�D�Vh]�9�|���l�""9L�{O޿����]V�Fg����O�"z���k���3�B�~madK��^J,Fmx�����6�������f�}���
A"D�v1!x���]L(
g��B��m�s?�{��8J��_��/��v���"
IƬ),(
G���dJ
<�������\���2�T�ef��+CL#�� �w�J�{ԏ��(�(K
cŦ��Ք8�1�n�����/�FB>
�$K�,��>:�W�S���N�����
z�e3b6���
���gE��Vbt��XyJ9G��
QF��~a�
b�(��̈́:ㆩ'�PJqH
+�=�["��}|�f����>�af�8"C
v�;LiV� |~
�w
uY��g��4�#��
5�	q�w@�F>(�t
�]LJ�6`/��I�Ce�><["
]o�6ax���P��}˾e{|���b
��g�(��8��(��AQZzg���'&Nj�쐤D��f����
+�P��?�f�*=T���r�|�����#�oD��:ƽ��T�Q����A�Z,t�g@���x�������w:
Z����#�|�E��aq���,1�J`y�9ǂ��9;��$I� L���ks$H�ٔ��9r��a�
 �9��*�R�/���&�*�ˇ�W�ɐ�"ͳ��
G�]G�h�=�#�!F�s��
���P��&��S�
�c�,c�@�lO�o�U��L���Ę��3��xΆ
��Z��
+`0K�������x��3�
��oT�OӴ��\4%+��(=�U��O�c�M��
�6�:P�q��ÿ��N��ZyVy:����@oe���~Ů��Jy84^
+�0(�~P�>{�@�1�08�ȣ����v_�{e at w��=��B<
��9b-�y����fM��˦ٍ��q���I1�p�9PY�
�
E�# O�OT�	��[��n(�2�O���/h���tW�����n��{0���[�ã[
��_ճ��}
IF+���(6&y�wE����zx�ϕ��D,

��М��喫����rJLe~J�
+A.
���Ѝ"a�����>Y]XGaS��ե)D��uW��E�D�v�:<z�jS�f��8~���ϣ���Kza��C/��&2�
Y��
a�!�����{���c:�^%�u��b�妰�t�`}�ϱ�
��Zq�
����1�vq�V��S���	T[�����)b>a��
U��\ �,s��7�&S�TMж}iMSI�Y�I`��6=-�r�����v^�t��,��W�!��Ģ��M#�$ˍSQzS�]�������b�
+endstream
+endobj
+1729 0 obj <<
+/Type /Page
+/Contents 1730 0 R
+/Resources 1728 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1686 0 R
+/Annots [ 1679 0 R 1680 0 R 1690 0 R 1691 0 R 1692 0 R 1693 0 R 1694 0 R 1695 0 R 1696 0 R 1732 0 R 1697 0 R 1698 0 R 1699 0 R 1700 0 R 1701 0 R 1702 0 R 1703 0 R 1704 0 R 1705 0 R 1706 0 R 1707 0 R 1708 0 R 1709 0 R 1710 0 R 1711 0 R 1712 0 R 1713 0 R 1714 0 R 1715 0 R 1716 0 R 1717 0 R 1718 0 R 1719 0 R 1720 0 R 1721 0 R 1722 0 R 1723 0 R 1724 0 R 1727 0 R ]
+>> endobj
+1679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 301.89 718.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+1680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.6) >>
+>> endobj
+1690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 672.345 394.399 683.224]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common) >>
+>> endobj
+1691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 662.293 513.996 671.269]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+1692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 636.598 282.529 647.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+1693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 626.546 513.996 635.522]
+/A << /S /GoTo /D (subsection.10.8) >>
+>> endobj
+1694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 600.852 288.79 611.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+1695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 590.8 513.996 599.776]
+/A << /S /GoTo /D (subsection.10.9) >>
+>> endobj
+1696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 565.105 513.996 575.985]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+1732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 554.783 127.862 562.536]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+1697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 543.098 513.996 552.074]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+1698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 517.404 291.918 528.283]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
+>> endobj
+1699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 507.351 513.996 516.328]
+/A << /S /GoTo /D (subsection.10.11) >>
+>> endobj
+1700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 481.657 384.426 492.536]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator__Common) >>
+>> endobj
+1701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 471.605 513.996 480.581]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+1702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 445.911 362.289 456.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+1703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 435.858 513.996 444.835]
+/A << /S /GoTo /D (subsection.10.13) >>
+>> endobj
+1704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 410.164 310.189 421.043]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare) >>
+>> endobj
+1705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 400.112 513.996 409.088]
+/A << /S /GoTo /D (subsection.10.14) >>
+>> endobj
+1706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 374.418 362.014 385.297]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) >>
+>> endobj
+1707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 364.365 513.996 373.341]
+/A << /S /GoTo /D (subsection.10.15) >>
+>> endobj
+1708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 338.671 341.531 349.55]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) >>
+>> endobj
+1709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 328.619 513.996 337.595]
+/A << /S /GoTo /D (subsection.10.16) >>
+>> endobj
+1710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 302.924 344.301 313.804]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) >>
+>> endobj
+1711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.245 290.969 224.72 301.848]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+1712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 292.872 513.996 301.848]
+/A << /S /GoTo /D (subsection.10.17) >>
+>> endobj
+1713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 267.178 318.129 278.057]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+1714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 257.245 513.996 266.102]
+/A << /S /GoTo /D (subsection.10.18) >>
+>> endobj
+1715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 231.431 410.637 242.31]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common) >>
+>> endobj
+1716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 221.499 513.996 230.355]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+1717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 195.685 343.962 206.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
+>> endobj
+1718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 185.633 513.996 194.609]
+/A << /S /GoTo /D (subsection.10.20) >>
+>> endobj
+1719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 159.938 279.196 170.817]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+1720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 149.886 513.996 158.862]
+/A << /S /GoTo /D (subsection.10.21) >>
+>> endobj
+1721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 124.192 314.612 135.071]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+1722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 114.139 513.996 123.116]
+/A << /S /GoTo /D (subsection.10.22) >>
+>> endobj
+1723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 381.587 99.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction) >>
+>> endobj
+1724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+1727 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1731 0 obj <<
+/D [1729 0 R /XYZ 89 770.89 null]
+>> endobj
+1728 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1788 0 obj <<
+/Length 1617      
+/Filter /FlateDecode
+>>
+stream
+x��Y[s�F~ׯ�ҴZ�e���L�K&�3Qc���0H�dj@
+����={]�d�f��]��|��-`g�`�}��]��Z0'@�G=�n��n���ع�
DC�1�_�QY����MRV�ow
�0������G�l����G`;�,ȑ�Iֻ����?:��w��P渔������a����\1��~iӞ`�� B�R����Ȣp4��?OW2.��&Q�:?��a�����q*����</�0�dU�B�T+���
a��s��������<OWf�YC����
���Q�W�X~Ř�I>ۑ�ʨL@�͝f	,h��Eƹ��$p��S��ZH)b>���"���27憷��z�y+nj�ԏ�3��+�6Vhj�g�����)��DF��O����n \�@��Pӏu
+��neF�[B��b��X������G
�� n�s����$�Q^��0�%�~�![�j��k��u��G�G��٩�������m)��k��ZV�e-pП�8r��>��h��#����Z�
+�&Ǫ��͗y>+�2�ȷ,)�F���b�(L�7͈
��F�g�%L�;/{����!��-�(���t
U�� ��cW[f�a@�p�s����Ƞ�8>JM-^-�*��׿
jR3��C
<�G��z at 9��,�Z���nՉ�
��Z����~�L̠njj�̨��
�c�'k}�=Q;h�M綖꠶���2J�jUw*��y3�?9�v���֨���5
%�o�O(�
�V�oS�; C� `(;50e�E��I��X��"��H.�eh��e9F�OI�jC]��v��Cb
�����$����<�ڨ�2Y=�-s�����&@���V���yw�;��_���^J��,ɣJ�@NG�������][ M�:y�>b�>�
����"Z,T�0��Ы;�э�X�QJ����m��^���U�]3�
̂Q���>�aDpÅ�
�����4��M-��z���f���2�!��������l�������P����Y�{��P�)^K��i��r�tj�_�ᾎy$iP�<�teA��Y�bX�l���,h�ʅ0Q�B���$&�4I��� g�/��
��QCw�+�mo
�3
#����l_�1���w��Oĕ.uS�jv-�$��gޛ���s�����| �`=U|1Wƙ�(���S���j,�-�l��բ27"j�T�
�4Dc,�����]z�r[W��
+T��tb�����y�	k)�G
�}vd�7S�M[T�,���8]��ܼY��������+�x
���8y�ܶ�W��j�S���֛
��.v_�ӫ�e�����3����G��k�^"�{)I��R�\�/���~Lt2���32�8�x�(M�[Z�R�K�D*�]��9�솯`\�J �Lr������<x�RѦ��dؖ8�oڦ��=�lV��$r�� �b>�S���w�y	ʺ~�_y<�@*{�k�Q�q���˪��������OČ?E�2Jי6q8s�;
AdQH_�}��[Y�)3�?:��*\��:D`�B���z������x9+e>C�y�k۶�'�i��ټ�����
�����Vc�1A�Gk4 ��=�0�j��k}�~�N�}Șs9�ן����
+endstream
+endobj
+1787 0 obj <<
+/Type /Page
+/Contents 1788 0 R
+/Resources 1786 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1686 0 R
+/Annots [ 1725 0 R 1726 0 R 1748 0 R 1749 0 R 1750 0 R 1751 0 R 1752 0 R 1753 0 R 1754 0 R 1755 0 R 1756 0 R 1757 0 R 1758 0 R 1759 0 R 1760 0 R 1790 0 R 1761 0 R 1762 0 R 1763 0 R 1764 0 R 1765 0 R 1766 0 R 1767 0 R 1768 0 R 1769 0 R 1770 0 R 1771 0 R 1772 0 R 1773 0 R 1792 0 R 1774 0 R 1775 0 R 1793 0 R 1776 0 R 1777 0 R 1778 0 R 1779 0 R 1780 0 R 1781 0 R 1782 0 R 1785 0 R ]
+>> endobj
+1725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 354.811 718.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+1726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.24) >>
+>> endobj
+1748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 673.751 399.264 684.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+1749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 663.699 513.996 672.675]
+/A << /S /GoTo /D (subsection.10.25) >>
+>> endobj
+1750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 639.411 333.043 650.291]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+1751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 629.359 513.996 638.335]
+/A << /S /GoTo /D (subsection.10.26) >>
+>> endobj
+1752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 605.071 439.967 615.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator) >>
+>> endobj
+1753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 606.974 513.996 615.951]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+1754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 582.687 374.756 593.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+1755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 584.589 513.996 593.566]
+/A << /S /GoTo /D (subsection.10.28) >>
+>> endobj
+1756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 560.302 381.003 571.181]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+1757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 550.249 513.996 559.226]
+/A << /S /GoTo /D (subsection.10.29) >>
+>> endobj
+1758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 525.962 461.061 536.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) >>
+>> endobj
+1759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 527.864 513.996 536.841]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+1760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 503.577 513.996 514.456]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+1790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 492.364 173.262 502.501]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+1761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 481.569 513.996 490.545]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+1762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 457.281 273.666 468.161]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+1763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 447.229 513.996 456.205]
+/A << /S /GoTo /D (subsection.10.32) >>
+>> endobj
+1764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 422.941 309.083 433.821]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+1765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 412.889 513.996 421.865]
+/A << /S /GoTo /D (subsection.10.33) >>
+>> endobj
+1766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 388.601 373.82 399.481]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+1767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 378.549 513.996 387.525]
+/A << /S /GoTo /D (subsection.10.34) >>
+>> endobj
+1768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 354.261 376.057 365.14]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction) >>
+>> endobj
+1769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 344.329 513.996 353.185]
+/A << /S /GoTo /D (subsection.10.35) >>
+>> endobj
+1770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 319.921 326.234 330.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+1771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.053 296.011 243.251 306.89]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+1772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 297.914 513.996 306.89]
+/A << /S /GoTo /D (subsection.10.36) >>
+>> endobj
+1773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 273.626 513.996 284.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+1792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 262.413 173.262 272.55]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+1774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 251.738 513.996 260.595]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+1775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 227.331 513.996 238.21]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+1793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 216.118 167.175 226.255]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+1776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 205.323 513.996 214.3]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+1777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 181.036 350.414 191.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Domain__Product) >>
+>> endobj
+1778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 159.028 513.996 168.004]
+/A << /S /GoTo /D (subsection.10.39) >>
+>> endobj
+1779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 134.74 402.532 145.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+1780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 124.688 513.996 133.664]
+/A << /S /GoTo /D (subsection.10.40) >>
+>> endobj
+1781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 100.4 352.814 111.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList) >>
+>> endobj
+1782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+1785 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1789 0 obj <<
+/D [1787 0 R /XYZ 89 770.89 null]
+>> endobj
+1786 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F113 1791 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1851 0 obj <<
+/Length 1472      
+/Filter /FlateDecode
+>>
+stream
+x��XYs�6~ׯ�[����
�Ng
�N�:�+�7á$HℇBRI�_��&EKr��y"	,�ߞXl,
l��
N.]fp�
�����Z
�|͌;ӡÏ��s<D�?����ގ/ގo���b<�< ��
������xp�3X~m`ĸg|-�bâ
��q;�k��(�O�.[h����%�BV\B!J��!�f�Ł3��L��R̲��'Y�mNO��U$b�A�����u��U!��H3���%0kN�6GԲ+�U$
A��"������J�*E;�F�a�q]cJq�V��
G���4
+�\���!��Tj�%���B-�ZM5R���O�l&f�+�s-Ij�nD<�2�%�~+����P�<�@�\F)�#Y��0)��4ɋ )Z�
t���).���1��T_�9Q��7��s�]�x��yv@�%���]Wu�
��Uo|�SC
+�EG&=�=�s9G�mۼ
r��-�����<��f�ؒ�k5�"F�]V�ȱhEpy�_%�e�E�x�Z�f%^ :�J�K�q
�0�,N��
F��̱&mC����F��H�o�wY0�D�^P�,��� x�|k�}��z���Z��_�<�3�I^�f�����3�T>�9�;�j�J�9�h���V�o�IU;A��Wd�Q��.��>������f����L�4i	\��N��9V�Y,����ug%S���Z�y�2DJ�&GȃDV��R'�QܘR-s����j�VZ辦�i��Zu;�!�g��"?�G����H����紪_&B�ol��m�{�V)w��Z%��4+ϸEAyv�$Z+��n�B�w �"W���sQ1�e\�z��
�����a��䭄�t{Z�:_	�� ,�1��!G��ʻ
q �I�N�n6T���"�m�+Z�,�N �W1T�����-W"r�@����οh���g��xS������q�<�}���Ȋ�1��دϸ�
���j\���ɴ�l1�n+�u�li�-p��W𔤾P��VP���
:L�
�'�C�C�wt
�*ȂXU���kh���z.��>��OR
jMʇ����#����:g [...]
+l|9���|��a��L�vުpo|
+�Ym�����G�=��j1�"����Z�[FPF��i���2�fbg�8�
맲�:��de�y�� p�h4����ku�;o
�w�
�jr��n[�Y:�^7�O:��6h�ߒt�E.e����h������ #L\���������pr3���5�F�o�0,��6�mu
K�v�rd�iڝ�1�ˇ\d��˯�7A�V#�6�"�0$m5f�EH5�Lx�G�p��η�*�J�O��ʼcߗ��������(V�''��"�MӸ��Z
+�i�[O��UY��LT�1�F"��
��Hq�
+endstream
+endobj
+1850 0 obj <<
+/Type /Page
+/Contents 1851 0 R
+/Resources 1849 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1686 0 R
+/Annots [ 1783 0 R 1784 0 R 1809 0 R 1810 0 R 1811 0 R 1812 0 R 1813 0 R 1814 0 R 1815 0 R 1816 0 R 1817 0 R 1818 0 R 1819 0 R 1820 0 R 1821 0 R 1822 0 R 1823 0 R 1824 0 R 1825 0 R 1826 0 R 1827 0 R 1828 0 R 1829 0 R 1830 0 R 1831 0 R 1832 0 R 1833 0 R 1834 0 R 1835 0 R 1836 0 R 1837 0 R 1838 0 R 1853 0 R 1839 0 R 1840 0 R 1841 0 R 1842 0 R 1843 0 R 1844 0 R 1845 0 R 1848 0 R ]
+>> endobj
+1783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 391.539 718.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+1784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+1809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 673.751 334.358 684.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
+>> endobj
+1810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 663.699 513.996 672.675]
+/A << /S /GoTo /D (subsection.10.43) >>
+>> endobj
+1811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 639.411 426.867 650.291]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant__Common) >>
+>> endobj
+1812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 629.359 513.996 638.335]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+1813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 605.071 492.37 615.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+1814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [118.619 595.019 135.556 603.995]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+1815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 570.731 403.972 581.61]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+1816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 536.888 513.996 545.745]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+1817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 512.481 271.993 523.36]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+1818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 502.429 513.996 511.405]
+/A << /S /GoTo /D (subsection.10.47) >>
+>> endobj
+1819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 478.141 307.409 489.02]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+1820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 468.089 513.996 477.065]
+/A << /S /GoTo /D (subsection.10.48) >>
+>> endobj
+1821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 443.801 372.146 454.68]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+1822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 433.749 513.996 442.725]
+/A << /S /GoTo /D (subsection.10.49) >>
+>> endobj
+1823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 409.461 286.936 420.34]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+1824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 399.409 513.996 408.385]
+/A << /S /GoTo /D (subsection.10.50) >>
+>> endobj
+1825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 375.121 248.212 386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+1826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 365.068 513.996 374.045]
+/A << /S /GoTo /D (subsection.10.51) >>
+>> endobj
+1827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 340.781 298.005 351.66]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+1828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.941 328.826 289.417 339.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+1829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 330.728 513.996 339.705]
+/A << /S /GoTo /D (subsection.10.52) >>
+>> endobj
+1830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 306.441 297.457 317.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+1831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 296.388 513.996 305.365]
+/A << /S /GoTo /D (subsection.10.53) >>
+>> endobj
+1832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 272.101 332.874 282.98]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+1833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 262.048 513.996 271.025]
+/A << /S /GoTo /D (subsection.10.54) >>
+>> endobj
+1834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 237.761 295.235 248.64]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+1835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 227.708 513.996 236.685]
+/A << /S /GoTo /D (subsection.10.55) >>
+>> endobj
+1836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 203.421 387.578 214.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+1837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 193.368 513.996 202.344]
+/A << /S /GoTo /D (subsection.10.56) >>
+>> endobj
+1838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 169.08 513.996 179.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) >>
+>> endobj
+1853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 158.758 127.862 166.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) >>
+>> endobj
+1839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.472 145.17 197.891 156.049]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+1840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 147.073 513.996 156.049]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+1841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 122.785 430.756 133.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function) >>
+>> endobj
+1842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.472 110.83 197.891 121.709]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+1843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 112.733 513.996 121.709]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+1844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 302.438 99.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant) >>
+>> endobj
+1845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.59) >>
+>> endobj
+1848 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1852 0 obj <<
+/D [1850 0 R /XYZ 89 770.89 null]
+>> endobj
+1849 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1908 0 obj <<
+/Length 1625      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~����d�ax�`��2�KR�񰇶0�����JJ���
��
+�����'I�!u�}�Jao�a��ѫ���L2/Da@oz�ؓ<D"���{�KD�c��QU����ER����
'
a&a�V8`���t:�4"0�=bH*o���}�^
ï=�X��/�P�q��zף?G�����,W.�o��'�##�D�Qj2&؏�,�M��Ez��q�.��2*��Z/t9;.��n��ț�
��*��)'Hp����h�(
��t
R�v��B�=+2�����m���
$Š{��P3�UTiC�|���
+�(�Cb�g��
�OsPN�����+3PU	�Z}��{�H@	�	�T~�3���.(��R��Q
��V2큒� �<Gw���<���B�/���s�\��
�D
$�(*�M�K��u�����2��9@
�Iz��,*
[�UtܸW����u�!����Q����;~3��%�J룣�j0·����-b6����܌�����Қlm����L�ue�+�X���
��Fq}�')D8����"�uT�N��oF�V����\��
�P1�`����3��>�!R���=k�(Pl��ő�`�
��N���KR/�p9R��{��<i�p�D��gL�����lҚEq
2ذ.���s���X`�3f�_�Q�%�†�G��5y���p(wi���d
��!�����|aŁ�
7|��"�.SK��	�Mf�
f���J�h+)pG����s��� ��0{��;���|

3� �D;������C6>�r?&uu������!��Լ����r���l���>< 	���	���"�km���!_��-�d�ved�q#k5���+̵��;�;:J[�~F�vW����iy7��FDZ��T� Bou
:����
oN�-LNh_T!HQ2���H��?O�I���!�>�u�aǖGv��P��e���I'��6�]Zi0��"{z�BI���o�`�E�z��������[���ƒ��}
&H�Nб�N[�NN�J8�g�SD}��F���ʘTa�����d�r�#�?;��S [...]
+C1Л��0�q��r���:��W��U��H��A�f��ɑm��y$�� ���1�g+��u�����@�Q=_�Ţ!&�<n�����%
J�+c�i��v�,��	���0�X@���r�Q��l�vbv���m�
SW4�L�W�ٍ�cG:4.w��
}N���Gw��Ӌ��.h�c��|]�H=�Q��0�?�u^�F�ǔ�2�7-�`����ˀ��~ʦ�>��r���.c��*o�>�ť	����Y�s�,�S�U�h��#Zek�]�Ѧ��D�#��C	�pe�:����	�B����O���Ԥ�N��A
�g�=m��� I��C�� {
+BP���*.�U'�O&��J��4�6#\F����#���]n
� �*�j�55&���#�(��sw4Q<P�H(q�:z.�zutxxs� �h^d�p���a�Ν�.>fE���߶�,��o6����"�C �4���HI[����K7�
�g�;) ���� �� [
+endstream
+endobj
+1907 0 obj <<
+/Type /Page
+/Contents 1908 0 R
+/Resources 1906 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1686 0 R
+/Annots [ 1846 0 R 1847 0 R 1869 0 R 1870 0 R 1871 0 R 1872 0 R 1873 0 R 1874 0 R 1875 0 R 1876 0 R 1877 0 R 1878 0 R 1879 0 R 1910 0 R 1880 0 R 1881 0 R 1882 0 R 1883 0 R 1884 0 R 1885 0 R 1886 0 R 1887 0 R 1888 0 R 1889 0 R 1911 0 R 1890 0 R 1891 0 R 1892 0 R 1893 0 R 1894 0 R 1895 0 R 1896 0 R 1897 0 R 1898 0 R 1899 0 R 1900 0 R 1901 0 R 1902 0 R 1905 0 R ]
+>> endobj
+1846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 394.946 718.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant__Common) >>
+>> endobj
+1847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.60) >>
+>> endobj
+1869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 673.048 346.847 683.927]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+1870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 662.996 513.996 671.972]
+/A << /S /GoTo /D (subsection.10.61) >>
+>> endobj
+1871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 638.005 305.925 648.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+1872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 627.953 513.996 636.929]
+/A << /S /GoTo /D (subsection.10.62) >>
+>> endobj
+1873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 602.962 308.366 613.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+1874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 592.909 513.996 601.886]
+/A << /S /GoTo /D (subsection.10.63) >>
+>> endobj
+1875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 567.918 312.705 578.797]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+1876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 557.866 513.996 566.842]
+/A << /S /GoTo /D (subsection.10.64) >>
+>> endobj
+1877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 532.875 288.421 543.754]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+1878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 522.823 513.996 531.799]
+/A << /S /GoTo /D (subsection.10.65) >>
+>> endobj
+1879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 497.832 513.996 508.711]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+1910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 486.619 179.349 496.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+1880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 475.824 513.996 484.801]
+/A << /S /GoTo /D (subsection.10.66) >>
+>> endobj
+1881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 450.833 303.176 461.712]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+1882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 440.781 513.996 449.757]
+/A << /S /GoTo /D (subsection.10.67) >>
+>> endobj
+1883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 415.79 384.918 426.669]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) >>
+>> endobj
+1884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 405.738 513.996 414.714]
+/A << /S /GoTo /D (subsection.10.68) >>
+>> endobj
+1885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 380.747 338.419 391.626]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
+>> endobj
+1886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 370.694 513.996 379.671]
+/A << /S /GoTo /D (subsection.10.69) >>
+>> endobj
+1887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 345.703 329.582 356.583]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+1888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 335.651 513.996 344.627]
+/A << /S /GoTo /D (subsection.10.70) >>
+>> endobj
+1889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 310.66 513.996 321.539]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+1911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 299.447 173.262 309.584]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+1890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 288.653 513.996 297.629]
+/A << /S /GoTo /D (subsection.10.71) >>
+>> endobj
+1891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 263.662 407.868 274.541]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+1892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 253.609 513.996 262.586]
+/A << /S /GoTo /D (subsection.10.72) >>
+>> endobj
+1893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 228.618 490.068 239.497]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
+>> endobj
+1894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 218.686 513.996 227.542]
+/A << /S /GoTo /D (subsection.10.73) >>
+>> endobj
+1895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 193.575 454.173 204.454]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List) >>
+>> endobj
+1896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 183.523 513.996 192.499]
+/A << /S /GoTo /D (subsection.10.74) >>
+>> endobj
+1897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 158.532 311.853 169.411]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+1898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 148.599 513.996 157.456]
+/A << /S /GoTo /D (subsection.10.75) >>
+>> endobj
+1899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 123.488 285.103 134.368]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+1900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 113.436 513.996 122.412]
+/A << /S /GoTo /D (subsection.10.76) >>
+>> endobj
+1901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 311.315 99.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+1902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.77) >>
+>> endobj
+1905 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1909 0 obj <<
+/D [1907 0 R /XYZ 89 770.89 null]
+>> endobj
+1906 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1963 0 obj <<
+/Length 1625      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~ׯ�[��
+����ә$�[�i�FJ��d40	Kly�G
��.	�eIfҎ�D�b�������/����ٕC-y������0q_�u3l�i�ڢ�E���}������b^ύ.��#S�"z?G�k�����~maD=׺o��)<#k>�c�
+��5�|e���,�
qA�h�f��2��r6��8�
�*���Mx�����|v=[.&�⎕Z�M��
m�<Ƭ)��8�t_L�6��^ܼ�w�Y�� �/EUe�&fޜc�ؕʺ��
N3J{\<
0h�mD]>�f8L�B�fM��^�0P�pv`nP�1Fjt��^��d�v�l~��G�A
;�{��yl0!����:���Ӥ(��ߠ
€L�P�*0�23�ٛ���@i,a�a-��	��RK���U�,߫H6�=i�
H��̶f�V��J��b����d��hp��8�s�1��������JT.�4?�� \ 6��lq>
�[Y�7?�E�_�&6���5L
��P_�@�#1�v`!�� 

kD`���a�b
	�
iDp�`�!��}�U5�Ԅp��h;�
3Gǃl�(��W����u�U��4[�ն
�:.��*�c��2Q�"t�j�"�P%x�X���eZ%H�놇L�3'�o��O�ӆ��Ty�^�=
;h@
�E���}�UQ�N)��S��T�����l�I�e:�dy�P�lR�*}5�z�!ǘ��%�F at sx�E�iS_bä�:k�/�b�X��.��
T��)���L|U􋴴Z�1�����}X�Ӫl����0Y������_?&�V28�i�P�]F�s46���k���L�R�A ?&��)ʘ�<2��� ?j.�=�(A�=�6
�0e}�/�a�(�����b�~*�e�@�����m:��
Jkrâ�M\:�'�q,��Q���gP�-� �����ͺs0�u'N��U���R�9k;k{����̘aq�EA�q���F�W����f�Z�خ�\��,��F��@��I�G- �M�Mu
�FKU�_ZL?�B�?�q��0�0h�9��k��:���_�Dz��*��0;�ۃ�P_FȰ,�w͎�C�=F|�k~��ۜx_
���+8�UEE��׺���+t�-
�.�B�H�i���y'ՙ���6p��NZ�ۿ��
O��/��覠8r�é7��F��8�T���iq��;�}05�a<���P3���:,
�H�'�2	�*�r�,-�2�TQǚS�����;n�ӡ�!���wY���*i��ƪڽ�,���~�-l�Du�kd��	��F�
B�
�,_�q�?�Q9
�"5
�lla����u

z�(4h����O�w�^yX�'Tޟ�pX|4
��&��fb�*\;��aUd�?z΁�g��J2�EL
7�^��DM�(E�n��OK�'�5����c��a
��ör��v�u1c��6��l6rl:�g��Fh|�����<�DZ����f��cήcj]�@lCn
+��͏*�-pL�5��
ڿ��j����a���ġ�eRIs��s����S���"Y�\�#h2�`W��?��ퟎ��j[��<91��JZ�ev~vv[� �����;���̭_Bw���i�%��Z�W�#
+�$r;
+endstream
+endobj
+1962 0 obj <<
+/Type /Page
+/Contents 1963 0 R
+/Resources 1961 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1686 0 R
+/Annots [ 1903 0 R 1904 0 R 1923 0 R 1924 0 R 1925 0 R 1926 0 R 1927 0 R 1928 0 R 1929 0 R 1930 0 R 1931 0 R 1932 0 R 1933 0 R 1934 0 R 1935 0 R 1936 0 R 1937 0 R 1938 0 R 1939 0 R 1940 0 R 1941 0 R 1965 0 R 1942 0 R 1943 0 R 1944 0 R 1945 0 R 1946 0 R 1947 0 R 1948 0 R 1949 0 R 1950 0 R 1951 0 R 1952 0 R 1953 0 R 1954 0 R 1955 0 R 1966 0 R 1956 0 R 1957 0 R 1960 0 R ]
+>> endobj
+1903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 294.877 718.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+1904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.78) >>
+>> endobj
+1923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 673.751 350.643 684.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+1924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 663.699 513.996 672.675]
+/A << /S /GoTo /D (subsection.10.79) >>
+>> endobj
+1925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 639.411 310 650.291]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+1926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 629.359 513.996 638.335]
+/A << /S /GoTo /D (subsection.10.80) >>
+>> endobj
+1927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 605.071 310 615.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+1928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 595.019 513.996 603.995]
+/A << /S /GoTo /D (subsection.10.81) >>
+>> endobj
+1929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 570.731 276.615 581.61]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+1930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 560.679 513.996 569.655]
+/A << /S /GoTo /D (subsection.10.82) >>
+>> endobj
+1931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 536.391 293.826 547.27]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+1932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 526.339 513.996 535.315]
+/A << /S /GoTo /D (subsection.10.83) >>
+>> endobj
+1933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 502.051 289.158 512.93]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+1934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 491.999 513.996 500.975]
+/A << /S /GoTo /D (subsection.10.84) >>
+>> endobj
+1935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 467.711 360.515 478.59]
+/A << /S /GoTo /D (structSelect__Temp__Boundary__Type) >>
+>> endobj
+1936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 445.704 513.996 454.68]
+/A << /S /GoTo /D (subsection.10.85) >>
+>> endobj
+1937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 421.416 402.896 432.295]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) >>
+>> endobj
+1938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 411.364 513.996 420.34]
+/A << /S /GoTo /D (subsection.10.86) >>
+>> endobj
+1939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 387.076 354.478 397.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction) >>
+>> endobj
+1940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 377.024 513.996 386]
+/A << /S /GoTo /D (subsection.10.87) >>
+>> endobj
+1941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 352.736 513.996 363.615]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+1965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 342.414 127.862 350.166]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+1942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 330.728 513.996 339.705]
+/A << /S /GoTo /D (subsection.10.88) >>
+>> endobj
+1943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 306.441 358.443 317.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Threshold__Watcher) >>
+>> endobj
+1944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 296.388 513.996 305.365]
+/A << /S /GoTo /D (subsection.10.89) >>
+>> endobj
+1945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 272.101 273.945 282.98]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
+>> endobj
+1946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 262.048 513.996 271.025]
+/A << /S /GoTo /D (subsection.10.90) >>
+>> endobj
+1947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 237.761 374.109 248.64]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
+>> endobj
+1948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 227.708 513.996 236.685]
+/A << /S /GoTo /D (subsection.10.91) >>
+>> endobj
+1949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 203.421 299.669 214.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator) >>
+>> endobj
+1950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 193.368 513.996 202.344]
+/A << /S /GoTo /D (subsection.10.92) >>
+>> endobj
+1951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 169.08 392.177 179.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common) >>
+>> endobj
+1952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 159.028 513.996 168.004]
+/A << /S /GoTo /D (subsection.10.93) >>
+>> endobj
+1953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 134.74 263.893 145.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+1954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 124.688 513.996 133.664]
+/A << /S /GoTo /D (subsection.10.94) >>
+>> endobj
+1955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 100.4 513.996 111.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+1966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 89.187 173.262 99.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+1956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.279 76.49 199.435 87.369]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+1957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.95) >>
+>> endobj
+1960 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1964 0 obj <<
+/D [1962 0 R /XYZ 89 770.89 null]
+>> endobj
+1961 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2002 0 obj <<
+/Length 1426      
+/Filter /FlateDecode
+>>
+stream
+x��X�n�8}�W�Z�$%�b,hҦH7m������"1����H���ER��Isq�<�F
gΜ
[
[z���(p�E>��хa+�"�|xJ�3;t��a�S�63��ߕI��B�"+
��b�����s��~Ի���-�l1�V���~b+��-��(���A��Q�3�[��
�nݼJs�D����q�=D�M@"D9�l�U
�O
��r����'�yW���Q���3^��q�a����"ϳ�`2bL�|[(j��5��>��P3*��Ի�H�5����H��>�<׷�7f�=�v�R�qtϠ�u|f�"����
� ����r^�
��݀@@�f@�2y+/ }���Oe��4��VߍP�i�>���h�E��M�F�N��4FXS#DD�>|�Z>��I;�
A��������1����k���C��m���R���wY>��Y�0�!s�͜~4�S�:�^��ReB��M]!"�ܽ	Ȇ�.E>��ӟ��s���­���-�"����R�ɧ�>�
c��
+X�~|z���_�_漊EY�wV	�Y!��{�O���(0�!BuK{;�������N	�Ѻ��2�(Ǖ�v���ƴ�N_i�h��
+L������sqݽ���u�E\�*�����A�E7Y�8����,���.�f�@��!�t�'�M��B�,��k��9����S��Iľ0�|
WO� +��6WE�fI,4()o+-+&[h�Rĺ�K�N^u�
�
��Ƨ2k4�J�2��]����j�IS�������ݵ��|�
���x!������y����X6�=��%֚m�^
N�����H�)�\Z
���I"�.��#�!������;���r}3�χ��'�� ۉ��^�_H��"���,� ��N��_8$�eE'(����)O~I��t���ϕ��B��'A�?#Yao:-�)~��u��%�C
��])-3��U���
+��T�,�ޒ�]3��s�-�ʜ�P�������*}!;+�mGϽ��Fꞥ�)�

��>Ea��
@���5i�X�,i�R�Ԃ�H�aq�-MW+k��1����|Rk*4�,F����_��S|=� �ۺG�����f�Z��v���RCb�#��&�eb��%M����������kH�Rzc�A����Ջ�}YO����
�0��t�o�&`t'd��[gr.:�Ym��P��g/�I��"y��f�T�2��=�3}P^�Z�X�0���yf����N

+����en��W.�Խ��o{�
n��&� 1�y(��i���,e�^>�Ec����B�ūծ� +L�r�.p�7
Q�����_򀙭�C���[�Ḃ��y3�y1AI��$�Z,�_�ɋN���BJ��t��t�%��>5h ��=y��
�~�~4?���ܵޕ ���z�
+endstream
+endobj
+2001 0 obj <<
+/Type /Page
+/Contents 2002 0 R
+/Resources 2000 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2007 0 R
+/Annots [ 1958 0 R 1959 0 R 1981 0 R 1982 0 R 1983 0 R 1984 0 R 1985 0 R 1986 0 R 1987 0 R 1988 0 R 1989 0 R 1990 0 R 1991 0 R 1992 0 R 1993 0 R 1994 0 R 1995 0 R 1996 0 R 1997 0 R 1999 0 R ]
+>> endobj
+1958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 286.03 718.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+1959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.96) >>
+>> endobj
+1981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 674.128 270.807 685.007]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog) >>
+>> endobj
+1982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 664.075 513.996 673.052]
+/A << /S /GoTo /D (subsection.10.97) >>
+>> endobj
+1983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.107 512.362 327.956 523.266]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators) >>
+>> endobj
+1984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.107 484.103 173.725 495.007]
+/A << /S /GoTo /D (namespacestd) >>
+>> endobj
+1985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 413.444 282.038 424.348]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+1986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 385.185 326.869 396.089]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare) >>
+>> endobj
+1987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 356.926 291.652 367.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
+>> endobj
+1988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 328.666 309.565 339.57]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+1989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 300.407 328.39 311.311]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+1990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 272.148 377.356 283.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+1991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 243.889 360.28 254.793]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+1992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 215.629 324.1 226.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+1993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 187.37 290.357 198.274]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+1994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 159.111 288.673 170.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+1995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 130.852 311.916 141.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+1996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 102.592 296.982 113.496]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+1997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 74.333 302.527 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+1999 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2003 0 obj <<
+/D [2001 0 R /XYZ 89 770.89 null]
+>> endobj
+110 0 obj <<
+/D [2001 0 R /XYZ 90 647.068 null]
+>> endobj
+2004 0 obj <<
+/D [2001 0 R /XYZ 90 614.83 null]
+>> endobj
+114 0 obj <<
+/D [2001 0 R /XYZ 90 614.83 null]
+>> endobj
+2005 0 obj <<
+/D [2001 0 R /XYZ 90 529.54 null]
+>> endobj
+2006 0 obj <<
+/D [2001 0 R /XYZ 90 432.535 null]
+>> endobj
+2000 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2038 0 obj <<
+/Length 1160      
+/Filter /FlateDecode
+>>
+stream
+x��Y�r�6}�W��La���t�K�8�
�R_bg8	K����v���FI�
��K�� \


�{A at kbA먳7��}b� �g�.�Z��o�u��<���E� ���T��������P~�|
u~t��-�����8��V"�?[�0�nT��r0ϙ5��Ձ��SA

+�<GBC80�|� BǮ��.��Ee
+,feIy:���(Y�~IˢW��Kt��v�8���eqE�Ɍ���5�H�Ѓ+�0���
" A���n��u�s�
���� ��Cәj"!
䈔g4��)K8���cN����~���i^E�۲bYc���_
�.�a� ���T��4T��1^�
�7&!RP��b�V5'�����pH����53ot�m_@~�򘽉��Xm&`g���yq[�u�*�EglF���_K�h��t��5FU͘U7��
����ݺ
͓F��k��X�ŵ�M7�"��-�'���R�>��j�b#
+ۼ����Qu��Ӓ�9��������mG��ư�s�H	�=ܜ
�/Ƴ�����g�`�\[�bȹ�.��9�\���h}�f�P����0�?J��ٗG<M����b�w��%��!'ݞ��
D�)�3i�(�K
(p��/�t�Tv��{l�BP7��9
�P ����ḸʓzC&饍��%��_�Fqj^�;�n��m�m��x��V��=��WtR�t�K�a��8���0�A�ݟ����r/W۶S�����
��3V�4���ĽOg� ����
qL+���k�a��2A��_qc�f2V�4<]�I�/�,��]?��f	����;�R�l-T�3��N��ͱ�e�pz��P��?���-�┟\��1�N�' D�&�$�[
 s�q��1G0za�'�o���s&�/�صPl��Dt
Z�YU�`9-�_y
M�����Il���yo-ʇה`��k�b�\b�4x�5�oޟ��խ�?��! O?>am^���XO�
���Ůtt|���G�|��� [...]
+ali�'����ͮ�`�f�s��z�f`

����%�ٮ�5r;��U}����\0�˅�@s��P�G�X�����?
�ʋpw��,�nZU�~|5)Y>q����s�<J-��L*�Ee���6E-�_uP�
+endstream
+endobj
+2037 0 obj <<
+/Type /Page
+/Contents 2038 0 R
+/Resources 2036 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2007 0 R
+/Annots [ 1998 0 R 2010 0 R 2011 0 R 2012 0 R 2013 0 R 2014 0 R 2015 0 R 2016 0 R 2017 0 R 2018 0 R 2019 0 R 2020 0 R 2021 0 R 2022 0 R 2023 0 R 2024 0 R 2025 0 R 2026 0 R 2027 0 R 2028 0 R 2029 0 R 2030 0 R 2031 0 R 2032 0 R 2035 0 R ]
+>> endobj
+1998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 694.851 324.677 705.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+2010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 666.645 384.442 677.549]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+2011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 638.44 331.303 649.344]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+2012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 610.235 391.626 621.139]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+2013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 582.029 327.447 592.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+2014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 553.824 322.994 564.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+2015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 525.619 382.759 536.523]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+2016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 497.413 327.437 508.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+2017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 469.208 294.78 480.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+2018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 441.003 305.301 451.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+2019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 412.797 346.237 423.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+2020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 384.592 267.104 395.496]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+2021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 356.387 318.577 367.291]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+2022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 328.181 306.407 339.085]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 299.976 345.685 310.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+2024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 271.771 301.983 282.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+2025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 243.565 331.861 254.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+2026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 215.36 312.483 226.264]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+2027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 187.155 313.589 198.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+2028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.544 172.379 273.474 182.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+2029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 158.949 320.793 169.853]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+2030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 130.744 371.159 141.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction) >>
+>> endobj
+2031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 102.539 389.978 113.442]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction) >>
+>> endobj
+2032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 74.333 396.603 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction) >>
+>> endobj
+2035 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2039 0 obj <<
+/D [2037 0 R /XYZ 89 770.89 null]
+>> endobj
+2036 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2065 0 obj <<
+/Length 1652      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�6~�W��f�(�ؖ��t��l�Ҥ�I���0
+�)جm���{dYܖ��&,;< K�|�}�cco�a�m��u��3O"�Ȼ�{{<�(������f�`���W��-b�\%��h{�>)t�W]s)8�~ě��?4�\7�4<{Į".��q�{=���aĤ�
ʛF^@����_
\	��_
+,O��Q`&T",<N"��|}�V��P�Us�5��O���qOW��]���	��ޤ[�ib�F��K{��O��	'i2�&:��Ӷk��v���T��'��Y��nQ���z-B��������$�b�;`�����-��&	}��T���w����y|��lz||u���Թ���dй�m=:���P"*BX���{˒�#�N��vקt�j� Aݭ�.mn����q� � I"�H�ë��0;x��H��H�kz ��`�;�z�)���ɬ�X
�S˫��V�uV��`|z���U�� ڑg:"�*�c��.uo��9Ai�b�!�
u�Y�R� ��pw�!&��Dz�
b�lc��Wo���x�v�3$�k���L����t<֙�v�v��6�i��.r�9r�N�W����F՚qqg[���*;�@`�&�m���O�&�
���Y�A�_>��*w�}˜&���e�<�
�=c$Ci�|�Z�R|^Q��\Aڤ���3�|�>q�"Q�ؙ����E$,�L��E�1;OAp���:���E������U�n
���^�=W&Щ!�(���j��x���;�C�J�]�;���e,
�lm㑣o����NT^tΆ�*�L��y�����$�38�DO�F��v��'�{�
jعn
+�O��@`��ȗ�|��r�.8�A�;�;�
�ξv����W':�����-�IE��:�.
B66(��� @ְ�Z�܎Q!��b�`@6`�b���`�b���f�o��ѳX����rpYG-}6j��
��<�OƧ%�V	9T-`�Ք*&��
5��~D$7��Tn�#Dݓ]
�k�,�5��oP����*^!�j�-b��0,d�aM(��&��87�-���bB8�T>�>#��
�0�C6c��F���d5���UJ��Jp1�xw��(�2nĄ�ƱK��_��3G;a�ˬ�X}@ �]�o�6�}�8��Ɔ��8ߖqZY�1������!�Vo����B��F/���q��Ŗ	��4�c�&	
+س��V
$��jm9��E��3���R31���ܦ����r�

r��PU|�W��y�ӕ>�iC��g�
C�p�<���k8>.�)
ЏL�zh˲�
�V����Fɵ	��!�j���ĕ��J�
+�B�9�����J'���̔fw���cs�Yxb�^{M{jM*�{���O��w��y��'�b\ڒΖ*�y)����ȹ��f+C}>DmU� }����:':+b��&iS
�U��I���PU�9-U��ީ�S\+H����
Z����6"�8
u6�`��06;��8
+��
�Y��c��������B%�'
�{�9���%8{�W0F
�@9��ۋ�_ϵ~7����c̿j�+������d��d����k��"�חf/�Gi�]�������N�QD
 ��s�}- ��v9�&V
G�G�;M��w1�A�
�
+endstream
+endobj
+2064 0 obj <<
+/Type /Page
+/Contents 2065 0 R
+/Resources 2063 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2007 0 R
+/Annots [ 2033 0 R 2034 0 R 2040 0 R 2041 0 R 2042 0 R 2043 0 R 2044 0 R 2045 0 R 2067 0 R 2046 0 R 2068 0 R 2047 0 R 2069 0 R 2048 0 R 2049 0 R 2070 0 R 2050 0 R 2071 0 R 2051 0 R 2072 0 R 2052 0 R 2073 0 R 2053 0 R 2074 0 R 2054 0 R 2055 0 R 2056 0 R 2057 0 R 2058 0 R 2059 0 R 2062 0 R ]
+>> endobj
+2033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 695.032 416.529 705.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) >>
+>> endobj
+2034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 667.189 356.763 678.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
+>> endobj
+2040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 639.346 419.706 650.25]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+2041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 611.503 341.819 622.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+2042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 585.95 160.373 595.855]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+2043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 572.701 312.788 583.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+2044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 544.858 365.938 555.762]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+2045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.569 517.015 513.996 527.919]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+2067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 506.827 123.652 514.58]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+2046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.17 477.217 513.996 488.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+2068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 467.029 123.652 474.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+2047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.17 437.419 513.996 448.323]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+2069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 427.231 123.652 434.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+2048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.845 410.869 197.225 420.775]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+2049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.397 397.621 513.996 408.525]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+2070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 387.433 123.652 395.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+2050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.78 357.823 513.996 368.727]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+2071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 347.635 154.775 356.502]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+2051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.459 318.025 513.996 328.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+2072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 307.046 165.295 316.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+2052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.17 278.226 513.996 289.13]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+2073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 268.039 123.652 275.792]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+2053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.17 238.428 513.996 249.332]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+2074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 228.241 123.652 235.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+2054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 198.63 303.478 209.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+2055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 170.787 384.423 181.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+2056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 157.862 365.623 168.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+2057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 130.019 406.559 140.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+2058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 102.176 376.692 113.08]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) >>
+>> endobj
+2059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 74.333 357.315 85.237]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) >>
+>> endobj
+2062 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2066 0 obj <<
+/D [2064 0 R /XYZ 89 770.89 null]
+>> endobj
+2063 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2121 0 obj <<
+/Length 1359      
+/Filter /FlateDecode
+>>
+stream
+x��Y[s�H~�WP��U#i�7c0kƠQtj63E��ʎ�������=݀�`%��O�4�_���s����Un��US��Aa�)�#F�tNV�i�<��V�f�3��q���":�蘖aZ}�bX�
^!�O�˜�1c���
1�g'��'��1� B�`���
+JE�o�h��h �"�xA�ƨ<��|"G�Zd��A�,�nVE�����g鈟���z��0v�"$��G
�!�����-6j��)���x��Ĕ��� �,b�j2Bl��q��!\����
�C��Vy�uBϱ���e�'�c��Q�/��w�;���]_7o�xg��v����2�	z!�ޔ�����A>9A&�HC�Y�!k���ZJ�3	7A���]x��D@DN������||�2ݶ=4z�VǴ���^�����o�qB����Ӯ��F8���@�<'�<�
���
�s8i��Ɖ�����s�3�-�ɣ]L
���\�g���<57�U�cG��
]gG8v�ޚ�SF���i	#��a�&�
+@�Q�.k�
	|P�4
6���R�R�	c�q؉p���'�<� h�X/����8�|gY�A�����T�h
��y��
���2�ڇs
�F"���3��q���)ǹh|���ƾ,�O�G�mf�7U����K���
g�hj܋�6V 9��$yr�W%��h��R��M3�
�e�Dpf�F���8�����d�\N=�ዝ�\���Τ&rn�΀�v�Rj��C1�����l�-��m�K׸��F ���:M��J:���u�=>�	���5��^���
��gA��
=7�5��ʮ<
:1�	e�
Q�{�p�Z�y��C�'):�������C�x�Z_��`?
����Q����6A��$'*�M�V�M�R=��N�ۓ��iT�cx�bx��x��F��
 ��yO���\�n[v�l^��K���n�d[v�=�
Zf���F�<���9���r܋P�\�ړׅ�<��S��ςY7��f4�p���=0?�{9n[C�w��95��ܭ�v����e<�`�G�b�

:��ROA��W���ܔO?SL�b��{޻rɇ�dv>��N�)~�X�m����!�
L�f����>��WI5�ߧ|O�!�V�� [� ��"w��r�U<<
�f�N����x\��|SȪ7't㹇cw��r�d~����ݡ�*�����Z(�����$?��@��
+��v���֤W-Odn ��� ���?O��آN�9I�Mw�4���A��_��̦�=8�*+d�"=�p���~
�w<W���gg�u"����ȿ&y[&q����4������h5��xƁ^����:�`���]ׂP?��f��
��s�0
+endstream
+endobj
+2120 0 obj <<
+/Type /Page
+/Contents 2121 0 R
+/Resources 2119 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2007 0 R
+/Annots [ 2060 0 R 2061 0 R 2075 0 R 2076 0 R 2077 0 R 2078 0 R 2079 0 R 2080 0 R 2081 0 R 2082 0 R 2083 0 R 2084 0 R 2085 0 R 2086 0 R 2127 0 R 2087 0 R 2088 0 R 2089 0 R 2090 0 R 2128 0 R 2091 0 R 2092 0 R 2093 0 R 2094 0 R 2129 0 R 2095 0 R 2096 0 R 2097 0 R 2130 0 R 2098 0 R 2099 0 R 2131 0 R 2100 0 R 2101 0 R 2102 0 R 2132 0 R 2103 0 R 2104 0 R 2105 0 R 2106 0 R 2133 0 R 2107 0 R 2108 0 R 2109 0 R 2134 0 R 2110 0 R 2111 0 R 2135 0 R 2118 0 R ]
+>> endobj
+2060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 694.121 358.42 705.025]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) >>
+>> endobj
+2061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.989 678.615 217.919 688.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+2075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 621.133 251.782 631.061]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gae19dfe022c51c874d905e2a7c81c18f1) >>
+>> endobj
+2076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 591.468 251.225 601.396]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga8458e58a5e857de11c35ce3076a70ab8) >>
+>> endobj
+2077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 561.802 264.505 571.73]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gabadfeba0a415d210cdd6d7309365e800) >>
+>> endobj
+2078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 532.137 244.032 542.065]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7a529f51bfebdd4b3e69c866dced9bc1) >>
+>> endobj
+2079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 490.536 213.038 501.44]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga79bd3696a302bb721ef8168fa5d650fb) >>
+>> endobj
+2080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 416.573 348.737 427.477]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+2081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 386.907 360.902 397.811]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+2082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.455 357.242 421.554 368.146]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+2083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 283.279 277.077 294.182]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 271.323 272.923 282.227]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a3d884f787b884a260970cdef004fcc10) >>
+>> endobj
+2085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.314 271.323 413.843 282.227]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a9f5dce9506b72773425c0504845d8e4e) >>
+>> endobj
+2086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.234 271.323 513.996 282.227]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) >>
+>> endobj
+2127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 259.368 145.791 270.272]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) >>
+>> endobj
+2087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.779 259.368 287.309 270.272]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3) >>
+>> endobj
+2088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 247.413 252.44 258.317]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ad5e386c6a05c9656eac42fe9e2cdd8b5) >>
+>> endobj
+2089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.31 247.413 393.734 258.317]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b) >>
+>> endobj
+2090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.604 247.413 513.996 258.317]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) >>
+>> endobj
+2128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 235.458 141.357 246.362]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) >>
+>> endobj
+2091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.346 235.458 288.963 246.362]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) >>
+>> endobj
+2092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 223.503 294.502 234.407]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8adeb9e65ceecfb8271acec22e00a226ca) >>
+>> endobj
+2093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.893 223.503 455.347 234.407]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4194f750c76fb24d6e5930e1696076c4) >>
+>> endobj
+2094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [457.738 223.503 513.996 234.407]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) >>
+>> endobj
+2129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 211.548 205.008 222.451]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) >>
+>> endobj
+2095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.997 211.548 422.899 222.451]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) >>
+>> endobj
+2096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 199.592 337.66 210.496]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) >>
+>> endobj
+2097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.608 199.592 513.996 210.496]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) >>
+>> endobj
+2130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 187.637 169.581 198.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) >>
+>> endobj
+2098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.992 187.637 388 198.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a02347568b111860e1ac15154a1832252) >>
+>> endobj
+2099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.411 187.637 513.996 198.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) >>
+>> endobj
+2131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 176.399 142.463 186.586]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) >>
+>> endobj
+2100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 163.727 308.898 174.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae0c660bfcbcd3d10c3e764e22f41d0a1) >>
+>> endobj
+2101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.289 163.727 485.235 174.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a057025d0ff550a2226a0a1273c84b4f6) >>
+>> endobj
+2102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.626 163.727 513.996 174.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) >>
+>> endobj
+2132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 151.772 277.496 162.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) >>
+>> endobj
+2103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.484 151.772 465.499 162.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a5912e00d1de38a643d48af1f0e5dd35f) >>
+>> endobj
+2104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 139.816 283.433 150.72]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) >>
+>> endobj
+2105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.824 139.816 485.235 150.72]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a930a62d56d7231cdb1ed57e1d3eff0f7) >>
+>> endobj
+2106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.626 139.816 513.996 150.72]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6) >>
+>> endobj
+2133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 127.861 275.294 138.765]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6) >>
+>> endobj
+2107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.283 127.861 457.768 138.765]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab) >>
+>> endobj
+2108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 115.906 290.078 126.81]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a261922c7bb53bf71459671df868e55da) >>
+>> endobj
+2109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.469 115.906 513.996 126.81]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) >>
+>> endobj
+2134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 103.951 156.859 114.855]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) >>
+>> endobj
+2110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.25 103.951 420.638 114.855]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a202263943c451b9fdfe003b2bc8d0b1f) >>
+>> endobj
+2111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.029 103.951 513.996 114.855]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
+>> endobj
+2135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 92.369 229.924 102.9]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
+>> endobj
+2118 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2122 0 obj <<
+/D [2120 0 R /XYZ 89 770.89 null]
+>> endobj
+2123 0 obj <<
+/D [2120 0 R /XYZ 90 640.036 null]
+>> endobj
+2124 0 obj <<
+/D [2120 0 R /XYZ 90 549.305 null]
+>> endobj
+2125 0 obj <<
+/D [2120 0 R /XYZ 90 434.454 null]
+>> endobj
+2126 0 obj <<
+/D [2120 0 R /XYZ 90 303.157 null]
+>> endobj
+2119 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2225 0 obj <<
+/Length 1572      
+/Filter /FlateDecode
+>>
+stream
+x��Y[w�8~���m�ӚH�ɛ㔖�kp�n��������n6g��J߱c;�O����M3#�L��4���EO��U%Nb�;F�,��(�	󵩰�Ն ����7�6'����ӹ?E�K�s���c�ȼܔ��w�}Cs?� R�"++�8j|��	
~� �W�W1)b��ϐq�d,2*�F!�X�WBB��7�
�j�-b�Q<��q�M:-�3�.�-(6�4�~>ܣI�{F0J����r���IO�n���'���VXAR�6�PE��n {hu��}k��4�ng�`����4�d����U �Ʋ�&9�=Fm�v=KӺZ� ��`
8�@�v��ft\ݶ6���4X=/z����J�PX��B�_m(��XZieN�&ئ�נq
$qF���i��G(��{�D�y�S�%��hs
+	
�1�|�{��W��S��ϑ��(Bq�
+D�<
�2��O���^j��v=��p��4��~9��)ȇ ���M�Jţ� ��$
+ at i�g^U��td��D�z�֕�Ev�9�(	���Îq��yI�M��
�s�u������
x�n�V�7��j��vqH � ^¼��M��&��ʃ|��Y	��\�$�����W
�
�w��������w
�Y��}L����m|�lS���ݵm�
��J2
��z�]��c}�wT�.UŁBUԜf�O����
�^j"�=˃(���b3��ʪ
q�I�������8
Z7�R\�u��fv>���ʻ�`���7˂QX��ɂ��H���
�W$QD��X4�J=���a��[�=����'��:�r�z�E(����P���)-� )	��Ҿ���Ro�L�R��S��8@�e8)�t�|��E
+��k�Q��=�<OL�r_U<�
��'B�7 ��ʼn�_�
��G�oU��k��a�z��N�9eB�D��ZO?L�/�_<A�\�v
���~/w<���:^�^^^�
+yS���n��z%^�ֆ�^�`��S�/�s�G�&xn���u���k�&����c�N�=]G�n�#{&����k���UKE�ݳ����jFɸ�}v5�{�P� pe5l��͉���6��ַ�Kd�������~���;�

��녯wV)uC��uH��Z�h^�����1O)t��z��N]���q���b~_���n�¯y�IŸ��a�
+
^�j�:����k-Be[�;��"�أa}E��]�`9��
���h�&�h�g�,'
ȣ`.�$��@������%(�~���f��-�Y�3�W�m����6�qge�ݽO˴��|X�X.z��@Z�YN��)M���9K��*��󓴗Ұ
�����$�=�X��8
��"��6
+h��ۢ�J����N�#�*�򤼯(�'�g6F��J2�
��吳z7,q�����
Ww���b�̊j�ܧ@�7��0C�-Ql�Fj�����7 ���ʞ��,ĩ���A����
T��2�7S�} w���Ȁ���}��./.F�)Nݧ,��z�]�
6u�ɒ�n�$-7�wE^�ye���J�"��$q�4�@`�P��b��{�ZX\��t,��+���:E�
+endstream
+endobj
+2224 0 obj <<
+/Type /Page
+/Contents 2225 0 R
+/Resources 2223 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2007 0 R
+/Annots [ 2112 0 R 2113 0 R 2114 0 R 2115 0 R 2227 0 R 2116 0 R 2117 0 R 2172 0 R 2173 0 R 2174 0 R 2228 0 R 2175 0 R 2176 0 R 2177 0 R 2178 0 R 2229 0 R 2179 0 R 2180 0 R 2181 0 R 2182 0 R 2183 0 R 2230 0 R 2184 0 R 2185 0 R 2231 0 R 2186 0 R 2187 0 R 2232 0 R 2188 0 R 2189 0 R 2190 0 R 2191 0 R 2192 0 R 2233 0 R 2193 0 R 2194 0 R 2195 0 R 2196 0 R 2234 0 R 2197 0 R 2198 0 R 2199 0 R 2235 0 R 2200 0 R 2201 0 R 2236 0 R 2202 0 R 2203 0 R 2204 0 R 2237 0 R 2205 0 R 2206 0 R 2207 0 R 2208  [...]
+>> endobj
+2112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 707.957 309.177 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 696.002 298.367 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2abeee33de6f8542b0228161d044640eaa) >>
+>> endobj
+2114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.758 696.002 466.964 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) >>
+>> endobj
+2115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [469.355 696.002 513.996 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) >>
+>> endobj
+2227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.047 234.328 694.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) >>
+>> endobj
+2116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.807 684.047 458.575 694.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aeafcc7ca16bda73dc6b0f7deaf9470dd) >>
+>> endobj
+2117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 672.092 356.489 682.996]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2ae0c0414fd69996a2edb8ea476ab236e1) >>
+>> endobj
+2172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.94 642.784 334.411 653.687]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+2173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.987 642.784 503.317 653.687]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+2174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [505.708 642.784 513.996 653.687]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+2228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 630.828 235.444 641.732]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+2175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 601.52 321.36 612.424]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+2176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 589.565 260.739 600.469]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) >>
+>> endobj
+2177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.883 589.565 433.858 600.469]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea556cc08f48e769b9c15bea83d5d883a1) >>
+>> endobj
+2178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.002 589.565 513.996 600.469]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416) >>
+>> endobj
+2229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 577.61 237.107 588.514]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416) >>
+>> endobj
+2179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.096 577.61 431.756 588.514]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea94cf20719046117aece5acba61dcae4d) >>
+>> endobj
+2180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 565.655 330.477 576.559]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab) >>
+>> endobj
+2181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.953 565.655 506.236 576.559]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea8191bdbdcd041a9859ed465d16062ab1) >>
+>> endobj
+2182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.169 524.392 324.718 535.295]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+2183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.751 524.392 513.996 535.295]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+2230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 512.436 185.083 523.34]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+2184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.474 512.436 412.349 523.34]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1ab39e3c667ce455313f8ff578722af2e9) >>
+>> endobj
+2185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.74 512.436 513.996 523.34]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+2231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 500.855 212.201 511.385]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+2186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.495 471.173 332.376 482.077]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+2187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.06 471.173 513.996 482.077]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) >>
+>> endobj
+2232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 459.218 130.289 470.122]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) >>
+>> endobj
+2188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.278 459.218 322.158 470.122]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
+>> endobj
+2189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 429.91 374.78 440.814]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+2190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 417.955 258.537 428.859]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) >>
+>> endobj
+2191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.047 417.955 410.655 428.859]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdac58a6ff6765224e937fefbadf45a4860) >>
+>> endobj
+2192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.166 417.955 513.996 428.859]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) >>
+>> endobj
+2233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 406 157.975 416.903]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) >>
+>> endobj
+2193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.963 406 310.571 416.903]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559) >>
+>> endobj
+2194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 394.044 268.499 404.948]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda9a59b7fa00c2cf8df942badc9c414aef) >>
+>> endobj
+2195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.94 380.387 409.44 391.29]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+2196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.015 380.387 513.996 391.29]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) >>
+>> endobj
+2234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 368.431 172.351 379.335]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) >>
+>> endobj
+2197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.34 368.431 408.513 379.335]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaf4462ec77078de4bbabb446cf61e5123) >>
+>> endobj
+2198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.315 354.774 388.279 365.678]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+2199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.604 354.774 513.996 365.678]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) >>
+>> endobj
+2235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 342.818 210.547 353.722]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) >>
+>> endobj
+2200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.938 342.818 443.333 353.722]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7869fdfe9b1ace668a0a7b1d2faba812) >>
+>> endobj
+2201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.724 342.818 513.996 353.722]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
+>> endobj
+2236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 330.863 274.746 341.767]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
+>> endobj
+2202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.94 317.205 310.78 328.109]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+2203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.355 317.205 462.53 328.109]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13a39adc66b0a3d8cae2a7dc2abc8885c69) >>
+>> endobj
+2204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.921 317.205 513.996 328.109]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+2237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 305.25 192.844 316.154]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+2205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 291.593 344.464 302.496]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
+>> endobj
+2206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 279.637 294.502 290.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) >>
+>> endobj
+2207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.893 279.637 486.889 290.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d) >>
+>> endobj
+2208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.28 279.637 513.996 290.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) >>
+>> endobj
+2238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 267.682 283.583 278.586]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) >>
+>> endobj
+2209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.572 267.682 469.923 278.586]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) >>
+>> endobj
+2210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 255.727 359.239 266.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fab25413bda9bbd45d2f22366d0e0ef831) >>
+>> endobj
+2211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.63 255.727 513.996 266.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) >>
+>> endobj
+2239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 243.772 135.27 254.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) >>
+>> endobj
+2212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.259 243.772 315.533 254.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa8d3ab7646117632841be76c043efc39b) >>
+>> endobj
+2213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.853 230.114 334.408 241.018]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
+>> endobj
+2214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.81 230.114 513.996 241.018]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) >>
+>> endobj
+2240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 218.159 193.402 229.063]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) >>
+>> endobj
+2215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.39 218.159 434.555 229.063]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a3b60d6dfe175b3a5d48361ac121f23ae) >>
+>> endobj
+2216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.777 188.851 338.649 199.755]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) >>
+>> endobj
+2217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.897 188.851 513.996 199.755]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) >>
+>> endobj
+2241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 176.896 202.806 187.8]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) >>
+>> endobj
+2218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.197 176.896 456.085 187.8]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) >>
+>> endobj
+2219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.476 176.896 513.996 187.8]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05) >>
+>> endobj
+2242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 164.941 284.708 175.844]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05) >>
+>> endobj
+2220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.892 91.817 469.663 102.721]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga00a906832c41c42a70a5c9d194e07a7d) >>
+>> endobj
+2222 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2226 0 obj <<
+/D [2224 0 R /XYZ 89 770.89 null]
+>> endobj
+2243 0 obj <<
+/D [2224 0 R /XYZ 90 111.517 null]
+>> endobj
+2223 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2330 0 obj <<
+/Length 1272      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�8~�_�SϞ9˒������K�N۴Mc߽$
��j������B��M78�x�'�]}�owYaccf`�M�Qgpj���\�Z�hj�ذ���w�qٵq���aZ"�J���OG'GC5�9un:��A�>G�cL���l������:��\(25�:7���
\@��r5T��K6���N��$
�8��)u�o�t!�A<��~

���I4�j�B��y�����Η"�wRa)��S
� 
1�1@Y&�8�(�k��e�c\��g�c���E.C9����2��d~{-�{g�X����(Y�g�|�i]i^a��}����k��-�uel�	E.%?	�218���C#�2��][��
b�)%��>q8r���wNq��\�y�s?M[�Bj3���{7!��s_es{�r�ғ���G�z�`nT�~Y�L��e����2��V���^&1
��b�~uܪ�oWx�8��47e㢾��cJ5�=A�Ŋb���؞�V{ʒ]_g=��fZ���S��<���sB��
�~|�=��ߔ���؝� ��ͣTf����Ĩ�I2o�6�Q��
������8�� �I��B"80�R��++;(�  ��C
+��(�{A�f2���t��diQ��z��v!ZoH�~���mK;U �
6�z0��a���P2�׳0~!{��_��>�:6r�Yt
�,��2-�o�;+ӭ�Q1V�Kh�5K�]Y�b?ڕ�ÓQ�Mn"n�R���f͵��,�Z*h�y�,���L�(���&�
+�}��/�m!�Z�"kh��'��v����i���=��~e����h�~�n�~o, � �t����MQ�i���V� ��co��a�}��
p�ꀯ0�p#uu�E�k�%F�r)_C�	��E!��W�-��
i���'m;��m�*9mjT�N@�i��
�mN���+*��+ڵ�/L�7�q6	�d����d�
)�0���Ւ�#����,�҅?/>1�Ϙ�kAP��
�����?F���OÝ�W�^{���KW�XF��~#�|b"����M�X��D�����AЪ4��B�t�f[��+ �d#r��a�6	�"�1
��h��|�"�����_Sd6�n�7�8�cb�4�����R�x0x��������^e0��"ŁH��>�s�\Z.��ot]����
��
+�[��n��?��ҟ���h�),�� ���QNB�U豇��F��}���W��uL6F̩�3q�e���`���"��Im'�J�u�����}[�>��0��Q~�C�����`
+endstream
+endobj
+2329 0 obj <<
+/Type /Page
+/Contents 2330 0 R
+/Resources 2328 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2007 0 R
+/Annots [ 2221 0 R 2299 0 R 2300 0 R 2301 0 R 2302 0 R 2303 0 R 2304 0 R 2305 0 R 2306 0 R 2307 0 R 2308 0 R 2309 0 R 2310 0 R 2311 0 R 2312 0 R 2313 0 R 2314 0 R 2315 0 R 2316 0 R 2317 0 R 2318 0 R 2319 0 R 2320 0 R 2321 0 R 2322 0 R 2323 0 R 2324 0 R 2327 0 R ]
+>> endobj
+2221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.865 685.323 295.886 696.227]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e) >>
+>> endobj
+2299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.865 672.068 290.903 684.023]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga266a81f442cf72bfded10a4ecb79f130) >>
+>> endobj
+2300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.865 659.481 291.253 670.385]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) >>
+>> endobj
+2301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.435 646.56 327.995 657.464]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) >>
+>> endobj
+2302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.609 633.639 351.237 644.543]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gac40e401b77b5ec6e9625c317ce6d760d) >>
+>> endobj
+2303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.865 620.718 336.841 631.622]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga13bf4cf2db045bfd362c5c8aae7f785b) >>
+>> endobj
+2304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.965 565.916 327.986 576.82]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga984f2c32e934b6510731f6a7faf28296) >>
+>> endobj
+2305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.965 552.661 323.002 564.616]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) >>
+>> endobj
+2306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.965 540.074 315.264 550.978]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae) >>
+>> endobj
+2307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.965 527.153 326.332 538.057]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) >>
+>> endobj
+2308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 514.232 297.301 525.136]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) >>
+>> endobj
+2309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 501.311 285.376 512.215]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) >>
+>> endobj
+2310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 488.39 300.868 499.294]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga809c78f95611c4b838b4e8f097a03e32) >>
+>> endobj
+2311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 475.469 321.341 486.373]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3ccd0ef2cbdc282106525b2f0e734c7e) >>
+>> endobj
+2312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 462.548 331.303 473.452]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e) >>
+>> endobj
+2313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 449.627 298.098 460.531]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) >>
+>> endobj
+2314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 436.706 303.637 447.61]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga34d9dfd53548ce172ae94462d24f41e6) >>
+>> endobj
+2315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 423.785 330.755 434.689]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) >>
+>> endobj
+2316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.172 410.864 403.801 421.768]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142) >>
+>> endobj
+2317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 344.107 331.323 355.011]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
+>> endobj
+2318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.98 319.231 343.151 330.135]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
+>> endobj
+2319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.703 282.4 383.562 293.304]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
+>> endobj
+2320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 245.569 391.338 256.473]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
+>> endobj
+2321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 208.737 380.628 219.641]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
+>> endobj
+2322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 171.906 390.59 182.81]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
+>> endobj
+2323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.432 135.075 408.754 145.979]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga60f87e33c0dde9f5c2c7d3b4b78818ab) >>
+>> endobj
+2324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 98.244 416.603 109.147]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga470bfc567789301bfdc28fd70ed82f92) >>
+>> endobj
+2327 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2331 0 obj <<
+/D [2329 0 R /XYZ 89 770.89 null]
+>> endobj
+2332 0 obj <<
+/D [2329 0 R /XYZ 90 702.224 null]
+>> endobj
+2333 0 obj <<
+/D [2329 0 R /XYZ 90 582.817 null]
+>> endobj
+2334 0 obj <<
+/D [2329 0 R /XYZ 90 372.964 null]
+>> endobj
+2328 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2370 0 obj <<
+/Length 1742      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~ׯ�3-5�`
Ad:���Nmǵռ$
%A2�TH*���8HQ���Mg��H ,v���%�7��w�y���̓H�4��ObO�zc�!��������n�r���tO��
e�*&�Hw#��/H�}�U����!�
���ʑ��Q�y�
{c~�a�d�}6�R/�
�g�E��v
+ⶢ!n)Jp�y�D�U�
��l^/3k��&BA(ၙ\�t>�+��d�5�
+Q=�g;cER�x$IWs�ũs���A�L�A��F�Ң^$P����$�v�0�g�$��b�<z~��������q�ƃ�|vu��E<8N�E\\=yؤIWI�
*UV���9�0ǣ<+��	���T<%��z֓=� �}��Ȼ�~@׽����o�����`�&y���BL���zZ4�]1aO@����C0|�L���D�B���I6
L��ນN7�<T�*�*/ܣt���ĿL�y[rl�)�
��gG[@�I7��
����y2���lv=��}r���y�i�m��s�;�c��b�&�Z�Y��;�\+��4���]G$��z,@
G
�n��
U��L�A:��W��d�m�
��Tl�F�Zy�K�p���@�Te��
v,���W��
׭�]��W���ERU�	L�?T��c��ʉ>��3nҮ
��kG_1�LF�lq6��}���|Q��l����U��I}���q���n6<J�a�0_8*��ѥm�a3�㸊mK�
+�O��$uH�ģB���P��N�6z$-����]�r
^�I0?��`e���
o�YDPĈ�$,��Z��%�j�TW+���҈�u-��������澔P��ClL	G!��<}����M�ˏ
�v5LEү�&�O�?���P���\�6�5�O&��p�]��m�1�D�]�
�C�A�
Bqr[��q_{㓣��/ɾ:|���)���d�
+٭���7�7>?xsdv6��{ �\����9����݁��
��!pԒ���f ���y�"ݼַ���ڧ�n�
+��lhP�����Ns)գ�R>V�e����	!�h�O��E�oج�ٷH�
�Mo2VY�8��v����Ҏ�e��`�c����8;p�
��C?6|c�>���'z��	0��R �Q at LM��ͮ�!����T��f<�-
�mn�Y��������Er8.�ҹ�b�zd��pĖ�?q�
���*�6p��z����t�@ph�C�eO�C�!�F����� ���n)���$ݩ���6f
w(!�JĚ�j�_T��m0DE�۹�9�F��*A�p�ݰ�'Kb�s��m5^�p7�U{��h 
����+;��D�@Cv��u�FD���z���]�V7��ꡆ՟���p-<\3y�b�
+�����a+�d���z|	�ؑ�V�52���S�Φ/@G�=3/���",�^Dn�W�)�Z��U�X�l5A�w�ȇZf�&��:XSuTm�e�ۋ|��Ɣ��H@���dpƀ$.�6��@�3Tײ� �g�{�`^Nl�p'�Ҽ�{��d%��U�ԑ�Șf��Q+S�N��5�WK�BAؕ Cs
���U��Z%Z�i��YH��춟��Oe�
0{^���o�?JU�ԅK�
7'q����u�0������� ��� k�U��W�~��]�CFA�k�.�j�d�����h��� �l�&�����i^�R�e ���%��Is�
p�G�L��fF�m
�
���Qʼ98y���o�n.
+endstream
+endobj
+2369 0 obj <<
+/Type /Page
+/Contents 2370 0 R
+/Resources 2368 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2380 0 R
+/Annots [ 2325 0 R 2326 0 R 2363 0 R 2364 0 R 2365 0 R 2366 0 R 2367 0 R ]
+>> endobj
+2325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 696.002 329.111 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) >>
+>> endobj
+2326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 670.067 338.476 680.971]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d) >>
+>> endobj
+2363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 632.177 379.164 643.081]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) >>
+>> endobj
+2364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 606.243 389.126 617.147]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) >>
+>> endobj
+2365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 568.353 378.416 579.257]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga233295f67896774a4fa42920a4b8522b) >>
+>> endobj
+2366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 530.463 388.379 541.367]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) >>
+>> endobj
+2367 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2371 0 obj <<
+/D [2369 0 R /XYZ 89 770.89 null]
+>> endobj
+2372 0 obj <<
+/D [2369 0 R /XYZ 90 502.621 null]
+>> endobj
+2373 0 obj <<
+/D [2369 0 R /XYZ 90 431.346 null]
+>> endobj
+2136 0 obj <<
+/D [2369 0 R /XYZ 90 408.507 null]
+>> endobj
+2374 0 obj <<
+/D [2369 0 R /XYZ 90 408.507 null]
+>> endobj
+2137 0 obj <<
+/D [2369 0 R /XYZ 90 366.802 null]
+>> endobj
+2375 0 obj <<
+/D [2369 0 R /XYZ 90 362.319 null]
+>> endobj
+2138 0 obj <<
+/D [2369 0 R /XYZ 90 324.644 null]
+>> endobj
+2376 0 obj <<
+/D [2369 0 R /XYZ 90 320.161 null]
+>> endobj
+2139 0 obj <<
+/D [2369 0 R /XYZ 90 280.429 null]
+>> endobj
+2377 0 obj <<
+/D [2369 0 R /XYZ 90 275.946 null]
+>> endobj
+2378 0 obj <<
+/D [2369 0 R /XYZ 90 140.849 null]
+>> endobj
+2140 0 obj <<
+/D [2369 0 R /XYZ 90 115.121 null]
+>> endobj
+2379 0 obj <<
+/D [2369 0 R /XYZ 90 115.121 null]
+>> endobj
+2141 0 obj <<
+/D [2369 0 R /XYZ 90 75.329 null]
+>> endobj
+2368 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F39 2335 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2392 0 obj <<
+/Length 2167      
+/Filter /FlateDecode
+>>
+stream
+xڽY[w�6~����R��
��'זs�ڲj+��M{t(	���H���:�~�")YrҤO p曙�I�G�:�N~
��^�‰I
��?81uB/&~ Os�����
D����G�o���p|��N�?NLQ���>	#g�:��;u�0��C��#�I/Z9
�.���_N��B	�UW5X�:�#�!�C�>�����Z��C��y���^?r�.8r���B�I
�5�]4,� #��*���N��1�^�u�b�LF=N�|����"�\��")�߾]�U^<O� 9Q&i
��N/ڐ܏q;`2a4D
g����&+��L��)�*�c��X$K
��u�!/�S�u!K�Ui��#��
+����%A���u<E
¨7�/n������~�AHh��ݘ�^�že������
+ؼ��
J"�-ts!HGm��_G�=�����4�|��R>K!x����gL�L��C	���� KV51����(�V�Pwf���}�F�\Qt`!	�q���rV)Ŕ�h�X�w��pR�y�nJ�q�N�m�Z/�^�P�x{�ȟJp��X	��
��lSh<�����e�ɤ������?��HFb�Y�yV����-Y�\E����d�Ty��F[�v�4�ds�!<���JR@��9��9�yFz}A�{!ײ�^�a���7g�
v=8e��� �}��k5c���i)�}�|)
�������|��]�
�zHA�y�E��'�Wo P���b��*_%��ɬ�$K�ܩ|��`����F��P������}R�xaӰ�ţI
wz�|���hre�%��
�DZ����"�-zzT3I�n
+�KKl�l7%tqS��j���="���l��<�-����]? ܳ
�VS��������¬8��͈>c�x�&���NV�NR���
+;KL^[U��pʶ�K�|PR7�ʦ�K?H'�����b�L�R|u
�/�$��C��a�:}Xx���O
+��O���t@
�B�PIptR)���ݧ�ZlU��|����q�G��A|�d��-���ڭ�b
+��h+.�]��`����w󜫥��R�t�+5O87�dk�p�n=Ƚk3�m�M�Qo�4�����ۚ�jN!Q�
f�t�L�f�z�
+ٟgu ��:e���%>̶Q���/��j։R=Go0߳�t�	�Ux�NӪT
�7,
P5��:�
��{�ы$+�p���u��9�����M�y*���!�
5��b;0�b`�!~�j��^d�i2
_��Ra#��R������]u�������՝��H
UN_�j��V���=Y/t7+i�:]��{�S"<]䳍��a��eE׸
^��B��#QϞBϏH,�Wzw�T9�P�g$�*�Q^����ɛj����m�6kk�`$�
+Y
M�]�7�r�!�PP������4���Sf�=�d��5���$*8J�0܌ƿ
��I�E�؞.X�A�`oAe}�ؓ(˫��I�(M:���FW��
G��C��w��m8���
8��(hc�
���?_�	J�[�<U��,3���1�������E?�s�~�qo+m���wa@�Wq`p��`_���§�A!��ۺ�k���{�Ć��m��7m8�u!>f�~�]^�����'��_�]�ѓa�lϨ���,��P}.��b u���jxy�Э��3�
��
T4�b��q�F�B����5U-�[�������1v������ia]��y�~g���x�a�N�F���Uܮ�W��xƠ����W�͢ۉ������d�%�g��� �V at _b+�DD5a���4⹙g�A4
+v0~�8	�����}
6#�S?�
��(a59��hݓ__����,3����|H����+���G-綿
�|e�V|�
��߆J}o=�hi#���0������ ""���F,��|j"�Y�
FTPgrvqq쨉|���<�oTO��w���K[�K�޶k���S�
;
��]��}�`s�){�{/�oc��4
8	�x�O�Ƌ^H�X�m�n���!ד;��ӫ�p.r��y��@���Ku QV;>�+ḽ�v�S��x_��_=�wM�n�lc����j�B��
`��.d�y
+]��K���}���|�?�60��xQ�kvQU뷧���c)aA�����1T|a�d�??����
����!������
+endstream
+endobj
+2391 0 obj <<
+/Type /Page
+/Contents 2392 0 R
+/Resources 2390 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2380 0 R
+/Annots [ 2387 0 R 2388 0 R 2389 0 R ]
+>> endobj
+2387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.844 574.906 188.471 585.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+2388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.066 543.225 264.446 554.129]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+2389 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2393 0 obj <<
+/D [2391 0 R /XYZ 89 770.89 null]
+>> endobj
+2394 0 obj <<
+/D [2391 0 R /XYZ 90 721.073 null]
+>> endobj
+2142 0 obj <<
+/D [2391 0 R /XYZ 90 686.846 null]
+>> endobj
+2395 0 obj <<
+/D [2391 0 R /XYZ 90 682.363 null]
+>> endobj
+2396 0 obj <<
+/D [2391 0 R /XYZ 90 482.294 null]
+>> endobj
+2143 0 obj <<
+/D [2391 0 R /XYZ 90 457.631 null]
+>> endobj
+2397 0 obj <<
+/D [2391 0 R /XYZ 90 457.631 null]
+>> endobj
+2144 0 obj <<
+/D [2391 0 R /XYZ 107.713 376.547 null]
+>> endobj
+2145 0 obj <<
+/D [2391 0 R /XYZ 107.713 360.807 null]
+>> endobj
+2146 0 obj <<
+/D [2391 0 R /XYZ 107.713 345.067 null]
+>> endobj
+2147 0 obj <<
+/D [2391 0 R /XYZ 107.713 329.327 null]
+>> endobj
+2148 0 obj <<
+/D [2391 0 R /XYZ 107.713 313.587 null]
+>> endobj
+2149 0 obj <<
+/D [2391 0 R /XYZ 107.713 297.847 null]
+>> endobj
+2150 0 obj <<
+/D [2391 0 R /XYZ 107.713 282.107 null]
+>> endobj
+2151 0 obj <<
+/D [2391 0 R /XYZ 107.713 266.367 null]
+>> endobj
+2152 0 obj <<
+/D [2391 0 R /XYZ 107.713 250.627 null]
+>> endobj
+2153 0 obj <<
+/D [2391 0 R /XYZ 107.713 234.886 null]
+>> endobj
+2154 0 obj <<
+/D [2391 0 R /XYZ 107.713 219.146 null]
+>> endobj
+2155 0 obj <<
+/D [2391 0 R /XYZ 107.713 203.406 null]
+>> endobj
+2156 0 obj <<
+/D [2391 0 R /XYZ 107.713 187.666 null]
+>> endobj
+2157 0 obj <<
+/D [2391 0 R /XYZ 107.713 171.926 null]
+>> endobj
+2158 0 obj <<
+/D [2391 0 R /XYZ 107.713 156.186 null]
+>> endobj
+2159 0 obj <<
+/D [2391 0 R /XYZ 107.713 140.446 null]
+>> endobj
+2160 0 obj <<
+/D [2391 0 R /XYZ 107.713 124.706 null]
+>> endobj
+2161 0 obj <<
+/D [2391 0 R /XYZ 107.713 108.966 null]
+>> endobj
+2162 0 obj <<
+/D [2391 0 R /XYZ 107.713 93.226 null]
+>> endobj
+2163 0 obj <<
+/D [2391 0 R /XYZ 107.713 77.486 null]
+>> endobj
+2390 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F113 1791 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2401 0 obj <<
+/Length 1603      
+/Filter /FlateDecode
+>>
+stream
+x��X[s�8~�W�maZ�w�--n6-ʥ�ݶ��O}��4���=�$c;�Н�N_�l#����tΑ��S�r�{��]��4�A�����Nq�b�2Lx�O}���`���_�
U��^�+�
�O7qN�;o�
mK���6��|�s��o=�`��Y
d��6�}��^�U0�
[y(�)��A*���
 q
(!u�[Ȃ7!�����f�f};
���7&�
4
�5��C����A��|�{A,J�",2����֋yğ1V� 
�F��k
����j�j��۝O��:�mU½-�<؇��#���h�49�O�p�b���]�l
٦!�-�M�z��`·�0T���������3/��`�  0��
Nׂ��&ѿN�}q���&���>Mk�H�6�X��m�~�\O��Nl�qR�ٷ�KE?M��%X��t@��n`�<�F�;{��"� ;㤐�����d�q�謧�����c/bXH7
Il��!���@��c^I�MD�������/RО�:c�J�?�:�.��j հ���>ɂg%��=!9wgsw�N�W��n'?ijv%R)�m�����e v~,���=|�q�mB* *�
kؒi��
�Dj��T��SHG��U4
X�"b���a#�wƂ��F�z��P>�S?���`�z����<)b��z�]v�y�����`�� ��X�.�K��>�y����+��t`�]0r
�2*x����v���'M���Iv�����m�]B��j2Z�@��a�F��ki�J֥.K���7���}�
�dL����ci�ʇ'�#�n)��X�:�(*
r&
��$^
�	������s	j0�F� [...]
+d�$��R������>v���z���Ȇ���b�^�y��M

,W
�,���N�
+�OW���'��P����eEP����Ĭ
H�s�j��Oځ:ZU�]�B`z�-��+�c����O���6�37����$&8U��D
';�n_I�*�T��+��
+ ��6M]ܕ�2
��f�1�2����U�zn���X��*(���8�Q�-(
8��cW�F
�0��J"�y�����;�
+wJ��Ƭqq�*kVg�(I�&�����Җ&Ȅ#����2L,K-�Q��@���&ҔQF>���
sl��
+endstream
+endobj
+2400 0 obj <<
+/Type /Page
+/Contents 2401 0 R
+/Resources 2399 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2380 0 R
+/Annots [ 2398 0 R ]
+>> endobj
+2398 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2402 0 obj <<
+/D [2400 0 R /XYZ 89 770.89 null]
+>> endobj
+2164 0 obj <<
+/D [2400 0 R /XYZ 107.713 711.11 null]
+>> endobj
+2165 0 obj <<
+/D [2400 0 R /XYZ 107.713 693.998 null]
+>> endobj
+2166 0 obj <<
+/D [2400 0 R /XYZ 107.713 676.886 null]
+>> endobj
+2167 0 obj <<
+/D [2400 0 R /XYZ 107.713 659.774 null]
+>> endobj
+2168 0 obj <<
+/D [2400 0 R /XYZ 107.713 642.662 null]
+>> endobj
+2169 0 obj <<
+/D [2400 0 R /XYZ 107.713 625.55 null]
+>> endobj
+2170 0 obj <<
+/D [2400 0 R /XYZ 107.713 608.438 null]
+>> endobj
+2171 0 obj <<
+/D [2400 0 R /XYZ 107.713 591.326 null]
+>> endobj
+2244 0 obj <<
+/D [2400 0 R /XYZ 90 577.448 null]
+>> endobj
+2403 0 obj <<
+/D [2400 0 R /XYZ 90 572.965 null]
+>> endobj
+2245 0 obj <<
+/D [2400 0 R /XYZ 107.713 489.682 null]
+>> endobj
+2246 0 obj <<
+/D [2400 0 R /XYZ 107.713 472.57 null]
+>> endobj
+2247 0 obj <<
+/D [2400 0 R /XYZ 107.713 455.458 null]
+>> endobj
+2248 0 obj <<
+/D [2400 0 R /XYZ 107.713 438.346 null]
+>> endobj
+2249 0 obj <<
+/D [2400 0 R /XYZ 107.713 409.279 null]
+>> endobj
+2250 0 obj <<
+/D [2400 0 R /XYZ 90 383.446 null]
+>> endobj
+2404 0 obj <<
+/D [2400 0 R /XYZ 90 378.963 null]
+>> endobj
+2251 0 obj <<
+/D [2400 0 R /XYZ 107.713 295.68 null]
+>> endobj
+2252 0 obj <<
+/D [2400 0 R /XYZ 107.713 278.568 null]
+>> endobj
+2253 0 obj <<
+/D [2400 0 R /XYZ 90 264.69 null]
+>> endobj
+2405 0 obj <<
+/D [2400 0 R /XYZ 90 260.207 null]
+>> endobj
+2254 0 obj <<
+/D [2400 0 R /XYZ 107.713 176.924 null]
+>> endobj
+2255 0 obj <<
+/D [2400 0 R /XYZ 107.713 159.812 null]
+>> endobj
+2256 0 obj <<
+/D [2400 0 R /XYZ 107.713 142.7 null]
+>> endobj
+2257 0 obj <<
+/D [2400 0 R /XYZ 107.713 125.588 null]
+>> endobj
+2258 0 obj <<
+/D [2400 0 R /XYZ 107.713 108.476 null]
+>> endobj
+2259 0 obj <<
+/D [2400 0 R /XYZ 107.713 91.364 null]
+>> endobj
+2260 0 obj <<
+/D [2400 0 R /XYZ 90 77.486 null]
+>> endobj
+2399 0 obj <<
+/Font << /F73 560 0 R /F113 1791 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F8 802 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2412 0 obj <<
+/Length 1379      
+/Filter /FlateDecode
+>>
+stream
+x��XKs�H��Wp[�
+�y���q씲�#���7I��4��H� ������
�+YWj91̣����0���r�9������1�3lx<@�
os��q�����\���C����?��Gr�s1�|�X�Q�
���l���	s�~c`��x(6�
N<Wƨ�5��#��� !�� � �
�&cSĖgn�΁=��旸��f����Т�LV������*��a�;==O֛�����*̲���ɥ�k�m-ۦ�i�,�R�eS��Ll�=�E�2�f�lc��m�
�
+.��"
�$m�:x�\Rw�Æ'fL;dpu��gW��Aoxu�;�m3�pc�t���,�ga&����8YG�J�Ϛ.q

hh�K
6q�-:�n�X�T1��B�Ib���Z�M%U��z�w�h�V�o�:�Pn�� 8�Ӗj�
K���GZ���+#�b�{���[�FG
�f����Ts�;��<ZG��y�ē^2��6L�,��t<��<5����t�JZ���������~��>Aد�m/�,�2�Lŗ��r1�gZ^�f����aa@�*�{��#��
"�-�y�ͳ��6�����b!����ۈɍE|3���&�G¸2��⸐�����:��j�f����*"����&
r)�UNh6�K=��l�kx*��զ
�s�_w��z�٤	�/ڑ4[���D��)�����;
M���0����d������T���Ph#n�:�
���`���A��n
��냽?��n�ˏ����������K&�C���2��`
��S/�/+�b��
+"2�@�z��uD
+�	�]K����돺�������U�{g�".
�F10�{��Hu�zB���_M��V�
Ri�x%�b���P�X�rL�E
�^���{9��/��P��Yk�Uҵ�+��AfF���M�G��\����(�ꢹQM�V�
�Y�����BtL�C�vy���/K���<*ҏ�D~��p��-
����ߩ������.�/�7����5�0��U` �b���4�qؠ��
.db
+�*��87��s��L�ެ�

+6��(S��"���|�Z���
�I�S�,�݃��0�C
WuÆ6���q+�1�� h&p�Vp�}q@
���z[Z��"ΪO��*Qp��;�?^]Ϩ�	.
+<�y@�O
�\�~�*qp�75�u��ɥȣ��_O���CNP�������h�X��=q�]3�U���l�g����((
�˕s
h�TZ�5.�=
^���L����0ޖ�>bkVfU`"P�}X#�9<�e@�Ka�\A�S��s�<����s��ӓ��vMb����g8��j{WV�u���`�� ѣ �
9�
C
+endstream
+endobj
+2411 0 obj <<
+/Type /Page
+/Contents 2412 0 R
+/Resources 2410 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2380 0 R
+/Annots [ 2406 0 R 2407 0 R 2408 0 R 2409 0 R ]
+>> endobj
+2406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 433.104 294.501 444.008]
+/A << /S /GoTo /D (index_Approximating_Bounded_Integers) >>
+>> endobj
+2407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 263.087 294.501 273.991]
+/A << /S /GoTo /D (index_Approximating_Bounded_Integers) >>
+>> endobj
+2408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 126.868 294.501 137.772]
+/A << /S /GoTo /D (index_Approximating_Bounded_Integers) >>
+>> endobj
+2409 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2413 0 obj <<
+/D [2411 0 R /XYZ 89 770.89 null]
+>> endobj
+2414 0 obj <<
+/D [2411 0 R /XYZ 90 721.073 null]
+>> endobj
+2261 0 obj <<
+/D [2411 0 R /XYZ 107.713 646.774 null]
+>> endobj
+2262 0 obj <<
+/D [2411 0 R /XYZ 107.713 631.523 null]
+>> endobj
+2263 0 obj <<
+/D [2411 0 R /XYZ 107.713 616.272 null]
+>> endobj
+2264 0 obj <<
+/D [2411 0 R /XYZ 90 605.875 null]
+>> endobj
+2415 0 obj <<
+/D [2411 0 R /XYZ 90 601.391 null]
+>> endobj
+2265 0 obj <<
+/D [2411 0 R /XYZ 107.713 521.588 null]
+>> endobj
+2266 0 obj <<
+/D [2411 0 R /XYZ 107.713 506.337 null]
+>> endobj
+2267 0 obj <<
+/D [2411 0 R /XYZ 90 495.94 null]
+>> endobj
+2416 0 obj <<
+/D [2411 0 R /XYZ 90 491.456 null]
+>> endobj
+2268 0 obj <<
+/D [2411 0 R /XYZ 107.713 395.677 null]
+>> endobj
+2269 0 obj <<
+/D [2411 0 R /XYZ 107.713 380.426 null]
+>> endobj
+2270 0 obj <<
+/D [2411 0 R /XYZ 107.713 365.174 null]
+>> endobj
+2271 0 obj <<
+/D [2411 0 R /XYZ 107.713 349.923 null]
+>> endobj
+2272 0 obj <<
+/D [2411 0 R /XYZ 107.713 334.672 null]
+>> endobj
+2273 0 obj <<
+/D [2411 0 R /XYZ 90 326.864 null]
+>> endobj
+2417 0 obj <<
+/D [2411 0 R /XYZ 90 322.381 null]
+>> endobj
+2274 0 obj <<
+/D [2411 0 R /XYZ 107.713 225.66 null]
+>> endobj
+2275 0 obj <<
+/D [2411 0 R /XYZ 107.713 210.408 null]
+>> endobj
+2276 0 obj <<
+/D [2411 0 R /XYZ 90 189.704 null]
+>> endobj
+2418 0 obj <<
+/D [2411 0 R /XYZ 90 185.221 null]
+>> endobj
+2277 0 obj <<
+/D [2411 0 R /XYZ 107.713 89.441 null]
+>> endobj
+2410 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F113 1791 0 R /F11 621 0 R /F8 802 0 R /F10 773 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2425 0 obj <<
+/Length 2383      
+/Filter /FlateDecode
+>>
+stream
+xڭYYs�8~����R5
� ���rV�>4>f�6�r�dqC�
+��x�t�J�)9v�E��h���A�
|������ѩ�	K"/�,	� aa���3w8r9�Χ_~���;g2h䃢�$�U��3�������z0�9�~��-|�א�x0[
|�����3?���h5<�����n�ۂ�.L��p]�$����ӳ���^��O'�-��rt�m
h�'�E�sP��N1tC�O�Q�W��b���0
+�C$�z���TU��4N+z6�\�)/Ws6
��wn�v�JW���+%s�\/emG]� � �1�sa�$
I�bA�0(֪�uZ�4%i�@��,K�ܡ�ޛY�Z~��Q�Q �ɟH/�F���9�B
�͝�[�
q�$��3
+R㢨U��W��k83�{ttL⃬~�
��a��ĩ����Zw�Z��Q�ʴh*�h5�|)�k�&m�)�멪Պ�U�S�2{������ycN�š��:L������a:Z�p/�p��r聉Ӣ�'27��4W�g�H�P�,
͊|�J�.p
�zIF��`��}.��n�#�I-�* ��3����a�Ob`���>������
�D�|%�|����jJeI����S%
W2O��I��w��;VE�v�Jx.
��` 
Bt�⃐��<��t%k
�n>馤����9r#��᳜49�^^_O>��_KJ��6)���dw�w �X;�H
��k�͆$p�1Ғ�aE�����;����n�5��
$��YڑB|?����%�֜�Ղ"	j"�
<�P3
G� a�^V��06 ��2�-�b�l*=�Ԅ4i>Og&G�$��
���h%

x���Vr
�6k�Mޭ虫��*�1
*�.���i�h�fiզ��޺πqo�Ո��	����t0����O8�
+�=k"��k�8�b ˕���1��i�楼;K�KY>}�p���Ѝ
U��bt�G����@������()Bgj`M�XoآQED���v�,"Z���FA.�h���<e&~
9Y�+Y�n�
/�ҡ
��NnN�|N�"t
Tq:c���v�Q�j��m9noy�vP�ЬB� I��`�(�k��Y嘍��%�g
�s�Q�=�vOc��ʻ�g���lPv2��ޛ�΢8��:��s?���ע����m\�ކ�HLY�b��,H�!��"zV�sS�z.�M*ME׳i>˚9�60
P�0���M���3Y�g4�����QEǑ��B�&
&y���H5��@ߵ)��^P:̡�u27�Mf��UM�L^���b>���h� b��k~�fj� C�������+�	X(|
��,5zx�=������t�q�T<4��j�
} �^�]�5�7�!�(��4t �E`䎱�=F�s�'b=تXz5�����4��m�m҂A٘�:]):�i������L6�2D�x����3t沖����A�G.�n��o�15�|�F��b
66r�D7n&�`�TՑ���W�窙-�Y��S�:
lX�X������]m�][�g&���
m�+Fۍ i����[�ݟ]�O�B��ه�sw��p�~o%�-_���1
��1̷�ڰ|G[���mB��,����n�YJx�QeEsz�;ə~rͽ�j^��!�~
���d��Q��%�.5�lf5��wF�=�nZ绹ZTl���
jʵRt���VPy�OE9m��L�������s�
���vw��~;c����iۏ�/�&g��(��Hp�M��S�
+�m2
�E�����t$E̠���S���
}f
�v�&�ݨ�i�5m��N�V�ؖ��ɼN��و�(yF�Nɳ�]O.>�C���G7H|��������wj��o���׫����+�	�(أݼh�wi}�a�ܡ^�Y=#`�z��
���( �w+����
���^�� �}�rF��r7�3㹻�n�'�|W
<B~�jB��A�JD�;7��ĵ��sq��2t�1�u�GV�����p ݏd�
+��׊
+��������0� ��μ7����
��@#Uׁ���'<&b�B����n}�h�>{�J�Y��y?��N�wS�� �Ww�P6�������
,�M
%XU/?��(�T�I-G_ծ��|�¯���

l��s������X��J\]��|��ۂ}�lG�wz�&_(i�y��ĵ
�ӛ������,
���-e��x[�̾5d��^��_dD����_d�/14A�
�w�����N�hp[������s�7VD�\��ͧG���1ũ��M,�@��ѿ��pK
Wp���
,�z����y������[�$������P��֖P$Xy�`������c�i������`��?��K{�
+endstream
+endobj
+2424 0 obj <<
+/Type /Page
+/Contents 2425 0 R
+/Resources 2423 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2380 0 R
+/Annots [ 2419 0 R 2420 0 R 2422 0 R ]
+>> endobj
+2419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 330.993 248.743 341.897]
+/A << /S /GoTo /D (index_floating_point) >>
+>> endobj
+2420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.841 140.301 245.973 150.228]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+2422 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2426 0 obj <<
+/D [2424 0 R /XYZ 89 770.89 null]
+>> endobj
+2278 0 obj <<
+/D [2424 0 R /XYZ 107.713 711.11 null]
+>> endobj
+2279 0 obj <<
+/D [2424 0 R /XYZ 107.713 614.585 null]
+>> endobj
+2280 0 obj <<
+/D [2424 0 R /XYZ 90 582.562 null]
+>> endobj
+2427 0 obj <<
+/D [2424 0 R /XYZ 90 578.079 null]
+>> endobj
+2281 0 obj <<
+/D [2424 0 R /XYZ 107.713 488.605 null]
+>> endobj
+2282 0 obj <<
+/D [2424 0 R /XYZ 107.713 449.762 null]
+>> endobj
+2283 0 obj <<
+/D [2424 0 R /XYZ 90 405.784 null]
+>> endobj
+2428 0 obj <<
+/D [2424 0 R /XYZ 90 401.301 null]
+>> endobj
+2284 0 obj <<
+/D [2424 0 R /XYZ 107.713 294.202 null]
+>> endobj
+2285 0 obj <<
+/D [2424 0 R /XYZ 107.713 279.269 null]
+>> endobj
+2286 0 obj <<
+/D [2424 0 R /XYZ 107.713 264.336 null]
+>> endobj
+2287 0 obj <<
+/D [2424 0 R /XYZ 107.713 249.403 null]
+>> endobj
+2288 0 obj <<
+/D [2424 0 R /XYZ 107.713 234.47 null]
+>> endobj
+2289 0 obj <<
+/D [2424 0 R /XYZ 107.713 207.582 null]
+>> endobj
+2290 0 obj <<
+/D [2424 0 R /XYZ 107.713 192.648 null]
+>> endobj
+2291 0 obj <<
+/D [2424 0 R /XYZ 90 184.536 null]
+>> endobj
+2429 0 obj <<
+/D [2424 0 R /XYZ 90 180.053 null]
+>> endobj
+2292 0 obj <<
+/D [2424 0 R /XYZ 107.713 102.021 null]
+>> endobj
+2293 0 obj <<
+/D [2424 0 R /XYZ 107.713 87.088 null]
+>> endobj
+2294 0 obj <<
+/D [2424 0 R /XYZ 90 77.486 null]
+>> endobj
+2423 0 obj <<
+/Font << /F73 560 0 R /F113 1791 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2433 0 obj <<
+/Length 2511      
+/Filter /FlateDecode
+>>
+stream
+x�ݛKs�8���<�HU��#���Ny6�=�s�$�%�֮D9��|�i��DH�DJȖgOzQ��7�GO��w��uN��
2����128R� !��(��U���I������_�.��.�n�o���η��pD��
�t4�v>����-ˆ
��_4�8e�:�n;�wp����})�
Y#R ∰^�`��q�S����uH2�5q��=���t:���QܝM~<ǣtp�a���o�~����N{Dwg�xz�
��<�#=9���@�l�O)"X�����1����f�p6�����5{�K�v�ҧro�w���K���?�g��="�q����K��\�>F�O%RL�g� �� �����דsB�L4R�D}xŌ�>]������݇���7W���Q$\!A��{.����a\��"y����5�>Z�Y�Z��է�ӳ��l�5���=��(
�E+�h��]]�]|��w4�,�v�=J�AR*�%O����"ϒ�w�p� h;��#���E��dh��i����!H*�_m�'|է֢�XD��y����^�s�݌<Dٹ������
+?m�h3��� I[SL���Q�=B�E��$���!(e�H�1���]�S���U�Q��,p�υt��B4�na�01N+�).�N�]��U�2��Qc	���] x����o�ҥ_}
'�qm�&���[��
�
�a�P��C�V=�,�S%�UO1'0��R�ܔ��fb�yS�ؽ��X!‰N���٢�F�':/d��D�%��AD�2J���K�U	�E9K�M�HB
�?S���.lq_A���Aq���(��!`�!]B�:��{uK1��"��Ն{Mt
5��<$bB0���m�e*�H��
+��
��z�j2�8�P����i��Au�
/��������x�_�����a6_=���=*��ɢ�8,�js�A�-+�@
+��*�-��iĥ�.Qi��h3�eM�,�P9q�}������d1?y�,J�q�c���%aZZ$v<��
�]������
҂q~0%�p�s2Xe� a�A� �H8 at p
H� `�1a��1���B �l�����k�z�$@�Fu��Z� (BA�e���R�$�
�H=�
9#�*(dj�Q
��1�d&D.gMq�6�
 �R�*@#w�ʀpTM��a��?�D���uiF���k^��Ȍ��*���nW���IKX�%����B�1���$�M1Vnh����)���aH50P
a
RM��Q��a� @� ���}
�&��1M�1d���Ř�LS]]Y
�R,�
+�w�s�8�!:�9G�t�u�kA��
�3-i
+K	Aƭۇx*G��:G��
r~dQ�
LQ0UqTE�:*c!�ݨ�k
M
���Q�B�-4.���&8����H���A��o����8_%�;|�A�
�Ѓ<\y@��p���!%c*��{٦i���e'S�qN�o��+�C0��X�34tr*� ��S���9�8�@������o��J��1!(̻=ۘ�:�ۍ��7��uy'�����T���m�M�-�d� ��v/(?ƞ���
k�3Ż�B{$��F��cR�
[v�M���ɸ0fχ�/�_^ݜ�XS
g3
�%��n�s�q6�'�M�S��A :��
�
�H��$����weMp0eo
�-��p ��d�=�FEi
�C�#����r;#�5��$��Q!��0Fn6�'+a���(�XmJc[x2
���u1��ܰ�t���
f�I�m�(�'G�8'Sy�G!UZ�\�D��0�@	�7>AS}S�
�e!0�AJ
�c4���G�B����{ "��ͧ�B�
+�}�?a�ͺ��
�r"�Q2���nn��j����ʫ�U
 é�ʱxi�o#&"
��
+Cbﱼ�(N
d��A�
"oHq��:���)�fw �R�
A[y��(��q���Yڦ���k��
��쁡V>��OT���^�� �+�����8������N�U����4^�HfuGc����h�H�_k4�G�M �P
��)p,���sln�?� Ķ�_"r,��A* k���@ �XU�֎ �9V�c�ch�9V��4����Y+��
1�C 1m�����-fo'5���<ȷ�F��;�)�e{�:
��V���o�p�U� ��ìMbs�L
�7���y<�ښUv���C
�q,ga�0E����N�U����4^�8�4G��B�1a�My�oP����ĺ����Ph]ۧ@�� ��J���V� J�W)�Y:
�ޯ��$�o��>���n�UuG�D at L,���P���- ���ǥ%`�5}\��G�l�Ƀ�7h
+�C������G��򋓋)�Ng`le���+��K
i�.$��-q���i���śO�8��>�\��~
$
�����;]��

+xIc]�;�gwoc�Tt���%��:�T�$ū�u���������i
'Oh8�n�W��l ���
ݍ��b{*?Å/��m���4�I\4
+endstream
+endobj
+2432 0 obj <<
+/Type /Page
+/Contents 2433 0 R
+/Resources 2431 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2380 0 R
+/Annots [ 2421 0 R 2430 0 R ]
+>> endobj
+2421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.841 686.826 249.291 696.753]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+2430 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2434 0 obj <<
+/D [2432 0 R /XYZ 89 770.89 null]
+>> endobj
+2435 0 obj <<
+/D [2432 0 R /XYZ 90 721.073 null]
+>> endobj
+2295 0 obj <<
+/D [2432 0 R /XYZ 107.713 644.235 null]
+>> endobj
+2296 0 obj <<
+/D [2432 0 R /XYZ 107.713 627.1 null]
+>> endobj
+2297 0 obj <<
+/D [2432 0 R /XYZ 107.713 609.964 null]
+>> endobj
+2436 0 obj <<
+/D [2432 0 R /XYZ 90 590.547 null]
+>> endobj
+2336 0 obj <<
+/D [2432 0 R /XYZ 90 567.633 null]
+>> endobj
+2437 0 obj <<
+/D [2432 0 R /XYZ 90 567.633 null]
+>> endobj
+2337 0 obj <<
+/D [2432 0 R /XYZ 90 543.612 null]
+>> endobj
+2439 0 obj <<
+/D [2432 0 R /XYZ 90 543.612 null]
+>> endobj
+2338 0 obj <<
+/D [2432 0 R /XYZ 90 521.111 null]
+>> endobj
+2440 0 obj <<
+/D [2432 0 R /XYZ 90 521.111 null]
+>> endobj
+2339 0 obj <<
+/D [2432 0 R /XYZ 90 499.397 null]
+>> endobj
+2441 0 obj <<
+/D [2432 0 R /XYZ 90 499.397 null]
+>> endobj
+2340 0 obj <<
+/D [2432 0 R /XYZ 495.973 461.762 null]
+>> endobj
+2442 0 obj <<
+/D [2432 0 R /XYZ 90 455.122 null]
+>> endobj
+2341 0 obj <<
+/D [2432 0 R /XYZ 215.229 417.547 null]
+>> endobj
+2443 0 obj <<
+/D [2432 0 R /XYZ 90 410.907 null]
+>> endobj
+2342 0 obj <<
+/D [2432 0 R /XYZ 90 388.859 null]
+>> endobj
+2444 0 obj <<
+/D [2432 0 R /XYZ 90 388.859 null]
+>> endobj
+2343 0 obj <<
+/D [2432 0 R /XYZ 90 355.798 null]
+>> endobj
+2445 0 obj <<
+/D [2432 0 R /XYZ 90 355.798 null]
+>> endobj
+2344 0 obj <<
+/D [2432 0 R /XYZ 90 321.735 null]
+>> endobj
+2446 0 obj <<
+/D [2432 0 R /XYZ 90 321.735 null]
+>> endobj
+2345 0 obj <<
+/D [2432 0 R /XYZ 448.354 283.099 null]
+>> endobj
+2447 0 obj <<
+/D [2432 0 R /XYZ 90 276.459 null]
+>> endobj
+2346 0 obj <<
+/D [2432 0 R /XYZ 90 254.347 null]
+>> endobj
+2448 0 obj <<
+/D [2432 0 R /XYZ 90 254.347 null]
+>> endobj
+2347 0 obj <<
+/D [2432 0 R /XYZ 90 232.239 null]
+>> endobj
+2449 0 obj <<
+/D [2432 0 R /XYZ 90 232.239 null]
+>> endobj
+2348 0 obj <<
+/D [2432 0 R /XYZ 90 210.132 null]
+>> endobj
+2450 0 obj <<
+/D [2432 0 R /XYZ 90 210.132 null]
+>> endobj
+2349 0 obj <<
+/D [2432 0 R /XYZ 90 188.024 null]
+>> endobj
+2451 0 obj <<
+/D [2432 0 R /XYZ 90 188.024 null]
+>> endobj
+2350 0 obj <<
+/D [2432 0 R /XYZ 90 165.916 null]
+>> endobj
+2452 0 obj <<
+/D [2432 0 R /XYZ 90 165.916 null]
+>> endobj
+2351 0 obj <<
+/D [2432 0 R /XYZ 90 143.809 null]
+>> endobj
+2453 0 obj <<
+/D [2432 0 R /XYZ 90 143.809 null]
+>> endobj
+2352 0 obj <<
+/D [2432 0 R /XYZ 90 121.701 null]
+>> endobj
+2454 0 obj <<
+/D [2432 0 R /XYZ 90 121.701 null]
+>> endobj
+2353 0 obj <<
+/D [2432 0 R /XYZ 90 99.594 null]
+>> endobj
+2455 0 obj <<
+/D [2432 0 R /XYZ 90 99.594 null]
+>> endobj
+2354 0 obj <<
+/D [2432 0 R /XYZ 90 77.486 null]
+>> endobj
+2456 0 obj <<
+/D [2432 0 R /XYZ 90 77.486 null]
+>> endobj
+2431 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F113 1791 0 R /F118 2438 0 R /F75 562 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2462 0 obj <<
+/Length 2799      
+/Filter /FlateDecode
+>>
+stream
+x��[�۶�~�>��$��
��t�i�<j�\��:�
O��8�H���\��� EP��E���}9��j�
���
%\��GߟQ
��˳��F��h�G��QBGF&Dix��>�-a�)������W�)Wt�&-�w�u��~,�Y�Hg�j�0cc&/:����3���\1v4[�}�HGs��	��
}rD����������H\'f�:b2Fk�$��$��X�e`�L�{�&�$�$�I#�����Җ��05.w�</�{ֶ�hPe���$��h�y^e�m^�+s� 
be�a�u��kgz|1�r�V��Gm��|	
��p1|\.'��oo�y�#�`�P9�
&� o�*�&S;�}�1�
)tB�ЃHa8���j1zm^XM�0v'lk
؝?������b|��Hi��C�"zS�߂(���k�l�[�����uD�G)�$�i@扌jM,��Ma�D)O�!/�y�}t�֠cWg��H���)8��
_���f��2�f�B��0?�jY�ң�!F6
+���
+�T�����.{xjI����׾
B�i�*��<�Nւ��!\�'9}�΄cE�ս�^p"�
B!��#B��p��"��`	Vh�
B�41Jǒl�ͶgU��
fQ!�
�7��}�����l<+
�&��4����r*� �8�z�m{��^Ȯw6�v�Z�6gMdk�
+��̄������q�ܤ�>7�m��0
�uU"����UV�r�}�U��)�~|u�o�M�V�e�Ϫ�ʊ�נ
+
Wu
����g����7o/��h�.�y �P�$�C�����H;�!6�֎
@v�>��W8�$~a\��i
+q�=	��řv�����<!fLF�*��I�t��`�+�'�rį�8�y&�U�Qe�E���7��[�3m���u�����s
+n
+�ɀ�ЄR��G  0mN�9%�s��>R�U��nb;^�y�E�wo��z]V�l����N;G�������&
_�}4�g�=��-��Us=������)����#\r�V�("��>@���ޖj�
��S
@T��;�)�Q�A��	,{��𚁐�R9Rh��2�f���+%5�Ɯ�O5ذ�9:���	Y�I[I��d�Xzp2b�a���G����b����|�iMnbA^��dx
��t
��G��gcYì����*�I'����q�4~ѿ.�r�G�n�M��6��8����
.�ty
H�\ԈⲎ~�p暧WK"@@:4�_�*��e9K
ƹ�����y��i�"��!��|
+�
+
��j8W�P(
+�-��A�?B(L#,�� /A4
jЀ�-PTC�"֓=HX&��cG��m�/���ԏ�~�On p=�0z �	�=8l &%ʣ�<�e؊mm־\�y�~�YE�#\~L5y�U>��&���A`��BN#�>���P
5$}�O$�ױ�L���ʗ�
�x�1�3e��ʻ��E� 렇��^��᷈
t��
?���'�!�gM8�ﲝ>� �
�.05J\
��O7B��|�+�l�
�Xѐ���U�q�R8��yO���t���ʖz�	��5��mF��=x{�-J��,p�
�^�}B��
+���'	���`tU�o'Z���kr4 �� i��S�=����G�}���
6��>�>q��5�+�d��'��G�d�Ő���9>,���`���e�]U􇓝��Y�L�IE�U��.��7�)���� -�:� ���t�8o�.�9LZg������$'V�g �ȷ���/V9��e�o���H��>� ��t���
��B
+Na �3y��l����屄B
+%	�I� ?��'�SWI�9`�C�e�ѵjHm(뱬��u5f���
�N���4���>f�y�&�K&5�$|�-P�E6��w��m� 3I�O�o�.Y."M
n� 6���E��u�E�Vi�)�\�,XI�
`�rޒ�{�VJb9oET�*�e(���-�a�%� \�8W��ͶƻS�.N!�kw*8��������uvgu]?��nFBb&��ںv��~`m]?] _YW� �������b�*���Ī:�F����}�30;>Ċp�b/8Z��U�w�#8��b��-탷餋Ɲ��R����ը��Sp'K�x	���� .Ddԇ�}\��nj���0��$��v\sw!
�
���X;��I8�{
��Q��/D܈|�|�N	7��Z��
<]���$�)iq|B��k�vJT��t�y\�$R��S��P���v�S�NrX�{χe��ab�[%
�\����:�b5)s�R4�.�
}g��Đ]�������\2y����D��D"��4��;&��/2�[��.�Ϣ�

;v�P�zjs�LB$�/���E;�@t���V!���
�\
:\[�8
m
+}V�B�U!Ԁ��H�(d�0�`�d.���B���>����ف�ni�-Vwv�
+�
d����ko!�s�y���}
+�j�B��O�^��vi�U�}4d
[䈿�
����[��i�MB
�~[H^�܄ua�
��\�.�~�4��
I�Э�6tC�Յn ��$�n�,�?݆�
�XdM%��gƨ��k��a��a�.jc������������sw��]��
}
�Q�!|�p��
�3fƉ���5V_�vX��bA%��C-W��?7Y��R���z��t��X�]�MSe����bm�`��Eʐ���࿎���}'y/3��}��f�]�8?��]o�����aɶ�
���1�E~�*���ު�^K��tc>�
�b�
����)3�;���}X1L����oK�������2
+endstream
+endobj
+2461 0 obj <<
+/Type /Page
+/Contents 2462 0 R
+/Resources 2460 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2470 0 R
+/Annots [ 2457 0 R 2458 0 R 2459 0 R ]
+>> endobj
+2457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.098 639.832 468.816 650.736]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.098 305.085 468.816 315.989]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2459 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2463 0 obj <<
+/D [2461 0 R /XYZ 89 770.89 null]
+>> endobj
+2355 0 obj <<
+/D [2461 0 R /XYZ 90 693.576 null]
+>> endobj
+2464 0 obj <<
+/D [2461 0 R /XYZ 90 693.576 null]
+>> endobj
+2465 0 obj <<
+/D [2461 0 R /XYZ 90 621.943 null]
+>> endobj
+2466 0 obj <<
+/D [2461 0 R /XYZ 90 558.431 null]
+>> endobj
+2356 0 obj <<
+/D [2461 0 R /XYZ 90 362.252 null]
+>> endobj
+2467 0 obj <<
+/D [2461 0 R /XYZ 90 357.768 null]
+>> endobj
+2468 0 obj <<
+/D [2461 0 R /XYZ 90 287.197 null]
+>> endobj
+2469 0 obj <<
+/D [2461 0 R /XYZ 90 223.685 null]
+>> endobj
+2460 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F11 621 0 R /F60 540 0 R /F94 771 0 R /F13 835 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2476 0 obj <<
+/Length 3169      
+/Filter /FlateDecode
+>>
+stream
+x��k�۶���
+}j�������$��4�]7�Ng�x2:�wDZD*����
�!A��On��|���ž����
��������F

q������с��(
O������������9
��?����חo��ŋˋ�.���W���tq��=
�`��%���G�h1�\��|���o����;�0F
{����h̥�o'�0�T˦\�����)'W�b�Sr�˦Xպ���/�o�:5��w��z9n�y�
�� D�M}�L�Të�n�
x��l�#/�`
d9�]ˢ�����e~×*`FW��n���	>j@(~��@��S}
�'<P�~A�*Z�-�y�u�l�f�
t��X*�
�s��
���0q�;LX��.�4�׫UyS�J������.O+�Z-'�"
g �Z�u�
+��π.H�ꉜP�piZ1_�����8��D>���`<�}�LkR��w�`�#�t�F���JB	W8ğ��/���1�h�p
������M4'P��.��
+��/<|�n69ҹ
�Z
��c�Q GL
���D���K�_���,���˱�3�W�yt�γ�JyU���]�
x�(+�j�<���:�~}
R��N��ۥ��
b��a�\������t�Y��Z 
+p5"�Ke��},������גJ�ps���ʇ	��-u���{N�!�t�N�eڲ	3,��
+y�a�#�u����f2�忐{FD6 ��:]�g4?ɂ(A0�/�Sr�t�ͺ�@�ִу�^�LM�̓H�e���zH14�t�� ��JX�2̕�X�h~M;�P�q�JEj+a��:!?өC4$G
��,���&�]��ƌ��-�yteO�f�� Ԫ��Ej��Hۡ{�,���;H>|���e���ێ���d�0��zU�sȆoF\��.&�A
+w� -�h���
	U8q~��� %ٝ;�� J'��}3|x06��-fM,v��!`k`Z��w�U3�l�wϞ�U���k�]�
�P��ɵ�͙�%uD�_2N4�a3�>��Mfc�
���d�A.�!�zSM�bdv6�(.ϲ�}�%��۠E?PE��
+t,Kb*�M����}�ߴjg��E���<ɨ
�����,������X�ްs;���/��`k]g(�(�0���
+h�
�;�������> P�
:��O�OF/�����U�j
Z)����'p��I�*�X�!(��nM��
س0��
���U5if-�YI�#~
q�����
���&
+��//���ի7�d�}±#IJ
�H�v9�vؚ� @���ǰL]>���%a_�v7s��eGSG��ڽ��sÄL؁F��5G�RT`l
+��/ۅ��� �y����)׻�rH0���Ni!�g":��Ts�S@ <#9�4˿K�B7s��4�'*���e�`g�˺�֘$���f���a�3
?�o�|ބ|��
+[�0�lW�G~
22�:kf�\@8;�q
c��~��6Dmrk�v��A�Z��2���0�֏��Úb��~^�{̬������Q*�B!���i�)��$������4'p����	a ܴǥ�)��Y�.�Z��p
�
����an1�a�$�ôX&E�K�N����r[����ݼ�4q�Uq;�P���/0�ka�ax�	�>��
����tσ�[p���
�
+���m��WY�t�����!�p0���PG���u
󾤰z��}�;�s
BE�"��N0�$\�H�ٺ_b
'�i#��
�X�E2h���5@��\0j#��uҗ(83=��R��3���Ǵ?��dn�"��{���O��� �L">:�sS�x[]��D
���
�M�Q�OHi�xg����G�y_
(����}Tp�-����'����
-=fOxƌ��a��-:A8�p�;|��E'�=c��:��ށqK��~�����i���S+��x*
o�Ɨ�y�x/(�/���-����o!���K�jy����m�{f�"�{�s��{?ٿ�a,�������^ F���b��vl�8տ���� �&��0�e�1�ch�ez5��&�xt	�7{��>� H����C��+ꎓ.�/��()b1��a:�'��C¤G��
�4���rC$���
�q�m��
��q�Jp�l_���K;�4LJiaƋ9ߚZ润6c9H�4v��Ĭ��=�`s�Z; DY�����,�o�T�_�=
�k}���]U�ka�6
�j�p at D1-��Y�|��WL��G���e]�) hkL�����rWՇ�6�D�]�	FPǐ�{5�]{����p<����vx3�0�w�k���p��偡4u�/��I��q��QQ�Id����x:�

�
�'
H5X1�� ��XrbY'?���!�.����]z$�	.3��ioQ.fُ����QJ�AW�QM�Q��
�nPf21Y
$���z� C'��i��r���O�S�i	�zԹ{Y���l�b�m<��I}��P`YW�֨�����:�&�;��y.'!���R~����7����hO׽����
�|�+=z HE��|:�Ӫd\�尿���/��`���
�I}z˜$�L=��������Sm��x�ā�>��/�A��9SX���e��
�M�<�d�܈�e'tqh�))>KT��z88�H��l���=
B
���u�
��[�{8�
��k�L���G�pp/LJ����ph�΁�ph,B�QxH� ��Y0�K�)%
���T�ag��l��G{8$?
���!���{8��H���;�ʴSC�J�>Ϟb��'z�k��D���F2�
ʠ�h���HJ�ëf�j�4�]�/s|���a�qE0WN?������'��i��B�`�ӕ��{:O���u'��ȇ���䴘����nK���0PWw\�O�
+�
0}�
����-9[����.ԩ�8�#�m�Ii��n�
)���l{q>��* ��TNչG���	8�N\<�O^IG�o�d)(	�/�c���&N<��B
�T�-�1�o�bk11��i)�߅�&��b������#��1�{5�6�y���4|j�0�[6�EAº;o�"Zڀۇ���RJ'C��v����z���ӫ�ͪ�nȴ^������AR׉�# �u�!RVX��N5�. ��}�(Y
+endstream
+endobj
+2475 0 obj <<
+/Type /Page
+/Contents 2476 0 R
+/Resources 2474 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2470 0 R
+/Annots [ 2471 0 R 2472 0 R 2473 0 R ]
+>> endobj
+2471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.652 527.323 180.37 537.669]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.652 132.96 180.37 143.306]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2473 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2477 0 obj <<
+/D [2475 0 R /XYZ 89 770.89 null]
+>> endobj
+2357 0 obj <<
+/D [2475 0 R /XYZ 90 595.887 null]
+>> endobj
+2478 0 obj <<
+/D [2475 0 R /XYZ 90 591.404 null]
+>> endobj
+2479 0 obj <<
+/D [2475 0 R /XYZ 90 509.435 null]
+>> endobj
+2480 0 obj <<
+/D [2475 0 R /XYZ 90 445.923 null]
+>> endobj
+2358 0 obj <<
+/D [2475 0 R /XYZ 90 201.524 null]
+>> endobj
+2481 0 obj <<
+/D [2475 0 R /XYZ 90 197.041 null]
+>> endobj
+2482 0 obj <<
+/D [2475 0 R /XYZ 90 115.072 null]
+>> endobj
+2474 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F94 771 0 R /F11 621 0 R /F118 2438 0 R /F13 835 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R /F1 834 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2487 0 obj <<
+/Length 3164      
+/Filter /FlateDecode
+>>
+stream
+x��[�۶�~?��8�
�n;�I����u:Sۓ�I�;�%R��8����xP�C:ݝ�N�I .v�}�M��|������H2�i����$���Q����IJ��QJ'�<y2=�N^���6�.��զh��>�F��ɦ�/~<����3�Є9���4�-�޾��
�L(Y�|�����~ɛ��Q�`�K��&�x�3��f�R�&H&
篧\N�&_������5�<:��{���є�r
�L��"��� aY�h)���Ti�1��ȺՖ�j3�H�
0J	͸[�պ��|Y\����p��o٘���H�4�yҚd��Ӌ�`|���j칧|�j���e�)�k���M���:�j�/���=�W�wQ׫�X��
�6�'M�_.
+�b���
+_)`۲�]��
�-�ah��v5�7��e�tr�_'`r��%�vG��&Xs�G9)+�U�v�$�uY�o]ks�oܰr��vm��W����bN����"���'��3�����|��g���(��2:�u�F!ŏ�g
;M��������w��Θ�߱�3 R�as�lP#R|�@�$P$2PdnP��*Y
z�P��3���DŽ���O�h47$�3]5���dL��]�����Ʒ�+�f�9/�E�.��k\[U����ʖ�,
8B.�0��Z��
+���1d[�6"u�r�g(�	{����o��:��>1=뾕�
m2b�1�;%
vR
�(;��
+#�~�Q̌z�3�u{mC^8���׆��kC�>�
C���$b<�f�4}���`���[�
3�
6')�_v���8l&
[�Tǩ�^
�ӄ��]

v
2��zt1��Cv:~��cһ\>��������:眂�Ș�
�%�����ݯ3>�1L:Y���]�3����O��S������	�&�7
�HKh�7^W�Qct�R�H �m�jJF�8{)'M�j�uQm—E<�EO|����'�"M��� ��̩
�)z�|t
	*+�X����*|�T��в�P+Px�����]5���5�	w�@�5��u(Q�I��%;"��ò��fL������V��Y֟
�`�_���u�#-�����+��h����{lF�Ď.�M;{e�&X�ޏ��0�#0�ʐ0�nj�t��W
+���
>-���A��-3(��L抐4��C�q:Orr�THH_��]��xƏ�R�ijF4�
+��
'
��(����bL�A7�6o�4�ъ
�p��fې�7�fۀѡ��h��E��Y�}�������B<�vF9�9،4i/��t��
�	�zFG�,��
XT�z�2U
�d�YOl�諸Um�>�\mpr��DB��>/�0���u@�[nX�W�\�@5۠����|����CW at 6Hs�l�
�@�<Sv�����K?
:J�:#�v��Kl�
f������d?��N���O�I�(�m��o5�-�'a�*H
	e��F9�Qg�?
��a`�f}y;L
.G�	��&y,W
f��X 
+�C4�#�^1f&�(���.>�]}0`F��8I�)�'{� Svɏ�ZuftYC����h
uVB��v�B�3�����y��
�EF8�ȺVu�}��
+���;
+҇,�:#`�H�ޅ��)�0?-���J�\��ԤX�L�����C��ԃ�N�=���NE�*|�'��3�~��h�臟���!J�;Xں#�ܷ[|0>��i�uxwy;���P���Ι煍����N)`���1K�2K��W AƤ�(����UNS�7�
�*���OT��v
i/	9EFd��)��*��nt3�x� ��	��+FL*�C%:�.�
D#�J�؇F:)��I�E[�S�Y��5Y�,. �n x̀n���
�3Gh
��6��V��^��eQ�[N	������
�^ut�W��ÿj�T�
Qv����fIY'oV��ydq��N)�5���z�MQ�����"��2|����ZCp������������EXR���b�Z�*F/�Ah�f!�vF at 6�
���L�����~���M-A��O�2B�
��ʯu�r�:�̇738x��l&	���Ov�a��C��3N4�ei�b��
D۷7żaS��,[������_���g���b��k [...]
�����/I#0�X�
�
<�н*�cBb `����\9�F���c���!��R at wT=�!
+�@��L^��r	�%2�"ZWKf!,�ɲ���>�]޺�Wźʛy'�����ce�˦��~Ap��k�_?}���T�~���}�=b�_���j[E��z1��$?g=�,�
Q@�'<�l��RL�G
���-�r�~����_֧��Em?�I�G�)��ÅX,}C
D�0�eH�V�_uN�
�S�L�bKO
!$�Hs@�n&I3�EW�`�,����z�ZՍEX&��v[�����/�w�b	x�-�x�F�Ջ���,
|I��t~�s�����L�#����	�:]
+����
�#�Џп���a����Gм�G�g�3��0�Hz�;d�&h��`��s�����
�
V@1Oy�Tqׁ���=��������r�λ������d����&���ҞEw��~�
=���G(
�M'����Zr~
+
�Z��U'�4���/6��Y�������>֧��u��X��u��X��X��u�q�@h����s�q��[+���
_����I{���o�}7yaL[������S��� ��_���$��$�Dz�_Ab�m��ps�
� ��+H1�h
F���BQ�_H:T���!\H����
+�GI���פ�ԃO}�w�91\
�w��7���Z�u�N��0l�6��.�?N����|�W�|�ژ���u[
`��Ʀ����F��A%��Ih��
9��a��+�l6�gO�^n�AQ�ɬ^k�,����c���в)CY�J�,��
+O�ٔ
�د,�/���hnG�m�2|�;����_kX�ݎ��h'�
+endstream
+endobj
+2486 0 obj <<
+/Type /Page
+/Contents 2487 0 R
+/Resources 2485 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2470 0 R
+/Annots [ 2483 0 R 2484 0 R ]
+>> endobj
+2483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.949 265.405 162.667 275.751]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2484 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2488 0 obj <<
+/D [2486 0 R /XYZ 89 770.89 null]
+>> endobj
+2489 0 obj <<
+/D [2486 0 R /XYZ 90 720.814 null]
+>> endobj
+2490 0 obj <<
+/D [2486 0 R /XYZ 90 482.328 null]
+>> endobj
+2359 0 obj <<
+/D [2486 0 R /XYZ 90 333.969 null]
+>> endobj
+2491 0 obj <<
+/D [2486 0 R /XYZ 90 329.485 null]
+>> endobj
+2492 0 obj <<
+/D [2486 0 R /XYZ 90 247.517 null]
+>> endobj
+2493 0 obj <<
+/D [2486 0 R /XYZ 90 184.004 null]
+>> endobj
+2485 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R /F13 835 0 R /F75 562 0 R /F1 834 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2499 0 obj <<
+/Length 3479      
+/Filter /FlateDecode
+>>
+stream
+x��[ms���_�O�4�pxqi;��ɥi.����L�27�EۜH�Bɹ����x!	��e[��4��Ap,���ŚN�'t����g_1��j�'�WK'FZ�4<-&o���p��D�0��#���߾?�������������W�d���ٛ�d��N(6��w�V��.'���~F�R(Q؂�/�#����49�"l�N4SD�T��*�%�u<���3�2
�ʉ�ܳhu�n��/
Ǣ�Rv1͡�Ѵ����&]��M���9ͦ��N�ͦ����������Įu���)M]��+��7嚋rUT�F�
�}�Xo�K�`� 0aH���V*��d6�ٔ�Q�~�5Y
���ն����7�`]n�(�s.ac&s� ��@��%���K
���q=}K)�BO�W?�`��mu��Mn�c�
�_��z��o�M����rS,���˛��/�ES��qF\��m�۶ ����zSlG�����A�o[HN8l�o[E	 ��|\�v������
7��]���Y��3S�Pf��R��n���?jJ��H�7���
�Mzc>	����D�H�UC{�1�3��S�'~�ƹ!�������$c6n�ll��Z�a���p��"v�\��D �z�~!z�GH%���f�)��)�bL15Q�y%���Y�A���L�=4�T�`	Q6NԌ�|�?�������s
<�����
�:a\�@�ru��	b�H�)�fLMA��`(�j뛨4��J�����[�����()�xk�:CLfs	�=G��M��^�M�_,�͘�RK��x�q�
�՟�n����j��~#�q���7�̴���D�ɲ�x�n�	I=~�)?�����l�D"ci+�e��
���&އ3�
���c�9����&�ƅ���)�9Ef�mPlF
B����9�v�����_& \eG�MʿrX�pP�
f�Zo�Ը2�����U���T&�r��'��b��/
����������'؍�v�M�]��E3���pLR8�q����'h
���񬛙0�1v���oy��=�LT|L�
�W��+84��P��q�p��w]ԋ�0�E��nؼ)��h��@r���M���ECV���Ă[Ĺ���ǡ	�GH�(�Y�����W~t��u�
��Q�&\�E���[�Z��b'�*����ߪގb�ۅ�a��*��p����'{�3$	��ɢ�'�"Wm����Ve�R�E��L\�����j��Q�C8�d�Y��n��E��𼅞�z���M-I���4B�<��rZ�(xBⅧ�Y廱7�-!
n�ŸX�ld�.��,`d˱W3���16uhddz!@��>��BHg���+/�
�lz��9�p��C2~��3 `a���W!:ܙUR�N�$,�T�آ�5�i���m�$[�DF���Ń��M
e'��X�aD;�ˑT�T�4�M�
��q��o��%h �¦n|�s�<��Z��
+��v;�C�=PN�ǠF�,��t:N!X����
��@g
�	#x�@c׮���
>l{�
ޟ ���=��0��Г�/�_7��;s��v�_�,OJ8`���\��P��
�#">�:��SI2ں�
��0���I�*���u�@S�PpkTwA�b
_g;�XD��Ʉ����LH�;lz>3��<R)
[m�4��/�7���MAw�E�U����m?��*W $��
kC\�
@�� ������]����ŦʛE����u��9������C��p^�xq6y㨼���3�C¶���Zg0�Ο9"j=��lъW]� s�z��m�	�������pPؤ�#ȎGu��s
+|5���Y�U�lH?�Qt���`o���\
�
 �6=����!���\�ԛ�n����~Z1m�'�0S
_���<����|�
=�{�ܮ�u��Զ���v;��ƫW��7>�v�ޖ
���#����eU�0��n
"��>��kr\":�hdž�!/K��3��S���o�� E
+�~J�{
+�#�+�=(�@�L�f�f��)
b���.�	�ГSt& BcdqPZ� Fs�rn �sµ��;@��O

s���5�^>&k�|6��
>�k��_�U�� �y#��|hy�� �]Z���"u�$��4i��t׍)��&/��nWu�^8����
�-Z
P�b)F��2w�i� %��i�A�
+i3h��#
s�)|Wx�ͼʗw`��
+ Xu
	���-�K���}
X.��|W�o�p�U
�\�r�<�- �%&���󷜫$L�
`��X��{Iл�R��Ń::�=v�p6"�n�2�BX�t]�t߶
�P�O����w��r�U�ùzlݛ�O/���#>�f�5�HRqB~r�΄c2�ܷuc]���8OW]CUτ�`�����Z�d9h���[o��x;	��z��P&1f�aȽ�[ÎX{��2gh�9(�M
7L�n�ih����7c���-7;�S4:�n}�
Ԅf�}��w�
0�b״�.'q ~=&���c�����OS��b*b,�P~_
������<���G����"9����w
�g�����Θ\ |�@,C��;��
I��B�GS�u�H
���BR���e䤊� Z�պ)�3�j��K��3�/��P�C��%1��]���B}lN�c�b@/���
���Jy���J�w��{�XS�cUM[
���@W�}�	T�Po�H9nu��
+-ّ��}�sV6
��0�ƚ [�ôv8�.��kk
���.�PL�U l
+6�R"]��<e���.
�H�C
���©�f�S��@�6z-
���̨�.�ͭ�g���MH}J[rj�.����{�����9�,�Y�"�yHY���2Z$k�X��U�~�J�5���U����*]
S����JWGT���V��cJ��K����ꔥ�ꘪt��t	x"T�c�F:(3v�faB
S��H�U$U�FS���i�Jg��Gݳ
X���+K��Ma�Hq
�Jai�r�Kf6���j�,�1�S�u�p��_�.]0"�=�-Ò	���v.���/L7|oa�e��v

YE���p���i�.+����I}��>
�C}:6C`£�XP�-O��OW0d}��p�>]*p����
�b�F��� �E	����=������� 3�<��YR�/|κ7�G����n��
��0,�Pz)` x��l$b���X�vJ�}:*�L@�	���(2]=�C��@�!��7W�ncY�0���}����CAR�n��w�~_�;Ġ�
�}�� ����
T��fo$�b'
-Op,<N��
+U
�����d����`
 ׆����{�	
����?�@�#7z�`
�^h,�p�+��1V��WWC��n���3���_9^��m��m��	fmӖԁ�'�* �/
F���	���.��gN�zk2�[{�ݮ�?{vq{
��5��W������ͼ��`A+����"�0�qՑQ��g	r�_
c�B
+endstream
+endobj
+2498 0 obj <<
+/Type /Page
+/Contents 2499 0 R
+/Resources 2497 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2470 0 R
+/Annots [ 2494 0 R 2496 0 R ]
+>> endobj
+2494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.949 534.387 162.667 544.733]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2496 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2500 0 obj <<
+/D [2498 0 R /XYZ 89 770.89 null]
+>> endobj
+2360 0 obj <<
+/D [2498 0 R /XYZ 90 605.108 null]
+>> endobj
+2501 0 obj <<
+/D [2498 0 R /XYZ 90 600.625 null]
+>> endobj
+2502 0 obj <<
+/D [2498 0 R /XYZ 90 516.499 null]
+>> endobj
+2503 0 obj <<
+/D [2498 0 R /XYZ 90 452.987 null]
+>> endobj
+2504 0 obj <<
+/D [2498 0 R /XYZ 90 214.5 null]
+>> endobj
+2361 0 obj <<
+/D [2498 0 R /XYZ 90 81.969 null]
+>> endobj
+2505 0 obj <<
+/D [2498 0 R /XYZ 90 77.486 null]
+>> endobj
+2497 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F75 562 0 R /F7 803 0 R /F1 834 0 R /F10 773 0 R /F24 537 0 R /F91 766 0 R /F118 2438 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2510 0 obj <<
+/Length 3465      
+/Filter /FlateDecode
+>>
+stream
+x��[Y���~�_���,���0����v"ǎU�DJ�*�K�]��(� 
r%o~}�� 1�{�/�_����3��׍^Jx1��P�|}A��_��x�Z��%Vq5y��X:�ҒB��b���6�3J���>��yA�ߕ��my]��o�]�-�+|4Z�a��{��?_0��N��Zm&W����

�k&�
�z"���j����4׉iف���z)IA�
+���fU�*��k6|Q
BM����)֚hi"��nS5��������T���+��d�H�"���Ӷ^��Tv��x۸� 
sKԞ�<N����
o���A7��L�i��16���]F !�t�P@��]}ٕ�ln�w�^��Uf~m	7f��
'\�D�r�����'�T��K��*X2�Ϸ�������Y��Z'�ve�S�\g�U�(#G�WDi��;�'s� f�d?٢�-o��]�6�c��RLUYKD!�#S�P>d���oށ�I3��t6���^�;
����Ͽ�o�>�El���E��$��H�UƺQ��
c�
���t���=cŴmά�(��o\TW]j�Sa�t
�D��Y�����Kd_�8��f&��h+ƙxhs�iۍ
e�Nsg*(D��̙J�q#�g**-{���
P���.��fQ-r&'�k��
��gm/S6�8^���2���3��S;��i�@!���0�
x����׊7�qJ,���0j�[LH�}e�_�����ⓝ�n*?�&��ҏ��/���r��8����>V
��+��ow읪��v��R6~�^o���#���U��^�����]���;?���6e��n
� `�jX�,<<|Wu�eW5�Oas��p����b����7o���� #�
����<�p>V��D��~v� 
��h
 
�V4�m:��+��ⴇ�V�b��j+
�6{x�a�k��n'�u(�
[:����)�+;d����aJ	6�Yt�d9��]\��� ��#",
 ��s g��20ǃ��I�3�I
�b<O�E��f���nں�Z�O��ͦ�v��Q;��agxx���w���M^�6[/ХDj�t1������ 뺩���Ň�����:�ӕ("B��i�
E��9���U@ ��w�H�!���2뢎ú��irR ��[!�?�)es�����P@��,
N�66G�^R�����X�4䡲d���r�qi����A�y�ep@�sIL��u*�X��������_�5�=���
�>$�euS"��X��qQ_􏫶���O7�6����D\��md�����
8
+gѰ��A��	%��_ʮ./W��P�,��Pv�r���t.�=�ߗ-�#�O�Wi�g��!�#� ��� �%��J�;�_'L��I
Q�K��2hp�X�"�L�2%
	�X@�R
O�9�JO_�E������`N��F��8�
ɣ�<M�
kEA
�n�޶�.܅Lo5 �m̲_�N 3�>L/h*N�xkX$x�ƒ�\���b�)=�z�\�Iy���
ï���ڣ��g� ��)ǀ��A��c8��=��;}��y��
փ~����8X9�Z`�`�Gmh��M��IP>�m6
���ءGC���t���EH�/�{��m�Cכ��wժBBO
��W��(?d�����j�:O�w�@����20��:�p��Ǻ�$���0 w���n�
+�
x�!;ҸHs��ah�	��
d�v�4ob��
?>�%��Vxǯ�>l� �=#J��5RA6)�DJ�s�H�C.d�������GJT��DBF/�ݗgBO})0dp܆鱯o?�{a���ªD��7݀ۊ�r�����X�W+Pх�ߴ+WRs��}%D��n{_��t�p
��$�N��M�4Qd��D�Ceo����ciF�
[���fi}l��I�a���(��v=Ű"�F%$)��f���6�a���t�W����V�;�xu���8f�~�������D�~�hc�����<ē�=Ku��c=��
��� ڴ�x
:L�A�������;�K|�y�gx��y�0�7�C���3�� fp����0
�x��K�Ȱ�
/;/1`ǣ��c�%
�.L6�8�z�
"��
YP!�_�N��Gy��+�I�F�����<Ɠ9

r����}Do�K�b�a\$�G��]
K�a	��pN\�=���8��
��tH&�i�)`��
h>
ӥ�U@*5����
�� �n�B�eC:^
ʉa}��\�Jʥ
+����q��:�N��r�� yMY%�H!���O�2n
?��'�؉|Y&�r�'���0e�`z.	?q��J�̘���?�D��:��]��X��W�
m�4_e
2����W
��0�܇�����9�|ߩ\{=�䧸Z�eѽ��㖀�V�a.�=�<�=�V��:�L��~m��� m:SՙK��
� ���d:����<�w�
+��!��/�H�>��
=�B ���뀰Z���C�=��3�`h�O�$_u���+W�p��������A�^
nYjX�,(NN^d��!Fc��z���jŰ9xYZ%��Q{K:��z�_W�
�����>�P�
Cu �����Z�n[�
3�k��������˜�R�f�%Y�9��i��
f
C��e���

{�p��a�w1 �1�h�˜
��}�=U�C�}A
�_��
 ��(�W2
+�����ʡ)��G��E�y�~���� �?�.m`bz��^�OZ1R�qw��ԡ�(`�
􇡨M���J�{���[G���7�
�3�y�
s�� ��)��n�=Qa��&�d;��*�����Ɗ�Kl��ˠ`X~oc��i#U���6��д�(�9���>g�	��#�9#'
q�#�G� 4:'<��y
B�s"����#�
[�����u
c���L{o���f�d��u;c��
+;F�3/���n�L�%��:Ɯ�R�I��
e�.����a0�W�]������0�}�]�'J���5��"��q ��L?0(����ׇM3��`~}���b��a��
+���tS��a���s��
;���#!�	t�C�Nv:��S��
-(1�sM�
b$�w��X)��v��,x�
F���l�Akcb�`�*���&v���L�$
�>M�T���L��<Z~���S
 ׌�p�>O���۫�~؁����8�
+�&w�':�Ճ;�9�������`�v����v�^��Q;i��s&
�r���g�㿻(�
��>�rb��z��Ş,�.�}��촥�a�Z�3x�������C�{;j��
�.JM��
�o%v�7��V��gE1
Ւ7es[��=
d(@n}�2
2�6]e�	v���
/�O�x��
�Z{q��D��#7����˗���۪�&W��8��bAz��߼A�u۞��z�Nk�B�F��l;�l��p��w�{�c|1
��f-&na��'�_,��P
+endstream
+endobj
+2509 0 obj <<
+/Type /Page
+/Contents 2510 0 R
+/Resources 2508 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2470 0 R
+/Annots [ 2495 0 R 2506 0 R 2507 0 R ]
+>> endobj
+2495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.529 650.542 197.247 660.888]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.529 206.226 197.247 216.572]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2507 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2511 0 obj <<
+/D [2509 0 R /XYZ 89 770.89 null]
+>> endobj
+2512 0 obj <<
+/D [2509 0 R /XYZ 90 632.654 null]
+>> endobj
+2513 0 obj <<
+/D [2509 0 R /XYZ 90 569.142 null]
+>> endobj
+2362 0 obj <<
+/D [2509 0 R /XYZ 336.065 288.902 null]
+>> endobj
+2514 0 obj <<
+/D [2509 0 R /XYZ 90 282.262 null]
+>> endobj
+2515 0 obj <<
+/D [2509 0 R /XYZ 90 188.338 null]
+>> endobj
+2508 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R /F13 835 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R /F1 834 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2527 0 obj <<
+/Length 3305      
+/Filter /FlateDecode
+>>
+stream
+x��[mo����_�O-�������h���4I�w.
+��D��I�"ɽ(���o�.Eɲ�
P4������ݙgf
�xt;£��_^��R��AFR9��<R� !��l��t����#&5"F�C�������.��{_\^�xA�
��@J�����?��
��
aČ
}t�#N\�w���A��M{	
+�(�
˜�a�p�͛1�E�*զZ�	)�N�=Ƀ3���7��a�`c��L���%2Q�pFf$9G�G��dHI��w�'�MAF(P#l�����\]W7�j�TQ��>�mDR�|�N�:I�
����Z,ۺـz�W�\�ڟ�E���[�Ŋ�]���gLEQ�﫵�����m��U5��}?�٤����z^9�m`�BD'�w����S���rVnB{	�Lq1q8�
^��ĝ�����j6����{^��+��v����]����u�W���Ͳ)�۟�O8l�e��;L6�������y;��F��$X��YF�a���q�*���40Xt��=�"��K���R�M��o��y(��}F�A"�Q"�2)
��Q2��HU���/*^>�a2��٨B��l�f��2���ݶ�_m�	����V�9�U���&X�N=
Dv��f4�NXWP��v��Q�B���b[�2��Lt
3��<3�)Έ�g���[HX��E+�>�5�p���G���)O��g)3�ڙ2 [...]
��P�<��VDh4�nk��M�aM�0q�0S�)���ŧl���!IDj)��~a�Bt81�m��l����p���C��H��
+�/rәP
�aH�
�k�?p����o�+�wb6�$
�чlg�0l���8�
+<5


�V ?c"�Dy�a��b�&��w��.��	�u�,W�#\�=�ŪZ��u�l�U:�GO��F�l��0jeBL������W;UO^��Abe
��P�'���Z.J�?%(
��@��]�
���=a܀v]E�q�â}�Љ
X�_�
���#4�]��3��a�Vr���g�|��O���mcG:	���7���j��jo4��M��:��)�
�(W�#w��P�:����S�
��U.�Pz%�}�����M��(�$7P�F~bF�+H�!�8��]�+*8�`}
B!3�R>\V`�8�#.	�8���z��\Czz�s`��En)��+o�'T��z��ȴ��sY5D�x�9��(}�t�0��e;��U�U���?�C84;����)�X�EXF���;���`%
+�]����/@
�x�f�&�ydv"��rŀo6��C�F8���O�0�澙n<�0"ly�aq|
�
�Y9�pt���j��?�w�Sp��gs�u�
��~,���@�� �z
��t�;��
���qn�!��l�� ��]� �,����}3�fW��

���W
��
��vRuE��
TS�
��
+RB��A�7��P��$(av(���%|�'<hd)H��?G���k3T߂���!�xb<���)�9i�'K
�O��S��Z�\S����C�H�􈏽Sثv TC�.T�&�&���D��;�gtV~��o=�O��4�iC��1�ܯ�a
:�ʎ�i��A�oT�+j������'�I���F���3%��\�c��.z��Hؒ\Tv�`�Hɠ�wU�
r S΢�vb�4�2�X8#�P���X�g`yN������������6�D3��)�p�����؄Q����K�]�v�&��� �e7-ڠ��N1�ڇ�B����vApm�_F+m���C�ӓ
�5 5@�=l?gf
O�~�~���6}��1@��CD�e��E�C�5�LĨhF�0�a	�8�C#��'������F���9�7�
��e�FU�<�~h�
)
+����_w�S��p�?�;�`j�����Šs�7�p��3'8!`9'�
�fx2$����MǢIS�߿��&
	��k��P�j����ʹm���u�q�eL�⫐�n��
�	.ꛁ�R��T�ӈ'	p��q��Ў;ݫS�)�U���;�z�I��n�+�4-��i&����|��
+��t���xH��8�샛���C�,�Ih�
��� A0���/�a˦P��X�8Ͳ� xLX�M{mL�v4�}
���큓�NB}X�&�m�
+
+K��
�
1}�i�:�M�w�i��
+ٔ9�Ǔ�M8�]��L��GX%t�j(�	u��
�ܤ&�Y֬���U6��V��q䴯n�P���R���) "H at n0��e%-������_A ��[�߇��F �w��]VM���3R�y���L��
�	� 
�3�v
z2xQ��H5��`�TP��
)�|f

�����$�͊���* Ѓ��eE*0F]Uqԙ�T���^�`f�ؾzO?0�&
�/}=8��:��Œ�9q$�9fe�{���[��>��Aո��
Z��M47��b,\�?@5�O h3��_b�oP$F�&��s}O�
�M�aLp������6l�������I^٭����]���a������p��E��kg������U���:@Rn��^��)��g{\��������S�x��
~̹�G?
~ԃ�ß ?PT�r�gÏv���z$��E?*W��)�4q =�&� ��eV
@P��G�v`N.��z�
,����
D=ڙ��lvث�<oGD��.aB4GP
<rI�tD@�ȹ� [...]
Ђ*�
�칞A���T�,X�M5�x-���4�
+QEr
ʛP��
l�g�~N�{
��
��
D+��8˒��ϰޞǺv`b�
�p��5�cŮ: �wq҇D(
l���3"�P���c��z]5ժܸ���B�纫km�\Z"��~y(Vh�ؔ�9v�\�+�.�G�R��*X�U<�ce	̲

�#�
k���
��7��*�?4N/K@�c�>���I�����s�>�r'�Sa�

+I�݌τ��]��_Z�7y�����V�A�;��2��8i|i*�7���?���c!��}[6��|�]Bw�5tD��Jۃ��/���*���C���.
��0�t���m6�W/_^�߮��M�ž��
6�}k������Zu�
k~C�	��_]p�#
+endstream
+endobj
+2526 0 obj <<
+/Type /Page
+/Contents 2527 0 R
+/Resources 2525 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2470 0 R
+/Annots [ 2516 0 R 2517 0 R 2518 0 R 2519 0 R 2520 0 R 2521 0 R 2524 0 R ]
+>> endobj
+2516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.916 215.067 207.677 225.971]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
+>> endobj
+2517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.426 215.067 461.145 225.971]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.436 158.897 218.159 169.801]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
+>> endobj
+2519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.341 147.5 178.059 157.846]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.864 90.772 258.275 101.675]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
+>> endobj
+2521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.787 90.772 511.506 101.675]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2524 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2528 0 obj <<
+/D [2526 0 R /XYZ 89 770.89 null]
+>> endobj
+2529 0 obj <<
+/D [2526 0 R /XYZ 90 720.814 null]
+>> endobj
+2530 0 obj <<
+/D [2526 0 R /XYZ 90 482.328 null]
+>> endobj
+2381 0 obj <<
+/D [2526 0 R /XYZ 433.469 274.391 null]
+>> endobj
+2531 0 obj <<
+/D [2526 0 R /XYZ 90 267.751 null]
+>> endobj
+2382 0 obj <<
+/D [2526 0 R /XYZ 465.727 218.22 null]
+>> endobj
+2532 0 obj <<
+/D [2526 0 R /XYZ 90 211.58 null]
+>> endobj
+2383 0 obj <<
+/D [2526 0 R /XYZ 182.642 150.095 null]
+>> endobj
+2533 0 obj <<
+/D [2526 0 R /XYZ 90 144.013 null]
+>> endobj
+2384 0 obj <<
+/D [2526 0 R /XYZ 90 81.969 null]
+>> endobj
+2534 0 obj <<
+/D [2526 0 R /XYZ 90 77.486 null]
+>> endobj
+2525 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R /F13 835 0 R /F75 562 0 R /F1 834 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2544 0 obj <<
+/Length 2745      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo����_�O-����ˠ(po	r�$��m�&�AIk�
E�H*>ݯ��DʴbǼ�>�\�����<�
)����L��yq��%�~wyv�\�I�RI���z���)�I:�Q�����4�la���b�6e��yU�P�M4�~�����˳_�����	��d�>{�O�0���R=�u��N��wg��ឝξ�
�G"ě�A12��qҚ���Zc
9N�
CX
�������VHq
'���)aӰ9&��w?^Ȕ
�Ⓙ�$��qƼ�� pJy����˨��i��pz�q�N�w�]g����=�]LM�
B���,�
�H�Q,`L �Uς��y��әNvϞU�0 at 3+F1 at K�*�3 ���1
R�q��
C/'1����Y�)/o�r��e�
����~����%�]�J#:�~5A�h�o4�
����2��h�SI}z}�[ݓ�ɔNf0)�Y��lZ�I��lw���ຣC�yL�Mcځ|�)@+�B���
��Q
XI��E��ss=�8�jcQ.�f fAR�h������c�a�����$����]�����Q@���)M��U}bO�^�pfk��2K$�=vC���Ȍ��%�̞E�A/"X�U�q��0��OS8dX��7��o_�M޻Y vW
�
P
@W�b�^�zwEm�ޱ�I���m��J��Ew��� _�@�V��)�e0Xx]���5���]�6�Z���������\��$j>��ʥ�x��g�beJ��/`���^]���G�L��GG��)�^
@����5 c�
5 Q{��-�W�2=]H(�$����u��s��:^}L!��(&�B�Yd�����a�X`
+���J��Vch��Fɾ������(���:�rĚf�
P��l�����G�[�
v	�Gc�{D�=7�~��@�Q�(���R����fQ�D�+3�²�{�ő��.�
Y�*8]��V3�
l:f�~o�� �X>�9)ӈ):Ȝ�>�9���4s6@��'�9'�D���`lO~v��?t�x�F����9�D�c
a�z<���^W��u���a>�sV�i�cj"�@X<��eB�(���Ð@#�`i�#
Bs
+�\9���)}
N�
#h�4GU��|��9E1�t��4'���m
�*��
��`�
-�ԣ�L9Ts����<�6�)����P. i���
+	SD�L�����co�h|�fwA�W����Hշ�������S�l�r�"*i��xx�/%ܨ~�[~���_?�p9��nϯ=�=�����w{~z~
{~���u���P�/�=?�z�;��e(��5��:��S���g�
EW__�{��ݫڃ`�'t �r���f�mT�b�����	։1��/�
��Try��T�$�ā"�+�^�b	�:'I<�� �I�(@�b#�gA�V�C�
����	�&5Ri�7�X�Eq�
��k���Cr)����z���ۜ(�W�:�o}^n�����n�*f��56�[�M ���5��
ZK��r�7B��,I��U�X��qR^�mna�,�������7
a���l
�0�b��H
U�~MVT
��`u��l7`���Kc�ζ(�#����#�wC/1�'�I���{
$LI!�'��]����@�I�w7� m���1L/m���
٭�P*���Ə���
RG�;� �{� �]�$��m�L���r�+�c�&yr됻^6�m(!��9FZiN.\
*ބ��u�%�
����	n
+��s��W�Ayy�������pH��4^M�ʢ�a����c��
��U(��v[��н����爊/�i��I��6�"_�H�N)x�i�[x>��������^�Nn:��\�ނ;HF�
.J�8
��b�`Z�
m�.�,�'�����+`��
$��bX� d)���h�<��1�,��&��=�����m��S��
+�4��w���:d�îi�:@ֵ�u$]g!%� {7�kQ��>
x�ˢ�*��!��ɣ�����MU����ϠO�+1
{x]��/a�	�
Na�aF#�U�b2���5/¸K�l�o\LÔ
b��쏅4#i'���
���Z�9L
����e�ZAfq��0�]
Vl� ؄5�&&[��~�[�x
+0�	92p`��Q�Zl�tg�c�1u:rzdU
+B<���i�3�,�!����f�d`�9��)��3h����|�-�=��C��pY9�S�"
Ҁ+?�&��T$Y
��z�Q1��]R�5n�nN$�g`�{͇	Ư����)�	� 
 / 
�"o8zm~��ޢ��r
z:�>P�( �IQ,p�P�w���߫p���1r���?���'�p
��A�@�y�� �G��
+����[)�d1I\����R��@1FJ��
�J�{���o�54A�6�œ,S	��{}�e�=8��>� �u^��� e4��}�~O̓Y"�|��c�| �
w�w�:��|s�fXjЄ�))�h0ErwdIn����M|�

]P��W�v�m,fS��w�����)S�y����8;�m��� ��{aŞv��7u�(����o�����ۢK*0�p@ �+$R}�?��6��c(ܿ��m��L�N�}�F�:L�Z���;��
�4�W����
s�ˆ�	��v���|�����A�s7�;{�cT�w�ב��ULܼt�,�Uї�7�4z
���8� ���{���k6��'�����6@
+endstream
+endobj
+2543 0 obj <<
+/Type /Page
+/Contents 2544 0 R
+/Resources 2542 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2552 0 R
+/Annots [ 2522 0 R 2523 0 R 2535 0 R 2536 0 R 2537 0 R 2538 0 R 2539 0 R 2540 0 R 2541 0 R ]
+>> endobj
+2522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.184 673.894 267.558 684.798]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
+>> endobj
+2523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.961 661.939 220.679 672.843]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.963 605.769 257.826 616.673]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
+>> endobj
+2536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.787 605.769 511.506 616.673]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [114.275 537.644 267.101 548.547]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
+>> endobj
+2538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.961 525.688 220.679 536.592]
+/A << /S /GoTo /D (index_BMPZ10) >>
+>> endobj
+2539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.107 143.45 216.873 154.354]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators) >>
+>> endobj
+2540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 75.309 180.37 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+2541 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2545 0 obj <<
+/D [2543 0 R /XYZ 89 770.89 null]
+>> endobj
+2385 0 obj <<
+/D [2543 0 R /XYZ 225.262 665.092 null]
+>> endobj
+2546 0 obj <<
+/D [2543 0 R /XYZ 90 658.452 null]
+>> endobj
+2386 0 obj <<
+/D [2543 0 R /XYZ 90 596.967 null]
+>> endobj
+2547 0 obj <<
+/D [2543 0 R /XYZ 90 592.484 null]
+>> endobj
+2548 0 obj <<
+/D [2543 0 R /XYZ 90 512.327 null]
+>> endobj
+2298 0 obj <<
+/D [2543 0 R /XYZ 90 489.951 null]
+>> endobj
+2549 0 obj <<
+/D [2543 0 R /XYZ 90 489.951 null]
+>> endobj
+118 0 obj <<
+/D [2543 0 R /XYZ 90 278.793 null]
+>> endobj
+1554 0 obj <<
+/D [2543 0 R /XYZ 90 241.96 null]
+>> endobj
+122 0 obj <<
+/D [2543 0 R /XYZ 90 241.96 null]
+>> endobj
+2550 0 obj <<
+/D [2543 0 R /XYZ 90 160.21 null]
+>> endobj
+2551 0 obj <<
+/D [2543 0 R /XYZ 90 93.006 null]
+>> endobj
+2542 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2581 0 obj <<
+/Length 1290      
+/Filter /FlateDecode
+>>
+stream
+x��YIs�6��W�qƢ@��o�k{�ڮj��8E�n ��/VJ�3�SьO$��-�[� �������`|L�Ȋ|�7f�F���,�g_��0
]���1�Cˎ|�H���v;;������l�4��0l�޳��H���W`dl���I�Sa�΄=s�~�� (V����5Bƚ�r�l'�@h�mٶ��ci�
'&sB�i{�$�r$�B�+��s�u
XR�������A��g
+q��z&ɷC,��*�{-՜������՝ڂS��a��I0��B�I�M�V�
�k���$]����Z�
#X�I���%L!!	��OT>V�H(�J9�>�K
1�B�B~7�X�U=�� &���+TR��VE��bb	�ks�/|�#&���ܱB"9��8^k��0� P��
Cx��t'~��iڶ=L0J�9l�8|
���õB�S���d���4���7�YÔj�:I!7z�Rϖ�2
o��H�B�?TU�x�@d9i��S�3p;��늹�J��m�
�W%�����oٝ&\�
+��
+? �s�Q�Q	
_p٘Wv$T.�6�_ȷ
�K

X<[�x&�>�v�]�I
��z���߸`߮�9e7.��I��!>��媀�
+�*�7ɠ	w�|,��: �(ݚ^��%L������,��K�������	ʷ�3*��B�\O����T&�=����@�{x|�P6'4;=%��s�Zo�A
��b��@*��?ט���n�E�`��5ߤ��J
�^z��lO�$GT�Y���
���/�S&���.
p_?��â��EQ�����������x�Qw��#�]�ԉ�KiS��5?��N���+X��
����]�~��;�I
�jTa�Ozld�?�OiR.�����k���P�UH$�V�J�^���P�Xp#z�s{�D��		���<Wk�Nޭz�

�50P{�+�ʷ14����K
	��>�J���
sH7P�IS�o�0�X=Uf���7��<������Oa���T8�6
�%	�a�:�c�7�降��zWg�È2O��
tVM��H��t��Ы�7W�x�+v�*kܠg]"��U�떰d��l�+�5���޵�U���ثj.rٹ���l����ͅ�X�3y����B7��H\y<
�� p������k������T�؎܈���{���{߳��ћ�q�tpy��?�),�$�J���9��d��߶e3e����9�0��C}��}kX��_y�<�r��~hIi}:
�W
˅�V�K�G��P�m���0|q��F3�??�v�
+endstream
+endobj
+2580 0 obj <<
+/Type /Page
+/Contents 2581 0 R
+/Resources 2579 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2552 0 R
+/Annots [ 2553 0 R 2554 0 R 2555 0 R 2556 0 R 2557 0 R 2558 0 R 2559 0 R 2560 0 R 2561 0 R 2562 0 R 2563 0 R 2564 0 R 2565 0 R 2566 0 R 2567 0 R 2568 0 R 2569 0 R 2570 0 R 2571 0 R 2572 0 R 2573 0 R 2574 0 R 2575 0 R 2578 0 R ]
+>> endobj
+2553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 686.193 170.956 695.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+2554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 658.474 180.57 667.321]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
+>> endobj
+2555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 628.699 198.482 639.603]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+2556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 601.957 190.183 611.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+2557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 574.238 210.149 584.166]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+2558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 547.601 168.495 556.448]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+2559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 518.802 192.544 528.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+2560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 490.107 213.018 501.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+2561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 464.446 179.274 473.293]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+2562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 436.728 177.591 445.575]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+2563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 407.929 200.833 417.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+2564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 379.234 185.9 390.138]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+2565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 353.573 154.368 362.42]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+2566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 323.798 213.595 334.702]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+2567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 296.079 273.36 306.983]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+2568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 268.361 220.22 279.265]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+2569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 240.643 216.365 251.547]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+2570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 212.925 211.912 223.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+2571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 185.206 271.677 196.11]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+2572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 157.488 216.355 168.392]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+2573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 129.77 183.698 140.674]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+2574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 103.028 194.218 112.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+2575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 74.333 246.252 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+2578 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2582 0 obj <<
+/D [2580 0 R /XYZ 89 770.89 null]
+>> endobj
+2579 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2610 0 obj <<
+/Length 1167      
+/Filter /FlateDecode
+>>
+stream
+x��YKw�8��W�XK<��]
M�N�zbw3IG��
 *�y���ӯN�Ij�dV���t��'������|0:KB'��q0v�wN
+�$J�x,�
+��M}�
! ��z���(�zpI���E���"��
����ƬE9ַW�SN\��.���ȝ���������� 
+���l�''��߁S��O��t�<��j'
+Bq�����0
�mO�`��~N�BB��Mh��3�z
��
+1f
H8tap]�W�+�,�s�`�8���q\
���3xƑ��8
+�!�} #��H���`�M��u!왖$^�`�J���;��|���>�q�#_�_�b?>�fK���ߒUS`35Ey'�[y�� W�
��z������dS�����ۼ"�:��Q#��c�����5�(vI��~�9Z�U
Moc�O
+L
��y�'��)�8���R�XI�l�M��t���	T.۩;h=ٹjn^����N����:NH]�u���.a��(����z9#�WJ��F,���֬I����[eӄL��&i�ڶ*m���\��0xx�}��ի�#
~���D!��e/�#��%�E�պ�����q��^h*���J�
?
+�{MƳ� ^6
�bJ�S��� j��VZ�U�z%�m)y,kt[�Lm���/���e�5���K�V�h�xz1ͦ����J���TaHW�sZ��&����Ġ*��hA3�fD�L3L-B�Hj�P�흧��.�8�$EW�F�#1�U�¤
�j�E���:���ܒ����%k���ݶ~�o� Q�
i[�+�������)�K���e�,�c���!�����/f'��R,<A�xw;��.]�dΎ�����ݒ��I��퇲�͚�
�!�7;?&i��
uŘ@���R��0�^w�h��#�����-�[%M�o�S
Ѳzz�#�Ù�Ո-��,V�Z�����$9ۍV�A��RO����lI��rUc6
+L~g�R������q*�r�?�P#W����=��O���{�����b�(�c��nq�N?��7��o^
���/�Y�#]����n�aK�D�t������J�۱�?䏳x
L�Mb�H�Yr��>ݮB�,���?�֖/���~�&�&[1#:k��[L���2��ˆ �� ��H�@���V퇦ctQ��)$o~��
���
+endstream
+endobj
+2609 0 obj <<
+/Type /Page
+/Contents 2610 0 R
+/Resources 2608 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2552 0 R
+/Annots [ 2576 0 R 2577 0 R 2583 0 R 2584 0 R 2585 0 R 2586 0 R 2587 0 R 2588 0 R 2589 0 R 2590 0 R 2591 0 R 2592 0 R 2593 0 R 2594 0 R 2595 0 R 2596 0 R 2597 0 R 2598 0 R 2599 0 R 2600 0 R 2601 0 R 2602 0 R 2603 0 R 2604 0 R 2607 0 R ]
+>> endobj
+2576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 235.154 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+2577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 681.979 156.022 690.826]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+2583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 651.887 180.928 662.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+2584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 623.851 195.324 634.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 595.816 208.036 606.72]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+2586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 567.781 247.638 578.685]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
+>> endobj
+2587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 539.745 265.052 550.649]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common) >>
+>> endobj
+2588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 511.71 247.339 522.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common) >>
+>> endobj
+2589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 483.675 245.117 494.579]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common) >>
+>> endobj
+2590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 455.639 237.934 466.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator__Common) >>
+>> endobj
+2591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 427.604 248.305 438.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant__Common) >>
+>> endobj
+2592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 399.569 279.478 410.473]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant__Common) >>
+>> endobj
+2593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 371.534 282.746 382.438]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference__Common) >>
+>> endobj
+2594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 344.475 190.901 354.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+2595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 316.439 201.601 326.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+2596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 288.404 217.471 298.332]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+2597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 260.369 219.115 270.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+2598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 232.333 220.778 242.261]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+2599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 204.298 201.401 214.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+2600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 176.263 202.507 186.191]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+2601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.544 160.596 273.474 170.501]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+2602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 147.251 209.71 158.155]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+2603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 120.192 210.268 130.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction) >>
+>> endobj
+2604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 92.157 229.087 102.085]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction) >>
+>> endobj
+2607 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2611 0 obj <<
+/D [2609 0 R /XYZ 89 770.89 null]
+>> endobj
+2608 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2640 0 obj <<
+/Length 1253      
+/Filter /FlateDecode
+>>
+stream
+x��YQs�6~���0W�C�.qҹk/I/��!�x�m��8I�/��+	a�4����BB��~�]i��~

OGg㑕�I�G�tn%��F�Y�v
9�ӏ�(�]/�`��=�8���O����t:�:�`Y�����J���-�2��h!w���Z}TZ�?�ga]
��
+�B�P��"7����\�� n|?T��4�z"d���pآ��Y}��>�Ղ�H�>�L�U*rZm��}
�%��(�x|ߍ�z�<�e�
%^#P͚9AhS�C�}���W,�n0g4�[ ��$bI3ݞS�3���R˖��`FK�W�!;D[�> O^�����N�}^-~0:
|5Ϙ�z^�W�zN0&'�������K�
m�D���ASI2@�Q������h�!�d[$o���5�
|�SXӼW�&j]��ʿ������6�5l�ai��n�my_��Ӑ�^�j#����X<�$#s��0��A�0b�F�ɻw�F��ʼ���/ӾF�
,�}{���k�t��Jh\^��5�+���?�{�����g�e#3K����u`����qY�-�F6�'�E�B?as���l�ٳ17�n�+��WO���f�&a���1��I|�� v���:~h�	V��G(��I�:����k���n�ɰ r
�I�vy�q�ٛ�C� 
�nFt(1d��~3�	�bvVP,�C♝~��������׆-$S�",O�V�n�
1N
,��W	D�$�^��	ի��4��'?���?!�B�d9�+H�$=֮i���ժ���@�aG�$���='L�߁ ��	���X�W ����Ӫy]�)��P�����3�$��u��7aj�k͇��(<�~��Î��$,�eF{bb
���D���)%�R�7ao�u��KX�%-�Yk)�؏��Z�\>���ۣ���aQ�N����G�����
3����iI��kZ�
��=L[��:�I&��kH%e���2�ט9���=�.j°�lO[���ڐ �
�5�0����M�Ta��\u

G_�C�v��^�����l�3?i[�>�py��6�Ћ��&�ӲsG(U��އJ(�
�fm��Z�[�
�
�u.Gښ��޴�/�ݱ?z�_���`솉���u�\�Ǿ�ՠ��t
}(Gք����!�n����(t��7J��w{����v��?�j���}�Bt/W���y��I
c��
G@�1����w
�7�
5�b#7���K!�_���V
N�����n&'��Ʊ���j))#f�T��G
��ip
+endstream
+endobj
+2639 0 obj <<
+/Type /Page
+/Contents 2640 0 R
+/Resources 2638 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2552 0 R
+/Annots [ 2605 0 R 2606 0 R 2612 0 R 2613 0 R 2614 0 R 2615 0 R 2616 0 R 2617 0 R 2618 0 R 2619 0 R 2620 0 R 2621 0 R 2622 0 R 2623 0 R 2624 0 R 2625 0 R 2626 0 R 2627 0 R 2628 0 R 2629 0 R 2630 0 R 2631 0 R 2632 0 R 2633 0 R 2634 0 R 2637 0 R ]
+>> endobj
+2605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 235.712 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction) >>
+>> endobj
+2606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 680.327 255.637 691.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) >>
+>> endobj
+2612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 653.674 195.872 663.602]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
+>> endobj
+2613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 625.068 247.189 635.972]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+2614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 598.414 205.835 608.342]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Domain__Product) >>
+>> endobj
+2615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 571.866 187.005 580.712]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+2616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 544.362 160.373 554.267]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+2617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 533.277 174.034 542.124]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+2618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 504.566 211.124 514.494]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+2619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 475.96 268.947 486.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+2620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 448.331 286.66 459.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+2621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 420.701 284.429 431.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+2622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.845 406.213 197.225 416.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+2623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 393.071 269.505 403.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+2624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 365.442 293.574 376.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+2625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 337.812 308.249 348.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+2626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 310.182 285.306 321.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+2627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 282.552 287.208 293.456]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+2628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 254.923 177.91 265.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog) >>
+>> endobj
+2629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 228.269 216.086 238.197]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Threshold__Watcher) >>
+>> endobj
+2630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 199.663 222.98 210.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+2631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 172.033 205.267 182.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+2632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 144.404 203.045 155.308]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator) >>
+>> endobj
+2633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 116.774 195.862 127.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
+>> endobj
+2634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 89.144 206.233 100.048]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant) >>
+>> endobj
+2637 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2641 0 obj <<
+/D [2639 0 R /XYZ 89 770.89 null]
+>> endobj
+2638 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2715 0 obj <<
+/Length 1547      
+/Filter /FlateDecode
+>>
+stream
+x��Ym��6��_���L�I��o>�nl�a|�4�0����p ��v��+!��-w;i>B��}�h�+n�nк�Z7}]�L��$��
8p�b������{��І  � �4
+|G� ���
�2
�Q8O��IhK*�� B�&X ���
+��QL��n
+o��G�>� 6p�����-�����[��?8 ʦ��Ut�8E��s�M[w-Pz v=���'h�"��!��$���L�{�V�o�u�e�bN�*�r�.ĕ�:	�0^�Nƹ�M�,�|O���o*��-�b�$��"qm����S�:� �T{C����}-RA�y���"2_7�1��$��9@�] �1�BH:�M�|
�`�F~1��47E��C�
oi;m`�(&(�?�n�D�9�>�$*[쐠�<sJ�*�C
�
���+l����d/ђ��
+�Wd%�u�}/
/����ϗ�����;,q�fҗ5^��V���
++l ��<
+3�.b�)?$�0Mj�'(��AK�t�peӅݖd��͗Aϩ�r�ÿ���<�0B1!�OD/&s��-V���&���.�%�oI��w�leqv=�ֆ-BQ�>���%���8j�cL1�z����ր1�_��KB
w���
�p��0^^��/�%��'��xK
��
�rln'�U�)��yW�L�A�j9cV
�~*&;Z۟
,��݉���C��|�c��
��T��I�]!�+�K��N[E*d�0�*NU��9�%�
1X��8��
���V,��6B)NA�L\{F�6�6�2�p��m�8��I�*
2��^�����
wF����ʍ��l����
z�j��D����i�;���!*��ES-���~�6�r�bx|Z��h]L������������S
	2��/3���
ΗG��V#�
��s$T��치4�8Ӏ2
s	a�]��Yjx5����h��$Z6�:s��V�Z���al@㭂Q�
+�y�
m5g �1��x<ן�oj���Z v���z�8Cd��ud��(Oz��Fͽ��ny���7���;��akPgh � f�=yk�FbO�3�6S"%m���5۵
ך�*�s;:c��F���~��N�q!C�
i���IĪ%���Uӂ�I�hA��O�q\Y�i�?F(,ŏ6ۼ�ˮW����sCr��
�K�vw2�{~�iM.S��Q��
�"89�g�����ի��r
�a��]k�����cŎiA��e�~����ɭ^y�
�r��E�5�k,��g�LJi���T�y�$����!��:_��X�]3̳��,ʫ
D1���9y;-���S4O֍Wy�Xw�Z�7�?��S���c7���z�����x�[o؃e�t44�ĖSr'HxxI�I�.��^��K�g�b�.�fy=�C��Hi���r�S�y
�[v����
�-J�oߠ7)2�?(
+m�}���?5���ސ�fu7��@T
�*�y���o77��*C�J��x=��b�@7�l�$��qc��wb4�*���I


���u���^�d�e��0��^�A~����c�
+endstream
+endobj
+2714 0 obj <<
+/Type /Page
+/Contents 2715 0 R
+/Resources 2713 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2552 0 R
+/Annots [ 2635 0 R 2636 0 R 2642 0 R 2643 0 R 2644 0 R 2645 0 R 2646 0 R 2647 0 R 2648 0 R 2649 0 R 2650 0 R 2651 0 R 2652 0 R 2653 0 R 2654 0 R 2655 0 R 2656 0 R 2657 0 R 2658 0 R 2659 0 R 2660 0 R 2661 0 R 2662 0 R 2663 0 R 2664 0 R 2665 0 R 2666 0 R 2667 0 R 2668 0 R 2669 0 R 2670 0 R 2671 0 R 2672 0 R 2673 0 R 2674 0 R 2675 0 R 2676 0 R 2677 0 R 2678 0 R 2679 0 R 2680 0 R 2681 0 R 2682 0 R 2683 0 R 2684 0 R 2685 0 R 2686 0 R 2687 0 R 2688 0 R 2689 0 R 2690 0 R 2691 0 R 2719 0 R 2692  [...]
+>> endobj
+2635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 237.406 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
+>> endobj
+2636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 679.435 240.674 690.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
+>> endobj
+2642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 650.914 192.395 661.818]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+2643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 579.638 237.655 590.542]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+2644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 551.117 249.819 562.021]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+2645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.29 522.595 271.408 533.499]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833) >>
+>> endobj
+2646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.29 494.073 270.86 504.977]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a3bb2c0ddb1b766959ee6149bb52a7e61) >>
+>> endobj
+2647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.29 465.552 271.408 476.456]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) >>
+>> endobj
+2648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.455 437.03 310.472 447.934]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+2649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.199 366.128 193.225 376.659]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8) >>
+>> endobj
+2650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.317 366.128 266.297 376.659]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a96b8890edb38e9960c455aa178e508ba) >>
+>> endobj
+2651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.946 366.128 370.997 376.659]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8abd640c30f757e4ecccd08ac527536ca6) >>
+>> endobj
+2652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.646 366.128 467.956 376.659]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a979f37a289d4cb316643f1dcc07ec7cd) >>
+>> endobj
+2653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [471.605 366.128 513.996 376.659]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a9606fc251d767040929d3e2645dbb446) >>
+>> endobj
+2654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 340.909 204.739 351.439]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98) >>
+>> endobj
+2655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 328.954 168.485 339.484]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98af4fca65e2503d4afea11aa9b9da7d51e) >>
+>> endobj
+2656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.474 328.954 205.566 339.484]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9afce68d66f8c8eedec345f8df2e822f) >>
+>> endobj
+2657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.555 328.954 241.541 339.484]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98ae9e9040024adaad2b7a0d9ceea0c8b62) >>
+>> endobj
+2658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.53 328.954 278.622 339.484]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98accf532c4e56a06e520b6b3f638371667) >>
+>> endobj
+2659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 316.998 148.002 327.529]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9223ac459b80b2eb397dd7810be7aa07) >>
+>> endobj
+2660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.991 316.998 183.977 327.529]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a44ed03f4b908d58ac405493b10be3012) >>
+>> endobj
+2661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.966 316.998 221.058 327.529]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c) >>
+>> endobj
+2662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.047 316.998 264.226 327.529]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a468389fd24e4a478d296cbcf6b104eb0) >>
+>> endobj
+2663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 303.734 165.994 314.264]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 291.779 161.84 302.309]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a3d884f787b884a260970cdef004fcc10) >>
+>> endobj
+2665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.829 291.779 192.276 302.309]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a9f5dce9506b72773425c0504845d8e4e) >>
+>> endobj
+2666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.265 291.779 221.606 302.309]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) >>
+>> endobj
+2667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.595 291.779 252.042 302.309]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3) >>
+>> endobj
+2668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 280.167 141.357 290.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ad5e386c6a05c9656eac42fe9e2cdd8b5) >>
+>> endobj
+2669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.346 280.167 170.687 290.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b) >>
+>> endobj
+2670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.676 280.167 201.123 290.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) >>
+>> endobj
+2671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.112 280.167 237.646 290.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) >>
+>> endobj
+2672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 268.212 183.419 278.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8adeb9e65ceecfb8271acec22e00a226ca) >>
+>> endobj
+2673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.408 268.212 233.78 278.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4194f750c76fb24d6e5930e1696076c4) >>
+>> endobj
+2674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.769 268.212 287.469 278.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) >>
+>> endobj
+2675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.458 268.212 394.278 278.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057) >>
+>> endobj
+2676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 255.913 226.577 266.443]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) >>
+>> endobj
+2677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.566 255.913 342.233 266.443]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) >>
+>> endobj
+2678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.222 255.913 450.148 266.443]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a02347568b111860e1ac15154a1832252) >>
+>> endobj
+2679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.136 255.913 488.882 266.443]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) >>
+>> endobj
+2680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 244.302 197.815 254.488]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae0c660bfcbcd3d10c3e764e22f41d0a1) >>
+>> endobj
+2681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.804 244.302 263.668 254.488]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a057025d0ff550a2226a0a1273c84b4f6) >>
+>> endobj
+2682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.657 244.302 344.465 254.488]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) >>
+>> endobj
+2683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.454 244.302 421.386 254.488]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a5912e00d1de38a643d48af1f0e5dd35f) >>
+>> endobj
+2684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 232.346 172.351 242.533]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) >>
+>> endobj
+2685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.34 232.346 263.668 242.533]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a930a62d56d7231cdb1ed57e1d3eff0f7) >>
+>> endobj
+2686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.657 232.346 342.263 242.533]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abd1bad185f4622d07b171767dafc78b6) >>
+>> endobj
+2687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.252 232.346 413.655 242.533]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab) >>
+>> endobj
+2688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 220.048 178.996 230.578]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a261922c7bb53bf71459671df868e55da) >>
+>> endobj
+2689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.499 220.048 334.007 230.578]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8) >>
+>> endobj
+2690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.51 220.048 486.816 230.578]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a202263943c451b9fdfe003b2bc8d0b1f) >>
+>> endobj
+2691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.319 220.048 513.996 230.578]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
+>> endobj
+2719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 208.092 205.018 218.623]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) >>
+>> endobj
+2692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 179.197 198.094 190.101]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 167.959 187.285 178.146]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2abeee33de6f8542b0228161d044640eaa) >>
+>> endobj
+2694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.274 167.959 245.397 178.146]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) >>
+>> endobj
+2695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.385 167.959 328.405 178.146]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb) >>
+>> endobj
+2696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.884 167.959 441.57 178.146]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aeafcc7ca16bda73dc6b0f7deaf9470dd) >>
+>> endobj
+2697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 155.66 245.406 166.191]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2ae0c0414fd69996a2edb8ea476ab236e1) >>
+>> endobj
+2698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 126.765 223.927 137.669]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+2699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.698 126.765 282.945 137.669]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+2700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.934 126.765 321.69 137.669]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+2701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 98.244 210.278 109.147]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+2702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 86.662 149.656 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) >>
+>> endobj
+2703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.645 86.662 210.538 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea556cc08f48e769b9c15bea83d5d883a1) >>
+>> endobj
+2704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.526 86.662 296.326 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aead8db7109fb4bb50360b05800dd245416) >>
+>> endobj
+2705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.314 86.662 379.892 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea94cf20719046117aece5acba61dcae4d) >>
+>> endobj
+2706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.707 219.394 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab) >>
+>> endobj
+2707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.383 74.707 283.583 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea8191bdbdcd041a9859ed465d16062ab1) >>
+>> endobj
+2712 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2716 0 obj <<
+/D [2714 0 R /XYZ 89 770.89 null]
+>> endobj
+2717 0 obj <<
+/D [2714 0 R /XYZ 90 596.948 null]
+>> endobj
+2718 0 obj <<
+/D [2714 0 R /XYZ 90 385.062 null]
+>> endobj
+2713 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2789 0 obj <<
+/Length 1607      
+/Filter /FlateDecode
+>>
+stream
+x��Y[w�8~�W�m�9�c��A0]w��K/���P�w�E}I���ߑ,!@bB��>�Ț��7�F3�,�Yx]i�*-Sl�6C]	�,��-��7>��U�2z#��%!� !6z�뎜�hH�U�Q�k�+Y@��.��0
+����
����ږp�&�����\��ۊ�M�~2�lM��4C��!ŖdK0�����$��]��pB�Ĭ*�\�
yÿ��H��5�J���j>+�~OH�T�eY�Q�q�[<�N�
UA�%	�
\E��-H�˅�$ۚTE
V��?v{
���.{�~���>n�=�c�2�c(b��ѫ�h[�f� �l]/"�G+C��{�k���O�p��tIV
+�9~����øLp6#�)��-�t��2
��;���!3����utܮ�q����^�D �h��>ѧ��Bd�~ՒE�$��f�Ȇ��H��ɢ�yn��
4DZ7���-�����b0K�KE`o�h�Y%���q���
#ehO���ƆH�
�P+��S^4|��q��4'X�]4���]�Y�\�Sx���`�SPُ`һ�C8�,�*�*�x��U���
+�wΠ������a	t�	��M�喃�)�{<��
�
�n��%��ɳ9�t�C�,�����9Ǩ�ւ����� J�%�C?}n�t
�1u����n�D�
���m�H�fo�8Z���,�B
ǡ�m��=���҉�mt��
wz������~L�&�!�,9*Q��:��
�7���NIz�-| s��qdd쭀�tJB�����gz�_��T5�\ �`��
��!�lM�iBI	�T�x0Vt�.�46c�9*Vt�q�ѣ�GsC��c�x"tN@�]
Gi"t�F	 #�ف6頲��,I�Ƙ��ʢ)=��=���2$M��Lk�v�J	6
B
%��I�y\�:����|�u�бM� �Y
q���q�/2\ �4�kF��U|'�<�S�-
��������,�k��aq���A92
N����Y�qU5�b�|ȏi��8Ʋ�,�
�+‡�l6+7=���i�_)�>�Y��f������+�l��X�)w�9 q�3"��
+��+��+�~���|���8����܆�W�"�n���
���~��9�<��щ�B��X��CFkg�S�pBS9��ܒ�/

�h��������3)�1�?
�*^?S�|.p<o��	�ܧ��	Q���7?:=,���s���
���J�6��`�s7�W�[B�N�6Ϝ-ʘ :��_�+Եi��;Nc?H�W������
+�8����<T�
��\%��I��
��=��9�� 3Yks�>
��E�� �D��5:�'��C���,�)>c]���xfE�D��*ԋ�A�0K�b�Ϲ��Y~�&��ލfM�$[6�iJ&�7l���wp�C
���$�+,��Bmw��ݥ�����"�����Y�C�O8M���+YGE}�솠fJ���r�B�+#�T�����e!�.�P�����@_m��]�����K���2G��q��_������(�)�AeQ��jM�Jo��-�������){�M�LYҬ���u�._]\L�y���4%�CF��m����粫V ������ط��*��Z��
+endstream
+endobj
+2788 0 obj <<
+/Type /Page
+/Contents 2789 0 R
+/Resources 2787 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2552 0 R
+/Annots [ 2708 0 R 2709 0 R 2710 0 R 2711 0 R 2791 0 R 2737 0 R 2738 0 R 2739 0 R 2740 0 R 2741 0 R 2742 0 R 2743 0 R 2744 0 R 2745 0 R 2746 0 R 2747 0 R 2748 0 R 2749 0 R 2750 0 R 2751 0 R 2752 0 R 2792 0 R 2753 0 R 2754 0 R 2755 0 R 2756 0 R 2757 0 R 2758 0 R 2759 0 R 2760 0 R 2761 0 R 2762 0 R 2763 0 R 2764 0 R 2765 0 R 2766 0 R 2767 0 R 2768 0 R 2769 0 R 2793 0 R 2770 0 R 2771 0 R 2772 0 R 2773 0 R 2774 0 R 2775 0 R 2776 0 R 2777 0 R 2778 0 R 2779 0 R 2780 0 R 2781 0 R 2782 0 R 2783  [...]
+>> endobj
+2708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.249 694.924 214.715 705.828]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+2709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.908 694.924 360.933 705.828]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+2710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.633 694.924 478.426 705.828]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1ab39e3c667ce455313f8ff578722af2e9) >>
+>> endobj
+2711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.126 694.924 513.996 705.828]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+2791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.343 180.102 693.873]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+2737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 654.911 221.336 665.815]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+2738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.107 654.911 303.029 665.815]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) >>
+>> endobj
+2739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.018 654.911 383.816 665.815]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
+>> endobj
+2740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 626.853 263.698 637.757]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+2741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 615.615 147.454 625.801]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) >>
+>> endobj
+2742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.443 615.615 188.968 625.801]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdac58a6ff6765224e937fefbadf45a4860) >>
+>> endobj
+2743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.957 615.615 230.483 625.801]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) >>
+>> endobj
+2744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.471 615.615 271.997 625.801]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559) >>
+>> endobj
+2745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 603.316 157.417 613.846]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda9a59b7fa00c2cf8df942badc9c414aef) >>
+>> endobj
+2746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 589.909 298.955 600.813]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+2747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.726 589.909 359.627 600.813]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) >>
+>> endobj
+2748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.616 589.909 484.708 600.813]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaf4462ec77078de4bbabb446cf61e5123) >>
+>> endobj
+2749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.94 576.877 275.823 587.781]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+2750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.398 576.877 379.035 587.781]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) >>
+>> endobj
+2751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.426 576.877 500.738 587.781]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7869fdfe9b1ace668a0a7b1d2faba812) >>
+>> endobj
+2752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [503.129 576.877 513.996 587.781]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
+>> endobj
+2792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 565.295 227.155 575.825]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb) >>
+>> endobj
+2753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 551.889 200.295 562.793]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+2754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.066 551.889 242.158 562.793]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13a39adc66b0a3d8cae2a7dc2abc8885c69) >>
+>> endobj
+2755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.147 551.889 283.682 562.793]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+2756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 538.856 233.381 549.76]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
+>> endobj
+2757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 527.274 183.419 537.805]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) >>
+>> endobj
+2758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.408 527.274 265.322 537.805]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d) >>
+>> endobj
+2759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.311 527.274 352.206 537.805]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) >>
+>> endobj
+2760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.195 527.274 427.464 537.805]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) >>
+>> endobj
+2761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 515.319 248.156 525.849]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fab25413bda9bbd45d2f22366d0e0ef831) >>
+>> endobj
+2762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.145 515.319 312.355 525.849]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) >>
+>> endobj
+2763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.344 515.319 381.535 525.849]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa8d3ab7646117632841be76c043efc39b) >>
+>> endobj
+2764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 502.286 223.01 512.817]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
+>> endobj
+2765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.781 502.286 365.066 512.817]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) >>
+>> endobj
+2766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.055 502.286 495.138 512.817]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a3b60d6dfe175b3a5d48361ac121f23ae) >>
+>> endobj
+2767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.798 474.228 227.588 484.758]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) >>
+>> endobj
+2768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.879 474.228 375.482 484.758]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) >>
+>> endobj
+2769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.731 474.228 513.996 484.758]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) >>
+>> endobj
+2793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 462.273 124.76 472.803]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d) >>
+>> endobj
+2770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.748 462.273 258.148 472.803]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a78fc3e83d58f3eb97a8041b600870a05) >>
+>> endobj
+2771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 391.713 179.554 402.617]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+2772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 391.713 250.676 402.617]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) >>
+>> endobj
+2773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.376 363.655 232.395 374.559]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a30a5addfb775d0e3586f1575ece47bf6) >>
+>> endobj
+2774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 335.597 229.984 346.5]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_abdd9791a8d91b11a5bd3a6ef0770bc86) >>
+>> endobj
+2775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 307.538 226.677 318.442]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a63bd7c7767faf3c219f9c2762095e2dd) >>
+>> endobj
+2776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 279.48 243.822 290.384]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) >>
+>> endobj
+2777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 251.795 170.776 262.326]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a03ed91fbbeb6d32952c5d2a30bfd3830) >>
+>> endobj
+2778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 223.737 165.237 234.268]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a05dd6b345e96427a50b45f9756e302ab) >>
+>> endobj
+2779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 195.679 322.077 206.209]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
+>> endobj
+2780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 167.621 319.317 178.151]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+2781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 139.189 179.554 150.093]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+2782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 139.189 272.803 150.093]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_aca6003248d614d68c07f5330b468a242) >>
+>> endobj
+2783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.56 74.333 222.957 85.237]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a0adf6106892886dc859985042b8a7433) >>
+>> endobj
+2786 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2790 0 obj <<
+/D [2788 0 R /XYZ 89 770.89 null]
+>> endobj
+2794 0 obj <<
+/D [2788 0 R /XYZ 90 410.788 null]
+>> endobj
+2795 0 obj <<
+/D [2788 0 R /XYZ 90 410.788 null]
+>> endobj
+2796 0 obj <<
+/D [2788 0 R /XYZ 90 380.996 null]
+>> endobj
+2797 0 obj <<
+/D [2788 0 R /XYZ 90 268.763 null]
+>> endobj
+2798 0 obj <<
+/D [2788 0 R /XYZ 90 240.705 null]
+>> endobj
+2799 0 obj <<
+/D [2788 0 R /XYZ 90 212.647 null]
+>> endobj
+2800 0 obj <<
+/D [2788 0 R /XYZ 90 184.588 null]
+>> endobj
+2801 0 obj <<
+/D [2788 0 R /XYZ 90 156.53 null]
+>> endobj
+2802 0 obj <<
+/D [2788 0 R /XYZ 90 89.452 null]
+>> endobj
+2787 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2874 0 obj <<
+/Length 1486      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�8~�_��
�Բ�=^z�i��I��^ҎGƊC���4���J;��ؾ��I
B+}��J�Z����֟�߯:��гb�XW��V�3D�Z76C����}�ls9��
��v�>܉���w�@r��t]���X
���R�
+���j"!�|;b�竷�?�:�:``���RFV<��|����Zy,��u���
����·6,�j��oE�Q�+����
�!!��Z�KQV2+j��A;�_rY_f�x �u~�����]}�])��"�3�ujP���"��(����j
�\��	Y7]
+<WY��214�;rdh�Խ�����j��8� ��P��'L1���g3�s4M!z �]K����h��q��=Q7{ek�SI�
m�`��M��o�����K��;W�gEY��q��z����Q�����[A����ۈ�X~.�]/@>
׬_�j��T:��ˆ࢔I62]��I6���H�,r|��؁�6�	!6Z�n.�+t��n���x�y��%X��{�
ͬ<��}�,Z�.EQ��4�8̵yZ�b���
}
+���
+�/�|�#��6���DH^��U]��-����x�~w\-����?ȟPȂcаd�
$j���:�Q��h��^ y��GQ
�BHn�?�7��R^�"k����3�����R��\����˄^�nOR�F[z��u�9�x�O�y�Nc�y��Y0���If��u��ۆ�
Y��z�
����C ,�&�����2O��SE����_\�2���������)�e^eC0F�H�'�����(��lW�>p5�3����FV� <�UC��;X�Y�����
B?�r��m ψ�u�Yj��↰�&�Pr��|�&@ě�Yo
�R�gnV�:��r���	3f�ʢ�Ym
{)���R�N�^�"��C�ֱ�
+���Vv�kq3Ԥ]7ɫ"5�Ā�
+�l��D(��Ÿ
+�g��Lc���ݜG��`?��N��Z����Gb�2�򈱝�x�,�{�UJl�WA:๻���x�
���ņX�E [�����xR�����ؼ�
+=5N�-:i{�9��]�p� :�c�8�1<�0�8�Ag���)x^!P�Ҭ����L�"�M�.�_昐��E'���*��d����>�ϳ�:k�`~�i���6�l������w"�zRZ�����#G*�5��u"�Z�c;�Tۓ
�l�j�m�-��Zty21K
+y
��w|>�� �iY�
�V��쭖ؿ�-K���7:H���|!�E9���c�����}v���i�NF����=��~&�p�&��K�
�ry�*ԧ��`_�Z(�,����ZHr���~�(3/'�
�r�.��ա�ɇ����\��k��׍���B�����GѬ��W���Ke��}�1�#�D컲����
�Q!����q�o���Uln��p�ֶ�~�8�:'��pI!��a����P�1��k��4
�7c�z�ɳ���%�g	
+endstream
+endobj
+2873 0 obj <<
+/Type /Page
+/Contents 2874 0 R
+/Resources 2872 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2887 0 R
+/Annots [ 2784 0 R 2785 0 R 2806 0 R 2807 0 R 2808 0 R 2809 0 R 2810 0 R 2811 0 R 2812 0 R 2813 0 R 2814 0 R 2815 0 R 2816 0 R 2817 0 R 2818 0 R 2819 0 R 2820 0 R 2821 0 R 2822 0 R 2823 0 R 2824 0 R 2825 0 R 2826 0 R 2827 0 R 2828 0 R 2829 0 R 2830 0 R 2831 0 R 2832 0 R 2833 0 R 2834 0 R 2835 0 R 2836 0 R 2837 0 R 2838 0 R 2839 0 R 2840 0 R 2841 0 R 2842 0 R 2843 0 R 2844 0 R 2845 0 R 2846 0 R 2847 0 R 2848 0 R 2849 0 R 2850 0 R 2851 0 R 2852 0 R 2853 0 R 2854 0 R 2855 0 R 2856 0 R 2857  [...]
+>> endobj
+2784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.56 696.328 223.515 707.232]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_af9dd9190c5f29dbbfa3d6e442dea7e7d) >>
+>> endobj
+2785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.56 671.077 231.565 681.981]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a5604f97d216583cdf012a50d2f8cdbde) >>
+>> endobj
+2806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.56 645.826 216.312 656.73]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_af127b16b1a8e300aa97caca515284b6f) >>
+>> endobj
+2807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.724 620.949 206.897 631.479]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a99e9dc5df3cf7c0ab581e602d1176e41) >>
+>> endobj
+2808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.724 595.698 204.825 606.229]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_aee4e9b54e65780ac3010fda40ea235a6) >>
+>> endobj
+2809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 534.335 152.551 545.239]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.049 534.335 195.988 545.239]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e) >>
+>> endobj
+2811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.804 534.335 227.26 545.239]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.721 534.335 265.178 545.239]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 523.206 152.551 535.161]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.049 523.206 191.005 535.161]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga266a81f442cf72bfded10a4ecb79f130) >>
+>> endobj
+2815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.82 523.206 222.277 535.161]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.738 523.206 260.194 535.161]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 512.744 152.551 523.648]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.049 512.744 191.355 523.648]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) >>
+>> endobj
+2819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.171 512.744 222.628 523.648]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.088 512.744 260.545 523.648]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 502.321 179.121 512.852]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8) >>
+>> endobj
+2822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.619 502.321 228.097 512.852]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) >>
+>> endobj
+2823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.912 502.321 259.369 512.852]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 491.525 191.296 502.056]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98) >>
+>> endobj
+2825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.794 491.525 251.339 502.056]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gac40e401b77b5ec6e9625c317ce6d760d) >>
+>> endobj
+2826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.155 491.525 282.612 502.056]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 480.73 152.551 491.26]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.049 480.73 236.943 491.26]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga13bf4cf2db045bfd362c5c8aae7f785b) >>
+>> endobj
+2829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.759 480.73 268.216 491.26]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+2830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 432.155 275.489 443.059]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ace0cdceaa0c7eea84cc1c38cf5bea680) >>
+>> endobj
+2831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.357 406.904 358.139 417.808]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a9c118832fed4c0b9b40547578459dad4) >>
+>> endobj
+2832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 381.654 257.776 392.558]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ad31eeb0067d6cad2eb2ea5ab5bd0a2b2) >>
+>> endobj
+2833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.921 356.403 380.884 367.307]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a74074a5ed3718745a4d82bacd5b381ed) >>
+>> endobj
+2834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.921 331.152 438.278 342.056]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a3e6dcd6f5d8e3ea263c9205b21a83e48) >>
+>> endobj
+2835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 282.987 273.816 293.891]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6a54c55d8b52ef353df7cefdfa632d8d) >>
+>> endobj
+2836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 257.736 217.766 268.64]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a5e801a56c2c3dcec13d2d87adf07ac47) >>
+>> endobj
+2837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 232.485 215.196 243.389]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a19b0ebdb3476fe1feb0f51d9328fd384) >>
+>> endobj
+2838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 171.496 184.651 182.4]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.149 171.496 228.088 182.4]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga984f2c32e934b6510731f6a7faf28296) >>
+>> endobj
+2840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.903 171.496 291.46 182.4]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.92 171.496 361.477 182.4]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 160.367 184.651 172.322]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.149 160.367 223.104 172.322]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) >>
+>> endobj
+2844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.92 160.367 286.476 172.322]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.937 160.367 356.493 172.322]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 149.904 184.651 160.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.149 149.904 215.366 160.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae) >>
+>> endobj
+2848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.181 149.904 278.738 160.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 139.109 184.651 150.012]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.149 139.109 226.434 150.012]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) >>
+>> endobj
+2851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.25 139.109 289.806 150.012]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 128.313 197.403 139.217]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) >>
+>> endobj
+2853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.219 128.313 260.775 139.217]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 117.517 185.478 128.421]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) >>
+>> endobj
+2855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.294 117.517 248.85 128.421]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 106.721 200.97 117.625]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga809c78f95611c4b838b4e8f097a03e32) >>
+>> endobj
+2857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.785 106.721 264.342 117.625]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 95.925 221.443 106.829]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3ccd0ef2cbdc282106525b2f0e734c7e) >>
+>> endobj
+2859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.259 95.925 284.815 106.829]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 85.129 231.405 96.033]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e) >>
+>> endobj
+2861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.221 85.129 294.777 96.033]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 74.333 198.2 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) >>
+>> endobj
+2863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.016 74.333 261.572 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2871 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2875 0 obj <<
+/D [2873 0 R /XYZ 89 770.89 null]
+>> endobj
+2876 0 obj <<
+/D [2873 0 R /XYZ 90 711.432 null]
+>> endobj
+2877 0 obj <<
+/D [2873 0 R /XYZ 90 686.181 null]
+>> endobj
+2878 0 obj <<
+/D [2873 0 R /XYZ 90 660.93 null]
+>> endobj
+2879 0 obj <<
+/D [2873 0 R /XYZ 90 635.68 null]
+>> endobj
+2880 0 obj <<
+/D [2873 0 R /XYZ 90 447.071 null]
+>> endobj
+2881 0 obj <<
+/D [2873 0 R /XYZ 90 422.009 null]
+>> endobj
+2882 0 obj <<
+/D [2873 0 R /XYZ 90 396.758 null]
+>> endobj
+2883 0 obj <<
+/D [2873 0 R /XYZ 90 371.507 null]
+>> endobj
+2884 0 obj <<
+/D [2873 0 R /XYZ 90 346.256 null]
+>> endobj
+2885 0 obj <<
+/D [2873 0 R /XYZ 90 298.091 null]
+>> endobj
+2886 0 obj <<
+/D [2873 0 R /XYZ 90 272.84 null]
+>> endobj
+2872 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2928 0 obj <<
+/Length 1292      
+/Filter /FlateDecode
+>>
+stream
+x��YQo�6~���S'5CR$%À�I�um���^�B�m:�jK�$�Ϳ�Q�
Y�5i��d��x����֕��7�_ǃ�מkI$�xnIlyL".��̺�%v>��Z������W��ON�#=78n��E�>G�oM���ؚ��[
#W���Bhi1��sa�p�
+��$p�%B<$@�#b
����Wj�ŐclO�dQ�koҫҭ�B�rl��:�Q�0lr�U���)-x�9�k�>�f��*8��6�Y���=��!�	�m6��i4̓T-�<J��k��:H+�`HM��A~�R}���g�^}�=U�F.
����.A~�����H����v����2/��޳�J���.�UXʞ��G�2��I|�<�K�'څ�����V�~���Z��E��^��&G=Ę�2[���&�5jq�,�w6:���.�
�T~�جԇL&W�$/z?�s�.�84�QY
�����kNo/V��wy<4��&��
o@�>��D͓T�4C
r�
V<���$V"]V.1��#5�"����A�ٽ��4̓֊�b�>��9ד���M'���iC0=�H'F��!W��>��o��u���ɡ�}Ѭ;S�Ţ��)��Up�,n��,m?�lA�
+��&��๾�^K��j=[�M�[3[�kw�}u�
�<�D�"���W�j�:�pe,Q�����ui'������
+�G��m���
+������Y�l)ӿ�
�N��QϪ�mԋ�`Uч��Y��#��9Vʵ���Rғ5�
���߾����'
��r�=_nB����A��n�����M'�Y��
+0=�<.3Y���m�
.���)����	����p�y<|�'|-�?�
 � �v?��
r�Τ`��D�
 ʵ�~h�%�G��ܿ��Y�o��v�F������4��11HF��	N'���i�A��@e
'
��*e��=�
V��1
I�T2�*�#����N�x5\�.��ni�LS4�&��:M��-FwK)%�`EйD\
�����brb�D�&�9�%��橴�_�jU�2�qa���ah�"ΐ`@�X�!�cf���i�vz���;)G�Qco\u�T�Gi���&i�ޚU�8`p�������e� 2�r��Iy���I�)2qY��o p�x
-&���d�S
��t���ݙ�����?�8
1I�E��uv�����s�
��0^�
g���z���U�|��H�ق푪m|��q�wݺ�u�<��]i���ՏGG��U��+���NY���b^�w�I�z��ȍ
 ���@�
+endstream
+endobj
+2927 0 obj <<
+/Type /Page
+/Contents 2928 0 R
+/Resources 2926 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2887 0 R
+/Annots [ 2864 0 R 2865 0 R 2866 0 R 2867 0 R 2868 0 R 2869 0 R 2870 0 R 2890 0 R 2891 0 R 2892 0 R 2893 0 R 2894 0 R 2895 0 R 2896 0 R 2897 0 R 2898 0 R 2899 0 R 2900 0 R 2901 0 R 2902 0 R 2903 0 R 2904 0 R 2905 0 R 2906 0 R 2907 0 R 2908 0 R 2909 0 R 2910 0 R 2911 0 R 2912 0 R 2913 0 R 2914 0 R 2930 0 R 2915 0 R 2916 0 R 2925 0 R ]
+>> endobj
+2864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 707.957 203.739 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga34d9dfd53548ce172ae94462d24f41e6) >>
+>> endobj
+2865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.555 707.957 267.111 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 695.562 230.857 706.466]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) >>
+>> endobj
+2867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.673 695.562 294.229 706.466]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.357 683.167 303.903 694.071]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142) >>
+>> endobj
+2869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.719 683.167 367.275 694.071]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+2870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 610.218 231.425 621.122]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) >>
+>> endobj
+2890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 585.868 241.387 596.772]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) >>
+>> endobj
+2891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 561.518 282.075 572.422]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) >>
+>> endobj
+2892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.937 561.518 405.76 572.422]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+2893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.58 537.168 293.319 548.072]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) >>
+>> endobj
+2894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 525.586 166.918 536.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+2895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 500.862 281.327 511.766]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) >>
+>> endobj
+2896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.19 500.862 422.746 511.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.484 476.512 292.675 487.416]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) >>
+>> endobj
+2898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 464.557 184.651 475.461]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.756 440.207 307.996 451.111]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga60f87e33c0dde9f5c2c7d3b4b78818ab) >>
+>> endobj
+2900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.644 440.207 452.2 451.111]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.916 428.252 229.473 439.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.244 403.901 317.447 414.805]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga470bfc567789301bfdc28fd70ed82f92) >>
+>> endobj
+2903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.929 391.946 207.485 402.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.137 391.946 367.693 402.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+2905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 367.596 229.213 378.5]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) >>
+>> endobj
+2906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 343.246 239.176 354.15]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d) >>
+>> endobj
+2907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 318.896 279.863 329.8]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) >>
+>> endobj
+2908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.725 318.896 403.548 329.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+2909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.886 294.546 291.413 305.45]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) >>
+>> endobj
+2910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 282.964 166.918 293.494]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+2911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 258.24 279.116 269.144]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga233295f67896774a4fa42920a4b8522b) >>
+>> endobj
+2912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.978 258.24 434.92 269.144]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+2913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145 233.89 288.979 244.794]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) >>
+>> endobj
+2914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [501.493 233.89 513.996 244.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+2930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 221.935 191.844 232.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+2915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 156.448 182.234 167.352]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable) >>
+>> endobj
+2916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.892 156.448 358.581 167.352]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga00a906832c41c42a70a5c9d194e07a7d) >>
+>> endobj
+2925 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2929 0 obj <<
+/D [2927 0 R /XYZ 89 770.89 null]
+>> endobj
+2931 0 obj <<
+/D [2927 0 R /XYZ 90 178.314 null]
+>> endobj
+2932 0 obj <<
+/D [2927 0 R /XYZ 90 118.919 null]
+>> endobj
+2926 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F39 2335 0 R /F91 766 0 R /F24 537 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2936 0 obj <<
+/Length 1709      
+/Filter /FlateDecode
+>>
+stream
+x��Y[s�8~�W�m홢H�U���$
ti	��tv��0D�Y��m�Ϳ�#K2�I��6�')����;G
+6n
l���:'�6b
����`��
�\F+����clN,��0݆�E��l�o�*
�h���ե.6��g�p��p��<�H`�XL��Ɉ�y��ӟu�:���f]��r���+�~k`d����X�5
j�wc\u�w�� #�
+Q|T<�4�!R���
+hf9�y��+�oi`�'����y�GI\�����R��(-�WUFq.5��ȥ�)~�Db{��I��Y����u'�,/��xUs�d�ኩ��� �}i�/���
�j���
+)Y��R�r�-�`]ZFª��i)τ.���/u�p�F�8�M����j͊˜Ƽ���Ž�ε�]���r�	S9��,

�Q+u�8����u��
��j��\*O�=�%���F�n
+�����<�b���r��0O�ZJ!�W��Z$� �\���]���:�����0΋����
�"2����&��7�I�m�R�.=|@a�<����k�
>/x�����*I
�@@��@�.��6
,�D��@�'�{Y,QXg�	Չ�K
w1��� ��V�K+�+��Xk�8-f3���
�-�.�c��p+������N��{C�WR���}D��䂚
+1��
�xJC��n8>��j
d�(�\�
I�k|ڠ�.q|��欠J��EH��r�c
�Ϣ�?űz�͸Y
�zv�ra\R.�
��•0��X��s��F�0�0�${�C�_���
�{z~�J����LI�#%�?X�2IDMpO��d�g��s-^N��W)���
f��jbZN<^�!\�/��럄��O��S��X\����(�̵}
+1�ңXt��3���
+_��t�a%(2��R{}1
�����vݦ���z���������+�^��?��ecȥ� �����!5��~zfYݛ�jҫ
�-P�5v5��
4�J�+�D�w 3 O��M���������
�^��C��r�G�c� �E�,�Y�Yč��_թ�R�%.r
�� �|8

����m�? JJ�ƲG��(�8_Ęk �����sV�jz+P�Lg1r<�P�E��Ka�
y9>
���x��yL�s=g�[��9�	8��T�
�E�n�7��
�<�8x�y�b�p���aC
�y�1�9�&�*�'�����o�͆D�ֿۇ$+��6R��\W�<���p�L��0���'l����ʋ��Y��>b�l�GP[u���%b��4cx3{"���4�&�a��K�!=j�1�?E%�����c���pҝ݋#���8\}Æ�p���<�9�9.ܮ��q�ٴ�����@�˛��
���*n�}�<t�?ҧ:e�Z<�H�K�M�a*k'\
*� VR
+[.��CWbQ���ǯ����1�Ζ`�X��7���^�	�=&4���vm
+��"Ĕ��>u ~�g�w�
�A;��.�'z�E��!�����.#TH��"H\��vs��|�����v+\��+��(�)�y����d2RGH:�f��4_�=�|j?�����͖x��o�	
+W�ґ댧�	?Tpa
� e�5�֦�>LD���<*����P:����w����
J����]��d�����
�9ޚJ,P���l��l��e�
��ʁ�l�\� WZj�
H�
�T8�>-VT����j�d�����|���]m
+endstream
+endobj
+2935 0 obj <<
+/Type /Page
+/Contents 2936 0 R
+/Resources 2934 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2887 0 R
+/Annots [ 2917 0 R 2918 0 R 2919 0 R 2920 0 R 2921 0 R 2922 0 R 2923 0 R 2924 0 R 2933 0 R ]
+>> endobj
+2917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.007 643.876 511.506 654.78]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+2918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 631.921 156.281 642.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator) >>
+>> endobj
+2919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.792 631.921 218.886 642.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
+>> endobj
+2920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.396 631.921 291.861 642.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Integer__Constant) >>
+>> endobj
+2921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.372 631.921 396.009 642.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
+>> endobj
+2922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.712 631.921 513.617 642.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
+>> endobj
+2923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.989 619.966 229.488 630.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+2924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 608.633 180.66 618.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+2933 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2937 0 obj <<
+/D [2935 0 R /XYZ 89 770.89 null]
+>> endobj
+2938 0 obj <<
+/D [2935 0 R /XYZ 90 721.073 null]
+>> endobj
+2720 0 obj <<
+/D [2935 0 R /XYZ 90 702.288 null]
+>> endobj
+2939 0 obj <<
+/D [2935 0 R /XYZ 90 702.288 null]
+>> endobj
+2721 0 obj <<
+/D [2935 0 R /XYZ 241.986 611.164 null]
+>> endobj
+2940 0 obj <<
+/D [2935 0 R /XYZ 90 605.146 null]
+>> endobj
+2722 0 obj <<
+/D [2935 0 R /XYZ 284.469 537.369 null]
+>> endobj
+2941 0 obj <<
+/D [2935 0 R /XYZ 90 531.446 null]
+>> endobj
+2942 0 obj <<
+/D [2935 0 R /XYZ 90 458.98 null]
+>> endobj
+2723 0 obj <<
+/D [2935 0 R /XYZ 90 434.691 null]
+>> endobj
+2943 0 obj <<
+/D [2935 0 R /XYZ 90 434.691 null]
+>> endobj
+2724 0 obj <<
+/D [2935 0 R /XYZ 107.713 380.827 null]
+>> endobj
+2725 0 obj <<
+/D [2935 0 R /XYZ 107.713 365.282 null]
+>> endobj
+2726 0 obj <<
+/D [2935 0 R /XYZ 107.713 349.737 null]
+>> endobj
+2727 0 obj <<
+/D [2935 0 R /XYZ 107.713 334.192 null]
+>> endobj
+2728 0 obj <<
+/D [2935 0 R /XYZ 90 324.003 null]
+>> endobj
+2944 0 obj <<
+/D [2935 0 R /XYZ 90 319.52 null]
+>> endobj
+2729 0 obj <<
+/D [2935 0 R /XYZ 107.713 264.774 null]
+>> endobj
+2730 0 obj <<
+/D [2935 0 R /XYZ 107.713 249.229 null]
+>> endobj
+2731 0 obj <<
+/D [2935 0 R /XYZ 107.713 233.684 null]
+>> endobj
+2732 0 obj <<
+/D [2935 0 R /XYZ 107.713 218.139 null]
+>> endobj
+2733 0 obj <<
+/D [2935 0 R /XYZ 107.713 202.594 null]
+>> endobj
+2734 0 obj <<
+/D [2935 0 R /XYZ 107.713 187.05 null]
+>> endobj
+2735 0 obj <<
+/D [2935 0 R /XYZ 107.713 171.505 null]
+>> endobj
+2736 0 obj <<
+/D [2935 0 R /XYZ 107.713 155.96 null]
+>> endobj
+2945 0 obj <<
+/D [2935 0 R /XYZ 90 139.41 null]
+>> endobj
+2888 0 obj <<
+/D [2935 0 R /XYZ 90 117.034 null]
+>> endobj
+2946 0 obj <<
+/D [2935 0 R /XYZ 90 117.034 null]
+>> endobj
+2934 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F113 1791 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2953 0 obj <<
+/Length 2745      
+/Filter /FlateDecode
+>>
+stream
+xڵZYs�8~����.U!8��[6Wev&�$N�T%)-A������qQ�Dk�D��"����F�0V�^������������28H"�x
���P�ɷ�_����ڗ�_�~�I�]����~A�	Č�(I�����7
,��� #&��^w�e�-�O\`ߔ�B"��^�ɔ�de)kU�ᶮ&��w�B6�5/�U��ڼ*MEvSu�)�F
��~35wj����L�ׇ�E>�e���a
�l~k�TK��Tb
L����0��lL��:k�JN(w�&�����(87�4J�(|��/���y��慞/Tw�\�R[���	�a���``�M�����j3d-��QX�mU���UcZ��
+�G�~TQU��Km��]
����
��!Q�ܬ>o�͂xn�`�1�!:��1�R��4��P0
+�
n9S�Y�1GT�c�"��~��-7���E%
+�(m�ՄѰ*&�ɇ�\�#&P�ux���!�R>4�7���4
./��n�
�X��X���Ђ�$	�r������ ��s(O��D
��T��W6���+�x2mP"�
�1��
�(rp�%/
���lF
8{h;7�cP������u���c
[Z������	�J�
+qdM�A*~���
<��q�
��
3 
� �9�
���G�vu	��(
���0_��:�U��R�HjL�B~Ř�y+��,�W�� ,a!��[�ۓ��H�Nș�	ڍ1�}�R6��
3����L���,/��B��4�o
�0�4w
+`�|q��@B.`�H~
+neѢ(�;n`�����J"��C
h��vĀ�@�?��
+�dhA�Sy=+Ft�	 �3�f6�ue�{[�yޘ-�CM�c�����1X���uD��N �.��0|���XM��8�ҧ���+%v�۹|���]��OO���l#[��U`~%��U��|a -+�]��,Ta�Q�OԠga����^J���6�:
�k at a!�j����E�԰�4
�/5�F}0V �٭.f�od�ui�M��H��
,&�͊b��xB�c�SŽ�~�
+��2�Xn-��ι V`D#A��*߽������ŰM҈�~ό���(G즜����'��'� 8��ӈ 
�X�
an����rk�Hz싌%���1��ѣ�>L��
_�?-�� �;��K
��;K�K�E�q�H]���R�`��'H�L F�7b�-./�R
��"_� �$\b��M�8�����u���gٟ*�
��ud��
L�P�x0��5�]���;n3#��H��#�Zf}�j(��*��O�
t��	0�gvۣ��D��"�
l?%�G�Cn��s���'�я�M%*�S�Ȧo���,�\�7�t�y��j���
Ru�"/Wc\��<��0t
.�R+��2€$�e��	��I��S�ъS��
��%'��7W�M�v��m����T=|�{c���9�4m
�
Ÿ�zb☋"���b[�[%CDodm���mUߺs{
�-�
�#<��-	�w+ku`5�0��J�^��C��j�8�����Ѵ�7p��2p�K�lMU�N�+��
�SXJ�pڪ�)1����^�=���E�E�ײ�-g��fӱs7��̹Em�9z�kA8\gn�{j2�=g^u��G�B.�p at O}��?��,Uٖ�3Y�� 2h��
�
�i�9bD#
+��
F$B�Ɂ�Q�@qx��E��󽩫��K�,:�RF��16T:H�'d-
%OC���~8]P歇k�H]V��8!
��C�
��a�ݨDŽLc+K����6���m�`��p��Cw=u�
�{Lۯ��&_�=��D]z�t�����<
+?�ײ܍
����	s&����4,�jc2S0���M�{��6�A)Ӌ�eekV]�ފ��qh��P北�y�Hw�kz�$��dw��m͋�9(ĩ�i3".�@��zbs����)�*:s
��K9�Mcf?�l��#Y	���
6�
��h���N�r��v���ޢŁ��Ct��=�]W
x >�8t�F_���G�ݽ�%��I�\v,+F
���"8��H�ir���z��D	Y
	r�Y���$9�
cȋlh� 1��0�LFP,�y, FM�d2�����l�24&W��6��fsi~~��I�Z�sy4��H%J�������p�
��
 q�ٽTY�vf��U�����i����Yx�s-�
_��Ʊ˴�)�Q$bjB
al7�WJ�~xs���"�ԝ�Fq��$����lб�È����^�����5�\� �Vo������
�ؖ�l!��Zw�
Rń��ya鴺�C�Q
��v�h����J�2oYN���V��� w�+"�&bu�Sq	��@1�����m^䭅
�������^3
ȃ=�9>��i�(�y�lO�4S&�����B���+�fy!-�%�y�oݓ�c�	�Ȉ��Pxl"��CUz���
�� 8T�
+Uo�C�x�1���½VԘ�������GgV�y��*��=�<l|C��#iʷǠF}�
T�#H4�L%��vmz�몱�V��Lm�6�jm%jX�vXe�wZ=�HUi����yݥ�^j+Ӽ��-�:�����t5vE��Kоg�/�c�'���/D��^����{�
v$�dCu�_֍n��x�nÂWۉ����N�����
 :�)
>~�w�a����߳��Q���
��$� 
+�*�-��$]�0������B�;<����Z������n� � `ԇ�, Jwo^=<l�����
�0
[b
+endstream
+endobj
+2952 0 obj <<
+/Type /Page
+/Contents 2953 0 R
+/Resources 2951 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2887 0 R
+/Annots [ 2947 0 R 2959 0 R 2948 0 R 2949 0 R 2950 0 R ]
+>> endobj
+2947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.893 412.755 513.996 423.659]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) >>
+>> endobj
+2959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 400.8 155.753 411.704]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) >>
+>> endobj
+2948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.473 297.426 424.869 308.33]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a63bd7c7767faf3c219f9c2762095e2dd) >>
+>> endobj
+2949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.932 170.59 206.516 181.494]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_1_1IO__Operators_a9ccf426c9d89537e0351aac50a333e95) >>
+>> endobj
+2950 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2954 0 obj <<
+/D [2952 0 R /XYZ 89 770.89 null]
+>> endobj
+2889 0 obj <<
+/D [2952 0 R /XYZ 90 687.2 null]
+>> endobj
+2955 0 obj <<
+/D [2952 0 R /XYZ 90 682.717 null]
+>> endobj
+2803 0 obj <<
+/D [2952 0 R /XYZ 199.727 613.405 null]
+>> endobj
+2956 0 obj <<
+/D [2952 0 R /XYZ 90 608.823 null]
+>> endobj
+2957 0 obj <<
+/D [2952 0 R /XYZ 90 512.766 null]
+>> endobj
+2804 0 obj <<
+/D [2952 0 R /XYZ 90 477.748 null]
+>> endobj
+2958 0 obj <<
+/D [2952 0 R /XYZ 90 473.264 null]
+>> endobj
+2805 0 obj <<
+/D [2952 0 R /XYZ 267.991 403.953 null]
+>> endobj
+2960 0 obj <<
+/D [2952 0 R /XYZ 90 397.313 null]
+>> endobj
+1555 0 obj <<
+/D [2952 0 R /XYZ 487.773 288.624 null]
+>> endobj
+126 0 obj <<
+/D [2952 0 R /XYZ 90 271.374 null]
+>> endobj
+2961 0 obj <<
+/D [2952 0 R /XYZ 90 189.815 null]
+>> endobj
+2962 0 obj <<
+/D [2952 0 R /XYZ 90 129.686 null]
+>> endobj
+2951 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R /F94 771 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2968 0 obj <<
+/Length 2521      
+/Filter /FlateDecode
+>>
+stream
+xڵZ�s�6�_��C��Z0�H�n�
��d�K_�>�M�6���Ts�����(R�
��=�@p�?�.����:������X��D2�]��>�u��z�ه aj���i��
y�K���:�,u��[υ	l�
�e����˟N�qy��D�R|&�t�b3�V'>����q�3��MZʹT�[�ޟ������B0!��um��7�ei�G���b#
���Ӷ�i�s^4�l���;KC��ˆƪJ���-[7�^y��yU��B�(x[�GކVMcwi�<�f�����p
� ��0wr%aH�}�˳;R3Q����j������vmYmn��YZ���ɋ{��u��n<�2�4n��_r�2
+
��
Х[�b���j]�S�6�,��fm>�a��q���s��!$�Q����Ъ�K�w���,bI�
��"��$�l����/"@eكqH|��{x�֫��*���N����uZߟ��~{��)��
��������
�~�)�h67("�o���Uմ��4�q�{]���6Y�����h�� q��O��).�픦~�5���zߴv�-�7k��������4�E<���o<�Yî�m^b�ĩ��l������D�!�[m��Uޒ]~ز�x�iO
�		�2�����z��!�
+5P�9���[��)#�iƍ�'|��� E��)�,D
y3n\�68A��h���H�5N/��w�񀻶
9y�^�MN k�v��xy�7;n����Jۣ�!�(*�����h8|ʮ%0���薡5]�i���!����׫uU��N1`��� d�7������jg���
��GN��hhJ3�C�lB
Cu~������=Q��{��!c��$I�C�d����2C�6�&xQe�D��!�E��̪��ɀ"ۄ��
�p童 t�;���"Q��3
d
�$<O�
��
F2�$b<4
�ظ��b�dPs!��>�Y,�#p �a���0<_���>�Hg
��\�h&t4^�C	U p�\��}
�6L��<������!�����=�|�\8hs`a
3c��n�?�/���ቐ��c�b
MIsJ
��_�~`1�r��m�&���tB$@Lh�����.ۉ=bL]t2��9"�D�H�v"͌t��Үۻ)�d{ʳ�xA -������;�O Z�
ǐG&� [...]
F��1��!�2>�nБd<����݀��(B�愚�95�@	�����͋�u��6�O�����|"
�n�����x�u�
{ d��*��
Y"���]�����0�}S����C|�[
��C�p5 b���!��+Aȕ��Jȵ
�&O?Q� 3p��0� �
0�>��8Ȯ\����� 5|.K#���#F�!K�
{M���I����e��:���! x��2�"b�2
�����S$���q!��0��F��b�fW]|����$�F
��"�ҭ��x|
`���a�qL�tt��R��â�y\���P�bä}�G��e]j,�\&�>`ѝ?gq��
��+��W۰�E�=K�i�
��A�	
%/䥈�Ѷ՗T�����>U��xB�A�tD�
�"!RH��#!�*��*:P4!SA"9����5�|�Ӡ
��U��JU�"�5
|7�C�J�8�>U�è�Xh:"N�Lq2OݯYH�a( ���Z�l�����w���:zD��vӨ.����<�
��p�+(�N�
�X��9iF7r�}�5�uw!���d�z�M�ڴ\��c��ロ�
��q�F��#��ܗ_�6�
�Xa����{��G��X
=�z��B�p;���Ӽ��LO�J3v�����j�G����W�Z�,���0
+�f-
�i���b�zoS��\�������qН��Z���4�mlM�jK��	�&�6���֥��e6�M���"���dC������1
'�1�xq��Zwt
`��{[�E�/`�)A��K):5��t�.��R�Y�,O����Z��	��of�M���
:Y�6����G����lV��3 ��m&.u �ӱ
�9�p٩S�U'x�b��gFDܩ����q�6�/Uk������#�[`c]Wh�?�e�H���ў9p� ��g9�wc�\k���*� ��^�n�ﴰ���I���ƨxv(DwM���įL��~
R��t7�j���h!�w�ƫ�/h��C��V�V�?�HO����q�@�9��&�[j�SS,N?����g��֦��83Z������' �~��+��wDë¦�8?�J�����
 �h]��$4}���������
M"�ƛk�܄ɸT�����s�
ꧏNt<q��?��
�_���sZn���e!w�����	H�s�h���oob���o���T���4z[l�k������涁T�e�j?�d��i���
u0���>sq��>i�E��� �~O�&�݌a�{�_tg�Wj��%o���z��w
+endstream
+endobj
+2967 0 obj <<
+/Type /Page
+/Contents 2968 0 R
+/Resources 2966 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2887 0 R
+/Annots [ 2964 0 R 2965 0 R ]
+>> endobj
+2964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.669 577.684 211.204 588.588]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library) >>
+>> endobj
+2965 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2969 0 obj <<
+/D [2967 0 R /XYZ 89 770.89 null]
+>> endobj
+2970 0 obj <<
+/D [2967 0 R /XYZ 90 517.987 null]
+>> endobj
+2963 0 obj <<
+/D [2967 0 R /XYZ 90 494.221 null]
+>> endobj
+2971 0 obj <<
+/D [2967 0 R /XYZ 90 494.221 null]
+>> endobj
+2972 0 obj <<
+/D [2967 0 R /XYZ 90 423.674 null]
+>> endobj
+1556 0 obj <<
+/D [2967 0 R /XYZ 90 284.688 null]
+>> endobj
+130 0 obj <<
+/D [2967 0 R /XYZ 90 277.192 null]
+>> endobj
+2973 0 obj <<
+/D [2967 0 R /XYZ 90 219.29 null]
+>> endobj
+2966 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F13 835 0 R /F91 766 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+2979 0 obj <<
+/Length 1274      
+/Filter /FlateDecode
+>>
+stream
+x��X�n�6��+tQi!��GP�I&�<����Jf�،cT�<��L��W%���Im��,Q��!�9���"��O�����\�� #�
������		o��*4<�<�0�1խ��\L�]L/�o�w�ї�O8 �x��f���3���!��
<ԝ��S�ip9�u�
���
�̐�pĸ�-2���@p�qx�&�MS�ó|v��U���|U�;
��M������	�$kC#�O"�äȒ��Ag*�J z|�
	��%w�� B 
�R���40&�a�F���wv^
�@1E��A0P,%���iyS$E������z]DD�y�)_�Yr�0������
�QSσ�����maW3ۤ���c��s�{\��M�`,oB�� ��|5+li�7[-�뺰�MŬ����;�m�Z4-I��C�e��n�̵$��y��EB��:y
�Yz?�MOBz=C
+6����=�
����
��ײ���ͮ�K��wF!NX
��"[�t�9�e�L��)�nf�r��˝�`�
����}LJ��9�̥n��
�n�qX
��!"߽,��IY�G5�ȳv�m��)(K��"�1��=�v, lG�cH�
������$a��o8`�F�|�w����AN)�m� -؋}p
�z^�C�j}Ѓ�gu��!��0�K�4���y�5�
�S���)�J��N��+@��4�V%yQm�-�eQ����,�aa��y�x��g�p��1MJ��"�0~
y�l�
tf�y����W
+��

�?IW ��K�59;�(m�>�Xy����$s����
�#i��f�elO)G
���J�#U	~L�m�d�@`
V�����SS��@ <`���tS
�������
��긗r
+C4
`r�A���M�w�]�1���D��lԋI%\�v������{�e����g����=��E��
��E(Gڈ����О�<
�KL�O@�L�8DB-��
���<D�� 5j%�������OdX.+ZΖIz��T=&+�ջ\�yű��+n۪��߶���j��ۙ���N�����[;(!;��%�m��d@\�{�d��\��T���`��?�����0~���,�`�p1ċ�k>@�4���#��7�������S�����GB�.c?'��6��X�?����r���������N����Q��
&b��6ߕ��d<��_���f`�{$�6aե�+%Y^ؖmИ���&�/f���
+endstream
+endobj
+2978 0 obj <<
+/Type /Page
+/Contents 2979 0 R
+/Resources 2977 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2887 0 R
+/Annots [ 2976 0 R ]
+>> endobj
+2976 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2980 0 obj <<
+/D [2978 0 R /XYZ 89 770.89 null]
+>> endobj
+134 0 obj <<
+/D [2978 0 R /XYZ 90 721.073 null]
+>> endobj
+1687 0 obj <<
+/D [2978 0 R /XYZ 90 694.43 null]
+>> endobj
+138 0 obj <<
+/D [2978 0 R /XYZ 90 694.43 null]
+>> endobj
+2981 0 obj <<
+/D [2978 0 R /XYZ 90 584.389 null]
+>> endobj
+1688 0 obj <<
+/D [2978 0 R /XYZ 90 461.011 null]
+>> endobj
+142 0 obj <<
+/D [2978 0 R /XYZ 90 439.313 null]
+>> endobj
+2983 0 obj <<
+/D [2978 0 R /XYZ 90 317.215 null]
+>> endobj
+2984 0 obj <<
+/D [2978 0 R /XYZ 90 257.019 null]
+>> endobj
+1689 0 obj <<
+/D [2978 0 R /XYZ 90 164.053 null]
+>> endobj
+146 0 obj <<
+/D [2978 0 R /XYZ 90 142.355 null]
+>> endobj
+2977 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3010 0 obj <<
+/Length 1499      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~���^2�RE�h�ސ.
�&�
�%:!&K
+%5s�EJ�Tv��M�a����|�;��+
[o�\N_3�
+Q�;�u9�Bl1/Dԇ��M0r�#�1�'C��H.��d�`;O��<���\�d$����l2�
2ϖC؜O�>
?������(��A���
�
��iT���=�s�9��p���!
~�|;xu9�@�-�QR�+^
>|�V��Z�5
�ۦ���
~S�b�� ���-�	A�h{ϲk.E5�+H��� ��g��`5\��������87ֵ�����fz(��#<v�
0
+���i���|l���g
�z�+60r�zT?o�#=�hm����l��yr5k�z6dv*b`�	�w|1k�
ϯ�,�D���vn9���s
:� {z쏎C��*����}�f`}Q�n�7�Ck��b�#;p�� .�S� ��9�
E-��|
�i���}���*�\��L�H-��(;�?_ �G�ܼ\���lpkԄm���k�sX��	k
5{U��E�#9}�w!yY����:�j6h2���䁜χ�5"�U�JF�*��f֩TɁ����b�����$�oГ�7qU,�R���i8:��{YIx�/D)��"~e�9yϫZf&��k��,����/<v�	�(
�y)*�`�c>.���*-���-��mS��]�����*������ #�zS�
aMƮnT��򐏃�Qu-�H������mt+�뾑C~7ݲg��n���
C�xwd��Y���ݘ\*
={��Y�h��ö�qi�8Y�;
'榶f&
+�,5�
>}- �� 
rt����CA?d��@`�Ӎ"�.�M~�7u���a>��� W�O���?��
�
��x��Yu��c������&����U�O���h���P�J�e���Kٗ�ao䯼�}~���L?j2
�S�����)&
�w�BF%�a5�q
�(;��no6�气�����A
�3R
ճ� �:�9�!b��#�i!EV}���)z�y
"�t
7�i�H`aF�{g���U�p�6�uS�5�X����N)O���H<�j�
�
�qȎ�Ё��Q�7�EO`?L
�0�
+f��s}l��������i�!
C�!�;�!=$v��Y� ���q�˃7��
ڠ�*n�f�hqb�:p�����,yo���G�ÎQAF�� ��@�B�]��8��	�
V?����k�Z������Z��㘗�N�� �w�Σ��
:q�b���V�zO�?x0F�ч��,�"��i)��i�,�ݽtͪ`�l��l:[�r��2 �
`�Y�*�Q�o���n>�q]��4d���� Z�

}�C)�x��sӇ9Wy¶';���oD fU�;�F��	Y�zXm[hh�l]:���?J.Vao��.��V%
+�ge �e�
"����).xK��WwE񫺉�'-yAWꮫ�����+H�W(ֵ`��k���N
ݵ
p�iy�N���
��K-�C����
sՂ	c��jY=�jq��Z��*��
+endstream
+endobj
+3009 0 obj <<
+/Type /Page
+/Contents 3010 0 R
+/Resources 3008 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3026 0 R
+/Group 2975 0 R
+/Annots [ 2985 0 R 2986 0 R 2987 0 R 2988 0 R 2989 0 R 2990 0 R 2991 0 R 2992 0 R 2993 0 R 2994 0 R 2995 0 R 2996 0 R 2997 0 R 2998 0 R 2999 0 R 3000 0 R 3001 0 R 3002 0 R 3003 0 R 3004 0 R 3005 0 R 3007 0 R ]
+>> endobj
+2974 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 3027 0 R
+/BBox [0 0 214 206]
+/Group 2975 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 3028 0 R>>
+>>
+/Length 483
+/Filter /FlateDecode
+>>
+stream
+x��T�j
1
��+��H�c(^\�Bm�Y��榄��t�߯�=�[ڬ�0�cY>��3����
����
+�A~^������?���/��A�'us
�N�>�0������+$k��M5��B
lD�Q�by$G��Rf�(R!�[hif��]��0��c���b��;�0����
Lgu�)��G�k3�ĜG�ƍ�%���� �i0.[bu=6��=��}
Oi�B�P
;�aL�Sn�@�f���4�t�<�Ԝ	��y>���$s�!o������k���ߋ�	�U
@�fR�%����v�ua�;�zY������7��ĺ����ۓY���zZ��.SQ
�(�����L^#Y��~oR��=�����0�7�t��>ϋ �Ix����38���ݾ����RS;2
+��r��9�+kAV��� D���/�2è�ԛq�:�n�����/��R�gL���D5Ԣ�y&$\�f%����
�
+?_
+endstream
+endobj
+3027 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+3028 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /KKKUXN+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 3029 0 R]
+/ToUnicode 3030 0 R
+>>
+endobj
+3029 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /KKKUXN+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 3031 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 611 722 667 278 460 500 556 667 500 556 500]]
+>>
+endobj
+3030 0 obj
+<<
+/Length 3032 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0��<���!	�����¡?*�{� cr��k<V*�H���^ڗ�

K?�$;Z�
�r4Ow'��t
L�s��D
+o9
+���ܭ�Bck��5K?�8/ne�g5��0��w��
��vߗ����?4�YX�4
S�}�Wa��H,
�}��>,����*�VK,�q%9)���䄹RRg�4���4	�O�+�z-o
r�˳�5��@G*U9���@�4�-R����Agh'� 
@=��@e좠�.�7Ӂ
+�g��|�ɑ�$�Hˑ���[>�gQ��
+P�� _�

�*���W��r䫊0�8�mH�F=6@ޝ��k���{0��L;���_���
+endstream
+endobj
+3031 0 obj
+<<
+/Type /FontDescriptor
+/FontName /KKKUXN+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 3033 0 R
+>>
+endobj
+3032 0 obj
+343
+endobj
+3033 0 obj
+<<
+/Length 3034 0 R
+/Filter /FlateDecode
+/Length1 2404
+>>
+stream
+x�UV{lS�?��#N�:v�k�8
;�C
_?B �!'&�h
�`�C
N*�Bۄ�R�T�֦�
�*�ժ=U�[;iB�EPi��N)m7m�#l*0�im����u��y|���
��w�=�cy��qV?:��c��}
�����''V~��k̟��1=��O�G�ө�HcA�:�An��J�
_hxU��#��3�)�&ހ���gR
s��E��C���� c|��2b`��a�p�
\/uЄ�2_]���;�7
�I��#���LN��kՈހ�]M|r~����>!�]n��n��U#��U���GhA��َ��q;�b>���kL���rw���}{�{i���rm���C��ڪ�����wZ=U�D�o$���\���Ե˽���Y�w5h�ǝ�Zߗ_�&:l�bcQ^�Z�-)��=���o;w$�F}m���0�V�� F	HJ���Qk"����=���w=,����M�
+{"H��q �
m��ʻ���D��ݾTM�~_g_B���:��ڹ#V��K��`l����P�7�1ޖ=��0�����7��^���ʮ��L�*�Zd�[��bE=�>7�O��-.e"�X$|��ۗ����I�
��43s(5+�"&W�RfF�r�!��Y�n�������J�l~�D3�Z�Jn+��J�ns�,ׯ��~�[k+�s��f9��3�2c���h�Ċ�k�j��+�z�4�OŤ��U����6鸒��!�jae�U8�6D
�$
;6��!'
뜤%�W�'�	�C�O>5�5_,HO��{�����	M
<�L|��%X�խ���,�7g�#R�ӯ���`�fR!컨��*�

{��i�s�D"���x�wU�����H�37|(3;�� ��
����u��(-5a��~�r��/l�=������
�w�����\|`P=+�gRN�\�J�i�W�@|�dz��TS���-�8�����O���P;��y7�L��l��� �U|�~�h����V�7����q9y7�<~ �<1`����-��ϭ�����������Wtd5�L��tn`�c}�ob�)O�1��=��,�k��$����>�>���z�Xz|n��uy'UQ��v�Æ���E9&da����)~�%�EA:h�U���utĹ>$�TjVG�=t>�쳊
=�3�#V�����4�P�!ʨ��L�|<im|+��64��ɕ���z/4ذoB'��s1m�>o�@P��X�A]�[V�KB��
E{�SBB7��Z<ulx��2GG�-
�Z>u��ќ=�,}{�w���o�ƞ�x�������J�ijg�|��؎�B#���ޡ��E_Kc�
�|Z���+�P
Z?�Ofge�ӬmA�\�L=���_����Rt�}�
+]���<��xj�Ez����ym�N�||<������������g_�n���Sb���*l��ҭ�3�����;�9`��V�9zL���ս#���:J�	��N��FN�^�^���(+/0[��v>��&�]�N��
to1�;*e�0RFS�;�Ы�[�l=�f�KQ��*瘱R%^y�'^
��� ���ŀ��TD-`�����b���r�h�X���;\��/T}!������7�o��5_��O���^���g6����G�5_n�����߰�†y
�AQV����ހ�b���a̱�<h%h1��a
��͢��Q&�?�
�1A6�5�Ǿmʾ6��Iѿ��7�zЦ7�מ.��-Ë��!�W=�1*�Uxߨ�nQ�P�u��x��o r�ୢ�[Fl�8WZ�/�W�w�⦔�ōu�pE�� I������U
+endstream
+endobj
+3034 0 obj
+1813
+endobj
+2975 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+2985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 422.716 197.097 433.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) >>
+>> endobj
+2986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 394.255 197.097 405.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_abe1602d6e19dcfeda71963b72ed61cae) >>
+>> endobj
+2987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.434 394.255 301.684 405.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+2988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.167 197.097 377.071]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a514da3c88769e7584fe9d6da6f2cb003) >>
+>> endobj
+2989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.434 366.167 307.621 377.071]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+2990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 338.454 306.286 348.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a243d9267fe6a9414af634749b27dac8d) >>
+>> endobj
+2991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 309.992 169.013 320.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_acd547a5df8e528ed1ab16c8f19c97685) >>
+>> endobj
+2992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 309.992 256.016 320.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+2993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 281.905 180.54 292.809]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ac2c8b1fa8685b79a6e0dac07128b24d9) >>
+>> endobj
+2994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 281.905 291.064 292.809]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+2995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 253.817 178.239 264.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a2bd978ad611c80d14315255b1577772d) >>
+>> endobj
+2996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 253.817 288.763 264.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+2997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 225.73 181.845 236.634]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a6cb598653a5f9e64b0b42b88e5a9b5d1) >>
+>> endobj
+2998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 197.642 181.845 208.546]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9b395593b699094656f3cc00361976f4) >>
+>> endobj
+2999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 169.555 154.727 180.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a5e151ddb186280f9ac6825e4b38e3d4d) >>
+>> endobj
+3000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 141.841 176.505 152.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a8ca5257af8014cbcb2b4723340b9139d) >>
+>> endobj
+3001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 126.75 450.955 136.656]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9b395593b699094656f3cc00361976f4) >>
+>> endobj
+3002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.421 191.718 113.325]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+3003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 102.421 288.852 113.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a3611ca64bf028cea3b37bbfe3c5f84e6) >>
+>> endobj
+3004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 191.718 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+3005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 74.333 303.079 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9561e112f9dc57e63230b0fda3858e1a) >>
+>> endobj
+3007 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3011 0 obj <<
+/D [3009 0 R /XYZ 89 770.89 null]
+>> endobj
+3012 0 obj <<
+/D [3009 0 R /XYZ 90 441.432 null]
+>> endobj
+3013 0 obj <<
+/D [3009 0 R /XYZ 90 441.432 null]
+>> endobj
+3014 0 obj <<
+/D [3009 0 R /XYZ 90 385.249 null]
+>> endobj
+3015 0 obj <<
+/D [3009 0 R /XYZ 90 355.436 null]
+>> endobj
+3016 0 obj <<
+/D [3009 0 R /XYZ 90 327.348 null]
+>> endobj
+3018 0 obj <<
+/D [3009 0 R /XYZ 90 271.173 null]
+>> endobj
+3019 0 obj <<
+/D [3009 0 R /XYZ 90 243.086 null]
+>> endobj
+3020 0 obj <<
+/D [3009 0 R /XYZ 90 214.998 null]
+>> endobj
+3021 0 obj <<
+/D [3009 0 R /XYZ 90 186.91 null]
+>> endobj
+3023 0 obj <<
+/D [3009 0 R /XYZ 90 158.823 null]
+>> endobj
+3024 0 obj <<
+/D [3009 0 R /XYZ 90 119.777 null]
+>> endobj
+3025 0 obj <<
+/D [3009 0 R /XYZ 90 91.689 null]
+>> endobj
+3008 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im4 2974 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3048 0 obj <<
+/Length 2193      
+/Filter /FlateDecode
+>>
+stream
+x��YKs�8��W𔥪"Op�e&�����hOɔ��`���!��ί�Ƌ"%�Qb���h4��~�8��p���fg�S)��D��H�(�
+�~-�O�J&�~�X"Q	,��/>���z?�h��^���>#0�#��
��h�:���0�{�S2��D��S�e���?g؋����)
I-�F4B�2J	A�89��ͦ*�ɔ
+
7wڽ��W���y��hOU��P��
�{Vd��[�O/�bs��׉�
+#%�*�3��Q�mK�Q��@���#ꝋ$h�AV�A	�)�gJY��єP��W�gJEoU�i*0�]�K?n,S�z�i)��>���Ό~��q���E��ȶ���AQ�)�Ƒ�o��0��j��
R
CiBQ�M��2e���w��Ϊ	q�ҍ�<�G��^.�7e��
�mD�9�y�c����:M�)��"�k�5TƯ7ż�Kw�C��`<�W/�/
�ΚV��f�)ʦE�u8�M�YS��Hę�
����˄�
��8P�{���\��/�\^�&Lĕ�W�˅����jr�:ϳ�ե�R��4�����qٞ���
+���� �A�D��݇t�(�������T-��.����
�D\1<�8.�fqqQ�M���Cܳq3�k]eMY�3t6&�!�ۓ��˘�p^%�6�
+< JY?ߏN?
��c�@���=�|�4��`�$��Q��[�>��h�G�9�hH��]L�x����-]`S��*o��;~�j�H��k7�(}�R��H/u������U�6[~G����uN)u������\n�..ǀ~k
<����u0��G�}�2��&�
�6��q�7U�r�{,�Bg����b�J׵�
����:/��֑���-S�G��Y�7�9�Y^̗��^�ۓ��E>�"��/��Sn�8x
++%�\�5�����̋Ɗ|kE��.�U^Xw�u�$�_���,uV�ES{ލ[��LfU�]/m�	Cy�������
+T�.a̪��=�ɀf]��z5t�]��Z ����O~�UyD����`qK=n_3T��у������|��d{�>�Ih�&���L�l�� �#	�$A��.��D��
�O�ҒH�$²b�G��	�1����wzQ
��Rĥ8�c�S��m~]���ŅĞ��"=�$�I_��$�Qx`����S�b�n��C�
��o�ܞ

zA�O�Wl�.

%L�B"僠rD"���%lH��
���!V
+�Y� om��z�yBd죳�,�rH���P��.	"��4��I������cۂ�D�6� M&P��>�ᅐOB�T(�ҲbB��3˛��b[A�ƌ��Slϸq�})$�u���
R,��R���ŀ6��w�d2^JBi��X55%�i0�6���6P��~Ѧ����?�Q�2W��OQJ��1"
��2�بaD�Ą�����Rh6(�0sM�hO�F�
+��ꞾQBB�Ja!$k�&
���Bq���a�M���+68 4��Wl;�/�:<*CЉ��"�d�+6A4����:�ihʐ�4�(E���$�&K8�M�����D����Qf�w�a�@g76|ʢ�
+g��Œ��ϗK��\P9�&�.��r=��in2
w?�wO3�ΦCd at h�����*�W�a���k���"��

�7�'��`C@�\!(�;���}����
+a�
�5�τ8C_b���Mm1�d 4�* ����b�mf
��j�_���3�f�S�>��H��'���h,��2#8
+�N���8�Y�K(�0�wT&>(�z����=���u8=A޵IqL~��I
�����z8�bǃ�}��d��Y�aiǡf�X&��n��P�6
�0_/�Kм�@��>������m��qO1�L���p
@�=*c
�t쨽pQ�?��*�
�}�~�q���H�퇡��N"���K>pr(J0�����N�(~Z��q���0���U��;��;��ܼ��TC߯�K/�w���޼
w3%����WE��7�·�ﻋ
+��A
RoJٱ��;
y���M�߰&iJ�d��N�5~��͊E/K`�e7~�-�`���D U����s{|�ֽ���տL��Fx���™[g��n�
�V���\z
��AA�����qf����
+Z���Y_��_onk]ܢy���T��!%�uܛ �UY���M%a�:�
0�?�쩶
+endstream
+endobj
+3047 0 obj <<
+/Type /Page
+/Contents 3048 0 R
+/Resources 3046 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3026 0 R
+/Annots [ 3006 0 R 3037 0 R 3038 0 R 3039 0 R 3040 0 R 3041 0 R 3042 0 R 3043 0 R 3044 0 R 3045 0 R ]
+>> endobj
+3006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 695.379 150.493 705.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_adcaa7cd147b3ebb7c52d232824de49e4) >>
+>> endobj
+3037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 597.923 156.281 608.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ad59c13d00ea95d4ed045bca314f5e5fc) >>
+>> endobj
+3038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 597.923 312.663 608.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+3039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.875 597.923 483.441 608.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+3040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 570.028 226.034 580.932]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a022891f0008542ea787d812e6e6f9e48) >>
+>> endobj
+3041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.157 570.028 478.723 580.932]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+3042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 542.133 156.281 553.037]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ad59c13d00ea95d4ed045bca314f5e5fc) >>
+>> endobj
+3043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 542.133 312.663 553.037]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+3044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.875 542.133 483.441 553.037]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+3045 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3049 0 obj <<
+/D [3047 0 R /XYZ 89 770.89 null]
+>> endobj
+3050 0 obj <<
+/D [3047 0 R /XYZ 90 712.265 null]
+>> endobj
+3051 0 obj <<
+/D [3047 0 R /XYZ 90 644.196 null]
+>> endobj
+3052 0 obj <<
+/D [3047 0 R /XYZ 90 506.267 null]
+>> endobj
+3053 0 obj <<
+/D [3047 0 R /XYZ 90 506.267 null]
+>> endobj
+3054 0 obj <<
+/D [3047 0 R /XYZ 90 406.131 null]
+>> endobj
+3035 0 obj <<
+/D [3047 0 R /XYZ 90 383.754 null]
+>> endobj
+3055 0 obj <<
+/D [3047 0 R /XYZ 90 383.754 null]
+>> endobj
+3057 0 obj <<
+/D [3047 0 R /XYZ 90 294.305 null]
+>> endobj
+3058 0 obj <<
+/D [3047 0 R /XYZ 90 204.352 null]
+>> endobj
+3059 0 obj <<
+/D [3047 0 R /XYZ 90 103.663 null]
+>> endobj
+3036 0 obj <<
+/D [3047 0 R /XYZ 90 77.486 null]
+>> endobj
+3060 0 obj <<
+/D [3047 0 R /XYZ 90 77.486 null]
+>> endobj
+3046 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F120 3056 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3078 0 obj <<
+/Length 2211      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�F~���@���\8���p��"ݴuc��-�,�������
g�7Q����.
X5<s��}�B�(�<L����֗������Z�I�€���$�ᇈ�m9y����`���)�^�o��͔b/K��j�G��}
�O����h���~<�&�#��>��Mk��̒�ΰ�݂�!"���?'�$*��r
�B��6�Je�S+�O��T��["d�
�y����Og��	1��H��bs��#�,���`Egy�m&>e�Ln�~=�=3��
���� 8��.�?b-|�e	(`k�׶�Չ0%l��0

Ҍ�P��n��!� ���͔Q����wWJb�$P
+��i`�i:�
��͛�P��'Q@�z�����˕�X
+�}y��C�8������N��?`Lq���� ��?��H�a
��mT��l�����3��s<�qƼE��g�B\�d2�!�F�eޞin���aD
���0th~��@v�HD�f�Ә
�e��ր3Je�uÃ���O|�|��s ���N�U����kC�|�0O�W�{Bi�|Lܢxe�(J��"K�'s?�O��OsQ�9
f#z���f�r
Ϫ��ߕC$�X�'E"?h�<�-��OU� �
L�� �@
��c�r
���QGBf��	sg�bĒ�:���s�>��K0�
�J��b-��u��"�;��
�
��/��jD,2����A��ɌQ`E�!v�8��X����e�p�x�t>�_��tQ����U��@�2�ou���ޕ��]�t�Y�8��r�Д�mͷû��!Hn

�;��
+�3�R�
A}�I 銓g��7���r,�S����B���B� a�������;�yx�yFPFm���������p��=b��mǨ��m1k��
��r=&����P4R���,`sf"z�Km���OQ�*�@�2
΀⹄4Vh
+y؄۫Wc!	UO�w�����~#·⃶�/G�
���b_��v��h�Q"Q���1���y������_�r[Y�n�
,u
�v�`C����7(������^�o� �l��2`�6��;����sE�*�6�Q�%I�+�Ǧ�O�EO� T?��@ڲ�������C�n�	Z�����5g�R�N�d�C��5r��	
���
C\������
a�@�,"��}#�P
+ʓ�@q�(�}
z��뫱���v
 ՜�������!�)�?f%Ј
 }!���dD�@������3����Tx��]�����1*���-��*]:�tkfW�� h����-NI�
�
q66:�ʂ|�7\Ԣi �q$�����QB�	��}h㼺�%�cק�*�e��)R�H8y�H��K�r,�B�p�`��]��43����~`��~z~jT�V=(�$��f��
�k
+��ק�nג
1�F��:�}\�:½������oL�㷦3�o�Gt�Wʼn��E�SjI&���AC�<0�W���M=���K�6��Ri�������� I��:�d:�=��Բʚ��f�Su�
����R��M������c*|�+����Im�U��O����:^
�|T,�x��6ۡ
��
�����<.�y�̱�<�]��Uݓ,T�x���o'9F���oޘK����(�EQf�L���C�By�;d�+� ��)S��q�����ȅ���s�9�����/���tb��g����9�@+%HxJ�n�8-�X���-�B���IlM�jG��P"���B���8p[ �-��@t�׾
+w�'�
	ԁ훸g�
�q(������#��d�� ��`[4���4�����
t�c^g���0�e=H�H��4,�犬[�ŲZ�%ܹ:`3�ܒa��ꍢ�
������	�l^U��B��AKRq��1c�_S at _
�����b��j/!ȓ'3 �1���f��	�Em�n�  ݻ��Z at yZ�����A$�As�U���C��xPm�1�$�9�`��9��s��K���y�G�U�{�Ufe���q:�*�͑|;|�����k��st��C�P�四���B���C���OQZ�wHZ����*/�<I��J�C�(�U�JF��'��_gu�١@��ߎ��e��8?��
 �haH����Y�0
�6�)�yS���MM �
1�-9&�����A����G���q�f�&W��F��KY,�
+endstream
+endobj
+3077 0 obj <<
+/Type /Page
+/Contents 3078 0 R
+/Resources 3076 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3026 0 R
+/Annots [ 3063 0 R 3064 0 R 3065 0 R 3066 0 R 3067 0 R 3068 0 R 3069 0 R 3070 0 R 3071 0 R 3072 0 R 3075 0 R ]
+>> endobj
+3063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.857 295.838 243.473 306.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acfed8bc19e046453778c9d99d84df283) >>
+>> endobj
+3064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 267.771 155.464 278.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+3065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 267.771 221.894 278.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a12dc6df3a06f4c97c6bb2264bbad05ac) >>
+>> endobj
+3066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 197.563 181.845 208.466]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aedabe8ecd0866b972e97709e17f94681) >>
+>> endobj
+3067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 169.495 181.845 180.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aae5fd5e214d5b758e5f05360e8138131) >>
+>> endobj
+3068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 141.427 154.727 152.331]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a93c1c491c0035f6c38b9ee036184aa7e) >>
+>> endobj
+3069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 113.733 176.505 124.264]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aab2bb670f874f8dceffad602c09c3f43) >>
+>> endobj
+3070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 98.653 450.955 108.558]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aae5fd5e214d5b758e5f05360e8138131) >>
+>> endobj
+3071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 191.718 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+3072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 74.333 288.852 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4f289d7e8d85e3225df99b1183548db8) >>
+>> endobj
+3075 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3079 0 obj <<
+/D [3077 0 R /XYZ 89 770.89 null]
+>> endobj
+3080 0 obj <<
+/D [3077 0 R /XYZ 90 642.502 null]
+>> endobj
+3061 0 obj <<
+/D [3077 0 R /XYZ 90 620.087 null]
+>> endobj
+3081 0 obj <<
+/D [3077 0 R /XYZ 90 620.087 null]
+>> endobj
+3062 0 obj <<
+/D [3077 0 R /XYZ 90 566.427 null]
+>> endobj
+3082 0 obj <<
+/D [3077 0 R /XYZ 90 561.944 null]
+>> endobj
+3083 0 obj <<
+/D [3077 0 R /XYZ 90 505.774 null]
+>> endobj
+778 0 obj <<
+/D [3077 0 R /XYZ 90 420.35 null]
+>> endobj
+150 0 obj <<
+/D [3077 0 R /XYZ 90 413.642 null]
+>> endobj
+3084 0 obj <<
+/D [3077 0 R /XYZ 90 312.921 null]
+>> endobj
+3085 0 obj <<
+/D [3077 0 R /XYZ 90 312.921 null]
+>> endobj
+3086 0 obj <<
+/D [3077 0 R /XYZ 90 285.117 null]
+>> endobj
+3087 0 obj <<
+/D [3077 0 R /XYZ 90 216.642 null]
+>> endobj
+3088 0 obj <<
+/D [3077 0 R /XYZ 90 216.642 null]
+>> endobj
+3089 0 obj <<
+/D [3077 0 R /XYZ 90 186.841 null]
+>> endobj
+3090 0 obj <<
+/D [3077 0 R /XYZ 90 158.773 null]
+>> endobj
+3091 0 obj <<
+/D [3077 0 R /XYZ 90 130.706 null]
+>> endobj
+3092 0 obj <<
+/D [3077 0 R /XYZ 90 91.679 null]
+>> endobj
+3076 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F22 2982 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3155 0 obj <<
+/Length 2026      
+/Filter /FlateDecode
+>>
+stream
+x��Z]s�6}ׯ�S*�T0>�l7��c'�n㤱���$��)X�T�I�Q�^� E�$%9����C+�@�sϽ�6f6^N�'/3
�X�2�n
�t��_S��бG��~7�e#�X�)�������եz78�|x�
R��H؆
>~��
�n`�
۸��I�.���������O�1
�f�jj�:ۆ R��̖I��Ɣ�a6���(sş���~����*��Ct��1�A���K�[ƾ����RO^XvmB[�4��(�0fE+�[73���F��O�F��Q�8q�F(�ki	�*�!��a�	E���M)ot*�Hf�w/��1��'�0�l�������L&����!�pR�>�n�	s
���z^��Ƈʵ5�@�eRX��l��a|`7tGg�����Y��+v���/��͹��t���Ì�Ii���n:�x�T
)��at|�g�j
�g���(i�<�8�C{�zm



VG 
+��M��)�$K/����b�?
f����Շ�Xg���:a��a���}=��lr9w�Nt;�1��0�ԏ»J����`R�J����v���L�2q399_He���������x���w��]�9Sw�'i����_L��\��W�(!H5�B�8ӂqzv�!+i,=�IKIc���*�m��r�&*
}ݝ; ���jd��̟GA�(⃟�&�n��F�
���0y����?������!�&1Ȅn
�(^ՔO{*��p����N9��F��V+ �|�P,��ځ�f�X���X�B|
���n�i��e@#A�����K&�Rx�
�E��,ġ��8�}%�u9���1�k�Z��,^�}

�z�g
#TF��t�vb��đ���0ͭj�Б�W7�S����2�u
��8�|}�h�����`�i��j��
1{��S�9�-n��jXDyҪ��*'m�E/��
+uSE�����f�)��B�^)��٦��p�u�kˎ���4�
�0D-��̒�
=�
��8踽�艦#iҗE�%}��A�A�^l�BYP>��а��6�D%�.�sgW�S��xD��F��\N��6|��? E�7Ybm��e�J�Lx�v<�^B(��f��
����,Z���`o�<d�;|�<�:|'N;��4�֗:a�4���
�S%}����cu�hK��>����8
�b7�[������옘
a�T��>���3B�M���e��g� l󣇼ğ��9x�����<e���{���R!v����o�̝E��|���d�aַ��s����κ4�k��(�㾽��W�c�z���5
�]n���m���p��
+;��� �K��T9��;�[����PWe��V��j�Ur�8�ި8��0��^vuhߺ��G���,Z5�J�\o���P9����
�L�%ʹ
�w��f��yX��l
���V�ٍ�/<
#T�$m��rDS}k�|�g�����p� 'E�}8n�BM���"�6j��Zj��id�0�-aJ �N
+�����B&5�$���
�w
+����
+���������bz���^�Z�΢��"�^GS�f����8+?\鰧 ة!y�k]<tMyCګ�믷�J�
+"���
�E��ᬣ�/,q��
L ��ޞ�
 �7jO�ʖ��q,
o�Z3����سas]��oZ�
 �>48\b৵��s@���O땔���I�ހ
X[c�I�@��U�
$��א���
1 at 3����i0��
Sy��
1�2ǴCjL�G�WD m�6?2^������N
�j
�6�I��_c���;�쩢�9^Y��A
O}R~Y�
?[5>]ͳ�
+ImZ���~��q ��-��we-�e�ޕ�u4!mp�K�_a"�_���_�}�W3�"l=����o��jƱ ��>C�in�߾�C��2�i��P��.�#��W�Z2Y�m�8�v��3������������o�{��n
#s�ӚgY�����r��p�`3sׇj'��Z��)S� J�K���p����̞
+endstream
+endobj
+3154 0 obj <<
+/Type /Page
+/Contents 3155 0 R
+/Resources 3153 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3026 0 R
+/Annots [ 3073 0 R 3074 0 R 3093 0 R 3094 0 R 3095 0 R 3096 0 R 3097 0 R 3098 0 R 3099 0 R 3100 0 R 3101 0 R 3102 0 R 3103 0 R 3104 0 R 3105 0 R 3106 0 R 3107 0 R 3108 0 R 3109 0 R 3110 0 R 3111 0 R 3112 0 R 3113 0 R 3114 0 R 3115 0 R 3116 0 R 3117 0 R 3118 0 R 3119 0 R 3120 0 R 3158 0 R 3121 0 R 3122 0 R 3123 0 R 3124 0 R 3125 0 R 3126 0 R 3127 0 R 3128 0 R 3159 0 R 3129 0 R 3130 0 R 3131 0 R 3132 0 R 3133 0 R 3134 0 R 3135 0 R 3136 0 R 3137 0 R 3138 0 R 3139 0 R 3140 0 R 3141 0 R 3142  [...]
+>> endobj
+3073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.067 191.718 705.971]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+3074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 695.067 303.079 705.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_af051d63a780fb581f1d4555f2c882317) >>
+>> endobj
+3093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.635 667.667 188.679 678.197]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a3c7501dcb9894827f8edd8c3c428a79c) >>
+>> endobj
+3094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 603.393 170.255 614.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae348ffaa6b9c476915222198ac021f42) >>
+>> endobj
+3095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.071 603.393 239.714 614.297]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.878 603.393 409.266 614.297]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+3097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.097 603.393 484.344 614.297]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+3098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 579.604 170.255 590.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8ea9551f7124d61a3ba37b2625487cd1) >>
+>> endobj
+3099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.592 579.604 242.753 590.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.317 579.604 335.783 590.508]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.582 579.604 479.333 590.508]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 543.861 170.255 554.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a32f6f4de4f5f4ca71e465109241ae20b) >>
+>> endobj
+3103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.428 543.861 241.589 554.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.612 543.861 360.078 554.765]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.295 543.861 503.047 554.765]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 520.072 170.255 530.976]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ae19446701e7a216e5faefffd1188a2d2) >>
+>> endobj
+3107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.592 520.072 275.419 530.976]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 496.284 170.255 507.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a62a3609f7f68b60f8e54e534ff9d7d53) >>
+>> endobj
+3109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.592 496.284 282.045 507.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 472.496 170.255 483.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9d7348b591f41aa2bec4701aed6e3fd4) >>
+>> endobj
+3111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.592 472.496 273.736 483.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+3112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 448.707 170.255 459.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ab07eb7656e7af947b8c1190ffea0ef4d) >>
+>> endobj
+3113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.592 448.707 245.522 459.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+3114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.715 448.707 344.181 459.611]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.98 448.707 487.732 459.611]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 412.964 170.255 423.867]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aff1718bcc72c8835fa079ae5a0de448c) >>
+>> endobj
+3117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.496 412.964 217.096 423.867]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+3118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.795 412.964 258.521 423.867]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.403 412.964 373.869 423.867]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 412.964 513.996 423.867]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 401.382 134.28 411.912]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 377.22 170.255 388.124]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a67d795554d1caaf2ca4672d078eb3ee6) >>
+>> endobj
+3122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.592 377.22 217.846 388.124]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+3123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.126 377.22 322.592 388.124]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.391 377.22 466.143 388.124]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 341.476 170.255 352.38]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9ba9626bf1d58badcdf6931f784bef41) >>
+>> endobj
+3126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.122 341.476 270.391 352.38]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+3127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.275 341.476 396.741 352.38]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.805 341.476 513.996 352.38]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 329.895 156.965 340.425]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 305.733 170.255 316.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.995 305.733 221.801 316.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a266c8bcbc9ff3b87e744bf81a5d42afc) >>
+>> endobj
+3131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.138 305.733 294.299 316.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 280.074 180.198 290.978]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a91265643984fda317743e70a2f8f887e) >>
+>> endobj
+3133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 280.074 229.174 290.978]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 254.415 178.004 265.319]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a3be9bbebc060e84a56cd47a3e92f68d9) >>
+>> endobj
+3135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 192.629 190.738 203.533]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 192.629 261.85 203.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a70ae1ffea56bb9c7953cb0225caf4df2) >>
+>> endobj
+3137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 166.97 190.738 177.874]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 166.97 262.159 177.874]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a39b8f1fb08978701670894460a54cf61) >>
+>> endobj
+3139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.225 153.467 390.082 163.372]
+/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
+>> endobj
+3140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 141.311 202.922 152.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 141.311 248.58 152.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a67833db3724bbbb5ebd176933686d09c) >>
+>> endobj
+3142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 115.652 202.922 126.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 115.652 296.181 126.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a49528f56a14aee0673f8dfdabff8a106) >>
+>> endobj
+3144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 89.993 209.547 100.897]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 89.993 261.831 100.897]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a07e8e56f20bb15bc686dcabc5c6fa4a3) >>
+>> endobj
+3152 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3156 0 obj <<
+/D [3154 0 R /XYZ 89 770.89 null]
+>> endobj
+3157 0 obj <<
+/D [3154 0 R /XYZ 90 712.265 null]
+>> endobj
+3160 0 obj <<
+/D [3154 0 R /XYZ 90 320.939 null]
+>> endobj
+3161 0 obj <<
+/D [3154 0 R /XYZ 90 295.28 null]
+>> endobj
+3162 0 obj <<
+/D [3154 0 R /XYZ 90 269.621 null]
+>> endobj
+3163 0 obj <<
+/D [3154 0 R /XYZ 90 207.646 null]
+>> endobj
+3164 0 obj <<
+/D [3154 0 R /XYZ 90 182.176 null]
+>> endobj
+3166 0 obj <<
+/D [3154 0 R /XYZ 90 156.517 null]
+>> endobj
+3167 0 obj <<
+/D [3154 0 R /XYZ 90 130.858 null]
+>> endobj
+3168 0 obj <<
+/D [3154 0 R /XYZ 90 105.199 null]
+>> endobj
+3153 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F24 537 0 R /F66 3165 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3233 0 obj <<
+/Length 2143      
+/Filter /FlateDecode
+>>
+stream
+x��[ݓ�8�_�S�b�>���=lv���l�\f�^�-�e�;

�3����B�LL<��4�閺�SKlM-l���t߻y�3K �QϺ�X[�+�௱��&�N�`��[�`;����֡�N��L��p�!fa�z�槟w�p!�?��yGHM-.�E FK��"
�`����}����_�ix�y��)ǠLP[�qXH}磜��!�-����Je���C��l�
����{����n�ja�`,O���r)�kl�����Ʊ��`�;I|��>!�W��3��4�y\YϦ����O}1x�&�l�z=�[兜L�w
%�<��
Fky�Q#�s
��v�Ŗ}�y'\+�Ay���s��'
y
Ӄ�(�e��������c}/�(H'���/�a
+��[�t)��E�Ƙʱ��4
���+FQ�
+ �*X����<�Ff1�r-�
 C" ��ST̴�b&�
ͥ�DKu.1w��\�#�
���m��G��(8
#����-cP�&�
� ND%�a��h��p��Q�߃Q��a����
�
�e2��,��a�n?���> �a�G�(�a6���"�yn����Tf@�
D��h"�% 
9y� X�A�{kEݥ0�F��+݂�ڂ죀�mH�q��Hcg�9.�ӹ1�"��GÌQ�BA�8��	��!�z>"\gH@:��PƩC��t��w�?��#���"@?ʻ@��`
~)���� N�8
+8%���b���̃JBNT��jɤhU�/��&~�&�5�_;��� 8.[M3�s��W������"�3r�Qv<g�4r�'&g�arZU�4�������֏\M�B7��-V����(„��+��?j٫��f_3l���
~�lz�fٕ�Y4R���1�4K�Q��yNn� \f���K�H�a��fü��|�,��iT��Hû��H�k���ó�{��,,Ҭu��^)�J9/N9�r,ԗE%�n>ͤ~�m0�
X)�g�gZ[�� 
�E�Zhl=� 1G
�K]0���]�
j�$��Ne@�'�t�U�L2���֤P=q�lRκT�D�S8�59
�r��a���X�]p
��
>'q؎��
�Y�
�/��7�/~��ܣ�%
+�
�K��,.O��ҕj�T�i�D�)eҷ������lm���8���:
q�k�v�U�'�j���"�m���X2bq��J���5��T�����#�c6�=*�0>�c%x��um�oϨT��=�Q]�m0*,�u�A�0*����uƕJu<�%�U���P��L����Љܖ�L �9G ���� a�N�|i��t%,ZX���6랳�0��Cp�2%3hg7�s�6K> ���"�5+�51���{�q�P N��V�n�3�"����S��
;Y�:�Ԅ�СI��h���Y^��Qw�ΰ�	t�nբ�#��"0���,w>�,�j��Ŏ�.��*
�N"o�����
��׀��:э��8���ʾ�X����@Ҟ�
���l�KP-�"���b�=��c'�{ߣ�M��ަ�࣌�b��݋��H�7��
qo�HF{
+�Qǘk.����@�o�4
Gɴ:�/��l[+ &xg0�����rغ�2N�Y-��[�a��ɣ����Y�;�y;�
L�+�
ک�iYjWH���8pM�,�
��"������ߏ���:zT>�k�4k�&�u�4=�����h����y��Ǫu�Ӎ0��jG�� +�"���ި�0.�H��i�\^#zND�|��2֩��J�YԌ2Y\zN at K'��IQnU_89�t���4�����\���<?A�_U���i�wk��4g3�dk�~�#5ek�E8z66�H�����x���sp�k6��i�������36�uoL�2̫dN�g��o�*ų���E3yTm��������/�e�Y�։^���ߍ<�Y��

vҼ�
T�y�[
�L
+~�D�}>��Z��������V=�9e�~�Z}�Z{!��q��_�V������g.�?9��&J��ɲ���t�Z��͋�&Ad��@
9}i{'+���ǪZ���y
>F�&���X���.��L�h���=���椚��i�&�9/�
P��o�K��(<Zy
���ߧ�D�]�X=hn��mά�Sp����?U�@
+endstream
+endobj
+3232 0 obj <<
+/Type /Page
+/Contents 3233 0 R
+/Resources 3231 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3026 0 R
+/Annots [ 3146 0 R 3147 0 R 3148 0 R 3149 0 R 3150 0 R 3151 0 R 3180 0 R 3181 0 R 3182 0 R 3183 0 R 3184 0 R 3185 0 R 3186 0 R 3187 0 R 3188 0 R 3189 0 R 3190 0 R 3191 0 R 3192 0 R 3193 0 R 3194 0 R 3195 0 R 3196 0 R 3197 0 R 3198 0 R 3199 0 R 3200 0 R 3201 0 R 3202 0 R 3236 0 R 3203 0 R 3204 0 R 3205 0 R 3206 0 R 3207 0 R 3208 0 R 3209 0 R 3210 0 R 3211 0 R 3212 0 R 3213 0 R 3214 0 R 3215 0 R 3216 0 R 3217 0 R 3218 0 R 3219 0 R 3220 0 R 3221 0 R 3222 0 R 3223 0 R 3224 0 R 3225 0 R 3226  [...]
+>> endobj
+3146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 707.957 209.547 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 707.957 309.432 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a6871eebde08090cb02572b4f8daa467f) >>
+>> endobj
+3148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 671.665 228.895 682.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a817f9a9e8d05f1dac454e3a8da1075c3) >>
+>> endobj
+3149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 671.665 333.482 682.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 648.039 229.503 658.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0cd2f7c7eb4acf21db838c99cec45209) >>
+>> endobj
+3151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 648.039 334.089 658.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 624.413 187.264 635.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a322bac0792d905334bff250275c75604) >>
+>> endobj
+3181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 624.413 293.213 635.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 624.413 371.148 635.317]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 624.413 455.727 635.317]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 577.873 187.264 588.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a24830275e95c7145681ef8f8f8406eae) >>
+>> endobj
+3185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 577.873 293.213 588.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 577.873 371.148 588.777]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 577.873 455.727 588.777]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 565.918 220.058 576.822]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+3189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 531.334 186.348 542.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a59614f8f6b4560e5c59ee0323ae94c8e) >>
+>> endobj
+3190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 531.334 293.772 542.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 531.334 373.367 542.238]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 531.334 456.837 542.238]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 484.794 186.348 495.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0f6c31cfbda606cce98b462d4ac77965) >>
+>> endobj
+3194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 484.794 293.772 495.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 484.794 373.367 495.698]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 484.794 456.837 495.698]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 472.839 218.404 483.743]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+3198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.772 438.254 187.446 449.158]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac2b562d993daccd41cbf9b49008f112c) >>
+>> endobj
+3199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.73 438.254 292.979 449.158]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.431 438.254 370.447 449.158]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.745 438.254 456.762 449.158]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 438.254 513.996 449.158]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 426.673 159.485 437.203]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.603 426.673 240.62 437.203]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 391.714 180.496 402.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aea2a4666928ce284581790d37e94eec7) >>
+>> endobj
+3205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 391.714 252.994 402.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 368.089 213.153 378.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_add45a2b2ae350cc34b4721214548d68c) >>
+>> endobj
+3207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 368.089 285.651 378.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 344.463 213.163 355.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_adca2c5c09b89833b1af80fbade02cf86) >>
+>> endobj
+3209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 344.463 285.661 355.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 320.837 205.692 331.741]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+3211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 320.837 261.312 331.741]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac655c600b28b5286dae20fd0330e6565) >>
+>> endobj
+3212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 320.837 332.156 331.741]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+3213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 297.212 205.692 308.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+3214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 297.212 261.312 308.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a3e34e0a5b5b5841e189749bf9d1cd295) >>
+>> endobj
+3215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 297.212 338.781 308.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+3216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 273.586 205.682 284.49]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+3217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 273.586 261.302 284.49]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_afd5346bf36add8144c7b618fc31da567) >>
+>> endobj
+3218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 273.586 330.462 284.49]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+3219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 249.96 183.824 260.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a2d1adfbfb01688a6698e37f170e3359b) >>
+>> endobj
+3220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 225 192.272 235.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a7e6ea8860a9be5cfadaefc0954a9a214) >>
+>> endobj
+3221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 199.667 189.901 210.197]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a7fd7969cfe0f6714a7937407b66bb053) >>
+>> endobj
+3222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 173.96 241.935 184.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acdfc00755efc1b4105caf1e460a8b1c9) >>
+>> endobj
+3223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 149 193.229 159.53]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a571cda80a2239703a8588dc5c4010144) >>
+>> endobj
+3224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 123.292 238.459 134.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acab010b53f9252b4dfa62eb9f9f78061) >>
+>> endobj
+3225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 98.332 187.689 108.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a132b0fc4c8babd873edebce9d3f8efca) >>
+>> endobj
+3226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 98.332 226.693 108.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 74.707 161.677 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a810ed3dd32909e9882ffde86321b2a73) >>
+>> endobj
+3230 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3234 0 obj <<
+/D [3232 0 R /XYZ 89 770.89 null]
+>> endobj
+3235 0 obj <<
+/D [3232 0 R /XYZ 90 721.073 null]
+>> endobj
+3237 0 obj <<
+/D [3232 0 R /XYZ 90 265.085 null]
+>> endobj
+3238 0 obj <<
+/D [3232 0 R /XYZ 90 239.752 null]
+>> endobj
+3239 0 obj <<
+/D [3232 0 R /XYZ 90 214.418 null]
+>> endobj
+3240 0 obj <<
+/D [3232 0 R /XYZ 90 189.084 null]
+>> endobj
+3241 0 obj <<
+/D [3232 0 R /XYZ 90 163.751 null]
+>> endobj
+3242 0 obj <<
+/D [3232 0 R /XYZ 90 138.417 null]
+>> endobj
+3243 0 obj <<
+/D [3232 0 R /XYZ 90 89.458 null]
+>> endobj
+3231 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3312 0 obj <<
+/Length 2590      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸~���S*�D0� �Ngv�M'{k;}Iv4�ɜJ�BRɪ�� �(ɡ
gv��A�����p��� �y�����+�iI��z1�x��FB����!�x����&D���\��z�ï�W����/���	���l}��7<�C����]���S����ſ/p�K����  �$����GE"�3�֤�8J,�����F�
����^5��!%I�)\��T��4���M���'x徖A�k�P@�!>`���H���6L��I�i� 5j����*�"�Z�h����4�Q� ����
)	�  ��PW��̌_�k%�&����#
Mb�	��o�Ŭo��=��E����Io�i�i�I��<\����?|�rru;ݚ� U\a�0�pI�4-������X`�mDAI�<{g/3$�u������
XM�i�M:��,���M�E'�g3 C���m�$'���
���繲��l�̈́�Y�-v�Ü�&�t
ͳ�)$i�!�4���Ԭ��lv��d� ��X 
+��h�#tn,^#
��fB$C��^� At�	u�h� H�>&ĬzD��	��ː�A��ly(a}�*����FL�h�lQ���T��/Z�B8�=6X�HB��,��Hz�;�+/�V�$���B�uS�mVg� L�`�a׃5�6�����̬:���9	Z)�Q��@���,�GwCB@����^�V'h�I?�
4zW/B����E��r��R2��]�i�2QZpt����f"1d�AP[�
�9;&
+� xh�r
3����B�D��DJ���|��'_X�KL/����ʧ*^Z�����}�
�=1�aa��{�%�i(�*�~���A0֞A.-�|�\�rDD����j�v��k���I������R"���pO6A'���IIX��H�8
�Q��[����J!��Rm
��,�0��j�f��DzU�󂑿g��R�H�V�~k��:��(51@
��j�:ZlZP�X��G1 at us�NL�
�@�-|���Dа�U�i<Yl��
?0�7
�	u�QY�?{���+�
����YP�6�5I�n�w�H!��<��bP(0~Wi��^�>�)
�Y���uCEg��V�1�pUWݳ�Y��+���s�!d��0�\!cD˚�G!]ޔq�]�e,����dL1���Y
.o�S}���{�����f6c=��Ӕ�t����:���{y�t*�a=��nת�������.�{�ՙ6�>��X���ǃ$q��o��Q��W+"��{�*D����6Z`C	�K(-�tϩ�mr�N����n��?�F�D���D&���?c��!��	!@}Vѐh�s���4M���jds�f�]
b����p�D]�
x$Z�.X�'�C�/(=BT;Tdp^P����A��
�,��#A�B��*285���E�������p�&��b}��O�
d�̞/�" 6�d�>5V(�;
�H�I%R�#��tD*�R'C��0��W�*W��0U���0E���S��|*aJ
d��"�˃�
+g�ș�*ˌ>�fWP�K�5>j�ƥ���}FO�c5/
`����Bw�*+	�!Y��q��	�n���x𑊩'�ߵ�২�
�
+
+wIύ�n��B���&N!�V|�	�q�<���&�I�"�\��v�
+Mc3�q��Ynۡ�np���:��ɺy�2�/���� ��(�Ŭֽ.}�B���,�g�
ڃ�7�֕|���K�Y_l��]j�sz<�B 
f{���)3�t��
Ы}M
�����r$Jx�Dֳ��	pzi6���M��O�H��� h�#Ĉ����4>�'�+��	>�&I��B�mX�EYej�*y�+
�Q�fU�X��s�ȸ?a��f ��ʴ�ff�%K��P����v8n��C��"��ʿ��X�jV�cW��率!1��Xl�}���>ZO�ٓ 9�=�
q���K�J�M/���F�U1���
�
�z,c	0b�O[q131���K�
l�``-e�%gP
g]�P q��"P�-�1�LV
��R"�U�b�m�V����o!c���,%����m�&��
�����8��X���V6��&zUd�)ı�nH�u��p
��|�0
��'�μ�+$'Cp.&�2��ҧ��^�بi�n��
|���omռ�%��?P�qzL�aE� �Tj�:_\��$�a��)�「L6�V��¿�D]t��Hs�>��W���͗7V�d�փJv�H5��U�:��3l�>��8A�
+h_g����%��7j|�ˬ��7H�6�fh3�d\�i[��6m#=!U�{5��*�Cn�&��Mg
�{�$v&馟�i�&��j��z*�O�(;n�J�d����WYI�
�vz�H�S���C'D�@�>�2{$�օ��!���˚7�%E
+4t�M�ʇ\!���a����ʳ{��5\�^���
+ɍ�޸$��E�
�`�l�����؛7?g+����2b���t�]�$i���z>(��� ��M`�� ��a�L.H��
����E�'����l�6M�����--�l��
���C�
+;\l�+��M\=vo�-1���p6C�
+endstream
+endobj
+3311 0 obj <<
+/Type /Page
+/Contents 3312 0 R
+/Resources 3310 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3026 0 R
+/Annots [ 3228 0 R 3229 0 R 3258 0 R 3259 0 R 3260 0 R 3261 0 R 3262 0 R 3263 0 R 3264 0 R 3265 0 R 3266 0 R 3267 0 R 3268 0 R 3269 0 R 3270 0 R 3271 0 R 3272 0 R 3273 0 R 3274 0 R 3275 0 R 3276 0 R 3277 0 R 3278 0 R 3279 0 R 3280 0 R 3281 0 R 3282 0 R 3283 0 R 3284 0 R 3285 0 R 3286 0 R 3287 0 R 3288 0 R 3289 0 R 3290 0 R 3291 0 R 3292 0 R 3293 0 R 3294 0 R 3295 0 R 3296 0 R 3297 0 R 3298 0 R 3299 0 R 3300 0 R 3301 0 R 3302 0 R 3303 0 R 3304 0 R 3305 0 R 3309 0 R ]
+>> endobj
+3228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 661.099 205.752 671.629]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0dcfbef37051b2a6d19c103cae4fd05e) >>
+>> endobj
+3229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 661.099 276.595 671.629]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+3258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 637.098 212.377 648.002]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aee6f239b759a4e7001d2018fe0142193) >>
+>> endobj
+3259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 637.098 289.846 648.002]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+3260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 613.472 209.627 624.375]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acf0acb2be8236174a75d2044613dfc17) >>
+>> endobj
+3261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 613.472 314.791 624.375]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 589.845 248.202 600.749]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a7a513effc5fdf2da0f04fbe26c874eff) >>
+>> endobj
+3263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.018 589.845 329.845 600.749]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 566.218 216.252 577.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4ff866dbcea2662194a1e8541a6e77ec) >>
+>> endobj
+3265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 566.218 328.042 577.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 542.591 254.827 553.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0d2b8d6a7fc03c4f5ca8f82264c8665b) >>
+>> endobj
+3267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.643 542.591 343.096 553.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 519.338 236.745 529.869]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4f9abd7604d980aada03b937e3c8d928) >>
+>> endobj
+3269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 519.338 307.588 529.869]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+3270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 495.338 243.37 506.242]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aa37486c5f7e745ee0297c151c1709c27) >>
+>> endobj
+3271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 495.338 320.839 506.242]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+3272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 471.711 240.62 482.615]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a7e9d64ffc94c61daef4246b833efc0f2) >>
+>> endobj
+3273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 471.711 345.785 482.615]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 448.085 247.246 458.989]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a13e45ff9cb1e2f17deffb62b0dad2e7e) >>
+>> endobj
+3275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 448.085 359.035 458.989]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.173 412.503 290.391 423.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a416575f07c033f50b7232cbd32c782ef) >>
+>> endobj
+3277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.876 412.503 374.291 423.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+3278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.612 412.503 416.339 423.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.628 400.548 229.044 411.452]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+3280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.291 400.548 270.018 411.452]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.515 388.061 256.856 397.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.505 354.007 339.621 364.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a798f3b87e54a6c934c17626f2316e375) >>
+>> endobj
+3283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.769 354.007 420.184 364.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+3284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.836 354.007 460.563 364.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.133 342.052 274.549 352.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+3286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.978 342.052 315.705 352.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.256 342.052 513.996 352.956]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+3288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.369 317.61 256.71 327.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 283.556 255.714 294.46]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a47b43abdd9ab63d425cff5975ab469d6) >>
+>> endobj
+3290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 260.303 193.577 270.833]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a6945e8de7f4abb44bbd6bf522f4ab18b) >>
+>> endobj
+3291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 260.303 232.581 270.833]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 247.443 248.845 257.348]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+3293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 225.717 193.577 236.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a3a679103070e0356c10d4a1ef627f78d) >>
+>> endobj
+3294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 225.717 277.691 236.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+3295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 212.857 247.177 222.762]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+3296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 190.758 223.465 201.662]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a80396c0358a6779da28e96e8056e87f2) >>
+>> endobj
+3297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 190.758 295.962 201.662]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 167.131 229.552 178.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0d75045e4088147a88f089b9d8c8df80) >>
+>> endobj
+3299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 167.131 302.05 178.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 143.504 266.673 154.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a2b71578c4754dc514ec9230bc0b27531) >>
+>> endobj
+3301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.01 143.504 339.17 154.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 108.919 299.171 119.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0658fdb9ef74cb1d3915d0cdafada883) >>
+>> endobj
+3303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.508 108.919 371.668 119.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 74.333 217.109 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a44c65e7b5033b536da403cf38c420a9c) >>
+>> endobj
+3305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 74.333 289.606 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3309 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3313 0 obj <<
+/D [3311 0 R /XYZ 89 770.89 null]
+>> endobj
+3310 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3409 0 obj <<
+/Length 3472      
+/Filter /FlateDecode
+>>
+stream
+x��\m�۶�~�B�\i&� <ugb'�8u׾6�$
�D�8�D�����.@�)�"6q2��(
+v�g�]³���������/$�)�<��n�3�g�+$<���}7'��5���-��6X�[P<O��&\���mt���ŋW�-?l�}������_��(���aP�럋&��0�e���>"L�
�2���8Ȳ�5:St
n�q��ŝ��:Lğ��;�%9�)�}^}~s���n��H�����w?��
+n9È�2���v�)������?���l�����3�������p)	A����,��wV�<)t���S�G�W��=Ƭ4i4��Õ��M����)C�#u#k�l�q��ŧW�ٻfZ��]�˃h�Փ�}h��i�������u�>D	���^�`���䩪ѱ��X52
Q�!���v�G��,�Sa5�T8O;��zn�$���c����ޛƀ�h�>.Xw�

.����/��n�C�c��%L�پ�K��ų#tB�oj�]
S�q�R��vY����B�O�̰
�a����
�Qdنa~�/|0
Ӈ�c��v9�]�GɩY��n_���{rM
�|SЊ���B�Ң�B ��x/��\�߬;��_I��,�B���0ʚ��t�>�O�5A`Mp�&��+tٵ�"�Nu@�@U=	�]
} ��q!����Q�?���{01+Z�;
Q��
*���]�����Ɋѭ���g��Xe�Ɲ�?�1�t�������
+���va�.?�i����N�V7zV ƾ���$�����]��� ʳ/̨�T�B��z}���!&)am�m�
�$}ٯ��0ɮ��1����C�2ap��0P�p��-SJ�f��#-M`_�=�|�B����'��t��̀N�����
+]a���p}���?m��� �������`
²�cдctx�+a�'��
��aִ��acL���O%�g\h�4@
����.Y}�*ou7�p�Ʋ��_`�r$��:�C8f��HIL�Rf���_�[#S�vT"�U�x;=yHԔ2?��]��(�F�tW���n�t
 =��x�� ъ	���@�]@^'����P�?Ae5��~��_h��Z�/ $��Pg&::n���V��9
�bI�O缧ۛ��Zg�Pό;�{�ʘ�3n
�x���*�x����5�H��C~ڃ��R.'B~��8�'�O�\�j!��@{b��9T� �y;����u��@�C��x�C�B�F���sn����9
#<	z�gơ�
���U���d�
5�	W��T
�yʅ<`{���^ xL�i(S����
���Q��꾇h�u���iQ]�H�(���W�a�LT����$-Mk�
�|��n�MJ�R�����d췱�ֈ�?U��?�G$
+��RB��H��]�TG<�)���F}>�wa����r8Ѧ����)���06�����6��dI�8;n55��C%7| );��${�����(Yo�N%���1��nAFu����7 �����=֭�)��Erh�B���~	ZyNɒ .jD\9/Q�әА^Pu�<�-�ak$�T=�
֭ЂH2n�B��#`��c��:0�n�p&���� ��h\m� �7��b���8c�}q ��L���AL
$Դ�+O����n`t�R9�5b��<�
ύ
e��*�:�Y��
+껻KV��Rзb�Tu��ʱ�VJD�t���'sА����P��mt0>���
�x��	
�၀�{��nV�����̤�l�R)��	�D���g�D�於
��V7�K����u����{>��'�=�¬�j���uAo�c2 �
p�3��K�qT�M���OX��j/��<�����>on5�

+pP�]D�
 1��5�� ���t����^ܗ�O���O30
�<�YM�'ٵj���'�
�%�O�V��(�G�L��
.,F��|�<�
{-0�r.�
��n���^��S
�1vJ��a�q4
�\���\�z-�a��_D�˾ ��@���ai�0��'φ�
��0��� Y�L��a�C�?�`0���i��!���'�(y�o
`�Mx5� L ���ɋF P �! >)FT}�aðv|
+6
�&F�a
���0���
+�rƌ9X�5w�C�{��R�6|q9�3>�Mt�L@�������.��!���'��Y|�l�֧u߻�5 ���qOd���	2V
�w�Fm�4�yuȕ/��X�I\�f� iF@��ri�[�]u܉��$
A>#���W���J����H���b�H�
+�Ձ9�#Q ʗ��mW��<�C{ݹ
�lV��ǔw�⌼$p�<hʝ(V��(q�3q���vߴk"|T3��yP��@
+ ��8�%�`���(
=-�`c��&$|�M�Π�����Q��kgc����w�%���.��K]�t.zK�BLUJw�Ũ�9�=uoZyT������.�߳u���[���?!<�������؅�����'3�)��
�S�GtTx���px2�¬W��G�8E4X��|�F)ri��s�Č
+��0NU}Q������@�(�b��)�E�p	kd�����a�։F�R�8��!ڃ���!w�1��0x��n��1
w]��$��3��c^�g��f�L�S�=�`��O(p:�*[~��
+�eWCe�W��G.��ty��$����h� �u�������R�z���&Y at i�)
+5����y;~з�T�d�-�x2�3j�ad�8
+��/4V<��1����ʛ�0ٱ.
�
+�E}�-�/qy�PS�s�;�XeyL���Q~\���&�W/�gY�9�k��_F�U�
��A
_��!�ſ���L�T�0҅"�i��[�+����ܙ
c�@�|:�3j?���$Qi�&�e�@h�%�e�p�}���u��;SX
���ŝ�3)ç�v���޽���on���~v�{��U�v��D��
�����r5yP��#� 
�<)_��>�����T^_��
+&��L/���\D���+M��l�LL,J*��L���¼?�K��z�~rD,���X�u��pL8�7�g9�>�~	g�3���y�L:�
�|�X_��ʗu�*|��}�h�rqs��o� a���]u6�Ig��.I�\8� RQ�γ�
C�6OMu� A���`i��S����$N ^��IvH���'�&3?
+���Q^
��5e���=�x�8J}����x��b
+^���-���}��s�W�Y�bRƊs�5��:
��r�m'>���
�ّ���Ԏ��a��I��P�nJj������Y��I�������ݡ�nm?ˇ��<`ᾖ
- ��ai�B���ʫ���RN�M�Ț`���ϟ�
���# �S�j����u��IZ���>bj���Җ�z����+�0)6��_��|Y>ho<�e��0r��F���+
+endstream
+endobj
+3408 0 obj <<
+/Type /Page
+/Contents 3409 0 R
+/Resources 3407 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3416 0 R
+/Annots [ 3306 0 R 3307 0 R 3308 0 R 3334 0 R 3335 0 R 3336 0 R 3337 0 R 3338 0 R 3339 0 R 3340 0 R 3341 0 R 3342 0 R 3343 0 R 3344 0 R 3345 0 R 3346 0 R 3347 0 R 3348 0 R 3349 0 R 3350 0 R 3351 0 R 3352 0 R 3353 0 R 3354 0 R 3355 0 R 3356 0 R 3357 0 R 3358 0 R 3359 0 R 3360 0 R 3361 0 R 3362 0 R 3363 0 R 3364 0 R 3365 0 R 3366 0 R 3367 0 R 3368 0 R 3369 0 R 3370 0 R 3371 0 R 3372 0 R 3373 0 R 3374 0 R 3412 0 R 3375 0 R 3376 0 R 3377 0 R 3378 0 R 3379 0 R 3380 0 R 3413 0 R 3381 0 R 3382  [...]
+>> endobj
+3306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 697.131 271.126 708.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aadefe87cdfbb2c5fb288f045538d271c) >>
+>> endobj
+3307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.463 697.131 343.623 708.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.863 684.637 326.259 694.542]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+3334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 662.529 198.26 673.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac819bb3796a10a52e28d4a0c74338413) >>
+>> endobj
+3335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 662.529 236.665 673.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 662.529 353.317 673.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 650.947 246.458 661.478]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+3338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.562 638.079 267.759 647.984]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+3339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.583 604.016 222.689 614.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a5c88ed488f60782df67bd2ac2b6c2731) >>
+>> endobj
+3340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.988 604.016 261.176 614.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.804 604.016 355.22 614.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+3342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.95 604.016 395.676 614.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.268 591.521 288.464 601.426]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+3344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 569.413 212.768 580.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8ea88c8b9c07cff8afbea97a30fd8402) >>
+>> endobj
+3345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 569.413 252.959 580.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 569.413 375.145 580.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 557.832 286 568.362]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+3348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.657 544.963 275.748 554.868]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+3349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 522.855 250.099 533.759]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_af13f330a6140e378687d9bbef46e52a3) >>
+>> endobj
+3350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 522.855 289.446 533.759]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 522.855 379.512 533.759]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+3352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 522.855 513.996 533.759]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 510.9 416.369 521.804]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+3354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.43 497.196 403.696 509.361]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 476.297 250.748 487.201]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_acd9aad06b85b345bf27c50403a4ed5be) >>
+>> endobj
+3356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 476.297 357.317 487.201]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 476.297 456.145 487.201]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+3358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 464.342 202.344 475.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.462 451.847 409.185 462.803]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 429.74 261.881 440.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ab22fa6ad8c08777e4e4872f46e93294e) >>
+>> endobj
+3361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 429.74 300.286 440.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 429.74 388.504 440.643]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+3363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 429.74 520.199 440.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 417.784 416.369 428.688]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+3365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.141 404.08 414.324 416.245]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 383.182 261.881 394.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ababff4889ba6ce01e2eaf4454db450eb) >>
+>> endobj
+3367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 383.182 365.272 394.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 383.182 460.793 394.086]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+3369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 371.227 202.344 382.13]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.012 358.732 414.183 369.688]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 336.624 239.984 347.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aed0a7bbd57c5a7ebbf13e37927a79394) >>
+>> endobj
+3372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 336.624 280.82 347.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 336.624 405.104 347.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 336.624 513.996 347.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 324.669 171.361 335.573]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 324.669 478.077 335.573]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+3376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 310.965 432.092 324.123]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+3377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 288.863 251.209 299.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a30f39e11a47c43d5748bf61ab5b128fa) >>
+>> endobj
+3378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 288.863 290.549 299.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 288.863 409.969 299.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 288.863 513.996 299.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 276.908 171.361 287.812]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+3381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 276.908 478.077 287.812]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+3382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 263.204 456.992 276.362]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+3383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 241.102 224.57 252.006]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aefd226c7945e61d8cd18f9e63cbe4655) >>
+>> endobj
+3384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 241.102 297.068 252.006]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 228.608 347.869 238.513]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+3386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 217.459 196.297 228.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a7691d9950e06ce1b4282f70ce7f4f1bf) >>
+>> endobj
+3387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.439 217.459 279.215 228.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+3388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.718 217.459 432.878 228.363]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+3389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.827 217.459 513.996 228.363]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+3414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 205.504 216.491 216.407]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+3390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.094 205.504 362.977 216.407]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+3391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.254 205.504 475.081 216.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 181.053 164.537 190.959]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+3393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 169.905 273.129 180.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a7e23ffbc30ab77025fa08d20098d3d36) >>
+>> endobj
+3394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 169.905 352.41 180.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 169.905 495.961 180.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 146.261 275.007 157.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a28f0f720c0985b12628cc8503aa993d9) >>
+>> endobj
+3397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 146.261 362.877 157.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+3398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 146.261 472.148 157.165]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 134.306 233.986 145.21]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 99.703 255.564 110.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a863d6eb629dedad5b72d5bef6bcab9f4) >>
+>> endobj
+3401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 74.333 257.637 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a88c770a5e454fd7a600b2be0bcfbfa0e) >>
+>> endobj
+3402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.974 74.333 330.134 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3406 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3410 0 obj <<
+/D [3408 0 R /XYZ 89 770.89 null]
+>> endobj
+3415 0 obj <<
+/D [3408 0 R /XYZ 90 114.837 null]
+>> endobj
+3407 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F39 2335 0 R /F66 3165 0 R /F42 539 0 R /F67 3022 0 R /F38 3411 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3485 0 obj <<
+/Length 2499      
+/Filter /FlateDecode
+>>
+stream
+x��[[w�6~���S*��� ����l��M�i�������lk+�,I�����7���XN��>$"	` ��7�
H���O�=zqzt�Z��BJP19=�(<��B\��j�~J0��z����%`�}��O����Ĵ
}sz���&<!N G2�,�G�œ<�~�S���v�N��w399���k���kS�$������Q��� B�B����8��)��"1�9~-��(��Z����C at B�)@�e��r��N��)CR���v�f3&�:���>9w��d�^��¯
�e9-e^]?{4yo;�|)�\�(�~,���(M6Q�Nb?Ω��>�ō�q�~)f(d��p�����:�v��U3��^`��{s0D��
��(���$R3(D��7��)�L�U0��G%
+Uv��+�)I ^;Jq��8�z�)tI�!��h���Ur�R�����1t�^
�q>����'*XD����|�
/�8/��x�8��R�%���L��s�8Q�ƽtL���m�N�&��b�<�݅
]0�j�;[
�
+ie���EZk����js��u��d@��cğ2F�8�c@jz���c��Y�t
��C�.>�.�D�
 �
+�D(G �|P(�S	zdC@����t^ڴ� zD�H��!�
2H�0���Q���u�W
��Ld�����և�Vc��Y/M�,Z����6�\�S�2n3Z�88R��".�]<

�2�h
��7�4�|�̀^���%#
*��P���C
<�h�}��
�tq�s�b���:��&Oܕ�������9�����
I�E���q
+
�W�[v��P`���\d��0> 6�:
2| ��r\��a�I]���o�o�����^��_jo| 
+j�>(>��8d�l��-Az6���,Kf�Oo>���H�
���
���I�b&JY��̬Mf2�k��[�G�N

+�L�P�������Ͼ�A�q
E���.�e�!����;"�ȼ�v���s�n�K�;�I�:�	SaE��*����1�� Ô��/`|:B֝�g:u�R��������G�`�Xv�Wt_C�iZ4h��0����
�Q�M�
|��
`
)ip^vr	����h��0$��f>�PP�a��zj�^ ��
+]`����Z
:X����x����jȎSqȃ�'�
+
+E� ��
+
"�M� *<�TG���FG�0J���jEj&
��P�}���R���G�0n�	�[�	�>���X�;�#����t�ɉ�x����~�	�����@fJȝ%:��E8�hE8��s�a@[l8�A{�8�8�_���nqn�uŹ�*Ρ�'+a�
.�"D���
���J=P��vr�C�B�#�(��^�B�NQ)ʜJ���{��g:sk~}/mS����F~�o����vgۯ�[
Q�Z���U�/�{x���M
<8I��

+F`��ې����a��V��̺X�����
��U��ʜVR�5\���'�&���j�w9ňH^Z}�Y�
ZE��F���z��}c��V��͒�o}���]�k';�Z�z��0�p���C&��M��?�uJ��٪�ce�U�}�8)���]�f2�u�_��*�Q�c��$��B=3R�=�i;�LrH}���2�~3y��w}y]���� �v��RH��A
7��� �����������([Gg�/Ntg|vm�֣,�[�l7Q&��yQ��庙B�{��q�c��r}q��њe@�4�1�Y��J�nGݤ�'��]�QGu��⹯�K�^F�zGx'��
�b��wt؜ɑ�
+2DX�'�
�;[�d�:�,�T�c�.C5�=��ۇ��d��$J�H���Dz�c�b$�l�Y�t�Ow}s�j�O-\tY.}Ю�߼[GÚI��\��}��~�x��ER���X��1���p?
����
9~��
`�;VP�w%�u���k��F
�Y��T�#��$nySW�!)��:�����C�S�˜9RW����9m_0�x~i]�V:/
�T���)\�.�Wa����\R5�}w�j��.Y����Ǟ�
2�q@�=E
~��E�A�
�9o�,���I�R����G0
+=2�I~�6Yf���b�\Mtf�v���|��Z_$w�
Fn�WI��h�C��)F�*����a$믌��P�[G�ә
�r��@-��C
����.;Q��e5�3�X
߲�̋�o����^~�
�M!,��+��bJ��p}��uq���m
���C��[����A%o��FG�Ǫ�����q�V
 �Qbؗ�rN�]���tS�VǺp]�vۣ�=`��(��i)w�j&1��~
�
�����O�(��>���D\ٿ�
L����66�mc9�?8~�e�W	���A޼h�p��d	��-'u�-=�ݻ���:�ʼ���c���Lh�2\Q��)A$�t�^���'���[�o��0�
x+��ױ��(ҿ
�]]�:�@�d�O8�`��
+��D~k��
n��5�[�-<
+endstream
+endobj
+3484 0 obj <<
+/Type /Page
+/Contents 3485 0 R
+/Resources 3483 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3416 0 R
+/Annots [ 3403 0 R 3404 0 R 3405 0 R 3432 0 R 3433 0 R 3434 0 R 3435 0 R 3436 0 R 3437 0 R 3438 0 R 3439 0 R 3440 0 R 3441 0 R 3442 0 R 3443 0 R 3444 0 R 3445 0 R 3446 0 R 3447 0 R 3448 0 R 3449 0 R 3450 0 R 3451 0 R 3452 0 R 3453 0 R 3454 0 R 3455 0 R 3456 0 R 3457 0 R 3458 0 R 3459 0 R 3460 0 R 3461 0 R 3462 0 R 3463 0 R 3464 0 R 3465 0 R 3466 0 R 3467 0 R 3468 0 R 3469 0 R 3470 0 R 3471 0 R 3472 0 R 3473 0 R 3474 0 R 3475 0 R 3476 0 R 3477 0 R 3478 0 R 3479 0 R 3482 0 R ]
+>> endobj
+3403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 708.28 378.454 718.186]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.703 684.956 257.24 695.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac14604e047be1b9b21de64d12efd4574) >>
+>> endobj
+3405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.783 684.956 328.943 695.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 660.285 378.454 670.19]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 648.915 257.786 659.819]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1a3d9e134f0d16c37a70d2a27047c3f7) >>
+>> endobj
+3434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.123 648.915 330.284 659.819]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 636.2 375.773 646.105]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+3436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 624.83 305.745 635.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a0116f88c40d760b836053dc1ef9ed4ca) >>
+>> endobj
+3437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.887 624.83 377.048 635.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.46 624.83 494.287 635.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.489 600.16 302.72 610.065]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+3440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 577.831 245.911 588.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8753833d56000447de862c0bf26259b7) >>
+>> endobj
+3441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.248 577.831 318.408 588.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.912 565.116 521.824 575.021]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.576 542.787 292.328 553.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aab43c1426f6a2f0fbf049242786c2f0a) >>
+>> endobj
+3444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.618 542.787 367.778 553.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.662 542.787 491.489 553.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.622 518.117 310.533 528.022]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 495.788 236.197 506.692]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a883c6690834c25c2a363ccfdee259851) >>
+>> endobj
+3448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.534 495.788 308.695 506.692]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 483.073 357.84 492.978]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+3450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 471.703 214.06 482.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a65e4afeac0b018f92c0111764182e8b8) >>
+>> endobj
+3451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.398 471.703 286.558 482.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.221 445.626 284.876 456.529]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aaac5dc37ad883270db68e3ca168d410f) >>
+>> endobj
+3453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.455 445.626 357.615 456.529]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.095 445.626 476.922 456.529]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.902 420.955 286.2 430.86]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+3456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 359.469 289.866 370.373]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a38d2d7506b66e2f0f019e4558662eeb0) >>
+>> endobj
+3457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 359.469 359.324 370.373]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 335.384 290.971 346.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aceaf5104c60fa96b7a7b0f3b386d870e) >>
+>> endobj
+3459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 335.384 360.43 346.288]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 311.299 224.003 322.203]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a1150d4335975e5975c312dcca1f559f4) >>
+>> endobj
+3461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 311.299 296.5 322.203]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 298.583 272.49 308.488]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+3463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 287.214 254.15 298.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a73bae93d6fb72c37ef4945e9116c020b) >>
+>> endobj
+3464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 287.214 338.263 298.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+3465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 263.129 284.585 274.033]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_aaa92431687ae9fd0c516ed7059acb6f2) >>
+>> endobj
+3466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 263.129 354.044 274.033]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 227.088 241.726 237.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ab93fc9c66c2ccb499e3e6dd88efb6347) >>
+>> endobj
+3468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.617 214.373 407.658 224.278]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+3469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 203.003 249.318 213.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_afa1bbe3a8e77331adb07bce018d9f458) >>
+>> endobj
+3470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 203.003 288.321 213.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 203.003 371.519 213.907]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 178.918 240.62 189.822]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a88c162dae957cc0a7c4245e0416a34d6) >>
+>> endobj
+3473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 178.918 324.734 189.822]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+3474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 178.918 389.5 189.822]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 142.878 278.538 153.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a4c8cd4023eb230066e1854fde4c8a6b3) >>
+>> endobj
+3476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.353 142.878 300.953 153.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+3477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.2 142.878 341.927 153.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+3478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 74.333 203.075 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 74.333 296.324 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9f66e595842edb48b2ba1089ae78afd4) >>
+>> endobj
+3482 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3486 0 obj <<
+/D [3484 0 R /XYZ 89 770.89 null]
+>> endobj
+3487 0 obj <<
+/D [3484 0 R /XYZ 90 487.058 null]
+>> endobj
+3488 0 obj <<
+/D [3484 0 R /XYZ 90 93.417 null]
+>> endobj
+3489 0 obj <<
+/D [3484 0 R /XYZ 90 93.417 null]
+>> endobj
+3483 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F39 2335 0 R /F24 537 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3515 0 obj <<
+/Length 2690      
+/Filter /FlateDecode
+>>
+stream
+x��Z[sܶ~ׯاtw� �I7ә8�3M�V��';���bwi�f�Y��= H��V��}j
4�H��\�s���aA?\����|
�������~��E
�$��n�n�(	WkF)]^�]ʦ���+N�U~T�F���m�ܿ|�����Q�j��͏���eiH�4�C
�o��d8��n��
��� r����sٶ�5�(K�Ru.;e�Q{լX�T�n�a����y񷛋O
����H�,��Ż_�b�\P�0wfS�y �|����5;�M��"nEh��)��"f�����7�;5%r�
��B~ΊSa�ik�����Pe�U��/;������]l%n9�r����Ĉ꘻|-�H�kΉ�b�8�ct���G�K�w����d�m-�MU�G+�9�ߘ���m�����m�n�U�v���o;U��3�[�iD�y��=����É��+�m�ث�2o�}}��{!s��r�mA��0�|w��z�� �z���hVA�T[-<>4�
+�Zh�&a$e	&��Мtx�5�Bx�E�#���iB�H,�'4��xrv@�'�קr�A���,L!�B����V���o��$�*6�nf�w��fZ0A� 1&i�3�b�Ɣi���Pݝ�Tc� 
��1	�)�{�����t_�R���C�AJ�
����@P�P��i��˗���ߜ���V��f.��DA/ӷ��Ȁ�W�6�
'��gk�ZGg�96�I��C��2H�%لDqrN�^��f�k��k."��G�������uo�P���kd�?���}������.���:&
��+��,wp��m��|���Nq��y�'X�(
&��X�	T�3
	��i
+�� M'�z��)
������xX3s�)1��8W8st2[:�y� �G0g(�(
��U��� �X�d��8"4�:,�	�{‚�xV�di���
< l_���
��g�6
\)b�9'���\ ��t��_�|�*�S�3�`:���GK�l�e-�x
�7��re�X,��nq4�yp��� >"�[ϩ@@_?�!a�צ2�+-�]k��W
2�QF����m����lT�@W�2��p�F��Ϥ�x�mm		�?B�k��FW
��ψ���
+8��������AiKLr�����ƫ{(qn�:�_�t����N~���n&�Ԁ���1��$
+{'\�Ѯ}�n�u=n��wigm�/ƙ
+�^��D��0�WM�����A����H�P�j��}SVa<J�|}Y�
+`�
D����s��
�N������(��������( ���7��L{
��[%.6��D�V��
���v��
Q�x�x� �+����|a
u
TN�,����3n�[i
p�]�p�5�P���f�ұ.F��S
��=�=����lاi_\�H@#N�����L��@+
��y�}�UQ*���"`�=����5�<VEuP��NnV���L*:>�螴���q��d�9��'��F8���0K���JZ�O����Z�aᲉ���[���o@�dW5^�@
�/F^Q
Cn��('L���%)�ŢE���
����k�S��"�^7z�z����(穗���Q]7�gD|�@�q���Jp���Ԫ1Z�<4��u��$��Ycnp4&���A2�dM�7���=O����8*俇u�A*Nd~’ �*��g��L i���f���I-P�b��SynW��Iu!Toi�8�UI
t������6�͜�^���A�
+��֊<�6���ɸ���&���f�w�� � #� '����@����Ab�x�չxI����\�x�x!�vD�U����@�/���:NI�=��\
��r�Z��f�\
��q䃛�
��jC�y1/LXv��ftB�
��������<)F������_&��� �p %X����-�F׺���Ԕ������@mF2�R����z:����
:�DD�U^;=���}Y9���
�L�̥4�"L��u��Aim0*~��zPgFԬ:5��0g*��nmޛIU������wE��qb���-�
�����&�

$/앴�,���G�v�-���X����2Y
m�-�[�
R�D��f]�m�ɕ�jߧY���n�yU����cT���^[�ƾ���H�
l�w��Xw� _]���t�($�
!���R�v��S]C�4g�8Lu�M���8�g��"�����C�uQ`K5�A��N9
7,���יI ��E���ُ��|�U��p�
�X���W}:�<�2eG�ӏ���w��#�@��O���}B�]�Z��D�Ԗ�Q_'�Kݱڽ�UƩ�7J�o8�o�u�ѓ��Ĵ�_��W��+��R�e����L?{���b
+�!�Cp�;+�*ݪ��[ت=��O�=��C@�w���5r?��T��N����\��p�� 컩��x�;zҁ3��s_��G�{�m�>'I�#�	;��O�s�?�6_}F�~_g������07!'
r�3�av�8��Ɋ�xy��H��>�?@��<x�P��{��$Bh\a��@�����@��n��?~��Ɂ�vrl-������yx�[�>�X�?.������%�$L�dr������t���@�v��ϜG���U��EiQ5�pB;�[Z�N�eD�
+�tA	w�f�xm
����ߋ`qU������\�O}
+endstream
+endobj
+3514 0 obj <<
+/Type /Page
+/Contents 3515 0 R
+/Resources 3513 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3416 0 R
+/Annots [ 3480 0 R 3481 0 R 3506 0 R 3507 0 R 3508 0 R 3509 0 R 3510 0 R 3512 0 R ]
+>> endobj
+3480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 695.181 287.856 706.085]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_ac51af16de2e751d78b72424793383783) >>
+>> endobj
+3481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 667.635 294.481 678.539]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_abdb22ab9ca25ec598257820b7d9da99a) >>
+>> endobj
+3506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 559.63 226.034 570.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8a1cd7df2586fcb1c129b1ec5a28fe9f) >>
+>> endobj
+3507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 559.63 366.336 570.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 520.13 226.034 531.034]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a8a1cd7df2586fcb1c129b1ec5a28fe9f) >>
+>> endobj
+3509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 520.13 366.336 531.034]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [110.861 231.52 170.418 242.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+3512 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3516 0 obj <<
+/D [3514 0 R /XYZ 89 770.89 null]
+>> endobj
+3517 0 obj <<
+/D [3514 0 R /XYZ 90 712.265 null]
+>> endobj
+3518 0 obj <<
+/D [3514 0 R /XYZ 90 684.72 null]
+>> endobj
+3519 0 obj <<
+/D [3514 0 R /XYZ 90 617.158 null]
+>> endobj
+3520 0 obj <<
+/D [3514 0 R /XYZ 90 506.713 null]
+>> endobj
+3521 0 obj <<
+/D [3514 0 R /XYZ 90 458.075 null]
+>> endobj
+3513 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F60 540 0 R /F111 1509 0 R /F91 766 0 R /F39 2335 0 R /F24 537 0 R /F10 773 0 R /F75 562 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3528 0 obj <<
+/Length 2929      
+/Filter /FlateDecode
+>>
+stream
+x��Zے۸}���S"%7^�[U�
oy�x
��خ)��$�J�LR���>�IP�F
�UN�U�l4���� �h9£�Ϟ]�����H �pt�	<��@A�Go�����_F,�!�R�����ū�K��������WxD�� E�(ݜ�}�Gsx��#&��'%�q��w=�<�����-� B�VY���_��N�F(
+k��0�k9�{r��U���ɔx�x�)�)e(Z�GZ"�	p�id�?�h ��(p�b+ fK-�	��8I1��D"c��	<
+��X,%DaC�q��T��!F�QO�g0���/��X
��2V�B3�����8�c�8�E�MH0^f�~���bBXdL�<+�Z?�w�J��U��V�(�ὖ6v� D�O4��o�#DI;�`_�����w�����0�1�;m�<cQ��ѡ��0����7�� 
�O��H��]� m0��0�a0�k��ӄ`@c���s.��ѝ�q2+%B?����Y�+��<W�]@�+R��tx��&ξ��l�Vu��,�J �FN�S�6��?��
�)_����t�l�vLPP�f	E?Z�(RY��rZVՄEc��I�<ދZ��)ǀ<��e-�M�I�>�
q҆y��*o@�����Zf�HX�y�͊y^,��N"�

n�UV׹\�v�ݶ�O>�M�}N_1NWe�Y��f�N�3�&$
/w��0��	��.\]y� b��wI�����C��.��ˍi��Ҽ��Az9���K��(#c@)�5U��v�b��TP5=u��)������D��Ԙ�B.nY�9�O@�Q�����m
mh����B"�ިMY�?81�7�T
!�{���aT�AZ�[� 1�X�� ���BZ$ތȣv��r��.vncwpv��]�)�0݈@#@�
��(

���b�Cq�F�K�(�-�ݗ���C�����@
�W9��u�������<	b���X�w�n�G�}����O	�o}�ޖ���!fE@
�N{[��$��|�d@
9VA0Q[C�:�?��$sL8^9��P.�6����:�;���T�J�ݖ�ƄJ��v�6���:�k�\���)9�n
`Dba�����x�_���� ��_���t�OȒX��zP
= uHԲ����� �:�J�Z��m5�1���6��Q
�p�����L�
`�P�J&�?���a
�j%6OW�d]@�,q�5�- ��`
�;מCr'��_����/]{�M��� 1F���k!IX�� #P.A���V@�%ee�OY�Т*7N�@r3�%n��{�:�'�β'�>̞@��~{�a�
1ܛw��/H�<�;r?$ʏ���N@�#9��ٚ,W{�73Jءۻ�)�����
-�K�
�N�ڴ�eQV���M�Z�l��#pi��<?)���f�F1}�~)��,���(�k]�h� [...]
�4s�*iJu
`,�� �!Q̑P$�j<k at Y��d-�
�-�����_��0��y-wEm&�Š��jm����\��ʓ�\��Y	�������
+���-�� 7lG�|�[��3y&V���SfK\`mn�  ��]��Fq��ڭ(:j&wwJ8C4�ђ�V��Y��4�x|#
�r�G߲6��JQr��g)J[��P�M�#�� 5��{�5�B���~��N��v�� �ȓ$��Z�,=
x������L��]�������K+YAbݖ��Cn_鈦;[����w�vĝw��O�""���#��C
+��2�p�;h)\���[�׍	�����@EH�\�8(�!]"��4�H
��*i� �d����F
>}�!����CN�s{�8�p�/��=&���q�=��\%����S-8�A�u+?@
+��I��_��S�>@�W�Z�JoA�=����a�J�Hַ@/�&O��@/7F�B���7)�4n#yW���<�Ķ��9�
��D(bč�rL}�i'T�۲�����
,&�����"BG�U����.�+*1w��޹_d�6
�E!w�$W��o>�㻠o
�nң�����/X�iJ)x~�;Dn	q$,�q�&�:V
���Vڳ"�Z�1Be�!�����
:�M?G]��c��M=l$�=#���%����B�
\
+"
�����M=�N�
+,�m��Q�������y�*�����dHk(ȃ�X����k�-8C����M�
ޓ��T�E��1��[m�<nO��
sKI��JѮ�OG1'�lsU]yo�iw�����Z��=��w7ꮹb0sB{�d�({D���9쭼��	�W�P���R����n�9f�b�K$�-:z0K���1�;$�1b,R�HD���C���uj���R�P¾��Z+
�Z�噲H~�b
As
+�<[fEV��/�YW���Vw���0W)|�g
"BZh�����o./<�@�"�M%��N��vW���:/��~�Ĕ
/6�z���f��Ӽy?8v�
�`$�8J�屍a��Ȯ�q��
W�3
���h�4�%<�6KsY�Z�Ro��֪#�
U[���ʁ�A�i��2��tƯ��~)�
��"������P!������j��!F�@1>���`a=_l9$�@B
+��xa�_��\O5�%2|D.��ͱ�%!��_e���*�4rmmkq0zf/�,J� �C�F�ɮ.x�hX�uW��.�
+���;����{��
+�˷��V��	E���i0݉M�U
�	�t�
�'�����®o�e����J_
����V�hW��Ş	��J
:��^���������Vh~
e��e�~����8ʊ`*&��(�����c
��ܰ���uꦠo�)���R!א
+)�
�
d�_�K7~��诓 $�;)v��Y�I
���� ���X�o��.3�)��������gS%B�2�U�l���v�:+�(-7����,�
�[X�oʪ=���:I�G ���	��
+endstream
+endobj
+3527 0 obj <<
+/Type /Page
+/Contents 3528 0 R
+/Resources 3526 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3416 0 R
+/Annots [ 3511 0 R 3523 0 R 3524 0 R 3525 0 R ]
+>> endobj
+3511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.817 696.002 349.323 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+3523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.725 654.467 193.232 665.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+3524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.433 563.428 336.939 574.332]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+3525 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3529 0 obj <<
+/D [3527 0 R /XYZ 89 770.89 null]
+>> endobj
+3530 0 obj <<
+/D [3527 0 R /XYZ 90 220.071 null]
+>> endobj
+3170 0 obj <<
+/D [3527 0 R /XYZ 90 196.612 null]
+>> endobj
+3531 0 obj <<
+/D [3527 0 R /XYZ 90 196.612 null]
+>> endobj
+3532 0 obj <<
+/D [3527 0 R /XYZ 90 126.065 null]
+>> endobj
+3526 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F10 773 0 R /F94 771 0 R /F75 562 0 R /F7 803 0 R /F91 766 0 R /F32 772 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3536 0 obj <<
+/Length 2066      
+/Filter /FlateDecode
+>>
+stream
+x��Z�n��}�W�)��Q��#	0��b7�Y'�Y�
�D�D$RK�3�O�ͻx�,z~ �lUW��:u�M�l
��0���]�W�1�H*��{�`Gq�������9��/�c<�^<w��{w��x
n�
�u��}�?Gn�tyy������{�O�?]�'�f����0hf�o�Kcd���m�
�E��Yx�u�x���1C��n�u϶�ǻ���s/XA��L�LEjs��v�nj��
�@J;����'쬡�'#���u�9�2�n��ٿg8G\�mz�q6��3!&XŒ(�9�I��!
+�!�E
Ȇi�/�N��^���yK�	+׈�1\Y�v��9Ҝ���RC����-gfg���
�
+��a�+�
):��^,��U�I�]F�X�(
�
�@����k]4����x��cVKƴ���h��#'���}�;D
��A�+��~� b��
+���w�
`ʭ��_�ݽ���������o
s4�*�a�HnSԁ �VQ���~�}�"��ŋ��gL5��WpC����h�@c� V�>e��?���*	��s�Z�K�c�E|��-0Dʚ)�l
w^��?�&���F��i�������l*�0
�!Tc�*��v'���~�C°g��k�o�%*��c3�&
�j��a,�9���qlƌi�a�l�d�!�H
�rr��j�u-�����zH�0>Jj�0���$4"U?��>BS�$B����v�⚖��U��%��m~��}�o���
�$3Yzl��գ�]���V��E_T���O/_RܼW���������W�}~�w�7
lSx߅�a -�V:���P��-W�r�9�R��S���$5�^jƂ��dB��?J�0�q���
â�܈~5Z��`o�
��Arw�Êu���D���%d��
3�p�Y,��H���
"���A�� ��
���Woo��}��]R�[l�,����R�㮰�;� †g9*��-�e�&+��/����]�k� 
!')��X/{���j�
@\CB��!9�Prs�*�$�\�<nZl_#
>��g�r�K��H�
��(x+�/j�;\H$ ���X��Y[��FH�,�s:�Y[�~����x��
��P�t�u ]�=(4� �3|�_b0���	7ͳ-
��E�1#Qi,�ᆳ�}�KFb�(�70���k6}&���b��Uk:�!�b��������g5�Y;8N�.���s��P�A�r,/�<N֗�~��x�����;�mL�mp�S
J�)�	���C�e�gUD�DO1=k���!
+S���r�w�βQӏ �k�L� C�֦�^T�8l������.A�?
!.v�v�d����0J����9o��izܔeeQ�M�Č3gsm����X

+&�ئ��Z��M�g�
}ēF��
y�!^�1��e(N%G�
B�TeF�Tw����ne%�Uf(5TfHjje�&zL
ʌT���TUy�Ygh�	�h��0ԋ���'��`u��e}aE��O�2�=ɟ$ة��T�[�d�
1�&���q"���ek͆%��ntJ������cJ����/-�$�O�Y�m�4�N���HN��)%H�O)^�fB�@"�fB�^�x�R��ei*�>�<
�ޚ��zc�
�.h�R�iq����	h�!��SF�@J���ȳmV�CK]�C{]���L��5͑�:�"{o�H��[���g/]o0�Ŵ"�
��� !���C��F��(@�~/s�F���R:r�
5:;��fP��J���^�&a4 �A�V�}'��զ�$�WE|�B�Z��<�;���������HU�����)�lw����I���8;������M?ش���լ����;$��[�ǟ�:�A$����id/>n�QK���I镬�Q�O2$RAe�i.yw���S�.�K[�:V�
��[�#5�%yN}x��V�v}����{�_��g����<�[{��=7��J� ��<��F
+/�����`
��S��s��S�C����>$�������&��
Z���ة�4g�}Y�va�U'4�ClT|5X�B
5�� ��70����W��
?�.~�1�m Wy����u
+endstream
+endobj
+3535 0 obj <<
+/Type /Page
+/Contents 3536 0 R
+/Resources 3534 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3416 0 R
+/Annots [ 3533 0 R ]
+>> endobj
+3533 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3537 0 obj <<
+/D [3535 0 R /XYZ 89 770.89 null]
+>> endobj
+3171 0 obj <<
+/D [3535 0 R /XYZ 90 721.073 null]
+>> endobj
+3538 0 obj <<
+/D [3535 0 R /XYZ 90 721.073 null]
+>> endobj
+3172 0 obj <<
+/D [3535 0 R /XYZ 240.245 659.423 null]
+>> endobj
+3539 0 obj <<
+/D [3535 0 R /XYZ 90 652.783 null]
+>> endobj
+3173 0 obj <<
+/D [3535 0 R /XYZ 240.245 573.673 null]
+>> endobj
+3540 0 obj <<
+/D [3535 0 R /XYZ 90 567.033 null]
+>> endobj
+3541 0 obj <<
+/D [3535 0 R /XYZ 90 480.835 null]
+>> endobj
+3542 0 obj <<
+/D [3535 0 R /XYZ 90 427.146 null]
+>> endobj
+3174 0 obj <<
+/D [3535 0 R /XYZ 90 380.521 null]
+>> endobj
+3543 0 obj <<
+/D [3535 0 R /XYZ 90 376.038 null]
+>> endobj
+3544 0 obj <<
+/D [3535 0 R /XYZ 90 287.682 null]
+>> endobj
+3545 0 obj <<
+/D [3535 0 R /XYZ 90 233.993 null]
+>> endobj
+3175 0 obj <<
+/D [3535 0 R /XYZ 90 186.039 null]
+>> endobj
+3546 0 obj <<
+/D [3535 0 R /XYZ 90 181.556 null]
+>> endobj
+3534 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3550 0 obj <<
+/Length 2512      
+/Filter /FlateDecode
+>>
+stream
+x��[mo�6��_�Ow6P3|'��}i��vwq�+���b+�p��ZJ7��7|�k$۱��
��h�z8�
g晰8�
p��ū����!
+%���6q�x���_��ӄ`9�<�)`R#J��v���~����ڼ�x;����+
 ���bs��3���S�
u����2x���]`/K�DT��yx	CҐP�c
(�‰��ao�$Ks+��'S��O��	��Jo7H?]A��1Aa C��o.�&(�K�I�����'
Q�e�����So(��030
+��r�byu��S�'F�d�%�M����o�p���
��F](,
�vW�GD�}+���R�CDYk���.�R1��NgT�Ir��*v��1/�kg��]�ƻ��v���?Ӭp�x�-
]�fJ������j�{n�$-r�G
��Π�H���'�,��~ĠKX ����:R��������l�����bkQ�¿�-l����q���؀
+'�
@�,�
���r� �`�
��͗�U�퓍Á�t�l��'H�XG�'�
�WW=�
+�y��- �����߱�ә�d���ei����q�֏�x��=�Ҟ)ARV���\�nF$u����w=��E3
���pQ0������u��}�
+���{a��11_�EP=�{��Pceb�x�ۗ�~�������ֳ�0�Dc��-ߌh�ٟ��:Y$��V��x���PA�"����}�^z��ǫ7׮q��6
���:*�Ӗ������ߍiIa���=��E�$g�0F$ڒ1ɍd�a%c��*�$Mһ>1 D3���!��N�}n��D�l������*�c����ȱ�b?��x�p#q�t��֙F��F������!7�=��
+[%;f��̴gQLG5�vFC6yw۫)�m���W���1�{��б��Ԡk]I�
H���A��Dț.���2Y����&Z��ܿ��l��8
+iȻZ�;l��e����9�%�;g���K�$��BR
o��#�U~u�h�!Q�g��.-��t�'����N��������
��5R��

+�z����0nC�u�
^08{
�O)���@^e=K"I�;���_J+�2���p��С�4XWr j3U��ɦ
O
�B7xD�+�ud���l>�)�uVt0dÉF��3�Y���$]'i���*4%��|
+�a7�3�����oڗd%G)I�p�=��}��%q2�
8�C`r���Bj׆�|-��e�1���ؙ���5cX��͘ ��ɔ�\�Q}��l`��va7�;��(�\��qC�ry
}��
�&�H�Q� ����t!�؁[�g�L�9Z�ϩ~p�7���@�t<�
�V>��rX�@_{j�$$��Y���D�H
+�g����D!Um9�em��]
F��ia��V�]
�—n�f� ,�Pu �=9cQ�V �d?�s�jlDgW�ò�8v|����
+&��2s>ha�I�oa
�櫲�Y��r�ZTr�f;C<찼cu�q?��rdU�20�6	$�w'�J19�.Oފa+H%��vy2����
�YV
G���!N�U���������{
�(�ߑ��b���0W�A���i`�4���8�+V_��n��$�
W�
q}eջ����=����wk}ͪ7#�V����I��k$m�M�_f �K�����^CN�kQWOr�맆D.zH6��
��	jK(�L�`3_U���%}珗�����Z>?�HȸG�
ȃuuO����K�0�@Y]5
��L�X��Tm�J��j�Ѷ��\��:A�U��%�
P J
*�U)�`z�8���>,N�撾���D)� ��S���|>nT�������!'%S�5!'mB�ju��.y	߮Ҷf��S2r�d��
+�@��q���!F^-���\���ߘ�SNGLOGE�Ix_{�ơ�}����lu�R�1L�LAz�RK���[�:d���ޤ�O��Q$��U
�
 %�cZ�؈Β��J��I�>�}�)R�M5E�?�ߧ�Ű
$
G�o'#>�~̀	��
(��q��� �=�ĦVjD��@<�~�EL�g���W���O�߭���wH
�}�d:J�
�&��!��f�G�!�%����D~r� ���&�h�w+����J�#���
+>:���v�A�M`}�s���#طI��)�[��D�C���+�la�l���N\
(
4D;�0Ѐ�4������՗1�W��ܷ�b�00c`M������(��,�փ��8R4<�+��vԧ#�=d>�r��
�#����ڨzK��
���
���!�u= sq�~��O+#��~�����zD}G0�W��Ҥ�EicWm��M� =W�
�?4�@�-����({��k�����q�nÂ7��p3��Հe�ְ5���u�Ʉtԏi�ȏv�_�x�ש�_�D�}����O��W�� ����X�)�<��c�]N��T����j�!���PW�WE��������!KB`�Ou]
����oo!��m��x��B�&*�]+�
p�
+endstream
+endobj
+3549 0 obj <<
+/Type /Page
+/Contents 3550 0 R
+/Resources 3548 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3416 0 R
+/Annots [ 3547 0 R ]
+>> endobj
+3547 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3551 0 obj <<
+/D [3549 0 R /XYZ 89 770.89 null]
+>> endobj
+3552 0 obj <<
+/D [3549 0 R /XYZ 90 718.682 null]
+>> endobj
+3176 0 obj <<
+/D [3549 0 R /XYZ 90 684.012 null]
+>> endobj
+3553 0 obj <<
+/D [3549 0 R /XYZ 90 679.529 null]
+>> endobj
+3177 0 obj <<
+/D [3549 0 R /XYZ 107.534 586.307 null]
+>> endobj
+3554 0 obj <<
+/D [3549 0 R /XYZ 90 580.29 null]
+>> endobj
+3555 0 obj <<
+/D [3549 0 R /XYZ 90 471.615 null]
+>> endobj
+3556 0 obj <<
+/D [3549 0 R /XYZ 90 405.573 null]
+>> endobj
+3178 0 obj <<
+/D [3549 0 R /XYZ 90 358.948 null]
+>> endobj
+3557 0 obj <<
+/D [3549 0 R /XYZ 90 354.464 null]
+>> endobj
+3558 0 obj <<
+/D [3549 0 R /XYZ 90 254.154 null]
+>> endobj
+3559 0 obj <<
+/D [3549 0 R /XYZ 90 188.111 null]
+>> endobj
+3179 0 obj <<
+/D [3549 0 R /XYZ 90 145.612 null]
+>> endobj
+3560 0 obj <<
+/D [3549 0 R /XYZ 90 141.129 null]
+>> endobj
+3548 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3564 0 obj <<
+/Length 2670      
+/Filter /FlateDecode
+>>
+stream
+x��[Ks����W�%��ѼJ*���x�����T	�HH�
���_�
�  �H(UI�"�QOw�7�_7�8xp����۫�w�Iep�

7HHx�>MF|:#�ɇ)��0ۄw�O���*Zd����>
�Ǜ��o�>��m4�|���;Bb��H
��R�⦴V��(�&���0�0QM��1	?��<�Ψ� ��I�ٮ�"rO~��Q6%z%sx�8`��2���^�qE@
�s�@J��է�8X��_�󵜴	8e�>^��
+7=+qdz� 0�Y���p>y����*��"w���|J&�p��-�M��q����3;��C��k��v?�tưޯxo�o���lw�ޤ���͢y�w5.Vaa}��4#��-N���"��w�`��
�zݬ�+��
+;�/?�Ms�g#�_d�v+9`2�D��P�j�뾶�?��}h?�@J��aH�M�/+c)ҘI��n�zkx�<A �D�L��6����!_I��j���Q�vTn�ˣ�G`�^+�/:�@�a���\`�a�H�٘�[��g�s3���0 �
+a�c�<� 
�
��'a�2��1�T�v����a��pO�O�$�*��݈�R�M��j��h�n�
+��
D87H19
�g��0�@$
�\d�-�7|;`53�6c
H
T�P��o�ͣm	�Hf8%`p ����I?�'��,ϫP
+Be�vG*�Wҕh��!�|N8�XxY,��<#Hr��\����f
%��.ʲ)�4�;�
�`c�V lh�@�8"R
؊ @<�e��*K�TL�Z�F�`-ݫ�0�=��a���[ v����xJ*��Rq7���JUS\$�G�"�,�	�ś�ƽ	�k�h�z��4oF���l�*},H1H��T
<?V��y&/�9
��t�'hU��
+1_`�m�ł����.�

z�&���',
f̖�S�MS<"~��*��W�!�E�>k����uW<n�X7��Io���P�)�ھh
+�O�u_I���j
�
N'C����P}	
�
髚nn��]�ȟ��L��>� ,��(2��z�&l�S 
+#-}B[f�L����ay9���a(�Z+���]����`��3�9dעg���Yc�}�Dav���֕�y��ܭ��H+ڎ2�vL7>Dhӎu۬G$�ɧ��w������լ��)N֠�����]8`
	 
 ���ߢb�%y�
+�U�nV�.��@���դ2{XR�x�&�G�B����2Y{�������خ��2K=� `�x��
��d���Z��
�8@�^��T�G�2�9�iP��a1>��O�Q��
�,� �1"Ψ
r���&�B��AB�ʲb �4� ���ɗp
/��b�*�N"�cZZ�Ž�+
0���,m��C��S`L�Y�����(!��1c{��G������V��Q��щ���
;|��m��q��%2�2B�5�٢l�E)�8D�,1
�l�Ʀ婌�
al��Ͷj�(�
‘#�U��e�
����-
fl��~����$W��#���|u���C�M�����0� 6�
ak����ڙ|
�
S/��p�W�&��Y�5F!�3&_k����1�\���ژ�V|�c�|�e�w�V��w��1�،[J]$�(_�����{I���!��� ]��q�&�8t��Z?]c�
�kzO��u���LO�<Q� D	.���-�?�-O^�h1cB"&x���FK8�t
� �т�2��S�S��>e�c��TC8T�����Ő��԰��[��
fj\c��c��j�~=3���
w�6t��-C�3U��^#�Br�K8�6}>�h�����($�9���2�
���6�.��ځc�vTe�V��g����J�n�$-� r�W��
+#�O ݆��"5�o
�.�i�IK�o(��)}R��>�+XV�%˥�����}}� �Q�)��a
u�-���"�� ��b�O��E��;�h�r��B��G�i�}��%�a�be�H7m8,���|\5�%�mv�
�
��c�R��ǵ.s�W��'��
.?߳����w����E=��c9z���S�������6�	��h&F@���r�A�F�����.9�j�
�&5�(���H=���i��$ �o��}�w�

�j��
� {)ADž�5��Ciq�.ӤJMMj(-"{90y)0�m���B�y�ut�Lʉ�>�)��@�o��Qu��8]�K��X��.#4��@Wߒ]�ig���Y�']i=�+�����γ%>�J+a�NF�����^i}���,
�/�yI_�P�?#G닏ii��zf_�e���x�?�#)ȸ'�l��?g��ī�������cl�B��V�E񺵣��6��:��}���h���G x�⁧���V��U�Umb�ͺo���ؗ�C����Yٕs��m+)`�D�Ez��Yg��z�ꑃ�M1��j�+4�7l;��]jР�L΁4�'�p
-}�K�t7_u;LO~�
��S�YY�^ �.�($��P�޻��y��0b�iίa��~�c��p ���
+��#m�����O>F���)�������:�Q�}�xUۛ����C
%h�o����
[�-���,��a�f�uMx�)�����^�2L��zo�C��P��R���
�V��\��a������H���
+endstream
+endobj
+3563 0 obj <<
+/Type /Page
+/Contents 3564 0 R
+/Resources 3562 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3576 0 R
+/Annots [ 3561 0 R ]
+>> endobj
+3561 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3565 0 obj <<
+/D [3563 0 R /XYZ 89 770.89 null]
+>> endobj
+3566 0 obj <<
+/D [3563 0 R /XYZ 90 680.111 null]
+>> endobj
+3567 0 obj <<
+/D [3563 0 R /XYZ 90 614.068 null]
+>> endobj
+3568 0 obj <<
+/D [3563 0 R /XYZ 90 562.836 null]
+>> endobj
+3244 0 obj <<
+/D [3563 0 R /XYZ 90 538.302 null]
+>> endobj
+3569 0 obj <<
+/D [3563 0 R /XYZ 90 538.302 null]
+>> endobj
+3570 0 obj <<
+/D [3563 0 R /XYZ 90 465.624 null]
+>> endobj
+3245 0 obj <<
+/D [3563 0 R /XYZ 90 430.954 null]
+>> endobj
+3571 0 obj <<
+/D [3563 0 R /XYZ 90 426.47 null]
+>> endobj
+3572 0 obj <<
+/D [3563 0 R /XYZ 90 353.608 null]
+>> endobj
+3246 0 obj <<
+/D [3563 0 R /XYZ 90 318.938 null]
+>> endobj
+3573 0 obj <<
+/D [3563 0 R /XYZ 90 314.454 null]
+>> endobj
+3574 0 obj <<
+/D [3563 0 R /XYZ 90 231.768 null]
+>> endobj
+3575 0 obj <<
+/D [3563 0 R /XYZ 90 141.018 null]
+>> endobj
+3247 0 obj <<
+/D [3563 0 R /XYZ 211.842 77.486 null]
+>> endobj
+3562 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3580 0 obj <<
+/Length 2831      
+/Filter /FlateDecode
+>>
+stream
+x��\ms۸��_�O�4�x�v���^�i�N?�2Y�m����9���dP�I8�L3��(\������	�|�����k�&	J$����I�'�'HH������g�~�0�I$<e���?_���ꭹw�����
��8)=Yn.޽Ǔ���#��Ƀm��p��s=y{�
\���|��%�H3B!�b�#��lN0��}��_/��Q��5i?��ZT��ѵ�D+����?ݧ�b���T��U@ ���O��
լjq]k��j� ����7�}x{���9Ҝ�2��/��B��S*�1��y�r���m����zZ��/X��\�d�,��>`��(�u'?ey��~x��~;# e�ˊ<бf�(R=��Jw�j2g�ċ�
 �ᚦ3"�F���u(C׃�m����1]fi���ʒ�j@
YO��p���
+0f"�1�O� ���k����R@�H�,R����$&_F�����A��F���>�s�"r�N��攫�
0z�A�E���aA�W��3�}���ž؆FO"E��(�
Ȁ+R{XUę�^U�?����]��a���sS����{O&�C�sJ�q�����a��
1�p�^��C�<��8��Dv3�3L��|�.�|��]�-�4孧�D�4�cP�b�6��lסE=�����{w[��S���.F
+�HJ�鵴��8䫴��f[l�~�
�~3�r �� ,�$�!�}C�P��_@��3ti�~�˖wv۞3
���g��Y���]y�|�n�����P޴�k/��}��o��w�6
�@`3�R��1ǵ�t��KwNpVv�ؖJ,���a���y?j8Zis����e��l7of��X���)lMd��%
z=<��n�{�q��0�,9
���B����
�^
��>�ơ�Ï/�Ei
�9t"A&a�)R���zKt��~
��/"��P�2W��6 at q�U,QF)nm��l_�D�Z1��J���m`�'
+�e
g{����Q�Ȉq�F�IG�sl��Ɲ�>ϰ+R$&ChW�D�s�<R�0�ۚ�`��2h�_�����YPnE���&���
���8RE����nJ5�VgAi�&A(y��PZ�y�����`;��^C��Wpx�bKt`R�LR/fdڐ��r`V�A�8U�P�BSK����e7G��
l�wrY$.ֻ�a5C�9xP��"�1�[��&אc�Ӧ�����!
ٙ��\�V
�
�QJ�=\[�ޥ6��U(�ؗ�� |-�i�ڽ0_��![��
���"������hR!9u�RN��bwؖ���Eg��(F����󪙗�
�L������NB7bA"%1���Ϭ5�a�aD8"�L_}\��0=������ӻ����'
It��/�K�\"�Or,�<�i�1�XTB���g�3#F�nC�(j�z�2�g
оXg���15����A���bn��1-{ ?��T �ꔩ�n	�e��Ww�¬燼�()%mWpϪ�ԅ2?�P)�`��2� �qϳ��w�!_�{���G��f�*2"�i�O^�#d>���[�*c�BEV�鉈1gi��	����DO��/�PI�B�m��ȭK��WWb5W^��E����x�R�
�����>�}k��W�Q6���h#�q	8b�TfC�A\[�j��1
.�8h�������z�
H���z
�ӛ�v���B��L{�<+���'J^W��u� ��t��U�
���"�y�V����%=�n��0�˄~
+���m^F��\�n^�#.� ^�E'uPe�YO}t�	����3�Nǜւ���7��N����6�<�d�	� N���(=�낣��	��xC��6�1�0���|;ü�gg��R���*$آ��!�H
+yĴ��.����[�1���+
��%X!kj8��I���:���l�.�	\u�D�8[[�����Ѵ	*Ղk㗺#�@��O������]�k��.vU!,ɳ��IJ�F�#v�1�ˮf�Y�]�jU��p�:Md�o&���dB at 4@"&��%Z��8C
���&� ބ=��
�L���)3��t��S�Mi�/�o�n�H�F�sl��
V���#0��S��
Σ7G*�rK����.�z
�[�=� R��e��
����O�"�CZ6P:��
�IJmM�@o�C�`C��
DF�R\yIS.� �d��1� �h+�?��
�K���t��n
!��Y� fg��t#	Db�bbs�ħQ;T��Ʀv�4E
+���
2횥V�P1ɝ��1�5y,g�ȝ��V�Α��
�ү�NM�
���e"M�4��
.3H�Pj����C@��Q�PH2�ޮx��<\�
A��o���X�{=.�W��K�
+���.�H�;Q(a���aHv�{��o
�� 
�V�t �#�g�����a��
2���G+:��9b� �egJi^q�dg�s��;���L��a���l���
QRd��1��`���L
CKvƳ�ٙ�;P��3O݉f����;���rA���J}%�ƐAC��I�T��ڑD ��:kGC4�y�$�D�
~��\��E8�t.j�2������	5|
�чq䳣�%Z<k
��hI $�9�y65N� ��z|
&j����،-ЂHɈ�5
�4nI�MB��#��
���lF笛���
/�
b�;e����oR���^��
;��-Z�׺�7�g�.ذ�wk��A޼XM�6���@�8l�e߼��]�c�n?3����,��b�M���V�6
l��i�� I���4-c"�ۿk���Ȩ�NH�&�����_^^^nwi~� h{��4Cf�U�vt�M��1?n�(?����Ѷs
+endstream
+endobj
+3579 0 obj <<
+/Type /Page
+/Contents 3580 0 R
+/Resources 3578 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3576 0 R
+/Annots [ 3577 0 R ]
+>> endobj
+3577 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3581 0 obj <<
+/D [3579 0 R /XYZ 89 770.89 null]
+>> endobj
+3582 0 obj <<
+/D [3579 0 R /XYZ 90 721.073 null]
+>> endobj
+3583 0 obj <<
+/D [3579 0 R /XYZ 90 634.093 null]
+>> endobj
+3584 0 obj <<
+/D [3579 0 R /XYZ 90 519.034 null]
+>> endobj
+3248 0 obj <<
+/D [3579 0 R /XYZ 192.853 454.785 null]
+>> endobj
+3585 0 obj <<
+/D [3579 0 R /XYZ 90 448.768 null]
+>> endobj
+3586 0 obj <<
+/D [3579 0 R /XYZ 90 367.616 null]
+>> endobj
+3587 0 obj <<
+/D [3579 0 R /XYZ 90 276.866 null]
+>> endobj
+3249 0 obj <<
+/D [3579 0 R /XYZ 211.842 212.616 null]
+>> endobj
+3588 0 obj <<
+/D [3579 0 R /XYZ 90 207.979 null]
+>> endobj
+3589 0 obj <<
+/D [3579 0 R /XYZ 90 125.447 null]
+>> endobj
+3578 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3595 0 obj <<
+/Length 2784      
+/Filter /FlateDecode
+>>
+stream
+x��[Yo��~���S"㞾o�{
f3�3�0;08e�HI����S��)���N�`a�����]�u|�E���O�\}ww��'�&I��n91x��AB»���`�g�c<��<
�Mp;�x���W�"
��E�� }�������1�}����O��`��H
��qC:3�L�W�z0
"LT�=���:Ȳ�5�
����u�����p�3��a<�[�3��y���՗+0xB�:Rz2�\}��'
���#�<�6N��'�~�¥f1�
+��ف#1l��$:
c&Ҁv�C��Ӆ-L��)Fư��)N�:7Q
m��BC�t�E$���E��Z�D���Z�t[ژĭ��5�I����mu/�E���U�Q�*�!�ŘZ����n�u�쌬�P��:�m�o��"�D��
ڒ4�K���Y��Hs9.:eȐ��)†�B��Z��~8�,/ZD��*��,⟫0�]3Ɯ�D�y��w��|
����l����ϡ{�X=��¾����|L�8w�I�^��$ۦ����i��Ot���/k&+�{L{<�v]�_18
��*,}!ʳ^_�} 
��������ʧ
��X#SMEm��<�
˜O$�ɵq���y�h�%sj܅ܛb@�v��!F����
�OЉL(���Έ�^�.��^
��O8�XT i8Y��Bf
�nw�|qs�3�
���}��>l7!8��S
��WIA
� �+*c
��D��Kle]I�Vib=�)�S�~P�1IĔn6�Y�C;ʖH+U�����fCF�8�*�O���z�e�U�Q<O6��?�F*f@�Kls؍,�گk���o�'
CD�L��g�4��˦	�
���	�����2I�����C	�:Nrw�9��
�l�e�l�����L�髞��D@��-���PF��w�N�|��՜�;t�%.4_}3^��}��u]I��U�P�
�8���Z��<h�(�<�
�ߡ�m��AӈK����p���m�'[�%�ʋ۹v'���^)"X5-bH�Em^Յ������N�ڙ@A��??�q��+f����0��V�
@X
ֵ|N�u_�
ެ�iG�nn������
+����v@�ps�L�/[��gj��4�+xvͥ�΁��=)
�W��]�Az���l[�g6��L�)2�)��Z���e�2�S�)qm�c�ƃ(
�}.-ߝGe��Y��_�����S�!d `!P��rZ�:��;]A8��,eZ��$95�#�Q��C���Z���i��Iӕs1(�8I�v�=

���2vd�˔M�Go�^X.`�Dx�
�
Hݝ�Y=�A�""
��0S�����@�]b(���E����hHM >}�M ,���(O��<}��꣼(�ᒗ�)���K�eGJ�u]f�&UPp�U���a$U�
2H��*����1 yMb����Ԓ�cȶY�w9�*�}��h0�&�V|��@(ى��]K��4�!<�[g����
��
L���vF9����=I&��{g�S�y�pY���;bC8�;l��	�=�
UU��Sn����
�{��Y�]u �.؊��(FIY�{ˤ��i>�>M��|�{�
�!T(G
,�/찉 ��ԧ��FtF�m �^��	��V���c����E� [...]
Sn������첕�[u{%5�������(%}֮(�،�8��������
�
��+_���,�ت���4Š^Dmi����V�oi�Ԗ��d�lM$�3�[;1��-�e�1�hkg#���f
+TB���7��x��g��0
dB"����w
��7�L�����)i������wG�?��u���
v#���u��1{�ߌ�6�X�=�i:tü;�k�"q��(�]`ȸZ���m�t
+���85}����~�W����.� ۳1���/��z��:�� � &��0=� ���_*�	��y�AgNe�W���/E�����A8��|�mI�
椖#sRK�k~Z�?�@�~~�
�'G���@z�E��e�:��C��9�
�wRa��!^��
`��2�����e
��I�\	H�x�OI+޹#꙼�#���c�w���G<��|�sZq��wk؅ R�C�`��
�f��0��b*��%9��(oϪ5�
�wvW��4��k۽�y~G`$/vDQu�#-�y�`�rhwsOeJR!��?�t�*���
"K�C�ܓ
��wZvm�t88����Ŷ!�i�jI��f��L�4�r��%m
H_�wQ�c��xa�W�>�
`����
z�]-�Kxa�y�w����];��ɻ:����
+�u�n
�@*�
���黝��9��_yW��UJ^R7�L�출no߹�da����4��A�
���&�pH�<9��cj���<�V����kR]���n�YQ@
B���Ǜׯ?o�0~@`"��%
$���~�m�������}+��SmU� 	٤�(�
�U�I�k]V_,o�~�a�P�/;��oM��?
+endstream
+endobj
+3594 0 obj <<
+/Type /Page
+/Contents 3595 0 R
+/Resources 3593 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3576 0 R
+/Annots [ 3590 0 R 3591 0 R 3592 0 R ]
+>> endobj
+3590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.931 446.436 186.185 458.769]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+3591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.668 446.436 272.341 458.769]
+/A << /S /GoTo /D (index_Grid_Frequency) >>
+>> endobj
+3592 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3596 0 obj <<
+/D [3594 0 R /XYZ 89 770.89 null]
+>> endobj
+3597 0 obj <<
+/D [3594 0 R /XYZ 90 645.466 null]
+>> endobj
+3250 0 obj <<
+/D [3594 0 R /XYZ 192.853 581.216 null]
+>> endobj
+3598 0 obj <<
+/D [3594 0 R /XYZ 90 575.199 null]
+>> endobj
+3599 0 obj <<
+/D [3594 0 R /XYZ 90 496.05 null]
+>> endobj
+3600 0 obj <<
+/D [3594 0 R /XYZ 90 380.991 null]
+>> endobj
+3251 0 obj <<
+/D [3594 0 R /XYZ 439.299 328.696 null]
+>> endobj
+3601 0 obj <<
+/D [3594 0 R /XYZ 90 322.679 null]
+>> endobj
+3602 0 obj <<
+/D [3594 0 R /XYZ 90 263.306 null]
+>> endobj
+3252 0 obj <<
+/D [3594 0 R /XYZ 90 228.636 null]
+>> endobj
+3603 0 obj <<
+/D [3594 0 R /XYZ 90 224.152 null]
+>> endobj
+3604 0 obj <<
+/D [3594 0 R /XYZ 90 151.289 null]
+>> endobj
+3253 0 obj <<
+/D [3594 0 R /XYZ 90 81.969 null]
+>> endobj
+3605 0 obj <<
+/D [3594 0 R /XYZ 90 77.486 null]
+>> endobj
+3593 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F118 2438 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3609 0 obj <<
+/Length 2077      
+/Filter /FlateDecode
+>>
+stream
+x��K��6���<%�A���Vm
;��&N�䒤\��ѮD*��|�m�
%�Hh㤶|�,���эA
FT� �˗l?������b�AFR,���
��~��g�-��Ԉ	we_����ū�o�o�W���?��)
���_~����:fF�F��S�]�v��;#�FdHkD� B�a�C0�9�O�p�-�Ў��5iީ�T�C�,o�h+�x� }<��r�攱�C�C{)������aY)���.o���X�����_�{{�<t�9Ҝ�3 �O�-�Ƭ#�Fl]`�/^l�OCʘ@n�a`؜
,EF�*�O�ɘFB;]o����Q��/�9J��~A�(��dF�4����
�R\��*��iG��Y-�6�6=&ln�?)t���,.Z<vh̙4�+��+F��%8��K��
QՋ��7�R�x �!!u~��a��D��	>�W�<�s4�D
W�o�`(O��:�G������My3F
QVU�_1f
��0Y�
���w���:D"��
vT4�u��I�������[ۡ"0�5���
�+��c
�m�{�V:uEyV�]�%gH�t9W��uAׅ�C�ښ��@2��3��:�Ү,�+iK����� [...]
���4�
!��D��f�9�k��ь����n�~�LfLM7���v'B1�̼Z
+� �i�T�8"PI�&6�b����$�Q1����f
ELV�Go�xM�4>Ļx�8�F�xX���]�S��Y	q9B29m��@	f��1S�t��$��oF����4a
��kr�<�i�d���E00ZV�ě�y�{|�2����0a��g�yB
R�g�o�ҽ�K�/���
�X��,԰1�ĩ�827���}�=MJsj 
�q��m�,
�k�	��M�Y�Xuh�huc�>��i

��1y��/�E����x��F��?�a�!
�,!�!��3��^�%��V-';
(��-:�U��K��J?���ʥ�p���
+����ǕO>iH��A�"3�O|ZZ�I�ԁ|�Xz�O�
u���Cf
+��bu���f
�����}����,\+��v����Y���b�@���,N<�0�&y�U�a',��
�e��o�~���Z(F��]��q�K-�?q����L�Hd
�^�[8T/��׊x͌[8V��'�4$�p
϶m�7n�ii�--Sr�c���-�s�R�'ޝ�
q.������N*�d���(�^ta
+&��.����|�����J�]�x�Gpn�,�8��m��>�����m��m�@{���-��.�T�+���k����1
��%��Z
+���1
5	�}2KCr
�Pc`zo���ҒYZ�d�ҏ�Y�奐�+�%��Z��dFYIF�>Y���[�0�.��k
�G'��H�{��>��ގ����B%� \���c�
":��H���q?�
���]�w�
H� 1jjxo)n�EDf
��`�Ā���Z8Jޗ��� ��k���=m�XEB�
��*
2�&E�����9u{�S�53� P���J
�14A�X�
&|Z�D�ҁ0�4t���3���iQ
���\���HtA
��-5�A16w��ۇ�Cx2��$~�����E
+"�ӵp�B|�H�'���uVh���v̴+�X�\��t�qR��� <�������7��W�5�̹�'�D�f���ɓ��c�r��M��^�j��3���U��L���
�#�qk?��x��q{���u�0k(�P����n^�P�hdwf:�����7��V�!��o�K(�j��BR�a2#d�C:�?�
�����:����.(��3�1
+	*,'
�"���"ؾ� ��x�Q6���1��
$<��:�Xt
�*·���E�a��-��C��dxA��W�p�
,��R�e�����p�ɐ���}q��
Z�����X�S|q�՞_� V��Ao^
���}���
Zv��͛o�?
��әӢ��k=,w�g�Ƽ� &5�T:$��
��
���0,�F>��TC�f�ոƘ�I�Lܧ��������F���O��fK��n�]yhy��S���g��nm�9�_\�/�
+endstream
+endobj
+3608 0 obj <<
+/Type /Page
+/Contents 3609 0 R
+/Resources 3607 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3576 0 R
+/Annots [ 3606 0 R ]
+>> endobj
+3606 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3610 0 obj <<
+/D [3608 0 R /XYZ 89 770.89 null]
+>> endobj
+3611 0 obj <<
+/D [3608 0 R /XYZ 90 655.872 null]
+>> endobj
+3254 0 obj <<
+/D [3608 0 R /XYZ 90 621.202 null]
+>> endobj
+3612 0 obj <<
+/D [3608 0 R /XYZ 90 616.718 null]
+>> endobj
+3613 0 obj <<
+/D [3608 0 R /XYZ 90 543.856 null]
+>> endobj
+3255 0 obj <<
+/D [3608 0 R /XYZ 90 509.186 null]
+>> endobj
+3614 0 obj <<
+/D [3608 0 R /XYZ 90 504.702 null]
+>> endobj
+3615 0 obj <<
+/D [3608 0 R /XYZ 90 431.839 null]
+>> endobj
+3256 0 obj <<
+/D [3608 0 R /XYZ 90 397.169 null]
+>> endobj
+3616 0 obj <<
+/D [3608 0 R /XYZ 90 392.686 null]
+>> endobj
+3617 0 obj <<
+/D [3608 0 R /XYZ 90 319.823 null]
+>> endobj
+3257 0 obj <<
+/D [3608 0 R /XYZ 90 285.153 null]
+>> endobj
+3618 0 obj <<
+/D [3608 0 R /XYZ 90 280.67 null]
+>> endobj
+3619 0 obj <<
+/D [3608 0 R /XYZ 90 219.762 null]
+>> endobj
+3314 0 obj <<
+/D [3608 0 R /XYZ 90 185.092 null]
+>> endobj
+3620 0 obj <<
+/D [3608 0 R /XYZ 90 180.609 null]
+>> endobj
+3621 0 obj <<
+/D [3608 0 R /XYZ 90 121.833 null]
+>> endobj
+3607 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3625 0 obj <<
+/Length 2257      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~���SK�x��X�Iv��n�qчl`�"e	�D-I%����đHʒƛ�C jL~s��|
��|���������2x��$$|��O!��O�c
�O�l
=�O(���"������Se/ww�><~\D�d�������Ñ26-Q�X���
;Q���Ѓaa���S�WQ�O�T` 34L��UT$��ߓy�M���
�g"$�X̛�n~�! �R�C ������g
İ�c�e��7�N|���7���e�OD�����MW)m�<P�!�E%����%�b�n�R�#ȣ-�
�G�c�U�җ���t`�c�)�d��8�
��\T���>�A,�	G�\adI0�T���p"a(F�Z嚼��	��h���l�T��['���֐7(��b�SMP��
��GD�=%��I�A�]5Y:�"���|1:\Ϋt�]�p�\���
Ƭ�Iѽ	M�{��2��q�H�6q�M\m:�(�hY� W$��>�A��҂f [...]
+�k=���J�)	D�`��>Ks��ڗOA�nPb�
Ja
jE��?�q=�D��,��)���Yu�q� 3CeuvY9oK}�
���%���3o�p�Clq5��n���SM��Z�=�
���p���
��
2������e����Ixbs68g>F"���t){}��X�f�ĵo
eS�=s�`p��!d7�mE$��+�pcZJd`�u�xhBک6����Gq�ħ�.��\!���As)�y,G@���zg9z�����U&�fͅG��A��� 
L+o4ǣ�
�9P�2�����9��A�����sTw((y��t�;C�Ҕ�7g�~�p���
f:\1
��ҧ7�]�c��\�$8
���:��ߐ�\
yõ %�?^��5�'I�P��tI�zS�cI�>Mr�+Y�e9�$��h��Es`��J\Ms���o�/Ir��a�.ٻ�}
����u�
IFF�Δ)�h�����Y�g|@۳Ն�
�Di�3?-7��&�<ʐ$ć�5A҇��Lv
�����
�3�2�Y�=��M���
�y�uXR�@����湏-��ư�Ŗ.�K
̫`l�6|�S`�Dx
}�#�S
��k%�ėl[�IMpՍ�S|�J1z��#��`V�����.W�K���
+
;
 �8�!t1�y�)�|��OL*z
o� �L,fO
��H�:�W�'&�)��F�<��ЧE/�O���1��B�Gς���,}�$:ٴ�rO�@�A�d'���
�'��N7�Ǽ�Ѿ����
�*̮LRw���X���RW��p�N�-��8,�
 ����*̓܊{�\��J�!�b��s+�g'���5��ZC��VJ�qne�-ߝ����lW��,��븕A���m��`�ل�p��	 Ĉ���A  uV
���FAIy
�
픍�2���+N�	�~
��g:"q��࿙�
�=p�Eў@�S.����mh�	�<�����2�8�^ie
+abΡmW��K�
1zh�q��
y��	r���$���)��ٛ�� .�پ�^\um����2[���^��(H��3o.F<��B6������#�6����e5v�������\�@ׇ�EU=��P�=/��]5��T�ט��Q9\& Qh�?u��̂
��$���N86k��0�C#���6�3B0B�tc]j��<߭�:_}/&$,��/��^}��[Gq�����,�D�@������6��,���nUo�U��MlCozQT�1K�]V?X�g[�[����Ċ_�?��vO��h�4
'�/i�k�v���{�Ԥ=Ra��/M��o�%o|!��>�����.��'��'B�uR�5������_�a�,/]g	"�,і�����$�u��W�\�tS�n/Qq�ֿEQl�no�v�y�yFP��Y_GWՖ��u�h�fI3���:�.D
%o����W�L���
���̓���_�,�����y��@��
+endstream
+endobj
+3624 0 obj <<
+/Type /Page
+/Contents 3625 0 R
+/Resources 3623 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3576 0 R
+/Annots [ 3622 0 R ]
+>> endobj
+3622 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3626 0 obj <<
+/D [3624 0 R /XYZ 89 770.89 null]
+>> endobj
+3627 0 obj <<
+/D [3624 0 R /XYZ 90 718.682 null]
+>> endobj
+3315 0 obj <<
+/D [3624 0 R /XYZ 90 672.057 null]
+>> endobj
+3628 0 obj <<
+/D [3624 0 R /XYZ 90 667.574 null]
+>> endobj
+3629 0 obj <<
+/D [3624 0 R /XYZ 90 608.798 null]
+>> endobj
+3630 0 obj <<
+/D [3624 0 R /XYZ 90 555.109 null]
+>> endobj
+3316 0 obj <<
+/D [3624 0 R /XYZ 90 508.484 null]
+>> endobj
+3631 0 obj <<
+/D [3624 0 R /XYZ 90 504 null]
+>> endobj
+3632 0 obj <<
+/D [3624 0 R /XYZ 90 433.27 null]
+>> endobj
+3633 0 obj <<
+/D [3624 0 R /XYZ 90 379.581 null]
+>> endobj
+3317 0 obj <<
+/D [3624 0 R /XYZ 90 332.955 null]
+>> endobj
+3634 0 obj <<
+/D [3624 0 R /XYZ 90 328.472 null]
+>> endobj
+3635 0 obj <<
+/D [3624 0 R /XYZ 90 257.741 null]
+>> endobj
+3636 0 obj <<
+/D [3624 0 R /XYZ 90 204.052 null]
+>> endobj
+3318 0 obj <<
+/D [3624 0 R /XYZ 90 77.486 null]
+>> endobj
+3623 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3640 0 obj <<
+/Length 2312      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~���SKG�_��@s�9mOS�E� �E�&*Q
+E%����r)r%R�%�(�<��.gg��7���1�����]]�W,2�H*�����Hq����ѧ�:�|�KĤF�H�ʽ����޽���֎]����zE`G� ���lq��3�Rx�K�3:��&-"N�Σ۫�]a�
FT�G��53dG3B!^1�8b��dJ0�q�-V�ʬF��I�K����Q�w��@�B�o'Tϫ�H�d�0��z���R�����b͌o��e��{�����7o��>%��Mp�4��6�٧�F��Cj[;�f��M�NT����qi
l���9�h��6[W�;��)�4�gg���d�,[[���X��Tbm��U���@�1MA���VЗ��5Hώ5�Rlm��h:��[��
�}��a�P�x
EwA��fҧ���E���I���wwE|�)l�"�u����B���^�v,������
]8��l��)�{
+V�q���,_&yQ�ų��|B��m'󬨶JտOY��Ӿȋ>�(	� ��
�D2l�7�.,;��R��4X�
��feRB�WY9!$^�w��G�A;�[%�C���(Q_Il���D��&�;҈CRq�,['v7
	�+o$S�jxu�XDRxy�
a�H�
U�
P*���H�������~����4�ҁ�_���=/�������Ŷ��1җA���\�� �
�>
� �l1�ϖx"΀c
	cg�T���,[U9��p�8�������M2�HW�G��ppa�#��/ٕh?�Ht�	��Mxe=
.)�"

�!�r�u������q�-��闤�0?n�D:���l�}�n x��F�� u`�a�b�  ��{*����^XLd⼯zp���r���g�1�II���؈K}�����$eV+���5��4/f��*���y�
Z�\�-F�$��d�ٶ��%�!�
+O
�D �Y F_�}��gO
���],�y��j�H��g_�7�ղ����y�@x���s��=��hw�.3��� �k�TH���:t�̣�O0�R��Q���9��0%G؟l�������
a�5���Y���a�!J�K������2���ϳ	�<�S at S��
E
@jh�@�!
+
�c�� ��A:���=��d%#"��%:�ɡ�Pr��6�9����E��25z)g�F�rrW�P��0T�lX'
y�	����u�iK/�$[�	/
�wa����Q�
+��a�պ�\̢8�‚��3��}�.��g�� ��
'�س=9
� :f*�-�e$�;C��I,�$�=��LW`���F��
��Xf Z��Ǝ�φ��l�<������g��`Ѱ�ԣ�Kd��<�L���?&�Bhy��[�wA�F
+�jJ1†7�e��L�,�G����z�pE�
q���
��,)�Y���E�f��e?\k�#��A�-�ܬ��װ��z
�y
Pg���{e�z��
�����2�6���E�݃� ��و�
+bHh���u�5��f ��H��V
��P&p^Hm�
z�5{��� �j~������  ����E����
��
:eşY_�)$�E
 ����D�)�=��z֔qp�k*�8S��-R��^_zs6|�
BTk������5"m�j��[t?�kZ �͑vÔ��
G'�
 �0���3��놾'
�_��
�Z�+Z��@���`m
`��������W{��M��
L� �y��N�!���ھw,N⚾֝�I�
+&02P�^��/�* � c
�|t��JX���H�!	�k ���:*�۪���4�|^�v~��Wx29�?������bY�H��7�p�H�Ƽ�>_���d��ƿ�&0a�/ҥ'���<#
�~Gd��{!'s}"loc�+�1wڐ���6d��V��~��.�w�����+=c�
X�

m;�G���]�����,�|�
'
�Z�ۏ�H���\ ��Q
2)��L��!&%�?����ms�0���Mѥ���5���j
.��J;��/#S
aW4:�
`Sp\a[�FX�������*��=�j�O�#�
>�|�o[ئj�p/��Z��ngn���l�>ퟓ�w�
|�ٿ�>�R�ߡT)���ݚr���UIU�U��.�L�s��?�&g߉��!�RE¸��
+E���>������ÂEo� �7y�V`sBm���`_ i��X���?� �o'B���I�M�1�͡o�M��뺥/	"�2�6l=M��2o�Z�mU�ӕsDG'������������q����� o?6��-��k$�+�esL��\$�9�?�
�N
+endstream
+endobj
+3639 0 obj <<
+/Type /Page
+/Contents 3640 0 R
+/Resources 3638 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3576 0 R
+/Annots [ 3637 0 R ]
+>> endobj
+3637 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3641 0 obj <<
+/D [3639 0 R /XYZ 89 770.89 null]
+>> endobj
+3642 0 obj <<
+/D [3639 0 R /XYZ 90 721.073 null]
+>> endobj
+3643 0 obj <<
+/D [3639 0 R /XYZ 90 658.004 null]
+>> endobj
+3644 0 obj <<
+/D [3639 0 R /XYZ 90 604.315 null]
+>> endobj
+3319 0 obj <<
+/D [3639 0 R /XYZ 90 557.689 null]
+>> endobj
+3645 0 obj <<
+/D [3639 0 R /XYZ 90 553.206 null]
+>> endobj
+3646 0 obj <<
+/D [3639 0 R /XYZ 90 482.475 null]
+>> endobj
+3647 0 obj <<
+/D [3639 0 R /XYZ 90 416.831 null]
+>> endobj
+3320 0 obj <<
+/D [3639 0 R /XYZ 90 302.141 null]
+>> endobj
+3648 0 obj <<
+/D [3639 0 R /XYZ 90 297.658 null]
+>> endobj
+3649 0 obj <<
+/D [3639 0 R /XYZ 90 229.084 null]
+>> endobj
+3650 0 obj <<
+/D [3639 0 R /XYZ 90 175.395 null]
+>> endobj
+3321 0 obj <<
+/D [3639 0 R /XYZ 90 140.436 null]
+>> endobj
+3651 0 obj <<
+/D [3639 0 R /XYZ 90 135.953 null]
+>> endobj
+3638 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3656 0 obj <<
+/Length 2603      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�8~ϯ�Ӯ
�Y�/�b���頳]�ۤOm8���ȩ�����ɢ-K��3,� ����#�,��r���ū׊%Ier}��(n���H>NF|:#�ɻ)��y�8�y7�x�^�<��b~�6�-�����?�\=̟����__�&�E����0���7?$�f��
p�A� �D=��C�����tFb�N�ǧռJ}���>-�DO���gbB�4/~���rA�
N��@J'w�?�dͿ&1X�77�1��s�\]���6OD�}�� o�^�6c�(�s�.9���2I&��k�r�
������
kz�]�D
kk���1&�F"�EUM�b���6o[�
`#l������w�����x&�ِ�b6��qޭ�e�l-Mg
|�ͽ�Ȫ�
v��C��?n���"]��Ev?�bv�mܶ�_�竬z�J1�!��-[��08[��"]�~�"9C8{mɒdxL�<��q�,�^(�^�?�v�>U�:p��U
+���e�En}�HF'�]�S��<�
<�6I��I�N8�`p�H�&���O(�̒��c�uSV���,�r<�
+~���S�&���4��͞b�4�s��
���T�8"R�-5
+.DY���bm���<���O��-#��IR��O��cE{2�S=d�s`gn���v\�+����>$oGM�8�
�"�
���e����i^e��t(l1�=�R����dd?=�fвԡpb\m
+>���B�WՅ�nA��t����+�x3�zyJs�j at mZtVx��56[%^D����VJ�l�U
'�0��2��Ȝ�-"���o�4�}lGr��,R�.����&
qpv��{N�M��]�2n(d��oY��1�b@��2��

+"�<���y�W�W�',�t&�]
��Q���,x�/�B7W/%�f��5C�-�/��t{�F�we��Y۴�]���3�
�|����(�o���IόRDpχ2-�B�n�d�֋�Z��j�-q�p�wq�Қo/�'�VkO�1�x��K<⩧�
�-<�,_v�
�����
:�s ?5)ŵV�=c�
�C����
�@K�ǬqG���9A1���?Kz

#0�hW0@
Ĵms���E' ��p ���o���>b����{.-D�)LZ��
c恂+Vl��l������
DZ#�o@*�Æ�1��d��/���vC��ؓ)
�ʸ�H��AW��~���4�CaE�
��H�˸�H+>,s�5,�Zꉰ,Z�
�:�	ܩ#j�q`�����D@C�:�c�Cs�q�(]'����	Ô�ä
�a�P�̡0�
�0: �a�Pf�s����>�a#c��a���
Ôijn6`J�� Ä�a�uz�B=0� "�0lى���6
ۏ�|@-�ѕ>]���]i$�.�[1�
@���WF#��X�[������]e� �A�`ٓV�B�o"�
X�q�	��\�."���-7�}�I�y�|E�iE�2�u�ʾ�*^����x�A�;
�E+D��ʚ�Q�pv��
P���5�)
�����a�����4�sSC��0lC�
�E�@���@׈�1W��!W��?=��_H�q1�����@������9$�r&�����^d�R�H��M���7Ɛ0l�7��ۛ��c3
��&�UD�ҡ0+���1�P�ޠ ���&��3��n�Y��A�A�

�n�ҥ�É�K���)Qa)�L��b'0eI1&��)��n��c�j�xR{t)ggZ(���1���	&y<����cf%l~��r�`�̰��:֌2�8�b/W`A�q��Nb7�m6

ز=�a>p�ˆ�w��_�M�UWx�
L�N�[$��f�����%���1D�%��-��G��&�8���21a�w[cƤFD���W�}�C���P�M�اz��O͑�C���k��(��C�
+U[u1��y_
���Q��P<6��x`x��7��o;���"[>T]T(����Ű�ՐxC�}�
��
�6��KsLI��@�t�t�e��_.��nl;�5����z�m��c�[t��Q,�*6��si�W
��*S��ߞ��,�Q*
�}�ܬ��a�=�]+����)� 5�\E"�����xIi�O�7����6�F���f��P���7�N�!kը�h<ʶ���턑�|�6��������8���7��UҔL
+�yo�?�Ah�}KfC�W���w�r�uZ�\Ft~=Ok�I*l��
��e���K1������	�5��j���k?�!�"+�r���b^����p�����usս�w�S�wg#�]�6W�����:��
v�ڢ;Ya�
�^��x�ˌMѻ
dF�(.� �墫��_����>s#�>�f��
�5��wS;
�:���m����0�9

�
�"����0Г2����/��<��=F�y=�Tu�o[�P1�ǜL1<�;�)�����*5X%TC�D`��[�����[��L��Z��
+������ZN
���	"P�h[5+�J�
+�3�ߤ~�ׅ+\6��
�77�����ի��e��K�[��� E5���3�n�Gr�Zs�����1 L�B��4@�_@����z�k�������՛G���!o4�?�1�
+endstream
+endobj
+3655 0 obj <<
+/Type /Page
+/Contents 3656 0 R
+/Resources 3654 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3668 0 R
+/Annots [ 3652 0 R 3653 0 R ]
+>> endobj
+3652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.403 210.12 224.563 221.024]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3653 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3657 0 obj <<
+/D [3655 0 R /XYZ 89 770.89 null]
+>> endobj
+3658 0 obj <<
+/D [3655 0 R /XYZ 90 720.814 null]
+>> endobj
+3659 0 obj <<
+/D [3655 0 R /XYZ 90 667.125 null]
+>> endobj
+3322 0 obj <<
+/D [3655 0 R /XYZ 90 632.455 null]
+>> endobj
+3660 0 obj <<
+/D [3655 0 R /XYZ 90 627.972 null]
+>> endobj
+3661 0 obj <<
+/D [3655 0 R /XYZ 90 557.241 null]
+>> endobj
+3662 0 obj <<
+/D [3655 0 R /XYZ 90 491.597 null]
+>> endobj
+3323 0 obj <<
+/D [3655 0 R /XYZ 90 456.927 null]
+>> endobj
+3663 0 obj <<
+/D [3655 0 R /XYZ 90 452.443 null]
+>> endobj
+3664 0 obj <<
+/D [3655 0 R /XYZ 90 381.713 null]
+>> endobj
+3665 0 obj <<
+/D [3655 0 R /XYZ 90 316.068 null]
+>> endobj
+3324 0 obj <<
+/D [3655 0 R /XYZ 90 281.398 null]
+>> endobj
+3666 0 obj <<
+/D [3655 0 R /XYZ 90 276.915 null]
+>> endobj
+3667 0 obj <<
+/D [3655 0 R /XYZ 90 182.897 null]
+>> endobj
+3654 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3676 0 obj <<
+/Length 2821      
+/Filter /FlateDecode
+>>
+stream
+x��[[s��~ׯ�SKΘk�}��t&i���4u-���h �В 
���_߳� �
�(�t�"�
���=�;ו��{����w��?H�(Dx���d�~-�O�����'�
+�p �+3�׿�:���Z?�z;��r���aK�#����էϾ���<�@yO極���ʻ��Ǖ_�R_��V_J��P���'1E�疝�_�M�In�#�7��AO�Ǽ/'� �f���
+d_�&#�D��
�
ocp�!�ኻ$�w
�f
3D`�K"Y�-T�pXC8�SMF˜N^,޼��)�'��*^܄ٔ���v
%��W�<��@�tԅ�r@�Hw��2��<�R�7VJ� �Z��!K��O���p/�� `��
#�
+\�h-
�R��@̯_����4s��`_V�e����X��R
b�d/��E
��<�8�Kכ��oW�}��$i�6���k�>u-�^D��.�(
+�w�am�4���D�{�Ib�FE�4��M�Qd�kZ|�g��6�Ӧ���F�y�(G�>	o�b�'YxW؁8)�l�EE���H�u�.���
�dLV�A��CX�'���(
�j�����|b�*��j�tY�y�b��{3#�M���W�/ύa7�h��waV��]�e�]�z.�7�,��-+zXq at G)��i8
����@J���e
BX�x���x�대}�k 4=`��͈ �
+$��~�}�@DLg��a���f[`9�MR"AjN��o���H����y%�Zo�“�� SHRR��A�����Q�x@�x
ܼ�K�z*���j?6�L�a0  
N"���
+j\�G!T#+C��2
y�,�ԩceX�
ܤZ�
�PW
+�
Ѱ���{�}s�n\���w�4��A��d;�X!�y	M��~K0o��kA����c����l3�P|�]�@
8��GC��
+d�f%���%�(���=lN\9�ΤT!�{�IFB�֤�8���1-�
_�Q���4��
+��
+�D������5/���t�0f?01�t�q � �
l$̲������A[����s��su��"��3|���7{����7�ܘ
 �R�C$��W�9�(?Z�- �<,(
Pu�_d�0�֣Ii�p��cD�L
x.�4
 ��2��"��)�A�U�rm
��;�ѧ�dp��!%ؙ�c�`�,S���y��fZ6l
i3�3�}��+mO�r����(!�kŌ��	fo��׷��E]r@�.\�V����%�!i�����aDH�
��D�ϭD'
�a�
+f��}(=�	����ɟs������Ŝݗ�����ɼ�
���g
Y9��N'���N{G��ɝз�K�\��^�3��F�o3	��SP7_���Ώ���O^;��d���2���ӯ�D�!ʜ-F
+;9h��˝��l��q�R���*���<"��<��@�`���v�‘���;�r{Y	dD'%63߿�1l�A�n�"�
T�Z�R���8�8B�||�>:ES��>P*8\��G=�]hc`��8�Aq���d>��V\
+|�����6(�E�s��,܁I숩A<j��r��D�桶<)轱�d�Z;�n�m��8*?*��b9R�����!S|0E��C�V��nta#ͦ\'���oW%�4)SK+�-�r4$��(�����z^�ĴYB��ya����Wp_��OE��
`�"���񢳯@z, �FH���">�xi�a�BU���`�
���H,�
ܵ�/W`�G-���,�$.���A	�;c�
Z`���?��s�իۚ 7>
ZF�h�"}��^w"E�&�٘��э�:xD�e�q�dg~(>:NU�f�_�@�
4�NT��)��Re�D��TQ�Ȩ͕�i!j!�
��� yIK���$jc�T�\i�S�,�̞jk�4U�����ЏQ ɩ��Ӵ�TP��Z~ 	�v��F����J�8�J@�͹&#a���ȶI�xeٔ�2���wۏږ�7�\[�؏3LI��w.��$����R����0�������j�3�t�y�t�|��~��q���3�}�A������C������
yЬ}t��t�T
���r�kC'
����,|��Rqu�I�HW��n��Ͱ���$HQ;
K^v�@r�@C5)��N�PSN{49�
ݍ��d���!D��p��p����:(��j���È�N�
��jo�K�_�:}�o7���B����/�s0u�B�M�fy�2�͝��h}-��/�™@B��� 
�P�LQ�q3�����-�V����صO8\ 8��A�Z@8�JY+��r]Ƈ����.r�����<e�1�{�4
���)�
+�U55\
[K={u�� %��z>���c��t��KA5�u���c��$/���NU�r��ؘ+�r��R��i[+�Kj[N���^v���zO+v�3�OCz�3
+Y�˭L�O�-`_@ә)c�Q����Ϩ�
�{��#	�󣽬�y�_ ����c��:�e��VV�L��|�"G=��{`�h8:�إN�	 ^��\�ҍ�M�q�I��Lx��_v�@�x�Ʈ������
j>"�}Ϣb�%݃8f��ҷ{�E�]�l�ލ��J��X{hp�
ˤ�y��lFT܀ԋ�z��k��	Q�;�oaREћ��]�Q�$��l�� 56��/�c>�����{���
x�nM��S �#7z�
�
+B
+�D� I
H5iF���R%��?��vը�m�m�����l��M)-��~
UZmy�w���V�
�twrg$�b������}
%�,�~
+��8��e��,���4��%}�����_n5>~
+endstream
+endobj
+3675 0 obj <<
+/Type /Page
+/Contents 3676 0 R
+/Resources 3674 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3668 0 R
+/Annots [ 3669 0 R 3670 0 R 3671 0 R 3673 0 R ]
+>> endobj
+3669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.245 571.199 224.405 582.103]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+3670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 156.221 149.577 163.747]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.768 156.221 216.525 163.747]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a70ae1ffea56bb9c7953cb0225caf4df2) >>
+>> endobj
+3673 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3677 0 obj <<
+/D [3675 0 R /XYZ 89 770.89 null]
+>> endobj
+3678 0 obj <<
+/D [3675 0 R /XYZ 90 718.682 null]
+>> endobj
+3325 0 obj <<
+/D [3675 0 R /XYZ 406.869 654.432 null]
+>> endobj
+3679 0 obj <<
+/D [3675 0 R /XYZ 90 647.792 null]
+>> endobj
+3680 0 obj <<
+/D [3675 0 R /XYZ 90 543.353 null]
+>> endobj
+3681 0 obj <<
+/D [3675 0 R /XYZ 90 441.046 null]
+>> endobj
+3326 0 obj <<
+/D [3675 0 R /XYZ 406.869 364.443 null]
+>> endobj
+3682 0 obj <<
+/D [3675 0 R /XYZ 90 357.803 null]
+>> endobj
+3683 0 obj <<
+/D [3675 0 R /XYZ 90 289.229 null]
+>> endobj
+3684 0 obj <<
+/D [3675 0 R /XYZ 90 235.54 null]
+>> endobj
+3674 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3692 0 obj <<
+/Length 2363      
+/Filter /FlateDecode
+>>
+stream
+x��ZMs�6��W�HU�Opmm�N&��l��{s��\�D�ܥD��fV�~ �M��DOr�Ţ)��^w��$��<����������yi�������'�F‡�������c<��<
�M�p;�x�ć�p�?F�4H77��?�=�p������0K4GR+��Z��Қf��
p�cC#�D9�c���,�/��`L�Y���A
�;��0�5
�+�%93B��y����oW�`���H*o����+��p�#�|��6
�
>c���+\��O��{D�D�o��uo}(�Cx>��,΃a�Z&IlWY��>.|8�4��4Z�q�9L���f.{������M�͢d���au���o��#��΂��P�Z%�,����Ws�/a!�
�����H(�*o���Y�\�R��O������}�]|��On�
+��dN�
\w���~�."Z0���
+��gq�#^�(O:k�v�����Ǟ�4CWV`d�DB��rL 
�f�0ߧ۬�(�SR��1����,��IZ��
�}s��-8�s�- UZ7*���
_�l�̶��dQ�澘�^��
0�1=�������9hW%�U�@�j��9Ժ]�
@:���cH��8�7f���Ơι
�:f
��!�&4?�B���:P��P7~rH6֤s�����$����e
zYߤD>�Ȗm�$�8o��Y;U��/I�b�
��p�*>�)�%Ѻ��*�hu�u�s�8�5eߪ%�>Z�مj-77��
�4��n+�|���'H�*��l8A�F�2��PMh)�k���� �sLJtUY-3@�#:�]0���\�0Rd�o��n��1X���lf��D�q�]��/�U���LMfd��V
���b;\�X`}������Q��)R��s�?; ��l Yw�Yd��`6!�GJT�����v�H�
+#��
�
�^�ɲ��r5��^��
Y0
+�h���%�&ՠNy
�

��R�AM
+~k�2H!�s�Y�,믷����}i��]�b1�t}��uF��""Z{R��j2`F��l���Z���]��&�B����">��.�
h�
 ����.��9E�
+�r�9��p��FZ
�h�!Y�\��q �I	<xBH�m�7>
"�1�4�`�KH�����
+w&Ɏ��	A�}����o��:}O���
4.�R~ |��I�I{�N�(����8
��"
��)\h�,_��@��B7���LΞ�+�0�)�����S�D��2��含
ʬemO�S�s���P@�}2\@
�U�
+��M�l�%�~b��+>��+�G�s�?�
���DL���
N]�:P�����j�/�=\�u���2�D�O�dwa�3'd Q7t��S+
+R��P	Y�9J =��
ǰ)Z�Um�X�&Ê�j|�b1��(�HM�X@\�j�)3m�X�jm#�p�^da>/WgG��nU����A� F�7r�x�5�0i����V�]�ji�R�XN�'q��� �f�s�
,[�V��l�
"��4tr��p1H��M�l �!I0Aa�҆�r���ͅ���7���'�+Z�E��.
7��ؔP;���#�[��A1���$Qo`� U
(�
�ˁ'
+��Ŧ�q6N�;T[10�ܙ��R�t�,��q?��N�͖֡��:��9N���!�%�h��/"�-�
��.����Y�-n��E��
��
iv�[4�X�O"2g���I��ժ��Mw�
��2��U�D�u6������մ͑�l��-*��%�~K���1�%��[R���j�2���ު��\��W�h[RE��RC���$
��d8<w�"JW���|
���Cv��
D!�|yT�	m��_l/��V�v�v����C�-�
5FF5$�e
+;ݒ���
����;
O�
7*@XfK�R���m-�gӔ��*�����O�C>�XAYxգ%(Ԍ�gK>‚NN��Y�m���6-�#� _�)�
��4�Mǀ
+=ӛ�Ӓ�u\=�����Xc��Z���=�~U����W[��DFu�i
!0�%�6,/�9J���	�h�8y��>�®���8�'r���\�ibK�5Ml�6�K"%��Am��y,<J��-���Vo�u��F~6Ŵ�ZUך�"pp�e�^8��d�N�08 �>���}�M�aVt߽�sp�Fw��
‘'�����E�T?���/�"I٩o��UY�T ��١DB�No���Gw��,L��
�L����`�����O���j�	"�4TZh�`��²���_����{�^���kA��绛����)
�O
+�K�6|l�
+��I�R�&I+�77�!*3PU�1�`����T-L�Ņy/���_�?,n\�cü�	lr]���M�
+endstream
+endobj
+3691 0 obj <<
+/Type /Page
+/Contents 3692 0 R
+/Resources 3690 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3668 0 R
+/Annots [ 3672 0 R 3685 0 R 3686 0 R 3687 0 R 3688 0 R 3689 0 R ]
+>> endobj
+3672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.69 709.04 233.263 716.566]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.69 645.896 233.263 653.422]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 561.056 212.124 571.96]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+3687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 399.485 210.103 410.389]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+3688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 296.077 485.603 308.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3689 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3693 0 obj <<
+/D [3691 0 R /XYZ 89 770.89 null]
+>> endobj
+3327 0 obj <<
+/D [3691 0 R /XYZ 227.473 608.424 null]
+>> endobj
+3694 0 obj <<
+/D [3691 0 R /XYZ 90 601.784 null]
+>> endobj
+3695 0 obj <<
+/D [3691 0 R /XYZ 90 535.212 null]
+>> endobj
+3696 0 obj <<
+/D [3691 0 R /XYZ 90 481.523 null]
+>> endobj
+3328 0 obj <<
+/D [3691 0 R /XYZ 90 446.853 null]
+>> endobj
+3697 0 obj <<
+/D [3691 0 R /XYZ 90 442.37 null]
+>> endobj
+3698 0 obj <<
+/D [3691 0 R /XYZ 90 373.642 null]
+>> endobj
+3699 0 obj <<
+/D [3691 0 R /XYZ 90 319.953 null]
+>> endobj
+3329 0 obj <<
+/D [3691 0 R /XYZ 90 273.327 null]
+>> endobj
+3700 0 obj <<
+/D [3691 0 R /XYZ 90 268.844 null]
+>> endobj
+3701 0 obj <<
+/D [3691 0 R /XYZ 90 195.981 null]
+>> endobj
+3330 0 obj <<
+/D [3691 0 R /XYZ 90 159.811 null]
+>> endobj
+3702 0 obj <<
+/D [3691 0 R /XYZ 90 155.328 null]
+>> endobj
+3690 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3708 0 obj <<
+/Length 2408      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~ׯ�S+�T0��әnw�I�l��}��d�6%s*�Z�^��� II���v�D��988��a���|;ys=��F�� #�L������		�&�������&5"F�[���z�����}6yw=�<!�'�
H��f3��'�p��#ft��mN�����?'��K󋨰�����!�j�0�"
i,�t��v���,��݄�D
������c�U��w
��-h�}m��
�H���ȅ�!:b	���H�^K��O8��ʕ�"M�-)�9��
B(�̊Qp�;g_�^^f���/�uv�뢘15]�o�m��5��98�E5́ �]K�H5f��-K)6�����"�Q1}���T�i���]|C�+�)b��y�
��R�=݌)ﲽN@"��A��m�
"�V�
��#E#��
)R?��
|��|�gۛ|�[�٧u�Ɲ%��Ή���"��Q��,��%�J�` �)_D1�%A���c<-��n�(S��~U)$i㐿��p�o���t��X�I6��� [...]
%\D�	�V|����n���J++˼�J 
+B�n�Tϱ�,�ӓ
V�R��}�T�����!ۧ=Z��(&�ĩ �r����c�a�i����V�B

��N`�Z��J9z,/�~
+a�†W�鰼P�
���["���B	d�m��|LKk0�1��`>��+�wh���N!i1jZ�#�$���a�
�<{M4�d?��n��	�A�4��ѱ�<9�gπ�ٶLW�����z��U"8�e�<PI]3p���	�����P�j����j-�'$�:H%@
��Z9�u3��^&�i+v
������$ �<��3	�R��4DD_��3�1�Q	?�v넑�5�ؤ��b5#�J�n�40���b%V|�J�e/+B)�ӣҔ��Ѷ<��h��:��v�mZB1s��ޯ�h�[�>Zb`v���]�
b%V�Zӄ?����'X	4P
��ߙ��謄K�"���"
'���x1~.'i�<�� ��JH�q���֜�c�
9I`�WN�8�˽5�A �Aܬ<C��>�rp#̯���s�#a
� �Q�@qՐRM�Y�h��1��T7ۀ�Y�p�%4\��|�};�7��-�������+?ƕd�Q�:���z����L�����\d�l���+�ʣ�
�u�� ��rauK��+�nM
�B� �� [...]
�k
��v5�Ɂ)
����J�: �/3ʧyv�G�!�SY�(���8�'�?��f��LN�7i���XC�Pč9��J�3F:Q,��S��:Ĕ�en4�fB�-c���
�Hv�
�*A��\i��u��i����BVP���[T��L�f��(m�X������
ꫝe�fZ֭�U�e��^/ѢP(&эA
r
ydTSW�E 8���O��
+�ep�F� �1 
+�B��'�Z"�a �V at f�1����
�c�
@`�W��˽5�B�C��|~Z�#��W	���1��Ȅ:cDgC�����1:��s�Z;�$��� �> �}�-��A�3���yX
�!�;����6�OI���)�
�Z`�w����?������)P� P����1�~���
x��
��D
�O�����p�oQ�ՆJ��b�_�N�n*�4-�;��i��O����e��[��
;	��v��Iȇ���S���R�騵��t	pI�S`T
��c?���S(Q#��vo���&ڜ���z�ok�o܇Đ��P��{��.��Sqh"��L�g�gpt�Yt�Lv��b��W���3a)ȝ��%�
�L
F���sLKk��1���9��>��._�� =W伈��_���,��p��=Gf���w�� �A�S�������x�3��D)�
���������w���A�A�
���@� ���Z+mm�C���?�ſ���q&Ĵ*�?.��n�]�M�/v��@�"У��
v/���UZX�s�O3�&.�[sR6M��,w���W�t�B��h���sعY��ɋ�a�͍�	}�����qQ
+endstream
+endobj
+3707 0 obj <<
+/Type /Page
+/Contents 3708 0 R
+/Resources 3706 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3668 0 R
+/Annots [ 3703 0 R 3705 0 R ]
+>> endobj
+3703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.275 193.068 293.971 203.972]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+3705 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3709 0 obj <<
+/D [3707 0 R /XYZ 89 770.89 null]
+>> endobj
+3710 0 obj <<
+/D [3707 0 R /XYZ 90 718.682 null]
+>> endobj
+3331 0 obj <<
+/D [3707 0 R /XYZ 90 684.012 null]
+>> endobj
+3711 0 obj <<
+/D [3707 0 R /XYZ 90 679.529 null]
+>> endobj
+3712 0 obj <<
+/D [3707 0 R /XYZ 90 596.713 null]
+>> endobj
+3332 0 obj <<
+/D [3707 0 R /XYZ 90 562.043 null]
+>> endobj
+3713 0 obj <<
+/D [3707 0 R /XYZ 90 557.56 null]
+>> endobj
+3714 0 obj <<
+/D [3707 0 R /XYZ 90 474.744 null]
+>> endobj
+3333 0 obj <<
+/D [3707 0 R /XYZ 90 362.251 null]
+>> endobj
+3715 0 obj <<
+/D [3707 0 R /XYZ 90 357.768 null]
+>> endobj
+3716 0 obj <<
+/D [3707 0 R /XYZ 90 287.062 null]
+>> endobj
+3417 0 obj <<
+/D [3707 0 R /XYZ 90 252.392 null]
+>> endobj
+3717 0 obj <<
+/D [3707 0 R /XYZ 90 247.908 null]
+>> endobj
+3718 0 obj <<
+/D [3707 0 R /XYZ 90 163.09 null]
+>> endobj
+3418 0 obj <<
+/D [3707 0 R /XYZ 90 81.969 null]
+>> endobj
+3719 0 obj <<
+/D [3707 0 R /XYZ 90 77.486 null]
+>> endobj
+3706 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3725 0 obj <<
+/Length 2905      
+/Filter /FlateDecode
+>>
+stream
+x��\Ys�~ׯ�S2�� ܇*I�
��w�*g�͋wK5��Tȡ�
����40'(
�l�\$�`���u��d���<L�}��۷������K�&I��f>1x��AB§��]B0��K�1N�L	N��*�}3�8Y/?.��&�}��m�����o��}�H��o7?^�$�'����0����j�73�Dy3�& � �D3�c�[����
+
�
M���2-�����<�L�N��

)�DB��2/^�\�~A@
���
)=�_]��
Of��G0#��|p�VN�.'o/�}�=;;��c_B,�5/b����e����+�$ݵ�'[!����ǬHWv�
+��5���h�c��~Jy��g!��|;p8G��}�ps�}8 ;(�Omk�
��N�bL��w���O�G6�|L�Ѧ��s�2!֞o�U:U���`Vy�W,p�z�#�[��Ǣ5���ݲ����H
�s�
ʩ���B�4��v���ؖ.a .>������y����<V�����"0�f�.Z��%�3�L�ٔ��
+
ЙrС��w����>ϊ�
)$p�V*�9.�F!"�E#��4/��׭�v�6�+#Lϸr����ds�P�qy*�d���X��"-� �a�?BΦ
&��l�̷뢞M��/� 䵎�`�$�:��Q��nP��\�����1
�"��o ndp��\W� D{�D"�i7
f��=�E^�ȷ�O� �z��Z[���C�����sʤ�)I�S�	����yK�����5A��Hz7C���h���Z�⾴1�
���Ǽx�>��K�7;��H���=$����.��8ɟ�3�
�
@Ȁ�=�5��N0n��>f���e6�
�}
�ib�� �9%���{7-f��J�U0��˃%(њyn�w������e�F 2������ةK[��d�K�}
�qݷ՗���:F��
3�
Į�	��1f"��zko*��~|�UN����	�S�C󰱈���L=<�)�����fQW�^0�'6���E~��5���c��(�k�ԥ�l��/Y@�3�<�)�����
�l���H��I�E2A2}��P�3���T&
��2-�U���j�:l����
�����F�Ut��4�JŁV�0Z#)yp�E�y�����"˯E?
�N^�044�c
�q�:Ybp��;h�0t�B`h�*G���>{���H=q@� 84
��U�qF��ėY
t����x�
�
�^ɮD���D��p�\-c�M����P�H�&ߨ��ݖ��뼘r���e>�������q����b�f1�i�R�݅2�ض��
��lؖ)��y�جm���Dp���P���x�����֩kk
�|�
�q�\c��S�~B
,�d��h�x�0x=
�Jw��9=�?�&�2�
+6	^V��
QN��)/�׫Ǵ�ۺ�ɵAC+�t�/�tUlfk`W%��:e׹�Ѯ��.W",�t�~�5�'00�<#

�+Kq2
7�#s�f���l�
Ϭ>%Ϭ�Ϭ
�EGi�э��aؘn&�۫�vؗ�-(3�e�͓HP[&�L6
=��W��N�
�X��Q#���x����%��KF4�D���,R�H�$�)�>�	DA�k�����\�Yf6jefKKk�ϼs @�� sz
~ �;ӎ
�nK�؁ �O�qV��[ym�
�#�{��;o��R�Lq
+u0`��
��'�f*�ؙu<ҹ�`b��\j4�]�?�	6]�;�C{1�z�\��\�X�B.��P�
�QJ
r��m�����0#��s�|(
�<�����t�D&s�S�]���_�@4�
+jv�nѨز��q���c�<H��qX���fq�������j�sIO����9A�R�J��<�S�x@
+2͗���E�*�.�u��b ���?�Sg�W*�����#H?yz��8�ӗ<�ɣ��D�X�v�S�� ���~�=�#�L2
+�s���D8���+��{��>��A^s[�T�\n�A�rQ}i��5��.����5
�ݯ���9�2�$)�6���"-��Ͳ
+���cn�n��wE-`?�w�+��8���k����:v4+������M�ԡt���߁�r����m���	�T��Q��*W���rt�ʈ�<�'���5�:������$���2biH�ˍ�Ά��Y�i\���>�
�p�ZQ�����*?��c58���{ܪռ�VwT���X�WGqg{+ob�*�A��
+o�J~ǠV�  ���w��^�M
�@��
���a%���NGg�
�U
ߜ�7�����*�U�c
%?�1��1�p���������v}W
�\‰<������.�B;�
�b���k� 캫�#|�%�R�S�
ގwQ}�ގG�$>��.�������
+
/`��,R���N����Rô2��
+D������k����]E��������vW�j��.G�D��d�>�g
��@�*�4�8܄r��{�U�M�jB�/���
M_�҄�9�%
+{�RM���
+�a�^���#Q
a.#���%�֍@��
�J8pW�(��L=�����g!
�Ow�2/��Y��W=
i�uD�ŖX�V�LE��KC�����L}}e>�=�ӗ3
�X̻��%V�b�
�Ƽ�k��I�x�T'
��:�������eE��%
G�L�CbS����&*�_��6ey���o+�
�W+�5���F[b��zk<���/���ݯWw����c0E����vO�X���%R�
��K4���_��榯rw���͛����m���T��9�M��tY��
��#�m:LD`�֖��O��f
5R)��I��
�N
� �]T,��������a�@��I���o-͛�X�7����
��e[W �Z a�'$m��
|��Rԍ�w_6?�\�Z���k0r��Ӡ�t
+endstream
+endobj
+3724 0 obj <<
+/Type /Page
+/Contents 3725 0 R
+/Resources 3723 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3668 0 R
+/Annots [ 3704 0 R 3720 0 R 3721 0 R 3722 0 R ]
+>> endobj
+3704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.332 661.939 235.598 672.843]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+3720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.953 437.793 250.388 448.697]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+3721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.151 214.046 244.345 224.95]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+3722 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3726 0 obj <<
+/D [3724 0 R /XYZ 89 770.89 null]
+>> endobj
+3727 0 obj <<
+/D [3724 0 R /XYZ 90 634.093 null]
+>> endobj
+3728 0 obj <<
+/D [3724 0 R /XYZ 90 555.697 null]
+>> endobj
+3419 0 obj <<
+/D [3724 0 R /XYZ 90 509.072 null]
+>> endobj
+3729 0 obj <<
+/D [3724 0 R /XYZ 90 504.589 null]
+>> endobj
+3730 0 obj <<
+/D [3724 0 R /XYZ 90 409.947 null]
+>> endobj
+3731 0 obj <<
+/D [3724 0 R /XYZ 90 331.95 null]
+>> endobj
+3420 0 obj <<
+/D [3724 0 R /XYZ 90 285.324 null]
+>> endobj
+3732 0 obj <<
+/D [3724 0 R /XYZ 90 280.841 null]
+>> endobj
+3733 0 obj <<
+/D [3724 0 R /XYZ 90 186.2 null]
+>> endobj
+3734 0 obj <<
+/D [3724 0 R /XYZ 90 107.804 null]
+>> endobj
+3723 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3741 0 obj <<
+/Length 2997      
+/Filter /FlateDecode
+>>
+stream
+x��\Ys�~��ST	ùV�ؖ\v
G����.D.IT�^@��_�o�
`vq�l������==���-:���W�__\�0b��\���F���tDi�u;z=f�N~��f$�%�i�U�����]?����v����
�Gt�J�;�Y\����nq��%��чb�b$�������?.h%
%\�K�SI�ؖd��*�(�D��d�(��M�xz�m2/��
�}����E�S9"�m��̀�ǧl9[d�)Wl|
!(�
���E�bՀ�.ǫ�m9.P7s�6J���7�
fO�)HI�dCS8Ƅ6D:1$�W��\]�O�v�-�|�8�����]ma$��+#�ZsN�uͪﮯ�2q��E���@)_f��mx
+ƒr�C���lbƥJ�@���X�f�5q|<�糷��"��h
F�
��M��"��BB aGS�*_�>���WoW�1.F���̳���ų�z
N���ݬ��MD
+�	�x�Η�,���| ���DH[NL��?D�$�5d�	ScO�UE@BPш��*+`q3ϖ�]dHΉ�Bj D(y2�¦q)V��&��7뫫Fc[���pI��
aC�yvhfy���b
��2��m�\-���f��܎�
Ykea�mT�oVˊ�Q�7�"V5
�����u�P��
,5����90

C6�J��[��k�o�x�*�pZI�]˅���Z獭���1� \�Đ�d
+�p_\���.�_qy v���C)@�����M)TP��!�����W@������b��n�ո��ūyeE���#&��s�)�U�81��ئb Q@� �U>��>
+��َ"�����P� &o��$��Bo�m��Nc8�qlkm ��7���p�uY�������%�'�q����ϼn���6gD0��5�fƶ��9$Jx��;H`7�����z�ˣ����X���.�x�1�Gơ>

� ۞]$@N�mm�)�XJα�Vm��'��p�6�6^���Oˇ�ٶ3�9&ܰ7
+�F�і觥��u����
U��-��
b������iޗ��_YL��<W��[��P�����ݦ�z�-+�������fվTq&��mP_{�5��
��ϖ�,/��{���ۄ
+Ba��3я
�TV��bj��C�� '	��!��k�i�'>Lmi�A�Lq��s=dG��"�.�'�O��K��W��$2\`�=M)�::@�T{ ��r�0Q��4PY�[����t�8�����k�� �
�C�ɳ�Lj�~�M���K���\�A
5E|�o	u����<q����.
�~3�<�~����2%�N�x`F�:DHr��%�Η>��&{�G�
� �U��dv��,R�����YlG���=�RB�d~�6I�^�dq�I��VD�lt7��'ѝ�
�t��֛۫��r"�_�q�}3+<�{��*�Ի �ŒQ�t��ķ�*�$���f
�b33�~�W~��/����b�KD��w
#�
��t�`;~���`�푿3��q���8���F
�o��a����^�I��"�2C�^L�v0xK8-#o�ᒇ��
a��	�b�����\\�� bl&�~�;#�U�W�'�\mJ����F��n4
�8�I�P��*'�������ٞ㬜�z��o6�ҭ��ա�O���Q�s�S�)�:�*�y>���򙄫�keV�3I?e��ؾ��6{�g-��g
��~����Z����is���S���3���X��Y��a�]���D �
	8K
�
aH�y��$%4���؄a���?���
�:Y��M}��a
��1��Y���m�-N
��Dd쫷IB��ݧ�z���m�.�+�dU�1[E�eO�Fw���N��A���j4�2^�Q8�lr�e��smj4��k4~`��t��h$�x�Q�c��a}�IId��hԺ�"O;��EX"̘
$�!���یy�	9�_�Er��ˆk����+5
�),���]��
#МuVF�I���F��2�~��|."�VF�S,bK�+��9�#��H���hb�D�o��xΔ#��	�8�2�$�s�d�W$��)�b�'��.qu�����y\u�Lq��s~u�t��$M��Fr�%X�������"���0���@�s�
q�t��5�ǧϦ�}2+i��t����T���5�J�4A�	hی�F�)(p/���q�b7}\�88{̝%Ҩd����[�����厃yvs�\�&��q�Hf�|�&ۏ��[�y�Y�0���V�C&K���1�pL�uR�2�Xf��
2��Brӓ���+��0+C42���W�.=�d�2�'#��F���_���EsobJ#Ro% [...]
Wy���R���ϱ:�B�p��r� CO{�U�vu
�^��:�� ޟ�ʗFE�����m�3O��OJQwT{A
+�U{A����`;s͕�m/m�����v
U_��2
�'{���K�a��`a�dh;
T��.�1�a��NP��0�W!�j0PC
*�vF
5(Ê9�`��q����]a�j0hH��Nّ
�m0��z��(%�ͣO%b!��J��&�)8q�'m*�
T��F�s���H�lHN��}��
'�n*`�o�����3�f�9�[�
+NWD?r�w�SB11���&U�J���0�������������"��,H����K�p���[
+|v��%�cZ
+�&��0�����gۏ�L�Ȓ�b�:��MU�Z
+�_��I=g�^W��YS����
+�{':!�N�X�n���k���O)�E
Q�P�O��2cx�{]<�ߩn\~��/W ֒��޴%X�N@�������fb���oˋ�����~U ���ݬ�|���#"���Y�>����d*
���8���ߍ��("��L�i���a�y���|��~�-���j�� h_�>Ӥ
�j�/Vy5��7��[Wl�i:��
+endstream
+endobj
+3740 0 obj <<
+/Type /Page
+/Contents 3741 0 R
+/Resources 3739 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3668 0 R
+/Annots [ 3735 0 R 3736 0 R 3737 0 R 3738 0 R ]
+>> endobj
+3735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.612 660.661 384.189 673.578]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.679 425.44 395.172 437.919]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.382 200.015 394.782 212.933]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3738 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3742 0 obj <<
+/D [3740 0 R /XYZ 89 770.89 null]
+>> endobj
+3421 0 obj <<
+/D [3740 0 R /XYZ 90 721.073 null]
+>> endobj
+3743 0 obj <<
+/D [3740 0 R /XYZ 90 721.073 null]
+>> endobj
+3744 0 obj <<
+/D [3740 0 R /XYZ 90 634.093 null]
+>> endobj
+3745 0 obj <<
+/D [3740 0 R /XYZ 90 543.343 null]
+>> endobj
+3422 0 obj <<
+/D [3740 0 R /XYZ 90 484.763 null]
+>> endobj
+3746 0 obj <<
+/D [3740 0 R /XYZ 90 480.28 null]
+>> endobj
+3747 0 obj <<
+/D [3740 0 R /XYZ 90 397.594 null]
+>> endobj
+3748 0 obj <<
+/D [3740 0 R /XYZ 90 319.197 null]
+>> endobj
+3423 0 obj <<
+/D [3740 0 R /XYZ 90 272.572 null]
+>> endobj
+3749 0 obj <<
+/D [3740 0 R /XYZ 90 268.089 null]
+>> endobj
+3750 0 obj <<
+/D [3740 0 R /XYZ 90 173.448 null]
+>> endobj
+3739 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3757 0 obj <<
+/Length 3328      
+/Filter /FlateDecode
+>>
+stream
+x��\Yo��
���S+�ٹg�
@s"i
+l�n_���-��+��ͧ�o��P�N:�'������1
=������n�~e�("��zt�4���Ȉ(��f�ƌ9�2J��݄�q����wNǛ�y2K���i�~�������x�L~����W�5��HY �P��/	0�傻aB�
�z
���x��L�� �q��.�,��|�<%��q�~�+#�39�7_���|� ��X.E�
=�n~���fx��f>�E����������B��'��=��B�Q�)J��0A,U9�_��l��f����C�cp����(nR��m�9h�}m��E�Hؚ��ґP��6C�
��
���ҿg�pH� �&���\9�iP�* &2x�+g��no뉤��r1��Ӊ0��U��r}��S	%�A;0 ��TI�6�8մ�)��7����	W���T�h�x*��j�NZ"x��g�z�Z��l��k
�^�]`s*l�_���#�f1a�.\�j������B�#"l�%��,_��F
++��H���D�Z������$gd��-���7�)�������H�]�7�m�-
������p݂6P����w�Έ�����7Y7������n�:$qb�2Ĩ
+P�f�c���:�d����("b�i���t�B�{WBW�8�( 
�%9�i0
+}�w�u�$?
�l�|�á�A0C��*5 �H^�Yb�C7�W�v���Pd� ��M���km:s�
)u+ :�h���f1����XeQr	�-�!&B�]tC��N
Q����y2u9J�"���g�9�0ʻ-,��A�s�٨R�����,�s����>fI)ѐ� �%DS
bަ�bO]=�9�H��r��
)��(���
��w�u��_���2�����*� �V�J%����JK���M�YY�|�����ܿ�.�
&�(�	�ߛ� LU6�'.	U���z:�u����X�ƶ
�T�4�LBk�0`���H|^;�N�8�t�(d�B�b?�4"kcQ�#�m���%����0Y;D�
H����9
i��&�YN��Kc��t[0}.���_ߌ~�
�'��{��S��PM�2��U�aԅ���� 	v�8�K��bh��Cu �<m�"���� +�~��2�@8����\�p����<I�|4v��UxC�
yk�*բ�a�EǓ��U�f���x��a����>�޸�AP���
Q�(�m�HĊm�΅�8E(�\���G*� �9u�Brn�Uɚ����!�SI疏dq��C�
ա�HB�H)l
�~Y1���J2BS��xH�ݼht,��,��Z(��Ŭ�6�ޒ'L�&�q,5f��+x�׽K�=���!���y�r�1	F,b�+7l�7}g�rG��*j�m�IMeT�TQ��\Ja�^�6��

1�.��@~ǥ>0T׊� v
�����6�&
��,���z.�_� i�Ҡ.�x^
Y�S#g��,Qx�!�� �o3�P�~� �ќ�An at lv�s'7���29Xy@>�r�Ѳ���hW�8��@�JTm����D�ݗ�j(ɣfF�p֭ذ���uVG��-ϽB��.���kv����=\��	���|�r�~��W�-�8�j����UM�3�8��ы-��G "5�vG��y�;*Qz�2��Q��Q������c�Q�O��u��(?�
�qvwGM��Oh�>l^ֳΖ��S���p)W�D5L[*PnKT n�&
q�A<�ڡF���}��}��	�o7��E�_GWoʁ
��მ�#6i:�jD�2�'4"5�g7"�z=��iD^�X>�k��B����M�9S!2nRn�Bx�Eo��W���M�	�Tp_:�#��h�HMn�q����"
42���7��\��2
+����~K#~�cŭkgR��Q���4^d���J_-�B���o�F�u� {�<a{'�?�ҡT�����q��s;�K��!�[Ŏ@���u�5g��Q�鯢e�-@(=��7���7�l�s�{���">L���.�7�
Ң���f�J��
����.�#���;\�ߋ�P��-,c�_ݪ��uO��4���".�K"�j�QOw�N����v_0��
n�����qMid����%
,إ ڛxc�4�U����9w� ���T�D.;��0��H�qy�"�����@'
� �p�p8�icU����T� �
b/2-#����K�uZ�� �"��(e�QB���S����6up�lCߒC���7
m��

�
��}μt�i1��0�G�C���ѱ�tt�:����ʬֿy��PbՃ8���{{�����)������Bi[CC�m�F(��0��]lt��<�-�}�ʍ�o
����鶱&=���_VIZdX�BhS˼ŕ����X?���>��.��H��æ�nh��쐝�����B��L Xg�2�+��6�&='���v��&w9���@*>���!�&g�����cvX
5���;�Z
�n%IG
�*j:�IMnnV�"�q�Zm־��;Ѫ.��|(J'8?���|x(�K��V��Ѳ�]M�f����a{�E�8v�&I17�o��
+O3T����2k&
˗bW0��ICƋu�o����`��p1��f��
��|���X+�����CP8G��16 ^1c�#�
wKe@>�c���f����Q�\-�H�����:���:�l~Iŝ>�>������\t_RAu%롊�v�D�t]�0�>������h���� ��!�L�k^T��=�{��t\f6��N��|�#�]hs"�(����.>8C�m��&�ʩ:�1
+[Ct�Q�9�
Q/�r�N���;
�|�z
̣CT�P&�	���U��Ⱦ!��Gf�¨�f����_{ä���I}�����)Dq}�
� ��n�P�mD�!0G
.ل�;��Ⱦ9�
����
+D:mUx���
��>'<4Ge�����S��0�k�:�|�9�Y�j���Y����:P�L�N���������樦=G��g�*���2�E&��i}a
+�zυ)�ӛF������z�
+�(�I��(
�Q*V�Z���Q�����R U�GF���Q��	n�c�Qt�(�ʼn5�Y*��4~���R�
�>k���g�
+�$�g���Y��
f������R�[��y�T�5Jm�V42���s����,�� ����FW��'#��}�?�k���(5.J��뗲E��������1���;pS���}Rnќ���ʧ��x�P���=���.̳l{������.Y?������KD���ߧ�]mʒu��˕��TzU������N.
�g4{���g�e�����oVb��B�
��(P+b
+endstream
+endobj
+3756 0 obj <<
+/Type /Page
+/Contents 3757 0 R
+/Resources 3755 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3767 0 R
+/Annots [ 3751 0 R 3752 0 R 3753 0 R 3754 0 R ]
+>> endobj
+3751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.723 600.778 400.608 613.258]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+3752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 375.354 422.924 390.069]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+3753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 121.877 425.662 136.592]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+3754 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3758 0 obj <<
+/D [3756 0 R /XYZ 89 770.89 null]
+>> endobj
+3759 0 obj <<
+/D [3756 0 R /XYZ 90 718.682 null]
+>> endobj
+3424 0 obj <<
+/D [3756 0 R /XYZ 90 660.102 null]
+>> endobj
+3760 0 obj <<
+/D [3756 0 R /XYZ 90 655.618 null]
+>> endobj
+3761 0 obj <<
+/D [3756 0 R /XYZ 90 572.932 null]
+>> endobj
+3762 0 obj <<
+/D [3756 0 R /XYZ 90 494.536 null]
+>> endobj
+3425 0 obj <<
+/D [3756 0 R /XYZ 90 447.911 null]
+>> endobj
+3763 0 obj <<
+/D [3756 0 R /XYZ 90 443.428 null]
+>> endobj
+3764 0 obj <<
+/D [3756 0 R /XYZ 90 345.744 null]
+>> endobj
+3765 0 obj <<
+/D [3756 0 R /XYZ 90 243.039 null]
+>> endobj
+3426 0 obj <<
+/D [3756 0 R /XYZ 90 194.434 null]
+>> endobj
+3766 0 obj <<
+/D [3756 0 R /XYZ 90 189.951 null]
+>> endobj
+3755 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3775 0 obj <<
+/Length 3466      
+/Filter /FlateDecode
+>>
+stream
+x��[Y��~�_��D�Zaq�8������x'���5EI���EjƓ_�n �$H����<$�F���	��
Ft����7o�
�QLb����~�Q$c�4�-Fnj��/�ߍ�6���������ۯ�����n�������+:b��"���7��<�nD�����vZ�$p]�>����z^�+�
+�x�
Ƭá�	�r1Ab�y?�r�l�uZ��	c���u at 98��[��
̌�993Ms����a�⑎5QT��
+����#�-;�fR��D�s'��d�|LTLsxx%�v�К�<��q�L'S���q�  Kf+�d�Y$U�p7�gw����=~�OJy�l�UReE���SLv�ĎI
+:$���e$a�
�-
#"��H����]:�t���<�]�Oc=~��u�M�b�n��=L�
+��S��ϊ]���c�K'L�$Ӳ<v��8H
XQ���
�"f�
;E4�~
)"�w!�W��:~°��s6�v�ͧ����< �`I���
�dD��OO���ˈ�(.�F
Bs+�H�b��vi�A�U��e��H@���b�.rh1|&z��N�u���t�<O�k���.
|b�>>�}�e�N��� ���k>6E��<�!�3�P��rO��j�Z��~ �nUuÅ���É�����E8�]��U�K	�.��~s�㰯���ʮ�ɸ��[S
,O�o��
+�
O�Ze1R�


�l�"~֡h�3I8ę��6
ݟ63��>�8G╤���e�D�U��MQ�)'1ϩ$��!�	�����
+���NL�g�8�|�y�.����Z��{�
d����D�&�ݳ�{�@�+i�7+
���0
�����G2�������boȮd�U���!o$!XV
��q�(Xѡ�
�h�moޅ
���3����4}�eVF�
+
+���l�d�-�"��Q�f9��
�ZM�VG6A92!��z�M<�@$̪�R8��'�Rn��>;MLu(�(`E�!��l
�}��܌�a�W���F)��_mX��y�� u�TDu

+֘"�d�(��7]o cO��Y��(���g�G�8�w��P=o�<Y#4X<�
D�Gu�?BK4Py�jT�yu�U����勯�>,�Mh`L�񳗆
q
!'@��(�Ơ�{W�R
��pBA�q1Ttr�9�B�,��
+�#��˚��M6���`�H���	���[r�����xLX6�"�ecW/�>k��)��1�QP��1~ҢF�|E�3�[��1�WY���
����U�r4�
��Q>����*�LJ1�<w�c5%��� �4�Ѯjrf��&� �>x4������ J2퀶��=K��4�C�$c����5^��d���1X�*Gf�'-�
`���!���P5|�/��Ā�!��'�i��cbx|Aq�h�!�M <��3 	@25X0�L�`o�u
+pb��
�7�^�	)�f�C���o4��6�}!`>3x�|�����/�^����|1z��ý�Q��Q�p�h�`�C�D띊
!
Q���!�a�2��Ѵ���6ل�G�C��P*�*�SX��um�8����gG�8MI����I��-���CZ�_�X�k�ҡ��Z����%I5.�X�̭	����h���6�҇t{w;��pu�3�4�E�

����<�y
ń�X�4֏��VP����	
AD������S�6��T���#�g�-��O���&�6�+ބ�͉l��cH�F��*���I�Ww�K�
�a1�ش�!��μ<�		�4
+����C0����������
�1��(�9b��	�TM�]�ʗ.�Z�ѐ3�����V�ȟUχ�a`|��
>�WI�j�J���ωTK���
+�&�	�	0�D��L��0}BP��[�?+�U�
�6֤aʍ$��"�&���=�d�"{��d�
y>.�Y�n�ݥ��s���e'�ϫ�SG��׹c���
�)C�V�ە�t��^R}�	��#���8�t�l����k2!
+&\��5����!�_ef�m��)�
I��
�$#$�Ws���_���^�Lp
��L�g_�U��|�����5� /f���u�b��Eg��*&��pX�.�}g�=Z�M�8k��r�
G�P�5$����0
ӊ��
 İ2
�#�uTGn�`�*&���2a�+%��6ބ��&U������[��+��}�
"9���)�F��+t3}�]�v{��ޖ�j��٘�Tf����-d��Kp�,�}�NP�/����3 {
a�v�p�6�����4i�}f�=\�]�L�]|�î�f���}�/
w��EZU=r�º��^bo/�Q�!E~��+�;8E�]-�� ���0��Ͷ\�xv�b"��
�B7 C���˗��,]&XGx�l�*�C��]a��p�G5vs���>���E5�r���:��k����z
��\15C�zh��,�	���̍��S^�5Ĝ��n����p�9�W2�v���EYf�&�Z���6�ӟ�� ����̛
+��/]ƶ��E������KO��
�
+X]��,d�����
&9��T(=�6��0��9�ٷ��pC!jw��&����kp��Q�����9�P��k���Ţ>�y`�p$�w��*���L=�y�Oq�myD�
Q�ޖ�
Bı�b�� (� ��k@�;

�%e�[�z�C�a'���h���� ��=VE�A��t���
�+��a�l�鏖B��V5�{XT��e6_�&ZGgs��|�I���vm��
�r��
|�M�e0F�������a�����Z���uv��ͅ������v�L:���
���ź
ើ��֣��P�g���`�,�Yæc
@'��l�����7���� �
�
��W�Eg[O����4���[�u]l}
p2�ʴ�<�C�����
=Kм�!������Y{,���N�g�Y�׸�i^�qy�μ�@�uܗ{��~�A<d�
�sN�ynpn����ua
�bɯ_�_O@���Aw���
K�m�
����8z�
矃� �N�,��mS����
�ŧO�`�Vi�g��K�&6~nd�=,�������UG�j�����4��m�N�2r3����R��4PTl�"����J$
�H�c"!
bR�X�E2���l�~L���{
+���x>K?��y׏.��I��*bT{Z�ž
��nM�A�w�a����s.��v��M���.�
^��K�Sn��r-�"~ ���w���'܇m�T��fi���<K�y�q�G/R�&ڟrj_���ٿ�\�Z�5(�A������[�$:�s���w�D6Ԇ^)�"n_v��e����۵}U ����M[��k@���A_��2\��F���u�����pv�K�]��B���|F`�8x�-��i�A
o�nX��S�O�d{�uYU�wo��v�<𸇧Wۏcu�m��z�E�.:��݆t��B@��+�m
+endstream
+endobj
+3774 0 obj <<
+/Type /Page
+/Contents 3775 0 R
+/Resources 3773 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3767 0 R
+/Annots [ 3768 0 R 3769 0 R 3770 0 R 3771 0 R 3772 0 R ]
+>> endobj
+3768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 512.16 322.446 523.064]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+3769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 376.234 116.998 387.138]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+3770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 335.038 243.45 348.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.883 167.103 361.886 179.621]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+3772 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3776 0 obj <<
+/D [3774 0 R /XYZ 89 770.89 null]
+>> endobj
+3777 0 obj <<
+/D [3774 0 R /XYZ 90 720.814 null]
+>> endobj
+3778 0 obj <<
+/D [3774 0 R /XYZ 90 618.109 null]
+>> endobj
+3427 0 obj <<
+/D [3774 0 R /XYZ 90 571.484 null]
+>> endobj
+3779 0 obj <<
+/D [3774 0 R /XYZ 90 567 null]
+>> endobj
+3780 0 obj <<
+/D [3774 0 R /XYZ 90 494.137 null]
+>> endobj
+3428 0 obj <<
+/D [3774 0 R /XYZ 90 459.467 null]
+>> endobj
+3781 0 obj <<
+/D [3774 0 R /XYZ 90 454.984 null]
+>> endobj
+3782 0 obj <<
+/D [3774 0 R /XYZ 90 360.343 null]
+>> endobj
+3773 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3789 0 obj <<
+/Length 2602      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�6~���Ӯ
��)�
�d�E�i7m��-��@�[�-y$9���=%Y��Kl�������
�ܾ��`o�a�������w�yiI�w��i�)����m�}��hL0����� ]w�#����y
N���ct������w7�`�>��x�
!
�Ds��J
��S
͠��j�m�
�Մ
�p��l4��0M��r��Ў�>����0����L
	%F�����ˀ���
)ߛ,�>co
+�?z1X�S1i�q��s��
~
�rg�OD�y4�~��|�0�"
�XX�?|���<J�0hK�
+��(�2
K$��k}�n{
��-�=�S��ޝ�
e�ϕJ��%��5$�#
+�le����b]�D(�
�hc�5Y>�������`M�t��p�^�qn���sp1�s���
�^'c
���S��:)�"����y���>ţ�$t=�t���1>�3��Y���9i�Ts&����q�3�0�'E�U9�`K3H�qO��*ȣ�Eh����e��E�� �A�u���R�yɏ�0I���I��~�B�y�
�P��� ���(
�c��z�F��CK���Z�Y�)��]t���ּ�:��'� �1yF
�Y��DJt��,�����?�\o�/b���	�U��J!I�-�������y���tD�v6\�#%H��:�:!��#ʇI4�j�ֽ��=@�C��d�"\�]v+��t��fjc./� �0Ym����!t(�7*)$�����W&�f�tn�,��
+�[�^�*	���'q�RM�`�(��AKi��l4ĕn+ �8�}(����>�P��@�
��c
+����2\"�+(���k�?�Y<Y��
&螛p��0�d~*�?�{�>A �k4������������������2�6��@
hت�c� �������,�.�l�
��yg

@��cqD���w�K��4Y��xf�9P<�^�zS�=0/�t��k�$�4��f���Nymm"TP��>�:H�-�j)T��p2<��

/����� ���
߇z�X�p�L)��{p�%��.
-�2%"�I��E���D�-�Z��$�P��4-���!�
�F�`QY+�a,y��Al���`1KR�e��,�
�;�����!"T�
��d�/���� ����/��8[�����5d�ݵ���:M��Յn
��{���)�7�e��k���P�քo�y�}
z4.�R�CGM��U�D�^Py�rl
+��!ml�<��j�@�A-�m���
2�yƀy0�&�ś�k�M��›tw�M�K��M���\���~����g�M�R�����g�MHe1�>�7�
+�f��U�#�պo�AVJ5��m)=�7���^��SK�
�$�[�9�z� ��n�	��+z��
Zi ���n¼#�$�Xձ��.t�#"�	cNpM�eo:,N�OP_����
:�O�N����W���o���Rs����0��(��0�
~a�~�����K^�#wLJ��IRy�T``�}'�&	��l�����IǺ%xbSV�9`{	<�<��[�s�
k�#p�]b���g/?!� �

�����r�yϓ
��ϳ��;�\�I�8/��<m%��M
+3�H
+� I���������^I2n�о�|_�he�"up+g�tz$�?y�vƖ��|�c��.�F�����W.��D"O%�g����IߊM����A"y�5�d�/㒌�����K~c.�_�K���.;�%���qI*y_\�
��LJ-_@&����`W��)@�,$��I�(
#�W7B�ľ�i�J��Q��X",e&pl��� $�,�Pr���X�L1%�[�C��|��
PID >���~
�x�f�
�j�:6�N�^�BJ�
/v[�򻦀��%q��v�ױ�wFI����@�nn�|��E����� �=�(	^Yl���Ž�`���Z#��=0��"w;�)��|C��U'2)���\�������`�ylQB;���(gއ�S�
��xF�pa�]hO��d[5�t[
+�9���P���7"���'��]b�)����-��
�=�l���>ӈNP�X��&л�7U&Չw۾� ��jnX�6o%�*S�<�L崘�+�$ClS��I,����S���wxw<�H��
��M|�h/�
�
��&
��nqG��YFtGwӈ���H�2·�L�8�Sr���0��A9���ŷ��
�r �E�/�M�C�^�WB�6c�!�V@��ȓ?�YPX�U�np�m��Ð*�
Y-���+z�V���[�S4
�z��"@�v8
AE���<���C�8�ʭS��3�@U���:]�˘3�o�3�}�p�O�z
�dڊà�krB��y�!�y�r�Udb0��{����J��ȭ�V���,��6����u�恉
�)4g�?�z!]e�z��Ԩ�^cO���b��e�~��
�]hݽ{
��c�9F_ 
���[(B��������_Y��u$�}��?�:�5
�
ݥƉv� �JC�v�1�
uV=���W=�4(icQ�zM��y�����_ϲ0�!�m&�X�n�L�.v/���2��e�!QuDSG&H�-w6���\PW�e���\���a9p�Òy���_[~�/�E�Z
+endstream
+endobj
+3788 0 obj <<
+/Type /Page
+/Contents 3789 0 R
+/Resources 3787 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3767 0 R
+/Annots [ 3783 0 R 3784 0 R 3786 0 R ]
+>> endobj
+3783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 253.189 355.512 264.093]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 187.684 362.353 200.018]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3786 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3790 0 obj <<
+/D [3788 0 R /XYZ 89 770.89 null]
+>> endobj
+3791 0 obj <<
+/D [3788 0 R /XYZ 90 718.682 null]
+>> endobj
+3429 0 obj <<
+/D [3788 0 R /XYZ 90 672.057 null]
+>> endobj
+3792 0 obj <<
+/D [3788 0 R /XYZ 90 667.574 null]
+>> endobj
+3793 0 obj <<
+/D [3788 0 R /XYZ 90 596.843 null]
+>> endobj
+3430 0 obj <<
+/D [3788 0 R /XYZ 90 508.26 null]
+>> endobj
+3794 0 obj <<
+/D [3788 0 R /XYZ 90 503.776 null]
+>> endobj
+3795 0 obj <<
+/D [3788 0 R /XYZ 90 423.247 null]
+>> endobj
+3431 0 obj <<
+/D [3788 0 R /XYZ 90 310.355 null]
+>> endobj
+3796 0 obj <<
+/D [3788 0 R /XYZ 90 305.872 null]
+>> endobj
+3797 0 obj <<
+/D [3788 0 R /XYZ 90 237.298 null]
+>> endobj
+3798 0 obj <<
+/D [3788 0 R /XYZ 90 159.3 null]
+>> endobj
+3490 0 obj <<
+/D [3788 0 R /XYZ 90 81.969 null]
+>> endobj
+3799 0 obj <<
+/D [3788 0 R /XYZ 90 77.486 null]
+>> endobj
+3787 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3809 0 obj <<
+/Length 2637      
+/Filter /FlateDecode
+>>
+stream
+x��\Ys��~ׯ�SBV���U�=�ubg)/Y�� 	�P&.ZֿO'	<F���� ����鯯�0�"��=|s��)
__���W,0�H*�����@q���O���	�t���w�#����p�K��ٻ��/g��qR:�Y�}�	�p�;��
<��
�����g��Y��!�)ˆ#����x�G��<�#���{ҾS)$��T��ё������i%�"�Ψѓ�
��1X�j��=A;U��I
֍�
�����!�Va����L�jTEZ��eJ�$�o�����j�뷟/�e�Z8G��]k��ٷ�3�1 ���1�g_..޼Qr��0
�1�	�
�mj4n�(��)$�J�hJ���|.S�o�&�P�W‡�J�%�fY|� 
�����;�'7i��=��`��MIFLɨ�eJ�D3�ף"�T�Э!��v̧�Ɠ����nzE[
� �=�G��jJ�$���R��ԇ�����f
�1���ub
��RZb5Z��e}�+���O�K�Փ���
#L�Ѝ�-҈4��U�8/q{9r����]�
+<f��ӞU��f۫�����E=ę�Q��&͠�M����<w��;ޤ��:���R���\�u��}����,�T
��dYhlyw����(���g����c�䠅��m�q%�J5��-E ��ꬥ�{�`+26$SAJ;�	#\A.��a0�J�<��
ͷ�K��f!!Ej�w��
+�
��+*"H
�@F�%��w��@�F
IH�ߌʖE�7�H�ĉ:t�B��������~{Y�QXf���\�k�/�U*��v�����$c
��q�_I���>܊�ɆG
m� #�o�0A��n�
�1T/`R/��I5����v*���Q���O?����JJVY�L-w�*Jn:��8)��ʬ���r�L�$�TG/f �h�V�%�r$��pQ2��B��b� �DE��VdO@�I	�eX����<<`�/n�@���G�y�� ����w.�H{deۯ�@h��u���NҢ\
-
+p)1I��L
��S��"M�I>%�ԝ����(>�2�
+�8��G�
+�l�	

+�$Y/�+�Ey
��)ť�x��ӟmH��v >��Ե��NT��uV��LJ��p��?�_�?ƷQR�����)�o�y�T�n
���:�
�~�u�y��$
+�,8^bo��Nh�0恀��W��_o��#��
m�`�٩AX��ĿLt�;�L$p$�"�}-��uM4��U��]P�`b�U��Y'�o/.�����<��
��LM�׋(I�s�1�RX �n.�1��T��ڭ�P�Q��ҫ�Uj��c����x	
+}��i׭��z�*�m
����fqbI�0�!܎E)�<��.D4dm��-O�9��k�z�Q>E ������
+���)�i�z
������)�nV�`�K�
^������m^�	kA^�CIq
+/�l�%Xײu�=��0\���
zmٝ�f���z�yXoPp%?c� j	�vi�oD*�5��3O�g���k"h����0��E�n����t;��u�e�6N��%�Qe�/nG����n3���2�6�4(

}����[�G�d�9�������t��;J����7x�6K���-��7Ӯ2�Hq
G���NӢ�m-���^�&:ڼ��`%��t��%
F1��n�o��q��Xy�G�A�
:�~�'M�y
+Md9Ō7���J+�hc�G�D���A4���v!�a8�떧�
����HBKڡ��s�DL
�D��f]��x"ݼ�{ꛜ�9�9����"�
7�Iq�,
�5;�(
+l���
$� ����c^Ð2�;�
�r.� �����E@��Q�f����*i��#�x�S���"�D�i��&��a<��P���!�ƎZA;��|� "����R��z7Y�n����(�F���Sq���>,��r�m+�OT4 �j"LCp��k"�He�-eJ��y]q���
�y���(�KW�{ŬiV*uS�T���;�g}�5?�� ��=k�tC0�=.<v
��������
��H��|㍑��˦�,
�晴g��"��V���7JIQ?�k��K,Z[�2�|�oԾ�v �v�
+��DK��=�v��c��y��[$�%�&����R���h�œ�V�
�iZ�㻭�U�3W.l<�i'�ŕ�%b��r#�鮺�h/�
��A�X�JzD�o�p�B$>�^��#�{OӢp
-��^�[�{�6�/�D.|ҽ�K<��%Н0ýӽ�RUDz啞A�
:j��4r?
�ޖ�6��d�M�h����^�문ލ�V\��B����:;T/�T/�W9X���_ay�`�*n��~�5���O��*p^�OwJ��DS/�1gY�gNx�P��7e�K��z�c����И?M����b
����a�=?[:If_׻�[����������]!a�&�
̃�R���}^|Y�S^8��`���5�f o���9)�C�@��j�n������ɿ�h�� ���߇�:�W���Uū�q:p��ri��g
��eTU	N��k��vV@���ˆ7��C�//�ϯ��Y��#�m������QǍ���>���pbK.-
+��Bsۖ�����!
+endstream
+endobj
+3808 0 obj <<
+/Type /Page
+/Contents 3809 0 R
+/Resources 3807 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3767 0 R
+/Annots [ 3785 0 R 3800 0 R 3801 0 R 3802 0 R 3803 0 R 3804 0 R 3806 0 R ]
+>> endobj
+3785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 661.939 355.512 672.843]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 571.727 362.353 584.061]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 449.35 355.661 460.254]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+3802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 383.845 362.353 396.179]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.008 261.468 276.143 272.372]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+3804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 171.654 362.353 183.988]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3806 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3810 0 obj <<
+/D [3808 0 R /XYZ 89 770.89 null]
+>> endobj
+3811 0 obj <<
+/D [3808 0 R /XYZ 90 646.048 null]
+>> endobj
+3812 0 obj <<
+/D [3808 0 R /XYZ 90 543.343 null]
+>> endobj
+3491 0 obj <<
+/D [3808 0 R /XYZ 90 508.673 null]
+>> endobj
+3813 0 obj <<
+/D [3808 0 R /XYZ 90 504.19 null]
+>> endobj
+3814 0 obj <<
+/D [3808 0 R /XYZ 90 433.459 null]
+>> endobj
+3815 0 obj <<
+/D [3808 0 R /XYZ 90 355.461 null]
+>> endobj
+3492 0 obj <<
+/D [3808 0 R /XYZ 90 320.791 null]
+>> endobj
+3816 0 obj <<
+/D [3808 0 R /XYZ 90 316.308 null]
+>> endobj
+3817 0 obj <<
+/D [3808 0 R /XYZ 90 233.622 null]
+>> endobj
+3818 0 obj <<
+/D [3808 0 R /XYZ 90 143.271 null]
+>> endobj
+3493 0 obj <<
+/D [3808 0 R /XYZ 90 81.969 null]
+>> endobj
+3819 0 obj <<
+/D [3808 0 R /XYZ 90 77.486 null]
+>> endobj
+3807 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3827 0 obj <<
+/Length 2855      
+/Filter /FlateDecode
+>>
+stream
+x��[Ys��~ׯ�SV-�s�$U>�{d�r�ʓץ�HXB-I� hY�>=3 �A��u�����=�ߌ0�br;������p}uu��b���rr�ib�Dq������CD0���G�Gq����M)����]����_қ<�./_��~o��ǫ�_�%�E����0���?$�f��
p�C� �D=�o�(�^�E1�Q����Q��,�2�o~M>%���(Y���LD�2K��������	��H��|u��#�,��ϠF�ܻA�	�
�����]�@�N��t�K��"��t\�l������B�7ʇM��WV`�{���t2�
o4�eJy���>�k�D��7�
iN�d���Z!���V
�
py�����ve\#ʴ��fȺm��[�	�(U�Y�q�%�lJHt��o{80a�F� �
sp Οޮ���Og��h����ǀbK�S
H�Pp�CF��
�5B
�$n��O5)�����z�����@�!�����mΔ7(
���^:EB&�����LK'���o�Jâ=l�譼K
?&��
+P.�
J��yRl����>5��,���
�uϔF �#��3�B�������q�.�f�}��A;�B�S�f�Aq%�}�W�,��zw�P��P~[Eү?\L>��6�g�
�� �&�L�f���`\�H	�/�l���
/P�0�w�k��1h
+�d�0�l��sH��]cHT���ޅy���ߺ
�d
iÇW&�ZkS�祈�1I	��!�0��"��3]��`H
+�(���؇E$E�L
�%R"�>`⥯+^�y�o��t�
+
��նN�aD@j��������
�s�q3
V� ��+��E1�'?�`oT�/��'B+�5����<ٸ
2
�'���03���*]���g���~ �
y�;��.I��I��p�yE$O&����Cq'`=�Ly�������K�L�q>e*�ݮ�u9��CՃ٨��<�A�+*c
�	5$j��@
Jzu�gS*����Ei���)b��Q�H�q3(^/z�@��J
U"q�T�q^�i��S at D���<[m`}�Y&�r3 �9~y8��Bz�����
��LV��ZU)��|��G���AkgKb�bF��#��
 �
�/��y\Tw����O����u�I����;�l�_J��m�w��"J �:�Fr�Ѧ��$z��̿v��ⲙ��
�x��� �ۖ��?�띘0��`)$,,#7�@�K�m��TGii��U�{,�dc�f4���
+7.zb�P� �Q��4a兮��R�M[j��R[�ם��m�'N�0�G6g��O�
��XPE�[$s��A-U�ܑ�ÚMh�oTT$��ϱm
�~W��G�
�fW2��y�\�%) .p����v׶��l�;j+�C�Hvcdb�z�>�y܌M3nt�Bs�
�P)�*)�
H�&h�l��D{oD_�V�A�F�v�&X+¼�C�{l
L{� }d@�]��ǹ��-2�+"A�23k�
+�2��`�`�?†p'b�!r
+ZfFZ����2��1�Le�Jm��cUB at UB�)��8-�$�R�j�!:e��eNM��7������P��P
�6|
8S0�
4I<�B�
>���f�	&̳�� ^��*��?е�>������jx{@9TsM�n0�����z�j9@��޼��M�f���Z,Y�5�	���ӁB��˿��E��w��:��dd�q0!���j��z��q���W�ZVt��TBpv�)�9���1��Y�ܧ���E��5�s_B:6���2 at +�^,��]9���%�2U~��dƱm$d0�{��.����L�b^X旝�x�U\�u���Ä�Q��6��D���7B4�����@�St��]Ć��"�LR�s:�y
��f�ij!�7Ma��:lz1N	Q+�-
�Q�'+��3������#��
}er
��)0�����|���yl�;x���:-��ڧpU�ۢvT�!X�
W�N�w�G���\��2v ����Ʀ�r�5Ѡ�~��xJ�߁�ݶ]���S��,.�}���K[�(
��b'^�'W$+S2*}Ydo�jtSw�'��i|�L��f+�>x���vuSun
�b{p�H�;e������m�m;�q
+.({��
����™�
��C
��i�ߧ�]
_
3ݪ�B��2�
+�2�߭���
+�9%��j���`�¨
3��L�qh0�
+I5��T��
"�.�P(u�f�w��W-��+O��}+��֮m�jD9�m������aA�v�9�]+.�ZQ�Ǫ�1���G6�v���]�]��d�y|O	���{�onO��F?ᔌ9���9�*���c��'�W�/���>�e ���[���a*Et�ܓ��pb �X�q��94���� �&<ij�s��L
:��r�C�Q���4X��i����$i��L��Opi��b���-ۊ��fm
+���5�/�G�X�
��@�`�
+RV��>����fL
+���3��<U>݊o�v��C�̈́��r��A����PA��sz��\{�T���Ȃ� ���~O��V�xDU�)�I��$��l�"���9�1��X�1�_�
+�500kw��`#�9�St���gfTd�BXF�G �g2ы"\��C�O��a�
���=.=�ݐٱ"#
���X�i�YL��v���#d�!{�u�$mȘ��d�յsP
)�N��ډ!�Jɫ����ѝM�w�~�7�.���S>����q�3l���
������M����=��>�
�3�������K�;v�®L���]Yn._������Aݵ_A�d1�����7��UV�u�v~�6�Q��4��	�����(�3���Ѿw�V/^��b�7(yg�� �AY]
+endstream
+endobj
+3826 0 obj <<
+/Type /Page
+/Contents 3827 0 R
+/Resources 3825 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3767 0 R
+/Annots [ 3805 0 R 3820 0 R 3821 0 R 3822 0 R 3823 0 R 3824 0 R ]
+>> endobj
+3805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.011 673.894 513.996 684.798]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 410.744 276.047 421.648]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+3821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 320.931 362.353 333.265]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 186.598 334.073 197.502]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+3823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 121.094 362.353 133.427]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3824 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3828 0 obj <<
+/D [3826 0 R /XYZ 89 770.89 null]
+>> endobj
+3829 0 obj <<
+/D [3826 0 R /XYZ 90 646.048 null]
+>> endobj
+3830 0 obj <<
+/D [3826 0 R /XYZ 90 592.359 null]
+>> endobj
+3494 0 obj <<
+/D [3826 0 R /XYZ 90 467.854 null]
+>> endobj
+3832 0 obj <<
+/D [3826 0 R /XYZ 90 463.371 null]
+>> endobj
+3833 0 obj <<
+/D [3826 0 R /XYZ 90 382.898 null]
+>> endobj
+3834 0 obj <<
+/D [3826 0 R /XYZ 90 292.547 null]
+>> endobj
+3495 0 obj <<
+/D [3826 0 R /XYZ 90 245.922 null]
+>> endobj
+3835 0 obj <<
+/D [3826 0 R /XYZ 90 241.439 null]
+>> endobj
+3836 0 obj <<
+/D [3826 0 R /XYZ 90 170.708 null]
+>> endobj
+3825 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R /F119 3831 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3843 0 obj <<
+/Length 2882      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸~���SK�D� ��L����nӵ���dh��ؕH��⸿� A�u�Eo�Ӿ�$�s�s�h
�8�������o
"I*��� ������P>�p�c��F$��
���?]������v�������p@
��f���p0���X��{;ip��
�.�q�kY�+��ܚK-aDZ�a�E�X8q�~�%�*ͳ�
+�Cr���`��%T
��n��]A��s�eD��8b��ta6A�=���OҼ�"i�	Gv�&R$�m��So)��03d�9����2�&
���e:��»�*�*��}�����٨
����J�Huh��VJq�(�,�zQ�*��l2���Y��oi{�8EL�G�`��$%ړP��9�"-ݜ� q�L��� 
"�V��y���V���|��nJ�i����:�қe�+K��v�U�u C�(>�S�E�p�2�%,”
��� �ɔ`��*Y��q�8}���J!I�����WH�fB��N�xU��z� ��M����� 
����<�<�SoM��@ �
+�'�~��j����k9=��.�!��Z
��C�'\^.�UZ%�݄Ą@
�,%E�7��m��	�.����U4�Tq��8L�$0c]�Ʉ��KU��

	
uWN5�D�!g°��ezWG�_�����$�A�lgJ!P*E�i������M�Jz��~�)�Nx$��q�b��h<l�P0���7fV�Y��ꡄx0 at V3�d�f�l5L7��X2�JL#��nV것
��Vk�=�ំ���Vt�g�h+
+2D� J���l�fɇN��KgS&�
� X�ro��ZCf&��I�ɔQy517<,�r���`~����1�T��N��w�{����>�'Y��u$���Ф�M�|��<8n���H����̼_���Z�Yc
��i6�=&2�o
` ���ɶ�q�N��M]?eER��/}�r�`��:��\������37��Ii��ǔ�L�*
z��a(jLu+�NF��ڔ@�E� � o ��ޙD�<��0��v�px
� �BR�C��K��)Z4!E��'�m8@@�@R"B[����"��Ĺ2tM_J�j
����7Wތ�:Xwć�)�MH_m|D�#A�1Ǜ�
�s+�[�7�o;
!��t
`
��{�s �
�o�@�11�}�M�ٷ��
Ǽ(P� U*�������%Ű�������tu���:�y�
lJo�U^[l7W����x���l�K�o "��1�ɍMљ
 ��᥻�v<��{P
	(p8aM
v�ɝ%Űɵ�xeP�an[p��=�� 2+<Ȱ��0w�q=��F��g�8��4�Y&n�����F�� �d�Ս'j���	�5�t�%P�N�*�t������wa��[o�_$5����僓�v��ea� ����Zx�j����ߒ,�ª��"K?mS��^OU�~g ��ڈ��d���
+E��ѻ���ظ]�g�i�� }4
�+�"yNW�k�*�-<�J}[���'��;+������1*Ǜ�'t���'G��q{�O��~7�0]�q]�
�G{��UEz�e���e)���9cG:l|�b;�[޶��m
�c}A��#Z��|�¡�2vf�vV��+ at eQW��:�%C�e�h��VA
׺˶��r��
v�GY2�8E�:��X�c�4P��0��k��	T�sg䶏=мfX!&zM�f�>O��m��C-^B�v�
���I(�(X`���j>/4l����|����z!�F�F-��nU�Ä�r��@��&u�[�~L�Qۏ�:�;�!�	6b5<:E[�1E!0��� ���	6�-�h�1�y��h�#E��h�`��ѷ\o��|~�z����
$1�gD�y*��
6� �1�����Wx��*<ߧ��D9�H}van�;
l�?�w����C���`��Odܠ�Z
J��E����+����
W�v����
��R6gl}��
G�7�$���9T���6)�lf��A+
\=s��۽�������"����j�Dѳ\��e�'i�v	1�B~kv-/:
��R
+sc��E���E�t&n�|�
�&|
�
+y���_� XC���Mf��~i*����+@��"��赴t /I�Aʹ5�I?���b/}Z�{����0��:2��&ٷ�N���D�
3(<�OԤ.���ܜok�=�ۖ��(�&���R��tP��A��ޥN��l������0xGw
P�[1[��4!N�*�E��n� 
UN��6�M�����ze]� ~|3��f��# $i�Xo��TA|����^�A�$X�7xn��e���E�
 
g�Tv��J���,'�A���-�{ !S� �>�(��#)���|C���8"z�r�e{r>o���ޏ!��� �Z��麰��_ɬ:�nE�a���`��k `���yRO��!k�X5��Т;��Uy�߈
�� W�����-z$�3C�GE�Dc��� �g
+1
�B<+v|���U�$d�1?�x2�A�H K�/c�(jaGx�Ŏ0h���g
y9ᦏ
ah�
�D�
�[
�#����cxv���ؽ����	�C�ѪD�0��q���y\���J6�����R
l�-�	O5�4�5�a�I)$vB�`�G�����=E
�0	p�.��i��m�mm�ڛ��h�~\I���Wv���|��45�IS��t:EHm?����I#-�h�GG��������R������k�*$\��	2&��̏�{���
x�Êor �%7z�-A��`�$����G=�n�����eR�~"DX'��ř
}�5��(�g�f� �.�Ι2�ë��d���/��nɤ �o?,]T����˛�]�dwh��v����Q��j*�[_�r�����W��s�W� qn'H
+endstream
+endobj
+3842 0 obj <<
+/Type /Page
+/Contents 3843 0 R
+/Resources 3841 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3767 0 R
+/Annots [ 3837 0 R 3838 0 R 3840 0 R ]
+>> endobj
+3837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.224 624.689 256.77 635.593]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+3838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 534.875 362.353 547.209]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+3840 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3844 0 obj <<
+/D [3842 0 R /XYZ 89 770.89 null]
+>> endobj
+3845 0 obj <<
+/D [3842 0 R /XYZ 90 718.682 null]
+>> endobj
+3496 0 obj <<
+/D [3842 0 R /XYZ 90 684.012 null]
+>> endobj
+3846 0 obj <<
+/D [3842 0 R /XYZ 90 679.529 null]
+>> endobj
+3847 0 obj <<
+/D [3842 0 R /XYZ 90 596.843 null]
+>> endobj
+3848 0 obj <<
+/D [3842 0 R /XYZ 90 506.491 null]
+>> endobj
+3497 0 obj <<
+/D [3842 0 R /XYZ 90 471.821 null]
+>> endobj
+3849 0 obj <<
+/D [3842 0 R /XYZ 90 467.338 null]
+>> endobj
+3850 0 obj <<
+/D [3842 0 R /XYZ 90 396.607 null]
+>> endobj
+3498 0 obj <<
+/D [3842 0 R /XYZ 90 276.567 null]
+>> endobj
+3851 0 obj <<
+/D [3842 0 R /XYZ 90 272.084 null]
+>> endobj
+3852 0 obj <<
+/D [3842 0 R /XYZ 90 201.353 null]
+>> endobj
+3499 0 obj <<
+/D [3842 0 R /XYZ 90 77.486 null]
+>> endobj
+3841 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F32 772 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3863 0 obj <<
+/Length 2774      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�~ϯ�Skc�w�AQ����v�ҙt_�C��X][�J�d��{HQ��%��P
�u��
�Crp���Ǜ�
nn?*h�%���*�8P\#!��2�2!��`�'�S�'Q����S�'��e
/�h�s�G����w��?��]<�����GB:b��H�:�R�T5�z��(�<
�Ј0Q7��9	�DE1�Q�A���x��De\=���|J�I�.��LLF��7���R�!�
+�����W
,��OF
�y����
����Ϳn�C�"̭�8�5��L�CB;��z��0(�$�#��VH�A����hkgtW�eWO

��oS�'Y�
2@�B�4<�����S:�>�)wP�auj�

ww�,] ��Cշ3S`dάM֧�M�uc�C�2"Ũg^p��)�L�,�tƥ����r F���R�Y�U0Θ��x0��U�?Ԣ�N��kY/�4�a�j ���c����ݎ%A��Q����b�t�]fU�
(4dm'�9�E���\'E���J�1i�n��_�'�8�~�	������d���k��F2D��`��U����
"!>U�@��t��C9��d�8�~&�j�Q)�/!�
+1A��~
+�{%
�
��z���E�3���cWTu`��Ӷ�
)�N�m;х����2�:�"
��cp@}���/�|֑h��
'#��UGH�ºNIA��@2�וm�ryw��ӧr=��|��2�13P
	
+�1�-ƴ� c�MR�P��Lڞ~�<�R1y�f\M����6��?��g�~�t-�}���B�.��ċ��/�]�p� }�G�i�;1�d�E�E�	����������d��1Sιl
�	�dotڲ�i���{<�@"?-��q{�̳<N�
+�������I��""��&Dž���A|H5��9LA��8��<�f&`�
�8�NY�$��W�8IA��[�a�!�aZ��mXq$��&��������0/
;�z��SEy=n�b�9.Ж?�1�y���ԂQn,R
���5���3,T#
��T[ܦRG:�ͦ�!��+v�"EM
5Z�^CL0��
 �q�7��|�)��
=�俆��+<WlJ�.O}�K��E����ǞL���|�d��� ҂0�\���8�a>�׎ş���Tycyh�
�C�W����:�+���#p����<.vY�Lҧ���]�K ���}�E����
u ����"�i��u�7K�p�6��C��a��
+��e�Ge3� �5��
+=bґ��*�P�a6�f=��N%(ǐ$6�r�����
���QϺ�)��j�ӳ[�PJL52��A�
+�qiV�l]}6Yg���l����$4��9)��N��=��h��WJ����h$5��ř�F�LQ��u�2J�z�O���>Ր�(T�؉���y�
l�@�qs�"�>

!{+ؒ�k�C�>��+|���L�#�h���
�K
+�o��~e�C%�ͻN��q>T�(�1G�&��(��#��D(5B��(������[�������!��"K�>��
����ڪ�]�y>ԑ��J�Bp��)��y�jgd�:uz�L}Xt��e[9� چݗ$�@.�z��
�T�\}�N�w
�u�7ȃ��(Ge�3���M�Pj��fn���t\G�x���u04��]���{���{�B�S���
+�i�B >��8��2�EBƝh�A�%��	��
U�QV��e�N�Ŵ�1�4+
Sњ��4�i�	M�xiWQ��ʵb��4N���]�	���8*밇�N{�xn��f#�"b
�l����m{<��|�����<�)�=B
�-��d�R
c�\�;��I3��3G6ع��ᱹUE@@N�$�
�+(�Z��W�+�W�o���tQ6A�+��,F�BFM�h���ːmg&Ԡ����z��'�k�
�eW

+���$�V�<��@4��!G�VC��
�n=E��@��n7�><�T����d����l��gp
�
��
+>ڀ�H)}�DE��A�vř5Y���m����MY�b�����u�]�[S��N�v�O&�/[
��׊G�hy�)�ȹe�K�:�Ii	W�	��q�mt\9���o$�Nǰ���l���u�p�
���˿��G�u/b.ڟx���=�B�1w��*��  �h�
lLQz�V�Bm"��������g��p��.���d�l��6���7v��l��8m����<��5����>�n��MuLВ�s��,���~%65y1�˗�"[f�(iO����
o@l�T�<.�yZ
���\�|�|��j�{H��T
ܨI�n^�G������]
P���<�	&�
&�t�WW�x�n��*��7�����j����Z���j{
)z)��r"�{' ��26[�i�4���L(i��(	�7<��]�#��]㪜	Fʴ[}a�3n�lߚ
Ms]D���=ƫ,w�+����g�¹�T�C����@&���ߪf��[MϹ��?�*f5���(�ўpI��ιd��t#N�͗!�Q{ZQ������-�
+�#�>|��홙G��|/�WB��nΪ%�8�����~[31�<����j�A%}*��wBp��i�G��T*E��K�3A=M@ K��ݮ
�&
��������q�Gs�)��(��C4�:�o�K"��B�
�縶U5�_�������Y����,ww����'H�Oh�m�vGm��ܷ��&om�W�y�p���
G��AJZ����&ʞ]��{����=�����g r;+�����
+endstream
+endobj
+3862 0 obj <<
+/Type /Page
+/Contents 3863 0 R
+/Resources 3861 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3874 0 R
+/Annots [ 3839 0 R 3853 0 R 3854 0 R 3855 0 R 3856 0 R 3857 0 R 3860 0 R ]
+>> endobj
+3839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.334 673.894 236.659 684.798]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+3853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 618.611 335.755 630.562]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9f66e595842edb48b2ba1089ae78afd4) >>
+>> endobj
+3854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 508.727 243.45 522.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 456.468 485.603 468.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.376 262.379 385.519 273.283]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+3857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 101.087 149.577 108.613]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3860 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3864 0 obj <<
+/D [3862 0 R /XYZ 89 770.89 null]
+>> endobj
+3865 0 obj <<
+/D [3862 0 R /XYZ 90 721.073 null]
+>> endobj
+3866 0 obj <<
+/D [3862 0 R /XYZ 90 655.872 null]
+>> endobj
+3500 0 obj <<
+/D [3862 0 R /XYZ 90 609.246 null]
+>> endobj
+3867 0 obj <<
+/D [3862 0 R /XYZ 90 604.763 null]
+>> endobj
+3868 0 obj <<
+/D [3862 0 R /XYZ 90 534.032 null]
+>> endobj
+3869 0 obj <<
+/D [3862 0 R /XYZ 90 480.343 null]
+>> endobj
+3501 0 obj <<
+/D [3862 0 R /XYZ 90 433.718 null]
+>> endobj
+3870 0 obj <<
+/D [3862 0 R /XYZ 90 429.235 null]
+>> endobj
+3871 0 obj <<
+/D [3862 0 R /XYZ 90 356.372 null]
+>> endobj
+3502 0 obj <<
+/D [3862 0 R /XYZ 90 321.702 null]
+>> endobj
+3872 0 obj <<
+/D [3862 0 R /XYZ 90 317.219 null]
+>> endobj
+3873 0 obj <<
+/D [3862 0 R /XYZ 90 246.488 null]
+>> endobj
+3861 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3884 0 obj <<
+/Length 3468      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~���S*M#,��f2�4�L�4Mwݼl2
Z�me%J!������B��@I����]�$xppp��q���۫�n�^��,�P��4��O2�H�!��_��݌�t����	K"Y
+o������7��x�V?������+�pB,��J�۫w��d��O0b�J>�AۄS����������1�Q���zH��޴+I�2	�
+A�XN�v��Ქ��[�϶���
�i��
��
5[��EY�w�m�}���|�m��(��gs3�7��t,�Q2����4YHX�]�rW�M@����vqѾC%ʽ�Ca�y�D㇒�T��zoG��L����*<k
�EU쫢.ʦX�
����ek���r��f�m�D�Gg�J���ǜ�Y�y*�;�7(���R�D��:2� �vs���e�������RGj][.W�/��H�\�҂"��>�e'��5!��#�N��:.U�ގT��
)�ܨ83���MQ�ҡ$�^?t�hv��1k_�-By�	��4Y�}gBؑ���@���6����A�"�I����<U��V��
+��e�Bp~@��쫄Q��W�
����(G)�Ɲo��T�b��Aaע�@�ۡ7�
0�~�4�Z�����1#%X ����#�"���d��n�r�f-��n����>��u��x�����n
��
Ō�v�^h)��zY��:�ݛz���_�K�SO@�}�\k9,s�A���m������=F�fW
�7t�{�aP;���:6���w.�`�C)�/�X���&o���I�W�/숀�D�wt at +�f�g��A�����A�2֎ ��g�uk����@��O���۷��>�Α��89g�o�����r����u1'd�q��P�
A�ABg'���HFDQ��.'2YM0)K!!H9P�js�z�/�Ȭ
+6�N2���$���j���@� `����<��,���ݦ�7L�R�\�
+2�y�g�GH/����8p�l
'I3�s�mL9R� ��&Y��B��)�WX
qu���Lk�~�r�7�(�/���v���]�x�+W�?��[���
��W���g�ZP ��~�%H���L4#N6?i�+pMQi��C�@��~6�@�,D
�@R�Az4?)A���D0�xv�*N���d����N��pG�%aE�M
�
Y���PcR�Ĩ
��i�֦��

Q�s��
zW�9�~��@[��v|��C򂅏+
+��I���75E�{�gA��D�FJ�8��%U=�vR�^�E\��\t�W>m�����iK
ץ�q�+t�"]���m�0��)�b�Q|�-(H�0��O�:�����e�׉�	W�S�
+�2�c��J�/�O@Ә�q��@!��!I�^���O�-@��TEr�H!�
�H����Y]_Ci��5������'��qŧrm�&])�4�������,5,�1$z,\��c���烋
�b��
�
O�(�T����q0�
#Z�W�h;�����jv��?�N9!��/Ѻq�T�i�nz��� �<���)�|�j&�Шr�k ���71
���-��x�@�H$\d(Ui�@7E��<�U5�b���4�?K���h�x\
Q#�K#0bƴk\j��L�xhВ�=��%W2-
C�o�N���lm}��ܧ����̟j7Қ1�
�8�f
�*����"l2��l�
yo����ܮ7�xk����b�T]��Z1,�N��˵m�Kp�Ŵ��r������O�\��iߪ���
Q�,vP�:%m
�u
�Vݞ<��5�Z���
 -%P���2�	Q=H�an1�H�V�a��
+��d*��ʏÑ9�e�I�`>d׊ғqY	:���G7���Ly�MD��3�l�{àÖ��&d����Xh\ۯ���@w�Z�ҡz����[_�AN����q�	����wy�;R���d q��/�x�9
P�$�
����X�
�}���3]�
�O
+?�
Qo�c�	ֹg="=�b�
+��@��k=Ƈ�D�);?��V!F��
�)[��[0�f'Z��
ie(pSj�VFo�x+�������p}}��|��52�4��8Sh�����KMJ7��v2R?���A�Y8m����X��#���$MC���F}��=`1Pg�2%2��`�i6l���Ա.$ST�g4X�oX��:�*o��o0�K���k�B�n
������\@̯O7��x�(���CJ&5��ѡ�(��Ojt0}΁M�阜�)�!с,f�NA�0�n��9!�d�9���x�b�/
�\M�
ͮ~!}�
�W��ߠ��_�2����Z��\,�qm�\�)�wj�F��<����/ Ȳ ��pz�S��2>���q��S7'3ws�y=0��
,�1
6�7��h�^��l�����j-u�>�����
�zV��b	�j��H$�P�/���N
� �'��P�6��S�	hZˆ�MR�|}m��(^�>
e�{�t}�	�����^��
 ^�4AQ��x��e����}�C���Z���n��bO+(����*(����R�`:
�t�(�&�+��f���Ƒ�����.oX�g4�q�����r�����Rp1;u"%is��KP�hå��h\�����#�-_��e���_lb�N(
+��u��ӌb�D	��~E�M�i�{@�B�$�2�<
+�2�%y8K��!f=�pA����\���@p: �������	�}ti��ƱoP5�\$v|��o�k��ܭ��[$�����j�s)��E~x���>��q�}�Z8��eö=<�,��ֳ�
��݃<׍��?<+~��������D`F��M6�+!Hx�j\a(��Y{��̝,
+wfJ/%�%��@�1OJ���+$
p�P�ga��:�H
��x$Љ
c�Y S^Njy[O�"����:=�j<M>��3"��PvH4y��Qv�)QvE�>���@م��
�1���)޲8oߕ�[(���714<��A)�!W�/C�!���!k;ɥE�cnVK]�9�
+�:;Չ ':�}��-h�B|�w����r�
n� �4��۞4~�&���'
r��̩ȌO2��HC�p��IգD�` Sp at I
+yv�@~W7U�l"��2,SL,t7G�3�ͮ2_ɱ/J����S��v�_��x�B�w�)�5ubN�a'�+�������x�O�	r��3
I�WM��,�
dz܏P��:�0
�Gsޱ
7ҵ�n��b�
+��L�%3c��&�@2��x�.7P��z�)�O at 1
���82�Q���������깒����uTPy�����;��Չ>n"�(���VCP.�P��s�����LM��;��HI����yؾ�n��n˒�w@̓[ ��'��
+n��������
��~��^��.��̅�9i�+/m�
��{��w�?�B�W�Ҋ�0��E��Y��w��Ӟ�����{cyl����WwOuQ>��n{����,��?�m��n��3Y!���l����	T
+endstream
+endobj
+3883 0 obj <<
+/Type /Page
+/Contents 3884 0 R
+/Resources 3882 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3874 0 R
+/Annots [ 3858 0 R 3859 0 R 3875 0 R 3876 0 R 3877 0 R 3878 0 R 3879 0 R 3892 0 R 3880 0 R 3881 0 R ]
+>> endobj
+3858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.847 709.04 191.42 716.566]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.164 709.04 266.737 716.566]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 630.865 239.856 641.769]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+3876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 443.148 379.76 455.481]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape_a9f66e595842edb48b2ba1089ae78afd4) >>
+>> endobj
+3877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 401.05 182.164 411.954]
+/A << /S /GoTo /D (index_expand_space_dimension) >>
+>> endobj
+3878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 303.684 243.45 317.632]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 227.116 535.938 239.634]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 213.731 226.824 226.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 158.792 362.844 169.86]
+/A << /S /GoTo /D (index_fold_space_dimensions) >>
+>> endobj
+3881 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3885 0 obj <<
+/D [3883 0 R /XYZ 89 770.89 null]
+>> endobj
+3503 0 obj <<
+/D [3883 0 R /XYZ 244.439 634.018 null]
+>> endobj
+3886 0 obj <<
+/D [3883 0 R /XYZ 90 627.378 null]
+>> endobj
+3887 0 obj <<
+/D [3883 0 R /XYZ 90 558.804 null]
+>> endobj
+3888 0 obj <<
+/D [3883 0 R /XYZ 90 492.762 null]
+>> endobj
+3504 0 obj <<
+/D [3883 0 R /XYZ 400.69 404.203 null]
+>> endobj
+3889 0 obj <<
+/D [3883 0 R /XYZ 90 397.563 null]
+>> endobj
+3890 0 obj <<
+/D [3883 0 R /XYZ 90 328.989 null]
+>> endobj
+3891 0 obj <<
+/D [3883 0 R /XYZ 90 250.991 null]
+>> endobj
+3505 0 obj <<
+/D [3883 0 R /XYZ 487.765 161.945 null]
+>> endobj
+3893 0 obj <<
+/D [3883 0 R /XYZ 90 155.305 null]
+>> endobj
+3882 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F91 766 0 R /F118 2438 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3908 0 obj <<
+/Length 2139      
+/Filter /FlateDecode
+>>
+stream
+x��Z�o������H��D�}��&r�^�4A]���

ZZ[D$R!����w��%WZ���W4A��\��3�3�y�q��诣�ף��	�2��4���
G	ϐ��i
݌	Fb2%����q^����	��j�]�y���X��y�=?����`v{!�x�1�孜L���e�4fz%�e=!�X�3�)s<&4�|��a���/#��VJ�h��|��
��0bY=�V�
�e�n���R�Q��j��fd k�!�=JC7�d
d�W�U\�q��ڣ
�a�W��mO2�"��Q�b�m@�D$ˢ8����Ux��L�
�F�|�m�R$H�b�3j�ݴU=a�X5R�),>����c��
n��^����	�|iV��Y��E�`���c��]����>)�,��2c-�7�
R��gy�4I�_�؞A�K*�1�I�9�ሁa[
j�j�T��<{K��&	�i
+���6ox��p�B�]��
����� Aҽ�m� p�i����(FE	cZ��8�Q���Sپr� 4���Pk��@��,s|�~s�n��C*�
��
S�'aHI	�1;�#O��狼Y�+��dqF^BIL ���f�ܞ�{,�d��fĬͪ��(���
�(�E)?x�`T��%��4�z�_^�vS�6��f`tzWX��*�3�'��5GԃP ���T��N?ug�.�Ƽ�qJ!乃׸M� pV0*G������"0�
P�Ŏ˼�h ֥Iҽ�}�H���ff��.�Щ	:�鏓i
���7f
��Jc'�W
qY�S�q\D��nթ)�2�mxa��d����E�!P��8��
&0!��{��(�օ,獱�����J*�o7�-��<��f��,�\/yI��
+,MA
��#r@3�S�@g!��t�>;pj���y�Z�+C�����s8o�
X��:���t��.��4��� 
�
 (q��|�θw�!Z1�4�>��)�gO�~B�)~�����LE�T@��s��yb��x z��xB�����q���!��l����3
!,Fb
�]�T>�r
�0��1��nt�
�\ײq��ת���؞.|��(�
�U!�"�o�ѿ9��a���|�� A0��V�G����"�-Ԉ���S��h�, E�5ӵ�%���!� E=,ԛ�
�m&,�C�0��o�N8i at X8ؐ�'�#�
+P�)r�� �dS�|�UY���:tʸ���l N3�Уv�:���Ҟ�2B� �Ȥܚ��3����GԏE#!BP��giT�h�j2
`QǢ��r
ų�0�x�5�6�~qBl����������;/��0��-���䳰�4��f���f
d)~v_W+��vĖ�J!УkY(�X�s�g��s�
+P�����
+���� �[��h�8���$���#�d��>���:P� *
�4}�cu C"M���jJ
g�h����`�Ru�L�2P�c�	/��@���/�Lӱ��H��#�e�H��j���B
$
{�Z ��U����I�Kwj�Y:��^a�L
 e�q
+U����~�������$��\��R�
��I��T���f
�-� m�my����;�
�����b.��J�_��S����^'�yp"��.
�b3k�/���koW�
ݫ�VkUn�{��n
+,�\x
Wh
A�Y4��끶]
�tz��O��?_� ���a ��W���,wY̌!�$Ww�܇U���6�I���}�Ω`�{���7�>�,[�m�+uA�v��u��
?��.�8ly�.;y�^|��lT����J"�4��RO6;`s �����6��Av��p�BT
���9��)�
����a�J���9�{Q���C��駪� �f8P3y����� 1T�:�K��ڈ��:z� �V����S
{�g(ދ���}s�U�oC���3T�Rq��e�6B:���K��K
9�q�
��͆
�Ǣ]�����(c
k���JG�����7�|kؽ��)����F�����O��vk�����_���T���I?�妿���&9�&��k��cG&����������G:�
��`���ɢm��ggw��F��u�5�@���%ܡ���wQ��J���+o�M7&(�i�
P�/��a���s�c��]8�~Ţ7(��Y�/]^:)
+endstream
+endobj
+3907 0 obj <<
+/Type /Page
+/Contents 3908 0 R
+/Resources 3906 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3874 0 R
+/Annots [ 3894 0 R 3895 0 R 3896 0 R 3897 0 R 3898 0 R 3899 0 R 3900 0 R 3901 0 R 3902 0 R 3903 0 R 3904 0 R 3905 0 R ]
+>> endobj
+3894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 287.763 177.053 298.667]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) >>
+>> endobj
+3895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 220.968 198.921 231.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a67b4e0eba7692bced073431cd3cc22ae) >>
+>> endobj
+3896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 194.516 198.921 205.42]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a5ebec8f5ff32009c4cf98dead90f4a3c) >>
+>> endobj
+3897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.258 194.516 274.188 205.42]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+3898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 168.437 198.921 179.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_af2ec3c62388f9aef1414a527e82cd1a7) >>
+>> endobj
+3899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.258 168.437 311.268 179.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+3900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 142.733 206.669 153.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a97b2101d371edae52746a53cf34e4b67) >>
+>> endobj
+3901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 116.281 163.215 127.185]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a35ea0c10995c89f8a11a2e8bb5dc7f17) >>
+>> endobj
+3902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.552 116.281 275.562 127.185]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+3903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 90.202 163.215 101.106]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a6ab41afc79135511037718442fcad4d4) >>
+>> endobj
+3904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.552 90.202 238.482 101.106]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+3905 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3909 0 obj <<
+/D [3907 0 R /XYZ 89 770.89 null]
+>> endobj
+3910 0 obj <<
+/D [3907 0 R /XYZ 90 720.814 null]
+>> endobj
+3169 0 obj <<
+/D [3907 0 R /XYZ 90 690.686 null]
+>> endobj
+3911 0 obj <<
+/D [3907 0 R /XYZ 90 686.203 null]
+>> endobj
+3912 0 obj <<
+/D [3907 0 R /XYZ 90 613.56 null]
+>> endobj
+3522 0 obj <<
+/D [3907 0 R /XYZ 90 590.561 null]
+>> endobj
+3913 0 obj <<
+/D [3907 0 R /XYZ 90 590.561 null]
+>> endobj
+3914 0 obj <<
+/D [3907 0 R /XYZ 90 490.883 null]
+>> endobj
+1210 0 obj <<
+/D [3907 0 R /XYZ 90 412.9 null]
+>> endobj
+154 0 obj <<
+/D [3907 0 R /XYZ 90 403.483 null]
+>> endobj
+3915 0 obj <<
+/D [3907 0 R /XYZ 90 305.764 null]
+>> endobj
+3916 0 obj <<
+/D [3907 0 R /XYZ 90 238.679 null]
+>> endobj
+3917 0 obj <<
+/D [3907 0 R /XYZ 90 238.679 null]
+>> endobj
+3918 0 obj <<
+/D [3907 0 R /XYZ 90 210.867 null]
+>> endobj
+3919 0 obj <<
+/D [3907 0 R /XYZ 90 184.789 null]
+>> endobj
+3920 0 obj <<
+/D [3907 0 R /XYZ 90 158.71 null]
+>> endobj
+3921 0 obj <<
+/D [3907 0 R /XYZ 90 106.553 null]
+>> endobj
+3906 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3929 0 obj <<
+/Length 1756      
+/Filter /FlateDecode
+>>
+stream
+x��XY��6~��P�����S�A�n�&i���}iZ����p$����

�u��u
�L����#�������j>�x
2/BQ@o��"�<B"�����'TN?�_y,��D�2�O޽�?{;��&��/C�#V�@�����'�-������wg&e
�
�S����	v�`D�n�?�YD��q�a$������8I�r:�T�W�(�m��ѯ���y�;�7���[����
XƱ���_�S"���͠*��#�t׮kU��Q7�^����m�%K�'��~[U�5,�Gư�	Q ���=��
��W�/.��2�ү
ۓ�U
�ub5�� 4�^X���*�LM����+?���Ɉ�6V��J�;9���Ws��=A�p[�J+n
��*+U۞e��I�z.�� BfE�3!�ܶo
ؠ'�p0�B
��a���g�b��!A">
	=�ͦ�l���͵N�#k�(��]Ro쌸�1��ur��fBci��#80�_�vh�6�]�Z�G�� [...]
+��}btK]��M��Q��̫#0M�_�4���ѺF���Qc3b�{v�F�Q����+���� �I 8�I
z"�j���*8��ml�0�{ƈ�T����D�8v�z�TԠ⸵ERٍ�,NS�V�8d���.N]o����X�
+���F$�p�`�=��B����V�j� 5M�&��
��1����*�7l�dxu�x�#J�s"��ʚB>D	�
?yd�sW�h`���W��=�L�Te;~�I4Y�M�v� �YƦ
�
Ѕ��I�i�[����2�ډk�1f&�#��
�*���I>|���0��U��&Bi\��a��� ҡ��rDbU�@�U����m�i+���zd8wN���6V(Cn$��o�)�l�1k/j���
+H�Ȟ;�7��
����c@;
N�I��
Ge���d
�� ��|����Yt�8@���}�}�4 ���y4����&��mh�nмQ�iװ�SŖDVl�'���>���bh90�R҄��z�{Ck���T��Ii<�c
HWA��z<@�A�}��t�T
�"Ca�B���z�u�9L ���({������8�5_���o���
���\c���
��ρkZoH�W��9thp���W��Y4q��Ӥŵ�֌2�����
��@ɲ��BJ��9�����=��Z���͔��`D��Z[RՇ��4���A�����<	9��Al�M��� ��
���T߾���G=�"h~
+7�^A��+5J��uB
�3��i9�`s���B
"�7�/�b�����N�
6k\��ˌyO
�7y��@��c	'
+����b�f�~	��~m�T��N��9����b�_#�+Z�V
+�Rp�� �98��jb����U����EG�n]�M�M]o//.nw�J�k�8h������
̬(ݡ�
:3S��Ё-��Q
+endstream
+endobj
+3928 0 obj <<
+/Type /Page
+/Contents 3929 0 R
+/Resources 3927 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3874 0 R
+/Annots [ 3923 0 R 3926 0 R ]
+>> endobj
+3923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 593.68 191.727 604.584]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+3926 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3930 0 obj <<
+/D [3928 0 R /XYZ 89 770.89 null]
+>> endobj
+3931 0 obj <<
+/D [3928 0 R /XYZ 90 721.073 null]
+>> endobj
+3932 0 obj <<
+/D [3928 0 R /XYZ 90 574.98 null]
+>> endobj
+3922 0 obj <<
+/D [3928 0 R /XYZ 90 551.578 null]
+>> endobj
+3933 0 obj <<
+/D [3928 0 R /XYZ 90 551.578 null]
+>> endobj
+1733 0 obj <<
+/D [3928 0 R /XYZ 90 351.845 null]
+>> endobj
+158 0 obj <<
+/D [3928 0 R /XYZ 90 342.397 null]
+>> endobj
+3934 0 obj <<
+/D [3928 0 R /XYZ 90 260.708 null]
+>> endobj
+1734 0 obj <<
+/D [3928 0 R /XYZ 90 161.341 null]
+>> endobj
+162 0 obj <<
+/D [3928 0 R /XYZ 90 151.893 null]
+>> endobj
+3927 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F118 2438 0 R /F24 537 0 R /F8 802 0 R /F75 562 0 R /F11 621 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3963 0 obj <<
+/Length 2103      
+/Filter /FlateDecode
+>>
+stream
+x��Zm��6��_!��
�\��"\��H_�m��KR�L��ɒ+ɻ���7��e�%{�m8�eUg�y�z��v�����lt�V0G!�Qϙ�
�
�*�=��t>�	Fr2%���౟n����q=l�2��?���O^�|�|��>���-!-�����
�Y���t�Eh����oV(<��g�q�S��#?�&S��x6Qt�����uq�^�tB�X��R��1��
}7�1"`;��GB:�v��w�,��FLI��>�u\��3r>�~�2��
7��
�"�0�`�����b"�Q�T���8h���� �8�����ϛ�
���L:�"��?S�{��r��9��
�:��T�z�ݗ]��
V��z{�e�E��N�~�����G>c��_R$!�=�G6�\G¦ 5&�y.u��#�KX~��>���-�~��¥��p����F�)�o\�>�nwV�<�Z�x
)�*@}ƘU�$��\�aQ=�o¬x���8��A�=�8��E�3�ev$�e��!<����� [...]
1��Z�|�x�D�*���*���9"�+��Fz��7~��g��+"p�D��q��2>L��W��	�a�$�.��� cD]2¡���� ���@����s���B�u�k`��d⩨���z�nJ�ƅ]1�㵪������0�ˢ߽�Y�������*pkJ]Ą(����!.C���h
�S��a�c�
of�[ԑ1�
C�� p��!��
+�i>�<�%@L�VV
��	�p8���HIUːC�A98)<kʃ'
�1at��]��\Pe׻�
JXt\(ģ	��FC��CG��8��#�+P]?޷uKwa�� Qu��!���ʯ���z�
�{��
e�)i��R�\u�z�M0����[i�������ثJI*��Y���w�(�%_�I�yof��&J�E�o�TI�N2K5�ꉀ��;��p��-�=��F�%Kd}��~�e�c�i��*M�=�]%Q�L(��rH�F�e��k�����
+�@��1--(��� 
T
�eG	� ��@�.��`|:�]`I)��r�p ru�-Q��K�!���
��w}�RHb�QΡ��_�a�멽G}�`� *yH�Ǭ�n�~6qek�;0��ܧS;��

`1]�]��,�'��� ��O��|���r ʒi��P%�7>�n��:��i
iT�ռ�t����A�_5Zΐh"�퀭Nl��{��=�:�1�V]BK����6�����e���4ڈ��9��C�~zg�ď���Aw�b�)��$`k-?*Yn���7(jC�=�[$_.QvLA=�
�Ӟct�:����Y�b���1���7`<���hp(,�OxܑNP�9�2�� ���*��m?�����ِ�'�d�� ��t` ����1SI[���w�L1\��\�l���x����
�B��G��γ�2�Aẅ�i0�L�Y��9�`�n����*���/�$:��K�ӹ��Sg��A0=<l�_`Z鐹o�X����Rq���W�w�&�
+�l���2��`�q���P�

��$?�
�l�et�1��m&M;2_:J�'�5��@N�fo��@N2Y��
+��
:��aM��� pr�
��އY���
	��M
��~p�c�y�=���lf�NYC��D؃�O�^���m
+9`�6��9F He�� �#O�d����y3g�A���-a���R��^�������I��U|�>`]>p���<!��K�Kl�/3��i�_C
+T]@
+��G��;O
+T�
H�	DI
+�)Pq��N M���W���_*�<�A��?>d��^�eP���	�Of�������i�*N��a��
5
�� ��?Aucɟ9a�0���r�禮�㪙�.r�|�LR�u�
���h�ͯ-��G��W
�=e��U�=I�(�zv\����S��۟��_3����X�ɟ�x_�U��;�i�f�y3Ad�ji6�
�c�*uQ8�/���qd�ZP����������b��t�FA�=�hk/FU�ɯϽ�IZO�psk��Qu>[Œc�<�Vр��1€
ae;�Ӻ���z��q�n˜7	����  ��
+endstream
+endobj
+3962 0 obj <<
+/Type /Page
+/Contents 3963 0 R
+/Resources 3961 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3874 0 R
+/Annots [ 3924 0 R 3925 0 R 3935 0 R 3936 0 R 3937 0 R 3938 0 R 3939 0 R 3940 0 R 3941 0 R 3942 0 R 3943 0 R 3944 0 R 3945 0 R 3946 0 R 3947 0 R 3948 0 R 3949 0 R 3950 0 R 3951 0 R 3952 0 R 3953 0 R 3954 0 R 3955 0 R 3956 0 R 3957 0 R 3960 0 R ]
+>> endobj
+3924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.202 225.481 696.106]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a3bb2c0ddb1b766959ee6149bb52a7e61) >>
+>> endobj
+3925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.979 685.202 291.602 696.106]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a35b06cfa8331827b55846da95b222287) >>
+>> endobj
+3935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 657.183 224.644 668.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+3936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.378 645.228 230.03 656.132]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common_aa26b7ac0a5822f668664afb29033b4e0) >>
+>> endobj
+3937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 617.208 224.644 628.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+3938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.378 605.253 235.569 616.157]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a5621564b142adc0eaee14971b379084c) >>
+>> endobj
+3939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.367 334.462 219.683 345.366]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_acbf26ad2a67dbfbd24eb9c89448a793b) >>
+>> endobj
+3940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.762 264.367 216.096 275.271]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_adba7125dc65aecea57c44c18767a7d6d) >>
+>> endobj
+3941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.912 264.367 255.099 275.271]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 236.721 182.144 247.251]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af76b83d6dc4342096be7f3eeff5813f5) >>
+>> endobj
+3943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.959 236.721 221.147 247.251]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 208.702 206.692 219.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7deecc429c0f5b6c5045f8384e4da34c) >>
+>> endobj
+3945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.508 208.702 245.695 219.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.249 208.702 309.266 219.232]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.478 208.702 373.495 219.232]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 169.35 206.941 180.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a897010fa370130e9d22b4e373ad2ada3) >>
+>> endobj
+3949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.757 169.35 245.944 180.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+3950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.498 169.35 309.515 180.254]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.727 169.35 373.744 180.254]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+3952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 130.372 191.737 141.276]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.236 130.372 237.396 141.276]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7f13a5487370bd6131906660ec918e40) >>
+>> endobj
+3954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.352 191.737 113.256]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+3955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.236 102.352 284.996 113.256]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3997abcdd433134571a7f47430cb56a2) >>
+>> endobj
+3956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 198.363 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.861 74.333 250.646 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3e9c71d9592c8ea126bb0eb538159e17) >>
+>> endobj
+3960 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3964 0 obj <<
+/D [3962 0 R /XYZ 89 770.89 null]
+>> endobj
+3965 0 obj <<
+/D [3962 0 R /XYZ 90 704.258 null]
+>> endobj
+3966 0 obj <<
+/D [3962 0 R /XYZ 90 704.258 null]
+>> endobj
+3967 0 obj <<
+/D [3962 0 R /XYZ 90 674.505 null]
+>> endobj
+3968 0 obj <<
+/D [3962 0 R /XYZ 90 634.53 null]
+>> endobj
+3969 0 obj <<
+/D [3962 0 R /XYZ 90 576.857 null]
+>> endobj
+3970 0 obj <<
+/D [3962 0 R /XYZ 90 527.775 null]
+>> endobj
+780 0 obj <<
+/D [3962 0 R /XYZ 90 458.843 null]
+>> endobj
+166 0 obj <<
+/D [3962 0 R /XYZ 90 452.165 null]
+>> endobj
+3971 0 obj <<
+/D [3962 0 R /XYZ 90 351.52 null]
+>> endobj
+3972 0 obj <<
+/D [3962 0 R /XYZ 90 351.52 null]
+>> endobj
+3973 0 obj <<
+/D [3962 0 R /XYZ 90 283.423 null]
+>> endobj
+3974 0 obj <<
+/D [3962 0 R /XYZ 90 147.693 null]
+>> endobj
+3975 0 obj <<
+/D [3962 0 R /XYZ 90 119.674 null]
+>> endobj
+3976 0 obj <<
+/D [3962 0 R /XYZ 90 91.655 null]
+>> endobj
+3961 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F22 2982 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4045 0 obj <<
+/Length 2078      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�F����O�4��`92mg����Z�I;
Fk��8
+ȉ���
	I�V$�
�
�=޾�;~o�����
;�?�L1��QM>(&Vt�D\��Fʧ.a�����4S�^�������p���\;u��
+��H7��|�+#x�N�����9k�)*ep�*��O
,eY�f���b�l���F����� Br9�D2���ק
w����Dx�}�_��G3�;�h�QO����ى�ӕ������*R))��;�,oE`����4�J6J&n�7��N	��,�Lm�BaV��@�R�V��"ݤrnJy�S��h,�~���|�s����J�A����R}x��z��bd-�j��l�;�~I��8Y��XU]i*�E�`�z�J9��%%
�����F5�S��Ds+�X�<�L�ĞZ���[���X&ѫ$�H��;�ϯ�X5hˎ�����B����y�XC�j

]�%�a�=»_�/�#�پ�#�;N�l��~�
�z
�iK|��
η�+�t��Q����&v<�;G����ݤW�QL3��<Q��!�r];�k
��R��=
+��6�ގ
׵F3/�Z�繘�Fni�IФ-�"���8�~�(jP�H+uoK�z38���o�
ӻ"�/����_��*���T~�@� E^Jr43�q	[2���H7�OGZE-���y�I
�[��N��Dү

o�9�&"�"w�p����l#&�c�(0�K�[`��Ҥ�PDvR�t}Q|�0+-��ofe1�[:74Ʀ�O�Eb	/L����۳X,����K�����|���y���9(#a�U�ˊ�.͑S,���V��� MpX($`�\@j���tc)›8vǾs���v(��/�Յ(zm��4�1��ܕў�� �����cn�$X��g�U���ï6[�E��X���r*R�4
��돾[/���W�\�
.��vw�>Rw���;
Չ��wE�r�XZ
+@�l1���0�8�
���Esh;�]��m[RP
����(��5�O�=-u��}�/����̭�
7�@N����\��o>ܾ���j�q���daa��vQ�8A8_�e�5!�w� V�IG��I�	��Ve,0�)xF
��˫vT�:�J
2y,��!^�a���v&o�$#�j�K��:�y�L�߯A`�^`�� ��|����,�0�FW��$F�\�ҒkC��y}�
CU���l� Rķƺ!=�}iē�j~�si��[&�u����Z�X�M

+��%��� �
'��rڴy[DF'�s*s�C�to9�4�‚�����^
k��%.NMN���Pk�/
�-�{'�Tesg*�+?�5�(j��ׂ8g�H��-�M������гQ6嬚8�os�D�@
��˷L}�c��]�
����Ç�ݙ3
� f��"�9��'����	Ҫ��g�M1G�Џ���2�6x#�9V�h'��3ЭK?F]0l���Pٮ��ΐ����l��ft�.���^�vX"��;T��R��\���0 �-���'���V��v� (�u%p{����͇�7�eA�Ͼ� e��\j]~�b���d<�e������b�A`^��*������2�q1�9��?��P[����7Nb���z�{��0�-��
�ٿL�ŽF8	�d�{�-�
��4�*\K� �������5���p/PR~<��(�I�j@�|�>��(_�>w�D~L�1��1����ζ�
#��ɪ��
T�8/�-�<�(��O8=RQ��UK�( |�n%M��K%��b��q���Ȭ/��^�c��H���nxy� 
+a:�q;����I~�����mVrF�kO�s�N�f�Y�Q 7�Ƭ�9�զ욬�X��/H�
����Vh���βs�͙�U��'�p���t�x�N�ZfwJ1�T����Րdu��~Y��Q�7�O���PD϶e�g�>{Y�N�<�\0X5\��Wf�i�i�#��l�s�"P�޾�o~�E�Mz�.C�۟4#5��T�"����H	#U����(�e.۟��?�鼶1�U弓$	_����Ʊ���]� 
j@T���D减�0?�@� ��W%
+endstream
+endobj
+4044 0 obj <<
+/Type /Page
+/Contents 4045 0 R
+/Resources 4043 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3874 0 R
+/Annots [ 3958 0 R 3959 0 R 3981 0 R 3982 0 R 3983 0 R 3984 0 R 3985 0 R 3986 0 R 3987 0 R 3988 0 R 3989 0 R 3990 0 R 3991 0 R 3992 0 R 3993 0 R 3994 0 R 3995 0 R 3996 0 R 3997 0 R 3998 0 R 3999 0 R 4000 0 R 4001 0 R 4002 0 R 4003 0 R 4004 0 R 4005 0 R 4006 0 R 4007 0 R 4008 0 R 4009 0 R 4010 0 R 4011 0 R 4012 0 R 4013 0 R 4014 0 R 4015 0 R 4016 0 R 4017 0 R 4018 0 R 4019 0 R 4020 0 R 4054 0 R 4021 0 R 4022 0 R 4023 0 R 4024 0 R 4055 0 R 4025 0 R 4026 0 R 4027 0 R 4028 0 R 4029 0 R 4030  [...]
+>> endobj
+3958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.165 198.363 706.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+3959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.861 695.165 298.247 706.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac2b7fcab5dcf39429fd6f646dac8c00c) >>
+>> endobj
+3981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.589 191.718 678.493]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+3982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 667.589 288.852 678.493]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a05599cc4434b264117a5cbfa7e369acb) >>
+>> endobj
+3983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 640.013 191.718 650.917]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+3984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 640.013 303.079 650.917]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0a3af4761ddba931bf8e58add0afb234) >>
+>> endobj
+3985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.635 612.81 188.679 623.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_adc0c5285fb27f97b159343d073147583) >>
+>> endobj
+3986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 584.861 181.845 595.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a818b1050a44c6fb4d635a6fc088eeeca) >>
+>> endobj
+3987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 557.285 181.845 568.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6f72dd3b1bbb47f4464d5e8909b26be1) >>
+>> endobj
+3988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 529.708 154.727 540.612]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac72c231542712976d1f9223d0537f5d5) >>
+>> endobj
+3989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 502.132 176.864 513.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a8d53eb99ecd29659516d17fb012da785) >>
+>> endobj
+3990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 439.12 143.695 450.024]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af92ee9bb7bcbcb21f9258383d1324237) >>
+>> endobj
+3991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.511 439.12 213.154 450.024]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+3992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.317 439.12 382.706 450.024]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+3993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.537 439.12 457.784 450.024]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+3994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 415.529 143.695 426.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aee4fdb270cbcc8a6c5fc5ab619f75c2e) >>
+>> endobj
+3995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 415.529 189.632 426.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+3996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.196 415.529 282.662 426.433]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+3997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.461 415.529 426.213 426.433]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+3998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 379.983 143.695 390.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1ac45fdc32c1f71277c20bf99ba897b2) >>
+>> endobj
+3999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 379.983 189.632 390.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.939 379.983 347.405 390.887]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.204 379.983 490.956 390.887]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 356.392 143.695 367.295]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af4596a33925d3d0f614611c49a93e63a) >>
+>> endobj
+4003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 356.392 248.859 367.295]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 332.8 143.695 343.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a252043e3c039025c8e7711ba54640be9) >>
+>> endobj
+4005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 332.8 248.859 343.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.388 332.8 330.333 343.704]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+4007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 309.209 143.695 320.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aadf0b61e103f67cceddc7f906fcd5d54) >>
+>> endobj
+4008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 309.209 247.176 320.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+4009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 285.618 143.695 296.522]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3eb224ee7296a48a896628d717af08ca) >>
+>> endobj
+4010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 285.618 247.176 296.522]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+4011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.263 285.618 329.207 296.522]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+4012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 262.027 143.695 272.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abbc2f0efa777834582e50b84a118e11a) >>
+>> endobj
+4013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 262.027 255.485 272.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 251.228 143.695 262.132]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6622f3ebaa0a7ca49ae31de570c9c5d7) >>
+>> endobj
+4015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 251.228 255.485 262.132]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.995 251.228 341.94 262.132]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+4017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 228.473 143.695 239.377]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aed0590bb20123efb8b5a9cf6bf874c05) >>
+>> endobj
+4018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.405 228.473 216.566 239.377]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+4019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.992 228.473 346.459 239.377]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.444 228.473 513.996 239.377]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+4054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 216.892 150.878 227.422]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+4021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 180.972 143.695 191.876]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ade1f0e51d72f00210547d258764758e8) >>
+>> endobj
+4022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.716 180.972 243.984 191.876]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+4023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.407 180.972 372.873 191.876]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.014 180.972 513.996 191.876]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+4055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 169.39 177.448 179.921]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+4025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 145.426 143.695 156.33]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3a9ad95beee0ae1caebad2c6e412cc9b) >>
+>> endobj
+4026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 145.426 218.962 156.33]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+4027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.155 145.426 317.621 156.33]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.42 145.426 461.172 156.33]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 121.835 143.695 132.739]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a5b239b53a82bdcda95c97ab3b68e118a) >>
+>> endobj
+4030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.032 121.835 191.286 132.739]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+4031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.417 121.835 287.883 132.739]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.682 121.835 475.707 132.739]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) >>
+>> endobj
+4033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 86.288 143.695 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_afad7c372c3fe87cfaf8b4791009dbb10) >>
+>> endobj
+4034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.228 86.288 282.649 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+4035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.937 86.288 443.403 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.3 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.707 203.46 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4042 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4046 0 obj <<
+/D [4044 0 R /XYZ 89 770.89 null]
+>> endobj
+4047 0 obj <<
+/D [4044 0 R /XYZ 90 712.265 null]
+>> endobj
+4048 0 obj <<
+/D [4044 0 R /XYZ 90 684.689 null]
+>> endobj
+4049 0 obj <<
+/D [4044 0 R /XYZ 90 657.113 null]
+>> endobj
+4050 0 obj <<
+/D [4044 0 R /XYZ 90 601.961 null]
+>> endobj
+4051 0 obj <<
+/D [4044 0 R /XYZ 90 574.385 null]
+>> endobj
+4052 0 obj <<
+/D [4044 0 R /XYZ 90 546.808 null]
+>> endobj
+4053 0 obj <<
+/D [4044 0 R /XYZ 90 519.232 null]
+>> endobj
+4043 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F67 3022 0 R /F39 2335 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4129 0 obj <<
+/Length 2052      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�F~�W�Ʌ{��.��!i�i�t���K�a,XS]�$L�_߳�]�� aT<��$!����|{������7������.�|�;Աn���-��w�����'y�+�1��
�Y

o����NL�`�6
eA���������_�_�V"q
(Ά���SIj�B%�J���
�PH��4?l)��&ū(����;�i_��((���^LE6 ^_$c����	#���O���=�`�(48r=k
�>���	|��ˆ���,ŖM<#�C��
��n>K�}�򠹀�l�
�W�=-�rF��@=F�i�2N�"�0���ŝ��<Ȋ0���30�/&���������)|)
�d�
���
+��\%��#�1)P	����k��R��[W�-�*�'Jy-�B7�i�߿�Y�8pLS�J�e.�dž\��t.��H���~�
xy���m5?@~��x��H�"�&�qa�=��H@�p��")U���e�U3�V*X����0fMF���=���
�#RF$&Q�L����W�
�q�C�� �4������<L��0��<(�Q$$��iC
���
����6�$����������T��6Vl��ߐ��2��
&�
�Vv��2,�M�
d�-������eV����+c�F���
��:ȣ��坈GB;��E2.���hs����T=K��w�$�>lH�&�6��0ds)���C����x���yds�y0�*�6�)}��M��
��E��V�m�L��t��{1���l�z�=Js9H>�,�<���	i	��o9"2q��H[�
��eirz;*���
#�*�
x�0�T�	�M6$��~��a��ab���
�-[������zt�A؝��Me�Mj7$m��A�S3�a�m3(�݃�(M��H������<�T'b�-�~bh�#�2Pb"�F��.�����fdS@�ž؊S�2�.�je�EJ�����rq��U��^N	`4�f�"��Q:
�r:9�#���m{�m�ҶZ���W�0�Q.�ֱ�ݩ�1	�q&�����CA
l�.��Q�H&g����
�Ϣ�z)0����Ld�y
+�Ζ=ܲM�-‘r��&p/�Ať������͟Y����
 Z� 
�Q�(��2�
�cà��ė
*�sdMK�
bޣi���\�
��a�@J� ��_S����SW�oR�^��𽈂bs&��x�N=4K�O\jeܨW�n�W��������K�I��2�R�&KT�y�
���F��׸k㸈����
up�uK29�r����i�!7��4;����f
.E>�dg<;r��e�P���=�Ko�sq	jV��T:�I���SIE>���e�69�V͎�&���Щu�TF��p���0��j
�μ� !Ȇ?}�g"߶�{Q���W	�V���ڼi�N&ĺ�Q�Dr/vD[>�U'<�X����� ��3:>��#�2�^������X�-ɾ��iZ���_�8���1��,b/�d��or�|��@�@�&���q(
�	���|��,��)�W%M.e��vT �s�P�(�Z�Opb#�\��'����o{5�q�vx�.o�+'
�.�h�d�
��4)O7��ٖ�mk
+(„�wކZV�
?֜WV�6v��
�!�9�;��v
Ygٔ�]8��/�P
h35*���8[P1�<Ud�T PN���Œ�ղD<_b���V�c��f<M3.O=�8+�Yq:U�*
�V����N�|�'�|D۠�������.Ե��C�s����ɧ�8L��g���/���� ��k![и�0����%QU�@�c� J�N4����������K�;�0V� ax���~+	{T�V	[�xvȗ��Y����wʗ�W��D2��`�Ϡ_A�tV���t$��x�M��U��y�
�b� -o����@7�,��2��Q��ts�V������}��wA���U'sv�:�O��ԥ
�v��atT5�o˼�*oh�ڝ���6�]Q�_\_��\$3�<
��"�
U����vq�U
��q�3��
A�%�95h ��{&
�K����&��p�s̬S yuy�_�i��
+endstream
+endobj
+4128 0 obj <<
+/Type /Page
+/Contents 4129 0 R
+/Resources 4127 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4141 0 R
+/Annots [ 4037 0 R 4038 0 R 4039 0 R 4040 0 R 4041 0 R 4072 0 R 4073 0 R 4074 0 R 4075 0 R 4076 0 R 4077 0 R 4078 0 R 4079 0 R 4080 0 R 4081 0 R 4082 0 R 4083 0 R 4084 0 R 4085 0 R 4086 0 R 4087 0 R 4088 0 R 4089 0 R 4090 0 R 4091 0 R 4092 0 R 4093 0 R 4094 0 R 4095 0 R 4096 0 R 4097 0 R 4098 0 R 4099 0 R 4100 0 R 4101 0 R 4102 0 R 4103 0 R 4104 0 R 4105 0 R 4106 0 R 4107 0 R 4108 0 R 4109 0 R 4110 0 R 4111 0 R 4112 0 R 4113 0 R 4114 0 R 4115 0 R 4126 0 R ]
+>> endobj
+4037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.88 143.695 707.784]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.435 696.88 195.241 707.784]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab61175b7fba7302cb6afadb5b323bf5b) >>
+>> endobj
+4039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.578 696.88 241.178 707.784]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 670.74 180.198 681.644]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a63fc60fa5641393daa4941bfbd221ea0) >>
+>> endobj
+4041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 670.74 202.614 681.644]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 607.336 190.738 618.24]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 607.336 261.85 618.24]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a6cd706c19e9390869e487d6477e68873) >>
+>> endobj
+4074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 581.196 190.738 592.1]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 581.196 262.159 592.1]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aa3d9bcd4a6443f9a464b5c1d054e61c7) >>
+>> endobj
+4076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.225 567.453 390.082 577.359]
+/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
+>> endobj
+4077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 555.057 183.824 565.961]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae43ec2c3ad2a7aa6067b1e4183ffc8d3) >>
+>> endobj
+4078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 529.29 192.272 539.821]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a41d2a55e5cffc82a38f316bf132682c7) >>
+>> endobj
+4079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 502.777 241.935 513.681]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a78b9cd4dc3fe1b22453da1f204263092) >>
+>> endobj
+4080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 477.011 189.901 487.541]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a2de34e0b200f5778015b9e30801c80ef) >>
+>> endobj
+4081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 450.871 193.229 461.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a556f4d24accd80146165ddcde32f1ed0) >>
+>> endobj
+4082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 424.358 238.459 435.262]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a375fe6faa28320fd69632bd4f2121216) >>
+>> endobj
+4083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 398.592 187.689 409.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aef4feee62ba32afe0ead38e6684b5ce4) >>
+>> endobj
+4084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 398.592 226.693 409.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 374.071 205.692 384.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+4086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 374.071 261.312 384.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3e45b1f4a434befb7613067681138a0c) >>
+>> endobj
+4087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 374.071 332.156 384.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+4088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 349.924 205.692 360.828]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+4089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 349.924 261.312 360.828]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1946e416f0a015ffa8c3397b13ccfcd9) >>
+>> endobj
+4090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 349.924 338.781 360.828]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+4091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 325.776 205.682 336.68]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+4092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 325.776 261.302 336.68]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae22cab253269d7d9c8098d7b107b8282) >>
+>> endobj
+4093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 325.776 330.462 336.68]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+4094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 301.629 228.895 312.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aaedd389a755e8a8af62c5ceeeb7159b5) >>
+>> endobj
+4095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 301.629 333.482 312.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 277.482 229.503 288.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_adfa6c6f25a86b7a8ba9e8ca6b1020e58) >>
+>> endobj
+4097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 277.482 334.089 288.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 253.335 187.264 264.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab8509cde4b1541c96fb3f9617cb3a2a0) >>
+>> endobj
+4099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 253.335 293.213 264.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 253.335 371.148 264.239]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 253.335 455.727 264.239]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 206.273 187.264 217.177]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_acb3a642ede7e834de34d863314e07810) >>
+>> endobj
+4103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 206.273 293.213 217.177]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 206.273 371.148 217.177]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 206.273 455.727 217.177]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 194.318 220.058 205.222]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+4107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 159.212 186.348 170.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae02c20f1b068eb38700e4f61f50f5886) >>
+>> endobj
+4108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 159.212 293.772 170.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 159.212 373.367 170.116]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 159.212 456.837 170.116]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 112.151 186.348 123.055]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a35eea48c9cfb87e065f6aeee620d6e25) >>
+>> endobj
+4112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 112.151 293.772 123.055]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 112.151 373.367 123.055]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 112.151 456.837 123.055]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 100.196 218.404 111.1]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+4126 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4130 0 obj <<
+/D [4128 0 R /XYZ 89 770.89 null]
+>> endobj
+4131 0 obj <<
+/D [4128 0 R /XYZ 90 712.265 null]
+>> endobj
+4132 0 obj <<
+/D [4128 0 R /XYZ 90 686.126 null]
+>> endobj
+4133 0 obj <<
+/D [4128 0 R /XYZ 90 622.533 null]
+>> endobj
+4134 0 obj <<
+/D [4128 0 R /XYZ 90 596.582 null]
+>> endobj
+4135 0 obj <<
+/D [4128 0 R /XYZ 90 570.442 null]
+>> endobj
+4136 0 obj <<
+/D [4128 0 R /XYZ 90 544.302 null]
+>> endobj
+4137 0 obj <<
+/D [4128 0 R /XYZ 90 518.163 null]
+>> endobj
+4138 0 obj <<
+/D [4128 0 R /XYZ 90 492.023 null]
+>> endobj
+4139 0 obj <<
+/D [4128 0 R /XYZ 90 465.883 null]
+>> endobj
+4140 0 obj <<
+/D [4128 0 R /XYZ 90 439.743 null]
+>> endobj
+4127 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F68 3017 0 R /F66 3165 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4204 0 obj <<
+/Length 2133      
+/Filter /FlateDecode
+>>
+stream
+x��[ߓ�6~�_��
��5��@�*���U~�e&y٤\��=���Axv�ߧ%�6����lm��`!Z��[�D������
��\�
<'D�O}�f��	X���b�K<:�����"�O��׿�r�旛k}o��fp? p
;�
+�(�d1x�vbh����
���tZ8�z��\�;��.����: �A�X������ǜ�#��{�e�]k��J�~3=h��\ޯd:�wE�P�b�'Y��.9��)I吸Q>~�q�K��,m�Jꑠːa���2=
��39
R*`:IdZ�
+�3������
�|��
!��
����}���D�N�u��7���&24mMgmc��m�@����C�>"��'3��d��S��zK ^��4D��
+�E���זL�!��S2��p�4�Y:_۫�Vq'�����C�ݏ	L ~nd[Wi ��Ѽy[?ⅈ�:&�_�~D 
������]�JT�G���G<0�O�G�
^��
�8��s����Q�ZR��(�p���I�n) �q��"u(i8�<N�
�������p�C
h7���J���N��,Ȭl�iI�B��
�]H��o�۷��րX?"(E>#'�����lPc�*�@��2�
+n�c�HP�̉�
jAM���
+�@k0�[Dq���BB�c�^ࢊ<����
n��T�E�h
� ����DO�P��q���%i1����!�>c���m���v�E��z2Q�@�ʟGrQ�#�xO0���C�y��=�9���GT$JYCt�>�y�EQ�$��<Dy��B̷�9�GDP�>b�\f���D��K25{#�
-`U
+�&�Q�tf���[h3�oW餀'J�
����d?gq2]W�K�f���p>�s��=h�%q7�8
�吃�'��םB^M
��
+�;�+OW1�,
�MQb�o��.��-(O��"��Z�B.�F-u���f�Q��N��� ���6aJO�P�A��:�kk�V�~ T;��yI�����&mހ���=���	DB�o��ҞM��$(
��A/
A=��Y���ӲO��W�٣@��@��x���
i��uM4m�~�<DsY�ރٶM�	6A��e2k�1l����`1�l�P���3����)g�Gk��`t&:��ÚDZS
0m�T��  '�{�9����
R>S��v-��Iqw��ߕ�(mn�a�΃O�٣k���
@;7� �� < .}�s
	�d#�@V_((/VT\*
�BC�
�1�y/ �k�Y p�
	�9��2ѾX
��	ؐ
���c�g�h64��/�(��&
+u֘f��m�.��.XL�Ϣ�>Z�ҶC
,��g;��(
+(y~���L
���7
�b�l]���qR��8K}�/��|NH�	����������c�u�۵�y+Xl!Y����˕�e�<� �p

t���I�)p�n��K���^S
+��z)�b��
�X����rR�����_/�K���ֽ2�HD��F���������R�̜�AL�54Z�7
+�fD�b��\�gX�83�Oȸ[�W�k�UK��~b�2�
����^x �>�g=�%��v
h�b�L'�L�(�dyǼހ�et��::T��4l�8i��!��F|PF���0�3� ����o���8�g{�&M}�c�D��>cH�+ij��J�V���3Q�Uױ�'���d���X�1�&���s���
4�Tő��>��(�s��Z.e>��Vi|i�b��-��氾���&�,��k������D8�i�wA��T�	<�S��>���tl�$�&ť����j�܍���߶�I��V�as��$�3 �G}�#
t�
�ܘ%���~��פ37)l{u�:I�m�Ɛ"B�?4�CœZ��d-��e�26����V>$��,V�|�K�i4W�c�M��<��cvG'(�։ʼn��h*ss���J��{m&"����҉�"a�"���狾>R�N�|�� 
�w���=	L��_��ܬ�)��_x�wۈ���F`�Qd3�9b0粏��M�w�~��+��kȹ����t� [...]
+endstream
+endobj
+4203 0 obj <<
+/Type /Page
+/Contents 4204 0 R
+/Resources 4202 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4141 0 R
+/Annots [ 4116 0 R 4117 0 R 4118 0 R 4119 0 R 4120 0 R 4206 0 R 4121 0 R 4122 0 R 4123 0 R 4124 0 R 4125 0 R 4152 0 R 4153 0 R 4154 0 R 4155 0 R 4156 0 R 4157 0 R 4158 0 R 4159 0 R 4160 0 R 4161 0 R 4162 0 R 4163 0 R 4164 0 R 4165 0 R 4166 0 R 4167 0 R 4168 0 R 4169 0 R 4170 0 R 4171 0 R 4172 0 R 4173 0 R 4174 0 R 4175 0 R 4176 0 R 4177 0 R 4178 0 R 4179 0 R 4180 0 R 4181 0 R 4182 0 R 4183 0 R 4184 0 R 4185 0 R 4186 0 R 4187 0 R 4188 0 R 4189 0 R 4190 0 R 4191 0 R 4192 0 R 4193 0 R 4201 0 R ]
+>> endobj
+4116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.772 707.957 187.446 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abf72d7c1638611a5c71bf52a8876e271) >>
+>> endobj
+4117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.73 707.957 292.979 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.431 707.957 370.447 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.745 707.957 456.762 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 707.957 513.996 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.376 159.485 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.603 696.376 240.62 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+4122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 661.189 180.496 672.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a937ab5b4a2e842b50072acc1a7b65ec8) >>
+>> endobj
+4123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 661.189 226.434 672.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 637.335 213.153 648.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0771b9671858526a0bc8c9563bbe6d03) >>
+>> endobj
+4125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 637.335 259.091 648.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 613.481 213.163 624.385]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac257361c1e50e8bdb3df14b10efccd8d) >>
+>> endobj
+4153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 613.481 259.101 624.385]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 590.001 161.677 600.532]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ac2f9f8298fa010f8f6fa57d0f3aa34d5) >>
+>> endobj
+4155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 527.856 205.752 538.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1c919831670c62f804f34bed961d05d0) >>
+>> endobj
+4156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 527.856 276.595 538.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+4157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 503.628 209.627 514.532]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0541d092976a45f0536672282080b5f8) >>
+>> endobj
+4158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 503.628 314.791 514.532]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 479.774 248.202 490.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a79aa95bed46b8ab83b8a5d8354e72572) >>
+>> endobj
+4160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.018 479.774 329.845 490.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 455.921 212.377 466.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aff8b02e03fc1ad496d15eab2f7bc9bcd) >>
+>> endobj
+4162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 455.921 289.846 466.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+4163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 432.067 216.252 442.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1ecc166599a5f4148ffb8501a7b06b2f) >>
+>> endobj
+4164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 432.067 328.042 442.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 408.213 254.827 419.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a22ea9cc129dcd3d767850704b2e089bb) >>
+>> endobj
+4166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.643 408.213 343.096 419.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 384.733 236.745 395.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a501e789db7ee01e6987cabd000d8dee3) >>
+>> endobj
+4168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 384.733 307.588 395.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+4169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 360.505 240.62 371.409]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ab00f85f9c6e8ac122128b882b57aef6f) >>
+>> endobj
+4170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 360.505 345.785 371.409]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 336.651 243.37 347.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af46728314c76649e2da343cdd66057fc) >>
+>> endobj
+4172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 336.651 320.839 347.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+4173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 312.797 247.246 323.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_afb4f9e889f3565e5bdf6fbb58202a9db) >>
+>> endobj
+4174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 312.797 359.035 323.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 288.944 230.598 299.848]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af6ee94f21dca99f7a394f5c2d3ddf90e) >>
+>> endobj
+4176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.935 288.944 301.442 299.848]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+4177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 265.09 234.474 275.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a98968306e896f1b6d0f14af2bc1d4d64) >>
+>> endobj
+4178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.811 265.09 339.638 275.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.167 265.09 426.81 275.994]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 241.61 193.577 252.14]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1717ae1040fcb9dfa558f0592121bfb6) >>
+>> endobj
+4181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 241.61 232.581 252.14]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 228.636 248.845 238.541]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+4183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 206.797 193.577 217.327]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_adad0a8c0777894840eb1e47415bd2dd8) >>
+>> endobj
+4184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 206.797 277.691 217.327]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+4185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 193.823 247.177 203.728]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+4186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 171.61 223.465 182.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae56880dabc96438041d5520c084eab29) >>
+>> endobj
+4187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 171.61 269.402 182.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 147.757 229.552 158.661]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a898f5c9b6f44790c9a63e9a3c58240b6) >>
+>> endobj
+4189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 147.757 275.49 158.661]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 123.903 266.673 134.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3195a9c16b89df35770bf13cfa40d3f3) >>
+>> endobj
+4191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.01 123.903 312.61 134.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 89.09 217.109 99.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1c3b68155c550c2db530870748fab905) >>
+>> endobj
+4193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 89.09 263.046 99.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4201 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4205 0 obj <<
+/D [4203 0 R /XYZ 89 770.89 null]
+>> endobj
+4207 0 obj <<
+/D [4203 0 R /XYZ 90 604.867 null]
+>> endobj
+4202 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4298 0 obj <<
+/Length 3505      
+/Filter /FlateDecode
+>>
+stream
+x��\m����~�B�\
+����]u�؉
�N��פA��N�$*$���_�.ߵ|��q��0��}���}��]������z�����+-f	|��ίf�i�÷��'�Qb�
F)����V�n�|;�ԋ�7�:^-�l.�U���ً�����o��b��"�}hNBY��E�B'�,���{G+
�в�_:AQ��v�$�W�;��
w��*
�w�Uϙ���%<
+�2
=�����3����PD�����_�l
���Q"3��
+�f�
����?���K�
+�i]L��54cF�	�3�*뼨6�i�@�Q�͟�4�u.ֻ��$���6W��d��^^F{#Sއt	��\���b����P2I��Χ�]���g�_��O_rf`�0�8g�����*�
ꗙT83�陋�G��j������3��0V+%�OuQ(��$�P�I��E�U�hA�]��C<�
�0�u��*W1��/W�&:�(T��
a�Â�Gr�Io�sq�ej�-4��B)HQTpt��Х�d��R{��\m1I�)ۺZm��%0@�*'q���Mo�}��k�B0"�#�$PA��poW*|�6`�1Pc�Y�O�%�;}�+��g����ARBA�k�.øͺ�jX px5�
+�����f���ma)\p��x��A� �����Y��X�sI�/`��{�+����U����!a�
�-zb��Po�e���܄�t�ƫM�<{����<3��	4D��/ ����u��v��*���ݣ>�&ڷG�)�f,�0\'�q�bnđ����Y�~���x;���'d���ޭ�ȯ�#[�*N��0\:j f� ��}�_â����%����
�V�C����f�G�!
�J-CQG�, �T�Z]7�e� V+�D�W�ʓ,&3
���ŃKR#I)B��8�$��Kt[���+�e�ڢp�o vk*��1
+
��P���]E��
ew��P��[POF�
�^!V�p-�4i"�Z���l6	�0�d؈i�ͣF*��d{5�`@>,V�c���(�;1�I=FI��aH��(�<4+i?ZA'Z��`"��ULP�j��+x\�|�+��
��
	�ITun�Iʌv5���Ό�
���$3����1vo�\2��U0g���S��&� /q�
<e�n���!��>	j&l{�0-��R�L*&�M�›ژ�A�]�gb��,H �(LBiZ��%_>���5��d`Up6�8rD��w�
Z!>.	��#t_�M"�L�>5�v�'�Y�3}:�>�]��0^m7�	��တu���֓�޻p�%-��ve2�!K
n��
�1(?�Ơ��t��Q�	�3>�����vĔB�@�a���Hv5C�M��G
�&���^�<	�4�P�Z�l ǡ�~��
��l�Z _v�=���p��l� e���+�`)�L���2x�e�14>�kO7�b\J ʪ�3ͼ���0���*P*�  [...]
BR�
Y$�4%2h%��oB�x�j�
L�ji��˛��z^�1���X���x�h/�enԢ�C
�	�#�/�]��Lv��.<uްg!�!7��Unb������@�t�	]e�NDg�E�M`�Nb�����϶��H34��"������b��y�l	��E���y���q�BT��$����^����E��?���q�
��@t�/�gQ�
yr�D���3F�<�0>���w�
������M��<��C�[)�������v��d�]"�Lg��2>T�f�#���U���}��r�
iz##�^B݄
j�Ӟ�# ��m�
]�l7��Y�������2l�o\��U6��z!��O�n%\�`(�B!3��$��d���89�v�\
��Rp;
Q"�mDA�ڀA��9b���
��M�
y,

+��p��&�?��AA'
b�֦�������C5�>�T��CF� x

~N+��i)�w�&�b��O�'`�涚4���Xi��Г�Ų�?���=�ļ=��)9-���bϩ6�iQYq����i��D�eZ��4��ȓ�b(9-h��l��	�F��|,��o/�T�|�d	{KW€� ;rB��ܜ�*ț���h�2͹�{��m�K�/	�������M�T�6q��M�� ��������y��IH�c����l������c��*dr��P�S�"�X��P�>T6fS�`���x��K��/��I�y�M��α�Vl����B���bJyZ{��m3��z�{c
)+���[�D���B��qO�DX��On�RM�8u�h
ܫ
F9(��I���;
�B &�l�B���
��H��b�:*��@�x �;�Sm�����B��
+8�jʃ��f.a�
��/�h'�7S
4�
�j����6��)�ۻ�mjO�):���^X]��t��a�wݣ���tC
s�?�T��
+�����Fp�����r�]^n��6
���`�������ƛ�k
sn|��m�
]�@26���$��xu���#r�
^�,߇�3���ۡ
�t��o�^���|n��p�? �ܬ�u8z����{|�Զ��]�$(���d�
4p8�g�#���1^���?�Ƈ�7gQ
OsC`����?$iؾn�eʹ���~Α�7
|k�/���9-��
+9�n��o�hXEzavkc�M��Lo@�7�v���yT���>ev�ٯ7�����v��><O�۰��0b����>$.�)
�с�5x�=�<Iӓ�5�GqQ{u9bmO{�3�2��$b����M��|K
+�es
+��tG+ͩ�	پ���˗�}�����z}��#V{<��m�-����b��O���&�is�G��d0�_��{^8(/*NȣM���O�TX��7����&L�]\,�(sk��a2���Dv�~�4}plS��\�,�
+�z
[�
�K�Xӗ@s.w�Ǹi�Q6+���l�C���J8����o�S]Qա����-Óܖ�Si�转-�'�-�-[����W���~����
+w3��
H�ܒ���"�)Y��}� �ׯ�9��bcO
P�����\V
��Sf`��b6�|�88����
+��+�U	:/�'Z�_@s�hP ����z�B�u+��Ź�^�P'x󙏿�
+tEt4$�`��_����s-{	�#�m߹
H�rj�ᢠ���g�,mosU?y�k�]��*�-�����1R�dM�CE��}._��0�O�;�: L�K]�Um49�
4a�{����-�_pC�k�#�C;ퟷ�/���߬�=�fL~#7�<oa��K�I3�
�3ܱN�{��; Ț��/�)^�S�f<��*A~4�� �o߾������!9��v��-�KTI
YT7�a����!������+��gŧ�ዕT#�A��N�ݤ���ӧ��]p��PWK at h�r�*8�.��ף��,�"E��Х���>/�
+��
����2��9����?x�z'f_E����F����
+endstream
+endobj
+4297 0 obj <<
+/Type /Page
+/Contents 4298 0 R
+/Resources 4296 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4141 0 R
+/Annots [ 4194 0 R 4195 0 R 4196 0 R 4197 0 R 4198 0 R 4199 0 R 4200 0 R 4230 0 R 4231 0 R 4232 0 R 4233 0 R 4234 0 R 4235 0 R 4236 0 R 4237 0 R 4238 0 R 4239 0 R 4240 0 R 4241 0 R 4242 0 R 4243 0 R 4244 0 R 4245 0 R 4246 0 R 4247 0 R 4248 0 R 4249 0 R 4250 0 R 4251 0 R 4252 0 R 4253 0 R 4254 0 R 4255 0 R 4256 0 R 4257 0 R 4258 0 R 4259 0 R 4260 0 R 4261 0 R 4262 0 R 4263 0 R 4264 0 R 4265 0 R 4300 0 R 4266 0 R 4267 0 R 4268 0 R 4269 0 R 4270 0 R 4271 0 R 4301 0 R 4272 0 R 4273 0 R 4274  [...]
+>> endobj
+4194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 707.957 271.126 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a738468a82c6d887970a834617108ad38) >>
+>> endobj
+4195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.463 707.957 317.063 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.863 696.245 326.259 706.15]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+4197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 674.919 198.26 685.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a17a3728922f9ea3c3448ddff2ba8f03c) >>
+>> endobj
+4198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 674.919 236.665 685.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 674.919 353.317 685.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 663.338 246.458 673.868]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+4230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.306 651.252 269.939 661.157]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+4231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 629.927 223.206 640.83]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aa57b2d0bd022842767e8ea09d0bcaca3) >>
+>> endobj
+4232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.022 629.927 262.209 640.83]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.285 629.927 357.7 640.83]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+4234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.268 618.214 288.464 628.119]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+4235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 596.889 212.768 607.793]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_abac7045e04f0acd65976bd206587c1ba) >>
+>> endobj
+4236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 596.889 252.959 607.793]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 596.889 375.145 607.793]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 585.307 286 595.838]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+4239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.401 573.221 277.928 583.127]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+4240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 551.896 250.099 562.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a499bc952185641d6b5a4e06df33cb15d) >>
+>> endobj
+4241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 551.896 289.446 562.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 551.896 379.512 562.8]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+4243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 551.896 513.996 562.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 539.941 416.369 550.845]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+4245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.304 527.019 439.335 539.184]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 506.903 261.881 517.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a20cc9fb3dab976e3efab4fb687a5ee27) >>
+>> endobj
+4247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 506.903 300.286 517.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 506.903 388.504 517.807]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+4249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 506.903 520.199 517.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 494.948 416.369 505.852]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+4251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.87 482.027 449.708 494.192]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 461.91 250.748 472.814]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a670a48f16c6832b218d772c267501cbc) >>
+>> endobj
+4253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 461.91 357.317 472.814]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 461.91 456.145 472.814]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+4255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 449.955 202.344 460.859]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.005 438.243 446.071 449.199]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 416.917 261.881 427.821]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a642eec722adef1eed5e2ce71546394c5) >>
+>> endobj
+4258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 416.917 365.272 427.821]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 416.917 460.793 427.821]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+4260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 404.962 202.344 415.866]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.222 393.25 466.67 404.206]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 371.925 239.984 382.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0d95ca2c2460f76192aa685809c44bce) >>
+>> endobj
+4263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 371.925 280.82 382.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 371.925 405.104 382.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 371.925 513.996 382.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 359.969 171.361 370.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 359.969 478.077 370.873]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+4267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 347.048 432.092 360.206]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+4268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 325.729 251.209 336.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a8854920e8f71343aef3d711113bf4217) >>
+>> endobj
+4269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 325.729 290.549 336.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 325.729 409.969 336.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 325.729 513.996 336.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 313.774 171.361 324.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+4272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 313.774 478.077 324.678]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+4273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 300.852 456.992 314.01]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+4274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 279.533 224.57 290.437]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ad72705a881e3ebdbc1872e278e453411) >>
+>> endobj
+4275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 279.533 270.508 290.437]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 267.821 347.869 277.726]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+4277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 257.454 255.564 268.358]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0502713719a7ec27442ee314c0518ce7) >>
+>> endobj
+4278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 235.215 196.297 246.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af8aa5e3f210b0f082fc5f6d1be91d31c) >>
+>> endobj
+4279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.439 235.215 279.215 246.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+4280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.718 235.215 432.878 246.119]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+4281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.827 235.215 513.996 246.119]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+4303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 223.259 216.491 234.163]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+4282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.094 223.259 362.977 234.163]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+4283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.254 223.259 475.081 234.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 199.592 164.537 209.497]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+4285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 189.226 273.129 200.129]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_af26815fa2663eaee5589d5b6e3896405) >>
+>> endobj
+4286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 189.226 352.41 200.129]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 189.226 495.961 200.129]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 167.147 275.007 178.051]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a9c6845f45ea7af3648a9c7f0483745df) >>
+>> endobj
+4289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 167.147 362.877 178.051]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+4290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 167.147 472.148 178.051]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 155.192 233.986 166.095]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.498 110.916 248.098 121.103]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.034 74.333 275.228 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_add1749de593080b326f6fb04bf1efe50) >>
+>> endobj
+4295 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4299 0 obj <<
+/D [4297 0 R /XYZ 89 770.89 null]
+>> endobj
+4302 0 obj <<
+/D [4297 0 R /XYZ 90 271.806 null]
+>> endobj
+4296 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F66 3165 0 R /F42 539 0 R /F67 3022 0 R /F38 3411 0 R /F24 537 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4359 0 obj <<
+/Length 2299      
+/Filter /FlateDecode
+>>
+stream
+x��Z[sܶ~ׯ��;�� ���v����:q,%/Nf�"�[�Br%������ެu�i�D< �
߹�غ����ūۋ˷̶xԳnWV�-����)�>Έ����β=���Yr���o�|{#�]������+l����oE���_���wFv�[O�(�
j�5�n.~�����U�8��y��8Q�e� B#����>��
��YS~.�z�`��#����mEC`���A
�[��!��h{j#摞��M���f�^��z.V�Y�n��^��BYJKսVׇo/�����y��$湘�H�&4�
o�8�
"�G
;�2�c�B�E^�m
˸��vB#a�u<�M}��c-��.�ZJ��Y

1�G��K³2
�ذ�
e�q���ZuÕ<����lJ���6쭺|��7zw��*l�ʰ'�Q�[��ݦ���!
+B��(���]ʗ׫V�v��O��)�������հ��lB-dw:��3T��s_�&�mI����^'l�ԡ�����9uga��:�B����Z��U"^?Ή;�AR<��aQ�s0��s�*������φ�Y���W,�X�{i�6�E�q&. 4  �I
���	�	�=�8�q��DR���]
y݌�ŋ��s��ѝ=Ӫn��Ұn`A2ڨ����9��I��	ܯ��'B|P����D���IN|��ᑳ�s�I
:��D	 �0ٶ�H
+�ޭʿ���O������9�M�B},L'[(`3w;)�R��T�"O�Fa��ٖ��Y�dI���
���TaY@ O�|��`�1�2��`����ώX�J�Ta�7˛M
�qѨ�+�}
�R�ʟ�+ t
��YY�
wV�	X��[؎�̆�!���Z��z���4�MX�3�TAb�굜~�Q�0�
u��U!��$n�Y�CQs�VZJ���R$�	�l4�:؏LP�h��7hq1�@
*�����E$�*4�h�4�^ޔ��N\�y�Qp��5�&=h	�(�K����������Df#���4�k�<–�Y��$k�ê*kO��:�'&��
��ϕ
Rj�R`��0��g@��K8Cf��=�=�/�d��oE���<
+y��A��~�m�OiQ���n�
�
�ȞD��,�$��5��B��
=�E���Vydz;�+���<�˵Q�
��B
��q��L���$����>,���?C�g<�*��2����%|�R#���Q�q��Ů˸e�^B���ǻ���5g�*�L��g�
�.�
��8�M>
+ FXb��x�
O�L����{�u��lF���جH�\����CVL�F�K�������!��s�|;m[Vſ�����ݲUg���q�5q^4W��nZ��3���T�n � `�ʆ���9��\5�=
��Q��ϵ�c�u#+1o�e*�62$�~P��`
-;�����[c6 at 10�g	�b�
۲����r¶
+$�.
+s->�R�5����э��M!�w��7��%���[
��ȸ�j��#�5m�Is��4rn�|�Ö�)i
12�
B��ۨ �k�@�
G��Y!��*#�`���B�ODQu
7��
UT�sN�)�����Q2l�2
�7;�MT���?��h�?'��:���J�t�$2�������^|�wWI��[�>��|��1�.@%��@n�)����ȶ7��q��ݘ����*��0���mEv�$(���]��v�,,O�ݼ+�(W�|���0{�Y�r�S�ܪ{��#�.Q�#T���h��^͔J<E��g���	xt��Z��H�'V;
�F�o���~��CM�/��_)��3hN���ѩ|T�	��F׉Ǖ6��F���G�d�p�(bn��cX�"
"}G�+9�L���VPv��I�7'�fZ(���69�[��(��#\��_��q ia00�����7�>tM/!㎏d�8��Bxq��1D�~aC��:I|"�@0��ޯ��l���]�
+��>�Y��^���/�I�9ॵ��s�eOH�t,8��?"��P��x������I��a����gȲ�S�U
�G�:
 8�.��Q��a��x$X�D)_F�'�Z~­Ϫ|b��*Lk�
�Xvi��A��5��VL�e��-�@>´�?�}��h�
+��Z�
���G�Z������o
�>�O��D�!7������	cT�
�˗�
=py�����[�z�~A��,��ʡ�	h���B�����R7?ռ���?�n�����:��T�Y��@^V�W�,l��nx�����t��S|�pGy	�B�+H
��|yyy���y~��"�v��¬+�Vm��U�0�ɏ$[�/`��
+endstream
+endobj
+4358 0 obj <<
+/Type /Page
+/Contents 4359 0 R
+/Resources 4357 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4141 0 R
+/Annots [ 4294 0 R 4319 0 R 4320 0 R 4321 0 R 4322 0 R 4323 0 R 4324 0 R 4325 0 R 4326 0 R 4327 0 R 4328 0 R 4329 0 R 4330 0 R 4331 0 R 4332 0 R 4333 0 R 4334 0 R 4335 0 R 4336 0 R 4337 0 R 4338 0 R 4339 0 R 4340 0 R 4341 0 R 4342 0 R 4343 0 R 4344 0 R 4345 0 R 4346 0 R 4347 0 R 4348 0 R 4349 0 R 4350 0 R 4351 0 R 4352 0 R 4353 0 R 4356 0 R ]
+>> endobj
+4294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 708.28 363.328 718.186]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.498 685.217 248.098 695.403]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.034 648.634 275.228 659.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a5445aa770edda1aa04a60627e27221be) >>
+>> endobj
+4321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 635.462 363.328 645.368]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 623.637 214.06 634.541]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3c29d34f9481e3ac12c258c6b2e4fe7b) >>
+>> endobj
+4323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.398 623.637 259.998 634.541]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.942 596.647 290.693 607.551]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_aa2160390dc1737a88c9e99bddbd5b868) >>
+>> endobj
+4325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.714 596.647 336.314 607.551]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.957 596.647 454.784 607.551]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.622 571.52 310.533 581.425]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.498 537.498 248.098 547.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.034 500.915 278.845 511.819]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a73264e4e6986e1b5c39d7a9e15b7e983) >>
+>> endobj
+4330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.912 487.743 521.824 497.648]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 422.608 289.866 433.512]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a18acc1eda6de3cecae90d1745595e652) >>
+>> endobj
+4332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 422.608 359.324 433.512]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 397.611 290.971 408.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a54ffe31caa56e074a89cb19c27902229) >>
+>> endobj
+4334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 397.611 360.43 408.515]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 372.614 224.003 383.517]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a3f3d352ec0d1be7e07b7865fe62266ac) >>
+>> endobj
+4336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 372.614 269.94 383.517]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 336.657 254.15 347.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a10bc77ab4d8e4abe74a7f4388b475d46) >>
+>> endobj
+4338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 336.657 338.263 347.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+4339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 311.66 284.585 322.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ae0fdd96e9e1b49de034111388ccdf76c) >>
+>> endobj
+4340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 311.66 354.044 322.564]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 274.708 241.726 285.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a0cc609127bac73d7b4fdce98dfe53ff5) >>
+>> endobj
+4342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.617 261.536 407.658 271.441]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+4343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 249.71 249.318 260.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a7116b71d356ae4ad3e759b828aabdbdc) >>
+>> endobj
+4344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 249.71 288.321 260.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 249.71 371.519 260.614]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 224.713 240.62 235.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a88f8bca95abe664d3060372b61c49279) >>
+>> endobj
+4347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 224.713 324.734 235.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+4348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 224.713 389.5 235.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 152.336 203.075 163.24]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 152.336 296.324 163.24]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a21f26d7888710beb265f4dbf86b740a6) >>
+>> endobj
+4351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.198 136.629 309.133 146.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 122.267 287.856 133.171]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_ade461ee9d38a42feae8beba99ac14f23) >>
+>> endobj
+4353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 92.198 294.481 103.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a1ec16e0616d2caf2b2b9ddc5ab1f9095) >>
+>> endobj
+4356 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4360 0 obj <<
+/D [4358 0 R /XYZ 89 770.89 null]
+>> endobj
+4361 0 obj <<
+/D [4358 0 R /XYZ 90 639.447 null]
+>> endobj
+4362 0 obj <<
+/D [4358 0 R /XYZ 90 172.333 null]
+>> endobj
+4363 0 obj <<
+/D [4358 0 R /XYZ 90 172.333 null]
+>> endobj
+4364 0 obj <<
+/D [4358 0 R /XYZ 90 140.614 null]
+>> endobj
+4365 0 obj <<
+/D [4358 0 R /XYZ 90 110.544 null]
+>> endobj
+4357 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F24 537 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4386 0 obj <<
+/Length 2537      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�F~ׯ���TeZ�

�r��%;�ckm%�)ǥB3-�
`b����+4#��ݪ�}���߹}� 
�8��������4
+8�	M���� �9b	��ޅ�l�$��|Ap�7���|AqX���b��/��&o�ON��w��?
?'d �$	��a?%����6�n���_&�PX�ݚ�f�Dܮ8-�],)��ł�Pl�e�	}獸͂d��Vp���$bR�ѳ��?����h0�f�js��=�p�� ��g��h�4��2x{�#l�]���?fNF0��J�7B*��h>�U����V�c%
?O�@ �4FQ̵��0ïj{��6��h�ͼ1Um
n��
+pP��vS���3X�Q2�xl6����"�b"��P�8ct}e50R���(���sx��{��I�ߊ*ߘ�8W�DƙD���eF�X�
pf
���''u�5"�h�O���#47�#� 
���z+����	g�1J��
�C�$�x搒v�Ф�J_��@�a�L���L�|.��Ñp�{��{Pʓ��nϱz��2x��4�D��#
�{��;��a��N�CCP�$� ��������������>��K�e���{#�g}E��3��Ei���hWM���׏o�q��]�;[A��Fy:�j��K�6�p�:Bk^�JƦ�� �B�x�~}�1�5��|L�CE�/�ev���Dp�(�H�9_Dx
+��Ps�	
 ���h�Q`#
47Z,�P�#��G���qz�d�@�>�Ӑ-3�"ͧĄ#��s��G�+ѶyS��&z˺k�E[/���-p�v�B��.�nJ���t\�	��.��ϓ��W�Ӱ��H]�%��6�j����Y�E킄����m�z�����S�e���,_Md�J��]#�|d`/��~�W�b[�mq��$ᮺ�!��wmW�]��B!+��x�8����[���A4*�����d�i~̆�[S���^6�lL��V4��������ũ[P����v����؈��)�;�[
+�� `�(
9��
x��,
Eԕf
v^.�It!�

Lh����lX��[���>�5���}n��j3&��p:؃ȗR�|9���U�9_
UWj��F7�}��2����Vhbz�B]�O*,)&(
="��݇���
+��f�C�H��W���u���M 
I+f.^k�����٩�m�uӵSƌ�=�ډ�%��Ty���TcP��|��e}S���@�	ʢ��)�NT݀�(K�����گ�m$����pV�
2�k�
�p�qzq�t^�����f��:�r���G�1)g�2b
%ijPI>�� ��#@q�ڤ�Hr�x�g���6M�
*�r�e"���VE;��u
s�n�M����
$.#/7+TO
O�
l�6�aKp�P�����CQk����(�F�<���VB�fm;�Z����^��0�(5YQ�ji�׉R��m?�A��{�&qk�Cy2��W*-��^+9+��6ϺCi1�:��{8-�տ��: bk�{e��͒��e�
o�M��jgRW�b-d�)�%t��鳌-�5�Ak

+�����?�m��]��[�ߢ��:U>\P9	t$O\���>�W*|�G�b�ގ���@g�B����:�l�3K�\g� �'���h�
	��Ѣg�)3
.=�M<9�Ж�8�ӕ�Z�~<"czBJ�p?,v$�Rj��|^��,_F�n��*B��a$R�&�+�;ƀ'�,7kw�����N 1w|<u�x��~�e��?f�č��HH\>+�*c�9F)w&�����ۉ}(�f�����/�޼}6aRpbL�G�'��3껢*�J����(�d
�PT�X���ۖŪ���SPgj�H�i��r�3�]U�)���˖'�
ݽkif��v+V�oSK=f�L���0�<Q���1�hD
e �tr�J�vr4;-��~(������'�?�$h�J/�e�����T
�
IՓ ��J��?�,Cid �v�˥m���~�
b_׺D�L����4��u�+{a]�v����zij���/ʲ6$t��}��
j���{S
+ɚ�_�?��D�	Ќ�
>��
4�*�c���1��y�L;�P��.��n�Է�e'Z�l*���	�����6��=�?�y��	Ԧ/荟.��O؄�)r��`�W��x�Ғ���#h�Ccx�п* 
&��O���ǧY
���#��X΢�7��Ȉ
G
+��L
�? �'SDS�H�>��
ORY�.�O�Ok�9qWt�����ŗ���ihJ��Ro��B���
�e"޹���~�<}����g�|q���99���>��ΓQ
�ƙOF_7�������F�~8Խ.c��C/
�19޲��⦪����ʖ�F��/[(��	 @�������V4�G3Z��W;;���a˄D��ȤM��e��s�����2Y�I1��v�uۓ���M+���[op���쵭X��q�K�9�7I4]��%Ь4 �? Sc��T�^���Es���&
+�j ������5n
+endstream
+endobj
+4385 0 obj <<
+/Type /Page
+/Contents 4386 0 R
+/Resources 4384 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4141 0 R
+/Annots [ 4354 0 R 4355 0 R 4377 0 R 4378 0 R 4379 0 R 4380 0 R 4381 0 R 4382 0 R 4383 0 R ]
+>> endobj
+4354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 646.058 226.034 656.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a30fb611cd3b23f903e1b5f285c238c38) >>
+>> endobj
+4355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 646.058 339.776 656.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 606.208 226.034 617.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a30fb611cd3b23f903e1b5f285c238c38) >>
+>> endobj
+4378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 606.208 339.776 617.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.148 507.69 117.749 518.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.986 448.651 125.586 459.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.17 327.912 213.77 338.816]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.732 315.957 218.288 326.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4383 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4387 0 obj <<
+/D [4385 0 R /XYZ 89 770.89 null]
+>> endobj
+4388 0 obj <<
+/D [4385 0 R /XYZ 90 704.286 null]
+>> endobj
+4389 0 obj <<
+/D [4385 0 R /XYZ 90 592.634 null]
+>> endobj
+4390 0 obj <<
+/D [4385 0 R /XYZ 90 543.995 null]
+>> endobj
+4391 0 obj <<
+/D [4385 0 R /XYZ 90 302.383 null]
+>> endobj
+4058 0 obj <<
+/D [4385 0 R /XYZ 90 280.007 null]
+>> endobj
+4392 0 obj <<
+/D [4385 0 R /XYZ 90 280.007 null]
+>> endobj
+4393 0 obj <<
+/D [4385 0 R /XYZ 90 209.46 null]
+>> endobj
+4059 0 obj <<
+/D [4385 0 R /XYZ 90 151.281 null]
+>> endobj
+4394 0 obj <<
+/D [4385 0 R /XYZ 90 146.798 null]
+>> endobj
+4060 0 obj <<
+/D [4385 0 R /XYZ 240.245 77.486 null]
+>> endobj
+4384 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F39 2335 0 R /F94 771 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4401 0 obj <<
+/Length 2220      
+/Filter /FlateDecode
+>>
+stream
+x��ZY���~ׯ�S"VO�� 	�ul�{��Z	��5��!"�Z�Z��}�yS⡑8�M���f����:��&vVvގ�����(�d$����1�Q� !��ҹ&'�g�:LjD��QI��g���>�g�׳�/#��CR ��v���g�,��[#f��%�q8ep];�F��L������Ifȁd� B2�0҈"6���8v7��<v�@WoHu�bk�K���G
Z!�u�!�o]�q'S�����_
�B )X>�o
� 
��l��1$
��4K�!~p��5`
#�y�/�M�JPd�)��X�3�A���uBt�:��V����&xlB�Hbݥ�:�diW��u��q~$k]�p!��X�ɔk:^~7 2��N�$EXg
++b�H{�(
+i�
i
b�_bDp�!*X(���]���n*��c�J��,�b?�x��ɤ��2�
+���G/�߾Zϣ�	W�&�8�HFL��Q֩���M�@e�;�|���?|������~j�)�� ��
Oi!���=��� �Ҵ��
P`��R׭��}ܮ��'�E��z#qm�A
�7�0��<w�z�B
�Ӌ�k7�uB�x
{��U��"}��~��
.�Q�m<z��iSpߤÐR�\�KMB�LiO(�GSvh]xJ��������e=XW+P8!z��m\?N[�l���Bw�R-����Jຖ�$ğ3	1ڞ����
\\:QG�Q=�����ʋ.3=W#Ss+r��
+�\��:�sϏo?�#X��h���=���B�E�$%��.�g9���B�r�W����܇�&��sg�Rm�.^�T�Q����чZ�I����뵂V�y�8��BHχt��ѡ���"�]z���$m�$�Rʚ�-��0�	, ޏ
���	����c�焌�:������C�쐣
a
f�I�%j��%��"�~�8�X"Љ�
�@��)��ե�}�Pn���"Sp���-q�u��b��K��P�ґ�H
	�*�t=O75�J���8�<ݴ���p�$�U6�ߎ���'��s�:
r���t�,���T�O��Q��V�+B�,#o����|Bq�Qď8��l�.v3J'8����{Q$=r����  ���T�#���S5&#����&�d��0~���ٷ�@d���w��S�
W=L��
+�i�_�j��]�k������M�SFrV^	 ��f3���7�	Q�q�F���hn��}[��0��"�K
@^պ�An�_ar�1`ZB�li� 7'��!F�W�GL�
S6
�!�
3
�
+��L�FrS�������7�9{Q[]�"*�t��S�\w�<���^E
b�E� �U���$ǺL�fϪJ�2��D��x櫺5E{?�/bo1_���1�[��wC׏=K�2���a�������\ɂ�E
��i6y�>�M 7C������1`%�ҡ|N­Yᖈ�����8����n���YM��S�-�j��U0����s���
�Y�.�ܫƺ�@D�P�)��mqkY跭��r�4��8b%y_��3m�O"�땾BX�2��&�@ls#�8τ�f�d!�|�����2L�1�_�?cL�$[�}�,(��EX�,*�~ʰ��;����B�K�x��@��;(^#~x�:q�q*�/$!��<��׏
wkOtz��	,�2p���|��O��C&����g$.Wri�U �v��"	]羛���`fa
���M/��=m����v
N��O�:4Ű_��5�La>
�p�6	���Z3_�
��>��CX�%��z�O
S��?��Hn �g�7�	|�3�n����<m���x��
 ��ú�%����
�)'�>�Yk�
��p�{j*�5�j��뜚��SS�yjJ��}�xu��
W�Oc�QV�)�F���u
�[W�Y��
ȕ�E<�trE1C��?���]Y���%R���CL�l�Ôr yQ��EIuA��8�	�Xũ
+Q�
O?K7Z���qĨy[��s�
~�U~��Y�9{�����
���Ѐ���]�&�
��&��er4[U�������h5
@$zȓ���k

L at Qv����)��I*������T¯r�<��d
W�6��{ `%��%`nX@"-�J

H���K�Q����ӛFn����F~����8�-MD�� �
]�
q ���O����T���7J2vE&���y�������n��
+-��1�+�pɢ���	B7?r���K�z���/�j�
+endstream
+endobj
+4400 0 obj <<
+/Type /Page
+/Contents 4401 0 R
+/Resources 4399 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4141 0 R
+/Annots [ 4396 0 R 4397 0 R 4398 0 R ]
+>> endobj
+4396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.658 530.754 439.839 543.272]
+/A << /S /GoTo /D (index_intervals) >>
+>> endobj
+4397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.658 391.291 439.839 403.808]
+/A << /S /GoTo /D (index_intervals) >>
+>> endobj
+4398 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4402 0 obj <<
+/D [4400 0 R /XYZ 89 770.89 null]
+>> endobj
+4403 0 obj <<
+/D [4400 0 R /XYZ 90 721.073 null]
+>> endobj
+4061 0 obj <<
+/D [4400 0 R /XYZ 240.245 647.468 null]
+>> endobj
+4404 0 obj <<
+/D [4400 0 R /XYZ 90 640.828 null]
+>> endobj
+4405 0 obj <<
+/D [4400 0 R /XYZ 90 554.629 null]
+>> endobj
+4062 0 obj <<
+/D [4400 0 R /XYZ 90 508.004 null]
+>> endobj
+4406 0 obj <<
+/D [4400 0 R /XYZ 90 503.521 null]
+>> endobj
+4407 0 obj <<
+/D [4400 0 R /XYZ 90 415.166 null]
+>> endobj
+4063 0 obj <<
+/D [4400 0 R /XYZ 90 356.187 null]
+>> endobj
+4408 0 obj <<
+/D [4400 0 R /XYZ 90 351.704 null]
+>> endobj
+4409 0 obj <<
+/D [4400 0 R /XYZ 90 249.884 null]
+>> endobj
+4064 0 obj <<
+/D [4400 0 R /XYZ 90 215.214 null]
+>> endobj
+4410 0 obj <<
+/D [4400 0 R /XYZ 90 210.731 null]
+>> endobj
+4411 0 obj <<
+/D [4400 0 R /XYZ 90 111.043 null]
+>> endobj
+4399 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4415 0 obj <<
+/Length 2548      
+/Filter /FlateDecode
+>>
+stream
+x��Zm�۸���ŸZ���,��%W�5��]�E�\���Z[�-9�|��}���M����@�� .M
�Ùg�!�G�
�������d$������#�
���>�	Fz2%�����q�����	��d�_��4�}ݥA���|�|�|���叄4$)A
��r�rCZ��$�pu��
+Cp5�/=B�)G��
+��ɔ
+<��:כU������>L'D��x]�=&LY�oo.�^�G�YC �G����/x4��F1�G��A��
���Nj_.pa�ꉨ�M�(�m���aX�"
i,��o���M%�6W�@��n;���lOՠ��n��4�>�LD�I��

�
�	2Bt�x��H�^Cd�O88�(����!�moz�3+FA�ۜm6����	��߃U4�
�	S��n
ƙۯ�� ��MfO�PX8�1��TC+��]���Лe�L��]�D��-� ��Y�v��q�adIZ�^T<�$s
�l�wDvE�2�F��&��l��-*�AL>�uz�܊$�?i�<J�0�X�XR�6�tg%�
�bk�A�l���l�	�`m}@�
�Qs
���刾��$VC����u!q���`yUڸ��h
"���mM�Y9�7,�d*�� �3�@F�T�JUI�Hw6�~t1u8�	��7�P.T7� II9b������')��AS�X���E��?G�*��/
�\!]���#�#��i?��7�he_Z魃H����ɧ�"n���V�
(t�Cf�]�U��\�
�O� �gAG�3~�Fs�5���߻��k|��+�ت�g�
�)=؃��@,�Ơ	�[ ؆-��8��ae�ł(�7��{S�M0+ at y
A
�w�p�PMe'�-Y�e������
S��̎
�g�:�E�P#��������s��
I}��I�N��'��S
!�e��e`��TG�
)�J"B[[�o*")t>N��� �7�	�Z��)B�a�<���
#2����ՙ�ʖA�ZA���y#���
+�,SV�;��R�3
7�6KK$���mHsR-KY�I�P ��-��bY�
"�iY���X�����b'�
+VSJ˒.k�Ī�cL�!y����7Hd�ύ��K<Jq����p̳2
��p��GN#�>��4��3�zyf8u��Oq4�p
1�q45�r
��q
�̯/<O�y�v�����Ux{ov�O�dH�*+�w���a�C=�
5�m���i}��dO��� �R�`<��xT�!�4t;� �-��
_0
�j2
�!g<�
r+�.*:'t��PpPc�a</�\9N�Y�����C�V�<�2e��MI�8&��v��_��:�T�p��6�ťl����
6�@��O��\bΦ�+J�dS�SĨ<�N=N
/�j��?ɧ�E���>={z���3H�{�0B�Z��Ȉ����yB��dj������� y�&�(ij��\!�<���M�=��Y� ��Kg��g��a�YT�d�� 3����4Yw�2�VZ91D�nfO at O��ۣ߅�)���s����Rz'�lqz�O �
+I�B��#��A
m yU�~@7{~f�1݌_��@ ��^���h�6Pm
Z�%��� Z&ٱbC?�8U#%t������^��ۏ�`���*9=���P�p2d �B�Ϟr�ԇ�wso9CA�u
^~��|�n8=R�A�~c��aS�w��)
�ٷ+�����>����իw�?|x���?�n>�v��,R�W
�v ̠"�o��!��kJ�>�m ��7}JA��4�i�
�l����!�֌���3�F]�1����jk�ih�+8�
r�j�cTcv�|�v��=6�j'��r��{�H��Y��-�EY(
�,���xO�9�H{�R'�oԋ��|�h[
Z+�:�	E,s�@��P��)�ӗ" ��
�~��Ԯ~,I�j�Mq���I5t{h�hK�=��Z>��۔J�q�ǥ
IH�`H��Rf�m�ӛ5��QV�M��Ci(*cG
�!�']�:�$�̛.`w�:3]����›.��^�Ѷ�9iC�{�vZڠ���O�6��1�������JC�ƾ��G�D [...]
$�<
�-�V��|WE ����j�h5��wFLZ+�U�6D�a��\�sNh��v�@ټ3���q
t:	�X�t*�S]���{��S���}qy
+
+֔�gh@����g�E^_�s��o��H�E
��]�i,�o���� �IC��ա���aX`�S�_������f�:D��u�2�6�/_���0^ p�Cj��]3���8U]'��B
�����_kW�r���5��_a
0Q��1�5����E�˫5�I�ȿt�����0F
+endstream
+endobj
+4414 0 obj <<
+/Type /Page
+/Contents 4415 0 R
+/Resources 4413 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4426 0 R
+/Annots [ 4412 0 R ]
+>> endobj
+4412 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4416 0 obj <<
+/D [4414 0 R /XYZ 89 770.89 null]
+>> endobj
+4417 0 obj <<
+/D [4414 0 R /XYZ 90 718.682 null]
+>> endobj
+4065 0 obj <<
+/D [4414 0 R /XYZ 90 684.012 null]
+>> endobj
+4418 0 obj <<
+/D [4414 0 R /XYZ 90 679.529 null]
+>> endobj
+4419 0 obj <<
+/D [4414 0 R /XYZ 90 596.843 null]
+>> endobj
+4066 0 obj <<
+/D [4414 0 R /XYZ 90 550.218 null]
+>> endobj
+4420 0 obj <<
+/D [4414 0 R /XYZ 90 545.734 null]
+>> endobj
+4421 0 obj <<
+/D [4414 0 R /XYZ 90 463.048 null]
+>> endobj
+4067 0 obj <<
+/D [4414 0 R /XYZ 90 364.663 null]
+>> endobj
+4422 0 obj <<
+/D [4414 0 R /XYZ 90 360.18 null]
+>> endobj
+4068 0 obj <<
+/D [4414 0 R /XYZ 126.015 278.914 null]
+>> endobj
+4423 0 obj <<
+/D [4414 0 R /XYZ 90 272.274 null]
+>> endobj
+4069 0 obj <<
+/D [4414 0 R /XYZ 126.015 181.209 null]
+>> endobj
+4424 0 obj <<
+/D [4414 0 R /XYZ 90 174.569 null]
+>> endobj
+4070 0 obj <<
+/D [4414 0 R /XYZ 107.534 83.504 null]
+>> endobj
+4425 0 obj <<
+/D [4414 0 R /XYZ 90 77.486 null]
+>> endobj
+4413 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4430 0 obj <<
+/Length 2371      
+/Filter /FlateDecode
+>>
+stream
+x��ZY��~�_���lޤI�ݞ�;Gg�Yd0;h�m�[�-yeyz�ߧH��)�m�I6�.�X�:��(cDEo������S8�4��|�X/@���7����x����i�K�0=�:��ǤF$��}�������'�������
�p��R�7Y\|��{S��3L��{��=N
�O���fV��lhD"�P#�("l0$�~.��qM._��J!Iu��_��l��dO�0
/���R�3��#R���o�-�, �)-G��|�H!I�S1+��#���-6t�2/(\]y���`KYW���T�

<r!��$^e
�� F�@y�FS�PJ�ՠ?�����7U����?���#�+
���{�=�^�ǫ�O�
+ŕ
'��}�
�!cQ-{C�@�|�_=�+�y%������?�{������n޾���g�zr�t
C���-���6I�/���<�D�W�pe�^����ΐBؐ@�	$X��u4�� ����
8ڞ��qG�,��
��dV��Պa$I�p�
�hQ,Z1�KJ8EBq819�]͘����d���!D����2E��z�����VK Y�zeM63���2�?��"ϋ�����OR8���
����C�U!@Ri7�ʐ�PE2TW�1����zƅ�ѪC% R���,N�p��8pJ�F�a7
ʺ��Y79k��2�U�L��#v(�ۧ\�W�ɏ?��r
��
����?z˸h*݂�'�AC���L at n
+���P!�J�\T��ETUU�f@�������c8]O���M�.2�2�����c�J� ƓR�c���W{B�!����dL�^�R���)�1�D���+KU|�$ҼZ���
JA��`.&a�4,�阴,&�L�)����q���T���塐E���Y�����z7Da��Z���t�#%F���$5�ʧ||HVa9���4	
�$�o�#&�Y/� �[x�ą��2�D�aL�!`ד�
�� a
�����������a��j�a35|���]��
�<�_��I%q~�"�X$
�[͸t����
+aC<"�#CX��
+���j�]��}�6";i<�;�3��	)��*_���eXw�ܯ� XX��桯<2��u��6�P|9&��f�����rA���E�R���a�N�'5�auU�g�:�$���f*�/J`\��$.�<ڞBpDY��ocϥ�HG����.(
f����1�5;�<J�W�=D+�
d#�y������
�!,X.�%��I�+���	��ͭ	��D�fw�M��]�OxĞ[&Խ��)�fX�
rq	]�XG�)Ҽ�i�C*S,J!iػoHɷb���af� i"$��������hz
a�T���վ�!Ї#�Y���= Pt�T�8ph��ԍ4�k��!MT��
9
+�.��
e�9j����V��>�s���)���%P��>${�!ٻ��m>@��<%Z�
Dr��M�Sd�ݨ�=�v8��q
+u�F�����$��l>�9U
��L�{�;�L�g����mk�C�+�z�&v��¤A��mWr��
���G`�
3�B���B�u�W�o汏k�0dg{9dJY�\���� ��1d�J���ۆ�(�?$�iի݅�c��
&�]p
�BUԩ�o�����i�fG_���z�Y�E
+x��F]T.%E���
2-ua�!IH�ԥ!�� �7W]Q�.--�ˆ�GR��6���K]N!�ݙ�B7��}�	��l�o2�a�m(M�0
�Y�w^{F�HNh�Yz�̽��j r��&ga��,��s��>���>���,�^Tg�gh�,�n�u�Y4��	��S9�f��g�Y.9����E��58�,]��$��7d�1�����3n��b2�~EX�cH�$H1�n-�aI���.i1drk
�w��Q����Ws�B;�-��I�.
�dZ�B�>�@tI["O�-�M:�-]ZZҖ
S��-��4��MM�&�%.ǻ�=�@$����<=E�^����q�g%.xq�bqaj���]�w���z�6���F
�)� � O%-J3ח[�E;7Z�JkX�0
g��C�H��Um�,��1��̼�,���Y����,3w�]�B��bm��.��/8]1���wY� ��
إ萭�O!+f�T�θJ�f�Tŵ�H��4�����H!�������ўkM%m��n��DGG����F����e��A�~��
��D�*�ƹ}X�Sܸ|�`�	��
AްX��gK^�u��������77o�����!���k�Ysn����WQ��&��,�P@D�!#��)
������J�_.l�6tR�:F�lyuyy����x� ����~9 \��>Is�I�Q
7Q]����7�[�
+endstream
+endobj
+4429 0 obj <<
+/Type /Page
+/Contents 4430 0 R
+/Resources 4428 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4426 0 R
+/Annots [ 4427 0 R ]
+>> endobj
+4427 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4431 0 obj <<
+/D [4429 0 R /XYZ 89 770.89 null]
+>> endobj
+4071 0 obj <<
+/D [4429 0 R /XYZ 126.015 647.468 null]
+>> endobj
+4432 0 obj <<
+/D [4429 0 R /XYZ 90 640.828 null]
+>> endobj
+4433 0 obj <<
+/D [4429 0 R /XYZ 90 533.659 null]
+>> endobj
+4142 0 obj <<
+/D [4429 0 R /XYZ 90 510.659 null]
+>> endobj
+4434 0 obj <<
+/D [4429 0 R /XYZ 90 510.659 null]
+>> endobj
+4435 0 obj <<
+/D [4429 0 R /XYZ 90 449.936 null]
+>> endobj
+4143 0 obj <<
+/D [4429 0 R /XYZ 90 415.266 null]
+>> endobj
+4436 0 obj <<
+/D [4429 0 R /XYZ 90 410.783 null]
+>> endobj
+4437 0 obj <<
+/D [4429 0 R /XYZ 90 337.92 null]
+>> endobj
+4144 0 obj <<
+/D [4429 0 R /XYZ 90 303.25 null]
+>> endobj
+4438 0 obj <<
+/D [4429 0 R /XYZ 90 298.767 null]
+>> endobj
+4439 0 obj <<
+/D [4429 0 R /XYZ 90 225.904 null]
+>> endobj
+4145 0 obj <<
+/D [4429 0 R /XYZ 90 191.234 null]
+>> endobj
+4440 0 obj <<
+/D [4429 0 R /XYZ 90 186.75 null]
+>> endobj
+4441 0 obj <<
+/D [4429 0 R /XYZ 90 113.887 null]
+>> endobj
+4146 0 obj <<
+/D [4429 0 R /XYZ 90 77.486 null]
+>> endobj
+4428 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4445 0 obj <<
+/Length 2676      
+/Filter /FlateDecode
+>>
+stream
+x��\Ks����W��U�h�%��n�-�:U�

�
+"A�		hAҲ��Ӄ@
|����.&D
�1�u�7ݢqt�臋�/.�)d$���,28R� !�i�)&�ј`��#��X&7G����>��͇�m�OWW��_G���|GHK"��q�W
+��[�)%�Y����
R(,�͚?�a�^��"Y�Fc*p|=24N��d��w~Ngi1":N�	�e��1a�
+�x{}��18"n7R:�,/>}����1ˆ
=����
^�/���Ƃ-�>ڗj�
��fB���2bHT;���}��!���fz�R\�
�Oi�,��
�l��S����H03Y����E��j��aI��Y��6��5�������6�d����2���
�f_�)2�4!~
L��^Dg�/��Œ"V�>W��1�)Nns��K�b�Gc.L<ɳպ#nB!B���0�Ҥ�y�����j5ϳ�M�`�3����[K�L	����`��-M�qV�s�� ��
N��=�E�{��n �i�-�����ix�N�IF"�� �a�������V]
+⺩9�bS%�'��HL�E�0I6uy�xrO��*����=m6f������N+5���4W��T�n^Ejl;�8�t�ۘu�������|�e
C�Y������N��Tq������N�ۯ��a
�[���^�S`��VniӒ����<�tG�ފ}i��IF�Cl�\X���K�슴�k�,�' 5,j!E�ZR\m��A(Tb+F iYFg��^]�8��$���&)FL�w�e��]���7Ҙ��A@��*�DD��窏`l 
}O��|DE����^�\������d�H+"}eEU�s�-��y6ɗ�z~�H���	f��s�ٟF �'
����
dk��!A�tM�ft��!��ak2[�Cd
R��"l��m$�ag6��xA
`l��s5[�y�i�Mpf��ѣl�S6Y
B�p6=����W��-9[	 {�
�5IU(�v"c�df�����`�B

/ �dl�VP�B2���s�� ���bl!=�ێ�'26��W��0��#֟F �񰗩�d26��J{�M�$c㪟�)E%ÌM��m����ņ��2�e�u���g4�q��1���(�T��)
��0f���� �z�aŘq�qj�G�}�� ��d^��
+�.O��V٬Xm
��J�1Tq8S�G�J_�p�¬,B�z�u9
njܠ��8
+yH��q�،����7]8�
-S�$��NP��6�K8�	�fٵ'm��"���8�����'� �5�Mx����Gx�S}hzg
\7	sԵ�X9�Y�vP��O[Þ�P�] ��nC̮��w�
�.����r��7T+rH��
�,}*A3�,U?��'��3 ��QI��4IV9X�W�pE��T׈/��$�M���.
�>l������H@� s+~
Q�κ�
��x��{�p wZ��#7���D#�IJ,2� >�eupwJ��D��
��U0��1")�y�1
H����U�3��ܢ<��s}�V�g^_j�k��[�js��t�n�vd�b�
~��� y�D���^�Y��x.��Y���g8�(0�5���&;��҉�!
�3��:��+���d'��"	,��
�

"�,��(�
��ӭ�FPۊB�4˗��@���]����IH ��� $1�\��m20+ӶmY��;z?��l�άJm[���f��b��,�w�&:�'�J?�@$�
	Γ%
�eҦ�m1+D���p�%���L��pE2"h;�%�v8#`2����!=���;����<}m�7���#֟F R	
65O��
 �*����ҽ�u�5���QSH2�u]o::��y�5H%o{5}賢ٮh�5����[uv������M��d6�
�]�0cH���(�qN+��V�A����M��)�D�iu�A�Ҷ�頙��9ְ��M�ڑ�y������Hg��}�����i,�m(UҼ�f5�ѯC�סL����b�
+!��P�@	f�s��3�2
"BA,|�P����y���\?��*���i�|�|?�g2m?���T=#���
#��
�_� ��Ҭ��t잽���w�;[�v�T������m�#g����FAq�}�$�
0	j
H^hD=Ӽ΂^j��
��ϳ��O���!�i`��\�4BPu
敂�:�2���m)�o4�"�%�������7�
NtE��q�$�L[:{�m[�OQ�oc?�@$�<$�CKthfĶ3B��&��A�y�t#�m�7D��D�A"f!��%:

�H@ŸdG΢δ�ImK��<�t?�C"�
+��.с	�NLș�����ԙ�tΤ<[��fR����]��d����
-���"���5p׍Ah
+�͡��3���qw&�2����M��}Z�:Y��d]�<ؚL�t�zc���|�p�p�O�	�»��>YCMl�@2v�RƓE���ǚߋ�;������e�n箴�[�ʞ�^��@LB�œV��>)RC�����E[J���($��9B?~��
��J�ߏ,���I�M�p϶��z���A��i�B�>��_Ҵ��:��
�O?�B�5�(����y�^?\]^�n�Viv�&��NQ���jZ
���_�E� ���2kP�lЃ	ܱi����B1Q��+���/�Vo\�_���9l�6b���;
+endstream
+endobj
+4444 0 obj <<
+/Type /Page
+/Contents 4445 0 R
+/Resources 4443 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4426 0 R
+/Annots [ 4442 0 R ]
+>> endobj
+4442 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4446 0 obj <<
+/D [4444 0 R /XYZ 89 770.89 null]
+>> endobj
+4447 0 obj <<
+/D [4444 0 R /XYZ 90 721.073 null]
+>> endobj
+4448 0 obj <<
+/D [4444 0 R /XYZ 90 655.872 null]
+>> endobj
+4147 0 obj <<
+/D [4444 0 R /XYZ 90 621.202 null]
+>> endobj
+4449 0 obj <<
+/D [4444 0 R /XYZ 90 616.718 null]
+>> endobj
+4450 0 obj <<
+/D [4444 0 R /XYZ 90 543.856 null]
+>> endobj
+4148 0 obj <<
+/D [4444 0 R /XYZ 90 509.186 null]
+>> endobj
+4451 0 obj <<
+/D [4444 0 R /XYZ 90 504.702 null]
+>> endobj
+4452 0 obj <<
+/D [4444 0 R /XYZ 90 422.016 null]
+>> endobj
+4453 0 obj <<
+/D [4444 0 R /XYZ 90 331.266 null]
+>> endobj
+4149 0 obj <<
+/D [4444 0 R /XYZ 211.842 267.017 null]
+>> endobj
+4454 0 obj <<
+/D [4444 0 R /XYZ 90 262.379 null]
+>> endobj
+4455 0 obj <<
+/D [4444 0 R /XYZ 90 167.892 null]
+>> endobj
+4443 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4459 0 obj <<
+/Length 2923      
+/Filter /FlateDecode
+>>
+stream
+x��\Y�۸~�_��D��`܇���n�-o6'�$^�K#Q3L$r,R>��� xJ�(��w��r�IQ`���>a��~�'��|{{��O�M
2����zb�Dq���O���)�x����	�#���w����O���w7�oo���
+O� �ғ����<Y��&1�'�F�	�
��ɫ����R�������RjhHKCm�|�C
�����1��$+:yԅ��vp�<�HPuR�b��-��[&L��H���;!Zd�8K�JE��Z"��#
+�\
+�E�uK��
ޚ
B(�̊Q��MN���=������M�z��͘���Q�����9L2
j(� ���2��ꔥ�,�� �:��>����lN��kk
,0�z�S�$��Q��q�u�K�q�h��\�j��RU��1f�ސѵ��!Ά;�EN�U
������2�>.��n��&��� �wY�D�
s��cDXyR"���kϬi$�1iiS��s��h����z��|��_6C��IN��ɽK��*Z���]�uw��tF���/z���r�����^l���9#HK}��.����������@�K���f�Ƿ��8����?��P�-fu�V5�.>����#h�4AD�ɼX
�`�w�����=�4����
y�sw�O�t�|�V�*nGڃ0
/ �\)"X�� F1d`"0��
 �Y��D���!�����k��@!H4j�z����j�����L��* �����#4��NS��tS�d;�!)ZO��GOW0��St�zq�S�D�|34
Ϟm�$�������
����� [...]
+���μp���@ĩ.d����^����
�I����Nj
�꘹z�Cy��bA�K�~�BR�K������F#)d
+q��(o�?&յK}
' ��N��\!+��ߋP���_SM���#��r���ͩ�~ோ�4�|rw�/�
	��älm52�g�i�T�
�� ?z8��Q�Z���q�q�������+������t�|�*�D�9#�vYh��!^>%+�Vȵ�:��"+�b�P�ĉ]�6@�[C�}�m�6��u��V��1#cdJ
)�rF9�f�uy�LJ֎�K
+Y����e8���g��%.Q at Ed��T��9F����
+\�J����
�T��Rŀ�����m�M��}Z�X�Й��]پL
����ݿ�e^��,7�����.����*@H�Ȉq�G�T�< �CKtxf� I
�g��0���:U�:5p�� ��i�s[���~�yZ�9]��a����f��<��E^���
����Z������K���4N?�ښ�XZEI
+��jC��
Db�C�)�D�&l�vX4Q��0�	�n��.���8U�EJ8�T�O�[[�q	,��[����mݞ�\�.6Yzв�.6�YؼzT��"��!�y���
��L'x��	t�3�,V,Q�C<-�c
��2$��Ҋ�90�J��c�W���x����e"1a���2���`�9A��.C�r(������v쭗��fW�|�p����#{So��n��x\o�H�%=Q�0>H�0$	;�!y�
�G �ik��J����-f5��_�9ǖ���=�V"t �C�hh,ESJ�lp�
�gp4���8��hD�a}%���	���� hZ]�4b��������mN�3��+����f���P� ���3��-pk5{y

<�
�4��X

�R�B��4=#�%��9f��fj�g��
`�����cf=�2��g�gXCn��� Z����}��;<���l�i9��{�
H�(9 ���di��yd��w��J}����A�f��]
�8)c���hy�i���hY@���
���5\1�����(uc�m���z�A�RZ��׽����w˵���	u�8��[�)C�9���TC&�hP��(�+�q65R/�;�|.�z3zgފ���Rp�KJBA��bIA�'Ņ\�HM�Xjk򥸨�
�{�r�
+����
�$+v
+BrQ�,��.&�F��%�:���ب��y���c	Dڝ���
-ѡ�ĉ<m�+;�)†N���F�V<�QJ��\[�=D��AET�s�����l�\F�*�Ք`��f㾰)��. =�w����Z�>,k!{k
��.7i��E�Y���Z��Z�lh�z^5��r5Sv�C���^=�����L
��x!ki5"LpB���&AY�� �p
D�
n��m�
C��%FX0B6��!{`ꕄl�ү�lM�^?c��D�>
;B���%�R4G�T�#w��̝�?sg�9g�Xϡ;�w�n������9g�ԩ#w�đ;���g��{��!7�9r'~�G��\�Y�\���J���\���s�Snc�ܦ�~>��
ܭwѻ}�,gj�ɍDE�~BW#q
�;��6�n8�υ���{����Е�6�]S2�ҵ�
+Q�P���;yс;=�P�`M�0�@89�t����
�bsl,S�Jc��N�/4�j�V. uB��C�ι:�X/�-?qⱟ���e��a�ܵbt��n��b�I�r�	n��'���ʋ�
ny��,/_r�}�+hR%Z��/��3��
-6>�0�
��A
��X�$���/��e�a�0�m�z�
�
�� �;�D+�Gd/̡�d�t��a6���@'��R��54 PQv��i�<�n�;�� 9�D	
�k�_V���ز�Sֈ���y#���5X$��x���U�ݽ��/t7�Ȣ�ogBL�
��,lwoc��#����t�qi���e���U���t�O���݆mK'�o�,?��㳧O���Y��#(Žf�҆�_W,�6����p[l�
M��  u��
+endstream
+endobj
+4458 0 obj <<
+/Type /Page
+/Contents 4459 0 R
+/Resources 4457 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4426 0 R
+/Annots [ 4456 0 R ]
+>> endobj
+4456 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4460 0 obj <<
+/D [4458 0 R /XYZ 89 770.89 null]
+>> endobj
+4461 0 obj <<
+/D [4458 0 R /XYZ 90 718.682 null]
+>> endobj
+4150 0 obj <<
+/D [4458 0 R /XYZ 192.853 654.432 null]
+>> endobj
+4462 0 obj <<
+/D [4458 0 R /XYZ 90 648.415 null]
+>> endobj
+4463 0 obj <<
+/D [4458 0 R /XYZ 90 567.263 null]
+>> endobj
+4464 0 obj <<
+/D [4458 0 R /XYZ 90 476.513 null]
+>> endobj
+4151 0 obj <<
+/D [4458 0 R /XYZ 211.842 412.264 null]
+>> endobj
+4465 0 obj <<
+/D [4458 0 R /XYZ 90 407.626 null]
+>> endobj
+4466 0 obj <<
+/D [4458 0 R /XYZ 90 325.094 null]
+>> endobj
+4467 0 obj <<
+/D [4458 0 R /XYZ 90 210.035 null]
+>> endobj
+4208 0 obj <<
+/D [4458 0 R /XYZ 192.853 145.785 null]
+>> endobj
+4468 0 obj <<
+/D [4458 0 R /XYZ 90 139.767 null]
+>> endobj
+4457 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4475 0 obj <<
+/Length 2619      
+/Filter /FlateDecode
+>>
+stream
+x��[m����~���Z	�����KQ�I�I
+8ε_
���
[�<�<���,��:�҉�"0�I����yf��{w
�^]}{s���yiI�w��4�|����-��-Fj�"�ś%�� ��,)^���}f�����,����ߦ_��o~|�!
�DJ�a�R�_�ޤ0	m���׀
+Cp3�#B��G|�
�|��/n��.���6("{�m���%Q�(Y�-M�ZN�Ы�o�>^�=bwC _y��ջ��
���
FL+�s9h�q��s��z���6��DT�K�Qm�4 �O�ܮ
6��6��0�$��\�Ƀ3<���h~{�V�<��D�ud^T "Z{R|���
+�	�B
���ͻ�0�԰P���v�#�/����"��͙����/4������ ���(��u�$¬0��8M�MZ���>^��ˢ��&�>>�����V\9CEa~3�� �ʎ"Ĉd�%�K���)|�i�)�,9�9Fg�T>�V�dK�/����@7k1���������� "�:��cd����
+Z�)&�"���,��櫨0	�?-�X���k=<�
+{Q�v�].�L��z
+<���"��o�(�x�%�\�(f����a�j�t��m������9.��
bC�1FvWY��+oE$X 캪
���U��`
�^�neQ�#b�
�o_^9`
TQ�>0��X	*7O���,�ߚ�?����۸���I`G�n�Z�u{���:�5��K�8�~����V3����8>�����1�y>�����l���N&��oz�� ��)Ȉ����O��:�C)�E>ٮ%Zdsq�
![ � K� �W��S�=1��[�0��+i(T򸋲���R:�vu7E(1 4⃺�yH;[�q\�H�]ͱ@�3���-��J[��=�dgݕ48
�$����)�d[�N �1�l5ǁ� �2�$�l��+�%�Rʯh��_��Cӑ���JYh�$$����Mu��\@f��ƹ<>ɡH���>�4E-$��ʹ�03b|2k�����dɱ�8����b60�I�S̑�̩�� �
�� �D�S�������5��
�s�����)b�aTQՎ��]A�1���<���~Ø
��-���8?>Y]��1ȴ!VqR�O�
	UL�zs�9�F �r߭k�/�)$�<��{"���|�uCA�|u�u'�&����C24�@J6
yq
:��p���<i�� �'���J
+�K�Ѽ�6U����>
+k(w�A�YQ�>AڊB��U�(G
�Xuˋ�������@�AC�7��|�
(�Q�̒�i�
���HXnܦ�v���&�^���!mM.�7��r�1?�Z�ف�^���4)�8��
��^���
��� ���IOȟj�bWA�it�� v�d����(߄�ԯ � �a��[oˈ���8����M�w��7�������p&��J	$�<�ޞ((3ڸ��lq2�ܭ`1X0缓��4"�&�
�,y'�
����
�sx'�>b\9�.5�y灪g�Ξ�g��/Ρ���R�?�a}!N���Vw
)$u�nsdN�F:�Z?;��$at��p�X
�'!\�m���m�;�
�Y�.�����A�$�:�p=in
+�M7�~jV�!aA��ٶ����|������������s��o��i� Ҟ ��=�E��p���?�{'���I��9������s5�}�����O�@�b�b�A�UZ;���Y�'&����%}ꈜC���-qF�\jZӧUϤO=M�r�t��]D������m�̣�ߠ���'���86%
�&H�JQc(Kg�&*���o�0����U\��
�Mu2�P�ҟy��#9���v�A��.��)v��v�R�X��g_�����ZW>A��q/jxSN��d�܋��I �C��9�{Q�S�wF�\*ZS�MϤ^]E�r�u��
Dr�O<K�Q�EM�$�ϼ�%��$c���c)xh�Ѽ����0�".�8�hׅ�
��K!ӯ�{p�g!�|�g�2�gAlOc��
+	�Ɵ܁���]���:r�ZÍP����
$*
��De��DJ���%U]���a�;��N̙�}st�n����-�~�x}},n����|����͘��ڀ��$N�p�q���� �9�#��Cx�<K��ߝ"�-��3r�%��*�ܜƄ�I`0
B��
�
;�9k	��0{kh�a�B�=V^~��oF�a{�c�L�+
�mB�K��-�y'*�
+��<�<��t�X. ��!0!�x
f�8hvk+���@ ������ua�ײ�
Ƶ
*
�J�����u������x���ނmh5��͛��ᴬ���J:\N�X�d�4b T!�J::UyXfJR
�^���+�/�GI�Rl���m��
Ҭ������ķ�*�{��Z��`�N���E��+�@���
��g��<E>e��o^{X[J^�
+����Az|��g{��<���bQ��c��׆�۷	��Uc��C)Ï��$^�ն�
��W_�tU"�]�qYFV@�/���/o��(�C���
��
$���f���.�
�8�����$T7
�0I�݀
�F���i9�{]�X�������yOa�[��ߗ��
+endstream
+endobj
+4474 0 obj <<
+/Type /Page
+/Contents 4475 0 R
+/Resources 4473 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4426 0 R
+/Annots [ 4469 0 R 4470 0 R 4471 0 R 4472 0 R ]
+>> endobj
+4469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.931 671.2 186.185 683.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+4470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.668 671.2 272.341 683.534]
+/A << /S /GoTo /D (index_Grid_Frequency) >>
+>> endobj
+4471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.32 75.159 320.92 87.493]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4472 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4476 0 obj <<
+/D [4474 0 R /XYZ 89 770.89 null]
+>> endobj
+4477 0 obj <<
+/D [4474 0 R /XYZ 90 720.814 null]
+>> endobj
+4478 0 obj <<
+/D [4474 0 R /XYZ 90 605.755 null]
+>> endobj
+4209 0 obj <<
+/D [4474 0 R /XYZ 439.299 553.461 null]
+>> endobj
+4479 0 obj <<
+/D [4474 0 R /XYZ 90 547.443 null]
+>> endobj
+4480 0 obj <<
+/D [4474 0 R /XYZ 90 488.07 null]
+>> endobj
+4210 0 obj <<
+/D [4474 0 R /XYZ 90 453.4 null]
+>> endobj
+4481 0 obj <<
+/D [4474 0 R /XYZ 90 448.917 null]
+>> endobj
+4482 0 obj <<
+/D [4474 0 R /XYZ 90 376.054 null]
+>> endobj
+4211 0 obj <<
+/D [4474 0 R /XYZ 90 341.384 null]
+>> endobj
+4483 0 obj <<
+/D [4474 0 R /XYZ 90 336.901 null]
+>> endobj
+4484 0 obj <<
+/D [4474 0 R /XYZ 90 275.993 null]
+>> endobj
+4212 0 obj <<
+/D [4474 0 R /XYZ 90 241.323 null]
+>> endobj
+4485 0 obj <<
+/D [4474 0 R /XYZ 90 236.84 null]
+>> endobj
+4486 0 obj <<
+/D [4474 0 R /XYZ 90 166.109 null]
+>> endobj
+4487 0 obj <<
+/D [4474 0 R /XYZ 90 112.42 null]
+>> endobj
+4473 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F8 802 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4491 0 obj <<
+/Length 2115      
+/Filter /FlateDecode
+>>
+stream
+x��ZY���~���)�R\]�Ҋ"�$3W�''y��"��n���x&��s�X
�ۦ�Hw�R���ԩ:��U������N��On^*�d$����3�S� !�W��	�ӷ�o=&5"FB/����~���q�ھ���O�M��
�����L޼�^���0bF{\���)���{=�y�
]0����K��!-�A��a�CDNgc�g�f���jt��{*�$ե��-�R�j�=�8�D�e��f�k�H!��j|�!�ì��~J��]�y�Ɗ�4�D}���c8"�ă3h׭4C
+�50e��� �*?<�/��
�;[0l��L�Ѧ��E��h�a��6N�$X�Y����X��
���X at k^�*Ϭ���1�蘪fHrV���\*]o�����H;��lH`!��o�Ꚃ���Qԗ� Jy)��*^���[���o^J\.F��f�"�w
��vY��C��4

���
G�x>�	G��ٶ5N�/������
F�cL�U���)� /���BK֡)�!��.U)C�T�Pc�i�m3�,�]U"�U}e�3H �(��M��kc���K���%$F��pf��+7
�>�DH�Ɠ
Ĉ!��+��)6��
R`a����
�����p�M���j�{��t���A�Q������J�Dr��#����,�� ��'�A�a���E��V����uF 	IqX}b��K2�HJ�	2�.������Dۭ&�=��M�(d$�w?
��:� �”sˤYx{
u�c�}�^�ɔ)��Dq6��s�1s�0p
ڞ(c

�&ڬ� @��y���
+�C
QM����(S����U
+�� W�]� J⩪L*l$Q�x�ˤJ�U��nvA��[G�ٗ��&]�6� !{ǒ��!'f��|��^X-Q:V0��#&i}xX-

+0R��x��2�&X�
T���I�E�}l��;��9��n`�S��抠��R!=,����'��`	M�dI=+Y���C ��B��J��I�
�*�
+�w�����1���̀6�-�&Wq%�EɦY�h?.�D��K�'��/R����o�5���c�	
��S�!�04J�)�&��#C�����\AXP2"�
]���\h��dh\���)
�J5:ZC�'3�#����X��M��ljӦ}�X���.�f�[3Wc:�����x�Ʀt�nFGEX� �E�((
���$^A�8�I�E�F�gI�Z���5����������7=X�
�i̔s�̧�aE���:�M}I��d��B#�0�@�
��ZF����!�]��������lJ�� �,���]�o���.gU���D`@�����ʁ��b���~]
��+�]�/kPP�L�l�
��:�+�WM��U�y=Ѱ��|^��Q��aQ���x<�!(
�M4��j
[��d�\�[*INpq[x��������k��
[���1�8��Uƣ���
]2�V�J��d�
gY
]�{t�1�:1.��8����,��,�Xv-�e��P;��	����H [...]
+DZ����
��\� k��D�
2��F=E��Ӣ��6��w�����o`�(ؘ�&�K|�"�"���d�(�YÇ�OF�� ���<�Gfk� �6
,��̎8ϒ̶&z�m̳NfU=d�AyVg�Lz�d�:7�d�
:X�@[M�p��
�5s�֊��
�R��;���`�qxƲ�ԡz����5�-|�b�� �4G�q��52O
B>6����<'��f��S�Ss�)��0u���b�б�لb�!����M �
�
F����hS�3`"J
3��#AɊ�S@<ZW�e�� ��h�HPAjV��@��L.�>C�DD�
X.;�s2�u����#)R'6�j_�7Nؐ0Ω�AN�D�O�v�^�}�7�l����
��@�� �,�fd��s��!(�6M�������/i�|:�/V� ���){oc�ݷ����ه�]i����(*�+�����M�)j:)���Y������/�(^"(��.{�l 	J��Ys�f�$*�7��G�
#���
+endstream
+endobj
+4490 0 obj <<
+/Type /Page
+/Contents 4491 0 R
+/Resources 4489 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4426 0 R
+/Annots [ 4488 0 R ]
+>> endobj
+4488 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4492 0 obj <<
+/D [4490 0 R /XYZ 89 770.89 null]
+>> endobj
+4213 0 obj <<
+/D [4490 0 R /XYZ 90 721.073 null]
+>> endobj
+4493 0 obj <<
+/D [4490 0 R /XYZ 90 721.073 null]
+>> endobj
+4494 0 obj <<
+/D [4490 0 R /XYZ 90 658.004 null]
+>> endobj
+4495 0 obj <<
+/D [4490 0 R /XYZ 90 604.315 null]
+>> endobj
+4214 0 obj <<
+/D [4490 0 R /XYZ 90 557.689 null]
+>> endobj
+4496 0 obj <<
+/D [4490 0 R /XYZ 90 553.206 null]
+>> endobj
+4497 0 obj <<
+/D [4490 0 R /XYZ 90 482.475 null]
+>> endobj
+4498 0 obj <<
+/D [4490 0 R /XYZ 90 428.786 null]
+>> endobj
+4215 0 obj <<
+/D [4490 0 R /XYZ 90 314.096 null]
+>> endobj
+4499 0 obj <<
+/D [4490 0 R /XYZ 90 309.613 null]
+>> endobj
+4500 0 obj <<
+/D [4490 0 R /XYZ 90 241.039 null]
+>> endobj
+4501 0 obj <<
+/D [4490 0 R /XYZ 90 187.35 null]
+>> endobj
+4216 0 obj <<
+/D [4490 0 R /XYZ 90 140.436 null]
+>> endobj
+4502 0 obj <<
+/D [4490 0 R /XYZ 90 135.953 null]
+>> endobj
+4489 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4506 0 obj <<
+/Length 2388      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s��~���)���v�/�T���nj7��Ɏ�<L����m*� ���>��tÛ<��`hN��s�����S��?�|{s��b�AFR�?�$$��
>�#=��q�aFpe��ˇ��f��
/���O�Ceoww�n~�}����{B�� ��|N����֤0	��p��
)��z���0S���*��ٜ
+
��

��v��s�g3��8]�#C�	gV��w�7_o���!���b}��3���� #ft���N\W�Ǜ���rc�+����K�ݦ�,m�e)�^s�\�
���*I���u �w�÷��}w�2��yte���!�]"bL 
�cRa4AF��X�ۼ�"�#O���{�Tn��VI��zH�		CU[����;��)�Y�,
����C9 Z.�%WZ��JيdxJ��\�yA&���k�������E�I�D�	q$GF���2�>cK&�c�A6�d�
(�"ґJ�J��g
��9ᐦE)#����x$aR�D
3o��X��%���%Z%�/Q6c*|ڭ�wz�H��	�	��݅2��jd�����@qj���9�̨_�ٜa&�����q�gUQ�Ƭ�|�9M�1�s��1m
 �zP�.{���s�f^��!��GY�_&`�
�i����z��*�-��b���&��%��3$�"J bݔ\�˖s�e0����`�Z�_�L���s�x��I�[�M�o6�
��j����w��&+�e�z��E�� 븛�f
:
��� &���L!�M�}��9��A�0D�=�D

�ĘE���RHR݁�-�
+)^(޶q
+ 
+��(`�C�܎'
H��a���
�6ɲ{j0k�C8I<�{�>��F�i�ڂ��h9S���2��!�Z[3�����|hQY��i�5�0��bFD���)�)
Afi�߆P�@���n#�U�꯾||��{6��I�o*�ƈ9:h��<$:��mq �t���K�����OI�J��s
�t��\1����)E�����
N
�(O)4�x��4Rv^d� �r���.�U����V���0n1���, �Z�W�P�굡6�k%��y���LW)Y���L�M#"��%:T) �`J�/j�MP兝EЮS�������L�g��E��\��97��C9�Q5?�7숐�Y� ϭ���9��>�s��7�4�z�A@d����Q�譹^�?���
+�
+EOuR��D�z�E� C�
�xnH],�<��D���W.�+�S��w��
6Ĕ���6$^A_��0�LF_'\gE_;
����������U�/�׋
s8U�Dr��~v��B�Iₔ��3��Q�&�SoR�B
�6`u��M��L�I�
��<߭]��o�	������R?��n
-c�d��a�����p͈v�j�
&�I��� #��ݪT6�Sƶ�W�)*_fq��J-���5�
�'=
q�@
�
��
y�W����Vl���
L�!yH� 'c��U��@޵����h���e�'u
�t��+M��
�?�}�!�!��4�i 0�4�ѫ�?3���0O7�kR<�5
@=Hc��	�P	ݞsOu��]�aΕ�oz�4
`]��P}��\�#����FTց��K�#͆9�m7QOj: uÌ�M�2���LJ������q�haѓ�t��W-���u�q���jآF.i!0�
+s'B��=�8D䔄gr��S	Y�iNyC����0�7��X�J%z[--�{����w�W��ѕ׆�[q{�|5ö��M���%���(d����R
�M�_�A��1����;� n�l��R�������)WZ1��R+=��>
+�Zi�B;R�K�)P/2yc~�BK��:�;���x/>�U^n���r\��ay�̣��D3�}ZĄ�'11r��H���1Q��BL`;��i���#Ĥ1� 1�RL�L8AL8�Hj��&
��i�v��H�j�ImI�֤�S8���&°Anp�������e�Ԯ�S!r��{.ʚn=��(��y�)['�c$e��Qk$�ꮣ���py.a����W$���K|�P�*j�3��%:,e�%ˉ�<
R6���%�Mg:�W�R�����pl��N80J�#��������{Ӧ+sA�op4�/#�
��3��<k����uZ��l b��6<�a
��w����v��E�zC�A�d�x�֕�5Y��R���'��*>dk��"ޞ��.��`�W�MR
,���Q�(;�����j�9���B������'�=�f&DX��F�.*�j���[�Y�{�� ��bm��4��w^���_n���ձ=v
�K�y.�������)��'���>5�dU��Y��zS��$��k#�B��`�~�W�l�W0!&JQ7�y�^V�nX��O������@�
+endstream
+endobj
+4505 0 obj <<
+/Type /Page
+/Contents 4506 0 R
+/Resources 4504 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4518 0 R
+/Annots [ 4503 0 R ]
+>> endobj
+4503 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4507 0 obj <<
+/D [4505 0 R /XYZ 89 770.89 null]
+>> endobj
+4508 0 obj <<
+/D [4505 0 R /XYZ 90 720.814 null]
+>> endobj
+4509 0 obj <<
+/D [4505 0 R /XYZ 90 667.125 null]
+>> endobj
+4217 0 obj <<
+/D [4505 0 R /XYZ 90 620.5 null]
+>> endobj
+4510 0 obj <<
+/D [4505 0 R /XYZ 90 616.017 null]
+>> endobj
+4511 0 obj <<
+/D [4505 0 R /XYZ 90 545.286 null]
+>> endobj
+4512 0 obj <<
+/D [4505 0 R /XYZ 90 479.641 null]
+>> endobj
+4218 0 obj <<
+/D [4505 0 R /XYZ 90 364.951 null]
+>> endobj
+4513 0 obj <<
+/D [4505 0 R /XYZ 90 360.468 null]
+>> endobj
+4514 0 obj <<
+/D [4505 0 R /XYZ 90 293.896 null]
+>> endobj
+4515 0 obj <<
+/D [4505 0 R /XYZ 90 240.207 null]
+>> endobj
+4219 0 obj <<
+/D [4505 0 R /XYZ 90 205.537 null]
+>> endobj
+4516 0 obj <<
+/D [4505 0 R /XYZ 90 201.054 null]
+>> endobj
+4517 0 obj <<
+/D [4505 0 R /XYZ 90 132.326 null]
+>> endobj
+4504 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4523 0 obj <<
+/Length 2157      
+/Filter /FlateDecode
+>>
+stream
+x��Zے�6}���S��Zap�L����r��ubm^
���8V$R�(O��� x�HI#a�T
o��}Ї��u������b�AFR����
����p>�0�1`R#b$�U�~��7��of�쳛���?n<�q )
��7�?�`�
0bF�e�u�)��*xw��
���
��
���6c
(��
���xS$Y�-t yЅ��vp0x,������	҇t`��ai8b�#�К #�
,�#ه��u ���#
+�\��qp�Aq��
�BfF�=�m���K�	���h�,>F���p�[�i��5��98�y5́ ���2��꘥w,�� �z��
�lBE��N�T�0���ݾ���1I�<�
c�)�m��n��ֵ�@"��FQ��!i��6�!p0�M^Gy�ƾH�;[Ȩi�γ�&*�O�
w�`��&.GS�BŽ��5�O#+)m
���MVă4���6����:�J��p��s{&�dB­;}�
.L�kT<DE}V���<�O�������I�ugy
aIӸ���N����rw��7q����ҽ
�|W

�c���h��,O7��ڂ�F
U�[$l�9�y�GIZl�
 ���sL
�q�^5�'�>>$�
+��/��8{W�B��t�Njd^DeL�Q��{�0rM�t5�.�l�.�
+p�����;�,��u�i
/�E5:;	vn�� j��|Ϙ
��n�p�v��E�d
�VI�t�ړu\<d�*�l��*
~���
��Y���$�?>&����1�a�˫�Tb
�h
|�F_���?��H/�rRR��h)��5�l�l�'QQ=Xe٦��^����E�W�$���)��S
���
�4b@�)�`V�7��e��+�}])$�����k��@!ś�H�hmMM�z�� ���������YF�Z at bA*%5��>�hN��gtk�����
.3my���<����]M2�$c
+2ZBAhz��)���!�C�e
ڃ�-���
�U(Daa��k���N!$��.N��m�L�\T,7�;�
g�h_?�Y��jZ~S;Gw�!H�&
����-�1�2U��K�}j N�
3�OR���ñ��BPS���N��m���ܝ��^�	q��G���
j7���1�˵k�1�
i���~�D���F �v omNG90E�N�
+T��zx��P�bJ��5���U�w�R�p��T��"�k$�L#.x7���H
+7�
F?Xam4�
+{Ø
��ˑ*�?U�P,�ٽ��p�n;U��+�����R{����V�sp�$޿'p`>ƘW��
�.�8A�}~O�@^�=X
))�}P�ii�Aa��
?(�,��(,��/
+��k<�`ތ2~���,eѡW�/Q�sJ��$
+Pr��G$�l��1�b`�#
$J���" E��(�+,_B���
++#����u�!�K�:�K^�Ӷ��:�;�"4U(V� �%C�T>�����
�gXq�8�X�iif;�s��hK{��
+Q����Re[q���)#���
{ďx;ƿ\�\�Y4��ߤX��XazG,�)(�5ܓb�H�
�`�դM�$˕��,�q�FS�94���� �>#�bħij�Ȕw�B
�"�ki���2�L��{�,
�k$
�P��M�����,{�^(Yz�~��et
f~5��O"���sb^�yR�P�a�/Z�s����UN�r�h��sD�>!Z���<I�lr���m�	�K5��;
��P?Z��}�k����#���vw�y���8"$C����M�k9;�
h[�� LaD6L�BⰀ��-ϒP�a��P={��
(�gA���l"�)�z��v�4ZND��c�!}��0��;HG�>������C�&IA4�%�g�
�,v@#E�I!�P�@�1�;�vJO\9�A=��l IΕ�s�,�q�}�� ���&��O�~k�ܻ� �nI�-d��e
�fԧ��@^#1�
+�oç����3�B�ѳ���l?��ro������f�U�C+z�7�Ț��[��V�B”J@?P�(�u�ˇ�;Ս��k��X
7�i
XG1�i����((�M�{�������!�����tW�
+Q�"�����|�TsP3m�X�"M����]\��ԍ��f�?���uƤ@��f��(6w���v�m�.D�a�۾l�;��t�Ց��ps�[u�����?����
+endstream
+endobj
+4522 0 obj <<
+/Type /Page
+/Contents 4523 0 R
+/Resources 4521 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4518 0 R
+/Annots [ 4519 0 R 4526 0 R 4520 0 R ]
+>> endobj
+4519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.9 615.155 513.996 626.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a501e789db7ee01e6987cabd000d8dee3) >>
+>> endobj
+4526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 603.2 120.665 614.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a501e789db7ee01e6987cabd000d8dee3) >>
+>> endobj
+4520 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4524 0 obj <<
+/D [4522 0 R /XYZ 89 770.89 null]
+>> endobj
+4525 0 obj <<
+/D [4522 0 R /XYZ 90 718.682 null]
+>> endobj
+4220 0 obj <<
+/D [4522 0 R /XYZ 90 594.233 null]
+>> endobj
+4527 0 obj <<
+/D [4522 0 R /XYZ 90 589.75 null]
+>> endobj
+4528 0 obj <<
+/D [4522 0 R /XYZ 90 521.176 null]
+>> endobj
+4529 0 obj <<
+/D [4522 0 R /XYZ 90 467.487 null]
+>> endobj
+4221 0 obj <<
+/D [4522 0 R /XYZ 90 432.817 null]
+>> endobj
+4530 0 obj <<
+/D [4522 0 R /XYZ 90 428.334 null]
+>> endobj
+4531 0 obj <<
+/D [4522 0 R /XYZ 90 357.603 null]
+>> endobj
+4532 0 obj <<
+/D [4522 0 R /XYZ 90 303.914 null]
+>> endobj
+4222 0 obj <<
+/D [4522 0 R /XYZ 90 269.244 null]
+>> endobj
+4533 0 obj <<
+/D [4522 0 R /XYZ 90 264.761 null]
+>> endobj
+4534 0 obj <<
+/D [4522 0 R /XYZ 90 194.03 null]
+>> endobj
+4535 0 obj <<
+/D [4522 0 R /XYZ 90 140.341 null]
+>> endobj
+4223 0 obj <<
+/D [4522 0 R /XYZ 90 81.969 null]
+>> endobj
+4536 0 obj <<
+/D [4522 0 R /XYZ 90 77.486 null]
+>> endobj
+4521 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4543 0 obj <<
+/Length 2498      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~���S+�x��-д�`�p���a�0h���J�BR������!)�L�Jo^�`Az8:3�2�|�!��c����
lo�������"���2�}�
�7HH�k
}����`�'7S�'q���n�O���S2/⻟��".����ͿL?��p����D"%�㰞�'?%X�턷��{�P���9�L3�o��,��T�����I�\-�*�#?'I1%z�d32D�	��
+������
bpD�5R:�-/>|��
� +2���n�2��u�������kȖy	A�Zk]�����f�/
��ToY1������y�d��*l̀M�D�-�"a��fƧ)�<��B���I�vi�ӻ�$ͮ=[3���W�h1�W�TM
kӆNfB#A�s
�f��)2ڴ�~�^&	D>��YYq�U�wƿ���Ka��c�KJ�G� �Q�t+���s	�ң�f���������NAdc�Y�M�7jg��e��i��ِ�(
��v�2��cb����� &��&�c
#C��EۤUR���ژ�ɟk�D�\"�[�����43�O�G
����&}H�E�%��MZ�z#qם
kJf�������u6���0R` �z���\m
�
�8o5}ȋm���U��q*&�r~,��guU�,�h
�Y�}�s�񪧴og���9(0Z�:�<{����$�&��	). �U6��IJܾ����S��>�.���fw��Sz���DD��$��o�.�8�sJ(���� 8X2��&�p���s��2�5(�����r��'��d��<h���9C�� ���1Cll�.Ą����n�7 �}!f4�)
I
+���~ܥ�8�9(���U�u��"�)e��.�K���d��=l�=���vV�ϠZ�J����K�ٓ��}қ���D���#�M�����z_�K�ܯg�-:  �'R�Pc�<8��^T�
+~�#�*0�U�ڸ�� �iԆǟ������B��}���ɼ����2�_<��ER��i��%����i at C�ݚ���$��
�_���s|z�
�:+�2:�9>]bo�{�Z�A���
ŽI��2KV��7TR(�B���!G9�6_��n�R�'$vW�-���#ҍ8�X4B�$z�]�	E�Y1
+�&�����ǓO�"���Ŕ�YV�v>�h`}lTMA� ��*c
��ڥj10	jz�Y������=��S�k
x*��8���`���
uZj��e����
+2��"ٗ�P&yNd"	��=�g�<2]A�p]�MCg�`��m�I1�F4�����S^��e�\ה$��3GPY�Y�?5��
�nME�"�u����P�6!�l
7���'i��� m��ˤ^���{��$��tO�	�C�L�hFh2mV�1�\��h2���yS�
�K
$������d\�1d���
+x�D�0��ڧQ��?�m���k��&�r����G�^�=��c�~��"��&�,����Ej1�����̼/�K��(�]!Mڸ��VO^���dV����Z�b�f�mrv�I
k���S�0�(dX�.��!<b���.Y�flv����K�����MU��mȜ֑1Hk
W+A|�
3
a9&�
]�ÓL����Ӑ�H��x=�n?>s��8�Gۑ��N�w�>g\w\<
�4����n�k4
 Ra=fP�,�8,� 2K1:sc
����� ӟ4�%zL��ysc� ��1�15m�ۖ�'2�@�!������WP �|�¥A�Y^'�x_��G ��]A����}8|�@$&f��z�̽o©F$E�NR�*I��B�������WʻwIճ��(R���
��P����Ӌ7�Ì@��b��PCvSj�Ŋ�,
�
��7Q�)�]��,v��Q��nʤ�6�s3��Cmb,{� ������ζ�1�ҙ���
�W���B�q�V�K
B�ћ �-^6öp+Om�W�6�Q��dD:�D�(�e��H��9$	j-��EOz�w�fz�M��
�I�V|U�s��Á"	Sc����#<DK������QA�+�t�����F���	OGb��x�
�엘|4�3��
��R��;Ê���@π�P2� �	"JD���%����N�
r	��CD0�=�;�mT@�J�� ��ˇ�v�˿�Ho�X�����6��G��)��a4|�A"7�GΒ��q����2�3�Wb\i�`E8

�?��Q��Bə�
s�;{`~(�q%0�
Ð�`���֟�= 'hq0q�P�
y�_���
L�C}��#�ӣ�;h?v����p/KA�`����=R�En&����g�)��+�B�a)���Foa����/eR�q*lo����8[�5�����`�־�U�h/�~��'����7j�~�p��l��	���Z]_]ݯ�${DP�_�`G� ��7�˼h���oT��m��IIk�A�r��r���s�
6?���.Y��
��)'��Q�U
+endstream
+endobj
+4542 0 obj <<
+/Type /Page
+/Contents 4543 0 R
+/Resources 4541 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4518 0 R
+/Annots [ 4537 0 R 4538 0 R 4539 0 R 4540 0 R ]
+>> endobj
+4537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 432.059 212.124 442.963]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+4538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 270.489 210.103 281.393]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+4539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 167.081 485.603 179.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4540 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4544 0 obj <<
+/D [4542 0 R /XYZ 89 770.89 null]
+>> endobj
+4545 0 obj <<
+/D [4542 0 R /XYZ 90 658.004 null]
+>> endobj
+4546 0 obj <<
+/D [4542 0 R /XYZ 90 568.051 null]
+>> endobj
+4224 0 obj <<
+/D [4542 0 R /XYZ 90 477.271 null]
+>> endobj
+4547 0 obj <<
+/D [4542 0 R /XYZ 90 472.788 null]
+>> endobj
+4548 0 obj <<
+/D [4542 0 R /XYZ 90 406.216 null]
+>> endobj
+4549 0 obj <<
+/D [4542 0 R /XYZ 90 352.527 null]
+>> endobj
+4225 0 obj <<
+/D [4542 0 R /XYZ 90 317.857 null]
+>> endobj
+4550 0 obj <<
+/D [4542 0 R /XYZ 90 313.374 null]
+>> endobj
+4551 0 obj <<
+/D [4542 0 R /XYZ 90 244.645 null]
+>> endobj
+4552 0 obj <<
+/D [4542 0 R /XYZ 90 190.956 null]
+>> endobj
+4226 0 obj <<
+/D [4542 0 R /XYZ 90 143.127 null]
+>> endobj
+4553 0 obj <<
+/D [4542 0 R /XYZ 90 138.644 null]
+>> endobj
+4541 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4559 0 obj <<
+/Length 2684      
+/Filter /FlateDecode
+>>
+stream
+x��[ے��}�W�)!��ٹ_6��ؑ]r
G�6~�U*�.��
+	� ���>=�
1 @�ÔR�'� ��3}��L�G�~�|{3��^�� #��n����		��wS����͏�#�-w���|��盷��ɫ��o?ሔR:�[M޽��=��1ˆ
}t�"N|.���NpeK󉨰����А��� �y�C�ҜW��M����3�@䁊R�Up`<�HPu�z7A�p-���	�0�4
1p���4AF��X��+Ҿ����(�r%$O�EKJ�
�r!af�(�W:g[�__�ٌ��S�L�?������n�dE�!P���,�@a8  �
)c
���T��H)6�2o�7��zF��c6�S���Ž��{ڞ!N����_1f�CJ�BF7���|�7@"�����G�H+U?�G�Fܡ��'���)�f
�4O���j��2Aǝ%����A�` Y�D�A9J��e�K ��2�b�C
��c<-��fI��~U)$i�?�Ox�R�y���I�xe�F����/="��A���?���p��ӌ��:���.D#MM���O=� r�c [...]
dI��B",Xpr'��q��]@�#w–QBC����1�N ��`a(vr�5��
�Lv��+�s��|o
��I
��d��wʱ�̧w���
�;N����(ݮ��>ng�5 Kث�	F�"w��΢B
��l
�#�a��:H�k@�P
��櫭�ݡ^A� z��f���Lg�Nn�����:9���ZKe2#d�)�+J|�TVSYX7_H�L�
a�y�쎒ZiN�Z�e��dO�M��K�e�%��_E����׋ٜqS�K{QF��,�.{y���X!��@m��+���|�
g7 at J8H}����������J�Q���gB���v��%�,�]rr���I��a,�P����c�Mz��-RL�`]��m�:$F��:�ju/!�
�"2����|�kHF%���<�hd<h��%r
��
+l,�9К�wFz&�o�+�wl�|g
�$<l�v�̓l��dh%|6O�6k/Ԭ�O���&y��%=DW0����[��
+������螊�U���A4�#3�F(%��_J��c3���p_Tj����(1^�k�2KyXض�d:ŠP
�-�9�F�*�-r�5��
�L
��+�rD�|o
�����m�Q2O)f�,��z�K)Ƈ�����r��3ڢ�2���U
��PN_@��)�g���à8�
��A���Q�&���nk�(����4�Z�0����-â�U	Y�@��5�J=�
k�U�Q�c�Q�!qI�̙��
����"�"�a3�
�`�
rA�����+S-V�
+4��a�s�����o�d��O�<�,#
L�w�eZ�h��7����0��KL���4�t���yk
=��<�G���
�)�@����t
m���5t�6MJ
+kU �n�#��
�O!��-��9�P�!���gR��A�;���0�\ʠ��2
�
�2d����%r
�� mt0�
r�5�
�L���+v��|o
��$�O*�<,��<ɟ)�@
$������Y�!�
@�����t"��"�n���'H�C�
[ݳ�.$�Ҁ�,��|��'8󽛮���\O+?8Vy8{n�q�/3C!��"���1
���
O�$�~�7� ��&���3
�(�R��fI�x�i���a��R��
������6O���A�)d9���։��]Z���3�ڕ��'R�\���!�U�]��������:
��
@=��ͽ�>O�>�
��	��$[��,.ֹ�zl��>gS
g{��a��m1K �hu}�d0�P�F={A�d1���23���E	����G�-A
\HXcbכ�������t���ޥ�
"�ݻ�ޝ�0���X첊_�o�x�q+����K3>C
I���>�����$_�7Q�@Q$��4�OU~)�O��ǭ��1w��s��v�4y3�)e
ꍢCyj_�^t�ٞ:av�
�2Rq�7���9�jX
��lj����%+dR���ك8|>Q
+.ѭ^��BuK�Yw at vVpr&$�Ayx��Y{1�3D�n����^$�{n���cz������}�r�'��t}�'(:D 1�a�{�X�D]h�%�,�,�@�4�Y�#�X�V%���gK?�Z�4��`��Wd��`}Ԟ��G3

�K
T�%:Pi�46a0��#
��3��Q;u���YӋ��5
�|z��{�_�]�.^V�uH� *d�-uZ3��E;�.w�bY(z`Ϟ�At�D��+�����D�������k��ҝ��mb�c��������~��q�zŢ��A�^�
���k�م.�������{������$��L�iU��
g�;MOeI��A0�Kh���mR��Ҷ�4��m�Hc�&���<�����v��M�t�^
�y�/���Yԡ�Z�Mw
n�ܞ��1���f�O
+endstream
+endobj
+4558 0 obj <<
+/Type /Page
+/Contents 4559 0 R
+/Resources 4557 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4518 0 R
+/Annots [ 4554 0 R 4555 0 R 4556 0 R ]
+>> endobj
+4554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.275 302.598 293.971 313.502]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+4555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.269 166.671 238.02 177.575]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+4556 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4560 0 obj <<
+/D [4558 0 R /XYZ 89 770.89 null]
+>> endobj
+4561 0 obj <<
+/D [4558 0 R /XYZ 90 718.682 null]
+>> endobj
+4227 0 obj <<
+/D [4558 0 R /XYZ 90 684.012 null]
+>> endobj
+4562 0 obj <<
+/D [4558 0 R /XYZ 90 679.529 null]
+>> endobj
+4563 0 obj <<
+/D [4558 0 R /XYZ 90 618.621 null]
+>> endobj
+4228 0 obj <<
+/D [4558 0 R /XYZ 90 583.951 null]
+>> endobj
+4564 0 obj <<
+/D [4558 0 R /XYZ 90 579.468 null]
+>> endobj
+4565 0 obj <<
+/D [4558 0 R /XYZ 90 496.652 null]
+>> endobj
+4229 0 obj <<
+/D [4558 0 R /XYZ 90 461.982 null]
+>> endobj
+4566 0 obj <<
+/D [4558 0 R /XYZ 90 457.499 null]
+>> endobj
+4567 0 obj <<
+/D [4558 0 R /XYZ 90 396.591 null]
+>> endobj
+4304 0 obj <<
+/D [4558 0 R /XYZ 90 361.921 null]
+>> endobj
+4568 0 obj <<
+/D [4558 0 R /XYZ 90 357.438 null]
+>> endobj
+4569 0 obj <<
+/D [4558 0 R /XYZ 90 272.62 null]
+>> endobj
+4305 0 obj <<
+/D [4558 0 R /XYZ 90 237.95 null]
+>> endobj
+4570 0 obj <<
+/D [4558 0 R /XYZ 90 233.467 null]
+>> endobj
+4571 0 obj <<
+/D [4558 0 R /XYZ 90 138.826 null]
+>> endobj
+4557 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4578 0 obj <<
+/Length 3210      
+/Filter /FlateDecode
+>>
+stream
+x��\[s�~���S+��X�/n��$M2I�3۬��$�CK�ũn���u~}.�	�h�ۼ�ŢH�� ���d�=f8������W�(�d$���,38S� !��4�yD0��[�1
�<ʫe��͘��z�</�U��u�P����ݗ��_��
!-�DJǡ?'��I�)tB������B�	n�|�!����W�|�
�R�G�cCG�r��w���C1+�1ѣb5�[�="\Y�7_���vC@
Έ�
���&˛���n�aČ�>�FˌS�����np���Qa/�G�n�
�6ðaHc�U�������j�:yԅ��vp�<�����n���Zb?�LD�ɤ����3�3��_,��'9�h_kIt�	
� �*�YK�_���3�b��K��M���՘���|QN��՘���ӲX��ju����
9L
��
��1��T'�)qdY
'���Z��}X�o7�r�M���1�k{����\�u��F}(��m	�)�
/�����c2J�%1ª����&�	5�iQ7�WS߆F�j���n�
�,52dt�f7/��;�
+?�i	H؂���w�[*�6�����[�&��&ߕ�����gr��M���ɱc��P3�V�j�����n�I�Q4(0KM�T���e��4B�-E0�[y�C�t]V"%fPwx�����J�W
7�X�b"�]
ԎåRH�
.��H�B�7
vϛb�/-6$��B�m��HЏ�����Ѻ��B�AD��$��Ľ�u&|�8�s4
ww�
PNW�q*��FVB
+W�$*)X�iV�x]'H3/�lL��e�g�~�6�gpG
.���e>�6��|��,pb�l\QM���M��̭
S�ۭ5RJ��`�DZģ�R�	�`
�&���
+�2J׵;
���rU�ջol�
+x]�g���,YG���/�/�9�-�/f	�(X��
+��^���0d귔"����b�-W6 �v�_�
	Æp�� �5����Em���÷7��N�|f�(ܑ��]/�
@�XD�
/%#�*L��G�U��y���j��qn/�ͦ\=�/��p"
��'P9��a�-�\�rŽGS�2
+&5���M�����bkC�5߭O��Ť�"�������IM�!:#uC�qO�X���0@��x
���F��������)x�
^R	E�b�t'����J �^(s:�	��M�/�#w��j at D(�,")ܼR�3P�(#=��!
�L��q& ���d
nխ
܉�������s�&��!wcD��"_���%z�1�N���4;�9�a�	�mOrr�(�\[	8F�haKL�/��> 1BG=�8��\l���n��H����F �d������� �/��yx2-<b�A����G�/
q\3
�vd_��/^�n*8��]��d]4
L�bU����o�C
F�T�k'�S7���+ȐVr�ė�vS�	���<7XѐU�'��|W�Y��kI����Z:l(�n�q֬��@/c�q�i;P����
+j_��<P����$ԑ=�oz.��t��F���i��
�9�
���#Hpv:�&�REd��d\�^��!�L
�Z���i�
#�����2��b�v��
g0�;�\�)Xy�"�k+p+���M�Q}�i�� �*Ó�a���ɮ�
	 ��]^�+}R
+����X���#�e:O⾻8l���!�x*� ��ՙ���������+,�OQ�8u*�����d9g3�=!�6s�`_����v�c��\'��W�MP`Nט
+"���N�
c��?U\R(�!�G,H͕�Oɕ*�͕�Ӽ#�^/���W�
+���]'Y��Q��U
+��M�)���R
+^�:QB�&>�,��,�B����Yj��s�-��,!�
+��,��;Yvz[��T�ݓ�
���M��
�ҙB���+(���x
!�!�tƌt���H�ry�%i(���B�rw�L��8(+��3������
+�#n�
H�� �dj��6�Gj������Ŏ���z�"
�h#ς�fQ��Q�)b[�h
��:��1
�@r�}R����[]Kbl������0dF�y`��|̓j���~k�a��
3, ISg�a����s�y�V��¨"� ŏ�ネ@l�ז;���R!
,X����	�(�/!�mUq�"�aE`"�$��]���A	ffS-�_D0_�G�������'(
��$��Ý]>�n��H|Z�K�7�D<�Jh�
t"�L��nv� W
N�
��T&��H�}��%�q��xO����[/X]>�NX��
�u1�D+
���0��hG-��H2\�E�u����֧AV��^����x��|�sI G��t��י;���� Oo�W�w&������d\
	ڋ%�l'�r
��|'�r�0��^�7d �p��w�
eqN�Cl��B4����1�y���
�
�}�ƅf��@��
^#��_�9�uį�l��
�g�Ҿ�~I"[�=��>��y����ww=M
å0 �VG2r�1\���
}�O�
+r%3H�Ķ��
 �/:�����Ó�qy�1(n������z��E�L�������y�"�!�iu�����6���ۣ�')z���O�3�>TO��SH��DQ$���
+�!�����(zA��w��^Iȁu��9������]��6�:I�
����i
����)z
vgcS=�����H�A�H$D�ѻN=��.�i� �K5x��؄^�N�nW^�
x�y���ڏ;v[��:�	�n�`U��"���k��E�Q���A��,�����C���T�@�C�>z��%fC)�ٽy
��p�!�cd��:���εL��c-	��Q�O^�Ӡ#�
�3��rHH6�
ć9p�'�v[���ք�DF�
%�
�Ѭ��u}��|$����l���P��JyѾ���?f[�D�ܔX�����a9莄��J_�!q�Iޮ�EC�-�Y���R��-���G�^�ޒ4_m����	H�
V�nh�v
+��Pa��J]q��=�%�or}�)�D_[��S��J.V�����.gV���B*BY���PO���Kx}�P�_U����M8\�㶨�:bT���WO5_n�p`oO����T�n
�[ԉ�W��Y}�����{:r�2�w��ݫWO��b��&��q:��i��lVSL�uU��

P�V4��	��ֳ�,!&JQע}�
�/���[��k��������J
+endstream
+endobj
+4577 0 obj <<
+/Type /Page
+/Contents 4578 0 R
+/Resources 4576 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4518 0 R
+/Annots [ 4572 0 R 4573 0 R 4574 0 R 4575 0 R ]
+>> endobj
+4572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.953 612.733 250.388 623.637]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+4573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.089 359.406 246.767 370.31]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+4574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.899 133.982 431.977 146.9]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4575 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4579 0 obj <<
+/D [4577 0 R /XYZ 89 770.89 null]
+>> endobj
+4580 0 obj <<
+/D [4577 0 R /XYZ 90 718.682 null]
+>> endobj
+4306 0 obj <<
+/D [4577 0 R /XYZ 90 672.057 null]
+>> endobj
+4581 0 obj <<
+/D [4577 0 R /XYZ 90 667.574 null]
+>> endobj
+4582 0 obj <<
+/D [4577 0 R /XYZ 90 584.887 null]
+>> endobj
+4583 0 obj <<
+/D [4577 0 R /XYZ 90 506.89 null]
+>> endobj
+4307 0 obj <<
+/D [4577 0 R /XYZ 364.289 430.685 null]
+>> endobj
+4584 0 obj <<
+/D [4577 0 R /XYZ 90 424.045 null]
+>> endobj
+4585 0 obj <<
+/D [4577 0 R /XYZ 90 331.561 null]
+>> endobj
+4586 0 obj <<
+/D [4577 0 R /XYZ 90 253.164 null]
+>> endobj
+4308 0 obj <<
+/D [4577 0 R /XYZ 90 206.539 null]
+>> endobj
+4587 0 obj <<
+/D [4577 0 R /XYZ 90 202.056 null]
+>> endobj
+4588 0 obj <<
+/D [4577 0 R /XYZ 90 107.415 null]
+>> endobj
+4576 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4595 0 obj <<
+/Length 2838      
+/Filter /FlateDecode
+>>
+stream
+x��\ے��}߯�SBV���_6���Q\v
G�6~�]*j��ʒ\��%��sf0 1 r�Q�N���AOwϙ��ӠhqW�ⳋO�.��͈���.�n
G
#
Q�n�oGL���W_B[œ�S��������WW��w/�.~�`������������iq��_�g�waм�\��C���_4�B��W����8ƈ�nX�&�K�!����ԐT�f�aL*68�ɖӘ�$��rb$�\T�9
�\�UI��4��3�Ѵ����q�*su_�'\����\M7�U�qy[���߯fw����~����ֳ����v���;J�"�)�Ly3��z�\�a�Z�4agX�#�Y
��0�_b�:#��z�t.�c�AGM�ham��7�b9�-������]�N;��p�T���zD
<|���x�� �R�U����.7�<}�ϭ�̎��E��n�������F�ID[P�v� �q��'�>��xg����`~�s�c�49Q~��F2�Dsՠ��`a
�T�GH�*�x]�EZWn�ܙb����B�����8�O�I~��ާ�pʟ����+�?֒�3��*�X���p a�P)\⠐�ڬ77����X�Ӈ��kl a�
4�zN�w*r�	k �5TI�6�&����Ej���j�7�;D%�hv�C2�ZJK�u�Ӊ��I
#|;v��XD��JL&��ߙ�٨o.M	5�~���C��ت�A>L�1<YVG�f�DL�gq�����O�*+Cnf���U�p-G������z9�nfo
bܬ3�^GA���T?N{m��J�|f��4�*���8c�h���8�Q����-��fСB������?xQpEހx����ҕ���
J�瀻�Q����?>L7e�p�~����ՈD��vol><���<`��>���G�RĪb�ɼ%�*#5���,�¤��.�M����}�lH4
4 ��_g�grHg�W���O�\�
+x���ov�8�Q����81��
��5
���BK"1>Y��mL�vg��@f�ɇŪ$3#a�ͧc
i��
+>o�YD��R��;�08����&��Ci�
�OMG�zDO�d@�J���%�����Շ���C�,F!�otZ���g=�.8l��]#���h�}�m ��lQNW�_��IsL�wE[��.�]��ĹFl���\���T4�~�,6�gu‘�Cr�-� 
+�rƜ���(cbŲYMg���e���8�x|���J�B)�~U���\\�b
��	2�MZ]q;�S�Z+K���n~�\�})I�
�O_��a�o�$�f�a�U	��� mw�&�!�/{�j	�X��V!Om�դUd���z���p�]��$����},�7����e���.b���.�oÀ�:�#��i�\	�"Kga��b8Q�k
n*��
+�>��@�Z��hYB�w�"!��F�1����貖@T��j8NJ�濝ݧ
a�P�q:�͈�׵�_{�F7؅�$�Սq�Z���*�!i'����&��
+L��m�ĖGR:��v��-MW/g��V�E��!�)#q��C>�@ⱥr�#�G�j��h{�N8�pxa
* s��}�s��
+ئ���F��d��P� �g$I�K
t��I.��D@�
�
i,N^��Q�8�3��%=����
��+�-�W��t����zc
ED�n�~�@$�6'�rK�Ї��"�Ȃ>�B�.��Z�V<mԄ�� <O�~�չ��ǁ�d�/-l�Í���%��
+,
+�Q�N�TǮyz��,U�a�V��';����@EYN��X��?�X�.�D��j�]����][���.���ݏIHd.kx�ħuɄCA,d�.���]��J
+�a�
��'M�.YK�]2���K��κK�1�.Yb�o]�ߺd?��䭲?xA��6o@<G��.v�ƥ]2�1�d����@�
wɴ��uɐ	eh�i!�ɔS��d�g����W
��41V�
=�&s��ef�ut&�Ȁ��"�(��6�?,a��b�~rS�m�����Y���u__�Y�
s\;Ml�O�4�2B
��V��cY��_�m�衎��'��e���N�K����b�V<� @���
��46`�e�I����>},v0i��
���_��
^Ot� �p��2�[���^8�4�[%u1�{i�J:
ɬ�
����j�Y��l?��u8���p�c"��kĩ4%�uu:r2�~�VW~�rV��%���
B\
Q#g at U#9�N%{��s�
�LN�Ǒ��,�����_}�49i�_b�'�_��ۼ��Ok^��N?���߼8]��K�М͋�+���e
+>HQ�sd[����
>��я��
W�zGѶ�[��!�f�N�.�i�-3�%���p���JS|�a�1O0~ ��-�m�6
+9��e(p6s��Қ��ZS���q���m�M)��
Gf��T��.�eAw��Pt���
��;U� �Y3ͩ
�Ձ�Ƅ
�����W�����?b:K�A6�q�����K�1�Hc�����l��G��/����F*~�����;��2��o~���
CF"ܦ�<DFZ 0Ǽ��3.�w��}�!ґ�
ё&�	��DG�c���o~E|d��p.��w·�����Ĕ�7¹`{��D��
+D>l�H(�H�A>R>7:)?d
�G��K������G��:R��H��ґ@� �w��/��k�OG�� ��ű��F�Z)Q.�G?�ħ�
�l_�/�g���E��%�m�M o�X�iY����6��4-W_�������\�~��(:����i��?�2�\m�Ռ0lQ[�k4��^��֨t�O���/�j�t24�� ��~�y�|���ۻu��#�Vw���a���41�n�ϗ�h�l��� ���/7[��
+endstream
+endobj
+4594 0 obj <<
+/Type /Page
+/Contents 4595 0 R
+/Resources 4593 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4518 0 R
+/Annots [ 4589 0 R 4590 0 R 4591 0 R 4592 0 R ]
+>> endobj
+4589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.307 526.284 434.874 539.201]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.631 291.063 429.297 303.542]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.883 90.687 440.282 103.166]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+4592 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4596 0 obj <<
+/D [4594 0 R /XYZ 89 770.89 null]
+>> endobj
+4597 0 obj <<
+/D [4594 0 R /XYZ 90 645.466 null]
+>> endobj
+4309 0 obj <<
+/D [4594 0 R /XYZ 90 598.841 null]
+>> endobj
+4598 0 obj <<
+/D [4594 0 R /XYZ 90 594.358 null]
+>> endobj
+4599 0 obj <<
+/D [4594 0 R /XYZ 90 499.716 null]
+>> endobj
+4600 0 obj <<
+/D [4594 0 R /XYZ 90 397.011 null]
+>> endobj
+4310 0 obj <<
+/D [4594 0 R /XYZ 90 350.386 null]
+>> endobj
+4601 0 obj <<
+/D [4594 0 R /XYZ 90 345.903 null]
+>> endobj
+4602 0 obj <<
+/D [4594 0 R /XYZ 90 263.217 null]
+>> endobj
+4603 0 obj <<
+/D [4594 0 R /XYZ 90 184.82 null]
+>> endobj
+4311 0 obj <<
+/D [4594 0 R /XYZ 90 150.01 null]
+>> endobj
+4604 0 obj <<
+/D [4594 0 R /XYZ 90 145.527 null]
+>> endobj
+4593 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4611 0 obj <<
+/Length 2921      
+/Filter /FlateDecode
+>>
+stream
+x��\io#���_�O		��}���ڰ�ֶ�/kC�đD��<�������983��5��&Y�a����UuU=�tp?��o.���x��G��zpu7pt`�#J㿦�wCF�
��t�v��p�.&�oG�W�d�N���n�I�ry����藫�^}�XE"��$�
��-�m�Mx��۫�Z�p,��?w�X��|�^��\�����a�x�O6I���.IG���-
9��I�^������A

���;�]\����x�݀���}X�H.�:�x���
[���[����U�e
�8�a�8�i�J�y�H6^I6\�v$���i���l�d��y��4i9[E�GH�s� ��I�jF�R
���e"R)
��:��{����TLs<쩇���p����C��yr���=L����z6�?�܍��L)_�O�S��i�^�V�?�?�b��
��t�)hL8E����J���'���
2
1�f~LG�
���eq����
+��:%��	 ����Y͏��*v��"�)
,�%f`1�g#%E�X
^m���#�O?=�QR�c����C��C��٧�v?D*8,"�Ζx�կ�!J��
�?�&�>H��G��Z`g-��
+={�M���ŒY¨;
��)��]Edx�$�GUI����`e�P�P��Ne�Yo�����H���d>�^OB��Z$��~�v%���'�y� �<�H���;j-p�P8�Oz���|���o��]Vp�$'B���FNyU��������l���k�����fy�>���>��g�������<O:�g����Gju!)��v�K��=�Y�mr(�S�"m��
q��r(�	S��ywHzE��<=���ܟ� ]YE��v�D��sS�i�
�1Ds��"k�Q��r���1Y��^���)�`�h)k����Ͼ1[ͦm���˽��`���Էkי)�]�S�f��˛��r�Lw{[�8q�l�?���m,�����W�Rxoj����U���>W"�Ɩ�����l1!)��h�3��Lmq�u�)�S�I:��$���VVC���<@
L���H��m
uh��-nq�oZ�hƋUof�d�^�FMF��j���Wn����t���r��f�<��3��<���x�E�mn��8�Nn�S���>�ܧ�Hᓓ�b)tH'h,(nY#��j��躝�G�g0�X� ���+��q�Q
D�'YjM'����tWS
�:����sԛ��y��!��4L�Z\*,d���&��b��lp͏9��?��K�̘5�^��IK}����V>��_��p�����V�7j��@mb�Π*ꄼ��
 ~�\g�l�j+�Pd9~D!�bf{#n
����zު᪭TI��)�*˷P��\>&��L� 3�C�ӣ.�����7�waaq�Ս� [...]
ݥT�,�ޮ�;5�u~���H"��O��}7�p�"Ӡ�fl��󇬇Mu�Rþ;�Ђ \�N��P����Z[D��ۂHi�ea(��D!��(�yڲ�&
�u\Y�ݵz��D��K�1:����Kl?78
M�B#!���R�5d;�PC?�8ج��j�u󞐆P��ɗ9�f���<��7��0g�(Q���y�]�DZ�M�~΢��8��
�㼚
�8��g���
O�
�h�����K��y��i�Q���FDRsT
]b�-�ʃE#���O
4M~�\'��(��!��ӧ
cU}J�-�I��X�O�uLͳQR�
����>"�u�Y�A���
(G���Ne�z
ء��
:4>�={������>G�����cB��sv"�V1![b9�Q"
 ��@D
F
E�Q�q��A��R�
pUu2�Y����b�Z�F�D��Ģ��M�=�Z���TÛ�XR��_�hUD��:�DZ7�S���z2��
�$9G�
�g#v4��;=O�M�\�?�q��A����vB7v!���5��Oc�3��]tFO ��</��#�
9B �4c�㡓ЫH�z����<a�^+�ϋx΂�k
��������Yc�.ټ�|�W����**Iu����%��h3
9�s#?ns۩�uщ�����͏��-"Q.+���vJda,Z��5}JޝN��4�9�6��I�
�9�ڦՎL\���y�v���I�.Wy�����x��6�)��]�0F�c�@}�zv�u'AH���M�}d
�PCR��N��I��M�
+������~�;s�j��r;��dQ�:D��#IT}�C<ٓD���o����%,���lX}gT�
&ը.&�2��x&�!:qd	QL��D�>"Up�`�@�zQ����H�a��H=�@��T�s��1�T~��ObR#l�3������TӤR��RS�cT6
+�L�JŦYV
l*u�Օ��M�*��
+
�l*Tl���^6
�l*V7F��67�C�l�<���l��z�
p4���~lj.�"yZw����&0yz/������T�ͦ�/��MU���}u:��
%ΜF���22�˃ߛ9q�]b�pdT2�����D��ԣu \��"S�?X7 R��Ct���A?ˢ���3B�J�D2��>����	��矵$�L�O�]l���V��d*�?�-&�'��=�i�]U�O�L=��� �zmcB.�� 9fѧ(�Le�w�gQ���i�[E��D��p�
:q�%*��<_�iD�������:
���Af��"�ɈDjEb"���R1��@�F<gA�6z
�Z;�g"�"R�g"��zv�u'A�w`�vrb�#�mS��+'�@֮��}�,aaw�s���J3��]�}�&{�u��~��0G��'˧�����+�$�����f�X���1)F����
��v��U�O~�������ի���u��'��ݙy�,�u�?{�+bf�*"l���E`�b�W�
+��5/���
+�Sf��E�O�}�������ob����}�o�4?�T
+endstream
+endobj
+4610 0 obj <<
+/Type /Page
+/Contents 4611 0 R
+/Resources 4609 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4622 0 R
+/Annots [ 4605 0 R 4606 0 R 4608 0 R ]
+>> endobj
+4605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 535.19 422.924 549.906]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+4606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 283.693 425.662 298.408]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+4608 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4612 0 obj <<
+/D [4610 0 R /XYZ 89 770.89 null]
+>> endobj
+4613 0 obj <<
+/D [4610 0 R /XYZ 90 720.814 null]
+>> endobj
+4614 0 obj <<
+/D [4610 0 R /XYZ 90 642.418 null]
+>> endobj
+4312 0 obj <<
+/D [4610 0 R /XYZ 90 607.748 null]
+>> endobj
+4615 0 obj <<
+/D [4610 0 R /XYZ 90 603.264 null]
+>> endobj
+4616 0 obj <<
+/D [4610 0 R /XYZ 90 505.58 null]
+>> endobj
+4617 0 obj <<
+/D [4610 0 R /XYZ 90 402.875 null]
+>> endobj
+4313 0 obj <<
+/D [4610 0 R /XYZ 90 356.25 null]
+>> endobj
+4618 0 obj <<
+/D [4610 0 R /XYZ 90 351.767 null]
+>> endobj
+4619 0 obj <<
+/D [4610 0 R /XYZ 90 254.083 null]
+>> endobj
+4620 0 obj <<
+/D [4610 0 R /XYZ 90 151.378 null]
+>> endobj
+4314 0 obj <<
+/D [4610 0 R /XYZ 90 81.969 null]
+>> endobj
+4621 0 obj <<
+/D [4610 0 R /XYZ 90 77.486 null]
+>> endobj
+4609 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F7 803 0 R /F8 802 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4631 0 obj <<
+/Length 3247      
+/Filter /FlateDecode
+>>
+stream
+x��[[�۶~�_�����`�Nx��$��q�8n�M�I3;��b+�
+I�z�}.�	�eEO�'R$xpp�+�bD��~���W�����W/��t��DL�?NT<�L!.��|�K�y<����		�J�W�����]�yw�A��zs}���W�[
�dr�����x2�����T%�G3h5a��u9�p������p��G#�
C1JE�Ng8���V�e�d���_���R"A���?�
m�$�4O�HW�tFH���1@�sXi��K�$�w
��Ee>��<A�%D��,?f��X
Z�7[�e̐J�!��:N^�j�U����b� a�4V�v�������
��!�����2]סi�7
gZAA�ެi]������ ��"�+��	lW�I��2��ZIo���6�)@B�8���F��ex���{�g,&��@T��W_�� ?�X�I�}�"	��S'W����,�ڎ� �oev�*�7��ޗ���\�7M^�;��[��Su����W�_� �����V��m�<fYX
V)q���Y�K�y� +�r [...]
+��zQ�S£�ªs�1df��n41ALt��V�V���5h�,/��J��v��ûũ��]��a��q���G�@
�!T�A�9A��A|�#.��"A � #���#qG
�3B��*]�BA�TBoa��
+	����2����8��Q��Ɯ:��**���Z�͇�	,���_�'�A6s*��a
���G�� '^D�)����m�d�Yus=�,`��4�I�ϛEh^
��n��M����~�֕�.��-�ڛ'�����US�tF!��!��28��S
GY��q�o��3
�N��!lP�n�C@�(��NG^�QU��͇��C�m$���S�C	���]��
r9��	O$�49S����d0C
S�k�@X��3gN:���^\�"��w6�V�l
�
+� BI ڗ-3����i_<�/�%$� �Kă�86�0���,���&r!1�8�2*,�H�k: (p��#r[�� po��
a
J����$ڻq_$y1���&].��<
K�C��e��6Y`�$�;��dq?��M��7km��X:?�l�P�եw�:��A/I6߉�j?��x���j)�w�9�P
6\ ��5���^��������HJ,���(qP��X�L zz<6:E�$q��%X���@z����9֑�s���ƭ��6
^ȋS,RDz�\wX̶u����"��AB�.o�
��jE�k]��v�r�� ��co�{mo���XV�$�@t�x��0�s<6E�`p�&>�t
��� �౉V
+0
\���	н��0r�L�2��	7�V��5�[�ٷ-Gq�������
���_i'��?�����
 ���e60M�
�x&dG�h!
i
��8���1	�7Kڰ��^�D�
��JU�����8{�Z�(�-v�S�f����۵��ei���V���YX;��Y�[ϱ���0��{,����-v�@R�q�KQ�ȄqɖK�ʓ�{a����إ
��@�%��~i��f�T�
r�RnQ
o���-�ᇏj=̢�vQ
�
��Eu�h�
|I�l�c(r5f<:E�j* �Gj�#IO�5U�\�!Պi[k�Y��
�#�������ۥN".�[����a ��^���]�
�0���EV8be1�_�O�Z���|�R�
����7P�kZכ�M
s��U�c`��\;�ti��QE˲\���ebs羾ߤ�������Πs�fH��XD���FS�����/4���Ϊ�e���7��>���?���69�h���{ �
��J��bJ]��69Fp�
z�����>��f��9� ��&l��ڰ=袏��&���{�]e:�/�U�>
�Z
i�X�̭eF#�'��q���%
��'��
&�k�s�c�<��2}r���}j�\W�9��W ���v��E;Э���_�G+g��g�Qo���6�����n�R�<x&-uq[�s�ޚ�ݣ0c����Þ��vh�pk�L��
+F�h]\��ĺ�(&�s��
++蜮��X}�@-IvL��
�j�)��"�������V�:l��R���5��-��
�@W��ؖ�6r����r˼\�֜���cnL�՘ 
��0ֽ��(Ęm��;c��}�v؝��'��լ�N��%,���g���ϔ�0�0G	�cb��OlHx?6!	x5~'�
�#��s[&>M�р
ĞSmld�Q�72Y'�1������F\g�ƴ�ж�ix��.&o�^�]L �$��	o�<�a�9��G���7	���=2�+\[.p��CS��;�>���H�����]k;���[>�h�,�VǛ�Z
l��/t���9B?/�
0���g�w؜ Er���&��G���HQ�wu���ե�pW��"g��K�>���Ŷ=����#]]����M��ꚛ`�
��R
L:�g��K;�e���e�BR�Qf��.����zڙ3ţ�̙ ^�?��^Af�D�޲�/���H���dGʦxV[����@+�n� �7��M�iR��˴���P�۶�<�i��L�N���_� [...]
+��t�� �
����s�]����)�0C:�	��L��0c[ �śS�
Y
+��
K]O�*���l�;�W�^UZ�md��� �+�M}�Q��6

+]�9L�\�=��y9*�%"ę�we�qw;P�����*^o�
+����-��mI�(�"s����]}�����^��\�Sf
+��>��
�*��*��
Z��p�&B�r�}r
+��A'��ɂ�u��;��� I��H�
����7��KI����y�~�
�|�����@lKn�f[����J�`VW9b�hێ�U���o��?�����m�wi�iUX{{w��-Ya��U�h7��3���Cւ�������]�=���mżh����/o7�uV�#��}ϼ��x�m=�ja�xŤx��˜{�m��E�
+endstream
+endobj
+4630 0 obj <<
+/Type /Page
+/Contents 4631 0 R
+/Resources 4629 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4622 0 R
+/Annots [ 4607 0 R 4623 0 R 4624 0 R 4625 0 R 4626 0 R 4627 0 R 4628 0 R ]
+>> endobj
+4607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 685.85 322.446 696.753]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+4623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 549.923 116.998 560.827]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+4624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 508.727 243.45 522.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.622 351.318 373.222 365.265]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.622 327.009 373.222 340.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 262.794 485.603 275.312]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4628 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4632 0 obj <<
+/D [4630 0 R /XYZ 89 770.89 null]
+>> endobj
+4633 0 obj <<
+/D [4630 0 R /XYZ 90 667.827 null]
+>> endobj
+4315 0 obj <<
+/D [4630 0 R /XYZ 90 633.157 null]
+>> endobj
+4634 0 obj <<
+/D [4630 0 R /XYZ 90 628.674 null]
+>> endobj
+4635 0 obj <<
+/D [4630 0 R /XYZ 90 534.032 null]
+>> endobj
+4636 0 obj <<
+/D [4630 0 R /XYZ 90 286.67 null]
+>> endobj
+4316 0 obj <<
+/D [4630 0 R /XYZ 90 240.045 null]
+>> endobj
+4637 0 obj <<
+/D [4630 0 R /XYZ 90 235.561 null]
+>> endobj
+4638 0 obj <<
+/D [4630 0 R /XYZ 90 164.83 null]
+>> endobj
+4317 0 obj <<
+/D [4630 0 R /XYZ 90 77.486 null]
+>> endobj
+4629 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4646 0 obj <<
+/Length 3035      
+/Filter /FlateDecode
+>>
+stream
+x��[io�F��_�O���>�l��䀳9��7�`6�m
�H�����[�MRl�uX�`��0DQ���WG����q�G�^|y{q��b#���rt�02x��AB»��͘`�'S�1
�L
'�2y{3�x�/>>��"y����H��WW_�&��~w�
!
�DJ�a>'�s?$�&����_#R(
��/va��j���dJ
�N

���"�R��!-&D���
n"�b�^|}{��1xD�5Rzt��x�;
���w#��ѣ�n�r�)��������6,�"�}��lH�̄ Xbke�����F�mC(�$�=k�R�
P}\�Y��
�f�m�D���m��g��nB�8��bN0
O���x����:>��t�fh�pu5��q��v2cq-�C6�\M�Ѧu��[ӈ+
��̗idR	�$t�I% �`�,�"s*��fNM�:�s�U��d
+QUl�ͱAZ�!��!-C#�r��� �7x2̌��"(�R��f�)H0Bx��4���n��o_�US�4�Zd�hp�;C4"�t"ŦL���"�!�X��r���ü��֧��x�[
��7�x�-X>��G�i�F��{��n���_׷�E�i
R�M`O���v���]k2��0+EB�}�&/����*����?>UiV/	RDgE@ٙ
�z��s�D���i^

+���]=��W�y�h�1��~���~^=��7S�ck�G���y���l�A>��?��'�SZ�]%����|	
��~��1L�44�}^i�ʳ�W
�R�G�-��l�.)�
gȐf

+\֡����#�8�M���o6�'����H2.C���`��O����~a��!
)|oe�(V[7B?�DD����Rq�P��\]�NCK08��u�m�j3�2�n��K ۖ�B]n�`��Aa����q�
��^@P�����'ڜz�dډ/(����K�y9u��{1��t���I@{AN��nl�D�Őh
Z�C�0
+�'��U��,�M-lUPr����sh�T)�ڮJ�Ou_�L>̗�¿٪�p/� 9�_�L�y`_���uy$�N_�NPX�z��`v��#�2� 
;3](k����߻l	�S#��^1�軠5�ƬZ�ށlR�����ڛ�ʺ�������f\�/R���Y��Y-�!Rl)xU06W
�{���T�Ц	�D6�H��
+j����*��z3�<c
+.(�*�H�O��$�7���I�[���J�0�v&��mD �Pv�n_g��D�ѽ@�H�v�%��G)�
+��
+_?��Gf��}�K�@�eDo��4�{C�
YE�9�_'˘+)A�胪����H1��`�C��:~�8���ٝ
	��/l�q��.�\�I���ŋ�;(�P���P��Yޠ�A�N$�FoR���&�QZ�����S�� �L	����)�J���t��<j�
}��-�T�k�E"Ȳb��0�
��|���Y�m��t8����W����
s8v�
/ߦ����"Z���ЇՏփ��z�䶏��M	��a@�YN&����I��N���4���H>��

� S���3'e9�<I�92��sd����Z
+�φ��8ѸI�}���3;a��cS��ۤOoR�b
�j�["04´��P�
�hQ{3njt���~e����
�
�ϣ�,����"-׋*���.u]mX����*
kl�����`A?
@��
p�V��4�,�B|ɘ׶�G���$��|*�Vj��m)�̀��^�þ���!�8�Ỳ[��:"�S͢�H�� �4�
�
��T"J
Z��Qs�����{�-6�h�nNBPCo�b�.m�3���M�~��+�s�t�����)��
�� R�.z@|-����T��B�d7����n��?O�8��Z��_	Ǖ����;�p�J��	��2�G��۽벸�NY�/9�Ɨ'���˻F�+Op/�L�0_lT���N]9����%���6�dY9���aq��j�����V���;�q��U&Rg�"i����)���NmqT|��ޝ�`%2��p�u���1�L
+D�
��ʇ��A�@�=��2����g8�#-�6^�O:\@�U'�[��/�~�#�݇�%ŢR���$?E�Y1�뀲�Y�fWWP�8�n����&ń���z�f�~�S̑�lЕ�z
��[*c
���YjX
1�X��ۧ"���}��z
+����q�nŒ�
o�զ��n
+�j��P�b��
\�!)�
6,ϑy�,F�3F���Oɤ��L�@\
z$
ov���Ig�Q���~F���A$�Ĉ
(i�����ös�>���u�9O�g� �G�̶wԏѻ���m�A��P�s����;���;�`=Z�g��&��|���
ʢ�Qh�jC�
���m��=�0A���hh(��V'|/�=��Z2Ĭ�+"�5ʷ+-�SC�ޜg�x��=�pPzY
+���j��K���&�)=�q�{wn���0�b3�T��=�gܡ�
{�7`m�s�!\}�qwg��geJ�a��;Q\胔;�0\1�=X� �`��)w�<ʽ_���}���%��V1�`l���.�������wf�����/��/�}8��2��`(�KtT����C�*������JD��@��w�t�#�T�
0
.���3>�	����L]>	J

��QX?O�8ֻ��l8���n�ڟ$��w�S�#�*_M���@v��vC�s>��ЃKt �D�@�Cs�EL]m
�C�:S�8���<]yV�j�4�j��HND��+܉	+�!�>]��;�3>�a��rPV���g�ZL�<��<簃�r�փ
v
��氣��;���u����ӽ�;�@$�lذ<Gflw���"Eٱ�ko��/���%
�x�{������_��L��M��5�$[7�ͱ\��=Fa��oDVE�����A��:mv�^�?F��?.
�6���-
�TU���˻�c�f� �M8t�9[���CS;�y�˓
n.��Q�"����$�
jk�A���v+�Ca��\��/�7.��l�UF���� 내�
+endstream
+endobj
+4645 0 obj <<
+/Type /Page
+/Contents 4646 0 R
+/Resources 4644 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4622 0 R
+/Annots [ 4639 0 R 4640 0 R 4641 0 R 4643 0 R ]
+>> endobj
+4639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 464.035 340.17 474.939]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 398.53 362.353 410.864]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+4641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 264.198 340.17 275.102]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4643 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4647 0 obj <<
+/D [4645 0 R /XYZ 89 770.89 null]
+>> endobj
+4648 0 obj <<
+/D [4645 0 R /XYZ 90 721.073 null]
+>> endobj
+4649 0 obj <<
+/D [4645 0 R /XYZ 90 646.048 null]
+>> endobj
+4318 0 obj <<
+/D [4645 0 R /XYZ 90 533.157 null]
+>> endobj
+4650 0 obj <<
+/D [4645 0 R /XYZ 90 528.673 null]
+>> endobj
+4651 0 obj <<
+/D [4645 0 R /XYZ 90 448.144 null]
+>> endobj
+4652 0 obj <<
+/D [4645 0 R /XYZ 90 370.146 null]
+>> endobj
+4366 0 obj <<
+/D [4645 0 R /XYZ 90 335.476 null]
+>> endobj
+4653 0 obj <<
+/D [4645 0 R /XYZ 90 330.993 null]
+>> endobj
+4654 0 obj <<
+/D [4645 0 R /XYZ 90 248.307 null]
+>> endobj
+4655 0 obj <<
+/D [4645 0 R /XYZ 90 169.911 null]
+>> endobj
+4367 0 obj <<
+/D [4645 0 R /XYZ 90 81.969 null]
+>> endobj
+4656 0 obj <<
+/D [4645 0 R /XYZ 90 77.486 null]
+>> endobj
+4644 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4663 0 obj <<
+/Length 3262      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�6~���SW���z��IӤMw��n���v2��؜J�"Ru���
 ���n63}�yp�s�H���nB��W/��w7W/�h>��X15��8��D�8�
+�S*�����&\���
+���_�����o�ừ�7W��(�"��H��b}��w2Y��`b
�Ƀ
�����j����W$��r�
G�F�z�Hd"
�x6���i��7��J��oh�K�#�L��7nD@[GZ4��M�'�t6g�O���o����0q�ŷ$�?��Θ���

v����f����Q)��� �n�i*#��1�q"�׫l�U�r_�\�Hqm�I|L�,��F9!
�eW��^i50�R%r�IU
�X��3J���m�) GY��s �N�cp ȏ�2IYfw���oD��\(5]yY
�FƑ�g��(��vS)�́�Xʣ��&q
+�
���I��0
-Jg�L�
�#sh�LDD6�^�m��Շw�%���[���ߢ
dNF͈]�K�Z3х��d�[�‡��`�xcx6 {f�����Y5lm�;9�i��OR���¿x�HW�,�
��x��7�bF%�+����H��O��6-w��]ۗn
T��ה��p5yo�.�S���[5o~�bF�X��.6��
��n��dU�*�?�E���l��r� �����c
q�ZQ�1�&�hDX�'��� ��B�I�8�$��.A�
`aX�%2�rnC�bSx.���}Qb�lE�ZP/i�f6�071mE�����o!�T x�x����,ق���-��2���?s�o�K|׏ +	v�h��N1@��R�h(�(F*Lj�`���s
��%X)	eę�
���CE��3y�N!f:d�G3x��ě�p�5i�]m�C4��l�x����զV�@!h�Mz�ph%�Q���=�E�(G��
�I
q��7�d�(x��
�{��cc�]6nj�\�����56;N
���U��:Ϟ�ȖimС� ��5���F�	��)Z�IɊ�Ǘ���E�� �T�D��M�u���0�\���F�i��X'Y�;�c�5�\T����D��RK	�8KnW�{RV��EFp��n}[���gɌO [�����t��� �1�!a�S��V

����;�����!O���4���֯��~�o��*��U�.����.���,�z�x*��6�O��Nq0���D
�H�ÜT_^��'�3"8)8�$~�}[g2l��4�͡q$8�
��>E��C�>����il����
��@�CD��ƕ���b#�����d;�zz�[�yu
� �s��@�/��T�#

�1p!`��u�܃7���D�i6�	�6c��_m�b���m�1I�
J�(�<�q�v
�R�ڗ�}�g��Xo �t��h҅h�'��
��s� �t��B�l�_!8��
� D�v���q���p�CT���n�
E
�q��sh��h
Q�AI
_���衒���8U���� u2槸���� (������u����t�U�����Ϫ"k��F�B|�q��(n��7��o�{o��c0ހ�1��5X"
����9&��9�z��7h �
(ׂQ>B��3�0��cI�g���Q
C�t�}m�d�K�'_}5$a<�	-���爃n}(�"$�ћ
2 at z�Y��m���l��J6
gNA�����>�f�%�{xy
+,n\�[�5����a�F���~S���]�Uh
+ ��
 (�?-/��u��P���
GC/���w����ە�!�Ց�u_cOr>�'��D�	#ɟ#d�i�
+R"��<�nQ"�0a�WX�
�(���A�'d��ʺOh޸�
.
�����&�4��F� �
4�^Z!������A?r��N�s"w�n�&u�ֽ*��j�VWF�v�/�H�����6R�����t�|
�8c��E�3e'}H���UQ�g����.���ݜa�IE��٬��
^^�Q"
������������)�Z72R<
���
�`L^�Rz&���K����k~�:O
+BL}I��'�C�{�/�v=^�|���(��I^
+�'S��*�%��
�%��%�V
+� Mg
+8
+�	x8X�l)v�����eI�e$��,9�:�d�к*yd�Ce�`�AY�~ʒ\�1̇���ˊZ��M*�s2XT<�v�dY
�
���
+�t��Y)f
*�m��E�ڧ�C�,%����S�>n��Ѕ
���(����
�]��G[��w����6b�M �-m��_*����2� n�/v
C�5@�<��4�+�d�
;�~{�L�:����� ��*�0��,o��*�
�$�0�� l�ȟY�+]v�U�XwD
n�*��9��6M���H�(�I�r��|�U3�����7z��nS��0v`mm���t?
+�S	�bu2�j�
ö����
�:����zZ��vi��U�6��G����>� �x�m�BqI�]�
a������.�ť=��f_W��a���٣t0c�
+Ǧ�3���A�~>`#� �Cٜx�
i^:�6�&�q�&uDD�S�n*.��t�
"
o��q�T����|
+� 3���u�y�_�����7����
�
����؞Q��Lw�0���e�d9�ӡ�� !$a��|^M�cT.l��H_�,7�b�"c�.Ǚ�E
+
�m‹��9
��9���σ�S�8�v�C�qcL�b�
&M׷�D����c���9�}���aÊ����C�ڑ
"���3Ț���,_ey����
��x���\�C!X�z\
�Bs��z��?[��vO˞�-V��I�,���5��V.)PqD�_U���2
���mZJ!��R�8*p@�Q�c0��Щ
+�3��Pu�h�6��:�@�5
+���J�ә?,j �Ęg��Lq����8�
e,�TA�X�����o=�ѽ;�� ��~��ݧ�
O�|���ͯZ`�����t��h[0�
��lq�?�,-S�y�;��|=�lj�-���K��̨�=������布���F�?�Q��O?|��}h0��������.n�M6��b�7��K
�i<}c�]�����P�A�����g�C�k���
+;�Z3��{m_���/ޮ�������@o��h �x�5\�<׏	5��_��.�[�ۿͤ�z��W����
t��|��t�<��S�#̈ޥu	���G��?�����I$�~�}Um�_���ݕi~A���ۏ�B�Ʃ�� 0�.�"O�?�Z�
%�
��
���
+endstream
+endobj
+4662 0 obj <<
+/Type /Page
+/Contents 4663 0 R
+/Resources 4661 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4622 0 R
+/Annots [ 4642 0 R 4657 0 R 4658 0 R 4659 0 R 4660 0 R ]
+>> endobj
+4642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 673.894 276.047 684.798]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 584.081 362.353 596.415]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+4658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.011 437.793 513.996 448.697]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+4659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.615 384.642 194.215 398.59]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4660 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4664 0 obj <<
+/D [4662 0 R /XYZ 89 770.89 null]
+>> endobj
+4665 0 obj <<
+/D [4662 0 R /XYZ 90 646.048 null]
+>> endobj
+4666 0 obj <<
+/D [4662 0 R /XYZ 90 555.697 null]
+>> endobj
+4368 0 obj <<
+/D [4662 0 R /XYZ 90 509.072 null]
+>> endobj
+4667 0 obj <<
+/D [4662 0 R /XYZ 90 504.589 null]
+>> endobj
+4668 0 obj <<
+/D [4662 0 R /XYZ 90 409.947 null]
+>> endobj
+4669 0 obj <<
+/D [4662 0 R /XYZ 90 356.258 null]
+>> endobj
+4369 0 obj <<
+/D [4662 0 R /XYZ 90 231.753 null]
+>> endobj
+4670 0 obj <<
+/D [4662 0 R /XYZ 90 227.27 null]
+>> endobj
+4671 0 obj <<
+/D [4662 0 R /XYZ 90 158.753 null]
+>> endobj
+4661 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F119 3831 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4677 0 obj <<
+/Length 3425      
+/Filter /FlateDecode
+>>
+stream
+x��[mo���_�O����|�����
�z�����w[I��RNR����ΐ�,ɔ�l�C���e�
���
'tr3��o��\��~�����drq=�t��%*�o���)����R:}7ct�����݌�iq��͖ez���L�������엋�_�e�C�%	����#�'?��(,��	�]���a
+m��e���͌�ޥU5�sE�3˧���.�3?�>���3�,_��e�L�H�웋�_���楡�6�����/t����'�k&�ܤ�Dr�w�g�8�]�&t X�l��ʫ:��_y�>�f���^�7��uY��S}��j�
"��^B�h��f6�L���ɂ���ک�,'	�Z|�	��D��-Dz���dޙ��K�a�\�H�Wex�\���Z����ʬz���<Vwwa������1���O�L#�g�gʨ�j:S5�&��t3Mш�!�!}�#A���k2u_��w�sIL›_e�+]OX�*H?�"r��X\vf��I�������`68G(ՊM�4�;W@���N5v2�DZvP�rW�;�"b�-�%(���Hpε�ؑ�Ăwu���&1�;��g��Qh���-��&נrV+�P��~��xp�u�v��'�
������zs����E�o�"����({j�Y�3.��j��N
� $�z�p9�? �^������rr~�.gz���� [...]
�A����O��v�.ї�!߂�o	�
�t
"���^j� V�2"���ڸ��(�\.z��0�r���U��àQ��~����^A�b��~�����O����EA���+Y�~%�K^�L
�\���mQe~�6E���р{ռX��fU�GW�2C��ٹ���p^���
}�) 9���'��e�3�<w~	������6$[M��
+Nq�����Y��q] �+?蘃�fqx�|��#NO�Uzu�L/����M,������H�fG��=-���
�.�Uް	�
ّ;
^�ׇ���y+�!Jfs)��
���RAY�Jm�����t�*�z��:�ԈQT� K��`����
�q���R����+���R�ǥ��vk��x�
��t8�#姂U&9��1iL��Xub���6ݦq�e�Q��Q��JE�J	�}�*^�r3�Q[� ��c0*�2?Fݮ6�Q%���	����#���I�@@>1*��L��E�XU����3��T��,!|�:��b���b�
�nҊy!a�!$C�
�d�JB�
+�,Շ,
y��r
+~����Qe���2
��}r �(�U]�	��*�+d��V�!��>�c,�C��/�"�Q��� �U�Љ�ݶ6�s
�3`��u}���i����*L+��&1��M��U}
�d�h�GC
3 ��A�E�l2��&K
I6e�Ќ<�8 V'W�!-vXZ���>���C��H����ho���ȍ�/3 7t��O���qcTBnS��,�
��(�Y
FoF�[uӲ<Z�H��I�"\þ��8_ǹ�ݺ˩��UO0�~6�Z.��;O��܂㋢���ȗ^����:�ﲼ.7�DM�x�g�8��'�g�cҪX+�~�
+�-����7n0[�
+�s�Hr�#�ޫ�H�����a@��~I󢀴"�]�++߆��k����=��f4u�꧁�a�@���G���~b�;���f���m��"	��ɾ� �Re{
+�sۈ"�9�9F
m�B)!ދѼ>HR��Fn�]GriXs�v֟#�/^�Ѭ�ݮ<�a_P���YG����7� �&�P��M:s^8�׃�o��3�
9%�S#Do�<���M��r�]��R��>dIO����1,��t�<
5�
؉nR����b�*k�o�:O���t��S����fl
󿁸@����t�P
+|�Ƽ����xa]?X!8 �#����"B �
x��Hؘ��
օ f�̯��g�E>,eb���A܃�U�L�$�ǰj��i��.��
+W
��8�A�DyY��g���`.���L
���W�����w
QF�"��7�¦C�1BR�Z�ߐ��$U�&z�,�.��luiʁU�{�'D�*T[h����U�7���+�8��	�R��	
+�-<�U�"�I%�7�4�m���/X���2M`�	<iOh�}Z����ҫB�v���z;�kL` ��2e��kJnLz�ۻ�m�n�%�n �Ѣ��:C�0GVݤ>�`d���*��!�>�5�����c��]:��s 
	8��T�$
�HI%���hȩ
;ɲZP�ު�%A�z�
��i :[���P6�Z�����f
�\ہ-
��=�
a��9�Y�h��N�ga #�JJ����Q��&
:
Rl]��F�l��X=���k�F�72pg`Oy}r������@s�F��3�-�=���F�����L����L���+�m0:�\�7���ߞM>��?����2{�&W�"U5��S�i�k��j�t�6r\+ŗ
n\���aO��_L1j���kGTB`d�ջ���"��۶�QC?¤��Dѽ�C��~s�L^��3k�)V�W.�1�2�dC���E7�$�Te6��� ������hr�zy~��g���n��W!���a��½j�!7 ��S��
6*�tM���'��,t�yq[z��.�tK���Ƙ��akя�ف5[�3�W���zu��O8k�V8�yrY<�M��&���H���@���+4U�N*�^k����
����qZF���Ć0a�{
+KD�
s7l��(O�,�Cs��D�xU�T���^%>�>/�8�?��#���)��~$)~�7�

�4a��31�y��4I�t]w`I�h�^'XVVa���6����>��X�	�/�˸@�F;�5s��9������I���@�C
��i����$�}HK�>���?���~
���W7�B�6�
Mp��s����6W����
W��`�X�`��r{
�.��݌`��
�E��0����q�_*6����|,������w�~�?VY���B���=�}[����Z#��
�'����Y�=���4O;s�ڲ�4�^�������W7U���vU����������2k�7
�S̼Ic
mԥ�$�O�4@��B��L��?��g���ax��ZL�.@�� ��L�&
+endstream
+endobj
+4676 0 obj <<
+/Type /Page
+/Contents 4677 0 R
+/Resources 4675 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4622 0 R
+/Annots [ 4672 0 R 4673 0 R 4674 0 R ]
+>> endobj
+4672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 215.042 243.45 228.989]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 162.782 485.603 175.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4674 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4678 0 obj <<
+/D [4676 0 R /XYZ 89 770.89 null]
+>> endobj
+4370 0 obj <<
+/D [4676 0 R /XYZ 90 667.275 null]
+>> endobj
+4679 0 obj <<
+/D [4676 0 R /XYZ 90 662.791 null]
+>> endobj
+4680 0 obj <<
+/D [4676 0 R /XYZ 90 592.06 null]
+>> endobj
+4371 0 obj <<
+/D [4676 0 R /XYZ 90 474.013 null]
+>> endobj
+4681 0 obj <<
+/D [4676 0 R /XYZ 90 469.53 null]
+>> endobj
+4372 0 obj <<
+/D [4676 0 R /XYZ 237.535 315.561 null]
+>> endobj
+4682 0 obj <<
+/D [4676 0 R /XYZ 90 308.921 null]
+>> endobj
+4683 0 obj <<
+/D [4676 0 R /XYZ 90 240.347 null]
+>> endobj
+4684 0 obj <<
+/D [4676 0 R /XYZ 90 186.658 null]
+>> endobj
+4373 0 obj <<
+/D [4676 0 R /XYZ 90 139.784 null]
+>> endobj
+4685 0 obj <<
+/D [4676 0 R /XYZ 90 135.301 null]
+>> endobj
+4675 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F94 771 0 R /F10 773 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4696 0 obj <<
+/Length 3042      
+/Filter /FlateDecode
+>>
+stream
+x��ɒ���_�S"UF��$��
��q&�/cW[bw�#�2E���y ��%u7�|�o� ���
Ͼ�����巊�
2��������		O�ٻ9|����3&5"F�W����������cW�\_�~E`ψ �ҳ���ݯx�����0bF�>�I��
���OW���5.�Qao���� ��L�4
�o>��]���!t�h	��]�y,���$��A���
�/
�af�p�@|'��l����d�~����(p�R���
/
�!af�(x煳�֯^e�����d��o�r�����M���kL
s2��P �)e�#"�)J%�QJ�A��^?�ł���|��ϳ;K
��}�)b�4v��o�0b��g�h/�zv�����4���?TI�ܥ�f�KV�m�=5J4�`�Ѭ�
�,�82�Żz��t)C���N�V0�x��ڛI�Ԇ��G��%^��\�4b j�$�\��n�
'�O�B����3�
+)�N�>��<�Z�Pf����H!L�/�
	�Yo��
ǎ����ı{��|�bI�ʒ�q�a#,0�"�O����V0�"`��
���!_U�]��)D���I,1E���q	�k���Sd9"��'��k�s\�K1��Q/ksE>˫W�dw�}"9��R \?���w�>�>���}�pN�xYC�m�I����,�:L�k�o(�bɅ���]�_��Mj4ҜL�&�ib٪�C�O��u�_��nmowDM%R�t�_� ���%�`�����8�z��~�!(`�<�
"��*ʣ���VE�������~]�f�[��|~�����%��{��nKM���y��%F";����=����G��K��L��L*
X<g�sh����kr�.1�#����
�
p�)��Vr����"���s1	�H�

`r�hn\�j%NW���Nu[sH�����C{H����b��M
�3�
� I͔*�D���� /P
+��h��	D+��H���y/��o�mΧ�O y�Y�u:�]���ľ,�~(�{7�3z0���j��u7�A�� �<
�(H<��E�8���\�!�� ���U�.�I�� �
��A�83�����eZ
�|I��Wڥd�!��� J���%�z��k{��E���_5C��v�Lwe���/]��֚�CgMv.�� �WG�[KO��L�P�^��Q󬪗o l���� E>;�gK�!ӣu.T��!_�P��<][���R(��Q� ��
���1��OCۜ�+`�
����y�q���M�u�l6��0�6�+���g3����̨�w!���@��H2�����R���si����Y�0}:0�ͷ'TlF�s*�/=k��"OGҏF���c�{�R���9>b�G)���!]�[m�t�i�8�1�m��&˧��|��m�&ʓ͡�{I�q%�߇iX
�g�QG����ǴɩK�Dz�
���=��I���I���k-q
��ZXVI��,��ije<�����E�CZ�kH,��.�lB��f�_7ℛ�s������u��E����{]�j=�j_7a�"� �c��"k at b�tח�a��b�
+�
=�$
4�M����X�@���}�R�
�V�
1P t���k,uHo���u��@Z�6:�̈��zB�!'��>�o>�X\B�"��o�KN`�atj5,�j����`{Zd�F���z�%�(U�lם�+�G�{�D
<cr�����5�p��~�.��cl``(J���efq�z�Z�|�AB 
఩��K����bFJ�@�cT�!����ĺH�E�^5�!
��$�ҥ���K!��ث{�����.�]
+4��4[��m�|�e�����%aA掮��|X%U��>
��][EXD��w)Nu'p؃iZ��K��%o��3..k��&h�����
���
�A4�%ħ]��h.�"��=��ǭC�'�d/�)�(��,� ��7����#~I�	ېme���P(���v��ڒ`:J�4�>��E�1d�^da8ε�K at e�+�b�A���Qx

,M[�~��,O=��&9xӬ{�_�ͺh]c�� �al�&���sZQ�2��*J�ڻ":�z
�+�����l��26�Ứ�JAM(��O��:�2]skr���J!_6FO�O�
)xC�6��X�uS��G���q�����'�Ruo�6�;�-�
Br���%}է>�) R�)��C�g3>��螀�D[v�e����j��k^�V�����i7��֖}\�VΕ�/j�?��q�H�唊�d��;�E4CL��k�&���
�3."�+&<�����Zv�]p:�Y�))m�j
H}�Y���'
֊�D#��W���s5�g���Zl�_x���� �Ĵ�#� Lot���i�����QT��sxu}���ۘ�v��-ԯx�@����(ʹ��&�難��,\̋�B�����ZqȎƊ��5�>7#f�m7R���������t��k��i�)�����[`������?��þ����f
Bs^�v
+�t�;q
+�<�F�ߑ��Ёqz�O7n���in��%P�	��c��ж1/��T��<O�=�`$ºN4_���,��8i+홰n�4�tJ��S�A�K
$��y
�0ѽ�3�ܷR#{�.u]�<�i��0L�n
���]/��S�4�gòt��
+w��/��X�� ��#��:���!ֿ�I�/�5X��wG�s+L��h9�W|6�?}�λ*�
�Ϊ�a:�a�`���:�;R��#̱�C������8
 ���;V�{��Σ� ���ʞ%U�"���L~
 9�:�P�p��@@�? ���
��U 䜝Ƕ:]V{�"E٥�+�}�!��=��a)L��n���o�/_o�� ��-޲�D
�I�qC�EÞÛ7?�������
!�u���$?4g%lL���tIٕ���%��ʟ�f�����E�_>
�ᤠH��1��ڽz���p��L���q��>6��]û�ٺSG~o^n���@� ��3 �\
+endstream
+endobj
+4695 0 obj <<
+/Type /Page
+/Contents 4696 0 R
+/Resources 4694 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4622 0 R
+/Annots [ 4686 0 R 4687 0 R 4688 0 R 4689 0 R 4690 0 R 4691 0 R 4692 0 R 4693 0 R ]
+>> endobj
+4686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.376 624.689 385.519 635.593]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+4687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 455.732 149.577 463.258]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.847 404.543 191.42 412.069]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.164 404.543 266.737 412.069]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 326.368 239.856 337.272]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+4691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 138.651 379.76 150.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box_a21f26d7888710beb265f4dbf86b740a6) >>
+>> endobj
+4692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 80.973 182.164 91.877]
+/A << /S /GoTo /D (index_expand_space_dimension) >>
+>> endobj
+4693 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4697 0 obj <<
+/D [4695 0 R /XYZ 89 770.89 null]
+>> endobj
+4698 0 obj <<
+/D [4695 0 R /XYZ 90 718.682 null]
+>> endobj
+4374 0 obj <<
+/D [4695 0 R /XYZ 90 684.012 null]
+>> endobj
+4699 0 obj <<
+/D [4695 0 R /XYZ 90 679.529 null]
+>> endobj
+4700 0 obj <<
+/D [4695 0 R /XYZ 90 608.798 null]
+>> endobj
+4375 0 obj <<
+/D [4695 0 R /XYZ 244.439 329.521 null]
+>> endobj
+4701 0 obj <<
+/D [4695 0 R /XYZ 90 322.881 null]
+>> endobj
+4702 0 obj <<
+/D [4695 0 R /XYZ 90 254.307 null]
+>> endobj
+4703 0 obj <<
+/D [4695 0 R /XYZ 90 188.265 null]
+>> endobj
+4376 0 obj <<
+/D [4695 0 R /XYZ 400.69 84.126 null]
+>> endobj
+4704 0 obj <<
+/D [4695 0 R /XYZ 90 77.486 null]
+>> endobj
+4694 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4711 0 obj <<
+/Length 3372      
+/Filter /FlateDecode
+>>
+stream
+x��[�۶�~�>��L�I ��L��'i��Wq2
J���H�����ŃP ���}�x<�@����ow!����ΰ���
+�G������k�f�&���L����mf�#�X�����yZ
�Ooϋ���lS��~ܭʴ�r}�u�����_�&�G�$	�㰞%�g7%X��77"T(L�휿�a����>��Œ
+<�Yh:������Ȼl��
��Y��!M��!
ѫoo�~�"@ψ��@R�և��?����)2�f��ÌS�����_�@�V��
�K�Z�"�D#��� �D	U)�%���P����`fbD�B A�@�I�V���ϋ�&&|��nS��I���&aA�6m�����.� e�
�.c月=���S����)�+c̨p�l��t�E�"

+mg�W��Y^튼r��x����0VG�MjD��H>CI�]��gէ�Y
n�Q�I�hH��,Y"��_�޴���a��*�
+�4���L!Βf�&�b{� ��#�4�=����z����	��~d��PT�W���x_R�y�N�>b��ܳ'�j
�Q��ﷴ�ܬ`4A
����u#%��(u����-!�
���̖D�Bi#���OK�'�q�d^����`ӽu/ͻ��M��*���m�z7B�e)�t�,{O���
+����d�)��yr�0H:aQEZ1���yLb$�0���zc���2��M����C��
+`vQ�����j�Ѿ� JB��.�'��f��[̺(ˬ�/��.���V�op�ܕ�{�6���pD�!�q��\'�T�KSt*�5b*�fݹ��L��PʣB�tR{�������ᔗ1��W������1��	^9Ճ�F�`�U=?�.�݋]Ռ43��]���\0���QS�(��	�eq���O�YJ�T	�k
P$J^R��L1S���C� �@@�㷿����:��puF`�D
+����mޤΗ�
д�-8L�>ɐ���
E;N8dc��(��v�=p
� f��{x\o��*q
�n��|������
�߀D)�.�'p�C��2�I��!�%�d0���,���l܀t�uh��%�Sw8�'�Y��OS-���v# R��4 �rk�^k�����
\�	���?��(^���)�,W�n9K�/��
Y�����K��Qb��{�E�3AE^��<�L�rL ҧPy���
����U�Pz,���H3vZ�}��>LV���ؘ,
BJ�
W2��"���#}:�c#6�@�Q�71�UH}{ź-kݥ�̉n<v��� �v�<BԮu+_A�����6�F;ZK*US^�g�Ĕ
ZMƑ5
ߴ[4&��i[��`~�
 �;\�c�&P5��/�����=Nw����k.x���>��*�"W�"��wEeq&���w����B:,�C,K<����y6���\?��x�~}H�n�)R
�I���M��i��H�$����P,1�6�v�L�,��*+=+1G-�LWf��d�wm�;p����@�Id'�����#�2��Gՙ�2���]B
���D�&ꑪ� �.�8ЂVI�6���	XS�+@�$�A���뗬��d�Ʈũ;�:�R���TY�r)�<N�
+G
�4��(��檹+
������'�L=��
�G+eII��z��m�B�X�N��
+~,@pd�z�$�F��eG
+^O���l7�/��@eAU)
��?��= ��'�՜CRŽ�K�����l�I�>J��r����f���ʾy���ުx�7U��,��;�1iS������ 
���9A.��s�
!\^|� M��3
��J��i|�d?��D��㙶-�K��d����6y���D����9i
��,!��A1r
� �s@���X��p��'O�DF`�3�ħ�Y1
�A�.i�Ϣy��oZ��� u$�EQ�@
��@
�
S�}�p��'��<4zˍ
�O
��*
+2(�]P� ��yM}���|d�r�H��
�Hp�Z�U�k���7���{�iيp�1�ɰg~�Z���\��]����:y��F������R�wE��

�89|#(�����
���>�hZxCh��$��(>�P1���vtsA>p2�Dl��p3n�|��6����E��94Ob�,(�<�6�%�
U�ئW���H[Ȳ*�}
�J.qc�[j��~�|F�T�#�F�?��$�t��4��(���P�����9+cu�y��( �`i�ݑ��(�DW�:�r �QË�T��"ۂ{�����sտ�
EX
+���cK.�4W�5�3�6a���

�DA#

+-Ê=J��Q�
+��
�E�m"t�E�j�t��^
��j�~p4��C�
���bɰ/j1ܶ7�X/��7�j?����1Mw̙�f�?�VmM[֐_e{A�0
Fؼ�ոز�5�h��6�WYla���q�Œ'd�/����<ãk��U]��ˇ,�и=�}��UY���թn���	𧝆F(,9�kLih�xg%۬s��̀$3�`{|�z]�����bN�1�]�֐6�N���E�Ea�0ePHb�R 2�W^���:�iU�ܸ/6U9�B���2��^��݂�ȋ|	1��⾮ 8��ߥ�	��S��q2�_o�,�y�����!j���e�c�M�Y* 
�8���R�Y�������Y�g�
��a��Π_[�Up�b�$��{{`�u
^���!���т�sטJ�{?6V6����c�&žD�k��;�T��\� �Wî"L�B�W��b�� '"��{��+���U	�W
�
+��..����Y{c��8=%d
��e�n���|ٖš��3yg����@��W;@�F$*������7$
�
~��Y�La�t�w��
���_�����6ۘ�mB
�]�iv


���̰��
+

+�.�����d4X2�l�.�U��qX�u��`c�nI	�G?Q*�%<�~Y*��E�<��IAĴl�DJkw6��n��ͭd6���-o��^@`Z��|Ln�
m�8g��0�V7�zX߹�� ���L���
���`���:kY�iD�+�^1X��,[G�o^\>�@���&q�
Z�&z��vo��A��aia
hN�X�wat��^�j}�
>�)����	�VQ
��sQ+͝�����lr��Lk
+�uEq9�+IW
�q�诗P^xf�á�m��T�uQ6�3\�6��/���ϑ��Rv�?�ZQ�p_9�	���y��G��*+���[����CS�6��1[v2�
��Ly/m����A�n�̚��C�C$
���]]�_�z�z�����]
!l���l�yۀ�CQ��v�D��-�4�Z���F �_mc"�O��_�پl���zs`�� �l�?�
�
+endstream
+endobj
+4710 0 obj <<
+/Type /Page
+/Contents 4711 0 R
+/Resources 4709 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4721 0 R
+/Annots [ 4705 0 R 4706 0 R 4715 0 R 4707 0 R 4708 0 R ]
+>> endobj
+4705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 632.699 243.45 646.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 556.13 535.938 568.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 542.746 226.824 555.079]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+4707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 488.693 362.844 499.761]
+/A << /S /GoTo /D (index_fold_space_dimensions) >>
+>> endobj
+4708 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4712 0 obj <<
+/D [4710 0 R /XYZ 89 770.89 null]
+>> endobj
+4713 0 obj <<
+/D [4710 0 R /XYZ 90 658.004 null]
+>> endobj
+4714 0 obj <<
+/D [4710 0 R /XYZ 90 580.006 null]
+>> endobj
+3977 0 obj <<
+/D [4710 0 R /XYZ 487.765 491.846 null]
+>> endobj
+4716 0 obj <<
+/D [4710 0 R /XYZ 90 485.206 null]
+>> endobj
+4717 0 obj <<
+/D [4710 0 R /XYZ 90 416.502 null]
+>> endobj
+3978 0 obj <<
+/D [4710 0 R /XYZ 90 381.832 null]
+>> endobj
+4718 0 obj <<
+/D [4710 0 R /XYZ 90 377.349 null]
+>> endobj
+4719 0 obj <<
+/D [4710 0 R /XYZ 90 306.489 null]
+>> endobj
+3979 0 obj <<
+/D [4710 0 R /XYZ 90 276.752 null]
+>> endobj
+4720 0 obj <<
+/D [4710 0 R /XYZ 90 272.269 null]
+>> endobj
+4709 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+4727 0 obj <<
+/Length 2697      
+/Filter /FlateDecode
+>>
+stream
+x��ZY���~�_A �FF�>��d��׻^x��N<��(�3C�"e��=���>x��ud�}	�2��fuu
_U}��&8�����G�$K4҂���&�8��F\��u�vF�����5aB!��eo?}�����o̳���/>\x��p$U��\�}��5��5��i�|��6IJ|�ɛ��_�.Ot!$E�D�q�|A9�m��9峏s�g����UkwQ��
=��F�#I��
�[l�P*���V�ɛ�]uwy��[D���#b%R�˭��/�~��I�\&
JQ̭G)ց�x��н�UY�yL�
�4:0"fmޙ
9�j�N ������;]��#��DX
F�[��Fp]���{$�ݍ�6���7����U���	�3�o�<�AF��1�U�6�0��D
clVt^��=.�U�[��p�u6i �ӈq�"Hs�$E���Gs���9w!ʍ�̇q���dA]l�tDq�l��H���`
�o�e��P����;�w+�
$�鰠���U��SJfϯ���
Q [...]
+��m���c
�گ�-WHpnks�9��{�O��Ti��\�Y�ٲ
�MMWC\���� ��\��e,�T���O���
�tU�U��'a�|�
V��c[.@;$1
�򜭵>����ˈ�Pa
d�]��X
+5���qء_8�����������5������ʢ���� *s�b��
$��6�{���v���%���M^�E]�'=Fz*G�|̚X��PY� �Aޮ�qk�v˖���C�g�Κ��5Ul[B�頽ț�l��J#��@�E*�����T���� �U��� X�pU��0������c��ØI�|�����H	hJ}f�Q��
R�v�[	 ���ժn�Eu
u^�
+"�x
�B\C�AV�Ľ�]�Eă@Fbx>1��>�ZN%s
|fm�ۘh2_���� o�S
+gfc�a1
�5�_wW�q�
F�&Ϩ�>��Z at 1����%�E�Hgw����`=��皹���z���	4�Y��q������ɁݢX�B����(��x�B���IE<{R�>�d�A�*���2�e�3�x��.��֙�е��s�m�=y��;w��;�1�;�����Y�^�I��3"�屖QBy��=�v�g�v�ܹG�M�n�j������[7��{	F�
OOb#
��4��:�H��˾�
+�ZIDR�5��A�5�;f�@D����2���
���q�|�i�w2�C0�!�_�泶�N٘D��� ���P��.N�i��e>�R�!+KwQ���.�Y�5��9��+H��|��a5֙^�hU�PLx�,��e!�G'R���2	V��h���`�L�1�W`|��ԥ�ګp؅bc�n�)��u�����=a����$����[�]J�|��
L$��G���T<��CW�R����[�[�9�|
�*|�d+���G*1�~�8��wx�F(l����v�<m�.�Y�T|�`f	�YR��� T��z�Vzvm�G�
}��Ĺa��b�Zx��U�\�l�0{����x��be��TNz�н�69AL��D�@���4�H	�mQ�iW��0�fS���̡҃�ꦽ��7����ia�
+����<
�!��{
O
��g�x��<
�y<1�x|x4�x.��)��sxdl*px��q��D������rx�sx<������J��
d�1N
��S84��)*0Jy�0	����ST0
\
�,3ɺ�D
0�>�5<j��p�YC��b
U��E���F����X�-%�hU���-}�Є�A	5m�΢�1����� ��A�3��`t�,�fmb�����k"��j4�I��o��Mdy*M"�LJ���:��?���� �C�ܟ�x��f̖�,�5nLDF�p��c��F�I�v�_��a"�
ZF�u�2^3q�"*�.� FhĨ
+�q+���11#
�W|��G�gM��6"��c���AO��
U�
�o?ի�&������Np�@��j�+"g 4CX�S�#��a�N�R|��0j���U�vM�m����G
57���
��l:�EJ����	��q[H��^�=@��.q�X,
O2v3_���� ?�<�ن��{a@�+
���z�p+�H��
(�q��8P�m\�Gm

T�����;�Cpp~Nv��}��o	�-A�ć�c ;�A���=.zUf���d�`��6�L`�$�%+�
+��y��n~����]pH��Dww�R��:Z�KeF���g��9M�9�d�Z�N�ߣ�	M�cM-'�M�D
ylx"B��V���/u9'dv�����
+�����2D	uxQ,�
��f�WWO#
+p���1��RG�`h���y�c�6>7s9˛�Z�GC
����
��'}
��ٵ��<
��g`J�G]�H�a�]�L���c�͐��(�|:�c@��|���
g��O3Am���f�S�������	)�}8���w��G�7,��a���[���cSp"�:|��c�_����/��?ۼ��)�
g��U�'=

;�5�Y�m�+����E�Mއ���߃�ud�D'��=�u۫G����6�n��� �������?
ع�����
j��;�?ŲJ
+endstream
+endobj
+4726 0 obj <<
+/Type /Page
+/Contents 4727 0 R
+/Resources 4725 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4721 0 R
+/Annots [ 4724 0 R ]
+>> endobj
+4724 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4728 0 obj <<
+/D [4726 0 R /XYZ 89 770.89 null]
+>> endobj
+3980 0 obj <<
+/D [4726 0 R /XYZ 90 666.089 null]
+>> endobj
+4729 0 obj <<
+/D [4726 0 R /XYZ 90 661.606 null]
+>> endobj
+4057 0 obj <<
+/D [4726 0 R /XYZ 90 393.301 null]
+>> endobj
+4730 0 obj <<
+/D [4726 0 R /XYZ 90 388.818 null]
+>> endobj
+4731 0 obj <<
+/D [4726 0 R /XYZ 90 314.6 null]
+>> endobj
+4395 0 obj <<
+/D [4726 0 R /XYZ 90 291.092 null]
+>> endobj
+4732 0 obj <<
+/D [4726 0 R /XYZ 90 291.092 null]
+>> endobj
+4733 0 obj <<
+/D [4726 0 R /XYZ 90 232.95 null]
+>> endobj
+776 0 obj <<
+/D [4726 0 R /XYZ 90 145.44 null]
+>> endobj
+170 0 obj <<
+/D [4726 0 R /XYZ 90 137.428 null]
+>> endobj
+4725 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R /F91 766 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4777 0 obj <<
+/Length 1347      
+/Filter /FlateDecode
+>>
+stream
+x��Yms�8��_��
��	$�2כ��4�^���rs���!�B�������V�!6�Iz��>!`w�}v������8
�^
��p�H8�c\��
+�
��W&�H
Gcl�	6�4�ƧC
�I�����ש�.vv�/��5�x8�6�B/���L��❌',[��&a|������b�e@�5l�
+C�5&���6������-\�B(2�e�54��rTnEE"Du��4Ƚ���4��ԋ��M���ʀW[>L������+U�DC�p
�)�P�} �±�Bdy\��4��G3��>\�,���rX+��o��>V #H�X��������a0,�|'�k���y<Ƀ$�V��8�ڮ��aL��hY���
M���Áq�B�,a�Ѐ�*11��� ���3�t�/fr�~<�ƵT��Zk�ߗ�|����� ����2�9����{vyr�����AKU�C֠*���U�*4���H�T��;�i�-䷲,^��<�*�a3+�$m��E�T}�U$�
H�εR=������{�zYʻs��DR/����"�e����${.����6�|�}�i���"���5�~��`�/߾o�ә��`�P����|%���(Z�w�J�67�|
+b�;f�z!z
�敤]�������W�Ky_�
��!_O��H��
yr�^p&�ӹZ�vv9��JJ��i����y��zֆfsևJ��d�����afG�(��h+� _���p��IC�cU��ɇ���w��]��
��:�"HT���]tC1�"?�(f���֡��z�'����/,�#L���j�M�)Y�Yk�
���Rm
�(�a�B�4"e�l���z�-���[v��B�#�1QZ:)�}��,�ݔv�Kr�6�
�UK4,9�_�%���^T"r�2�:�`�	W�f��F��ۚ�jG+l�k�Sw
$�&b�&w-����`�4ib��a��Ek�ۈ���m#˶ج�[;�u�ܽꎮՕ�S�>"�n��8���G�l��l-U �gh�/���)F����$Nw�o`w{1	�v���^�O�N6F���F�3RzY5��f0�Ē%[��.���I ����!9�a��u$��/WKE*!�gX��D�qzP��7����I��I�=��
�]��:�u3�
+��9�~��J:7 vO�؏�^*ָ,�Z�J�j3s�'�ɷ��dT'��S��9,C����
+����L��
3K���y��T��U�/S��[?$��R�*��pd���\V5�
�\�<�����r�Q�N�m��v����>,o}�?d�R,a^�>n���
*��a��T�
UX2
�
Q�Q��`�yu�r?^s�b�OP�CG�C
+endstream
+endobj
+4776 0 obj <<
+/Type /Page
+/Contents 4777 0 R
+/Resources 4775 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4721 0 R
+/Group 4723 0 R
+/Annots [ 4734 0 R 4735 0 R 4736 0 R 4737 0 R 4738 0 R 4739 0 R 4740 0 R 4741 0 R 4742 0 R 4743 0 R 4744 0 R 4745 0 R 4746 0 R 4747 0 R 4748 0 R 4749 0 R 4750 0 R 4751 0 R 4752 0 R 4753 0 R 4754 0 R 4755 0 R 4756 0 R 4780 0 R 4757 0 R 4758 0 R 4759 0 R 4760 0 R 4761 0 R 4781 0 R 4762 0 R 4763 0 R 4764 0 R 4765 0 R 4782 0 R 4766 0 R 4767 0 R 4768 0 R 4769 0 R 4783 0 R 4774 0 R ]
+>> endobj
+4722 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1C__Polyhedron__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 4784 0 R
+/BBox [0 0 212 192]
+/Group 4723 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 4785 0 R>>
+>>
+/Length 391
+/Filter /FlateDecode
+>>
+stream
+x��TMO�0
��W�4���$�aB����a�a�
�
�q���)++b�Q��%��m��o`jd'�e�X3
7�������'K��{Y����g��|������(L��
�
���
����)o#i<�R��G�YBi쐭Pd"}�Ɍ}�0�i�?m ����y�ka��L�U$�4[�_��g�Sem&��M�۾K��	u����Ti�wb	]�!O��#�U��T��lS6F�FH�fZ��R���f�L��&�J;z��K��n�y7l�Ofn;�nN�h�'��e�E�b�k���QT6��s
�U/�8�
ƭ�EՓ�r�c �=!+����@r��*OF�ʫ��ݢ�	���+
+W��;c>-+j�JM_j2w+9F�|���p��j�
+endstream
+endobj
+4784 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+4785 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /VQVKTR+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 4786 0 R]
+/ToUnicode 4787 0 R
+>>
+endobj
+4786 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /VQVKTR+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 4788 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 556]]
+>>
+endobj
+4787 0 obj
+<<
+/Length 4789 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j� ��}���^,9�B�lor�M� FǬ�1�E޾f&l����?���f��q6B�F�bc�8���:�E	ڪ��j�^d���SġqfU�g�f�<��' �{���a�}my��{�����k�hR�W��䀐�y���8o���k�%q�GR���K�A�
E��QCeҨ:�O/Nl댺�@�E*��C^�DǂiGt*���i��
ӑ��NL���].L��L����1��~�Y[� �z2C��DEξ
���z�%����{)pzjJz��:|�?��E����
+endstream
+endobj
+4788 0 obj
+<<
+/Type /FontDescriptor
+/FontName /VQVKTR+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 4790 0 R
+>>
+endobj
+4789 0 obj
+298
+endobj
+4790 0 obj
+<<
+/Length 4791 0 R
+/Filter /FlateDecode
+/Length1 1704
+>>
+stream
+x�UU{l�U?�~m�*[��_�
�n]�.����۽�=
+��l+l�
�&�0����pJL�@bL�ј�c"�e��B���hP6u�d#�W�����9��s�=��9�~@  ꀂ�P$8Sk� �v�
<<63���_\��I �bh88����_���2gʫDB�;��B�c���
+��:�-c�CA��5 U����y��ȟG>}v�!�
� "o�󍼱���f2"�M�6
+Zh+���sa<�
� D�*&��7��J�洛�	
O��;@JǦ��k�^o�5�
����K�_�����25�,(�N�mz�׉6��2�
���$�jH5��M����YMR9�ޭ�
*MJ2�-��@ׁ��lm�3U�y;��;+������*'����I�QHk��-
�f�y{�&-!Y�Tef�͖R��ukQ�Z�.��`"Ј�cچs*0)Q�!��@܁@�#�ޒ"���F��"�:M��?�c�,�N�Aϴ����h���ڃ%�-�֮�X&�lT�V^�+��6K�I����>��Jl%棞�Y�
(��z6>8e���c^l�H�?<�~u
;�Ӑ���
��h&gO�O̞�6�|M���h���3�I�|G�Hdp��"�*� ���B��
y�����
�
2"�>
+
�|-�D-y�w�����,>�ٔ�Oz�Q�ƹ�m^�!�OS�l�D~E[Z���"�q�ȅ�ºN�?߻���O���A�t�.I�[
:<�19W
�
�\u�
 ߨ7`.1��	�
�^id	�uJ�S$��?b
+h^�
�{)�6�!Hs�Lյ{VZ,
ὃ�^n�s�P��g�&�����3
�0R���;�h��s�T��v9G_<12��4z|>�W��^�}s7I��'��G�������
hWɰ5
+F�#�*QafJ)x�����c���ߏͱ�N�7������A
+�K�
�q�|sX�
��i͝�]����БJ�=
�����c���g��'7���hO�ĦMV��X[�7�E�
��JH���^���Z{
�h�ʈ)��K���2��[�g�W�4��FO�Ez�A���{���'C���]�����_{���Q��
�xo��u�>�C������^�����vY;��1r�|'�9�%�}A��
+|���?J��X
G��X��'TP&�����ʨ0�DH»�j|R�
4��|��pk ��!M��3�o~��!>?>*+W��&B���}��*z|t�B��%�K�_B7�
}��H4rnh�%����4�u��e`A�D�܃���a�~V��eς4�0���
�3R6�~�w1*�9��pW��F�p_1;-�z:Y�!��l��'m%���Jg�
+endstream
+endobj
+4791 0 obj
+1320
+endobj
+4723 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+4734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 436.772 173.467 447.676]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a4b841053fdf5718c17a018ff650b550a) >>
+>> endobj
+4735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.282 436.772 242.925 447.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+4736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.089 436.772 412.478 447.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+4737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.308 436.772 487.556 447.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+4738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 408.897 173.467 419.801]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a33d58476db85f48e4ad680c69bca524f) >>
+>> endobj
+4739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.804 408.897 278.631 419.801]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 381.022 173.467 391.926]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a2b220dabc613a89a062968101429e58c) >>
+>> endobj
+4741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.282 381.022 255.109 391.926]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+4742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.638 381.022 336.583 391.926]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+4743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 353.146 173.467 364.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) >>
+>> endobj
+4744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.804 353.146 276.947 364.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+4745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 325.271 173.467 336.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a8a6c3f01edb04382620066f17b63b20c) >>
+>> endobj
+4746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.282 325.271 253.426 336.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+4747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.513 325.271 335.458 336.175]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+4748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 297.396 173.467 308.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ae46f7a91b9fac1a62ef875ec5c72aab6) >>
+>> endobj
+4749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.804 297.396 285.256 308.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 269.521 173.467 280.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ac3126925bcd3349b150771d52c19639d) >>
+>> endobj
+4751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.282 269.521 261.735 280.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+4752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.245 269.521 348.19 280.424]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+4753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 241.645 173.467 252.549]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a9720487deabf813a31afd4e9cfe695aa) >>
+>> endobj
+4754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.297 241.645 277.239 252.549]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+4755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.608 241.645 373.074 252.549]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 241.645 513.996 252.549]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 230.064 123.096 240.594]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 189.86 173.467 200.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a9eb55b3f27138d74d5002cc9782fd381) >>
+>> endobj
+4758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.821 189.86 219.422 200.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+4759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.677 189.86 260.404 200.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+4760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.846 189.86 374.312 200.764]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 189.86 513.996 200.764]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 178.278 123.096 188.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 138.074 173.467 148.978]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a2d68c082ea8fcddda6aa41afdd7ab476) >>
+>> endobj
+4763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.363 138.074 246.523 148.978]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+4764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.576 138.074 374.042 148.978]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 138.074 513.996 148.978]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 126.492 123.096 137.023]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 86.288 173.467 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) >>
+>> endobj
+4767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.424 86.288 272.693 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+4768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.73 86.288 397.196 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.805 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.707 145.781 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4774 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4778 0 obj <<
+/D [4776 0 R /XYZ 89 770.89 null]
+>> endobj
+4779 0 obj <<
+/D [4776 0 R /XYZ 90 455.756 null]
+>> endobj
+4775 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F111 1509 0 R /F39 2335 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im5 4722 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4823 0 obj <<
+/Length 2590      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�6~�_���4� H�Dn�:Nƽ���n{�$��$��"�����v�%FQ�r�'R���]|����<�<�����E�{�H��ws�I�E�$��_
�݈����͏�/b¤�Y���������5���ߜ|<a�E=f�$�������-��G�_�޽
����3�O�yB�.�O��
�t�Ƹ$4�"�cF�6i���
�Qb
g�.��R-�q��ܴ�ھ��)MǼNƌ��<�LS�L�j���66Z���qׄs"�M'2�J��<�M2�)﬋޾<��MB
+�N�����;�Q��4��"�j�9 ��,����Gw����ܳb�δ���vz�%U5$k���BG�.���y}���_7��B�؎o�����k at d<�f���O�)�N{�91��c��6�M9���"͓r;�J��7pW���E9f�}�#��Nj�*���7���q��R��PU�]�RysN at u�@ҹy�3�5.~�
�R�0h��{J}3&:�" b�A�2�̠��>��Ē�!9,$B�f�v at JDg̀y�g��E
+vVi�O�
����� ���rO,�$�_P���R�4�ld����1���Dǀ�u�T�(��B��tޤ�yVT
VT?���1�	d�B�� ���gB�	�şN1�/x�ȉI d�U�9��Z��V�crӱ@$�a��C�i{�fE�
�8n�t�ɲ�	k��vjZ2��gc�2�- #�͘��
 �� ;Q�0�7 �
ze �޸
�ieTWcN��aim�M���G-��C1#���w�p�>+���ĘzS�A��)����O+5�T
��)�IV
�5��<� 2��t��k�7�f
	i:+6��/uԮ�U�{�B�E-�׳�%�`-|���a_ץ�ö�6%.��f��V�<
]� ��֘����j��������4M t~`��@� ��\�I�5!���t�K
�Î�g]�Ԃ
�
t�;���~�,r��Đv5&������
+�����ִ� �
s���=�Q�u�*������g�3�SAx�� ۚ�����$�"ϐ;pz�cZ���jf�t��p	�".�D�j������k6ֲ��6�PH�2���.^��0̊�L		޵L�Qf�&~D�f ������T�>��9�r;��LKb

N�� >�꤬�	�e��M��U�l����]��fB���W2�c<=WϺ)�̳^�Ř������iW-.]7�B����� U�_Cȉ��E-��R�e����&ɠ@
�P
H2�,��ˆ���U�%ef�v��X��i�R\�*س~ߛ
���
���#v@������
�F��5}����2��\�4�s���MQR���
+<�B��
7_�! ��~8L�Ge.c�`=���b#ನ�'RHoY��J�\
D����|����2��u�u�j������b����UO�Md�3��cH w\��场�t`��0�&H8�p�DgI=��Ƅ;�P��x���C��-)�(�e�e�6�J��]k�Fmhp��
�N�(%���p� A; &$�s�����㗪ʴ�.�E
�c�F���/"�E���
иL���
��~Δ�+��O�w&�|��K󆊘��b�,+^8�#Z��*�)��
=���Լ~�w�)�ؤ�zp��Wc6��
+����Z�����e�"�)y+DW�cct��$hI�NL��'��
FB6����p
�~kF���s��
�	���#�<c�^�p��Y����U���hÁs���(W-k?� ;G��SKM���g�ըf��Z2�k~^�7x՗���#�&o�՘�9-W���"k
���T
���H,�@�C�k6��'��������2$�z��T�	��!T�� ��
+��Y��C���ɓ���y@	��Y?�	���.�xQ�êH	���Pŧ�"�1� �|����,�>������ޮ�"9v�.n��
��f�oh �
+b�

�/������VƼ�ֶе-��VU:d
P�n��� !����~�x�l^W��L��ᒒH���4��Ӂu� xa��ty�����sK��m�̹]4����+��]Ի4� }�������
+H���N����yZ8|���XzC��h���P�x�s��ӎ��Us9�;L���v�3�-���A�N3,T6�G��d���+��gO�~��ľ�O�G���������!�I�Q_���R�����6�p 	�R��R����|��NlQ$������9�&'£Lph�:e�e��z
�����:�z֠���z�h�F��c�/
�s�,m��Nك���!dD��
��H�~�h}h���c~�p�?�V�
X��@���8�:5q�q
�L�%��P��E��X�|�=J����l�g�M=Q�c�����$x@� f�ph�b�����쿬����C����T�,���t�ug3�6�^�|�y�:q�7�6�r?��$��Y�߮�^���*U�m
B�o~�N�M��d���
#
���V��/�k����~kU�ljf�Np��S�ONOg��J�wd^��9��Ih��n������X��:�� ���-�G
+endstream
+endobj
+4822 0 obj <<
+/Type /Page
+/Contents 4823 0 R
+/Resources 4821 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4721 0 R
+/Annots [ 4770 0 R 4771 0 R 4772 0 R 4773 0 R 4803 0 R 4804 0 R 4805 0 R 4806 0 R 4807 0 R 4808 0 R 4809 0 R 4810 0 R 4811 0 R 4812 0 R 4813 0 R 4814 0 R 4815 0 R 4816 0 R 4817 0 R 4818 0 R 4819 0 R 4820 0 R ]
+>> endobj
+4770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.006 173.467 705.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_ac86d25d06285c9a2e890770fed084574) >>
+>> endobj
+4771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.804 695.006 221.058 705.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+4772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.338 695.006 325.804 705.91]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.603 695.006 469.354 705.91]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.11 173.467 678.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_afaae25a26dbecf9341c7fb2c2575f81f) >>
+>> endobj
+4804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.804 667.11 260.36 678.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.924 667.11 353.39 678.014]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+4806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.189 667.11 496.941 678.014]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+4807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 639.215 173.467 650.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.206 639.215 225.013 650.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a59d06e9b429faef7a632d58e4a0b12bd) >>
+>> endobj
+4809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.35 639.215 311.906 650.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 611.319 173.467 622.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.206 611.319 225.013 622.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a6f581bf46ab0488f444977453ba2ea2d) >>
+>> endobj
+4812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.35 611.319 326.292 622.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+4813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 583.424 181.215 594.328]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a09726be54fe2a591787de59eeffdd2ea) >>
+>> endobj
+4814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 555.529 241.112 566.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a5eb7f86790ada6549123a0225d68a4de) >>
+>> endobj
+4815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.449 555.529 328.006 566.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 516.674 255.488 527.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron_a6424da8931d774f6a2e403c1e2f0d09a) >>
+>> endobj
+4817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.826 516.674 342.382 527.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.58 403.213 242.137 414.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+4819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.326 257.952 370.268 268.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+4820 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4824 0 obj <<
+/D [4822 0 R /XYZ 89 770.89 null]
+>> endobj
+4825 0 obj <<
+/D [4822 0 R /XYZ 90 656.475 null]
+>> endobj
+4826 0 obj <<
+/D [4822 0 R /XYZ 90 628.579 null]
+>> endobj
+4827 0 obj <<
+/D [4822 0 R /XYZ 90 600.684 null]
+>> endobj
+4828 0 obj <<
+/D [4822 0 R /XYZ 90 535.66 null]
+>> endobj
+4829 0 obj <<
+/D [4822 0 R /XYZ 90 465.865 null]
+>> endobj
+4830 0 obj <<
+/D [4822 0 R /XYZ 90 465.865 null]
+>> endobj
+4831 0 obj <<
+/D [4822 0 R /XYZ 90 232.423 null]
+>> endobj
+4792 0 obj <<
+/D [4822 0 R /XYZ 90 210.046 null]
+>> endobj
+4832 0 obj <<
+/D [4822 0 R /XYZ 90 210.046 null]
+>> endobj
+4833 0 obj <<
+/D [4822 0 R /XYZ 90 139.5 null]
+>> endobj
+4821 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F91 766 0 R /F32 772 0 R /F10 773 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4840 0 obj <<
+/Length 2150      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~�_�S���]귝I65�Tu2�O��.�njm� N��~H`���mu*[�'0�>�stn� {
{?ܽ{�{�o�<�T@�q�)�I���������dJ0��Ä`?�W��Äb?[n_�,��~N��(��߿��1!����)����������O��d*9�P�Ϗ?�}�x�厀h�#F�d�ū�O��7��?z1zփV
�
�K��ݯw�j�^�mu��*��5Tc�I�P�������^�I��@�K����T���6ux�A��1Q�
G

�.�&H	�K�J�!�y
��9ሂ�-H��y�l�la\ ��gfs�rv���|y�y>���r�O���b�˜*j���}
���hH�B��||ɳ	��6n�y�
�����������nVO�d�Ӣqڽe� )��zB�>�g6
�mnV��d�Y��ri�3�XG�
خ�N�^0���[Gà�$�;
�0���
��И�]V�뭣<Z�R���Qn͚�i'Z�O�
���Z[�뼻Y�o�
s��v#�h�&���Qm6�d������K�$�U��$˲��n��K�؛R�wUQD�JAy])�:��p��T��M�
+Uk���M�D!5��<L�4!�7�i@�7

+P���$0�p2
��"
.O9dܐ;Y�3�Xv� �d�$J�ą$
Să�O�

<�r��rVis\�
�!x	o���jT
%i��q[�zef�9qΚߘ���!�A3".@�F�1�@��2"

4�I�
�)I�I�?�r�S�&�7C)
������2���s���0SEP����
�o�أ�A?ϳUo\a
kR��\���E���'�3�\�#)%}�yR�"�_�
�[�+
�7e�2�R�U��i}��K&�V�y����_����@��Ӎ+�����9b��	(h�_Q��5����BP�v�
��"���Iы
+EW��=)Z7=��M��
��4I{.�s�s����z���  bN\z�Ո�Q,�U��9�X"�DN��W��c�+�� .)V�*�E(¬�Q���ñ�t±�G�LfO��0�/6���q\˥�
��S�J���t�l핫1�
��������l������.FR��-wԝ+H&���	�t¨���1
6�YT�iH]0��$P
"4Ԣ'�Xn�b}�-N�`�p �%#$���Ұ�CJ!D��d��
C�Q�@�;J�f`�)�:tb�=��M��x��>��M9�
�J܊;۬V��퀘
,���k�
�꒕�� o�
4C^J0r
W�J���5LC��4Nv@,��
�'t�Xw?L����FXp4�`����K��mR
2���M���8��
�~렂>Ӏe3��4��
�Ci�H��4�f:^F��
D<�}da{��9i���*�Ԧ�g
G�B�!8e2
�;�hcm�����&�Es�l�-��~hN�ˬ�8��f]��� *E�.C�5�	)(ђ9b�Ph��|�W���
V�I2
W]I�e]�ȸK��S��><.�8Z.��s�衿��
�K�����;K��iX����
+~���8���
�] sy�t=�eܟ��ι�Va�ؼf�Gኹp��;��p�
+u��]j�p�=U���=M����z�
ug
+!r��c7a������A����ܿ�.e���$���;���=�r�[��#��Q,�!IwľY��|����:�y���) ����{E��ً#�������m�F�嫼W\4V���~���#�'��@�|��
��vjR�g�)�5- �uc�
+�Q�AV���{ŝ��}�x�Vǽ  sy�t=�e܂а���!� �ԍ�˾�0�`S
+����(��vy��M+�+g��p�eC*�j6�⸚C���e�Rpj(g6��A�%�>���D5�0��<Ыu�5����4^";#��u�U���D�s��o0�� ��%,M��4�2+6y��ڣ������9+ (�4�n�
���OG)����L�q��)��KOhpU�WW

~67�)t��D��_����c��C϶�!��s
V�&2ߓ~���E#����k܉C$����_�r}����fQ�t��lu�?vt��,U3w�tZ��q�$����l? �j=
+���
�)i=�{_��L��~X1�
���޾�
�%
+endstream
+endobj
+4839 0 obj <<
+/Type /Page
+/Contents 4840 0 R
+/Resources 4838 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4721 0 R
+/Annots [ 4837 0 R ]
+>> endobj
+4837 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4841 0 obj <<
+/D [4839 0 R /XYZ 89 770.89 null]
+>> endobj
+4842 0 obj <<
+/D [4839 0 R /XYZ 90 718.682 null]
+>> endobj
+4793 0 obj <<
+/D [4839 0 R /XYZ 465.707 666.388 null]
+>> endobj
+4843 0 obj <<
+/D [4839 0 R /XYZ 90 659.748 null]
+>> endobj
+4844 0 obj <<
+/D [4839 0 R /XYZ 90 573.549 null]
+>> endobj
+4845 0 obj <<
+/D [4839 0 R /XYZ 90 519.86 null]
+>> endobj
+4794 0 obj <<
+/D [4839 0 R /XYZ 90 485.19 null]
+>> endobj
+4846 0 obj <<
+/D [4839 0 R /XYZ 90 480.707 null]
+>> endobj
+4847 0 obj <<
+/D [4839 0 R /XYZ 90 392.352 null]
+>> endobj
+4848 0 obj <<
+/D [4839 0 R /XYZ 90 314.354 null]
+>> endobj
+4795 0 obj <<
+/D [4839 0 R /XYZ 90 279.684 null]
+>> endobj
+4849 0 obj <<
+/D [4839 0 R /XYZ 90 275.201 null]
+>> endobj
+4850 0 obj <<
+/D [4839 0 R /XYZ 90 186.845 null]
+>> endobj
+4851 0 obj <<
+/D [4839 0 R /XYZ 90 133.156 null]
+>> endobj
+4796 0 obj <<
+/D [4839 0 R /XYZ 90 81.969 null]
+>> endobj
+4852 0 obj <<
+/D [4839 0 R /XYZ 90 77.486 null]
+>> endobj
+4838 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4856 0 obj <<
+/Length 2192      
+/Filter /FlateDecode
+>>
+stream
+x��Z]��}���S+5�ߤ��C2��n&Ӯ
4�,Z[�jK�$'��K��%[�e[�b�$K��!y�=G�ƈ
+o�as�~��-\����S�
P ��/^�=�$$��{|"�����I�H ��}��������y7z3
�:"�
+{�4 ���l5��{sx�
���n�<N\����?G���"
+�"B!F�H�'c�?�)��l
#!�#
6Lo��.<:�!:�@�B����1�~�
�o_�yֆ P�k1�1�7��?ea6�h{�p<<���3D�Q�`L��&�H� Г!�0L�=��'Ti�,���0(����(���H���ۼ�Ve�ưF���!��IT-�_Z��0
��7��e�E��l=�M֛�ͲdH�����j5f�߶�d
���`�ġuo&��]�q����ݵ*1�}'q
7�
+��M(E�㷛x9�a�����P^���n����E3�'0�8Y4:��z���.��ȑM=�WHb;��5j%N^�,.
��j��Ù��ǫ(��C5��n�:8�X�f�:X�	�&ȑ�DW�iT���(3.�7�
^[���m�Ҽ;̺�j�Vѝv%�%���E`����C�vZ�
e��V�\��
LE��$D����r�O-��
7�h�� ��R����ͽq8s�{����y�
�4��a�U罋��k�-��뙤��<�-�,���;��MRU�>K��e��4d^��V��Y��#��� ��b5��.��aN�"�̊M���p[�|�s �,�.u-��&�
Dc}�;*�D��
=��ش�CF��mD�� %i���֝
) CS�	
���q�}��F$�a�@�s9
�t�p�t�|�ᬈg�r����˘
+�%ʢ���"�<-vޚ&��K���0�;G6t��W�t�'�_��.dL�n�:��[9�X�� a�As)$��
o>ϢuT|�{�028J~�I�/X��m��
+
I��<I��C��[͢}N8��ȥ�,�^�ÝP�X��+(�&/���q2���-\��g��`�ZPOE��SH��!�	����e
�=���6�	� Xs���,5y�w�9�c�9s�v��S���ݶS^>�Ll
D�u�-oKf+���둤�u��I�	��VsB��u� �a\F�U�5�-�
�bKc�\Vb���
nx:`��
4o�y����$Uٿ�`�k���*4�\PV BUVh@�[Wb|WW�\�
�����B$&2qYY�����_�J�ki��6Q2�:�
�J��2Ѐ�|��s�W��?Q�0	�'t3�|�>���,.���Fxpu9`/�:� ��r}�2�~�!� ��p�eJ������Hv���p�<�æJ]�s�,7�h�fi��y�7w�Y���9|��N��1�ɀ�u�����`'o���O�7�Cp{
��~;���� �� �;^�~Z�
�c��8 Ȥ�8.��]�䂫3L.$�1y���Q��
��>`�S:�W�9�I �2�O��]C�
n�* *ʁNJ@GR���m0Z����S�j���	���j�?WU1B7��Y�i���q�, at K��,����(��
=
 B��y0��2���8�( 6 1u�Q��H��+;
+�~=N����G7X<��)�Q֐亿$7��Ch��
D� *Uހ�W�1���K�C� �)�
H�4��&>]olt����
�8�ml
k`���Tg;�۱�~�Xg�$h��C�Z/��q�}~X�y�f�Sȴ;V6=��M/�=���ھJ�|G��<����ӏO�������y�֩=���oP�r ��@]���5�����
E
+�Ӆ��.���<�t;����s4GGT��~

 ��j���~�a��?)�<�����L1ߑ����(ZI�����ʍ ZJŴ�-���5�=�k5q=��;
&�C���Kߡ@=��;D��
�Ⴡ4�/0�M�}<�6H�T�4�����;�/�
�M�HR���%F�|z��$��p�Ŷ�y��F�(����Y��l]�W��}Y��/�>�����������	؛�
V� ߅�����lB�A�I���]y��<��<�w��c�l*�4��7�$�l_�"� �j� L)�`�}9F*��w�#K�5L
+����עX���}�,��b�X)�;����͗ꏶ��b�8�����1�r��^�+�E	�
+endstream
+endobj
+4855 0 obj <<
+/Type /Page
+/Contents 4856 0 R
+/Resources 4854 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4721 0 R
+/Annots [ 4853 0 R ]
+>> endobj
+4853 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4857 0 obj <<
+/D [4855 0 R /XYZ 89 770.89 null]
+>> endobj
+4858 0 obj <<
+/D [4855 0 R /XYZ 90 640.379 null]
+>> endobj
+4859 0 obj <<
+/D [4855 0 R /XYZ 90 562.381 null]
+>> endobj
+4797 0 obj <<
+/D [4855 0 R /XYZ 90 515.756 null]
+>> endobj
+4860 0 obj <<
+/D [4855 0 R /XYZ 90 511.273 null]
+>> endobj
+4861 0 obj <<
+/D [4855 0 R /XYZ 90 422.918 null]
+>> endobj
+4798 0 obj <<
+/D [4855 0 R /XYZ 90 388.248 null]
+>> endobj
+4862 0 obj <<
+/D [4855 0 R /XYZ 90 383.765 null]
+>> endobj
+4863 0 obj <<
+/D [4855 0 R /XYZ 90 295.409 null]
+>> endobj
+4799 0 obj <<
+/D [4855 0 R /XYZ 90 236.431 null]
+>> endobj
+4864 0 obj <<
+/D [4855 0 R /XYZ 90 231.947 null]
+>> endobj
+4865 0 obj <<
+/D [4855 0 R /XYZ 90 161.216 null]
+>> endobj
+4800 0 obj <<
+/D [4855 0 R /XYZ 90 81.969 null]
+>> endobj
+4866 0 obj <<
+/D [4855 0 R /XYZ 90 77.486 null]
+>> endobj
+4854 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4870 0 obj <<
+/Length 2337      
+/Filter /FlateDecode
+>>
+stream
+x��[m����>��O	��=��2y��o����M�>)��j�ڌ�b��f�f�}�i��0c�I6�`h������f0�"X�
�����/fW�o

2��`v
(n���k|	Ff2%��vBp�6����0[^ŋ]t�.���v�on^z7&D�Y:�R�×�h�w�����^��c�Lg!�d�q������/WT�q��t0�\}���\�L`F��6�
�����߮�gca�!G��9��hm^
o��(��"�oH�A���)����VHq]
�?o�4ڀuT��m���S
�:!"��m�)b�U���E>���F��y�&�:�*�
���
�>ׁ����{�.�	2�x>��0
+/xBH���S
%H(2��r@����u�\��#�F�\* ��5߾�,mU���EN%\��!�X`�P0�F!,D0�'

�G�Y��
Ƽ�Φ�V{�=� �H$�>Z	�@*��~����
�
����"W�Ѝ!�G=�S6a8|���FRx�
�2�%?&��;�Z$+�8����x�:�>��:�S�<�"�M��_������}��og?�Z���px��)��L$am{o�C���4��"�+�i
4�i	ˋ�q�C��]'�$/d�9����M-
A�B�RD 
+,�zQ��
��-�A�	���<����
Q�Y
�)$)w�g+F�>��$]Ż$߻�y5l����H6q�O����
���J�.�I�?���y9�.�'�������">֢�f�+��j��h��@���Y����l��K�Mk��}�<)B�&?�
!a
+��Hxg�����b��p��;>���w��%�џ�%j���_V""�� �e�P�ޡ/�El�\Ϝ!�5�����*,=:w��H
+/S�[�DJd zj�+
+W���.t��4Oҥ��Wc��o��ϖ���v�=&���N@� �[�	�H2"�F����D��ET��@ �rT�E���Tj�ZS��*��BQ�/ $�	���,�l/� �p����1�s���P��
�a��H@�Qx���<���ND��Z0
%4�տ���>_�[T�C8����J
��K%p$��c
��u�I��s2vqp߿0A��ʢ)\�0�|qs���e���w�	�R}�w
+Nc6�}`��
Ș��z
�9����o�l��&T��A�`D�ɽ=*�E셲(��E��E�Ӫ�p�89T�%�� @��B��E�8�E��[N
\��a�F�S�V[�n��Ŧ�3I��R�^+�>��AL^����C`�d��Kd��p
+�p��B�^�-��9�!ßZ�	���F
i�H�:��i�.j�Hj�^�\�)4�
�5O���H9�qƘ�kĕ�w at _{�Rj
U8DI9D�2��+SAhg+eJC�UT�쥾xu�~m�P�!�sڇz )?��6�k$�>�sN͉>� �V�w��Bv��yf
E���4]
y�F
�AO�P ��v
E u-5V
��+w�[���qD��E6�)
�W7S��L9L]}��}�L����zH�L��f
+��)�k�����V�i�F$�K,�f�8�:3R�C�ܠ��ע
+
C��j��OO��x
:mu+�2f��:[�����t�{��E>McKth��	����
&a�B=��q�J��j���F9�8���>�̳}э#I�
��K<IE�U��OE��a
#��T���3���T��` c����:` A���
P�L*R&��y���h��H S�Y�`$D�~F¨8�����]Z�f�VF"���n�2��7uy%!B<��`.NRX�8��%aW��Qᬓ�x��Z���w��貯gO*j��GM�t*4�6u�O�/N
W��
�/��է�*��(��*�J��n��;��
+�
����1��F�X��&t:ֶ-�D�LXB�U1gH�y����ƬT_�ۜo\7@��cn��.��1�%�F�6�Db��6����J_�9��8�"���s�ē܆H���>������^v�Ue��B_R�ZT2�2�@X�a��P��ۄ��p�A@�W�1懢L��

+��B`��P����
QV
&%��p�E!�2R�ֿ�%���
+G�yo)������t|��	}N1?�L�'_�
���KM��/��q��=聴
��)7��w���ӛv�/�P�S;�����5�OUN��&$�6�F�����;�i�~?�]��C�>Ty̮��C�xwpA��-��P���q\���WP�}U��QVV
�U�oo��?=,�q�D �j�bV5���v��wq�e�������f�b1)��Jo�C��q���8/nV���nX�*'RڿP,�l
+endstream
+endobj
+4869 0 obj <<
+/Type /Page
+/Contents 4870 0 R
+/Resources 4868 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4879 0 R
+/Annots [ 4867 0 R ]
+>> endobj
+4867 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4871 0 obj <<
+/D [4869 0 R /XYZ 89 770.89 null]
+>> endobj
+4872 0 obj <<
+/D [4869 0 R /XYZ 90 616.469 null]
+>> endobj
+4873 0 obj <<
+/D [4869 0 R /XYZ 90 550.426 null]
+>> endobj
+4801 0 obj <<
+/D [4869 0 R /XYZ 90 503.801 null]
+>> endobj
+4874 0 obj <<
+/D [4869 0 R /XYZ 90 499.318 null]
+>> endobj
+4875 0 obj <<
+/D [4869 0 R /XYZ 90 399.007 null]
+>> endobj
+4802 0 obj <<
+/D [4869 0 R /XYZ 90 351.984 null]
+>> endobj
+4876 0 obj <<
+/D [4869 0 R /XYZ 90 347.501 null]
+>> endobj
+4877 0 obj <<
+/D [4869 0 R /XYZ 90 235.235 null]
+>> endobj
+4834 0 obj <<
+/D [4869 0 R /XYZ 90 186.166 null]
+>> endobj
+4878 0 obj <<
+/D [4869 0 R /XYZ 90 181.683 null]
+>> endobj
+4868 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+4888 0 obj <<
+/Length 2167      
+/Filter /FlateDecode
+>>
+stream
+xڽZmo����_A�@+�޾�m��bN�E�@��A�%J"J�
+%ݝ�}gwI��(Y�1�`�\rgfgg�yfi
�
�x��ͫ{����2�.��
����t�i�S��F�H��_�7�{7�`���Mo~�!��
H�`����	
�)��
|q/mN������opiK��������А��� �y�C�{k&c�GQm�}\�	�]'�{5�>���a��3W&Q��2�P��G&�F"��%��6AF��X�m��6�q�Pa����߫"Yx���

~�!7
��چL��8�{���a�W���>�)
'i5\�����:^y�./F��7,���[�
O�K��9"�
PD ��
+)��>���6��>}M�OW�ַ��Z-���d��$Hѣ�ag{?R=IVY^T��:����H��M70�ի6�|�D��/�@�w���"�ž8G�U�!#��/�+[�ˊ��A6	Ƹ*��Va������mmj�N��QɄn�23:�S[�
��@1E��!L�X LTۄ7�c
������
��#E� �9���]`�;�zMa���|SV@�5�@�)>�
<W���no��#e�Ӱ���&��
+b�$�I-;$�I���g�!�Ig��(�xk<��G{�(��TAX汷��Ŋ��4�����c��„����z��-࢚���_f�߿�������up�_g�R�h!?��W/}L�4��O-���j��끙�����$���
+2�c�G�
l^q���b,J��!Q�e��
'���+ at nbR����M���
+��ƛG������l�O\����i��P����Y�#�MS<"���<O��K��� ΐ�\8��=���������
�:�	�����,��+,��/��\tA�{�r���E2�E
�O��A�C��(�ֆ
�T`�m��
+��ӣ׆������~g��e�J-�af��n��~��{�~��pq��HBCEaL^�(�u.��]+��`a-��}��F���KX-�TOz��R��Ś�͗^-m� �>��^�z��=����dܽ�2	����N�-���L���
+�
�+_phv���7n��|����y���g�Jf��E�ZNq���S-�����5�
������
%�܅�
ZF�OK�
#B��W�J
�P�:1B}3��9�w���㭭�Ϝ�\q�á�#�"pw
��ou� ��
���y~IW����ƉMMQ	)�`�L3�
�b��ٻ���6��
�>Gi��A
f�"U�Y
+-���r��-�Y*c��
Km�"��+���|L��KVr�>����kЎ<��g�@"��e�㲆��(��"���AF�Ify1���4~������u>��@Pæ��e����G4"Tw��E�ǻ�e^TGC�]��.����:Z�Y\D��hY�Ω�2OStI��CS4�o[Xh#�Cf�
X�(��T���
+h�����:�sԁq%�KWq���k[ 6��I���60$�:�_
;�ĈC�[Y���qڢ��
b�k)eۄv�y��1Ag�b��aE�6ܧ9�
��)&��	D5�����I��k3l�I��
-������불w���̔6�
+9PS���L�Q�c�����t
�t����E��
2��
+B��QO�ƥ@l���"�:>��9��6�68>(�aO"�B�U��m�
�+���)��> ��m$� ��y��{7���1]	�Џ��śm
+��G�/�jq6�/6>zd
A����}����q	��
tw������zW'U��	jqzX�U���
RFw"�%K!u���;r��Z��C۫�F�;>�8C{ȠOH���\��Um:�n�"6s6)��h�!���Y娙�Ѭ��m[�F�t���u��x�r곭�Q:���U�ow�
+�j=�ݨ��{wTs���
�=�^}��~�m��؟@V
s
+
�

E�S�A-�4��K���W�z���
r��g�r��̫
A��k?ןL�f��f�Z��R����36���Z(Ъ�[���}��] URr_�`
�w��k2y�/�������U���C��͞�8���]���x�
��qȀ�}�+L���6��7.�6) #�s��~��}������
+�>��dA��x�3g�W�<ɖ.��g��B
�B^��
+endstream
+endobj
+4887 0 obj <<
+/Type /Page
+/Contents 4888 0 R
+/Resources 4886 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4879 0 R
+/Group 4881 0 R
+/Annots [ 4885 0 R ]
+>> endobj
+4880 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 4895 0 R
+/BBox [0 0 418 144]
+/Group 4881 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 4896 0 R>>
+>>
+/Length 557
+/Filter /FlateDecode
+>>
+stream
+x��UMo�0
��W��%�aI��C�a��
�ء�!m�C2`�a�mي3�-z
���D=�'�Y��6�Ѻ�U����o��yzě-����������wH5���
+��x��6�"��#~�\���KdpeQ�Y͸
I�&LN�B,2TԩN`���� �)���kj�01v'�9TT�h�p����m�F�V�ib[k5�6����r9��A�@���מ4�ns����a����=�~츘�;b{��T\;�v��I�aʄI�35�#W6���-sO 
Lf��\�b
+��Ʃ~e�`�XN1�"2�f��	���l/$�`�Р���V�h��[4��U,׿�
+��l�L��f~3T
׬��H��6
���9��g�K�Pr�RK��;��L������n�
L����1��"q�we�y�)]���_O�C��3[���9ø�ٙ��M�Z�J�����F[���h���W�	�
uA�?���f?ɵ�"٤�ޜ9	����������gb��ц���)���u�A��z
Q�����mb����X[�}�#���
~^����9
�k
+endstream
+endobj
+4895 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+4896 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /YQTHCQ+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 4897 0 R]
+/ToUnicode 4898 0 R
+>>
+endobj
+4897 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /YQTHCQ+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 4899 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 500 278 611 556 556 667 500 556 584 278 278 500 611 278 584]]
+>>
+endobj
+4898 0 obj
+<<
+/Length 4900 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mk�0����
��E��.�P����? &�Pc���ߘ7l����L�1_ڗV�+�?�,;Z�0jei��V��:ꈧL�r
��r&�]r�-+M�
樮Y���j7vxVsOOc,~��쨯��}���C�%Q�0E�+�*̛���>��*�����v|m�Xꙣ%9+Z��d��RT'n5�
�j"��_<
i� o����mO�"i<��J�<U)(GL�
+�
��@H�N�r�;�� ��
$=塊B,T!P�l�	O<A^�_~N���KP�#��
+�
}r�Up����/C�
~i��/��_N�_:�_�?�W�n��}�#�ֺ����e��Q�c��l�,��ц��
+endstream
+endobj
+4899 0 obj
+<<
+/Type /FontDescriptor
+/FontName /YQTHCQ+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 4901 0 R
+>>
+endobj
+4900 0 obj
+357
+endobj
+4901 0 obj
+<<
+/Length 4902 0 R
+/Filter /FlateDecode
+/Length1 2588
+>>
+stream
+x�UV	l��
��+�qb|5qq�8����r_N
�$�ppHR�
i�iVh���
+m��NT;�m�֭L��Ƥj�V���R���6�5��`G�|����@f�
��������{�c��8s
J�f�}���e`u�ɩ�Ɏ��̏���Dl������cA�ׂ�tI<yta�i�I���<5s(�ؙ:�2@�J�f�\ �_�E�9��+L����Kmz� ׊�4)��W��:x'���� _���U���mn�Jp�<�*≹��#䜚{�5�׸bdN��Wf�ֲ�m�U�V��[Y�0f�	n�Io�~��^�(�:��^㯧=�q؋��۷�t
+��Q�Alܙ�i7�W�"�ޑ���󱺂�
�=;wթ­y]u>��Qg��AߛYZ�i�8
+�rs4YJ�:?��(w���vVF��Zg���Vt��i
F
��`�'�m��H$�S�\�m���'Ż\;�[P`O��
+{l�b�[���n��͓���'V]����5BG��ڮ��PuI�]|�n�q���n�B�)�<��T&��7��`��fr
KR�$B3�z�R�r}�b�ь|x=ʝ;���쉥��P��u_/����7Ν���=ɫ��plZ�EL��E9�� �/F�����S���!(���+��K
+�@�W+�����m�E?;�"׮�8�%����N��t��s�2`|A�+z���!�vv��+?�+�?\e=M�Q��r`�૑2Vj3[`�_Б�0�X�*��0�s��Z��Gr�
�^>���3���Ȟ�}�:�[��'�FW���+�㙏xށ�9�
+K�v�,��|�^�F�NWq����&����D"�M����
U��p��>���
�LEg��M���bk3��?������Y���q����Mv��0��v�k?L$����l��X��8�|r�����G9��O��Ǐ�܄aM-O��/��{��7��Ù+33��i�R�?Fneݒ^��q�G��r�\���)E��W ��o��/p[q�¥w�/v͍߮�>��
<�?h�i��Ӹ{�p��v0����z{���L
��U���@^K�}�
��BԑT�#�f;m���Ϫ���fGUp�s��c4���j�P�m��
��Z����8�`n����D�J
+�Z��uW����8ץV��/I'��%�uNj|
^�$�7X�r�
+wx���\�"�V`P�i���l�K/�2�f�!3�-d��FhU<J��-��W�V���$��
�
���W�>��n"�~W�R���� �S�������1���ި�R���8�f|>>~l|��g�k�sxZ�n.Roؚ������‰��
u�]�������ј�]M7����#ѱ${��|̖�$av�K�����8Nߦ��6
%�G�
��
�2�ݠ,~�J~;���~:��ű�w�:e]��Ƴx���lA�}h�f<�잊/
��5�,�9���}�ԉ
A���&<s�����	SO�R�29��������}�r��3�k�jݵ�Z�%�*���fWV�p�J��(��~�����}���U���hl�.�����>���7,.��
&��+�f��DžW_8� �G�@��Z���I�u��[E
�����O�B
����Ô��z��rw{*���RR��9ԬK
�d���JT 5�� r��)-n;
�].��5�33��ǐ�|&a��mc�YZ"
���5�S��g+��D_�kџ6Ư��T��� 3؆
�_��A�_�~jm������_�5�o�!^�*���*Y�N�]�>e-t�1�+G�G
a�	���l�����S���b�뼅�9�u���;���8ֲ�g¼��u;p��Ժ�x��E�w����
Ƈ�ނ7J4�x�).��}��w%�UJ�D�DŽ
+o)���
+un05�r�/�M��h�����Y��s��"�d�#z\�3׃����fN%C
+endstream
+endobj
+4902 0 obj
+1947
+endobj
+4881 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+4885 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4889 0 obj <<
+/D [4887 0 R /XYZ 89 770.89 null]
+>> endobj
+4890 0 obj <<
+/D [4887 0 R /XYZ 90 720.814 null]
+>> endobj
+4835 0 obj <<
+/D [4887 0 R /XYZ 90 673.79 null]
+>> endobj
+4891 0 obj <<
+/D [4887 0 R /XYZ 90 669.307 null]
+>> endobj
+4892 0 obj <<
+/D [4887 0 R /XYZ 90 583.269 null]
+>> endobj
+4836 0 obj <<
+/D [4887 0 R /XYZ 90 560.892 null]
+>> endobj
+4893 0 obj <<
+/D [4887 0 R /XYZ 90 560.892 null]
+>> endobj
+4894 0 obj <<
+/D [4887 0 R /XYZ 90 478.315 null]
+>> endobj
+1230 0 obj <<
+/D [4887 0 R /XYZ 90 371.883 null]
+>> endobj
+174 0 obj <<
+/D [4887 0 R /XYZ 90 358.705 null]
+>> endobj
+4886 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F118 2438 0 R /F75 562 0 R /F24 537 0 R /F22 2982 0 R /F11 621 0 R >>
+/XObject << /Im6 4880 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4924 0 obj <<
+/Length 1990      
+/Filter /FlateDecode
+>>
+stream
+x��YYo�F~ׯ�SJ�zo�E�
U�4��}J
+��h���RTR��w��%��S=hR�����7'1�"�����8���/nFWӄEiIetsi
%� AIt����#���1�gc��X��٘�x�z|ȖE:��i�x}�2ݗ��j�����/�7����vŘ�8����f��͛�)!
�Ts�� �,��ܒ�` �a�t6�)����J��ߌ
?�o��h�0GT�hB�BT��c*�-
��C�U�|B
���t�O����X�8[�Vi��'�fw�;�fa
�D��Hf��~��9"@G�*�
��h�
��
GKx��Ŵ�>�E�S�U�n����i��INJpn�8;܎�x�/@
+�@T����V���p��J�<�D��6"���R���� H	D�ٝeNV��#�
+��Rw
R��J
��H-+aOC��Җ�e� ����*
+;�XCYT�Ө �!ID-~�R��Ow}}JV���&K��w��{�������
����(
����q'��U�z�m
wS>x׼p�
Ξ4hj'N:��� "Ց1>�CU
+���+��j�qe�b�A��I�;�ձI5cK�
�Y��a��Z�uR$9��9.�
-�����"]��w���v��i\�i^l��C4��J��~"9RD}�~"�Z?�_�D��U�D�޲/����t���-��\�B�2_gc����
k㜑Ȍ��f_�/�J�N}�$1 �R��-�~�ַY�͢^O/�䰷�n����'�<F���Yw�y�
� ��aO��~�3��yk �i|
�'�A_$z��
L�11\��U� �
V%�87��d|���_f��6"���_Sw��?f�	(��
�	.�u����\@]
+8+|t
�rX������w}J4;
@;
�P�Fy��8��I�<@�}Jw{zTs�@DT���,��X�pU���'BA
�>,���}�����c�X�	�8m�1�L���pS�0�M� �����.�,�ͫ,��
��lhb��	�����ƅX>
�/�3�?@wۣn�A4=����:CP�Ib�7M�
i�
�j̵d�H�
+M.���2��um�b���!_-���H}#�Ӷ��3*�W�����?�e
���}�ebձ3���� �D�;�Q�S���j�1y6�;�3G�A��
�%(��|����x��6�2��MN
=���\�JC}���%�1��,��0�7Y���lum,:M��)�)G���0?�|��i�
+A�E��ʮ^�)�a�w�Pˋ��
�+9e*S�n�u檕��xJHEPI��(�f��VW���� Q���$ �V 7P�(3P5��X J KA�� �(�uҖ �%��jK��
+���"Bi��"m���-,���ϝ���hՏ��(�1�v�~|"]�%N�� �:�l�h
U;8����!�ar D 
eAK�����5�!�+�%D ���Y}P��N�
���/�j��P�65oٱsC��\�3��
�D�s;�w����>� j�F���J�����$!m��	N�����c�;�'�T��#U����#�:b�G�9���3sk�l��F*{�ۼl�v������/�߬��jd����M�����B
+�?��~������@ٛ�?3�H�x¡)I���[5*/|�V��������O��ɒ+��Nq�	nSDm�\Ն"3��6���|�,so��� p����S����)�]�޾��S?�p���u�w
M��jc,��%S"�)�Хy�c�u	ݓ"Mm6
��F3c�j��@��XX����Α��Vv�QU�����v�,Ck�(���O�
#)J(;���
p�FG�!�A`P�}�%g����}V|3"�=����`�i_��P�uE�)S�#83��,̼��D��Ts���롇��]_]�
���h�]G��Y4xg=W
#ⵙ��Y�3Nf@�A�$%
� ��	�ʗ���{�2l��^�Y�j
J������

+endstream
+endobj
+4923 0 obj <<
+/Type /Page
+/Contents 4924 0 R
+/Resources 4922 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4879 0 R
+/Annots [ 4882 0 R 4883 0 R 4884 0 R 4903 0 R 4904 0 R 4905 0 R 4906 0 R 4907 0 R 4908 0 R 4909 0 R 4910 0 R 4911 0 R 4912 0 R 4913 0 R 4914 0 R 4915 0 R 4916 0 R 4917 0 R 4918 0 R 4919 0 R 4920 0 R 4921 0 R ]
+>> endobj
+4882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 673.646 224.395 684.55]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 650.712 189.925 660.64]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+4884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 650.712 260.898 660.64]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a56648c2436a8c8b290e54ff23a69d7a9) >>
+>> endobj
+4903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 635.425 422.545 645.33]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.505 224.395 621.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 587.57 232.982 597.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+4906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 587.57 347.013 597.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a311e87a81daa4ca81dfb5ff62bd29b0f) >>
+>> endobj
+4907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 572.283 389.11 582.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 547.363 224.395 558.267]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 524.429 254.671 534.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+4910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 524.429 390.391 534.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_aef498310bbb162748eb0cc7c1bb07fd8) >>
+>> endobj
+4911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 509.141 465.458 519.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 454.92 169.81 465.45]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a02093e67947f8d2936d16e50a8f0b3e6) >>
+>> endobj
+4913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 454.92 309.485 465.45]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+4914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 454.92 514.653 465.45]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+4915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 442.965 227.553 453.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+4916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 415.315 169.013 426.219]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a77967b19f065c13620c847e2b08b81f5) >>
+>> endobj
+4917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 415.315 306.008 426.219]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) >>
+>> endobj
+4918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 353.651 258.274 364.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a8f7ce2a1a1cb1c97a7883f945a7a6686) >>
+>> endobj
+4919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.042 353.651 372.526 364.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+4920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 317.031 266.023 327.935]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a4361018a588858b1fe08b1b0c3db3dee) >>
+>> endobj
+4921 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4925 0 obj <<
+/D [4923 0 R /XYZ 89 770.89 null]
+>> endobj
+4926 0 obj <<
+/D [4923 0 R /XYZ 90 702.288 null]
+>> endobj
+4927 0 obj <<
+/D [4923 0 R /XYZ 90 702.288 null]
+>> endobj
+4928 0 obj <<
+/D [4923 0 R /XYZ 90 639.41 null]
+>> endobj
+4929 0 obj <<
+/D [4923 0 R /XYZ 90 576.268 null]
+>> endobj
+4930 0 obj <<
+/D [4923 0 R /XYZ 90 473.23 null]
+>> endobj
+4931 0 obj <<
+/D [4923 0 R /XYZ 90 432.265 null]
+>> endobj
+4932 0 obj <<
+/D [4923 0 R /XYZ 90 370.323 null]
+>> endobj
+4933 0 obj <<
+/D [4923 0 R /XYZ 90 331.989 null]
+>> endobj
+4934 0 obj <<
+/D [4923 0 R /XYZ 90 269.421 null]
+>> endobj
+4935 0 obj <<
+/D [4923 0 R /XYZ 90 269.421 null]
+>> endobj
+4936 0 obj <<
+/D [4923 0 R /XYZ 90 206.77 null]
+>> endobj
+4922 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F67 3022 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4947 0 obj <<
+/Length 3157      
+/Filter /FlateDecode
+>>
+stream
+x��[����~� ����}?.M���I��_��q�IԝJ�P�
��샏�V�r��} E.wgg~3���=��g8����7O��
2���f��)n���k��
�ǯn�ɘԈ	_��Ͼ�����n^�w_�\�|A�Έ�@ ������+����7F���k��8ep-����A�������$4�'�6c�)�‹��bUL�ů�͢Z�sJ������
+�����j������:�cBF�<��z
݄߮�"=���'F4�s��&A�bc�|zE����iT��
t�=G���_B��"�R�+��\�68��(�� 	��
�\q^�v�׎#�D3�wJ\��EF�H�h<�84�	LMģ�hj��l�Q�H�h�?Y�R2I$:�-���0$I	�*�A�,��V�)����Y.�;b
+2��qWX���͛1����(���{2�W�r�����IHM���
�o�z�+��?�Or�,��ď���0��n��'Ӎ��z,�ɦ��;��� �
l9��RnmJ�!쭷�h)�h�0�\�E��>�hDL3G��WHk
-�L��-.�@
S��A
�I@!\b�h}��0<)�ցA'M�=
�a��,�(�?�2�+�	P�&�2A�#Bx-2@��S5�
5�J�0᭽1q�����h����-��'�}��v��P�v��Ihб���Y>K*S	�
�08)�e=y�.��}n�#&�
��
�>
�I㽞(R�Ʋ.vu��W����7��u	��%��0�E��|�
B}��og��N�AɌ
�
	%���^�s&G��u5g
�SК)��7�j1�>"bT�����-�G������ma��
:Iv
b�4p(�@z!L�
�ǞV��j���i���_kX�C���>���@ �a��:!�@�����~Č��� ������X�[	�>
�D�=}B��,Ҕ�q�x�TL0Q����p�e�ٯ	
'f�t���M��R�M����@~�s0uQ��И��61Hn$��9��9��R, N�b%$�6X����&4y��M���F~X��aX�c��싙^$!m��s7s��;����0�g:Y7(�ʂ���2��(DX��F��È' B��!v�OB=
G���^�����AO!BG��cE�,�}*}j HE��^�;�o���Q�D���L�)_:Ly��Ȏ#�gIr���S_ifY�-��81Q�6���`9Xv'چ?J�x"�����r�����xQq�&�����D �T��T"E���&$���*�Ӕ �궃WI�-�3���:�aQ�P4L6��gm)m [...]
+�
������M����0	�xU	`hL����A���@L�m��|�h�i����/rFi∫:"
+�x1z^,���
]mW�n��j�]��߆�v��1m��g�D�#F��G d*(vmc�_}
Cѫm�y�X�&K[��ttu��_G!��2ٲ��Ю�߫h��vw�(�{A]W
>���
ǹ�5�=$��� �M�r	p3�zj�*xb/��0f�f�
b1N��Gb]Aԛ�6
m�1������KWL���G��\b�m yI�m�mc�G�����wYo
=�[�ᲿN��w���$�0
�_X��c����+����c
Y�v �scb:�i�=H��zP)z
=(`�d���h�.K�!�El��
[�vB���c9�Ɨ�`���)W׷�.[�`���硤w����Yԥ�O�K at C?j棣 ������mK�;J'
XO�a�4��xTb`��&l
��$�t���d �:�>��2Axυn�Q��+[V���8pU�E���4�M�@�<!Nc��
�b�1L밺bED��UD
+���>}��=��&e*�D/@M�Pb���q\���~/_/��vR�:�^rpef�����Y�b�lP�fP�w��:�����޴��Ù��$KQ���=��d=�X'fF5̞��s1
��`��`
+��
<��$���)�.`	��4m�X'��r�6j��
+�PXo/���.��=�oH7),�Ʈ�T Cts��Ѥ~�$��%�G�}�_�wÓZ�b[��Q-
���z�~�
���
��8H�p�0�֯�|���1��1ݮ��vc�| ݯ6bI�Ja�H�/T��4��^�@n��¦] �~scA�9t�

����U�@��}�ּY0�
?(P?�@7qL���}��_��RncΈ����1�Pa~

1��t�b�4�g��f�<��'���8-���la�=�ؓ@�i�yoq���\�8���
^��w;�?�m����	i�q{�7��8Nl�Ǚ�z;�Ŭ�=Ip)B	�
-�O�ujTFSm�X�p���:Pʜ��vg��E��E1d��r��vV����r^�MV�-'��4���}NqV,�$=��.�
���0/ʙ�I�9�_/��V�{J��K�׵�L at z~{]�o�Y=��殞�o//�H���e	q=&�s f�	���\�ތ5���'~����ʶ�t`��=�Я
��d�"B�i����mЙE��������*7'=�D�y]- ��&��6<�1�,.�y�b;�g S��	;JE��e.0
=>���a_��7�h�+��HXWn*�!XNU
!݁b�*|9@�V;���
Dbĕp}5���1����i�Gc�j��<P��RFx��x��p�cX/���A)�)��� [...]
3�������f�8�]_�o��.�?�����|��6����{wF$��U�-4�q� ��Eҫ���S+�?<G�ɤ��TA�����ӧw��u��G�r�¶�2��$�*� s�*s>��� dEC��ƍ 
+endstream
+endobj
+4946 0 obj <<
+/Type /Page
+/Contents 4947 0 R
+/Resources 4945 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4879 0 R
+/Annots [ 4941 0 R 4950 0 R 4942 0 R 4951 0 R 4943 0 R 4944 0 R ]
+>> endobj
+4941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.089 504.369 513.996 516.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+4950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 492.747 126.862 503.815]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+4942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.811 492.747 513.996 503.815]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+4951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 481.639 126.862 489.285]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+4943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 191.13 501.708 202.034]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+4944 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4948 0 obj <<
+/D [4946 0 R /XYZ 89 770.89 null]
+>> endobj
+4952 0 obj <<
+/D [4946 0 R /XYZ 90 468.065 null]
+>> endobj
+4940 0 obj <<
+/D [4946 0 R /XYZ 90 444.842 null]
+>> endobj
+4953 0 obj <<
+/D [4946 0 R /XYZ 90 444.842 null]
+>> endobj
+4954 0 obj <<
+/D [4946 0 R /XYZ 90 332.76 null]
+>> endobj
+1735 0 obj <<
+/D [4946 0 R /XYZ 90 145.154 null]
+>> endobj
+178 0 obj <<
+/D [4946 0 R /XYZ 90 136.92 null]
+>> endobj
+4945 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F24 537 0 R /F35 1248 0 R /F100 4949 0 R /F75 562 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+4979 0 obj <<
+/Length 1816      
+/Filter /FlateDecode
+>>
+stream
+x��YYo�F~ׯ P ��h�7w��@��Es4��>%�AKk�E)$�T���].O
�%(��<vgg���fF��<����'�����iIepyh
D\#!�n�
	F��'c
��	�|_��)��������er������i\�W�W&��e~�t�X,�����'g�t�!�	h���Z�S�
[��
k
+�����!��b���?��
�4��b<�LV��b�ƥ��\�g��dS3&�&RX��_.GGV
+H�@�
+�����8����FL��[�8e�?
ތ�a�9FT�K��{@��A`a� ��.xf�8I�
t�
+�i��ʤ��9��L�D
L(G��J�ϰY�p
+���c�9�8�
lM^&�ܯ�L�`����Y�¿W�)
+��{V.���r�W���AVG�
����;�֯�-���ʸl���*��I������O.���d��ݙ/�VS
K�嘊�Sc�;�ijN{�D"� &W
�w������U�no�7=�:��۴�z`RKe
�w��.�����R��I��CBEM�ա�уH�x$�,��
�cF!�DŽ�UBo�@�B�8*P���.=*OT�Yd�
+����!��h_�����fD#�p���(��w����rN�_r����<j�R
+G�$�[<k��e�G�Ԛ1	���0&��1'.�'T3�!�U���I�ӄAv l=�zf+�F8@^{��@�2�>7v��$����QeئհhueE�x���a�HI�{t���L��S��B��aY(k��P�Z��(�c�%�,v�����	�C@���s��:և
q�=��@��� "��P�R�����N�"@IHF+
+sv��ey@c���=ȓq�� �P���[=
P��H����\��{{L�2��C!
��]�9�[�/
$�>F��J1�6�֐����T��Ev���i�$�G马,N���T�P��z*�i��8�� ��AP�{P����$�����zqm��2���aHa�K���	Ӭ9���p��{��L��}NO��s��~�c�@���P�uã��l��|N��g�Oy����jI����$�4���&�b���M�j��y�r8����?�	�wB��	����-��z�W�Ś�>[gSK}E�
�헆�(����^BnW�m�s�In�����ᾊ
�?�0�/�۪i
(P�Ί�T��	�Hf.�)?��p�C M,�T�|�'qV��@

bُ�P
+K�f�Fn���
����X�.L�N˻�65)����9�J�8�����qu۾H���/�d^m�ROD
�H
~E�Ru�@�K�d
,c���r��l����Ѧ���DJ(w�ˀ��n���|=��8�M�,.`+�sL=ԗ6�>�f�̮Zv���E�8*U���3sېi}T�e���U+��þ�y������h�%H=]�6_
���!
ab7)�e���x�]g����L�$A��䎩�8k���m�뿾:ok���jD���]�h���8�iR��àF��[,�Q�
2�5�Zd
 �'
�͇c��6U�u����:�AKr�,ى�,���*	b"�BRU�iY3}R&q��ӝs�1a
C��.q��NǙ��*�Փ�r憳#$�1x�6���7v�N
�
�U]k'����ƨ���+��l������
���_��80��<BB��
��/��?
�?"�}�8[��1�Ej?
DV�QVsc@����R�����z1rcE�������,W�''��ya�9�B�l��c�F8j���˼���
$���K��Mk4 Џ0�`Eԭ�^���F���
�-��C�ތ�
+endstream
+endobj
+4978 0 obj <<
+/Type /Page
+/Contents 4979 0 R
+/Resources 4977 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4879 0 R
+/Annots [ 4958 0 R 4959 0 R 4960 0 R 4961 0 R 4962 0 R 4963 0 R 4964 0 R 4965 0 R 4966 0 R 4967 0 R 4968 0 R 4969 0 R 4970 0 R 4971 0 R 4976 0 R ]
+>> endobj
+4958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 281.906 150.493 292.437]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa07ea1b002e7f295fe941b15a8f74711) >>
+>> endobj
+4959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 253.69 141.367 264.594]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) >>
+>> endobj
+4960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.865 253.69 174.293 264.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a584917b259b17e155eb5ea10518320f2) >>
+>> endobj
+4961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 189.852 199.475 200.382]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_acf545e278c4b69db51df0a36e43d4e38) >>
+>> endobj
+4962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 163.681 199.475 174.585]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4058dda09c1a7b6bc6993f703ab1b9ea) >>
+>> endobj
+4963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.812 163.681 301.193 174.585]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+4964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 125.928 199.475 136.832]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0b4f37e65d50f82b84ee59ee550943ac) >>
+>> endobj
+4965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.812 125.928 301.193 136.832]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+4966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.691 125.928 477.247 136.832]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.672 112.356 303.64 122.262]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+4968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 100.131 199.475 111.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4ce2f9170fb3470ba10d87607c3c0bf3) >>
+>> endobj
+4969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.242 100.131 291.799 111.035]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 199.475 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4bed59d493c4fd91537602efb267c938) >>
+>> endobj
+4971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.745 74.333 320.301 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4976 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+4980 0 obj <<
+/D [4978 0 R /XYZ 89 770.89 null]
+>> endobj
+4981 0 obj <<
+/D [4978 0 R /XYZ 90 721.073 null]
+>> endobj
+1736 0 obj <<
+/D [4978 0 R /XYZ 90 633.626 null]
+>> endobj
+182 0 obj <<
+/D [4978 0 R /XYZ 90 626.944 null]
+>> endobj
+4982 0 obj <<
+/D [4978 0 R /XYZ 90 537.482 null]
+>> endobj
+4983 0 obj <<
+/D [4978 0 R /XYZ 90 488.156 null]
+>> endobj
+1737 0 obj <<
+/D [4978 0 R /XYZ 90 419.559 null]
+>> endobj
+186 0 obj <<
+/D [4978 0 R /XYZ 90 412.877 null]
+>> endobj
+4984 0 obj <<
+/D [4978 0 R /XYZ 90 300.5 null]
+>> endobj
+4985 0 obj <<
+/D [4978 0 R /XYZ 90 300.5 null]
+>> endobj
+4986 0 obj <<
+/D [4978 0 R /XYZ 90 206.433 null]
+>> endobj
+4987 0 obj <<
+/D [4978 0 R /XYZ 90 178.922 null]
+>> endobj
+4988 0 obj <<
+/D [4978 0 R /XYZ 90 153.124 null]
+>> endobj
+4989 0 obj <<
+/D [4978 0 R /XYZ 90 115.372 null]
+>> endobj
+4990 0 obj <<
+/D [4978 0 R /XYZ 90 89.574 null]
+>> endobj
+4977 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F22 2982 0 R /F75 562 0 R /F94 771 0 R /F68 3017 0 R /F39 2335 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5037 0 obj <<
+/Length 1164      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�3�7	O�C
;�u�X=�
%B'|Ȥ����
�oY��ƱE�$�����j��97����ud
�
b
+ 8��hf
+h:T �Փo^[�s���I�
��j��>��btz1��njӑqk 5MT`�q�id\����?����I�I1Q��ye�e�R��_�����t�4�
Q�j:�
+E��M
KNW� 3hq�
+�0�ꭂ$.�f�M��DœW�d�<�~ўڈY
/-'�ew�l
�A</z�ė�\��4
�q؂p�1����CI��
Ƭ��@+���}|o���u����6�����h"��:5+��2�6![$i	��͙uT.��|��Ҭq���~��7�
�+s;��������L�%%A|`�����0�t<>�zN�!S�C��q'9։�5�a����wè���K1�'9����ai��xً��̬�/�w��{��JJ�s��l
ᧇL�@H� J��!���O֓P���
��	�C�a�E�!d��Yir��
OC/ˊ�7}f%�֓��ό|= F�
>�Uk�{�M�5נ��%I��j��
Ӗ*
�b\}��se1��0�E՜�W�����B2Wi�[2��(_���
+ҕ����<MCODk
v ����sMN3���3�������?K���e2
�*��%o�r�J��m�`ey��+�ڮ�?j�TK�U�p#��N7�%)7ʃ�HI�e{>v{*ύ�g �l!������`t����r�<l�4��A�ta
+
1���v�4GyY���_l��H��G�$٦�"
�.���p��5��T���r��0�O�]F �>�]������U�J&��/�0�/ﶼ


(�5�����7Fv7��L���T�P� �P`"�u���tA��8�
+s�do�
œ��T��ich�d�r!_μu���v�9jx��� �8 @���p^�d저m����}��#ڜ���u�������G�Z���ޡ�{��yp��;�\�|1y���B� &�e�[�
��v[Vkʎ�yD�w�ֈ(y�F�����l�`T
�z��q�(�������3��d3f�����uU��(}�	�iV{��.��ts��*~�WR�p�}�U�-����:9Ц$Y�V���p��g2��iQ�v=�Y,�N]͒��*
c�iO��
��h�
+endstream
+endobj
+5036 0 obj <<
+/Type /Page
+/Contents 5037 0 R
+/Resources 5035 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 4879 0 R
+/Annots [ 4972 0 R 4973 0 R 4974 0 R 4975 0 R 4992 0 R 4993 0 R 4994 0 R 4995 0 R 4996 0 R 4997 0 R 4998 0 R 4999 0 R 5000 0 R 5001 0 R 5002 0 R 5003 0 R 5004 0 R 5005 0 R 5006 0 R 5007 0 R 5008 0 R 5009 0 R 5010 0 R 5011 0 R 5012 0 R 5013 0 R 5014 0 R 5015 0 R 5016 0 R 5017 0 R 5018 0 R 5019 0 R 5020 0 R 5021 0 R 5022 0 R 5023 0 R 5024 0 R 5025 0 R 5026 0 R 5027 0 R 5028 0 R 5029 0 R 5034 0 R ]
+>> endobj
+4972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.214 199.475 707.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a80f6de87ec43c33fac3832b14a507c0b) >>
+>> endobj
+4973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.525 696.214 323.081 707.118]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 670.735 199.475 681.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a298300b8f88eb674c317b99ad09a474b) >>
+>> endobj
+4975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.12 670.735 313.676 681.639]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 645.256 199.475 656.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a2024878c4c26cb836d454e2e93f40c8f) >>
+>> endobj
+4993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.313 645.256 320.869 656.16]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 619.777 199.475 630.681]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a4f3206ab2d3c47e2014e5b306167c7c0) >>
+>> endobj
+4995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.517 619.777 341.074 630.681]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 594.298 199.475 605.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_acca11ef67e39b711f96604b6bf806feb) >>
+>> endobj
+4997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 594.298 330.264 605.202]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+4998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 568.819 199.475 579.723]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab4d4a0ebee3fcc93490aa029028a810b) >>
+>> endobj
+4999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.487 568.819 333.044 579.723]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 543.34 199.475 554.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1bdc1023fb4478270594d0e965eb90c9) >>
+>> endobj
+5001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.083 543.34 323.639 554.244]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 517.861 199.475 528.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a461dbfcb8f68886137794e4a408fc55e) >>
+>> endobj
+5003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.276 517.861 330.832 528.765]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 492.383 199.475 503.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a74b0a8cfdec7831e7a3e296b3e3751dd) >>
+>> endobj
+5005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.48 492.383 351.036 503.286]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 466.904 199.475 477.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6957dba3dbf92459a364893d7ecfb897) >>
+>> endobj
+5007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.81 466.904 292.366 477.808]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 441.425 199.475 452.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af47ee9cf59cfac8a346660698c61d113) >>
+>> endobj
+5009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.215 441.425 301.771 452.329]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 415.946 199.475 426.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_abf60cc7fa60d33c4fe958126d55cbac2) >>
+>> endobj
+5011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.419 415.946 321.975 426.85]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 390.467 199.475 401.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a77a2c5c27e9c0838fea6e6447b20c320) >>
+>> endobj
+5013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.431 390.467 347.987 401.371]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 364.988 199.475 375.892]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a404beea19c04f4e7bbcfe81aae0d6a7d) >>
+>> endobj
+5015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.873 364.988 347.429 375.892]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 339.509 199.475 350.413]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ae09d1e8f6ab1eea10ceba92f21681110) >>
+>> endobj
+5017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.745 339.509 320.301 350.413]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 302.075 199.475 312.979]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_abce60ff247b3d293291a2ee49f52457b) >>
+>> endobj
+5019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.469 302.075 327.026 312.979]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+5020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 252.686 199.475 263.59]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6d113d317b02ed4e14ff704deb304ce2) >>
+>> endobj
+5021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.812 252.686 301.193 263.59]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.672 239.273 303.64 249.178]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 227.207 199.475 238.111]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a9d2cd0aa9626fd28ec99bde5bff4c020) >>
+>> endobj
+5024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 201.728 199.475 212.632]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aa3de5a2fe7f06d0aa3e4972be2023933) >>
+>> endobj
+5025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 176.249 199.475 187.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afcb46dd5c0701130f067f577f99ef27f) >>
+>> endobj
+5026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 150.77 199.475 161.674]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a24e90bb8bb38d248aca79c76a1717d9d) >>
+>> endobj
+5027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 125.291 199.475 136.195]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a55e9dfdf5da9a55b7523bda6b7f56c78) >>
+>> endobj
+5028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 99.812 199.475 110.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a8abdf2e292960e1fb216ce3c2c0816ff) >>
+>> endobj
+5029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 199.475 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af9d7eaecf113e25020c55ed0bf79eb03) >>
+>> endobj
+5034 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5038 0 obj <<
+/D [5036 0 R /XYZ 89 770.89 null]
+>> endobj
+5039 0 obj <<
+/D [5036 0 R /XYZ 90 711.375 null]
+>> endobj
+5040 0 obj <<
+/D [5036 0 R /XYZ 90 685.896 null]
+>> endobj
+5041 0 obj <<
+/D [5036 0 R /XYZ 90 660.417 null]
+>> endobj
+5042 0 obj <<
+/D [5036 0 R /XYZ 90 634.938 null]
+>> endobj
+5043 0 obj <<
+/D [5036 0 R /XYZ 90 609.459 null]
+>> endobj
+5044 0 obj <<
+/D [5036 0 R /XYZ 90 583.98 null]
+>> endobj
+5045 0 obj <<
+/D [5036 0 R /XYZ 90 558.502 null]
+>> endobj
+5046 0 obj <<
+/D [5036 0 R /XYZ 90 533.023 null]
+>> endobj
+5047 0 obj <<
+/D [5036 0 R /XYZ 90 507.544 null]
+>> endobj
+5048 0 obj <<
+/D [5036 0 R /XYZ 90 482.065 null]
+>> endobj
+5049 0 obj <<
+/D [5036 0 R /XYZ 90 456.586 null]
+>> endobj
+5050 0 obj <<
+/D [5036 0 R /XYZ 90 431.107 null]
+>> endobj
+5051 0 obj <<
+/D [5036 0 R /XYZ 90 405.628 null]
+>> endobj
+5052 0 obj <<
+/D [5036 0 R /XYZ 90 380.149 null]
+>> endobj
+5053 0 obj <<
+/D [5036 0 R /XYZ 90 354.67 null]
+>> endobj
+5054 0 obj <<
+/D [5036 0 R /XYZ 90 329.191 null]
+>> endobj
+5055 0 obj <<
+/D [5036 0 R /XYZ 90 279.802 null]
+>> endobj
+5056 0 obj <<
+/D [5036 0 R /XYZ 90 242.368 null]
+>> endobj
+5057 0 obj <<
+/D [5036 0 R /XYZ 90 216.889 null]
+>> endobj
+5058 0 obj <<
+/D [5036 0 R /XYZ 90 191.41 null]
+>> endobj
+5059 0 obj <<
+/D [5036 0 R /XYZ 90 165.931 null]
+>> endobj
+5060 0 obj <<
+/D [5036 0 R /XYZ 90 140.452 null]
+>> endobj
+5061 0 obj <<
+/D [5036 0 R /XYZ 90 114.973 null]
+>> endobj
+5062 0 obj <<
+/D [5036 0 R /XYZ 90 89.494 null]
+>> endobj
+5035 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F39 2335 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5095 0 obj <<
+/Length 1471      
+/Filter /FlateDecode
+>>
+stream
+x��Zߓ�6~�_�S
+�Z'		���L{�e�����>%�e�'
�/���]I��Gl_l��L� Y�����ve�5�����g�sv!\+@�G=�?�l	 ����zg���t	�ؾt��,��v:]��a^M��0[�z�72��&����"������삐�
+ԥ�%��
�n�4@������`�oN�r�@�;��-�� ����=�&�|��wj�x6
�Ҍ\��'�-��<Nm�	%�����! [��ő�(����!
��0r���'��.\����?
\0�~Ֆ��X�i�
�­ ����I�–����$��$�N���I���Q�0n��y
+��E�OƉ
���!ܾ	ACBJn�r.��`#c�
'�،��P���&��}v���]J�Lj������R�x�P��
��w�w]��?�{0K!y�9n��ߤY|	����J�
z+�.\�a��xN��I�#�
+hN��iZ��!8�p@����})fG�����
����i8^���p��
���T>$y�
�U
��$ߓ�;XN��(M�j<�4�V��!6S��I���	��Vѵ�V at I�a[oB�tk�ё�at�}]�ϣ�i�
+����j f(�I9gg�z�
��ϋ�a�M
��/	L�K>b�_�2/�b͞��Q�
ֺ��$q߫$-g2	�"u_d@�]��B�
|�ìk�{��@k��
۽���M.g���X��q
�}����/Fm��!��]>j^I�+�|���dN�"���.l�gG�������ʈ�ޭC!OR�O��4m��r�`��ʋ�j�]��4T��8.�f���
>
�s�i.w�I���s��+|�s���!�4�x~�D���4�ˤ]��s@Y��d�
�曂
t���@�޻�Mg2
�iV
�}��;�����w�R3�� ݕ
+���Y
�(•��,��2Jg�⥑��od��
e6]VJ��&�y�UN}��Yp�/6��d���,T�~
T����o$���)à:�TW}���J����}
��ҫV��@��{��\�2IJ<�{S����n�k�����n��
��Uu��[�Q�r�������p^���o+~f�.՟fJ�e�x�!����8�h�_��$��)	�� +n����+��pC�ǐX5O�J�ݓ�.����}y8\�*C������k��KB�����3�c����M�1nN�
`���VM}��j9x�
j�ԲF ���
�_���F��Cc-�;�Z�|��D0��6�ֿ��-7���	� Z|ұ1S�;��o�T�b�ZD�	�9u�' �������
E���~���� UV�D0�8�7�����+s�o.�_
���;L�ԩ���V�0Ad�I_!G�~+Kz
�Vy��jx�����~7���wvv��2���{3��t	�]F�@�f�M��>@A�0%�
Cr�h����&BP=�~�,_,�^Į�4�W���c��
+endstream
+endobj
+5094 0 obj <<
+/Type /Page
+/Contents 5095 0 R
+/Resources 5093 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5116 0 R
+/Annots [ 5030 0 R 5031 0 R 5032 0 R 5033 0 R 5063 0 R 5064 0 R 5065 0 R 5066 0 R 5067 0 R 5068 0 R 5069 0 R 5070 0 R 5071 0 R 5072 0 R 5073 0 R 5074 0 R 5075 0 R 5076 0 R 5077 0 R 5078 0 R 5079 0 R 5080 0 R 5081 0 R 5082 0 R 5083 0 R 5084 0 R 5092 0 R ]
+>> endobj
+5030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.305 199.475 707.209]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_afad3fbdebb1ba319083c56fa2ae679e6) >>
+>> endobj
+5031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 671.008 199.475 681.912]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a79f64d099a652834da74cc8fd68f2452) >>
+>> endobj
+5032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 645.711 199.475 656.615]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a164f8732d5fe6b526a34e168145a95ad) >>
+>> endobj
+5033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 620.414 199.475 631.318]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a98dae78cdd16f7127a4b3e18c3976562) >>
+>> endobj
+5063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 595.117 199.475 606.021]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af9daca45c3c1d0d1afd57ab47c6cacd4) >>
+>> endobj
+5064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 569.82 199.475 580.724]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af0647cd431d30a9658d4bdc77e32d9e4) >>
+>> endobj
+5065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 544.523 199.475 555.427]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab19be1f26efb21370e8460b325a7f57c) >>
+>> endobj
+5066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 519.227 199.475 530.13]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a65b1cc4ac0c0c8a2efcbf3d36d4ac0ac) >>
+>> endobj
+5067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 493.93 199.475 504.834]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6afe848ad84ff68d48142caf0599760a) >>
+>> endobj
+5068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 468.633 199.475 479.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ace79521e8aabcba7193a9a2087c50b22) >>
+>> endobj
+5069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 431.381 199.475 442.285]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0d0febd1b0b9373cae658b57f6413ed5) >>
+>> endobj
+5070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 358.636 168.86 369.539]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_af442fec6f6ffdad1948cf89d69c574b3) >>
+>> endobj
+5071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.914 333.712 187.002 344.243]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a111d55b8ee2701ec3d03c00de136cd74) >>
+>> endobj
+5072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.436 308.415 210.524 318.946]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a033db92b1a0ad47eef6ddde4295f38ca) >>
+>> endobj
+5073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 247.252 199.475 258.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 247.252 251.021 258.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6625b3bd49cc1e038931a4c4d04c19f0) >>
+>> endobj
+5075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.359 247.252 352.739 258.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 210 199.475 220.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 210 251.021 220.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ada2aea654f9945088d4ebc062581883d) >>
+>> endobj
+5078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 172.748 199.475 183.652]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 172.748 256.64 183.652]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a257a415453078f71a54d6d0b3b57ff4d) >>
+>> endobj
+5080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.977 172.748 358.358 183.652]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 147.451 199.475 158.355]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 147.451 256.64 158.355]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a8772f767006f16e376d8eca9b1578b73) >>
+>> endobj
+5083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.945 87.006 231.325 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.315 74.333 252.74 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_abdf3631e599e5641e1fea94cfd46a3a2) >>
+>> endobj
+5092 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5096 0 obj <<
+/D [5094 0 R /XYZ 89 770.89 null]
+>> endobj
+5097 0 obj <<
+/D [5094 0 R /XYZ 90 711.421 null]
+>> endobj
+5098 0 obj <<
+/D [5094 0 R /XYZ 90 686.124 null]
+>> endobj
+5099 0 obj <<
+/D [5094 0 R /XYZ 90 660.827 null]
+>> endobj
+5100 0 obj <<
+/D [5094 0 R /XYZ 90 635.53 null]
+>> endobj
+5101 0 obj <<
+/D [5094 0 R /XYZ 90 610.233 null]
+>> endobj
+5102 0 obj <<
+/D [5094 0 R /XYZ 90 584.936 null]
+>> endobj
+5103 0 obj <<
+/D [5094 0 R /XYZ 90 559.639 null]
+>> endobj
+5104 0 obj <<
+/D [5094 0 R /XYZ 90 534.342 null]
+>> endobj
+5105 0 obj <<
+/D [5094 0 R /XYZ 90 509.045 null]
+>> endobj
+5106 0 obj <<
+/D [5094 0 R /XYZ 90 483.748 null]
+>> endobj
+5107 0 obj <<
+/D [5094 0 R /XYZ 90 458.451 null]
+>> endobj
+5108 0 obj <<
+/D [5094 0 R /XYZ 90 375.465 null]
+>> endobj
+5109 0 obj <<
+/D [5094 0 R /XYZ 90 348.454 null]
+>> endobj
+5110 0 obj <<
+/D [5094 0 R /XYZ 90 323.157 null]
+>> endobj
+5111 0 obj <<
+/D [5094 0 R /XYZ 90 262.179 null]
+>> endobj
+5112 0 obj <<
+/D [5094 0 R /XYZ 90 237.071 null]
+>> endobj
+5113 0 obj <<
+/D [5094 0 R /XYZ 90 199.819 null]
+>> endobj
+5114 0 obj <<
+/D [5094 0 R /XYZ 90 162.566 null]
+>> endobj
+5115 0 obj <<
+/D [5094 0 R /XYZ 90 137.27 null]
+>> endobj
+5093 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5149 0 obj <<
+/Length 1161      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�H~�W�%^T���*�U��I9���5�d�(
2VI	o��o��|q�<i�����M��h�յ����G�T�)fd$�V��2�R� !�WǺ,��o�/�#aV����Y��q��N�%]�"� ����~���:����3��/
�[�2x�����%��2�Lu3�Ҡ��n�cD��A�d�������
+F�(�A����&�܊CxRF�£%*5��lw(E��!��d�W���I
+�I2I#.��-���{��M&Tj�L��
+qnF?f#
+�$z�����-���
B�Y{^;��~�x%�d4��\�$ �n
��
&`� 2i #D
�[���&��v�gC�\8m�u��t�%�����).;�.p�n�A/�6� ab�)5������р��x���K�V/��A>�IA݉�d;��2
A�޻^�|��A�0
�̓#���
�w���ĝb���V�X SP�?_bGKD�ɓB�œ�u�s��7
�.描n�Өy֊=���]�j�y>hN!k��AM2m�����#��O:��&U�w��������tE0��S�UR�A?�8�ق�K��Ic�P�/v�@D:�,���@�ZM0��d�������iIw&�
Hē�D�* s
+�D#F�`�˜- #GF�јͱ�bL�
a� xe�n~
�b�߻_��ۥ 
�Ee��V��qp��R�7�W�`ěf0��`6�`�s��*�W�I�E����d�~�#��~*�=>����	g3�>��*ON*�?5�[t�m
�K��6�޳��f�J�L�yJ�n�<�10�<>���	�m9��S���q���T��[^�'�F��nc�ag
{ Bq8�XAZX�Ǘu�����;-�H� �y�i�Vu�ٯ?��\�y�hY."
qf$���߿�Y(_���Y�
/q]��{v���;^��A�ְJﺇ�qK�Y'�:�~j���
*9��{i�b��HQ�؋yS�B¤7�~�0�D)�vN���ќ�E��g�q�&�
��L��� �S���@��ѢYݽ�+E��W��7r��B�����V0l���3^3��0�
����I(��0���;���n�Ǫ���1����oL�n�_�T����
���Q�":'��AX�9�M�W8?
�Fy�􁐅�\ �C���
+endstream
+endobj
+5148 0 obj <<
+/Type /Page
+/Contents 5149 0 R
+/Resources 5147 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5116 0 R
+/Annots [ 5085 0 R 5086 0 R 5087 0 R 5088 0 R 5089 0 R 5090 0 R 5091 0 R 5117 0 R 5118 0 R 5119 0 R 5120 0 R 5121 0 R 5122 0 R 5123 0 R 5124 0 R 5125 0 R 5126 0 R 5127 0 R 5128 0 R 5129 0 R 5130 0 R 5131 0 R 5132 0 R 5133 0 R 5134 0 R 5135 0 R 5136 0 R 5137 0 R 5138 0 R 5139 0 R 5140 0 R 5141 0 R 5142 0 R 5143 0 R 5144 0 R 5145 0 R 5146 0 R ]
+>> endobj
+5085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 685.639 199.475 696.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 685.639 254.14 696.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3dc4a1fb95b9f86f622fbe557265f85d) >>
+>> endobj
+5087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.477 685.639 355.858 696.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 662.92 199.475 673.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 662.92 254.14 673.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a02949da26a3761489d2fb98018010990) >>
+>> endobj
+5090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.945 605.053 231.325 615.24]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.315 592.381 250.24 603.285]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a589cc1d8001fd57ded3f964928e66738) >>
+>> endobj
+5117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 557.707 199.475 568.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 557.707 256.003 568.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6e4e84f9ccaf35d6c56acc6c6c3de53c) >>
+>> endobj
+5119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.34 557.707 357.721 568.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 534.988 199.475 545.892]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 534.988 256.003 545.892]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a7ce6dfd81e04c3eb8d196bf13a96ebe6) >>
+>> endobj
+5122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.945 477.122 231.325 487.308]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.315 464.449 252.103 475.353]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_aafe0bdaacef3657f8ed1368c3d1f374a) >>
+>> endobj
+5124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 429.775 199.475 440.679]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 429.775 253.791 440.679]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ac8b0427ab092068fffe6c4db194e9602) >>
+>> endobj
+5126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.128 429.775 355.509 440.679]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 407.057 199.475 417.961]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 407.057 253.791 417.961]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a6a2d561ac8088ed64a0bb51d8fffcd9b) >>
+>> endobj
+5129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.945 349.19 231.325 359.376]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.315 336.517 249.891 347.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0edbf435f928c1702dc879bc4862bbf8) >>
+>> endobj
+5131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 301.844 199.475 312.748]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 301.844 259.32 312.748]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ab75c0e7d52f4b166574fa66584ce92e4) >>
+>> endobj
+5133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.658 301.844 361.038 312.748]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 279.125 199.475 290.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 279.125 259.32 290.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a1a79ab4c49d7ae4406b56dc2b3d94463) >>
+>> endobj
+5136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.945 221.258 231.325 231.445]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.315 208.586 255.42 219.49]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3f0416bda0c321489e3eb1fdad315c2c) >>
+>> endobj
+5138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 154.886 199.475 165.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 154.886 256.64 165.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a3cb9b031ec4e6fd7e53e53da5b0f04a1) >>
+>> endobj
+5140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 132.167 199.475 143.071]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.973 132.167 246.399 143.071]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_ade4a5582f82333f20fd6a8be13ff8d7f) >>
+>> endobj
+5142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 109.449 199.475 120.353]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.215 109.449 251.839 120.353]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a06c0a4ba25cbc3d59797bf1c73c49497) >>
+>> endobj
+5144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 86.73 199.475 97.634]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+5145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.973 86.73 241.597 97.634]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number_a0803532e7523865597c394e1371d2b16) >>
+>> endobj
+5146 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5150 0 obj <<
+/D [5148 0 R /XYZ 89 770.89 null]
+>> endobj
+5151 0 obj <<
+/D [5148 0 R /XYZ 90 712.065 null]
+>> endobj
+5152 0 obj <<
+/D [5148 0 R /XYZ 90 677.391 null]
+>> endobj
+5153 0 obj <<
+/D [5148 0 R /XYZ 90 654.673 null]
+>> endobj
+5154 0 obj <<
+/D [5148 0 R /XYZ 90 584.133 null]
+>> endobj
+5155 0 obj <<
+/D [5148 0 R /XYZ 90 549.46 null]
+>> endobj
+5156 0 obj <<
+/D [5148 0 R /XYZ 90 526.741 null]
+>> endobj
+5157 0 obj <<
+/D [5148 0 R /XYZ 90 456.202 null]
+>> endobj
+5158 0 obj <<
+/D [5148 0 R /XYZ 90 421.528 null]
+>> endobj
+5159 0 obj <<
+/D [5148 0 R /XYZ 90 398.809 null]
+>> endobj
+5160 0 obj <<
+/D [5148 0 R /XYZ 90 328.27 null]
+>> endobj
+5161 0 obj <<
+/D [5148 0 R /XYZ 90 293.596 null]
+>> endobj
+5162 0 obj <<
+/D [5148 0 R /XYZ 90 270.877 null]
+>> endobj
+5163 0 obj <<
+/D [5148 0 R /XYZ 90 169.168 null]
+>> endobj
+5164 0 obj <<
+/D [5148 0 R /XYZ 90 146.638 null]
+>> endobj
+5165 0 obj <<
+/D [5148 0 R /XYZ 90 123.92 null]
+>> endobj
+5166 0 obj <<
+/D [5148 0 R /XYZ 90 101.201 null]
+>> endobj
+5147 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5176 0 obj <<
+/Length 2026      
+/Filter /FlateDecode
+>>
+stream
+x��Y[�۸~��ЇJ��CR%M�
l��m���4M�@#Ӷ[�Jr&�_��7I�5�
 �>Y��\��
{+{�=��]��C/E)�ܻ]z)�b���������
�c�_�Y��>_����:�������pu�>H),(�����z^mwY
����F�������7b)�2��i�c��4�t�j���ٯ3
+b�h�"'^��}���<~�a��w�m=FC��x�f��acF4����X����� BzCCD��/D�� eiwM^���J����hN
+Y�%�b��d���\�$ý�E�TY-��^�h#�]�
v�̶Bks�ȿ���� ��"b�0�-
��s����M�4V<e*��Q
+1�'
D�
+Ei�v�:K�AGN������B|�s���I4`
a:�@�x0O|���k�\��HN�C��0
+ at j9���o�r&r
+���S9)��]0̢sy2����6]
\��x�t�0E�%n)������v;P^�,+sQ��ՍL�F_P>b+ʶ(W�I�VE@#����(����


�YHj(ˑĈSf
^C��<쵐7Y�����jn��2�����N��y\��^*P̭�u���[�1��j���me$l6��KQ.�&�R��XJ�>bL�Bnj�!(�x�ͅq�Z��iPdW����m�����e���&��¦=l5���ua�P��j��S�(�
�Z( ���C�zhU��jD^�fi��ZjVʁ��H��hh^.��~�N�`-i����m/�*��V�C�JA:�j�I��k���n�.�
F����d�5�p��*ZU�K�x�w�|/}�}'��
��`�XVHr���	&
+9`����?�wq��	:J Gl�t#�L����f��Ȩ���!�`���
$6�068�����g���#�by�[|�Ve0�	 �S�w��l�
u���p+��L��d�
��%
%@�%�����t�\LX^$��ǩU�ˇՂ�4��^M�:�/� 9V�ٕ&�E]A$Z `W�N�L�}���(7E)>�$Q� 4ȅ�����U�HZ �T�@�
��x�j�P/r$3(��>�xM�s�9O\¼�.���YW;��-4wU)�b
8�L��\96z�ͰP6P9�A�F���~-$�M�	m^_V���ˏ̜pĚ�l)�m���j��LP�ٰ�&c��+�XL
+�̏��#�߮���9�J������:���vUS����p�m�|�
+"?.2�%�Qʼ/��`!������~L�hLa��M���u�e�I��� `�<E�F�z¡0�F�������C��8�c����Ql�#
t�ksz$��m�z�{�+���(E��~�e]���eu�O�T܈S����n�A��C]�"+&0
��đ̃#9��
ga���Q��bw
�A8
DS��I�衜�D6�O��kι��3��X�O��e����Hw��700�м���S<L���鮟eV��bW�E�w\��l�tY�Vm���� ~�+l�~�)f��4)��g4���(��~1��F�鸥wd9�i���
n£��jșC��5��=�٫p��
\?5�4�h3
���(��3݃mg:
�I��B�}'˾�%5)�I�����=�=������i�
+8��׵�^J�c�LU	E�A��8v�8a2X.ǎ)Pve����b��3;�W���҇��QB;&�6��L��\*��� �N�j0K�I���r#&��I_�ah�f��_���y.<J]�C�c�����
���=�2�l٠�y
+ʔ��^�|
+
,c5p��?n��ȑ)�d>���H���ˡ�%�j����\-�W�4u�|�|�+4؊���$G?���#��q�bn
�w��x��M�
��7��_��4���<�5��&+�ֽ�4�ai��
A�.�|f�n�	L���^�k�
ԫCb(��oݶ���˻���
+]
g���@�sos��
��
+�@B!��`}aY@�z
�+�&qLՊ�zi?4.��
�8��W�wpx%|
+endstream
+endobj
+5175 0 obj <<
+/Type /Page
+/Contents 5176 0 R
+/Resources 5174 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5116 0 R
+/Annots [ 5167 0 R 5168 0 R 5169 0 R 5173 0 R ]
+>> endobj
+5167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 264.338 175.937 275.242]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare_af6c069432956f215967c61be24a40939) >>
+>> endobj
+5168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.753 264.338 214.94 275.242]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.401 264.338 260.589 275.242]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5173 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5177 0 obj <<
+/D [5175 0 R /XYZ 89 770.89 null]
+>> endobj
+5178 0 obj <<
+/D [5175 0 R /XYZ 90 721.073 null]
+>> endobj
+5179 0 obj <<
+/D [5175 0 R /XYZ 90 677.939 null]
+>> endobj
+5180 0 obj <<
+/D [5175 0 R /XYZ 90 604.264 null]
+>> endobj
+4991 0 obj <<
+/D [5175 0 R /XYZ 90 581.888 null]
+>> endobj
+5181 0 obj <<
+/D [5175 0 R /XYZ 90 581.888 null]
+>> endobj
+1738 0 obj <<
+/D [5175 0 R /XYZ 90 388.537 null]
+>> endobj
+190 0 obj <<
+/D [5175 0 R /XYZ 90 381.543 null]
+>> endobj
+5182 0 obj <<
+/D [5175 0 R /XYZ 90 283.205 null]
+>> endobj
+5183 0 obj <<
+/D [5175 0 R /XYZ 90 283.205 null]
+>> endobj
+5184 0 obj <<
+/D [5175 0 R /XYZ 90 236.384 null]
+>> endobj
+1739 0 obj <<
+/D [5175 0 R /XYZ 90 143.913 null]
+>> endobj
+194 0 obj <<
+/D [5175 0 R /XYZ 90 136.92 null]
+>> endobj
+5174 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F60 540 0 R /F118 2438 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5197 0 obj <<
+/Length 1257      
+/Filter /FlateDecode
+>>
+stream
+x��X]o�6}��0`���&)��a��4�X�e����d���ɒ+�K��w)�����m݇�yD��G��^�{"�M=��=�"�$��rot�I�H"���Ļ�����/�1"�îf������G�z��b���#��=b ���{7�7��7
F�����h�E4�g�]���a�#��P?,3Iv��1
.W�@�y�}Jc����Ue��"���X6�Z|�
\p܁%
Ea��)C��`�Rʶ�z7}��?.����VS{�Ƃ2�
U%uY�b���h����q�篮����g���[�i���܏�~
+��)1�
�=�]O�ȋ��<Ҟ��z}�pQ�R��2�\�ݘ��������2Vۘ!�8���PJ���E�6#X:�H���I���
�:���������
+B᫃�E\�m��
AR�ud����;�ݧ8DT�rD��\�ā`ȾsU'Y�&&���2�������7n2�D�A�՜�.�$�.�&�ʊ�sh�I� �lY6�ѰD��Žf��[D�qV$�ڌ��dM�5?'J��Z&��T`�CE�*̳��m*f�~��33t$V��K�~?Sf	����
+��<�g!H2[���4���
����Q�
\��z�&U�C�1���j��:����2Q0^����}�}@��va�
+]P��������ʡ�yP�߷A���p�b�uN������b���졬m��h��5����M�r�����\��(�(�c�KpW�o����X�
õ��1�k�05
"!���Dj��1§�@a̡knQx����
����p-%�� B���tW$��ܛ��/�J�Br�r�W����T��ǪJ���U_T\�#
�, G�v�j��=�Y��I[�;�
:�lK���e�
6)��2�-�rD�E��������i��q�_�K�.�
+]B:�4����t< J$ވI�(	�ot	�tu	'�ᨀA���T��"�(�-N���#aE	��(��(цF�8ϵ�ĺ�I�|�ǫ�uӕ'Q#�~�9�E:����*�
�"^#N�@0$���[	�ϭ&����?;��x��_�
+�N��iˑ�O_RN�X��v�;r�
������c��`��&B�f�;n�
;1x=���6p}��o ��Wds
��$u/�nЗ�o��ϥ����֋�b劙N� >.�>Ni�lCA?��}�\Fn����5���	�
��6���^
��j�T�A0�k�f���6D�����=TG���?�s,
+endstream
+endobj
+5196 0 obj <<
+/Type /Page
+/Contents 5197 0 R
+/Resources 5195 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5116 0 R
+/Annots [ 5170 0 R 5171 0 R 5172 0 R 5185 0 R 5186 0 R 5187 0 R 5188 0 R 5189 0 R 5190 0 R 5191 0 R 5194 0 R ]
+>> endobj
+5170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 682.729 175.937 693.633]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare_a98c515b16e12424b273eaff073b31f3b) >>
+>> endobj
+5171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.274 682.729 288.285 693.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+5172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.018 682.729 415.028 693.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+5185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 387.804 175.937 398.708]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare_abf5e694ab674c48a452893f021986318) >>
+>> endobj
+5186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.274 387.804 268.908 398.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+5187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.641 387.804 376.274 398.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+5188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.588 171.902 187.842 182.806]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+5189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 92.878 175.937 103.782]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare_a92edb0b8b1e2097c5d20795e576517cf) >>
+>> endobj
+5190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.274 92.878 270.013 103.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+5191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.746 92.878 378.485 103.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+5194 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5198 0 obj <<
+/D [5196 0 R /XYZ 89 770.89 null]
+>> endobj
+5199 0 obj <<
+/D [5196 0 R /XYZ 90 703.491 null]
+>> endobj
+5200 0 obj <<
+/D [5196 0 R /XYZ 90 703.491 null]
+>> endobj
+5201 0 obj <<
+/D [5196 0 R /XYZ 90 648.79 null]
+>> endobj
+1740 0 obj <<
+/D [5196 0 R /XYZ 90 521.395 null]
+>> endobj
+198 0 obj <<
+/D [5196 0 R /XYZ 90 512.585 null]
+>> endobj
+5202 0 obj <<
+/D [5196 0 R /XYZ 90 408.565 null]
+>> endobj
+5203 0 obj <<
+/D [5196 0 R /XYZ 90 408.565 null]
+>> endobj
+5204 0 obj <<
+/D [5196 0 R /XYZ 90 353.865 null]
+>> endobj
+1741 0 obj <<
+/D [5196 0 R /XYZ 90 226.469 null]
+>> endobj
+202 0 obj <<
+/D [5196 0 R /XYZ 90 217.66 null]
+>> endobj
+5205 0 obj <<
+/D [5196 0 R /XYZ 90 113.64 null]
+>> endobj
+5206 0 obj <<
+/D [5196 0 R /XYZ 90 113.64 null]
+>> endobj
+5195 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F75 562 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5246 0 obj <<
+/Length 1869      
+/Filter /FlateDecode
+>>
+stream
+x���o�F����@���T_��-�*��Rm붬�>����%A��n���{
��U�j�s<����p
��:�y9yv=9�����;�7�Žb
���`D�7%c��#�
�e8��(v��ӝ^���U<�������,�r�HW�z�ݟ�z\q�zSʰ�<	��
��7���Fڛ*��K��]�0��z�~B at C�Z#��t����;�,��
�|%��դ�P>�ɯl�È234�TEvL%��T bm}��0N�����(�W�1�(�,q~�qK"v�4���ݷ��eV�I=������^5Œ������ˉ��2���������-�4
+K] 3�,
�s�K_�����w�q
+��ǫ\/b�P}��FH����
�oua�R�\��
���
�wխe}����z�F�uQy����zT��v�8�� �� T&���v8��e��B�6˲���t{�S���Ȣ�R�e�@��gCX�ӈ.�ud��XՃ�q�S���
�h�-�gu#-I2�2��&�W}���(�%��@���[Jٮkd�j�����N'۫T��è��i#�HB��mT�}� 	�HJ�0�#�D_��I�)Ħ�Zz�Q X%K��J�+ϧ@��&�}
(�?�
+�
��Q�F�7�n�1@�
5T�U�����';zhn�	�i�	C �'\�W�������h��󰰣h
�L�Ă*j\P]i�0w�Y]G�o�.��U�U�F�z�뙤�]f̕�@5�=��-���M�
9>C�h�=}�Z�Qć�'m	�։�Y���:�L�0�-f��qTy���o�
�v�f��R/�ڢ�Y�(r8	*�R��D����˕�����Z�@d�F�#���%}Z�4\ZC�=i�2����6=�vw&^^;OK�0�
�Y� �أaf+��x�f6�
�@X�zfa�
�z���
0��&3��b�ĩ��/}o��
+(dQ��yVm��_V��MtC�IT�L����nM*2���q��ԇ�	*�\�x6�V�������;!���a��^
M��c
|Rm˰3aĠ�:�zu��� �u
+A8�:%��W��XWL}�l񋋋e�ڳ��H�1t��z�]�p�0��֎V�O
����U���KJ8
�ƄR���
JG�\=�)G

��Ӻ��y��]��g��̜������B�1E2���c�V���}��:)��|J�o)�Z /X��!��A�s�X���.��t���lc88��XK�^��W�!;�x���-�Ktv"��!:=���D�@ty"� �9
":'�r� �=��;01��~���1l�5<�
6tX��E6��|�-y{�·���x�q��'�hW�6�Og���� �a�"6�|�9�K5���@�CZ�!�q��tE��<�胺��;���P��<���/0'���~����`�3#
+��a��#�n�=7�F�\*$1(,��x�C�% WK�Ye�.�q͔5��K� �%�\
k��~b�gazp,���!]
�
����ޏq��A���#Ns�ƉY������@��-&��<�gtC�睎��ݟY0sGX9�Dn��Kԑ�Y]vcj�Սo_�AKI�M	��A8
θ(�;�
�p�� ������[�
�[r��I�ܶݠC���n�+X��s {T�
�o�/s}��
+�֊�fUY�v���U.��nZ��
αM��*�Ӳig��*{_��T4�{�W���<T��=j��wim��m��	�m����@�m(@D �t w��zU~/t��ǘk��)L�M��N>mu��
��
t�&��o��@��N3�qR��m�!p�m����ruq~>_�:�EQ����-��9j��̚ƭV�)j�_2l�	i�
p�{H$LD��k���̓����"'o;���<8
+endstream
+endobj
+5245 0 obj <<
+/Type /Page
+/Contents 5246 0 R
+/Resources 5244 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5116 0 R
+/Annots [ 5192 0 R 5193 0 R 5207 0 R 5208 0 R 5209 0 R 5210 0 R 5211 0 R 5212 0 R 5213 0 R 5214 0 R 5215 0 R 5216 0 R 5217 0 R 5218 0 R 5219 0 R 5220 0 R 5221 0 R 5222 0 R 5223 0 R 5224 0 R 5225 0 R 5226 0 R 5227 0 R 5228 0 R 5229 0 R 5230 0 R 5231 0 R 5232 0 R 5233 0 R 5234 0 R 5235 0 R 5236 0 R 5237 0 R 5238 0 R 5239 0 R 5240 0 R 5241 0 R 5242 0 R 5243 0 R ]
+>> endobj
+5192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.588 682.881 187.842 693.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+5193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.305 665.257 305.559 676.161]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+5207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.059 427.872 213.719 438.776]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a51da7be45180533a6f05d193a193fde5) >>
+>> endobj
+5208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.48 427.872 310.978 438.776]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+5209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.426 427.872 476.029 438.776]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.454 415.917 373.097 426.821]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.088 415.917 431.504 426.821]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.557 403.962 231.972 414.866]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.166 377.44 213.278 388.344]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a34ee73e8a8cb7e13a65fc6ed7e0d3678) >>
+>> endobj
+5214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.145 377.44 310.644 388.344]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+5215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.373 377.44 475.975 388.344]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.454 365.485 373.097 376.389]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.088 365.485 431.504 376.389]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.557 353.529 231.972 364.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.841 327.007 214.617 337.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_ae9988816fab7d8ef0cae14eab37167fe) >>
+>> endobj
+5220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.16 327.007 311.659 337.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+5221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.535 327.007 476.138 337.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.454 315.052 373.097 325.956]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.088 315.052 431.504 325.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.557 303.097 231.972 314.001]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.43 276.575 212.188 287.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a307595e3959d8b493eef756efaf0631b) >>
+>> endobj
+5226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.319 276.575 309.818 287.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Binary__Operator) >>
+>> endobj
+5227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.241 276.575 475.843 287.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.454 264.619 373.097 275.523]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.088 264.619 431.504 275.523]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.557 252.664 231.972 263.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.571 226.142 216.337 237.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_a837cb016717cabc430d6309b2d5bd28f) >>
+>> endobj
+5232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.61 226.142 305.704 237.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Operator) >>
+>> endobj
+5233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.67 226.142 475.272 237.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.454 214.187 373.097 225.091]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.088 214.187 431.504 225.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.557 202.232 231.972 213.136]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.559 175.709 169.852 186.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression_aa13879760b95faeaebfcd40e1723005b) >>
+>> endobj
+5238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.078 175.709 283.29 186.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.036 175.709 424.638 186.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.301 163.754 325.944 174.658]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.85 163.754 384.265 174.658]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.259 151.799 192.674 162.703]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5243 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5247 0 obj <<
+/D [5245 0 R /XYZ 89 770.89 null]
+>> endobj
+5248 0 obj <<
+/D [5245 0 R /XYZ 90 721.073 null]
+>> endobj
+1742 0 obj <<
+/D [5245 0 R /XYZ 90 599.877 null]
+>> endobj
+206 0 obj <<
+/D [5245 0 R /XYZ 90 591.258 null]
+>> endobj
+5249 0 obj <<
+/D [5245 0 R /XYZ 90 487.716 null]
+>> endobj
+5250 0 obj <<
+/D [5245 0 R /XYZ 90 118.353 null]
+>> endobj
+5244 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F39 2335 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5263 0 obj <<
+/Length 3510      
+/Filter /FlateDecode
+>>
+stream
+x��\����~���Z�}?��@�ҤN�:ע�m
t�N�$*$e���;���R+Q���|��<r�;�����
���'�\|yu��R�� #�L�n��
��'�GD��۫�&5"F¯��~�����~��.������+�?�@J'����8��������{7h�p��L~����h��
+{k/e��(#R�ш�'c<���z^�'���빿y�.�eZ�q�]��E��=�f�U�.���"N<�P�7���T
��jc�S<�$]��B��Zb�#�R�P~ؤ��*��
]��M�1!���D���?���jt�rW�D�H����!ePd�iԱ+x��]��LJV��v]��%�ݘ ��]#H	zA����1H�<%
S�����)iF3/ߛ,[���|�F�]�8�A�s�S���	v�X��|�S���
x<�F�fٺ(=?��N�aH�db��f�r����ܤ����B9(�
B���P��(#җH5 �Τ��Н!1�8��l��2[�)�0�C��aP�h\y����|,1X�.�!)EM�>� X:n������t�������1ʰ����7�,����U(�aw��F���P 	xV
Rp�`d�
D�>��	���e��1�#�(�Q���8=ap;�g�V�M�b++�c�� W�b����e�d�e#��	�J5
>�L��j��pN��rL���Q��B�Z[
+c�d�Hc�qx`Z�+00EZ
�Aq�
+��x81�
TH�  �u5�tp��R-<%5
R��6��u��Z
Bkp��-��q�`90�3�
�C�{����(S"EH��6G�<�9��8
\�=
)8
1-��k�ZD6AR��e�(/��
+�` ��Di��׹�����K�����N;"��`���t��R��nۈ
��.҇��
+�F
���\���`r
;e�l����K�]����_�`�2&�w��M�X���'������jBwқ�4���ӟ�`Nia�j�"SJ�� J�T:�V��}�4mE���������h�`�"t�uCVy�("DR8n-�=���
8cJ�w@�&+e-����
���s<�@����
���P��
�I�K
_�)��
+�+k�^����/mW�g�BY�=���[G��vڏ='��&��s?8/��/�6�����g�?����(�v?G�&��I��
�#��B�k�jC_� �Rz
�� �6Pd�d
�0��y��*�H`?o�E`�(���Ŷr������{�ip�^�t���P�Uےイv].㖕q{
$�]�ǫo.���'_e�YS_�x� �n��
�z.
n�7i��aef����~��%$�g�����
�(��)�EA�����W�b6ٮ�M�6��eI�Mn��օD��뫱�udr�]~*a4V
J�D+�
+��1c�
3޵cx޵cxy�����j��I�n��e��U�{�����<[Mk4�@=����t3�\u3�j�*�ʶ�0����vYV�S�{�C�Ё��J�X�p:
�Y/���y
��S
yЭ
`�'��!�u�y���|
D���F
+ۈL��* ˷�p at v;
!��,M���I,ȧqѤ����ت
�2�D�,��_��D�S{(㎦�L�ۂ
�q&]~��!;
Tg���1
`����)��1�
@	��i֜�^��#�S҃N$����'��Z`
=��i1�q'�������۽�UA��d~����]��儏�-���+gw�1w]V?H#��s�_<
�H
+
k�iȋ���2ޏM�Q�����ѣ
c��@<Y�|�ࣔ�sr���z�9Ouz?�ǑG{�
��=�
a����:p�e�����c�d��Ccw�rF��{F2�5"��d�ۨ�������\æ�G��EatF�ɛ=�
8�9����ޫq[0���0t�=��P{���p-OA]Ŋ
<��� �
EM
?]j�����Z����t
lN�v��aF��̝>���)��u+*m�N�?���?�����M���&�ۃ�=)F�h[O��Dؠ�ڍ^D{�0M���tXt�MA���A�@b�W�����؂&�U!C��JuŻj
�㐤7% ���
|�j1]�����ֳ�5�����mwP H�
+TI��<F�D�-�."|yz��Z	�
+>�Pg�oY��0����Hi���Hm����Q�ޞ0g���gQ�|V�7���[q@u�nR�:��0�e�O�
8ho��-�9MEB�m���y�Х�VԻ��R�„���8`Z>�E�"H@�
�+ at W<r
k3B�E[��L�� -.�@
S�����@a�����z�}��	9�5`�	G9~~<�

+�'Z&]!�!*�U�I(�C��
@��,���T��*�XkgM
�3�
+�
ڧlzFe�ae󨲏ao�	��а댎B��$]�_g��QaB��
���Q�l��
����3}�	~ �v�ׅ��$�=�D
+�X����CWX�M��ܧA]t�������<Q�>��3�өp�hv=( �����$�4�ջ��ѳȾ�z����\"��M�^�����w^����M�K�+Wx�	�D�6f
U�El-ĎZ�F� �Դ�ڴ	*��ۅ�
5��c�7�ju֯H���Ǯ��H���7�5��`Fw��(H$Z�mU����g�	�jϜ`�-�����,�T�[Fx���p]��5�\������OkY�A�[/]Z�b�[�Gs�&Tq�Vd�A�V+���!��ĭ؏[�� �ك[�Z�
��p��M��j߻x�o�D��Ü
��G��q�Sr����质O]���B�}�,�
�f�WdkN�	�N�U�a�緦��
��=�9���F+�tF}R�v�Z��~
s�>�ć!"N��y�F>���GTZ�#F�/E�N#kv9=����
+~��ɱ
+6��5�8Ԡ���U�m,mU6�H�&L�8¨�t-��;KU**��w�T������Dq�W���=�x<�����6<�<1�,B���u$���$�S��������э�>��ۏ����q�q���$֪}�����;��Ǚ�8(�^N(��-c���H�WF�i��\@���&Y{�>:�
���i��:���E6[��1��2����+DŽ��T�
Rq�V����>�G���.����R�.���E�: 1nh��^;�l	
��	�C��H��]�3��+@�Q�u��	Ɂ�VM�졶�?�"�kL�"h3�m��i2�4W'�-;��߇EZU���|��~=�)����'x�#ڒuݳ�$�w�J�`	G���N&��q=��R�(�e0��ܻ��o�O�]��y���M`�I;a�á�A룭`lɞ֋�-
/_��7�.��/c!F�~����u��7��h��	"�<�_�/���Oiݗ�i��!�����C���fM~y_��gO��l�t}�@w���?6�U���1 [...]
+endstream
+endobj
+5262 0 obj <<
+/Type /Page
+/Contents 5263 0 R
+/Resources 5261 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5116 0 R
+/Annots [ 5257 0 R 5258 0 R 5259 0 R 5260 0 R ]
+>> endobj
+5257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.418 566.247 525.63 578.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 399.492 228.516 413.439]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.263 92.595 510.679 104.55]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5260 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5264 0 obj <<
+/D [5262 0 R /XYZ 89 770.89 null]
+>> endobj
+5265 0 obj <<
+/D [5262 0 R /XYZ 90 721.073 null]
+>> endobj
+5251 0 obj <<
+/D [5262 0 R /XYZ 90 704.201 null]
+>> endobj
+5266 0 obj <<
+/D [5262 0 R /XYZ 90 704.201 null]
+>> endobj
+5267 0 obj <<
+/D [5262 0 R /XYZ 90 590.122 null]
+>> endobj
+5268 0 obj <<
+/D [5262 0 R /XYZ 90 449.105 null]
+>> endobj
+5252 0 obj <<
+/D [5262 0 R /XYZ 430.496 84.126 null]
+>> endobj
+5269 0 obj <<
+/D [5262 0 R /XYZ 90 77.486 null]
+>> endobj
+5261 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5276 0 obj <<
+/Length 3853      
+/Filter /FlateDecode
+>>
+stream
+x��\���~����Z4ߏKS�I�4����%(`���	���d���;��W����81���<~3��%I	W��=��//(�������O��9�4׽�i�ў��(
�Mz/��fCF)�?0����gN����m2Y����nV�ջ�����x5`�����/�w��l�.C�h���(����d��ߗ�d0t��>3b����/�.~�`@!�1O�"��Ƌ��ho��N����y�EOr�yﻋ�\Ѐ՜E�Z,2FkpH8���dq7�����|��������[}bd�`��.Y��
��5�
+�7`��z0D��P
���ɳmAp�3<'^P�O
�8�*�l�@PN�f�
�Z�A!@؛B����Q��/$1��_
�oBD��\)ֿG�J�|�
�gc/ɛ4���ls�͓� �;�Ir@�tO��2�f?���T����ҩ�8]fk�K`�C��L��ГS�w��l	6v��]���U
�2��
t"ԕ)[D �&ڙ�ot���hbA��lq��E�m
�V�4`\(y�
�Ѹ儂�`_�_��F��)X�6
D�UI�.� X��8y�����h<�A<���>�@� U�H�
+U�Li�P
��&�aW �%Z�N(�
��
)��
(q�
D�݋ȡ �ԡ���M��@�0Dq.�:��D��L./���(+�c�� WH�e��l�,qҼ^W"�К8S1�(�!8��Os/t�d����Qh�B�!���@),GO[���or�.(����рd�@&
�/�_`���#8�
+�9b�����~��
+'�i�K��3�
��Xp�
63�X�󒐂 r`3
���}��s��QD�{����
+����R�ͩN(��EH�~�Y�8�Z~;��t@��l3_� �!̮�A��
+��`�p^��*�`y�*Y�W<~�i�����Z�꿒�
J
���f9^Wi�&K&���]�gI�2�*
�4X\��:�]�o����e2�"�!'��>K����R�BD�|���Kg˵�-�
+��d� �P2䐙|j���f�#�OI�[0(�O���@JՁT2N���$�nTK3������Q���5� �"k};�"Dh$�͖-�^�P��]%�o@�]��֥n�5L��DsD4�	]
�C�w�!�
s*9@���K� �BS�0+
��u%~h
���jȢx�}yi�K�:7�t��}B���	��B��K1ن�2��v��Z���9��*�X%�i�����c�PA�c k*��8��@����:ڥNa:��K�B����Ä�AL����&�#\����m�<�t]hȟ�U�����l���9��'��r=�
\��[�.8y��E�E�J^�)K2E9�����F�ދ���MR�d�_
J at 2��V�=Rj;����[����vq�
�����
?=��e=�9v	S��v�Tyn
 �ͯ�F�q����dQ�q(�3͸!
�b!J+�i��i���4]�o��\�8%�����v�[�S#<����lIC��W�Őy���c�[
UDS�f9)��m��Q����st�|P����Q��v�G������=��*ۑ�u J�S�`S؟'��jFڑ�%�bT	&*��m��$�����(1ی�I2I&�b1?gD�*��vc�
+�]Lp�0���,;)�c�;ɱ@�Zݩ�[�[�1
֢���
���1�q��"��#���)��)��٤�Ĕ��I��X-�k�Lsxx?z�0,lA���
�U��������e���q���œ̷ȓ?��J���J&�_��C��
��z]��D��|������@R�DeK�|(ӄ�/��� ��=����{�h�I��d!�p�d4�i�,�rP3�|�*�A�ߏ�8ڛ� ���4����q�A�O�d5;
�{����nH��5a�Y�=z�1N�݀��y;��!*J��X����8�ݏ�8��\�q at Q���큂��M�n}C���DP�=zQ�v �|p���VD�
;eY� ~�EM
>Mj*�,��
r^�k�x:6�R�S��]�qgwxZb ,H��懕:F����:�M��CY�涑�
�$������$#P8~]ս��@s���� �
�u��[4�9(H̫d�E�50�!��2���h?p���� &WQ�t���v��NB�^}�?� 3^|�i
�|
��E�S�h�7B�Oeo�Q JKX�`���h2Dp�b����/�ј���2Սv�[
%n��>���(�q���!`,�ő��C$��[�4�����=���H��kv#���/'�W��~
X��?E�q����*�� yI���N0�>��m� �_�a��tߗ�q�H˜"���r�"یo��h}��Nà���
[�)il����֨�{\��z��H]��
����!�7�MA�7A��'1���
�]�<�H��RʅT���`����9
g	��
�,���� ����Uh�{�
3��(*���P�:�lU����fo��
���
_
:�JI+��Ө0q:�U.��Q�p	�n7�|������"�ۆ^'I�Y7%�HQ���
���uM�v��?(�"�s�"�s�+
+�L�>h^��h�
+����lo�d!�Z���4e�f0���v�CnX�
+
��������� �)���S�COa��)L��)�}��>�)�����Hv���q`�ȗ��{�C�꯭mۃ[0jU-M���|[X�����j%��WC��xD
�h˛��������E|Z��\���a>��+�)��o��2���(�F�M��Z��K*�6[�!��N�[3m��>"��ѧ��2ք}�P
+��
+ �#��Q�$����sl�.p�BN���ۤ����B��:�i���O���O���Q��|Y..�p�(N=�Mk�_�8�._~|E�dWj�
훼X��S�_?��/�9ܒ&BNK���ͅ/?D�j�U^g�����<E\��.cd�	H��l
� 	s���������Ov
?�D�A�5Z�W�n���F?�M>R� ���3>0��f����f��֘2��>Ȝ�~�FyX����'q�ǒvj0߆Z+gK
��(U���FU���
�Bա@�
�5�GPE@��hU�,����v��}ఓT��=��/�;�~q��ƀ� 
�*��`s2a<H�_D�Z\�i��#�UO:
�X������I�Y���^��&RkH\^�/K�oo�Ut/�!�����2UP��!֭=dr��~Ds_p��7`�/=.��@�#�-*x���mԈ��d����x;ʲt<�=�śit��&�γ�Ѻ���A*͒b�E��M'���
+<�nl�EJ�$מ�HN�
��
+{�g�\��M�=���X�[�Ra��k
:�ca��U�UN5�vA���Yl�Y᲏j�O��r��f�؊
nՎlK�5F����ף�,���.�3�����$~�>���XkGyy����('w�QN�補l��S��r2yWR���rR�P��9A.Pp�4'}�0'��0�2���tR�u���X�מ�����ѿ��`�"��NNt¾T�*�7y��yҊ��������8�)���N�NxR�;:8�	�Rҝz�S�g:��Nu:����N���s� 
2Ntq��<�T��/uj���L��{���*�l�mlg
�T��u�'��cϤ-7VY`�6�)� �lkKճgO���Y���@�~��}3Znʃ
0�����>\��[T1���]R�����+������a�6�����������,Y�&��mc��
D
�V�i�?.r��w�%~��w2��
+�M`���B П ����,�5������Z��?Sr������,�
+endstream
+endobj
+5275 0 obj <<
+/Type /Page
+/Contents 5276 0 R
+/Resources 5274 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5281 0 R
+/Annots [ 5270 0 R 5271 0 R 5272 0 R 5273 0 R ]
+>> endobj
+5270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.418 590.596 525.63 603.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 423.841 228.516 437.788]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.263 166.035 510.679 177.99]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5273 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5277 0 obj <<
+/D [5275 0 R /XYZ 89 770.89 null]
+>> endobj
+5278 0 obj <<
+/D [5275 0 R /XYZ 90 614.471 null]
+>> endobj
+5279 0 obj <<
+/D [5275 0 R /XYZ 90 473.455 null]
+>> endobj
+5253 0 obj <<
+/D [5275 0 R /XYZ 430.496 157.567 null]
+>> endobj
+5280 0 obj <<
+/D [5275 0 R /XYZ 90 150.927 null]
+>> endobj
+5274 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5289 0 obj <<
+/Length 3089      
+/Filter /FlateDecode
+>>
+stream
+x��\[s۸~��`ۇR���%�>��l&�d7M���$��lӶfuqD9i���� )�EI��d�'R$tp.�9�H	'W	N��������%Ierz��(n����"y��GoOL�Ԉ	�*.��O��:}e�<>=yB�N� �������[�\�������b�<��q��:��	�u���
!�7��ɯ#��,�����J52�Tڭ��v�v��L#&j#β��<������<�M�d5�m��.���҉��E at 3Ji%�
�,�GF�j���yD)*���颡��tDE�aDD���@�e>]�#&g�z59_�O�z��P�ʵQaO��	x�o�1%��D C�S�t�u��of�b��#���j2���jDH��st
������T
+f�[�R�Q���=�L �I�`Hc�M.N(��R	
IS���'��N8����Xe�e39L�?%@/�Hi㪊���S�U�+k��P�A6�q`˜6�c�#"��œ�A����ŷJןn
+��t��'\���Y��o��������u9n��ד�zZ'�,�E!Y]���|r��.���rq���
��jKn��c��,�R��1�#dUe\^����
��\y�ugH�X�i��t�F
�F
b�QT��y���2�����KX�0�,aĬ��?�x�t��0��;
)�Z
��u
��80�}g�<f��c��<��~
����
]�����d��{6��������/���t�Fc�Ezz]NYH
Q���N�r*��g���E^�����م;����U�\����%�W�pz����%
<�kE8
]�
�Q�V�;ȌR�^>[�P�ab�� ��ַ�E��4��Ha�$e��e�۬��]������<�.���"L�P��`��K�nlVF�.S�Z�t���|/>G
�aN�1� K#�eo�
�p:�$Ҧ��K�vG���UF
+M��?�b%#��P�+P�-o�e�$ c؞�DR�x7u)��*PǕ:-ҳ�b��d�y���V�uQ_��yIrܽ�V�
�)F �)�U�T�9���u�'�,�p6(���
Y$S���/�"yB��:���(��
��nd�D�͐XZ��:ƈ3�����`�
+�����eka�L�g�NX��:q���X�o!���Wu}�
��R_V����j���
�6� �21$Ȇ�X��kXS5d��7IY���wvo�6�;��
+Ea(trw|u޷-�
C���q���E�%:
)�U*��5�
+MJ���S��"�n���S#h���B�@��8�v���v�D�8KܯC�""J??k�u��Oq�ە
�0��MϽ���m\�lp5�Թ�E]-Gx计qs�#�,+��		 �(��n��h����/�_ ��P�+Z�~7:3���Q��X�Pɪ�uØ7�+D9�wL_��
$����,�Њ@�cx8	��,��A�#5�e�Ri���������.�C���㘣g�>muy[��muTo�b]��k�0 at ik8�ū�7
W2��?�m��P18�E,/�bj|1
	�?F!eK�i��B����>p�y�#��!FlэOh��0�>�;E��c��l�dd���8O(6?�u �w������a����v���R�#��˸
�frK�\n�=L�
\����Ɛv���=��l�HB����^|�+>��A����;�1h��$t�6DsD
 F|Q�!�j(;0�����9��� y��#آ?�<�v�k�׮}Bɾ��]��h�14��K� [...]
+��ų�+��{
 ��6F�ҺФvD�j��t���_���ͩ�E���.�TqT�aQI� K=
,y
���(ׁ�$|	͕n:c�Vfw�
c�av{C
��ë�@ �i�X��2@�e,6J3�
	���
+"�v�Q�꞊��Vl���~Zu��m}��r��\�G�1�A>H*b��A�	e~�_GhF��l�v
j���#Ѷ�K�G1E8�Ӝ����"�
sj�tb�n�
���%o�u�!��-��I2
v��
�Cm���l��& ��M�?q�� ��4ȇ.#[.��g�X 
�}��)(����
)�vl�[=|�|N�����p�p���q�.��7ʽ�u������`��e�
��L��Q�H
�I-�U�D���-m����Ʀ�a�q�ZEґ:k�;���^ݐ:��M�]���
����%ufC�v��p���GG��A��J�
+ �w�1U�he�׵֊:�y��}{�q Q�;a�
��a�(+��ݰs�
��
�R�n
�;tz���Q��]<L��ú��LY�=�O��7����Ta�2�l�݌�/�1A�h��x�e��T�W��
]|[{{����Z��D��e�?
~(�������0Q�7���f���ƒ�s��c	�6�� o�X�:Ȓ���_	�<�&
����3w�K���<"-����m�� o����X��?B /�B�=b�s���UV�����k��?�Ux:)���
��z}�����۫<[\!`�����{^�'*��
W�QӅ%���P3����d
+endstream
+endobj
+5288 0 obj <<
+/Type /Page
+/Contents 5289 0 R
+/Resources 5287 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5281 0 R
+/Annots [ 5282 0 R 5283 0 R 5286 0 R ]
+>> endobj
+5282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.418 666.193 525.63 678.711]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 499.438 228.516 513.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5286 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5290 0 obj <<
+/D [5288 0 R /XYZ 89 770.89 null]
+>> endobj
+5291 0 obj <<
+/D [5288 0 R /XYZ 90 690.069 null]
+>> endobj
+5292 0 obj <<
+/D [5288 0 R /XYZ 90 549.052 null]
+>> endobj
+5287 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F91 766 0 R /F94 771 0 R /F11 621 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5298 0 obj <<
+/Length 4026      
+/Filter /FlateDecode
+>>
+stream
+x��\���~�� ��Z4���i�6�]��:נ�m
tҞO�����8}g�}q�zܝ�	P��i��y�f83䊎ޏ����?��
?3b��Ds=:�%tddB����7cF	��)���_M
�����Մ�q��t�.�����e>�?=y�U���f�i�^|�ˍ�.�e��L���V���ӫ������4�
3�&�ο=�����3
��
)b�h�>{����#JDbGݠ�Hr���g�>�]�4�	�a����:�S���3��
�
�� 
7��JG�$FX
"��z4eD&����l��$
��yK��'�5��n5�#�I}h0?$��D=f	:L����_��jV.'\�?L����4ϳ�_�Y��rV����,�'
+��z�lh"��J���l�����?bT��	�
Q����37��jby3<����X�
��}�����Foܐ��M:�/���|]
�P���("�T�f�r�jѸ�J�}c��
+^��P��b0P���/"�L����(DWw����L����j�+�ƹ2e��!c	'��} �� g�	G	k��3�̤1�᫋$} 
8�(tL9c��f�
j�Ь�y}�
4�4='b�v�Fm���ȳ�f�ܼ�G�zp�M��ʵ1�γ���96�w��^m7sg̡�2�W�_�.�l��
�	Fm�D<w\
+�-rg����7>
+����l�����c�
a�������(�#�M��M�炡��e�s5a�x��l}�Ja�-�ټ��V)
�N7ez��-��NQ�v���_��|Y��9M��3����u�h6�������_:��i����+mV���U��[�G_V�{�Z���QY�H�jM�շ�)י���7y:_iL�<-���x� `M��x
m��x�s� 
mA 6T�D��na����A�4��ҏh��7�O7�f�N=��'��
�
+6-c�G�U�7�٫a����p�G�
b�ٗqp�ؤ�9\��)(�k��Rֳ�m��9<�VCx��v
+�$O���D�1�!��0Bm��Q=ؑ�&���*�d��_-��RID����Jr�Ҫ@�����_��=n��*������\7՝�%N*�W	�?��e/�G�+�@B�6��SM$��2�|Mtb(�C�O5�n� Km���&pk�C��V��"��[N(:
��@�/<.�B���R�մV��7
'�$�^]|���h�2H���108H
�Bcw�V��xiBe
RY��:	f�2�`_8�$I�ADڽ��
+��R���d`M� ��� Dqa�&,�	؉B�Y<y���D8F]��B�+�X6!n���
�Ӌ�QA���ԭ�Q� ԁ-N�
�79d�C
����0Ja�9F
+V*+�>X�����

I�
+�r$��!u
88 I+[H:@Đ	��b%O�J�*"'�y��
�
'���X́�,/������� ��9��-�1�� 
���œ)"�HJ'G�=.%x�:	���9؏1������o�:5�O�c �PfEJ�^1F8o �ƵG�Ż�>�bS.ph�
����&�{ş�o[t��!�%m˧ʳb����s�8�� ����Y�$�^Բ�
�ȥmTd�W�2	��ɠ��uj��EU`2%����OXA�ED
n��X�:�8�)�&S)���
�f��6+�b8R`���朷��"��  7l���"�@FRֶBz
���6m�UgY���(a�4�"	�����r�~BY�v�nIQWt�9;~5�P
�Pj��C�U�s��$~j���V
̬��
��[�A�K��iBښ�$|j��{�RL�A�!U��O�Pt���3�4�tt�o{'�
�L0PQ
��2�pL���D}����
6��C*N)
�@(�ҞtX�2�
+vK���]���
�m\�_��->�����fq�ΗW���cj2�`P�n�e��r�
}Dx�m�����G�K��dAE�Q���d�9�H�����N�@�8:��= M�i��
��"}b8�����q�u�/���◰QYZ(�m��U���|bd��
ᙿ�2?�q7?��~,D��Bv����1��V
]
��F
��v���;�#|��ֳ�����u5�����4� ���{b[߶ŕ�:ۮ�,�z���
�NV�'�A

��]�
��
+���
4���0�	�R���.�vz���|OG���%�b^	N*D�����pZvu8O,��y�.�ţX��D˦	p؍�
+r	��u�t��eq�|�Ar�H�m�/�(�6{
f�MN'�p����� ��Qur�n� D-��=*�a��r$4n�7�ڋC�M��8�
��;�
v��R��C�U�K�	�k�7�J_�μJr���.�#\�����dr��,��=\�'l췻�4�)�����c��$B��{�(��tw�F&P�"9%�OM�c](��~�+�;D(��(��ս_����~?v�`ﲃhߓ��p�!L�i�����i�<��{��Y�ݐ��U�٩)z�q	.�N2�
u��dZ1S�s/�����q0�Cq�u:s��
�
�m��3߻-$�~���Щ)z
10�1'
+Tʥ
���Tѣ��
D��؉#��N��u�X���i�G�q��3��͌���ܝ)ޮB��B�Ļ;,m�έ�M��b�t�ῶZ�օ���0�M�
�F`n�gգ���u�D� XN���rxv,+���T
�����:ׯ��uO��)���h���֏�X.���c��(0ī-�.��|���P�
+g
�
+!���pPx8��TD;��dO��X��ΙH:T��v�M�ҵ8���a]����‰�pS�UkB��o
sɺf�a
���I;3.!�����u�P�WQ��<�RDJ��>a�����󮸹���րD�] y
���&,[������D���$�{���� FP=��_4
��1+�
j� ��JR;�l��NpR�w���
>���^����
�.
�2���pk����8*��H�a��f�RWI�`�,����!`" Xp�V6��&\�ф��Й3�(�3�s[
6��{ڇ�
��2��R4�~}4�l�%ܻ	��ר2q�������(_��δ
��lFn��2�+�E�7�^��x�{J
����f��&7�"u�ۅ:������1�N�9.
+���F��&�l��N3L� �B�
0�	ǣ+��>���O�$�\2b�
b�g[�<���
+k���Z��1k���fG�5lW��a(���<fi���r�J�;��}��$:�
ģ�>M�1�=(�w�Su�p*�	��$6�w��6
�J=��O"��03gx�^gt���Y�RSlWg8���o,�C�I�gX��- D��T���ݛ��Mbt����dʴ_F(�^�q(�Du�^/��{�Ίn�n����	
��
+9UI�^���%���ͰCow��x��,��=�Q�R�4X��>|�E|�_HD�g ���IB�
�ר�-c���
F���^�P�V��L��o�� �*dk�t��	�(_5'�N9f�����޳�µ=�;��@ ���)0C~����
��&�%�u�e���'�S<�@��$V�K�F�ژ^AA�%�}	�7D�ݏ�:&���:P�T��:2��AWh
�+tw����Ȥ
+���I�&�S�2@[k`y���oi`{ˡ����j �8��b����!�
�X�w	
���x��%�c�����C?Ȣ�_Vi\�9QJ��<J'q�R�7.��CAi�!�v�O��(�G�`�J�'��:�9�	��G/�Jy��K�?x��	K��
+��~�Q�v :�J=�1"��`�₷S<
����T5p
b
��S�q�?4����4PS��A�W�^���i��R�*��n��և��g
|}��/�1 0��� �Ogt�CZ�O��4�����5��0C�l��,o�<~|�}_�����ễ
YB�3�W�o̬ݛ�x��`��O������	eDk^k��%���6�u�������/�b�uJn�z���S
+endstream
+endobj
+5297 0 obj <<
+/Type /Page
+/Contents 5298 0 R
+/Resources 5296 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5281 0 R
+/Annots [ 5284 0 R 5285 0 R 5293 0 R 5294 0 R 5295 0 R ]
+>> endobj
+5284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.773 707.623 508.188 719.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.522 695.668 418.938 708.61]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.418 503.043 525.63 515.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 336.288 228.516 350.236]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5295 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5299 0 obj <<
+/D [5297 0 R /XYZ 89 770.89 null]
+>> endobj
+5254 0 obj <<
+/D [5297 0 R /XYZ 117.716 645.665 null]
+>> endobj
+5300 0 obj <<
+/D [5297 0 R /XYZ 90 641.082 null]
+>> endobj
+5301 0 obj <<
+/D [5297 0 R /XYZ 90 526.919 null]
+>> endobj
+5302 0 obj <<
+/D [5297 0 R /XYZ 90 385.902 null]
+>> endobj
+5296 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F100 4949 0 R /F8 802 0 R /F75 562 0 R /F7 803 0 R /F91 766 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F35 1248 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5311 0 obj <<
+/Length 3422      
+/Filter /FlateDecode
+>>
+stream
+x��\��
�~ŢZ	���~8m�6�󨓸���

d�ޝI{YIq����̾fo�8i'Hp�ڝ吜9$�:��f4���_�O_�9�4���M�hf�#J÷����=����LhK�����W_^>���|v�����
�h�E��fˋ����n�Q"����A�Lr��웋�^�./��x��hV�r;s5�a��(_�'\�Ѵ�����e�^ϋr��c
Z�%y�~
F�Lg���h��0"��D���ф��Π7���t�*���x)@�yw��꺒;|̊�}��o��������6��zS���Bu�2Έ6.c�Pe�2!�"�O���P�
+�S,�P�NP3�J�M:�>O�6;h�E	
+01M�D��!Ɖ0b��5��$�Z�Q?%��X�'�C=z�׊^�j��j7w���j��? ,��pg1_��2\��2�Ԅ`H���]��eBi�X�8�A��8
+�N�S@I'�Ԯ;�ށ(�`�1��s��œ!bI�k��� �Ţ@L�[?K���s�-�����E�Ç �IcG�
I���A�����sE��=��a�c͎�+s/o(��DKȬ���4!�"0Y��S-���I5�
����CA��eI��y�H��U�o�Y
�����ļIӓ��~4��=�8Z1��.�cȈ(G��^�?���ظ�
+�Uqw���x�
�^Ey��C:�0:�)�����3��V@��#9�(��t�I0�ݼ,�2\N��b6�n����"�'��Ŝ��z�mY�뼚l�o��
+.����ƑNȯs��B˛��M�>[�>_
�Zy[el_r���C^����*�
+]���듄� 
�gD�9��
>^(�uW�Cn{�bۇ�����B�8%���(D���࢛���)0)�
5��9�������L;�c
�C�L��xi��@�ЁC�BDŽ3��ԄmP�y�qy��
4�U�'�$���hS�We>�b����n��0p�M��ʴ1��4z�
��}_����l�T"}3 Ժ���+H��^�2L&Q��B��㓋�/\dZ\
+�a��pN@�UF��Nl2��/��'�
��M�7��-�p��`d�:7����t�x�zt9� �r
Kz;��Q�	�q��
~��a1�;\�L9�}�A�)	q�k�B��)('v	���T��gtd̻���!4���
��`'�2p9�vZH����^��P<�"��9�7�9fA�o�b�f���T��&��RI�T��1��/y��{�t"TB*�R�����F�1���}^N7E*
� X���%���"��ĘC�oi��&�X����"pC}yblpF��ƍ@�!*?^����9�t�$!�-�5�]��
7��/^]}UNg�`%�Tܜ��-Ȥ#�௘e'*��XFXOW�
�T�Z����Œ=x����D( �|d^,��,(�I�����0���p��=[N�Sɑ��.�B+܁Z�v=_�+,�_mDLh��{z� ��=]h"
�D}
�u �
S��O� 
b꼝�Bj#���F$Ӡe;�9�!��2�����
)\�@�&3;�$w
R7	1��Tۜ(f<��h�R
�N9:�w%!ѳ��l�W�y'c�A:\)����8���
+
��(=��q	�<ĭCp ���E
쇘Շ|^��
����e��.6)��!Y"���뾴Q
z�3����(���C8���"�O��}^���m���9p��)m_��3����p�$�7��i��L�/��7���GHx���r�p����1%��&
Ӄ�����1�Q�N��a�S,���&�8��9dF�![�2mUW��QU��5���R�J|�
[���:� ��q�W=����U>X����cUE��!t�p u,���/؎��i@̎^���x
+�)�k����
�>I�g��K
9ĕ�N��a�}p�%�s�$�9������Х�nc�
>Y�"�֡��3�h�F�g7����(�
�/9��W�q�y���meS��;� �.lXbH�@���/
f�
��.�	� 䌅�'����
�t[V���l����|6�y_�
Sۓ�Tv��7�+�QY�W>.V�H_=�Z8:ե����ba�����[L�/����3���*���vXK�f�4!�����j���x�u�.��O�K؊(����&���*y^]���c�#��C����X'Zq�
+�a!j�k�p�k����@q�]5�[�^�gU`��Fw����XN�aL r
]�USz���NR�۶�`�E۪b}WlU at u7���c�N �'�A

�
N�.��r?��{�3h&�A�u�I�	dD�^}�o��*
��lK
u����
+��r��nLj��l������Tx��I�o ��Y$d���
��|7_?*�c�;ɱ
�Oi<��Fn�
����z���JM�����_&
�����N �{{�X��v�nv¼�*G���ѽ6�4��gr��`��ˆ���mJV�E�*�N*'���O�y/�	;C�ݘ�hǃ�lh�f� ��00��4�
�������RU�b�<v�벃�EӸ���-��h��m^��d'��
O�Đ �b ��������R�뭪K�WXP���8���Pf]�.�M��H-��j!0t2߻W�BL�ܐ���w�X�rT�wo�a���oC��%�C:��$�"v-��9��.��upNgw�2#I���#�s��!9�V��
w~�:?l����t�U����h�J�Q�R��{e�y���cE
��!��$c�&��
�?�
?p�w��l3�j� ��;/@���Bi���BH�u�����
�.������G����NS۞���0ء6��]mm��
��c:"ڶ��
�
��� L�
XQ�4O�4?�!��'$9;�!B��� �YH1p���3�	��U�?�!���cO���HJ�G7D
�A�q�k�8M�tGD$课%�{O=DGRR�=�#b ������aC�˺\�>�2�jH���D�
�D����~'s9dN4��
+�-���M7�ެ(�|�Y����e��|	jZ��Z���3�mE��f����zu~kW.�eqEl�v��-�D�N��eݩ�!T��!F��l_ �;��M�/ػ�$%ڪA�P~�>�gX 3j�ޅ�3z�����8�wa@��SϞt��zF��~zN^��V��S�����izKs
2]��Z����\`c6{n�‡REmı.N��*��]x|��� �a�@��a;� Y}F�4������.��0���YʌO��s���T7�~�ٿ
 ֒� �IK���cW Vƕ?
��ą�W�^������c�Fr����5���pS��Č0�e,F�V�ƿ�����w
��	

�
%��^�6��gO���ޮ��-�P�a�߾�
�m��>�^�T��+
����� �����l
+endstream
+endobj
+5310 0 obj <<
+/Type /Page
+/Contents 5311 0 R
+/Resources 5309 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5281 0 R
+/Annots [ 5303 0 R 5304 0 R 5305 0 R 5306 0 R 5307 0 R 5308 0 R ]
+>> endobj
+5303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.773 633.401 508.188 645.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.522 621.446 418.938 634.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+5305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.418 470.356 525.63 482.874]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 315.556 228.516 329.503]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.418 128.964 525.63 141.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+5308 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5312 0 obj <<
+/D [5310 0 R /XYZ 89 770.89 null]
+>> endobj
+5255 0 obj <<
+/D [5310 0 R /XYZ 338.866 612.978 null]
+>> endobj
+5313 0 obj <<
+/D [5310 0 R /XYZ 90 606.338 null]
+>> endobj
+5314 0 obj <<
+/D [5310 0 R /XYZ 90 494.231 null]
+>> endobj
+5315 0 obj <<
+/D [5310 0 R /XYZ 90 353.215 null]
+>> endobj
+5256 0 obj <<
+/D [5310 0 R /XYZ 90 281.484 null]
+>> endobj
+5316 0 obj <<
+/D [5310 0 R /XYZ 90 277 null]
+>> endobj
+5317 0 obj <<
+/D [5310 0 R /XYZ 90 152.839 null]
+>> endobj
+5309 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F7 803 0 R /F24 537 0 R /F35 1248 0 R /F10 773 0 R /F8 802 0 R /F1 834 0 R /F100 4949 0 R /F75 562 0 R /F91 766 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5329 0 obj <<
+/Length 2446      
+/Filter /FlateDecode
+>>
+stream
+x��ZYoG~ׯ Kf��û؇�V���(��
+�ْ�
Iy�����[=�s�
-1HvGd���ꫯ�&N��|w�����B�� #�L淉���	J��2�0!3����rJ�$�������6�ro�yz�vu�����/_m7�|J�������<��Xm7ׯ���v3�e���!�
�6H
+����/��%(3Պ��PP�)sgw,�Z��G��Ң�Ψ�^�]?d�κ�%3�1bL%3B��㽽��p��_DZFX�J$Qʽ}�f~����8!�m�@J'��ه_p����O@����r�:��k��|��n�_�ѽ������D�
�4���MQ*�Fm�h�����I�_��{��'q�gqL�în��v��?d��M��o�<��*����K�|��L	�U�nӬڕQ�T�-l�^Ň�l�1Ќ
���V��
�4s T�؂W�d�\�;�?��ϺޗB .�a�K4 ����W"D�I$g�H��>
b�
���[�!�L����������c#�›�T&B��be�l�� �/;%����+ |����	��<��~��y'҉z
 œ��_9
1�D���9)]d�($=O�a$��qH���6�����;K>������1o�
�Ç�n ?�m���� �䣍#D��"�c���A�Jbz�Q���R��6ޫ��u��159f�Shfm��q��Ϸ�|�қb ۅ�
�ISO�{�� �cvJ
�Z���P2��x Kb�4
�GO��vG!�y�
#��ηv�]�b�l�ˡ
x
������A$��z�ľuA�P
+i
ڥ
g2��4˾L��� KR�*�~�ˡ�6u�`C9ԯ�	�բ�:o��ι���:x�+���`���K��J��O7ˡB]"a�
+<�,�����]<��M`�~k��DB��=�0�Ac8�QL�z "H¡��~�7An-��L�+B7�

G^X �
+��7���ʞ	�p�N��
��\6&�Ƞ��hĚ>��*˪�����k��;ɺ�};�#�x���d�
�+�&��%��:V> Y 
�����A�/c?���g�U�ΈT#2
�
>ŷ�����#,C��ۀ[�+���~E�[ �G�
@ }�@���.�k����!(�MV��ʹ�s9�	�ٍ��]E޷�v���v�e�)��͝�
+c�ٗq9
+Q��z� � E������C���Cj�uޞ�o��T(�5
.�M�:��M� j's
��6CB����IK
"1�p&'JR���N�����D��u㝓h@�#bk�'hә�TS4��O
-
�����a Ѥ�ƛ(��{3���)�fnh�h�w{>Hi{9��Zv�
�2��n��y�r�s�lZ
	c��9
�C���3%d��
��gaB��f.���-p�� ������B�W����-�����(/1�+������Y!��áх'�N6^$
+I��f�Yd��P�`���٘A��GC�,l"Ed�G�uF!Nܬ�
����
3[-�m��������~�p�96��Ł� �+6�q�}�c�*D�����O5�|y��K(I��2�����vk�94
���3�ₖu�"
��I�ܸ|چ�uEO�D*
+�XS^ab��/s�z���A��*T^�
+e�f�a�+��M�kw�	M.����H�+*Nmr�#��������	_�p��Ѻ��ɴ�Q�P��H�
����tY�U� śtm�[��@g
~�b��6_�*�cQ�
��
᛾��%A
�'�6��n���UqB�BMK�I�_p�p֪1�`��M6m`H�ϛU�4`��� V�]�����nd�
�I����u�9}�\�O��AR����(D�~i���%b,�Fu}

�ɩ�t8)tu���� ��pPr\�@�nH�
�����
���
+ҽ��|T`r<�L�B���
&�#c�hq��H���v��ټ��e|�|x.� �M9�|�y��V'UM��D2$���#�N�;F}d�G�E��/~�3�O�����Y�/=��_�4�1��/�|]�23 ���9'`Bb|�~$X��?5�
lי�U|���5�C$
�^�]��JB����|����M�?�q���D$�8q3$
�O�FF-~mƦF��bTj�P�v�?�lq`�I
@��+�^��mz�PR�R�$����qy�B���U8r��$��P�AH�r��R�А���I�S��	���ޣ?�d��Cȅ@��	g�
���3o�<�Q�L�x�X����}�<��#|������c�Y�)7�
" 3�莹./���6��T�I�Ļt�O�i��}��7?[#��K�K�h:c`ğm5}���TO?�����
+#����n�����fW��
Z��{�j�� ܤ�ڻkw��w�[" U�X�������5��!7`��J�����/�7���f��-����/F?g�
+endstream
+endobj
+5328 0 obj <<
+/Type /Page
+/Contents 5329 0 R
+/Resources 5327 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5281 0 R
+/Annots [ 5318 0 R 5319 0 R 5320 0 R 5321 0 R 5322 0 R 5323 0 R 5324 0 R 5325 0 R 5326 0 R ]
+>> endobj
+5318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 629.959 228.516 643.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+5319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.69 225.78 377.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
+>> endobj
+5320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.278 366.69 245.426 377.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_aa1ae2d642bd66d32f64b708c28fbf044) >>
+>> endobj
+5321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 338.232 226.029 349.136]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833) >>
+>> endobj
+5322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.527 338.232 246.233 349.136]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a603e2a97c5ea7e4e81bad4464a9aba2b) >>
+>> endobj
+5323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 298.193 142.752 308.723]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_ae7432f48686d9fa7923ed66d070988d6) >>
+>> endobj
+5324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.069 257.407 211.36 268.311]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a9eeea4961725654dcc5f4526fa729df1) >>
+>> endobj
+5325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.59 216.994 234.882 227.898]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a6ceeebd94402797c5ad4a69f8bb73bcf) >>
+>> endobj
+5326 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5330 0 obj <<
+/D [5328 0 R /XYZ 89 770.89 null]
+>> endobj
+5331 0 obj <<
+/D [5328 0 R /XYZ 90 667.618 null]
+>> endobj
+1743 0 obj <<
+/D [5328 0 R /XYZ 90 506.203 null]
+>> endobj
+210 0 obj <<
+/D [5328 0 R /XYZ 90 499.251 null]
+>> endobj
+5332 0 obj <<
+/D [5328 0 R /XYZ 90 385.965 null]
+>> endobj
+5333 0 obj <<
+/D [5328 0 R /XYZ 90 385.965 null]
+>> endobj
+5334 0 obj <<
+/D [5328 0 R /XYZ 90 355.773 null]
+>> endobj
+5335 0 obj <<
+/D [5328 0 R /XYZ 90 327.316 null]
+>> endobj
+5336 0 obj <<
+/D [5328 0 R /XYZ 90 286.903 null]
+>> endobj
+5337 0 obj <<
+/D [5328 0 R /XYZ 90 246.49 null]
+>> endobj
+5338 0 obj <<
+/D [5328 0 R /XYZ 90 187.885 null]
+>> endobj
+5339 0 obj <<
+/D [5328 0 R /XYZ 90 138.606 null]
+>> endobj
+1744 0 obj <<
+/D [5328 0 R /XYZ 90 69.235 null]
+>> endobj
+5327 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F7 803 0 R /F10 773 0 R /F35 1248 0 R /F22 2982 0 R /F68 3017 0 R /F39 2335 0 R /F111 1509 0 R /F67 3022 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5362 0 obj <<
+/Length 2055      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��Wp���3�'x:=4�;}�M��!�hd��4�I�����wA�!Qc��=hDR�b���~��pp����wW��
��tL���&�8�\#��<x���W?,V��ު
�|����_�ޙ�F��F���b$U0�����9<�1��i�W��N|��w��F����|9�4	AZZ���8�`$��c
^F����n��1RJU�2��iŐP�ѫCcĥ�Ը�
�UDH�y���(V���|�����u>ͣ�
+?�����Y��I��#I�0jh���x��:O�b���s3A�	� s3!�	ԛ�*��u�)U��մ(����&�a�'�̚�F��E�[���J
S��N��H8,�l��n���~�jsWwIDDؘ�	!�Dk

��D1�v����l��'v$�f;R0$�,.޾�%Dj=`�^�ŢCHŢ
��5�j��[��q�`��ҡ|s
v\-g֬�$w�In�/6鬄��}ؙĈ3V��c��
+����X at P_gV���P~���a�,&��&�'��2-+�߂Z;���X`���kEy@]��Ƽ�9E1S�be�}����.�X��F3�kL]��W_$�5&��e
�t��>�+��z&޾�%R���0f]�����N�X��(<X;�:E�i9o#�[�FG���$cp�Tr �%g�r��N�h�����I�냽�x�ӫ��߹�a“�Ha��'�-��⴬p��`b1�ߓ1
X���bMWs���E�
�eY�tҌ�y�n�Y֌��܁ �@M!�A�4ts
T���) �61���崬K���"?,��r���<bP����V��������
+I����a��'�(ɫ�Q�?��;.�p�/rZ�;�&��e�?Z� ���S	�P����b劅KCj�
��
�IJ0v������� 7s��OQx_c�h��cȌ 0�Z�`��E⛟���_.�YDq�g��n��Z�v�|!�i�/�i��S���M>+��4��
�$l.�1{g�ue�F�V��z�h
�{��A��Oǡ�У�3Ì���:�ɭJ�G`�i-}\�)�c
��v-����q��K�DZ�vt"�)�
+�
�qB$�ξ��fY��u�Λ$Wf]ɉ(�Ӥ����
�)�pЋ�4��G�W�;�DB4M�ץ�@�n�b|~���;�q�0S=)Rr
�>O�����µ�6%�ñڏ��(K�}!ڛq{��a<���m-��!4mT��GG��r �T
5T䈸-�WI9]���>x��|��K:;�ƒ�
_�Zu+��3��l���n	��v���#�vW�!�C��	��j���7�
+[9��� 0I�Gt䐂j�$
+	�Pzl�B9���Ƿ�R
�MRő���!c1|�)�_���
C{(�jp�_ɴ�ƱS
+.b��0s
���)l�0fT 0�_%���ĸ�e�|lN�"�|�v�"����u4
|k��J��,�bns��'/kj�g
)���*��Cڳ�;s�A*6kBC�$���I�=w�@
Mz~�LW�4�x���fC
ȇ`��ۅ�:���Q޶P�!Y����[;�Y����[-eHo!�v�44�?�j���d��j��Q�Q��)myӡ<1dNu��)���q��Y��H��m��%�N�����s�
+#>>��L�aHj�z�3ER�
TŠ:!P?N��q<yxˆ"T��*Ȅ
+�AT�L�����T.YS(ȥ����o�a#�#0P�`����
+PY�2��I�&��A榀�X(�ƎPT��&1�
+
+�	e���Q�b3f�f��a`�
�ws���t�Y�l�g��?�
SGZ�b�X�<<�Z�A�I"�z�{�D�%��;Z>9gI���8K���
g��&g9L���+������Z/r(=u���U�����}]�X��
��pǂWۊ���V`J`�V�m�գi=����˟���E�
	:��2M7�U�lS�ݰ��4��\��Cu��zk���g��O�ʣ�M ��j@�(���������Ͳ��Xܾ�5�R�v�BwY�l9�m�m��u�?�9��
+endstream
+endobj
+5361 0 obj <<
+/Type /Page
+/Contents 5362 0 R
+/Resources 5360 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5281 0 R
+/Annots [ 5340 0 R 5341 0 R 5342 0 R 5343 0 R 5344 0 R 5345 0 R 5346 0 R 5347 0 R 5348 0 R 5349 0 R 5350 0 R 5351 0 R 5352 0 R 5353 0 R 5354 0 R 5370 0 R 5355 0 R 5356 0 R 5357 0 R 5358 0 R 5359 0 R ]
+>> endobj
+5340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 611.626 214.542 622.53]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a722647b9832d183eedcc441913b25edb) >>
+>> endobj
+5341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 584.258 203.643 595.162]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1558ce3303b13a4d17df20c2f4d20ada) >>
+>> endobj
+5342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 556.891 239.07 567.795]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+5343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.569 556.891 358.183 567.795]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a5d1e8bb981043726cc2ffacfdd3c3013) >>
+>> endobj
+5344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 529.524 274.328 540.428]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+5345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.826 529.524 427.183 540.428]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_aef17a5e76a36d74b648706582fd2487d) >>
+>> endobj
+5346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 502.157 251.793 513.061]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+5347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.291 502.157 383.08 513.061]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a67bee18b81c21e09116b7423b3465a2a) >>
+>> endobj
+5348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 474.79 208.754 485.694]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
+>> endobj
+5349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.252 474.79 298.695 485.694]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a7d15247c02efb42a971a2cddbd7ff70e) >>
+>> endobj
+5350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 447.796 150.493 458.326]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_abf158dc171228668bd20a36339b60f10) >>
+>> endobj
+5351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.834 378.385 248.703 389.289]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
+>> endobj
+5352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.604 378.385 317.406 389.289]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a0c0e22bb6388967d928cb6cde46b9196) >>
+>> endobj
+5353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.623 378.385 445.784 389.289]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+5354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.882 378.385 513.996 389.289]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+5370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.429 238.353 377.333]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+5355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.27 366.429 438.152 377.333]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+5356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 339.062 249.301 349.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) >>
+>> endobj
+5357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.799 339.062 307.702 349.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1b95213b929e61be2683bf1d9c220d70) >>
+>> endobj
+5358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.517 339.062 406.361 349.966]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
+>> endobj
+5359 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5363 0 obj <<
+/D [5361 0 R /XYZ 89 770.89 null]
+>> endobj
+214 0 obj <<
+/D [5361 0 R /XYZ 90 721.073 null]
+>> endobj
+5364 0 obj <<
+/D [5361 0 R /XYZ 90 630.355 null]
+>> endobj
+5365 0 obj <<
+/D [5361 0 R /XYZ 90 630.355 null]
+>> endobj
+5366 0 obj <<
+/D [5361 0 R /XYZ 90 601.254 null]
+>> endobj
+5367 0 obj <<
+/D [5361 0 R /XYZ 90 464.418 null]
+>> endobj
+5368 0 obj <<
+/D [5361 0 R /XYZ 90 397.03 null]
+>> endobj
+5369 0 obj <<
+/D [5361 0 R /XYZ 90 397.03 null]
+>> endobj
+5371 0 obj <<
+/D [5361 0 R /XYZ 90 356.058 null]
+>> endobj
+5372 0 obj <<
+/D [5361 0 R /XYZ 90 311.369 null]
+>> endobj
+5373 0 obj <<
+/D [5361 0 R /XYZ 90 254.74 null]
+>> endobj
+5374 0 obj <<
+/D [5361 0 R /XYZ 90 232.363 null]
+>> endobj
+5375 0 obj <<
+/D [5361 0 R /XYZ 90 232.363 null]
+>> endobj
+5376 0 obj <<
+/D [5361 0 R /XYZ 399.149 163.236 null]
+>> endobj
+5377 0 obj <<
+/D [5361 0 R /XYZ 90 156.596 null]
+>> endobj
+5378 0 obj <<
+/D [5361 0 R /XYZ 399.149 77.486 null]
+>> endobj
+5360 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5411 0 obj <<
+/Length 2036      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo����_A�@*�z_��FR�r���Ľ��.��hY�D�(�W��ξ�Ԓ�,��4-p8�����3ϼ���e��&��L.�$�4�	M���H�Hr�D�ч)���xF0����iZm��uL�\?��*��[�Vi�xy��,��>/�<�Q��o��n��󻼊���O	�8���7?M���|��G�i �TQ��|�����S��*�l7m"N�]G�N�>���T����MӤg!���2���Q���3�ڝߖ�b�/�?u�̫�M,��q��y0���o��,?����'H��0��[��3,�&�jɰ>f?EZ����
+�1	
���ńL��F4�
+	IϢ� ��PG�x���,Y���P
~��A	�	�����_�*��Ve1"9Q���H�p�%��\�̌�hƘD,�
�h!ܞ��[Ƕ�rDr�h�5b��F;"%��$�H^v�@�dS�&O�9dS�&�#�5�2"�
+��:�T��b2�
+1+�m���l����g�P�",v�O��`EQ�����*֫"�hmi��U���� 41
D�rO���}U�lY��
�44�5ZRa���n�����UY��w��.����$Ha~�ݮ )���Gg&����t�v]F������W;�'0BR�f� !�@ H��T,�
3W
%c(B��»�	�p�>��	�U}Q�^���at��T Ǖ�x��;35�#�Ɵ-`W�2�W���mPc~e�TB��J��
+�\ɢ�Is4J �	"^�	GL{#��5
����C�%�<��Ě�d��g�BjDM�;T�hՂ�Rǵ�J�D7e���f ˤ%A؃�Z-��B-���C��/Dr��o�@lS�%��}��ݙPv!��!MN/��(� Â
0^5���j�k��
P��S�*9� �+���� ��j�3
��9�*.�l�ɋ����x�qu�F�
`����_,�"�Һ��*7
+�׮�h�4���ˀ���2�B	f
N���]f���v���*w�
����TơčN�OV$" �)Ѭ �����J
$��%�YD��K�iq�yT��3�a<P�_���RN3t���XB�h?<�[��2�P��w��v��RϬ���F�����U������$A���L����c	�.�t���`>H�4��:)-a���b��
���L�U�Pk��.��	�Z�� �q���^�6E0�\�~]���Y����401��b�M���8<�k/װ�Zz:�j
��w���^��
��3�����
��۩�r'�G�1	��S��c&7�ɬ���5R�N-�
_�}7^���iSO@��A�XNi̙6����G��s����>���Ef��˙%�`�yϵ���cb����M�!B[\F���y�i�pSj��z^
;ɵI�Hn7p�N
oMcU���`���Uֻ������
+"�ys�����߰�
�@��mG"짦C5M�
ۘ#7 )j&^hJ����m;��w�G�*[~�w|L�b�h�*�����]y�A�?��?��
�_�?B4�.ƀ
�<�V�k:>��l�(�?�
+�0m��+^��^^c�;gY/�x6�b
��j]��bS�o��O�t��B�b�@6�j
+s�ղ��&S'&5��H���7��ƨ
�
���yf��(�T���]���U_
gv�5�\���?��
_��7�P-
3�ƭ�����G��I,�g3E˫.Ҿ4����d��e����6�.J�ap��,Y2��4�0���K�� 	L� ��?����q���g��y:��%�"��|ST�F�6������$�����Tj𑽬��pi����)�&z
�Ͽ{�t��G���k��~�w�r�o�����
z6,�C��o��#z�����P$);������ɂ#�DB��||}��-��˫?�BL=�?�ž������
��/e����.�׼��S��Q������
�(1⪽���������~	d^�
Z��l��Z���7���ʛ!�]v�1hv�
�[-ڠ�~�q
)��q��6�7.~ܰ�@�~d�o�ajU
+endstream
+endobj
+5410 0 obj <<
+/Type /Page
+/Contents 5411 0 R
+/Resources 5409 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5425 0 R
+/Annots [ 5380 0 R 5381 0 R 5382 0 R 5383 0 R 5384 0 R 5385 0 R 5386 0 R 5387 0 R 5388 0 R 5389 0 R 5390 0 R 5391 0 R 5392 0 R 5393 0 R 5394 0 R 5395 0 R 5396 0 R 5397 0 R 5398 0 R 5399 0 R 5400 0 R 5401 0 R 5402 0 R 5403 0 R 5408 0 R ]
+>> endobj
+5380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 384.263 201.399 395.167]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.137 384.263 253.82 395.167]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae405ccb73f65071d6702baf98ae5e699) >>
+>> endobj
+5382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 314.419 164.042 325.323]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.858 314.419 229.615 325.323]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.05 314.419 330.028 325.323]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 286.507 164.042 297.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aba7dbedd485eab91821f129132a04723) >>
+>> endobj
+5386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.379 286.507 241.511 297.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 258.594 164.042 269.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aeb05cfafe5dbcb57a7f831180204ef7f) >>
+>> endobj
+5388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.379 258.594 241.511 269.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.146 258.594 325.904 269.498]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 230.682 164.042 241.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aef9838273809d695f9c52a96b37123b6) >>
+>> endobj
+5391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.379 230.682 234.885 241.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.539 230.682 314.297 241.586]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.731 230.682 414.709 241.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 202.769 171.791 213.673]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ab45e800217e1c61d8595e2ffc51a83ad) >>
+>> endobj
+5395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 174.857 164.042 185.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.782 174.857 215.588 185.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a95560c356a7aa70cccb41b866a8455c0) >>
+>> endobj
+5397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.925 174.857 293.057 185.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 146.944 175.668 157.848]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 146.944 234.596 157.848]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ad76648f21279e7e7c852cfc1daa1887f) >>
+>> endobj
+5400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 119.032 208.395 129.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a42e13324ee4f4b86975c282078a646fb) >>
+>> endobj
+5401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 119.032 273.968 129.936]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.119 179.554 102.023]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 91.119 250.666 102.023]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a584cb5084fe5479b0c373e3d17fe5ffd) >>
+>> endobj
+5408 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5412 0 obj <<
+/D [5410 0 R /XYZ 89 770.89 null]
+>> endobj
+5413 0 obj <<
+/D [5410 0 R /XYZ 90 721.073 null]
+>> endobj
+5379 0 obj <<
+/D [5410 0 R /XYZ 399.149 659.423 null]
+>> endobj
+5414 0 obj <<
+/D [5410 0 R /XYZ 90 652.783 null]
+>> endobj
+1745 0 obj <<
+/D [5410 0 R /XYZ 90 532.266 null]
+>> endobj
+218 0 obj <<
+/D [5410 0 R /XYZ 90 525.655 null]
+>> endobj
+5415 0 obj <<
+/D [5410 0 R /XYZ 90 425.178 null]
+>> endobj
+5416 0 obj <<
+/D [5410 0 R /XYZ 90 425.178 null]
+>> endobj
+5417 0 obj <<
+/D [5410 0 R /XYZ 90 333.421 null]
+>> endobj
+5418 0 obj <<
+/D [5410 0 R /XYZ 90 333.421 null]
+>> endobj
+5419 0 obj <<
+/D [5410 0 R /XYZ 90 275.862 null]
+>> endobj
+5420 0 obj <<
+/D [5410 0 R /XYZ 90 220.037 null]
+>> endobj
+5421 0 obj <<
+/D [5410 0 R /XYZ 90 193.851 null]
+>> endobj
+5422 0 obj <<
+/D [5410 0 R /XYZ 90 164.212 null]
+>> endobj
+5423 0 obj <<
+/D [5410 0 R /XYZ 90 136.3 null]
+>> endobj
+5424 0 obj <<
+/D [5410 0 R /XYZ 90 108.388 null]
+>> endobj
+5409 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5478 0 obj <<
+/Length 1910      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�6��W�J3��k&9�n�qV7v�C���$$sL�
�ʯ/@\d��lJM3G	<<��� T�
+T^O~����2�bKǺr�P,��4����Sd����7
+�M�,��*
�~�p����7yy9�6A�TPI@������P���7
+�2��b�JQ1a��r1�c+^`�'
�xBP*1!�P����b�f:_=YVl|z=Q>�5�t���?qbg�O�Z3�����9Ո/P��͊_n�����䕥*&ۉ��`
t+s����N�g&�:I�;AI-�cJ
���.c���E��5��l8�g�k��Ì&��Fg�D�������,b`nu%�ӈ.fXcL@��4��,q�,}������Mh�
+�o��If������5C1��U at e�o�)E�fy�(;@fk��h��9y�xk��PM"��
�Y� :Fb��#t�M`d�lU"[H:4Š��O%Ka4d�A���4@눊���*ZҐFyj3�^
���l��.�%;��S�L3Gj�]�2v 
+a��#���<��C�#�=�M��5��'�Y�2�=�1E7�~d�0r��
l�ܥG�׏JJ3{ ���/EW ١G��u����.��:n%�X���σ̏�
+�
�!ϟ>N�
r��r�F]�e��!P�]��؇D��ʔ
�]:��;���i.���:�<�5�i�
��	ۛAJ�A*�<1�1�fKl�Ml~�w1���[�ٲ�.�zE�@`f��ɳ(��>3�#Ee^ ��bb:*���S�ʖ�*���`]٬
.� �n�`�.�@Vɳ�2�MnO���9k���]
)Wf�%?��a`2�>0�0�Ӭ'9�9��#�}�`���q�
������;����hYU�,��"��#U�F�B7t�s4��o�����fx��06�l+�j�i�P�d!�>,oZ�U�����N�h>eQ�v5��uF�cV�UH
+�;��WQ.�㽌�`���7*��Hp3�$C�U�z�y�S��wT�0�6VU�k�D�Y�k�� e����
Kz�[�u�N�9��&��v켘�����q\�Ƿ6��k��Z�&�3�-�)Je�7o����U��
+S'�S^qQo�~�ne����o{�*>�.�����2�%�Z*0�ZQ��c'Md���^'}"��zqzv�n>�&;Kݘt���
+��WѬ�k;K�4�`R��,�N�*}��d
{<T��1[�&���x�Ɖ�:��"�
+�6�;Y�\G�Y����S�ۓ5�ЍzI���vi��' �ZQ�?��ȤE��z���`h��Ҭ���z�ڗ��m�
[K�e�����EiЛQ�}���/�P��N�@&���N�vz����@�x��V�ŝK݇�H���>���ZF	1���[�
 �n�Y�����s���z
�p�˧��=EC~��~�S�)����i�Ԯ�?FN�x=/6���u
�6����~���8S�yt.��4@��ej�(�����Q!���ʽ����I���B�$I�o� �=�4
��n�
p�ɋ��£�m
d���˥u��"`iZ)h;�[bz��z.�
�f�o�R'�_�^#{���Q��A����vj��q�
+j/�۵�vƶ���@��hf�Y	ױ3�5�d1Z��dY&�WS6�k&0��X�Gn�
�Yd��Uʵi�!.ǡe�����Dn�bŖ��bK
+1"&0�*����a5�'%��
�
t��t�e󂬎Y�Nv� ۚ�r5+n�~�0�@Fq���k}/^�9Ճ��Q~���ܜћ7ŵ�֎t
�
�jL��K!���w�?S���R*��;a.*&����Ѥ�� ���hrN��_P�U%o75�o��d��lC����_gY����*_���n��o��R��h��D��I]ﱇ+I� ��A
+endstream
+endobj
+5477 0 obj <<
+/Type /Page
+/Contents 5478 0 R
+/Resources 5476 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5425 0 R
+/Annots [ 5404 0 R 5405 0 R 5406 0 R 5407 0 R 5429 0 R 5430 0 R 5431 0 R 5432 0 R 5433 0 R 5434 0 R 5435 0 R 5436 0 R 5437 0 R 5438 0 R 5439 0 R 5440 0 R 5441 0 R 5442 0 R 5443 0 R 5444 0 R 5445 0 R 5446 0 R 5447 0 R 5448 0 R 5449 0 R 5450 0 R 5451 0 R 5452 0 R 5453 0 R 5454 0 R 5455 0 R 5456 0 R 5457 0 R 5458 0 R 5459 0 R 5460 0 R 5461 0 R 5493 0 R 5462 0 R 5463 0 R 5464 0 R 5465 0 R 5466 0 R 5467 0 R 5468 0 R 5475 0 R ]
+>> endobj
+5404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 155.594 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae405ccb73f65071d6702baf98ae5e699) >>
+>> endobj
+5405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.092 707.957 200.545 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a6e42477ffa8462fd1fadde0362e7bc3a) >>
+>> endobj
+5406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 680.738 297.728 691.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a79c648d88214174287e3763b804f4aaf) >>
+>> endobj
+5407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.544 680.738 336.732 691.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 652.772 342.261 663.676]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a3c9879f0c9dcb81fe1bbf78828509ef6) >>
+>> endobj
+5430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 625.553 290.247 636.084]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a39b6f38fff55dd953ec509b3739dd17d) >>
+>> endobj
+5431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 597.961 186.278 608.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a11d3ecf7df43ab6f40620de32004f339) >>
+>> endobj
+5432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 585.161 155.823 595.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a844aeb45177c00f4d4ad0755509d9e69) >>
+>> endobj
+5433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 557.195 164.042 568.099]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.782 557.195 218.358 568.099]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aa03b119140132112557907b772102b33) >>
+>> endobj
+5435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 529.602 194.776 540.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae96eebded76c559c95910dc233c68f06) >>
+>> endobj
+5436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 502.383 195.334 512.914]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ac26379e5f82fd0223682b11b9e052ea5) >>
+>> endobj
+5437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 474.417 224.634 485.321]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a29c6deef0eb3911adbb08d36a8f0b3f2) >>
+>> endobj
+5438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 446.825 179.832 457.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a6609e54e84d50cd074c2dd65f38b47da) >>
+>> endobj
+5439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 419.232 191.718 430.136]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+5440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 419.232 288.852 430.136]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a484373d269a31c21efae44a83f8be6f0) >>
+>> endobj
+5441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 391.64 191.718 402.543]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+5442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 391.64 303.079 402.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a0ff04e47054c14b2edf29096ecc95ab7) >>
+>> endobj
+5443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 364.421 150.493 374.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a33e6005a1fe40cb202eb619912c25c3c) >>
+>> endobj
+5444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 336.455 181.845 347.358]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a43983a6ee447e480f8700915bccb4811) >>
+>> endobj
+5445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 308.862 181.845 319.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ac53e4323b140cdd4ba1ac96e7204d93a) >>
+>> endobj
+5446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 281.27 154.727 292.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a146b211f83e22bd011d3de2e5975073b) >>
+>> endobj
+5447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 254.051 176.505 264.581]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a94b3624c208219e401569cd289049b38) >>
+>> endobj
+5448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 226.084 169.013 236.988]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ad8229aed551687502c5af78a4143254f) >>
+>> endobj
+5449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 226.084 222.961 236.988]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 198.492 164.042 209.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a77a4ec4e4b5b11f3ce61f6c6701d8a7d) >>
+>> endobj
+5451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.379 198.492 241.511 209.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.146 198.492 329.789 209.396]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 170.899 164.042 181.803]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_afd55d0cb3ab31c5e800c18eb849aa295) >>
+>> endobj
+5454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.379 170.899 241.511 181.803]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.146 170.899 329.789 181.803]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.22 170.899 486.978 181.803]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 143.307 164.042 154.211]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aed38df906a6f7c01305168df91d7d095) >>
+>> endobj
+5458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.184 143.307 233.69 154.211]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.249 143.307 320.892 154.211]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.248 143.307 477.005 154.211]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [485.842 143.307 513.996 154.211]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 131.352 177.322 142.256]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 118.552 164.042 129.456]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aba9d8397055aa341d1ffc6702f67e60f) >>
+>> endobj
+5463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.858 118.552 245.107 129.456]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.285 118.552 478.23 129.456]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+5465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.96 104.083 257.863 113.988]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 90.959 233.76 101.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a9aa9789183ac22bcb28a092c3e1f804f) >>
+>> endobj
+5467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.575 90.959 272.763 101.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.205 90.959 323.393 101.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5475 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5479 0 obj <<
+/D [5477 0 R /XYZ 89 770.89 null]
+>> endobj
+5480 0 obj <<
+/D [5477 0 R /XYZ 90 721.073 null]
+>> endobj
+5481 0 obj <<
+/D [5477 0 R /XYZ 90 669.88 null]
+>> endobj
+5482 0 obj <<
+/D [5477 0 R /XYZ 90 642.288 null]
+>> endobj
+5483 0 obj <<
+/D [5477 0 R /XYZ 90 601.946 null]
+>> endobj
+5484 0 obj <<
+/D [5477 0 R /XYZ 90 436.34 null]
+>> endobj
+5485 0 obj <<
+/D [5477 0 R /XYZ 90 408.748 null]
+>> endobj
+5486 0 obj <<
+/D [5477 0 R /XYZ 90 381.155 null]
+>> endobj
+5487 0 obj <<
+/D [5477 0 R /XYZ 90 353.563 null]
+>> endobj
+5488 0 obj <<
+/D [5477 0 R /XYZ 90 325.97 null]
+>> endobj
+5489 0 obj <<
+/D [5477 0 R /XYZ 90 298.378 null]
+>> endobj
+5490 0 obj <<
+/D [5477 0 R /XYZ 90 270.785 null]
+>> endobj
+5491 0 obj <<
+/D [5477 0 R /XYZ 90 243.193 null]
+>> endobj
+5492 0 obj <<
+/D [5477 0 R /XYZ 90 188.008 null]
+>> endobj
+5494 0 obj <<
+/D [5477 0 R /XYZ 90 108.068 null]
+>> endobj
+5476 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5553 0 obj <<
+/Length 1698      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W����` $H��4�$MR�v{I2��dN�PHȱ�� �hR�
9M�\
� ���[,������/��.F�'�m��w�k\�
��#��oS�I0����yjlyLN-��,���<���.� �=:z���|)�PXcʰ�<��잉��-��r���&���p�j��b�qD@#l�R�<n����lL�ϯ
�l����p�
ml��~���n��׌"�E��
�DHi�{J�޼^f�30�Z�M�1�Q>�T;ӳ�9���b�b2��Q����i�1ý��f�D�.D����l�	�ܽ�q��R�ߒ?-B@#
+.�NC�-��O�+�
�#���4���g��;J����\)�(�Q�\��~�_���^�B^UTQ[hCl
��F������j
�n�N[�G�U�d*�����lY�H���vL!se�
��A
W&��۟4�I���Ѵ�b��e'̒$�f̂Pf�Z\CQ�4Q�V�������PD)/�9���B�F�y���<3�}#�Kݺ�LCy'D�
)��>
�m?������wM�
��_r�gB.��i�<J�I���iHņ�f�]�
��A%�
+H��0sd)jT��ĉ�HF�F����C�i����ǘ��f���0���6=��/A���şE�)bN�Tj��s0Q�>*Emƀr��-�3ub�Z����5eVk�XX����:�l��c�L3\������#q�5�
�#(������y\6 �yj/���7Ẵ
�Y��e�K��I-��S3��ʔ���SZ�^��9p@V���+w�q�:�չ��Rc�2�_���~�ąx�
!(��i"g-BϴR�]pk.�n���	7�F��F9Sp�5ܼ�x
7܃5����
6u���9����o��d��Bx
�"�'/n�(��ATަ�ۍ��A΁�;�KgB��
ƚ�

탣	�����=���[^��d�2���٢C�9� @
��C2�; ���p9خa�sQ��TR���Cd��g�$5hAHA
�(���x.��b���v�b�A��
����A=�e:a
+#��D�A$��#�@"d
Ax�� N���}��/� ��4$�B?d
���i������Bh/��=��@л
y�T���5����;�†p��\��^�wA2�����6
�|?��Z{!������<�2�.U����e��&�g����
��}�]���gg�/:�p����]��/�f��
[�*Rβ�*��7�'���>��v&b�A�m����b8U�[sӷ���W�lHU? �\�%�j0��yʲzSt�����!��at�e����"d�?4���y����>�~:XB֣F�n�J]U�R(<��&�D�V�<K��%C
{8
‖j�M�
ri�Tr;�8u�Q�GJ3!()T�%>.�� :�H�B��|�C��k 6��m�>"��c.F�LJ���GGY!!7���� W[����F7.x�t���C>��>:T)���p(��>����oK��?B)��`��S%��]ߥ���C�����ג8���|޺�OO_��?
+��h1fV�� ]�v�����F���+� ����sQ;�T�/�����W�����Y�	��\


^.�J�Q�%w�|�H�&emr�$˛O�3�YP�Ϩ�/�ڗ
亴�8�#��x
�3��z�^X���eb?g��տO�
��F�
+endstream
+endobj
+5552 0 obj <<
+/Type /Page
+/Contents 5553 0 R
+/Resources 5551 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5425 0 R
+/Annots [ 5469 0 R 5470 0 R 5471 0 R 5472 0 R 5473 0 R 5474 0 R 5505 0 R 5506 0 R 5507 0 R 5508 0 R 5509 0 R 5510 0 R 5511 0 R 5512 0 R 5513 0 R 5514 0 R 5515 0 R 5516 0 R 5517 0 R 5518 0 R 5519 0 R 5520 0 R 5562 0 R 5521 0 R 5522 0 R 5523 0 R 5524 0 R 5525 0 R 5564 0 R 5526 0 R 5527 0 R 5528 0 R 5529 0 R 5530 0 R 5566 0 R 5531 0 R 5532 0 R 5533 0 R 5534 0 R 5535 0 R 5536 0 R 5537 0 R 5538 0 R 5539 0 R 5540 0 R 5541 0 R 5542 0 R 5550 0 R ]
+>> endobj
+5469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 707.957 220.579 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a07bb90eb18242945afb161e4deadb09e) >>
+>> endobj
+5470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 707.957 290.038 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 694.991 231.1 705.895]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_af66a2692f29cc03aa773c48a2cc644ab) >>
+>> endobj
+5472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.915 694.991 270.103 705.895]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.916 694.991 345.559 705.895]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 682.025 197.337 692.928]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a6a24743a95176da13995bb6c17151c9b) >>
+>> endobj
+5505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 654.473 175.748 665.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a29c63b939ed830a0395170835e60beaf) >>
+>> endobj
+5506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 626.174 205.636 637.078]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_afcf86304f17dc474e1e5bbe0486c1b59) >>
+>> endobj
+5507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 556.301 203.075 567.205]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 556.301 296.324 567.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a5a207ecd92e9fd8f3b1937a5064746a9) >>
+>> endobj
+5509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 541.665 322.825 551.571]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 528.75 194.297 539.28]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ab917a480b6afe7e2750aa2862c6783cf) >>
+>> endobj
+5511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 500.824 188.759 511.355]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a2ca2446f563956eb2b92ddd17e5c0b2c) >>
+>> endobj
+5512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 472.526 211.085 483.43]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.824 472.526 307.233 483.43]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ad07dc0dabac5685f9db8d9dc11e513f1) >>
+>> endobj
+5514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 433.642 211.085 444.546]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.824 433.642 285.136 444.546]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) >>
+>> endobj
+5516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.427 405.717 187.559 416.621]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.052 405.717 213.825 416.621]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a016c2304fe3a1a73988eb83b2ccf1fe9) >>
+>> endobj
+5518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.153 405.717 318.403 416.621]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.546 405.717 441.796 416.621]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.423 405.717 513.996 416.621]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 393.762 131.405 404.666]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.839 393.762 231.817 404.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.278 365.837 187.41 376.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.755 365.837 213.528 376.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a5f3003416d324720351da9235a0a3802) >>
+>> endobj
+5524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.559 365.837 317.808 376.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.896 365.837 513.996 376.74]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 353.881 151.877 364.785]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.312 353.881 252.29 364.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.278 325.956 187.41 336.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.755 325.956 213.528 336.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ab6054ead00332969adad17cdf785088b) >>
+>> endobj
+5529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.268 325.956 467.518 336.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.896 325.956 513.996 336.86]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 314.001 151.877 324.905]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.312 314.001 252.29 324.905]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 244.128 222.711 255.032]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.209 244.128 314.187 255.032]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) >>
+>> endobj
+5534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.794 244.128 361.329 255.032]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+5535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 146.976 180.54 157.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_adeee840f3313b6050d439dbe5fe2fdd7) >>
+>> endobj
+5536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 146.976 258.009 157.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.742 146.976 349.874 157.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 119.051 178.239 129.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aaf7dc46b2cfbd6650ac1d2035d331f15) >>
+>> endobj
+5539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 119.051 255.707 129.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.441 119.051 347.572 129.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 91.126 226.034 102.03]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_ae0c9395c1ac4d96e245be43fcd76424c) >>
+>> endobj
+5542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 91.126 371.308 102.03]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5550 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5554 0 obj <<
+/D [5552 0 R /XYZ 89 770.89 null]
+>> endobj
+5555 0 obj <<
+/D [5552 0 R /XYZ 90 575.225 null]
+>> endobj
+5556 0 obj <<
+/D [5552 0 R /XYZ 90 575.225 null]
+>> endobj
+5557 0 obj <<
+/D [5552 0 R /XYZ 90 545.651 null]
+>> endobj
+5558 0 obj <<
+/D [5552 0 R /XYZ 90 518.797 null]
+>> endobj
+5559 0 obj <<
+/D [5552 0 R /XYZ 90 490.872 null]
+>> endobj
+5560 0 obj <<
+/D [5552 0 R /XYZ 90 450.916 null]
+>> endobj
+5561 0 obj <<
+/D [5552 0 R /XYZ 90 422.583 null]
+>> endobj
+5563 0 obj <<
+/D [5552 0 R /XYZ 90 382.703 null]
+>> endobj
+5565 0 obj <<
+/D [5552 0 R /XYZ 90 342.823 null]
+>> endobj
+5567 0 obj <<
+/D [5552 0 R /XYZ 90 263.052 null]
+>> endobj
+5568 0 obj <<
+/D [5552 0 R /XYZ 90 193.263 null]
+>> endobj
+5551 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F66 3165 0 R /F67 3022 0 R /F111 1509 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5617 0 obj <<
+/Length 2490      
+/Filter /FlateDecode
+>>
+stream
+x��Z[���~�_�<l���{Kp�!���fC�I^�=Dck<Zl�H23�ק���ۗ�	<�5�Vuu�WU_���E�����ryv�B� F��2��b
(
#!�y�:$��v�c�d�H,�)s��?~�|���+=v������!
+@ �����p0��?�8
+nͤU�)��e���g���:I�Ӊ`�8�E"�*�+��,�=�W/N�_�?
^O���"_��4����S��b��I]��]
��_���"�j7�G�OY�&��w�2����}����Gs��$RP��6j�_�<����k�R�$���Ddd��KZoʼ�:�7i�\π��)�1k`�̐�
ш7��dx�D$�bqLR;�N�\(�U����ɔq���
s�(i5E� 7%J"E�u"J}K�s�{Z��*@8��,��7u�du���Y�M�^��ف�����
+��[X����fB�#)Z	-�b�#�G�"AN�$M#��`t�	(ڳf���������{�4�Yo�Uqm�D�4��!��g
�#	FJ�����fYg��6�>�\!��
��#U!	��M��؁�z�`�q���*��:$� ��+R�!��~ }
�V����儩0M�t���<���r�EX�| �c�T��f
 Ģ�n���'
�$�MA�=hj�M2N�'bGs;
��
+���][�No�
{�>�]�
}Rr�����!��o�r���|y�|5��3��P�U���{U��7����ߡ��������-�o��LAFT�A�c��I�|g
+����� 2�
Vx��I�L�1���?K�Y���q��0�
+��֗KS'ƴ�(�ͷ�'r�_\�������eRU�b�l}<�ݘ�
+�xh�_D=D�˸�AoK�N�o~`�#@5��v�K7	C�
+X�vK�@BA*4Մ��qS�5��9�7E"Jew ���T��A�=U(��B�+�&-Ӿ�
��
r�,Eq�L�x��NQ��
+q�����bD�Iw^Q�=��~H��{s
z�3W��v�(�9�?�TE!�L9��#�]�
�O���Fq�;q.m(0��*�gI
+a�s��e]��C�1a��1γU�Rg�� Էݸ�u2K�������^��'�Q�e;:�H'D����#�1m���B'v&e�\-S/r#0I�{am��l}v� &1�@
+�������{��S�S����861

�ZW�"��b�IpdZ��
+�܇��a�;|C@�녾���
*#�q~nȮ}
��.<q�[�~
�ا
���ޙ ��r��L��v���Ҁ6t{-S�� ��{N�m�eVo���a��҈�R1�t�/U��@O)��@O)�ƒ8\dЛt$,�	%@
.��%�
�8j!�x�� �������@A{h%w�§�$`��c2�_
�B�p�P�� +��ds��;��J
l]������� ��F�IG3u��ń���RX�2�^鬴ɖ��&�g����\�Z'X�n��q���I���/���ڰ���
F�:�P��u6K�˭��Jw,�%]�����N��P�>s�
�����vu�����w1ઐ:D���.|n���My�V,�
v�u����)��
�AS��DfP�L��	M!��L)��d*	
�
f�S_�+7���H��ԡ��i��:��a���mj��պO��_���#sk~
t�������� V�X��F�Me��
�"[F�"�
轶��z�N�W�ςIm��
Z [...]
��{��7[�T�
��*�?	���&���1ʩF��&�}ߚ��^�m����0��e#V���'���`ИI���8Qc:}�f�и���^��D��H*�'s��Aw��F�C�c�	`�zr³[�����rf~M����ޝ'�c%�U
;��O|��8
D�u�:�D4��HF���h�<���h_0�9�����2�e'��1@����1@�10�dTR�(;���ރ����|k�7&JQ3ؿ6��3���+<+ at X'n
+���C��'�ڇ�YtΗ/�����'�OrHΓ�m�弥#Fp�
hm�}�#8|�6�mu{۪�7�$z:)�x��榮׏�ϯ6�*�hf�b֡��,X���.�滒��g9�\%�]
;��O��
+endstream
+endobj
+5616 0 obj <<
+/Type /Page
+/Contents 5617 0 R
+/Resources 5615 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5425 0 R
+/Annots [ 5543 0 R 5544 0 R 5545 0 R 5546 0 R 5547 0 R 5548 0 R 5549 0 R 5577 0 R 5578 0 R 5579 0 R 5580 0 R 5581 0 R 5582 0 R 5583 0 R 5584 0 R 5585 0 R 5586 0 R 5587 0 R 5588 0 R 5589 0 R 5590 0 R 5591 0 R 5592 0 R 5593 0 R 5594 0 R 5595 0 R 5596 0 R 5597 0 R 5598 0 R 5599 0 R 5600 0 R 5601 0 R 5602 0 R 5603 0 R 5604 0 R 5605 0 R 5606 0 R 5607 0 R 5608 0 R 5609 0 R 5614 0 R ]
+>> endobj
+5543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 164.042 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 707.957 213.646 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849) >>
+>> endobj
+5545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.983 707.957 318.232 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.389 707.957 441.638 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 679.612 164.042 690.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 679.612 213.646 690.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) >>
+>> endobj
+5549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.983 679.612 318.232 690.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 651.268 164.042 662.171]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 651.268 202.497 662.171]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aa948df90fc7880e7e52ceef297ee9bbf) >>
+>> endobj
+5579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.835 651.268 279.966 662.171]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 622.923 164.042 633.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 622.923 202.497 633.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a2cb39e7c88e9e724e7970d0e953f2c81) >>
+>> endobj
+5582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.835 622.923 273.341 633.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 594.578 156.281 605.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a408ca35042312cfb3c8fb63d41ed2bf5) >>
+>> endobj
+5584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 594.578 210.229 605.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.44 594.578 278.572 605.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 581.402 164.042 592.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 581.402 213.646 592.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849) >>
+>> endobj
+5588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.983 581.402 318.232 592.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.389 581.402 441.638 592.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 568.226 164.042 579.13]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 568.226 213.646 579.13]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) >>
+>> endobj
+5592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.983 568.226 318.232 579.13]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 555.05 164.042 565.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 555.05 202.497 565.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aa948df90fc7880e7e52ceef297ee9bbf) >>
+>> endobj
+5595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.835 555.05 279.966 565.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 541.873 164.042 552.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.54 541.873 202.497 552.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a2cb39e7c88e9e724e7970d0e953f2c81) >>
+>> endobj
+5598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.835 541.873 273.341 552.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 528.697 180.54 539.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_adeee840f3313b6050d439dbe5fe2fdd7) >>
+>> endobj
+5600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 528.697 258.009 539.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.742 528.697 349.874 539.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 515.521 178.239 526.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_aaf7dc46b2cfbd6650ac1d2035d331f15) >>
+>> endobj
+5603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 515.521 255.707 526.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.441 515.521 347.572 526.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 502.345 156.281 513.249]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a408ca35042312cfb3c8fb63d41ed2bf5) >>
+>> endobj
+5606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 502.345 210.229 513.249]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.44 502.345 278.572 513.249]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 427.57 227.951 438.474]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 97.671 150.553 105.197]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5614 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5618 0 obj <<
+/D [5616 0 R /XYZ 89 770.89 null]
+>> endobj
+5619 0 obj <<
+/D [5616 0 R /XYZ 90 488.265 null]
+>> endobj
+5615 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F67 3022 0 R /F66 3165 0 R /F111 1509 0 R /F91 766 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F7 803 0 R /F11 621 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5640 0 obj <<
+/Length 2551      
+/Filter /FlateDecode
+>>
+stream
+x��ZY�۸~�_�ڪx���� xL֩���ٍ�8���k��k)rLR��T�{�q�F��Uy����>1Թu����o..�‰H�s�y�v"�^D�_���e�p�X2J��r��W����S����4����MW���'eq[��b�.�\R�I
׵�J�i�`��e�S�e�X�{��ų7�/��:L�@� tVۋ�﨓���%"
+��j���6w^_�����L[ܮ�5���ו�O�@�x]F0����{����휷K��-v����J���N(�Β���W�
a��t��j��
떫I\F������n� ��8��O{�[2�3�=����d]�y������zhU&���.�#�ƮZ
r�<�d>�#
R�<=X�M�H2;��t��x~�;p����h&���#j�z3�I�N� ;%�zv
+���y.
+s[��MK!<�#�g���!�����&F�}hYZ��V�l�uV3���P֞��Qε�h<
�—"$
�H��qn0��y@€i��y���~|�
�u��lx���I�~����в�u�d5��7���,F���V�cO����=�\0"[���3��0 at 7#��`Ƽҙ[�t�So�*6toRK?]ex�4�q=���K����
+y\�q^��-��fʘ���muu����^�
�[[�p4��
+��o��3{���2d���i�<�[�Fl�ʰ5+
����>,�t-?*Ϸ7\��f֮~!�ayx˙�уLw_dEW��>�Ui��|���M�φ*�&:�If��馧ݏ��܏�����ֺ4U\[�5'��$E�.R��s�ח�"�Kem��\��_b[��b�.��D���糐knB��.6x��
C��0!@�
n#5�?�
��N�`�6�n�-u�?bݬ�k��YH
+����Ӥ^�ڨ�}��

�۴ٔ�	$�
+G�@`ڇ,AK�#x4lS
�oAy�=�~�E�_ h����!�P��b3?+�%�
+
*$DY�t��V"BC�H$
�� j�W���]��H����Y�
-ϊF
�R�6�נ2�2p
59 V(�
2�/�Vr��#Z1����>��>H���?�~�pe=���J0��ZH�Kh��*�͌����X���MQ�݈��j�G4�{;
��X�?f
~ѶyR���k��훍�����Y��ڛ K�90��V�9���I;A��X0�R���P|{ߎh�2s�f���׋�t.?�.'H��&`��5���oy_��n ����!��r��I�G�M�>�m�a
fs�|�%\y ͒����%{���QD� �#ڟH9ú�v�@�g��"5�!�hh��G�0�i+�:ޚ�a8p�A�*��!"a�h����I��O�e�#|����I =pv"
%����z 9�vJf�Q�?�����q
�����P��8��^ �̹��#9�{�
��
�v$�/
�8
�<#K���I��d�'�
�F�(������
�_�$��m��+^u���D����}gs `�ԾY�����o��HË+��f�U����
�E��y
A�7D�����`�F>���u���8Wy�IomBmOF�Ed���a�h���t�z��
+̆��^L�1B�����{�
����8Ϛ=9*��\��9�@:)5��=�Iziȟ�{��1�pn�����n���#*��nWvX�����Hڌ���a5/"|.���a?���:��i�Wf�*HB�-�|7�o��w��5!~@D���i7��@w��ؔ��6-�rW_7i�
)�L���	����^�#
�L:1����+�&?�V��rF��3�
�g
+�1wqn��]sgKup�<�B�J	�D�Y���=��x���{����OF�u�[�s�iى ����XLx� C�0zֳא7�Y�Lj3�3��H��7�_�E �
y�qW�v0�6��s3���wq�d�]�2V�n1���&��a#r56;ݘ���h ��*��
J2�U�!k(�&���
Z�h9�tM��˺�R9�Q]\����"4Y��
����T��A��p����he�k%t�4
?-W;�`�* 
���5�^#P#ݛ5�ԛ���H{_
+�=���!���g��<�8�9�c�&6��-s�
��� �7�/��)d,
A��/��;x����U��ĩ�`G���U�m>�d�&<8�$�R�6�>�2�-�ng6���A?s�+����I�۬�D�� /c-�� ��[F
��V%YW{
�;|��w*`�)�{N�L��Baߞ�Q
���A}�mM��KN:l��׏���о�z�޾�tt-{U��o��jL������[�؂�e�ǒt���vys=\kf֥�7
U8�~�z��]��
��]Vo0 
�c��$�
��'��*�BR�=��0
�>
+G�˗/t�uZ}��0���E��R�2}�v
n��J J�N����ul��:@��J���;m������fw
ܽ�8{;E~�.(T�s벚��%{bm�奤��>�� ����	�����B3p��V8OK`r�;��N˭
+endstream
+endobj
+5639 0 obj <<
+/Type /Page
+/Contents 5640 0 R
+/Resources 5638 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5425 0 R
+/Annots [ 5610 0 R 5611 0 R 5612 0 R 5613 0 R 5625 0 R 5626 0 R 5627 0 R 5628 0 R 5629 0 R 5630 0 R 5631 0 R 5632 0 R 5633 0 R 5634 0 R 5635 0 R 5636 0 R 5637 0 R ]
+>> endobj
+5610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 709.04 150.553 716.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 673.94 150.553 681.467]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 638.841 150.553 646.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.772 638.841 309.556 646.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) >>
+>> endobj
+5625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 595.771 150.553 603.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.772 595.771 297.003 603.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+5627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 579.831 150.553 587.357]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.772 579.831 297.003 587.357]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+5629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 536.761 150.553 544.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 387.122 150.553 394.649]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [131.823 371.182 179.843 378.708]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+5632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.007 331.332 196.58 338.858]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.086 307.421 158.921 314.947]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 256.381 150.553 263.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 248.411 150.553 255.938]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) >>
+>> endobj
+5636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.884 96.032 193.016 125.347]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5637 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5641 0 obj <<
+/D [5639 0 R /XYZ 89 770.89 null]
+>> endobj
+5642 0 obj <<
+/D [5639 0 R /XYZ 90 202.685 null]
+>> endobj
+5427 0 obj <<
+/D [5639 0 R /XYZ 90 180.308 null]
+>> endobj
+5643 0 obj <<
+/D [5639 0 R /XYZ 90 180.308 null]
+>> endobj
+5428 0 obj <<
+/D [5639 0 R /XYZ 90 77.486 null]
+>> endobj
+5638 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F8 802 0 R /F11 621 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F91 766 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5652 0 obj <<
+/Length 2363      
+/Filter /FlateDecode
+>>
+stream
+xڵZYs�8~����F��`� ]�/�I�f6��$�}ɤ<4Eˬ��Tﯟ��4uYL�A 	t7�� G�G�\�t}q�F�(F��2���b
)
#!�i
}�ͧ����Ԉ�F�ׯ������������/>�8)
���O�q4�׿E�XG�l�U�)��e���
�e��
+�4^���$#���QD�3�1���R>I�U�T$"b�dl�3
���XǍhO� �"&t ��)���rJ���>�PL�z
	(H�6�-�b:ӓǫ�W����f�4붧3���O,�t�%���uYA{�O�BR�f�M�"�׾o 
+׈���?\Bt��Q��G�r�!A���ˇ졘=��l]%U�YQ��V��*�)���
(�B�o�
��
<���q\����	le\��%��gEi��S��a��y�٪F��o$	3`$�Q���<L	�<��۴*a/����f�]n�3����]�Y�V�e�,���=���
D�TO6K]�@B�b�k�s	���f3J�3hH�u^O���eHi�?r

�>�Hΐ��9�� �d4M0�8��� ��.���d	��>I3�CҾ'
L�D�,��Pq��etb��@��nw�j~u���
O��
+�o `��,��̩��
��#�٨3���i��q��o��S
f�3��/6S*&���J������3��l�#�F��4׍%JQ�ή������n��L�q
�
�}��c�A]�ώw�f<��N?��?���D8��k�ݾPj�ۇ��x�z�S(8�Yr��+�[Y
����J��z����n�LJl���FW<�u6%`�+�FR	����W>�H�K��
-�jt|H����r��"���F�C���
Ec����% ����p��
�|˫{ת�3�(�4��;��/��k&tJ4�Q
��G1���T�`ћ
Մ�{�����0�u��:��,~c?�r}��B�h��������O�\�QPO�����ʷ
+�8;Ѧ}����l�W�x��5כ�}�h�,��X���'��m
+���K^�lh�C#�@x#���
K��v�F�b�-Z�o����	T� �����͕�b
�6���'C�"��
�p
t����{36��3�6�ڕ�)�����
��3f�^��X5���X``�% �YJ�Q��D�7��!�0F�!�'�f���C��NO�n�_�(C�.���Ռ祺��Qv:
+�J8��B
pm���ӗ繒:�y���ɲM�C�<�p� k8'�
�z
8�i-N���Eh�+‘��rp6���P���[J�����ZIw�<��~�C��h o��ݚ�
 �($p���|���y���P,�RAVI�y�E�Q �`��Q�5T��U���M� 
v���)�/�
5�$+�, \X]u���A?a"|�b[��.��_��!�$�7q��W� �T��hw�=::��c�i(&� Ɏ�=�x=�]<�m�|�pM[�ۖ� �E����:�Pg�����g�z�i�/�e�[�
`x�D���%�-�,Y6��D��z�7��ۣ>o
+�+�	k}R�R��ѳ
���l:��6���lZ�l#�.�x�������k��8e]�1�E�
�X���0��@a7`pJ��j@��4K!H=��5:E[�
+�6���@�V`��T	$H�U��ke�q��JC�S�at�
���7��1hp�z
+�	9cλuH*��Ժ�):��xS�x\�� �Rt���ҝ'Ű�u�h��vK�I�H�@5��y�}��
m[V�u�{�?+�yZMhQd��3q�n�4��߭'&��c*޳	
��Sk�͒�j����6����:�^�~ޤ�\��Dwp�Y��?�}D<�#�u�ip�#�놔d꤀}�>`����/)�1G�t
Yb�4a�0G$��)�!�A�'W=v&�i�%�Rrg^�L��IJ�;�)�g��.w�8LӰ��u ى!ڐA�c�[��ƸeQ�NJ{4����Yχ������7t
J0����z�
ԧ�4p*`��	�eC���
��>/XA���D�D��؂	�_G �ٔ�QOY M-HlpLǼ��!y�u	�Tz��cδ��Л�3�#3���85��!Ps|���t��=�)X���~3e��,{]hձ�g�x�C%{�����|%�u+�
C
 �h��@��͊��n�(��I�n���
J��{)ʎ����́��
� L�-F��Ӷ�1���+��b-�Л�kѰ����_ k�������o]�?eV�0!�wn�'k��� �UF��x� ��6�Mg���ǬNb�l�kD��+�udRn�����
�./o��2[/Pڔ;��
lnp���&_Ym���+/W;�%@��h�
+endstream
+endobj
+5651 0 obj <<
+/Type /Page
+/Contents 5652 0 R
+/Resources 5650 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5425 0 R
+/Annots [ 5645 0 R 5646 0 R 5647 0 R 5648 0 R 5649 0 R ]
+>> endobj
+5645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.381 517.928 193.513 547.243]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.972 383.67 233.221 394.573]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.539 322.095 193.671 351.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 270.936 261.163 284.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+5649 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5653 0 obj <<
+/D [5651 0 R /XYZ 89 770.89 null]
+>> endobj
+5654 0 obj <<
+/D [5651 0 R /XYZ 90 721.073 null]
+>> endobj
+5655 0 obj <<
+/D [5651 0 R /XYZ 90 655.872 null]
+>> endobj
+5502 0 obj <<
+/D [5651 0 R /XYZ 90 621.202 null]
+>> endobj
+5656 0 obj <<
+/D [5651 0 R /XYZ 90 616.718 null]
+>> endobj
+5503 0 obj <<
+/D [5651 0 R /XYZ 90 497.006 null]
+>> endobj
+5657 0 obj <<
+/D [5651 0 R /XYZ 90 492.523 null]
+>> endobj
+5504 0 obj <<
+/D [5651 0 R /XYZ 492.815 442.993 null]
+>> endobj
+5658 0 obj <<
+/D [5651 0 R /XYZ 90 436.353 null]
+>> endobj
+5659 0 obj <<
+/D [5651 0 R /XYZ 90 296.241 null]
+>> endobj
+5660 0 obj <<
+/D [5651 0 R /XYZ 90 244.61 null]
+>> endobj
+5495 0 obj <<
+/D [5651 0 R /XYZ 90 220.077 null]
+>> endobj
+5661 0 obj <<
+/D [5651 0 R /XYZ 90 220.077 null]
+>> endobj
+5662 0 obj <<
+/D [5651 0 R /XYZ 90 149.4 null]
+>> endobj
+5496 0 obj <<
+/D [5651 0 R /XYZ 90 81.969 null]
+>> endobj
+5663 0 obj <<
+/D [5651 0 R /XYZ 90 77.486 null]
+>> endobj
+5650 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5667 0 obj <<
+/Length 2632      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸}���K[i��q��i���ݎw��%�dd
�9�H���z}? E���f�I�O�$8�.�;�#*��ۗ�ΰ}��?_���V,�Q,����Q�#�c$$�[Do'~A�3�1�\M	������Ք�I�z�7�|����&��O���.0魙Ψ��W�yQ��_���S�'�[�(������g�>�tF ��C �������{
-�� 9�u�j��8e�ޜ�|���US�IgJ� BZ3B
Q?��)�,Y N�
᝝cQQ�������(�q��h�� �ՔQ�锐��k�i9
+J�B��3=	|yqQ���Q���`q4 �����y�
x:�BO^ef�cz��t �
b%� �	�g
�*�yR�YZ
�.)R�'/
]B
+��$�YN���U
+���	�m3j�6/�]���SA����	�_���,�
+R�(�uwo�t���}5�?�_K��^HB
������)=������7�ҍ
Cm{��`�
� �4�۔�I����D
oeC�B�c�����u4�1���C]q��8��ě �1�m�Ho�m�6��<u����|��OS) T喀	��'�#Ic�
�am�v-�
a�8�E�����5nB��`"&�q���e$!b{!�Ih/�+�~<�J��� �1‚vri�1�����Kg��� 
��	�i���(�4g��
�_T�T�4�Еm)��;J��o^<<e�3
���M|~
K�[��H
o
yU�lV�)��
+�]��=ĐS�̙6��18���t�S��p9�A
8��j�Z+�D<����� ��-�G� �1Tn6�) 7���a���
�c'p:�Z��7Q�����"�fF��胧
�
+q"�V�ˡ� �cy�P�?�F:V�,q�m���b`T��;�(�Oq�O��� U�>�FIj�:K'�{�M����^�k��}�������>��Pd��D��(��w�оu��?�'����
�
�����|[��Z��lj

ӑ!5�"��%�M�Z�C�-
�-��2����]����A��1@�A�� �N��x���"�r
(
fEy
@)�e���`r���	u�Q}�U�
+#e��@b������
Bb[�K��A�,k��0]=��d�(�$�9:�B�V�sO:�~
�5^�
�&�`[X8|�vQ��5��t������ae
�ڕ]��߆�z�
,��^HM�
��j�M� �n��B������"pvD���@�%�;JE���L��"��sT�5A,��h���n�cE��O@�f�o��iK�a��Y`D��
�ku�����E�4��2��j���:�v��#@6pWx �=��ZM�hS�€3����ҽ�j��z6B�O>P�Й�
Q�9�v��8�u���"����I��������>5��~@��!����	B�+.�l
y9��ART��#��{X�
�UC��B�7�`3��!
���D
����OQA
������l��� l)�(*�v���2h�

+ <G����A�$�"')J���!t���4��ޭ�ӕP�k��R([�-��A�f
�8\��
bXp��(*�b�	w8��ݍ�H�`@��{�o��
+��:��b�E�B�E����Z5����{a��rO>G�1���z
�g�R�,�F�P˽ �s��Xj�`��S"&����
�(C
�;XjC����4˲R�tdń����� 
>��u�]n�e]J��Z�j��
=W0���u�aC{�{H�N�C��5�<�I:
>BW�It�T�Q�v���� ԉ
@xN����N� K��s͞�2vZ����՞Y�
d�\8c��_n�{׭�hC�r

�'!m����I�Ҍ���c'ݿ�'�����6��ˏ�8��o�OKNB�l���w�4�c��w��4
���;���b��2����hk�E�6i�d�
��&N�� Gl��5��P>mo�H���<Ln�@\�C�Rfv�v�=8�>�~����F
\�s6wi�6���k2
i֝��+,���b��d>�s
+
t�c��mf�v祹�TS�M�Y��Q���`�w�?�}"P��*�!��|$/&{
�v�N<�fr6�@�v�}�
��3�L�U��4ij�
+��RIGV��$
�I���.2��6���Nc
+���oV;/��&��CZ�;�W�3����f�?�^[�2��7
�I�a�p���0���*�a�����&+��{zt�1H6�����~�=RX
+b at t�<��à�2�և:m��O�*��·>�O�
+n
c2�v��`�$��%Pa™�m�C8�]���A�

m�S�h�M���!)�L
/x
�
��U��HA�bT1{�:u=�Sn����#
��ᴇ�ͤ�]:�h�"
C�

���
+��8`��j�
�0�=��Ǡ���wizJ�W����?z�#(;�=�Ч����c7O�#��z諫��?
+��a*�ă�i�>��b����0�6�@�mr��	Su���1~�Ǩ~��Y�h[8DaX�5�{_����󛇻¤w�6[��ۚK��j6���*Zg��O��Q����㦶�� #�yk�A?Ac��Z���/��ο_��/��߿��X
+endstream
+endobj
+5666 0 obj <<
+/Type /Page
+/Contents 5667 0 R
+/Resources 5665 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5677 0 R
+/Annots [ 5664 0 R ]
+>> endobj
+5664 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5668 0 obj <<
+/D [5666 0 R /XYZ 89 770.89 null]
+>> endobj
+5497 0 obj <<
+/D [5666 0 R /XYZ 413.076 677.047 null]
+>> endobj
+5669 0 obj <<
+/D [5666 0 R /XYZ 90 670.407 null]
+>> endobj
+5498 0 obj <<
+/D [5666 0 R /XYZ 254.215 591.298 null]
+>> endobj
+5670 0 obj <<
+/D [5666 0 R /XYZ 90 584.324 null]
+>> endobj
+5499 0 obj <<
+/D [5666 0 R /XYZ 90 477.498 null]
+>> endobj
+5671 0 obj <<
+/D [5666 0 R /XYZ 90 473.015 null]
+>> endobj
+5500 0 obj <<
+/D [5666 0 R /XYZ 90 366.687 null]
+>> endobj
+5672 0 obj <<
+/D [5666 0 R /XYZ 90 362.204 null]
+>> endobj
+5501 0 obj <<
+/D [5666 0 R /XYZ 308.538 307.836 null]
+>> endobj
+5673 0 obj <<
+/D [5666 0 R /XYZ 90 301.196 null]
+>> endobj
+5569 0 obj <<
+/D [5666 0 R /XYZ 268.967 245.997 null]
+>> endobj
+5674 0 obj <<
+/D [5666 0 R /XYZ 90 239.357 null]
+>> endobj
+5570 0 obj <<
+/D [5666 0 R /XYZ 391.965 189.827 null]
+>> endobj
+5675 0 obj <<
+/D [5666 0 R /XYZ 90 183.187 null]
+>> endobj
+5571 0 obj <<
+/D [5666 0 R /XYZ 158.014 121.701 null]
+>> endobj
+5676 0 obj <<
+/D [5666 0 R /XYZ 90 115.061 null]
+>> endobj
+5665 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F7 803 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5681 0 obj <<
+/Length 2208      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�F��W`�%��Ѽ���u�T�㍵'Ǖ�ȡ�2� [�����IEJ�I�"������}� G���;�����+�"���2�\FG�$$�ZD�'D���"&5"F�]��?��|���v������K8"^�@JG����
-��F���s�(�8e��;��
�"�-� B���;�Q&'er���PL�?U���]N����1�'6�J>���ne���i~m3�o�E�-�fya��,/�x��n��	3Y�xJ��$�
��*���g�<��n���r�f�q4�G2B�g��
�k�?��ˤJ܅ߦDL,����s��w�9C�-�"�uDXEONgc�~J�$O�K���u�bx��hM��$�J!��]1��h�E����&��Ԣ0��-{;et����Lno��@�@�1
�GELo�:�*�b:ӓۋ�yv]ll6�m��%���
x:3��#�Ѐw
�3¼.�FכKM�[
á�'
x4��6<�5�'�P����
�f�^%C��v�}։�� [...]
��;4`/z˪pއ3�&1����F1ΐ�\62�4�P�E� ����r?�
uɢEw���Ě�y�j9%@�y�e�K������Zҿ������fr�A
uXb?m�ßx��8�/mgU2/��d��{��A�y�����rSv5y>:�qj���mV�_�Y��
U
p̺���m㬵-b�[��
����������Q�
� 7��#x>�BL��H��yC�W��E�Q�M�P�g��+��x���UR�~}��7)�<�O
�66�N2
ifFjQ[!�r�u-�u���C,s�z�
r`�QE�A�v�1�׎| hW�s�W���`	4^Ҵ+�<
��2��%�̂���<�U�a-��hLc�)�Y��q�pg�`� &�8A�l�M���!�;<r �TB&$�â�P���e@����.B�qٹӉ
�B"�ԖC�R4�u7�
�<�2�����t/�q(�?�#�M����� �y��
1�QĔ�;1 "

I��a at Y-..rh�l�z�5&D�Z:����m�
��!��aSH_ yR:O��B
�u4I�{� �� @������Ӡ�i�U�c��8���?�{w��������A
i��I��m��d6.~}�e
M>4�0~�^gK+L?F�1�}T-	"IF�H"T>��4d @S���1i ��i��} �z�6ߎ��F��Hl�G�+��
+]0�R04�T���P��Hq� ���d���r:clBzW��
�
`��G�R��ܞ�Zꈓ���
+S�tԡ����������<�Ջɞ<,��]��{;�9'�>�&s�ѧ
�
D.jQ�M�'UyqѹjK���=���
���
����-��z�8&��Ba�1�}�
N��XJ�+��3]���%� �1Dn�B�p<� �#7s���#7��0����6�l��ܹ�7�����q� M{�Y7ί���6�ω��4�4PaNݺf�!�t�0?�Ό� ~��AH�
�?�Δw0�l����5P��)����l�[.�ݦ`�p�K��Gh
���,iv'�ͪJ֫�$��M ʾ��xh�I�����������|�Ym���z�g`�h����3�1�w?�@�ϩ�]����k�#����B���Ύ*��
��]�2��bx�
�$@(���
��(D��{��AUF
U���V*�RM������8O�,<��V����@�;6
�k�n�O�4'�TXEP���c��rHW�����OHA��p�T'�N7��P�m_,(��v22(e�
+�IV4q��C�?7��,�t�gq�t�u �X�Z���DS�����	��='��0�c#�GT�AhҰ3
��NRW�SKg��(,ܸ]:;���kE�K�A�g�<@-�ު����& �B��$�7
+�{�a�<�On �&L`
|]������`�|�}�"E���x7~�����O��wwh [�H84���u��:q<Nڳ�_�IG9v�Wi����
+|U��/���=͉��S}���^�
��z��7o0�H�}�ܛt�*
|���������-�-��l���C��J�(����9����������Ɖ޶���?�ձ��q�&릪���W�kh6���g�q)�o6@�>�/���E����}d��ׇ22��O�Ƣ
+endstream
+endobj
+5680 0 obj <<
+/Type /Page
+/Contents 5681 0 R
+/Resources 5679 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5677 0 R
+/Annots [ 5678 0 R ]
+>> endobj
+5678 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5682 0 obj <<
+/D [5680 0 R /XYZ 89 770.89 null]
+>> endobj
+5572 0 obj <<
+/D [5680 0 R /XYZ 206.163 699.155 null]
+>> endobj
+5683 0 obj <<
+/D [5680 0 R /XYZ 90 692.515 null]
+>> endobj
+5573 0 obj <<
+/D [5680 0 R /XYZ 507.769 637.316 null]
+>> endobj
+5684 0 obj <<
+/D [5680 0 R /XYZ 90 630.676 null]
+>> endobj
+5685 0 obj <<
+/D [5680 0 R /XYZ 90 544.341 null]
+>> endobj
+5574 0 obj <<
+/D [5680 0 R /XYZ 90 521.474 null]
+>> endobj
+5686 0 obj <<
+/D [5680 0 R /XYZ 90 521.474 null]
+>> endobj
+5575 0 obj <<
+/D [5680 0 R /XYZ 90 479.769 null]
+>> endobj
+5687 0 obj <<
+/D [5680 0 R /XYZ 90 475.286 null]
+>> endobj
+5576 0 obj <<
+/D [5680 0 R /XYZ 90 435.554 null]
+>> endobj
+5688 0 obj <<
+/D [5680 0 R /XYZ 90 431.071 null]
+>> endobj
+5620 0 obj <<
+/D [5680 0 R /XYZ 90 391.339 null]
+>> endobj
+5689 0 obj <<
+/D [5680 0 R /XYZ 90 386.856 null]
+>> endobj
+5621 0 obj <<
+/D [5680 0 R /XYZ 90 334.835 null]
+>> endobj
+5690 0 obj <<
+/D [5680 0 R /XYZ 90 330.352 null]
+>> endobj
+5622 0 obj <<
+/D [5680 0 R /XYZ 90 278.665 null]
+>> endobj
+5691 0 obj <<
+/D [5680 0 R /XYZ 90 274.182 null]
+>> endobj
+5623 0 obj <<
+/D [5680 0 R /XYZ 139.991 195.406 null]
+>> endobj
+5692 0 obj <<
+/D [5680 0 R /XYZ 90 188.432 null]
+>> endobj
+5624 0 obj <<
+/D [5680 0 R /XYZ 90 137.079 null]
+>> endobj
+5693 0 obj <<
+/D [5680 0 R /XYZ 90 132.596 null]
+>> endobj
+5694 0 obj <<
+/D [5680 0 R /XYZ 90 110.548 null]
+>> endobj
+5695 0 obj <<
+/D [5680 0 R /XYZ 90 77.486 null]
+>> endobj
+5679 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F8 802 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5714 0 obj <<
+/Length 1990      
+/Filter /FlateDecode
+>>
+stream
+x��Y]s۶}ׯ`�N[j&��
RSw&m�N��k�>9-A[�TH*���� )�"m���L�R�X�9�8
bD�����a�M~��
��Q�
Q(��.^�=�C$$<ͽ+��:���6&؏�Mt}6��O�w+=Ϣ��Mew���i��v:��닻�Л�
+�����6��Bgc���xJA|���˟F�/GF��
�v�o�]���
^���0�n�N�S�k�b���6Xn,$����� �6kw��$���ˮ�]ٮ�iC*$U�t���H�/Oa������	�ʟ�I^�,��z':ʮ_���N��8MzV
(4�U��=	�] 7V��A�E�L��w��0��X'�!&�HҠ�#��}Ȁ}AXcs�'�&�I�Eq�O���:�K�����F
+���^����=�mN����'0(Ž����ʥ� �`m�SZw���:*��}��*8ی�,2�!bLx
+V�Cj�hR��������AJ�eA���
�����1[�2H	X
Gap�aF��\=�D,P���
+�TGq�	DݘG.�D�j���Y�(�
�� w���8
ہ�W(�i)�:���0G��^��Ä�e�����r�lR�d����b.�
�^S��c9�8��x�"��="�0��)��0�{��9��h{�cH�j�n��ɂ#h
<�C�ii����i��4]�hPs���>;� � 	�Iy�
a���:?�1 
+���g�,
+!&�g��75�@>���(�I�#��D�O@�I�爦���d��� ���̏c��4�[ �1!�m�m�y��o���9ӂ�_jTP�8�C������z���UTD���v8��UG
«	�ZRښ7�����z���uU�5��lj�j��F�B���	�B�k� 
+J>��F>3	S���tK3
+��!���{L臧1!��D�{
0�~�J`:��E�[���L�$q�@
t���
�&TR���	U .8mk������{B�K�"�*�*7���p�F��!�ݪ�r�miu`&���zn[�4��D���o��J��
}B�	Cs�IB���i���o R؈� aƚ;��$ܚ;�;�Dm|e�YQZG��6
+;�����q��
��Fk7E
���>EeƁ#�]��tJ�x'��l�d�&���ozV��.�S�[��¶����j��<΋8Y��|ݬ
��,�TCݫzQ�T.S���
sV�z"�Pc�Jym>�ʎ�����sK��R3�ЮE�^�%�`U���ZO[�0�6�%q(vi�
����j" �n�k�Z��h�MK6V�Bu,D���`>�*
A�1u0����!���Ѱ�H�8D8c&,��*L��&PhK��-jOe����z
+K@�B�6��ԅC��ԅ�y�b�~ �̜�Pv��
��}q��<�[���~q3DH9��d���뚱{I[�������kI�'ng
�g 뫦o�����
+qB��!���ΏJ�U����g(�l��?
��c�y��94/��–,��
	9�PJ^�"Y��&B]ܿL�lh��UFJM����St<��y#L�3�g���:�Y*6�]23���<��X���
���!|J�ٖ����)�2����n�q�H�+8�r�lO{O��ݘo=�x=w�I�`כmq�)�&g�A�p�<���|g�.o����a��A�������H��D�?!8�𝢱�ۼ4a��AUF$
�(ZI�bi�j������� �RBESrA��F���� ��c�3�W�S��ΉZ�� �ֺ��cfpF�I���d}�
�>�)�����L� �<{8\��ϝ���q��ߋ|����H�v:�x)���{H`
+n.������[��_����B��C�Dɮ*X�?�t���.D"���X�̅�����W�~
�«��;�5ժ(�ӓ���<�D�tsH��^@�Z���&�tU���M�XT��ʗ�M+o�C?���D)Z�h��?����ɏ�J�ɿ���3>�
+endstream
+endobj
+5713 0 obj <<
+/Type /Page
+/Contents 5714 0 R
+/Resources 5712 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5677 0 R
+/Annots [ 5696 0 R 5697 0 R 5698 0 R 5699 0 R 5700 0 R 5701 0 R 5702 0 R 5703 0 R 5704 0 R 5705 0 R 5706 0 R 5707 0 R 5711 0 R ]
+>> endobj
+5696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 235.306 192.544 245.233]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+5697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 161.668 198.363 172.572]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) >>
+>> endobj
+5698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.179 161.668 263.936 172.572]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 132.556 198.363 143.46]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a1a897aa9f5d0da382de3c8baafba247c) >>
+>> endobj
+5700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.179 132.556 267.822 143.46]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.283 132.556 340.04 143.46]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 103.445 198.363 114.349]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a8bca7707491a770d78b523ae5570b139) >>
+>> endobj
+5703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.7 103.445 275.832 114.349]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.467 103.445 360.224 114.349]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 198.363 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aeb80e8469483bf1408d49901fee73802) >>
+>> endobj
+5706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.7 74.333 269.206 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.86 74.333 348.618 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5711 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5715 0 obj <<
+/D [5713 0 R /XYZ 89 770.89 null]
+>> endobj
+5716 0 obj <<
+/D [5713 0 R /XYZ 90 692.575 null]
+>> endobj
+5717 0 obj <<
+/D [5713 0 R /XYZ 90 659.513 null]
+>> endobj
+5718 0 obj <<
+/D [5713 0 R /XYZ 90 625.451 null]
+>> endobj
+5719 0 obj <<
+/D [5713 0 R /XYZ 90 602.342 null]
+>> endobj
+5720 0 obj <<
+/D [5713 0 R /XYZ 90 580.234 null]
+>> endobj
+5721 0 obj <<
+/D [5713 0 R /XYZ 90 558.127 null]
+>> endobj
+5426 0 obj <<
+/D [5713 0 R /XYZ 90 535.417 null]
+>> endobj
+5722 0 obj <<
+/D [5713 0 R /XYZ 90 535.417 null]
+>> endobj
+1746 0 obj <<
+/D [5713 0 R /XYZ 90 361.66 null]
+>> endobj
+222 0 obj <<
+/D [5713 0 R /XYZ 90 354.299 null]
+>> endobj
+5723 0 obj <<
+/D [5713 0 R /XYZ 90 253.847 null]
+>> endobj
+5724 0 obj <<
+/D [5713 0 R /XYZ 90 181.27 null]
+>> endobj
+5725 0 obj <<
+/D [5713 0 R /XYZ 90 181.27 null]
+>> endobj
+5726 0 obj <<
+/D [5713 0 R /XYZ 90 150.424 null]
+>> endobj
+5727 0 obj <<
+/D [5713 0 R /XYZ 90 121.313 null]
+>> endobj
+5712 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5775 0 obj <<
+/Length 1965      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�J3�'A��C�&
'm����d44˜H�BRI�� �-ɱ�8����b��������o�_.'/$s|��u.�
;��H��o��}�x�0�C�w�-3}���������������#�K@ �9�b��#v�0��������,Z8�2��;�?���kx��o.׼�#�9�D����Jsp��D��C��%��]Ѣ�!!�rA:br���'Sq���L�a~���
�I��鈈aŹ%��9�!.EIO��s�4b�z�c���`
:n�-F�Ƣ�=����νxk/�#�� ͽ
�a=6�
Q<\E�i[
+r�E�l��$.���\-*� X`�%�|mG;EG�D�{��k�5f�G����6
f~�/�јz�)
��!�)�#zF��}
*A�5�� 5QgL˜Q*Z/Y�Kg���m�
���I<KW*��ܪ��,������=��S�I��-�
����dށ�#
���C#}:UW#���j�O���R�΢#aJ�˵�x��_
+P�=�SbX������*�'W�k����U0��jA��!�sP4�
Qփ�H�a�R�|�>0��(�eߤ0a���x�i��I5�h\�y΅���+�k��Bpw7�����W�f�k�_ֳTa����vb#�探���7�x��U<��.�vs+�$���e_��+Eq*�B�U=,�>��d�� �}ztx���gY���kT�m������Q&�NS�pV[ܷJ��Wi\D%�����e)�~K���5
��G����a֛S��ʻ��(ۮ
����nk at +D�E�I4��LuS��~#���V�r=#�Qi��HM���הs�藍��xhPd�ߘtL#��
������`�e ��z�XL�{+��QuD4�ya
�](����A�'7U�N7u���U��52(������L��v���I~' ����Sq��F�vk�U��Y#G��Z��)[���yN.�G�Һܥu�FU7�F��_�'�y�6�
B�^�DXT�Y��$���I�@��P���<�U�N [...]
/�P�R���|�͐*��uE�V+�߉e�HBo%;P5���7T�wQ����+ig=y�8Hll�c��l�u��>mx�p���<ah�+ȪvR�a�Z\���M���k�ה�����1����v\ݜC����F���5���Y�\uY�%��(�
pt�؁ܲ�X���Q'$r=w'���q'�!$R�
����	���VCO[�f�A)�
��0iP
+�%J�q��r ��y��W+�ݖG��#
�~�!~�C��
�!r�t���FF�`iV�0Q$ �r���M��M��l�m�tR��J	�U۝�B
k�d��'v�+&Jk�(n�M����|-6=�'ml
��>�~�V�ַ��`�p}������]"��e����^c
#��ó,���E
'���n
D�,Y
�{�
+]T_&~o(J����W�e���ο=ή�Byq�����n�UL�����ؽT��g��Z�n��ˈ�����'���:��U�<�����:�$n�ɞ���
3�o�,��~h���A�$G���
B�[��v`��g�m
+�XO�FY�=�I6e�� �&�4r�e��cX2V���.P

�������;����ͫ#���RHi>u��f+/��kAq��f�3
�(��b���YE��j�<���Nٶ[ ƑWŚ,�>y�4�K�1r�̻ht>;?=;�ƻd�C\xǾ�~��B���zϏR/B������@�פ��asl
��'g
��� ����k��W�\3�����Ԝ�D�۷���_���4bXh�� ��|4��h��Һ/MY����Bֵ��2,Z�>U��ҟ�&O#^����|����r5e�P�,6���laY��qQ�+L.z�A����֠
+endstream
+endobj
+5774 0 obj <<
+/Type /Page
+/Contents 5775 0 R
+/Resources 5773 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5677 0 R
+/Annots [ 5708 0 R 5709 0 R 5710 0 R 5729 0 R 5730 0 R 5731 0 R 5732 0 R 5733 0 R 5734 0 R 5735 0 R 5736 0 R 5737 0 R 5738 0 R 5739 0 R 5740 0 R 5741 0 R 5742 0 R 5743 0 R 5744 0 R 5745 0 R 5746 0 R 5747 0 R 5748 0 R 5749 0 R 5750 0 R 5751 0 R 5752 0 R 5753 0 R 5754 0 R 5755 0 R 5756 0 R 5757 0 R 5758 0 R 5759 0 R 5760 0 R 5761 0 R 5762 0 R 5763 0 R 5764 0 R 5765 0 R 5766 0 R 5767 0 R 5768 0 R 5769 0 R 5772 0 R ]
+>> endobj
+5708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.996 198.363 694.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a8f78066abbc29188a3dccfad42477aec) >>
+>> endobj
+5709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.7 683.996 303.527 694.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+5710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.056 683.996 386.814 694.899]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 655.998 198.363 666.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_acf4cf2f1d8c3e1d339b1eddc94139272) >>
+>> endobj
+5730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.7 655.998 310.153 666.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 628 198.363 638.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a1557515cde9d0030743cd45ce2471e0a) >>
+>> endobj
+5732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.7 628 310.153 638.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.663 628 398.421 638.904]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 600.002 206.112 610.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a9d7fe3b07d9e1d35c04fa2d81e32bf34) >>
+>> endobj
+5735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 572.004 198.363 582.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.103 572.004 249.909 582.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a705b9ccde802cccb058145896a399b50) >>
+>> endobj
+5737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.246 572.004 361.699 582.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 544.006 175.668 554.91]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 544.006 234.596 554.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ac759e2fa9ea2058d86292dc3c5b43a7a) >>
+>> endobj
+5740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 516.008 208.395 526.912]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ab8ae5d861fb56c8ed906f604be7c4f02) >>
+>> endobj
+5741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 516.008 273.968 526.912]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+5742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 488.011 179.554 498.915]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 488.011 250.666 498.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_afefca839fc7b4d2d166e7a1fe6196fd5) >>
+>> endobj
+5744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 460.013 182.044 470.917]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a0dd6aa622dcadcee1746650f8ca164eb) >>
+>> endobj
+5745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.381 460.013 293.834 470.917]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 432.015 220.22 442.919]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ae4a4890ceb257496b788e0d31dbf6d7f) >>
+>> endobj
+5747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 404.391 155.265 414.921]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a3fe60e1a76b2a92143004e52ccfcb7c7) >>
+>> endobj
+5748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 376.019 158.044 386.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a0a4f8e3f3469f021594ea9311c21aadd) >>
+>> endobj
+5749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.382 376.019 235.513 386.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 348.021 158.044 358.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a7c083d56e96fb1b5bc3c5fb23350f0a2) >>
+>> endobj
+5751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.86 348.021 211.992 358.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.627 348.021 294.571 358.925]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+5753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 309.438 158.044 319.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a067b4c27cf8643f8ded50ebda77da8aa) >>
+>> endobj
+5754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.382 309.438 228.888 319.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 270.108 158.044 281.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a8f66b17d5e71aebc89be0af0e3a4c7df) >>
+>> endobj
+5756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.382 270.108 269.834 281.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 242.11 158.044 253.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aee8ca9a278a53c88ad387a619bc80f27) >>
+>> endobj
+5758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.86 242.11 246.313 253.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.823 242.11 332.768 253.014]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+5760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 214.112 161.013 225.016]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a0bf701759fc56f8fb215c273e53b46ae) >>
+>> endobj
+5761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 186.114 170.687 197.018]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+5762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 186.114 195.165 197.018]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a1685b5eb65ba36a9e715a8e3344dbcd8) >>
+>> endobj
+5763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.493 171.442 225.163 181.348]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+5764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.148 160.484 227.817 170.389]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+5765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 147.531 170.687 158.062]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+5766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 147.531 187.563 158.062]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a5c85932f5fb67a78d1faf8165783d5d3) >>
+>> endobj
+5767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.482 132.486 271.151 142.391]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+5768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 119.533 150.493 130.064]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a562fa08178e809398402920e5e674ff8) >>
+>> endobj
+5769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 91.162 181.845 102.066]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a9e8a61b2b759dde8f65219688548ffaa) >>
+>> endobj
+5772 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5776 0 obj <<
+/D [5774 0 R /XYZ 89 770.89 null]
+>> endobj
+5777 0 obj <<
+/D [5774 0 R /XYZ 90 700.898 null]
+>> endobj
+5778 0 obj <<
+/D [5774 0 R /XYZ 90 645.311 null]
+>> endobj
+5779 0 obj <<
+/D [5774 0 R /XYZ 90 617.313 null]
+>> endobj
+5780 0 obj <<
+/D [5774 0 R /XYZ 90 591.041 null]
+>> endobj
+5781 0 obj <<
+/D [5774 0 R /XYZ 90 561.317 null]
+>> endobj
+5782 0 obj <<
+/D [5774 0 R /XYZ 90 533.319 null]
+>> endobj
+5783 0 obj <<
+/D [5774 0 R /XYZ 90 505.322 null]
+>> endobj
+5784 0 obj <<
+/D [5774 0 R /XYZ 90 477.324 null]
+>> endobj
+5785 0 obj <<
+/D [5774 0 R /XYZ 90 449.326 null]
+>> endobj
+5786 0 obj <<
+/D [5774 0 R /XYZ 90 421.328 null]
+>> endobj
+5787 0 obj <<
+/D [5774 0 R /XYZ 90 259.421 null]
+>> endobj
+5788 0 obj <<
+/D [5774 0 R /XYZ 90 231.423 null]
+>> endobj
+5789 0 obj <<
+/D [5774 0 R /XYZ 90 203.425 null]
+>> endobj
+5790 0 obj <<
+/D [5774 0 R /XYZ 90 164.469 null]
+>> endobj
+5791 0 obj <<
+/D [5774 0 R /XYZ 90 136.471 null]
+>> endobj
+5792 0 obj <<
+/D [5774 0 R /XYZ 90 108.473 null]
+>> endobj
+5773 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F67 3022 0 R /F38 3411 0 R /F66 3165 0 R /F60 540 0 R /F24 537 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5837 0 obj <<
+/Length 1840      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�6~���Sf5CR%ŀ�[�t-�5����,Ѷ6]\]⸿~�"%�d[I��/-�����
�M5��
�z;8��
�E.�L��h.�l�E�_��iH0�T���Z'x���]��x9�a�{�q��ˋ�7Y:�+�ܻY%O����M��
~�����I��e�տܾ�~;�: �ֈ��B�������������:ڢ��h&5�k7�?X���EcxM4�2
G�	A�H�>Sj՛7˴O#
D���B�Mp�Ok�YB���
�d�MC|��-\���EV�9��2�
+xO�8�Ң�X�<�/]Ss�uf
+�)E̤ڈ0�
��?yTr��2T�/	ȵZe��a.Ы�r�]1J�	~*��r���Jsݰ�|.OK��25-�H��Y#�:ȴ�-?clt1f"��fR9��X�Y-khCI[v
�!��0 �`�Xv�Gi�ϨO5 �
^�=�%R�P�sL��Y;��I\DIK�v׀�y-
#�Ҫ�(�v��1�4Ӳ9��2S䘽ξ���z���
;�9
���&c����,�� ;��� ��d?��a/�fF��\7�a�tZ�@�4cڦ���d�iF�c�	�|��\rV���Ҁ�*
n��z#?9S�B������짡d���0 ���>@F���l��
�Kj-����<^��72��_e��E�v������>@��&�s�*xQL��U� ¬�d��E'i<�^9��"���:�
��m[
+9�
�t]`)�I�/�"�ƽr9��WɄU����F�7^�\�L�V!���d`��'�
 �
E*�I��t��P2�>A5�j�ԫ����>L�$Q
R#q{�E˂ ,.�غ��ݗ<O#?޲����읊?
L
���^���C��h�Q������V�ǿV~
��w�'�0�>b�|+��h���E6�E-�m���(N%�y�~��h�$ew������P�]?�m>;H�-�R��,�yg�n!ү��U����"*g]��m�vˮZ
N���B�o
��z�0�4*�<ө5\
�s^1��.-x���� ��z��
+��0,��4&i+j�K���>E�i�3
��e�Zs{�8J�V�$����7tu�t%�ŋ�/����>2)�t��7Ѯm�C�|&�[,��H�+�Y��Xv�ö��U�PI�F�K�cIU��
'��dXt,w�v�A۴��V�R�"�l��z+;Ocj��:x���#
�-�l�eX�9�����^�g�`|ļ/F�I��[������N%�Pa��������
'�7��ߑW��9N�>=mj=��*il2��j�˲7�B���3�ʠvm})�sTHV�
+�Q��˺m��owb�{v.j�8�r������^�
I(�u�[m�$����\v�� ~k���q�a26٩&�&C<jI�f�I�C��0�md�LpE��u5��a�����L0��Ҡ�A�
!�@$�c'������<��O���~�W�.�a�(���n ����U9���
��9W��gmGF�^��-l�sh����a�]�������&�����$�?����S���0�o<�L=�������X�
QK����Y/�J~qԵz-E}��q�@m���7��u.���Pק]/�{$pp�Bx?��2��
��p��yzoy������Od��A��ꦫ��A�%�����2nM�*Q��NE��0h�����ީ�m}s;�v�5�F���m����{9����O�*F���O���^[6n�*�D�9w�����
o��d�?��!���8b��\�_���_����i��)
+�d7���Z���L�kI�����2�/�P��.-Lc��(�+�C9L����c�P�8�J
�
������ ZKp
+endstream
+endobj
+5836 0 obj <<
+/Type /Page
+/Contents 5837 0 R
+/Resources 5835 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5677 0 R
+/Annots [ 5770 0 R 5771 0 R 5798 0 R 5799 0 R 5800 0 R 5801 0 R 5802 0 R 5803 0 R 5804 0 R 5805 0 R 5806 0 R 5807 0 R 5808 0 R 5809 0 R 5810 0 R 5811 0 R 5812 0 R 5813 0 R 5814 0 R 5815 0 R 5816 0 R 5817 0 R 5818 0 R 5819 0 R 5820 0 R 5821 0 R 5822 0 R 5823 0 R 5824 0 R 5825 0 R 5826 0 R 5827 0 R 5828 0 R 5834 0 R ]
+>> endobj
+5770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 707.957 181.845 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) >>
+>> endobj
+5771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 676.687 154.727 687.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ad05bc9046303661aa532423ac5a5c16d) >>
+>> endobj
+5798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 645.791 176.505 656.322]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aea6d543c90be52299d6ffc57fc9ba5d1) >>
+>> endobj
+5799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 629.11 450.955 639.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) >>
+>> endobj
+5800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 603.189 191.718 614.093]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+5801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 603.189 288.852 614.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a77c72d8473dc3e9856d7ff6c05ce7b07) >>
+>> endobj
+5802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 571.92 191.718 582.824]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+5803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 571.92 303.079 582.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) >>
+>> endobj
+5804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 540.65 179.554 551.554]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 540.65 242.925 551.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a548ae200545f7d25b875f190b5611368) >>
+>> endobj
+5806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 509.38 179.554 520.284]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 509.38 285.516 520.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aec5860620ae92988c1740dc393064fe7) >>
+>> endobj
+5808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 478.111 169.013 489.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_ad7c61256a3d02a8f345701bf5eabdf6b) >>
+>> endobj
+5809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 478.111 257.282 489.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 446.841 291.722 457.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a87998e7258a2c529be20f456ded30c90) >>
+>> endobj
+5811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.538 446.841 361.181 457.745]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 404.612 246.034 415.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a6605130131af1ca6e54f8ce1e71a993b) >>
+>> endobj
+5813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.522 404.612 360.71 415.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 373.343 233.76 384.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a32012e3b09434b858367d216108e42c6) >>
+>> endobj
+5815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.575 373.343 272.763 384.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.205 373.343 323.393 384.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+5817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 342.073 220.778 352.977]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a20b0080e4a1abdb68ce945191c540b2e) >>
+>> endobj
+5818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.594 342.073 290.237 352.977]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 264.34 203.075 275.244]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+5820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 264.34 296.324 275.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a21f1586e66349acf7aa0d70c77f92b60) >>
+>> endobj
+5821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 248.032 352.207 257.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 233.444 194.297 243.974]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a6e742d7ffa4f4b7037760cf3ebf62348) >>
+>> endobj
+5823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 202.174 188.759 212.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_af97f2d43a487ec81e040aec36bbc6ebe) >>
+>> endobj
+5824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 170.531 245.406 181.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.145 170.531 325.654 181.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a11de7a0cc309058d6aee273d613c9432) >>
+>> endobj
+5826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.844 154.223 367.996 164.128]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) >>
+>> endobj
+5827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 92.798 237.376 103.702]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa83361b2264ca8ed30599dca32447874) >>
+>> endobj
+5828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.713 92.798 329.778 103.702]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+5834 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5838 0 obj <<
+/D [5836 0 R /XYZ 89 770.89 null]
+>> endobj
+5839 0 obj <<
+/D [5836 0 R /XYZ 90 721.073 null]
+>> endobj
+5840 0 obj <<
+/D [5836 0 R /XYZ 90 695.634 null]
+>> endobj
+5841 0 obj <<
+/D [5836 0 R /XYZ 90 664.365 null]
+>> endobj
+5842 0 obj <<
+/D [5836 0 R /XYZ 90 622.136 null]
+>> endobj
+5843 0 obj <<
+/D [5836 0 R /XYZ 90 590.866 null]
+>> endobj
+5844 0 obj <<
+/D [5836 0 R /XYZ 90 559.597 null]
+>> endobj
+5845 0 obj <<
+/D [5836 0 R /XYZ 90 528.327 null]
+>> endobj
+5846 0 obj <<
+/D [5836 0 R /XYZ 90 497.057 null]
+>> endobj
+5847 0 obj <<
+/D [5836 0 R /XYZ 90 392.29 null]
+>> endobj
+5848 0 obj <<
+/D [5836 0 R /XYZ 90 284.936 null]
+>> endobj
+5849 0 obj <<
+/D [5836 0 R /XYZ 90 284.936 null]
+>> endobj
+5850 0 obj <<
+/D [5836 0 R /XYZ 90 252.017 null]
+>> endobj
+5851 0 obj <<
+/D [5836 0 R /XYZ 90 221.819 null]
+>> endobj
+5852 0 obj <<
+/D [5836 0 R /XYZ 90 190.549 null]
+>> endobj
+5853 0 obj <<
+/D [5836 0 R /XYZ 90 113.479 null]
+>> endobj
+5854 0 obj <<
+/D [5836 0 R /XYZ 90 113.479 null]
+>> endobj
+5835 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5871 0 obj <<
+/Length 2063      
+/Filter /FlateDecode
+>>
+stream
+x��YY��4~�_�`����𹐇��J� �U$�kg
|L|dw��t��1��n��@̓e��j������֡�W'_���>
����s~�D�	܈x>�%���������C�"f��G߽8�����<9?yw�`�:L+�H:������I���C��B�J	��<3���'��B	���cY�,c�0�-x)����r�y�x��&-�Z�c5�>��@uV�%��7ԣ/�F��.�˸�-Y�θ2��4���ײ��
�(Ul���|�P-Q��7�{c��+��ź,3ӏ��Ɠ/��T�d7e����|
ōl���f%��b[�����^��F�s�>���7��)�O��8Fȍn���쬬�Jƹ��ӻy	�N��a�0*��F�_�', QYY��)���Ͷ�x�70r�
�]4p�ą0^1��ɇ��fך(EO,��P�`�-�M��
"���t(�
ԧ��;���
�gw,Z�ξ{����D�K/� � }W�'�5� ����Qp�c��if���7U�C|� L~�����X����VѬ�* >7�<,�+!��\���ƴ/� ]76Y\�ǽ&��xm�ǡ\Zk��~X���L�
L"��f7/o�&���` [...]
+�Q�W�
C�8w�)%`��#��=+�mH�z�q�˺
�ͧ�
N�ͭ�o � �4^�LE��7d�0 n�Yj��"��f�C+ɜ��A`e��*9�����̲
��ώ�,�( ��t��bӟB�V��l{����_)"��6��ԃ9Q�?�:�#':AÐ�
Pkb��>2�Lj|\iX-�P��s�[t2�@O��	�M���Ýp�vT��we�t��eqa�Q1����J�.��y
>؇p1�\{�/M�
-P�A|fP�τ�
a�H���CDxa�B����rb8@62�K42b�\����~
�����I3���L!�o(,rU��i�TH�}���� �!V(�Z�E	���Rw�������*?��X����̭��U
Z���͈cq�Њ�FhV-1�0�Eo�	Q�pD	#fÎ�x�2�8
���|XFa��)�1��RLPM�f�� �!
/@
+��{�!�#1�˽I�d��3�y
;:�
`8�4-�z�Q��k����a$���Ў<�ͨP��	G�C��l����u]Uu��p��B������
�I�i�/�����1�A`�
�
��aA�n���
(
�\�k(�k�
��pp��
,��pi���*6�ɮ�>s�W���$n;:��AP�}�� �*�ڮ�2�2I>$]��.���U�%����E`9G��������9�|�e�� � �z���t�s<�v>�eJ������
�R89���R����M@�A���
+L����rS���i �>	\��(�>��i���H��ĸV�o
�c��u���B�>�A��)O*
n>�hT�)��J*t�
���o:��]a����	:��
+��4�	{K��W?�m\�rV��t	U4����a��X�v7-��{
o��P[Y����ף=�T`>�ha�{6q�k��*�T���jE�ɕp|+
	���>D��Q=k>�vљ��M�Ǚ,��w]��n�C�<�	W)^u{�aq���4�;�}��
�W�צa�[�a`~�n�B%>�����<��K� :D�������ae���O,�$��s��dI/t���j
!�ܮk#�\Ԕ��,��Mg�~����g����J
�ɽ
s�YYZȸ��V&_CGbe���3>'(w�cf0�w^���y8 at Y�*8�
�j��1
��r�<.AY�n�V�B�GT�y��
q#n
_������@᳥w
��m\��	���1V�
�el��$}�\���'m���_k
�@B���_�M�;;=]��Z[�0���O�"�Ď:/�g����z
:�XYL�O~B��
+endstream
+endobj
+5870 0 obj <<
+/Type /Page
+/Contents 5871 0 R
+/Resources 5869 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5677 0 R
+/Annots [ 5829 0 R 5830 0 R 5831 0 R 5832 0 R 5833 0 R 5858 0 R 5859 0 R 5860 0 R 5861 0 R 5862 0 R 5863 0 R 5864 0 R 5865 0 R 5866 0 R 5867 0 R 5868 0 R ]
+>> endobj
+5829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 658.702 180.54 669.606]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aedf8e546cc63ff0ade5d34cb995beb09) >>
+>> endobj
+5830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 658.702 292.33 669.606]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.063 658.702 418.515 669.606]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 645.922 226.034 656.826]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_a339fab488002bb5b341e1bb82edee103) >>
+>> endobj
+5833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 645.922 405.628 656.826]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 618.371 156.281 629.275]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aaf3b18ae83d99811dad22d336a1a117f) >>
+>> endobj
+5859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 618.371 244.549 629.275]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.761 618.371 347.214 629.275]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 605.592 156.281 616.496]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aaf3b18ae83d99811dad22d336a1a117f) >>
+>> endobj
+5862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 605.592 244.549 616.496]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.761 605.592 347.214 616.496]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.91 531.578 266.363 542.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [111.184 519.623 161.316 530.527]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+5866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 386.774 179.843 393.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) >>
+>> endobj
+5867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 180.488 179.843 187.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) >>
+>> endobj
+5868 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5872 0 obj <<
+/D [5870 0 R /XYZ 89 770.89 null]
+>> endobj
+5873 0 obj <<
+/D [5870 0 R /XYZ 90 704.286 null]
+>> endobj
+5874 0 obj <<
+/D [5870 0 R /XYZ 90 592.173 null]
+>> endobj
+5869 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F75 562 0 R /F32 772 0 R /F7 803 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5882 0 obj <<
+/Length 2369      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�PU#r�Lfk�ɮ�qN�)��(���!��x�6�"(J�,NU.Qt���h|��!
-#
�������
2���v
)n���m
}�	F�N�c
_O��b��]O(�7���t^$w�d�ER<]]��ɗ�6�g�݇��Jד)8�q���{�Ii1!:�B�����Đɧ۟/~���|A�.
g�@JG����O8���#�����Zh
q��s}���{��^a�wА��� B:���Cp�����`/��w��m�~��m�i^%U��k㇧�WS��&�
�6���� 1i"�%�~,
+m�8�{L$EL�Z�����	���Bb���PL�z
(Z�f2�q�9v�(>F �6�+����L��15�	L	� 9dd3�X�ɔ+�l.Z[z;T2���9�.c�,���l\#a���9	BtGD#�Z�ٛ���Lb����m�N�&}t���n��v)�f�Q�7�~��Q
+K��y�H��j �@C� ��W"��
+�����*���Uߣ ��E[�`�Ȑ3�x#�1�WY�~Z�4%��U
	N[M�_��l�U�ȹ|'q�^#	��Fk7��b�P�oSi�$e�at�
mt ̙�q����R���$����p�ގ��b�9)!I�R�{�tB:��@L;2?
�i�O��x����?�����V�~ �	��|�J+����i+� 8 �o���
GF���םjʉF�Y� �x��������
�f,ƻ�ĝ	�G�X��
���#)���\����f���e���'r���>�X!
'�1.R�&=�Gvj��ND�����У؈#�Z���Ҏ먬���Ho�i��hq�
���j ;�UV�,�p
IV��� S��Un�-��٨��Ӿ��qD�:�j��`
+����fBE�5w
8�b )�1(ְ�t#�y>�o*��x���-D�zr�v����T0�6_҃ynU��*O�;g�|�>@���!e�/��v�b
�
�rg����&�J�ǰó���SX�64�}�8� +
m����%��� ���Lz�h
��p�
�
�'�%��e9�gI_�]�M�`
�!��O1��hq���Tr�'��(�@
2����M�
�=;�{�-��p��S��i��^�͞b�������tfx���h���V�Z�!�t�˄���R5ӕ�:uB7a��܃���J����1�FIR��Y�������yVV at 2�Y��ܯ��D7���7e����S�XȉB�0[V@�.(2������w���{rv���}�/t7�ܚn�B��oĉ��,֖�P������z'�`lD��:4��� �%%
���� p��v퉌+�:
+1;� �u����7��p���zG��C�d?|S�YM���" �`$�ia�m�R�[�MH��5
�0���ι�!+�!�<
�B��n= ����k
P��D?�!�� ��
��H��.t���G��-�c2���g e]�5
٣r:O�5HY܆�P��$�= ��w�-D�
w
+
+�]��
��7�]��Sý�V��ҹ��E��x��1��G�xj%,��a"5PH��?
�<fK
n��B{��Zi0�EX�����@)�3�$,�3l;,bB;��{,
h�
+��x (qs U#fˡ
.
��}��t�4[�w����P�x�`�	`��G�iXJ�檏�R
�K���<�R�R7�QH�
0�TDT#���@J le;W����[������	�hmk��j��w
~�c?
Trp�5u�/W@��$�uT�|�t������g��Ʀba̹T�hU�b�4��B�a��?
�	L8	����X���Аa����YB
�X�~�m`�	E����}&x�&EqD�!�"� P���(@�I@�`�сo5��i��N���ٻs�ݮ�P����]HV_�i�&M|�e��|�ڸg��
�C���n�p5|Q
g=����J��`�����Xx�{��[ɏ��N�r��
:�e���0MGm�~��e�m���y��Qy�e���j�G�����2���+/3O��e�/]�tU����+/1^���
*�q���st>{�A,c=�_ˢ��5�
+
;�E�`BâNfQ#Ұ���1Y��7
+Og�)�=�D
bS�6Y��^	,����D�w�
�L�`?
)i��5�W�5k���	�e/�)gsi��
ϸ��E������=��t/C~M�ms~���na���c,z,Rm�M�
r�C�\#9��5O�r�
ۙC��o�
������~�,�|�f���F��b�}���M�Ң]��
�=Q�B��	����
K��R���>��l����,z�� ��[��UtX
+endstream
+endobj
+5881 0 obj <<
+/Type /Page
+/Contents 5882 0 R
+/Resources 5880 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5878 0 R 5879 0 R ]
+>> endobj
+5878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.531 481.29 227.984 510.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+5879 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5883 0 obj <<
+/D [5881 0 R /XYZ 89 770.89 null]
+>> endobj
+5884 0 obj <<
+/D [5881 0 R /XYZ 90 721.073 null]
+>> endobj
+5728 0 obj <<
+/D [5881 0 R /XYZ 90 704.201 null]
+>> endobj
+5885 0 obj <<
+/D [5881 0 R /XYZ 90 704.201 null]
+>> endobj
+5886 0 obj <<
+/D [5881 0 R /XYZ 90 619.233 null]
+>> endobj
+5793 0 obj <<
+/D [5881 0 R /XYZ 90 584.564 null]
+>> endobj
+5887 0 obj <<
+/D [5881 0 R /XYZ 90 580.08 null]
+>> endobj
+5888 0 obj <<
+/D [5881 0 R /XYZ 90 455.761 null]
+>> endobj
+5794 0 obj <<
+/D [5881 0 R /XYZ 90 433.384 null]
+>> endobj
+5889 0 obj <<
+/D [5881 0 R /XYZ 90 433.384 null]
+>> endobj
+5795 0 obj <<
+/D [5881 0 R /XYZ 349.813 364.257 null]
+>> endobj
+5890 0 obj <<
+/D [5881 0 R /XYZ 90 357.617 null]
+>> endobj
+5796 0 obj <<
+/D [5881 0 R /XYZ 219.882 278.507 null]
+>> endobj
+5891 0 obj <<
+/D [5881 0 R /XYZ 90 271.867 null]
+>> endobj
+5892 0 obj <<
+/D [5881 0 R /XYZ 90 183.537 null]
+>> endobj
+5797 0 obj <<
+/D [5881 0 R /XYZ 90 145.966 null]
+>> endobj
+5893 0 obj <<
+/D [5881 0 R /XYZ 90 141.483 null]
+>> endobj
+5855 0 obj <<
+/D [5881 0 R /XYZ 285.395 84.126 null]
+>> endobj
+5894 0 obj <<
+/D [5881 0 R /XYZ 90 77.486 null]
+>> endobj
+5880 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F7 803 0 R /F8 802 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5899 0 obj <<
+/Length 2879      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs��~ׯ`�!!+�x�C�M��pj7��+Ƀ��HHb�$� iY���9p
0�H��SJ"�Aw�tO�� #*F�#l���۟��۫��/d$������#�
�棷cb����O#&5"F�[��w�~��ᗫ7���W�]x�G�
H��lu��

���O��=�w�V#N�_��\��G�9�
�YD"$)bHL�c<�0�|\,�)�l��^e�*F�F�+'�as�<��6��C��LFv��0:.�B�w��LX@)A��J2FD���.�r2������m��׳|h�q��a�q�";�<T�|uy��'j<O�a|��2�H�n��&�*��:�R�C�J�	��:��J(7ޖ�P�1AFĎ�։U�D!���dN1�2vr��R��9C��G+�H�x���|]-�u���X`kD/�M����hJ�j�/��>lr�!��46	�fx��;�!I�1���E���w
!
&a�h
+9�`��z1��Jt%s�0��$R�L,
*�	6�L�:zb9F��b�޹ SG+nul���.
Xe�r��\=^��[d����޸l>���^�jx$/��:�a��
�����9k3ܔ
+<�\�A�;bl�yrjs��d����Ïl�o��n�*����D���h��1R2�� HJԁɄ��+�ތ$`�:({��R���]�dv{q)�2����E$���fG�DJd���
a�ޭ����wq���k��6�緉�%&�������]�_B\<^�m���-4�.�զ�`Y�,�����"y���'�(��O8� �!Ҽ�&\�w�[|�\	�=΃
�Μ~��BD�6�c���'���Y"�Z�m�옐C5R���	9��e͈�څTwv]䂽Oq�pB'�Ve9����N��
U��f� �[i��.�ޫ�������
)��&9K"�T��C�C������
H0��`����
n��z�3j
+\���
+i!;A����ߺ�0Q͇�cbP"C�X4�d�3pഝ��]^�6
����o�a��3��;
+$�ފB
qAN��{j�)�P!H[v0��Zz��tps��Fn�r5\`HZ�� �, �:�w�c�-&�����P<4E�
+(�ky���5:�F
����"�_n����2`�M�#�ؒuW
:dͳ岘e[�N"i���W6�X-��

*�H�^�]�
�m �cm[G k�\jۀ�ֶ�(�'�
g�0��� �g�I�	��
��Ɓ0<6��
lr�<���6e���i�
F�o��m�Gl1T��
J9,� j
i��G�o*�4�
+4�*?=Tm痗�ٶ(SEE�4���W����������l����Y��s�
G�~����i1���f�Z��e|�-�
c�
+h�Ra�t��	��%��� ��4_�ZrcCP��r?�DG-��P����9��R!	�
+�qb�a�c�1j�iv$�e׎6�x�3�M�Z �mʼ��ۀ����t���>y
�b�q�� &�7�e
�"PO@����ޝ��ʇ9�<4�
+.��:�f���e��o��Q
��˸?�@�T朁�T�IʁR2��°�Fum��C�'�Ae�2�8Rp)��i|��8NB�j��Q�뤖�{��{�إ��p�j�̟��aW���
+X��Lݤ�	�J�MSe���S =#:�퀵S�^�A�w���"�N�E�s �Π?A9)UJ����$~��٭g{���������h�n������n��q���H5'�~�v�A��k�[ӂBT<i^珩����{��a��2��T�a�p�)��8����c	��O�`�(Ί�����$��0�r0	+�p���3°AX�ؐ��Uy�U at Ak΢[h����=܋ij{��Ъ�;Ҟ�}
�9SP�RvZF��%N0F&I
�k������	
+���O%��j"��le�C�Ckk)�� gѫ!���^X�O�ȓ�xb�J Z�T�&��I]����)M�d���HC:���{'�}3�rR���P`��G
<F
+[=�ُ7	m�X
�
֗��n�.�锛��:�
]T�c�+K�=Q��l��x�w^(�+ԶOg�Pz��2����S
���ix�*l�{
����i��Z�wJV�ˢ�
�3�^C��.�� //K�~n%S=~����?�e� �x�[�B�
W��
���{�U
y\��>�E$�5��T�T�|c�i�ڡ�m��[2� !�l��OΉ�k,�>���
�Zy�ڔ�О���6��g5�!!� ���&�K�Bš����~wB��s���H��i�k�A�M^Y�*��Ӎ�S%#���~��)/��N�����>�^I`�J4�W{��89��my{���y�ϲ�9����Љ���� �W�u��
X�j���¹N�?!B>�q"�w�����<I�l�-�W�S�=O\�@A ��*�R0�m�pP@�8_m�i�R�ǯ 3����1xJ���r7���1������R
��vx}��]�
��Լ�D����lÄ5���r��o���Ao�2�^��aܭ�MV�
� Ȟ50N{]����
+͍����TF`�3%@��}
�m�՞��@eKO�cD��;�u��� v2���6�±���k��AOI�̖�����7e��=�E<�ϼ�oT�˫yTzէ�u�_�,ϖY~��ӣ,\���̚��MY�G��P*7�϶�]旑�@ g�ި����R�z;H����%2G=n�ݟ
#v���ֵB�8~���D�h���o��~'�x�㊍�/@X+n
+�����>R�	�
���~z��g��U^���dp�߲�.[�++p8��wD6e�mD���<
���Ә��
p
���6,������׻�*_ߢY��^��1�c��nV��&���bÅ^
+���ǧ~~
+endstream
+endobj
+5898 0 obj <<
+/Type /Page
+/Contents 5899 0 R
+/Resources 5897 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5896 0 R ]
+>> endobj
+5896 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5900 0 obj <<
+/D [5898 0 R /XYZ 89 770.89 null]
+>> endobj
+5901 0 obj <<
+/D [5898 0 R /XYZ 90 646.048 null]
+>> endobj
+5856 0 obj <<
+/D [5898 0 R /XYZ 472.92 580.356 null]
+>> endobj
+5902 0 obj <<
+/D [5898 0 R /XYZ 90 572.386 null]
+>> endobj
+5903 0 obj <<
+/D [5898 0 R /XYZ 90 505.142 null]
+>> endobj
+5857 0 obj <<
+/D [5898 0 R /XYZ 439.235 428.372 null]
+>> endobj
+5904 0 obj <<
+/D [5898 0 R /XYZ 90 421.398 null]
+>> endobj
+5905 0 obj <<
+/D [5898 0 R /XYZ 90 325.047 null]
+>> endobj
+5875 0 obj <<
+/D [5898 0 R /XYZ 90 302.501 null]
+>> endobj
+5906 0 obj <<
+/D [5898 0 R /XYZ 90 302.501 null]
+>> endobj
+5876 0 obj <<
+/D [5898 0 R /XYZ 90 267.526 null]
+>> endobj
+5907 0 obj <<
+/D [5898 0 R /XYZ 90 267.526 null]
+>> endobj
+5877 0 obj <<
+/D [5898 0 R /XYZ 121.143 187.356 null]
+>> endobj
+5908 0 obj <<
+/D [5898 0 R /XYZ 90 180.716 null]
+>> endobj
+5909 0 obj <<
+/D [5898 0 R /XYZ 90 158.668 null]
+>> endobj
+1747 0 obj <<
+/D [5898 0 R /XYZ 90 84.558 null]
+>> endobj
+226 0 obj <<
+/D [5898 0 R /XYZ 90 77.486 null]
+>> endobj
+5897 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F1 834 0 R /F7 803 0 R /F10 773 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5917 0 obj <<
+/Length 2551      
+/Filter /FlateDecode
+>>
+stream
+x��Y�o�F��=��� ��s��\��R�M�OI���"*�
+E%���7�j��d��Ar����͈�E���W_������RD%)s�GwQI#��$�ᫎ>�
v�d�(��m�h\����m�iܭ+U�����}_�������߫v�v�?�z�
��M~����-c�!<+HYH`A��7�$�C�[�oثd�3��3�#gn�ߟ������
�����l�ՠ������1^#a��bV
+�y�ϻ�/Wx��TFd-7W�Q
�?��EYD��M�r�u����W4Ѐ�|�"�H�e܉
>�j3�穖�),�IQz���%nɴ�
?3
���Tf���ꄱب��N
B_��9؞ρ1�dQġ��2"X
+��^��
+�8��4���T��Omz"_Fx�4+�ѦCr�LJF}��5j&K0�85��)D
^���i�`��ia��^;��E��9�
h!r���
�[qܭ�FˣGm�.aY����
Vֵ�Q|�s��UW�����,�c�m��N3Qw��i����c�­$�A&���4�r���L���`
���Ӓ [�ݮ�j5y2R���J���֙'�R��	���y����>��Y�y��6��7�o����.P�%1Б(@G���O�g���)��u�?\E

���>ь�?;�R�F�s�1�gN�^2�vf
_=T�����6�p �C.Z�HN��e���>_u�jj;7skk�x���6չ�a���j/��gdq��.�C�^\�}"d|t
궘���Ba��4n�S�:���M�v��[R�;�e_���1'ɸ�HѨ�L޻E��ZY�9x욀�>G!"��>�
D
+\}���M�h��Vٗ�4��e�m�0�vg���
+�w��ޝ���[?�D�E����`�Gy��o�H���f���ꮌZ���|U��7f��f�2*R�/`ܧ�
�#��@������
+j�Vp�1��O�
"�����9��`)J�&Vf
*"��7j��5j�%����	��!�b?�
.S΄w@	�8M�g��pت�ڠu \3�^&�s��
@Fq��Ϝ�}��\�y
�R�gQ�X`�H���'��C�eN(�,$��3ᡀ,)y�,Q	�3`���0�K^�')���N.�<`����%x�2�x��

�39�
g�
+8 >�?�nS�vw�$͞��]��){�Йg��j�f��l@?��ou��a�z}0�O�#�3�o���'ԉN��L�I;�%�C��m6Ϳ�y��O�8�'L\Yxef0��%%�����,~��A]<�q<M�fq3�w�Ņ�1+��
ɷy�'�*��pqld�.m�� ���t
sx��M�׻��M��Hĭ��,���Cp6C܉G�
!�a���jsҘ�DU�:p�™��nB��NW[p�m�F�Oѵf��	�H
R�
ꤌ߫a����&,@Lܻ��
���+'
վ����|F��8!��G�X�^��T�4�	�|, r�3.�km
+�~��:��!�Lu��z:���C�e`>�����ul�h��n�4<�K��QկC�1�S�؊�]M�G�Q-����{��}(�oͰ���e׃�|�Q�ֈ-�g�,/_Y��f�]��
�EfY-r�*<
�0�S����3�$� �AΑ���8�~�
`i��}R�s{X�
�6�	���#u�g�o�#��jj�Ϻ�K*���pH�h�j��
�h�nB�����2mp��0F�����ĨS=&X��E�E�
���2�2��-r�k2X�-�@j���і���/�j���x
+W3�Z����
jl���ř�0ÊJ���50���E<m[�NrIDʟ��N�}Jhz��!���f/���pɭ��Ϭnn��8="���,
Be
q
+� `��Lg$%
:�-mdXKB��r�N��ݳ��t�p:*�/3��u��	�_ ����W�9j���X?O��)�f��Lf�xg��:9�4u`����

��əm������y���
v	dZP����:��l��|߻u#h2�9x�.���>�a?�Y�&��8`�1
�s����
+�����v���)aZ)����x�(��
&\?ǒ��'��c/g���{8^���#����=~8,-��a!��������05�yWk�qx�9��/d��b������ut&��p�#;Ö��fp�L#<%B���\:�B@� ���rBE���ƶ�u
���(��Yd;�z�Plg&=�����
 ��/����K��ӻn�U�Hs��qp{��v����%	��t���Ff3u�^
��,V���ku"!tv�o
�p pJ���t&(Ue�������y�w6q��$���`�T:㕣<􇱸���-�2~ךy[���eeI�	���0
+
]Bƛ�n0
�^����#���:T��u�ۂH]3cvi�?��H.����N��,��(�H%��b����}o^~ݩ��I�|�T�{�
�M�?�	#
*�s�E��(��0��
��]i�>��$%i�9�]
�����~���#K8M�]JH�#�k�cIش(P�$�
N�şz���
 Lʤ����w=�6ځ�w��@�?����U%
+endstream
+endobj
+5916 0 obj <<
+/Type /Page
+/Contents 5917 0 R
+/Resources 5915 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5910 0 R 5911 0 R 5912 0 R 5913 0 R 5914 0 R ]
+>> endobj
+5910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 595.222 213.855 606.126]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction_a7a41076eb4ff956a7cd86f87dad1e470) >>
+>> endobj
+5911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 566.385 197.875 577.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction_aa687f39208cd480b29e7e6d09662441a) >>
+>> endobj
+5912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 515.629 221.603 526.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruences__Reduction_ac4c3a18e15580a4213589aa55790f60f) >>
+>> endobj
+5913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.021 400.214 392.442 411.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+5914 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5918 0 obj <<
+/D [5916 0 R /XYZ 89 770.89 null]
+>> endobj
+5919 0 obj <<
+/D [5916 0 R /XYZ 90 614.687 null]
+>> endobj
+5920 0 obj <<
+/D [5916 0 R /XYZ 90 614.687 null]
+>> endobj
+5921 0 obj <<
+/D [5916 0 R /XYZ 90 533.36 null]
+>> endobj
+5922 0 obj <<
+/D [5916 0 R /XYZ 90 487.63 null]
+>> endobj
+5923 0 obj <<
+/D [5916 0 R /XYZ 90 436.454 null]
+>> endobj
+5924 0 obj <<
+/D [5916 0 R /XYZ 90 252.335 null]
+>> endobj
+5925 0 obj <<
+/D [5916 0 R /XYZ 90 229.747 null]
+>> endobj
+5926 0 obj <<
+/D [5916 0 R /XYZ 90 229.747 null]
+>> endobj
+5915 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F22 2982 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5956 0 obj <<
+/Length 1570      
+/Filter /FlateDecode
+>>
+stream
+x��Yْ�F}�W(�*��rO/�ENHU�V�L�y���G���$3����E��bƆ��Һ:}�ݺ��I����?���'��A
D8�a����Q�M����<`B!	x�^~��������^�q���E��3��T�p�z�#��<��E*���fAH�O�׭�[�c������y�i T�8
$a(
+
��
�q
�t��!���ڰ��
�w�MsocfX!`f���2��ͯj4�	�1�gFq�fֱ
6�&!�N �G��="��]LA��0n�ET����ӥ
��Y���.��(��I��T�tZ��-'�#��טd���rr��_T�''��$�Ly���q0���
+���ˍ��VWAJ���rS���k�#N�#��+�
�Z\&��q��L
+w4�ƅ?��܎��D�:�K=�O�٬zTWƦӬCy�*I'��[��T�V�<H�BP�
��ԃ|K)_
���1��|�./���b`k�S��Yw+��#"���08�t	K�����JH�@J��G!�4�'C\�Z���5p�Q(�����/{����)xחz�o�@����@�p,�V�@x�
��V��^����"BB��@�
dRk,@���lБm�^o��E���AS����B+0����u|������+=h:��P���Z��g;�]
+C���r
��Y:�v����Yvu�X
+�ؤ9�ڄLZ�2�t\$����b��@
#�ZC� �!$'ُI:�.Fڍ$��3$�P�+���d�0�,�q����ۮxmpI
+�� \}ڿXX�H�N�s=h/ӓE:4ik{��QS|�'�Z�]	f��M�;�ߗ��J{���;�+���p����]��r
�K��i�y_��C?]�)�p�
s���`�"��G��W��~i��6ۼ�tD3k�̬;
\
f��t1�����1)�nh<T�d��p�[�0
+
@�a�ܿ�K�㗒'�e(2a����t讙b�]0c}�{Rv�.vF���9�U �-
o)�;�.Gz��I�
^����.v��{3=&��3�}�Rq��áw��-��%��Ue&
���RV�9uCV�nZR���Hl��/
+� �ߍ�����
+3��ׇC�!��evry,����zC5�os^�r��^�8�"�$F����O7�߈��:�o-�{Q䭉�
_U�\���?/��mn�)�(��PP+�>ܰ|�t9�wq_�WW�m�E~�iKuc�����"��ݱӣ{>�
��ïZ���nk�X�QɵE�&�jYt4�
a��;^jb���q_m�A5�6�{�Y6=�$?x�},��J7��:g��SH��`\�S!��=�[����2$E�ˮ��ҁ��p��/���T���p��wO��[Y
DI���e���Ϗt'S�wN��<��m�=�c����c
q�;��HRv��ƃ�D<���?��H[���8�7�g���g3<����\�u��O"�.[��N���~��x��)t���Su
��xک�㓡D�E���y���w��^�p�>���lٍ�&hrBU��,�y��l��:��a6�t�Ƣ.BX֎]ře��6
���~���}�\
+endstream
+endobj
+5955 0 obj <<
+/Type /Page
+/Contents 5956 0 R
+/Resources 5954 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5927 0 R 5928 0 R 5929 0 R 5930 0 R 5931 0 R 5932 0 R 5933 0 R 5934 0 R 5935 0 R 5936 0 R 5937 0 R 5938 0 R 5939 0 R 5940 0 R 5941 0 R 5942 0 R 5943 0 R 5944 0 R 5945 0 R 5946 0 R 5947 0 R 5948 0 R 5949 0 R 5950 0 R 5951 0 R 5952 0 R 5953 0 R ]
+>> endobj
+5927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.667 492.548 216.973 503.452]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_add6624f4b11313bba2819951fb70ea2f) >>
+>> endobj
+5928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.31 492.548 301.086 503.452]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 463.788 170.687 474.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 463.788 227.852 474.691]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a2d2a836128949f204da12c2fd3aa4f1c) >>
+>> endobj
+5931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 435.027 170.687 445.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 435.027 223.05 445.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_ad9dae1bccc03e59bf39357297de71360) >>
+>> endobj
+5933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 406.266 170.687 417.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 406.266 217.61 417.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a83032ffb501255f28077473407e1df81) >>
+>> endobj
+5935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 377.506 170.687 388.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 377.506 212.808 388.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af6ff26a7d66d601d93e6548e8472c892) >>
+>> endobj
+5937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 348.745 170.687 359.649]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 348.745 227.852 359.649]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a9f126c32b4f43115c5f0211ef65b5eba) >>
+>> endobj
+5939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 319.985 170.687 330.889]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 319.985 225.351 330.889]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a3d8ac57c5e5aa2a5c2f5576d490c4f11) >>
+>> endobj
+5941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 291.224 170.687 302.128]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 291.224 211.991 302.128]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4699390a942c1aaeaccd2b89b67e5855) >>
+>> endobj
+5943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 262.464 170.687 273.368]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 262.464 209.491 273.368]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a73e4d633b9400d175d45eb4e16f694d3) >>
+>> endobj
+5945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 233.703 152.954 244.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.452 233.703 193.621 244.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af47168d758e7b40a1a458f985427ae28) >>
+>> endobj
+5947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 204.943 144.127 215.847]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+5948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.625 204.943 190.68 215.847]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a108e6a6005f1a43bf906d349b9c40ea1) >>
+>> endobj
+5949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 176.182 180.54 187.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a400322acab704cef7a052982929182ff) >>
+>> endobj
+5950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 176.182 264.653 187.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 147.421 178.239 158.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4734a40ed0f8923109e02efe4cedc4c2) >>
+>> endobj
+5952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 147.421 262.352 158.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+5953 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5957 0 obj <<
+/D [5955 0 R /XYZ 89 770.89 null]
+>> endobj
+5958 0 obj <<
+/D [5955 0 R /XYZ 90 720.814 null]
+>> endobj
+1794 0 obj <<
+/D [5955 0 R /XYZ 90 618.93 null]
+>> endobj
+230 0 obj <<
+/D [5955 0 R /XYZ 90 611.79 null]
+>> endobj
+5959 0 obj <<
+/D [5955 0 R /XYZ 90 511.974 null]
+>> endobj
+5960 0 obj <<
+/D [5955 0 R /XYZ 90 511.974 null]
+>> endobj
+5961 0 obj <<
+/D [5955 0 R /XYZ 90 481.48 null]
+>> endobj
+5962 0 obj <<
+/D [5955 0 R /XYZ 90 452.719 null]
+>> endobj
+5963 0 obj <<
+/D [5955 0 R /XYZ 90 423.959 null]
+>> endobj
+5964 0 obj <<
+/D [5955 0 R /XYZ 90 395.198 null]
+>> endobj
+5965 0 obj <<
+/D [5955 0 R /XYZ 90 366.438 null]
+>> endobj
+5966 0 obj <<
+/D [5955 0 R /XYZ 90 337.677 null]
+>> endobj
+5967 0 obj <<
+/D [5955 0 R /XYZ 90 308.916 null]
+>> endobj
+5968 0 obj <<
+/D [5955 0 R /XYZ 90 280.156 null]
+>> endobj
+5969 0 obj <<
+/D [5955 0 R /XYZ 90 251.395 null]
+>> endobj
+5970 0 obj <<
+/D [5955 0 R /XYZ 90 222.635 null]
+>> endobj
+5971 0 obj <<
+/D [5955 0 R /XYZ 90 117.821 null]
+>> endobj
+5954 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+5994 0 obj <<
+/Length 1845      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��D~ϯ0B*�Jf��E	(�
+�X��T+o�l,{q������
��{I� Ti��g�9���qqp����۳��3����"8[2ֈ
��ކ#ʣ)����aRn��ӈ�X߬�E����.ʤ��͞����y��eR����m�nf�y�o���єr
~�N�[{�:]�eDT����"<��ѻ�&ߟM~���b�q$U0�L޾���0bZ��I� �
������	v�4{0���6�Ioӄ Bv{�u�~�n.R�����u>��"�����M�WI=d�/CS�b��GĭpQk��(h�Ƶ���'R!M�@(�i�"�t���n�"HVK����4��!����qŎ������>�E�T��I�^�� � �
c}ɑҺ��A
�
׭�A0&��(ӈ(D$�Yqe�<���+�8��"[`��%�W����^������pD�
 ��ܾ���$�l7U!"t#�fD�FX�f@%6B�Pyw�
QŚ�o�|���;/�N�	��E�2 ������L�v����"��f#0b�P��j [...]
<

V
+'��
���"�a�wu��K�`u��@JJ��i����w�@�DX>���Aݒ��ǀP��A�%�S}ҤQ�S��)��c��)\kŐ�?{b���p��ñB��w�pV#�����
��Ă
3e
]b튱�(�<�1C8Vw����qſ��ﯔ�.dD��"����84���C���l����΂�kL�w=��u�����
�Ɛ˲�4�������(#�v
I����
�Y(f��h�p��R�Oz;�Pe\]��j�<�Q�h�NR�P���6��*��)��*p�<d���j�� �R��EA֭�C�ǁ@M~‡�)�c5^�0-���**�1�=��ℂHx�k3*a�_��ʍ��9���ת.���;�������%niY��
[�^S�|,
� ���I�Hb/�Z
n��ŵq�n��ͫ��C�I$����Y>__/Ҧ������0����%���g�=9Pk)��f_��TKjv�\Կ�Wi�UF�p~��1B{8�T�o��m��� aڬX.�
+��J.�4����G1݃��\dK�
����X��7$Hjv*�]r|��y
�IB�Qk�SAw��h̸�K�cF1�m�����ԗ
+dF�apz]�g�����v�x�9�b
�@y������K�[��D�e	����0��:�Za��9?"�>I��r*�.��uՔJ�\y=7k�:�Zq}����娠�AA�n�!g��ʈ�p��IyӨ���oTX/�a�x��B�N�
A��O�k

�����)z���7�mv��J9j12M���>�vH
�T�ر+�Hz
�v
$i�U�]����8�o�
+�� 	�1^5����'���
��9�G�8�%�5�ډ�p:V��0�y���i�>�R�I?���5��EǦ�fS_���>y��cy��㣲�h[�FE����+��
��i�>
+{����zH�=����
���G?$)���h�';�u�q��x����7�l����5F^%�u��Z���׶m�D��TM�h����&m�z�oAs��>*���Q

+s�����������6�/Ѽ�
�����l�{���e���apS7�Ps*n�g��h�
P���]�)
�u��͋n��ņO
P�[��7�
+endstream
+endobj
+5993 0 obj <<
+/Type /Page
+/Contents 5994 0 R
+/Resources 5992 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5974 0 R 5975 0 R 5976 0 R 5977 0 R 5978 0 R 5979 0 R 5980 0 R 5981 0 R 5982 0 R 5983 0 R 5984 0 R 5985 0 R 5986 0 R 5987 0 R 5988 0 R 5991 0 R ]
+>> endobj
+5974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 284.373 170.687 294.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a41cb3496510a68512516cf65f8d214c2) >>
+>> endobj
+5975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 256.422 170.687 267.326]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9af54d524de94ada872d460c1dbd5cc0) >>
+>> endobj
+5976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 256.422 254.8 267.326]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+5977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 229.217 178.435 239.747]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa82cf61e903a201fe8892501b209ab8e) >>
+>> endobj
+5978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 201.265 170.687 212.169]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+5979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 201.265 222.233 212.169]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9571074ab0249afc1e440c8c5eb5d429) >>
+>> endobj
+5980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.57 201.265 306.346 212.169]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+5981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 173.687 202.497 184.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+5982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.237 173.687 253.406 184.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a61b27b2ed8bbc9a128f9001d160b078d) >>
+>> endobj
+5983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 146.109 202.497 157.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+5984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.467 146.109 256.522 157.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a2be2c8b9d00f81fc24dcbc36ad05afea) >>
+>> endobj
+5985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 118.53 170.687 129.434]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+5986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 118.53 227.852 129.434]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa6e183ba7e931dc88e16fb9ecfa8b3c7) >>
+>> endobj
+5987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 90.952 170.687 101.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+5988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 90.952 217.61 101.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a47def4dcb522c046a6f3a432d72008ed) >>
+>> endobj
+5991 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+5995 0 obj <<
+/D [5993 0 R /XYZ 89 770.89 null]
+>> endobj
+5996 0 obj <<
+/D [5993 0 R /XYZ 90 721.073 null]
+>> endobj
+5972 0 obj <<
+/D [5993 0 R /XYZ 90 704.201 null]
+>> endobj
+5997 0 obj <<
+/D [5993 0 R /XYZ 90 704.201 null]
+>> endobj
+5998 0 obj <<
+/D [5993 0 R /XYZ 90 633.655 null]
+>> endobj
+5973 0 obj <<
+/D [5993 0 R /XYZ 90 598.985 null]
+>> endobj
+5999 0 obj <<
+/D [5993 0 R /XYZ 90 594.501 null]
+>> endobj
+6000 0 obj <<
+/D [5993 0 R /XYZ 90 523.77 null]
+>> endobj
+1795 0 obj <<
+/D [5993 0 R /XYZ 90 437.816 null]
+>> endobj
+234 0 obj <<
+/D [5993 0 R /XYZ 90 430.724 null]
+>> endobj
+6001 0 obj <<
+/D [5993 0 R /XYZ 90 302.835 null]
+>> endobj
+6002 0 obj <<
+/D [5993 0 R /XYZ 90 302.835 null]
+>> endobj
+6003 0 obj <<
+/D [5993 0 R /XYZ 90 273.523 null]
+>> endobj
+6004 0 obj <<
+/D [5993 0 R /XYZ 90 245.944 null]
+>> endobj
+6005 0 obj <<
+/D [5993 0 R /XYZ 90 220.092 null]
+>> endobj
+6006 0 obj <<
+/D [5993 0 R /XYZ 90 190.788 null]
+>> endobj
+6007 0 obj <<
+/D [5993 0 R /XYZ 90 163.21 null]
+>> endobj
+6008 0 obj <<
+/D [5993 0 R /XYZ 90 137.358 null]
+>> endobj
+6009 0 obj <<
+/D [5993 0 R /XYZ 90 108.053 null]
+>> endobj
+5992 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6038 0 obj <<
+/Length 1900      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~��`әTj"A�M2��I�m�V����� �-E�$�����)Q�[;�d�/.��o/{s{���
�
��PP�g^������4��H(����ư�L��{;~�v|��
��yD���e�@z����o؛��O
F,�ޕ!Zz�2�O���_����e�%�q&��D����ټ^��&y��y-M1wb�
+��A�RET��ӧ������q���a&��2�,�>F��n�;D���ː{N*�>)�Hp��)ߞ�\U�"+���ο!g��6����T]�
��D�̊eS;ȳ�ڎ�Y-dk5����?`���H`�ȱH�����0">aCt��&@�҆K1d�@9��*��8JQG�[`�@ �
(
+z_p��s��N�NS8 �����Y�`��������I\!E\ro�(�܁�hb�# ����$UZ_T�SɪJ��j�7�
1_Z��3��1V�C�>��f"�W^��Z:"g�y�8��Uf���z/��������e7B��p �3��RZ��|hެ
++2x�}Q�h:�ҏQ
����f
̩(^�Q#�% A@�Y�G�9
�}�O~Wqe����3��\�e�N��=//�N��
tC�a�`BB���������*U{|��%
+p�1�̮
/
tgy��C���l^nj�{�*��*�W�"��Ew�Yd d\*�[�Q���k��.t��:u$'�� Mb
d��Z
����
��"a��l�v#$XV`g�m#>
�w�yiO�s�6*Ё\G��\��%��Ic �V�ٮOhޚ]�,''[eȓ�`�M�<�j�
���E{s �T:2o-���y�|�!�
��G��|�&#"P���.q��,�'�Vd�	�ԕkߚ
�{��Yg�a��
��8�l*��d�+
��h�Fj�A?3~n@�89q���i��ɨqR�:uM���l�gC;SdP��).Ư� g���
�8_�"���9n6/+����O��=�кz\�\D ���4�<�7�{�9k��J�x$�cF�D�
	GX6�<{�
����ٷ!� K��%
+���-�M�x�� 2��٢6}���Q�WC���D�w�"_n��'bCqDS�ŒGl'��� �p�Z�h��W��Lm��2�(㛢E���lH9G�h��#���'=�C���>�|4m�i�r�!p��KB��2�ِ��
�jZ��@��ߋ�zߎ��I��H�ONN��  �\܏�Ѯ��8R.;�J��
�>�	x��CG�V�	U�:
�!�By\�,V�.���v!��h�J�l�Q ���>U�#�ǎ����n �C{��5�� �V�j����$���T��D�҇�#lڒ'=�@vr����|$ES�<�EW��thj7g�	�=Mbk�7j9Q�:/�Y��Ty�:��(�+�����[)�ss�Z��{�q�w(�q]��)
�{���֠��5z�

�/h�:t]pG����r<d����C
�O���Jlk�Ck�$ �qu|Og�B{T-�s�=�Peg�~_����4����U���J���+#�=F�#�oc�dT-�(k����"��V��]ZRw�USꊹ����`G����O�#���Ϫ�9� H��A�}��i�㐂7ܔ\�����W��w� ԋ�hU�ZwʾJ�E��,7����=v�e�[b$	�ta��-?�|����^-�d�OCC^_�WE�I�DL67��G��
%��
:7��p]�n����;_k!���B�IP�=6/�5n���%�~ȁن���6
믇-
	�֛v#���k;��T�7C������u���k��i�	"�BImz4Է�
U�V�?���<-������������d=/U6Gq�����=��
�6���$�ɥ���1��@�D�
+endstream
+endobj
+6037 0 obj <<
+/Type /Page
+/Contents 6038 0 R
+/Resources 6036 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 5895 0 R
+/Annots [ 5989 0 R 5990 0 R 6010 0 R 6011 0 R 6012 0 R 6013 0 R 6043 0 R 6014 0 R 6015 0 R 6016 0 R 6017 0 R 6018 0 R 6019 0 R 6020 0 R 6021 0 R 6022 0 R 6023 0 R 6024 0 R 6025 0 R 6026 0 R 6027 0 R 6028 0 R 6029 0 R 6035 0 R ]
+>> endobj
+5989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 707.957 180.54 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_affa77e724493813cddf9740767c2473e) >>
+>> endobj
+5990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 707.957 264.653 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+6010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 680.02 178.239 690.924]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a26673943182a6efc6cc6e3aad8c731a7) >>
+>> endobj
+6011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 680.02 262.352 690.924]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+6012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.68 590.831 156.456 601.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+6013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [485.444 590.831 513.996 601.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+6043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 578.876 165.147 589.78]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+6014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 259.127 170.687 269.657]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_abed774daa9ed3c470c7fd237bf40e28c) >>
+>> endobj
+6015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.184 244.78 259.854 254.017]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 231.19 170.687 241.72]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a2c9678fbda42018549d63c11e4c806a6) >>
+>> endobj
+6017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 202.879 170.687 213.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) >>
+>> endobj
+6018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.902 202.879 330.546 213.783]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.91 188.238 228.579 198.143]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 175.316 170.687 185.846]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac8af5985d99461f4c7d765a67da5f02c) >>
+>> endobj
+6021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 175.316 254.8 185.846]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 147.379 170.687 157.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a9c5004d1d218c6bfb999ce09552ac2e7) >>
+>> endobj
+6023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 147.379 228.788 157.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+6024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.977 133.032 278.647 142.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 119.068 169.013 129.972]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_addfb9eaa7193de6902fad49459c57da4) >>
+>> endobj
+6026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 119.068 229.605 129.972]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.132 170.687 102.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 91.132 222.233 102.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_adf87eef74d0ff9ff35e15aeea0a361c7) >>
+>> endobj
+6029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.57 91.132 306.346 102.035]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6035 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6039 0 obj <<
+/D [6037 0 R /XYZ 89 770.89 null]
+>> endobj
+6040 0 obj <<
+/D [6037 0 R /XYZ 90 721.073 null]
+>> endobj
+6041 0 obj <<
+/D [6037 0 R /XYZ 90 697.301 null]
+>> endobj
+6042 0 obj <<
+/D [6037 0 R /XYZ 90 651.758 null]
+>> endobj
+1796 0 obj <<
+/D [6037 0 R /XYZ 90 382.912 null]
+>> endobj
+238 0 obj <<
+/D [6037 0 R /XYZ 90 376.286 null]
+>> endobj
+6044 0 obj <<
+/D [6037 0 R /XYZ 90 277.768 null]
+>> endobj
+6036 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F91 766 0 R /F75 562 0 R /F13 835 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6070 0 obj <<
+/Length 1906      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�6}���^:	��E��֮C�n�Z�)
�V���JJ���}%Y�eGi�v� э"���)c����o�_f���!�4ҒJov�i�\#!�j�
�#*�)��G�~���ӣ�b?[�]Ƌ<:}���Q~wx����,��D�q|x8�Ң<M�8��,�T`��2*
+{�.>�m�t
�Pa�
'�ד_g�O(�G,*�B��W���-��k#��wS5Zy�28.����&�� �NT��D	��3兄 B�d?P*��ׯ���ƻ�&��T�)6&�}Z��=�o�t`
gW�՟�����F�����2�n��t����SHnLA)��zS‘�ܚ��H.�¼~𒀁:�u�
ۆ0�m�tIb�4m��6���D#JT��Ƭ��$�^.�:n�3�
�NG\�l(���9���]�}�[��>'Q׆ ���elO��d�mi��e���r���a���w���=�~�]�
�8 ���d�ŗ�n�X{Dx%i�o��oj��A��-5V\����>���N˻���Z*7E�*���b]ʻ�Q`����]hC�C�n\'k5H����0(~��yZl�u~�[˦�.	�P$YZYzX&�r��^R{�����J��&S�ev��6Z
��B�p�쮧j	�����jS��S���;%H�4��{D �f�Y�-���ȯ��v$?�VW�
���)L�0
�%
���m7Iyi���]:�'�
��w��Qa��C��t
e�>2o�($��,���z/�2J�#PW�<O�J�}�!O9b ���kUw�b=�nPR��.9���Jڢ����ѬF+��
��7H�$���j=��@��!=-�(]���عo#�Z��Q
7��I-
e㈷��r�Z?7K���H���;�L9��e\�Tc�&{?
8�?�L@
���*3��3c `R��`'i*�X�jE�Ecs{�d��1�6�c���l������B��!���M~=��(|��s�E6�6h���t��
�z�6�ʫݍ��"4bR{�a$�ط	ܧt�
Qm;8S&�"&T�c�&�Q���H�o�T�!PL�j

�I�B�{8�T��>N AVl �#
��03I���F= �B�1 0LVu 4� �t�(`#.h? �U�a"SM��N�F[-��t���I]1��q �V�?���.�r9�8��Z&�<�[�9���J_(^u-�S�f�(m4�CV����t?kw��yF�l�(z�\��HDN)q�|@9&
VP�k†��pv�B���1��t%8y0;� �a'�`v@�N���4���
 ��i
 5;�0�Djv�v�]�c8��u��#aq��~�XXO���/
�3��J�x�$�*R�em/�N��� ׸Dy��}��a*�)�(O����
�u$w��Oҋ
;V�.�yQ�llmt^���$9��� ���W*J�Vqi���]{�����>4�6?
M����t��Q�ϯ�!H`�P#���+��q�vkS����v
NE!aM�W��z�j��L	��VE)��f���[/B��f����M�\v���h�v�����
��&9b�}i��
0�	H
���:�
�I�*ݣ�$�a�I#@ht�a�N@��
 �u� �� ��� P�^ &�d�� $Z�$w�$ &.ǀ�����v�$�$ȨV�0G1`rL\���ds �Mb7��K)���`0$]�j��z	����~��؝�{�U2mvj�lVU�Z�'���LS
+:���F�
+�6����{�w�?B��]����h���v07��7	"Wy���P0e3���Y�����I����RH�AqY�W�g�E�^�y��vlg.���tޔ�U�������DMʵJ �CJ�X
�	�0j�-�:����������^d`�u��氾*
+endstream
+endobj
+6069 0 obj <<
+/Type /Page
+/Contents 6070 0 R
+/Resources 6068 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6079 0 R
+/Annots [ 6030 0 R 6031 0 R 6032 0 R 6033 0 R 6034 0 R 6052 0 R 6053 0 R 6054 0 R 6055 0 R 6056 0 R 6057 0 R 6058 0 R 6059 0 R 6060 0 R 6061 0 R 6062 0 R 6063 0 R 6064 0 R 6065 0 R 6066 0 R 6067 0 R ]
+>> endobj
+6030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 170.687 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 707.957 222.233 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a412d0108a72eca07f0075f7a60662e34) >>
+>> endobj
+6032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.57 707.957 280.334 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+6033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 680.062 170.687 690.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 680.062 227.852 690.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_aef8ddf62527c76662e377fdc9b46b928) >>
+>> endobj
+6052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 652.166 170.687 663.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 652.166 223.05 663.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a0ec1eb879aa24c8e3f8b9abc08a51f27) >>
+>> endobj
+6054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 624.271 170.687 635.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 624.271 217.61 635.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) >>
+>> endobj
+6056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 596.376 170.687 607.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 596.376 212.808 607.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_acade7cd192977aa0b43a42bbaafe1c27) >>
+>> endobj
+6058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.179 568.48 263.349 579.384]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ad9a4e7c1648f42300ec153db346dffb2) >>
+>> endobj
+6059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 540.585 179.554 551.489]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 540.585 204.032 551.489]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1e45c485643b62ed4d751fd0bfaa3677) >>
+>> endobj
+6061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 512.689 180.54 523.593]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1ddeb95722df9e5f35009c6e017e2404) >>
+>> endobj
+6062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 512.689 264.653 523.593]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 484.794 178.239 495.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a4db44a79e5e6eea466723a565634b017) >>
+>> endobj
+6064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 484.794 262.352 495.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.528 294.096 232.305 304.024]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.028 90.916 197.804 101.819]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6067 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6071 0 obj <<
+/D [6069 0 R /XYZ 89 770.89 null]
+>> endobj
+6072 0 obj <<
+/D [6069 0 R /XYZ 90 585.74 null]
+>> endobj
+6073 0 obj <<
+/D [6069 0 R /XYZ 90 456.599 null]
+>> endobj
+6074 0 obj <<
+/D [6069 0 R /XYZ 90 372.21 null]
+>> endobj
+6045 0 obj <<
+/D [6069 0 R /XYZ 90 347.776 null]
+>> endobj
+6075 0 obj <<
+/D [6069 0 R /XYZ 90 347.776 null]
+>> endobj
+6046 0 obj <<
+/D [6069 0 R /XYZ 226.769 278.649 null]
+>> endobj
+6076 0 obj <<
+/D [6069 0 R /XYZ 90 271.675 null]
+>> endobj
+6077 0 obj <<
+/D [6069 0 R /XYZ 90 203.435 null]
+>> endobj
+6047 0 obj <<
+/D [6069 0 R /XYZ 226.769 150.239 null]
+>> endobj
+6078 0 obj <<
+/D [6069 0 R /XYZ 90 143.265 null]
+>> endobj
+6068 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F24 537 0 R /F91 766 0 R /F11 621 0 R /F8 802 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6093 0 obj <<
+/Length 1955      
+/Filter /FlateDecode
+>>
+stream
+x�ݚIs�6���<��A0��3=�٦i���)�dh��9�HE�����\!Q�$�
<�H���-?@��M��g��&����EIe4�
)n���i�
�G�&�#&5"F·��G�_M���\�g�'����G8"��������w8����F����5�G�2�]
�
�RK�Qa/�R�!-�� �y�C�jތ(��x���刐���ڲ������}�52���ޑI�1��ͯj��D�H$��gZd��0[�6o�6���6����r��0I�Y�5_DR�y���b�D�*_��6����*��n�uuU�ʒÇ�C
+n��e��!��+�y�U_����	"9ct;]šd8���Xx�戀g�2!@!�
+)���M�r��Tt����v�4�%#"���
��%�r�4��!���}BѦʡ�_]+O�Ǥn��Nz�No7z
�ƽgq��i�ς�t��W�Z0��5�<^�������~U��uy'�l�V_+}��&��/�Wk�d����Gܺ��1QHR^�HWE�i�����i����㈀�U�2�x�A஥Ǽ.��s���K�@���#Q��^:O*�iW̍�<&P��Rј��2n4��">�qU���62a��Q�%c���
�b����&&�3�Y���;
_n�ٲC�a�CH�X L�/�Ez��a%������
�#�fA������H�!$��K�Y
�v�,� �	��=U��)�	��
2Lb�� �Ę��јä�r6HXB�kb��z_�pͽ>��bU�(m��F���E��BC
lB�tԑ1S0����s)�5~�fwi����w#��
\&ċ�:�M�M1_�3�C�#�ބ����XA��o���(�����I0���a!�&����s�C u��N [...]
l���L=q֕�a�W����h˛r��z6��6��c�Zt�<82�~c��Ы�$`�nс��Z����)�q��N��t�Ͻ������@�Zv���Z��̾;��i���@� Y�V���d~�ؑP=|z�M�i��
��{{t�[���=-������#R��٦�<��j>)(/PՈy>i�Ψ�T���M�!$P��6$
�'��Y
+��P_�A|b��O��(F�0_@�O���q�PA:�@�\�����?ċ:m�è919怅}��`&s�|�
د�@�+W6kŋUU���Cc�;m�T��ђ�YG��ѴNR�2O�$X0��w:����҄�y+�E�I�BHp��>�P}&����<
=0iUz��
�L쾲)�{|�t��~N�?/�
	L2
�'��;9�BVBnr��m>;�HJ ���o�H�����3H�
�̥�'�'#Ň���.��
+t��M� x�������J1�S��C�E�Y��
AEP��H��
�"&�;��?���p�8�-/Ԥ ��+,}
����-*D��
	E��]G>��X��~$����a�4$R�
�P`\5:
+^l���^���Z�7٪�c�tK��2�=e��:�� NO�E�;�z���߉z�=��:`i	n�Q�����zȐ�$�9SF'�e�`��Łw"�<1�u������!t
%6�W���	<��
��w��l�>8���طaۇl
+	��t��R�=l_���w���Y�8c��1�7���0Fɋ(��2��ԏ�7o^�����m�r-^��}\�����tU
m�M`��2��
OckuU�6Z
+�XK�c�
+LK�l{ZN��z�������Y%�
����j�|��U}\�
+�y���烛sw�ֵ�����;S
+endstream
+endobj
+6092 0 obj <<
+/Type /Page
+/Contents 6093 0 R
+/Resources 6091 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6079 0 R
+/Annots [ 6088 0 R 6089 0 R 6090 0 R ]
+>> endobj
+6088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.985 452.686 251.761 462.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.629 411.49 385.406 425.438]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) >>
+>> endobj
+6090 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6094 0 obj <<
+/D [6092 0 R /XYZ 89 770.89 null]
+>> endobj
+6095 0 obj <<
+/D [6092 0 R /XYZ 90 720.814 null]
+>> endobj
+6048 0 obj <<
+/D [6092 0 R /XYZ 226.769 638.542 null]
+>> endobj
+6096 0 obj <<
+/D [6092 0 R /XYZ 90 631.568 null]
+>> endobj
+6097 0 obj <<
+/D [6092 0 R /XYZ 90 563.327 null]
+>> endobj
+6049 0 obj <<
+/D [6092 0 R /XYZ 226.769 511.033 null]
+>> endobj
+6098 0 obj <<
+/D [6092 0 R /XYZ 90 504.059 null]
+>> endobj
+6099 0 obj <<
+/D [6092 0 R /XYZ 90 436.795 null]
+>> endobj
+6100 0 obj <<
+/D [6092 0 R /XYZ 90 367.44 null]
+>> endobj
+6050 0 obj <<
+/D [6092 0 R /XYZ 90 345.397 null]
+>> endobj
+6101 0 obj <<
+/D [6092 0 R /XYZ 90 345.397 null]
+>> endobj
+6102 0 obj <<
+/D [6092 0 R /XYZ 90 274.851 null]
+>> endobj
+6051 0 obj <<
+/D [6092 0 R /XYZ 211.835 222.556 null]
+>> endobj
+6103 0 obj <<
+/D [6092 0 R /XYZ 90 215.582 null]
+>> endobj
+6104 0 obj <<
+/D [6092 0 R /XYZ 90 147.342 null]
+>> endobj
+6080 0 obj <<
+/D [6092 0 R /XYZ 211.835 84.46 null]
+>> endobj
+6105 0 obj <<
+/D [6092 0 R /XYZ 90 77.486 null]
+>> endobj
+6091 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6109 0 obj <<
+/Length 1886      
+/Filter /FlateDecode
+>>
+stream
+x��Ms�6���<��dcߞɡM�NӴq��f<�MۚX�#щ�� II�(���t&퉔.^��Xq�*�L��������?
�^�8�4���"q<1�1���y��N�9�����t��
��������|���
�N�����7'ǩ��i
+��燇g��8�4+&�t���_\g�Yy�6��˶�<
ˡΥ�_�~>�}���	��369����9}��F#�M��F�D���u��g�G�
�t�2L �4J&��]�̈��
I�C�]C
�G]7�hU���.5�%�0��E���
+�
��n>��a��L�h�G�@zu)@�|}�X� �z���[ҁ��i�^Nwҽ�
���?N��O�n�	�i�]�/�0�u��*������y�sŽ�d�V0e0�cN����D�O�j���B2���C
��.��{�K����ېf�4��F��1�~8�
��a�k�
��|��(Th�HW[>��l6�
�z��p�kR#��YɄЦ��MH�rp2�K���͛����aE/�'&�ʤ
���48�
�:�Q^x
+B\�6|�k���m���i���N�߂�
F��"�K�L;��*O���͖��Xi�Vަah!r�͓��=uD�Z3�&�q|��.���UV�w_�����i�2
���Wύ��Y�4<ԝ��IQ��1)���LJ}�~�X��/�[�r1�wV�=��դzE��'E������K]O��2m
�F/�����)���
Gy�ʶ1�Y����j�DG>Q��p>���+�Z��v�����4�$:�
+t�@�bc1V�"���Z�I�ڑ7�X@�TG�bہ ��[y�γg�_�dg�7�!	B���J%*G�2�?2�e�<�LU?+�*���y+̎�T���p~���q��z�l���-���<PO�i# �]@@z@�*���@@a�),j��$���
HD��,��B'	NA,�
(U�@�G� ���#�G�`PzG�a�bA�u�p3�ST�nr;���A?��نmG�H�Ҷs/$�C��˛� �#��W�N$�<kcb	���,3Rv"@3c���i�U$M&(
ؔ%�
+Ҁ��Tg#>k����)���Q6Ι�K
Է��0O���V���Ғc#��f/>��R�`
+g4�� \��Z�A;ى ⃶"Ў���@@�W��m)C���#���܁��?w�Z���Ɇs�e<N�'��Mހ�J�M�#�:AK�b/��CS��-
+�@8#�B����8����0��/��NT���I�m8��B �%h�,H0
���U�Q���l�2�×����Pa��@��͋��x���@������*FL�]��nM����#^Kҭ^?�F�x1�X4TGs�`H-�W���
OBSc36������x��3-�

1mۧ����–��J�����d����n
N
�U���`!�zSB�������	)؉7���
:���\��n�y�E�{_� Q�
���ST)�����X��;l�8��l��l�rk�j!���P6H���x
�q)
>h�F
���(�x1�d�:=�"_"��"�5�|��˰�*ys��j0%Z��K�` A
�ܹ�P
&02�
U�	��p�	:��0�ڔ���X
+�T<�|V:�y�;9bӂ��r�$���O�f"�f�ɇ:��-6EV\fF2-����KӮeU[�����GG�˛�f���T�~�U���o��
�b�٧H����/)W�}��f�@�^�]�W )�L��z�~
9@˪���]��������,_2r�u
/�Ņد���
x4��3:�r����k�ܟ8m�4ֳA���Oi���b�>�X?X}q��H$?Mh�W����oY�
+endstream
+endobj
+6108 0 obj <<
+/Type /Page
+/Contents 6109 0 R
+/Resources 6107 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6079 0 R
+/Annots [ 6106 0 R ]
+>> endobj
+6106 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6110 0 obj <<
+/D [6108 0 R /XYZ 89 770.89 null]
+>> endobj
+6111 0 obj <<
+/D [6108 0 R /XYZ 90 658.004 null]
+>> endobj
+6081 0 obj <<
+/D [6108 0 R /XYZ 211.835 605.709 null]
+>> endobj
+6112 0 obj <<
+/D [6108 0 R /XYZ 90 598.735 null]
+>> endobj
+6082 0 obj <<
+/D [6108 0 R /XYZ 211.835 531.915 null]
+>> endobj
+6113 0 obj <<
+/D [6108 0 R /XYZ 90 524.941 null]
+>> endobj
+6083 0 obj <<
+/D [6108 0 R /XYZ 211.835 458.12 null]
+>> endobj
+6114 0 obj <<
+/D [6108 0 R /XYZ 90 451.146 null]
+>> endobj
+6084 0 obj <<
+/D [6108 0 R /XYZ 211.835 384.325 null]
+>> endobj
+6115 0 obj <<
+/D [6108 0 R /XYZ 90 377.352 null]
+>> endobj
+6085 0 obj <<
+/D [6108 0 R /XYZ 211.835 310.531 null]
+>> endobj
+6116 0 obj <<
+/D [6108 0 R /XYZ 90 303.557 null]
+>> endobj
+6086 0 obj <<
+/D [6108 0 R /XYZ 90 198.291 null]
+>> endobj
+6117 0 obj <<
+/D [6108 0 R /XYZ 90 193.807 null]
+>> endobj
+6118 0 obj <<
+/D [6108 0 R /XYZ 90 125.233 null]
+>> endobj
+6087 0 obj <<
+/D [6108 0 R /XYZ 90 81.969 null]
+>> endobj
+6119 0 obj <<
+/D [6108 0 R /XYZ 90 77.486 null]
+>> endobj
+6107 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6130 0 obj <<
+/Length 2262      
+/Filter /FlateDecode
+>>
+stream
+xڵZ[o�~ϯpQ`kcaS���b����Lڗ�`��L,T����L��{(R�(˗l�ȃd�<<:��|�
FT��G�]~�������x�^��AFR9��<R� !��|t3�O�\�8bR#b$̪�����w?_v�.�]_�vA�
/@ �G����<���aaf��
�
q���>_��G���ӈD�_��@�"x2%��mQd�)et|5�|���dW+��֒6�t��h�j���qI"��&�<�A��ia���&��CJ
"4R�cz[&�d��O��o~X^	��ey��D���D�qi���������R$�>���
+$���O+[&UQ^^+���>(~�"��z�f��'X!�L�����@?>Z_R�i��G�;C4��5#�
Ș2)�l4��0B���+���t�o����4���~������wW����TH
��X��Ү��w�s��nm�+�l@

j
P-� (Z�v�cZ-��k��
c@�V�T*��
�M�չ�,-8���:ؿ��������L�in� �������H2�����hl�X�a�  d	� �H'��[�@V��*��b-���O����j�T��1�2wF�|�ϛ���aO�F��ݸ�Tډ{t�(� ��(�CDr��g
��+q�qNf0��|6/f��ͫ�J��?��zP��+K���qB�8	?�m�\�8�,��T�˲bB89�����4��6 at d!�4���̃�)񨛩 v�Zeh�n�)�5Z�T#�U
+�%+*�C�DH@]=L#
%�Z�ǎ
Db`:��%�%��O�F�<*P��@ #"���VR(��Lz
-4�
��H�w�VP��.�v)J��9��
�(�=/|X���=4�\����-]�z��͐O����,�Y�%���H���qg��b
bcl�(>~���~�wӺ�2��H


+�-m>�=���V�k�0��9�g�fn���N����$*=Q3`�=9�ʹ=��\�(�� �HҀ<�-ӪA��}~Ms���apf�>ڮ���j�����D��t�I�OvykK�~��

Ӧ�R
 �#m�a�|H�j�dǿf�
+C2J�����>��
U��5>+r�W���nt��M	'�C��
TC��/}�P<.��
}�Ms�������
�ôq����k�
���.��c*
6Ha=
�1��1�oe � Cr��
	�.t��O�ڔ���=f���05z���:���f5Z��9������ �H����>qϔǘ�f��5{l�~�Q�=4����[�� ��r����ph�`U��PWw4�‰�a�r{0UgG�ݦ6�(�DTG\�@ �
�R�g��$�_����q�G|��L���
+u�� �_�S���y
+�<��ppK�`�(p�n���:"����U�fu�A�|k׳2]U
q
�Wp��%
��-�Y �d�.��C:���͓���D�/�2
+����G�lB�8�[ �@�B��B�7CW���CJR��YR}z���;��E�i�i��I

+�	Bϡ�&��J
lP�D��� М׻�����$�)HqeԡP���t�9�������5�j�a�Y��١���ߙ�3���{��@�v�����B�"6�"m�.=�����Xn;�ج��
uJy['�����
r�"��-�(k6����֬�z��4��7d�|�'�S��²��wO?��]��mp{��	
m?���A~[��r���P]��`GBP�K����
����A�#Nެ_?�1	���	�[2�Z!v�v�80]��3�xĤW�1{�y���	]��?cËz�s�@1�
Q�
+�mxI��vgQBJĘ��8XN h�:��ۡ���_RN�mv��PGɎ>ZO\]�F��PW1�Ad����[n{bJ�g�����'S*
&�8�nB�p�������r���;!]����B'���Y��Ih|N2�JAmIÂ�vu�W���+��ѹ��	 2�M�,+f�Ҹ)K�,�'w�܊�~�
F6BIX�j��7�S�@��\��;>
�ޕ��jTX�K,lS竿L�����\n��I�|��m�0�
4R�(;��&:
�6��[��
p������}���
���d��ۊ����V`s��i�!
+]?��<WW�Ϳ׶�Z�$o�[��&�ܲ� �vi d��n�������
��&�
�EU�._���ܯm~�f�r79��]ª#Z���հ
x��I��\JJ
+endstream
+endobj
+6129 0 obj <<
+/Type /Page
+/Contents 6130 0 R
+/Resources 6128 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6079 0 R
+/Annots [ 6120 0 R 6121 0 R 6122 0 R 6123 0 R 6124 0 R 6125 0 R 6126 0 R 6127 0 R ]
+>> endobj
+6120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.89 418.66 270.461 429.191]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a21c60e2a5b7d04de458f4d6ff0c3bd9b) >>
+>> endobj
+6121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 403.795 208.843 414.699]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a5bfc7fe8384a4382f89fdb9dc06d7f77) >>
+>> endobj
+6122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 389.304 204.042 400.208]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a6fa16eb9302f619ceb4bafaa952394ac) >>
+>> endobj
+6123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.954 374.812 222.123 385.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_af71ceaa08677639eff48aa5929df1c58) >>
+>> endobj
+6124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 344.21 177.601 354.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.099 344.21 211.931 354.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_ad7326cf3c2ddd70745aa4a527ece65be) >>
+>> endobj
+6126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 312.861 209.043 323.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a2eb19a01c9b844f52f86464fc8f0ddd3) >>
+>> endobj
+6127 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6131 0 obj <<
+/D [6129 0 R /XYZ 89 770.89 null]
+>> endobj
+6132 0 obj <<
+/D [6129 0 R /XYZ 90 658.004 null]
+>> endobj
+1797 0 obj <<
+/D [6129 0 R /XYZ 90 564.597 null]
+>> endobj
+242 0 obj <<
+/D [6129 0 R /XYZ 90 556.072 null]
+>> endobj
+6133 0 obj <<
+/D [6129 0 R /XYZ 90 438.821 null]
+>> endobj
+6134 0 obj <<
+/D [6129 0 R /XYZ 90 393.289 null]
+>> endobj
+6135 0 obj <<
+/D [6129 0 R /XYZ 90 279.661 null]
+>> endobj
+6136 0 obj <<
+/D [6129 0 R /XYZ 90 229.313 null]
+>> endobj
+6137 0 obj <<
+/D [6129 0 R /XYZ 90 175.969 null]
+>> endobj
+6138 0 obj <<
+/D [6129 0 R /XYZ 90 152.899 null]
+>> endobj
+6139 0 obj <<
+/D [6129 0 R /XYZ 90 152.899 null]
+>> endobj
+6140 0 obj <<
+/D [6129 0 R /XYZ 283.294 77.486 null]
+>> endobj
+6128 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F22 2982 0 R /F11 621 0 R /F68 3017 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6161 0 obj <<
+/Length 2331      
+/Filter /FlateDecode
+>>
+stream
+x��Zko���_!��T¬�A�@��Y�vv�f�~�

[I�ڒW����KQ�EY~5��0-S������+
+w~8�����;����2��

7HH�5
>�#��	����a\,�/��a>�OfE��}zS������4K����O�"":LV�4�..�y�*��eR�e^D*p��<^�\�*�M\�l�D&	)&���ξ�>��� V
�M ������g
���OF����8e�=>���
�ӄ9۴_��
�M�D�f�
+QD�y��b9���":G�w*�$�0Hu�\϶B��
��e�ŋ�N��WyDH�8`VZ���f-Fn�
�a�Μ�K�ˮӶ
���L5[��>?Rd�i=��3j`4��.#F!,�\hl`

�Q0&�a�C�B1��
�
�#*�(
�P
�.�� mF�s�����u ��Dʨ}Q�����0�`&���F��j�5Xs��?�4Hb
Hc�%� �"���H��!���|�Zo��&�:�

M
��E���\B�Y3�OiQ����j
������
�9"2��iUw~�-[>�w��E,�I���r�O܅,�����W��+)r�c�'���i�d%��4������}\6��z�ER��3מ�0n5Gʻ�X��x`��^ެ8x�4}��
0D(R�
���PmHI�.2�.v_̒�Iau�{��^"a�M�$^U
A�9�����֙�N`Vi%,������k婗�%�D�\�^R�+��U��`
C!$�=��1�F"<'i� j��@
##�݈�7���J0�(5����l�HX�L�
+X^+������IYQ ��	�m@�X�{H�uݥ
���XHaj�p��XT�+�����Ww�L0��$I��ba��da��Z)���䴁�*H��k壢����W
+��J�؞�(�IDO)��0�v��#2�!�o�� �׭�=:b��@$%/K�!`����:ZH�(���i�Q:�	p�0c��@����WG IPz��%CJ��~��ln���$\YF ��
�Ɛ!�'�}
y��Rm�H��dPH�k-�~�ac��&*�
?U�����1WlX>�
����J~�벥#��2O�2�՝s�}�<T\`�m���iբU�J����2 ���<����P��d������
;�h��U
�m0~EŐ&��c|�w�~�Q�8��	)�=�U�
|����6�nrP��䁊�
+
�Ͼ��1�T���'�<�"� ��G� �.x
$�v�y��;Rr��s.�7�>���
vT��aT1�Nq��c�������ۮBq!k]�%���A&�� �@'4�rh�H�3�����������m<�E�M��ڋ2�M+[O
m�r�ۇ�	D���m�q�f^��]�X��`��Lk3��H�q��1-�
�>��SS*U-�ګ)@
J{,D�a�

`�_������
,?��$:N�}]��%�Q@�{�Bo�<�Y�^F�F
+ 
+��U'~w{�@�+^
+�ϫ�D6�����-�����mh=��Z�o���
+�Y�?�@%��9?婅�{��)��b/p���d��S��ߵ��p֚���)x�5����ܸ�_]�ݬ`ZW�͙�cu�\��K2���B����I���ynS��4�s�lR=O.<n��ΙK�[���R���4��.�st�+v�F]]U[e
Ĕ����-	T�Jj4dW{KN��V[j��A ����֖b���b�_Ɓ@�-��!
�^Rm��Тz���$�;�*�H��c``����>�u��7�8@�
+
+AU�l�Dݓ߉��5;����NI~�f��z6Tf�+�/�<�^ʹ���
H@��
�nH�9q��uq|���w�S7럓�MR;��:�Zr8��n�1�tbx�5-��Žj7v�u���w�!p�0 
�q)yl0?�$*�,
F(�Ӳ&���4�8�y:�M@t��@�
m��eQ�ܯ�a�u
��DGLc��7iY���כg)��h3�u�=��;�St�"<To5
Z�ŗ�S��.���+8��c�\5�T�ό����!�@b����!;��wk�4��o��M[��W��@��UCä��T�q�'����X'Y��� J�+��Ro�|�Z_[�
�M���o߾��һ��Γ�6	��Ou9��\#.¼�����t���dr�;�54Ԇ��c��l*�N��+Ȫu��//߻��WI�=��9���<jV'-I�j��$��"�oIQL����gд�����R�{�y_�ˋ����*��ԛ�Kڙ��ԭM���g�Me���EU#�&;m
J������_!�DU/���Ӯ [...]
,�:�
+endstream
+endobj
+6160 0 obj <<
+/Type /Page
+/Contents 6161 0 R
+/Resources 6159 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6079 0 R
+/Annots [ 6144 0 R 6145 0 R 6146 0 R 6147 0 R 6148 0 R 6149 0 R 6150 0 R 6151 0 R 6152 0 R 6153 0 R 6154 0 R 6155 0 R 6156 0 R 6158 0 R ]
+>> endobj
+6144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 215.994 170.687 226.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac54489beb3010518b290d6afa08902b5) >>
+>> endobj
+6145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.184 201.487 259.854 210.724]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 187.737 170.687 198.267]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8179a7265eb8cfa0fbb55b7f46c18b0) >>
+>> endobj
+6147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 187.737 254.8 198.267]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 159.106 169.013 170.009]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a5d627d5308cf0cc64f5017c13d956532) >>
+>> endobj
+6149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 159.106 229.605 170.009]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 130.848 170.687 141.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 130.848 222.233 141.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ae4fc34e44b3473124567a5ee4b03fe57) >>
+>> endobj
+6152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.57 130.848 306.346 141.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.591 170.687 113.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 102.591 227.852 113.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a47dc6fa13c0ff235b9ad27ae26973bc7) >>
+>> endobj
+6155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 170.687 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 74.333 223.05 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a030483dd2c1346262825de9b2a7f985f) >>
+>> endobj
+6158 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6162 0 obj <<
+/D [6160 0 R /XYZ 89 770.89 null]
+>> endobj
+6163 0 obj <<
+/D [6160 0 R /XYZ 90 721.073 null]
+>> endobj
+6141 0 obj <<
+/D [6160 0 R /XYZ 200.604 665.092 null]
+>> endobj
+6164 0 obj <<
+/D [6160 0 R /XYZ 90 658.452 null]
+>> endobj
+6142 0 obj <<
+/D [6160 0 R /XYZ 235.732 596.967 null]
+>> endobj
+6165 0 obj <<
+/D [6160 0 R /XYZ 90 590.327 null]
+>> endobj
+6143 0 obj <<
+/D [6160 0 R /XYZ 90 484.727 null]
+>> endobj
+6166 0 obj <<
+/D [6160 0 R /XYZ 90 480.244 null]
+>> endobj
+6167 0 obj <<
+/D [6160 0 R /XYZ 90 411.669 null]
+>> endobj
+1798 0 obj <<
+/D [6160 0 R /XYZ 90 323.02 null]
+>> endobj
+246 0 obj <<
+/D [6160 0 R /XYZ 90 316.194 null]
+>> endobj
+6168 0 obj <<
+/D [6160 0 R /XYZ 90 234.795 null]
+>> endobj
+6159 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F118 2438 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6191 0 obj <<
+/Length 1845      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~���^:��I���4ö��l/i0(��%ORn��;�DI�e�I��m(
+;u��\��
���|w:98V,Q(�
N����HH��28�RLg�?LjDB	O���|x���鉽7y{:�sB�He@ ���jrv��K��c�
up_.Z�2�\'�_&����,��<ЀMr���a
(B!���]|
&�ͩ��"�?oL�e�͘��ӻ8���%i��f\L����\͈�~Ƙ.b��|1��X⎏�"�i0'��F�R�=�����\��$
Sߴ>ʮkg}*�Y��dQ�fv��1��4A
�y��v�S�+�.���I^x϶6<GϥD�	xA�B�+[�Lq�%y���۬rqRT�Ҭ��@�Ł���.�mF�FY
],�ӏXTw3*����Q�{<�;�y��	X�o'�����J����Ҋ���\�YƑ��-*n�Z�A�ɠ'��� ߯.�t�_
�~�-D��l1R.�=.�r�z�0R�ߤ�uTe>��R�D?��lB{7���cw�t\L��W���!BTX���DO��"X"J�`�(tZ��dU@���6Y1�cW�1T%G��mx���MT4̓��̸�X�\���������!�E$�LÆ	�x[nC�ė�S#��@�ޖ][����e��}Xg&����>y��n</����g���}�·��LD�r�a 
��zI8`��������ޏ��F<d�q�4��K���n�X
R{| ^;2E/

�|��k[�Ϡ�o�<Z~m�W����H)��7�5οIW�I
��.=�rq�S.-�t�Ū�L)��&"�����#.�=
'3��2��]z�ӛJ~�AX�����η܃��P�h
�7ֻ���*��U2��Q����8���w?��nMb|�Q�YE��bP�L at Mk�k���a3�UW����̔��f��3F� @�?ޘ�l L�S=}&ʇ�.�Ƞ�����������( ` bL� [...]
��R�&)!D;Y��@�֓��e��{{K�N�4���l�(Aص�CV at K+�=��Q�E�?xt+�f7�u��Fv9�Y[�y�$"�ڡS���Q�r"
IS�%
D+����F��7�V7���3L�HAv
<C�l
=w����:��B2n�U
ԩ�ug�L�I�
+�=�^bm��eL�0�&���0���ǍV����e-��4��%ڍ^��D� ��h�I�����R��
kD���_!`�
+yW5�Z3��Ξ:^/�x�֌Nw���IDiu�FQ�1�'%H�/�4�����x� E1(�1P
+ڛ��'Q4t
��vx�}�H�@��1 0��MKB+QV��sL g�؛cHK�{����>ZW���z����M]�%E�SJ���pX�̙�PEԗA�)
"�?A�����
�k�0��i��P��|o#^N���{_��U�NQ��םafa�^�F�q�t0��|/o�g�
?�Xp�����
��[��
tNq�(cS���Ǐ�/��&��J�ڟ?G�m�lO������c>`)(Fm��fs�81��
+�
�&etO�!_t��7E�><8����Mr��j3
ڇC�m��LW������.�J���ߎ`��
+endstream
+endobj
+6190 0 obj <<
+/Type /Page
+/Contents 6191 0 R
+/Resources 6189 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6079 0 R
+/Annots [ 6157 0 R 6175 0 R 6176 0 R 6177 0 R 6178 0 R 6179 0 R 6180 0 R 6181 0 R 6182 0 R 6183 0 R 6184 0 R 6185 0 R 6186 0 R 6187 0 R 6188 0 R ]
+>> endobj
+6157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.452 695.006 193.621 705.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a81fad4c0c11e6214ddf1851573e56b5f) >>
+>> endobj
+6175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.484 149.098 678.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.596 667.484 183.429 678.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ab02f5557504544356029b3bad5f64942) >>
+>> endobj
+6177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 639.215 180.54 650.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8d7d3ac7c1bf2bab50a5594a41a2f25) >>
+>> endobj
+6178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 639.215 264.653 650.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 611.319 178.239 622.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a50973a7d753dc94afb42a610aa71d68d) >>
+>> endobj
+6180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 611.319 262.352 622.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 514.237 156.281 525.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_aeafa7f136ae6eb82b0b996a2df4c6606) >>
+>> endobj
+6182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 514.237 297.669 525.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.881 514.237 453.453 525.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 486.342 156.281 497.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_aeafa7f136ae6eb82b0b996a2df4c6606) >>
+>> endobj
+6185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 486.342 297.669 497.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.881 486.342 453.453 497.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.528 322.543 232.305 332.471]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+6188 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6192 0 obj <<
+/D [6190 0 R /XYZ 89 770.89 null]
+>> endobj
+6193 0 obj <<
+/D [6190 0 R /XYZ 90 712.265 null]
+>> endobj
+6194 0 obj <<
+/D [6190 0 R /XYZ 90 560.51 null]
+>> endobj
+6195 0 obj <<
+/D [6190 0 R /XYZ 90 472.768 null]
+>> endobj
+6196 0 obj <<
+/D [6190 0 R /XYZ 90 398.6 null]
+>> endobj
+6169 0 obj <<
+/D [6190 0 R /XYZ 90 376.223 null]
+>> endobj
+6197 0 obj <<
+/D [6190 0 R /XYZ 90 376.223 null]
+>> endobj
+6170 0 obj <<
+/D [6190 0 R /XYZ 226.769 307.096 null]
+>> endobj
+6198 0 obj <<
+/D [6190 0 R /XYZ 90 300.122 null]
+>> endobj
+6199 0 obj <<
+/D [6190 0 R /XYZ 90 231.882 null]
+>> endobj
+6200 0 obj <<
+/D [6190 0 R /XYZ 90 161.285 null]
+>> endobj
+6171 0 obj <<
+/D [6190 0 R /XYZ 90 139.093 null]
+>> endobj
+6201 0 obj <<
+/D [6190 0 R /XYZ 90 139.093 null]
+>> endobj
+6189 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F68 3017 0 R /F111 1509 0 R /F91 766 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6209 0 obj <<
+/Length 1980      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�F~�_����P_��ޏ���R�ҖB��0J�$
b)XJ�뻧�
��8r,��� V��껽�o���N#�<��`��D�����N"K#--�
G���nfsF)�>�1:�W���������Yr���<[
��Շ��g�4�Wo
__�f�L�<_d���Q��śE���"[��
���y����Er����Q2�
��S1{}�t��`�n�+���D��h9y��F�x�iD��&z_ZF�
�<�^N���j��O��]��j�5&o,�TF�	b��?�T��eR8�l���:�{������̌�N�83Ez�ְ�Q
fm��"@a�U
͈h��ޖ
o3� �"PJ���ߋb�
|����xsG
�6q(E,�!����Gg��Y\�����suX��ߗ�qq�
�C�37��'<�7HB��O�����*I�Y�)�9��`��
�rk
9�������];gM�U[T���z�U�P�o��$�w3k��"�����a����f��2���,�oV�X,�zŚ��b��E�RDs�	����D�����~�0�-��e��,Em�[d]&j�[�]��9YEJ*�Ё��c����uIVpF�AiJ2^Ӭ�XP
����A1�
�AI´
!�*6��麒ͻ(��
��S��y@��$h��-e��]
�� O� �#�� B
7��م�z���U���1]#kE'�������8T��0����#���v$�A�F�V驡�i\
�
�����_-�s\��AQo%��ʹ G�5:M�� ���80�)�:�sE�W%�n�
-��H�Q6���79 ��O,z@���1k��K���*٨�z���dώ8zeO��
�'.3�� [...]
@lA�c@�H5��
�������DP�%��m������t�y��.��U~��/�[[���ֿg�#.���B��:�7P'�$��K��Iq&C˙����K��9)�:[Q��
ݫ� !( uBb u
+��9�֏A[b�!���
�2xfzz^ư��ե�)[�l6���*J#�H��Iq�J�C^9��c������tX���l�u��f��=M��_t[�d]
�
��� v�gݦW��>�	�e�?�:dm�2�n
0��1~B2�Հ�>dC|�v�f�MO�z ���OUu�|�e���6*H�	�q�ĝ�԰S
�p�JS\��4�]&�1 po�Q a
r#�0
+�W21���"v���G ��(⡏π�{���"0�p�ᲵI{wI`t��G8g����=6,>W��T���@�b�l���ڐ�eK�9��
_r�1v��W��[*O�K�����N[��t��
�6#vxG�X�<0͈Q�
< -�E��Ѝ���a7
���{
:
�P��E
�g�����>�=~ТRl̈�����I9�(���qP�uX�5���
���!�kT���Vqd���E\�
/�V����p,#��5
��.Y��[¿y�c�*�o.ᮙ����ޮ������0�`��
�:��y�ϛ�?�/�ʓ�w3�i���-N/��]Ĕ��d�B��Ę�7n��{��N_&I5�mT_�:)�u�iܔ�uo�(.���/O�$=%Xe�Kؘ
�^�Ⱥٴ�Vu=K��2.+�o]F�#g^{
�y�2�y9�y]~Y������RD?e����5�e
+endstream
+endobj
+6208 0 obj <<
+/Type /Page
+/Contents 6209 0 R
+/Resources 6207 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6220 0 R
+/Annots [ 6206 0 R ]
+>> endobj
+6206 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6210 0 obj <<
+/D [6208 0 R /XYZ 89 770.89 null]
+>> endobj
+6211 0 obj <<
+/D [6208 0 R /XYZ 90 720.814 null]
+>> endobj
+6172 0 obj <<
+/D [6208 0 R /XYZ 211.835 668.52 null]
+>> endobj
+6212 0 obj <<
+/D [6208 0 R /XYZ 90 661.546 null]
+>> endobj
+6213 0 obj <<
+/D [6208 0 R /XYZ 90 581.35 null]
+>> endobj
+6173 0 obj <<
+/D [6208 0 R /XYZ 211.835 529.056 null]
+>> endobj
+6214 0 obj <<
+/D [6208 0 R /XYZ 90 522.082 null]
+>> endobj
+6174 0 obj <<
+/D [6208 0 R /XYZ 453.931 455.261 null]
+>> endobj
+6215 0 obj <<
+/D [6208 0 R /XYZ 90 448.288 null]
+>> endobj
+6202 0 obj <<
+/D [6208 0 R /XYZ 453.931 381.467 null]
+>> endobj
+6216 0 obj <<
+/D [6208 0 R /XYZ 90 374.493 null]
+>> endobj
+6203 0 obj <<
+/D [6208 0 R /XYZ 90 269.227 null]
+>> endobj
+6217 0 obj <<
+/D [6208 0 R /XYZ 90 264.743 null]
+>> endobj
+6218 0 obj <<
+/D [6208 0 R /XYZ 90 196.169 null]
+>> endobj
+6204 0 obj <<
+/D [6208 0 R /XYZ 90 159.988 null]
+>> endobj
+6219 0 obj <<
+/D [6208 0 R /XYZ 90 155.505 null]
+>> endobj
+6207 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6243 0 obj <<
+/Length 1739      
+/Filter /FlateDecode
+>>
+stream
+x��Ymo�6��_�a@'�5�wQ�6�k��]_�&���bӶ0Yr%yI��N"%K�즵3tE ������s/��3w���෋�ɩ�
��J�b���񸏄���s�Ṙ�/^8L*D|	o��O޼�x���x6xv1�8 �;�(�S�d9�|��)
�p0b�r�K���)���9�9�֖�QQ\?�B�4,T>˜;
a��ƚ�!�n�K��tH���vmi�a��yX<�ZV�ٻ2�z���y�
+�G�#}����4A�
�m�@��� ;1�>5p�tw�D$�����i��ȧ^ۊ��
���nN�$5w�"���uE���JN��*H��z�/��������WL�13R-�8��d�E����"9 ��
*T2|LN
�q��
n0a`# ����=MC
O3�
U��xj.��(ȵ�9]Ǔ<Lbs�4���:΃r��-C`hD9��=-"v��쑄�
R��`e��a����Y�"����/�X�g7+H>��Y�Ǔ$��5;K--<$ZZ큑 D5�
"�V7�zL�Pɏc
+��-��m���8*R��R�� �nѱ{������}ˏ��	
U�M�V����!�n��z�(܌Y
_O��T��&!�� _0�,��E ߫�T��I�.P�!,�]�צ%�N�o��uu���T94�Ԫ0��)
+2{i�lo�:.��J�,M�ի�REɐ
+`o<7CP�h��-���"�
+#%��R�
��-u9@��*B��.
i��J+�2�
�}Kbۙ-��F���RWP��D����rS��
Db���\A(bYu���IT��BO�
(�_�8&P���ʵLx^�8[����$��k
O�!
� $?�%
:cLۆ��f�^ڈ�^�;��#�hM�hѠp?�d/��l�:�Q�c�/��
+�㸯L�D@�ڎ�'+1�B��#�|b�N6�΁x0�e��a<��S]��f	`����s�.�ƪ�DXG���6�מb3�=�	k[�<^�4�
T��3jK�4,m��n��rW�$˧�1$,���i��?�����nC�r@��<���")�>�V�0�#��~S	�O�N�mg�g�� =q�S��
+ ;դ��M�郿�ƻ�zp��F
dz[����>
+'&^��N�-n�vk_ds:�tGN7��m�����v�m�SH��d�-�QT`K���oINa�P	*���Y���:Բ<]O���bW���J
��c/m�
{�F�U����ޤC��0��
+������;։��n�
�;"���%�b�á��5��%Y�W���z�y\t����XGD�����vz�/����\,�nٵ,��
�[�n�q���`hh�.}��3�[��`��}���0)��p;��F�v���V��Y�pc_��^�V����x�LlX,��\4�:������}��3Q�����w<1c��O��0
+�� ��
+f����������n��?�T��}����:��*}��8È0Q��CR�G at -��;�u[��_�c�$�l��Lãos)*�w$mC`c��6�';�����G,\�['ZM5�ƯN��a��
+
'A��Mă����������w:}[t*v�D�u�i��<*)�(���Ƌ ���/�a7��W��׸.V�؁��K�<M@�F��6
+���
@�@ܧդ��ڳ����L�?
�p�I� ^Ѱf�=a��S]��*ժ�(���+c�ߵ�
�á�M
F\դX��j|rr��g:��I����˾����C}��L�*+�0�,O��
�/��"
+endstream
+endobj
+6242 0 obj <<
+/Type /Page
+/Contents 6243 0 R
+/Resources 6241 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6220 0 R
+/Annots [ 6221 0 R 6222 0 R 6223 0 R 6224 0 R 6225 0 R 6226 0 R 6227 0 R 6228 0 R 6229 0 R 6230 0 R 6231 0 R 6232 0 R 6233 0 R 6234 0 R 6235 0 R 6236 0 R 6237 0 R 6238 0 R 6239 0 R 6240 0 R ]
+>> endobj
+6221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 354.173 170.687 364.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae7c03963759dfdb937135a7f99165361) >>
+>> endobj
+6222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 324.68 170.687 335.584]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a12f3d0ee3885355092a65262f24d46af) >>
+>> endobj
+6223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 324.68 254.8 335.584]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 295.934 178.435 306.464]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_af0ea51d59b5026db43b2edd4cee928ba) >>
+>> endobj
+6225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 266.441 170.687 277.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 266.441 222.233 277.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_adca809f9ebacacf70bc610d41bbaff47) >>
+>> endobj
+6227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.57 266.441 306.346 277.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 237.321 187.564 248.225]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+6229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.303 237.321 238.472 248.225]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae575efc6c01c4bf9968c7e27bb94951b) >>
+>> endobj
+6230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 208.202 187.564 219.105]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+6231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.534 208.202 241.588 219.105]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a400c02f876d8f4e3f6aef2bfc5fb16cb) >>
+>> endobj
+6232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 179.082 170.687 189.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 179.082 227.852 189.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a192ff11375b59075c9ea19a8c2b5511e) >>
+>> endobj
+6234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 149.962 170.687 160.866]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 149.962 217.61 160.866]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a70e56452f6edfc1943b555156e6bf828) >>
+>> endobj
+6236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 120.843 180.54 131.746]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a97586e332fd16ccf6e7d642bb4bbf83e) >>
+>> endobj
+6237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 120.843 264.653 131.746]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 91.723 178.239 102.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a0ac88c873a13c4afa6f99d3d436e13a3) >>
+>> endobj
+6239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 91.723 262.352 102.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6240 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6244 0 obj <<
+/D [6242 0 R /XYZ 89 770.89 null]
+>> endobj
+6245 0 obj <<
+/D [6242 0 R /XYZ 90 720.814 null]
+>> endobj
+6246 0 obj <<
+/D [6242 0 R /XYZ 90 680.159 null]
+>> endobj
+6205 0 obj <<
+/D [6242 0 R /XYZ 90 655.35 null]
+>> endobj
+6247 0 obj <<
+/D [6242 0 R /XYZ 90 655.35 null]
+>> endobj
+6248 0 obj <<
+/D [6242 0 R /XYZ 90 597.207 null]
+>> endobj
+1799 0 obj <<
+/D [6242 0 R /XYZ 90 510.731 null]
+>> endobj
+250 0 obj <<
+/D [6242 0 R /XYZ 90 503.366 null]
+>> endobj
+6249 0 obj <<
+/D [6242 0 R /XYZ 90 373.406 null]
+>> endobj
+6250 0 obj <<
+/D [6242 0 R /XYZ 90 373.406 null]
+>> endobj
+6251 0 obj <<
+/D [6242 0 R /XYZ 90 342.552 null]
+>> endobj
+6252 0 obj <<
+/D [6242 0 R /XYZ 90 313.432 null]
+>> endobj
+6253 0 obj <<
+/D [6242 0 R /XYZ 90 286.039 null]
+>> endobj
+6254 0 obj <<
+/D [6242 0 R /XYZ 90 255.193 null]
+>> endobj
+6255 0 obj <<
+/D [6242 0 R /XYZ 90 226.073 null]
+>> endobj
+6256 0 obj <<
+/D [6242 0 R /XYZ 90 198.68 null]
+>> endobj
+6257 0 obj <<
+/D [6242 0 R /XYZ 90 167.834 null]
+>> endobj
+6258 0 obj <<
+/D [6242 0 R /XYZ 90 138.714 null]
+>> endobj
+6259 0 obj <<
+/D [6242 0 R /XYZ 90 109.595 null]
+>> endobj
+6241 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F118 2438 0 R /F75 562 0 R /F11 621 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6274 0 obj <<
+/Length 2130      
+/Filter /FlateDecode
+>>
+stream
+xڵY[�۶~�_�Ng1.���؝i
;�ę��ۼ؞
��Jl)R!���_��
)����(6A.���\��`
�����]]��Y��DR�=	bI��$���'#�È`�'�!���^���!œ��.�N����:��77o�R����ϫ:$j��&���ʵ��L��dU٬�sxO�U}��	#*��e�6M���G��!
���A�
K�k&p�&�	
�����կW��أp�bd˫�q0�ϰ7b�
+>�IˀS�"xw��+쵂fh
^G	����h��W�wz�慞�����&����`�"�_K���K9 �����)�U�{�B"&��?���l��^�I�	�����u*���܋�p������﯂�I������	�sӘ��Ѻr�U��3�>�:�EUYl�k��f�F��"l%{��;(�l����?���t���Ӈz�m

��wN���N����7F�a�$l)�T����s�\z��a/ 
+�8��a�V�-|l<TEQ�TL>��5���qUC$5n�nW<���L���ݞ��y��
fH��*���۸��n��F�]h�
<9�	9+��[�&Q3e�I����L
+IP��к��#%��[��~���p�y�zz����[�%R�m�f��%p��~X���v{@Ɖ���� %��y^���a}2
�	������-�o����m7�,�|�,7S��q	�)�f�&>n�0�8X'"������Q<�}λu�	"�o�I$�9
�*�����6K
�oS���u�ܻof+�
~��ɿ�ui4m��YYWˑ�'	�
�k@$��&�I�(c�
8�jU�����^�p��ڣ��2���*-���W5"$x�
+x
���m
	wխ�c=
DbkT
�H���
��
2q�}5��2(���C�P���t�� eV�ˠPQ�>@ah��0��SH��"����Ƥi'��2V� (�C��?-8���h��c(zG
I�{�0b� �#�P�U��XQK{vP�"qpd��y���v)��빀
g����zC
+K�	���a�dW�y,C�&1ℙ�"���f
+�,��1˟�rjy �_o�����,��f4H�Oe�Ǽ^o��8��b���l�g
`�= p�$���
4:�&���J=��ҹ+��������q�%�S\���ӣm�
Q:��j�4���)�cT��!
39���/�T�֭�Oa��3t� -V��{��\���@�^��0�<ab��k��zS�c��m�:d��J/A��t
++/��~�VO�����C�N�Z�#K

	:��
��
+�>���Ġc�)��$O�eiYީyU�|�y��&�s��|S����*&c?2���q$w�f���4<A�ti�	3ؑ��`�VUq^мxq�p�^��fo?��ϗ��{_V�U�b�9`6 Zq|�A1���?��C��=�U�`�(�_�-m�kn��@=ͷ����vK]�hs����o,�ee��j��-
+Q	���.JS/.���eU���jx�$�6���u��2�m�)�ٮY���y�e5#�j�?lO
�
k�f�ތ�ȕ7�/=~346�߿su�I��Gװ1�.�
�5=T,)4�b?^GW�v��D�I��&,�&��HN�|�����
��A٭�8��d
#�\7���Y�&�`
�.�c�,� "	c(Ptx)y�	%�~I �Ĥ6���ʹ�[	���A��)$�
 �\�8ށ���2�cd$�wt�Xl�1�m�ȥBN\�4;���C��܎�X{����[$�ᑡ�}��x�Pp��i����F��ai~`X ���
[��ݍ��(�H��,�a��VFЬC�Ͻ�z']8���ڽ^f��m�.�,J���\�7K�zY��P�I��v
2��n�H��u���f��X�*�Ķ��)���zT+�@wo��ݯ-_�BL����jSj=kkSZg��j=d}��$E1e���d���#+��!�ѵ���7�o��>ܟӲc��E��D��O�L���"�x�N���Ў~r'=�
�����,������t3ot9GY�����Y�㮘u�(���qi+*jC�ե��-��(�W���Ķ�3�
�����B����%
��@ɻ��~��
�
+endstream
+endobj
+6273 0 obj <<
+/Type /Page
+/Contents 6274 0 R
+/Resources 6272 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6220 0 R
+/Annots [ 6260 0 R 6261 0 R 6277 0 R 6262 0 R 6263 0 R 6264 0 R 6265 0 R 6266 0 R 6267 0 R 6268 0 R 6269 0 R 6270 0 R 6271 0 R ]
+>> endobj
+6260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [98.089 665.755 154.865 676.659]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) >>
+>> endobj
+6261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.288 665.755 513.996 676.659]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+6277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 653.799 125.317 664.703]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+6262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 379.801 238.92 390.331]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) >>
+>> endobj
+6263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.89 379.801 270.461 390.331]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a4fd7b6cb64e68a51df8a7f8435e09805) >>
+>> endobj
+6264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 365.967 208.843 376.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_af0b2ceba470bdb52cdf9bafa45e76b4a) >>
+>> endobj
+6265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 352.506 204.042 363.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_ab758d05c4671c852880999550882f33a) >>
+>> endobj
+6266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.954 339.046 222.123 349.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a50728db7969b64c9c4fe14e1da04f006) >>
+>> endobj
+6267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 310.506 177.601 321.037]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.099 310.506 211.931 321.037]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_afd298b0bb1553ae69fdf50038423813d) >>
+>> endobj
+6269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 281.219 209.043 292.123]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a0c5be0f5a6fef022b59c78a41f1fa0a1) >>
+>> endobj
+6270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.38 281.219 332.886 292.123]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface) >>
+>> endobj
+6271 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6275 0 obj <<
+/D [6273 0 R /XYZ 89 770.89 null]
+>> endobj
+6276 0 obj <<
+/D [6273 0 R /XYZ 90 721.073 null]
+>> endobj
+1800 0 obj <<
+/D [6273 0 R /XYZ 90 502.545 null]
+>> endobj
+254 0 obj <<
+/D [6273 0 R /XYZ 90 495.309 null]
+>> endobj
+6278 0 obj <<
+/D [6273 0 R /XYZ 90 398.93 null]
+>> endobj
+6279 0 obj <<
+/D [6273 0 R /XYZ 90 356.491 null]
+>> endobj
+6280 0 obj <<
+/D [6273 0 R /XYZ 90 251.371 null]
+>> endobj
+6281 0 obj <<
+/D [6273 0 R /XYZ 90 175.505 null]
+>> endobj
+6282 0 obj <<
+/D [6273 0 R /XYZ 90 152.899 null]
+>> endobj
+6283 0 obj <<
+/D [6273 0 R /XYZ 90 152.899 null]
+>> endobj
+6284 0 obj <<
+/D [6273 0 R /XYZ 283.294 77.486 null]
+>> endobj
+6272 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+6293 0 obj <<
+/Length 2226      
+/Filter /FlateDecode
+>>
+stream
+xڽZks����_��δ�$X���I2ӺV&�㪱�/�G���)I0 d����� �!��P
�{���{�K��.�ɏg�>;�T,1�H*�����Dq����y�6�Xf�N�Ԉ	_��/�������7���������	�R:���޾��

��`ČN
ܠU�)�����ٿ�p�����	�
 #��c�r�1N?T
\ɴ�/�YN�J?d��u5�w2��wE�*!S,� ƙg�
N�Ѧ�~�b��ҫ�Ѵ^f����C�!�JO�@�g�"���M��駋�Wպ��
�q����E\��ˏ���n�z=�Z(D�$�g��x�?�۲�-f��Ŭ^o�C �d
� �
F�@���
	:
):�c!�",v��<wI�3J�T&�a�����7
�7�@�P����rC��"�S`	��K1ĉ�����)�\�,�	��ʹ���K��>�
+���$�3�Ȩ��.iі[@"I���/N�E��ˌ��c����ʦ�7���ͨ ̘Ϊrݢ,g����6|�.���W��]�s=����-,�^J)�W�t�>�i�e'ݘuݎ��P�~ƎBB��m���Y{t����,IZ6�zV~k�%�=k�b[���
q6X�8D3�O����.�e��%"�����ȯi�҃-�Ò����t-9CD�)(Zr;R<����8:��$�� DG��SXz
+߁�#ߧ��:��|����
x:��4��i��'�������fl��ȚI�h�I���^�^�l��Ð����1–����,a;ێ�����G�f���+�F��!a[��	�ݳ53.L~��D�ָ�pG�_��u��|�����ov�7L�?��@�U�~Y��q�k�D�|��!-�ЉPa�<!LRP���H���y^�:!j$�e
�4��v��c�K� ����$�A911�}�s�(��8�R#8��
+
J6�g0a
x
�<��=��6�]:e*]��D��
p��K�ŜO��б���1[`��-�X���=�oCh�?��6�0�����X�2�&�y��!QS��Ơ(G�2�
����%%&�Gdf<��[��ö�b	4l��bHN��0�ǃG�)��
;1�h���kwE�w�6:20�g�iX`kJ)���� !��  
| �Z��JO����@���=�o���-�km"ߧ�
1ŧ@��-|,F�Պ��5a
�� ��x&@0��g��ov����!'

�@h�}yF�k��ܰ�n.7���F�զ�O�?�!`/�����qԈ[��o\���+�JU\�\�.p�RT O*b�/N�q_ԫMь�
Ѝim�`H	���P�
O�����
P�FC�ёx.�
*�M�h���[�Ҿ��3����O�%;�����tm)�q|4�a��;�Y��Q��<�F�)���{���8	��\�V�ҥB��z��zA��P)�P-������m�y�
��.����Se����"yFP
�A6!�{�K-
.���A�>X�y=�_�h+Z[Bݣ��
+VAQϖ�6\>d�E��+�vɻ��m��@
���em��C���P\�3��rMx.�����Q*�Qos�l�Y���1u�W��^!X5
Q#w�iwD�!��"�`��!��A��A$�L�j��l����M�µ�2�)����C
H��0P�1�q\.k��?%�mn���5��
���B56m&��x�ľc�
+�G�?�jK�]�w����W:�����j�2�O3.0���
��;ȟ
+,G @�/�4��k#
���ޔŷ���K�C�`�z<>��,!�+�����Y�A�CN8G
��vi��תJ�k�
Y_�+�����3.W�eц�_�W�w��'� lOO�A��_�ؼ�����]�����%����a4"I18TH�Pu�T�g��y٩����'
��=�Y�]�v%``��w�'�0"rc�Pi@�������|ݹ�2�*�@��
*"<��G_���^z־�$�G�7]�n\�n|�2�}� +�v���f�Y��]�߸��3˛<Z�T�TP���/{rP������Pg1Q������e�Mxp�ӊ%����\���N�@�H�}�A�2��E���+��m�����K���2NV�H�l������k����A��)�����C�Ǚ�q{��	����hѶ������w�r}�@�
f��ccV���5ժn:���u�Х����d�T
+endstream
+endobj
+6292 0 obj <<
+/Type /Page
+/Contents 6293 0 R
+/Resources 6291 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6220 0 R
+/Annots [ 6290 0 R ]
+>> endobj
+6290 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6294 0 obj <<
+/D [6292 0 R /XYZ 89 770.89 null]
+>> endobj
+6295 0 obj <<
+/D [6292 0 R /XYZ 90 721.073 null]
+>> endobj
+6285 0 obj <<
+/D [6292 0 R /XYZ 200.604 665.092 null]
+>> endobj
+6296 0 obj <<
+/D [6292 0 R /XYZ 90 658.452 null]
+>> endobj
+6286 0 obj <<
+/D [6292 0 R /XYZ 235.732 596.967 null]
+>> endobj
+6297 0 obj <<
+/D [6292 0 R /XYZ 90 590.327 null]
+>> endobj
+6287 0 obj <<
+/D [6292 0 R /XYZ 90 484.727 null]
+>> endobj
+6298 0 obj <<
+/D [6292 0 R /XYZ 90 480.244 null]
+>> endobj
+6299 0 obj <<
+/D [6292 0 R /XYZ 90 399.714 null]
+>> endobj
+1231 0 obj <<
+/D [6292 0 R /XYZ 90 219.752 null]
+>> endobj
+258 0 obj <<
+/D [6292 0 R /XYZ 90 180.313 null]
+>> endobj
+6291 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F118 2438 0 R /F94 771 0 R /F22 2982 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6332 0 obj <<
+/Length 1245      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~���S'�;%��vu�.��{J
+C�eG�.�$'�~�u��Ȯ3]��IE���
��F�g���b��\I�1[.6�$HPb�VƵI0bIJ	�؜Z�^y�E�����*���"�҇��Mg���I�xyo��L���M-�~�Il}�}�����C�R��P��\�1���^0���ǹ�j��
+����R�|��?�͆�(CRR�&�B4�&f��v���j-�
0����7��e�M6g�KM?چ^�3���_�
/�SR�+-u�v6�2" �<H9�2]��
+�?~�1�E��)�oh\�~�v%��<&U
+g��ˠ&����+�
�s�#^!��Dž'�-�/xX�G�BDpC(��C��_F9��bEkX���U�#e����{�!
B��]���5�-UE�\�
�`$V�b�[X�
�%D�:4��e���"B$��1 ��!N)�R��k\�H����~i��Me�'X� .�
+��lC��H{�L�dwA�r �]�t���(��$�M5"���&
�Ӷl<>�¦� ��������=�������r�+%/\� �ml��V�
+�"�:I�A~[�|�
7��wՒ�2�X�j[G+`V:��ѪiR%�[�KUG��8nR�N-F^o_��v�f�
�
�E=
���:�O
NuC� ��ѱ��"�So�ϯ�$�O&��2�K����!Dc�z��%O$/�s�D��'�u��S�<I�yْ��8��V�m!�E��� �c�����7�s�A�S�]���D9\����ssi���<�J�ěc[�ˑ��`<��/��+��Hr�,!�|�A�ې
�u�8
Z�=����
`�y�޾6s�a
x�8��ߏ~���r<���
4��-�H�����`�>�����v��
��-��2�pɭv��Q��_�lL�Ӵ<�~0���Vz
�_�ժP va1"%��>��v^�vY�!�����.
+��_��l�;����h�!.��&)������:
�h�����P
5�W��n��[��H�	yh�mU��{o�Uu�i����N�`���KZ�8��y;�A6p{�*I�E�A~;$�($ubb��nR�]OI���Ԯg��l]7 [...]
tщ
F�i��<ߎ/.�M���L��o�uY��������
_�t[Q�C�c)0)��U4�+&J�
���@���[���
+endstream
+endobj
+6331 0 obj <<
+/Type /Page
+/Contents 6332 0 R
+/Resources 6330 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6220 0 R
+/Group 6289 0 R
+/Annots [ 6300 0 R 6301 0 R 6302 0 R 6303 0 R 6304 0 R 6305 0 R 6306 0 R 6307 0 R 6308 0 R 6309 0 R 6310 0 R 6311 0 R 6312 0 R 6313 0 R 6314 0 R 6315 0 R 6316 0 R 6317 0 R 6318 0 R 6319 0 R 6320 0 R 6321 0 R 6322 0 R 6323 0 R 6324 0 R 6325 0 R 6329 0 R ]
+>> endobj
+6288 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 6342 0 R
+/BBox [0 0 418 144]
+/Group 6289 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 6343 0 R>>
+>>
+/Length 557
+/Filter /FlateDecode
+>>
+stream
+x��UKo�0
��W�X%��$`�!@1`��
�P���aH
+�;�-Gq�G��`$�$�#?ɟ�K�#X�	^7�
^�<��p�Dx�=��~�?
+��~��G@��V���z���m���~��P��Kh`n9)�g3��
.��+�u�c�~/�,:�tJ)�����;H�^�ml�9u[��)�A�ɍs��l�X��Ѽϖ�
mY�Usc�̤1tYB���'��Ѯsc{��8q��L���ɥ4��L;���-�aj���XM4��k&��Q
5����Tr�p�m��l�v2��z��*�9���v��P���ɕ[8p-�����r�rC�8�r�L{,��u�����y-g7F���
^
aG�d2\ �u�Mõ�hN�6��yɪ�k.핗�p� m�����b�.ˑ?){�)�H
U�
�lK�-�u��E[.�f�������ΎD��%���Dgx�]hgu��-4_����
ꤴ+zR�u����&i�ϱ��o��1���h�N���ؠ}���N>���o�E�7d���F-�E,#�ޕ�����#��
c��$
+endstream
+endobj
+6342 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+6343 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /CQCQQV+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 6344 0 R]
+/ToUnicode 6345 0 R
+>>
+endobj
+6344 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /CQCQQV+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 6346 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 556 500 278 611 556 667 500 556 584 278 278 500 611 278 584]]
+>>
+endobj
+6345 0 obj
+<<
+/Length 6347 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0E�|���"�L$�T�}��`�!A*�2d����Z�T�D:��aN<�}i������
�V���n%�����x��(�@�[N�D�+�e����
�5�?]��vc�g5��1��w�Ȏ��ߗ?uwc~h"��$j�hp�^�y��[��qݎ�����f���9F����IV�+Eu➆Ճ{�����g���MX���IR$���S�A��*���@� *��@tB�3���ԃr��.
+Y�B�0��)�x��
��@�B��>�����@��1'�_
��r�e���/
�r8p�U�}�+�,�KC��G�J��헻o�cs��Z�4~]���{2jzl���^�?�ق��
+endstream
+endobj
+6346 0 obj
+<<
+/Type /FontDescriptor
+/FontName /CQCQQV+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 6348 0 R
+>>
+endobj
+6347 0 obj
+357
+endobj
+6348 0 obj
+<<
+/Length 6349 0 R
+/Filter /FlateDecode
+/Length1 2588
+>>
+stream
+x�UV
l�������Ib�j��8q�N�?(����N
�$�����yT�M
+�Y�eCL�Z(��[;Q�!mӴne҄6&UC��4U��m����a	�h�����1d������s���w�c��8s
J���u���e�w����΅�Y|��[���?��|��獣C��B�ri<qtq�i�I����2={(����\�|*[���r�!c���8_e
+���UWf�Y�V�I�u��^�ɻ�7�)�e����A]M:���2���m�&>5?ts�
�
bﵖ@��W�̋7����Z[�gU�5n�V�܌齂�d��Ϩ���˥��n��h���F���
��Ԥ� 6��̴�**U�h�Hfv���X}a������Uᶁ�	�����.~P��f�U�D:�����\M�R�.(0�+
N�]UQm���A �
U|ڂ6��J06��2SS$�)m��6���I�.׎��ӎ`��
+��Ж*�4[v|�G{OI�
�)�tw�F�Z�3Uq���*TS���)�/��^��+�[�oN>��0������?Xv���cir�D��ŌPź	�<��Dm0!
����O<73wby�=jo���-���s�)�|O�j"1
��l�2sQ�?���)吥1C�N��]y�(�H���B�ө�����|��`[v���ȵ�/No	�ͅa�#�Y
+'�
��h�"��X�+-���p�,���@�������_��,�i�ʱV�3�X
���2��
|B�Î٤�J�:'q�,��I[$������	�|�Q\!;E����Y�:���y�o�}5\�t�?�g�?s���l
ټ�
�f�n?D�����{��c�ӞWZ#���PH«mG�k/����r��sCó3C�Y��q#�$l�F���wc�Rz9k�ꯦ�����h��
�����^`�
�
�/1N'�
)��F��Qν�ǧ���Gvn±��'� ����{����p�����\ʦ����[ymi]=��q�G��r��X�
~SB^�nP 
[-��x�n-�U8uΎ���գy����V�u���3
u:w�
�u��w�[oO
?�SY�G^�����w�m߮���.Wcp
���&�(
��)q�K���_
+�Q
+�:�%d
���Snn�m�B�Y����b��t��r��B}�
+�/
���T�s��d�M-
]���Hui�M�׷�����INr�����〔NB uny��#��zK~ny�wGG�k[��
+��vMu�m}�%�� �oA
3S�#�o���0u���վ��T~����_!�`̜f�G�r�tZ
+R
+p8�f~>>~l|��g�s�kxF�D�|���������+������U��h�⪡�3��đ�X�=�q>fKqJ���~����#�ӷ�������t�V�#��V�����'P�/b'_��OG������_�l��WS|��ϖ��8pZ���=���K�&b�/�t��?��F_?u�BP�ÿ����
�q}����̸����4�y���o_�tơy��Yw-��˒�*�4�jS�h�J��(��~������}��ȧ�n5���]^�O�/��}}��O&�oX\����G��l�SS�����I;����\�ג�*��<�"��
\�N{�b�Bn
���͔��j��sw{2��%��!-k��_n�帤�J�@jx��e!SZ�v98�򐽭؁Dfbf��Q�$��ml;KY����#7����x��
�����)�~��X���,����>�V|!~�U����]����~���l����x
��
֦hb�&y
r)����}f�7�XJJ��h�db3���)�C�r?�!�� �t�
�d�1�q�eALj�~�6���b���UBQޕ`G������h�(�V�
�������J���WpGÎ
+vT��F*ԍ(���x˩�L
���ѡ���Y��s��t�\ z\�37@�`��Y�%C
+endstream
+endobj
+6349 0 obj
+1949
+endobj
+6289 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+6300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 492.208 224.395 503.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 469.274 189.925 479.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+6302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 469.274 260.898 479.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a20a1a23e17edcba771385da4510f4786) >>
+>> endobj
+6303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 452.882 422.545 462.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 426.856 224.395 437.76]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 403.922 232.982 413.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+6306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 403.922 347.013 413.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aa272377eb99f1a8b4b48114da9bc6051) >>
+>> endobj
+6307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 387.53 389.11 397.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 361.504 224.395 372.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 338.57 254.671 348.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+6310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 338.57 390.391 348.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a8669f7f8a54a22c294c94b36106edfb4) >>
+>> endobj
+6311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 322.178 465.458 332.083]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 296.153 224.395 307.057]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 272.242 181.207 283.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+6314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 272.242 243.464 283.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a017b50a53d3f73e61cb5c9d787cb1907) >>
+>> endobj
+6315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 256.826 420.593 266.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 230.801 224.395 241.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 206.89 159.628 217.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+6318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 206.89 200.306 217.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a79a27720fc3f7a3e989f10ebdb6b2800) >>
+>> endobj
+6319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 191.474 400.176 201.379]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+6320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 133.721 169.81 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a2455d0df0fa4e1bf0781207fae5453c9) >>
+>> endobj
+6321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 133.721 309.485 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+6322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 133.721 514.653 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+6323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 121.766 227.553 132.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+6324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 91.906 169.013 102.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a379f606d7220b4f02d8f3ac069ac4774) >>
+>> endobj
+6325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 91.906 323.722 102.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression) >>
+>> endobj
+6329 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6333 0 obj <<
+/D [6331 0 R /XYZ 89 770.89 null]
+>> endobj
+6334 0 obj <<
+/D [6331 0 R /XYZ 90 521.955 null]
+>> endobj
+6335 0 obj <<
+/D [6331 0 R /XYZ 90 521.955 null]
+>> endobj
+6336 0 obj <<
+/D [6331 0 R /XYZ 90 456.867 null]
+>> endobj
+6337 0 obj <<
+/D [6331 0 R /XYZ 90 391.515 null]
+>> endobj
+6338 0 obj <<
+/D [6331 0 R /XYZ 90 326.163 null]
+>> endobj
+6339 0 obj <<
+/D [6331 0 R /XYZ 90 260.811 null]
+>> endobj
+6340 0 obj <<
+/D [6331 0 R /XYZ 90 153.137 null]
+>> endobj
+6341 0 obj <<
+/D [6331 0 R /XYZ 90 109.961 null]
+>> endobj
+6330 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F67 3022 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im7 6288 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6358 0 obj <<
+/Length 2669      
+/Filter /FlateDecode
+>>
+stream
+xڵZ�r��}�W�)����1㤶ʻ���Yo�Xy�]*��$֒���(_�� �h��"����}��t�4��h��ُ�g/�
�Yb5���mfiVHK�����cΩ�|��%�f5��.����.��v��<���-�1/@��d�����4��˿d�k���e&������ٿ�h�e�W7F%ap�`�0�W�f��5�z3�rE�ru��T��2�}y�i_� ReSΈe���ĹJ^�;[߅-�����TQ�W/W����.����ꢞ����>���f^�9��,�D����p�y~]oW7���y|���,�	W��j}�
}1�
+K�'%�C�
��dS��Uʛc��� ���2ѨV»Vk��
5�Ziv<�)t�u���ʛ����P�'L��j*8�����k<�4��7�`s_��Y��R�
�7��
+%�[&�ȃk�#��Ty��g%���9xu��
�L���nM�N�>�OO�ͷ�,Wc+pM��q���GЌH
�o��y���\l�pm��{[)��������r�"��� ���Ϗԫ���}���ಧ��!�-����d�X��3���/5h�c�<e�]Ȁ�‹�1���8��m�F8�`��Q0��}��
:x�
+��~
���E�pf��&�p�wa&!tO
�d+��M�����֛��x� P��*���:��bM�y�WV���2�+����ַ��� R�P�ż���ͼ%�������Z��W8}_-�1
�|������\!�\�V\f�b
l��"J�g��C34�a�M�|X�M�ۙ�TgEt����>a�YAr�
+��_�f8*�8%��
�ڶ$‘�daf��:Q�߽[a]����+3�]8�.\�pVÊT�ˉ49V]P
+6hy�U0l-N���DB:O�:��˲�//�6*��;C�.���o�b�e^���
�� ��S�H�-d�dG��z���x_ݬGT��Ɋ�B��	�j���z]:�=�zՈ�&�I���0a�
�q:��5��9�Z� J�@�z֟��A*� �+3����i��YJB�<�� yҖ[��'�
?��F��`���%(��)4�%�����ec4%)HI�4j(I���?%a�IJ�O]!�)�����kO��ۙ?�)!n1f��EG�:t��sX��>#��0��cYu6v��;�
(�?;�����lA$�ᩄ�͊=,,��KG��g>_sûB�n��z��sG��kO,���r NyuZˁ�H^�u��V�{�5�Òqq�;
���<��o�
�b�`�
؝F��
+W�MP6E2��T��[
+������-E(���-�p���f?
+3*p�5�[�+��ĭ��^�;v�s/���oP�����5������@z
BC�z�����e�!��z���b{(��k���hi�s���'6
q���ǥ3
P�E��(<�V�O���bbh8���+��]Yr��d�p�*��y
����I�*.7�t
xm@����_�.�C�����]��p��	R
�L����Q�8�zI�[�a�B���:�:�6�G��B#D����6�Ab��/c� Y�-�e��$B�-�n�2�[ZӪT��`��pЎ�P�8g��n\���&X٣7�/�� \n���n���W��b�	p��&��Կ1��ChM�:�3��1}��C��OO��Y�o��v	���N2�o���%��a��,�ng�%,8c��ș��<�
�pzE~4sS�H�O���DR�j�17��
��
#��V�Z		�{aR��.
���E��u
"?�(`��&B84�l<
Mp�,�Dnb4a&��; �5J=�;H}�y�y���9�j�, P<By6�8��k��I4 g+�*0�
�C�}��@�Bc���A�q�8�իHpC��N'S�Y��e��?%�!'Ư_�p�ׁ^}pSD���
+�t��=��%n+)݄�y�m��@��3��O�b
+?�Y����8H��\��^��2o7$�g5���ϕ'�W�X����IMxWğ���v$#B�5Ф��\B@!-
6Wj���v
1�Zݯ�Oo���qO.���g�/���ߓ�6FP7ڋDr��(�<�0o�1�#��}�$}���m��|���8U9�
j���
:�!9�7
u��
���G�L�Ro�-ү���
�ڌ�7|
qH�
hg�j�v]��e5� U�K����2 at 2��~-X������oƨ�v���G
j?ԛy3�w<�}�/��HG*a�|��$]a������3S ����4��CO�+�}e���
<��9��l
h�)ә�l[f��s�cd�4��[U��'
tA��`��>���g�n>���i��Yd߯�^O�D�p�:��cQ̞9�T�"3$cK��y����e�H���<<߭�^_�DqX�7���
x��2�N
�
��Q��{���P-�����N_�:��f�ǟd
�tb�[ٽ.�;����n��"
<Tpq��{/oT�}*�T��(���?v7�;���wK���AX'n
+�����O�4ta at g�3��/.~���T���-���j�v��
�;�	��i�b��T M�Pş�y�~oU�Ǚ#i=������M�������ݦZ� [�
�{�&-�f�^G���
�|�����r
+endstream
+endobj
+6357 0 obj <<
+/Type /Page
+/Contents 6358 0 R
+/Resources 6356 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6220 0 R
+/Annots [ 6326 0 R 6327 0 R 6328 0 R 6353 0 R 6354 0 R 6355 0 R ]
+>> endobj
+6326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 686.039 275.987 696.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_afaea5e43dc4ba9daa7b8cb9f3a221da9) >>
+>> endobj
+6327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.546 686.039 367.304 696.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+6328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.238 686.039 513.996 696.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+6353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 637.222 275.987 648.126]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a5de206a495a44970b2dcd4b769fb2ef3) >>
+>> endobj
+6354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 611.319 283.736 622.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a10111aaf9879fb501147e3d8d51d215b) >>
+>> endobj
+6355 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6359 0 obj <<
+/D [6357 0 R /XYZ 89 770.89 null]
+>> endobj
+6360 0 obj <<
+/D [6357 0 R /XYZ 90 703.021 null]
+>> endobj
+6361 0 obj <<
+/D [6357 0 R /XYZ 90 652.49 null]
+>> endobj
+6362 0 obj <<
+/D [6357 0 R /XYZ 90 626.587 null]
+>> endobj
+6363 0 obj <<
+/D [6357 0 R /XYZ 90 562.502 null]
+>> endobj
+6364 0 obj <<
+/D [6357 0 R /XYZ 90 562.502 null]
+>> endobj
+6365 0 obj <<
+/D [6357 0 R /XYZ 90 499.851 null]
+>> endobj
+6366 0 obj <<
+/D [6357 0 R /XYZ 90 256.696 null]
+>> endobj
+6352 0 obj <<
+/D [6357 0 R /XYZ 90 232.262 null]
+>> endobj
+6367 0 obj <<
+/D [6357 0 R /XYZ 90 232.262 null]
+>> endobj
+6368 0 obj <<
+/D [6357 0 R /XYZ 90 120.181 null]
+>> endobj
+6356 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R /F8 802 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6413 0 obj <<
+/Length 1789      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~��0����!)Q��u@�6]��MS�aH
+C�iG�,��$M���
��[V�&�ؓi��s��w���Ұ�|��l�w�M�E�Mmm��\�q�Ĕ
�T'�Ԙ��~l�{�ڛ�qx}!�7?
+�/���Gi�xA�Sʰ�$��T
O�R$qt��3�Mt�]������l�aB@"�%C������=����r��vULZk5�7��N�Lp�L��(�C�S�蒖���0�4NL�ZJ���I�����j� �]m
+��4��,Ʌ\�w`��Tj#
K��I�RY"�j����q�
���
���j��ɔ ���~K/L�N5)2�[͊��*H�SAl��ֶ6�Y:��=���s
��I�i�\Ɖx�a�܄^�R%.ս�
��}(f�4�&"��lH!�̮�X����M��E��L�L
+rd�ҭ��M(�"�*�J|%�h'�'�i�ױT@{�a
jE+x��?��IS�g!*!
���`����m ��Y+}p<?�2�\J#y�|f8X�ވ�JIx} e�A�l�<BMd��6�v �;�#�jfi5
�ᄖVc�ݬ�"�si=o���E�*WA�V"�
*W&��e
�
+
`^��
c���
�82
�c�2��(e�Y�S
�ل��B���@A� �1*�1�v5-dk��U�b�����8���Q*
^SUEF-9���q�8h�K
&~5�
�e��~D�0���;"(�SG�;ujb�!��u��>���/y�t�Y
�̈́%�|Ƚ0ȮK)�„��z{l����S�a�A�L��~�v��J���>&C��z�����	�{-m@�آ���s�_�ʜ3�r$��E].��"�Je�CD�z�+�鯖��
_��ͻ�G��?{K����^�~�vvr�d6?|��[ܴ����c��
0�mQ@�mI*��V�
+�" �4QW7��)Ѹ���J2�#��B���I4�߃��y�P
+p�e�rD��݂��F3�Q����Ҫs(�����g�W
�<�C�?M
 l(���̞���:H�n�0����@J�!���o�U%u-e�@i��-��t%�E�K�>��/��G8ہ���xj��@TH{�
.�u	�:��O
�^-Q,k�����Nz�/
O�_�gi�jUq٭��Bԭq���5�#bomvo�&<��
�ڨ#$���zb�4�i�`���c<qOŒs��&����uS� ������u�\����	�<�@���P7�E UuA�َt�n<_�a�ݢc���P���J.Eu�
>�W>���
f��fWɦ�9�X��@
?�;�(*�#��ë$ߺ��
^��1�A�����2b�ӫvE�B�w�"�b���Pk�n���WC5F���av�7��/
+��ܿ"�'�a��:���͡|��k��%��Dmr#jk�V�R�U}�^�5OWT7�a��9ʛNc�Utwk�cs ��q]�ʆ�
h����]e/�/�b�"RqCp��E�w
�}D���=K���m���\�;��=�?�
Pq��Nb��Ɲod�7�I�{��<�
�*Z�Q%�-.g_��F���QU at j�7����ʥh�B�2iF~���?@N��xs�n���K��f;���;�L�m�5o�Q�h� ��`
�#�
���#5x���g�1���K/ʫƒ�ӥ�HcD��
�?dLM�v�8���/����C���1����|�e�����|<�B~��sK���[�Qg
'�j�-�oN5݀5+[2,�����#L8�Ō��xY-,�
�M�i
Fn���
��m
+endstream
+endobj
+6412 0 obj <<
+/Type /Page
+/Contents 6413 0 R
+/Resources 6411 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6426 0 R
+/Annots [ 6369 0 R 6370 0 R 6371 0 R 6372 0 R 6373 0 R 6374 0 R 6375 0 R 6376 0 R 6377 0 R 6378 0 R 6379 0 R 6380 0 R 6381 0 R 6382 0 R 6383 0 R 6384 0 R 6385 0 R 6386 0 R 6387 0 R 6388 0 R 6389 0 R 6390 0 R 6391 0 R 6392 0 R 6393 0 R 6394 0 R 6395 0 R 6396 0 R 6397 0 R 6398 0 R 6399 0 R 6400 0 R 6401 0 R 6402 0 R 6403 0 R 6404 0 R 6410 0 R ]
+>> endobj
+6369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 648.394 501.708 659.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+6370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 475.312 160.207 486.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) >>
+>> endobj
+6371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.977 475.312 220.321 486.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abab5b32713c840499d9e29facf95a17f41) >>
+>> endobj
+6372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.31 475.312 347.045 486.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abac1539389d3643cf986ef5bb99697d1cc) >>
+>> endobj
+6373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.034 475.312 452.19 486.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6aba7491a8ba26958c3e27bed23b7eef1a7e) >>
+>> endobj
+6374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 435.801 201.399 446.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.137 435.801 253.82 446.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0d23bda1485bb810ad2b6745d067dc6a) >>
+>> endobj
+6376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.491 157.417 377.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.232 366.491 222.99 377.395]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.424 366.491 323.402 377.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) >>
+>> endobj
+6379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 339.31 157.417 349.84]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a36a0c8ccab7923610bd27f637af63e1d) >>
+>> endobj
+6380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.754 339.31 228.26 349.84]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 311.381 157.417 322.285]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0e0942b92b2f099b4ad4897d2b986dea) >>
+>> endobj
+6382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.754 311.381 228.26 322.285]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.914 311.381 311.557 322.285]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 283.826 157.417 294.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae3674890a93b407b8080fdd7ea85d93f) >>
+>> endobj
+6385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.754 283.826 228.26 294.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.914 283.826 307.671 294.73]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 256.271 157.417 267.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a660c04b4c90264ea97b3367acb01e8a9) >>
+>> endobj
+6388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.754 256.271 228.26 267.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.914 256.271 311.557 267.175]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.646 256.271 421.404 267.175]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 228.716 157.417 239.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a50213d8479884e1f0d7fae1c4f817943) >>
+>> endobj
+6392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.754 228.716 234.885 239.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+6393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.52 228.716 319.278 239.62]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.713 228.716 419.69 239.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) >>
+>> endobj
+6395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 201.534 165.165 212.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac7bf9d127644aa14a09eab633e87f544) >>
+>> endobj
+6396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 173.606 175.668 184.51]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 173.606 234.596 184.51]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a8d9338b98f6d33e111c0c0d70508b4ee) >>
+>> endobj
+6398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 146.051 208.395 156.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a097e454cd31f0dddb7e7a7ceab1a2511) >>
+>> endobj
+6399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 146.051 273.968 156.955]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 118.496 157.417 129.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.156 118.496 208.963 129.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9dc926136daee1f47975434ee45298ec) >>
+>> endobj
+6402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.3 118.496 279.806 129.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 90.941 179.554 101.845]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 90.941 250.666 101.845]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a3c1dcd74ba0b2509f45aad45a5d922ce) >>
+>> endobj
+6410 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6414 0 obj <<
+/D [6412 0 R /XYZ 89 770.89 null]
+>> endobj
+1801 0 obj <<
+/D [6412 0 R /XYZ 90 599.562 null]
+>> endobj
+262 0 obj <<
+/D [6412 0 R /XYZ 90 592.435 null]
+>> endobj
+6415 0 obj <<
+/D [6412 0 R /XYZ 90 492.138 null]
+>> endobj
+6416 0 obj <<
+/D [6412 0 R /XYZ 90 464.846 null]
+>> endobj
+6417 0 obj <<
+/D [6412 0 R /XYZ 90 385.315 null]
+>> endobj
+6418 0 obj <<
+/D [6412 0 R /XYZ 90 385.315 null]
+>> endobj
+6419 0 obj <<
+/D [6412 0 R /XYZ 90 300.916 null]
+>> endobj
+6420 0 obj <<
+/D [6412 0 R /XYZ 90 273.361 null]
+>> endobj
+6421 0 obj <<
+/D [6412 0 R /XYZ 90 218.25 null]
+>> endobj
+6422 0 obj <<
+/D [6412 0 R /XYZ 90 192.421 null]
+>> endobj
+6423 0 obj <<
+/D [6412 0 R /XYZ 90 163.14 null]
+>> endobj
+6424 0 obj <<
+/D [6412 0 R /XYZ 90 135.585 null]
+>> endobj
+6425 0 obj <<
+/D [6412 0 R /XYZ 90 108.03 null]
+>> endobj
+6411 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F66 3165 0 R /F67 3022 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6474 0 obj <<
+/Length 1942      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�8~���S�j����b���tљٙn��}�

EfbtqE9��CR˖o��.�"@�H�
��;7��ν����v3�x�3'D!�ܹ�sB��n�<͝�cJ����
�DB���_~����k�n����ӈ�+�;��������߱3��?8�0p�L��q)��Ĺ
�k�+Y�L
��D0G.

�D��7J=3y���8�0
?N(
�r^����hL+���L-�X��2��y�9�n���΁�M�Y�Z����0�6�ΔPD�;�r�&���������2�
+�&�kz$��
sx������m�: �]
<���4�"J}���h�&f��A�/q.�&$��aK��U��n��c%�Q��[tm6�`���#��:�0&u�(���!
6�
��qPG�R�1j8�0�y��ǧi>!
P
~��)û����Z�}��N{�J=��[�`��
+�(I6�V
K�1���h��+&�7��-2�B
��Hf�hj�3�(�ey*,v����Ң�yQ3sM^�C�
���e��"��}v[��\
� ��n���
�U�_ʼn8�S�2��{�=��xlu��*�–���$P�<�3�po|��s���w6�����<;e�%�V�����(�E���c�
+S���=Xw�8@7����6�R�DJ�G�

��(�ݡ��T3�i%�\�I�=*b�(�,��OG
��qu�2p
�-DY���dX��ʏ�*8�UW�:\e��Q��^�x��
��^Z�5A��Ν.C+UH�*E
�
W���Y�gS�\��ܤȌ�0���uX�&�ǰ�ܨ�� �"p_��ꭦ4��E$Kuyi���N"��~NěüD2����
A7U�b
����{���-�Y�BD�?� �#�鞏pxVj��!O�{��|�f%�^gJ��Z1����eũ�h��$�4D�Oϝ��bP�?�NJE������u��z)/�dV����vU
+u��r�I�T�<���v�e����r�����)��w���e
/���]�0����=��27sV
+
d��Ⱦ,�m�g#�FY��>�I 
x��2�o�⻌�e���2��o9���d�>
�VmM&�1�[�E�S����Wݓ�}�"MfZ��=�ٷ��Vty
+�D���J
�;{��.��s�+�"�k�w����p��q���P��E�i(
�}�S��N���
�!�u2l�F��m�R��A�u�댹gx�8��}��
�,Sx ��.�������A���������a�6��F at sa�cf**���'
 zC
 F*�r6_��V�
+�
�����(�M�kΘcQ}�ˆ����A�z}���ju��
+x
�ͳ=�y��?i�x��C��
���5(�j����
�XD�68��X���`���|����Ӡ�P}�."�
>��Ӥ��y�#X*���
��v�-_�"jn�p]~�p�޼�N�"����
�q�Ѭm'y4�k۲Ƕ�����=s�^a����k�>e
��!k��t�UC3����ba��/c�	=oW{�=Z��q~f�(}U�
4ܶC���M�aB%z
�a�B
a!S�)�[9�����87Bρ�P]xP$N���}���Ѳg�2j�B��e�w�}�bmI�3t�h�����T��=p#����鬾�z�y�Q5�g]2�q�
"e$
��d��[%B�
�I��P߶{�V��4^'�3/
+����CEH}k,*JYF�+�J�Ș͎C���Ѣ�V`��!�
+nM�?kG������x�ڳ
y~���#/47�?�0��7~־��u���Ż�9�a�v�)�7m��կ��{�
i=�Q�M�����_~U��N{�J���e��:{�PM�G���e�ᵨ9ce���G��^���A��rqyqq����s��<���Z�"����@��ES����D�- ��~�h
+endstream
+endobj
+6473 0 obj <<
+/Type /Page
+/Contents 6474 0 R
+/Resources 6472 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6426 0 R
+/Annots [ 6405 0 R 6406 0 R 6407 0 R 6408 0 R 6409 0 R 6435 0 R 6436 0 R 6437 0 R 6438 0 R 6439 0 R 6440 0 R 6441 0 R 6442 0 R 6443 0 R 6444 0 R 6445 0 R 6446 0 R 6447 0 R 6448 0 R 6449 0 R 6450 0 R 6451 0 R 6452 0 R 6453 0 R 6454 0 R 6455 0 R 6456 0 R 6457 0 R 6458 0 R 6459 0 R 6460 0 R 6461 0 R 6462 0 R 6463 0 R 6464 0 R 6465 0 R 6466 0 R 6467 0 R 6468 0 R 6469 0 R 6470 0 R 6471 0 R ]
+>> endobj
+6405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 707.957 220.579 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a85ca415a40fbd066ad850e26b1fe1653) >>
+>> endobj
+6406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 707.957 290.038 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 695.723 233.76 706.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae73aae9c2283b936cdaf92e13ab5d727) >>
+>> endobj
+6408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.575 695.723 272.763 706.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.205 695.723 323.393 706.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 669.262 243.165 680.166]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_afbee4abe5b3b83f47971e19f47f3bb53) >>
+>> endobj
+6436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.502 669.262 327.278 680.166]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+6437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 642.801 246.034 653.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_accc738986aa1e74d232da8c9cc10966a) >>
+>> endobj
+6438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.522 642.801 360.71 653.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 616.341 231.1 627.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a405f3dfb1b620defbadb0b2f103b8f28) >>
+>> endobj
+6440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.915 616.341 270.103 627.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.916 616.341 345.559 627.245]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 604.107 135.579 615.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) >>
+>> endobj
+6443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.077 604.107 155.225 615.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a239b0622fbcfe1638b4246deab2caa29) >>
+>> endobj
+6444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 577.646 179.832 588.55]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a745ac1cdddf74c6f387cfbbbc566dc78) >>
+>> endobj
+6445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 551.185 187.583 562.089]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab6976f576e6e50941ee7a7b1a737c0eb) >>
+>> endobj
+6446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 524.724 227.433 535.628]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab3186208850238a080373f035cd532cc) >>
+>> endobj
+6447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 498.264 212.489 509.168]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a442aecbe0ce384a7c1add146fb125ed6) >>
+>> endobj
+6448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 472.176 297.728 482.707]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2679da4dbd5b8c33ef607aee49690c2a) >>
+>> endobj
+6449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.544 472.176 336.732 482.707]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 445.342 342.261 456.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9960963fb1f8fb56631e0402557065ae) >>
+>> endobj
+6451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 418.881 191.718 429.785]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+6452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 418.881 288.852 429.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a78c24741e21a4406ea8ad1588c768147) >>
+>> endobj
+6453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 392.421 191.718 403.325]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+6454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 392.421 303.079 403.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0ab383f3930179982937f7733a283a03) >>
+>> endobj
+6455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 365.96 194.776 376.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a29202eb817eb5c9d59433abeeb4f2eea) >>
+>> endobj
+6456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 339.873 195.334 350.403]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_aea0fedb82a525e6ada13cd7fd2d03225) >>
+>> endobj
+6457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 313.038 201.471 323.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) >>
+>> endobj
+6458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.808 313.038 272.314 323.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 286.578 182.044 297.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_aa8a21b3b30b29ca087ecc032d1a3f922) >>
+>> endobj
+6460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.381 286.578 252.888 297.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 260.49 150.493 271.021]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a6742bd7f3f2cb079b96900dda0147940) >>
+>> endobj
+6462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 233.656 181.845 244.56]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab0f18894c8f97fa0cd38736462f36132) >>
+>> endobj
+6463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 207.195 181.845 218.099]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a7bdaff085ea6859cdec9b27bffb6de4b) >>
+>> endobj
+6464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 180.735 154.727 191.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a93d5d6abf06ec551294c4c18abb4349d) >>
+>> endobj
+6465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 154.647 176.505 165.178]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0d50a5df6b31c6de90fe366e18e750ff) >>
+>> endobj
+6466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 140.37 450.955 150.276]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a7bdaff085ea6859cdec9b27bffb6de4b) >>
+>> endobj
+6467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 116.854 169.013 127.758]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a1e7682395739069fa5bee820540b2bd3) >>
+>> endobj
+6468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 116.854 216.335 127.758]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 90.393 155.594 101.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0d23bda1485bb810ad2b6745d067dc6a) >>
+>> endobj
+6470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.092 90.393 200.545 101.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae5339ea3f93440d6815df903f304e36c) >>
+>> endobj
+6471 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6475 0 obj <<
+/D [6473 0 R /XYZ 89 770.89 null]
+>> endobj
+6476 0 obj <<
+/D [6473 0 R /XYZ 90 711.942 null]
+>> endobj
+6477 0 obj <<
+/D [6473 0 R /XYZ 90 659.344 null]
+>> endobj
+6478 0 obj <<
+/D [6473 0 R /XYZ 90 620.326 null]
+>> endobj
+6479 0 obj <<
+/D [6473 0 R /XYZ 90 594.188 null]
+>> endobj
+6480 0 obj <<
+/D [6473 0 R /XYZ 90 567.728 null]
+>> endobj
+6481 0 obj <<
+/D [6473 0 R /XYZ 90 541.267 null]
+>> endobj
+6482 0 obj <<
+/D [6473 0 R /XYZ 90 514.806 null]
+>> endobj
+6483 0 obj <<
+/D [6473 0 R /XYZ 90 461.884 null]
+>> endobj
+6484 0 obj <<
+/D [6473 0 R /XYZ 90 435.424 null]
+>> endobj
+6485 0 obj <<
+/D [6473 0 R /XYZ 90 408.963 null]
+>> endobj
+6486 0 obj <<
+/D [6473 0 R /XYZ 90 276.659 null]
+>> endobj
+6487 0 obj <<
+/D [6473 0 R /XYZ 90 250.198 null]
+>> endobj
+6488 0 obj <<
+/D [6473 0 R /XYZ 90 223.738 null]
+>> endobj
+6489 0 obj <<
+/D [6473 0 R /XYZ 90 197.277 null]
+>> endobj
+6490 0 obj <<
+/D [6473 0 R /XYZ 90 170.816 null]
+>> endobj
+6491 0 obj <<
+/D [6473 0 R /XYZ 90 133.397 null]
+>> endobj
+6492 0 obj <<
+/D [6473 0 R /XYZ 90 106.936 null]
+>> endobj
+6472 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F11 621 0 R /F68 3017 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6562 0 obj <<
+/Length 1454      
+/Filter /FlateDecode
+>>
+stream
+x��Z[S�8~ϯ�Sמi�$[��,��v�N�m�v_��1� O}Im'-��{d���vb�I�偱��r�w�s֮4��5��t�wh���\N�vz��X�-1oS�L'����~d�{I荏
��8������//���Gi�x~�Cʰ�2��T5�ťH
��"��ϴ9�)!Ƈ�7�W��Oa�(	�
m�>`m
+��h ��h��N�fQ��v2�g�
e0�L6�P�%k��Q��d^�O@:��G�
�փ���/@ڼ}8�&���VkϽC��� 
Y���@��u�)e+c��!4S���E*�\
�}$jS?Q
+�����X��eL�}�3o"�����e�s�0���\Ks at -nI��:Ն�B���:�<�
+�f��(���y�^r!�U=ԫ�YkE#�0=�R�����ڋ���]�J�5�
+
(h`w2L>�"'�?�,�����W�+��^W���=���#?ǘF�+��<4,�����]�d_�������_EK�
_��4H����y��j�4�w�� ��7
��f���5+�8�ʼnc#
��ja
�
��׉�*-A
Ӳ��qPoKߝq��e���n�ӒY2��1�8f��Tg������Z
ӸȦN٧���RM�HA���(�\����9�
�l�
������b��d�+�i,)��ļ�.�b/S���5��@��k.��m#
�F�m����
���t
�k��Ŷ��\˾�q�	8r�%1<OŴ�k�pХ�F����	jˑ+"�+��R��U�CⲜC�"b�[��Y��r�y&�����c1KD
+Hx�z
߾i����8i_�>�,��ы�W�(܁��a���Q��*���q�Q^�6viӛ.�Nax^�����Z�vk��`X
��[3�}��I��˪P���hDq�cXn(�v��篙Đi�-Lj���VK�j�m<��ع��e�
�8����M� �Z���~�G�KƯ�Hv��P�	򼳣t��v
�C�D����)� ���!����4�_�1Y�{}Y����6DV��ͻ�Mbڈo�>t��2B�� ���|����Pk#���pG*�>���K�'.�����
+�0l
��{�C�K-�t?_
+2�H�?C�T� S��e�R��5Ie�nD����GJ��ڽ���}7�D�Dz8i�TF��r
)�
e��*j�VQ��*��*j�kVQ��*��*j��*jgD:8h�_�OQu>��k=��V��A�,�֧��_q�0�uk��#�m��>X��?U$�LY��)����\~�
0_JX�l�J��������o*��
��a�h������H��D�@�S��I�~"J�+�?je�oy��-����r�[�Y6��ۻ�_�"�B�8��?K���9�:

+��ŏ�c�%��>a�%��Z��~`��mӼ�r;��
X|�{
�ڟ1�\_4�BS�d
+endstream
+endobj
+6561 0 obj <<
+/Type /Page
+/Contents 6562 0 R
+/Resources 6560 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6426 0 R
+/Annots [ 6501 0 R 6502 0 R 6503 0 R 6504 0 R 6505 0 R 6506 0 R 6507 0 R 6508 0 R 6509 0 R 6510 0 R 6511 0 R 6512 0 R 6513 0 R 6514 0 R 6515 0 R 6516 0 R 6517 0 R 6518 0 R 6519 0 R 6520 0 R 6521 0 R 6522 0 R 6523 0 R 6524 0 R 6525 0 R 6526 0 R 6527 0 R 6528 0 R 6529 0 R 6530 0 R 6531 0 R 6532 0 R 6533 0 R 6534 0 R 6535 0 R 6536 0 R 6537 0 R 6538 0 R 6539 0 R 6540 0 R 6541 0 R 6542 0 R 6543 0 R 6544 0 R 6545 0 R 6546 0 R 6547 0 R 6548 0 R 6549 0 R 6550 0 R 6551 0 R 6552 0 R 6553 0 R 6554  [...]
+>> endobj
+6501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 685.346 203.075 696.25]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 685.346 296.324 696.25]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a09c8fc0753a389cc42f84c12f7920832) >>
+>> endobj
+6503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 670.779 317.229 680.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 657.932 194.297 668.462]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a0ab38d6ea061e7c2cb1595ba9cf2fd42) >>
+>> endobj
+6505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 630.144 188.759 640.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_aaf207e746f4a3dc2722e254612dab3b3) >>
+>> endobj
+6506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 602.357 204.459 612.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.199 602.357 278.511 612.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) >>
+>> endobj
+6508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 574.196 204.459 585.1]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.199 574.196 297.2 585.1]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_abbde4b86cfca3e29a917650f4c9c62d5) >>
+>> endobj
+6510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 546.408 204.459 557.312]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.199 546.408 287.467 557.312]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a8e5a205098d89ad9473676ae57f29ac5) >>
+>> endobj
+6512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 518.621 204.459 529.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.199 518.621 282.496 529.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af023b7e8ad5a15b2617878bf2bf93d5c) >>
+>> endobj
+6514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 448.973 222.711 459.877]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.209 448.973 314.187 459.877]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) >>
+>> endobj
+6516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.794 448.973 361.329 459.877]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+6517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 352.209 157.417 363.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 352.209 200.851 363.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) >>
+>> endobj
+6519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 352.209 305.438 363.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.594 352.209 428.844 363.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 324.421 157.417 335.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 324.421 200.851 335.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a4b4c0277d3b6c85ab6633ae9f5e235c6) >>
+>> endobj
+6523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.667 324.421 239.854 335.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.297 324.421 290.484 335.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 296.634 157.417 307.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 296.634 200.851 307.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e) >>
+>> endobj
+6527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 296.634 305.438 307.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 268.846 157.417 279.75]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 268.846 200.851 279.75]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) >>
+>> endobj
+6530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.174 268.846 455.423 279.75]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 241.059 157.417 251.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 241.059 200.851 251.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_acc5c5125e7237c5913981b99a502f332) >>
+>> endobj
+6533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 241.059 305.438 251.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.594 241.059 428.844 251.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 213.271 157.417 224.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 213.271 200.851 224.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a61208276a246a505bd753ffbb568bfe7) >>
+>> endobj
+6537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.667 213.271 239.854 224.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.297 213.271 290.484 224.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 185.484 157.417 196.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 185.484 200.851 196.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af245f065572b31c8ca97e196e45f9cf9) >>
+>> endobj
+6541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 185.484 305.438 196.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 157.696 157.417 168.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 157.696 200.851 168.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) >>
+>> endobj
+6544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.174 157.696 455.423 168.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 129.908 157.417 140.812]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 129.908 204.34 140.812]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) >>
+>> endobj
+6547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.677 129.908 308.927 140.812]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.083 129.908 432.333 140.812]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.121 157.417 113.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 102.121 204.34 113.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a047a99eb91872d19730f4fd14a81f55c) >>
+>> endobj
+6551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.156 102.121 243.343 113.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.785 102.121 293.973 113.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 157.417 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 74.333 204.34 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af2eb5d22ef23937a261cfe3f6bc435e6) >>
+>> endobj
+6555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.677 74.333 308.927 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6559 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6563 0 obj <<
+/D [6561 0 R /XYZ 89 770.89 null]
+>> endobj
+6564 0 obj <<
+/D [6561 0 R /XYZ 90 704.201 null]
+>> endobj
+6565 0 obj <<
+/D [6561 0 R /XYZ 90 704.201 null]
+>> endobj
+6566 0 obj <<
+/D [6561 0 R /XYZ 90 674.764 null]
+>> endobj
+6567 0 obj <<
+/D [6561 0 R /XYZ 90 648.048 null]
+>> endobj
+6568 0 obj <<
+/D [6561 0 R /XYZ 90 620.261 null]
+>> endobj
+6569 0 obj <<
+/D [6561 0 R /XYZ 90 591.401 null]
+>> endobj
+6570 0 obj <<
+/D [6561 0 R /XYZ 90 563.614 null]
+>> endobj
+6571 0 obj <<
+/D [6561 0 R /XYZ 90 535.826 null]
+>> endobj
+6572 0 obj <<
+/D [6561 0 R /XYZ 90 467.828 null]
+>> endobj
+6573 0 obj <<
+/D [6561 0 R /XYZ 90 398.266 null]
+>> endobj
+6560 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F66 3165 0 R /F68 3017 0 R /F67 3022 0 R /F11 621 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6708 0 obj <<
+/Length 1224      
+/Filter /FlateDecode
+>>
+stream
+x��[s�6����K�g�A˲������n�{
�Kv'〒e
+61�M�}�+�u�i���ı.>�맣#Y2�
d���ީ5/95��F���� f��z�u�`b~�3�� �*�>���s�s��.:��VI��I
�ct���o����
T8Ə8�аU��U�s
��,��m��(�l+�
�18ƀqb�Nol6C��L.��7��������%VEfU9
UU��d�{��,�Yi
@T�4�WR�?b���5/mT���R�b��m_	as����T�/oj�u�!T?�ۛ�uy�H$7􃳳��i�W�й/�L��5"ݾ�›��p�j����N�릂{��O�|�����t����Q ��p"�x�1�ts�E�p`d�
+��P�]�"kU���m�V�&9���R1'LU���
8R��G�9�r���ף�^�J<�
+T��:�j��(؜���T��T-��A߽
Ȳ�S��R�Vנzӭ�7=��9���ėN�:�������B�o-@��{���Dx���wr��m�kc��t�1`[�p����n9lkb]��:��=��zĀڬ=���1����Wq�R6{�����0�dyO-�LM/J�Y0|��L�A8y�"�JLW'�ᒡӭ��p�Rca���p4	�\��H�h�^��3>��h�:���O��0�$܅n���A�~8{͔���ǵ����,��^�ćQ����`R������%mr�^ڋ��)�RI%��88$����^��So/&��;P3V�����Ds'��:',,�B��_��i	��/!-
+O([i9PёMM����w�����b��/|W�^�ԏ勺�q��iV*��S��w�r4mQ9�6׶O�Nlmˆ�`a��:��U��_�k-��
Y�*�cw�uq=���)�|�>��,�]ݫYOCy�]쮎v-��ll�����nV�c��1a�
�Nk=��L�.�1~<R����kwL�t��FMI��g�E�egaץ�vY���w?�v�-����6Nh���
-L�߱?� �9���qbV&��|;����lV]C�טUܮ�*���X�d�{��
j���}r��X�����s
+���
�y/L�#S2��ob��9'	�U]x%3Ǘ��on���?`E�8��_|�Q�ټ�܏�w]��8�χԝv�AC?H���͡*[a�� |�
+endstream
+endobj
+6707 0 obj <<
+/Type /Page
+/Contents 6708 0 R
+/Resources 6706 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6426 0 R
+/Annots [ 6556 0 R 6557 0 R 6558 0 R 6585 0 R 6586 0 R 6587 0 R 6588 0 R 6589 0 R 6590 0 R 6591 0 R 6592 0 R 6593 0 R 6594 0 R 6595 0 R 6596 0 R 6597 0 R 6598 0 R 6599 0 R 6600 0 R 6601 0 R 6602 0 R 6603 0 R 6604 0 R 6605 0 R 6606 0 R 6607 0 R 6608 0 R 6609 0 R 6610 0 R 6611 0 R 6612 0 R 6613 0 R 6614 0 R 6615 0 R 6616 0 R 6617 0 R 6618 0 R 6619 0 R 6620 0 R 6621 0 R 6622 0 R 6623 0 R 6624 0 R 6625 0 R 6626 0 R 6627 0 R 6628 0 R 6629 0 R 6630 0 R 6631 0 R 6632 0 R 6633 0 R 6634 0 R 6635  [...]
+>> endobj
+6556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.846 157.417 706.75]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 695.846 204.34 706.75]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) >>
+>> endobj
+6558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.663 695.846 458.912 706.75]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 669.631 157.417 680.535]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 669.631 206.47 680.535]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af06b2331eb3d080794682080b7f7eb1d) >>
+>> endobj
+6587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 669.631 311.057 680.535]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.213 669.631 434.463 680.535]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 643.416 157.417 654.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 643.416 206.47 654.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2fb9117b8937e3d9a9b4d3ae397bb79a) >>
+>> endobj
+6591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.286 643.416 245.473 654.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.915 643.416 296.103 654.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 617.201 157.417 628.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 617.201 206.47 628.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a423e3bb0d9886c630c3c227def9f2073) >>
+>> endobj
+6595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 617.201 311.057 628.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 590.985 157.417 601.889]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 590.985 206.47 601.889]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_abdd61469bc5c6dfc6e97f306a751035c) >>
+>> endobj
+6598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.793 590.985 461.042 601.889]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 564.77 157.417 575.674]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 564.77 206.47 575.674]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) >>
+>> endobj
+6601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 564.77 311.057 575.674]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.213 564.77 434.463 575.674]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 538.555 157.417 549.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 538.555 206.47 549.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a600a652347fb8718e0bc05f7230b8d8a) >>
+>> endobj
+6605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.286 538.555 245.473 549.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.915 538.555 296.103 549.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 512.34 157.417 523.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 512.34 206.47 523.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) >>
+>> endobj
+6609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 512.34 311.057 523.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 486.125 157.417 497.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 486.125 206.47 497.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae615df068adfbb40a0b0b7a993579d22) >>
+>> endobj
+6612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.793 486.125 461.042 497.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 459.91 226.034 470.814]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a182ea33f63c0eea708e02a32b0904f30) >>
+>> endobj
+6614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 459.91 364.682 470.814]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 433.695 226.034 444.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_acedadd7f7742a18d941ded77da69ba9a) >>
+>> endobj
+6616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 433.695 389.897 444.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) >>
+>> endobj
+6617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 407.48 180.54 418.384]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a340e8b886fb185bed798dcbc1391c126) >>
+>> endobj
+6618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 407.48 251.383 418.384]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.116 407.48 336.623 418.384]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 381.265 178.239 392.169]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) >>
+>> endobj
+6621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 381.265 249.082 392.169]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.815 381.265 334.321 392.169]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 355.05 156.281 365.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab12acbd3962ac07c4db8f1994351668b) >>
+>> endobj
+6624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 355.05 203.603 365.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.815 355.05 265.321 365.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 342.938 180.54 353.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a340e8b886fb185bed798dcbc1391c126) >>
+>> endobj
+6627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 342.938 251.383 353.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.116 342.938 336.623 353.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 330.827 178.239 341.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) >>
+>> endobj
+6630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 330.827 249.082 341.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.815 330.827 334.321 341.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 318.716 157.417 329.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 318.716 204.34 329.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) >>
+>> endobj
+6634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.677 318.716 308.927 329.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.083 318.716 432.333 329.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 306.604 157.417 317.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 306.604 204.34 317.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a047a99eb91872d19730f4fd14a81f55c) >>
+>> endobj
+6638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.156 306.604 243.343 317.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.785 306.604 293.973 317.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 294.493 157.417 305.397]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 294.493 206.47 305.397]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) >>
+>> endobj
+6642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 294.493 311.057 305.397]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.213 294.493 434.463 305.397]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 282.382 157.417 293.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 282.382 206.47 293.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_afe7cc9f7ed389844bb2484ba6bebdde0) >>
+>> endobj
+6646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 282.382 268.995 293.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.958 282.382 343.146 293.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 270.271 157.417 281.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 270.271 200.851 281.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_acc5c5125e7237c5913981b99a502f332) >>
+>> endobj
+6650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 270.271 305.438 281.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.594 270.271 428.844 281.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 258.159 157.417 269.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 258.159 200.851 269.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_adda5908777a9d901f2e7bcf7f61b9d67) >>
+>> endobj
+6654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 258.159 263.376 269.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.34 258.159 337.527 269.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 246.048 157.417 256.952]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 246.048 204.34 256.952]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) >>
+>> endobj
+6658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.663 246.048 458.912 256.952]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 233.937 157.417 244.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 233.937 206.47 244.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae615df068adfbb40a0b0b7a993579d22) >>
+>> endobj
+6661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.793 233.937 461.042 244.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 221.825 157.417 232.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 221.825 200.851 232.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) >>
+>> endobj
+6664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.174 221.825 455.423 232.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 209.714 157.417 220.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 209.714 204.34 220.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af2eb5d22ef23937a261cfe3f6bc435e6) >>
+>> endobj
+6667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.677 209.714 308.927 220.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 197.603 157.417 208.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 197.603 206.47 208.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) >>
+>> endobj
+6670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 197.603 311.057 208.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 185.492 157.417 196.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 185.492 200.851 196.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af245f065572b31c8ca97e196e45f9cf9) >>
+>> endobj
+6673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 185.492 305.438 196.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 173.38 157.417 184.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 173.38 206.47 184.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af06b2331eb3d080794682080b7f7eb1d) >>
+>> endobj
+6676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 173.38 311.057 184.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.213 173.38 434.463 184.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 161.269 157.417 172.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 161.269 206.47 172.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a858b9fe39b14cf51d179a84be1605436) >>
+>> endobj
+6680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 161.269 268.995 172.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.958 161.269 343.146 172.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 149.158 157.417 160.062]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 149.158 206.47 160.062]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_abdd61469bc5c6dfc6e97f306a751035c) >>
+>> endobj
+6684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.793 149.158 461.042 160.062]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 137.046 157.417 147.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 137.046 206.47 147.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a423e3bb0d9886c630c3c227def9f2073) >>
+>> endobj
+6687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.807 137.046 311.057 147.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 124.935 157.417 135.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 124.935 200.851 135.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) >>
+>> endobj
+6690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 124.935 305.438 135.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.594 124.935 428.844 135.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 112.824 157.417 123.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 112.824 200.851 123.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a32d23987abcbb26d66dcc31aa003b70d) >>
+>> endobj
+6694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 112.824 263.376 123.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.34 112.824 337.527 123.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+6696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 100.713 157.417 111.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 100.713 200.851 111.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) >>
+>> endobj
+6698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.174 100.713 455.423 111.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 88.601 157.417 99.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.915 88.601 200.851 99.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e) >>
+>> endobj
+6701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.188 88.601 305.438 99.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+6702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 76.49 156.281 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_ab12acbd3962ac07c4db8f1994351668b) >>
+>> endobj
+6703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 76.49 203.603 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.815 76.49 265.321 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6705 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6709 0 obj <<
+/D [6707 0 R /XYZ 89 770.89 null]
+>> endobj
+6706 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F11 621 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6744 0 obj <<
+/Length 2329      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s��_��J�L ���g��.Mz�q/n^�2
Z�m�)��ٺ���/� Krr�>��v���-�8������_�Fg��R�r£��(�#���q�5�>�q�(�Lq
���	��Y�̮/'$
W��}>�����M�����﫲Y�YQ�'S������i���6�'X��r��|Tp<&�N~��y��j�0 Q
a�CBF����oq4��#�#�ѣZF	�p]D���1��11"Lݪ�5-��0F{�!lm�!_g�"���D¯fV�uQ�ZA���;
{3�є$�	af�Θ�(�<��}����zk~Uv�8gc��Psa�8I�\�}��_�̺��5��}nnfڿFA�����Ï��قnK|C����N^���y_s�P	&r�c�O���D
ܗ�}{�Tg�|�3	�Ƒ@� f�K+G
��)��9,�N�XiŨ'��v9�J��pD�p"8��T���h*P
+��r��<I��y�؅�oN at Y��L�XX�!�,������E�=���T<MBSI�߈Q���*����θ��I�����c!���H�
�i��m"�%$�]%��ARY�S at n����L [�O$��ǀK
��>\�0��1��G�K�a�z	���{��)6p�cӁ�	!6K�x.� (1������')b1�b�_Nl:q]�%c�	�R���X9�/��PA�&D"�7CX"���J2��y*�x^,�QLD�+�='�f���ס݃�Y
���FO=�0�ݽ�!��|����~2���	a
+�dV���Vϲ��n!�A�Dq��I8* ���r
Z6(
��<�B���z��S@��a�2ˣ��ZVwy�WK��y�D��g��:�!��Ɯ�6����`<~4�u]���fS,,���e&�{�-�D`tS��:&���jss�ޮ�Y�X(��9����6Oo�V|�Zl����2�u��&x���
h�˛ja�<Y6^eEm�4���iýރ�U�7*V��8Pr�X�
�7͵��XX(%��X
���7
��_�b�3�E
����͛S2
����&;��G�C
Q 5��1�ʸ��F�)o�
E�
5�CB�Ж�\���څ`�e�>¡#�H��KVa��w�u|9����0ܷe���),K�@��6�(�غ)M!��X����LP���J�i��mn�l�~j$�53���@Sf�3�V�Ri��S%m��n�e�T,7��j
+C�
��f�+�ۀZ��$0�g=�]�Y�m�2�nfk�Z���{��0ը��/[8*m�m�XT*fM�P}���l�Z��d�ka��n��>�kM�'�.7�(��
��q�:0��-ض�HJ���Z?u at V�V�rp����G���Ѕ���|�{���XH�S>Omy���)^���-V���eQ �"$�U�xG�d�(Y��
Y
m�"@a���o
>L��'T9l���g08�����p�f���qO���'�(��@��1ϧPo��- ^)�ɘ�Y|�$|���ݦc?���FRy�I���I{�>S
�ܺڥ0�6a�C
+�K>�a�@8v�Ά�AE-����C��=�u�p=S��:E�1�Q�W���o�x��L�n��D�+s�{8Sx~�ݭyij��\���k����O�SUg��A�� �0
+H� �zQ ���-exw|ck:���J��
="D�
“#C��l�4�)G
d�*��ህ�v�
���s`�� SqAq�rq��L\(�E�!��ۗ����W8��
�	�A�0�C����raaML�0h������~�`�?*0���
+9�
���6cU��.a��(29�{O2�OS^cU��i�ไ�N3��kp��,�0�Hb��N��f���(�1���
��/z|Q�~�ZoI�t
+m��F1?ã03.��/y]M���-�z}HO^�%�֒�����Eq����8�'4s��N�|V(C�6h
+��$l�f�&������5�����\��|{�'����SG�����7��æP�0��Z��>�;��\WP��D�>�_�Ϫwr�}���n]��^�^/t||J1�
Ǯ��{�^��\�mx��������p|����r��
;��um�_��_1�)
��;%�4V4. �G5l�Kv�?%���7�
�qz�5��܋r��}z��ͼ� 	�Y�õk�S�ݖ}�
'H at oq�w
��
p8���~����!��|on���������ؿg%0/s�
4����
4b ]�� ���tm�w���f�ݩ��J�eH�������fs���
�U��oE<[�- nݧ ~Ά��>�F��K�Ljs�}���
+A�������OK�P����e��٬
+endstream
+endobj
+6743 0 obj <<
+/Type /Page
+/Contents 6744 0 R
+/Resources 6742 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6426 0 R
+/Annots [ 6728 0 R 6729 0 R 6730 0 R 6731 0 R 6732 0 R 6733 0 R 6734 0 R 6735 0 R 6736 0 R 6737 0 R 6738 0 R 6739 0 R 6740 0 R 6741 0 R ]
+>> endobj
+6728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 665.756 221.326 676.66]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 342.962 150.553 350.488]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 289.636 150.553 297.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 248.266 150.553 255.792]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 207.052 150.553 214.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.588 207.052 305.372 214.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) >>
+>> endobj
+6734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 157.554 150.553 165.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 157.554 288.635 165.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+6736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 141.614 150.553 149.14]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 141.614 288.635 149.14]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+6738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 125.674 150.553 133.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 125.674 288.635 133.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+6740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 76.49 150.553 83.859]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6741 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6745 0 obj <<
+/D [6743 0 R /XYZ 89 770.89 null]
+>> endobj
+6746 0 obj <<
+/D [6743 0 R /XYZ 90 721.073 null]
+>> endobj
+6742 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F7 803 0 R /F11 621 0 R /F8 802 0 R /F24 537 0 R /F75 562 0 R /F32 772 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6755 0 obj <<
+/Length 2195      
+/Filter /FlateDecode
+>>
+stream
+xڵYYs�F~ׯ@�!��h�r�r9�#+��-��@�PD-� h��������IP����`����n-j�p�����y ��D>���ʊ���|�-�76g����GK�!a�����������Z͝\�Oޝ0��C
	B+�N޼����(Qh��E��r�ƺ>���^ږpO}��p�
�aD(u��	R��g1c̾�9��v]`���V&5vbl�"��2N�Zs>>��O{G��4�
N	xҵ�q�~?c�-�x3sD��L��bY���R��,Բ��R.qJq�f��gin��8���s�7�T��l���Z�%yR��8\}U�Y\�E~6s<O�i]i=R�a�D�\�� �Cj/�L���R��CO���ZD�oԣ��.ޤ�~�{�Y��|�Zְ�u�hzPdH[�U�6
�W��7;sx�2��@LZ.����ZRȕ���<Ie^Wd���F sZ����\�x*�n$"��E ���Dd��ͦP
ޥ�-)
—K�j�SN�
v�ڴfr[TUz�1d5����DVR�q���
+�jV
����fU�Iآ��C�Y at n��S
+�� �%�桫є�8W��m`4�+���>g}�0�0`����K��w
���f\�⚰O�
�0k��s\��)�C
+(T4�O�x[L�끻l	�1ɮ�g���2�D{�Y0 ؀]eL��"n�ɾ�w�y���l�>P��R����q��Sh����h�fm�
���:2�~�����Z�
mT�6(U믻��1
+h24��-n��m���ģC�iN�^~�!�yx���~$�/�i at r=�$Χ��\��#`�7X	���� ��I�a��5���rj�g�$
+D�}#Dr�3O����D�|:�Zo
��F�B��8�h�Y$���H�z�%,�nt���`�%e��?�����7}�5����S�4���P
�y��]m6|e�B	�(�C
+��n��YO��g��ٔH��Y5�e��<�
$�Tuj�Sg�>��j�%򄑴Z��-U��aW�@����c��]�ya& X�Dk��^�<P
��U�#ɘ��o����Ň-�?����
ȼ�)��Ⱦ`S�|-t�5�?Ev�n�Kt�h76�}j��+�j����2֝��U�SE�׸Lc�3t�
����А�!��%��{�D;�\2�;�Q�������,vբ�e�]��l�����c��`�Y
RV�i�Z�m+V*�^����pQo��&y�[����x�� ~�MX��&"
��]0�Oq!C��S5��z�k�u5
+�\�쯅%j���xd��<��Ia �����b���^P��}n,� �q�)��0�#Z}6PCA���O>�{S'`7�p��ˢVZ��TY�5$��qLaH�6��f��۸��d��K�`R�:;T���%*�`��l��y
8L(��8�Luݳ�%�0�*�
��g*k�d�h�L֗� �\�)�tŊ��
�m?]��K�~�_�B��\H�|"BS�B#8�e���?��F�X�^���e �Z�/5�}��rp�x����0�B�9G"mT�������
�J��e/�f
�~�_�e/^�7e\���:�<;���
�1�
}�
�lm�b��U��1u>�=R 
;���8
+��>cbT�3�v@�I=/~������wC/ P�5<z��k�y��������r�	
+N!5�]�����~q>_��|��G�)󇳉��q�?}�������{��c��(��[-Ră)�ƜΛ¼0���1W9
�4����1��,_l��\���Խ���y�/��o�̇3�P������Lp��}�!
�r]��
,����`�:���#ԯZ��u��@e� ��v�P���ࣗ�+.@�{G��)��ᛕ߾G%4"H��~�nX��D�s�o�|�}{�O�G|w�T_��4�X�V����
+���]��
�~���ڄU�n^��U:�O��T���u�XE+|�
%U���R�ڰ�F=W8�{��ZV�jh)W:�6�b���7U�%Bݡ��~*��?�!-Ӫ�Ly�VkUL
�1�
6p���1��n@�H��y*�
+�����f�8}�	���u�
��t�݂�CP����
�ެz뫫���K%�/ ���)��
+Cٮ�1��d���C|��S�Z6�C��Ӳ�/,)z<������z{vzz��E�By�
�X�9�
Z�_i�
eE���'́�66�
+endstream
+endobj
+6754 0 obj <<
+/Type /Page
+/Contents 6755 0 R
+/Resources 6753 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6426 0 R
+/Annots [ 6747 0 R 6748 0 R 6749 0 R 6750 0 R 6751 0 R 6752 0 R ]
+>> endobj
+6747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 576.475 150.553 584.001]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.007 528.655 196.58 536.181]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.086 504.744 158.921 512.27]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 444.333 150.553 450.894]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) >>
+>> endobj
+6751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.526 101.201 188.032 130.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6752 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6756 0 obj <<
+/D [6754 0 R /XYZ 89 770.89 null]
+>> endobj
+6757 0 obj <<
+/D [6754 0 R /XYZ 90 379.885 null]
+>> endobj
+6427 0 obj <<
+/D [6754 0 R /XYZ 90 356.671 null]
+>> endobj
+6758 0 obj <<
+/D [6754 0 R /XYZ 90 356.671 null]
+>> endobj
+6428 0 obj <<
+/D [6754 0 R /XYZ 107.713 270.38 null]
+>> endobj
+6429 0 obj <<
+/D [6754 0 R /XYZ 107.713 252.578 null]
+>> endobj
+6430 0 obj <<
+/D [6754 0 R /XYZ 107.713 234.776 null]
+>> endobj
+6759 0 obj <<
+/D [6754 0 R /XYZ 90 213.859 null]
+>> endobj
+6432 0 obj <<
+/D [6754 0 R /XYZ 90 190.645 null]
+>> endobj
+6760 0 obj <<
+/D [6754 0 R /XYZ 90 190.645 null]
+>> endobj
+6433 0 obj <<
+/D [6754 0 R /XYZ 90 77.486 null]
+>> endobj
+6753 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F75 562 0 R /F113 1791 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6766 0 obj <<
+/Length 2734      
+/Filter /FlateDecode
+>>
+stream
+xڵZK�۸�ϯ�)+UY0�0U9l�kW6�)Ǟ��&

+�X�H��ƞ��4 >���x�)l4�����mfx���/7W��J6�HG4�ݬg�$�HD�k5�4'1�X������y\����
����akVE|�{zW������<+�"N�j���������
��&K
�c2"sJ����oW��\}�"����@R͒�է�x��ǿ�@�f_ݠ��S�����?�p������R/M���A���
1ԭ�r��s��ЈE�}ΰ��EZ�V�s%Hs
+h�~�(XsA��[�\�)�TM��a"
�.�j
�boG���
�Xr��}c�9
Enw��nl�
+W��f�� B����ɫ��xJ;d��MV�yv[=
̐�%��.{	j!�g�!N�жK$��E�_�g=��DeNi�u�B4�Qk�8��-�uSڮ�S����|vkh���>]9�a�����9�S��O����Ty�|M���ۤ
*��
"��Ge�?��)�#�[�#�#�^ M����W&�0�<QH��/����lH���Xվ�r���z
?���}�=�=Gl灷V��t�[�q��b�_�_�y�2�׏
+s(Li�*����۸������
+��0gy����A�qW݆���t^�^F���nRP��*
���o@��ҲJ��1-��ݮٍ��@��	�-��
��=

+�҈J2ZQX�gc�*4X��40d��(����0�GϏ�` ��!me%�A8��#^�� ��bn�R�)g%�M�<n�$F\����<0�D�w�k���ݬÓ�>`1��灝�vإIZ=w84#�p�l���'�"��;���ҪC�`�B�$EB�nK������!ρK���"��~����5f9�gW�'���,KP�"y�KpG� ����h��h�
ы!7�����H�݉H��pp�)�l}"�C�P؋ 
�Dͣ�ju}�f
�hu
8��|sZRǝ�
��#�٤+u�
�[*c�J������)|�.X�Ͷ�]ԭ�@�
8
 >z�xp�y�
I���ˡ���Dtِ���
9�� ��Y��ļD�	��,�xx
��0�;g\��o�YR3��K�8�mA{dF�K(�����3�[��+-�ER!!��B
|�P+�t��z���N��BJ�8
+U%��εaD Pbe�e� ��2#��6��I��
^pN�fg�!
}:'�|zB��i!fda
�
Q��_�|\���le�f	��
I�t	����i�O[�����3_���\����=ʒ]^B���A �I�;��P {��Sm�r  ���Y ���N����0!ڱ٧$DT3A8�v�!�5ա�<�	"��#8��HLG("/�1M���sp��[�)T w���Sa�
+�ϭ#�
c��B)�"
�Ncp��I,�l*At8k{�J�M6��ɂ�GB	@�ѝ-4WJm�^�~4C52X���RZ��Y
q���1`�`O���'�;tӁ
+1$ ��o8�i8����Qy0I
+8Bͪ�\gIZ�MҺ jK%E�tW#��lA-R
���p������ֻ⿨�`����fk��1�i6`U
8����(
+ٖQ��f��z����ϛ7U�V������@�y
��\G��6�ǀ�	���V�x�
?�l�����
�,Lu,�r`�"�ڕC�nƦ>�{�@�M�^x��v�Mͬ�?3f���:o���X�]� �
+���x��3�)bG{F'��B��T�,?��9�Vⱈd�z
e�I۰�l����ĩ�B�8�0N���z�Z�>��	�a�xn��(�VHL3� {j
� ���"!WC�g(�@
�q;�~��|��'�!B��\"�
�!�e��A�`I���9
<�󻇁y��t46�#H`I�O���z7@�f@�$7k�F6�%)d�� ��zy�W�V at P��–���:^��
�<��ݞ�g��:�UL W
j�$i�&.M�2
�
���H/�
���
u��V7�
j���^ǫ�Ҧ����n A#� ��ջ��K ؟b��nh������n[}��8�y���M���
�
97���S�/�:U\N���`�(T�	ф1��D�m�C�*�F�$�g��%Tc:��w�D��pj�
���\w�|
+0K@&̞G�m1E�ɻ'j}�}�:c\�`��%�Q@�[�5�9,7�
+ yB��>��>��WQ�j�XLގ��UA��� ӵc��Er�v̉ȗ�c�����
3�J�vLo��َ	VZ��c8�������������9xNpT-.S�iЬY`��$�	�Z�S���S뗹�j�$���!�(�+9��2�� �XC��]a�|�H�i��Kd>�P"��SңR",�BLz$%UJ8I��8'U at 5��Z$�|
+\�Ҕ@�Q�}���!�:�2�vSY�
U|��]�I���
_��3D"F��˾Y�0�a�����7V�	*�iݙ���.�g����
�������&tc�Zk��ѵ�f���ܢ{UJk�RFl�
��TV��'M�i���M
+hZ4�2#=�u��� �SI_�ڗ����)	�O"����D*v�xۀ���N��0���������i!l����#�|��
�Zt�#A�P��j~MS���w����ʹB���iRm��V������4�%����O�b�!���ڊ�>���g-�z�9�m�E�{�� �~��DJ�F�޻�͇���ݳ�/9����δ�
+endstream
+endobj
+6765 0 obj <<
+/Type /Page
+/Contents 6766 0 R
+/Resources 6764 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6778 0 R
+/Annots [ 6761 0 R 6762 0 R 6763 0 R ]
+>> endobj
+6761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.526 629.944 188.032 659.259]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.907 311.992 435.73 322.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+6763 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6767 0 obj <<
+/D [6765 0 R /XYZ 89 770.89 null]
+>> endobj
+6768 0 obj <<
+/D [6765 0 R /XYZ 90 721.073 null]
+>> endobj
+6434 0 obj <<
+/D [6765 0 R /XYZ 90 609.022 null]
+>> endobj
+6769 0 obj <<
+/D [6765 0 R /XYZ 90 604.539 null]
+>> endobj
+6770 0 obj <<
+/D [6765 0 R /XYZ 90 533.833 null]
+>> endobj
+6771 0 obj <<
+/D [6765 0 R /XYZ 90 494.555 null]
+>> endobj
+6493 0 obj <<
+/D [6765 0 R /XYZ 90 470.022 null]
+>> endobj
+6772 0 obj <<
+/D [6765 0 R /XYZ 90 470.022 null]
+>> endobj
+6494 0 obj <<
+/D [6765 0 R /XYZ 389.246 418.519 null]
+>> endobj
+6773 0 obj <<
+/D [6765 0 R /XYZ 90 411.879 null]
+>> endobj
+6495 0 obj <<
+/D [6765 0 R /XYZ 462.17 315.145 null]
+>> endobj
+6774 0 obj <<
+/D [6765 0 R /XYZ 90 308.505 null]
+>> endobj
+6496 0 obj <<
+/D [6765 0 R /XYZ 158.014 247.02 null]
+>> endobj
+6775 0 obj <<
+/D [6765 0 R /XYZ 90 240.38 null]
+>> endobj
+6776 0 obj <<
+/D [6765 0 R /XYZ 90 171.676 null]
+>> endobj
+6497 0 obj <<
+/D [6765 0 R /XYZ 90 139.326 null]
+>> endobj
+6777 0 obj <<
+/D [6765 0 R /XYZ 90 134.843 null]
+>> endobj
+6764 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6783 0 obj <<
+/Length 2212      
+/Filter /FlateDecode
+>>
+stream
+x��[ks����_�O
95W���x&M�LR�qm�_l�
Q��)	� (G��w��ǂ�����hF�c�����޳�pp
���_�Gg�
BJ*�� ā�!�.��cJ����/��P�S��~{y����so��|�qD���@ ���r��=.��/F,���r�2���"x3��;_p�'�[>,g:P� B��(�����T`<��ɔ
+<�?��ER��̠��5�ЈQ(����r�p Q��Ri	"�)E\2;,u�XkG!UT�a���"��BzLM�{	L
+!H�ds
�4	�y�s�t;N
|�0.ԡ
����ǚV����@2�����v�mK ��֐?C�)�S���;���{����~�����r-��
�O|ǚ�I�,���<��<I �)��B��
|�}P�w���2
+��MS�Qe���h5œ5ѳ��y)���{!W
��X|����#FP��_ƣm@��"	
r���fH`��t3]?�Y���������.̐CPL��,� �|��'(�a�2�#����+�
j<`�ɔ <�Y�0UA�(G�2�l��HkH&�i�P�`W�j�6��h���Tp� ��� d|_�=.PJ��|(�e��\x�\�Q>����l�C�B�FIZ�f�j�¹
�f��u⑤s� YqZ��y�T�PsD�53������yS3��-�]*���u��\B
��s]W�"_�=0�����ɕ��^:�L���z8[pD�l���Czq��v�����

\1�KP��T~�O $��ݻ��ʳ�*���&�e�
A�,0�<���:��>�f��ÝW�o�	��	cg.N
+��*��b��
����b�M�J���R�\��JDl/����c3��J��]���%jc��y�'�#KԎNKn��vi���!�j�()��B�!)���(���أj��䯣v�?6wN�җ�I�G��!$�����`I1�
���\8JR
�L%)<g�J��݌�;ݴ/�� �[�*��Y[�p!�����1\��&lv�g���.埪<j�FD�#�{��-=���bJ@
+*������2�7�����D֛E��
K�ǵ�H�~�3�,;JiUI-\õ�Z��m��JH�j�1>�����W��fj3du����2���[�[�F�������TH>~�nlq��s���Ft�1���B
+�>��m���2�����"^�;[c���C-!��<Yq�TE���E�Ȯ��h�oJ�=
+���
+��� @��<D��jU~H8݅��]8���L]�Δ�d�Y��=�fY���
H�b��_���٩ӟ��7�]#����8���O����D�3�y�ƅ>��~k����a�2�w��oj����O^QY��e0(ͯ
\_���>�a�?�AZ���ʪZ�
���Jb
���u����7�q�km�=���{;���U�
۬*
�>ϓ8�\Y�~_�p�:^DE�N���y�͞����P튨����CI�@^�#s�H_�r����t����6Σ�J��a��:��
+<"����H�v"�T�� ���ó�o�	�c(�.

# ��P;8�5�5&O�\��� m���j\�P��
�>h}���f�O��*�Wy�[���

Dz�r����
�x.h8d�	vpL��]��M*@�w���J��;@ P�ң�*g��9��ũ9���3��)D�
�NB
+�Z],�>h1��uqW�ߛ�@8h���`U�pVai���a���
�w���
���R1
H�v�.dvް�޼	}�Nޤ
ט�;�%wP
�5A�����wC�c�5g�0��6��Wsl6*)L�@1U;*�>�j6kV߼`��Ϝn^�o�}�y|5Qc#k���
����ߒ��uH����!5T
ꁹ�ϱ-�Y؉Ŏ�yW~�H��T�@����å7�L�
�C�@"H�B!9	�Ti$%/�Rd��aF!�gN4�h�����m����BD!ۧ�$�
Ŗ�N�$����6�z���R�ar;==��Ϟ�⫈�����Q�
#ʞ'�ܛu��AR�(���Zr�,���	��*+���˛�3����K���d�tS�o�LX�s��7�BR"���
���=0�W�^؃�����c�(�F�ڑ3f����⁋��<���Ӧ
��7q��e}�w���F�:�|����MQ����.�׫8�F�l������TCk�6�2��iHR�wi�����e��
+endstream
+endobj
+6782 0 obj <<
+/Type /Page
+/Contents 6783 0 R
+/Resources 6781 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6778 0 R
+/Annots [ 6779 0 R 6780 0 R ]
+>> endobj
+6779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.507 378.739 236.499 389.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) >>
+>> endobj
+6780 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6784 0 obj <<
+/D [6782 0 R /XYZ 89 770.89 null]
+>> endobj
+6498 0 obj <<
+/D [6782 0 R /XYZ 90 655.245 null]
+>> endobj
+6785 0 obj <<
+/D [6782 0 R /XYZ 90 650.762 null]
+>> endobj
+6499 0 obj <<
+/D [6782 0 R /XYZ 90 514.538 null]
+>> endobj
+6786 0 obj <<
+/D [6782 0 R /XYZ 90 510.055 null]
+>> endobj
+6500 0 obj <<
+/D [6782 0 R /XYZ 413.145 443.732 null]
+>> endobj
+6787 0 obj <<
+/D [6782 0 R /XYZ 90 437.092 null]
+>> endobj
+6788 0 obj <<
+/D [6782 0 R /XYZ 90 364.27 null]
+>> endobj
+6574 0 obj <<
+/D [6782 0 R /XYZ 90 341.715 null]
+>> endobj
+6789 0 obj <<
+/D [6782 0 R /XYZ 90 341.715 null]
+>> endobj
+6575 0 obj <<
+/D [6782 0 R /XYZ 90 289.823 null]
+>> endobj
+6790 0 obj <<
+/D [6782 0 R /XYZ 90 285.339 null]
+>> endobj
+6576 0 obj <<
+/D [6782 0 R /XYZ 90 245.608 null]
+>> endobj
+6791 0 obj <<
+/D [6782 0 R /XYZ 90 241.124 null]
+>> endobj
+6577 0 obj <<
+/D [6782 0 R /XYZ 90 189.437 null]
+>> endobj
+6792 0 obj <<
+/D [6782 0 R /XYZ 90 184.954 null]
+>> endobj
+6578 0 obj <<
+/D [6782 0 R /XYZ 90 133.267 null]
+>> endobj
+6793 0 obj <<
+/D [6782 0 R /XYZ 90 128.784 null]
+>> endobj
+6579 0 obj <<
+/D [6782 0 R /XYZ 90 77.097 null]
+>> endobj
+6781 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F7 803 0 R /F8 802 0 R /F11 621 0 R /F24 537 0 R /F91 766 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6797 0 obj <<
+/Length 1560      
+/Filter /FlateDecode
+>>
+stream
+x��Z]s�F}���Sk������:�t&@ڗ�0"ـ��
d��߫/�R$˶dô
V�j�ݻ眽G6
>,�e���������#
(M]Cd �h������0��ỳg��͗��*
+߽���������l����l9sņOn��"�|�}4B;�KO�	�q�ьޞ?<=| e�L3P`lp9
\�e��~
P
�'����>o�׃��-�W�e��-�aei����2P��*U���4k2rmY��Ҭ�g.:��Q��G�@\(�P���5SQF���0�j23�����9r�6d���yD�
҂,B�ლ	Q��s>^����E`S�B�|Uދ�߄K�6�B��'�4[{d�5m��t��I}嗟�Y��G�^\V���ҥ�EMjv
+%HYݩ�(Y�C)_Z�S�9 ]Z	���kP�g
�e��� U���`	�c�uZ�,�4�,_Lf>��=��6��b2��D���g�~�#-i�����ჺt�E������ħu*K�dTk)�
0'7	�g�J�d
+�Lk
֩4|�?����V��J�H��
^i�F����
}�(p
��:��vŁ.����0,��8��
�]b at g�����i�Fp�*�(%K�i�N�&Y�h����v����>�[��

�TAM�;�	��X�Z&S�
si�̞�^pD�r�
�� D�Ҥ�\R�{��kUK�P��m�vn[j
�nϺs��ۮ3��Ur?zDŒ�3ԊFH:��� &y
�[-�c-�5�Zoz'��P�f���U��a�i[��Ia���}_]�Ǻ��Ե>��
+
����8jCӊu�ଌ�`��s�d���S��if~ ��kw��v��z��2WY�6�,����mM��bqPl�9¹�}�%�!�%H�u2�Y�L�4�v>ǂ͞�^#U�
��Y����s������e�^(�eχB
�J�PMY�6�������;K-ֳT�,U��V,�&�Ҩ�܊�Ώg�
8�
���'%�!�
+�����@�6�b
+
+lh�X�]D���&ѓ|�[a��О�J���Z1+(��lv�7kf2`�+*3�b�pÚ_7Z�j/mZ
��V����v��3lh=�i������7C����a
/*�9�
"!ݪ��<�
�[�~�
+-��������r��L��wG@��!�\m�Tw4g|�'�꽘�N
+��
+���l��
+�n�k��������_��U�L%i������Kx���K�y��f�a�3�De���Q
���0������B�,y�[��
GЁVO(�q
��ʻyB2c�{<7bKO��d�t
/H�L9��
k,�r�N
HV�&GH�i��8p�/��K��_�������w���3v���g��P��#5Y��m��>E�Y���Ґa�Jx�W���Ez���G?��fu�=�}o��$w#TtF$`Jn"�m�m��0
�d_{��e��_A~�� �T�FM����ӓ���?,��\Χ�A��:�
+�^�$	M�Q��ɌnN�%�
+�a��R1jS5ϫA�D[@�[�M
�[�N�30�q��T?ϩ�/+[�/�#=L
+endstream
+endobj
+6796 0 obj <<
+/Type /Page
+/Contents 6797 0 R
+/Resources 6795 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6778 0 R
+/Annots [ 6794 0 R ]
+>> endobj
+6794 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6798 0 obj <<
+/D [6796 0 R /XYZ 89 770.89 null]
+>> endobj
+6799 0 obj <<
+/D [6796 0 R /XYZ 90 721.073 null]
+>> endobj
+6580 0 obj <<
+/D [6796 0 R /XYZ 90 688.613 null]
+>> endobj
+6800 0 obj <<
+/D [6796 0 R /XYZ 90 684.13 null]
+>> endobj
+6581 0 obj <<
+/D [6796 0 R /XYZ 90 632.443 null]
+>> endobj
+6801 0 obj <<
+/D [6796 0 R /XYZ 90 627.96 null]
+>> endobj
+6582 0 obj <<
+/D [6796 0 R /XYZ 90 576.273 null]
+>> endobj
+6802 0 obj <<
+/D [6796 0 R /XYZ 90 571.789 null]
+>> endobj
+6583 0 obj <<
+/D [6796 0 R /XYZ 90 520.338 null]
+>> endobj
+6803 0 obj <<
+/D [6796 0 R /XYZ 90 515.854 null]
+>> endobj
+6584 0 obj <<
+/D [6796 0 R /XYZ 90 476.122 null]
+>> endobj
+6804 0 obj <<
+/D [6796 0 R /XYZ 90 471.639 null]
+>> endobj
+6710 0 obj <<
+/D [6796 0 R /XYZ 90 419.952 null]
+>> endobj
+6805 0 obj <<
+/D [6796 0 R /XYZ 90 415.469 null]
+>> endobj
+6711 0 obj <<
+/D [6796 0 R /XYZ 90 363.782 null]
+>> endobj
+6806 0 obj <<
+/D [6796 0 R /XYZ 90 359.299 null]
+>> endobj
+6712 0 obj <<
+/D [6796 0 R /XYZ 90 307.377 null]
+>> endobj
+6807 0 obj <<
+/D [6796 0 R /XYZ 90 302.893 null]
+>> endobj
+6713 0 obj <<
+/D [6796 0 R /XYZ 90 263.161 null]
+>> endobj
+6808 0 obj <<
+/D [6796 0 R /XYZ 90 258.678 null]
+>> endobj
+6714 0 obj <<
+/D [6796 0 R /XYZ 90 206.991 null]
+>> endobj
+6809 0 obj <<
+/D [6796 0 R /XYZ 90 202.508 null]
+>> endobj
+6715 0 obj <<
+/D [6796 0 R /XYZ 90 150.821 null]
+>> endobj
+6810 0 obj <<
+/D [6796 0 R /XYZ 90 146.338 null]
+>> endobj
+6716 0 obj <<
+/D [6796 0 R /XYZ 90 94.651 null]
+>> endobj
+6811 0 obj <<
+/D [6796 0 R /XYZ 90 90.168 null]
+>> endobj
+6795 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6815 0 obj <<
+/Length 1671      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�F�_��Py_n��<Ї��SJ��/�tL����ld9��Շ%K9YvdeB��X�N�����v��(a�{�����M.������'�=K�bʛ\z�zZX"�w������S�+C�*|+��Ë�'�'��g�'����#�A6�$�x���Ի��OQ0����Zx�q��{��hE�T#
5� @&p&F$��i/
�ZJ.�u
Mga�
�L�C�ۡ�UM�e�
�݁��r;�;�T��ɶ
G��
�ԡ �i1�_C��i4���[�fW�!�6����%�G�WH�b�oN+&į�\��
�1�
�:
+��8�x��a
����ye���Z�`��^�#�7Q�F�I�����淊l����6qx
�,D�cmj
sHI�V�Se4���
�}z�5Î a
x+3����vG�`���C��P<�CW�V1�YL���|^EC0~�^ϖ�C�aĖJ?p!6	�b���ЅZ R at i���
��|dƪ2����jO)M��x
+4�`���$j�(�Jce&>qR�
�
S��+FD�Nw�J�EU|\�DAx�&K(�r�e�q^
1����\ -1�	�� p�
�N��DPf��1ZJ��x��d�
+ny��� �
h�1f��y
+?̲N gF#!�J��b�s�@�w:���l�*��k ,c
�6�*)C�C��8u
+P�i�uQ@�?�S $i�R
_��K��`�Ȋ��Ϟ����%�G.����/	i���
���%��ͥ>��ޠXo�4�u��Ҩ

+ۄ �VU(��īM��p�����6����a1
O�Z�_V.��K:u8 at bg�c����>nO����
 ��y�w��S��uU��4���s7L�ԗ�d
+`��^_�%�0��8ڸrSD�b�3��5
/rh��/�>�.B�4m
䘿�>gyn>nfC&����t�T�Y�^:d�r�hQ������ʟp���1
�9"
��{�M��dƼ�8�b��_}
����
V�����"J񆈐yD�v�_�.�(X�O����J�$�~�x�8��� ��;I�edC]�����J���YM��P����%�6o:RQ���-��fO%�y--��ԥ9z��Zn�4m��d��@��� �4��#��F�am�5\{%
_�nc�(���Qo�hE>��I����$���}U�Ė�0JN��l���v�e� t_WMI���n�_VFw#�r[s��5l ���� Im/O� �L���F�[s и�
٤�
69��8�4D#�[���8�^5����g�
]m�A��R��dsh�e��6�L�X;FAv�~MՆ<�k(�B�[mp~g�U��z�`�xY�ݓL�Bӊ��	�A %�%gQ�Hho�'Gi,.Yy�����ONҘt�k
��ON��HO�
���[���\����:��_��5�)]ش�l_�ټ��4~�=���o
|�$��S
|I���
u��ⳃ/��_����n�ȴbD3~���&Ҧg�?�(��f�����������/
�������F8ߨ�0���h3��Ȋ4�I�^>&������˗ϲ�?�A�m��λ$�M��t�]'qt5� J����(0���0ْ�_An�L�
+�
�>��I��8e�q����ۼ_�{r�\\oE�/[��ƽD�HZ,���f!�\Lc��ՇA7�
=�>�
+endstream
+endobj
+6814 0 obj <<
+/Type /Page
+/Contents 6815 0 R
+/Resources 6813 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6778 0 R
+/Annots [ 6812 0 R ]
+>> endobj
+6812 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6816 0 obj <<
+/D [6814 0 R /XYZ 89 770.89 null]
+>> endobj
+6717 0 obj <<
+/D [6814 0 R /XYZ 90 688.613 null]
+>> endobj
+6817 0 obj <<
+/D [6814 0 R /XYZ 90 684.13 null]
+>> endobj
+6718 0 obj <<
+/D [6814 0 R /XYZ 90 632.443 null]
+>> endobj
+6818 0 obj <<
+/D [6814 0 R /XYZ 90 627.96 null]
+>> endobj
+6719 0 obj <<
+/D [6814 0 R /XYZ 90 576.273 null]
+>> endobj
+6819 0 obj <<
+/D [6814 0 R /XYZ 90 571.789 null]
+>> endobj
+6720 0 obj <<
+/D [6814 0 R /XYZ 90 530.29 null]
+>> endobj
+6820 0 obj <<
+/D [6814 0 R /XYZ 90 525.807 null]
+>> endobj
+6721 0 obj <<
+/D [6814 0 R /XYZ 90 486.075 null]
+>> endobj
+6821 0 obj <<
+/D [6814 0 R /XYZ 90 481.592 null]
+>> endobj
+6722 0 obj <<
+/D [6814 0 R /XYZ 90 441.86 null]
+>> endobj
+6822 0 obj <<
+/D [6814 0 R /XYZ 90 437.377 null]
+>> endobj
+6723 0 obj <<
+/D [6814 0 R /XYZ 90 397.645 null]
+>> endobj
+6823 0 obj <<
+/D [6814 0 R /XYZ 90 393.162 null]
+>> endobj
+6824 0 obj <<
+/D [6814 0 R /XYZ 90 371.114 null]
+>> endobj
+6825 0 obj <<
+/D [6814 0 R /XYZ 90 349.007 null]
+>> endobj
+6826 0 obj <<
+/D [6814 0 R /XYZ 90 326.899 null]
+>> endobj
+6827 0 obj <<
+/D [6814 0 R /XYZ 90 293.837 null]
+>> endobj
+6828 0 obj <<
+/D [6814 0 R /XYZ 90 270.729 null]
+>> endobj
+6724 0 obj <<
+/D [6814 0 R /XYZ 90 237.667 null]
+>> endobj
+6829 0 obj <<
+/D [6814 0 R /XYZ 90 237.667 null]
+>> endobj
+6830 0 obj <<
+/D [6814 0 R /XYZ 90 214.558 null]
+>> endobj
+6725 0 obj <<
+/D [6814 0 R /XYZ 90 181.497 null]
+>> endobj
+6831 0 obj <<
+/D [6814 0 R /XYZ 90 181.497 null]
+>> endobj
+6832 0 obj <<
+/D [6814 0 R /XYZ 90 158.388 null]
+>> endobj
+6833 0 obj <<
+/D [6814 0 R /XYZ 90 125.327 null]
+>> endobj
+6834 0 obj <<
+/D [6814 0 R /XYZ 90 90.263 null]
+>> endobj
+6813 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6838 0 obj <<
+/Length 2004      
+/Filter /FlateDecode
+>>
+stream
+x��ZYo�F~ׯ�S+�z��H
+�mZ4M
+'v��-�[ItH:���;�<$R�DY�
~�ޝ���].FT
���>~
`;����d$����C�
~M��F#Ƽ1���<�G~��?�y����,����W�e������E�$��p�~<�O�`፩����~�d÷�U{D���$�d)�#J���������Ӏ�`xH2ARz8Y
�}��)�~	
+0��wn�b�)��|x>x3�
�f��4#�R�"����kV�	�����R+�Z!
S)%���&��4���d}"c�0QL�����+f��{c.
���cL'�G�p馱����96�LF�Ѧ4ڦ��f
Z��U>MNO'����H
�wVҼ�<�<5
+b1�Y������ՖO�
K�f�;K-jN�
aE�Y��e��_|���5I�h�@[�J+��$�FD�3��%k~'�tbmΘ)0%��6F�l�8��i0��R��
+��q
�cJ���u0�bu4<{觼inZ}�$"�<�z�60��d�QK�0cV��kD
�aÆR)D�:$�90ƚ:RHu�
�|͡�% DU�w�
�%�ÚK�;�	R��
֪���$�i/I^!����
F
+\H֊
0�xHf�2Ŭ*Ċ�.T�li �8�r�A��Hj	��L�
�"��
�^
+����	
�0Q�`1f@�^
�|�Ȝ���B�1iI����+,��އ�{�H�B?��S��@�FY�B!����*=4
��$�P�j��w+
+	��p�#nD�}�Ml�B�.
���?
�w�xکN�
+o�R���B�]U��4BBB��;tل
_B�$ CJ��%G`��6$�

g�
'Ш.��hPƊe�y���8�/�m�����
>P�lфًk��?���\�h5��
+ at sΡ=4��HIg�9�Q��&b�%��C��8Rfv;�`c�{�����l��N!
��?�ק;{}��2�D�яߗr�(�����_��Cz���jX��~͒r��د��>߯U����k����
�,@"�hm����פ�{C��sv�}zwcJT��b�H����ѢC[
+;d^�<R[*�6m�=��׶~����~�k?jk�h)���E��Q��1Ñ0��/b�R�|�}�I����ob��&VO��1I��WIm���3RK�1��i��#�
+���ί�|�(E�4;2J<BFw����f@��dh%ڢP�3�<i�g?�
+u~��>�Z
�xS��n,�2w��`qę+��S?E��`�Os�0�W����F$�ޖn�v�r��E�YgYSFJ�e�!�lD�
F
�\X!�`�Aߺ�`�e��ipΘ�Q4�!��ij�X½`���@�H�ݡ��zT�Guz:
���yc����
�X@/ ���5׹s�gMN�� ��Ϟ�=ј��=ҫ�Ē�T����+�zƫ�~1
�
eb»�$�f��(����bt��G+͛�=p�]O5��u�N�_�4�Rhցh(Htנ
+]W��Ӎ�Xwo�
\��$u�ÿ��4��ZY at 6܅�,����Ж� '���L�Fٜ�cÒ�.��M���:\�s��M�Ό.&���I�=ә�f��x�W��4L�py}&3�e�\G�bi��d��rl�〿=Wg�xRR��i%�U"�rLV������u���ZJ�r]E�y��
+��^Ycσ�JL���4) o�:P*��ލ�֛�9�Ͳ�lFcfn�±��l��M�5[�)�
�H!`�%w0$���
kr�� 
��"�=���S��@�	&T��-	�a�����H�0��̪��Wa�Waa�����?J2��&�%�y���[��"��M٭~�VR�
�z��i
�A�*%�/�rh�M=%�����&A��'�(G�ky[��6��="� I�N�� m;'���<(l�	�ǰ�<pf%�������������5�k4�nyMh�VG�e�XDqPd+x�p�1T�R`�����v��6v�,�/N~Z����M)�_#�ڄ
+endstream
+endobj
+6837 0 obj <<
+/Type /Page
+/Contents 6838 0 R
+/Resources 6836 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6778 0 R
+/Annots [ 6835 0 R ]
+>> endobj
+6835 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6839 0 obj <<
+/D [6837 0 R /XYZ 89 770.89 null]
+>> endobj
+6840 0 obj <<
+/D [6837 0 R /XYZ 90 693.576 null]
+>> endobj
+6841 0 obj <<
+/D [6837 0 R /XYZ 90 659.513 null]
+>> endobj
+6842 0 obj <<
+/D [6837 0 R /XYZ 90 624.449 null]
+>> endobj
+6843 0 obj <<
+/D [6837 0 R /XYZ 90 591.388 null]
+>> endobj
+6726 0 obj <<
+/D [6837 0 R /XYZ 90 557.325 null]
+>> endobj
+6844 0 obj <<
+/D [6837 0 R /XYZ 90 557.325 null]
+>> endobj
+6845 0 obj <<
+/D [6837 0 R /XYZ 90 534.216 null]
+>> endobj
+6846 0 obj <<
+/D [6837 0 R /XYZ 90 500.154 null]
+>> endobj
+6847 0 obj <<
+/D [6837 0 R /XYZ 90 466.091 null]
+>> endobj
+6727 0 obj <<
+/D [6837 0 R /XYZ 90 433.029 null]
+>> endobj
+6848 0 obj <<
+/D [6837 0 R /XYZ 90 433.029 null]
+>> endobj
+6849 0 obj <<
+/D [6837 0 R /XYZ 90 409.921 null]
+>> endobj
+6850 0 obj <<
+/D [6837 0 R /XYZ 90 376.859 null]
+>> endobj
+6851 0 obj <<
+/D [6837 0 R /XYZ 90 342.797 null]
+>> endobj
+6852 0 obj <<
+/D [6837 0 R /XYZ 90 319.688 null]
+>> endobj
+6431 0 obj <<
+/D [6837 0 R /XYZ 90 297.211 null]
+>> endobj
+6853 0 obj <<
+/D [6837 0 R /XYZ 90 297.211 null]
+>> endobj
+1802 0 obj <<
+/D [6837 0 R /XYZ 90 126.048 null]
+>> endobj
+266 0 obj <<
+/D [6837 0 R /XYZ 90 119.336 null]
+>> endobj
+6836 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6897 0 obj <<
+/Length 1698      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�H��_�tR�H�z�ey�]OjӦJ{}�Ƨ��T�{U�D��7��Ll7~i*�vgg�gvf
����t^:�s�j.r-bi��Śm��Y�k�}�������
d����}�0x�ap���
tn;�š!0d;�?�|���<~�aD]G���4�P�N���?
\Ӆ5t1
dr��D�O�#���?��ˑ�"���)G�d��U��)�LZ�P�
�����w�a����
��V'�\��z� ��O�k��N���q�������|
���DJ.v^^����6,dRG������a�����qa��o:ڗ
ø{���'�tx�HR>�M�A���f�x�*���G1Ox�z��m���#~���ͧ�0�����tḾmZf�M؞e�
���m��7�D=_��w2��0>�{V��	���t��^ �|�
y��=���MU�n�nf�մk���"�Z������ ����6!'���� ��4��
+D���`<�i���Ha�0��-�.ڐ+�kTև؄����15�*Dl��D&6���x����u⏓��
�͠�a$xR'�~�o��T�j��}�D�0�/��o��
��
(Eξ'
ֺC�K�����D�Ŋ~�b%�`���C��mw�B��V;��E:)�q_\aL�H>����R� ��ωY� �R!�
+S,yV[*K�T���m�)�e5#��O�COֻT��e�ܻ��I"��
�KWj���1켆v�$�HU�gK�=���y:��f���cI��h�LUg�$�S=�(,B�%�0m9�Lda�
�NĆ�ְ
�:l���T;����f�p�jc���&��i�bi04���N���a3��G��أ3Б �&��0]D|;�$�I��y(��u�Y�^����;�<s}��0�aVX�Q�q�m٫��s�UlW�'$�9����M�-Az�ek<����풧+���M0Ǻɺ��2�oH��@��
+ k)>�-�U�Y֖�ZP�v�^��t=�/V
+����X#cy�@���|���1B�e�f�.ڎ1�Fي��&
+fj����cY-��bʈ[�
��
 �� ��xX\��P�<�h
 m^����^�;�2�v	w���r��K=}�5�w:d�n�5�+G��Πc�Fض��g�&}�9^�:Sj�`^t�+
+��n�"������6x��"l�넑��_a��
+D���i�ʽx�fI{�:
���]�R��ӵ+���
m���+�6Q	�(o
N�
+
�ɐ�>�l�lW3]�l�cq��5
ilj��U'&�`�<l���ƴ�2�3�A��M
4��Ԧ�|#@���a�I�a*��C�p���T��E�3�
�dtnX%���MaY兑���_/I{0��Kl1ޡ�X��L�Q��`[�g�
�gg�g��[��^
�Bv��Xx*&z�d�KE"�@�3�v����B
G�Yt`s��;$�
+qj"G
�I::=�y
o*����_\�]\<�u�:�d���>�"���fn�B8��c�$�Sp�^�[�g#�{G��K�Ȓv`��4Y�'��~�T�)*s�n;aöI��z��,��3��
+A�R\����/����j3d��\4�נ
Y�>�-o��j�w��n�{/�RXW�t�x
/�/Q̧̝��璗�C��7��;�WE'#�Qܞ�it��_�ǀ���l�P��
�Ao*u����p��O �Am�>
+endstream
+endobj
+6896 0 obj <<
+/Type /Page
+/Contents 6897 0 R
+/Resources 6895 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6778 0 R
+/Annots [ 6854 0 R 6855 0 R 6856 0 R 6857 0 R 6858 0 R 6859 0 R 6860 0 R 6861 0 R 6862 0 R 6863 0 R 6864 0 R 6865 0 R 6866 0 R 6867 0 R 6868 0 R 6869 0 R 6870 0 R 6871 0 R 6872 0 R 6873 0 R 6874 0 R 6875 0 R 6876 0 R 6877 0 R 6878 0 R 6879 0 R 6880 0 R 6881 0 R 6882 0 R 6883 0 R 6884 0 R 6885 0 R 6886 0 R 6887 0 R 6888 0 R 6889 0 R 6890 0 R 6891 0 R 6894 0 R ]
+>> endobj
+6854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 653.402 191.737 664.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) >>
+>> endobj
+6855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.553 653.402 257.311 664.306]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 625.828 191.737 636.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_af2d6708545759fc6836df550bab529a0) >>
+>> endobj
+6857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.075 625.828 262.581 636.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.234 625.828 341.992 636.731]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 598.253 191.737 609.157]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5498315352fd30826df848010c6bac1d) >>
+>> endobj
+6860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.075 598.253 303.527 609.157]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+6861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.037 598.253 391.795 609.157]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 570.678 191.737 581.582]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a92333180e0163e9c87f2220dceef012d) >>
+>> endobj
+6863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.075 570.678 296.902 581.582]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 543.104 191.737 554.008]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a32d97203a9cbf1abf97af74fc70df05b) >>
+>> endobj
+6865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.075 543.104 296.902 554.008]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.431 543.104 380.188 554.008]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 515.529 199.486 526.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a964e4bcbbfde58f43977d0a8e686ec35) >>
+>> endobj
+6868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 487.954 191.737 498.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.477 487.954 243.284 498.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_adfa7b03e2ac3a6666a7538431f1bdee9) >>
+>> endobj
+6870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.621 487.954 348.448 498.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 460.38 175.668 471.284]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 460.38 234.596 471.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a09afd391300355989769ad52d3cc97aa) >>
+>> endobj
+6873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 432.805 208.395 443.709]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ad876557324aba0b545e25ebabe5a064b) >>
+>> endobj
+6874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 432.805 273.968 443.709]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+6875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 405.23 179.554 416.134]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 405.23 250.666 416.134]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) >>
+>> endobj
+6877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 377.656 220.579 388.56]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ab79c93f68d0f4589de855e872f9e72f6) >>
+>> endobj
+6878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 377.656 290.038 388.56]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 350.081 192.554 360.985]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5fbb0274f3a0a91ad283aef6e608909a) >>
+>> endobj
+6880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 322.506 225.211 333.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a6aec148aa41935a4072c64a43c51c577) >>
+>> endobj
+6881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 295.305 158.044 305.836]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a8388d0d6d7ff68c627d516ec17f56b4c) >>
+>> endobj
+6882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.382 295.305 228.888 305.836]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 267.357 161.013 278.261]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a314eb5fed86c6bbe4a7223ca8362f0a9) >>
+>> endobj
+6884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 240.156 155.265 250.686]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a3410a53827de9155ac7d6cbd84263364) >>
+>> endobj
+6885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 212.208 170.687 223.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 212.208 195.165 223.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_af59c44aeed3fb4b88852730664a84e9e) >>
+>> endobj
+6887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 174.048 170.687 184.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 174.048 187.563 184.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ae36d644db84375b3aed9a748c6dff35b) >>
+>> endobj
+6889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 146.473 150.493 157.004]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ad350b84c25b7c37693d2e7a08d3165ca) >>
+>> endobj
+6890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 118.525 181.845 129.429]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5cebd3d6d6ec070c47682e77b0248f22) >>
+>> endobj
+6891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 90.95 181.845 101.854]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) >>
+>> endobj
+6894 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6898 0 obj <<
+/D [6896 0 R /XYZ 89 770.89 null]
+>> endobj
+6899 0 obj <<
+/D [6896 0 R /XYZ 90 672.236 null]
+>> endobj
+6900 0 obj <<
+/D [6896 0 R /XYZ 90 672.236 null]
+>> endobj
+6901 0 obj <<
+/D [6896 0 R /XYZ 90 642.927 null]
+>> endobj
+6902 0 obj <<
+/D [6896 0 R /XYZ 90 615.352 null]
+>> endobj
+6903 0 obj <<
+/D [6896 0 R /XYZ 90 560.203 null]
+>> endobj
+6904 0 obj <<
+/D [6896 0 R /XYZ 90 532.628 null]
+>> endobj
+6905 0 obj <<
+/D [6896 0 R /XYZ 90 506.78 null]
+>> endobj
+6906 0 obj <<
+/D [6896 0 R /XYZ 90 477.479 null]
+>> endobj
+6907 0 obj <<
+/D [6896 0 R /XYZ 90 449.904 null]
+>> endobj
+6908 0 obj <<
+/D [6896 0 R /XYZ 90 422.33 null]
+>> endobj
+6909 0 obj <<
+/D [6896 0 R /XYZ 90 394.755 null]
+>> endobj
+6910 0 obj <<
+/D [6896 0 R /XYZ 90 367.18 null]
+>> endobj
+6911 0 obj <<
+/D [6896 0 R /XYZ 90 339.606 null]
+>> endobj
+6912 0 obj <<
+/D [6896 0 R /XYZ 90 312.031 null]
+>> endobj
+6913 0 obj <<
+/D [6896 0 R /XYZ 90 284.456 null]
+>> endobj
+6914 0 obj <<
+/D [6896 0 R /XYZ 90 256.882 null]
+>> endobj
+6915 0 obj <<
+/D [6896 0 R /XYZ 90 229.307 null]
+>> endobj
+6916 0 obj <<
+/D [6896 0 R /XYZ 90 190.774 null]
+>> endobj
+6917 0 obj <<
+/D [6896 0 R /XYZ 90 163.199 null]
+>> endobj
+6918 0 obj <<
+/D [6896 0 R /XYZ 90 135.624 null]
+>> endobj
+6919 0 obj <<
+/D [6896 0 R /XYZ 90 108.05 null]
+>> endobj
+6895 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6950 0 obj <<
+/Length 1929      
+/Filter /FlateDecode
+>>
+stream
+x��YKw�6��Wp�R�D0�HO6����6����Y$=:Y��
[���  ��(ZM�t1
yqq�߽ �s�`�_����|C}'AI�E���I�C���Z9\�����c�^�vYS�����n�o7|հŻlٰf{u��*�lXV���VH^��^��W9BO��5of$vy�r��Ñ�yd���w��^|�  v�$D4v���ï�Y���
'�����pχ1wn.~��F'<�-���P��%����ya��]�|�����:
��y�$j�h�;*�N݀���Ջ�8��G�֩��
�
/�$���Q�$�<�3'!�#_Kx��j5��D`��"����n;� E8�Dr�N����F=M5�&A
�����Jyӌ�
+1�z^��ʻ1v
A%���y�de�Et(����X�/Fv$�hhIО�"`�1N(X�G>��c`YU����H�l�Wlu*:Se���lx&����hx{�\���nfA�VŨ�}D��׈�(�^O�J���ͫ�o��s��O]^�A�R2�U�L)ƌ��bզ|��,�F��h���{U`�n#V<3i��Ӧ�s���+-����C�'
}�����L�%ab���U'�
+�<����o�s�mJ1�
�ì�M�O%d�
�ZG�hӔ
�n�磊�G�&k��Q�	DF�xrÛ�
I�X�`�(
M�B�Q��\*xQ5ۅ�~�
���㫔Ʋ�,_��Y�Xn%_
+o����`�g;I�@=�J=j��i�>X��7/Ӵ��.O�Uc��jT?	���L\
C x�u��E݃�M����O9��=[�����N��t0�!M��
�3
��_?Bq�W���}��������N�w��϶�P�ܳz�k
+	�'�z����f��(�ێ5Lȏ���P)��NW2t%-#h��>�xߔ�U�S;/v��区���/��sw�7m��2.NXu�]��2��h0
2B�?0��ी��D�a!j��E�z�`�hM��I1�WD�d�j�XWP�H���0�@g��S��&S���y�����X� �)-n�m����:-���&x�S��j���k�>�����(O���7�J�/j��z��Ι9�6%���4���:��:^��?��WW�Tw�����Q%��o?������y�d�5���8�	
+�M
�+i{�
��}�y�3)+��/�0�|m7E�j�u B�<Z�inwܝ���џ���0����'�EI<(냃�������!=�,?Ob��},���uk��
х�2�O����ޗ��
�?�ŏ{B�
��V��M�����E���� ���\�MV��6k}^
��=,��:��u΂��3�RvL�j�O������
&]Y�0�<n6 ʄ�����;�s �Š8v3�Q7M캢�e&���Z�9*(�����}��qy��8r����l>W
+�H]��d(�}�G��k��6�����}Ck��Z�&��
+�D�<�jZ����X���hJ�z�罣�R�=C��?j�j� �����][f����"Vp����+�fи��~�
"��%���5����(�vַ��s��e�3�\�V�]q@�o2�̹9_�pX�b�����~0��a"BM������.p��� :�����e]�y��W'�
l��*t�
+A^DbF�����l
=(`����ЁjN�H�aғ���
ƈ�D�r��& ��.ӸG�:[.aӌ�� ؙ��3�je^.U�i�|e��,������*W=cY����N�J�_���C����ߛ 8�"����"b �	� A.�D��?�xy��3?�ُu�N�	(
+���������g��oԝ����l������N�
��1��7�
���u��{
��k
<Lƍ����岽��CiU
�ˁ.��Ӿ9][d*����a�}aA�S��%�;� q�5��� �1���(���]h
\�-|�uF�}#�!]�
+endstream
+endobj
+6949 0 obj <<
+/Type /Page
+/Contents 6950 0 R
+/Resources 6948 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6964 0 R
+/Annots [ 6892 0 R 6893 0 R 6921 0 R 6922 0 R 6923 0 R 6924 0 R 6925 0 R 6926 0 R 6927 0 R 6928 0 R 6929 0 R 6930 0 R 6931 0 R 6932 0 R 6933 0 R 6934 0 R 6935 0 R 6936 0 R 6937 0 R 6938 0 R 6939 0 R 6940 0 R 6941 0 R 6942 0 R 6943 0 R 6944 0 R 6945 0 R 6947 0 R ]
+>> endobj
+6892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 707.957 154.727 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2552e7a194f5fb0d591bafb591b91968) >>
+>> endobj
+6893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 679.596 176.505 690.126]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a5a79ce2b52efebd42da2736164a043ad) >>
+>> endobj
+6921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 664.182 450.955 674.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) >>
+>> endobj
+6922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 639.529 191.718 650.433]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+6923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 639.529 288.852 650.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2b451e6b09162c7c19b0a2ad36545c69) >>
+>> endobj
+6924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.794 191.718 621.698]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+6925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 610.794 303.079 621.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a78a4d5f5e4702a16d6aae656293ec7ad) >>
+>> endobj
+6926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 582.059 169.013 592.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a999f627225c179795a8922d8335065fe) >>
+>> endobj
+6927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 582.059 250.656 592.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 510.283 203.075 521.187]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+6929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 510.283 296.324 521.187]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_ac3223cf8c7d19b02b5e3c04038024b47) >>
+>> endobj
+6930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 495.243 346.612 505.148]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 481.922 194.297 492.453]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a70e9ad42674d62ed9bd73268e3af7064) >>
+>> endobj
+6932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 453.188 188.759 463.718]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_aea9a4fb9807eb61cda3eedf8e5a7acae) >>
+>> endobj
+6933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 424.079 238.78 434.983]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.52 424.079 319.029 434.983]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a6293b813e42a59a9795cafe0efa762cc) >>
+>> endobj
+6935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.965 409.039 397.522 418.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) >>
+>> endobj
+6936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 325.025 226.034 335.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_add9738866968b13e938d5669dd94a55e) >>
+>> endobj
+6937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 325.025 399.003 335.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 296.29 156.281 307.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2b9db6ddc26573299d412b80ee0dc018) >>
+>> endobj
+6939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 296.29 237.924 307.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.136 296.29 333.963 307.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 282.919 156.281 293.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2b9db6ddc26573299d412b80ee0dc018) >>
+>> endobj
+6942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 282.919 237.924 293.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.136 282.919 333.963 293.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.363 207.618 257.19 218.522]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 195.662 132.51 206.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6947 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6951 0 obj <<
+/D [6949 0 R /XYZ 89 770.89 null]
+>> endobj
+6952 0 obj <<
+/D [6949 0 R /XYZ 90 721.073 null]
+>> endobj
+6953 0 obj <<
+/D [6949 0 R /XYZ 90 696.902 null]
+>> endobj
+6954 0 obj <<
+/D [6949 0 R /XYZ 90 657.208 null]
+>> endobj
+6955 0 obj <<
+/D [6949 0 R /XYZ 90 628.473 null]
+>> endobj
+6956 0 obj <<
+/D [6949 0 R /XYZ 90 599.739 null]
+>> endobj
+6957 0 obj <<
+/D [6949 0 R /XYZ 90 529.612 null]
+>> endobj
+6958 0 obj <<
+/D [6949 0 R /XYZ 90 529.612 null]
+>> endobj
+6959 0 obj <<
+/D [6949 0 R /XYZ 90 499.228 null]
+>> endobj
+6960 0 obj <<
+/D [6949 0 R /XYZ 90 471.565 null]
+>> endobj
+6961 0 obj <<
+/D [6949 0 R /XYZ 90 442.83 null]
+>> endobj
+6962 0 obj <<
+/D [6949 0 R /XYZ 90 371.717 null]
+>> endobj
+6963 0 obj <<
+/D [6949 0 R /XYZ 90 268.401 null]
+>> endobj
+6948 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F67 3022 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R /F32 772 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+6971 0 obj <<
+/Length 2008      
+/Filter /FlateDecode
+>>
+stream
+x��X[��6}�_!�јˋHJ۴@�$EoI�lчm�U���juq$���wȡd���4�?��e8�sf(�4���˳�gZ	IW��u��@G	�
+�e�U�9_���!*&,Q��u�����痯����˳�g
�h�Ѐ$:����d��C@�H���M*��
x��_Ψ���i�57���[(�h[o�D3h�c޵�j�&ͫ��wmgJ�co5�Z*J�u��{-,5XÕ��Uk��w*黅��՗�����s�c�F�Ϛ�쳻o��g��,p	�����3��:�n��b��bM߷
��[

�U��~Nc��d��.�nq�ݤko%�KS�y]��LS͘�7��R޴
.M��w)o�#O|
�x)�-0
���%��֫��?��mx�ls䓛Rc��Q��JH��
�l&��D����3FH�u?��؈H�<Bw�n̺�\�/�
M�[(�	n)��6��;���7��
�"��O�黴�6<Fg�(v�
���	X��
+4�
@�
�Y�W7ؾ���m�N)_w؛W��6-�.7-�@�����fz��v}=�,�Mc\D�z��rc��/eCg�N+\Ԙ���0���綝�р�>��e ����n��X�M�,c�\YFؿ�j�;�'��
e��j�9>z�x�
M
<Ƈz��圁���7��
�	�����y
r� ��#�(j��;;t������ۼ�<4R�
��v v�z��}Gci^W�`رco�6-���O�^�P>�.�""����)z�'
��� ��S*�`9�t1��| ^�PO1��Ͽx��<��}
=��CT��� �“
+/�__w�K0��D�-��Ŕ�-�E����N
N�;'.����̩�p� �XBh�ϭ��;n@Ӫ3ƛ�u�R��$�9(*���X��K��
f��܉���͂�s��ӏ&��{01 at cep1 at 1�O�TA<qts�nLe������a];\7�>�������m�wZ�j��H�
ĝ$B6���./����*��	|N�"]a�c���AX</yD�a��xl�M~�W��F��&�8,�
���
|ʄ��1�5�n2�&s{����$K����4	C�4&Jh@�1��ت0�n�|�v~˺��9�y�^�����\��e���
+�E��
���r
�4��g��dŋ�R��R��K� |�d��:�]w�u Ƨ�xb��O����.�5�	��պ���w#���r�#h�
߹�L�PI�cI��n^
*�d�{���ř�D�LE$�ޕ�
(��b�X��5Y3���P

8LO]�)_5)D4w�N.��(�>�#1'JESG0���H�(���r�9ly+
��&�$�/	�Wz8ф�o�s���>�P�ɔl��L��w
��T2�Z;c�A���)���G9���IWye9�f–Ä�5�V��@���x�@��6��0eHL���%I����J܇���A����(�������7��
��I_o��n?{4�3��/��_�w}���-
�y{ks���Z�oz)�~=��[��D�k{�W��/
+�ϳm��/�!��&���v��E
goR�RZ9��:�7��-
<�'����
���;���q
4�R�n7C
��@���
8��O��z�R?�AJ,c�IZ+�N�:W4��
+FIb ��0�j��O�;��1����f�;�^OfW
h�ߚ�3�W�cʇ�M03��j� P�
ۉ���0HS�C�ʇ��_�x���t��R@��–7wP�?��;tܵ�jN-��i287�sL�h�
��M��Hے�ؼf�}q��0/��d����4\5m�W~�o�~��>4��l�ƀ =P�a=��Yb�>���T��>C�Ӱ�=�>�F�>[���
+�}�ߨ��5����ROj0�7�{˽A��!�1
+
+WgIA2�s�y��˟��+\�>� ���sZmS�$���V�o��0�
+����k��)�����>?�I۬?T
+�]��8?_mo �������_� ��|���'���t�N̏�_���
+endstream
+endobj
+6970 0 obj <<
+/Type /Page
+/Contents 6971 0 R
+/Resources 6969 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6964 0 R
+/Annots [ 6946 0 R 6967 0 R 6968 0 R ]
+>> endobj
+6946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 709.04 179.843 716.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) >>
+>> endobj
+6967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 464.373 179.843 471.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) >>
+>> endobj
+6968 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6972 0 obj <<
+/D [6970 0 R /XYZ 89 770.89 null]
+>> endobj
+6973 0 obj <<
+/D [6970 0 R /XYZ 90 325.651 null]
+>> endobj
+6920 0 obj <<
+/D [6970 0 R /XYZ 90 302.293 null]
+>> endobj
+6974 0 obj <<
+/D [6970 0 R /XYZ 90 302.293 null]
+>> endobj
+6975 0 obj <<
+/D [6970 0 R /XYZ 90 181.927 null]
+>> endobj
+6965 0 obj <<
+/D [6970 0 R /XYZ 90 158.569 null]
+>> endobj
+6976 0 obj <<
+/D [6970 0 R /XYZ 90 158.569 null]
+>> endobj
+6966 0 obj <<
+/D [6970 0 R /XYZ 108.69 77.486 null]
+>> endobj
+6969 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F8 802 0 R /F91 766 0 R /F32 772 0 R /F7 803 0 R /F94 771 0 R /F118 2438 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7000 0 obj <<
+/Length 1736      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~���0 �К�U��Э�Юż6{J�@�[�,���4�~�"u��Kҵ@ �(���\�s!���~��|2;<������ura��x��
o�uj�w�cl/
��X�g
�b;O�V2.³W�yWGG��YYa�Ugo��J��"5r�T���p�T`��4,K��F^��!�-�H:s�aߦ�9�O^Ξ��>���-����h=;}���_Z�\�[�����)���z;�c��	1�B=�sހ��K"�;.C
Qs�
��<��]�ۥC�}n��;,��t,A�<
+{��v$�
X�ROfŁ�A�ߟ��43>>�������ۊ��mI^M��[
+ bC�(�ͤ�B�a%������4�dΰ�ϵ@�`o�(�MQ�QQ��.�^5�^z��ڻ�<ڮeV�U�gz��j�
�:8��Ƽ,e�PC�fe�����!���C�}�dK=�c�ʣ�qg>0�""��b8�t.��6��V�ˮU��!h}��*�s>��`�
+-wь��o���>LcH�^�j
~�� .F
�h���`�0
+���@c�.�`���gƀ
��o�.#
��	�^8a�#��!'�c�6� 9��gc���}��7���A��~��8� 8�}{���������lY��v�[S_��S�\lB�S���`�;D ��?iFB�Sj��I��[3(�ap*��8��I��X6�כ)����L���1̈́ΩGt�w}�Ɵ�,qB
gBO|��d�TJ����K������	��DH3���#�H��E�&NgU�|���u�p�]�ьm�"N.^�5c��j��wx
���� ����0�o�ܻC�~0!
� ��>Y+��JE�apO7�b�	v
+� �N�s��4��ѿ��si|�x�E*���c�
ڨ�j|��ڥ����7m
�1
�

�n��w�8�.��F�˕Y
+���i��E�M���m#��8��{|C �|��v 9I���郫����a�
'T4�$7W�O�#��k n�����
�|qdw_��
췰|����uX)5��,�e��k�=�
+���)������O�&B�`2Mם
+uWϵ&�9�md
�;G�%c�A�nV�ߺY�}$DO at x�2����*�b{>�G��>��׆U��,���<�<o��Y�hE�-�M�W	�L�W�Q�
=Dڰ�2S��G��g�
{P��	�Ah��]0x���KY=��n���
J����)�}�WO	�����N���t�am����4�Rt���B4�LW)�R���'�Y����C~���j�!#�Hn󯺱uj�	Bpp7 �F^��*B[T���c0�$
+���E<a��*�޾����}��k�Lڗj0�nS��6:	(�>3:�5I1m�g�
+�T��=�Q�l��
3ƺ5�`���e���Μa����f�1��V��R�A=U�����<�g��
㹶�F�,��n�0Z��2-����&"�!r�o�ϓ�
�3�c��D���)���
ɥ[w�=a���c�ޤ�V-y�}C1j��dOs?�c�qS(U��nP�1�:��Z��ꍹ�Ԇ7�&��2'��nVU���2���e�����.�n��^��	��o\�W���R?8B��د�l�N
��1��b� �)��P�el���5�[��o�Z<=\�0�y{�UUm�Ϸ�RfK��]_�%@�k
���h�Md�`p]_"�����R`u�@i�@?��b�յ
�����B3p�bͬg9��2����5
+endstream
+endobj
+6999 0 obj <<
+/Type /Page
+/Contents 7000 0 R
+/Resources 6998 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6964 0 R
+/Annots [ 6977 0 R 6978 0 R 6979 0 R 6980 0 R 6981 0 R 6982 0 R 6983 0 R 6984 0 R 6985 0 R 6986 0 R 6987 0 R 6988 0 R 6989 0 R 6990 0 R 6991 0 R 6992 0 R 6993 0 R 6994 0 R 6995 0 R 6996 0 R 6997 0 R ]
+>> endobj
+6977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 485.369 251.503 496.272]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aa1ff4528466150c5a3ce8d110c0c92e1) >>
+>> endobj
+6978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 456.356 251.503 467.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a8ab042e81927db600ee725d3c983b252) >>
+>> endobj
+6979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.84 456.356 416.432 467.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 427.343 259.251 438.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a4948dd7324bd5d7a28e142a66ba5f875) >>
+>> endobj
+6981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 398.33 251.503 409.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.242 398.33 303.049 409.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_acefade434fe64088a872391d152455c1) >>
+>> endobj
+6983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.386 398.33 467.978 409.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 369.317 180.938 380.221]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.678 369.317 231.847 380.221]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aaa37fb590232bdc2474283e83bc019cf) >>
+>> endobj
+6986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 340.305 180.938 351.209]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+6987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.908 340.305 234.963 351.209]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a168ed0cbd2cf59717febf52a6d6e107a) >>
+>> endobj
+6988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 311.292 251.503 322.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.242 311.292 308.668 322.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a40dee04f6adce4b8c60a569662f37f96) >>
+>> endobj
+6990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 282.279 251.503 293.183]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.001 282.279 298.426 293.183]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aeeafd2e88e461b1f480c37995d105714) >>
+>> endobj
+6992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 253.266 180.54 264.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a6d8bd16c6f8ccff0228956f76a9b7464) >>
+>> endobj
+6993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 253.266 345.469 264.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 224.254 178.239 235.158]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a177ecd1fb2bec07a416a3369f22d068d) >>
+>> endobj
+6995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 224.254 343.168 235.158]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) >>
+>> endobj
+6996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.169 133.074 513.996 143.978]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+6997 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7001 0 obj <<
+/D [6999 0 R /XYZ 89 770.89 null]
+>> endobj
+7002 0 obj <<
+/D [6999 0 R /XYZ 90 721.073 null]
+>> endobj
+7003 0 obj <<
+/D [6999 0 R /XYZ 90 704.53 null]
+>> endobj
+1803 0 obj <<
+/D [6999 0 R /XYZ 90 630.056 null]
+>> endobj
+270 0 obj <<
+/D [6999 0 R /XYZ 90 622.758 null]
+>> endobj
+7004 0 obj <<
+/D [6999 0 R /XYZ 90 504.921 null]
+>> endobj
+7005 0 obj <<
+/D [6999 0 R /XYZ 90 504.921 null]
+>> endobj
+7006 0 obj <<
+/D [6999 0 R /XYZ 90 474.174 null]
+>> endobj
+7007 0 obj <<
+/D [6999 0 R /XYZ 90 445.161 null]
+>> endobj
+7008 0 obj <<
+/D [6999 0 R /XYZ 90 417.875 null]
+>> endobj
+7009 0 obj <<
+/D [6999 0 R /XYZ 90 387.136 null]
+>> endobj
+7010 0 obj <<
+/D [6999 0 R /XYZ 90 358.123 null]
+>> endobj
+7011 0 obj <<
+/D [6999 0 R /XYZ 90 330.836 null]
+>> endobj
+7012 0 obj <<
+/D [6999 0 R /XYZ 90 300.098 null]
+>> endobj
+7013 0 obj <<
+/D [6999 0 R /XYZ 90 271.085 null]
+>> endobj
+7014 0 obj <<
+/D [6999 0 R /XYZ 90 242.072 null]
+>> endobj
+7015 0 obj <<
+/D [6999 0 R /XYZ 90 194.243 null]
+>> endobj
+6998 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7025 0 obj <<
+/Length 2441      
+/Filter /FlateDecode
+>>
+stream
+x��Zms۸��_�NgR�W!x%'�L_2w�K�����dh	�9�H������� �*J�%��~H���b��]�4�����߮Ξ�LEd�Ix]�D�F�4D%��Ŝ��/W?F"ф��r�/������Woq�����Og
�hļ ER
��g�~����(FG_ܤm$���&z{��3�
>)QЪ��7ߴ�U��
+��MI�D�2F��VeQ7[+-z�L(�_�@��E���]��퓅�_���g��ݒU7�~O�왗H�
@�� 
��L�GqSVsP���s����U���nj>B��ɵ��-�?��D�B���XO?��~#C����ga��r��VXrEMFK���O|��G!�%#��C����i
���;��%7N�O_&t`��D�T2X<%J�e�n���x]��[[4Y����Bm�Fs�׾��duh~Y0g��-P�v
���m��m�m6傫�K^|�]�)�{>>Q�	f�RFy��9W�sWhT�
��
6����aX�Q����R*/l���ŒQ�t��2Ϊmv�~L%`�:�*N��pjm����K��,e
�"���B��,��n����&�Qph'�D#?��UG����ޏ�C �&$}
$�ύ
#yc���3 at g�����,\�|��O�(��Ѱv���R�4��s������/��{����j!ul�;8���w��7��ކ��;kh���l��#;�z� 3�-�$B��Cg�oW�
������G�:
�׭mn���C�Ƀ��pY��eK[�%^)`�=H d���K��y�����τp��T�7fz`#Yg`�aB��9B�2�5��=��H`K�!���_/�x��`�\�?��|��p�G�s�:���I�ʻ���x�Q�P�#kr�'GY�@�� )�Ϋ��p.h��\.�M�߄��`@4�v�88;M����e�c3��[��l�
���h���q��z���
r^�9���,D����Y?�i=�s��6��6+��6_�-&��
 [...]
+f:�
μA~��'�8Es��1��ab-c�Zh�W=
��cH�SnN2�W��>#�Lhr�
�}�h�� 0�(vc(=�
s�2`J_)��xo�9?߹�w�qm���Iāޔ�¨L#�*'J�	C���a������ݧ

)ᴋ�k�3]+�%:KqI�1q
��:
���4�t��[��hJ�

+^��K��1��f����03}XV��2�Y>扎�y�o����*I��p��|{�d�
%-m�N���3� W�����f�V�t»�p!
D�zx.


+�	a�L��Pp��e�z�����"4*"���k˜
;V�$�{%A{��C�xk������� m5 �y
H��=�����1��?8vgmL񫬶mN딃[*
g��N>����Ab�aCc����N45c��h�So��_4���4�)��/�s�­���ܸd�
[�_ns�)N�D�%%�;������j�(B
+��)�C6*��wy��i*�*K0� w��/Y��_�WB���}��������X��V
��,�	sJ/�

v��k�
������*
��2���
xX�8�A��ߡ9B�!�sq��%KGv.��
NxUu7}�*
m���$I� $܇ɛ?�{���iP���
��>%�O�e���7���>��M�
�<�u��T�0�6�S
���@Qb������Xb�k�ZW��HL���m��/�W|��P��,vzI�
��܏��0v%9d�
^&�x�vq~��Q?�c�Tx����A�x
�m%BAa"����Pڞ�X�O���1�B���C��3=�)�(�AL.�bx:��PJ��vT������Xd���
=X����-�:Cѐ�G��?h�C��N�	ì�
1<��|-ԣ��1�=��|���
	��I�x��B
>�)QƑ�'�J��Q��}�
�߄��?lEtQ��^��-{�����,QD�.:.�./�ն��B�8j?g�
�����3�\��������"stF㷶͉<�w�����c�)�@(]��m���ӧ����->����㺵��V�v5DWxn�*l*/0w@��	&�?��oE
+endstream
+endobj
+7024 0 obj <<
+/Type /Page
+/Contents 7025 0 R
+/Resources 7023 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6964 0 R
+/Annots [ 7016 0 R 7017 0 R 7018 0 R 7019 0 R 7020 0 R 7021 0 R 7022 0 R ]
+>> endobj
+7016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 486.271 207.229 496.801]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction_a4a8af06ff9f0434860b2c253a02406c0) >>
+>> endobj
+7017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 458.002 197.875 468.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction_a9e8323bcacdbcdfedf9a76ab296389cf) >>
+>> endobj
+7018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 430.48 214.978 441.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraints__Reduction_a770ca19b06c82d0de4780b7ee091df72) >>
+>> endobj
+7019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.613 316.645 397.034 327.549]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+7020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.512 148.639 179.766 159.542]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+7021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.977 148.639 329.907 159.542]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+7022 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7026 0 obj <<
+/D [7024 0 R /XYZ 89 770.89 null]
+>> endobj
+1804 0 obj <<
+/D [7024 0 R /XYZ 90 623.891 null]
+>> endobj
+274 0 obj <<
+/D [7024 0 R /XYZ 90 617.291 null]
+>> endobj
+7027 0 obj <<
+/D [7024 0 R /XYZ 90 504.891 null]
+>> endobj
+7028 0 obj <<
+/D [7024 0 R /XYZ 90 504.891 null]
+>> endobj
+7029 0 obj <<
+/D [7024 0 R /XYZ 90 447.366 null]
+>> endobj
+7030 0 obj <<
+/D [7024 0 R /XYZ 90 403.638 null]
+>> endobj
+7031 0 obj <<
+/D [7024 0 R /XYZ 90 352.95 null]
+>> endobj
+7032 0 obj <<
+/D [7024 0 R /XYZ 90 291.116 null]
+>> endobj
+7033 0 obj <<
+/D [7024 0 R /XYZ 90 268.739 null]
+>> endobj
+7034 0 obj <<
+/D [7024 0 R /XYZ 90 268.739 null]
+>> endobj
+7035 0 obj <<
+/D [7024 0 R /XYZ 90 120.793 null]
+>> endobj
+7023 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F22 2982 0 R /F11 621 0 R /F94 771 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7068 0 obj <<
+/Length 1930      
+/Filter /FlateDecode
+>>
+stream
+x��Z�۸��B@���\>D�Z���8�z��-�!	Z��u�z�$g���C��eY~�� 
4�LS�h8��
؛{��i�����`^��F�ͽcO�1��K��>��E��`����~Re��ۀb�X�TZ%��,Z_]�T���E�4*�x���kBz�)��>l$?o�l}
�FC7�����11�X�A�#��nċeR���r��1�UV.���睺WU@���t�T�R��N^�L~��=�څ#!�Y6y�{)t��ub�=�A�R�K�z��	�8��`RF���KZ�V�ʛ�Yy�u_Tm�yX�9�6�y4���*W�+�oVE�^UN�rY����|�v}��.Օ��S�#
+��������Q�Q�
 Q�K���>A����'�sL<�e�9Փ�:��!�G�EC�]�
!)���0>������� F�� �A�Z�(�9 �o�����y4�Ў ���L�?E��ߏ#�	
D�`�IFv�h[��16�A�@�)��@�
�@��2q�� �S*0"�B#D
LiD�����UR��j��؏ oi{�b�7�j�g��˪�?-�Б{fe-����ؙ�}腼�Z�3�ygV�uSi�	|���uҍ��9J�
%�
��7�9SVU��_�t��m��0��Jc��[����8�("7����?&�X~
��,�N�(���?-��r���2�P�;�ܗ%�7`�9�#�-8�qB
+109 y��Y��� G�Ŭ����@@��*�ij���?�
�X�j�O�0�]͚��ܙ�5_*����&F	��d���K[�
Dw�P[F�؀�U�Įi]��|xJFgo�-A�(4��<I!�v�n^���	�آ
��ڢ����Y5fEU�Q�.�<��GS
R��P��	 �H�Je7l[s�xGn���@��e)�WsĞm��V�$q{���P�Ŭ�C����sm)ҧ)�߭G
* �xW���w�k�O�'�q����9�V:�
�������Q�F@��z&
�o��#R.�_��r���e($�1�r�>�0P����¨��0�#��V�>���Z�yn��=w-�'?OY�0�z����.�J��o�XD�I�����~=@��"Nnۯ�J/��4�[P~2K�Ezt+]����<���y1ϟ*�0��
��������n�2�Ƹ#D�hV�#�
*͈lY_�\���
f9�~D�W��l��1���C8��Y�H��F�ȅLj�Ǫ��Y�T�
]GХ�t Q!ԛ����� E�@J��("I1?'�
U�^��

+��
+-�T�e��r�]+��%9����Y��x�aN�s�F�Gr�9 0�>4F�n?�N���9
��x2�P>>Q�{f�����*��nxab0U'��$D�˓買�r���
�/)�ǒ�;լ�|{��r�>�п��bt��K�4u�=Ֆ�gX��������*]����n{�s�"�_���ʛF��UI�6λ~<�٢��)E���][��M���88�����ۺ=�*��l��_�R׏IY�0 �DO;�@'��e���"�:�X�c��{�(�����t��n�mgR�F^4��ެ���G�nH�c�����O�X`���Ѹc'c>��O�wΗ�$E�p���.!ef��Ӿ+�3�
�m�;5u�^]uS�$
>�lF�Ub  �6�??����-R
��Yo����@Cb�	�5��#�}'�
��
������S)aJ%�P�ݪ�����US���:)
+���o ��+���[gAqx
�1������ID���ԛ'���& @D(���Ɖ=Y���jU�9�ܯ��j�J�A��?��PU�]L!����ZsL$�k��*���Z����~"�rn����4�����j^�|�fE����\b�7{n���p)i�Cgf�B�]�p��X߽��`��'����fD�m
�m���2�,�ț
>�C3��
+endstream
+endobj
+7067 0 obj <<
+/Type /Page
+/Contents 7068 0 R
+/Resources 7066 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6964 0 R
+/Annots [ 7036 0 R 7037 0 R 7038 0 R 7039 0 R 7040 0 R 7041 0 R 7042 0 R 7043 0 R 7044 0 R 7045 0 R 7046 0 R 7047 0 R 7048 0 R 7049 0 R 7050 0 R 7051 0 R 7052 0 R 7053 0 R 7054 0 R 7055 0 R 7056 0 R 7057 0 R 7058 0 R 7059 0 R 7060 0 R 7061 0 R 7062 0 R 7063 0 R 7065 0 R ]
+>> endobj
+7036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 614.493 123.644 625.397]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+7037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 522.712 176.332 533.616]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a34a906d66497c7b42c6c9ea77165bc38) >>
+>> endobj
+7038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 498.95 176.332 509.853]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_aab39fb7c66f4105c941430d9931b0189) >>
+>> endobj
+7039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.669 498.95 281.496 509.853]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+7040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 475.187 176.332 486.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a4d7661321b11a65279b5d936a1fba56b) >>
+>> endobj
+7041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.669 475.187 288.122 486.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+7042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 451.424 176.332 462.328]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a054973ef19a18393fa8036b0de2e4dbe) >>
+>> endobj
+7043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.669 451.424 254.906 462.328]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 428.035 184.081 438.565]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a8c77d6b1d2bd2e952fe64efad3349d54) >>
+>> endobj
+7045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 371.09 229.552 381.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a7eb3a57714b03eb33869ebe8c42ad52f) >>
+>> endobj
+7046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 371.09 308.127 381.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 347.327 196.347 358.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a55311ef7c4114673de51e497bd427a7c) >>
+>> endobj
+7048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.684 347.327 274.921 358.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 323.564 220.038 334.468]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a382c0dc82b8c78f56d128417d61d66de) >>
+>> endobj
+7050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.375 323.564 298.612 334.468]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 299.801 224.003 310.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ab6dbf75ccfaa0f7b0a103622dfcc9d76) >>
+>> endobj
+7052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 299.801 302.577 310.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 287.247 272.49 297.152]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+7054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.08 276.038 194.623 286.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a4107301b10dfc19aff5b3df720622abd) >>
+>> endobj
+7055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 241.852 176.332 252.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.071 241.852 227.878 252.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_aae7e5b25ce9803fc9b573763f85d37d2) >>
+>> endobj
+7057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.215 241.852 306.452 252.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 218.089 180.198 228.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ae7990e15a0193c52e91a48bb29a48c78) >>
+>> endobj
+7059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 218.089 235.251 228.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 115.271 226.034 126.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a5c44d3d0955540b98975a14f5b97e942) >>
+>> endobj
+7061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.301 115.271 368.538 126.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 76.49 226.034 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_abbd1a3e57c1f33d638b4ae3aa852416f) >>
+>> endobj
+7063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 76.49 372.413 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7065 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7069 0 obj <<
+/D [7067 0 R /XYZ 89 770.89 null]
+>> endobj
+1805 0 obj <<
+/D [7067 0 R /XYZ 90 679.669 null]
+>> endobj
+278 0 obj <<
+/D [7067 0 R /XYZ 90 671.41 null]
+>> endobj
+7070 0 obj <<
+/D [7067 0 R /XYZ 90 561.484 null]
+>> endobj
+7071 0 obj <<
+/D [7067 0 R /XYZ 90 539.159 null]
+>> endobj
+7072 0 obj <<
+/D [7067 0 R /XYZ 90 513.682 null]
+>> endobj
+7073 0 obj <<
+/D [7067 0 R /XYZ 90 489.919 null]
+>> endobj
+7074 0 obj <<
+/D [7067 0 R /XYZ 90 466.156 null]
+>> endobj
+7075 0 obj <<
+/D [7067 0 R /XYZ 90 442.393 null]
+>> endobj
+7076 0 obj <<
+/D [7067 0 R /XYZ 90 385.633 null]
+>> endobj
+7077 0 obj <<
+/D [7067 0 R /XYZ 90 362.059 null]
+>> endobj
+7078 0 obj <<
+/D [7067 0 R /XYZ 90 338.296 null]
+>> endobj
+7079 0 obj <<
+/D [7067 0 R /XYZ 90 314.533 null]
+>> endobj
+7080 0 obj <<
+/D [7067 0 R /XYZ 90 290.771 null]
+>> endobj
+7081 0 obj <<
+/D [7067 0 R /XYZ 90 267.008 null]
+>> endobj
+7082 0 obj <<
+/D [7067 0 R /XYZ 90 256.634 null]
+>> endobj
+7083 0 obj <<
+/D [7067 0 R /XYZ 90 232.821 null]
+>> endobj
+7084 0 obj <<
+/D [7067 0 R /XYZ 90 171.358 null]
+>> endobj
+7066 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F22 2982 0 R /F94 771 0 R /F75 562 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R /F39 2335 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7104 0 obj <<
+/Length 2201      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�F}�W��
V�����UIlmm�Z[y�U*�
I(�B����s@��%	�ݭ̓����>}��I��{������'��!�"4�.�{!����ܻ�)
&ח?z,��D�2��������O����˓/'^a�X�қe'W�؛��=�X$�g3(�8epM�O'�>�N��з��4��@3B!V�w*�U�dJ��ϗ��N���뇸�wo
+{}_��yr�j��fT'����L��W�����xM! Τ�P�V�ϔ��\�j*0�g��VA`����K{��f+��>�9���H�R�P�~�

�
+���U��'A�k����zS�Q$�U�����1
H����r�B_�){�g�>�
w}p�;�s5��tG=����Px�ۀ�E��6WR����
����b7�aD�h�.�ʎ��d(
H3(�sVϝي<]�;xefrm6��m
~Ƙ�)�Q�e��CR�����8t�'O�u���qq�5	#�V5��U	$j��F!���X�-�Ⱦ>��
>T��W}`X
��"��"��H �+0͓Z���K���6��#d��7�Ve��q�Ƥ�X��G����(���
\�����D$G4�G1}}Y&*�'�/NaO�����Rz�1Z(��.8�(��[M6(�� ��ɸz�� a.vo��ʊruS%���z�P�gق���77�onW���Q6\/-��ٔ�B�ԲA�F9iԵ�z�1��hto�M�ݡ{9�-IS�ޮF�F���p y1"��!�|�	���"������8�u�z���F� ���� < �@`�S ���?}��j6� [...]
+t�֩������G;!V5�5x�g����ɋ�.m�N "�U�h��'��N[�w�vŠW1mz�"
+�b'1�^&S��I�P�T���fe��M��{z���)�T�j����k0�D�
�r@]���l�I$�3���̀���_o���i�I��ue.&�
+�x�gD�D!��c�lW�p ��w��%ґ
�9C����ńQA��zP�rL� 
+��B.��pO����B`*���٠��YbĻ�Ҙ� I�n
�zR��	�9kw6���t(E�s/��#���7�/.~�O�FO�R� ��,�۟��"3h!s������-s�i
����|�Hf�!�RK�{،�jUA8F�5�9�h�Ty��;�)�j\Y�\
gD��k
sL�s��� +
++����>����̯��ҍ���(�qk�̱�xx&�e���~�ˬXh�W�"�>�I=!��^ Qd�of2l�q	���\���ef6���j���m�^?�5�M��{�D����vk�բ7=Y"�Z�4Uq�	|n�H����B�Y���H��+��q
+�Pv�#�F'�6#���-�{�$��n���Nc���o�0j�
��&�B
Z�C���c>�6�Kcm曆=[v�:<�8�mbڑTB�e�/�ȑ�"�֤��Wx=�vT�B��>�ނ@/Z�&X�Pnj�����`e�@_�˰ggPrl�
&�‚ء2@
˿�w�
!P�Epd��5��o6��T���1��T"Fhm]P�b� @�Oc��TQ�D�+� u�P6��$W�#6݂֕/GDr$x�R�l�x�3F�ٹ.=	e�'ғu�|�%ғI���D
�$�l�7�Mٚ�w��ׯ�Y���⁛�_��R��sq^&*�����հ�����}]n
+�
�Et7��HX����3+����.�\�i�ƫQ:�`����#!��r��FQ/ �w�)�
����D���lψ���*������3�a��>/tR����(�E]
󪴘��p��z��aY/����0�$�}�ӯ
+r�
�]l�yy ���Y��� �s��$
���ˍ�\�.:
�PN������0��`��#V��m��눈��u&
�7������x?D.�~мG��=I�R�;��,fNj�ý�5���]Yd�~�]���΃�m�Ӈ�T��
����n'-)zx���%�(���߹�M��ED���L�IR�r�޼l���ʘ�� a��)țvMi�Y��#Pa�fѾg�9
��T����/g�wq�lj
+
�O�@�ʪu AdQ*�1�&:h�O��C[�
[�:1[�)J��P׋�����}��{4|M?�P �Po��e�~�G164t���[�
+endstream
+endobj
+7103 0 obj <<
+/Type /Page
+/Contents 7104 0 R
+/Resources 7102 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 6964 0 R
+/Annots [ 7064 0 R 7087 0 R 7088 0 R 7089 0 R 7090 0 R 7091 0 R 7092 0 R 7093 0 R 7094 0 R 7095 0 R 7096 0 R 7097 0 R 7098 0 R 7099 0 R 7100 0 R 7101 0 R ]
+>> endobj
+7064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.417 685.28 206.96 696.184]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a5691758c1bc58425ab2e47b5ef1b5431) >>
+>> endobj
+7087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 657.367 160.465 668.271]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a8cb48474739502030e86ee234c17f0bb) >>
+>> endobj
+7088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 629.828 175.967 640.358]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_aaf7354d4275ed3c36ba7e24536fd0d00) >>
+>> endobj
+7089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 601.541 204.739 612.445]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a9ca80278a9bd107a4e3bd1f08f90fa88) >>
+>> endobj
+7090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.076 601.541 283.313 612.445]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 573.629 244.091 584.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a3c0fc9e2b5b43528857c2fbe3e96b81e) >>
+>> endobj
+7092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.428 573.629 322.665 584.533]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate) >>
+>> endobj
+7093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 545.716 191.718 556.62]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+7094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 545.716 288.852 556.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ae49b82ae95d6fecdbe7d3d44d84dfb55) >>
+>> endobj
+7095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 517.803 191.718 528.707]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+7096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 517.803 303.079 528.707]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_ad2240e857f3c1b0c3d76a26e8f731340) >>
+>> endobj
+7097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 490.264 150.493 500.795]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_aaaa17e7ba528aced3a8436194c4d7119) >>
+>> endobj
+7098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 461.978 264.424 472.882]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Determinate_a6874db32fb21728ef129e7a2e39343dd) >>
+>> endobj
+7099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 369.103 123.644 380.007]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+7100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.198 339.523 276.837 350.427]
+/A << /S /GoTo /D (index_Bag98) >>
+>> endobj
+7101 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7105 0 obj <<
+/D [7103 0 R /XYZ 89 770.89 null]
+>> endobj
+7106 0 obj <<
+/D [7103 0 R /XYZ 90 702.284 null]
+>> endobj
+7107 0 obj <<
+/D [7103 0 R /XYZ 90 702.284 null]
+>> endobj
+7108 0 obj <<
+/D [7103 0 R /XYZ 90 674.635 null]
+>> endobj
+7109 0 obj <<
+/D [7103 0 R /XYZ 90 646.723 null]
+>> endobj
+7110 0 obj <<
+/D [7103 0 R /XYZ 90 618.81 null]
+>> endobj
+7111 0 obj <<
+/D [7103 0 R /XYZ 90 590.897 null]
+>> endobj
+7112 0 obj <<
+/D [7103 0 R /XYZ 90 562.984 null]
+>> endobj
+7113 0 obj <<
+/D [7103 0 R /XYZ 90 535.072 null]
+>> endobj
+7114 0 obj <<
+/D [7103 0 R /XYZ 90 507.159 null]
+>> endobj
+7115 0 obj <<
+/D [7103 0 R /XYZ 90 448.384 null]
+>> endobj
+7116 0 obj <<
+/D [7103 0 R /XYZ 90 399.738 null]
+>> endobj
+7117 0 obj <<
+/D [7103 0 R /XYZ 90 325.93 null]
+>> endobj
+7118 0 obj <<
+/D [7103 0 R /XYZ 90 303.549 null]
+>> endobj
+7119 0 obj <<
+/D [7103 0 R /XYZ 90 303.549 null]
+>> endobj
+7120 0 obj <<
+/D [7103 0 R /XYZ 90 235.3 null]
+>> endobj
+7085 0 obj <<
+/D [7103 0 R /XYZ 90 212.919 null]
+>> endobj
+7121 0 obj <<
+/D [7103 0 R /XYZ 90 212.919 null]
+>> endobj
+7086 0 obj <<
+/D [7103 0 R /XYZ 90 159.26 null]
+>> endobj
+7122 0 obj <<
+/D [7103 0 R /XYZ 90 154.776 null]
+>> endobj
+1235 0 obj <<
+/D [7103 0 R /XYZ 90 69.508 null]
+>> endobj
+7102 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F11 621 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+7152 0 obj <<
+/Length 1415      
+/Filter /FlateDecode
+>>
+stream
+x��X[��F~�WX�Cm�,{���R҄*�Ds��I�|�\T0��$9���]��N�ڴ����̷3���.�~�<uz����2��%	��ip����c
#��8[��aDq�Y=.�i�o��Y�=��/��Y�ED�I:Iƃ�&Η鼜�L���O[��[n����uo at HM?#)A�U����AH�W��4/���ŷ�"���m�]�8�2��14����u���p��[p��V��N�`����*��.8
E���z����}y������"�TR;/G��
rp@���@J�u��
���u N0:�h'�N<W�m��.=	`D1,
�_
	܎i�Xx%�~����i��R��9T
	k0���q%<ÈQ�����1�5��A at a,�����:,8Ra�YG
Aa#l�U�0̐���R�E3��Iq
�\�F��`h�j�a)��j�Q)��\d�z6���@P�kd�FX�,-��x
Ȭ�uv��@�a<�� � 	H at -
ؐ\'p�b߈���"� ��'�6��K2\��a)�ib��5�s�1VYNi-���e��F�=�f�$K���!��H�>u���H\�ې��X���li%?s�z��I���HE���"�=C���2�a��Z!j:1hUHB
Zm�,���a���
�`k���,���f��
+-muT -Eô�
�G����By��N�p���Y�v/�M�C�h�jv�u��t���w�ܾ
+>��
+��[����hy��]W�<Y4 �t���Qr΀�#�^�5�@�=�(Pr���,��
���4'�����V�z��:x����Ղn��[SV��k�8W`wVւ�{ ��Ҡb�m׺æw$��QKH�佥Txk�����#�S ��U ��%�70I#���\(� y�ľ�1Uk�A���!
+;9O=��5�#��O��b�Y�I��u7�q��{~]ӛ��ፔܥsD���W
We�\-��u� ��L�]x�
��j2
�#�����(
�����E��f��I5�㽋gY������d�]?�0��
�E�����œ�6T_9俜

�g��<�'��6�d��D�\�uI�|�-�14����H�E��?VD�,U�$�l���~
o[�[����
e��?]���p�������

+Y�"nؗ�%��(��\z���t�yH�p�q�so�-��#����~����#1I����!)���Lg�'����M��x��7��w6��Ƚ[wI����[w{�w�R=
���hU�o��]�}	���%N���ۻ�$���!qC�j�GP�eP�n��W���k��;����'�?܊.�|�����$���f}���^
4���U�t]��}��]�v��7.��ie��z�hy�q���`��
�u Άu0
+endstream
+endobj
+7151 0 obj <<
+/Type /Page
+/Contents 7152 0 R
+/Resources 7150 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7160 0 R
+/Group 7124 0 R
+/Annots [ 7125 0 R 7126 0 R 7127 0 R 7128 0 R 7129 0 R 7130 0 R 7131 0 R 7132 0 R 7133 0 R 7134 0 R 7135 0 R 7136 0 R 7137 0 R 7138 0 R 7139 0 R 7140 0 R 7141 0 R 7142 0 R 7143 0 R 7144 0 R 7149 0 R ]
+>> endobj
+7123 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 7161 0 R
+/BBox [0 0 444 144]
+/Group 7124 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 7162 0 R>>
+>>
+/Length 563
+/Filter /FlateDecode
+>>
+stream
+x��UMo�0
��W��%�aI��C�b��
�ء�!�G�!-�?J�dž�t=�CZ��
)=�'��<j������_�	���o���������7~����#��{`(@��#��'4&�̝�;��
P�L �s+�R��n�t�X“�d2��x2�Pk�����!�!g�<T_�5�G�96Ԑ����
q�\�*6�$GG��5�_�ۨy��+N
�@>6ʦ�0�nKȷ9�u7�}lt;��e���>
JíI�����Qx���$���3Gc/�2 ��KV�	gJ3&2��)\�F;dS�-��*��2�!F첀ݰ��) ���"7ގ!�)�u����
wmW�Y����)��@hAp^c�C�V��P���Űa�,,G�:
�?&1�m�
+�9e�r�8���_����8S�����aѥq"M���ZO
�~K�5�5
���{�ΪFଳe��kd
]����J_������.4(�.�f�5|��`]P
j/�	�u֓4��I��Ϟ�]ZE�J]R���^�v�Uy<5G1;��w�$�+vci�oS�WA?�9gۡ�ς7�	� }��
+endstream
+endobj
+7161 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+7162 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /NCVACV+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 7163 0 R]
+/ToUnicode 7164 0 R
+>>
+endobj
+7163 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /NCVACV+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 7165 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 495 556 500 611 278 556 667 500 556 500 584 278 278 500 611 278 584]]
+>>
+endobj
+7164 0 obj
+<<
+/Length 7166 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mk�0����
��E�� B�^<�n�4�l�Ct��Ƽa

'3�����=wf\Y��fy����(G�|s��@��$\05�5R�ʩ�I�/۲��='M��\V��Ó�zHc�S�Fse����.7kh"��,i[�H�r/�}�'biH>v���u;�����%&s�$gE��%��\)i2�����i2�_<ϑ6h�ݻp���YVfm ��<P-@b
+T"O�*�"� 	zD���#���T�d�"VQ��*���@y�g�C���!��~�_���WT �ձJ�A�+�5�~0���}��
��a��'�I����c/�+ы��@����
�~���Vɛs~��*�M�wh4t�v;�=+���iʧ
+endstream
+endobj
+7165 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NCVACV+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 7167 0 R
+>>
+endobj
+7166 0 obj
+368
+endobj
+7167 0 obj
+<<
+/Length 7168 0 R
+/Filter /FlateDecode
+/Length1 2760
+>>
+stream
+x�UV
lS����G^Ɖ��M����yC��4/�C�1�!o�$uH�G]($0���LBk(��n���Ml�4�2�B
��!ZM��N)��6�5l�!�
�r��\;��:������������e�"�Y���>@�U�=��ԡ��5Gn��ګ��F�]��#��
+�+ӆ�LO�,ѹ�ȁ����;D/���̾��3 əD����g�
&�.�[Hg/ eˠ"@2�
y6�����8.�ŖW�Y
�
��%�F 4i�� l�Fr�;���&��a��A��Fc[[�
���o�噿{�=��AQt�Y�
+�	`,�
f�`�
nA+�����r�&�k��v1G�`t�נ^e2�k?
+��&%��BM �5���i,�T����^SQY��{{��Z��q�'-M�G�lGR^AG`�Ş�������h32����2��-EA]���WB����z�i�z�)I�E�a��@ Б�X�"���y�!�
WI*:�D�|Egl�E��Of~Z1�ه���6g�$������Jͱ��Z��Jr�v���	�������J�D�E}�!z����b
��.:
��17��2�O�XI���.�ܒ�5�).�
���N�.,�4�|M�]]�z��o/���s
���`h��B�����d�� O9���)j�ϙ҈�T�#����@�dē�+���t�!csʖ_�b��SSڴ�L?��a��	� YFZ��E2��
+_o,������*���8�.
�俲e��e�

����
��&�ȳ�-d�[ң�0ɱ�56�0Ig(/���?.�^�>v"�:�.��Ў��
���
<{��Cv���]���}=�xfP<���`%K
�K�r�|�AEf?��֜���/

�r��	�
>��w{�//�߅���ف����
��#�������������n�e�@��X�=
}� ����	
����㉉�}����C:G�A�
��|A4�����Dx�Hx���.����`�k������oďg����gc2y�?��*��^#�O��/�Ü�����7�#@�՞��cʊ��_{���߿25;;u�-ߐ�|�}��kg��.q�}y�
+�!�wI��
+��,���{���MM���M���S��<r��O_��]�k���A�0>�E�7�O�U���t�uRX{�e�����V��F�)�w��&�#nE1��8����@b��������Ʌ��"8讚ڿ�w����Fb��O1k��%�2JY��{C�BZ�]�ʖ�W�c���
+���b��Aѫ�B�)I�����Y۝;w�y$��4���
���Y%�YT�+d& X�P�
&=�]U��&������ã#�
ˆ[�v���b��������f9�p��v��mlOQ��w8du�����pd28Y�s��L�sl�=ş�>��ɣ�
l��{�YM˄7�G��� U��-a�B'^
��χ�T>�n�����c���1�[�1���,�;��‡��꾫�>���}�|����N���3�Gȡ|�"������
�"ō��h� 7cL�KZ���h/�
j�����ƥꭒ����[�K�ܥyY9�FscmKO�#P��)�F/A�1}���03~
+Z���6�PJXxO���Ǯw.wq�Q⼱ރo����J���6Q%YQ¬�k�3KA�F��9��R�w/ŽM��������z����M<=�| a.�-	&�ſ�b�Ą�^
�?aG���,8�^k�^4�Rt1�l��drʚű�RV��:AM�	�Y�w
ڢQ�!��C
�ʚ���ϫ�3j��D��dB����z��i���T�&��
��t� ��,�
٤�1�؛���dN�~�RT_r�7�������
r��:��DX��f՗�_s��V+5����
�>�0�J�;����&V�Gt.|
|
&z�=(��A�G�
����ٟ��F�C��l�Ӿ��,��O{��1�j�Rz4F�N&^��{h���*����	/и�S@��ul���+5
zV�]Qu��)
�^Mw<��?C��o���k���
RK�^{��C���q2>H^��hPL���SQ����)�L���AM����G'
+endstream
+endobj
+7168 0 obj
+2044
+endobj
+7124 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+7125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 407.166 224.395 418.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 384.232 189.925 394.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 384.232 260.898 394.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1a5c8e881f8449ae038fc40642062df6) >>
+>> endobj
+7128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 366.632 422.545 376.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 339.399 224.395 350.303]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 316.465 232.982 326.393]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 316.465 347.013 326.393]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_ab156f789e720f2d04086a672448ded40) >>
+>> endobj
+7132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 298.866 389.11 308.771]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 271.633 224.395 282.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 248.699 254.671 258.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 248.699 390.391 258.627]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a7cac2a7ab2e138c7c0e96354b32b0110) >>
+>> endobj
+7136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 231.099 465.458 241.004]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 203.867 224.395 214.771]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 179.956 181.207 190.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+7139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 179.956 243.464 190.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a3ae2260455d60d464a71a9b82e49cc9e) >>
+>> endobj
+7140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 163.333 420.593 173.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 136.1 224.395 147.004]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 112.19 159.628 123.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+7143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 112.19 200.306 123.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_af0800054c69699766ed5188e3e11641c) >>
+>> endobj
+7144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 95.566 400.176 105.472]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7149 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7153 0 obj <<
+/D [7151 0 R /XYZ 89 770.89 null]
+>> endobj
+282 0 obj <<
+/D [7151 0 R /XYZ 90 721.073 null]
+>> endobj
+7154 0 obj <<
+/D [7151 0 R /XYZ 90 438.12 null]
+>> endobj
+7155 0 obj <<
+/D [7151 0 R /XYZ 90 438.12 null]
+>> endobj
+7156 0 obj <<
+/D [7151 0 R /XYZ 90 370.617 null]
+>> endobj
+7157 0 obj <<
+/D [7151 0 R /XYZ 90 302.851 null]
+>> endobj
+7158 0 obj <<
+/D [7151 0 R /XYZ 90 235.084 null]
+>> endobj
+7159 0 obj <<
+/D [7151 0 R /XYZ 90 167.318 null]
+>> endobj
+7150 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F22 2982 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F67 3022 0 R >>
+/XObject << /Im8 7123 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7180 0 obj <<
+/Length 3027      
+/Filter /FlateDecode
+>>
+stream
+x��[ms����_�63.8
���"7�Ic+��N�Z�t��h(�8�B��_߽�8�@�
+7�?�{��>��8bD��j��ǷG�^���Ύ
�(60�H*g���$$|�^g���۳�LjD�����o���ٳ��^�ߎ��
�tD�'< ~��
LG����n��у;7h1���|���G8��idHK#B!^����Pe��d8ݲ���"/����rR�V˵ӪZc���D�ƴD"�� 
�a�7�������8�X���]bq��/7�
�,�q1�9o?n|���Z��9NNϟ/˼x7�"�Ͽ�X��xR��*WEr�G�ey���~	�4�O�
���ɐ�lU,�
+҈K3���J�旕�^IT�$��`G=*�������\Cۃ��BFJ�<���S0�ڋ�
k?Wy���|Hq���2���5��ߟ�ϱ����˫;`�6��߰Kv�ۻ(R�-�)�)hFA3�
[�f��t�-��!�nR6� �}>{:����̋|9��O�q9[^���,|��U�E�%�fR�Ť
+��ر퀂�Հ6�φgn
N=4*L�K?W$��8ID5�_w�{���gЌ�H
+
�����f
d��`*��cV�J�`>��A��,����(Y��nV^�f"
+�Z܇�4�Z�YnD�#�	X &$`�b��
e�����y��6����#�d��X���
Tڏ��A[)d4�m��yh���*��1���c���"�8�^������.r��������B�E�3Ii֠�"l�F���(���a
W"+�V����o"�
�`	|}<
1M�
K����t���
+.�
D���MA����^
�[�y���
�LVE�w�ZN�'�U�~� ���2��#B�p��6!�yFL�H
q
������
�zo�i��f3z�>�	�(	p5�\U���
�Q�=��	�7L
��%˭L�Q�o�0�J��B�<�ټx<�y���u^��|�� ��8G��ֈr�xP\����`��y9�ͫA�I1�)ۆ�>c�/n��2OcH��h��J��%�
(�8�L�J!ڦ����ZdK�B�;L]�t���c ;�:
�
G�;���
@>��
[{��ِk˴V	`[bIi�U��ɂ:�R�#�b��I�S 
�N���;�V���k���!������}�1
��m$Z���
�C����H��	�!�!T�PX mD��]c����@W���$;�5������Q��(���F�_"��v&%M�v'�F9�	 �0��%��߂4���m�
�Ye��R��
B}͑R$�?�b�
B�R��,�b)��I� ^2�QC@٧[j��
]�Ro�B�񄫊{�ס��/aǝ�+�)�Q:��.7C[��v" ip��g�u����,]:��+�R�
����)�d

>���q�S\�M<uSM7{��!h�79�(U!�N�a�
�x�z��o��"�͗�:ȼ"+�,[]�;�³F
�]�ec���Z�\�W�P��c�ߦ��x���`T��
��ؒ��
l�lR_ے���_m��`.w�X�
�mq��ft�Bq��{,��K?��v�sXSU3x�b�"6(Tm�"/�~�m�*��
>aN*�n���D�s=|N�����,lT^p7�!S��^���2�jj�ȓ�D����̏�M�@5^'E3��c1�h�Y�A*����ٶX�2(�.�c�q
��:G�?����
��M�#y
(�6G!?䱴h�D
+��;(2��b����a%t�m�ʖ�uy}|��
�)K3�i
�3�����aͽ��"���+��
dq���Dž

c�!���_��m�`�eh��4v'm�ph3��ƾ h,�d��v��n�A	�A�~0���׫[�h��Ɔ �V7y1�X#3�QڶXB��
+kZ�����j���]t*ȡ`&���6�q��PMj+R!���\n�
��
.C �'�;�T86���%}� ���݉
�����=�s�؅�Ġh���4�R�ˆ`�ϐ�"�Y"xE��m�.�o�sa�XSf���uPcЯ�l���<��.�u��e>Q���߉���F�L�A�V�B�n�*iL�k��08��}K?ڌ�%��Q���>bK �
�&
>��͚
+)+�
+�V<4�%�����PGu	��
+�>��˂b������]�؅������k{9Rʦ��i�wP
��Iw�U6ޕ{����=lw���������
�y{�=��_�aU��ob⠛�g�|���Ď�qPΖt
"����ۙm.�6�;F)���
7���ACT��EC޵+��(� � ���3��Z52��%�&�`_�Ц4 ɮ�LV���z�{մY-S���!�%5�
+�J���	�B�}�pu �H�F M�+��ao0��eٓ`$Q���,��=%��� �,i�� �"�R
 8O��K%
�B~N�oa�$^ix�r�W&�Y�Wߺ��f��ߩ;p}�u���l
���4XĄ6g��>�jO��~�Z<�4Ŵ��H�Q�hbq�5��^�v� �
rf?ș� '����r�AN?<�4b���\i�`�.�`�W~H����4�x]�������8�@��� D�4%��H�=���q�`�6�"a��C3ގ�8��1�2���geE
�*�S�L? @z8C�pơ���YTk&�1�fG&�Vz�҇�/���n��Vݕ���
�
�2��e��U6��H�:ۧ8�Pe_��>T�ʓ�>��>�*��B�� %Iܵ����ov�d�I3
�+�~Z�-.S���
�H!OGN&4��_'�Z�T��<NtW���$�Jj���IJNk�mt��}�T�B�O�6�[�<}��0���OGa�u?6�ݏ�3����
6x���6Ӎ`��fBw����� ��J�?�W
;=}�/��΋?
��BA�r��u%v����+Dn�\�?����ʫ�kz�~�U���;���sF\י�uY�
?~|q{�ΗWh�ZtO7n
6Ɲ	�^�����h�#�?��9��/��_
+endstream
+endobj
+7179 0 obj <<
+/Type /Page
+/Contents 7180 0 R
+/Resources 7178 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7160 0 R
+/Annots [ 7145 0 R 7146 0 R 7147 0 R 7148 0 R 7169 0 R 7170 0 R 7171 0 R 7172 0 R 7173 0 R 7174 0 R 7177 0 R ]
+>> endobj
+7145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 686.08 169.81 696.61]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a5e0223ac875a8b0d999efbb9b349159e) >>
+>> endobj
+7146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 686.08 309.485 696.61]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 686.08 514.653 696.61]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 674.125 227.553 684.655]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 646.684 169.013 657.588]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a10c114a4a966a22b16ec30dc8fa036d7) >>
+>> endobj
+7170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 646.684 330.636 657.588]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) >>
+>> endobj
+7171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 585.961 282.901 596.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1ac494c155283df2c60cc98fd44e526a) >>
+>> endobj
+7172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.119 585.961 396.604 596.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.8 574.006 284.284 584.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 538.8 290.65 549.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a722ccfd31ef9e2761c705d678eb42662) >>
+>> endobj
+7177 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7181 0 obj <<
+/D [7179 0 R /XYZ 89 770.89 null]
+>> endobj
+7182 0 obj <<
+/D [7179 0 R /XYZ 90 704.286 null]
+>> endobj
+7183 0 obj <<
+/D [7179 0 R /XYZ 90 663.529 null]
+>> endobj
+7184 0 obj <<
+/D [7179 0 R /XYZ 90 602.528 null]
+>> endobj
+7185 0 obj <<
+/D [7179 0 R /XYZ 90 554.106 null]
+>> endobj
+7186 0 obj <<
+/D [7179 0 R /XYZ 90 491.598 null]
+>> endobj
+7187 0 obj <<
+/D [7179 0 R /XYZ 90 491.598 null]
+>> endobj
+7188 0 obj <<
+/D [7179 0 R /XYZ 90 428.947 null]
+>> endobj
+7178 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F75 562 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+7196 0 obj <<
+/Length 2657      
+/Filter /FlateDecode
+>>
+stream
+xڵZm�۸���Bh�Vb��"�����kR���S.0���+�,�Ir���wH�2��d�O�iz8�y8���8��p����WW/oi�%��ji
%� AI��Fc�S�%����i�O���U��>����M~[�����W���9o�\�U���]79/��O�y�D�Ycf,>�~yyC�du�5�"���sS<A!�t?����u�f�]תW�W���_���ђ���ђ��~w��"�`7m@AW�
?<��?��iK*p�Zhg��"m37�>�en���
�D��Rm�^����㊀

k}.P������'
ma��|�U��N�G�2xч�_�#%�9vL:?~���,�Q*a��Ɵ�G�)3�#ɍ���M۹ij"�#jM���y�����r"r�*� n��50�
|��ى�q{���"/��v�;�{�T��C�mݧۯ�hZ��;�a�����:�y������gsL����"
+#=
�8w���3 B�9[:4R�V�G�:���Vv�m�%��n��C(�	��vf7
+��&��6$D��m�w!<�$�!@x�`�)"��(�qj
$��C���7���u���1-��̼�|�K at w��\��6U`�]��p��.H��T�MET���a~���]v�X2��c|M�"��l�3P�
�Mk¤���
�Y٦m9��5ahI9b\{��Vh��t��$��Y��v���Z�e��S���z
�(��$��y�=�(�JQ�F3oesl�V��i�"�R��/ �4�q��%4�
q�|
V
�L�q6x!�`��^B-�%��jݜJk0I+2Kk�<8�����"�� �q$`�;2���$�}W�'`dE�9
�	O���.$|
�@��lK!�Rj%�<t
ȃ�m=}���W�
�(�a(0�PA��a���9xa����D�!�__�\���l�0#N
oXrE e�MD�`tGL��ۦ��M���Vx!@Q���9���k�J�c�$"M����1$J��G�_�&�����ޝ��`�_6�V�|���Lb��k��
+?�`&�^
liB��I���ݱ�z�QhH{���p��hr�n�E$RJ��H�� 6��2!�@;E�R>׵�~�=�:�����=�ŧs
�,M��PF R��o�S�u����%3!m Jn,{���26�e�73�5�%C����RE����ws,a��QS��,�S.'U�)R�Ͷ�G��
vPu���9�(���1
�ŧ鲽ϛ�R�˜��a�P�`����/�۰O0�9������T M:C��P�
�!�č/q��V8��}i���������U��
֩���@���y��T
u�*PXk>��H�	�Q�!'���,q1�ш�0�L�<	9�&�F�
��Ɋ�
��<�S:
S[=C��ކ��{A�\Z��B������.
��>5~~��P?S�V~Duﮟ�

}��'=nD�.���KtR`����2`jq����CO�;E���	"�Sg@о�榥c;:D=
8߭�i7����o�wK
&��z��u<�������P��Զ� nH��
+�v��>d�Ӛ��<�9l6Y�Ͷ/L�P����.-�Ъ�"�
�����/y��%�9M/�C��t�ѿ*C����
T��f2]�\ޫ��0l�|Wm6���
���̨ݘ�9p��:3Yi�f����M�l���n�u���C��۫�D%�ڱsQ:�u
�r��ږ
V#ɬ�:���l���+ӟ��}j�3����UZvϦ�6y���pg���M�ː°
5�iQ�Ղ٣2�O�B���έe��]
ov�;����oʪu/@rm�m��7�ƥ���9���Vu��������/��͇rڇ��۬3UiZ�8X�|���f��fͦ����j���fm���
�������7��P�`�Tc1�7cmb�I�Gj������"3���Dg>�he��
2{_x|Wx�?��Ҷz�ۂ~
+^
v�]�
+�+A����#�o�
ŗDz��S%�����A����j�t��Z�>
�g��b�Y݇���#�� ���~��]U
�v�
����ۇ��a
+�z����T��>.���C���O�q�Dm9�K�	��Kd[���@+H�n
`T}��u�.�o9��
#K�*f4�
+S;8�xR�eT��.��Up�7�N{_���jhso�\F� ��ף?~��1�`��E�f
Ȏ�!/��L8��2kK�%���0C��'v>r���a�+����~�ܴ�.��T��

���@-�+]F�Q�f�]C�H7=-�Y��M��wy��
��3`

�����Ĝ$)w���r�c��ᄓ�Fk���ܶǿv���l�������8׈�@�
�67p�� ?N"z�q^�va>6`���r�=8�u�2
+Ѐ1�s^n��6t�k��<�z��
7����w!�C I/���y^|]�����7�o��N��u�ь�%S����bA�S�9`c�!J�S�b�9~� �Z;�����KkkC�v���ӓ�g�w�޸�_����!�
Ax�����g.�
��G at Al �(sဌm�e�nN�ߣ�ퟮ�
�!	�U5x��m�_��=�Aut��=
���^�j
������
��U���1m�9��I�����"�$	�3����������{����c��?�<�
+endstream
+endobj
+7195 0 obj <<
+/Type /Page
+/Contents 7196 0 R
+/Resources 7194 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7160 0 R
+/Annots [ 7175 0 R 7198 0 R 7176 0 R 7199 0 R 7190 0 R 7193 0 R ]
+>> endobj
+7175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.089 707.623 513.996 719.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+7198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 696.002 126.862 707.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+7176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.811 696.002 513.996 707.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+7199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 684.894 126.862 692.54]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+7190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 279.278 501.708 290.181]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+7193 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7197 0 obj <<
+/D [7195 0 R /XYZ 89 770.89 null]
+>> endobj
+7200 0 obj <<
+/D [7195 0 R /XYZ 90 671.32 null]
+>> endobj
+7189 0 obj <<
+/D [7195 0 R /XYZ 90 648.096 null]
+>> endobj
+7201 0 obj <<
+/D [7195 0 R /XYZ 90 648.096 null]
+>> endobj
+7202 0 obj <<
+/D [7195 0 R /XYZ 90 536.015 null]
+>> endobj
+1237 0 obj <<
+/D [7195 0 R /XYZ 90 199.899 null]
+>> endobj
+286 0 obj <<
+/D [7195 0 R /XYZ 90 175.058 null]
+>> endobj
+7194 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F100 4949 0 R /F8 802 0 R /F75 562 0 R /F91 766 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7235 0 obj <<
+/Length 1171      
+/Filter /FlateDecode
+>>
+stream
+x��X[s�F}ׯ�Ʌ�j��M�3Ice�:�[�OvF�$$3� ����~
,�9�q=m�va����7l�,l�
��
NNJY
�$��diy�R�CB��º�)�Χ�{�IO�T����>N�>N.���l2�< 0�-R*H��<\}��~��0b�k��"�S�ں
�>�M_$��B"��9q\l?�?:C*�=���
"�$��\�q:��[iE�ˍ�?�Z��Ḧ́Q���B�&>B"�[B	�]���<��e�3�b��U?N�E��&����cD����m-04��
SE�<�N�`�$&�@.63G��pY�.$��:iYo|���8s�!e�%n��Rђ���c;��`Y
i��U��0�E\zA���4^'~
ƫ�E�����mdY��-��*�JG�O=u$�8V`�.΃�Ρ����'��@쒈}��хiz6�JE��y~Z��T㱌qv�\��
��{R�"�p{H������W����L,����7A���µ1�]5tz
"V&;U5ZV��}T����B�h��o�:9oi��u������hg����p��!�0e��Ԣ;E�\�N'�uC}'������,�S�O/�$
&��:�K��ɗ>Dc$(�_�D�b�86O�x"�[�ȷR�Ij�˖,_�F��n��k��ѿ� օ�j��eo�s�F�K�=���D9
��$��KG��,��
?}(�so��
�#}��hԶ_��+��H���%B��
���!���	p�5�9����
0lݍ;w�!��b

�J���� �i�o�y��~�%�zw����ޑ¿���
�����|��'
r+���L�jdcjf�	�>�����~D��V�N`جs�)�֌�`��ҵsS������nñ�Y��e�
+��r�݆���MR���[C�gI�؟�h���3Py���Pl���&Ԁ�
���7-�R��u��̟o�m�;y(�s d`%���R�Z"/��۬2�6fS���7�k��q�4fq$q}��o¬�	)I̤�0���D����
5|7�mv�h%E��C�h�\!����̳綿�ݓ�w����
�
+�p#`��r���+�����y��3
�
!���x㯝�wKA�%5
�ծr�
hs�e�����_��h#���7y~;:=�mVY��<�
3�q���J�%���H/����Q�>*�?�]��
+endstream
+endobj
+7234 0 obj <<
+/Type /Page
+/Contents 7235 0 R
+/Resources 7233 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7160 0 R
+/Group 7192 0 R
+/Annots [ 7203 0 R 7204 0 R 7205 0 R 7206 0 R 7207 0 R 7208 0 R 7209 0 R 7210 0 R 7211 0 R 7212 0 R 7213 0 R 7214 0 R 7215 0 R 7216 0 R 7217 0 R 7218 0 R 7219 0 R 7220 0 R 7221 0 R 7222 0 R 7223 0 R 7224 0 R 7225 0 R 7226 0 R 7227 0 R 7228 0 R 7232 0 R ]
+>> endobj
+7191 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 7245 0 R
+/BBox [0 0 418 144]
+/Group 7192 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 7246 0 R>>
+>>
+/Length 557
+/Filter /FlateDecode
+>>
+stream
+x��UMo�0
��W�X�-`�!�0`��
�P��6I�!�?Ҷlř�=FB���ޣ��_`�Nh]�&Z|��7�	�r=?�ͽƧ������4~����C�4n�4~B�
�8
�&[e<v��Pfm@��6�����/�͸�N�tIH;����xPP�y
ۯe�MY圣}i�1�a&�p�ot�YS���wZkjC�h��9Ilk�Dצ��o-�
B��p���x��q�}��?C}
�ml�
g+J!�w�<������n;H�3S'�9I<Q�Z
+fQ�Iّ�H�\KT�Q(�o���
+���,|�
+���Љ��S^t�<�I�,��N�j����$��E6�.��?b���O�-D榛��u�H��H�I6�}!s��+L����k-��K_�L�@����n�^L�e;�'�(1G6��*q��m��׺������|v�������
P�x����o��~��V}�6��{�
+?���Ψ]��j���9i��X�3ǁB0����
�&�l���ϩO�W�GI��eD1�
v��9$%�7�X��PF�W�:s��/$
��
+endstream
+endobj
+7245 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+7246 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /IIVALI+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 7247 0 R]
+/ToUnicode 7248 0 R
+>>
+endobj
+7247 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /IIVALI+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 7249 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 500 500 556 611 278 556 667 500 556 584 278 278 611 278 584]]
+>>
+endobj
+7248 0 obj
+<<
+/Length 7250 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š���t�:�hr�
+5��,|����)TP�<���̉��sk�U��nVZ�0�h�oN���:�H�B�je
+O5u6�}��-+M�樮E����6qx�sO�"~s��h���u����f�MdV�DM#4
��Kg_��D
��V���nG�[�Yi`�-�Y�b;E�3W���_��5���q��w��r�'I�4��@�e�����Ar�D��)�#��@'�
A
� ��
���E��]�;e] � �.~U	�_���W~9��_�]د�/Ǯ%��H¯������ �r��`$�W���r��(
)��~��$�'Gݜ�C�5L�>'���D���p�ԛ��
+endstream
+endobj
+7249 0 obj
+<<
+/Type /FontDescriptor
+/FontName /IIVALI+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 7251 0 R
+>>
+endobj
+7250 0 obj
+356
+endobj
+7251 0 obj
+<<
+/Length 7252 0 R
+/Filter /FlateDecode
+/Length1 2556
+>>
+stream
+x�UV
l�������qb�j��8q����
+!��r
&v�ۙ!I��QA
+�i�e���V(��v����4��L�ЖJ�T���ZX�I��V�`�v����N Kt������=�|߽�e�ӱZ�Y��Dl�<�
�a�z����w�k�|���Xl�u�g,
:��aм��Я@/�'��>��
���&���;Y�Xz����
��%�C/����Q��TȁIF���at�q��B��|i�����o~��`#����N��c�H
��UA|bv��0�'�݋
�`�"W
��7������g��en�vVƼ�����j1�%O��u�J�����5���.g�Vg��w�Ae��io�F���Nki�&�
N��3����+��ڵ}G�&�ԗ3�^���5�7�������H�͕�����Pk���VW��J�u[yT��w�*Qk�P��6`6�EI��<6��D"�E
�����?-������
+�4��/�U�z��*�V_���Y��*�[�m�i�Ԛ��}ky��(�"�&<�Г�{k3RI�I�x}�E��4��ׯ|��aJ���$c�
f�+�5��e�m�Z�x��.ʞ=���̱���P��iO7����
g�R���ĵDb(6%bȜW�g&d}>" �.~3']�	ؕ
ERa����T��N
,�E7�؍��2
~��2ׯ�<�!��兹A��T��S�2a~�ɸ�+z����+
.n��Ӂ@U,$��/���*鬗*���3�Z�,��b�Ն
�����f�8D���I�'{Ex��~v`j�x�}6�"/��"�v��i-m������/��*����7��\��.��bvdjt���>/�ی*����w�
��_������H��>�j�V��K���,�������`t��܂��[��a���x�p���c������~���
�
+��É�T~~� ~�#gTv�����4=��~r">w4~`g�6�o|*�f~����/~g��>��:=��I��l��ź&�Gq�.��§���
��n��:KR�UP?���ۧ޿<933y�/-ʗ?�9}��
+w2��L˘é��$Q����g�8[z�§}�l���&J��J[��N�1f�f�D�j����
���ᶩ_�>ոT�E
+u5�C{qk�]�_�a�6Դ�F:#EyN��Դ�c�g)�
>�
�[���T�
8�wxj� A_���N>H�n����G���B
����aZ��u�W�R�rOj-Cr����ء�Q`�:�|��,�^�='�$���%����y&u����^m<}Z�(�o��R�lk��IF���S�〤�
}8t��辚΍U#mCS��
��g�����X���;���`��

�[
i���=�t{*:�8ݗH�.�
C��"w���J��+�?�(}�:��Y+�����?��%:�I%��<v���_�dd~>��q��u�$�v-�i8mOqچC�1���9ݹs2~��X���
+�#�[����'�������41w�_�J���b����ͳt�7M��~�R�������n1��V|��wq
+ '���
������a~��>����
~$���_+g�Ą3�:>w�E.��@2r��r!���&��6:�t2ײI�D�2�)����]f��ros2��%��V<��]�
����j�0Zd�ff =�f�f�@f#�nFeVfcO�׹L�)�mb�Y*"�e��0�0�U��g�>�����Ok�W���/ԹP��ZU��`�?��������}��/�A^�ʩ�5��X3�Lށ^�>a���
+��BB��c���M�߳~�d@
+��l v��w v����
;���ǂ�6�j
�9lr�P�:�<�h;$2�.�QC�½Ju	�o@��ո�aS��0.
蚋 �
��S;�	��
�b:ܷt}⾦,[@W��C�
W���&�1�� �
J
+endstream
+endobj
+7252 0 obj
+1915
+endobj
+7192 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+7203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 492.208 224.395 503.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 469.274 189.925 479.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 469.274 260.898 479.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_aadb6d4669e8aa852e2f3d11e40c8c211) >>
+>> endobj
+7206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 452.882 422.545 462.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 426.856 224.395 437.76]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 403.922 232.982 413.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 403.922 347.013 413.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_adaf83ce888c996163559b520ebda628c) >>
+>> endobj
+7210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 387.53 389.11 397.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 361.504 224.395 372.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 338.57 254.671 348.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 338.57 390.391 348.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35) >>
+>> endobj
+7214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 322.178 465.458 332.083]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 296.153 224.395 307.057]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 272.242 181.207 283.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+7217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 272.242 243.464 283.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a443736bb8156073cf1c5f672737eb02b) >>
+>> endobj
+7218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 256.826 420.593 266.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 230.801 224.395 241.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 206.89 159.628 217.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+7221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 206.89 200.306 217.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a6cfe9f46fa0f15b09149f89ef35430c4) >>
+>> endobj
+7222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 191.474 400.176 201.379]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 133.721 169.81 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a97422036ac465eef627efdda59fe796a) >>
+>> endobj
+7224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 133.721 309.485 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 133.721 514.653 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 121.766 227.553 132.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 91.906 169.013 102.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ace2048bede4b2b3dc32d64f0355e398e) >>
+>> endobj
+7228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 91.906 322.367 102.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression) >>
+>> endobj
+7232 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7236 0 obj <<
+/D [7234 0 R /XYZ 89 770.89 null]
+>> endobj
+7237 0 obj <<
+/D [7234 0 R /XYZ 90 521.955 null]
+>> endobj
+7238 0 obj <<
+/D [7234 0 R /XYZ 90 521.955 null]
+>> endobj
+7239 0 obj <<
+/D [7234 0 R /XYZ 90 456.867 null]
+>> endobj
+7240 0 obj <<
+/D [7234 0 R /XYZ 90 391.515 null]
+>> endobj
+7241 0 obj <<
+/D [7234 0 R /XYZ 90 326.163 null]
+>> endobj
+7242 0 obj <<
+/D [7234 0 R /XYZ 90 260.811 null]
+>> endobj
+7243 0 obj <<
+/D [7234 0 R /XYZ 90 153.137 null]
+>> endobj
+7244 0 obj <<
+/D [7234 0 R /XYZ 90 109.961 null]
+>> endobj
+7233 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F67 3022 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im9 7191 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7261 0 obj <<
+/Length 3438      
+/Filter /FlateDecode
+>>
+stream
+x��\ms���_�6JNM�/rۙ4�<I�5Q;��=J:[�R�BRV�_�] ��;
y�)'m>�x���������#:zu�׳��'F�
q���ٻ��#�Q��ήF�nja'SF)
�N
��7���	�����uq���7�X����_αŇ�f�Z��,V��|�>6�/��_��v=av\l����ٷ�Ok�.�#R�����$�•-NNϿYn��׋�8?�9�x[<çGS�
�N����T��Ʉ��
+f�������/{��j1�l&S���l�����]̶E��C��^^�-a�s��ף�ώ~:b�
1�}����˛��o��
+n;8;���nF�
�\�~<����lv
˨$
�P���j��l�w���:
+?[^���E����������N�
4� $��7���0���8�^
�^O�	�耥J
��/x�9:~C���}��uղ7׎�[�K�
+(����8�9K榜� /��)7�X�RPF�q�
�7���h�8��6�h�`���ͳ^E��RS�jw)+�Js�B!�h�qAtm����X�X
��ԝ
Y�BKo8��
+��+�YGأ�Ϸ�x����U�u;[�
g7EtW���Tp6�@�x7_\m��Ex�j
G��s
+�
+�n�`�{@�*L�Z}���:޻]-��j�]�:f��	i�Q:Q��шY"E�e&r=M�VD�s5 �.�%�Ɖ>�&L�
�]�f*,�E�;�Z
�6-����g h'�Ya�qn
+a�nj(�4� f����ʁ߱��$^E�j��r��y51 �-9[  �
��.��mq�~_�\ $�x������\!]#1 ,�/��l�({�/���m[1�
��ۖ13���h��d�ɶ�Z���@6�NN�q�YT�H) e��-��p��j20��{
�ʨ��L-�$��pn��CH��!��T�����aQ� � �p�5�I"!�J�:�s��mU˿����.�
+�ҧ��	cw�3`
�'���Dpȃq�\�+����>��C
�Jro4�Ͽc��Ja-QB
D
+D	�-�F�8��J
+� 
�0�

�'�tS��

2S


`d1
+BF2r��[h��P)wy+���Q�?1v� �[H�
K�栄r�� 
��-
�
F��K"��aĀ�Uٖ�.	WmJ {3�N!j��/Cn��XB������KL��;|;-s:�@�B�	 �J�r�u
E�t��j�+�I�|��;�J��H!� ]
+���d,�3��Z1��$��:���Dp��(0n�
SBءH'��
a��Zº@���&�y
�,�ջx�x� -Q�
$9���!��֦n
��x ����.K�����[
M1'E*h!��t) �G]
+��1̇���T�'
�6�+!Q���,�j���t�O���x�.t��������P�KX�
+�v�.�JJN�W�xG�/Q�˘�,f���3LPc��m�
���IMK�w
\.��������”X/�Q�"�u�	�*՝��� Sm�?�
��"���I^��Ј³�`�ƷRL{2%�V>�f��L"����3'� y�w�6�9��93�2
-	�� ���MZ"j��媌L�qK�ɴ�8���Ѯ���笛�Z
P�z��YN������yiB��m
cɒj�آ���f��	�c}c�/�b�k�
��Y,߸fG�H��}VC�@�"_wb���*�Շ�7T��
����Ǜ�
��D

+��m�����Id��m)K}`�B�^��rswy]F�����O��M��2DSI3�	A
����z
E�Ի=�0xC�(��2Ѓ
ER�s�r�G.qI�PQT�v=b��ד� 
��T��2PF at x6����Ȍ�_	큨fp���G�0�
cf=E5}c��ƖYcw
{wz]秌�����h�94�TKZ��,�*C��\�f�R��L�v�L)<Y�o(�}�-��.�0x�ƛ\
+�����,m��!�l�mN�u�IQ�
�1�Q��%�����Mh�؄�Ecz�CLި/3����}8j���@=~���4#�e�D��1LZ

 ��˭���05$��!1L'^+M��1L�ˑ
� �!�I�J��%7{���T����� �M�Ἡ���Tԛ�!�T
Ą��0
hŽ��]Wy��!�"`d���?Q&��B����4�:>
����m����4]�I��K��[ ͬk
�2%Ϊ���\E�]�3{1�2m���@�U����QN5+A/��rus�����d�|?n��9�AW�����}�:���X�=����[�]Ղ�V�SOՏGp�R�[E���t�㦬
|��\��"3�0*���N�笎-c�L������(
�L����*��k�A���
M�K
�=#'�H�1y����{�L��@���W� �N����^q�yhrP|��|<�炧%��&:۔��b���
g��gd�RÚ�%?�Dp�~p��!��0�nk�_u��಻�U�� [...]
t~�IЕ��J&ڟ����43(��O�;(ܒ�$�	�j�A濤���ם�= ��;���Wl���X�r	qL��
w.Eo����!�~�6�[�i�����h�^��ˑ[����įiEi�_R근�ڦ�u�_�3�������5h�A��,B;t�����8���,o����*��leƓ��L’����۾�|,[ p��j�"'��Y�����!^����e\�<.j�}�/

�2|����%��/� 6A�Y6ѪF*
�]xF
�o3k4
+|�
>�|��|���aF4�@C�{փ���5�a���B>�]�aQ�A���;��`�Snp�Iy��R`9�p����T��
�)j0���Ǒ\J
�(��d�[�O�^�a�U����t�7Na��T}.�� �B$X����!Y��V 
+��
��D;
�%��4ed�j*��
�Ie�
��L�9��p<���.��_�ܡ/�!?����Uڬ���C�}Ky��G �l�
T,��5��
�'��
/��
�}��0þ������xw�X������^��zN�wv�Ѷ����X<>^
��C1-��SB���1�>/���G�r̊je��1mզ��n�>��_	ӌgO�x�M�!m�����J+=s"�8��L	m	u�
����xc�s�
-�]}z$Zx#�g
88�`�.��G���c3�������5�,)�𘅏5�,�,
֩��*�Pʗ%@�ˁ8�#��3��p��!�h�`v�Y- ��
�í5<��}�PsOH�)�?�c�ǫ�
i�r18���sNO�
���?L�G���ly��v<�
JB���#
b�G��M�?%���
�W
�n�z7������v{{������M�|O`}w�֘��;�i��;t��5_�7��1�f�KE��tQ�П���3c�oѼ�?��Ͽ���+Pr��#��SS
+endstream
+endobj
+7260 0 obj <<
+/Type /Page
+/Contents 7261 0 R
+/Resources 7259 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7160 0 R
+/Annots [ 7229 0 R 7230 0 R 7231 0 R 7254 0 R 7255 0 R 7268 0 R 7256 0 R 7269 0 R 7257 0 R 7270 0 R 7258 0 R ]
+>> endobj
+7229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 688.577 274.632 699.481]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a983bda3cdbc99be37b6d97901098c765) >>
+>> endobj
+7230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.85 688.577 388.335 699.481]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.532 676.622 297.016 687.526]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+7254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 643.144 282.381 654.048]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a7b57685cf4be76a8b527f897899752f0) >>
+>> endobj
+7255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.089 109.865 513.996 121.82]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+7268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 97.91 126.862 110.851]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+7256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.095 97.91 513.996 110.851]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) >>
+>> endobj
+7269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 86.288 168.705 98.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) >>
+>> endobj
+7257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.256 86.288 513.996 98.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+7270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 75.18 186.638 84.854]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+7258 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7262 0 obj <<
+/D [7260 0 R /XYZ 89 770.89 null]
+>> endobj
+7263 0 obj <<
+/D [7260 0 R /XYZ 90 704.712 null]
+>> endobj
+7264 0 obj <<
+/D [7260 0 R /XYZ 90 659.26 null]
+>> endobj
+7265 0 obj <<
+/D [7260 0 R /XYZ 90 597.625 null]
+>> endobj
+7266 0 obj <<
+/D [7260 0 R /XYZ 90 597.625 null]
+>> endobj
+7267 0 obj <<
+/D [7260 0 R /XYZ 90 534.974 null]
+>> endobj
+7259 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F91 766 0 R /F75 562 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+7279 0 obj <<
+/Length 2696      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�8~ϯ0�����^%2X
0�6�δ�l��>t
C��D;���v��~/�LYv���0/MQ���|������~������M�F
+��F���H�Q��Z�>�)��Ow?�X$Q|e�_����ջ���ū���/��#���b}��
-a��FL���h=��3}�����`D����L�
g� B
(JD'S�1
���.'SJ��f�/��ݯ��b��y��)���05�
1����
j��dI�
����Y
���F4w+�c�vA���y�֞��}R!	\E2�I�����(UHn)ő��6����"�I6��P�cv"
+�I��݄�1H�I��<�	baL����b�"ړ�MQ��z@��
�}?�]�
+���+�E��E�a0*��E/�	���i���d�3���N(
i^Ϧ��4�`9����W�ݔ"Ǻ�<�{
s at Ȍ�F�=� 1l�  �@�g! s�(R
I
�
AƑ��`1�J�
t� �r�	��y� �Ǥ'����0�������:Ks����́�;п���)�j�(�
 %�.�rs;sz1�4�l�ü��dQ�>ԅCݐP�0o���9��Y3e1,�zX��
�p�"�"��ke
�J8�f���
I�-���h��A����1"�5�C��PA��	��X��n& xPꉂSe">*8B��([
�Ep���A\
Ą�X��
+"׾ ��
����]�j��C�2q�5�;qn���$ � j���g�@ц���iYo��S�*\�Dx�`�
�`epx�|�
PW`}��ڸ8���_۹�?��O���/���ê ��A�BL��ݮo�ߌ�¦�'�NO����
�	{��Z���8��nOP�
)`d� pJi����x [�ꇴ`
+T�q��W�Ѐ���MQ��_�̇x ��!kJ!�+
�@ E��!>�qRB�b�$W!��3�a��{i��3hV��\�@��c)B5�F
MB�:BV;#
ɺ���A�D�)���03����9��b#��s9
+0H"�/49�k ��P���җ' w�gA"D���au���3��
��@
b�y #�@]&
r�̯�����.Cw�Ou�	����7�}X�@�
+yN
����g��y0Ą-�$f��8�4��I =��a �p��g],S�T/��tl����J��Z
'����f�'��$�'���v�^��2�|�H(��eaF}ZSn��i���<��.Z/��r �"��շ�*ɪ�]E,nk��+���O(�D���&��1_��+L"�d�A�
+#�27�^�&��d��]�Xl�4�w
L�ff���D��oJm&4�ѥ[5
�b����)WiYճb��$_�UX���%}}Q�]$����0؍�*,
��a5kI����
����CbZ9.?53X�Ϫ*i��̰�e����|�a؆u
7Iѐ�C�jU�&S!�����esm�
ޜ:u83�7yQ�$��02�5(ީ��J]o
+�t
+�W )���i�l��J<���R��7^k���R�B����_�,2��.u�(�Mg1����j��$͚
=�$��|(�6�
���i���b*���d
*�Gc�R�Czѽ^o2m:Ս�1ޯ��n������֭형�dv[d�zY&Ps�ˤ|���Z�����+;ZL���k�'
�L���!���Db�C�t���7��C--��G$�
���斗nL-�F�A�?��}7_l�����9�x݀dU�
�VE�9tXS0Sș��1q&�]�d�����p�ǩ�x��d�����j����hCPhj���B��	_����n�� ��9�%;E�2�ka��A"�8؅�%�Hy;at\d�
vp
j'Ch<
�Q�,8���'���b�87�cB�+��0���
��E�r���t�j�Z}]W~W�0�f/ɥ�¢���&�����c(��ws�eg�����R�
}��E�@
apYv7d`͔�9+�{jB�7�/i�5A�=K�.�
]�l�=4
�����ϳԫ��j��m[�nZH/��
�w
:㿤�"�.�n�l��{̀V�:�сJCF��
��� O���A:g�:'�^R��B���Nd<����E'@N(��E���l�ܛ�C�G�~��ۏ��K��#ΐ*c5�)���Y�9
+XwbHQ&Ov���]�����e��I��iqy&8P4�=1�=a�"Ə^O�
Ճn��nk"uZN%D�(�ӻ�����݆��m�v��mcFs�~g�3�D`#qL�S����'�n����Z΋Jg�nj��~h�rn �����_��u���۲ЎF�KH(e��+�!ar��I*��	��bg
B)���
��`{)�X��)zpo.���i�JA������/1C���
�w�]trkE7�L�9(&H"Nzbz:��RR	�g�����s|zfO��c&Β�lrF��9Xh2��� ��%����o�9d����P�����9f�h�����Pxň �ϱ/��{��2���7�vI===�g��
��
��'��w�}�j�n	r�
ۖ����VX���Q�_5'���·
�����aa�Ծ�
ۗ�7~�����^@�#7zӎ`�~� ��;��+�lz���7n�k�˿�֕���$�67�F�>Jvw��M��1��2��o9q9�~kY����
�b���q?�����j���t~��z_���J!
��U�����4V�{��)��Yz�'
+endstream
+endobj
+7278 0 obj <<
+/Type /Page
+/Contents 7279 0 R
+/Resources 7277 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7160 0 R
+/Annots [ 7272 0 R 7273 0 R 7276 0 R ]
+>> endobj
+7272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 403.904 501.708 414.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+7273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.809 187.111 508.488 198.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Domain__Product) >>
+>> endobj
+7276 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7280 0 obj <<
+/D [7278 0 R /XYZ 89 770.89 null]
+>> endobj
+7281 0 obj <<
+/D [7278 0 R /XYZ 90 721.073 null]
+>> endobj
+7253 0 obj <<
+/D [7278 0 R /XYZ 90 704.201 null]
+>> endobj
+7282 0 obj <<
+/D [7278 0 R /XYZ 90 704.201 null]
+>> endobj
+7283 0 obj <<
+/D [7278 0 R /XYZ 90 592.12 null]
+>> endobj
+1806 0 obj <<
+/D [7278 0 R /XYZ 90 355.234 null]
+>> endobj
+290 0 obj <<
+/D [7278 0 R /XYZ 90 348.044 null]
+>> endobj
+7284 0 obj <<
+/D [7278 0 R /XYZ 90 272.677 null]
+>> endobj
+7285 0 obj <<
+/D [7278 0 R /XYZ 90 223.416 null]
+>> endobj
+1807 0 obj <<
+/D [7278 0 R /XYZ 90 126.486 null]
+>> endobj
+294 0 obj <<
+/D [7278 0 R /XYZ 90 119.295 null]
+>> endobj
+7277 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7300 0 obj <<
+/Length 1237      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~��0`���!)���a��4Ez��6{J�@�i[�,���,�~�"u��x�
�C J><��\�����7�_/g'g³Brʭ˕bK�!b
ޖ֕M0����}�lG�6��p(���~#�Et�>YQq?��ow��ʬ��$����|�H����V]�˛�ʸr\ʰ�*��R?ʕ,
�2�������ϗog�/g_f����1$+�ή>ck	��Zya`��D[˧
<S����
�F���v~�dq�_J%��
�v��C�cM����|��v)�l&�x
�5d?k
+�{n(�O���8�5�y��ERE�g���I�.��~Y�> 8̀�|`����� E��[>#��
+�/3��Ұ����������`�4�:�0�L
��M{�md�����1�L{�b�p��&1x���]�B���Y��PN;��p�{��R�*4�kJ��R�X�?��YW.��9� ��@� ��
�9�U�[h�}����:Nb��T��}jr+�bW
�
��îeJ�Ki�?�v
��3ȌNy�AiO4iu��7�Y>
+�Ь~<�B��s� ��G�?Qcq,�.
�#�_�'lU���@�
+�&J2�*u�뗻�ڴu�.�9,��TYk��	'
�J���4�@?U�Z���0\D���lj�`��k&���"�D83�B���
�g�_�V�,�$+eQ�,$�M�P`N��K8�-�\
%��m�� ��([�3�
�y� 2x�C�>�%�6I9!��Hx
����?Q��l���=�/pmM
AJBDDx
��H鱈RD�x��3Q�}�wd脐��0���,YD���6�0�R��뢞�JYN�
�l�������w-�p|f�f��6r����]ׅj_d�޳˓��f"���L����4���C��*�rȡ��^d{x�5����K�m0LŒ��f�a�
(�y|4p���Ζ��3��1�⩬�$�K=v��2.�����
��
̀���:yN�
�u��vZְ��;��� ��eJHźl
���}�&��׎
���Wb������*
8x��i�P�X�n,�4��ū�:T���\�o�����)��3��`��Z� �~讋����4�
�l�Q�����*�dQ�^��{W�@��
�'~�M9Պ߶��;���:��0
ڑtSU����b�.e�F1x�A|�l	��\��V�uf"���:P��Ɨ
�!�7�ڋ���Z{���o���4�
+endstream
+endobj
+7299 0 obj <<
+/Type /Page
+/Contents 7300 0 R
+/Resources 7298 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7310 0 R
+/Group 7275 0 R
+/Annots [ 7286 0 R 7287 0 R 7288 0 R 7289 0 R 7290 0 R 7291 0 R 7292 0 R 7293 0 R 7294 0 R 7295 0 R 7296 0 R 7297 0 R ]
+>> endobj
+7274 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 7311 0 R
+/BBox [0 0 414 266]
+/Group 7275 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 7312 0 R>>
+>>
+/Length 845
+/Filter /FlateDecode
+>>
+stream
+x��W�j�@
��S�
x"��@�a�
+=�]�!�I6)%[hz��W�?{�m��BzKbY�h$��O�a����F��|��/�@ɿ�{y�y���zG�~	������@�
+�A�'��AV�҄4��ك�*��F�
+6���+m
+�G�Y�H�,8$�\�^�
��k��f+�J)糪��(�D�=���Z*�w��
 ��_�8X˂��
�ލ�
|{H���8ڱ&U�]3�^:_y����q0�پ*V+�"�W[>��e���ے�
š���f9!Vߡl6�Ysn�u�DS
pn����j�� Z��q�~��䦕�
+�)��l=^ߎb}u)�Q�y�1.���:�d9���	#�]5j�$zM�Xd�=��O
�m�q�+��]��=�ymߗm�]�ܲ箏��DJx3�Y�mn�1��Z/[Z�gEִ���ò
b
O/Hk�^�U��xA��(���=���t�\k��S��f M��is�k�{���y���le��iXք4�@� EX4s��I��QyM�vF�֘P�I��Fj�
+�%У2�e�0���;�no���`�y&�z��%�9�TtBY�3�`����,>S�z��$�e���).��fZ�K�l
+�M+Σ���_)��5�tXv�8@ZQ�H,���r�:|�!(~E�25U
��0
��v�<�����
(s��0�H���P�Tރͱh�@d�>
!��<�W��(@4�e��JDZ�׫�ݟ��߾
d
�ٟS�s^�
�v���+z��ng+����d邾
Y,�)�:�a1D����g�Q	�L4��G�U��u�'vȌ�\t��
�Vic+q�yJ��.̱X��o��66
+endstream
+endobj
+7311 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+7312 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /MOURLD+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 7313 0 R]
+/ToUnicode 7314 0 R
+>>
+endobj
+7313 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /MOURLD+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 7315 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 722 556 500 778 222 500 667 500 584 278 556 611 584 944]]
+>>
+endobj
+7314 0 obj
+<<
+/Length 7316 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mk�0����
��E��������h2n�Ct��Ƽ�*(<Nf23�yn̸���ͪ�U
�ю��������d*�V��USg��'�۲�Ԙa��J�>��n�'=��	!�7�ɍ�*_��ڛ�?4�YEյ�4�r/�}�&qH>6���u;�����%��hI͚�)r��RT%��E5������,CZ?��΅��O�"���N�*SP���@'ĘJ�=��tF�ԁ
+P�A*P�U4b\�@��(��y8)�W�O����I��L�+љd�
�
�~'���2�r���c���'�r��W��W��~
R�_��s��o�}���9�Pa��&�;4�o����_��ʥ
+endstream
+endobj
+7315 0 obj
+<<
+/Type /FontDescriptor
+/FontName /MOURLD+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 7317 0 R
+>>
+endobj
+7316 0 obj
+364
+endobj
+7317 0 obj
+<<
+/Length 7318 0 R
+/Filter /FlateDecode
+/Length1 2792
+>>
+stream
+x�UV
l���������p��n�`;q� ��cB��8/'��
�M
��8�
+:(��Q(h��R�k'6�Z_Ҫ�M�it�b�[��#t:A����}�w�ʹ��{�w����/��
�&�����&誯���֏nJ���c�
k
����7�~MHB���XP�c)��<7
ٸ�sI}��0at|]���'$������	z�I���	=l�]%0Ig��u�����*�:��Ț�����/�<AMWQ�Ug�T���a+�lx��F/-�$�M�z���L蝔/������\k�,��0#3�B� D_.�
�.]��D��b���Q�qU���a�Z���|9M�
n���@IB��PP�
+���&$e�K����]b[���R�td
6W��ɟ7��
ي����`�і����I�S�33
���2�ӦE}�4m���70%�O�"���**ٍ�

[sk
�D�k^/�cڵ�$g���w8c�s�yc���[-^G�8�����J��Xô͋��s�
����J�p�����Dw!/D%���f���v;Q���2�'[a7��.��hQ����F�&�v�MLm����=+ۘ��
?<|��i��&�	�q]���
S�O�@},�S�9�_z�F�1-I�D`#��կ������f
+�r2L��I
���ô�{F��jcV���a��	]z��"��cE_�-��yޥ-�:�*
�忱��We��5�F��p���t�MH��`��B���hP����Ψ����C�`ڳ]c;i����F��W��n,�^���N4W��Y��sM,����]�L%& �Y��z���:�F�n���|�s[�F�/������˳����SGW�T��Dw��Xw�8��C��*
[�h�����e8��
�����+�ǣ���W�c�>�~><
�W�$a_
+���)��s�/Z��r^
xj8�y[xd����ԭ
+ ��Z}xǮ׺j�����w�M�t��_An�ܮ
r%���ٰ���~č龇��l�d�a2�h
��=��u�hx���P�OH���f[߫������g�a���ЩXW���$�ʊ��@��ڇu��|ny#
Y����S�3Df'yU�
��[�ȩ�Dy�ޔ�������`�:�x�>�^ST@��
:��Չ�|�p�K��KS[�c��N�����}|~tbb�<�:-����о)����u����$�c��I�7�_��
ܾ@���禇�
>-��+�|�I<�.I��
+�q���Wֿ��gsյ��i����ു7�
��ʽ<_yu�AA�n~r����k�?�_����[_��7�\��/]�uN���������މ��q(V*
<K��x�
���ɩڤ�� B7�7"4��|!O!)%9��K��IL���:W5s��Ԓ��9_�k�yF�`�D��Ԏ
���Z6�߻a��#Gv�:��B 
��B�c��!����_y�
�-ߡ��gڕ�ؿ ��`���bZJa����C�I�S;=�Z[���i�~�!
I����W�i���Ů��lK��P[մ&�,�Ͳj�z�������@� j�s��T,�3�t�o=l;s���&��
0e������D`S��I<������=۶�W�>Q���gL�*e2Xe��k}��������S�-r�wp��`s�ڐ�^Lo�������Gb���R�0���}�H�{�J�wv
��ގ=v�7��SQ�,�Nf��t\H����2"�Q8N'Q� �(�c�����Я�?~c��=a�f�m\�0?�3ށ�T�
$�
�6���3G�hI4�?.�5�)�E������TËx� ~'C2�T�S�W�
�E�3�s$��8g�$v�$��v��>�m����,I������¿���?#���ebO�q�nɗI����Pݙ[��I;A�Y1YD[�Gp�zV
��y.�F��}��1�H$��z
�rj c�>�{0Na"��q�BH$6r-z�
��Boa����d�uD��.��s���.2:�0^V��=�H�r^�A0��F��t��qK!�!��@:T-�U� )Ȼ��j�5ث��Q5����M����M���O��y�h
+endstream
+endobj
+7318 0 obj
+2095
+endobj
+7275 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+7286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 372.865 210.438 383.769]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a07ed557a736512bd1fc7ea8b1e1c3ef7) >>
+>> endobj
+7287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 339.229 210.438 350.133]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_ae364e96f44ce12c3011243a21955a792) >>
+>> endobj
+7288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.253 339.229 310.781 350.133]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.559 339.229 421.086 350.133]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 305.594 188.47 316.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a3dceb0032276944ce7f7ac5822eca166) >>
+>> endobj
+7291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.286 305.594 288.813 316.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 271.958 181.277 282.862]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a219cd8d22c6a8d3dc648e5464bdefdbe) >>
+>> endobj
+7293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.093 271.958 281.62 282.862]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 238.322 210.438 249.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.408 238.322 240.863 249.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a86de0322fd10ae0c9061a9a84b64ae4d) >>
+>> endobj
+7296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 204.686 218.186 215.59]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a7ed472e386f2f0bf61563c7f3e5a84c2) >>
+>> endobj
+7297 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7301 0 obj <<
+/D [7299 0 R /XYZ 89 770.89 null]
+>> endobj
+7302 0 obj <<
+/D [7299 0 R /XYZ 90 394.729 null]
+>> endobj
+7303 0 obj <<
+/D [7299 0 R /XYZ 90 394.729 null]
+>> endobj
+7304 0 obj <<
+/D [7299 0 R /XYZ 90 359.359 null]
+>> endobj
+7305 0 obj <<
+/D [7299 0 R /XYZ 90 325.724 null]
+>> endobj
+7306 0 obj <<
+/D [7299 0 R /XYZ 90 292.088 null]
+>> endobj
+7307 0 obj <<
+/D [7299 0 R /XYZ 90 258.452 null]
+>> endobj
+7308 0 obj <<
+/D [7299 0 R /XYZ 90 224.816 null]
+>> endobj
+7309 0 obj <<
+/D [7299 0 R /XYZ 90 167.164 null]
+>> endobj
+1808 0 obj <<
+/D [7299 0 R /XYZ 90 66.646 null]
+>> endobj
+7298 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F24 537 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im10 7274 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+7342 0 obj <<
+/Length 1511      
+/Filter /FlateDecode
+>>
+stream
+x��X]��6}��`�3-��>A��t�M���W��}J2;��k�
�����
+/�l��>!.��ѽ�
I`����_f����9
+���l�(�\!�[�w)����
������7��of�̷������'��@�P:����G��`~�`Ĕt�ԝ��
���n��7X0��4ͣA��CRB��b!�8�|�1v�
�nT���x����
ʰ:��!!�������z��y���V:.F P,>
+� r�G�*�Q����]^^�7�^묊�$�./��J��@���t�N�ĴM菶��z	���1�"QHD�㧣>HǛ4*KϧT�?.]
p�J[�[��BW:[�:�-5.���O�shp�a]�
N��-Ӗ�]��֚/�E��:�ucMMlj�,p�4z��d�q�����ov��ڱ����*��/+ at m��J�����?�t��Z�!{�����Ql���K��{D����h
��1�BPn}�d�tk����)
+�x��|����٤h�����!��R!*
"�� bI�L�T`7N��"Zۗe^���,����4Omy�X���� " R
,u ��2u@��D(O�r��{��
�8)�'
+��i�
B���������vdc��^�g9��1%mG��d~o�Vb 
�@���m�!�W���.G�x� q&�L)Ȅ��>P*c��� 	��i
`?��m��m���N��u����
5b�0P����O�"�j-�I���(�J
0�rd>��&��0���T�
@�48R�����p�u�Tm�Ty��{�
�eSrVv�ad�\�nJ���v"W��K���?�f�p2��,��3�nP�U�3e� >�6���~m6�¶���ˆ���|�	�.�j�ydVf�d��
�0u��^����[�G��(�O8rT���KP�}�����
���Y�i*
b�LB2`Q��i��A'mw�fl���=�t�{�y�֎Ͷ\�,�<;����=����AS��ntFOH�7
exw2�i��o�#�����ەs�e�q�Eԯ���2���U�ܑ�G���s`�Y�ݷ��Q=;�S
�x���8������b^&F���Ǚ���F:�48���I�n�����̵9�3��y�a��th6�
D;��4�:��Ev��l���A�ɓN�
���K7��}�4�� �C'�[�oæ���[�����^��2�ē�vO��:�ul�K
z0�wc� T���S�`���&X�#F���yjj���ha5����%d��͟��5�$K�'�v�v���� >�ذ�jBY�:�G��f=������@�����y���w
{�:uP��R���px���
{y������0���y�>rsf�Ź�"�?ﰾ
C�z�
�v����
G�
��+��4���FE^G�6jNS&.�'NQ��F�Ȧ�����T�;ݖ��v�A9����0�qى䪪6���m��[������Z��u�]�y�	
��t��� κI	
+endstream
+endobj
+7341 0 obj <<
+/Type /Page
+/Contents 7342 0 R
+/Resources 7340 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7310 0 R
+/Group 7320 0 R
+/Annots [ 7321 0 R 7322 0 R 7323 0 R 7324 0 R 7325 0 R 7326 0 R 7327 0 R 7328 0 R 7329 0 R 7330 0 R 7331 0 R 7332 0 R 7333 0 R 7334 0 R 7335 0 R 7336 0 R 7339 0 R ]
+>> endobj
+7319 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1EList__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 7355 0 R
+/BBox [0 0 222 206]
+/Group 7320 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 7356 0 R>>
+>>
+/Length 473
+/Filter /FlateDecode
+>>
+stream
+x��T�j
1��+�Z����!�!IC�{�0�9��Sխ^�'1��b�=�J�=�񉐙A
|��#}�����#��3=���O���az/�o����2

�>�0��'��gB�WH����L^;�6�Ž����h��Hʪ(��]BY�g_�
�iכbK)9��4OB��27��i�'s���ѥ�����{
C�^�c�ސ��, at F�m׸��R]�'��-�뾎���ٱ�vL�����hؠf)�0�t�<�����	��y
��Yk��n��E\j�s7�
�I�ڹM���o)�
IA�
+��—�ɠ

x�/���"�<I���
+a���/*�^n�{���к����:7	��9�C�%��ms���(���nšsy�i
7��iw�+�"�V
A0J��ͅ����ɉ.uV�u2Q�F�3��u�Ӟ>�D����p�o�l�j@`���������G��O�
+endstream
+endobj
+7355 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+7356 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /QEFAVC+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 7357 0 R]
+/ToUnicode 7358 0 R
+>>
+endobj
+7357 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /QEFAVC+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 7359 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 667 500 584 278 611 584 722 556 500 778 222 500]]
+>>
+endobj
+7358 0 obj
+<<
+/Length 7360 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š���t�:�hr�
+5��,|����)4��y.�gN|n�[3�"~w���*��hG�|s�DO��D2zT+Sx���Q�/۲�Ԛa��Z�>��n�'=��	!�7�ɍ�*_�
>]n���DfI�4B��۽t���Hġ��j�����2>7K"
,q$5kZl��u�JQ��Ոz������A}w.�K��$E�J���RP���@%bLH�
��:!��@�� (�.1�B >�(��uȔ��'ُ@��$�r�E¯�@��p	��{¯�.��x��
�_�;���A���%����,\)��~��$�'Gݜ�C�5L�>'���D���U����I
+endstream
+endobj
+7359 0 obj
+<<
+/Type /FontDescriptor
+/FontName /QEFAVC+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 7361 0 R
+>>
+endobj
+7360 0 obj
+357
+endobj
+7361 0 obj
+<<
+/Length 7362 0 R
+/Filter /FlateDecode
+/Length1 2596
+>>
+stream
+x�UV{lS�?߹��r�������y��
�$@��y�ĉ]�Ik�!�
+:h���)-���B
�`k'6�����jZSi�զ1�k3�	F�t���*����ؕ�s�w�w���
�;�c,��0�ʷ�E&����K,��
�{�J�1Oc�,�ގn�
~���K�?���(&��
���
�c��l�F7�XXv`tb[����? ��Xd�$��c��yس�1>�� 
L2ڌ�����r#
ɯ����&�
�>�
C.�=��u�d�mn�VrWx��ć�����kt��1W��Z7Dž�)�"���{��z��YIl�[y+f
�L��"͒�'����B��z6$�6�z�8�����b=�	f�_w)2�JJ�[���၎���l����삵���*���@w����
+��is�|��oLr���Μ
CzB�F��̴8�\��G�%z��,�!,��L���H�Q���$����p����(E��y���?^%	X� c���X�V��Z�ࠡ-��)s4y�;��j�)�p}˚�`YAk��=v�������
���AąiE���.����f�
b�$c�d&B���*��:���z�d���?>9�o�!ltv��<w|�g��~36�%2��"�D�f�a%��易�]0��=
+����$H&:ԻX<���e�\���n�
\���hj�Κ
�ir���Dס˄��_$㊯蕺��P�ѺnSO�F|呠�7>/�����Vޥ�Z��!�jf9�9l+��4R
�
�EkS
�vN�>�*

��z�<?�2�!��I���n6�o~b����_��{
��3��
��,
H�v����~�Q �{^�ݒ�Q���g�F��ԇÁ�`P�W`m���O��I���ɾ-�}�?�"�j��D��g���`of9���=��>��}5Br,���O����*�ȥ�
%���Qb^(�M�c^zd8����HU�5 ��4g�k����譣O&>������T��U�V�5��DՏ�E��
Bf�~n�
��
���☬84�A��V5����H�UH��g�z��뇦_k�o�<�)�/��Nӽse���d����t״�Eݾ�v���F֬S���b�L槕Sk�
+�xm�"��W�ͦ���œ�������'�M����"z���1C/��S
J�lJ+�O?_���+���-�׵إ��#w.3�oō^C�	ك䴫�͖\ZEq�<��|u��������R�0$U����
��]ԝ^�s9r�M��
͏��¥�v���ٿ�����[�3��~^��J���h�w�?v��\�"�y'lHP���D���W��K{��.ȸ�'+��D��E^�%[i�RV4)q�AsJ�eP��Š���,�
�x��33^��
�����
w
�y1�K?|s9�x�V�<7�]mu+7�!���P����O��#J8�XY_����X}R��.$ �GF޻���N%�]���e/�i	�N����j�Y��V�#_g�����ߞ}sn�gv�|��ї)�֕Oi����}�ܡ���b�bNv��
+�sg^���ai
MMק䄐JK�DŽF�[(8�CK,���x�}5ٗ��r�Rk���N��Է�F�p�������}c��W5���'Ff�<����e�ڛ���ip3�e�Nn,���bJ�V%t�E��T<�z
*��L�� ^���KC�30#nut��¬���2Q
�QsW�\�H�J=�����x�pCQ���y]�{R.���d�Md+�
+7�ˬW��wO.Ujo-���������b}���P
~���b7��VOw�c̱"P&(��Z�da�Ae��`�]�X�ϛ�
<�ۘ������@Ə�B2s���-�s�q�F�
��N�~��
�
�:
k�n0�
����f
�%�%�����
��e����a��4�Ox�a]B��S�ͣPqw�{\哖���4���56
+endstream
+endobj
+7362 0 obj
+1951
+endobj
+7320 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+7321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 351.052 204.161 361.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.746 351.052 311.523 361.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ac0fb25117711f33a24d966834f08d653) >>
+>> endobj
+7323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 323.083 204.161 333.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.225 323.083 261.989 333.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 253.48 137.492 264.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a38ad9466c728fff8d6447b0a4737b11a) >>
+>> endobj
+7326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 225.511 145.24 236.041]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a1acc6b92f818c7cc84f0e14b7fa8e789) >>
+>> endobj
+7327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 197.168 179.076 208.072]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_aca1baadce7ec948bc61c893ccba84cc4) >>
+>> endobj
+7328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 169.199 178.518 180.103]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ab8cc645c9acb57cc0b36a162f8a0df5a) >>
+>> endobj
+7329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 141.23 144.674 152.134]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 141.23 169.302 152.134]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a6e212b144c2c2b4aaf6c7e52cdec0d69) >>
+>> endobj
+7331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.117 141.23 203.881 152.134]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 113.261 144.674 124.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 113.261 167.628 124.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a0b29950a1eb609da39a45cc7bf202c1a) >>
+>> endobj
+7334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.444 113.261 202.208 124.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 87.905 148.995 97.55]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a5a20a3e74db0ae30d0a97eb97b5711e0) >>
+>> endobj
+7336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 74.333 161.013 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a93d9c4f14856c0460e85740372073a66) >>
+>> endobj
+7339 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7343 0 obj <<
+/D [7341 0 R /XYZ 89 770.89 null]
+>> endobj
+298 0 obj <<
+/D [7341 0 R /XYZ 90 721.073 null]
+>> endobj
+7344 0 obj <<
+/D [7341 0 R /XYZ 90 368.085 null]
+>> endobj
+7345 0 obj <<
+/D [7341 0 R /XYZ 90 368.085 null]
+>> endobj
+7346 0 obj <<
+/D [7341 0 R /XYZ 90 342.105 null]
+>> endobj
+7347 0 obj <<
+/D [7341 0 R /XYZ 90 272.137 null]
+>> endobj
+7348 0 obj <<
+/D [7341 0 R /XYZ 90 272.137 null]
+>> endobj
+7349 0 obj <<
+/D [7341 0 R /XYZ 90 242.434 null]
+>> endobj
+7350 0 obj <<
+/D [7341 0 R /XYZ 90 216.191 null]
+>> endobj
+7351 0 obj <<
+/D [7341 0 R /XYZ 90 186.496 null]
+>> endobj
+7352 0 obj <<
+/D [7341 0 R /XYZ 90 158.527 null]
+>> endobj
+7353 0 obj <<
+/D [7341 0 R /XYZ 90 130.558 null]
+>> endobj
+7354 0 obj <<
+/D [7341 0 R /XYZ 90 91.89 null]
+>> endobj
+7340 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F22 2982 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F24 537 0 R /F111 1509 0 R >>
+/XObject << /Im11 7319 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7390 0 obj <<
+/Length 1804      
+/Filter /FlateDecode
+>>
+stream
+x��Y�n�F}�W(ВH���ȥ�H�:p� n�>%�AIk�
E*$���
).-�v,�-
C��^�gngV�w�������qL�%��Ʌ��^
a�	�&sC�H0�a�g��Z��g	�2����*=?ͦUZ�

�,��\ȢI��,�8������UڔU�i�����i$�("
tч�b�8
+��&�ɆM�i�N���-^�i]c�C�-!���F�uޘ
s�7�%���䅬,|Y��<
+��PB�������0HCk$G��f�чO�7�+/D4޵�����{�G�Bk��6R�</1�B$A��bP�V�fUu
�ͦ! �[]�j%�,gKBؽ��]��bne�ߘQ����f����#
+ ����H�Ҿ��q��2�#�5�^&6$�;�
�ե��ˑ�a����W힭T�� s�2+����ǐ��[�Z�81Jsez��ŢQ.�}���,ˬh����W`
Y�4,�9�&�wcک�
0��
{D3N
gYX��i�k�:�4��nY|gtge��)�V���Ņ�����[�˥�m��CnnQ��en�[0}��i!}q%g��|�������
+�ʯi��E�ڠ
+h��	5��c9�!•"�C���
c��0pd���y��L��T
N�R\�
+�:7_���T������A �X��A��,�H6i��
�zVeKu��7lz�g@�(E<�B�v�b֑��f)�t!�2��P �$z�}Ùr��`G �LS���� ��� �Lm�"(IG�
�rX(
��1��N+rPW����
��l?*�@(�@��q�
xc
^�]
+�.F
#Q�d[s���8��
l�~�)��X��3�$A�� HT ���J-��J
��g�*�Α ����f�zn�Yu"f�����r��
^C��3M���������&I��.Y��~�v0gQ���rTY�
��i1t3vڤ�:�r���fDmvo�Z�<[w%׺Ͳ_.e�
+��<��*��vQ�y�_weB��\
�yG�)�M�'����r����mЀA���M)X?!�Zƭ�y��
�J�=���
�����̘�b�����ۏ
+�Q�*�/�]�(�
��((����ۏC��P=�V��c��zn�pwP�
)�&�%�1����Zr-��{l�s���%�&&	����v��s,��)ʍ�eU����ͻ0j�c=��^�|�F�ځ��m�����������u0���o����
o�D��{'�Ib���9��j��9s�
���r�z
SsP��
��C��훣=7�/�V�������
B|�-�㚘�ᰕ��G�n��v%����l��G���N�$ ń_s^
���X��c� N���?��0�ǝj.���i��0�w�৳ߏ���ri���}lO0
*���$�`�xн�*�@={w���%T8�nk���(�T֔j��f;���+Ү���W�˻ 8B���.q_�Pr��u���:�
+ʰh��w�
Y]�[SM�xSU�]���v��iH�
3�1q|㤘g�=�Y�,�j��u���T�4��w�1	
�l����l�Q7�
�
S�#iະ��u�v�tOx=}�{��)��
6���`}U���
Qz0��
�M ��y88ß�"�bB��ӗn] ݵv��OĠ�>;;5��jY��~d���MZ��<�0�yUwM7��e%�i��J�{��
F��^;z=����)b�
��j�����tuY��͠)��)�wI4�vm�F,ʪ���B���m[,y��JҢ�~NbӦ�_o��
���dA��@^�����(�
+endstream
+endobj
+7389 0 obj <<
+/Type /Page
+/Contents 7390 0 R
+/Resources 7388 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7310 0 R
+/Annots [ 7337 0 R 7338 0 R 7364 0 R 7365 0 R 7366 0 R 7367 0 R 7368 0 R 7369 0 R 7370 0 R 7371 0 R 7372 0 R 7373 0 R 7374 0 R 7375 0 R 7376 0 R 7377 0 R 7378 0 R 7379 0 R 7380 0 R 7381 0 R 7382 0 R 7387 0 R ]
+>> endobj
+7337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 694.87 144.674 705.774]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 694.87 169.153 705.774]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a51cb421fbcb83cc818a44ac33ee2a599) >>
+>> endobj
+7364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.077 144.674 677.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) >>
+>> endobj
+7365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 667.077 161.551 677.607]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a5a20a3e74db0ae30d0a97eb97b5711e0) >>
+>> endobj
+7366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 638.537 170.687 649.44]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ac0fb25117711f33a24d966834f08d653) >>
+>> endobj
+7367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 638.537 195.165 649.44]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a2bd415f397cb476b557cb3d5e3ba0b1f) >>
+>> endobj
+7368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.743 170.687 621.274]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ac0fb25117711f33a24d966834f08d653) >>
+>> endobj
+7369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 610.743 187.563 621.274]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ad2346bbed9370544b17d1ceb23a7bd71) >>
+>> endobj
+7370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 582.577 150.493 593.107]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a9e101065f67b05a59a2d22de338b5016) >>
+>> endobj
+7371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 260.62 171.792 271.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a6804b8c7fe2610cb292dcf81eb7504b6) >>
+>> endobj
+7372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 232.08 171.792 242.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_aa3a4f75d78e0b38122121796fc6391bd) >>
+>> endobj
+7373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.608 232.08 272.135 242.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 203.913 171.792 214.817]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.532 203.913 223.339 214.817]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_aa143851bb6cac69786ce70609932cc55) >>
+>> endobj
+7376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.154 203.913 323.682 214.817]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) >>
+>> endobj
+7377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [129.96 175.747 176.015 186.651]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a253054117c47dec9e844a92455b63b23) >>
+>> endobj
+7378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.73 147.58 172.899 158.484]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a2a78b4dccc5cb62f5dc676955349fe22) >>
+>> endobj
+7379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 119.413 171.792 130.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.532 119.413 228.957 130.317]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a1fa6cf4049dfd8fbc21202b6cfef9d64) >>
+>> endobj
+7381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.246 171.792 102.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.291 91.246 218.716 102.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a74e639a1c2aa8f473ac344c64fe52d70) >>
+>> endobj
+7387 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7391 0 obj <<
+/D [7389 0 R /XYZ 89 770.89 null]
+>> endobj
+7392 0 obj <<
+/D [7389 0 R /XYZ 90 712.265 null]
+>> endobj
+7363 0 obj <<
+/D [7389 0 R /XYZ 90 684.099 null]
+>> endobj
+7393 0 obj <<
+/D [7389 0 R /XYZ 90 655.932 null]
+>> endobj
+7394 0 obj <<
+/D [7389 0 R /XYZ 90 627.765 null]
+>> endobj
+7395 0 obj <<
+/D [7389 0 R /XYZ 90 599.598 null]
+>> endobj
+7396 0 obj <<
+/D [7389 0 R /XYZ 90 530.891 null]
+>> endobj
+7397 0 obj <<
+/D [7389 0 R /XYZ 90 530.891 null]
+>> endobj
+7398 0 obj <<
+/D [7389 0 R /XYZ 90 480.073 null]
+>> endobj
+1854 0 obj <<
+/D [7389 0 R /XYZ 90 398.974 null]
+>> endobj
+302 0 obj <<
+/D [7389 0 R /XYZ 90 392.204 null]
+>> endobj
+7399 0 obj <<
+/D [7389 0 R /XYZ 90 279.376 null]
+>> endobj
+7400 0 obj <<
+/D [7389 0 R /XYZ 90 279.376 null]
+>> endobj
+7401 0 obj <<
+/D [7389 0 R /XYZ 90 249.476 null]
+>> endobj
+7402 0 obj <<
+/D [7389 0 R /XYZ 90 221.309 null]
+>> endobj
+7403 0 obj <<
+/D [7389 0 R /XYZ 90 193.142 null]
+>> endobj
+7404 0 obj <<
+/D [7389 0 R /XYZ 90 166.701 null]
+>> endobj
+7405 0 obj <<
+/D [7389 0 R /XYZ 90 136.809 null]
+>> endobj
+7406 0 obj <<
+/D [7389 0 R /XYZ 90 108.642 null]
+>> endobj
+7388 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F91 766 0 R /F22 2982 0 R /F75 562 0 R /F24 537 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7416 0 obj <<
+/Length 1564      
+/Filter /FlateDecode
+>>
+stream
+x��Y�n�F}�W�(�J@���.��@sq��M�D}J���ֲP��I*�����")J�`�h�>�e93;s��
�����������\1�G��қ^{>����p6��)�����
�_�S��g����x3}g�
^L���G
+)�͢���؛���
F����|Q�q��?��
~
`g
��$q�&�%�L{�DHa�JE�|��՞,�o_��c�����2�~��$�VI�XA
~�.v��Wk�(���K�,0�Hˠ�r�sO�f$���IN�1a�׺��e2bjh�fV
D&�F���\?!d�:Z�W�	�}ѣ�
�e�=�?#
���!*�|��� u71a
1�
�����t��M8h
S���8ٹ�j�
+�Cד'��7[�ivX����pX?��η&�$q���9Ĭ��aD�(Y&K6�XՔɐ��\��.6�s�8�/��V������u(PHRZ.�r;���_q�GJ� (�[�en7Ax8���c�,�B�W���?��9F�����j$
+X��&9�8Ed4&���d�24�T�Y:K��l����j��Kc��/3�� 3�k&0����
}�\_��(U���&"SX3����?����-'a��������(�mu(� �9��;P�W
O��4�S&B�d%qNʢ���j����'](�0���f-
.�W	 j���gg� `y�
l������5�� H�z0�c��aä:]��L�A��n ƸJ�.�(D%m e/?3!���
�9���:YY8}ZΗ��хۂ[q
�)�Bte�s��%�y���!6�]?7�)�{5�Ti	�n��1�G̝,Ll�(�]'��|Ԕ��p5�b�����44gM���C�p�Z�Cts���l��Ӝ��P`FՖ��#�iI 4� ����j���`�"A��,��OL�m�ه�%Lcu
�y
� �]+|�%E?f�PZ�p���w� �HA��C5`�4T?��E���϶t��\���%&��ã+�v%0��N
���m{��v6KLVvt6��։ISHFTp
�f���bWR�^Ƴp3�*��O����j�S�B*���Eg�?p7'��~QK�k�����v�?�
ɣ����ώ
b�`G*8
)�Tz��
&�ȏ������	��%A6tW
��Z'��TK��:�
+F��ÄS[SWr�G�c� ���K��N5 ����ɺ�_Q�v;���j�s�(8���WW6� ,\�$w�d1��V^d(��A|O����N�J�YtėRtj'�B�n�64HS�|�	T ����*4BK�M+��Z]�zY�b@��

��r&A:�}�a��ǝ��r-�����>`Q5U�g���A3��Y��-���
��F�#r�J���9H��'�m���AJ)ʎ��W{�+�e��h�h~�~��,�q&�"�=_����1�o�_k�H!]9$�[ӌ���Eq�[j�oGB
���M���ߟl�M�V�~���h4�ℇ�LY�
���L�i��ʚM
+
+���|�e���j�HM�@3����>ª*���U�6���b��
��'�7
�
+endstream
+endobj
+7415 0 obj <<
+/Type /Page
+/Contents 7416 0 R
+/Resources 7414 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7310 0 R
+/Annots [ 7383 0 R 7384 0 R 7385 0 R 7386 0 R 7407 0 R 7408 0 R 7409 0 R 7410 0 R 7411 0 R 7412 0 R 7413 0 R ]
+>> endobj
+7383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 171.792 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.532 707.957 224.156 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a8ce6913cba94e871f6014f123ede511a) >>
+>> endobj
+7385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 681.974 171.792 692.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.291 681.974 213.914 692.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_ae1fda4cb1a649224fbda7c57cde73039) >>
+>> endobj
+7407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 614.943 180.54 625.846]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a0b8c563512e846bce0d716066f049fcd) >>
+>> endobj
+7408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 614.943 265.759 625.846]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.492 614.943 365.374 625.846]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 588.959 178.239 599.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a95e8dcda2a5e9efd485371dad792eb71) >>
+>> endobj
+7411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 588.959 263.458 599.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.191 588.959 363.073 599.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) >>
+>> endobj
+7413 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7417 0 obj <<
+/D [7415 0 R /XYZ 89 770.89 null]
+>> endobj
+7418 0 obj <<
+/D [7415 0 R /XYZ 90 721.073 null]
+>> endobj
+7419 0 obj <<
+/D [7415 0 R /XYZ 90 698.277 null]
+>> endobj
+7420 0 obj <<
+/D [7415 0 R /XYZ 90 632.98 null]
+>> endobj
+7421 0 obj <<
+/D [7415 0 R /XYZ 90 632.98 null]
+>> endobj
+7422 0 obj <<
+/D [7415 0 R /XYZ 90 605.263 null]
+>> endobj
+7423 0 obj <<
+/D [7415 0 R /XYZ 90 562.581 null]
+>> endobj
+7424 0 obj <<
+/D [7415 0 R /XYZ 90 513.619 null]
+>> endobj
+1855 0 obj <<
+/D [7415 0 R /XYZ 90 452.394 null]
+>> endobj
+306 0 obj <<
+/D [7415 0 R /XYZ 90 442.83 null]
+>> endobj
+7425 0 obj <<
+/D [7415 0 R /XYZ 90 368.153 null]
+>> endobj
+1856 0 obj <<
+/D [7415 0 R /XYZ 90 282.016 null]
+>> endobj
+310 0 obj <<
+/D [7415 0 R /XYZ 90 272.452 null]
+>> endobj
+7426 0 obj <<
+/D [7415 0 R /XYZ 90 183.826 null]
+>> endobj
+7427 0 obj <<
+/D [7415 0 R /XYZ 90 134.5 null]
+>> endobj
+1229 0 obj <<
+/D [7415 0 R /XYZ 90 73.34 null]
+>> endobj
+7414 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F111 1509 0 R /F11 621 0 R /F75 562 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+7433 0 obj <<
+/Length 917       
+/Filter /FlateDecode
+>>
+stream
+xڭVM��0��WX�@"��o�`��E*N���6�V�iI�
���Iڴ����8��yޛ7adFy7x��##��NsM�[�1��@�)�
�R�	0Ƣq
,��U6ǜE���<����jq]f����h��v�bV_����M����v�.����  ׎jg���2,�`B
\�f�h<y_��s�-'ild��_�	W�Z2���ֈu���J���W=1	��I� P�TX�f�m�!F;
��2��a�K~���7Քs".Lu��2
�
 Fd|���ƒ����OF�8��0*�%���\�sI�>X�&BU��Q�����_��=.={�x at ij��[sO�¤X���A cՁ1�G�� Q��)�,e�A�q��� �
ȴ��XZ��8�=���8
-�R��YB
Ω��	]�ar~�Cqj�8*�#b�,+�U�s��|��I&P��+��G����))0�ʜ��$J�A���V>S�@��z!-���G��j��[O�c��,?���/'m��N��-㍱q�76�Ac�M���ת�6v���:�i� C�
��:��Eq����=6�*�
;�ቆ��f���y�9BQ��뺹f�Ȝ�8f�P�e#�y^.vYpk���"���*�ܮ�0{�U�	�d�T�kޣ�N ���ѕ;P!����W��7:˚Fg|�K�3�w��s�ۮF�ǚ�@=q�T�:ٿ�0�D��̈́
+J�)�^���o-MXq8�������
+�z��r�|g�:!L�%5��?;i�����q���
X̀�u;������V?
_���m^>���꿂OYq����?�bީ����Ob�Q����/_��_m2>�����ն��v�����n�͋�Y����{G�i�
�F@�uY_jQ�z� V�xZ�.Ū�ʛlԤ20�פ�Ǐ�*�9�pn�
+endstream
+endobj
+7432 0 obj <<
+/Type /Page
+/Contents 7433 0 R
+/Resources 7431 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7310 0 R
+/Group 7429 0 R
+/Annots [ 7430 0 R ]
+>> endobj
+7428 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 7435 0 R
+/BBox [0 0 456 704]
+/Group 7429 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 7436 0 R>>
+>>
+/Length 1619
+/Filter /FlateDecode
+>>
+stream
+x��ˎ�6��|
+����;x1 at Q�@m�"�b���(&�.���/�-[
O�Ul
�/���O����rQǘ��Ao�s���]��H�����̓՟��������	��T��kk�~Td��=�������L;%\{��Q�NY�|���G
j�F�V;��.�d��^�m�u��nk[trw��)�����tC��_ԛO�����'���1ɑ������o����u�� �
	
���
9SzՇQ�ò�^?���v�jgO��A�q"o��˗�!�����mJ���n�z�n/��+�6���Iq�ܑ�ǽ>F��bt�(�m�(������X'J��(�Χ��Y�7a�IB���7m7y'$zh!
�<Q#4�0��
+�k8���Q]i��b~Sw�8"z1�q>
���W6w�TW��Yʓ�8
�ȥ����\I�%�t5�<GX�����WYR؛�|/t0�YuZ�|LR�D�j_'T�6�Ϸ�R-u)���%B����"�w�̎
��tb�g�s]�j7f{�:�ũfu�Z�uE�s��@�>o�7��<�Y��0M��Xmgo
�5(k�Q�B���@&d�*�h�+8��
��y����%�s0)x4��t at B�N&x	8����0Gyl��'���0
8��
�ݭ�+P�䒹5^�(O�j5�%W��F�=	�Q��v~�
}Ƌ.���
�"�nh���q��H�؊6�.O�`"��)����rC�-
m��F��D�ƑE�ACA[��̆m�
�|4Xz�������`�R�l
�
��-"�d[�:�5��\�R���#��Kr�rm�y�"Z���u���͸/��cϻL�Ǭ
vb�SNj�SG��
�:�x��]�M��홀;�7����jġV�u1�L�/��d|>D85���b+�P��
}RAK
F�6��9u�1
���J��C4)��]u}�T��
L�׹�bi��
!ր�r���B�l�
+��V��Y�lSi��W&Nm.����Z�s=����ƶ�
Q�\
��`������n��"�%��.:S���ǰ71V��Χ�F
�͇%����P.�)	"�H.���/�l�.R
���4���
�ݚ��݋��ā�%�:�X�y�s ����չ��}v�t��
��Oj�ckH��N��ݶ�0n���
� ���9��d	ެɂ7v=��3�����$�nR�L�9�
�kl�
x�l��<#�
�c��:h�f�`C�
�0���\
v��<׎au�oa[�ظɧ�=.�<�V;�ݫ̛�f76%��j8'�\�)�G����|�5���z�)M`b@��n��\M
+͸E��S�_(��	$�].{I&�,��$�'�4�e��T�Ĉ�i�R5h��J�M�T�,�����z��m=��>�#i������	cu&��_4��Kꤑ����(�^��c��V�V
E�#�"ɛ *,�I�6("M,M����Df	��J�"�����f/`��aQt�w�w������6�\21t
q����yK�����r�n�i�a��N�j*��g��جr�.+�Mr�y�0�UCW�Ho�)o.뼟`� �����(��
+�L�K��wB56+ �TdS���Ex ���l�e]r��e�ƕL��KJF�z�Z}�����v;�v�ܩ_�$T��
+endstream
+endobj
+7435 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+7436 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /OQNFDR+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 7437 0 R]
+/ToUnicode 7438 0 R
+>>
+endobj
+7437 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /OQNFDR+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 7439 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 611 278 556 556 667 500 556 500 584 278 278 500 611 278 584 722 722 495 500 833 556 778 667 667]]
+>>
+endobj
+7438 0 obj
+<<
+/Length 7440 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š��t@�2ݸ�N� �
�B���oߘ?L����x>=��湱���w7�
���q�L7��ut
l�3�^#��
�9I}�e[V�OIU�����m��d��
�X��
��^���|���m�h$��,�kf���^���
����������2>����1��
-s�ɵ�JI���fU�:!k���ʺ^�.�s��eEV�J�)��P��
T"I�4�]N�b��T�:��@2v1��.�����6�PW��ГG?��T �I���0'���[��S9~9���1~Ss��8��8�D��<�	?���:���]���3�'�����$���_��W�a���˴o�}S��9����۹��`���ӼW�� � 
+endstream
+endobj
+7439 0 obj
+<<
+/Type /FontDescriptor
+/FontName /OQNFDR+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 7441 0 R
+>>
+endobj
+7440 0 obj
+395
+endobj
+7441 0 obj
+<<
+/Length 7442 0 R
+/Filter /FlateDecode
+/Length1 3280
+>>
+stream
+x�UW	p[��eɗb[хodY�(z�e
lj|Ɩ-+��o9>�ز
 !�9 B�
$G`�B;�5�Bg�L��tJ&�9;t�b�I�I��S�}�H���}�������}�c�l
��1�����d,e/f�ir疜�fO���%�m
����K��\�&ԧ����E��.$-�2����!����1��S��
3�
�0�5��Cg7c|��3l`�΢�Yt�n���i��8�_,Z�[���q�匑ASF:���4�%g��^F||[�����E����j`�����{Îh�4���<��0c�J�i2�
��c�X
�E�q�j=���\vk�&Q�\Ci*�ɫywh�"9�j*.Q��
ɩ9���jr
+W��TUר��ݙ�[k*i��[��wK��d[q{��l���HOLIPk��L��
+��zKiX�����ֈ�
�3J##����$9��
�B��ũFz���$ŵ��%�4����/��Ec�ï}hj/��m�]-
!i��>�pm���@y��Y��Ɲ��
�K�
�D��x]t?���F���->?�t2%�����?��
+���Js��`B>�.;el۽gjf��tS �Ը��g�g��c�t�=�j$�?4%d�yT�?���GC"��w���>�Z�����"���T����](	�gf��R��M�A�]<8�̧1�y�<�bq�
��G�C\$]<V�p}�:0h�U��i��
+ȟ�y�����:y��k10C���r�YLfX��Hqr�&�E8
��Y�.
n��2n��{g�u[�Q�Kv
+�Y�����񍛎?Ѻ�S��=]�xf!��`g:ˆ�:�[�vA�Y���?D�RkAG���wm�t?�
+5�"^���
;���J�/���OO���� ����-�_И�
vvb��:h$^{"�
���H0p,^�����c�U"��Kc�q:�rD΋�V�՜Wo�q���j�yV�pc���ƣ{�?�[O�M�<=�����?��*��^=�ܘ�ScJ�z�X��1���/
Ђ����M~��w.t�p�]`2B �t¦X]�O�-������U��� �6ȏ���ˊ�pÑ#,�� ������J�n�n�
V;���n���%+�n�S.��9��1s<�nIgH�b��D���е9��Ǯ����������Ӷ�j�>K���P��3߽���6�շyci��{p(�YN�ƒ���p$滈�f�)U�.�)����V
�����x�����#��'��(ѪWIf�D�/�y`�����
J_�����j
v` ;�36�� �]���Փc;wm
Z���P�C~�#��]����K��k0@� �2
��<�	XI+qCaY��L��G1E�k܍�z{��e�w�ԭ�"լ���[F��<��Sa�-Hћ�k[�B��
�V�oD�~�W�7чL}n�q+��[����x�T������h.|�~���'Z��bUI�$Qn����G�8���g������T2�g1���W��߽�����	��h���Ƅ<�d4X��ıv��[3k�v�i'�K
r�	{�c��Q� 7ϖ�t&��-|��i~^�PzW�
+��� k
c
�[
+V�
:G�ζ�e�ᮭ��Fz7�6Y�+�ۚW�h�9���u�����l�*&��7)uڃ��O�r>;MkQ,We�C��=��W�L��L���s�7:�
�/VO‰����&����F�.��o.�h@u�������)��zQ�U������Frw�{�'8�8��k<_ڦ&�K(i�����8a
%̈́'v����~���ၭ��&�����p,�>��-|�*ygR����߽�g�u��'�|�1"�xa����^�Y��q���B'��>[������lq���tT�_l
T"�lG/ �)8i��&~��
+4&%���k'���{������x���g�}@?8������Sw
��U<D ˁ�Y�ݮ������UU��
+h�y�6V�m�_|�
�����]�=�u/�nH/���[��W٨[_v���s��
��m��
�R��U�M��7�Y�����Q�W��c������R3���=��w���
A ��qe*�
�I�],wC�6A�|U��eѨ�(
���W���p�i��$�)�ٴ�Q��D��n�
Y1�2M�
�d�,&��\ؖ=V��؃l�ΊXLug\6ee
��\ᩪ/���>���x���r��bB�I,nZ��Y֫�����������+���`}���R;kTyY/�~�q!��5�ef�3��[β@�ס�$��zѧ-��BV/����Y_�*�F1N��]�w�?3��.��x��>��R�
r
�����ɥ@�L��^i��A'�m�*|�N�����}������;5nR��A�C� Wsd�΀����Ko"�&~���9�(�Mƒ���o�D1��^�N}
�ϕq�R�X���0��
+endstream
+endobj
+7442 0 obj
+2442
+endobj
+7429 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+7430 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7434 0 obj <<
+/D [7432 0 R /XYZ 89 770.89 null]
+>> endobj
+314 0 obj <<
+/D [7432 0 R /XYZ 90 721.073 null]
+>> endobj
+7431 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F22 2982 0 R /F75 562 0 R /F60 540 0 R >>
+/XObject << /Im12 7428 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7469 0 obj <<
+/Length 2034      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�D~ϯ��3�f��f��@h!�K�xd[N4Ȓ����s�"Y�eǦ.��x-�=��\]��{��������M�<���қ,=���+$$|[xo}�����=&CD��S��7?�8y���N��x5����+�K@� �櫋��co���0b*�ޛM+�S��ww��v�`D�^�Ǚ"=�A�Xn7�Q��|4�4�'#
�O�4
54����-RD"�B"B���(���۱�د��"^�WZ��މ���D�_'Y
ӛ~^�:t.oH[�q��1H����
���"聩Z�7���*.
GT�Q:��B���;��������=po]vH�]�*R))�&55-P.�caI^�IT����ya��H�Uͻ�]�O�����:���
*F,��7�8�j�I�v`���ћ�Y����D8��g����4Q �F'�
��:�p,"@�����N:�]�ʪ����ʋ�$���4�YЬ��C�CT�7e�� J���I4K
|�l�(�?�ӹۛկ-V�AE4w [...]
+�e��L��"�(�<�V��-����8vT:
<�x�H�੃�ޅ�)@$P���������� z�E���Y��Q��FȞ�4��(��	����Ƀ��;�Y
UIvo��s𻭊j�o�xaW���2uȢ�鯸A��?���W`�-�#���v��v�W��ZmP�<
�j -*����;Z�:Es$(�ƌ�`�F{�fqa�7�l^A�:�^
�1)�
�h_��,�%�$-R��3<�bq���Bwz�Q;}�a]ĥ�}^,��d���x��W7��!�m���
�ZKc�����~,�
6�%�3�y����%��4N(܉ϴ�K���S��[���X9́6�g�f࠯?�*kj �MZD�V
��������M7K
��6_�M)m�{��3�p�q�
+�;��/\����aX�ȵe
���0��8|_���g�v����1`(��f<?.��6N�
[�'�qv���������ő�	
5��dqXiE
�\�uom1���ۿ`����u��|��4EeS�Xw��ytO at 3#�9qF<����J
c_�"������	
cX�v�A`�1,D%�?K2<1�u��7���$��t���'��y��7�څ�x�_�Q�$m�5{�@M��&��y�Y`�_&U���Om#�Wu��f��k���ʶF�B�Z���:��b�$�
�n�^ؒ/��Ln���
4$Y�g�c_�h� Sq�Lo���g"mp#Ƽ����z�S� ƛ���A�wr�B�N)�		��&��*���ڄ�O�E͏�GNPj�k�C��u�c"ߴ{�*y(C^;j��٪�O,l 1
��1���(IM�ƀ�|^$�_�w�Gch�w�k������-Yo���Ӏ�2��璀��v'�$��	0D�cx�T��A��ȝ���g4)���h
���������

P�
�I���2�x�N�"H��,<)���
�n��b׸4 at 2���!�εNӨ,�$�#��H�
+à QE�!���t�
1�CE
.��/�8���n
n�f�u2+"�������
`"
���,Lh�:��+����
I��ܪ�M���C�
�8�@��
�^�ng=B�Ñ3�O$������u$�:
�!)z
�B�iB��x�r�$�a��.������?+���/Z���t�0n����>Xa�(�Jd�Vbۏe�I�I�:�A
����C�{���
UzY���8��wa(�
y6/�j[5�,�qk�֒ N��rw^10�S@��&�c���I6O7��qg[�oUj�py�~[
١��V�PL!�K�� i�dQ�TϨ�Dv�zV$��*nʭ|
����f$Eĸ#Oo
����?�>�$�y�^�������^�@lKn
��[��� ��\
+ȋ���;���}m��q��Hߵ�o�lSO�u!�4[�D Y�.�Q����z���G���3����<l����Z_]^�6���{���u��z ��6��t�L���lh[�
���
+endstream
+endobj
+7468 0 obj <<
+/Type /Page
+/Contents 7469 0 R
+/Resources 7467 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7310 0 R
+/Annots [ 7443 0 R 7444 0 R 7445 0 R 7446 0 R 7447 0 R 7448 0 R 7449 0 R 7450 0 R 7451 0 R 7452 0 R 7453 0 R 7454 0 R 7455 0 R 7474 0 R 7456 0 R 7457 0 R 7458 0 R 7459 0 R 7460 0 R 7461 0 R 7462 0 R 7463 0 R 7464 0 R 7465 0 R 7466 0 R ]
+>> endobj
+7443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 685.83 200.694 696.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+7444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.331 673.875 278.806 684.779]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 647.057 164.879 657.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+7446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.307 647.057 370.84 657.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 608.283 189.793 619.187]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 597.304 184.386 607.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.123 597.304 330.345 607.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.157 557.554 314.915 568.457]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+7451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.946 530.735 304.125 541.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+7452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 462.492 260.646 473.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_afaa9803d7f13e98f459c0ce6980b25bf) >>
+>> endobj
+7453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.422 436.047 197.715 446.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+7454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.857 436.047 337.39 446.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.336 436.047 513.996 446.578]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 424.092 141.915 434.622]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+7456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.581 424.092 256.056 434.622]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 355.85 198.373 366.38]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a47ad848995778e50f0d50dc73a147ef1) >>
+>> endobj
+7458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.71 355.85 296.185 366.38]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 329.031 213.247 339.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+7460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.584 329.031 311.059 339.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.376 329.031 400.851 339.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.408 302.212 202.203 312.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) >>
+>> endobj
+7463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.511 302.212 300.986 312.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+7464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.404 302.212 458.937 312.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+7465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.374 210.682 270.91 221.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+7466 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7470 0 obj <<
+/D [7468 0 R /XYZ 89 770.89 null]
+>> endobj
+7471 0 obj <<
+/D [7468 0 R /XYZ 90 702.288 null]
+>> endobj
+4937 0 obj <<
+/D [7468 0 R /XYZ 90 702.288 null]
+>> endobj
+6350 0 obj <<
+/D [7468 0 R /XYZ 90 586.23 null]
+>> endobj
+6351 0 obj <<
+/D [7468 0 R /XYZ 90 547.456 null]
+>> endobj
+7472 0 obj <<
+/D [7468 0 R /XYZ 90 480.948 null]
+>> endobj
+7473 0 obj <<
+/D [7468 0 R /XYZ 90 480.948 null]
+>> endobj
+7475 0 obj <<
+/D [7468 0 R /XYZ 90 373.847 null]
+>> endobj
+7476 0 obj <<
+/D [7468 0 R /XYZ 90 229.053 null]
+>> endobj
+7477 0 obj <<
+/D [7468 0 R /XYZ 90 185.236 null]
+>> endobj
+7478 0 obj <<
+/D [7468 0 R /XYZ 90 122.593 null]
+>> endobj
+7467 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7484 0 obj <<
+/Length 2643      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�8��_�Ow6P3|
Hn�Cw�nv���b+�����ܯ��Q��vo?����p���3�p���_gWӳ��EiIe4��4�bI��$�.�#��	��n����*�݌)
˯��b���fw�d����zY$U�?��Y^�^Yo�D�Ҳ̊|�q���5!�	��H�Ա���
	t
(����ٛ�J7F�OV��l:����:}5�P�͐�1�t�z�$�!!U-�9'��̣	!H
�F�s����c:�t���ˤJ]�o�}�֚�M�֒�@q#������33�X#s�b�Wg>�h�?E1���v�*��uݞ�z����+��4��{Q��4 {
k�ܩ>
s�җ�Qs�u�IV��)�Vߝ���Z�%c���H����;�"�}�����L��h�z�
x���I#�ў�+w��ɠ��n�:jn^ؤ�MZ�yU�9����lT���Z���`�,���2]���	e
+I�B�d�Ä�䮬6ɼrw�b�d9O����i\�]��
p�c�].\�11
�/F�|w�
c����_�M�U����/��Ԡ9���������-�΀�5�=��"m�]��i�8�b����9�d�f;�[�i�;Ѷm=f_0Ω%8b���
�E>ߤvq��1.4�"+]��J��j[V�u��K�����Ge�ʖ��*l�𫁎"O��E
++���c�5�.�K?���"�/���+�
�"5pr@�kTۇG��*��.��f��b���juT�Q(�
��I}�<O�
/�����+�|w�~����rv�fz뺒|���s����麟I���\�z�A��&�#��h�("Z���>}�KWw�Q&��hxӹ���v+
�4�'��`*�u0"~�fK�f��LU'���Q̛f;� .Џ����F(�Hq	N!Aҡdb�t��0(�H1bEaƜ.�N��Ĥ]
�F��h )�X��nr6x�.�
ØF���0
Dt�r��W�u
whE ���L��K?��z�U��H$q|O-޴k(΁(Hv
+Cq/FWI~���� ��|
+	=HPS�M
߇�P6
	�jșLSX��P��1��	�4F��\gR�H,O��
+)B
���@�~TC(��'PC
+
϶{������X�����Ƽ��� ^=X�\zB9��
+� ku�������r��O.�(<r��k�x����g���`�㫛,�[64v��|�
+?>�e����&7�!���{7�ϿYrj
� �欖2�i*�,̜��Zb��v����t��z�R��^�k���ܾ)m����2���N�-M�[e���oy�{5�(M揮�� }�*������(�.x�[�Ȋ�&�W˯���zS|�V��=�,�ʶ���

{��!q�ߕ8�{��&
�
\1;�8iL���'MN��!N*T�͛bǛt`��7�'���&ID����i�+W�!�K����jqqa֮\��f
gKA$^dP��*�%��i�V5|"�C�7s�ꙋ�X�VLkC at sTՇ|�G1��6��U�d„q����OQly

���G̜aI��X?�oL�IPI�с]�B�7%
)�O��t���j
V(b�By5��Q�RbBb�0�� 9����'MF����'t��O覕�K��i��N�h%t���}���M�K�*nz\B�L4��	ݴZ	ݾ���=l���z[����
�|�IKp�þ�A
�r_����a�@��
s@�JZQB>��EB���I4�`D�9��)n@�bT��������j1�4�5DbF�X�zħ�l9�����5�Ų����0	S�_X�K��F[���H�#k~�0�F����j~�>�������
��t�e���1R���mQR���/ȱ.�g�5Kl [...]
+�wc�}�2�K��.l��_v� {:��c87�}y���f
+)�
���1�@l�,�9��n�E �q�
	�+�b��[������Y
��A������WC���1�ۍ�r� �*��J��������s������!�'@�N��&��
g�K�0;��βl��}�
+��Ej��.���'�0�������2	�w
��6���O���-ྶ4C[8�H	�\�6���)�
V�.ʬ��zna��c�<�PdI�ڑ&�N�h�{��>uͳ�
@� (��z at 0��ף%��J���#"�� ���΍�X�-y'�`"A�@T�&ǔ��,�K�}f#h���� 5P�@��/�n�΂@�:B����b�0� :�D �ѕ�"
d1���+���
�s�B��i+��{rp$��Y��
�(�	1tj�C�����`8��򉭸��=u�=�����GP[�+���N>��t��d
��7k����$���C�,�_iౘ���QY;H��$��rṣ:����k��L7
1��z���:_�z��M�N��� NS���_�n��0�)�GT�~>���I
WMY�XU����C��`��n[k�P�6|�9B]�ω&�_�<�a�$��`�?����1�#�m��~�w��Y�����������
+endstream
+endobj
+7483 0 obj <<
+/Type /Page
+/Contents 7484 0 R
+/Resources 7482 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7492 0 R
+/Annots [ 7480 0 R 7481 0 R ]
+>> endobj
+7480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.546 475.238 152.146 486.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+7481 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7485 0 obj <<
+/D [7483 0 R /XYZ 89 770.89 null]
+>> endobj
+7486 0 obj <<
+/D [7483 0 R /XYZ 90 583.907 null]
+>> endobj
+4938 0 obj <<
+/D [7483 0 R /XYZ 90 557.56 null]
+>> endobj
+7487 0 obj <<
+/D [7483 0 R /XYZ 90 557.56 null]
+>> endobj
+4939 0 obj <<
+/D [7483 0 R /XYZ 128.814 448.811 null]
+>> endobj
+7488 0 obj <<
+/D [7483 0 R /XYZ 90 444.229 null]
+>> endobj
+7489 0 obj <<
+/D [7483 0 R /XYZ 90 336.436 null]
+>> endobj
+4957 0 obj <<
+/D [7483 0 R /XYZ 90 312.003 null]
+>> endobj
+7490 0 obj <<
+/D [7483 0 R /XYZ 90 312.003 null]
+>> endobj
+7491 0 obj <<
+/D [7483 0 R /XYZ 90 176.011 null]
+>> endobj
+7482 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7504 0 obj <<
+/Length 3392      
+/Filter /FlateDecode
+>>
+stream
+x��[�o��=�����y�N��
X�����zi1 
�Q.jm˕�\��
I}�L�r�b��`E�
?|������:�����bQ�bIety�8R<FB�_w�Մr<���:bR#Kx�����o.����yv����/g
�8)
͗gW�8���_G�XG�e�)��E���?g���ET�K�Ss�
�:F�H�b��.�6Ū��
���D�m���q4�_̘{�*6�y��Ľ�T"�I���~:�O���],�U��oI��+w����iz�޽p���)A\���}�(C�2����Q9LW|���]��X��e4�
+	�ܠ�)��X&��ǩ��
��cK��
y�[�iC�G�Y�U�b�.�z��0:��|�H�tU�fnQ����W�40Y:���ÂyC'�G��f��0�-�lUݔU^�	�hGi'�@"-
�TL����'�mYɼr�{�����Әu�2Z3I+��� C��
+�� �1�F�ިduX��c
c8��D����n 0�;���p� 0N����=ȕ�ہ`��	�d�s=FB{ ����B*�utX�B�3�c�njQn�
+�E���V_nUH�հz؇l�p+�M���^2��I���@aH���31�V��ZUH�Bq�q��@����
�;�CN� ��F}2��v�7��)��-��
+�em�
l�F:��J�In�ZG0�H
+mՁ��:�ӥ3��!QH�z��
��N�	(��v���V>�o�"[�wf+��L\{��Dn ��s0&����{o�w�
�)�0#1��I�1IY��,�һfN�:9.���I�!��"��i5�v4�b$��$Vk�׭�Jw�竻�öy��+w�L��j�A�����!�kFlʴ&��7��p���
t��hey1b�����"]�q�o�F��)��:Z��
+��Ʌ�>'zs�/>>�wEr�&�-���W߮�y�U����m/
2�~�ϳ1p���� �[���7�{�{s9�x�q��b=9���aL�t7[S;���6
+��p�m��^��eUU��_��I��/2�����spT�M�r/p�F g���
t�%l�'�{�c��>-pX��-8�l����d
�V�t�K��12g���
�����+�eN���J���M�d��ݛ�ܧE����TQpB� zL�1
��_��l�{��G�IU'<�����n�</���� ^���̝�(I��&>�'��k�����&
8Ҝ	��~��`�Ơd�<���PS}B�D����������(�\kz�z���� R^ny� Y�uV�
3��s/dIy$\�թ��_<F�
��H��
��^agPՙ1m�$p�tױ;�I5C��!hL!��X8����O���.Y�`٫dibP�a�ۅ,H [�5�qZ�+gQ�ڸ-hm��(��C	���و�L��?Y mP�͜�Ia�.�\��wPl.�c��I��-�!�>W�;
"�
߀���]�v��u��8I
b��V�LFaU�v�T����<�5�8%z�S%������������
+�`��mǐ�kn)	FF

���a���$>��i+uB�a�`�Bt.����>��h�O�<���Unp|L
��C�0�`3X2�
<�	L's�
¨�����ol��0�f84�D]��
�ګ��.p\�h�U��$T[d�"f�)=���L=�:@�Ă]���
+��W
T��z����n��\ ��)
+4ł�:����.���U�\�]Q�\��������>��o%�u\�4y�b�7O!E)��Uní�0���y6�p
#��wZ ��^K���J
Y
�8Bx��S�6�>Y�����4�Q��
a���Hp�l�q�5�<6.���P֪������f
�Ϻ �g��s��V
��t��t��u��f������=������*���׭k��-!�zf��b�1U��5s*٪qN���_�!��O�Z�nsS$
v
�钶�`T���9
�~�]
����a;�]�v�'lW#��Ϗ�%P�H�GE���`~�
��ߏ�E(f�cv�O��
ٕ����΁��
�
��̳�p�N��Ʞ]�H
��	�I����K05*����v��
�K��Qq�1�'� w	x{

w�w����!ᱱ7r'��ȽH�*e�iHa`�'Y�6w�%�E�
+-�|�K��;0�D�c�1=�)���!�
ۙ�	p[��&#yP�Dơ�������,�
�Q	���x�a�����r���ԢmT:i�
w�2�C���$$غ|g�v�
��:-���CR���M��G?���`h:4M�]�dt�q�5��!ʨZ�ǃS3���lQ��?�!�sǤf
�" ��$g�����	����
�69�؝`:"9{&���c�@r֩O#�sg�0bd6���
 )�Sfs'�h�
b8$ <;��1aSs&�P�
�bj�z�CR�Lv�R��=4V��Ep�����8M{H&�<�A�-��jD9hr���SǛ��B�t(w��!���<R��Lq{�
5Io���H�$���ಓ�MT��
+
ۖ̈�\�QZ}�N��9Za�[�0�U~[%�;2%mH`�Nvl�oӜS��N2a��f5�vt��+��9��?��!�����:���K{e`BY�c���&�tX?r�BB=���
+��jk��
e"�A���
k}"H
}��ô��g/�
t+7�Z��W���
N�����Tif�dm��G��6�
+i{�E!���UH^��-FI}��v��9����5,���߷�#1a�.���o��
#n�|�E
s��0�B;Hp�H����t�E�:���J��P�,2醙�G�T1Y��
�t���=��h���Oۇ�́
�ڤ�)ݥ�'��
�
+^K�? �eqO���&�L~
PT�����}����ޟFn�G�m�
+-���>�@��q
��6H��!z��z4 P�;�O'�]}
4�މn�5� ��
�
+L6`��q�^5�E�����:Z{�́��:�Mb���Qj϶'� ��f�{'�����Ŗ���<h�g�v(��w�
��|�6
eR3��O�\5�ې�6�+Fq����u\��q����x���	:�͢��	���%I��Eu��}xH�f�ڏۤ��|��}�bj{M�ѕ����]����!K�#�n7�>�Vw��Nm�Q(�ܖ��>R��æ�����Mb6,���ec�=�|PH����_`*L�=�
�z��a�N}���%��ȁXGn�f
�&y԰V�D���fR�@uq��]|_���LU�޷��j�ԝec]�e���u�j#zu��.M�������/c{<)lO��;�PU�W/_�nޗ��=��s��޽
�})hl��:^C�	��?��Is
+endstream
+endobj
+7503 0 obj <<
+/Type /Page
+/Contents 7504 0 R
+/Resources 7502 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7492 0 R
+/Annots [ 7493 0 R 7506 0 R 7494 0 R 7507 0 R 7495 0 R 7508 0 R 7496 0 R 7509 0 R 7497 0 R 7510 0 R 7498 0 R 7499 0 R 7500 0 R 7501 0 R ]
+>> endobj
+7493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.078 589.126 513.996 600.03]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8cfa8df0c1472235cf53c0b03c70d0d1) >>
+>> endobj
+7506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 577.171 141.266 588.075]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8cfa8df0c1472235cf53c0b03c70d0d1) >>
+>> endobj
+7494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.352 577.171 513.996 588.075]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a97422036ac465eef627efdda59fe796a) >>
+>> endobj
+7507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 565.216 130.323 576.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a97422036ac465eef627efdda59fe796a) >>
+>> endobj
+7495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.88 565.216 513.996 576.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a100e2b8d786b8aa7f2b10125deddb7c8) >>
+>> endobj
+7508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 553.261 140.536 564.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a100e2b8d786b8aa7f2b10125deddb7c8) >>
+>> endobj
+7496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.708 553.261 513.996 564.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a5e0223ac875a8b0d999efbb9b349159e) >>
+>> endobj
+7509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 541.306 134.842 552.21]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a5e0223ac875a8b0d999efbb9b349159e) >>
+>> endobj
+7497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.825 541.306 513.996 552.21]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_acf7ac787c211436eb1f3710b8e4e07f0) >>
+>> endobj
+7510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 529.351 98.745 540.255]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_acf7ac787c211436eb1f3710b8e4e07f0) >>
+>> endobj
+7498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [104.074 529.351 511.506 540.255]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a6b20922fdda0a1d3edcd6e642d882f68) >>
+>> endobj
+7499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 517.395 494.06 528.299]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a2455d0df0fa4e1bf0781207fae5453c9) >>
+>> endobj
+7500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 505.44 474.869 516.344]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a02093e67947f8d2936d16e50a8f0b3e6) >>
+>> endobj
+7501 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7505 0 obj <<
+/D [7503 0 R /XYZ 89 770.89 null]
+>> endobj
+7479 0 obj <<
+/D [7503 0 R /XYZ 90 506.437 null]
+>> endobj
+7511 0 obj <<
+/D [7503 0 R /XYZ 90 501.953 null]
+>> endobj
+7512 0 obj <<
+/D [7503 0 R /XYZ 90 421.424 null]
+>> endobj
+4955 0 obj <<
+/D [7503 0 R /XYZ 90 333.558 null]
+>> endobj
+7513 0 obj <<
+/D [7503 0 R /XYZ 90 329.075 null]
+>> endobj
+7514 0 obj <<
+/D [7503 0 R /XYZ 90 230.204 null]
+>> endobj
+7271 0 obj <<
+/D [7503 0 R /XYZ 355.061 84.126 null]
+>> endobj
+7515 0 obj <<
+/D [7503 0 R /XYZ 90 77.486 null]
+>> endobj
+7502 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F7 803 0 R /F10 773 0 R /F35 1248 0 R /F118 2438 0 R /F94 771 0 R /F100 4949 0 R /F8 802 0 R /F1 834 0 R /F13 835 0 R /F99 864 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7532 0 obj <<
+/Length 3398      
+/Filter /FlateDecode
+>>
+stream
+x��[mo#���_� @*���/nS��A�
�&nQ��`���"ki}�˯�
�}�.%��
+�O�W��p������Fw#�ߝQ�
+��:{qa����
]ݎ

͈�lt��
3J��L�t|9at<�>̮/'���Շ�b��]����ζ��/.�����W����/.���L���5
I憹��\M
��pʻ��r2劎a���U៾�ڬ��&F�?lrs2Ɖ���=s
+W��z5���T~��a��U^�h*� ��є1�
+o�Tܢ:v\��a���P�k�\2||���ٯg
���V��;�?��~KG
x��pv��zI.�s5���_g4�>�m���
�b�]SDw��,�g#c�nM�%�m��̀
+,��=`$�`?�k��f��GPwh��8�5W�%��dia���_��gP�-O����(�(p5����[ �i�f��~�Sh%� ƘD������/�Pp�s�D
�E��1�M�
��E�W
aN�/V�Z��b0X���ip�
Ѳ�(���	~��-�uFQ��5�AQ*M3{f�sD(����Fp/�Ջ8|BeN��0D)�*Ђ�z�	���a�Jy5�$V�T��h��ՊCh�h�����eϢ���",�
Ut2�����zWe i
z@�HE�b����p5
s�k��&�}Q��v�X�y�W��g�����6kݧ��O���7��˛]ٳ���*���&�Pc�ҿ�Yf��8����<JPA8�#m
��ya�joXŏ�'!0M���/,l���߉���	���&o������ր[��R����U?�o��kB��B�<L
�	����|5�!S�2s��,�o"X8"e��b^b�ʍgk��t�
�
�l���������[~ˊ�l�ٖ�-!
�>Aªy��7%��U�!
+}�Ǘ��up
钪��Q��\�fMV�0q���,�]�}�_��(�S��^5����'�lmJ�z��ZM8Ӱς8���_b*�m�V�H�ƻT`�3K��_Ï�[��j�Ps��jҡ���D�
�
+1��< ���ަbC4�	x�G�	��
��>���F�a��H&j\!��+����[�g�[U��Y�y�ڊA�}�����+kO	�SK��Q@^$��� ҈���!3R�ƃ�0!c?�g*��OG�=��vP>]��ۊ"��('��܀��D����Zǐ
PR'�'��,m�@I�y*������/1�㷛��C�X����� ��+ٿ���)����Fa�	�h�e,*A&�/���G�E��,�����2% Ad{�~C���4W�u��Ҝ��
� `J�Y�	��
+
m0�a=��&��1
�<c  ����Q_��[�
y��;��dQ ��Eܗ��<��N�30r"�Kk��P��_
t�
's�4�7$���ˡ=�-S��p:,���6�o
D;���~	꛺����0	1�a��?��*'�.:+U���| 9� "�L�Kj>�@��
:h��2�
Q�g�C�� R���oA
��?^l3 �h�;�b_�-�Z_���rߖ����
e����e *��9.R���NK -Q&b�U
XK�$Pt��1�	e6U�
�����BNbB{�f�y3ڜ�v���1�I2\�`�)�fܞY�	��x�)�8<��0�������`Q�Y5�����C�ƪE(��9y£)��I3,�G6#��ی��X��=L@�iFH*�(C��t#��'�@�T�N
L �OPq�]����:�]��(.{v9ԎPm�wO;Bwk��
z�IL*����M�
�
��h ��(�oW3�dsi=y،y���l�rOt\4=X��p$!�(�FD~�G(�����1�|�8~
�@M�N5�u\�{�{��O��0��j
v(�T�Ŷ
��ͮ\=���G5�:}�5HH ֩t
�v��XnC\�*v

^
`)��$���ȴ%�/�t�ܳ<��s�{Qƹ���:�*b�If��+{37�A°�� ��j�Q
�,���t^֫�'
��D�P����0�������� Em���~}�w
�D�&���P8N�6-á�#R�[�����u}H�9�]�p�����f�����M�)M���nM��v�=�V�b��O���r=��ؖ�M�[VK�Yh�����ȷ�U�{�8g�}�/w�1L��܈i�_���3A[֩��7E��(��Q�.�g������z���Mѣz%�E�
��j��)}�^�y�ۢ�b]l�3�nˇ�F��jU�aߣI�#<֯���=�"��Oa�i}��
�*
�z���n6+r��SC��eQ*84�&wuʷr
f���BV@|Q�`\DY3�+
="���m$���
+H��V.�Y,ϝBΘ/0&*�b�B�-����9��b&U �����W�8ツwdڦiK����&E{9M+9����}��5@�)���h�.��4����WR8�;HTH	kj]�u�
C�[��o�G�r�[x�Z��:e— �[xy������~�5����%6��(���L
����'־�s	��0
�؛QB�T�>�����s��V�}�8��o�)���Ǘ���.��r��_� ���\�j��ۉ���?��亘C>�m?�����1ySl�&���W�򶉵u:
+���'p9?ǎdHM/c|�\�W��\fV�R�<��J�B�����N�D��a+͂���^>� �V�y(�t�&��_o�a?h�Č$��pFz��V�u���,Wq:��.z�O~xH��u��uE��
�����b	@��uݻ�>���΍�]_M,��	�������6�b�����1��@����
�b��v��/�Da"@}������������,�u ���6�����C|e�j	,���L�x�]{
+YW�*J	R���a�i��q$��u����KC-�;�Юm����c&(�E�8J� M�z��C�ܬ��]��Sw^8�p��7^G逝8����"�>�t�~���������� �6@����_f[T������ӳ�1�;�
Q��Á]ؖIXꙄ�%�N#�X�Ϟ~�”�n��p4a��7�u2���;3��m!a3#rn+��׵�K����4�/��q�D����
��5���\���s���y���������wt� ���>w��.p+�~Ù/ �������
�B�'�U(�d&�]���Q��q�#
�O�o���5ж���i���k:-^��wZK���N����0f�L�śݽ�ğ�Ë�ı��R�|h�"�!��������?a�)���l����x�t��QFl���D'�����eT�Ǚg��ȃ���_�js�����ݮX��C�w�G��S^���S��3��\ͭk��`�_�aRf
�#��������������^4�1�s
+endstream
+endobj
+7531 0 obj <<
+/Type /Page
+/Contents 7532 0 R
+/Resources 7530 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7492 0 R
+/Annots [ 7520 0 R 7521 0 R 7522 0 R 7523 0 R 7524 0 R 7525 0 R 7529 0 R ]
+>> endobj
+7520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 177.659 211.952 188.563]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_a70b0fbcc1272e8bb764a95cb3f1e2d17) >>
+>> endobj
+7521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.767 177.659 281.41 188.563]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.215 137.951 255.159 148.855]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_a534e99d940f191cba72c31acb19989cc) >>
+>> endobj
+7523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.094 137.951 384.732 148.855]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Constant) >>
+>> endobj
+7524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.64 86.288 260.151 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_ae11646b9e6b853245a5d04301f39c134) >>
+>> endobj
+7525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.51 86.288 376.722 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+7529 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7533 0 obj <<
+/D [7531 0 R /XYZ 89 770.89 null]
+>> endobj
+7534 0 obj <<
+/D [7531 0 R /XYZ 90 636.096 null]
+>> endobj
+7535 0 obj <<
+/D [7531 0 R /XYZ 90 498.183 null]
+>> endobj
+4956 0 obj <<
+/D [7531 0 R /XYZ 90 477.149 null]
+>> endobj
+7536 0 obj <<
+/D [7531 0 R /XYZ 90 477.149 null]
+>> endobj
+1857 0 obj <<
+/D [7531 0 R /XYZ 90 329.912 null]
+>> endobj
+318 0 obj <<
+/D [7531 0 R /XYZ 90 322.779 null]
+>> endobj
+7537 0 obj <<
+/D [7531 0 R /XYZ 90 197.079 null]
+>> endobj
+7530 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F8 802 0 R /F7 803 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F24 537 0 R /F22 2982 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7545 0 obj <<
+/Length 2717      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s۸�_�����`|���L��;����D}J2
Y�m�I���������(Z��zh�H��b����K��.��?��>;;��"JI��$��F)��L�J�i}���/�#���F��7��<{���#�;{;;���+1'@m�����-��Lj����$p]E��uF�.ë�-�����1�j"�a������Ly���>s7ل��{����ʵ�������'�e���:m:�����-���
g�z��l��D������uN�b��Z�h��K�v+�&T�V̾�8�-X'gD�������}��0�;��]�ռ	f����RM%�J�\�D��n�hl-�h\?l3I&0���j��ݫ�rת.�
��}Sc
c��t�s�D�/Mp�u�4b��l��eB{H�2��n$�R�!�9W����TQ��z�{�R���wBH�w
�lw�q����*9l��z���M��j(;��.�]}X�k ���*����fe�Yd�%�պ%�T�����3X`��$�7
fC�y9a��C_`B�9�
�ǚ/��#�3�aǗըt�a��
��pEJ�шGxTnpk�k
�6J�:�ǖ8�]�
�=�3� �v����3u3�& R�A�h��@���v�|�����5�؋5��Ś��mQU0$���j;_d�S�~�
E(���~D�[߭�D)?���*Q�4

\��ې$1(h� �h%��"
+�
+�/v{YW
>  EB8�y� i?(D��z������S�(�m
;�'���a
��l�]�.�8�����%5D�vQ�"���Q
A ��`
��PQ��JP3�vy���9x0�>RFu8Cs�����.���"P���U�
fR��+ƕ�jD��nq
+
RN4;�`6�&�e`t�q�q��\�Wsּ�p	F_�����H~�%	
N��]M��n��}�,G4�Y9��h !�7
4x�ߔs��c��
+\Ո�̟0"5������Vp9n�!_�$�t9Ի��Ap*�!"$�ε0���1
��9I8�=�TXQH��t&� h��$([�B
8(l�0+?��p+��������7U
�[㓎���&5�"��k�4��h�
��y��$Ge�T�=�T����ޏ�S�}�����o���4�1�:�5_f�j�o�,�C���{O�]>��&[dU5/��� ��Nl�g	4�f%��7w	v)U�A����gJEr���riCz��]m�ȁ�5̍�C8�M9d|��P��2�
��ٻ���8��T���GP�#����A�an?C3�����6�ڧN
U`�}���E�ټl�s�� N�ڤ\m�E�Y3a�D�D�����^�G|���,J���-�'�I�n�!
��8`�$
q!�׮ʖᖂ�yIaۀWPs�1�/7��@�;c��Ƅ,k
�����?=_��H
8
��w0����*7�C��
��ɢ[6�w>�p
�^a�A��mmƁ�+4F�f]�A�X�y��u��X�rS�6ˆ����g��s��6,7���C���!�\B&�cܔ{n�S����
�K������b��x����� s�p��)�jF�+g#��9�<��Ag>�r�6�
���xբ�����& =�r�����I4 B�P�C)���C֞�_sX	��e�"h��*2����Ǩ��\a�	����X9�y�Ƞ%����F9K�ꃤ
���HY�LõGp"�"F>�o+�=p~���h�Y�h`
1~1��AЫu�z��..G�'����S,B�΂"\D>4�'�-��aݑ��"Z��C)F4�v9b0��L6z,F���
+ȟ&}�Ss`p�@IIztT��/���P ��
�m�A
(�&^�YK낍V[FmZc�"�lˣ� �t֒�O�]	J$]������ӈ ��!75��� 4���?}��-��{V�|��,,��P�����
�u�l8m?����(�p^{	eS	^���3Ʋ�T��뱪'�>�8�޶_k
�3x���
"E�Ƌ�O�ܔ�a�
,��?d���T��dC��)F �ŸN�r7�7��[K~;v������f9o��TJ}E��9�Y��÷�� �rİ
���n����, �]
� e�oyu_�02`PD+
:��B�8� v:�CQ�h�(�;�����
��0�{��&��~���>��)�~c%qÎ't��=N� �� 
(�T
M
]�>��`
�K� �T
lx�
�cLr�)%�$��R��fl�i�:��&!Hp0����ӥ��B���A��O|�N���������{�����7�6�@PN���w�8<�mXu�zR�(Mğ@�
����
��EiMb�x�	~9�ϋ�JJ�%������O��I��*ԠG�}�zky
�6
���[�C�[�$����:�!����v
���|���s�T�8��.xr�n��
JoV���
w=>n�LX��B"��q�
�r�k~���P���󏶰�U�T�U:;Y�)sx{�<d��t)���K�)?�`��#��OFʽI���%�h.����7P�n�6���F��ܾ��ۗ��p�n-�
+։���i'�F*XZD����
T�f�߯�]e�_&���{�i��5�qL�� ^V�w,Fض�
�&��Y�o����V�:4�t�ph1m�����������6wdQ��#S78��
R��i������m� 
���
+endstream
+endobj
+7544 0 obj <<
+/Type /Page
+/Contents 7545 0 R
+/Resources 7543 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7492 0 R
+/Annots [ 7526 0 R 7527 0 R 7528 0 R 7541 0 R 7542 0 R ]
+>> endobj
+7526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.422 682.255 271.886 693.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle_a34f9d9a55678514e434ebed37cf89f01) >>
+>> endobj
+7527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.028 682.255 402.933 693.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Approximable__Reference) >>
+>> endobj
+7528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 670.3 179.554 681.204]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.533 453.25 490.745 464.154]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+7542 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7546 0 obj <<
+/D [7544 0 R /XYZ 89 770.89 null]
+>> endobj
+7547 0 obj <<
+/D [7544 0 R /XYZ 90 625.777 null]
+>> endobj
+7548 0 obj <<
+/D [7544 0 R /XYZ 90 562.73 null]
+>> endobj
+7549 0 obj <<
+/D [7544 0 R /XYZ 90 388.227 null]
+>> endobj
+7538 0 obj <<
+/D [7544 0 R /XYZ 90 365.044 null]
+>> endobj
+7550 0 obj <<
+/D [7544 0 R /XYZ 90 365.044 null]
+>> endobj
+7539 0 obj <<
+/D [7544 0 R /XYZ 90 228.187 null]
+>> endobj
+7551 0 obj <<
+/D [7544 0 R /XYZ 90 223.704 null]
+>> endobj
+7540 0 obj <<
+/D [7544 0 R /XYZ 90 77.486 null]
+>> endobj
+7543 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7579 0 obj <<
+/Length 2478      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo����_���U���/i\\��.W_�&·"	Z�%�$RGR�E�{gv��HQ�
�E?�Z�˼<3��R4�4���/7g�F�4���]��Ȉ(
ߦ���D��QJ�CFq����CN��a�L�x|��q�pq�c�%E\��p�
�Z�e�
�'wI1d� �&	l'"

��/7?���9�팁@4`N ELL�g���`
+�?��(
��e ���E����g��B	W��^��u4c�0�QLN�W�J��E\%(��%�^i
�<�C���݌�ކ�L�
VI/AM���f�m��`6
�*
��!ek2\^�DPNx���F���IF�avM �"�Ȗ
�dx�:d �G !I��I������p V�1<g�D����
Ã#UO���"L�5�a���
����(#�#R�-?
+����"�,�De:$24�@�R���
@��ZM���%�����q+V���
+��'� 
	�-�!P��
+0��z��E
g;JHJ��JHJp�V"3�Ë�õ"��'9
�	�><A(���;9�D���N�Ѻ�;��u^0B�i�	��T��H5��YY��`D3Q{�U�M\����kT
��2ͳ
�D�̏�
cf���l�̑ܳ��w�
�֔�p��H�L�����w���n�Fo��R�oh�k���2��j�V��I���I��� &7�7) �`�oO
�I�^T}��pz%�
s{nCO�r"�UO��Z5�!�#����`��b�S���KM�
���h$N8�.����trTs����=�#1<=������
��3̐Az�:��Ev���U�`Q$�j��W�VE�{�Z�=�o��_�>�pd�&�ɥ�+�vS���I6��� �d��[�K/�m�80���a���E�.���H�H
+:C
i]n�S�-K ��ԏeUޣ	
+�i�8-] �nJ
i���/;�1�_@
+¥��}R���lo� �-!�#Ŝ���DU��>�k"ic����z
���-��o~X�~~��g�v����c
� ��,�#	E�j��E�'� �m�����}Z&��-+(d
+����0������s�{�;�-�3�/e�R��4T�`�<�A�ƭT�T
C���$@)��
���c5tS��
M�����j�yq�$ája���̣H=�&��b! \rzm��a�w�(	�����a�%n�`��"��8� � X��00�����B	��(�4�����')d�i��@��I��������2ɐ���
y
+
f�K�k!Q@�ZP�K��1h�ˡ
+��2=�,Š�H5gO&��XC���>Rm�SH�ie5��(�E������-�ZњXo�3��1���:�*?���
g����"�%z���4ӧ3\�b�Ry6"e���O[��9���b�C��
+
��x�[�Wg��▅���nӼ�ZO��Ls at aʆ��
;��h�

+�?�?��B��6��0}U�D_���;�(s�<�*�g�vv�<�A��F�
Vp��^(�0�xU@[�irٰ��"K��$0���ύ�h�si6�O<~����=�}wS�����M1�u�����
+��Y^��q/h���xf�_�v��QDb��
���4�����n设���5�'�� -g�ܻ��wE����._,r�]����]Y$-E��a�E�l��s՞�i� ��V
2���:\�snW����e��t���D"
!
�KQ��T'{i�&[r0�g*���M��@s��:���.�~�ӈ��Y�	Z"8�����އ��{x�14������rE�
�	H ����z}�f�
@��
�m��}�}��7Y�-d��'�i�L��b=��X&�v���ZLu���>����}od��^k�/���̹H'κ5�ޗ��^�	'5��%I�^�I<0-{3
i��W�o�:�����םe���_���<q���7oo����ջ߿
������̑�i�c��@
FLB3uR�
3 �mɚ��A�9"��
:
s؃��4��������t���ⲏ�ם[��{�$A.�w�~���e޳�ȯ�ݿ��
8�
+�A\�7'w�ֽ�ٺ�y�
��q�rL�Q��h��� bI�#� �:��܅7f��

O��HO�
A��4$��>��/G
u�aip�E�&�_��m���:�T�u?5ɰ=�@D��D�m�0DC�Fz�޿C�	��qqh���zBx�
Y��Te��[u,�:��E:K�d�o�z�H�ϝ��n�c5[�QZ�(�jt
j߂V�d��t .u��O���#���Sn�u
+��j��͉����� ���БFa'�]__���eR�i��}��M��뜅>�W�IQ6�#
���|��!����נ~���~6�0�:l�ռ�V����cF&�r7x�t�d�I�M��k�f0�ܲ*X���®I��`�� �Rf
�3����B?p�f)���`�������6
+endstream
+endobj
+7578 0 obj <<
+/Type /Page
+/Contents 7579 0 R
+/Resources 7577 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7492 0 R
+/Annots [ 7553 0 R 7554 0 R 7555 0 R 7556 0 R 7557 0 R 7558 0 R 7559 0 R 7560 0 R 7561 0 R 7562 0 R 7563 0 R 7564 0 R 7565 0 R 7566 0 R 7567 0 R 7568 0 R 7576 0 R ]
+>> endobj
+7553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.855 423.858 346.467 434.762]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) >>
+>> endobj
+7554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 250.535 160.207 261.439]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) >>
+>> endobj
+7555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.977 250.535 192.655 261.439]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a4312979a12cae5ebb0791496e1ccce7a) >>
+>> endobj
+7556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.643 250.535 218.667 261.439]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a05abaa6ff4aa204c25c94719e8a2b6f4) >>
+>> endobj
+7557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.656 250.535 252.978 261.439]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5ab7fe867b1243e111ef4364e3ef5b5329) >>
+>> endobj
+7558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.967 250.535 337.66 261.439]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5abed2d3fff60e7c0b8fc325bf46f9725f) >>
+>> endobj
+7559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 198.998 201.399 209.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.376 198.998 264.06 209.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a866f4ea2872ce75eecb0cddf8be815d7) >>
+>> endobj
+7561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 129.585 155.733 140.489]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+7562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.549 129.585 221.306 140.489]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.741 129.585 321.719 140.489]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 101.959 155.733 112.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a3f29f8b40d09b17eaa4cbaac069f72a0) >>
+>> endobj
+7565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.07 101.959 224.893 112.863]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 89.142 155.733 100.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4904a65badd41facf2b598f09eb726a5) >>
+>> endobj
+7567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.07 89.142 224.893 100.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.105 89.142 304.862 100.046]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7576 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7580 0 obj <<
+/D [7578 0 R /XYZ 89 770.89 null]
+>> endobj
+7581 0 obj <<
+/D [7578 0 R /XYZ 90 721.073 null]
+>> endobj
+7552 0 obj <<
+/D [7578 0 R /XYZ 90 586.459 null]
+>> endobj
+7582 0 obj <<
+/D [7578 0 R /XYZ 90 581.975 null]
+>> endobj
+1858 0 obj <<
+/D [7578 0 R /XYZ 90 374.743 null]
+>> endobj
+322 0 obj <<
+/D [7578 0 R /XYZ 90 367.725 null]
+>> endobj
+7583 0 obj <<
+/D [7578 0 R /XYZ 90 267.396 null]
+>> endobj
+7584 0 obj <<
+/D [7578 0 R /XYZ 90 240.034 null]
+>> endobj
+7585 0 obj <<
+/D [7578 0 R /XYZ 90 148.444 null]
+>> endobj
+7586 0 obj <<
+/D [7578 0 R /XYZ 90 148.444 null]
+>> endobj
+7587 0 obj <<
+/D [7578 0 R /XYZ 90 105.944 null]
+>> endobj
+7577 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7641 0 obj <<
+/Length 1732      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��F~���)5Rvv.
�U[)�\�I���n��D���Qlp���;�
�Ŏ�F�b�Ù�}�
+P�iP{5�m48i���Mm4�
�Y��)��h��0�ϣ�1m�
S��O_�7z�nt��
^�_H^�JP`ٚ�|�
��<�Z��8�vߴ�
L��\��1��.���	K:!h�ؚ�@(Q��4~x�\=]�R5�_
��g��+�3�F���./b
+�� �^�Qz�F���QƓ�����`~�
m��ND�t=6��I}P���!,��}�E�5[
+2?r#)�N�ر\�{��14[��4�0���Q
`Y4es��豘�&b�-�'�yt�
����ɡЉ5�*�?�Z�5ן����!@E�-���=
���(���a:��~���[���e��=�D�jZ饘��5��YnN����ǽ��I3��e�����A�L��,
�̗
��\]
ѡ{
+�6��^[�V�yU�ݡֹf�J�a")�K}�[��?3�59m0M��.=
�b�IrWE#�����x،2pl�Fj����n|�L��E�n�+�h����r?LDa����q;�e;�x[��K�q)�I��(I�(:4�6���f�0Y�M<�xz���kV��Rrc�7B���\ȶ�eZ��ʠՈ�.�XA�絖�G,@����d
A��e���l�^G�VYn�)|����3�+�{;����Tw��c��ͽ������V��
�A!�G�T�������.���� !�nQ�a� 
+L'�i�[���Z3~J�� �7�#�"P��Z��:S�C�TA>
߰��x���ŎÂ�x*��P��y[�(�1�{*t���ֺ�����Ck2ԇK˚p��

+O��hrq����bhI_

`9�~ޣ�N�dk�����[�"�d��.���}��}�)�7ޜu��6 �B��-Q�m�c���0
M�~��
�F'	�I����Ow{˯�±s�O��W[�<)�i�I�T�8qA�(��-Z��
���?��i��5�! �G�H�X�}�,]sK���x'���̈�eX���i���G����؎�@m�I��?�nN�5�5|��ot�0q.�G?0|<��!O��j�W��@�/��3���z�:N���
�8.�‹���`S&��f�m1Ǩ�;��n���NW�&yc\��L\���0�Y���, �n�'jL���a˛�ǗVWu�j
w��u��2.	$voJ
�������%f�l�3���6jK�?t>�`�@l�!��=`B
�;�k�?��D,<e�U��}��m�ʂ��>V7��FSK���D���9�az��VK�Mcn75�æ,d�ڽ	���t`�z�J���	��2���
����]� ']p��,�A� [...]
+�u
��9�t����24h������ȳ�c�7.m(|"��^���oK�@�4�bw�0MP��k���͑S��
����K�;���0<�X at u(������n���Eͩ�n�q>���#��o���d"��/��w8
��T�f���n.���4Ƒ�u�����+5%��t����P����~
@ �w*�_�8���IO�_-��<��
+qgR�Y!0�Z��DL
+
g��5ʨ������ϐ����/��w�_e�C�(y'��1@K�l�.���oXV7&�}�U���e�,(�՜wQ��8?�]�$�3��]/*�� h�8N�^Ks��ʓ���j$���^
+endstream
+endobj
+7640 0 obj <<
+/Type /Page
+/Contents 7641 0 R
+/Resources 7639 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7492 0 R
+/Annots [ 7569 0 R 7570 0 R 7571 0 R 7572 0 R 7573 0 R 7574 0 R 7575 0 R 7595 0 R 7596 0 R 7597 0 R 7598 0 R 7599 0 R 7600 0 R 7601 0 R 7602 0 R 7603 0 R 7604 0 R 7605 0 R 7606 0 R 7607 0 R 7608 0 R 7609 0 R 7610 0 R 7611 0 R 7612 0 R 7613 0 R 7614 0 R 7615 0 R 7616 0 R 7617 0 R 7618 0 R 7619 0 R 7620 0 R 7621 0 R 7622 0 R 7623 0 R 7624 0 R 7625 0 R 7626 0 R 7627 0 R 7628 0 R 7629 0 R 7630 0 R 7631 0 R 7632 0 R 7633 0 R 7634 0 R 7635 0 R 7638 0 R ]
+>> endobj
+7569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 155.733 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5a20d28505fdda8702b48c35d08cfddd) >>
+>> endobj
+7570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.07 707.957 224.893 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.105 707.957 308.748 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.175 155.733 706.079]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a37b12f6fbf02f9a3a51dee028128d446) >>
+>> endobj
+7573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.07 695.175 224.893 706.079]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.105 695.175 308.748 706.079]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.837 695.175 418.595 706.079]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.993 163.482 678.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab339ccb929a7255295ad19a5b168d5d0) >>
+>> endobj
+7596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 640.064 155.733 650.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.473 640.064 207.279 650.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4fb7d78e7b37d7f4b99babdc5cc84783) >>
+>> endobj
+7598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.616 640.064 276.439 650.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 612.508 175.668 623.412]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 612.508 234.596 623.412]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abccc1b3be92c83b70dd47667198d62cf) >>
+>> endobj
+7601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 584.952 208.395 595.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2c0762c7e8b14cb1d2032bf920b57732) >>
+>> endobj
+7602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 584.952 273.968 595.856]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 557.397 179.554 568.301]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 557.397 250.666 568.301]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1c884f5152f75040139ec3d9ec8ac293) >>
+>> endobj
+7605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 529.841 220.579 540.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a66af65679979f949af0457fbcb07dcca) >>
+>> endobj
+7606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 529.841 290.038 540.745]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 517.059 233.76 527.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8d0452265a9138357bbccc5902f80d97) >>
+>> endobj
+7608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.575 517.059 272.763 527.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+7609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.205 517.059 323.393 527.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+7610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 489.503 243.165 500.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af64f0b6ef53df6ef8024b03b187d197c) >>
+>> endobj
+7611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.502 489.503 327.278 500.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+7612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 461.948 246.034 472.852]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a497cd4705484de0b938f6e03fd2ff460) >>
+>> endobj
+7613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.522 461.948 360.71 472.852]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+7614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 434.392 231.1 445.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ae6e33f7246f4e3683fdab905d2e26819) >>
+>> endobj
+7615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.915 434.392 270.103 445.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+7616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.916 434.392 345.559 445.296]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 421.61 135.579 432.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) >>
+>> endobj
+7618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.077 421.61 155.225 432.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a7c502c8d46ed2f68679404fdfdf8e0bf) >>
+>> endobj
+7619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 394.428 162.677 404.958]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad8cee05f88ad5aea288c1f6b8bf7cdc7) >>
+>> endobj
+7620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 366.499 160.455 377.403]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ae5902ab7e2d3304037a56ecda7fc22a4) >>
+>> endobj
+7621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 338.943 168.216 349.847]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af1827b1f7a42393a2526944530559c5a) >>
+>> endobj
+7622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 311.387 201.969 322.291]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2aba27eb7310045e1a35c7e68af01ab2) >>
+>> endobj
+7623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 284.205 297.728 294.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_afceefab91d648d188e42e5a75a3a977e) >>
+>> endobj
+7624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.544 284.205 336.732 294.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+7625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 256.649 283.353 267.18]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aeff190ba56f86d3425859043689d499a) >>
+>> endobj
+7626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 228.72 191.718 239.624]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+7627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 228.72 288.852 239.624]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ade98f4e320d7d21e223afb83240b3800) >>
+>> endobj
+7628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 201.164 191.718 212.068]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+7629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 201.164 303.079 212.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a77fc44f44b1bdda486e19e30310634e2) >>
+>> endobj
+7630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 173.608 201.471 184.512]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a42867df59ec40173391b76074f9f0fb2) >>
+>> endobj
+7631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.808 173.608 270.631 184.512]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 146.052 182.044 156.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4da7504ef9aeba8a782d47c83ce1abe7) >>
+>> endobj
+7633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.381 146.052 251.204 156.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 118.87 150.493 129.401]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af1bf8c762c6f36b30f2abcaffe591acb) >>
+>> endobj
+7635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 90.941 181.845 101.845]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a13c726daa7d565ded0b177e24b6d1104) >>
+>> endobj
+7638 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7642 0 obj <<
+/D [7640 0 R /XYZ 89 770.89 null]
+>> endobj
+7643 0 obj <<
+/D [7640 0 R /XYZ 90 711.942 null]
+>> endobj
+7644 0 obj <<
+/D [7640 0 R /XYZ 90 684.71 null]
+>> endobj
+7645 0 obj <<
+/D [7640 0 R /XYZ 90 658.88 null]
+>> endobj
+7646 0 obj <<
+/D [7640 0 R /XYZ 90 629.598 null]
+>> endobj
+7647 0 obj <<
+/D [7640 0 R /XYZ 90 602.042 null]
+>> endobj
+7648 0 obj <<
+/D [7640 0 R /XYZ 90 574.486 null]
+>> endobj
+7649 0 obj <<
+/D [7640 0 R /XYZ 90 533.826 null]
+>> endobj
+7650 0 obj <<
+/D [7640 0 R /XYZ 90 438.377 null]
+>> endobj
+7651 0 obj <<
+/D [7640 0 R /XYZ 90 411.144 null]
+>> endobj
+7652 0 obj <<
+/D [7640 0 R /XYZ 90 383.589 null]
+>> endobj
+7653 0 obj <<
+/D [7640 0 R /XYZ 90 356.033 null]
+>> endobj
+7654 0 obj <<
+/D [7640 0 R /XYZ 90 328.477 null]
+>> endobj
+7655 0 obj <<
+/D [7640 0 R /XYZ 90 245.81 null]
+>> endobj
+7656 0 obj <<
+/D [7640 0 R /XYZ 90 218.254 null]
+>> endobj
+7657 0 obj <<
+/D [7640 0 R /XYZ 90 135.587 null]
+>> endobj
+7658 0 obj <<
+/D [7640 0 R /XYZ 90 108.031 null]
+>> endobj
+7639 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R /F68 3017 0 R /F111 1509 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7727 0 obj <<
+/Length 1816      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�8�_�SΞ�} >2�C��tҦ3�$7��v<�9\Mݿ�V`;�'vӻ�����ﷻH�֍����߯zG'.�|�;Ա�Ɩ�-��w�Wd}��lw0$�����~ ���|@q?��oE$��Y|-9?>~+!�<��!��zd���c!��$�����S�>_�뽹�}�0[����Y���3�"x��ˆ��u����M\'�e��
.炗���9� �y�K"�������0���
���Q���Hޔ�]h)5� 
�x��}
��O��,����,�"�
d��0M�|ehu=:�m��
[�N)rlj
��<�j���q.J���rtB`^�Q
�
�i�̈��u�Ci%$F٫�ק��V��3s�D�y��b��(t�%���l^��Ƭ�09ح��۸�4J�MC+N��!�|�n(���Edg2N�uA�Q ��;�'R���Do�r�Z�$>��V��
+)tq��ZW���M�:��J,����L�]6�!�j��x��Fpc�(c�5���N�IbO� j%v�@�G��
ޥ���Xl�O��Ag�ج��.e+���
��� �&�V̌Q��<���8
4/��J��/
+�%k@�C�h�WIdL�D#=�q����ǐ9٘@,0�y�:�0L���|2p�2��W^�$kz��.�6��X�ǚ
�� '+�Pdٸ�
6N�Cةg2&Y�j�Q�.��.A�7c�|��s:��t���,�
�_�
C�O���]0kL�
�n5�S���{�M�T��u�L���-��������%K��o39��3�y��5��rƞ���Smf
��f$�̯@s�n��V
j3�(��"ZX�VȤ�&��UyPͧt5�\�.�N��p�#@��QDp+�ACPJ��yq=p����1��ܟI�2m������Ta �ଝ��y+#�Y�V|'b]t�c�f�
��M+R�a��
����A�|�>�Db�SP1�G�MS�))������zd}�b���2�AN�iZg�@F��N��
�#��/�<<R�X�������
�¨��S� ��@J|�6||1F�@H��!%t Z �@���w!ӆ��jw�!���)�r�B�0Ȍr�y6T� ��|J��,WU�[K�06�,��h�X��
�\�d��$@�.$11}@�؍3Di+
V�>��;>��
u�4F�#�
�
����� ��'�T�7q�ᣥ��,�՛?S��}pv@�-X�	|���8+�p�f���x+��Vb㭄v\�(n�G
QI��P��G��G)�E���m�(/�*�a�8�g�fh��OZ�6�iU���N1�����x�/>ܝ��0��"Q�b�o|e� �zt�B�N�/��E�����N�
E����5��a��y$Ѥ�"���������I�V9��b�>��?D{�e�9q�4${�������]L�w�y�پ��>V�}���Yz__e��R��`��,
�<�V�
�uNdte�Y�'�(E<H���� 8Ȇ�<\�7�V���B�Ԧ�.�ao���N5x�=,iV%Ԗ�w�_(P�E�因�
��

�;��H���6n��s_��Q��7����
+��
i}O��3IK�l7������F/l�ɫ�����FE&ʝ�qu�,ѕ�n�P�a������e�%:�.�N�-��� ����
�����_�����%�>IQqA���2V�EWC�px���q�KQFc�?Vu�^
��+	#۫Yt��㣣���x�Bs�d�Ks���S��i*E�u
+�:�:�W��C�8��8�
pץZb�^�Y
,
�N��G
+N^
���8�^
+endstream
+endobj
+7726 0 obj <<
+/Type /Page
+/Contents 7727 0 R
+/Resources 7725 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7745 0 R
+/Annots [ 7636 0 R 7637 0 R 7668 0 R 7669 0 R 7670 0 R 7671 0 R 7672 0 R 7673 0 R 7674 0 R 7675 0 R 7676 0 R 7677 0 R 7678 0 R 7679 0 R 7680 0 R 7681 0 R 7682 0 R 7683 0 R 7684 0 R 7685 0 R 7686 0 R 7687 0 R 7688 0 R 7689 0 R 7690 0 R 7691 0 R 7692 0 R 7693 0 R 7694 0 R 7695 0 R 7696 0 R 7697 0 R 7698 0 R 7699 0 R 7700 0 R 7701 0 R 7702 0 R 7703 0 R 7704 0 R 7705 0 R 7706 0 R 7707 0 R 7708 0 R 7709 0 R 7710 0 R 7711 0 R 7712 0 R 7713 0 R 7714 0 R 7715 0 R 7716 0 R 7717 0 R 7718 0 R 7719  [...]
+>> endobj
+7636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 707.957 181.845 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa40eabb29ea4abe082c3a2e6dc820276) >>
+>> endobj
+7637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 680.266 154.727 691.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ade2531310fd7806c9e4f745cab145926) >>
+>> endobj
+7668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 652.948 176.505 663.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abc8ae851f2a0a6260d954b3bd8505249) >>
+>> endobj
+7669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 638.055 450.955 647.961]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa40eabb29ea4abe082c3a2e6dc820276) >>
+>> endobj
+7670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 613.924 169.013 624.828]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ef38aca6ca4ade62193017e6e794c94) >>
+>> endobj
+7671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 613.924 214.652 624.828]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 586.232 155.594 597.136]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a866f4ea2872ce75eecb0cddf8be815d7) >>
+>> endobj
+7673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.092 586.232 200.545 597.136]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1a8e5994aa0d6de25ef4806664b8486b) >>
+>> endobj
+7674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 516.724 179.254 527.628]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 516.724 196.689 527.628]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
+>> endobj
+7676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.026 516.724 301.275 527.628]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.929 516.724 380.687 527.628]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.121 516.724 481.099 527.628]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 489.033 179.254 499.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 489.033 194.467 499.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
+>> endobj
+7681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.804 489.033 299.054 499.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.708 489.033 378.465 499.937]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.9 489.033 478.877 499.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.246 461.342 180.069 472.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.382 461.342 203.857 472.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+7686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.824 461.342 310.074 472.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.179 461.342 429.114 472.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+7688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.603 449.386 260.987 460.29]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+7689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.611 449.386 332.369 460.29]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.803 449.386 432.781 460.29]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 421.695 179.254 432.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 421.695 202.228 432.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) >>
+>> endobj
+7693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.044 421.695 267.801 432.599]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 394.003 179.254 404.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 394.003 202.228 404.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e) >>
+>> endobj
+7696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.565 394.003 306.815 404.907]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.468 394.003 386.226 404.907]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.834 366.312 178.657 377.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.557 366.312 234.786 377.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
+>> endobj
+7700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.927 366.312 338.177 377.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.87 366.312 455.804 377.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+7702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.509 354.357 285.893 365.261]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+7703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.517 354.357 357.275 365.261]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.709 354.357 457.687 365.261]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 326.665 179.254 337.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 326.665 235.981 337.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) >>
+>> endobj
+7707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.797 326.665 301.554 337.569]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 298.974 179.254 309.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 298.974 235.981 309.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abb59cb64a8f7864eac1bb8253d164db0) >>
+>> endobj
+7710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.318 298.974 340.568 309.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.221 298.974 419.979 309.878]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 271.283 203.075 282.186]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+7713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 271.283 296.324 282.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad593d3aa49a632911d8d49c83b3f4985) >>
+>> endobj
+7714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 256.764 316.216 266.669]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 243.965 194.297 254.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a3bc88b2886b0b86865186d142e5ee414) >>
+>> endobj
+7716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 216.273 188.759 226.804]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aebb212a14f52ed934059925c1f5f2010) >>
+>> endobj
+7717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 188.208 202.776 199.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.515 188.208 278.601 199.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
+>> endobj
+7719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 160.517 202.776 171.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.515 160.517 312.354 171.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6804f93015ae6e1dc0c2e42e726380c4) >>
+>> endobj
+7721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 91.009 222.711 101.913]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.209 91.009 314.187 101.913]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.794 91.009 361.329 101.913]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+7724 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7728 0 obj <<
+/D [7726 0 R /XYZ 89 770.89 null]
+>> endobj
+7729 0 obj <<
+/D [7726 0 R /XYZ 90 721.073 null]
+>> endobj
+7730 0 obj <<
+/D [7726 0 R /XYZ 90 697.423 null]
+>> endobj
+7731 0 obj <<
+/D [7726 0 R /XYZ 90 669.732 null]
+>> endobj
+7732 0 obj <<
+/D [7726 0 R /XYZ 90 631.082 null]
+>> endobj
+7733 0 obj <<
+/D [7726 0 R /XYZ 90 603.39 null]
+>> endobj
+7734 0 obj <<
+/D [7726 0 R /XYZ 90 535.532 null]
+>> endobj
+7735 0 obj <<
+/D [7726 0 R /XYZ 90 438.853 null]
+>> endobj
+7736 0 obj <<
+/D [7726 0 R /XYZ 90 411.161 null]
+>> endobj
+7737 0 obj <<
+/D [7726 0 R /XYZ 90 343.823 null]
+>> endobj
+7738 0 obj <<
+/D [7726 0 R /XYZ 90 316.132 null]
+>> endobj
+7739 0 obj <<
+/D [7726 0 R /XYZ 90 288.44 null]
+>> endobj
+7740 0 obj <<
+/D [7726 0 R /XYZ 90 260.749 null]
+>> endobj
+7741 0 obj <<
+/D [7726 0 R /XYZ 90 234.129 null]
+>> endobj
+7742 0 obj <<
+/D [7726 0 R /XYZ 90 206.437 null]
+>> endobj
+7743 0 obj <<
+/D [7726 0 R /XYZ 90 177.674 null]
+>> endobj
+7744 0 obj <<
+/D [7726 0 R /XYZ 90 109.816 null]
+>> endobj
+7725 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F91 766 0 R /F32 772 0 R /F38 3411 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7835 0 obj <<
+/Length 1719      
+/Filter /FlateDecode
+>>
+stream
+x��ZQs�8~���^rx�V$!!�i�pi�i�����S���$Lmp7���[��8��6n/i�d�V��o�غ������io�H8�Dҥ�uzaIl	&w�_`�ٔ�����-���.���=>=<>=�}�����
�.l�BG³����Gl�����#=�:�Z�:�;�Nz���#�uS��$�c!��‚�j�g*�(��y4��8Js{J��G.�)�ր2ĘY���q�)����]�Y�R�y�'�Ŧs���*)��T���-�"�x0!G�1��|Y�l�1��,�4K�?-�1������}>@w�3��Y�h��#R��"��Qz���D ��RV�����I��:�v�^�haX}����'-̒���,�i�҃ Ik at 8"&Vo��lnB���'��g"�بm� �2
+��3�hŗ>�aо��O ��ej/�
�ᡛ'������
�p�ɵ?KK8��,��
+"7�Ȓ6�\Z��:̮�� ��J�m�� YL{8�C:
�lt�p�
�=N�=	#��lx��ܕ ������f��4�X���{�-����U��Y�
+a'�6��p��
��I6Jڔ����U� �F�����m�.�y8�
_x7��y�����^ѧ�
Ci?ղ���*;�m�3�2m���I6 �n�irh��]�V�<+����<i��0�V"

� 
ĺ�B{�&+��U7 k_jKi� )��1��|>�?���07z��N�(�z�@��p$��B%*�-\�b��
�
+���j�N%���T]���M�
TK�$Zɫ%�	,��k^wTh�8�&���
+���
+`�O0 @k{du�9A;�������
+��8��ǔ��8���)�D���$N�5�C
l -�	-���ڢ���V��+�_UT
��'���P���M.-�.�t_�\��������
�5[y�m�O
�]��"��\�
0��x��)��g� B��vζ�s��^e�$j<}u0"/�E�d��N���KJ����\�����mт��9�@
u7>�
S����?̘K��I9;l;�D2Ķ
��v�z��n�6C��H,Vr?�Q�!�I��QI�0��/��Tә��,�pdM�
+�Xe��BbI���'*M�3�S��>�{���
,�f^)�ߙ+X�з��w�D��pR�� L3v�#���J-d�t�����.;*
��;�e�.]cR,�C���j��	^!�pd
c�>��TT��œp�+�mӍ)u����~�n�R`/鳼x�Zs{�p�8��~�Q��w�ݵ���QF��a�� L��tOg�L�ե��W䛍
+Y��pc��ˏ��
Ж�m
)�W�;WٵRQ�u%�����+5�5]Wr�����{��" 
���ކ�C0T���q�D>:�q;i������NyV�����Ix�ӎ���
�o�
g��u
�8��w(�P��;�3�6�%�;f��YB�� �ΰ1v���
Cw�����D&���}/d�<5O�@�Q'A9�&(�f�Ef

%��2�@N;A-ʹ (����g�ױ:�T��J� ��3�.� ߑ)�~u�R$��l��ym @z���{a"�;��
c
쿚:֋�-�
@�`�0��
�[[������H�2�޽)��*��Ϲ�V�>�'
����G%iu\O�%�� A���}����¶O���o������]e�l��>�LUt���t�k��DXT!�(��4.��#x8ͯV�~�
+endstream
+endobj
+7834 0 obj <<
+/Type /Page
+/Contents 7835 0 R
+/Resources 7833 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7745 0 R
+/Annots [ 7750 0 R 7751 0 R 7752 0 R 7753 0 R 7754 0 R 7755 0 R 7756 0 R 7757 0 R 7758 0 R 7759 0 R 7760 0 R 7761 0 R 7762 0 R 7763 0 R 7764 0 R 7765 0 R 7766 0 R 7767 0 R 7768 0 R 7769 0 R 7770 0 R 7771 0 R 7772 0 R 7773 0 R 7774 0 R 7839 0 R 7775 0 R 7776 0 R 7777 0 R 7778 0 R 7779 0 R 7780 0 R 7781 0 R 7782 0 R 7783 0 R 7784 0 R 7785 0 R 7786 0 R 7787 0 R 7788 0 R 7789 0 R 7790 0 R 7791 0 R 7842 0 R 7792 0 R 7793 0 R 7794 0 R 7795 0 R 7796 0 R 7797 0 R 7798 0 R 7799 0 R 7800 0 R 7801  [...]
+>> endobj
+7750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 657.701 226.034 668.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a303b4ed4262469c1834228e0f88dba74) >>
+>> endobj
+7751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 657.701 362.999 668.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 629.374 156.281 640.278]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) >>
+>> endobj
+7753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 629.374 201.92 640.278]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.131 629.374 261.954 640.278]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 601.047 155.733 611.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.004 601.047 172.94 611.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5c96c17c3224a111a56381a75f564896) >>
+>> endobj
+7757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.822 601.047 277.071 611.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.315 601.047 356.073 611.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.28 601.047 501.627 611.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 586.21 411.357 596.115]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
+>> endobj
+7761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 572.72 155.733 583.624]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.23 572.72 170.945 583.624]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2673a95cb7d41f3c6078024874d1f8b1) >>
+>> endobj
+7763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.28 572.72 275.53 583.624]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.182 572.72 354.939 583.624]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.373 572.72 500.72 583.624]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 557.883 409.725 567.788]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
+>> endobj
+7767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 544.393 155.733 555.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.62 544.393 179.096 555.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a9518a0d513563a1a7c144f35d639695f) >>
+>> endobj
+7769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.212 544.393 284.461 555.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.141 544.393 403.076 555.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+7771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.033 532.438 234.417 543.341]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+7772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.041 532.438 305.799 543.341]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.233 532.438 451.58 543.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.527 517.601 513.996 527.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+7839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 506.902 171.671 516.547]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+7775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 493.152 155.733 504.056]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 493.152 178.707 504.056]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_afed6e254937adbecd53072747e51cb3f) >>
+>> endobj
+7777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.522 493.152 244.28 504.056]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 478.315 309.671 488.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) >>
+>> endobj
+7779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 464.825 155.733 475.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 464.825 178.707 475.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aab2bceb460b09e14922ef0ad8011e74b) >>
+>> endobj
+7781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.044 464.825 283.293 475.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.947 464.825 362.705 475.729]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 449.988 416.342 459.893]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e) >>
+>> endobj
+7784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 436.498 155.733 447.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.634 436.498 211.862 447.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a76769b829453746113dd32f9fe880c9d) >>
+>> endobj
+7786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.004 436.498 315.253 447.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.947 436.498 432.881 447.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+7788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.603 424.543 260.987 435.446]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+7789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.611 424.543 332.369 435.446]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.803 424.543 478.15 435.446]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) >>
+>> endobj
+7791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.385 409.706 513.996 419.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
+>> endobj
+7842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 398.747 201.717 408.652]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
+>> endobj
+7792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 385.257 155.733 396.161]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 385.257 212.46 396.161]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) >>
+>> endobj
+7794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.275 385.257 278.033 396.161]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 370.42 340.219 380.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) >>
+>> endobj
+7796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 356.93 155.733 367.834]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 356.93 212.46 367.834]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) >>
+>> endobj
+7798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.797 356.93 317.047 367.834]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.7 356.93 396.458 367.834]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 342.093 446.891 351.998]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abb59cb64a8f7864eac1bb8253d164db0) >>
+>> endobj
+7801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 328.603 180.54 339.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad7552a414d66f92897d12767579fa3ca) >>
+>> endobj
+7802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 328.603 249.7 339.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.433 328.603 333.256 339.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 300.276 178.239 311.18]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) >>
+>> endobj
+7805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 300.276 247.398 311.18]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.132 300.276 330.954 311.18]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 259.994 245.522 270.898]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac5a61f5b91d0db37a1a2fa6c843a26a8) >>
+>> endobj
+7808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 259.994 325.229 270.898]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 248.038 155.733 258.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 248.038 239.289 258.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.853 248.038 316.409 258.942]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 207.756 245.522 218.66]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4f591f8dde74ad99d0fb16a8c7e4a59c) >>
+>> endobj
+7813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 207.756 325.229 218.66]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 195.801 155.733 206.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 195.801 239.289 206.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.853 195.801 316.409 206.705]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 155.519 245.522 166.423]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1ad16d1e8a395685314dedffe17fbb8c) >>
+>> endobj
+7818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 155.519 325.229 166.423]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 143.564 155.733 154.468]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.793 143.564 238.616 154.468]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.747 143.564 315.303 154.468]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.92 103.282 243.605 114.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_abed1f1d1ff610a4d56c514a7b75509ab) >>
+>> endobj
+7823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.226 103.282 323.607 114.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.327 155.733 102.23]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 91.327 239.289 102.23]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.853 91.327 316.409 102.23]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7832 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7836 0 obj <<
+/D [7834 0 R /XYZ 89 770.89 null]
+>> endobj
+7837 0 obj <<
+/D [7834 0 R /XYZ 90 704.189 null]
+>> endobj
+7838 0 obj <<
+/D [7834 0 R /XYZ 90 561.868 null]
+>> endobj
+7840 0 obj <<
+/D [7834 0 R /XYZ 90 482.3 null]
+>> endobj
+7841 0 obj <<
+/D [7834 0 R /XYZ 90 453.973 null]
+>> endobj
+7843 0 obj <<
+/D [7834 0 R /XYZ 90 374.405 null]
+>> endobj
+7833 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7947 0 obj <<
+/Length 1587      
+/Filter /FlateDecode
+>>
+stream
+x��[Ks�6��W�����` ă�$=4I3M��M�S���ls"�
+E5ֿ�oZI'�+%�H��X`����Al\�x5��|t�
��
+���p�!����_s�I0b���yflz�қ�Y��b{��7=�/"/�N&�T�"/#kL96�/��:�|�.Ud�T�L�:ۥ�IA��ף��O#�I'��t��r��6���k#�u�ω��`Ԇ��v��g��MWl"X f;�$����R�
�wK�H�JLt1�BC"
��j��Jw8��v+rT"Ɯ\�i*Q�$wd�i�R��T)*��&�N��~�q 醁�#�8v���b��n��!J
� ��<���Ef��;�ʀ�jd�3L�H�b�ʋ�s
{�)�ҷ�y�P�z��
��i>�V��:v�|��fy�PG
�RΚbٔ�BZq(A��\"��c
�/ob̋��g�ŸY���TOm(B�h�0*xY,�
i�x��c�CQZ��̏[jO?���Uq*ۮhk	�l��&�s?��������JjM��\	�
+��"�!c�v�L-}
.W�Xe�_gѬ6��?W^`e������P�g���O�:���"�nR��,$�	/�7�wB�-
��(h�*�E����
L�#��*��b���uNi �_B�Hb�J(a�w	Eʻ�Dv;��F*	F�&�Y���"*2B��	d�u
+x��P@	Jf��R%F� �r����B���E
+E��f#ⶲ��,�
�����ǘ~���-��Cv��H0�C?*�;�pH~z$�C?z��Ш K����HB&�����6)̲��ٸ���T\�!ҥH��Jb�1r�L/iHv���
�R�7!	�R�

b�o�bb=*&w �C"-1��א��EZ�� -~w�r�H��i9G[i�v�Dlq���B��Сv;T�s��u<�L�u
)o���=��U��
�a	.���Ӷi`8��H3K�T�_� �IB@����
ɱ
Ks�1��&���
+$4�$h�;���iR�{��<���ߋ�~"�d�ƹ�����7�H�j�P�.�Q��
+b/ޣb�L���A(�@{�\�~��I8� ����.
јJ
+d�.-�M]��|�dG��'�d�i�,b^�(}&������m�E_m�n at z��=F<6�ͻ���αV��#�؃Bd��E��Dj�*�T�Tv�m���6H�"��l������2��\�=�]ѯe
{�(�p�Qg`/ێ{�ˀi�ۭV�Ϟ}�u,�p�����k�wܮ�
q4�;����N�8$:O=�� ��'��'�l餡�Hg��Rv(��t�)sZ�wt{�����'�o��nq��Z�^�q
��͞~�C��?	� ��}�}�C�CN�G<%2�ʐ*ǜ*���
g>����P*��Ⱦ�tC�
`�
��w�5-A�����kZ�kY��PP�$� ��4?�}vv�^��Vя�f���/�x
��R�W�XE��a�'Ad)G�
�@�U�#�t����w���>.�1���u
�&''���
+��,\�F�aY��e��2�2�� �\&{�(�-ǒc���9 �F�HI��uҘw��8�mi/B �|�?~)�
+endstream
+endobj
+7946 0 obj <<
+/Type /Page
+/Contents 7947 0 R
+/Resources 7945 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7745 0 R
+/Annots [ 7827 0 R 7828 0 R 7829 0 R 7830 0 R 7831 0 R 7856 0 R 7857 0 R 7858 0 R 7859 0 R 7860 0 R 7861 0 R 7862 0 R 7863 0 R 7949 0 R 7864 0 R 7865 0 R 7866 0 R 7867 0 R 7868 0 R 7950 0 R 7869 0 R 7870 0 R 7871 0 R 7872 0 R 7873 0 R 7951 0 R 7874 0 R 7875 0 R 7876 0 R 7877 0 R 7878 0 R 7879 0 R 7880 0 R 7881 0 R 7882 0 R 7883 0 R 7884 0 R 7885 0 R 7886 0 R 7887 0 R 7888 0 R 7889 0 R 7890 0 R 7891 0 R 7892 0 R 7893 0 R 7894 0 R 7895 0 R 7896 0 R 7897 0 R 7898 0 R 7899 0 R 7900 0 R 7952  [...]
+>> endobj
+7827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 696.002 245.522 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a4f591f8dde74ad99d0fb16a8c7e4a59c) >>
+>> endobj
+7828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 696.002 325.229 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.047 155.733 694.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 684.047 239.289 694.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.853 684.047 316.409 694.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.92 644.349 243.605 655.253]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a475ead5848d02d5c879bb96f22ce1cc5) >>
+>> endobj
+7857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.226 644.349 323.607 655.253]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 632.394 155.733 643.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.793 632.394 238.616 643.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.747 632.394 315.303 643.298]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 592.697 239.568 603.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) >>
+>> endobj
+7862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.786 592.697 317.166 603.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.775 592.697 513.996 603.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 580.742 139.135 591.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.869 580.742 222.691 591.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.255 580.742 299.812 591.646]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 541.045 239.568 551.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a37eddcfd7d63573ae2bf02e2f5ed6d50) >>
+>> endobj
+7867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.786 541.045 317.166 551.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.775 541.045 513.996 551.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 529.089 139.135 539.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.869 529.089 222.691 539.993]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.255 529.089 299.812 539.993]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 489.392 239.568 500.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad006db44540ea4786f611e882bfe8da5) >>
+>> endobj
+7872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.786 489.392 317.166 500.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.775 489.392 513.996 500.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 477.437 139.135 488.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.869 477.437 222.691 488.341]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.255 477.437 299.812 488.341]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 449.695 226.034 460.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a75190def344d4c1ba6c59a6f0fcf7420) >>
+>> endobj
+7877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 449.695 388.214 460.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) >>
+>> endobj
+7878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 421.953 155.733 432.857]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 421.953 173.167 432.857]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a95bad70fc4276b46478ff7100cbce347) >>
+>> endobj
+7880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.505 421.953 277.754 432.857]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.408 421.953 357.165 432.857]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 409.078 155.733 419.982]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 409.078 170.946 419.982]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a1b5063a9931b8a9d4a0db756c0b1c9e6) >>
+>> endobj
+7884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.283 409.078 275.533 419.982]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.186 409.078 354.944 419.982]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 396.203 155.733 407.107]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.405 396.203 178.881 407.107]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a43a020d3bbe2b93b7ffa78a1c817b647) >>
+>> endobj
+7888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.566 396.203 283.816 407.107]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.239 396.203 513.996 407.107]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 371.373 155.733 382.277]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 371.373 178.707 382.277]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_afed6e254937adbecd53072747e51cb3f) >>
+>> endobj
+7892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.522 371.373 244.28 382.277]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 358.498 155.733 369.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 358.498 178.707 369.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_aab2bceb460b09e14922ef0ad8011e74b) >>
+>> endobj
+7895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.044 358.498 283.293 369.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.947 358.498 362.705 369.402]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 345.624 155.733 356.527]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.259 345.624 212.488 356.527]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a974166a1fe54f72e254c8f02687084e6) >>
+>> endobj
+7899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.881 345.624 317.131 356.527]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.896 345.624 513.996 356.527]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 334.042 151.877 344.572]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 320.794 155.733 331.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 320.794 212.46 331.698]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) >>
+>> endobj
+7903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.275 320.794 278.033 331.698]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 307.919 155.733 318.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.231 307.919 212.46 318.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) >>
+>> endobj
+7906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.797 307.919 317.047 318.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+7907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.7 307.919 396.458 318.823]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+7908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 295.044 180.54 305.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad7552a414d66f92897d12767579fa3ca) >>
+>> endobj
+7909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 295.044 249.7 305.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.433 295.044 333.256 305.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 282.169 178.239 293.073]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) >>
+>> endobj
+7912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 282.169 247.398 293.073]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.132 282.169 330.954 293.073]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 257.339 245.522 268.243]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af4f9b4584e455154e3f201876af1848f) >>
+>> endobj
+7915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 257.339 325.229 268.243]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 245.384 155.733 256.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.606 245.384 243.428 256.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.653 245.384 348.21 256.288]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 208.599 245.522 219.503]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a855eb1638a9b23f78fac816e8c9f7a05) >>
+>> endobj
+7920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 208.599 325.229 219.503]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 196.644 155.733 207.548]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 196.644 239.289 207.548]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.375 196.644 339.931 207.548]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.625 171.814 245.522 182.718]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a78d14a45bade2c29f565fe13390ab13c) >>
+>> endobj
+7925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.848 171.814 325.229 182.718]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 159.859 155.733 170.763]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 159.859 239.289 170.763]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.375 159.859 339.931 170.763]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.92 135.029 243.605 145.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a787318df4682a2571d9cad8fc37c8fd6) >>
+>> endobj
+7930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.226 135.029 323.607 145.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 123.073 155.733 133.977]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.606 123.073 243.428 133.977]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.653 123.073 348.21 133.977]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.92 86.288 243.605 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ad7576379843ab0fb9a33484bd4d68e71) >>
+>> endobj
+7935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.226 86.288 323.607 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 155.733 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 74.333 239.289 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.375 74.333 339.931 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7944 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7948 0 obj <<
+/D [7946 0 R /XYZ 89 770.89 null]
+>> endobj
+7945 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F67 3022 0 R /F42 539 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+7992 0 obj <<
+/Length 2831      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۶~�_���:ǂ  ��9��8I]wko�;gÕ�+�)��כ_� �I����д~YR�`0��o.���̈́N��������O
1I�L.�'�N�0D&�k1y�BO��y�M�I`�~�ח�^^�ƹ�gg��L�	�
$Qz2_����N0��n����'"��\M^���Yh_���db4!��b�0�x��m�,sk1�2\��HL#mmכUZ[\��nzt�"B���b�)!R��������Ng����TӨ�*8(�Y�m˴;�L)'���HFJOxU�p&�dyT������Lp��|�-l�_.��N�L�*����o���EO�v�n�hd�/��+[�4��SE�z�Y)&TȆ«��t&���}�m�h7�</V�|�dt��
�b`�
S�p�oʩ�Q�i^�U}��3.
aR
����L���!Z������2����M���U��Y~s�}6�o��`_6��y�����N��z�%�%F)a���L�M��hu��o)���������8�� eH"�=<�4�/�b5�q'��'����Z���1�"&*QC3
���["�$
��0��Q��S���؂y�V���΋{��

[�ϰ�k��'���j�������g&��Ɩ������+j�8j`��4�0��V���-:K��ว}�*�
Uv''�(����a�D�m'�)����Q"a�d:}o�4[��%�𫚗٦Ί|?�t|��
�
��6]e�
�-Ӿ�7E������*�mi{��y'pf�$qp�����_vް��|i^
>C�Y�����jULc݂?>
�hT
'D+}���NQ!и�V�N���+O�{	�q[���)�:�n<���8�
+�5�K�k	(�#<��2��<�IT���������z�a¡r�[
�x�L�M1�|�/vA�����
N�\8�J�߄%M���	�� s���N�a`{.ٽl��3=%Ҵg/��a'���_���$��æg�~��ap��h���1�n~��}}3	�[ʠZ
< nj�;Uq(5f���<`x
�C�љ�pYu�2TW���Pw�9�I1�1��B�X���"�G����6N8�LLc�pz�s�؟^
=2
Ru%p�}5JP�x�P�X=����AHzƈ#:�)8�6�C=�YDt�tx�
� �i
�I8���c� �K�~b�RE���
+���0�H�T\Kpi��@�,�
�;�3@!O ���@�?
��(8z�I�4(8�(hL�@!�H]���X��E��ۥ-�U�&n�;�:ն{M�ږ��lm�
+���ڤ��拇M
[�PW�ӇpY=
�\J���

yߎh}p�GG�����
K�YRK�AH9��pt
�a	�Q��M�
'/j�ߜ��Y�r��Ū�q]��F�-
NQ���P�t+���ʖ��w}�d�LI�����mVd��nJ[ټN���y�Oa����㟏��y��[�E��^߃%�UoZ���<�l��M�@�e�
˅-����(٬m�z�(.�h�5�����
}K��
B_�9��>�A$`-Ŷ����
ޡ����s��]U���^�m�>��SCD�����GJk���E�į�3�D�sX�����H�
+���.�6ahpz�
�%�ѭ�ͭw*���`��va�;z
+Wga���ȱ`Nvo���w7n
>�'⮂uq��c��!!+v����
+�2�=��	��Ϗ3��&��GH4��X/oYgs{LP����TDuw�d:�TE�,�z��?���غph���Ҿ�z�/�_�.��� Ne���8ʵ���|��8m!���>��KV�'
+�YTOY��K�VNh��]N�ҿ�����.*���?xn�0�}���a�_�W<�`>��"ܯÒ�ZeWeZf�(�LGNo
H�6V�!��}rE�:4?S���P����f�pW��EGm,�?H!?=K���Lp�n���}|����ƙ���D���;�L7�՝��m�͋˦pת~�z����~uQz����ޢECw}58�ϰ.h�Q�۫�
d�Hۜ�̤�<
� S�l�r��
�T�Y�/
%��!�J9�����'¹>S|H����C�#1�c���Cz)��
�KRO���P"��Yx:�+� ���5������u{��
��P1�PP�&Q�aB5�
��º
Ⓨ��j�_LWh�aMj�=�
�ùFS�>��T�D/<�H��XZc�@A��՝�~4�����h�,��0u(�ź@�bX#8���q�F���E��� ��V��g�7[&�Xv3ZC�
+�Sptd�t)�C�
g��º�
�]X��t�{G��	'
l
+w���<���^c:B���%
��3(h�nG��z<
��Jvčc��uS�
��"��!��������] ;�S-�x�2��k�$h1ãb>Kl�һ��꨿tSh����
��
	�C{�g����g�b�E�P�t��	k�h��EkO'mV/�~g���	v,��&�>O����zu
����ASpQ��vdI�
+$\4��0�\f�����!�m��3Kh�ձ��w
mAx7�)w߽�<��/�v�Iwk޴���GC�뫰z| �������P]�n�qH�����J��`(��I�&����h��e{�c��!iܒ����k�S�嵷P("��_���j��M���d�&
<�i�'���c7~��a���oGI���M�%M����/��ߡ�~�w�\I�m`���bw}���|1���6�������޸=�%�
T˺�<~��j{	��@����-6��.��!��
׮� ��7��l
+endstream
+endobj
+7991 0 obj <<
+/Type /Page
+/Contents 7992 0 R
+/Resources 7990 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7745 0 R
+/Annots [ 7939 0 R 7940 0 R 7941 0 R 7942 0 R 7943 0 R 7967 0 R 7968 0 R 7969 0 R 7994 0 R 7970 0 R 7971 0 R 7972 0 R 7973 0 R 7974 0 R 7995 0 R 7975 0 R 7976 0 R 7977 0 R 7978 0 R 7979 0 R 7996 0 R 7980 0 R 7981 0 R 7982 0 R 7983 0 R 7984 0 R 7985 0 R 7986 0 R 7989 0 R ]
+>> endobj
+7939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.92 696.002 243.605 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a42b10b56cb7a582076a2d279ae07cf85) >>
+>> endobj
+7940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.226 696.002 323.607 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.047 155.733 694.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 684.047 239.289 694.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.375 684.047 339.931 694.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 659.282 239.568 670.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a39da685d64f5bc693cfe8869ee4fe9bc) >>
+>> endobj
+7968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.786 659.282 317.166 670.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.775 659.282 513.996 670.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 647.327 139.135 658.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.736 647.327 222.559 658.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.512 647.327 323.068 658.231]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 622.562 239.568 633.466]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a137b1f86858576e71034aec1ce54fd65) >>
+>> endobj
+7973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.786 622.562 317.166 633.466]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.775 622.562 513.996 633.466]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.607 139.135 621.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.869 610.607 222.691 621.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.777 610.607 323.333 621.511]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 585.842 239.568 596.746]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac240ffbfd08a91635aada843229f6814) >>
+>> endobj
+7978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.786 585.842 317.166 596.746]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+7979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.775 585.842 513.996 596.746]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 573.887 139.135 584.791]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.869 573.887 222.691 584.791]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.777 573.887 323.333 584.791]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) >>
+>> endobj
+7982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 561.077 156.281 571.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) >>
+>> endobj
+7983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 561.077 201.92 571.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.131 561.077 261.954 571.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 487.036 219.642 497.94]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+7986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.41 307.206 353.665 338.718]
+/A << /S /GoTo /D (index_representation) >>
+>> endobj
+7989 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+7993 0 obj <<
+/D [7991 0 R /XYZ 89 770.89 null]
+>> endobj
+7997 0 obj <<
+/D [7991 0 R /XYZ 90 547.631 null]
+>> endobj
+7990 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F91 766 0 R /F102 863 0 R /F8 802 0 R /F7 803 0 R /F10 773 0 R /F13 835 0 R /F6 862 0 R /F9 880 0 R /F12 940 0 R /F24 537 0 R /F94 771 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8031 0 obj <<
+/Length 2235      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�8~ϯ�m�n[�
隇��驹�vg�z�Rؖj0�O���s�$0`
����V��,

]�w�@�{�z�]}}{u�F	/&q�C�v���S2&A���Q"�d�(���	�~R����N�"�>�E�����ʤ���|�s]&uQN�<������l�^�r�"_�s
�D�c��x���W��^}�b�!�1����ț��>�F�t��Q"��{4D+Or��{��+���>	��w˜uNńR�)&H,�!�}JV�
��y�3��!��7!�0aQ4���*,��mϺ,�����L�{�5/np�7�I�����>�4w�i�`[����:-r����z��D�
Q���%�C�HL[����F�`K44�Q&2O`��O��wY
+��$��
�!������j��us���Q��Lv�%F���]�fT�j���;��
+���JD�c*N	3�G�-�
��L���#���Wnl�@C���φ{
蓝=��m��' `�GNJ��ā���g>\
�F/��dVLX�����+��_#X�̼������.W�U,]�%df�Ii'id��.ue�d�S�x^8^���.���dp	j����`��s���,�'���C��nԭJV����c	J�R��ⶏ�
�I_��~�uʣAOy�"^
�(��4w���"w
+��K6�
�)dz*��I=`��J;�@�
���^�/����3vЋ	#��ݚ7��Hz��V����I��
I��%O5����M��v�F�p��ܡ��]�����{�-O�>
�
�j�4uO{9h��ʴ��]x_h39W���mo���t�����v[�8�&�t�-c ����GnC�ݫ�
+���Ŀ
��IV������i̓�w�őr��.0
G�,Vg[@r��6���pOKŋji{�u���m�Fyw)	�vꢣ�~�{	d3��S�=�B1mC����$�����bG��ة
8ꖥQ
��HZ��9�ݎ��CX���J�^(+An�w�K)���R��
��R��r����n��'ٵ
C�Ƭ[S$j�ڸWk��n�b]"`8����mo.?k�A;e��gjo���J5�i֘�Y��&�6�Ξl��:��/��.��ӈ�$���P� 1��}�J��̶�0���W
wu���tT�e
���K)4��=}ރ����tp�!PҮ
R4aϞ��q�}�
p5żYJv��X�e �F�1����(��,Y0
+�3NY���	o�ww���%Y��\��b�"��Dq��)�&���s�
�	����
�DXl�~��p
Ք���A.u^wBg*r0��v�B8��c&"�kLD�cr���BNT���Z��U��a���Y��H3.X�{�Q��3v�Y=�7���f&�8֠���:N�%�˞�4�uF$re
����']b�"a{7Hn��(��zr�A��0GO�

�9����݋R~�!\�N�_b�э�T/+Һ7/��?o����h	P
+e��S�߬�#�a��&�T��]U�D�6��d0�C�‡��\�� ̈���eS��2�ȗŬ
+ғT�ets���ލ�%����]��j���ڟsʮ/wSg���WB�1�F^�6

N�!A�A���
+)m�FĔX㦔.S�B��f�Sؾ^�ݎ�8ьeX.Ů���.��^[N�~�*�5��0��K�)���Q[
 �q_֥�Rڸ�)��Ӆ�ڽɜõE�lӺ�rX
qV�0���xL{X׹b$��Q]��w\���"5�JZ%�ﳝ-�;��3��I�K��ԍ��������ٟ^����tۙ�_gsŦ��{ʽ��Jte�
ҥS02s�J/7�r
��'6������@�s镝�{������F��az��P4��V[*�ZL�ʙ�PLjʅ�,�E�'����
+�o��9
�9�F�'�ܼ5��v<g�XFS�I�DZ
+] ��
+�X("�.�ؽ��z/g�Nٱ��>
W[�

`pr�P\�~���;`/Q�dG���xQ#߼_� ��
F{��
l�C�yq��&D쿿}����ˌ��zqH��ϭVW�t1ؙPv���4���k�5
� ���1�� P �a(�AR� ���Էo���T���$|W��9�7If�x���P��za�RG�u������[V��߽�����n;LQ"��>>�����z���t~O�ŪwóĄ��ڵ!Ϊ(��йB㟓�ۤ�.� v��m��~�8�2e^��_�m��������)�w-�	g4��
+endstream
+endobj
+8030 0 obj <<
+/Type /Page
+/Contents 8031 0 R
+/Resources 8029 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7745 0 R
+/Annots [ 7987 0 R 7988 0 R 8002 0 R 8003 0 R 8004 0 R 8005 0 R 8006 0 R 8007 0 R 8008 0 R 8009 0 R 8010 0 R 8011 0 R 8012 0 R 8013 0 R 8014 0 R 8015 0 R 8016 0 R 8017 0 R 8018 0 R 8019 0 R 8020 0 R 8021 0 R 8022 0 R 8023 0 R 8024 0 R 8025 0 R 8028 0 R ]
+>> endobj
+7987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 673.868 146.368 681.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+7988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 673.868 184.027 681.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
+>> endobj
+8002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 621.985 146.368 629.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 621.985 184.027 629.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
+>> endobj
+8004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 582.364 146.368 589.583]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 582.364 184.027 589.583]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
+>> endobj
+8006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 519.488 146.368 527.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 519.488 179.843 527.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
+>> endobj
+8008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 421.618 146.368 429.144]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 421.618 188.212 429.144]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 381.69 146.368 389.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 381.69 188.212 389.216]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 341.762 146.368 349.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 341.762 213.317 349.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 333.792 146.368 341.318]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.141 333.792 230.055 341.318]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 293.864 146.368 301.39]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 293.864 213.317 301.39]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 230.025 146.368 237.551]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 230.025 297.003 237.551]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
+>> endobj
+8020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 214.085 146.368 221.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.141 214.085 230.055 221.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 139.255 146.368 146.781]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 139.255 188.212 146.781]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 75.416 146.368 82.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 75.416 188.212 82.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8028 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8032 0 obj <<
+/D [8030 0 R /XYZ 89 770.89 null]
+>> endobj
+8029 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F75 562 0 R /F102 863 0 R /F7 803 0 R /F32 772 0 R /F99 864 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8047 0 obj <<
+/Length 2510      
+/Filter /FlateDecode
+>>
+stream
+xڵZ_�۶�O��K��� A�rܙ�9;N
�j_��8�
��q"�2I�>w�ݻ�(R�q�H��b���킁�����Wg��b�%$�X�]�zI��aBD_s��D0���g�G��$�Q����WW��ު������g��"Ab�e��w��
����}�D+/d
�K���?�W�(pd�ALbʽ�RB)N��v2����·y1a��P4U�
E��5PP�3����������붨�����Ï%�k�R�	��
�A�:O�$q�xS�P�(�ŧt�^���I_���-����{Y5�Z1	#]e��{j�u�����P��l�,E��o��qB��o�
�<W
J��y�47����
��T�Q��n��ޑ&��*���d-�2� tEI".�vSfj�d�A�gj_�}��i�������u*Q��DU�ϟр���(	n�6C�P�Dʮ�	����[ jعL�cj����3i��!I$;� ��
�0b�^D��KE#���ID��^!


F�˽�CŐ���IH�f�{3�*��T
iz�
+�Qo&�D�=������cܨ&��Q�
G� ���f"�L��<�˼N�Au̼w�( ���ӷ;��B���a���2Jx(`z˜�C�=!�RxN�'��[|`�7N�|t莾�f���џ��<
ٟ)�! �TG�..9N�X���:��"�,Sӑ���n{��VPU.ﵑj�%㒺�.U��
+�j�if���*/~�����#�AI1�h���ƌ��~(�Xd��K
�0����/0���bxƤ��Xep�v
g3��k����d�� 
.Q"����3
�y�*��e�u
ʕ�A*'������`
x��>ᔀ#�ŏ`m�]�	ob��m�q��8`��4�Wy{W���#^\��-Z:x"�HWEiHS|,:鰵���m�������O��Y��S��U��=U��
��/Z# �ۈst�g�V
���un��|�����.7泺�
;��_�� Ϫ�V��p��R|UH}!��R
�<��D}�Z�l��}E��E���i�����^��Y�7�"O�;lm`.K9P6+�j���!| JBP�����Zy�	�
�Xб#���A���G�]�;
�����E��y3�0Ti�u0I���Dơ�I��C�#�8���(�
��ֱ?S��}<���Eg6��JC�
2�o`��‚`(w'r���(��K<�P=
+T�
��A^
+L
*�ɉA�owC\P�[Џ�{Xw[=�%� �v��`#2Аlm�N�a;�r�.��at�\�s�p��S�%<
ó=��f�a�
��r�rb2F(O
�dŐ� Q�%�ߪ��|�5�~�yMv��s��
�2q��p�X�Mǁ������F�}�'�1��NrYCE�Q)��p&*���~��GT�~�Ϗ��1d��dAI� F��
1�"��
+�p0N.f��@�ᄈ�P�Wul#�~o�7�x������7c�_C5�}��|�آ��@/K���ŧu
ǫN 4�A��g�P�!����n�ӵ�J#�

�͢�Fa���-F��_�fRG�n-m�#�I�t�A��;?�DHxa馐��� ��"��F!��?ӺH�h褘ƄF�8���Y
+M"E��4Σ����ڒ٥y�K��_��{CW�S_k�5�I�����t`
�=��9-�
;�z1`��=WpS=�ʰM
�����V��k��n��~����
+⭭,v)��0�/���#��L� �01�m=�W�2a�_Z�XӏI$��>�`�
L\� P ��$X�vu���,M"YݴiQ���N��6�z���dw�6a��Y�6J�I�/����J|��w�Uta@�(������`��ǐlg�U�#�ػX6(^
�WMrt��
�
�M�Eߩ�u�+��2���5�j(�;��e|�M����F���ؘ�"6K���H�����[�>r�@!�-�2�x��y �w�Y��T:i�p�!� ڍ�+��j
�! neAn?*	
�+�'`�y٘
�;��ɀ��	�[���oݰ$�c�v�\���mr]}pQg+H
�pۺݻ��9�Ŕ�>��@G���c�)�l��%_��Z��E9���J�p�[h��ʠ�lS��=�+� �0��B��'G�&op/]#���K�.��\�J�/����.������N���̩_M���E��d�OU�H����� M��!�9pq�,{չ���]��R�G�t�
�	/_��8�:�Ww�w��eM�\/!y ;\��L
_�>�(L|~�����""�%���I$�#� g��������*Ε@>P
�^G4��{�y����_�\\�JJ"y�@��W�}w@� �1~��@�W��?ރ�4���t�u�
c�_���c̶��o�eho���(īi���I�
+��|�/�6y�U�5*�%-7��Js3�t0PB!%�*r����(���G$���3�+�ܵ�zv~~�Y4y���p5����$�㮳�f�*�uxM��M����=G�
+endstream
+endobj
+8046 0 obj <<
+/Type /Page
+/Contents 8047 0 R
+/Resources 8045 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 7745 0 R
+/Annots [ 8026 0 R 8027 0 R 8033 0 R 8034 0 R 8035 0 R 8036 0 R 8037 0 R 8038 0 R 8039 0 R 8040 0 R 8041 0 R 8042 0 R 8044 0 R ]
+>> endobj
+8026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 636.072 146.368 643.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 636.072 221.686 643.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
+>> endobj
+8033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 587.135 146.368 594.661]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.878 587.135 363.952 594.661]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6804f93015ae6e1dc0c2e42e726380c4) >>
+>> endobj
+8035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 571.195 146.368 578.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.615 571.195 297.003 578.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
+>> endobj
+8037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.007 406.776 196.58 414.302]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.086 390.836 154.737 398.362]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.85 390.836 234.239 398.362]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) >>
+>> endobj
+8040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 321.973 146.368 329.5]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) >>
+>> endobj
+8041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.482 321.973 192.396 329.5]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.192 277.021 163.106 284.547]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0) >>
+>> endobj
+8044 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8048 0 obj <<
+/D [8046 0 R /XYZ 89 770.89 null]
+>> endobj
+8049 0 obj <<
+/D [8046 0 R /XYZ 90 230.183 null]
+>> endobj
+7588 0 obj <<
+/D [8046 0 R /XYZ 90 207.807 null]
+>> endobj
+8050 0 obj <<
+/D [8046 0 R /XYZ 90 207.807 null]
+>> endobj
+7589 0 obj <<
+/D [8046 0 R /XYZ 107.713 125.743 null]
+>> endobj
+7590 0 obj <<
+/D [8046 0 R /XYZ 107.713 110.376 null]
+>> endobj
+7591 0 obj <<
+/D [8046 0 R /XYZ 107.713 95.01 null]
+>> endobj
+7592 0 obj <<
+/D [8046 0 R /XYZ 107.713 79.643 null]
+>> endobj
+8045 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F102 863 0 R /F8 802 0 R /F11 621 0 R /F7 803 0 R /F24 537 0 R /F32 772 0 R /F75 562 0 R /F10 773 0 R /F13 835 0 R /F94 771 0 R /F113 1791 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8059 0 obj <<
+/Length 2337      
+/Filter /FlateDecode
+>>
+stream
+x��ZKo�F��W�P���\2� ��8����%Z&"�
+)���뷚MRl��(��] 9Q"��U�U_}�l
,
�0��ft�N�� #�
n���
�̓�!����`���1�a�����1�a�||��Yt�>�ˢ�q:�!^�Y�M��
+
�^Fy�~~���lLt�g1�c���
+2�t��������p@�)
�V���p0��?1��/ŠU�)��2�u��.m��
+��^J�
iYF"�ab�i��u��v3�;��7��&�o�Ig�U��F�$]�wO�&�#ƍ7"�+)/\��DĤ	����1/Pd�����b")bB��,�
3
+K7&$t��T�)�T��a�|
\��':l��=��߱��	2��űj�b�І�H(���/�z�p���o�Btc�FD�jĢCd�� Ў�*��JQZ�����:����;�oL�H
+�B�ʽ��l��!�\��ҍM���>V��x����C�
g�&��:F�{齻n�A�xLE��T�.z�(W�D��b���Z���d�t����<Z���2�ȉ�r��^\z@�C��N`� )�����*�9�T�O�pS�1Gr P�9��>�3L���x�5���i5O <s����&�8�� �I0�T2B���M4��^!eD ��N��%D�-V�0�V��/� ,��@@0A�xi�z���x�7(d���=Z$6�?����
:�Ok�Zp�K��1O�h�m5�4Z���hQ�Y�
��[�
��W, 4��L�`�4#���K��%^��eQy�[�JC/�漮湕0�~	�x�d��N�#`G��4P6��!
��Ve��
��
v�"�� *(�8�58�u6�,̑
+�4=
sT �i����j�ݾ�k�Hh��
�RG3��<y���o�,�poUIL���W
+4��=��H�1���������y|��[7C�D>�Y�a��
��@F�@���|���l���B��
�2O�x�W��
G���b�7�@F�Б�n�bB(�)x���'��_�xcu�}I���M`�{�8ԕ��‹�Kw46{�/-0� ��>ZOqP��/����E��"��v!���dqpߐ�`�{
�Y1hVɉ��|:M�c����2��h0.
+H/kƁ��#
�?��o��o���	����E0�Q�[z�E.�|Ҧ��*] R��2�6Q���#�8C�jӕH�}7T��v��Y�H�����퀂���
c
����_���"��	x�ȓ�

+�Q�g
��0�/�Ф'�� �
�1�%�#}��)����
�O�C�T��ԛ��s�#������9?�fыs@����
��8��sP�?%
Y�x��#�)ҡ�E:l+�����`���$N줞�y/ � 
L �A��t4D^B:� JH�
CZq�����
MC�~����r8W@$
�s\$�$�`D�Պt�
�C��R�5>�9�栏FD\��!@]ϴ��
+� * � 5|��M��m"�z�C�Ü�Є��9 at cNO�s`��
V��:I�dH1哎NE������i> �1�����䠵W뒰
���>�X
�����w �YRA���
���*�:t�23 at xa%!0�V�6��m>��
ؚ]P�v�L. �l
mΞ��c�Y�յÓ }��5���ٽ�P:��v�m��;�S
+�{�r��-�d��^�QZ[����]c��T���C���GK��7�Y����	�'i�xߧۇ�rќP��D�y�����☚VHMأ����0-Xwd�SP
+��;b����L�%�n8�Hq
����l�R�����%0���
\L�)�}>��8C˴i����D�b�D��C/�@��m��ߒ��c)��j0�|���rULՠ��dp����C�4
���4��
3XS3��US�2��M�giGW�?8�dI��G'��m�l5�ףּ!lEJ�M��d�l5�F-[�?�jh`��W��`�{�o2@,
�%����`�϶^�7�ATP�c
�T8�k�,�/�|�u��`���C(���/�ƞR_1�Y/(�
H1�Q~�:���o:
:������n�hW��&���sd��~������L�^��zIXq��:+s���t-^�|va�Go�
�޷����
�,�:�����nx��jm�ht�W���F�Q(����FgV"V���`<R��x|nۣ�m#�����ڞ�˶G����[	���q�z�P5�T��#�etENː��~�~���ٷ��o��D�]T���V:U��>�K�jk}y,��8.mp��T�~
�W�( a�����v3����- h����o� XU'�}��J�<M�psU�
+��C͋S$0����?�AbbϹ���������Տ+�I��{�_̒g�
+endstream
+endobj
+8058 0 obj <<
+/Type /Page
+/Contents 8059 0 R
+/Resources 8057 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8072 0 R
+/Annots [ 8043 0 R 8051 0 R 8052 0 R 8053 0 R 8054 0 R 8055 0 R 8056 0 R ]
+>> endobj
+8043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.275 661.5 362.097 672.404]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.007 605.33 444.83 616.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.086 251.159 422.655 262.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+8053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.486 251.159 511.506 262.063]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.086 97.069 422.655 107.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+8055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.486 97.069 511.506 107.973]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8056 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8060 0 obj <<
+/D [8058 0 R /XYZ 89 770.89 null]
+>> endobj
+8061 0 obj <<
+/D [8058 0 R /XYZ 90 721.073 null]
+>> endobj
+7594 0 obj <<
+/D [8058 0 R /XYZ 90 704.201 null]
+>> endobj
+8062 0 obj <<
+/D [8058 0 R /XYZ 90 704.201 null]
+>> endobj
+7659 0 obj <<
+/D [8058 0 R /XYZ 452.457 664.654 null]
+>> endobj
+8063 0 obj <<
+/D [8058 0 R /XYZ 90 658.014 null]
+>> endobj
+8064 0 obj <<
+/D [8058 0 R /XYZ 90 579.801 null]
+>> endobj
+7746 0 obj <<
+/D [8058 0 R /XYZ 90 557.424 null]
+>> endobj
+8065 0 obj <<
+/D [8058 0 R /XYZ 90 557.424 null]
+>> endobj
+8066 0 obj <<
+/D [8058 0 R /XYZ 90 486.748 null]
+>> endobj
+7747 0 obj <<
+/D [8058 0 R /XYZ 90 452.078 null]
+>> endobj
+8067 0 obj <<
+/D [8058 0 R /XYZ 90 447.595 null]
+>> endobj
+8068 0 obj <<
+/D [8058 0 R /XYZ 90 374.732 null]
+>> endobj
+7748 0 obj <<
+/D [8058 0 R /XYZ 90 340.062 null]
+>> endobj
+8069 0 obj <<
+/D [8058 0 R /XYZ 90 335.579 null]
+>> endobj
+8070 0 obj <<
+/D [8058 0 R /XYZ 90 221.181 null]
+>> endobj
+7749 0 obj <<
+/D [8058 0 R /XYZ 90 185.972 null]
+>> endobj
+8071 0 obj <<
+/D [8058 0 R /XYZ 90 181.489 null]
+>> endobj
+8057 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8076 0 obj <<
+/Length 2934      
+/Filter /FlateDecode
+>>
+stream
+xڽ[ms���_�~i��G�n�3m�d���s�%���mqjQE����> A���[L��	.��g,�dr?I&_]����ݗ�O,�������&-,�
+�����L���7�L�2�Z���������o>�wW_�\�rE�*��Z�$�L뫟~N&K<�f�n��o���q}�|���Uti��Iw�.ACK;K�DL4��$�V�_�c�o��WhO�^u��=�E$�G��2�#���eb2�DYA8��\���J�Kq�}�H��
+�`� ��&w
)����P�H�g��l���u^�D2}N��Ǵ�q=�ZgEU�ס�`��$�Q����X��
B�>6R�tF�K�z�*73&���ٜ�d�߹�!�d�;�W���e�"�l�����Z��rC�Kr
їx�Av"���E2�C���0@��7"M��D9��$�Θ�n�%L�������t̨6p��b�&Gue��j��51�c���8�n
f�N_Vٲ
P�����P�1@�T�
+��%rn�/��_eEV�զ���fվ2
�k�(�p��2Vf��.��nEB���t+8Q���2m�>j��w"����(�E�
�擏��cV���t�+�C�/
LM(�o
XܟpI����պž�jZ��p� P͹�P3���ʋ���~��l��B 	�	��Q���Y��Ze�M�������Q9�p��wmD����6/�k�Y��,���%|�a���U�
@b��Hv�6b -l�^Ï��#aR�gзl��
d�Y�3
_E��v41���e��ǜq~
+ǐ�R���R��zQ���(�֎�c at r�o��!+��ƹ���pJ�8fq�A
�tͤ!R��-b]rwۆն�
gs��t�g� �i@m��_3��Gyz��m?~ȪQ	Q ����ߜ+M8W1~ �&�d; ^��"�A��@�@� �Q���̸G��9��C\���"6�l�C���]�Y���o�j&e
��jN5l!
+���
V)�
�x�õj�>;��]�)�V�F��~�a�N���(�#�ME�iy ��M��S��m�(
�כ�M��Yc��V�t4��8���>O�1��t2�id�zB�_{�0�7�x��N�M�u�l����d8�X�X���i��7e�[����(�]h���o|��=w��3w˧yU?�gt:Y��⾖��Et
+�>n�(H+���u��m�
�Ϊ�&xu�UOe�
�8�^�֚w��609�rEw�֜�d�����o�h�B�:��ʶi�*������
�41��L�ɐz��
u*Kr�Ǥ��l�k/I4E�3�$:
A�$��H�CI�1+����,) �����p�H�CY���q�UXi
+wA�"dI�C��}�⹦�!�u'�ey��4�Y�\2̨�C��a�rCo���C
(ˎf_C�j�v1Cо,\�m:��t�賳.e�p$�(���{i����������b�S|�6��a�
�҅܉�`$�5�B�^�8^� ���
#�K�B �_�
�
+�	6�:P�C+x���3����eQ��akQ�r兊D�H��bDNJ�ΤU�x��2{,�-r�[4�'i}Y��^y��{%��W���;vZ��E��-�rي��O�|��}�x?n��χw'$���m֤Դ,=18U��
�ۍ{���p�����
 Ҹ� X���ktM�ô�:�td˒{���}|���y��<
���Ʈ��
�
�b W_:��[|�����LJ�k�h��_�KXT����@��� ��MW�O�Aܜ"l�B�ӄ!v��
&L�[b���X �u�Dː�ԕ�ؐ����|t����o���<C��P���[r�H�>��@j�ݷ/'�~�cU�m�/
��D�i\�����
�uO�9+$_�j��h�WHF�Z!i�@�-�F^�B��[�k�z�I9�
+n�$�,#��
��b
u8��*
�spGD��(�
+K4eq�W�O
�Q�.3T8
Z�@ׄ�]�5���5r�8PB:���f�b`�c��Ğ�d;
���X
'X\F��;

	o��pNvI��f�����6��\@b
�L��\$���naq����2P`����B[��E-��ft`��a�壄���J:ɋ�6�G&�"�}
�(��)�9fd��~M�	�і�{�&��s�og�U�Ӂ��� T[�hIn��6��4����m���X��o.�
�DT�����Y���
�Zg6�t
U�
nc]��$�/cGP�mO���H�Cyd�DZ�fʌ��=]
���b�
`���{�%ՁB�a���$a��
+ᛜ�8R~
���
�͡M�pp]v
o��3C+#�cK��
f�ލ8�\E%%�YX�c�l� ��"}M�Z7Qc�_눼�����	� ۘ#m�����l�H�l��l��&1�A��K���(�L�n!e(H
g�p��{0W�

�A�Mx���>ԏ|ŭ�USN���(k�; �v��!��񼷻���t"�q����d�<�G�D�(M��Pns
+��n�e$�_���9E�8������R+Œ/�G��9N�,Q���
OQ��ʜãܑV�FQAH�9�U8Ĥ��s��
�&l�Y�>#�9K�?!���m�H�;����`Y�;�7��f�?��|8���က
�vo�I��2�4�,ޮ{�ۦ �2 at m�W��	J�;���F'6��
���"=�q 5&�i�]Bi�tƌw$�!6t�;�7r��
Ə���a��ô8
���@=�R�q.F�;�>j��Y`��8�|���?/�n<j,���%�U��6�u��������k>���v��7�	l\��#�����drg]�6�Ӂ���→o����?8�

����i.�]J��B�]�
�|,3�\�/���m���Zտ����I�i�6-�����ݻۧ�mVܓ�f���v�h$�R�]��M�y��k�!'
��� V�{N
+endstream
+endobj
+8075 0 obj <<
+/Type /Page
+/Contents 8076 0 R
+/Resources 8074 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8072 0 R
+/Annots [ 8073 0 R ]
+>> endobj
+8073 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8077 0 obj <<
+/D [8075 0 R /XYZ 89 770.89 null]
+>> endobj
+8078 0 obj <<
+/D [8075 0 R /XYZ 90 718.682 null]
+>> endobj
+7660 0 obj <<
+/D [8075 0 R /XYZ 90 684.012 null]
+>> endobj
+8079 0 obj <<
+/D [8075 0 R /XYZ 90 679.529 null]
+>> endobj
+7661 0 obj <<
+/D [8075 0 R /XYZ 389.246 627.842 null]
+>> endobj
+8080 0 obj <<
+/D [8075 0 R /XYZ 90 621.202 null]
+>> endobj
+7662 0 obj <<
+/D [8075 0 R /XYZ 323.472 512.512 null]
+>> endobj
+8081 0 obj <<
+/D [8075 0 R /XYZ 90 506.59 null]
+>> endobj
+8082 0 obj <<
+/D [8075 0 R /XYZ 90 437.298 null]
+>> endobj
+7663 0 obj <<
+/D [8075 0 R /XYZ 439.235 361.094 null]
+>> endobj
+8083 0 obj <<
+/D [8075 0 R /XYZ 90 354.12 null]
+>> endobj
+7664 0 obj <<
+/D [8075 0 R /XYZ 158.014 292.968 null]
+>> endobj
+8084 0 obj <<
+/D [8075 0 R /XYZ 90 286.328 null]
+>> endobj
+8085 0 obj <<
+/D [8075 0 R /XYZ 90 217.624 null]
+>> endobj
+7665 0 obj <<
+/D [8075 0 R /XYZ 90 182.954 null]
+>> endobj
+8086 0 obj <<
+/D [8075 0 R /XYZ 90 178.471 null]
+>> endobj
+8087 0 obj <<
+/D [8075 0 R /XYZ 90 105.608 null]
+>> endobj
+8074 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R /F11 621 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8097 0 obj <<
+/Length 2297      
+/Filter /FlateDecode
+>>
+stream
+x��Z[sۺ~��P_r����&�is�sNڦ����qi	�8G"����R��R,�\�3IA����.ă�
�;�����

2��������		w���!����	�?�
&�<��0�x���vR$���")�NO���I��*���,)Kyf�l1"zh���阡fH}>�����ї#
+��
+��`<?��&���F���M=h>���l���?G8�#*ܥ�+3dme� B:
C
���.�|�R
뤼^�vD3ĩ�gb�ܧ#EF�V�M}����S�ÈQ�눐����J��:�����i�}9:�î?OO�rSF�|Z
BF"��T�_����df�*"^h��A�K�01=�U���
xt

���X
��s����*�=9\"�D3�A��
шHӌ���.Ӳ ��f�\��J���	S�0
��g�ZYV%�6��vUU��~PoR�"Ǥ�^�`O���ȳٝ����_S������Z0����w��j�����o�C$�J�Y�7�F\�v��z�

+GT
��
������%rs
N��Hs�.��!��4q��5ͮ��
�9���dl�o�6+Spm0l�T�W۴C
=2\��c�eB�-L(![pu"t3Q�?>^��{|
>^��{����YD*3��R9�/���,kx��~��$9����40B:��O���߂�6g��+b�'�Y
h�LR�A��3�;�����U]��
5_5M����:`�����S���&k]T�Z�ϮA江���2�^>�I�/E�G�?�Ӭ�?����a�US�����)*R�˧"���"�٤�(�{����Βʆ���l\�����x	�_%���1�J�4.���bQSϖ���4/��&s?�3��/�JzT��W��/"xP���
b�".
��y�<�I B�m�C9��
�vZ��Q���X'RaDik�O�w���I�5C"�%�/�E���YB
�H��&�u�<O�J�]o�E��7�l(R�)���8"����K�U
+�C���Ǜ���dC���-�n*No�j�0�JĻ��p:�
����E�X���d��Pr�6���
J[FL �������=�2).��.|�,m�ɃrU~/^L��a��R�a��\�j~f�]Ύ�����/�ed�����m#2b}qz:�W�rV]x�q�}6{jv�9���
��i^�"`�ʴ����98�{���v��=�,��㦯�hW�k�X��"���a.ڐ�m
T!P�0J�s���6u�
Hg�!���%��t�K݂t�q`��t�h���� �kE�x
�{�x��u)����-77fOlI@�*�"Z�.52�c�� @mg���Wy@��
��rY�HC$b�/ �����1
�
,U=�����P���j_Va1�1<���1�\j�g��X^�ܵ�D�Aze���d�����V�a�U��]�~;���p��4��uj�-/I�V��>;!blX�A���_����?_�}C��X�?�9��'��b_
4(�HJ�����N�ͨ\K�]ދx����na�d�ξ�
����Y��G����P��!Za�Ž�tVW��ƀ���=ת{�1
&P��z*��m��U�ފ���p�a���
�&7�m�u�
���bռ�'���񯮇e'�Z�/mw-S�>����y��
Sk��}���l6���$l ]ی
��� ��J5��j�k��7�r)�Hs֗�>��H5�ڳ�;�d���Ș�U�+���z�ۈ
r�u#!��Y�miK씶�D�����'�ݞ�Y��&iv}�:-bSBBr綼�IӐ����8x &����U>_,+[6'y�9[[�c���Es���$�&X8���Z����lucmkW�]򇲠�����&�¿
�=���8��/�]��
�V��pؽv�
�
+bk�k޲4����C��*�V���1������}�K��X�m:�B�(�wG��g�&����
��K
��Vp�0�4\s��
+/�Li�
�Fk9Q�Y�_�3�Ȝ�vsV�/n���@ݯ���s>m�ЩA�l���Y3t��\�q�\eC�xy=�qێ-K���J���/WJw��v}���X 
��<�F��<��,���{���?��ʲe�e�~�c_��A"��jG �
���Gk�������j���q%
�-ܦU�8}��ry]�����&
v�b�ʮ�G�i�y�*��w
j�Ɩ<#%m��e3&�>.���u�e������s6x���W��L���
+endstream
+endobj
+8096 0 obj <<
+/Type /Page
+/Contents 8097 0 R
+/Resources 8095 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8072 0 R
+/Annots [ 8088 0 R 8089 0 R 8090 0 R 8091 0 R 8092 0 R 8094 0 R ]
+>> endobj
+8088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.507 606.386 236.499 617.29]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a42867df59ec40173391b76074f9f0fb2) >>
+>> endobj
+8089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.558 422.693 399.496 433.597]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244) >>
+>> endobj
+8090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.558 366.523 397.275 377.427]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a) >>
+>> endobj
+8091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.558 322.308 286.611 333.212]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) >>
+>> endobj
+8092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.558 278.093 320.364 288.997]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) >>
+>> endobj
+8094 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8098 0 obj <<
+/D [8096 0 R /XYZ 89 770.89 null]
+>> endobj
+7666 0 obj <<
+/D [8096 0 R /XYZ 90 721.073 null]
+>> endobj
+8099 0 obj <<
+/D [8096 0 R /XYZ 90 721.073 null]
+>> endobj
+7667 0 obj <<
+/D [8096 0 R /XYZ 351.108 671.378 null]
+>> endobj
+8100 0 obj <<
+/D [8096 0 R /XYZ 90 664.738 null]
+>> endobj
+8101 0 obj <<
+/D [8096 0 R /XYZ 90 588.932 null]
+>> endobj
+7844 0 obj <<
+/D [8096 0 R /XYZ 90 565.779 null]
+>> endobj
+8102 0 obj <<
+/D [8096 0 R /XYZ 90 565.779 null]
+>> endobj
+7845 0 obj <<
+/D [8096 0 R /XYZ 90 524.075 null]
+>> endobj
+8103 0 obj <<
+/D [8096 0 R /XYZ 90 519.592 null]
+>> endobj
+7846 0 obj <<
+/D [8096 0 R /XYZ 90 479.86 null]
+>> endobj
+8104 0 obj <<
+/D [8096 0 R /XYZ 90 475.376 null]
+>> endobj
+7847 0 obj <<
+/D [8096 0 R /XYZ 90 423.689 null]
+>> endobj
+8105 0 obj <<
+/D [8096 0 R /XYZ 90 419.206 null]
+>> endobj
+7848 0 obj <<
+/D [8096 0 R /XYZ 90 367.519 null]
+>> endobj
+8106 0 obj <<
+/D [8096 0 R /XYZ 90 363.036 null]
+>> endobj
+7849 0 obj <<
+/D [8096 0 R /XYZ 90 323.304 null]
+>> endobj
+8107 0 obj <<
+/D [8096 0 R /XYZ 90 318.821 null]
+>> endobj
+7850 0 obj <<
+/D [8096 0 R /XYZ 90 279.089 null]
+>> endobj
+8108 0 obj <<
+/D [8096 0 R /XYZ 90 274.606 null]
+>> endobj
+7851 0 obj <<
+/D [8096 0 R /XYZ 90 234.874 null]
+>> endobj
+8109 0 obj <<
+/D [8096 0 R /XYZ 90 230.391 null]
+>> endobj
+7852 0 obj <<
+/D [8096 0 R /XYZ 90 190.659 null]
+>> endobj
+8110 0 obj <<
+/D [8096 0 R /XYZ 90 186.176 null]
+>> endobj
+8095 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8116 0 obj <<
+/Length 2061      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~�_���
�
�/mQ`w�m�iڸOihl�D�-9��d��
RWʲ�I&�f;O)�\x��$
�D8zz������EIe���
�7HH���3*����LjI�����O���g�'ϖ/ܳ�'ˋ�
�TR:Zm/^�����0bFG���m�)��&zq����"�@B!�n6�1x�ʶ�}�I��L���fg��,��u5�IzS��5��%���ֻ���Z��W�� ��U��;
ѓ��@����՟v���~{e�B���� u�O3$�j�}�(+�xKx�=�/$Ƴ'�K��[
o��q"�
�����y�IV��9'Hs����Z
�cn�(P#*ܭ�8�L��B`$���!���ϲ҆�#	x�6��F��j��(�t��C5�V����($�U'K7�#�մY��`LS���-�Y�������q��5��M\v���.KҲ�����2˫��&+��o�`
<�n���mM���$�-
�x�B�bl`��xS��EL�&K
�g�-�9�Y�p�t�P�L�� [...]
+1�=)�*�}��3�c��3'
a.C�qQ$7iu`�k��g�U�A���|~�<
r��
N���
75�ʮ`r*Y���]-H$1�N�;q(TcH��7M��Rv�
�
[6�&d�|����鹚��j*ed·[��GCA���.��ijG�d\���VPH�������&S���i���{?*�8SB-��6<t�	�\^=-����s�
Z�M�
�o�>]Cw��q����
)ښr��I�jtkN�M2R@MJۣ}�[��ׯ�FP
�N�p������ٷM�����.+�	�#����8�z��
��D�GM-=��2��=��#EL��S/��:�<����e�d�z�ZB
#
\D!	g�� �
��R�����N37:��
a*N�
�����o����lzW5����~��u�˳��ַ��TVk���5-�1�4���3T�ӵ
�X_��!�� `�|?�׸���7��f�4��Eڶ��^)����־b�2t�e��I�!��;� v�^���U�L�N)�cA�	�2v�&�f<�ѡ�C�˔�=��` �܌�f�M"�a
�8�C��:���	�b�|uG�$�0R�G@�8DI
>����L%�q�N���J�����f�=���7�D��(�c�����8��p}.J��
J
+8�(�����Q3��CI���FI���yP��rB6a�@II�ΆI
��c��D�xmjTd\ZH���������V�cuW��G�|�t�*�E:��I!C˟9XX����P�
P��RQ#�F�,D�^Լ���ݰF��Z�
��8���!�
QzkNu?AO�v
�>�q�x� 0L�3�|(
�
�
d�P�!�㶿�HP��
+���OP��d����I�_͉��]�8
i�!V(�6���j�1�+\��t�3c�ã�™c��=��<y�1��������� ��E��7hҏ�=�� n%�Q~��)� �B m��ŨS����K	CL�N�=Pۈ	G�r
+�Ѯ�>�2�M�� >ҭ�������r�>(��>�N}��l��Zw�$m�Y>�)���5�Q'$�:A�	�i ��)���Fԝ
�ht n�`(�bp�W
�=�;� 3��	�<
�9	�"�Z;!{��R����Qd�VÔo�A+�_��~��*5=�_T��
2FZ>�xr
+M
�������>�e$�{�/�
�I��O���$8�<JQv������6���[h�1Q����{���SO\��e��
�u�@o�l~/��5'�R��zD���?�������_ͅ��}���y��:i���Dv�ծh!@8�?����T��ي�S�;=����+蛲�}}yy��)lz����[��@�����y������}L
𿡯��
+endstream
+endobj
+8115 0 obj <<
+/Type /Page
+/Contents 8116 0 R
+/Resources 8114 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8072 0 R
+/Annots [ 8093 0 R 8111 0 R 8112 0 R 8113 0 R ]
+>> endobj
+8093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.984 707.957 392.663 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+8111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.927 501.453 410.606 512.357]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+8112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.984 87.823 392.663 98.726]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+8113 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8117 0 obj <<
+/D [8115 0 R /XYZ 89 770.89 null]
+>> endobj
+7853 0 obj <<
+/D [8115 0 R /XYZ 90 637.406 null]
+>> endobj
+8118 0 obj <<
+/D [8115 0 R /XYZ 90 632.922 null]
+>> endobj
+7854 0 obj <<
+/D [8115 0 R /XYZ 90 430.902 null]
+>> endobj
+8119 0 obj <<
+/D [8115 0 R /XYZ 90 426.418 null]
+>> endobj
+7855 0 obj <<
+/D [8115 0 R /XYZ 90 223.775 null]
+>> endobj
+8120 0 obj <<
+/D [8115 0 R /XYZ 90 219.292 null]
+>> endobj
+8114 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8126 0 obj <<
+/Length 2247      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�F~���ӮD�_Ң@�i�v��7�>��AKc��$��D�~�!�7��XIS�OR�3�9���F��~������FD�8�ut}9��p5�ގ%Ҍ'�R:�3:��E|s5�t�η~��7���,ζ/_��>��4O������z]��;���
��ԃ8�q��������

+ш�
+(bl4]\�}G���9�D8�/&-"��Σ_/�{A�-�/�
+��,t�e�u�R&�������/4ٕu����G�%��h�T���W�:��(4�JpO!	֔��&J���#�r�-'u����j���F)_�Y)����_��W~��q�,_
Vi�����x9�,��O��zӝ��x"`w�)Y�
r�;�d��/J��j�<1`�P�F�R��w�|�{���*����7�I�
�l���M%��h�
aԶ�(�D���/V�8���s�
�4�:lT{�!F�jB�]�e�@g91�
K��
+���:��M�j��,�8[����,
fh���i:/Ef~�'��8��a$�)�
�R
������
+a
L�(M�
y1
�����
�ʜce�$��ݕ�p$����QEC�+D�"R�n�}�৿c��_6�[��l��D�����]=��W�r�����_� /���A�U,�P�(���pK� I
�*U��
��eY���]�j,8��d:6�m�3�&\��خc����K"���ƚ�^���Ӧ�r�������5
i_��x��?Y��Jq�5��D@����nXW���tm�vlk�uV�)]�z�n��dy�*��DjA
��r��i��l������/���׮}�y,ȳw�
��
&����
�45!���j���+�_�f:Of>^��u�*��V٣��ޯj�>�4)�q]�84�^)��x~_�"��B�Ɔ�A�cf��!~���
���m\�
c�a«���1�
SL3�#���d�T�@r6ZCH��_eH�Ze�d�In�w�UI^^I���*�ӲSL+��b�#�K�:��lӇV�cש�U���C[�,>�����:N���:XR���}��!j4�
+�&���*
 A
�!

+���d��p�B]땟&�m�Ĥ��X�)��%�
+B��6|7��
+�����
@�d
+�$fu�ֺ�S�V
�|@t�j��f
�
+�z���$����Z����Bm���݇���L�"��T�-t�B�<u���(�;��#�c� (B:h��^�����^�ځ-�7W�g����41�M�6t�+鲙���j"��@���)�@��3!
+�H>��OF��'%D�C�dA�ۛr��C�Q7ީQ�"ǐ�M�p" ��R���I�H�L!J35ȉ�#Z�ca	�Rs�]��D�%�*��Q"��B�������#:ê��W}&D
!rZ��	��-�ɌH��0�C{�R�&;��hX��P�5�%��
�]R�X��%�}��O*PC>�
a㡦%-w^?�!J�adP�� >� ��D�y�>� �/� ��8Je� �b]�X���[/A옅�7���K
{� -�m������MV���	�ՠ�#�C��}m���=��ʂ������=~
+��0�Y���S'�!��z�6�����8;�we��-P99�!
z#�ƕ�ǟD���
QF�7ɲ��$���� �X<����Yw���Q@{�C�3�,�
�ݕk�N?�
rsDy>�(�Xq����픇i$�x'a+%�60O�3ڑQ����!"ɑ�9s�u�aw�
����j ��
"���A2�+��%Y3k� ����z�sI@Z�uJ
;U��d	�X�����x�Hb�
"O=�
zK���
7�
?֙��²#��v@��u*'3�X~J�K�T8��>%B
pd�4�4w�#�b�
�f5��ŏ�
����{��`���@k#T����5�����Akڥ
�WzW��<��<
����k+U�<w���e�������I�SN��%zx� �8h=�
D�;'�x
-��G����#��A`-�:�=,��������c@	�I��c@�1�������
�.28~�SY�
+��S?�-P)�m�]�
��"ytv��\]�.�[��c�FA����M
�� ����|���
+#l�y�ȅ� 
�� *�=�F�.��Q�A���.�y�zyyy��_��=�b�qZ�8B?�U_!/���Q�ĂRRa�ʗ
+
+�����2��8�=.��

7.Z��U
+Nn�H�?�f
+endstream
+endobj
+8125 0 obj <<
+/Type /Page
+/Contents 8126 0 R
+/Resources 8124 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8072 0 R
+/Annots [ 8121 0 R 8122 0 R 8123 0 R ]
+>> endobj
+8121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.927 542.845 410.606 553.749]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+8122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.984 141.763 392.663 152.667]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+8123 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8127 0 obj <<
+/D [8125 0 R /XYZ 89 770.89 null]
+>> endobj
+8128 0 obj <<
+/D [8125 0 R /XYZ 90 674.314 null]
+>> endobj
+7953 0 obj <<
+/D [8125 0 R /XYZ 90 478.568 null]
+>> endobj
+8129 0 obj <<
+/D [8125 0 R /XYZ 90 474.085 null]
+>> endobj
+7954 0 obj <<
+/D [8125 0 R /XYZ 90 277.716 null]
+>> endobj
+8130 0 obj <<
+/D [8125 0 R /XYZ 90 273.233 null]
+>> endobj
+7955 0 obj <<
+/D [8125 0 R /XYZ 90 77.486 null]
+>> endobj
+8124 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8135 0 obj <<
+/Length 2307      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�F~ׯ��.Ye��>��V��v*Y���ʓ�RA�HF� ���=��
��D��Z�
�c����!
]G8���_�'�/�
2����*28R� !�n��P!����Ԉ	���?�������w��ɋ�?O���	�t4_�����<�9ˆ
}��"N�.�w'���F��p�̐
�A����B9��񤴫�2.���%n�EZٿ�Wx�R\�
ʻ�M㕝Ψѓ�)�������tƈ�Z"�$
0&�#JMK��pE;�.�lY�\n��1����6�L�ѦS�2��p�i4Iǘ�Iy`
�g�
���s�z�e���6c�‚
�1�aN=�qQ$�i��߱������Qi�"��>#D ���)���x}���y��J!��>��W�+j?��M^ܖ6]�ŶN(�ՂD���N��H�i��g�
�-#��}3et�-��TM�ʤQF�k������y �>����A2��v�<K�2�ٌu��Ѧ6��,��i��
v�B�CB�e@�w��	&�Fdwλ���q���:��n�E�^_<O�IɆ9o��$#
|�3'�&i���"�S��ܺ��P�n[WN_J�3�p����u��j}S�BO@)��"ʍ�$zլ`�DF1]�
�
�#nxS��U��*�<Xե����-?Y��� Xi'�m�68Ro�8]�t�do�m"�y#����@���
N!I���j��}Q����� �hX]��
uQ$�ܧ.SՔ��ր�}��$E-��V��.\� 䤀��ͻ8u�b��yv���2���UvU�J��>I�,$���A*
JE�'�� [...]
� �Wo{��Y�F�S���Z��7�'�
wW
+o�֞��
yG���F�i�84�Ї!ɚV�uVZ�D��]�5�_
>P�}�d,�i�W��+
�]�Ţs�,]��
��ѝguY��ۦB�a���7Lˏqٳ�.�䗢^9�Z���|�7��� ����%y|��m�,���N0S�	؁q����M]$�	�.��7�w�c���
X�z͏
)��x�x
�
Z�x��G���E��7�9�5A����8�x�
\
r}B�_-)�&��H����p�C����]����x
].V$,-TI:��j�Cd�9�Xݗ,
�%��,
Q�L�f0<46P
<ˏ�� �RO��kB�bzO���F�rz��г����A�tzf�ѳc��JԼ�y���m���c94��q~W���:p��qe㐹C����+!" D1�OJ��¶4�!X�9䄡K�zE�_�a:
�'0�@0�0\�����(s����~T?�z�
+�`�C
G����;ڱ��Vpiƫl��/��) �]T> ��8qO��v�}vv>U|���61>�t���28'�r�
v�/
r�t ���T����2`��[�	1�%���:�0]6���%��{?�e/�.;�`c�_��]�S
2 �,
�� "�
o0�8�S��-c��&諐��fG�94�'7���u Y3o|�h
J�
��S"&w�m*��/lT� ������ �T8J)y�Q��VV���֘T`�Ӥ����6)�
oРA�F
�LJ2{��<�fQn��4
�{�>f�����H�6��<N���S��T�A)k�<�=���=�WS5��mF�[s�
�ų�(�
��%�
��
%�q�� �G�|m�Н#`�Wn�l�������Ϩǽ�C0���)xXS !����&���'h���g¡��$L��!���n iE�P��k��j�?)� ��?Q:�|����/�����2C�)�P� ���1�+\�
�C�
���jx:(M�
A���by�=�|A$��m�8b�=
�p\���G�hEK��T�{Y�}�����P���Ԧ��?�&���op]�l�4NZ��y�zr3�7�	V����гWSC��-S��ͫ����wc�f��8�����3�_Ηl^t�`��:��)��~��w��ֲ�щ���?�2Az�}S��,�g���7�`�k4�V�c�~�1�^� [...]
+endstream
+endobj
+8134 0 obj <<
+/Type /Page
+/Contents 8135 0 R
+/Resources 8133 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8072 0 R
+/Annots [ 8131 0 R 8132 0 R ]
+>> endobj
+8131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.927 597.111 410.606 608.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+8132 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8136 0 obj <<
+/D [8134 0 R /XYZ 89 770.89 null]
+>> endobj
+8137 0 obj <<
+/D [8134 0 R /XYZ 90 721.073 null]
+>> endobj
+7956 0 obj <<
+/D [8134 0 R /XYZ 90 520.238 null]
+>> endobj
+8138 0 obj <<
+/D [8134 0 R /XYZ 90 515.755 null]
+>> endobj
+7957 0 obj <<
+/D [8134 0 R /XYZ 90 306.79 null]
+>> endobj
+8139 0 obj <<
+/D [8134 0 R /XYZ 90 302.307 null]
+>> endobj
+7958 0 obj <<
+/D [8134 0 R /XYZ 90 260.573 null]
+>> endobj
+8140 0 obj <<
+/D [8134 0 R /XYZ 90 256.09 null]
+>> endobj
+7959 0 obj <<
+/D [8134 0 R /XYZ 90 234.042 null]
+>> endobj
+8141 0 obj <<
+/D [8134 0 R /XYZ 90 234.042 null]
+>> endobj
+7960 0 obj <<
+/D [8134 0 R /XYZ 90 211.934 null]
+>> endobj
+8142 0 obj <<
+/D [8134 0 R /XYZ 90 211.934 null]
+>> endobj
+8143 0 obj <<
+/D [8134 0 R /XYZ 90 177.872 null]
+>> endobj
+8144 0 obj <<
+/D [8134 0 R /XYZ 90 155.764 null]
+>> endobj
+7961 0 obj <<
+/D [8134 0 R /XYZ 90 133.657 null]
+>> endobj
+8145 0 obj <<
+/D [8134 0 R /XYZ 90 133.657 null]
+>> endobj
+8146 0 obj <<
+/D [8134 0 R /XYZ 90 99.594 null]
+>> endobj
+8147 0 obj <<
+/D [8134 0 R /XYZ 90 77.486 null]
+>> endobj
+8133 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F13 835 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8151 0 obj <<
+/Length 2312      
+/Filter /FlateDecode
+>>
+stream
+x��\ے��}�W /	Xe���ܷ�T%��#����IVmQ$�b��5HZڿO�
 � ��K
R���s�P2�������K������w��X*�}Xha�T�i
�	%B�'�Rތ
��jzw3n���y<�{�xO�����uOw�x<I�o���6�|���13a��E(�[�!H=~{�������C�h�R$�&��Fo��`�_���sk��ɠU ���e�z�ӈz3KfdYeF��&D$�tWf/
�Z��dh9�d�'U("�G��L���vG�3&��*��S{j^@���̎�
M7қ��f���*�
+���'B�p�Yow5��U��r����݋O�o���f]3Y���������„�G8���h���e�^E��h���
+�h��a"�M�34Q��,�,}� ��7q������]�v�C��d•%@!��&��J8���f�t�0��!��g��ϹwT�w�����\��D�|ħoj����E�7Y�Pi�a�c�
K�Q��%E��<i*�4����gxg|�E�\G�~��Dݰ)m��]�zp�����t���E-
+��=>D��
+,o��k��>����!J���
8����V�UJ�*���#����n�L���m�F
��R�%��>lõ� �(m�m2_lwSG�G�z�b�Y eR�|͘L,���$;�8�'�%�
&h��Y��h���]��ݿ��wQ\�7WmO��l1"�+�
_|�E�y4�!�k$
�r�E�������()���N%
+�
D-gn#�jo�
0�[��:���b�"�YKl�%��u�X�DU
���8�
+|�F�a�h
�d�Q�  D���m�Ls�l��eӰh�<J�a�� �j�_����狸6IC0�Ų��
�ȋMTৄ�)a�
p�n�@�b��rTW��@,k����:�Xp�B��b����B�YQS��p��ː�hBq����8ܐ]r �9Cz��4CJ4̥��R��
J�Đ���S{a�/Ð�Y���E���ʩ��
d�Z�8�� �����L�ud�6B�5����%eDێ(ݒ�=�<������X�g��s�Љ�r���mh��0�zCh����
��%h@{���b���\�*��8�a����f�g��qX�2�g��6�* ��A`���
p�
�n*z;`?����D�
��
��.�/�6�,mCW�m��_̦S5�0������ã�N����ٻe��jPр�pF��+DR
+0v4��@��m��ҦZ
�0ڧwg�h���p�S�.8}ש��
:��m��%J
�X�R`}�e1 N.�?���b@N(�z�b@��W�/u*P���K10t1�.�K��wh�U)���]��s$רA‘X���rd�G
*~�
	�s5E�Hv���Zs�<�za�/Ð�vY�v�8g���l�iֺ#J���2�
+��ɹ��P��p�:

��� �]�
���l��S�2u�f��
�2E����ۻe���-��[���[�l �y���{�]�eO�[V�s.��-3^%`�J@

9Q	 ؖ=s��y%`�e=4�|��s]���f+d"JgL�X�L)�������ATkF���T��;\�ˇP,�!T����;Lsݡ,�����Δ�;��
ܝ)�/�
��*O��
e���~�ޜ:SoN��7�522��dA��NTq��
%�;�dOw;'�9�dO�&ew���Y���]�ӈ���P�����Bʗ�sO�
X�
+�9ہ�t;К�
!�'��v���P�X�Wp���h ]k'�8�p�_0Q#��2�nk	(��>Ղ���4s�
h���lA�-HY�x�W��$#�s����;$�7 �
�k;��7 Л7 =������sʿ�A���<}6y;f,�8}8xR�xa,V����9��S��'�1� �
�w�B��(��ϧ�iv���W��;hP�_M�ř�d��|~S�#�2��^��Mƽa���7.��k>j�X��CK��u�$B1�����؅p�n��� ma��VLH_f2����&�����t��Օ��P��0HPL����
�у�����Y��14ʴ����_�~Qی�$�U ���I������^���0���/x9���o�yz�>%�:�
?����Oq�}0
+s�Ӽ�>�dY�r�0��`
bڪ�77/Ӌ�l��/c)��m5?N���2�v���_
��bf�0��q�B\����(�Cj�/A~��Q��
�q'��>�v�WW����|�d�Y
{�`.�ne�W��jg�Z���U��k��CU)�W�W
��^,�;�N�3�a���?W<x��E�����w��
+endstream
+endobj
+8150 0 obj <<
+/Type /Page
+/Contents 8151 0 R
+/Resources 8149 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8167 0 R
+/Annots [ 8148 0 R ]
+>> endobj
+8148 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8152 0 obj <<
+/D [8150 0 R /XYZ 89 770.89 null]
+>> endobj
+8153 0 obj <<
+/D [8150 0 R /XYZ 90 704.53 null]
+>> endobj
+8154 0 obj <<
+/D [8150 0 R /XYZ 90 682.422 null]
+>> endobj
+7962 0 obj <<
+/D [8150 0 R /XYZ 90 660.315 null]
+>> endobj
+8155 0 obj <<
+/D [8150 0 R /XYZ 90 660.315 null]
+>> endobj
+7963 0 obj <<
+/D [8150 0 R /XYZ 90 603.343 null]
+>> endobj
+8156 0 obj <<
+/D [8150 0 R /XYZ 90 603.343 null]
+>> endobj
+7964 0 obj <<
+/D [8150 0 R /XYZ 90 556.324 null]
+>> endobj
+8157 0 obj <<
+/D [8150 0 R /XYZ 90 556.324 null]
+>> endobj
+7965 0 obj <<
+/D [8150 0 R /XYZ 90 510.306 null]
+>> endobj
+8158 0 obj <<
+/D [8150 0 R /XYZ 90 510.306 null]
+>> endobj
+7966 0 obj <<
+/D [8150 0 R /XYZ 90 453.334 null]
+>> endobj
+8159 0 obj <<
+/D [8150 0 R /XYZ 90 453.334 null]
+>> endobj
+7998 0 obj <<
+/D [8150 0 R /XYZ 90 406.315 null]
+>> endobj
+8160 0 obj <<
+/D [8150 0 R /XYZ 90 406.315 null]
+>> endobj
+7999 0 obj <<
+/D [8150 0 R /XYZ 90 360.297 null]
+>> endobj
+8161 0 obj <<
+/D [8150 0 R /XYZ 90 360.297 null]
+>> endobj
+8000 0 obj <<
+/D [8150 0 R /XYZ 90 303.325 null]
+>> endobj
+8162 0 obj <<
+/D [8150 0 R /XYZ 90 303.325 null]
+>> endobj
+8001 0 obj <<
+/D [8150 0 R /XYZ 90 256.306 null]
+>> endobj
+8163 0 obj <<
+/D [8150 0 R /XYZ 90 256.306 null]
+>> endobj
+8164 0 obj <<
+/D [8150 0 R /XYZ 90 210.288 null]
+>> endobj
+8165 0 obj <<
+/D [8150 0 R /XYZ 90 188.181 null]
+>> endobj
+7593 0 obj <<
+/D [8150 0 R /XYZ 90 165.108 null]
+>> endobj
+8166 0 obj <<
+/D [8150 0 R /XYZ 90 165.108 null]
+>> endobj
+8149 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F11 621 0 R /F60 540 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8205 0 obj <<
+/Length 1950      
+/Filter /FlateDecode
+>>
+stream
+x��ZYo�6~��P`+k���#=�v�-��6ݤO�E ˌ�V�\I����
��[v����I4E�3�73������&��L.^��
+Q�QϺ��Bl�n�����{������G�y"����W������͵|7��f����+l%�#?�����ؚC��F,
��z��r)�gj]O~�`�K�D�˦|h
C��0Ʈ��BWi�6�D�ɮ���
�L%�qhM�Sso�™RJ�8_;�[��¯���M\�z
esը�ڛ@�'�'�R
,�"N>`L�Q&��E7�V5
+�.D)�*��<S}��Π�HI��k0l���s��|�����0�c��ճZF�j%�Y�g6O�*���\F�T��"_����YT���A�S�#�5�>��v

#�y�Yu6$��F��=�4*u�^�5�?"ETզ��.O�ܡ
,�-T�4v*.{����\��
��WJ~���G��r���:E˥z��c
Fen*!55R���R	Fn�L	IWu�XE�T!�CAX<�w�1�0�AeCC��
ă5}^�b�&�è��!�v)�ŀΣ��q����ɬ��ف����A����G��Ya�"���\o�JH���~���w���mQ�,��1�D	�R1M�o4ɌhI��
l�)Q�w��2
���$���\����8C>�]��/d���
hq�#�qx�
���;㹄�)"To�j3k�I����X�D�گ7Y,	^�
+�|
��F��yא��ѭv��U�X��K�������9 CơMZ���2�&v	)�]znM@�
$.�^���ĝ��c^�3.�)��f��&I�:�E:`�պ�
A��TZ�!ܮ	���hGQ����A�Ń�����Ž����g:W~��S��J�A��L��:
LQEI�$�<K��ܧ	L:*�P歆�
5��%G�	9�!�}�}����#�^,�=G�1���ʟ�Sp�*_o�⍮�T�*�ګQ����V�F�G���x
��S�#�k�̰Bzo)����u�X#Br�����+�O
Y_
T�V�znhoO��7e�,2y2p����8+?:�
��A��AYK��Z睨6E��^�M�i�6LӦ:P�	�i*>�Z~a6�I\�aߌ���� 
T����e��'���+�n�~�2���9.�GU9`i04
c�kg��|��8Gx'q�԰4O��%�q[m�b
a�u��f�'aL�z�bn�m:���7��rY�
Q(������l����?�.	G�l
����3�l����2vqp
+ۮE�Wl��z�ͅ�r;�o.�v%u�t �`�M!
��-
��y�H�z.���H�(�Ʃ��SK�a~�ryP�(��4Mw�8|57w�
VN�s��zUp54��01���x������|�S|��֭e�@��]��DI3&2ޜE�:�
p�d����g��dT6��f�l��::
���LɄ���U�����I���:
�O�c��S�Zn�d�ͮ�Y �0? I���P�q�
$Ԫ���!U�I�	mbQZ��ޝ٦�
+��M����}���Q� U�%P�S�a���Ū�J���ivO�
�����1 
u�����yz
E����0"�N�⡘e�����.:Z�>
+訲�:�0�4�²��׽�S8�����k��&�@9���-����g
�|�F�q[Y��u�d���G�*�7M
��=+�1`lBj~�d��O&���7�/�{�r�[M�/��
�&�-�I)��Z=Mv�S�*��:&���QTVS2�F|���� M�����q��P6��
���|
��x�{���O��v����
oV��.a��)ț���`��I���
�Y������g��
������%�6�۽��G�PQ��2
oօ����u-�iN��W��O��#dG'_~�n"粪֗�͢���j0�d���o���7`��pй�� �
�~�
+endstream
+endobj
+8204 0 obj <<
+/Type /Page
+/Contents 8205 0 R
+/Resources 8203 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8167 0 R
+/Annots [ 8168 0 R 8169 0 R 8170 0 R 8171 0 R 8172 0 R 8173 0 R 8174 0 R 8175 0 R 8176 0 R 8177 0 R 8178 0 R 8179 0 R 8180 0 R 8181 0 R 8182 0 R 8183 0 R 8184 0 R 8185 0 R 8186 0 R 8187 0 R 8188 0 R 8189 0 R 8190 0 R 8191 0 R 8192 0 R 8193 0 R 8194 0 R 8195 0 R 8196 0 R 8197 0 R 8198 0 R 8199 0 R 8200 0 R 8202 0 R ]
+>> endobj
+8168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 497.506 190.054 508.41]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
+>> endobj
+8169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.87 497.506 255.627 508.41]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+8170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 469.764 190.054 480.668]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a558bee1e7045c2ed558e68002cb3dd4f) >>
+>> endobj
+8171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.391 469.764 259.214 480.668]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.425 469.764 339.183 480.668]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+8173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 442.023 190.054 452.927]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aed024de0dc1ad69e380f706d25740cb0) >>
+>> endobj
+8174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.391 442.023 293.535 452.927]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 429.148 190.054 440.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_acea4ab79eb91ca6bad6a126f08de1cc5) >>
+>> endobj
+8176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.391 429.148 293.535 440.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.622 429.148 377.379 440.052]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+8178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 401.407 197.803 412.311]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a6135986b7669c295a1855279a9347433) >>
+>> endobj
+8179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 373.665 190.054 384.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.794 373.665 241.6 384.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a804b0e848b19f18d99664d5bbd57a3f1) >>
+>> endobj
+8181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.937 373.665 345.081 384.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 345.924 175.668 356.828]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+8183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 345.924 234.596 356.828]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_acb15b3a65e5dba1c113539f2912c75f8) >>
+>> endobj
+8184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 318.182 208.395 329.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a92ed2a28d3c4689eec62eae04cdc2520) >>
+>> endobj
+8185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 318.182 273.968 329.086]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+8186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 290.441 179.554 301.345]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 290.441 250.666 301.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aaf6afcf59d181946f02b27418d9b651a) >>
+>> endobj
+8188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 262.7 220.579 273.604]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7bda239eefab2b9cc9cabc123bbaef31) >>
+>> endobj
+8189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 262.7 290.038 273.604]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 235.332 155.265 245.862]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aa33b89d7143376193110dde339707b0d) >>
+>> endobj
+8191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 207.217 158.044 218.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_acce6ad80815e7d09970ed92968967585) >>
+>> endobj
+8192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.382 207.217 227.204 218.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 179.475 158.044 190.379]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a9eef881b5ea4e9dae4b2ff713a43af79) >>
+>> endobj
+8194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.86 179.475 203.683 190.379]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.894 179.475 281.839 190.379]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+8196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 140.775 161.013 151.679]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3) >>
+>> endobj
+8197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 113.034 170.687 123.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 113.034 195.165 123.937]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a2b29f5668213f9171cfdc666ef4142ea) >>
+>> endobj
+8199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.707 170.687 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 74.707 187.563 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ab174d3f8d008aca83801ae0de294528d) >>
+>> endobj
+8202 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8206 0 obj <<
+/D [8204 0 R /XYZ 89 770.89 null]
+>> endobj
+1859 0 obj <<
+/D [8204 0 R /XYZ 90 621.644 null]
+>> endobj
+326 0 obj <<
+/D [8204 0 R /XYZ 90 614.806 null]
+>> endobj
+8207 0 obj <<
+/D [8204 0 R /XYZ 90 516.422 null]
+>> endobj
+8208 0 obj <<
+/D [8204 0 R /XYZ 90 516.422 null]
+>> endobj
+8209 0 obj <<
+/D [8204 0 R /XYZ 90 486.947 null]
+>> endobj
+8210 0 obj <<
+/D [8204 0 R /XYZ 90 446.008 null]
+>> endobj
+8211 0 obj <<
+/D [8204 0 R /XYZ 90 418.59 null]
+>> endobj
+8212 0 obj <<
+/D [8204 0 R /XYZ 90 392.574 null]
+>> endobj
+8213 0 obj <<
+/D [8204 0 R /XYZ 90 363.107 null]
+>> endobj
+8214 0 obj <<
+/D [8204 0 R /XYZ 90 335.365 null]
+>> endobj
+8215 0 obj <<
+/D [8204 0 R /XYZ 90 307.624 null]
+>> endobj
+8216 0 obj <<
+/D [8204 0 R /XYZ 90 279.882 null]
+>> endobj
+8217 0 obj <<
+/D [8204 0 R /XYZ 90 252.141 null]
+>> endobj
+8218 0 obj <<
+/D [8204 0 R /XYZ 90 224.399 null]
+>> endobj
+8219 0 obj <<
+/D [8204 0 R /XYZ 90 196.658 null]
+>> endobj
+8220 0 obj <<
+/D [8204 0 R /XYZ 90 159.684 null]
+>> endobj
+8221 0 obj <<
+/D [8204 0 R /XYZ 90 130.216 null]
+>> endobj
+8222 0 obj <<
+/D [8204 0 R /XYZ 90 91.516 null]
+>> endobj
+8203 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8256 0 obj <<
+/Length 2061      
+/Filter /FlateDecode
+>>
+stream
+x��]s�6�ݿ�O9j&�~�ӗ\r�MS_�>$

LA[~� 㨿��/��hI���݃
\,�{Kag�`����]\^Ǿ��4�"�n�؉��<͝�.�(H&S�1vo&��-��f�a�.�+6o��]~��v}u�=�XKE��n�\�r2�B�.(�z��-X;!�˪�I�~
�^�N~����_w\�
;D��8q����ؙ��F~�8
+�tχ�pn/�}�
K��b1
�X��"�R�'&����D�V�H�bz�P.��4e�\�du��,��Е�N!.R��/�#<����PxΔ�����O�nmr>NC�}]f]J�]q|P�����'W?������mK=i��){�b����F�B��(vēW� ��i��Jh�N��5 �����c�'H(9,������a)Q���lޕ��J����M-�\^�E
6�J��)x.�WWk[
��>��� �J#}u���[=բm��Y%@���a�
�	
+��hP�?F 0�`��*�#�y���tD����0>��ϥM%ך��Qu^�I�#����h6>A��i�%I�b��3�i��x^��G�z"0;�
}G�5�y$yr�x^-�Ёڢ�?�nt�5\�C�}���R��n�D��':7 �4>W2ӎ]�t~б���:kxGIg���h'A����}D��KǞ��ҀҺt�=�� &����FS1�26�+��2̛`���A�|a��{��s����r6�>�P���HS?�P�	����Z�Պ�9y���!��'�/�F���׊�cG
�V0��2���+^�2� 
��.h�GQ�`ǃb�}����<c���9�u�K%+�v=���l&�
;�K',A��ٛW����e�o�KiE�Q���j�T�l��Q�n^fY��lnw�u0� H�y��ߏ��3+W���T�:�zŖ���n����$�I�+ϏP��|�P��GK�G��{��
/��E��}��h�"r�
�V�~��j
�¹?n=V,!?�Q!�Bɧ
�d��%!�M	$$�R�nen���Ľ��'�[�ǟXyw}5��L�p��P�L�@�����a������2�KVq8�	�_f�������s�8;/;S�)"&�|�v�a����N�c��jEMqJ2~BK�[�O���EN
�/�=�]�g��v�F����������ur^���'h|�&Y�p|ş����κ*�x!��[9��`LX�䃾-�.(�2�@u
+������
+�R��YS�=|��c����[��+�P�£�y�0X\wC��B���F]Q�K�3��4��}�s��L��U��G}m�}uX��7~2�py������<�4d��N��������T6��tˎ�D�]H1|m'�,e�3q_^�A����t��ug��dp�@4N;�2�"�#�A��A�
�Y�7b��;��|����~����|�4%��&b��q:M���7�	3��>�1
T:< 4 9*4�ɹFG�`��G)jamC�Kٹ!n�RS�n+�B�
h��Ͽ�)�Nh$�s�ǂ�;mE^1���m�ZOcW�#I�g[a0Ɋ�w*��ki8�-���ˊU�U^q�
+�a�F
�Y�%^
�%gε�0��aޫz���<�Q׉��	-��n���o
�c�k�j�ܢ>��D��m�� �1��Y�3U�ك�M�4D~�aTZ��dS�-��G����U��6����ʳ���f�d�z*$��ԫTU]MYو�~l��jŁD�3�����v�Y,��k�X�Õ��P	`�'ș\�(��h���!F�2D�jڰ���ࡷN�W���5Mm���io�;�7�*N�iX�/��<o٦|�3� E}�m�
�L[
���E�b�B�� (�^J�
���3z���Ejթ�s���?#�<ժ?�g���_n��(�%ܝ%��杞�b�?d��p��:ˏԇv�vs�%�4-Kld��y��I��cg?�h�[=����5+!�����n�Y�DY]��/PC�}���M[�m߹��R}�@�GV�!&(�*�H�dSL��Sùzi7��˷�IAț_k����I
+endstream
+endobj
+8255 0 obj <<
+/Type /Page
+/Contents 8256 0 R
+/Resources 8254 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8167 0 R
+/Annots [ 8201 0 R 8224 0 R 8225 0 R 8226 0 R 8227 0 R 8228 0 R 8229 0 R 8230 0 R 8231 0 R 8232 0 R 8233 0 R 8234 0 R 8235 0 R 8236 0 R 8237 0 R 8238 0 R 8239 0 R 8240 0 R 8241 0 R 8242 0 R 8243 0 R 8244 0 R 8245 0 R 8246 0 R 8247 0 R 8248 0 R 8249 0 R 8250 0 R 8251 0 R 8252 0 R 8253 0 R ]
+>> endobj
+8201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 695.703 150.493 706.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a6b57cf93153051d3aa63c33e34ee4127) >>
+>> endobj
+8224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 668.082 181.845 678.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a9fe4a78fa5899317f5a060d7b607b5c1) >>
+>> endobj
+8225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 640.835 181.845 651.739]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) >>
+>> endobj
+8226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 613.587 154.727 624.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a25fce97f25e1814c62ec46b7a04ee942) >>
+>> endobj
+8227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 586.713 176.505 597.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a37abf9e26c109cf608ec7829284883ec) >>
+>> endobj
+8228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 572.043 450.955 581.948]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) >>
+>> endobj
+8229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 548.133 191.718 559.037]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+8230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 548.133 288.852 559.037]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ab0063024b3761b3ff89c3f259ebac6fe) >>
+>> endobj
+8231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 520.886 191.718 531.79]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+8232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 520.886 303.079 531.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7072dc2f1979eb1198aea49e10bcd59d) >>
+>> endobj
+8233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 493.638 169.013 504.542]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ab9156785517cdd6c775b365ea12d2d18) >>
+>> endobj
+8234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 493.638 248.973 504.542]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 424.774 203.075 435.678]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 424.774 296.324 435.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_ad53075833d1bde0c9e36dd70afb4b967) >>
+>> endobj
+8237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 410.477 345.599 420.383]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 397.9 194.297 408.43]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a071ec60375df0a0f5051dc431f445e37) >>
+>> endobj
+8239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 370.653 188.759 381.183]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a02b52b4ef5b1806566495cb7b6d35abb) >>
+>> endobj
+8240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 343.032 237.097 353.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.836 343.032 309.903 353.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a6e9c19c25562f9d1a71523d00b337450) >>
+>> endobj
+8242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.965 328.735 398.006 338.64]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
+>> endobj
+8243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 247.861 226.034 258.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_adcd147a1c5474a820c7379514f629fda) >>
+>> endobj
+8244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 247.861 397.32 258.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 220.613 156.281 231.517]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_afb150cd8c06fd986b4b57ffe29bc871e) >>
+>> endobj
+8246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 220.613 236.24 231.517]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.452 220.613 330.596 231.517]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 207.986 156.281 218.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_afb150cd8c06fd986b4b57ffe29bc871e) >>
+>> endobj
+8249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 207.986 236.24 218.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.452 207.986 330.596 218.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.27 134.109 256.414 145.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 122.154 130.826 133.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8253 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8257 0 obj <<
+/D [8255 0 R /XYZ 89 770.89 null]
+>> endobj
+8258 0 obj <<
+/D [8255 0 R /XYZ 90 712.265 null]
+>> endobj
+8259 0 obj <<
+/D [8255 0 R /XYZ 90 685.018 null]
+>> endobj
+8260 0 obj <<
+/D [8255 0 R /XYZ 90 657.77 null]
+>> endobj
+8261 0 obj <<
+/D [8255 0 R /XYZ 90 630.523 null]
+>> endobj
+8262 0 obj <<
+/D [8255 0 R /XYZ 90 565.069 null]
+>> endobj
+8263 0 obj <<
+/D [8255 0 R /XYZ 90 537.821 null]
+>> endobj
+8264 0 obj <<
+/D [8255 0 R /XYZ 90 510.574 null]
+>> endobj
+8265 0 obj <<
+/D [8255 0 R /XYZ 90 443.359 null]
+>> endobj
+8266 0 obj <<
+/D [8255 0 R /XYZ 90 443.359 null]
+>> endobj
+8267 0 obj <<
+/D [8255 0 R /XYZ 90 414.462 null]
+>> endobj
+8268 0 obj <<
+/D [8255 0 R /XYZ 90 388.286 null]
+>> endobj
+8269 0 obj <<
+/D [8255 0 R /XYZ 90 361.039 null]
+>> endobj
+8270 0 obj <<
+/D [8255 0 R /XYZ 90 292.837 null]
+>> endobj
+8271 0 obj <<
+/D [8255 0 R /XYZ 90 194.703 null]
+>> endobj
+8254 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8283 0 obj <<
+/Length 2095      
+/Filter /FlateDecode
+>>
+stream
+x��Y[w�~���[�t�B�`�Ԥ�=�m����nN,��ԒTl��n$HQ�֎�����`.�
F8ZE8zs������)�2�%4��o�
Gi�!��[
������6b�@$K`����_o�_�����.^__|� �	G�2�(�r{��W
�0�m��Dtg��QL<7���O���=�z�o��
HLp�R¢3Db+�7�|A9����ڵ�5'|v/���j�LѺ�{�M�ߪܯ���s�g�.�^	���P
��Xp��{K2�T�8�@����4�4�2�ݱr�
cZz��;�m��TZ��sc��:��	�R&4��Q0������ݱ����{�1���

-R`0E��IIGz�ė_g$8���
da(���}mM��bF�
e��
F�Y&��	c�Z�r���ٲ��G��ƾ�vQ<���X�9�pk�Fn=��V˶�J�*K�)�IIxb*��I��&
��/�pZ�R���D��nZK�[��4�ZЌ�
��	�8�9j3�H(��0�� [...]
+�ڬ̓��N.���}՟��xQ��0\
����X����8�� R&��`��("‡��0�*��B�b����+��M�o��l�%T
+n*�}ޗ����骛V��^6���V�����?��I]�
1"���E���lkٴ:�0:+n��\�� ��D�q�5�r�Xyws*�or���W�{v&(oI�_�Y��a��5Pm��U/�D�
8#�OG�`l�mmD�
Q�#�]��~�
Y��rcm,�q�8���]���!H��%c��|�y�|�|���@��e��|�
�� �g���ԟ�L��`'tV=
+�BTd/
K��tnUK2���(k�s��G�F�Ծ����PK{aQ{Ă�6�2��7E[h|�Y(?S�D\201}�EĨ
+>Z�RP���N��G�'/Q��
�U�)\�1}n��uo�
��j�޳�����@Ֆ˕����[������q����!�b�
����	�B�p�C�/B}�g�	&���.|
��j�Nc0�P=�[�C=���4
�
t{���*
N�t� ,t�л���q��	��I�q��7|(h�0gh$B&�H�{`�Iߥ� ��J����.�<�5C���a������/��ع�L%��0ae]����YX�X�
�d#X�\����vdt��[��s�<�9A�釽�2d���§� O�F��D&���[��"�U�5'����z�
�O�j<��HjSQ��i�<'Ӹ�L��b��RLrJNv �t>B���}
+�?
�|�
�}ӵ�����׮�l���z��;k
+Y��}O��Kfg�������C߻U]��������DpW=�4��F�s" �}���)'�.�̠(����
�7���Upa(-OX�
*��]!���Q�1�g��h=�,q��; �[վ�3��Bh��	���Z���2�n���iؙ���_	E�ݞ�,ct�Z`�X�-Sw�ݾ�+�r�'�+H��
e�԰��@��L��N��^�V9z���a����z��Ж�%�XC����9����
A�Mv
n���}�(�}t{b$�9���Ȋ��deE�g��wBQ
+Y�����1`sf�6� VS�1
��~����fˢV��g� ~�����
.�I�?�9\���t�H����������
@Ͼ� ˽t�k�[خ��'9�Uh-��z �\)��ee���;
=�L)����v�����~ըr���|F�2�v]Ѯ�V��_�0�{�U���|��
+endstream
+endobj
+8282 0 obj <<
+/Type /Page
+/Contents 8283 0 R
+/Resources 8281 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8167 0 R
+/Annots [ 8275 0 R 8276 0 R 8277 0 R 8278 0 R 8280 0 R ]
+>> endobj
+8275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 604.695 175.659 611.914]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
+>> endobj
+8276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 389.924 175.659 397.143]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
+>> endobj
+8277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 232.076 175.659 239.295]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
+>> endobj
+8278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 116.341 175.659 123.56]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
+>> endobj
+8280 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8284 0 obj <<
+/D [8282 0 R /XYZ 89 770.89 null]
+>> endobj
+8281 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F11 621 0 R /F32 772 0 R /F7 803 0 R /F8 802 0 R /F24 537 0 R /F1 834 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8290 0 obj <<
+/Length 2567      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s۸�_���
�Z0����&�\sM�Ӈ\ƥ%X�"~�q��.>H���wj�:�
@\,���-h
�"
�t�竓�
Ţ%����6Jp�x����e�1&�d6'�����8������q�?ܙe�^��n��z8?���J�����P7f}�(����?:�S��WyZ׾{inM5#:6����L+SIf��~>�����	-qD�V)
-�'?�h	�?G�DG�n�:�A�GN�v���Qa��	�N�`�:A�H��w���t��A-Ju,�N�R�.$
!)�Ds�f^�՝ݗ$�m��匊�>+VvNjr~���l�|Y���75qFb����oW����Ծ������s*���2+�Nl��3��*}�I�Z�kP��L�)�e�D����Î焠D���4���M�m�af��uv���$�J^���K?CE%�i;A!���!I�X��

�e4L�
�X�څ�t
zi������m���������m��V���A�'���d�
+�yi
A����!N�\1
<a76F���s	����YZ�0��FYQ����v�i;�MT�a!D���7��<ڎ~�9���4�d�]1x������Y(@��ߢ"�֑L)I��$�Z�ߦ&8�m¢sߌ�<�
;�1�ž	pP��k٘�@��������c,���x���7�6o��4����#Xp�^�۟��w~��ِ����Vq|�(��6�Ң1&Hn�Ұvb
0s�'�9�zc��k�h&{��
!ˢ�X{���a϶��
V��e�Ѝ�me ��E�/3"b�<��D8�����S���ȃ�I�I
�I���6��榘ҟ38>�M
��J����Y�{�;�=h[��,Oor��wg�\�r���c�U�ʊ4�x5<t��N|'$g?rcL�{�)�%��<�ץ���mpd�[Ȅ���
+��&�i
;��m�L
���i����PRR0�E�l	�F4P�W��E0��_���.��,m��8�j)������)���s"�d	,���	Jzj�O>���	
�8ҁw��1
+
kFH�Y־S��>��J j��'u�����nB
���
A
�au2���ʃ
+0
�c(�D~2� 8
�
�ٜK�iB 3C�,����R�.��Nz y�g1�H	IB�1
��	i�#�T'͆_�Q
'٤ɻI�"�
+�i#�(-���4���!����'��xS�=���(D� Y��W
�*
T߇%w�p!;�[|��	�:	w�2`�=*�(�?W��O@(<�M,`�/f}c�\��",�ш�htS���x��F��ZF��L�Zq'J�g %Hp~
�U�`l�“�	R9�GЃ�d[#=:tJ�E�M!�,\
ey!�dr�|^�K�����fy~�A�t�e�	P� ��m
+K� �bJ
Eɐr9�����
/�oU�'����f��H2�����>���ë7o|w/�a�Z#

o�r�.
�������-�A^/����p�,�-_88!=��(���l��
vDG�)D	ߚ�)ˀC�nNs�Փ�9�SJƉ!]@!oK���{/M�VE=����_�j��JT"�{J��º],L]߶���
\�{�m��S�M\�J�
j��RD�%���
^�:���E���5E)� _��+�
�cxnkWJ���=�E�z�"�+UF��BgQ����K?���prȻԦ}��T9q���r�"k�4o�مA��[6��>^�/5L���)B�+�Ϛ�J��e�/�F�|�1E7���Sŀ��om�?��TT��
��/�� ?�
/�,
� �,4^�
,�<~Z�}Z
�HV�U%J��f��,S+��_�&��):��$
����֛�x`m�o��tj���x���,�sX-L�Y�Fr��i2k�<��w�H�H�X�C?�j9�e{3�RV��y�6��	�ӝ����
��pC��*��6 	�e��SL
@u�Q����
+$�����
P�ج7M����]����b��k���T� ��v83k���xicȕ���+
i_
ޗ?�!4�8ut���
�{X6 �x
d�l��E�GM�
�z_	$�&�,߅���V
yN��%�K��,`Nm��}�0��K��3��mH>aD�>��tbQ0����U
��y%�d4N
JxI�qpw���N��s�㬣�Q��d�Jq��w?�d�w,��ݷ�����]a:z2�/;���E'���^Y�
+�ep�_)���h�����c�၌��� �YЦSX�6J��uD0�M
�
+��V{��@"aM8H��~ƅ#p��@�/�
���ޖ=�(�0�!U2Vdp�4.�ed�q�i�c�mi9^�� �#�����;�?�B��}�w��v�bS����'vD�_]y1�:��:���[>�F���y���̞���.��WR��w\!��
@z������6���
+��%-��+�MaCu�[�Me���P�0�
������_��:D�\�󟻦ٜ��ݴ��+�(���1�
���������p�0�v�:o�l)��L�Y
�`
��
��ݏ݋a��͚E�K0���0���hx
+endstream
+endobj
+8289 0 obj <<
+/Type /Page
+/Contents 8290 0 R
+/Resources 8288 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8167 0 R
+/Annots [ 8279 0 R 8285 0 R 8286 0 R 8287 0 R ]
+>> endobj
+8279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 661.542 175.659 668.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d) >>
+>> endobj
+8285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.892 467.645 312.036 478.549]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.804 388.256 445.257 399.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) >>
+>> endobj
+8287 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8291 0 obj <<
+/D [8289 0 R /XYZ 89 770.89 null]
+>> endobj
+8292 0 obj <<
+/D [8289 0 R /XYZ 90 544.8 null]
+>> endobj
+8223 0 obj <<
+/D [8289 0 R /XYZ 90 522.3 null]
+>> endobj
+8293 0 obj <<
+/D [8289 0 R /XYZ 90 522.3 null]
+>> endobj
+8294 0 obj <<
+/D [8289 0 R /XYZ 90 453.456 null]
+>> endobj
+8272 0 obj <<
+/D [8289 0 R /XYZ 90 430.956 null]
+>> endobj
+8295 0 obj <<
+/D [8289 0 R /XYZ 90 430.956 null]
+>> endobj
+8296 0 obj <<
+/D [8289 0 R /XYZ 90 332.532 null]
+>> endobj
+8273 0 obj <<
+/D [8289 0 R /XYZ 90 310.033 null]
+>> endobj
+8297 0 obj <<
+/D [8289 0 R /XYZ 90 310.033 null]
+>> endobj
+8274 0 obj <<
+/D [8289 0 R /XYZ 121.143 228.95 null]
+>> endobj
+8298 0 obj <<
+/D [8289 0 R /XYZ 90 222.31 null]
+>> endobj
+8299 0 obj <<
+/D [8289 0 R /XYZ 90 200.263 null]
+>> endobj
+1860 0 obj <<
+/D [8289 0 R /XYZ 90 126.36 null]
+>> endobj
+330 0 obj <<
+/D [8289 0 R /XYZ 90 119.418 null]
+>> endobj
+8288 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F32 772 0 R /F7 803 0 R /F75 562 0 R /F94 771 0 R /F118 2438 0 R /F24 537 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8323 0 obj <<
+/Length 1725      
+/Filter /FlateDecode
+>>
+stream
+x��Y�s�6�~��3����$�C`�6���H��0���s볍�+��ʒ�����@��~H�V���o_2֖��&?�&GO\S��PG�-4k��#ہ_��F����=�L�C�w`U=�˫���/g|n�x6y?!0�5"����p=y�k
?�02}O�P�5���L���oܓ�
�B"D��C���&b|ϣ'0�R�&r���DP�x����y�V�>��<�n�

+
+w(
�E��A\�PK>MW���rjP�qŊ�ʊ�AΖ�=�#j*A�*:>^dŇ)�zPD�
��*X�۝�T�ga]��Uŋ)���e%��,-��Z 8F+ �)r��o16G���f�����&<��~M�,�j��nl��8��]��E<a��IӜo�SWO�D�������O6iX� ��-a�<�vq�ez�AMx�R9�ڃ����t��g�a�B./�ʊ�/ke]v����������Gv��@8Ǫm&�8&md�R�S�6IձM�	�^��F��G5;8�g��Y|���
������t(�߫bj�z�Aq�(2��E�|����k�x��(��ʸ� O��}�@;��,K�+@*
�QY��t�R���Sb��g���a��O9�
�?����IK�N9ڥ-�Dt'M]C���P�
�j
�B>Ӑ}�j(ѵ�IȈ���nm*#Q�c%��X�ľ3��j��7�
E��7��4���B��&��{�~A;}�ux�5��s�3��(��4c_7�|
�@iqZ�HoSv)��W�T�<˒k�o��>ͩ�t��U�B�<���1U3����<�GtT��)H#i�4��
L���묶\�Qg�-�
b!�$U�������0"<�)��6��TA9P��G��8
���"����|i|��_�q|�����Ӝ��(�5�P X>�
;eU',�94a�A�c
q�B���b8
�������T �,j�I"i�e���>ߡ{���,G �l=.�ܦ�#U&F�B� �)
+D���a�J��YÂpJ����ܨ��AWi�M���@>���l���V���NK�o�nL�����k��1�}�2�A.����u��kݻx��>,��b�l%��Ȓ$�\�t�D�HN��ty#W5+�ۻ?��Yr�bQ!�8�W���LOջ�j�NO(T�
�
̂8��P�ZⰙ�|��DI�cdB�lp��T0܎z`Zg�v:����R<�G�B�
+��ti��������� ��a�
�9o�n(����w8eܓiY�9[�i#�=q
�
+���vY^2
`�Ka�=G��
E×ɹ�ø)�@�6"��nf�J���R�vQi���q
����X����ar�Bق4L���s�;�x��׹��	��M:W!��;Y�TR
c�xd����TN��.X I�������l���7v|zR#p��P�C�^+��(�
�BfS�k�*"���'�~�V'�+S����}dQ��
+mliI,�=��ӻ� �V��j
<�D�_ >
ae��%A�^e0-k���a��U|�({��ڢ����Df�%���V����K�����~xr���y�O��P}�~���==L����[�}�'�5r�����N3`ֲ3���2�?k�m:��U�O�M��9?.^~/Y��Զu��A�	����e9S*D�y
hj�`�
֤X!۟J�_�ovdr��T�������h�Y�,]�0[o�`�b�G�Ue�RV��5��ЀP��
+endstream
+endobj
+8322 0 obj <<
+/Type /Page
+/Contents 8323 0 R
+/Resources 8321 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8167 0 R
+/Annots [ 8300 0 R 8301 0 R 8302 0 R 8303 0 R 8304 0 R 8305 0 R 8306 0 R 8307 0 R 8308 0 R 8309 0 R 8310 0 R 8311 0 R 8312 0 R 8313 0 R 8314 0 R 8315 0 R 8316 0 R 8317 0 R 8318 0 R 8319 0 R 8337 0 R 8320 0 R ]
+>> endobj
+8300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 633.502 249.819 644.405]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_acd703faaddfab4f29bdd2958b4a9d1c3) >>
+>> endobj
+8301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 604.54 249.819 615.444]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a94534f2d8132436533398ce6cdca13c8) >>
+>> endobj
+8302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.156 604.54 413.065 615.444]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 575.579 257.568 586.483]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a8ba666eb5beace7b116d9f9e16e9a742) >>
+>> endobj
+8304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 546.618 249.819 557.522]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.559 546.618 301.365 557.522]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ae23adcce73c0875e8a7dc6b3797e57ac) >>
+>> endobj
+8306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.702 546.618 464.611 557.522]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 517.657 179.255 528.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.994 517.657 230.163 528.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a7ec7cf59ce4c8e5902704637c02f39bd) >>
+>> endobj
+8309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 488.696 179.255 499.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.225 488.696 233.28 499.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a76aee99fe2a1984162c8efbf867a97b2) >>
+>> endobj
+8311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 459.735 249.819 470.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.559 459.735 306.984 470.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ad21fe8d252487a1df3b3c90f94fbcfb0) >>
+>> endobj
+8313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 430.774 249.819 441.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.317 430.774 296.743 441.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_aff430afd2381244ef77bb37670ce5627) >>
+>> endobj
+8315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 401.813 180.54 412.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a71f52ba9ef61e0f336d025241003646c) >>
+>> endobj
+8316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 401.813 343.786 412.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 372.851 178.239 383.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a53db1aeb67216c949d1aa627299ab5bf) >>
+>> endobj
+8318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 372.851 341.484 383.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System__const__iterator) >>
+>> endobj
+8319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.856 281.768 513.996 292.672]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 269.813 125.317 280.717]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+8320 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8324 0 obj <<
+/D [8322 0 R /XYZ 89 770.89 null]
+>> endobj
+8325 0 obj <<
+/D [8322 0 R /XYZ 90 653.028 null]
+>> endobj
+8326 0 obj <<
+/D [8322 0 R /XYZ 90 653.028 null]
+>> endobj
+8327 0 obj <<
+/D [8322 0 R /XYZ 90 622.333 null]
+>> endobj
+8328 0 obj <<
+/D [8322 0 R /XYZ 90 593.372 null]
+>> endobj
+8329 0 obj <<
+/D [8322 0 R /XYZ 90 566.137 null]
+>> endobj
+8330 0 obj <<
+/D [8322 0 R /XYZ 90 535.45 null]
+>> endobj
+8331 0 obj <<
+/D [8322 0 R /XYZ 90 506.488 null]
+>> endobj
+8332 0 obj <<
+/D [8322 0 R /XYZ 90 479.253 null]
+>> endobj
+8333 0 obj <<
+/D [8322 0 R /XYZ 90 448.566 null]
+>> endobj
+8334 0 obj <<
+/D [8322 0 R /XYZ 90 419.605 null]
+>> endobj
+8335 0 obj <<
+/D [8322 0 R /XYZ 90 390.644 null]
+>> endobj
+8336 0 obj <<
+/D [8322 0 R /XYZ 90 342.925 null]
+>> endobj
+1861 0 obj <<
+/D [8322 0 R /XYZ 90 68.983 null]
+>> endobj
+8321 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F11 621 0 R /F60 540 0 R /F24 537 0 R /F91 766 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8399 0 obj <<
+/Length 1751      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�6��_!`@'c5CR"%ۀ�]�v햵駶0d���ɒ#�N�_�#)�r�(�.n�)�x:�=��[S
[���
��y���Sn��Z�<7@��Sl��	F
Gcl	��b
����y����ǯ�I�G���>
��*1�pD���aY��q
+o�o�,���4�)w�O^~?�
��-�M`��h>x�[1�~ia��u���K
(S�����{�e�*��o�Ac�t
	i�uU߮�CG�﫦��r�]-���
3��g	��C��@��p?P�s�n�
��ȷu[
�\� (�X�����@#���C�
p�
+�z�4̄���
䎈�􎨋|�Պ�e�|��"� L�;C�l h
˰.E.�X%��Z��L�t����C�l$-
+��!L�*~H�(]�BKB����A
xk��[ty�h��f-z
�|Όد�K;dP1h�*�K�5r\Ľ:oDV����g�,��<+�\�w��3�g^	㷰�x��_�E]���Ϲ�OL�85E���|yk�N�"."�bD9�A��
G�(˼ֹWG��\�:�yPw�R���z?b�("PeL_\��m�{P�K�Ӛ8oTC�7� v>^
)��t)�j�B҅�
��L���ܦ��E�����U|���@
���`�Z��.=/�PR&tY����_���^���l����
IL�W��&Ӎ�ޘI��[��"s���	���x7r8RF4@��k�I5��*��ʿ���ؗz^wPWjґ����t
��d�
`$+��M��tN�
�I�ZbG�
^�H�ZY���t��%
 B�~\: �?l&��N�냊↭�(�7�i�z��7��-�r6��n<#�;}"���#��y�4s�=�����Ž�]P�-�
��8��#A��#&
+1��0!�W���<L����<L�<m��9\������j�s�. �0Y�j���M/.?
�{��^3�4��Q|�(�j��0��(��
b~���{|���U
̋�~%�޲���į��Eu���g�X*�0��
���Q����K�[�/e;���徊C�ꍵ;��xjr���Jl��?y�߆�~�1��G��̍�ے�|�V�"�T̐�z���x��z�c��=z�+�'zM�
��V�C��E
TH�
y���9����Ӧ���� U��x���rr�o��o��T�4_+Z��4�qx�+u�
�ܻ�m��(�~s���
�
�ͦ�x
�J8�70��aa�)�F
�=���^�8�n�{�
0LG�ib��cwD*�¸}QG*���������1��}o
y�k��Y��͢X�mz(�t�=���ϭ4r)r\��yt�̫D�_۶m=j�k/�H��Z��<��#�L�ϊ��?�"_:����<[�zG�
2����
tE
�=
`qQ�Z���h��ҷ��).r��]J�](��VB�Y�K=�R��'j��u^�e�Փ9��j,"��E xT)ڝ���hͷT�4���7�NImv���ښjf��@��o�[J҆Zj{|�h�fш:�E5�(`�'��#�BD�?�zȮ��_��́���*���
+Dhp
+[�����!���+]yW��GiG�^��vR
�ę(�AdQ_"
��
��V�+k��,S�c�.�6#����U�����d9-E6EQ>�N�F_����Ss�3ϋM&����$��%$B�kX{
z6����� ~����4�_
��;��
�����/t�H
+endstream
+endobj
+8398 0 obj <<
+/Type /Page
+/Contents 8399 0 R
+/Resources 8397 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8403 0 R
+/Annots [ 8338 0 R 8339 0 R 8340 0 R 8341 0 R 8342 0 R 8343 0 R 8344 0 R 8345 0 R 8346 0 R 8347 0 R 8348 0 R 8349 0 R 8350 0 R 8351 0 R 8352 0 R 8353 0 R 8354 0 R 8355 0 R 8356 0 R 8357 0 R 8358 0 R 8359 0 R 8360 0 R 8361 0 R 8362 0 R 8363 0 R 8364 0 R 8365 0 R 8366 0 R 8367 0 R 8368 0 R 8369 0 R 8370 0 R 8371 0 R 8372 0 R 8373 0 R 8374 0 R 8375 0 R 8376 0 R 8377 0 R 8378 0 R 8379 0 R 8380 0 R 8381 0 R 8382 0 R 8383 0 R 8384 0 R 8385 0 R 8386 0 R 8387 0 R 8388 0 R 8389 0 R 8390 0 R 8391  [...]
+>> endobj
+8338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.852 554.608 245.94 565.512]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a6e613e3f02e896503d38da788ad593b8) >>
+>> endobj
+8339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.277 554.608 329.905 565.512]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.331 529.597 222.419 540.501]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_ab8dbbfce1fd68d57df6b05d5cc74c012) >>
+>> endobj
+8341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.234 529.597 282.862 540.501]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 462.187 191.216 473.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a9a22818e12d0abab8d8a8e0d3346f51a) >>
+>> endobj
+8343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.032 462.187 251.659 473.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 437.176 191.216 448.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_acf54a358f4ddf09f56364da87de68a49) >>
+>> endobj
+8345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.032 437.176 251.659 448.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.392 437.176 350.02 448.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 412.165 190.26 423.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a4039bbdc92a28fade431cb98f20b0fa6) >>
+>> endobj
+8348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.075 412.165 250.703 423.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 387.154 190.26 398.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a11810ad660a4aa63766e8ebb0334b7d6) >>
+>> endobj
+8350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.075 387.154 250.703 398.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.436 387.154 349.063 398.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 362.143 192.471 373.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a29b14636d21c90e28ee1821666dc1d64) >>
+>> endobj
+8353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.287 362.143 252.914 373.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.647 362.143 351.275 373.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.36 362.143 448.988 373.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 337.132 191.366 348.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a2f220b5f73e79a2e6feab3a97a7e2445) >>
+>> endobj
+8357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.181 337.132 251.809 348.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.542 337.132 350.169 348.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.255 337.132 447.882 348.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.658 312.121 203.949 323.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a7f9dc23eef0ab2ef9d07f4d53177afce) >>
+>> endobj
+8361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.323 312.121 264.95 323.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.417 312.121 341.045 323.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.406 312.121 416.034 323.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [457.369 312.121 513.996 323.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.682 300.166 222.309 311.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 275.155 191.923 286.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a952922658abcdfb880fcf0a8483c9620) >>
+>> endobj
+8367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.739 275.155 252.366 286.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.099 275.155 350.727 286.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.812 275.155 448.44 286.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 250.144 211.849 261.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a83b02e8cbb5d14a2ebf2843e6551391d) >>
+>> endobj
+8371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.664 250.144 272.292 261.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.025 250.144 370.652 261.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.738 250.144 468.365 261.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 225.132 211.301 236.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a38ab8dc3ca19cacef112ca316bc7ce09) >>
+>> endobj
+8375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.116 225.132 271.744 236.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.477 225.132 370.104 236.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.19 225.132 467.817 236.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 200.121 216.681 211.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a081a1af02e55d9903d0bf3816a6e91f1) >>
+>> endobj
+8379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.496 200.121 277.124 211.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.857 200.121 375.484 211.025]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 175.11 213.662 186.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_abc1d7e892f343522c751d672d5632f17) >>
+>> endobj
+8382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.478 175.11 274.105 186.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.838 175.11 372.465 186.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 150.099 215.316 161.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a01c5bdd401e8bc17ea983d941be2aa49) >>
+>> endobj
+8385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.131 150.099 275.759 161.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.492 150.099 374.119 161.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.205 150.099 471.832 161.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 125.088 191.923 135.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a84565fd9471a52f83618d0d5ce461c3c) >>
+>> endobj
+8389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.739 125.088 252.366 135.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.099 125.088 350.727 135.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 100.077 157.254 110.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer_a6d5c75bcc32f8aea006e8da4b3f736b2) >>
+>> endobj
+8392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.591 100.077 241.218 110.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.951 100.077 339.579 110.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8396 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8400 0 obj <<
+/D [8398 0 R /XYZ 89 770.89 null]
+>> endobj
+334 0 obj <<
+/D [8398 0 R /XYZ 90 721.073 null]
+>> endobj
+8401 0 obj <<
+/D [8398 0 R /XYZ 90 626.65 null]
+>> endobj
+8402 0 obj <<
+/D [8398 0 R /XYZ 90 115.895 null]
+>> endobj
+8397 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F66 3165 0 R /F120 3056 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8423 0 obj <<
+/Length 1892      
+/Filter /FlateDecode
+>>
+stream
+x��ZMs�H��+t�B%���c���MbW�M6�8''��AƪA$����ۣ�A ۇ=I�F=oz^��
������Ο睓S�<����;��
�7HH�5�.�T����7
�#᭬�����_�?�d�u^�w�w<�
qR�L:_�7��7
F�h�G�i�q��:�>u���

FT�[{ɑRCF"�! 	�H�O0�ݗA��`��S��W2��YN�
`1�ɩ�K�ק
+a�f�st9�G�̈��0J�
�Q'��ϯ�xj܄���w�^����w3/c?��I�E9�x����Y�� 
+I�
x���r��
��>â�y׏z�o
�y��4vm
�
+�+��LF��b
'���c?I\׊{�D���gz7
��a�cٹ�è
/kx��k�
��z<7ȟM�*��s�}RqT�+�=��f�i�̤0B��qP,�{���Z� �=���Wܽ��|b�s��N���''��
 �i<:��@��5��sS}� M�2Si���8
�a��<��1�iA��y4ȸ��<
�'A��+t�B��9v"�i���$��j�%f��)i6E/EF�E��F*Qa�3SB94���2O�%�{�t����!���
�1�*hn,<
�/X`����\�,ˢ�1QP���<:kJ�8�_����A`2e�RUt�m0a֋� 
i�d�(HF��"v
��I��T)�����ՏA:��B�ܥ 
���U� ��tZ�:+���.�F+��nz�9;�M�sh���"x��
]
�/SH�qq1�)V�̎�%����!�P
3�
+����|��J��W��Wi�+�!,ۑ��"����H�r��)���\̣`�@�`��
�
�Sl-�Ef���5
E�	"'�� �*u�5E{��?Ypau(�լ�bY#^�(Lsc�cM�b��-��)A�)��2���B����qp�Y� ��r��L9��
��=R��K��#Sy!�5*�F��WG�
,k.��
+��EƳMP��D�չQ!�¿L��B0�q̑�{
��*3���cVң�V�*S��QX��x��o�U=�1G��
&1���9�7�=},z
+ۜG��BO�Pz��jn떃�*gH5��Z

N o�4���J�z��lu�
+
(�%�LQUU �>4ty$��A�e
��m�!�6�A���j��D ����0��!��l��o	�>��A�ڡ�v�
Q���؅0�C[".��Z>C�7a�9Q"Ď�M!m�_t��k4��`5��'
+ȶL�0�Fa
���`yBa�cX�+
va�)�w��0�}��ʂ�J�.��0�ҷQ�[#
+�h�D�K��(
�@�@*�A�ɤ��
L�j {
[��
��H��j���
�mƍGfU�r��۴��͙G�p�귏*h��(�bp���X�
+r��V�+��s�H]*�Fcr��{
/]#.�]����)���
���W�I<D)�,���c��Le�pE�^ݦA�w�ً�Y���M.�Q��(JW6�,u��#[�G�J}�'U}�|�>j�6�ļE�����wX���z�0�_�L,�ڭ��1q�M��
뵟6��aCkn��_3��Y��
�mS^yڄQ.k
�����i4%
<�tM�n�q��h�W�M���AS}��?H
�
 �3��I:3Et}�d����[
�P��l����ߔ�
+}
X3i,M�Bk+��hϥ	0��R.�3��S.=��Dz2��l�鐌�*y�,�pd�k7(ge�~��"WH�,���P�(E������❼����y/�`�4�{��`&0=
ӓ�9@ �D�'��y�:>��n>'A�[O�n΁w~4����*I��A�� P���@[~��=q�~j��j	�ˆ�G���W��QD#<Y%p��1�1vUTb���5-',��.��
+endstream
+endobj
+8422 0 obj <<
+/Type /Page
+/Contents 8423 0 R
+/Resources 8421 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8403 0 R
+/Annots [ 8394 0 R 8395 0 R 8420 0 R ]
+>> endobj
+8394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 663.26 145.631 674.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1GMP__Integer) >>
+>> endobj
+8395 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [179.204 651.927 288.793 662.208]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://gmplib.org/)>>
+>> endobj
+8420 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8424 0 obj <<
+/D [8422 0 R /XYZ 89 770.89 null]
+>> endobj
+8425 0 obj <<
+/D [8422 0 R /XYZ 90 721.073 null]
+>> endobj
+8426 0 obj <<
+/D [8422 0 R /XYZ 90 624.733 null]
+>> endobj
+8404 0 obj <<
+/D [8422 0 R /XYZ 90 599.01 null]
+>> endobj
+8427 0 obj <<
+/D [8422 0 R /XYZ 90 599.01 null]
+>> endobj
+8405 0 obj <<
+/D [8422 0 R /XYZ 90 557.305 null]
+>> endobj
+8428 0 obj <<
+/D [8422 0 R /XYZ 90 552.822 null]
+>> endobj
+8406 0 obj <<
+/D [8422 0 R /XYZ 90 513.09 null]
+>> endobj
+8429 0 obj <<
+/D [8422 0 R /XYZ 90 508.607 null]
+>> endobj
+8407 0 obj <<
+/D [8422 0 R /XYZ 90 468.875 null]
+>> endobj
+8430 0 obj <<
+/D [8422 0 R /XYZ 90 464.392 null]
+>> endobj
+8408 0 obj <<
+/D [8422 0 R /XYZ 90 424.66 null]
+>> endobj
+8431 0 obj <<
+/D [8422 0 R /XYZ 90 420.177 null]
+>> endobj
+8409 0 obj <<
+/D [8422 0 R /XYZ 90 380.445 null]
+>> endobj
+8432 0 obj <<
+/D [8422 0 R /XYZ 90 375.962 null]
+>> endobj
+8410 0 obj <<
+/D [8422 0 R /XYZ 90 336.23 null]
+>> endobj
+8433 0 obj <<
+/D [8422 0 R /XYZ 90 331.747 null]
+>> endobj
+8411 0 obj <<
+/D [8422 0 R /XYZ 90 280.06 null]
+>> endobj
+8434 0 obj <<
+/D [8422 0 R /XYZ 90 275.577 null]
+>> endobj
+8412 0 obj <<
+/D [8422 0 R /XYZ 90 223.889 null]
+>> endobj
+8435 0 obj <<
+/D [8422 0 R /XYZ 90 219.406 null]
+>> endobj
+8413 0 obj <<
+/D [8422 0 R /XYZ 101.557 140.297 null]
+>> endobj
+8436 0 obj <<
+/D [8422 0 R /XYZ 90 135.714 null]
+>> endobj
+8414 0 obj <<
+/D [8422 0 R /XYZ 90 81.969 null]
+>> endobj
+8437 0 obj <<
+/D [8422 0 R /XYZ 90 77.486 null]
+>> endobj
+8421 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8454 0 obj <<
+/Length 2083      
+/Filter /FlateDecode
+>>
+stream
+x��mo�F���W8�%q�z߹4��$H�)\��40hq-
�H������������rs��`���������QLl?^������.Gg�bh�%���M�qs���oi�>$	�	�8<��b�\�G����֤Er���H����_�4S��ϓժ��07���
+M61 I2"C*E�������݈�.8 ���*�,F�?� �� ��V��r�"���<x7�y�;�*�Io1� Bڵ�X��tQ
��T�I�a���)�R��և��H+ݨ����"�h���7sϼ#��I��
qڙ�3�f�����{��@Yn�]>����՛lm���rlgIW�
�U5��5D!7#>=��
mFL�l��hE9�R?�V�¡W3
����F�?<2�Lj��`9-D5�I�r�k\Jy-�}a��ڤʸ�yp�J�m�B#�I A�VՓߖ��{�{f�
��X��
�
+�q���T� 
E��7�#��#J�2������C5
׉]%��a�|&�`5ݳpGQ�t�T٪��G,
3�L��C��Ym���,���GSG��
i>�:�$�Z����Y�B�~F�'�N�N���C� u������:��5�]��� ,y��Z�
�'�२ةEMDH�i�CGRғL�c$�L���>:�SI��ޓJL�c�Q��p��Ө�>a�
�d�x���,[�
Hv���� �����j��
c&(�Lt13� \!n�2!d/A|̈aG ���l�mW(�m�n�	�
+
s3�!I��Lm���`II��
8/n@��س�
��E���އ�0�p�b�H�0��(E	u�-v��N2������-\�w6
�b%�eq,�¥��!�HyR��Api�m�E��`���q�@$�

���	.�/v��J)��� �`h����`$�29��}E��HR��\V�#@+�S��~tAsBA�SL
+�	�u'm k�ߝ<��ck�L�������
�ȱ���C�E��ߢd�@
���ow� :�#��+�"	�N{%�͍G�F��C�
U�f�:�-_�g�Y��?�d��e�V�Y���8
!�8C�ûM������MQ߆�Q����zu�Y�5�x� �Zg�I���H(����u�O
��m�
;��I.�]�����r�����&K
t��*���we�TT
�f@�'?��]��
�dmtp�
*�S�j�^VzN�T��+웅�[,ti at xB��=��H at kaEI&�GZ�Б�a���I밽GZb �~�
<24�J>d� ��v{;�Y�m���,�|}4�����
�����gD�O6
�b�n(wS�b}[�bҾ��X��s_�&3�5�{��=����yn�q�M��,x��y�-��ټ%*7S*��ޏ��r9G���hP�XZ��Ie���^J�KIO�
 �RP�R��|���Ķ��[z	%|ie9&�G������Ջ�]
�a�O� ��7�Ӷ�޻Fc��^�B��W��07Q
��|�z(����
1�Z�o]��d�	f��с��l2ߤ�}� �u��xd�(�M������t�W�5��@�
��������5e>�T6��8pY�?�����q����p��Ahjn�-����E9�|Q���-�Q����j��I��+;�w�J <�`U�2�����_��=�d ��4����m��ىjg_
)�����xk�%U���&�X���-^cZG���s`E���{����k�]ӻ���Wͨ�
��p(|��J�㫗s��ǃ��,K_��엟�������ޣM��+���f6O]�HZ.TW��}S���Z���FH]Z�E�E�/M=|
1{xԨ`�6vJ�6�С�̦��2����jm>Y_M��'0�:Ö�I��U�K/kU��A���`;
I�
3���0�hQ�oN������
RD

+�tx�[���$)�a�=���ʶ ��.D��7������_V��:"t+{�d�d
5޻��5E�A&�,
��%Q�5ߙ�n����Feoձ��['���������f�2�M��n�n��C��hZ�E^4�7��(�\T�Z�-&�Cg
0��Ⱦk�cZ�ؾ.o����,X�}F����O^�,�
+endstream
+endobj
+8453 0 obj <<
+/Type /Page
+/Contents 8454 0 R
+/Resources 8452 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8403 0 R
+/Annots [ 8438 0 R 8439 0 R 8440 0 R 8441 0 R 8442 0 R 8443 0 R 8444 0 R 8445 0 R 8446 0 R 8447 0 R 8448 0 R 8451 0 R ]
+>> endobj
+8438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 213.938 192.296 224.842]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.794 213.938 258.726 224.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a092f5c04d267ab5709dda2d3e51aaeb9) >>
+>> endobj
+8440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 144.477 134.164 155.381]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.98 144.477 203.623 155.381]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.787 144.477 373.176 155.381]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+8443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.006 144.477 448.254 155.381]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+8444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 116.818 134.164 127.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a727dc2405cfc5f2252e6f21aa0f18074) >>
+>> endobj
+8445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 116.818 245.954 127.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 89.159 134.164 100.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a31603d81a2b0571a82c4c79b8c6e4564) >>
+>> endobj
+8447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.98 89.159 222.432 100.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.943 89.159 308.887 100.063]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+8451 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8455 0 obj <<
+/D [8453 0 R /XYZ 89 770.89 null]
+>> endobj
+8415 0 obj <<
+/D [8453 0 R /XYZ 90 674.891 null]
+>> endobj
+8456 0 obj <<
+/D [8453 0 R /XYZ 90 670.407 null]
+>> endobj
+8416 0 obj <<
+/D [8453 0 R /XYZ 90 618.72 null]
+>> endobj
+8457 0 obj <<
+/D [8453 0 R /XYZ 90 614.237 null]
+>> endobj
+8417 0 obj <<
+/D [8453 0 R /XYZ 90 562.55 null]
+>> endobj
+8458 0 obj <<
+/D [8453 0 R /XYZ 90 558.067 null]
+>> endobj
+8418 0 obj <<
+/D [8453 0 R /XYZ 90 506.046 null]
+>> endobj
+8459 0 obj <<
+/D [8453 0 R /XYZ 90 501.563 null]
+>> endobj
+8419 0 obj <<
+/D [8453 0 R /XYZ 287.777 434.742 null]
+>> endobj
+8460 0 obj <<
+/D [8453 0 R /XYZ 90 428.725 null]
+>> endobj
+794 0 obj <<
+/D [8453 0 R /XYZ 90 338.126 null]
+>> endobj
+338 0 obj <<
+/D [8453 0 R /XYZ 90 331.16 null]
+>> endobj
+8461 0 obj <<
+/D [8453 0 R /XYZ 90 230.816 null]
+>> endobj
+8462 0 obj <<
+/D [8453 0 R /XYZ 90 230.816 null]
+>> endobj
+8463 0 obj <<
+/D [8453 0 R /XYZ 90 163.353 null]
+>> endobj
+8452 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F8 802 0 R /F120 3056 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8532 0 obj <<
+/Length 1944      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�6��_�O�
�
)����ַ ]��d��v0���Y�+�M�_�#Eɖ*+N�8ͰO������s��IؚZ�:�=9�
����mn�O,[����ol}�ۜ�:iQ�"�q��/?}������3u������G��H��!�ZA�����p����\�R
E�cS��[g��{�؂7m�x�&�9r�k	B!��l�釯����Sc�����q�0�&	�m���0�Ag���2]�=U"����l��2j�ud��4
*~�_x���b��cۈ;�5$r��<Y��q6Њ��g
+6?*�A�X��v;+
��dR�);������� tXa#�}"�̝�|���2P�\s9:�˼M�xE���H:��/���e�����ϓ��I���]M1��}e��,W��C�_
��X��[�o�Iy5�E���
+�Y��\�	�/��!g
�8n)�s!Q��sE�i����b1�q.�/V2o���>Z��e�G���(b
���1V̽e`?I�6��]t�H���^��j;	F�S�i��I�"p[
������E���U�3�V*2}
�����ϲ6������a����o_�{�����
U�]�iH0E��v()õ�1��
R�}�-
+

��놄p���~C���l�/d[=0�y߮~[͂�:w��~�`�Α �ܞ��x,��q8�?��F�U��,����5*(�)*@�m���$��W!1۽":��F�
+������*�|�؀e
<6`���6{Al��T��}t�xp|�x��W39N����]�
f��^2SB�W�O�U5������v{a�ѷ���2�%���O�4�g�Qz9K2Y
�bm�[\'��I^

+�@JcE>3��
��
�Oۥ�Ū�U��Z�r<d������Z��
��g]Q�B��M-RT��J9�N��ìM�
��]�|��F�%U~�� ��Q1(#��/����f
�,��s���b5������b�І��n �
+s��A@�5�]9ǁ��~"~��Հ��w��oum2c?]���m�e�O��쒞ɾ�G�8'����N
}sX�g�V���8�q�
.6�T�,�
��nh��
��
Hp�-�
�q��Y�V�&B:���qk"c�{�P[�ە@P��f����I<
c�l?/
+v�(k��!(ʆ6Gn��-�
�M?��2rx��<�o�}��os�u��36~��f�9���	r\~]W �T�|�
]�,�@���ۈ�\��hI/S�{�/�5vM��k��������bG�y�U[B���u�qb/�%Pd{�m6����'��!
�OT�HU������X��7�)F�V�+n���i���6$�.�J>�a�N��O�q@��2��ra�=۠kg&��y��D��-�HZ�2H �yK���{S�v���
+XPM��w:����ҟ��@ˋ'3
���,����j�#�U��$�L#=fUk����
h�s�sp�)�8?0�"8DD�?r<�{��&�\}jU?�
݁�?a���Lti
մ]��D�V�-��:3�`�kNąE�5�W6��ژ���%^�
w(B:�d�*�����4]��kכ�n
A�#���l���Ҧ
�d����cd�-�5e����d&I
��ߺw�Q=�Ѵ�������ӿ?���>
؝����V
��>�L2z/�~ެ̷����n�)�	��O��w���HS��ܛ%�q��Ʌ�/���JD�"����vj��5rmP�2v+�@t�g�ɡ�s����ʚ6�0D�]9��#
,gnN����F¦�~��1��y���=�0��77��f9�\8>���,ekuC�7\+,?p�p=g�����.��w�̧�L0�7<~��˲�R�~Q��L��e��"����t��d��
���L�M5�٦M�.���,�?
_,����(H�o	��z�^�֛���(IeY
�JP�5
�/mdI|
+endstream
+endobj
+8531 0 obj <<
+/Type /Page
+/Contents 8532 0 R
+/Resources 8530 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8403 0 R
+/Annots [ 8449 0 R 8450 0 R 8467 0 R 8468 0 R 8469 0 R 8470 0 R 8471 0 R 8472 0 R 8473 0 R 8474 0 R 8475 0 R 8476 0 R 8477 0 R 8478 0 R 8479 0 R 8480 0 R 8481 0 R 8482 0 R 8483 0 R 8484 0 R 8485 0 R 8486 0 R 8487 0 R 8488 0 R 8489 0 R 8490 0 R 8491 0 R 8492 0 R 8493 0 R 8494 0 R 8495 0 R 8496 0 R 8497 0 R 8498 0 R 8499 0 R 8500 0 R 8501 0 R 8502 0 R 8503 0 R 8504 0 R 8505 0 R 8506 0 R 8507 0 R 8508 0 R 8509 0 R 8510 0 R 8511 0 R 8512 0 R 8513 0 R 8514 0 R 8515 0 R 8516 0 R 8517 0 R 8518  [...]
+>> endobj
+8449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 134.164 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0c02302b6281fa91ef9275bd37e43efc) >>
+>> endobj
+8450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 707.957 239.328 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 680.35 134.164 691.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a527ffa31e1581a8beb83a832244dada8) >>
+>> endobj
+8468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.98 680.35 215.807 691.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.336 680.35 297.281 691.254]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+8470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 652.743 134.164 663.647]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a69a6e807d63018625b02e06c07a578db) >>
+>> endobj
+8471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 652.743 260.888 663.647]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+8472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 625.135 134.164 636.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a65f00faeb048901323ffd316d30d61a4) >>
+>> endobj
+8473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.98 625.135 237.366 636.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+8474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.434 625.135 324.379 636.039]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+8475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 585.573 134.164 596.477]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) >>
+>> endobj
+8476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 585.573 180.102 596.477]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+8477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.348 585.573 221.075 596.477]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+8478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.489 585.573 334.955 596.477]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.754 585.573 478.506 596.477]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 546.011 134.164 556.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a659cb16eede4860a0c3597638ca77830) >>
+>> endobj
+8481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 546.011 206.662 556.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+8482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.526 546.011 332.993 556.915]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.791 546.011 476.543 556.915]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 506.448 134.164 517.352]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8d060ee1328743ae25698bc5835a5703) >>
+>> endobj
+8485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.163 506.448 233.431 517.352]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+8486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.546 506.448 358.013 517.352]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.642 506.448 501.394 517.352]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 478.841 134.164 489.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a36cc3783cdc92ab5fc69904c298ed12c) >>
+>> endobj
+8489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 478.841 209.431 489.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+8490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.624 478.841 308.09 489.745]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.889 478.841 451.641 489.745]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 429.316 134.164 440.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa28d735beef86789b73b41dbbde71abf) >>
+>> endobj
+8493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 429.316 181.755 440.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.319 429.316 274.785 440.22]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.584 429.316 418.336 440.22]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 401.709 134.164 412.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 401.709 185.71 412.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1ba97c180500b43954b09532151f6c9d) >>
+>> endobj
+8498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.048 401.709 233.301 412.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 338.557 190.738 349.461]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 338.557 261.85 349.461]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afc06f600e94b7bedb91d0371a51f4c38) >>
+>> endobj
+8501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 313.231 190.738 324.134]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 313.231 262.159 324.134]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a90ca2b1613fda31a2ac7e79d9388680d) >>
+>> endobj
+8503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.225 299.894 390.082 309.799]
+/A << /S /GoTo /D (index_Grid_Affine_Dimension) >>
+>> endobj
+8504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 287.904 202.922 298.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 287.904 248.58 298.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a53b24395ac61f8b2b2accc5a3900bf69) >>
+>> endobj
+8506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 262.578 202.922 273.481]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 262.578 296.181 273.481]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a880344de195aef75a6b3f2a4db4787b4) >>
+>> endobj
+8508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 226.292 233.069 237.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.808 226.292 295.594 237.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816d72524790) >>
+>> endobj
+8510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 200.966 233.069 211.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.808 200.966 343.195 211.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a453e51570268eb4d63fc529130a54440) >>
+>> endobj
+8512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 175.639 248.003 186.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+8513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.742 175.639 323.26 186.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8865893c48cc07adae5dca6b35081751) >>
+>> endobj
+8514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 150.313 248.003 161.217]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+8515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.742 150.313 370.86 161.217]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a6ae1850664122e9917f174d10fd3bf06) >>
+>> endobj
+8516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 124.986 205.692 135.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+8517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 124.986 261.312 135.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad14942b33fb82bb3e6a13e5e92ada475) >>
+>> endobj
+8518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 124.986 338.781 135.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+8519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 99.66 205.682 110.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+8520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 99.66 261.302 110.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a803035024ab9670971868f4b1092f7c5) >>
+>> endobj
+8521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 99.66 353.705 110.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+8522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 205.682 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+8523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 74.333 261.302 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a6f703ba611b9e5ff613f4df35347ee95) >>
+>> endobj
+8524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 74.333 330.462 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8529 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8533 0 obj <<
+/D [8531 0 R /XYZ 89 770.89 null]
+>> endobj
+8534 0 obj <<
+/D [8531 0 R /XYZ 90 418.825 null]
+>> endobj
+8535 0 obj <<
+/D [8531 0 R /XYZ 90 353.491 null]
+>> endobj
+8536 0 obj <<
+/D [8531 0 R /XYZ 90 328.354 null]
+>> endobj
+8537 0 obj <<
+/D [8531 0 R /XYZ 90 303.027 null]
+>> endobj
+8538 0 obj <<
+/D [8531 0 R /XYZ 90 277.701 null]
+>> endobj
+8539 0 obj <<
+/D [8531 0 R /XYZ 90 243.11 null]
+>> endobj
+8540 0 obj <<
+/D [8531 0 R /XYZ 90 216.089 null]
+>> endobj
+8541 0 obj <<
+/D [8531 0 R /XYZ 90 190.762 null]
+>> endobj
+8542 0 obj <<
+/D [8531 0 R /XYZ 90 165.436 null]
+>> endobj
+8543 0 obj <<
+/D [8531 0 R /XYZ 90 140.109 null]
+>> endobj
+8544 0 obj <<
+/D [8531 0 R /XYZ 90 114.783 null]
+>> endobj
+8545 0 obj <<
+/D [8531 0 R /XYZ 90 89.456 null]
+>> endobj
+8530 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F39 2335 0 R /F11 621 0 R /F111 1509 0 R /F68 3017 0 R /F66 3165 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8609 0 obj <<
+/Length 2121      
+/Filter /FlateDecode
+>>
+stream
+x��[ݓ�8��S�Te4�l�V���nv��ݤv.���d�2� _�Ml���_����cyB��ju���-Y����֛�?o��}��{Գn&ǖ�r�<�[m�#�
�1����a1G�C��<����Go�qw�^�)�xxA��Ұ,u󽘈bH[d� I�C<�z����_?�
�
�-��f��h>��;�b��
#�֭�4�\��gj}�{��4v?մ�k0-ϕ�".F�>!�=���Z�Ѳ�	�(��o�4����o��q�M����n�Ȥ����`{
' Mh����ѽ����"�u�j���SC]� �#u�0���<��4mÐ��#e��B�:���?�>�.�>
3��D)k<��TL��޿X/�D`at�g���r�S�6�G�I5k<b:|�
G���y@Ε�R�IV�	y����-���]P���=~D�Dπ��q���
��#1_Tw�0�H�����8�[��X��fN&Z%in�ȳ�N��}�>
+����Aw��(k5�6�jN�����0�|�?�=�q�%C��Ր0[�8��.�`ҕL��.��sl�/�4�&Q��Gi^��)�KQ��_ǹڬҹƴ�nھ�].ǥ��Γ���Q���"�
�+60ؚ���8)��C�
M�|��D�
+ȶ~�XD9?0���{Zw�k��#�n�]�h�k�� ��!�~��gby8�(*_V�%҃
��2��&5�U�1�fx�F+�rQ�`3�h�XS�=yܓ�5�2&y�",�<��U�v!��@�D������_/��C�>����!X
�G��V�^�AX|�佃�bV�6�� ���nXk��;��]Ҷ5��T�︨�� ��ҹb�R���p��y�U�#
+ķ`����Ǣe���TW������Z4
��y�
��H� �a�6�=Ҩ
ņ�H
XM��~7(�g�=�
U�:$����<�s��
»�J�8�+�i�+Y�<"���\L$���4J�~�����(;*�u�ĵ���P=Q[
�コe
™�*����? 4�����'4
�F�Dhp7h��OLh@Ä��K� 1��T"n�Q�A��ҍz����2�G&�t����	R�2p1;����j�i%���S�
����?�_�a=I
j��Y�P/�,��
TsfRE�;��}0��^����X�.�"{]������j��g��:����.��D�]϶���Ng�9Ϸ@<��+�Z����L�
�ֽ[�h�o�cZZ�� 
�%f���nG�
y��9��I�΃��ă �4B��<�Ҡ{�r/�lr�;J�Z��A��q
��z��]X�i��g1|�Ř��9M~�-,��ؘwb��Q��<��� �c�D�Ŏҗ{���LB�[���\� ��^j�3ۜ٦�B� 
8]
+��������lf�@���e)2�е���q��>&�Y8��֭L~��#��K	�������D�'E]��9�xj
��UzTc}��>��g`T���O1��|�`T�c:�dC3�l�2*���{9�*�p��N�U6
�ֺ
���� �a��d/B��I^�
�%�N?�
���j`�X���V��
�|�yAx��v����npm,$$3!+�
o���i
�}JnZ��śCf�^v��9C���Z�V�����֔���W�`8����	��
Y� 2YOo������sn?�'�w��mZ`
;���t;����f�QU$Q%�̞��S�`��{�̑�����B�	xO(���C�Q���D�y	Uߦ��D]�JK�8�@�����\�P�7M�
+}YJ�䙠�*[��
���9k��7�4�A�C��>�C�k��A�wV�~J�"S���z�o�����j}睘��CV��Y�ukg��ޅ(��8���Lm/w�N
$�����=q*k�n�%�qLJq,�cZ,��Gݒ:"�E4U(y 4���s�Q��k
YoNb7�8Gۜ�k����xS=�m�_D7
��Ua�K��|�΢G�O��w��D ̖�X�
��j��h��ou�? �
����24'}_ߵY���
�?�D�t��g�n�*#�m[�ǰ�]�[̪j���r���"��h�|��\8��z=2�/&��bM
��\ݖC�
�ږ
�y���� ˪ҧ��v[�Y?h~���ܱ~��ț���΁CM
+endstream
+endobj
+8608 0 obj <<
+/Type /Page
+/Contents 8609 0 R
+/Resources 8607 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8403 0 R
+/Annots [ 8525 0 R 8526 0 R 8527 0 R 8528 0 R 8555 0 R 8556 0 R 8557 0 R 8558 0 R 8559 0 R 8560 0 R 8561 0 R 8562 0 R 8563 0 R 8564 0 R 8565 0 R 8566 0 R 8567 0 R 8568 0 R 8569 0 R 8570 0 R 8571 0 R 8572 0 R 8573 0 R 8574 0 R 8575 0 R 8576 0 R 8577 0 R 8578 0 R 8579 0 R 8580 0 R 8581 0 R 8582 0 R 8583 0 R 8584 0 R 8585 0 R 8586 0 R 8587 0 R 8588 0 R 8589 0 R 8590 0 R 8616 0 R 8591 0 R 8592 0 R 8593 0 R 8594 0 R 8595 0 R 8596 0 R 8597 0 R 8598 0 R 8599 0 R 8606 0 R ]
+>> endobj
+8525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.3 205.692 707.204]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+8526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 696.3 261.312 707.204]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ace98c3e57a1237e6dd5042b5a0919193) >>
+>> endobj
+8527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 696.3 332.156 707.204]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+8528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 670.995 183.824 681.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0b193ae8bc) >>
+>> endobj
+8555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 646.063 192.272 656.593]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a59634a195948ff0617177d0a41e30602) >>
+>> endobj
+8556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 620.383 241.935 631.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6) >>
+>> endobj
+8557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 596.771 213.163 607.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a621d377682c2c67051c24b1cc8a03497) >>
+>> endobj
+8558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 596.771 260.754 607.675]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 573.533 189.901 584.064]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2528b5f433e743dda827b1028b6c74cd) >>
+>> endobj
+8560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 549.921 193.229 560.452]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1a5606b64a035977b9d76b1932227246) >>
+>> endobj
+8561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 524.242 238.459 535.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0047a6aa4f26d9133b9d741f68384f38) >>
+>> endobj
+8562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 499.31 187.689 509.84]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3ac47497148e61f3d7a3da09d17a03bf) >>
+>> endobj
+8563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 499.31 226.693 509.84]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 475.325 228.895 486.228]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa033cfca735240b3699b523d60ad692a) >>
+>> endobj
+8565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 475.325 333.482 486.228]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 451.713 229.503 462.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afde364ce088f82cf2b9a231e7d9f2abc) >>
+>> endobj
+8567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 451.713 334.089 462.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 428.101 187.264 439.005]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a042613c3f4ad30b298d70143c935d7cd) >>
+>> endobj
+8569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 428.101 293.213 439.005]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 428.101 371.148 439.005]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 428.101 455.727 439.005]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 381.575 187.264 392.479]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8fa02815bb561135934f91c9adcd0cb5) >>
+>> endobj
+8573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 381.575 293.213 392.479]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 381.575 371.148 392.479]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 381.575 455.727 392.479]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 369.62 220.058 380.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 335.049 186.348 345.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d8ed7a0e48fe76e7221842c780192b0) >>
+>> endobj
+8578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 335.049 293.772 345.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 335.049 373.367 345.953]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 335.049 456.837 345.953]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 288.523 186.348 299.427]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a53f980fb1ac8fa21265bec985bd1382f) >>
+>> endobj
+8582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 288.523 293.772 299.427]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 288.523 373.367 299.427]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 288.523 456.837 299.427]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 276.568 218.404 287.472]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+8586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.772 241.998 187.446 252.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afae3a58c19c9a3b9916f29b7aca4d0e0) >>
+>> endobj
+8587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.73 241.998 292.979 252.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.431 241.998 370.447 252.901]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.745 241.998 456.762 252.901]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 241.998 513.996 252.901]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 230.416 159.485 240.946]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.603 230.416 240.62 240.946]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+8592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.985 217.563 378.999 227.469]
+/A << /S /GoTo /D (index_Grid_Frequency) >>
+>> endobj
+8593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 195.472 180.496 206.376]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad743f8b71eb68f6b41f7ea7b5d21dc22) >>
+>> endobj
+8594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 195.472 228.087 206.376]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 171.86 213.153 182.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8d2cc5d18d050975101f2860f2919da8) >>
+>> endobj
+8596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 171.86 260.744 182.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 148.248 161.677 159.152]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814eaad72499) >>
+>> endobj
+8598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 87.135 212.377 98.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1287b254a91451368e7e2e456f448114) >>
+>> endobj
+8599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 87.135 289.846 98.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+8606 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8610 0 obj <<
+/D [8608 0 R /XYZ 89 770.89 null]
+>> endobj
+8611 0 obj <<
+/D [8608 0 R /XYZ 90 711.418 null]
+>> endobj
+8612 0 obj <<
+/D [8608 0 R /XYZ 90 686.113 null]
+>> endobj
+8613 0 obj <<
+/D [8608 0 R /XYZ 90 660.807 null]
+>> endobj
+8614 0 obj <<
+/D [8608 0 R /XYZ 90 564.666 null]
+>> endobj
+8615 0 obj <<
+/D [8608 0 R /XYZ 90 539.36 null]
+>> endobj
+8607 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8695 0 obj <<
+/Length 2519      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�8~ϯ�S��
�"Y`
v�m1��[2��
�f
amٕ�t<�~II�lYvk9�b� �,S��9���Ef�^������d�F:�ap{h
H����4x7���q�}�B���*w���?ݾ�����v�������p@�ILW����N`Ĵ
+>�A��S������+\Ȃ�2��&!�p�$�xO�p����F�����2��Y��Y!�onxM��Y�?��4ʗ��\v�{,�d�dy�do�Do�&z1��H�����恂���n�Rr�E�P�տO��Ћ�?&���-����Kq4$x`e1(�~C at o�U�H	Qs��4���|�'��?�6Yn;2�
߳j�["T
)$�����ǘ�	�Q�U%�C��HK	D��PC�;`Q���#���}�	p2K�&���
(��f�x��i2�>
O�d<�hb��P�^J��I+�(`WF ![
Eb��p�
�(�O
+̐�ƒ.�	�qz�L��$�
��Qyz]��k����^�۾1�5����۲�s�a���=��(N��c��~�F����xLO�2y���aeը�1̇u��
촔�
p���
�0��5�	��D/aUH/���0t:x��b�C���:5\t2	1�����y`�85�4Ė~1���3\'�+N�w8I
��&f�1�j�B/��t�
6�=3��Ȗ4��60-t�>�ن!��nE��
zkA*���^�
+3�SsI�H�xd<�R�,�t�1�ट�j>_� �b���r,[�!hSve����E �ha�	��ܳ�χH7��HH��/'�Ƹ=���
i�[��
,�����
+,]
�C�Q�o��t�\�u*�c
+jq*.Y������qv�U��pR
E���&A�u���uR�Oο���A���ݼ�Z@��9��j�X�s�cΈ�cL6�8����4�(��{۲��MJ1B��F�H�*������`�2�����f������i�0IV���cDT���(m��H��70��(��Y'3��s��D��V�}� �	��
w-���g�
+�P=-�O��
�g�Ӟ�.�����n��� e����f�� C�l����n;��A
��p"3�/���	�
��r���;CJ��w
��7vbZ������S�
5�ם�`�Ϧ��>�M9��Y�I30�|�tfF��%���W'VW��)�ž@]k�V)�ӒK��:�0D����L�]���9�V%}���ʤ��:�>;p�������h����SZΔF����z
+�Q��������r����cc�?�I����;�z
�E����aat{�nt�x�O�#�cF�DS�.�+Dh5K�yэ��{�5.?����L���g
 SǢ�L��}V��tm��TnƧ
+�:�
�Tܲ"X6�g��uFT3�k&
��<k]SC�O�kn{m~�nOI�g�0��m�{oRw��k��ȳN�۵����!QV�ΎnD������e�>T
���L��~/V��~3^g����}�?�y�>@zL�P��ȝH�}���vA��1�hU�<&}�5���;�L

j�(��`_;!;U�w�L��!,�ViΏ`X֪����6� ���:H[�&i��@�kO(!�E(P�$;
��꣌f��7C!�&]&�D�A�"Aq�,^D�=���h0�ˋ��Jv[�c:8������D������dY
r��/V��_-M��Il�|l�Hy��[u��"�9�)��lۊ��7�&Y.��6���z\iw�e��{�8�7�r����A&H;�p�°�D+ܦ��}\�&r1��_g ϋ�b�w����pI{D��Tn76 y�Kʭ�

+	��I���"Z�|��<�0���&ݾYp���U�~O��tC]E�
+�(��G�̻$��
+K���MQR�mZ�pT�`�4��
5�hc_Hq�:�)�P�Eb,�M�h�1;�

cr�ǘ��x̮y���]
�s��
���Y����)�Q��P��k&OK���(إp�NV�W
��%%��`5���B�-�����/ݬ�S~���B�q���t
�1��˿���W�����/3
OӨg����Qm��of��fqWUy
YR3�6
����c�,~�&[h��ϥ�����܍�y�x����z��>I��L��,kSv�S{��L�D4;�j���m�]�(��)�V�󀀕�q"=��
�|�����r'�T����v�n�h{RĶ�}

+9(i�S�����ec�\�%�B{a���Ph�j�������e�ց}��69���4�Ľn��BQr��i�ث��#�zwڽ+�X��J	�1;@ߍ���
J�D��/������9
�߬��.�������w��
��S��]�%ڽ\��
+#L�k��_���X^S���n��.a��t#�o���|�P���n_�e��_~��g&���J]�E�:��>ܣ��I��� ���h�~cJ����������$1�ۆ�C��^^_߭g�Ifh�\������6V�/ӒCӪ�'Ν�
�_9��x
+endstream
+endobj
+8694 0 obj <<
+/Type /Page
+/Contents 8695 0 R
+/Resources 8693 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8403 0 R
+/Annots [ 8600 0 R 8601 0 R 8602 0 R 8603 0 R 8604 0 R 8605 0 R 8632 0 R 8633 0 R 8634 0 R 8635 0 R 8636 0 R 8637 0 R 8638 0 R 8639 0 R 8640 0 R 8641 0 R 8642 0 R 8643 0 R 8644 0 R 8645 0 R 8646 0 R 8647 0 R 8648 0 R 8649 0 R 8650 0 R 8651 0 R 8652 0 R 8653 0 R 8654 0 R 8655 0 R 8656 0 R 8657 0 R 8658 0 R 8659 0 R 8660 0 R 8661 0 R 8662 0 R 8663 0 R 8664 0 R 8665 0 R 8666 0 R 8667 0 R 8668 0 R 8669 0 R 8670 0 R 8671 0 R 8672 0 R 8673 0 R 8674 0 R 8675 0 R 8676 0 R 8677 0 R 8678 0 R 8679  [...]
+>> endobj
+8600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 707.957 225.109 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad09e4e3f9a9da562c6cdb73dd7b47fbe) >>
+>> endobj
+8601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.446 707.957 317.512 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+8602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 684.325 216.252 695.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa26f672c32271db69ed68fc60eee8cff) >>
+>> endobj
+8603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 684.325 328.042 695.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 660.692 254.827 671.596]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a85b2560352485ac05d10aab0ee483252) >>
+>> endobj
+8605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.643 660.692 343.096 671.596]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 637.434 205.752 647.964]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e87405c740d202951ba788f9e52cbf7) >>
+>> endobj
+8633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 637.434 276.595 647.964]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+8634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 613.428 209.627 624.332]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a943c42b0d1b3580e54b3ab60aa55255f) >>
+>> endobj
+8635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 613.428 314.791 624.332]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 589.796 248.202 600.699]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a145cc7c23d407576222e5af347f401c1) >>
+>> endobj
+8637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.018 589.796 329.845 600.699]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 566.163 243.37 577.067]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a953a608f6f9d413870fb3eee5cc6ad1e) >>
+>> endobj
+8639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 566.163 320.839 577.067]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+8640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 542.531 247.246 553.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_af1ab967a6606266f7e583fc9752667fe) >>
+>> endobj
+8641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 542.531 359.035 553.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 519.272 236.745 529.803]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a82b76e3f18679ea161b53bfa80349009) >>
+>> endobj
+8643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 519.272 307.588 529.803]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+8644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 495.266 240.62 506.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a8f97dbc7a7c307fa72f7e904b2cbf21b) >>
+>> endobj
+8645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 495.266 345.785 506.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 471.634 228.984 482.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a19422844125a988daaf489cbaff3835b) >>
+>> endobj
+8647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.322 471.634 355.708 482.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+8648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 448.002 267.559 458.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a214e376adb9dc271c61b58f8b2c927f0) >>
+>> endobj
+8649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.375 448.002 370.761 458.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+8650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 424.743 193.577 435.273]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae5dc5003b3652660bc4ff4a15e4060af) >>
+>> endobj
+8651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 424.743 232.581 435.273]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 411.88 248.845 421.785]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+8653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 390.152 193.577 400.682]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac418d88df400bcd2233fb6281debb08f) >>
+>> endobj
+8654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 390.152 277.691 400.682]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+8655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 377.289 247.177 387.194]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+8656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 355.187 223.465 366.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac9d9eaf8b76024bc20ce524e13bf86a6) >>
+>> endobj
+8657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 355.187 271.056 366.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 331.555 229.552 342.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9831db06919c6ee05360b08e84cccbb7) >>
+>> endobj
+8659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 331.555 277.144 342.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 307.922 266.673 318.826]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a68665d093308c111817eca341b98d70a) >>
+>> endobj
+8661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.01 307.922 314.264 318.826]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 273.331 217.109 284.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae5955a311fc4fde1edf2d5460f0a8356) >>
+>> endobj
+8663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 273.331 264.7 284.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 260.842 274.983 270.747]
+/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
+>> endobj
+8665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 249.699 271.126 260.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a071aa57e439ba4f358c7fd43b03a6a49) >>
+>> endobj
+8666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.463 249.699 318.717 260.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.863 237.21 326.259 247.115]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+8668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 215.108 198.26 226.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_abb10ea556dd34e0c1e13f7e99b9efe70) >>
+>> endobj
+8669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 215.108 236.665 226.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 215.108 353.317 226.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 203.526 246.458 214.056]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.306 190.663 269.939 200.569]
+/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
+>> endobj
+8673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 168.561 212.768 179.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a90e87cbe8ae0717fa09ff51b70d64b47) >>
+>> endobj
+8674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 168.561 252.959 179.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 168.561 375.145 179.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 156.98 286 167.51]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.401 144.117 277.928 154.022]
+/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
+>> endobj
+8678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 122.015 250.099 132.919]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ad42265530a9e3b2f3bda9ab40d4a835b) >>
+>> endobj
+8679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 122.015 289.446 132.919]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 122.015 379.512 132.919]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+8681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 122.015 513.996 132.919]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.909 110.06 415.293 120.964]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.557 98.478 277.701 109.008]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
+>> endobj
+8684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.468 84.406 441.891 96.571]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+8692 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8696 0 obj <<
+/D [8694 0 R /XYZ 89 770.89 null]
+>> endobj
+8693 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F66 3165 0 R /F42 539 0 R /F38 3411 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8787 0 obj <<
+/Length 3142      
+/Filter /FlateDecode
+>>
+stream
+x��\�r�F}�W��KV�c�3��C�MR�:�7V6��S,��(Ԓ ��*_��3 P�)��vU
l�d�LOO�����{__|qy����{�Ŕwy��
�!R����ˌ�D�����?{;��l��W˷s�ϒ��M�IW�7�U�J�_��:�6�����n�e���:L�T��x
�L�S5c�������ˋ�.(��{ԭ-I�����_}o�����Y��'�ם���~�
��
�׶Ci@�(%��-�gL���a�/
	ۻ���
��P�t[�����Ɵm�8LW���p�\]ϙ���}��CF��6<�����9��_sJ)6Z]�Z���2�t.��g��1���w�<J����U�k�,
w������_'q��o�M��t��a�Ys7'�D(�-��FJg�g���;��B���d�u��2OWQ��xaUX��%�����0N�Q�ʓ�e��
N������t�"

C�k�.�O6��1{�f��iҥ�k|W�>����QJXo�Z��@j���p&�8sf���]��������>wB�t5)A��K��&ʜPc}�	��+��Â���
�	b���$�-�He=B��Q��E��[��
�u~��{�	�m���� q�n$@
(�A����[��`��~h
+�2��\�e��<IL8�b@���D��������I„�5��N���\`c
�e�B����!T(O�(p�s�
LE�>�����rmc�j.
+\(Wr�f�k�a�E@
U�GH��
�����t%V�\AQ������@�1a������%��0�1�5 p�� ������z���z��PX�YNa�{Uka�A=�5����K�G���oS�|+�}=	�J¹l�M�-*�N�����qD��D;�3ǵ�M�k��6Z�G6�EGsm �oX�( ��g���
�Y
<{F�
d��9�+��t<b����I���SG'4 at _�g�ї�/.y}�k�Ӱi֠/\�=]䒵��O���q,�
+5�E�)�ڧ��P����&���)
*n&��0���9LhZ�0H����9Lp1�J��fT��O(�qx�s�CE4dz��Z��Ώ���-7�l����� %�$D�8�5��G�H
4�W=c8�;
+b!��D�Ժ�p�I��Pd8k�>�C�ZN��j�ĭ�֨
)��^��N��T�'�[�����tԴ\�<��_��J�r*H��hg	;����<O&Z�ِ�Oi
+�ަ@�jcC��=��&�=�
�&����s��y����s(��E��8�` ���*9YPb�#(u%�8�	q�i~���C�
g��5.1Æ��+.�&�Bv&�RN��օB�jG.Dg>�>�,�e�	���{�M����J�%ݧ�DŽ'PhLx�O
O`O��UC�O�O��b\��p�tD�Zp�Di�U�O�T�B�O�3Nѧ*<}#=DO�T�����P�LJ*�l2Y��̣}��
�p������#z>(f�����X�d
�Cڕ�K�3��j�d>P�����=��.w�*��:��yo
�z���
g�63]��]�-�Hؙn���*޴�C%QU'��ei�1���HRNٷ�KW�o}D���Ue�wa�ڢ,r��>�E��:�m޲
���
J��C��	S�h1�e�������ޙXU��b�	�� h]���+P�g���Ga�.����
,��D1}��9�@2"��A��>����s1Qs..!?ik6\P@8�z�-/�ϊ
�Ĉ�+��c��
+�;��F��2���$��K����*Iv���eo"4�m�9�v���yz
;��
����i���9
�69��TfD�V6@?1&�Y��N#n!	�0U�^����}"l��""m���Kq�5+�;$�.�O}�}���I-�4���`����������/�����J��8ٷ����jw_
N�����ڒs Va&
+W�� 9K�S�wv�I8�w�&���Z��ee��Jl�`
f�
E)L�\Jp���
*J���-��#G�k���-���h"�岂��vƃ?×۪ݦ/s�b}�̉�$}PAk83.�tf��:3��ə�â.��Vg��cÙ݇�I�&s�6|��ӭ]�:��CRT�x)��NҲN ��Rʤ�
h,V=U��fJ$
��Q?���	i<O�.�F��n��%�1
*0
͛���\"D�iQܮ��
޳���:
I�!�e"XxOp�[[H=�u����
���%��b�Se���ؘDf�#2������w?�y3�=��UD���C
	|=Q�|tWmT��ަ_F7�HT�����Ik�*������=Ť���4=��F��IE(�}Ť&�8	
��%*.�u@Ly�uf���Y�$}��
d���O%}Hl1i[\]m��m�TmdN���Ml�{��ְe���)��«.l�w=�2�l*��\��F�����
��||��Nb�F_��c�|
+V��Ȣ�މ�O��Y�<�3h�w at 5�
��9��F�:�t��G6@�
+P�L�
ef�hEf���e-�su`�� u�Lv G�*l������p��{��v�J-[�z�b��[W�U�=��(��&��<�(_���D"������'
M3")��@-��_�b� ��{
>4e�R�p��
H]���հ�FN���0�v���E�ow���*�
F��6�HE��������j�O�mV���jɵ A���,;S�>ԉ��
��ٔ�D�i��zDaͤ���~p�9b���@���
��i�=?�^P5�G
�
��q�#�����}]�a�e?��6�۾ P� \u�/�x >p]1Q� \U<������_T��R���% A٨�6m' 
^��O'S6L ��# ������
>��
!
ҹ���L��
�"�IQ�˜D;s�@7������ՁE΂�[
�k/�X�v�r|�E�`U\7�Z�H�$вI�Tԫ�'U�`���O��%��	ʿGP�,�����r�o߾q?fa�����b�߮�c�JF���3�	�!%�]� a�w�
K�s���+����A���DTݻ�<?�x�����xK��
�Ym/�������>I�2
��{뵤|ꪴ��jZ)VZ
�ۅO|�Jԯ��������{F��
�� E�t�
+endstream
+endobj
+8786 0 obj <<
+/Type /Page
+/Contents 8787 0 R
+/Resources 8785 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8793 0 R
+/Annots [ 8685 0 R 8686 0 R 8687 0 R 8688 0 R 8689 0 R 8690 0 R 8691 0 R 8719 0 R 8720 0 R 8721 0 R 8722 0 R 8723 0 R 8724 0 R 8725 0 R 8726 0 R 8727 0 R 8728 0 R 8729 0 R 8730 0 R 8731 0 R 8732 0 R 8733 0 R 8734 0 R 8789 0 R 8735 0 R 8736 0 R 8737 0 R 8738 0 R 8739 0 R 8740 0 R 8790 0 R 8741 0 R 8742 0 R 8743 0 R 8744 0 R 8745 0 R 8746 0 R 8747 0 R 8748 0 R 8749 0 R 8791 0 R 8750 0 R 8751 0 R 8752 0 R 8753 0 R 8754 0 R 8755 0 R 8756 0 R 8757 0 R 8758 0 R 8759 0 R 8760 0 R 8761 0 R 8762  [...]
+>> endobj
+8685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 707.957 261.881 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ab602d97b867b5d2ea800ea7ceef4c6b5) >>
+>> endobj
+8686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 707.957 300.286 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 707.957 388.504 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+8688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 707.957 520.199 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.909 696.002 415.293 706.906]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.557 684.42 277.701 694.951]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
+>> endobj
+8691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.87 670.403 449.708 682.568]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+8719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 649.565 250.748 660.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa9c12ecd84df4ed86b5676a09fa39208) >>
+>> endobj
+8720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 649.565 357.317 660.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 649.565 456.145 660.469]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+8722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 637.61 202.344 648.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.711 637.61 475.855 648.514]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
+>> endobj
+8724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.481 625.175 465.544 636.131]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+8725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 603.128 261.881 614.032]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afb9d83c4e182f640833116dc2f725076) >>
+>> endobj
+8726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 603.128 365.272 614.032]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 603.128 460.793 614.032]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+8728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 591.173 202.344 602.077]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.711 591.173 475.855 602.077]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) >>
+>> endobj
+8730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.923 578.738 468.68 589.694]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+8731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 556.691 239.984 567.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0441c9c3b0ab0d55165bb6b4fd107f64) >>
+>> endobj
+8732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 556.691 280.82 567.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 556.691 405.104 567.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 556.691 513.996 567.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 544.736 171.361 555.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 544.736 478.077 555.639]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 531.092 432.092 544.25]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+8737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 509.051 251.209 519.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e4e32230b187284ac0b9ca8efba8f82) >>
+>> endobj
+8738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 509.051 290.549 519.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 509.051 409.969 519.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 509.051 513.996 519.955]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 497.096 171.361 507.999]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+8741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 497.096 478.077 507.999]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+8742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 483.452 456.992 496.61]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+8743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 461.411 224.57 472.315]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac009459805692e582a00d4b5954ab8e5) >>
+>> endobj
+8744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 461.411 272.162 472.315]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 448.976 347.869 458.881]
+/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
+>> endobj
+8746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 437.888 196.297 448.792]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) >>
+>> endobj
+8747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.439 437.888 279.215 448.792]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+8748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.718 437.888 432.878 448.792]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+8749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.827 437.888 513.996 448.792]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+8791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 425.933 216.491 436.837]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+8750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.094 425.933 362.977 436.837]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+8751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.254 425.933 475.081 436.837]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+8752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 401.543 164.537 411.448]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+8753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 390.454 273.129 401.358]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2d4a31320735e93af31c8d2cc7e78329) >>
+>> endobj
+8754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 390.454 352.41 401.358]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 390.454 495.961 401.358]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 366.931 275.007 377.835]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aa76828d01f5c454221427eef68227f78) >>
+>> endobj
+8757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 366.931 362.877 377.835]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+8758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 366.931 472.148 377.835]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+8759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 354.976 233.986 365.88]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+8760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 320.494 255.564 331.398]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a2581586de73769088ece60dc01409a08) >>
+>> endobj
+8761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 295.366 264.959 306.27]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ab6bba83ceaafdb71df04b77e43bed022) >>
+>> endobj
+8762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.296 295.366 312.55 306.27]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.933 282.932 362.407 292.837]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+8764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 260.884 256.66 271.788]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae8d42fcd571a9c9d64f0e7ffe67e995e) >>
+>> endobj
+8765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.997 260.884 304.251 271.788]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.5 248.45 366.421 258.355]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+8767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 226.402 214.06 237.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a596fc5b3ee0d04895aca9139cb6cbcb6) >>
+>> endobj
+8768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.398 226.402 261.651 237.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 213.968 358.593 223.873]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+8770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.284 202.879 313.701 213.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ae47fdbff76383891b3896ac5fc213d5d) >>
+>> endobj
+8771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.407 202.879 361.661 213.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.347 202.879 487.799 213.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.63 178.489 376.664 188.395]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+8774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.429 156.442 306.547 167.346]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a323efbe5d43695cc65f8cd5935da94dc) >>
+>> endobj
+8775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.542 156.442 356.796 167.346]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.202 156.442 486.655 167.346]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.627 132.052 379.162 141.958]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+8778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.72 110.005 264.238 120.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9bdab8408169307fbd899ec3670cb2bf) >>
+>> endobj
+8779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.815 110.005 315.069 120.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.421 110.005 445.873 120.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+8781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.613 85.615 287.921 95.521]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+8784 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8788 0 obj <<
+/D [8786 0 R /XYZ 89 770.89 null]
+>> endobj
+8792 0 obj <<
+/D [8786 0 R /XYZ 90 335.568 null]
+>> endobj
+8785 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F66 3165 0 R /F42 539 0 R /F38 3411 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8852 0 obj <<
+/Length 2267      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۶~�_�'W��� x�x:��ٌ�8�z�郝�P$$�/!�U�_��
+����$�t<k����\�s��2����_o\���PǸ_>6\�G�O��yB]<���{�t<D|fU������o��}W��_�rE�
D.`#�3�����؈���F���jPbXԄߍqw��+�h�
�F���q	A�HB>�d����xr�M�2�R.�uP���`�Y/�u7���q�R��c�
��4%OXXfj��<Yu���w	5�e3J�oK2�Pj�f�g6��0��c
�>��b�8��%6
�h�Ŧ󨦕σ4���G�uŌ/��Gל4���}�t�X��:����7�expx���91f���=y�o��F@��I$k�ڕ���e]�PZHٔؓ�G��l�#��G�Q1��mT愈U+Ncz;=t�@�
+}�&���e��

�^V�"��u8�e6�n+�FS����iVv�G�G�_�'a��A�R���ǫ�f�H^�^�"��̫�Q��Y�p*1;^g��!�q:_06嘾�X��^=�\�\�/�D�C�Al,�_�

��!�����Q[���Y�����kV������׊��Wpg��8Vb �5�I>�;���X@���ֹ��,Ʉ�<����=C��q��0>�cZ�|d�0�?I�]ɂO�!�~h���Y���Y�X�,��=ɒ��'@KC�K	i
�֬-��8"�YϮ��9�����А'��`�)����F$Ю��hf��*
��͌���n�8]
L�ŕ�2��S8�%N��M%n�%w�*���
�Jؾ���C	 �ߠ����6��o�&��w1�<@�%Y�o �%a�T;��Ȳ�{�@�����օ�J�Dӭ�ߠ(�`3���

4�f�?7{t�H@�0��!b~u�qƔ�#a�8���%<�5
"s��a�0Z
�A�tM��P���8,8͙\
O�aG>�U [...]
+9�,�i�.<r)r톦��!U�A����v�J�W����2��1�y���t
E���	�n���"
�#T�7�N��Gf
� ��9@�
Q
�	߬G�3�"�&G��@�z5�؁�Ԃ�r���ǘ�l�	R�m��%�畛ti:��v�����M��r.r[W{,#�:V) .�|�	�[r����b[9��G�TD���E&s�!a�?
�/�#wr���0פ6"�rM�Q��..םڈ.���צ�G��N�83I˹�!<�[�.w�S39Ey����,�X4��0K�2��@�"�&u�\���8�G�$?i�u=��OU�q��)g[�D�7^Foބ��9\#�Sؐk~s���ٔ�=Wn��ePv
��p��ET ��
L[����¬ؚ:�@^��I����V�����A
�|��
�4^�Bo�
Z/ٝc�@U�%~��0�\�򺬂 �mL2�Y��@����o"ܺ��ou���L�
i�0��8%Xd�f�io� :iڱƴ��?�^`��mQ'v��Y��j�� [...]
+�|�����#�j:ȳ�q�B��ϔ��_��,b/!�^ɺ#�@��t��/�
�6�Ͳ	&z���ۮ�b�G��?��H?�t�|d��� �j(�����v1u'����A[_+:V3w2�,�x�iAs��S��'n>~
[CT4D��V�6VgŰy�l�s5����k�F���<�c������d3��JEw�	IB�٘H�,$��

MWd� 
��%K��KB5
+F�8
ʶ��|��~�eI7��5���,:�ܯ�
Cq�b�1��������u΋�]�Y�T�����E.���H;-�~���/ ���U��:���^\HL�}����`�Y�`�9*(I���F�O�M+>���r{��l����O"诫�A��CD!U�
E�"A$/�'���;V���kC�_�%�ݻ���j�uY�o���$g+�<����l�G�m|ڲ�˅��Qx�T9ށ �X��
+endstream
+endobj
+8851 0 obj <<
+/Type /Page
+/Contents 8852 0 R
+/Resources 8850 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8793 0 R
+/Annots [ 8782 0 R 8783 0 R 8809 0 R 8810 0 R 8811 0 R 8812 0 R 8813 0 R 8814 0 R 8815 0 R 8816 0 R 8817 0 R 8818 0 R 8819 0 R 8820 0 R 8854 0 R 8821 0 R 8822 0 R 8823 0 R 8824 0 R 8825 0 R 8826 0 R 8827 0 R 8828 0 R 8829 0 R 8830 0 R 8831 0 R 8832 0 R 8833 0 R 8834 0 R 8835 0 R 8836 0 R 8837 0 R 8838 0 R 8839 0 R 8840 0 R 8841 0 R 8842 0 R 8843 0 R 8844 0 R 8845 0 R 8846 0 R 8849 0 R ]
+>> endobj
+8782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 686.007 289.866 696.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a10e3116398b920cb137cf576a073cc68) >>
+>> endobj
+8783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 686.007 359.324 696.911]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 673.372 159.193 683.278]
+/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
+>> endobj
+8810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 662.084 290.971 672.988]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_ac4e1b49845e553ff84dc73e710def76c) >>
+>> endobj
+8811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 662.084 360.43 672.988]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 649.449 159.193 659.354]
+/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
+>> endobj
+8813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 638.161 224.003 649.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1b528a2e8d4d096f62535454e05b74ba) >>
+>> endobj
+8814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 638.161 271.594 649.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 625.526 272.49 635.431]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+8816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 614.237 254.15 625.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a5cdf44f392505e1371a85b1245775224) >>
+>> endobj
+8817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 614.237 338.263 625.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+8818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 590.314 284.585 601.218]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a7ff92e5d40e6faf667a0b1f6b8fad791) >>
+>> endobj
+8819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 590.314 354.044 601.218]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.632 577.679 513.996 587.585]
+/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
+>> endobj
+8854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 567.375 197.3 576.281]
+/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
+>> endobj
+8821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 543.477 241.726 554.381]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a06894477c4e748b61eb0779ea8c0600f) >>
+>> endobj
+8822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.617 530.842 407.658 540.747]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+8823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 519.554 249.318 530.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_af6df34e5e4ab9beab41cd76897d64c72) >>
+>> endobj
+8824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 519.554 288.321 530.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 519.554 371.519 530.458]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 495.63 240.62 506.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a688572fbdc35859515f5ea8ba583a45a) >>
+>> endobj
+8827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 495.63 324.734 506.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+8828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 495.63 389.5 506.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+8829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 433.49 153.097 444.02]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a07bdac3717a59f64634da7d9b1cfaefd) >>
+>> endobj
+8830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 407.2 180.198 418.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_abd8e73adc9b36c272118525242f9b50a) >>
+>> endobj
+8831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 407.2 204.267 418.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 381.285 193.029 392.189]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a508103dc808fc747a90b573083a60461) >>
+>> endobj
+8833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 355.369 193.029 366.273]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) >>
+>> endobj
+8834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 329.453 165.911 340.357]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aee33974909cfc1cba605734a57d44df0) >>
+>> endobj
+8835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 303.911 187.689 314.441]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1a26d0018999e56d94a7e96db2b6e553) >>
+>> endobj
+8836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.557 289.906 476.544 299.812]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) >>
+>> endobj
+8837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 266.663 202.902 277.567]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+8838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 266.663 300.037 277.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_af39e1b0519a47aafb9dba4121dc41a9c) >>
+>> endobj
+8839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 240.747 202.902 251.651]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+8840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 240.747 314.263 251.651]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549bdba93fede) >>
+>> endobj
+8841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.819 215.205 199.864 225.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a5f6fcc1dab2b08eff20b41d1412d1e2d) >>
+>> endobj
+8842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 146.966 203.075 157.87]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+8843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 146.966 296.324 157.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
+>> endobj
+8844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.377 132.332 331.306 142.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 119.045 294.481 129.949]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a7fc86a6331f34f34a506ab2b0609ac37) >>
+>> endobj
+8846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 91.124 287.856 102.028]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3628b6d6e250d4c6b8301173c6ecc777) >>
+>> endobj
+8849 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8853 0 obj <<
+/D [8851 0 R /XYZ 89 770.89 null]
+>> endobj
+8855 0 obj <<
+/D [8851 0 R /XYZ 90 450.104 null]
+>> endobj
+8856 0 obj <<
+/D [8851 0 R /XYZ 90 424.2 null]
+>> endobj
+8857 0 obj <<
+/D [8851 0 R /XYZ 90 396.558 null]
+>> endobj
+8858 0 obj <<
+/D [8851 0 R /XYZ 90 370.643 null]
+>> endobj
+8859 0 obj <<
+/D [8851 0 R /XYZ 90 344.727 null]
+>> endobj
+8860 0 obj <<
+/D [8851 0 R /XYZ 90 318.811 null]
+>> endobj
+8861 0 obj <<
+/D [8851 0 R /XYZ 90 281.936 null]
+>> endobj
+8862 0 obj <<
+/D [8851 0 R /XYZ 90 256.021 null]
+>> endobj
+8863 0 obj <<
+/D [8851 0 R /XYZ 90 165.888 null]
+>> endobj
+8864 0 obj <<
+/D [8851 0 R /XYZ 90 165.888 null]
+>> endobj
+8865 0 obj <<
+/D [8851 0 R /XYZ 90 136.317 null]
+>> endobj
+8866 0 obj <<
+/D [8851 0 R /XYZ 90 108.396 null]
+>> endobj
+8850 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F39 2335 0 R /F24 537 0 R /F67 3022 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8897 0 obj <<
+/Length 2343      
+/Filter /FlateDecode
+>>
+stream
+x��YI����W0�Xz����m�t��K�IO�4��(Hb�ې�t+��Uظ4[��d�KU���H��C��W�_]��<'!I����I��		B��;o׌��m��R�~�at��e���K�uq>�}���}�k��|s�u��7[7��iש�
?�v��5�2�B��k7b���]��~�~�`/�aj�D�����?Sg��:�xI�<�A��
���f���jP�X�B+���R�ƔNw�Hǝ���U_e"��N��H�~ґ �l]�xQ��D�C-�RP�Raj�Ӎi�+U�;K^���~0��&+;,$�Â	����Qo��H'�77u'Z��J�_�0�g{Ԇ����nx����Qׯ��H�z�Q&�%���AXD�81c�

[�T%E��}I���2��

[J|'�-�>ni����g�B��hz} ���k�?clM.i� ��8�P�_>���
+�(�=Hj�E>;�y�<^}�]�/5�5ZU���C�tBl<8 ,��xTC&�"�c�8-�t�V�yAJ@�Ct��S� ���S��u�2�������`��w�O;��Fѷ���z�0/06m����H23(?�PX�PW�Yՠka
?"1
�Kуr��q3a�ЃR쀴�x�چr]��R׎`��cA@\�P�3����X���}�ac���ac%�u4��4db��<a�3*�5��s��I:14���4/
���]��
�͏`�_͂��;bZ���J���?<3��0
���|�9Z޴��+�/�* ��GZ<��@����`_�i^M�'
�z�`�ؓ�
�5X�L
L��i�V�y�E>�mк�*�e>#A�B6�m,��V��it��j�:$Z��
!T�����������"�E]��<3v���zo�	��7�`S�i�y�S�ߧE.�O$F�	'Ws՟���P8�.]�nyë}^
�Cԕ*L�Rrq�������LU1l
�#s݃��S����h�S��x��l�-:����ÇR,��:,�q�pF� 0yI�/4�W��p�
���
�č$���w�h]��Y}��c��6p �0��xI2�u�xP*ǓUm����z�Gl���~W��H���e^H4���ui�PWv��
 #��x ګ�C�g6�!�f��'��#
�NCO*�j�<��p��]w
��(u�
�v����m��aU.��3�Y�z��(~����X	G^�$ߙpS狐zóQ�X��

�w6 {4�ѻ���Z��8��r��a����Ν��x�j�&��;!q�mƄ�n���֏@_*���๒ʆ�潫jÃ^�h	k�(R��rt�ؗ"e�� �{����� 
32L@[��%�c�l��ڞ�C�]W���k0��JW>�٢^��.{y`���JmJG��DPZ����}_��j�e�xL��
�"癠
��!Kʼ˜�_��\
+���C���B���^o
�j{!�;�w�\���,�5if�y�!ۙ8��b�9�=}8s��o(�
�N����
p� �
�P���XFB�x 's��,j���:�T���sz�F�$
�%X;~!;�q�j���1�
og�C����j�&
+�X�!��"��j�X�!
��˺��
�}G>��o���6[��A��<5�!D�b��8�r�P�e҉���$�2D�
�e��o|��vu\ޜ >~�L}!�1�� 
��:U�
�\d�]y�'�f8V�Z��������`fpUQ�P���>��A��z��DX�Ƿ���c�_N&3�3���H0rk�f
�����@9�?��c3�m�A��UK�ĉ~���x��]f5(NyvR�
�~�����
K΄�>萡�vzbvJ�#׽�Xp5��:��x�G���b8��Ǧȳ\,�".��3���Ph� kK�1q�
�͐���@%w�	�!��*M�/�W�S
�E'��Ԭn���M��
`Ǫ�+���'o!��G�]8����:��?>����������
p�o�r��
�}�=��5S�+#\�����v���M"����@{'�T):��W�@���{�Q�����b�w�DNH�.[��w
��r�l|�<�Q�����i��D�|�$f���ؘ�4$$�Ҳ)l6S ��K�s���U
&����'ĉ�&�'O�S)�D�^/1�s
MR
 ��%�e'�
�׺�3�V*tS^0�)�$r������_A��-D�	�x�:�������m�`�w�ϴ���[����f�0�����K.�F]jV�e��;�Ծ[Iӏ�.����hn��w��Gy��;�H����25�ʺ�i�pEFk[��0t�5�����E�+G���L�
�ߔ�s[���߿� I
+endstream
+endobj
+8896 0 obj <<
+/Type /Page
+/Contents 8897 0 R
+/Resources 8895 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8793 0 R
+/Annots [ 8847 0 R 8848 0 R 8876 0 R 8877 0 R 8878 0 R 8879 0 R 8880 0 R 8881 0 R 8882 0 R 8883 0 R 8884 0 R 8885 0 R 8886 0 R 8887 0 R 8888 0 R 8889 0 R 8890 0 R 8891 0 R 8892 0 R 8893 0 R 8894 0 R ]
+>> endobj
+8847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 657.923 226.034 668.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25055e33235) >>
+>> endobj
+8848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 657.923 341.43 668.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 629.903 156.281 640.806]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b) >>
+>> endobj
+8877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 629.903 180.351 640.806]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.562 629.903 218.816 640.806]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 601.882 180.54 612.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a87d004db7f8febf6f9c96b4a2a1c85e5) >>
+>> endobj
+8880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 601.882 228.131 612.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.864 601.882 290.118 612.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 573.862 178.239 584.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e17201a9a12235a9a96cc31cfffd38f) >>
+>> endobj
+8883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 573.862 225.83 584.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.563 573.862 287.817 584.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 545.841 178.239 556.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a9e17201a9a12235a9a96cc31cfffd38f) >>
+>> endobj
+8886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 545.841 225.83 556.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.563 545.841 287.817 556.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 532.828 156.281 543.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b) >>
+>> endobj
+8889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 532.828 180.351 543.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.562 532.828 218.816 543.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 458.491 198.074 469.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+8892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.945 295.962 182.89 306.866]
+/A << /S /GoTo /D (index_sect_rational_grids) >>
+>> endobj
+8893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.819 182.786 398.978 193.69]
+/A << /S /GoTo /D (index_Grid_Space_Dimensions) >>
+>> endobj
+8894 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8898 0 obj <<
+/D [8896 0 R /XYZ 89 770.89 null]
+>> endobj
+8899 0 obj <<
+/D [8896 0 R /XYZ 90 704.258 null]
+>> endobj
+8900 0 obj <<
+/D [8896 0 R /XYZ 90 519.113 null]
+>> endobj
+8895 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8917 0 obj <<
+/Length 1392      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6}�W�S�	!\H�L'/mO�6Mc�/i&CK�©D* �X�ō)�vǹ�3~���rq�
��Ag����S�Q���eh~�
+�DR�4��%z1������rL�
V���}>�|~��&O�w
+SQ� �"G����k��0�
̋
�7F�0��O~�˸���(Å๎���HP�)���Q���X�i�]�IRB���DMP,`�)ӽ6���a{�R���DP� ;1ͱ �Y��O���V�e,��ЙkgO3��L�u2�
"�l��f���}U��P-�����2����3�
^�j�M����n���Ƶv�,����S�F��SU�I���ʚl�J�~N���)g�
p������Dg% -)�8�
H�f��'Ł��i�I
���������;�\���9��!Q\��pM�R;Y/d��G3�1g�s89w[j�,V�	��(��V�NcK�]Y�
�� �vg�a�걫��]Ml%��+ɗg��U͙L�
���X)�l����a
s"BԦ��0�P
�j���r�z��+�Qy��� x:���T]�ۥj6n����> ��"k�ʮQn�v+��^;q'B�{��	�8�GN�m5����s���$�@�izc�6Dg�
�	�
S�A��O0�tuX|��cl��
+�n^�����`�(�I��d�1N���y�^O�~}�E��Č�GŬ�]W��F�XB�(����
+K:u�w��\�/�	�ҿ�W�a�F
>Y��n4��Ձ���1�N�'T0zJw
�cwc���P�nқ{���ܔ���nY/]�6���s]�:Cp
���c���,�
�r��Q9p�iVO�堟Kk`K@�hVi�2��!;�BP��N���7���|@��M9�0�S�$�φ+k��??q�R?���
]1$�����$���,P�`��
+@��( ���H.p��h���n�IW�FAti{1�n[�nW��n?b�����h3��~ḃn�F{��W�/�6�R�tR�K���3�����N7{@�QM��&Ȩ&��@����y���Z�r�d�
�o�=�;�	+��n��_��b���� �����q��!_�
v���q~th�'2�

<w~ٔF��ez��;�2�\�\�c�\n 7[#v��O/���ҝa��S��g����I3�)�O��
���V5[U���܀�I�O)dڇ#���O)�����T:

���zư �����`a���|��A��L�}3�׸�ُ�~h���]
��C�
R�C���pG��.Y�fH
/^�l;�C����i���KY����Ηtո��t�dn�sH޹�.]6�����5�$�
���u�G���n��z���0�*
+LD��^6��i��,�০>:� f�I#
+endstream
+endobj
+8916 0 obj <<
+/Type /Page
+/Contents 8917 0 R
+/Resources 8915 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8793 0 R
+/Annots [ 8905 0 R 8906 0 R 8907 0 R 8908 0 R 8909 0 R 8910 0 R 8911 0 R 8914 0 R ]
+>> endobj
+8905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 601.627 125.447 609.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 517.162 125.447 524.688]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 425.689 125.447 433.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 349.194 125.447 356.72]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 249.751 125.447 257.277]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 173.256 125.447 180.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 109.679 125.447 117.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8914 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8918 0 obj <<
+/D [8916 0 R /XYZ 89 770.89 null]
+>> endobj
+8915 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F91 766 0 R /F60 540 0 R /F32 772 0 R /F7 803 0 R /F11 621 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8928 0 obj <<
+/Length 2523      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�8~����J��� H��G���d+����V2�%H�D*$5���6� /Q�<��ʔH�F����!�`�����n���($$�x�.��*L���k|�0J$���t�a��$-��݇)��bsX�E�޽��˴<�ܼ-��t�%��}�V�~�K]NY<��\�H�h•��r����۫/W
d�ý%Qq0�^}��
�>�D$q�`��A�<7�OW?^Qw��aW�
ߏ��2�H�Dlʨ"��@1F��Z��X�Q�i��W�g*)���
���n�=X>��������q�UI���nޭt�˴.�&vdWdym��]�BNx��#���?ۉ��8
��ǩ�/��Ŝ��\{0���ΘbDJu�Л,���ψ>�C_��7�(���0D��,j0*��I�Nkx��I��f��U��8��W5�΋�N��]cV�8��9.t5/��,_�h��d:S<��Ncp
+��y�/���Y�c�t��K�s�tc<�������5_�i�޲�<�ab�K�e��z���`�gJyY�юZ,���e�M�g��z��n�sn���é
7���mˇ��/���
U�Q�����\���(2��,�\N
rc��Q�pi^��-�t�:�1c1Q4�` n�׏�v�1��+�}f�9���
%�'��UI'�b�A�%��y�p�������}�^��`f���V���:b$	�Ԁ
��M�K��n�m��`Qu��;��׋Ga*!�+��f���`6�əP1����%0���íʽ�,�^��'?��������?5���ɽ	d�l�0��Ō������JuYi�F0�1�
ج
g��(��
a8���Z>�ȫK�' p��t�܎�
H���8A�Mf<�̴*���9��D�#���B���@""
|6gl�?/�RW�"_�Tŀ�Q�k<*��\
��]"IܡI7�|��!`� �	��>S��t����e�瓿.k]�M�� h9 [...]
+�<�v�b87X\�j���/����1�S 
+h��3�)�"�U�
�
2���H����0z
�
+z�I��߽%�F��$f�ۼyF<�
+r�؄��5�?\@�O�]Y�G�뱐�@����	�;��pLt*xNT����$�n���h�B]u�uH��z ҭU�d.4&h>B�[BBz|�
j�X=y�3��H�O4O�G
H��꠾g����B}�l
���ϡz��!��]��>�@%�`� �@��]��#7�b�8�
�?b��} e���
�7�R	�ܗ|4|�^�z2:t��#�>��sJ
�8�">�깐*�D].���m��c�#J��O��/(d��i����	���r~�W7_��oHp���u�߻��<!-�^?� ϱ�3�h�v�}1�	��8���/Zn���L褡o!�vP
�L�-g����R�i�1�|�b�Ȍ���`�.��
+���H����P��c��Z,�#L��C��
Fy�8���(��WGĔc
���.������܍�s����%$LlMr��uy5I�5DA!

����'gU��^��r��5�"֗�L�r�iE`���(�.8���U���m�_�6���{��)^{Jq�zB��k<�{�M�f���
���[�<�53
�6n=�U�I�6x2l"��i�N��4�wC
l2�S%��
$�f�C����4��!u]�y�I�M
��1i/ѳ+l�l���� ���
�=�GY
�E���#����+�t�'����0I{g
����)�,�Y>
t�܁7���Xh�D�
�Q~
$�:�������<N��9tۜ�;���,8��ga(&�Rf�k]NC:1�(
+՗#ǫ7���L;�Jl���<���
��Dɣ��OLm�g�z�p�t*�:y���>p��)�j��iY@%'ϻ7�[�>f`��]�$��Qޜ���i.
�^�i�oK*�(Up��CL` P��m_��D�T�d���t�#��
 L72V��9tMa��əˀXٶs_��
p����І���W
ʥz��u%;Ȏ�
����i
��=�����9z"��C�b_�
1T��l��ל�qBu

+���*jQ-}�*��"���z�
�$���g����p'�J1e��$���
y"�`�` ��
,�a�d

^��֑��Qe M
q�8#�9U��C*@�i��7��q/i
-�v���J��
+K
+
��$""dg�4��rSɞpS%x�M��f�!#*bg~ʍ/m��o���s���P�7��?�D
�q�?�����b�
v���	d]�@=>��+]�i*����}��-���I	�O�����m��b�����OZ�3���
���p�8LQ��|]׻���������̋mOó��U|����9Dg����ץ�
�ν6@�_�F)S6=��λ��
���w[�� %����?��LE
+endstream
+endobj
+8927 0 obj <<
+/Type /Page
+/Contents 8928 0 R
+/Resources 8926 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8793 0 R
+/Annots [ 8912 0 R 8913 0 R 8919 0 R 8920 0 R 8921 0 R 8922 0 R 8925 0 R ]
+>> endobj
+8912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 709.04 125.447 716.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.745 709.04 175.659 716.566]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+8919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 578.041 125.447 585.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 441.727 125.447 449.253]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 329.324 125.447 336.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.745 329.324 175.659 336.85]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+8925 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8929 0 obj <<
+/D [8927 0 R /XYZ 89 770.89 null]
+>> endobj
+8926 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F32 772 0 R /F24 537 0 R /F8 802 0 R /F1 834 0 R /F11 621 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8934 0 obj <<
+/Length 2770      
+/Filter /FlateDecode
+>>
+stream
+x��]s۸�ݿ�O-ճ|�D���.N&wI�ƾ��#Q2{�#��ʯ��$D�V�k;}I`�X��.��u��Wg�_�=y�@"�(�Z1�HD�
>�4�OW?,J����?����Ż�K5wvqu���)
�@�8	����p�����L�[
�	8e�,�˳��aK�����k����V�1K��(&,�	A��^��R��������۹C�������,a!y�ـ�y
����5J���5lx��ʬN�Jo�G�U^��
땄SD�8�D�Y�'=�IxЏ��4!ߙ�YL1�0��ڽ���vNb���A4�$z��dzg2E6
�}����YZ__�m�i�4;e�mޞ��O;�l���T�&]g��w�=Ž�'/#<0i@gb�"z
4�D��Mި�$�fD�w�f[dn*33M��m^�Ͱb��� ��߀0�(�7|I�	*��'&-�v�	ofs�
�Ռ
+08LKK���矆�;J�YYm�R酙Ik;cAdؤ�Ic&‚�
ARX���=�/:�p
F����7�/�e��r	��̄�/�4�&/��||�Q
�Z��i�i�-�$3Pg}�uV7�:ش�V�Rj����6��ƈ!H�%���Zk��{�Pss�
���~���">@F&?� N��0��7h�5�r{O�K� d��0
��<��Ύ��yxi6JXV�iX��(w��D�QL��t?I��:�֑@�Ò�mUg�Z�E��B�C���������|�1�-�q\�ڪ�7ik�H�>'�9���~�H�;f�D��C���{��&Ȉy
e� ���x������
���
�d�H� `$5���ŌmÈ��,>��4����F
��*����ho��4Ӣ2',>����
��|���s3O��Hb���6NyH׸�ώ@�x�m昢X
���i�tyn<��	�j���2�e՚�]cg�Q�X0)k]m���� [...]
+�ؖf��|7ydw���;�al>���0{���8�u?�2�
��CB�\�ӓlQ`(��L�t�64>���Û�xf�KV�{��vu{cދ����i
q4+̗�JaD>�� �@�R��w�����^�C�O��)�ZA��Ù���4	�1x4��#�8�
���Z���z&
S@��ϴh,#�	ܳ~���Ij�}���ٍ�W]�
��|�[�NLx�
���(*E�m�.�ji'�3�

�;��Ùծ\��I�����I��6՗�٦��z�o�Ri3A:a1�ڜfk�E�(�y����W�V��܃�����Ayـ+
�ULCK
+�2�.���Rpo�Li��1�$��@]v��[�*���!�W�a����5X7�es}���Z(����
�Ax ��x��R�U
+ɷx�A����Uo�C0f+-
@E�*�?���?z	3������X����qV!P�*�����M8�%��'��q�iD�T�C2� ��9~$���C��T�)��-6�Ƽ��=606�92�oA耚��
���! �|}��0�*֝�U|Bo�N��(��Fؕ�J:
e�;�6���@u%�`x�����#�����8ARs&c$X�'pG$��=Ib�����{%%L�EZg�]�>�*�K3�
��<��`D��z��wPI ��Rɼ\�3�,i!��L-�J"�x7�DJ��~�L��Q鮭T��p����Xu�=��Y	���E�1����,]���� ,.ۏl=
����EQ�����Ε��B{�5��+�E�+m��-ZG��$ۯ��e,�.R[�v���6��v	�f�D�6��%{��tQ{R������P��pk�9��2�e�*I�Ô�1	#�?����>�

�䄀�p$%GV
!�
!���ɩ��oj�F]�7Ei2�i����V@:8;�=v�
L����]�����P��S�*���/
N�%�:d����ʾ�sZ�.��]�*7���f�$�=�>a�u�	4
�&�d�I�.ڝv��%	��q��o�R�
�����!�q�k���U���2-̰�\��?�
 ��o4�iS���W��w
3�R�J��2	B�X�K'� ���@��{%i�/�Ͷj��*�t�a���"3��]�Jc*瀢��60n�H�0�7��js$K�w�r�T9�vS��=b
�Ƽ�s�بPAX�-�{[#D]�B
ɀ
�5A7�࠳9���S��na��h��<^d��j�ә�+��f�g�q�톈����r��M:�
W�&�&
��}W�ٵ31�����;7�(��D��]7���Ѱ*f����lYO�@1��4�=HPM/Lb��7��Z���p���ͯi7��Kޟ
�⨳�N��������k�S��c������'�wd���#���F�]��"�
8Ց��~�=�߂�2Y^d��;��(tJ=�\b�����k�/JAٟO�C!"�.[����_.>\^ؼ�

���=�\T
�s��RuV?M`�1J����
e
����N%�y�ɳ��[F��YB�E�0]��~���KG���M�nb�����\��3
��U8h��Z�I��M7v�=8HU��b����
���7�'b�N���`!�EH����`k0���Ởtk������ Y�n��=Bma ��q�� �K�6���߿1/?C���Dq+ķi�Km�^'�&5݅&�d�:K�M�	�Yf�lh��#�'Sl
h���ZŻi���' [...]
+endstream
+endobj
+8933 0 obj <<
+/Type /Page
+/Contents 8934 0 R
+/Resources 8932 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8793 0 R
+/Annots [ 8923 0 R 8924 0 R 8930 0 R 8931 0 R ]
+>> endobj
+8923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 709.04 125.447 716.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.745 709.04 175.659 716.566]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+8930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 394.38 125.447 401.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c) >>
+>> endobj
+8931 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8935 0 obj <<
+/D [8933 0 R /XYZ 89 770.89 null]
+>> endobj
+8936 0 obj <<
+/D [8933 0 R /XYZ 90 179.519 null]
+>> endobj
+8464 0 obj <<
+/D [8933 0 R /XYZ 90 157.143 null]
+>> endobj
+8937 0 obj <<
+/D [8933 0 R /XYZ 90 157.143 null]
+>> endobj
+8938 0 obj <<
+/D [8933 0 R /XYZ 90 88.177 null]
+>> endobj
+8932 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F8 802 0 R /F11 621 0 R /F24 537 0 R /F91 766 0 R /F1 834 0 R /F7 803 0 R /F32 772 0 R /F94 771 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8942 0 obj <<
+/Length 1934      
+/Filter /FlateDecode
+>>
+stream
+x��Zے��}�W�)!����/�'[vTr����y�U[Xp��2� ��
�`y�8)��"`�����ݧ1��s����o&o��X`��T���@q������)�H�ٜ`���3��a����3���j�by��c�������}
/fs*���*,���'�����M#
H�9�J�>?�0��a�넀-8 ��R:��ɧ�8X�������jPp��
+>N�5��`���ߏ�A
��x�?1&�Z!z
�!CF�����>�(��
+S�8��0�$�s����Ĕ�+AF4[���q�Ֆ�

l�
�b��}S�D����/�f
�����e}�:x^���3#bj�2k&�0j�
ȷʊ8}
My���߂HD��� �

��#5�#��T
i.�{^�I�f'ǰB05��[�K�.�"�m�������k�?cLmï//x���I�
��y����d]nw
��^�����S3��%�M�*�Y\�z)� %W>�x5b�Lkh*:6��&jt�R	m�=��kd��.��!_���:;�C�

y^UJ}���Ǭ��D����d
��� ��#�E
��`y��}�Z�!��zw�rqw���s��h�|ƅ��������W�`
��GD�c.��Q6���%�\v���q
/�{��Do"��IgLW��%x�

!5�n]���E1�8I�5N6I�G�ZՆ�ūZؽ�T�a��-�:
*��~����Ѕ�Hj�Sň"�)c�+e�Z�Q/����Q�(2��Z�^[�� ���)>#dZ���&PPX�j&T�C�ЄZ���z�� �N�g,�l.`�"�wلC�� X"
��]�>��,<~��M�)���T7�/�ʢ7�jD��
��X�v
�I��*КR����8����q�4���
�9
*U#�E�h��Wq��k��#�x0���߂^h�@�So��([�vm�I�fHQ��@@GݒUJ �D!I�H��L��2��qڗe���K���a�
��h���Fš�JT6�Pb���5�dzB
�/Q��%z�;b�
�aP��'���p���:��o�c�z��q��rZ'�����Y�z�2�Ar��k����ip��58���*~�:Ҙ[�|�x��
��7+p���|���{��R_��c ��V7@��
+���@|��ŷ�/ [...]
�rr����FK��y`�7M
+�
��>n�mZ�QG �m�]:ŷ��M�8,m˱�=�L�G�<KF�v'M�w2��,/�����q�BT+d����#^֊R����{+J�������o�Y�*tR\0��h�f�2���A>
l�ё�Wv�}�����K8
 �
+�_yn�<ُR
�I��G�����
+��>ҁ)4�
Lh;ҁ	�;R��� .�� ��|W��0N�#�)�N*�w�D�N��
9s�a�yG7�)$ U^�>^xvӬ���yl^�{l
]1����U#_'7)�2r��qpJl�d�^�=0�ԱM�m_�6׺sx�Py�
����u��kع��mw
IJ�~}�f�h����o�]���3!��
�3L7�jw���P��&�un�˱��3Ht�mB�6�����ǤJ�;s���[w���,�wo�>m�
�(ʒ׹��
��K���7{I��63��$,;9
��UNJڮ,诰�P��F���l'6�~HX�]��۱��*�
+endstream
+endobj
+8941 0 obj <<
+/Type /Page
+/Contents 8942 0 R
+/Resources 8940 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8953 0 R
+/Annots [ 8939 0 R ]
+>> endobj
+8939 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8943 0 obj <<
+/D [8941 0 R /XYZ 89 770.89 null]
+>> endobj
+8944 0 obj <<
+/D [8941 0 R /XYZ 90 645.466 null]
+>> endobj
+8465 0 obj <<
+/D [8941 0 R /XYZ 90 610.796 null]
+>> endobj
+8945 0 obj <<
+/D [8941 0 R /XYZ 90 606.313 null]
+>> endobj
+8946 0 obj <<
+/D [8941 0 R /XYZ 90 517.958 null]
+>> endobj
+8947 0 obj <<
+/D [8941 0 R /XYZ 90 464.269 null]
+>> endobj
+8466 0 obj <<
+/D [8941 0 R /XYZ 90 429.599 null]
+>> endobj
+8948 0 obj <<
+/D [8941 0 R /XYZ 90 425.115 null]
+>> endobj
+8949 0 obj <<
+/D [8941 0 R /XYZ 90 336.76 null]
+>> endobj
+8950 0 obj <<
+/D [8941 0 R /XYZ 90 258.762 null]
+>> endobj
+8546 0 obj <<
+/D [8941 0 R /XYZ 90 224.092 null]
+>> endobj
+8951 0 obj <<
+/D [8941 0 R /XYZ 90 219.609 null]
+>> endobj
+8952 0 obj <<
+/D [8941 0 R /XYZ 90 143.209 null]
+>> endobj
+8940 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8957 0 obj <<
+/Length 2220      
+/Filter /FlateDecode
+>>
+stream
+x��[K�۸��W�PU��cnٍ��f�q֓��5EK
�*�$SԮ��� H��H=HL���e��������`
�������)d$���c`p��AB��,�R%ǟ�
+�Ԉ	���?���7������܏����� R:�&���p0��?1��?�FI�)��2�0���TWD����BBCjj�0�"
i,�8o�N�M�X���@'�'C�� '�c�Ug���OgP�}nLX
H���;�
�	2B
���cHۯ��'
Q�r���c
�-�-!afa�s���fww�՘���h��=D阩p�K�U�֫k=(����Da:@ z<S�8"R���ĵ�Rle���?��1���
+
.
�5{��������?o��,N�
+�
+E]�T#o
+k�n]�� �2�W	� o��W�
�:��E�5.�AL�V�XH��W�zLgYxLL��E���5�]?��f�z�!#Hr0I\7�e��gOq������b��̵����Z�G����"�`�4��.y�-�qm���h
-���l
��ao�g�#W�D_�.q�r��g�c�DӢa5ڵ�;`���L��_�
 y><�ණ n	�NEb<!�����0J��4t!�P!���"�M%کDk�nJ�~�h�^�		�O�,m��bX<�=H��
QM	~^|Na��pw�6]��_ ��oX����J��?V����
��wE�?���z�]s��^��K�Z�O��e��n��emx����f�$3
�[Dc
QSm�0c҈�ly�1A\� �֮��Ų4��]��W�6����A��j�hTl�����}_)&D��x���������؟�y��X�Ԍ�Vv��	8j�y�32D����*J�,N-�/D�
�[�s�4臜�.$b��"�y!�C��a�@�G�-������
V�	�Ue]�(E3ޔHbR8���U��J�8xWc�{1���|�,�
%���7O&�;�X��(�&�7�vi\ $���|.z
�-�;-�h1�8��Z���r���a]�Y	���5��;@d��d�oD�d��P="�*S�b!��D���c�b�0I��\��/��r^3*�xN��[B�5�S����}���c�BB����t���K�Wū�t�
y�5ܥu�
|_���8�[�ⶹ�I�ވ���L�{9H`
���>fn�� .��rP
rH9�����C=��L��h�=��L���P�wځ���x��g�t�����r�� C
+B\A,�����飲צB��k]�eAh�Ju�����k�C0/��8g@�,	��KB���^jB
Qn�	y�,
+5D�.
+1�B��n�h��`��d%�mׇ��*N#c��D�5��*�qe���@��m���O�t��OXo��F�%숟Z���uɢݫ�	��W��i�㯛�b��>�/(q��-���zc'����t(������1�Ū�)鳪�
1C���/����F�D��Ѱ3�����5o�RѴ���
z�kK
^^[��?�n $��'�z#ޖM3�/��O3��X��g�3`��F
W�|��5�!�45	̽��>gZ��GS��7fz1���Q�E�պH��dS�Ůf\�����Yߐ/�Wi'�-�"ګ�<��

[�d/�/��/S������˩�2Ǧ>��cM
�e�<d��LL[
�=�4�b�
�C؈f���ϖmp,>��(7d�
D(���ٲ`�G(�R��ɐ��t��}�!�
��RVv�q�	5qa�9��+ڒp֖�w&�vA�� ��S��)3�
�����w�<!�!O�0\�L䉜ޜ/�5Yn��́�p�3����2<;F2}8�������A
h�b����a�bX�uѢ� ��{���Y!��>K?�
�F�K��0��f7
�(I;��|c�0�룛B )���Q��
+GF"��׍ ��e#����*���Z4: �i
������i�)js�=3��4��zQo}vu&�~�E�!��6
)������þ��
h��6/���C��2zgS����ʦ�*u}��:�׏l�C�&
E�©��g���
H��k|a1�
����?�}���%,���p��
 Kj���.��Z�L�߿����{�

��G��EKwo�8�[J��!w'�l�X�ʆ͏ ���ET�d�O%��G9�k2)
AQU�yʲ���ןw�-�4]'�5�Cgq���<�e� Y�qY���I�
�[ s�
����
+endstream
+endobj
+8956 0 obj <<
+/Type /Page
+/Contents 8957 0 R
+/Resources 8955 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8953 0 R
+/Annots [ 8954 0 R ]
+>> endobj
+8954 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8958 0 obj <<
+/D [8956 0 R /XYZ 89 770.89 null]
+>> endobj
+8959 0 obj <<
+/D [8956 0 R /XYZ 90 718.682 null]
+>> endobj
+8547 0 obj <<
+/D [8956 0 R /XYZ 90 671.658 null]
+>> endobj
+8960 0 obj <<
+/D [8956 0 R /XYZ 90 667.175 null]
+>> endobj
+8961 0 obj <<
+/D [8956 0 R /XYZ 90 590.775 null]
+>> endobj
+8962 0 obj <<
+/D [8956 0 R /XYZ 90 512.777 null]
+>> endobj
+8548 0 obj <<
+/D [8956 0 R /XYZ 90 465.753 null]
+>> endobj
+8963 0 obj <<
+/D [8956 0 R /XYZ 90 461.27 null]
+>> endobj
+8964 0 obj <<
+/D [8956 0 R /XYZ 90 372.915 null]
+>> endobj
+8965 0 obj <<
+/D [8956 0 R /XYZ 90 319.226 null]
+>> endobj
+8549 0 obj <<
+/D [8956 0 R /XYZ 90 272.202 null]
+>> endobj
+8966 0 obj <<
+/D [8956 0 R /XYZ 90 267.719 null]
+>> endobj
+8967 0 obj <<
+/D [8956 0 R /XYZ 90 179.364 null]
+>> endobj
+8968 0 obj <<
+/D [8956 0 R /XYZ 90 101.366 null]
+>> endobj
+8955 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8972 0 obj <<
+/Length 2319      
+/Filter /FlateDecode
+>>
+stream
+x��[�n�F}�W�i��r�K#`z
:әx� A�a�m	�ő����s�ER�L�t�D�T<u��]�i�E4��������#Ns

n#G##
QO��c�(Q��g�����h�,g��U��x1�<NG�����f�,?�x��r2�����i�Z�������l�·)��`:���>
~�x3����A���"�F����O4a����l�g>iI.p�F.�sA�mP•���bS�ml�1�XmO�[�+Kg��$K�D�oY�Mc����/~f4�
1���}�O��
������v޷�=��dچψ6�|�-��r^΀�e~O��-'��|���]:��YWi񩾸U��J��	�#�1�c*��P���@pK��
	��y}�V
t�U�חJ���|�E6,�QE�4�&_.
[΃i���yo��<X9#
1���7ڎXh"�:���Vb�ڔ�0PQ
+qJ��7�����7-brF���|��������u�̖%�#�VR
�7�������kY�d�,����~�ӏW����n�k�V�#FT����S��������~:N�O�ŕ>�Vӆ��!89J��&�Q��p��B��!+nn3n�į�U�̻�
`��wk�K�M��t9�V�)+'��aq;����j����|���|��Dt��o|l��ٓ�6י-VŤ�e:���ȗ����t8}�5�r�
s
+;�W7��O�s
+�j�O���[�x��ۼ6��~�m�	�,��Np��T�}^Dœ�4Մ�av�Ҩ8�&l����Rm-0�D�UgT�MYLs
�)G�՘��AS
9���	7�V�J��d~F�r��	�E�V�vi�d��5;cW�� Y��<ְ�F�
K9�
s�SH�
+��j$ 
G� ��3Ej���H��
�yAy���Z����|�L
�JV��L���Yx|X�3���{T���l�T�?o�A��,�t]l�#�y��y2�U�u�R)��	
����0�ϐ�$�R�R�p+wʟw2��t���,C���
�H��&*Õm"��j��8���T��L���
/�wH�,R�aE���PQO��]6�N�˞T�b���9�Ģ*�p�̆onPI�6;6؈
�	�bc��r��*�Ř�A'��jBt�E���ju��u[K�*)Y��7e?єe���G�i�R�[,m�Y�8�=��h2�A}t�V������n�����Wp���B�pD�3�r��p�\����s0���)b�n�9���[ �%f
��Mt�&�G\tY~o���� ���H
5
BP�a9
� ��a; T���
@��U������qr�v�n=�۽��v���u���d[	��ͨ���
eQtlp����gm�'��d�~jA���J�oZ�$A�?�Cզ�Dx���Q�$�H~�.��[yS�A1�j���)
Y
���~��O}��	C�r�N14W�\��0��0\����)�\Ҋb(Z(�\���b�a�w�	v��זW�mG*�.�$-4:��;S���!F�0����p���Z��T�uhW�#�2�Lu�0�QܳS�3Ej���H_�p�.�� �n�c-�d��8�2�)�9� �&�v��t��qb
�a�!��0�?��l�����
��Oc��3
���a��
pS�m���mxlg �]��1$��8��ieKW
�h0
m��$�7j�#��Om�� Q�F<�%����0p
(ʛ
��)$&f�)���(+ݞF���(�h�\�9E�y�Aok�z:�b@g�
|�Q�a; [...]
F�ݮ�F�ω���팃b��*Z�a
�f,Vm�zW��Z�@�A���x�4h��4�?�8�i�c���������>�3�A�
H:�+�9�üx.m�0���w5���"k`��
��',<��ZL�����a�>��!��ż:��a��X�Z��7r��2�`�����[�s$���e�f���6�
1�C��%�:b#Pb1LI��e$:�S<S��N�!�`�Q}1z��mn7
@2��ߙ;G
�V��]��'{�g��ntu��"z�t]l�#�'2�%qv:�q�d���"��z��_�@��
�k�3�	��ȝ��Cw�+ɉ��N�&�{fjb��k�	}45q�mu
 2��g@�旈

�8�+J���5Z��s	C��,���އ��W���=��?<����<�;��� �eaZDa������[h�!M���_T���"7��8̠�[w��,�qyy�p��� o=m�j{Ad6U�}
G��!wyt��Y�U+�l�"zh^j
+�
�Ha�<�Q��,_,.��D�z%�O��4��
+endstream
+endobj
+8971 0 obj <<
+/Type /Page
+/Contents 8972 0 R
+/Resources 8970 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8953 0 R
+/Annots [ 8969 0 R ]
+>> endobj
+8969 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8973 0 obj <<
+/D [8971 0 R /XYZ 89 770.89 null]
+>> endobj
+8550 0 obj <<
+/D [8971 0 R /XYZ 90 721.073 null]
+>> endobj
+8974 0 obj <<
+/D [8971 0 R /XYZ 90 721.073 null]
+>> endobj
+8975 0 obj <<
+/D [8971 0 R /XYZ 90 630.481 null]
+>> endobj
+8976 0 obj <<
+/D [8971 0 R /XYZ 90 564.439 null]
+>> endobj
+8551 0 obj <<
+/D [8971 0 R /XYZ 90 517.814 null]
+>> endobj
+8977 0 obj <<
+/D [8971 0 R /XYZ 90 513.33 null]
+>> endobj
+8978 0 obj <<
+/D [8971 0 R /XYZ 90 415.077 null]
+>> endobj
+8979 0 obj <<
+/D [8971 0 R /XYZ 90 349.035 null]
+>> endobj
+8552 0 obj <<
+/D [8971 0 R /XYZ 90 302.409 null]
+>> endobj
+8980 0 obj <<
+/D [8971 0 R /XYZ 90 297.926 null]
+>> endobj
+8981 0 obj <<
+/D [8971 0 R /XYZ 90 185.661 null]
+>> endobj
+8982 0 obj <<
+/D [8971 0 R /XYZ 90 119.618 null]
+>> endobj
+8553 0 obj <<
+/D [8971 0 R /XYZ 90 77.486 null]
+>> endobj
+8970 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+8986 0 obj <<
+/Length 2427      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۸~�_����
^D�
Ї�l��6�i3-���lkl����L�_�Ë$Ӗ�ZX
0օ<�xxnߑp0
p����w��
R��ǧ@�@�
+���r����E�,s������?~���^=��vG������dy��3�p�� #�d�l-��2�]��v�
�(ׇ��!Sd!���`�	�p>
���aH�A\,�}L$bHj�3��!�HI�`�GA�)L<(CF�bH�`3O�E�#���z{< o�qÑ
l^���H���pD)��9
�B��<++�mg�	�����[P$�嘥
�
䙝� �*�)�#�[C�`��G���u=9B`m�Q���"��V�//qYv	
+�@��C�z�1�cIł(Hqn�����Ւ��˗��=�}��7��t,X)$Xc��T�D����E�F���j�N��1����_Gxk�H�*��BK;��u��������gf����|��Z�킭2��2�f�0ċY^��|�=��2��;�3צy�fye�I���Ws7?��A�J&��z�xӡ
�oɤ�m;�S
+m�F�h8b��<u�<�|�8 4��[��
�$8wx�&<���H6���fԓ5G� �w.��o��V�4-����e�X$ee�YS�SY����}�0B"�S�j��
h�j
�]
�"�[��

��l��!������x���2���!��O��5N����w�m���m�e�t���I�:ږ���_O��]{S��M`�"�x�PWk���!+���1���r_��*��F�!�p� �6tXU<�߈·O�]��Q4��gH�pq�+�z\w�+
�
�w��. KJܓa��
��AZ�λ��P{�Hn��m%ې+��j��.'�3��q
�caѧ�\-��Z[*�!r(�9�gF���XU�OD�3�+gQ���7$D^���eZ_E"�0�dW���%�\��b^
)���GB���R�$�vYAѿH�Y5���0䃼8n�r�Ĭ��:�r��
!�cK�<\s
��>΋||�ٕiW5R�"R8�z��)JʮP
+Qo
��"gK��=�
+�I��K�S��) z�u
vW2��\��<I�Cut
f^O���Z�
e���r���#�
��̞S��9fG�=l�����Om�w�v�.��O6C��t� ��
�|
`�f�]�}D5�"�����.�?Lˡ"f`\
-�PL�,.�"_
	
4g�	�zRA��ܱ+|�WuU)�i���B*�\ JgY^$�:�
�M�<x��&�\�]�
s҄q�z�M*�����|b
�K�Y��O�����P݄��.F�1�I�&9����n+	�"4�–'�v[J��	��@A�1B���~�
)L����pJm`T9p�|�N gu�C`!Dۈ���P�p�C�h_�I�`6hAԶ
h�5��3RnE{����ZYW�1�&��S&
�Ro�����nE����g��_i��*L��b�U��ƚ'T�<
�y|�*��
l��S��<��2��vKS�|՚OL8j˔��+{�����^˧��a�Y��7�	d���}���*�P������A�vMنpi�F
D�aL���y�U
��b�
���E`J�'?ڄM���
!��;`E\��Վh{���\D��v:J	��_I���>��/��qL?��Y���
���
�Q�Z).ZeM�2���# �9뽉A�ѐ�ʳ~���A9�7����yU��1Z
,G��&F�
CH^�"�~���D]����s�u3cg�W63��^���v�[zv9����&+�
Ƌ�̶���p�5���@��n��<�֠:���8�GK�%�5N�ǃpa��
W�x0 �L��Jn�(�
+������J;�)��q��;3Y_i5������ʞO��
�݀i��/�'e���c'>ɒ"6LG����J�v��<�̝P�����CV��pW�j���~�\��

��:�7��l�XO�ݖq�\�}��P5˃�v�����M��"��V턜�C �)J�9Z������:�x:B�m�Y�h@w;����s�(�1�!1v���u���ui\t�	H�Q�]�(�(*��߶��?�|�׻S����Ѥك�u���	$TxFH��B�~u�}	s&���"J���w^�@���Z��/Ұ
+	F�H����x
����}Q�
�Y3
+�W��e^�'��&��M�-`ۖ<��׾�HE�
�(D����)6r�
t(�l��K�o�~�ΨIxg~��51�+���
�b"�׶�uln�s܅�7K����V��Z��%K��(����P����+������eR�Y�Rs��.����
�Lm�Ek��U�H�I���>&�
����3f��I�
�_uΫj���~���I6C@��3r;Y)�EC�����2�iu��ťy��'
�������
+endstream
+endobj
+8985 0 obj <<
+/Type /Page
+/Contents 8986 0 R
+/Resources 8984 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8953 0 R
+/Annots [ 8983 0 R ]
+>> endobj
+8983 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+8987 0 obj <<
+/D [8985 0 R /XYZ 89 770.89 null]
+>> endobj
+8988 0 obj <<
+/D [8985 0 R /XYZ 90 721.073 null]
+>> endobj
+8989 0 obj <<
+/D [8985 0 R /XYZ 90 616.469 null]
+>> endobj
+8990 0 obj <<
+/D [8985 0 R /XYZ 90 550.426 null]
+>> endobj
+8554 0 obj <<
+/D [8985 0 R /XYZ 90 515.756 null]
+>> endobj
+8991 0 obj <<
+/D [8985 0 R /XYZ 90 511.273 null]
+>> endobj
+8992 0 obj <<
+/D [8985 0 R /XYZ 90 425.235 null]
+>> endobj
+8617 0 obj <<
+/D [8985 0 R /XYZ 90 402.858 null]
+>> endobj
+8993 0 obj <<
+/D [8985 0 R /XYZ 90 402.858 null]
+>> endobj
+8618 0 obj <<
+/D [8985 0 R /XYZ 243.423 345.686 null]
+>> endobj
+8994 0 obj <<
+/D [8985 0 R /XYZ 90 339.046 null]
+>> endobj
+8995 0 obj <<
+/D [8985 0 R /XYZ 90 280.295 null]
+>> endobj
+8619 0 obj <<
+/D [8985 0 R /XYZ 90 245.625 null]
+>> endobj
+8996 0 obj <<
+/D [8985 0 R /XYZ 90 241.142 null]
+>> endobj
+8620 0 obj <<
+/D [8985 0 R /XYZ 335.617 171.83 null]
+>> endobj
+8997 0 obj <<
+/D [8985 0 R /XYZ 90 165.19 null]
+>> endobj
+8998 0 obj <<
+/D [8985 0 R /XYZ 90 106.439 null]
+>> endobj
+8984 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9004 0 obj <<
+/Length 2640      
+/Filter /FlateDecode
+>>
+stream
+x��\Ys��~ׯ�SV���)�x]{�J�U�
���@		hAҲ��� ��H��ͦ�/&
z�����i�8�������n�^�Xb��T&7���Dq���owɇ�`$�hL0�����tR�&��#��r���������T�o޼��ј
+�~������}6Ϫ�iV�2�$�)Uf������7W�\����H�d����'wp��#ft���N|.���~��A
�����#(eȞR� BZ:!�D�kZ�K��hH���
Q&� ��S)2�4 �M��mL�#FaEG��~UPJ�0QPʑ�]~Gc���|�fZn���!+H����%
$s0�����A*��tbƑ��;��v�ϙ7�a�Gc.e:+��Ƣ�s�\�z��lRݾ�r�}����?ԙX��?����Di= ����CA`J4-���1Si��1�f��n� �� Nc!�b	j|t+_{��o%n=1V
1�
S������f[�	��l�m�udR�8&��|�#ǤѤ,���
+�t8���fI�f���"'g�Y�&�Ey[�DD��*cփ���5�7�|��!C�A���|��^)$a^���E
o�me�.��,2����դ���v^���i�,GT�#)�l�rϪ�cwW �Bx�e��o���]9C�ȋ�����
+a���r�tO�߉}i���H�J�Sra�w��X�d_�}�%�݇��ZH�%����HE�Y1	
��z�l����d���Bg*��]e��o�ІP̑�,���˜�j�-��)U��
xuWӛE�m�x"p��$ϊ6�
z>�H+��U�k�r� �$�y1+W��M>]f��
̀z����E\׼D�QR' �r.��N>��q'Hrq9�3]L'�:��t�
�٤.
+O�D�1V'���X
���R!l��5��:5����:�ر�̎�J�L?��~�vhjW�)����C�Ѱq��
�tԎki�("��I���qm�f*���g�뺊�I�:z~�u
�;{��=$B��땗�<��`HA��:����QV�g%�}���i��
P�
�I
�#vbB�[M�����^旨f:x�� K���9T��#T�hs at u ʫ
�@�j\�2��_�Y
��~
c�f�.
!��}���(�����y�ԝ�Hx �
��fhnE�� \�}��/�.g��
J# )1�\"�U��U��u��W�M�
�s�l�
�Uߊ ��
z��2a����Ob�T1���T�Cndǩ�!�M���
+�
O��U� ��*#'�-z<m�Q���E����~�Cv8� 
+�@�{&i(��b�l���g�
+��u��������c^��03L�~X�E(� �Q�_nM��>]��W�
+,�}�l��d�ͺ��r��&�;�������
�V#��ޑ�
:ϔtm�'{q`��ӆ�]Xd�#N�����s�DZ�
+V^��
�P0��#���
�t��Hp"��
07��-]���uz
��g
+�0>��� ^o���f�fl���V����_�0a���u
�>I!zD����=
H�BDZg�K��@�@��
�'�eH�����1�J�j�)�=����i�t��%�:�)Ŗ�M	�J�y\S
I�Β�N��ˀ�[R
HcHwYQ���L�l5�7
D�#\�4���)a��́fkHG-� W��g at .=y�Ԙ.���^�-��
�w�O��wE�]ً�]�o-�-p��ߟ��U6�-
V;�ۅ�9�Y4K%ӿ.�{Z�e�Ǿb
�ȣŊU���
YHj
+~�Q�4�]�kC
�-
>zзw�>�F��@�F$�E���]��� �<w
b_A����

����V<��C�Y����<���W}
+6���U����:� W
�+
+J�]4w(cg�r��2_V�4���p_ȺR��l������EF
漒����F�������Ւ���l�'�8j�;��� �Y��ĝE�<}�.�SxH	�-�yI_�
+9#^_$��ucdO�3;#
M�vF����;6�F�G����<4	+Ͼ
+ C��n�{*����k
+"=��՜��U_�
���x���W�?s��sA�;}�QRą�~�G
+8nf��\�#�1��=�>�;
�zȁ�S �x�)��Q��>eS�=��Ϙc
D�w�Y����
�?p�e6<e[lʭ嶵_?u���Cv����s:~D+��1:~V����
��_�׎��R�
;~D�Bp��ge)�;���P�w�:j�`ǯo!T���ˊp`سx	&N_<Wz���N�_��hOC-�����.�	p����&�K7��)��iw�O!��$̫�U7�c�pL��	pN��By/%��8	��Ӫ���%�D`4�	��I0q����eXz��;X� 
γ�q��@"a,�-��LY�����Mm�i����e8z͸��7im�����D�LD�-�ِ��q�[��6����Onk^��׆�8~����Z
n:H�T�d���N�(;���WV����7�/�\_��/��Ϊ?��H��Ǥ�N����Ӟ2V��C��ֶ"@�����,

��OR_��[�;8����)O����ׯ��O���f��Q�����Ax���ym���`y7Wۺ@uE��6dY	D3�,�/���(E݈���c�`����K�^�"�v�WI���
+endstream
+endobj
+9003 0 obj <<
+/Type /Page
+/Contents 9004 0 R
+/Resources 9002 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8953 0 R
+/Annots [ 8999 0 R 9001 0 R ]
+>> endobj
+8999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.826 315.829 452.756 326.732]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+9001 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9005 0 obj <<
+/D [9003 0 R /XYZ 89 770.89 null]
+>> endobj
+8621 0 obj <<
+/D [9003 0 R /XYZ 90 721.073 null]
+>> endobj
+9006 0 obj <<
+/D [9003 0 R /XYZ 90 721.073 null]
+>> endobj
+9007 0 obj <<
+/D [9003 0 R /XYZ 90 639.224 null]
+>> endobj
+8622 0 obj <<
+/D [9003 0 R /XYZ 90 604.554 null]
+>> endobj
+9008 0 obj <<
+/D [9003 0 R /XYZ 90 600.07 null]
+>> endobj
+9009 0 obj <<
+/D [9003 0 R /XYZ 90 510.559 null]
+>> endobj
+8623 0 obj <<
+/D [9003 0 R /XYZ 90 475.889 null]
+>> endobj
+9010 0 obj <<
+/D [9003 0 R /XYZ 90 471.406 null]
+>> endobj
+9011 0 obj <<
+/D [9003 0 R /XYZ 90 388.72 null]
+>> endobj
+9012 0 obj <<
+/D [9003 0 R /XYZ 90 274.06 null]
+>> endobj
+8624 0 obj <<
+/D [9003 0 R /XYZ 211.842 209.81 null]
+>> endobj
+9013 0 obj <<
+/D [9003 0 R /XYZ 90 205.173 null]
+>> endobj
+9014 0 obj <<
+/D [9003 0 R /XYZ 90 122.641 null]
+>> endobj
+9002 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9020 0 obj <<
+/Length 2890      
+/Filter /FlateDecode
+>>
+stream
+x��\[s۸~���S+�D���f3�M��Ɲ>d3Y�l�奤u�_��7ȤnD2�6/&HQ��w��h��%8ys������+�d$���"18Q� !�l��Q��n~L�Ԉ	�r����O7��yg?�z}s����pB� ��Nf���p2��?&1��Gw�*��q�����.u�H��}�'�İ9,O��%�DL"�@��CRq�Ұ�X�h����3��)N������n�V��I�ZDR�8P%ںH�
U�.�b�ZE^~/q�^��$��f��):�ާ~��=���;�mL�h�ܹ�h6������"���ӹ?�r��P5�`��z��>�t)Ő!�=h<�J���
<z��O�ќ!"Y-��tEu��}ڥ$������F1�L&����ܮw��K;������OE߼��F���t3&�4��9a�ź�,ߦ��-�,��f���t����2�>�������|9�l<

����?��J��-tt�^>�
뼼ϣ
�y2(��V��Q���
+���Dp�	-�C�)<�A�
�,�G�
�|v˭g嵩?� fO�
�\n�?
6%A$"L���X������O|�ޣ	�`��Խu
uhL!�Ip&
\y��'��A�FQy�@�Z˝P)�����_�W6��,M��Wi �˥���)*�l �˭��W����
�
~�k���1b�D�a�G�x��vSi^u�͆Z�j��q�@'!��U�)HTL���k�ԋ��.i��6c�@TCR���?����M��z�}�l��q���wٓ>cM��t�@�P
�C�C��d_��^K��N8�XTB�4Y
I�(�LÌm�d~w6���W	8�}����Ř���n�
�6C��,�La>� �?U�8$��TC? �
+9n0ӛ�bm-��
{�ou$21I�{���|���bK�����c��4d49���+��<�`�6`U�,/3���QO� Q�C��kFV$�:�i��
V�T��aѱkia�lau���C�(]=����K2D/J���Ct����K�]x�|t��1G9�'L��S)���d]n,l�!�Q�i>E��>M��������&q�cޥ�AZ�մb��Ŵ��g��&�&��3
�H� >_A��3�Le��˷�-+���{|EA+XwD��2	'A���	���6�cdt=�M���y'�(
��u:™�+��6S�����l�([�R�cFG�!#W4u� %:�`M�g�4x��.'z���՛"�H��r��k�_�_���	��wI2��[nt��C@<<��÷Y�N����  ic
��Z�n�ڼ����
����A��]ʘ��*q
aZ4oj������ei��*
���ӂ�G
"k�������d���ٙ{>����N�e�ϻ&
�k,N�0�n��RHeX^��R['
Nt��C�p���R�=	ۨ�u�p�
Sp#��5�H�V�#�
`��
�bl�Uw��g���!�
�
&��{.�g :�=�9֋�mwn[o���`�/��(�J��I5,Oh������
U�P���
+[�v4a�xF�'�ɢX�����'ɾ�U���CZ�$��2�	_�R���}6��e:?� �"�l�)�k��������{�i�
�ly���age��頴7 (@_]����t�6
)o���\(���� �%:�ȹ@��
���R܊
�6��DT�
�P��c=���t6�en*�-]���*��ۣs폷��e��LN7����m}o��؊&C
�m��I���ױ} RRϱ%z<C ���s���̻�*=����a�t���I
�|�J��v]�
�Q{�.�F�΃H�br�%z,A!B(��%�T�Y,�O��0M���֤��<����>�.�H��S�*ֈh�-ѡ�i��Pq�s��a	'�c	�J�O����ɝ��'�"�Ω�%�`�r��B
jp�N
��ӣ0�-/�d���:�t
��g��L��d:�P���L3�>.�6��ĥ�D:=�H��T��"�~�x�]�:#+R��|����� c��&2��4*e�dz�� �I
�Ml�
�&ZjNU�:�s���7�
��`���ĚM�|���Ȇ�M
 ��Md�!��6���(D��TC�;xL�9h��l� Sy
|���T�]��.�=�]Bw��Bz�Ņ��iX�^�!I����Ϟ�ppL[��
�?�z�x��:�f�B�5���ԡ�H���
�f��v^��됴#8d�(=��i`����܎��I�+��sH;	���Ѐ 0
58N����
�2v
�3yc�=F!5`;�������ič
Az1c� Ձ��Gɇ1v�@��E$��;@D���`Ș��~FƮk	AӔ�oҼl�u,��&�
_��/B;�H��K2�j��q��8�!
��ܦ��~�
þ&C!X2g%��/��F��
���a��(��(����a;
�%�8@�A����K��<��
�Lg'>P�����|
��"ELV)�@�f�<̈���ha���d�r�&�Pnk�e�˧ѿ� Ҿ�J�%z,	�J��%1�g�5��R[�/EP^>�������S��=��FJ�%�b���	ʁ�t��.��/JP�o�W���v��@�8��
�so�%:�f8���|ї�09�=�Ajt�ɖ�[��W�@��/\i�������ܻ',�o��թ?T�4
���%H��+گ=4�4����A�O����5I�k�9��K��� ��d�/�W
÷b)R���?Dڿx��v���}�~�
���^��bɟ� �7y�F`�[�> [...]
ӻ��~�MZ�~,Ĩt����ҏm��7[�ESD�@ֶOiC"x�wiZ�i�ۿk���s��NP��{��>�z��vw��A�x��l�l
�ͫ\�*1]��:#��+g�a{ �_:��g
+endstream
+endobj
+9019 0 obj <<
+/Type /Page
+/Contents 9020 0 R
+/Resources 9018 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 8953 0 R
+/Annots [ 9000 0 R 9015 0 R 9016 0 R 9017 0 R ]
+>> endobj
+9000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.826 687.633 452.756 698.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+9015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.826 397.245 452.756 408.149]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+9016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.826 131.166 452.756 142.07]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+9017 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9021 0 obj <<
+/D [9019 0 R /XYZ 89 770.89 null]
+>> endobj
+9022 0 obj <<
+/D [9019 0 R /XYZ 90 621.556 null]
+>> endobj
+8625 0 obj <<
+/D [9019 0 R /XYZ 216.764 557.306 null]
+>> endobj
+9023 0 obj <<
+/D [9019 0 R /XYZ 90 551.289 null]
+>> endobj
+9024 0 obj <<
+/D [9019 0 R /XYZ 90 470.137 null]
+>> endobj
+9025 0 obj <<
+/D [9019 0 R /XYZ 90 355.477 null]
+>> endobj
+8626 0 obj <<
+/D [9019 0 R /XYZ 211.842 291.227 null]
+>> endobj
+9026 0 obj <<
+/D [9019 0 R /XYZ 90 286.589 null]
+>> endobj
+9027 0 obj <<
+/D [9019 0 R /XYZ 90 204.058 null]
+>> endobj
+9018 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9032 0 obj <<
+/Length 2786      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~���SK�d�qї�i��Y�7�>e��(��D:$����=�!)E��آX�43<<���9#
<8xw��۫���X���T��@� �		̓�!�H�ɔ`�Û	�a\�⻛	�a�|~L�E|�>�/�����]��'S*p�f�����,�bBT�d�(IFdH�|������՗+���o
�`����	sx�c��*�V/Z�2�.�߮~��QanͥN��pJ#�y�V���g�S��YY3�Er��
�[�c���r_�VmK�#��4�:��#��CV���%p%C��
��9ሂ�"E,zT�qx�8�P��!�3k���__�ل��k�L�wq1aQ��^%Ye��
s02�*(�D��2���>I%�IJ�F�9��>����[f�&]� 6E�=N�������Sa��%�[gs��:��HEQ��w���אV
��1-�H,���SBLM�l����*�_&h��� �%��3�
Iq��y�m�0�DL)��#VSH/F [...]
+�5'��r�_w�� �MP]�b�� 7F�L	-��f�B�>�`�
X 5���Q�׋"���4��g��߱��)d�p`�����Ж�3��4K���	U�J���k.*b�I]�+QN��
�dBDh�J��/s
*9���&K�o�ɓ$-:K���
.��q�~.��V��	<LCJ
+��O���9
+0QKV�b�gc��
+w��(A�łj�Hz�a�H�#�|���$AO��W����۲�D���2��d�u��\P�|��R��7�� R��
+�ݣTm�L�[�
��ӡM�
t�P�r�1��
4)��8�ĤS:��)��lj�@�Ζ��Q:�Er�p��ZL
(a�Y��F�Z֬���Ɗ�]�]
����h�^@�E��\�*��{��[Z=Z΋�|Jf�DU>B]���o7�kT5OL� �#�x
+T�܊�6{�o�������
�cs�*�~d���諁��rݾ3�`
������
���M;c��ˤl
��������P�����*�v(���T/N4���j�I
��UR�>
+	4*�/�ҾB@���ؤ
�G�N�.(��Z�36�#MnӬ�� b6 �s�
�5F$��K�q\��|M#����Ǘ5���-k0]���x�E�CgI{��
؜��\ �n�,��t�)Z�c2��t��9�
�(�4��/v�y��.�f����t^��WIW�o勁c�����t����L
&�`�]��w����ϳղۛ�$�O�T��M��'Q��ȫR��`%�?�G��e܌�g���?�I���̻�j��\
�'��ٚ��P@s��E}S�.�mwЏ�B�M����������2Fƽ����s5�[�]��i�8������^l��V�l
����{�����ݎ	$��>]�7��չf�Bm<��*7�~T"���QOw9���S<�
�t��<�l-�tKC����	�6Z���b�G�\P�/�N�^��
~����h�G��:�
�]�m��S�v�>��ٺ#���n�~��v����I�
���

�s�͗b�p]CMcG�
6�
���v�y=\?ԑ1C�j�i���_����S�LRL���	{�W]���r$7��9|7�c9�{3}7b옾 `�?�
�
2�37�r33���2������^�v���C�#��
x��}������p���Sw�Nա���ރ�u��p��I�"� ��;V��
��:,�L�gyV�iVZ���;r��"�:O��BnۨiN���ϣ;��Y;�
IJs&c���+~xd׫R�b0�iFv���� �0�Xv�����@�)�om���
Q`�Ȩ�U������ �3H5�+�P�3�P��A`�r���L �ȹ
 ;��`����8�
+q���߳m�;z�"&~��E4�oҁ:������s�!�9�
�N�
Xh���
(�"�U���#J�q!�!�-��e�T0"�z���c���k�C���if�ڟ����F���4
�ܞ�	a�ٹ��0�(Ę~1C
��~O� �˜�8�k��G�cN�F��od|Jڢ���g�G�?aL
c�mk��KH
D1j#�l�b�9(Ɛ��KS���ぅ�8,���_~"�ZY#�_��U��6?�|Lf�d���c~���<I'��@]Q����B!�^�*�][���Ǒ��ާ�u�
G����5\����{F�\v����r0�l�A=s-�8�����2Niz̧
P�Hk	
�LP �Hl
	l
�BQݞUP��!����ւ�hZ� 

�4�+��dg��J˅�;0a�n�q�>!!�*Vsj�/B&)�5zL���zW3f��w��w�
���I�9lӄD�9����x���c�SiA��A��4���Լ��M�`�!���nk
���l(���L�"P������{{��2)�:"l�9��qt&�~5S���
�%�<�2�&S�҇�%I#�e�s���d�d��0�a:�����ׯ��e�= �
�i�'�)[��U^t�
�b��Q�S;��	���h�
+�re�Q��H�׻���}�y���
����7����⋯
+endstream
+endobj
+9031 0 obj <<
+/Type /Page
+/Contents 9032 0 R
+/Resources 9030 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9043 0 R
+/Annots [ 9028 0 R 9029 0 R ]
+>> endobj
+9028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.911 595.109 340.584 606.013]
+/A << /S /GoTo /D (index_Grid_Frequency) >>
+>> endobj
+9029 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9033 0 obj <<
+/D [9031 0 R /XYZ 89 770.89 null]
+>> endobj
+9034 0 obj <<
+/D [9031 0 R /XYZ 90 718.682 null]
+>> endobj
+8627 0 obj <<
+/D [9031 0 R /XYZ 216.764 654.432 null]
+>> endobj
+9035 0 obj <<
+/D [9031 0 R /XYZ 90 648.415 null]
+>> endobj
+9036 0 obj <<
+/D [9031 0 R /XYZ 90 567.263 null]
+>> endobj
+9037 0 obj <<
+/D [9031 0 R /XYZ 90 464.159 null]
+>> endobj
+8628 0 obj <<
+/D [9031 0 R /XYZ 289.989 399.91 null]
+>> endobj
+9038 0 obj <<
+/D [9031 0 R /XYZ 90 393.893 null]
+>> endobj
+9039 0 obj <<
+/D [9031 0 R /XYZ 90 334.519 null]
+>> endobj
+8629 0 obj <<
+/D [9031 0 R /XYZ 90 299.849 null]
+>> endobj
+9040 0 obj <<
+/D [9031 0 R /XYZ 90 295.366 null]
+>> endobj
+9041 0 obj <<
+/D [9031 0 R /XYZ 90 234.458 null]
+>> endobj
+8630 0 obj <<
+/D [9031 0 R /XYZ 90 199.15 null]
+>> endobj
+9042 0 obj <<
+/D [9031 0 R /XYZ 90 194.667 null]
+>> endobj
+9030 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9047 0 obj <<
+/Length 2493      
+/Filter /FlateDecode
+>>
+stream
+x��[K���ϯ�)��,
ޏ��޲�8���i��ő8k%jLR;ѿO� %��ޘ8��H�`����
G�G����xw��b�AFR=>GG�$$<M�O1�t���I����U�������Ǐ��ݻǻ����qR:�,�>}����0bFG�u�e�)��"�x��
nx�^��^
�p�
˜G�0d���È�8)�eZ�ň����ڣ<8��[�Ҿۓ
k3sT2�d��|S��F&��#!����#=�n�yg�	6H1lb�
u�=��Ɉ���|U}�*BaT��1!���u�t�Rm�b
�V")4�ij]��D�*��X����$���z����hL���|jot��ה=7�Y��N�*[�c�r����Y>kZ�i�u>�8�6��4K���1C��Ma����~Ø�^�x
M�>�<+O��\����)u��l��ө{��	����}�cXiw�U�
_YA$"W��A��� ��j���ySo�		��qM�Vm�
nU
kV7����X�E����5'�{���,흦�1i�]dU�赽��2{Z�h4��?>��j��[dOERl\�
�)M����%[��f�ܵ��Y8��ʖV58ʴ��P�g�y|L��p�E�*\�eZ��,-�ϊ���ıl؏���՞���N����a����b�5��
1I���߷�
7߲�"��)�#�
+�0k�r�f�S�gc]��녳��Z^�i\ �_�,O�zv�i�d��z6k|F�v�:f֍Z��+C)"X;^(9A
1�kiy�ʬ�+���e����0�$�P�hd����$�5�`��-)�U������<�,P*��4
�j���=~�gv4�����}��&%ӑ����A�`�a��>+�U>�ȔOR�0�a��������.>��[�����(8�Z���{Bt��lJ&�D ֢��$Ȁi��` Z���)�Y�~��X�R�\#�T��͜�y:-�	$�2Y��X��mg��� �	3�/�78��m�t��a����6�m;!�
��1�
�I�s��{��8w{瞁h�^�
}u>���o@�Ƶ�a H�8�h\�O����I��:$�vP
+�EK�H�����P��%G�Nlj�L�Ȧ_��0���4��#&�9��}CJ
+��F���눨�
+:�̗�q^�l}͝M��7"~O�@�o;5 ��# �Z\�
���M^�������r��8�e/�-�zب��k��S<��mn���
��`��Q0B!ڑ�D����@���3�0��!L��_C ���	Қz��`��1 n��I����i�IUe��|����"u��ة��/�4��
t�x
���1@��`�k��*4S����e�a
% �X�e�
���
P�'妬�eo�v�r�>��`
%S���5H�j`޼�Z�aA]�Ь�'��]^T9�:�@��8q������ ��-
:,�
+���Q�<�����dɣnC(�G��T� �< �lQG��U8HK����.���I�
+1
�h�՜{n�N� <�H��<�O��W	m|��*˫3���*}�� E�æp7�<��� 	y
�}x��)x��Xr��[���:
��[�ȅ�9�!�B�b!��ge�d�nY����J���+U_>:��4�V*N@�
�ɬ
*Y��v��%+��`��8޺d�&��^��硒7���{���)�_�bQ
Z�濼k� 6S�n�X�:�_U5@d
�Z 3��k:�{#~u�ٍ�� gP%Y^�����o�&оf�fk�ݍL�Ӵ��g�9{��

(�+�s�o�^?��CX��Wһ�hU��9
����m�1(���PЂ�,u�(�R�4��`^@9�
���:�'�]�
�i�΀,la���:l@@��(o�y2{� �
L������,nK	����szVu��������,�	
d


�&0 ��R'0 �=V�to�k���~���\p�s���{	v	�~�$�h��0k";�r��mN�Mc&T
�d��x6t�
'<C�J/�j%<

�i�_�+�b��A�
��* �
M�F0�1�
�j��pڶ�wI2s����F}��J���R�xWg(p}j���
t�`{���&�ei�9b�t
�f�AjfNZ�؝�[&�������x7�����d���M���y��+zX��"S!O�^O�TɞOkkt3%c��
��“���2�~v�<iG�<I�z� T�P�6M��2M���,�͒�^�����4�A�@���g�!���ܟ~�[M
+	S��߁YL�����}����i��qɢ���؎��w[��{#�@��@����v"8���?���i��H@
w��H�u��-n�f�YZ���8&����p��X��i�xa���-�w?�txR���Ƽ�^
��ֳ2�g�o��>� ��6_؞;_���ւ�� �q�G�������
+endstream
+endobj
+9046 0 obj <<
+/Type /Page
+/Contents 9047 0 R
+/Resources 9045 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9043 0 R
+/Annots [ 9044 0 R ]
+>> endobj
+9044 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9048 0 obj <<
+/D [9046 0 R /XYZ 89 770.89 null]
+>> endobj
+9049 0 obj <<
+/D [9046 0 R /XYZ 90 720.814 null]
+>> endobj
+8631 0 obj <<
+/D [9046 0 R /XYZ 280.943 632.654 null]
+>> endobj
+9050 0 obj <<
+/D [9046 0 R /XYZ 90 626.014 null]
+>> endobj
+9051 0 obj <<
+/D [9046 0 R /XYZ 90 555.308 null]
+>> endobj
+8697 0 obj <<
+/D [9046 0 R /XYZ 90 520.638 null]
+>> endobj
+9052 0 obj <<
+/D [9046 0 R /XYZ 90 516.155 null]
+>> endobj
+9053 0 obj <<
+/D [9046 0 R /XYZ 90 455.247 null]
+>> endobj
+8698 0 obj <<
+/D [9046 0 R /XYZ 90 408.622 null]
+>> endobj
+9054 0 obj <<
+/D [9046 0 R /XYZ 90 404.139 null]
+>> endobj
+9055 0 obj <<
+/D [9046 0 R /XYZ 90 333.408 null]
+>> endobj
+9056 0 obj <<
+/D [9046 0 R /XYZ 90 279.719 null]
+>> endobj
+8699 0 obj <<
+/D [9046 0 R /XYZ 90 245.049 null]
+>> endobj
+9057 0 obj <<
+/D [9046 0 R /XYZ 90 240.566 null]
+>> endobj
+9058 0 obj <<
+/D [9046 0 R /XYZ 90 169.835 null]
+>> endobj
+9059 0 obj <<
+/D [9046 0 R /XYZ 90 104.19 null]
+>> endobj
+9045 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9063 0 obj <<
+/Length 1958      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�F~ׯ੅��~�[�&���۸Ӈ4��KL%� J�߳,�,�K��L�^����=��3��4��������W�Iep�
(n���W�	F�Dc�1o"�øX�w7��r�4K�"�{��q�t}��ȒhL_��t���i
��$K�R͢�oF/oGG����R:�,F�?� ��7F���s=ip��:ލ~�ƍ�Qao�qΐ�s� �y�C
�����T���Q���+�;&�F
+�`L1†;�3�*.�����!x�Z<V�2wO�Y\�'���O��"N����媲 �L��&ERK�S/7��n�
 )��9��v�r5��eD��a5o`�FD�M�g<wp��ZͻY��Z�0��0�}`p<<��h��v
����zG�>I˪X�zJ��;��Y��BpP��Q�U'C�4�)�<\�AG5�'�e�s3��*N	��5�`m�!�DDC�RS�����E�yDH�b��! ����
 ���X�M
^_�I��d
��6l(
0A}(�eG
gy��,p4�B�'M�w��b�&v_<�_O�V�Qlک߸��n�#"�3&[l@ ��@G��
A��!���y���
+�K�1�IK)"m�~�$M
��n���@��d�X0ۂ��)�vN5˶��D
�'�nI��i�ru���~\e6mD����
�v������4g���@dԺ!����u
+[�
� �ͩ:��EZ�lk�޾��S��>�7
a$b���:0e��t�~Y�P�L 4����⠮âg�e.�N�A��I�4��#ݽSDR$.�7S)���Gẩ�^���%N��N�� �
0�>a0���c�l�����v���m�r�,��R��|M,�	[2�I�G@�TԽ�@T��UWҷh_�X��	�Lg�H����H��0��8"@o�)+h�Y
q`9�<K3NW�ԕ�݇A1~ˆ����}G�E,�
G{
� ����v���g�990̇-m� �:�M��m�i�n�y���I�%���4�bM �"uȓ
���\g�d�x���~^?ӎr;�ꫭm��w7[%��� �����|Y5
BV���WH�S�E<o�y�z|\U�H��f�j��t����
*�� &/Ȳ��X�K�-1���_o�:��~��֪��U/�
#d��!;Z�
 �U/
�3�� PZ��Ayf
���E!Iզ|�{�TV�b��@��8�b�&'����}�[������ɳ,)��%�&%l����SB� [...]
+�}H�9�Ścq�A_�a�
+`'�)�*���zH�\c�Z�`��
������w2��
6g[<M�0[�\��<���%_�f�LLX��,
�� 07�	��lK�����gW���
��#���E�!~@�(�K��
�7m<�b��R,L�Z�t��Wd
+6���&��
+�c��n
l5�d��h�QDQ���|�e�Y��
+���X�����ѹ�^�z�t�̓��{���	�)h�9$h4
�5���T�h�ّ�F>+i�-_]'I���P��1F�P�t
?M��y� c�l��l�bo}�AdԒjSG	�;�D
��E5;����>A�ʸ_���,�aG�jt������]��]T(D�2�$=�Ś*R.�|P�E!�9Ev]�b���8Yu���[P:������L�Ǔ��:�|/wG���av���t6��\���=�w�/`�N>�����{�N�X�@�̕��tڀ~�:���y:���N��괳�sg���2����3]WQv��&����ߪ TL���77o��oeZ|AH4g�s���
½��l�L����	"�E�-�n��4m���g���4���Q�rMgU�x}uu���i>E�����
4$���ӫ���"m�+
.b۟P+��AJJ��l�G8DL�����}��}���q������'�7���
+endstream
+endobj
+9062 0 obj <<
+/Type /Page
+/Contents 9063 0 R
+/Resources 9061 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9043 0 R
+/Annots [ 9060 0 R ]
+>> endobj
+9060 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9064 0 obj <<
+/D [9062 0 R /XYZ 89 770.89 null]
+>> endobj
+8700 0 obj <<
+/D [9062 0 R /XYZ 90 669.636 null]
+>> endobj
+9065 0 obj <<
+/D [9062 0 R /XYZ 90 665.153 null]
+>> endobj
+9066 0 obj <<
+/D [9062 0 R /XYZ 90 608.534 null]
+>> endobj
+9067 0 obj <<
+/D [9062 0 R /XYZ 90 554.845 null]
+>> endobj
+8701 0 obj <<
+/D [9062 0 R /XYZ 90 508.22 null]
+>> endobj
+9068 0 obj <<
+/D [9062 0 R /XYZ 90 503.736 null]
+>> endobj
+9069 0 obj <<
+/D [9062 0 R /XYZ 90 444.961 null]
+>> endobj
+9070 0 obj <<
+/D [9062 0 R /XYZ 90 391.272 null]
+>> endobj
+8702 0 obj <<
+/D [9062 0 R /XYZ 90 344.647 null]
+>> endobj
+9071 0 obj <<
+/D [9062 0 R /XYZ 90 340.163 null]
+>> endobj
+9072 0 obj <<
+/D [9062 0 R /XYZ 90 269.432 null]
+>> endobj
+9073 0 obj <<
+/D [9062 0 R /XYZ 90 215.743 null]
+>> endobj
+9061 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9077 0 obj <<
+/Length 2083      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6��+�j��
+���M�L�6u��t�d2�D˜J�CRq���H��HI��q�"E��}
8�8x;�y2�x�X�PRLn���HH�5
>��ϓ���P�W��?>L^�\�m�ד���&

 ���t9��3x�>���:x0/-N\������l����T
C�`�C�1aHca��=btei��
�6���D#��`L1�!���x4��W����Ey�^��*������wӨztS}��f�]t�Z%	�X��S�=��o��W\Z
1-�W��u��z:���v��f����;�
Ũj��b�U&y�xb��@��cB�D�
A��?�nc3gq^d����x��,;+�Z�1Q�(3���x#AC���c<�6�0�df��*E�2ڵ*�)�
+	��5�g[�7ֵk?D
rm���
�4��bD���.�e
(H��I���o�M��������,�]^f�'�i�aX�Sdx�yH���^�D�*/�R� ��u�J��:N��5�OX��X��@K^{U3\i��"����޼��(X��_���A`Ah��7��pQAx�
+�#
�>f\#-u�L��>&�"I��N�jE�1|(���D��~�W
�v>"{����_�[{-��ٝ7
Q��F
�w�!�7q�XYئ1^�����q����YG�
,�n@Ha�6���P�7�P��m�IC�k�6�$Z�E����w&��
v[mc��NxBÌQ�?�Iԑ��ϋ�;
���w(�lM�E���
�&KH�t�/�U��*")<<��k�� `9,&
�`~��m��a(�D�t����,H|Z�ɈO���C
7S���6x�1>� t3���)D���?��(�&'�+iC��5 �s����
+$�����G`����BV�U^@͐�#�U�Hf_��`j8_/��o�e�Ԙy
)�,����7��
��	P��\pF:��R���Cj=;���J�"&�Y�
�Jq�y)JgG�Y)����iv�����R��+'�t�����f�[,���c��NEʲ��u�s0��-@��8�-��v5#�4�R��1B��
J
+�ّ��3�B�9ʊ¡�d͡H�L�9Է�~�!9��+hɘ��֋skVtp��E� �vEǗ�Ǽ��
�r)	�J�1��i�j��<�!Pz�P(�����*
���
�g��:�AM!p����Q{}B�M����L��
+�0cZ��1�#�j�c��З
�H���̱�C:�L
�B��1�������
� �~ȧ��ɈO�"L��w%¤���o��
��w�(kj�S�4 �Q"L at L��L��D|��V"����D�����H�i��ȭ̯�8}���H����z�9����	&�%=���������)�ϖ
PW:̎�
>�ƒ��'
���)��T�%�Gx���������j�E%ia͡�
B�������j���D���>��A������e[f��pq�|p�Ԓ4
+D�jQvX@
"�w�qAB�!�@e�И�R�;��z�P�Џb
ID1�R4L�\8�D�\pXL:����

�]�1IՔT�QU��_�Px�#)�?��<$�����:L��*�g���g��fT,ڧ�
+�49B!�iJ��J���yL뙘�O9�E<G���|���Ԉ�q�b�
�Z���^�
��~���k��=��گG��yP��!���
[ ��ʛ(�=[�@5�;V�p
�k1x�d���"].{d��>:-�?@T:�nk��ZC��!�e�2!qG����`��~5B���H�TfP,)��!9�K<��jLR��1��
�l��~�0ݒ��D!�-��X
�4ePȐ��ӎ��ru��iӔ	��Ht�&�I�74�ɫv[u�t�:�o�J�Q��3f�
9j���Q�Z 2���N��,�������]�DhT�W���R�46�Mc�M���ݒ�� l
7���6 
$�5 �[`9�;�]]�fo g?��V�{��������{���><�x�ź
���]�qy,�6�
�(��y�o�Ѻ+��ˋ���<��9�2s7�l?A�M�zk����jc�)<\F�t�+��k��m
+endstream
+endobj
+9076 0 obj <<
+/Type /Page
+/Contents 9077 0 R
+/Resources 9075 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9043 0 R
+/Annots [ 9074 0 R ]
+>> endobj
+9074 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9078 0 obj <<
+/D [9076 0 R /XYZ 89 770.89 null]
+>> endobj
+8703 0 obj <<
+/D [9076 0 R /XYZ 90 669.636 null]
+>> endobj
+9079 0 obj <<
+/D [9076 0 R /XYZ 90 665.153 null]
+>> endobj
+9080 0 obj <<
+/D [9076 0 R /XYZ 90 596.579 null]
+>> endobj
+9081 0 obj <<
+/D [9076 0 R /XYZ 90 542.89 null]
+>> endobj
+8704 0 obj <<
+/D [9076 0 R /XYZ 90 508.22 null]
+>> endobj
+9082 0 obj <<
+/D [9076 0 R /XYZ 90 503.736 null]
+>> endobj
+9083 0 obj <<
+/D [9076 0 R /XYZ 90 433.006 null]
+>> endobj
+9084 0 obj <<
+/D [9076 0 R /XYZ 90 379.317 null]
+>> endobj
+8705 0 obj <<
+/D [9076 0 R /XYZ 90 344.647 null]
+>> endobj
+9085 0 obj <<
+/D [9076 0 R /XYZ 90 340.163 null]
+>> endobj
+9086 0 obj <<
+/D [9076 0 R /XYZ 90 281.388 null]
+>> endobj
+9087 0 obj <<
+/D [9076 0 R /XYZ 90 227.699 null]
+>> endobj
+8706 0 obj <<
+/D [9076 0 R /XYZ 90 193.029 null]
+>> endobj
+9088 0 obj <<
+/D [9076 0 R /XYZ 90 188.545 null]
+>> endobj
+9089 0 obj <<
+/D [9076 0 R /XYZ 90 117.815 null]
+>> endobj
+9075 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9095 0 obj <<
+/Length 2228      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s��~ׯ�)
U�v�/~K&�S�l��;��av˅%,S�@
�����A���T�@�9}N���u��E��O���On~P,0�H*�����@q���_��KH0$��qx
��*~��(���s2/⇟��".^oo?�<�R�Ï˸,��/�SRDD�I6K@�dD�T����'��O�����-���l5��;���� #ft�
�
+8ep]�'?Opc��������gH�8m�<P�!��3���̒u��YY+�#rg
+7��`Gy,�������]
:b�[&"��p�����h����d(Ҿ�Y?'
QX�FH�O
)�9��
B(�̊Q��9��混iq
���t�S�b�J���k�?(��d��P0�-e�#"�!K%�XJ�A��
�.��k�&}����@�+�)b��R����
R�;�
S=���W@"����l>"�H��j���Ā�9�[1E�t���2j�f�|����q����̀q�����"��^��*�����.�@(To1DeS�_"�ü���@Q�_�(��S�)R���|PY
+Qc���*E4�e����E�B�	]'�U�R�8U>T�T#Nd_�z����s{�#�GT1�C���������I�
g^\�(�.XXӓ,)�*/�#J�a��)�$�Ag����6z%�6�M^�t�ZA�_�*Y���q�����?�!��Θ)�I-�i��N�rL
G��ȀҤׄ�f
+�(��.�r/�y>o�F�.�|mqʫ��?�k��T�Ekd�t����T?�*�8^��|0O閰��p�|���d�G�g�lǠ>����W��@��v�H0m�ׅ&^%U҄�A�ԛ�
%`v��a(;�Z{�XC(�! e�oU#��%
+dj��
��kE ĵj�cZʺ�����gU�f�D�����}M�Kw�،���a���4~�D�
T �+}��Hj|F���cSB�F��)p����
d�R at 4Lq8
\��H�:�d��8�K	`&L+odʣ�-��r����Q���=.��s)%�.%1?¥�������G�>�?e�o�}�I�(�n`Z�I�պ�K��f@
�y��>�J=���*g
L,��`i�-��iDNI)�M;��V����x;�]�y�U�<��L�_�@�c�ֻkd
��\C�Pr at S�M%F
��
�'����r,���HS-񠂥�XT8��
+/�X�*��kR$3��u.�1��`)�'�P��R@}�)��'
(��x�U(4�s�%۠�Y�.5@��8�O��^�t���2d
-�

�5�X�6舱
�󸯱�Ȏ�]��I}!z��
��ߘ�rJ 
�G�]b�w9ְd�+��YW�P�+���=5�w2g7����#A�e
Y����SF�ʇ�])��:c��׾���@/y�A79�:_��A"�a�����#�
 �j7s=�g&���w�Y&�M��(�#�H& �
�>�����S/<��Y��~��V����k	�4��ļB��
+�&
����Uq���b�^

 V����W<1[����,7��
+��Ͷ2�����c��*�7w�c��F7^��(�ez�e7�v�r3�%e��Y6��n����H�MѼX�B�O�+�Po�{�
��c
e��,�&;O�
+r�
g�u�C�@?�>eP�Ԁ����c���s(5���������z���c
+XZ��@�Z����"N3�>{8"�U�����
i
�e���l[�^�>L<���f�鼏A ���}��m����N��9	v9�E���|�_��-�l^�P��,�s�;k3r��1�(���o��kZ=;
��\'��1'w�r
ۏɘao~�
�-���/��+�=���є�ۡ
����m���f�|SfwA ���S�Oj�(��c\����� �1�%���
1�w�5�$� ��'*
h
��j����1.{�
�\��ǖ6��CGǏp;��D�w�E�C DR��Ӏ�%����:I�sJ �����w��R
J�2^�9툼����}�2ވ�OK[�70�B�׳t����
�o����w���p��3- �J��a��$�w��'���'
W�
k���\�Pv���m��
>��SB�߰����n�Y&�w�a3���Mܴ

�_,<M��P!���D[h��x~NZ���w���}R˛:DA�����Z���<ne�-�,_��-P������
^��^C���U��QKe�Q�	����
��?&
+x�
ѽ��l_l
��mł���?��_/��
+endstream
+endobj
+9094 0 obj <<
+/Type /Page
+/Contents 9095 0 R
+/Resources 9093 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9043 0 R
+/Annots [ 9090 0 R 9092 0 R ]
+>> endobj
+9090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 231.634 212.124 242.538]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+9092 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9096 0 obj <<
+/D [9094 0 R /XYZ 89 770.89 null]
+>> endobj
+9097 0 obj <<
+/D [9094 0 R /XYZ 90 718.682 null]
+>> endobj
+8707 0 obj <<
+/D [9094 0 R /XYZ 90 684.012 null]
+>> endobj
+9098 0 obj <<
+/D [9094 0 R /XYZ 90 679.529 null]
+>> endobj
+9099 0 obj <<
+/D [9094 0 R /XYZ 90 608.798 null]
+>> endobj
+9100 0 obj <<
+/D [9094 0 R /XYZ 90 555.109 null]
+>> endobj
+8708 0 obj <<
+/D [9094 0 R /XYZ 90 508.484 null]
+>> endobj
+9101 0 obj <<
+/D [9094 0 R /XYZ 90 504 null]
+>> endobj
+9102 0 obj <<
+/D [9094 0 R /XYZ 90 433.27 null]
+>> endobj
+9103 0 obj <<
+/D [9094 0 R /XYZ 90 379.581 null]
+>> endobj
+8709 0 obj <<
+/D [9094 0 R /XYZ 90 276.846 null]
+>> endobj
+9104 0 obj <<
+/D [9094 0 R /XYZ 90 272.362 null]
+>> endobj
+9105 0 obj <<
+/D [9094 0 R /XYZ 90 205.791 null]
+>> endobj
+9106 0 obj <<
+/D [9094 0 R /XYZ 90 152.102 null]
+>> endobj
+8710 0 obj <<
+/D [9094 0 R /XYZ 90 81.969 null]
+>> endobj
+9107 0 obj <<
+/D [9094 0 R /XYZ 90 77.486 null]
+>> endobj
+9093 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9114 0 obj <<
+/Length 2281      
+/Filter /FlateDecode
+>>
+stream
+x��[Is�6��W�4CV
al���$��J&K'�ɥ�J�esF��j��> )�X�k���| E����>�0F4	�l.o'��������7�iAEp3
4$�(�k|���7�L(D��������͏7�M������	�&
�F@��
+����`
+�����V���8ep��'?O���"�d��DH32�(!�!���`���2�F1�*|g~��"�EFE�+�a}EZ�
�]LD��T;��E���yDH���M��&��4EL���ߖi�*|��~[����uq�,��L󢙝�p���'"�
�����f���󯑦0�yz;Ϫ?�g�+��{�oMBT�
���]0�I�jD
%c�u��Nd�W���
3��S�~�`ٺ�r�Z�YZk�Y+���o����I�:���`y��Ŵ�Øޥu�,�amO.g
bʝ9cj
�vf�^/6ݨU?��6T :��
���Ѡ̪UvWGm�ܪeo���:t�G�J�ڶi�Ȋ
+��F � �7A�1-GA��
�D1�$L�*�/��ޙbc*� ��I�D �zn0&��
2xi� �L����A��<3p�`K�[I�6�����Jו+px
M��֦Ѵ
����
Θ�r��ו��AhyH*�6�Ob��
�8�$!�FT�Fw�oƈ���B0��! �H̍�/p�&����W��/���W��i��1�ϛ�۶k/gStXńD.Pq�c�H��OW;[�h��;�� p(3��4o��U�e��yB�%�Cqb�[B�N��W�i�/��
��&�R	\�P�y�'�>'
Q��2�,�
�aBf �P�۬Y��<�pp�f�<��1�dx��@�{=�M��'h�C��2f,$(�
y��z�<�ˈ&��V$�Ǩ$9�<1u��W͘���\+�-@Ԛ��=P �E���/z�A�_�ڑ���� #����G�F>������"�3nsR���wM
+̋��DX���
K��ř� \���PV��dq�̣K�f7�*Z�vb�ܵ�'��vr���x� �[<9 FVOy��>p�n=�@b
#��P
��RTC�O]�%q�!�F����������
��J��@��.̜�?�fՁ%�J��	��
Ϝ
��k֥"�ngَ��
q�'�P��tl9�?)3�H��ڶ�K�7�
2��Fؔ�Eq��K���dZ�!�jM�`�{iTOd�F�BN�Q\2�H�G�Դ#RU;"u@�1&�h�0)��L�BM'�L$*�ņ���p5�������B Rj����d
�+��?�|���W�8I��� ;��x ����n�j|e��`��>�00��Er�\714�F	��0����3�g@ W�7�gi�nc5N��cYC�JZ!)�g���ϕ�ƕ�&�$>��+ȴ\���ĈO��y	Wb�A at l��J>5��@�3�����d�����B��0�7,/�y�+1��\
�m���r9?�'1�a]hD	A/�I�,D��N�I�f��� [...]
M37-7c�w��<
�f���R
�G*���THy۳D�c���S���ϼnT�?�Z-Gy1��ͶGQ.!�FMu��ߩ�uvTP�K���t1�)4$H0i��W��(�a
����,�Wc�1���Δ�n���`��o1�@��s`*��I���dZLa��Ɂ{"/��T 3����iǁ��Ɂ
M�p`ˁϷ����ȗ��%2�r`
+	^p`v�~�'��_� ;y���n��0‚��l�0+��.�j�)�2%̜��D��
K�}��������ü�`w�=g=��Ow���S�v���#Xps�\�:����ʛ;f���f�c�ۮU���y�ڭO�yn.y�\wҫE:�gv��

ڜ�iOʂ {,n�7E�Z�=Jg�r��=5��q�C�,v	ᦤ,���氍�>���a��x��OU�{�cy���S$�O��y	�3�͕�G�|j�Ѿ��g�>G�/��Ҿ�?�@$�~i�E2�һ��鱏��1����xsX�Oi�
�wo�w�W�.X�%ۊ�A^��y���5�a�F�nP�T��w�77�����Qb����!-�i{v���f_$+���	"�2S���(f�ﳮ�7��������
&��2���^]_]ݮ﫬�G��|g���֦�e�ep�,7�������L��}[�C�|
5o
+endstream
+endobj
+9113 0 obj <<
+/Type /Page
+/Contents 9114 0 R
+/Resources 9112 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9043 0 R
+/Annots [ 9091 0 R 9108 0 R 9109 0 R 9111 0 R ]
+>> endobj
+9091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 685.85 210.103 696.753]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+9108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 582.442 485.603 594.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.334 202.188 240.823 213.092]
+/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
+>> endobj
+9111 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9115 0 obj <<
+/D [9113 0 R /XYZ 89 770.89 null]
+>> endobj
+9116 0 obj <<
+/D [9113 0 R /XYZ 90 660.006 null]
+>> endobj
+9117 0 obj <<
+/D [9113 0 R /XYZ 90 606.317 null]
+>> endobj
+8711 0 obj <<
+/D [9113 0 R /XYZ 90 559.692 null]
+>> endobj
+9118 0 obj <<
+/D [9113 0 R /XYZ 90 555.209 null]
+>> endobj
+9119 0 obj <<
+/D [9113 0 R /XYZ 90 494.301 null]
+>> endobj
+8712 0 obj <<
+/D [9113 0 R /XYZ 90 459.631 null]
+>> endobj
+9120 0 obj <<
+/D [9113 0 R /XYZ 90 455.148 null]
+>> endobj
+9121 0 obj <<
+/D [9113 0 R /XYZ 90 394.24 null]
+>> endobj
+8713 0 obj <<
+/D [9113 0 R /XYZ 90 359.57 null]
+>> endobj
+9122 0 obj <<
+/D [9113 0 R /XYZ 90 355.087 null]
+>> endobj
+9123 0 obj <<
+/D [9113 0 R /XYZ 90 284.226 null]
+>> endobj
+8714 0 obj <<
+/D [9113 0 R /XYZ 90 249.556 null]
+>> endobj
+9124 0 obj <<
+/D [9113 0 R /XYZ 90 245.073 null]
+>> endobj
+9125 0 obj <<
+/D [9113 0 R /XYZ 90 154.586 null]
+>> endobj
+8715 0 obj <<
+/D [9113 0 R /XYZ 90 81.969 null]
+>> endobj
+9126 0 obj <<
+/D [9113 0 R /XYZ 90 77.486 null]
+>> endobj
+9112 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9133 0 obj <<
+/Length 3097      
+/Filter /FlateDecode
+>>
+stream
+x��\ݏ۸߿�O�
�~lч��
�i��%=޵�+�{����,Q�l��\�"ȃm-5�!3���
FT��F�~�t��W������d$������#�
~�G�#A&S�1
��<����7�Ǜ��}6/f_�7Ŭx������)x��r����o�EVL�
g��
$IF�j5���/W/�_�vE@<"�o��
ݮ�>��Gsx�
�̌
}r�V#N|.G��y���1���!Ұ1�xi��f�%��(w�
kE4C�j'�asJ7��6��!Z"NT�ԛ	�0�B�~8�5�T"�U
+
(5+h�o2��r
+�����a�/��uaD c��#Z������H�
z���s�$	z�ݬw���ϻHߊ!��g%��&��$�[{
�
<�r!�>[�I�9�A
&�w���F�)FJ��|
Bt��FD���SD�D����*j�x%q�����#���[q��@�x��P�x�3$��{��4Y4������>��6��=���Y����⮜ķ?]�>8UVY��>�6+
-��C�wP���v�f
�[��YDl 
#Cd#h#X��S��������.
�@�đ�
d��*U5@ ʘ�ϋ�(��E-f�m�(HT��m��n_����
���0< ����po��F!��C�Wl�B;��I�pd����D
+и9
a�ow
+�a$ FSP���Ϸك�
�t}"/�Jo/O0� ��Z����5*"�k�DĘ���;%Z�)-�>I[�}�!�=�p��Rd�EC���� �b"�����`����Ǐ�e>�KS��*[�h�9!s�1Kj)؃ 
�Me����S��ތ
�,���}��P1�T�<P8u�S�����l=��;,Hu`�E��ÝR�>��<l����i��ݬ
 d�,�?m
+�9�a���tAtzB3`��v{�d����!2�f���*
����L]mºq�65��W�8i԰a�+��̄��J_@ѤP�$�>P!���v-_g�lKp�$��������0��6����
�r�!�,*����P��|f
)��1pD.�֏���%
��� �f� �+��
�z����Y����_�m�eԒ
h2D��.�L*���E]Sȯ��J�P���!I�q��)�ͫU�(�+
8�
+1�A
++$�r�+C�������a�Z�
@t����̬a�E� e����h0���γ�f��g;{���s�t�PW���~ܬ�XZ)��Q�h�
V��W
\#	U��t�Z`��ƫ�2�¨�
+u���^���v�.É{.~��+��h���υH��~=ϊr��K��u�F�_��Ã+p�GkD_�D at p$�bKD�f|p}����`�|�(�V<
���
+��q�WV�G7O
�@�
��P2 �1�9�N�(��S��D��C�A1u�Z�uz��v�#�3%I���S��,}�H�����\�+R����
2�Hy�aQ�'��RB$w��
T#�
��5�W�n�e.�??���壪u{\M
q��^�\R6�ә$�OX܍)N�|.�RKt���1�rЇ�0�5����
O�7L�8
���z�(S[�-�	�^��ؚNX�D���J.�c
+j#LdPAFjS�m�Ģ��Y\
�'
+�@�����h�g6��8�n�,�s�HI��YQ���mF헻f`]��
�MCQ/�^<R��
�3��3A{�Ğ|����
��7�A�C��/_A�web ��Ӏ�jƯ'mڐؤM��ެ)gP%��5MhgE��
�H�nCc�i`g�3�
8Ӱz҈Q�/�WѺ�M���/t�:�Q�>�'d��o�4������T;T!�ΑA:
�vf9ZkHM��b�J�(�a5���FZ1(A�*#�E_o��cS��YU��n�S|X>"�E0�5�1d�,I��;�G_�*��
$���!2���v��T������t�1gOSp� ��l�i
+��f=�SX�)�
+�8�Q�
+��
�)��|��
��$�EI�NJ�+d
�MI�8�IICThlwQ�S�4��
�����ʎs����ѰJ��㣍�p��~�6�� 
+�׽�hn��;û1X}�����U�����D�h��>Xk=���4aؕ9
�4���2/�M?Z�
����{z��&
̴��L�yEL��&1M��4�AL�¯��Ҥ&�
/��<�KC��wb���(�MX'��@����g�
�
��b��%r=~jz������~ד����n��H�tG$�D<(�h�
OOS{�:r�
zz�2q�5��}��������*�D+�aqI�OS��"~z�:q\5�����/
�n|I�R��R�\���i[�K’����;L&%c��L���M���tC� v�������vV�t����������wv�۳��Jg�1M{�a�̳��*0n��S��4W�K�\Š��
=-mo��<--t�ii�Z*D�iO
�!�^�_��y�cOV��Ћ1�xa��	�\D�Iҳ��5��s��t�VD<�ȶ�4��h�����6[�kh���l��2���V7 �X�
���l�}Z�n0�ԋ͉c⬾�
.�}����b�q�0�a�͕$s�!�b`�=�K�(�e/6��;��;��g

'a����)�
��!\�BH��)q��n
�Ƈj�ʔ-c��]&�s��0�$�
v-���I†��pQ
+�򝁽k�'aD��{�pu��f�_�ݳ:��X��V�E?z�T7���-��Bv�P�:�[�Ks�V1��pq��=�5��	�l����gi���/�Z_��C�?O��w���*�A���ܮǗ�_�
+|T�f��8r\��Px��)�PېA��G
��2*�
fS�t���F:�`�0b�~SP���*���"&^ '}�^,w�x��]֢ Q4��0
C��L5��[OX��Ð3���/덵���6�%��m����>K��aT+x��ܾK��u�{����mV�q"ĸ,��1[�+v�Z�h嬨���C�iO^٬d�.�p������+��:Dawө��~�{�~��f���w*��hѰ������\m��5rx�r�Fx���'i50��AM��r1�5��?V/�^��b��m`���*չ
+endstream
+endobj
+9132 0 obj <<
+/Type /Page
+/Contents 9133 0 R
+/Resources 9131 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9143 0 R
+/Annots [ 9110 0 R 9127 0 R 9128 0 R 9129 0 R 9130 0 R ]
+>> endobj
+9110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.275 685.85 293.971 696.753]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+9127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.269 561.878 238.02 572.782]
+/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
+>> endobj
+9128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.089 337.732 246.767 348.636]
+/A << /S /GoTo /D (index_Grid_Affine_Transformation) >>
+>> endobj
+9129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.79 99.597 434.212 112.514]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+9130 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9134 0 obj <<
+/D [9132 0 R /XYZ 89 770.89 null]
+>> endobj
+9135 0 obj <<
+/D [9132 0 R /XYZ 90 655.872 null]
+>> endobj
+8716 0 obj <<
+/D [9132 0 R /XYZ 90 621.202 null]
+>> endobj
+9136 0 obj <<
+/D [9132 0 R /XYZ 90 616.718 null]
+>> endobj
+9137 0 obj <<
+/D [9132 0 R /XYZ 90 534.032 null]
+>> endobj
+9138 0 obj <<
+/D [9132 0 R /XYZ 90 455.636 null]
+>> endobj
+8717 0 obj <<
+/D [9132 0 R /XYZ 90 409.011 null]
+>> endobj
+9139 0 obj <<
+/D [9132 0 R /XYZ 90 404.528 null]
+>> endobj
+9140 0 obj <<
+/D [9132 0 R /XYZ 90 309.886 null]
+>> endobj
+9141 0 obj <<
+/D [9132 0 R /XYZ 90 231.49 null]
+>> endobj
+8718 0 obj <<
+/D [9132 0 R /XYZ 90 184.109 null]
+>> endobj
+9142 0 obj <<
+/D [9132 0 R /XYZ 90 179.626 null]
+>> endobj
+9131 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9149 0 obj <<
+/Length 2924      
+/Filter /FlateDecode
+>>
+stream
+x��\ے�6}����f����e����:��z'�싓r�#Έ��L(�
��Ӹ�"$R#��M\�J�H�@��nt��g��^\�����7�eIevu��)n���k��Q�ǿ\}�1�1z��_�����^�wϯ.~� �
+g�
H��zy������F���k��8ep]d�/~��A�������44���6c�)�^�Wc�G�r�̷y9&d�qz
Hn
��i�
�
k+stf�̭!�Q�
�L�ǤBk��{b�j��jΑ�'
+c�
���~Z��Z*")<
���M=�D��X��y>�P�G��f�������m�Yx�~L����[�'��Vn�U^Nŧ<���N?cLW�I�/��b����
"0�N�X�
�_r�
}�#"H�1��� S!Ŵ��r��(_l>.O�0uZA�S��H���������eh��������f��.7�2 �_�׫��>_]�Bc�5�Ǝ�+hJ4���Ѩ�/��� ����p��c�G�ݝ��)ӎŦ25W�K�g�
+D��,n�G<����D�i��ɨ�=�n��H��u�%z�q��6ǧN��a�a�
ؑ
aF�>���zY�����A�î����1�^���ŶjQn=�l� <x�<x�'\���w��M��|zt
�_m���v
ޭ\����CZ�j������u3 at X��E�U~��.o7*A"M
+��=�aND'9��$�F���n���/�7'�{�"��nj����Ur?,J�u�ߒ舶/���/O���o,~�=;"�S^��]����m���kyO���^߆uX_
Y�
G�u�w!X9�
�f�$����MRDo�祩Bk ����������	���I~4��.�ק��#�t~B�������K���s��l��(��渷!�.���
S!��lg���j�����N]���(�)�Hc�r�0�ݟ(c�Kud��7�� �^4ϫ9�0�`���Qqc'��%
�F��سm�
ݵ�I���`C���Q�Xzū�y��gb �U#8�64�V��$U�!X�̜Շ6�y�yx0��ى�
+��
B&��N(�@��8�(V���
��]�!��

;c�[
�Uv�zY��.�_o�qs7�r�Z��}�,����e�X7z�|`��r�K�v^ �1��!�y�x��)�8�[7�A�'cw�Ѻ��U�s9=,�M�&܉��k���3���J-�#kj�j� 8Yز��y>+[T�О+�Bp%�K��xW�iL����勲 O}kUE;w?;ԋ�%KJR��E��jMoB�r8� �1"���A�y<2�C`�'7u��������}.֪����
�k��1�H�1�F��!����ģ���&v�jG�c(I�
��A���4���q��̑�.]}/���O��
�ܛm�f6��u���*��o�۳ba�J�����I��6-aƪnQ妍����6��|��
`��*��1c�%	FD�
23�oA�(v��.��vsyY/Y<<�ؕ�
Ϲ�fH<|�� ^���G-

y��=�1\��Uj�e��AJ��e~�^�m1�9Aw����?iS+(Z�m�v��{
)�1*|����-�("�I{̔B*�:��H��F�?��p�sU/{��v��ڄDň���S�,zݶǺ��{
�zq�
I���;�
+��M��
��g�RnWv.���떀
l��$ѩ�QQ�&�c������ \<��� *���.��z
`
�Z����m@�/.�7�A̼�ڳ
��x["3UI&v疐�*�&,�s|�e�����<D���lJ�A\�hT��!ɮc�`��8w�s��9��
+��>�]��7��9�N4�#;����]&p�ӝ),��葭�26�~Ys�I��R!L�^����Y�tƐ�@��������	I���Kt%.�'�Φ�9�����(��z��R#=���}��wc�S�R�/�D�>f
�&)e�1$LZ����¦:�e�
:�}QJN)�<�D-��")]o+H�ϧ�*ӊ�H�?]�������d)�D�:�nާ�M��T�T5�3��a�î���C׋Ǡ�{/o7*A"e)���=ΙMTBƞ	���9���I;ě�|��Ϥ�{oH7��r�ڄF�[�y�=�
i������`Ò2T� �y
+��Gj���oH
@�Sm�	"e�p�e�7�~�}4�/���P��
ee��T��H�0��q��){
+)%&b��7�=�$�(eoC��Q‡Q�IAc�N��ᠤ4�
+��)R�7e��t,چ��C�}�z
��Ҝ'Yh��G�	{�G�O$��4��R
Gct�M��f;���V�� �s;5����+˟����
x�ɧ;��XS/���c 
+r��l3np
+Zf�ؿ�hܐd�w���'q��QDB���S���"!�A�W��U8^�[9^K�
+�����.�h �rW푻��Nrk��Z՘G�
4P���54�$L4:��];f����c̮m4�A\-�O`v�;��f�-����P��VF���6=��
hk���sޏ5�}#؃�\9S�c�Q[��_o��ϓKt�(p�DN��p"!�7*B�C�aj�V�"5N$F*��T��=��������=�l	I��L'�	��0��iGUS�π�����J���'�����,�o�s��
�M
֞�az�ð��U""�4��{6��o?p?
L�
��=�0A���%�L�M�
Ӥ
QMU�<g<�7�� �~ޞ�(zK
׽?�D��S���GV
+	���za
8�U)�ƽ{Y�	��kɲ�A�N��Mv+tC�*%��G`h5h�._�
+��O����X�Q8��3]�W`�Y�{�&�rWA&����6gA�x�:��5���j��}�rņN
+#��|���]>y���v��n��zy�C�:��v"Q�
+�ue+x�tB�-jfH�&
+endstream
+endobj
+9148 0 obj <<
+/Type /Page
+/Contents 9149 0 R
+/Resources 9147 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9143 0 R
+/Annots [ 9144 0 R 9145 0 R 9146 0 R ]
+>> endobj
+9144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.477 462.662 436.256 475.58]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+9145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.585 190.51 422.151 203.323]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+9146 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9150 0 obj <<
+/D [9148 0 R /XYZ 89 770.89 null]
+>> endobj
+9151 0 obj <<
+/D [9148 0 R /XYZ 90 720.814 null]
+>> endobj
+9152 0 obj <<
+/D [9148 0 R /XYZ 90 593.8 null]
+>> endobj
+8794 0 obj <<
+/D [9148 0 R /XYZ 90 547.175 null]
+>> endobj
+9153 0 obj <<
+/D [9148 0 R /XYZ 90 542.692 null]
+>> endobj
+9154 0 obj <<
+/D [9148 0 R /XYZ 90 435.761 null]
+>> endobj
+9155 0 obj <<
+/D [9148 0 R /XYZ 90 308.747 null]
+>> endobj
+8795 0 obj <<
+/D [9148 0 R /XYZ 90 262.122 null]
+>> endobj
+9156 0 obj <<
+/D [9148 0 R /XYZ 90 257.639 null]
+>> endobj
+9157 0 obj <<
+/D [9148 0 R /XYZ 90 174.619 null]
+>> endobj
+9147 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9164 0 obj <<
+/Length 3209      
+/Filter /FlateDecode
+>>
+stream
+x��\�n#�}�W�%		
kj_̃�
;2��؆@�-�����ϩ��fw��k�@
6��[U箧{h�G{_^�����F�
q����C�ў��(�w�ޏ}F�b�!���?
폖��������S6^�n���-G�O��_.'���+��|:Z���w�C�
0����$i�t�[7�����7W�\1�B{,έ�����Տ?��ݣD8���z�
�N{�_}{E�e���+�_��9VY�u�R�3LKU\��_���d1_�vD�Lg��(O5Q���>��]AE�k�$̹�v���
�͈S�!��5E��UD�ϙ$
��
Yf����x8�r8�qB�c�Y<��z|}=�$�����h9����e�u<����T�E҅b9 o�TI�6�V�ie��:�Em�7O�ŀ���y4�Ƀ_��/xu�$'B{]�O~�T�AFUg�1��*��+����In��	vuKN�����h=��f񻏓�S�d�[��.$M�Zg�$m�X�ɡĸbIJU
+�f�R
+��J8l�%(�4H/����/����y�
����s"p��Sp�_x�-����;��w�3��(�!�F�*ˁAW����pjB�5�0
1e�X?ƕ]8��]J8w�
b 
m?f�׏�]6ϖp?����^B`r�S�%� B��^�;�g-3+�K��3+K
������`��
k� ��*�G3ӿG�\��\�"�
Fτ�
s�ʷw�����}����;���z���,L��qc�:KS��E	������ȇ���?�� ��F��J�̦�O�7-��
/�umG�����e���� 
Զ��Ept?)�gþ��˵��
q�}{�
;p�.��z9��W���5l[ ��7Oϱx�����`�-Cڲ���m�2[�7Ӎ���ߵ
����2�ն�����.Z�����
	��B�������6��P0�)�
�����
({D^;�T�׋���`򈌂�(|t��AY�4����ݢ-�юhΓ��0�2[=g��r��S�����1�w_^�~


��|���r?�
�
�q0��8�\��G
�$� �
I�A�5J�g�4��[���7�
z7�[� �
�D�l�#l�5�>�
�/�yxo�W�ImEL��Z��F�� �����i��<���b4���.X�@�U���K��(m�������C�4'�IiK�$�'��L����`ֽY
ق�T�zv��g����)�
���:^=��y�`5���-��
��#T�0���>\%�`1ݧ�	oB<���/na�I�$�p�
+E�4y
	5wȆ���e�ê�N	��G@ż.��O�����?|�M^T��P��
+����4�q��=��dǡ��=��Dj�S�1�ĈF$_J�D�M�⡜g\��ax�
�0�걅�������٫�>~�¦Tj�PX���K����	E������cu�"퀪h�<~[{�7ș��:~�j~��}��û�
+� HP���G
j�E���Ǔ��:[E���wUy>ä����k>���(�<ycv�2���
z�Y/fp���틷��t�[��̿z��Q6q�yt)O�A�-�4JC_O�䔆��K��|��QHe��)���K
��F:F#�:
B���3���:�Oh�
+�q��w[#$��~�ȃl�䀬a
6����d3��AhH#���
�1|�Ԣ�ۑ|"���༮A
�q���ǭ�S�-^���h���a0��S�RL,}�I�'n�<��
]������ρ�@�d�
F[�ۭK�C`�5�v�9��L�
��80R�A
(w�8�ێ���Z����du�Y�'��p}_��b,
+E�ӵQ��=�Y1R��A���#6-$a$�c5�I���h=e���4g;���!)x
/�iv�s���S��4Zg����|�͞j��ֶS;�y���( ����}�U
�����A��P*�N��f�4�t�Y;��<7fҤuF5(
�@I�x֋|+�Q:~`���FW_w�9������Ӟ����G���qp}�m��_�
y�-�'����jp�F�x�ܟL�k�W
�:[)�(��ݵ�Y"Pi����S�r���b[*�e���-�/L
+�2U���T ����Q�Y�
�|
���u�QU�8x�ˎ�a��Bb���JI�X�u5�ÌÞI�Og�	9АLk~g&N��[e�Q�K

�J�P��W����p��-"Zá��z��kz����s������y<Zgy���S�!�m^�ă���n$@��/�Tl���E�C�K�-X�8S?���ӻ���
��:����i�XU�c��,[�)V��[bjCY�}˓�cB����v�"�g���.�� :�]�[
�6h�~�
�7/��I��P�V���9t���W����ći\ʻ�K��3,tLS�s�
+v�[CP���Hw�:퀫�ge�����b
�8_�7�K
z(.��IԜ>�|1.
+|bH�~D�P
|���,��mDݱ4����g3]�t�/�(f��C��.$�d=�5�-�4f�
C$wə9.`�'mܿ���#�&T������U$V��(�hf�s�V&c���`�
-��1s�u֘9�Kf�ޝ�Ul��㽩U�
b�
\�~��f��v�o�:|��NW[l�	D޴�D��ܶ��)���^\Pӻ���6��`*��b^��F��j�(�"�i�G��e��e��".e�&�/ֵ;�Vϣ��:eV��3�Q`E�h7P�F��mr�N�灑Ա^"� %�|��A��
J�;z�/�lg�ń����ّ�(e&�
+��pK5NeD�T)t�ޭ��>J��\���!����;uy`tТ��a�Z�*q4-�,"l��ТL9b-KB�zY�(b�[h�TТ'm�E�(�&“�^��^4��1Z����������� S'F1��q7$�
��	b�J��zl��[n*n���^n��(F7Z��nԘ�<7�p��Rn��:g��z�]F��xxV�j�
Os��y�>���Ԩ2�GjTO��߁���p,5
+C&R�ӨQ�F�6{%��/�c�W������Z�
���� ҇��E?���J������h�y���X��VRX1���
��`��}V�hT�_���oW�=l�au���������ۻ��*�?�������h�[S˧�f������,�;)N���P�j 1�
l�/(P���� �r
�,~�������u�M�8��Pz
+endstream
+endobj
+9163 0 obj <<
+/Type /Page
+/Contents 9164 0 R
+/Resources 9162 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9143 0 R
+/Annots [ 9158 0 R 9159 0 R 9160 0 R 9161 0 R ]
+>> endobj
+9158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [353.773 612.733 462.606 625.213]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+9159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 374.621 422.924 389.337]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+9160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 121.188 425.662 135.903]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+9161 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9165 0 obj <<
+/D [9163 0 R /XYZ 89 770.89 null]
+>> endobj
+9166 0 obj <<
+/D [9163 0 R /XYZ 90 718.682 null]
+>> endobj
+8796 0 obj <<
+/D [9163 0 R /XYZ 90 684.012 null]
+>> endobj
+9167 0 obj <<
+/D [9163 0 R /XYZ 90 679.529 null]
+>> endobj
+9168 0 obj <<
+/D [9163 0 R /XYZ 90 584.554 null]
+>> endobj
+9169 0 obj <<
+/D [9163 0 R /XYZ 90 481.848 null]
+>> endobj
+8797 0 obj <<
+/D [9163 0 R /XYZ 90 447.178 null]
+>> endobj
+9170 0 obj <<
+/D [9163 0 R /XYZ 90 442.695 null]
+>> endobj
+9171 0 obj <<
+/D [9163 0 R /XYZ 90 345.011 null]
+>> endobj
+9172 0 obj <<
+/D [9163 0 R /XYZ 90 242.306 null]
+>> endobj
+8798 0 obj <<
+/D [9163 0 R /XYZ 90 193.745 null]
+>> endobj
+9173 0 obj <<
+/D [9163 0 R /XYZ 90 189.262 null]
+>> endobj
+9162 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9184 0 obj <<
+/Length 3231      
+/Filter /FlateDecode
+>>
+stream
+x��\�s�~�_��V�9���u�pI�7I��s��k�#Y��F������@��@�,�:}"E��������tt?���W_]_�����$�����(�##�4�Z�>�yB'�\;��hx�=�����}�ۮ�]_�vŠ���������է_�h��
Q";zr�V#�\���W���A��J��[�
���&�R92L�Dzm>L�
϶�UZ��	c���u 9���V߈m#����

�&��5d~Q��F�H'�(��I�ތ$Ju��ٖ��fRO
��&����l�'�o�����B=4m�5I�i�q��N�\���+ @6�/Ó�f1+Ӆ�1�ײ�?���E)_�'�t9+�|���SLv��z��"
Z�K�ز�0ņ�7�
+2
1��5]�o�	���7�a�2}�k�Scl�[��Y�o������e��zJC�<߭���p�)
dZ'�����ĂU|H�
-���0pCv �)���k���a
ٽv���]S��a��l�$��
g?@@��%
rCK��H�
:���#�0\@��
+�Wx���U�vK{
+�.R'��:
pVb��W�|
w
������]u�q]�����
S��4�=����6>��:�f�H(
M
�7��z�
h�g��`,��?y���H�&
��e�.,w�.��d�.B?vA"���2���~sxػ�o�M���(�>�ak�`��Q�]|b_0%��t
BYF�T/G�+�J���s&	��el���q7�8�3HI
l$�H�r��M��H��l�-n�R��,�(�9��R1�8a4 �
��l�92�4��y���
h
F��8���At�/JN���؎�|^I�Y���'����;��!
pR���6��G ����}
x�
y	dY�w�qbEC"�j�Cv�y20��;S
Ilݧ|Ȋ�W���wA�4��y�

v��ЩO�5�-��H�b6�ydB��x
��HUs��8��������n��Ԝ�pf��q����̍u��mF$0�
\K�D����;֋d
�fP:�*L0oX
أ�b2e��=\��
Y�Uh5;LH1ˉ�̉S樲
V3�U=T�YE
l�-�>L�KL;=?��mD�
B*x���e�-��Ԏ�߼y���ߗ �C5�F�D[G�T$]�6E��Y
�]�\��wg���
�B'S����HL���T	��D�G�/ߩ3�Ĩڥ���`�6�a���
<ɪ�nr��	[��v� ����[7����<�`���8)
�]���i��f�U�|W�q&��#õ�އE������ `�6�QMAh���S��c.8�؝ڃ�w��N��5�mIilǏG�YS��G��
�0�jx�,q��
Ե��3K�2��g$zIsCd�4!'�f	�]��H��Xsg�k>2�mn�Ś$��d8p�c������3�D�u�b��TvX�u����-|U0��[�oYv�o�m�ׄ����&\��f'�D
�2���
+����mb�K�oI�PDPC(��"5�<0�E/����k��i���Ȭ����
+/�}�Â
���#f�1��ū�S�$`�� �+�
+���o�ez�no�'F��7��Ϙ���C�
|�6�h��U�>��Ģ�a���1ݸbZ��w�яt�·
�(����D�8�
1=�nѳ�x���������Ud�`+���>
 
�{&�5��βuy��(�Ud ��R
� m

��NjCs�H�A�'0�����0����a�7~/�sl_��H�1�[/6�6�:�F�K1AS0Pp\���]i�s�Y�
s��	�H$`V���a�#N�Tզ
l�!_��96I���0
šґi�
��`���cb�#ֳw�`kd%��O ��i�H�^d��b7[.qY��'F��k[nwi,hf�Do�w u�@�f������aj�X�Ti�&��� ��w��P�sh���Mo�SE�{IHCI���Yf��E8BC(!�g&�Kt���Ɓr�2
F(�4xw���fCa�(N9>�P���aK����H�fZ�?/����U;���F�*���x�8�.�I�S�E��<���٤��N�Ο�~āH3���=�9�]�9�H"!��W���^�D
�M%
p���qM���a⣲j�{��[�*�m�
�]7`q���R���&�d�B�m�����n��"OF�s֏/�-�K|)b��� ��0|�¦�	��	�?��)�lS	�kM2ަX-Q�,����꽢 [...]
%23d���=v�"T�a�+\�,Ѻ���{�Q추���z""_�C��y�0�\�c��P
բ�7�.5��G��ͣY���Q��@u���q���c�Hb��4xp�
Պ���!P
��e�j Ot�h�ٜ����LJ�(���HA�z��»M����� �g�r[�^���%`�d�� K�R׻U܆O�W�����w��܂ksp=
<�-n|2ӈ�k �wU�X3�
�³E���������z��o��_]�+4������(��f[�l�%�D�Ԑ�5�Do[x�rN�H�F�6z�!�L�i���.��WabJ��6��w@�K�X�E�ǭ���[����
�f������S�"���6vp����+߄�춉 X����n�c�n�|-�x��I�nc������/c�U)Hη�nt�.l��D.��Ә�%zc��0�1F��$�d2C����F�k��p�,���a#��|�^�s��6�aS�}��}l�h�9�
�01
�x�
.�7x�
���~
���఑>��O�xv��Ql��h�⭸�7�A�N�~�LoK/�Q�j7[�i��0[m�
R�1����*�:,]?���]�~+�0�
iwgK|Yq:Ӱ�&�Іi
d��g�_@��F�">`qzC���L�UVg3�8�2��@�+No��Uf�YO�
֠�a�lS�zh�fo
6�����
�zx�n�
/����(�N�|�x��e8�Vvh$��*<�֑�
Ch���UF�xTg��dɗLzoƪ�_Z�}6x�݉��T
�.�����RWq��h�?�@����@[ʌ᮱y��wƒ�߬��/9ۋ����^`e�ȩ��|F��	}ڇ\>|�o�Y��?N��-������4d�!���cFP���l* 
��Vf�u��V�o�c5t2����<��������}���	X�a����6�}}C
��.[�ÕK%�ς��w���
+endstream
+endobj
+9183 0 obj <<
+/Type /Page
+/Contents 9184 0 R
+/Resources 9182 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9143 0 R
+/Annots [ 9174 0 R 9175 0 R 9176 0 R 9177 0 R 9178 0 R 9179 0 R 9180 0 R 9181 0 R ]
+>> endobj
+9174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 524.115 322.446 535.019]
+/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
+>> endobj
+9175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 388.189 116.998 399.093]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+9176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 346.993 243.45 360.941]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.931 249.758 224.361 262.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) >>
+>> endobj
+9178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.346 238.834 363.642 251.352]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+9179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.135 225.449 244.565 237.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) >>
+>> endobj
+9180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 148.881 485.603 161.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9181 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9185 0 obj <<
+/D [9183 0 R /XYZ 89 770.89 null]
+>> endobj
+9186 0 obj <<
+/D [9183 0 R /XYZ 90 720.814 null]
+>> endobj
+9187 0 obj <<
+/D [9183 0 R /XYZ 90 618.109 null]
+>> endobj
+8799 0 obj <<
+/D [9183 0 R /XYZ 90 571.484 null]
+>> endobj
+9188 0 obj <<
+/D [9183 0 R /XYZ 90 567 null]
+>> endobj
+9189 0 obj <<
+/D [9183 0 R /XYZ 90 506.093 null]
+>> endobj
+8800 0 obj <<
+/D [9183 0 R /XYZ 90 471.423 null]
+>> endobj
+9190 0 obj <<
+/D [9183 0 R /XYZ 90 466.939 null]
+>> endobj
+9191 0 obj <<
+/D [9183 0 R /XYZ 90 372.298 null]
+>> endobj
+9192 0 obj <<
+/D [9183 0 R /XYZ 90 172.756 null]
+>> endobj
+9182 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9200 0 obj <<
+/Length 2821      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~���S+�D0� 7Ӈ�v�����Y�mf���,q"�Z�Z��} �")��6M;~ H����wh
�
�������7�!
+%���S�@�		w���`$�xB0ƣ�1��([F��c�G��en�Yt?dQ���ջ,��'T�ћE��~��y2٘�I

P���
���o���]}�" 
��-��������8���o�X��g7ip��>\��
+�j�WD�
�K�\H��a�E�Xx�>f�J�d�$�Ҽ�F�	���a0��{��a2�s{�%����L��b
���1�)�
&/�H,O��dA�wG�oQ��Y-A�D!�PN��*3�I*I�Œ��L���K2�����W�G�s�/S17�
7�K�E��c���"��\ijxLF�BI�R �	�QT���P��S
�E��x��>�+��?쬍}�W�<�٣�~�oWi�����c���ι��_�4�4�����6��_�c�,���
+��b���
�cE��P0aa�p�&J_��(u,�ρ;�9�FO4E!��Ӛ�3}������͛h�B�
)�K�����.Ƅ���n�@�@�!D�T#��>>�'zTƈW���ݝt�-
�I>�0
�^�#Ln�|�+UH�A�20���I���6O AH��u��]t��ۼ�B�
��B!��*��7�b��0�ZB#)� �&]��
Ĉ{�;�
���Q+�IbJV��M�|��z�
~����^�����|w{����~��[j�!R��:�Vz�Dc�� `"���Z���g��$�j�7^W���
����a#�P��
Y�cRMz(9O�t�ڄ�Ţ
+��&��9.�=�l���4ͦq&G�4�?RZg�($ժ�`-Ma�彉������G�[L�!���hB�
<� �賂HBQ�sQ��-�M�;cӐ	�HWI���l�C|�۱lDR$.��
�$ �Ւ�n^e��A��%�]�y?�%ifʜ
�5d��x�f`�K���j�
+�i�.�
+ t�D#��X
+A ڜ���HY�@�4��)�̖6�
!�
s�6�a���ǗB

��%Ց����[x�e����Fu� �,ۂ�6
 ե
�pF�
w�[f]ʐk�l1< jlMt��*`vֶΕ`��L�"S��z��	�Tp�����S��
�
U/���0��t�|�a=r��ݶ$PKREOAY�=���
����BWL�{��
�]�C�
+�����rޠ+{�Е
Tc�
]������?�������
+��Ud�'�_
�2�S��YQ���8�L�J�i�����V[�F�Z��;z

�[5���g����@A2\�
����A�Pb?��[p�q�0,4
���T۸ˏ~���
�Z��VN�y�0�v
+�:N��Sp^����7�vN2i��'%~�C��4�'�up�g�lj�G�³�i�mE�o��֡)zk�W��V+�B�����ʅ"�[mS��P�r�Z�#���<�2ϧx�^a!$�:���WȡzEҷ䴠��,
+*ߖd��,T!��[��Z"��-�gg��
�l�k( �
��1+���<�SS�´9[�"� �
*Aڜ��z�(��܃�C� 5rG^��p�q��y
�TV3^����lG�ub5�
�;aL &:(p�u;
��`wՆ���(�0�q��?���)
�%��`�`pIw�� ��
��
�H��!T���C�H�Q|3�x� ��
{�ŵ;���l^
��:��f��J����U�ѽ�@�Ԗ5W+Q�z0ų1I����c�p�R��d�L�7W7Lp�H�Z3*���4�؞�`&m��_��,O�c���T,0Ȟ�����
�b�#��_�A i� l��!�u����%��3[{��#O+&P�v��
+�mW�p�91�J�(N*�y�d�I2D�i��_��_���$�fCZ����S
�� ��$�4�E��0�ˤ���-�P�G\@��@?ܹ��;sSrT��(�è�] w�,~����*��{��0H�ˇ�����E����ņ@��b{����-
�ٸ[,W��)e��&)���j��;�˚��̕��Ȇ0�,�5�"�NV��<�?���
G�Igo�Ng����|��}E�7WU���G�L�@�="�R�#a�^�ݧf��5��:��T�3�-�+钴�5H��":��Oz#���%"����4�U
|7Z��{�ߘ��{�B�֘
�)�D��2���y����Cd�tSӻy����\�����$�G&hr�g;в��>�l��/�� Y�#'qb뉨�!�
�R,�.���.$�&��ny	̓-
b�~";-
��ҡ[:P���6���-
k�MɎm�05���Ö=-
Z��,l�w:L���1P�RҖh_W��t1g	���6�MW��]
���#7��=]��
h�P|\[g�1��ցt'iO��:h�D�
���c�:�辎�G!w�u��;�:���
��7ٜd<Ӫ�c�
���:N�� UUm
;��ֱT��u�F�������!B�OTJt�:V�Y
&�m�R
�M$Z����ufw\T��pw�
n�����,��l���X��)ݝ
��}[R��ww�_���$
��38Eg��F�A�;�B��Sz;��k�M~��
����9wsw����	����l��E

ZQv�?�U���%/�+���/
�Ϳ���s��~,���wQ���Q�6��~�`2[����Uf�߰	�m�`*3��T�?_�x��(
�]
N�E�zu}����&�!�m���K�����\�
+�L�R<��J���_�� ��$%�V�l!&�}=	����z�|p�~ɂ?��ț
�|k
r
+endstream
+endobj
+9199 0 obj <<
+/Type /Page
+/Contents 9200 0 R
+/Resources 9198 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9143 0 R
+/Annots [ 9193 0 R 9194 0 R 9195 0 R 9196 0 R 9197 0 R ]
+>> endobj
+9193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.39 356.437 343.198 367.341]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+9194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 278.977 362.353 291.311]
+/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
+>> endobj
+9195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.778 156.6 336.884 167.504]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+9196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 81.198 362.353 93.531]
+/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
+>> endobj
+9197 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9201 0 obj <<
+/D [9199 0 R /XYZ 89 770.89 null]
+>> endobj
+8801 0 obj <<
+/D [9199 0 R /XYZ 90 669.636 null]
+>> endobj
+9202 0 obj <<
+/D [9199 0 R /XYZ 90 665.153 null]
+>> endobj
+9203 0 obj <<
+/D [9199 0 R /XYZ 90 596.579 null]
+>> endobj
+8802 0 obj <<
+/D [9199 0 R /XYZ 90 561.909 null]
+>> endobj
+9204 0 obj <<
+/D [9199 0 R /XYZ 90 557.425 null]
+>> endobj
+9205 0 obj <<
+/D [9199 0 R /XYZ 90 474.739 null]
+>> endobj
+8803 0 obj <<
+/D [9199 0 R /XYZ 90 415.761 null]
+>> endobj
+9206 0 obj <<
+/D [9199 0 R /XYZ 90 411.277 null]
+>> endobj
+9207 0 obj <<
+/D [9199 0 R /XYZ 90 328.591 null]
+>> endobj
+9208 0 obj <<
+/D [9199 0 R /XYZ 90 250.593 null]
+>> endobj
+8804 0 obj <<
+/D [9199 0 R /XYZ 90 215.923 null]
+>> endobj
+9209 0 obj <<
+/D [9199 0 R /XYZ 90 211.44 null]
+>> endobj
+9210 0 obj <<
+/D [9199 0 R /XYZ 90 130.811 null]
+>> endobj
+9198 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9220 0 obj <<
+/Length 2523      
+/Filter /FlateDecode
+>>
+stream
+x��[[�۶}ׯ�S+�DX�	��7u<I]׭7ON&Õ�'%�T������)	���/+���z���"����_�Gw߅,�P$�
��!���p6ލiD'?��0��$�e.����/^߿�ߍ^܏ޏ|�b
+U0[�����9\�!��E*�`�N|�����pť�DT�C�Q1�H����<	C
+
K���Y�-�MVBG�G��O�8"�%4<��,�:�A
�Sc�fD��8b�}gpa4A��>�!���i��(�r�'�c
�nom!a�aB�f7�(�Ϟ�ل��o�*�����u��v�N��
6�y�(L
�
Δ1��
��T��L)�e�D��fB��C6�R��飞��w��B�"&I�G?a��P��H5c�eZ�1.�8n�ټ�H�°
�ԁ�7VgA��2���7��4�f��6.ӇU��o�`L��<�@��ܫSބy>Dit	�0e֕��	b�G�)��`B�x��a�
��gq����)Q�`.RRD�Y�l&j�
�"
+��p���0:ެ&�����<�`@�@�za@)X�\
+�҇
�T���={��+>��$K��1F"�$�A�Q��`.��(�Efw�',�d�%
� ���w�s� ���h�v���Q�^
��
A�r|�D{Ux�Mؐ$���2M4�w����8���

Ya�v��
+!!²	!�|���ܔq��������ق8�� �L�&�iJ�n����f

+��MW���؀J/���
+~yR�V�=�<�O
w��I�
�ډi���y���(xgc0G�1�
Q�zH�I�u�Q')%��&M��< {� �@t���H*�
�꽣����]�TדV/��vͩq�E�K�Yu��,�,��>-��2YW@�d�d��	��z�2�-�K��9�������������G����
<U�u��mK��3.��[�i���'s��N9t(�"(+�~��V�ڤ�x���~�{�]��XH���3#��k�#��Wp �'�
��`H
+��U�sO��
IH�J��2"%��OpX<�V�h"J���l�� �.)�<���)ˍP�4��!��[VƩ�&�l�
+H�
,[{�.���������DnX����!�i��}3������]�~���]
V��&�1�Xt�w��s
�C1ޘ>^ٳ�&�J�&B9.'d���q5�)���o���4�.�^) g� '6��A�[?Ԡ&9��xBq��� ���	�leJ8��-GsE�F��ꜿL�0�nWO�ˆV�4g��.
��2b���*/��l���w���� �v{O� r�ջ�F�LS�����5%���پ~Ltx>J�OM�y���XA���J>gZ�JS�RTrf�UU2����uڅ 2<y�[ނ٫*q�}9g���e�#U���J��Nrz�����l��$�
+FV�K�CVZAVZ��PU�H�.L�*A�˥��
?[b�/���F��:$z>�y�ݬb�͎)p[Q8����P؋j���s�Z��~QMzVT�2�^9��S����D#���F9����f[ykt�XH�D����-�.v
4(�	%����:)�Q�#�i�-=�G�Z�~U��~��,Gt%�T����no$�V�^})]��
d�;NW�pC%��ȓb
����!3��j VE՜$��&��ڎM��ة3U�
��v�6kHWֆz��wT
�LU �́�-�C-d�V���
�Ϋh��c#ƹCņn+�#+��(<*
+?�@�$xP�﹗u8�M-�T�!�)�1���4\ ��D�������W��=
+����{���F�q $�$`�k!\a
h�o�T���o��m�m
�ux�?a
�:���d/EտK�n�=��&�շhGfwWO��� �8y���F�v�
]��,c0\\���D����$�w�Y�� �^���= )��^�x�.K�6�y�e�� '	��'�4�J�N���e[���T*�S�7]��Lk]�`�W��L�˺��*}Ӈ�/�Pv��~�������~�ݛ0{�]�(|K�]r���01p\�����%6Tە>Xi����Ү���J���e�i4�(
?^PD�3��xh�$�㇨�J;?��!
+FL���]uV�%r���{DSJ�ߙ40�=s4�/Aݥ��]�Y݅�3k����FL�juW�������>u���N��z�Uy!ۜTy�1ܖʫ/h�TZ�W�T^�`��vh�G]y���;����U޵V$B���w��Ә��(yG4-�"��*�.M�8\޽�D�
������W��=�<y���F���
��ʻD�~�2y�F
�F���{�w���i+aZ��)�zG�vE3�S�/�w	�
��\軷��6�6��o�~V����=�
���F�k�O�.�{l迅;��!�8�
�b��|�>6_��T�_�� ��Mo��=E��Hn=�zʎq��7����E��q"������lW���W��¾,	"�<Q�8�
L�mR����kC�o#SW�8�� ��S[�������nQ$�A�rܒ�o�"��F�{4�J��+iS7��g֦�qkt��� ��n\
+endstream
+endobj
+9219 0 obj <<
+/Type /Page
+/Contents 9220 0 R
+/Resources 9218 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9143 0 R
+/Annots [ 9211 0 R 9212 0 R 9213 0 R 9214 0 R 9215 0 R 9216 0 R 9217 0 R ]
+>> endobj
+9211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 624.689 334.351 635.593]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+9212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 529.604 362.353 541.938]
+/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
+>> endobj
+9213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.711 407.227 344.79 418.131]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+9214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 317.414 362.353 329.747]
+/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
+>> endobj
+9215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.628 195.036 360.629 205.94]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+9216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 105.223 362.353 117.557]
+/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
+>> endobj
+9217 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9221 0 obj <<
+/D [9219 0 R /XYZ 89 770.89 null]
+>> endobj
+9222 0 obj <<
+/D [9219 0 R /XYZ 90 718.682 null]
+>> endobj
+8805 0 obj <<
+/D [9219 0 R /XYZ 90 684.012 null]
+>> endobj
+9223 0 obj <<
+/D [9219 0 R /XYZ 90 679.529 null]
+>> endobj
+9224 0 obj <<
+/D [9219 0 R /XYZ 90 579.218 null]
+>> endobj
+9225 0 obj <<
+/D [9219 0 R /XYZ 90 501.22 null]
+>> endobj
+8806 0 obj <<
+/D [9219 0 R /XYZ 90 466.55 null]
+>> endobj
+9226 0 obj <<
+/D [9219 0 R /XYZ 90 462.067 null]
+>> endobj
+9227 0 obj <<
+/D [9219 0 R /XYZ 90 379.381 null]
+>> endobj
+9228 0 obj <<
+/D [9219 0 R /XYZ 90 289.03 null]
+>> endobj
+8807 0 obj <<
+/D [9219 0 R /XYZ 90 254.36 null]
+>> endobj
+9229 0 obj <<
+/D [9219 0 R /XYZ 90 249.877 null]
+>> endobj
+9230 0 obj <<
+/D [9219 0 R /XYZ 90 167.19 null]
+>> endobj
+9218 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9239 0 obj <<
+/Length 2902      
+/Filter /FlateDecode
+>>
+stream
+x��[K���ϯ�)��,,�ƕ���.ۛ��
�l�G�H�%R&)ώ}RE=F�+U�\V ���n4��O��x������})�D#-��<<Ot<�L#.�i1�1�1�x:�q
G�8��r�<~��8*֯�tQ&�ﳧ2)_��*��tFx
}�N��
�K��r�U���8	�ED4������w��a�%�`�6GRM曻�'
��f#����m&�P�]O����]��h�fh~�rw�S�1�HL���S��t[gE^Y�X
,�V0


ĉ<)���:Ԡ���扰�����'�5F��
[
���Ҽ�ai�1C�왔����m�l��԰�0�6����Y>eq�[���I9�2Z�6i^��:�$f��tTEA
p �הR����4qGSkDh��ê,��G/�;4ٳ��ݗ�k!FF��OqL
��]"�UKS���фP�qK��9.�,b��,A�/x`���
�|9(I�܁v|�ԩ��`�+8��,��mRgO���qN5���>z
+
K,٨'�&����. at A�u� �(��6X3	q
�L\?
�X�)v����@�t+�PXq�I(؇)%�G�G.�
J@G\�! !
+q�C	\��T�����:�du�8��
5Wc�B!i&CYRc��u�l�ubRҀ�#%�� ��"@�Ζ�s��b
OgL�hٱ�'�[,�@ڞp��-Q��)k���(0VA0�blT܄��0����H3J�Uk�O����ȗ�� �߿Vu�����rb�;mHL�hJ��s�{���hN�;����x�-�
Q�߆��D1i��޿���
l0��^p�P
�
+�ۤ{���r�D��TyTA�IݠL�ݺv��y�G����r�����&?Z_8��%[�y�/�,��L&���dX�W�������(��}�pQy��
x��|���7��lҢ1���īk�P�jk������+�f���J��z�Ά0�Y^���L�D��� ��

+K� ��<i��!�'���6�$��65?����
+o)��� ��4
+�����
m��%A��+j���S$8��Nev�P��U��]���e �g�Q�m�gO�
>A��A�6|nvM������y��['Y�
���GB�
��7��Oϔ�P��
|��%�|L�
���o(�ǽCf8�2�g]�&1�=�+�C�+W=4����Nf��]�xj]x�
sf/�ۜ׼b��e^w���]�k����tcstNG9t���������
4�
�#�i[f]�s7I1�s])>3E��Qaѩd�li �
DTOqT�a�ۂ�>�f0�����LU�+���y 
���aj����9�zϠ.~10 ����t	���â������J=��l��W'�?	���愴�/Y�j�W+L�^4(B�N|�U��U���KM͋.:^�n��� 
�$c
��9�
0�1F��Sf�:.`��A�)�0�0e�C�ң!�cj� �=U�DLM����^���ϡrE�=۷�<
��W%�C��2��
d*��4��B�R�P�
1S�F�����P��4YLe4����6A�vQ(d!
�@�j����, �
eY����e��V
�-���c�-%���}��-��ױQ���z[�B��}��‡�+�"Z��}k���u�!�B�nQ�!DvF��f k��
���Uc�d��!���bQ��� ��
��yjs���S�a���f�����u��z�S��G����9�����Q�
���Q�,
=^E<:G[�QI�WG�9��T�D	�/�׹��F);�@��h����w��H�����?���2���}������R�b�Go�(��@
�;���
�X �����T�c��r<ηS�\(�����u�/��cZ�S�#��Q#��tQ=�.긂CMT�_�DQj�(���T��p��(1�W|:--�"0o�"��	����8�Φ?x�'��S��4Lu!7�`*5$p�����LB�d�J�+A��]
���7��h�}l٘j�܇Tl�0��W�s=���s�$G�����z��

+���j{��
f��Fl_]�|�F����o�@��)�/�0\9D����O��]e�UZ�n6�΍گ�v�Q�a[�}b�$zYe�ǿ;_A)5�J*���e
��;�0���i?1��&_�
?1��?4��!�[
�9��K��
��B�į��|�0�r���]t���sF9��4s���
gyU'�
+���Aak�IY�����b�此fj��0	��s�����{ V�B
1%�u����q(�$����֐��~�@���3����FZ:��I�@V.܌w^3ۚ�«��+��y��}�F�`9��	�Hhܽ� ��K1��V{?�طq�}��
�ٶ[qӾu�=�d?~j��J�
TD�AD�2'��������1$��;����+P�B_���j�X���t�	=���7��|o6�x5�LR�ӡ���\�AL��&?��?�!5\`@~�Iπ3�����HC��u	���N�s�ݩ��H8J����uEv�[�5��-o��
D
ť��۰7:�{#=ތ��1D��֡('��QV%�V=
�	>��z��+X�8�&�(��M�p�mis���=
�	$) �ϚG 8s
�� ��h�=��bs���ʑu��\��G�l������
-� �
X�Q�9�M2�o@�n�b�
�8��]�엂t�+r|߁%�cb��s���0�1���5��U�|8�F��N}���
~���Sh����3�w���k"�
e�n5�$Fx[���T�Q
Gߧ��'�/�f��{q��SmX����ݻ�ݲJ�%��C�����ڭ����е)��̙�^��7�Q�[2�Di���0�RK�
�?6/��w_o��y�c�󭵙
+endstream
+endobj
+9238 0 obj <<
+/Type /Page
+/Contents 9239 0 R
+/Resources 9237 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9250 0 R
+/Annots [ 9231 0 R 9232 0 R 9233 0 R 9234 0 R 9235 0 R 9236 0 R ]
+>> endobj
+9231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.97 624.689 252.675 635.593]
+/A << /S /GoTo /D (index_Grid_Widening) >>
+>> endobj
+9232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 534.875 362.353 547.209]
+/A << /S /GoTo /D (index_Grid_Widening_with_Tokens) >>
+>> endobj
+9233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 412.498 112.027 423.402]
+/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
+>> endobj
+9234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 305.658 379.76 317.991]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
+>> endobj
+9235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 153.592 112.027 164.496]
+/A << /S /GoTo /D (index_Adding_New_Dimensions_to_the_Vector_Space) >>
+>> endobj
+9236 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9240 0 obj <<
+/D [9238 0 R /XYZ 89 770.89 null]
+>> endobj
+9241 0 obj <<
+/D [9238 0 R /XYZ 90 718.682 null]
+>> endobj
+8808 0 obj <<
+/D [9238 0 R /XYZ 90 684.012 null]
+>> endobj
+9242 0 obj <<
+/D [9238 0 R /XYZ 90 679.529 null]
+>> endobj
+9243 0 obj <<
+/D [9238 0 R /XYZ 90 596.843 null]
+>> endobj
+9244 0 obj <<
+/D [9238 0 R /XYZ 90 506.491 null]
+>> endobj
+8867 0 obj <<
+/D [9238 0 R /XYZ 90 471.821 null]
+>> endobj
+9245 0 obj <<
+/D [9238 0 R /XYZ 90 467.338 null]
+>> endobj
+9246 0 obj <<
+/D [9238 0 R /XYZ 90 396.607 null]
+>> endobj
+9247 0 obj <<
+/D [9238 0 R /XYZ 90 342.918 null]
+>> endobj
+8868 0 obj <<
+/D [9238 0 R /XYZ 90 212.915 null]
+>> endobj
+9248 0 obj <<
+/D [9238 0 R /XYZ 90 208.432 null]
+>> endobj
+9249 0 obj <<
+/D [9238 0 R /XYZ 90 137.701 null]
+>> endobj
+9237 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F32 772 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9261 0 obj <<
+/Length 3126      
+/Filter /FlateDecode
+>>
+stream
+xڵ[Ys��~ׯ�SBV��sbr*U9�-;g�U���RA$$2&.�����\ ���}P����N
������՛�%K2��4Mn�
'�gH��m�|�ЌO��1a�B$K�)s�o���滟n>�߮����|E�'�K@ ������8Y���X��G�h�p��s�|���v����
+}�?
��p�2�1O$aHaa����y�mVU�3

H^aߠ_0`
�HPy�{� 5��C�k�cdI�(�䤦qB��T	|�>E�X���O8��dK�.��k�1
a�\$i&�5ͮY\_���Y�u=�bR��JǬ@1Ӳ1�!�kh_>�8"�<!_�;�Q�!�ܮx7˺�R1y,�3��du�?�$_,V僖LthH�� >�6vE���!���P��w�|^X��զ(w���O�S�'�~��_��~�V6����2%bR�P�ZS�[�^�T,L��d�$�Ɍ�	'q�fjZ������o�z�rn��˛�~k�{ے���?DnO%�
+$�'�N��`b��q4�5EJ�Qs�4���	�8��;��9�ǭ��~�F��q�^�EwnE��v�r�O)�|�~�~*����aY�{wU.�w���vea�L
���}I'���|�q�Ηy�ϛ�^���%v
��ݓ^�'���=�bc��{�9�ʇz_�s�w
�����C� ky����~y�/K'���u��?Ց���
+��nUn�k8�5u�*�2������|��^Y]b4�1,'�kE��6��59�i�	iaY���]7����jӳ�6��F���)�tF��{���|”���j��H�����_��L2e��-�0�''�$�)�YgU^.,�.��kzqܱ�"��&��T�j�.v���_�}«.*��)�R�ˑ�0�v��~�%�X!
�u­#]�@I�)��o�3�Qpr�N�
�%��3ꗷ�4T�B
+��j���!bkaɬ�*f�
q���q��LB
���y
�Ƹ��Tx;�8EX)0%���(�z
jP@�h]<�@K�
+�=�xyq �$�7�B EB��v�
�{(�
+�jkb��=�A�	���TIr�㇪�{�-�7��(S�@c �NN�+�2���j����f������S�!�zJ��iY,�
@ �1�c����!������[��kH��)J�r�E�1�a
�i&C~��n�PZ���q�ڪᜳ۶	ʃ��m�TOn$E�W��]ML�_�!���@9��f
��P�Q�Jڧ�b۹�ZE������Ep4��Ij�.RHh
+��
G k��0s���Z��@��gb�ܒq�Kސ��(�
+����.��i9�M�
+��U���ʙ��E=�C�h+>�0�
�J*‚�މ
�Є�Q��W�i:q�$”�؉w(^Љ
L��
Z���xO�׵�|�^�qizqƕ�o�F��N�lVؾY_��T�7�
�4�+{��7��/�{���&�f/�_m٣1�$)�c��E4O�5u虅�~���!Ftr#	�R '��#	�BΞ��(
���(�AIu������$ D�1�aP�Dz��
�6���8���.#���=X��3J��3	��e��iF��퇢� �w�@�A�)�⋞̀i����(��ȍ�z�B���7t;���f�m�w�b�Du2�7m�w7{�>�&�k�_�E0�"v���j�)�6`�3�$���fBgR $��d72A�P��7���<�Pd��
N=���T�Y��|�k���H
+9�Rf²]������
7ֱ��8��\����������:�Wu]�U��Q�����FEB����:�ŹҭS�:<�xL)� ��s��S|�n ���0%���e�M�����x=H��kzB�0� ;�N
(����W�[�LN
� ��z���HO���"����  �Ult iT*5�耐v.c�zڙ��V��l��ѹ����j�@Y�[f���3sXp:UjJm�� �fn7�"�x����
?��Ϡ=9�������D^���ڍ�6�����,.�y��虯�m�#��O�5>ju�l8�Y��3�
!�1X�}�Vg��+�
A���G�c6\��{�[�㼖
����X��B���(�I��)?�LM;�=�
\ ޶X�3��Ӷ�uO3
+�DB�f/��<F|
�n��dO�
+��h� �hZ��ȹ��Z�,˞ݽp?��L�&��p�<�\������]���$���k�� �)��!�L �'n3:|�m�j��a���n�zd$�<�R����G(
�gHʴWbڪ���9t�R��Q
NG��`W�B֯@�@V����`:��
Ŭ
�]��<�R�+�x�uLI=j��Q�	Qc�5�4�����) E:Au����l��v��9KQ�MQ��9/��=O�������.�44��eX���=
r@��|�"�g�$�
��DF
&��M�ٮ�Nz��G"[��)R�$��mtA/�9�yX��v at I��l�S����/��"l���h�~�/�M[5�()\�U���@OM
��-��N!n�A�r��{
=������fb EP瀅����!
J�F�#��SH�B�|
�\�s9�V� ���@E`�������Y��q)3e�:J3vY\�# Ԑ�POø0�Dw08$�����

�m]�6���B�H��Ղ�|�땘�T��ܳ�n�c>����7?=d��3���1����4{��Y�)�X!� ���
+aP��:
��j������G4QQ��B�?$�ю�4ˢ�
+j{�8zLs[Wz��I�m�\=MSw�E{ B!ڝ1����=Ѭ�t�c�V��l��*�y�=�ͬ`g
y��.>j9�=[yy��4dP�s��H�۲4�H�T�F��
+��
������=�f}�3�A�l�VCZ�s �;�@�
��1�!(�N��Ĝ�=���S�
��h8l/�
XVR�����n4J$2S�>��D�������?�n��aÒ�W@�@n�f���P q뀺6P��p����w��?����>��\�y��	S�9����	"ۺP�,����
+?0���ֲ�{�Ó��׶)t�4��7o����|@�j3�4����X�}��Tu�Opsc

�
��
+endstream
+endobj
+9260 0 obj <<
+/Type /Page
+/Contents 9261 0 R
+/Resources 9259 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9250 0 R
+/Annots [ 9251 0 R 9252 0 R 9253 0 R 9254 0 R 9255 0 R 9256 0 R 9270 0 R 9257 0 R 9258 0 R ]
+>> endobj
+9251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 681.422 379.76 693.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
+>> endobj
+9252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.334 541.311 236.659 552.215]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+9253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 486.028 335.755 497.978]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
+>> endobj
+9254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 388.099 243.45 402.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 335.84 485.603 348.358]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.861 253.766 513.996 264.67]
+/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
+>> endobj
+9270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 242.658 153.263 252.332]
+/A << /S /GoTo /D (index_Removing_Dimensions_from_the_Vector_Space) >>
+>> endobj
+9257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.376 130.233 385.519 141.137]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+9258 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9262 0 obj <<
+/D [9260 0 R /XYZ 89 770.89 null]
+>> endobj
+9263 0 obj <<
+/D [9260 0 R /XYZ 90 718.682 null]
+>> endobj
+8869 0 obj <<
+/D [9260 0 R /XYZ 90 588.679 null]
+>> endobj
+9264 0 obj <<
+/D [9260 0 R /XYZ 90 584.196 null]
+>> endobj
+9265 0 obj <<
+/D [9260 0 R /XYZ 90 523.288 null]
+>> endobj
+8870 0 obj <<
+/D [9260 0 R /XYZ 90 476.663 null]
+>> endobj
+9266 0 obj <<
+/D [9260 0 R /XYZ 90 472.18 null]
+>> endobj
+9267 0 obj <<
+/D [9260 0 R /XYZ 90 413.404 null]
+>> endobj
+9268 0 obj <<
+/D [9260 0 R /XYZ 90 359.715 null]
+>> endobj
+8871 0 obj <<
+/D [9260 0 R /XYZ 90 313.09 null]
+>> endobj
+9269 0 obj <<
+/D [9260 0 R /XYZ 90 308.607 null]
+>> endobj
+9271 0 obj <<
+/D [9260 0 R /XYZ 90 224.635 null]
+>> endobj
+8872 0 obj <<
+/D [9260 0 R /XYZ 90 189.557 null]
+>> endobj
+9272 0 obj <<
+/D [9260 0 R /XYZ 90 185.073 null]
+>> endobj
+9259 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9283 0 obj <<
+/Length 3220      
+/Filter /FlateDecode
+>>
+stream
+x��[Ys��~ׯ��CV��913��<ı
;N��V��u� �h� 
������ �$�~�p
zzz���@
=D8����7o��,�H�4�n��Ƒ���6�O
�� ��/�-	^$�!�{��x��
�M��}��/����ۯ��f��/��'e�N�O�i�$j�f�(Ō�
�����oo����� /8"nn���և��~��naĴ�>�A��S�}���o�_FsDT�Ss�Ӥ�8��<��!���`%
֔
��pI��kD98���{h��V��ή,F��uh���:�u�sTa4AZ�Y'mޑ6ai&�Q���N���)[;O	��n���w9�c�逓���)�1)�]�w��j�g�<����i�=��~g���.[�xr7�;����~7Yףw�4+�*�_� 1"�X����
_S�^Lq�;�Z���K�
��������~ys����.�-����{�SY�W�܌��ۤ�����}��b��d���oJĔ30�_��o}��U�`�%<��hE��_�}��{ģ�V1��cR������u���.{��? `�|�g� xq @C^"��#_�թ�J7�h [...]
PRp�ځ^3%I�q'y�rg�#+KsR��"-ӬJ��Ʋ�EkY�
+�ZvG�pwZ��]�P�>_�8%�]�g�����Ѻ�'��h%4� ��5��N�&}�1�ҍ�(Z�������k$q#��mK�P
+P#�w�.�L���(��l�ާ�N�{+?w�n���wR�������X,�[=��������a������Njϝ��V�� a �/��~wF#�d�<�����
gy����5i�h>�hEd/�.���$>a�ۓ�i�(<]��������C��n�]��a����	P�
Nw���<ٟ�zPR�3#��~7�h-�\	�
7vm.jq�EQ�
[�a�7f1���W��=m����n��Fw�x�?��!�����
K�8�l�Ki���ɷ��Y
+�ϜF�R���A�
%{jh-�[IX�[S��
�����tu��+.!� 
qҀ�6�π5�Q���Q�xx�q&���s
+L
+�"�8~
�
+4��v����C 3$y�-s@
�`��o�!~%x-r�������
�
0jN����)�(AL�e<`R��ې�U@�!%ŀff$�qz(�8w�
 �ƻ�bhb:@�_���H���3�EϹ�ԣ�eTq���8����lN`���9��dXD���s��u4�'@���m�/Cb`�VVb�}�4�n���x�{�͸�
���H醩,�V8�
�wO*@����"
[�z��B\��R{�c�������U^���4[��r��>���b�l�+QLE'�2� z�W�6����!�#X�
n�Ԥ��Mf�xq��~�,�����&q�6C���]��M�^�q�^H�+���a>k|�e�S�Ų��6�7rX'��ր3?6�7�$f�����e�A��`Xv*l�!�}��)I嶒�q]�:$�zQ��BGL
$��grqHJ�nr�qe�(�չ���D�ݒ��5�,\�o�5kp@�)��
���\��/.�}�v>
="��a�ȯ�
��E�>7�dzr�f}�Y9� ���
P�֥�ʶ�"����RSЙ]r�o0��`�Z4���sA̱IǤaZ�d����8�
NI4�
R
ܐ��Z�iv'B
��4$f�o=_iR��Ԓ�����C�n��ŕ��jy>��
 �c�mZ`E
D�q|H�P�
�7cm��KW� �%�"����Ꮽm3f^�W,/^���n3�@s�u�ۜ#	w%(���n���+�ֶ{|ܶ�Ia<�(��^�k'���w�5���.)m�|�Ӛb�f�Z�\ݻ6E�{DIA��{\Hֈ1�A����:.š��Ѽ�t��K�5�zm)ú��P���G��uLo;��$��H/���~&����uzt��Y�� �i�%�=
�+V���w�i͋B�c�� p$C��I{� � 
�H�F�y#%�:3d��w�e1,�)
�9��6w�0�\<� e�yŧ�C�Į�RXh
.�1�$I3K�W9 (����pe�l��`b42Q�\Ͽ�V�@5�h}\I^�q�!��Y���6���<����i:�3�B���7C�Z��Dã���}��v�����(��	�&j��>�����z�K�b��"/.4�?K���Q[�8�FܕFψ�-_� ����ql�� [...]
+j�"\A�
��ֲ��5d����̖@�&�i�Y�y��M����~]�y9��"�:H�>֬���z$�-m�ǘ���m��2e�`�^�N����k��Ӟ�
��
+
��sUbH�U�ス+x;.�w*�+&����	�IՎÁ9{����[�"���'���:�5���

�c�C�~��ϔ��c�
� Q�Q�6V�t�V�Hݮ��
+S�;*���k=�յ�~�U���Ъ��.2a���+^-�N��e at 8$���%
/<���#э��X�t������3�5��Jw�� h���
Ar�u޲
�
���������j=��YzD�9;��!�2�*F�}������% >@	H
�0_�9ߗ`JҒ�X<�1aRoy
(UH��B�3�5��}	
+N�}
f���<��s�W�F��N�7m/H������5�/�Z	p�4Ԥ(�~����c$U�,�eP��=Ǻ�Q[
�'*�~+�l�P��J�|�����.oe`�[
Z_y*/���1�PC� /Jw��D|���.
;�tK�]���y�iZ����IM
�4�9�b���m�� cR�J=
b۵�|&��
$W�%��ױ,
wYij�eZ5Ś�(�GPҵ�a����9a����D�z
�za��ł��5����p�2=�cfB�g'�!����-���>��
�+������m[}h�lK��7���)E��m���!�ʆ���T]�A������V�C�Y���Bc�7�&"�˕���2�M�n�!���dy1A�3ߩ�K~V�
���Pp��V@{��;w�2-������$٩�鑉����m�
�X���d�R���H��5����S-;�C8���屪�o߼�?=�i����a
�t�	�l��m]
?�_$��n
:���(&(�X�K�l!&RR;� [...]
+endstream
+endobj
+9282 0 obj <<
+/Type /Page
+/Contents 9283 0 R
+/Resources 9281 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9250 0 R
+/Annots [ 9273 0 R 9274 0 R 9275 0 R 9276 0 R 9277 0 R 9278 0 R 9279 0 R 9280 0 R ]
+>> endobj
+9273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 567.748 149.577 575.274]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.847 504.604 191.42 512.13]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.164 504.604 266.737 512.13]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 414.474 239.856 425.378]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+9277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 226.756 379.76 239.09]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) >>
+>> endobj
+9278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 184.659 182.164 195.563]
+/A << /S /GoTo /D (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) >>
+>> endobj
+9279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 87.293 243.45 101.241]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9280 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9284 0 obj <<
+/D [9282 0 R /XYZ 89 770.89 null]
+>> endobj
+9285 0 obj <<
+/D [9282 0 R /XYZ 90 720.814 null]
+>> endobj
+8873 0 obj <<
+/D [9282 0 R /XYZ 244.439 417.627 null]
+>> endobj
+9286 0 obj <<
+/D [9282 0 R /XYZ 90 410.987 null]
+>> endobj
+9287 0 obj <<
+/D [9282 0 R /XYZ 90 342.413 null]
+>> endobj
+9288 0 obj <<
+/D [9282 0 R /XYZ 90 276.37 null]
+>> endobj
+8874 0 obj <<
+/D [9282 0 R /XYZ 400.69 187.812 null]
+>> endobj
+9289 0 obj <<
+/D [9282 0 R /XYZ 90 181.172 null]
+>> endobj
+9290 0 obj <<
+/D [9282 0 R /XYZ 90 112.598 null]
+>> endobj
+9281 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9298 0 obj <<
+/Length 2581      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۶~�_��3-5��q�u2�:�'i���}p<���H�LR����
�U�ŵ6yHfxY���\��
@8�
p����O^(�(�T׋ Ɓ�1������r�������X�W��g?��~�����������b��`��x�
sx�]����
�8ep]o/�q��.�Qan��i���Q�0�"
EXXu����J���3���L��<�HPuP��@��
+zb[&8#dD'-���o(����%��z���#
+F�2
+
,zB�kx�5�P�H����)���U�M8?&�t�SRL�
+o�k�U�[��A1�s.�C��d�#"ՁuJ�['�1��/�zY�*»l2�ӅYۓ�oN�6jr�G��
�D�#Ҍ��ii�
�H�[� R�9O��%d�4�f�z�T��J����.��������z����tya��E���L�W�¾���%�1zq����E�
��	!$L�tZ�˔2�b!�)!pu6M���|6
���?zV�E��,Ϫ$���>B�yV�	�2n�1)�F���Ơɔ
~�*s+��;Xt
L$�;nM���y'�Cb$!x?i3L�1�@��DJ���g���a#O$���֗��H|�|ŀ�n�21>'qXn����m�گɠ�1�U;E�a���%4q�&�@�d�ɚR�_فQ?e �d��3�Y7�&�F1q<�f����}���#�@�y�y��t_ZV���&n���75�R(�j 

�"F�t��n���P
���>]o�恴d��`�S�
��l�fp�e�F�o�m�����N
+�H|Jl2
&��cEJ����X
�jfye�L�-��Fn)>�V �F� )��-�G�a�S�j o< z
h��(t�ɳy�ݺ������+��1�E�c�Wi��PQ���j�羊�fU[�'
� ��F�8��6H�5m�c��`�{�Q ����D bj�u#�$�L	ƵΌ��'D &p o`���@1��m)��D�Z`jDI�H�	D��'�X'

bt�E��#��P��F�|
+|X�y�Q*�:�
+�)�ȑ
+ߧ7��i>\]�,Rh ۗ��W2Jϡ#��Ef�\[����LcB�
��s5 3�Y�
:�K���������
�@�bR�/��j[4Y��
�ӛ����M
$�]&, zw��?�u�Ǩ�= ��Q
�
+I*�|h0A�m+�G:���~�'E�Ŋ��B�P��e�A��k˜�t�M%���_ګo
1'e�-�yxm��G�u?����5��3`W��~w�v���0}�$d�cw���Hu6/m������J*�
^l�Ye)<}���n<�
�ڳ��DP�����Aܺ��˪���J����]$U�C���=}j�
QN!�gq&������
}*+��tW^�f���կ>,�a
�6\
�y$A�*�.ǫи��-|�B{
&�<��Cۙ�ֿ�Q��[����m��:Dj=%��`��I�.Ҫf&Ԓ-�TzBDx_Y����7m@Ճ�,�0��ю-�9�%Z����
#[s�W0c,�0\��[$��A�~w��J;e��=0]�)�_W1�8�z��
��-�_��G��몊���:Bȣ,`�!�05������6K
K�h�������-	nE3n�f�:�o�9�X>��^���́� �na��L�)
\b�^��`@��

��m��c&�&$\��.-���x�ڣP��>�?4�����q[C�P�MR8��Ǜ{���/�p
��-p6��
��S�楡zwɦGtv�+L����8
��/=
��L0��Cᐏ �$���!�{{7!��6�/.��`v2-ڳK!0?ċ��V�D$CX0(1J7y�Vi�a:�l
+�HX�"�����ϫ�">s�V�O�=袁�	�;�Oޑ�����߼p�H��)�V�����8����ݝ�3M�-f���U^�m�,��/��u�L|3��ոc�ҬY���3�bR��rd�o�j�?*���6 ��"�P��c���==?�7�"m�
��x�O���#�G���𧎡�x�JG�@��
+�om���B�h��E/�����$�9-L���y8U~v#~G�_
m�o�=�b!�>�t#�ڜ��K��=�vg��@���UR�[���[��^
�(��A�je���
�t�+}5<��,% ���b|H% X6�Z.�!��۩]��"�"ޅ^�^:� �Q����K0$�]��qEO
b�x�H2;�'���"�

+P��R�9��(��)��
(s8̇<3�D�Ujb�T� 癋�z/{1Q�)�3}$���m�6�h럥ٍ�	�L�6'�3]
4&�����p�sԻt��6�w6[GY=�z�#���v�;
������)��L�)#9��H��_yr�Y��g���.;�7��ͮd\���
+U�7����6߸O�]��
�u� o�	l~���$�9'6��
�������?K]��8š�ߓ��m� %p���"#AdS�Ȁ����[�D����V��]Ԟ�� :�_V���ɓ��m��[lm7»�c�ݞP���i/�5��H����q}
+endstream
+endobj
+9297 0 obj <<
+/Type /Page
+/Contents 9298 0 R
+/Resources 9296 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9250 0 R
+/Annots [ 9291 0 R 9301 0 R 9292 0 R 9293 0 R 9295 0 R ]
+>> endobj
+9291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 694.807 535.938 707.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 681.422 226.824 693.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 624.571 362.844 635.639]
+/A << /S /GoTo /D (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) >>
+>> endobj
+9293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.635 112.259 249.889 123.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+9295 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9299 0 obj <<
+/D [9297 0 R /XYZ 89 770.89 null]
+>> endobj
+9300 0 obj <<
+/D [9297 0 R /XYZ 90 718.682 null]
+>> endobj
+8875 0 obj <<
+/D [9297 0 R /XYZ 487.765 627.724 null]
+>> endobj
+9302 0 obj <<
+/D [9297 0 R /XYZ 90 621.084 null]
+>> endobj
+9303 0 obj <<
+/D [9297 0 R /XYZ 90 545.583 null]
+>> endobj
+8901 0 obj <<
+/D [9297 0 R /XYZ 90 521.744 null]
+>> endobj
+9304 0 obj <<
+/D [9297 0 R /XYZ 90 521.744 null]
+>> endobj
+8902 0 obj <<
+/D [9297 0 R /XYZ 199.738 440.662 null]
+>> endobj
+9305 0 obj <<
+/D [9297 0 R /XYZ 90 434.022 null]
+>> endobj
+8903 0 obj <<
+/D [9297 0 R /XYZ 90 394.29 null]
+>> endobj
+9306 0 obj <<
+/D [9297 0 R /XYZ 90 389.807 null]
+>> endobj
+8904 0 obj <<
+/D [9297 0 R /XYZ 498.315 334.607 null]
+>> endobj
+9307 0 obj <<
+/D [9297 0 R /XYZ 90 327.967 null]
+>> endobj
+9308 0 obj <<
+/D [9297 0 R /XYZ 90 266.128 null]
+>> endobj
+9309 0 obj <<
+/D [9297 0 R /XYZ 90 244.08 null]
+>> endobj
+1862 0 obj <<
+/D [9297 0 R /XYZ 90 166.993 null]
+>> endobj
+342 0 obj <<
+/D [9297 0 R /XYZ 90 158.061 null]
+>> endobj
+9296 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9328 0 obj <<
+/Length 1760      
+/Filter /FlateDecode
+>>
+stream
+x��X�n�F}�W(�����
�]E�ĉӤI�8�K� ���D�������WQ��(E`ZQ�ٙ3�3�
������	VK�|v=9��̉P�й�;v�� �o3�K0
+�7%c��#؍�U��ң�]g�K9+�Oo��".���^���K��"�օ7�vϳ�,��J�e���<� �0�\q����ɋ�ɗ	��C���IV��3�ǯA{	�NoZ9>e�9�'�&�g�6+"�A���R���Xԟ�!�IB�3�L)E~���7��w��  *�b�T�eG��]�=��jr��V��w��J8:�3%>���Si����,p�ݙ,�|a��UQ����'����iW�DfK��S!
1�0�]no=�fi�Pᾕ�[Y���6O�t��Q�GtD�w�3���
}
t�s9��YePO�0
�B��zR�Mq���q�i��-
�,�����̛2�Zm�Y6����
;�h±� d���4�',즞*P�x��� ���i��'������������Q�̰q^�(ʊz��sJ
+��A
+
i��Ǔ���c������u��Z�>c����6w���� �~
+d��� �׹�tT��� Dt^aq�&
fc��G!n��Z��H9�
�!�7ݥ��q�W/����@�G_]�R	J$��LtX(E���粊�L�
���M�t��@ha�#�G;A�{>v��H�v�0��!Pr�<w�L�-I�X�
�)�(t���GA��e���׋m�1h�y�B��y�k�q?,����^΋x%=�w�﯋��qie��#S �T��VN�8�VW6�ְ
�6+APZ#�Yk%dQJK�f�U���
+r8�0��P{>����+�(�	��#�fԼ�"N oH���
��aب�K�Z(����k�d~YH��0�L��
q}"T�*��d��FZ}�єF�}�����Ti�̀͠�'����N�5]7��N���)�#���:Am��9l�X'ە̫x�j��
V
+��D�i�0�z4ޝe	'��ԡ
#¢C-E����vw�%
J=T`�3�;.=Fa��q|W
+
���h@u����ߛ
+�^�hr$�Q �cW�s�3�ۆ��Y���wT���~��zp�AC�+�)�@NQ�7��I� E�뒖�ޏ�Pss��wM)@�]J1$JL0��׌�@�?:3��z%�m�w�� c�԰��

�ddR  �톓]������>o��fW�b0�=3����{c*���v�v�� L�.���>3[��S��X�;^��8�d�i���,�m}sT�O�+$��$D��H���p�=�q��FK+d��������{aM}�,��Tu0&��\m�+�C:V[��7�������\LjN��,֫����̐��*;2y�oV͝��~`J�l2�\��g�Q�ЬT�#������=&��
+�08X`
+�)�
=�c-�
�
�d�Pw��Ѐ�:
Þ�i2P�Yď���~O���6���b�Wr�� Whx��Ɉ푊��!K��4�6]��or�7�Y�

���`��%͓l;�u��)��Q������U�6�r
naPo����v?��
������A�dg�ĎϡB
�������ů�
���M�St���)$�M!����\S���3�⟝z��Dԙr�����}YU������@f��FE� ���պ�F�9<\颇갯�
��Z��~�:�	�
	�:k�c��}p�jŜ�k �]��VJ{
+endstream
+endobj
+9327 0 obj <<
+/Type /Page
+/Contents 9328 0 R
+/Resources 9326 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9250 0 R
+/Annots [ 9294 0 R 9310 0 R 9311 0 R 9312 0 R 9313 0 R 9314 0 R 9315 0 R 9316 0 R 9317 0 R 9318 0 R 9319 0 R 9320 0 R 9321 0 R 9322 0 R 9323 0 R 9325 0 R ]
+>> endobj
+9294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 685.49 177.053 696.394]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) >>
+>> endobj
+9310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.989 671.067 217.919 680.972]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+9311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 616.633 180.649 627.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_ac03d43b46ab7f9e5d0ea3c46a5eab7b3) >>
+>> endobj
+9312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 588.76 180.649 599.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_acf34edb23c376600051bbc563e4122c4) >>
+>> endobj
+9313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.986 588.76 228.24 599.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+9314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 561.26 180.649 572.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f) >>
+>> endobj
+9315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.986 561.26 274.725 572.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+9316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 534.134 188.398 544.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_adf9fc5ac7e45f36bc03af31b98b31a72) >>
+>> endobj
+9317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 506.26 163.215 517.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) >>
+>> endobj
+9318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.552 506.26 257.291 517.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+9319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 478.761 163.215 489.665]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate_a3b727ab728f8758af9fb217eca9d791a) >>
+>> endobj
+9320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.552 478.761 210.806 489.665]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+9321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.635 407.649 249.889 418.553]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+9322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 323.152 173.456 334.056]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Certificate) >>
+>> endobj
+9323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.43 323.152 253.684 334.056]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+9325 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9329 0 obj <<
+/D [9327 0 R /XYZ 89 770.89 null]
+>> endobj
+9330 0 obj <<
+/D [9327 0 R /XYZ 90 704.201 null]
+>> endobj
+9331 0 obj <<
+/D [9327 0 R /XYZ 90 635.056 null]
+>> endobj
+9332 0 obj <<
+/D [9327 0 R /XYZ 90 635.056 null]
+>> endobj
+9333 0 obj <<
+/D [9327 0 R /XYZ 90 605.822 null]
+>> endobj
+9334 0 obj <<
+/D [9327 0 R /XYZ 90 578.322 null]
+>> endobj
+9335 0 obj <<
+/D [9327 0 R /XYZ 90 550.822 null]
+>> endobj
+9336 0 obj <<
+/D [9327 0 R /XYZ 90 495.823 null]
+>> endobj
+9337 0 obj <<
+/D [9327 0 R /XYZ 90 450.942 null]
+>> endobj
+9338 0 obj <<
+/D [9327 0 R /XYZ 90 309.756 null]
+>> endobj
+9339 0 obj <<
+/D [9327 0 R /XYZ 90 287.38 null]
+>> endobj
+9340 0 obj <<
+/D [9327 0 R /XYZ 90 287.38 null]
+>> endobj
+1863 0 obj <<
+/D [9327 0 R /XYZ 90 144.133 null]
+>> endobj
+346 0 obj <<
+/D [9327 0 R /XYZ 90 136.92 null]
+>> endobj
+9326 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R /F118 2438 0 R /F8 802 0 R /F75 562 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9395 0 obj <<
+/Length 1669      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�F~ׯ�)��j��r�4�I;u�8�����h0Z�4@v�N�{ϲ��Hu�N^$XvϞ=�w.������W��ǃщI%نjH�dc��l�p7��eն����5,DlF��/ޝ����W���x<�8 �KDБiI�?�~��)4��0��%=��|IS)�/�����邑��K��if��f� B��[Ŕ��
UՒNJfɟ�,N5*df��o�"Ҩ%�@djTȻQU�4V�
��,X�Y;_^4��y��Pu,��i���mM�`vC�ì��JC�!l��>�cJ*lƱw���>��X\��v-^E�t�,R�.;IUW�J����I�J�*�
+R����yƊ�92u���>�����2L��}�����o��Ǘ��{wz>�S�B��t�n�
`���Z��8e3!���eĀKa0�ś�ə'|��lz��4��ٺ.��$��=ܒڹ�We�w��Hf��� �:�0'��g�X�4�i�_[��g� ��M�b��Ŵ)B0�$�2��C[C�M(�J��Z��n�����L�.�h�E��wLQ1WJ��,��q�A+�sHm�!�QQb��з̿e��>Yn�w��ZIk]��v
����I��ʗ�s���Ty����6�����$j�$�p|f0�d�*
+�
+�a�ͽ���.�é糀���/
�	o�����4�a����YKґm�)R \Pda[t¢Si":��{u�(
7ZG��~���̀M��̷0����U�ݑ�z��>�}.?	�ˉVn��
��.g%s��U6
">�a*W� �����ԑ�H�x�������"�E.�T�:��{��Dնʺ,�`�kj�R�ԏ8}�
ij���_�²��ˆ�'�|
�b����F;��9~� x�(���cG
�
fZ
�� Q�
[��a�-w	_̍Vn���YbQ
��X{����ͼOr�u췉�#K�ɻ���M����j�0u�~Q7P4X�����`h����M;gx��R� H�*���Ԓ
�1̳c�[���T2��&垭s�FBd��c/�׹�e!�0����Պ�6�*��Hs
��H�m�x;;YO�Z����3
ҍ𲺦x�E��f '�
~�Y3��t�|��}��Ճ���!?
+�8#U׃�7�>S+��-��
zߓަ��tG
o	ґa���N9]�t�Hg��s��v|"懼ܸ�?�7ezN%���Kj�'�4;Q�ߩ
_�b��bѕ:6֘���)�_7�����@��N�
ա�JvJ� �

	�ݬ����� K+������i���\�j��l��������r�/Q��F5�2U.�[
a�x�"������"��fɣ|���
�
�Ծ�jԭI���k{{ԲO�&��䑋,��Ȳ��;�x�d��e��P�-bM�X�}(�����Y�
(
��W�f"�n��8���3��K������*�n��[:�㳄E�A�D0f�A��EN�@�8	��
�7���;�]��� �U�������P�N?��8��TӇ����|L�0:���2akqC�7\
L��Zn�&CG��擖_�_\����b��躜�������`�
��G�e�,N<�
)$�+���ۇB�7��'���#�*��K���ht���,�#7��l=ض6
�r�0b��{h�k�� �UQ
+endstream
+endobj
+9394 0 obj <<
+/Type /Page
+/Contents 9395 0 R
+/Resources 9393 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9250 0 R
+/Annots [ 9324 0 R 9341 0 R 9342 0 R 9343 0 R 9344 0 R 9345 0 R 9346 0 R 9347 0 R 9348 0 R 9349 0 R 9350 0 R 9351 0 R 9352 0 R 9353 0 R 9354 0 R 9355 0 R 9356 0 R 9357 0 R 9358 0 R 9359 0 R 9360 0 R 9361 0 R 9362 0 R 9363 0 R 9364 0 R 9365 0 R 9366 0 R 9367 0 R 9368 0 R 9369 0 R 9370 0 R 9371 0 R 9372 0 R 9373 0 R 9374 0 R 9375 0 R 9376 0 R 9377 0 R 9378 0 R 9379 0 R 9380 0 R 9381 0 R 9382 0 R 9383 0 R 9384 0 R 9385 0 R 9386 0 R 9387 0 R 9388 0 R 9389 0 R 9392 0 R ]
+>> endobj
+9324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 687.271 160.455 696.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_acb1fb1a16ca8e051a815ae73b178dd62) >>
+>> endobj
+9341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.794 670.539 266.426 680.444]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 657.21 160.207 668.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) >>
+>> endobj
+9343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.977 657.21 192.655 668.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66ae9cf46c5e08ead7689807e1c8ba30642) >>
+>> endobj
+9344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.643 657.21 257.969 668.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a4ac3b90df83c2e43249ccfa2702640de) >>
+>> endobj
+9345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.958 657.21 292.28 668.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a25b86c6f0633416506503de2bf693876) >>
+>> endobj
+9346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 605.296 201.399 616.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.376 605.296 264.06 616.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aaaba43818b9aa3f407359d15a971984e) >>
+>> endobj
+9348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 535.238 178.976 546.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.791 535.238 244.549 546.142]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.984 535.238 344.961 546.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 507.234 178.976 518.138]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ab1db3272b7beca7b1d9d17f23d22ecbd) >>
+>> endobj
+9352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.313 507.234 271.378 518.138]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 494.229 178.976 505.133]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_add0d04eab672e924694d77cc48921add) >>
+>> endobj
+9354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.313 494.229 271.378 505.133]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.59 494.229 351.348 505.133]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 466.225 178.976 477.129]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a271a32761c20049948570491e6b5b9dd) >>
+>> endobj
+9357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.313 466.225 271.378 477.129]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.59 466.225 355.233 477.129]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 453.22 178.976 464.124]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a7718a50034230b311e3f3cc35d7709e9) >>
+>> endobj
+9360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.313 453.22 271.378 464.124]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.59 453.22 355.233 464.124]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.322 453.22 465.08 464.124]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 425.59 186.725 436.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a00017ad58d66a7948b0355b3e02c750b) >>
+>> endobj
+9364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 397.212 178.976 408.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.715 397.212 230.522 408.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a1177f236d8c66c01bbb43b37ff90bc7d) >>
+>> endobj
+9366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.859 397.212 322.925 408.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 369.209 175.668 380.113]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 369.209 234.596 380.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_abaa6c80abf60b23dd19db6cc042719b0) >>
+>> endobj
+9369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 341.205 208.395 352.109]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) >>
+>> endobj
+9370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 341.205 273.968 352.109]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 313.201 179.554 324.105]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 313.201 250.666 324.105]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a60d9658ef91fbd3a1b0064253246f36b) >>
+>> endobj
+9373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 285.198 220.579 296.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a5f47fcccf4795964925294d448335f0a) >>
+>> endobj
+9374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 285.198 290.038 296.102]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 272.192 233.76 283.096]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a091c62cb35ccf09353d79a532e6c1758) >>
+>> endobj
+9376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.575 272.192 272.763 283.096]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.205 272.192 323.393 283.096]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 244.189 243.165 255.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a3024467f23276b9db83e3bbb6fc05b12) >>
+>> endobj
+9379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.502 244.189 327.278 255.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+9380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 216.185 246.034 227.089]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4cf4938d837fcf701695a0828bf56cef) >>
+>> endobj
+9381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.522 216.185 360.71 227.089]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 188.181 231.1 199.085]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeabcfd0fb026563fd3464f04d32c8e60) >>
+>> endobj
+9383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.915 188.181 270.103 199.085]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.916 188.181 345.559 199.085]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 175.176 135.579 186.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) >>
+>> endobj
+9386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.077 175.176 155.225 186.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a1aabacaac0806d617f53db4b34b3349e) >>
+>> endobj
+9387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 147.546 162.677 158.076]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a2a0bc130f7cf6a0678ee3b982fcc7ab6) >>
+>> endobj
+9388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 119.169 187.563 130.072]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a41227446c918730e97998799bfe04da6) >>
+>> endobj
+9389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 91.165 220.768 102.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a76fce1702224700691a26cf5e780a1dd) >>
+>> endobj
+9392 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9396 0 obj <<
+/D [9394 0 R /XYZ 89 770.89 null]
+>> endobj
+9397 0 obj <<
+/D [9394 0 R /XYZ 90 702.264 null]
+>> endobj
+9398 0 obj <<
+/D [9394 0 R /XYZ 90 646.52 null]
+>> endobj
+9399 0 obj <<
+/D [9394 0 R /XYZ 90 554.286 null]
+>> endobj
+9400 0 obj <<
+/D [9394 0 R /XYZ 90 554.286 null]
+>> endobj
+9401 0 obj <<
+/D [9394 0 R /XYZ 90 511.219 null]
+>> endobj
+9402 0 obj <<
+/D [9394 0 R /XYZ 90 470.21 null]
+>> endobj
+9403 0 obj <<
+/D [9394 0 R /XYZ 90 442.53 null]
+>> endobj
+9404 0 obj <<
+/D [9394 0 R /XYZ 90 416.252 null]
+>> endobj
+9405 0 obj <<
+/D [9394 0 R /XYZ 90 386.523 null]
+>> endobj
+9406 0 obj <<
+/D [9394 0 R /XYZ 90 358.519 null]
+>> endobj
+9407 0 obj <<
+/D [9394 0 R /XYZ 90 330.515 null]
+>> endobj
+9408 0 obj <<
+/D [9394 0 R /XYZ 90 289.183 null]
+>> endobj
+9409 0 obj <<
+/D [9394 0 R /XYZ 90 233.499 null]
+>> endobj
+9410 0 obj <<
+/D [9394 0 R /XYZ 90 192.166 null]
+>> endobj
+9411 0 obj <<
+/D [9394 0 R /XYZ 90 164.486 null]
+>> endobj
+9412 0 obj <<
+/D [9394 0 R /XYZ 90 136.482 null]
+>> endobj
+9413 0 obj <<
+/D [9394 0 R /XYZ 90 108.479 null]
+>> endobj
+9393 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F32 772 0 R /F38 3411 0 R /F24 537 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9479 0 obj <<
+/Length 2104      
+/Filter /FlateDecode
+>>
+stream
+x��Z_s�6���SN��` $��{�K�L�t�}�C��P$ds*�
+@�u?�- R%��
��tn2� X�����΍��wg��>;�]'D�O}�z���^���R�ӄ`���`�'�S�'����rJ�\>܊T�чl.c�pq�Nfi�NB�U)�3����2V�?���SLD��I\�NhN�����/g���\0�'��>���~����
��L�
���t���s�k��`>��`yn�pB!V�ϔ2�y���4c �,���yS����Тd*Z�YQ���>c��?�B'e��Ӛ������i)E�G�a�2�QTkY(���-���]��ˀ��Xɵ���4]�}�L����H�,�v��j?�Y�q���՟1v�񐏃
��:�G���0�D-��tBw]��Q��8��Q)�o�'�RN=6)���r��X�%�j��1?�X��\˯�:�	oJ��R��I
E���J]\SFR��AwI���J/���S�4`gϗ�k���nf(U�b�� �w+�U���
B���m,|��
�t�E����>���H�L:�
��E]#�4��L�'�
~�
�fv�9[��!☼�)h�<~�;����������Q���W��U���Y�*�^�*5�-�������3�a���5x�B�{c��B+a�0I֫L�ͪ�>x a�x �\�Ƒ]@��;���������n�<.b]o��?�&A�p࿴��룀y#�d���©�/
(�}f�5Vɽv��Ы���>�;Wwz�B �n&=
+b[Z����m�w�ޅ���6|WG�
��ظ���w��j%:�D)͡��,�gI������3���yCnpb9��'���=&^.��2/o���ZE�pr�RDY���Fڽ<�e��&��z�V�@1J��`�Z��T5��-��-]����;(���H��P#c!�O?<�����>��M
3)�'
t��C������*S�[�
5|�jw�
1K���J�,J�������6�Y7(�
�S �*�~QH�N��6�Z���z��}�a	�,b'�z��/��Q�"��˚��T�qn5�J�Y&�n��
^�Gtc�f��v%�� �R]��[��D�p��6n�*+n���|��r��#AL�+ X����曎-���m
p$�a2�h��	�e����u�����'��=��;��"�����m�5�l�ڧ�a
Ӵ`q���r��Ӷ�J۶�(
Vl��~f�8UL<

���c[���JtF��}�`���>E���(�:K��0���C����%x�f�
��}Rͪ�I"�Z���;���������t~�!]BA$�3e��ƈs6&|摺7w����0��>1̮��U'�2DF*KZF�Ϫ���Ⱦ�8]a�Y�(hiET��	��_@؃������x
�F1
d��L�+M�{

B�AF�`�lF����Ѐߺ���n�N;�<�;�a
� ����u����j8hۨh(����
\rj)��an7�5(�l�m)j��.
,��V�ҤZ
4
*R��ڦ�\f�P�h�F�)H/9����|QF�Ǯ���y�#γ\�>�r�^���oVV�.z��ğ��ʚº���b��{��L%��+��-7x�N�>��N�{�FZ�Z��
�I�a�$�
��̠vY��+]&@����|�!
�?�|n  �o�E�KEգ��{J�5%
�
���hUv��X%��t��F#�����	��z�X
��^�ѓ^��H�)�z���� !��_�����R�� ��c�RP�C7F}�k�4�
�4

$6L���F|%D`�9��y.Gڼe���4�..:��7 �zj\� {�L:���3����;��8;̐�A���5���CŠ��3kt2��
�J�?y����	�;�y�mUh�����o�6o���X_�2�o�wݠ���;������q�ǸX7�L�w��js�H�����^�Ƶ,�9���0k5Yx��涪V����
��%���
=;�@��[4X^��]��m����F�
����(�
�eL�9�;c�YX�p�>w�oKP�����/�
+endstream
+endobj
+9478 0 obj <<
+/Type /Page
+/Contents 9479 0 R
+/Resources 9477 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9495 0 R
+/Annots [ 9390 0 R 9391 0 R 9425 0 R 9426 0 R 9427 0 R 9428 0 R 9429 0 R 9430 0 R 9431 0 R 9432 0 R 9433 0 R 9434 0 R 9435 0 R 9436 0 R 9437 0 R 9438 0 R 9439 0 R 9440 0 R 9441 0 R 9442 0 R 9443 0 R 9444 0 R 9445 0 R 9446 0 R 9447 0 R 9448 0 R 9449 0 R 9450 0 R 9451 0 R 9452 0 R 9453 0 R 9454 0 R 9455 0 R 9456 0 R 9457 0 R 9458 0 R 9459 0 R 9460 0 R 9461 0 R 9462 0 R 9463 0 R 9476 0 R ]
+>> endobj
+9390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 707.957 168.216 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac915c8d26a7dbcdbbd0c4985ec5b7d4b) >>
+>> endobj
+9391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 679.921 226.308 690.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a811f6f947785240bcb76bfca023fed17) >>
+>> endobj
+9425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 652.259 297.728 662.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af4e7705af87f5eb64d2ebdc60cd7a36e) >>
+>> endobj
+9426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.544 652.259 336.732 662.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+9427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 624.224 283.353 634.754]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_acdc0aeddab3d98e336719f42e6e5b06c) >>
+>> endobj
+9428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 595.815 191.718 606.719]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+9429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 595.815 288.852 606.719]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a13419c5d820bde20af5eabd23e479ec8) >>
+>> endobj
+9430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 567.779 191.718 578.683]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+9431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 567.779 303.079 578.683]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac3e03bc2df621903d136c689c38bdb6f) >>
+>> endobj
+9432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 539.743 201.471 550.647]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aba6b40a4b9708e94d6cd10f54144ed70) >>
+>> endobj
+9433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.808 539.743 293.874 550.647]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 511.708 182.044 522.612]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a1f0828932daf26d10e94120c1f4a4d6b) >>
+>> endobj
+9435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.381 511.708 274.447 522.612]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 483.672 272.783 494.576]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77a904793c99cfb1d61fadd277d59471) >>
+>> endobj
+9437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 456.01 150.493 466.54]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a081718c23b5785da17c63ffec13536cc) >>
+>> endobj
+9438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 427.601 181.845 438.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a164c38a51c8718e6ac3a3f3e4af77bf0) >>
+>> endobj
+9439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 399.565 181.845 410.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) >>
+>> endobj
+9440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 371.53 154.727 382.434]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a0f19da4c46bb8b3be01875eff4c00538) >>
+>> endobj
+9441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 343.868 176.505 354.398]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a58b86510b9c4dc05004c0fc01622430b) >>
+>> endobj
+9442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 328.803 450.955 338.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) >>
+>> endobj
+9443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 304.5 169.013 315.404]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a64600674ceb04a95caa3db13515aa9ff) >>
+>> endobj
+9444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 304.5 237.894 315.404]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 276.838 200.963 287.368]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a32364020a67e8172442cbd9d1077cf44) >>
+>> endobj
+9446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 237.843 179.384 248.373]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad350a787056fefe667783a60a9f2923e) >>
+>> endobj
+9447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 209.434 155.594 220.338]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aaaba43818b9aa3f407359d15a971984e) >>
+>> endobj
+9448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.092 209.434 200.545 220.338]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a06120732f13ccb8a783990187512c123) >>
+>> endobj
+9449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.834 139.301 201.899 150.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.8 139.301 239.767 150.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
+>> endobj
+9451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.909 139.301 343.158 150.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.736 139.301 421.493 150.205]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.33 139.301 521.308 150.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.834 99.31 201.899 110.214]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.8 99.31 243.622 110.214]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.764 99.31 347.014 110.214]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.707 99.31 464.641 110.214]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.509 87.355 285.893 98.259]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+9459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.517 87.355 357.275 98.259]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.709 87.355 457.687 98.259]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 74.333 202.497 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 74.333 244.818 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) >>
+>> endobj
+9463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.633 74.333 310.391 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9476 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9480 0 obj <<
+/D [9478 0 R /XYZ 89 770.89 null]
+>> endobj
+9481 0 obj <<
+/D [9478 0 R /XYZ 90 721.073 null]
+>> endobj
+9482 0 obj <<
+/D [9478 0 R /XYZ 90 697.251 null]
+>> endobj
+9483 0 obj <<
+/D [9478 0 R /XYZ 90 613.144 null]
+>> endobj
+9484 0 obj <<
+/D [9478 0 R /XYZ 90 585.109 null]
+>> endobj
+9485 0 obj <<
+/D [9478 0 R /XYZ 90 501.002 null]
+>> endobj
+9486 0 obj <<
+/D [9478 0 R /XYZ 90 472.966 null]
+>> endobj
+9487 0 obj <<
+/D [9478 0 R /XYZ 90 444.931 null]
+>> endobj
+9488 0 obj <<
+/D [9478 0 R /XYZ 90 416.895 null]
+>> endobj
+9489 0 obj <<
+/D [9478 0 R /XYZ 90 388.86 null]
+>> endobj
+9490 0 obj <<
+/D [9478 0 R /XYZ 90 360.824 null]
+>> endobj
+9491 0 obj <<
+/D [9478 0 R /XYZ 90 321.829 null]
+>> endobj
+9492 0 obj <<
+/D [9478 0 R /XYZ 90 226.764 null]
+>> endobj
+9493 0 obj <<
+/D [9478 0 R /XYZ 90 158.28 null]
+>> endobj
+9494 0 obj <<
+/D [9478 0 R /XYZ 90 91.34 null]
+>> endobj
+9477 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F66 3165 0 R /F67 3022 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9569 0 obj <<
+/Length 1573      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�J3�I��䐦�'�&������� �S�TH(����K�$>\�q���!M ����]`W��J��y��i��5g��l���t��X㺍
�[h��
����[��"�	��ǯ>~��}�N�X�l���#0�5�0������k
x�VÈٖv
O�4�2���I�
Nuٿƺٺf�n��t#�F��8!��D����ЏCjྼ���	��;��"L
��p��}1�n�'�
��D�w�X�R���	�WT182-����
'���lBE y4�.��360��Thb׾Q�D��Lڛk�8CF8¦6$
an$+>Sj�i��k�#�y�=0GY|
��ٹ�E�� ,I�\�M
��R5�,�~$��{�c����z)c��
_z\Dx��
+(E�N����z at n5)�S�
&PҎ�����nB�D�Y�5�����[�h
��i�
Q����R�brON?���	���@,Ԁǘ�]��0N�M�J�m�n���qe4���B����)M5�
�c��Z���@�&
P� K�ke@��~�@":"���	��!I��c����7E�&�
��Cnճ�#"
Ĭ��1eb�q�ouleٷ��I�
�܀fH�ɿ
�'�C����j����	_y|&o7�
�s3�6�\���U�w�ox��m����
I�h���x���t��I�]��f-��zxr3ڣ��6�p�r�J��+]g�;�w��7��}���N=�����?�����Ѧ�H�5�8ˉ��Pi}��>H��]�~�^�A)��`����.�s� -
���L���q:ł��y
��t�a��v2	I�pZ3 wf��"j(��%���6�
+�(��%
'���_l/����})e�^�d��@��-q���`����wK��=�zOh{N�g��W`r�r<9;�;�l��'�97�e�W<��DZ.��X��}=�J�`fԆ,�Ŕ0kG�/�_o����R�u��
a��Yx82�(}������.�J|��
D�R��j��b4
+"
+'�W�J��e$u�)R(�����
B�~��l���U��.��m��P�v���r�M�PN����v��:����k�~�9���oﳯL��Mt�8
�&F��
+�ڕWG;Q0+�r{�R�Qlր�QG*��\sq3��֮x
��6%�-J.�U_rY���u
���Qa�nD=\�fr��*ob.s8Z�Q���
+7ٺ�˟%cB�f�q��vX�6�U�錗�ԫ���dmx�d4�RM���#��Y%+[��K�CZ��6D���Fޏ	0�`m���� +�"Q��6z)��X
dYۛX
d"�k,���~R��#
����|X��Q��'�Gk�v����z*����?�3Zӛg��ڐAH�
��ސ��7�eCޑ�	�����q��~�SX�sd��WA_{a�9����`�&}p��c�oۉ���N`������%(�^Z�]\�On��D���0�i��w��f�W�7�t�~C!� �,�51	�MD
�n媿S�V�#��?���r3:=�ܮ ���a��-�mH�y��w� 뇹><�bl �C�aX
+endstream
+endobj
+9568 0 obj <<
+/Type /Page
+/Contents 9569 0 R
+/Resources 9567 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9495 0 R
+/Annots [ 9464 0 R 9465 0 R 9466 0 R 9467 0 R 9468 0 R 9469 0 R 9470 0 R 9471 0 R 9472 0 R 9473 0 R 9474 0 R 9475 0 R 9504 0 R 9505 0 R 9506 0 R 9507 0 R 9508 0 R 9509 0 R 9510 0 R 9511 0 R 9512 0 R 9513 0 R 9514 0 R 9515 0 R 9516 0 R 9517 0 R 9518 0 R 9519 0 R 9520 0 R 9521 0 R 9522 0 R 9523 0 R 9524 0 R 9525 0 R 9526 0 R 9527 0 R 9528 0 R 9529 0 R 9530 0 R 9581 0 R 9531 0 R 9532 0 R 9533 0 R 9534 0 R 9535 0 R 9536 0 R 9537 0 R 9538 0 R 9539 0 R 9583 0 R 9540 0 R 9541 0 R 9542 0 R 9543  [...]
+>> endobj
+9464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.764 708.28 422.252 718.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 694.882 202.497 705.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 694.882 244.818 705.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8950f38d19f1b721d66b756b0ae10cb3) >>
+>> endobj
+9467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.155 694.882 349.405 705.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.058 694.882 428.816 705.786]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.834 666.739 201.899 677.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.8 666.739 245.306 677.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.448 666.739 348.697 677.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.391 666.739 466.325 677.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.509 654.784 285.893 665.688]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+9474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.517 654.784 357.275 665.688]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.709 654.784 457.687 665.688]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 626.641 202.497 637.545]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 626.641 246.502 637.545]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) >>
+>> endobj
+9506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.317 626.641 312.075 637.545]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 598.498 202.497 609.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 598.498 246.502 609.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) >>
+>> endobj
+9509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.839 598.498 351.088 609.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.742 598.498 430.5 609.402]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 570.355 203.075 581.259]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 570.355 296.324 581.259]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac74dafaa0b06e9cd3d15ea0d2af1b213) >>
+>> endobj
+9513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 555.61 337.637 565.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 542.585 194.297 553.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a041afb1a2cc7277572fb7235cf08cf64) >>
+>> endobj
+9515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 514.442 188.759 524.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ae94a99f8e8d290b5791baa01fd540a14) >>
+>> endobj
+9516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 485.926 226.019 496.83]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.758 485.926 301.843 496.83]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) >>
+>> endobj
+9518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 415.54 222.711 426.444]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.209 415.54 314.187 426.444]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.794 415.54 361.329 426.444]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade) >>
+>> endobj
+9521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 317.876 226.034 328.78]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a082a74ad0ce931ec2e517bf0f009daa2) >>
+>> endobj
+9522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 317.876 386.241 328.78]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 289.733 156.281 300.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) >>
+>> endobj
+9524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 289.733 225.162 300.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.374 289.733 308.439 300.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 261.59 178.976 272.494]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.735 261.59 217.703 272.494]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeca84d3bda389453f22a494ab9923088) >>
+>> endobj
+9528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.563 261.59 322.812 272.494]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.054 261.59 402.812 272.494]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.508 261.59 513.996 272.494]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 249.635 177.322 260.539]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 234.89 452.208 244.795]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
+>> endobj
+9532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 221.492 178.976 232.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.607 221.492 222.43 232.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a80ef003442edc6db8e77caa4de7f7ef1) >>
+>> endobj
+9534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.033 221.492 329.282 232.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.706 221.492 448.641 232.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.93 209.537 280.314 220.441]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+9537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.46 209.537 351.217 220.441]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.054 209.537 519.644 220.441]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.317 194.792 513.996 204.697]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 183.833 201.717 193.738]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 170.435 178.976 181.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 170.435 221.297 181.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a538c16dacec86f66e9520c728a7c5f35) >>
+>> endobj
+9542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.112 170.435 286.87 181.339]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 155.69 349.876 165.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) >>
+>> endobj
+9544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 142.292 178.976 153.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 142.292 221.297 153.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4be36a9309c5ecfa863e326c44296391) >>
+>> endobj
+9546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.634 142.292 325.883 153.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.537 142.292 405.295 153.196]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 127.547 456.547 137.452]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8950f38d19f1b721d66b756b0ae10cb3) >>
+>> endobj
+9549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 114.149 178.976 125.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.286 114.149 223.793 125.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a622b8ffad2bd654696c12d7d07ba51c6) >>
+>> endobj
+9551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.754 114.149 330.004 125.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.107 114.149 449.041 125.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.93 102.193 280.314 113.097]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+9554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.46 102.193 351.217 113.097]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.054 102.193 519.644 113.097]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) >>
+>> endobj
+9556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.317 87.449 513.996 97.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 76.49 201.717 86.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9566 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9570 0 obj <<
+/D [9568 0 R /XYZ 89 770.89 null]
+>> endobj
+9571 0 obj <<
+/D [9568 0 R /XYZ 90 712.265 null]
+>> endobj
+9572 0 obj <<
+/D [9568 0 R /XYZ 90 644.024 null]
+>> endobj
+9573 0 obj <<
+/D [9568 0 R /XYZ 90 615.881 null]
+>> endobj
+9574 0 obj <<
+/D [9568 0 R /XYZ 90 587.738 null]
+>> endobj
+9575 0 obj <<
+/D [9568 0 R /XYZ 90 559.595 null]
+>> endobj
+9576 0 obj <<
+/D [9568 0 R /XYZ 90 532.524 null]
+>> endobj
+9577 0 obj <<
+/D [9568 0 R /XYZ 90 504.381 null]
+>> endobj
+9578 0 obj <<
+/D [9568 0 R /XYZ 90 434.573 null]
+>> endobj
+9579 0 obj <<
+/D [9568 0 R /XYZ 90 364.272 null]
+>> endobj
+9580 0 obj <<
+/D [9568 0 R /XYZ 90 278.973 null]
+>> endobj
+9582 0 obj <<
+/D [9568 0 R /XYZ 90 238.875 null]
+>> endobj
+9584 0 obj <<
+/D [9568 0 R /XYZ 90 159.675 null]
+>> endobj
+9585 0 obj <<
+/D [9568 0 R /XYZ 90 131.532 null]
+>> endobj
+9567 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F32 772 0 R /F38 3411 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9640 0 obj <<
+/Length 2408      
+/Filter /FlateDecode
+>>
+stream
+x��Zms�6��_�~ɉ3�7���L�M���i.��}H;
Z�-�Q�BR~鯿�
)��9�sM��3&	,��g���w�a���_ΎN^
+�)�Bzg��ž�
+!|-���Q��)�O��O�b���)����2^���䢈����U�,�_�Y\DU^�S�ɷiT���m|>��8����0�&
�׳�^�
}8" ���"@Bz����_����=���ލ!Zy�2x�޻��
a�n+�b��3�	B!V�_(
����z��ʉ��Ց�~��=�>:F�{�Ǭ�$�:��
`׾;
L�.�2Ϊ�J�lh|
HO�<y��'A�k�)E!�ޔp$�[�w˼��Q��
s٨�G���>	&���V=���gb�z��0=�4�j�L�����R�<+�q�N�8*�_��+��ڳ�x�����2}
X(h+<�}��
�~��S`����C�E�����k������ � �u�x
nw�۸�Y����$��
#�`d�b[�.O�DHj���*� ,��;�]sp�$,�~;0�@!�
���6�u�|�w�1Œ�c��v�?4�8��I���W����gY^�p#���a��X"��a����Y^VE
����C`�E'Qb0qc���
����i5rD)?��ٙ/��n
�:�S%窋ȟ7�z�S����|X���P��v
�����W�|�,6�
�Lb?��dz��먈Vq�$
�����'�!]�N�
^���<��i �1�'`�󪈒����l煮�mm��-Ƭ
���SM���:����Z����\>^�����ǟ`�(�e8��6ۑ�z1�}�X at d]��{�"�uE����GU�����=�94��6���b\��Ɯ��Ї%T��E!�N�0)=���8w�(�!i
V#⎫���(Ic]!R	_�H�;f���`k��b�p��od�t~��m��Ikѧ5�3��YB]a���;��/����մ�2vY�99�=�J6��=�\�i��Xx�dW�.���4D��q�E�n
+�%T�[���H���%�-�1s�o��G!T��TX&՜D�B %@dSk�0�#���
��&ֶ�N>����#�Q?NmcT�֚�
+�qЙ.sd�EƑ���^�xW�Q*j�k�
�k��S� ��ā���t�
""A��io/"L &ٽ0�I~v0 �����O���h�(�!Xˠ�ݦ$X�؋Q�M1RJ�pнq"R\�^X"��ؽ����\4ueR�T�t�v�
��]��,<y�c�1�5%]�UO{j����]*)va�6c F�²kAJ	°G
`A}j���
��O�
�P�mQ�xˆ�}�?�/p`����M��
�m���3������3t�0�
 a�@%Al�g���LT��qg>�3�'v�>Ȃ8�B�aȆ��
��1�
V ��%TK��ihs<�
��� �c�&7Y$�8+�
ܥ\G�
+8�^j�\��]4Ty<(�>&n�na������d
� )tD=�w]'%H
�C���Q}��(WF}��P��؄����Blo�����}�,U��S��
�Br�c��?&��5��!�E4_j�dR�#{�f�
�W�_���1</t��U�S_�P]���;HG
��c6�
���y�h�.7��� SҊ���ւJ�8o`�KQ;zA�*T�}
0l4	\/��roU
8꫖�)S�Rv
�;F��BB��
�v(�v�91�
���V�{�����;�Bo�B���6�N��I�k���a�>E�L��Qi��g��$S�FG���!�����
����FIx�*��)
��هJ�}S������2�+�dmš�\�t��u-.�8�'�|��A�FO$�(�"�Y
+s���D��l�M�����U&�u�F%WY^�
��ZE�'�\ƙ�s�[��x���ӄ@x�!�-t�CZظ�̀
v\�od��E��"��g�(2?�ڬ\
8�
O�2��\�h�����U�57�-�
����^�Hl���
�%��g�M��OS;�A��/��$��7E��d&4(�����:nSM�^_�^��d�	����K��:; ���c6�;�֒E�&��eղ�=�Vn��dl��s��
B�p[�N-c��m�" f��Nz�De	.jVQG�"�.�ȁHM;	��P42�h%i���s�M���˃@�
���a�D��h�s
��&,g{vW�~����2D93�FD����p�4���V��C�i�ĐI
+2D��0١
"�M�҆�����LHe��>��=��N
Xp���9h��7o^ۗ��q�'�9�e��aS�x�1���	"�f���V���.�
+�o�~����V
"0�	˪Z�NN.6We�]!�N���-]�BuB�h�װH2h\�3_T
�-aaP��`�ຘ�8�_��t�]��+�}����?��J��
+endstream
+endobj
+9639 0 obj <<
+/Type /Page
+/Contents 9640 0 R
+/Resources 9638 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9495 0 R
+/Annots [ 9557 0 R 9558 0 R 9559 0 R 9560 0 R 9561 0 R 9562 0 R 9563 0 R 9564 0 R 9565 0 R 9591 0 R 9592 0 R 9593 0 R 9594 0 R 9595 0 R 9596 0 R 9597 0 R 9598 0 R 9599 0 R 9600 0 R 9601 0 R 9602 0 R 9603 0 R 9604 0 R 9605 0 R 9606 0 R 9607 0 R 9608 0 R 9609 0 R 9610 0 R 9611 0 R 9612 0 R 9643 0 R 9613 0 R 9614 0 R 9615 0 R 9616 0 R 9617 0 R 9618 0 R 9619 0 R 9620 0 R 9621 0 R 9622 0 R 9623 0 R 9644 0 R 9624 0 R 9625 0 R 9626 0 R 9627 0 R 9628 0 R 9629 0 R 9630 0 R 9631 0 R 9632 0 R 9633  [...]
+>> endobj
+9557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 178.976 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 707.957 222.98 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aca47a151389a78c2474186b9628ab5cc) >>
+>> endobj
+9559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.796 707.957 288.554 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 693.484 350.521 703.39]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) >>
+>> endobj
+9561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 680.358 178.976 691.262]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 680.358 222.98 691.262]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) >>
+>> endobj
+9563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.318 680.358 327.567 691.262]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.221 680.358 406.978 691.262]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.393 665.885 457.193 675.79]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) >>
+>> endobj
+9591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 652.758 180.54 663.662]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a3075c67d9868fc0b483db13256fb4e0c) >>
+>> endobj
+9592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 652.758 272.942 663.662]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.676 652.758 379.741 663.662]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 625.159 178.239 636.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ab7b9abebd48fe0ad129a237338aa96) >>
+>> endobj
+9595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 625.159 270.641 636.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.374 625.159 377.44 636.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 597.559 226.034 608.463]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a6fb154017052c68b63121cef49c568ce) >>
+>> endobj
+9598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 597.559 411.457 608.463]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) >>
+>> endobj
+9599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 569.96 180.54 580.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a3075c67d9868fc0b483db13256fb4e0c) >>
+>> endobj
+9600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 569.96 272.942 580.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.676 569.96 379.741 580.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 557.156 178.239 568.06]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ab7b9abebd48fe0ad129a237338aa96) >>
+>> endobj
+9603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 557.156 270.641 568.06]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.374 557.156 377.44 568.06]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 544.353 178.976 555.257]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 544.353 217.441 555.257]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a82f262d4a5b57ea92ef25f5f49006ffe) >>
+>> endobj
+9607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.778 544.353 322.028 555.257]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [339.681 544.353 401.439 555.257]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 531.549 178.976 542.453]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.34 531.549 221.162 542.453]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9188a38b44fd9b356f73459148e5f57e) >>
+>> endobj
+9611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.231 531.549 325.481 542.453]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [492.637 531.549 513.996 542.453]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 519.968 159.618 530.498]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 506.791 178.976 517.695]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 506.791 221.297 517.695]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a538c16dacec86f66e9520c728a7c5f35) >>
+>> endobj
+9615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.112 506.791 286.87 517.695]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 493.987 178.976 504.891]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 493.987 221.297 504.891]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a4be36a9309c5ecfa863e326c44296391) >>
+>> endobj
+9618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.634 493.987 325.883 504.891]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.537 493.987 405.295 504.891]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 481.184 178.976 492.088]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.085 481.184 222.591 492.088]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ac1e87cdf51be31f4c9c43c4c86bccb66) >>
+>> endobj
+9622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.149 481.184 326.399 492.088]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [492.637 481.184 513.996 492.088]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 469.602 159.618 480.133]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 456.425 178.976 467.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 456.425 222.98 467.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aca47a151389a78c2474186b9628ab5cc) >>
+>> endobj
+9626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.796 456.425 288.554 467.329]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 443.622 178.976 454.526]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.474 443.622 222.98 454.526]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730) >>
+>> endobj
+9629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.318 443.622 327.567 454.526]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+9630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.221 443.622 406.978 454.526]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 430.818 156.281 441.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) >>
+>> endobj
+9632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 430.818 225.162 441.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.374 430.818 308.439 441.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 356.783 242.885 367.687]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9637 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9641 0 obj <<
+/D [9639 0 R /XYZ 89 770.89 null]
+>> endobj
+9642 0 obj <<
+/D [9639 0 R /XYZ 90 697.469 null]
+>> endobj
+9645 0 obj <<
+/D [9639 0 R /XYZ 90 417.377 null]
+>> endobj
+9638 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F11 621 0 R /F91 766 0 R /F102 863 0 R /F8 802 0 R /F7 803 0 R /F10 773 0 R /F13 835 0 R /F6 862 0 R /F9 880 0 R /F12 940 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9684 0 obj <<
+/Length 2370      
+/Filter /FlateDecode
+>>
+stream
+x��Z[w�6~����J��
��K�INoi��>e{r(��yJ�2I�v~�.$A��$�q�b� 8���7�
��u��w��/.�J(���*P8��B\����a:�c�c�D���i�����7��t�ś����.
+�#����?p�������[3h���3
>\�����OD�~��BE�F
+a
�0�B��7w�f�%��ф�5
�^��B"$�
+f#̬������ȲbJ��6�׶iY�\�bJ�d�f����ǺLW�-Ks7�6����*-�e��^��[�o�b�Q����!4�� ,������o�s?*$��
!_�ޱI0
�
�s���X�����m�L��o��jw
�* !��8�D�t�G�j��\;��]kZ�@ %Y�e̘�Hp�5�`��
+{���.ɓ2���'9�8�85�o]�p7J���Qy_�0�wV��>�{�}�䛑=c0J�X��{w�	�橶�W��n
�(�u����A�����l^�=���w2���<��
t����}�[��$S�'w�d���H
�@u�;B9�
�G����i�CD�0�Z�Ze
@���H!��3"����SQ��#V[S2���0x�:�
Vg�͇2��մ���e�Iꤴ�qe�m?4|�J@����h`���P���|�"��̷ 3�̡�QxD�l1�`
�$�}`�z�%�v��,h�N�-Ž��)G�s0$w����:9��F�0F��8n'�}2i�'��#��po��u�������Q�a�1�
�#�eP7w�v�΢@5��.86x�=�C��ѩqsBt~����p�}Q�
n�VC�P�]��N��NӥϬr}W�
x�Қ
{�zx��
�ws��M 
��
�5���a���=_7�ɶL�$���
�0dè�3�V�]�h�O���T�e��Ț��zW9�� :�9Q�Q�r��	Qam��
���P�"R:���r�4���
��wC�f@	[�t�=q|�
�#�Q�Lg�KX�݁����
�����}�C�;{��
��N�( UCw�38��

����>B<1�#�{H�{ȣd���1Ԏ�xq���E��P��=TY�Cƙy��F�{�9;{k���߶E��c������X=^C�a^Cb{�&:�8�e(�]-}� ��Q:� ��6��Р�?�c�>�� 9ׅ�����
}�8R`��$v�هu at 0l�G���}K��� $�`
"�:�!�|?*&W�Ϯ�
8?k��E��.�8�Úy��3�%�/��ϡ��]�P���Q�����	`0����t�fq��O��
�X*�|O� a�)WU˕x99���a'������g7>�L��.K��&�ثy�X�a���O0�1�\3��a�`l.N� [...]
эB`��� �aҕV���*Y��D7.�*�o���f�۬H��w�6��x�6ǵ��
��QV�?.����w��z��e_�.�n�z�
+�0�ݡx�Oo� ��~��@EH��U~
+���z!�f��䗭�ׯ��}C
sS�~	~T�n{$��}s�ҟ)�����
z<
������:�Ps�>���v��GE��V�di�&���
��/
+�_m\�a�X߂��83�p�y�
+�[h��

�TK������X��������7��]U�󸹐�g����.s����,�v-)(�7{_��

+����( �뫢ogC�NA)�m4��
�԰��*Jm���
"�f�/����;?�V�siux
�~���R�_���]�%��6�S�+P7P��A�qh�U�E��.�Ӹ�ս�6[َ
���ظi���8׆C�>~[���xP�	$�re�,��\�y\'�tx�6n��U
����#*}���hx���#
���b4��b�8�[ ���Eu����C�� �x[���
�F����>u�+x�~����]��(��We�J�5�v�C~��<<C���j:�s����j��ǃ�*9���	n,M�h���
}�6�!��T);��tއ�D\�_�� 
�DJj:�w��|�.ذ�����@ެh~�F
+^ Dh/F8�
m&�W���g���*)�1�|�p���.��֭+�T�"�2���[�I�[
��?ۥ�d��[��(� �����//�u��k�,6�slHAR-[�h�צ(�/@���'4T�����C
+endstream
+endobj
+9683 0 obj <<
+/Type /Page
+/Contents 9684 0 R
+/Resources 9682 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9495 0 R
+/Annots [ 9635 0 R 9636 0 R 9653 0 R 9654 0 R 9655 0 R 9656 0 R 9657 0 R 9658 0 R 9659 0 R 9660 0 R 9661 0 R 9662 0 R 9663 0 R 9664 0 R 9665 0 R 9666 0 R 9667 0 R 9668 0 R 9669 0 R 9670 0 R 9671 0 R 9672 0 R 9673 0 R 9674 0 R 9675 0 R 9676 0 R 9677 0 R 9678 0 R 9681 0 R ]
+>> endobj
+9635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 674.442 167.29 681.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 674.442 225.87 681.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
+>> endobj
+9653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 635.663 167.29 643.189]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 635.663 225.87 643.189]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) >>
+>> endobj
+9655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 561.981 167.29 569.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 561.981 225.87 569.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 511.247 167.29 518.773]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 511.247 230.055 518.773]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 472.467 167.29 479.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 472.467 225.87 479.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 410.741 167.29 418.267]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 410.741 230.055 418.267]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 371.961 167.29 379.488]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 371.961 230.055 379.488]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 333.182 167.29 340.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.325 333.182 255.16 340.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 325.212 167.29 332.738]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.062 325.212 271.898 332.738]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 286.432 167.29 293.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.325 286.432 255.16 293.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 223.743 167.29 231.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.325 223.743 317.925 231.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) >>
+>> endobj
+9673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 207.803 167.29 215.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.062 207.803 271.898 215.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 134.121 167.29 141.647]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 134.121 230.055 141.647]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 83.386 167.29 90.912]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 83.386 234.239 90.912]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9681 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9685 0 obj <<
+/D [9683 0 R /XYZ 89 770.89 null]
+>> endobj
+9682 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F8 802 0 R /F75 562 0 R /F102 863 0 R /F7 803 0 R /F32 772 0 R /F94 771 0 R /F99 864 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9698 0 obj <<
+/Length 2574      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s۸�_���R����ҙܝ��5����>�n<�ٜH�BJq|���]`��'i;}.����K��6�����NN�'"�H�8��
�(#2��i�.d�H13Jix9b4��E~}9�4��wjZ�ׯ��:���^�����*U���z4撆?����5S����*'
+x2��PP1���瓋��'
��C)$I�`�8y�
�0�s@�����-��
h��ۓ��PC1�6�hB&��1�n��
ʱ�]���ň��c�8�
+�(�~3U�'vr���/>M�rUTe�������=:))�Rwu�Θ'�$�Y 
J|�)_,�4��P���vsߎ
%T �K-i^�
�Ru�p���>V�:��-� ��,\VE�jptb�
+��\�G��Nȱ�'eHF�g�sMhT	$E٬r8x���Nم�DzW����.���6hv�iR�`	O�{�xK�J%e���Z�똝o3�H�S��p�H��cp�Ê�1��j���2����+��Qo[q�c��#��=�&,n�7�k%�e�_K M�T"d-}�@c#�3�ɤķ7�z���R^��٠A�+׷֧�hM�'
� `�!�
��Y��1�̇�i��w��-UϠ<�,��%,O8���h�#��(�F?��bc
BQ���\��}�͍
5��'8�X��������c�:�x6o*�N<������ :3t�1r
�5őU�m�T�b���:|�P����Zإʪ
h@�U5r�J��3�+�������9P����E��Tcp��go
��
� �Zc�
#

%ɢ=0��=$
��$5��&��jA \�n��;'jq�� ��ζp�ĭ<�K�H|������
tJ<�r7��`K
N�ӌDpa
��r7�y�[i�ℯ���2�8���s�$§$�H� ���S �긆��(g���0r;et7�f1�cч���А�k���Yx��!"x�Q0|�966�ӽ�X��rD0�Y�~��BL,X�s��4ӹ��
>�1���"|e�5�/�R�9�XYu�O'2P�ԟ��s�K=sne�W�I3*�b�U���8�(��a���m�,�s�b��f�s-V��
��
�t�"��Ւ�����m��ߐ00��L�Ѱ0)T��fݾ���Z��E�_1�?3�2�	Ϊ�
M
C�/��yI��_5��>�C���}�� ��Ǜ��l�	�|2Q�%R��{
,7��l�I�"5l��}g|��i���A�yJ&��uzˆ ���
w���I�v�	v{!<{���	�G��"나��
 ���P�}�i�109N��$�h�!���ˡ��I\s����ϼ�xW��VZ2�����w�b�p�qW�G����
Tl�����z�
�pJ���=D�R}��H�gG
��(n��[>���?Y��G��X�̔Y���<�D��&g�G�ő�Q��(�8Q���v<��X�6I�
���
ɋm{� NS�n��9�gP
�$Xr���`9�
�}"����ӎ
��Q�j��p�MR�5т���{�����m$V̆�nm'��͵At��7��&���BR"�8�	�a���J�̚��\�N�V���1v���1�<�!�{�ΰ�͐������U9���(Iˆ���x-��/>-k�qMpk�ϑ�
E��̆S�Z�iJ�]�0l`~�R
�'bb��v�;�s$(�c����y츳9�lPneS��-!-z�J�с�Ղ��E�L�����ɬ0q�����.rr
��dL���.f��n�8ߥV�
q��sJ���8�TO�c�&��]d��>�/.[1��Gy���-���#�_͛
��b�@�ˠ|ׁ�n��.���}� {��jc3ֵ�Sk�j
�Jw3�I�����
p�w��N!�X
w�-W���F�pq��J#y��SX
+DBby��,�[���@�znu_ݬ��8���MӭW���lG^x�Lv_PK��V� 9t����������V�i��&���[@��#�g?��ћ�?.����j�n.?<wC5[f
�����w��t
�~� �՝ʹۜ���(\	D؏��/�\H,��>XY����� da�ucImfȰ$'L�l%�K�"��d�5S8`�W8��}$�R7�5���&DB��K�[�j%�;$��D��0
�<���`@YWT
f�ݸzUm;��+�XS�Z����?XX�s��vA�
��ט�@+�Py?n1x�7��(
/�Q�
+?�؏�F��.oi��y9ı�f�Q��f�qJ(o�G��pvv5J�p3,�t��X'�4��d��
�Xj|L!
Y���:^��
��NP8��z
�T؂ޫ��\�۝ �HZ�ٵ-g8���?�Ԃl��
5�+@F̐9�go�����x�O4лx�h
to�T�$�
�d����_��*
��~��0J�-��/M
��ű�ҸhR�0��OA`X�n�xy�
+;kT��+��\�'L��W��E:�
 uL�=B��*�3(�������D'K(�Ҷ�p�Z-�NOoַ�*o!�Zlk��KFh�d�.*�އ��Lr����$�j�ܑ�����C�o^��v���B?V��9��
+endstream
+endobj
+9697 0 obj <<
+/Type /Page
+/Contents 9698 0 R
+/Resources 9696 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9495 0 R
+/Annots [ 9679 0 R 9680 0 R 9686 0 R 9687 0 R 9688 0 R 9689 0 R 9690 0 R 9691 0 R 9692 0 R 9693 0 R 9695 0 R ]
+>> endobj
+9679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 634.772 167.29 642.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 634.772 225.87 642.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 584.534 167.29 592.06]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 584.534 225.87 592.06]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [136.007 395.948 196.58 403.474]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.086 380.008 175.659 387.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.772 380.008 238.423 387.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 309.845 167.29 317.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636) >>
+>> endobj
+9692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.403 309.845 234.239 317.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) >>
+>> endobj
+9693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.297 263.592 204.949 271.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) >>
+>> endobj
+9695 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9699 0 obj <<
+/D [9697 0 R /XYZ 89 770.89 null]
+>> endobj
+9700 0 obj <<
+/D [9697 0 R /XYZ 90 215.987 null]
+>> endobj
+9415 0 obj <<
+/D [9697 0 R /XYZ 90 193.611 null]
+>> endobj
+9701 0 obj <<
+/D [9697 0 R /XYZ 90 193.611 null]
+>> endobj
+9416 0 obj <<
+/D [9697 0 R /XYZ 107.713 110.896 null]
+>> endobj
+9417 0 obj <<
+/D [9697 0 R /XYZ 107.713 95.27 null]
+>> endobj
+9418 0 obj <<
+/D [9697 0 R /XYZ 107.713 79.643 null]
+>> endobj
+9696 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F102 863 0 R /F8 802 0 R /F11 621 0 R /F7 803 0 R /F24 537 0 R /F32 772 0 R /F75 562 0 R /F10 773 0 R /F13 835 0 R /F94 771 0 R /F113 1791 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9710 0 obj <<
+/Length 2478      
+/Filter /FlateDecode
+>>
+stream
+x��[ے�6}���S���0�_�j_�[m�I���㚢%�
k%Q�8v����EI�D׺j�D	v7�s 
�
"
��������b�AFR��GG�$$�5���
�ɇ۟#&5"F�W���~�}���;������W^�TR:�-����

�
aČ�>�FˈS�E���_W�ǂ��^|d�t"#RE at 0
�ɔ`��g�jSO�2/&SJu�Cuy����糧e�*�2�W.�~��hJ9b�����L(��b��&���4��b?���6u
v{L$ELhgII��7F�|1!$��΋�(�S=B
��
+#x�},ȧ���ܼ*�yOB kb��F��0�W�*-�}�ň:�F�z�{�Sǿc�'SnL<���F�)*Ő�b[;6�Ɔk
�TQH�o�CՂ�j��u1>�ذwf� "$>,�j3e0�����Q5~���*�T��K��_r�0�P#��+��*)�TY���	�q�WS�B�h2e���1�^��	�g�Ҏ`���-�{�h7oux���l��
>&��O"b����$KW��"��h�%����**tr�}�U���`)3
+F�%a����#�1�
�)qy[�hG0
#.��ň^�v:	����I!�����{|NgH� �<�rqW~Y�}�����-o��,�^��<�D#�ĉ�
�Q�,f�ْL�a����>|�[J��� �#
+b�N����8f�s>g�#�q��u:�~ǘ���U�4w[�ۂ"�
�P������"�u@��[_
�Q�SG�p89�FJy3������/��c���˧�̻����m��YOXR{J�qQϚ�n�MÌT�<ӗB�.mMaj�û�Hp=F
Ȧ
+C��L��s9J�P����� 8���1�
x� ,h�<U|��\�E�)�
I����^����{�纘
�����
����ؓ��v��}�޹����t�]d;h/�k۾P��g���7����Ӣ��<�;
+�&f�AwUه��1H�`!t�M˧b��pC?�p��W�yV��&�N,
Q�$ݵ|
dT� 
@�N*��B?w���ly��,]�P6��}WTٷ�
+�k�� ��n@�����׶	+��� ���!�8�U�%p%]����I�܎#d�)��e�B
�;pgf���(O�6���&[M`1��,`)xd*~p
�_!�
�
i��c�Աr��NW�UQ�C]
&0�@�X����"w����SE��2 tΟ|}����˪����Jv����6�V3�n��E������_V�gV�v������i���j�T�q+��G7���I��j�{�aa~��aF
�XJQ%�R�e�v��X��1B�
��0���ґ1"V��0�ł�P:�.���0q��6P4g3
j�1
�f< �Y	H\S7�
�������� )��Kp�M|O}�{�T�Q����ފ�Y�]"B��%�.wWz�&&DŽU�|.�$+777��u�
�r�sa`u#��"���8-�լw�p�:����;e��p����WiϰJ�h��=�!�A���Z%���#�Pݔ�p��T��c(��	@�
L	��ܯ��_}�
�G�,��=�B��f������9}����

�
L���~~�����(��
s�ӭ��l�{R'Ag��t���0)lg(�s'-�UD)<�3�"��
j7�&$v��0�֗��ՃO�&��ts`�
+ڵ ��y� �
,L���6m�[�A��Xpj
��Y� �����V�_&R���`у!�Et]�1��Z�J��M'ܨ�PQlL��2y�pcP��������V�uzz�nkw�G���-�a����z���V�@-u~��N`kR1>jQ\d󨖢�Z��h)6HKɓ��1��4uQI�/�R*��P)lb���baC�3�D`��a�v�ÿ�p���g�2�nGv�����.�n���f
�fM	r�xûWom�_K�����To
8��){�k
��R�su�cB�
��c�W�Ȯ�0�w]�����躊��m�
�B~�NWٟK�
UW�L^������X�j̞n�U��g
+���߈�:?[��0�$�M�^��<��tPt�mO}�(��^�:x>S�`h�)~���A�(6D��E�(! ;@��0�!'4�3.G	A)'��Z�h���X[����1`	@��{.B�V�4�[���pn�>�W�B��v�� R'��4G�d�dZ�
�.�a �
\�EG3��HA5�)���/NfZ��:'3ߥ;���= �7�W�E��V��=
�>#�-��Y�C
k�/�M��i�ה�zh;
N����9�D���!��	*������>p�`�]��،��A޾l߻��o���,Y�<c��)؛6�+��
I^�4᎗�6~��#������ߛ����?��$��d���F5�E3 e�1k;�%�KS��*��ԡ��ʍG+&e����,�7���
@�=�Y�ܝ���P2��5��y��
ߩl�N�
�9dk�
+endstream
+endobj
+9709 0 obj <<
+/Type /Page
+/Contents 9710 0 R
+/Resources 9708 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9495 0 R
+/Annots [ 9694 0 R 9702 0 R 9703 0 R 9704 0 R 9705 0 R 9706 0 R 9707 0 R ]
+>> endobj
+9694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.892 649.545 300.957 660.449]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.152 593.375 391.217 604.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.086 351.22 422.655 362.124]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.486 351.22 511.506 362.124]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+9705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.086 197.669 422.655 208.573]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+9706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.486 197.669 511.506 208.573]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+9707 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9711 0 obj <<
+/D [9709 0 R /XYZ 89 770.89 null]
+>> endobj
+9712 0 obj <<
+/D [9709 0 R /XYZ 90 721.073 null]
+>> endobj
+9420 0 obj <<
+/D [9709 0 R /XYZ 90 704.201 null]
+>> endobj
+9713 0 obj <<
+/D [9709 0 R /XYZ 90 704.201 null]
+>> endobj
+9421 0 obj <<
+/D [9709 0 R /XYZ 459.302 652.698 null]
+>> endobj
+9714 0 obj <<
+/D [9709 0 R /XYZ 90 646.058 null]
+>> endobj
+9715 0 obj <<
+/D [9709 0 R /XYZ 90 567.846 null]
+>> endobj
+9502 0 obj <<
+/D [9709 0 R /XYZ 90 545.469 null]
+>> endobj
+9716 0 obj <<
+/D [9709 0 R /XYZ 90 545.469 null]
+>> endobj
+9717 0 obj <<
+/D [9709 0 R /XYZ 90 474.793 null]
+>> endobj
+9503 0 obj <<
+/D [9709 0 R /XYZ 90 440.123 null]
+>> endobj
+9718 0 obj <<
+/D [9709 0 R /XYZ 90 435.64 null]
+>> endobj
+9719 0 obj <<
+/D [9709 0 R /XYZ 90 321.242 null]
+>> endobj
+9587 0 obj <<
+/D [9709 0 R /XYZ 90 286.572 null]
+>> endobj
+9720 0 obj <<
+/D [9709 0 R /XYZ 90 282.089 null]
+>> endobj
+9721 0 obj <<
+/D [9709 0 R /XYZ 90 167.691 null]
+>> endobj
+9422 0 obj <<
+/D [9709 0 R /XYZ 90 133.657 null]
+>> endobj
+9722 0 obj <<
+/D [9709 0 R /XYZ 90 129.173 null]
+>> endobj
+9423 0 obj <<
+/D [9709 0 R /XYZ 389.246 77.486 null]
+>> endobj
+9708 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9728 0 obj <<
+/Length 2941      
+/Filter /FlateDecode
+>>
+stream
+xڵ[Ys�F~ׯ�ӆ���sz���J6�rl�8.-DB"jI@@;�_�=���&����鞯�����)����]��Y�� #���
3�3�
�Zd�g#��o�x���Yެ��7����˲X4��o�C�7/����rq����&�����
+<�a����}[<�5ѳ�� �0�f
��w�^�tw��V8#^
������p��ǿf1����u�)��*{w��ˆ
+{k/az�
�G"�7;đ3|���4̕r7�}�2�i�1l��H��f��:DSĔHtzs�(��5!3���PJ�b
+
(3�h��y}�g��#(�$g�h�4��&l}���)��5�OžLP$)�B
&`B$բ}��c�Z��I�ά�e:�\U[�U�=�O,���j6�g��g�go(׈Q���BF/��׆���êh����d|	��((�����{E#"M|����`�vD
%c_ʼn[��9_�,q_m�RJ����Wo���?E@�|��7ݲ�7�s1/�Ę
� Y6����׃o��+��-F	1CVIP�(�MN�;��T�	�V��ԏ���WauD\q���[^Z�O��xBxYC��� +�5F�#$�J%ؔŗ֛8�C(���K��ծ�
�p��.��V`_G��2<�-�Q
2[?��0�0O����
9�]�y	�m�n�T��В"��3�Mqh���7
��E����7�j~*��UQ,��=�(7���yW>���{���}`�y
+8���U�޽�
���~�� ��/Itl�-��'�)8�'�j�
� �
���a�G��7�(���8�4S�@)G ��
+g9��P����\�*�\�,��P�1"�L��
�<U�P��:ͨ����	T���Ú��l������H3��SϾ
��a��!\��^�G��4`���H����0�
�	�W�/�/�UYN�HL�����sx�g/#�@X�d�l"V#J�Q��n�.$�` �7��G��6��ˢ��
.�����������MWVO����
+��
�v��࿝M�'"�Q��� �;��A�j�y[�3�i��n�cant��9����ꦒw�!|q�m��*�o��X��ڍ���a�`ƺ�%�
$W+��d��]��]{{�%�C�V��_>:���t�<G͊�'��ۑ�E�@�)T1��!�&���ėb
l�b���lq
+g`����ы^��+�m`:�=F��TE�
��
�k��/l#�dL	B�w��yH
��F�d{�
\4�3�@�]&�!��1����-�ļ �H_�^ޅ��H
�L�����
���456E8��O͋gYA���˷�� nC=Z
rE+=R�I��"&L�ű����,�T,�+����D���5B�"{�I�7q�3+F 	��3�nq{
��!%�W��
�����f
��AsP
��Ig
+�A�Y�Se�~�TǦ��/��ҙ�-��n��6�S:+
}!�
��jQ�Z�_���.Kh%�oR� O@��	�GW4q�<�P�'��M��z�U�
��>
�_?�!��w�:��p�l< ��+
ޞ ��/���<YW�>5ަ���Y��)�[�Ι�m��sKF07Ə37�R�z�b �*U�L�&�$*X�&!�OT8��Q!'Q���OU葷E��l
$�a|��0I<;D�
��$͝��R��3�A�w�J-J��Q�
�J�OC�/��G��!)��߈�0�]:3%~���C,�
�'���x���M9�ȀS�J��4a@��=���=�"Sl!���
(�s��p&����=��6Il�]t�̓��a�a)�0�a5ç�� �
+�^Z��v�u:��/��:����hp�a5�z`9	��D�^0�[bH'0x�$6`�!���!�(�ai��L1���dxKS�`|��0�p��Ԝ 4l��A��~MG ���wg�/�u!��,���5����_C[F��\�S��)Z>����b]�^����8���m��T��w�S���	���#q�8u[۞��� �(Ȳ�NO���2�-���#����h��.���y�)`�TUw��;�T��Y	N����Ȭ0��	��ːYB�1N� �
�Y���)T��\P�S΂f���IT�i�MT8	�
):��6gTx`_�i[2.)�bXI��tX���|��:�Ƚf�s�r�%��i3���X5�bD�@-�xM~*D
I7aP�ͨr� *�y�x��O�N���'�
`m�� �"fہc�k�i}��%�yu��l��q���u���߇�U
� �e����V��x�Vm�]�m?�m��8gƛ�~P�#d���q|
+�5P
{�Pv)�k�$�
�Dyȣ&P��� �K48�5F%�P��Z%Q��G�f����
�)���$�5�{t�
�d��
��۲�u�x�j��#1=�S�g��lC3�
+Ƽ��p��lE)iΫ>3�i�
���fz,
>)?��.�]XX���s���@r�-;�/ۑXB5�&5Ź��Aw͏�o
vM���<7E
�w��jۙ
+w�#������j�z�X�,@�~0vY�md&��
]����
+$B�W���W��g�y��
��
��s]V�5��2b�c]��!
X�T�
+�‚�Vq/�g�t+Ŧ [�j�����/��Vx����f�]JK�J�@�Į�=����T�����fՕϾ�X��d�z�l�iBr�f��}��~I3)x���ES��2vF
𭘌yYq�r���ś�X���!���W2&��Z�[(W0�[
ۿ��ڲ^-Ƣw܊ú9 �:�����$�S��R�x���0��z�y��W[4��&���y�������(ͮ�
v�����]��������?����Ա2�
3/����ի����'4c��Ro.a�e�[���cN\V�p�[���۪,��g���j��~`0*uo��ݏ�����/k��X�"�10���-
+endstream
+endobj
+9727 0 obj <<
+/Type /Page
+/Contents 9728 0 R
+/Resources 9726 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9740 0 R
+/Annots [ 9723 0 R 9724 0 R 9725 0 R ]
+>> endobj
+9723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.907 626.69 435.73 637.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+9724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.507 178.678 236.499 189.582]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_aba6b40a4b9708e94d6cd10f54144ed70) >>
+>> endobj
+9725 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9729 0 obj <<
+/D [9727 0 R /XYZ 89 770.89 null]
+>> endobj
+9730 0 obj <<
+/D [9727 0 R /XYZ 90 721.073 null]
+>> endobj
+9424 0 obj <<
+/D [9727 0 R /XYZ 462.17 629.844 null]
+>> endobj
+9731 0 obj <<
+/D [9727 0 R /XYZ 90 623.204 null]
+>> endobj
+9496 0 obj <<
+/D [9727 0 R /XYZ 158.014 561.718 null]
+>> endobj
+9732 0 obj <<
+/D [9727 0 R /XYZ 90 555.078 null]
+>> endobj
+9733 0 obj <<
+/D [9727 0 R /XYZ 90 486.374 null]
+>> endobj
+9497 0 obj <<
+/D [9727 0 R /XYZ 90 451.704 null]
+>> endobj
+9734 0 obj <<
+/D [9727 0 R /XYZ 90 447.221 null]
+>> endobj
+9735 0 obj <<
+/D [9727 0 R /XYZ 90 376.361 null]
+>> endobj
+9498 0 obj <<
+/D [9727 0 R /XYZ 90 329.42 null]
+>> endobj
+9736 0 obj <<
+/D [9727 0 R /XYZ 90 324.937 null]
+>> endobj
+9499 0 obj <<
+/D [9727 0 R /XYZ 351.108 255.626 null]
+>> endobj
+9737 0 obj <<
+/D [9727 0 R /XYZ 90 248.986 null]
+>> endobj
+9500 0 obj <<
+/D [9727 0 R /XYZ 462.877 181.831 null]
+>> endobj
+9738 0 obj <<
+/D [9727 0 R /XYZ 90 175.191 null]
+>> endobj
+9501 0 obj <<
+/D [9727 0 R /XYZ 220.39 84.126 null]
+>> endobj
+9739 0 obj <<
+/D [9727 0 R /XYZ 90 77.486 null]
+>> endobj
+9726 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9746 0 obj <<
+/Length 1987      
+/Filter /FlateDecode
+>>
+stream
+x��ZYo�F~ׯ`_Z
+�ֻ;{Qhz�A۴Mc�)
Ƣm��PT
��������.R�0`��ݙٹ��%)�һ�<Q{���G����+���
��E@�§�����o��@�����~����o�W��ѳ���ß��J�h��,F��Po��?#c��PLZx�^�����HVH�-�#���%� ��'�R�s��l<�<�_ڧ0[���1É���4�''�		webw(�#��1p?����Y搀sICH��!�v%x���l<1��t�<C��J�BDT'��#��(��0O��t��
1F
�
#F��Y�!^�Y�	QI�!��4���R~G�C(��"B(��`:B�Y���&MV.��z�Z�U�{ݎ�eQrY�����5 E8�~����R���n
b܉:�Q����&؈
F8o&���y�Do�M�)��R�M�*  �C�FM��*�WhDI��>*of�K�6/��%d�RC��H�!�@-�zN~��9
����j'���b���2s�$Ѝ0���n��R�q Ti�	zSe�go�e
�u	�]IIߒ�N�ʦg�7=`����$lO�"��.�*��exe�$�
��8���+"Y��nP)CLt
��@&yi�U>�N�d,��y<{�I��^����
�b�br��L�|{� ��U{�ڍݝ^�g��Ç�
����Pl�(�����Y�~�J�ܢ�q�~�G��5ҠAt̓5��vi���Uu�!0άz��Kf�ͫh
�Q�p�Nnl�)�~Lo
+����ĆC�S�[�*�Eफ<��EI���.�2�F��D����o�q@�DZ���(���z|��W_�8 X�fJ�[�t���z����6���n��)�!vwBC��Yi��
�Ь�h].�}�/�y�ŵ����n��.��^�*荿��C�,�
+[�*:�U�a=c��!]7�����c�bٚ��i^j����ڃ�y�
�
s�r�`R�
�z
�'�����.*�
Tlmx��2[���Ia�$��]�0��պ�D#.�,\Dy���LL���jͫh�����f���?
+;���S4;�?�$%���
+�i�߇.`�ߖ�)�'/�� ����ń�
��FQVEV�/d����wO
C[���J#o��
���y�<Vl�vK
+���4N��"���D���纖���BQO�[��[u��.M��R��o7lUT}UòԴIzp����,�i��'p7���u��*��Y�4,�E[T��::܏�V�H�i2�E
;MPG�f��D���ч�Σ�������b�>SY���hP����	р	G?I����@��ɑ ���	I�BHhCh�
	NQ
+�1�ݽ�*{[
�m�1�{[�QY������\�o�n������8"B��鹦����2r�y��ǞX��s
S��Iy�Ż'���LU.vBf��w�U�����YL�giQ�4�??H<dO@6G�Φ�&�S
DD;����ǚP�Y�n(���GRW{\���U
��Z�
27	�.
���>����,�)��걷͌���<Z�DIvb[�	0���E�Z
�
��
��]�rg�gl �̄�q�6�
+�
��̠�d
�̓w��=ު�`�ZG�^�3�
+��'@���� �v��l%z�{zh�j͙�9�`��a�E=��h�s&m觜5���@M������2���[8K�X�@ z
+à�.�jZ��`�9Hl6"��
�C�C��B��d��m��F���A��X��a�
����/p���nc�Ш��K��Ȋ2]Ԓ��q_�X��.~Z��c��Zr�7i	�`�RJWXڠi�9���=/_�(o�\E�W�����_�d
��{�U�Lb�\5'���e�l� �澊�J��l7��2*l�!��D�nx�����Ż�
��
�I�mb�;Yھ����LZ�Y��8��E�N�.������
+endstream
+endobj
+9745 0 obj <<
+/Type /Page
+/Contents 9746 0 R
+/Resources 9744 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9740 0 R
+/Annots [ 9741 0 R 9742 0 R 9743 0 R ]
+>> endobj
+9741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.558 437.238 329.2 448.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) >>
+>> endobj
+9742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.558 393.023 330.884 403.927]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) >>
+>> endobj
+9743 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9747 0 obj <<
+/D [9745 0 R /XYZ 89 770.89 null]
+>> endobj
+9748 0 obj <<
+/D [9745 0 R /XYZ 90 657.874 null]
+>> endobj
+9749 0 obj <<
+/D [9745 0 R /XYZ 90 597.185 null]
+>> endobj
+9588 0 obj <<
+/D [9745 0 R /XYZ 90 568.369 null]
+>> endobj
+9750 0 obj <<
+/D [9745 0 R /XYZ 90 568.369 null]
+>> endobj
+9589 0 obj <<
+/D [9745 0 R /XYZ 90 526.665 null]
+>> endobj
+9751 0 obj <<
+/D [9745 0 R /XYZ 90 522.182 null]
+>> endobj
+9590 0 obj <<
+/D [9745 0 R /XYZ 90 482.45 null]
+>> endobj
+9752 0 obj <<
+/D [9745 0 R /XYZ 90 477.967 null]
+>> endobj
+9646 0 obj <<
+/D [9745 0 R /XYZ 90 438.235 null]
+>> endobj
+9753 0 obj <<
+/D [9745 0 R /XYZ 90 433.752 null]
+>> endobj
+9647 0 obj <<
+/D [9745 0 R /XYZ 90 394.02 null]
+>> endobj
+9754 0 obj <<
+/D [9745 0 R /XYZ 90 389.536 null]
+>> endobj
+9648 0 obj <<
+/D [9745 0 R /XYZ 90 349.805 null]
+>> endobj
+9755 0 obj <<
+/D [9745 0 R /XYZ 90 345.321 null]
+>> endobj
+9649 0 obj <<
+/D [9745 0 R /XYZ 90 305.589 null]
+>> endobj
+9756 0 obj <<
+/D [9745 0 R /XYZ 90 301.106 null]
+>> endobj
+9757 0 obj <<
+/D [9745 0 R /XYZ 90 244.936 null]
+>> endobj
+9758 0 obj <<
+/D [9745 0 R /XYZ 90 222.888 null]
+>> endobj
+9650 0 obj <<
+/D [9745 0 R /XYZ 90 200.781 null]
+>> endobj
+9759 0 obj <<
+/D [9745 0 R /XYZ 90 200.781 null]
+>> endobj
+9651 0 obj <<
+/D [9745 0 R /XYZ 90 167.719 null]
+>> endobj
+9760 0 obj <<
+/D [9745 0 R /XYZ 90 167.719 null]
+>> endobj
+9761 0 obj <<
+/D [9745 0 R /XYZ 90 132.655 null]
+>> endobj
+9762 0 obj <<
+/D [9745 0 R /XYZ 90 110.548 null]
+>> endobj
+9652 0 obj <<
+/D [9745 0 R /XYZ 90 77.486 null]
+>> endobj
+9763 0 obj <<
+/D [9745 0 R /XYZ 90 77.486 null]
+>> endobj
+9744 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9787 0 obj <<
+/Length 2028      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�~��P`*c��"�S`vn���"��O�A�ش�֖��<Y���(ɢ,;���ȃ(�<<��
~�ƈro�a��4�f�n%�B
+*���bO!�ަޭO0��pD0���`?�V���b?]nz�Ew���,ʶ��,��}҉΢"�y�W���������LgC�|�L�p$
�ï7?
>~�
{��‘T�d5����)|�	l`��
�I+/�
�K�z�� ;F�ƅ�c
!���m
qD�w��B\J]Nu-��
ђ!�H=}���T�1�ԁ��U�*l�ڷ�2���9�4N�����9
�D��I��E�y\!�X���8�Qv����
L��i�c�
+�E��BT�ň��
� ��#hD�B�
9��ߥz�c:�uR��
����.�)�#`	��E��,��|<n|�	��TkNܞ2@�`����
���2-z\�H
j�N_�D��0��\�:��ΨhB�)��5��F�61h�jg��Li��m��Q��_K/���M�=D at t%�0 7c�IQ~����c)*�� 1)
�I1�PFà�AT;G)U6G���U�N�g�0|,�/A
 E�FPv"(�A�=Zd1���';��bJAT� �N %��,��"���E�!���*
n
Eo�u�E�>�
 �8�%3��F̄�
+���*��WY1�oC�)��̬|H�����Yh�d�Y<�4���@uf\�yK�����V�)��N+�a	���U�~֫{`}eD�GET���f�F�
�0� �H%�P
+�خ�
J ��?nbtipeoO����h�q �:�H��Zo�(PleK�{T�R(uB|������+n��
H�P�A�0
����zm�=�,��zXp
 ��\pt� 6-��1G�7=`� ��W5Pחo��?�
xN�V��F��ͺ���70��T���B۶j_M�or=��Y��A�����ŭA9zF�c(N&�9
�UV��ڕ�oQ`�q�*O��@*�M��5o�ɚm&E�>�;J�vP��Y@�<���N��z��BW"��?զ�';�����&|Kg�Ii��$Z�M�j�u����xm����Y,�Ž��Y5�q2��"N�8_D��*��,]�K�Oͦ��ܦ

�4�@Og� ]|L�Z낢X�zLv}�C��W/s
�N�z���2-�V�O��K=v0���7
r�X�J�;�vġ���K�X���Ѻ��p��� �S����JN8�g(�
(	�2F 
J�Տ�
D`@�3��!�zr)ǐ
�Q��X�a��RN�]����A�Wutp� [...]
�w�n���t�WQ0���+/eV��B�V�ݺ�*K�I�,�:�SW��!�ˤ�ʃ���d��6��� �6m��zdA�
�eNG�H�����Pn�O
Y��@�Q�g�B�?����N�Iw[|�?
,�y���rJY�L}�����
+���("ۏ#��9Q)�6������~T�15�ޢ'E�,1�n$�{}�
�034�q���
���'�m��q�LL	?��{�m����	�-���U�n�sw�go�ݕ�
0�;�쭻�����3�c��x8b�۽�����iu�E
�j]l���X��Z;����h vח�h���
+z5}\ğ�Zk�G�c���ٴ��(�8iXI�,��Y�K�R��
Q�T�y�3���hw��
�e�nq@�����@���]�]��0��"�'e�;�qJ/4���w`n
�ؒ��80�O�����W�|/t%�yy8�ٌ��}
+�ߥ��ީT�]�a5HvV��[]�G�܋
<���/��E�̪Ug+�?U���#�}�'�� ��� c�g������8�ҵ��濂��s���
�$eO����������@"
�΅���g;�g���9�+��Q���/���LU�Y��KD ���
Y�v��c�*�o�
�cP�A�*,�ߝ׋�X�/.�7sH�9���}��l&.�7�#�4��=
|\���Y��c�y����߀�c"����5.�Y/�>\��b����k���U-�
+endstream
+endobj
+9786 0 obj <<
+/Type /Page
+/Contents 9787 0 R
+/Resources 9785 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9740 0 R
+/Annots [ 9764 0 R 9765 0 R 9766 0 R 9767 0 R 9768 0 R 9769 0 R 9770 0 R 9771 0 R 9772 0 R 9773 0 R 9774 0 R 9775 0 R 9776 0 R 9777 0 R 9778 0 R 9779 0 R 9780 0 R 9781 0 R 9784 0 R ]
+>> endobj
+9764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 297.856 192.544 307.784]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+9765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 226.982 213.297 237.886]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.112 226.982 278.87 237.886]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 199.047 213.297 209.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab289fda31b27c62873b4542280a90719) >>
+>> endobj
+9768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.634 199.047 305.699 209.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.911 199.047 385.668 209.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 171.111 213.297 182.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aca9c22c405ba1378296cc85f850aff21) >>
+>> endobj
+9771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.112 171.111 282.755 182.015]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.737 171.111 365.494 182.015]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 143.176 213.297 154.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a998804f094e131a7f06d05c6e9eb5f5c) >>
+>> endobj
+9774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.634 143.176 340.02 154.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 130.204 213.297 141.108]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_af1afb697fed68cd53ff8d90b1d7cbc28) >>
+>> endobj
+9776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.634 130.204 340.02 141.108]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.107 130.204 423.865 141.108]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.269 221.045 113.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8f29bc3aa01b8f5c67a3323189f9cf9e) >>
+>> endobj
+9779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 213.297 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.036 74.333 264.843 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8a0c95f43fd48c07a63db5efa3564769) >>
+>> endobj
+9781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.18 74.333 391.566 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9784 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9788 0 obj <<
+/D [9786 0 R /XYZ 89 770.89 null]
+>> endobj
+9789 0 obj <<
+/D [9786 0 R /XYZ 90 692.575 null]
+>> endobj
+9790 0 obj <<
+/D [9786 0 R /XYZ 90 670.402 null]
+>> endobj
+9791 0 obj <<
+/D [9786 0 R /XYZ 90 637.406 null]
+>> endobj
+9792 0 obj <<
+/D [9786 0 R /XYZ 90 614.297 null]
+>> endobj
+9419 0 obj <<
+/D [9786 0 R /XYZ 90 591.852 null]
+>> endobj
+9793 0 obj <<
+/D [9786 0 R /XYZ 90 591.852 null]
+>> endobj
+1864 0 obj <<
+/D [9786 0 R /XYZ 90 421.035 null]
+>> endobj
+350 0 obj <<
+/D [9786 0 R /XYZ 90 414.409 null]
+>> endobj
+9794 0 obj <<
+/D [9786 0 R /XYZ 90 315.809 null]
+>> endobj
+9795 0 obj <<
+/D [9786 0 R /XYZ 90 245.996 null]
+>> endobj
+9796 0 obj <<
+/D [9786 0 R /XYZ 90 245.996 null]
+>> endobj
+9797 0 obj <<
+/D [9786 0 R /XYZ 90 216.326 null]
+>> endobj
+9798 0 obj <<
+/D [9786 0 R /XYZ 90 188.391 null]
+>> endobj
+9799 0 obj <<
+/D [9786 0 R /XYZ 90 147.161 null]
+>> endobj
+9800 0 obj <<
+/D [9786 0 R /XYZ 90 119.548 null]
+>> endobj
+9801 0 obj <<
+/D [9786 0 R /XYZ 90 93.339 null]
+>> endobj
+9785 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9850 0 obj <<
+/Length 1913      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�J3
�A���n�q�&��NIFCS�̉�A�U}�_� JV(ۙ��#Y���[�.�����W��.'p�p�kS۸�6\lp�Ĕ���ǡ�����׆i;��6�U�|�����w���������G� J C�1�p��36���k#�u��bPhXԄϹq1�k�K]�?
�\�p at 7��u#�E�18!���
)�Y�(�)��8鈰����I�V2O��qk�cJ�mQcL(�6U"?Q�V^R�Jg��_
��c���\$��0��q���\�t�;�O�a�#jA~
�lMt����K�e�Zʹ�i$���F�"i:2��6��/Q�nʠ���`7�
�i!n���	cS�Z��B6�՘�&��X� �a;�(M�mDA�`Z>�bl)��~�*�
�
+��!:��G���X
M���Ӷs�w���L��
*�]�w� 1r(a�0U�
�l���#����aL3{ʼn��߄�ǛF_�UD�<�A4�Q�q��&��:��ğ搸ՠ
��s{$�?^�	�]�`a<"�uK<��|������1PϮӑņq���Rf�
�E%A ~�‚�K
�5������> "	�cm:l�*
��W�M
+{h=�}�g���%#0�&,�
��C��&���UA!Yn!�Ch&v��Z�L3-CfMԧ�R}[�"�N-�+���s��l�H�����I

���I�n۾{��ZO��>~�����,J�Z
�g�}H׼�2�w��!��'*�k�P�tĎ�4�t��&T�V핺���
�_�
9x��*���
!�$[�SF�1��1Y�b�;���U�8q4_�vԸ
�KW�
����q��Eq���@�Q(C�C���I�i����_�\�Yp�:���!�m�����f%�
��^>*�!�t3mZ�����K^*�g�
$��
6]��
+K!���],ĹY�mi�(.u+���hlw���@�\�R=]6m�7�r���Q�Ofc2Ѯjg����q:�e�%
�YW���b�C��EM�xD��V>HGB�G�z��
�����bA��"*ң�h��K�P��<
{�J�]
�V3�Ū� �ǠJ�#�p��R�I�eʟ�
�$�
+�8*q��ma���J�������7��u��'���u�U^.{�l{�M��R޿GT�T@
�{�o�kw�����vǮ��A��}y��7G�7�ϛ"_�*���w���4�y൉%�,��̧�ع_�Ɠ~L��09���I!u�]�dZȱ�ޙ̦Ϟ�"MuN��]C�܄^\���
xT�:�b���@�d�~�,��,^y��D>��qdS�0��=��{�2�E
ܠGd�6�#s�CZ%R�-
�:BOS�%.�Ĺs
X4g��� 7��S�wO���������<�k�Z�l6�
����}mh���؛vR;�P��$�-̕��&�1�v��&5��
+�AdEj�jI="��8_�W*�(E�
���\-;�o7!q%���v���ڤNuZP<V�:,Λ5�@���~2����,L���[��U:>G�j�1p��IpW��y��w�M�����׋�S�B
����^{s��s4�k��l{0F��
G�[k�P@���?q�j;�3�5�w�hr�̎Wyw��
+MJ
`
���RKP��/��"	��DWK]d��,��S� ��C;)��[xݿ�H�����r8��yy3K�� ί0aǾ���6rX��É��W�%�<_^~���ŭ�h�'�HO��J��
��$Y�{XU�~K6�|���p�E�#�׋�0„sZ<l/
V�?�����{
�qc�7nw���Z
��\ZMZ���͇o՗��Hɷ͒azѢ
+���|��H��b�$N��N{!�X�t�R��&���V@��j�w�eɳ����
���p�@��E��]��qu��C�UP �M�%�
+endstream
+endobj
+9849 0 obj <<
+/Type /Page
+/Contents 9850 0 R
+/Resources 9848 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9740 0 R
+/Annots [ 9782 0 R 9783 0 R 9803 0 R 9804 0 R 9805 0 R 9806 0 R 9807 0 R 9808 0 R 9809 0 R 9810 0 R 9811 0 R 9812 0 R 9813 0 R 9814 0 R 9815 0 R 9816 0 R 9817 0 R 9818 0 R 9819 0 R 9820 0 R 9821 0 R 9822 0 R 9823 0 R 9824 0 R 9825 0 R 9826 0 R 9827 0 R 9828 0 R 9829 0 R 9830 0 R 9831 0 R 9832 0 R 9833 0 R 9834 0 R 9835 0 R 9836 0 R 9837 0 R 9838 0 R 9839 0 R 9840 0 R 9841 0 R 9842 0 R 9843 0 R 9844 0 R 9847 0 R ]
+>> endobj
+9782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.695 175.668 706.599]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 695.695 234.596 706.599]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4e6c82baa2eac91c07d9ae925b8d42b2) >>
+>> endobj
+9803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 669.179 208.395 680.083]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aefcc22cba81dc18bc3e25d399127f3f4) >>
+>> endobj
+9804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 669.179 273.968 680.083]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+9805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 642.663 179.554 653.567]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 642.663 250.666 653.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac485f37c083be7bc0238a3f5c6c112e3) >>
+>> endobj
+9807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 616.52 155.265 627.051]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a023dc725ab60578fb2161f06211fa023) >>
+>> endobj
+9808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 589.63 158.044 600.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a465d046e2570dea82e57ab6af9b179e9) >>
+>> endobj
+9809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.382 589.63 250.447 600.534]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 563.114 158.044 574.018]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f6d9240b4cf201eee98359c903c1918) >>
+>> endobj
+9811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.86 563.114 226.925 574.018]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.137 563.114 305.082 574.018]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+9813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 536.598 158.044 547.502]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a773be362898fec2d48f0948c89870cf6) >>
+>> endobj
+9814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.86 536.598 261.246 547.502]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.333 536.598 343.278 547.502]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+9816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 510.082 161.013 520.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a9e847f0bfafeac6438cecb2d2114e665) >>
+>> endobj
+9817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 483.566 170.687 494.47]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+9818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 483.566 195.165 494.47]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ace4c05e99016850c16c2bdaff5914afd) >>
+>> endobj
+9819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.442 469.635 226.112 479.54]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+9820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.148 458.676 227.817 468.581]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+9821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 446.464 170.687 456.995]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+9822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 446.464 187.563 456.995]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_abba3cc93433c6564ba34c1fdd360bde9) >>
+>> endobj
+9823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.482 432.159 271.151 442.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) >>
+>> endobj
+9824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 419.574 179.554 430.478]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 419.574 223.857 430.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aa09a1ddc7936a5377e838cb44610548e) >>
+>> endobj
+9826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 393.058 179.554 403.962]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 393.058 248.444 403.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac53b2bea17ae404e291cbcb7033dbaf2) >>
+>> endobj
+9828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.542 179.554 377.446]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 366.542 223.558 377.446]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a102ffa79248502b4998a70fba5f13d98) >>
+>> endobj
+9830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 340.026 178.727 350.93]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8cf170e729ac4e4576624d6ed7d4b44d) >>
+>> endobj
+9831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 313.51 182.044 324.414]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a494a5dcf815a292978b1864d2d7f77ae) >>
+>> endobj
+9832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.381 313.51 308.768 324.414]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 287.367 150.493 297.897]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a6a5f64baba3ae5704d9645db684434d3) >>
+>> endobj
+9834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 260.477 181.845 271.381]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac5764ede75697ec70757c5e208945ca2) >>
+>> endobj
+9835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 233.961 181.845 244.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) >>
+>> endobj
+9836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 207.445 154.727 218.349]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_adfc60b971ed974350d241482f15f46ac) >>
+>> endobj
+9837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 181.302 176.505 191.833]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a63fd965105d740ff7003037964ec7d10) >>
+>> endobj
+9838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 166.998 450.955 176.903]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) >>
+>> endobj
+9839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 143.454 191.718 154.357]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+9840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 143.454 288.852 154.357]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f0983add75d3a9c3663fbf925739212) >>
+>> endobj
+9841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 116.937 191.718 127.841]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+9842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 116.937 303.079 127.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4254da492e5eeb1c12d8d87b997cd229) >>
+>> endobj
+9843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 90.421 169.013 101.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a7d4c3ba6b9e9b575d07b2e87b69a24e3) >>
+>> endobj
+9844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 90.421 272.215 101.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9847 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9851 0 obj <<
+/D [9849 0 R /XYZ 89 770.89 null]
+>> endobj
+9852 0 obj <<
+/D [9849 0 R /XYZ 90 712.265 null]
+>> endobj
+9853 0 obj <<
+/D [9849 0 R /XYZ 90 685.749 null]
+>> endobj
+9854 0 obj <<
+/D [9849 0 R /XYZ 90 659.233 null]
+>> endobj
+9855 0 obj <<
+/D [9849 0 R /XYZ 90 632.717 null]
+>> endobj
+9856 0 obj <<
+/D [9849 0 R /XYZ 90 579.684 null]
+>> endobj
+9857 0 obj <<
+/D [9849 0 R /XYZ 90 553.168 null]
+>> endobj
+9858 0 obj <<
+/D [9849 0 R /XYZ 90 526.652 null]
+>> endobj
+9859 0 obj <<
+/D [9849 0 R /XYZ 90 500.136 null]
+>> endobj
+9860 0 obj <<
+/D [9849 0 R /XYZ 90 462.661 null]
+>> endobj
+9861 0 obj <<
+/D [9849 0 R /XYZ 90 436.145 null]
+>> endobj
+9862 0 obj <<
+/D [9849 0 R /XYZ 90 409.628 null]
+>> endobj
+9863 0 obj <<
+/D [9849 0 R /XYZ 90 383.112 null]
+>> endobj
+9864 0 obj <<
+/D [9849 0 R /XYZ 90 356.596 null]
+>> endobj
+9865 0 obj <<
+/D [9849 0 R /XYZ 90 330.08 null]
+>> endobj
+9866 0 obj <<
+/D [9849 0 R /XYZ 90 303.564 null]
+>> endobj
+9867 0 obj <<
+/D [9849 0 R /XYZ 90 277.047 null]
+>> endobj
+9868 0 obj <<
+/D [9849 0 R /XYZ 90 250.531 null]
+>> endobj
+9869 0 obj <<
+/D [9849 0 R /XYZ 90 224.015 null]
+>> endobj
+9870 0 obj <<
+/D [9849 0 R /XYZ 90 160.024 null]
+>> endobj
+9871 0 obj <<
+/D [9849 0 R /XYZ 90 133.507 null]
+>> endobj
+9872 0 obj <<
+/D [9849 0 R /XYZ 90 106.991 null]
+>> endobj
+9848 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F68 3017 0 R /F111 1509 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9901 0 obj <<
+/Length 2164      
+/Filter /FlateDecode
+>>
+stream
+x��Y�s��_���l#�7��ᚋo�&�{vۇ��a	)?�:��� IѲ2�M_2
	p��.~��D��C�w����N'#Y���ݽ�Q'	3��ʝ.�$
+����7
�.oJ���|����V�
_~/W
o����52_��hxW7�ۧ����#�~]�5��Žh<���Z
o�������o�.~�`�6�0���$��./>�H�
��s(	��y�B��<
���͢ďԫz����a��x��N�aq~���W^����(W�X�~��֝��V���
���1
L�b�I��f�����:��5�/��f�
x�e��rY���ٗ��NLV�̘�?.�
_�e?z:��H#
+�����I��8Tf�9q�;
�4N�Y�E�o*��n+<;�,���z�����> �c�;DՌ!k�J���
�F���d��5>I��M��?i�����e%;�
���
^���>��Z�������g3��
#��
�o��{�q:�"t�|.���N;���*~��Jz~[�}
+�d��O�S!��jS�Άj;H������i�U��k#��
+lS�i��ղ�f
�➎��$�/��Pȸ�O�Y�
+މ�T���BB�"�����3��}�b'o��ci����IɱY}����&/A1���ۮ
����;�<%uy͆�b4 ��0 at O�嗧
�����U��YJ��A2��Kq�iυ�"� 
�1����v{��

;�1�^�8/%��;�
�gG�
+=~�Z��-�����Z�:6��z$=�����~��m��  �^�ӌ��@P����� l��2���⼈���v�U���s���k��M
(aAdw�k�bf���$1�B�
�k�j�aV�ss�	Iac�ŗ�;���N�Ki�x���@����Ӱc$|8�����S����{��X�)���N
��
+�i�e at oE�n䮛
Os�7����܀I�f�2�[�
+ܽ7�!� s��Ob����z��o��ޟ��9ˇJP�F97����f�x��/
�
�̕D|�FO�/:يn�˜��+����]�Ȧ��%��غ#h���j!+�JCw�^�N4���$K�M�iM���a��ي�|�U+��Pwr0޴e�����
Ng��Ck1{��z��2$��w���K������[�Ӿ5�
���"�VC��v����^"� ;`s8u.�A�L���hx�t}R�6��|j�6���
�B����]c��Nl�Q�~����I�*�:����i�k���j!�]���q����xY��}.L�w�s!x�M��f7Mc�
+D����.��V�*M�j��&Uc��N5x����V	��y��ݮ��Sc��浇�����ky��\6Oo�
>-�FĈ5
��k(�7!��C��{D�FixJ�%M�� &A��Ԭ�<<V닩G^�
+{!�"�
�b_�|z�������|�Fjb�apTK�ф�R���H��XK
E7��J��wn�< �EQ��?�W�K�>&Y��
���*֠���"�(|T�����Sj2'�J)e��3;zTXS��L��0�[�o̖�J�κ�Z(��Qrgj]0p��	�
�
?ZW���2��g��\ўO8v b��Vr@�j��(��+?
�}:�����k�e
�,ht���yӉVrM;�!�ǭҨiޝ��`����G����EN at b�*�+BsS7��G�q���4T��p
ӳ艂妝A�%�6+��T�T���6�V
FC�
/�(��� �/
�C�f�}

F(�4��
�] Lߨͥ)�I���|U��e*��k_�NZ9[)r#�UA�_�M#�]]�8H>��2m[稡f8�J��^ݵ�!] Px�`c�Qc���,�8Y_�w�%H��$q�*���ah��C�m�VQ
�;�2�����@-6�^���F!��ˡ92m�磩�)�A�q�M�9��ґ���T���׍��j|&8\~�ŀ��a\L��}����?����O�C:�!0�t�w��77ߛ��=��ť���=�R�B� �9�R��5"EJ
�q�V�8����ط��l1����Ҽ�����j�iE�!�<>�
lQ�ޣ�ƫ岶�WVЩXv]�3��%T?Ǿ�8�g(~�%F�7x��@���
��58����� ��C
+endstream
+endobj
+9900 0 obj <<
+/Type /Page
+/Contents 9901 0 R
+/Resources 9899 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9740 0 R
+/Annots [ 9845 0 R 9846 0 R 9875 0 R 9876 0 R 9877 0 R 9878 0 R 9879 0 R 9880 0 R 9881 0 R 9882 0 R 9883 0 R 9884 0 R 9885 0 R 9886 0 R 9887 0 R 9888 0 R 9889 0 R 9890 0 R 9891 0 R 9892 0 R 9893 0 R 9894 0 R 9895 0 R 9896 0 R 9897 0 R 9898 0 R ]
+>> endobj
+9845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 685.369 203.075 696.273]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+9846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 685.369 296.324 696.273]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8530a0719104225bd022dbe9529ae527) >>
+>> endobj
+9875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 670.825 367.019 680.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 658.001 194.297 668.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a62e7b71f72659356d1d732236ed5f330) >>
+>> endobj
+9877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 630.259 188.759 640.789]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a864a52992178820135a7ae3a75e65377) >>
+>> endobj
+9878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 590.188 213.297 601.092]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.036 590.188 286.103 601.092]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a90e26e60ccfbe3c6ab8d91b5bf06dab5) >>
+>> endobj
+9880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.965 575.645 419.427 585.55]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) >>
+>> endobj
+9881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 493.559 226.034 504.463]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8e247a33c9eb40439c706a98c5d363d0) >>
+>> endobj
+9882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 493.559 420.562 504.463]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 465.818 156.281 476.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) >>
+>> endobj
+9884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 465.818 259.483 476.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.695 465.818 377.081 476.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 438.076 180.54 448.98]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ae64d3d01d4baab5102f00046f941188f) >>
+>> endobj
+9887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 438.076 307.263 448.98]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.996 438.076 448.383 448.98]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 410.334 180.54 421.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ae64d3d01d4baab5102f00046f941188f) >>
+>> endobj
+9890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 410.334 307.263 421.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.996 410.334 448.383 421.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 397.46 156.281 408.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e) >>
+>> endobj
+9893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 397.46 259.483 408.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.695 397.46 377.081 408.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.243 323.36 281.629 334.264]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.609 311.405 202.675 322.309]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator) >>
+>> endobj
+9897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 128.83 196.58 136.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9898 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9902 0 obj <<
+/D [9900 0 R /XYZ 89 770.89 null]
+>> endobj
+9903 0 obj <<
+/D [9900 0 R /XYZ 90 704.201 null]
+>> endobj
+9904 0 obj <<
+/D [9900 0 R /XYZ 90 704.201 null]
+>> endobj
+9905 0 obj <<
+/D [9900 0 R /XYZ 90 674.81 null]
+>> endobj
+9906 0 obj <<
+/D [9900 0 R /XYZ 90 648.14 null]
+>> endobj
+9907 0 obj <<
+/D [9900 0 R /XYZ 90 620.398 null]
+>> endobj
+9908 0 obj <<
+/D [9900 0 R /XYZ 90 539.525 null]
+>> endobj
+9909 0 obj <<
+/D [9900 0 R /XYZ 90 383.955 null]
+>> endobj
+9899 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F111 1509 0 R /F75 562 0 R /F32 772 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9922 0 obj <<
+/Length 2171      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs����W�2	G� ��
�8.g�ˋ�NN*C
+	� hI��uφ����N�
�Yzz���^@l�8�����{)���1���M��@�)�bx˃�
�����'��1���������W�8v�����	�!0C "2	ֻ�׿� ��JD��z�.��g�����Z^�O�[�$�"A��D2H�c��mK��UM���)�?�uQ�7�x�	��`��f��?$,	���f��)]|a
f-�$���������p����$�b�
��X�ϋj��+
�E��\3/v�j��j�{�؁��ջ�+�YY�ڮ��C۩�K��]٩��,�%��E�5]�:���e���_�f;�R\�Q��V�T)�P8]��Zw
+4�	���]�Z���U�dmR�/���V�y�妑干M-lL$g��ʒr$��
�x(sGq�����vB�~��W�|��LoYTv|�5�EU���
}V���YEBIHCgv73�HH"�������J$)HI��IA�z��j���j�~�$C9�`e�S�J�p�G
Ύ��$��:5s��!�($f��
3�����H���Y��|�_ ��m���VPl��)�,G;��� <I?�M� �=���
ax���p+��Yv�����l�/�����nF,#a�0$EkjªW�<*��
+�,VA�
�P�yk�3|�E{
��3]��<��RM��M�4�j�u�{�hg���F]��m�v~��
+V:Y�Sh�[�`-h:�/�Z��u՛ٱ�D���v�:�v��=s4�δ���a�Ys뀽+�ͭw�����格jT	S�e��b�W
�T$
0:�`501!T��1�i$�=��@� <�͠�ƌ/:
��
`i0뱘1ڊψ	��w@F��"�J���Ą"pp�lt%Fr�H�c-Jw��:Y��¢��'=�0
	.��al�f����x6k�&�k�6���9����p�C�D/_8s����p���m{��'�,��ݩN5�2�1��&�G�O��s�O#��`0.���La�I�08�q�L��q�Ҁ
}#�w��(Kգ��k��0���_8������y���@c�
�7w ��U�zH�` ��4x�^C5�cw(�ˆ�� �3�I�-�Ӹ�
��)�F>ſ
7�G��7��
+.���Y��X��{&�V�j��c��L�5���,qf��:W��:�L��d�5&��.c���Z7	c������S����
+��)�������*��ū�Sf��[JF��ٕ:9�祝��>�P*HqMW]�1�řiV�̍�^�f������8m���ڡ��>$��:����W���D.y��49
�3p(
+�bPhL]�^������UN���+]1��Ikl�z7٦������g���/�!���E��L��q��
d?C���ʞ
���!�V�t�r�T�c.�����ݽ��p;
+�f�=���*��*(���~��'��4��ܰY�p���N��-{�c�U�9��ǁ���=�Q�"�PK���������/�3�'�'�8?����I~"M~"�	�u�.'����'8��4�#�&��!]���8w�:w�qQ>��5�Q1�(3�KDe�|E�8�g<%����� ��z���
	l�:��1���
2�-��L|M��fJ5��R�C뻏�,�D$�+e�#;R����Dّg�����b-"�,X�Cr�
j? ?�I���7�N9
+��Rm��&��L��	�
�1R
Kc�]dcR�cR=` �<�� w�hT�]w ����J���|Y�I��G$�Pco�
+A�&[ws�������=�%H[
�
9ܙ
�faCg 0Ԩ�)L����3�&��H���K<��U��&�ϲ�)���#�zs(�f�����"g�AK1�
|B���B�y�A�ϊ2�,!UҖ�C	���ڵU�kSl��a��`�'��m�
��R�ʕ��F'N_��]��M'b�靁�߆���/!E�<g�\~��LC�[�n=N5�_�c�$��5����o o�n)����a[�5����N��@�'�z����o (>�ǡI�"��m:��p�_~��4�F��2�V)?g��)
�j���x���|>AyL���\981���Y����O��0��U�ퟝ�^
����d]�=��@)�e��ƩpW�UE������7]�
+endstream
+endobj
+9921 0 obj <<
+/Type /Page
+/Contents 9922 0 R
+/Resources 9920 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9740 0 R
+/Annots [ 9913 0 R 9914 0 R 9915 0 R 9916 0 R 9917 0 R 9919 0 R ]
+>> endobj
+9913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 517.775 196.58 525.301]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 426.154 196.58 433.68]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 302.653 196.58 310.179]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 270.772 196.58 278.299]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 171.181 196.58 178.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) >>
+>> endobj
+9919 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9923 0 obj <<
+/D [9921 0 R /XYZ 89 770.89 null]
+>> endobj
+9920 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F7 803 0 R /F24 537 0 R /F32 772 0 R /F91 766 0 R /F1 834 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9928 0 obj <<
+/Length 2439      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�F��W�rp�*k<����W^;�:��=�.-�(Ԃ ���_�=��cH��mnU)
��~|����r�g�������+�f1�%���������k1��FB��	�8��
%�*���S
��ÝYT����J����R������#�4M3?�GyR���5՜��)<%D�2b��?}�����~;# �'�@J�����'<[��g�X���E��
���g�<�~OQa/�?�Øl�DȰA����EY�M�I�������/Mx�e�nV�h�&+�V�i�p�r�x
pC�W)�Jw �AL�3�%�~H
�:����c")bB�������3
+&�93�J at 1E��H@�@��P�6�s
�뼮�ńB K��$��Ma��u�s������0A������1�}�f�!�Naz&$"T�mC��S�
�"%�Զ!���>b���B�(�Age�¢s*9R�(�K*��p�I�o�^��D���kO�B�h�FD�݊e=E�#�T�d&^P1^��[t�yV�O,<{%�xkDsS�"`���_�EV �:�L˵���� LBDh~���;���S�{�֒�қ�
��U�h��z)���,�
ݻ�"��s""ϩ�X���_Uf]��G��^��?��{�x���f�Ifm
�$� ��Y���6E�|
��|�¿[.![��0Y��@@�B��[@YCҪ%�t|<(S��P��R�4��Ǡ��C8�BA
+��p��BX�S�f�H
x��p9+j�qDF�s
+�V\Ƚhc��
L�X� �>,?�&h@���66�
n���[o�F�Yє�
���&�s6��l�4��4w��@*���d
+���-�Y�:
x�PJ1�����@1T�~��n�ie�:+�[���Ǚ�
�:I��EPS�tں��,̢9�u@	�.�r�^ɷS�Cbf�d׈K�-�<��"��$���0U�
+и鄇
����Ƚ��t@�*<m<
�ߦ�>i��
�'�ѫk�o�"B��8�
�m]x�r�f���4X
 �U
�#z�������uD���a��]:Ꚑ��̏JEZ%�oME������TD at p~
+�|,c�G�"��'��vFB
IEJ���ME�FXw�(��,�`I��p�
�I
r��d����f��P����x*m1$h\�d��Z
����J�V~
��E�۪\M�Fb(��I�eC�:`%ы�o޸˝��Ym$��*��,ܯ���7�1��z�Y�-�V����V-�������8)<��4�$�*D	?q�#�{�b�R
�^I���GYB.�}��4���'s�W0о�G��.�֛45u}�ɟN�����$��(3:6p	i���j�ej۠2f�w���0־����Y�J�*��n������x�

+X�ߣ����/�r�m��]gQ�H�|�*�]�[�ǹ��cNy��Mj\��}a t�"k�$7�R(g(��,������a}d��n�P����]u�<���1Y�_��
�_�g�T��jd�_��) 
��kA�8's��_U�)Z��{Qxd|grP���i8�}g:�	��$�_�
W�$H��r�~�kh(��c
;�!t���K�h<x��)t��i_�d���t�tx�#c�H�Ĺ~l�#wۧ-�pP���U�Lx��m��[3�M��4>�:�
|8D�W�
��(�3�#�O15B�	�F�b9M�%�yPzk�պ�r ':���h ޜ��Z �#3�}���YS5�)㨅�+�+waD��}9s��Qخ�Q͊Nv�֣���A*"c;/�:1kA7�>n|���o?�;n
�� 
_)�yUmk��d=*�&��
�k��F���N�e0��O�{��֙�g�G6	�R�����c��x4½�����pu�5wST�Y�P|8EꓬE�Ioca;j�AX?��~��@��N8�z����1�S��x!D�)��}���{)�?
+)4�'�?��u���������L��F�G����X��R�� $�ͳ��cY��G�i �njO�+0�t�!�a[a�ej�W���f����"�\�X���n\��P\�����,F�gؙޖy�꿾k�'\r�<
� 4q�flG�!�GJ��'V�^���n9���<Q��R�ĩ�GH +��B�0qhHȐ�jgH8��H�8ؑ`�4��!1�V�4"P�� 
����'O͈A� 8'A1h�t(�E��p|�	��;�Ԏ
+n�*2U{��� � �
+��$s�}�oOQ-�1���Q
�;V?�
?d�ޙw�^��#Y��2�<��*�]������*����|�.�U��{+��_�b��]�	�7?|�!��+�-��y�{ө�	��Yw����q� �i�ϟ=��,kS,QZ�vm5�
����N٫��8
+��jA	un��R`�˴�(�7 LT�3�ot�>�^�7��Y����<�|�v�%
+endstream
+endobj
+9927 0 obj <<
+/Type /Page
+/Contents 9928 0 R
+/Resources 9926 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9941 0 R
+/Annots [ 9918 0 R 9924 0 R 9925 0 R ]
+>> endobj
+9918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.892 649.545 335.278 660.449]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System) >>
+>> endobj
+9924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.804 497.334 445.257 508.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) >>
+>> endobj
+9925 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9929 0 obj <<
+/D [9927 0 R /XYZ 89 770.89 null]
+>> endobj
+9930 0 obj <<
+/D [9927 0 R /XYZ 90 721.073 null]
+>> endobj
+9802 0 obj <<
+/D [9927 0 R /XYZ 90 704.201 null]
+>> endobj
+9931 0 obj <<
+/D [9927 0 R /XYZ 90 704.201 null]
+>> endobj
+9932 0 obj <<
+/D [9927 0 R /XYZ 90 636.206 null]
+>> endobj
+9873 0 obj <<
+/D [9927 0 R /XYZ 90 613.83 null]
+>> endobj
+9933 0 obj <<
+/D [9927 0 R /XYZ 90 613.83 null]
+>> endobj
+9874 0 obj <<
+/D [9927 0 R /XYZ 195.633 544.702 null]
+>> endobj
+9934 0 obj <<
+/D [9927 0 R /XYZ 90 538.062 null]
+>> endobj
+9935 0 obj <<
+/D [9927 0 R /XYZ 90 442.46 null]
+>> endobj
+9910 0 obj <<
+/D [9927 0 R /XYZ 90 420.084 null]
+>> endobj
+9936 0 obj <<
+/D [9927 0 R /XYZ 90 420.084 null]
+>> endobj
+9911 0 obj <<
+/D [9927 0 R /XYZ 121.143 339.001 null]
+>> endobj
+9937 0 obj <<
+/D [9927 0 R /XYZ 90 332.361 null]
+>> endobj
+9912 0 obj <<
+/D [9927 0 R /XYZ 90 292.63 null]
+>> endobj
+9938 0 obj <<
+/D [9927 0 R /XYZ 90 288.146 null]
+>> endobj
+9939 0 obj <<
+/D [9927 0 R /XYZ 90 231.976 null]
+>> endobj
+9940 0 obj <<
+/D [9927 0 R /XYZ 90 198.974 null]
+>> endobj
+1211 0 obj <<
+/D [9927 0 R /XYZ 90 126.705 null]
+>> endobj
+354 0 obj <<
+/D [9927 0 R /XYZ 90 119.295 null]
+>> endobj
+9926 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+9959 0 obj <<
+/Length 1456      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~��0��L�"�d0
X�fY�v^뽬)�Vb���J���
^$Y��8k��
3yx�߹`���ޏ�����B0O!�Л�x
+{"P�������3B��<JDT����/o�/����o������O�#� GBz����G�-a���Sһ3�6^@�����_G��
��B"ľ�M�.��e�ߜ^�n{�3$��c�;{�CK �>��k�Z
�a
ɐ�Ǿ7�aD�fQ��,��
%P@�7a�w�YGe�������^�x�>	Q��7�b���W���]�Äc�U�]T�Vuq�t�Μ�
���&��x��xX��(
@`�P��cC�ʪhm�Y1f�_�E�޺���^
+e����+��"����<��]�Ͷ�cᯓФ�o��®/��J���e�(vP�Z� ��������
������"�����)�2�EB|ԡ�nҐ
���G:sI %0ї$
+�&�x���\�
���Q��K
J!�R4�vy�F�؊1�
�p@��EՁ��2
+��@F�w�q�]�:���|u���Z�Z�5��xˆ6�&߂��XY�a`�n��lH��(i05w��e#ќ8�D�W��W|��[�
��Y�ޭ�e1@�����-�K�D�������
�
��t`�
+3� V7�7������[ڟZ�5��{/
+���1�����̛`5�'e]Vܸl����Eƿ5K
M��@�̔��n'i��ۺr��0$��0��hc�!lP��T��
�f
+�H�CwI�:-�E��8�MX��T������i��=/�d�x�<����p��A
ZT�
�"�� 
�	��
+/�*J��ҶC�cE��<�l��@R�Ngv
��sL����m�.NPO�æ�K�q�v�y\D:�qn��
�Bʛ�힗�衻�Ӿm�҈.%�v'g��*�l†��/�1˛B�.��ݘ�>���.
��=ciJhq�����'
�W
W6���&�*2��Z�yf���2vx��6Q�v�⸓`�T}J��۬�Oj�!�4�H��a�=�
��i�_D.WGk�[X]�
�P�
G����~Gː��
+
O��;a�1E]L

\|e��&N�� ºo�#��o�V�!8� �y
͈ !�#
����3��T���
�:2	x�Ia�x����5���(�"*��
+j������ �Hwv�]萃0D8O�A��
+�����3	�֥����i
���x�Ms��(!�T`�Z�
+��h�ڳ:��N
C��zJ���hr1�{���u���Jb*ai��+���7�HPv��w�b W��G�dBP�qm>�w���
�^d@�%7z������^r9
+��je6{m��q�Ncn��&J��4T{�C˲�A$/b�
��\�}\����S���vֽǓ�(��|aUU��tz��-����
�^V�!����m��	����1Hv`�� )���
+endstream
+endobj
+9958 0 obj <<
+/Type /Page
+/Contents 9959 0 R
+/Resources 9957 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9941 0 R
+/Annots [ 9942 0 R 9943 0 R 9944 0 R 9945 0 R 9946 0 R 9947 0 R 9948 0 R 9949 0 R 9950 0 R 9951 0 R 9952 0 R 9953 0 R 9954 0 R 9955 0 R 9956 0 R ]
+>> endobj
+9942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 648.739 177.053 659.643]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) >>
+>> endobj
+9943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 573.774 179.543 584.304]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a061c4c3b4f1eef970794b274dae62504) >>
+>> endobj
+9944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 531.194 179.543 542.098]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a5cca0390f76c0a92703e65d3707f157a) >>
+>> endobj
+9945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 500.943 179.543 511.847]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_ab8bee5e53740adc193668686030bb4bb) >>
+>> endobj
+9946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.881 500.943 254.811 511.847]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+9947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 470.692 179.543 481.596]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_aab939414cdbcf1ba174334859443a72c) >>
+>> endobj
+9948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.881 470.692 272.514 481.596]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+9949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 440.814 187.292 451.344]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a517f4965fd423413531cd1d2058748de) >>
+>> endobj
+9950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 410.189 163.215 421.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a7e6d252ce9557b9d73833ef594f6276b) >>
+>> endobj
+9951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.552 410.189 256.185 421.093]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+9952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 367.983 163.215 378.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a1e1a505b4cd4a4ac97d3a38864bd3977) >>
+>> endobj
+9953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 337.732 163.215 348.636]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate_a553c3b19a36235d228039a6bb3452918) >>
+>> endobj
+9954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.552 337.732 238.482 348.636]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+9955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.821 186.59 440.832 215.905]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+9956 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9960 0 obj <<
+/D [9958 0 R /XYZ 89 770.89 null]
+>> endobj
+9961 0 obj <<
+/D [9958 0 R /XYZ 90 668.826 null]
+>> endobj
+9962 0 obj <<
+/D [9958 0 R /XYZ 90 593.572 null]
+>> endobj
+9963 0 obj <<
+/D [9958 0 R /XYZ 90 593.572 null]
+>> endobj
+9964 0 obj <<
+/D [9958 0 R /XYZ 90 561.587 null]
+>> endobj
+9965 0 obj <<
+/D [9958 0 R /XYZ 90 519.38 null]
+>> endobj
+9966 0 obj <<
+/D [9958 0 R /XYZ 90 489.129 null]
+>> endobj
+9967 0 obj <<
+/D [9958 0 R /XYZ 90 458.878 null]
+>> endobj
+9968 0 obj <<
+/D [9958 0 R /XYZ 90 398.376 null]
+>> endobj
+9969 0 obj <<
+/D [9958 0 R /XYZ 90 356.17 null]
+>> endobj
+9970 0 obj <<
+/D [9958 0 R /XYZ 90 305.709 null]
+>> endobj
+9971 0 obj <<
+/D [9958 0 R /XYZ 90 170.366 null]
+>> endobj
+9972 0 obj <<
+/D [9958 0 R /XYZ 90 147.459 null]
+>> endobj
+9973 0 obj <<
+/D [9958 0 R /XYZ 90 147.459 null]
+>> endobj
+9957 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F39 2335 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+9982 0 obj <<
+/Length 1359      
+/Filter /FlateDecode
+>>
+stream
+x��W[o�6~����I���"���
ؚem�i�mmQ(ci�ŕ���;")Z�� 
+
�C �"���;�w�����_W?߬.����4�n�{"J���{�
� $c�: �O�:�t
P��C��.�����a�~Qo+U�fH��m��?����y�Y���M^�.)���*�{�|��`�H_5��-F��
>޼\�r���"�+���#!��^����
�_z�Dz��P�E����ޭެ�
�=��r|��2
^&����$2�Uîkz�̱��+�n�N���1s��m�{q%g'�
�	�a�>ƳJ$�|wj`|O��x��@�p����U�G}80���j�٘���y�j(�5��� L�t
���!�υ9e���Q�]���L_����P��wf�>����v���6�J����H�!�x��ÂC
%B�k��u�ߪl(��/ᾪ
F��2�!
�B����z��Ņ�E�4���1W��r(
Q�xD�M�4��h`2�S��a�=�
R��ν�/ʬ0˱~�
+��Ap�ќa^�w�X�̢*�rP�9���1���5羣�Lp�" ���pn��T����u�Wf�\$�e��ej���@1�Vn��y��
Ý؜����^���g�ե:
}�k�#w�ڪ21�fST��PQĤB��)����S�C���V�(̛��g�E�:��U&��lIh���	�����q�� �Q4C\
+G�
��0]ȵ-$����	���@1P��q��:,
�`�.��(v��] �c����
,A������u�u!��@��
+�O��Х�`�q���r����n��u�5M#ϖ>��
=Z �����l�j�+s��Ŕ3$��/�:��=H��0�ḑc?.�S��Vj=����a*���c��K�]�����)��'��zq6���O�!Ы�G
�FI<��34��a��G�k�r�i7.^����ľ93�L7��c��k�LT4&0�L=��hVef��Zշ��vM6f��(tP�N
؉>�N_�np��E�en��t�[}e<5��Ȓ!J��؆ _m����8
S���H�<EqdP����e�������
"l��l�:[
a@��
��h�b�b�
���7k���
K��3��a
+8H�� M��/W�N�l��"@����RŒ��CL��9�jH�JK&��R�YWn��>R lIS�7��h2���{V;�YS$`^x��2�CP�=��D$��麾~e����6�ܷ�x�6s#�M���e� ��
э`V�$�S����v���J
��
"`��Ns�aخ/.nw�^�|�A�O�7��,\����mg�*ج5�4�L��x�|:e�J&B�%b�>#'
+�$?�`
+endstream
+endobj
+9981 0 obj <<
+/Type /Page
+/Contents 9982 0 R
+/Resources 9980 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9941 0 R
+/Group 9975 0 R
+/Annots [ 9976 0 R 9977 0 R 9979 0 R ]
+>> endobj
+9974 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 9988 0 R
+/BBox [0 0 404 212]
+/Group 9975 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 9989 0 R>>
+>>
+/Length 647
+/Filter /FlateDecode
+>>
+stream
+x��UKk1��W�XeFoA��P
+�
�z98~�������^�MjJ(�I4������l ���0�#x������pW+������
������7u}�6�> [�
��,�3�g����K-��28=�)�{s1�4�d"�dfT��f�b�U�-,�*�s���K@�`�WW��
˝�~��TB�Ӕ�9!l�VNW��Ks��?D&�T��`�pr]u��S�gV��ܔ�Vc��8��Tn��"i'lNo3���8̜ ,~�Q�
Gg�8[���Ȍ�d����-ީ]�<E��^z*����M��̆���F��%
�;z�)����
寸����� ��+
%�0q�5:�����f�й�%]jLy�_��7�e��[��Um�A��%�!�F�2Pb���Uc�*M�9���u/A�6
�I
,�'~���X'�m"�fY��A���L:�x��Y���S�ㅁ:�����c\��q�yI��n
��v"C�A�!Qx
�{J�b�h�� a
\�o��Lk�cP��1��8j��es&��|
2/|�p�I��?ΚT�ݵ{�G���:H�.Ƴa��䵵��*�,K	|Q�L����0�c��6>��V
d�w�r��F_�,�eF�1��c����~OZ

+endstream
+endobj
+9988 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+9989 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /NJRFXQ+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 9990 0 R]
+/ToUnicode 9991 0 R
+>>
+endobj
+9990 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /NJRFXQ+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 9992 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 611 584 278 667 500 278 584 556]]
+>>
+endobj
+9991 0 obj
+<<
+/Length 9993 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š�:"���E/��br�j
�Y�����*(|�K�GN|i_Z=�,����heè��e�[I���#�25�5���I�(v�ݶ�4�z���f�
.����Y�==E����*�������ï�n�M�W�DM�
�ݫ0ob"��c�\|\��+����
��3�HrV�!�
+}��N�ӰzpO�V��Y(�y֧s��$E�xJ=�
�y�RP���@%b�*����
:#v	P�A9Hz�C�X�B�0��)�x�:dr�U����@��q�~e
+~!�

~y	�_��9��p:�rL��W���:�eaN�U���pw�����
y��-�_W�-����
mf�W��ܣ��
+endstream
+endobj
+9992 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NJRFXQ+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 9994 0 R
+>>
+endobj
+9993 0 obj
+356
+endobj
+9994 0 obj
+<<
+/Length 9995 0 R
+/Filter /FlateDecode
+/Length1 2672
+>>
+stream
+x�UV
L[�>�������e
�׏����e0N�����	C���	$M�l��)jC��i�nٖM�ԭ�ZiӴfڴ)�6MS'���R��ljR�n�"���kH2����������JI%-��ڃ��
�}�B�氺�������<���zt"2�/�_���{XsF���S�^�4;��V�������!_�
+�&�����
�	��/ƙ��q�B�����̤1
0��A'����Fy'��� �A
#��TUTc֘lz�hs�-U�M��
�֙�R��6���:S��K7�J�Sς�1�#��
�H*���S���N�����R���)��D��b.Q�jm�F����ݪ��qkz�Y_Q�
��F�3���
���,����A�@�Dw������]�Yɚ��*zC
KAnNvjF�R����TXk���v��9jk��/7lچ9�
+pJ��h3Pw(�-m���/Y���=�
���g��=&x�)�=�-��C{o��
�.�w��ĝbgr`��
��R_�����{�w�f�������ą(���n\]�و�cib�J8?�Ź:�]��P�����Bs�O��-.���v��>f\��3�i�ro���pd�뢄G�
��՗B<���;]�B?Av�8����7S���g�*�E�FM^af��c�s3�|*C~�eIQ�ĉ~]Z�p5[Xї�*[��`�owρ �v�F�_ي����V��kr��W
) �̤7���Ee��ǠW����Ψ�D�U�Is(�����gc��t�Zh��yߝ�
+���'�){���U�R���x�ϻ�3�a����;��o�(`�T�v��9=}br��'�
/ﮪW��xq/͖�熆�C�8�G�1z�
[�`���F�zl8������W�j���̎W�A$��:S05���	
2!�Ery�i���1/�ڇ1w�LENF��}�aX��� ����
�μ1�F?����%u�����g�s����^��������q=� 7�M�dL�d@�<4J�M��3��'&"-/�&�����¯�]����=bS2_���u���J2��
��Z��h�U�wKG�t�n�7؟�X#�̫�h�
���@LE�(H������]��� S{�W�)�U����
zBo�G�T�9������:y�ۓ?�>���������Y��W�
��oc�I͛Y���r.��Bi-vO��;-����Ӌ�
�谫>>6rh���Sg.�%�S��[��|��n��F���e1�-E0�#}4?�
>yb|�����Ѯ���dz�CMf��������
O�9�#u�&��u�F��jz{6<��Œ1���?�I.W��ʥ�FF�S�
���W�~�
�o�|z2G���{w��!2�I�}k�����3=����q�2a��;F����w}o]���˵(�"T<2
+$[!t���b�����5Q��,~,��Y�8h�M�7/�t�Zͮ&����߇�������c���U�*{�
�}nG	buؖŽB�����N'�ْ
^-�Ʉ~Z���,U���ٟ��ŤذS
�ۏ
���\㲖�dh�mM]���PUi�Y��z���$��O��/H���DAgv�/��jʜ�]x���G�؀�1��+u0�d����-�����B�jy�n6+)�����z�P(n��^�w�
ҋ�Lhe2�|BO��l')�
�)|�^Q"��$���*�-����|
+��
+�#
��@����B�r�7-t
�%�!������GT�Hr�nw�G��d��U�������5�?,U)?O��F�l��X��H��?�Q��|s�ᯘ��
����&;h/�*ܤ�U'�/%�]':<c�T��@��bvR=���g.��,��D�=E�
�H�
$���X��>�+�s?�l�qo���b3���C/��q�A��a�7�M
+�
+��W@�A�>e7��lJ�@�	��U- �V�ߤu�
ѧS!�z���c��{��G�
���M�H�� ��;2
+endstream
+endobj
+9995 0 obj
+2009
+endobj
+9975 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+9976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 233.27 176.027 243.801]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_a3690915d5c30a08607ade652aa157cd3) >>
+>> endobj
+9977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 201.254 184.244 211.784]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_add9a15bae9fb3c788a0ae526ef65733d) >>
+>> endobj
+9979 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+9983 0 obj <<
+/D [9981 0 R /XYZ 89 770.89 null]
+>> endobj
+1865 0 obj <<
+/D [9981 0 R /XYZ 90 595.808 null]
+>> endobj
+358 0 obj <<
+/D [9981 0 R /XYZ 90 586.632 null]
+>> endobj
+9984 0 obj <<
+/D [9981 0 R /XYZ 90 253.951 null]
+>> endobj
+9985 0 obj <<
+/D [9981 0 R /XYZ 90 253.951 null]
+>> endobj
+9986 0 obj <<
+/D [9981 0 R /XYZ 90 220.201 null]
+>> endobj
+9987 0 obj <<
+/D [9981 0 R /XYZ 90 167.715 null]
+>> endobj
+1866 0 obj <<
+/D [9981 0 R /XYZ 90 67.456 null]
+>> endobj
+9980 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F24 537 0 R /F8 802 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R >>
+/XObject << /Im13 9974 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+10005 0 obj <<
+/Length 1944      
+/Filter /FlateDecode
+>>
+stream
+x��X[�۸~��P����7��Q�&;���n��)��,�ͱ�ȒW�����&�ə�������s���(
�#
}���~us+X��<�Yt��8<GiO��]�_�v�c�2�H��.3�������[�n������W8"V@�����ջ�p���#�X.��f�1���]�c��.�T���,'!(OS�U�GB�
+�T��1��֔�E{,��C�
I)�V��kZ1�J1�5��0�"
Ը[37՚���A��(�����f��O�C[��D�_6�7�S���l���_Z��߮E|�5��懢�U�}�%� 2e/�&�
	�j�V(����RX���֟풉�A��~�H���A�e/c��
�F|[tJ{�H<�^�)a)��ˢ�0�si��e�69X��*�n�P*��5������3��G8O���*c���m�G(N�D��(�80�[�)�?��Ύ�G'C{��;���*zgޏS��^����Bʺ닪��Sa��c̊�;��ɡ�v <Mcd���X��oe�[��P���Sv%D��, �a������N:
f��,��\�B��qBC���Ֆ}�#��
ǻ�ط��><6�
ܭIj*ԇ������,h%֠
��m?���_��s�q:����N�oL]O�� m�N��h�(�)����Wo�̙�n�-A�`�В4j�~��3+FC���s7o��G���R;�;T2:�c?肌e�(�"~ �U����gu|��5��s��Q�f����d�38�R�|�}Oi:�;��x
a
+��8�[��!s��+O|���!�5$g�	�%�_�iM�P��J��� ̱���H�΢
T"
����pR�
�ɡ�rp�V�Wژ���5����ejɾ��j;|t�@W
#x^�!!🲅8*��\TV�5��]/�Ŷ_��q�y�1z�WeG>y�(�
�������Fy>.�0��
�X�	���+��%.�h��%cq�h��2\(�ډ(���<>�eU�{S��V7��S�k��ع%J91��s�
p<�i�rͬ��f#^��c��U_@�����U�m˓N����!���g�{�L���0����9��8�N!�2�!R��	`{)ʀB\a1 �?a1#���0Ԣ8�9����X͇ȴC.��-ϲ-�
+Gg4��C^�^Fs�
s�A�YM���P*��0�Ķe*�۔S�N��;r(gb�Jp �ĈJ���AN at GT\ �ӯw"�8�2�
 �#
F)o���A�!�E���D�*���?���vIuo@&/E�<m
n�՞�k(�b�ߋ
e�fAL����G�5�0^"�@�t�BP!9�-;k�ia�p�0�M��
���k�lâ�q<̹�X��
��G��c-^xP��m�)���
+
�y���sm�@kh��9HbM��i�u�	ѹ��8s�@���ס¦>��`oGpp�5M�[^xҩ)�����(��x�,��0�&Z,$
n4ڍA|�ؘ��vT�9�%�f�Q��}�_l�ɣ*��N��N���ܚ9N�'G�%X�
oMU�4tǝ;7��6���+*w�u����P�x�7��[��5˅kjuV����/��z��U�2�p}�r��#,7�W�Z�c�_UH�6���Va:<��������0�ȉ�#I���B� څ���F��O�Ν��㎪?4��5�;�����z2��6�,o
u���Ou�q߷t&N��.���_�1zv��L���.Ϲ#���mm1�a_���l�+W�Fw���m	
�uQ����������;a��=���z�?D`"u_".�O���9���"����G2�9����2�yw��
��S�tw���
.����3U�黍�$��Z%u�L��[�Z�>��ͦ�H'�R��������yߩz����)1�l��Vv�Cs:6���c���a��P
+endstream
+endobj
+10004 0 obj <<
+/Type /Page
+/Contents 10005 0 R
+/Resources 10003 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9941 0 R
+/Group 9997 0 R
+/Annots [ 9978 0 R 9998 0 R 9999 0 R 10000 0 R 10001 0 R 10002 0 R ]
+>> endobj
+9996 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 10012 0 R
+/BBox [0 0 224 234]
+/Group 9997 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 10013 0 R>>
+>>
+/Length 503
+/Filter /FlateDecode
+>>
+stream
+x��UMk
1
��W��#��؆��B(zh;�C�a�)%	4=��W����Y���
e�ճF~�l��7eG�����F
��
O� ?��p�E��^������N~_��-�F�+Bx�d
<Be| 
+q���|Q-j�P{�h`m%)�G�٨
0e֌]a����ݣ��P�fRQ�����Kt40=���Jo�QݼADJ��֤�9��͖S8�di9al/� �
+C�˞XC�-�nM~���v�[��q1�9B����
�9�����Q�0K@�ܢ'����d�:k�m��̑d+A��-
�޾m�e�8�YZ+���z��zu��/���϶��t�ز��U_պ�2Ҝ
+� &QQۖW�P!��N/���.ڵ%h%Ѿt�:�
�_�}��
z(���I�]��&b+�� ڢ8�Dl��z�)O�
�
�
�������z0嚉m̷�	�˭D����,#c��k�<ct�2�>�̚U��E$y]9����ȃ��m�:~�>��n��#
+endstream
+endobj
+10012 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+10013 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /HMDHZC+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 10014 0 R]
+/ToUnicode 10015 0 R
+>>
+endobj
+10014 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /HMDHZC+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 10016 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 611 584 278 667 500 278 584]]
+>>
+endobj
+10015 0 obj
+<<
+/Length 10017 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š�wD(Ӎ��P���uF�1Dg��7�)TP�<���Cn|i_Z=�,����heè��e�[I���#�25�5���I�(v�n[V�Z=�Q]��Ӊ�j7vxVsOOc,~��쨯��}���C�%Q�0E�k�*̛����|l���u;:�_��f���9F����IV�+Eu➆Ճ{�����g	l� o��r�ʓ�HO����2OU
+ʡ)P� *��@tB�3�
��ԃr��.
+Z�B�0��)�x*9�U��C>�|8�#_Q����@!_А/G�|y	B�
Ss�K��ȗcj�|U8���C���%��گs߽ǮȻ�nM�����7c���a3����_�g�
+endstream
+endobj
+10016 0 obj
+<<
+/Type /FontDescriptor
+/FontName /HMDHZC+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 10018 0 R
+>>
+endobj
+10017 0 obj
+353
+endobj
+10018 0 obj
+<<
+/Length 10019 0 R
+/Filter /FlateDecode
+/Length1 2596
+>>
+stream
+x�UV
l��>�:v^&�ؿ��y�8q�&��@B�v�N
vI���R��q��B!�(Ck�$ԖB[V�ۺi����VMS+MPm��N��nZGG�TZ���P~`N�}������ FD��J��%bsl��e5`�ē3�&���Y/�PZ��M����_���1�c@�=�����/�'
m����D�Yb�Lr_���"�g�?��
�c�q�('��Xs��O�%� ����f�
s���&�W��Je7��(��C��IW�
v��e��.��Q�����q�9�
^�����5���
����ԏ�8դ���[���DF��2K���I:{��R
ws���mgn��L�ity��<��ܦ��pfg��U��Htp<;���|���|�c��mM�p`�`o������S�Y�[�+���.��� }fN�VWXhvT9�_��D��zg��P E0�C��$8%K�LvYX[$	�wT�J�׼�I�s���(k0���sl�bU[f1[�h�3X���Ut�{#�&�;]p}o}M����Ky�M�|���[k5���B�=uq!�d����7N�\��X�Zf
+��!	�X�$���Z�t&3��q;X��©ٹ����P�3�c�[/~�k/^dY��_$c�Ya����e5�d��r��7S��>�z�GG�`�J�0��4���
Y���X
�%���
ׯ��Yק��y��4O�S�2�~��lX㊽�Q�:W�m��
fӾ�XH�
_R��PlW��V!g|5Q1Q��l���T�a�b�ڄðΙr�YkÓ�H������$z�
$�4s�����w���S���������:�Ѷ{(�g!��
���
+��G5�qþŠ����-�
x����$h�_�͵/}���^�77:��
�&��%��
+nm���W1��N�rj��/��=��O�{^
+��
+������4>/8ȅ^
��3�;GļR����:?z">��w
�����A�v�x�̷F:��ɷ���ѹ�M�[um���A\���q5~й�07�G��� &k���!(ã���3�c���Z�W!E��O���]�4���?xS:_�������;ɾc[�Hx��u 
�ڔCl�~����K-�¯�]o
C�l� ��G��]Fk�����0���������U�����H�:|���̮��L��ۓo|w���g�3��sq>��C�q����y�ȡ���1t웘}5kVSU�%3�c$�����H�\tz�ԁ��5&��8����Sg��Mǧ{o���
+��e�G6��8-eA0G�h~~9v�������==c�����G��}���{������F��޾��j"��{bVW
�5ݓ���M�c��g�?�fS��
b�ʳ���)H����z�5�TB�
��N��
o��eDf,��sygڶ3�7�I���TH�����{���~u�
+�T��D����(\H�.�2K��]�$��jf
q�H<y$�s�j��Ӵ��e�������&�'��
�K卍�s���7o�Vެu�l
�8���
8JX��z�	6�8P�t�JY	K'��:O���
���^6����6ɡ����n�����e9FsGs�P$�-/��� R�ʹ�C����8��'K&�G�p���){AS��3�%.Ur�k�&i=N��V�žE�k
��C��&bj�
��2C�|^�J��TJ
ܪ���պT�#�g�T�a�g!r9��
7`
X�'nx#lK�
�s���b*Q�����:���Y��%���f�Z��Tj��e��Ek���V�@#ڏ�\٦�lu�ᯔ�C��U�uTÂдQ'�K�A��>&?�G&�1FU�BH���L��	�:h�i��sJ�/濧0�G#����FXg���
˜kvͤ!3�P�eȢ�R��m���I��o2�U�@=�gl����ĝ
��\
:�u���]X�{x��|�</�u꒥�m����W�٫�eQ�� !*?
+endstream
+endobj
+10019 0 obj
+1956
+endobj
+9997 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+9978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [129.681 669.66 163.763 680.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+9998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 310.554 170.687 321.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_a091459894ae74d82670a777e88a75f3f) >>
+>> endobj
+9999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 283.628 176.027 294.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_ae0a0ac883cf939f343665ecf0c069379) >>
+>> endobj
+10000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [129.681 176.029 163.763 186.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+10001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.182 158.405 239.905 169.309]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag) >>
+>> endobj
+10002 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10006 0 obj <<
+/D [10004 0 R /XYZ 89 770.89 null]
+>> endobj
+362 0 obj <<
+/D [10004 0 R /XYZ 90 721.073 null]
+>> endobj
+10007 0 obj <<
+/D [10004 0 R /XYZ 90 329.249 null]
+>> endobj
+10008 0 obj <<
+/D [10004 0 R /XYZ 90 329.249 null]
+>> endobj
+10009 0 obj <<
+/D [10004 0 R /XYZ 90 300.216 null]
+>> endobj
+10010 0 obj <<
+/D [10004 0 R /XYZ 90 255.627 null]
+>> endobj
+10011 0 obj <<
+/D [10004 0 R /XYZ 90 194.645 null]
+>> endobj
+10003 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F22 2982 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im14 9996 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+10029 0 obj <<
+/Length 1238      
+/Filter /FlateDecode
+>>
+stream
+x��WM��F��W ��BOwCӍEJv��Iv%g�Q3�=6Y>��ǚ��0`{4�=D9Q4�ū�ի;;���Woy��(�h��;<"�Q�3��%1��c�<�ݤ)���G�[�[�5�����I�������U�ty]-�{s�.�f�f��-��B6�o�U��{>e�}S$m�}^��|BP̘y�G�(�WV��!�
�C@�Z^��^|]X���C��p�rq�;,Cl��9h��	i �����s�ǥ�� ��J��R!�ܭ���
�0V^�]2�t�1�0���몫��
��"�C�U�lw?���Ȳ�uϪ�?�{�VI)��B�M7
Ѫ}sW�U�Cl6	�n�}
�!���[c&�rLXb��]�����E�Q�
��&��ܤ� 
E4��Y�����Ǻ���G�I�̓&����J6I'3����Yb�ua���fȆr��ֳ�!
+���� H����M�n}}��h�5Oe꡺����1u��q~5�~�i�;���EH�D���@<>�_�~
+�D��A(�bn��
+-�⚶?�@U~�(����x�p�J
���;Q�S�!��f����� ��<�ᡕ7m�����>����P

+�O6��
��	� = ��06�~6$��W��p&�J��ج?j6���Œ����k����M����#
�����Pw*�6�������*-��4� �GO Ŷb��X
q��:
�h'`HD�P��xL�s�`�(7�V��$��FY�d�$�LSV*q3�^3��<�
+2�G�V�1�	s�cz�}�!�]ƶ~��
W7%l�����7��~�߿�����dR��j��N+��D��A�Z����mϦ;�4��2D�K2z��JXONg8}�~�Ǖ<S���`/�@!5�ΰ(D� �O
+�u�n��D��^Ʌ���3
+53��~N���F�n�i�s�w�YO>��ŋ�A)�B�7J�^
VOy���D�
���$iw��F[t�^Q��$׵��
���O������jgc\�1ˆ9?-��

kl�f��Z��F���k�%y�Cۯe�6��}�/��[���=^
�t�KQ�R��_��W��Ir�b1+�j������c̵���TCR��i���d�H�����7��
���B�#
��&X/Fۮ�-��
��VV�B�O�8�·�:|ݲnlRy�erl��hbX
�h_
;�0���t�/L�`>��6y��
+endstream
+endobj
+10028 0 obj <<
+/Type /Page
+/Contents 10029 0 R
+/Resources 10027 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9941 0 R
+/Group 10022 0 R
+/Annots [ 10020 0 R 10023 0 R 10024 0 R 10025 0 R 10026 0 R ]
+>> endobj
+10021 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 10035 0 R
+/BBox [0 0 222 220]
+/Group 10022 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 10036 0 R>>
+>>
+/Length 461
+/Filter /FlateDecode
+>>
+stream
+x��T�j
1
��)��H��Ň�P(��v���C�ͦ����׏�g���ͥ�Bf$�ҧ���z��@�`"N�|��"(��=�]#ܿ�����yU��}P�W�a���:x���(�0h���U��(ԁ8���#��I�E&�@f�0U��#�5L�7�J:����u�B��I��&�P��w��"R��H�'��lm����eKc��A�
+c��+��\����1�	�m��<�
+v�
'���\�c"���0o��vR��솞�vX���l=��"�x�m �
+7Z��4z�i�8/Yz+
�����y���vk4��ѻ��Nv-�f8����:�v,s����y�9�2�R����R#�ɤ��R���������������
gmJ7�/r�S��)�M���X���'!.E�1
+�
+��������$����
�܁?�Ġ]��8�fY�� 
v�9�ߨ��
X�jy
+endstream
+endobj
+10035 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+10036 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /YQDYJX+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 10037 0 R]
+/ToUnicode 10038 0 R
+>>
+endobj
+10037 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /YQDYJX+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 10039 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 722 611 556]]
+>>
+endobj
+10038 0 obj
+<<
+/Length 10040 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Šq��e�q�j� 1��
+5��,|�Ɯ0�>�=לܤ��3���w7˞V�G�
-��Ib]G��Q���[N�&�7�۲��='M��/.����I�=$����)r����ץǧ�f�MdV�%m�i��E�W1K���)���v�����slIΊ+$9a��4�_-k�_mBF����A�o�B9��YVfm�<P�A�@u*�)P	�U�"� 	zD�3�
�$@%h  ��]�؅@qg:�I�|���W#����
���|�	�E
�
+d��WT ��p���A��>eys�8\�0�}������]���d�O
+endstream
+endobj
+10039 0 obj
+<<
+/Type /FontDescriptor
+/FontName /YQDYJX+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 10041 0 R
+>>
+endobj
+10040 0 obj
+333
+endobj
+10041 0 obj
+<<
+/Length 10042 0 R
+/Filter /FlateDecode
+/Length1 2284
+>>
+stream
+x�UV{l��?������]��88N
��~�B�8Oǎ�.
q��R��q��
+� e
�R'U+)вi[ۍV�D�J���R���6�OՇ��Nb�#l*�D�im>�w?'���{�߹����~1"*�.�Զ7�^���†�
�
���g���Q"�o3����	��+<��=������2���|�h��_�l~o�(y��t�l.}h����Wz�&�
%���*���$��X�0:F�N�g3����j� �\r���@�1����F�Ǫ�<~��������	֚}\
���\檉E�/�j��C!X��TX�6n�F�����j1�%O��uֺ���v�:�6�u9k�%&�ӫ�֠�Jz����iu7j�����jS�[��6��miߪ���V���g����W���zw$�os�T*J6�5ڪ*����&�3ؔ�t��8B���tf=��)���$���D���]na����/�n�CR�L���8�Ś�����E_�6�M��xG҃�@qມ��b-u�~�	6�	�
��X��p��݅��
i,�^�x��!%�u�&���@v�"v [...]
+6|B�v��L���Jcjc��X���M��>�u��������8��*Ɖ}]&�w�"�cŞ�i�����-û�l.Ж���W��5D�僊�n�
��f�!�wXm@��LqzlV�C8
��ǘ�9>�L�?6⇹��J�|��Xb���7ܡ�]{�a�+����ݏ�Y�x��
+����S����o3� �NTo
Վ�����L��l(����D�z77�����
�B���
��'Sy��r
�jDl
��w,#w������
�ϭ���~���=��8Vos�{��E|~Ġ
rz�gT:G���4�͹?��l����\G�:�u�
�#���u��ɟ�����o��S
E�"�!��ma��(���K%Ӑ�|�6.��Ԇ��&{�
Ms��^L��l��}鮟*��O��#��O-��ʷ�o��T��B��N_Y����;ڇ��힮(B4h��l�-�np^_X!�_]o�C�n�!��O�ȻL�ʊ������8ׅ���&u_I��=
z���H�K��#r8˙S%ٙ��7f.�8���S�����
t���	�6��>��8dε�Y+U�����Di�7���Y�
������96
��OM�?�gn���
S��Ԡ�V����&��W�O2��\ܖ�0.Gvo}~=~���Tg��������G�Ng������ö�K'~�
����v5%�F'�vO
�>���ͥ�r�
�a��/�P��r����	�hX~
e�Gֱ� �1��@��X#�r��1�V����Ε�E�A��j�$b��dP^Do�صp}�}8���AoK4���?�e�Ũ�Ą��)���x�F�����P�H����	-u*s�b_�W����R � /u����|�f3A�5`C
+�����V�=1Y��k^��!���ڦ����
��5_���RZ [...]
+endstream
+endobj
+10042 0 obj
+1709
+endobj
+10022 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+10020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [129.681 573.721 163.763 584.625]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+10023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 231.378 188.4 241.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function_a085281189e709a4b28e5858a758bb5bf) >>
+>> endobj
+10024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 199.927 176.027 210.457]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function_a2e8f64e26c1ae0aba841b4fd773fff2b) >>
+>> endobj
+10025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [129.681 121.487 163.763 132.391]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+10026 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10030 0 obj <<
+/D [10028 0 R /XYZ 89 770.89 null]
+>> endobj
+1867 0 obj <<
+/D [10028 0 R /XYZ 90 642.253 null]
+>> endobj
+366 0 obj <<
+/D [10028 0 R /XYZ 90 633.431 null]
+>> endobj
+10031 0 obj <<
+/D [10028 0 R /XYZ 90 251.776 null]
+>> endobj
+10032 0 obj <<
+/D [10028 0 R /XYZ 90 251.776 null]
+>> endobj
+10033 0 obj <<
+/D [10028 0 R /XYZ 90 218.591 null]
+>> endobj
+10034 0 obj <<
+/D [10028 0 R /XYZ 90 165.58 null]
+>> endobj
+1868 0 obj <<
+/D [10028 0 R /XYZ 90 67.738 null]
+>> endobj
+10027 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im15 10021 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10055 0 obj <<
+/Length 1763      
+/Filter /FlateDecode
+>>
+stream
+x��Y�n�F}�W(�J@��;I�('u�4I�X}J���Q^���~}gwI��hYJ�4}�xٝ��3�p�����o������e��|I�3�s|��GB���y;dD��O^8Lz��v����x=����F��:|x�
b
�zN�
޾��

�p0b��ܛE��)��ع�9�U,Q�/�O�O
B�/�C�[Bl#��c<�
Q>
�$؍��<�3[��EŐ��&���Ĉ������a��j���@���i"�p-�v/��<�Gco�>?�JK5��*�	�Sr�H<��Tu$ϲ�(��
�)����(��u7r!$��ʄU�~v)q���ķVǔ#V����<��h#"�s8�yn�ٻ0W��ܙ����*�(K�v
+�.Z�0xs��j3^~��0^͔]	'ڬ
�������" M�`���b�c�	�IQ/��&�S�&ɭt�.�:cF�}���*��*�(V3����hY‘����ngt���βp���
L\��]V�(QQٯ�.�G��f�R��9�ޙgI�U���8Q1��ҹ}�c��N���3][I�� �Q*��ގ�ubD-
�k��#�y��ćk��ʀ8N�M���Xq:E�8uB8^�NJ�N�Py�q�A
>�k6���:I,'�.)m/�`�[�-(����d$ԓ�Ԧ��3
�Tv�f��J������24���ﱡ��a�|�Ƅ!�{v��΀%����\�ڡ~#
_�F�w$��h�g;r�>N�^�侬����g�������R�A�l0�eǃ�H�=e���P�i#�H)�
I(0N)��}
����
o"��JjSܣ�+�I��$!@%��tC8\I�����0I��
!�%
�p�
���۞7:�M6��}�
D��1�ؤ�-�>$o
��5D#�D� [...]
+�4�+��Vq3,�m��DX�v�BYJR/���E�%]I��u�=
���^�>(<��=ze���l
�P��٫\MAi�y��_��Sc��Q��`�< �!иGA�pמW׫9�F�V��������#=�텠7��D%Y���?j�G��w٠K������u����l��υ�*WyU��H�>C-��׆e.����6��e��Q���]�QK�3���	�F/*��FW~tm
B�~' >�I��[��^���{��0�����.}�^ih, �E�W�oEG'����	P��*ݱ����+h�|�����IǪ��vj�
f0(Ei3�4��U�v�i�գ
���T�jVK����]ͬe�lz�>�gPM�V
���������C����]$|�ϻдa�Լl_�������Uœ�ۘ���Ơ�a �3�@ܧ���{}��^�U�����*����ɾ�B3ݨ�h�N�Q�Ӆ�Fc��Q�@���nB�}`��v�݆���\���ݮ��
�0
�n�z�65S7�F�2�01%��u8
+endstream
+endobj
+10054 0 obj <<
+/Type /Page
+/Contents 10055 0 R
+/Resources 10053 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 9941 0 R
+/Annots [ 10043 0 R 10044 0 R 10045 0 R 10046 0 R 10047 0 R 10048 0 R 10049 0 R 10050 0 R 10052 0 R ]
+>> endobj
+10043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 202.919 169.013 213.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a59a61c7f332d1239fb6f71834703a0e3) >>
+>> endobj
+10044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 202.919 205.556 213.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+10045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 174.973 244.38 185.877]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_afb730d60db4b7e1ddd4c9994ec077cf6) >>
+>> endobj
+10046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 147.027 191.718 157.931]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+10047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 147.027 288.852 157.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_ac02677c5008f5842ba8100572684e8f4) >>
+>> endobj
+10048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 119.082 191.718 129.986]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+10049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 119.082 303.079 129.986]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_abc7a7c19a6d457b4a37e05878086a430) >>
+>> endobj
+10050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.51 146.637 102.04]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a33841a1e5c7d5c28fc531d788731bd39) >>
+>> endobj
+10052 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10056 0 obj <<
+/D [10054 0 R /XYZ 89 770.89 null]
+>> endobj
+370 0 obj <<
+/D [10054 0 R /XYZ 90 721.073 null]
+>> endobj
+10057 0 obj <<
+/D [10054 0 R /XYZ 90 652.964 null]
+>> endobj
+1912 0 obj <<
+/D [10054 0 R /XYZ 90 559.118 null]
+>> endobj
+374 0 obj <<
+/D [10054 0 R /XYZ 90 552.486 null]
+>> endobj
+10058 0 obj <<
+/D [10054 0 R /XYZ 90 462.932 null]
+>> endobj
+10059 0 obj <<
+/D [10054 0 R /XYZ 90 413.584 null]
+>> endobj
+795 0 obj <<
+/D [10054 0 R /XYZ 90 344.725 null]
+>> endobj
+378 0 obj <<
+/D [10054 0 R /XYZ 90 338.094 null]
+>> endobj
+10060 0 obj <<
+/D [10054 0 R /XYZ 90 221.938 null]
+>> endobj
+10061 0 obj <<
+/D [10054 0 R /XYZ 90 221.938 null]
+>> endobj
+10062 0 obj <<
+/D [10054 0 R /XYZ 90 192.258 null]
+>> endobj
+10063 0 obj <<
+/D [10054 0 R /XYZ 90 164.312 null]
+>> endobj
+10064 0 obj <<
+/D [10054 0 R /XYZ 90 136.366 null]
+>> endobj
+10065 0 obj <<
+/D [10054 0 R /XYZ 90 108.421 null]
+>> endobj
+10053 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F22 2982 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10080 0 obj <<
+/Length 1659      
+/Filter /FlateDecode
+>>
+stream
+x���o�6���W詓���7�`�nm���${j
C��D�,�������Է#'N�n�òD
yG���h	;�v^^�
^)��ȗT:g��
�}$$��:�\��$����C�� ���!�n-��4
�o��4H���Gq�S��ڶ����
�"�%�x>�:��-ZtF =R�W-^$�x
+‡B�χ#*�{_
�p�
�R!L�����H�U�?� �
+�gC��z6��\gN�Q�su<1�(�.#��
�<|�
R�L �9�����L��#�{�g�h�p��;rN�
pi}ܞ�;���3�Q� P��=��v^�f�Q�W��{<�em��R�Z �ٴ�
+q��@G�D�S���\���4ʫ4�����V���h�ID�D#���h�2�#=>��J�#����\�P���i_F:O�
q�C���5�v�P��w���qDណ����f�Ѣ�X�-�y����c�X�-U���2{��)���bI�^��e�':[Dy��z��;��B@����Y���K/K7<y=p��ަ���q�1�xxw\�l�

<I�,o-n{��.��-���
|͗�[
H���� 1F�A�n{,ɒ���nnc
Ly��{�Ye�jđč^�YѨ�?eHI�4*�4�Q�+�B�Z`��_�q
�18K9��&���G��ru
N��9����|AC8�\�(F)E�A�]�yR-��}���ү��y�{B��Z���%5�b0���a���GݾN{:%��w�0��+�M2w<�8�����ؽJ���E��iF�x6���z�|�����={���p�
�|Ȉ�O5?t��c>�Rőb�DkJ MU���q#*�B��:��/���rӈK8"������; [...]
+`ɏy
����t7~������e����R���G-Z�n��6YL��E�f���0Te�JsOtTԻ���y�+ �Q�n�V�ܓR��w�
L�j�U(��P2�qC�ɤ�5��`�R�j[6k�_Q���/��"�,�M���A��M��D)���ו��	D���
�{��!Z at t�f ׆����1�f53�jۯ��@��t�����˄vc�r����T���
���Ʉo�d�V���[~wO&��{2���2a����qH-P�
�3x��=��
n����qx��
I��l�w/�w-�,
D����*|V��o��3��b�?)ˋ��xQ�F��H+6��$Ad�jό��yC�q�+�ϩ��2/�N� ���@��|~xpp���t|�&E��
7-]`%5�IZ
h���zN����M�ʖC'ie
0�F�(Em����X�X�88�1���ܼ��?��g
+endstream
+endobj
+10079 0 obj <<
+/Type /Page
+/Contents 10080 0 R
+/Resources 10078 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10086 0 R
+/Annots [ 10051 0 R 10066 0 R 10067 0 R 10068 0 R 10069 0 R 10070 0 R 10071 0 R 10072 0 R 10073 0 R 10074 0 R 10075 0 R 10076 0 R 10077 0 R ]
+>> endobj
+10051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.948 672.092 286.957 682.996]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_aa3d3212cc1d821d780513a6b6c369256) >>
+>> endobj
+10066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.096 571.69 211.105 582.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a61e437035d45d0ae897b6465d1c0d0f4) >>
+>> endobj
+10067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.948 507.154 377.467 518.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_ad7a9b929f459945a7578b161edcf5d4b) >>
+>> endobj
+10068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.899 454.573 324.725 465.477]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a105b70ec7bd017d77ee138da113ad600) >>
+>> endobj
+10069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.037 439.565 313.023 449.47]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+10070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.699 401.992 306.952 412.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_abed7286726807179efc1001a249f0eec) >>
+>> endobj
+10071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.948 326.498 285.413 337.401]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a42eb3d8a75f35d8f1a7d23c0724bd33b) >>
+>> endobj
+10072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.228 326.498 360.969 337.401]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+10073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.948 261.962 280.731 272.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a33aee6054a84f5843978f68ef4670e55) >>
+>> endobj
+10074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.546 261.962 356.286 272.865]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+10075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.096 161.56 186.477 172.464]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a51b99f0a7f6ed7aa96577e464bdc574c) >>
+>> endobj
+10076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.096 76.49 183.459 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval_a66faf0e36578340ea5b3f18a5bbcf426) >>
+>> endobj
+10077 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10081 0 obj <<
+/D [10079 0 R /XYZ 89 770.89 null]
+>> endobj
+10082 0 obj <<
+/D [10079 0 R /XYZ 90 721.073 null]
+>> endobj
+10083 0 obj <<
+/D [10079 0 R /XYZ 90 661.068 null]
+>> endobj
+10084 0 obj <<
+/D [10079 0 R /XYZ 90 560.667 null]
+>> endobj
+10085 0 obj <<
+/D [10079 0 R /XYZ 90 443.55 null]
+>> endobj
+10078 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F39 2335 0 R /F24 537 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10096 0 obj <<
+/Length 2832      
+/Filter /FlateDecode
+>>
+stream
+xڽZ[�۶~�_��V:�h�J`�Ӝܜ�����'''���v�J�BR����.�I%Ǜ>	��`f0�}����,�}{�����	��HK*g7뙎g	ב�x����3���|7cREDK|e����O7��t�Ƽ������+�W�8"J�l��z�K<�C�w�8bZ���A��
��ٛ�]�^�8��4͏�L���q�8�xZ,I
��&�7��bI��S���]���U0<���GRQ'�ɶ�M�d��/�pn�"�Y����#�fk4���H�����r_ܥ�b��
)��\�x��b� b^&'�'����}emҺv�_-(���6=���FgR�H�d�c4�Jw>;����I�T9E^-���!�LJ�
+i LC�D���X����[���e�d���(�L-iDc1�g�]L�'<;�K�����+��|�Bƃ�K�hW��)s�|�)D<�ϊ��W��SQ6�����N�|��:V������]Y��m����"�i��[Pc���y���-�M}�`bUku��f�g�Bڵvi��6��6H�Є�D�F|t#G&1
�~��sV4��GӖ�W�E-�
���M�g5���iq痕�qkS �� !� �>!�
`��[4ݖŽk����9�䍛��ϛ���C��7��ש�ƺ�lJ�����[췷�`������z;3��G�/������3�b<��R�).����y�iWym&
�y�6���n��
1�4��F
���nZ?�"n
����Ul���m  (##�.���¨!���!�� u��mה����v��z�ȳ�@`!���0���w�d
%H�@�9ԯM at 8S�M+��gtH�<(
+;E�nY�2��ءK�"
k��D<N���DQ�w������q�J����]	�|��]f�8�($�8�V��@P`MTGJ�vԳ� �L߉�+���씙�TZVa3'JG�I��E�){3�����}V���/z�����#�/+��J
bi��w��j׵�J�Ỽ�u���	��>s=6󹄱dG���_���d;�{`���.�6�����	4v��G�B?-�a�z�գe����%9=�JLvU��aUbm�2�ɪ��t�{��2�رS-m�u�g*����h* ۙ��.�����[gi�GMsO�Wx_�+2����Ҡ��C�z8H�K���T`v�&�U��=~��nWV~ח �~l�+Y�ٌ{
�$[^vN|ٞ�V�� �nnG

}�vyIwwy�e�VT�*���S
+'�(��@a<�Y�;TX'GZb��,jnS‡&k��#�a��3�rk��hK�b�
쑏K�խhe�̳�ǣ�bi������튺@
�g��FL� #��a�%h��l�ר�k?f~m��/�����p�r���`�G�7/�c�l.1�V�cs*��4c~�P��Y�G��$���g�Ι��.�)�+yQY
�!
āO�4Ċ�[$�$��Ho�ܕ�1�#p |�A?��hǸ�'��/ׁU 
+59C�$���:��RT�I���
�}��"�k}�*&�JYDdr�9���Wj�
m��P��D�N��ٶ*�2<<�""T�Uؘ������H�%��'��Ͳ&�+
+�>S�x��
7_?�*1U��)R����RĞQ��b��s�{����'�SLK�$>Ok*Qf�{>4�əD��O29ӑP|<9���+"�.9(
T�_gڝa���zZ��#�9�1�a
�J���	�
+�P��_X5���9�li
�F
H_�Np��?�u����$��_T��)�-�1�l��YZ�R��蟋`S�W���X�k �
 �� �s��
_�U3��H�9
�
�H']:�&��Q�#���8�����|Q��tq1�������|
@d��,I��?0rx����8/?<K2]Lx(&�����
�ؕ�T"��a at g�M^>�tt	�UĤ����?R=�1Z������GA����� L�5�)��*b�b|�v��P��
 B��M�`���lvDž ��A�M�`,��z�U�@�\#�P�v�������.�ԨO�&�͉�(�X1Rק��7��s���7(8��q��л	
+�x��E�����W���q�D�#}f��4	&����x�<�U)8�n
Z�RnA��֝ 4�B`.��'0K(D�^g�~ӄփj�' 4p��X>sf�P@NhN�x��LfԠ
�?m�J��)����
h�N��u�ݟ@
ӈ�H�ԙ.9\���h��c�@>��\�'Y��
��‘��n���ͅ �jxZ�Ɨ��5��lc���o
��=Qr�D�;��Ru�,��a
+�%��D���I�D�tP�C�D�
w�$��ր��spk�6/6y��2}o�˸g]���se
��0[
�׍dn�_
qW����HR{��!ow�;��+��B
]�#H�KB(;�x&gyP�f�8��?�yf�R!b�
��TE��{蔭D�6��G�s�
���HoF��f�rkn�P����=Fw�_��6��^�7rc2o|3n�n6�
W�ޞ��7�o���D�?RG����>��8;g�YbW��_��YKO�C MB�HR6�� �JУ���B<Q��g6��
�C)�@�N�m@o!}^�!���٣,�L��E�	�m1��QLj��g�ֽ�����#���%A���3��.	�|���O�WB�Pv����
��!�w,)&IB��a۾l��
�_n����zqK�[�mA��P�̕���u���.i�[^���5�]g�_B�=��1-�m�4���KU�?HDvU��m�>��2o.��:տw'.�d����iv�ϟ���문�VЎ]�
 [...]
+endstream
+endobj
+10095 0 obj <<
+/Type /Page
+/Contents 10096 0 R
+/Resources 10094 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10086 0 R
+/Annots [ 10092 0 R 10093 0 R ]
+>> endobj
+10092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.583 316.857 295.607 327.76]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+10093 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10097 0 obj <<
+/D [10095 0 R /XYZ 89 770.89 null]
+>> endobj
+10098 0 obj <<
+/D [10095 0 R /XYZ 90 721.073 null]
+>> endobj
+10099 0 obj <<
+/D [10095 0 R /XYZ 90 677.272 null]
+>> endobj
+10100 0 obj <<
+/D [10095 0 R /XYZ 90 406.895 null]
+>> endobj
+10087 0 obj <<
+/D [10095 0 R /XYZ 90 383.468 null]
+>> endobj
+10101 0 obj <<
+/D [10095 0 R /XYZ 90 383.468 null]
+>> endobj
+10088 0 obj <<
+/D [10095 0 R /XYZ 90 261.716 null]
+>> endobj
+10102 0 obj <<
+/D [10095 0 R /XYZ 90 257.233 null]
+>> endobj
+10089 0 obj <<
+/D [10095 0 R /XYZ 90 77.486 null]
+>> endobj
+10094 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R /F119 3831 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10110 0 obj <<
+/Length 3233      
+/Filter /FlateDecode
+>>
+stream
+x��
�n����_A�@*��x�c���n��n�>%A ˴��DyI*���g�ב��d1Iw�C=<s�W
qt
��ǣ�ϏN^*d$���Udp��AB·���`$��`�'gS�'�t5�p6�x�^��ė���ϋ�t�ޟ������tJ�$�OOy���u:=�O^,gYV\����bU2�-xAل3}����G�
@G�@H ������{
]��"����g�hq��s�9��.iÈ
+{i?JJ
٢�DHC(A���<^�.gyl1:yI�O*<Ѱ�{�b�[!����m��V@&�fr>�b�~H'�@$s(1l����hS���0J5RD{�}��$�3����x<��wD�Q�%c`Ǩ�X��{�\MI���	,�5'�X
rÌռ�cH�H��L
�� \	+�;�?$����,�l�F C�l�F#��� �
C��r̤AZ��@!JX�C�	'�sIc��	�3�@�j�7��z��$$]��q=d�@��G�p#�O�����~��f�M�t���IDt��Ǐh	 w���_Ҝ��V*9���l}������$$�=�%#�ׄ�
(Z����U�E��b"��Sa�}.����2� �=���X�E^p��֪B&n?���	�L,�A<#Ʒ�.O8�'U$�n�ìW�~ҁ�� XAjڍ
�^�Q���"A<d���bi��;�i��TH�A�c� @�%mӰI����I�VA&���a]c�:���X'�ܯ.ֵb�6���@�W>��˧!�W������I�XԶ�=	m`#�x�W���EJ���ސ���z�]$�E�w�r�������� ���dL!�,���#դ��x0	w��\���<7����բ�̀���)Ϊ%qq�RQx�8-�
+��R`��P
ӒT 1�Q�
�5��M ,��oI��I�dD=ĵ�
lF�K�r�P�7���B�8,��d�!�d��i���b�Ǘ�;�����x�^�ֱH>�����l3��Yv�)�Ė�w��-d%���l�����
l��*��g�֏�[���
+� �-�����5��w灄�
+�L��",��I ]�s�����
h�xFƛ�U��dž2��?Z��
r�,��u �����*�%�A��+���I�B[�v"^��O�F\�R��jC��Ԛx�v���
���^��|���@�4@[a�6����ϟ��n
+��s�j^1̿d1
y\w1l�f
	
+`؁�0$q$,(Ńհ*��#v
���
츍�@v"�@�ɛ4r�
fCr3a�U1��q �
+��xN˱�{��A�$�x"���j�B�r�o$�_FV1q�(������4��l�f��p�{%�V��~��&f��k��S���Q��U�=���}�4�=��`,Ǡ�#�j1R!�#�����^��f�W?yҥ��@�
+
ގ
V��WX���(�
��6�hX�S�a�
f�R��T9; >[wU�A��]�+�c�kU��� !H���!@I���g�,�-���p���@yZ,���;6v{�����
��T�G�p׆8�~	Ԑ@A`
+&QeG
+�Δ�3�_���6�i�����}���B�,D�O�A� |"��1˲ŵ�[i��9P�V�����5�]1BR�
w��
�M�0 ����@h
g���x���
��,�j���
������
���#Tkp��AA�c,2f�1�ɀR�ַ�`���j��g!vE���`Em�.��`�F���&�hi��w�FC
�A��!Ѩ���a��i��u��X�fmMS�� ��[������M�X�]� �Ң�Y�Vf
�@�?��Xl�[5H8�z���/��mB9����	R��bC$�:v7bW�B��Ŋa_�$ᆼ����D’�L�
1��Y�Un��{�)�-�c)�z��O+�
��~�q���n: �("�S�!|�I��i�"�M�r
�~I���&��H��$9�;�tH*W�#A�<0�^+�j��#��P,�2R�����5
�n�м/*{�Đ�{rٙ�ol�t0�ѯm�}Q�~
VKi�HlU6V���ב�囋VN0B�f������� �
Qc���u���[�&M��5ʅ����
+��2�v&h�
m��������o<d�"c�9 �i�F
��^5����O��$�)�UcLh���kN����z���OG`l5	���9	dX���@&����'������j���7	
�S�$����}��N�@	:'88uu�(P8H��I �����N
\z�
L�>�\|
+ 9�Qb���}�) ������q
+(:���99�9l�������ƀ����pk��ԗ�T
�'+�3��ڍ�f at tl���v{@x6G�n��P;ɴ
�I7Y
@����
������r��0؃�
�ݼ�� P��3G:q�`�
�&j����y,�c."{�+w��
a��,�A�u�
3�‚����y�8Ic$���[ΐ!K�9�c� �{�Ϧ�bl�s���e;mۿ�n�?R<
a�G縒ϲ�t��9`���
+}�|��P�P#ˣ:�9��΢\��U���A#w�:���,ʓJ����g���_���
�w�q쓩;��>�t�^.��0�g(��[��2�OGDD"δ=Xd�̪�)�Eo�Ɠ��%����hJE�%P�MW��րr�Z�@�, zi
QR
.���Z=��Zx�1�ϢDCbT�H�l��d������)�Ml`1
+
+�%�=���
.y�op�?�T��q0P�W_���
+���"�����㫩�ĩ{]D_VHt��1刕��[R
�k���R�ZIs@��������i�2���K�/>��Β���[����"�/7���`H�����q��o�v��7�N�[�RwT���h���uS���ī����M2�>b�3I�5S`��0�B���R�^�^Kk��
��z��
�#m�r��gI�
+"��
[뤛y^z�Y�!ɔCA>[..�q�
+�+E��W�e���)v�Wa�T
+�X��"|h���ܮI^;�|�8q���r�rJ��z`aSV��g��+_$�P�v}�s4 ��X �Fo������gq�����_fɦ:qky]�­�!A�6���6��>ē7q�
+����
9�m�!�cjü���ӓ���u'�h^�(�ת-�v���qy�N�Jk����nT��g�˧7����G�D)�V���?��'�V,���ܼY�?|ʪk
+endstream
+endobj
+10109 0 obj <<
+/Type /Page
+/Contents 10110 0 R
+/Resources 10108 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10086 0 R
+/Annots [ 10103 0 R 10104 0 R 10107 0 R ]
+>> endobj
+10103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 119.271 144.674 129.802]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ffe9c9777d454e5bc5d0ad41887ae8c) >>
+>> endobj
+10104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.448 144.674 101.979]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab331b1dede4f6e83d3eefb864929a9d9) >>
+>> endobj
+10107 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10111 0 obj <<
+/D [10109 0 R /XYZ 89 770.89 null]
+>> endobj
+10112 0 obj <<
+/D [10109 0 R /XYZ 90 721.073 null]
+>> endobj
+10090 0 obj <<
+/D [10109 0 R /XYZ 90 551.748 null]
+>> endobj
+10113 0 obj <<
+/D [10109 0 R /XYZ 90 547.264 null]
+>> endobj
+10091 0 obj <<
+/D [10109 0 R /XYZ 213.955 411.991 null]
+>> endobj
+10114 0 obj <<
+/D [10109 0 R /XYZ 90 407.508 null]
+>> endobj
+1913 0 obj <<
+/D [10109 0 R /XYZ 90 242.988 null]
+>> endobj
+382 0 obj <<
+/D [10109 0 R /XYZ 90 236.276 null]
+>> endobj
+10115 0 obj <<
+/D [10109 0 R /XYZ 90 137.856 null]
+>> endobj
+10108 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F24 537 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F119 3831 0 R /F8 802 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10147 0 obj <<
+/Length 1486      
+/Filter /FlateDecode
+>>
+stream
+x��Y�n�8��+4����
I�"`��>��4�UR��8Bmɕ�&���$%Y�N�Y"�������K�=���=�
����
+i�
�<�=��!����~@��e��
B��
+��->:�4|�ixj��^{�z>a��8�M{g_�C�{�@I��V�z��x��{���m
+q�&�C��	B!΀sJ�
|�܌��+3>��yg�q?)u
�Yީ
�(��s������x?�ڷ��Jx}QU_ө�'S�I�^�w3����&K����<	�
��
�(d��Q�*x��(���,�IQ�f.>�};[2˒�Lұ�Uf��K2(��[���4E
���
4�0D�ޡ
�iU�M}�{R�mXOzT�W�|�����ifm��~eE*!�	@�U{ۺ�#���U4��N��w��~��ۧ;�(n|��6a����Buz͊zYVB�I`�A��l5�8TV��s�W�3C!�u��:)�-1��=�
�m�#���=Q	�,�d�al����+�
k�4�I
�5t*D�܁M�f�	��2��ӥ�
�o�~����7Q�B>EߓqT�bCT�j�o+E艆`����Ku�m�W�
;�i&5�
+ at g$���$�O
��������r|d��"+�⨌�)�^k�:x��G� �`y�d�@L�E�ݗ�@x��Y��<-���sX��#@wa7�\_�\�#����
+
���X��$�H��/�t��ޒ
+�
���0~�u��N�V�z����I�������*�	
w���ݚ ��!r���0�ҭ�s��b� NT]�����qE\f�d�X���7�{"�(��"'�b

�DB셌 �__�#�5�v� Y!�왜?~�s/r��t�֓6E&�Ja�
��)\O��"@�``�.�db� ���ɬ���{
k�!Ū
_�r���c�D�*^T5�6��q@���d��+���*�0�WT�[
�Bp~��vo���4v��;��

�9�uMQ{;T!
+D�?vUdg���F��$���
��7læ��c¤�
+팪�k���S��t�g�����IY��ٚ�|&
L�D��a�����Q
ט�' ��P��[��N�����;�W�
�£��:�\�޳F���W�hn��VD�
�����ħ
p�F��+��#�-FĶ�
��T�����L�����+�������$�w��|�	S��܇	s����	��
��@������	�2؋�!
�aǀ�Y� ���Z�7G������:�eӾ,R�o��Βt�����B�� ���	?���.�%�Ɨ���uBi�v���+�8��=�JI׽�!Y���
+��v��k5dqe/������ ����ǺMUp�nx�2�l�� �,:�o�!'G
b��N�
+���{����������t
M�&fp^-71�+$��r-
�� �Tב���kc���`�&��
)�e9;<8���
�����[�J#ކ�Z"�,obw(�Z7�B��A<a
+endstream
+endobj
+10146 0 obj <<
+/Type /Page
+/Contents 10147 0 R
+/Resources 10145 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10086 0 R
+/Annots [ 10105 0 R 10106 0 R 10118 0 R 10119 0 R 10120 0 R 10121 0 R 10122 0 R 10123 0 R 10124 0 R 10125 0 R 10126 0 R 10127 0 R 10128 0 R 10129 0 R 10130 0 R 10131 0 R 10132 0 R 10133 0 R 10134 0 R 10135 0 R 10136 0 R 10137 0 R 10138 0 R 10139 0 R 10140 0 R 10141 0 R 10142 0 R 10143 0 R 10144 0 R ]
+>> endobj
+10105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 144.674 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ba31de49e0fcff11975c0e8670269b9) >>
+>> endobj
+10106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.369 707.957 281.012 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 677.776 144.674 688.306]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a64ca0878a1f4a3c338b920ecb7c56c4e) >>
+>> endobj
+10119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 647.221 144.674 657.751]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae432dca61c738591a5c53f135631c8e5) >>
+>> endobj
+10120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 647.221 202.776 657.751]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 616.292 169.013 627.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab18c32ab9d8e6a7fc785165b6aa4db56) >>
+>> endobj
+10122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 616.292 203.593 627.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 585.737 144.674 596.641]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.414 585.737 196.221 596.641]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a150a3fcf4b23e91a58c5acb8a455fec2) >>
+>> endobj
+10125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.558 585.737 254.322 596.641]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 555.182 144.674 566.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.414 555.182 196.221 566.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a701efa51459fa5353f1620f9a1524f52) >>
+>> endobj
+10128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 524.627 144.674 535.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.414 524.627 201.839 535.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a939f1c932a39f3ac0d579352534ee0d8) >>
+>> endobj
+10130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 494.072 144.674 504.976]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.414 494.072 197.038 504.976]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae8f1b6153c04bde0aac8592ff6edbe36) >>
+>> endobj
+10132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 463.517 144.674 474.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 463.517 191.598 474.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aa29c608bc5c4c8d0b1d42dacc5ff516f) >>
+>> endobj
+10134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 432.962 144.674 443.866]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 432.962 186.796 443.866]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aadf870c4d6fea9b5650aa888c2e79ca2) >>
+>> endobj
+10136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.377 402.407 205.546 413.311]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a27ebe448697b1357cb06c60b471f4045) >>
+>> endobj
+10137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.179 371.852 263.349 382.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad9420cd4a63cbe1e155a94a8064f86b5) >>
+>> endobj
+10138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 341.297 179.554 352.201]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 341.297 204.032 352.201]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad4a1398505beae32e88bdc66625dcf92) >>
+>> endobj
+10140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 310.742 180.54 321.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_af7e70970808607a85d1daa4548c400d9) >>
+>> endobj
+10141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 310.742 238.641 321.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 280.187 178.239 291.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae6ce7cc93a11ff81885948a776dd0e56) >>
+>> endobj
+10143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 280.187 236.34 291.091]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) >>
+>> endobj
+10144 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10148 0 obj <<
+/D [10146 0 R /XYZ 89 770.89 null]
+>> endobj
+10149 0 obj <<
+/D [10146 0 R /XYZ 90 420.996 null]
+>> endobj
+10150 0 obj <<
+/D [10146 0 R /XYZ 90 392.168 null]
+>> endobj
+10151 0 obj <<
+/D [10146 0 R /XYZ 90 247.67 null]
+>> endobj
+10152 0 obj <<
+/D [10146 0 R /XYZ 90 159.691 null]
+>> endobj
+10116 0 obj <<
+/D [10146 0 R /XYZ 90 134.658 null]
+>> endobj
+10153 0 obj <<
+/D [10146 0 R /XYZ 90 134.658 null]
+>> endobj
+10117 0 obj <<
+/D [10146 0 R /XYZ 226.769 77.486 null]
+>> endobj
+10145 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F91 766 0 R /F11 621 0 R /F8 802 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10170 0 obj <<
+/Length 1902      
+/Filter /FlateDecode
+>>
+stream
+x�ݚ�r�6��z
+�Zr��q�x٤�4m&n㮒���h��R(*�߾$Aug�6��(	<�
��)
�8�u�����b�AFR\��$$|�C���ѐ`�ë��0Χ��UDq8�<=$�<��#��������ۛ�H�0�����2-�<.fy4��/&�bQ
���%U�l����Q}�~=��z�y@@ H%H ���t��#���� #ft�X6��2x��p�7�������!k=%��(�W�Y���nJ"� &My:�f�0��6��M�Ʉ��\E���F��� o*��"Lu
+(�)�&4개Ԏ�
��f�\_p���
I���RI��8
+F�.yL�fTϔ�$G��Ny����/^�۽RH�<����VkC��R�t�T��hgA�����4��Y�#WHS���jȘB��`A�u���|��Ң
�,��W���0M�CJ��:��,[�rTԫ:Ϊw��giV��}���U�0����>$�d�d���]��!�`��'�_�k1��	J2D�5U��x��wH��㭿{�7�~���{�����6+���j��FD2S2�����N?l�Fx;E9�"A �BT��Sa���G���8W���DJd���\�S���LJt�pYQ>v%�c:�����B��)�D�nnO�!�{L�S#nN���E�׳��F1r�ᆵ�?Y�H�L�0�i�ko�m��S�墘���O
V�8d�N���tB`@��+�S>-��iAh�4&}Ђ
%1=z��p��p0/�!��O�
`�n�`��K���I�_v뫴l#ΈG
�ZM
o3:$"[e��8[���x�']��A�7��vPP��Ȑ	�(
�O- y6vh�:
�wg��������G��=b�C�ҲWF� �|4#�)��<1�
F8��ۓ,�h�g��
�L7n�|aw�K�	;?1�V�i9߾<;SEg�y*�<K�q~ݲ��6Eiֹ7C�
�LO�ǫ���9}��n�@R�ydN�
��{���6�>�^����K�	����כ<����/v��ɲ���Q��-���]�
��ʿ��>�����="��o�q4� ��'�`��C@�ߞ�=���V�ʽ�KgXk0�(�C+����������L#%��OS6��W�g�y'‚��nݕ6��.�M=���tӌ��)�͑��I��֬O��=b�>�$U_���S0D%�rx����~<

d���Q<��:lܮr4��/%y��
9���>��t7�����9!m��1�N��	'�$
Y��>Mbxwnn��z"n��gy�Qs75,�d�'[P4d@�a�Y
t���_*�)ֶZ�}���|������.Oq��q2����,�YG|����C5�/t�C��}s4�� ���'�`��C@�:��=�C�c
!k�ټ�G UY�0��7��A��M�NZш����9�Ux�l�
+��
�y�+�v�=m.�	�߸W�	մύf�K��P̸ѽ�V�8� ���I���f�x���� 8]��������D�䈝4 at 4�2��E�����ϥ�ݛdz����j��,8T�^�FK{��d�
�d	61�������ZR-uW�V��0W����4&�U��#�4�(-T`�4����EZBB{��&���"=���`��^d0��d,�$<��t<�3�\
�f
Hs 
�o�J��0���������uK��,mW
�W#�Jf

������ȁ�Rv��Ej����n�B¬������ߋ$��2M��7q��'�_Nכ�E�8�%��y���>m�[z瞁��O�;�}P��JQq(�u��b~yqq��_$�=ͦ�����m���Mgy�L����Uv4�
+�a�(�
��`� 芖-��������ߦ,x9�A^U� 6L�/
+endstream
+endobj
+10169 0 obj <<
+/Type /Page
+/Contents 10170 0 R
+/Resources 10168 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10086 0 R
+/Annots [ 10167 0 R ]
+>> endobj
+10167 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10171 0 obj <<
+/D [10169 0 R /XYZ 89 770.89 null]
+>> endobj
+10172 0 obj <<
+/D [10169 0 R /XYZ 90 721.073 null]
+>> endobj
+10173 0 obj <<
+/D [10169 0 R /XYZ 90 658.004 null]
+>> endobj
+10154 0 obj <<
+/D [10169 0 R /XYZ 226.769 605.709 null]
+>> endobj
+10174 0 obj <<
+/D [10169 0 R /XYZ 90 598.735 null]
+>> endobj
+10175 0 obj <<
+/D [10169 0 R /XYZ 90 530.495 null]
+>> endobj
+10155 0 obj <<
+/D [10169 0 R /XYZ 226.769 448.223 null]
+>> endobj
+10176 0 obj <<
+/D [10169 0 R /XYZ 90 441.249 null]
+>> endobj
+10177 0 obj <<
+/D [10169 0 R /XYZ 90 373.985 null]
+>> endobj
+10156 0 obj <<
+/D [10169 0 R /XYZ 226.769 304.066 null]
+>> endobj
+10178 0 obj <<
+/D [10169 0 R /XYZ 90 297.092 null]
+>> endobj
+10179 0 obj <<
+/D [10169 0 R /XYZ 90 240.807 null]
+>> endobj
+10180 0 obj <<
+/D [10169 0 R /XYZ 90 167.434 null]
+>> endobj
+10157 0 obj <<
+/D [10169 0 R /XYZ 90 144.909 null]
+>> endobj
+10181 0 obj <<
+/D [10169 0 R /XYZ 90 144.909 null]
+>> endobj
+10168 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F8 802 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10185 0 obj <<
+/Length 1763      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6}�W�&#X�=Ӈ6M:M�$mԧ4��c��Ē
����/!Ѻ2��'/�D���݃�yr����/���S+ϼ!�
>$�'Vy�
~�'o����v�,��1�
��/?~�b����u��y2�|���(
hf]�~�y�'��,�Lz���Ɖ"�ϫ�u�/�,>��5|���!t�q�+$�@�G�;�
�i��zBt�9�5ˍ3��-n�{k+�ag6�̰���l~U��O�7Ls��*F
�^1[춪�P �=�r�=�=�f�߷U�.
���:c�'�\��>i@�l�Mgů�r��nGWWŷ�r���'xwx}��WC�˰����[+�IT��/��R̻Ř�r4g��E
���ro
����[\�]���^͋�_/������t^l��S�j��"��,F�� �Y�Js�?��aB3Zz5���c����q�
�L�DLpW<+8C�KF�,QU�
����ݠgU��u���t���qr�L9_=��F�*����ٖ@O�\b�a{��[�X�
o��U��MnJ	�2����*�Ի��|�Y�r�
+/�.��|t6�ٮ{wz���: )=���  1�E
`�3�;�;��tz]|���P�^_�}?�̳��d	]yvCH$����
�h�K˙Ê�e��'�k
�B��(Yau}� +��f4�MҷQ
]�Q�X�m̈�����d�`K⊖k�50���Xw6m�ɠ��}Sr�^X�6�
�k���4��}c���`B�3y�s����=B�M��-d��{��#q4���"c�3�R�Is4#�J�u��r���lr߸<�b���
+�
��!H
K
ٶ�p���n�Si�M
+1
��O����)����V l�
+�| ��LK�&1�/%�V5��h�8��H!�#{C�K8��-C�=f	B3�Us�K�V
B�5��wzM
�W�^zE��
R1��+�6��P�J�XZ��+�
+��kU�(��z/�r$�F���?*��7��(�IB"k1.�بX�c+�>,Ţ�V,��b�Y�X�C��ܑ-���ܒ���-)}<���N
�|u���!"!���7��G�
+�r�)so
G���
����D�
��Ëa�x��袧��,-Y�V&�2�MҞ��/eL��q:ɪt�26(��@�&R�u�[o][g)t��%h-)�����S���ScځZ�z�n�Kjc��s�}<�&�6����
+����͂	E�KVb
��
�z=K{�1nz3�N�aMۄ��(��
+��Al
+y
Mp�%�28��=^28XֲS�PA؁��f� 2t���l��pj�pA�+���>q8���
�N�-��{�m���u!L~Ƣ���� !�q�%�i�����X�m+�X�V ��X���k@`��"�Sqk��5��*+9j�;B�*����m��9f��G�ɻ��:m ��l��J�*�{^��H�p7XJ0E���S+�v X�Pc�yJ�,�  )��)�����<
��Q����/��s�A���Q�mW����f6��P� �s`�9��r?"�����U�>�k��9˄3띻hi�sGQ#���-�_�-nQ���A&Kr����,�>o~��������������c��:����>����F�Â�*:�HE��I��Wϋ/���ُ=�����
Nn�e5D���trBqQ0���B<�^_"�.��T�?.����
Q�dÿ-�u�eק''g7�tr��O���|�{ƗE�C��
Og����0�5����I
+endstream
+endobj
+10184 0 obj <<
+/Type /Page
+/Contents 10185 0 R
+/Resources 10183 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10086 0 R
+/Annots [ 10182 0 R ]
+>> endobj
+10182 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10186 0 obj <<
+/D [10184 0 R /XYZ 89 770.89 null]
+>> endobj
+10187 0 obj <<
+/D [10184 0 R /XYZ 90 720.814 null]
+>> endobj
+10158 0 obj <<
+/D [10184 0 R /XYZ 211.835 668.52 null]
+>> endobj
+10188 0 obj <<
+/D [10184 0 R /XYZ 90 661.546 null]
+>> endobj
+10189 0 obj <<
+/D [10184 0 R /XYZ 90 593.305 null]
+>> endobj
+10159 0 obj <<
+/D [10184 0 R /XYZ 211.835 541.011 null]
+>> endobj
+10190 0 obj <<
+/D [10184 0 R /XYZ 90 534.037 null]
+>> endobj
+10191 0 obj <<
+/D [10184 0 R /XYZ 90 465.797 null]
+>> endobj
+10160 0 obj <<
+/D [10184 0 R /XYZ 211.835 411.718 null]
+>> endobj
+10192 0 obj <<
+/D [10184 0 R /XYZ 90 404.745 null]
+>> endobj
+10161 0 obj <<
+/D [10184 0 R /XYZ 211.835 349.879 null]
+>> endobj
+10193 0 obj <<
+/D [10184 0 R /XYZ 90 342.905 null]
+>> endobj
+10162 0 obj <<
+/D [10184 0 R /XYZ 211.835 288.04 null]
+>> endobj
+10194 0 obj <<
+/D [10184 0 R /XYZ 90 281.066 null]
+>> endobj
+10163 0 obj <<
+/D [10184 0 R /XYZ 211.835 214.245 null]
+>> endobj
+10195 0 obj <<
+/D [10184 0 R /XYZ 90 207.271 null]
+>> endobj
+10164 0 obj <<
+/D [10184 0 R /XYZ 211.835 152.405 null]
+>> endobj
+10196 0 obj <<
+/D [10184 0 R /XYZ 90 145.432 null]
+>> endobj
+10183 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+10203 0 obj <<
+/Length 1449      
+/Filter /FlateDecode
+>>
+stream
+x��X�n�F}�W�(В\��"4�4	����ON���"J�E���w�KR$%3��>�o��gg��Y�
���|1;y�X`��T���@q����ep�$�b�1�"�ä�$�"��"����2�x�^�I�e>?Ms��_|�)#�C�ݦE
�T��y�l���ܮ���/�3M�eч�7��O3�p@<�����
,��� #ftpW��2�f����n��]��]���ۭ6c
(�~�綺-�m
fl��Ľ�D#�M�3�Wk�w��K~����_��6��W��H��.�!��^}q N^R�_S0X��^�=�̏R�7�#�I;�Z�[?f��ž�1��w஑�b���X1�.
=(K
E��"s����,�a%� �x %�ɩ�R؈�»@�)"@ )Ҭu1
+�	=C�!PJ�2G�@)��!�Q�CH�� �0��
�r
�!��H���v>O+[&UQ��ō�{�̇�=8���ȷUã~5 j�r�5��
 0��P����Bt?�'���l@��|�kA<�>�>Ł�i�!�2B�y�i�A�0H��c�\)pk?�y��IJ�=�r�"��12N"��Awi���ޔ4�9����R|`�ni_g\�����$<\�/���t��5Y����EY�e�g�ߵ��1���pJ���hϞ�Y�d�+ Š����=E�2���
+���P5Dq�)N����$��ܥY�(J3r�ɾl�)
Ą�}� ��
M;E���r?��$%8")oq���l��`C%x��dRE�c$Lp(��i**��PP=HEa��((5p�Ax��
+�w���FL���S"��3�VDɄ�b�$y���Y`ZF��_�QN�2J�dhD�cd��l���>VF��HzĊut���r%�`��2�5�����A
������>�)�SL2��I��Z����b��b�,��o:����j��i<,v=�����<\�܅�
�,6���U�eED9��� �4��Am f![���#N�������
����w��ѺJ�V��S9ԗ��� $T]
0
�§b���K�	d�q(�LY9y�!k����½�r�`pF�
���I�LP�q�p
���Eu���s��Th˺�5%��xñ�'�
��ɖ�}��Q�Uj�CD�1Gʦ�}���vi��Do�k&�曺��[
+)މ���#;����v؏
+\l�+��9f��׶L����y�&נ��
>s;�}�ɞ���|R��]n�`@��ԧ�O�� �z@�����k^������h��+���\HX�h�	>����\#�{����ђ�5R!��
�ȳ�S��֖�GB�M��-�o��-j��m�]���o�;K�(fP8�ٖ�
ڟ�_~�����!
+��������������t?'z{1��}
6E�5Y�妮����N"����M|1Q�6����_օwֿ�E
+endstream
+endobj
+10202 0 obj <<
+/Type /Page
+/Contents 10203 0 R
+/Resources 10201 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10209 0 R
+/Group 10198 0 R
+/Annots [ 10200 0 R ]
+>> endobj
+10197 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Linear__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 10210 0 R
+/BBox [0 0 214 206]
+/Group 10198 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 10211 0 R>>
+>>
+/Length 480
+/Filter /FlateDecode
+>>
+stream
+x��T�j
1
��+��H~�B!�Eہ.B7��)%7�t�߯�=��f]���G�H��
�G �a m��	�« ���3\
������%n��.��%�I�G`%�����߸@���Dc
Jo"*؎����
{U��8[���bV�<�-{Y�0�(c�޺b��aY�E\�
8y���)9�G�c2�I�<�Vv�4-7����(0�A�l��zl����N����4�"�T
�
���x+Hj˶\Ji��4ev�p�
+l�n��95>�Y3��@o�kd�_�`Ω�2v�c�����Q�\�˄"���544uV羫	<�}�� �U�VC����CXx'�ŭ�[�b΁���>�u�=�N�@ar(��5�֐�DE�a�:s޾�K��������n���ۂ��֭M�΋u�W֌
���
��t�/�2�(
ˌc�>�	�D����]3������ū��UM3>'���|X����$~�?/
+endstream
+endobj
+10210 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+10211 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /JEERLX+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 10212 0 R]
+/ToUnicode 10213 0 R
+>>
+endobj
+10212 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /JEERLX+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 10214 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 556 667 500 556 500 278 611 722 667 278 460 500]]
+>>
+endobj
+10213 0 obj
+<<
+/Length 10215 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š�2v@�2ݸ��>@LN�B�!:
߾1�B
+��������=wf\Y��f����h��e�9Il��h�35�5Rx�I�$�����4uF�IӰ�Ë��6vxR�@	c,}s��h���u��Y�C��eI�2Eڗ{�UL�Ґ|���u;�������s\IΊ+$9a��4�?-k�?mBF���i���
p��@y���
TBS�
+yt��I�#��Agh� �@��@e����*�7Ӂ
+�g�%:p��ѝG���.@�W���
+7��W��W�q��c��OYԢ�"�&�`ҾQ�
�7����څ���

�7��v�
+�/����
+endstream
+endobj
+10214 0 obj
+<<
+/Type /FontDescriptor
+/FontName /JEERLX+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 10216 0 R
+>>
+endobj
+10215 0 obj
+344
+endobj
+10216 0 obj
+<<
+/Length 10217 0 R
+/Filter /FlateDecode
+/Length1 2404
+>>
+stream
+x�UV{L[�?��.ص�
0$16ƄG��H��6�ap���N

5�a������)M�G*UkiӒI��i՞�ڭ�4E]�?%��i�D�vҦ>Ȧ&�贶�z�{
Iv�s����������È1�Úgu#��Y��g�� ��N�
_�ٶ���x��Xr�?-�eL�ϟC�c��ڙ�>9_�#�렏���J�$K��@��N���
+�
��	����Q��T�F���n��s��N��k|u�� ���& ��
f���*2:�v�E#z�^W񉹡O��f��{�����
+W
�I��j��y�g�2k��m��y3�E�E0�EO@�:�\�����	�}�u9ʴ9&��̖���hMn������ù�%��mM%�=�}�
M�X��h���Os?�K�+���rw$�nu�
+s��mq��宩�~߱+�7�k����0��������Da?�
+����͝/�x��
�?�(�p&�`��;�ؔ�'�|Zq���p��˛�.?��荋��������wE��]��wi�����Z�J�V&�[3g���>޺�Ƣ��
��5�`?�	�]����o-Ӛ-ȇ��"��™�م�t8
��r����yi�tˑ����G�3�.brf.*�g&x}1.�
��g�g�
+6*|���M�4�V��Qd3o�����9��87�P��Z�R�eq�Ϡ˄�
.�q
+z����'+��
��d�.���W��UDZ��J�n�
!V3+e��n�ƒ�X at J��c�h�r���IZ$[Ul�7<>8��ӝsE��4�(��@߭�����c��W:��\�2�H�b�y~2<5:|�z���Fܾ���β^��'�
����C�Ѩ�WhOի�-�r�
+��١#陡D�G�\�^���]�A)�N���Y+����{2���{9Cql�s�����~`��V$W�Q�
9���t?���މ��S��ƮO�Xk�;1����/�9���6��~7�
H�fu��� �Ul�vM���^O������t��-�_َC
݃�Os\����H'irw��G���1����
�]��w�_���(=O�� ���>�ތ�V�����q�T�5 ����g�;��_
]\L �W�R>���Yl\�Ɩ�Ɗ���Al"�S��O�%���@�}�?�M����J�t���l���
�A��l����TK��C	�l�A�)k�	�/hsU�
w���8���ŦZ1�>5rM{iw����,�di���H<�r�8�&Sн��7����
��x�����s��Dm�:>|�7������>�tC�
drYL$#?7!���EY�ƛX��2f��?��̓{*�A"9�9}(}
!�<�����͛�I��n���5&�K�O���m���_�O��&[QaE�
o{{��ҫ%&u8��M�/����cZ����x��D �HB���WJ�DK�
�p��᭐����N�z_������u��/����c�j�x�[7?J[�q]�7�	M
+q�lbr�̉�i:hL>�xlr���K��v�JY͌�����O2�j�sǖ�`f���QT$�J3V��#�W��@W��䡚�����b ����@�¬�8�XV�j��x�ha�W<_������w��Z�}L��|�nлe��
�/lP��m4h����J��X?_aC���
�ZX�Wgn�v�OX�֙��17F1F�V�~��eo�
BΨ��Y��|�	�Ϭ{F�t�鱷cӮcj30���"��2�@���!��=F�w�7*�[T���W���
H�
�f�%
�kp�Ѭt���hW�{�H1SBN
�й� �����T
+endstream
+endobj
+10217 0 obj
+1809
+endobj
+10198 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+10200 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10204 0 obj <<
+/D [10202 0 R /XYZ 89 770.89 null]
+>> endobj
+10165 0 obj <<
+/D [10202 0 R /XYZ 90 683.788 null]
+>> endobj
+10205 0 obj <<
+/D [10202 0 R /XYZ 90 679.305 null]
+>> endobj
+10206 0 obj <<
+/D [10202 0 R /XYZ 90 610.731 null]
+>> endobj
+10166 0 obj <<
+/D [10202 0 R /XYZ 90 576.061 null]
+>> endobj
+10207 0 obj <<
+/D [10202 0 R /XYZ 90 571.577 null]
+>> endobj
+10208 0 obj <<
+/D [10202 0 R /XYZ 90 500.846 null]
+>> endobj
+1914 0 obj <<
+/D [10202 0 R /XYZ 90 410.009 null]
+>> endobj
+386 0 obj <<
+/D [10202 0 R /XYZ 90 402.401 null]
+>> endobj
+10201 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im16 10197 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10265 0 obj <<
+/Length 1769      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�6~ׯ�S+�T0� 4Mgr؝���}�3Z�dN$R!)��H��%+�&?�����~��. at bD��4���� �K���bpr&�!���e\,
�
aJ�-����/
fوH
fŏ��y}q���\�68�|�	$�����z��6���,̤m|��
�2��2�pI�X#I*�IW^9a��x�̌��ə�
3��LfcJ��=����\���c<�i��ڌ`���.
B9
�0���
+���
+�l�0��`1���v{5Õ;�z��Z_� �>�z�ȅ����Z���/]O9���M��֬�F�}�9n����s�9Q����\-F��*��� �4�)M�3-S�	�Y&Wr��H�|�Z�hN��2�ј�j������82
�d#7_�+�x�;���C�ɿ �ɇ���-�A/TzP�k�[�&�� ���ۼfY?�C z;n�zN���b#Bȷ�_ڥ�H�C
�������Is&r>�TY~�B��)Z�$�3=�o�(�$���I62-�U�H�7+'Rz����qT Ӵ���&#J�,�m�K��Q��V�!/O������F�0�l�o
�Um%4�
.�<5�34�,�Y|[�-�ב3��LЏO=�j�����X`(��Ѻ�BdH6�y8=��7��
+��Û�C5�nC��K6��l�}Øq
��,;*3y��	c{k@*iA��*�TQC �
���F�嬶�x��wS�Y�	�yn�%ƬF�?A�֗��5|�p�

aC�$zg�"�A�R®��K����T�ҡ���r��tf�*���-�3#��0F;
+�H�!D1c,sĈ ��m���DXҶ�%�R�C��
�B7[�K7i0�,I:�L�f��3�Eюھ=b���"𕈡�I��
�K0/q	ܖ��
\B$4�k��Y���[!�835�q�O�]p����L$�
9-l�@&�؀>��H�D��E%�}1	�wH���0,R

��!�\����19�L�`E2ѷE2��v�PE�h�2i�dw�uAR���us�j��e�[	J"j�7;�G
iT�LC&�]4đ�ɞ4�ŷ���:h(��|���DBX)\�~
ELDK��z������o�;������$�ُ
�1b�A��ߧ@i�u�:{�
��s%uJ�3ܵ��}���5�A�W����S_-4#�Й
�M��q�p2Iޠj��eI�
~Rz�
O��j
f,������gߛ��2��Wd�޵����˘x<�o��T�Ψ��f^��dL��X
�
a3$,q�h~{�w
�N��^7�fd���!7��
+}x��F��P`6��ڻW(�@�[�	[N����/R�os�ζ)
YeI�e���
g[}��J���ʁ��ݰ

bAe�0R���fg���Gy�{�d����6�FQX�ip4����*ܨ��듚��ގ�ı�7cھ&h�J�g��,�^j�NsU�7?Hɯ�ϕ���ϰ9���
+R��cl�޼���z���g�%}����F��;����]�,��PW�����ҒVf��
�Ⱦ�R �{��
�
�6��>���U�50��
S���=�9Q"�:j�,J����E����o��&ē�?��4�R">	���u�c6'}p�|͌g>ۉ���N`�M
�o��G��٢�]`o߾L.�
+U���a
+�+��:�Q
��qY�Þ 
��
%a��,�>����<�%�12w���h399��.�
/��_����a��"����[-x���� ���!
+endstream
+endobj
+10264 0 obj <<
+/Type /Page
+/Contents 10265 0 R
+/Resources 10263 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10209 0 R
+/Annots [ 10199 0 R 10218 0 R 10219 0 R 10220 0 R 10221 0 R 10222 0 R 10223 0 R 10224 0 R 10225 0 R 10226 0 R 10227 0 R 10228 0 R 10229 0 R 10230 0 R 10231 0 R 10232 0 R 10233 0 R 10234 0 R 10235 0 R 10236 0 R 10237 0 R 10238 0 R 10239 0 R 10240 0 R 10241 0 R 10242 0 R 10243 0 R 10244 0 R 10245 0 R 10246 0 R 10247 0 R 10248 0 R 10249 0 R 10250 0 R 10251 0 R 10252 0 R 10253 0 R 10254 0 R 10255 0 R 10256 0 R 10257 0 R 10262 0 R ]
+>> endobj
+10199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 686.177 192.544 696.105]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+10218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 630.109 191.16 641.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.976 630.109 256.733 641.013]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.258 615.425 364.14 625.33]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 602.088 191.16 612.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a701574facbfd5461d399dccbc88a2999) >>
+>> endobj
+10222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.497 602.088 295.747 612.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 574.066 191.16 584.97]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab33dcdd2d3caf28d71cf7d3f2270535d) >>
+>> endobj
+10224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.497 574.066 295.747 584.97]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.4 574.066 375.158 584.97]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 534.09 191.16 544.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_af7ecd20eda142aac578efabe2cddee72) >>
+>> endobj
+10227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 482.159 191.16 493.063]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_adfed1afbbfc5b41dac982e9e1f43883e) >>
+>> endobj
+10228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.194 482.159 351.951 493.063]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 430.227 191.16 441.131]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a297e7ae510626af6f52a9aeca8154f53) >>
+>> endobj
+10230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.711 430.227 355.354 441.131]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 378.296 191.16 389.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a7776ccee499dd435c4b95d8627849eda) >>
+>> endobj
+10232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.356 378.296 353.999 389.2]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.601 378.296 464.358 389.2]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 326.364 191.16 337.268]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 326.364 242.706 337.268]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_af50d791f3a12296299a8aa7579ef5758) >>
+>> endobj
+10236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.043 326.364 347.293 337.268]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 298.343 198.909 309.247]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae9cc837bbae1745ada3780634c73858f) >>
+>> endobj
+10238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 270.322 191.16 281.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8ae08699620424e3c3c97dd7a3885d02) >>
+>> endobj
+10239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.961 270.322 406.719 281.226]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 242.301 191.16 253.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab60766264325cf8fc82be004b2565ddb) >>
+>> endobj
+10241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.976 242.301 230.163 253.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.976 242.301 301.734 253.205]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 214.28 175.668 225.184]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.166 214.28 234.596 225.184]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae) >>
+>> endobj
+10245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 186.259 208.395 197.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5812366691d9099f839e01326923425f) >>
+>> endobj
+10246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.211 186.259 273.968 197.163]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 158.238 170.687 169.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+10248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 158.238 195.165 169.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aca00917f32f160b28b9870beb5ce5f8d) >>
+>> endobj
+10249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 145.597 170.687 156.127]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+10250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 145.597 187.563 156.127]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a033a152c478db97a4e08bc562dbff4b1) >>
+>> endobj
+10251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 132.583 170.687 143.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) >>
+>> endobj
+10252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 132.583 225.501 143.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac455ad97639d9e7f59dbdc22e35dc1e7) >>
+>> endobj
+10253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.316 132.583 264.504 143.113]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 119.195 179.554 130.099]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 119.195 250.666 130.099]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac1b93dcadc82e52690114301554801b0) >>
+>> endobj
+10256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 91.174 220.579 102.078]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ad44ed4e61b7e7c0c86918b66f44ec665) >>
+>> endobj
+10257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.395 91.174 290.038 102.078]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10262 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10266 0 obj <<
+/D [10264 0 R /XYZ 89 770.89 null]
+>> endobj
+10267 0 obj <<
+/D [10264 0 R /XYZ 90 704.173 null]
+>> endobj
+10268 0 obj <<
+/D [10264 0 R /XYZ 90 649.165 null]
+>> endobj
+10269 0 obj <<
+/D [10264 0 R /XYZ 90 649.165 null]
+>> endobj
+10270 0 obj <<
+/D [10264 0 R /XYZ 90 591.389 null]
+>> endobj
+10271 0 obj <<
+/D [10264 0 R /XYZ 90 511.436 null]
+>> endobj
+10272 0 obj <<
+/D [10264 0 R /XYZ 90 407.574 null]
+>> endobj
+10273 0 obj <<
+/D [10264 0 R /XYZ 90 343.687 null]
+>> endobj
+10274 0 obj <<
+/D [10264 0 R /XYZ 90 315.666 null]
+>> endobj
+10275 0 obj <<
+/D [10264 0 R /XYZ 90 289.371 null]
+>> endobj
+10276 0 obj <<
+/D [10264 0 R /XYZ 90 231.602 null]
+>> endobj
+10277 0 obj <<
+/D [10264 0 R /XYZ 90 203.581 null]
+>> endobj
+10278 0 obj <<
+/D [10264 0 R /XYZ 90 136.568 null]
+>> endobj
+10279 0 obj <<
+/D [10264 0 R /XYZ 90 108.496 null]
+>> endobj
+10263 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F39 2335 0 R /F11 621 0 R /F24 537 0 R /F111 1509 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10336 0 obj <<
+/Length 2016      
+/Filter /FlateDecode
+>>
+stream
+x��[mo�F��_�O9	���B.I#(�s�"m�s|�$ hje�H�K�Q��rI��WmQJ.0`��pvv�ץ�uoa���?oo\f���[�S�ǖk�������0$q6���zD�0��ap=�x�%����a�.���|uy�.NE��|Y�#�
��q�����ë$�R_ވ��ߧ�P���
uF�n�r;�<  
���A�gE���Oؚ���,���Y�%�ܲ)���z?�� W����q���
�̳\B!z�i�x���a��~�21
Qg�c�"-�"�B^^FY*� W)7�V"����7%��h���Z��#v�N6�?F�P}
�%���<OF�r �M�y�Ʒ-T�m�
+J��5&6"�iU܈b�������w [�M�2o@�[� �S&)>h���]�)�	�TSp��Q���*3-d#������Ұ%�!~M�6Բ��1q\�}����P�?��7�Ep㏸3���Θ-��7/�{Q
��C�
D
+=Rry��"3B��Xj`� �u��&���S��Y6��E*��

+��wA�D��2ɽ��ũh�Lx�05���\���n��@;
+P�l�sX�n����G��pD(��M� (���x��(����.K��m�V�UW^�V:��Ա������R���EvP%��Vɘb�����Ȯ��j)@��U�@��8Z5�]4�OU;���F�A~�^t̿	
����l��\��&�\�J;�5
9ڡ�Q��1\
,�d�6	*��)p�!o���!v�0n@�N��
����
�?
P�)��^r�2���KtFM���a|@
7&��Za.�������
&ɖ��BD�����=�O��
���sBiQ��[�X��7�����,��!C7�ja䒞.E+�
���sq�YL./5̣"�kom�byv㊯w��dz��]?�[�[k1
�S?�cU����*R���Dt��1�bp��)�#0]�P>��T۾�$x��+�,9�4��o�gg�
A�aDXc�"_���A\iP�	��4YU݌�Q�]��z�Sj�[$
��xl�sh�� ���L
q<�nJe��{C�����ϕ�]�A�:�
5���F�}ހ"�c<���
?0�0�Fk�@�
+d��x��v��Ȋ0	�g�4�[B�s
�${���˖5\�l
��U膍֣���U�o����(Z.�&�[�D��\�y��tF�}V �c��k�_��b���4\�}�%�����l^�8�
��4���Ol����T��<��Pv�\6�g
3�M�"��9s'�(���r�8�����uyi
�2�{sVV��sӄ#��M�f�����o��Vm]�B���w��ч����>ǣ�"�q�j�R��,rV]�+��,|�
���(�Sٱ�	�"�w���d�k��4%{ �v�e�����Q`)�������f�l!�i�ۖ�!���~m��و�+��
��w��yJ�N�p�ױc�c�
�`-�̜��`&���#���.e.
,k��t�K��XXI��RL�QY��
]��Pp^GÍ�W.�_Un���M���kݝC)���0G>��p�8E6V=F>.��(�J�' rh
��0�׎�n�k�Վ�e	)����F�8��v�a"��}@����cY�Ӈ�����c��	��G�
O2�?�0�]����
3?���x.ٷYnu�ɴ�9����N��
Z
=�nF����*[�Zy<_�#��Fi��<��хiR{|/�}� ��i2��S�M�yk�hN��ŋ��0	����������)��y���˾2�d���>
N&C������s�~�3����bX
��6�0hC�<L��Y�o
+�8ԏ~�?U
Mg9<��N�_t�U�
_t�_lo�wX
d9 at _.v[���������?T�[����z��p��k�u�#�@��Z�����=D
��U_������(zp�PdV�ˋ���=D�{e�q��a�)��u�gyc�r�u mֺt0����� �~
`��[�:
+?����������9�~�@���'���1
+endstream
+endobj
+10335 0 obj <<
+/Type /Page
+/Contents 10336 0 R
+/Resources 10334 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10209 0 R
+/Annots [ 10258 0 R 10259 0 R 10260 0 R 10261 0 R 10287 0 R 10288 0 R 10289 0 R 10290 0 R 10291 0 R 10292 0 R 10293 0 R 10294 0 R 10295 0 R 10296 0 R 10297 0 R 10298 0 R 10299 0 R 10300 0 R 10301 0 R 10302 0 R 10303 0 R 10304 0 R 10305 0 R 10306 0 R 10307 0 R 10308 0 R 10309 0 R 10310 0 R 10311 0 R 10312 0 R 10313 0 R 10314 0 R 10315 0 R 10316 0 R 10317 0 R 10318 0 R 10319 0 R 10320 0 R 10321 0 R 10322 0 R 10323 0 R 10324 0 R 10325 0 R 10326 0 R 10327 0 R 10328 0 R 10329 0 R 10330 0 R 10 [...]
+>> endobj
+10258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 708.331 297.728 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0ed481e43baf024d4a5b5e86e85c4a87) >>
+>> endobj
+10259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.544 708.331 336.732 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 682.118 193.76 692.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_afda2273cf9b1d62249e3604c2c538d92) >>
+>> endobj
+10261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.576 682.118 232.763 692.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.933 655.531 342.261 666.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa8f43e35dec15be4374b207a9440eb2c) >>
+>> endobj
+10288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 629.318 238.293 640.222]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa74c2bb5c2c947d02fabe33f854fa7d6) >>
+>> endobj
+10289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 603.105 197.885 614.009]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a51f1b18014b098a53242c06d657040c6) >>
+>> endobj
+10290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.222 603.105 302.471 614.009]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.036 603.105 355.223 614.009]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 590.995 197.287 601.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac9ef23a57b1e85eb8c0e905b16feda93) >>
+>> endobj
+10293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.429 590.995 300.678 601.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 566.93 214.442 577.833]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a74deedff2114e5a1c72305ba6c6e42ed) >>
+>> endobj
+10295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.584 566.93 317.834 577.833]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 542.864 233.76 553.768]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aea8819f3edb590eff758fe295c7f3300) >>
+>> endobj
+10297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.575 542.864 272.763 553.768]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.205 542.864 323.393 553.768]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 516.651 242.965 527.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae9de3534d98524f48d9f6c0cdfbf239c) >>
+>> endobj
+10300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.303 516.651 327.079 527.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+10301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 490.438 231.1 501.342]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aa66d8fe880ea6f99aa1a70805427d9d6) >>
+>> endobj
+10302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.915 490.438 270.103 501.342]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.916 490.438 345.559 501.342]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 478.328 246.034 489.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a34bbf3ed8e75730f44ca8a461881adb6) >>
+>> endobj
+10305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.522 478.328 360.71 489.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 452.489 164.879 463.019]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ac220e6f2cf884a8b2bb4017fc9ae53da) >>
+>> endobj
+10307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 425.902 272.783 436.806]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae25d01221fd2014bead64c551c33c9c5) >>
+>> endobj
+10308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 399.689 191.718 410.593]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+10309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 399.689 288.852 410.593]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_abca5613972564c8ec5c832bc8ff200d6) >>
+>> endobj
+10310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 373.476 191.718 384.38]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+10311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 373.476 303.079 384.38]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3a808cf2742df02d856a8d9882845861) >>
+>> endobj
+10312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 347.637 150.493 358.167]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5bb7f6903958069b19f70d1391987a51) >>
+>> endobj
+10313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 321.05 181.845 331.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab48b93c69098ab1dccd8d063f9c41575) >>
+>> endobj
+10314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 294.837 181.845 305.741]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) >>
+>> endobj
+10315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 268.624 154.727 279.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) >>
+>> endobj
+10316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 242.785 176.505 253.315]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a298a32e26d8133869f28560cca4ba73b) >>
+>> endobj
+10317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 228.632 450.955 238.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) >>
+>> endobj
+10318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 205.239 169.013 216.143]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aadaa110a051cded2af6bb04516e8b72e) >>
+>> endobj
+10319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 205.239 250.079 216.143]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 179.026 191.16 189.93]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6e35bc42eb22008e842e81b150eeab6f) >>
+>> endobj
+10321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.497 179.026 295.747 189.93]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.4 179.026 379.044 189.93]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 152.813 191.16 163.717]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a37e6e92bcce55054b61338c740ecabe6) >>
+>> endobj
+10324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.497 152.813 295.747 163.717]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.4 152.813 379.044 163.717]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.133 152.813 488.89 163.717]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) >>
+>> endobj
+10327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 126.6 182.044 137.504]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3878ace0dfcc23f80d55d206d2117c84) >>
+>> endobj
+10328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.381 126.6 286.631 137.504]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 114.864 175.748 125.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8a1eeaa7f9845c9d33a22c8c5f5acab2) >>
+>> endobj
+10330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 102.38 197.337 113.284]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aeba04371a7fce3d1b5a20b287937feea) >>
+>> endobj
+10331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 90.643 176.495 101.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a61a01c066394a2b9ee5d797f6733c5e4) >>
+>> endobj
+10332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.832 90.643 260.608 101.173]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+10333 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10337 0 obj <<
+/D [10335 0 R /XYZ 89 770.89 null]
+>> endobj
+10338 0 obj <<
+/D [10335 0 R /XYZ 90 721.073 null]
+>> endobj
+10339 0 obj <<
+/D [10335 0 R /XYZ 90 698.163 null]
+>> endobj
+10340 0 obj <<
+/D [10335 0 R /XYZ 90 671.95 null]
+>> endobj
+10341 0 obj <<
+/D [10335 0 R /XYZ 90 645.737 null]
+>> endobj
+10342 0 obj <<
+/D [10335 0 R /XYZ 90 559.333 null]
+>> endobj
+10343 0 obj <<
+/D [10335 0 R /XYZ 90 468.533 null]
+>> endobj
+10344 0 obj <<
+/D [10335 0 R /XYZ 90 442.32 null]
+>> endobj
+10345 0 obj <<
+/D [10335 0 R /XYZ 90 416.107 null]
+>> endobj
+10346 0 obj <<
+/D [10335 0 R /XYZ 90 389.895 null]
+>> endobj
+10347 0 obj <<
+/D [10335 0 R /XYZ 90 363.682 null]
+>> endobj
+10348 0 obj <<
+/D [10335 0 R /XYZ 90 337.469 null]
+>> endobj
+10349 0 obj <<
+/D [10335 0 R /XYZ 90 311.256 null]
+>> endobj
+10350 0 obj <<
+/D [10335 0 R /XYZ 90 285.043 null]
+>> endobj
+10351 0 obj <<
+/D [10335 0 R /XYZ 90 258.83 null]
+>> endobj
+10352 0 obj <<
+/D [10335 0 R /XYZ 90 221.658 null]
+>> endobj
+10353 0 obj <<
+/D [10335 0 R /XYZ 90 195.445 null]
+>> endobj
+10354 0 obj <<
+/D [10335 0 R /XYZ 90 169.232 null]
+>> endobj
+10355 0 obj <<
+/D [10335 0 R /XYZ 90 106.365 null]
+>> endobj
+10334 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F11 621 0 R /F66 3165 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10439 0 obj <<
+/Length 1222      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�H��+�4�*Q�{K>N�L%�x������dhl� �H'����ȬAƘʁRk�~���x��l��m�;�:��
�
ȅ>�k�a~�T�;B��.����{~ѽJ�λ��-�o!�s
J������{� ul�=�F�>��U�S
� Hx:L�e�Y�1�8��*q�oZ�����֔ƨ<���[���$�'^ę�3]ű�hN�Q艐�\�
!|a*��8BF����~GwE >g����� ��{�����b��~��c��z��u��c7�#��+�r��W��^io#��
�4��J&��I&+�Wf���'~~�a.�������ʍz��ƑI���U>��B�
F��܀
�ղc�
!��U~2�S� #����/�ܑ�C=A��̈́׃��q��~� D���c2�#{h��z�'[�t5D[/㇊�&�F�u�3��5�
�ښ�Vk����
��
A^ ��ZԁHS%9�4c�&j��Hk	C:e
RV��Z|&�t�Mf.��E7*AX��K���a�>
+gE�
b}\����KѲ>�+3
�U�&a�zU�C��oƲ"�cr�i��*��G���`�ʮdc$!���H(�?��S�.y�L�
��R
+!˄ (g���4��Rn♃cieҍM

�v<�v������ƛ���(��
��p�.I���� ��%"8�
�
T8�� T暓��:E�4��}�fz|�Q��f��@�ց��y��Ix����T�������,�S/RC� ���S��_��/l����'���E0��`���(�|Ǹ��+�����ڀ칸)�_����k�^Ҳ�����0SD�
C�vڹ;�z}�r�R8qH���\��m�ۆ�c�Ӌ�Y<��~��f��Y�`:L
rcx8�
A�����?���a��(���3=U���ɋ
+���A��♃�L6�'�.�K�
\2��W�\�v ��SK�9 !�V���
+[�����UU�M�M��IF
b�YWv
g�
�
m�4�LiO�<
�m�3�,�JcW��
��h{"m7R�7O
+%��6O�M�dȝ���k
A�ӆ����8�Y�).����ja�8K˳*�Y3���\���!��̯n������XE�L΍"S�`⎪n�i�󧢪�!�`�Sl@ӢW��l��73���u���$d����>I�g����.V�
���RMv

�Y��a#?,���@_�ݴ�Q�9q�
+endstream
+endobj
+10438 0 obj <<
+/Type /Page
+/Contents 10439 0 R
+/Resources 10437 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10209 0 R
+/Annots [ 10365 0 R 10366 0 R 10367 0 R 10368 0 R 10369 0 R 10370 0 R 10371 0 R 10372 0 R 10373 0 R 10374 0 R 10375 0 R 10376 0 R 10377 0 R 10378 0 R 10379 0 R 10380 0 R 10381 0 R 10382 0 R 10383 0 R 10384 0 R 10385 0 R 10386 0 R 10387 0 R 10388 0 R 10389 0 R 10390 0 R 10391 0 R 10392 0 R 10393 0 R 10394 0 R 10395 0 R 10396 0 R 10397 0 R 10398 0 R 10399 0 R 10400 0 R 10401 0 R 10402 0 R 10403 0 R 10404 0 R 10405 0 R 10406 0 R 10407 0 R 10408 0 R 10409 0 R 10410 0 R 10411 0 R 10412 0 R 10 [...]
+>> endobj
+10365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 685.406 203.075 696.31]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 685.406 296.324 696.31]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 670.9 346.908 680.805]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 658.113 194.297 668.644]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_abaf335015f8c71026d2bee65ce4d109f) >>
+>> endobj
+10369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 630.446 188.759 640.977]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_aea20a64dc7e9dd789fb069c7b8faca16) >>
+>> endobj
+10370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.953 602.406 238.203 613.31]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.942 602.406 268.08 613.31]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 505.998 191.16 516.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 505.998 232.465 516.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) >>
+>> endobj
+10374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 505.998 337.051 516.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.208 505.998 460.457 516.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 478.331 191.16 489.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 478.331 232.465 489.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a4d372c4dff7d328d3da118817ed3d8b7) >>
+>> endobj
+10378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.28 478.331 271.468 489.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.281 478.331 316.469 489.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 450.665 191.16 461.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 450.665 232.465 461.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a9dd6ce1cb02b58fd3b973e40867362ac) >>
+>> endobj
+10382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.28 450.665 271.468 461.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.803 450.665 382.052 461.569]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 422.998 191.16 433.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 422.998 232.465 433.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_af5bbfb14fef626aee9f34e71a78c0d7d) >>
+>> endobj
+10386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 422.998 337.051 433.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.705 422.998 389.893 433.902]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 395.331 191.16 406.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.557 395.331 232.364 406.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a49574f120ec3f9fbfda58d6f826587e9) >>
+>> endobj
+10390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.305 395.331 486.554 406.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 367.664 191.16 378.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.557 367.664 232.364 378.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) >>
+>> endobj
+10393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.5 367.664 336.75 378.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 339.998 191.16 350.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 339.998 232.465 350.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) >>
+>> endobj
+10396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 339.998 337.051 350.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 312.331 191.16 323.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 312.331 229.964 323.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a72b6b45299672d85c7984392454296d6) >>
+>> endobj
+10399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 312.331 334.551 323.235]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 284.664 191.16 295.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 284.664 229.964 295.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) >>
+>> endobj
+10402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 284.664 334.551 295.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.707 284.664 457.957 295.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 256.997 191.16 267.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 256.997 229.964 267.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a114f91c420cc8060d6834730c8e55721) >>
+>> endobj
+10406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.78 256.997 268.967 267.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.781 256.997 313.968 267.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 229.33 191.16 240.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 229.33 229.964 240.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a9075dd07574234cc124e6076c272e987) >>
+>> endobj
+10410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.78 229.33 268.967 240.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.302 229.33 379.552 240.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 201.664 191.16 212.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 201.664 229.964 212.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a8d443d5098921978efd7b625000f3b68) >>
+>> endobj
+10414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 201.664 334.551 212.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.205 201.664 387.392 212.568]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 173.997 191.16 184.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 173.997 229.964 184.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) >>
+>> endobj
+10418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.287 173.997 484.536 184.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 146.33 191.16 157.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 146.33 229.964 157.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab4396e8bfbdd5831fd37d13c19194cc4) >>
+>> endobj
+10421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 146.33 334.551 157.234]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 118.663 191.16 129.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.623 118.663 231.792 129.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) >>
+>> endobj
+10424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.979 118.663 486.229 129.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 90.996 191.16 101.9]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.623 90.996 231.792 101.9]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) >>
+>> endobj
+10427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.058 90.996 336.307 101.9]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10436 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10440 0 obj <<
+/D [10438 0 R /XYZ 89 770.89 null]
+>> endobj
+10441 0 obj <<
+/D [10438 0 R /XYZ 90 704.201 null]
+>> endobj
+10442 0 obj <<
+/D [10438 0 R /XYZ 90 704.201 null]
+>> endobj
+10443 0 obj <<
+/D [10438 0 R /XYZ 90 674.885 null]
+>> endobj
+10444 0 obj <<
+/D [10438 0 R /XYZ 90 648.29 null]
+>> endobj
+5644 0 obj <<
+/D [10438 0 R /XYZ 90 620.623 null]
+>> endobj
+10445 0 obj <<
+/D [10438 0 R /XYZ 90 551.813 null]
+>> endobj
+10437 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10568 0 obj <<
+/Length 1477      
+/Filter /FlateDecode
+>>
+stream
+x��[ms�6�ί�֞
B/�-1�}���k:M��_r7�C<��
I�}W~'1�����L‴�}�hw���6ְ����e���f�DҢ�v9�$�lS"n�C�J'Y�h��~f�;��������
�N���Nx��z�넽��� Bw��
|�M9��8Q�>��#7���J4��Ψm|����p���"�
�H�
G�����7�
��/FL
+�&i4�L���D�h��™]�h��
�l!�	�&����R�
��FǙ�Z�U�3�ݠ�������`�N
��~*��s����]r�"=�(ެMM��"0J�v>JS��e*|)E�I�61����n<�l��k7}�$#�Ϯ�b
������h%�`a�ð�X����O˜�Mޕ��B�\����TK`�7����̞�l

k�fM�	�yt��mS��
`� �x��=٬�?`
��s��L��IZ2�6��]�Aw&(ݤ%G�&뱓Hd�ճ3
d�;2(��<׏{q�xq��&޶��F6����􏜬�I5E�c��{�o���R���V{�n����
0�M��j�.�D4����V�n:J,�̷A�7����1C�Y�=P�,�����V�� *�%�/��m�e$��p;kc�u�\A��|H�_ ϟ��H����9z�ڬ\O�N���%q����fe
\$Uco��c�k��{�E{��.���v9�L a՞F v*,���倂���������P�?���F� 2��7�O���u�p��v�����22-�*@���iGs[�
�YF�R�y?i��i��߷�uV�!!rg%wuVDVQ_�ؑ�JDV��t���n��Qp&���:��j�l�U"�U�SȚ+ �[%�s��O�2&P��%�K9K�¼��l���w��V"F�+a���X43/�k����� ��cbوK�TtUS��G�6M�~
��/e.㰥�[!��� ��`Z�^�쪊k�:&�t�[bB6oWH�U�]�LL�V�	�ۜ�<`���)9�ʒ����~q�(�� 5�|�� �Cי�W����m��*b��IMU~b<�%�D��Fծ8IX7I��� [...]
+
��*&Em�H�;��&	o�}�ioO� �n��1y
o�Yy��!{˹s[� o�����@�e�t�Ӛ��-Iyrѩ���:
+�q�����llSE�%F��bTC��H6�
����H���T�	��z�
�9
Vv��\/z����662mZ̜���-$͂
��=�J~��^s\}��w/2wk:d��

��]Oo�cNry�K�›?|�͢Ȧ��;n�;m���0�AQ6%�y���4}�;r�
�������ϝ���o��bn�z[� F	�92ڌ`���WD���Z��z���+�`d����q<�v:��8r�1�g�3�-��m�Q�՟�A�����p/�̱� ˢ9 ��F��I�
?���˼c�A��i� ��U�� 8+�	
+endstream
+endobj
+10567 0 obj <<
+/Type /Page
+/Contents 10568 0 R
+/Resources 10566 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10209 0 R
+/Annots [ 10428 0 R 10429 0 R 10430 0 R 10431 0 R 10432 0 R 10433 0 R 10434 0 R 10435 0 R 10462 0 R 10463 0 R 10464 0 R 10465 0 R 10466 0 R 10467 0 R 10468 0 R 10469 0 R 10470 0 R 10471 0 R 10472 0 R 10473 0 R 10474 0 R 10475 0 R 10476 0 R 10477 0 R 10478 0 R 10479 0 R 10480 0 R 10481 0 R 10482 0 R 10483 0 R 10484 0 R 10485 0 R 10486 0 R 10487 0 R 10488 0 R 10489 0 R 10490 0 R 10570 0 R 10491 0 R 10492 0 R 10493 0 R 10571 0 R 10494 0 R 10495 0 R 10496 0 R 10497 0 R 10498 0 R 10499 0 R 10 [...]
+>> endobj
+10428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 191.16 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 707.957 248.325 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) >>
+>> endobj
+10430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.141 707.957 329.39 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.547 707.957 452.796 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 680.108 191.16 691.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 680.108 248.325 691.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a385e4d3cfe442f4fcbeefd9acf5c10eb) >>
+>> endobj
+10434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.141 680.108 329.39 691.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.044 680.108 382.231 691.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 652.259 191.16 663.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 652.259 248.325 663.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a98b5ccd1157e6ec8beec7702af9acb36) >>
+>> endobj
+10464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.141 652.259 329.39 663.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 624.41 191.16 635.314]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 624.41 245.824 635.314]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a80d43634ca26fd76dcb1fdede6363dc5) >>
+>> endobj
+10467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.64 624.41 326.89 635.314]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.046 624.41 450.296 635.314]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 596.561 191.16 607.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 596.561 245.824 607.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a691b91bcd9b5c336892574e975235de5) >>
+>> endobj
+10471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.64 596.561 326.89 607.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.543 596.561 379.731 607.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 568.712 191.16 579.616]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 568.712 245.824 579.616]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a65766b549090f6b52281c99cfba9eed3) >>
+>> endobj
+10475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.64 568.712 326.89 579.616]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 540.863 191.16 551.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 540.863 247.687 551.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0dddfc1f0ff6f55a90c4ea8829b9752b) >>
+>> endobj
+10478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.503 540.863 328.753 551.767]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 513.014 191.16 523.918]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 513.014 245.476 523.918]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a695843d7e86aecb1d5e9632aae3eec88) >>
+>> endobj
+10481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.291 513.014 326.541 523.918]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 485.165 180.032 496.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) >>
+>> endobj
+10483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.848 485.165 261.097 496.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 457.316 191.16 468.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.914 457.316 267.663 468.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a392d8d530782ff1240e73a9fb15f7975) >>
+>> endobj
+10486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.986 457.316 348.235 468.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 445.734 149.098 456.264]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 417.511 200.067 428.415]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ad5080c3ee416a445b60ac48971d9b808) >>
+>> endobj
+10489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.284 417.511 280.534 428.415]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [491.68 417.511 513.996 428.415]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 405.556 165.158 416.46]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.318 377.707 199.519 388.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_af0d240ef2e0e5d6771cb1767f6fa64b3) >>
+>> endobj
+10492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.736 377.707 279.986 388.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [491.132 377.707 513.996 388.611]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 365.752 165.158 376.656]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 337.903 191.16 348.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.103 337.903 267.304 348.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a97f2c2912a13988f28555bee4fe96ef4) >>
+>> endobj
+10496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.721 337.903 347.971 348.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 326.321 149.098 336.852]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 298.099 226.034 309.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a37de3f55cf5e917e32f7f2f9c6d34840) >>
+>> endobj
+10499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 298.099 398.426 309.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 270.25 156.281 281.154]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3024f7593cf48937f80197fb8030c290) >>
+>> endobj
+10501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 270.25 237.346 281.154]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.558 270.25 332.808 281.154]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 242.401 191.16 253.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 242.401 232.465 253.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) >>
+>> endobj
+10505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 242.401 337.051 253.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 229.472 191.16 240.376]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 229.472 232.465 240.376]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) >>
+>> endobj
+10508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 229.472 337.051 240.376]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 216.544 191.16 227.448]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 216.544 232.465 227.448]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3393f0e95870b681e528c15803a26f60) >>
+>> endobj
+10511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 216.544 337.051 227.448]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.227 216.544 413.414 227.448]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 203.616 191.16 214.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 203.616 229.964 214.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab4396e8bfbdd5831fd37d13c19194cc4) >>
+>> endobj
+10515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 203.616 334.551 214.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 190.688 191.16 201.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 190.688 229.964 201.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0540634ba6d2d2175bf25e92a0831af1) >>
+>> endobj
+10518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 190.688 292.489 201.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.824 190.688 361.011 201.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 177.759 191.16 188.663]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 177.759 231.827 188.663]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b) >>
+>> endobj
+10522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.164 177.759 336.414 188.663]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 164.831 191.16 175.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 164.831 248.325 175.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a98b5ccd1157e6ec8beec7702af9acb36) >>
+>> endobj
+10525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.141 164.831 329.39 175.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 151.903 191.16 162.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 151.903 245.824 162.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a65766b549090f6b52281c99cfba9eed3) >>
+>> endobj
+10528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.64 151.903 326.89 162.807]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 138.975 191.16 149.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 138.975 232.465 149.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) >>
+>> endobj
+10531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 138.975 337.051 149.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.208 138.975 460.457 149.878]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 126.046 191.16 136.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 126.046 232.465 136.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a447ce24e7e4fdf595ebaa4cf5d1c38b8) >>
+>> endobj
+10535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 126.046 294.989 136.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.324 126.046 405.574 136.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 113.118 191.16 124.022]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 113.118 232.465 124.022]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a49574f120ec3f9fbfda58d6f826587e9) >>
+>> endobj
+10539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.787 113.118 487.037 124.022]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 100.19 191.16 111.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 100.19 232.465 111.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3221626e22e187252b866eb371001183) >>
+>> endobj
+10542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.802 100.19 294.989 111.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.324 100.19 363.512 111.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 87.261 191.16 98.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 87.261 229.964 98.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a72b6b45299672d85c7984392454296d6) >>
+>> endobj
+10546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 87.261 334.551 98.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 191.16 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 74.333 229.964 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) >>
+>> endobj
+10549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 74.333 334.551 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.707 74.333 457.957 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10565 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10569 0 obj <<
+/D [10567 0 R /XYZ 89 770.89 null]
+>> endobj
+10566 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10640 0 obj <<
+/Length 2451      
+/Filter /FlateDecode
+>>
+stream
+x��Z[w۸~���SK��o���fw�M�m����
J�lv)R!�Xί��ƛ �J�
���A`0�
f����{ߟ����⻈y	JBzWK/�^�������Ɠ_�~�X#��0Ku��˛�Wo��ʱ�WWg��
a�h�bo�:{�
�����Kb�N�<N<s���_ϰ��e
+qO&�C�Y�E� B� ?S�Ż�r��ƈ��ϼw� c�uV���~�]W����8>��/עJ���P�OS
��8��3���?&�?��t�
��0�MT��o��F�td8��)��D�W��n��<n��ʋ���^�b9��1�g�h��*͚��Ri�KQ�b.�j��f'��(�G
� N��X�$6�9
+2�Q��Ijt�8��v���[�����{�?t�䳫�~1O}2J�*��i�S���n�������Cl�Fi��$&���MpjNs� �Q��Spۋ�@_ǼӨ�<�e�8��BLH��\� �M�h���Q
+���
�bq����v

N������PV'�Y
��r�x���JS<?Rěڥ
�$��	��z3;d�;"����'ك`�=�/g�#�n��e�T"]MN�0�
�E"�-Z���P}C"�4I��q�R�"� ��#�{R`��&`�t�X!q��s(�S��
�i��o�)��]SFO��!�"2�
Z�V4i��X���Vϫl݌�
y q���ﵩs%�n�����c$C�B�6zV�I�ٿļ1�~6�&�s
�Ac���p�����6�{!J"P���8D8`
E���%d=B�b`��aM�HBDidI��1�
F�\��i3�����S�"�OSe��Q��ľ�� $�l �E6ƥ��D�dw���b$�zD['�0�.Vq�S� ��H�
��V
�gd<����C\�!l�x��-�z;y1r˯p�Q����Ly�
��E��r կ]��qq�
<���@�N�%Bw:�u'�A��.y�a�(�}j�{�eE����t�|�2��-�m�71���
�0�L�զͭf�A.� [...]
+Qn�tQ���

�%�
���LK�C	 Ŀ���)�s&E�d����~���B�F�?W�)A/�����זc�G��֝i%tCk���榙��_
�V4B�a�7��T�q�3 ��
2YgH y��^��¼ߤy�dZ�@Ҏ���V϶�S�4�|i*�j��[��D�W�v�W�}m�ץ�f���yYo�.�ES���d���+�/7y�[�htC�A5T��Vx���(K�U���U)��![���>��c±	V�9�	S�\-FR(9��:06�K:��
���:׶�$�`p�'��nҪi�/�re�3���,
aȍ��O�.�I�1
ic<V�ʸZ
��� ��
�
��Sa\N }BL����-�En1y�_�b�oflS�ս�Ӕ��-
-�)"�,�(���lk�q��-8#s�?���$��;!��$�'�(k�u��S�VR��
�~��+����t*�i�^V�#��;կ�-d{��Yf��\�u4�a���t��6�"1���A����t�$�Z�f��x���Z
#ɽ�=����-
��I2�u-�x�Ɂ��g�%�K����Ѯ��&@���pubm���'�װA	�T�F�}��b�B�-�2�vN\7���y��^G���,��X��ڞ�
��
��e�j�t��ߚ(�Yw�!�t+@�
�0
�����O����_mS�N%���b�M.����,�[��qRU�
3غ婅Nu�ʀ�@�����[ǝ5 5
�V@�>�N�-r�\���";�A��w���[�?�����;�VZ����֭ZC�N��N5�/f�v�Go�/�.�Ա��0$	����Wq����@�
b�!��B?�:�JVYDu���T?�ɽ�w�'M�C�?N(q�
zs�s?�ǹ~���	�"�J�b�yl/ Z���t�����w�����C~��v��b�����Z��&�{�|_>��Q�#o
+g6:E$:��*��#��"}|~ ����r�
�\��2�p��[
#1*1������q�
+���u
�� �)u������#w��]��|m�`�v���6�	���g-���
p�z;�.
�Ǧ%%u�"N���*�s�?xH�T�����ր02�X5�

��6�KC�НR�YeYn*U��buKxʼ�җ�{UA �pc�0
b2H���
H�2}y�'��W	^
�-��W�c[#���
b���(zJԵ��H}
!���ΐ������M$������0��W��ՠ�c:.��b޷%0��M�ߴch���!�~ 2�v�!��׺��ZT���o���ؤ����@;U�� Q"6�>�
�VXp�e���O:��d� ���Ih�����lsS��Aݽ{�MN��֫�˨UY��QйR�ߎ�
ƌ�e
+endstream
+endobj
+10639 0 obj <<
+/Type /Page
+/Contents 10640 0 R
+/Resources 10638 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10209 0 R
+/Annots [ 10551 0 R 10552 0 R 10553 0 R 10554 0 R 10555 0 R 10556 0 R 10557 0 R 10558 0 R 10559 0 R 10560 0 R 10561 0 R 10562 0 R 10563 0 R 10564 0 R 10591 0 R 10592 0 R 10593 0 R 10594 0 R 10595 0 R 10596 0 R 10597 0 R 10598 0 R 10599 0 R 10600 0 R 10601 0 R 10602 0 R 10603 0 R 10604 0 R 10605 0 R 10606 0 R 10607 0 R 10608 0 R 10609 0 R 10610 0 R 10611 0 R 10612 0 R 10613 0 R 10614 0 R 10615 0 R 10616 0 R 10617 0 R 10618 0 R 10619 0 R 10620 0 R 10621 0 R 10622 0 R 10623 0 R 10624 0 R 10 [...]
+>> endobj
+10551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 707.957 191.16 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 707.957 229.964 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a5c4134b034447fcf2b7b154102233dcf) >>
+>> endobj
+10553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 707.957 292.489 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.824 707.957 403.073 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.78 191.16 706.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 695.78 229.964 706.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a15c22785d951d9f8f6ec2e14f07b2dc1) >>
+>> endobj
+10557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.301 695.78 334.551 706.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.726 695.78 410.914 706.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.602 191.16 694.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 683.602 229.964 694.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) >>
+>> endobj
+10561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.287 683.602 484.536 694.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 671.425 191.16 682.328]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 671.425 231.827 682.328]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) >>
+>> endobj
+10564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.15 671.425 486.399 682.328]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 659.247 191.16 670.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 659.247 248.325 670.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) >>
+>> endobj
+10593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.141 659.247 329.39 670.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.547 659.247 452.796 670.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 647.07 191.16 657.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 647.07 248.325 657.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_ab1a39b5a84040af5feee0336b275fa95) >>
+>> endobj
+10597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.141 647.07 329.39 657.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.565 647.07 405.753 657.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 634.892 191.16 645.796]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 634.892 245.824 645.796]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a80d43634ca26fd76dcb1fdede6363dc5) >>
+>> endobj
+10601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.64 634.892 326.89 645.796]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.046 634.892 450.296 645.796]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 622.714 191.16 633.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 622.714 245.824 633.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a703e355f3726c0cace243d4fe4b74125) >>
+>> endobj
+10605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.64 622.714 326.89 633.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.065 622.714 403.252 633.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.537 191.16 621.441]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 610.537 247.687 621.441]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a0dddfc1f0ff6f55a90c4ea8829b9752b) >>
+>> endobj
+10609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.503 610.537 328.753 621.441]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 598.359 191.16 609.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.9 598.359 245.476 609.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a695843d7e86aecb1d5e9632aae3eec88) >>
+>> endobj
+10612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.291 598.359 326.541 609.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 586.182 180.032 597.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) >>
+>> endobj
+10614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.848 586.182 261.097 597.086]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 574.004 191.16 584.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.914 574.004 267.663 584.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a29d81c4c365b593f707cbfd0f960631f) >>
+>> endobj
+10617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.986 574.004 348.235 584.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 562.423 172.619 572.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 549.872 191.16 560.776]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.103 549.872 267.304 560.776]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a58ce6d6e87e4bf19e99478994bbb6010) >>
+>> endobj
+10621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.721 549.872 347.971 560.776]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 538.29 172.619 548.82]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 525.739 226.034 536.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a37de3f55cf5e917e32f7f2f9c6d34840) >>
+>> endobj
+10624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 525.739 398.426 536.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 513.562 156.281 524.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a3024f7593cf48937f80197fb8030c290) >>
+>> endobj
+10626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 513.562 237.346 524.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.558 513.562 332.808 524.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 440.09 255.069 450.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.521 272.39 182.709 283.294]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 236.525 124.191 247.429]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 171.568 179.843 179.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 139.457 179.843 146.983]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 131.487 179.843 139.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 123.517 179.843 131.043]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 115.546 179.843 123.073]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.772 115.546 271.898 123.073]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) >>
+>> endobj
+10637 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10641 0 obj <<
+/D [10639 0 R /XYZ 89 770.89 null]
+>> endobj
+10642 0 obj <<
+/D [10639 0 R /XYZ 90 500.684 null]
+>> endobj
+10638 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R /F91 766 0 R /F10 773 0 R /F13 835 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10653 0 obj <<
+/Length 2566      
+/Filter /FlateDecode
+>>
+stream
+x��Zے�6}���S���`�/S��Z�RN��c����H�U$qBq|ٯ��$P�Fcѕ�}"D��n��t tt3��Ϟ^�=yi����
]\�

���5�O%Z�'�R��3���2�|3�4�_n�Y�^��_i�����|�����wŘ�$[���j<�&��z]7�f�Y��j�y���Dp7�p��ً��?���#V+��������:���O#J���OU��Hr��b���3��E	W�������d�0�e$ፙ��պ,�e^@an�����,|�<��/�U���J�||x��pI�t�h�u��e5����#B�����N�u�<�Z�4'B�J�э�oƂcnj%�R�j�)'��4�T�L�A�:�M:�����
���D
��ݵv��*I�j ��q�O�����T��Dj�L�3z}zqj
1�;~3�����
+��N�����
�٭.a(QJ�&�g�5�s�Z�ʂ�,��'/5��a
� ������b6_8jX��w
_�_� T*!⫧�+�%��X3ҿ�2
%ĵd��`�%�T}{q
��T&�l�U�������UC�O�Ţnݦ
 ?�>���%��u�lZE�%tR�K��r�m������n�#�
*S��
t����S���ŗZ���d�]W�~�(/C]�z6�~p�9��
n�0!���Zf˻EZf���n��.���x�\v
�/w٪�=e��/"X�
`�����sXJjA�4~��YzWfE�!H���~?D
���Yr �s�!�`� z3�p`��/$#��AT��X&C��}IR����0�e��.�O"XH@����OJ�� ��J��s�m��J��'ܸ��n�
B1�訳B�ZW���f
+��b���J.�>��
�y$�!��*��d�E|Pa��O(L<@$���u$�1�c��A�P4=^�#j����ӵ��;?w�XQD6Ĩ�ZT�.
��X|"KJ7̘���=ϊ��lY%���2M3D2�1z'�v��X �M�J�)qn�ZU��6;����F�
�P��~��3�����z�� * h-�}��fM���?�I���p~^�T��~ۤ�>����SPZo�VW�7E�����nt��C ��
6�#R��'U�4/
Dg���IA'+�N���ׇ�4i���~�G$M�/[��A��>�|��O�凃��c]�7+�lo
_��.�e�J�ǢN�U{���������?8��o� ��ˆ�\��O��F��Ei+�@3�
� ܨ#)@;�6x
+@ځ
GR �� * *
(@����J9�����8f�GZ��|
����P��t z���5!� ��aLt�`/
�*;��`��IA�A����(�]�
@�8;@Ma\�
Y`�t�l6_f+o��,�1M�K��t�F��W�(�P
��=cT��X3�݊TGjlC��4���@ۯ�:̹�%c�����.����I!�O$�e�<�y��c
+6Ȩ�*�J��1��<�S�
�ɝ
�<�� �����!���m.>�
�f���Ku��(=��|�!҂����������6�ܥ�Ř黵����0
��A�#)��P�3
��A�CA9�Lg"4�\5�'0
v��H�n��H��t���ŷb:Տ�6-�V��&[��W5������@�
?�ceÏ�����ѐ#�vȑ��89�:Z
&GR�]rTi�M����Ή�D�
'
+O��<��WPK�B��zI�=���t�c�m
u�;�
+ͩ�
+�9�=]���7��֙�n}�@:����q��<�ZD�Y��U����ቴ��6kO��/3�
�RW@� �������u� �|<E\�"#29P�	��YGt^3S�2��0Đș�%���ϱ�C�eu����~���{8��O�����l��i��{2>z@
<�=�/�l|���ý�$	.
���⬺�iv�'r
M;OR���o�p���6��&��\�و��2+ę���t=�
O֗�?ےX�gHT52�lt�%��
%2�����4K�.g��luS�^fE1�*ɋ&W�YN�n�Ҽ
+�Qd���
f�}��r��y�E^U>z�L�����d�E[�]W����1x��-١�0m��:��Y6k]ߛ[�4v����F�Xl�c�n�ig�~�l6<�*<����L���!pbn�\/����u��ի�?
���z��>E惷��T�����/��*k����մ)Ey�˰m��ERss�r�^��yE7.��
i�1vs�G�4���(�a�ž��$� �^�Ǘ�%�d�h��[ ���h���B	�T�Y%���*��W5�n�s��]݁t돏�
��k����6D{��-`
��;���bՒ̦>����I����\�)X~��Y��fEޖ;�U p�c:G�4��z�R)ƶZ������#�
+�YǗ�Z68 
Q��h�7��ƿ�Y�7�X�K��O���t�ؔx�0bk�
�ɻ��ٵ�����u٨�
%�v�E�eyw�����
��2͗�˼e
��f���]�e^d��岂.��C�|
Ѽ�
L�X�8ë
�������œWK1z�c��-�� Yc�e
+endstream
+endobj
+10652 0 obj <<
+/Type /Page
+/Contents 10653 0 R
+/Resources 10651 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10665 0 R
+/Annots [ 10649 0 R 10661 0 R 10650 0 R ]
+>> endobj
+10649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.483 229.576 535.938 242.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 216.192 311.845 228.142]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10650 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10654 0 obj <<
+/D [10652 0 R /XYZ 89 770.89 null]
+>> endobj
+10655 0 obj <<
+/D [10652 0 R /XYZ 90 721.073 null]
+>> endobj
+10280 0 obj <<
+/D [10652 0 R /XYZ 90 704.201 null]
+>> endobj
+10656 0 obj <<
+/D [10652 0 R /XYZ 90 704.201 null]
+>> endobj
+10281 0 obj <<
+/D [10652 0 R /XYZ 90 596.628 null]
+>> endobj
+10657 0 obj <<
+/D [10652 0 R /XYZ 90 592.145 null]
+>> endobj
+10282 0 obj <<
+/D [10652 0 R /XYZ 90 462.635 null]
+>> endobj
+10658 0 obj <<
+/D [10652 0 R /XYZ 90 458.152 null]
+>> endobj
+10283 0 obj <<
+/D [10652 0 R /XYZ 90 328.641 null]
+>> endobj
+10659 0 obj <<
+/D [10652 0 R /XYZ 90 324.158 null]
+>> endobj
+10660 0 obj <<
+/D [10652 0 R /XYZ 90 253.452 null]
+>> endobj
+10662 0 obj <<
+/D [10652 0 R /XYZ 90 167.172 null]
+>> endobj
+10284 0 obj <<
+/D [10652 0 R /XYZ 90 135.629 null]
+>> endobj
+10663 0 obj <<
+/D [10652 0 R /XYZ 90 135.629 null]
+>> endobj
+10285 0 obj <<
+/D [10652 0 R /XYZ 405.643 84.126 null]
+>> endobj
+10664 0 obj <<
+/D [10652 0 R /XYZ 90 77.486 null]
+>> endobj
+10651 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10669 0 obj <<
+/Length 2851      
+/Filter /FlateDecode
+>>
+stream
+x��[Is���W�H���,�Lz�2�L:�N.��.J�m&��&){�_��(h�ةJU��$��x��
 ����O��|��-\s��;�&I���nb�Dq����n'���٧�&LjD�����o�����o>�wWoo��\x�'�
H��r}�������cf���5ZO8ep]M>\��
+�
"C�A���	F�!���z �s�o0��6iR|~��c1#z��e�o������>gUZ$U^x)A��Ϲnļ�Q>M�u�;V�5�D9|
�C#��hӎyw�
Dh,����1:�W3B�/�mC �J��@pĥ��ER��z�r}��s')#�����

`��׬]����)g�`�gs���#NC�T��d�!��n�kM�����,��l���}rckl��w���+���)Ek��Oi�-6%`x�l��U-�_��T��1�6Uݶʛ���Y%e�l�o����e��ͨ�Qb���M�&�
>OgDLۉB~ �a
f�Q�U��kU��jUr"�@�]nT܀(�
?˨1� ��hK��F��
�5*MU��oT��N�sC��>
+���{�eB"lXh��|댝jo�z��_�F��>3�)K�Է%D�kęhZ?E� ���漊�|��jv�!
$�_˅XQ��E�Wy�M�)tO��}ځ��5��/�dby�I1}���9��!��<����!WA�F���0d_�����D)u���#��(eH��I��j���Q0hPkB
����	&Lƀ�$K
,��:���C?0��4��A*�����95��4�B���`²u</3���DP�R
y�{��ܓ��AW�S R���3�zi������Ey�s%����
��7��6�CV

+pP�8n=g�CDXż��]109���e>����v{�l0��;�j��Q0��
U��D���$�|��,e(qx��m�[�Ҿfa�1�
�p&Q/���!�4A!*
+~H*��6������D0)���c��B�)")���Hk>*Dqg�CU~�VuH]����6�
+
�(� ��n�������D"r�
��7I���<�D���3Lژ
�_h��NG5�2q
�h5x�'>?��a��
X�"ŮC�h��6[��#*jոM��I���ٯI6I=,�\�|����i\����u��q[A��3p>���iM��#�d��y$��	����@��
�� [�m�O �ەC�+0����C2�������q?�
���m�c��
�$R� O�0���9��4}G�!iF���s����zY��Θ5(�!WM ��7�dˉ �lW�����'�-���ڌ��
�	
v�d�@�A�
]R>rۣ_i�N���m��2�jv"��d�@���dY��f�tsbYn.@�����I��k�c��(#=��g��#@h�� �Y	� �9 qN�<�:C ���ȡR�S�o�QwNzW�
�NE]5�]X걹�$N��MU$YU�u�qp��'�N��
t^@�RӴH7�}����$:��c�8����;�T2��ΙIf�l��9�@q�%3Ic	��a�e<�R~V��
��]��/��2OCV-_��d! �ѳ#�\B��mD
��#�LA� ��A`�F�N�=�_���k�
��H��U��:��1|[�60��:-�ɸ���u�
���"m��UX:\�{:����o�܅9���lN{qp理2�;�~Rp��![
X�@89�s�G��C�
@��d+#`���qbh�{ěr$�8
�p�����
zF!���( @�γ֌����[�Bh�7
e'i����������3�/#
�	�;Ez���PpP'�
�8ڷ��k�{bD����h��#C",թ$��Lf��0c 7'O#z#|�K��@o�Q�M�8F/��G��
���ayͨOk1��,��2���
`��%,�@
�j�@Hu�@��2��o�
v� 5g��,��� �p2���
� B� ��H׹-
=�b��X�GY��N�/IE
��ꎲ��P=�-�^#k*��^*ͬ
�
�-��󇴊8W���𩕉'��N���q����SA�E�j����@�V`W^|L�����v`0���]����
��o\�U�wv`i���ԝd��
�k�4
l�nk2l��?��lzPx���
+����DDR��
+�%Z���;J���y�
+���)�E����>�}g��O)��yyp�
+�x��#Y�Q'o�#
+
N��N�fGV��%�����%������#J:
+�#
+`�{��!���aA��9
MA��#��ە��n�^m�$a���Q�jZ��	�pJQ�y�=ǫ�d3��-����cT�%�-M�DZ	ƾ��g@������)
<���K�)X<�
lQ�R�Ǽ̪z5h�Jid
�n�:
�@K[cj���w
�E
W
+meF|�^�m7�vQ2J��3&�ܱ+�$�,�4)�pd<t���qȉG�XH�g}h�-6u���
6��t���(M���
�'�]LӁa�a��y4��1 8��@8��35
+K��6 �w�i���i[Ey:p'-� b�m�1 ���swFt�n�B��
y:ox:5
O��
tؐ�������)]�?� A
����M��lWp����e���3R��
��M�E<Xl����}'�
�������ex���/�j
�#��e��P������
�/�
+1Q.邿޽{�|S?x��5��!a��9țw��L�
�����Ц��0�������ʴ��L�D����d��<���O��. +�Y�vE�j͇4���c�W
�OWn�{��py�s���z�~�f��/��=ZB��Y��cc��]�{�u�l+ex�vDZv�?W	j�
+endstream
+endobj
+10668 0 obj <<
+/Type /Page
+/Contents 10669 0 R
+/Resources 10667 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10665 0 R
+/Annots [ 10666 0 R ]
+>> endobj
+10666 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10670 0 obj <<
+/D [10668 0 R /XYZ 89 770.89 null]
+>> endobj
+10286 0 obj <<
+/D [10668 0 R /XYZ 403.979 677.047 null]
+>> endobj
+10671 0 obj <<
+/D [10668 0 R /XYZ 90 670.407 null]
+>> endobj
+10356 0 obj <<
+/D [10668 0 R /XYZ 487.336 620.877 null]
+>> endobj
+10672 0 obj <<
+/D [10668 0 R /XYZ 90 614.237 null]
+>> endobj
+10673 0 obj <<
+/D [10668 0 R /XYZ 90 545.663 null]
+>> endobj
+10357 0 obj <<
+/D [10668 0 R /XYZ 298.885 449.233 null]
+>> endobj
+10674 0 obj <<
+/D [10668 0 R /XYZ 90 442.593 null]
+>> endobj
+10358 0 obj <<
+/D [10668 0 R /XYZ 457.052 393.062 null]
+>> endobj
+10675 0 obj <<
+/D [10668 0 R /XYZ 90 386.422 null]
+>> endobj
+10359 0 obj <<
+/D [10668 0 R /XYZ 391.16 324.937 null]
+>> endobj
+10676 0 obj <<
+/D [10668 0 R /XYZ 90 318.297 null]
+>> endobj
+10360 0 obj <<
+/D [10668 0 R /XYZ 174.283 239.187 null]
+>> endobj
+10677 0 obj <<
+/D [10668 0 R /XYZ 90 234.55 null]
+>> endobj
+10361 0 obj <<
+/D [10668 0 R /XYZ 158.014 171.062 null]
+>> endobj
+10678 0 obj <<
+/D [10668 0 R /XYZ 90 164.422 null]
+>> endobj
+10667 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R /F8 802 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10682 0 obj <<
+/Length 2369      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r��}�W /	X+��~Qj6��n�-�Wɋ�rA$H�B2��~}z0 �2)��֦� ����gN���y�����x�J�� #���g����		�����`$�hL0����qR.��oG����6����7�M��WWo�<Mʏ/�ܕ#��t�ʊ|4����j�Nߥ����'�5M��#��?]����tA�9
�@JG����8���"�������e�)��"���
��j��
+{j>ZC:�j�0�"
���8�,��zI�U�ז���w�M{o+2�d���$
+�ֱyV��I͑���쑁Q�k��5a
+IB�M���.ۓ��"u	ޕ*")\<���~H�
U}?~ h*ߏ���IU��w�ޕ�*ͫ,��+�;L샵���b�խ�p���u�T�J��dR���LU����lr;xwu�L��4[������
�v�V����zU����
K��2���=�[A$"O��N$Z�L�b�����Z
Q�3y}[xPtQ��QL�a:��(b����z<z�DqSc.w�?k�l������p���ְ��Fc��ʚ���R��K��[���y���:ڭб��
+����{�ti�#�I����J1m�
$�5�xê$0�B�����S`,B�b�E�
si�c�
�Ba�#��,~��ɽg;��g�>4��}/Q�@!)x��Ֆ�C>�N������7)�*�r˷���@�Iq�
S���^^�,6
BW�
Dјq�$���RD��A��W�7E��dS�H�e���f��$jя�7R1-ok5�%��5E4m�� D�Nsbt�
+�6�.@�k�w����Xǭ8�ᄟ�	Pf
��Vr;�}u����g
*
9��
V	�?~�i�,�*�(=Iذ�"Ja�2
+�o, �\([���\�t�N
�f�B�J�V�? �H����)Y�}�\2('	������cb}�=�E/ϐ斥�g����kF�>�b�M�j�޻�Z��*d*���W�:$p�v8n��l�w�4h�	
�i�#���+�������**lHؽc�E?U�,�W�5PK̢�'�
��߻�?�pz��{��+����C��f#*bh�aM�">M�j�=��;az&���-)�ԁ�Q��U�C/ A�#)�ujjS�
B��S8 ��

ؓ�%RĜ�	m��}'��0��7�R����!�C�!�Q��
����~��“i/��dYL׋�����5\�,�$��
<����:���bY��<-��P�y��U�<]�϶Dn��l�ZW@
u�����
Զ�
+I�%�s��uU���o�y��`�Z�������<~��pk�E����_��'xv>�L����4��I�������w�y�f�ݩq�v�C낧�>�U���AxWЧr���Sp�5E�:�+N�@�=�S8Ṣ�D�+V�<�*!����
0a`�}��P )A�a$�7=�z����
����������ʋ���,��۫�z�
�l_v���r\P������kV���f��_�
^��-ΚW&0qI�0�"ޯ0A�IŻ��}U�*���ʥ���W�t��>~�Z��S�^���l�wv�R�| nv�����t3�a�?E7�v���K�Z��,��F�K�S�+��dOTE��V���2`�@����
����rtZ�4�w
+)
�	
:5��C3@�
�C��%i
��C�
`���	�z˱a��+���NiJ��p�yۢ}�*
�A7y��pK*���X�tp���I+�PE4�IABZ��kd(,�Yr�lE���t����Ek
_�Bh��e����! b��^@�z_d�:7� ����
+� )[ݨ:�
���d
A���#
��9.�];6r�"v�O��LXv�{H�'���C�CH����	
�!�!9�b���\,���[q�B�BI��� 
+�����q+N�[�o�f��[��f
�����l���6
�TE���8�
E�����DӏTe�U����|�KH����!����%to*����pE$M;��eX'wv�w�@-6�`�����!?���G��r�-N��x��J�v�8�_2uܠA��0
�9�,Q����gx�9���tr}Զ�20I�6š
އg(U0���S&��f4���Wl�t�f�b�N��w�ǖo~�
H�	�o(�0�#5�
�
�e�
���ᇳ��e�~�| E,%� BW
�j��_
�۷o��?Wi����O�?��������-.77D �΋�����5r��'j��~Q�j�Q�E�ɽ����g�n��U��ѤXnO`' ��3�Y��Ӳ(}PY>�{�vG5��~���>+m�	�S���?ł��y}�y�_x��E/
+H�/���/�A�
+endstream
+endobj
+10681 0 obj <<
+/Type /Page
+/Contents 10682 0 R
+/Resources 10680 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10665 0 R
+/Annots [ 10679 0 R ]
+>> endobj
+10679 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10683 0 obj <<
+/D [10681 0 R /XYZ 89 770.89 null]
+>> endobj
+10684 0 obj <<
+/D [10681 0 R /XYZ 90 720.814 null]
+>> endobj
+10362 0 obj <<
+/D [10681 0 R /XYZ 439.235 642.289 null]
+>> endobj
+10685 0 obj <<
+/D [10681 0 R /XYZ 90 635.316 null]
+>> endobj
+10363 0 obj <<
+/D [10681 0 R /XYZ 470.21 586.119 null]
+>> endobj
+10686 0 obj <<
+/D [10681 0 R /XYZ 90 579.479 null]
+>> endobj
+10364 0 obj <<
+/D [10681 0 R /XYZ 234.765 512.324 null]
+>> endobj
+10687 0 obj <<
+/D [10681 0 R /XYZ 90 505.684 null]
+>> endobj
+10688 0 obj <<
+/D [10681 0 R /XYZ 90 447.902 null]
+>> endobj
+10446 0 obj <<
+/D [10681 0 R /XYZ 90 424.83 null]
+>> endobj
+10689 0 obj <<
+/D [10681 0 R /XYZ 90 424.83 null]
+>> endobj
+10447 0 obj <<
+/D [10681 0 R /XYZ 90 371.17 null]
+>> endobj
+10690 0 obj <<
+/D [10681 0 R /XYZ 90 366.687 null]
+>> endobj
+10448 0 obj <<
+/D [10681 0 R /XYZ 90 326.955 null]
+>> endobj
+10691 0 obj <<
+/D [10681 0 R /XYZ 90 322.472 null]
+>> endobj
+10449 0 obj <<
+/D [10681 0 R /XYZ 90 282.74 null]
+>> endobj
+10692 0 obj <<
+/D [10681 0 R /XYZ 90 278.257 null]
+>> endobj
+10450 0 obj <<
+/D [10681 0 R /XYZ 90 238.525 null]
+>> endobj
+10693 0 obj <<
+/D [10681 0 R /XYZ 90 234.042 null]
+>> endobj
+10451 0 obj <<
+/D [10681 0 R /XYZ 90 182.355 null]
+>> endobj
+10694 0 obj <<
+/D [10681 0 R /XYZ 90 177.872 null]
+>> endobj
+10452 0 obj <<
+/D [10681 0 R /XYZ 90 126.185 null]
+>> endobj
+10695 0 obj <<
+/D [10681 0 R /XYZ 90 121.701 null]
+>> endobj
+10453 0 obj <<
+/D [10681 0 R /XYZ 90 81.969 null]
+>> endobj
+10696 0 obj <<
+/D [10681 0 R /XYZ 90 77.486 null]
+>> endobj
+10680 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F7 803 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10701 0 obj <<
+/Length 1694      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6}�W�)�&��⪙�4u:M�4MԾ$�"Q����P�����.���"��
?������=
��	\<>����)
v�^

sZ�`8

�tLi�o��"����� �e�4�J.?�������]�[�|������P��`<��ȃ	]~I����.�i
H�t��u~��JdIDj0��3p��Ifc׵�d
e
��"
E�_o�
�n�Z͖�tTŁ�q��Zބ�h��!�������\�^_*�
/��DZvL8w��'�
 v���zl8�m�*(dѩ�{({Biy�ףu8���]����o
�#7L
Pp�}��D�eE���*LO����a�6�w6��Z�����X�Y%Ŝ)���`+P�e��א�l�pq��Eo�
�
.�B� �f\�(��<V at 3.�{�EH��Z���Z3���
�S*
U�"EB�;�x
���Y"M'GC�
+������$��૏�ٲ&�y��Hw
3g��*�sf �Q�2eL;���M1��J��s�;�f�OסBh��"��=˻�<Fi~Je�����Y�Z���j��m��
$Ѥ�J��w�iB��Ex4P�c��⎒����!4�mZ���G�����M��}�R��Ie
V�oO0

`A
�h�S8����02U�$� v&�r��|N?p.Ƴp����DLXH����qv�+���w�T��LL�+��F��j0(hT�N�ᔏ&�SS
m�{N{�F�b짅c�@���3���'<ԁ�"[�Zr�xT��<q����oQ�j�_���[���g���m��Af���
56+�T͕P@�U�]�jN%���w�� ����)yP�H��9ݽ@E�Ī���ƒUY�|��
+��
�TcZ��e��*1�Ms4V�ʰ��h��H+���H�Q�9z��`sw�8�/��XI)KhO�oC]�ML��
&�*�ф{m�6���C\�pYj�������	�mY�+��0�}Ō���j����pK���C����p/e��ڨ�XE����6���>2ć�>�K��FD?6��8�o�}.����o{�}��S�4��H�|"��O���tT�
���*
�yqE������b���W��~Mu� %H
-�����ﭞz�P~�F��ުbc����(��|�u6��Dž�L��a
�jL��i��1ؖ��>IYv��]���q��H�A�}���
p�
���q�
ey���� uMB'�51p�u
ެ)]���mG�:��׿	̐�]�
%_$��!�ٶm�6;B�I���˩Ѣ�p�*���a��T$W��(
�FҞNV����Tt���F�6��d0��뫋0�zRu��~�2�͖%lp~4
Fmu}���>��`��So���
��eO��]�}����4>bFn�������d6٧H��r�7�ù��΍�)��0����]fS�…�ܧi�
棯��%j
�l��%��E1�X%򪹭'`�d���W��'�{;ɢ$�j�ܧ��}Y��3�xqc�L@���䇃I��q�����.��<���%+���^�4��`��L��RL:�;�x��ۛ7�ғ?Va�]O�n� ��_F��y����aT~�
�6F�����wa��,��"�_R�o�d⯌
+a�Z�ogg��\����r~��`G
,�i�̴y���I�tq>�5�����1$�
+endstream
+endobj
+10700 0 obj <<
+/Type /Page
+/Contents 10701 0 R
+/Resources 10699 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10665 0 R
+/Annots [ 10697 0 R 10714 0 R 10698 0 R ]
+>> endobj
+10697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.483 130.07 535.938 142.588]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 116.685 311.845 128.635]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10698 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10702 0 obj <<
+/D [10700 0 R /XYZ 89 770.89 null]
+>> endobj
+10454 0 obj <<
+/D [10700 0 R /XYZ 90 686.846 null]
+>> endobj
+10703 0 obj <<
+/D [10700 0 R /XYZ 90 682.363 null]
+>> endobj
+10455 0 obj <<
+/D [10700 0 R /XYZ 90 630.676 null]
+>> endobj
+10704 0 obj <<
+/D [10700 0 R /XYZ 90 626.192 null]
+>> endobj
+10456 0 obj <<
+/D [10700 0 R /XYZ 90 586.46 null]
+>> endobj
+10705 0 obj <<
+/D [10700 0 R /XYZ 90 581.977 null]
+>> endobj
+10457 0 obj <<
+/D [10700 0 R /XYZ 90 542.245 null]
+>> endobj
+10706 0 obj <<
+/D [10700 0 R /XYZ 90 537.762 null]
+>> endobj
+10458 0 obj <<
+/D [10700 0 R /XYZ 90 498.03 null]
+>> endobj
+10707 0 obj <<
+/D [10700 0 R /XYZ 90 493.547 null]
+>> endobj
+10459 0 obj <<
+/D [10700 0 R /XYZ 90 441.86 null]
+>> endobj
+10708 0 obj <<
+/D [10700 0 R /XYZ 90 437.377 null]
+>> endobj
+10460 0 obj <<
+/D [10700 0 R /XYZ 90 385.69 null]
+>> endobj
+10709 0 obj <<
+/D [10700 0 R /XYZ 90 381.207 null]
+>> endobj
+10461 0 obj <<
+/D [10700 0 R /XYZ 90 329.52 null]
+>> endobj
+10710 0 obj <<
+/D [10700 0 R /XYZ 90 325.036 null]
+>> endobj
+10572 0 obj <<
+/D [10700 0 R /XYZ 90 273.349 null]
+>> endobj
+10711 0 obj <<
+/D [10700 0 R /XYZ 90 268.866 null]
+>> endobj
+10573 0 obj <<
+/D [10700 0 R /XYZ 90 217.179 null]
+>> endobj
+10712 0 obj <<
+/D [10700 0 R /XYZ 90 212.696 null]
+>> endobj
+10713 0 obj <<
+/D [10700 0 R /XYZ 90 153.945 null]
+>> endobj
+10574 0 obj <<
+/D [10700 0 R /XYZ 90 81.969 null]
+>> endobj
+10715 0 obj <<
+/D [10700 0 R /XYZ 90 77.486 null]
+>> endobj
+10699 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10720 0 obj <<
+/Length 2112      
+/Filter /FlateDecode
+>>
+stream
+x��[Ks�6��W��R��xj&�>�N�t&M�^Ҍ��([S�r)9M�}|��A=,�I��
H��.�����B	��MD���3�n������w"K��*��E�FZX"��FobF���9���/G��I�L�^�8�W���4O�^̯�$�0
��gi�_=������z��F�\���E�^����YZ�=��N4�&����Ϟ_��y�pp4b�`$�&�,�޼����� k��������E���3�Ͳ��e��1FkM�¬�ݱ�0Dj���W�S+��4�FY��g�s&^ݥy�Y�_<s�u�;�4�QI¤8Uc�c�=m��o&��
H:��_�������߬�����<�6׈F��HYԂ�߱R�Xc��z�:
�Z�X�~�'��z<���u@=NX�͉�9�����t6�q��0-�ڬYh}0� �p�Y��=sF8o����E�I�o��ֱz��bQA,x�����U��ϳ*�6�iy�(\��OGL��Sm���Ow)^�t"��_�" ø�m�/ ɦ [...]
>��9V>�������h
82.�i,��>���h
�	��� tk��G��;�! �\��׀!'-1�O
q,��L!���H
��g����.8����
`��=q����y\�q�0��Y�a�;Ukث�
�fO?V�fֿ�,G&6O�}YI@�
�Y�uHV��B$E���Y�/Bl�(�|Zҝ�
�/=a�2D6��P
+x�~��m�^k_Rߕ�
+��.͖ �ɳ���l�v@�S�D�n#�,��N��
A
�R^YW���%�x�\ʗ��<�f-!%om�DS�%��(�f���Nj4���^�y>2F�)�g
�3��΂ u�Np�L�
�S���]����_���"�������d��Ϧ�e�U� �e5
�7 "	�;:-mE��I�Nk�w��o���r!�)��
��r��e���@
����
�(�s�Lť�6���2���fÞ��ʴܻ?Q"�
4�O���H
��|���l@�6@\y�ܳ>6�	�.�QZ�N6���v��&����=��T,�
sFh�Jd�%����Ѕ�w�oNU��X�x��U�� K;�s_�.��RW�]��)R��S�D{�����0��!;y�ڞN^�>^l`h�(5��P�
�$�g��
�a
<v�=������G5AK��
t�
�

@{�
lk�Ϸ���{��uzO�&B�}0e?1�A�lXO[B
JD$o�%(o@�µ$(�E�|	����X����
IB �����  
bǑ�!�W$�S�/#!O
��"HB�bӘO81�o�@V��F
�����,f�M cj�
�U\��ovJ��\%��(-*+������N0�������C$�;�����t�Kg��D�xS
+�6B�GV���HƉk�
�L��I �Kj�\�r���qk�RB��_"�����D�)D9W/�/����
+���A+�\�|�u@@�
��?b�c� �f����٣�7G<�z�mx'Jjq�
@}M�=�Gr�
C�G�A9�� ���.8p_��j�ݿ�p���K��r����^`u	_�� Rړ�=rZ'
+�>\eAb��T�W�
;��yL֢������\@ʾ��RЖ4� �dI��Yj_���JUߜ�^ ���~/�b��V �d��]�'U��$��N�<�`=�h�>���<X3c���
X��_��q�
+�'4�����n1O+��*���	�W�`Lg ��,�L�w:߁�
+oՃ�&�����
�4EcNNU�b��T�P�P������Ne>
r�#��"u�T9�侩@N-Y)���==���cy��^�_�O6!�D�J͞=�`�ᳱ�,_-C�����~�T�೶W����X¡���3
X)wb��T�HM}|�*!^�|Q���N��GR���9��Ey�`���4ߞ�g�a�a�O,���}��՚��#��~*Ocl��4%�4��v��_\\�߬��LJ���Ӛ
�^[67[U�r�W��g�p�꿠5�c�P���h�?q	(�EQ��Z����?,!�v�F��w����-
+endstream
+endobj
+10719 0 obj <<
+/Type /Page
+/Contents 10720 0 R
+/Resources 10718 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10665 0 R
+/Annots [ 10716 0 R 10725 0 R 10717 0 R ]
+>> endobj
+10716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.483 531.611 535.938 544.129]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 518.226 311.845 530.176]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) >>
+>> endobj
+10717 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10721 0 obj <<
+/D [10719 0 R /XYZ 89 770.89 null]
+>> endobj
+10575 0 obj <<
+/D [10719 0 R /XYZ 90 674.891 null]
+>> endobj
+10722 0 obj <<
+/D [10719 0 R /XYZ 90 670.407 null]
+>> endobj
+10576 0 obj <<
+/D [10719 0 R /XYZ 90 618.72 null]
+>> endobj
+10723 0 obj <<
+/D [10719 0 R /XYZ 90 614.237 null]
+>> endobj
+10724 0 obj <<
+/D [10719 0 R /XYZ 90 555.486 null]
+>> endobj
+10577 0 obj <<
+/D [10719 0 R /XYZ 90 465.363 null]
+>> endobj
+10726 0 obj <<
+/D [10719 0 R /XYZ 90 460.88 null]
+>> endobj
+10578 0 obj <<
+/D [10719 0 R /XYZ 90 407.036 null]
+>> endobj
+10727 0 obj <<
+/D [10719 0 R /XYZ 90 402.553 null]
+>> endobj
+10579 0 obj <<
+/D [10719 0 R /XYZ 90 350.866 null]
+>> endobj
+10728 0 obj <<
+/D [10719 0 R /XYZ 90 346.382 null]
+>> endobj
+10580 0 obj <<
+/D [10719 0 R /XYZ 90 294.695 null]
+>> endobj
+10729 0 obj <<
+/D [10719 0 R /XYZ 90 290.212 null]
+>> endobj
+10581 0 obj <<
+/D [10719 0 R /XYZ 90 250.48 null]
+>> endobj
+10730 0 obj <<
+/D [10719 0 R /XYZ 90 245.997 null]
+>> endobj
+10582 0 obj <<
+/D [10719 0 R /XYZ 90 194.31 null]
+>> endobj
+10731 0 obj <<
+/D [10719 0 R /XYZ 90 189.827 null]
+>> endobj
+10583 0 obj <<
+/D [10719 0 R /XYZ 90 138.14 null]
+>> endobj
+10732 0 obj <<
+/D [10719 0 R /XYZ 90 133.657 null]
+>> endobj
+10584 0 obj <<
+/D [10719 0 R /XYZ 90 81.969 null]
+>> endobj
+10733 0 obj <<
+/D [10719 0 R /XYZ 90 77.486 null]
+>> endobj
+10718 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10737 0 obj <<
+/Length 1876      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6}�W�)��
`q�$/m�N�4Ik�/I��ش��%9m���x�H͸=��H,�{p�`J��=�~�Pw��?�ON^j�,��+��ʳ�����ץ�~
+ f�_y�
aV�[��߾9�����7yq>�2a��X܀$�x����Ի�ۯ�0X�=D�<��o����Z�Y�#�*=b�0[f�( �p�lWz/
�Z��|�\����_o�3S�]n��[%
��&}��l@�ۻO���B�L�!��m��Xc�A����
ե��fLN�nj�*�<:�Y��V�dv���^���@%�q,"�;6z���
+�ET���9�ӧ5
͹�� �ͱ�V������b��]�1��2�S��b�ט���b��0X,�����f��1ρ��3�<I����������
�γ2kD���Ӛ��3
��#�,�.����MS����k�d	5E �XbS�mr�u�}��,B��c俔�N^*Z��DY�>G�R������
����_�DЌ�}7��E|V�b�2�_�H�6�Ye�״!х�#8���Pӈ���+�m��b}0���
�a�M����m���� ��Q"��
�M]&g�n*Sd����t�
���i���}mn�`n�hŨN��3Ϟ� �N�����j��p
�,j�:�a��J�9^�A\)��y.��!J�J�����*�1���1"��y�ߤKriiν�
o��e��`hRX������!���v���aq�jHJV�`o�#�R��|�2t|m`N��8��f�m�Xy�|�b�(���a�	yq��1‘��I����
���V,TT<��VTB��x���t2|_ �\H�H
�yd��G�O{�9���`�b ��@JYM
 �(-�c��[�aFDm���T���
�j�cvlnU���jG0��ڒ�=Um-�%��!����Q4@\��6�9F�4�d�{�m�8w�Ì6��
qTQ�GD	��2���~brlTF��r��[�#�����F��u|���
+g�|'h�w-` �%f���
��w(20
���^|'$��R#�k
+�WO��|�w%��O���\
YV%0�'�pqǭ=��a���|��BdT
f��ަ��Z��@D���T�Gd����VK�)"�[.)��V��m:�'�����m�x=%
�<H�aP00r
�sM���>�7����J�
�3cfvV\P`67��{�~��B�J1�b-�A�J���a�V�1�c��b ���p���濍%�
3�+V�^c֖3���^ƥ&4�$�˪nŸ����'t���\���@gJ�0��� ��5��m����[����;C�k��ޔ�wańF>���0.��qԂQ�������V6�H�AJ�vV�n���2�}��ANyR�e\}���u��Ǘ�8{������Z�1������ca�z��^�0$�S�6ަz��e����]�ڕ���E
���Ԫ6��]9Ǖ���PS�NH���56��L��N�F�
7�NY6ߩ�,Q�W:T�C�����#eiPe>:־����f��h~
�Y�b���#�a��8���n���
2�x��G9��UԘ[a6�/9j$rQT�Dz�o.m��av�al���w#�&�a
4]�SEE�ǩ=��QcJh��ҙ�l�5G:S�T�
�}ԧ�
+�_�$=됞�vKO�
_��~bz�z�Z����u�E��<�/~AS���h!~
+�џ�;ɍ�_V����������<o0Rl��ˬ��.pJF���3Ѩ��Ø�޽�/����w�XrV���nq_;��;�A��&#�6�s6�!����'N���O��_'Q,
+}B����?�����ɧ�뭿�&���I��e�)"?pt�IΒ�6A2��o�!���8��?��G&
+endstream
+endobj
+10736 0 obj <<
+/Type /Page
+/Contents 10737 0 R
+/Resources 10735 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10665 0 R
+/Annots [ 10734 0 R ]
+>> endobj
+10734 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10738 0 obj <<
+/D [10736 0 R /XYZ 89 770.89 null]
+>> endobj
+10585 0 obj <<
+/D [10736 0 R /XYZ 90 674.891 null]
+>> endobj
+10739 0 obj <<
+/D [10736 0 R /XYZ 90 670.407 null]
+>> endobj
+10586 0 obj <<
+/D [10736 0 R /XYZ 90 618.72 null]
+>> endobj
+10740 0 obj <<
+/D [10736 0 R /XYZ 90 614.237 null]
+>> endobj
+10741 0 obj <<
+/D [10736 0 R /XYZ 90 570.022 null]
+>> endobj
+10742 0 obj <<
+/D [10736 0 R /XYZ 90 547.974 null]
+>> endobj
+10587 0 obj <<
+/D [10736 0 R /XYZ 90 513.912 null]
+>> endobj
+10743 0 obj <<
+/D [10736 0 R /XYZ 90 513.912 null]
+>> endobj
+10744 0 obj <<
+/D [10736 0 R /XYZ 90 480.85 null]
+>> endobj
+10588 0 obj <<
+/D [10736 0 R /XYZ 90 445.786 null]
+>> endobj
+10745 0 obj <<
+/D [10736 0 R /XYZ 90 445.786 null]
+>> endobj
+10746 0 obj <<
+/D [10736 0 R /XYZ 90 423.679 null]
+>> endobj
+10747 0 obj <<
+/D [10736 0 R /XYZ 90 389.616 null]
+>> endobj
+10748 0 obj <<
+/D [10736 0 R /XYZ 90 355.553 null]
+>> endobj
+10749 0 obj <<
+/D [10736 0 R /XYZ 90 321.491 null]
+>> endobj
+10589 0 obj <<
+/D [10736 0 R /XYZ 90 287.428 null]
+>> endobj
+10750 0 obj <<
+/D [10736 0 R /XYZ 90 287.428 null]
+>> endobj
+10751 0 obj <<
+/D [10736 0 R /XYZ 90 254.366 null]
+>> endobj
+10590 0 obj <<
+/D [10736 0 R /XYZ 90 219.302 null]
+>> endobj
+10752 0 obj <<
+/D [10736 0 R /XYZ 90 219.302 null]
+>> endobj
+10753 0 obj <<
+/D [10736 0 R /XYZ 90 197.195 null]
+>> endobj
+10754 0 obj <<
+/D [10736 0 R /XYZ 90 175.087 null]
+>> endobj
+10643 0 obj <<
+/D [10736 0 R /XYZ 90 141.025 null]
+>> endobj
+10755 0 obj <<
+/D [10736 0 R /XYZ 90 141.025 null]
+>> endobj
+10644 0 obj <<
+/D [10736 0 R /XYZ 90 107.963 null]
+>> endobj
+10756 0 obj <<
+/D [10736 0 R /XYZ 90 107.963 null]
+>> endobj
+10735 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10763 0 obj <<
+/Length 2216      
+/Filter /FlateDecode
+>>
+stream
+x��Z�n�F}�WX ��Q��!�@n^lv8��
�D��J�BIv&_�jޛjJ�EX�>��[U�U�N�n5FT��>���~{;��V,0�H*�����@q���O��}H0�|<!��fLp����͘�p���������]���ӷ�$��O�c*�u����Ꚑ�yJ(��������g�2S���c� �y9�o�M,��v<���cC�x�YF�8�.���1�a����Ԅ�	kt�����38 y`R:��F�?�`���2���l�*��.m�2�y���g�6�iB��
+4C
q�Y�H(U.���m�o��u�������Zo�4ڭ�+"���
+?`�a͌��u��y
+�4��9��L�nABT9�-�¯<� .�T
�%����ڿm��t�-c�k��&:�<^
��� H��)c&�$�&�D#D>�}[l�?f *�̅B�٤H�RD���=$��]h0
�[��0��E��K��"�"�JA1�cA�Ѧ*��"`D �xf
+��ln�4Z��i��{�
��
�^J�%uݧ��X�q�1�?�?���L���XC�O�vB5�YB��	��
/2"M]d>�c-O 
�FiU
�8�/�Z7�"\��ga�
2DXcݘy�)dj�(k��
�$	$Ф�*
���
)z���|
�^jĴr��)
q�2x]<G*�����hq? n�ʰi4d����Y�?�(7�\�
)��`L�`Hң�c�^5C��R��IVpL�8�\ -���!y����]���.��4��\��d�4�%%�= #jr�#�8&!	����2�
d`��꧂�T6q��+
���:� 4L����_�Z���E�P�B3T����
+0�?�9ڈa�2�v��!b�]w��u��֫�=���
��a�_�
��S���i� HJr�����aj˘��D9�LnN�rZ��.or�
X���9w֞���
�҄Z�
�w�ub�@4ɠ̡
��w�����)Ed��e ��;g��Ld��qr� �R��%^Y.��,�p�;6�B
�`tc�ӪD�,Ub��\%�¼��q�k���U ��O�C (n��� �S<a2S�^���
H�A�+�(���)\O`� U@�f߅o~q|K�0&:�-����1տ���$~�Е���*�P/��GWJ BtfJ�"B��!9�;���u����K���;�����tk���
`=��	.!��脝UO����55��_Y��_z
K ��8�P� �
�%�X��ꞿb��
+�WV�GV؆JɫdS���!+�)�ًd� �KY�����f��.��
�Z)>uP��<�(�4
?��a)D�(d����X�̑8�?4,ʚbJ��a�Z�����Kg��L���U"}�I$�a�;�����+�h8�?u�A
�P���|:]owi
����O~Tk���� �
��A��E֞��Op�{�y�*��=w�q�� �c�=�5-����RB
Ә�dH�8���
�
I��lDŽ����H7
+Q�.-���w
+�%�e\Wf?_�@��%v�m7޺u6q�X\g��g��x��
�^�C�e��Eq
jV߈z��t
��l</���W�W���r��׻��C��6�e<u&
��jؾ �
���R�z? ��f�
��
�3�4�.-�2��a�
j M{A����y	��)����>�@��>Ҙ�
�!�֖(Sp3f4\/m9���<�
kH� S��
Kw
+�=��D��]<�$��&
fZ `�,����:�y6ƽ��
+,�RFZW�\+V���?����?��1׍���]��w�


+�
�"Ƌ3�or�/�0��V���b��?-�]�>ي��E�ز�+��E
j��v��`�,��r?�=�T�b����9ѳ��b@]m-;����NhO�
�uN��$T4�P�
+b2��S������z��,)m�~�xE��d�A9�Ӈ��*B�����j�sr��$e�d
~7R�
��T@/N�p������rWftC���ҙ��BM�
��ۧI��Q9r�9Z����l����1���qh�����B����ג��NK_�D�}�VR�(�{�6c$G�*0��[Sn[��y�?�k�_�����%��0�J����t[uO��&�u��,���%Y��OP>�s�^=
��RT*�q��L�����8y@���0����������j��%�X��:=*y����9�р��
+Ō�R4�|��Y~�xq��
�_C����
��
+endstream
+endobj
+10762 0 obj <<
+/Type /Page
+/Contents 10763 0 R
+/Resources 10761 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10781 0 R
+/Annots [ 10757 0 R 10758 0 R 10759 0 R 10760 0 R ]
+>> endobj
+10757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 101.726 168.326 112.257]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0593ba623dd81efd555f2ea41f1f104d) >>
+>> endobj
+10758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.707 168.326 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_ab5088f9329846a09702bcd0a05490b67) >>
+>> endobj
+10759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.663 74.707 250.079 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10760 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10764 0 obj <<
+/D [10762 0 R /XYZ 89 770.89 null]
+>> endobj
+10765 0 obj <<
+/D [10762 0 R /XYZ 90 693.576 null]
+>> endobj
+10766 0 obj <<
+/D [10762 0 R /XYZ 90 658.512 null]
+>> endobj
+10767 0 obj <<
+/D [10762 0 R /XYZ 90 624.449 null]
+>> endobj
+10645 0 obj <<
+/D [10762 0 R /XYZ 90 590.387 null]
+>> endobj
+10768 0 obj <<
+/D [10762 0 R /XYZ 90 590.387 null]
+>> endobj
+10769 0 obj <<
+/D [10762 0 R /XYZ 90 557.325 null]
+>> endobj
+10646 0 obj <<
+/D [10762 0 R /XYZ 90 522.261 null]
+>> endobj
+10770 0 obj <<
+/D [10762 0 R /XYZ 90 522.261 null]
+>> endobj
+10771 0 obj <<
+/D [10762 0 R /XYZ 90 489.2 null]
+>> endobj
+10772 0 obj <<
+/D [10762 0 R /XYZ 90 454.136 null]
+>> endobj
+10773 0 obj <<
+/D [10762 0 R /XYZ 90 420.073 null]
+>> endobj
+10647 0 obj <<
+/D [10762 0 R /XYZ 90 397.901 null]
+>> endobj
+10774 0 obj <<
+/D [10762 0 R /XYZ 90 397.901 null]
+>> endobj
+10648 0 obj <<
+/D [10762 0 R /XYZ 90 363.903 null]
+>> endobj
+10775 0 obj <<
+/D [10762 0 R /XYZ 90 363.903 null]
+>> endobj
+10776 0 obj <<
+/D [10762 0 R /XYZ 90 329.84 null]
+>> endobj
+10777 0 obj <<
+/D [10762 0 R /XYZ 90 296.779 null]
+>> endobj
+1238 0 obj <<
+/D [10762 0 R /XYZ 90 225.925 null]
+>> endobj
+390 0 obj <<
+/D [10762 0 R /XYZ 90 217.967 null]
+>> endobj
+10778 0 obj <<
+/D [10762 0 R /XYZ 90 119.909 null]
+>> endobj
+10779 0 obj <<
+/D [10762 0 R /XYZ 90 119.909 null]
+>> endobj
+10780 0 obj <<
+/D [10762 0 R /XYZ 90 91.155 null]
+>> endobj
+10761 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F24 537 0 R /F60 540 0 R /F22 2982 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10818 0 obj <<
+/Length 2131      
+/Filter /FlateDecode
+>>
+stream
+xڽZYo��~������YH�4.�fqk�{�BSc��p�����YH�2-ɶ,�(�3s���w�bg�`緣_.�N�8sB��w.��;�
��÷��e˜?���w��"����?]��ty�~;zwy����O�!f���ң/cg�w0ba���Rǥ
>����#leY�Բ���l��d#4D8p8!�#��r��d
g�\NO��'Q^tWYU�MT��2AZ�v��3��}B)�]��B�ٿR�
˅��/5
uW�	�뇭��b���8�n�>�!Τ(ggS�M�2
��|�z|�
��dM�V���|�R�pQr�¯�� �z戴�`��|
g�*�	�4
���4q2��L��4���\_+a�O��cdU���Ž��F��M��S�'
�Gf2o�����
̹*�\�63�
���߂�OQ���޿?���WD��D�
�}`�� �]�u
�e;`n�
�(�a�C����L�~���8���:�����(�r�F?�T�=Hc��)�ڀ�
+~�L�G
w���a�d��d�ǩ̔��zY��c��U!"9�Fn
�}�z*Pɺ)�uB�����:e�N
+���,J�J�hRW0`R�8��.�a6���|�aS���|� ���ȑ��- Z�F��f&E���ROiC�Xf����g �7!�5 ��-�#���
9�)i��?%�.^�w����#
�r��&���
p�n�;��	ű��A�bܪП���HdR%��ԛ�Z>�

��'9u��0{�ےd��M��
1r�H<�!��Y-�i^.gU��|D^��Z$3;6�fWKe�2��C�;iS�U�d��B-��p�h�1;p�y���h4�?FQS�rގqꇈ���c���=�hv��`�
�6&����L�v���Q\;,���(�}WQEq<�7i�¤�w  -G�����XU=�:���������狷�ߛK�J�
khAV�ޑ�h��/b)�
?,�ڮyU�R������BsoȆ�����}[���mȞz�֨ƒ��\�

���Qt;G���O��
�y�Ry!K�z\�$_�!�:Oy�fdE0cޮ�B.4';v�Wy��B�$�ĎG���7��7|���}2�6{9���`6�͜�
8
S����Ü�ǔb�Jaw��M�33�1�����}4
D>��H�-m`����~��,t9	Vr�
�(�{��O�O�����BDQޞk,���������]4�
竬��F>DȾ���Q�D����&y5��>~�ɵH�ѩC�xPo�wq���-��q��9���w�\#����ͦ�ֈ��H(G]�1�5�¸��;�~�ZL9��Tf�Mv:��T�+��ov�}�|N,���hb������4����c(O�
�|�ti�����\Y�V���2C�v/流r|[�=NY��c׼�)��Ѻ���U���R&@5e%c���*x��AFV���
j��b�T��2Y�#�k�ȫ��s6���U����cyZ4��g��4~���'e�[{G�c*�櫨�<�E���
��O�����u�P&2��^J��n9aS%��Y����]�||o x��r}��5(k2gh��3=��Pjc{�U�#�n(t�t[PУԑ#	������i��M��3�/�s�#���M�B�����9S�?�H-�/���T$�,d [...]
N[�zB,��x��1*�E 1
&��ՔCv�_?��Jo`��Y�E&6�C;tt
M�$���X��7��)�۩�1{��
���^X<N��ޱ��i��5���m���
t��H+����r���񽷕�.G^�_��~�	��x�o�Z�؎�7Nߧ��5����N`��~B�
x�JY�{�
i���k�u��?���V����<��?��iY����gop�HQ�@n��
�����['��CoPjc����7u]�>=�j��(���9qe
	R
������4/�F̔` �= �
��
+endstream
+endobj
+10817 0 obj <<
+/Type /Page
+/Contents 10818 0 R
+/Resources 10816 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10781 0 R
+/Annots [ 10782 0 R 10783 0 R 10784 0 R 10785 0 R 10786 0 R 10787 0 R 10788 0 R 10789 0 R 10790 0 R 10791 0 R 10792 0 R 10793 0 R 10794 0 R 10795 0 R 10796 0 R 10797 0 R 10798 0 R 10799 0 R 10800 0 R 10801 0 R 10802 0 R 10803 0 R 10804 0 R 10805 0 R 10806 0 R 10807 0 R 10808 0 R 10809 0 R 10810 0 R 10811 0 R 10812 0 R 10813 0 R 10814 0 R 10815 0 R ]
+>> endobj
+10782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.426 176.075 705.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1536912b00035624ffadf2fd0298e27d) >>
+>> endobj
+10783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.623 168.326 678.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a035ac574273473466efbdd057e0c94ae) >>
+>> endobj
+10784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 639.821 168.326 650.351]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a44eb40b6727686a6074e6053fec3a4a4) >>
+>> endobj
+10785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.142 639.821 207.329 650.351]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 611.644 168.326 622.548]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a29017b2a17f08373830d7072b178a57d) >>
+>> endobj
+10787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.663 611.644 272.913 622.548]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 583.842 179.554 594.746]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 583.842 250.666 594.746]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a64f7448aba6cc2e8eb4ddd3159faa32d) >>
+>> endobj
+10790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.809 556.413 200.604 566.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a029ab9a95a7a2294c64305a10a1eb1b3) >>
+>> endobj
+10791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.42 556.413 239.607 566.943]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.809 528.237 245.137 539.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a239a191aa5c1d63d9aa65d0ae44ad491) >>
+>> endobj
+10793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 500.434 161.711 511.338]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4cd383a0e5302639104689a197061d5c) >>
+>> endobj
+10794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 472.632 191.718 483.536]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+10795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 472.632 288.852 483.536]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0e2249d61de907685faa4be0ed966f67) >>
+>> endobj
+10796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 444.829 191.718 455.733]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+10797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 444.829 303.079 455.733]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0c8da5fb852473a4552fb67ce00b62f8) >>
+>> endobj
+10798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 417.027 181.845 427.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a768af1a1ab63ec4ae39ec442ec69ffb2) >>
+>> endobj
+10799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 389.224 181.845 400.128]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a9fcdfff651b77ae9c87a326e106b05e1) >>
+>> endobj
+10800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 361.422 154.727 372.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0aae60933043b8a5733655f003b49855) >>
+>> endobj
+10801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 333.993 176.505 344.523]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0f6e7b8fecb60b49b68bad8576548e46) >>
+>> endobj
+10802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 319.045 450.955 328.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a9fcdfff651b77ae9c87a326e106b05e1) >>
+>> endobj
+10803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 295.231 150.493 305.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a237ec5be197ef82cd3045f68d8c223bc) >>
+>> endobj
+10804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 267.055 169.013 277.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a2ef0b7afa0f59700854cf2dbd51c4cd7) >>
+>> endobj
+10805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 267.055 227.245 277.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 239.626 174.852 250.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a4e46696e098918fb68f044865aa74d5e) >>
+>> endobj
+10807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 211.45 189.725 222.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a5f263887740d68ef52175cf69063fcd2) >>
+>> endobj
+10808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.541 211.45 288.384 222.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) >>
+>> endobj
+10809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.812 211.45 415.228 222.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 160.733 177.91 171.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a365743de53f5e65ceb69a2b8d89b0343) >>
+>> endobj
+10811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.247 160.733 249.849 171.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+10812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 91.064 203.075 101.968]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 91.064 296.324 101.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1251bf9a71caa2e554ab22242374c1a6) >>
+>> endobj
+10814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 76.49 326.375 86.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10815 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10819 0 obj <<
+/D [10817 0 R /XYZ 89 770.89 null]
+>> endobj
+10820 0 obj <<
+/D [10817 0 R /XYZ 90 712.265 null]
+>> endobj
+10821 0 obj <<
+/D [10817 0 R /XYZ 90 686.189 null]
+>> endobj
+10822 0 obj <<
+/D [10817 0 R /XYZ 90 628.858 null]
+>> endobj
+10823 0 obj <<
+/D [10817 0 R /XYZ 90 601.055 null]
+>> endobj
+10824 0 obj <<
+/D [10817 0 R /XYZ 90 573.253 null]
+>> endobj
+10825 0 obj <<
+/D [10817 0 R /XYZ 90 545.45 null]
+>> endobj
+10826 0 obj <<
+/D [10817 0 R /XYZ 90 517.648 null]
+>> endobj
+10827 0 obj <<
+/D [10817 0 R /XYZ 90 489.845 null]
+>> endobj
+10828 0 obj <<
+/D [10817 0 R /XYZ 90 462.042 null]
+>> endobj
+10829 0 obj <<
+/D [10817 0 R /XYZ 90 434.24 null]
+>> endobj
+10830 0 obj <<
+/D [10817 0 R /XYZ 90 406.437 null]
+>> endobj
+10831 0 obj <<
+/D [10817 0 R /XYZ 90 378.635 null]
+>> endobj
+10832 0 obj <<
+/D [10817 0 R /XYZ 90 350.832 null]
+>> endobj
+10833 0 obj <<
+/D [10817 0 R /XYZ 90 312.071 null]
+>> endobj
+10834 0 obj <<
+/D [10817 0 R /XYZ 90 284.268 null]
+>> endobj
+10835 0 obj <<
+/D [10817 0 R /XYZ 90 109.927 null]
+>> endobj
+10836 0 obj <<
+/D [10817 0 R /XYZ 90 109.927 null]
+>> endobj
+10816 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F39 2335 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10853 0 obj <<
+/Length 2643      
+/Filter /FlateDecode
+>>
+stream
+x��Zݓ۶��BO�T[8|��ؙq�\��m]G�t���PubK�
+I����w �!�N���#.v���-ttv?��������
�,"��z���":
dD�����ݜQ��b�(��7
F�qy���,8���>ٖ���t]������4O���v�ռ(�_V?\�2�c�'\
+n���$
@"QC�IDt(��>�"��j���W��ϓ�1���μMvI�`�<�70�4��B�����կW
����Q$g��ջ_�l
�?�(Q8{0D��丵l���?���1�p�g�,��
m�&��������o��+�O���V�
:[rI�PX?SE�V4���q݌��Mƥ��xHk����X����D�j���ǹ���(�
�
���Yԍ�͡�ut< R�#�p�D�A������m�kC	&Ñ�
,�
$pdK���%����MQ�e,�/���
�{�o����☔q]�>O�D���_\:F�����=�T��`�S_V�
F�cO�@M&B!�'����
�L�K�
p�b7�N�H��DZKsF<P��H�ì���>����q��csr��U��8p��-�݃������
?J�K��<!Gkѫ�����MR�i���o�jS�G����Hg��[�%QѸ�t
�|�[�6>CIM�#KM�~���s58v�ELk,Uy�g
+
-��B����l��VU.4Ď2��2��Y����B�
+�m"�yT �I9T�b��2��xi� ��9��C��Jܞg�X s�Q�o)�C!a��1�'�0$a��s���
���E#��=��ގҼN���2��&����o�$�+S0J +i�2������MS at v->r�������H��X�MF��O�k�J�\D�-4|�	w^����V�E�P���.S��q�����
����)(���!��G'��J��7G�N�q�6���
��� ���
+4,��S���.��H
�
�
�=�G/+
��*�q�x}Fϼ%#�m��}��
 
Pԡ
�!\�=�җ�@0��W���ɴSt��9�
+�|�
����a�g���G�/J��:ƛ�q͓x��
N@���d�I3�
��s��$����
 `C�Z�x�
+hXZ�.Mn6��4^g>�2$���>�B�6������Ȅu���G�n��w�䖒2"���4���>ɓ�
" �<��RJ9_���4s�4��E
����
S��Mj0v9
��1�
X?
-�#���)�f/ǸD�\~Q�� ٨(��F���]>N]�E�C<� �@4�ér%e��r>JV�8�\a��W�ayu8��'�x�m	��c�s���ⱺ��5
�)�

��=F�\�#g��!X�T�
T���)��NX%��2V1����j

�	zgn2N�nU�5w04� �cY����mb?����B6������̽�ƭ���]
����zS
l~��l
�\�b��i] �כ8�Б�em��ۮ,n>�7{��"O
�hb�Oi�cg��7��-dI.� �ɴǽ�7�,@�&�Al���R d��U��"�.ͦ��hUw�fe3��~�)=��4�d'<@���:���Ɏ��65}���J8]��uǁb&�6A�_
t5���
NY�
�t7����6E}ߧU+c�H��I���*�l�� S_Q��_��O��}4Q�c�,q��o�v�oָis�8ا��s�
*�Ot|(�Ǵ-Ӹ�me��� ����/�5
hL�Nc
�Y%��5s�e�0���F�}V��ގ����i��) �V�8w8��X��
2� 
AlD
+�@A���x��Kڼ�˓� ����j�ֲg��y��y[���
�O(5��Ȗ
���ocLq�P1�
��R���C��EiK�4[iֿzXykv��bKq���
�جw�)���E�T+�Ej���-�D�z_���v	(�}��>��}i�E4��@x�
Q�U�
�
 Ю���d�WV�G�dWdY��=X�M7�u�����A�����p!�N}���Y_�3� ��v��R���>סm��c>��}�4>��Dإ(
�mi
��|4�
��f^�͙����

+���Hh~s��ͣ����B��?��&K❴��#1�7��8ޡ��R��
�!Ɋ��D��հxi��/?
�g�
������E���δ<#@��9]taWҫ������^�=���W�2Ëk�x�Ȳ݀�2�����z�Ȇ�.
+��tg��Q�U
(�4����Mᮯ�����C�Y7���A쉦�n�c�}�	L�v���Z��1z���6�5��Qp��+9S���L�/��jR �Z0�) ^�s{/�O3_m��iO�ב��U���:
+���$�_A�8���䔃nu�om�g�di�ix��]'O�I
���> G��C�P�j�����P��,�lc����,{�+��*gsQA���
+�w]�� Eh�������A�!����c�~�2 *r���0���k;�g��X(0�}�k��|��m�\�U-FرLB
z�Ї��4`�*��Y3��-f�:x7)��Y�u}���^��$�'جO~���%�_����P�-�Ac�D��D��RQF��5���8�,�����f����� f�`���D��
+��
+endstream
+endobj
+10852 0 obj <<
+/Type /Page
+/Contents 10853 0 R
+/Resources 10851 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10781 0 R
+/Annots [ 10841 0 R 10842 0 R 10843 0 R 10844 0 R 10845 0 R 10846 0 R 10847 0 R 10848 0 R 10849 0 R 10850 0 R ]
+>> endobj
+10841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 644.339 226.034 655.243]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0801eaf17912403e4e1028f8a369d340) >>
+>> endobj
+10842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 644.339 375.591 655.243]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 602.117 226.034 613.021]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a0801eaf17912403e4e1028f8a369d340) >>
+>> endobj
+10844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 602.117 375.591 613.021]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 499.864 232.235 510.768]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+10846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.296 411.894 326.022 422.798]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+10847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.494 354.076 404.682 364.979]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+10848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.615 258.528 233.342 289.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+10849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [115.086 188.094 192.396 195.62]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a239a191aa5c1d63d9aa65d0ae44ad491) >>
+>> endobj
+10850 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10854 0 obj <<
+/D [10852 0 R /XYZ 89 770.89 null]
+>> endobj
+10855 0 obj <<
+/D [10852 0 R /XYZ 90 703.752 null]
+>> endobj
+10856 0 obj <<
+/D [10852 0 R /XYZ 90 585.875 null]
+>> endobj
+10857 0 obj <<
+/D [10852 0 R /XYZ 90 536.169 null]
+>> endobj
+10851 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F39 2335 0 R /F94 771 0 R /F10 773 0 R /F13 835 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R /F75 562 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10864 0 obj <<
+/Length 3005      
+/Filter /FlateDecode
+>>
+stream
+x��[Ys��~ׯ@��
Y1�s�M��C�lֻ�Zq�J�rA"(!K4J�}z
It�_L�t���u7���G�8yq~��L�(A��2:�E	�O����4�1�?��1#�Hx��~��O�:����>?�tB���% �������
M��F,��;�hq��w
�;��	v�`D���?���
8#b9 I��xB0ƣ�e����U]V�	���;��*�o�*�֋���:/
�|x{�5�
1�x�!�����r�֙&�����T
+I7���]�I�����~��"���
�1J5��nWx��a�,�1/���x6�bTV� A��b�
�O`
2��!c���4��@���٣'�&Uk~�b�$��e��8������y{Lqo1�g�n{&��-�g0��$�-�0�&��+�֋u>���l��Mf/�FZ{=�⚫����ղ,�yq��(o�jy2)���%�d��(Q��

0�ńx�p!�x��*[jWZ����"���?
�� ,�&0Ł�ё��4!&��`i�#�hЧJ�
)��z�}�\�Ҩ�h�#bC#�+�)��$��žͪ���γ⺾��U՘kײǴ�(�(���C,���v�Y-�	�s��;��J�w�F�G�L�2�,pc�L�2{o�C�_�o��������.����b6&b��M���V�N�_�
y��
�a��?=]��?v?NL����j7�@�K�[!t���$�`���������z�b
�q��)4�b
�8��~�g.���� [...]
#�!�Hvʺ�
��?��S
'>
x
�QV��
�
.0�k?>���at�[=$�c� �������_�z]mI��H��~1���
C<nOz��WY �2��jqb��t>o0Q6�bju]��a�ʊ��
+����,�
�U�[H�VN�庘f�g��
oO
j�� �8nw.� ��|�� =�O�
zB����`�Ჵ�����
�E�����e�Z��{�׺p��??�Ӣ��<k,g��X&�
�~Т_3h��AK)�'hi��&q
+�>��"$s��\4���.*���*���f��A4�g4"v�B��8i3�f�c��"��.�,��H
`4g��ޢp
�s��Kම��vL��n��֡
+
J	8
�I�t�����
l�M7������d
+Jx��>DQ��!%�
�3#�f�Y at j�Y�&�V��Q�.�l���y
��LʼnW���qk�� o
�+^���։
vT����3��Gּ��lZ�������jU^�[��@i��gl��_jc���̎��I�K7�{V.�J*s[c7���Ӆ�{{�y��r��4p��h?��eU~��M��fi�F�"�u��,�
8�k�G�|J6?��'Di#��;��:@���-`�=����C�{&t���'(;�
+86AS�3&�h�%9@
&b`#��.��ɦ�ʃ� �F<˚��r�:��p�I���HJ�
=^�|�w6�.��5�4u��U��}�҈�ޯ�k0�}%)��<Z��V!�
��M�"D�8Q�%wv���C��������Uc�Fm�kkOc'lm}v^d���5J7S���R�%�X�5�������o� )w�|�%>���5�@2j�-�:\##H7��d�G��Fh��/�}h��~��
�6+^+��v���3�*/�
8>L��V���-����X�8�����k���(#�wy��n	�X�b���҄kX��h��^
+'�E�5
v�6�\���|��㵦�7l�!����H�Tg��L�M���� ���=
�B�ݝf�/���N"AI����4a��Qxz�P3 Q��4�H��7��4T��m�+^.B�TWM��
+�jt�I�@6���A�_:��&{D at z�U���ۈړt�]� ���2a�Bh7���\aX�M��{�l}.
��T���
U�H1
����(�
Q�Y��}'t2˨�pq�ǎnN�7g��N���$I4`��\�6�p��u���:<��s�"�9!6'�^���]��У`�p�V��(pĻ��^
.���o#��.�(4��5�n
��@@%.��is��!�o�E`�C8���
0��
+X ̦�YGKbo
�zK�`�Ob��|l��`������h��p�K
���9�7�1/�mqH/}n�Gy�?��A!u�1��h�Us
+��s�A�� �߼���x�M�xr���>�ɢ��GwM�'��p
���Yyw�5�����lV�=�ʿd���6	�f�3kJ���^�j�~0�H�� C
���-i1
�T	N/7�`0}��v��fP����nsB|!� OI��i�
+
O7z��<���Ӗ�����zQ�{Ci��:�\�d������v��#�Ձ�#���kpxľ��Hl

�]�
�1�D���y;K����QV�<
9y �;����?
��2��A;`�e�Q+´j�y��h�*���� \H�W��y�7���v����p4�$(�me�he��m�Ă�'�lZ
+%��R ���=
dؔ��ɸ�`�!2�U�A�!�à7;�E4�C%���X���v���fg9�/(zS��ࣃ6��9����|ݬo>"�A�LP���9�a �~�`'vĖ��)��:�W��#5�5��4!�6p�4��&��k�?��`s�cG����х1e/@���æ��|x�i�8�o�xѶ��a�1�����%�t��9�I��>f~�4f��g�|�����wydWuYeC-�A��h��ZP���Gt��7�e�|���/5���8`�/�'`��yؿ6�w܍��\��U	�:r�7�6��[�搶
���.Ǯ�m�����VY��#�HߤźI��
�j�G�Ȳ�b
@ܸ�]ք*��o-���_]�xR������������*+� �M ӽ�$�r��T���-V�W?G���
)I�
+endstream
+endobj
+10863 0 obj <<
+/Type /Page
+/Contents 10864 0 R
+/Resources 10862 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10781 0 R
+/Annots [ 10859 0 R 10869 0 R 10860 0 R 10861 0 R ]
+>> endobj
+10859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.483 619.602 535.938 632.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1251bf9a71caa2e554ab22242374c1a6) >>
+>> endobj
+10869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 606.217 275.98 618.168]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form_a1251bf9a71caa2e554ab22242374c1a6) >>
+>> endobj
+10860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 105.012 228.516 118.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1FP__Oracle) >>
+>> endobj
+10861 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10865 0 obj <<
+/D [10863 0 R /XYZ 89 770.89 null]
+>> endobj
+10866 0 obj <<
+/D [10863 0 R /XYZ 90 721.073 null]
+>> endobj
+10837 0 obj <<
+/D [10863 0 R /XYZ 90 704.201 null]
+>> endobj
+10867 0 obj <<
+/D [10863 0 R /XYZ 90 704.201 null]
+>> endobj
+10868 0 obj <<
+/D [10863 0 R /XYZ 90 643.478 null]
+>> endobj
+10870 0 obj <<
+/D [10863 0 R /XYZ 90 592.245 null]
+>> endobj
+10838 0 obj <<
+/D [10863 0 R /XYZ 90 567.711 null]
+>> endobj
+10871 0 obj <<
+/D [10863 0 R /XYZ 90 567.711 null]
+>> endobj
+10839 0 obj <<
+/D [10863 0 R /XYZ 304.125 458.684 null]
+>> endobj
+10872 0 obj <<
+/D [10863 0 R /XYZ 90 452.044 null]
+>> endobj
+10873 0 obj <<
+/D [10863 0 R /XYZ 90 371.514 null]
+>> endobj
+10840 0 obj <<
+/D [10863 0 R /XYZ 440.014 205.532 null]
+>> endobj
+10874 0 obj <<
+/D [10863 0 R /XYZ 90 198.892 null]
+>> endobj
+10875 0 obj <<
+/D [10863 0 R /XYZ 90 130.318 null]
+>> endobj
+10862 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F100 4949 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F7 803 0 R /F99 864 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10889 0 obj <<
+/Length 2283      
+/Filter /FlateDecode
+>>
+stream
+x��Ymo�F��_�C�
��6�F.i�
+��
�M���@���M�"U��c��;�]�,���\�
�O"�����33��w�a��я�g�y1�Cz�cO�!ܭ��>�(
&S�1�g����$�لb���o�Loҫ2)ߞ��rB"����f2��O�����\��o�/%(�4�>c���������G��
�fHD�rs���V��'#G�]#��8e�y�~=�fG�/���T?f�1�3�������^�zW�Uc�X
x)�M"$p�M�3�_�˝T�8
�@�
+��4B�z2e������V�I����k\\�j�\ʪZ��Z�mc�ǝ�u�U��A*�X+U���]Z��/q�;S�EU�Wi����6c�1*�ve#�����|e�lMWz`ypJ�QpAP
f�2Yf��$|�t��ȼn��d�ފ�(|�6���� �'
�j�
p����\m�2��Z�
�qkˁD θ782B�J�����4�
�7�ġ�ԠW�ug����pD�Ɛlq�yR^���Ť
i����c*�[#l�gSm�ʲ�ڤ�E���I�/K�oq�y[�ԋ��2
�u��]�11"��1�Ur�����
�
�L��oRp�M�2���
+n�r8(ˆӨ�8���
�
�ĸ��bc2�;3���%�L
ECа	�K�z5���}M1"$
h"�i�Čx!���H�H@<zS��s8@ �!��ڹ�MR��3�Ors�&o'4�L?YI�\��$ձ�⩈�!6�23��P
��J&�D+�]�(��P2�wg�B��_��A�b��
4~0Bx��) ��"�k�16㈲�]���0�PB�P�ǁe��
 �Q�nn/7TƑ���:��84A#�#_
�������0�x%
�&�3o�"b�o��H�J�9�?�KL�9�3��L

C��b�l���q�\�@�B��
+,�ׁbhl��a�|�\����M}r,�<�` n�n7F.7��qhח@�F��
��Ω���'Q訢{*
�a�H�^q�
�\����ؑ�U�E4~je
��@�)=�?�}?X[

;_>^�%۲����MWmٿ�o;����5K�Zʲ(K��3�F�m��
P�j�ì�kU�]
�����-0�E� nj^H[b�.l(��w��ӥk7�P�z
�0'�^����h��}?����i��Y<.�����M�
+�BR��2�0q�� �����Uw�㈛c��jؽ��/󕾸��Ě��]�ԜRݽ*���f>���"���ֲ���;��(�*��s���]FUM3��9�lm߉��*��e��`
�]�T������R&����'6��tUP�pO�wY
(�Y¹�Y`XB�H���V�.vF,��2��:�CXp�%ۛ4�I�8SP,ʍck�@p
8uPD��'W$"Dz�

D+�t��B�vb��t�Z�	N����R����q�"(ӊ>��`r�ݮ��Lfv؀S�rۚ��������
bԊWV�h
�&�W��s��ј�����U۲�e���u�e���]�3U���=� z΁��A� �vp���f���D֑�����5 v�R)oF���O ٌ"�Ƣc
�2��z�9v��
�8*]�W�1�0�����
G(\�ah��'Ɠi�멱Â�9��71A0S4�B��nq5�
U�Jh��Н5��5�>ri��y��6��iQz�N�_˲��YSLz>=+��2�lz�W6�t�HJl����|��V� �q��t飵�>f���C�O��sN�E77ˇ����N�(懳S׊�����}��}O:0�3t�@�W��<W�:r;�4Q.'
����Eޞ}�f�
<�nKZ[��Ԙ����W�̭�}_�dR� ��u��SX?�U>�0�5�O����
h�7���w��A9)�,�Ŭq��/~I6r�OI�yX�������׮7����
��2���l�f���@u���Ss��&:����+t��t6�Q6&��{9}���A�'�
>v���a��ɋ��������������ٛw/�#m��/�4mN��$
��H/q����-�#b1?�0��ݻ�� 	"�
��$PT�ܼU>�F���g*�����ciH�L��~,mz$`���Ps�8���썾�O%��׻�I�N�n�FWV
�#�lK��zPx��^�Xӆ��W?��W9�Q�gn�z{�����5Z����j��ZY�MQ�v�7
�D-�h}`EWh�
p�PZ1�6�����E�����y�
+pr�M�/��[
+endstream
+endobj
+10888 0 obj <<
+/Type /Page
+/Contents 10889 0 R
+/Resources 10887 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10781 0 R
+/Annots [ 10876 0 R 10877 0 R 10878 0 R 10879 0 R 10880 0 R 10881 0 R 10882 0 R 10896 0 R 10883 0 R 10886 0 R ]
+>> endobj
+10876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.533 611.873 490.745 622.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+10877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 199.022 192.544 208.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+10878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 129.952 244.968 140.483]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983a) >>
+>> endobj
+10879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.738 129.952 294.581 140.483]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983aac4528dcb9794c502cf7c9bd65e9c54ae) >>
+>> endobj
+10880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.458 102.979 243.782 113.509]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) >>
+>> endobj
+10881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.393 102.979 413.893 113.509]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da6a4badcfd0bb8d6e536fa16b2d5108d0) >>
+>> endobj
+10882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.801 102.979 513.996 113.509]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) >>
+>> endobj
+10896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.023 185.631 101.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) >>
+>> endobj
+10883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.62 91.023 289.122 101.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da4d21924dceed7aac6368d4bc5affeccf) >>
+>> endobj
+10886 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10890 0 obj <<
+/D [10888 0 R /XYZ 89 770.89 null]
+>> endobj
+10891 0 obj <<
+/D [10888 0 R /XYZ 90 484.729 null]
+>> endobj
+10858 0 obj <<
+/D [10888 0 R /XYZ 90 462.353 null]
+>> endobj
+10892 0 obj <<
+/D [10888 0 R /XYZ 90 462.353 null]
+>> endobj
+10893 0 obj <<
+/D [10888 0 R /XYZ 90 404.21 null]
+>> endobj
+1915 0 obj <<
+/D [10888 0 R /XYZ 90 322.645 null]
+>> endobj
+394 0 obj <<
+/D [10888 0 R /XYZ 90 314.616 null]
+>> endobj
+10894 0 obj <<
+/D [10888 0 R /XYZ 90 216.494 null]
+>> endobj
+10895 0 obj <<
+/D [10888 0 R /XYZ 90 146.114 null]
+>> endobj
+10887 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F7 803 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F24 537 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+10958 0 obj <<
+/Length 2014      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�6��_�O�
�
)��ԭ���-m�dð�0�I�ڒ+���_��HQ/�_'m���e�x<�
�{��uea����#�X>�]۵�/-[�����/�^

�Go��
�C�waV9�����/���������W�"�Cܳ����lE0�����{և�hfQہߩu6�m��,�L>�-�O:��Q�..F|8���ض�ቘ]�L=-����$/�3���ᑋl����Y0y.W�_�6�̕[ˮ�
�i`�3��'ǧ��,���Yk��
��
��U�(��$A'��\���'��5;���N\*w;p�m�	Cأj'?,�i��Jf��)�xS��W�lDٰ�j-�Q�ج� �5�*'q�sL�$Qׯ\���4(��

9~���R�"�NQ�8��y�p�%�L�

'=
)A.!Մ��آ�G�`�.� �15w��}g?K�|��f4v�#��9b;ˋ��4�Ct��k�,��
B�A w>9����� N��rd3��wg�k�� ��K|�mm=�g��\�ϭҋ�O�kK3�y<~�Qdi�S�ry6�� &,�r^ij�c ar�F�m�$:y������OϏ_��c��I(" ��Ǔ�p<�[
I��8�j�:X�ɕz��A(ԣq. [...]
fA�U�:2�ٷ�Ga�bPS��A5ͷj��:��&����Շ�+Fq(t�H�p�U㽎�
d�&��2�Je
a�������A�5x
d#���-O�f��
�)�R�N+�#����25�
�
!�l�s��|�s
��'y�8��
+"���2�)�U�k��8'���"I�1���m��
l_C��P��C�m(�d�PD:��29���|�Vf ��f��K]v�(�8=+�R����&/�%:��w
+�T�j���)��]G�
.�1
� OT�'�4���-����-�'q��B���K;�^�ƛ����qq�aa_��™_�p��rN
_��&|�r� f�6R�Wp�@��s� 8S��U�l+���[����rGm�e�DGqd7U&=�i�ԋ�H��S�C��ZU�G6m��`cr����&��i8��p
��) K
~��ݜ�`���s� �/�Ѵ&�B��J 
����O��
1{�6J�� |�s�����wQ,�D��&��"I����ޱW�M�Z�;x����n\���W"�t
�?�h�t7<��\@hU!^��N;�_V;Tu ��x�O�#�ء����"�>�(�ą��Eh��|r�,'��0��D�4��h%7b ����lT6di�=6�c��d����K�1X�)Ai+p�/�N�O^�Bs(hǠ����٬�曰�R�
+��{c���l�H��oy!��
+�f���CԚ^�C
��U��1m���|(ܪ��_�l�8�&Z/e�I�h�#�S��}s���C��U%$�
b���{��q��T �u��"�D1��8��~�����i� �V�	����B�_
��)�FQ�g4#R�����Wj��t���*�T�����Q�F��X�S�9���"4�GI��2������tr����������s��D��K������J�ܺϫ
����>�"�� @��
C�"f�ʼn�
�^o�̈́ ���v�:�����629�*���Cu�?O�mF��<\�
+6ܣ�%6E�v
�\���k�u�2[�7�o��Qoo��掟�H>n�+����1�`w�
}7c�Ln�d�[�K���
�k#
��7����#�_�`�	�v���\������c�������k��7�`���]�(�DӔ�9�L}z��z�#٣cC�\'Ab�7�X���n}D@��T�
��3Qe:J�wF�_���s�L=sGp]�LJ���\$W(Lg����*anr��*u����(08
V
 0࿪��
+endstream
+endobj
+10957 0 obj <<
+/Type /Page
+/Contents 10958 0 R
+/Resources 10956 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 10781 0 R
+/Annots [ 10884 0 R 10885 0 R 10903 0 R 10904 0 R 10905 0 R 10906 0 R 10961 0 R 10907 0 R 10908 0 R 10909 0 R 10910 0 R 10911 0 R 10912 0 R 10913 0 R 10962 0 R 10914 0 R 10915 0 R 10916 0 R 10917 0 R 10918 0 R 10919 0 R 10920 0 R 10963 0 R 10921 0 R 10922 0 R 10923 0 R 10924 0 R 10925 0 R 10926 0 R 10927 0 R 10928 0 R 10929 0 R 10930 0 R 10931 0 R 10932 0 R 10933 0 R 10934 0 R 10935 0 R 10936 0 R 10937 0 R 10938 0 R 10939 0 R 10940 0 R 10941 0 R 10942 0 R 10943 0 R 10944 0 R 10945 0 R 10 [...]
+>> endobj
+10884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.09 172.361 695.994]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1ee38be62a49852994bf906003b0c23c) >>
+>> endobj
+10885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.176 685.09 241.819 695.994]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 644.96 172.361 655.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a01993c545c5d4dc725147ac29b1d26e5) >>
+>> endobj
+10904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.603 644.96 242.246 655.864]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.937 644.96 407.714 655.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+10906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 644.96 513.996 655.864]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 633.005 160.176 643.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.776 633.005 286.71 643.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.334 633.005 379.133 643.908]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+10909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.387 633.005 485.184 643.908]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
+>> endobj
+10910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 570.957 172.361 581.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aedfa8f360379ceb195993b2ef04424d4) >>
+>> endobj
+10911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.578 570.957 241.222 581.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.78 570.957 420.029 581.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [446.031 570.957 513.996 581.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 559.002 138.587 569.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 559.002 231.01 569.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+10915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.264 559.002 337.061 569.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
+>> endobj
+10916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 519.868 172.361 530.772]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a5da8e430d26c6471590e2c7ae5f7d82e) >>
+>> endobj
+10917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.578 519.868 241.222 530.772]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.051 519.868 361.878 530.772]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+10919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.255 519.868 482.504 530.772]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.506 519.868 513.996 530.772]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 507.913 187.842 518.817]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) >>
+>> endobj
+10921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.466 507.913 280.265 518.817]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+10922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.518 507.913 386.316 518.817]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) >>
+>> endobj
+10923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 468.779 172.361 479.683]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3805575c5d920cbc808cf34e44c11fee) >>
+>> endobj
+10924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.698 468.779 258.148 479.683]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+10925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 440.978 180.109 451.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aa4a79e7bb87171b31d49429f9d875dcb) >>
+>> endobj
+10926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 412.43 172.361 423.334]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+10927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.1 412.43 223.907 423.334]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a40f18b846fb1fe73b63da7fa7cbbbbca) >>
+>> endobj
+10928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.244 412.43 309.694 423.334]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+10929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 384.255 179.554 395.159]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 384.255 250.666 395.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aff27d012a01487b7c9c14a9a3b40d9b1) >>
+>> endobj
+10931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 356.08 194.208 366.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+10932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.948 356.08 311.935 366.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aa9f9e9fbb372e1f21bd0472b2db20567) >>
+>> endobj
+10933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 327.906 170.687 338.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+10934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 327.906 243.314 338.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a8ccc13c9fa8f27701c935b481a371f89) >>
+>> endobj
+10935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 300.105 170.687 310.635]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) >>
+>> endobj
+10936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 300.105 235.712 310.635]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_af46e579954688eec46ac0a43029fdaa1) >>
+>> endobj
+10937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 271.556 214.681 282.46]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.421 271.556 301.724 282.46]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3800cc1eb2fb15d0c42dd71740bb661a) >>
+>> endobj
+10939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 243.382 196.709 254.285]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+10940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.207 243.382 276.688 254.285]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a162d95e1149e222a317370e2fa25a120) >>
+>> endobj
+10941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 215.58 155.265 226.111]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) >>
+>> endobj
+10942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 187.032 278.681 197.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3aa58c4d8ded71e574db9d1c59533300) >>
+>> endobj
+10943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.497 187.032 348.14 197.936]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+10944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 158.857 273.002 169.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0bf7e46a624f9d9df1528ae0b47ad55d) >>
+>> endobj
+10945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.34 158.857 357.116 169.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+10946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 131.056 194.567 141.587]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_ae60e06beac90231262189084333bda57) >>
+>> endobj
+10947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.904 131.056 265.411 141.587]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+10948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 102.508 198.443 113.412]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3a010e69cfabe1a026ee21f7639207e3) >>
+>> endobj
+10949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.78 102.508 303.607 113.412]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+10950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 74.333 226.268 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aea40406b8f95d9ca4f61f23598448cd5) >>
+>> endobj
+10951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.605 74.333 330.855 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+10955 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+10959 0 obj <<
+/D [10957 0 R /XYZ 89 770.89 null]
+>> endobj
+10960 0 obj <<
+/D [10957 0 R /XYZ 90 704.223 null]
+>> endobj
+10964 0 obj <<
+/D [10957 0 R /XYZ 90 486.179 null]
+>> endobj
+10965 0 obj <<
+/D [10957 0 R /XYZ 90 458.004 null]
+>> endobj
+10966 0 obj <<
+/D [10957 0 R /XYZ 90 431.555 null]
+>> endobj
+10967 0 obj <<
+/D [10957 0 R /XYZ 90 401.654 null]
+>> endobj
+10968 0 obj <<
+/D [10957 0 R /XYZ 90 373.48 null]
+>> endobj
+10969 0 obj <<
+/D [10957 0 R /XYZ 90 345.305 null]
+>> endobj
+10970 0 obj <<
+/D [10957 0 R /XYZ 90 317.13 null]
+>> endobj
+10971 0 obj <<
+/D [10957 0 R /XYZ 90 288.956 null]
+>> endobj
+10972 0 obj <<
+/D [10957 0 R /XYZ 90 260.781 null]
+>> endobj
+10956 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F39 2335 0 R /F111 1509 0 R /F66 3165 0 R /F67 3022 0 R /F24 537 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11021 0 obj <<
+/Length 2088      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�6~���S*�D0  ��ˮw�I�����}H:
��lnyQy����= A�FI�"{�"�$pp�w� �s�`燋��^\����S��Ν ;�
�p5s>�F��'c<��	
�"��tL�(O�jV��C|W�byu���4�c��D��	ext�Ȳl���\��*����#�#��n�������i�`H�N�^|�
;3��������:
u�?qn.�u��D��F��s|��{ZBB�}G�i��Q��zP� �������^��
�����5Ǘ�X#�r=�5D�B3ksw�H7�[V/�q���	�<D`
C�,�B)�X�|�0�ͣ�H<��4�Ž󓙥/U�*N�?�'L��&�'~�
�%5�e���=$4i C6��d�@�R�=
+�r�|�R��
w�
։@��[�[q��'�сJaa0�AJ����B�2,A��
�T���Ӆ�\EyVV��T4�^?�H��ٵ��$���y�����.�
�����C
�������6	���48�v/��&
�X�T�����
,y�8&l�b�&n�Hm�9��
��cM0=
TG�<�"� ;ez*ɤ��
+mDlnkp�.(n���ul����T!��ء�l�g��"����!���:Ws�Hv���%��)$#�Ps�uj=��qm��j�������{M�̻!�/�	DWA�K<0�H;Gf�^B
�U$4��yp�D;�����`���)v
+�0�I}$(u\�A��=U�f|��A&|��v���O�ߥ~��v툹P1
��@��س
B�jd��vI=.Ʈ��N*}Mu�4��v���<�gU�h����WE�y��j��W�Vu����`i�\�]
��YٌW�i�#?ku��
+!�<�
�l���Ε,cza'�
�O���̆`9�`�Fa�E�g+7Bu
*Ο
�6��s�o�P:��˪<VAPm�Nm�����t6���Տ2�U@����\Dܳ���͵'�Ǔ.�tM�8�ک�uo�џ���[Uџ����Ȁ�FJ�צ6ܓ_��_=��x��7�ז
�]]��]7�]���UG�Ϗ6}��b�1�D��Y��Wn��!�d
�8�N�(�Xfm�,�e��S�W�
4e��N/���S�U�;�����|��ݲ�]]E��s`��+�m�������f�`��e $�a���#�.���0Sh���N�k^V�����My&�x��{�I��G�b�j�
<��u���]/_�M�
e��[�D	�%�~+	 �ώu�{�
r�7.�-�Ū*)�:�����T���/C�>]6нa2Ζ��Nr9;��q�k��?�^ڝ9͛,���
*\�=�Ԃ�N
$[��t�S�4-��\�ZbVGj�ܹ[
 
(���F�3��� ��7���ǺH4K�� .�(�gi?&.���d��@FQn؞��'�1c`}��y��N�u���Z
�ȶ�)�(Re9����������LJu�:Ρ *��Ҝ�
q
�х`�
%�*͋eX���Z.԰��*����k�,�[�l���]�h8�z �*��7l���
��aՋ�8�Y���j=���������k��k�����,)�tͦ2�����9�`}@�}���u9�;g����y��x�a�ڋ�ރ��I9����I.z+&�ș:����W{�*�
+�e_��\�����S��:Ϫ"O©v7Y�T�˅�
��gU{�}��0��-�S�������hep�E����߿����iO<ea��D�=��Y}��Y���i�VI������
�����o�����w��w.���9��L��
�d�=������-��d��3ꏦ��X����J�C3~g_j�{ �0 ƒ�1����9����a�*+�W(óv*���BF*�VL�g�W�<Nk�J.ƛ�t/,�m?�jOA���ړ�h4��y�{+htK5�{+s*
�]k���	�`����y:��
~-U��2,(eV�5�F����X�@Y��Z��ɍj��0��ӎ~����셑�w}�CU-�./��{h�Q����kM� aѹ�~=d�6*��
+n���D�Y{�%�qN[4 �?��0���c�]ho\�O]�9��������
+endstream
+endobj
+11020 0 obj <<
+/Type /Page
+/Contents 11021 0 R
+/Resources 11019 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11037 0 R
+/Annots [ 10952 0 R 10953 0 R 10954 0 R 10983 0 R 10984 0 R 10985 0 R 10986 0 R 10987 0 R 10988 0 R 11024 0 R 10989 0 R 10990 0 R 10991 0 R 10992 0 R 10993 0 R 10994 0 R 10995 0 R 10996 0 R 10997 0 R 10998 0 R 10999 0 R 11000 0 R 11001 0 R 11002 0 R 11003 0 R 11004 0 R 11005 0 R 11006 0 R 11007 0 R 11008 0 R 11009 0 R 11010 0 R 11011 0 R 11012 0 R 11013 0 R 11014 0 R 11015 0 R 11018 0 R ]
+>> endobj
+10952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 693.613 229.446 704.517]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_afc1e5cbd96d9c2819ba1ec2151f3897e) >>
+>> endobj
+10953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.261 693.613 316.06 704.517]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) >>
+>> endobj
+10954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 663.306 187.583 673.837]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a49625522da117289c0312c67060210f2) >>
+>> endobj
+10983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 632.626 201.7 643.156]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) >>
+>> endobj
+10984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.198 632.626 225.072 643.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a21e9dae374ecb009d8f7f268f5e673e7) >>
+>> endobj
+10985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.311 601.572 248.293 612.476]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a97539a3abb32c8f6dee940d553cec62b) >>
+>> endobj
+10986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.421 601.572 318.244 612.476]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+10987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.835 601.572 444.852 612.476]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+10988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.029 601.572 513.996 612.476]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 589.99 135.27 600.52]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+10989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 547.977 179.255 558.881]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+10990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.994 547.977 248.434 558.881]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a485bfce228009ebec2a7bd83d695eddd) >>
+>> endobj
+10991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 517.296 179.255 528.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+10992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.994 517.296 260.629 528.2]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3601b97efe162fca1df11d70b0b3d607) >>
+>> endobj
+10993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 486.616 192.664 497.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) >>
+>> endobj
+10994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.48 486.616 242.497 497.52]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+10995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.783 486.616 326.8 497.52]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+10996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 456.309 150.493 466.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_ab5ff957e959947c6016cd28be6e2fadd) >>
+>> endobj
+10997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 425.255 181.845 436.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_abd1a41cf267b29ebf81851eb096dc6de) >>
+>> endobj
+10998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 394.574 181.845 405.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1ef2a882e1f0a3121f94eea90a9a16fe) >>
+>> endobj
+10999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 363.894 154.727 374.798]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a8a238e31c3b4acf8a023a6346bbf752f) >>
+>> endobj
+11000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 333.587 176.505 344.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabfec033a504656ea05620f485442b1e) >>
+>> endobj
+11001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 317.2 450.955 327.105]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1ef2a882e1f0a3121f94eea90a9a16fe) >>
+>> endobj
+11002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 291.574 191.718 302.478]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+11003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 291.574 288.852 302.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a25be5d5e126674d8aca8b9ec828e289f) >>
+>> endobj
+11004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 260.893 191.718 271.797]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+11005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 260.893 303.079 271.797]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_ab151aa3732a4737e63c5142b42159dc3) >>
+>> endobj
+11006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 230.213 169.013 241.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a797f9cf758c537ea0abaffe280cc9682) >>
+>> endobj
+11007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 230.213 231.279 241.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 199.532 219.234 210.436]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) >>
+>> endobj
+11009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.732 199.532 311.916 210.436]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a1e73b39b2848f8141aa58219cf97dead) >>
+>> endobj
+11010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.731 199.532 422.161 210.436]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983a) >>
+>> endobj
+11011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 168.852 224.993 179.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a42acbf3b42263a3dc137395dc8fe1421) >>
+>> endobj
+11012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.808 168.852 334.132 179.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) >>
+>> endobj
+11013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 92.503 203.075 103.407]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 92.503 296.324 103.407]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
+>> endobj
+11015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.488 76.49 334.373 86.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11018 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11022 0 obj <<
+/D [11020 0 R /XYZ 89 770.89 null]
+>> endobj
+11023 0 obj <<
+/D [11020 0 R /XYZ 90 712.265 null]
+>> endobj
+11025 0 obj <<
+/D [11020 0 R /XYZ 90 473.379 null]
+>> endobj
+11026 0 obj <<
+/D [11020 0 R /XYZ 90 443.907 null]
+>> endobj
+11027 0 obj <<
+/D [11020 0 R /XYZ 90 413.227 null]
+>> endobj
+11028 0 obj <<
+/D [11020 0 R /XYZ 90 382.546 null]
+>> endobj
+11029 0 obj <<
+/D [11020 0 R /XYZ 90 351.866 null]
+>> endobj
+11030 0 obj <<
+/D [11020 0 R /XYZ 90 310.226 null]
+>> endobj
+11031 0 obj <<
+/D [11020 0 R /XYZ 90 279.546 null]
+>> endobj
+11032 0 obj <<
+/D [11020 0 R /XYZ 90 248.865 null]
+>> endobj
+11033 0 obj <<
+/D [11020 0 R /XYZ 90 218.185 null]
+>> endobj
+11034 0 obj <<
+/D [11020 0 R /XYZ 90 187.504 null]
+>> endobj
+11035 0 obj <<
+/D [11020 0 R /XYZ 90 112.805 null]
+>> endobj
+11036 0 obj <<
+/D [11020 0 R /XYZ 90 112.805 null]
+>> endobj
+11019 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F68 3017 0 R /F120 3056 0 R /F67 3022 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11056 0 obj <<
+/Length 1924      
+/Filter /FlateDecode
+>>
+stream
+x��X[w�6~����Vs�E��k�/m.=nכx��
�ę�F��Rl��$H�4�L��c�D  ����9����ǻ���I�d$��ع�:u�0#Q
���
B����N��e1���/~��{us�^�.^�]|�`@�CIR'�/>�N��v(	��y�L��|+���.���?RC�1�e��2�ch�;Q�A+��S����C�6R�c%^���L u<?"Q���hDo�A����Þv$���4�!֢ވ
�[���(��찘�A
+
+S��Q��ђ�Q�ʡX�[9��(�_�M���Ǿ�
��Dχ�W\W���I��Q߆����9�%$K3˫�q�y��
6:�������m�n*Q�S����e���iq�L󲔄a�x`c����:�h�|�b����sɹ�B��8�A
$@���������f�ÊA�t�v�\������os���:yr����x'mb�9sDX4%�#�,�%$���{(��)1�+��<��87�~>�	�H��b���#��,��־�	�$��<F�/�����K!����
������Q
A-
~� S��Y�T.��F�^[��`����u��p��]�P+=*A|��Yy!��n�'����+/�2��R�L^qi����B�����J5[έT�V��nn�2Y�%1u���!l�
;T!��0�Ef3�y������i�2�sY����:�����7ժ(k�HR���T�p�Y�#Wȉi��\�{)#β�+un�%� �zt1�p��k-8�Y�&
��Җc)�%F���ȫr0"yS�"�xP���,�
F]�z	 �a�,�\9n��,
��j�Cwl>6�ʏ܇)���K���=ovF*f��M��I�,i�����F���nYwU��C��,J�Jl�� �q��ӥ�ā����
��3b�V��.���m�U��)4 at m��
?�ot�ܿz�z!�1��uߘ�- f]����Հ;�%FDS���=w /Ey1�;�;"���,�ᆊ�"ʱ��~���R��j�@YV6y/ 
^!��um5�y�O#�|�F953����p���W4�8%��Ϥ�@E@
+� %ʢ̕*]u�?�	 cط��Ϻh�@�@2�{�M;Z� �}S~���и�!
�j02��{F<8��\ho�O)�	M�N�E'�$�#��)�����)��E3֪��l��
��a0 at p-�PB�`Iu��EѠœ��"kO�o�\�R��6��4�	&�`B��
�� ���yGQG��QO��Q�h�ܬzU�#;���� ���P)i[üܚ��j]�:�PUG.���Хt- ��qy� dR����J�D��l�3l� ���U>��8���r��a�=����#�
�^ �N
��X����2 ��և ��V�j�׶H��(�T�5
��(����5��tԭA��n�����WPu
+�T4u��Q�����
�)�����	��|O��p���
+Ns&����Qt�*�27�
�
+�5���|/����QEY0;C@�,�(͒�4A�i�p8�x�~���CQN/�5?�
�=� ~�&�S�99g�Iw^	}&�Ćlw�r�����S��\j��g@�W�*q'`5ל6uL�]t�:��N��2]���k���,N	�Si.���
����V_<���(z~�����?�ט[+�Y�_�����7�9T>������=بVo
�&h�Zt�g�*>�q�禮x�[��U+�7
�:)ɲ
�H�d�E��=F
���ܓ,%	U=)l˶?��_\��t�
aJ�tz����Z���ُ�X����2�I�_�t9[&$���'peI�k�|��v������e
��<��
�P����2�|�t����78���w��+&x3�K����E�-L������M=���d�/��8Z<�P
��n}u�wR4;��<x��YFh2=�l����e��>���'����
+endstream
+endobj
+11055 0 obj <<
+/Type /Page
+/Contents 11056 0 R
+/Resources 11054 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11037 0 R
+/Annots [ 11016 0 R 11017 0 R 11044 0 R 11045 0 R 11046 0 R 11047 0 R 11048 0 R 11049 0 R 11050 0 R 11051 0 R 11052 0 R 11053 0 R ]
+>> endobj
+11016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 654.19 226.034 665.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_af9e8e2ee2a429df52a8755417e8c8df6) >>
+>> endobj
+11017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 654.19 379.626 665.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 621.021 156.281 631.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a57dab2bd4d371c36b4ebf610a6c85759) >>
+>> endobj
+11045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 621.021 218.547 631.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.759 621.021 295.209 631.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 587.852 156.281 598.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a57dab2bd4d371c36b4ebf610a6c85759) >>
+>> endobj
+11048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 587.852 218.547 598.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.759 587.852 295.209 598.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.411 378.825 342.66 389.729]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.006 277.574 322.456 288.478]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.912 247.995 329.362 258.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem) >>
+>> endobj
+11053 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11057 0 obj <<
+/D [11055 0 R /XYZ 89 770.89 null]
+>> endobj
+11058 0 obj <<
+/D [11055 0 R /XYZ 90 703.099 null]
+>> endobj
+11059 0 obj <<
+/D [11055 0 R /XYZ 90 568.345 null]
+>> endobj
+11060 0 obj <<
+/D [11055 0 R /XYZ 90 204.578 null]
+>> endobj
+10897 0 obj <<
+/D [11055 0 R /XYZ 90 181.014 null]
+>> endobj
+11061 0 obj <<
+/D [11055 0 R /XYZ 90 181.014 null]
+>> endobj
+10898 0 obj <<
+/D [11055 0 R /XYZ 107.713 93.561 null]
+>> endobj
+10899 0 obj <<
+/D [11055 0 R /XYZ 90 77.486 null]
+>> endobj
+11054 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F113 1791 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11069 0 obj <<
+/Length 2838      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�F~ׯ�SBV��91�f�d[v)�c���r��bA$$!& }���
8�)�Bj�p�t�|��1��u���GO�G�/$
R!
��U�p �B"��E�aD0
+�xB0ƣ�1���Xų�1ţ|��&Y��UzY���������bL�Q~�LV�	x�l��=}�\%�q��Ji�G�����Ggӣ�G���j$�`�:��
��k�SQ�ռ�
+8ep\��}��EQ�O��٧Ȇ}� B:�!��31��r�^i�6
FSc��
ꊓ�gyV����}
��*)f�
+:���ĸ�6��E�;�O��J��i��e
+�w���0r����ž�.��0��<b�^�k��{^�T"Oߩ
�`�T�	�����Y7&E\������
B�n&�X8bF��oϟ���r�nzvvq�n:;{��l��՛��.�ɐ`Q=e�$�M�j<a��N����4������|�d<�0C벹��,�+w
�iV��3��D�z
�B
+G��v�+3��eo���o���w$�r���?{��~�y��z����|}ј�/��f
�ɕF����$�
�ό�����7o~۩;���F��X��c"Fߪ�<��Us��N��QDI0a����� s, k�����2+�F����y��~���Y�ȳ
+nM`Tƕ7"
�Rn��.�
U 8h-�.:�HE�!Ļ�GB��������@IcBF���@1ꉆP�b�0��
+�3Ǔhdy�G�@s1�"�y�N(4��K -�սJ0
3!�J03�]J ��0���8���V�"
���Y��6���N�RH�y�J�ʼn]�p$CU���aD����z��⒀��'�ɷ�%,����P^��u����:].\̊�*R�I_�x��
�G@�h��.]�c�a?����P�"��N
Q�G�=��o�*����7�$��3�WV��Kw�j��k�8~ѝ
+,����
	
��
�0c{���t�F�m<wc��E�H*sJ�
��&n�PE%�=��(v"^.O �A�����H��̝_�9�i���.p]��i=m���U���̗k�G&
�Am��ɬܙu���>���ͬ��"Fw��@1=�i+��QM�'�=C~�C*(nH�lŻ

��;�ѐ�
bC�W�`#
����!RT�jL5�	[����X�����ȼ&<�����J�en2
��灈CE$Z�ì��8�~������Y���X�yb��L/�ElJ�k�U�;_���*�H�D�-`�37U@�0���`τN��m�h@���k$������ga)�1���X�g�扙�{�h�a A�.�M�
�A��
�E�xp���8�M����Hs�p�d-�H���Ơ*��]���)����2ɮ��YRc�W��C�
nHMJ�馅��܄r��>�@vJ�g���5|uq7��#-���nj�CZ�V�y��a�$YԨ�f�Ξ�:^{C0�
�|������lM�u
��"4�I;��%f���'j����5v!>F�� [...]
+��]{��\�1����]R��
	D�F�O}
+FH6&@aكQ�r�N!�z <��8��
+�e�Z M��M�
n�������|3�
+Ja���Wi�����ۭݳ(˦��3?]
�{��ZO�ڀ�K�4A�"a�j�
+''?�.J��	���ou*��E��.k�{�I�2�4��
otٞ�0����|ѻ��Ѩ��J����	�����G�r�ק��_���tz���>gs�
��>mm% x�&u/�(۔�G���'M�G_��__L�Y_�zQ��g�$(o��gUDu�yU�nL�R1�%��n�Lَ�>v�8�F�m|W��uO�Gd�d
�`‹z9�K
i��qW�|0��R
�M9�
‚	g��ך�#��
���yΎt�K���7��a�8[�� �c2�Qmo�h{�(��.�{��5.i
7�!���Y�`��C}m��"�'�~>����~�$F�2��}b
+��
�ξ�E_+�A�n�;.�fC��+Y�_��'�~H�f
�m
+���؅|HGJ�\�O-=�i(��0�DSVS(zU3[{z�Hpx����#��m�yzL�r���О��n��sɇ�晞֞%�i�
��`�dP�,Ђ�7
����։��
.�T{��q����iC��k���V��Wk8�U\T[����ǝ\`?�
l�v��H	Eۀ�Z���4!�t0�
e�
C�ޠ�i�>�{�"���9���)�	�g�d�#q�
n�Vlh����6�D�6)
�aЦ;�II_���$����^�{�B���*4m���a6!t���k(.l�D�_����dt{�'R��v\�H
�!�:�D��
��E�{А���"^Av/@�G?@�z4 �0q[a�+g�b��3��؝Y��vvf}��l�r�k
|�pnG
��D
��%Z

@PH��0�=)�� �r�����q�􃸫H
�N3�� ��چ����aP���w{u��K�ȱ�|���N�m��|�Dw�z�}?'0�7�����O��3#T����W��?eRt�~
g�
/�	���&��Id'���.�P��
+���o���O��m�T��������L�k4�Ww{�
[�m_���}�M������k
0� ��J0�
p�g�C
���7���a���q|�b��
����_�A~
+endstream
+endobj
+11068 0 obj <<
+/Type /Page
+/Contents 11069 0 R
+/Resources 11067 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11037 0 R
+/Annots [ 11064 0 R 11066 0 R ]
+>> endobj
+11064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 371.037 432.413 384.985]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
+>> endobj
+11066 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11070 0 obj <<
+/D [11068 0 R /XYZ 89 770.89 null]
+>> endobj
+11071 0 obj <<
+/D [11068 0 R /XYZ 90 721.073 null]
+>> endobj
+10900 0 obj <<
+/D [11068 0 R /XYZ 107.713 645.052 null]
+>> endobj
+10901 0 obj <<
+/D [11068 0 R /XYZ 107.713 617.157 null]
+>> endobj
+10902 0 obj <<
+/D [11068 0 R /XYZ 107.713 601.217 null]
+>> endobj
+11072 0 obj <<
+/D [11068 0 R /XYZ 90 584.489 null]
+>> endobj
+10973 0 obj <<
+/D [11068 0 R /XYZ 90 562.113 null]
+>> endobj
+11073 0 obj <<
+/D [11068 0 R /XYZ 90 562.113 null]
+>> endobj
+11074 0 obj <<
+/D [11068 0 R /XYZ 90 461.987 null]
+>> endobj
+11075 0 obj <<
+/D [11068 0 R /XYZ 90 396.343 null]
+>> endobj
+10974 0 obj <<
+/D [11068 0 R /XYZ 90 361.673 null]
+>> endobj
+11076 0 obj <<
+/D [11068 0 R /XYZ 90 357.189 null]
+>> endobj
+11077 0 obj <<
+/D [11068 0 R /XYZ 90 238.638 null]
+>> endobj
+11067 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F113 1791 0 R /F118 2438 0 R /F75 562 0 R /F8 802 0 R /F94 771 0 R /F24 537 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11083 0 obj <<
+/Length 3095      
+/Filter /FlateDecode
+>>
+stream
+x��\Ysܸ~ׯ��d���$@���z��k��Z�J��RQ%M2�LR���>� `D�E*�l���1@����B����
�p�������$�x4:�
�t�eLTOW��c!�䗳G"2����}�����w���˳��G
~�#�(���rq��:���?�(�}��#�\�wG;�%/��p��x)9��ǡ�	�r�� �*���/��]1[-s��#���p#� ���Q\o��
+�<��G��i�bģ(�D��m�
���Z#����Ib?��}�$� �H���=*nq��8L0Id4�s��W���tySܞ�Y6�j���:u��W
:A� ���PIX�7�0��
9�	��n�Մ����d�
Ϯqv�X��'9���j�pm�h��M:aj
�N�*T�4��r>?�p�6� ��u�E��<�K.�s,]�
���J���
+�WT��R"�i�Ab�� I�堊�4�"*��4�<}����N6�
��~�e����6�m�ն
r��2N� 2F���z;[N$
J泫�$�=��4;��W�K��`*m� �Vm����d��p���=^�*�d2r?/���m�^����tyY>�rwM\+�:��{BK�|�0������h�#�:�:׊n]6
MK��l����1$�	���h�4�#0��nn����ſ��b�3����|}}��D�먂aw����RX{v��->!�$�%�4�F�u�\{��2�j�ʟ�}����V�_�#�7yZ�m�����=�diRT���d�b�y���b�]g�+�פ�Н.�6�E�Ars����E�I�Q)"��L��
��n������Z���K�g�"����u���.]&
�DL�'���fT��-�=Y���.j��q|�#N��vnf�'�$6q-���z�(��ۉ���|����6��Z`1��� ������E~bj��ǧ'o[�W
�!�W�,�Cd�󫋉
 [...]
+�S��|s?�C�3e`����+꯽��V�N��6�pp��{.��
b�u�c����Y����u�*Ǵ��
����	��6�T9��r�_�,o�%	YGD���?P&�J	/�!�5X������
+� k}��� W������h�%���u��X� �X+_�:����
��{���
��Yg�0�
"H�Kn1��Q-�
+� 0�g�p#Cp�[v���هR""2�7�ED�
�
NѦ�
+L�`�̿%
��0$!��,P�nY1
����G��#���vǼé�e�*/e�1_�h�,Jy0w
��s
T��"A<Rc����;�3�`X��
6 �6���CSt��iEl �B,�9Є�P� ���r'
��
�>?/�M���}���)Kj��5@�E�
`��2��=_���t7Z��������ş�c�Q�`�3�f�(��X6a�.���H;�|F^8l�?S��4���
H
m�ϴHRR3 ����f4D"r �a
�⤘D�Q�V��c�k>g�F��	3���
&s�&��[��m�|����O�њ'����V�߷��\J,���������c����_7ހ$�Lr_M�!X�Ȇ�/��1�Q��)�V�a�
�>
��3�'�m��-!�m�[
g��48Fq ��a7†�lH
Lq��
R����0��&�C��?M�ٜ�ؐ�<�}3H�}�M��
Cΰ�o�M���
�
?��c���HRƇU��iZU,��_�8��@��
X�Rv���ɥR�5�
x�!�K��<�q�
g���
*ty������5`�	n��ےL��ˣ
:8�`�)�7xQ�-w�t��6m=�#��
�5q��,�	9�l�{�8�ɔ����u��^�`�QL�3܄'L�Y�.o���gp�)�l8� �4�}��a��$�އ4��hn=� (�6�)Y�B�P�g���vW�G�s�x���~N�r3
� 1
������J
�l�4�.�~VOh9�a�#61�UGm_
+@۫�Ej[uxjv�J�S�����|[[��wy�.���Z�-etA�6.!��|�B?k�{���w���%k�zCPe�f�{�� �G
���T��n&�^�����jk��GM����~|�"��\�eߞ�0��R?�u�
n���r�j-Y[vM���y���rA��ڢtC�}*�Rk'=�k�g�=z�Z;��#��W*�������;G�S��ǃ�J
Yl�
+�l�>���l��|����
�l
+���$����
|��1��=D����N�Q���
+�~l���g��o�?�.�*7��h���5��i���3�K%AvC��s������ְ�
����j��&�f�*�^�͞|�C���^�<\��x�\��):
3Ih�-nr�mʻWq�'#� ���(o
.�n��7�񐇚��_�.#��Z�i ��k�'�i��E���A���H�)p2HVp߫o�s�V��)
X�
f�{���Ju�
��I��t��ی�+~��1Ч���EB
V��zr��=́�@.��

�#^ݷ�p|
+�v�l�V�V�/�{J���e��SmKӫg����m�r�B����bf����@Y���m|�3�x�nF�Nm�Bܔ3ˊ$4��A#զ	OU
��َ�$���DOP���.�[8�I�o����Z�4`񫓂� Y�#O�Ņ-s3�����ե�I���e�t=Ђ�@s����	��ۚ�G�2���ѿ�?V}��Ob��
+�5�@o���߀p��[�6@Ζm�d���W���y��q�Ը���4Y�W9�ӑ��vd��e�q��U�wi�I�
��f�'��=�4�ZS+�mQ�
?~q�C�E.W��޽�
C�ܤ���6�b��� ^.�V*�/',� U8�5
+endstream
+endobj
+11082 0 obj <<
+/Type /Page
+/Contents 11083 0 R
+/Resources 11081 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11037 0 R
+/Annots [ 11065 0 R 11078 0 R 11079 0 R 11080 0 R ]
+>> endobj
+11065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 693.377 432.413 707.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
+>> endobj
+11078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 420.215 432.413 434.162]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
+>> endobj
+11079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 159.406 432.413 173.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
+>> endobj
+11080 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11084 0 obj <<
+/D [11082 0 R /XYZ 89 770.89 null]
+>> endobj
+11085 0 obj <<
+/D [11082 0 R /XYZ 90 718.682 null]
+>> endobj
+10975 0 obj <<
+/D [11082 0 R /XYZ 90 647.748 null]
+>> endobj
+11086 0 obj <<
+/D [11082 0 R /XYZ 90 643.265 null]
+>> endobj
+11087 0 obj <<
+/D [11082 0 R /XYZ 90 548.623 null]
+>> endobj
+11088 0 obj <<
+/D [11082 0 R /XYZ 90 445.52 null]
+>> endobj
+10976 0 obj <<
+/D [11082 0 R /XYZ 90 374.586 null]
+>> endobj
+11089 0 obj <<
+/D [11082 0 R /XYZ 90 370.103 null]
+>> endobj
+11090 0 obj <<
+/D [11082 0 R /XYZ 90 275.461 null]
+>> endobj
+11091 0 obj <<
+/D [11082 0 R /XYZ 90 184.711 null]
+>> endobj
+11092 0 obj <<
+/D [11082 0 R /XYZ 90 103.211 null]
+>> endobj
+10977 0 obj <<
+/D [11082 0 R /XYZ 90 77.486 null]
+>> endobj
+11093 0 obj <<
+/D [11082 0 R /XYZ 90 77.486 null]
+>> endobj
+11081 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11098 0 obj <<
+/Length 2601      
+/Filter /FlateDecode
+>>
+stream
+xڽ[�r���+�J��`�A:�d2���L�s�ds疊�`���%i{��i $EP�NyA����@?N4FTD���?n�9���
onR,JP"��
��G�'HH�5���FR�'c<�<J�u:�S<ڬ>�z^��_��"->��~��~z_�I<�<��z<��~X�e�N��gmo�|�A(�1
1.��
������
X8"�@*�f뛯�p4�˿ |��ѻ}h
q�ช
n�u�=��]	��E"�c�Ԧ��)m�9�1
+�������
F��!x%q�܅Db�+���Q�1!#7��(�(*J�����
O⑛� �n
����yC 
"���j>tw73?W�`2s�;x<I5gĠ
�1�c�Zi_�|����5�q�۟$�1�RYK@"X�7��RW�S at yt�f���1f(8XN�g�eV
��R�8�>�qA��QMWU-�{U����e�f���KaCu�D$(�E4!
+I
��R����t��u^f�����x-���qׁ�Btk%
0��&��ԞCL��J�OE�t7Zcr,Z��$d4���UEb+��s�b$_��R���!8-X�! @�*�{C�
�tg�]
�FJ c��ù�V^Cx�"�Xe��6j�]�
sB1Ǫu�Vq�
1�����I�F�~�u���
�hB�0�\���i���k�t��LL"�3��=�
A1�t���\N <��\
���:��Iʟ�����.��\����?{�i�L�K�f��^�ެ��9�νy�yO�	7=�6E��p~ef�a�`�7y�&�t�+C�Ȩ����Tr{��4���N�
A�;H�$ꐺ��*�]	
|@*�j'�źP�r"��A�<9�
G�?PDB _���b"%J��Q�< 7��i�<��
I�st� �+��ke�
�=K
���D'C�L!�����3�R�Eco��N
����o{���1	/���r�! ���R	
I_�y�#�^'��N8�����
�
������n��E���s�6�aw�P�c �+�mh�@Ơ]�ꀁ~s���2߾�e������F��v��Y�(� \���&r�@��@�|/���w���y��~��ײ~�U=��:_��EpI�G ���5;*A
+��0���͌o����)�~��m�6��L��i+Ɛ�c�0��MϾt����?�A">4;\.s�CA
���R�)H@ٷn�o&�\ﺑ����V�ΓvW�妬^�f����u}���-�����,�;7��V�'
�^� Y�f�ִ�/�	��>
2>ܽ��d,w�X���Y=���U��|�TE��z~Bw���b��ˣm�`�2��3I�m����dg��$	���D%>���bAT�� 0zcpFc�e
�3��<
nݦ�r��<�NNmy�tfy�f�u1�\��B~�\1��<����x���#ޟo��ɺK�
+�̈́�`�
��)������E�Bj)���%dfն��c@�4Od�
��� ����(��d�ʢM��f�oj��
0�o�>�7�౒q��0˳~��f�t3z�һ+	���%{���o��f�=f@�m�D�C:}K��5]#&�5]F�BV���)��rTfA��LI�TP^��0���X6[����"�@���i�� ?���*�O!@�-^a����pV6m�o�e]�ge�ˀ�d�
s,7k]_i��9p`�d��K oK��K�@h����lS�|٘E9��Ĥ9�5��_�ig�
������DxY��M 3���n�R/�� �˰K	W�<��˨	{�3a~�v���b;�v�~n �~���
��
]��„�8
&��8�f��n%s!�r4 �8n����w
709���d$�M�L��R�6:
�q����,�|�˻��%;�WI��[dgwzp3�D>c�,��

Ng����>A�%4�CV�< ��H���P!!]�`�&��
��z����N!cإS!�WmH��z
EU�-��ڮ�/0��b	�\d��֜�/C���)v[�[DYU������C��U-v���O	VHدE:�fQ�j��j��w'�D�f�>Y��M��o�t���~�ȹ�P��y�8�v�(�'�K���%D��VS�Z�D��J�b�%N�ڃpq��A ĉ�d�
�9�I�8,q�DZ�
�s��9I��9)�x�˜�e�����b��l	�к҄I�%���Q*e�}��%u�j3�?HnAi�\1��v`fC�
�2��s���$�4zE s��͆� Ӻ!�3
H�:��W�
H"�ѫ�v6�g�e�ʳ�[3c�'�
�:{�중� ;_1�.��
+�N�z�(�i�Eԡ]枡][���.�R��-�{���om[.f�]�*����EO�]g���=pN �\�m㮒9�E�']R(K���fh������,�~E�~�u��;�w��?���nqU"����M�vT[G�:�R���F�
��A�8������%�p�v�[�ZV����������6��r۱Z!�����[��f�ש�I�a;�Sa����h��~���D�
1��ۛ͋��۟�,����O#���
+endstream
+endobj
+11097 0 obj <<
+/Type /Page
+/Contents 11098 0 R
+/Resources 11096 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11037 0 R
+/Annots [ 11094 0 R 11095 0 R ]
+>> endobj
+11094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 505.215 379.76 517.549]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) >>
+>> endobj
+11095 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11099 0 obj <<
+/D [11097 0 R /XYZ 89 770.89 null]
+>> endobj
+10978 0 obj <<
+/D [11097 0 R /XYZ 227.842 671.378 null]
+>> endobj
+11100 0 obj <<
+/D [11097 0 R /XYZ 90 664.738 null]
+>> endobj
+11101 0 obj <<
+/D [11097 0 R /XYZ 90 596.164 null]
+>> endobj
+11102 0 obj <<
+/D [11097 0 R /XYZ 90 542.475 null]
+>> endobj
+10979 0 obj <<
+/D [11097 0 R /XYZ 184.963 466.27 null]
+>> endobj
+11103 0 obj <<
+/D [11097 0 R /XYZ 90 459.63 null]
+>> endobj
+11104 0 obj <<
+/D [11097 0 R /XYZ 90 388.924 null]
+>> endobj
+10980 0 obj <<
+/D [11097 0 R /XYZ 90 342.299 null]
+>> endobj
+11105 0 obj <<
+/D [11097 0 R /XYZ 90 337.816 null]
+>> endobj
+11106 0 obj <<
+/D [11097 0 R /XYZ 90 276.908 null]
+>> endobj
+10981 0 obj <<
+/D [11097 0 R /XYZ 90 230.283 null]
+>> endobj
+11107 0 obj <<
+/D [11097 0 R /XYZ 90 225.8 null]
+>> endobj
+11108 0 obj <<
+/D [11097 0 R /XYZ 90 152.937 null]
+>> endobj
+10982 0 obj <<
+/D [11097 0 R /XYZ 90 81.969 null]
+>> endobj
+11109 0 obj <<
+/D [11097 0 R /XYZ 90 77.486 null]
+>> endobj
+11096 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F8 802 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11113 0 obj <<
+/Length 2589      
+/Filter /FlateDecode
+>>
+stream
+xڵZIw����W���=�/�%�����G�('�O"[b�p���Tw$w�	 ��
+�|UM���<O�;�x��)
�v���&I���ib�Dq���_��o	�r����&5"F�[����޿�����w�������)=��n~�
Op�gX�=��ZM8ep\N>���G�<"Cz�A���	FR ��tF0�ɧ)�I�-�3�Mr�~��*�F�F�0/�as
EF�
�]HD�1�p�MM�唐��]�(슎��R��$���c��әN�������  E�1f ��:6A9%")
�*Y���me�]
�
+D����FT�C��_;��Ov`e�a�Q�Ϥ%����9�[������81ɼ�+o�^��c��xz��6-�}y��V��ߊ�Q���g��"��]x��y�U�V>�e@�H�>���Z�
�� qwm7���
m]��'��
'���T@`�34�;�qO�=D
ň�
A 
+�1���y�o7��q
+H�
�}��W���%�;������y�3��:��|^���7 �[˄
n&�$���'�`���TGҗ�^�H��	G�FFi'O
!!�x��)�
�0�7��T���6˧
R|���ژJ��+�����sP̑�lL=A��{�2�!��E#��̀��Ez޿��
��.88M��p
!'�k:oN(_�8����P
�p#��8�B� �g��Y�.�y��~=�6�m٢I�Sp9�0#BB�%q�j����c 
+f��0���>S�dՐB��ya�{f�W����������52�2+�"���J5�� >_�UZ
/�1}-�ҊǠN�U	�ǀ@)G*L�bE9�H˞
z�*�@�WQf
����c
UZgD(M����B{��6�g/��,,���/v�G�':�eˬ�ڐ��b�D��B�)�4jo*�d^�h�/[��=����5��
�'�a&u��C%�
H_*�.i�h
�/S��6�̹�?y-�Gp��]{/m�>���P�A�Vq��d
�lSo ��
���:��� ?5�[Jx 	Q^�لk(���ڥ�Gs��9�����FA` ��
��)�q�GX�	���=
�[�b�� �*Q
+� d|���VG��������sb3n8b���p�� hJ���[.
��p�`�/�9�W�
�y�܍b]ϋ�
W!���ᮻl�����J�ڮ^�v����M�
,�=\�&Y�3��pL�
�u��m�(�cc�EdY�	O�h�aM��&3fw2��1
+A��2�Pu-��\�(�
Ug�f
Qc at p��e
�4
+��1 ��@bb#�"�:s�
=]���e	�B���C%�Lj�j��df����-Z�tg
��
k��?�qC����G��2�!�vK�L�M�
���S��Y�) dp�
.]

+G�?~"P��3K��(���9,F5��������w(�����ɑ�yִ�}�Q�>h�h8�O!�A__N%N��ga��Zޜ�����j@��(��c�7(�´�2ՙ�
����mu�׫�v]�
^G��(D%�)��Z�
������Ɛ�B�	
�{�s>�C7�l9�������0���	�TP���hխ0�85�

��
q&;�
�TR�uR�j���EWf�ц	%m�_%����{fp�	�:��=�|
���,4f��ڐ~�yƠ�Rٛ���R� �՗t&����	�ӈE�+�;P��>��N��2L�凷�$b��BF���u����@�L��ZR�b��;h!��< ������~�	�~%�ߺ�U1B|��i-���K6�d��9[.��cs��vqlnG��\��^�r1#:�����vC���7u�S�H�dB���܏9�uH�=���C޺�ӗ����:��z��������Å��{��]��~w���s
pl��C��~�H@�@e1���x
�a�"��=�,��.x���
D2��t��%��{��S�(h*G��u$�m;����
d��$ڍ�؈��
�W��R
�����sGԳ���)z�~n�gw?�Q�&�܍�������]���P25Ќ�k8�F�lVNK4���β|^�^A����S~���x��4-XCpe�C���J�Vp�?-��h/�q����i�ʞ�1|���|'Q*>j6�J�эa"�m5l'�7��}s2��ɓ�d�Q����n3S�=
�Kbv�x���xʌX3�%��B� ���鉙1 0�S�g�ވ�	N�C��݁ñ��C"%B�p����=&F��h
�n�t�C�����>���k��l��c�9oݶ����U]��)
�ۿ����qK�Q���"=9r���
��^r����F�������,b���F�b
Ń-�)IQ�ƉFT��D�~-%:��'�����?'lJ�������O]�%lT׿Bds��2F������w^�
+	�[�?,&JQ�{�o��4���b�� l+n�f[���h�<�ݐ�f6�ēǻ����ߕ-�2"i��4_�M�B8��f�Hy-��Pp���&�ll��#���I���Rׯ�o�<��+�?�y;��֛�ː��������(��
.���~���s�d�)a
+endstream
+endobj
+11112 0 obj <<
+/Type /Page
+/Contents 11113 0 R
+/Resources 11111 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11037 0 R
+/Annots [ 11110 0 R ]
+>> endobj
+11110 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11114 0 obj <<
+/D [11112 0 R /XYZ 89 770.89 null]
+>> endobj
+11115 0 obj <<
+/D [11112 0 R /XYZ 90 655.872 null]
+>> endobj
+11038 0 obj <<
+/D [11112 0 R /XYZ 90 609.246 null]
+>> endobj
+11116 0 obj <<
+/D [11112 0 R /XYZ 90 604.763 null]
+>> endobj
+11039 0 obj <<
+/D [11112 0 R /XYZ 90 508.961 null]
+>> endobj
+11117 0 obj <<
+/D [11112 0 R /XYZ 90 504.478 null]
+>> endobj
+11040 0 obj <<
+/D [11112 0 R /XYZ 90 398.878 null]
+>> endobj
+11118 0 obj <<
+/D [11112 0 R /XYZ 90 394.395 null]
+>> endobj
+11119 0 obj <<
+/D [11112 0 R /XYZ 90 314.488 null]
+>> endobj
+11120 0 obj <<
+/D [11112 0 R /XYZ 90 224.137 null]
+>> endobj
+11041 0 obj <<
+/D [11112 0 R /XYZ 90 177.512 null]
+>> endobj
+11121 0 obj <<
+/D [11112 0 R /XYZ 90 173.029 null]
+>> endobj
+11122 0 obj <<
+/D [11112 0 R /XYZ 90 112.121 null]
+>> endobj
+11042 0 obj <<
+/D [11112 0 R /XYZ 90 77.486 null]
+>> endobj
+11111 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F120 3056 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+11128 0 obj <<
+/Length 2286      
+/Filter /FlateDecode
+>>
+stream
+x��Z[���~�_A�@+���g�0��7p����>�Ƃ+Q+����w�_�3��e(J�d�y�E�3�~�s�8xp���_WW׷�!
+%��j�8P� AI��f#)�
�1�-�Ϣb�-�����.�����}_nn~9�UrH�uT%yvw��p�=��IVݽy:s�gqYŠ���O׷���gL !C����]ⱸh�,A�v����mVŅ��s�hz��+>�r�_�T`��vN�,���	c at W7{7�7���f��Ҩ,-��<��xH�*�o���؊��������z����� 

�Z�\ ������'
l��OF,��c�hp����y����an���2$[��Hϔqxv�\�YY��(�L6R�gqUyaWz;p��l��g��jp�k79�r�8�5[
���(�a+�p�3X�<	�sF�-�̬k�p�’M�
�q`Ca��3o��
0�a�)�gL!�B_�r���s5K���M~��}��SN8�HM�	NB���89�x��
<_���;bߵ��z����^�SK�#����.��E�.��2J�C�/�n����0 \��1f.D_$�4k�]R�5
������\�I� [...]

�a‘B ��Ō�C�
�Y�#��i"��dP� d/�����dH���G�~O �a�hq�����9�D¿%W�������f��$���b�M��f:g�9ҘM)H�0�CM�!R]��k
":�o�+rS;M�)b��4�8EJ�)"
4
!�m򸴻f��*��2�E[|6A�7uVP.+��W���	R%g	�Qs��˫�������C��C5�
Y[9��+qy����lo\:*���7%���A#��.;�`!l��?�@�A��4�_B��E�!�z>z��|60#O�҉�:�<Ckj4d/�sDC��R�1�
�AM6��(���
|
t���r�3
���ȧ���A�`�	(���Qz��S������hQ|
oMp��8��0�FX�㺾A���
+޶,�i>�{ �(8ݞa�C���i��x��6H�9m�,ߏ�3Ki��O � ]3�mN��di�ş."7y���-r�����
!O��Z�f��N��5�u��l3FI"���(����ծm)d5*�OQ*�4Kـ�a�c�Lf�
+z��hX!|�
�������)�P�8~Y��ԟ<=����v�+�Q��U��X��E��F&����i�7�YV�%bdJ�ڣ��*(AZ�
�N(_X�>����`�������(��O�/��U�ʡT+���U8�z[@}ߔ��~�m�ͻ�

���1[�

O?�k(5Ye���D
���������q��UG{Kٍ��C�7�*�u;�{�zG�T7+�#
.��~#X�$Qm����v �"�%熕�#,ڂ�p��Ǯm(
�J������p�>9���œ��!�h7-�PXc_�NLh�1�����p��b�&Ĭ��
u� �q��

+
U�
�1:�v��!e�o��1��{�37e����
0�����TB�Է������0��
�ǭ0O#�t���T�1*������-�g��B�z49�`���r�U�7^Yi��#h º;ٲ��

�YP
�E�4�<M-�8^ ��7
Ӧ[���@ɀ�9�GJ����B�
)���y�m���B
U�c'��D�G��1 �.6
	�N&=>

�4W����DX�SL�� ��Y�E�a�Ȩ�dN
���z	
��Ms<<��P ��4[C͙�Eb.���4��I��!�C����7��
+�������"��^ݎL��Wb��H
�g����ܸ��)��w4w�|ga�
��r�u
���jε9�7
�r�zDKČjL�scp�W`�kZX7_$�3�̠�v���X���5�$�p݇u���Y\��\
�i �\�`)�����>
��t����iٝ�v�F��O�$u��OI�N��x��
�n�z���κ�0�~D@ȉ�j}=�
+qB
g�q�
(���!��$z(Lc
�
+in����_����_�/_����y�b ��v�$']�ۏ]>�J�
��'g�P��~\�LW�W$�*�ت�J�Pb�����������ġ�_���
��g�
E�z
(CЃ�
 �}���e��As����:v�$�%�]U
n���e�=��
��AГ�P7�m��>/�PI��öqh��.���Jm�B@�������}�c�G����?��n��_Wɮ�
+endstream
+endobj
+11127 0 obj <<
+/Type /Page
+/Contents 11128 0 R
+/Resources 11126 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11138 0 R
+/Annots [ 11125 0 R ]
+>> endobj
+11125 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11129 0 obj <<
+/D [11127 0 R /XYZ 89 770.89 null]
+>> endobj
+11130 0 obj <<
+/D [11127 0 R /XYZ 90 721.073 null]
+>> endobj
+11131 0 obj <<
+/D [11127 0 R /XYZ 90 667.827 null]
+>> endobj
+11043 0 obj <<
+/D [11127 0 R /XYZ 90 621.202 null]
+>> endobj
+11132 0 obj <<
+/D [11127 0 R /XYZ 90 616.718 null]
+>> endobj
+11133 0 obj <<
+/D [11127 0 R /XYZ 90 542.577 null]
+>> endobj
+11134 0 obj <<
+/D [11127 0 R /XYZ 90 446.337 null]
+>> endobj
+11062 0 obj <<
+/D [11127 0 R /XYZ 90 412.803 null]
+>> endobj
+11135 0 obj <<
+/D [11127 0 R /XYZ 90 412.803 null]
+>> endobj
+11063 0 obj <<
+/D [11127 0 R /XYZ 90 371.098 null]
+>> endobj
+11136 0 obj <<
+/D [11127 0 R /XYZ 90 366.615 null]
+>> endobj
+11137 0 obj <<
+/D [11127 0 R /XYZ 90 322.4 null]
+>> endobj
+1236 0 obj <<
+/D [11127 0 R /XYZ 90 209.097 null]
+>> endobj
+398 0 obj <<
+/D [11127 0 R /XYZ 90 177.493 null]
+>> endobj
+11126 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R /F118 2438 0 R /F120 3056 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11171 0 obj <<
+/Length 1212      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~���S&�;)c�K\�K��q��m�fK�$'�~�u��Ȟ]�[��I��s�>�ؚ[�z�{9��<�I*���򰥸���_S��f\;���,&5"����W����^���ٰ��G`
+[�P ���dٻ���)���ˆyں�--N|�U�
��E�/� B
+�������
+~v\*�=�


"�8Y��q�t K7�J"MI��Ŋ�� �jA?������	U�n	�a&��=

&���|�,�8}�$�z
C��1��
��M-�V�܍�<O
i�Ip��*u�
;�^������ڤ-�
��"g�A$D��JECֺv�vJ����2�&����H#.=� O�B�`�Y�G�qe��/�$H�0��[u�M
�t�@�X]I ��(
�;�
+�_
�B�D��KC��e۳~W*r���(��v��e*g�˵��qH�'%�C� �]�jVz�b�i��Y���6([�6��-�
��U���
� Y�#/��
Z� ��V�Z=�q]�Y�ppp�3�E�j�Ԑs��;`jQ
���{�i�I���Y�C~��h��b�f�?�FWY��p
���@���.Dc$(�_�DB�.y�~
"���Z�
��i��4���K�n��(S�.��~d@G��)��)�����Ǝ@3�
Ϝ�K�x
M����A��'�
�:
����B�?�$E���
zbH��,>���?ms�
ō����q���2ah5E�S��ߋ`9�b<XG�
,
�q>����艇�s"�mq3y���[�~
G4��ĉ�rjf
�1��rD��pɿ�Ŭ2��o��� ֋
rD
+�m�p4�ϫ:�-��v�%ϊ�_|��]P�I1~Cb��&.�ͿO�����p�?��Qzo����j'� l��s�
W@߰c�U{0e
+i%[�۷ރ�=�i��!���q����yd_�������VS�����`�*o��*�$�o{�m�v������}��vi"
+���C��Xm	툷���L��`���;�+C�d=P�\�i1x
T3
��`I���З�-A���t����R�|[݌w����i�~D}�Fa�μ�O�Ts�VF�؇ծpyy^
>�A�#�]����©�ug�$�}w��6�C�ˀ�WA�u��Y�����h�#�kp�f٪z:^�� ��I�|��l][�LT5�3}i��u0�_Q�����O
+endstream
+endobj
+11170 0 obj <<
+/Type /Page
+/Contents 11171 0 R
+/Resources 11169 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11138 0 R
+/Group 11124 0 R
+/Annots [ 11139 0 R 11140 0 R 11141 0 R 11142 0 R 11143 0 R 11144 0 R 11145 0 R 11146 0 R 11147 0 R 11148 0 R 11149 0 R 11150 0 R 11151 0 R 11152 0 R 11153 0 R 11154 0 R 11155 0 R 11156 0 R 11157 0 R 11158 0 R 11159 0 R 11160 0 R 11161 0 R 11162 0 R 11163 0 R 11164 0 R 11168 0 R ]
+>> endobj
+11123 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 11181 0 R
+/BBox [0 0 444 144]
+/Group 11124 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 11182 0 R>>
+>>
+/Length 566
+/Filter /FlateDecode
+>>
+stream
+x��VMo�0
��W��%%Y��C�b��
�ء�!�G�"
�?J�
ņ�t;�CJ���H�(?A[d��F��~��?�x�%|��ǟ���o � �#��#��{`(@��'̀'4*O�N�
J��u&�¹�C)}�4e�l���0��e*O#�'�i��lm�u6MM�
���
jH8
G�{GD�[��c��{��5����z��[�8b�|ߨ.΄
�-!���
�]����	�';ʄ��ؔ�[�
���Q�P��0gL7
ª�tu(��u�LaV��oMՈ\e˶gNX��4/av�
W{1�(�e��

2!���.k�os��\p5�)�^�	mW*�iK���؏	-���
|�ל�z�T�.��������dz�J**��S�:g���W$R�L��8�|;�]&��x���
N$��r�K"/1�h�x����xi��2����[d
]M��_�
+�ޓ��]hPR�ZW��
z�uA-R{EO�.�����t����3bئkTQ�ȡS�*U���āҮ�T��7��
~y-����Xn|��xӋ��P�OӚ�����,x�� �i
+endstream
+endobj
+11181 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+11182 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /ANKDRR+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 11183 0 R]
+/ToUnicode 11184 0 R
+>>
+endobj
+11183 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /ANKDRR+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 11185 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 833 556 278 556 500 556 611 556 667 500 500 584 278 278 500 611 278 584]]
+>>
+endobj
+11184 0 obj
+<<
+/Length 11186 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š��t@�2ݸ�N� �
�B�!:
߾1�B�ϓs��I��skƕ��nVZ�0�h�oN��:��
�G�F
+_5u6I}�e[V�Z3�I]�����m���
�X��4��\���|������Ȭ,K��i|��ξv�4$[���
}�߉���9FR���v�\g��ԙV�i2�_<ϑ��s�8�dz�̚@"P�Ay )@bT"o U�E� zD���#���
T�T�"Vш�*��
��.ϐ�99�$:p�It���<�� �U�_Q������
�'���'cM��0���;�
+�q���~%���"�S��x����[z�*us�/TX�I�����ng�g���v�{
+endstream
+endobj
+11185 0 obj
+<<
+/Type /FontDescriptor
+/FontName /ANKDRR+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 11187 0 R
+>>
+endobj
+11186 0 obj
+366
+endobj
+11187 0 obj
+<<
+/Length 11188 0 R
+/Filter /FlateDecode
+/Length1 2712
+>>
+stream
+x�UV{l�������11~5q�N��$��1���	$N
�p�<�C�<*�B!��V��
+m�JL[+mӴne҄:6MB��?�[�����V�`[[��~��,ѹ�;����{�e��b
����d|�vݻ�X�I�
z����5�&|�Zvb4>�o�_�1�����4?�z�
�K����V?�ʼn��8c篃���d|v���c�����fc|�/0|`��n(��=\'o���|a�lo�\�� ��V1F&m%��ۢ�ܵ
W%񱙾�T=q@��
6]᪁�_��{`6 k��K-r+��
+�a�X+�-f�Ir��Z��U&��>�WO[��r:�YFw�VҫL����HuN��R^���:r��O��ltmݴ�Ni�)m����w[[�+������v��� eV�Z�-,��ʫk�ߵ����u��*š1���
+�z2#(�\O��J�h4�Q�T�g����\7�ERaO
��{�"#-�ح8��GK�#�W���vF��Ҏ��umօ�J����ј�~R~y�+�[�0oL
G^��l��ƥ�̻�L��$�H2��23Da�$�˯�:�&
����(f������TK8�Ҽ���ξx��Y�>ۑ��L��'�.b"3��3#�>)/~3�\�9ױ|0�
+6ʼB�6RIF:ٻX[S`3��[��=�s���+�ZkQ���K�D_B��C\$�2V�jSEC()
nj��q_M<,��Քu4���X�Q3�XM���R��
+|������j��E���I�'[ed�3��l���ɶ��|�\ݺ��֎��������W���=�i<
��
�������U�{=�o5���CT�9:k�=wh���@4��
��7V�~j��NZ)ߟ�럚�M!�0���W#���톟RBނ
���Y#���|��>���Z$��X��u�����y�ӳQq�䈜����G9��<9��=���	��" ���g�
���>��45�'6��)��	r��v��O�]L(�
B���1fw�D�l$a��C�
���c=|x�-�s�B�
�=~`yz�bOH�<�A��������f�?i�T��tF~yæx�*�~}j�����lx��K�/�"y%���h+XYV�ѳ}{����EFuKVe9���J/���@?��8^
[&������|ʿ쌽qr�\H���^�� �Ϡ�	0����TE��Z�П��
�@G�y�
͞���
�ח�~ߖ���}�O��=r��PZ�8��>��
b����ܹ��05�P=���_�O�(�
��E�M�MN�rP]��!�O��{|�k�+��b��E�*b��c���Ȋ���+	@�h��Z����P}Ǫ����ɬ]��h�3ho
+���A빹�?�k�ۂ���E�z�6wݜ�
&�cC�t���Q��'r)�?�%�l�}#�����mײ��
P;�'��,�iTIV�D%���85������p��]�JyD�/�=��b+A����h=!F4�+��5�������krU�Z'=D=��R�z)
j90|M{a����ؑk�4շvG;��%EN��،T�2
Su�?�B�2-�yK�+�\
̟�����q��;���{�<�Wb���\�'��~�)q����R����nzGȠ��N�g)�uo7���]^�_X:�_��Lw*�>`	��'�MN��5��cc΂���	�<�fn�kK�Kf�����&[�%����q�JT�lb��
����aT����T
+#K��e�HhYH�
J\b��N
��Q��Ȣ��
]5�]�J7!2
��
�B&걘�fk`���Z�'���[�+�
�<�WB��k��<��\���.�͖����J��z5�}���f�����?�-��o�>^��QkV�Y
�J�_�>g��L��+��Xo�\K6	� ����+k��E~��b.��^�@��UC��F��Bƌ�n��3����L�x	�y�{"�"P?臈J
·
+o?�E����ƽ�F�S�]��.
�r�K� )�מ}�Ge
(�!���3 �e�M�%���j= 4���d@�f���G>0
+endstream
+endobj
+11188 0 obj
+2017
+endobj
+11124 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+11139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 503.407 224.395 514.311]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 480.473 189.925 490.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+11141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 480.473 260.898 490.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a89dba3caf804c7ca6db844c67de99371) >>
+>> endobj
+11142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 464.985 422.545 474.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 439.864 224.395 450.768]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 416.93 232.982 426.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+11145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 416.93 347.013 426.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a12e89691311b8923ae33e930a7c89f4b) >>
+>> endobj
+11146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 401.443 389.11 411.348]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 376.322 224.395 387.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 353.388 254.671 363.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+11149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 353.388 390.391 363.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) >>
+>> endobj
+11150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 337.9 465.458 347.806]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 312.78 224.395 323.684]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 288.869 181.207 299.773]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+11153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 288.869 243.464 299.773]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_aefe92c8417c543823a7ac000dc6d4595) >>
+>> endobj
+11154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 274.358 420.593 284.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 249.237 224.395 260.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 225.327 159.628 236.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+11157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 225.327 200.306 236.231]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a598c3862b9f9e720061d5d3e87995840) >>
+>> endobj
+11158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 210.816 400.176 220.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 156.214 169.81 166.744]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a100e2b8d786b8aa7f2b10125deddb7c8) >>
+>> endobj
+11160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 156.214 309.485 166.744]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+11161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 156.214 514.653 166.744]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+11162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 144.259 227.553 154.789]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+11163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 116.208 169.013 127.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_aea854e6dd41e3a0b77153d315d697710) >>
+>> endobj
+11164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 116.208 345.31 127.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) >>
+>> endobj
+11168 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11172 0 obj <<
+/D [11170 0 R /XYZ 89 770.89 null]
+>> endobj
+11173 0 obj <<
+/D [11170 0 R /XYZ 90 532.249 null]
+>> endobj
+11174 0 obj <<
+/D [11170 0 R /XYZ 90 532.249 null]
+>> endobj
+11175 0 obj <<
+/D [11170 0 R /XYZ 90 468.97 null]
+>> endobj
+11176 0 obj <<
+/D [11170 0 R /XYZ 90 405.428 null]
+>> endobj
+11177 0 obj <<
+/D [11170 0 R /XYZ 90 341.885 null]
+>> endobj
+11178 0 obj <<
+/D [11170 0 R /XYZ 90 278.343 null]
+>> endobj
+11179 0 obj <<
+/D [11170 0 R /XYZ 90 174.725 null]
+>> endobj
+11180 0 obj <<
+/D [11170 0 R /XYZ 90 133.359 null]
+>> endobj
+11169 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F67 3022 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im17 11123 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11196 0 obj <<
+/Length 2985      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~��`���h2����6� ���E�$0d������8�_�3R
r(1��l�$�Μ��܆#�]g8{u����'�eIev~��)I��$;�dos����!��g���j>�8P�/g�n��jtq:�\�V������6���t<�L�����.�a�t������j at t^��0b�����'���gL !
H����8,�
	AF?�����bS��������������`H�CNT�KPa�X�0��r�%�8(/�c6Z����C�b~;m
+����.�p�Ae�
}w~���ypF
�\ ������{�M���F����
�g�2��e?
����%��I���H��;J�[|��]}u
����Q�v(�Νf�L�5_5<K5��a�����y��f�̢����`��,%>X[;h\���yh���@RɘF���&��A DA�a��rd4)nj����S��N�<�
�
h�>�
�҇v D(C��}1�#����4h\�mx�a`��T#
+��V�e�L���f���8�率�b&��/�����j8�!���C�E~i���t6Y�'n
+��<r���˛+�jm�/
;�
�L���=2^�½��bR=�Y�8��~L*�De׏C
A�@���pBS�qe�O~D��@��BԠ\d�!S�3X�"Fx��Ӡ�F|��a�,QH�J��-��
[}�%�
Z�,*V�%:�
+;��p���-�0�q0�����@哩4�S��^��馘��o���%%�ױ��Zp
���֒8"!��,6�鬜D����&0
32?��u�
��a�x�
Ym�e��ᥝ��H���x-ծ,I!j�*O���L4LA����`<_6
�-l�kK@�@��CH@��J���m��B�8KdX���C�P@���:�
+�j
-�e��u��P)�*P
rWD�5bJ#%3�)��FgF�j���+׶��nq H N�����s�\
&+C!�*�K1~��I����6
+q^�C,L 3.╽l.l/�
��0K
�0���q
+h��sX��
+[E1ݖI�0�a��S����#P��ȃH *�0^3PA�H�%��C�u�Cݡ	.�����Y�P;
e�o}�y], ���7��V��og����-�Ўt�,�<3P�Q�>�Po;J at z〷WP���i�h�.q�o+3�:�F҈��,��箼�,��
��f+�$��[�|�,��z�����}�]����F\�b�Y�5o’��,_^�;���Z�[C���>�k
�}�`W?\�.����U'��hڰh6���		b����iQbɴ�ai��ث�X�hRG��
��4K���ɨOq�{.��+?��v��,T�

Pl�XĀB�6^�fH
+��
Y�`�>qYt�N�h5���C�gz��ۈ��S���nX6`p��~S9꺣��

j�

�H��QZ5�S?B���xU��9���a%��R�0C�a�aǃ�Ǝ˰��!�c�q
Z���NnzA΢.�H�h=aB%G�ǫE9).�A�[E��b��	�V* Fzyy�VC�N!�lZ����z\���	-��л��`-^������k��������9���6&���]
S��#�imW���U���5��I���Gf�H-�����/i�^�-&������X������W�v[�P*��

��r}7�)�hsܦ�"0��I!�Lטㄭ�ڎT���>���ч){�����I0��W�2���
r�7�Ξe),wG棏���ĠH(�A�C�ZP|c����
�"�E�d8eU5�=Є����k&c��
z
+c����Ic�c_[�v�e*��E6���l�)6�%)Dl��&��Y�rO��r	)m�X��&��#7}�	�
+m	浩W��g!^﬐�b��j�C
,i_cՔ�b
}T�%Hg�K������Ld>Q�6�ۄ��M��i��0����#�l���X}��@�/B�`<�2
r*�Yn�Yޝ��^���U����������W���= ��jˎl�v�W
��+��G���ü��@<_���x��*~3�I���5�D��DO2d ,����a��{5�{Zn���
�Co�?
{����������{��;Ej��u�b0$R�	�n�O�2�6"i�ݤj���9��D;4��jU4r��������zZ�X�:8�q
�[X�E�l�ԆR\�6_%�H�=�}����@(H�m�'�دFH�i���T���M���/&�r��կJ8�e9�Kj34%���8
���p��
{�<ڋ�6�ph��;Q3$�w��6�	I!T��9��63Ҋ?
ţ�)
wWax�5w�̵Ao
r��x
��^=	����1�]\�t�.�[f��%���81?<c�i_�Tn�}]vA^Rr��;6ҋ]��D�t?v�}����r�F��~�Q��N�V�g�@�M�Fiju�I�d�j��t�6��e���j7����?u/�Z�4+�aYI
���0��)Z�VN�
KI��z+���0 ��}�A���hy ���i�ci<
3�ˈ�W)�(�ls$kbY�
֣z��_�[�>nE�n��Z���_�[m�#2�Jя�=5�⟎LMh�.�m�̈R̶k�]G5I���9ߋ� �VnNާ�.��9�'��a �4lO [���:�5�qAe;d���tT����ox
ś����] 4z7aD�����?>l��{��4���R�`��b�E�X��D���n�)�S��V(��%����\"_�\���q�2|w�[ܼ���{�ݯ�e㪡�qt(���	d�����e������3��,
+����~��N�ſ���O!�$ߌw.?����s���D����?dh0d�?E��
�߬���ȝ�݊CF\W5��fs{�������X\#(���k���'J����ܖn�j��y�3�f���I z@ ��#L��nD���X>n<=g��%���[�� �	rc
+endstream
+endobj
+11195 0 obj <<
+/Type /Page
+/Contents 11196 0 R
+/Resources 11194 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11138 0 R
+/Annots [ 11165 0 R 11166 0 R 11167 0 R 11189 0 R 11193 0 R ]
+>> endobj
+11165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 707.957 297.576 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a05a6e1bf3090174d9336b8dfe53d6df7) >>
+>> endobj
+11166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.715 707.957 412.2 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.904 696.002 320.388 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+11189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 658.422 305.325 669.326]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab6da9fdc4ae1693fafd4588fca46e809) >>
+>> endobj
+11193 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11197 0 obj <<
+/D [11195 0 R /XYZ 89 770.89 null]
+>> endobj
+11198 0 obj <<
+/D [11195 0 R /XYZ 90 721.073 null]
+>> endobj
+11199 0 obj <<
+/D [11195 0 R /XYZ 90 674.501 null]
+>> endobj
+11200 0 obj <<
+/D [11195 0 R /XYZ 90 607.665 null]
+>> endobj
+11201 0 obj <<
+/D [11195 0 R /XYZ 90 607.665 null]
+>> endobj
+11202 0 obj <<
+/D [11195 0 R /XYZ 90 544.302 null]
+>> endobj
+11194 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F91 766 0 R /F75 562 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+11209 0 obj <<
+/Length 3114      
+/Filter /FlateDecode
+>>
+stream
+x��Zms�6��_����I3�W�t�n��Ɲ�\�q?%
%Q���T����. �@�d'V��b� �X�>�W��6�ѷ���x~�E��4�qt��Ri�����D(:����H�	ai
o���������������/

шY��$Zl.��D�%LQ"�$�7�6��~����/蘗���BS3�˷Ŕ�ɇ)S�|;�q�'���q�׻:o���"Wϯ�J8�Jv��v��b�j��Ib�F3Fd��"fq9"�H�T4Z�2
ڎ�B}�n��'���	�m����gQmhs7;o�:[����4�M����
�g�%,b�P�X�u��$���e���Q�)	Е�� 5M��l������M@!�H��O���h��N�]QΊ�ʈIBciW�5���'}�bL&�y'�-Hwg��'����6�? 2��Δ�6�j;^U�&�Ԍk� @k� *<�;~� �~:nI��ő�
�z��D��x�WƆ(�`�Y1���?r�A�%Dн�f
�FQ at MYV���2�
J4�WyB�����CV(yv�#��ρ

��<����1���C�U�A�������D1ݩ�A��r��xBeI
�2�4��"�3����dО��°?&��hb:h�ُ�&
�V��+�	��6�'G�'�a��I�w�/i&DB r�"IJ
c�뼋!=�<&\�*�K�>��(�U��nuh�@b܆&�S����� 
�Ѓ]�`����
�lYJm$��.nñ���c�]�/��n6+a���g���jir!�շ.��[L�<�
�,�UYe-�ySA y��a./뼄G���
Jhb-l�
�o�j��ͣ��, A�t�]07����D���Y��$��C?��G�x��3���K��le/<KE셎n�t0�D��̇���R���-?�
�6��E�B�k����5@��N��CJ:��1k��ȶ
�gm�
+-&\b6x�U07�,
��
�����v�+�^S3\��)�����0 #����0H(�b�`w0��MU8�����Ru�3���̣}AFP	w��ݮq�L�s�
���J�nZ�Ju�צ�a�����
+���g��m��
4/X2��SrC
+l�m
B���ڮ-��ƭ6z@�;�8�|WM[,01��r
��b]U�Q/N߯�����]`�0��O�T�=�����q��-�ղ����z�׎jGp�f��~�Me�	�bQ4y�h��]���
+� 	����{�և��p{���ɫ|37<�dr��.�x�o��n��i�nH�
!S�>an�6�em(��޷�ݮH��G�~A��.�f��`��7��K�5I �gFV'J���I�1M����uDQX)�]y���
�
pS"�j���X	�����T&���^?B0B��N�9�2&*a>[W�=�6��)����?*ƨV��h^U�%ye�W�h�_�Wp���X��
6u���vvu
+F�h]����;�A 4}�����YF2Ūl�$�
+[N�)5+�:��c��

h�`�s0�.1Z��
$���†��q�
�Pƴ8�24$�󽼴�_�
(�5�.�kɀ;*}���q �
�>���j
\����7_����۶�`
����
ƒ�v��F��
�
�A@�'!��S���� SA�i -*�=oZlH�a��b��U>)16���F7W�6A�!!�I��x"�<E��C�����H����Irc�C4�
-��#r�%�$I�K$���
G�2J�l��J��̸����q,�:��b���1J��T(
+�b"�xs
hW\tW0w5s��`�h�
+��ٟ۽N">�[g�7飦Q��*��%lzx4�W����d:!bH��9���:��U��V�r`��z@(-|ɱ
m�E`
+%L�`
�
+l�{D���<��h��Kb�	�&)s�?
�y
��1�l����
�ڇ�l�c-�šZ�`/��c��/E�S�� )D
+'����@w=�{
=�H���:�p���
+=q��cbc1��'r�a���M��{
]w�볞��1��<�������tn�@���)��4Xt�;����y?a����-j�]�Rݓ�lW7P���@�h� 2L�y� ����h�uj;��|?Oc'
�1;=�6ղ�R��� �8�|6���
$�i��
+�Ϧ�Ç�Y�!= ����!ow�6��
+�D��|9C�����w��Q���0��-y�̗��~6%U����	�*8Cq������q�䌥`7%vD����+��Ds�Bts���N�.�yi���Z,v�)?�S(�Y[��	?v��9N�[Ӛ�U� ̧
Z ��nڛ�,�@��j���B{��4�n�7�L�ƚ��/S�M�jѓz���k,Y��:ÊM_�|h~��Z�=��N���-+�!�a1p��D!U+t��P%�)�'/Wv/j�m�

�.\��uO�Uk�jܨS�ӨR[З��x����H6
�vM�
eͻ�ۀ�܉� '��$�����E	r��e�,��n�1�$>�V˼͊���!�̶~.c~���
+�����K͐�`��8��U��)
҉�e�h��_�w��S3�7�͛���Ηu����ꏗ�G�0�~yj�W�R�{ ���� ٛ�iB����

_!o�jZ�㧳��Ѷ߸��&�m>�A�w�K�����~7�
�}�v�o኷
HVu��C���m���e~���a��[��''�+ջ��trwW���X���+n�ю������%��I��t�JA�c��t�. ����9b�a/ ��ҪK��T%&����x8��8���Ǻ'�����ka�5�`@kB�0W����vp���j
+qd�o'�E�-��_
�=���3��
�\k�����UӁ
�T������s�ڒ����5���.��2��2.f�lhu�� ߯q+��G��~="`��c���(!sOM���c�i�����<��q�_nD�M�r3�7v{'��~@���nS�@�y�
�������9��*��
+����V�3�`)�`K��h�ey��g��68
���&���m{w���|w
��-�t���cݫ���S��5��1���X���׺�
+endstream
+endobj
+11208 0 obj <<
+/Type /Page
+/Contents 11209 0 R
+/Resources 11207 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11138 0 R
+/Annots [ 11190 0 R 11211 0 R 11191 0 R 11212 0 R 11192 0 R 11213 0 R 11203 0 R 11206 0 R ]
+>> endobj
+11190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.089 633.401 513.996 645.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+11211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 621.446 126.862 634.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+11191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.095 621.446 513.996 634.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) >>
+>> endobj
+11212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 609.825 168.705 622.432]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) >>
+>> endobj
+11192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.256 609.825 513.996 622.432]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+11213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 598.716 186.638 608.39]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+11203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 204.325 501.708 215.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+11206 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11210 0 obj <<
+/D [11208 0 R /XYZ 89 770.89 null]
+>> endobj
+11214 0 obj <<
+/D [11208 0 R /XYZ 90 544.818 null]
+>> endobj
+7517 0 obj <<
+/D [11208 0 R /XYZ 90 520.384 null]
+>> endobj
+11215 0 obj <<
+/D [11208 0 R /XYZ 90 520.384 null]
+>> endobj
+11216 0 obj <<
+/D [11208 0 R /XYZ 90 408.303 null]
+>> endobj
+777 0 obj <<
+/D [11208 0 R /XYZ 90 148.396 null]
+>> endobj
+402 0 obj <<
+/D [11208 0 R /XYZ 90 138.211 null]
+>> endobj
+11207 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F7 803 0 R /F24 537 0 R /F35 1248 0 R /F10 773 0 R /F8 802 0 R /F1 834 0 R /F100 4949 0 R /F75 562 0 R /F91 766 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11260 0 obj <<
+/Length 1298      
+/Filter /FlateDecode
+>>
+stream
+x��Ymo�8��_��.H�k
��=�����\����"��)� Y ����
4/l�k��O3
f��<
�XkX;n��Z;G��q�mjk��cͱ8b6���k�`d;F�`���A��Ł����d~+F��?���ww���+�
��Qh�)����K�<7"�&¡��
�u��[�S����"`
ֈ��!�ՆA���F��I����O&h5�9�.Z��c6�9F"D��	oE�^f�4j�{��
��M���r�W��wG�nf~a@�	nNΐ�m�a
Y���G
#�m�f���c10�����"p��a�(�M�8.G���~�A�I�&�v4���p�?����` b�>���ԏ�d��5ĉ�,����D�YJ�WJYm��3
����k0�Up+c@����3��?��
D����t>�Ƈ��_J%��Je ��B΅�E쥢804]����>���������am����[�
�ږĕRd[b�%T�7�'�<���ފ|�BK5f�'��I��ED0M�	�ƴ�d�A&��y�p�K�LD�
�L��
B��5a�<#Eb����<IE� [...]
�~�d1_%Y�k�-�x&�ֵ�7~��Kn�;_X���?YY�<d�Ú$�ۤfkn�L_8
;0��$+���t�W�%ʆ�5�gW��/�ݓÿ;�����Z6��)���Z�
�C�d�5��`�����.E3�/��\�T�dvc��
�	v��:�gS6�A��DR���a
O'�KRV�|A�:�-��MIT4و�N�	6o��pt�T�w��c�D7����WL����D���\��a.i�b�Tߋ�k��ŝ7!.bĪ���d�c�:&��e��&���L�YHl
��u��F�*QxB��4mCb!bW�I����ZRa���_������>lo��D<[����W�Ցȳ�*ay~\߂./�(�0r��$�Xȱ�ϐ��y�����A��֫
�ՙ�b�&�c *��Ғ/�U�*Amw.�������j@�9
� o�W��g���A^�f�o�yS?۷)�E���~q���<�tx~p�+��n�$O�D�
��ܷS/��*Y�坴Q�� XuD��p%��h��3�żT�/��?˻������5�m�Nwwv�q"�1�)�|�;%#�A�N�!t�<~G�MI�%�ِ�9����S\)<�W\)����RQ�
+endstream
+endobj
+11259 0 obj <<
+/Type /Page
+/Contents 11260 0 R
+/Resources 11258 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11138 0 R
+/Group 11205 0 R
+/Annots [ 11217 0 R 11218 0 R 11219 0 R 11220 0 R 11221 0 R 11222 0 R 11223 0 R 11224 0 R 11225 0 R 11226 0 R 11227 0 R 11228 0 R 11229 0 R 11230 0 R 11231 0 R 11232 0 R 11233 0 R 11234 0 R 11235 0 R 11236 0 R 11237 0 R 11238 0 R 11239 0 R 11263 0 R 11240 0 R 11241 0 R 11242 0 R 11243 0 R 11244 0 R 11264 0 R 11245 0 R 11246 0 R 11247 0 R 11248 0 R 11249 0 R 11250 0 R 11251 0 R 11252 0 R 11265 0 R 11257 0 R ]
+>> endobj
+11204 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1NNC__Polyhedron__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 11266 0 R
+/BBox [0 0 212 192]
+/Group 11205 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 11267 0 R>>
+>>
+/Length 395
+/Filter /FlateDecode
+>>
+stream
+x��TKK�@�ϯ�?���>�� {(�P�<�
j_"�`=���M66}P=KH��y�l>���N^�X�fܯ�߁1?�
�愛�r~���N�}��
I.�	�Q2�;,����ض�
+��HyI㩔��>R�Jc�,%EN�@,9c�#�0�7U��K���9؀��f�uE�4��7Dĩ�Y�TY��I�diS8һdxP�/@$PH�vY��wy9M~�uQ�2U�M�*���^Ҭ� �:뢐�lF2岛l-��!`J�%�!\�
|���lt}�>�u��msX�!�̮#�
b�]�q��G�ل�ȲV1��a�b�g

u�ItG$ʍ�A6-_��"�n$����d��|�N�-
+N��[轢�q�O�3�m���V���&sw�5�8��e:��|n�
+endstream
+endobj
+11266 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+11267 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /ZIVHSG+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 11268 0 R]
+/ToUnicode 11269 0 R
+>>
+endobj
+11268 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /ZIVHSG+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 11270 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 722 722 556]]
+>>
+endobj
+11269 0 obj
+<<
+/Length 11271 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0E���Y���G�CI7^�A�~�,�A-
YY��+ψ*����
�;�/�KgM���O�� �X�q��^"
x56++PF�D��Q�,��~����S�4�Fq~�ͳ�|�  �
+��W�|_z��ߝ��m�"k[P�c�W��Ĉ��y۩���l���kqq�G����	�^�+fMW
����Ъzyb۠�Mx*/cyQ싖�":�L;�c�T������L�
�$Ӊ���ά��Ӟi`��$Q��(�RdJ'�D;AT�C&�_�cJ�C
+'��ƴ��1y�>�O����č���p�[]��&���
+endstream
+endobj
+11270 0 obj
+<<
+/Type /FontDescriptor
+/FontName /ZIVHSG+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 11272 0 R
+>>
+endobj
+11271 0 obj
+303
+endobj
+11272 0 obj
+<<
+/Length 11273 0 R
+/Filter /FlateDecode
+/Length1 1760
+>>
+stream
+x�UU{lSe?�w��Ѳ�r�`��]׽���ck�^���
+�c�n�c]7�c��:4�#
Q4Q	1Cb"���F���E�D��	�����ݭ�m�w�9�|��;��. ȁ&�`ߙ����j e
��]��?9��
>P�N
��z�?��ߠΝ@��<� �PK"�w��"���������
��Q�b���
*��%ʫ0f���
p����/7�(�H�dXz��-Tt�N��G�$���r �SU�̛
��p;�Մ&'�om'������f���2�OH�ѹ�/-�-�BU�5��'��
=�

��\f�`��٘�i$
�i5��r���p:�Wu%���3l���@p{��T�]Q_jYkmXWW�
�F�����d���6�J%ݘWn뉴�+���9�
+����`��ڥ�:�4ZMm�
�V\���2�D�E��F":���Dz,�6��|M�vI��f���=mX�?�DŽU,Y���vˉ�������Քw8;�q�ر�PMך�P���.
 I�'�^�,�1���L��2DZ/�ԛ\Էp��2���
"a�|У)��1�nc�Jg�~��V���::6>u$�
+��n
+Ғ�W���%��=�/R�m�1� ���� `�g"��tN~��X�
�-
+"�1*\��F‰y��N���E%|�3�U{g�faft�_e,
�)�8�_ї��	."�Ŋ�l�l
+����uݽa��c����tN��^���ʵ�pf֪�� �&�3�D.�
J+�S"
!%��asD��ol��T�D�^�&Viظ�n��%�ep�г]M����n]ij�yB	fʛ]�{��y�~�꽮��{�Cã��-�H�/bx���~��77�B��x���X�@��s=�U2lMz�1IHp��ͨ���觳g���ћ]��a
���Ts5�\�ύ�Ѯ ������a=�Л��=w��'���7�oab�����[N
=�n_3����N��/�d���c��ҵ��#�r���p��ɨ�/��$��!2%Jp�"�h���1�����l�=�jb�����l5g�����wh��
�N�
�&��@���
Ϗ�������ЈtS
$!;K��
OΜ���̼���/\�h
+ |Q�=����kֱ��+�X�8GD�NP����*�Qsyo���ɰa�-T`�� �g��I╋��4xk��h��[��"Qm�׭;
+�Q5w�m���U?f��=R�r^Q�b.d���ݖ~�>�O��,�)��O�
��,���"=��y���d�l��B
��Q6�b��}��� c�{�F�3�%�6������
ҧ
&�R�mH�af
+$|���ÝC�!��
+�
��M�]��aVEe9o��\P�
Ymt�
+endstream
+endobj
+11273 0 obj
+1360
+endobj
+11205 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+11217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 435.473 187.853 446.377]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a60ae86027d4480aec07a5eed85f6977a) >>
+>> endobj
+11218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.511 435.473 257.154 446.377]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.035 435.473 426.424 446.377]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+11220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.098 435.473 501.345 446.377]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+11221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 407.041 187.853 417.945]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a16829d6b83d0c21f3d3e1f87c46ac239) >>
+>> endobj
+11222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.19 407.041 293.017 417.945]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 378.609 187.853 389.513]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_af5aee1171c6c67b9c57f3949b7b75be8) >>
+>> endobj
+11224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.668 378.609 269.495 389.513]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.024 378.609 350.969 389.513]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+11226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 350.177 187.853 361.081]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a7358056031cb08692ae07044715987cd) >>
+>> endobj
+11227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.19 350.177 291.333 361.081]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+11228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 321.745 187.853 332.649]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a89d5bd03139c8fcaf1ab035208d680dd) >>
+>> endobj
+11229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.668 321.745 267.812 332.649]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+11230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.899 321.745 349.844 332.649]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+11231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 293.314 187.853 304.218]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_ad5c6d64b009045df8248bcb8ffeea69e) >>
+>> endobj
+11232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.19 293.314 299.642 304.218]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 264.882 187.853 275.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a42e87760e6f69306e6322cc77f20d162) >>
+>> endobj
+11234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.668 264.882 276.121 275.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.631 264.882 362.576 275.786]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+11236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 236.45 187.853 247.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a8ee7e3364443dc8cd55f3f6388c81ecf) >>
+>> endobj
+11237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.683 236.45 277.239 247.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+11238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.608 236.45 373.074 247.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 236.45 513.996 247.354]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 224.869 123.096 235.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 184.108 187.853 195.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a56849f08cce0bbdb7b8118abb30471c2) >>
+>> endobj
+11241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.818 184.108 234.418 195.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+11242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.978 184.108 275.705 195.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.139 184.108 390.605 195.012]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [441.718 184.108 513.996 195.012]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 172.526 139.694 183.057]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 143.721 187.853 154.625]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a691bb5ef88a4c9638034de4c1b9532cc) >>
+>> endobj
+11246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.19 143.721 235.444 154.625]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+11247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.724 143.721 340.19 154.625]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.989 143.721 483.74 154.625]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 103.334 187.853 114.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a35d0734550a70a165a87b145be5e8728) >>
+>> endobj
+11250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.359 103.334 261.519 114.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+11251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.868 103.334 390.334 114.238]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [441.718 103.334 513.996 114.238]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.753 139.694 102.283]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11257 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11261 0 obj <<
+/D [11259 0 R /XYZ 89 770.89 null]
+>> endobj
+11262 0 obj <<
+/D [11259 0 R /XYZ 90 454.735 null]
+>> endobj
+11258 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F111 1509 0 R /F39 2335 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im18 11204 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11307 0 obj <<
+/Length 2414      
+/Filter /FlateDecode
+>>
+stream
+x��Zms۸��_�O)5c�x!2m:㳝�%����8
%�6z��TSݯ��)Ѵ�S��2�\�.
<�
{
�~<�����`^�␆��cO1�!�5��|�����O

#D��2�g�n/�no��ۣ/G^a�X
�ț-��>co�?y�8���P�Ի9��v��M!n�Dp�y�D�5���L^f�(��o"�qmm%�4�����-�[rT� �j�?Y����H4��K�%
9S����(
0�����QG�xp!��㶇c Ro

Ɯ�o���&�y�~��"�:�zwcFB��x�ge��,FL�fU�gI:�yL�r+l�V�EQDv��^
cZK�t��ba'}:X-�*/�<`�?�a�p�_�ZO�Ҥ,w"�YG�͓J�ӫ_&g��c�9�l+���]������it�Igl�8 ��aD`g������J���b'�Xd�c�VzpVی����w�/`EG�fU�Pi�<G�ۢ4JQhW)�J��K���1~�4��@R�=���zr�xH��
Z�
qa�ނ��HŇbĄ?WYR��R��e�
"Y�fU^�!/Y[r�k^
,��R	X����}p��2b�o��p��}����
����
�k|$�P�X�
�E-�1d���O��IK(@!nRK��J+�5��7|�d�>E��0n��=j
+i#0�ibꜝ+p�Ty6V��
+I��v;��`n�����}'��Ϡ�;a��`�(9Z��
��B�Zċ�R�`�O!=s��?C0�5�
��c���Qq�-5�*�f��VHl
+���!��jBYIy� ��	�m�i���(��7y\��Ē�D�Ol�Jf��0�^��DD�"6���#v
���-B� à�$|�A�MI�Ϡ�hTiM�#�m��c����u쒈�;���~#L��O@�|VS�)Cd�*��c�B?�%-��R�MA375�}��}s�����ǭ9x�9P���VK�*�i����g��i>�r4@��j3��.�����L�n��
����º�N�#]�V�54�/3 ��
����r1ե�ww*�X�  `"#@,ع�����g�Z�9� ����F#�]A�ə,ˤPi]K�yi��u�(��?���U�f�<3��s]Z���T�U�����r���9�c0Ϧ	�	�>PR�e��%��՛4�k
+ЈXS5X�a����(��nv�a�
=q
�|=�qu�8Y9��N�A'
G��/5e�Ucr�mY�ɬ>��-�B(����C���'��I�=�B��z<�H�2�[Rh ��{!ˆ�  ��y%�ط�Ӎ	Mx�9U��
+o
�0t
?����OB�'�H��AfP�����#c��,��h�� ¼v�H��c�
��9����8�n��V���s��,Y�,S5SUji��t`U*џ�
R���Hc�
���1c��2l��
�h����=��.dR�΍{
R=8���i���������a��@\su?�ܿ��i+����ld��r��1q�E7l|���X?�#�

�{�+��1) % y�f"�L��Ub�������Ligz\W�HE7���.��/+U�`�?S`!��&oe���[�ߕ�� ��'O%
�D��	���r�:719�U�Z:���lո���E�v=�z�잇�F	�
ʠ��
8��&��sqs�q��z�Ȩ"�ʘr=b��R��
��@1�,:�	樔��	�ԴH ���~�Z�ۮ\S:;�ON�p4���� ���0�1�8d�=��5o
'un]8�,դ��f����;��
�'���3�E�E	t[�j�A�O^�qwj��UEht��nY�z�7�G��Q���}nA�M1s�'Ȩ���\�Y�Ʌe�>�P��M����]���u�qu����7��j���i6
[]�o9
KCi���R���=��=7�w�=��� ���w���σ�S �)e 28ڽ��J�y���Zm�)�\�.�h�-&�j��M�+��,��;��n��X:�����~v�ᄉ/���
K�S2|c��;˖��2]��P<1��3B�lW�e�v�@ y�T�
ϝdf���݉[�|k��$�DDu����nA

ALE���(�����/�:������ty��0�'= ��p 8	��@<�.�L�8 ^����h�s��g`�
ק!������3��mCn�r�t�,
�>�
�&�pj}i3L��eo�J��K��>�Z��^���<�!P	��!Q��ݳ�
� ����RZB~�	���_A���o���
�\.�w�����1�o��j��
1�'�R���;��'�,�0��wp{�d��?t�YcLՈ!�,
٣@s�y#��
kۯ��?��e��(��`=V�����t�P�����n�Ѻ*�M�t_�������`paZ�n� ��7��
+endstream
+endobj
+11306 0 obj <<
+/Type /Page
+/Contents 11307 0 R
+/Resources 11305 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11138 0 R
+/Annots [ 11253 0 R 11254 0 R 11255 0 R 11256 0 R 11309 0 R 11285 0 R 11286 0 R 11287 0 R 11288 0 R 11311 0 R 11289 0 R 11290 0 R 11291 0 R 11292 0 R 11293 0 R 11294 0 R 11295 0 R 11296 0 R 11297 0 R 11298 0 R 11299 0 R 11300 0 R 11301 0 R 11302 0 R 11303 0 R 11304 0 R ]
+>> endobj
+11253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 696.002 187.853 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a86c7ff797f1b5e1b31217a176176eb4c) >>
+>> endobj
+11254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.516 696.002 288.784 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.36 696.002 416.826 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.288 696.002 513.996 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.42 166.264 694.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 656.151 187.853 667.055]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a163f5dff452c6cf2e3a0c929eb2b8187) >>
+>> endobj
+11286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.785 656.151 289.728 667.055]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.962 656.151 383.428 667.055]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.525 656.151 513.996 667.055]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 644.57 132.501 655.1]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 616.301 187.853 627.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.592 616.301 239.399 627.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a91cfad066b0e12cdaf7454fe4585cfc5) >>
+>> endobj
+11291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.736 616.301 340.678 627.205]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 588.405 187.853 599.309]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.592 588.405 239.399 599.309]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a2f41d86c5a949d903179e82072854ef4) >>
+>> endobj
+11294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.736 588.405 326.292 599.309]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+11295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 560.51 195.601 571.414]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a9dc9e3a464def0e2d929fab9cae6e360) >>
+>> endobj
+11296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 532.615 241.112 543.519]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_aee8ba0ffc68e00046b55e12427c582cd) >>
+>> endobj
+11297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.449 532.615 342.392 543.519]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 493.76 255.488 504.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a6b1f2d6606a0b4d4fc8bbde3b24ce553) >>
+>> endobj
+11299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.826 493.76 356.768 504.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.937 380.299 252.879 391.203]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.44 324.393 513.996 353.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+11302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.826 312.438 409.768 323.342]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+11303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.324 300.483 361.88 311.387]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+11304 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11308 0 obj <<
+/D [11306 0 R /XYZ 89 770.89 null]
+>> endobj
+11310 0 obj <<
+/D [11306 0 R /XYZ 90 673.411 null]
+>> endobj
+11312 0 obj <<
+/D [11306 0 R /XYZ 90 633.561 null]
+>> endobj
+11313 0 obj <<
+/D [11306 0 R /XYZ 90 605.665 null]
+>> endobj
+11314 0 obj <<
+/D [11306 0 R /XYZ 90 577.77 null]
+>> endobj
+11315 0 obj <<
+/D [11306 0 R /XYZ 90 512.746 null]
+>> endobj
+11316 0 obj <<
+/D [11306 0 R /XYZ 90 442.951 null]
+>> endobj
+11317 0 obj <<
+/D [11306 0 R /XYZ 90 442.951 null]
+>> endobj
+11318 0 obj <<
+/D [11306 0 R /XYZ 90 274.954 null]
+>> endobj
+11274 0 obj <<
+/D [11306 0 R /XYZ 90 252.577 null]
+>> endobj
+11319 0 obj <<
+/D [11306 0 R /XYZ 90 252.577 null]
+>> endobj
+11320 0 obj <<
+/D [11306 0 R /XYZ 90 170.076 null]
+>> endobj
+11305 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F91 766 0 R /F32 772 0 R /F10 773 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11326 0 obj <<
+/Length 2163      
+/Filter /FlateDecode
+>>
+stream
+x��[K��6��W𴡪,O�[����MR���並8�a�HM(*���6H�"��(	N��|"�����`��ћ���I�(�h<̃��HD��,��"9��qx?&8L�,y�S
���g=+�ǟҧ")�ww����Ә�p��'T���2Y���_�\W��|��l�!l����ѻ��#�p at j4IL���O8����X����FY�)��2�0��ۉ5OD�y5;ݘ���b�1$aHaQO���~)�U�� 
�<�
�
p 
GHPً�Ҷ:�AK엖�H
Q�[�
�	���K�I�E�~-��w�-[!��-)�����FP����^�u9��[�|Q>?�s��z�N��
�y� L
��ϐ1�H$�f��
)�e�	><�1�_�oҹ�
x�h����`����q�f:_;��FE�H��1!ظ�Y,�u��%��l��$�e
D���dj6��~�
�[l��Dr��u��õ5�1�j��Y�ϵ�^�"�t�
����j]Ua'Yލ'
B���j[ϫȻY��l���'�B
,�&O���iF�_!B[
6D�����d��&]�ne��s/x�`B)"X�R��6��*]
�u"�]p����NQ��F݇�D�
BU��Er?fr��NQ�(�S�A
�� �S�x��:-
 Lg^ �6��*0f��O`aT��,��_A?�썑�w,�x�#N!v�6ֵ�T+��[ӪHҼ|��]�:�{t�:C�P��?���vHDM�����0p^�`b�R��#��Pʝ��i�Ls��T.�������v$8m$��/�t���:Td/��"�q�7��.�'�����Zֵr�4���F��*:� @��ܥ.}"��ϺH��ts,�tGl��n�C]���&Őb�3�Ic�U��c���3��#�("N$�I,���ʻĊ
+Hn�_���p7%����`��h�Ueb��E�3�p
�wP4fz��]��
�^��=���9D�~]?��6 1'>��z��e��
Z��v�NL�XT������
+
�ɂ�,�*a[� Ʊ�`��Y�p�d͘\���g8�1�WGF�0��|[S[������R?��_6�1�C���M���G 2�h�����i� ��
+fق��-zj�ل�kh��Fzi
P*��K�h�&����Fhp0m�p�>�6܆�(m蠨�4;�����٥
qԥ
Рt�۴a¹ߗ��홯쇙�.�Bώx=U01�D�V�ԙ3��)���4٬u�F �ѭn_�%e2�	m���k�;d�#��~p[D媻�0��3]���
 $�~����o��K�X"��텊S`P�R�c�w�C��F �ݪ�{kp��X�Eט�ۼL�e:M�K�#�����\:/Ӥ����6�*���mc�+x+���|U�Y���8i at F$�
.4�$���,�09ޥ�|8�g�@Dp4������
�i����*a�� ���`̮mv�D߮a.s��s]$�=|
|nG�O���fgmqbϏ#˯o�O~�=��S���ݛ��F�NĚ(�ԽK�x�@aDx���dH�����o�q�et`����l�����:m R�;��K��e�:��}łR���c`�"k_��4�y��%�
b
+3bb�mݰH�1���2�=�a2\l \��nZ����i�7�+oZtfz��^�,\�Q��𢳗r�.����i�I�%v���*=m� ����un�y�� �!)d��Ë����z(>:P.(><@p�G����[|�*aP���+>�1~G{��
�Rr �>[rpBv%ljC�d�-9��3���N�!�[�G� 0"%}
{�XQ#!Q_��!Lc~I
r��HCe�
�ƺͻ16�ls
+�U� 1���s��@������ڞ
1�

�h��Ȧ

D���׮��א?#�ї|
��q��H����,��v���m8��S�Wvnp�6N�U6���
���gWE������\��Gܒ}.�֩��~�S���Zߍ������dY����=7�� �Rhe(��W�ڦ�����Q2wp�Ĉ�.�>������O��Z�
4]e�d�5�a��s�$�������1K��>=Pc>��˜�(�XB���V-��Տ�����}Ƃ�@ɻ�
m؅
+endstream
+endobj
+11325 0 obj <<
+/Type /Page
+/Contents 11326 0 R
+/Resources 11324 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11338 0 R
+/Annots [ 11323 0 R ]
+>> endobj
+11323 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11327 0 obj <<
+/D [11325 0 R /XYZ 89 770.89 null]
+>> endobj
+11328 0 obj <<
+/D [11325 0 R /XYZ 90 718.682 null]
+>> endobj
+11275 0 obj <<
+/D [11325 0 R /XYZ 480.093 666.388 null]
+>> endobj
+11329 0 obj <<
+/D [11325 0 R /XYZ 90 659.748 null]
+>> endobj
+11330 0 obj <<
+/D [11325 0 R /XYZ 90 573.549 null]
+>> endobj
+11276 0 obj <<
+/D [11325 0 R /XYZ 90 538.879 null]
+>> endobj
+11331 0 obj <<
+/D [11325 0 R /XYZ 90 534.396 null]
+>> endobj
+11332 0 obj <<
+/D [11325 0 R /XYZ 90 446.041 null]
+>> endobj
+11277 0 obj <<
+/D [11325 0 R /XYZ 90 387.062 null]
+>> endobj
+11333 0 obj <<
+/D [11325 0 R /XYZ 90 382.579 null]
+>> endobj
+11334 0 obj <<
+/D [11325 0 R /XYZ 90 294.223 null]
+>> endobj
+11335 0 obj <<
+/D [11325 0 R /XYZ 90 240.534 null]
+>> endobj
+11278 0 obj <<
+/D [11325 0 R /XYZ 90 205.864 null]
+>> endobj
+11336 0 obj <<
+/D [11325 0 R /XYZ 90 201.381 null]
+>> endobj
+11337 0 obj <<
+/D [11325 0 R /XYZ 90 113.026 null]
+>> endobj
+11324 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11342 0 obj <<
+/Length 2314      
+/Filter /FlateDecode
+>>
+stream
+x��k��������SbK뚺_:i�3�z3���8RV��m�n��w��>���`c�m67E�
.oU��S�����?ݼ�޼��b�AFR�M_<�=�
�5�>����/�o<&5"F�]���
�
���o7�7?��	{�0 ���lu��
��p�#f��s�h�q���>���;-�QaO��)4��P�1�aHcQ���6
�YGi.����#�'�
��	�:���{P3�Kۄ�0�4
1���К #ĞYG�o��W3�_'
Qeg$	����brxmr�3kF��br�l~{Fc�G?��p��'c�F��*��b����
&�
�Q�8��)c
��z*q��DY����$
S1�9O����8f�Aq�n�,X��qDA�gq����1���$X��mq�<�x�q�_��eq\�a���{D3��k\稗[�D�A#�*��y�Z��A�%����B��`�G�c�G~��s
n%Ew���hSi;TA��)�q��(^�	m_�y�"�b4����QM	���t�G��ۇ���&56�OAh� ����1�*$!O
 �1�CHj=�@�A"�
<�p�F3(@yF�+�J#jLU;�h�l�h<}*B~�~����w��hA��5�0	��M\��
g����H���%N�h$nD)/}���pf_�t/N�`(�j]��߄˹�L�K�v�\�Z���^�إC�x��U�U$7�2!0�T�i7h�
F�Af�~^�3w:��ayC���w���CM�h䙽��`d�<�����9_���
+� �
uZ��A� ���1�X�t<��
c��i��Q#�g��?8G
+������&aq��Fd)��k�(������y�rp�9yqa
� ��Ѣ�w�\׼
�'
��}V�ݝ9�&fK?	�-�N5FZ�2�k���f�S��9���4�Cp� �)��S�����I�%�Y�Iwq��)	f6�ngK�X^\
H${�X�{7�	���=
 `Q�!#�b�'�F at Z�4�F��{�
nJ΀���l�PПm�Цsz���ZJ���&Z��!΀�2����I3L���"����5�S�L:
f6�<�G�M�fZ2�J���j5fx�m� ���IG�pNj
��
�g���,!��cP'qX�
+����s
�D at X�!1�C��� �d�bPC��0��L
�xF� X��
2���X�fz�.WKLQ�"L���2�z��U�)i�������
+w�MwJ�Q�ϲp�/��2��
˗ 	�,��r2����z�1�%U�(�<N�~>y�x
w!�FmؐNy�œt�`i(1t��ӹ�_S6�7����H(��!�?���z� ��Ĕ��C��;G��E�ޣٱ�ӣ-)�|����I�Y(y��9���c�GG�]!����.^���[�m��~���W�b�tW��
���.�:գߵ�LҼ��_?|�t�ݷ�?��~�}K?�A��_bg�j�0dg�J��-[���Z��W�z�
������C���L����#5@�X�
�!�Sj$м�M�)ڸRD+m4TL�;e�`]3 ��o�p��ʏγ5����[,<�.F�s ��/�仭
�E� �Y��]'�ݏ꒦h�y9r4ބ��(��[/��\����r��+,��JX#�e+��JXn���]���[���˲�ۖb���U�l�"H�����&ൟl���m��2������-%D�):�j
+��yW�W��HJ�
�
̠2����(<NN0@Ҍ� �SS�=��"�C��P�
f}��޾��X5߈�bʁ�*.~���,d��c�a�����a@�
�

�-\�
+�O핳�ϱ��~k�oJ ��>;�E�Lʣ��y;u�*ڛ�!!|�	���z��Z�
F�0
+�������bg���
ƞ�	� =�}/���^��Uw[���ۿ�kxd)z�,�U�U�:��$��i��E9�-7� =4���:�B��C���-�8h�/1C��A
	���v��2�[�RG+6tL�3	��R�#Y�ˎE��B��2�z�6.��qg ��{c�\��b�^� �Ԡ�
���}����+%�{Z]��
�l?���E
I�u�[��}�k
4�W!��3�(�R�z-d.��~���
�3/���o})R���o�mz���U�Z1Q9����y�cy����~ż?�`lgn�&;��cip,�
��C4�6�
����8�[$�

1r^�mJ��Ě/��dW�!�!�i
C�}&�� p����J��or��i�����^�l}����f9t��gw�GS��IIIP�|�����h�xp�W�_�
+endstream
+endobj
+11341 0 obj <<
+/Type /Page
+/Contents 11342 0 R
+/Resources 11340 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11338 0 R
+/Annots [ 11339 0 R ]
+>> endobj
+11339 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11343 0 obj <<
+/D [11341 0 R /XYZ 89 770.89 null]
+>> endobj
+11344 0 obj <<
+/D [11341 0 R /XYZ 90 718.682 null]
+>> endobj
+11279 0 obj <<
+/D [11341 0 R /XYZ 90 684.012 null]
+>> endobj
+11345 0 obj <<
+/D [11341 0 R /XYZ 90 679.529 null]
+>> endobj
+11346 0 obj <<
+/D [11341 0 R /XYZ 90 591.173 null]
+>> endobj
+11280 0 obj <<
+/D [11341 0 R /XYZ 90 544.548 null]
+>> endobj
+11347 0 obj <<
+/D [11341 0 R /XYZ 90 540.065 null]
+>> endobj
+11348 0 obj <<
+/D [11341 0 R /XYZ 90 451.71 null]
+>> endobj
+11281 0 obj <<
+/D [11341 0 R /XYZ 90 392.731 null]
+>> endobj
+11349 0 obj <<
+/D [11341 0 R /XYZ 90 388.248 null]
+>> endobj
+11350 0 obj <<
+/D [11341 0 R /XYZ 90 317.517 null]
+>> endobj
+11282 0 obj <<
+/D [11341 0 R /XYZ 90 270.493 null]
+>> endobj
+11351 0 obj <<
+/D [11341 0 R /XYZ 90 266.01 null]
+>> endobj
+11352 0 obj <<
+/D [11341 0 R /XYZ 90 165.7 null]
+>> endobj
+11340 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F118 2438 0 R /F75 562 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11356 0 obj <<
+/Length 2492      
+/Filter /FlateDecode
+>>
+stream
+x��[ks۸��_�O-5!x?<mg���d�d��LwҌ��i�SI�RTc��^ EJ$%[L��$>�����{�1`
�E8��������
2����628R� !��&�
���L	�8��
'�2���P
��yzS$W��")
��?~|�z5!:�W�)8~�H�k�kz��w�j�Z�ʘ�	1�r����˳?����hR:�-�>��
<�)ˆ
}u���
~ѧ�_�p5��Qa/�O5\C��a�#E�X�!�}���e���Оɽ.|��=�X"A� z�m�?���omc"�)�d��8�
���V	��]����E��pD���F�F�
#~jxcj#HrI����uys~�HWw��*-�	q^�Y��9L-sx0��;>�8"R
�O���(6"�9��y�O���šaD�٭�Uq9O���}2K���l���Y^5�o�`1��
9�п�~�?�6ma-C�tBD
�ެ�ݪk/��l�Y���bၦ7�m
L���&�I��M	AFTC�@��I� &O����c-RbF]�'�
�O�:|j�i�cD�uN������I�u
�����H�Ѧ��H�
&m,F!�O�}!؇@m�Rd
v�@���3���� �j� $GX�a�哯z�0F
��0&a�0Ps�������;����e�/��_�I�/~,�ߨ���B�?�i��"�Xhqf^tt6eX#JI����:_�/҇�|���<���~+�3���[������
�	�4��꫿�����.޿����;�i
R�n�#]	��xh�9}�_d����";	wJ�<
+��®c�}��7?J*�d��]�W|*p�|SV���Ǻ�eV�wJ���*,i��l5O���:.C�*���F�i�X7�}��E�kn��+��E:��ix���l��I�
�Q�����ΔM12��PyO�5��c�LK�9I|�Ե�?��	��X�a�*;���n��<!8�r3\R��6�A�8TxȮBhW���>\݉���D �5��p����ݬ����ﵕ+v���v�
�*D"r�`��LB�
1�F6��\B]
%�5�������;̒K���i���	�r
2\�d��Rd��}��*/B�%��-Y��v��ݰ���6�V�2K�~��I���E�I&Ԙ��|�ٳ ƌ��aϤb�e
+^M�4��&��f��B�`
+)�C���>]A������:
S#�fE�0�[
0{KE�0��<��Z�`�n:��3
~4f
̙�m��=f��(N`�N�t� ���쵒c����ǀ�昽��(����t���S�5�ګ7W���}�:�
h3
Z ��z�t��F�P�7,�H����N=|�$�$
�$���w�H
R
�# πlT�ĔAq�Ҵ��s�Zd��K�Y�����^t��Hl��Hib�š�W&�&��T��ـB�m�
+���,(�l*�u]7����'.�ݥ�*����J�X �Tq�2੥�N'aT�	܎�;P0
��7c2��-��
q�G�h`PM
����G�at���Z��V�72�Uo0�7��q5�EWJ;0��a@#�z��9Qw�5}GB����"0)��9��A!�@�2"v�
��B��n!��$� ���(
�w(���	�C�r�QB��P� ��
���t�ݡ@�C1胃:��L� �W;G���w(�Ľ���
nm(�<+��|�,z��5�
R0L+��!	�5�#a�v�5_wj�$�O�0�Ÿ�ap���J>e/��#$�qK��H¨1$Lx�Wʈ&oӲm�RFW;��"H-[RFK�ٴ��~YB���v�k�R4O�h���
�*E�!`�B�;��@�P�y`�i�~t���R��b$ac�6-dVhOB�9�u���u�`\�7�7�\0�I2l��5�E^�I0!��J��g
�!u�Z�w�p���8"
i��#F��-
T8D٤ʚ
+�U��C�����v��Y�J_"��M>sS��G���6ʑi�Ga#�:���)3x�ʒ-�,"�!-z�@�U���){��U at k�_�G�@�c.��8Q���C&��p>� W�g

+�����AєdgV�ŢK�Aǒ�+D����+�}�K
�{�V�ү�;&��ovۡ
+1���}r,�R;A�ڙ}Hf�_�ᨚ�� �w�F���w�����G�YK��.I�<5Q�(a���j��w��Cu�.l!��ps��H/�m1K1�v�Y�n2��M�-�
�~�2m�z�8ݦ�j�
-#�/AuWO�/}~:�6
��kٮ����
����ۭ��� �b�
�R�妀����&�a
��V_�wb�̀��M�^��@E���
+�@SBwmյ�u�V)ʎ�w���4`���à˅�;T��⽿�m��W�>$�M`>v����~ZlO
D at xj�F�=!��OiZ���w��q�
��CF|���yYޟ�|y��[��;Lk�5�^W�*�͋p�HñCx�t���W�2L��4x
�P
+L���E�ڽ
V^�[��MNޒ���)�x
+endstream
+endobj
+11355 0 obj <<
+/Type /Page
+/Contents 11356 0 R
+/Resources 11354 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11338 0 R
+/Annots [ 11353 0 R ]
+>> endobj
+11353 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11357 0 obj <<
+/D [11355 0 R /XYZ 89 770.89 null]
+>> endobj
+11358 0 obj <<
+/D [11355 0 R /XYZ 90 718.682 null]
+>> endobj
+11283 0 obj <<
+/D [11355 0 R /XYZ 90 672.057 null]
+>> endobj
+11359 0 obj <<
+/D [11355 0 R /XYZ 90 667.574 null]
+>> endobj
+11360 0 obj <<
+/D [11355 0 R /XYZ 90 579.218 null]
+>> endobj
+11284 0 obj <<
+/D [11355 0 R /XYZ 90 532.195 null]
+>> endobj
+11361 0 obj <<
+/D [11355 0 R /XYZ 90 527.711 null]
+>> endobj
+11362 0 obj <<
+/D [11355 0 R /XYZ 90 415.446 null]
+>> endobj
+11321 0 obj <<
+/D [11355 0 R /XYZ 90 368.422 null]
+>> endobj
+11363 0 obj <<
+/D [11355 0 R /XYZ 90 363.939 null]
+>> endobj
+11364 0 obj <<
+/D [11355 0 R /XYZ 90 251.673 null]
+>> endobj
+11365 0 obj <<
+/D [11355 0 R /XYZ 90 197.138 null]
+>> endobj
+11322 0 obj <<
+/D [11355 0 R /XYZ 90 172.024 null]
+>> endobj
+11366 0 obj <<
+/D [11355 0 R /XYZ 90 172.024 null]
+>> endobj
+11354 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F11 621 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11374 0 obj <<
+/Length 1930      
+/Filter /FlateDecode
+>>
+stream
+x��Y]o�}��P`+5�o��b�v2S�v7���O��@��D�,ye9���^���OO��v�>�)����s/
<8���/��ջ�iIe�y4"����+	>�L�寛&"Z�(�����ۛ͝��x�Y�� �	�(R�v���+h�!��i|r�v�
�Yp��e�k_�'�¾�G�&
�F� "
),�;o��5�*-�shdr4���N0r
K$ht�{�Aj������M���A��؅�i!f	<�Ф
�1��	Gv�6R��c��w�CE�Y3���
�d�N�%��s���Ǹ\�(|<�L^�x�ŃbAf](, D�+e�#"�s+���R�5�����SY,�?��8L�����q��$
���1�"�턴j�TO����; �m�8O&��T5}^&�(�
꼑�xϓbs >��|[��q��g��`��5��%�5I"~QR~��1�=	�o���d�u8��:�����/.��m�Ň��Ӓ�0�<�ܔqe�zdY욡�1�e
ti�� S43�Z$p��2�%��G�������}����`w��)��
��^5VC�D�*�H��`�t��
P���y���� 
�����PQ�&#t� #���>*�s��ѰȖ��/O&)'|�X!|(�KH�=~L�K��
+_����o'<������
��h߅�";:荦f0THz���p՟��H�z}SLL-,s��L-��]o�7P	Te��%U�]U
��o
�QhJ�oM�N�h�M�(���k�5۪�}MŪ�σɌ����8�L��
+X�>/���bo��������B�hB�1�.B��K�(tvL��I���`(ҭ�;a+BP�5
N��a)ٖ~��	Cg� )r�@ ��wt�Z�M��6ɵ9l�t�u&"؇B�^�h��?S�C���ׯ�y�1R�]D歭6���K���|υ��O�
��Ky $RPs�<xo@V�
(8iw�
+�e`��)��&�YI��(P��gͽ�k0�Yr��>��+3�^O�7S�
�p �s��ÀEe�M���TOE2�k��:-A<>ޖEҲ6)v�TΩ2�ߪ��bU��*7U��
��[����ޔ���1�Ο�j�Ǟ��dz�|�i񾕢��c�]��Z'0��O�
+<���"�a�pr����y��Y5Vv����1�6��+���H����bk�ڥ~th4s˽&��oGG
HڴЯً6i��,�ya��}n{��(��.�wdp6��Q}:3<q`��h�sI� ���L�,��
�ո��_X��'i
+�F��FC'T�fc��Q[3��V�V��tb"�%�����D[
�S&8S1Pm
@�P�s��"��(WvnH4�H�3�}u�����Kx�$�H�=�l����.2��p����X��^�>@3���B������aG��^��{���R���$�yϜ'��ߟA���M�(�rN�W��|��ud>M��['�%
ɲ/s&i�
�
X���Ӟ�,���K 3
{��A�k#�~BrҧKD�;+N1X�&�����%E����S\5��
+����WZ��T�R�wB{����[�>#�������	�e,t�
������I��ǧ�}7�U�F��jn]�
��CT��x�U�)L�n����^$`Qs"ao�?�G�][���.9��'�\(D�p�cG}�vrIa̙

��E����ϑ��b�
��fѪW�S�c+��M���vݮ�
OZ�6"-:e�#|��&�1������V��h��&����$E���p�_���p����7`.&QD����،���߱� c's+��:ln�O%!�s;״���
��?���L�G��Z�~��c�-���1��v� W��(�5��i���ퟭ�[8���a�U�U��j����?>
L����n
��`
�i�b�M�����O�C�Ή�(��.

+endstream
+endobj
+11373 0 obj <<
+/Type /Page
+/Contents 11374 0 R
+/Resources 11372 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11338 0 R
+/Annots [ 11367 0 R 11368 0 R 11369 0 R 11370 0 R 11371 0 R ]
+>> endobj
+11367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 342.215 174.015 352.745]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction_ae20190c8d340b9d36a945b0a58ac8d84) >>
+>> endobj
+11368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 315.212 197.875 326.116]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction_af999fae66cdac4ceae98689fc25d1d26) >>
+>> endobj
+11369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 288.957 181.763 299.487]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction_a57a09616d44764f6c63a37c26986f154) >>
+>> endobj
+11370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.418 176.325 391.839 187.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+11371 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11375 0 obj <<
+/D [11373 0 R /XYZ 89 770.89 null]
+>> endobj
+11376 0 obj <<
+/D [11373 0 R /XYZ 90 718.682 null]
+>> endobj
+1916 0 obj <<
+/D [11373 0 R /XYZ 90 638.898 null]
+>> endobj
+406 0 obj <<
+/D [11373 0 R /XYZ 90 630.335 null]
+>> endobj
+11377 0 obj <<
+/D [11373 0 R /XYZ 90 555.367 null]
+>> endobj
+1917 0 obj <<
+/D [11373 0 R /XYZ 90 466.647 null]
+>> endobj
+410 0 obj <<
+/D [11373 0 R /XYZ 90 458.084 null]
+>> endobj
+11378 0 obj <<
+/D [11373 0 R /XYZ 90 360.202 null]
+>> endobj
+11379 0 obj <<
+/D [11373 0 R /XYZ 90 360.202 null]
+>> endobj
+11380 0 obj <<
+/D [11373 0 R /XYZ 90 305.21 null]
+>> endobj
+11381 0 obj <<
+/D [11373 0 R /XYZ 90 263.318 null]
+>> endobj
+11382 0 obj <<
+/D [11373 0 R /XYZ 90 212.63 null]
+>> endobj
+11383 0 obj <<
+/D [11373 0 R /XYZ 90 153.423 null]
+>> endobj
+11384 0 obj <<
+/D [11373 0 R /XYZ 90 128.989 null]
+>> endobj
+11385 0 obj <<
+/D [11373 0 R /XYZ 90 128.989 null]
+>> endobj
+11372 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F22 2982 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11420 0 obj <<
+/Length 2223      
+/Filter /FlateDecode
+>>
+stream
+x��Z�o�8�=��z6P3|��t�v�Ev��5��-څ�H�-�^�#Y�_C��Ö
w���/�L����|g������Og?ܜ�����PǺ��<l	�C܁o��yF0x� ��՜�_$��jN�,�7k��mt[�����CP��,�������������2O��
G���/�)#
��6n&dx�0n&|���W�_����yt&�<�+َ|�w��w&� �����q�d���9�zF@
�Hk��k���߰���F�s��fRbٔ�gl]���
-��-
�`K��Z��/�DV�(���`�c#"<����SFr��l�����b��\�Y?���8��Bk�Ҭ�!R+,X`
x�[�wfA�ȴ�(Kۡ��h�u���yhKY�T�P�,��,�FX
gs�gQ�j��`Lcy�8Θ^��f��n��J�x���������/�r����	��
��qN�}F*S.�S(�v���("
�ﺖ��\~(��袩���
����*Y��h��3
+��2k����.§Q�³D1R�%��iB��Y�	��0���Ita�!�ec],D�Hs�02f�-��-
q� �<t@�!"�8�
� ��d���0<�й��#[Ŵ���_j�e�~ۯ��=�`�q����� ��)��`L��[e	Dž�ЃhK��uƶ���`��@6��2�_��-)���7�,G�c��
(r�G���!8D�
��JG��fn�bL*RD at zK�zy�rR�^=φ�
�n�EP
�
�����46-�]×Frˇ����
�>�a
�u��õ&U@$���"��]Gq���щ"��Ǚ젭�oY�Lz2k~�
Ke�?*��2��d�νu����'J�Y��3k���y����p|'{Wɯ�GU$��P�-��!��k��0O��!���ɭ,��7u������
��}�
+F�a��eE˰N�m�%�вڣ�~7�V�Qe�[e���`��n��UxqȢ��=�1r��'T�Зׯ./��Sy�Q���N�V�@��"���gS
+���
�6�Үn� N:I��BDp��̟Ɲ�a��*�����\<a>u���Ƴ����
K\R͋(����R�('�9
q��򖮆��Q�
K���Tl=!��.��\�0���@}�0�"�ŋ�7��X_�>n��r�b�6��c�
g~x����d4��w)0;J���gP�My�!b���0
"
�
��0Mm��Z�a
4%(��n
$�l8b��E~�L��¦�s�������Nc� d�
�lLT)�>�� ��C��x3�
�o��j�Tu��S�b�ڪ��>@v�tnT�A �򮎟On*U��ɝ���=��x�nL$�1�@�)��9��I�+,%2ɊͲ��#���=���ʏ�zm�.o7�V�rz�5����&�
����
+aӝ�;yl���8�:�L����6�C�ڶ��I�@��i��D
�E���?���O���9�`⪆��Ĺer9?�܃|��eu��[��zd�|JO����ۨ�wz�ׄ�o�NX����8���A��ۨ˾ p� �/�@
3��R�)� r��N��2Z�������:�~�f�!�I�Jy��ߊ艻������������R�]Bh�;���f�������6��´���c��4���Q~�_�O�/��������C!�Y�]��H�'S�#—�7c�:��rܰ���^ݣ ᘞ�n��$�6����v�\���)s?0W	ƜG��t2c��u�&4�����1��m��

*(�(���4��Ͳm
���yB���_��>��z�zo������S��I��L	�|3 P
x ��	��,���6�y�O
+�ko���~
���7�_tb�
��tS�O�DG�	�6d�}���
�loQؐS�}{�X0�⨰�݃��:���K�]���WIWi}���u�غ�ѝ�C�p$�o��B_hz�
B��d��'سǂ,����B����C۴פ��0�#J&�Q�#��x��L�5s�L�0E�e��쪳�����Ʌ���zS��d=
v��W����^��W��
+�;–
I��}�pu�Vx��|֮~秵���f�U|ʢ��H�
�*�u�}-��Z����/g�
����n�0ZWU~q~~[�J��P�%��
��C��ς�
*��r��6䐹�5��X� Sc
0��3�0�63��͏f�
8�L��cF��c��Y
+endstream
+endobj
+11419 0 obj <<
+/Type /Page
+/Contents 11420 0 R
+/Resources 11418 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11338 0 R
+/Annots [ 11386 0 R 11387 0 R 11388 0 R 11389 0 R 11390 0 R 11391 0 R 11392 0 R 11393 0 R 11394 0 R 11395 0 R 11396 0 R 11397 0 R 11398 0 R 11399 0 R 11400 0 R 11401 0 R 11402 0 R 11432 0 R 11403 0 R 11404 0 R 11405 0 R 11406 0 R 11433 0 R 11407 0 R 11408 0 R 11409 0 R 11410 0 R 11434 0 R 11411 0 R 11412 0 R 11417 0 R ]
+>> endobj
+11386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.857 533.831 243.473 544.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a96bae54a01fe00bad4306bec61bb4687) >>
+>> endobj
+11387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 505.969 155.464 516.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Checked__Number) >>
+>> endobj
+11388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 505.969 221.894 516.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a891529f721ff485fe2ec90ac48952cc6) >>
+>> endobj
+11389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 436.214 181.845 447.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3b9f6fbac96e03a00d061a2cd2ca2baf) >>
+>> endobj
+11390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 408.352 181.845 419.256]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad5be1286c2cd8a227742f1d81b52f9c6) >>
+>> endobj
+11391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 380.49 154.727 391.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a04704288741dbaf6f50e8fc09c43f737) >>
+>> endobj
+11392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 353.002 176.505 363.532]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a070725ccbafe78e4c5fff018814df408) >>
+>> endobj
+11393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 338.024 450.955 347.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad5be1286c2cd8a227742f1d81b52f9c6) >>
+>> endobj
+11394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 313.807 191.718 324.711]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+11395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 313.807 288.852 324.711]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aa9d4170ba31cb624f515f45dbd52a652) >>
+>> endobj
+11396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 285.945 191.718 296.849]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+11397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 285.945 303.079 296.849]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_abba3c64cf02628dd82076607a4d509d4) >>
+>> endobj
+11398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.635 258.457 188.679 268.987]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e7f36b9aaa87a6713fd45edf4c92ccd) >>
+>> endobj
+11399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 193.785 197.363 204.689]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a14e9595f982172047485a897079e2e64) >>
+>> endobj
+11400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.429 193.785 268.072 204.689]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.049 193.785 440.438 204.689]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+11402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.518 193.785 513.996 204.689]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+11432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 182.203 133.174 192.733]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+11403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 157.953 197.363 168.857]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a72b4003eb85d959872be6607bdd86450) >>
+>> endobj
+11404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.051 157.953 297.319 168.857]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.277 157.953 390.744 168.857]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [441.718 157.953 513.996 168.857]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 146.371 150.878 156.901]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 110.165 197.363 121.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a45fd26849ccae749af76d0b5844bd263) >>
+>> endobj
+11408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.647 110.165 296.915 121.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.05 110.165 417.516 121.069]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.288 110.165 513.996 121.069]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 98.584 177.448 109.114]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 197.363 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aec1a9292123f47946225b3389f74de43) >>
+>> endobj
+11412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.7 74.333 302.527 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11417 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11421 0 obj <<
+/D [11419 0 R /XYZ 89 770.89 null]
+>> endobj
+779 0 obj <<
+/D [11419 0 R /XYZ 90 657.898 null]
+>> endobj
+414 0 obj <<
+/D [11419 0 R /XYZ 90 651.246 null]
+>> endobj
+11422 0 obj <<
+/D [11419 0 R /XYZ 90 550.811 null]
+>> endobj
+11423 0 obj <<
+/D [11419 0 R /XYZ 90 550.811 null]
+>> endobj
+11424 0 obj <<
+/D [11419 0 R /XYZ 90 523.212 null]
+>> endobj
+11425 0 obj <<
+/D [11419 0 R /XYZ 90 455.191 null]
+>> endobj
+11426 0 obj <<
+/D [11419 0 R /XYZ 90 455.191 null]
+>> endobj
+11427 0 obj <<
+/D [11419 0 R /XYZ 90 425.595 null]
+>> endobj
+11428 0 obj <<
+/D [11419 0 R /XYZ 90 397.733 null]
+>> endobj
+11429 0 obj <<
+/D [11419 0 R /XYZ 90 369.871 null]
+>> endobj
+11430 0 obj <<
+/D [11419 0 R /XYZ 90 331.05 null]
+>> endobj
+11431 0 obj <<
+/D [11419 0 R /XYZ 90 303.188 null]
+>> endobj
+11418 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F22 2982 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F39 2335 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11498 0 obj <<
+/Length 2071      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�8~���)kW�]��U����3ӗ�d�f�{�E0�ٵ�
�Ӟ_�G �!���c�T�$qt���$[
[�z���k�,��C
���R��B܁_c�c�q9���'�9�@���廷�/����w�����=��E�8��潏bk
��0bJZY��eSיu�����,�k&��-	�9����Q�� BrA.��l�
�����w7��>
ؼ��_���o�U���at�_�(L�x at x�
�4��:�&𑍯s���

x�QUB�WE�i������7=$��l8�`$U�����)�i<1���g}
r
s�Rw��lt3u~�4�s��9��e^6���]F�$^���nr�4�u�M�Ԅ+fVQ�ȱ	̋")ٮ0�� I�vՖ�V���Џ�4��{,���2 ����, $ֿ�X�@�$�'۬��jaI�
��]����G����Q�4��b���?�`D�����������M����J������?F��޼����o��
��v$h� �y��?j��w����/�Fm�˰�/�F��.q1ݓ/�~O�%�#���>��������M�\
+�6�Q�l��Ee$qYʙ�~�΍"^��P��Y��\GԢ翷�^��b�+^�)��X'��.��5�n�‘\��C7�,�>u�l�c״�4l�s�/�&�t2G����17�!q�Ī�hS=�EF˴��M���3�c
��"�x�T���,ax��}6���t�
��"��_�9x����V�����+��0 ��]}��!D��|�C:qѡ����̀�!��~m��k�)RJ>�I�a1N���q��BB=��6�8�k�	��f���<����	]^c�pqe�ڌ0��z��v�-���=<g)V;�,�dQS��
P(��s?,B�b�B t=d$�PXn���5��?a̚D9x툦ASAAX��p�\� G��V
��Աl��3�
0�$��aj#q��.7�H���Rt2�I��W�E��*����(y�U���F����1$��̓�H �
�
�b'��tj�J�4�D��6
+p���h#�Dx-�����]z"�J�C���>�����T�O�ᆘ&�X�
Sɮ4u�
�l���O�x�}U�(���!s/�b�	o��
8�L��e襠褞�]E��md
������V0�M�� @���$�5R�����>Y]��?*{��^4}�
���x��:���M������7��Co%A8i�c"�)8��d�8鸺K�@��j��{]k�ixts�;�F��~7�����,�}�`X
>�
���IW���� �u�1B�&�u��o��HE��
xD���

�<6qV��Ľ�6R�&JӢ�V�ye��~�˖P������p �:���q~l��Ã����4Й��8J�D
$� i׈��b
[���
��S;>zMp�/����,HW�/�b�]!�M4��w�&$�B�ң��-�RGF�b���T�
Sa�b���Y	0�� �	`xZ�W�� SF��فr%i����A"�([��S��wxW	�z �f,[fRܔnS�

(a�&(�n�t[����Y{�إ�[���i=��K������j�
+գ�tYl���E�lՒ̂k��9���&�fJ����H��=�"����́�
x�l5�F��S� c�Ȩ�Cs����!%B�0|
+(|��F:�����7:��N�Y�t��(�sl�pQ
+����I��`���M��V�Ħ�(K
�:�g���cxf\�
�u�Oļ�F�����rs���aS�$b�~�$q)d��k��#sʍ'o?��PD��&�LR��L�76yտ h��L��wx�
+��)ۇK��Sq�<��|h��
��mrMZ~�����>\�-�?g��~�\� �w<���2��?|�a��4{�y��,����̺�`��pCo�
0�7(p�G6d"�M�������#L��k�y���.��
��/m?^�YD�/����_��\���������L#{}�j�������'ȫ%��	)}$�$�}�O6�b3� ���̊P
��k��
+endstream
+endobj
+11497 0 obj <<
+/Type /Page
+/Contents 11498 0 R
+/Resources 11496 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11338 0 R
+/Annots [ 11413 0 R 11414 0 R 11415 0 R 11416 0 R 11440 0 R 11441 0 R 11442 0 R 11443 0 R 11500 0 R 11444 0 R 11445 0 R 11446 0 R 11447 0 R 11448 0 R 11501 0 R 11449 0 R 11450 0 R 11451 0 R 11452 0 R 11453 0 R 11454 0 R 11455 0 R 11456 0 R 11502 0 R 11457 0 R 11458 0 R 11459 0 R 11460 0 R 11461 0 R 11462 0 R 11463 0 R 11464 0 R 11465 0 R 11466 0 R 11467 0 R 11468 0 R 11469 0 R 11470 0 R 11471 0 R 11472 0 R 11473 0 R 11474 0 R 11475 0 R 11476 0 R 11477 0 R 11478 0 R 11479 0 R 11480 0 R 11 [...]
+>> endobj
+11413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 697.067 197.363 707.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a15b6fd54370651a7884d81c6a6178601) >>
+>> endobj
+11414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.7 697.067 309.153 707.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 673.294 197.363 684.198]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a931c8a50b23a993d5a820b94c4b94da8) >>
+>> endobj
+11416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.7 673.294 300.844 684.198]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+11440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 649.521 197.363 660.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a65737f26c11afd6146e8831048e5f167) >>
+>> endobj
+11441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.855 649.521 273.785 660.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+11442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.278 649.521 373.744 660.425]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 649.521 513.996 660.425]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 637.94 134.28 648.47]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 601.838 197.363 612.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4815c19ebb19e86a5c58ac16c17e671e) >>
+>> endobj
+11445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.363 601.838 242.963 612.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+11446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.041 601.838 283.768 612.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.709 601.838 397.175 612.742]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.805 601.838 513.996 612.742]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 590.256 156.965 600.787]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 566.11 197.363 577.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_acbc3c3c9c0761ed1c5988bb9c29e446b) >>
+>> endobj
+11450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.7 566.11 244.954 577.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+11451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.234 566.11 349.7 577.014]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.499 566.11 493.251 577.014]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 530.382 197.363 541.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af98a7a6da325511098f6b8f0a21a182e) >>
+>> endobj
+11454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.925 530.382 270.085 541.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+11455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.428 530.382 396.894 541.286]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.805 530.382 513.996 541.286]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 518.8 156.965 529.331]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 494.654 197.363 505.558]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.103 494.654 248.909 505.558]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac549f855c22dcda23d882bd8e659b38c) >>
+>> endobj
+11459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.246 494.654 348.515 505.558]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 469.026 180.198 479.93]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ada1a3fa1ca6f341e57d9f9f5eda2b308) >>
+>> endobj
+11461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 469.026 256.282 479.93]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 443.398 205.112 454.302]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a165d6b70d974556eadf494f305ccec98) >>
+>> endobj
+11463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 381.697 190.738 392.601]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 381.697 261.85 392.601]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a16f76a07b461817e79f8f10811206810) >>
+>> endobj
+11465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 356.069 190.738 366.973]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 356.069 262.159 366.973]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2d0d4c4268514182c172e823f3343a26) >>
+>> endobj
+11467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.225 342.582 390.082 352.488]
+/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
+>> endobj
+11468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 330.441 202.922 341.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 330.441 248.58 341.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a079ab370103bd84c354f53173664cde5) >>
+>> endobj
+11470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 304.813 202.922 315.717]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 304.813 296.181 315.717]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab0172dade8a8b47ea85a3dcbd1e218e3) >>
+>> endobj
+11472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 279.185 209.547 290.089]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 279.185 261.831 290.089]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3efb45c45d24223addb9abcc922876c4) >>
+>> endobj
+11474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 253.557 209.547 264.461]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 253.557 309.432 264.461]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5eca2acffa010b8e1b0311ef65584167) >>
+>> endobj
+11476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 216.971 180.496 227.875]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac399cf75be0bdd526e299833c4330873) >>
+>> endobj
+11477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 216.971 280.102 227.875]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 193.198 213.153 204.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4c61c716f9b0c406953b9dac9b828699) >>
+>> endobj
+11479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 193.198 312.759 204.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 169.425 213.163 180.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6fd695131c86734bc6d325b5d803677c) >>
+>> endobj
+11481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 169.425 312.769 180.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 145.652 205.692 156.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+11483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 145.652 261.312 156.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7614330bd99c7e64df07b99073872558) >>
+>> endobj
+11484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 145.652 332.156 156.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+11485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 121.879 205.692 132.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+11486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 121.879 261.312 132.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5f967c6b34fa38d22fac082d979db374) >>
+>> endobj
+11487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 121.879 338.781 132.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+11488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 98.106 205.682 109.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+11489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 98.106 261.302 109.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9ae28a5402544157a27a18af8088bbb0) >>
+>> endobj
+11490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 98.106 330.462 109.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+11491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 74.333 183.824 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a55f0409ad0da54065b64778ee19811c7) >>
+>> endobj
+11495 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11499 0 obj <<
+/D [11497 0 R /XYZ 89 770.89 null]
+>> endobj
+11503 0 obj <<
+/D [11497 0 R /XYZ 90 509.852 null]
+>> endobj
+11504 0 obj <<
+/D [11497 0 R /XYZ 90 484.224 null]
+>> endobj
+11505 0 obj <<
+/D [11497 0 R /XYZ 90 458.596 null]
+>> endobj
+11506 0 obj <<
+/D [11497 0 R /XYZ 90 396.707 null]
+>> endobj
+11507 0 obj <<
+/D [11497 0 R /XYZ 90 371.268 null]
+>> endobj
+11508 0 obj <<
+/D [11497 0 R /XYZ 90 345.64 null]
+>> endobj
+11509 0 obj <<
+/D [11497 0 R /XYZ 90 320.012 null]
+>> endobj
+11510 0 obj <<
+/D [11497 0 R /XYZ 90 294.384 null]
+>> endobj
+11511 0 obj <<
+/D [11497 0 R /XYZ 90 268.756 null]
+>> endobj
+11512 0 obj <<
+/D [11497 0 R /XYZ 90 89.532 null]
+>> endobj
+11496 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F68 3017 0 R /F24 537 0 R /F66 3165 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11579 0 obj <<
+/Length 2134      
+/Filter /FlateDecode
+>>
+stream
+x��[mo�6��_�O9X3$%J�-p��mw��&w_v
C�i[�,9����ߐz�l˲�8N���25
�<�p���13��s�w����ip�mjwS�cñ8b6|���#�cܿ����7�P܏��\Lo�!'^�~��w?�fq䅣۹��?�~�~OHM<�
ٶ�k���]�4��Uv�k��1Y��cޅ���!e�q��e�"��ILE2 n_D>\2���&�Jf炙�}��l��,
9��/z����.�j`dr�x�EM�
���?{���8�
��-���B�!�<�ҟD�%�,'Oj�M
ӷ�٥IV�yK&5�c��S0�g�E��G�:o�O�nۭ�m9ȥ�_06�����J�y �Q�!K5�O�DZ���-�6/�
+�C��Q��S@�
�l�.��L�q
ו�Y��O����
eQ0�������T�/�a�'��~
�t��F��ISd[t5�����C�0�JE�K��:'p�$�~"ҋ;��NmÁ��
!<���q�E1����YZ�86��q��
���cy��	���U�la��n�}u[fc)�B�b�`���8):.=��A.N� �� �)f&��2�ox<

�5�������d�1]�xi�[ �!Q A���(�i�5?������= �A-x�q�_���K���\�nv ����4
A\d�d�2r�;��D
�	r]vp�/;�C���
怵1r��\H�O��I�y�X�;��!���2?��d���e"�
�I֕�1��\��A�	���1dC�1M�Njb��^�V���"~v�n{	����D�
 ��a *o<
w_~��c�A�I����,���1�Ix�)G�:U�S�������(����i�2[��VI��$�K���;J��s,p��]8+�|���-�3�B�13��
<3�r�b�!E�@��h5g�.b;QvY�C�Fq�7�}�B��Al�0aǣ�a�M�—Z��jˇ2� tj
+b��}� ~���q��息"`��Ps�î�b^��W�U�@3�[��f�Xem�e����(i����o��E$O��M
���:�
�
��]ʩ22��
�7�"��i2�qD�X����Ҽ|�ຠ�+�z
b�lr���䴿�f�f'�:ue@��
x
��
+�i+v�DsI��
�
h�
��u�̉�]8���0��a�0�1�d
fn�
n�0|���Ƽ��r��6uO
q�_��X+YG�+�dO�.]��
d����u�%�B5�y*�<=M"�f�4饲$�
d��Iv7���
��DZ��^�r���&ߩAj��&DɈ�q�����o�'jrT��9
Cq_�0+l�Xu<�q]���7ʑku`T˱���<�Q0*�ʟ�*��W�#~
�
+����Y�gE�<�����`g�d-l~��y�2+��P�KX�3m�6�s��|�8�S�y�f����3/
�u�H ���"�-*���
m�����
7��9R��S���o/|6��\�
+I���DN�a��L("Z���Q*��H��ܼQg���дb�eȡ��n�ь��BD��������٭�h�_�(��I��,�S�C�j��>z�3���$��wf�px��g�lm	,,G
��'��I�s��dT
H���]��+_c剏��>�l����z�������)�֎��a�i�!�w7s�2��Q�S|B0R��'���г?�r!��%<9�$���FnD�<
�*�6:�L����ZP<TN��	^?
z����8�p�["�
=��
��E'(
>�tAPM����%��=Ibȡ
��*��O�:�$�/�<�tZ�\��a%np$�&�'?��5.���Y i�(��kۦM�4�t�gM�U�ɺ�E�e�
,�Ip�J%3��ᣑ-
��V�#6 ��a���l�_W�p s''��E�dZ�
R^)���j7�����=@�Z�2�����>�]9���y�_P��m�X_��\���w�.[U,D��p���`hB�x+�u&W�O�l��jRV���uuW�}��˷���l&E4C~����\8�Ne�i���"N�..<U���m�Җ
��崴�&�.X���?�7�Y�Ə1y��B�P�
+endstream
+endobj
+11578 0 obj <<
+/Type /Page
+/Contents 11579 0 R
+/Resources 11577 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11588 0 R
+/Annots [ 11492 0 R 11493 0 R 11494 0 R 11525 0 R 11526 0 R 11527 0 R 11528 0 R 11529 0 R 11530 0 R 11531 0 R 11532 0 R 11533 0 R 11534 0 R 11535 0 R 11536 0 R 11537 0 R 11538 0 R 11539 0 R 11540 0 R 11541 0 R 11542 0 R 11543 0 R 11544 0 R 11545 0 R 11546 0 R 11547 0 R 11548 0 R 11549 0 R 11550 0 R 11551 0 R 11552 0 R 11553 0 R 11554 0 R 11555 0 R 11586 0 R 11556 0 R 11557 0 R 11558 0 R 11559 0 R 11560 0 R 11561 0 R 11562 0 R 11563 0 R 11564 0 R 11565 0 R 11566 0 R 11567 0 R 11568 0 R 11 [...]
+>> endobj
+11492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 696.664 192.272 707.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e202d4f687e3925b37da76b20c24d3e) >>
+>> endobj
+11493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 671.338 189.901 681.869]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5911188c5ec8dca792b4ef117e29e876) >>
+>> endobj
+11494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 646.013 193.229 656.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_acd03be4b1944ce95bbff9ac4d5cb9001) >>
+>> endobj
+11525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 620.314 241.935 631.217]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a881c271d524d7acf0387d666ffa19820) >>
+>> endobj
+11526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 594.988 238.459 605.892]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae532824081a0b50d3688e0ab72066fe9) >>
+>> endobj
+11527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 570.036 187.689 580.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a89bdd81414c3119d65b37cc28e14b8c3) >>
+>> endobj
+11528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 570.036 226.693 580.566]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 546.04 228.895 556.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a421196cbbaf6a1ebe24ca31ddf4a6ca2) >>
+>> endobj
+11530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 546.04 333.482 556.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 522.419 229.503 533.323]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a07b4e1dbeb0e7020780d911a3dbe7e52) >>
+>> endobj
+11532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 522.419 334.089 533.323]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 498.797 187.264 509.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab408b475a1d6b0d2221fae755ee75cab) >>
+>> endobj
+11534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 498.797 293.213 509.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 498.797 371.148 509.701]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 498.797 455.727 509.701]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 452.261 187.264 463.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a855f549ca6f288eda04f16c23eaf8b02) >>
+>> endobj
+11538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 452.261 293.213 463.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 452.261 371.148 463.165]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 452.261 455.727 463.165]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 440.306 220.058 451.21]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+11542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 405.725 186.348 416.629]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6b43af400f0bc0ee0e8e91ca0bf085b7) >>
+>> endobj
+11543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 405.725 293.772 416.629]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 405.725 373.367 416.629]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 405.725 456.837 416.629]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 359.19 186.348 370.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a86ff7be69c1f0966767931a97d73b8a3) >>
+>> endobj
+11547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 359.19 293.772 370.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 359.19 373.367 370.094]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 359.19 456.837 370.094]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 347.234 218.404 358.138]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+11551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.772 312.654 187.446 323.558]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e4111a38f00baaf26dbf2ae57ce5376) >>
+>> endobj
+11552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.73 312.654 292.979 323.558]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.431 312.654 370.447 323.558]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.745 312.654 456.762 323.558]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 312.654 513.996 323.558]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 301.072 159.485 311.603]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.603 301.072 240.62 311.603]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+11557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 266.492 161.677 277.022]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af8c9072858fe3d8d47d6333e48071e58) >>
+>> endobj
+11558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 205.623 205.752 216.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2e86a2f104abe01c52cbc1bc31249d58) >>
+>> endobj
+11559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 205.623 276.595 216.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+11560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 181.627 209.627 192.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a99641a13bcdd49b7391dc6d16bffa4bc) >>
+>> endobj
+11561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 181.627 314.791 192.531]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 158.006 248.202 168.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2c32e2eea3afd94dbf1bcb6973d980c3) >>
+>> endobj
+11563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.018 158.006 329.845 168.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 134.384 212.377 145.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e0ebabbfd873d4a5d7076ebc02aaeb2) >>
+>> endobj
+11565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 134.384 289.846 145.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+11566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 110.762 216.252 121.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab15ec5f9b437b77ff4850dc1c0bf9351) >>
+>> endobj
+11567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 110.762 328.042 121.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 87.14 254.827 98.044]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9d1aa0e6e39894621b94991044173e52) >>
+>> endobj
+11569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.643 87.14 343.096 98.044]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11576 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11580 0 obj <<
+/D [11578 0 R /XYZ 89 770.89 null]
+>> endobj
+11581 0 obj <<
+/D [11578 0 R /XYZ 90 711.413 null]
+>> endobj
+11582 0 obj <<
+/D [11578 0 R /XYZ 90 686.088 null]
+>> endobj
+11583 0 obj <<
+/D [11578 0 R /XYZ 90 660.762 null]
+>> endobj
+11584 0 obj <<
+/D [11578 0 R /XYZ 90 635.436 null]
+>> endobj
+11585 0 obj <<
+/D [11578 0 R /XYZ 90 610.111 null]
+>> endobj
+11587 0 obj <<
+/D [11578 0 R /XYZ 90 282.935 null]
+>> endobj
+11577 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11663 0 obj <<
+/Length 2942      
+/Filter /FlateDecode
+>>
+stream
+x��\m�۶�~�B�\iƇ�+�mfZ7�8M�4w�;��u��S�TH�����@J��g��S	�.v�}v
�mfx�����\\��l��h0�Y�4�I������͜x���73(Dt o��/������n��w_�\�rA�+<#n ����vo~Ƴ[���
#���W��n�)�����]�Rܖ)�-��(�7$!�'�[J���zm��R`<��x�Ʒ�wF�lS���}�
+<Ϣ��$Z�w�U��E�I��<�
l���� �V0
�|S��J�en����.	C�s��Oy�/�8��o���U����D�+�^0V3����p�
�Lm�L���
�-����rw���"ȋhו#]���&M­O�R�[7d�l� �j	B4A��Jx��4�(����.�=:Q���F���%�����azA?��m��(YE�s��A��6�i�
Ok��e
+)�k/�x������
���W�kDx2����O�_%� ���Y��g�'F�z���'�#D#�������>K��
<���ܨn��k��|�r$�l ��
+1�턊!B�'�oI�%,��!��~eb��
���Z�?�Z�G
+�P5�-
�Q�JK�N�(�n���u�@HY
+k������ !@&��
+jQ����Ą�E�6N�0[��l���_��m\<�	yJ`��u�2^��
��hA�D�%=�u�Hm��=��bI�mhܛ����
����u�@�Z3��w�<��,��,��m�u�e��u��	6��s��e���}��E��&Z66/�lL1Ⲗ�Yo�Sq������?�Ac0O%p�E
�J8�{}�[��	7� 'FX� 'GXլ�>7v��wV�Ȁɇ�Ky
ݺG�=��E�^W��
��r�Ŕ����H�08�vO�%��P�OL
+������
����7Qe ���n��
�'� g�
\Z��\h��
�:�V�e�nOqi�YP�7�^�!P��0���@
���
�	C��	#P�%
� G��0x��9���H�h�[g�@��1����`�|Ġ`�#��8M�zؽK�J�
��]Ȣm��;5��d��I'
�
+�I+
�2
��,D}Y�
�BJ#5U��Aj�p���?ё
$��JB�/�h�d~5��L��<Tr�_�"'�O(Ѱ�����tj���^��w�XUr�
��>Z�fu���Ɛ�
+jٝ�z$aQyb������)� �I�*���{*��,�m��M�#�c����n_��d��%�������̮��-`�肧�
F�+A�Dq)�
+̤|'~r�@E�O�����*2�t~�$/?t*���
�}���"�4L�y���&�dn �2e[��m#ӡq,��>|��WH������ ��:��#�a�O���80
�(D�HD4�$ e7
�p�0��^��n�Q��ͻ�
sYH�����V�
w>�X8�b�����f
��KY�����5
���t
+#F�
��p�
V�03g�G��@�,}Z^߅{����c���b%���E!L�಩?+�`�eXbi��]� @�!,c��SD��>Ln����~��3�a�'�
�&���G��]z��~�~�??�w��N�@�_W46,�g	.?�Y ��wu��̇�~J�r�&��)
�ABS���wi]v���x��L��!\��Ǿ6�TW�fNw�*��z=@B�*�D�� ,�(ܦS�骶�e0��y\8���݂E��ޠ���??
+����,E��>:j�J�A��
���yZ�� �ʽG=��H���u�ͽ��i���M;
y� ��T�gҪ��
���1E���������1�����YF&㲊Lsw���G&
+͠i�{�l<4y�kg����	M�mhZ�s�f��:���P�):
���*e�1�Dz�`P��^m�u(Xb�^�O�
+H��� �m�6�:��I�/L�L&�j2w��+M;'L��cr����'�h����:�]V
���ϧ�)y��o����6��)(�c>�+����4
+���44%
�
d�EQqYm0D�{�Z��
iJ�
ˮ��L��J�ו2
��fiΏ�s���!��^{c���0^�
�
z��L2�
�&���
�E�<�ݾxXq�P��$��l��6q�[��.�DC���+a^/۱�r����;��٠�?�(�=�k
z�c�
�e�J��()���\�/^�Y�YT�I���hDg��6J�]��E��yX��iҤ��5����֠�@�!Бz*�F�jg����&�9�:�i�
�Dj���N��.F4��)P�x��qY����}R���
�{
������3e�8���k!����
���nӺ��
�fW�P�Q
��f�
+
 )�'72a`��X�!�. ��J~TV�Ceu���8*�w,a��sO��Oq�5ls����7��͏!�r/��h�=ќmZ�|Z�q �b�nH���C���D$�7;���O�}۹�i��
˨�dڈ~�S�N����4�:�<�4�T��@9yy���e]��Բƒ4`B��j�u2�\5�u��Ɍ[e�8|�!]O��`��
>/��y���<��b���(5�����
b�
E-��yR
+q4Լa�LԽ�ߡ��� iz1w��$󜟗¥���Q���])hH�S
H��8 Q�9�(/%�v�3�����G���Gtf�
I?^k�,<� L�A���ё��Nw��ۻ;ր�ɏ ��
+x���S
�'C��o��'��֋@���
�0����Z��������
��-����.a��f��OB��S�V�:�[5�~��[w�S
e0�����0��~)i
�ެP�5�N��U�H
 �uT�����Z��?�!:�0�M�uW�WW��7y�l�*�
Fh� �j��0N+�.��.�)��[�������
+endstream
+endobj
+11662 0 obj <<
+/Type /Page
+/Contents 11663 0 R
+/Resources 11661 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11588 0 R
+/Annots [ 11570 0 R 11571 0 R 11572 0 R 11573 0 R 11574 0 R 11575 0 R 11603 0 R 11604 0 R 11605 0 R 11606 0 R 11607 0 R 11608 0 R 11609 0 R 11610 0 R 11611 0 R 11612 0 R 11613 0 R 11614 0 R 11615 0 R 11616 0 R 11617 0 R 11618 0 R 11619 0 R 11620 0 R 11621 0 R 11622 0 R 11623 0 R 11624 0 R 11625 0 R 11626 0 R 11627 0 R 11628 0 R 11629 0 R 11630 0 R 11631 0 R 11632 0 R 11633 0 R 11634 0 R 11635 0 R 11636 0 R 11637 0 R 11638 0 R 11639 0 R 11640 0 R 11641 0 R 11642 0 R 11643 0 R 11644 0 R 11 [...]
+>> endobj
+11570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 708.331 236.745 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aef89ae29f8c0dc6f2e566149a1732f8e) >>
+>> endobj
+11571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 708.331 307.588 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+11572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 683.461 243.37 694.365]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab2dd186b2cc006f23a3206b920873f3d) >>
+>> endobj
+11573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 683.461 320.839 694.365]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+11574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 658.964 240.62 669.868]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a87239943c9354cb76acd3c7c3a5fcd92) >>
+>> endobj
+11575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 658.964 345.785 669.868]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 634.468 247.246 645.372]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a18331c91f5fb527759c43da03bb75a34) >>
+>> endobj
+11604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 634.468 359.035 645.372]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+11605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.173 598.016 290.391 608.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5c0ee0095333aebf1465dcc23b728aad) >>
+>> endobj
+11606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.876 598.016 374.291 608.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+11607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.612 598.016 416.339 608.92]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.628 586.061 229.044 596.965]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+11609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.291 586.061 270.018 596.965]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.505 538.651 339.621 549.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a82373711bf37090c84a7a8245f73c661) >>
+>> endobj
+11611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.769 538.651 420.184 549.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+11612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.836 538.651 460.563 549.555]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.133 526.696 274.549 537.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+11614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.978 526.696 315.705 537.6]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.256 526.696 513.996 537.6]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+11616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 479.659 193.577 490.189]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a02f64ed2505526a3265738f72fa17bec) >>
+>> endobj
+11617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 479.659 232.581 490.189]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 466.364 248.845 476.269]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+11619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 444.204 193.577 454.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a51b8a7ab7c9d312049b21add6cc8140e) >>
+>> endobj
+11620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 444.204 277.691 454.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+11621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 430.909 247.177 440.814]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+11622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 408.375 223.465 419.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4eb80821512bd8d880716af85e30267d) >>
+>> endobj
+11623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 408.375 323.07 419.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 383.878 229.552 394.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a96859bc9dd73f8b6f5db13631192c258) >>
+>> endobj
+11625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 383.878 329.158 394.782]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 359.382 266.673 370.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1471791dde276599f724696b054d8060) >>
+>> endobj
+11627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.01 359.382 366.278 370.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 323.927 299.171 334.831]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae5d22f897dedab2230da11af28069825) >>
+>> endobj
+11629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.508 323.927 398.776 334.831]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 288.471 217.109 299.375]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a50a4a535b9fc079cea6154105e752126) >>
+>> endobj
+11631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 288.471 316.714 299.375]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 263.975 271.126 274.879]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac15d97c4db0f7b5570380bae5592f2d2) >>
+>> endobj
+11633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.463 263.975 370.731 274.879]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.863 251.054 326.259 260.959]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+11635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 228.52 198.26 239.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a659108de10cd72f412b1bb6883e21b36) >>
+>> endobj
+11636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 228.52 236.665 239.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 228.52 353.317 239.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 216.938 246.458 227.468]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+11639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.562 203.643 267.759 213.549]
+/A << /S /GoTo /D (index_affine_relation) >>
+>> endobj
+11640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.583 169.154 222.689 180.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_afd6cbc70ab6cbd8675a8e65b98e8f1f6) >>
+>> endobj
+11641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.988 169.154 261.176 180.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.804 169.154 355.22 180.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+11643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.95 169.154 395.676 180.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.268 156.233 288.464 166.138]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+11645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 133.699 212.768 144.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6fb799a5569502c8429578e9137d034e) >>
+>> endobj
+11646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 133.699 252.959 144.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 133.699 375.145 144.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 122.117 286 132.648]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+11649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.657 108.822 275.748 118.728]
+/A << /S /GoTo /D (index_affine_relation) >>
+>> endobj
+11650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 86.288 250.099 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a657b456ab883ab71b6d31e408bbe2216) >>
+>> endobj
+11651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 86.288 289.446 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 86.288 379.512 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+11653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 86.288 513.996 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 74.333 416.369 85.237]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+11660 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11664 0 obj <<
+/D [11662 0 R /XYZ 89 770.89 null]
+>> endobj
+11661 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F39 2335 0 R /F11 621 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11750 0 obj <<
+/Length 3254      
+/Filter /FlateDecode
+>>
+stream
+x��\ms�6��_�O9i�B�J��3M��\}��z����%Z�"U������ H�� ���4��-����x��h<YO�䛳�gO��l���7���(<�\!��_�ɏS��ij9�O�gO�l,�gO��~��`�:�ʂ��ٳ�E�N� ^\l�]8���ۧ_�PO�B�'ap��s+Қ�Hy%p�Сa���O��8��ٜ
+
����]
���6���a��KL11e
�:Ͼ�<�匀<!�,I�ܞ���������'wFh;���xrq��3\Z���X\�����-���GI�u�I���:�i3B�Ej������^nm�w��R�!ő��J��D�j�O9b��B;j�
������D��c"�GX��'r;�l��4�wᲰ� �X�lL��Ye��Wo�9��h���b1
����j���a�4)�[X�$�a�\�$�"J�r�>X�ל2�`��ogB��k�t"��҆$�-�'
�XYY\�R6�y�B8�RhF$�>���oh�3[�����/�x��.;
^�	��Db
+��"X�}cD|Z�	�֨�*OID�9��$�FIP��ë� �V�� F�3���6�����G
���2BK9lJ*����&���
v������o���~�-��t@�?��]QK(ED�j�,�A�c�"*��t;���I���a�cV��
���� Ľ58�N�9L~
!>#��F����2����aW�~�
x�&yqB7W��Q��+�@��
J]O�M��	=��Z?,.�

Z�y!:��ɩ������Z�w���O�M�&�{{Gu`���KU�)&G`��{��!C��aY�ځe}�
��o
���-T.��{PY
:QY�h����Be�}*E���
����CdL�G����Ǚ��b�&�&j�g@�Ĉ��,�r�������w�G:

�@x�B�����Uz��ᢖָxT���3��CW���[=P �u��>����~���Г�j��s�����hs`gh�
��/�L�ڞ�(L�E�Q�?{ff��4���Z�7H����=T�&]3i$g] gǀ�G��� T��
���>
+�$C&"�L�� 9�"9�� �6�I$�rgY�z׊K�io�6���,V���U������Qo����o�3n.
�1 �D&��µ*�/,�p�/a��Ņ�a�
�D!I�c�
+�dۏ�-)<㈹�nEo\����=�PX"
+�j���q�~5���		+'e)���;S�~��I?�JM'�#�ZYMֵ|O��=)Α���i��a���]
��*|�S>��;�����1w�P��c%��|��j'��I>�>'�t�M�
B���j��ո�b
k�P�$��dw$SA��`WD���JU�. at 2E�1���6�<Y����7�v)����
,P�/!	|
���k�z�7���ݿ�~Ƽ�	s���@
G����:
�!�?�`}�	�
̇��_o̧�3��kӤ����:����d���'j�60{
+qN���xH���n�ԧ��Gջ�����1X�<�#S�u�7T�>n���.�پ�����Ծ9Ťn&
0.�7l��B;��I3Ώ����Q
�
&]���>	���8Z�ݜ?���:���
��{R�L���B��(r\�"�5rx�4��F�f��V�?XG�h�h�G�9�

�}%����'�N�K(�.V��?Ng*E���)���m��=���E`�Ʌ�8�s
�9@����	y�>u�!����h_cJ���5�o���
�i~/��������}n��2�UX܅a�X �
c-��	���n	�5ۺwhf�
�YL��c��wY�;�(6[�*_\����,IV_����~����u�-.g>��������D+H~��f��>\�!�*��}j���0��S����GN��[})�tH��Rw�x�QӍ!��f�R� �:vq��\P��K�*ұ/Z!�!ԛz�/v�qU	�e���$:���D���RҨ�_��&�WωW�ӫ��dL\F�*҆��V7A
�?/���(�
�a ��ޖ��܅"5jirijT-e�h杷a�~��X�UOK��*��ђ�*Kw�<�
��	Xst��ʏ��SD��B{�ҡ����×��a��7篿�ϫ�
%Ãs]����Jخ���7�zS��\$
p���s�U9�
+�AL�ݮ�o�)�S�	�;��_s�/^�Y��R�BW��yO��!�?ޙ
+uR3��UT�����OH%Z��J@�+�h�!ل�ޠ���o��ъ�CIJ
�:�
�>
�d��
L�b��2\)c>ձ����e��e�щe{�:-�Z(��
|����k����E��L��"N!Ԍ2u��c��[��M.C$��o	�4�-�,1�]��h	u�2N󛬯�x0lr5�w.��
T��4W�K�3
����L�C�(M��/_J�l����ٯD>L�g9����SƘ-�F���o����2�R7yđ�T�rR;x
�X��<zZ9�a�%�
�l���.IOu9�|:�
�g]�#��<$������N��B�7llI5�D|ϯ>�s/�jցR at 9�CzU�پ���+�&|�x���
k�u6={覧���۷�Ys�3�_�����,/�=޼ jS�8���i�F
+e�^����>�D'F!8/���X,�U��+>��*�o�V�[�δj=;�<��=B ��t�`ġ"q�|��C@�z��
L�_Se�Rf����&q#�6��L��(vz܁M8j{��a��mT��E9ǡ����
��{��a�vO����v�y����c��-#�E�{���l�B��a��>����Ԃ
\2`���E7FJ��N�r�F�/M�y��E�\�6���9���_Y�Q�V�+$�
��Fw�}��g���AQu�}�Nq������X�"�f
�jnq��}7[��3v3W�
/&h�zOk�c���ɦDH�,���|8t~Dc�m�i�Fݵ� [� /�'N%E�<J�a�

����cd�V��D�8͋�y���}���������Kj�W�X/~S^�����!/C$�Ġ�Tg���*�G�Q���ãHR6�~��,0b��.�P�!��j[��������_47)�ƛ ��z��I�w�y}���.
}�`�
��EX9�N��I�������֡ [...]
+endstream
+endobj
+11749 0 obj <<
+/Type /Page
+/Contents 11750 0 R
+/Resources 11748 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11588 0 R
+/Annots [ 11655 0 R 11656 0 R 11657 0 R 11658 0 R 11659 0 R 11683 0 R 11684 0 R 11685 0 R 11686 0 R 11687 0 R 11752 0 R 11688 0 R 11689 0 R 11690 0 R 11691 0 R 11692 0 R 11693 0 R 11694 0 R 11695 0 R 11696 0 R 11697 0 R 11698 0 R 11699 0 R 11700 0 R 11701 0 R 11702 0 R 11703 0 R 11704 0 R 11753 0 R 11705 0 R 11706 0 R 11707 0 R 11708 0 R 11709 0 R 11710 0 R 11711 0 R 11712 0 R 11713 0 R 11754 0 R 11714 0 R 11715 0 R 11716 0 R 11717 0 R 11718 0 R 11719 0 R 11720 0 R 11721 0 R 11722 0 R 11 [...]
+>> endobj
+11655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.255 708.28 484.66 719.236]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+11656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 685.961 250.748 696.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af1b57d321cb5695be7cadd0d4194bd04) >>
+>> endobj
+11657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 685.961 357.317 696.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 685.961 456.145 696.865]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+11659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 674.006 202.344 684.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.359 661.3 470.793 672.256]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+11684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 638.981 239.984 649.885]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aebfcd81c55429a63a36b41f4223a2f8d) >>
+>> endobj
+11685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 638.981 280.82 649.885]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 638.981 405.104 649.885]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 638.981 513.996 649.885]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 627.026 171.361 637.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 627.026 478.077 637.929]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+11689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 613.11 432.092 626.268]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+11690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 590.797 261.881 601.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aaeb3f18cecfa915b9cdfca4237772b85) >>
+>> endobj
+11691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 590.797 300.286 601.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 590.797 388.504 601.701]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+11693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 590.797 520.199 601.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 578.842 416.369 589.746]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+11695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.141 564.927 414.324 577.092]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+11696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 543.817 261.881 554.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3e2e5566d96001db1e141bdd098fda42) >>
+>> endobj
+11697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 543.817 365.272 554.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 543.817 460.793 554.721]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+11699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 531.862 202.344 542.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.222 519.155 466.67 530.111]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+11701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 496.836 251.209 507.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a45fa62259c7d5c327bed58252c5d2535) >>
+>> endobj
+11702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 496.836 290.549 507.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 496.836 409.969 507.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 496.836 513.996 507.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 484.881 171.361 495.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+11705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 484.881 478.077 495.785]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+11706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 470.966 456.992 484.124]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+11707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 448.653 224.57 459.557]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6973f94432db196ff06218b7c38205a) >>
+>> endobj
+11708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 448.653 324.176 459.557]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 435.947 347.869 445.852]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+11710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 424.587 196.297 435.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4706e460848762e3a7642f2c99a06666) >>
+>> endobj
+11711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.439 424.587 279.215 435.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+11712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.718 424.587 432.878 435.491]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+11713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.827 424.587 513.996 435.491]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+11754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 412.631 216.491 423.535]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+11714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.094 412.631 362.977 423.535]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+11715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.254 412.631 475.081 423.535]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 387.97 164.537 397.875]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+11717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 376.61 273.129 387.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a97348f369bbfdd4af775175a546db4c1) >>
+>> endobj
+11718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 376.61 352.41 387.514]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 376.61 495.961 387.514]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 352.543 275.007 363.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab3fc80231d3cc1a0eb6aed24fc8edefd) >>
+>> endobj
+11721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 352.543 362.877 363.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+11722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 352.543 472.148 363.447]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+11723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 340.588 233.986 351.492]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+11724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 305.563 255.564 316.467]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2f41b8cdce44d152a3f50677d5fe34ae) >>
+>> endobj
+11725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 279.504 257.637 290.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6edd4cd29fbac8a7b8b3905b6b31eefc) >>
+>> endobj
+11726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.974 279.504 357.242 290.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 266.798 378.454 276.703]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+11728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.897 243.482 257.434 254.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a293c185dd2a1e1d3e8444f13a3a4600a) >>
+>> endobj
+11729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.367 243.482 356.635 254.386]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 218.821 378.454 228.726]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+11731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 207.461 257.786 218.365]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4392d92c159c820229e9edeaaa1fde08) >>
+>> endobj
+11732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.123 207.461 357.392 218.365]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 194.754 375.773 204.66]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+11734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 183.394 214.06 194.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7cbf00ba912f6ebd370aa286367f5f4f) >>
+>> endobj
+11735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.398 183.394 313.666 194.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 157.335 305.745 168.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab54db7ae8f9d5601034ea84424a1a0be) >>
+>> endobj
+11737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.887 157.335 404.156 168.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.568 157.335 521.395 168.239]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.489 132.674 302.72 142.579]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+11740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 110.355 245.911 121.259]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a615afc2d71928f51973a0605de50dde2) >>
+>> endobj
+11741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.248 110.355 345.516 121.259]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.346 97.649 393.257 107.554]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+11743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.84 86.288 291.592 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a760e3ec9f524b03f810a04cdaac070f4) >>
+>> endobj
+11744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.409 86.288 392.678 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.169 86.288 513.996 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+11747 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11751 0 obj <<
+/D [11749 0 R /XYZ 89 770.89 null]
+>> endobj
+11755 0 obj <<
+/D [11749 0 R /XYZ 90 320.908 null]
+>> endobj
+11756 0 obj <<
+/D [11749 0 R /XYZ 90 198.739 null]
+>> endobj
+11748 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F66 3165 0 R /F42 539 0 R /F67 3022 0 R /F38 3411 0 R /F60 540 0 R /F24 537 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11806 0 obj <<
+/Length 2111      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�6~ׯ�K�D0 �d2�IӦ��沵ۗ���I��V�������@�I��L:�>ؤD��\>���@غ��������k߱BzԳ�WV�-�
��Sb}�
�����r� �Ѓ��ׯ޿������x6��z���#l%�!?��l��wl%��OFNX�rPf�ԁ�ƺ��g�[]�W�[�Z��B7�bD��'�y����ev1'ؾ��|Ḟݬ��av5w|���M�
�~�P]�\ݶ������(�z�{
>����Ts��,6Q�y��RR�fv\d�Q���7�m�B��|UHm�tN��V�Q�\��E^�S�y����._��w���]0�Z
�q�BZ�B���:OP��H�F}�A��7�)O�B9j�Q7ң�,�v�
�)'��a�
����ʁT�d��<��A�:5�@	bT�A;���|$�(��Lj8�z�-�nx�t~��c�Zۥ
�6jm~[$��ad��i��ZƷ�|����?l�)�y��(�;*���@U� �Y
�!ⷮ�����@Ꝁa�&�+C�$�ZL�L���2ʓ�0>�o��>(��,������@ 9��8R��� b#�}�$�	��w��
��G;T�\��{�����y
g�z�b�>}�� �b4fG������B�\�k	X~�ЖU�_��?2�{��a좞�
�� m�
�3ǜ�#�P
��9�-��No�CA�u㸰�q�y�Y^�#s�/
���֗R�>0�U�	P�M�	���� �#� >Տ��}���
���V��4�!
ya����
?���^�����c��8��@݃�N���
ψߊg�X6w���^��_�=Q�F7^/��1�]������s���҈�W��P]�8
2���.��J�\�No׼���ϩ�1����,guz�ke���Ř�u��{�T��>����T�t
��pc

 9�,��
k׃�;��Ď1���
;
+���^d�L�z}�Y	��q��8�#��ȋ6�
%y��v�X�Q�z�ܗTM
+5D3h�
��
�vs
	:�
SW�2�FNx��L$�uWI�\��`�
I`�1kT�q:���f�n�O@1��6iw@�$':�R��Ʈ��ƞ���R$k�T
+�:
+��S�N�7��f����>
U�
3�W*��4���$�
���2�P4 at N��;�I�,�
0��O��:�����Zإ:�,F�@6
�X�V�W��
��#��%�n>T��
2�_�'@���)�8DN��!ا9���d&BG�6
hᐉ�i�a�/X�~1t1�����Uӧ��6yU���J!q�TMB� < �_��ցN���U�eYn�<d��
����M�]�B]����ݾ=��� �ݳ��
Z�:(
Oί��7Cܼ�W�a�Cu��5�Q �}�+.6F9_��]G7�q�����Ӂ�O#�B��U��y;~3�c1�
z��;6�I�q�#�+����s��;�ڑ�1��^ ��)N#��0u!
��տ��'z�#���hf4�P�.��"�v+�>m֣Jf\���X�zǰ����;�L�H\���Ϊw��1q���v�_��4���a{3����
@�} a��.z<����^�ǩT��*�=���4��?���ypeeͶ��
&O�mv [...]
+��C\�b~W4��i�&G��d��Wݙ�ў��L�#��<*�ʣ�S<�7�k�@�n����
+�ﷴ���1y����£6�]
�sQ�*��}f��q:����ѣ杶��A���>Wx�yҘ�y.
+I���ok�X�m�= �caE<y�
|�"��vA�@�m�m�_��D&��
s��7�1�?��2��?��(�a7�V�]�P�F�O�$��>����~����M�X� �� y�^����5�1�TO�
�އ�n�,5���3f��9�V7D�չVՓ>�HY�@8	����QT��ѩ�/�K!�����c�uӔ�//o��5�oQ\d�H�_����\�^~VT]�/3y����&�M
+endstream
+endobj
+11805 0 obj <<
+/Type /Page
+/Contents 11806 0 R
+/Resources 11804 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11588 0 R
+/Annots [ 11746 0 R 11772 0 R 11773 0 R 11774 0 R 11775 0 R 11776 0 R 11777 0 R 11778 0 R 11779 0 R 11780 0 R 11781 0 R 11782 0 R 11783 0 R 11784 0 R 11785 0 R 11786 0 R 11787 0 R 11788 0 R 11789 0 R 11790 0 R 11791 0 R 11792 0 R 11793 0 R 11794 0 R 11795 0 R 11796 0 R 11797 0 R 11798 0 R 11799 0 R 11800 0 R 11801 0 R 11802 0 R 11803 0 R ]
+>> endobj
+11746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.622 708.28 310.533 718.186]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+11772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 640.69 289.866 651.594]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a500704447a47b59161c7b87a9a6e5a5e) >>
+>> endobj
+11773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 640.69 359.324 651.594]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 615.079 290.971 625.982]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9482e35d2c98aaf69f34a70f06290e07) >>
+>> endobj
+11775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 615.079 360.43 625.982]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 589.467 224.003 600.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a48ca5552a4b0a84570430527e50d114b) >>
+>> endobj
+11777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 589.467 323.608 600.371]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 575.989 272.49 585.894]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+11779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 563.856 254.15 574.76]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a781438b8f9047db7df9146f7f45c3ccc) >>
+>> endobj
+11780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 563.856 338.263 574.76]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+11781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 538.245 284.585 549.149]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_acde611096aa4b8fc8826262bf67484f9) >>
+>> endobj
+11782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 538.245 354.044 549.149]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 500.678 241.726 511.582]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_aeb635bf8c5edfacd4feff91b64fb436c) >>
+>> endobj
+11784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.617 487.2 407.658 497.105]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+11785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 475.067 249.318 485.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a26d8154ade10de97de8dea739300059b) >>
+>> endobj
+11786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 475.067 288.321 485.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 475.067 371.519 485.971]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 449.456 240.62 460.36]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a67a8415144aabfbe2b1118a6931cbeed) >>
+>> endobj
+11789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 449.456 324.734 460.36]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+11790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 449.456 389.5 460.36]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 411.89 255.714 422.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a180261988d8bec7295dcfbfc7f458dc4) >>
+>> endobj
+11792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 374.323 278.538 385.227]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a54ce22f211a77cb0eef849d146af8435) >>
+>> endobj
+11793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.353 374.323 300.953 385.227]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+11794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.2 374.323 341.927 385.227]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+11795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 299.368 203.075 310.272]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+11796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 299.368 296.324 310.272]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a60e481255ba2a7e0d44bb2fe0c14a392) >>
+>> endobj
+11797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 268.071 287.856 278.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab45b377c9c34a198290559e6571529dc) >>
+>> endobj
+11798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 236.774 294.481 247.678]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_af90f3efba85458dcd239a34b8126c466) >>
+>> endobj
+11799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 119.742 226.034 130.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad9e4b27a90287bc7f17da3de37be34d2) >>
+>> endobj
+11800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 119.742 393.444 130.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 76.49 226.034 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad9e4b27a90287bc7f17da3de37be34d2) >>
+>> endobj
+11802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 76.49 393.444 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+11803 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11807 0 obj <<
+/D [11805 0 R /XYZ 89 770.89 null]
+>> endobj
+11808 0 obj <<
+/D [11805 0 R /XYZ 90 319.978 null]
+>> endobj
+11809 0 obj <<
+/D [11805 0 R /XYZ 90 319.978 null]
+>> endobj
+11810 0 obj <<
+/D [11805 0 R /XYZ 90 287.032 null]
+>> endobj
+11811 0 obj <<
+/D [11805 0 R /XYZ 90 255.735 null]
+>> endobj
+11812 0 obj <<
+/D [11805 0 R /XYZ 90 179.671 null]
+>> endobj
+11804 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11831 0 obj <<
+/Length 3533      
+/Filter /FlateDecode
+>>
+stream
+x��[��6������>$JJ����H��}j�@�i[�%9������>DI����WXK5
��7C�ζ3:���77O_$b��Lr9{��et�D�%ܭg��%	�]0J���-��)�w�n9�����Z7����e�7�Ϟ�\u������׻��n{����
�s�)X\S���2� V䑛�&@##L�n�W�(|����v�c
+�2>W�a�wʌ��6��e�\U+���B
+�y�77o��3f��$��ʛ_��5
�8�Dd��NO*g𻟽���
�Vb��+�M���
zqf����b���,O�]5š+�J3^�<""�
��m�T�B�8]��K����T���p�
HHd�D5�	�nY<���`T�6�S�s���L�(]R'Y��J87�"h)%�
+�խ�`ͷ�͍EHbB��	IJ��p`<�v�έ�&s�H�������gD�IX6f��F$f�%S˥���&�K1��ނ���t0s!��岱!]��]�1�-rL�
Z>K��7L�Хe6_������x�bJ��M6>�M:��qIh�L�bD�?�+���[
��,˛������
>K)_��� ���:4���\�=\o�ong��k�U�1�?պ�h�
5������b۔�ՇX�\�-V��q�վn����RN>�Et�;���?���l~p����؈�,%���ڂf����І�R�-�-�����xI#c\���M��Pal�����K՚�MS�fu�&&	�{0��b�8W�)
I��w�n�̋�
���He�in�=䘖�����TU�Ջ��Z��j�
¾,�ƾ���Ợ��	���n�*�;{�k�j9dV0赬�m�ɼ���f�]��,�
lƝ���.o@ �)�Px��Nɭ�/�c.h��)>��sao]�UgW��R
�!�N!�f���H��N>ٙ|7K X���vF���R�Y�\
��f�9_�
\9;\�ւ�h��f�Fa%��p���G�-R����|x��b�{$���j��@�����?�"� 
2H,��|
���
X=�
��z�,. ��b{~J!����%�t��h?H�O�`*��~��Z���K�K�H��P�5���4:���W
�%�W��O��ݮX��
�r^t&�2�ɹ@�����@`���z$nr�Bę
�T�Mn\6I�:r%��L��Y�ypo���RA��`?
�#���$�����z�>1�sk�:2��Nb��ƌ�X�)Tቑ�eT�%A��:�X�;K�Z���~�]mF�á�?
#$�9�1
+��ٹV62�����z�*U[�L5��Ҽ¤! ��A,��u�P�y8������G��;D~3��I�Y��ɠ�;�$3H���a��w�/�6U,�S�C��ykX�S����ۀ�G�Ho0�@�
�gQm�
�p��U`E	�4��h��J'��l��6o�y�;fȻ`����>V+�2�	�x�
� i&��>Ip�[�꒷��8��,)�d��2������@�u��l�g�$#Q
��|f7��x<��EL�P�
�Q�‚
���v�U�t��ْ'�H!�;��uDPu�
����uz�
H�(L��4�ɞOD�%�g�{��l�@z5e�����
%���s�j��aE��Y!�t��q��`�TƗE����0Y9
���Nl�nB9Ed�i�:��1q�:����gATP��|
���<���d�@���{�z�ݕ���	
lb�	:� p��3����ʌa�j�J����~Hm)
+�t��'��R��I��phi)�vJ[@�͛� Zg�hzԽ�9nt��y�A@��]�2���pu�$K�ҵ֍i�4[�U�E����w�F$�5?�f.뺄�H<ʃ�ǕCW��|�>��p��3X�2��4�2�m��A��ˏ
��n�V^����h;���IQ�υ'��=�v��aN:��
V:C�_�W�����{���CM)��P-:ƴ8����4F:�
��`

�~��P/ߩ��H=5X8�
f��Fݮ^?1x���s3ϯa�o̯߮����JPg

�N�Vg"[f"���!o�S�wW�����GӢur��B\)Ӹ
�^�
����Q��
+���:��r�v<ܙC	k�f�:�������T]v��V

s�ε4ڳ��q�
NK��%5sQ��`gt�����pi{��0n����`ҧ )	1)@jĽ�c�9�2
���`e� U=����f��Į,���SS�-��Ad�>��ʊ5�!
�?�D

z�ʙ
D�4�
����	=�.�
`#�/ b�(���HHJ��q�l
�zk�\��)�އPxo_W��%�
6fd�7�9BDb
,q`UO��o�؜�+
��$,}��(Ѧc[Ȳ�n�4�GCOg|PG
){�y�wo���E:*/e��`�a�
��	זJ
d�#�w�c=������Yb�9ϤIX0b�_�Sx&]�'&E�P�4�-��vȧ��`H|��ui"��je�p F���r�a
+�9t
y	�b�	]��GD�i¬�u'#"NObԸ���	��~�qǓ>�C��E��Fd*�
�	��
e.����,f��4Ht�����
��vu�
��Ie

+Ư�G�8�B!3B��1MP\C�w�����m�O���ȯ�K5�6S�}�ok��:5E���\9�`���,�^�$
t,�X���W���v��:;F�
+e���Ip`	8��g�3'
��}
+ŗ����	��a@(���} �� .�A:����}ص�
+��]����o|L�ONaO	�\|Nv7�0��R2i��N�Kgt\�/=����ZO5=s���ΨS�,�o`�j'���v�FR}d�n���$��2�@�$�|����/
���Ia*���Ж9� f���'�
�z9��H�?��rrҶ<�N�ք����ևwO�1%L��]���Ul瑧�P�R6��sU
�
�?�O �
+X,
�gW,�Ӕ�P8�j0�>�b{J?�����?�a��Y���Ī
��r�''���r*{.""�
+?¯)�!����)=Z��޻Hc"�� �%>�P Xm�i8�|�XM��I�ӣ�{1�Ξ��w.�"�q
!9����<*:��㍇�����y��4�ߑ��CQ"�bQ^I��a��v,h��O0�������N�K��8yT;��G����FgIm�Q��Yl���
��< �ѯ��V��b�5�
�MO8���!�����ݭ������Lu�ڑʻ	Q��ת.��K�K�(#��a(��)^l&K���a[3���xر���w�lRu��YWp�#_����ȗ{���hW�����O
+���S# z->����{���W���l��}�59�G- ��I=�_�x�u
so[��~h/9x�x��:P�NR�	�A�I}�@�L'�s�^�d.�ݪ�o�q<����WG�p���
�������B��_+e�`�0sW��Ѣ��`���|�u�gO�.�[�r[����O�{���ל��e�d]Tx �;P�N��w���I���]�����~�^�O(�����?� "�c�
+endstream
+endobj
+11830 0 obj <<
+/Type /Page
+/Contents 11831 0 R
+/Resources 11829 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11588 0 R
+/Annots [ 11824 0 R 11825 0 R 11826 0 R 11827 0 R 11828 0 R ]
+>> endobj
+11824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [110.861 419.995 170.418 430.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+11825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.941 240.508 313.447 251.412]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+11826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.725 198.973 193.232 209.877]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+11827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.433 115.868 336.939 126.772]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+11828 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11832 0 obj <<
+/D [11830 0 R /XYZ 89 770.89 null]
+>> endobj
+11833 0 obj <<
+/D [11830 0 R /XYZ 90 721.073 null]
+>> endobj
+11834 0 obj <<
+/D [11830 0 R /XYZ 90 677.875 null]
+>> endobj
+11829 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R /F75 562 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11838 0 obj <<
+/Length 1973      
+/Filter /FlateDecode
+>>
+stream
+x��Y�o�6��B���[��Hv]�-M��ݚ�v�
Y(���%O�����"%K6c�i2
*E:��LJ�=G�`��U�q��d�F:�a0�h
H���ip�g!|��P!�CU=>=3>{3
�w��q�
�W8 ց@R�E������ #�UpS-N\����K�X��66�HK���A��~��$��ǃa�q��,0��ȷU�8J�3]Sr��'cJ�M��
+sk.� NMZ9
b�!UCʑ�ʺ=��K�R�']_�z�2�-/D!�5x�3�d|m
�����ـ��M���I6u/��W�|Zؿ��^�G�e���2K���2s��bu�|%�	��%���(���
+ſtl-����PH�C���̏#
��ZVO�7g����"��
=*:�뢌�>�X�*-�<JҲxzGz;`�A
)%�!��g.ç��ˑ������ eR�$-�4���Ͽ�׻���̍anjY��;�C�!�A���O�M�|RF�,�旣�h??��٤�2)�q[�/� Mܞz�6KkV�?�Q��&���
,ww�Jl�w;��e���m���xk��t6�I�gjo��;w#Ӭt��spX�C)}l���2L�]��r0tC*�"� 2ty��z�Q<h=ޚ�h�$����Zbo߽�P;����0H3���`B�>2h�7��}~H�n��vC:��o
+} ��I�@q��(	��E�ʹ�E0�jDC���ݞ�I���e//����d���22,�G^T����n
�= ��<*c˘�
��(	�J�3kљ̆7�z������!W������m	���'���
�#��E�u�
J".�VL;�Ե�ӧ���|o�z+�7
~<.!����&�����q=���� �	��t@@�-vu6I)�4�C�OmS��n�v����&� ?S
+)��"65N��wn���5����MK����O� P��/�Y��9���l
����[u��?��ڶBl�� Fq����׿���y�TH��j�)�L�Vo&|���$�?x�q�%��n��e�[o�o]ķ�y2I�
B�BC�a�*X ;�����WiKL�̩�ȜŲ\w��ZN7"�XƓ��i<�D�j ���
���{;�
4O�B��W��ᄉ/ͻ�ΔQ����[�y�Ӗ���EETk��z�|2��Zmn�ۈ�:
0" ߮������*C���;����u�f��_l��5���n�M�
Q_�y�
����B��.|�t2ϊM\9}�ނ����w��x��z at x>�G
O�
+̵w�P��qE�����/
�V���
�n�c�H����ۘy���>֨�_��NpJt�a� �?$��M�?�{`Ipp]KjqLS
�;ű��q�>OS}@o
�����1ӟ��CB:�x(@�U�&
��Mi���@�h
j
ľ�t]|��
+1�dx=PثranX7f��9
�M����<*
+�_	Յ4�M�ձTR��g>�+ �������?������߽�3-��;d�U
Dg����8��6�y>M�(_�GiK���k�E���Sbv*ߒ;)��D�gU[�N�
�&�4��):���n�5���$���bzHz ���fOh�"5?������u����&��9����f�!��`�0Gd[=[���Iy
�H����n÷\
+
�ˍ� 
��0�A��t�G
�
���j��� u4�A�aHJ��P���s$x�#[{��EȞ�~Õq��ўQْ��'����k���=Z.��6Y��ƺW��^�L�
+���0�#
T����\���cQu����ޜ�Sv�Oέ���BW��_�)L���_�zY�qN^/X�"gwC�7�8��
�
�m2�_@8�n�޾��޼�e��).
?G�*r�Un�;�f
	"�<�N��`�`�Gq�0fc��	�����VLPܸj��,�OON�V�"Ngn�����xS>�M�"˛ߏ�Ŝo9a�DŽ�J
+endstream
+endobj
+11837 0 obj <<
+/Type /Page
+/Contents 11838 0 R
+/Resources 11836 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11588 0 R
+/Annots [ 11835 0 R ]
+>> endobj
+11835 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11839 0 obj <<
+/D [11837 0 R /XYZ 89 770.89 null]
+>> endobj
+11840 0 obj <<
+/D [11837 0 R /XYZ 90 441.692 null]
+>> endobj
+11436 0 obj <<
+/D [11837 0 R /XYZ 90 418.233 null]
+>> endobj
+11841 0 obj <<
+/D [11837 0 R /XYZ 90 418.233 null]
+>> endobj
+11842 0 obj <<
+/D [11837 0 R /XYZ 90 335.731 null]
+>> endobj
+11437 0 obj <<
+/D [11837 0 R /XYZ 90 255.626 null]
+>> endobj
+11843 0 obj <<
+/D [11837 0 R /XYZ 90 251.143 null]
+>> endobj
+11438 0 obj <<
+/D [11837 0 R /XYZ 240.245 169.876 null]
+>> endobj
+11844 0 obj <<
+/D [11837 0 R /XYZ 90 163.236 null]
+>> endobj
+11439 0 obj <<
+/D [11837 0 R /XYZ 240.245 84.126 null]
+>> endobj
+11845 0 obj <<
+/D [11837 0 R /XYZ 90 77.486 null]
+>> endobj
+11836 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F91 766 0 R /F60 540 0 R /F32 772 0 R /F7 803 0 R /F11 621 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11849 0 obj <<
+/Length 2119      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�F��_�Ow����hHsI�^z�}�i`�-'�*I7�Y.�EQ/�[�ݥVÙ�ٙ��.FTxK���	�]h���\�S�3�H*���`Oq������4%)<� ����੟l�����x��
+��!�O������<�q��nV�6�}����
!
�$����ҿqSZ�)/'���0�0QN��!	o�~��.�� ��i�ٮ�,pO�
<Ɍ�i��3LL�V�����	1�#�-)��7�O�����?�;��ޗ|���A��n&����s?��3!
�݌(Ⅻ�R�]�B��[�R���=m���X����'�H�����px�G��![�TRH+�Qi���WW=J
ęT�t�JH9�g, ���y
�Y�x�&�Q�V�Q����a���<���=o�
�^񦿔���Dd��<�� k�K
+
EsA����h
F��
i
�M+�_���H�j�>_��p
f��*�\����!Ps
����=��E��ȵo\�����V�M��~���y���h���3L齖j��UK��
XG{v����Y*R�F� 	����֟�E�	�4��J�
%�M��u-
+O��Kg1A��2�
R�
26��
� ��LӶ�n�[.�_ݏ��n������yR�F����1ƓD"����r
�R].�ͥ���`}%�U����]E$E�Z�FJd�jk�z�6�˜���а�t&�k�����Oƌ��%�n��*�
˜{B�	s.�u
l3��v�{I@)Lꟃ5}�O^@f�����9
�AF�H%�D�����9�bQ�H�axS�0)��,�`�-���h���W
.��d��t�);�z���c6��`
������
m�{�
��ղ�v��3*�_l���!A��pMt]��(��:��k���_V�|e�l3���-�}����'7L��8ɂ���]Q�N��.\u�m ���V���
չ�o@�C)���3�v�����q��sd
�!���Cğ<��Cd�C�ɣ%�<xt
0��!�^"�!
+F�!��ؿ�

�N�!� 	)<�����[�ez
+/��!�/�
�
l�����s
�!L�w�!���UC`�Y�af�L=z�AK����!.p���D*b�
��%�F���(��d��`���,^@f���P�*>"hH|`�Q����,�@����@��&`r�
(T���l��лd���]S'7.� ��
�G9��������-�9�F�n���O粀�Wq���xX��{�92� FmD�6
���?�i��A$~'$�N�Ǔ�~�!0�i$�8�n�.�!�G��3�'��
�|��<hk B���V�B'�6�i�F��R�)5������5�0^?C���'0�\�k�I�N�2�*�KC�si�P0�O��������u^?Z!�
��p�p'|�ϱ�j�F1jV�9� �&g@��!�	�
+!Gc0J
�Z���ƴ�a
SK6`j
+kY��$k�<���ܟ��}Q����u�흌���ʯf�vs�S ��]�?�-Q
y��y�̃���
+����K""&���@"��Ș��>��@�>��I�k��D\ѽ��]��4o,�
?P�v_! ��0�
YR�5�2�]��[���4xC�_�����Iꑮ o�
9��1#bj�e�D���>?ڃ�ʓ����ݛ�?^x����?�Xi
R��1��@;���Z��h�1µZ����
|d�
hƔ�5���̶
,֣�	"�!�4�zLsT��i��N�6ś���4(_�^p�l�Dǜ��f̃�+�8����Q�I��<����
.a��W�X�Wq�c��7
d13}����s�c�J���RE؇�M^"�%�^���-_��b�KQ�s
��(��:/�����y
���˶3#����ܥ�(�Ż��w/��W����X
o��ue��0�shq}��u���_g"ʍ���s�M���P
��Ԃ �Mm�J

xzE�p���+{���>��!Pc��<�ʲ������2
�%���>
[�|�*�
��)����<����rT��&HJZz
�
,*H��~�c������
��
���W?��	�
+endstream
+endobj
+11848 0 obj <<
+/Type /Page
+/Contents 11849 0 R
+/Resources 11847 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11860 0 R
+/Annots [ 11846 0 R ]
+>> endobj
+11846 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11850 0 obj <<
+/D [11848 0 R /XYZ 89 770.89 null]
+>> endobj
+11851 0 obj <<
+/D [11848 0 R /XYZ 90 640.379 null]
+>> endobj
+11852 0 obj <<
+/D [11848 0 R /XYZ 90 586.69 null]
+>> endobj
+11513 0 obj <<
+/D [11848 0 R /XYZ 90 540.065 null]
+>> endobj
+11853 0 obj <<
+/D [11848 0 R /XYZ 90 535.582 null]
+>> endobj
+11854 0 obj <<
+/D [11848 0 R /XYZ 90 447.227 null]
+>> endobj
+11855 0 obj <<
+/D [11848 0 R /XYZ 90 393.538 null]
+>> endobj
+11514 0 obj <<
+/D [11848 0 R /XYZ 90 346.912 null]
+>> endobj
+11856 0 obj <<
+/D [11848 0 R /XYZ 90 342.429 null]
+>> endobj
+11857 0 obj <<
+/D [11848 0 R /XYZ 90 240.609 null]
+>> endobj
+11515 0 obj <<
+/D [11848 0 R /XYZ 90 181.209 null]
+>> endobj
+11858 0 obj <<
+/D [11848 0 R /XYZ 90 176.725 null]
+>> endobj
+11516 0 obj <<
+/D [11848 0 R /XYZ 107.534 83.504 null]
+>> endobj
+11859 0 obj <<
+/D [11848 0 R /XYZ 90 77.486 null]
+>> endobj
+11847 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11864 0 obj <<
+/Length 2305      
+/Filter /FlateDecode
+>>
+stream
+x��[Y��~�_���
�ټ�F s-f��Y��b2�����Z�lϿOQ�E7�S���2I},�Ū�J4FTD�����>B�rrq�V�� #��&w����		�n�O1�r�y�CĤF�Hx��~������ɵm�x3����@��H�h����G�P�
̌��(;-#N�����
�IVJdȖD� B��#}�
�	�8.��z1-+��[�}S)$��E����a+�xӡ��NV�e2S��I �k����= �IJ�~�C��}���l�VE��u���t�;��b[�z;]�J�
f��>[M_���up59R���G
-��Nbx
Ci��_Ho�WW�����l)����/,�h,0�g�*/�
4
���10
"��jkI����Ը}#�����f��u �Rc�N
�M�=n���㋀t��`M�Whk�_��ZL�<��
�푚�oX
�o�n
+�-0Θa�`��]���߾����ǟ������D�A��Ύ�
+ZtW���6��S�Z���s �+�ۓ�" ő��~J
׋t�%Vc0/�Jܝ�
+1�L)"XW��.ns�
��+W~�ve�PTwUW�d��4�V��-^���=�L9 ��t5O6i��ڢn���Y�zܦ�d���ʵ��]��nI
U#�c��莥�4w��(�,���7�,ͫ����|Z5�����6�CCw��7�[[6�p��
+dH��G���
���(�8��ˠ�k[]�m�vb7؋�NL��
`>+ �cI��3�]�8�N��
-�
%ΐ�0��bZ[�G��}KE$��3���X)O���M:�'�"]ݻ���S�"�ީ߭�
힓��"g̩_0U�Cj�Ј�Z	C��t�"�\Fab\{����
hؙ"5�i2Ok�
�E��`F+c]����l��V��-��.�30������=�u�u���ʖ)������">H3O_�^=��b7䑚y:b�v?%� �y$�BWAś�Y�.���q
8 !p1dJ��5
ӝWXHB�n���Rl�(�6�}��X��(,���$���3ѳ�ph9�¸�ɋ۫�E��/�_��f�E�mv�;�1r~0
P�=A���K�c���� ���&�M6�"�/Fd��ٲ�~lE�ٺN�f[ F
��
#N�0�b �
@�tC�%�%��>-n54n��t��t����	j�mm� ظ
C�D��S���g��AL�����
+=��`�M]pA7~��<gp�B!�� i�%:�!�h���v��� Dp?
��ڕP�ɣ|�Io�@�
��(9m`��E�'s�������^ZNu��
�4o������qv$
gL#��`:^1V۲^o20�p
s�����Aͩt`Pv�9Xעn��9�
5��Qs*ۮn,��F
7��o�[qsxj�9�^��fZ��p�c�F�����skI%0Z

�����2�7
=�,e�1-3�%9�=�)H�=y�4���h��4<�R��'|� �s�$z��BB�5�


��HK8#bP:΀>iNO��g�T(O�o�����j�X
�(:
�8:΄�p����p�
�?�;�#IȀt��x
g
�U���������O����<:n���T�*j�
�]:]z�8�(_uc�!����0!����I��C�O��
W)�<N��{ ?y�����	:�q<s/�Z#R{������k��	T����▭�=�x�և^#`'\#��� `�Z��Itd(M���yo�Z�b��{��{���|ݻ.`N4'{օ�8�[�C?�{Y��,�`���~��G���p�=�(���Ë0����e&�����&[zy���]�[}�����qڻ+ �.0��:!u݄�,�����7�B�v�nf�;��xUf���D�����&3QO��MX�t
���D����	G,#W"
�}���p�\��2��9�]�)F�]zbL���Ly��gӿ�R�6� 
�铐H33h�H\:�3g�֭�H�P�����#���!��̓��\p�B��3Vo�I���<��@�L\��g�-��ɳ��ͮN[��;-k�ͮ�����Y
[V�iX�5��_�XO�Dꄳ7��l
+Q*���nr����	V�#��z����S�����AO��U���@��C�?�����0�M��AX
�J���s�X�SU\�[��u`-���-`����Rr���ICTS��ê�r���滑q�~��
j�e�t��dSi1T�vKЖ��/���IR�`'ۿ��(��#�?�އ��������>{��I>�h��@#q{C��J)�
u�WP����V@����/��
+endstream
+endobj
+11863 0 obj <<
+/Type /Page
+/Contents 11864 0 R
+/Resources 11862 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11860 0 R
+/Annots [ 11861 0 R ]
+>> endobj
+11861 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11865 0 obj <<
+/D [11863 0 R /XYZ 89 770.89 null]
+>> endobj
+11866 0 obj <<
+/D [11863 0 R /XYZ 90 628.424 null]
+>> endobj
+11867 0 obj <<
+/D [11863 0 R /XYZ 90 562.381 null]
+>> endobj
+11517 0 obj <<
+/D [11863 0 R /XYZ 90 515.756 null]
+>> endobj
+11868 0 obj <<
+/D [11863 0 R /XYZ 90 511.273 null]
+>> endobj
+11869 0 obj <<
+/D [11863 0 R /XYZ 90 422.918 null]
+>> endobj
+11870 0 obj <<
+/D [11863 0 R /XYZ 90 356.875 null]
+>> endobj
+11518 0 obj <<
+/D [11863 0 R /XYZ 90 310.25 null]
+>> endobj
+11871 0 obj <<
+/D [11863 0 R /XYZ 90 305.767 null]
+>> endobj
+11872 0 obj <<
+/D [11863 0 R /XYZ 90 193.501 null]
+>> endobj
+11873 0 obj <<
+/D [11863 0 R /XYZ 90 127.458 null]
+>> endobj
+11862 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11877 0 obj <<
+/Length 1935      
+/Filter /FlateDecode
+>>
+stream
+x��[s�D���+���7{�d
h)����t2��8[
+�Bɿ�n�ʲ���)�N
,+�{�vm
�
|7��jr�B�� #�
�n��
�-��S��³9�O_����&�~5�x���e^��o�0{���y���4	��o���h��ꇋ���Sj��
+&/�UqV 3R^��aa�
����g�p��ͩ� ��i��_�yT�y
�Fٌ�i�,�3LL�TV��۫ɟbp at J��t��L޾��n�`Č��6�
^����/\Y�"�}��mH�ބ Ppgn�*��mn`}sJ���C���4)�=O�(���]n��pkN9b�8��f�ks�Y)$��x�Y�B�7���(	7ְ�����x�;�s���n�M����k����x�)�5Cz���-]!F��ʭ)�9./)�&N��1~�R�K9��32��=j)�4��՜I��j�e�ҎJ6�fm_�tk�FD6�y�aֲ
 !e
�AJk4�{�B�J#�(D1E����!�V��!���ϳ��v�L*Ǎ;�۲�ɲ�H��cy�*>
�d�i�e-U0�YGF73�w�vtM��(%�4�c]G�@F5��A7F��A
�a1X�R��/�{[X���C������M	���p�,ڍ;�疉�1�Đ�Ʌ�e.�b	���H�����>�����E�mKJ�
ڡFE��H�*����2Nf
O�
+���:�fLMWE7(�u�
s�1�'h�0Ԇ���q(jHQ7���j�yu��3*�T��xOE[	����RCY�ߵ�0�c�k��M�8Y��{h�7�
�J0������xX��S����$l���%zN�Ѥ�`44]5�)�
�vʹg�iM���%�#�m�ŋ|=#�
u7<�
�W���N!�L��}�2C ����>�'J|��h�cP�3��.��BC:l׏�N��@u���q����� d����ӧ�*����K
+�%=
sQ�c�l�%�3����Af�\�x�>��%���
+��u�Դ����GR���g�*��xo
L!n�"���I2G��KZ�G���Y���.5�]�} w)�ص��4O�8*��[R#pm�a�>��A���g����4��33�&"����C$��o��tSz��<5�y��_9�0�I�KJ>}|��!��҆d���l�Ơ�0���.q��1�ੋ�����S�iY�5��7�����Q�Hxs4=on�9���h�xM�<�O����a���d
��xG
�
m{��ǩ�d�r�j�����z�'��i�F�j	n�j}�|�,M�_G�:���M��G�|k�}\>�ײz���$��@m��Г�I�&�\�����4��b���QZ���M���,�ȯ;���k>�g^yj<���LYGQ;�����q�*��D��(Jz�s��8��'󉻾E����b���&���`�y���ڽE�"
J�@lD
+���y
+�P�\R3�J�iM)
U��Gӏ��4��B#)���
;N�;�pBA�7���I2GɅ2��Q.�����Q��:C�\
�z!�U�P|go_OX�b�	��7Gx�|�$v����Sa��.��%�3�#�p�<�^ �5|�\�bwq��
�3�,��V�5>���y
+���ˤ7~�i�/
U��G��Y.r�w���
��I�e�߼<A�(�
+Oh�,�,�E�
���8X���#�E��F��0O�������
㼲��i��Ӣm�^��˴�rm��
+A��
���ϲ��f{��>�w uK������
+	���W���ey��6ʾ�	1�,�S�<�����_��4ʶe��Mxp��"m��fsF��MU:�
�#��~���-�@��1�]��_^\�<��Q�B��㧥�Ln"���ߤu���)�Չ۴
^����ωegU�
������n\|�a����+�� 0�	
+endstream
+endobj
+11876 0 obj <<
+/Type /Page
+/Contents 11877 0 R
+/Resources 11875 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11860 0 R
+/Annots [ 11874 0 R ]
+>> endobj
+11874 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11878 0 obj <<
+/D [11876 0 R /XYZ 89 770.89 null]
+>> endobj
+11879 0 obj <<
+/D [11876 0 R /XYZ 90 721.073 null]
+>> endobj
+11519 0 obj <<
+/D [11876 0 R /XYZ 90 704.201 null]
+>> endobj
+11880 0 obj <<
+/D [11876 0 R /XYZ 90 704.201 null]
+>> endobj
+11881 0 obj <<
+/D [11876 0 R /XYZ 90 631.522 null]
+>> endobj
+11520 0 obj <<
+/D [11876 0 R /XYZ 90 596.853 null]
+>> endobj
+11882 0 obj <<
+/D [11876 0 R /XYZ 90 592.369 null]
+>> endobj
+11883 0 obj <<
+/D [11876 0 R /XYZ 90 519.506 null]
+>> endobj
+11521 0 obj <<
+/D [11876 0 R /XYZ 90 484.836 null]
+>> endobj
+11884 0 obj <<
+/D [11876 0 R /XYZ 90 480.353 null]
+>> endobj
+11885 0 obj <<
+/D [11876 0 R /XYZ 90 407.49 null]
+>> endobj
+11522 0 obj <<
+/D [11876 0 R /XYZ 90 372.82 null]
+>> endobj
+11886 0 obj <<
+/D [11876 0 R /XYZ 90 368.337 null]
+>> endobj
+11887 0 obj <<
+/D [11876 0 R /XYZ 90 295.474 null]
+>> endobj
+11523 0 obj <<
+/D [11876 0 R /XYZ 90 260.804 null]
+>> endobj
+11888 0 obj <<
+/D [11876 0 R /XYZ 90 256.321 null]
+>> endobj
+11889 0 obj <<
+/D [11876 0 R /XYZ 90 183.458 null]
+>> endobj
+11524 0 obj <<
+/D [11876 0 R /XYZ 90 148.025 null]
+>> endobj
+11890 0 obj <<
+/D [11876 0 R /XYZ 90 143.542 null]
+>> endobj
+11875 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11894 0 obj <<
+/Length 2440      
+/Filter /FlateDecode
+>>
+stream
+x��[Y���~�_����g�>֮<đS>b+��/�j
Kbw�� M�:���3�kH��0�J�E��ï���o N�������7��*�d$���Sbp��AB��&ɻ�z����>1��n��O���k�v������	� )���7���d��O0bF'ݢy�)��Y����7�ԥ�DT�K�QjhHKCm�<Q�!��W���q�,��|�ځ��%X;�c�U{�w�w-h�^�ai8b�=��� #�,�O�
i�ׂt�	Gv�Ye�S
�;���CE�Y��s����n�9
|Hg��C�25x�̳������
�̢
+�@ �mK�H��R�[�Rle���/�Ő���|8��Oֺ�oi{�8EL�*�~Ø�EJ�!��5��t�ׄ
+H�q�(�'^�s�g��X�:`��:��;@5�.=�*�)�j
�5����|���Y���N0�^���d!��Qs�"��ˢK0���W��d��#�1
�|9K���������v��~E �������2�ӹuՃ�@����?u �v�
���bVR�K�R���"}^�����K��4�#E�>3�]�+D%ۧ�݈Z����A�J���f���R�jU}�ס���»�A�V3�V��aH1��F"�U��x%�RA��ʿd
+8�'�
�p �Ȋ�*_wd4c�k^���V
+�J.�늱�g�Â
� -�+{��!�Vc��p�
�R4�݂(�q�Q顂Ȑ��D!2t�Y#�(�ОG�QX��BB��2.�����VkBcR��%�B@�ՠa,N�ҊSl�z&�,�#az�bO���
�EY��z����~Y&��
��-5�Agl�n��!nq�{�B¢&�E��� n�9
���&��=�����E+�Ʌ!&2�h��fR����b�Oֻ�_5��y at H(Z|��)$�����YfP
��i5$b���J���-�X2�
+��%���qaE(����H@ͭ9͖GTc��IFe:��
���ן�`�
dkW`v�[�����?t�1
��vIf����P� �����ms*�^G˻i>���em��M�_emY�3�D�-��vEٞVl^r ��l�#�_*iG8��AE�P���8�s.�v�����qH#[�"���%l�k�Ecs1-��ܖ�g����3��Q�k�BG*J��*��)�\�|��g@b��u�A�f���
+���*w3��M���M
������C��D�n
v�.�n
����A��nF����n2���,w���_p7 ��
�m��k
�dn�y��&q
B�������^@uL�� ^���ZK��E��"n��g���/���mg��?� �-Q��̃��1�4����|��A� �㷓����y�y~��~�J�ô�+
��R{���H�<�4�O�=
�A���p��b�����
�^Fț�2�>'���:������YdO��t<-
�6�Ӯ	
֛͡�.��� ! e];'��P�
	�LF�8+�7
�.C� �����B>r
�P��ؒ��N^u
MC]j9r�ih(u�؅�}|��w�	0
+}U�˄��(�&���Ճ���6�e�z�k/<�W���	g�8
����Kt����s�خek�Ի���RSo�O���pl�6��~K$	��
��� ҉��2
���F��RI�2W��8]�
�x)/ �V�|S�$>X��6��~�?_n�lr
+������^��!�t
��V��z����
���f���̎'
�]Y�v.��l���s��
+�
eׂ"T�y��I���AJ�MT*s_����j]�ղa��\T�Z�Y�����<�3�ڎls����ݯph`��}�>���!O��؈>�4h���3t%
+̃��ľ2Uу���`�L��`nkRs�a�Ff�
�Q��P:ۊ~�3��B�
�؈>� �cqC	X�M$M����鎤�"u M�|1���
+����w<@���C)6�%0��8�Gi�,$w
�a���
��T	�W
KmU"
���\���z���ڄ04�Q�y���,'Qkܹ����(��?�6
���pL��D�Qڐ����%�q"	��x��V��-S�
��~�����=֟F �M�����!x�#�����|O����4�_�Ҁ)^�ut�� �Ll���B�mh?;�f�w��\�W
�	�G�zh����3�$!��Wn$祲����8њ�>�]����P�|�f�{��Vhı�U<���H�&�@��N"β���ɋ�f�R��:�>;���HQv�P�o�($�k心(
-��?�����7n����/
 k�F�7j ��і�q_�d"�����͛��/�l�ǡ��^�-�7��_�� >�V̀��2mg��N ��m��,����Z�<ql�0���_�byw{��y^g�3�o����������:�����Q�9O-o�r'��?�֞
+endstream
+endobj
+11893 0 obj <<
+/Type /Page
+/Contents 11894 0 R
+/Resources 11892 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11860 0 R
+/Annots [ 11891 0 R ]
+>> endobj
+11891 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11895 0 obj <<
+/D [11893 0 R /XYZ 89 770.89 null]
+>> endobj
+11896 0 obj <<
+/D [11893 0 R /XYZ 90 718.682 null]
+>> endobj
+11589 0 obj <<
+/D [11893 0 R /XYZ 90 684.012 null]
+>> endobj
+11897 0 obj <<
+/D [11893 0 R /XYZ 90 679.529 null]
+>> endobj
+11898 0 obj <<
+/D [11893 0 R /XYZ 90 618.621 null]
+>> endobj
+11590 0 obj <<
+/D [11893 0 R /XYZ 90 583.951 null]
+>> endobj
+11899 0 obj <<
+/D [11893 0 R /XYZ 90 579.468 null]
+>> endobj
+11900 0 obj <<
+/D [11893 0 R /XYZ 90 506.605 null]
+>> endobj
+11591 0 obj <<
+/D [11893 0 R /XYZ 90 471.935 null]
+>> endobj
+11901 0 obj <<
+/D [11893 0 R /XYZ 90 467.452 null]
+>> endobj
+11902 0 obj <<
+/D [11893 0 R /XYZ 90 394.589 null]
+>> endobj
+11592 0 obj <<
+/D [11893 0 R /XYZ 90 359.919 null]
+>> endobj
+11903 0 obj <<
+/D [11893 0 R /XYZ 90 355.436 null]
+>> endobj
+11904 0 obj <<
+/D [11893 0 R /XYZ 90 272.75 null]
+>> endobj
+11905 0 obj <<
+/D [11893 0 R /XYZ 90 182 null]
+>> endobj
+11593 0 obj <<
+/D [11893 0 R /XYZ 211.842 82.124 null]
+>> endobj
+11906 0 obj <<
+/D [11893 0 R /XYZ 90 77.486 null]
+>> endobj
+11892 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11910 0 obj <<
+/Length 2876      
+/Filter /FlateDecode
+>>
+stream
+x��\Y���~�_��D<=}� �؋�ug=A
�ƀ#Q#&9�cm�ק��S�)�m�a�j^�U�_WW�GFTL
'��|�m~�|wu�J��AFR9�[N
�(n��p������]���͌�i��D�ofO���U��F����m��t{���>z��h}�v=ų�w?޼"�!�R��T�y.���#��
w
&���'�u��ͮ�� ��i�yZG�؝�9^����8��)f��2i�̫�wW�^�'ĹE �'��ջ�x���?�;�ѓ�M�	�
~ד�W��-�~6��τ 0�v3bp\�z_���~MQ�ȅ-�
+)������4�X�)�:�+$�:�h[[d�)oxȲ���qU��
+�#E�)3Z��W��Sj[?Tno7��d��gv
���
 n��t�����*�N+߼N�8�޿���P��%Y����`��kc#�{�w�	�9�`C�xF��
+�x�£
e��jd����/�y�{�
d
V�������
�����Hc��)2�T3 �|�7�9ҀL+��^I}�Z�q�E
eT�5A�d� ���\��h޶3�Yה1�
�l�ȗ�������A��zR��6�g[��$f��
�3U���0����9�Dsz0
*M���]��a~�χ�\�n^I�|�Z(
� ������a��<
1�0��oE jɤR9 Y�:��4J����O������B"Fj�1��0�=�U��Тܑ��f{׀�`��V�y�. ��#6��ZZt�
�E\X��f�����F���q��� �%��p�s��{^@��3t�w�a��W� ,�T
�g
�5}�*0˷��qG�ͨ�F�Cq1޼�~��BK��������$��}�qe�6�櫸�?���h[(1�6O�}�@-ȷS�g+
f�Aqh�V1 � V���g�tזx��M�v�I
+>�(y2
�Q�A
��W""�86�����xR�-֥j-�s�D�L� ��r���[ ��cDR8y�2-xi�j+sWB~��'�]�E���F�~����(^�3��_�|_���FA[��wv�W7����\��n�H�EH<����Y��9�3A�
�"�\Ab�0QUJt�����Ԥsz�9K~�-���APoE��[��рP
+.�AI
�!�
+	%�u�(UPZ
��e�x��Ҥ��"N�M�~.0���{�5��}Ն��Z����?fa�D`�Ŭ�<��790*C�t�*�T�DSC���C#�K�G��=���i�%E��w�э��@s�S��"�!�Z��&l9�Mw[�^d
+�0�΄�ۅl�{Ay���T⟫8O�d��E�"����<���PO?$뵻�?9� 3|L]�'K��z+$�.\��|�������*1��f}�����N�h˴;�ѠI0v�k+N$d�8^�wO���
˜�G8"��6��8��,`z��6�K�O�.9���pIp�y\���刐H�
���5D�����R�6�,{>�0�b4�6�Ȣ����$�q@{�N���cj�I���vŰ�c�R��C�Me� �N��^-awDY�һ�6���CZ-��-%EL��j/U����P)�`�쬬�, ��NR[߁����S
Ry	6;g�)N�<{f^ �9$�<X�T����+�BNOD�1H����*1zZ��ۂ-�g��瓜�o�ܪ�jϺ�m�J�/|%G�.62r��
�rPF�����m^w�ꎲ���(E��O}�ĺ����I\S�b��"8\��,q�V1�N
�����G$��y���E!���$e��tyV �E����]�Y�]�E�J#N���
f���5[��ͻe=�nM(�w������߅����w!��v�K�9��e�
���3xh�I��лL!L$��v�Bz��
+KQz���X|QC�HA��PF	 O�
��w��.՝���զ)G��w}>�H
+yD���.ʕ	Du5�Q�
B��V�˵���\�Ւ���D�:�WK�QTK��ŵ���nM5v��|��uFP��e[��0��QOU&@�L ?
�]lu�
+SU��B���h��
���^�5I���bZ��������i�0�Ʉ�Ā�����E�a��*(��8�װ��
���Zʌ�:]rp�)�=�W�:���} Ҧ��
Z��3�Y/Q
+��)�L!x�

c:/Tď�"��ή�:
I���
w�DH �D�$H��1a�d�!-k(
b:/����&g0���i�!�c"�b)�<�$,�2
���3�
Ҍ6��a<煺xyΖ.���#ĝb:
7� yƻ�I s��%���PE�=lh��J�!A�ɟAf>g���"TH��!����},g�x����<ϑ�#y����x���?b��D2���@������	���t�¡��?��tW�z�
�^�G�i�K�V�<��ԇF�6=
o���U�G
+/�A�B��^��!I�q�5�c�:�
8���H�G"AES̢WM�B�
[^���K�L�H&�����)����Qþ5��D�<� ԟ�
�idm� �¾ֈv�I�(3!ʒ�b�F��`�X���_�L�B��C��`���m;�$M�΂�ᴓ�1�G@
���
CT�O*9�y�o�t�
��#���c�˿���
}�F�Bc���0����_�#S�+�Rp~ȢDp���[��,(+k���|R�2U��צ*�'��h/vOk�4d�7��
�
+�5
K"h�8�g�Q���EqS�/�F�6�s�A�d�
�G�"�},��/�_��"������G.}��k�co?��f��F�!Z����7A�u� �@
�6�Cv=�ӷq\�,N�O��O��_�C 
��	W��������q�����Y^��p��W�%
6ٶ����ߛ�2���)i�
p�0����%Q��h���7?l��/8�
����x-
+endstream
+endobj
+11909 0 obj <<
+/Type /Page
+/Contents 11910 0 R
+/Resources 11908 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11860 0 R
+/Annots [ 11907 0 R ]
+>> endobj
+11907 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11911 0 obj <<
+/D [11909 0 R /XYZ 89 770.89 null]
+>> endobj
+11912 0 obj <<
+/D [11909 0 R /XYZ 90 634.093 null]
+>> endobj
+11913 0 obj <<
+/D [11909 0 R /XYZ 90 519.034 null]
+>> endobj
+11594 0 obj <<
+/D [11909 0 R /XYZ 192.853 454.785 null]
+>> endobj
+11914 0 obj <<
+/D [11909 0 R /XYZ 90 448.768 null]
+>> endobj
+11915 0 obj <<
+/D [11909 0 R /XYZ 90 367.616 null]
+>> endobj
+11916 0 obj <<
+/D [11909 0 R /XYZ 90 276.866 null]
+>> endobj
+11595 0 obj <<
+/D [11909 0 R /XYZ 211.842 212.616 null]
+>> endobj
+11917 0 obj <<
+/D [11909 0 R /XYZ 90 207.979 null]
+>> endobj
+11918 0 obj <<
+/D [11909 0 R /XYZ 90 113.492 null]
+>> endobj
+11908 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11924 0 obj <<
+/Length 3003      
+/Filter /FlateDecode
+>>
+stream
+x��[m�۸���ŸZ���̵�4
r�^��-�!Z[�+Ԗ6����_�!�wS�r�R,��ej�!��y�C���
��^������6�HK*g7w3�g�HH���}�� />�|?cR!�%<eo�~��͛o��oWon��\�	ψ P�f����Ox�����0bZ͞l��S�����?�p9�����o{�A
�qy
/�3�5"B�I��ih�k'M�֤ ��,���)����k;?�qt�H
+7/
���H�4
�#�y�K*�|
%�6N�"�܍��}U�8�c��m�ׯ
*��f}7�� �
\{�4�ӭ��
��D
+�i�D1Қ�HA�Rn
a�b�,��鲱ƒ��X�l�����1�<D\B+L�%֒�s	������M��ZV�p:Ϟ�a,�H���Z�C'��FU�
�
;N��t&�0�n��E��z�� ��%�%ć$�5,ⴼ��V�(Z�/�`�x�q?�F�3���>�������c'��4�|�6i��"׬���C��6ѱ��X
6�_
3��,�f��q���������=4:��]�a��D:.�T8[b-�:�T�&��Va�g�*DYIs����

^r7�}�{]
L��q�b��X��N���e:ǀ�D~�O$�I�"�s-��>�bQ	ɢ�ݸ!L��'�nq�b��U�,8�=����a�`��~����FaO1�ѰIu @��)c
�i�
�X�:��<d��秤��.�C{Ix�n,61ض����xU�*��Ҫ�S<���β�mư>9��2NV�����栟bԻ��F"���
�|��� yBA  %�zw�Y5�L�h)�j��
�<�>��2�|�!�Ӈ™_t���6�%kj͗�,ݖ����B��
O�
���
�C
eP��;��]�T}���/�%�~��ħ�FJ���
�䋀�Ŭ�#�-��G
��+�R��]���HS�K�gț�pW��Hw at J֕�#m/���q�\B�`�y �a)0f�ۄE����Ṡ^�?��.�q��ϏQn͘1��x� 
t=���(��ݦ馜��	�-kt�_�}������O�����15L����o�ظ�D�
^��ˢ/�(Y-���������%�b��Sx�
+�R��?�If��'j
�Ə{:^SC��1��U:��Hc�т��.q���h���f%^�ѝa���
��Qp`r�S<ܻ����+
+�U >r�G��(8X]{t�ɻ�Qp�Bp+��~��fM��VMf|
&Q� �ಥ�zPMr��򠞵�@d6
�U���LZ5���@T����Új
��\��
쮽^K�x� v�x	�
L/
�>�&?�(! 4ub�O6h羬|�C��v�l���s
+D�
�v\U?6��K^��8/ʇ��.�����:���Y��&�~
7��a$��CT�F
�ǀ�)6
YoMK
�
C���)p? �*�߉
+ ��>���@�tw���XJ��f�ÁP7�
e
H���SQf��ePD���@&�����
@��rKzr�6��@w8��lIs��2.Pp]�ppF�����p0�ݿ�`���2w]�����{wU���!�6��^��<��݌N����v��Wv" ��)��&��@&I�4;��-8�q������������ �.�s�Ѽ�m�@v����$h;G���9�
�r�p��4�k�<�
+wQ���!!�Qt
��g
�X����R
Q�r���
�w
�cU��Ήm�������q��5��ݗ����+&8ºv���,^wܵM�K3��<�Lɀ؏
��ʳ
Va�
B㼾����4�4Y�e�9���6l���4�S����ٛ�^ꉊ���	GLȞ�UP�p4~�og��	��
�]"-CK���Ѩm��H�,�4�Z�n\E2`����c�}���DB�0!�'hq
�#N�D�HC��1��*78.�]8?��#�	T��FY��>��h�#��$ u�I8;_�AX�&Şh�KtHSaI'ES��z5Ҏ��ċ��HF�#y�M�$�G`�4�v����P)9%I?_�i�p���b�Z8�
��o �Y ��)k�-���™�g9Y-|JE�ZxO�3k�mE�_
�k��/ذ1S\��~�Lo-�^�3��)�`A�L�:̹_MX�c7�z��(̌�����t����rj���X�~�,ےև%]Zi�����aJ�
+�B��nj�_�s�}UȺ����[=���&�
_׋�rz�� 4�0�<8�t����,#��V�'
�II�e%��T�)Rͪ�n����HSW
���zaV��-Y��TU�:�`���:�l&��G�m��=l��i�;��h|���!��B:����z�+�m��I���b!�HJ=E0�{]gx(�R�)�T��~�$w��0
��\�%���ɉ�`
�(�\`P
�e�›-vFQg�
G�v���m���^7ah4�;��+
"��S1s���R?�WV
l�ԏH���N%�Ӌ�vD�fSJN߶��Z�y��qt�G�	t��oB=����h��
+���:zv�>�괯�8�!�#�
���A�S���Fh���Q� �E/��м���{ؖP�>6u�+��@O��-5Gx����tU�V�;,gn�w����c�Q����s�V��.�C��y92q=q�. $�q����Kd��X#
&\T[�u�#�e�h���
=Ej*(�
������vl���N�Cَ:&�f)�]��%َ2�ؒ�
+w�6���w�Ѓ�Βr�6y�6������:+ mT
J�m�U�y#C���=;�}��81�l>�&HD
+��@�T�Ӻ�7�NGXɾ"]�����Ej��h 1��
l�
�2}� j�I� �~
+�?�k�c�Ly��-��5a��%�[6�P�Gn-u�kZu�e�>��.��G��B����G���6v��cd�a-��c)�Jd%�_G�7���C��{w�5&p���CQ<�z��vw�G�=�����as���5��mӬ~gnn�;�{
�_�٥k
+endstream
+endobj
+11923 0 obj <<
+/Type /Page
+/Contents 11924 0 R
+/Resources 11922 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11860 0 R
+/Annots [ 11919 0 R 11920 0 R 11921 0 R ]
+>> endobj
+11919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.931 422.127 186.185 434.461]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+11920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.668 422.127 272.341 434.461]
+/A << /S /GoTo /D (index_Grid_Frequency) >>
+>> endobj
+11921 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11925 0 obj <<
+/D [11923 0 R /XYZ 89 770.89 null]
+>> endobj
+11926 0 obj <<
+/D [11923 0 R /XYZ 90 633.112 null]
+>> endobj
+11596 0 obj <<
+/D [11923 0 R /XYZ 192.853 568.863 null]
+>> endobj
+11927 0 obj <<
+/D [11923 0 R /XYZ 90 562.845 null]
+>> endobj
+11928 0 obj <<
+/D [11923 0 R /XYZ 90 471.741 null]
+>> endobj
+11929 0 obj <<
+/D [11923 0 R /XYZ 90 356.682 null]
+>> endobj
+11597 0 obj <<
+/D [11923 0 R /XYZ 439.299 304.388 null]
+>> endobj
+11930 0 obj <<
+/D [11923 0 R /XYZ 90 298.37 null]
+>> endobj
+11931 0 obj <<
+/D [11923 0 R /XYZ 90 229.174 null]
+>> endobj
+11932 0 obj <<
+/D [11923 0 R /XYZ 90 175.485 null]
+>> endobj
+11598 0 obj <<
+/D [11923 0 R /XYZ 90 133.657 null]
+>> endobj
+11933 0 obj <<
+/D [11923 0 R /XYZ 90 129.173 null]
+>> endobj
+11922 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11937 0 obj <<
+/Length 2182      
+/Filter /FlateDecode
+>>
+stream
+x��Zێ��}�W�)�����A` q� �
�=
+�^
8"G""QZ�ڍ��ռ��H�����/C�<]�U}�N���t�����瓇os
2�Jg���(n����w	F
+Ogc쾛�z��{~7��ݮ������×؋��?.Ro�����������
�%�O�AR*�<C�kޤa�Hy�`ށaa�l��9���^�LgT` 3�
6�������� ���
1Ä����o擏0�!������L�����s0bF;��F�S׵�4�i�����
+{k/ż����AsG�
�-�I�0��&H���M2�N�;{8}����NF�58exdu��������H#��bZd�h����!�� C1†��(�o�����N3$��!%2T5͘���\l�$��0J��MW^��}����h��~��"�c ����
�A�#^��$��r���7�_�4�i^h,))82j���e�S2:d��FZ��p��J��J�Jڈ��b��pD!�r�8p^��&�3@�q�r�$���FS��O�:�xʔ��o�(
z�9Ҁ3�8a4<�=P�8"����X�	�1��*�N�p?G��)u��<���
q2e~�cV�@Qo��&e�t&y��@�ʤ^�w� eȲŢ
�K�|��An��gXJ�0Zl7;/
_��_�K�n㮎��%}�/Y�
�1vL�
={a5Ҵ�;3�9b�:��ъ���*\�r�

n���n�6�z}��M���6N���CI�����_��:=G�̀1w��~r D�q	�
�a�ta4@�Z��DRQj�e�vZ�i
+�H��l�+�xH�aDPC���'�F��VA� ���˶��Uy’�j8_+�5Ccɺ6C�B�%�չ�x|���r��
+�)k���"�`lR�S��ԻL�I���8X@LJŔw
t�����p���#M����/X�����!
+Q}��tH <;fZ3$����W�ޤA`I��-�>�� ]dI=J��a���C�jiQ�H�},�.*���~�"������#��&Ϋ&��O��bι�=}o���02F���h��5_��Z.�Q��u
6����`@���Xm���U��b(Xը�MP	�]#��4�S�5��l�!^�C�U�:��f%��ѣ|�
��
R��վ���Z��?,���۽�� ����\�nnF�N�r-�oF�����[4�fF&\�Q��
�V��h2u�q�2�5��djc��Է����!So��~v D2�x=�܁y%
S��*��;e��8
+�e'�c	������n#�G{�%�~��{�:%n��k�Yx�ӗ⻍�W]�����g�p��ʌ���8�/A����E��7�i�LA^�2�}\|h#5��2;l�O��Y��A��f�'�kPF��"��S�ñl*�	�]œrV����[

wo-@{,�l-`�.�Z�H
���j]wo-
��][
P�@�dB!"�][
P^(� J
��L��>?³�Ȅ��
��l�d*{[
�����c�X"����eה�lV�-�{5�͹�{�${�n %�$'�r\5�N�q�B��㭃����_�����E#�.�x*��[�:gHb���:5I#F
�#f�5�%!�HZݞ��֥���sZ�>+:�zÊyG<�����&�;s�v��
+$�d
6�P�L�
�l|�|!���#
+��
B���3=�P
q��Pm
�6��g]�2�z���U]�2鹔����Y���XJS2��`Q�Ю�W�2.���ɶ��vV�,d�<�eegV�3�2	�(�~
-zs���=i�7wa�=2%� NۺƼ�)�=2=�
��
OL����h[��Q���5�#S{�h�"���ȔAM�p�8��������MV�j|zxY 

^�L�]~x��<��ҏ����Q(!�%��ɉ�
h謅�X���e箍B��[�.��Bb�؊Y�+����@��	
I
�l��	��{��
�ӎN=԰c���
�ۍ��2T
��1��f��������.�ix�
������zE��������� ��T���^���_ ۤ����q��ۇ�]
h��ő�S�:7�Ny��IFAGs\W�`���LJ���2	�%�Z�kc)xL�v�����A�z�p�Ye�ʜZE&�OΊـ	�>�D)����g/����0�[���~�� I
+endstream
+endobj
+11936 0 obj <<
+/Type /Page
+/Contents 11937 0 R
+/Resources 11935 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11949 0 R
+/Annots [ 11934 0 R ]
+>> endobj
+11934 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11938 0 obj <<
+/D [11936 0 R /XYZ 89 770.89 null]
+>> endobj
+11939 0 obj <<
+/D [11936 0 R /XYZ 90 720.814 null]
+>> endobj
+11940 0 obj <<
+/D [11936 0 R /XYZ 90 667.125 null]
+>> endobj
+11599 0 obj <<
+/D [11936 0 R /XYZ 90 620.5 null]
+>> endobj
+11941 0 obj <<
+/D [11936 0 R /XYZ 90 616.017 null]
+>> endobj
+11942 0 obj <<
+/D [11936 0 R /XYZ 90 545.286 null]
+>> endobj
+11943 0 obj <<
+/D [11936 0 R /XYZ 90 491.597 null]
+>> endobj
+11600 0 obj <<
+/D [11936 0 R /XYZ 90 376.906 null]
+>> endobj
+11944 0 obj <<
+/D [11936 0 R /XYZ 90 372.423 null]
+>> endobj
+11945 0 obj <<
+/D [11936 0 R /XYZ 90 303.849 null]
+>> endobj
+11946 0 obj <<
+/D [11936 0 R /XYZ 90 250.16 null]
+>> endobj
+11601 0 obj <<
+/D [11936 0 R /XYZ 90 203.535 null]
+>> endobj
+11947 0 obj <<
+/D [11936 0 R /XYZ 90 199.052 null]
+>> endobj
+11948 0 obj <<
+/D [11936 0 R /XYZ 90 128.321 null]
+>> endobj
+11935 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11953 0 obj <<
+/Length 2264      
+/Filter /FlateDecode
+>>
+stream
+x��[K����ϯ�)��UO��`������
��
����8"%��'��S�MR�D�[�=�bj��ꪮ��+�8�E8���_�w�?(d$���928R� !�i�i�
~
�1�1�r��>�2~����޻{?��zG��� ���dq��3��0�S�3:zu��
�����w�ҥ�"*�O{�44���6c
)�«����dU�ˬp
+��Y¯`�Q
K$�:��� �kAK�e�3L$5E�
�i
Q�`��R	\ɶD�XK�'
Q�d/#O����r
!aR��1�><�ِ���x�N������l�H��{k�7(��b�L0��n��GD�vJܲ�b� ��f�_�吊�k6
1l鳵����ΐ�>C�b��$%ړ�Ѵ�S�����U@"c�Iq6�C�.�ܜɬWA��FN�x�)8���4J��r����i�|7),��(�f�6Yfe�‰uK�p!��\�Q	�Gd4"Q��,_'���^_�ɋ�	��ٲ�?��
�|���,֫�2/����._*Q
�u�\�J�pX
+f�W���y�J���=W�<���tx�p�C0R a8"��&��<.
���)"�Ա�'?�#]!ś�-�VI/����{r�8n���
��
Ӫ��mhc9�ON��.u&e<[f����K��Eq��9dKw�>����َf��C<
��t��2��6���~08)$�8}׽L�!u|�'X�m2$b0Oz�D���!���|�Q 2D�
+
�b�{�8�� 
E�'�
+(�k����V@|��4 
��C�,ݞ���$���5xt���˚Q���4��Y�a�R�(�V\�yp���O�y:�`��);�!%O);�x�ᘴxQ�/�j���:�5��'���^+�M�]����0 at MZ
�)P�
klC]���_[����P.���ȏ6)�9$�2ɇ�
�����L�9��F�����KtS�&	eίq=�C��n%����[E$����Ƌ�Y����ť䭸��)��sA
קjn<�:8�z
�.	��aM���`}*~��(i0��#�
�X6io���.�C��ᙡH��:��p
<���
�?�A";,��u��󈬰B(
Nd��yP0y�.�p��D�%�
+"+ �q����f�[�^�d;v���ޔʊ�!��8.�f
++Q14�\#��-6T�{��CF!��4��&�m����:F�J
a(3XfΏJ�X/\��w�!�ĥ�cg~�S��"�&~d��a�����p�A׫z�^a@} �(���J��/���_����'�:��t1km�
��
C�Y 8��
E����=M�T,�p��6`������@#��䖍a�5"�f�T�؈`"t#�
iD�M�=��'��i��" u2b"f$RB]׊�<l׊�"k�i�������X���Ⱥ�nX��~	����Nd���|�����6��9��#2�7h@ _��V5 ����f�q��W�W%���
���`�I��5���溫�`�6ܭ���>A��u�q��D��x(ao�F8Bwz˂	��#�6=
� Z�
+H��Ktd�ٴ��a0S���M
���F��\f�D汖ŕJ��,:Z�[ʹ*���?Vў�{e|�4|�}�5�WS��%�Y��O���o����e�|
ċ%��+�
�ÿ��J!�uP�}��xR)삀�K�["�d�r2ۧ�v7������l�Қ�����
m�}w�{�>�H��A�l�80�����a����2�	����@$a�qW�<�r�2�����7�Tl�"����DN�UhNE�1N�Cq*a?9V����Q*[�t���(�pU+��
k���U;�] *J��aJE���r�g��)��y���j��n@���bN\J�:Vo�*᫷���K�8�7�U˾�B �T��r1����@�߆MA��� 6�D׈P?L6�m)�2�'�
���ԕj���ݏ��S��5 ��m(� (��|+���d!�����S��H�w��A`��@�?��~��Nm$^æ�.U0:�ΚMu
��Lu��������2�M_�@�P]���	$Jآ�g��}H��)�m߱S�_D��'�6�+���R��l�v7�g���,���mč@�h#�k Rr_
!�
��Ǐ�� 8��8bP��ٺ�|���
����7a� ��m1sUW��J�^��4��|炶��}���,W��O�Y�d3����7�����j�B�e
�i��ؖ�����Zp��
+endstream
+endobj
+11952 0 obj <<
+/Type /Page
+/Contents 11953 0 R
+/Resources 11951 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11949 0 R
+/Annots [ 11950 0 R ]
+>> endobj
+11950 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11954 0 obj <<
+/D [11952 0 R /XYZ 89 770.89 null]
+>> endobj
+11955 0 obj <<
+/D [11952 0 R /XYZ 90 718.682 null]
+>> endobj
+11602 0 obj <<
+/D [11952 0 R /XYZ 90 672.057 null]
+>> endobj
+11956 0 obj <<
+/D [11952 0 R /XYZ 90 667.574 null]
+>> endobj
+11957 0 obj <<
+/D [11952 0 R /XYZ 90 596.843 null]
+>> endobj
+11958 0 obj <<
+/D [11952 0 R /XYZ 90 531.198 null]
+>> endobj
+11665 0 obj <<
+/D [11952 0 R /XYZ 90 416.508 null]
+>> endobj
+11959 0 obj <<
+/D [11952 0 R /XYZ 90 412.025 null]
+>> endobj
+11960 0 obj <<
+/D [11952 0 R /XYZ 90 343.451 null]
+>> endobj
+11961 0 obj <<
+/D [11952 0 R /XYZ 90 289.762 null]
+>> endobj
+11666 0 obj <<
+/D [11952 0 R /XYZ 90 255.092 null]
+>> endobj
+11962 0 obj <<
+/D [11952 0 R /XYZ 90 250.609 null]
+>> endobj
+11963 0 obj <<
+/D [11952 0 R /XYZ 90 179.878 null]
+>> endobj
+11964 0 obj <<
+/D [11952 0 R /XYZ 90 126.189 null]
+>> endobj
+11667 0 obj <<
+/D [11952 0 R /XYZ 90 81.969 null]
+>> endobj
+11965 0 obj <<
+/D [11952 0 R /XYZ 90 77.486 null]
+>> endobj
+11951 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11969 0 obj <<
+/Length 2629      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸~���S+ͬ`\	��ٙv���6���)�xh��9�H������  )��E���>����s�)���mf�\�q��-\�v{u�F��F:����a��Lr�D �ֳ�s��ċ%���-���.�{��x�n��u޽��0{�����7in��?��h�����7�4�S�QH��R��[�q ;R^-��a�Z�����a�/�T` ��<��a��ߢ�([5��
1�ĜIfh^�|{�� <#N,I5[�>~Ƴ5
�
+�dZ;�E��
������\aO�V��L��
Č���uQ�y|~E��%B��D��jA񼏒pgO,:����$�4UA����y��D�ֵr��Ar$�
:��ZكD��!�8�=nn���4����T����aX��"�t��c�2����oq�x�'ǰ'�SlʱBZ3o�U��E�I�;������Mu�pI�9	fK���(��&t��9���b(����T�J5���V
Vy��
�Z��-)Y�E�m�D��p��v�&��C�@�g���l���Gel�e��M�{v��w-
�jړ&��Iw� �x��
?�#�k�*RG�6M��	��)�|����#'�;
��A��<k)c�q�Fk�sP�t
���?�Լ4
bb
+0
J}�3�%� Z&.�y�Sl_;��a�M��v0 �+���y����RDD�Y��
 �Pų�M}�.<p��4���I�<ig��H@���
�� i*}6n�=���+/�/�>��A����m��cXR�ry���S/�7I���$@���[��:��&Ϧ��`��d9�]Bk�Y��?_E�"�
��	^*4��a�m��N��$��
+�A��@�J�$�s
�v
2Ţ"�E��ao'af�0�v�ɋ��
�,��_�m��
�����.J�a���#U�'�� -�>*c
t$���� 
���'�}���oI��
i�S�rB$cY0@
׋�d�UHI�����K�ԓ�G-�d���a�o��0�4
����!���~y	�Q�%8�&[X��&��ka5���X��k�1�uعj�@�A-u�4M�b$
.�Z
+�}
�a-��N�bW�� ���B�ɞL/!w���rlaq
�JB`K#"F��A]�M'܂c�6� Q
�6�D5����z�}+�#~�����S�sQd
���wBQ
�#�SV��S����9��`
DA�.D
������N��@�
3����Üu�ޗs%����u�r�Q���"0�@�4=D_���,��Q� ����K ����.!A�rJ{=���w�`qt�褕�+�tN
 �7�_
+�$/�X���
bMy�
+b��z&��N���X�%�c���~/�t�uӋ=����I�(�|�%^�}��X��1������LK���y�%1��R�#��
(�m��Fv��`��HA0���K�`�N;NF$b/�|�~\
!�%3��6n�����

���K�A$�BXoH�
`R�R1>ɮڼ
+e�������})h� �	���5�����]�Μ ����
ոip{;Á]1j (�A��� )� ��J���m�Z�E�b�#L�L�@��
�mW��|L�O4H�.1��
p<�p�
t��@C9��p�!�
���O��7��X� �Y��~=?t	L7�q��r�VO���U�yuJ�a�qP���C_�a�Q�zߐ���
���G�q���鍬,�<]d�}#wj/�A�
�?����b��wdn*m�M��^���zGf`�w�,�S�`��6����3�|�j~GFc��Y��wC�ϝ-8p�÷7�ϺN���	S�Ajɉ��C|�mh�?TEJ��U�_^�v����
FC|�n��-��@
hb�f�@`=` \�7o���u�.㣳��a�aL�Z�y�~>��w�7�(�Մ�p��)[��I�)�A�U0�O���}�������̔k�Y��H�۹"
X��!E�C��2�A�8OKp��,,�l!ļ���ۭ�̎���*�
�qL�Y�Q���ׇ���'� [...]
+LU�^�����\�H��4q>�T��^W��a`��00U:
�y�+��)�a`�t��K2�.
�h��j{L����s��o�P�)Φ�)���M1FR��[�D3�&�l��MG�"Aٔ-��KZ�DA���d-�)OZ��[G=��흴����^
�P��M�!ͺJj��$3P�Z$��ˇ��n��2��t�L���һ������@�>�ߟO��ހ�6'��p�9���S�2����F�
3#vr�}^��5\n��]�mExxܼ�5�]����6t�ʶ�=`׹T��p%&AV�<<-�lj�m�5t��>F�U�6`���}���,�VŶ�>$���{�s���	F�B���
OyK��
�^�>��ϱ	������
2
}sN����?U��#���wme���w�޺�y��ٔ;U�&O՗-&"9Ƴ<�J$�vP�2����GQ��
���Uw���b<�C̿DT�oy,�������&��
�9�4�E��;:Pa:�vi�-vb�Nk��j�Q���
� )�]Ѽ��Ճ���/;6�{
+Bn�O�o�� 
+endstream
+endobj
+11968 0 obj <<
+/Type /Page
+/Contents 11969 0 R
+/Resources 11967 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11949 0 R
+/Annots [ 11966 0 R ]
+>> endobj
+11966 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11970 0 obj <<
+/D [11968 0 R /XYZ 89 770.89 null]
+>> endobj
+11971 0 obj <<
+/D [11968 0 R /XYZ 90 658.004 null]
+>> endobj
+11972 0 obj <<
+/D [11968 0 R /XYZ 90 604.315 null]
+>> endobj
+11668 0 obj <<
+/D [11968 0 R /XYZ 90 569.645 null]
+>> endobj
+11973 0 obj <<
+/D [11968 0 R /XYZ 90 565.161 null]
+>> endobj
+11974 0 obj <<
+/D [11968 0 R /XYZ 90 494.431 null]
+>> endobj
+11975 0 obj <<
+/D [11968 0 R /XYZ 90 428.786 null]
+>> endobj
+11669 0 obj <<
+/D [11968 0 R /XYZ 90 394.116 null]
+>> endobj
+11976 0 obj <<
+/D [11968 0 R /XYZ 90 389.633 null]
+>> endobj
+11977 0 obj <<
+/D [11968 0 R /XYZ 90 295.615 null]
+>> endobj
+11978 0 obj <<
+/D [11968 0 R /XYZ 90 205.662 null]
+>> endobj
+11670 0 obj <<
+/D [11968 0 R /XYZ 406.869 84.126 null]
+>> endobj
+11979 0 obj <<
+/D [11968 0 R /XYZ 90 77.486 null]
+>> endobj
+11967 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+11986 0 obj <<
+/Length 2981      
+/Filter /FlateDecode
+>>
+stream
+x��[[�۶~�_��V����_<�δ��q�&nVɋ��p%�.[��)����@��ԕ�L�H���9��
@Q1�a{����p������b#���r4�<R� !��b�~��|�}7bR#b$|冿����f7�����է+��x)=������
3�G_�K��
����տ�p���Ȑ
�A���	F
+�!*'S�1
W�j�L�Բr��t?�E�����+��n^���i���ɔ
+2�ErP��s� �G�VM{xc
	��f⼽ͫ��L���q�|�

Q��Vu
�}�A��f�
��	�4��*�����ED0�;EG�'���l�_
���o^�q^%�E�,?�<$�NG��}:uS���OX�r4q��b���ս]�4O�d����/�/
1
+q�Q��v��P��ԑ"
�e�+�4O��L)C���L%���3ɪ�Ȭ
<��Af�0+1��,O�22/�+I� �*�$ޑ�[���l����/��0��,���&V=�P ƿb�'SA�x^�*�E
+ܗl��{���o&t+��p`,v�(�K�l]�#�m0�u0�
v
"=�-��D��7.�L3��W�x8 �� �I
☋ ��?w��Q�O�6��*�h��I�]�?4�t7���o��L�ob�3Hռ�g��9�����.�PV�!Y[�S���"��
Ή@B�S\������C���
�9�*�R(5�"�x�-�1�J ƶ���r�0�0�z[�@�!5�+6A���}��X���KS^^����6�#�PL)fX7l�������q�������'_��צ�?���I�W��
O+��=��_G�DB9�J�YD*��5��!��w9(X��z���N��2���v���t����
�>�t�42���{
�G"��:Bl�	G�>�gT1��^lÖ�:<����@J�rд�z[�.
Q�%{S��m����u:��RZmف~m
3�
�-�]
�ǎL)�܌
+7�����W�jq��xܽF�W��?��va������q�D
$!���<1#�A�j/U<���
����uQ�7�x1A���
��E$��
�
�����9�V��2.��;�@��C�G2��>�ܚ,7��+��Cx
+�{4�ɺ�a
���")����zH�'Y=�����rܐ���#� Y���b�қ�݊5 ��('PC"���_���YR��U��΋�Ίc]r��y3�ϟof���>�DHh��	��_�^�%Ĉ�\fp��e$AB�A\����O(9U���>s#Q�	�5�j��o
���܏�:
<�
������I��0�vx��d�oӦf�7�T�G
s�r��7Pd ��)z���?�/y�z�]���P��i��05�V��2v��eg��H:�V�f�i�$�O�Tc9�b��z�4�+��:���tmuz�r;�FXAzP{�w�t}�N���\�@���a�d����Cҍ��)
�2
��wD��Y2R�񫳩�^e�����d�->&�5�WE�>�
i���
���2�� �G�^A�MY(��,l��R;wv��)y	C�qL:�
e
0q���)HС�^�����g��.GV��VMxz�7��Mao��B(���]b��>jI��$O�����^30Us��FQݽ����G?ŢD��YQз��DJ�N�(�
+��cZ�n�G���M!�`j��`�U����a�r�o���I���׳���J�,H�3i
+
0��M��
+ZrB �Y�z�`>�{��^��W3����v�=��n*ۃH�pj]�U�~^��*���&�bq�ҵ��{
7u&�w;�U3��S�k@#;쐔���6����@]�U��ƦʴNe�Ϋ�S=�^���l�Y�oj�?-M&�"FI"��H��:�G۰�2�n"���槽-F	�oT�W;�
�K
r�:~�����6�1=f�^#�������{����x�ٵokz�^#n?��( jݚ�/C�d��>�}��uO8X��#��jw��w���q2�?�|�r
`��e�D�򒻁,4z�^�[�|Zf��t
���i�7��h%�d�JN!�6��vL[;S-Nᯛu2�

���3�# �۞��(=��
+�:;

�=��t��
S�Ɔ��e��s�L������]Zᒳv+|�>u�o�[���
�708EW
��=
+�aI
���V�@L��u�.�#�A
+��v�j�	��n���5�̦-�	�G6'ϗ�����z�T�:��i
'�rAo8A��~X��4��QC&fȆS��%
'
+P[b1X�iHI��#�1��
�O�#�w/@�<���;�k��%:
{
�����z	Ƀ笩�O��/	A� �*���#!��CCa�c��� ���K�{�O
d8����Ǜ���)��Z��
>�2������m�
��M�P�hE��0,L�>ֽ�P��D0�T���j�a�F��<���n���"�F,w�I�IÝ{�	�0�
���Q��
�O�ñ�ۗ!]t�Q�_p���b5�qb
�@&�ҼP3�(�l����t�戱!�����/����@[�
�
���A%M[��y?ܹ��(�	�i�NZ�g2~+�s������u͆4��)��l����7�	�<Ƈm� M�X"���uz�O�b�xG�ɷɽ���l�ώ�
��3}�bȇ�-�	��8�*
<���
�����"��\����!x�Hv�ۍ� K���P�l<}�jS����� n��_'�ʅ�
�:���X�T�
	�ζ�~����aC�%4cGx>��`��q��5��0Nw�`
L���a��=l���߮��ok�M�޴%ظ���ܧ_���ͤa�}��{��&-�h�J6��1�s��7~��l�1Ad]��"��t�Mژ���?[��q�̲�`U����CU�_]_�>�o��
��=%��RV��wW���U��If�=��`FlK��ס��
+endstream
+endobj
+11985 0 obj <<
+/Type /Page
+/Contents 11986 0 R
+/Resources 11984 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11949 0 R
+/Annots [ 11980 0 R 11981 0 R 11982 0 R 11983 0 R ]
+>> endobj
+11980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 395.86 212.124 406.764]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+11981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 222.334 210.103 233.238]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+11982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 118.926 485.603 131.444]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+11983 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+11987 0 obj <<
+/D [11985 0 R /XYZ 89 770.89 null]
+>> endobj
+11988 0 obj <<
+/D [11985 0 R /XYZ 90 622.138 null]
+>> endobj
+11989 0 obj <<
+/D [11985 0 R /XYZ 90 519.831 null]
+>> endobj
+11671 0 obj <<
+/D [11985 0 R /XYZ 406.869 443.228 null]
+>> endobj
+11990 0 obj <<
+/D [11985 0 R /XYZ 90 436.588 null]
+>> endobj
+11991 0 obj <<
+/D [11985 0 R /XYZ 90 370.017 null]
+>> endobj
+11992 0 obj <<
+/D [11985 0 R /XYZ 90 316.328 null]
+>> endobj
+11672 0 obj <<
+/D [11985 0 R /XYZ 90 281.658 null]
+>> endobj
+11993 0 obj <<
+/D [11985 0 R /XYZ 90 277.174 null]
+>> endobj
+11994 0 obj <<
+/D [11985 0 R /XYZ 90 196.491 null]
+>> endobj
+11995 0 obj <<
+/D [11985 0 R /XYZ 90 142.802 null]
+>> endobj
+11673 0 obj <<
+/D [11985 0 R /XYZ 90 81.969 null]
+>> endobj
+11996 0 obj <<
+/D [11985 0 R /XYZ 90 77.486 null]
+>> endobj
+11984 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12002 0 obj <<
+/Length 2486      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�~ϯ�Sk5��eZ�;����t'}�t0P�1jK^I�˿�!)J�l�I�A�e�:���
�ˆ��r���w�^��7W���d$�������		�n'�#�gs�1���<M�M����i��z����W�ER|}�ꗛ*Y�Y����.٦�W?\�&�C�R��T��Q���� 8R
&\
�aa"L��)
+]'e9�S�����t�]'U�G~Mi1#z�f70�
S���y����o��	�jH������<���@����g7i3���z���8ҷӳ!==�@�V͈!jj]Wa���k��"=F�R\�	��m�%+�T�5��4��q���4�|��n�� Jü��8R�
�q>�
+I����*�a���*���ɴLo�U��ۚ[c(��ð9fq��6�����	CJ�����e��o, �x�M����Ω�h5�	#Ĩ���f�d'����@Aw]�,��a-��q�����]]��u�)� ����8}�!^�	��
+
Q�Z.�Պ�I`�F��nU�9��D
�vR�E�Kwr#���2�$�>� ZE��
�C$�J�4QȴP��8w�,6�X F5\H����r�n��eLi�y�~?�J1C��D�*�n���OMc&���
�
�}��d	|�>I{_��'�X"E:Yt����u2B(�̒��y�Y��nm�q<���W��b��t�ۤY�
6d�9Ҙ�*�� 
��'*c
҅:&j
�
�%��+���u �"��I�l"��l�uR�I�v�)!���&�l�ju�N�qk	f@�s�r8��$��;jX�C�$��
G�~R�ņ ;YJ���XD��k� ���k�����UL+{��B
;W1
�F�&��w>�pN p��r�DX̵�s,�9zι//p��¹r���)��}��]����
�VɪYb�
�]��1M�/~|�
���#S�
+���B��p��
����, at O@��BiZp5&.�<
+�al4\8���D}$.�$}��>�Z�!$�];��I\�-Q��
�S�B6�
a�:��'����aH(Z 7�8�9������,B�:jd CD�
D�
B��������ֈp�-g�02
+[.�5|}N���Z-��q�b���I���T��= �R`�ϼ��A��f1�3n<��>vܥ�gwyJ��z
`
���1P�����e 2��0�ǭ�#cp�?�wŧ�ʎ��w<i-�A�O���c�i+�z��U�KO*,�R�ծ YjQs0i�yU���-�QL�q�H��!v
��2]vv�@I�r��CvHL1:*6x��3��8�|�C�
�P�
��)i��=Q	�#I_ ��쏷�`Y�6��g��wKO�dS�"�H�ZO�Gl!�]'��n{����.͋t�Hĺ�/>'Ų^���]L޻��������e�v�X�u	W���>eOA�PO!�ɞ�ݣ��r잂�x�O}���l��[
��!��Շ�g�ƞ�p�����@C�!E�W#p����l�.�
�-�Kx�v���
�G� �i�=��h�"f
�ZB��Yv�0��� )q���
u9N���
+I�Wc at UP���b��o<
�C�5��n���
<���/��7%�n�,��U��[%I�l��
�푧A�@�Q� M�� �]x�W���^Ɏ���^�)�P�d`uL��Z1�=�ԧZ��P%�.I! O�J����S� �=M�)Q��aĘ�R��9����5s�NiLIC�����R$�K��:��[k8���:N��ay�{>��P�1�bꡒ��Ϲ�?���
C44/�������B�̡�&U^�=X������

�d�1Y����|�f�����*:��M
+hp�P�#����àa�j�D��#~�Y{x���eZ
u�TI=�-��U"����

����
������>[<��/��i����NX�e=5��
J��>��ʖ�;�ѣ�,��nssan�خt�:�
�z#�G�l;��c�>��������O\�x��n{��~[��ݺ�SBf�Ӹ��k��4˫�%�@ѦO;l��I���8&�*����D��
O�zZU� T�t�����MR{�ͮ
+! �:6���H�����c��;�G�$����TlQ֞I ���!��Q�K��l���
�=�~��Cg�ҧ^~h�ܝx��=�4��������?��]-3͔{�e����%�2ig睖��u�
�0��r�9-����rR#����½���y��˽m��r�
us[�V�-,VX��8|H�F����剽�(�"��kc�k`e��+
+	���������eZ�~&Ĵ����l*�
1 �(�J@����l���wi��~������_8ݴ�!���fY-�]Um_]^^�e�-`�}��
�v� #7yѼI�W�PHN
��I{j�k�TL��4��ε�1�X\�ٰ��rPr
��
�?)�
+endstream
+endobj
+12001 0 obj <<
+/Type /Page
+/Contents 12002 0 R
+/Resources 12000 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11949 0 R
+/Annots [ 11997 0 R 11998 0 R 11999 0 R ]
+>> endobj
+11997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.54 366.439 309.037 377.343]
+/A << /S /GoTo /D (index_BHZ09b) >>
+>> endobj
+11998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.54 138.188 309.037 149.092]
+/A << /S /GoTo /D (index_BHZ09b) >>
+>> endobj
+11999 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12003 0 obj <<
+/D [12001 0 R /XYZ 89 770.89 null]
+>> endobj
+12004 0 obj <<
+/D [12001 0 R /XYZ 90 655.872 null]
+>> endobj
+11674 0 obj <<
+/D [12001 0 R /XYZ 90 621.202 null]
+>> endobj
+12005 0 obj <<
+/D [12001 0 R /XYZ 90 616.718 null]
+>> endobj
+12006 0 obj <<
+/D [12001 0 R /XYZ 90 543.856 null]
+>> endobj
+11675 0 obj <<
+/D [12001 0 R /XYZ 90 509.186 null]
+>> endobj
+12007 0 obj <<
+/D [12001 0 R /XYZ 90 504.702 null]
+>> endobj
+12008 0 obj <<
+/D [12001 0 R /XYZ 90 421.887 null]
+>> endobj
+11676 0 obj <<
+/D [12001 0 R /XYZ 313.62 369.592 null]
+>> endobj
+12009 0 obj <<
+/D [12001 0 R /XYZ 90 362.952 null]
+>> endobj
+12010 0 obj <<
+/D [12001 0 R /XYZ 90 282.293 null]
+>> endobj
+11677 0 obj <<
+/D [12001 0 R /XYZ 313.62 141.341 null]
+>> endobj
+12011 0 obj <<
+/D [12001 0 R /XYZ 90 134.701 null]
+>> endobj
+12000 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12019 0 obj <<
+/Length 3070      
+/Filter /FlateDecode
+>>
+stream
+x��[Y��~�_����V�ݳH8�l�ql'Z�E6�9�
������6�>��
=l
K�"A @\�Q]w}U�ē�	�|{�绛��(6IP"��ܭ&	�(� !��r�~ʔ��z�݄I�H"�-{���{���;s�����o7n�	qRz��ܼ�O�p��	F,ѓ���̈́S��ɻ���`�K���0��aBz
�a�'�0��p���ȶu^;��
ɽ%�
+f�=�D����[�}	zd_�&#�Ȅ#�;B�&(b@��'�4��H��#
+Z�D�l��Qq��=�Bf���k�8�zy{�3����u���V3���������كbFf�
+
+�ѡ��qD�:&��=I)Ne��wU9�b���ͩ��|e�{�
�k�S�$i����{H��C(��3�C�sτ
H�q�PZ,#t�DZ�晧���:G��
��
l��x���l�:����qc	��h�x�� 2$���U4��(C]�����^	F
+(#�gs�1���f�N����W�Y���+�xk��i���؍&ӻA��?��=��恏e����/
A����N��"]x��ncR(�M�I��[!��1��
�%now9�4_=�$�@�l��G-N!�����e	D�ywyq��,'.C\�*�Q���.�
���:�� H	=��l�e�x�����s�_���9ڰ��#�3g��x�܇��^DOx�d����𻆂R$��)B ��]F$ !��;�"����
�F�����܁B���e�n0$;]\W70��&�{^��T��{�����ee�e�|[e���d��^t�,�Ej at W ����>�1J�<Cz��]?���c
8�f�:�c@]�9�%]�D@*I�oW��
+ب#�J׻,B�"�Q�]�h�X��!bfV�*"A�*�т/�9�|�	��ݕ����R?ͤ���j�s0���Ѧ��Ci�L�cV��i����!��{$���B1=�
S�KD�K�����ܖ���)���VY���/7��(��q#��'�`Ї16���%��q���'��O|�A�/�e
t�Fݽ��xI�
ԝ�
(��ր��� �ѫP�Mp9ߤ3�|���zkX ��FHF<{��9K(�f�� ��=�V%=�`xx&��UDsF����C(�r�; �}^di��͗m5# �n��p�� � UtIZ15D�
\�.�u�Y�-�z�� U�&��A���,HM�@ʠ+���*����m����"e߹~y%�����8PVe�"�	�^;��̊r�ims�T�?�
�$8

"P��b�T@�J{Mn�aC�J����G��6��`�<�
+�DT�1
+��V�c���tej�O)p��0�φ
�y4�ah��F�y�Xf�Wփgk�Xxn.o��ֶG��'#B�aB!���-�O�^"�M�4`�p�@Q�q J��5���
6L�d��l�.||����H�Af2��I��h�
���z��;�DK���~����i��&3*9��+<���P�Ƿ<$b磥�)�.�3�$V@�H�n��
m
x�ae	�۵|>C��.��i��`�p�}~~��R�t�~l[
	���vC�ly
+����"�f�O��ucSt^ş
+>���"��TH�&�J�	��]�K��z���W at K^y����\�<��X��. $�q��u��):�2b��RXA��A�ZE��I�����S��i�*D�/�W�s��qHaD������0-1g�G��PH1��h�Xc�
8>t�h�Ag�F{��QG���(���x���l&�A���aAc��@��`T�
��-�F���@����{րY��,c0��\�g���wTzJ�:h�������q���bfk馬�c��!�i��rxHU�bHw��f#w��2 ��}�
̀��
io%�r����_�g��3_

��7O㞵����13#
��*�cf��cfh����6��93�m�}�7ƐH�)ޒ8oo͎��~20#]G�x�n
�ݙ�5s<A�6��o����,]F$#
+��3�t|����H�xʏ��
{r%��\5�'�`lJ(�����	���
;KT��‰ 
GY7�V��ƒ� F�@Η���;gpb;�h{�
����l|c*����	�0G
+]ی��p��.3����u,��9u�F��7���rj=
�\R[�F0573MZ�x����6�-ñp��L�8��2g�#sL�z�U���`�쁼�V��y<�����+O�y�<�03�&������{�ɼ��.	����K�g�Vq
��l�\ng��˩�<�[q��n��M��c�y
�;:�7�jg}�#z=��v	�
�	n�
&�H�����D�B��D�80��m�)��\�Q'��Es�����|DGP�{��E>�#@����3:E�uDC���X�� R
�����K%�|�:.�.��º
@��ڌ

Nr_]	b�N��+\��"�c�w�;jn�ZSBCo�g�ζ��ݭ�%���̿T?���2s>���
6���g7R�a����ȼ��_}�}8��k �2k���������WF��3#�bC
tk���F
��)>o�
z@���Έ�\�%�=�,�h���S
��{�<�G�y.�v��I����lƹ9/���
��b~`�K�fCq�
$'ƫq:��{�����\���VwώP��KGA��㰛�?U0C�n�
+��~7Cu^n�
z��/0R:C9
V/��É(2����.��	@/p	͞�kQ�nJL���;��_���~��Uj�a�B��j[�ͻҡR�ܔ�l�_�
̴��~�e��w_=�x�<!

+��,ʪ���ɿ>��%��U�� (�@�\��$h��'��9�Lе�� m�����N
�W��aOq�)��NX��Nw.w����oX6H*����x�Wٞ^�
��D�
¿���f����M�R���
��;���j�Or�:�	m
��~�h��]V�~&Ĵmi���]�k{"`�C��f��x�W��_o�az<�c����
�z{�����{0�=�
�?��^N 
�֨�f�kSV��
ʶ�3'��?����
+endstream
+endobj
+12018 0 obj <<
+/Type /Page
+/Contents 12019 0 R
+/Resources 12017 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 11949 0 R
+/Annots [ 12012 0 R 12013 0 R 12014 0 R 12016 0 R ]
+>> endobj
+12012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.275 624.689 293.971 635.593]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+12013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.332 488.762 235.598 499.666]
+/A << /S /GoTo /D (index_affine_relation) >>
+>> endobj
+12014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.953 264.616 250.388 275.52]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+12016 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12020 0 obj <<
+/D [12018 0 R /XYZ 89 770.89 null]
+>> endobj
+12021 0 obj <<
+/D [12018 0 R /XYZ 90 718.682 null]
+>> endobj
+11678 0 obj <<
+/D [12018 0 R /XYZ 90 684.012 null]
+>> endobj
+12022 0 obj <<
+/D [12018 0 R /XYZ 90 679.529 null]
+>> endobj
+12023 0 obj <<
+/D [12018 0 R /XYZ 90 594.711 null]
+>> endobj
+11679 0 obj <<
+/D [12018 0 R /XYZ 90 560.041 null]
+>> endobj
+12024 0 obj <<
+/D [12018 0 R /XYZ 90 555.557 null]
+>> endobj
+12025 0 obj <<
+/D [12018 0 R /XYZ 90 460.916 null]
+>> endobj
+12026 0 obj <<
+/D [12018 0 R /XYZ 90 382.52 null]
+>> endobj
+11680 0 obj <<
+/D [12018 0 R /XYZ 90 335.895 null]
+>> endobj
+12027 0 obj <<
+/D [12018 0 R /XYZ 90 331.412 null]
+>> endobj
+12028 0 obj <<
+/D [12018 0 R /XYZ 90 236.77 null]
+>> endobj
+12029 0 obj <<
+/D [12018 0 R /XYZ 90 158.772 null]
+>> endobj
+11681 0 obj <<
+/D [12018 0 R /XYZ 364.289 84.126 null]
+>> endobj
+12030 0 obj <<
+/D [12018 0 R /XYZ 90 77.486 null]
+>> endobj
+12017 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12036 0 obj <<
+/Length 3004      
+/Filter /FlateDecode
+>>
+stream
+x��\m�۸���B�Z��|Y��kr�5E�d�/��Bk˶P[�����~}�z�M�^��Eq앩�p��pf
�0�"ZD�~|��W������;�"���2��GG�$$�5�>�F
+�'c<�0&x����Ø��f��Lfy��>}��������"^l�x��io��O�?ܾ#�'�R��T0y)�w�G���f��G�A��f�NI�n�v�	�:J��U\$Օ��<��D��l
+��abĔ�2o����|C@
�He������?�h� s2����u�)��U���7رwigC��L��ufF
1Uۺh�<\���(�gBG�B��f@�M�xmW,�נ\#���E
��
ǭ׾�)mҙ��Q"����8R�
[�;�O}�$7Ǵ��h����1�Yr�e�%b\��a�
�5EF��ۇ�e� Ƹ��m���x�F�� W9�G,�ǐ\!L[��"7���q�ZQ�FO��EjM`:#D�'�_����,��f�]��lWx�
Q͚Q��,�󇷿l�m�ۥ��#[3ؤ-F��Y�=[�ɘ��:�+eH���n��.��IVx���>B#i��_�E#0)E�ƬE
��������edzÐ4��y2%y�<f��S���Y�m�i���x�����#�E�c�MVϦD�N)����B��$�F����s����}���P�A�ú�� �Efc�����f�@��4
��S3��
��"�X��j�� �Hb�
Jjm��E����D�A2��c*FuT)ի��"qVY��ss�Q݂F�P����fI^[lY�FF�lZ�m[^^��m�-����u8qƙ��IAyw@l�(���"W�����
k��фI���_�S�w�M���3�U
�=jhna�ذ�ǭ1�l�[�DZy�ҡ<�
+J��(r
�&{[cB1�
�q��{��9�ۅ�P�h�J���wݯՏ����FR�93��8���#�u%"ؐ��	w4���
+?��*�rǐv�Il�E
4�H
+����
��
s�
��:9u6cy��J��u�N���f�^
�+�
�֩���qW��S����U
��U�D
+HY/��xR+�L��$�D�a��@iZ
�N��Je���+Ӣ/{Z'y�7���2���˗3+�2V�%V��a���
+�2AZCuͽ��Id]��Y�>-�r�W���
F���غX���?,!�
ŘGB`�i刷�L��M O�g$�3���_v��
L^f�ሁXÎ��L0�+��'ٗho�I,�(��j�d�I4?�i	E��i����]1��K�1��?^��HJ�- ץ�;((ar�63�M��P��,t� �����_��ǿB^"��s_���*���"���Hs �_�����{%
C�d1
~�f��^����)��TZ���;Y�T
�� 'U�D%�����S�M7�m\�m���Z����Гe]��l
\f	���ulo�k#����D�k_c�n�5x&00��"
+
�+��d<l
�F���3��Xn;��5;�j��,99�y]'�x�
��ܛ��y����s��� �^����g��Cn�
��6��ɫ����� \���9HB6
bf����N���`��p�;�k�!�!��s���11=�������E��	`��ç���f��Ꚍy��=�}-k8�d�#�u���u��0�^W���z����H�.D�2����H��+
+
~V�
J2�F"���O$s�?�h� ���T{��2 at c|�;�Q�y�L5�auN���:�m��i���V=��7u	����5-�լP`n�iњ��<��gŒML�mi{�[��2�8�Y����m��>�S.� =�U�Q��A\UP<X�C��bmj�
{�*��7�!�����ɛ0�$_�����^H���
���x&.�Jo��l$*�������r�pfU��4�Qر������+���v. 2Ynۘ��ӡn�VGDՠ��{v�� L"i�{pxT�X����H��F	_��6�	�X��͑��> �g�
�#0H�
�/��S��ns�h�m�d^�hK[�V�Mg�$�A7Ήn��\��_Mt;�Mw�
�a�m{��bh�EB��o�!��@��c[Gm�9	����#�����(z
V.Vqص
+
�UH���X�E$
�B1�93�r�Je�P�+s6
������H�|����x��Rԅ�X��+D�	JR1KEhqIu�>~���yI�M�w�z��"����{Š��<<�Ű@J�m޾��r3R	q����L�'��`�BΦ��ӧ��`Vȕ6
��R��R}$�����Xߐ�bZ��q$?�� �R�����ؒIJr���
�e���פHy�T!�5��J�)l6�O�
R����j-�"O�Emt(�m�~In^Sk����PjE����
+�'y5��B�ot���ո
�հ<�F%g�с�̫����j\���H���K�]G�$�p�}�Vc�K&f� g޽7J %�6�F
�Nj�T"{����}'B� ��l��Z[���vcL���1(3��ݺ��_k��r��?xO�����w!�
|��@/�.���l�*� UCKR  U��_Q5V����*TOF��j���f�<�Ӕ�̔gQ5 eک�j���4�|��"��4Ie�Io��Uh'�FD���5.�?
��:�9�6�q�C�	X_w���8)m�_z�ج��|>�IJ�$P��P�	�i�""H���6�Z@ש�� 9j�ɛi�\��a׃D��.�lV�UP�ا~.�>�TǏ��:�s��8�Zɂr�%V`�6�c�Bh�,��j����s�
~���������W3�~HQ�����Ͻ7�6e��/
�ip�}��zv�>H���������?wI�۱�:��[�=�u�c˲/�MI�= 
y8M�" �'��ѧ��`+��
5��zS&F�:Daȱ�JbYۻ��ǧ�.�h�Y���@tRmb7oh��&��fpq
wD>`�E&p(��`ПolΡʇ�����������_�,����y�?r�}�
+endstream
+endobj
+12035 0 obj <<
+/Type /Page
+/Contents 12036 0 R
+/Resources 12034 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12045 0 R
+/Annots [ 12015 0 R 12031 0 R 12032 0 R 12033 0 R ]
+>> endobj
+12015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.151 661.939 244.345 672.843]
+/A << /S /GoTo /D (index_affine_relation) >>
+>> endobj
+12031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.2 437.793 480.931 449.432]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.852 200.015 466.489 212.494]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12033 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12037 0 obj <<
+/D [12035 0 R /XYZ 89 770.89 null]
+>> endobj
+12038 0 obj <<
+/D [12035 0 R /XYZ 90 634.093 null]
+>> endobj
+12039 0 obj <<
+/D [12035 0 R /XYZ 90 555.697 null]
+>> endobj
+11682 0 obj <<
+/D [12035 0 R /XYZ 90 509.072 null]
+>> endobj
+12040 0 obj <<
+/D [12035 0 R /XYZ 90 504.589 null]
+>> endobj
+12041 0 obj <<
+/D [12035 0 R /XYZ 90 408.669 null]
+>> endobj
+12042 0 obj <<
+/D [12035 0 R /XYZ 90 317.919 null]
+>> endobj
+11757 0 obj <<
+/D [12035 0 R /XYZ 90 259.338 null]
+>> endobj
+12043 0 obj <<
+/D [12035 0 R /XYZ 90 254.855 null]
+>> endobj
+12044 0 obj <<
+/D [12035 0 R /XYZ 90 172.169 null]
+>> endobj
+12034 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12052 0 obj <<
+/Length 3342      
+/Filter /FlateDecode
+>>
+stream
+x��\�r#�}�W�)!��X܁Q�T%��DZ
��ۥ�G+������� s�����C��5���Fw���ÄN�������/��$$�\On�'	�����b��T;��櫉Ж�D�[����~s�曛��oWon�~�b���\�"�N��W?�D'
<�jB�H����H.�s5y{��+Z�R�$\���G�a�ڄP*'�	b���y��]��_n7�^��S�3�	���(n�j�
dW���eb3����Hv��t���B�
?Y[��ZC��$�0r.c�M�B򭑍�a�* %1x�o��~q}���$��OW��m��	3}xYg�}�[]�����1��� =��N!$a�
Y���ur� ��̛��v����f6�JL��nm���M�H7�)}�GJE>Ȩ� �XV��?.��1��H���0�ϹX¦���rs�]?���U����r���qKL���1:%RUmw11�Xf�!�ab;��,OV����uD��DXٶB���\ �
!d�IT���n��Q'6u!#�
3�ۮ�q@*��/���$r��u.�y<;��j"�ܮ��D�ٜQJ��l��f��� ~c_L�����tC�������mҵ���ӛ�@	/L����z̊r�����rQ �y�1
Q��o����v��n�>�O��IL퇟uM]a4����1�9�9���m_6�lqx�
+�#C}�G��c�j��WRJ��MN���&;��9���23B<����t�#c6��?RE#�'Ѳ2�g	���e�`ax�=�A�"D�
+
_�i:}�O�0�~�!��G��(S����&Kw�o~y�����btD����3~S�]y��p+8�K#����k�ĭ'�V�SQ
�a2�4�15u+�0���
d ~��x���/I,F�g�0���̞f�����d!�>�f޽�eZh�,�Y�'����"C8"ǭEE�a�]��?__W��B�pA[�1=
+����e�p�l�m��J�(��6��r��}����)$6�:��n7Y$�ЊX���LQ��b1 �W}���ó�� �(W�@U�����
�?l\�b�t��%�H> Y��ɢ̪AY>)������X��j�dը*"�D�+�˞�2��A� 7�cV��n�P ��/�&?�����G��.�.�%��*�
wA�$�� G�.���I���8Mtm��b�#��>������`�}�:�����o8Ns�Z���hzBAȏQ>AO��]�2h��
����Hiw �n(��D���(+槑Y�O:�Q����%j�G�
Ŕ�͈��K�eې`�����#A��B)�Ө���n�mV�	[A��>*�ںdh�
�-��Υ��)�>�qɦ==�`�S:!J!���G�8�����}DI\���Xqֆb#

l�����5r�Ƚ��XLs<�P� 5Ls܄z��Ѝb���zeb럼<-Pm-�_�}����0�(~��S��c,�	),[cḴ�����
���
+���2Y�<���8ʸՇ���c��O����:�)~E�bj�������X^n
� Wf�yn?
vg��$I�
vcK�a�)�F�;Tq�
+5���1{�.S'���:�A����)w�2����͈�[�
2J��:���E�
)׀��D�p���[S�
p6�#�m���Ɨqx&Z�%ݗ��I����"�P�C�t#Z��h��Vg�4�
l6�i��
+��6IA��'EU�O
��
C^V�f��z)�����!�p�&tb�Iž�|�����e�>"�(�"=ɩm��E�BP�шTc-��QJ֚�F5��ʒi
�y
��2`��3h���ձ��a��-�u���h�k�s-mr��s"�fK��mY�����>��k��W�H�UR�p;%2b��p^M����`#4�|���V�6�ѵ����2��S��#���
��]��[�'��m�ӂ�|J���T�ԡe�MR�F�5
�
}T��
� �p6nH�Df/�
+1D*�bR٧dR��3�P��
&U$C���'���G�'�ӨZ�hԜMܠ�X-��#���nW��"��E�&N,�t��G(U
�����)�™�x���3�8�j�
T�m�@�cZ��5qӢX��1U���hTݾ�4b"5O�_��n0�fC�[-�bn�>�֨Jn/G�G�&�핁
�p�$�
�� ��p��K�0����#4m�P�N�PԾrG(�E�EQ�ӄJ��X�)>ҝ6iZ4�R
�*x��Y�(M�
+n��
�V�ȓ�0a����]�yc�!���>䰰v���1��8��P�\
A1O]�'���קRY&�\V�^9���G�e����:#l�>��D���Dp��m�����+�}H�
�#�_k̠�����n%���:f�
+�58����1Y'\�8fc{l�>�!
���)3Pv
+Uw�
�c�G��^e�Eu��w	
r��N"���P�%�[�8�7��ec��es�dP��|Ct�'�=ƃ��s,"�1���ED:�C�[�����OU���e�D!�ss,���*vo��oJ���%�`1��w2R��$��Ԅ�o��B�]�L
*Me�q��������
C�٫�ƈ�"�Ɩ��NSB����+h9���]�i�
����O��|�͠w�z����`���%�F�q��P`�Y�ƥ���ݑ��~tO�TI���&
VL�9�(�b4l̕�DXk�%vd�1*,Xi�
+S2�d��è0��ǺT!r�T���E#�d9c��\.^����'D��bq��bΧ��Z�9��-�橊�/�0�<�7���گ��6��,{,�
2`��X�`9�i�{��]��N�(m'CLݿ���ur8[M�u�b�i�1��R����x��
��x��vFR'��
.�F�d��i
��n��l��l��]�%������ZbM]��Zb=u�Ou7v<>
6��&��U?�Fa^��1>M��c���{�����4
+Ϝͥ�l���_t�]���T���ub:i���*�.�O�ۄ�7�
�~­�|�V^��
:�A
Q�9�$��LG#xG#H2?�y��`�C#XC#�4c+P�3�g���g�%��3�5�U�A���R���������q#�#W�Q�F�
�Q_�z_�>����s�y*X;�D�N��HfT��w��o��v4���$�Os�Fb�?Ӽv�.�y
+�g������k|�,�S<x�����u
a��9��k�e}��Uk��#�p�bL؎���z�v��)�q���H7/�\�߻&C���\1��6�t;�N�f�k���R��W~7:!y��5��������w/��� 9?�W�����b�}�HYo˻j�

��WPo���V
+endstream
+endobj
+12051 0 obj <<
+/Type /Page
+/Contents 12052 0 R
+/Resources 12050 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12045 0 R
+/Annots [ 12046 0 R 12047 0 R 12048 0 R 12049 0 R ]
+>> endobj
+12046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 599.5 422.924 614.215]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+12047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.382 348.002 394.782 360.92]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.883 111.35 440.282 123.829]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12049 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12053 0 obj <<
+/D [12051 0 R /XYZ 89 770.89 null]
+>> endobj
+12054 0 obj <<
+/D [12051 0 R /XYZ 90 718.682 null]
+>> endobj
+11758 0 obj <<
+/D [12051 0 R /XYZ 90 672.057 null]
+>> endobj
+12055 0 obj <<
+/D [12051 0 R /XYZ 90 667.574 null]
+>> endobj
+12056 0 obj <<
+/D [12051 0 R /XYZ 90 569.89 null]
+>> endobj
+12057 0 obj <<
+/D [12051 0 R /XYZ 90 467.184 null]
+>> endobj
+11759 0 obj <<
+/D [12051 0 R /XYZ 90 420.559 null]
+>> endobj
+12058 0 obj <<
+/D [12051 0 R /XYZ 90 416.076 null]
+>> endobj
+12059 0 obj <<
+/D [12051 0 R /XYZ 90 321.435 null]
+>> endobj
+12060 0 obj <<
+/D [12051 0 R /XYZ 90 230.685 null]
+>> endobj
+11760 0 obj <<
+/D [12051 0 R /XYZ 90 170.673 null]
+>> endobj
+12061 0 obj <<
+/D [12051 0 R /XYZ 90 166.19 null]
+>> endobj
+12050 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F7 803 0 R /F8 802 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12070 0 obj <<
+/Length 3440      
+/Filter /FlateDecode
+>>
+stream
+x��\ms���_�O�4s����M:ӤI&�ur͹ɇKFC[��V"�����.�WP�$K��2�I�b�}���.<y���7W_�\��Z��AFR9���<Q� !����`��lN0���3��Q���gO���c�̣Ż�6�������!K����c��g��|��kB:�)5HJ�;韕C<
`F��7&�>&��U����T`f�4^oVQ�O~���|F�4N��3LL�2V��W7W�^�'�����ܭ�>��'Kx��#f���
ZO8e�|����v��DTد���w�]�6c>Q�!�K�a�9lw��
�$�n�^{��3�-_�w{+��rxe�֑�I"b�D����h��=��n�.B�D�+P#lh�߫�j����H
+/�C�
R"C{z�<V�\��E��1J��m���F�3*�?cL��I<#b��&���$K�tx1�HD.X̠�H�DŽ��K<i�� ���5�
+)�K;�3���j��>	V�����N�< � ����V���l�M���	:&XƖX�E��
���8�E����}~��L�0J�z�(I

/�>�$@���a�HPgK|]�L!�Ii��~��7��
��'Dw�`f����~�/�<f`!�a at P8�'��'�K���#�='
Q�w��<��>��"
TR���m����:Ig
O��U�\D��?��qZ
�=�
i��\'��C�
e
|5��z��b���z�y�3{ȟ]�`���ڴ�C�"N>��U�\t!�I=�xL��_`d�ԃ�m9�2�M��d��w�z��v��10��F����-q�h��!1i��!�ib�}��X^���
-�Idڹ��.Dv�d� ��ȼr������
13��
Nް� `��_�w.�y�
�t��Zt_�gU�[ԙ�~F��.��ZO:�0ހ�x��)�u`&��).׎��9�'�㬑�dS�,Y��a8�\��g�#՞�φ�V�2t��>��ݍf����l�.��~�͌�J�.Z�:c��[�c�(1�������M
G�F��BX7̟XR��f4fs=���38`�9��H���hkQ�D�
Vо#�Dt�a+73��oB�]���(���P֌z��q�/���
+(��d
ǺA�B���k᰺
��zO!'B�P�Js�6�B���ɂ�9k�:�?��ڈ�ݞ]`{��%�Qv�C.��y����.�� �e��u�Ԭ�Og4�H&wm�E'�@Z� �ZQJU�y�����Z="Ƭ�cLO� ������
Nw���b�x�6�/�4['iT8
+A��� �
RݸUo{Y8�HC&�p3��?:�����
$^���(sF���@UDpU^�
 �!���i���"s��8U�Ǩ"����.c�IK����2�,�V%s&��Z�
sL�� ��&vt
T�](w�1���B/�0��7W��n`
 ��^f
�Z�2w��-��jf at w�yב:��q���j��`�vgc{�����r@"�m������ֈr���� ��[����L�V��
�}�"�l㟐6��'�u7�!�d.Z��80� J	��3�����9�U��
�K�
v!Ch�/3�!�1
WH��\b�F��2:`�
�Xݵ�
��G
� �
��U�s��C�ኌX
]�+�p	i�#����K
���Sy��/�#Xo��h�O��Մ�=�m��nU��ۗ�x
,@�n�Z��
F�$D����%��`��Żӱ�XC2�%L,��<��&
��:����	c��O��t���e��@|L��zW\�wa9IF췝��a��H%���	;nsj3����9� [�q�u��L�0���
��f�)!w�:�"��Atd�%�(�x}A3�6
Tv�C��y�!
E�ʄ��U����.ɻ���,uY
<c����_J���e���Ȅ!
d�>2὏�m�N����5��6RG�
+�FR5Pܓ*��oKȤ�ݪ��ծ:�.�n�&-�#x�cp��׵��s6z��)
�C�Z��2�w`��\x�VcG��F��~z�V��[�����j����
��8�<V�jf��Ԉc���@��ܖd�*{u��J[� ��3��4�٭���z� m
wP"�μB�S�:���l8&#��
ü �s�Q^y��
,�֜&��d
����=T��xe�*oU��Mt�W�aS�;C��1j���+s
륞}䆝 H�B��X/�y��j�,D�^/��^��C�T.�^*�'�R)��J��^j[�=��Z��t�l�|�5
��~��-|
ǫh�
5R���r ½y#�u(����s��`�nN�"�j�эdGL��ޗ:
�V�@��F��� wZ��8}�L �
�>&�*I�_�{���u��Q�v��d��
�?�`	v'~�Ǖ��MNP��6<�&>�x���;ح��z}�q����-G���.����$�m��% �l:������b������<f��2]F at -��g�I3�Vb7!�d��P.�̪�2��Yg�B���BC��N��!
�|�$��9�@4Z�{�>�H%϶���76���^}"/�y�JR���TR|J*���B���@'ݶ�0��ȴqx$
+ҙ:�A�P����y�	SI{�Y����)TRK�[��t��t\
S:a ~5��ފ�.>�E𺒽��{�ho^��
:"��7��_
�ٌ���ұ�6-�8_����?�Rg���.�f�25�y�n>4Paz�\?���3���I�CKf���|��A�qp��l�6έ[��������E�5���Dp��5�C��T�~�ʣ$-^��$�C3�9���ʵ��ɷ�
1)P�h�"��wT %�Eeu 6e
�<��+��"
Rߣ�o���5�ߥ���ː�9#���Ve�?)^����%=��������؋~�0'��
���<f��s�c  ���DqX���>A�o3��,[Ř���y!�eK����ے$]&O�r�V�0/�;L�3�|�n��
+�
��\�H
+vSL����ن��&��7��b��4Lj;�H}�ˍ�N���&
�����>��I���JU�K��r�.Ǻ�D�
�)g��C�8�w�*�z�4��m\t
�õ�
�{%����_��m]��m� �t��uQ� ��������4�xyR���F���?�7ߣKtG$��N p!�{5b��L��N��E:������sȜ
Ʉ��9J����5��[�H.�?�V����C�
m�g_���
�b�;�6�������"��-D�-a3}~���Q�?�N���f��OBf_��ܶ�����]���8��L@�Q���(��W'l�T����D6y�˛����C\��R�O�o�r��U�@~�uC�
�bs�������|o�X�Y�qH���}
��Y]
IRx�v���Qcl
����n���
+&�D)�Ft����?�
��v�&�`�[���&�
+endstream
+endobj
+12069 0 obj <<
+/Type /Page
+/Contents 12070 0 R
+/Resources 12068 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12045 0 R
+/Annots [ 12062 0 R 12063 0 R 12064 0 R 12065 0 R 12067 0 R ]
+>> endobj
+12062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 523.235 425.662 537.951]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+12063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 284.972 322.446 295.876]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+12064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 149.045 116.998 159.949]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+12065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 107.849 243.45 121.797]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12067 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12071 0 obj <<
+/D [12069 0 R /XYZ 89 770.89 null]
+>> endobj
+12072 0 obj <<
+/D [12069 0 R /XYZ 90 720.814 null]
+>> endobj
+12073 0 obj <<
+/D [12069 0 R /XYZ 90 642.418 null]
+>> endobj
+11761 0 obj <<
+/D [12069 0 R /XYZ 90 595.792 null]
+>> endobj
+12074 0 obj <<
+/D [12069 0 R /XYZ 90 591.309 null]
+>> endobj
+12075 0 obj <<
+/D [12069 0 R /XYZ 90 493.625 null]
+>> endobj
+12076 0 obj <<
+/D [12069 0 R /XYZ 90 390.92 null]
+>> endobj
+11762 0 obj <<
+/D [12069 0 R /XYZ 90 344.295 null]
+>> endobj
+12077 0 obj <<
+/D [12069 0 R /XYZ 90 339.812 null]
+>> endobj
+12078 0 obj <<
+/D [12069 0 R /XYZ 90 266.949 null]
+>> endobj
+11763 0 obj <<
+/D [12069 0 R /XYZ 90 232.279 null]
+>> endobj
+12079 0 obj <<
+/D [12069 0 R /XYZ 90 227.796 null]
+>> endobj
+12080 0 obj <<
+/D [12069 0 R /XYZ 90 133.154 null]
+>> endobj
+12068 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F7 803 0 R /F8 802 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12085 0 obj <<
+/Length 2940      
+/Filter /FlateDecode
+>>
+stream
+x��[m�۸���B�Z/3��"2h
\���]�6ۗC�h-�Z�-9������!)Y�e�׫\`MI�̐|f����m@��/�|u��
1*T��M`h	C���$�4�^�z�C��&�(x��~���՛wW��ś��/

р9�D:X�/>�J�n�P�m�u B������/����-���@
c�Ss\�"�K���@鈄�d� �İ�L;cFtf�IuѐD"t�Sډ�Л$�B��
횠1a�7�j�^�����tS�U��q���Wܸ��uҳ�b�'i��fy�^29�MK��a�-��m�<��[��p��j�dՍ�$[�yJ��'b�sXR#=Į�����2�l҄
�:�a�N�A��<J�t�^�C- G6
n9�&
T���ܭEqn�e�(r{F8�r� ��OZ�B)/.C9�wϮ�e|��]V H�t��'u���p��4vs���� �b
9Lw�v0�Ųt��� �ga��i=�A��L8%���hQ-a�5U�G�9QZ=kn�f k
ˡp˲�>oNA�3
�vאEUe׫@���|k��M��Dd*�@7c�� ��e

�u�P��ڵ�E�����9�2��Wi��i+���2�q2 �ˎ��B�WQ����r�z�r��}��K5{{�:��u�s
E}�@/
�-��a#�Y��f��U���4Op��D�~�S�a���=
3c!��S�����ދC��[������s������[��
W��
"s�J���Upc<8�9���>o ��P9ދ�j���ƛ���

}H╻�C�
���`L
��Έ��W���6.׼��%��
�j�����l��M��.�
+?o��&-o�rmg
@9���t�2���@�h ��#ع�l[�7l���-��5m��ڣY�'�f����ʮY����k\�m�!����/��p]z�q�GL�f91�Ӱ�L�q�=XU;z|��
�����^ZX@����Y��_��s�V��.J��,�*m^��1����z@�ss
X��vm;+݇�5��0�fq��N��n����xr/܄ʐ���K���X��G���Y�`�E��Ff��%��
�M=	�
+�C)��4Qf�Y��n_��>�-
��{�����,���*9)�?���L߳�;�
0�9�ŷ���x��L���
��2��l
,o�����"�d;�ƾf���E��
t��4��n���W[̇xݸ&j��ZR�W�z>�웲����Ns�sg�0�Abh�^2�D�%
~���KBC� �{,�^�/qQ�w�9��}�d��,�BA�p�{<��>�jܣc20�t,�J��h�o���t� ���g߂������+.�Pv�.I���.�PI��pi=ʩ�k�r�����z
��έ��7��e;�>�ޠBL��,��2>��̖��%,+�e�֫�Nv�g��X�� `f��ҳΖ�J��P���:�цP*a$1���H7uS���Sq`��~�!����n�����ȴ�F(A�O��_6���u$��
�$�^F�7ǃ�YșА �/ �:y�
+
L@��WY�9��v�����R��O9N
�'
X�-���(���8���۷�X�X�Qm���*OA^!P�vB֏*۸9�R
+n���3˸G*c1���8��֎����y�@m�r�@mtVC��9
��^c�!+"h��(;u��p)1F��E	,
Wψ��H�BN�#�xF@�v�{"�:'BAV�2q
+��n7ᬗMB¢v���z�G$���fr�
��fW#�&��P�ӈ@�iw����Y�%
0�ot�m�u|�[7�?.���X"A��
K_���P����t�:^�J,'-6��fDq�2att�CK�U�__�QL��ݾRť�j
+�b<Pپּ�G�Ydl�!���� �W��F��%�Zf&Q.�Z
��nJV�H�Gp��$����k[��r��*��l�
&H�t�!�6 O_�f[�g
�lY�v3��w?~���?���۫�G
�>�r�%��A���K

0��|d�Px�i^�d
<T��	�G_?�\{�IYt6լ�Z������r�
����>[Q&Y�"}��
��I�@����
k��W���������V�n�	��%ZF�%��Gv��<��0�H�I(��}�S
+��Y4��ճ誩r���l�
��ܩ{�S,ǫۢ��=x�Չ_Q�
�aDྕ��l���V
c����仢NG�p��X���H���_o���6�-�үnV5!��ϯq�����B1���E���v�v_��&����`��Ur�O
������&z�)>����'���h��h�a�9�0�A�d�}K��q��8�ܠ��p�v0v�����y�u��?�:�I���P��J(�L�	=��$�<�:Ѹ{�|��FD��i=�:i�4J�l���GX'Ts|�i2"P����|�nY�\4_\G	(bV�}��K��>L�\)�QK�~7�Q��
�,���ň%�&a�"�S`�(0��0-�G{X�G(���{?xd����ּ��p��
�����S`-����i�t��
 w/���I0DŽ� lóe�;����D��v��t�n�񆣛ߘ�3�gS~K�\�����@�'�H'��2&̻d����r�,SF�yϔ�%x{Z[{.����.�
p	{@D
�]��.2�~����a!�a��S�~h^�er"�?w�Ki�=%՟\����(��'�<X�s��g�4ڮI������
����)O��/���O������������c���
�@Y�:m��y��x�v̓� l'n��;�
J�l�%�ȷ�O$>��������x���)η
x�A��wU{��)S�>�����iS8;��ۚ�7w֡c��]ɸ��ͫ�/���U�� �>�ڽ
l�F-�i�-�Sy��
������`�? 
b
+endstream
+endobj
+12084 0 obj <<
+/Type /Page
+/Contents 12085 0 R
+/Resources 12083 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12045 0 R
+/Annots [ 12066 0 R 12082 0 R ]
+>> endobj
+12066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.883 566.886 361.886 579.404]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+12082 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12086 0 obj <<
+/D [12084 0 R /XYZ 89 770.89 null]
+>> endobj
+12087 0 obj <<
+/D [12084 0 R /XYZ 90 500.808 null]
+>> endobj
+11764 0 obj <<
+/D [12084 0 R /XYZ 90 454.183 null]
+>> endobj
+12088 0 obj <<
+/D [12084 0 R /XYZ 90 449.7 null]
+>> endobj
+12089 0 obj <<
+/D [12084 0 R /XYZ 90 378.969 null]
+>> endobj
+11765 0 obj <<
+/D [12084 0 R /XYZ 90 290.386 null]
+>> endobj
+12090 0 obj <<
+/D [12084 0 R /XYZ 90 285.903 null]
+>> endobj
+12091 0 obj <<
+/D [12084 0 R /XYZ 90 205.374 null]
+>> endobj
+12083 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12101 0 obj <<
+/Length 2448      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�6}ׯ�Ӯ4S��_<ݝi�i7ݤq��vӌ��h�S�T(*���~ /"%RWx�m�$��> �� ��]����^ξS,0�H*�����@q���o����`��hL0�Ë��0��W#�����>�d����:
����7yx�&����}8�F.8���<�I��s��uѤe�Hy��� �D���^L��b4����h6��yT��9�����(��W�01d�X������
�bZR:��
���^�`Č
\�Y�)��i�n�� �3\"*��(��4�
˜�0dxa��i�p��;���հD&�'f�
�2ˢ$�>��
r\NF���<�g�4�˦w�0
�<������C4�b�iDLV	u[N�h�0�H0YM�M
+�
}��m�rI]�,ۄk-�7?�r��훋�/����@͐�uߨ���̯M����3��"��G
q]?�H�IFMQd�ϭ.R\W
��y��3��t��+d[�w
�#���ӈ�aO��@�c�p�s*�5�����|
��Yo�������
%7ݍ�B,)9pZns:��6��m:�i0IJ�4+W82��g�<�u��d��4���0�sAO�M���%~�b,��%Y�
K9f�!
�cB���b�}E�����_*�tDdm��H��W�8���eb�'*i
Ἱ�H�:&��1����U�
&����:"
Q`~�/�1����
� �J:��d'чV�^�UBm�� 1�2�9Z�1:O;��9��m�eJ�F_�֖T"�ɪQ� �h���1?�->m_�qrW��rd�S���e~�~�w
�W�#�+6������u�?DQ�1NJ[
�e�䠁�ɤk� J(���&�@F��ҙ�7R���N�:)��†mȴ�(�.:S}w�-�h��^�����E��ʥ�����Ӝ�m�8(�_��M��,)�P�L�c=��@�L�EĩF��2)a�Uۊo����ʓ�2ܷ E ���ϖUNhӚ ��z
U���al#gQ�u��!&�����[=3,���	3��G��0[
��`8P��}�Ō�&8vJ�E�����IVt3�i�c�n_aK���<���
�#2L�ǰl]�{���j�Y
^O���"O�"���"U�C��]W�.U���nM
�x������5r��ے�H�0����mGZ.*z��v<�|>}�?
>ē(��?��}��kc:R�$��վ-��O���V
��ױ���
&�p��u4�a�i�������QrG��'�Rx�C
+p�>`N�cAk����xK��C��k@��
+Rث� Y�n�]v�
`�')g�O��!Uqp�pO��l���n9��|;�)�Hc�u�0
 ])c
62j�H��d�tc���Yjc�Ú�Ү�)�g���0�.|�JG�İ6
�q���T�lw�(f`h���߁ �B<�ꔧ`nQ�ΕXm�k��<��$u��d�x�
��z/��6ƐX	@_��ڶ��!�LߥB$W�6q�,fܢ���8Q�D�1�\d v���1���\r�O���Z�1
��6F����}tO�P�V�׺Õ.&q�.&���>l-�.9���4�%�q�K�{�a��;�u�h�1�k*%4���"jӊa��N�n�1‰�-j����>�
{B��W�#��6�Y�{V�P��	��x�TyGt�ݞ�X�ݣ*�,�"�r'ѩY���ӫr��p?�m�<��
�CI E����M*
+�
+�*����^d?͞n�7��
W�Ey�䤺U��S�{p�Y�-y:�r��#��#맄����'�|#$��%2?$�0
+9�I���g{��4C���4�$v�Q
E����O�����
F-߈��r��S���CN3��U
#����L����w@�:�G�:�3{�U��x�@���ýʗO��Blt!��g
+
�S��V����C�#�ֆz�Bk�ϧ
+���_�~r7J�z�	�;�(�t^���LA�'��*���b��j��=V�[�ot�-�r�����?��������K�-�$']d50
��k��۫�ɐ�N�CbՆ�;^]^��U�y�pP"�/�~)�W��B�P�����C�-�9H�&�˒��q�7�e�'ٛh�O��}��֞�ڄ�Q�&
+�P���E����S���Ӌ���p?
R����#
�
+Sj�S4"R �R��F�Y���ϲ��*
���� �|;��u4�a�!q�]5�
���?}Ls�F�h���
+���&�:�/���0+Ũ=�#��0��"�
�T�������N��*�[����ؾ�i��eVl���[�H]�\�����ÿQ�ב��Y|&K��Eq���=yfW�xI�g�.�̘AjzU��0���z����heQ�y�����������n%w����m�"��k����r�ֿ�O���ݙB��RS
+۟��j6`B?��c(��k�|v���|q�jƂ�0�?���� nw�E
+endstream
+endobj
+12100 0 obj <<
+/Type /Page
+/Contents 12101 0 R
+/Resources 12099 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12045 0 R
+/Annots [ 12081 0 R 12092 0 R 12093 0 R 12094 0 R 12095 0 R 12096 0 R 12098 0 R ]
+>> endobj
+12081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 626.621 355.512 637.525]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+12092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 561.117 362.353 573.45]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+12093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 426.784 355.512 437.688]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+12094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 336.572 362.353 348.906]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+12095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 214.195 355.661 225.099]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+12096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 148.69 362.353 161.024]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+12098 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12102 0 obj <<
+/D [12100 0 R /XYZ 89 770.89 null]
+>> endobj
+11766 0 obj <<
+/D [12100 0 R /XYZ 90 683.788 null]
+>> endobj
+12103 0 obj <<
+/D [12100 0 R /XYZ 90 679.305 null]
+>> endobj
+12104 0 obj <<
+/D [12100 0 R /XYZ 90 610.731 null]
+>> endobj
+12105 0 obj <<
+/D [12100 0 R /XYZ 90 532.733 null]
+>> endobj
+11767 0 obj <<
+/D [12100 0 R /XYZ 90 498.063 null]
+>> endobj
+12106 0 obj <<
+/D [12100 0 R /XYZ 90 493.58 null]
+>> endobj
+12107 0 obj <<
+/D [12100 0 R /XYZ 90 410.893 null]
+>> endobj
+12108 0 obj <<
+/D [12100 0 R /XYZ 90 308.188 null]
+>> endobj
+11768 0 obj <<
+/D [12100 0 R /XYZ 90 273.518 null]
+>> endobj
+12109 0 obj <<
+/D [12100 0 R /XYZ 90 269.035 null]
+>> endobj
+12110 0 obj <<
+/D [12100 0 R /XYZ 90 198.304 null]
+>> endobj
+12111 0 obj <<
+/D [12100 0 R /XYZ 90 120.306 null]
+>> endobj
+11769 0 obj <<
+/D [12100 0 R /XYZ 90 81.969 null]
+>> endobj
+12112 0 obj <<
+/D [12100 0 R /XYZ 90 77.486 null]
+>> endobj
+12099 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12120 0 obj <<
+/Length 2560      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�6~����V��`�/���l�I/�m����i'CK���$*$����
 $EȤ�pۙ�C"J���>
cD��~�����^��W7�od$�������
�M�L��/7�
�Ԉ	O��_�����7���ś��On��Rz0Y\|����w013z��-�2���/~���fN#C�4"�g&)��	�xX���<)S���[�~TSD�u��WHq](�V�2Y��1�dx�!�+$����!���wD�0�M��`��FJ�z�I��g�d���!Yu-Eq��ٵ�`�.�
�إ�݌f����l1+���#f� �;�ͮ���h�
���eNV�������`�|ZN9�Ę�S�81��鈐�oe��2��,[vh�
��G��bӰ@��(f�K�������ƌ3$�
�a���dˢ�l&&���0%�qE7H��OD=�/��6T�S���H��n9��@�v`��<�-ˏ�Ox������՛��	ԌX/�9���S�ƻFB7���1�vT4V�,"��o�bE{V;۬����^Ӣ����o%n

����L����o�<�
�K
PG�a����<-���_gw�S��~
k6�}e??}}1��z?Φ�r�����L��j]zKt?�>��d^d�*]�e��>_͚�R���+ugˎ�c�!�BQu�~L�',�5Cʇ��fɱS�2�$��
<,@���
+�Ny�L�s��.VY�%\��=�
g�	}�`-

٨9�Z
eȐf
+v=
�[(��|�� ���{ܒ
�e���w�����ds�ߴ���	�҆��'$je
B_V"�r3��@ �%{��R}t�\�S Q >e����m��3u�/�ȩ
+������u��r��'��j��=u�FD�A��9��`����vX����=� ��o�������`�"*�#
���1-�
+
g%	dI�[�w/��S��m5nj�\�|�v�56[Q~X5Nˬ�k,�|��w�#�C��K�G�$Z��\l�t�*!���{��Q�sIcȦM�Z
����\[
�S�f+��$s�ͥX�
�#2��eR�n�L�
*M�x���S�KQfy��:Y��zq[
��<6��0�o�ٯ#�!�*�w[� �m�ì�v�kx|H�@��V�'�Ge�yam ���Y�P�W��v�w��<��2�<,g�֩�u��������H�#@�2��%vf_��Qm��V��@�t���I��'�; �P�¿��;�I�%�ez�C
�
�d[�}�%��Ţ�����ݎ
�f �AB�*�+����F

7�Ϧ�|���~�H��n�S
P�,�:a5�
��P[���a.!
t���
��0	ѵ�>�E
�[
�c^u�L��!��������(��� �#p%�]�t�[�=�gK[C��|5��f�'�ټ�K���
+`�)�\
�NEJA�I�� �F�IY���5@�|I�7�f���3l��K
*
��#s/��5��o���%�nA��n�g{�=*�!l7�)��%�
V�nl�����
�v�~�d�
΅I�
���Eu��

�2�s[(d�@y���-��i!b����<T�a��u

�z��15P �W,?Ѽ�gfQy殗(X˃�R�nH˚.U���R�z�U�x�g��+4���%�M,i
+�gh'c��;�0|姜gEِ�;�ykS�����{��
ޖ	���]
�K�גTW̤���In� �"&��%���Cj%��IMr�a�j�L%:��@���&+N��}�z��N>�[O��~�Y�IĄ��+[����u�mz�$n��2��C��Nb	{�֍�v�Z�8�nerz.�խ�Y׭�B�u�B���`���UC�u+��'�c���H+up�Ѽ��:��N>�~��6-�E�#so=�Dm7/�����k^�j_M(=�{ɰ��
��d�$�Ӽd`_�;qf���B�	w��6O�Px�?)C����
Һa�C�.8��M	�k�.1
+��ܺ�u�OӺ��ױpѴ.��
����J\�>�`�U��u��A���w0��J_�

L�ޠ�&�?w0�q
L�C��bV�%��B�k=fD��2�dM�
���D'Oh���t����v��y,�cK���REmc��S��Ǵ1��F7��j��ژN_r?D@��Y#�.�D:b�

���ڞ�c���ӡp
>�0��-L'n�!X�dw�x�i�.�8.�@`%�D炉�h\.�dz��R�G�ajI<���p�^���#��悷zZS�΀
梗
�B�
ML ����%oh����m��E%�����޳=L��f�)!$�
1g��^x�?�%W�Rp�3�'�-�
�~� q��92�*߭?:@��C����P!a\���`�u7���f�L���
6�G�6�� o�Xۧ��n�\�����a������ſ�4�b$ .����r�T��M!|N��ׁ	"�<�>^�D����n�6����A���ˆo�N
�ruuyy��/��=�������<l ��o�9� [...]
+endstream
+endobj
+12119 0 obj <<
+/Type /Page
+/Contents 12120 0 R
+/Resources 12118 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12045 0 R
+/Annots [ 12097 0 R 12113 0 R 12114 0 R 12115 0 R 12116 0 R 12117 0 R ]
+>> endobj
+12097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.008 673.894 276.143 684.798]
+/A << /S /GoTo /D (index_BHMZ05_widening) >>
+>> endobj
+12113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 584.081 362.353 596.415]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+12114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.456 449.748 371.442 460.652]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+12115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 286.175 276.047 297.079]
+/A << /S /GoTo /D (index_CC76_extrapolation) >>
+>> endobj
+12116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 196.362 362.353 208.696]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+12117 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12121 0 obj <<
+/D [12119 0 R /XYZ 89 770.89 null]
+>> endobj
+12122 0 obj <<
+/D [12119 0 R /XYZ 90 646.048 null]
+>> endobj
+12123 0 obj <<
+/D [12119 0 R /XYZ 90 555.697 null]
+>> endobj
+11770 0 obj <<
+/D [12119 0 R /XYZ 90 509.072 null]
+>> endobj
+12124 0 obj <<
+/D [12119 0 R /XYZ 90 504.589 null]
+>> endobj
+12125 0 obj <<
+/D [12119 0 R /XYZ 90 433.858 null]
+>> endobj
+12126 0 obj <<
+/D [12119 0 R /XYZ 90 380.169 null]
+>> endobj
+11771 0 obj <<
+/D [12119 0 R /XYZ 90 345.499 null]
+>> endobj
+12127 0 obj <<
+/D [12119 0 R /XYZ 90 341.016 null]
+>> endobj
+12128 0 obj <<
+/D [12119 0 R /XYZ 90 258.329 null]
+>> endobj
+12129 0 obj <<
+/D [12119 0 R /XYZ 90 167.978 null]
+>> endobj
+11813 0 obj <<
+/D [12119 0 R /XYZ 90 81.969 null]
+>> endobj
+12130 0 obj <<
+/D [12119 0 R /XYZ 90 77.486 null]
+>> endobj
+12118 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12137 0 obj <<
+/Length 2561      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o��~���SK���/n��l�4�:k7/���%�R#�Z�����93
^��.�d�h��4yx�s��f��}���3lo�������EIet}
)n����4��
�	�8�

'�2��
Q
g��Y:͓���y�?_\|���}�J7W�d��~����=!
��$����+�@�HyMp=�� �DM��>[$E1S����q�\/�2��|L��|Dt��&�&b���y�����3lpD*��t4Y�}�	GSx�
��
=9�e�)��"�:��
�v~6��gBֺ1$��uY�i���(�sa�\!�uMP>��U���uC�
+i�z

�zذ��qDy�ͧC���`Z��ő�f�-��!�b���F��E2
�x�c�d�

�fW�)2�4��
.�"k��d�n
+�!��)�r,��:�:�/�U1�VŀhA�^�D�H
�NV>��Fɓ�T
�E 3]ަ�*���
H�1�
+bZGc���sӍ]-u���w�@Mi�h9��i,k
+O��u�=/qWb+!�ј�rƺ��/�i�ݪ	��Ҟ�F\6+~�������� ��
��q��˙/��¿�pU]�2���]Z��Ұ���4f6���o��-(IE����EȰ
�e���}ׯ�j��fw��S���-GD��$cH��+�|�l�u»y)0Қ O��&�
��*")<<R� A���Pjqݤ�$c�S�n8q�<L�S�[{A$"Gh�=���y��y-�M[nF��
�j�Y��G�U��i�XTw����e��58�%v�{����W�f6���EY�1_M���_Z�{�Z|�z����Y%l̠L��q�ܪ�\]w0?���s�H]�T��+��WQ�p������f@�hK�yr�H=y��ZUV;�<{���
{�E�Ux��5UVV7�F#�*$�Ő�c&y��:.ˇ���W	̦����+_w�$/+᯻<[��4p�&hP
l�j;���%�*J+b�G��C 5�9��K�c�t5WX_�ʈזt& �j�!j,�ƀ��~�O{��]ϰ<-
��G��pw�n�?l>q���.��NM������+h�a�4t<0|�� [...]
+) �T(M��u��}8x�@RF6d7��
 x�+�+�s��u8���l��瑧��n
+_K�(�Pk������"]ݗ��4�G�>=�
����<�}`�P�z2�$����3e�}׀

NX�QZ��;{�c�}.p���.���
�;�����+
Y,Ԛ����c�9�
U�l���M3.o)8�U��#��ˍr��g_�%T ���}��ӎ���k�a�
=�=���_�����7ة�
�8�vv`ZH���q�فi��Ӝ
!��
���s]�.3�r
�:f�=���'��
� 6�����R9�
+
��`�R��'�f;�I�/%!����"��E��J�_KXF��ޣ�~J�n1����t��c1b�����:����a����}�b�N�0HѴ�]�d>�Ș�j�0Օ�p���
������Iv�9�x�P�$5zz��k?�� ?R��
�@�f�H�Qg��	~�$!�J���ḑ�$��Xg���B�6�o��it��a��w��ts�]�2�_��_��ا��_���a["�D��� ��^f\^~_���H�?ZH����dU�
��v��
y�!Ad���VF�y
I��)S)�sT���� [u�
\7�uV����ۇ��u4ɖ�Ŷc
�r�����,�<�<\���=�� 
}
+��8�3��z��ܻ�������K�='����P�
+endstream
+endobj
+12136 0 obj <<
+/Type /Page
+/Contents 12137 0 R
+/Resources 12135 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12146 0 R
+/Annots [ 12131 0 R 12132 0 R 12133 0 R 12134 0 R ]
+>> endobj
+12131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.334 285.378 236.659 296.282]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+12132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 230.095 335.755 242.045]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a60e481255ba2a7e0d44bb2fe0c14a392) >>
+>> endobj
+12133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 120.211 243.45 134.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12134 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12138 0 obj <<
+/D [12136 0 R /XYZ 89 770.89 null]
+>> endobj
+12139 0 obj <<
+/D [12136 0 R /XYZ 90 658.004 null]
+>> endobj
+11814 0 obj <<
+/D [12136 0 R /XYZ 90 537.963 null]
+>> endobj
+12140 0 obj <<
+/D [12136 0 R /XYZ 90 533.48 null]
+>> endobj
+12141 0 obj <<
+/D [12136 0 R /XYZ 90 462.749 null]
+>> endobj
+11815 0 obj <<
+/D [12136 0 R /XYZ 90 344.701 null]
+>> endobj
+12142 0 obj <<
+/D [12136 0 R /XYZ 90 340.218 null]
+>> endobj
+12143 0 obj <<
+/D [12136 0 R /XYZ 90 267.355 null]
+>> endobj
+11816 0 obj <<
+/D [12136 0 R /XYZ 90 220.73 null]
+>> endobj
+12144 0 obj <<
+/D [12136 0 R /XYZ 90 216.247 null]
+>> endobj
+12145 0 obj <<
+/D [12136 0 R /XYZ 90 145.516 null]
+>> endobj
+12135 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12156 0 obj <<
+/Length 2889      
+/Filter /FlateDecode
+>>
+stream
+x��[[w��~ׯ�SK�c���]�=yhj�I�ĵռ8>:	I�I�@������)	n_D�X��}���pp����]^�|#Y�(�apyD8�<B"�o��Â)��x�S�B�H�S�������/�����ח\��b	$U��]|���
��S��Tpo�N|n��������Q�/���0"
U�0�$
),,;����}��Yi�
maw����!TNro��t�~k�`�(E�Lj�!�_�*�O2���P4��((��(��CĚ�wLCE��H�o�4e�y�*͖
/���tsK&��]�U�ZǬA1�9�a�{�PN�8"���3�
9)�xpW�˻"_R��ϖ+J�"�Ѳ�|C����B�1�;��.���E��k����k�
��Q/�%f�M
+:-!
+Vi��w��J����w�Vw��.��������.qQ�5T�:U���"�`��$�,�"�5�n�����d]����7)c%)R�+BP$���8͒
�x^1�I�}�
���L��д	!>#X����HI4k�x��ĩ�ã���F(#��+�1^T�n����j��.ED6��]ѣ.��ݪ�}��;�h��
�
B7��;A`����%�<�8��,�@&Y/�u]ŷyo����{�,�#I�)Y�֍0>�%j�wD��^�._����
&�R
��]��RH
Qc���Y	����ۻ���)F
Bm�}���z�߷��k��
,O��e[C"�o�$��:��X`�Ӭd%i�f'1x�J{pmw�y.���ZR)X�~,%���� d6�GJ�ߒR�1�*���m�S����4eFO����zч4�Bb����A��a i
�
��ڵ�����]�s��\�,�˼^
W�NJ�<l�4�u+�+���t�u��%�n����Y�0���j��'�� n���^�
�~Ţ)H+��X���T, ]�Yt�M�O��)�N�\g��. at uD�F�BB�Wj6�:��5F
�Zc�	Q} �'i�jv���97R�5u���" Q4�
��-q�5�g"�D́�
�{
r|�q�G
�����ϡy:
+]}@��[BG��#�Qqq
+:�N�ƴ�o�����B�X�pQ����S
�0�,h�5� }3�9d�	˾dP��:_I'�5	�����>�X�����@ڻx?���6K�
3�i	�'�@�T�H�D�G�l)�t��n��STY���"�-xY��pR
�
���d8D
|��f㤆�?�@5���D��
�ؓ2�ڣ`�*���#��u�K�\���b�u�����y�i�j� m<1P����0�0_n:A��<
+tbh
4.�'�3<d+]�	Y���=���
B"�tz�
~q~!���A(
2�85��Vq�d�i&�&`2��{\]$��\Nz~N�Et��e�~GsN��ӛ��u�pHJ輴�?��!��w��9���g�{�Ctu jN�{*űI45vft`���oz�P[Ʌ���V����M�f�C�:�}a��t�
�w�o��7��w��D�`&Y:�!L�NW����H<M�
C�a(�N��<���!�-zy2WW�|���4�5ʤns�֩1H��%JZ�ER
���v�H�����"�
~��gŔ\���^����^շ�.�E�실�&0qk�x�_�x��@֚��4���Zz�M� E	z�Z�Tn�����Ž�?�v�.��m���!�$��,�h���J��8�XO�d;m�0�X{�gD�m}	8e���0��<��׉�\�ۭ���Nn���n�
�=��{���%Pϝ�
���]�迶@��1��FӧksZ?;��L7Oxd�	u
g�\Ƈ?jGs��U�`"v��[�	�&�6�%͊�G�x0:��]��*��	��@9�
v5���!��V�۲��mz5쭓��|��i=����3쐾8�=��I
+ �͢O
x��%v�̥��}�
+�Qg�����{�k����l�aӼ���NH�&ʌ߫ڜ
+��6�Q��m��=�R�
�D�ٻ+m�oG�v]��})�k�C���vǸjŢh�㍏_-!=�$՛�)
�\Ѱ_S��@@�k���Rt�-�>R`tھ6�T}y;s����?�@J�7��̑�
�0�CM�e��6���16���M���Cy�	���_���� ���"��p�j3�N�+E���Y&�
����������3�3<�fW�I
�(�mp��ҧ �L��j0���*�U/���mx��!�k���'���
R�b��:�>��
'6y�6�r�k�A�q������ �)�yC�^]��
�)Ck�.��y���

+�b� :��O�a
W�������M����?���N`7����q����
�
���(�켱�j�f�v�>���x� у��{����
`.@���}� 3fHqΦ��!Xe���V�� �`��q8���P���ߖ��4�OBgB��W�����X�����m��o�|�A�j���P�߱!�}ߛ�9o碏��`�a�h��}�
��
?�[�$�}�����

��q�/q����Y�N�)4̂���Ȕ�Ԝ#��)��)�u(qr��)�6� [...]
+�p~�8;�S*
l�ܳM7Ф�D�y���'uo`y�ܰ�O;���_sQ�|����^��>ܖIv���n�6ڇ��k���G�;3�]%���ǃ5����|��
+endstream
+endobj
+12155 0 obj <<
+/Type /Page
+/Contents 12156 0 R
+/Resources 12154 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12146 0 R
+/Annots [ 12147 0 R 12148 0 R 12149 0 R 12150 0 R 12151 0 R 12152 0 R 12153 0 R ]
+>> endobj
+12147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 694.807 485.603 707.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.376 500.717 385.519 511.621]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+12149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 331.761 149.577 339.287]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.847 280.572 191.42 288.098]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.164 280.572 266.737 288.098]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 202.397 239.856 213.301]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+12153 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12157 0 obj <<
+/D [12155 0 R /XYZ 89 770.89 null]
+>> endobj
+12158 0 obj <<
+/D [12155 0 R /XYZ 90 718.682 null]
+>> endobj
+11817 0 obj <<
+/D [12155 0 R /XYZ 90 672.057 null]
+>> endobj
+12159 0 obj <<
+/D [12155 0 R /XYZ 90 667.574 null]
+>> endobj
+12160 0 obj <<
+/D [12155 0 R /XYZ 90 594.711 null]
+>> endobj
+11818 0 obj <<
+/D [12155 0 R /XYZ 90 560.041 null]
+>> endobj
+12161 0 obj <<
+/D [12155 0 R /XYZ 90 555.557 null]
+>> endobj
+12162 0 obj <<
+/D [12155 0 R /XYZ 90 484.827 null]
+>> endobj
+11819 0 obj <<
+/D [12155 0 R /XYZ 244.439 205.55 null]
+>> endobj
+12163 0 obj <<
+/D [12155 0 R /XYZ 90 198.91 null]
+>> endobj
+12164 0 obj <<
+/D [12155 0 R /XYZ 90 130.336 null]
+>> endobj
+12154 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12176 0 obj <<
+/Length 2975      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~���S*MWX܈���L�&���t�u�d<�E[j$RK�v��� �
H],O
<�H�����~�q��蛫��\��Z�H#-��n
"�#�5�|[F?�F�c<�0'x����Ü�Y���J�Er����H���������<K6�W�.��z����	��S����u�x���7/�04",n^��!�l���/h�L�Y��m�*uw~H�bN�,����,�1̫�n�>]��qj��T�����_q����E1����6��u}����5�^��Gs�����Ra�#IR8v���}���yVZ�� ��p#�����TNJo�]�Ϡ�֘�h
	������	�q<�%p%CH�
��O8����H��
�[
�7(BfF�=�8e���^gs�g��f��M�9��ǧm�Un��փb��.:Q�
Δ1����L��'ֈ2o�7�"��x��9�Y?�.�~�)b�4>�
���
�����2Ok����}�ϋ"-wy�t߫�]wY�A�%����?�o�jg~��x��Wyᾗ��>E�K3
����F��@�/�ro��\Nb���>eB�UK
+:^��h��!�������{2��#�b$p�?7i�X�nӢ��x�G����։}u4N<������91cƉ�Jg�r��
-	�q��ۀ;+D!D�/d�Ew���
~볥{�bJ��i�t_�~ӹ1����G�n��H����-�F��hQ;��/m�p���׬�� Z0n�o3���[;�m
�
�1�/TBh��6�
z�(!4R"�l�9s�B

d
,��ԷuJ��+��]�_0f����j��Z��P�H�k�J�!�Ϊ�g)�Z���l��, ���wPBb>{YW�P�+��Z�X6������Á1�i׃&�2� J���`^V1���~
.$�J�_0��\���z���9M���	��
@�Fbk֛��+L��(1X\9T���g��Ū
,��V�[��!��/������
�|��gP0��.
+4��������d$�u�?�H��H`
H���G��nTHwp	 2D;�$D��
T
6X ���}��x�
��&����A	^#�������#�������
��dО{cHH��YT�wi�l���`��A�J�u�t�-���Y�^��z�#�}�0� 9�lj&f`���	�-���(�E��~0��o����
+�/#��l"�i�¢�6��3L[�(L�j�	Z��
�	q�a9 at 0��ް^y`���"�
+z������PHH�����af�b��m���cZt-�*��j|�,��m�a�̒���@IE;�K�fq;�i��!)��^�2],.(�vq<g��6�r�܆ú�@Y(��,J�3�Hm�q���,��$�
R7u��~�
+R_ÐE �h�
���������R~��0`���b1��2�.kAI��B�∶A��2�R���v��`��V*ٕ�К��=
n�R?W
�4��07�էUK�LVY?�����ˬ���S�C��4�
�t��5�����_��_�{��W�n�� �OC�j—Ft&��GN�sC
�#�[�	rq��t�z_%G�x�r�tDT��$�dV�
�^�ը�1
�k6,I�T5�Sh3�u�T���3��
��˿u
�wia��2�s58nq��5��
��xچ
�fk��6\@�_v��
0�gs�hsu�=��������

�|\j���l���D�cz�yzL��k������בk�e�
J��0��>�� ���
�H�
ԫ`x
�<Vez�Y����<�Rw�?�QC#���
G�P�}&�z�ɑEEV%�,]NU� �kQF�r��^0(̾ܔm�r�~��b�����W�'�C�*��6����]l<�"�F<=���$�9,!���"�2��;f�q�D�|��z⒜��Rc�#l8G�����*Ćq
K6Ɔ��7P�
��o��߂
H�7L����S)��������&�|m�l ��_Ħe͊N�
B��*w;y�l���O[�t���O\�g��lpF��A�[��v�,��lܭ�����
�b�ltӄ���C���Ț�
 dR�"�ޥE=�P�� ӣ?'")�nw?�@��^�
rL#;���>�	L!Ø:�gJ�t��w
u(�Z��m��m
��<i�gDEG����#t;}K�]�1�]�� �.H���1;$���cH6�����6��;Jt�^ �6zC�T�`XB��9�{��/ߙ8FĬ���X�#C���k8z�
��,�hp��;XAtO�F*�P��c_�P at MiKe��mh[�N� �/�#'S���~gߡ�t�s�w���6봣���%��
+�6ەp�u���=͘�bH����w�@B^�y;���FM� ΞA�c�d��--B��u.��;Ɠj
+�@|��JA���'H�׻�د$^V��Հ\߳���f��q�����7j_���<���v��g#Mu-�eϲ��s;%
�����5��)ӈ�˝
��<6ҟ�gǽy�

���;+�
+v#@h���1
g#�/�=�C�٫6�G��8��o��$�(HA�g���_
�@�O����_t��SYg�
�����e:�+�8n���
- ��e�Fb`�X0�8	

�cS���d�y�[+�hf�����q䦫����˽c3��
�R�V�"����3"#�+���R���M���J�������z���~�n��V������qꑹ�u%��
J?�'������'Y�����&4��E���n7�KZ�fg��
�x���r�~�l���|�,ks�w i��X��
�n��+X8h�k&[�X�����}��eZ�i
dzzA��dOM+d�����DvE����>�ǴQ������/�Z�8Db�;JpUU�����
�4{D�	����\�=�^������m^��
���6�A�m��~����6@����0t�Ծ��l6?�o��vˢ��.��b�/�
+endstream
+endobj
+12175 0 obj <<
+/Type /Page
+/Contents 12176 0 R
+/Resources 12174 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12146 0 R
+/Annots [ 12165 0 R 12166 0 R 12167 0 R 12168 0 R 12182 0 R 12169 0 R 12170 0 R 12171 0 R 12172 0 R 12173 0 R ]
+>> endobj
+12165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 669.068 379.76 681.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a60e481255ba2a7e0d44bb2fe0c14a392) >>
+>> endobj
+12166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 626.97 182.164 637.874]
+/A << /S /GoTo /D (index_expand_space_dimension) >>
+>> endobj
+12167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 529.604 243.45 543.552]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 453.036 535.938 465.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 439.651 226.824 451.985]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 385.599 362.844 396.667]
+/A << /S /GoTo /D (index_fold_space_dimensions) >>
+>> endobj
+12170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 180.519 149.577 188.046]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.768 180.519 216.525 188.046]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape_a16f76a07b461817e79f8f10811206810) >>
+>> endobj
+12172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.69 75.416 233.263 82.942]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12173 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12177 0 obj <<
+/D [12175 0 R /XYZ 89 770.89 null]
+>> endobj
+12178 0 obj <<
+/D [12175 0 R /XYZ 90 718.682 null]
+>> endobj
+11820 0 obj <<
+/D [12175 0 R /XYZ 400.69 630.124 null]
+>> endobj
+12179 0 obj <<
+/D [12175 0 R /XYZ 90 623.484 null]
+>> endobj
+12180 0 obj <<
+/D [12175 0 R /XYZ 90 554.909 null]
+>> endobj
+12181 0 obj <<
+/D [12175 0 R /XYZ 90 476.912 null]
+>> endobj
+11821 0 obj <<
+/D [12175 0 R /XYZ 487.765 388.752 null]
+>> endobj
+12183 0 obj <<
+/D [12175 0 R /XYZ 90 382.112 null]
+>> endobj
+12184 0 obj <<
+/D [12175 0 R /XYZ 90 313.538 null]
+>> endobj
+12185 0 obj <<
+/D [12175 0 R /XYZ 90 259.849 null]
+>> endobj
+12174 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F8 802 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+12192 0 obj <<
+/Length 2674      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�8~��P�Ve���
�;��9���N����!I�h���+��������!Hr��ּ���Fw�C��
���O~>����مb�%�����$��$$<-'�L�ه�_&LjD	_��?������o�og/.��8#��'@ �'��ٻx��׿L0b����A�	�
���۳��.�t!�欲���ES��'��.�������E�^^?�k�٬
��֍pC����Q1��*����Kc8A�&&	ET���յ3P�p�y;�)G:՛t��\�묨�L�0$p�##Q�8Q��b���VE
�”�ܤ�:��e1E�Q������d�1F���
 *�Ճ�ώ��/�qk�(�Y�
���y�I1E+�j�+b�gD�!𷺝�_����Z(Q���
O�!��S�,W�ws�q ��v�ɪ�X`?���Ldoޘ��*]5�,&
F<m�G���`o߄Q������Of���EHdA�Q
+	�"h�-�u�ڣ]���j��# �Ӱ�����
qP�����A���8�1A]�:`"Ꮑ��C��ԅ<=�
�o
�
�2Zm��n:���#�fs�&
[��7��?��]�ߺ�
+����E�����eD
���ŋ���
�
��� �%�
u{Y4�z�qF�4]���I�� I (2
E�NB���e�i�&�0��(�����L]F,#
+��q����2o�
�9�[ �E�ޖE��z{�nbNU
)�
r��Z�#bk<g����Ϗ-��y��ǘ��b�KbX

x��k�(|0^bP��-q��̩��:ɜZ#
�f0g~��h�5?���
�k�颉�,� 9��B"kCo�)+�ٴ͔#�Rs6���6��	=�����U�Hn�l
����1�:�G�O:*si"�Sg�#BJ"O�)�ʒ�A�n=
R(W]H�Ƕ$�E�q�'�(��	��n%#b8�]�,�N(�(��#��F1�]^��"�0�8��;��"���7>���%�:b�.e
��>o�F��ZR���}F^�9
5��(���$��
�Y�b���5wy
�-�C˜�=D���H7׈w�k�:�
+��dZǙst��_ݏ�q�&�V�j�j}��[�Ps&��`������2,:h}Xx> n�����}.#��˯�fH�%X:�沅��FM�
+�˾1-�&��Ƹې8\�飹�
����

6R@'_a�~l�H��)����[f7��l��HF�?���cXG(0�qz� J
c���䋆�{�l�$���]_�
$8N򡋚H���م���\v$�cz�傉�
�Ԉ�ޥ�]�`[��U
�^B��Z�K�ږg�B�d
��%c	���<*	3E`k��U��]-�b��0:��}�.��t�#�
D�H�����I?;}��
+��~��q��X_�*T]�"��qR�{
+�.�a���Q!mh���@A�ت�"��N;���;w��àJ�������:*�$
ZBf�̪\9D
��
�4{TTR���A�@i����F�I?d���ʳbY;�o�:p�&31�?\l�EcZG��r�]gE�6���'v���Q�`8
�����8�վ6���=q�W
���������k'������J�v�
�H8�4T�F�$�B�X>��xt�H!!$:P�Oc3 �i0��؀�&)5�
N��8�أ�z�ȠD�hbB$R��S��B�
��r�?
�	�
jZ5���ն�l}� ��hvA?P���Ӕ��ib<cv�)C?5[C%��*�TY
��}W�,a��^p�0���*�m �X�ܭ�gP%��=[��n 5ޘ{0��
+gR
�V`�.�
e[٩뺸�զ\=�e˪,�3�F��M��27m�
�����=�����k�l�L+;u�m��
+�6@�
+|
o���9��
]�����
�:(�͋qa=LLP�N��+��:�QBޫ��:�4��"h��
hYvj�:�@�����v�7>�~�Mz�f�?���Uv	-��w��ih��b������m��mVd�-wS��Q��\�3���0�d���L�|nJ��R��T�OV��e���۷�
>���K���x��o�M��Ƀi�k
Wn��E!���㢰����BYX�����\�~���
(��F
+�
+��
+���Uj����6����M�&:�
	2r�����vKs��$S3+�YlLSmwn)@�<��͑�`��
#��)�bJIi��qE�!t^�޵�s��46pa�Cd��.\��i��5���P|9� `����SO$E�ƺ���
�U
l�/Ͽn�sf{�F!>C]�]���B�t���{�W��c����-���L�ˊEv8`�T���{�<_��
�Sؠ��uׄ� �"�jT��%/��2����s�(�u�
0>;4�1kz Q��5-��y�MZ�l�b�����2xp	Qr㰠W�=�N�\
��ϫ�YW�OW�]>�WA�=�Ϙ��R�
�z�;$��{|��@Q�����}���<|��XL�=m5������o��g/�l�S	�:qs�7��g",��eGaOd��!?y��7w��:��j
+`O=����D��	4b#8^&�L=��o�vo8��T����YO'��u�wM�9��z{
�-Z���M�}l��p3Щu8�ɋ�m�_��Mn��
+endstream
+endobj
+12191 0 obj <<
+/Type /Page
+/Contents 12192 0 R
+/Resources 12190 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12146 0 R
+/Annots [ 12186 0 R 12189 0 R ]
+>> endobj
+12186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.69 673.483 233.263 681.009]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12189 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12193 0 obj <<
+/D [12191 0 R /XYZ 89 770.89 null]
+>> endobj
+11822 0 obj <<
+/D [12191 0 R /XYZ 227.473 636.011 null]
+>> endobj
+12194 0 obj <<
+/D [12191 0 R /XYZ 90 629.371 null]
+>> endobj
+12195 0 obj <<
+/D [12191 0 R /XYZ 90 548.842 null]
+>> endobj
+11435 0 obj <<
+/D [12191 0 R /XYZ 90 504.069 null]
+>> endobj
+12196 0 obj <<
+/D [12191 0 R /XYZ 90 499.586 null]
+>> endobj
+12197 0 obj <<
+/D [12191 0 R /XYZ 90 410.971 null]
+>> endobj
+11823 0 obj <<
+/D [12191 0 R /XYZ 90 384.941 null]
+>> endobj
+12198 0 obj <<
+/D [12191 0 R /XYZ 90 384.941 null]
+>> endobj
+12199 0 obj <<
+/D [12191 0 R /XYZ 90 285.264 null]
+>> endobj
+1233 0 obj <<
+/D [12191 0 R /XYZ 90 186.542 null]
+>> endobj
+418 0 obj <<
+/D [12191 0 R /XYZ 90 171.523 null]
+>> endobj
+12190 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12231 0 obj <<
+/Length 1249      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~���S&3ë(ŀn���)�5�SR�-;�tq%�Y��w��%Ev��h��O$$�\��<�Ao?O�cő�
�Yh�BAʢX2��KtcP�5��bLLJ
7	���dĈ��;o���+����h��f�~���A�f~�.�Q6{��&1�mxi�Ǒ�y��rLiC3�
�J�]��WŒ�q`
��'�wQ�%ڨ]nY0��J�G�
9�R���bG�z��d҈����I��U��fp�Z�K঩9d�S�a�n7�/���W�
-�'�,ip[i��7���9�<�Bbe�E8��L�>�Gs�F���	�a
����i��"�
�ǴL�ԴI�ܤ�z�E�-:��+�D��(����;����)L�@RILl���2 ���+��W���p�.��5���C
����m�cX�6t�Qrh;J�C�x���vn*#�&fCԄ����:�		���6��b�څ�[�dk/�J`QB�ު��
N֥�`���唈�J��l���gQäVI��z��qŧ�&GΥg�����ǀ3�
�#;|
��"��ʏ<7�uw��xOe��}�l:�X��]����ɭ|
�n��U���d�^����!������V��e?JF���H� ߪ[�ZR
,H��Ub
+00<�"x��m7�7WF�@,�ఓt�~�pr(
�;9�H��M��i���lv�ʼnw2QN�q^Ҥ�r4
+�M��Yʧ�R�~�^�S>���W�}ZNae`�dOЈ~S1�����Y$��"��u��["=K��K'
s:E��/�Db�}�w.��K�x-�%X`�$�
�r^��
�Q[���`�a
�?/�/��d=
I?Z�π��_�{�_���s�e<�<�a�7���:��s/)��m��@��_��8{O
������n�?o�$
0+;.�W�rDž�r��jdf�����>_�J�qD
���.� l�
bD
�5}8�0�JC����m8�4+F���Ϋ�@L����j������]ј\
�e8K����/�`�+OO3�X����<��6�����I˺i7�JLe]�o	�U���U[��@dw~�s{�*�~
+���]�$��U�{�#1�5���m�Z
+�Om�V���u� ��t�Z3��9�\�?R/����(��э�n`��i�y�
�py�
�:O�
r�ǵWѷ0�Ϻs�A��e+2
�>��l3���oש��"#��
�e��;W�J��G}|��l�U����$[��Q�_	U�j���:��ۀ��*��
+endstream
+endobj
+12230 0 obj <<
+/Type /Page
+/Contents 12231 0 R
+/Resources 12229 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12146 0 R
+/Group 12188 0 R
+/Annots [ 12200 0 R 12201 0 R 12202 0 R 12203 0 R 12204 0 R 12205 0 R 12206 0 R 12207 0 R 12208 0 R 12209 0 R 12210 0 R 12211 0 R 12212 0 R 12213 0 R 12214 0 R 12215 0 R 12216 0 R 12217 0 R 12218 0 R 12219 0 R 12220 0 R 12221 0 R 12222 0 R 12223 0 R 12224 0 R 12225 0 R 12228 0 R ]
+>> endobj
+12187 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 12241 0 R
+/BBox [0 0 418 144]
+/Group 12188 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 12242 0 R>>
+>>
+/Length 557
+/Filter /FlateDecode
+>>
+stream
+x��UMo�0
��W�X�-`�!@1`��
�P��ÐXw��i[��,I�
#!%Q�|���
l@�	���D����/@(��3�-5>�
�_?�����?���Ҹ���z�� �C����
��� ������rR�=�͸�Ns�8��`�4�xQP�8���2Ȣ��r�чnj
�0�{��6��̩����5�Ś�8'�-֊u%
��bi�!ԅ�[Щ4��L
B�5�i~���4��
';�D*��\JC�ɴ�v�S�r
f�.F���Վ
��҇��x{ā+ղ�
+�@�
�C����ʅ���eM_wس$kD�!�
�ȭ��r��@�3TI��PgY��ҦҤi���,LJ�
�P�jZsxs�
)��x�$�I6��>�9���J�%ô�+
W���e��v%߷��Ũ\V#Q�bsd��8.v��1o�K����ٛuFpIg��z�a
��\U��3�o�Y�����gx��༠NJ��'8/������m��x�

+]_4Zc1�&�l�
����ԹΫ죸+�vQ����ܜCRҽY�2b�]]�^�
�8r_�/,��X
+endstream
+endobj
+12241 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+12242 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /NRHWJQ+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 12243 0 R]
+/ToUnicode 12244 0 R
+>>
+endobj
+12243 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /NRHWJQ+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 12245 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 778 556 500 278 611 556 556 667 500 584 278 278 500 611 278 584]]
+>>
+endobj
+12244 0 obj
+<<
+/Length 12246 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mk�0����
��E��.�P����? &�Pc���ߘ7l��'���C&��/�
W�Yv��a���2߭$��u�O�����$L��n[V�Z=�Q]�����n��枞"�X�n�Q_����a���C�%Q�0E�+�*̛���>��*�����N|m�Xꙣ%9+Z��d��RT'n5�
�j"��_<
i� o����
O�"i<��J�<U)(GL�
+�
��@H�N�r�;�� ��
$=塊B,T!P�l�	O<A
z�����We���8����@���/G�<����/C�
~i�
~9
8��p���
��P%����v�����
y��
�W?-����
mf�g���%
+endstream
+endobj
+12245 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NRHWJQ+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 12247 0 R
+>>
+endobj
+12246 0 obj
+357
+endobj
+12247 0 obj
+<<
+/Length 12248 0 R
+/Filter /FlateDecode
+/Length1 2572
+>>
+stream
+x�UV{l�������qb�j�b;q����
+!�弜��M�pfHRg�YA��2H�
��PhK[6�
��iZ�R�bm6MC����ұN�#�*0�
��y��s��s�w�w�y�ι�~�cV�8+�7�$��?0������3��/��χ!t2>�W��{xk�8T9dS~>?>v`z�o�3�o�?2:�/��w!�??����� �
�y����L����
lz[7׊
4,���
y�z!7�4��12�KI����f���y���G�zo�k�ؾP
�.pE��x�/N��n��8+I,q
��b�a���f��(��&���,���R㯤
�q:�j����A:��\��(6�JMu���U�h{jz���XEN�玭�*T�@w�Ps����n�?*�;S
�Z#
gnVf�&M�Rgg��E�r��6S�
+�!�P
��a֑	A	�J���D"���E�&�-o~B�˵���#���dž(V���,�
_�P�jzbe������IhL\ۼ�$T�l�E#n�q����$n'B�&qya*���k�<�v3�������L�]��]��bW�ȇ��̩�g�'g�&�C����vn=��o�:M)�[�.�����%]Ĥ̜���
��lDJ9x�1��Q]�`lz%�;I!h�g�8�1˪�ސ���=�q��s��jKN���8K�D7�ˀ�!.�~+z����-
.nm�����XH�
_�Q^�Z#
�c-B�b5�\�
+lf
<�
:��
�Ye��vN�
YK�ÎH�S=�G��5Oe��#�Ȏ�
���F:�q����U�2���ӕ�3xށ��
+O�����~�^��z������Ӈ�G�/�E"��PH�+����gg��
��do��xot���*	[�ɦ�)����0ӁU�j`��ճ'��79����(���\���H�?0H���eI��O���B���(���#�����ۃ7�XM��0�����3G�詥�'.ML�N&uJ鿆�ʶ%�е���
�$�ݛ���(��U�
��L�l������

o��P|��
/�z�����'��ɧG/���xa��Wcp"k2
٣ �kch�>�94�zI!���l��6?{�M���&bv��*t�#�
�T��62��p�g4o�
�4����:K��������B�&!�Vp�U���~WA�=�`��lꊴFJ�s
Z�!����I{���9��-��s�wyQ3�W0��kVFa�OCC�k��Ws
�zMi��;yR��0j���d�Q���OK���
�رԑ�'���#>��>c���������Um(�ny[5��߼U:G�<�w	�sX0_�h��7��q	t4XZ[���[ٺ�|��o\�[7�tm�mmu5-A˙�#o������ΒHs�@��.��с��ѽc�a�C�1]�I���(�g��� }�Z��X
��
�"j�dpj
�`�
���رg�����\G�ޕ+�Nt���Ǖ�77�gL��{
L����O�������
�� �/<�m
�5�-M�MZi�͡�$Pn��SQ�}]�Iy� ���rl3������?�<ß��LWb�}��>�`2:�����qdUħ�9��.L憿֤�dRy]��V�B��r���ɓ��g##y�0%�i�Q)��ݘH`d��Ԕe	5k��<9.i�
G
�SPei at U��M��	�ף�����,�1��l&�G.��6��F�δ�
�dT<��
+�;�]�kޟV篟KU_*����U0*n���
՟�~ry��˕�G�<�>�毳^^�J��լ��%n��g��:�όx�+e�BX���#3W�1��|�����>ֳ"�
�=X��F��;�����^�'�����:
zG�
���G4J���R\ �)�{%��}���xP�
�΁�#	�<���
+a�{4U����&�ͣK�̃@��|�
+�)L�?
+�'@
+endstream
+endobj
+12248 0 obj
+1927
+endobj
+12188 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+12200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 492.208 224.395 503.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 469.274 189.925 479.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+12202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 469.274 260.898 479.202]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_ac24cc83f88a80ad3e3742f4c9f075db0) >>
+>> endobj
+12203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 452.882 422.545 462.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 426.856 224.395 437.76]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 403.922 232.982 413.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+12206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 403.922 347.013 413.85]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a6486267591c1b778ca5e1ecb2eec99c3) >>
+>> endobj
+12207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.643 387.53 467.717 397.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 361.504 224.395 372.408]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 338.57 254.671 348.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+12210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 338.57 390.391 348.498]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_aa533c6049f2d1352ad7659aeb6b0eb5a) >>
+>> endobj
+12211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 322.178 465.458 332.083]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 296.153 224.395 307.057]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 272.242 181.207 283.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+12214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 272.242 243.464 283.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a2b16fa08980a81f9666d911c13304d7f) >>
+>> endobj
+12215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 256.826 420.593 266.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 230.801 224.395 241.705]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 206.89 159.628 217.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+12218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 206.89 200.306 217.794]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a0d7c444f0642b60fb3a6d7f86da57707) >>
+>> endobj
+12219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 191.474 400.176 201.379]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 133.721 169.81 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8cfa8df0c1472235cf53c0b03c70d0d1) >>
+>> endobj
+12221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 133.721 309.485 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+12222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 133.721 514.653 144.252]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+12223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 121.766 227.553 132.297]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+12224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 91.906 169.013 102.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a7a1350528a7ad90dfdafa97409db9517) >>
+>> endobj
+12225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 91.906 324.27 102.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) >>
+>> endobj
+12228 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12232 0 obj <<
+/D [12230 0 R /XYZ 89 770.89 null]
+>> endobj
+12233 0 obj <<
+/D [12230 0 R /XYZ 90 521.955 null]
+>> endobj
+12234 0 obj <<
+/D [12230 0 R /XYZ 90 521.955 null]
+>> endobj
+12235 0 obj <<
+/D [12230 0 R /XYZ 90 456.867 null]
+>> endobj
+12236 0 obj <<
+/D [12230 0 R /XYZ 90 391.515 null]
+>> endobj
+12237 0 obj <<
+/D [12230 0 R /XYZ 90 326.163 null]
+>> endobj
+12238 0 obj <<
+/D [12230 0 R /XYZ 90 260.811 null]
+>> endobj
+12239 0 obj <<
+/D [12230 0 R /XYZ 90 153.137 null]
+>> endobj
+12240 0 obj <<
+/D [12230 0 R /XYZ 90 109.961 null]
+>> endobj
+12229 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F67 3022 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im19 12187 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12253 0 obj <<
+/Length 2843      
+/Filter /FlateDecode
+>>
+stream
+x��Z�o���E��B��>���^����\��۸E�$0h����D�D9���;��cɕ�\tH?I"W��y��,N���<�����d�F:�yry�h�H�����M�>eJM>^���\!�s��}���?^����yw������pB
��J����qr�H0bZ%��E�)��y���'�c~����'�D�R-7�z;���f�Q��by�</�7eC��<�}�
q�dd�h~�Tq���<��zy������ժ�����|^�lywuQ͖�Ջ_V�r��Uˀ��h�~���c��a�N�A
T�ը�f�Q�rN��W��u�~�P��ˉ���U�D��y}>!"�֋�v���2*)��&�B
�>u+)t�(�Ͷ0fh
i�B��:
V+���_�D��[@a����ґi8r�f��'�,ݗU�6|��q6������t;��x�����Ӷ�exq�򤌺���P �M�L;�Ӫ�*P�P�hi$Mz�4⸕_�rK�AIJuL���3F9⹲j��@�ʒha3
ѨDE�5_�%N���
q�h��� �F.�
+C�|X"�Q
x�2�W>�<����fV�bڥ*}��/��΍���\\�f�tB
��G��T,]�4�b��`lBU]��
E�>]�V�P0�)��b5/�:����
�C�{���\�I�`
䉢��	RX��\[�����`c��
�T��`C�$S�u�� %
)������!��	W&
�R�� ��Q at ipTH���]�J�+Ѩ��c���΋�Ʊr1�<-��#&%��QG�)�[𪀣�	�i57�����YG p49Na��]�
kk��Κ@A�)"B��p5P���Y��P�)A�fW�J�`}雬5vp�98�΄�`���a�X3����h��J�X|"P�ѣ�W
IIB��(&�1� ��@�� e�F4$	I�80GB
`�I�ke�vV%���Ex/�=s��]��d;u?�X�3��EW~uօ���a��HC�50�=!7i�ʸ�"7ߠrtUc$󏊕�㐈3(3L�DՎ*�7���T,��xM��}����U��=�BrT�����=�,@�שo]���z����[6�����O��^{�o7P�f2�LALPa�0[���J�b�zS-��@�If�QmL:�D� �{Q2��D�|�w���R0[/t��;A Ey�E�h�s�򠓰�;S6_o
i�݊���H���䉍��P��HM�e�-1��w*��
>!�a٤�eY�g��8��`5o>;�_
OY����8K띛
�} C��Y���u�8�f�jj�=s+ToA�0k���S�
+P)qI����`���L�E� 
���
�:�[ǡ�m�2��^hV�a��9؏A�`����!�-H�Hª�@�
+QLH���0K
cJ����ս�[U���
��7�ѼQ�>SЊuZ���{���Q(0�G��Z��!e�e-f�`Sm
�n����{Z��ua[~���u�0��Ɠ�N
1
D�����b\��Ii��M��q^9"���@1���%Ц)�
G�
���]!�`��s�r�?b�`�
���߈�A>4%�z����vN!������N�����ΓȢ����
+���XH �\/K�������+�@�k8r���i�_�
�
d
��1�ﭚ��9q�H,�I�G�m�!b
�D���
f��Hk��P�������������E"]F�ڢ���p´w�3�mQ� V���
�)�ki�z��8�P��
w���㽼Us�<�i�h
+��-�l����	����b�H%���p
A&��r����ѱ] 9A"9&f�U�M2��
4A��N`J�4�V��
ħ}4���v��76�k�v
s�ĜO��S�ڟo;Ѻrr��mrc�˖
+r��֤DS
��>F�Mpl�
_G�	Ja��5��@Lh�����2��[�2R������5Ѓ����@�!�Ŧ��|^mڜ�<K�Ã��F��פ8@��k�X~m�=;(ܳ/R����*У�+���X���|�����dKq;tz"D�:6F��.���]�����7
�cF[�Ҹ��$����+�1�,
+��9ao�D���O��a�v9�z���t�(�u�3'O��c�AI`���fPj<��
Ǐ6)�2�(q�U'�T�a��D99��W@�L�1 ��k�Nx�����X����1�9(�)�Z�����v���
���a�uUy'
+�x�3vGdpl&���|۞Ce��o�}�l��ҝ#A��C�EG��e¡qP���wfIQ%6 at P��px
�l�C �#q9H�R������� �^�S������^�Jǐ�����k'c����	
�O6z����3��\���
T�����_R�
0��a+���Es���	� \1��
_&�p/���Z�'7ףA@�����]%�%43D�=�r��W�N}
&3¡�Vm�x\X��H<��<�<��X�	Qa��BA�5�C�f�~|�g����:�(EYWk��4PHs�@�f�"�E
�v��-�}���b�\�I����u�
f�z[�?�
R3:�~��D9��58��Ϛ�Rᧉᡊ}ӟ1Ye���t�)Y|-���ɸ{��pF���QH��NL����Z���tv;�1��(
_�H\�V}?�D@��y7��"�t� [�/3@�#�.�
��#����Z��P�b"%�/�����?���K�W@�#���#h}
�һT�C���k\Bl�rq��}���\�y"D�m�M���kb���ܺ�G��2ވ�m�we�����B�lj�g�4�Z
���������nS.��e�L�{�BrWn�;�
����a�hl
+�Spd�
+endstream
+endobj
+12252 0 obj <<
+/Type /Page
+/Contents 12253 0 R
+/Resources 12251 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12146 0 R
+/Annots [ 12226 0 R 12227 0 R 12249 0 R 12250 0 R ]
+>> endobj
+12226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 687.173 276.535 698.077]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a18324115d64b5357cb01e4f5d00ea385) >>
+>> endobj
+12227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.753 687.173 390.238 698.077]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+12249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 650.826 284.284 661.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_abf06af1843d7e050eda09c687eed453b) >>
+>> endobj
+12250 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12254 0 obj <<
+/D [12252 0 R /XYZ 89 770.89 null]
+>> endobj
+12255 0 obj <<
+/D [12252 0 R /XYZ 90 703.776 null]
+>> endobj
+12256 0 obj <<
+/D [12252 0 R /XYZ 90 665.715 null]
+>> endobj
+12257 0 obj <<
+/D [12252 0 R /XYZ 90 603.482 null]
+>> endobj
+12258 0 obj <<
+/D [12252 0 R /XYZ 90 603.482 null]
+>> endobj
+12259 0 obj <<
+/D [12252 0 R /XYZ 90 540.831 null]
+>> endobj
+12260 0 obj <<
+/D [12252 0 R /XYZ 90 193.523 null]
+>> endobj
+7516 0 obj <<
+/D [12252 0 R /XYZ 90 172.681 null]
+>> endobj
+12261 0 obj <<
+/D [12252 0 R /XYZ 90 172.681 null]
+>> endobj
+12251 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F91 766 0 R /F75 562 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12299 0 obj <<
+/Length 2149      
+/Filter /FlateDecode
+>>
+stream
+x��Zm��F�>��
��=�B7�JN��ά&�3qf�Q�Mdah�\08�w��믚n0����xOs��KS]/UO����ֻ����7.�|�
*�����
+�8%�8�>�#��cl��A�
&��v�l2ʃ��x��������$�L
d�e4��������?\��ڐ�
a�u����K::��������`H9��Rs��#�a��y���Hm��J�������r�J�R�Ǭ!c.�³�� �s�ă���0��z��=���E2�W�/��^��-R������py��wlEp�
#�{��j��r(���z����H5��ru�~L���ݞ�0v,����V��@T��,���.*��$��W�T��,q�2�zlk����}K�q̏I��:�]���NC�K(��T�;N�IQf����Ԯ>�4"(\|�F�5���j4^H�mPM���A��Ӣ�x3�3��D�u�D �
�F[�d���9�D
 �A��3ȅ<�L����JfO�����OG�?I�� �dz,_>C_���{��8='��-Qc�%����`�AAq<���L���)�Iy���N?���4ZfQ��TF��:
8_���0�H�9#p�X��J���7t�A��<�/��x;N
r��X
3����RS�NHAM����3
�����e��&	��P�HF�
���L	r8��͂��ەQ�܆�e�]�9.tj�}Ȝ���Tq���T:a
+�*a�*
�}�K_
�Dza��<N��,N�Bm\����rY�8��Ku.��F��t�c%�
Q�P�l%� �z���q�^w��q��.Ų?)�2���j�A����k�W)��I���e=�P
xXC\��Ƹ~
42���
bC��1a�F�	��43�h���!�	��m4��E�+օ4#p�FRe��N!Si<C���6 ��cH\$��ǣ�;��[��"���VsHGf�zA�I��F�-�g�!�LE�s*��(m
�7)z�
b�^�vb�-Wk�1����=n�4����E.�uP�(��������X�)t7����$����B���
�����v:�nM�tp7��m��N�ۛ�4���7J7�A_ǨH� ��۵�\gc 1N
���
��څFS��,\+�=@�⼅��U�kN�2�׼�A2˳��fY�ht4�WhN䛎
PF��k�JaZ��(��U�
��*A�����QU
��rǰ�
+5�ô�ůz�e�ߺ.��y��{GYT�M]�+WK"0r�p���S��Du���:P�b�G
+��ˎ
+���gWӌ��aW#�J�
���<Z��BlG+3H�ߙ�0V6<g���(wC�W/�vtCi�@ww^��HD<ޙ����ݨ��>��n���
�k�7�u����v�7 z� ~5��� r^Oo%�!����A���W��K��&P�j�u
+CYe���7A�)PO�����8
�u${RbU�w3pGV'n�Ŏ
��nf��(-� �p =
��AG�)�6�C��z��\Ne��o֩6� A�i$L㠉�π��㦼��"0��(@�0�+�
�PT��P���w�t��4�������1f��D]/&׺f�)�G�F�
�������
��g��������Le(9��+=�����]�"9$J���q��l�/Y�||�gt�J���o�
^1�2�:��Q��C��W�_�s
�(�s��,�C��c�)J���*�����R������7����f��j��۬)�B��6�>�� ����#��xY�R�M�����4h���X�1�� d���/@��K���%�����2om|cv�a�U���fvW̫��H妄B�T�]��q��h��#)�;R��q����ǻ�*n:����_nǿ���A�.�ʽ����,�2����y�w ���G� ��	>
	 �iH8���^
�>
_9+0�����]
G����
���1./�I8P�<5#�p��
�s�]7�
���������V_Ḉ���#G����C!�o���p���
�B�
��E3�#��r�)��Y��
k��X��?�����\����aQ��7�������
A��_��->�ۯ�hq�������|����l>aRE�x
�'�瘸.�V����������Yo3p��s����
+endstream
+endobj
+12298 0 obj <<
+/Type /Page
+/Contents 12299 0 R
+/Resources 12297 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12307 0 R
+/Annots [ 12262 0 R 12263 0 R 12264 0 R 12265 0 R 12266 0 R 12303 0 R 12267 0 R 12268 0 R 12269 0 R 12270 0 R 12271 0 R 12272 0 R 12273 0 R 12274 0 R 12275 0 R 12276 0 R 12277 0 R 12278 0 R 12304 0 R 12279 0 R 12280 0 R 12281 0 R 12282 0 R 12305 0 R 12283 0 R 12284 0 R 12285 0 R 12286 0 R 12306 0 R 12296 0 R ]
+>> endobj
+12262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 538.468 501.708 549.372]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+12263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 344.968 225.331 355.872]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8b7aa1436b25cff4dddb7ce3710003eb) >>
+>> endobj
+12264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.808 344.968 295.451 355.872]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.102 344.968 466.491 355.872]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+12266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.983 344.968 513.996 355.872]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+12303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 333.387 147.454 343.917]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+12267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 303.682 225.331 314.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a17c576fa2e9e3796a7d7264e1e07ed98) >>
+>> endobj
+12268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.669 303.682 337.121 314.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 274.351 225.331 285.255]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a919cbef16537d97e2cfee77af9f47275) >>
+>> endobj
+12270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.147 274.351 313.6 285.255]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 245.019 225.331 255.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aff0d1fd8010233de587efc7c369e5642) >>
+>> endobj
+12272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.669 245.019 330.496 255.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 215.688 225.331 226.592]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a95bb13da923b1b8d4af02f551b121b1c) >>
+>> endobj
+12274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.147 215.688 306.974 226.592]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 186.357 225.331 197.261]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a09bc61764011405fa7116db68f86966f) >>
+>> endobj
+12276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.73 186.357 311.287 197.261]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [333.635 186.357 409.101 197.261]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.431 186.357 513.996 197.261]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 174.775 157.407 185.306]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 145.07 225.331 155.974]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3d6de44b038048aa085ddcebe17afcc3) >>
+>> endobj
+12280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.424 145.07 326.366 155.974]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+12281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.338 145.07 424.804 155.974]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [475.481 145.07 513.996 155.974]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 133.489 173.457 144.019]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 103.784 225.331 114.688]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ada897960c826778c906bbac42b4adc32) >>
+>> endobj
+12284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.498 103.784 274.752 114.688]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+12285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.94 103.784 373.406 114.688]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.12 103.784 513.996 114.688]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 92.202 123.096 102.733]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12296 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12300 0 obj <<
+/D [12298 0 R /XYZ 89 770.89 null]
+>> endobj
+12301 0 obj <<
+/D [12298 0 R /XYZ 90 720.814 null]
+>> endobj
+797 0 obj <<
+/D [12298 0 R /XYZ 90 486.84 null]
+>> endobj
+422 0 obj <<
+/D [12298 0 R /XYZ 90 479.342 null]
+>> endobj
+12302 0 obj <<
+/D [12298 0 R /XYZ 90 364.68 null]
+>> endobj
+12297 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12365 0 obj <<
+/Length 1862      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�6~���Sf3C��(��Ң]sY�+��Pl�fK�$'�~�EJ�lٖsqӡȃ
�<:<��

�����֛�Q�q��SK �ڮչ���#s῾��In}鼳��!"\��>�8w�Գ�i��A���6���޸��
��p����u�5[�M�:��6��/����v�C=���|�m��<���HpLT9�ȽM�x2�S�:
��b��͑�xy�_u��%1��f�c�j�
7߆��o[6k��
+�L�1����V�(
�`}x�<ֶ��	f�a��1���E�q��Ѭ�A��=��^��HKQ�>�m[4?c�{Q��k^�5�G��R
!�
qg�]
+����]Dt9D��E)„��Ue� ��:��y��(m
G��T���Y�x�'IU�z�v��m�~��{���ж��a�8�|����ǥ�(8H��<��
+�u�!:���p�
��
M�Q?�|��e�
���g7�i���b�VE�@6�F. �&6���W�A#>'@]=qq�6@����͎N�WC"7�ʳ�a)���0�(��/%��&�����D=�� &`�b����щ�&�0��YT{N�x͋^���m��"
٪ �MA|����� J�DA�
+��CUA�0(u� �� �Ep3rw5�-j��=�x7R��R5�������&�`�S��]����W�瞞&��Eܢ��B?�i�{Ѥ���!BQ�"��<��G��Σ�D_֗�����W�ʠz��`�
+��G�`(���`hV��rFv8��-#c^��S�
:��n
��@ Wl]̭nW����iV
+�M1G��T��V��+=+`a����T��Pr:��HM������Fa��M�����o;�mJ�1D
emQ8���^������F<����UU�Z��C|��E�ȇ
�w�&� Q�A8�a>�X2W湶M�
����`[@�sr�>cL��w����u$���Q����$b _��C�1�h�˫�k3�~ M��� T��^k���`��M���n+�
î�h��8Cx
a2o�S�CQ�4Z���&Jum�A�m�����39�Jdμ��=%t�.ҡoXs��ydn�E��f�73�Tɤ��-�5�f�rb��aj凲�)� �����}�:s��d���
P�s&}��4�v����x~+��h��)��(J�pP�X�y�4�$�%�Q3eS�՛�J�{ пQ{�0@;��t�� 
���� ������q:�y%�f�8�����i΃�B=�?�捤<��F);حC6^�lv=�Q#�;[�f����Y̌u�tߏ�~�}i�0K�|��j1y#�5�şFKH)�c�z�t
�?�ia�cX�
�j�3�>*���~�=DtmR<Ζ���{5K`�Z//��n�7�p�=-�M{���A�P�AO�V�6d�fj���-�6B�=��M)��P@�O����Y���jT߸���sc>��*��\��)���(
�{W�cg'�E���X�S����2�%+��֑�쪅wlZw�t����$Q��{�U���
�y6�F}��4�+靔a(dp��l����P�H�U�1�	�`�p��ƈ��0�g]�~��T�pV�3,;sz
g��o�x��Ȯ���G�Ye�`9���r�t�x���TPTD�b(��������ő��Gf�8$���
��6���a{“
+M\�g|��ݾ�1��*Z�cօ�0&��`�60„g'���;{��17ߎ�u����6�k�
��.��eȁ��6�c�����۠D�?�!����4�RCQ�V�2��aD&����ҕ��(��?���
+V:E�x��i:����z:Hd8@��U�-�U	�y��M�o>�b�W����R�
+��"�ڔ
+endstream
+endobj
+12364 0 obj <<
+/Type /Page
+/Contents 12365 0 R
+/Resources 12363 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12307 0 R
+/Annots [ 12287 0 R 12288 0 R 12289 0 R 12290 0 R 12291 0 R 12367 0 R 12292 0 R 12293 0 R 12294 0 R 12295 0 R 12368 0 R 12316 0 R 12317 0 R 12318 0 R 12319 0 R 12369 0 R 12320 0 R 12321 0 R 12322 0 R 12323 0 R 12371 0 R 12324 0 R 12325 0 R 12326 0 R 12327 0 R 12328 0 R 12329 0 R 12330 0 R 12331 0 R 12332 0 R 12333 0 R 12334 0 R 12335 0 R 12336 0 R 12337 0 R 12338 0 R 12339 0 R 12340 0 R 12341 0 R 12342 0 R 12343 0 R 12344 0 R 12345 0 R 12346 0 R 12347 0 R 12348 0 R 12349 0 R 12350 0 R 12 [...]
+>> endobj
+12287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 696.002 225.331 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3b08ea3b8fd40d91de352d9309f28428) >>
+>> endobj
+12288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.245 696.002 270.845 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+12289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.88 696.002 311.607 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+12290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.428 696.002 424.894 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [475.481 696.002 513.996 706.906]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.42 173.457 694.951]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 644.39 225.331 655.294]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aef2494c66489b2b545c4ab0270fda40c) >>
+>> endobj
+12293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.813 644.39 297.973 655.294]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+12294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.144 644.39 424.61 655.294]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [475.481 644.39 513.996 655.294]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 632.809 173.457 643.339]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 592.779 225.331 603.683]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa14d5c151bc22663b9b78b7ec179c67f) >>
+>> endobj
+12317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.815 592.779 325.084 603.683]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+12318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.155 592.779 450.621 603.683]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [501.493 592.779 513.996 603.683]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 581.197 199.469 591.728]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 553.123 225.331 564.027]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3e222e92137c5646b6dc549ad55a48a1) >>
+>> endobj
+12321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.473 553.123 362.894 564.027]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.382 553.123 454.848 564.027]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [505.05 553.123 513.996 564.027]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 541.541 199.469 552.071]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 501.511 225.331 512.415]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1465c2671009eab1d8bffde1b4fb9a0e) >>
+>> endobj
+12325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.333 501.511 363.754 512.415]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.53 501.511 513.996 512.415]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.211 489.556 256.963 500.46]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 461.855 225.331 472.759]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.071 461.855 276.878 472.759]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a85ae65f464f7b414259190b60cb43d27) >>
+>> endobj
+12330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.215 461.855 415.636 472.759]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 434.527 162.657 445.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a625147567c82a825d4db81d626b9f4ee) >>
+>> endobj
+12332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 370.579 190.738 381.483]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 370.579 261.85 381.483]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a087db98367a61b27b10726a05a218dbf) >>
+>> endobj
+12334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 345.064 190.738 355.968]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 345.064 262.159 355.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7443f73507419c6878dd520aa9e9d18d) >>
+>> endobj
+12336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.216 331.634 279.072 341.539]
+/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
+>> endobj
+12337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.187 331.634 391.232 341.539]
+/A << /S /GoTo /D (index_Grid_Affine_Dimension) >>
+>> endobj
+12338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.523 319.924 210.384 330.454]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a658be3d5f34e4c3ade6b82cdf4d54ecd) >>
+>> endobj
+12339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.523 294.409 210.384 304.94]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4d614db695a0f4d0cbaa706c55457b35) >>
+>> endobj
+12340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 268.521 202.922 279.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 268.521 248.58 279.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac197524e1627e3a7c4e82bf95d9c0248) >>
+>> endobj
+12342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 243.007 202.922 253.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.42 243.007 296.181 253.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab865be417a99a98ca540f46e43ac6779) >>
+>> endobj
+12344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 217.492 209.547 228.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 217.492 261.831 228.396]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad455ab5ad0a5ee1824930508e1965754) >>
+>> endobj
+12346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 191.978 209.547 202.882]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 191.978 309.432 202.882]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abf3c153d5bdc2092cad23a9d48dfd44b) >>
+>> endobj
+12348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 166.464 205.692 177.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+12349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 166.464 261.312 177.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4fedc79a6ddfd74d4cf2f29ae27c35e2) >>
+>> endobj
+12350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 166.464 332.156 177.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+12351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 140.949 205.692 151.853]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+12352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 140.949 261.312 151.853]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a945094f7ebf99bb443e9757d2682b7d9) >>
+>> endobj
+12353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 140.949 338.781 151.853]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+12354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 115.435 205.682 126.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+12355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 115.435 261.302 126.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acaa1df5d97e0a808ecd90412dadb1274) >>
+>> endobj
+12356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 115.435 330.462 126.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+12357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 89.92 183.824 100.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adcb2fdf8455a113cbfaaab29c5a3ff22) >>
+>> endobj
+12362 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12366 0 obj <<
+/D [12364 0 R /XYZ 89 770.89 null]
+>> endobj
+12370 0 obj <<
+/D [12364 0 R /XYZ 90 570.285 null]
+>> endobj
+12372 0 obj <<
+/D [12364 0 R /XYZ 90 479.017 null]
+>> endobj
+12373 0 obj <<
+/D [12364 0 R /XYZ 90 451.316 null]
+>> endobj
+12374 0 obj <<
+/D [12364 0 R /XYZ 90 385.56 null]
+>> endobj
+12375 0 obj <<
+/D [12364 0 R /XYZ 90 360.234 null]
+>> endobj
+12376 0 obj <<
+/D [12364 0 R /XYZ 90 334.72 null]
+>> endobj
+12377 0 obj <<
+/D [12364 0 R /XYZ 90 309.206 null]
+>> endobj
+12378 0 obj <<
+/D [12364 0 R /XYZ 90 283.691 null]
+>> endobj
+12379 0 obj <<
+/D [12364 0 R /XYZ 90 258.177 null]
+>> endobj
+12380 0 obj <<
+/D [12364 0 R /XYZ 90 232.662 null]
+>> endobj
+12381 0 obj <<
+/D [12364 0 R /XYZ 90 207.148 null]
+>> endobj
+12382 0 obj <<
+/D [12364 0 R /XYZ 90 181.634 null]
+>> endobj
+12383 0 obj <<
+/D [12364 0 R /XYZ 90 156.119 null]
+>> endobj
+12384 0 obj <<
+/D [12364 0 R /XYZ 90 130.605 null]
+>> endobj
+12385 0 obj <<
+/D [12364 0 R /XYZ 90 105.09 null]
+>> endobj
+12363 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12440 0 obj <<
+/Length 2240      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�6~���SV��a\�����n�t�Mg��w_���� �[�TIJ�����B��(��i����c����|8 �s�`����\\��	P�QϹ�;v�G�Ĺ�9�G#AǗc<�
<
+�U8�
S<J����e��C<��l��mP��r��|��M$g��lL�Q
+?���7?\�'�6!
��q�|5M2�
�e�w����r<zGm�c˰.CA��>;1j5��e��f��q at Gr�^��TݜK���\��M��r.��d�v.��^9$
��������
��!Z�.G�w���矱3��
�X�;w���q)��K��ſ/���[���u�<�!@:b���R�'/�9�/9Xp��K[���n�Xu
��8�l�xL�h;&|$�\
��}�
�1*��$/���W���>����y.E2P�[*��dI^ڐԚ3��ZdiZ5DŽ�<R6��F�0��B�,w�T>����>�5�B�
Y��D&E^5�����"A*��`�ڄw���J�E�w�
fc&F�@&0�V!
��`�P�.�kР�*�!�P��t��Ƒv�h��r�M!!�.D��ż�F�A�*D0J�G�����W�:"T���'�"D"�W��2iC( XcX	�E�t�f�K#js-��(�� t���|3�VFE����0ꃱ�d
+bt ����i��y��Na���C]+�[��j�9
���>������'�c����t8B����!
yA�]�(���Y�r��8�U���c�a�k��B
�(�şn{
4}n'�
1��8�L�}hEEdހ;�4�$�o�Y��
l5��vն���h�ͮ'���;�u!��t���[���s��������S1�
���Xo�q"�tq�08*�>_p�$�!�Q*
+�b��@�8���$��j���s�P�(.�&����d��i�~hV�&��x�x����9�<rh
��<:� 
�	{�M%���6w�dO��^P�D#�h���ߏ؋������R�*`�]<z}f@�ަr��*�Q������z��
��)0#�^�u�Rc`
���V�f��A\D���^�k��p
A�k@��� 'N�>�����ͤIZ��\���^��I<�0��N�2��I��
��G��N6շ[i�0�Z�0�3ox'V���Sġ��[đr�����Q�^�X�����:�i�D�:S�
��p��֛�3�.�Yц�B�@^�6^�ߟ����Bu�ֶ/�ޓt�m�/���:
�S�^�fa���L�n!��]�E`�h��b13Zh� -��v����

�9�� GA��*N�I0`�H��&Ahԗ]���.�U��ϒ`ϑ�I���q>vR�z�؉s��҇�.����v J��v
��{��!e0�a�@T,fekg���.�j�e�b0�
�jOdP�N�wVmZ
���
��G�����k��j�8Q�
8dza��`
���!d"~���5C&|
2��!�`��u9r3�qȄO�
��ɜ
��f92�iĉk��
<P����Jng�t�j�>N"��O��Pa	lp�P��|ŹW0/���/�J;���v*����#
i+�
�=eS9�6��۳�
� �K���nB���;`�Y
*k�9�_`�W������V�<a
WU��PW��pU�j��[�J�\�
B�
iK����U�L�noSp���]��K�����N��P�֩�\�)����ex���J��%?H9X.�vI�nջ�*[��/�a�j'=ܚ��4�q/�$���S����NH��
���+�� Y�4I�27��[muU��\M�N��o���
��Y,��6
+w������|lg��|��M��q�':R�:�:���y8�M����
��� �"
���R�>���m��}�_yxԕ>V�md�C�;�T�~�L5q����϶�T���]\,����Z�s*w����شfl�M$F9-�g`5�=�kZ�9'C����-l��#�����A^E��8w�y��5蛋8�O���ED�myH
a�}^`82���'n�V�?cl�6@�m�g���'�pN�b�ɧ]^��	��� �
�����csp`�
�
�y�'�@<z����z�A��_�y	��~�V~�V��2�x`��oJ�\_0��/c�G3?��&��
���34
��J��:���
�Ib�O�$>#�/NY�Q�2x
W@��>auQ�7WW��m.�[
|}r�� aQe^~5�J��P��P�9P��_�K����R��_/0�D�[���a��V\�sŜw)(y�Q��?�
�
+endstream
+endobj
+12439 0 obj <<
+/Type /Page
+/Contents 12440 0 R
+/Resources 12438 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12307 0 R
+/Annots [ 12358 0 R 12359 0 R 12360 0 R 12361 0 R 12390 0 R 12391 0 R 12392 0 R 12393 0 R 12394 0 R 12395 0 R 12396 0 R 12397 0 R 12398 0 R 12399 0 R 12400 0 R 12401 0 R 12402 0 R 12403 0 R 12404 0 R 12405 0 R 12406 0 R 12407 0 R 12408 0 R 12409 0 R 12410 0 R 12411 0 R 12412 0 R 12413 0 R 12414 0 R 12415 0 R 12416 0 R 12417 0 R 12418 0 R 12419 0 R 12420 0 R 12421 0 R 12422 0 R 12423 0 R 12424 0 R 12425 0 R 12426 0 R 12427 0 R 12428 0 R 12429 0 R 12430 0 R 12431 0 R 12432 0 R 12437 0 R ]
+>> endobj
+12358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 708.331 192.272 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aec093aabb8eff04714d94a1d8f549c5c) >>
+>> endobj
+12359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 682.382 241.935 693.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab9fab28be620bda6bb6b19eea53969b3) >>
+>> endobj
+12360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 645.848 213.163 656.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac7206839379551b5fd12536a44d8af67) >>
+>> endobj
+12361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 645.848 351.922 656.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 622.476 189.901 633.006]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5258df790eeaa83139880fb3e0d5827c) >>
+>> endobj
+12391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 596.901 193.229 607.431]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a022e765ebe010dc476a32c653478b373) >>
+>> endobj
+12392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 571.326 187.689 581.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1c249b7c8fdb3fb39cfc57e2f15a9662) >>
+>> endobj
+12393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 571.326 226.693 581.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 547.206 228.895 558.11]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aaf291f349e897dc78d61d973c1af154b) >>
+>> endobj
+12395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 547.206 333.482 558.11]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 523.459 229.503 534.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1c64dc50a3b4915af285e1fbf558336e) >>
+>> endobj
+12397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 523.459 334.089 534.363]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 499.713 187.264 510.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4135efb3522da40668cba328060ea4d2) >>
+>> endobj
+12399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 499.713 293.213 510.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 499.713 371.148 510.617]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 499.713 455.727 510.617]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 453.053 187.264 463.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af9730fc103bc7091774217c4e1cf4421) >>
+>> endobj
+12403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 453.053 293.213 463.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 453.053 371.148 463.956]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 453.053 455.727 463.956]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 441.097 220.058 452.001]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+12407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 406.392 186.348 417.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4dd1972c589bdb54a5fd83a7857e53d9) >>
+>> endobj
+12408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 406.392 293.772 417.296]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 406.392 373.367 417.296]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 406.392 456.837 417.296]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 359.732 186.348 370.636]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae18801dc804c40ce09a8f1c59be9b329) >>
+>> endobj
+12412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 359.732 293.772 370.636]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 359.732 373.367 370.636]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 359.732 456.837 370.636]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+12415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 347.776 218.404 358.68]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+12416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 313.071 180.496 323.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0ec85f16ba039eada95199c90e8cfd21) >>
+>> endobj
+12417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 313.071 319.255 323.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 289.325 213.153 300.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a168a4e19029add524dbf799870bcf8bb) >>
+>> endobj
+12419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 289.325 351.912 300.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 254.993 161.677 265.523]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a17bc3014dc53a7bd3a40fc003741964d) >>
+>> endobj
+12421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 193.439 205.752 203.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9c9bdca928eade3b5ab3b23fc2edb04d) >>
+>> endobj
+12422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 193.439 276.595 203.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+12423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 169.692 236.745 180.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a63b08061fa91e50fd3c4d95cbf59c931) >>
+>> endobj
+12424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 169.692 307.588 180.223]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+12425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 145.572 212.377 156.476]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afcef4ec8bfd8a65014ee769a36e0e415) >>
+>> endobj
+12426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 145.572 289.846 156.476]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+12427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 121.826 243.37 132.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac9a9e60bed97446ddc353ef804e73fcb) >>
+>> endobj
+12428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 121.826 320.839 132.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+12429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 98.08 216.252 108.983]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0a6c5e81e21629102510fd3506314ab5) >>
+>> endobj
+12430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 98.08 328.042 108.983]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 74.333 247.246 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af2b56a84ab595b61c694994533eed6b5) >>
+>> endobj
+12432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 74.333 359.035 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12437 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12441 0 obj <<
+/D [12439 0 R /XYZ 89 770.89 null]
+>> endobj
+12442 0 obj <<
+/D [12439 0 R /XYZ 90 721.073 null]
+>> endobj
+12443 0 obj <<
+/D [12439 0 R /XYZ 90 697.567 null]
+>> endobj
+12444 0 obj <<
+/D [12439 0 R /XYZ 90 637.287 null]
+>> endobj
+12445 0 obj <<
+/D [12439 0 R /XYZ 90 611.712 null]
+>> endobj
+12446 0 obj <<
+/D [12439 0 R /XYZ 90 269.805 null]
+>> endobj
+12438 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12536 0 obj <<
+/Length 2914      
+/Filter /FlateDecode
+>>
+stream
+x��\Is����W��UV���U9$�'5��ı4��S,��$VH�P��_�׍�Jl2a[��ń�^^��{[�xv;ó��������fI���ff�Lq����ֳ�sf�ⷫ�fLjD��Y����r�ꗫK��٫����|�g$[@ �g������l
��aČ�}p�v3N|ng�g�>Þ�槣���$����GE"$#��4\�S��;������>�Va���D�ʋ�)����n�lP}C��&��C���,����0�Q�M��2�$8�'�0ֶ=G��6m�SX��c�cu�
�W�vN4GZ�'A�)�5��6i��\`<��x
o��;+���K�eO���$\-��?���zY�kcU;�
�s���b���!=���%��`R��<q�7IN��
�u�/�u�i�`0"���p,z�(�ǒ�-s$��r�
,0�d�/�!	6ѡS�nH�J/�Uz��iBm�4�%�Ȟ�ca9Vc-Iٻ4��G��S�hag�V�3��'���Z=�6^9�ʑx`[~�
��8j��*���
+0��G*����!�Ĕ:��
+�Ԣ�|9�8����5�#Ԁ��z�l��}T��b���;�Mp�
ۦ
 �����w�����1'�������&Z'k��ఉ�NeG��9�(� �L"S�.@¢nF~�-�>\
�y��3���>��z�
��~��@#х޽�6�(���9�*�<H��m�Y�yt[��J�����9�T
�C�l02�|Y��)��d����k��./�C+�y+8).�r�ov��
Pf:�( 6�
0$U�
,q53pDZ��ɐ
^�����Ef ��0���B�JA*2�|���4�k 
���v�~�j�S�;����)k�Ї�)��k�� -`�2��	F��9��	�ۇ�p}����u�C��<�68r�>!i��Dڮd9�Rv�8
+�ÇM
�:~.�Us��"�isJ
q�'#�0� Z�����в���yd&#aG�&�V��0Y^�����"�S����c]���ףtR#���9�d%b�<a~��()Hr�G�
ͫf8P��� eF*�u
o�����2���1hײ����S{��
+�tYv��W���J������$Go�ҥ����U�M��_��l�_Y�_�H��Ǜl��
��Uc�e�h%����f4a�
+ w���|�^��ad� �y�2\JvH��!�ۤղ��>���s
8h�r{��I��rl�֭
�Z�o�~�a�'-��776ݸ	W���%�%��>Yp1�?nvA-6��$(��G�E�Y-
+�m���G���r4���*�c`�`�Se� ���J5p����dG�P���}*���΢ ����~�Da�,_}�'a����vг̩�k����P�
 ��V
�n�ez3u�
^�9���uŻM
���}���6q�<�c�5̱�	�Dk7N&H�qr�d��'���S%���5��;_��7�d��b���T�Ni�IE�r�Сv Xl��w�)���|�g_� z�������R!j�ъ��[���
)�6�}<�phK7���G���>�[NBh���*6�a����ŠLbL�:�\��
x�1��1f���=q�j�]{�λ���=>M8��+ְ]��a��(8���ጂX�����يj�*J�?�G5ǿ;Oh�j�u�j��~T��)@5�Dy��U��[�����;���Sh>�
�0	���A�?
�Q-N�†5x�&Ͱ��p��������hI�m���!��x`���œȸ{��
cc�'�����#�c����1Ft�p�֡^u���@��W%�~��*Lp
d�GavI�P�B�M�ǽ:8��uw�
+"�/���X�)dpF)��e��
i�q{�Z�G9�,G�Qd~���t�\�v������_��(��ݪc�N���*S^��lZ�u�Ck[�KQ�T��JN`
TbN+���
�w��/�w>Uo�-��
�Ɨڎ���TT
+jr�WT
Re�h���
�St34k!
��:y����lӸ��Ӯ��HQ�j@:œ��m�LV�w�wꊿ��#�@ 
rPv��AMR���
T�?Y~t�'���GP�j������oZݔ���4M�
+=��rjTuS�/�g��r�f��&W��r�qn���H��RIpT(`�>�Qk���c
�v���
�M��'-ߒ�����]�sF��Wi���W���́�dn��Ul\ӆ�1�
ۨ�ޥ=΋)>优�8/;����4H�k(%w�$e
�;�<�ЩZ��2�۵�ʈ��w\"���
R�d���ֻ
�d``���#�3�p5o���
 %�����v�m�uQ>O�Z/�S�D�~�$�
V'�P��_�ٷ��ff�I��u
�1x��kc0cr~ ���<d�O�{�^Q�ۈ]E����kD@�Dn�FO�{ ��=��C�s��Fgg6�0t<
���,=p,��X"��X8&H�88n��|���0�3�����'�s��z?�k<T�����z��^6�/�[����{ ����v�>����ab���ЍP�
w%XwWBOvU�fW�5�,��PW��ܲ��
$`���Z̓HYF�!��.P��?G+`w�V�A�<`G��q�$8
�����j�R���e�5�+��w��_+RuJ�K����]k�4\:A��_���|� 4*��K�_� "`
uN�9���B�=����4�%p�L�.��p�K�J섓��y[qL�����u�W��>�;��{���#��V?�?��L�
+	�˿�a��-��/����|�q�����b�r��y��3*P�j/ (���N"Wy������ïi��i!����
���G��!פּ¤�C�j�$�^�9+3��[�����*M6P/�l�
����iݢU�;��
+��˛/7��	�.N�����6j
+��=���
+endstream
+endobj
+12535 0 obj <<
+/Type /Page
+/Contents 12536 0 R
+/Resources 12534 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12307 0 R
+/Annots [ 12433 0 R 12434 0 R 12435 0 R 12436 0 R 12463 0 R 12464 0 R 12465 0 R 12466 0 R 12467 0 R 12468 0 R 12469 0 R 12470 0 R 12471 0 R 12472 0 R 12473 0 R 12474 0 R 12475 0 R 12476 0 R 12477 0 R 12478 0 R 12479 0 R 12480 0 R 12481 0 R 12482 0 R 12483 0 R 12484 0 R 12485 0 R 12486 0 R 12487 0 R 12488 0 R 12489 0 R 12490 0 R 12491 0 R 12492 0 R 12493 0 R 12494 0 R 12495 0 R 12496 0 R 12497 0 R 12498 0 R 12499 0 R 12500 0 R 12501 0 R 12502 0 R 12503 0 R 12504 0 R 12505 0 R 12506 0 R 12 [...]
+>> endobj
+12433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 696.719 254.827 707.623]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa8277b2b91e8ea1a1e049e23b305a3bc) >>
+>> endobj
+12434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.643 696.719 343.096 707.623]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+12435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 672.252 209.627 683.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a82d076b6e20bf6bf31c5dc7399cffa6b) >>
+>> endobj
+12436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 672.252 314.791 683.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 647.784 240.62 658.688]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a49539890b469353a26a03151300162f1) >>
+>> endobj
+12464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 647.784 345.785 658.688]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 623.316 248.202 634.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7462cb31f797293eaf81b23e1faf1e1c) >>
+>> endobj
+12466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.018 623.316 329.845 634.22]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+12467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 599.222 193.577 609.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac1b48492ce30d0d7e7e61683a21e0a28) >>
+>> endobj
+12468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 599.222 232.581 609.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 585.941 248.845 595.846]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+12470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 563.795 193.577 574.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2c79439f4041447a648d8179889955a2) >>
+>> endobj
+12471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 563.795 277.691 574.325]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+12472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 550.514 247.177 560.42]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+12473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 527.995 223.465 538.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8d3933bc0c35af723fe62c1c062df074) >>
+>> endobj
+12474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 527.995 362.223 538.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 503.527 229.552 514.431]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9974447658c195960d694cc7e74ba119) >>
+>> endobj
+12476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 503.527 368.311 514.431]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 479.059 266.673 489.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a53ca09403244f4b551c5d8fb56d1f5f1) >>
+>> endobj
+12478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.01 479.059 405.431 489.963]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 443.632 217.109 454.536]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3ee94f79c57490afac29380bb06e4ab1) >>
+>> endobj
+12480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 443.632 355.867 454.536]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 419.164 198.26 430.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae5402f96e0359679d7f6ce049410a4ec) >>
+>> endobj
+12482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 419.164 236.665 430.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 419.164 353.317 430.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 407.583 246.458 418.113]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+12485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.306 394.302 269.939 404.208]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+12486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 371.783 212.768 382.687]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a921999e1013b4936bb5154049328e9c9) >>
+>> endobj
+12487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 371.783 252.959 382.687]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 371.783 375.145 382.687]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 360.201 286 370.731]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+12490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.401 346.92 277.928 356.826]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+12491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 324.401 250.099 335.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adc8193dea1c88ef84eb823e052a2cb89) >>
+>> endobj
+12492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 324.401 289.446 335.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 324.401 379.512 335.305]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+12494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 324.401 513.996 335.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 312.446 416.369 323.349]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+12496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.304 298.33 439.335 310.495]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.591 288.58 459.505 298.485]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 277.019 261.881 287.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa842e5c1b8cd44fdc80130394e4e9d29) >>
+>> endobj
+12499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 277.019 300.286 287.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 277.019 388.504 287.923]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+12501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 277.019 520.199 287.923]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 265.064 416.369 275.968]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+12503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.87 250.948 449.708 263.113]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.37 241.198 462.285 251.103]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 229.637 250.748 240.541]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a998b94afb082f53d3a9c40fddd1fca03) >>
+>> endobj
+12506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 229.637 357.317 240.541]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 229.637 456.145 240.541]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+12508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 217.682 202.344 228.586]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.005 204.775 446.071 215.731]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.547 193.816 438.461 203.721]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 182.255 261.881 193.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac0ddb3ecbb50eae5421827a802be365f) >>
+>> endobj
+12512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 182.255 365.272 193.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 182.255 460.793 193.159]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+12514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 170.3 202.344 181.204]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.222 157.393 466.67 168.349]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.37 146.434 462.285 156.339]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 134.873 239.984 145.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af9aee83bd717e4448cc4644256df8c78) >>
+>> endobj
+12518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 134.873 280.82 145.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 134.873 405.104 145.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 134.873 513.996 145.777]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 122.918 171.361 133.822]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 122.918 478.077 133.822]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+12522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 108.802 432.092 121.96]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+12523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 86.288 251.209 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8f776db845493e0c959fac93d1c270e3) >>
+>> endobj
+12524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 86.288 290.549 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 86.288 409.969 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 86.288 513.996 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 171.361 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+12527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 74.333 478.077 85.237]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+12533 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12537 0 obj <<
+/D [12535 0 R /XYZ 89 770.89 null]
+>> endobj
+12534 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F60 540 0 R /F66 3165 0 R /F42 539 0 R /F67 3022 0 R /F38 3411 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12603 0 obj <<
+/Length 3102      
+/Filter /FlateDecode
+>>
+stream
+x��[ks�6��_�ɇ�4� H�I;�M�Nڤ�M���4
%�6�ɒT\�ߋ_�e9����LL��p��>@���
Ͼ?�����ߙ�(�7;���x�{1Jf����9�ȧ�%�����jGg
��E���IG��UW�����&��l}��v͓�Z�`^��f����o�MH}�Ѕ���^�!�5����ɳŒ2<M���X�Aa��3�� ���U׵�v��o�,n�xl�t
1/�-	A!c���ˍ�|�ƹ8@�yF�:����O�8!�-��^�!?��7'���g	|��
#'
f�r�f�R�f��'?��R��r�� ��r?.l.}X%��{Y��es\6o
+��I�<ĺ5��1�$�Q�Á�\��4���q5kY-
��M,�q)��w�yqaY�7�zZ�\�͕�V��.9���E���v<Q��.��>|2�U>�*�y�5:�ƇҜ�l�"ׂ��N�8������<Xd at g�P���e�v�8�1�Ԁ� 
+b�
�?A�{xsA�4  
+9���;�aD`Ux`��ZY�`49m��b��qST6t1�&��b��RW�z��Ǵ�QD<=����'j<H���h`b9[�g��.��Fu�M W�k-��Y�
�{ZDZ�����
bDy!|��
2p
+��A� hU�8rR�30
+���?Q�πw0��eLH��}H�k�nxNR�<�%;�e�Q�0��"���� �0[�ic�X��
H&�;�·�A��	�VU-�RJ�l��e���oc/���Y5ym�F}��d�.6�I�K��CT&���
{z��+�\s�[vH|�\?�l����ybDr�v��E
C�}L����GΕj�.�Ts�����88�lə�G��Ȋ�t
g�:+�mu��|�	
ƨ�S�Q
L�
ɥ�6�b�2={V_��K�
/?LSA�_��8l
+\����N_��
���v���v
�W{�3p3�w�.ո�Z�7�7?���ݱhYR߅0K5
���E�0��$A�
	����O�5��χ؍"�:�[o�7������ A��9TQ8�$UQFu;/�(�銗���>�7�ōR��D���g��"UvY��㾹Y�˟~�^���ٻ������1}Q��8?[�" �*�i@��W
�k[���N�y3f�gN��
EY��VQW���D�#��`Ki0�]�q�B�O"rD^�����`*L�N���
�
+X�e�X�%�� L8�wŰ,@�@�i��x-$�M�SX�`�����wt!U�Cw)���5
��E�wb�}�d"D3�@&
A�ѐ���p�!
WvHÍ�՗���sg�_�k}�@���P��2G�T�2
�uQ�VA�']T)lz�
��V�M6E�Hhg�Έ�&X� 
!`	ZĠE��{�Y~��׍܉z����cM
�$�؍b�k��am���K�uS�y>J�
 
�
+���V��'I$mu� �Fb���cO+%jv%�=��O�x�$�
�R�m4n,����q���k���"t�Uځ�B^Hm�#�	*r�k���@�<@f���3���
��o��)�e!��mnDWY�������~]|%�MN�� w
�&� ��u�)�l�"�0D��?�E��`���:e[�!�n�
�h�Dm��ö�9���f�
�C��?�尸�U<�`|�����>�Q�b&3�Q�?�)��h� D9IY�[M��L����fg*Ii6dƢU�U�L���6�x��$C*�T��{��������)}��B�����1�=
|XPت	�զ���s��,i�8�Fl*ίR�����}�����/	�f�e�+�Axu����!����e:3鶻�P;R��PG��{�[��u[��ea�Ɍ
����
�ރשD�XF���a��D��e�K}�o
3���[xd�
+B	�߷�J>���D���Z�Pl���
���Q�]?�E��Fx�uMJ�<6
�^(�Lye�#���}�Z����
uu��S�c|d�wd��׮�������
 ��r\i�yg���g
Ei�u[�w���uX3�ڞ���}�<J���P
�R#�ݝ������1�����ּ�ɮ��4	Q�o-M�Dg]�)�	F�R�T
whԈ���^�Ʋ*�!�DZuɍb�Ȓ���<��4�����}@�b*d.�^S�@��Z�!���mm�Q��� &¶\{���G� rt�OLj�i��Y���-ڛ~G6�n
+��V
�2�'�`K�����;��w9���AFSq|�{����V�U�
��
o��Z��Xޝ��e�
���{���

W���ȳ;�*U)�t r�����W<H���^��e�
�Zo�87�#[���C at e�RGG��w>�<oJ(��:M�d�)��i��͝��]��U���P�v\�>�V[�$ϟ�ye��

%�VR2_~|��m�U�j��&n�g
� 
+��X8	��[�G��HJ��5�Tk��c�$xZ%ߖ>�a�#
K��I"�SZ��ġ�y�g�y�c
+�,��x�NJ��ߖ8����l�A�ߺdQ��ڲ�_�#�\M���Dp��#���H�^Ev�kgE�
t����_���`.pg�Ү�h3�'�
�:�Gx����m[�^-�z]F!ڟ�����p������u�T��(�fA���
%*�s���#K�d�=�Mxf�o�d�c&'���m�[+q��k
f~{!�+�z�^��fϬ?h��"�j�h��ۊ.��������s(q�w�f޴ᛢ�Eu���9�ng�~6ͣ�N78
0)2���r%����юZ��]��o���25���סu�G�{�SL�ь�:u
��dzqp��_n�M��~UuȾ�Z���{��:

+�{\䃔á�-�������E��T�^w�T�����*�}v�3M�Msa�
h1�hՏf�AIU��?3�?.��B5�9
5t�
���ީ��k^�EDӟ���*au�Wu}Z�HY�@�w�������\�(�dlз��
ڄ�i�秧��%d	�h��!{{	�[�]��p����ˍL6��ɖ�%Ð6z�h��	F��2���ky�<��8}�qf�
Pr�k��*��&
+endstream
+endobj
+12602 0 obj <<
+/Type /Page
+/Contents 12603 0 R
+/Resources 12601 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12307 0 R
+/Annots [ 12528 0 R 12529 0 R 12530 0 R 12531 0 R 12532 0 R 12558 0 R 12559 0 R 12560 0 R 12561 0 R 12562 0 R 12563 0 R 12564 0 R 12565 0 R 12566 0 R 12567 0 R 12568 0 R 12569 0 R 12570 0 R 12571 0 R 12572 0 R 12573 0 R 12574 0 R 12575 0 R 12576 0 R 12577 0 R 12578 0 R 12579 0 R 12580 0 R 12581 0 R 12582 0 R 12583 0 R 12584 0 R 12585 0 R 12586 0 R 12587 0 R 12588 0 R 12589 0 R 12590 0 R 12591 0 R 12592 0 R 12593 0 R 12594 0 R 12595 0 R 12596 0 R 12597 0 R 12598 0 R 12599 0 R 12600 0 R ]
+>> endobj
+12528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 707.071 456.992 720.229]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+12529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 685.747 224.57 696.651]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a963f864f2dad3d988b1b254f8a2ddfd5) >>
+>> endobj
+12530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 685.747 363.329 696.651]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.521 674.028 345.848 683.934]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+12532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.442 674.028 508.769 683.934]
+/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
+>> endobj
+12558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 663.656 255.564 674.56]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae5c1fa69782d6fd3c44e41b925599d98) >>
+>> endobj
+12559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 641.394 214.06 652.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af7046af1c844b59163bbd44aea38554a) >>
+>> endobj
+12560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.398 641.394 352.819 652.298]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 619.304 273.129 630.208]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a59159a738c609e2e8db047665af7540f) >>
+>> endobj
+12562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 619.304 352.41 630.208]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 619.304 495.961 630.208]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 597.214 275.007 608.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad13c6fb9dcb0424003eaaca0deb541d3) >>
+>> endobj
+12565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 597.214 362.877 608.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+12566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 597.214 472.148 608.118]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+12567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 585.259 233.986 596.163]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+12568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 520.035 289.866 530.939]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3afd25de2150c973aef332068fa29cad) >>
+>> endobj
+12569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 520.035 359.324 530.939]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 497.945 290.971 508.849]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3ce6d8050a4040c9cea2beabc7c28a20) >>
+>> endobj
+12571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 497.945 360.43 508.849]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 475.855 224.003 486.758]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa4c2b2e6f4d736db4dd9cf860b1d49ee) >>
+>> endobj
+12573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 475.855 362.761 486.758]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.962 453.178 442.501 463.083]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+12575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 442.806 254.15 453.709]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ada035c6b9498ff508b1486005b09681e) >>
+>> endobj
+12576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 442.806 338.263 453.709]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+12577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 420.715 284.585 431.619]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a355ac20e2a9b7dddcfc47fe612e4c6c5) >>
+>> endobj
+12578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 420.715 354.044 431.619]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 375.711 241.726 386.615]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a90667f8cdc3e2d0ee95f445288d1c6fc) >>
+>> endobj
+12580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.617 363.993 407.658 373.898]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+12581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 353.621 249.318 364.525]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af05b6221aff8bf1bfe8140fee0b091a6) >>
+>> endobj
+12582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 353.621 288.321 364.525]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 353.621 371.519 364.525]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 331.531 240.62 342.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7c243295a367d654adee85d3e0dc5042) >>
+>> endobj
+12585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 331.531 324.734 342.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+12586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 331.531 389.5 342.435]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 277.266 244.265 288.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af5bf0606fb2c69a7061feba433742ab3) >>
+>> endobj
+12588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 255.004 180.198 265.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6a92522d3632ac22254186400ed623cb) >>
+>> endobj
+12589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 255.004 295.434 265.908]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 232.741 193.029 243.645]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a57fc3d9d838fd7e20e80806307452a91) >>
+>> endobj
+12591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 210.479 193.029 221.383]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6b427a649f2f3ea994b981a7005bc49e) >>
+>> endobj
+12592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 188.216 165.911 199.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a885e896b320d1f4285b5dc92a20f8884) >>
+>> endobj
+12593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 166.328 187.689 176.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a569bd6bc031876c71761771dbef65b65) >>
+>> endobj
+12594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.557 154.15 476.544 164.055]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6b427a649f2f3ea994b981a7005bc49e) >>
+>> endobj
+12595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 132.733 202.902 143.637]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+12596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 132.733 300.037 143.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a150344138f9e354d0055c7d3fd5cd88e) >>
+>> endobj
+12597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 110.47 202.902 121.374]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+12598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 110.47 314.263 121.374]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acee9156486e9850613d6f29a3d498cd3) >>
+>> endobj
+12599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.819 88.582 199.864 99.112]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a044a9170ed6ce87a5639723422c558d3) >>
+>> endobj
+12600 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12604 0 obj <<
+/D [12602 0 R /XYZ 89 770.89 null]
+>> endobj
+12605 0 obj <<
+/D [12602 0 R /XYZ 90 678.014 null]
+>> endobj
+12606 0 obj <<
+/D [12602 0 R /XYZ 90 293.337 null]
+>> endobj
+12607 0 obj <<
+/D [12602 0 R /XYZ 90 271.087 null]
+>> endobj
+12608 0 obj <<
+/D [12602 0 R /XYZ 90 247.098 null]
+>> endobj
+12609 0 obj <<
+/D [12602 0 R /XYZ 90 224.836 null]
+>> endobj
+12610 0 obj <<
+/D [12602 0 R /XYZ 90 202.574 null]
+>> endobj
+12611 0 obj <<
+/D [12602 0 R /XYZ 90 180.311 null]
+>> endobj
+12612 0 obj <<
+/D [12602 0 R /XYZ 90 147.09 null]
+>> endobj
+12613 0 obj <<
+/D [12602 0 R /XYZ 90 124.828 null]
+>> endobj
+12601 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F38 3411 0 R /F66 3165 0 R /F42 539 0 R /F60 540 0 R /F24 537 0 R /F39 2335 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12650 0 obj <<
+/Length 1448      
+/Filter /FlateDecode
+>>
+stream
+x��YKs�6��W�W��`<I“t���L�&qm��d<�ۜ��BBI�� ��dJv_���� ��}�];7v^����O<�H$]�:�kGb��	~��ŘI>�8{�0�GD���x����٫w�s37z5}��)7��y<����^�q0b�w�B��)���9�3�V��0C�I�ӌDH���t4�L)�ǧ���7^T?ߪ�Je��d��u�&y�i}�}
���uqg�3�
y�,��@��u.��q^�_�ó끳B�
+<�X%9�~���=k���e�
��^�?ވ}����,�
�r�1�R�r�L�@��K�Δ^e�b3}�&��Q������!�|dW.�	�4\�u�b
X�� 	jB��:v�ۋ�I���!��43kS��Z�e,g���{���N��Kŏ�pP��8��͎@ f��
h���Sp���n/�D%u��>��cȕ�!��]l�Oa{��in6�ۡ�$W��	âpا�
+��L�Tx	!g�� �K �#���
Y���l¼q�I�@ɛ�wA
݇kr���1�J?�l!�U�.���7����`V�H�-i���
+��J�R�-�.��"��bs�,��Qt� g[T��Nw�/����w���ʼ^��'�m�$�_*�K����m)"�_vJOB�Ml{�A�T�dц�N�X����Z��V�
+j�-��r�=�����T�TUqV
���A�K�#k��3R���|��3���Ͳj�mN���b*_2L���{+5]+���=v��v2��=���C�Z����E��{�S��!�ab��we}!�xi
,/E&[r�C��9����\$|��	*�$�U]��gM�Ԛ��gT!�����j]Z�#
A
�`@�ȹ���\g*�
�3w|p?�8 ']�,� q�J�휏X�χ0@$�d
6h����g��w�Z��A��`���<��iV�1]E:JS��r=�-])²�1�Z
S;8��
h�ec��x0	
4��x
��]{@��F�sѾ_���R�D����}�z?0S�s
���Ƌ���(-0��f��
$\���d�I	d3�d��O��U��+���v��:!���i��)��ۍ��`��d[<Ay�%��u��u���-�h6=�[OFS�b���d�$�5�~Y'��B2��1$�d
�r7[0׷$s���r�������r
6}��5�(0��$�Z�Q2X�Q�V�{�.w��@�&���^����(��-�6���`B�v�4�{��r�h��	�����*���ťȣl�O.���CB�j>A7��2��d{\LVk��?c�
��Y����6�p��V�
+āhV��ퟞ�]��U��D�꿓o�d,&�?�>�h���
��2S�q��Z�sU}m)u��V�/��K�u�0�~
�[��G��W��\%7Z�u�6�%t��M{��
3N�4J�e
����?�‡
+endstream
+endobj
+12649 0 obj <<
+/Type /Page
+/Contents 12650 0 R
+/Resources 12648 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12307 0 R
+/Annots [ 12627 0 R 12628 0 R 12629 0 R 12630 0 R 12631 0 R 12632 0 R 12633 0 R 12634 0 R 12635 0 R 12636 0 R 12637 0 R 12638 0 R 12639 0 R 12640 0 R 12641 0 R 12666 0 R 12642 0 R 12643 0 R 12644 0 R 12667 0 R 12645 0 R 12646 0 R 12647 0 R ]
+>> endobj
+12627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 684.219 203.075 695.123]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 684.219 296.324 695.123]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5683b0d430e6c058bc91b4ba63d41ddf) >>
+>> endobj
+12629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.944 610.937 200.017 621.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a343e039e48425126b187827066d12bf2) >>
+>> endobj
+12630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.944 581.561 200.017 592.465]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4ac4e4131c756f0ffce85b9dec7d2b3a) >>
+>> endobj
+12631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 508.28 211.703 519.183]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a189b8a5a14c05d63cf5724a8561f8088) >>
+>> endobj
+12632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 478.904 203.414 489.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aefa817da18e0cb4cfb7f3cb347bef71f) >>
+>> endobj
+12633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 449.902 179.265 460.432]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa299eb4f7b82130a37da3732ec837137) >>
+>> endobj
+12634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.575 378.304 140.53 387.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a43ab45399b7e22ffcd6403b7e59a473c) >>
+>> endobj
+12635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.575 348.928 140.53 357.775]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2d12805af932544a4fc1575f8db62a3d) >>
+>> endobj
+12636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 319.553 167.639 328.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa2a8683afd33a1d57db43c9db16de1f5) >>
+>> endobj
+12637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.064 204.98 229.749 215.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2f1209d77894eb265d41b923b74f9d9) >>
+>> endobj
+12638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.784 204.98 444.205 215.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.839 151.694 181.264 162.598]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8ff90cd506e2377d88aafe850f46ac5b) >>
+>> endobj
+12640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.05 151.694 321.471 162.598]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.251 151.694 513.996 162.598]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 139.739 146.896 150.642]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.053 114.092 179.177 124.996]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6cd12c70f251a340295cb737ae2deace) >>
+>> endobj
+12643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.391 114.092 319.812 124.996]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.251 114.092 513.996 124.996]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.137 146.896 113.041]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.665 76.49 225.35 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2f1209d77894eb265d41b923b74f9d9) >>
+>> endobj
+12646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.192 76.49 430.613 87.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12647 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12651 0 obj <<
+/D [12649 0 R /XYZ 89 770.89 null]
+>> endobj
+12652 0 obj <<
+/D [12649 0 R /XYZ 90 703.868 null]
+>> endobj
+12653 0 obj <<
+/D [12649 0 R /XYZ 90 703.868 null]
+>> endobj
+12654 0 obj <<
+/D [12649 0 R /XYZ 90 628.673 null]
+>> endobj
+12655 0 obj <<
+/D [12649 0 R /XYZ 90 628.673 null]
+>> endobj
+12656 0 obj <<
+/D [12649 0 R /XYZ 90 599.561 null]
+>> endobj
+12657 0 obj <<
+/D [12649 0 R /XYZ 90 528.013 null]
+>> endobj
+12658 0 obj <<
+/D [12649 0 R /XYZ 90 528.013 null]
+>> endobj
+12659 0 obj <<
+/D [12649 0 R /XYZ 90 496.904 null]
+>> endobj
+12660 0 obj <<
+/D [12649 0 R /XYZ 90 467.528 null]
+>> endobj
+12661 0 obj <<
+/D [12649 0 R /XYZ 90 395.98 null]
+>> endobj
+12662 0 obj <<
+/D [12649 0 R /XYZ 90 395.98 null]
+>> endobj
+12663 0 obj <<
+/D [12649 0 R /XYZ 90 364.871 null]
+>> endobj
+12664 0 obj <<
+/D [12649 0 R /XYZ 90 335.495 null]
+>> endobj
+12665 0 obj <<
+/D [12649 0 R /XYZ 90 263.947 null]
+>> endobj
+12648 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F39 2335 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12688 0 obj <<
+/Length 3415      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸~��P:�f,W��^fv�M��m�&n���xh���H���⨿�7� Yq2��D����|�
 Ɠ�	��:�����d�
e	M&W��
OdB��dr�����$��	�xz9#x�7���rF�^��e�_�Z�4y�{����|��]�)��E���lf$�����~����%!ބT2�3����5C���27�9�ͩ���>����
e�p�|�j?��U޶���,��b�Y�]�>���H$�dNʄ0_�)n
���Z�q
��đd�P�g?]��~F�O�/H������ox���_&�,�<�A�	�
~W��g?�VS��P����-##�{�W"Vq/�./W�HSxkM��ʺ�
Ƨ��9���P�<��d�i0�N"�{v�MQ����ܨ��b�Lu35�TMG	�#]�1#bj�H�-sm���b� �$�$M��1�Q��Y��}�0��6���e��1
+^4#dj<)�A�@�_�53q`<w6O��{� @*�T��fl�'.��h�x�B��ʐ'
�y30M��W�7c�b6�F���L1��w���
� ##�0h���ڇ�	��ܻ�����ر�s^��6}�kcei��8�Rߚ��Aavm^�k�B�
����1`��(I���_ʶ�*���P|U$Eg@�`�I� �rJ��-����L�T��n7������kY�]^��5���Mo��t���U��z�������H!��	���. A$�nH^-#t`�b�t/�!2=��M�Ϧm	l���$Kxho����� �1�Ya�̪@yQsg��RB�����~
ϯ/m�ʼn˒ Ɉ�����ćo^�>u. at C��/��US.��@��[t�]]������x}����e>�Pܺ� X����jǧ���8����
��㋄��G�>���k/�C�Y:�"Q���p
�ȜP�8d�s�@��q�@,�@��߅Bs�3��M�jX���$Ad�i���H���ă������	��z��D�OvTd�䦃Z���v$��X`/.���pVM Q�C���+�@ԋ��EK:��
�.v�
 	D
$	N
	$`��
$���B����}��הW*ڙ�:�A���]\�
cZ���D6��
T�@)D0!�h�T��RiFo�c�!>����*�;�$ �L(
J�P�:�U�A�UL�t��\ �e����*T9
�.�i)A��xcz=�~���I��S&S���x����ͼ9#�<}(�{Ӽ��ESt�r�h��V&�{+�)(���
��
��ETfi�;!�eĦKNӧh4�
e�T0� |yʡ�����`o.Ȇ21| �(l+��{�N1�S�H�bL����L{bL
��bw�;�Ty���y��R��@�+gTL?*�* �1�J�"
Q�TE	���yU��k�|L{$F_�b�{�.F���D�
:�!��@8>

�����#�d�tJ�4��Z)zqZ8��C�A�����~n��筙%��C �A
+f�ľ���8S�g#q�!l�?�BB���!{y�;�wI��s�%�¹���6�$J�ٗ�P1��;�2�yR̦8bCI���V*b�
������g�1zP�
&ʝ�E�s�����
d�8
T��!F�7$�$���E��P*�U�aoZQ4�:B|y,
+�3X?I��W����c��R�5bh�x����
,��d�bX at E
+֬6� u�~�crZo���}AضI"tx�z�j�c�;C Qv��,�[�o6�����#:7עnT8����۟^Gh/�ŽO3���Ԧá�U���i�³
+5˥^ ���M��τ�R�O���)���4�>5�J���u]t��
���|��-$��+�P�hZ?��tN�خ�fƱ�vYڃyX�H
+ql
����5���	J��i��
+@�!C0~]�퀽3��
�{���/��D<� �0��sU�s�NU�b���l���L��O�-?oO�lM��~�a(	���Z
+�Oݮ�N
�g���eS�#�� �#}�P������?��o����Q"Ü�ϵJ��:wlql�I�����W��
�-�q�]W4H5����'7�YW���gD�LU�Q�E/lG�vH�����'F�i/�˧\�ϟ�@��DPO����T�7
�������W+ӡ�m��u�A���L�m
AC������ �����֠��O>�k��������C
- G0%�T��P|Zv��5�U�������2vQ�W
��W1��k�ٓ�V���~2b�nꢄ��<�6r���F=���m�{
+���Dv
�ŐI[O���ܞ"���كK���(�K��

7��2-z$U%b����ɐ���)��>Mu��I���2�l(�"�T�$f��vPu�$j`(V�'^��t��\��G?U�3ڳ���i��� 
σ�*UZ���șrƪ�Uovr�U6v#G��U<�![X�p�%sp��z/�Jn�6h��뛢��y2H

+iJ�5��|��V�
�!-f~
��Ul%*�M7�<�φ���Af�Zi<:�'&#3@��)=�*�ez���4[�'@��<���>�C{{_oWK�
qj�X���&ժ- �p�\X,��/�6�G
nFK�L�}���;k����

.)h�E��`��ʆ��r7
\W�AhNK1C,I'�?*֔s;�:x
I���
,��z�[�R�{8Zر�
�
+ �L�{9)cvFe�*5�̃I5i�
+��EE9FL���i��Z������V�m,�]�#a&C$	���>I/R��:��o�
7fLno$k�
�
+�&��8	�mB�Q9Cޔ��*z�C����|�s>X��Q_E�
%��,[��=�s�f�_
>ڶC4$��je���2��,{�
+}�!��]�ZA�}R�h�Ɓ�:��
ݩ��z�}��6C�]q�����CE>�N�vKX�<��\�e ci;o���m�Z��=7\�VMÙ0���S=�`-��߻z�ۙAU������\�1��
�2ژQDU������?T1F��W)� ofuӬlZ�
'Q`?����c��"d�8��c�Y|n~�]
(�v[��
��(NtBDt����fU�{*�o�$��wm�6L at 3*��h:��'3��ߙ_�����|k��nj|���bsx1�5z�[ƿ7��X���-7�]X���<2���5hI
e��y���_bdA�ow���Z at D��Bx6E�6ҥ��(H�Z}!zo�&�~�#*ey�B_sO(���z�]�х�R�Rs��K$`|(���_��?��4�b�
+�y��Ň
�.��D6M�*@&o~[���0�a��b�``�H��P��w��������-�;��~��%CX���Í�u�BwY��8��@�ⳓ%�O�$�I�;X-&R� �?�Yw�m���k6yQ����&�/�� 
+endstream
+endobj
+12687 0 obj <<
+/Type /Page
+/Contents 12688 0 R
+/Resources 12686 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12693 0 R
+/Annots [ 12671 0 R 12672 0 R 12673 0 R 12674 0 R 12675 0 R 12692 0 R 12676 0 R 12677 0 R 12678 0 R 12679 0 R 12680 0 R 12681 0 R 12682 0 R 12683 0 R 12684 0 R 12685 0 R ]
+>> endobj
+12671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.859 590.588 257.582 601.492]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.021 590.588 347.699 601.492]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+12673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.138 590.588 378.041 601.492]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+12674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.479 590.588 474.135 601.492]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+12675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.049 590.588 513.996 601.492]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+12692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 579.255 150.553 589.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+12676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.017 579.255 194.942 589.153]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+12677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.788 552.432 332.22 563.336]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [104.181 411.349 177.904 421.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
+>> endobj
+12679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.972 411.349 464.404 421.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+12680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.352 398.771 304.232 409.675]
+/A << /S /GoTo /D (index_CC79) >>
+>> endobj
+12681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.372 309.416 302.073 320.32]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aec093aabb8eff04714d94a1d8f549c5c) >>
+>> endobj
+12682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.783 274.085 422.506 296.167]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1No__Reduction) >>
+>> endobj
+12683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.149 194.134 329.403 225.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+12684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.563 194.134 422.493 225.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+12685 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12689 0 obj <<
+/D [12687 0 R /XYZ 89 770.89 null]
+>> endobj
+12690 0 obj <<
+/D [12687 0 R /XYZ 90 721.073 null]
+>> endobj
+12691 0 obj <<
+/D [12687 0 R /XYZ 90 666.408 null]
+>> endobj
+12686 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F7 803 0 R /F8 802 0 R /F24 537 0 R /F32 772 0 R /F10 773 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12697 0 obj <<
+/Length 2015      
+/Filter /FlateDecode
+>>
+stream
+x��Z]s�6}ׯ�df��L㛀���iw���}I3Y�mn)R%�&��{A�)S����ٙ�4I
�
��q���>���������iIe0�
4B����W|
2-G�&?L*D��Y��w���\\Nn���d�ۀ�#
 P���b��"��S��*�\��8e0&���_�m�
�m"�H�LY�QHX�q�\��2�%�zzm���Dӫ<����C
Gߎ������U��L�gi}3sS�8K�Ή�{N�w~���`�)�C��6�,r�GK4���<K�2��ii_��޺�d���s��I���m����|wy��R���7G����v� ��I�ac�P�u0�
)�iv�e�X&f4�T
Y̏'�%n�4(a�
���"<�˒$Q1�
����<����q���<.��7��]ą�bY�ߜ�0��K�H;��II��"�K
�B tn���u�a�].���y𱂲�!q1�ƛ��+Ĥn�̳U�8;� d�JkC���f�������z�M�Q��^I��n�[F��e��t�_ϑ4+��Y1MC�!廘=1�_���!]m�����F�{�h�`+��$���/V43
+�|�QH
�	�w?��Y�R�7n87����|�0i9��'�X�@�a\wVCįW�wɬ�v��=i[�HRU��g?�`��r�4�laӉ$�s�F�\��t���
S����6K}�^����~�jD�'���V�oH�D�}���퇐��Ÿ`�������H���@'��.�����
'���.vV P+�5��
+=�( iX��@�H6��T��Z�K��lv>�f����
�
a� �>�C�V�Q<���ȱI�+,A����~I=|�=��H�f�q�72I���=�
`Hn1�ܛ��GӋ�ظ��{���_�4r���gj=l6����}q}s�s�R
+i�(��l��a��8M��|�A�!R�l�߆�Hp� �/�$���N
+�jTll �	�"�����*N"�k�R7f��1s�v<�Fo����m���ǿ`LM�n,�li L�^Єa�A� �D�!E9����@
�a�����?~�
�gۚ���d�E�D=�����P�t at 5
�؋��`�P��ռMA�y��,��R׾t����~dL4b�Vbm����;v�H
+7���nk
�FӰkl�\�շ&���sc'���7��}D���^�x6���7M��1ї�8�n����
��N:Qm����GGt
u�S�z�)�$C9�RU
1%[Y�9��:Cz��1��z�a�
0ųi�U[�縖�G5��,[5�����㖙o��[��!W��YT<xv3 �1�x ^o�w4j��<�\T�ҋ��Y��D���<�tP� ы��W���
v���.:�.� .�6���A�n�(5Fn��'jA�C�R`@-�2:=MLz_>LM�������s�0;��Іn9�G��
;��b�(��7y�ݗ ��{�vWGAGozx(��ڻ��#7]���n�v��`�ٗxb�����Tݷ�J`��SIT������Arܸ���YЉ
�iW�����\9]���u
�N��?T;t=$ɍ�ܡ��F�����.b�|Փ2��Au�^%�9�u�,�Qc�D�~u�/���1W�
pZ�=
ڬ��2��^:�Y���%��ѰQ���]�(����}�*�DxT�O����r��?N�"	�9Œ{�(�V?ű� ��K{�릷��nc;Ja���X�1]��7&mY�Sy
+
`\��㼺C�lmv������@ L��
�ꂠXJ

I�p讹E���,>��(_gE�>i[Ѱ�	j�k��r�g�*@����G
��>K�
��Nf "��T;Џ
08�'����Ik"$M�++~S14u�zؾ�
�s���,8� l7�����H^W{�i�h�7WWw?&��=iϕ�����^ikY-n��FY�F���Fc���Կ9�~mL���ŲeS�WMs�P��ӓ���}� ͳ�㪰��u�;��{W��E��:A��E�M7�g�
?Kv
+endstream
+endobj
+12696 0 obj <<
+/Type /Page
+/Contents 12697 0 R
+/Resources 12695 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12693 0 R
+/Annots [ 12694 0 R ]
+>> endobj
+12694 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12698 0 obj <<
+/D [12696 0 R /XYZ 89 770.89 null]
+>> endobj
+12699 0 obj <<
+/D [12696 0 R /XYZ 90 434.378 null]
+>> endobj
+12308 0 obj <<
+/D [12696 0 R /XYZ 90 410.919 null]
+>> endobj
+12700 0 obj <<
+/D [12696 0 R /XYZ 90 410.919 null]
+>> endobj
+12701 0 obj <<
+/D [12696 0 R /XYZ 90 328.417 null]
+>> endobj
+12702 0 obj <<
+/D [12696 0 R /XYZ 90 250.419 null]
+>> endobj
+12309 0 obj <<
+/D [12696 0 R /XYZ 90 215.749 null]
+>> endobj
+12703 0 obj <<
+/D [12696 0 R /XYZ 90 211.266 null]
+>> endobj
+12704 0 obj <<
+/D [12696 0 R /XYZ 90 110.956 null]
+>> endobj
+12695 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12708 0 obj <<
+/Length 1896      
+/Filter /FlateDecode
+>>
+stream
+x��ZIo�F��W��J at 4�}�
'E�p��-ѶPm��&��}��nR�D*hӞf4
�m��q��{?�^�{o�
2�Jo|��)I���O��>�H���`��W��~��o��W��c0
������w�Q�!������c0�N���U8 �����f���[B
+
�b���~r[J2�
��t�%y1R���4�|�!�2F��l���}=�7Gm<0�,�s?
+�kސ1���ސd�po|
�X�`9q�8�
��dF��ޛq�s��*�Hl^.���dѻ�����0bF{_�M
�S��������Ie#��N퐜�)�
˜{�0�q"ꛯ�`
�V�M,��OX8����P{��&��
+d�Mc<i8bp�{��nw�e�FR%i�+���	G��	�@�
/�
#Hrd����D��h
,��� 
\�W�;��s����N5�qhUC�8"R��P�b4c�ZRp��T�,]|��`�p��I���r�����r�:m����(�nD��ǃi��c�&
��l�]���� ��-l��$٘qC�M/�A��VcX�D�NC�����R�Ba ���1&�"*��JnV
+I�+�D\!ų
�n
,��=)8�K��n�<�����LɐTt_��YV{N)p�hD�P�n��+o �+o
r8"�%�e�%3ڣQ�~qv��%����,x��װ�(/ǯWˇpk
���<����`�L�R���	KwL
6u�iİ*�Fj�ؐ���l9�-��j\!��ʋ�4�8���:����&��Tv+�l��-{8kD@���W��<�f���
��'MOLl��M@؇�ƍ3i<_ݻq�Y|g8�dHl�4I..O/�pUSj]�,�ʶ�L���rRJ3{1���d����R

+Q
����45%�Ǵ:BA+E��FM"��l�9Ÿ��C6�K�v�T���'�#+Ba�)V������N�RH	�’�C5�����Xpo���x�����
+z(HɎ�]�3�{�}4rl��d�ԏ��&
+!�m��텿���T��yp��F,�w9���J�}�A��9��ͮ	!�w��<��=R��q� �� �wٌ���K �֯.aNN�
�1LQ�aN���(��� ���w�rN�|s
 ELI�qՆ�A�åF*�0)���9\;�c���C�@N�C� rZ
��w�g�9e&��k\��K4���k��f;W���G2UB=Cn��E6Q
Cf��=�?[F{ C����L�I-��8;���)��B�~bv4�����v��A��+8��%L��A�� �l#�eo�9Ÿ
��
+�Z�P�ꀐA
+��A�d���j)F-*��������J���
ENW��=����]:���C#�*���
�����aG�Lg���ށI�%)�l�F� o�F��0�#O�#%
�K<r��CG#M��Ն�A at B��Ɣ�����?x����l�uQ��c1����
D
�
��j�`���Epv쵋�&���l�.�v��]���y��_��N�hx L�p�h(�\
7Z�Q
7Jb������6��d�K;��q`N1����f
�n�>�@�!�C��a�h�@��6
�g�
���e����K�FE�k4+X5J���ejģ�p���
���E��ۚ� D*�I
!��Y�P~��H�`C�A�p�ߓ��=��)'�Zs��QUv�mh�U��?Ϡ�R�����v���7/
+p��T����n��&�u#�<��˭?ws�
�e}"�>� �m�Q42�?A�-��z���^쓹8��AgW�Q�
]\�m6�h�Z<�5
�@�˿�߯�No�
+���E�����[eN�!�@�X
����i��8��/&
�̻\��?T��o��s@
+endstream
+endobj
+12707 0 obj <<
+/Type /Page
+/Contents 12708 0 R
+/Resources 12706 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12693 0 R
+/Annots [ 12705 0 R ]
+>> endobj
+12705 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12709 0 obj <<
+/D [12707 0 R /XYZ 89 770.89 null]
+>> endobj
+12710 0 obj <<
+/D [12707 0 R /XYZ 90 718.682 null]
+>> endobj
+12310 0 obj <<
+/D [12707 0 R /XYZ 90 684.012 null]
+>> endobj
+12711 0 obj <<
+/D [12707 0 R /XYZ 90 679.529 null]
+>> endobj
+12712 0 obj <<
+/D [12707 0 R /XYZ 90 591.173 null]
+>> endobj
+12713 0 obj <<
+/D [12707 0 R /XYZ 90 525.529 null]
+>> endobj
+12311 0 obj <<
+/D [12707 0 R /XYZ 90 490.859 null]
+>> endobj
+12714 0 obj <<
+/D [12707 0 R /XYZ 90 486.376 null]
+>> endobj
+12715 0 obj <<
+/D [12707 0 R /XYZ 90 386.066 null]
+>> endobj
+12716 0 obj <<
+/D [12707 0 R /XYZ 90 332.377 null]
+>> endobj
+12312 0 obj <<
+/D [12707 0 R /XYZ 90 297.707 null]
+>> endobj
+12717 0 obj <<
+/D [12707 0 R /XYZ 90 293.223 null]
+>> endobj
+12718 0 obj <<
+/D [12707 0 R /XYZ 90 204.868 null]
+>> endobj
+12719 0 obj <<
+/D [12707 0 R /XYZ 90 151.179 null]
+>> endobj
+12313 0 obj <<
+/D [12707 0 R /XYZ 90 81.969 null]
+>> endobj
+12720 0 obj <<
+/D [12707 0 R /XYZ 90 77.486 null]
+>> endobj
+12706 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12724 0 obj <<
+/Length 2110      
+/Filter /FlateDecode
+>>
+stream
+x��Z]o�6}����f1�oR�6`Kۡ�Ȳ�6tE��J,̶\KY��#Q�%E�[i^�`P��K����cQ•w�Ѵ��G�K�?�z����|�k��ѵ�S�H�(�����/|;x7����k��=>��b��b�&��
�>����
�"�z�E��;�M��'t
$�c�h�I.Pν7��{�fYf��1Fs=3J
'����QJ�I�X��I�Zr��U�4�hn
��q-j؆Y6H�V�r�C�U�s�+��R����´ ���\����/�/����$
��wW��I0��\��G�Iں`X!�w
���
����l�{(� �7�
+�Jլ�7�%��Y�����u�8%R����`��I����
#����W�N���nL]G˖^�PB�/}Ủ�4��SY�X�NZ�f�X[�9����S��]���q�j|�E��${c�T?}+ہC!81��߶�m�e��_�}u�ۯ��������6N��U�T�C����̿
��p�kA��XΊ�'-P�(�A
+>���$L2��-��ҴJB�$�(8aԺ7�
���U�+V�9'��z
-j��y�� ђd�J1����u\ay�bZ��\K��2\޴N���j�6��0�F]��m�"���7�:Lf�����(�NklȞM� o��r�\�IL�}2�ߏ��E�
+&�?�r4�8ń >o���]���ZMJF�
Q�R��2jj����@-��>����i��Q¸�����K�z�U�:?��%�@7{x�>u�E�o耺0n4��hA��M'>�g.-����y'�$6�⻩�bU�Y���RKx���&\��+�0I�&^�'��4\�8�O�n��F�ƾ)�j��n���2D�t�*�3���\���L�a֏�Ͳ5r�Ժʴ��(���݁�&�P��iS���
U�P����%Y���p�+����ʞ�s�4��#ͨSS�̯����RN�ȕ����
+��.�M�&

���)��숁m' )�]R�kDG-�Y�n���
?O�U��x��o��q&�ӬjRI���4�]��p>wW�Z��� 
�c��c��@j
 
2�`�VO|?S�>,=��B�y<�ӸJp��q�q�q��?K]�#�{L��(rTjv�#�b
T��5��*��s�ĩOs���޽w�
i���\���M�L�����&�]��@�~��Mw$>�R���0
+І7(�D,mv
��	8M���F�u4 at b�1=f��׮t�.������Qk�
+�*�M{L�M��m
I��z1��v�p7���q�b�0���(�oD��������
�������n��1�{�$�ӄ���$�b���$!3�H�f%�Z)��IH���%&a`��'���NL]PNPr�r&�eۀ,�o
�9�%�I0��*nW��RV:����K����}i��d�0�1�Ґ���L@����b�J���|��Թ��p\Pv���g.X�/��Y鋬􌲒�̲V���v��u��� BXb��TV��(U�H+Z����%*
>��4 ��Kbu�舅W��;��@0Y���xQ�H��YV5�D��Ǵ���z�C')qY�KJ�JD����	0�]�5��Q
JJ�#$%n���
-)u8�BRj
�0I�6�/�RCR:xն� j��ݓ�`�6gߌ�$%�����NRB����Vi���^i�HJ�����ER��3HJ�NRI)W�`
��0�M\m��ԭ�Q�4%�OS��JJ�4�W�j��JF����u8m堖���$�JA�f=дߪ"Ìx�7Jb�݋�$oU [...]
࣓�̡�&�`�벑�U�;e#N|�*Dx�\�
��|���b=O��jX�w��Y\�8C|�;J��0L��J�����4�5��1��賤��i; �L���w��H�ؗ2�i���#Mա)��&��j��?��^x���L��x�jSK,���󲆆�2\<���ʋ8���M��J���z�U��N_/��"�n���X~$:Z�"ڕ>/:�����/���8X=P��/�����8Ww�`!�zs�a#�ցMC��$}���l��4��^vZWl2�����$Y��������MP�~ �y�5e0{��;3h��7
�/�M�
��Qq��
+endstream
+endobj
+12723 0 obj <<
+/Type /Page
+/Contents 12724 0 R
+/Resources 12722 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12693 0 R
+/Annots [ 12721 0 R ]
+>> endobj
+12721 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12725 0 obj <<
+/D [12723 0 R /XYZ 89 770.89 null]
+>> endobj
+12726 0 obj <<
+/D [12723 0 R /XYZ 90 604.514 null]
+>> endobj
+12727 0 obj <<
+/D [12723 0 R /XYZ 90 538.471 null]
+>> endobj
+12314 0 obj <<
+/D [12723 0 R /XYZ 90 491.846 null]
+>> endobj
+12728 0 obj <<
+/D [12723 0 R /XYZ 90 487.363 null]
+>> endobj
+12729 0 obj <<
+/D [12723 0 R /XYZ 90 363.142 null]
+>> endobj
+12730 0 obj <<
+/D [12723 0 R /XYZ 90 297.099 null]
+>> endobj
+12315 0 obj <<
+/D [12723 0 R /XYZ 90 250.474 null]
+>> endobj
+12731 0 obj <<
+/D [12723 0 R /XYZ 90 245.991 null]
+>> endobj
+12732 0 obj <<
+/D [12723 0 R /XYZ 90 145.68 null]
+>> endobj
+12722 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12736 0 obj <<
+/Length 2188      
+/Filter /FlateDecode
+>>
+stream
+x��[Yo�F~ׯ�SK�z��h
4qR$M7Q�i`�m
�D��S��w��Hz)�$�
���rvf��9>�ػ�����tt�\1� #������	J���{��
O��?
��28;
S�G���pg���q�
��y�Xܝ�	g7���4
�G�#��<zNHeA�†�:�z�fSj:���b�	�f<��'4�y��2F�|�"�\��"�l2iӱ�~�\/�$��y�R{B�"{�Mx�����l
�a!
��;<z6
}
�
I��
��w�
����
��0bF{���
�
�
�����=U^��^r����� ���C�>����<ZmR��D��]��X6�N�Iw���-c<�)�d�Nc�NHC*�+iJ��U$��#
+��ɈC�"$s
��$��Q0��f�̎���*�>
�x̅ř�ڼ@1ײ!�# 5�ic
�v�'q�$c�f��:��T���lQ��/�kr
f7�up�����p��f?���̊���G�*���� ���)���6�����|y��~@��
gn�&Y( \C\)BA�DP�v�`1�����J��
z"{��
��tx�pS�/�"�瘤y!])$�n$��p�/'$w�p,�����]m�P���V
��CWv�S�0���RӅ��*ui��1$
�g�q[�b�@�h���y�p� �]��� l���K.'D#�̀ߺ��R�����ܹ�L#-�ͮm���H�x��4��7�H��O`��n�i5q,��pZ��:a�$V�J�	��"	��&s;�)���v&�l@q��W�]�% ���z
��o�q(I	
�2(?� ���<�;˪*�d�b��E�F��-t���ˇi^�t?������?��z�ۋ���A���Lj+��c�����b�
+?��F~�0���`
�ֹ�o�Y^A�e
g`JD7��em�yt��XiBl����%�|5_]9������u��<	iz
h4�0��4͎����0�'�:I1�ȑp[M�#˩��-y�ṉ-�4��R�.�-�pl!���'��r���C�\!8vw��p�O��KL
\��͂�.&�Q�(N�a�Z�L(�9��}�����W�:*�DDM�iF�M
��p�{ �P[�8�򷊷m�
+�*�W�A\&=�j��T0}@`
-1�d��0�" } �̈́V���H#�!맒cU�J���F6 �o~���pv~:k��m�w�|(~:K|�
�|p>�[�R��<���Tq�Ӟq8>�"��5`��ބĀ��D��n�D;*#��L	FT�>�@^�رJQc��	���J���Z:	+7_Zm	;Zc$��R1	�t��p���A��Dg�����İ
a/�{	
0׺�H����0M�.��&%W���|H+y㡛������O�9	ޅ� �޹�xhb��MB�N
�>	������$�8I@��I�-'ԕ��MB�vb�0@N��|rr��:X�\�!�oi���c����m�3������"�|�
��U􁬃P�n��O�f
 d ��
�a��a��p?�~�5J����><9�;y��:!�!�֍."������=���i{��B��������%�.#�8�
���0aJD
+V,Cо^���^���ԉ���D��ȉ�&�CD2����3�a];��`��(E��=Ur�����Dw�۽
���!ɭ�FN�|ˇ&'�������G���*��Gv>���
+�AMPa[gڛ�κ����׍��Y�ȟJ�k��]}�~t@ �d���G�^^�bhi��
/�������H��h,Z�	E5{��0����Z��cED
=A��n�q����O0�[�	���	��C��0R�'��JH_z���E_ ���x��%�MM!?M�j���0�}��ӂWC�C�7�J��!���6�4���p��U%�� �9��v�bBC�G�dĆ��L����PPp
+ޕ�觐pU��):����$�ƇNg�����5���
��!�S�ђ��TP$7������&��

����9X�a��m��a�MN��
+y�{�y����+�~��u�QP�n���$Y
��\AĹB ���D��MY�]F�W]K O�hap$eO	 *�	����\��ݥ��}��x18z�d�I������g
+endstream
+endobj
+12735 0 obj <<
+/Type /Page
+/Contents 12736 0 R
+/Resources 12734 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12693 0 R
+/Annots [ 12733 0 R ]
+>> endobj
+12733 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12737 0 obj <<
+/D [12735 0 R /XYZ 89 770.89 null]
+>> endobj
+12738 0 obj <<
+/D [12735 0 R /XYZ 90 718.682 null]
+>> endobj
+12386 0 obj <<
+/D [12735 0 R /XYZ 90 672.057 null]
+>> endobj
+12739 0 obj <<
+/D [12735 0 R /XYZ 90 667.574 null]
+>> endobj
+12740 0 obj <<
+/D [12735 0 R /XYZ 90 567.263 null]
+>> endobj
+12741 0 obj <<
+/D [12735 0 R /XYZ 90 501.22 null]
+>> endobj
+12387 0 obj <<
+/D [12735 0 R /XYZ 90 454.595 null]
+>> endobj
+12742 0 obj <<
+/D [12735 0 R /XYZ 90 450.112 null]
+>> endobj
+12743 0 obj <<
+/D [12735 0 R /XYZ 90 337.846 null]
+>> endobj
+12744 0 obj <<
+/D [12735 0 R /XYZ 90 271.804 null]
+>> endobj
+12388 0 obj <<
+/D [12735 0 R /XYZ 90 225.179 null]
+>> endobj
+12745 0 obj <<
+/D [12735 0 R /XYZ 90 220.695 null]
+>> endobj
+12746 0 obj <<
+/D [12735 0 R /XYZ 90 108.43 null]
+>> endobj
+12734 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12750 0 obj <<
+/Length 2251      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o��~���S+���/F[��x��&Y7q�.�@�%�f+�Z�r��3
ކ�.��nP~ M��:�|�
��r���٫

2����&08P� !�E�i�1
��)`R#b$<U\~������W����_���qR:���>}��.�`Č�?Z�28.��g;å-�QaO�А��� �y�C
g���<\�Qg�A["�T8
V���X"A�^� �mZb_Z&$�RS���H�2��8��D�XKbq�pD!�NF7-!.5����\�(��R����e��w�0M�\���eiW(�Z6�{�����1��T{�������m�wu�&c*F_��R6�n�1�
�I�����E�
+�
V��7��a��^�wJ�:K2��
H
+Q��I8&b�?\d
ի�C�ڬ�?���.�
�u>!\#�����F��I� &OX�;��J��
Z�'��ߟ�tx�p�bG0R�
:���(W��,]f����g�N��/<�
+)����0��l�!�HG���ޤ��s��>�B$G
J�T��
[�3,cv���
r��u�ϭ�ڭb�R��\�bK
4��=����t\�`\%�F��1��Y�GPT���b3��tL�(��x P!��W�X���ԕ'}ib)��e�
��y�sqf�蛧R��(���/,�x�
���
� ���AT���ET��S��-���k�%�w�
�.f��
��U���L#�uE>D����r�e}r4ZU�</�(0 �rk��=z&
H��
���/��?��|{���~����X� �������S/�8��#��6�}�#�#�i-)|X/�y��h]'�k�����{��M�,R<s�
��ޢ�,�����-,�f�ŭ�E��z�&����A6\�lÐR���6b
d�F%���r��$D��aek'�֠�n7 ֹ��F�q���
+�� �� �� Q2�
N�D�w��:L-'У6�t
�{��
�.
���Y���?��a�S6
�Y�GJ�#$H�&�ss��a_c�u�,�j/��Z�X�(��
Q��rwP"T��@ʤ4O��(���m���n��G�(2���j�H
m�P%��i]Dٿ�(η5S�I��)l-
5���cbٴ %�	Lwb��H~z�Ł�S�H��,Rv�����A��>Ԁu�=�(�֎��Ž�K��qdg��
a����!�7i��("�umX�nžfM'q
Rņ�6߸��$^��8*р���v�L6�c֋rF��(;h�U�=�X���2ۺ9���$1��/QV^�
+
���]�{ p6�������n��YLb8D����z��}�(�%�=�)�
��
+�a� G�5���1ǣ��2ZL�R0UQ���2CzZMe:�VS�=���e<O��L�V�2j���
�Ϡ5XO�&Ql����2<r���,�
I���v�̃c�[3�3M��i~=Lv;�&�	L� �,�3'��_=�K�!u)�cl(D!�AY���
Rö��a��-�Ī�f��]l��"
�	,�R�3�-��T�4�
+L��"�l���h�����=4IB�
?�&�C4�%���G�
+�`JՋ�f �=d?}�}a�\h3$}i�<��0� ^�`�eHO+��q�������eO��n��I�MƪwAmZ�O���
���Clrl�v���y~w��þb:E�A�C5)&�
�aߨ�oJ}�KP��d/zmCe+Pe�‰��]��=1����3��V

(�z)�O��S<�N������&\�݃6�ʯ��[�
�tz�.R
fY9��~E�a}`�E�q�ů��!�=�凌NV�C���ð��>%�+z/9
O�yx�1���΋�ʼU��%
��J^���\K��j{�Mo�d5��o,�R<���w�Ҿ�FX���(1���XO��E<�h)t��y
+%Hn�6����L
�y�

zT/�Gi>��Fi����=?c��Dr:���$�y'�;����o���o�v�w�$X�x'a��
I;�P[�ζ��	�>�uJ$�3,�TǒN����#
�j���HgA:�
S�)�O:�DPRh������q_н_%0q�;�_뼸Y=S^x��oֈ���I#��!�'�kЀ`�VJ��./ߺ��ga����2$�f�f�t�|]<�f�EY��������c��r���6��gE�[6�n�7�f�����ի��mƷh^6,�����Z_��M��9O*^�p�}g����U�qZ
+endstream
+endobj
+12749 0 obj <<
+/Type /Page
+/Contents 12750 0 R
+/Resources 12748 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12693 0 R
+/Annots [ 12747 0 R ]
+>> endobj
+12747 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12751 0 obj <<
+/D [12749 0 R /XYZ 89 770.89 null]
+>> endobj
+12752 0 obj <<
+/D [12749 0 R /XYZ 90 718.682 null]
+>> endobj
+12389 0 obj <<
+/D [12749 0 R /XYZ 90 672.057 null]
+>> endobj
+12753 0 obj <<
+/D [12749 0 R /XYZ 90 667.574 null]
+>> endobj
+12754 0 obj <<
+/D [12749 0 R /XYZ 90 557.625 null]
+>> endobj
+12447 0 obj <<
+/D [12749 0 R /XYZ 90 535.248 null]
+>> endobj
+12755 0 obj <<
+/D [12749 0 R /XYZ 90 535.248 null]
+>> endobj
+12756 0 obj <<
+/D [12749 0 R /XYZ 90 450.614 null]
+>> endobj
+12448 0 obj <<
+/D [12749 0 R /XYZ 90 415.944 null]
+>> endobj
+12757 0 obj <<
+/D [12749 0 R /XYZ 90 411.461 null]
+>> endobj
+12758 0 obj <<
+/D [12749 0 R /XYZ 90 338.598 null]
+>> endobj
+12449 0 obj <<
+/D [12749 0 R /XYZ 90 303.928 null]
+>> endobj
+12759 0 obj <<
+/D [12749 0 R /XYZ 90 299.445 null]
+>> endobj
+12760 0 obj <<
+/D [12749 0 R /XYZ 90 209.934 null]
+>> endobj
+12450 0 obj <<
+/D [12749 0 R /XYZ 90 173.923 null]
+>> endobj
+12761 0 obj <<
+/D [12749 0 R /XYZ 90 169.439 null]
+>> endobj
+12748 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12765 0 obj <<
+/Length 2537      
+/Filter /FlateDecode
+>>
+stream
+x��[Is����W��Ub��Eq���e{R%����q� ����
��Q~}^��\{�M������.��!�ѷ����F�� #��n����	J��Y��`��xB0ƣ�1���X�w7c�G���1��݇�������2������l=Mfw7Ř�Q���_n�����΂T1�
q���r��d(3����xB
����G,g��|���_/��ʡݎ

%˧E\&�kф1���фd�p���̓J�$���8�
�@rL�����^x�#Rm/H�h����
����F���ziq�ຈ~����'�^��^��3]��A�H�4�E}�y�<�i��*�^A�Z­`x%<��
�Szn��z�A�Kc"bL$
G
�|.�펴K�J�!��:��s��]�A�$�wP���.�E�Y������u��9
}���..�L�
��$+�y
��
�U��mM�H�KS��V�
�lO���"S1zΜ����(E�l)b�4&�|~*�K}p������l�ޡ���H+ռ�7��o5dt�S>������~������&i6͗Oq��/���3��9�
4"
Ij�ga�vS
ŒW�	3�!Q���〷<�RHR�/z�
+)޾P�<%Y����w�t���}A�H� η�LOP
o����/�&�6X�E	шlb�W{%�Q�7�լ�\h�ҫ5e�+�Ki{ m���^Ɵ�e�������`��'\���R��fך�4K���u6⮬�y�ՐJ��V�Ȯ�� F�K�D�,�ģK����8���d��N��3o�������o��O�N5�GR@�;�
+�˴�W�X5� ��$���V�|�B\"R
�(ݩ�	H����ʫ1�P�d at a��ҘP�K���cj�2��Y��]N(�~m(�
�2���M��K��P��2�9q�-�[�g&�H!*�����2�u��<�
2������
i-"�aZE��&�/�	ƽ*$���J��Ю+�d���\}�����
+�����"��:�%���"_������?�I��/���Tb�
i��+��a�j���t�X{cM��o6�xUg
�c}�T$K `��'�Wŋu�aZW26/Y��
���^h�b��݀�R��&
Q�"ai+
2�SF��).� ��ݥp��
&8bUX	(sB��)	8`I��+\�%�.5͇w�H
+��GR"����	s�pnQEaw�D�:;r��z_�_�}k}���O yi��X[U-�I�����?��ʡV g��0� ��<�ϡ
�!�S�� |��D!�,x�&��e��<I�d�JҒ9����˼�s>?��
F���>x�ĠW@*�FtTb�n�JP5s�7T�
D��$�S�+IK�Y���4�Rd:Y��H�hH2�Ftd7.�C&����
+�k���]��N��ҋ`-���
g��S:?&��Y?"I<}l�q��n�j2yL2�b���7�9�dD�d�Ɉ�5�9\�$���\�j��0+��� MM��|��<W
q"�u�Cj�t�T=�;���=߶�O?�a3H��x�<
�5%,
�D�3���ͽ�$t�SSHK�k��6��
�y���
��
�M �i�������x���K
+nW�Nj�/`
Ne[���
:=�@�
�
�������k}��m��KJ�<; ����[�
l
�s���+�^$󺉰��|m�Ʈw5�j�^w��:ɷ�����m��#p&��\
<ub
+W*�çNLs��	2ub��_z���J�nj��o��nny�QB�'���֐
<�86���w`�V�E3��PC�F\G���i#��x�wy�Ӭ�
+��"�6��S��*^\ä
���m&r�|�b����&l
��!'��� Rr!�N�X����'lg
+��$���?�������H��X>�F��L�_��cjl������)���=I~�	��Z

<5�h
r(
�QI�sTX*iQ��M�Δ�O��$�ф�t=��^�(�l"8�#�4 ��Nب����3E�غ��o��N߽a�$�
y,�C#:s��ޓV�
�Kaa�����LU�x/{���
+�B��1��&��/.�P G��$�����ң�t�p8Z�Q
)�C�x)n�M�T�۫�t���E���s1XS1��f���I�Z��۪�V;
�0#8���9�:�ݜ�x܌�vZ4��g̶~ݓ
;�
+Y�b�Ȑ��9f�U;%Ԅ9��̈́yK�'�=M�&�����"
	�}P�<�;a6qav
�5�„93�zCSJYӅ�����m�S��{
��ko�n,�|`�
�����>%���)"�n볙/����a�:��sh�|$��Ty ����ތȯa߇<x�4�E�
Q7��
c!�T�
�⍥i�����r($�vG��惻��*)~?������q����I�Р�4
a� -�vԃlc�~J�:�p��#j�~p��F
�0�
9=��������a�d|��QGHgT��M`�7{�f�pY��$%mv6�W8L������������,z��&��ut���
+endstream
+endobj
+12764 0 obj <<
+/Type /Page
+/Contents 12765 0 R
+/Resources 12763 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12775 0 R
+/Annots [ 12762 0 R ]
+>> endobj
+12762 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12766 0 obj <<
+/D [12764 0 R /XYZ 89 770.89 null]
+>> endobj
+12767 0 obj <<
+/D [12764 0 R /XYZ 90 718.682 null]
+>> endobj
+12451 0 obj <<
+/D [12764 0 R /XYZ 90 684.012 null]
+>> endobj
+12768 0 obj <<
+/D [12764 0 R /XYZ 90 679.529 null]
+>> endobj
+12769 0 obj <<
+/D [12764 0 R /XYZ 90 584.887 null]
+>> endobj
+12770 0 obj <<
+/D [12764 0 R /XYZ 90 494.137 null]
+>> endobj
+12452 0 obj <<
+/D [12764 0 R /XYZ 211.842 429.888 null]
+>> endobj
+12771 0 obj <<
+/D [12764 0 R /XYZ 90 425.25 null]
+>> endobj
+12772 0 obj <<
+/D [12764 0 R /XYZ 90 330.764 null]
+>> endobj
+12773 0 obj <<
+/D [12764 0 R /XYZ 90 215.705 null]
+>> endobj
+12453 0 obj <<
+/D [12764 0 R /XYZ 192.853 83.504 null]
+>> endobj
+12774 0 obj <<
+/D [12764 0 R /XYZ 90 77.486 null]
+>> endobj
+12763 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12779 0 obj <<
+/Length 2712      
+/Filter /FlateDecode
+>>
+stream
+x��\Ys�~��ST	ù&�X�ˎc�Sy�U,X�� ��baY������9R\	��أ�{���� bD��~���
lO�����׊�
2��������		���c�����w#&5"F�[���?�p���w��ū�_.��#���h��x��p�;�=��
Z�8ep\��]�t�{�9�
�҈D��`�(bHM�c<.���rV&V��פ��RHR]��g�DO�B�7��
�l�J&S���%����u���6�
+�
�롾
+���V��<_��z�C`i��z3!x<+�t�\~�y�,6�dq�=��C҄�B
+�kV���$/
�L2D5Ma5��]j瀚�Ք!"�.�������U����ߓ�
�ɤz�3x2�B��y�.S�8†�2�O�dVܼ����B�^�yXSd���C���>��j�O&D��P��/Z���5O�'w?cL�i���ѹF��GO�����)F�ґ41�w��M�q�����C"N�(R/m��^�E��"�u;0���xP}�
N�pwn�4�B�эo94O(
oV���H�~8'^p��&J_����! �x
����I�)�u�d��<�%��rŦ��=�T"��7�����,[��<[~�g��roSޝV�覵��

�4j<��!5��#n�,/�	����ê�t
���U;�u�C��7�"��+��6Y�*���4`�ш�zA�~���i�������|�N�̑`������N��U뛫���՚1[n�k���M�,Ps�]y�702��O���ދ��
�	�^2^��m��H{�ߴ���
I�V�ygz!Q'���!S2#�
dA;�
U���s�.�
&	l3��[��
+��3F$��g*�C)����\נ[�
؟כf�
�ke��Ֆ�
>�7��L�e��So�,4��5�i�<
+Q�y
F�Z��sl���(���gq���$��To�7�!`>S�0���4`�6����y������{�N7cp�H�hD,E�豤�JEŒ�I�[,-��y���Ӥ��"�rv�
M'2���#���?M�%z4)�eq�Dmn�@��e:y������<Uz[X��*��;Ǥ���*�e�-�Hf�zCN���
+��\
�΢�@|��
CD
+�c��d����i�K��jL#^��^�6O
KȢ���$ЂAa�w��������2�k�
vJ�E�H�E��:"�u�ŢR$����o�@
�P8��Y���+��5[��Ȁ��C�����O1�D̢Z
+� �趩�q(��.S��
y$8c���—�Ų���"&��*���r���K�.T��Bw��ޓSX [�L�����2�]&�B3`�9�
v#��f"�k�.�)$@
7�)s�g��P7��ty���}�����֓)S���ӼH�
�����h�g�'M/�~� w��I�t�{�"Qȴ����r
ڮC�m>ף��W�:���c�i��d!�
�Z����
���]כ�^5�
+M9�d��~
��1m��
�v�G\&wUͿ��|cӏ�
w��*i�FhM�g�� z&�(�hwR}(?d%����C̬類�_�

+�$$Q�
N�$YՉ
+�"D�ZC���3�6ڰ|� ��ǐQF��dTg�r�1'ga2
+*I��$�]5�~LOF�IMFU�=
CA6��g��1Z.
+>T\���ᢌnJ��K!�&��_[l#ijQ��g�|ԇH��V�w�1M����
�4�2��I���-	ɖ2G���Q1_i5@���B�#*2��A�1�Mb��%�:�	���ʅ1a\�h.�<]�
ߞ.�'T���8
=��%�	��=�9�r8.{�`׆
Ʉ��I�]M�
v��+"m:K�%z,1
f��Xb
��#��3	C��ȗ��N�cx�A�1)��=��r�D���M�<�;S� ����	;}��A"��8�<aj8�f�w"�l�E�`��ðA��N���)��]%��X�ISg|����&}�y�,ֶi���c�\�G
$�8���u��'l��Kp��U8Η�zS<�?TO1py��uΧ�c�zo��Z����<��U���M���t��Q�TbG5Ŧ����ɨ|�g��C���4�1���s�`ʹk@Ƣ�cZZS�[��H�,}��*��v#�w�<�5O���)8�$rl��(�&\M�i���kO�T��
��KE�./�bIӊ%�V�
 [...]
g�S`~�O� E�[J�S��!�EH�S�+'D����̶�?������O
�%��;�!��M���ߩ���YUtP�%5���H0=/� �ۿ��E��A�E�����	U��)0�@��1d�h�K8a���(���;n�_��P�-�d���xN}B0`���G�O"�Y�'}CO�NzvU'=��W'�����{븕��k5�<��z7Ws�?�#2Ĝo��s�O
+�����"�l��{~�q0Q.߆�ι�Y�S]��v�F/s֊���i+��0l��B
qC�A��ɛ7�������!�վ�Y��-��M^~�,sR�3Ĺ�"�v�F�
x�.I���u�W��_}߽���r����CY>^]^�n��Iv� �O7��e
�vC��ɞU^4�x��r��Pjh�d� 
+endstream
+endobj
+12778 0 obj <<
+/Type /Page
+/Contents 12779 0 R
+/Resources 12777 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12775 0 R
+/Annots [ 12776 0 R ]
+>> endobj
+12776 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12780 0 obj <<
+/D [12778 0 R /XYZ 89 770.89 null]
+>> endobj
+12781 0 obj <<
+/D [12778 0 R /XYZ 90 634.093 null]
+>> endobj
+12782 0 obj <<
+/D [12778 0 R /XYZ 90 543.343 null]
+>> endobj
+12454 0 obj <<
+/D [12778 0 R /XYZ 211.842 479.094 null]
+>> endobj
+12783 0 obj <<
+/D [12778 0 R /XYZ 90 474.456 null]
+>> endobj
+12784 0 obj <<
+/D [12778 0 R /XYZ 90 379.969 null]
+>> endobj
+12785 0 obj <<
+/D [12778 0 R /XYZ 90 264.91 null]
+>> endobj
+12455 0 obj <<
+/D [12778 0 R /XYZ 216.764 200.661 null]
+>> endobj
+12786 0 obj <<
+/D [12778 0 R /XYZ 90 194.644 null]
+>> endobj
+12787 0 obj <<
+/D [12778 0 R /XYZ 90 123.315 null]
+>> endobj
+12456 0 obj <<
+/D [12778 0 R /XYZ 90 81.969 null]
+>> endobj
+12788 0 obj <<
+/D [12778 0 R /XYZ 90 77.486 null]
+>> endobj
+12777 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12792 0 obj <<
+/Length 2076      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~ׯ�SC�x���(��l�$܍�]�D�D%ʡ�����
��H��X��M�O�əo�\�;�2%Lu������?������X�T0�,
�"�y�>J4O�Rތ��Q��noƌ����1�g����]e���r@�D����]<���ۛl
&\�����۫� ���Z��)������q[�x
O���V޼��X+�9_�A����"Z�=�tlY/�Q
�i��sM�2��X)��w�}\�3?NPC�T���=
}3
�4|J(�+$�&�-G�?�`���E�pk�OŠe ��"�a��m٭�����p[�4�hi��!IGE���Q|
\-L5 �<�i��QK���L x�%;��Z���;�j�%��ܭV�>�Z�xm�s����O+.�v�^�E���f�!1��k)���y���� ��zM8���tȥ���N��F��x��AA%�l��Q����,���TBI�|��h_�n\�}yH��T�v2�\�*�F���0�p!
��

Ԝ����뭩-�r#�QTv��}�.�4�P�J�Wom��H��	����G�s���]�s�e�Sy�\&�&SD���{ܻ6a� [...]
+]H7�Y<A�H�
�[�
+�P�08�(V9���:I�x�}���6��\��K�H�����QA
�J��JYWT��J�
P�"�jK:}�Vc&�O��DI_L
�L������ �svq@�u'��P
��(����	g��4IR�Q��-br�Z�な.����H"�A��̣�Rj���:�^�_2��%c�d���
x��/9�*������aWɼ�b����J$�ݙ&��ufH�;ij >�����R��f�7��X��]�	��1%ud6�PM�8B!'FB�4�$ǣ;���\S��\�U�f[�m�l	s�n�
1�55���zR��(O"rL2�9+���3�>����#Vk9%	���靌��}�>Z�j�AR8�� �P  �J�
+�g
͂$�(`؄�
+�]U��<�y	�ف0��!%�xPG�3yPK�ϝ�~

t�������H7�
ˋ0�� �	W[��A�
�#�,�8fi�Ä,E'�+�/j�Q�"<�D*�˔�)��;}��AV��uPZ��.�|f�$�Vڏ�2i��1"��뉜�����M�
(\"�п-++l�Q/BUA�� �0�����G�Y�'�S8���H.#Q���h��kܑ,sƱ�C�0�DDԷR
_گ(P(Ӆ{h�
(E,��ML{b�G��w���u<�w�����
�Hl�|a��!��]�|����
;.Q#l��0��6Bʼ^�WD�A
��%h?�+����*�:��Y�$�R����B)��E�G
"����G� �_
+�?cc�Y�a�h
;$�t]�<d��OlN�K,1�6�j���H�47/�K
�~9��֧T&�e��v?IP��d��*R��
m��Z��T�%ug/�fa]��LK�>�ֱ�ElN𜠒
�O��)�0
�����A?�7 /aJ�E�p(�4��S�z&SjI�[3�� ��m{*'�a�����T)�%�E�G��;���Gu�;�9���ڐr�^�Cb�g�ý�-[ɭEϤl�s�l/l&;kvB3yR6�TF����
�Ɋ?"r?u�`~�~2��h���^�

� q�b��
+=�K��-#��7ޟ���/�FoO���iO(�ZO�|i�[!�
��|>by��L	?�_L*�����n��1
s��|�o0�e_��
�j�?Q�
-����� �8s�?OYl\�%�	����8.��o��Au�ݨHM�� ��b�T��������a
�	�nVn�b1���A�F�UEf�.#W2�갬=����
+�	mHAkV�h�/��僫/y�f�J�Z���
+endstream
+endobj
+12791 0 obj <<
+/Type /Page
+/Contents 12792 0 R
+/Resources 12790 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12775 0 R
+/Annots [ 12789 0 R ]
+>> endobj
+12789 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12793 0 obj <<
+/D [12791 0 R /XYZ 89 770.89 null]
+>> endobj
+12794 0 obj <<
+/D [12791 0 R /XYZ 90 632.584 null]
+>> endobj
+12457 0 obj <<
+/D [12791 0 R /XYZ 90 597.914 null]
+>> endobj
+12795 0 obj <<
+/D [12791 0 R /XYZ 90 593.431 null]
+>> endobj
+12796 0 obj <<
+/D [12791 0 R /XYZ 90 522.57 null]
+>> endobj
+12458 0 obj <<
+/D [12791 0 R /XYZ 90 487.9 null]
+>> endobj
+12797 0 obj <<
+/D [12791 0 R /XYZ 90 483.417 null]
+>> endobj
+12798 0 obj <<
+/D [12791 0 R /XYZ 90 414.689 null]
+>> endobj
+12799 0 obj <<
+/D [12791 0 R /XYZ 90 361 null]
+>> endobj
+12459 0 obj <<
+/D [12791 0 R /XYZ 90 326.33 null]
+>> endobj
+12800 0 obj <<
+/D [12791 0 R /XYZ 90 321.846 null]
+>> endobj
+12801 0 obj <<
+/D [12791 0 R /XYZ 90 248.984 null]
+>> endobj
+12460 0 obj <<
+/D [12791 0 R /XYZ 90 214.314 null]
+>> endobj
+12802 0 obj <<
+/D [12791 0 R /XYZ 90 209.83 null]
+>> endobj
+12803 0 obj <<
+/D [12791 0 R /XYZ 90 139.099 null]
+>> endobj
+12790 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12807 0 obj <<
+/Length 1980      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�6~����f5��%l�
붮k\�-�Ra��Zr���
��,ɲ�L[�A$���sx����2��/��'��g�Ie0�
7HH�o�
�ѻ��I����U1�����/&gvn�t2�0 0�� R:��o�� ���F���S�h
p��9
�
p)K�DT�W�(%4�!�6c
(�‰���i|�'�4+ڀ����`7�
K$��)}q at zS��}c�1L 
G
̷Vd���x�.���Y��(�r	�����3o��0�0
+Ɯq�<:=M��Ï�,���利��j
����6{P���̫��8�j�GD�]�J�Дb�(k):�Z.FT
?��1x�\X�N���	q��$U
��EJ4!��5�U��5m$�^�Q�H+U��^����9��:\�N�(�dQ�$�.��a����h��3��1~�5�,$Q�kX
��;IYt	
+B�*Ε`���ј`��y<���y�,BZ	��T�ap+Z�
+)�k�����pn�F��	�O:|d�;IwL���H��J�Տ=�ط��>� v�T��,,D#�vŗ#����$��n�_��jG�/�#��
���	<f��ط�`��GE�C�!P����,-NA��M���.�[&8=
��F�Ր@�2`L) c�5�B̛��6]�j3��4ܔ�H/��8�ƙS�-x4�Bک,ﱃ��^[�q
p~v��S��
+*��/���K7��Ǯ�L���ĬӞ }� ��jћ$�%i��U�;�k� 	H9�="X�/��̥��=��k�p7����=󫸚n
���i�t
l�؆�����Z�|�S P~�
+ at o� 
��;�V~��bL�MG^ �*$!v�%�<�8$�[z���tX�H$9��J��Ƚ#ݕ��!���8G
+F��+���E$��#�hW{)��N�%�d3��̥,
�|_΅QG����#��np��Ƨ

+�iP(��I�������=`��bi���<��h��V��?-+��R�@�����+[
,��W5���@	�z��c0oe+�h����V��leC �4��+�Jp-���<��M� �Z�OI~��+%
+IHK>v�� a�֮��$�7M��$in�I�
h�q�E�&��⃈��tO
T�5
�Sh�@|M"�)4��"�12%'2��qƠ����,Z7V5DzeD�%E�އ
)G/#j�1�]���Ƚ],�m'������l7?@*�աF܏"1H�R��)���ߖ�
0�8cRA�W>IR���tʄy�I>5��RG��RK��TQ��
�=� S�72����,Y�RBwȒz K���D�v���aМۤXl������tD�p��Om��$�aJ
⚵�'M�֗���_	S�qO$@��Hw���
+�ܖ�}��^WA-�����H
S�	���z��2>�P�E�E�g^�
��0��El����ش�8�����0wo���&,�U7��
�Wv�w $��O;q?�Cm��;�E���\���B̀�q���y
��^���T�b=
Md=ME�zғ}�?g;�\�C �~�����Q�s�LV���N��7[u
d���0†7��2�E:�UE�a�e�y��LYx`f�CE၁y�������o�wI-om�����u�s���f���լs鞱-xU�gN�e����I��*�a��E�`��
�c0�V55
/�YYg�8�! �1�
����
a�D��pU��U�E�J���U�@�r�b��a��w�^S
+țj��`i�
L�
���3Z��z�(��oc�w�+��6[�~*
���Q���#v�R`;������5�B���H���"�5ދ��r���9
�, l
7���j�4($��;�&�6m3��/w/��x��H�ai�?�tUx����V�x��Z���e����ј�K��qy\N�j��hȤ0��Zv��ק''�W�Y�^"�m6
u�����j��o�拪OJR����m�?�˰�
+endstream
+endobj
+12806 0 obj <<
+/Type /Page
+/Contents 12807 0 R
+/Resources 12805 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12775 0 R
+/Annots [ 12804 0 R ]
+>> endobj
+12804 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12808 0 obj <<
+/D [12806 0 R /XYZ 89 770.89 null]
+>> endobj
+12809 0 obj <<
+/D [12806 0 R /XYZ 90 718.682 null]
+>> endobj
+12461 0 obj <<
+/D [12806 0 R /XYZ 90 684.012 null]
+>> endobj
+12810 0 obj <<
+/D [12806 0 R /XYZ 90 679.529 null]
+>> endobj
+12811 0 obj <<
+/D [12806 0 R /XYZ 90 608.798 null]
+>> endobj
+12812 0 obj <<
+/D [12806 0 R /XYZ 90 555.109 null]
+>> endobj
+12462 0 obj <<
+/D [12806 0 R /XYZ 90 520.439 null]
+>> endobj
+12813 0 obj <<
+/D [12806 0 R /XYZ 90 515.956 null]
+>> endobj
+12814 0 obj <<
+/D [12806 0 R /XYZ 90 445.225 null]
+>> endobj
+12815 0 obj <<
+/D [12806 0 R /XYZ 90 391.536 null]
+>> endobj
+12540 0 obj <<
+/D [12806 0 R /XYZ 90 356.866 null]
+>> endobj
+12816 0 obj <<
+/D [12806 0 R /XYZ 90 352.383 null]
+>> endobj
+12817 0 obj <<
+/D [12806 0 R /XYZ 90 281.652 null]
+>> endobj
+12818 0 obj <<
+/D [12806 0 R /XYZ 90 227.963 null]
+>> endobj
+12541 0 obj <<
+/D [12806 0 R /XYZ 90 133.657 null]
+>> endobj
+12819 0 obj <<
+/D [12806 0 R /XYZ 90 129.173 null]
+>> endobj
+12805 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12824 0 obj <<
+/Length 2186      
+/Filter /FlateDecode
+>>
+stream
+x��[[��~���Sc5�wR��@��MR`�;I6�������$�����"%K����LR�$�D
�sx.�'zp������o'W�(�(�TF�Q�#%	�D�i�aJ0Rt6'��͌�iR�������r�d�"��!�/�b{}�'TY�\n�ޙt�0��M1#z��?����﮾!�� U
ᘃ:�zqSz:���͌��ϳ9x��������8�;= �]��2)K'�vөY=/���ע9c
+	��9!(½��<��0�/�<�5�B6"9������/wqDj�r����ɇ�8J��wF,���z�*��u���k��N�WD�
ڋ߿�k���<R��N�,���Le5&Ӳ�kO��
+�O�C�l�2p���-�hĶ��_U "q
�X"��1�0��t_��6����R����{��{�SDR�y�wՐ�T�ո}2.�뼬�$�+�w�-+�r�j��~n��&E��D"r���ۊd8d �/�u�&aK)���_�wa��
�~<�N�()8��Q�!mm:�%�E���i"�W2i�눬��(�R���xn�0�b$☹�)���:�g
O?%�,�K�S������񰧘#
rBZ
+�@�С��qD�:fj/�)��C�-�}*�3*��s��ك끴�#X�I�t��1f�Q��$�vN���nN_�r;)��9P6�R͜Ř�b����*�lO	5���z��T��ҼT�X
�]��sDJ8//�y�HY�vW
L��vU�
p���(2 at g=�
+)����>�
��e ��N-N
2xH�<
�tD2�8t����¨��O���t
�ih���s`+D�c��#�E�L�V �&
��z�n
+;%�1�{[p}]�d��}�Ib�*i$b��8l�>nCm?�(`
%H-�5��sV=�J�BR� �R����Uw �t^�
<�s!ݣ� P�m�M+��G�>�
�h��O�>��(����+$��[A��$At�L>d�2���
���9�P�E�#�}��X��Y�AOu��/�a��k�t�!�a7�3L N�	}���g�ִ���U�
+
?'R#
+�g^K��13�"
�
��X�8�#f<(7L�>'�ƍ.Tc��Ը=�CB�)M�F��2�D��7����H�DȀ:[�먒�����T��
�,��:Ÿ���EH��y	Q����RHK�40�L�Գ�
Q�D���:�B s6-/��"Q��Q�
Q��
Q�#�$��i:B��WŰ��Ȣ�
	� ���8�Y���Ō��Ҍ�Om��
`}Jc�5�+0N��w_0�F�,� ���������K�� ���>ʄ�M�^I��{G}�D~W�,=��!�oL~� !?��X#3�H��C�f=�

�F~.Tc����8�`�I�Ŀ�J��Y��AQ�.�'�"�o��� ��ɐ�v���Q#{�L0N�� M�~��d�$��
+
I�:"/�G�<q0z�҆

L=�
�,�B�<=:�'�䀸�&�2_W�(taN<0���Qpt�口�j�A�+p
��?���%T$_n�()�ͪ���o�z`�H��{��*I�(�_o���Q0f/�
�-|�<7떛�”��f�5,���n���?,L�)��Y9T<���g@�wH
��;{|�L
��7��@�^[
+��u����+2���
��#R�Mޢ����jB��~��yK�,�r8��0,&:ε>cnI�ŸoQl��p��
+��
d�-�s"l!,
}E|��$�POp��J��~�_$u]�.�g��Z
pv�{��)�I���ȴ^�0峁�s�ݵ|N�ٮ{����{�:�S�;�ꦠ���Q�!>��f�u�n��h�Y��wH}�h!`/�/񋥷g�[�E�������|#��YFj.��r��a�8��K��B=F�mO������!�!���-���]=�Ğo��`�>
��%��%��5�

�Ë��Li�P:$�I���j�Zc��l�k��3�k��CԵߙz�u�qKq�ɯ�d��r��5$y�܌
+��R��b�q�Dg���ÿ��hq�
�@���cI��S����1
���9TH���77?����)��	1�!��$�$��X ��bPS�"� �\m�2�\�ip�S�?Q3�~R��N
� .wt��������7����b����
[�\�����q�j�|,�r���A2j��� �IIo�C�M�D)Z���͋���?V,z�'�v�Uk�n
+endstream
+endobj
+12823 0 obj <<
+/Type /Page
+/Contents 12824 0 R
+/Resources 12822 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12775 0 R
+/Annots [ 12820 0 R 12821 0 R ]
+>> endobj
+12820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 182.08 212.124 192.984]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+12821 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12825 0 obj <<
+/D [12823 0 R /XYZ 89 770.89 null]
+>> endobj
+12826 0 obj <<
+/D [12823 0 R /XYZ 90 720.814 null]
+>> endobj
+12827 0 obj <<
+/D [12823 0 R /XYZ 90 667.125 null]
+>> endobj
+12542 0 obj <<
+/D [12823 0 R /XYZ 90 632.455 null]
+>> endobj
+12828 0 obj <<
+/D [12823 0 R /XYZ 90 627.972 null]
+>> endobj
+12829 0 obj <<
+/D [12823 0 R /XYZ 90 559.243 null]
+>> endobj
+12830 0 obj <<
+/D [12823 0 R /XYZ 90 505.554 null]
+>> endobj
+12543 0 obj <<
+/D [12823 0 R /XYZ 90 470.884 null]
+>> endobj
+12831 0 obj <<
+/D [12823 0 R /XYZ 90 466.401 null]
+>> endobj
+12832 0 obj <<
+/D [12823 0 R /XYZ 90 395.67 null]
+>> endobj
+12833 0 obj <<
+/D [12823 0 R /XYZ 90 341.981 null]
+>> endobj
+12544 0 obj <<
+/D [12823 0 R /XYZ 90 239.246 null]
+>> endobj
+12834 0 obj <<
+/D [12823 0 R /XYZ 90 234.763 null]
+>> endobj
+12835 0 obj <<
+/D [12823 0 R /XYZ 90 156.236 null]
+>> endobj
+12836 0 obj <<
+/D [12823 0 R /XYZ 90 102.547 null]
+>> endobj
+12822 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12842 0 obj <<
+/Length 2471      
+/Filter /FlateDecode
+>>
+stream
+x��[[���~�W�)�*����T*UIlo�&��ړ}�\3J`%�����n��H"qR~B���s����Z
�8�n����k����2�Y�$$|[�
�ه�&5"F�S�����ͫo�ٱɫ��oC8 � ����p���0bF��S������	��`D���^3CZ���5 )��t6'�i=��aY��^����"�H���;�R\7dO�h>D�9�l���O:}a?x{�
��P�H���T���^��O3����}��")U��fF�4L�8\��>����E���&�=�—�KA�Z{U.�K��9ÜI�`3�9l��(u��;�
fbCf7���z�Yl7i���&��+x6�BN�@ǂh�v��23$o�Q��]�u�)1�܌�z�PD���]�ӴC
%���@a��E���M���:�D\ �p�Z��s*%�
���#c�Cp���gQ
+�c�4����ɝ�Ʒ�M��p�.��O0�2�Ř.�,�nӺ;�t�ʵ%kZ3�@�+�0밍#�K����/R�*���.=��}nA����i�m+��Ee�B;wG�
~l?D��I��[	dp��>�I�R
Rj~�0��i�m��]c���s0�5��߯���i��

�<������6sh�;砶��
+Eڀ�&������~]	l6&8
��X�(H&�6j�*H�U*���n	��8
����M�y�j
�� �DR�5��T�׹oň����4܆@1T5��q�.��\��U|�e_޻�C�c�^�W���Z֎�h�DA$"g��� Rp6��=[��F�
<�ɵ�W��.+�ZH�|�á�P�>}M. ��a��
"ρM�>I[�}�&��N8(.��$
+V�AL(�
�(�$Ϸ&͖�� L8�p^�ˏ�LM��(ٰ�S���c�{h�N� �췳YV���0��>�Ψ�>:F�q2�
��H�����i>g�|�1䖇
� t�������K_�
�~�bG
+|x ����
Is����y�ҡ5��ߓ�̥�<ƛ�BX9�;�AL�,�a-TU3n�8G�QV(�@�(h%-d�������r
�`~𣣅pS�`7-�u��ŏ�2��i��~>/�C+3gJ�-
+H���sA��2�i�0�4�78��,XK3�B�Q[@	CZ
j
+�Ȕ~v�Q�EP��%�τ9�&���j�KD�Vb�/�̭?HY��c���*�0bV���3��
�#7-�9�
s
�]5������C���2E��)�k��#_[��
+m��8��R n[�l���5��j�ϫ�5��Ͳ���N��:� _V�9��*�4�<s�
::��\�
�QK�d:�-�������D�a�r2��*a��1--�l�����e�6��
�N,
�A��&5���k���x���[�!Ę;X5,ϑy1�� )t
1�o/��	B��H��-��� ;
 Fb�h�������A9Q
+�ts���A�J�p�eVf=�4g-a� 
���
�TV�һQ VM҄����{
0�pr�֤��Tc�a���a*W at .��:L
}�ˣ!?�u
�K��%VФ�ʓk�"�U�_
L�X<�o���e����/B��&�-
�2p6.�
_�ó�C���lM�9x����XxvLK
<�2��x�a�7<����w�?�`����Qy�̣x�*(RZ���	(n����О��Pr���%�v�]w�Y�$��?��6]��
{l�p�!�|�J�e,
+S 3��"Ib�K��
Ư�m�eV@:ʋ*g���pZE
�
c^e\�1o�<�s����;'ę��m���ϡ�x_)ڛL/\��L]
�c&�p�l��uP��[���Vݨ
k9~�dP�zc,ZW-��pZ�\?�>#�V�Z�sz�n/=Z���h
x%�#�gU}^=�^!��p�7�[�
+�;��q��˴Ѻ
���9�x��*����\u�. ���f"�l����=���}�����>
:��
qN���u�
��죣�,��'Q�O6��lL�+��I40�*���u�5
0�L�4_¦�{Q�.Ʀ���i6*p��Lǧ�-CԌɧj"��SR�&r4>5���j��L>հ��r|����B �
�g�<ʦ���Ŧ�~��V?���q1�ß�R�N��W���FI�YD]�$6G��P �B�wJ��' ���Q��IL��:���? �)m�����X3IMj�)���x�u������8�w�d�9~�#MȚF�
�l�ŋ"�l[y��G�3����:NTw����(�cv���o�y��oP0�~���n�x��p��
^nAX%n���`X�c[g��ܖ�6[�߼�[~�4J~?��D�����>�
�6/|�<&J��{��.����E
2����]�u�W��_'nj:)�xE��lw}uu��K��
�p'��2a����wHۤ�u�s�=���(�
+endstream
+endobj
+12841 0 obj <<
+/Type /Page
+/Contents 12842 0 R
+/Resources 12840 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12775 0 R
+/Annots [ 12837 0 R 12838 0 R 12839 0 R ]
+>> endobj
+12837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 673.894 210.103 684.798]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+12838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 570.487 485.603 583.004]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12839 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12843 0 obj <<
+/D [12841 0 R /XYZ 89 770.89 null]
+>> endobj
+12545 0 obj <<
+/D [12841 0 R /XYZ 90 721.073 null]
+>> endobj
+12844 0 obj <<
+/D [12841 0 R /XYZ 90 721.073 null]
+>> endobj
+12845 0 obj <<
+/D [12841 0 R /XYZ 90 648.051 null]
+>> endobj
+12846 0 obj <<
+/D [12841 0 R /XYZ 90 594.362 null]
+>> endobj
+12546 0 obj <<
+/D [12841 0 R /XYZ 90 547.737 null]
+>> endobj
+12847 0 obj <<
+/D [12841 0 R /XYZ 90 543.254 null]
+>> endobj
+12848 0 obj <<
+/D [12841 0 R /XYZ 90 458.435 null]
+>> endobj
+12547 0 obj <<
+/D [12841 0 R /XYZ 90 423.765 null]
+>> endobj
+12849 0 obj <<
+/D [12841 0 R /XYZ 90 419.282 null]
+>> endobj
+12850 0 obj <<
+/D [12841 0 R /XYZ 90 334.464 null]
+>> endobj
+12548 0 obj <<
+/D [12841 0 R /XYZ 90 299.794 null]
+>> endobj
+12851 0 obj <<
+/D [12841 0 R /XYZ 90 295.311 null]
+>> endobj
+12852 0 obj <<
+/D [12841 0 R /XYZ 90 198.538 null]
+>> endobj
+12549 0 obj <<
+/D [12841 0 R /XYZ 90 162.921 null]
+>> endobj
+12853 0 obj <<
+/D [12841 0 R /XYZ 90 158.438 null]
+>> endobj
+12840 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12861 0 obj <<
+/Length 3033      
+/Filter /FlateDecode
+>>
+stream
+x��\[s۸~���S+ͬa�/�e��dwv�Τ�ۗ4�a$��T�D;���= H��@]����G



|8�����}��/�zsq��b�AFR���egJ$(�n�ه�H��%��	
��Y~�vH�`1}��e~����̗������̧���w��qT�o�.�D�~����B:R�6
�q���	t
(3͈W��%x���"b9Cƈ�?�Hm��~��V^����A1{��Ua�.SHH�]����w�]�V�G~
�a!�
+{�����/��8�r���F��q6��?g1���n�,���4{�
\�T��������?�]�6c�)Ƶ��
U����B["���3�	�����vjύ���
+:b��LD�ɤ����
����b	|�M����Hw�pD�ʵ�e��u����]��0�b�󛳪����|���)����|9djp�8+�߯�����&��
�� ���J�H�k�wO56pf���L��!��s��;(i�B�"&Is���1�O��BF�c�I��cB$�
���9D"�T3�9"E#�P�,
�����Y�y�,���!��O���,�
,�
T�
 +�(��P�%s����!�pS�����3U��n�uMA+�,�
+)�nY��P���7N r�O<�a���6��A�_�"
��C�6BL�
���6 <
),�q,i��6�F	� ����%
6L�q̅S����"Na�ܵVk�6F__�wpx����&�*��Zgg �p�M��m$Q�W2��D����Y>�9���
�g��#Fg��x��ٰ�/�
�rc �

�U��^�-J�����k� �V(GR� zS΋|y����V�����ְ��}�w1]5R�=Ő��ڣ�%��A+���E�vpT6a(�D�	b,� v����D[�(@�
+S��j������5����"��`@$
�_w��b��v[`��[0���bV��j��Q=�Sd�l�n7%0��b^D“ "������
b�z�׃�`G]�����1H7�佐�a kc��
��
2�Kf̠Z�b�ϟ$�+��X*jm-��5��x�}p��w6��ݎ����X]�r8XD��z?��P(xsMj��
�#���o��ᡜ��/Ov�
+�Q����'�Altm]lR8{`(_�@ �
���#r������b�o|z��hb�na}�	��
�mypZ�:����	2�-�)/c���
�:_BP�2�
��N�
�TTL��]J�OݒKtՔ��
��筑:�s�P
dڪBP�7�n��G�"%2Pyz�L�4?8��=I���
M�[�����;�T�$C�h1��N 9c���l��cQ�Z�G
��D"��$�� H���
$r���
��C��L
�9T��:������a�:y9�  ��V�%zXAҧ��L+�\�`
|.t4V�E�y�đ�էEV����-Ϧ�
G*���9W�Լ�w�e5if�s5������c=�I+:�'[�b R*��'K<��� Ixr��[���ey��Lw��+�f�1y��
J�v$vI^/�`��kHH�IF�&\g��n,��x��x�uv9^�M��%�F��òze��v�͞���
+��M`���S� 6$%X�}��Al]���HP
ZF'
1
Nf9e��5��+2*���%Y�n���2$�u�:��)1����.�X�~:o�|�I~��#b,��\�#�X�b�lTu�(���J������
�{v���z�a�/
�7bةau����b�F�}
�>�a'ظ
�޹
;�1�
+��ܐ	n�����\����v���$�Ї��k�
��w���إ9�bg��-O��9�&�*���[\E�'���؃�_(�m�]mR줏b��B&�ر9�a'[
;�� B��
��X�Y�ּ��I�r��c']��
��C���R�d�q;��;y�b�2V�]�|�ؿ"�Π�Z%��Kt������
;�fs�~�
Q:*��p��O���
�i��W�I�6w�K���,	'k�x�����R
O���L
}]e�.�~�r�A at me�U�zP��T��MM�3���)$����q�����d?�R�#��򔝡�%
G�S��[��Iv��1!I9�/ �
e�%š$$�;� ٩$HR��dO�Άd�X�i${�����d��$��G��yq�L��!�#s/�N	C��
�ݼ��_�d�]�]�d��
�]cu�k��C�0-s��U��O�	��<�j'j�m싚�A�C^+�o��Y
+$9
g�`���}�ޒ�G������!�
�u��
+8Q�o�?�>-�1�
+N<iA�,���Y��wc��
R~G��_j>��@���G됷�� Z�(���
f_6
+�$<��9ذ��҉R�
�>�o���s��
U �`����R��} U�}`���;�4��m�!� <�o�S){�pl��ܑA��m'D�Gp��ր���00�=��Kb���bT�&��
����w
<<�Q�;��m��!Cd�{=
�
4�!x?���
+�d�y�T�f8�,� �uF�!���d
�`
�
�s�����糌���EVg��#ڝ�D��㇔
�<�'G
qV���O�9�ʮ!�=��'p�c;.��f��v��5������%c���i��,���Z`��C��6�|��� 1�	�u��Ⴆ��@ˆ�Q�(
+Hk���
ڨ�)��F}[�s��$J.��!��#�h�>
�lm��4g�e4=ZFsZ����Ė������.��y�b�O_z?V@$a)�N.ѡO+p�:
�q�!���.̒f����"����.}PNV�wWA�J��3�:�@�,)O��SQB�o蝧J#]Un�-���/���w�Z��=�@|w/fw�#���qSv�?�i�����y�TAѰ޾}�/��*��
+1������Ǧye��'k�b��6	"``�{S�������Ͻ��ɚ��]��k�Q�{�L�����������ߣ�b�]5u�b\_�~����l����r7g��&{nw��$�6� ��ra_pP���k�������O3��Z���;�_`תk
+endstream
+endobj
+12860 0 obj <<
+/Type /Page
+/Contents 12861 0 R
+/Resources 12859 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12872 0 R
+/Annots [ 12854 0 R 12855 0 R 12856 0 R 12857 0 R 12858 0 R ]
+>> endobj
+12854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.269 612.733 238.02 623.637]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+12855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.089 388.587 246.767 399.491]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+12856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.899 151.208 431.977 164.125]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.748 140.531 444.511 151.435]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12858 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12862 0 obj <<
+/D [12860 0 R /XYZ 89 770.89 null]
+>> endobj
+12863 0 obj <<
+/D [12860 0 R /XYZ 90 718.682 null]
+>> endobj
+12550 0 obj <<
+/D [12860 0 R /XYZ 90 684.012 null]
+>> endobj
+12864 0 obj <<
+/D [12860 0 R /XYZ 90 679.529 null]
+>> endobj
+12865 0 obj <<
+/D [12860 0 R /XYZ 90 584.887 null]
+>> endobj
+12866 0 obj <<
+/D [12860 0 R /XYZ 90 506.491 null]
+>> endobj
+12551 0 obj <<
+/D [12860 0 R /XYZ 90 459.866 null]
+>> endobj
+12867 0 obj <<
+/D [12860 0 R /XYZ 90 455.383 null]
+>> endobj
+12868 0 obj <<
+/D [12860 0 R /XYZ 90 360.742 null]
+>> endobj
+12869 0 obj <<
+/D [12860 0 R /XYZ 90 282.345 null]
+>> endobj
+12552 0 obj <<
+/D [12860 0 R /XYZ 90 235.72 null]
+>> endobj
+12870 0 obj <<
+/D [12860 0 R /XYZ 90 231.237 null]
+>> endobj
+12871 0 obj <<
+/D [12860 0 R /XYZ 90 124.64 null]
+>> endobj
+12859 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12885 0 obj <<
+/Length 2868      
+/Filter /FlateDecode
+>>
+stream
+x��[�r��}�W�)!����e�JlǕ�d��J^<.-B+\4 e���s� ���J%~I�q����w;��2������ŋ?�9�4���m�hf�#J��$�0��?^}�	m	sO��/��������{��.~�`�E3(blv3���f\�6�D8�}	���������/h�
%���7[�#����49\"�2m
�dҌ
�ؖ�`1'c��Tf('F�h�I�XΧ��zY5UI��4��s�Ѵ����q�*su�G��D+\0��m���Fӻ�u�w?^L���tR�
���@)_�qT>dj��C��V��"���*�|X��xV>W
�
�=��E)��t}_)5
+���T	��!����̏Wt��O<�=��'�
��6�b��SMۉF/�R�ϐXK�Q4W5BY�A�̴��I�����<l�*q[�):����q�Z��?�{�M��O=uD�5̈́"�/��ɶE��"�u&	��R���n��8�bP�Lܝ�zry9]
%�?�M'�8@�Th'�9��R��J�
 �o/UI�6���8'������^�K���w(��[�<%�xPZ"��bϖoݚ�0�7c�+����9�4a�����
��ҔP#��s���I�#ªj�w�a
O6��*��)�VF��Ǭ匿��y\�d
+0x���kA8\~�\��f9���fxL�~��jh�!����u�00�q��^�b��_��c�0�)g�-�m3SD�^��hlM5h{�ɤ���>ee�q�X�*�ʓ���E�!�~Ym�Cb���l������>�0Z�=�Y�j���� `�
��g��y���I馶Ad�X���Mr!a��A��y�Z���\��s�lwD�H�'J

eΑ�;�B�2��(s0F��D �
��t����o
w�%�fj��6�H�$w��[?=���gF�
^1�I���ܤ�W<j���E�q t��߷肕1Y�	y�
,�>��� x}�ކ��XOdz����|�x�O�߆Dq��6m �m��f��P�����	�_�
�J�w��۽v}��wÑ
䋼@��9|�</����:�A)"��6�g��P{*
��A3e
ߖ���Q[���11Dp�҉��O��!Ғ�t�U�����DY�k��s�8�~:�Q����(��l �2�
�-�BRQ
}W�����[��6�M�J��7�@B]'��*�A¼nQ�K"U}d��.�qq��'�sY=��"b��*�jS�̵ܪ�j�"�&Ij��\�7�*eL�!�
�0��"9;
�� ��(Q�)��zuyYlkz8CS>s��~G����̋|qӎ0ĩM�����
~ײ�p�(��`%f�^.��N�M����^�\�&���@�"���V��t1�>&i�V�1��x�8>iy|� Tޡ�1�h�lɏ� ��>$�<ϡ��'���՚�����U��?k��
r��V���yw���UN?\H#Qp�=��!<)"�&�
��)�pE�D�Aa�"�a#Ѭ�
m	_
+�B�omF�!ʳ���d
�
@��Ӓ2-t�c*�OmqL�-��݂üV��9e-
+����RN��5˖�t��ĜQ�����
ǽ�,X�嵓ML��ΐ�9����XG6
���,'
�ǧ��#�@�R�ת�r$�/Vy��x�ZvCӏH�
I{v��~���td������I
sUZ��o\ �\�~l����LpL�I�S�z���.1t�$\�U{J��{[�8W�Y��X5��}-�3�h�2'z\U'e�ߖd�B��%���Fn���+�	�<jG@�7���O_z7V R+�'���ѧR
+��C��!S!/(�F�K��l/�S�
�Mu�v����r���[
���>�ҷ�d�p1=�*L��O"�4�*_P�Uy�>���K;R��@Y<��lb���*F�Ý=wM)#v�N^l7BPC��"��\�#��<��$b���U��H"�<u�Q�T����=ٸݘ�D-t�(?Y�qd�������Xa��I޻�p�0����qDlC�9D��H���}Dl�+��ح��H�&+�J�~%b���kD��Χ;
��7�Dȣc�92����h�EIJ_���"������|��v"VEw�������a�1��j�a���0�~
gLhF
D��l�dU;'�tPs�;'
�I�r�����'l�V@'�񽜬�D�`�13N�T6�y��Ex
+��H:�I^*K�4'����=�� mv��o�&�
@��q��h�(�D�M�� p�rG� {D�
�
�]ܯ�h?�荆��~�+"���������(zN8F��R��OZr~�kk
+�<Y���e��Ikʯ�@��E���n5���V
��,
���3�F�q�l��9���k�J�-�b���0mW $n�GxAHwrj�؀��S�r>-ͅ�rk{�5��[��\��ar��
+P�Or�w����� R�E�!2�[r�\����k��Gk�0��@r��n����}K�
�ԷĀ'��)m�tsp��$��LuZa��s>]v���[˰��I��.1�Š�}�e>UX�QV
��0�s�� i�q�vEp�b�7"��	;]�q
��CV�Q�
& ���/ 3
2�_Bt�sF�4ACb�&�2f	�D
�K��:+�`k�Iн�6� Yg�#Դ7s%��O��t�
�Sn��[
u�c��V!x�=����
�l�[�Z����/�����M�r��Զ�:��(|Xx�4}���N7�쿢�}��vi8�g/y�ȶZ.�o&
^�=���Q����G�C�1<�l~7�g�
/�<٫%�mč o�X��ϲ�)��y5i�b�}�]��U^�z�Ԡ��_Nj�q��E�g�Z�Ū�
+#
����"���}^ut�n��U��E�qC'C���%@����/>=ޭ��
��y�f�<��M}�o���ˢ\�t����
+�ͽ��
�ҋ
+endstream
+endobj
+12884 0 obj <<
+/Type /Page
+/Contents 12885 0 R
+/Resources 12883 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12872 0 R
+/Annots [ 12873 0 R 12888 0 R 12874 0 R 12875 0 R 12876 0 R 12892 0 R 12877 0 R 12878 0 R 12879 0 R 12882 0 R ]
+>> endobj
+12873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [523.983 621.989 535.938 632.893]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 608.604 261.145 620.938]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.307 514.727 434.874 527.645]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.837 504.051 447.599 514.954]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [523.983 349.624 535.938 360.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 336.239 261.145 348.573]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.631 255.596 429.297 268.075]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.215 243.641 409.977 254.545]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 112.093 267.79 124.427]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12882 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12886 0 obj <<
+/D [12884 0 R /XYZ 89 770.89 null]
+>> endobj
+12887 0 obj <<
+/D [12884 0 R /XYZ 90 657.82 null]
+>> endobj
+12553 0 obj <<
+/D [12884 0 R /XYZ 90 599.239 null]
+>> endobj
+12889 0 obj <<
+/D [12884 0 R /XYZ 90 594.756 null]
+>> endobj
+12890 0 obj <<
+/D [12884 0 R /XYZ 90 488.16 null]
+>> endobj
+12891 0 obj <<
+/D [12884 0 R /XYZ 90 385.455 null]
+>> endobj
+12554 0 obj <<
+/D [12884 0 R /XYZ 90 326.874 null]
+>> endobj
+12893 0 obj <<
+/D [12884 0 R /XYZ 90 322.391 null]
+>> endobj
+12894 0 obj <<
+/D [12884 0 R /XYZ 90 227.75 null]
+>> endobj
+12895 0 obj <<
+/D [12884 0 R /XYZ 90 149.353 null]
+>> endobj
+12555 0 obj <<
+/D [12884 0 R /XYZ 90 81.969 null]
+>> endobj
+12896 0 obj <<
+/D [12884 0 R /XYZ 90 77.486 null]
+>> endobj
+12883 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12903 0 obj <<
+/Length 3363      
+/Filter /FlateDecode
+>>
+stream
+x��\[o�~ϯ�Skc�wR�h��n��t6���"��Jbԗ��d6�����R�l��L��>
�H�����s����������o.����_�/.�6b��Ds=��%td4#����l�~�(1|2e����	��4_�7o'��׋��l��7��?�i�ruU�������]6{��f7o�	��5��N~����k�Zr#M$������
�H�_�7�)Wt�%//�E�JA�DU��s��z�/�fSH��$|�-�6s_M�0Di;�2F��o���2��lu[����t%R��ݾ����
��tļy�"Ǝn����n�m�
}�#�>��/�yA�}�����~A-��."���l�ZI�D�fX��pC��Հ��c�J���v�}��.������bZEyg�
��T�'���b�j�1��S� �)��0�ʶY���@����c��طl�5��'S��,O�_��ld�Sb�
�$!B�}P�$�I
�]xaÈʋbՒһ(�,2�Ԅ�u
1�LH)���1���tbƅ`Wa�?PE'Si��v��l#�0���F�n����櫟����׫��-��O��ݳ�!�7�\<l���hu
�w#���e�a��	���#�(ʳ��e�&��m����K��כ �D�0]��6)��y�b�X��
+
�S�����:��V�˯5
��Ҹ
 ���_����s傏��b&#o��"��8kϸ}���
+���͘���������w�$�
������� �6�
�W (,񐕶t�4�/��o.F����ʩ����݄�qyн���ngSl vx
*ZG�Či�a� �pαD�`��шkT�|4m�"����kC�P����V
�Vׇ�yd���<�"��C�
�`0}(
A7�=/��������_#uXϼ��LJ�ر��V�p�j{2�
+�=�7Y�E�ج�@ #B���h/�
7au��a���Sf%�N�"	�U�FLOs�	[�X��&���&����{�M�4Ǯ"�ܛ�i���"B?�D’d�i�Dqo�����"��}C`��:�
��o,�9n��GxT4� ��q]��Ev�-�
�U	��|���1�05F+��/F1M����}�TV
���%z<��)�0x�Xˡ)|/3�w�3�=�!X��N
Vmu��9��r���[�D��7
X�X��*U3��q��LK��A�>����$УA����
�C��ɫ��~�R{���:@�,1�wK;����#��,�b���6{tg�@�?"�+$���W}Ԗ��ǚdx��)c	
�؏��0_(��u%���$��LNU)#�Fw�O*rs�,]	 �L|7����|5�t���pv�zG���V����T�z`�ub5@�.T at c��{�N��\��~���D�Ԍ�w���ǜW�%MA�j7�l�:o2��4X>"l}Xd�.*�X� ;�d���,*Յ�:��c�����o'
�M�r��T�Pi_)�‡!w�4k��y[v�wj�¹�f�
��p�ea9�-��2�l���?96D���
G��Ҙ;rX7y�̃}ni
d��->e�[���
�绸A/[ҢэAч�F�l��c
_�
��q��9��w��>�L�B�ӝ^H���������`4�������joh+b�~i��=��m
�EQ�
lh+�{�C̬$��	geR��w7[�v��ߎ�J�y�C�+
���ώ�C����a�?���
?���8;�A������R訆Oۃp2i�b#�M��>M�/�u��c(!N��9�i��a���k��LZ������arG�:YT�����OR��/֙?U��*K
�u�Zr��
����$���<�o7WW�
u&G��0ӻZ;L�gw8�Y^Q�;�3�Ӗ��e��r�J�.�rN�OTM�-(�0�i�f��"Y
`aU��P��`B?�����y&��i���i ���~8�4
�T��1iE�X�i����1M�-�(�5P�5�{�
����iJ�qIc��
�
Gn.�PT��z��q���l7��[�Q	��>�s
���5���J�0x�J�H��g�E�SU�P��D�Ђ�z
+U�"�Q��5��y�����J������
+�=�Y��ьjfm/h*Q�&p
Sx��}�m��yې`�	"C¥�9�PKb�
+ӳ	�q����= ���!�8�a0���<��\C����H�Pd{���]w�A��K�?��P��L=���@��U��^���;O�3�~
�2��D�Q4��
�GD��"_���%�R�p;
�S윆���5��<7�+O*�uc���X[�c��e�W9u)B��E�+���>,�W�R����$I�d��
�I��C�a�d�_������Pw�:qԵ�9tO���p'/�
�Ǯ:����
�q�A���jo��_���
͑�,u�xk�S �J_ޮ�����{�':�(�Ue�$��]��
+��§�)TD��F������������i����7SJ��)�*\�P{�N��b�NO�`n�G��'oB?v!Q�A3ʓ%���E
"B���Zn����$��"���
+����6� j�q�j�����VY��2O�i�U�iZ�uM?�}�:V�:l���DҐ���_�ܵd��<g�D�۰��+ʜb�
�PE]�����D���T��_"�V)�v�W��2C>V�hfMż��C��޵����L��D��\��y��9����l��ӺZoC��1��S�S��a
՝C4=�i��8D�z��ݟr��a]�92��
�x�ו�񺟑��m^�Y��=��^C�
+8%\��LbWH�E���}�.�&��4̆�������f�w��vp
fvU"��L��XR&�
e�^f�O����av
�3�p��u�N*�?�]��>���:Y��O�잦k��
T=��
b���
�����gvM�٥��
<��	�˝L��b��;x4�y>ۨ!�]��Idن�
�
<�묱��������N���!w�A��xrW
 w���.��h�\
+O�#w+QH�(r�-�'�^r�,ӯ"wU?�[����k!w�Btbp����V~^nWfn�1��?�]'np���������T�<��=S�hG:���ힾ�~$P�S��5�D���W�A���l�?Ǽ��=O�(�����xݓWڋH�bHZah�
o�#��A9]�	��$N�<m�xkk�+�tO^e/4 �[~:��yq�.����*�[�ꔬ�
+q�r�1�۷���d��'���^�?��S�"���ٙ4˛1r �$��_�Ϫ��P�?�����`h�a�78�.+
��ǫ��O��luOn���j����P�4�� �\W���
+7�>��*
�w�2�5�����-���Ѿ��/�7.���/�0r�c�0O;�
+endstream
+endobj
+12902 0 obj <<
+/Type /Page
+/Contents 12903 0 R
+/Resources 12901 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12872 0 R
+/Annots [ 12880 0 R 12881 0 R 12897 0 R 12898 0 R 12899 0 R 12900 0 R ]
+>> endobj
+12880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.883 661.939 440.282 674.418]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+12881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.008 649.984 420.77 660.888]
+/A << /S /GoTo /D (index_Grid_Generalized_Image) >>
+>> endobj
+12897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 518.437 267.79 530.77]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+12898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 424.559 422.924 439.275]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+12899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 161.107 425.662 175.822]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+12900 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12904 0 obj <<
+/D [12902 0 R /XYZ 89 770.89 null]
+>> endobj
+12905 0 obj <<
+/D [12902 0 R /XYZ 90 634.093 null]
+>> endobj
+12906 0 obj <<
+/D [12902 0 R /XYZ 90 555.697 null]
+>> endobj
+12556 0 obj <<
+/D [12902 0 R /XYZ 90 509.072 null]
+>> endobj
+12907 0 obj <<
+/D [12902 0 R /XYZ 90 504.589 null]
+>> endobj
+12908 0 obj <<
+/D [12902 0 R /XYZ 90 394.95 null]
+>> endobj
+12909 0 obj <<
+/D [12902 0 R /XYZ 90 292.244 null]
+>> endobj
+12557 0 obj <<
+/D [12902 0 R /XYZ 90 245.619 null]
+>> endobj
+12910 0 obj <<
+/D [12902 0 R /XYZ 90 241.136 null]
+>> endobj
+12911 0 obj <<
+/D [12902 0 R /XYZ 90 131.497 null]
+>> endobj
+12901 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F8 802 0 R /F13 835 0 R /F94 771 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12918 0 obj <<
+/Length 2751      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�F~�� �Х�h2΅�m�l�����i`��X"*�
E�q����"iJ�-�}�x��s�Ι1�^������w�1���U�@F1��f��0"x��쇀	�H,�+���Oo�^�={oޝ�:;�tB��#��T�����G
���F,V��
�
+"��w�?����`���}�#Gb8�OO��)#q �DtM
P�bңi%G-�,�<��"Q'����U�%U^Z���

��ۋ�Tvs�Г)UQ���2_��
��y�:+�����}��e>�<���y���Ŧ(�3^�l�fs?��|��4�$���KQ��:ͳ�v9y1����)�9���*�,a�aRN�
+盕�*��:��j��&�l���g3s��hwK
�h�
+8�<T;���Ø�g�GPl(SG��ƒI�xT
�@p��9E��r�����
+�O��;�l�aA�w�6�{�d|�.:P�8���/�S4��(��$BsO����� C(�
�0��X:ݬ�ٳgi6���e:;Oa����6Oq�fc�	܀��>��E����N �8F�
:|�-J�2pj!���0���>�(��O��ۛrY����ڑ�C�4p%CwN� ����ˋs
qm`�(B�6a�Xѯ@OHR�xCq��"A*b-��-�d;��M��v0fC��X5c�E�
�u�0�
�\��npR�;K��LP���"�ҋ�g���r$�!f����
�L1������^��h���u�\���Wp5 B0�
+;@6��8��c�J3,~�-�� Pd�)�?�
Cs��ܤ���!)c�)���^ˤ�Nओ�("����܈u	��1���Y�2�����O�O�y�×�
|�n`)D��@`�S};��DM h�y�}�����j���B��J�������m.���� 
n��� 	��>�Lg�0�u��r,A �B
2�[���{Þ=��o��""�R"��B� 6�:ۺmE�� �R�y���I�
��	��8�+��μ	�ڹ	9��~2��/5U�a���6��
�c)�Rm��uMC�=1�0w3@���&�۱LUX��1�i�L3���D��
+�3�&�R�X��[���Q�)�5
'#��������D��dM��T�h2�ZhϘ��r�M���� .5mYx-��BW�ZgC�.�l"F�]���M��i�o 
*
�Rm�攁�y�����:�(BT�Ԏ|t+(R@€� I!�ǯz8 Z��Q��#дUOU�~h�=����E�]�x"�=
0�I�c�=crZ>=V��g�C�O��N������I���{Cm�M<w�	B�kk�
�L�ی8�杘9
"z�Y<&f��afJ-,�Q�%��r3�tĈ۠z?d�r��	�\u@�iUN�ې$���!+�
�\K���t�3
nCYP=�Ȉ����R"��,0�,�;�,c���,�q������,�gw YL�
H�lq��D��q�oFm2#>=Ԏ�%�x av眚}�T�^VU��P@��H#����y3�H
+A���aF��
�	�>�����
lۋ�jO�jr �����h�L��(F"Ay
"lߌ�}U��f��s��<Jw�$C�IJy��٥������t鷋�v}����	�4d�Y3��™y���?��M��~}Y��-!�F��/�J��PpqSoy�n���
�0i���*��U����{T
+w����QLT
� ?%%�
+�GHxG�С�*�q��鈛Ic���L�.
���?�%��$�:���஽�#1���Y�sgCE钚�'�Oo
&L�'j�jSg�n8 �5��B��*��Ԥ��"�`�{���y�n�Å��"#p��$�k�cStF�R\�rt��wP�1�����!V~�*������&tK
�E�wE�f��R�Մ���L����;�_����'kH.�ÍKp�mV5Q��Y2��f~�����
��_Hn1����#A��>t�о�N�bysx㭕6;�Z�����2�җ�,����Fx�zw;P\��^�x��T��/G��=:j�hڐC��+���˵H
ӗ�Ja
�֗�Ӻ/�c��}����l_�����BBŠ�m�E�ξ
e
�:m6}9��^����
�����F�	��h��Jsz1/��q|JM*�ر�HƖ��ꈚ�ED�2+sG�:�fy60)<��Lʅ��I
���B]L� =�Q�0�DO���C�QX5�\F����H��_�����2Y��ZyJƭ{_�/�)X��M���<S
+��z���o=�ӏ�o^����_���f?�?B�tx����5$�ۦ�E�!p/JP
���.�̳2/��[Wq�y��X�l���
+溬�켜�c�z}�N��a�'���UlD$?:E�Z!] �������tLxǧ�P�>u@�|���Β���*����췜�՘����=��

+�j�Zo�׃�Ň3��(L���c�ك)ޯ`$�؛
��y�
��N�$���6�ȋMYB�҄���a��$��&T���F��
D�6�I�Ī6e�g�r��9
KA�&�v�Gm�����-v�h�
�c�
��I�R`����x�P?���_��f�9�lK�O�WL���e�ھ����~�b��
�m�M��tK��UePF�|SL�I��zz��]����?&��^�?&٦va
�����b�HQj�:�
�9������{����X����1ڊyQUų�O/6���4~;3o?�����?W�A�U�hW���R�� �M�
+endstream
+endobj
+12917 0 obj <<
+/Type /Page
+/Contents 12918 0 R
+/Resources 12916 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12872 0 R
+/Annots [ 12912 0 R 12913 0 R 12914 0 R 12915 0 R ]
+>> endobj
+12912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 539.916 322.446 550.82]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+12913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [457.18 539.916 505.099 550.82]
+/A << /S /GoTo /D (index_Grid_Time_Elapse) >>
+>> endobj
+12914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 320.861 362.353 333.194]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+12915 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12919 0 obj <<
+/D [12917 0 R /XYZ 89 770.89 null]
+>> endobj
+12920 0 obj <<
+/D [12917 0 R /XYZ 90 657.82 null]
+>> endobj
+12614 0 obj <<
+/D [12917 0 R /XYZ 90 611.195 null]
+>> endobj
+12921 0 obj <<
+/D [12917 0 R /XYZ 90 606.711 null]
+>> endobj
+12922 0 obj <<
+/D [12917 0 R /XYZ 90 521.893 null]
+>> endobj
+12615 0 obj <<
+/D [12917 0 R /XYZ 90 487.223 null]
+>> endobj
+12923 0 obj <<
+/D [12917 0 R /XYZ 90 482.74 null]
+>> endobj
+12924 0 obj <<
+/D [12917 0 R /XYZ 90 370.474 null]
+>> endobj
+12925 0 obj <<
+/D [12917 0 R /XYZ 90 292.477 null]
+>> endobj
+12616 0 obj <<
+/D [12917 0 R /XYZ 90 257.807 null]
+>> endobj
+12926 0 obj <<
+/D [12917 0 R /XYZ 90 253.323 null]
+>> endobj
+12927 0 obj <<
+/D [12917 0 R /XYZ 90 170.637 null]
+>> endobj
+12617 0 obj <<
+/D [12917 0 R /XYZ 90 77.486 null]
+>> endobj
+12916 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12934 0 obj <<
+/Length 2623      
+/Filter /FlateDecode
+>>
+stream
+x��[[s��~ׯ��%g����i;��N'�����i��h �ؐ @���{��
�%B�f�'B���=�|��+
�D8���_/NN�Q,�HK*���H�HI�%�E������xr>%x�����|J�X��fi�\�Y\�Iyv�'ԋd���|��w�,�</�$��G=�p���7�l-HCXs؎]�OnJ�'�e��񊼘Ψ��W�_����Z4��e��vٗˤ�������l�^&uf
�f�)$d
�AZ����:��e����8FX�F$'�
���8���(��5/H��|u���R�.ˆ�8�d'�"N�.�w'�<��S�Ya.͏��&
���ȶ�C,����4�*��(�q@ \!��fB}���d���(o�_:1���{�����
	L;n
�+�L�8��"�so��j'>�D!�
c��m`:�@ �3B�8�rޫ7e�s9��qAgg)�\L��.ˆf(�Rk��E:�-�v1E�D�D-�b��I��Y<ƚ����2X5/�E!*�
gQq [...]
+��Mq O��ۅl��m���iY�׋����\���Z0�iQߺQ����1�
 �΋�L9T
?���w����]'s/8]�@�E��b���]�eV��<u[�z[=zK�m3�Ǥ�U
j|[�Pੰ\v�0�
I��o4~3�$)�<զ��I
+��
��u7ͽn����4�3�
�D}-�F��J�|�#���T�]Ju)n���В@G�H�TS�����H
+���% 
�i�½���`P�]P����`��Aaf٠0U�.!_�6�� �mŇ��n�(]T3:�3I�f)�� ���i/��D�F��
Vc����z{�>V"����aI��U��C {ܖz1l���`H����b�,�;Ɗk�
��q?�,o�����:cOVl?&@$
�X�=Y�|�x�H@'�s
��p�jGXם�-c
A|�yo���˜�K�
�%�w��;(/�7׵qw�ݛ;�Z���ͼ�]d&	}4.�r/꺧�R�`-����[O�d�
�j��@
t�l�3
B(c٩ჵ����EXuخ����?�]����]"�Cl7ް�$��I��u
���kq
ׅ�J���Ȯmn{�.4�t�U)�6ˆ�t�w
+x@��6PX	"�����̖�A�6Ƣ�D1�m�h���RKvw���e���5Х��>v	�P^� 
��!#d���iڗ(
g����09"���ܦ�O.�7�
.��JW�S���U���lڃ"�
t��.3�D!��8Ԕ�6�.��n�\��זc6:>��ј 	����:�c����F�S��E��(
��� U�S���z�#w���h{����
��n�Ծ�J����~��A�dc6�O���شcB�`{�y�Aw�T��Av at 81������sm?�
l�g�i��	h�4y<�&�K��c[�8�B�r2�,�
L����)��䤪ӳ�e��Է�YYN���0�)�P%٘�� �U�1�4��
�
+���B�.n��VSd3\~��j�q�~)�� ��״(;��m^{�� ���O��.�s��U~�+{0T�P��E0��<�R�d+�y�ey��6c�������a��6`}�ϗv��V�齚Nh/u�ںi�J�
��<">�G�PP����~�e`8Ք���r�;_�-�UF����|�HRR
�WGX�������1��|5X{��������k�����‡Y�D��_k5^R���/J[�"��/2���!"��ܒ��/D-��`R2";]��)���V��Kj>�Ý��呻�%��.�� ��3���~��H�^jD$=Y��x&
+���4�b��j�F�d��"�
+��O����[���D���ci��54����hf��o�f�_�|2~�F���%5;
%�A�I�Q.x�f�礙�8���ğpݾ�
̈́I�7�i&�f�}|
4#���<S
~<ϔC��1M�
JiϩC�<��b�����"��
s���X� %3\)>�L,dw�F����VU-n��\*�{.�L��3�|����2����Y��q����	� Y���NJ�:�6h��R�O��?����7Ӯ ����$��);j�g�b"��tRe���n�Nn	�����S��<�C!y�C�9��6����ڠ
*�W�V�~v�U���*�W/[�(� Z�
;~𫨄BN��E��.��(޼�;�DT�������M���}ZNܜ!*��PRg
f�˲�4XU���{;��������?�����= 
e�
�0M[�\B�te�+$tܡc��o�ſ������k�}��5��
<\cTڞ�D�e�l���6�s�\��5<��\:ns�m]��NO��n*�@k7��tv�ZP]7�' [...]
+endstream
+endobj
+12933 0 obj <<
+/Type /Page
+/Contents 12934 0 R
+/Resources 12932 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12872 0 R
+/Annots [ 12928 0 R 12929 0 R 12930 0 R 12931 0 R ]
+>> endobj
+12928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 357.195 379.76 369.529]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5683b0d430e6c058bc91b4ba63d41ddf) >>
+>> endobj
+12929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 181.667 379.76 194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5683b0d430e6c058bc91b4ba63d41ddf) >>
+>> endobj
+12930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.217 88.328 424.652 99.232]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+12931 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12935 0 obj <<
+/D [12933 0 R /XYZ 89 770.89 null]
+>> endobj
+12936 0 obj <<
+/D [12933 0 R /XYZ 90 721.073 null]
+>> endobj
+12937 0 obj <<
+/D [12933 0 R /XYZ 90 634.093 null]
+>> endobj
+12618 0 obj <<
+/D [12933 0 R /XYZ 90 521.201 null]
+>> endobj
+12938 0 obj <<
+/D [12933 0 R /XYZ 90 516.718 null]
+>> endobj
+12939 0 obj <<
+/D [12933 0 R /XYZ 90 448.144 null]
+>> endobj
+12940 0 obj <<
+/D [12933 0 R /XYZ 90 394.455 null]
+>> endobj
+12619 0 obj <<
+/D [12933 0 R /XYZ 90 347.83 null]
+>> endobj
+12941 0 obj <<
+/D [12933 0 R /XYZ 90 343.347 null]
+>> endobj
+12942 0 obj <<
+/D [12933 0 R /XYZ 90 272.616 null]
+>> endobj
+12943 0 obj <<
+/D [12933 0 R /XYZ 90 218.927 null]
+>> endobj
+12620 0 obj <<
+/D [12933 0 R /XYZ 90 171.562 null]
+>> endobj
+12944 0 obj <<
+/D [12933 0 R /XYZ 90 167.079 null]
+>> endobj
+12932 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12953 0 obj <<
+/Length 2832      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s۸~���S+ͬ�B��t��&���v�&�d3Z�m����x����B��(ɱ��C;��	
����hr7�&�]����շ�O4ђ����DG%4�%~�&���٧�&\&�j�Y������۟�?�wWo��~��xM�#�L�������
+��D��d�`m&�q\דW���</핰�ܚ��P���&Q$&�r�D�c��o�l[�e��

�<Z­`8b>�$f�,�VAɱ
�_�&��'2aD�&��/�Jq�}�fZ��}NaP��Qe��g�1
�HO�Vx�L��W�_��⮾_dU5񴬜�NY�E��c�!�5�/�P���'��|,������*g,�>�9j�ߚk2��3�`Y˴ΊԸ�{�0�ѴܯW~D����~V2�<��4[�P�}�ۦK��.ݣ�
��g��*�d��,�B��]�y��g=��M�
{96�o
�Ȣ��KG�O���i������@�6�p��=a�"�zԨ}��9�P�T-����b��fsEѴ�6�5����շ4��PE�����+�D�
��p�
��1>}C͕M�1��μ|?�
+��Ĉ*��x1w��y�e�rズC�T;𝉐���t�~\��V�e�Z��f4���Q14��)�ܵ�yC���m�%%
+�\<���Y-$�r�5i�ω
����*۔&\?g��d;�� ������1��:۱[�H!�$H!A!3�lS����T�Q��Y4�m�����d��\��d�]=�*��֙~�i�ӛu�[|��-KD�jg���Tҍp�;�g��Xb7@�QԈ6����˛pG3�c^��"�t.G�9�~P7�B���|߸���FI1x[�ݍ-�f�͖�/(]&͛�^���*7�9���h�H������<�!$؍���&"�i�tPgP �^@Z�/�_q"�L.�GI�����-��㑘��5�g��� n�<h:V��}��iԨ��¨/�%��R�t����F���)oO���G��g�m�7�?���<��𲬪l�-�U^�yg.��"��h����UZ�K��B���ߙ���1=������Q��ؽU�Mf�}�.�ѳ%z���@�9�e$� �"8�Vy1H��:_-�2����
��Z��l:�P��5X����1j:,[�YW?H�*I�;��[ Ǵ彾�=9 at 2�-��w [...]
+�)'/j!P	P��ē�s��a�H��1�����`X��?� �Z7GC����v׫��Mo
�/���c�岬�����{�[�����%:�T�pڏ	�̛��!4��gr@ρB��rզ��b���*7�	

�h@P,A��*QgPև6hk�q��a:g۪4;{͆]�P�g1⃊���kW�ڝs�|,�ۡ��̏��\n�"fB�7�C�+)Ib~�@h��肼���a+-N3(CU�U	5OK=�S�I��ͷ��2�W�77
fmܬ�]ÌG�"W�{ױ���z�8��yY��d�8Epx6�
\�H]r
+�����t�@#R�w���t��#
ЍNѢ%��V16�Q��ރ�2�(
�]/
4�����怓��y��
>��}<��6����Ȥ�a�f���t������K~�Y at 2f|L�{.�c�M �t�0m#�N���n7�8�$R���3�"l5����y��7�&s�Nڭ�|���}[��n��d��r�#����e	D���{�|%	�Txc��ݕh�0�qS���i�D�{��PO��X��r��o(��ΗO��O<��ђ��z_Cj��=T�j�
�<u(y���DM�b�n
�2w�+W�qSe[`�����<h���8D��Y��jw�����AN2��K���گ��_����e�b��%��*3B��h��Q��属L��*8c�c�Q q}8
p.e0��E��ϳ}{���ͬC\	�ݖ��ѐn��᝸���fDr~��7,3
ԯf~;����&{�"����D���Gv��<Dž;-����Ө��v?���Aw"�{�*�~|�ԏu��t^\
+�vV{��K����;�dm?f�)-��~ ��{������~�'oJ;�����@��	
'���1�5����ݻ��������|Ti�--�M�6z��z���P$�ć1G}�%;��ݲ��3X�'�
ܺ���_����!qݑe�9n����ϡ��mz卍R��pc?�'}����
+endstream
+endobj
+12952 0 obj <<
+/Type /Page
+/Contents 12953 0 R
+/Resources 12951 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12872 0 R
+/Annots [ 12945 0 R 12946 0 R 12947 0 R 12948 0 R 12949 0 R 12950 0 R ]
+>> endobj
+12945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 681.422 335.755 693.372]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5683b0d430e6c058bc91b4ba63d41ddf) >>
+>> endobj
+12946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 571.538 243.45 585.485]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 519.278 485.603 531.796]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.376 302.126 385.519 313.029]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+12949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 75.416 149.577 82.942]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12950 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12954 0 obj <<
+/D [12952 0 R /XYZ 89 770.89 null]
+>> endobj
+12955 0 obj <<
+/D [12952 0 R /XYZ 90 718.682 null]
+>> endobj
+12621 0 obj <<
+/D [12952 0 R /XYZ 90 672.057 null]
+>> endobj
+12956 0 obj <<
+/D [12952 0 R /XYZ 90 667.574 null]
+>> endobj
+12957 0 obj <<
+/D [12952 0 R /XYZ 90 596.843 null]
+>> endobj
+12958 0 obj <<
+/D [12952 0 R /XYZ 90 543.154 null]
+>> endobj
+12622 0 obj <<
+/D [12952 0 R /XYZ 90 496.528 null]
+>> endobj
+12959 0 obj <<
+/D [12952 0 R /XYZ 90 492.045 null]
+>> endobj
+12960 0 obj <<
+/D [12952 0 R /XYZ 90 408.074 null]
+>> endobj
+12623 0 obj <<
+/D [12952 0 R /XYZ 90 373.404 null]
+>> endobj
+12961 0 obj <<
+/D [12952 0 R /XYZ 90 368.921 null]
+>> endobj
+12962 0 obj <<
+/D [12952 0 R /XYZ 90 239.031 null]
+>> endobj
+12951 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+12974 0 obj <<
+/Length 3426      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�6~���SW���	x;���m�fgR�ۗ��%�f#�*I5Ϳ���u����>$�	����;wG�������իoci�%���C�qK�%��*z7#�t� �ٛ9����$wo�ϊ�ǧtU&w���2)?^_��,Y�?�ݤ��2]ݽ)�D�
+����z�ëo	LHc����N3���'�2�>�5�|��Ͼ���&@�3��h��r�j7�W뤪,�۹��t�]'uj^���HH-AZ��M��6
K�}�c���-IN��}�����W��4���*Zn�������!ˆi}h
�D�2�]Go�~���x�S�qU����a
D�Y��ڋM�g��m�̩�%�]�>����>]�c�n1��,V�&�r�W�0��
�<��e�9YŸ�O���p�A�w�
�����,0�#�Eoɋ�Mo'6i�T���en�����3�4���rWlj6�o����ݠ�
D���1ߺ��Y�D:�`
G
ʐ���s_k�x�n!�ًme��


����<5[e�4�@|w��m��}>�v3~���y��o�x

d��Rj.
-*�2ZİD��e�W�Gn�5�;tE��^�!�'qҩ�C`�5ª��=�a��o˴J��l�iAg�J�UhR�L������
+I&&g
(��_<�-�yg ��
$��@I��B�ƈ*r��
�
[���in%�g����C�
�@��‚�)�(Q�p,GL*�
��#
�X��Qaf&�B�0�cA�9�
;9�M�߭�`��Ț�D�"���×G��W�H]�� W̽-��;Ý� 
�L�A(
v
��#��x�J�� )"�
0 �j6@�'�
ɺ
+��Q)�1�>��y7��{�y�{�y7�U����>��Cn�����pP�%�\���)-Ӱ&1��V���[�p��\t�ڹ����s at r�����]m����c]TY�h'�� �ФW�[ő�
Lm�
@,DQ����	�h,� 4. at j�:q�6<s	�X��fKxl
�|
,d=	��N۷Ƭ���x�U��I���
+�)V����t1��݅���O�ʊ

ؖ�6�Zʫ�Z��}�|>����6]f
++�8�2��eD�L��}�Hak�֎/���ș� �&�6>1NY�iPn
by�.��a��
+���r�x
Ƭse&�ȓ��2��/ml��Az`�&/00 at t�{����} <5��*󃙌���� A� ��c̘l�&�UA�� �h��P\7(���[Й���tN��ϭsP~�A17�"!(��
J?(�% M���J1��R
H5�[Ӵ?�	��e�e6��
ZPccx�.�L��~6�]Rf����0�``��
��`d.���0�a�~�=&.5$�
+���<��!�o*	D
4�e�:��_�猛����2��B9
+�F��][����Zs2g�5�xˢ�-�Ug�d�?�2��#͘�y�3	�$o�
������T�D�̪p��a���qA�k
;s�" �~M`H��R� QG\�ޫ�:�#���
�(�C�S�,�vuZV"U�R6|�H�Ec���>�2�3�z*��G��0��
�t�����1��{'@Ҥ
Dޥ)Z��
"M}�3P`�y
��ȁ};
+��qސ�y�ns���5uh��XZ6�|�Nҳ�1��@�w?G�%������
���@4vu�o�\�[�1�tf��� �\7E��Ery�V�(F�?
~ɘ�y����&�a��(��ᰂ�03T8��^]_C���,'�lu��ų�
X��0�M�0��:a9 :Z(�\�@�`�~r�!d�:o��¸��genb3r8�x!�,٘��
�2ߢ$/(M
3?L�/@ܴn Ř�����i6�ƴD����o
+/{TuL�iC��M�"<t����C��3
�NF �gHL��
�s����]Z�s.fEy�V�e�hux$�V�����4<
f��0�BιZu�:O�c�� �s-���0O�xn�Ne+;���7��ze�\&��=i��yZ�Sk��J�#�ӕ�c��bT��E�06�_�q���_3�]Gf��Jh	�jb��
�</@ۄ�0�a�g[��
��M�Crd���b
��D�X"���S��
Up�!e\rH�Ź<�=S���|�L>��/�����ݤ�Á9�e�I�- J����nY	z	�n$���?��&bX�)���v~B�-0�}�HWqєܻu��(d�J�)��v��+�)��*S ��j�=��-a���
]������p4H�/)
�x@�0NG��#ѝ����C�Rp��oA
��z� gh$�2D{��"H���{�҃+6� ��~�z��g�cz~Bo�B Bڂ��X��c�E��b��-�)Z,���@����G���K
�ɈQݐ�T
εҗ���o±��bʶ���B�'�F�+�5
5[����y obij�����& ��-؉*ԓ�M�1;���y�UZ�X�ƀ�S�2���


��k�|�0V�PYv�d���Vz�L�l�?ݑ�a7���a��_Lw��E�*!7���ˋSl�TĠ�B��0H�JӞ}�
+ֺ:��Bf��p���^�uW�:��
 !CMG��o��V/k�L��@_O��<_tӀ A�/	�KS�fॄ>?�!�6g�(W���
�Q��0x�|������8'3ws
�A��fh_�a^��n�o��T��9f�Y�
,���j;$k`�jP�p�0N�nj��ۧ����F
P��~.��ZHD����[H�)2z��'���5䈈q>&[H��)R��+�k!]p�m�y��畟�uz�gշ����� �{Y�/��?�;p��,_�-{�B�A�n���"�T��Mה�a:w��yjo5�O��Z56�A��Nl�k�(z��Đ"��,o?;	�������~$�`��s]u��	=B)�����9���X�j��qR���*6m�"&���4�zb>
c�
+��A_F__��4�]��
�lx����158�(��ӗ�i�B%z&�/�M���9L
J�?�`�7�
n�2P#�։�W:��V���&n�M����)���� �%D�G�?<��8��2�G�����+�%ֲ�
��݃(�=e[�x���k𛯑� � �R�
l��NA�〡8������d�d���\f)!C
�N��d�{�	N� #�H�>`9!�=���>�	L Ø:�ʔ���\ަ�!����4}��x=>�5!�P�ef
�K�I;����(�Ir� �B�Q��͛���?UZ�m.��mſ�ܪ\���m�}�� �-SeJ�.�x��B����ګm��g�|3�{]z�����W���*�t�E��Z /�;W��
�e��nn�&H�
 �R�V ��a
0����F��n�ݍW�oX�uB�i�u��ˑ�
+endstream
+endobj
+12973 0 obj <<
+/Type /Page
+/Contents 12974 0 R
+/Resources 12972 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12985 0 R
+/Annots [ 12963 0 R 12964 0 R 12965 0 R 12976 0 R 12966 0 R 12967 0 R 12968 0 R 12969 0 R 12983 0 R 12970 0 R 12971 0 R ]
+>> endobj
+12963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.847 673.483 191.42 681.009]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.164 673.483 266.737 681.009]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+12965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [488.213 595.308 513.996 606.212]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+12976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 583.353 219.384 594.257]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+12966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 395.635 379.76 407.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5683b0d430e6c058bc91b4ba63d41ddf) >>
+>> endobj
+12967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 353.538 182.164 364.442]
+/A << /S /GoTo /D (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) >>
+>> endobj
+12968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 256.172 243.45 270.119]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 179.604 535.938 192.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 166.219 226.824 178.552]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+12970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 80.973 362.844 92.041]
+/A << /S /GoTo /D (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) >>
+>> endobj
+12971 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12975 0 obj <<
+/D [12973 0 R /XYZ 89 770.89 null]
+>> endobj
+12624 0 obj <<
+/D [12973 0 R /XYZ 223.966 586.506 null]
+>> endobj
+12977 0 obj <<
+/D [12973 0 R /XYZ 90 579.866 null]
+>> endobj
+12978 0 obj <<
+/D [12973 0 R /XYZ 90 511.292 null]
+>> endobj
+12979 0 obj <<
+/D [12973 0 R /XYZ 90 445.249 null]
+>> endobj
+12625 0 obj <<
+/D [12973 0 R /XYZ 400.69 356.691 null]
+>> endobj
+12980 0 obj <<
+/D [12973 0 R /XYZ 90 350.051 null]
+>> endobj
+12981 0 obj <<
+/D [12973 0 R /XYZ 90 281.477 null]
+>> endobj
+12982 0 obj <<
+/D [12973 0 R /XYZ 90 203.479 null]
+>> endobj
+12626 0 obj <<
+/D [12973 0 R /XYZ 487.765 84.126 null]
+>> endobj
+12984 0 obj <<
+/D [12973 0 R /XYZ 90 77.486 null]
+>> endobj
+12972 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F75 562 0 R /F8 802 0 R /F24 537 0 R /F91 766 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+12991 0 obj <<
+/Length 1820      
+/Filter /FlateDecode
+>>
+stream
+x��Ymo�6��_�a at g5�W�2�]�
�6k=�CR���Bmɕ�5��;�z���]� �O�I�x����#*�� ��ol���u:8:�,�P�0�^$���W�
9�ӗ
"QoU��޼��x=}g�/��OK8 V�@R�����~	�H��MˀS�E�n�� ;�UEdK#B!�d����!.Gc�1
�z�Zĥ6�

����""I���v�#\"�U���]�,^�ј26|N��y��Ez�"
���BB�i���G�2
F͎4+�5/�
E����>S����]�
Q$"Ǹ�Uˉ�0o�:
<��2��ۋ�:��trqZ�����}9���>/�YH����.�v�sb�K�
�
�@:�kW��֬��<^�w�J�	z�Q����bXJ(��Fi>f�'�~�9x4�5#b�fy�nl/z� t���y�f�4�*�
��oJaЏ ��ou�)�5
&�����2-�I5����U^X�(�{Ī2�3��
T�-�����q4��-6QE2c"8
��pl�tr�9 ,K[��x����V�8K<2H���͞ۃB��0�ͬ6V9�}^�D��n
M=yb��s�@*l?�q#\g
ᔃiZ�o�q݅�+Q�q�
�
+	Q����dA��`
Q.�(���kf>.R�%k�O��ڰu��x���4�j���Rge\M������L�͜��9���,�5)A��i<���"�-��EJ�Hpv %��e2�����Ҋ}d�Jq���9$��|}l�9�
���*02Fg�&�Ы8�Qs��C ��M�Ǿc!����}dn�c=p�1�����J;�P��@D�OG"�s
��A���>+,��g	5^HD�%�}�ͦ\m�І�59㚖k��/�R� G����
;Q�U��-��`� ��-\� ���!�r�E�G���I��#��1x�1T�7�!�F)�7JJa�9���
l�.��F��M���2���&LV1�m
#���`/�C�BuJ��/�.��|GA ��C �ޅ��Nts����XN�og9q�J�k%��\A��\��L���WS�v��^��
��{��
��E�R��6{PlG���un�0i�
�E����Pcrیlc;j���{v�m���N�c�
Ķ����'���{ƒ�ă�䗠,�~Mx�kB���n�$�u�m�݋��
��
~��R��֙�ƪ`�,�e��h�-�����4��S�Ӆ�8J�FgP�
��[�
+w��X �W����*�mӺ�R!�VHo��
NG�C�-��n"RJU]_	���MdHT���&�!!�<id	������\'E��h���~T�0��U�UzY��m5��LN�Hu
��{�_\�Fr8O��ɤ2����
U9e�����iX1���
�\�Ϥ��B�.��
�����9�i���F"4��g$�"��g��w��
�j� �LG\
�\U7Ѯ�����L�Ep(���m�=�f
�U�
\˙����[>X�uZ��P���I� z�f��CD�����f��&�%a������#���w��fa�_[�w��su[
'�\i���0I����3󣲙�{
�8��
^`�֦�
+k�
'>]գ���
����Ns/2�x��o.�P�/�o��"�"$����̉���Z쏫��z��dɂ�9��Aq�;���|`��<�xD�Cݴsz���Z��'Ӡ�#�8k[O�<��Z���DYZ���f��N7�}lU�}P�ZO'	<����,W������Zg�h�k�������n˼�S!�`rY	�v�?�L
=
+endstream
+endobj
+12990 0 obj <<
+/Type /Page
+/Contents 12991 0 R
+/Resources 12989 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12985 0 R
+/Annots [ 12988 0 R ]
+>> endobj
+12988 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+12992 0 obj <<
+/D [12990 0 R /XYZ 89 770.89 null]
+>> endobj
+12993 0 obj <<
+/D [12990 0 R /XYZ 90 575.758 null]
+>> endobj
+12668 0 obj <<
+/D [12990 0 R /XYZ 90 539.247 null]
+>> endobj
+12994 0 obj <<
+/D [12990 0 R /XYZ 90 539.247 null]
+>> endobj
+12669 0 obj <<
+/D [12990 0 R /XYZ 263.597 470.119 null]
+>> endobj
+12995 0 obj <<
+/D [12990 0 R /XYZ 90 463.479 null]
+>> endobj
+12670 0 obj <<
+/D [12990 0 R /XYZ 90 417.521 null]
+>> endobj
+12996 0 obj <<
+/D [12990 0 R /XYZ 90 417.521 null]
+>> endobj
+12997 0 obj <<
+/D [12990 0 R /XYZ 90 371.503 null]
+>> endobj
+1918 0 obj <<
+/D [12990 0 R /XYZ 90 226.138 null]
+>> endobj
+426 0 obj <<
+/D [12990 0 R /XYZ 90 182.004 null]
+>> endobj
+12989 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F118 2438 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13016 0 obj <<
+/Length 1557      
+/Filter /FlateDecode
+>>
+stream
+x��XI��6��W9�s�i3� ��l�4q�C
h�c	#K�$O:��}\$K��3-&=�D�"��Ƿ;k;�fO����!sb4p��N��0 ȧ�Y��'�`2oN0��G�+ꍸ8�(v��&�i-.��Z�7���Ͷ�Y��ͫr���
|W�I�V��B�e���f��e���%!��g����d��d�(��
ˬ�H��&���A
 ��n��#��\iI�3'žov>+D�xs�cw��ԕ��h�Y� /�a[&j)��r�+������!P�0r����줰����ő�Mo�8�2
���
�&�ۀ�Ě渺�GTS�;"����-��
���tz�(����q���F�7����\��څ�����h��
髩^�'�
����F#&c48�F�^绕�E��9h侗��H�_��DydsT�	<$��QD"C�3����^[�?��9�澺#���-�w>c' Lk�+������C�n*EZ䥜u����m���_D����N�͎��خ���St�� [...]
+0�^�
��BW�{j4��1�
�@ͥ��Jl}$}�Y1AUC���F�$������=�d�T�����v������
��(�\�}�60��z�FG��"4�'E��P�@�h���۴<���
��P	>�MR�[U
�U
1��9�P�[�ۮ�?Ү0��lҭ�D
����V�b�����!a(��>�<��p�\�t,�2�Z\�j�
	
|(l�C1��Sm	Eq���a	N�E�)�"��:�cz���"0
e=�` ���LC��#�hS
+�AS
+�Bߗrۗ
�ʣP����|%
�z�&�i<�Xs�x��pܶ��)$��O�����=��F�}g|Y�,�� �Z[?����!B��Q�_�}E�Z�4�$�+S�{H ځ%u�;����|��l�3&��E��:�K3��Ս���RA���VM��{�f��7v��@�Z������%̴#��0����Њ���@2!��+iFAucq�47�Qw��J�e��^��T߂�f0G��~
+�D
+KĦ[=�˓�	��X�2	���vIC�[�Ϣ|o�i=H��ȳ�UV��z_�j�*��W|♺B���q�������e]m&Y�*�J)���q��
+9~>ٿ
�莜��(�F��FE!e�}6Ꞌ�yZ=��q�	X������F�?z��Z
ދr'
+��
��ǔ ��e�|ys~�]3`��|ު�E 	1��E��m�����n��r��� 

t�4�ɮ����7�����
�>�� b�E�>]a��>]��<]�����%%"�
+endstream
+endobj
+13015 0 obj <<
+/Type /Page
+/Contents 13016 0 R
+/Resources 13014 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12985 0 R
+/Group 12987 0 R
+/Annots [ 12998 0 R 12999 0 R 13000 0 R 13001 0 R 13002 0 R 13003 0 R 13004 0 R 13005 0 R 13006 0 R 13007 0 R 13008 0 R 13009 0 R 13010 0 R 13011 0 R 13012 0 R 13013 0 R ]
+>> endobj
+12986 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 13027 0 R
+/BBox [0 0 244 220]
+/Group 12987 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 13028 0 R>>
+>>
+/Length 517
+/Filter /FlateDecode
+>>
+stream
+x��UK�1
��W�̬巠�(�BmzX���cK��=��W~f��[/e�H��O�$+�Mh
��0�!x9�'�*���w[	O����~��� 9K�
��I[8AE|%i���3|�k#��
I��2?
M�l�`BMa3�����};0�f4��.���x�����;Nr��l9��WRJ��'��dLRt�:I�F���mxVX
+�l�Pu�6���
+uW�>N:�
���D3�����L8�d6��
�#��
+�hW�+�/��yV�m-PO� ea׆�o�F;q��@K�F���

���a��l{��cN
�f��	7�}t��ȷ �Q�V}�EMk~��
�q�@KH�
Z�g�]����<�}��ң"
��x��֚�<G��1r�����)��Sľ*\87��!��M�:U����o���=�V\��
U2*���¡}��l���
� 5���Y3,��ώR�f��TV��e�hv苊|��>�3M��br<[�Ʒ���xd�]���7��	C���
+endstream
+endobj
+13027 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+13028 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /NHANRN+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 13029 0 R]
+/ToUnicode 13030 0 R
+>>
+endobj
+13029 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /NHANRN+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 13031 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 556 556 278 944 500 556 667 584 278 611 500 584 722 556 500 778 222]]
+>>
+endobj
+13030 0 obj
+<<
+/Length 13032 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0E�|���"�l$�T�}�i?��C�T
2d�����R�HA:������sk�U��n�ZE?X�h�nN���:�H��
ze
+o=�9�}�e[V[�OQ]�����m��d��
"!D��
��^���|�_��<��HvI�4�P�۽��U�$�P|l���v�e��L"
,1��
-��䔽RT'�iD����Ț�,CY��o�B���IR$M�4P)AY�*�P��
T"�T�4�]N�b� *@
(�@9w1�q�d}�L�	�)�W�O����I�~eb?��/��~��K�<�|�*�	��g�_Ι����]����S��*\7��~���޷Jߜ�
V9lҾC�����ӼW��/�[ʥ
+endstream
+endobj
+13031 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NHANRN+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 13033 0 R
+>>
+endobj
+13032 0 obj
+366
+endobj
+13033 0 obj
+<<
+/Length 13034 0 R
+/Filter /FlateDecode
+/Length1 2792
+>>
+stream
+x�UV
l��
��/��p�~5qB��8	I ��cB��8/'��
�M
BpH�G
4��(�B�B)tе�Z�>�UӚJ�&�6
�D�2�	F�t��k����������������#��"U��ҵ��]��]B�`vr��ԯ����0�
Y����	Ij�\Y�s,
�!������ʳ�/��;<�6L�Q'!���GÛ��&��
��8rX?�F` �֢ͳh-�L-���uvm&��5b]�
b]2y��WQ�Mkq���i/�lp��f-�$�N��|5SL��.�k����\��Y�f&f&��te��h��E�۠�Y���q9+U�J��:�6�R�s�-�i���Q^
+��$%ٌ��PokORJ���銬���eK�+Ao{ƺ��2:���:�R![��W��7ٳ34���23�h/()�>m\Ы֨K�P�x�x�)}5@)�PIE��zB�PKnMA��~ƚ�K��z�RQ��:(�
�X���j��n������.�kp6��ąbC�a�E
Ź�z�t��<#}4�J�N,��c��
Q,.V=��v���v̍MS	�'��\=����dU���i���
#c�G��:�Vf>����Gh⑖诣����E	��1��D��B����7}�N�35р�����SA��]�Ӆ�9fm演��w�f��é>�)+�Ҥ�ۉނ,
�Gv�s����V���<ߒ� 
r�����5����ji��kb�BW=�&$�b4�[L��c2*,\aHgT�N�E�[H�|���F��3
�Nj��e���4��z�e'����,�ӱ:n�L��
p�3�jm.Y��	�&� ؏�z���Z�ᅭîWkC!ou ���]\t����+h��`��{t��w� � �
+n[����9�HK�aKf�����
���`s�
"8f
0�烃q|e�A
+֥�

qZ9s���
6�c����l�Z�	`յ+�0�V
�1�Fg
�|���юޱ�L����|6?W���lD�_?�L=����G��1ف�
�dB�<�}S���Ȗ���U?�!��_�[����8�>�)
/��Lݣ�2�&�V�7w�
U~���]��H�Т%<n�?-6M$v�g��r
���OE�h�V����ً���A����g��TEt�C2#!��&�bK�6A4S�g������"?z�����z�]�=���� ������R�l�̆�
KF��Pb�����
2��z�&vl��n��Ѿ�
۟
:�c�d_�?�Ƚi��"��\4�D�>��j)r�8�'��a����}�-O��i�
Q�LU�|������g::��TW���[�jA��}M��(�7Gz�D�z��qt��u�?�ېǬ�����/f
��J�� m���6�&�/����D�(r�R���NK��}�������V��`+ S%g|a1���������a���}s!g
����.��In��
�C��x���ty�5�"O�ȇ}�]+�ݦ��'�K��:cMe��PK�(7˦���_��t �9����bf�D�z�
r�4'd��~t5J[~
_�/�zs�'��ƆϳkS�����{9
K
�t9��4[TP���Ҋ�//P�܅������b��
��p��|9�of}�u�*�MP!�\�����W��^y��]��$�%��Q+n�����==W'�J�QF�n����7N*��񕃷�B�o]�LW]�2yN�������-ˊݍ��q94r���� r��

LMW��f�J3{�B=����E
H��*�N���A��g�[b1�$㗋�BI�ro�m��'�r*a�D�}R�#�&
h�x�� ۀ|5!�2H&ṒM�
�c!q��]��o/�I�x�R��\��o���\��sR��nB&�D2��p[�B:_~��L�����㟕}B��	�Ŋ��B���Ա��
��:���
c̑P&(��j�e�HF@�|��`�&�G�ؓ>r;Y)�<ak��V��gҁ� [...]
+endstream
+endobj
+13034 0 obj
+2094
+endobj
+12987 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+12998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 410.114 186.747 421.017]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a67922c0641253df46bb34952904c08fd) >>
+>> endobj
+12999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.723 410.114 300.469 421.017]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ae93b5801e403e1dc169b6891774756cd) >>
+>> endobj
+13000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.979 410.114 361.061 421.017]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+13001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.31 410.114 401.18 421.017]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a13dbdd3f93f360c7f782849c479196de) >>
+>> endobj
+13002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.124 410.114 483.77 421.017]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_add9ab074eea7f301ecc4a10457c0b83c) >>
+>> endobj
+13003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 382.007 160.814 392.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_af6d5c806d659ad7d4dfacc99d4795297) >>
+>> endobj
+13004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.791 382.007 274.536 392.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ae93b5801e403e1dc169b6891774756cd) >>
+>> endobj
+13005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.047 382.007 335.129 392.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+13006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.378 382.007 375.248 392.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a13dbdd3f93f360c7f782849c479196de) >>
+>> endobj
+13007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.192 382.007 457.838 392.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_add9ab074eea7f301ecc4a10457c0b83c) >>
+>> endobj
+13008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.562 354.274 226.308 364.804]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ae93b5801e403e1dc169b6891774756cd) >>
+>> endobj
+13009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 326.167 171.514 336.697]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+13010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.253 326.167 214.124 336.697]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a13dbdd3f93f360c7f782849c479196de) >>
+>> endobj
+13011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.356 297.687 196.002 308.59]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_add9ab074eea7f301ecc4a10457c0b83c) >>
+>> endobj
+13012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 269.953 150.493 280.484]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_aecd9a36bb78f2cd4987654e4164469ed) >>
+>> endobj
+13013 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13017 0 obj <<
+/D [13015 0 R /XYZ 89 770.89 null]
+>> endobj
+13018 0 obj <<
+/D [13015 0 R /XYZ 90 429.213 null]
+>> endobj
+13019 0 obj <<
+/D [13015 0 R /XYZ 90 429.213 null]
+>> endobj
+13020 0 obj <<
+/D [13015 0 R /XYZ 90 399.372 null]
+>> endobj
+13021 0 obj <<
+/D [13015 0 R /XYZ 90 371.265 null]
+>> endobj
+13022 0 obj <<
+/D [13015 0 R /XYZ 90 343.159 null]
+>> endobj
+13023 0 obj <<
+/D [13015 0 R /XYZ 90 316.778 null]
+>> endobj
+13024 0 obj <<
+/D [13015 0 R /XYZ 90 286.945 null]
+>> endobj
+13025 0 obj <<
+/D [13015 0 R /XYZ 90 241.042 null]
+>> endobj
+13026 0 obj <<
+/D [13015 0 R /XYZ 90 181.737 null]
+>> endobj
+1919 0 obj <<
+/D [13015 0 R /XYZ 90 69.411 null]
+>> endobj
+13014 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im20 12986 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13062 0 obj <<
+/Length 1826      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~��0����!)�������[�Y�aMQ�2ck�%W������"Y�e'i�a�D����}��cl-,l�2�y::y�V�BN�5��Bl�^�������w>M_Z.	9�R�O߽����~�c����ˈ�����X�j���������ֵ���<�����0�m��.Q&�?�YH,BP��U�WB�
+#�s�cl�;Գ�b��CGA��.i�"��^��糎�K�<u�o�b^
�@q��q4�������Y�8�o&��u*V"��*ɳ���^TŎo/��b2Q��<���.{�(�z�#N���e%w=yNiǰ>�ܚ[?�=Ӄ���S�gv%U9$��(
�z���ŝ�Q�$Yc��b���n^`
0lT	gLi`��`PQ�,ʊ5�O�s��&�<0Әzp@#�
�0l��
$��K*-��.�B?"�)'��6���k�`	��Te��C�[�H��Ué|��i5�K�8�̅�	mg2� u��,|���z���r@��P�y���+\Z�
+���Qā���630v����
+���(;�� �������
JYg��q� �T t��!�����{5I����pk�Ι9E�������s��=�5ҟϴ'�m�=�ǚ�
�� ��E+��3u\�M��tY�r���8	��y~O�l�=�� 9Ӑj2�kg;�DU�]�� �gv�����=`�@c��
��Y���<��Q
+�>�6P_����߯�8�Kc�j)�����).#
a�j�'�����~=��izd�
��n(�
�����F�f����7Y,K���A�J��ɸ�{c�
�0��=�tL�xc�֧���&�*CɋL�R���&7��	���ZR���C.��o��1M�f���І�(|�㻻	;�JQ�
X������(#߆�

������i�� p
�����_�l��bH�'K3�a[	
�Y�=(��~]'P�U Ӱw���
��hqW��`��uh�B��I{j���	��	�} �i��O��t�T�^�Y$W�8RTUE2s(�7�(��.�@#��ET�}nsϺŬ\�e"��C��{��e$�<�56�
�0h���<�*u���
���Κ�M�ڑ�V�ܘ��xp1t��"��r�p\�U�"��G�Hط��j�̼�^�������
�@f��Rω��1��o7�ށbLx��{�!
������g�#�
��I����A�pOy�A��	�P�n%���ǫ�#q*�X�bD��2
�]
���z�BD�DsͳԤ�z�Sg����@�m6� [...]
+��g���]�@k.SA�Ӛ�j ��PK���.m�#
G�  3uT8f���'��z>E>����}�n�C��`�I����O<��
t�y�/��������β�+�:l��x�`�۵Z��@����μ,D&�M��e��za�2O�\�s�(,cP*&��ٴ��[���fv3��}�#�{�߷Z
��Y�~��
ߧj����5��ɋ�k=�A�V�䍷q�
�ڞCm�z�.2�����p�^�b��o�l�N�j4�E� HY"�)9c�� 껒��F�W#��AK'�4
������d�Y�"[� ޡ�vqI�o"gC�U^4Y
+>��P����<
+endstream
+endobj
+13061 0 obj <<
+/Type /Page
+/Contents 13062 0 R
+/Resources 13060 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12985 0 R
+/Annots [ 13035 0 R 13036 0 R 13037 0 R 13038 0 R 13039 0 R 13040 0 R 13041 0 R 13042 0 R 13043 0 R 13044 0 R 13045 0 R 13046 0 R 13047 0 R 13048 0 R 13049 0 R 13050 0 R 13051 0 R 13052 0 R 13053 0 R 13054 0 R 13055 0 R 13056 0 R 13057 0 R 13058 0 R 13059 0 R ]
+>> endobj
+13035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 596.35 169.86 607.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList) >>
+>> endobj
+13036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.107 596.35 250.943 607.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
+>> endobj
+13037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.198 574.207 157.962 583.343]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.46 574.207 189.224 583.343]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 544.146 169.86 555.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1EList) >>
+>> endobj
+13040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.107 544.146 250.943 555.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
+>> endobj
+13041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.198 521.212 183.974 531.139]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ac65580697872861b2dd6ca5088ac20e6) >>
+>> endobj
+13042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.473 521.212 241.249 531.139]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ac65580697872861b2dd6ca5088ac20e6) >>
+>> endobj
+13043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 449.496 169.043 460.4]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a3a053d1adaafb348e3bad677072ef425) >>
+>> endobj
+13044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 421.202 176.792 432.106]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_add323d329ab401717a910d387cdfaeda) >>
+>> endobj
+13045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 392.909 144.674 403.813]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.654 392.909 168.783 403.813]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a3e9f7bde672c12c6ae7e756b95322ead) >>
+>> endobj
+13047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.664 392.909 409.746 403.813]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler) >>
+>> endobj
+13048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.008 366.134 243.033 376.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) >>
+>> endobj
+13049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 352.66 144.674 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 352.66 167.628 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ab8bd17717d507e18820a9551ab84a604) >>
+>> endobj
+13051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.444 352.66 202.208 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.084 327.141 148.995 336.786]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a5a818a5f473f962780c537455841b47b) >>
+>> endobj
+13053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 313.407 161.013 324.311]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a0ae3b5779ea65e64f5bcc20db688c7b2) >>
+>> endobj
+13054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 285.114 144.674 296.018]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 285.114 169.153 296.018]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7836c5ddf1d77728796eb9a89575c6cb) >>
+>> endobj
+13056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 257.194 144.674 267.724]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407) >>
+>> endobj
+13057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 257.194 161.551 267.724]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a5a818a5f473f962780c537455841b47b) >>
+>> endobj
+13058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 228.9 150.493 239.43]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7f751c08cc4c3bef195bf163632412c5) >>
+>> endobj
+13059 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13063 0 obj <<
+/D [13061 0 R /XYZ 89 770.89 null]
+>> endobj
+430 0 obj <<
+/D [13061 0 R /XYZ 90 721.073 null]
+>> endobj
+13064 0 obj <<
+/D [13061 0 R /XYZ 90 613.545 null]
+>> endobj
+13065 0 obj <<
+/D [13061 0 R /XYZ 90 613.545 null]
+>> endobj
+13066 0 obj <<
+/D [13061 0 R /XYZ 90 563.331 null]
+>> endobj
+13067 0 obj <<
+/D [13061 0 R /XYZ 90 468.689 null]
+>> endobj
+13068 0 obj <<
+/D [13061 0 R /XYZ 90 468.689 null]
+>> endobj
+13069 0 obj <<
+/D [13061 0 R /XYZ 90 438.661 null]
+>> endobj
+13070 0 obj <<
+/D [13061 0 R /XYZ 90 412.094 null]
+>> endobj
+13071 0 obj <<
+/D [13061 0 R /XYZ 90 370.119 null]
+>> endobj
+13072 0 obj <<
+/D [13061 0 R /XYZ 90 331.126 null]
+>> endobj
+13073 0 obj <<
+/D [13061 0 R /XYZ 90 302.573 null]
+>> endobj
+13074 0 obj <<
+/D [13061 0 R /XYZ 90 274.279 null]
+>> endobj
+13075 0 obj <<
+/D [13061 0 R /XYZ 90 245.985 null]
+>> endobj
+13076 0 obj <<
+/D [13061 0 R /XYZ 90 199.684 null]
+>> endobj
+13077 0 obj <<
+/D [13061 0 R /XYZ 90 140.296 null]
+>> endobj
+1920 0 obj <<
+/D [13061 0 R /XYZ 90 69.317 null]
+>> endobj
+13060 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F22 2982 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F24 537 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+13104 0 obj <<
+/Length 1748      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~��0�����U�a@��Czټ&{j
C��X�,������;)�rd�M�t�h��s���
I��x��}�����d�Bʧ�wu�)�I����W����	�x8<
�E8��(
��z��"��NfEX���'��s
%e�g�?�X��T��iX���V_�bD���"��
���ч���߮��
�r$/Z
�}�^
�_z1x��N
�S�Ի
�5�N%��0M�p
+*�����~ҧ 嵂��!�GA�CV��bH���G�cĥ�11
+
2�V�-�§��B���%�(����"�#�p�4H��ю
un��C �IVf�GR��
W��
W�	\
ɡ.j��������@g;�rĸ�S>���
+� k����B�:���ƾ	�#n
P�Jܳ��q�2�\3�v��tU��	��Ŗ`��|ʭD?$Y��bm{�ꛞ��
+`�񧞹$���tX.S4����
+|�t����KI�	u�	��"��"�¬Q/N›"\��ya��?GĞ�f�O�W��
+�V��!ޘ���aD)�O�e�]lF�g
J��9�m_
jF����[�5$�Da���E��jTL��2�^�ta�/VYT3�W�
��93D�H`G�����X��X at 0���*L�'#|q�x[w�!�_�� Nk���Z
Tb�6�x�1�3���@���<ӻY�c��X�D`�j�M����5#� f�!�H��[]����x�2O�J;.Vy�s�Y�H�0M�c��Ga��F��uZ����D$�[F1�E��q�c�t��Ii;u4��v"t8dq�3|����C��2�d��=Q�MnW
��=Q�7���"4ɥ��UTA0��e
�|N�u�q֩Ŝ��

��r��sKц�=$b�ކg0��c��0q�&�
��,utN���%
+��G�9���]9�/~�iڦ����H ��=�܆�@������ǡ6`�c_XN��"�D�P��ܗG�F�#��C��UIG�Z<��.;-J,��Q���O]U���u8���Խ
/˫N�k5��P����GD
W�����C�Q���c���4;���
`s����� 0�g�_��MC�!EK�Y��,ߪF�ӄ
�n��0-�F�YQ��Yd
��Z>'�]����ht�s�3,�*�A
�J=:Ŏ�x�O�ݼ�2 �ƣ���|o2G���#��(���ʰ>%K��A,,�$�ƫ�r�e���P��fK��<Q��
�-[��R�;��6�]�"t�����c��P/��
z����
,�i.ԩ�ı���0����*߂��a|Ԥ�{"��2H�dx]���^�A~��0����0e�O�
+݌b��bi��WQ��7�����O谾^(\<q���nSކ���U`�RWe��!��SĎ1�! `��1R�
��Q��b�Iv�%a
+�1#�PQ-%���^��rE�,�W��^E��V�:��M
{�M@�!���򈪎b��_W��^��zZ&_�Z/�ݩ��*L�nl�Mg�J�����
�֒4���=εbuNqہVx�1�Vˤ9E���Cd
+D�<x�$(�D~w�kn�
�J�?���`/�,4�k7��A�I`n��o\E���A���������@8��Ա9ʙ缾�d��6�.u�	��Zo¬���>�u��
!�,

<]l��
o����g��mƖ%F<hO0�U�<?;��n �ݠȦ�.��tQ��U��	 �ߜM�i5wY�-67o����k�D��a��s��v��
 �
+endstream
+endobj
+13103 0 obj <<
+/Type /Page
+/Contents 13104 0 R
+/Resources 13102 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12985 0 R
+/Group 13079 0 R
+/Annots [ 13080 0 R 13081 0 R 13082 0 R 13083 0 R 13084 0 R 13085 0 R 13086 0 R 13087 0 R 13088 0 R 13089 0 R 13090 0 R 13091 0 R 13092 0 R 13093 0 R 13094 0 R 13095 0 R 13096 0 R 13097 0 R 13098 0 R 13101 0 R ]
+>> endobj
+13078 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Decision__Node__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 13118 0 R
+/BBox [0 0 212 192]
+/Group 13079 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 13119 0 R>>
+>>
+/Length 420
+/Filter /FlateDecode
+>>
+stream
+x��T�N�0��+���x�m	�P	!!q "q�z�j�(~�q�N[N(Jf��?��B�@�_CP�"د�	�Az�����l?���S ���*fs@���p��-� #n��+4�m�E
YS�ҙ�
+N%���j��%�	H
�$�!��e�~ڈ C��'��0
j�NL�V��4k1�BD��KR�ʘ��u�&���FM�z8VX
+�R6yBNm���S�3�E��X�l�
g+�����rP3�Ҥ(O��'[s;j���	�ս]��	b[��qj�)7F�p�r��4�h��qڮ���x�J�lO=Yʔف�>��������7�O���Q��@][4��ؽ@.����?j��ݕ�|c��5�`9�i�J�]�:'�+X������XQI�k�\����xa(�鐝�OŽ�t�
+endstream
+endobj
+13118 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+13119 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /PCEWGJ+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 13120 0 R]
+/ToUnicode 13121 0 R
+>>
+endobj
+13120 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /PCEWGJ+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 13122 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 722 500 500 556 722 611]]
+>>
+endobj
+13121 0 obj
+<<
+/Length 13123 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>�]N��љ�P������T�1Dg��7�)4����s��I/�sc���w7����
���)����IDNzPK��W��I���:/<6������Ë��V�=�㇄��7��
�J��K���f��lʒ�&ͽO�"�
��`�7��ò��/�s�Ly`�'�I�l�b'͕�*󧦪��N��z�����[�.|x��Y
(t�C�S*�iP	_:B�t)�#��Agh� 	*A
� �@E̢��,
�/�
d ���H��
+���(�)�� �WDB}e����wۅ����9?��0a^ۤ������\���
�^
+endstream
+endobj
+13122 0 obj
+<<
+/Type /FontDescriptor
+/FontName /PCEWGJ+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 13124 0 R
+>>
+endobj
+13123 0 obj
+319
+endobj
+13124 0 obj
+<<
+/Length 13125 0 R
+/Filter /FlateDecode
+/Length1 2024
+>>
+stream
+x�UU{l�U?���W�Z�b}��ֽ���؋u[����
+���Ѳv��@�!�0�	
Q���13�h�b��
�1��`�A
�����~݆~ɹ����{
�sν@  	j�B�p$��
� �
��>0ڹ?� �H�wF�r����{� nHާ"��"o
F�N�VK6�B����p �	u%��	L��i�!�
h�@G�"���:E�N��S����o�ť�&ڌr}(B�Tx����0(tV���:l&
����;�8���\�om�_���	�*]���0ɢ�P�G�4
+��tpV�Z��N�Ԡ7��n�Ir֐jb3��$��QM�E*�Kz-0R��bИ
$��΁��
e�ڪ
�FSuyE����g�l�r����ktsJ��ݷEkZ�)�HJK�YY�������pP&�{�0p��B���N���!�UK\>���XoNS�˴e��ʶWr"<ӈ���gtŲ44������V[�(������J���@e-���"c�~?	Y��M��+3���к��
H�:;�[�`�jGc�
��~*�Q�vr�V/Ui0v���'�f�cS��F�����I��^{��
I�k�|��ƙ.,3g����>�c)G��S�M�6��
N�6��L�f"���{���ي��i.��R��lxM�T���|8�_Q��U\8�
+V�d}Am�כ�Z���%cβ����.����{�X�X3cU�:�<�F�
8�t"�z�����)�I��;j��_�
?�r�e"S�&&���}���ںc�г-��"*v�lK��x>D?3 =U�z�
�k"t{Շ-�N��/���'|>w����ro������]$��돎�
F1~*W�^	�V��)>"A�
��]
+uh��J�1�j���׋ű�ʮ�B	�
�AʥC&�8��9,��j��Y�
�M����Xe�
t���y/����S3G��'ף�ў�XB'K�M̭`��U"�

+9�7�2
�jcap�6(��p�I�:8vȥ���#�C2���αK��X,<O����'�
?!�U.�}
s�C	1,#��Vw
�Η\kkh�p��}ɱ�����}�﬌
��167s��P�����*�3b$�I‡RRBP���0�K֓j�v���d�h
�l��E�\U	��h�7|Uz��Y��N�����4o��,�
�L�tW��~�����7��\���;�Ѕ��
+km���,�p�{�Xi9�o<߆��"v)B����#
+:��w�)�Υ
8�S��]N���<֧NM�
�*zt� =��-dDĜ�>!�l1���<���8B<ΚY��B�0k���y1V��$�g��2�ӱ+��[_��ՠN�����/�gT�I�D��o~�����to�<g!�
+�p�必^ɭ�{�*$���}Zz	��,��"($�������#o���@��
+׸f�,$���� G�7��r���
h��
C�3�w5��W��A������ԏ�.z*Fµ�]�y��J�/F��x3���{�Kp-9��fA��\ĮهQS�OY>���|��
+endstream
+endobj
+13125 0 obj
+1537
+endobj
+13079 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+13080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 378.118 208.246 388.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.216 378.118 239.787 388.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aa5e48e146300e08949a783b435f7672c) >>
+>> endobj
+13082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 350.535 233.508 361.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ad096a02cc969dcd4b8606cd77d501070) >>
+>> endobj
+13083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 322.952 178.996 333.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a47e031aae6928828862422b0ceedec71) >>
+>> endobj
+13084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.935 295.369 249.281 305.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.251 295.369 305.729 305.899]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_af8feb908f5def7ba99abb739dd2dc6cc) >>
+>> endobj
+13086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.935 267.786 247.638 278.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+13087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.608 267.786 302.989 278.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a058de183d237813010822dc5c734ce5c) >>
+>> endobj
+13088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 240.202 203.265 250.733]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.235 240.202 257.501 250.733]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a3d06dcc99da3a287c6881d2b1e43935a) >>
+>> endobj
+13090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 212.619 179.743 223.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.713 212.619 233.979 223.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) >>
+>> endobj
+13092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 184.663 181.845 195.567]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a031ecc9f79496b10a1b48d6626fd98aa) >>
+>> endobj
+13093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 157.453 176.505 167.984]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_af6356910030e23dc05bd4e500f073428) >>
+>> endobj
+13094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 142.615 450.955 152.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a031ecc9f79496b10a1b48d6626fd98aa) >>
+>> endobj
+13095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 118.538 220.22 129.442]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.719 118.538 317.355 129.442]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a81497d1095efd042cd3034335a3d19e6) >>
+>> endobj
+13097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 90.955 220.22 101.859]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.719 90.955 331.582 101.859]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ab6e5b1dd2b5b7cc9dae9b4ca656cd05a) >>
+>> endobj
+13101 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13105 0 obj <<
+/D [13103 0 R /XYZ 89 770.89 null]
+>> endobj
+434 0 obj <<
+/D [13103 0 R /XYZ 90 721.073 null]
+>> endobj
+13106 0 obj <<
+/D [13103 0 R /XYZ 90 396.582 null]
+>> endobj
+13107 0 obj <<
+/D [13103 0 R /XYZ 90 396.582 null]
+>> endobj
+13108 0 obj <<
+/D [13103 0 R /XYZ 90 367.265 null]
+>> endobj
+13109 0 obj <<
+/D [13103 0 R /XYZ 90 341.408 null]
+>> endobj
+13110 0 obj <<
+/D [13103 0 R /XYZ 90 312.099 null]
+>> endobj
+13111 0 obj <<
+/D [13103 0 R /XYZ 90 286.21 null]
+>> endobj
+13112 0 obj <<
+/D [13103 0 R /XYZ 90 257.6 null]
+>> endobj
+13113 0 obj <<
+/D [13103 0 R /XYZ 90 229.349 null]
+>> endobj
+13114 0 obj <<
+/D [13103 0 R /XYZ 90 201.766 null]
+>> endobj
+13115 0 obj <<
+/D [13103 0 R /XYZ 90 174.183 null]
+>> endobj
+13116 0 obj <<
+/D [13103 0 R /XYZ 90 135.641 null]
+>> endobj
+13117 0 obj <<
+/D [13103 0 R /XYZ 90 108.058 null]
+>> endobj
+13102 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F24 537 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R >>
+/XObject << /Im21 13078 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13161 0 obj <<
+/Length 2028      
+/Filter /FlateDecode
+>>
+stream
+x��Yko����_A��K�xf�����k;��l[$
��6�|���5����y�")���AQ��(j�̝�<�k���O~ZLN.\S��PG[<h>�\�G��"�n��m�f:
"����wn�7�;���|1�2!�ֈ���i�t��7�E��g
#����bQ�YԄ�D���}��,Q�?�%�O����K��z^�e�"cJ��_����b�-�8�*!a{��<�pp�8�2=
6"��3��`/�^���y�~�}�����ypƖq�7y�z�`����x	����,�� ��@#[.�[�s,~1��cQmJ,0��軼x1���\-�
tI��z�
M[,�\�ܢ$��縬WabL�_
��<��ߜ�ZQX������|�*�˸
+�e0��Q�;���
�)˄ꗂ��0�{Ԭ��$��p��t(�TD��,�u�۶T��y���1-�:(X��c -�Y}�ݝ��\�X`�fOpǾ�X�
=�(ΊU
,�C�m�W�=as�U�^�a���o���i�e)��ӗi�fY]I�.V�a�`&��F�%e�S
�
aۺDa"g��.��g��/
dT�
��V7�a�d6�����-��
�V��ʓg���GG���<W	d�Ė�,�b�ǝ�V���s���.�?8����;ȶ��.�K�F2}a��;�mnP[�:IvH���D���Gɛ���.^DtUǻ�vg6�����wH�C�$�kC�Arh�N��u�1�}�}G�Z:�z�Ё�A�]�^�<��f (
MU
�f9�l���s$��g+��i�V�/�J+��>�
�uw�x�M���8����{���#��WW��٭.;5���i��q�
7�2,k~�pҍ`{u��s{)WͳF��˴���6Y�%=\9����r�Zy��V��\�ZwJ�^�1�M6��P 
9�[��9�&m�R��c��L�
�OM
+ɒʍ���i8�� 
�2{be<$����wg�B��K\�
�F`?�!��X
�I�xƪe��]�<@<m��(<�S��%� ��b�7���#o-"!���<�A�ʓ�h?P�w��/��Q�\��-�C^6�r�eV��A@*��e�
[Oy(�t �C�$�|�W�ё�Y?p���j۝�"AOO�
E�*���PM
a�^�Q�Ԃ–��]$��yx�fz®����P�Gv�M�ؑ�8��\�l`3���&�!��?�<��
��b��³-uO����
�؞�2�A�� �nl9o#��cҁd}��	��w����=�/����%�x|,�����0��|w�x�#+��=N⌅�:]M|�mi뺅�H�1�h/�E��r��8[&+ɉ��6��{����r�k�q��
���c��ޞ�	��"��7�+�{�P�°�
+�vS
�,[�����u�'A�\�
n�s���{������}p��=]���א�
��r�~X���
@��ϷN@���݄�p�j��͹��c]�"�\�,
�V�T�«���մ��HV�3pwl�L��..o���9�]� g����W�x0������]�
�0�w}���݇���7����u�۟���_ݝ���Җ�Ȕk6�? .
+li�}G����
+�7l��*�Q&qXm0����F ��y��m,4������~�a�X�nQ"Ɖ^���5%Tc�d�!���9)�E�
-bo3�w�e
�e��0���?�����3w�i'Q��+�=�͐�3 at Es�h{�A���"�ńo�!��,-h $�1��:
+d��6���b�	�ƋhC�F-���
Ӿ���?� w�hK���No�'��1^����pd
>�7�f���f�l�\d���s_ �1q���:���f�zqr���Y`k�)�M׀�� 
v��c#˧͡��w>��+V��O�T�\�Y;������r݄D�Y����15��ܵ�4)���L�����U��̧�.f''��Gh��2O7#h�ه趑�&�4/Y3���h��Ѐ��2�
+endstream
+endobj
+13160 0 obj <<
+/Type /Page
+/Contents 13161 0 R
+/Resources 13159 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 12985 0 R
+/Annots [ 13099 0 R 13100 0 R 13126 0 R 13127 0 R 13128 0 R 13129 0 R 13166 0 R 13130 0 R 13131 0 R 13132 0 R 13133 0 R 13134 0 R 13135 0 R 13136 0 R 13137 0 R 13138 0 R 13139 0 R 13140 0 R 13141 0 R 13142 0 R 13143 0 R 13144 0 R 13145 0 R 13146 0 R 13147 0 R 13148 0 R 13172 0 R 13149 0 R 13150 0 R 13151 0 R 13152 0 R 13153 0 R 13154 0 R 13155 0 R 13156 0 R 13157 0 R 13158 0 R ]
+>> endobj
+13099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.45 197.257 696.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aebe39b79533783e53ef583a9ea308fdc) >>
+>> endobj
+13100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.594 685.45 307.941 696.354]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.222 657.871 223.528 668.775]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a4d75a1f9b3e618d337fde1b4de9fdac6) >>
+>> endobj
+13127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.67 657.871 304.803 668.775]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.689 657.871 395.332 668.775]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.267 657.871 513.996 668.775]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 645.916 138.04 656.82]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.916 645.916 349.58 656.82]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
+>> endobj
+13131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.115 645.916 475.891 656.82]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.798 619.498 365.997 629.403]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1) >>
+>> endobj
+13133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.815 606.382 207.648 617.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.423 606.382 237.297 617.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_afab20885083717c18371349d4c182481) >>
+>> endobj
+13135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.438 606.382 318.571 617.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.645 594.426 267.421 605.33]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.423 594.426 375.066 605.33]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.798 579.964 328.634 589.869]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) >>
+>> endobj
+13139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.985 566.847 203.712 577.751]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) >>
+>> endobj
+13140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 554.892 179.554 565.796]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 286.565 244.968 297.096]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece) >>
+>> endobj
+13142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.738 286.565 355.453 297.096]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1eceaed708535b4103023ee1a5d24ea5ff7b3) >>
+>> endobj
+13143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.442 286.565 474.994 297.096]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) >>
+>> endobj
+13144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.85 271.729 248.745 281.634]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 258.986 243.862 269.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) >>
+>> endobj
+13146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 247.375 248.734 257.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a2b86312f1e0350f49b28c23bd3815e9c) >>
+>> endobj
+13147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.191 247.375 403.507 257.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a31110533316a56c835287f82cba44ab6) >>
+>> endobj
+13148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.964 247.375 513.996 257.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1) >>
+>> endobj
+13172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 235.419 140.252 245.606]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1) >>
+>> endobj
+13149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [143.24 235.419 291.902 245.606]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) >>
+>> endobj
+13150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 223.121 306.836 233.651]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2adf2b5f608f0f0f055f58d9bedb694855) >>
+>> endobj
+13151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.85 208.284 248.745 218.19]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.395 183.213 318.172 194.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) >>
+>> endobj
+13153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 113.868 169.043 124.771]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
+>> endobj
+13154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.859 113.868 238.502 124.771]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 169.043 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_aeffbd9c469a175051d71f3fd7fb525d4) >>
+>> endobj
+13156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.859 74.333 238.502 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.885 74.333 400.662 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13158 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13162 0 obj <<
+/D [13160 0 R /XYZ 89 770.89 null]
+>> endobj
+13163 0 obj <<
+/D [13160 0 R /XYZ 90 704.286 null]
+>> endobj
+13164 0 obj <<
+/D [13160 0 R /XYZ 90 704.286 null]
+>> endobj
+13165 0 obj <<
+/D [13160 0 R /XYZ 90 674.973 null]
+>> endobj
+13167 0 obj <<
+/D [13160 0 R /XYZ 90 623.483 null]
+>> endobj
+13168 0 obj <<
+/D [13160 0 R /XYZ 90 583.949 null]
+>> endobj
+13169 0 obj <<
+/D [13160 0 R /XYZ 90 504.383 null]
+>> endobj
+13170 0 obj <<
+/D [13160 0 R /XYZ 90 504.383 null]
+>> endobj
+1921 0 obj <<
+/D [13160 0 R /XYZ 90 410.428 null]
+>> endobj
+438 0 obj <<
+/D [13160 0 R /XYZ 90 403.337 null]
+>> endobj
+13171 0 obj <<
+/D [13160 0 R /XYZ 90 303.03 null]
+>> endobj
+13173 0 obj <<
+/D [13160 0 R /XYZ 90 212.269 null]
+>> endobj
+13174 0 obj <<
+/D [13160 0 R /XYZ 90 132.703 null]
+>> endobj
+13159 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R /F11 621 0 R /F111 1509 0 R /F68 3017 0 R /F75 562 0 R /F39 2335 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13234 0 obj <<
+/Length 1946      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�H�@��=�i�I7v�C���$lq*�
+9u}�Q2��(��hv�}}
;v~|{3�x�N�B�z�ͽb�g!�
��:�#��	�xx5"x��8�Q<,�O��q�svW������۫�
�`X�M�l4�
_Oc)��{q/��"OLJ=�	G��8��f�q@@,�-G~�$���?����
��0p>Ճf�.�N����l4Z��5
���
�4$4D8p|B!Z�o�4I��PE_���>ՍI����Z��Z�L���eV�2o��Z�c��$�׃�zԪ`>
+k���u͢jb���� ���7)r� Y>��\M�|�]= d3
+- ��% ���n1a�Tf��
 ��:_v���f x��Ŝt+
�+9c7�����C!�35)��nd�6n�i�(��,�~�$����i��V�y���CH�!NI3,.G�?�
*Q��
%R}36�c
�

��ծ�8'`�[�7��l>(�"ʩ^�R�򖎐�����·1ǵ�B�iWm� �+i��v�c�j؎Y^<5�|kk�Q�<FA�(3��]�T��/4FI1k�]$� ���0�.�P֚&@�
��b/n/�#�Ќ��}���� ���߉�E���O^l��b.�����c�o��
rHjd���
��������N%`]E���ѹL�,>��B-�&uֵ�ʰ�^
|�kC��X��ei�R�
��{mŸ�bXZF�B}�Cn�y9Z�_��ؠ/��YA	�	F�|:]C������x�bc7UO�"S�$D�����.���W��(S:��=�vԼ'��^��b��lC
x���|jj[�Z�G#[�!|�1�&P-�,�3)�a�sCދXf`��#��"�?�I��es��c�n\-�͖
�
4�8�9,�#�>�}Z�nO��T�屔����
����`�_r/�v�s�<lɗ�d]̜�ОZf�X���
+v������1k�
��|X�G+�i��Eq�Fbv'6���9�1��,��]K�j�h�LU�SyoKS��#/���L7ic��B�4�w�G�%�����i4vq�0
�+
e�(��CuQC/���s����<����Xz͈
g�^�}W�������Q$&q�����Z:x��4~��":�
�G���/�i5��ڇ�v�!�2�O�,�L11�d��_2�N�����
��<���6���W<�|��v�e]?�3^o��Ert^i�j�a[��2dX��>I�}�Q�n�#�4�
a���0-֋���'�6t�<��,���kÞ	Qu٘�+r�I���
A��ϘwE1�&#�LVܲJ�'�ү'"�
�/lk�l���Q�� ��z!zqb��v��R�����Z�j!���)���
��
��*�e��7�N7#�K!�Fh�N�õ�;_� ��fbk�K������
�kk�+���~��*5�Ȥ��R	�/r>��۠��Nm��ֽم�b
`Ah3i����2�
kBJ���U
��t�����|sJ.3[��
��e[:Dz�]�yYѕ]>,UzyY ��9�~!_٣�e��������\r���c؃o���>��eҙ�b6_�3�~���쀛�?�+�,���l~����̔-�E��
+�'���%�,;0���=f6f����۷��c�>��0g��mN
+���~���NsvnO|�`�j�kڃ�ɮ@
�O�>-[��Ǩɰ
�А�Q �oDw�! J����BV��ko� ϷK6��
_�0hg]�*_}���2�|��&������E����ӭ��u�v{���c
� ����X����2v��8�����]�����7)ʗ#Λ��_�ܞ6TR�^�\
�D�*��h�<��$\
���\�T}��W��ˆ�B��w��J�s��t	���7[����
n�ꔃ���,9?�h� �q�&~�H�u]?l^47.��\�@^~��/���;
+endstream
+endobj
+13233 0 obj <<
+/Type /Page
+/Contents 13234 0 R
+/Resources 13232 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13248 0 R
+/Annots [ 13189 0 R 13190 0 R 13191 0 R 13192 0 R 13193 0 R 13194 0 R 13195 0 R 13196 0 R 13197 0 R 13198 0 R 13199 0 R 13200 0 R 13201 0 R 13202 0 R 13203 0 R 13204 0 R 13205 0 R 13206 0 R 13207 0 R 13208 0 R 13209 0 R 13210 0 R 13211 0 R 13212 0 R 13213 0 R 13214 0 R 13215 0 R 13216 0 R 13217 0 R 13218 0 R 13219 0 R 13220 0 R 13221 0 R 13222 0 R 13223 0 R 13224 0 R 13225 0 R 13231 0 R ]
+>> endobj
+13189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.746 169.043 694.65]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a62d38f242bfeb5c6d1a4ccdb28518538) >>
+>> endobj
+13190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.38 683.746 251.513 694.65]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 655.621 176.792 666.152]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a38cc9e4158abcf9fa6fb719d079108d1) >>
+>> endobj
+13192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 626.75 169.043 637.654]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.783 626.75 220.589 637.654]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_af353ca460687792eb573428e18467f44) >>
+>> endobj
+13194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.926 626.75 303.059 637.654]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 598.252 179.554 609.156]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 598.252 250.666 609.156]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a25cc092f9c3d26be5b6dac41eb54186c) >>
+>> endobj
+13197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 569.754 194.208 580.658]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.948 569.754 324.249 580.658]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a1fe157210b8df0457fa5578d9fa466f0) >>
+>> endobj
+13199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 541.257 170.687 552.161]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) >>
+>> endobj
+13200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 541.257 243.314 552.161]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a56ce97c41ec068deda3ccfd81766ff83) >>
+>> endobj
+13201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 513.132 170.687 523.663]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) >>
+>> endobj
+13202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.185 513.132 235.712 523.663]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a785a8dddb80c0cf25b4b02f3f38b0631) >>
+>> endobj
+13203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 484.635 155.265 495.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a04f2cd33bf24eddaa306c392810004ef) >>
+>> endobj
+13204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 455.763 278.681 466.667]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a6ffb7a29c69bf20f56f8ba9f16dc74b8) >>
+>> endobj
+13205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.497 455.763 348.14 466.667]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.7 455.763 448.343 466.667]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 416.307 285.316 427.211]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_aa221ca31e0aa489ae726efef9234c6d7) >>
+>> endobj
+13208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.653 416.307 369.429 427.211]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 388.182 194.567 398.713]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a934053580363fb6c281a614d593231f2) >>
+>> endobj
+13210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.904 388.182 265.411 398.713]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+13211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 359.311 198.443 370.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a1c6db3c7a9e8bcc79574dfbb087cf996) >>
+>> endobj
+13212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.78 359.311 303.607 370.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+13213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 331.187 187.583 341.717]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a6dd86308a6aa3b0a99e7464fa6d64534) >>
+>> endobj
+13214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 302.689 198.383 313.219]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
+>> endobj
+13215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.881 302.689 221.755 313.219]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abac8b241f6c2a61248fa768b9157203d) >>
+>> endobj
+13216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 274.191 153.183 284.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.681 274.191 187.783 284.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_aa7ceb834deaff6303def1cbe95373edc) >>
+>> endobj
+13218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 245.32 153.183 256.224]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.681 245.32 235.941 256.224]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a08ee3b2a32e3b7b8088a84a8beaca0f4) >>
+>> endobj
+13220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 217.196 150.493 227.726]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) >>
+>> endobj
+13221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 188.324 191.817 199.228]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ab9663a6c08e6c35bea0da7fa41c81393) >>
+>> endobj
+13222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 159.827 181.845 170.73]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a77a39c345913dd490ff33b698d45b7e2) >>
+>> endobj
+13223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 131.329 181.845 142.233]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a26a3ca0eb57793c00b0517a6856b8c10) >>
+>> endobj
+13224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 102.831 154.727 113.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ae9d3cb337b4a4a0fc296d2b5b742b7f2) >>
+>> endobj
+13225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 74.707 176.505 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a2f2683794347b7bceb41d88e1b1412d8) >>
+>> endobj
+13231 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13235 0 obj <<
+/D [13233 0 R /XYZ 89 770.89 null]
+>> endobj
+13236 0 obj <<
+/D [13233 0 R /XYZ 90 701.306 null]
+>> endobj
+13237 0 obj <<
+/D [13233 0 R /XYZ 90 672.809 null]
+>> endobj
+13238 0 obj <<
+/D [13233 0 R /XYZ 90 646.037 null]
+>> endobj
+13239 0 obj <<
+/D [13233 0 R /XYZ 90 615.813 null]
+>> endobj
+13240 0 obj <<
+/D [13233 0 R /XYZ 90 587.315 null]
+>> endobj
+13241 0 obj <<
+/D [13233 0 R /XYZ 90 558.818 null]
+>> endobj
+13242 0 obj <<
+/D [13233 0 R /XYZ 90 530.32 null]
+>> endobj
+13243 0 obj <<
+/D [13233 0 R /XYZ 90 234.383 null]
+>> endobj
+13244 0 obj <<
+/D [13233 0 R /XYZ 90 177.387 null]
+>> endobj
+13245 0 obj <<
+/D [13233 0 R /XYZ 90 148.89 null]
+>> endobj
+13246 0 obj <<
+/D [13233 0 R /XYZ 90 120.392 null]
+>> endobj
+13247 0 obj <<
+/D [13233 0 R /XYZ 90 91.894 null]
+>> endobj
+13232 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F66 3165 0 R /F67 3022 0 R /F60 540 0 R /F24 537 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13284 0 obj <<
+/Length 2003      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~���ӬT5�����%;�I9�L�ػ/3)DA2������i
�$J�x4��	�����h �Y;����w��׉P�S߹[9v/Ḃ���a�Q<���G��CD"V��7������ݭ�������!�C�� t������YB��Fn:�zR�xԅ��s{������k�"�	A6�S�!
:!�#�O9_���d�*�
����
��J�E�sᥙ2�
���xfH~w���Z5餜��D�O���U��i1��JQ)�u,��g��F2�)��L��p�|Д���d���Bё���*��a��W�I
�8�dei���0ϖFT)*���4t��"4:~��
5���vRu��k��y�83�Q�"k�8�$[o�S�&h:s	��&����� @Z
��#����4�����D�q,�\՛ף�����+����#�t^݋�1��D	߷5X��dF1FA���[$�F��
V���0��"���\&��j[��W)���⛹]�d�Ŷr�%�D�J�5�k�s:��֠��(���k�3��Ŵ�� *�V��#�n櫝�Fv;�u��8ѫF����z^x��15���1DTn������e����ˁMyƧ�k�s_B���)�'�KO���Q��3�Z0��M�G��Ry.���8�������M�/6"
[�j�Q~�����
(La�Y�j����~�	�߲ێ�a�
OC/��^�w��YU���
+6^�T@���3i'|S��kQ�cK�h�|>��¼��1Z��x���[�
��AY-k��
�
A
i:��|A.&!C,���k�w��,E���/�iU���Ea��C#�.Sȏѩ��.�htn|ɺ�f�LR�IUq6J����خW�`�Yi���X��4
N �c���j4�X��߂g�
�υd�N-u 33?zi>=bݣ��3���uN��/ME�53�Lɣ��H�olW`g.�&7��N�1���^L�ɦ��Y�
��~Wg�:q��@%P4�n
+
Q���)
�����S�4ז=�s"
+���N����ڔe:�
*�bnI���{�?5��a�ȆW�T>���� �zM	����j�g��j�"m'/m#˫�h_49g�0E{xt�t���C�
�-���9/Dɫ�ݮ���!)ᶪ���c�D���b�2�E��O#G�?\�Iq��΢Pc���K]��A�@�e�^29���@8��?o��j����_f�3
~�;����4z�S�7
jp��=k�� ��4�d�~�$2�Z�`��[Q�dӤͷB�eRT�[�����	�^_�
���J��u�#��6I&x�$����I֔Fu��b���3�2u#����+�^�}�֭xåm�,Η�~p�W��T�I_Lձ+�^��v1����N흪��[�Ն��Ymd!��#ƴw�Ә@	��૗�%���ۧ�,�lz��fHR�<-8�''�^�AD�#����\��V$i��)¬Ȥ��BD���3�̞
��eQ
+S�Kw���h�fiV*�[��
��
+�.�x�Br�6ʡFdS4d����
ć9ݖ	ϑ��v �Y�4�d9pv�}�,�u
|@�k�

��M[|��&���˼��TS	@�Tf �ӕB����!]&�
��X�M�&o
L�ü��-��� 
����iC�}pj٠'D���W;o�g��?�%u����n	zd=D���f%�L@}c'�~�l���x�>
����QUe`R���?���uT�:�3��@�NҼ�=m�R���t>�:Hʷ
�/���� ���
��B(=��7,�;o������g/���ytQ?B�������ۖ��٬g[�I�Ͷ���r?��}������O�c���^�X��?Ai�IP=�o��f��N]�m�:r3�7���d0R�x��\�a�Muרzs�i�[���)ӆ��<��C���D��*������92��lE���$6((1����*�./�Z�l��<���nq�ʠ�����ƄF:S�p�v�
O��I
+endstream
+endobj
+13283 0 obj <<
+/Type /Page
+/Contents 13284 0 R
+/Resources 13282 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13248 0 R
+/Annots [ 13226 0 R 13227 0 R 13228 0 R 13229 0 R 13230 0 R 13259 0 R 13260 0 R 13261 0 R 13262 0 R 13263 0 R 13264 0 R 13265 0 R 13266 0 R 13267 0 R 13268 0 R 13269 0 R 13270 0 R 13271 0 R 13272 0 R 13273 0 R 13274 0 R 13275 0 R 13276 0 R 13277 0 R 13278 0 R 13279 0 R 13280 0 R 13281 0 R ]
+>> endobj
+13226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 708.28 450.955 718.186]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a26a3ca0eb57793c00b0517a6856b8c10) >>
+>> endobj
+13227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.881 191.718 694.785]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 683.881 288.852 694.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ad750455647786b5cb28c5422930f0ec0) >>
+>> endobj
+13229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 655.653 191.718 666.557]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 655.653 303.079 666.557]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a2a7a0b9f3dc8cd6d55e839e20fa28f12) >>
+>> endobj
+13259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 627.425 169.013 638.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a920510b7460ca0933ea807b88484ed8c) >>
+>> endobj
+13260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 627.425 227.962 638.329]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 599.198 219.234 610.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) >>
+>> endobj
+13262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.732 599.198 311.916 610.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abfb5615fad7429cb2c340d763df8a43b) >>
+>> endobj
+13263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.731 599.198 422.161 610.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece) >>
+>> endobj
+13264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 570.97 224.993 581.874]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_ae6a4663bfee916adb9330010328493d6) >>
+>> endobj
+13265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.808 570.97 334.132 581.874]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) >>
+>> endobj
+13266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 542.742 255.996 553.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) >>
+>> endobj
+13267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.812 542.742 325.455 553.646]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 514.515 179.554 525.419]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 514.515 303.238 525.419]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a1fefbce40046822771b243b1d2f1277e) >>
+>> endobj
+13270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 443.93 203.075 454.834]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 443.93 296.324 454.834]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
+>> endobj
+13272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 429.143 327.9 439.049]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 346.067 226.034 356.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a5fdacdaf0ba18f647ac7bf95a2624af0) >>
+>> endobj
+13274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 346.067 376.309 356.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 317.84 156.281 328.743]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) >>
+>> endobj
+13276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 317.84 215.23 328.743]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.441 317.84 288.574 328.743]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 289.612 156.281 300.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) >>
+>> endobj
+13279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 289.612 215.23 300.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.441 289.612 288.574 300.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13281 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13285 0 obj <<
+/D [13283 0 R /XYZ 89 770.89 null]
+>> endobj
+13286 0 obj <<
+/D [13283 0 R /XYZ 90 701.306 null]
+>> endobj
+13287 0 obj <<
+/D [13283 0 R /XYZ 90 673.079 null]
+>> endobj
+13288 0 obj <<
+/D [13283 0 R /XYZ 90 644.851 null]
+>> endobj
+13289 0 obj <<
+/D [13283 0 R /XYZ 90 616.623 null]
+>> endobj
+13290 0 obj <<
+/D [13283 0 R /XYZ 90 588.396 null]
+>> endobj
+13291 0 obj <<
+/D [13283 0 R /XYZ 90 560.168 null]
+>> endobj
+13292 0 obj <<
+/D [13283 0 R /XYZ 90 463.005 null]
+>> endobj
+13293 0 obj <<
+/D [13283 0 R /XYZ 90 463.005 null]
+>> endobj
+13294 0 obj <<
+/D [13283 0 R /XYZ 90 392.506 null]
+>> endobj
+13295 0 obj <<
+/D [13283 0 R /XYZ 90 275.664 null]
+>> endobj
+13282 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F60 540 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13303 0 obj <<
+/Length 2779      
+/Filter /FlateDecode
+>>
+stream
+xڥ�rܸ�]_��p�;4�T�٣��I)+���rqf0#�CrLr$+ǿ���%JV�'��F��蛡w�B�NjWo.^��*/�D&ޛ���^�A����{�0H��Z�a�_�D�MY��Z�Я��7z��1��h�//�^_��jV"���Q����C�/Ǣmi���k�����2ʏ�X��構��\|��V�	b#��ۖo
�
���@�wg�J/�
+ƣw}����o�o�����0	"�y��t�wR��p��{�����3uU
���$��%�M��^oaM�p��hv�Rx
{��
hϩ���~Q�D`�M��� NS��O4�xZ0�f$Y��􈿚�
������t|�fc:x(�"Ds�o-�<PQ�e��e�ou���n^t4�k�d`>nW�S �e�j���s�{B��J���·�
�\|D�c>��ZW�xX���๷����h�ʤ��x����!�Uy
���=�� =r��3��#U�I�I�=���;�%�Lw?�H8l���4H$K�
j����%{Q�}m�w
���b{>�ꦣ�}������.�CSm]�+��)x_}<�JZ���>n"�B7E�7�;*�/��ڇ�d
ⴂh��ZS��VP�	 qS;%�x�'��c]֍��_�+�t!� z{S�O��S��#��,�Af)��}[)�����a� V;G�y7��������T�<�&�	��)�i&�Q�*��
;���h
�@�
�����95���N�,�lij_I�7��`��j
K����c�ʀК�
/�(���ȺB�‡�V�R� 
����"�ԑ,ܵW����w���;c
*�
ɝ
a���Sj�fO�s5>�!�1$���٢�Z��9K&D�
�@��]�ـ2�J��}}��m4���dx ��'Mds�����oJ�G�Q����87ٛ��� Tl�>7�*��h����Fk|
|�7ܙ�����`��L�sGD�a
�[�p���A�
@QoU�u�y�Z��c"�B
L���Zgu�^Ү��ڵ�ӄ@P�0��҆Y�Q��X����à��@F�C�LÝ"!�N��~w��
i )�/�,��ea
+yU�"�(c���|�
9�J
�tK�H������dА��)0��ԫ0��@��*¤�b�i��o߅��;�:iM��m
YFH.x��W��*��v!�*	�m:�v�Y/�^��<m{c���@
�Fgp�j`�!S)35�
x�8PY6��ӜfA
*�þ8�K�J�0�q:��u
��	`AB~��^��-(i
d"�+��T���`%��Q{�9�L(
�Hj��
���c�r
+^����/�ߞ� �X��*��Ҕ=
+���G9 �u���Y6	M�f ƝFm�l DpE�����:^ 48�
��4+M��	 �C��ۺ
�2�N�*�W9b���QAc�u���´ \�f-�Ƒ��Q�z	�B
��#k���?��F،�,&�Sg0��z
%�p�mc6.����v��Ro�O%7�,�w�re$� ө��)�����s$r:銀\Jd9e��8&����d�T�R
��)����t��0��
��0�RU;a.�
 ��;��fϷ�[���<��B�c
��E�G�9m��5Xe{�+2w\���b�ܪ�0RLSS9�S��
���r���]���T$
+��Q9N!bE���B�
+K�����.Y\=j���������
V����;}o�p��R��<�RĄh�8"� IM��W`}+P
EIMQ%@W8wA��SkM8!��x�
��z����ttL�]zSx�V�}�3e�n)�� ��!爋��M�;o��3wY��1���P�
5���sk����}
��D���Á�*����#.�Y#�D�R���8����'n�|�%��Kڀ;���t��Y�냏����Ӆs��l{D�%�0��B��/�
�t�A	��
�\
5@P��Z� UAX�=z=�Z1�S�^G��
ҩn�$�{kZm�eܷ�
0bg[��sWP�%9���b�{lt�s���P���
a�0WQ���0{�s�C��Q�]q:�
�����_m�Q�{K�q��/1Օ.����''�ƃA1F�b�ZV��#M�b�3C�w�מ�-+����p���s�_�7o�
�� ��8�\Z�\�:
�
ۧ8픮����������v��
+��L�Cz>��)d�kP"P��[�� j\�S��36��{��$���X��܁^]>�\{$R(�����$Ɣ}�(�فd��{p�
��u����H�ZZ,�2_�
�6�o2�9��bN
+<M����FD6�*/~]ff�w�<
G����|��r!���y�	
D<���p&}�5
�� �G��D�w�!�����������wB�m~lN,�ii:46�x�3�/�(�����;��b�<�z}�wR0�

+e�����e01%p~�#Ť�5
�l��]�OM��P���?kڹm�OX&* � �(H3�9x�hhϠ2��^���ؤT
OMw����PEH���P��O#��yV9;K>u���#��-/i�0]�Q��фa�ٷ7Zb�WC�ؿ�c������+��3��
�	
B�_� ��@NV� �+D��%)P��)��ˉW���=!��k�����]9$�����0���� �깿��o�
|

n�Gi��W�ܫ_h�V7���-�s�?
PK8�
�e0�
��K�k����G��~&�
�iDYߎ��������!�\s����B��������mZ����(M'�8A�H'
�'H�B���b��v�md��ץ�A�����p$|%
+endstream
+endobj
+13302 0 obj <<
+/Type /Page
+/Contents 13303 0 R
+/Resources 13301 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13248 0 R
+/Annots [ 13299 0 R 13300 0 R ]
+>> endobj
+13299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.07 323.847 328.202 334.751]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13300 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13304 0 obj <<
+/D [13302 0 R /XYZ 89 770.89 null]
+>> endobj
+13301 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13314 0 obj <<
+/Length 2546      
+/Filter /FlateDecode
+>>
+stream
+xڝYK���ϯ�-�d�%>�ĩ��v���7�I.k�$A�)RKP�����Ӎ@B�r��Fh4�~�q������?�\���QŪ����6��H+����D)�?����dI��,C~����o��\��ŷ7�.����XQF���ǟ�h��������}�r�Mt}���x*K
OdI����$aIB�ܩ�%O�Bw�q���zC�
}������
�%�/YlԺ�~R�m줍:�vS�;��U�f�
�e�-�=x�
zY�j t�M�<aO��
+b��%cUQ8���X�,���䎧%P�D?	���q|3��/�
�.�y
/��Us�*/0�\��X��:-��``)���*��vg�=QŒ�rQk��r�5
��
V�_Y���%��9*;Cj]�Z�>t��ثš�V��� {�W���J#[{2�8�ݵ
e�<�8���F���+&ƻ1˞�k��U�zٮq9'5�b1�_.�x�Z�3����;B���f�*
.�`�K�ՌI���3��͆6��҆�w�@$
x��j���^���!��R�� ��`ɞ�C��:�&�$�
��1���Z�
�؊��[r#��Ξe�;�j�x���c�_
,mN�"L��ۮ���
�٫pZ�����{�
9��[�q�r�-x+����ȌWu~1f<�&�}?R�?e���Zϒ|t��^�Ɠ����9T�,-�f��%�X�OQ��j<z�:����̥`�{T��a��sg.X^�`b��(���؁����Q��]/p1H�}����x
�
�(���0<I�!�qq��+D;�}X�K�+ْ�N1^�!��jtP�
ۭ����W]k
���n��
+�2J!jIK0�[d����j�_���Mn:�/�A�k�vi7�f�*��ڮ��
v=��2�L��U�D�C҇Y�jy�!�G>����{Y�t�s�;��,�
�)W
n�F�<GK�s>�D���r�E[ײ��R䬪�����=s�6���:��cC����F�Z2��r�C]Tm�$R�u�uA6'{��td��1�q��������O�5
{��1����h0a
����%����f4��|cj��M�1�(�c�t��
+|S�]���_�n�C��8&D�@���a�8���f6����g��膠�� B���#FE
H5s�����&����7f�m����/�
I1M��!)�^0P򘑃]����L���D�C�z@˲s}�~E����Q���
:m�2�B,�݆�3>��)�|���z4_t�`�D�
+��?
*�"��|��l;'�<����S� e���z�� o�
+Q��yrV[`�J��V
��
+��J��#�Agl��l��� ��c3�Ct�����#-�'�s_�ZY����K:��'��'�1VQ
+s��`k�t*{8N_��}8��klM@����ba��[��
+�+[���݇�:�8�U�hWP[>Q\s�+_^��:�%�2��,)T��{D^��,�pA�nu�6��_��T�z
��ʂ
����I���GsOp����O7��v����;�ԩs��
���m�5ށq#��>���˄�e���ƨ��Q`K!�=�&/bm�����X<êo�1S�]��Mnx5�07��/�o���X�޵f���~0Ҙ�4g1/Aw�)��~K,)�hB�]Βޤx�x���l:��]9)O�Fɱ^zD6����^����e�/�ˊhgO�-����M���1�s�pN���Y]���g at Pp}�L�Z�n�j��G*�r�Ԯ�!�vsB��"�cx�"������vGl@ �Z]�+����:�RC5e��DŽ �aB \�x�Q���
;9�FT��\�d
lD"�
�,-�ӌ!wUu�����nm�O3��������)|^�\��-+����yP;�����	))��c�6N�r�G�
�eO��
��߇9+e� ٰ`^&,
ل�4�̣$�P
�ࡇ�	�X��^nɦ��G����\ ��(�9C�
���n3��W~:�M�z{=���|���i��^ҧ<���LKkq�Ds�}��ꦢ4�������p�wS_8ՐP�%�:�>5���`�drk�?A�*�O]M�
���4\���?���]��*�Z��aR�T�ٻc/-檄0W�/U�ː>V9P��P��8� ��	�^+�i�D�X��,�̕=+[)�0�
�ǃl��F�y�N�\�
t��_�2;03��4�E�q�s`F��@5r�
���$E� ��\`�
+�L�U4R�1��̙���eY�R�0
���?ы�<���������WIA��/��bh���v*DP���$��ڸf����7[\��6����mu� ����йݞ ��j��@5�B5����9�J\����d"T1Ye>\~��'E���m�
Kx�n/�?w�ظ��[�
���%�(OM|�3SZ��C	�F�J�B���e�-,��&ۣK
C��{�_H2�*�-�<?\+FH�_��!���T�,-����0
�z�fu�i��غ
C�Ɂ��Ņ���"��@i��� ��.���"
+endstream
+endobj
+13313 0 obj <<
+/Type /Page
+/Contents 13314 0 R
+/Resources 13312 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13248 0 R
+/Annots [ 13305 0 R 13306 0 R 13307 0 R 13308 0 R 13309 0 R 13311 0 R ]
+>> endobj
+13305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.7 394.674 179.832 426.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 299.325 154.737 306.851]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
+>> endobj
+13307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.226 197.201 200.359 228.827]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [121.382 185.619 150.891 196.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abac8b241f6c2a61248fa768b9157203d) >>
+>> endobj
+13309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 169.598 184.027 177.124]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) >>
+>> endobj
+13311 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13315 0 obj <<
+/D [13313 0 R /XYZ 89 770.89 null]
+>> endobj
+13312 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F94 771 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13326 0 obj <<
+/Length 2612      
+/Filter /FlateDecode
+>>
+stream
+xڽے۶�}��}
+�XX ���t\��q�f���/NFCQԊ�DnHʎ'Ϳ�
�
+���u��.�
�F��z����_n.._&���,ֱw��2�%a&�V[�H��RI)�녒~�
���BK�9|ܗ�6_��6m�~\��_]��ۅJ�fs(��������w
Mߔ��|.��:V��`��ͷ/n.~�P@����$���Ż����o=)�,�>�CGn�x��^��B2G�(t�S
��L9|���2��TF��u[�}U��:��}I��9����y�-KC����X:T*�yK-��BB��pז

����
>�^�
�N}����V��
s>�)-( ���Y̻�phÇn�	R�ȋE�)�*��JD���;a�-��Hv�v�*�S
��NF( Tf�f_5����ဳ�m�'T<n���Z#z�X@�q�M_��0N��x2o�

������m~,�����"f)�ݢh�-�}6gz�)d#a�&�-w��O��dkI3r>���)+m0
����M�
��1
�D��G��_��jՕ���-����"�,T��N@�RᵥN�U$F�J3��n���'F�H�S8���|�Ij��~N׾��J��4��P`Y�P?�+����W\�!\|�>��+�D��*
��a\[�"/h`*�>�P���V�ӌ5Y��2�B���.=
�L��!�t*�02��R[��e& 
�����t��5��)<���>��'.~ c���D�ع����������hp�#W��<sW��Dz��ki�� �����ȉ����v4-�bO'�
����ܜ+c��w��M��˅����Ѿ2q׃�ߔE�^�k�Æ��=�J�XF2��z��{)���Ua���w1<��@1x[�c��<�]�+��1�
���Yy�0+o�L��F�L����?S�(;��a_������(&gCL��ߪsL��W$�r�,���������8A�6M��-����:H���DfXC
(���!�� فb"��4VN(ĥ�
+
&�.>�X�Y�
�/Ć���Ģ������xC�
�1���
%V!��(k&7��:i�����B��
���=oPDG'c����*�,�pU�ʎ
[
} ��Ȓ�O��O�9���
<\�8Q�*pp,)�8�J��6M�k�C��$�_�SzL9���a�5�ũ����A�@H( fxP�;N��
���x_mMv;@Dg�GȆڪ��q(?C
+ܡ|��P��*���{��tS\�0�
�6�
ƜN�c��ߝ���SG�	oown
�Wϱ�ڿɯ
��u͉7I�^?�0�����b
?�W�@���#�7�xR�t#
)�;~&)

{��;��4u<�C��d�g�Mͳ��8�d����j;t�:��Hث��7N
Q;����¬���7�����.$��bʿ����*
�Fмw&�����Z��
+�J )�&���ͺR@Jޥ���XU��ԧʨe���s�D�W;:7*" ����L������ ���|���S�x�we�U��i�VHk%J�����"��@şgHH��ԭQ�P NV�
+7�)��"�6�
׉6�Ó3#P�P�U&�K4���q8�T�d���)�L#Y,�X�ۗ��"�~r
=���P�����v�+#-�l����V��[�8d-��z0΄��wz\9
�d��aj�� A>�j"
?]r+N���Yir�������~q at w]+G6�U�Ns�P��y;�8n�P���o��sd f,��<G�x y�8���73zxJ�E�:ğW@? ���%�*��C:C�i�X�`��\����"cFM
��฼�[& Y&h���1�ᬠ�؈:�B�������b�֘S1���<�,���7&�As�b����#��=�b����)wY�M� �#5�|�~G1E��M(3��q��AL��Gb�ũ�B�%�n�зT�-] �
�����jP�����+����L�.�
k
9�ăGD�!�q�7H"��v�/��e�JG�^�
kk�
+E�i��g�D
+P�%����3
܏�A"�h�F�F(��V��� /
R�]�q
+0��;��-�!,T�Ў�ͯ��&��K�D:�xNm"����鬛���:
+ʸ/l�̶��
���t��E�� �̩�ט�
tL��ց�l��&X�X`9J���=/
:jk������'�T,�P
G��!~�uU�y�����/�Bp�HPL2]�@�v�[�
p�\4a��Cq8qk�L�,�H]?
�vdjx	�6�9S0n��ӗsuJ�
�:��&L�-��7�n��UVT�#�ƨ2����Z�����
+��њ���G4�%qg�$
+*�� 
�KMM�ʃ�QS���梞!�uW�Q3���*l����"��w*���� ��>�
�
ic[N��[\D�{6-���i䠜C(�l
������}����H �#p�_�@T
+Da;���
!
��N�\_���?��
�q��{^�l���t՞�g%<���0�`�vh��?zv�7
+dgrTB:
r��w�����|ϭ(H�c7��	y�A�Fɱi[��c�������,� ϭ�4@�?�˗*I�9���G{�7._
�!��#��W��
+endstream
+endobj
+13325 0 obj <<
+/Type /Page
+/Contents 13326 0 R
+/Resources 13324 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13248 0 R
+/Annots [ 13310 0 R 13316 0 R 13317 0 R 13318 0 R 13328 0 R 13319 0 R 13320 0 R 13329 0 R 13323 0 R ]
+>> endobj
+13310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.407 644.507 393.75 655.411]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a5012c55d8fdb1420b80a3bfbe5a5b843) >>
+>> endobj
+13316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.21 304.869 328.575 314.926]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a43eb178d5fe05266ba5f76962e836bfe) >>
+>> endobj
+13317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.754 304.869 514.119 314.926]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44) >>
+>> endobj
+13318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.116 167.849 513.996 189.931]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) >>
+>> endobj
+13328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 155.894 294.015 166.798]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) >>
+>> endobj
+13319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [116.125 110.199 268.691 141.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+13320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.684 110.199 513.996 141.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 98.244 157.965 109.147]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13323 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13327 0 obj <<
+/D [13325 0 R /XYZ 89 770.89 null]
+>> endobj
+13324 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13339 0 obj <<
+/Length 2981      
+/Filter /FlateDecode
+>>
+stream
+xڽZY���~�_���U��
8W�J%>T�cY�n
R�K��KX$@�W�_���
 �˕���\=}~=���������o..�K�,Y�����,��$�D��z�.u8������S��f9��?������5�]|{s�ۅ�.9S�@$�t��]��E��@�~&���ٽ�����s;����d^d��X�xRZ	�Y�ੈ��ZGns?m�nI�V�|�#�ˍ�r����Ze��/p:�>�>Qd�!�Ŏ�
��R�P���m���7a�-��*鵺=%�Q^�

�gw
����o�j������C�B�DdI�D�L?G6Fy9WQ�/&����X��x�'

F�_`3������Y�աn�����q]�}�E�m^�vM+,����Ey7Z�w��o��O�cT*L��Վ�1�j�?�āv�G[^#�
+c�Ȣ��v��-{��Z�F�.�������x/�^��[,����l'k��$x-�Ѫ���@�p���xu�9�8J�R8`*�	�\�E�
Re�������؇gg�
���h:�\��������B=�7��Q��q���D�NО`x7
-�%wѲc��nM�9�*��g'Y�4d��
H�@
+o���
��2�c0qp�t�z^�*����"6Ֆ�_?��0��aۉ���W�ji��2�9o��J;8,��~c�!��W�j
�j�-��1ʱ�ԉ�9=����"�}�����6�m�W��S�[�i�.o�u�A
��pp��9-�MՁE�|*��N��)�x��/��T��	����B����T��ӗM[C�i���
g^
��Z�ox2T�ǢDOMc2G�J'�B�d���Vb�c
S�$�vϙ�/B��U���b
��+	�
+?�Cs\�[<�5�6oZf�d�(|��Z���&ɂ�r�q;�e
EAC��j�4�#��Nf�}��X�:�Po��B
4A���)_�1�+7s����ǫ��t�Sg�5h��
�
+��$t�
J
]؍��h��L
��m���	I�Zd�jB���=G��Q<\-� �0�nr�a�ɑߎ[̤�"A��&�Q0��I�
+��w�0�J��%�>w'�m]�Ɲ��(��j���)k�P�����'���K��!$j��>�"���f��������,(��!6.T��0x��$.L���H�`Bkg^1
=���� qV�=m}�+����8b���ݍ;�_���,�c!��aҡP\x
�L�qځ�M�]�dK��A:uH��(ڡ�9I���o��6�6S� 01j��#Y�E
+�����N�%�(�
iқQ���v_5M�������1G�(�]�����%Ț��k�]C�6
�(�*�����K��T����P@!$n�JL�/:�)Gѥ'  
� ��bi9-�
+���K��I��^�iX,2�D����:a

28,*�V�����,�P�B��Y
+�b/oGx�
/<T��@�
D'b���}eۖb�
�iP��bG�8%�b!���-���M�Q�U�I�p�3p
+T8<�p�-�I�ugYr�J�沁�R/H��M
�����
l1�l�1	��`v~�a��to�H.{M�y ٫�]� �OF���0��܄wv_KTցZ۶.��ri�%�1-v,�f��Y]'0B-�A|���wf	�qš<�H�gqPJ8���8�����D�@D�%}��jb,
�`'�
4*	p�Cr@��)e7��5D�F�.5�K�A��bo߭�
j�Cet��<��m�n>��{uE��׾�B��埊]�ܗ�)X��pr���{2���VDK��Q�Xn=�ǖ�UuW���+�`�9
x������,}w��˰�p�M�S

�qbd�S�
�P���|�A��^I�f����t�_ 羆����2Ai�����h��}���nம�~��>t
}8^�<�
h�
Բ!�-m���z�ːJ
rh*��S?NA:)��CRce�Lw��
���ف�K��
���� ��
(=OǠ=��>,+;� M�&G����}�!r�,1)�!b�Oń�"�F�ޘ��:�v�����6
+dx@���K�ѵ�O��@	N�FI#�()r�����	�LN���Hec���+�^N�4ᦏ
� :Of�Q� h�P*�
��#�2�B����L��9
'_`1��D(�b L:5áx.yȮ(���Iu������9��1h��D�v1nz؝@�)y�$�7D�#q��Do��O��ê���O�4�s�ט��������cd��`��C렇|�pW�i�28���XD���Q	1'|�
+<.��Q\ݥ��@��# `и��<����3����}����W�LVk��
�1ə@i+6�3�{t.P�Ј ���S at Od7w��7_}
����L�j�v�?��A�d.����/?[,���78��=4|�|�ߎ
z��S�
��(��>?��t�
�ׯ��
��L���l̎
_��s�`8���}{K F12�R�?J �22����r�2�A,���M�ci���
+eDV���	�QP	�<��O����'2�;3?��
�d!L2���ϲn��88�\
w��y҈�ps> ����<#F�(��
�<����.��vQp<����f|]v��BqW.%�
^6��f{�nY
��%�qɟ�㓂W�4#���TU�}�"���!T��UhXNt,5l��
�.�S�
�@�r/�>���4�o�+�K"�����K8U�>rdž79pc���1�J��&
+� A[�6�@C��-6�#b��;�
�%���]
�!7����
�k�^I��RTu�>�W����K;���#����vu��hk�h��?�&�	8����o`�R%�v�����s�p�zgf�T��q���8.����bf
=�
!����N���?����ݗXx�1/��
�,��ǿ)� C�t��n[��k
��c���4=�)´˼���_]^.w�-�Ī�cat�,2�>+uˮ�;�bX��"h������
+endstream
+endobj
+13338 0 obj <<
+/Type /Page
+/Contents 13339 0 R
+/Resources 13337 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13248 0 R
+/Annots [ 13321 0 R 13322 0 R 13333 0 R 13334 0 R 13335 0 R 13336 0 R ]
+>> endobj
+13321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.02 707.957 411.153 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.03 628.009 450.162 638.913]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.966 546.031 511.506 556.935]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a97ccf10304ef9ba8b58549f7570b8cea) >>
+>> endobj
+13334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.428 367.516 299.456 378.42]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4ec7c4c8093efb70675c35a17d6a7e28) >>
+>> endobj
+13335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.955 278.024 418.715 288.981]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) >>
+>> endobj
+13336 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13340 0 obj <<
+/D [13338 0 R /XYZ 89 770.89 null]
+>> endobj
+13337 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F94 771 0 R /F24 537 0 R /F11 621 0 R /F10 773 0 R /F13 835 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13348 0 obj <<
+/Length 2563      
+/Filter /FlateDecode
+>>
+stream
+x��ZY��~�_��P�
+���l6U�
���U��q�Rk�%qfhK�LRs$�����F��a?����F_��u���N�qqr�&aQ�RIetq�8Jx����E�1&%r2%��|Bp�U���|Bq\.n�E�]�X̪�z8;;{~y^M����2_M�T���2�k;|�_���|=ρ)��Ŝ��/ߟ��8����X8"V
��W'�����0b���
�*��s}8��	vuOD�
��w;���Mp�¢3D����}��,�3-����<A�H�e��.�ڔ�4~(�vpg�n�
��LH\������57�
,�	�}1/��lsS���*�/Vە})�
/���2Q�!�L?c�-
��D
�D�4��ad?�2#1��H�
+
+�׭�>�7e5�8~rJo��*��є1�є�
+�[���b����C��T(�_��&�D��#q��i�RG�t�ܗ{`'�#�1���V�(U
���" V�*ﮢG�%�E`�K�V�h�ӁJ
.Q�e}+)D�	�F�'���8x�oL�
y#�R
+����B
j���U
X�J��UG�$pGP�����&��Uހ?
+�'�
�q�xKq����d�N���Xd���L���M�l��\?�S&��`��vb���U
�z�Q�l>CX�'����� U*�O�l-mi��O�n�GeO����to��Q�^��q�J��
l�g烱�H�P��/�,���]���.��Z��U�"s^�YS��wB���zS��o�j�X�ٯP��M"��W�rYꈿ���|e:��XI�D���<CA5u��.UH�T��Nc]_���1�>hRr�F�ңH�iRv�����7��N���h����e��.?<ԍ��&��
�K���:������:����/���y��JFD���W3ύ��>+�-ŀ#H�[1������jB�C���k{X��9���o�xo�n����k��C%��kѶ�ۡF-��x�Uo�y~�(V9��r�g�*���@���L���h����~Â�Λ�Yq}�[Y6�	����
�ٙn5NO�oه�B�4Q���@"SՇ&%
�)jK�ry���
 /������ܗKS��dm%���$%�a��
h_�Fv:�^ۇ�m�����`����X�
)�ҵ/�}�y�k��1x�&�^yo�����]S�Dm���,����.�L[�Ef3kf�:��Rk�6A�q���x*Br�
��>W
$SM�lq^ �5�^��� �S�n텒ߵ=�� �;5Q�a�d@�m ��n�� �(�Q}� {o�R��޶�
���	�K�H]6e��w�Xt
+���4?P�3�!�FBXMQh�u�HP��9���v��
��Q*�(�O�$
+�
h�R�Y��@���A
�$9�$�ϑ �QJ��|2,e�������y0t�׈AK�����b�X�ٺ�]�܌R��8�ۖT
yeU at Eϖ�
j0�
+�T��W��M��4�iTy-
+�]��"�[:$�g��B)K#�P��s�7�R"�ٗqF��3�
%��2�z�=<��6��x�J�%��Q;(>�0AUNdDT�?k�$J+���*Lv
�8tT�/ٜ�I�m���kl!G�;}�1(!-��b(�$^�� �Mi���>�jV at KVK�������u�x�z����K�<�:��o�	g
�����g�Nj�d.��Ņ]}Bb#���s�����,��#�r�M�˶��)���;��w�������^���i
��7:A�ɔ�R�\�s#ܡ��7���#��\G��`j=����A���RSh�81��X��F�������@�����7����lOG6�%v�
O��)�7V���.}W,�vf��(p��@�K�gM�A���2����|��qy���w
a���yf$��-���2n�P��dm���n���d��	1(�v��"���>��3��,��6r���2'
��l��pr)Q�K�7sx�^&m���;ı��ҨH��
�'y*Cd [...]
�
+endstream
+endobj
+13347 0 obj <<
+/Type /Page
+/Contents 13348 0 R
+/Resources 13346 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13350 0 R
+/Annots [ 13343 0 R 13344 0 R 13345 0 R ]
+>> endobj
+13343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 437.814 154.737 445.34]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
+>> endobj
+13344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.955 177.707 418.715 188.664]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) >>
+>> endobj
+13345 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13349 0 obj <<
+/D [13347 0 R /XYZ 89 770.89 null]
+>> endobj
+13346 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F8 802 0 R /F11 621 0 R /F1 834 0 R /F24 537 0 R /F75 562 0 R /F13 835 0 R /F10 773 0 R /F7 803 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13355 0 obj <<
+/Length 2598      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�~ϯ�[�N��.q�S`;��l;�t�-P�.�Vmm�+əE�{/�P�c'3~�DQ�|���qt�����\����Y���TF�ב�Q�����	�r����	"J�W����?]��ty�ߝ��<���+
;�@q-�'�����0b*���N�S�Utq��d鮈
+}�/��5K<���ńE1f�p+ާ�ɦ3�Ť�M{�_뫄�����ɋ��M���o����¶���Zd~�
T?{O�@
+"p�Z#ݻ.,�H�,�]��E
I"l'�:�A'
�$�8�=r��SZ"&��"��NwS*&i���UV;�ݵ([
�v�W`q��Ο%{2�'Fӡ����ca�03���{�H�8�y�
��S}
�0+���.��)�(0$�XGnjI�!A
��p�Ygi>�;ڻ����M1�����M��͛���C�>��r[,�%2w\�hW00s���)!xRn��b�H
ws[����O�Ҷ-��1�Ef��b�`ߧ�����q/������H4�ܰs7���I������3���N������]c�ـL��طygޡ�� u�7�Ƅ�nYg�m��޶pnx��Ó/S�dZ�.-�u�ϳO��(�|��>]oV�� J9G���EY��2��O����9���8{� `�g��M�������m����y���k�`����2
>��/�h%�

�>����W����aw4"�|0	�E��@���g����
ON-p��f�S0�c����M� J�IR��� 3�Ta�c� [...]
���j�7U�M���;� �)�Fg�5(���]�f1x�S�r�"�����*
�#���chN�TBG�a`}��
�b��.��h�5��R�������@_
^T�#-�}J� �Q���8����I��C� Nb g�p��l<��D	�f���]�v�J��V)�V�%Dܓ���A@ؤ���u�B��~�?�
�(�Y(&8UR���7O��Y�c�d�C�0H�
z�p����#GD=)š $�!�ɣ�

�n���g��'X �=vL�Q�[����8G9��Lt�+�
T��屙�}��'�J����Kw��5UYjw��|R���)�e�Σ���W�>u�>�.W�R��/��K_���	+E 

b�g��$Ɠ{ͧ��A�Z
�'$���J���]�Q]?��@���Bo��zQ��G��~���o��}u�P7ں����]�(/�j�����
o/~�Z
Ƣ$Fz
$@�]�hځ='<4���^؋�����?z��^SHB��{u�q�0=JL_�g��'g���=
h��Y
G�t*���Pu�*D?�u�,�@���'��]<
�#�l�t���M�Ȯ��:+t�F���N[��yv���b9j�@�!L�`�{5�o�:J�O�Z"a�z����
����̳���j����9��O�{��)!
ſ(Ww�9�K`�7Mw�s|4}9�U�
�z$�ic���,f�v7$4!��w������8(���'D�ވ)�cN9h~�����.�;{#l
& T�h����������{rü�����H `��!����z�`I�z���Z?6zE٤�-��[����
��j��
���)1;C�<�?�%
+�<f�� �y
+=$;�Ks}�us�)�ĶT���� �L��wH�1 #⮬���V���1Q&�VƏ�ˁ���-�۲�PJ!�J
+�9E���W�_WWq��D��060˙o�C$��J!	gS��c��<*�PI�"eDA��$��k���-��B!g�ID)C1,�_��1H��H���h�OCK|tU�~
��
+%�-e8�γJ����i�ޛ�L�$͋}���]���m��ڶ]m�sС�r�
�*P<�� ʱ>�`����˴�W���F�C��
�}ّ�
���ʦ����Gl80@I`�_xM��D(��(�˃�O����1�P岣_'N��
_��N(a�����d}��)��7X��
�@&&<F���a�:{��_r�s��T"w���&Є��&�͵m3g2p5�IpM�y��*_�N�Qd�=��?�LP��6�%��!�� �Iw�o�##xJ��ێ�
�*����*1��׫�`wj���k���*]h�2��&�"����1=�{��ˈwH�"x
+��
+tDA��q ���h�~���V

g�
���PK��
�,;y�ʣ�/%}��_��b&�L�PyY8��8���@��J at gY�M��Z��ѭ��l�ϕE<��&�w��Ueuf�@��9���lx6�#�‹zJ&-\� .j��
n�\Y��
�:�T`���w����o%��Q��tp ��H�H����ѿ<�y1��4
+�����q|�\̎��<
���
��˓��� !"��,W�B:��.�
:��'밳7�� >$�>MW���[�����%�=�
�G����

e�������fo���y�~��>�Y����f0ެ�����5�lL6 �N�����fo~�����љ�cZl[6�kI�~U�m"�	]$�iVċ,s沲������5�	xO�w�4��gg��
d��(��H!��u$��9���Y^荌���8��6`Z
+endstream
+endobj
+13354 0 obj <<
+/Type /Page
+/Contents 13355 0 R
+/Resources 13353 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13350 0 R
+/Annots [ 13351 0 R 13352 0 R ]
+>> endobj
+13351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 339.557 154.737 347.084]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) >>
+>> endobj
+13352 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13356 0 obj <<
+/D [13354 0 R /XYZ 89 770.89 null]
+>> endobj
+13353 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F13 835 0 R /F10 773 0 R /F8 802 0 R /F1 834 0 R /F24 537 0 R /F75 562 0 R /F7 803 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13362 0 obj <<
+/Length 2390      
+/Filter /FlateDecode
+>>
+stream
+x��Z[sۺ~���SK�
����郏�drj'�����d4�˜J��K�_���Qdǝδ}1@v��~
�z
�z��~�

���'��x�M�<I�8�$��i��%q43J�5b�O�U:�q�ˇ{5/��Ev[��������U9b�_�.�j4�!�ϖiUa�Z�)�Z�3��	?����������#bQ��!�o�:z��zs�٣D���l&���
h����?��ըk	uW7VO�zz&�Px1$�!�z���*�3� .O��e�������j��5��Ί�Ⱦ���ˈ�6c	���Ɯ*��B�X��fŢL���
MT�O( <��
;�
+ۦRs���P��v��N[�e�Ru�.�Ҋ5�<�;lSl:��~�
�Z툫�c�m���XD$f	jxӬ�E�Eb�lT��F<e) ��wii'� �\�x����	Js�f�/8%�""c��!���cFi�
�� �zs~
F��z {ƙ� ?|��D��m�#�����c����4F!ш�M�A�
pj  �E#� ���Na�3�zȘ��s`=I��SF�\ے���[���v,'c���

�Y��Tz%@9O��ƌ��������?�^?Zl� R��q���9vٽ���t`
bq�(�x�#x
���v�A�D>����}��a�^Gq{6���*[������&���`�N^�e���P<�!a�S�!

��]
x8�
%!�����V����j�ыg�a$mRI�>$͋ꡪ�
+�f�#���I�Zsm�LM
4#*��R
�'`�D2�xo�x�}����P)9��ˬ(��a�&��6�»[5���� LԆ~K�g)�!M�}�>ا
"�7�(J��(gHY�X���a�0�Ei�d�W�Zi}q[���t�~`IeG}��6�i#E�/�u����_��J�d31�`��Qi�W.�j��
+��(-�M�-��n�O�.������0������S��3̐d��ro�soU1c��� %R�j6�m�v�V�ʖ/��(���*[G���
F�:ݭf��5�@�@:�f�Q���f���By���"ONΊ�����~��v�ZG���f�E	�����
V�x�%���;��t	Z.l-z
��7P2kW�z��,�N
|_
�}��H , ЖQ�3��۪u;�e'�:�����M&�߼��L�O'�~�g=���.�5uݕ�:��&�/L�$[
���ۥ�
4��r��������_�gt�\eڟ>Y�)
=�y�|{��
�Dgj�Ң��Q��Hr

C=�z���·�>}���f�h�t�я��/1��Zߺ�m�΋|
y��J���ݯ�;R�8?�:���!��xPn�3>)���B���j;q͕Z�V�YSK��^
N/.�J/�
+aW'�.�|6n�P����e
<� m�-q�V(.�Z0: )!�;������-�1��s�6�����+ײE���@�������oӳ��.���QB��\��:���N)�_S{���Vo�Ny �h��U��rl
[��%�&��
�3 �����$l�/	��
snfuaI�_,OR����&��&������,�D@��j��=w��Dv����,�D@ݢ���&)�!݌�1=��)�B�<�������h���$ ��
��W��J
��2�����(
+�CA~��'�+�{�(�	6�I�
�W���ú�?�7 �$�������f��Z5a�T��
!]�Ľ{
6�
8VH����W_��l���R� �ĽEa~j��r~��K� Y�ah@�b��;���x:
�����te�~(����~T`;+V�Fg 3xo;w
z���E?�jK��n���L�p�Ngv�&�+;�w���N��Ym����(^V(�1��Y ꓳ��8̟�:TϨ�
T�Ť>)
��f7=�K3ys�P� #Ik��(���Y��t��l�SH-4�>ж�nsJ���N�i�Ͳ
���s��`��K�n�M&�}�����&���5{��{W��(�#�}�R�
��֪��LC�P�At��&
a����t�
+�S
+��D�<vŘ0�hF�р�z�|p#�i���uY�|�,*]�^��$ aԻ
�b l����9�}V
�7���"7�
�HM��0�Gl  ����p�fY�{LI�
+�
ssG�s�
�N8�J�x�
+:;���
����u����s��eO^Ѷ�j �����Ђ9;���bʤc��.��R�_Ga���y��M25j�e�]�2�֥J�� .ԿQ�]
+�O����� w#��%
���z}r||�,*�/$�݌��E�)Y�
+[䬊��7�ap�n�<@�e��xk
0�G8C`�173�}���
�^	�EFޜؿ 	t�
+endstream
+endobj
+13361 0 obj <<
+/Type /Page
+/Contents 13362 0 R
+/Resources 13360 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13350 0 R
+/Annots [ 13357 0 R 13358 0 R 13359 0 R ]
+>> endobj
+13357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.761 527.368 221.894 538.272]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.512 413.299 221.645 424.203]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13359 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13363 0 obj <<
+/D [13361 0 R /XYZ 89 770.89 null]
+>> endobj
+13364 0 obj <<
+/D [13361 0 R /XYZ 90 592.445 null]
+>> endobj
+13178 0 obj <<
+/D [13361 0 R /XYZ 90 570.069 null]
+>> endobj
+13365 0 obj <<
+/D [13361 0 R /XYZ 90 570.069 null]
+>> endobj
+13179 0 obj <<
+/D [13361 0 R /XYZ 107.713 486.57 null]
+>> endobj
+13180 0 obj <<
+/D [13361 0 R /XYZ 107.713 470.63 null]
+>> endobj
+13181 0 obj <<
+/D [13361 0 R /XYZ 90 458.511 null]
+>> endobj
+13366 0 obj <<
+/D [13361 0 R /XYZ 90 454.028 null]
+>> endobj
+13182 0 obj <<
+/D [13361 0 R /XYZ 107.713 372.502 null]
+>> endobj
+13183 0 obj <<
+/D [13361 0 R /XYZ 107.713 356.562 null]
+>> endobj
+13184 0 obj <<
+/D [13361 0 R /XYZ 107.713 340.622 null]
+>> endobj
+13185 0 obj <<
+/D [13361 0 R /XYZ 107.713 324.681 null]
+>> endobj
+13186 0 obj <<
+/D [13361 0 R /XYZ 107.713 308.741 null]
+>> endobj
+13367 0 obj <<
+/D [13361 0 R /XYZ 90 280.059 null]
+>> endobj
+13187 0 obj <<
+/D [13361 0 R /XYZ 90 257.682 null]
+>> endobj
+13368 0 obj <<
+/D [13361 0 R /XYZ 90 257.682 null]
+>> endobj
+13369 0 obj <<
+/D [13361 0 R /XYZ 90 145.601 null]
+>> endobj
+13360 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F24 537 0 R /F113 1791 0 R /F118 2438 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13376 0 obj <<
+/Length 3026      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~���SWB���g�-
+d��E�V7q��,
Z�m��P����=s#�ug�/E��3gf��\i<z�яW��\��A�Q�I���~���	��cN�����FLjD	o�����o7o~�yo�]����tE�
'@ �G��Շ��h�a�=�lZ�8e�������Կ�
+sh~��	�4�	˜�aHc��y��,[W���X��Dn
�F0l)�%T���.�ޞA$�k˄�HF2����
O��K�tE��"��:��*{!e6��������F���(��6gS�_�Zd�C�x��儋�t��k(氹l�	�4 8�;C�8"R훡��
)Ne�	�<��	���dJ
��fv@,��)b����{�#9f�g�	c v6�6�(�|��x��#T��2��v�Ng�-
�`�G,0�'-�tt T V� ��(���%H�I#�(>(/���,�&��.
�HI��L	�x\e��"�2��$~U)$�+�7�DK�B��T_�Y�.3 ���E�DA01���
���$"<q=�|���t۞SI
+&G�{���D'��m/�q.��t=at�ZLy��e�
+
�K�
B����=k��K~W��d��_^��~{ݣ� ۡ� ��R�E(
�Ww5^d�
Jp�<J�!����>%
�����,��Ti��M=��Qsv��@4�RG�����/z�I	b��?
�c9 at Q��#��[�7U�<�p�
!o����NjR� بz��r����3I(�*O����}V���`�
o��O=���Wd�O
��%�\����XL>
��&<qc>O(�y�E��2�I��=̔� +��wO�
ݔ$0��1,��rug!iN
S��s^<�s���a
�
�K4AZ���
@�˕�z�#l�OOY�[ݻ_��2͋�O /:�i��/6�H�ԇ���2��t��q����!t�1��6lO�C(
M9��vl�QM���d.���u��?7��b��2}5�=��z�
H���������4b�N�e=T���2������a�i	�nnP;�o��f�&Ƥ@<��@��8�$�NI3��H�I���6�K�)�&kO�z�� ,�ڢ��"��ĥZ�	 %�P�Ըy�"����V���1�٬Zy�{�c��|6i@��
�ż�R�L{
L�b�1�̲�ƫE�BZ��˱���ymy�Ǽ�O���o

+�	���� �11$��� ����N�
#$�\@���Nu�/R���:�C�Z��*Mk�W�6UZV;�Ѹ��v�
�C߹s�
�X�
��%:�q�<��P�V*
����ց�Q��L�~�Ŋ�FqSM>�,���8
�Ξ�nlp�Ы!�6�D�6��YE�����LA�$��;
+s��ӏ�X��9
����ԑ���Y��	�K��g���x��w�D���x��Ӫ�D�
������
���dZzr�X��CV�#��T�������CN0T�;3<��O����
6j7i@��bX"/�Q(��b��]�Օ�(
+k��5���ֻ>�6�Ǭu#
&-��y߂0�Y��/]��[��L�� KՑ���V��z{Y�w/K/��UiQ
'���ׅ�p�}8�+�Gp9u?M�%]IM�
+g��e�Y�F�j
�c[���z{+ji�
+�&$je>�_��C��FNcz�s�t���o�N� �e�A"UrXr�̃�AN�8���A�f�;�7T�x*f���}��YN��/k��`�P����#<���*�;�{�}D�=�\`���%]&Sr'ZYQ����}�tZ�B
+��\�U8��
+4 79�``4ѝE���f�t��
��6M=�K!ډw�_�~�A���)"��%E�V��	���O�����
Y;%c�������|�uy�kI��"`�&����)�v*����Y��
+ۍ
+Lof�{��Z�`��53M�ފ�C��C��Pq
+nM#�\�Cň%�SxH`�Q�۔tT8���~V2�
+4���

�s8��4X.���HG���8�j�
`�ڰ�l@����ڀ�&� cs,#���E�ęV���׿
ԸYO��_6��
�%_6,{�
��$	ᓺ�EO! �J�,��v��E�w	�v;�Pb�� b�	10����l����$�2vb<$��~e�����|��q}�HJ4�v
���W�����j��؄_�^Ef3	 �b��R��K�[�?7,6�E�-�`��w���+���M+��Qyܬ�.���ǰ/�6�U픾9�d�����f/���>�D[1�
��T��;=�;l�XQ4�I�̣
�i�[Woic�2�ɸxri�96	����7�1�͹�
�o:��
��n/���Vu���/[B����݀�ə���Qfm�
�7���������w.u�����*��	
�j>����W����E�`�T�(H�3�0�'"7_�4���6H��G����0�M.�H��
.�ѕ0�%��f)���!��˘b�g�z�6�tm�q9�
+����V�h�W��7_�'rԓ�^p�0�A��0�[a4�x4��Ϟ��٥�)쓐�5����W̺��l����C�F�
*
��<��f��>�q�<
�)D(��%�Jʳ%��4)��t� �,S�a���+ȴ��p�8��agO0�xNw����jb��{��/�	:<�OК_�'`��>�4x�
�!MԹy��m[
ᛁCpc��+��ل��'�?��Y���|����Z���/
C-�i]vKpG52�05�A:���!�F�n�s�y��c^ s� /�k��
68j�S��Oͭ��b���e��0�\�](
y���?����խ/i�O][�D
+�t�5�)g�>
2���LT�7�E^��"4��������a�n�(;��X�6����Q?�P�([w�ѱ���^�]���+ֈ���i#0쯆��܅x�A�u���_���7Y��D�?߰翦E]�w.��)�::A9
%C�������Z��
�#� R��
�j���˻��
�4[-��ݼ���W���vh�j>���K���N����F��
+endstream
+endobj
+13375 0 obj <<
+/Type /Page
+/Contents 13376 0 R
+/Resources 13374 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13350 0 R
+/Annots [ 13370 0 R 13371 0 R 13372 0 R 13373 0 R ]
+>> endobj
+13370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 693.377 432.413 707.324]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
+>> endobj
+13371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 480.788 432.413 494.735]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
+>> endobj
+13372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.997 146.418 486.519 158.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) >>
+>> endobj
+13373 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13377 0 obj <<
+/D [13375 0 R /XYZ 89 770.89 null]
+>> endobj
+13378 0 obj <<
+/D [13375 0 R /XYZ 90 718.682 null]
+>> endobj
+13188 0 obj <<
+/D [13375 0 R /XYZ 90 684.012 null]
+>> endobj
+13379 0 obj <<
+/D [13375 0 R /XYZ 90 679.529 null]
+>> endobj
+13380 0 obj <<
+/D [13375 0 R /XYZ 90 596.843 null]
+>> endobj
+13381 0 obj <<
+/D [13375 0 R /XYZ 90 506.093 null]
+>> endobj
+13382 0 obj <<
+/D [13375 0 R /XYZ 90 442.506 null]
+>> endobj
+13249 0 obj <<
+/D [13375 0 R /XYZ 90 417.973 null]
+>> endobj
+13383 0 obj <<
+/D [13375 0 R /XYZ 90 417.973 null]
+>> endobj
+13250 0 obj <<
+/D [13375 0 R /XYZ 227.842 360.801 null]
+>> endobj
+13384 0 obj <<
+/D [13375 0 R /XYZ 90 354.161 null]
+>> endobj
+13385 0 obj <<
+/D [13375 0 R /XYZ 90 273.631 null]
+>> endobj
+13386 0 obj <<
+/D [13375 0 R /XYZ 90 183.678 null]
+>> endobj
+13251 0 obj <<
+/D [13375 0 R /XYZ 184.963 84.126 null]
+>> endobj
+13387 0 obj <<
+/D [13375 0 R /XYZ 90 77.486 null]
+>> endobj
+13374 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13391 0 obj <<
+/Length 2373      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o��~���S+՞�_���I�4E���K�D�D$�!)�����^��$��A`�\R��7���~�$FT̞f�
�~�m�����b3���rv�83x��AB��z�Ӝ`��bI0�����&�7
�����9]���C�o��7����
����&�.�T��כ�,}���1u?��U
+F�$lΩY�r���7wW�]��g��H��j{��/x����|f�쳻i;��q3������s~��DH�-�
��.(�����$�(�YG��g�c؜�G�Ѧx�h�8�`�,��.���
�� l&@)GXG �P.�z�s��K:I�
+�$� 䇀�Y�9d��u�����
+a2	
�0�8�Q�]2��KN5q�_�"٦�g�f�$=kHz-��˗�x�+�>I����D��:ۦ�2�w�'��X��R`6_�����զ%U
+�%�1Bx;�]
+d�(9��m����	E�{�O�Bt��U�������h0�g��g4⾨��`���x�55q�_�`i�I
�E
ƺ��V�n���R��OApB%��S��c������
?e�uj��n�������7���1���A��
�P�D��5)��zK4!�ۀ���C�%�qP�xr�vi+W���~��*}�\0"Kǎ�w`��'2�RD���ܔ���l�엶��13I
��䬋aD0�J�H��c
��:�bl��c�ޝ#	E��&��P����5d�y;�d�{`
S�=�~���pP̑�lJ?�`&�;����N8�<������{.���@*��<{��2ߦ�J��p:@:.KfΓjԷp�:�4�Fwy���(��%߭���=&��m6<�aQ
W(�"*�?c�|�PQ��W=gC�]�����<�-���qf�E~����~�ͳ�Xh�U���1?�T�� Yk��.�D��(i��j
+�\sC#�5� P���^F�c���d05���p
+�H2(�./�v�B
�n�
�Mu��}�P�p
3�/�V6
�&G�%�ˈ���W�u:�?��� ~�g�c}5v��*){H��a9�hI�F��,�pK���7ղ/&k#H�"���}�N���0tBYӱx��p?al2Y3�����9�1Y�ٕ5v�=�cHz�*�HI�
����e����dYXpm�U�y�gOE��5����"&
EP}y���*o>��
+�i��g�%6���@RS�q(o@^��70����RuCA#D�ƪc���ԍ�1���F�IXu#{1x���tV�h��vF/}Zu#�qu��2�P��߾�U�
(�!���GDm	��Z2)�_d��
�L����F��A�;?C��!�u߉̜��/��@J�zc�M��8�-H�)K��&��a6ݦ�?��
��۟�N�~��?���>������k�B�ÅZf���̀_�pk���OtJL��
+�3u�|�]I9edM��:l���Q�
m�xp��]�X�ErI�Igw��L�cd�;U�G��(��AN�]]d�Hb($b�T��}�A�����`�	`����V<�4�Ũ�|
+�Ũ��J��7���I ( �E
��<��ߓF�
�$���&q
ʤ�J 'M<���!�+w�JGE�}d�{��rzNW�A��,�d�ۉ�a�V�Q=���8�O*�5
��Ǵ�GdF_'ixڮ5L���اC���{�,�d���mB���3J*�v�MZ�S.���y<�0�иt��
Tg ��T���J����5L3�'*8�>[��#��E� [a&��y�4$"�bF���1��5�q��5�%"Z���+Be�y��
�KT�}��/-'\
`X	�w�3�I��j�d��D���]�U(y��l��V���;��!�C��V�e�=y���W���o��JR��{�����1M��aS?R��.�<ñ.�a]GA��5��V&�^�]����B���+
��������1A É�c�̾ƙ��
{1�
�f\Su
a��0�Ek
+F!ڏ�!��>
/�:v�DL�9��yh3��Km������	��L- �O�Y���{VV�+`���8�H*��`���7���
Vl�7+��[8�kBZ��l�]v���h��xׄ5aa!��$|K��w�u ��] ��:A�����=��Y�N6�� _�)�0X��
�I���v��ɸJ�����
����S�3�+���Q�(��s�Ѥ���K]�1������O�^�a�;�g��'�.�azu���

h�"�^,��[_�,d���Y���_̴p�ˆÒ1繪^�?}z�?���	��9L��/ᶒ7q��_�ŭ�D�N�fC��I�h@@�ꈉr�~�_��~�
>}�e����v���3m��
+endstream
+endobj
+13390 0 obj <<
+/Type /Page
+/Contents 13391 0 R
+/Resources 13389 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13350 0 R
+/Annots [ 13388 0 R ]
+>> endobj
+13388 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13392 0 obj <<
+/D [13390 0 R /XYZ 89 770.89 null]
+>> endobj
+13393 0 obj <<
+/D [13390 0 R /XYZ 90 655.872 null]
+>> endobj
+13252 0 obj <<
+/D [13390 0 R /XYZ 90 609.246 null]
+>> endobj
+13394 0 obj <<
+/D [13390 0 R /XYZ 90 604.763 null]
+>> endobj
+13395 0 obj <<
+/D [13390 0 R /XYZ 90 543.856 null]
+>> endobj
+13253 0 obj <<
+/D [13390 0 R /XYZ 90 497.23 null]
+>> endobj
+13396 0 obj <<
+/D [13390 0 R /XYZ 90 492.747 null]
+>> endobj
+13397 0 obj <<
+/D [13390 0 R /XYZ 90 419.884 null]
+>> endobj
+13254 0 obj <<
+/D [13390 0 R /XYZ 90 376.958 null]
+>> endobj
+13398 0 obj <<
+/D [13390 0 R /XYZ 90 372.475 null]
+>> endobj
+13255 0 obj <<
+/D [13390 0 R /XYZ 90 284.07 null]
+>> endobj
+13399 0 obj <<
+/D [13390 0 R /XYZ 90 279.587 null]
+>> endobj
+13256 0 obj <<
+/D [13390 0 R /XYZ 90 181.384 null]
+>> endobj
+13400 0 obj <<
+/D [13390 0 R /XYZ 90 176.901 null]
+>> endobj
+13257 0 obj <<
+/D [13390 0 R /XYZ 318.321 121.701 null]
+>> endobj
+13401 0 obj <<
+/D [13390 0 R /XYZ 90 115.061 null]
+>> endobj
+13389 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+13408 0 obj <<
+/Length 2057      
+/Filter /FlateDecode
+>>
+stream
+x��Ymo�8��_!�=��S
z�v�Ew���&�)-Ŧm�l�+ٛ���P�dQ���q��p�rf
>3��2��ϣ܌.�)i�%���"�8R\#!�j
ݎ9Ó�7�DLƈh	_U������7��������G8"΀@*�f���g
���/FL��C��&��q
]��5�m,w��qc��L���l�^��m�f;S���t����Ef��j���I��la�2�_w}���+r��AՌ0��²���&-X8�R�V�HI���dJ0��?'����"`d|e��b�
/�)|�"kD1
Z0�t��%��*�DbXr!+S3��j��8_O?�̼�@�@��s@�4F���o�}��
����]�cJT���Ug�	��~������mAs
�1�0g��X�0�!�2_�wi�����D
�d\�旗y�+L�����
��
!qۿ� &��+_�w� ȥU����
��҇��ޫ �ͽ�D0�fT�7(FB5�´H�SKZ�h
+���\2˳�-}�󝄟�̩0����|r����
��tov!0e3��ʧ~�%p5�7�����
ʃ�
+D?L�
<
�
FK�Q�4��A��
rϔ�)l�H���N�c���t�^���`���}�ev	����.�1���~_�
:�v�`�*���}���.��-Ap��(;�TDR��BA�)��*DqS�r��A�����
D"����	��8>g���b!B�3~��$v�A淩�Q�B$�Q�B���C�
o�0Fui���YL����h1N�{g�2��B��gu2�I<l�+C��-�2�� ���=A���헙�Z/<A�Ϡc!��C�+1Ś�ߦK8(
+�����tM��Z&����t���D�'�V"��C�/2*=��m,�ٝ)�	�X
�<�
� ��9I�
+�Β1^���,C��m"���Y�M쇚�+
�l���.J3O'����d��UU�3�u�J�p����?�`7�h�i��K��t
+�I6l����%6�I�sM�_���xqڮ����s�nLV�'�v�[ӣ�%,�j�@-Ka����p�^T�A^BUN�9�,T����@�JR��@x��e�(W�@����Xv�S�.-�W�*
��,K�l����}��TC&��T�0��A�

͡���ch�	���C7y$ű/ߵd�3�c�+^ѩx�%+$�nj��4[���<XCD�@w�4��>V������d�O۸�ݰ�]�Ȏ����E@
P_l���Dr�K�T�c��(1�W��\�}����G;�`�� 
����K�IY7�8�n�q"��ڃ%6��O�Um2��	��{W�&��I��ܝ|4��u���>��=�~�g�M#�O��v�!8t�6��"����oM���	z4LU�����>��q�VǶ���
���$����+��hoO�#,o��Y΃�U*�ت�H��Ӌ-��Xܦ�>l ��v���h��Y���9{8i���"	���V�޸�κoh=
D�;���n���]U>=^p
�N��zy�3f
+���b��
�#LT��kG�۲g�%�M��ˉne���n�g��΄+�DT�5�'a��?����*����<�W��|���l��e���4�����]䛎>X��+����ks��

+,�r(�}���"|�v* ���5Z�N�SO����Q�ԂM��H�q�5!Q
��PK6$Y��
+�
��Gk
��z�g�@��2����$ ��<@`4�p]7���Z��,C3���q8�|n
��裻R`
��La���*�Lb�M�1���sS��maJH�&
@��{�� ���
���B-�}��4���s�#�@N(ݰ��
[���A�4�ֱ����{�Tǿ� ��������+$tշ�cTqX��_�zX�o\�߰�
�
�M���`�nsA�,%wI*��ʿ����o��ߥ)�j��'�&�>Y�߮�T
*&�8>vm�)�6ud9l�i��ꪗ&�q�V������~��@Z�Y�9��Ƕ5}��R�䅩��psS?�:�HK��
+endstream
+endobj
+13407 0 obj <<
+/Type /Page
+/Contents 13408 0 R
+/Resources 13406 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13350 0 R
+/Annots [ 13402 0 R 13405 0 R ]
+>> endobj
+13402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.899 436.388 345.51 447.292]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) >>
+>> endobj
+13405 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13409 0 obj <<
+/D [13407 0 R /XYZ 89 770.89 null]
+>> endobj
+13258 0 obj <<
+/D [13407 0 R /XYZ 318.321 711.11 null]
+>> endobj
+13410 0 obj <<
+/D [13407 0 R /XYZ 90 704.47 null]
+>> endobj
+13411 0 obj <<
+/D [13407 0 R /XYZ 90 635.896 null]
+>> endobj
+13412 0 obj <<
+/D [13407 0 R /XYZ 90 569.853 null]
+>> endobj
+13296 0 obj <<
+/D [13407 0 R /XYZ 90 513.335 null]
+>> endobj
+13413 0 obj <<
+/D [13407 0 R /XYZ 90 508.852 null]
+>> endobj
+13414 0 obj <<
+/D [13407 0 R /XYZ 90 390.042 null]
+>> endobj
+13297 0 obj <<
+/D [13407 0 R /XYZ 90 361.111 null]
+>> endobj
+13415 0 obj <<
+/D [13407 0 R /XYZ 90 361.111 null]
+>> endobj
+13298 0 obj <<
+/D [13407 0 R /XYZ 90 319.406 null]
+>> endobj
+13416 0 obj <<
+/D [13407 0 R /XYZ 90 314.923 null]
+>> endobj
+13417 0 obj <<
+/D [13407 0 R /XYZ 90 270.708 null]
+>> endobj
+1922 0 obj <<
+/D [13407 0 R /XYZ 90 168.281 null]
+>> endobj
+442 0 obj <<
+/D [13407 0 R /XYZ 90 143.474 null]
+>> endobj
+13406 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13442 0 obj <<
+/Length 1692      
+/Filter /FlateDecode
+>>
+stream
+x��Y�s�8�_�S�Ԋ$ć��K�Nڴ�kr��v<2�	s\�Iݿ�VH`C�C_�^l�>���oW��n,l�
�~=:y�;Gܣ�u��8�|Ƒ��Sd}�	F�?���=
l�|)f�1�v�lne���e<�E�9=�^LgWY�.�,�}�"9�P�g�(
+��$2���i���f�~7z}=�6" ����E~`����؊��;
#��}5hi1��b]��
�]�<�Q�D���"��y\�J %S��\,��"�u�u��=�4�e���f�^��(��bP�R�ݷF�{��춫�z�yqr��i���U#ꪦ�{�̘���|��'m�0�!L��*�dѫQǴ�C�	�	�������R�5��
��vQ��4=J���������1��e)�qZm
+J0+ I<�$	<FAe�Z�W�R(�ޘ����^f������[�)�R�(�;�"�V���jU�)�i1[t,<q8�`&� �1f���c�N�V���A.�2��7�4T�:
�W�<��rJ�/�ŕև�SkM�l��ek��7��
+�;�0�Ѣb��
����dc�����A��&-2L��"��6
��
l�U[�Id��0�0�Oi�2�!����
�|�x
�
<T
h�3�!7�Ԛ�
�����Q�cЖ� z�n��P�;�wq^�E�8��cǵs)Ң
(v��iW��;���Q3-L�t/�*��7�A F�D�O�\�i�U�F��`��M*�q(�d3��,èm@�}\���
�).��q�G�\2�
+
#�!�
+�s��A�n�d���{��G�<�cǖ�n
1CFЂ�\�E㽞bv��p��Y�����������j�����@u��Q��}4r����xax�:gib�
�љ�(��6���Y���(6�x/��I��2:
#q)l��ϱ�b�~�vc�8{f�Ŭ�s�	��
�>�FϏF>C��Op��0��0.��Đ�χ)2_<.L
/8�S�&1�U�҃������</����Wk�M~�z����?0���2N��g���rY�3���k��t���pv��G��;5�l{����v���ھ�z���A������E�6��T�+�g���1Q�|m*�;�x����1sm���A[�ܢ�A�85o`h��
+!��
%�Ԉ��ѻ:i���`�"��Y�^��!\���i���+�Yq$���E�?�VH書���&oSha�|uuvq���p��b[��&�<@�
~u�I��.	
O�4�I&����-\�bhB��%|L�	
��n��5
Eqw�i��z�[�¢5��܋)�)�D%�W�k���zu���n*V4���~�!�|ax�"Kݭ�Ch�,zHe�:>�e��`U�`�]n��Y%v�7���j+�j�y���~ʆ�ä��0�x�X'/{	�M")z��;
D��>.l���V�ś�\f�fV�?�:�z�PH�R$337Ng�M���/6�f�$�s��e��g0ewck&j�Mg�W���
+	
c�<ZR�E�
���i�W��^�x�?p:�K���^�9|Z�3o��gմ�9퇼{�AΧ��K��2cg[Ǫw�9齮m0�^��_��Sq�X�H��J�v����6e$�@�
(<Mh��5o���4���u��kD#4��mY�NON����nP�-�G��߸J���
��4��Q}ET���y
��a�Q0���
e��s��t�Q��{��
+endstream
+endobj
+13441 0 obj <<
+/Type /Page
+/Contents 13442 0 R
+/Resources 13440 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13456 0 R
+/Group 13404 0 R
+/Annots [ 13418 0 R 13419 0 R 13420 0 R 13421 0 R 13422 0 R 13423 0 R 13424 0 R 13425 0 R 13426 0 R 13427 0 R 13428 0 R 13429 0 R 13430 0 R 13431 0 R 13432 0 R 13433 0 R 13434 0 R 13435 0 R 13436 0 R 13437 0 R 13438 0 R 13439 0 R ]
+>> endobj
+13403 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Solution__Node__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 13457 0 R
+/BBox [0 0 212 192]
+/Group 13404 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 13458 0 R>>
+>>
+/Length 419
+/Filter /FlateDecode
+>>
+stream
+x��T�j�0
��)�q%��6

+cP�a[`��C״
�
�;��''v������$K�$�s�!t
d�5)����]�簅�a����;�|	��ob� �� �{`$maq��Hc�^E��
+��Tp.�(vW3��>I�H at jPؓK
#vi�?mD�!�����0
j�^L6V��41�AD��KR�ʘ��u�&��u5���p���c�lZ	9tYB^��/PWY���
�:/\d��L�$�N�$J��<e�O��vԉ�['�V�v�GMP�ǣuݐ�:g����H2��e�9ݥ��w%5~�
gmL;��y'K��F�P����{����|c��|
�>��
164�W�
��
"x�!�߃fXP��'���P3��
+�ݝ���u�s��<]GL��NJJ�\��D���
�ț�y�T<�oX�
+endstream
+endobj
+13457 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+13458 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /LKRLLW+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 13459 0 R]
+/ToUnicode 13460 0 R
+>>
+endobj
+13459 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /LKRLLW+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 13461 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 667 556 278 556 722 611]]
+>>
+endobj
+13460 0 obj
+<<
+/Length 13462 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mn�0���b��"H	!U�ET�{H���
Yp�?+�j	��o��3���<7fX(}w�jy�~0��<ݜb��:�D��D
+5J���ܮ��cc�)�*J?�8/n�ݓ�:~H�(}s��`������jo����f�,�k���t/Ҿʑ)
�}��>,����">W˔���4�V*v�\9�2�j�z�ꄍ���9l]���
�‡gY�Ձ�@G::������#�H'�="�t����ԁ
+�
+T�,Z� x�>�A|�����p����<�c�+"���M���ڻ������9?��`¼�I
��o�Nvs���
�b
+endstream
+endobj
+13461 0 obj
+<<
+/Type /FontDescriptor
+/FontName /LKRLLW+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 13463 0 R
+>>
+endobj
+13462 0 obj
+321
+endobj
+13463 0 obj
+<<
+/Length 13464 0 R
+/Filter /FlateDecode
+/Length1 2044
+>>
+stream
+x�UU{l�U?���W�Zگuݳ�ڵ{���c���u���ѭetOV7F��=d�D$b$�!�&�`b��A��?�����1$�	ehx$�q_=�W���{����wν �AP��%����C7�4��S��L6h{q�*��zlWt�/�����[�s�pC�!�/�%�����Q�
!?453h/A
�a4��%g(��u��'���tD�J�ҨW�#TƵ�	�]��^�F�Qn��(�	��ZZN��ަ��6��TNh|n��0����u/7��T4<�}OWf~��{����*��\��
@�dmF�fm.Fj(6���ޘ�j$
�n2K�T6g�����Jt�2#à1[$��ጬ<U�s�y%զ���zI�%���_�$s����+�-�h�
�jM�9��L�D��iL�J+�u{وL!�
V`"Ђ�cڄ��0��4֦%�p8�Y�l�b�7Կ�{@e;�X��0�PG�Y<��
�-����Y
�G+�m���0[Ŷ�*�o)
V�Z��$ns�r�6f
%y7����
H��z�?>h���cIr�p�?E�j
;�S[,Uk�
��(�M�.
������n��t���K$}�3�U"1��m�+sV�?�0�a������I�Ae�@���Ro~�*����e�0'W�+�*�ؿHe�S�Rm^�ʹ�p"��-�Opa�X�S͖��P�����I�5�n��wki���+�jƞ!����z�#p�r"$�v���O�S�
$��	CX��������
�;LL$ܰ��n���]"��UA���
)<u��}�3r1R��!�w�ѾV)°��z�_��|��W&�
���p�'��j�.?wt�
�ͭ��L��`�A4Π]	����+?#1���.z?�q�x�]��q&��X_����x*>'b��rr��;N)�
�楌A������xl���d]�6��n!��>t���fru���L��l�&_�kX[�7�W�t-&�ȅ�P�q�Y~ [...]
U� �VH
+���
�U�R�QP�W�e�^���7�� 2�����\��d�w�-��#��ʷ���,ڐ�j<:�����N��̺�Z=ڜ����`��5T/)t�
S=�����\�����>K�dɭ�1X�1����B���.79ͽ��&$^_�\��ǟ&DA�K�I���2\�*7'�4�����2/w.O%�����	�ɓ���a����	�����ڎ
��
�qY���^2���D�,�"b�!t ��DI�ܱ�.�  ߽~�Oi�����
�O�1N=C�~@����Xo�Pe�
"�v�.��;4�$��L�\��B�0k��x}1v���cd��2�)�xR�ė@����$�����vf��I�Dwx3��*�ic~��+���M�
8��p?€��G{�k%�
�?�i���a�V@��|�"y��^�j\�
��tHA����$�FG}+�n\������
+?3�֦B"�2��H���!�!
!}����p-·Tt�o���31���.iC:�t���ZrO�>̚
+|����A��5��
+endstream
+endobj
+13464 0 obj
+1557
+endobj
+13404 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+13418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 439.687 203.075 449.614]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) >>
+>> endobj
+13419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 370.751 195.613 381.281]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a8db329a321108295b995b5af1058ff37) >>
+>> endobj
+13420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.95 370.751 278.083 381.281]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 343.869 208.246 354.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.216 343.869 239.787 354.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a996dc24a90ed7bf0e7231563f3c78975) >>
+>> endobj
+13423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 316.988 231.865 327.518]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c1045d83957e66a37f4b9605431945c) >>
+>> endobj
+13424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 290.106 178.996 300.637]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb1b3eeef8a1a793899d9b66f1200fb0) >>
+>> endobj
+13425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.935 263.225 247.638 273.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+13426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.608 263.225 302.989 273.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a49e1548e93467d9fd12ba992f8712c56) >>
+>> endobj
+13427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.935 236.343 249.281 246.874]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.251 236.343 305.729 246.874]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a50a4be6352d2c6b88989c7a49bae79cf) >>
+>> endobj
+13429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 209.088 214.681 219.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.421 209.088 300.2 219.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4ec7c4c8093efb70675c35a17d6a7e28) >>
+>> endobj
+13431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.015 209.088 339.203 219.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 182.207 181.845 193.111]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) >>
+>> endobj
+13433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 155.699 176.505 166.229]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb91a97e6b843121536f02146fb43f75) >>
+>> endobj
+13434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.063 141.212 452.197 151.117]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) >>
+>> endobj
+13435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 117.485 220.22 128.389]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.719 117.485 317.355 128.389]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a082a2f74f2c88339b84f233dc45e3370) >>
+>> endobj
+13437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 90.604 220.22 101.508]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.719 90.604 331.582 101.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ab41e16bb175c436813472be1b131f853) >>
+>> endobj
+13439 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13443 0 obj <<
+/D [13441 0 R /XYZ 89 770.89 null]
+>> endobj
+13444 0 obj <<
+/D [13441 0 R /XYZ 90 457.112 null]
+>> endobj
+13445 0 obj <<
+/D [13441 0 R /XYZ 90 388.864 null]
+>> endobj
+13446 0 obj <<
+/D [13441 0 R /XYZ 90 388.864 null]
+>> endobj
+13447 0 obj <<
+/D [13441 0 R /XYZ 90 360.248 null]
+>> endobj
+13448 0 obj <<
+/D [13441 0 R /XYZ 90 333.367 null]
+>> endobj
+13449 0 obj <<
+/D [13441 0 R /XYZ 90 308.211 null]
+>> endobj
+13450 0 obj <<
+/D [13441 0 R /XYZ 90 279.604 null]
+>> endobj
+13451 0 obj <<
+/D [13441 0 R /XYZ 90 254.417 null]
+>> endobj
+13452 0 obj <<
+/D [13441 0 R /XYZ 90 198.96 null]
+>> endobj
+13453 0 obj <<
+/D [13441 0 R /XYZ 90 172.078 null]
+>> endobj
+13454 0 obj <<
+/D [13441 0 R /XYZ 90 134.238 null]
+>> endobj
+13455 0 obj <<
+/D [13441 0 R /XYZ 90 107.357 null]
+>> endobj
+13440 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F24 537 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im22 13403 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13499 0 obj <<
+/Length 2402      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�8~ׯ�����x���U�\��$�=�T�[ܑH�����o� DR��8J͔$�@����5 ��y�{=�����U�<�DD#���؋�@a�-��>g4�|��Ǣ�,����_�|}��M^^O�L��
1B'�|=��{
x�����UZ{�2�\yW��N��#����j&HO3B!F��2 �_�r^�E0�4�����,��W�|^gE^i
����U�[�I�8K<��(���4��U�+��>?��x�!�����U�ڪ�f�L�A4��'
�9�Sۗ�԰Q��
@ydc�{	l,�jc���SoJ8�B�����!�r�>�v^`KB|�ٳ��ɂO%�/o� 
+�_Kz_̞k#�Y^W=1��X�٪�e��ٽl�}������>+�m�2���E�8l�Jֳ"���5���1�\���J�{ۡ��i	l��|˜��Ms$ҌqڍuǔD  ��qHl�\Ip�V�^Z�l
+�.�i�{;b��⳷[;���g���W��J�O��MQ�k;_��;W�l��L�NG8|��wy2��!�y��d�-M�?y֚�0"̩�(ͨnV3GN���(��
��|e�ٽZ�z�Cm�A��w���.��>0!U433�͒�R$!'l߲�
�p���̪���zB�6
+�<
(�9
+��Z~c"��:@.a�s8=XH#�w�cj���,�Z���:����#�C
{,=��30�!@��_dk�W
+�ꇍ
"����e5�6�\�`�X�SM��#�$H�֜��QX
+|L˪�md���6�;��E1-�+��;��]�/[���:��Ͷ�ͫ��C�w��i�)�U �
�I�tm���-��`�j,�@y!}\y�ހ�eޠ�fk�ڂp�Z�e�,�+�u���
��\\

�S2�Q��jSYvPL���*t��=�ht88C,r
�� �@o�C}=1�`7��H�U
��*�fY5�Q�$����q�
�ߴ��U�1���t���_�{O0���\m�e�mF��-������t��b�x�p�{zG(�]؁iM��l,��]g�~h�ޭL�
�R][��CmF���Һ̾
e��P��C�8e"F8�����pC"���ƈ��iދ�G�z��Pgyu�1<��:�w�k�Z�|Y �VRYÄ�j|�#B�?aT��?X��� ��C�n������yT��1�h���:�E#�II3ѤIā��h^1 �aȏ ���q0�bΎ䓠d8�
�6��E1����p�2�
<e>
��*F�����x]���9c��շ���s����8��T�i�-�j�a_��U��¨��m��(#;�#
��(C
+�'ȔC�

S*�]��9Ĩl�ܬ �.�u��i��։��8�>mx
<?��h����G�>
C�x����=bw �	�f�u��x�7�QZ�j�'��,3W�|��"D,vUb���Q�K~�=�p� �<$�INH�gE�Ŀw�PUNu�
�¬u�-�\�x����o�,��% ����g1�R�F.�N
�
�C���u���/d5/��
W�_O���udM/7�� �\i� �����w
��v�5̽aFܵ��'��|�:��[=s;�<~Q̷���{6cU��zP��N���H(��
m�8:tyD�H��>ڿ("E�eZ���
+���@\<,�
P2�49�
+�C�vTx�ݔ)X4�..��
hғ�
r=���U��뮚$�F�$+
��M��
�
�0c%�I�f�A
F�n�E��<:�ʱ9N��4$c��Nyi\ ��My�\���v{�~�_
� -I���5�9i
M�\�}ln�z(�t�/��b��c���1��s 2l��`���Miok?�D��P5twAp�6m�!ݭ�br7k�� w� ў%\/�Q7'����"�U�o�̫Կ-��yeʱ#oՂ�vU7R�C2��?�������ϯ��/�oy1 ����
����������
&��sͰ���,�b*�iw-�S��z>t�~
+�`1
��E��5B�8��,�i9{�m�������:u6T4b��(�c�!P���A �Q
W�C�1�iIa���� 	;�Ю&��
+�1�E��'� j�����%�c�Qt��9��
+�wge�K6�l>��_5
�� ���^ �J�πM(6g�`�2ȢOZZ�{ hs>1T�Y�8s]����@R��{�)�:����~��~�nn]ۍy���s�8p��o��G|�U-n��b�{(��6B�(D\L
N�7�����
7���6�T�F���5@-:��@	n�;8�k}�/�9����5�^ l'n
+�;�:�`G��U6A�E-�Y�^^�5_~�d�7�������
$�H48[�|D�%*DP ���+w�`t��vEK�X5�.
�u��8?���A#t���z?�v�u����ʺ(eӽ�õF�=�H�wL
+endstream
+endobj
+13498 0 obj <<
+/Type /Page
+/Contents 13499 0 R
+/Resources 13497 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13456 0 R
+/Annots [ 13465 0 R 13466 0 R 13467 0 R 13468 0 R 13469 0 R 13470 0 R 13471 0 R 13472 0 R 13473 0 R 13474 0 R 13475 0 R 13476 0 R 13477 0 R 13478 0 R 13506 0 R 13479 0 R 13480 0 R 13481 0 R 13482 0 R 13483 0 R 13484 0 R 13485 0 R 13486 0 R 13487 0 R 13488 0 R 13489 0 R 13490 0 R 13491 0 R 13492 0 R 13493 0 R 13494 0 R 13495 0 R 13496 0 R ]
+>> endobj
+13465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.579 195.613 696.483]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a7ef6a6a1d69f65fd28e518f0de795ffa) >>
+>> endobj
+13466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.95 685.579 304.653 696.483]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+13467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 658.256 195.613 669.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a02d378f2284277bd0cf98f4f5e9daa37) >>
+>> endobj
+13468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.95 658.256 304.653 669.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+13469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.218 658.256 386.755 669.16]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints) >>
+>> endobj
+13470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 631.308 205.107 641.838]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4f54448c4e6823e33a0f5121e5d27d4c) >>
+>> endobj
+13471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.445 631.308 287.577 641.838]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.529 616.6 259.424 626.505]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 603.612 234.079 614.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac3cf88993e63370f39ad5ea8915ba2af) >>
+>> endobj
+13474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.416 603.612 316.549 614.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.222 576.29 223.528 587.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) >>
+>> endobj
+13476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.67 576.29 304.803 587.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.689 576.29 395.332 587.194]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.267 576.29 513.996 587.194]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 564.334 138.04 575.238]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.916 564.334 349.58 575.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
+>> endobj
+13480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.115 564.334 475.891 575.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.798 538.045 365.997 547.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1) >>
+>> endobj
+13482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 525.057 199.558 535.961]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a727cd68e90dd481583b6a2bd5fdfb492) >>
+>> endobj
+13483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 497.735 199.558 508.639]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c2621d99e009a3c99558671ab046b9b) >>
+>> endobj
+13484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.815 470.412 207.648 481.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.423 470.412 237.297 481.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) >>
+>> endobj
+13486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.438 470.412 318.571 481.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.645 458.457 267.421 469.361]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.423 458.457 375.066 469.361]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.798 444.123 328.634 454.028]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) >>
+>> endobj
+13490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.597 431.135 187.488 442.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a68753415da58ce7afaf72efc835a65be) >>
+>> endobj
+13491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.986 431.135 257.629 442.039]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.631 431.135 343.407 442.039]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 419.18 179.554 430.084]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.985 391.858 203.712 402.761]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) >>
+>> endobj
+13495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 379.902 179.554 390.806]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13496 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13500 0 obj <<
+/D [13498 0 R /XYZ 89 770.89 null]
+>> endobj
+13501 0 obj <<
+/D [13498 0 R /XYZ 90 704.286 null]
+>> endobj
+13502 0 obj <<
+/D [13498 0 R /XYZ 90 704.286 null]
+>> endobj
+13503 0 obj <<
+/D [13498 0 R /XYZ 90 647.907 null]
+>> endobj
+13504 0 obj <<
+/D [13498 0 R /XYZ 90 620.585 null]
+>> endobj
+13505 0 obj <<
+/D [13498 0 R /XYZ 90 593.263 null]
+>> endobj
+13507 0 obj <<
+/D [13498 0 R /XYZ 90 514.708 null]
+>> endobj
+13508 0 obj <<
+/D [13498 0 R /XYZ 90 487.386 null]
+>> endobj
+13509 0 obj <<
+/D [13498 0 R /XYZ 90 408.831 null]
+>> endobj
+13510 0 obj <<
+/D [13498 0 R /XYZ 90 329.637 null]
+>> endobj
+13511 0 obj <<
+/D [13498 0 R /XYZ 90 329.637 null]
+>> endobj
+13512 0 obj <<
+/D [13498 0 R /XYZ 90 271.294 null]
+>> endobj
+13513 0 obj <<
+/D [13498 0 R /XYZ 90 248.917 null]
+>> endobj
+13514 0 obj <<
+/D [13498 0 R /XYZ 90 248.917 null]
+>> endobj
+13515 0 obj <<
+/D [13498 0 R /XYZ 90 151.366 null]
+>> endobj
+13342 0 obj <<
+/D [13498 0 R /XYZ 90 128.989 null]
+>> endobj
+13516 0 obj <<
+/D [13498 0 R /XYZ 90 128.989 null]
+>> endobj
+13497 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R /F111 1509 0 R /F68 3017 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+13525 0 obj <<
+/Length 2825      
+/Filter /FlateDecode
+>>
+stream
+x��Z�o�����@�Vb.�Ӣ@��.�zW���~�]��8Be�+��n���E[~l�k�O�(j8
��7C��|�Go����z�W�FiI���q��Hq������CB0R�xB0����$�����,�>�Y����?TY�����������I5&ib���˙O��ɟ�l���w����)|%D2�p�Ɵ�~��������xf00�.�>|£t�8ˆ�t��-F�2x��W����uI��.B!~YwO���ԛjif��ȗ&�|ی�H��*�^����-����/�
'�^
�vd���ʇ�,�KVe
S�*�<
�SqOV��G��4ϊ��L�4���M�x
�Ԥ��	FZ�@��~��W<i��	I�1��gD���h��n�T����J�����u)"��HJ��8�S0� -D�Zi�8�
)葊 ƹ��3���!aI��B>"�&R"MU�G��R��
+Ї<����O��)�u���S�Ud�FǗ$�D�%
� )D:�V��b��x��Za�Ơ�!������Ԭjp$'��
;�(8�c�;�~�L���m
S��BPV�C����R��u(�~��"Ш����0*D!	J��f]�nn�Gϊ|v��T2�,̲>��s�b6�:a5�>tw��qD�:���!P��g�λ�����b��J���. ���ȩs�8re{đ��
c�� r�
�ec�$_N��*�s�b�J^��ɏ��)y
����a���^�>�D���5�Y%a�r����d]N���dHB��G�,6uŗ�J�}�
��WR#.�IQx �������X��7e1y��
6t
B!|X�q	���
����*�
��ق�2�����,�}(IT�(�h���(�` �n9�牤\��
�-
��<*�g�����
��j�J��a�x�&
��p��>
+8`<��}�lof�"8
bf:���g�����f5�j�3;x�� ��bЌf_��{-��
O�s$S�5tR�c̳��e�"$R)�d����k
��F<��k=t��X���Cfnš�
C��ۆVڅ1oZ�V��Ǩ�*�B(��ؾM��lD���XZ��Y!��2s�p�Y�ְ�v�|�3i
+`n�IS	 TƓ��гa��$�6�n�PiЭ����i� ՠuf�)
+�;QlB$d��7B������7&��&��hz�J���
+�k,�f�St���1��~��T��9* J[�5�'���{���|}�Q�h��@%me#[���^�qo6q�'�9)_lq~Խ����
xD�-��G�Y6_���������д!�Ӡ�E���2���`�K�R�%�	6}��d��۵������
�����q� ��.w��]��K�z���^e�0�]���)G]G�)/��)��*�^'��%9h���O"Wn��\�>p�p�1	�Q_
+\9d]��­�t(����rpl%f
���et8�Z��0�E�
 pwbZ�v�fi�~�j!�
�
�Ә����@�G,�0�]���1�H��+Ӈmʬd�/g��~�Cz�A
+����?ǚ6����{S�@"�*��� v��M��xY_�P ������ʿ��k���H߂�w�5��~��yz
�ǔ�� h�����dmw�
��X�Q}��>��.������Af.J��
0�����D�Kp�W���VC(�q�U�P��q���	�	�4�<��.��
��Ϧ�K@�RDi�>�Z�a���������#u�Yo�EY���9p�Y{p�
+k���qnBi����m�q�/���N�����K_�M;F}K�A�I���ăAz+ِ���]���D|��1Yz���LvB�ɗsr�˘�M)"f�m
G�!X�'�>�����!��Ǫ\�
���rk#M]x
�jv|~���
P�C��
M��uD�����ޣ!0������qc�'��"����˕�oy�
�kc�+�.�4�4������}��-J]�K��b3�
�t�:���>�/��!L�+�3O'Ld�	���Б�16�:����T�|�x�F
�b�p�2�
��3
��+�aԗ�a�c�E��;��X�e��[D�
��u��'g
����c��i
%y����j�
��3۱-\\Cε�
��]���`
�{ݴ]V7-��l��ۙ��F�{�@�[x�
�\KQJ6�-
N��d�B�al�'P��6����4�4:�������1��x�5��Y_g���U[�i7S
+V��
+0�{%h��Ȗ��pW�t'ج��P��V���1C7w
�lbٽ[WWٯg��a5�L
����
C�
�c��#��nz|e�'-�2��M��T{��s�m�
+�}�=8b
�
��3�`C�f>o��rS��^.��g�_���J"ɐ*�j��im��
��ҟ�Swk�#�V�ᦎ5��e�w�x7=�M�ڌ�,
+����eclan�B��A�� �WN|�T��(�Ϫ@OOa{�*~�h8%�T�B���
҇��B���
��n	�V��ʸ
6�Y-W‘j��s��8Ex(�%��]Ψ�K{�/a@�F
܍�H*�S���"�� �I�>�q�i{�
����X%�rW܏��m?Kqb���ަ��ZpB�;v�O ��k �)��0
�J������S�����wD
RV�����
�խp�2ؿЊԉ���;��7Ja.ɛ�6�H��8��۟|㗵�~g��?�s��d�X�C���^|U���}��ޛf=��5��]9m�!
+�3m��T׫�7o
6�Y�Ѵ\�+Dg-��o�;e��7��8��]o���Ii�@?�K�D)�Ft��c�c�x�Â��R�����?�T`�
+endstream
+endobj
+13524 0 obj <<
+/Type /Page
+/Contents 13525 0 R
+/Resources 13523 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13456 0 R
+/Annots [ 13519 0 R 13522 0 R ]
+>> endobj
+13519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.298 614.502 471.431 627.02]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13522 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13526 0 obj <<
+/D [13524 0 R /XYZ 89 770.89 null]
+>> endobj
+13527 0 obj <<
+/D [13524 0 R /XYZ 90 692.066 null]
+>> endobj
+13528 0 obj <<
+/D [13524 0 R /XYZ 90 638.377 null]
+>> endobj
+13517 0 obj <<
+/D [13524 0 R /XYZ 90 591.752 null]
+>> endobj
+13529 0 obj <<
+/D [13524 0 R /XYZ 90 587.269 null]
+>> endobj
+13530 0 obj <<
+/D [13524 0 R /XYZ 90 516.538 null]
+>> endobj
+13518 0 obj <<
+/D [13524 0 R /XYZ 90 457.958 null]
+>> endobj
+13531 0 obj <<
+/D [13524 0 R /XYZ 90 453.475 null]
+>> endobj
+13532 0 obj <<
+/D [13524 0 R /XYZ 90 370.788 null]
+>> endobj
+1967 0 obj <<
+/D [13524 0 R /XYZ 90 161.165 null]
+>> endobj
+446 0 obj <<
+/D [13524 0 R /XYZ 90 141.59 null]
+>> endobj
+13523 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13556 0 obj <<
+/Length 1351      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6}�W�f*  ^4mg�8�8G��';��)X������w^DҴD�V��-��
�����ƻ����[�.r-�2淆�
���[�4�������{�Z"��t��ϗ�7��z7x3����
pd;���bc	��
���zPh0��o`�p�
�|!��y����D�����x���*a�p'yc:"|(�P,�q����D,>�7�H����b���(&R..㥜�JڿY1mD838u�����~��Kl��!��~Y�,:�.B��<��wAcdr�T?��r�qm5��K��0�9)�HS�vFԂ�X�Q��&ra
=��4yc�q5�=e�x��KV��_����I�_clz�"��L��
�0��,��g,fB�
Fs��s~�"�
��	
�y��_L�F�̏��,Q{(e�r����
�С�Cڑ��fd�s�3���3ܮ_
�
�.�mB��L��p���̳����d,���/Op�v
+b�n�A�d��:E��K���‹���H�����
�-

+ d�|���
Q ^����ۣt�8��_�,p��h��>��F&y��&�Џ�"ݯ�o~�m�ۋ��-�%�5���b�$���Dc#fWӼ �d�a��5��HΞ�dy�W�6-��!G[;��m�(m�d
�Q&
�dq��r���Dl��/�D&��C�m]X�S[����#p�7Gj���]���4��J	�!�b���dq�

+gy�"ZdS
�6مCqt�X�7�1���&�� s
�H��s�f�Fo���!x�CI��
��M
�p>8�����R�
Z�_m���YV<���$�B�q���T�l�VQ;�D���$dT{y(���$�D6�ǩ�F���pVd
��BTA|��
+E���l�*�����S/
�Dc#ӴO�ѕ!F�0�'�q��
n
~*չ~@[Ą���{EOi�K�O�I�!J��KkY�xi��X��TZr��ցm���^�!��,f1ۦ�
��i�
������3�<ݺ+��4w�̧:.�57u�v��>Ƈq�ѪC&&&�!�{'c
�1�_����4���>t���4�"���ƍ��ʏ�'��fP{����V�]i ��;8)RP�w���
E�#�@�Cy��w���UZxr
���GE��e�P]
+88�1�^�����E���Rȶ����&�[��M����NY��������O�C�rhU�{���$\�"[
1�,Հ�K��ӏy�T&�F����O"�r-�T^QKv�3Ad�HG1�Fc
+h�d)�ܷ�+�?��9��dcĜ�s�e�����f��h��8|���d����bnU�
+�D�eMu�*M}D�?h)�S
+endstream
+endobj
+13555 0 obj <<
+/Type /Page
+/Contents 13556 0 R
+/Resources 13554 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13456 0 R
+/Group 13521 0 R
+/Annots [ 13533 0 R 13534 0 R 13535 0 R 13536 0 R 13537 0 R 13538 0 R 13539 0 R 13540 0 R 13541 0 R 13542 0 R 13543 0 R 13544 0 R 13545 0 R 13546 0 R 13547 0 R 13548 0 R 13549 0 R 13550 0 R 13553 0 R ]
+>> endobj
+13520 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1PIP__Tree__Node__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 13568 0 R
+/BBox [0 0 380 170]
+/Group 13521 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 13569 0 R>>
+>>
+/Length 557
+/Filter /FlateDecode
+>>
+stream
+x�ݔ�j1��z�y�Uf4���C)zh��C������
���k�]��$�SX�I3��O�i4��'�B])��@_����#]��
�����m�n��nn�-���B 
�D-�ԇ���
}3��ʰM���S�My���g�	֐Š ��B�Z�9Y!����[JI!�S��g*LÓ��v�!,
[s{����T��;﫢�j���G�WY:�i!A�4��΅:S��z2�z�,�}����1�C�8�&r7��9 �@�X_W=
�}e[�㎔��pt?��"	�8
�1`��������1�5����
���:F<zVQ
!�V�����%�u�$���-�ӋtWa�����SM-1	�	�<�-�)�i��_ �3Q2k����y���*�Y�Z�u1��R�f�dU1,�{@���d3^,a��������� �쀛"��
�*�6�����&	cUV@ϼV��
L�iO�!>+�g�G������ �b���/�zj�eic6��Ei���|>�z�AVR��<U���yD���1���
Q�g;�
�'o����A��4�O�V����
+endstream
+endobj
+13568 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+13569 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /WBOIUP+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 13570 0 R]
+/ToUnicode 13571 0 R
+>>
+endobj
+13570 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /WBOIUP+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 13572 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 278 611 722 722 500 500 556 667 556 278]]
+>>
+endobj
+13571 0 obj
+<<
+/Length 13573 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0��<�
�C&�4B��
����`�%E*�2����x�T�%�>����uzi�3,���I��P?�x�nN1u|
L"r҃Z"���MRon�y�1��T�^����IO
?$D��9�n0W�}]Zl�7kxd�P��5i�}�i_�Ȕ��^�u�m��e�

IM�g+;i��T�_5U�_u�F�����W�҅r�˳���@y�� 
�rPM�J�z�Z�H�
��
:C{IP	�@H*b
-vaP<Y� �
>T��=�
B�"j1��|�H1_�!_���p��Al��>eus�8<�0�m����볓�\���C�u
+endstream
+endobj
+13572 0 obj
+<<
+/Type /FontDescriptor
+/FontName /WBOIUP+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 13574 0 R
+>>
+endobj
+13573 0 obj
+331
+endobj
+13574 0 obj
+<<
+/Length 13575 0 R
+/Filter /FlateDecode
+/Length1 2328
+>>
+stream
+x�UV{lZ�?���`(\(��`l� \
�_1���
M��#��Y�:]�t��TM�Ej�%M��N��LZ�G�G5i�?��J��u��vR�lM6���M�*_��;鐾s�w����}�
B	!��0��N.��9��vO�X8;{��G!��!D����ə��%��
��l(~Ĕ��%ՙ��U�Y�S���3
Kӓ��|������2��x���6ӄ��Md��Z��n�Z�L%��Y�e��Ss��Bnrs�+&�B�J�ڴ�A�{�^������;�a�0��FC[L6�"�b�K
��a����]fde��x	��y����yO�Sڬ�q�y;
+
��z
6��@��S�Lo*ߟ�i(*�������xQI���������6E2�6
�k�ӕ�v
�ײCEvg,�ctT�4��r��l68�
n�׽u*��!Q�@HC>�ì�
���{�4�J�b�!g	G�c}'��L�d+/Ùn�_�� �]iq0��%ǿ��Y���z�ao�@�o����k�K�WG{���'�8(��7Õܽ\�u�Σ.D�Y|�k��u��Hy��ݥ����s���J���y
T��vnqym}�;��
����}e�nƲ��f�&E]����*՟���ՔXr�����~�TD���F�OT��x
����ډ*S��\Y����
���X�U˓L-dH>O�oХ��0/�v/W��Pmg<��G����t>�La��?�5�.�����UO*�[
Fx��T
+z��E
��i�+9kKi�9���w�}+&Nx�:h���н���ܑc��]��
�3yp�h>�f��
�YJ��������o����ì~�g
�|�[�
�éT�+��9����i��`ytliqtb	�'���^��[
g���f�V
8;�]F�`������l���I�c�S}07��Ϗ
�@NML"�R�5��l�G5�'�eV��̷F�����I$�G��;��H�~�������r^�X��Q[ɶhW�8#����~3��z�����a�c�XHC�,
����؅�����d�!��"IF㩖m�	��隤l`�-�7YJ�i�uI�F��<��V��E���⫯���ͅ�兛l{K�����.^���B
?N
ck��ݪ�BE����!U��
��y.U�<1�v��h��Z���O���<w��T�/��w
�p�*iއ&�H�	��9��h%�W�i�/9\����_NѴl�ok���3ӷ�7�
�
+k����=���\��6�Ni��Yޞ�+�=��;�����m��Og
�H��p��75�=��n`$��7����|�&���a:�ުe6k�����
i��K7~�����h�N
��w��7X��8��ƛ�4�s=�j��5&mn�s��xj�'Թ;�?�8��X��kST��U�X���m`
�X��	}��)0p;jO��"�`<�뭏��{b(�V<���%�!b
����>���pDWf*��8���I2UX�V��w���R���M2i�*�^"���`��;�M�
F�ˉ��$�$
�l�b��ѹJ��.&%D������h��A7G
�̙H^
Mk�����'K���Jd���~{{����N	.��r�B!ٳ�Q���Q|�թ�����~f�.I��d�Փ:#Y�t���=���S��
k�'�
J`�
���"h�M����!_�Jg�7� dԻ���[a7 |��U��Ŕ��Ac��k9k�&��AxS���}9�
r�S�I�� ��ht�� [...]
+endstream
+endobj
+13575 0 obj
+1775
+endobj
+13521 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+13533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 472.067 218.955 481.995]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+13534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 388.397 207.337 399.301]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+13535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.074 388.397 344.419 399.301]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad2e8f2d9c5b2732df9e001bb155320ca) >>
+>> endobj
+13536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.414 373.577 312.271 383.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) >>
+>> endobj
+13537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 318.031 208.246 328.562]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.216 318.031 239.787 328.562]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aa53032d6032bb4c199a517187c46636e) >>
+>> endobj
+13539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 289.738 215.994 300.268]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ae3905fc4ad45180a029f856c7ca7a2fc) >>
+>> endobj
+13540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 261.444 178.996 271.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac5612e1699099eb4ce49e81b696ae89f) >>
+>> endobj
+13541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.935 233.151 247.638 243.681]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+13542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.608 233.151 302.989 243.681]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44) >>
+>> endobj
+13543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.935 204.857 249.281 215.388]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.251 204.857 305.729 215.388]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a43eb178d5fe05266ba5f76962e836bfe) >>
+>> endobj
+13545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 176.19 215.259 187.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+13546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.999 176.19 271.159 187.094]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a97ccf10304ef9ba8b58549f7570b8cea) >>
+>> endobj
+13547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.076 147.897 385.359 158.801]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) >>
+>> endobj
+13548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.076 119.603 377.758 130.507]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a048588fb0ac55c4315b0ce6cb1ec274b) >>
+>> endobj
+13549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.31 179.554 102.214]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 91.31 264.484 102.214]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a48b522405ad8896775cbe6d2344bba4a) >>
+>> endobj
+13553 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13557 0 obj <<
+/D [13555 0 R /XYZ 89 770.89 null]
+>> endobj
+13558 0 obj <<
+/D [13555 0 R /XYZ 90 490.199 null]
+>> endobj
+13559 0 obj <<
+/D [13555 0 R /XYZ 90 417.547 null]
+>> endobj
+13560 0 obj <<
+/D [13555 0 R /XYZ 90 417.547 null]
+>> endobj
+13561 0 obj <<
+/D [13555 0 R /XYZ 90 336.851 null]
+>> endobj
+13562 0 obj <<
+/D [13555 0 R /XYZ 90 336.851 null]
+>> endobj
+13563 0 obj <<
+/D [13555 0 R /XYZ 90 306.823 null]
+>> endobj
+13564 0 obj <<
+/D [13555 0 R /XYZ 90 280.256 null]
+>> endobj
+13332 0 obj <<
+/D [13555 0 R /XYZ 90 250.236 null]
+>> endobj
+13331 0 obj <<
+/D [13555 0 R /XYZ 90 221.943 null]
+>> endobj
+13565 0 obj <<
+/D [13555 0 R /XYZ 90 165.356 null]
+>> endobj
+13566 0 obj <<
+/D [13555 0 R /XYZ 90 137.062 null]
+>> endobj
+13567 0 obj <<
+/D [13555 0 R /XYZ 90 108.769 null]
+>> endobj
+13554 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F94 771 0 R /F11 621 0 R /F24 537 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im23 13520 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13620 0 obj <<
+/Length 2294      
+/Filter /FlateDecode
+>>
+stream
+x��Z]o�8}ϯ�S�j��DQ
+f�m��̴�l�ݗv �2�h���(5����)ْe[v�`�E�Z��K�s�=���G
[������[n[>�]�Z���-��������8!qo:#����IX$ap;�x�-WObQ���x^�������6��rgRL�7"�G��ex�zJ�/?���<%ĵ�ı����.~���|A`p�"z0
`E���?���ۿYپg=׍ˡ6�.���^`3/�9?ȍ`9�gqB!z��(՝7�Yg
����e�0�Ԉ�G3�u+5���Ӳ��z�	3,���u&�B�����|�/�[�b!��'
퉾e��l~������l\G͆R�:Ԛ��A�V�Ǹ:K������~�f�����nұˑKIӠ|2���� ����:l�e�X4�І\oÐk#Fxc���Ѐ
�bo�]<4$J���4B
��0���>\P���
(�2��`Q%�1P�	�7ЭA��u�= h�x�j[�ܽ��i�T���G
�2�L��a X�C�� ��	�O�
��~`�Y�
�2
{A�@=I����RH�d�(��c��S�(�l u�n@���XhF��Q,���c�3_�qX^GB��uGari(��)_3�y
�
=T)J9�02�Oϒ;f�K��	`����^���
�"N��)c���MT�*�"�C�q�\5����������A3GVQ$�|���'�!��}�rд�hMg����Zv t(�J�ٸ��e
��D$Y�
+d�_��\�bb�[eV������|U
+�+������	��G\�@ڲ�Fd ���լ���k�`�E=	�0��<nj���
���
����b5x\1�~��
�Z�"���:�I��J?���bO<��u���zI{�#ʔ�O��%���oC��K��� �iG�����& ���ޮ��2^�B���Jqd!�,�
+��9t
��xaô&���?��▮G�M˯Y����{�8¸}������vG���\�
�!���(�����%�/�p*��JYơa�8L�3�l:�p���_529�#��<Ȑ�"��B_���HI��e0s(��e��&E��ܑ.6ǎ,�l��|)�
7�>f
Qw@�v��PkC1�R6yNE1V�x��=�5�*�Z������
��>m���7����;��(��P����?V�{��H������շH��Y�ڌ��)��P}nl��e�#��Y�7�8��8r�[��
Zڏ��c"��\g���N�61�g��D�.��R=�E��g�M�	�&����
x>�U�� �8���J�k;#��~��
R��v7�݉�/���(�#P>�=���5��)ο?Δ���d�O��3���w�aq>���԰��z���
+]���>Z.{DS%Uv��UB5?a��x��}�5_g~�
�8�@��/���'���퍈b	�s���S�c�o,pyX�ݛ��T6�1r]vri�嚪?L
�in���P��M��tvl�<1����(�v (J��n�w��`�C���| 
+����d�J�aB�1�VU�K�!����U-F@5�U����<�_���E�����֞�1�ف�y� ^kv����Vl��(���(t��BBt�Tm1Q�[�>Rz0������2N�
"9�2���^��E�������a�u����xR��{O����v���j�nk��-�D�E
5[uI���_MkC���J�jN��P�;����� �w/:�I
SD0?�`AE�m.��R�}�P�c����M-_D(cxO1�4�f���ھЯ�wsXg�oKT�
aƻL��U�I�_k������eo�l�2Jj{�%�j���i��u�:H� aM��1�1��� �����66�#"3�
h�f��Ո�C�W��Ѱ�:�_Z̄��F��/h�aC=�pa�r�����͹�~�I�(��NbM����v7��
�Z��YV/�����$|q�
}��Q�U�'�������}��,
���v7.�p�b�
9$	�Ȧ/��C����;Z�S����d�(��SA	�q
"03p��ѧ�<f�
��I��m���D=��������֟��]��
�
��1fTU�;�eP�Ί0���H�٨v�+D#<�|��oتm����]Z�y*�9��qz
+[�5��;�o
p{�N_�
���D����0m7Udhb�=�E�
�)��!��6��������աO��2Wn��SY��WW��Q��EY��*6��#�[��_(��h���B cE��Ɨ
Ҍ��������������Es��&��78y}��4Pk�
+endstream
+endobj
+13619 0 obj <<
+/Type /Page
+/Contents 13620 0 R
+/Resources 13618 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13456 0 R
+/Annots [ 13551 0 R 13552 0 R 13576 0 R 13577 0 R 13578 0 R 13579 0 R 13580 0 R 13581 0 R 13582 0 R 13583 0 R 13584 0 R 13585 0 R 13586 0 R 13587 0 R 13588 0 R 13589 0 R 13590 0 R 13591 0 R 13592 0 R 13593 0 R 13594 0 R 13595 0 R 13596 0 R 13597 0 R 13598 0 R 13599 0 R 13600 0 R 13601 0 R 13602 0 R 13603 0 R 13635 0 R 13604 0 R 13605 0 R 13606 0 R 13607 0 R 13608 0 R 13609 0 R 13610 0 R 13611 0 R 13612 0 R 13613 0 R 13614 0 R 13615 0 R 13617 0 R ]
+>> endobj
+13551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 707.957 154.727 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9ac8b3ffed6355e1de3f16b194a90a42) >>
+>> endobj
+13552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 679.976 181.845 690.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ade3035e2021726b1d2c0c563d6c1216e) >>
+>> endobj
+13576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 652.369 176.505 662.9]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af46a1a2668f581e1bc158db432912f35) >>
+>> endobj
+13577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 637.332 450.955 647.238]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ade3035e2021726b1d2c0c563d6c1216e) >>
+>> endobj
+13578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 613.056 220.22 623.96]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.719 613.056 317.355 623.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a8cd66485ef35802c6c117eab5f641d08) >>
+>> endobj
+13580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 585.075 220.22 595.979]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.719 585.075 331.582 595.979]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af0d04edca3b2e3d30f5d6de7499396b5) >>
+>> endobj
+13582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.43 515.071 241.937 525.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+13583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.674 515.071 339.338 525.975]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
+>> endobj
+13584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 445.441 179.743 455.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd966830899423f741449e6567241cd) >>
+>> endobj
+13585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.08 445.441 262.213 455.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 417.086 179.743 427.99]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a6ff7edd489b1d20b1bca1f4431d802f1) >>
+>> endobj
+13587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.08 417.086 272.913 427.99]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 389.106 192.565 400.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.535 389.106 244.33 400.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af6518b1b7e729018dfc57b6800d904f8) >>
+>> endobj
+13590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.505 374.442 266.4 384.348]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 361.499 205.107 372.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ab57aada46f9e76478cf7db1ca6ec9091) >>
+>> endobj
+13592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.445 361.499 287.577 372.029]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.529 346.462 259.424 356.367]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 333.144 234.079 344.048]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aafa858d51c2ba75d0778692e95c895c7) >>
+>> endobj
+13595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.416 333.144 316.549 344.048]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 305.164 220.779 316.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.749 305.164 255.638 316.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a77459bc72a66ade5bdb58c0ce1aaf020) >>
+>> endobj
+13598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 277.183 176.854 288.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a454c2aefff18b334bc3e37c1f6e2fb77) >>
+>> endobj
+13599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.191 277.183 287.538 288.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.222 249.202 223.528 260.106]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1) >>
+>> endobj
+13601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.67 249.202 304.803 260.106]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.689 249.202 395.332 260.106]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.267 249.202 513.996 260.106]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 237.247 138.04 248.151]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.916 237.247 349.58 248.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) >>
+>> endobj
+13605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.115 237.247 475.891 248.151]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.815 197.311 207.648 208.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.423 197.311 237.297 208.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) >>
+>> endobj
+13608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.438 197.311 318.571 208.215]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.645 185.356 267.421 196.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.423 185.356 375.066 196.26]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 157.375 194.567 168.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a2d4cc0630c7f91e7e490a1322c53e5c0) >>
+>> endobj
+13612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.814 157.375 350.59 168.279]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 129.395 190.503 140.299]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a1c4c199e8c2b7038c2cc7769d20d53c9) >>
+>> endobj
+13614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.985 101.414 203.712 112.318]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a850e5f1b5da521aff7ff926c0b54aa7a) >>
+>> endobj
+13615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 89.459 179.554 100.363]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13617 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13621 0 obj <<
+/D [13619 0 R /XYZ 89 770.89 null]
+>> endobj
+13622 0 obj <<
+/D [13619 0 R /XYZ 90 698.973 null]
+>> endobj
+13623 0 obj <<
+/D [13619 0 R /XYZ 90 669.298 null]
+>> endobj
+13624 0 obj <<
+/D [13619 0 R /XYZ 90 630.358 null]
+>> endobj
+13625 0 obj <<
+/D [13619 0 R /XYZ 90 602.378 null]
+>> endobj
+13626 0 obj <<
+/D [13619 0 R /XYZ 90 532.11 null]
+>> endobj
+13175 0 obj <<
+/D [13619 0 R /XYZ 90 532.11 null]
+>> endobj
+13627 0 obj <<
+/D [13619 0 R /XYZ 90 464.104 null]
+>> endobj
+13628 0 obj <<
+/D [13619 0 R /XYZ 90 464.104 null]
+>> endobj
+13629 0 obj <<
+/D [13619 0 R /XYZ 90 434.389 null]
+>> endobj
+13630 0 obj <<
+/D [13619 0 R /XYZ 90 406.408 null]
+>> endobj
+13631 0 obj <<
+/D [13619 0 R /XYZ 90 378.427 null]
+>> endobj
+13632 0 obj <<
+/D [13619 0 R /XYZ 90 350.447 null]
+>> endobj
+13633 0 obj <<
+/D [13619 0 R /XYZ 90 322.466 null]
+>> endobj
+13634 0 obj <<
+/D [13619 0 R /XYZ 90 294.485 null]
+>> endobj
+13636 0 obj <<
+/D [13619 0 R /XYZ 90 174.678 null]
+>> endobj
+13637 0 obj <<
+/D [13619 0 R /XYZ 90 146.697 null]
+>> endobj
+13618 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F91 766 0 R /F11 621 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13658 0 obj <<
+/Length 2024      
+/Filter /FlateDecode
+>>
+stream
+x��Y[s۸~ׯ�SJ�T0 �x3�I�u��uc�)�h(
+��P�BRk{}nIъ�뗎
D���� ��y���쟋��U
z)J#y�[/�^�R�#���>�,��ϋ��0JI#X�����~���ōz7�~1�:#�
+{��(N�|;��{k���(L�^O�z���]z7�ϰ�#�գ����d�!���M��E
�)M��: ܗ��[�6C���J���j_�m!�Fk��g�/�"�ۆD���7�
10B���R>X�}�s�������{@�/����\Q�Y�|�+Ԭ�Z��]f�z����
KUs>a��v}y)�������=�"ڠ'ˎ�`�
�7Y��^\Q�3��)��2�O�f��|�҄�9�?(C�p[ʼ�EL��ӈ"
��

H���h��N�om0̯}�O�aǴc��������<�uƾ
�3��"FA
�(���o%ey:v���`��(��q�oD������u�`�K� � �b�
�z"* L݌2�ܿ�E	�Q�<!���Usv(I�Q�a(߂�*ſ4]�ڍ
j�%a+Ԥ��[���va>]0�V�Pu��^u=
��S��в���!G^��+&ځ��t���:��q��4
���z�B��e0	l��%ʭ���]nF�-�0�̡���O%�\�YQ��+++[�U߰
%=;B
݉��c��~K
�_+����N�V록�(�]�l� n�ns�#؝y�#�-�L ۛ<�R��V�8���9Y6А�׵��ݎ
+w 7	x��1�L�
i���-3�Z�z9i�SIS�8�9�P�� ..w!�]�as� Gv�)r�_������ïv�_%���w�E��N�E��|�483B8JB����j�q�1�1�"������i�A?1�2�W-E	I��ϰ��pǏt܎
z3?H�ݶڗ����i�R
��{���C��%V�u�
���
#i�hN�Sl2�TҽUIWC�m�7�M;��h�5�J��
z��p�2Ϭ��� STn@�e�Q.�zT����IG���B�]^d��ZoYU�7��^T�8�uY_��	i���	/:�~4л������{"��N�hBs �)�j
��Qf
N��F!��R�\�=������*�N}�ڵ#��(�;�4�A
p6B	c�b�G��}\��ZYOO
"������)��EI�N
5e3����Er��`�Wg�4A���z�m�����+橲	�aY�>0�{a#������>��cQM5d��U��I�sH
��`l��@���@� [...]
9#�� 85�&�ݩz�&!�
J"Q
��
+lB�}��E��U�ا������0����K�6CE�ՏvT��j���.�e at o��
I�f���!��h�,��U-��YU�{0k<T	���jQ�fh�D3j
kQ����Q����>����	ہst����fI�k��ߓ�W>�n(k�c4�3���h<O�Rd
+W�O�zNe9���5u#h�L��-�YvTf�=�hb�w��u�ѝ��:���$�� ��]݀�a�_�An��KWsMK	#(�'�^����������I
<�D��shR_�!��F��	B8=�8y	B �$��*�R�j�����Tu~���3b�8L�
+,�H����I�B@���9a8�YU��e�@�|P�
�SN|
�z���|�<<F4Mm��U���ʢ�O�`��n(�����:��i
+~L��^�+�Z�ewo3������i`����pnbR2 j�0(%c�S� ;(�u���"��`��̀S"���P֌^ɺ�+L�f
+D�:�:��̪��y �H�Z�Cܪ��`
�?�F��X���t'���nBv�]
TPXW*�P�=���Q���i�PD������[�b�S]B_��b�{���K��\��
�w�
��A�� PW�E��E
1��v��Tt}��y�O#�������eU
 ���EA�qITU"�Po��E�ۗN��g:�{:�����mӶ�ˋ�����
����X{�
pf�;F�A�V�
G����� �r���
+endstream
+endobj
+13657 0 obj <<
+/Type /Page
+/Contents 13658 0 R
+/Resources 13656 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13456 0 R
+/Annots [ 13616 0 R 13640 0 R 13641 0 R 13642 0 R 13643 0 R 13644 0 R 13645 0 R 13646 0 R 13647 0 R 13648 0 R 13649 0 R 13650 0 R 13651 0 R 13652 0 R 13653 0 R 13654 0 R 13655 0 R ]
+>> endobj
+13616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 683.479 227.503 694.383]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9579b18f0878bf26e817c7215ceb4aa3) >>
+>> endobj
+13640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 653.083 240.982 663.987]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd1af04908aea1d1e5deda23b627a24) >>
+>> endobj
+13641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 622.687 240.982 633.591]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3b556a97f08c7fc9cbf0e4e9e7b6d901) >>
+>> endobj
+13642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 547.983 192.565 557.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.535 547.983 232.156 557.911]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) >>
+>> endobj
+13644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.364 531.136 237.259 541.041]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 516.611 220.779 527.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.749 516.611 260.619 527.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a675704312a01f43f3f2d23f1f24c50c2) >>
+>> endobj
+13647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 486.215 191.737 497.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+13648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.236 486.215 242.377 497.118]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9957fb5cc207114f8401d86fd66c7fba) >>
+>> endobj
+13649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 455.818 240.255 466.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad2e8f2d9c5b2732df9e001bb155320ca) >>
+>> endobj
+13650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.753 455.818 324.637 466.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a4a60232026ce7d82ef5a4cee5e482fa9) >>
+>> endobj
+13651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 352.86 226.034 363.763]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad0f4f20d94ed76c2a147a571e3f44e6c) >>
+>> endobj
+13652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.157 352.86 391.99 363.763]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Tree__Node) >>
+>> endobj
+13653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 221.038 197.257 231.225]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node) >>
+>> endobj
+13654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 198.612 195.613 208.799]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node) >>
+>> endobj
+13655 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13659 0 obj <<
+/D [13657 0 R /XYZ 89 770.89 null]
+>> endobj
+13660 0 obj <<
+/D [13657 0 R /XYZ 90 703.639 null]
+>> endobj
+13661 0 obj <<
+/D [13657 0 R /XYZ 90 703.639 null]
+>> endobj
+13662 0 obj <<
+/D [13657 0 R /XYZ 90 641.197 null]
+>> endobj
+13663 0 obj <<
+/D [13657 0 R /XYZ 90 567.251 null]
+>> endobj
+13664 0 obj <<
+/D [13657 0 R /XYZ 90 567.251 null]
+>> endobj
+13665 0 obj <<
+/D [13657 0 R /XYZ 90 535.121 null]
+>> endobj
+13666 0 obj <<
+/D [13657 0 R /XYZ 90 504.725 null]
+>> endobj
+13667 0 obj <<
+/D [13657 0 R /XYZ 90 474.328 null]
+>> endobj
+13668 0 obj <<
+/D [13657 0 R /XYZ 90 400.382 null]
+>> endobj
+13669 0 obj <<
+/D [13657 0 R /XYZ 90 320.601 null]
+>> endobj
+13670 0 obj <<
+/D [13657 0 R /XYZ 90 182.225 null]
+>> endobj
+13341 0 obj <<
+/D [13657 0 R /XYZ 90 158.569 null]
+>> endobj
+13671 0 obj <<
+/D [13657 0 R /XYZ 90 158.569 null]
+>> endobj
+13638 0 obj <<
+/D [13657 0 R /XYZ 265.271 77.486 null]
+>> endobj
+13656 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R /F111 1509 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13683 0 obj <<
+/Length 3127      
+/Filter /FlateDecode
+>>
+stream
+x��[�r#�}�W�)!�VX�1�JR��Vv씼�$�-ֈ
I�
�����9�
$(͒�+y҈6����� 
=��蛫��]��ڈQJR����a�ґ�)Q��Gƌ�L��t|;at�m���v��\<?��M6����d�盛�oo�w#Ǜ	K�y>�[9�'�\���l�u����
X��1-�X
+3�x���WwW?_1(GG�)���h��������%"MF�T��#��.F�~����(��>�?�*Sv�J�c�ENx��O.�e1��<���]���
_c��
+4}IMN�$m=V�%�'1�^�X�\L;Sk�9%�214�\�DjO����d�7���<����,���h5��y`����1q*	eܛ�B��f�)V;�QE'�R��v7��)��M�-ݻ�Y��~͠|oG� Rs�[	ܾq��]��ؽz��+$�T�4�����-`D��JC�R��Xs�f�j[��
��_k��޵H�܌0�0jj�Z�G�\��gD�fp#<�	�6vO����m��6e�����' 䘳]=$P��Y��&8)k���O90�5�fO`+A7��
�2�Y����;����ߺ��ݡ��*%	6�E7�I�QvB����t��!�{A*�g"U�@�;��=gJV�W+F�H{�:m*�9>�P
0Lk��HxZ�5.���~瞝� /+��&�O�'DJ%b"$�D��O�8�+d{�$�s�C`r�*a��Uia�-����I���9�g�+��0̜���
�H1��{��i�I"|2'2W��0=��L+T����
�֦
�� [...]
�D����Q�M���~=�v�ɍ$B�(�C��;��'f�ȳ�C`�,
�(�AV$A	k^bӬ�*�*��2���M7>�N�����9�j�X�	��R�ҬjмX�-
�t���C�u
+#�\+�05�h�x
1�q
#+���Lc��r���O�Ib�5m��,�? �&Ҽ	 �H��
3�l	4�T�kKp[�������[,ł-ƒr"�=����W�b�x<����1��)�{X
�M�L#�E�{�6�8u���DP����<}����J������Sk�.G��/ uDj
O��oz!��*Sv��[z8��b�Y�K�Y��?&)GL,2��-
�
�Ո�<y�&-��]"��,��ń�s8���9
���6��� 1�!7�RPA^������*�!�a�߀�i�
,m��bV,%�8t.)Nj]��
Ė:/ns���bV'�r�p��
iM^�����V=z>���+��
��W���8?UL �I#r����CQF�q��@"�A"i���:$��P�`���aS��v��c=��o�F*t9���V~����7Ν"\���jUZ��V`Y�����{ ԖUL�ŖXAN� �T��tW�z
q��Z�L91�4܋��oL+&tm7d$
~
� #C�y��Apz:��h�_��1ᙹ��F���}���Y}��N�˽�Vs��7�uQh�^Z��|�l��;
W�oWX�5+�f����6k��x5�g�$.�ѕk����
�R��DA���r��%�njm�mZ�ԩ�2n����7G(��gŰr�e�Q�׿�I��������܏�Py=��
��<��Pm[Y���]�d�׳f�+����jX�lH���/O����b�g�g�O
��w\����"r#?��‰�T��:V�
�;D���i�C�NbVУKt�H�q
+H�`�&,���y�D\�K�H�t��bq@��4p�WK���嘶����t�BN�>D�T<"�bKtx�	a&R��!k�܂���6�l�c�a-�
�
+C��V[{��Dž�b���WG&�l���^�iPpC�$&��xlv+�Z�Ig�om�k]�
3,m:��ľ��pS]7	_5�2�U鬺f�g)c�(�X�e��/{ۅ	ҿ��
^�Ʃ_.hz2Գ8.�dKL���Ƿn����S&�MrO1E:�/�F4S"F��e��j_BKb
�$11�拠�H�#h �!p���F��󊠀�T�
+��1H� �#Q��'v��m��d}^������tm��|Rp�A}�D�VB�툮;�8S���1�e�ޢ�=��
j#�S>���O!tK|OV[,���P�m
OT����σ�?϶Ž}X�7%8&�
+����`�z]U
Uh�)����f3�!�m�_
��[�����G��[�J{�	H�V�n�?����9c���%��(Z+��P��ƫ�oC�#h��D
�
���h�	�����H~ԄB��*Q���N���њ�~�Mt׶z�7:_�(�A#� �3N��W���/B���
w�U�B�W�����~�
�g��w�
�\���ܯ��
;����q�U��N_�t^��x����U��q���R��I`~����e����mM륖�:i�P<4x�<�"��������q��^	6:f]b��r
͢�m�*O�9m���&���c]���{
.c^9�-�BK
��R��D�<����妪���gԥl8+�rP�>�>��^�~�}�����YZ�e�6�@&�xI�p�W?	���S�_��
�ml�kGg��On�3C�(v�nX嗹�ǎ��ۢ�i�� ��+\:}���2p�ٳ{xʬ]?U1�}r��u�[��:�
n��m�� ��yd�Ktg9k*M��5>�~}������Cp�>�S��s׫Yw�G
���f'��Dž�U�&������=
�42f�1�D=��i��	�J��-o8g[�
TپP�0�zڴ�[���Pw��Aۛ���u��8dW��({A�������{%�|/&�bKt�S`ܑ��J�f�쏻t/�zg�2e¨�+��S�����T'|��PF��x;w����4*�"
t`�$���6���G&A���W^�^!�U�]�Tu}�Z��~-S{?w��"n5�,1|hr�y~o�����^��Z�j�<�՝����ȸ�Ζ���J��c�+�
�$�����7FN`d[�q�Sۜ9
뷷߻��o�M?T����Y�����2�֛<q���������?����^U�N
f(�]g�i�[߼}{���G2+�Ǖ��ZRBM{�=��r�
_|����
�l��eb�X�[@������e������.���F��`�����0
+endstream
+endobj
+13682 0 obj <<
+/Type /Page
+/Contents 13683 0 R
+/Resources 13681 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13694 0 R
+/Annots [ 13674 0 R 13675 0 R 13676 0 R 13689 0 R 13677 0 R 13678 0 R 13679 0 R 13692 0 R 13680 0 R ]
+>> endobj
+13674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 500.508 239.046 514.456]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.113 397.041 347.542 407.945]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a4d75a1f9b3e618d337fde1b4de9fdac6) >>
+>> endobj
+13676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.331 397.041 513.996 407.945]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) >>
+>> endobj
+13689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 386.062 117.557 395.989]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) >>
+>> endobj
+13677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.914 210.613 239.046 224.561]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Problem) >>
+>> endobj
+13678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.113 91.952 347.542 102.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_afab20885083717c18371349d4c182481) >>
+>> endobj
+13679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.331 91.952 513.996 102.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) >>
+>> endobj
+13692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 80.973 117.557 90.901]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) >>
+>> endobj
+13680 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13684 0 obj <<
+/D [13682 0 R /XYZ 89 770.89 null]
+>> endobj
+13685 0 obj <<
+/D [13682 0 R /XYZ 90 721.073 null]
+>> endobj
+13686 0 obj <<
+/D [13682 0 R /XYZ 90 671.961 null]
+>> endobj
+13176 0 obj <<
+/D [13682 0 R /XYZ 90 624.938 null]
+>> endobj
+13687 0 obj <<
+/D [13682 0 R /XYZ 90 620.454 null]
+>> endobj
+13688 0 obj <<
+/D [13682 0 R /XYZ 90 525.813 null]
+>> endobj
+13177 0 obj <<
+/D [13682 0 R /XYZ 90 387.058 null]
+>> endobj
+13690 0 obj <<
+/D [13682 0 R /XYZ 90 382.575 null]
+>> endobj
+13691 0 obj <<
+/D [13682 0 R /XYZ 90 235.918 null]
+>> endobj
+13639 0 obj <<
+/D [13682 0 R /XYZ 90 81.969 null]
+>> endobj
+13693 0 obj <<
+/D [13682 0 R /XYZ 90 77.486 null]
+>> endobj
+13681 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+13702 0 obj <<
+/Length 2684      
+/Filter /FlateDecode
+>>
+stream
+xڵZYo�H~����,���m,��1�
O�}r��h��H*$������%;�����]�uu
_���6�_O����/�'gob6�HK*g��3�g1�HHxZ̮"�����o3&"Z�,��˿�]�~w���;y}y���+<#N�@������'<[�Ͽ�b����*f�2��fN�>�2�H�-D� B�f�A6�H�O	�8���p'�v��槔������)�.�SR�.T�b�Y�
�C�)�J��wAR�@
�^���՜��a�-�)<F:�GA 0ܓ ��M��yT�p~~��b� � � �� ��\��β]Ō�?1u��8P��Zd���:/�	����膰��
+t�f��?b��<fQ�.�ϫ^%�{���u��5�8R\wAּpc�����׷-�P�X<
Zde;%�q�8��S��p�ӪlZ@)y��Id��Ҷ�;U#	R"Iy��_S���q?⦂��C4R1���Q1��C��;b��'�]R$�I��;w>�F��$��Hg�E^L(U��$;�R�P,h�5o�
��{�R�A
���:)�O�QDI�`��l�n��ԮI�$�7�#ƴ���(^��q,ɉ��-K�dIq4��J�c}
�T#,դ�l{�Fq,���2� 0��,��6+#aH_�명��&��|(�-x1!�#��M
N��k
+�ڳ��7� ��RD���Ѥ�#pT�Y�77"���}�l���/��,y��s�R�  �:�c�+׊Z�)$�!�'/�"d7��p���S+At��2���ڬ6�	%n_'���ֽ4�y�d)
&j��ڄ���D��9�N
�w@*�yoź�=�s" ��DIcĨ
y�~S��(�!P65P� �e��զ]oZw�(:
P��3 ��O)8;��
[����:��0�����ŘB=�M�e�M�Pz7I�jSz7�n�<gp&-ܧ���ݿÆ
++}L�9�D�3"pl��n���G}N�
R���/)��5T�뼹>�gh�g��.�2d')��Z�D<�Zc�?r!� 
�
��ֹ��
p�,)݃)��]�
�l���;�p��ӥ�5gN�W�~ܬ����sB?;1l���,�̜�ph5��
���tѠऒ���y�pu�@m����]�/�g ��jk�C�Ƙ��T�ݤf��~x�$�h~9�Ћ)�e��nsCw��
+�_�]�o
�{R ��O�
7C�2q� >�D�ϕ������
�d ���88��|
{u�
�
��g��
� ��x���g����"�d��MZ�u֬�ra#��d��\���=Ѽ�=�OX&^Ͻ1HҸy)pK��G�wBu�{�_V
_�lt�� 8���?j���	�a����?*q��4*�������xcu���͉�]�y�=�]�����Er}Q�\�ڵ]K��U���|nZf�A�
�8l�d�L-��Ɛ��t>����'

)�ΰ�����tۘk;�
?����5\c��~�@B3+���;�A�<
+�[��L
������D�c(6�eNT�ص�ӪX�[�䫼}��`V/�Q@��C�@��8Zf�	���3}�X�џI[��&��x�#
V<�F�W���\>�d�CGdO��M�f��lz�b��l[W��B���
٩����;ZTA�kk
+ǖ���%��g_��p��+wI+ȿf
���W�vΝ���VҘ�� }D}ڋm�|t�Sl<Թ�e��A�8�ʣ|��͋�wm;
L��͛nĢ����ma�W�ꮪ�vY�G�]y'�m-޸eZ�-��\
U�
���%��6K�
��~n|mpO��{�w���[����z���k�.����]Vfu2���n&�e9��l�}����i����t��ә[8�/�V�A���b��γraDS�\.���l��yx�)S�0xzU���;�h9�*��:P�H_%�/S �'w��Ɛ�}�V�W�ɤ�X�Q��d9!'�M}����WM
+�{����X<��Ȇ�\�c�9��z���TI�#��
��o24�(l���}:���~�YLB!b<�Y�z��Ν1�H]�Z�}�|t�6�C�Z#���
 H�*�T�CT����/���;�]FMWI�e��b
|�w�o��Z�m�ZU&1޻�a� ����u�Cq��aeו�H��⦧��Z.�E�K&��/�1d~�P� <@H	T~�������*�a##���NY��3R�����½�2�2R�Ǹk�NQS8l1v
,�&���eO��K�
+��
��@5��7�6A���/��Pe�x����� ���9���0_*n�[fuV����A!���g�Ї���IV��wl��&
b3���͇���\\�щ���H`�H'
'��y��6�l�3��e�@T���C|n��Ͱ�ꡉt
ٟ���m	40�u�]�ʓ�:)���ᓰ�
+�Yy��ǀ�lk�ak�
�u�P� ��C+
,v~�3#Db��(g�g
+��m[�
�@��v��޾�&�����U�����a�)sj���T>��d;әFJ�&ZA=��~L֡�jpX8�m�OװQ`Q8��4k�ЙW
�i���s!"_��L�M�6T�u��9�ȺΔk�٪�!���a��C�����S
��"˶]����l�Cp"���d�-�r��yQu�7/��b��i���m>
+endstream
+endobj
+13701 0 obj <<
+/Type /Page
+/Contents 13702 0 R
+/Resources 13700 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13694 0 R
+/Group 13698 0 R
+/Annots [ 13695 0 R 13696 0 R 13705 0 R 13699 0 R ]
+>> endobj
+13697 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Pointset__Powerset__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 13709 0 R
+/BBox [0 0 434 130]
+/Group 13698 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 13710 0 R>>
+>>
+/Length 484
+/Filter /FlateDecode
+>>
+stream
+x��U�j
1
��)��H�
C�a!
+=�
�!��fBHz��W���$
�
3�lK�,Y��-o�s���� c~���bOx����]��7~���o����0�q��'�'41N at V����HI�Z�K*���֢
��Ao
+�
�R�
���X
+�n��b���25���g�8vԑ�3
��q�!K�:k30ɘ,m��.�����S�]��Uu�T~���Xo�<����:qf�&�t3��X�<mq8�B:�>���a:yaN��u
����<~?�b#6�"ܺő
h��6u�i�M{�2
�*�i�,Ye����~9L;V�%��#�QP$�Ma	-��t���E;��U��'V'�-y�a�j8[�B�^��sK6���3���r��Zg�ŽjR��Y�M;��+��Ln�ؓ�������\�
TO}�ߵ�ʅ��qʄX�5*Z���L�y�C'�gU\R
�?͸�;��$��;�
+ ��o�
+endstream
+endobj
+13709 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+13710 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /GZIDQG+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 13711 0 R]
+/ToUnicode 13712 0 R
+>>
+endobj
+13711 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /GZIDQG+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 13713 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 556 278 500 722 584 278 667 667 611 584 722]]
+>>
+endobj
+13712 0 obj
+<<
+/Length 13714 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n� ��>��b��3vc�L7.���> �ejR�����
2MJ����\8\�K�ܙqe黛eO+ӣQ����$����Ix��(�H�/'a�ԛ�mYiꌞ��a���m���
�X����\����c��Y�C��eI�2Eڗ{�UL��`>v���
��o��f��9�$gE���0WJ�̏�5ڏ6!����	�A�o��r�gY����@'*�9���@|t��I�#��Agh� �@��@e����*�'Ӂ
+�g��|5jr�
P�W����~
�r�
G�*���ĩ9�Uq�+���W�������o��sysη;<���ã��[���]��
0�r
+endstream
+endobj
+13713 0 obj
+<<
+/Type /FontDescriptor
+/FontName /GZIDQG+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 13715 0 R
+>>
+endobj
+13714 0 obj
+339
+endobj
+13715 0 obj
+<<
+/Length 13716 0 R
+/Filter /FlateDecode
+/Length1 2296
+>>
+stream
+x�UV}l[�?�>�%����~6����clj����G�&i���l'6��Y�|�!�K!e�el��eZ%(
+��:iBeڴ����2M�
+BB�"0����&(Ra,�;�9)����s�=�s� 
+� 0L-L.ÍOO�����Dz'fO~���Gğgf&�?o�ӧ��#�E2$����.�U��յF����%>�]��8J{
3�//L�-�
L&���"�i 6��A�@6:�n�ёfz�g���fu�&�Qқ#�
p �E]FGТ����LJlne��8��Ǖ�k��ט0��\g�K��������2;�@����h��QIt9=�|�Z
+�-،!��)���f,̖V��iQ���Ѧ&Ƌt�&��M�U�=͍{���x�l��)�+/ww(o԰�Eno_���(3���hE�������k'��?A#�ih���i.A������VlM�R}U�^�����c�m�?�OhO%��qP[�|���j�_��s��&��]�\/w���i�M�U�v*�\0�أ\ݞ)�ܭ\���
���Vr�Y��OO���X��@��� �Tɯ�cg�X���B��<hX9yzq�䩥�D�#>8�����g.`ᅾ��.,�M.r[�2��������%'���s
����@�,���07�ل�٨��Yf7�*u�~1|��7�d�{Eky��(��#[&���"��§�k�'���ƃ�I��&ʟٺ�@u_����꥞A��
 n��JD�T&;V���&�
�Sh�%g])�C#��}{�g�LR
C���������٥��:�i
>���Fx~Bq���"5�ª�p��[��}�Oz��
��l6�t,���%
��n��O�| [...]
+?�LRsl�a�7����E
�@�8�zrxͫ%�髚G�{�2k�f���ޤ��b�%	�
z���/���K�.-
O,�m��ߠڪ��_э���˙���;ao�����l��ރ#ɽ��r:�oUVq���ב���6 at a/�.%�F
g���	c9,K�!�����bw��3��1��r�����ŧb�ϫ=��\��(�J�'ڀ�Hա��P̖�X�yD
��h���?޽����f�z9��q|��bC��p�0Y�[���R��r��d�S�̟���=�p�t�d;�?�=����ű���c�	����;2�9�}�ܿ�����a�T��7�����o
��� �	P
�MP'[X8Ԁ�.�D��뙔.g�P-K�J���ݥg~��sk���4N
���]�,��
k���otc��o���ƚt�OL}���ξX�6p�n���{��+�]ѱ&��Hhg>��s�zJ�k�{��G�*�l�3��2��Ã_P�m
��TC6H��	��9$<:~�5�'7O�'��H'H����
�1���
�mx�
�pI�eP� �����0����Ͼv%�����֯)W^:�
��[Pg3�:�@C�Ш�۶\�F���KK��n�?��߯�)��B(�w��j]Lg���1��f"�X�
+��y��V0m��e>?R���	qs�ˮ���/T|ڏ56b
a�/��G�;0����7�j?ޒ���� �.�(��Z샸�
+
�.w��*�bx��L2�و$o�9�X�k4�����
"�?�.�F�H$
���O/�.ȇ�t
���++Q9�}["z��A�L�o���5$����w�6�E�.�m� �*�VQ]��U���
+S��-p
+A�?	�j
+endstream
+endobj
+13716 0 obj
+1763
+endobj
+13698 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+13695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.113 523.384 347.542 534.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) >>
+>> endobj
+13696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.331 523.384 513.996 534.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) >>
+>> endobj
+13705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 512.405 117.557 522.332]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) >>
+>> endobj
+13699 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13703 0 obj <<
+/D [13701 0 R /XYZ 89 770.89 null]
+>> endobj
+13704 0 obj <<
+/D [13701 0 R /XYZ 90 648.051 null]
+>> endobj
+13672 0 obj <<
+/D [13701 0 R /XYZ 90 513.401 null]
+>> endobj
+13706 0 obj <<
+/D [13701 0 R /XYZ 90 508.918 null]
+>> endobj
+13707 0 obj <<
+/D [13701 0 R /XYZ 90 400.817 null]
+>> endobj
+13673 0 obj <<
+/D [13701 0 R /XYZ 90 378.44 null]
+>> endobj
+13708 0 obj <<
+/D [13701 0 R /XYZ 90 378.44 null]
+>> endobj
+796 0 obj <<
+/D [13701 0 R /XYZ 90 291.477 null]
+>> endobj
+450 0 obj <<
+/D [13701 0 R /XYZ 90 282.579 null]
+>> endobj
+13700 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F11 621 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F22 2982 0 R >>
+/XObject << /Im24 13697 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13776 0 obj <<
+/Length 2318      
+/Filter /FlateDecode
+>>
+stream
+x��Zms�H��_�'���3̀+{U���^^���-BX��P
���y��r����U��LOOw?��`cn`ㇳW㳋7�2<�1ʌ��a��
r��M��C�16G�M?[��рb3���,�'o�i�g��K�8J�<,�1�1������o�-F-�l�+r��jH�X�Z^9btw=n�Ñ�+2=H�*��|0�6����b�E��܆�a6 �&<".%�my�������3d�A��
�]#X�}�3x�����ƣ
�0lj�56��~:�Z���#n�E��#[: �զW�7�( ��k�
S`P޿Y%A�I.��������2`ȶ\&"����D�Әk|
:���J�3�Nl7��}��QBT~
D�d�Z,�i������(��e��M�6\`��R�1�C� bq��?���Ɗ�� R�e��e���bvy�Y��6�;�q�~��~wus�n����p�.y����z��+�̭�\0�j�O[m
ڈa�
T<Dy
k� �T�PCZ[�

+�p�ΐX����N)�4/��_(���_�b��*n�G��?G���ji?��C
���]f��
�Z�#�F�"Dj#w���8#ՠV+�%��~`�Gɼ�
��j�tf~�jr�����D��/[V$6�,�'�a0�z�{��qhǩ?�v��'��[XK���>؎�.Z�.�gu��S�j Y������abc��b�����p��L�
B���}r!q�q�vq#
�|�'3�*dAm �0C
姈 C�AJ�	�#\��Z���Xy�
8X��""�)VY��-�y
�E�
+"2�W���� ���U��u#.¬��筤=��
�0{�`$q���1�F�7� iÕ#��D�Jh*[��
�: �H�lL����n
GU
+��SK븳0���AY�0���'�z�η�d��T������lf��›��pb��:aj+c�E��������׷wC14f�5!a�
�[����#�D�����*�g:1��e�D�E����v!�"]nBY��+���z3f�E�����_�n��?
�w�~��
�H���ÞŖ(crwu?���X_z�y�
��
E98A�$��KT�'��ja.h�밬���2���n�v�m��f��I�K��g��L���ZB��� |�)4-'q�qp�0I�t�e!*�!d�q�ĵ��J�A�!ǭ��1�����Z(�P��Q4��d{�.��7U�Ϧ
���°���™�w��l �J~�@�T 
+��E� r!g{!�|B8 G�#��
��������jC���j��Re�u���v�'�MFW���,�+�LuZQ��E��E�CG�(�z��+	�@�^֝������E�Gt|DV���]+E�Ew[RO.�-0_�A��9
N_ltZK;�޶0ClH꼣�q-D铼�zy
6��"��x=�
e�0e�b��>�����}<�n,�*F���sKa5�:
q�t�#A���2[v9#X�3R�-�k����}%pY�^�K��\R��[u��8I�����E65c���"��c��n�wA��L��7��C�ǖ
L���J�)�H�"�_�
�6k��f�K��7����8P�=�S����Џu}����:��F�<8�3A�LIV'��Ǩxh�+��k�KhhQ�"�B١��\�6
��V)u��+���
+ė
�o�b|���d�����N+�?�L��3�Bj7˂�*ga�وȫ{g1"V��^E�v��J�U[Ȝ/��%��J��'Dǽ������͓e)�ݬ8]M�S�8�eP�ӕT�9&G�γ��Y&����6��i-���ۈ
m�F�K�ӗs_k��J��+���١�,j�$r>�D���P �S��?:��D|B���
��_�������.G�%?(<����%7?�?O?��=�[���Hw�	�^�Bm;B�������4��Hh��/L!�u�*x��׉<e
+�#�Ju�&���5��x:O�_O�9��=�dC�k�kw�SzH�k3�u"��=?��OM8��;�Y[��	�t�Tt:{:z�o=7If��i�q
mG
�<G��
�i��p��}?䀣�K'�x BB9�9@���N�h�����U#{>M�t!ͥ����W �F�Γ��}�Qy.���Sy��S;'�
����87.[	��[u�s
fGE4f��ɪ�]�X>���9U߂"�,t��t�]X�[��oFy�wqZé{
�r+e=����b���a2GA��Elm/
›�r���E���"x���Py�����	b��� ��~�&\���_�^�,'�7
�x���7'|��zI
+endstream
+endobj
+13775 0 obj <<
+/Type /Page
+/Contents 13776 0 R
+/Resources 13774 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13694 0 R
+/Annots [ 13717 0 R 13718 0 R 13719 0 R 13720 0 R 13721 0 R 13722 0 R 13723 0 R 13724 0 R 13725 0 R 13783 0 R 13726 0 R 13727 0 R 13728 0 R 13729 0 R 13730 0 R 13784 0 R 13731 0 R 13732 0 R 13733 0 R 13734 0 R 13785 0 R 13735 0 R 13736 0 R 13737 0 R 13738 0 R 13739 0 R 13740 0 R 13741 0 R 13742 0 R 13743 0 R 13744 0 R 13745 0 R 13746 0 R 13747 0 R 13748 0 R 13749 0 R 13789 0 R 13750 0 R 13751 0 R 13752 0 R 13753 0 R 13790 0 R 13754 0 R 13755 0 R 13756 0 R 13757 0 R 13758 0 R 13759 0 R 13 [...]
+>> endobj
+13717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 685.011 181.845 695.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a88358b265bd62da2cd81c56fcd645ff4) >>
+>> endobj
+13718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 656.728 181.845 667.632]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad4d5c7ecaf25c8ecb621c67f736a36f1) >>
+>> endobj
+13719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 628.446 154.727 639.35]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad1574856ed0bd50691f53d457f7050a3) >>
+>> endobj
+13720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 600.536 176.505 611.067]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6638f2b6c8bf898f8161471fc5f574e8) >>
+>> endobj
+13721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 585.348 450.955 595.254]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad4d5c7ecaf25c8ecb621c67f736a36f1) >>
+>> endobj
+13722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 523.787 200.451 534.69]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6f5c679d18caa143808dee561a677526) >>
+>> endobj
+13723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.79 523.787 270.434 534.69]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.775 523.787 441.164 534.69]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+13725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.518 523.787 513.996 534.69]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+13783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 512.205 133.174 522.735]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) >>
+>> endobj
+13726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.341 499.106 358.056 509.012]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 487.727 200.451 498.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a863e64aac781b787cef654d50f7a4bfb) >>
+>> endobj
+13728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.105 487.727 303.461 498.631]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.382 487.727 396.848 498.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.805 487.727 513.996 498.631]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 476.146 156.965 486.676]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 439.713 200.451 450.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a5efd5e4204c7c95c1b0e3cfd829f27e2) >>
+>> endobj
+13732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.868 439.713 303.224 450.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.821 439.713 431.287 450.617]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.126 439.713 513.996 450.617]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 428.131 191.286 438.662]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 391.699 200.451 402.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa1443fb30fc4074fced75ff90fd6c6ea) >>
+>> endobj
+13736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.975 391.699 338.396 402.603]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+13737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.53 391.699 513.996 402.603]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.396 379.743 268.147 390.647]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.486 366.022 244.201 375.927]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 342.688 200.451 353.592]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9d8f4d157c42e5e39278d7d66d76c885) >>
+>> endobj
+13741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.788 342.688 305.615 353.592]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+13742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.796 328.967 243.512 338.872]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 316.591 200.451 327.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4908a79cf1d4182da8044569f54e4c2e) >>
+>> endobj
+13744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.788 316.591 312.241 327.495]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+13745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.796 302.87 243.512 312.775]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 290.495 200.451 301.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a531a253e03d062333a8cb762f14ab131) >>
+>> endobj
+13747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.661 290.495 289.217 301.399]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+13748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.516 290.495 389.983 301.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [441.718 290.495 513.996 301.399]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 278.913 150.878 289.444]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 254.436 200.451 265.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acaeef75119aef1facd18b0f1b3288704) >>
+>> endobj
+13751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.818 254.436 302.761 265.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+13752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.112 254.436 402.578 265.339]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.892 254.436 513.996 265.339]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 242.854 163.052 253.384]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 218.376 200.451 229.28]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9f44065933ee85b8d5aa18afbf25cdc4) >>
+>> endobj
+13755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.788 218.376 248.042 229.28]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+13756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.173 218.376 344.639 229.28]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.438 218.376 488.19 229.28]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 182.317 200.451 193.221]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a134614da6c987d405075d26a14334dda) >>
+>> endobj
+13759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.928 182.317 300.196 193.221]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+13760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.146 182.317 424.612 193.221]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [475.481 182.317 513.996 193.221]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 170.736 184.641 181.266]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 134.303 200.451 145.207]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab599638afe2eeffd2e717dcf1f4024b0) >>
+>> endobj
+13763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.076 134.303 273.237 145.207]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+13764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.483 134.303 402.949 145.207]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.892 134.303 513.996 145.207]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 122.721 163.052 133.252]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 86.288 200.451 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a33462aa3bbe9c6a069783274031d7dce) >>
+>> endobj
+13767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.299 86.288 246.899 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+13768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.401 86.288 288.128 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+13769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.372 86.288 402.838 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.892 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.707 163.052 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13773 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13777 0 obj <<
+/D [13775 0 R /XYZ 89 770.89 null]
+>> endobj
+13778 0 obj <<
+/D [13775 0 R /XYZ 90 704.199 null]
+>> endobj
+13779 0 obj <<
+/D [13775 0 R /XYZ 90 704.199 null]
+>> endobj
+13780 0 obj <<
+/D [13775 0 R /XYZ 90 674.182 null]
+>> endobj
+13781 0 obj <<
+/D [13775 0 R /XYZ 90 645.899 null]
+>> endobj
+13782 0 obj <<
+/D [13775 0 R /XYZ 90 617.616 null]
+>> endobj
+13786 0 obj <<
+/D [13775 0 R /XYZ 90 419.018 null]
+>> endobj
+13787 0 obj <<
+/D [13775 0 R /XYZ 90 358.052 null]
+>> endobj
+13788 0 obj <<
+/D [13775 0 R /XYZ 90 331.955 null]
+>> endobj
+13774 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13857 0 obj <<
+/Length 2037      
+/Filter /FlateDecode
+>>
+stream
+x��[[w�6~ׯ�S*�ø ��I���6iڸ}Izt(	��+�
+I����
 Eʔ�شZ{��#^@`0��7��
��
^]
��J�)����Sؓ�B\����<�}<���'�� %����_>\��p�ɼ��|
x�=b+�H�t5��'�f��'#��(��|���}�:�N���B6�{�&|#�1�p)	A�XA^m��,�Q����['Q�g:��k��
}�lʋy�I�
]�bG;gL ��wF%�LZ����)*z���y��N��2t
�����{�>�E󛲘�Gds��#?t�t�.��[�k��|bQDD`��B)���']8�~{7�>�q���h��
�
�7k}�#i��z\}�����9��]��R�=:n�
}>������o:ߤ[�:mm[o`Z����<q���K
O�I�
#
�1��X )di�_0f�����AY(��2[���8Qe!t�3�$�
 $a�O`8Qn:H��(�q{pt�M�d���(��z��oN�J��F�U���ݦ!�&e����x������m�|�*zA��Q�QgUV�. at l��a<	���G<7qd��jD�а�3�w��"�<Y;���$��#��e���	��=��{0�9Y&�h.�7c�dzv�(z
+c����[T��ۤH�(n�nI����M%q���
nm�o��a�\ q��)F*�{4�I��gO�Q�� �
���;E�KDe���7i�x�&�}(ױ�S��jl��(�2.p_���f -|��4�R�H(Z�i�E"A�
�D�H�@mf�#X�U?�5Mu��G�#�(tX`��>(`I��*�
½�����p�l��+�a�X�`߆\���n��d`�c-�Y�D!AP��1�\�E
E�ˊX3'��
o�#��
�
��o�Tg�f
+^�E�kp�ohp�u����g؛y:���m~Rd�W��*��ɍPH��F8�K��<�O� 
�G�O���^2#F��*�����b<FT�3U
58S�2����/T���u��9�id�)�*�6�q|�&ޥ&ek��
_�p| �hYq���(��Y��g���d�CڬX�9�3�>#���p>W�b���=��u92�h\���E9��dkiD@~H�q�mie�pS�^�X-|%�@�6'f(`�'~i��8��/����¸��$ l�
�}9/���ޙӴ	7������2"VY�j�ɏO�8�~捿�7^
��t���,���}Y�>�ΩYg_��x)����[����v�<�3F
+�.ڮeh����A�S���ƜRG�
	R
�{1���U�3�b��8΀P�+�4��[ ܋(�d��5Q[�a@�E+����N�9��
��&���
��s�{�0�d��ax/���U'���^ێ{������/�(}E�1ٿU��L�Ȃ7��1�K�T��&���=M�	X�4顲$�$�5�^f7:Y�<-wo�����	���<�#�?�<�pi'J9
0��y@���^��r,�X����f��0vP[SR���Q�0G,�9#t!�hX��mca�z^:��3�7��
ijO��
�y��N�"vH� aQ_۴>/���6�p�%�
��X�r2n7pl�.����QH�|�N��qm�u�z
.�i�;�ӄ7�B�_�4/c;<���>=�t]��6�����'["O�ZT�)�]��y÷��ta���nj{��v��-!,Z��
����" ���
� ��.5���a�N��%l�R��-N5�pΑ�/����ޕ�Ss�e��wLC� ��������
Z�[���G�^�� /���
r���6]d���"|L�I��y���e�4 at R�S'9̜���o
��!n�ӱ�ﰑp� ��HR�� `�C_B�,N~
`����xY�.^�߸��\1��*�Vw��m+,��N�!�#_Ѳ�B��I��?ۋ�3��0�|���}�L��
�UǗ"�TF_�
	��.'Ȭl��D��9`��2I
����.�|�����f��x��;��w:�²2�yydj����

�Bs@��?g�

+endstream
+endobj
+13856 0 obj <<
+/Type /Page
+/Contents 13857 0 R
+/Resources 13855 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13694 0 R
+/Annots [ 13771 0 R 13772 0 R 13803 0 R 13804 0 R 13805 0 R 13806 0 R 13807 0 R 13808 0 R 13809 0 R 13810 0 R 13811 0 R 13812 0 R 13813 0 R 13814 0 R 13815 0 R 13816 0 R 13817 0 R 13818 0 R 13819 0 R 13820 0 R 13821 0 R 13822 0 R 13823 0 R 13824 0 R 13825 0 R 13826 0 R 13827 0 R 13828 0 R 13829 0 R 13830 0 R 13831 0 R 13832 0 R 13833 0 R 13834 0 R 13835 0 R 13836 0 R 13837 0 R 13838 0 R 13839 0 R 13840 0 R 13841 0 R 13842 0 R 13843 0 R 13844 0 R 13854 0 R ]
+>> endobj
+13771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 658.052 190.738 668.956]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 658.052 261.85 668.956]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6fe5d4b4668903bd121f09cf42dafc26) >>
+>> endobj
+13803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 632.049 190.738 642.953]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+13804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 632.049 262.159 642.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a687054502f5eb589faf427d88c3d65c4) >>
+>> endobj
+13805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 606.046 183.824 616.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a49e115d36463ed948b66bc80da8797bf) >>
+>> endobj
+13806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 580.417 192.272 590.947]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a5586c5fb00764130c2933b3ca57d2406) >>
+>> endobj
+13807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 554.041 241.935 564.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa215c11ded71b5bdba3261ef4a120db8) >>
+>> endobj
+13808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 528.411 193.229 538.942]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4de33097ab368fe3a04efcb7d06e951f) >>
+>> endobj
+13809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 502.035 213.163 512.939]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a71e812fb33a773ec01d3401bb98cca7c) >>
+>> endobj
+13810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 502.035 315.857 512.939]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 478.398 189.901 488.928]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab7da6c8657f9fd5012eedbf06f125f55) >>
+>> endobj
+13812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 452.395 187.689 462.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_acccf4bd9a0496d0ee342b024db60e456) >>
+>> endobj
+13813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 452.395 226.693 462.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 428.011 228.895 438.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a22770e59d89376a756880f6dd45a7705) >>
+>> endobj
+13815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 428.011 333.482 438.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 404.001 229.503 414.905]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0d4596f8ceb58f2661667fd70d14c27b) >>
+>> endobj
+13817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 404.001 334.089 414.905]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 379.99 187.264 390.894]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afae9026c6dd798922151da40278851be) >>
+>> endobj
+13819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 379.99 293.213 390.894]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 379.99 371.148 390.894]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 379.99 455.727 390.894]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 333.066 187.264 343.97]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ac038cf769127bae1af0098ec5b9bd1d3) >>
+>> endobj
+13823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 333.066 293.213 343.97]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 333.066 371.148 343.97]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 333.066 455.727 343.97]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 321.111 220.058 332.015]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+13827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 286.141 186.348 297.045]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a10d9890b8689f81eb523e564b90155e8) >>
+>> endobj
+13828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 286.141 293.772 297.045]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 286.141 373.367 297.045]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 286.141 456.837 297.045]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 239.217 186.348 250.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0b732034ee43763d080df03b09cef738) >>
+>> endobj
+13832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 239.217 293.772 250.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 239.217 373.367 250.121]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 239.217 456.837 250.121]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+13835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 227.262 218.404 238.166]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+13836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 192.292 232.76 203.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a387971d4f658b3b5294ca3b282db0332) >>
+>> endobj
+13837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.097 192.292 335.454 203.196]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 157.323 232.511 168.227]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a49a3e85706df1d3b23727ec6044f3332) >>
+>> endobj
+13839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.848 157.323 335.204 168.227]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 122.354 180.496 133.258]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa799531de0e163fee81fe310c196d06a) >>
+>> endobj
+13841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 122.354 283.19 133.258]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 98.344 213.153 109.248]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab98a54c0e234a92a719a14dc82dd0bc4) >>
+>> endobj
+13843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 98.344 315.847 109.248]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 74.333 238.459 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4ef22528f01e0580396340c7c1a35411) >>
+>> endobj
+13854 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13858 0 obj <<
+/D [13856 0 R /XYZ 89 770.89 null]
+>> endobj
+13859 0 obj <<
+/D [13856 0 R /XYZ 90 673.181 null]
+>> endobj
+13860 0 obj <<
+/D [13856 0 R /XYZ 90 647.366 null]
+>> endobj
+13861 0 obj <<
+/D [13856 0 R /XYZ 90 621.364 null]
+>> endobj
+13862 0 obj <<
+/D [13856 0 R /XYZ 90 595.361 null]
+>> endobj
+13863 0 obj <<
+/D [13856 0 R /XYZ 90 569.358 null]
+>> endobj
+13864 0 obj <<
+/D [13856 0 R /XYZ 90 543.355 null]
+>> endobj
+13865 0 obj <<
+/D [13856 0 R /XYZ 90 493.342 null]
+>> endobj
+13866 0 obj <<
+/D [13856 0 R /XYZ 90 89.65 null]
+>> endobj
+13855 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F68 3017 0 R /F111 1509 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+13930 0 obj <<
+/Length 2294      
+/Filter /FlateDecode
+>>
+stream
+x��[[s��~ׯ�SK΄����i;�*�ljݨ��i��`@bE�! ����g/ A
+!	��<wϞ=�;�]bg�`���߯���x�	P�R׹�q�x<@
o��iD0��`�G�c�GQ����1ţl�]�8����4���W�u���,�5�N��b�����oi,FE\x��^�/f�
?�>eA5����u
q\���I2˨(�*��z
Б\��Q)͛��F�c�d:�Wħd�9QD�^_��~F�
v��@���Vg�~�N
��w0b����A+�S�K���g�J��Sk!��\�ˁ_x�A�S��GYn򴨶O�F�����|#ͨ=��!�%ՠ���6Jc�˭y���l�o��
�i��/�6F8r�_�H�c|TcfYZFIj���s)���زjT�1ǣ�B(H�\+�!��J��7n(~BE
��@]�){��F�U�ǷgΧ�P���Y~� �$KOOS��vtx����)v�/X`�|Q��йPCr�P�F�O3 C�(����u(�\N@

�!���)�
+�|̼�݈�m�-�$��/SY�I�
�Zgw�~��= �E����T#�Fr͉	�"F� Wq=�\V��e
�X�F7�����b�>
+ho��,���V����YΌKJ�����=����!jގ4/�
5�yԾ�O�C�Rѵէ��N�!��<��ph�aF��cQ���,߆E�?�۵��2+�eh�&i8ݖ�8�� �PH
P"��h�Dd�Z
ف64��Qm�JU�DͻIcn&�
�g��:�q5�`�
�G�  #H�����c���A@*7��R��ׄ�ǫ��r-&�t�@�}v`�/�
:8�rH�
OD�ET,�Y�ϡN�qu2:�&��P|T��V37U��w����=��
�$?�SZ�O�l�-����s��3U��Vԥ���ry` `$P��Fy�e�!��=A�.@�T��;{����u�Ϭ��ZG3K�d%�B%;��)�
�o���A�����٤�F�P.���CdM�C'7ۃ���
S7 at W�+����Y#��w�a��Q��N�
㪻b���B#�v�m
��lqcb
��P+���{T����^�U-/��}2����g��u6���l
<2�~��U:<+�3a����{P>�K��Ž�����D�DUt.�wK�.�^��*�c�+���ۦ��Vn�S�0`�ӆ-��?{(A���,�D��ն(�]��
1�y���^Q'-������z�8��E_��
^���;��
+gJ��k��3x�G��1���M6h��u	��0�4O��OL���~V����
6�ՌT�
�V�Wd�
`�̜
o�� z�t���)�Y)@-��@���wl�4P&���x'�r� N{�n���UA�R|(;���s�MZ��@p���_c��H�զ��  <@��?E��j���mƘ�������2I�<Q���?p����k'�B�
�����|ߥ�e
��5�4���|�w�
�u�eq�"���o�������
+>��"�����f��h��1t_0�
��b�>�{V�sܳ�̘�����_�W��bM��(��6���ʂ#6@<D>P3���*��6����S�k�F�d����X[G��4"�:�a
��G�A9m�GC�΄���:o �i4G�*@
�M
`,P�A�8��a��d�fi�/�A�=�y���
+�Ks��܏l�2���������ŏ.߿����H����^�}@cZ�W,����i[B�R���eL��q>�b������RK�n�M�v,hl�z�q�e�q�F�VN�
 !��j~Tc2��5��cV��9f�W�ѫ}�7
}�b9󛈝h��#n#W �+(���:�
��2�U�O
�y{P���
o,�ᩆ2<[(�S;��(���\��qa�V!D-�B�I����
?��*Ne��V��Z?
q��:��|�!��CV�e�Ζ�<�E�p�̊M.C�:O�z4o�d5�SY�#�
�U&e��ڮ�袶l��޷9�=H��~�P�i@�7W�
u��[�=�����?S>�弿�?�OI<��&w7}��FEk��(���m@]�l�5���X�}��G�]Dɠ�}��(d��\�f�(����ţ��_Y�_V@^;�	.2�7o���0����O���<���K4�rj����j@Dֹ��*a�ە��,��oN��$�P�0�~}��(������f^�t� +����^�a�\��E�,�- ^�t��?U�� ץ�4@���a���Q=����&���V��.!��1��M
+endstream
+endobj
+13929 0 obj <<
+/Type /Page
+/Contents 13930 0 R
+/Resources 13928 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13694 0 R
+/Annots [ 13845 0 R 13846 0 R 13847 0 R 13848 0 R 13849 0 R 13850 0 R 13851 0 R 13852 0 R 13853 0 R 13879 0 R 13880 0 R 13881 0 R 13882 0 R 13883 0 R 13884 0 R 13885 0 R 13886 0 R 13887 0 R 13888 0 R 13889 0 R 13890 0 R 13891 0 R 13892 0 R 13893 0 R 13894 0 R 13895 0 R 13896 0 R 13897 0 R 13898 0 R 13899 0 R 13900 0 R 13901 0 R 13902 0 R 13903 0 R 13904 0 R 13905 0 R 13906 0 R 13907 0 R 13908 0 R 13909 0 R 13910 0 R 13911 0 R 13912 0 R 13913 0 R 13914 0 R 13915 0 R 13916 0 R 13917 0 R 13 [...]
+>> endobj
+13845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 695.879 205.692 706.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+13846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 695.879 261.312 706.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6b00d457f34b8baa95ff0bee93ca2104) >>
+>> endobj
+13847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 695.879 332.156 706.783]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+13848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 671.722 205.682 682.626]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+13849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 671.722 261.302 682.626]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad3c81efacdeb13f86545d21a1e042842) >>
+>> endobj
+13850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 671.722 330.462 682.626]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+13851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 647.565 205.692 658.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+13852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 647.565 261.312 658.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_af301ce44669a47cba65f442cb83df09e) >>
+>> endobj
+13853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 647.565 338.781 658.469]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+13879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 623.408 202.902 634.312]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 623.408 300.037 634.312]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa3310914f7ae4e787b5a313c0408128a) >>
+>> endobj
+13881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 597.259 202.902 608.163]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+13882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 597.259 314.263 608.163]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ace39d6fb25dd1e014394aa0b87b2271f) >>
+>> endobj
+13883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.819 571.483 199.864 582.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7d24a62d5e49ebf26da8f09777c0f3c6) >>
+>> endobj
+13884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 547.326 161.677 557.856]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a71eda0300dc88b24d6b0d6af3630f18a) >>
+>> endobj
+13885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 483.51 198.011 494.414]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae312d1f6cbaa566ae76eba2d5343afd0) >>
+>> endobj
+13886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 459.727 205.752 470.257]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab58e79d1bb74e1d280f13f67b4a72088) >>
+>> endobj
+13887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 459.727 276.595 470.257]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+13888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 435.57 236.745 446.101]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_adc580eb211e4b01ea98205fd00cc10ed) >>
+>> endobj
+13889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 435.57 307.588 446.101]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+13890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 411.04 209.627 421.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad88d1b3a6eb0d9cf72ab0f38ca00dd05) >>
+>> endobj
+13891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 411.04 314.791 421.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+13892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 386.883 240.62 397.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1a08648e6ffda9d2aebe72b5fd5276a4) >>
+>> endobj
+13893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 386.883 345.785 397.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+13894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 362.726 212.377 373.63]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4f759d9cde19d1654178afdc211a71c9) >>
+>> endobj
+13895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 362.726 289.846 373.63]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+13896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 338.569 243.37 349.473]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aae1cd388ec3212a9ffe035fb50a0c433) >>
+>> endobj
+13897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 338.569 320.839 349.473]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+13898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 314.412 216.252 325.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad02d0d77972ad5c0e985d6e545ebdee6) >>
+>> endobj
+13899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 314.412 328.042 325.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+13900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 290.256 247.246 301.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a66ea2ce3b2953de1a16353b4a0494f99) >>
+>> endobj
+13901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 290.256 359.035 301.159]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+13902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 266.472 193.577 277.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8401ba86478c28adc82a461373af899e) >>
+>> endobj
+13903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 266.472 232.581 277.003]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 253.347 248.845 263.252]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+13905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 231.357 193.577 241.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1172af7e7d2ee7986b1b6e5502722026) >>
+>> endobj
+13906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 231.357 277.691 241.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 218.231 247.177 228.137]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+13908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 195.867 273.129 206.771]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_af92f79edc91ff46f8c78bb88e125909d) >>
+>> endobj
+13909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 195.867 352.41 206.771]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 195.867 495.961 206.771]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 171.71 275.007 182.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a393ff49cc4d91834f6af25f73c3be617) >>
+>> endobj
+13912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 171.71 362.877 182.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+13913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 171.71 472.148 182.614]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+13914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 159.755 233.986 170.659]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+13915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 124.639 255.564 135.543]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0ba6b33311c2b8269768b50d37f2023b) >>
+>> endobj
+13916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 98.49 223.465 109.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9c55ec0c67edc3d1a79651ff8bfe1d7f) >>
+>> endobj
+13917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 98.49 326.158 109.394]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 74.333 217.109 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a70cfc1a90d96296a91eb0bfddc55713b) >>
+>> endobj
+13919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 74.333 319.802 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13927 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+13931 0 obj <<
+/D [13929 0 R /XYZ 89 770.89 null]
+>> endobj
+13932 0 obj <<
+/D [13929 0 R /XYZ 90 638.799 null]
+>> endobj
+13933 0 obj <<
+/D [13929 0 R /XYZ 90 612.649 null]
+>> endobj
+13934 0 obj <<
+/D [13929 0 R /XYZ 90 562.343 null]
+>> endobj
+13935 0 obj <<
+/D [13929 0 R /XYZ 90 140.03 null]
+>> endobj
+13928 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14018 0 obj <<
+/Length 3432      
+/Filter /FlateDecode
+>>
+stream
+x��\�����?]m ��-1�h�$M�&�ܶ���֮�ڒcɻ���;|�AY��Y]r��Ґ
g~� i<����W�\_��<`3���rv};Sxp����6����O�_͘
QZ�ǟ~���g�\���>������+<#���p��_���m��W3��
+g�h?���n���W����4�)>
�7�5o�cD�k@"�2��<O��|�d�͋L���s6Z1�B����1�D���8�8,��m�["o|�e�$�R;�X�H��|�vq^�#b_f
����qA�|
���m���$s
D�m
�?��C�<.\'�������&��sJ���&�GIjI,)+I�����Ҭ��POeI0RB�s���@����bI�n$����M���s��\�a�DH'0C�$��7]
����
;��U#!���N縡�K"H�����P*�V����M���s���;���
+-�<�v����'��j��E� b��XEFO���FZ�2/.��:K�Tb�:[P1
����ߋG�~�7��}qS$9��S2Ѳ'�d�=ɐ�Y�`؞HP)Nta���>5>X}���=X3)�Ё��FՖ	4��[BC@5�L*�<$��
+б{�����9f]���Z
�Z����/o;-�����6��qπ��9ɛ
�co>���A���Fj1�@���Y�ڢ�y���x(
B
Xd��#
�^�j�l��(<�n��h�H� �]��KSi+��g��Hx

��f���^����G0_L�&�}��qt\}��p����UW��rh��iW�Z'qZ��c����QW��۠�^�q��%8M%�W��i�OҨȎ��g}>L��go�g,�m*�t� ݠ�_J1���*���47�q�V{4���H+����Lt�N�	(�XN�5�	��
���qx�c^��=�
,��

>"**!i��D!���ZC{��(�G�-�m��y)
����汋Ӑ���Xw3I(�0�.�U��#�
+���`2cR�(x�	d��@Ƃ6�1���L�9d��
d��! [��C��l����lQ Ѿ �6Q̬X0
+�47>�QXg�aM���1
+(�~
֌�������
+���a
��| �B��&�yCw��\����a
���.N�c�K�oVÁ
�s�M��ۅ��Ϳ�w&�X�y��T����1��{
��P��dΝE�<㣿�qO���9�06�ь�C
<�7.���'~~��E
Lp
,�N�@���
Z _
�;O�a���Z��b�~!�y���B���@ڼ	h�P�
�a'��KW)��Z@�<iiY��BZ2P���"�
+2[2�*P�v���ˆ1E)[d4�Do̺/���c��C

�&掾̐��je�[W=��CX�$O0ވ ��Oћ	�����X��	w��6�
�l���cᬃ
Fm�
.:	�
��N���:��8x���%�!?�;���$��߷�h��@��DP��τgJ��'���y��.�4{
S��
?�]=j�
'�y�]�r�:�p� ��ÿ�� �E� ��W1��g����0@����"4����B�M��>�����.B�C s�!��/��
6n7��1�����
���нT�C�_d���;ȧ�1:n�I�����܁�T[��_�0��Cz�zBz��;��E����&��r��awD-[=���h�ۀ:v�����g�~x��h
�:�q�%?�&*���$!�N",{��C!�
+�v-����d�W�1p� �#6~��.k0���w���m	�W6��:b
�"V��
u7,{�X8dL�phD���7ހ�u�֎
�O�C�8'#�P
��Dfc� �����CY�݆����M�w��������W�!
��F�ȥ�^�nV���i��n�
 ��l��Su��U�C�=�ڹa+�e��i�_�2Q�A���4kW���N���4åiY�V��.V����HK��w7�j:�H}vj�U0@��`O��qZ���V��
+\W<@4$=�-��g���#��×(��9%��bɥ
՛��,�Rv;�]
�Z���A]^�	 |~^ɦ�	D�zb����JDHʀ�O�!����u��Y���}pm�>&Q��~�*��m�~��
�'䄐S��í�F�3�{s�)�Q����s
+�y1��vO���OT
�qO�$ P����3a��<�3a��@�gn}ھ��|(�
�0����㠖
0Q��$@�_�S
�0��)�\G�W_	�"51ֳ<U�W F�/�\�쪀�@LvtG��>^��
�����p�
�އr��,��:?��F��\g�é��
�[�/���tq�v�z�tS
s�>�^�%
f-���@�p�=���R�f�7�kj�.�*�~�b�/�������^@N�x�W��&ـ��a!����FZ����:�����ٔ8+!��}{��G��Ά���n�`T��b � ²7�y�[�EyC���f{��.<��*�^��+\�0GH=��R�Xe�L��Ά�I�*� �m�ۼ"��抙�f�2I7��}�9E����x�{��\#
+
����!�B�
+���n ~R
��>�U-�!*ˎe�hm��k^�������:ƛ�:��O��(0�P�8�p�&��	�G	��Q�[��^���'{-+��w�}½-$�Y�c��"�bk�_�f e�i����8
+W�Q��m�;�N����jnw�CG\M;�)A���}��WI�Nq�켵zJA!��c}	�i���&XԸX�=�
+W}g�AG�y�����H��E��V�t�
�z5����Eu�O
�S�(�2�F؉X��R.i�<dnC�'��c�: ��G빖
<�'
��A���=���Ը�U
+�S�GoW�NNS
V��8D�&��V-X��ņ�E����Ig(X���{E�p��U�<8n��%
����	��^}�$���6������.p Q��C�u�{t
|�A��E	��]�請�Y�P���"o ��ATP�u+�ÃN1`Ѽ.��|R5���l蚪?�[`���eM.\z�� �
���\�i
�j|��c�*��WM�
r���Ƒ�fNs�����2mFIٺ��[H�
r?o�CP��:-j�	�_L�C�Mu|�1���Y�sg��V`�T-=3_�# 
+DY�
�(��0
{:��l۷�Z�q�;): �'?�J|�|]AJ���c5%:$N� =u���H�����M�!`��/��|�&����ݼ,۸/�ܳ�_2��n	�-�M���
+⊖��y]�"}��k��y|����H�=JOe����%��eE�����
���M\�����?$��F���mQ
>~���t���
c=w"��M�Re�e��ώ�/L�C��9g
�M&ӵ
+endstream
+endobj
+14017 0 obj <<
+/Type /Page
+/Contents 14018 0 R
+/Resources 14016 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 13694 0 R
+/Annots [ 13920 0 R 13921 0 R 13922 0 R 13923 0 R 13924 0 R 13925 0 R 13926 0 R 13955 0 R 13956 0 R 13957 0 R 13958 0 R 13959 0 R 13960 0 R 13961 0 R 13962 0 R 13963 0 R 13964 0 R 13965 0 R 13966 0 R 13967 0 R 13968 0 R 13969 0 R 13970 0 R 13971 0 R 13972 0 R 13973 0 R 13974 0 R 13975 0 R 13976 0 R 13977 0 R 13978 0 R 13979 0 R 13980 0 R 13981 0 R 13982 0 R 13983 0 R 13984 0 R 13985 0 R 13986 0 R 14020 0 R 13987 0 R 13988 0 R 13989 0 R 13990 0 R 13991 0 R 13992 0 R 14021 0 R 13993 0 R 13 [...]
+>> endobj
+13920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 686.155 271.126 697.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab6f406a463e3ba5410f4cbdaa11f4ab4) >>
+>> endobj
+13921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.463 686.155 373.819 697.059]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.863 673.643 326.259 683.548]
+/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
+>> endobj
+13923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 651.518 198.26 662.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab715169978303aca2ce5ddfa3bbd835d) >>
+>> endobj
+13924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 651.518 236.665 662.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 651.518 353.317 662.421]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 639.936 246.458 650.466]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+13955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.306 627.05 269.939 636.955]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+13956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 604.925 212.768 615.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a82fdfec45a014eda72368a83eb9b262f) >>
+>> endobj
+13957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 604.925 252.959 615.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 604.925 375.145 615.829]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 593.343 286 603.874]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+13960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.401 580.457 277.928 590.362]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+13961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 558.332 250.099 569.236]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_afbcad3e472c43fa5fbaedc7ca116285c) >>
+>> endobj
+13962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 558.332 289.446 569.236]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 558.332 379.512 569.236]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+13964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 558.332 513.996 569.236]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 546.377 416.369 557.281]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+13966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.304 532.655 439.335 544.82]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+13967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 511.739 261.881 522.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa9fc9fdcb869bab25e625e30700ac946) >>
+>> endobj
+13968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 511.739 300.286 522.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 511.739 388.504 522.643]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+13970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 511.739 520.199 522.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 499.784 416.369 510.688]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+13972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.87 486.063 449.708 498.228]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+13973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 465.146 250.748 476.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7e233e312a4eb954ae6072fb67066ed8) >>
+>> endobj
+13974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 465.146 357.317 476.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 465.146 456.145 476.05]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+13976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 453.191 202.344 464.095]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.005 440.679 446.071 451.635]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+13978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 418.554 261.881 429.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa228b23d0485640e4605c02cda7ef927) >>
+>> endobj
+13979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 418.554 365.272 429.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 418.554 460.793 429.458]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+13981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 406.599 202.344 417.502]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.222 394.086 466.67 405.042]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+13983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 371.961 239.984 382.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_abd234893e53023df0b4580cdc80c1b04) >>
+>> endobj
+13984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 371.961 280.82 382.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 371.961 405.104 382.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 371.961 513.996 382.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 360.006 171.361 370.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 360.006 478.077 370.91]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+13988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 346.284 432.092 359.442]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+13989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 324.165 251.209 335.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a43af52f7bc75535df6830e5672dbe9fe) >>
+>> endobj
+13990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 324.165 290.549 335.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+13991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 324.165 409.969 335.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 324.165 513.996 335.069]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 312.21 171.361 323.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+13993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 312.21 478.077 323.114]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+13994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 298.489 456.992 311.647]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+13995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 276.37 224.57 287.274]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8c49dfc766d00310a09b70787fa0abd7) >>
+>> endobj
+13996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 276.37 327.264 287.274]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+13997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 263.857 347.869 273.763]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+13998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 252.691 196.297 263.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae304e2fce9a44bf70cb231d3c5eee805) >>
+>> endobj
+13999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.439 252.691 279.215 263.595]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.718 252.691 432.878 263.595]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+14001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.827 252.691 513.996 263.595]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+14022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 240.736 216.491 251.64]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+14002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.094 240.736 362.977 251.64]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+14003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.254 240.736 475.081 251.64]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 216.268 164.537 226.174]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+14005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 205.102 212.377 216.006]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a576cc345fee807dab1b7632f0399d205) >>
+>> endobj
+14006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.509 158.509 264.133 169.413]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3495ffcfb82ab7074ea4b3227dc0ce84) >>
+>> endobj
+14007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.29 158.509 367.646 169.413]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.92 134.042 413.759 143.947]
+/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
+>> endobj
+14009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 99.961 248.929 110.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad50fd9b69923ff4d148cc0d730007ed1) >>
+>> endobj
+14010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.267 99.961 351.623 110.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.801 87.449 367.562 97.354]
+/A << /S /GoTo /D (index_pps_certificate_widening) >>
+>> endobj
+14015 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14019 0 obj <<
+/D [14017 0 R /XYZ 89 770.89 null]
+>> endobj
+14016 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F66 3165 0 R /F42 539 0 R /F67 3022 0 R /F38 3411 0 R /F24 537 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14070 0 obj <<
+/Length 2484      
+/Filter /FlateDecode
+>>
+stream
+x��ZYsܸ~ׯ�é�@�H���U����f7���}����J�fx��H����k0�"��Ƀ4<�F���׍�w�a����/ON?��(i�]^{1��Q������D<���>#�O�<Y��(����m����O�U��gg�qV�Mښ6������.<�@Ƞ3�(� UT_�MF�@��Ŷ���w�.9q܉ysP̻u�4�9
�9�����:iS��Sz��3�i��G$���I�'�]�|=! {D�*@"����߰���?z�8��U�����ڻ8���O��@0G�B�T)�s�_�bJ��b�fea��&���9y0�*�~�����gyZ4�-�'�oa?]����J�r�V��!
*���ޜ\����`�V}c�����y
H<uP)g4���J5^��9j
UZ'���\�~�^����2���$�� �mb�E`��+TRr���F��tiM
 �n
+p�q�
Ì~��^*��
F�1G"-��`�� �V
�8���۬э���^!���b�D�]���B�5X&[Wf�+
�yV,˼J��j�J�}���0F��
f� l��W��U�x؏��j�2L����

Ohg$)DA��}��"�͈~��!���Gt�@�Ma�������I1%b�l���ew1�5�H
+	Q$�t�G��SR�
+;4�Ҙ�
"�����������
=�̓�h�d��-4 at 1�эt 
�Z��eW��U��.ɽ�ϳ�t�߃v妞1�/M���7j�g�'��t-��
f�^�|}]�x��K}
+@�l;؎m�`�R[
��-9ي�8��'+!Ç���;�#��ϼ|�ܫl��5}w~���̚���j\.9���Q.���[���!��u����8F�?���j��
j�A�Y x2�[=޵���e����S����U���B��0w�8B�v�_�2����a�r�����*F��;�o2,�f��(n�;�Pm�Yq�Gs�A�IF�CnQ�)��d)�tkǤIZ�G;��!����ӝ	����
����Ÿ�ߏ�/��.�;��ßĐr��/�t
���彄��U�¼��|�]�.�c?����W�l�i�
+
+�+��Pc6LQ� ��Q����h��7�b�v�60n[š����N��5)E��[���$�g��D׹�7ڰ4���`}�lz
�K�y���K,($�"��#�F�iu���w�_�E�O�ݯ3����Y�o��؁�;�ɤn� �Oj
r�e��דi�T�2_SH�S{��7GN�2�mvs��G��)hNRA��s���U��������r�ԫ�~'�#	z��l֭
+ A��t��)��
+w�F�	"�C�������8nn�؀
��F��\�6K�
[�u��e�+���)�fi�U��\�&�#�e��8�k�?�D�5lI�[��
�(�r��u��$�e��j2

�+�S�a�k3�G0�x�Q���L�'�x<ˌ����vY{�_�����~�i�{]���6��=e�����+6=�
�Ue1B��
Aa���tVt� CDر��T���X�.׫?1ax�i.A��i���l�
�&sF%�c�z�g�z!�w0w9F�(�2�� 
^���1A��9���]
��FF#�|s5���v��p��2�-=.ɇ�C��p������e�=��c��Q �  �"��M�.��γ|�b����h�U.o�|
�����ӝ�	בPl��b0������q
oU�o!�+����1�Tt���̑V��5���l1�������7x�����ՀҼ���6v7h��=|�n�}7zWggU�Վ�+�g��K��ǻY�lZ�
��
�-��8�Z0�B�x�yOX[ZOw	�x �9���� �8ꐝTU]�T�%����iҏ�^"t�[}��z
ZF����F�UY������"kӹ.��J��ȁ��
�&hJ��4e���4
����,~=�R�]�$6)�,쎲�]=	0�U�z�L¦��*�+��|�}�ll�~��������+���4s p4�����\7H�j} ��C
��9N!���QgS�S��1Ǯާm�����i���j
��%������
+��2�$x�X����} +$�O��ه�s&K
+�Q�Ιm���ٰ �V�@��WԬ���+u�j�
@I*@CqL�aRC�0}�͡BL��,* ��i��>M7�G�:Q'��t��
+
1�
�9Ta!C8vZC�ހ�y���L�
����]��
+	�
��Q���>�xw���=[an�z3�Bd� )`]ߦ
�����'+��]�qe�d�J��<`�?��#�*/�������MF���&��2
������-M�x�
�u�nB>R�i��0���ͦ������?�1�`����G�۶��NO�67MZܠ�>D2v�`,� W7ům�%/m���0O�j
+X��2��!�� �~��D�Z
��K��yp�Cμ�%�?v���|6
+endstream
+endobj
+14069 0 obj <<
+/Type /Page
+/Contents 14070 0 R
+/Resources 14068 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14083 0 R
+/Annots [ 14012 0 R 14013 0 R 14014 0 R 14037 0 R 14038 0 R 14039 0 R 14040 0 R 14041 0 R 14042 0 R 14043 0 R 14044 0 R 14045 0 R 14046 0 R 14047 0 R 14048 0 R 14049 0 R 14050 0 R 14051 0 R 14052 0 R 14053 0 R 14054 0 R 14055 0 R 14056 0 R 14057 0 R 14058 0 R 14059 0 R 14060 0 R 14061 0 R 14062 0 R 14063 0 R 14064 0 R 14065 0 R 14066 0 R 14067 0 R ]
+>> endobj
+14012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 686.403 200.451 697.307]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.191 686.403 251.997 697.307]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6f5194268604a038e2bbc5b80fa39d28) >>
+>> endobj
+14014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.334 686.403 354.691 697.307]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 649.029 200.451 659.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.191 649.029 251.997 659.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_af2a0481ba54986a813ecd5ddf38b32e3) >>
+>> endobj
+14039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.334 649.029 354.691 659.933]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 612.652 180.198 623.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2f238d94389078c34108540c600836cc) >>
+>> endobj
+14041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 612.652 259.37 623.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 587.234 289.866 598.138]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_ac8ee6f133d133ecb820f1ef4bc9f844e) >>
+>> endobj
+14043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 587.234 359.324 598.138]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 550.856 290.971 561.76]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aef0a1e3939a61e4689c395faa11ea2d3) >>
+>> endobj
+14045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 550.856 360.43 561.76]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 514.479 224.003 525.383]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a26f8f4c25f9c73d238537711374dc159) >>
+>> endobj
+14047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 514.479 326.696 525.383]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 490.811 254.15 501.715]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6bb5b7d9f8f287478c9d1e80dffe6f61) >>
+>> endobj
+14049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 490.811 338.263 501.715]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 467.143 284.585 478.047]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aac42e5e97960d9aa2cedd2b9dcab697e) >>
+>> endobj
+14051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 467.143 354.044 478.047]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 431.52 241.726 442.424]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa3e819067de141368f02ae0cfc42f707) >>
+>> endobj
+14053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 407.852 249.318 418.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_adc14d69a6aa5791d0c7f8a4b33e6555f) >>
+>> endobj
+14054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 407.852 288.321 418.756]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 407.852 371.519 418.756]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 384.184 240.62 395.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_add02f1e43203f711fb4ff5a3a2964c88) >>
+>> endobj
+14057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 384.184 324.734 395.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 384.184 389.5 395.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 316.724 203.075 327.628]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 316.724 296.324 327.628]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a48056bb9473b8c2019f402b21245d80c) >>
+>> endobj
+14061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.807 220.356 177.061 231.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+14062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 208.401 189.267 219.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.768 208.401 218.021 219.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+14064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.76 208.401 330.3 219.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a17e25309469009012f40ed891a2c3f01) >>
+>> endobj
+14065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.145 208.401 378.399 219.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+14066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.957 208.401 441.211 219.305]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+14067 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14071 0 obj <<
+/D [14069 0 R /XYZ 89 770.89 null]
+>> endobj
+14072 0 obj <<
+/D [14069 0 R /XYZ 90 701.36 null]
+>> endobj
+14073 0 obj <<
+/D [14069 0 R /XYZ 90 676.13 null]
+>> endobj
+14074 0 obj <<
+/D [14069 0 R /XYZ 90 627.798 null]
+>> endobj
+14075 0 obj <<
+/D [14069 0 R /XYZ 90 602.38 null]
+>> endobj
+14076 0 obj <<
+/D [14069 0 R /XYZ 90 566.002 null]
+>> endobj
+14077 0 obj <<
+/D [14069 0 R /XYZ 90 335.512 null]
+>> endobj
+14078 0 obj <<
+/D [14069 0 R /XYZ 90 335.512 null]
+>> endobj
+14079 0 obj <<
+/D [14069 0 R /XYZ 90 266.144 null]
+>> endobj
+14080 0 obj <<
+/D [14069 0 R /XYZ 90 145.866 null]
+>> endobj
+14081 0 obj <<
+/D [14069 0 R /XYZ 90 145.866 null]
+>> endobj
+14082 0 obj <<
+/D [14069 0 R /XYZ 90 95.17 null]
+>> endobj
+14068 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F39 2335 0 R /F91 766 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14101 0 obj <<
+/Length 2470      
+/Filter /FlateDecode
+>>
+stream
+x��Z]s�}���S*ͬ`|���t&k;馉׉��g�CK��F"���}/�)ɒ��t��
���������ηgo�g��x̑H��u�O�Ď�%.�7u�����ws}D�
oŗ�o��7�;Uwv=>���@v�6 ��;�����L��;#&}�c�h�p��p��~<�ƗꉨP?��x(I�C_"����|,�;�2:�8�g�Gm��߸�a�����Q�������pD9
��0
�����
�y����j��y8��Fq�q
y�ę*#��$Օ�K�(��:��~�,�(6M��j��V at 4��0@��r�o�Ǻ�5�"�7��4��&�,�L�*��<
�b!G��r�AR�e־ef��B�3��?���\d�!�
n���<��Il�~�e� ���7�uő��6����ۗϐ����w�M��
(C�
���I
̒8X<�̓U�ꋴ ��,��4
�][60x�L$=�l�@Y�۫��
�)��Ȉ��3�°���Ӷ��+��?p0H{c�c�
G�Cfx�(е�ȓ�Gc<�����$/���/��*�����z	LXP�ͪ�P,����
ӟMu��=��o͠5
5��A��
+�`�X͓
b�l�a.Zsj
qࠨ��vH����gH��c����Y��>��w�	3F(o��1�j�/.:"g�㰏Q8����+���E����p�*
Ԋ��� �U�[�
Y/7��q ��	0	٦(���4C�
+�.)�('������:�]�U�&�tw��ڥo:�	X��p��8L�׋Pm�.��4��oQ<�
d�Q/q5�?߼���Ow�
K*\�C4��t
w�жl-�}/�8��a���7
&�
��t~Z-�I��vz��[,/0
"�3|��S�R�X�ѐ����D
�u�Bk���g��&��<&y�,ˉ�8����m�o�[�g*�k����6
c$�
S@����Ӏ��0
Ph�J���f��Tum�-�

�]}��o���W5ȗ�P�c[�<6˶���[8�\�fA=�=j8g�|i�K@�z^��U�O��
�
z����g;;�`�׏��r��5���%�9��
�g�`b��x�H2ٯ�8�r�
�"r�
��p�8=���\B4
��:r��H�@
p�jF��
���G:ҍ¦#w�p��1

�>�C at L��N7%'�f
*n�M���E���y�Q	8r�*��^)�lW��E�<���D����m`	o���[�^�
2@�
›ʣt�ܡ��{d7C~��>��Ʈ��G�OTP�-�A)°���U�����s7Vx��/����(�����ǝ�
�v.������� ˺�*�W�wR��J��e�SY
��*��旇��?�~��w�_:�د�W���#�2�/�{%1�3n$�����i�!�I�R�\�W�-
�T�8Q�����Ɣ(�
:�̊(_�D���Y���t���%|�A�U�����:�׃P.�5��
c%����]�
�|Lv$�U�1��9
1g��V��3P% ����J��s%���s_u�p���\b�Ba��!�.�$��C� �Rd
ȷA_
�� m���Lx`�"��خ�tI�K�Jc��
t��C�+����m���b��c�>Ad�{��䶔���ƍ଼*�5n�g�:��}:���i��´��4Yv�
��
a�n�T�FZy�2LrX�ϕ�`�#��	���-A#���|�4A�P�
L
+�uD�
+{�G:�0Z^���m�u문9m֘Ho��qX��4�WDx��{�Lz�<!�NnQc��e�4�#��C}V����<1v"�8���t�B�2�-�E��-�9�Uy)��$���2�Q��
X?(�$�S�0;�����
"�7"����O<��&
��S��'�	��
��p�/���.rq}���w*\�:��S�*5ؗ aғ��D�rL�Q��B>�vmA
r�he��VN�����B�a�$O�y�A
�.��L_U���I�ꐱ�m���
���0��n��ad��I(CC��Ik� ?j't���S�.nWU�D?
UM
+�����\}
ey�nQ��껮r���	V�4Q�Q��]<b\���_B�O������,׿�x��3�uN�x��g��:��>	��i��U�}S��
n3����Ű8Q��!M}�T�]�\]��s���G ����S
�'�X�A�	�u�[+� h:"�Ͻ�����yѩ�,/��f'
��8�8x��� ��=�5��-j�a�$�N}����d�FG�ԍ��K�+�8|`�� ��v�/����Ӳ
�Q��'���WP����b�y��l�.*�wL���%s�0V���Qm�D�(Qw�
+% �%-;�Ar{����s�R76f��u	
�l6� �Wi�+��t��.,?�վ�V��7�ik�'#^߉��|uq~���ea<C�D��c�2h]�U��SyɿLҰ� P�,>�Op�� i�EE
+endstream
+endobj
+14100 0 obj <<
+/Type /Page
+/Contents 14101 0 R
+/Resources 14099 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14083 0 R
+/Annots [ 14091 0 R 14092 0 R 14093 0 R 14094 0 R 14095 0 R 14096 0 R 14097 0 R 14098 0 R ]
+>> endobj
+14091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.039 679.225 219.763 689.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.273 679.225 307.952 689.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+14093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.463 679.225 336.366 689.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+14094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.876 679.225 430.532 689.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Octagonal__Shape) >>
+>> endobj
+14095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.518 679.225 504.331 689.506]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BD__Shape) >>
+>> endobj
+14096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 668.414 126.642 676.351]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+14097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.68 564.085 333.036 574.989]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14098 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14102 0 obj <<
+/D [14100 0 R /XYZ 89 770.89 null]
+>> endobj
+14103 0 obj <<
+/D [14100 0 R /XYZ 90 654.84 null]
+>> endobj
+13794 0 obj <<
+/D [14100 0 R /XYZ 90 630.697 null]
+>> endobj
+14104 0 obj <<
+/D [14100 0 R /XYZ 90 630.697 null]
+>> endobj
+14105 0 obj <<
+/D [14100 0 R /XYZ 90 548.195 null]
+>> endobj
+13795 0 obj <<
+/D [14100 0 R /XYZ 90 489.216 null]
+>> endobj
+14106 0 obj <<
+/D [14100 0 R /XYZ 90 484.733 null]
+>> endobj
+13796 0 obj <<
+/D [14100 0 R /XYZ 240.245 403.466 null]
+>> endobj
+14107 0 obj <<
+/D [14100 0 R /XYZ 90 396.826 null]
+>> endobj
+14108 0 obj <<
+/D [14100 0 R /XYZ 90 316.297 null]
+>> endobj
+13797 0 obj <<
+/D [14100 0 R /XYZ 90 269.273 null]
+>> endobj
+14109 0 obj <<
+/D [14100 0 R /XYZ 90 264.79 null]
+>> endobj
+14110 0 obj <<
+/D [14100 0 R /XYZ 90 140.569 null]
+>> endobj
+14099 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14114 0 obj <<
+/Length 2302      
+/Filter /FlateDecode
+>>
+stream
+x��Z[�۶~�_���������$�i\'��q��:���١%���D*$U{�}.�H.)�$ʙ�	xpppn��-=�}�������y
+)I�7�������k��	F��L	�ؿ��G�:���P�g�LJx�Gwo��y�?����$-��t4zʧ8��ɇ����X�2��@��ז�%�O��(n߽���	�5��
d�r�dJ�gE�x�YEelG������~��a�����
�������+l�G�V	��|}���0���S����=N�+���߯����ET�n�Y��Z�Bs/ 
�XX�_}�Ǜ2�����%�
+z�'�c�
�JoL!|�A��y"��'C��w�1���ks%В.G=��ь�(l����}��=޴'F��“*�1{4E���Y��|���|
�����N�bG��T� ��]���`�~7=
++p��z��<�P�J�O(�{ۖ���hd
�X����;��-�)�|r�`iZb����v�xB��/�����s�ޮ�h���Ƌ~��z%oJx����Du� 4�h�)��69�=�#%jT�<�������T�U#W ���eW�F� @�����b
�����&N����b(
H��P���.�
��@dA�>���R��t�|�x���G
�8;F�vR��j�oX��T �
2Jٳ֔Q��e��e��o_�j �.��{�	V�Z�OՆ�M���|^��	�i^f`V��|�����)ء����a��#����oc�vU��_��z���n߼�������ƈ�����'�M
������I�J��C[
4��
�`�������*�'�VEЉ�S%��CD�v��d�p�Pd�MeJC��Oٶ�ܻ)�m�t^M���B(�1%��yg9��r���U&�7
�`���*q�q�>w��Ɯ!j�5i�U� :;!,Q��>ۦ
G���clI
Ks|f8s+�O�Q��%.�t�rK-��_�t^��68�l�
�RT� �:;�����#%|Zo����t�h{��͋V�,��X��/2ۦ���\�Y�����7��/
��G}��
�ꐻ���p8I�
����
�f=�0�rdze8��'S
�[�E
H����
�(�*J]ă�����c�g QJp��'��9��R�_�)��l{�^(�d31D2Ҭۆ��H���.
+�D
+�iK��<竬0��2+go�m?:�mMY�IM��'�3�C�!����𰁐�p�����hM�R�cqD��i��|���pP&`=��Β������g�!��Yb��h�Nw������yFv�^�
9D�m�d�ǡ$<��c��$\�	��p�;�x��@Б#�$
�g�$\H$��l�dD�*����i0IK��s�D
���|j���1�q�˳x
�I8ͅ����K�$p�C8��j�'ѽ�r8I�� N"�!�$<��SQ8���m��s9���]��}�,z�B�@���LY��
g[���^d�#�#���I�B�~d��s<Qz�#�!�5�/�0�*��� "�Y���w��5]�]@����= @�f�E8�"���]J
Id��<0� 

8�k��5da	: �N4����Z�)'l�1��!���^� � Χ���ϻ(�P��	@B���F�J0b�=:GS[2L�ơ#	�H <���rϸʝ)F�]�%ƬiD_
68]�as �,dc��
��Q��Q:.n@E!��g��kl-�f�ՙ�����B`� ��,�,& p�����Y�1��d���Tp�::
@����z�� O�R��ňx@��x ��!��?�Q�
+�(x
����x�M��Kx�ɧ6�?@��s<�'��y ��y7\�A< ,��k���+�
�k������
m��dS���˾�ly���߿�S]Br� �|�x�ap
��-�^�BԱ��y-�4Zݽ{�6���Q@�;� }{�����Z
��RCY�
�H��H`�p9
��^`dʨB��Z|�y��e�by�U��.��Fzzh��aj��4f2��L�EW����

6�	{h��Nn
�?4a���ְ���`CІ=4׆�����N~��j>��{˪7(�zPb�
q���9̪Y]RހBZ�]b��E2!~]4�}j�
�4��X�T�ⅫP@�s9WE�����fUع`�޾��q���3џ�t[ɧC��®Ԁ�M
��o
��.��V�{U��+�V;qH�z��P������e5(��_
]�r���޼����
��`PVU�n�ܛ���n�����J��f�|�&����k��-�M����:.
+endstream
+endobj
+14113 0 obj <<
+/Type /Page
+/Contents 14114 0 R
+/Resources 14112 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14083 0 R
+/Annots [ 14111 0 R ]
+>> endobj
+14111 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14115 0 obj <<
+/D [14113 0 R /XYZ 89 770.89 null]
+>> endobj
+14116 0 obj <<
+/D [14113 0 R /XYZ 90 718.682 null]
+>> endobj
+13798 0 obj <<
+/D [14113 0 R /XYZ 90 672.057 null]
+>> endobj
+14117 0 obj <<
+/D [14113 0 R /XYZ 90 667.574 null]
+>> endobj
+14118 0 obj <<
+/D [14113 0 R /XYZ 90 543.353 null]
+>> endobj
+14119 0 obj <<
+/D [14113 0 R /XYZ 90 477.31 null]
+>> endobj
+13799 0 obj <<
+/D [14113 0 R /XYZ 90 430.685 null]
+>> endobj
+14120 0 obj <<
+/D [14113 0 R /XYZ 90 426.202 null]
+>> endobj
+14121 0 obj <<
+/D [14113 0 R /XYZ 90 325.891 null]
+>> endobj
+14122 0 obj <<
+/D [14113 0 R /XYZ 90 259.849 null]
+>> endobj
+13800 0 obj <<
+/D [14113 0 R /XYZ 90 211.816 null]
+>> endobj
+14123 0 obj <<
+/D [14113 0 R /XYZ 90 207.333 null]
+>> endobj
+14112 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14127 0 obj <<
+/Length 2070      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o��~ׯ�өT��_���I�
�mRV�i`�m��HE���w���H��li��<$$��gv.;�Y8��p�����ŷ�EIe4��
�7HHx�G�ǜ�ɇ�w�#aU9���w��w�s�nt:}
x�#� R:�Z����
���0bFG��I��S�et>�i��,�Qao��KhHCBm�<R�!Ý4g���&^%E��2�K�
 �~��[�Ҿ{��vf�f����|V@�����H`�
fd�������&�
�(#l�������NIa�H1$n�!%2�#��6�L���쪈o�4^���6^�7E殗��.O�7
+Ëe5\a��	�O�&O
+�[]A$"G�;�
���
�9����@�0RL;K_e��2���_=������Z"�n��R�
�ܭ��p#՛�M�m�����`����!E
+�}F|Zr��ut��O﯒u���=Y��[r�$d�]򗧟~ž��tAE4���!(؃tP	\I�.k ��#
+	�al��zw`2�$��b
an�m�b~r�Lқ��"�l&\���nw��#�YH�@
p�U���D�

+�œb8�X[���Ɲ)D4e�ŵ��cn�u|�o�
� 9��{̮�>@y%Z��SR�Q� ��Z�jJ2!b
���ΧW��bu�r�r��y�`Ӳ�����-��T�B�KR� &�����D�uؘ<sw�t�%��{�H�� =����Hਊ���4�*�$Օa�r3Z�p��zB��:I��#*=>;?��`J�|R����`����tX<Ɛ���#���O6nk[Ց��m�e;�|�H
(�.�Ä`_���gc�W{u��)���9�1!������I�B Ğ�O
nM�_�a�'Sn4T?i^�|
�ᬚ����yY����{6����}���f��5 �SA��鎘�}�r�٣%H��UY�٢���2��>T�6�k�|�h��-�����=����0�΄�}��ūߞ�p�˛ٯ=Z%�h؈�ey[QG���~�\\-�������Dp0?� e#��v&U�Y5&ޣ�
���֒�y�1*=H0%6
y���V
.��.�W�K1J˪��Y
+I�V��0�ɶ��SbwiKhG���x�.қ��
��3�E��]z����&�s..�5�2n�j���}ug������i�O�
�
�u����>����
_
�p۬V��>���1�q�)O��)�Y��9n�;H;Ẋ�e�̥BX�@,��L��I%���N�H9z;і
�^w�����z;���	�j���A궧BH��
8-�S8��8R�~�k���8\�ac�`!����p�W:8��	C4h�
�
(f�����G��c�$�Gs�������q-���#��>Q���_�رF�c��s
��4��
���e/�aq��Ֆ���-�þ�� XE|H��-���������V�
�5һ�
�Ga��>���5�6�a���r���d�՞��a�X�
�}�xoR[rO��O��O}
+ᵏ
+i��,TH�
+�
+f�Q�OQ!�K���T�ֽ^f�=�A�!q��6����3+H����׬L�����ˊl�b6aP�
0#��'3#|��C̈FX�[�
����|��!�����D{�\m
]�
b���ґF�,���+��oY��͂�5M�7�-��"�"�������̌���!���e�
'
��b<���S+t����{
)Go�ْc�p���s
�ݰ; $W!)���� ��AyJ52X
�s
)R��5E
+�s
.𰱩�ʐ4��O�9��~O��<�
)̓�UπY�	�u4��:��y4�P����(x��������:��p� "W"lL
�����$p�g
�
o�եm��k�t��=~�]�D\
׷��_�Q�({�o�[DC”��G�&J��e�|Y��/ެX�:�-��[�*��T�����{����vQvv����9O6_L��c�m��U�ѵ-}I�@�U7	��&Ѷw�-�y��Mt��Q����
��L
+BnO�E�>y����&�����x�cnC�U�
\g'�
+�����Ui�*���3�
�r�r
+endstream
+endobj
+14126 0 obj <<
+/Type /Page
+/Contents 14127 0 R
+/Resources 14125 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14083 0 R
+/Annots [ 14124 0 R ]
+>> endobj
+14124 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14128 0 obj <<
+/D [14126 0 R /XYZ 89 770.89 null]
+>> endobj
+14129 0 obj <<
+/D [14126 0 R /XYZ 90 720.814 null]
+>> endobj
+14130 0 obj <<
+/D [14126 0 R /XYZ 90 654.771 null]
+>> endobj
+13801 0 obj <<
+/D [14126 0 R /XYZ 90 608.146 null]
+>> endobj
+14131 0 obj <<
+/D [14126 0 R /XYZ 90 603.663 null]
+>> endobj
+14132 0 obj <<
+/D [14126 0 R /XYZ 90 491.397 null]
+>> endobj
+14133 0 obj <<
+/D [14126 0 R /XYZ 90 425.355 null]
+>> endobj
+13802 0 obj <<
+/D [14126 0 R /XYZ 90 378.729 null]
+>> endobj
+14134 0 obj <<
+/D [14126 0 R /XYZ 90 374.246 null]
+>> endobj
+14135 0 obj <<
+/D [14126 0 R /XYZ 90 261.981 null]
+>> endobj
+14136 0 obj <<
+/D [14126 0 R /XYZ 90 195.938 null]
+>> endobj
+14137 0 obj <<
+/D [14126 0 R /XYZ 90 109.134 null]
+>> endobj
+13867 0 obj <<
+/D [14126 0 R /XYZ 90 77.486 null]
+>> endobj
+14138 0 obj <<
+/D [14126 0 R /XYZ 90 77.486 null]
+>> endobj
+14125 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14142 0 obj <<
+/Length 2485      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�H~ϯ��U�N�/Y�
+��e����˲5��J"�%�$�¯�t�ڲl9����>Yi�N���Nw#*&l�t��#�������b���rr{?1x��AB�_��S��2�9�O?���:��iF�4Y�>��4��1�K������<
�r���9La`���w�i-FE\(`ŭ��b���O��f|������B
�d~7H��U�e�9xz;3t�7� �����0�=
�
Mɔse�^����zE�
��BU)=Y��~�O�0�
��=yv��N��&���~�=8���=!DkT�"����](�$�
=z�R����n�8X;��>�J�&
�z4�Re=�.IV}�7H5&~���`��C��L�s��8(��O���M��ڛc�U�F
�CV��hS�}��

0��̽��[��,�8R���0A��o�d]xÿ�����b�H�,��a�ѓ91B\в�V�!'m���"�[34"�f䵇�AX�j��R��N��$n+
+r�73��`]�>̷i������!�y
��
u�(���j���"i�xH��k���ה��
�`K�z���D�
+�c�
�a�ߥC$�Ju4�Qш�:+i���H@�r���1ќ(�4�j�08����en�()��P����,�n�����:��]��M��!{i��3���G�]�]ĮO��/钴ߵH�q~�EE$
'�-*E�i�
!af�@ރ<묓�KH����S���_�t���a��,�� s�1UR�aH
Q$_"�!Q���B̗��1MfTL�c?4����5��e0ZF
�<�$���u
ŋd�	��nU�J�**�.�7
6�`�`�9.�?z�$��8jD�Cs�	���Cw�����MB�0���^ܵ�؏�o w�p�Ag��
��NH$T]��i� �=(�i$X��'+=�
�$�]{h&��QE|P5
18���Z��-�#��J�
�8�و�V�6KX��a�H0��G :�`2��o��k��\
+j��C�Q�h:��WcB��s�� ��F�cJZA���'B
O��Ɓe����L�O�	a�i��� �Х�c�6z��;�BN���������C�H4��`>�Z�L����@;�:�'R���-Z��~o��l�u�t#���nrWe]Q`߰ �r�}��(˳�UP�� 9�p���A�C�C�Ƌ��.
��j�Y-��e��mofsFy�b �W}�!8(���95�d���(�쳭�Ř�l6E�hǽ<�G��50�]@a�w��ڇu0#����]�2K �YbN2��������~��=��d�LB�0O�E�8 ̶N��}p�>iUk�<���Oϐ����
W3Ь}T�/���2�xJ,4�^
W@��H�w6e���<�����$�CKA$��U����1AD�7��{��ፗ
*��"Mڣ��ァrN+^^|b�^
+����(������3
�av�4���!xpf|�q��d �=0�><��� 7-���q���u4�
+2�_���j�;����T=w��"��ӕ٪�
¦����n��J�Mv�FS
j4��#d��]��<�ͤoh3�(Y}��@e���s�v>� �(GJ(����]�C�/���2�L���rp�إ�J�(� 0
% ���Cy��#ԇ ���eS��eU��[�X��_�M_W�A6�{�
���^�l���e�r
[��^��K���t�5'�*5r.�?�5W�™�5g��� � ְQ��h�֜j(�T�ٚ�H�ӚS�F�h����V�yG�[sO�Z󣢷>	��;	�/
G88�b{Èj�45���Y4�����O�v.Мx
pa�Ə�ib,�ƈ3��\�f�g�� M�Q��& ��׽
W`2}�!��h����~�͙�֖x&����� 
�+ShDkW�Ǭ�� Q�B�h-�� 4�H��i�)i�:���<Ih5@;�b��H���q{��h4�����$BS� B3T ��
�~�f.{���>����
m
�D�迳�v��U�T��[���ѽ�z4la���-��
�"��]7�6���$��'K��̠]�����7d��.�d#�!O2�8{+���mqPؑ�
�>1�|�ƽ�/br�
JCL�k�'��]��[1�is�y��3�3;W���]�i�B�a=w���Z�/|7fc6�{M�,�e�Vg��Ľ�����D��qu��"+�tw�d����lw
��7����Ej�m��N`iw��i��������/��'��ڥ���c�:ЁQ��`_Y�9|��J��v�>�]m�����v�����G�;W���);��b*h�A2�
+E��Pi��PY�ŧO��da��Ӓ��q}�f+Ca����B�
����sX]u(�Ϥz�˕3F�o��S�y������>da��e
��`K�����:�['i����8�/�[
�0��`�R�Я [0Q���g����
���M������?�-y?
+endstream
+endobj
+14141 0 obj <<
+/Type /Page
+/Contents 14142 0 R
+/Resources 14140 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14083 0 R
+/Annots [ 14139 0 R ]
+>> endobj
+14139 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14143 0 obj <<
+/D [14141 0 R /XYZ 89 770.89 null]
+>> endobj
+14144 0 obj <<
+/D [14141 0 R /XYZ 90 655.872 null]
+>> endobj
+13868 0 obj <<
+/D [14141 0 R /XYZ 90 621.202 null]
+>> endobj
+14145 0 obj <<
+/D [14141 0 R /XYZ 90 616.718 null]
+>> endobj
+14146 0 obj <<
+/D [14141 0 R /XYZ 90 543.856 null]
+>> endobj
+13869 0 obj <<
+/D [14141 0 R /XYZ 90 387.526 null]
+>> endobj
+14148 0 obj <<
+/D [14141 0 R /XYZ 90 383.043 null]
+>> endobj
+14149 0 obj <<
+/D [14141 0 R /XYZ 90 312.337 null]
+>> endobj
+13870 0 obj <<
+/D [14141 0 R /XYZ 90 277.667 null]
+>> endobj
+14150 0 obj <<
+/D [14141 0 R /XYZ 90 273.184 null]
+>> endobj
+14151 0 obj <<
+/D [14141 0 R /XYZ 90 200.321 null]
+>> endobj
+13871 0 obj <<
+/D [14141 0 R /XYZ 90 165.302 null]
+>> endobj
+14152 0 obj <<
+/D [14141 0 R /XYZ 90 160.819 null]
+>> endobj
+14140 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R /F136 14147 0 R /F8 802 0 R /F1 834 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14156 0 obj <<
+/Length 2797      
+/Filter /FlateDecode
+>>
+stream
+x��\[o��~���S+���/nЇ�� i�n�.��
Y�m��PT��_�3
^�D��M�V��9g�s�����
Ͼ������W��
2��������		g��s�����ogLjD�����_���۷�߾�����^�tE��'@ �g���?��.;È={.
��8e𻝽���.u�������P�1�)�N�w
��l���([2�z���
��]w��{a�f�eylk�|U��Ff&�D�SR�i��Gb�l��l�H�b�
u�
-(�|��,���.NTF�2R"CUW���h��Ϸq�2w
-��F�}�&�Z��߻����c���m���p��h��ςm�_��\��
�'��=�D�)��&�3�c�w�t
��]R?���(�Dd�<��ϊd8$��Ktx�
A��qD��I��b�-����!�i�x��Ѥsr�E�*OK<��%.���r�;w���j{��Ai��
�т��Rh�J� etX()���
�6��4M?�ښ�P�DI�����h;��
D
+X��`
+-сI�9&bc S2�qKXD(X�!p��K'��pj�g���$⸎dq��UR�4�~rG�i�A�ton��у�,t���s��C	DR.B�s���2fI"Z��z�q
=��I�$Œ@Z�Oo�����Ix�n�b(MĘ,��/9i�k�,��
+���B�hvf�S�dV
8 ^��|ss'
�_m���k��?@R�䧁O1G����=� zl*� H�:ej�W���u-�}�R�����MxRj����LTV
'=��@�
^"�T��;XV���V
�8Y���U
�mϺ*�!�`��H!dح9^�KH�<� �-��7��E�B�X4�$�u�����G����=d�4�Hab΁ϊfǢ�4w���C�����z��;w��Km����'z��X7(i%�
��/3�dSNV�gQ~�7*k6Dg 		�՛u
tl�AZ�+�SjSJ�b6g��+��#B�lY ]�H��dri���}Y��<=��M�
۱�(P.KiKJ�%&~
+6(��%�� �v���@���%���
�Dg�:��?=E�jgU��z���G�dӺ��{�LP��z
+��t[�+��.��
�;ۿI�$�G�w� x�
ep�o�h��gu�1�r�%?e���z����C�X�y1I
v�����z���%�
+�`$��p��+zC���K@�k
�T �N�k
~S�ۏ VOd�fZH\o
���hZ��/��
�]�e?�k�
��e�Q�(5R��'+|
+��
�����,%���D�����0�>���E�R��Vr@	�t�c���
+�m�� D�
T#��

�mv���o���+)���:J��g�L��E"k ?xd@�n
'�+��־�����/�U��e��oE��{<:$�6w���HC�U$��U���U��(�%��	�Ե�ػ]
��*O({9��@���,�4�������8�����ě!I��t��!��&�2�
���1^?dВi�(�%
��W�hXc�I�r?O6"����(�|���0���Ȣ�����ԉ���y�
x+��,�b��M̖��

vnȮ}p�E��mզIP�s�q�/g�&*��v��?a���c?�@$�!���
�F�=$u����_�BM���&���oE���B��P
+-�A	�=�xX(��_^HBMTď��"���oF�ƒH�B���KtP�1���啩�PP�T�2P
U���a�
;)�8�����
-�@&�	�3���7�"S��{f���UӞ��4%�����?
�"��U
���LO ���(����S=��[wå~r����!q����&�:HΝ����6�����譓�H�s��z�S�
�K���y
;zz�4(NB��%^F�2.�<8	
���
+��L���HC��-�SHX9���C��!-�H�#SG��
K%akv���o#I`ʃn��2�$,56�;��ZVN�X4�t��	
����
l�A�Y�'�h�Z�u��^u-V{t����b]�9
+� -���
kU�`�)� ,GB��`��a
��˻.mP'Bus���
���o&o*�
8`\t鉊�U�J�S$n�	C�kp�Z�.�kp��
+7N:��(ܢ�~��m���¥��pnl �˚o��6�<z��{h\"�.+���Rٓh\R�V#��


��k�qQ,��
���c����Z����o��͎���	FR�1�*3֗���*�J���T[��h~�xW�E���Q�J4����ػ1��L��_��eU�ٟuzƨ#>�#~q9ںdמ�>BU!,ɫ�� T�&G�*c�,�'vS�1�U
k
�	們��I�FX����Xx;�`v0
Ji�K���ќ������e<��"�%���~��2���i��
�T��Dsh���n��e�\
M�L�!�9M?�ۊ
�3���0$����A"!;��%: 	R�mxP$	%?k�4�Ϝ��JmM. 4��i�!�k/l�W!�Z�C�H�@�&�2�qjZI�0Js�.^N��KpN�u�H�rF:㧥K Rr��%^��̡B�
���A���E;V
D
I�4��9P(
��	heE�t�
�䴬��ǩy�ѫջy�����q�����y�3�P���� [...]
�6
�����	;��]��'�[:)�x��{������>J
��e��y�@
P
AT%��4�c2\�_�t;2�����c\
+endstream
+endobj
+14155 0 obj <<
+/Type /Page
+/Contents 14156 0 R
+/Resources 14154 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14083 0 R
+/Annots [ 14153 0 R ]
+>> endobj
+14153 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14157 0 obj <<
+/D [14155 0 R /XYZ 89 770.89 null]
+>> endobj
+14158 0 obj <<
+/D [14155 0 R /XYZ 90 720.814 null]
+>> endobj
+14159 0 obj <<
+/D [14155 0 R /XYZ 90 630.064 null]
+>> endobj
+13872 0 obj <<
+/D [14155 0 R /XYZ 211.842 565.814 null]
+>> endobj
+14160 0 obj <<
+/D [14155 0 R /XYZ 90 561.177 null]
+>> endobj
+14161 0 obj <<
+/D [14155 0 R /XYZ 90 466.69 null]
+>> endobj
+14162 0 obj <<
+/D [14155 0 R /XYZ 90 351.631 null]
+>> endobj
+13873 0 obj <<
+/D [14155 0 R /XYZ 192.853 287.382 null]
+>> endobj
+14163 0 obj <<
+/D [14155 0 R /XYZ 90 281.364 null]
+>> endobj
+14164 0 obj <<
+/D [14155 0 R /XYZ 90 200.212 null]
+>> endobj
+14165 0 obj <<
+/D [14155 0 R /XYZ 90 109.462 null]
+>> endobj
+14154 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14169 0 obj <<
+/Length 2822      
+/Filter /FlateDecode
+>>
+stream
+x��[�s��_�����	�o�n'm/�$יkΝ<\nnh���J����} �
��D�)��E��]෋��"8�
p���_o��~�X�PR�l���HH��	>-F*\��x�aI�"��їK����>��ї��m
�O���u��E\Vc̟<�9�X~����t&��".�b������,�G|����'G!�1�L���.*��
+��Y�t�vQ�7?��8_���5�"���z�����18 n�R:X�>}��^�`�B
<�A��S�����?�pw�%
�:!���}�u&P�7��ڂ_0f���3��P�zLy�nLo.X,�D=����f	�'���
ɂ L����
�1�r(:�J�p�
�M�q_�y��^ǻlI��q)��gnB
+��n�]{fg
I†��qy��z�(�x&��Ӭ[�n��>�B���G��HP���TӯЊc
�x�T�B���$M���G&爵
��w�tO���kpWdq
� 
��w Ɛ�&w�V�"�u' �t
��g�{�P=p��

+)�
(�
�4����p	�z��=�� o
�6�v�( ����K��%Hx̮�c��#|��8���k����+Hn�~�/Wvu��E��\>���$����;�&�E��
4C�/���@w �F�%
#Q��%��\A����[]t��i陚����M:.�<,3�T�@�WӐ

��6�ن��l���Haea�egM}v�D��;9c�,fr�h��ܼ�!�g�u3 ���@5,^�u
d�e��oW
�k���wq�QYI�E�p�
d#�Hd��w
a�
p,�P�:Vsf.A0N�*H*'�'{���A?T�~���w�Q�=`�-�����Y�{rO�����O d� ��(ܜ�7S�U{>�¨
�cL�;GC�G�� �W
��eG
+��c.�G�U�=���Li5y�O���o �����
+�[^GEu���C��@`�m��WcH�;T���5����G���>�c����	
�qcF
Gp�W�7�&hh�:�?
ʆT�?�H(�@ ,�nNT�X9
楡�dQ�%?{3<���h~�n���o��S��ו�HBA~@�g��'G{�0�42��մ,6�B���	a�Rez�"R����275�w�i�� Tt�9G�>o��lj+_(����e3���!l�s;��͠?_GA �^�����2��<�D�g	DA�y�̀OCPJ�y��^�`�L?���4`N���د��� ��6c|�A�a=3bin�K�� 9ʬX
IL	�$�.��&
�6q�A�{54�m���
�4s�in�ML#	�o4A��,�"�ճ��$�.�e��*<uu�:�/�(f�?�M�.��b�+���z�A���2�%f�d:':���I8bb�2��c���
]�r$�Ҧ����H	��*��}
�r���E�e|�MqX��xS�|J��c�۹
4���;W�e�dC�e�
�G0��z��<v�:��eK����T�zU�YSq<B��|��=,HL��gK��u½c�0���\��������D�xBr��F
�߶���k�
+2m`�CLdg�D�d(��]G�}�I����q�=
_E�1�w<t�S����$]r�{�K6_ �cjq�8-��b�4f�Z
+� ���T� �R
3�^�Qַ��>w���9*=�%�N^T�iJe�<V"��<5��dueg����{�����v7����l������5ϗ�m�rF�T�H'ִ�f�4�g�aI���y�vbM�9���zE�.�ZISh%�B�X'<���h#� ��s�}X2Z9��$j�>,GB�>�ibD�}�m���&p`:~
��f觞��
0`\�u'7|�N.0��N.�j����n�G^���[��r�G1���m/��vq�}\��:
+L������Fa@:�
[{�
D>M�$I*d�3S�������r=e.�xO�s�e@�_g��	
�m���2�|���GZ��DC ��~JRS�|��H���_�8�Cd�ڍ� h�
+��m��0^� ���Ⱥ!�2>�Q㮃�j�
+����g-az�A�9D�
�ƈU���>��vs��LRM[��ཁ����4��V��
���۬�� ���c�i�p� ��`
+*�}*X����ht�K��������U=��U
+1{��E]B +�3@�DRʹS=�D弩�+ȴ�
�
+Ar5g��yI�gn^�p�ToNK�To`ꙩ^�ұT��E�To�
�v�t2;�(�;��]K�l^��@���R��z���Ҕ#�4I��jX�H��)m�gu=}=5�oG8x���j/�Y����M��;x��P��	�A�
+^���+�O��4��VӋ�|$?�b�ڵ��Hz�����Ghj{g�������8Yj���E��˜�$��= Mq{T�"<��{Z0cZ � ��䫅p�j*-P]�j��m����B�����
+q�����>�9H�B����Рe.T���@u��	Z���Zq�ݴ�:f]�m���.��pj�ۗV����1SW
�`J�����t��-�:�0�ػ�`��%����e�����p���҈W�i�=�!"Z���;"/a�Nw��l�~NKkv?0�Lv߳�wvo����5�BT[Z1�[^ ���ɓ���ۏ�O�`'@	����+eÛ�>�w�*��OK!��G�����ԕ���+P��<��DA�R9^|��*D:���O?�[@�:Da8���,�߾�=�qz� �	E��,�9?��ճ}�7������@5�lp�	��֫
�ve�4�_���X�a����{�=�Enw�7�Z�
+endstream
+endobj
+14168 0 obj <<
+/Type /Page
+/Contents 14169 0 R
+/Resources 14167 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14178 0 R
+/Annots [ 14166 0 R ]
+>> endobj
+14166 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14170 0 obj <<
+/D [14168 0 R /XYZ 89 770.89 null]
+>> endobj
+13874 0 obj <<
+/D [14168 0 R /XYZ 211.842 699.155 null]
+>> endobj
+14171 0 obj <<
+/D [14168 0 R /XYZ 90 694.517 null]
+>> endobj
+14172 0 obj <<
+/D [14168 0 R /XYZ 90 600.031 null]
+>> endobj
+14173 0 obj <<
+/D [14168 0 R /XYZ 90 484.972 null]
+>> endobj
+13875 0 obj <<
+/D [14168 0 R /XYZ 192.853 420.722 null]
+>> endobj
+14174 0 obj <<
+/D [14168 0 R /XYZ 90 414.705 null]
+>> endobj
+14175 0 obj <<
+/D [14168 0 R /XYZ 90 331.421 null]
+>> endobj
+13876 0 obj <<
+/D [14168 0 R /XYZ 90 240.641 null]
+>> endobj
+14176 0 obj <<
+/D [14168 0 R /XYZ 90 236.158 null]
+>> endobj
+14177 0 obj <<
+/D [14168 0 R /XYZ 90 153.497 null]
+>> endobj
+14167 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F91 766 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14182 0 obj <<
+/Length 1842      
+/Filter /FlateDecode
+>>
+stream
+x��[s�F����K
��~�t����4mS7�Ӈ4��Xƴ !����H+	��\�Oiut�����
�^�~
�Ξ+�d$����3�S� !�ۭ���
�
��Ԉ	w�����jt�jt�\�]�z�z.a�X)�M�7o�w
�_z1���t�����ܻ���Ù.�'�"9L>2

)i�
˜{�0�����5`�?��Y0M5��<{.qI�Ha�
)F�p+bt?[
�T��b�hn�D<���)^�!0������]�<�
+�$ϗ�"��~��
��O���Xu
�+�
G�5daE�0��2�!BC�1���b9Ǚ��qED�\��3��+����#�8^��E��W���#�
�~��	rI�7a8���l#p(L��r at q?��ʏ����?�5J(�1M��J찅r�E�-���'a�g��z�o
%2\���*���I".�!!`�8����V�$!-q�H�6�����,y���
+�@�R�7��U�C��6�A�be���uζ~���!�����گ+Bp=.,����
�� 
�Y������
��V���I����Q�@kRq��|
X�N�b�
�3%fA�U�s)w�K�j�d�j��"�E,�����!S����ؖ�=}
ƂY&�2��6^۽}���$�SD@ߣ`b�I'��
%%���	S�xz,6�I.����%�I�"��J"��4�q�	�|�$�N�j�`���I���o��!�8��g���t|M�
?�
+sW<(�!�Y���9i�W,e�C�QM��	�
��1tt�Ɍ}���.!$�
D�*��0Ig��i����ȷ���2�����,����8��̳Ka�w�E�a�A��
�A
���kL�!;��cd6�d"
n��WȊ����l +��&t��w��4�(��-�A�j�
��G��*�f�x> �ֈ��
*� {'�Ҵ1(ԭ)ra;�D�pC_�:���:nH�A�B?���e`�%�cW�CJ�I1OB��[�0�C��t:.N 3�<������J"��<���%��4缊�r�c���
z�tw�Ih�-�|]���l=��XW@���i =�heb�
�Ll�2����Y\��ASH��	�
DBא��9�>С���l�.���f;� �HC��:��@
�D�aߧ�C&��.�e�'�N�c1Z��Y�*��
��5�p݆Z�s';HK
DZ<�t�IK��e;�}�W�`d����m��m}��T�X�f[J+��R

��tZW�I���`@0�+�u�'���!��9
��a�A��Dt�RO 3�!&44�%
�D
C0��3���
�*�
C�����+l���0���(�9<x�+
+&��
�i�
#�|HZ����
���?��4Dʐ.�ljv��1�q
�$5�#�`b�-�i-���L}��3u��r�A*���
u���O�=T�)�l�'��ʣ�嘋.��$���^6#�aO����S1�@�q,�,���.����.O�=�owE����ݾ�
%�{(aH(Y�
������$!RJt�=N����Fk?��5F
0����gR>��R��������q"�O�?¶
��ȇ�4�O�>�4ѬӦz�)��֘�.ѧ$��!�V/��O����S1�@�q,�\v|v��j�?o�

��%�Ҵ�7��d�{V~֑#_Q����?�)$L�
�;x&J��b�8��ߓ�8�y���B�7yÍ�<�5D_rK&
+�Ͳ:K���_���+?�n D?�[����xn��In�K�, �I��2�u2E� �^q����^mu��P��^��%�F|��q�<?;�YOW~0E����xs�10Ƌ|���]�yf�8�H�0���?$��HXk
+endstream
+endobj
+14181 0 obj <<
+/Type /Page
+/Contents 14182 0 R
+/Resources 14180 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14178 0 R
+/Annots [ 14179 0 R ]
+>> endobj
+14179 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14183 0 obj <<
+/D [14181 0 R /XYZ 89 770.89 null]
+>> endobj
+13877 0 obj <<
+/D [14181 0 R /XYZ 90 681.591 null]
+>> endobj
+14184 0 obj <<
+/D [14181 0 R /XYZ 90 677.108 null]
+>> endobj
+14185 0 obj <<
+/D [14181 0 R /XYZ 90 606.402 null]
+>> endobj
+13878 0 obj <<
+/D [14181 0 R /XYZ 90 571.732 null]
+>> endobj
+14186 0 obj <<
+/D [14181 0 R /XYZ 90 567.249 null]
+>> endobj
+14187 0 obj <<
+/D [14181 0 R /XYZ 90 494.386 null]
+>> endobj
+13936 0 obj <<
+/D [14181 0 R /XYZ 90 459.716 null]
+>> endobj
+14188 0 obj <<
+/D [14181 0 R /XYZ 90 455.233 null]
+>> endobj
+14189 0 obj <<
+/D [14181 0 R /XYZ 90 382.37 null]
+>> endobj
+13937 0 obj <<
+/D [14181 0 R /XYZ 90 347.7 null]
+>> endobj
+14190 0 obj <<
+/D [14181 0 R /XYZ 90 343.216 null]
+>> endobj
+14191 0 obj <<
+/D [14181 0 R /XYZ 90 270.353 null]
+>> endobj
+13938 0 obj <<
+/D [14181 0 R /XYZ 90 235.684 null]
+>> endobj
+14192 0 obj <<
+/D [14181 0 R /XYZ 90 231.2 null]
+>> endobj
+14193 0 obj <<
+/D [14181 0 R /XYZ 90 158.337 null]
+>> endobj
+13939 0 obj <<
+/D [14181 0 R /XYZ 90 81.969 null]
+>> endobj
+14194 0 obj <<
+/D [14181 0 R /XYZ 90 77.486 null]
+>> endobj
+14180 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14198 0 obj <<
+/Length 2207      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~ׯ�S#�T0�O��6��l.3NVy��xh���H�Cһ���7H$%KT�>�&�8W|�ƈ��!���	��p��br�V�� #�
�����		��S��2�9�OofO�t���(�n�/��*
o���0}��v��$Ϣ�
c�9J����⻫���&��".,���n��
��2S��y�fх��5�7a�]�Y6�S������h���=�9�����(Y�#�)�rA,���b�DŽ 
�S�@J����G
���w�bft��	8ep]�'?M�g�B�����5�G
Y�?�ֹ�MQdG�
�B��j@��%��J�M�V%G���7
��V�`vF��Dyy!�fHWmjm��*�(g���c
Dq����$�!�
Ҥ'u�G2~3�;k�Z��׏a���<N%�R��<N
�Bz�[nW�
���͍����g�m�U�-�95Qe�9@!
և8Y�I���/Wo%n��k$�pW�����4)�1tF�wq��
�w�r��~���Q�6
����Řu,���h
�q��x
��z� a��U!	����wL`����_:�5�^e��:0�]��� HZ*&{^����.�	�"Ҭn.!�|���v��x`-��+�(� �
TS��
����V���
˛�c���M�T{��I�;�>g�h	)����I��锑�t��>�N��|�Qykյ�i�d}V�3
��p���5.\��tՑ�E
��dva�
Gb�P��
fg�='���%:.i���w�$�^�S)H�.ᕸO�]��HP�d��7��C	��\��d�o;�
c�vD�#�r���Tf�Z]
���fU����v?VK�c�ح3Ѕ�(`�͗e��`)�����		���=��
+���{iLD�	��ؑ��W��a	\�.��]
�x�J!ٔ iܷP\dy[+)f #I��u�|u}
'3����u��
�SӇ�M��e��1ż�����<C4��
+��D����<I��vF��s�$��LyL��#���
��߹ܣ�̓AL��d��<�y|��а���S���A�H��9��4��B���B_�V:T�q�Jk���07T�"�����ʉ�C�B�+��@������	�M@>�
_�49�8f!0/��Hgi
+TB#L�_;}�@�
�.��J�N��!��#�
`X}<+���>+y�����<��|I�F�|�㼮�|y����V;�{��&W���p[
+T�P�`1:'���㦾
`��CM����u󑔤�ئ$�hF¡,g���HF��"$;�V��_�.>����#\�
>�6r���Ş��#Ť�A�@e|((a7�̧'5�>m�ۇ���Wj�Mݐ��T��3������ɦ�Fۈ7�OG<�k8���$�V��k�H>�����%J�����u���+�%iK���׀�!OZk	v^K�3�݋MwRr�9�J	�9=*)�4�x=h�G1ly"�[2�<�,�[�Gpe�`����η��<��# �d�f� 9�TYK�N���uXr� +���L�����c8��
>���
��GG,��
+�sJ�����B����[�ԯ)")<<s�~/%2T��XtDA��,�w���,Z5g?��[nwh����!M��R=�7��x�F�!������d�jX�
��z�"Ɗ�ij�쳶 ��ڣnM�볎)iU��zb�Փ��g]
}{V��tk��@b:n��,̃���N�������&+9�d%�6Y酛��&+
��ʀZXcqv��	�ٽa��OY�_؄�To����K��!��
�9��+�\�ui�b��+���a��m֎��<���>��-O��l��`%
+tW%��r�@��JF�u�#
ƒj��8U�j&�T��U�	g.��N���̪P���qZ�>�(8}���H(r�t��_W�ӌ^
+,��Q��0]D�b�o/Z�������j�1%�j�
QO�	<I��5Av��=��U��8�p8ݤ�qF�7��gavm�
:�H��GY���+'�`;ɫ���F�l=77?��_�(�j&Ĵ܂~
��p��-A�4#b
+��=$�<���t��
��(*��[��Au����f9Daě��c�?]_]�=?dQ��E�fK�몦hu�l��<2N��&�y
U��*L�p�J��?@��(E����e����ջ

��%�����Z�
+endstream
+endobj
+14197 0 obj <<
+/Type /Page
+/Contents 14198 0 R
+/Resources 14196 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14178 0 R
+/Annots [ 14195 0 R ]
+>> endobj
+14195 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14199 0 obj <<
+/D [14197 0 R /XYZ 89 770.89 null]
+>> endobj
+13940 0 obj <<
+/D [14197 0 R /XYZ 431.18 659.423 null]
+>> endobj
+14200 0 obj <<
+/D [14197 0 R /XYZ 90 653.406 null]
+>> endobj
+14201 0 obj <<
+/D [14197 0 R /XYZ 90 582.077 null]
+>> endobj
+13941 0 obj <<
+/D [14197 0 R /XYZ 90 547.407 null]
+>> endobj
+14202 0 obj <<
+/D [14197 0 R /XYZ 90 542.924 null]
+>> endobj
+14203 0 obj <<
+/D [14197 0 R /XYZ 90 472.063 null]
+>> endobj
+13942 0 obj <<
+/D [14197 0 R /XYZ 90 425.438 null]
+>> endobj
+14204 0 obj <<
+/D [14197 0 R /XYZ 90 420.955 null]
+>> endobj
+14205 0 obj <<
+/D [14197 0 R /XYZ 90 352.227 null]
+>> endobj
+14206 0 obj <<
+/D [14197 0 R /XYZ 90 298.538 null]
+>> endobj
+13943 0 obj <<
+/D [14197 0 R /XYZ 90 263.868 null]
+>> endobj
+14207 0 obj <<
+/D [14197 0 R /XYZ 90 259.384 null]
+>> endobj
+14208 0 obj <<
+/D [14197 0 R /XYZ 90 190.656 null]
+>> endobj
+14209 0 obj <<
+/D [14197 0 R /XYZ 90 136.967 null]
+>> endobj
+13944 0 obj <<
+/D [14197 0 R /XYZ 90 81.969 null]
+>> endobj
+14210 0 obj <<
+/D [14197 0 R /XYZ 90 77.486 null]
+>> endobj
+14196 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F118 2438 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14214 0 obj <<
+/Length 1964      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6��+�j��`\���t���$mSw���LF�hYSKr$:n��|��IJ&�4+I$x����9W���h
Q��ۀ�����dp�R�����&7����H��fѻ��l�a�:���
+�J/����������\L���h�$�D����4����81�&zL-#�8~�EW���[Y�"
{+  ��@����1PJ�I����&�[��K�>j
Ś�Fx�ha����x5]ƣ1zxyu1��T-��#?�`�
+�ň/#&���,��5XB���r�(\%�8���
>��P����f���{'��o���7�{J�*~�x��I����8m���Ɩ���	B-����Hnk&@(3A&8)(o���j�l��)YP�����0�T�m4��V���O;{d�%�ǫ�[�ߚm7��o�?�3�!T�y��
 R��C��E���T�2z
���1ô�&{��֥��4�Ϳ�{���bY]�!R���y� B�&&�
�`g/��<�q�A�̡�fb�nf%��nf�y[���_���s
Xf�8E�e��t��#�7#���G����Ļ��Mwo��*������*R)�5��E�3�F
+
�p�ZPqt�6>l���
K4:XqK��pj�+P�Ⱦ��cU)b���1iL�"�?�
��,�v���q��W	i7G�"�Üf����&d at uF�͎�U��IE�(`���p��u|�,��ywD�I+�������
�%'�L�L"���t��O؇t�U ��X���&�n�s�q�`$�6���dv~�G���/ӻ���t3�z8p��
��
+b�Q���A,�o*��I��T��X�o��v�
19|\���M�&�
+�8��������jV��u���
��M^�f
t�sj�X]����d��.>T��8r�'2��� ��
��}0j�
{���T��6͂�ѮY��#5
U'�,��4km�!�bw�e:��F> CfB��Ҽ�|�dc\x~G^0�<ī��=�z

�Ba�p��Թ�P�`(p��*q3�y�R��m;
+�]�8�P�H,c�T��S�V���u���{�(��׽T
��#i���~!��QQ�
p�c\�<8)�$
��� 3%%B���Hj&���$�*'�0��$Bs"�
FI�Y0�=C
F�lh
!��.t!���2Dbj<�M������&
l{^:��=��`����n=����SX�s�a��
H�"���Mz�����(Q�s6��`
d7���Q�����Fo�:Do�Q-YC��ג5��9�%��s�M[S��������הŐ־盚�8)���
+N
VtoV�Vɽ�,ݱ)��q,�������\^Q��
��/����A����
��aר�a�q����M��)�?HMua11���T'U��P��2j���2&5�p�&lwk��/4!�3��
\qV��
+UX:t�4˘��D�.l�O�Y��ᚰ!
-$Ϟ�
��UC��
���`���1�
$S2hZ��<�R�B��|�R�IU
+kQ)�ݤR�9R��7a�1MX�	�z�
�Xѯ	��!<��x�6sPކ5��
+���N"���aq��s�B�)�?Z)`hI���o7�F���-b5�Y<��J"�ἓ^0�p�r�`��^ �����w�S&���
k����C�&a��Cz��2j傷�IcdzaQdN���Qڠ�ʛ
��
s0`�tF|�4 ��,�! �a9�	0�������>� �h
��i����`�Ԏ�����4�@v�B
�x�hsP
y��c�|u��o����7�������DCHeY���Yw����1�?�M��/ȱ���>�<�f�����f�L~��ՒG��l7F�����T�,��Kw���?�./�Ⱦ��ƛGR������az�}w����>���"�����O2s�Wq�W�lm��K�}�FveM�a�<�M���O�m���Ƨ�v���Cd�:e�n�.��b��Sw��\�%����
+endstream
+endobj
+14213 0 obj <<
+/Type /Page
+/Contents 14214 0 R
+/Resources 14212 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14178 0 R
+/Annots [ 14211 0 R ]
+>> endobj
+14211 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14215 0 obj <<
+/D [14213 0 R /XYZ 89 770.89 null]
+>> endobj
+14216 0 obj <<
+/D [14213 0 R /XYZ 90 660.006 null]
+>> endobj
+14217 0 obj <<
+/D [14213 0 R /XYZ 90 606.317 null]
+>> endobj
+13945 0 obj <<
+/D [14213 0 R /XYZ 90 571.647 null]
+>> endobj
+14218 0 obj <<
+/D [14213 0 R /XYZ 90 567.164 null]
+>> endobj
+14219 0 obj <<
+/D [14213 0 R /XYZ 90 494.301 null]
+>> endobj
+13946 0 obj <<
+/D [14213 0 R /XYZ 90 447.676 null]
+>> endobj
+14220 0 obj <<
+/D [14213 0 R /XYZ 90 443.193 null]
+>> endobj
+14221 0 obj <<
+/D [14213 0 R /XYZ 90 372.462 null]
+>> endobj
+14222 0 obj <<
+/D [14213 0 R /XYZ 90 318.773 null]
+>> endobj
+13947 0 obj <<
+/D [14213 0 R /XYZ 90 284.103 null]
+>> endobj
+14223 0 obj <<
+/D [14213 0 R /XYZ 90 279.62 null]
+>> endobj
+14224 0 obj <<
+/D [14213 0 R /XYZ 90 208.889 null]
+>> endobj
+14225 0 obj <<
+/D [14213 0 R /XYZ 90 155.2 null]
+>> endobj
+13948 0 obj <<
+/D [14213 0 R /XYZ 90 81.969 null]
+>> endobj
+14226 0 obj <<
+/D [14213 0 R /XYZ 90 77.486 null]
+>> endobj
+14212 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14233 0 obj <<
+/Length 2424      
+/Filter /FlateDecode
+>>
+stream
+xڽ[[s�~ׯ�S#�T0�O��6��$ݴN�d��d<�E�l%R!����� �B&%Y�w��4
��9�ň�``��v��+<���\�W,0�H*��}`p��AB�_���`��lN0�ӫ��0ۄ7W3�����!Zf�͇�6
����r8N�<*�9���(�����/��Y�2��P��[�/��X�2Sϸ�~�裣�
����f
��lN�.f�N��v
Q9�Ste3��QrCDS2�Y��w��dp at JU	�tp��|�
K�
Ť�ܤM�)��:���8��
��
��=!DkU�̮�_�|�Ԁ��(��H��B��zB񼍒pc%�dH��#�ĎV=��!i�~�Q�_��_#����n�D��gd�KR�|=��f��e��1M����lÔ3�f�Pd�i\�ѹe

�k���x�Y�c$%eQΐ�׼K�U�h}>/��7,�e"�3,{�a����=��
a�FZC���9�Ѻ6�����T[Nw� "�w���4������:�]���3�Z#��9�������� �C���⤒Xt�V@���y
��pʛ�KKr]�x��0�8��<���������Cܻ2C�I
�S���v�	*�Ȁ�|����P  q6E�i���}�֜���G��n^��W57��D���C�m)"bL đ����2j|�eLv-N8�|ρ�BTϛ��E$��3��
�H�
U>����}����G���>�|7�DI���#�D�
q��$��cz��{��e����1�1��*�}���E
�w�
c�@��Ͼk��*���2�cy�;x�]���I7 [...]
:t�>j�o�Z�ރZ01P
�ǁM�Y��
 --ØE�
+���<
�TS���'	��&`~�(8��<���fJ������$����.�����U�jȰ�>��`����K֕�U��?};	>�	w3"���8Yf�m3�B[
�e��i_�"��ᣤ)�t�R
�s�fQ���J��|���n.0���ӗ��5��O����M!Ú���ٜ���<�WI��Z5��<�[f^*d� �ip�����b�I�B���Y
+�
C���ǘdt��9�
+b,8&�J Uo
TNw���G/��h H;^�{X�oO�z��K��-�B!�K4�
+�S1�S�L�u(�C��R��B8�q3j�3>�2�HYGD!
�����PȘ��(dG�Q�'�
+�+��B�
�
�jc#I�\
J;���wR�1��z��n������cp̓��i�
`����}�)
 &L�c����oz��ad��A=Mdu�0�

&@x	@�?z袕���[[�����jL`��t��b��� L��!`C
�l��GKj �0([z��ݞ����.� ˭���r/��j�܌:�P�?�>�M�����'E =
�.�� �,
��E5�6�{�`��A�M�  `[9xl	�/
��M����UG���2j4�{z$ qI�a�[-ڦ��Q1g2Ӌ�<fZM��Ea��":�%�̘X�t���EB�q2:,�B!,�����,�Q0��\��#qQ�b�4��E�kw at 7,Q��Z��aA�@�'��(8�!H�ZB���(8Q)��J�iR
�FuD0�(w��M�5B����!�K����e�Wi��C.���� X��#���n4
�@Q	1n�8��A`F1@5�L�%0��'FQz�IJ�f��-0�� 0�lI�+Ό���۞+g c��Kjq�=7�վ��t�w���R��*W��_u^_k�H*�煤�X~o'��_ho�)v?j0a�Q�N�L�Ib��(�YZC�t�����[z��F�:(d�S��� 4��q�|S^�����J�g��
�`��r����#t�M��_��|���>���w�_{\xN	�#}�
>pѭŻ��*�x�~�z�x�PD50���}c1ƕ<�B�m��2K����n>�T
zc#׿���v'mu-�bWQV_�J�e�@��_u� �ݚ*���/�3	���l�G���\�.ˎt׏G�v�
+/R�L�H9m��R/��Xj��&�
o�u�f;!�A�aⶭ�?֫4�������0��
;�NCƼ x:���_'�~��c�+Am?m��y�U�k8F�X���C��s
e_̈́��t�&��Em��d
�I�m &�f��I��
:��n�K���o���<زCTYp�$�P�ˋ���U
%+
�2Owdp����G�I�;[q��!���x&HJZk��嶃�_���XX
\|�a�?RPrk���ׁ�
+endstream
+endobj
+14232 0 obj <<
+/Type /Page
+/Contents 14233 0 R
+/Resources 14231 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14178 0 R
+/Annots [ 14227 0 R 14228 0 R 14229 0 R 14230 0 R ]
+>> endobj
+14227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 522.276 212.124 533.18]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+14228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 348.751 210.103 359.655]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+14229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 245.343 485.603 257.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14230 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14234 0 obj <<
+/D [14232 0 R /XYZ 89 770.89 null]
+>> endobj
+14235 0 obj <<
+/D [14232 0 R /XYZ 90 658.004 null]
+>> endobj
+14236 0 obj <<
+/D [14232 0 R /XYZ 90 604.315 null]
+>> endobj
+13949 0 obj <<
+/D [14232 0 R /XYZ 90 569.645 null]
+>> endobj
+14237 0 obj <<
+/D [14232 0 R /XYZ 90 565.161 null]
+>> endobj
+14238 0 obj <<
+/D [14232 0 R /XYZ 90 496.433 null]
+>> endobj
+14239 0 obj <<
+/D [14232 0 R /XYZ 90 442.744 null]
+>> endobj
+13950 0 obj <<
+/D [14232 0 R /XYZ 90 408.074 null]
+>> endobj
+14240 0 obj <<
+/D [14232 0 R /XYZ 90 403.591 null]
+>> endobj
+14241 0 obj <<
+/D [14232 0 R /XYZ 90 322.907 null]
+>> endobj
+14242 0 obj <<
+/D [14232 0 R /XYZ 90 269.218 null]
+>> endobj
+13951 0 obj <<
+/D [14232 0 R /XYZ 90 222.593 null]
+>> endobj
+14243 0 obj <<
+/D [14232 0 R /XYZ 90 218.11 null]
+>> endobj
+14244 0 obj <<
+/D [14232 0 R /XYZ 90 135.424 null]
+>> endobj
+14231 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14250 0 obj <<
+/Length 2482      
+/Filter /FlateDecode
+>>
+stream
+x��Zko����_�O����a�ئ�E��u��"�D�l%RK�N��{�CR�L��@����px�Ν�8��4X4���ϗg���$�\�� ���!Q����Tr���@hKX��V5���w�o�]�w���\��z���
P��`�9��

P"B|�&m������_�h�K{%\�[w�5
YGCJe`� ��ڼ�ʸ�d_��7�v^e�3\��Nn�<N���t����q
�ۤ��4��l[&�h�����M�Gi�_5�JO���N���i-j�ԃ�UG�4Q�5�<�l��'����\sµi�B���B„jf|���O����7�|{��@+�����[�g�=��
/��
'���%�����拱�ȟ��7�wn�0Ú��g�0�H�L(�qm�YH9�x��r@��P�y�O"� 3�Un�\N�dQ[O�]#���x1�8�$-����L�|�s

�a
Q,
�[_�������LԮ���"w^�m�sie
Q8�H0r�<l��~�I-5D	bE}�E��V��(+N���D�_5�ҁE5l+O�(cboQ�A����$���q�_<t"T�Y�}gB)"�E�b$T�?�V
� �k�B��pT�#iQx�2D�����c�I�'��:.>�o����v�7/���W�s�КNtQ�t
Y|5� wh��6�}z���bP<R=��G'��O�����Ɉ�-3��y�c.Xߴ0'�U���9�މd�M1j�Ί"��*���2Y]�qZo���(	w��J�@>�]k��M���51�
+rU��ȳ�6IW��Z������Iy�GS3��β+�x58ϲ|������eV?A���n�y-x�l��$�%)':�}��3�b��
��+����uH
o��m�n
ş�U�A��ڈ1-$�MA�m����ؔ�?c�bL
/p����#e�����H�l�����@)<P�Ri}}�>�u]��"P�����im�Cc =�H]��:���u���B e��pw��BH�
+7�
+
+w��(b{��_�Xϫ �u��
�R?��~i�>�ӽ���E� �vR(���v:�[�( !N譧��UX©�ym�ݕ)��@�m
�u��5��A�=N�a��ty]��M�ő��^�t�e�p9�׃�z��p�MMqn��zٳ7v�) ���|��=[��(�� l�
+���'����$z��2�࠮�<��R�
���a�m��ʤGM�L	���6����
�
+
�1�Jf��{HV�?��v����aR�%m�aj�
r
>��,a�U�n@R�.�Z��0�m��C���4�8�X�B�{O��X��:���{�� ����f>�v�Q�0�36��Կ&���_
-�t1d\M�1{Gԓ*��@<��Ե�
�2Ds٩�B�	��ͺt���n,�*#
�:.�Fwq�ˍ��������M:/����8^eNq^�p�N���#��-dA�C1fJTvϣ6���	 ��릭∪�'���S�
+E����&���Q>�
��G5dmz����c�=��C��vڣ�r95��t>ԭ�K��ۆ�G�%Z)'�������Ucu�9a�g��U��*�ݫLB���!a~�L���� ��;���@��(�-W#��
���g�v�g���:&4�3����m�~�^Ȳ�]U$p�I��W�Ay�N廩R7�]�U�� �ey\&�g"����:����@
+;y�)���Bk��5d�������?
��2��e��<�-|D_���(��a�>��Ǔ��Yu[82���
 �+���눬�@"U��<��l��XJBQ�lQ.
5�J:�a^|��0 �0��N��^e�;�~�i�m�YҌm��}�����:��`����'B��ċz��@��nG�&�%�kE �]���RK㗇C"��I����])'
�ʚp}�D�0�A��\���Tw�θʲ��gCl����=%�`��T�0>�;R$�y����>��e�����1�Y
ȣ 
+3�xS8�soYNm��N�,�-tQ�[�фM��KKF�K�'X�θ�/��mn������!�;������gG�)́�3�3v���jZ�պ:��W���۳�C��&p���������ArP�ϣ�!�l�~q�2������UjD���u�c�Ȼv����9�-��0��
j�;����E< ε�w=)E˛<����o�M�$D�{
�C��
JOy7��I���3��
u3�@��I��
ȬP�# b�u�T��y
�fJcL�
u�r�
����3Qwo��;��̶�:[��@w��� ����(st|\��#��C�ԓ�91\<�_�;/J��b5�b

+
y��{_=lީ��nD�
�v�f�7�	l
��A��.��
y�h�?
..~�7G���T�I���қ�3�`W��*� ԇm
�@��U���c���߭�ߟUn���P"w��,���ϯnVE����>�ٽ
��:>�Ɵ7Y��=Šo�
�����c]�F
+endstream
+endobj
+14249 0 obj <<
+/Type /Page
+/Contents 14250 0 R
+/Resources 14248 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14178 0 R
+/Annots [ 14245 0 R 14247 0 R ]
+>> endobj
+14245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.275 207.663 293.971 218.567]
+/A << /S /GoTo /D (index_Powerset_Meet_Preserving_Simplification) >>
+>> endobj
+14247 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14251 0 obj <<
+/D [14249 0 R /XYZ 89 770.89 null]
+>> endobj
+13952 0 obj <<
+/D [14249 0 R /XYZ 90 683.788 null]
+>> endobj
+14252 0 obj <<
+/D [14249 0 R /XYZ 90 679.305 null]
+>> endobj
+14253 0 obj <<
+/D [14249 0 R /XYZ 90 586.82 null]
+>> endobj
+13953 0 obj <<
+/D [14249 0 R /XYZ 90 473.928 null]
+>> endobj
+14254 0 obj <<
+/D [14249 0 R /XYZ 90 469.445 null]
+>> endobj
+13954 0 obj <<
+/D [14249 0 R /XYZ 168.903 390.335 null]
+>> endobj
+14255 0 obj <<
+/D [14249 0 R /XYZ 90 385.753 null]
+>> endobj
+14256 0 obj <<
+/D [14249 0 R /XYZ 90 301.657 null]
+>> endobj
+14023 0 obj <<
+/D [14249 0 R /XYZ 90 266.987 null]
+>> endobj
+14257 0 obj <<
+/D [14249 0 R /XYZ 90 262.504 null]
+>> endobj
+14258 0 obj <<
+/D [14249 0 R /XYZ 90 177.685 null]
+>> endobj
+14024 0 obj <<
+/D [14249 0 R /XYZ 90 81.969 null]
+>> endobj
+14259 0 obj <<
+/D [14249 0 R /XYZ 90 77.486 null]
+>> endobj
+14248 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14265 0 obj <<
+/Length 2874      
+/Filter /FlateDecode
+>>
+stream
+x��\Y��~�_��Dv8���${�p�I^��A[j��1+i<;��S$�b���^�����b�b��ncD��a���+lo��׻��׊

2����t`�@q����&�C��2�k�1
�
<�֋�����j�2�'���M�q��_no}s��n�m��>򜯡a���7�	i
FE\(Pō�G�%�Ƨ�T=޾u��ǵ�?��<�lF�T�����a�x�g�ܷ�˧�zD�0_���hJ�\+������W���H��xq��'<�@�`bf���uZ
8ep��_��
+k�loH��� �Zcz�c�������E:�
�+���:l_
�e��3�Ϫ��LhǪ�LkU,�
�F���Ob�7���0Q
+	��M�)����=վ�X� ��ͦ?bL����s����-�f (2���]t �0����l���k �_����2�����X��E�q^cD�z_3��bp
c�V�f�z$��i5ҍ�W��6��jV�zS,�l}��G�H�M�ZFdk��Q�����Y��GD
��
]����ɷ�ܭ߸ȗ��%d
�#t 
���,!��'�Tfݮ�b����-�ހw��\:��p�u>�k�"f�ɷ<w�/W�b�mWk�Y�kj  �'���jY��D;��E
H,���aM"nt���T�V7�%n+DF�*�
����� �
�ݙ1��ʏBy��`Ҍ�YDgF��lg���	�mGk�t�Km���ʅ~����S&����!ŵ��?��ˮ�iDo�-B$��i9��ΛkV*6}Z���g�_���X>�?>�IA&��$����Q  ԄkX�p��P�4.E-��U���.���|\��o�����q�������E\[2[Nb��H����'P��(X�01�8�5Š/�`�D,]�
����V�pJ�^��_�����Mq�],f��8������+�H��R�������i�sH�@Ⱦ	��o,")4^�G�"�
p�
w�2Q
<ѵXO���Y1��MU�0�ؖ�eZ��(�O���<�\0�~��H1*!�RKt�JHaҠ�9&�-�*�AvVF�CлP�8�����[>-�u�.�vu؎������	EgBX%��a��J��V.oZ#)yt�:����"+ЧF�N*z2�|��2W�6����s�y �B9��d��U�N
��4߶c���
��\
ڳ-�1�!��)A{��h:�[�h��1���~�_�2��z
HT�HIg��U�qX�����=�bl?
�n�R	\IW�}�%ѵ(��(e���t4 aRT
+�L�7���m�
q ~6/&��+LU����0K9O��ww'�@c"՞���;����󼛭Wֱ�!H��4VAiĨ>.�WѦ�M� ��_s�
`��m)FdKb�P%bkʵ�	jC0��Ij�p�u�'2) 
+6�^���J�(�aEV,ǫ�c�-ꄴ
+�QC+����"F�A�
�ҏU��������Q)Z�
c���)�e�H:E]���������:O/�y�����j�n�9�n&��D�D76��[#��ED�9 at t��'�e�×݀#4�$��_FtC�¥���Cv3�Gvs	s'Ǔ�
b�įdwCvs% Y�)�n+
+csٝbxOv�%��A�
�[@������8���p���==Bw�
��X�W�ּb�I�7���&m��
�vC&��ݤa�
��
<Fv��B���_��f�F����%��rt$�s�'��
�vJ�Il��zD��@��=���)�cD�g,�%z�A�F�s�'��LٰBNg�/T&��2�-�}�t�A "��)a�Z�����&�!J�v3(�D�}��v_�O
Ym}�o���-�1��
ќ/�4����xr��DPV%ew>�L���M�UB��%���{a���	�Y�ݝ��Gw��Jw���<�}���/+k�4 ^$� �M!����_��⳾�������ݤ������^7�G��J�Bw{�y	9�����O"�7% _p}L.�,9���{8wi`/�IFV�:����'Ɛĝ��{Xx
�
K�3�޿i�C�w?h6�w9xĵ��/���yL���<a��7/�O��lޑ���KN���y�C���ќ���%�G;��h��? �`u	^��S6���X�(r�~�C�3O������d��o�Š��(�/`Qz�N~cV�Q��8�O��a���4�
�
��%"��ݠ��w�єBP��;��e�
+�Bu�����	�uߩ�b�PuG�����	�q��*:pA�4QK�a��6�z^AEa;2$ F����k9
ٞ,r`�[����Mi��@��R
ǹs��a)��G�fo��Y���\�=b-	�)���}u���9+��7�M�膮�8nlϖ�L����	v�y'!�ّz5}^�
+ϒ@r>�{.B�l0�
$��$-�YG��.��N2����<Jr��1 �@�dIO2��/a��N2.�#J�zԤ�<�����V�
�Ť��c�
�\�$�
�(�����cDҤ�h�%z�AMGR��1�*|bwGZ�z�,ա� /S'¶:w�"�q`9[������XI,�C�
����^���~]�L
(me�>�Z�=�,�������I�ƒK�#q%Og����ՎW8�h�2u�k��agd��3���xpS~+��%��N��vΠW������<WV%N)��0�Mu�v�q�1	�J��-��v>���
��gT���>
�o+(���o߾�7����ߏ����?��SuDj����D�nt��!گ�5��}�WU�W�?����W��h�!
+#�����������&_>��j����b\�X>;��b�.'U,�q�vmTՄ5�0AR��`Пa
1Q��
�{�c�`�p���
��#7+�_Z�
+endstream
+endobj
+14264 0 obj <<
+/Type /Page
+/Contents 14265 0 R
+/Resources 14263 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14274 0 R
+/Annots [ 14246 0 R 14260 0 R 14261 0 R 14262 0 R ]
+>> endobj
+14246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.269 661.939 238.02 672.843]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+14260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.089 437.793 246.767 448.697]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+14261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.899 212.369 431.977 225.286]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14262 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14266 0 obj <<
+/D [14264 0 R /XYZ 89 770.89 null]
+>> endobj
+14267 0 obj <<
+/D [14264 0 R /XYZ 90 634.093 null]
+>> endobj
+14268 0 obj <<
+/D [14264 0 R /XYZ 90 555.697 null]
+>> endobj
+14025 0 obj <<
+/D [14264 0 R /XYZ 90 509.072 null]
+>> endobj
+14269 0 obj <<
+/D [14264 0 R /XYZ 90 504.589 null]
+>> endobj
+14270 0 obj <<
+/D [14264 0 R /XYZ 90 409.947 null]
+>> endobj
+14271 0 obj <<
+/D [14264 0 R /XYZ 90 331.551 null]
+>> endobj
+14026 0 obj <<
+/D [14264 0 R /XYZ 90 284.926 null]
+>> endobj
+14272 0 obj <<
+/D [14264 0 R /XYZ 90 280.443 null]
+>> endobj
+14273 0 obj <<
+/D [14264 0 R /XYZ 90 185.801 null]
+>> endobj
+14263 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14284 0 obj <<
+/Length 2890      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~ׯا��1a܁U�̴��I��n����xhi%q*�
+I�q~}? {���Hh�d���j�=���ʥ�MF�/��rq��oFd9�5���u���Ȝ(����w#������3�-a��S���~{��ۋ��g?�1|E3(blv9?{�ͮp�����_4�$���ޞ�댖�ԟ�+w�>J	s֒��R�&��*������~3[.�^�
�;,�`Gx���fPz� �����	c�6�H-���L(ba͘,�'�&�k����$
Z.����E%G���'T�Lnp/g��:?�-ƒ�
�w�����X���üXl��������Eҍb; �ީ�0m�v�ik���(no��v�
s5��O��G�k�;
0�zNZ"����U�X�g��f�
+k#
�ެ��AV����xx�ߙ�٨����Y=_�t�ń�DXU-�.��
�5�RX��{JE��Hn�5���z?�U6r5�8��l&\
�%�&��\��-.����f���	
��>;m4H��<N;�Ӽ�`Gn�܄�i�X�O/K���� �]�b�H�D[�0k�Eۻ��rJr��e��i�V��Yݔ�/ϲw��W��r	��`��7����t[\����sƳ
ح����fUܭ?�;�8LJ���$��z��]n�5(L7�l��O��;2�{� V�)N�7
8�|��c�I4�#��.�� 0�gF��n���QJG�b~��B,�֜0S��aED�#k��t_,�s�6.�����
45<5����&s��>�c.G�Y�v��,����f�).6�b�>�3ft�X�F�
���99t��g;\�8�/�����f<��bQ�M��W�y���0�'��AXp������^���p2|Qt0F������ (ss�_��t��o=x
!@����|O�0�%�� [...]
1����~���D�}�)�!�L�A�`�Z�H�i�L}Ǯv-{Ax�8� l�s1�9��"�����T�Kj�,n[(8Ӹ*0ю&2i�UR��A�4a�������aw��.w����8�]�T�B��:
uG�#Xn4O���=�5D+>�u.�b�
E�
)*@Zv�{�pw�8ݰk�`��r.7x�bS�����J��f	<\m�b�U��[���|����?*� T���8ͽv���ݦ
��
J�3W
�C`~�r{1�(J�2
<��������UW.e�h�����*露E�9��T�O0�L��jN���#��~�S>ϜR}�S����1�<������d�s
+ͽsJ�frv{Ni�sN�p�?�tm��9%�a��\���vϠ�%H���4�ξAe~ĠR��:�{�R	�`xR醆)8#�.�hs�Ɣ
(�D�
,���Q��Ѧ�{�hBK�g��i���v��z��M5E�ƚ.v�ƚ��]
����k�)��
����H
��2�g"ƥꙈ�vD;%4�jQ�D�1-�a�3
P�V%g_֜`ZO�J
�ϡi�z�I�'��aOx�4�2�fE
һ&a
�2w�+��Z�}"����bq����������t߸I`\�7M$�!�oy�_�؉����;qk�d)�)�Қ��A��;i"�epdM�ޖge_?�D9:j�
Ν��i��L��A�������PѺD&�$�k�dt�$�Dq�a���I��"��$
M9IJN1�E1��T�$��(P1��Q�܋����FI[��DC�������� )T�!����>��^
U�Ϲ떠�K��x���1�
����Sz��-���y�qp�S�|!O�=O�Ϫy��Ѫy޿Ѯ�y��v�\P����W�ij�\G}CDz�Bo����VW�=�|� ��.D��6n
w��pI�C�_OX*�"�TE�mE���'q?{�:���k��`�����ץ9����2�Dso�)d�A�����v�L��7U��~ϫ*B<�*� ��0��̉E%�Lg�ỿ�P2��
`���쇠<�����J�	̉��s���6�M`�{_��y�x�y���.X�K�H�Z��	
	�&0�M`���&0�M`�ت�@�&0m����	����<4��M`s@X�{�B���'"���S�_�����]���7�~����2"\�\f
�_�����3南_�E��%�5�&�7iV��uɸ
M�ĕWL�
��7߄������J�J��c�x���uA����k�3�pDm��
rT:z[TG#���Z�yk�dr�)7�E��l��_���p�.7u®�j
�Qm7/�^W?��/ [...]
+endstream
+endobj
+14283 0 obj <<
+/Type /Page
+/Contents 14284 0 R
+/Resources 14282 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14274 0 R
+/Annots [ 14275 0 R 14287 0 R 14276 0 R 14277 0 R 14291 0 R 14278 0 R 14279 0 R 14280 0 R 14281 0 R ]
+>> endobj
+14275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [523.983 682.851 535.938 693.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 669.466 261.145 681.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.307 587.544 434.874 600.462]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [523.983 422.441 535.938 433.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 409.057 261.145 421.39]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.631 328.413 429.297 340.892]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 184.911 267.79 197.244]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.883 103.336 440.282 115.816]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14281 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14285 0 obj <<
+/D [14283 0 R /XYZ 89 770.89 null]
+>> endobj
+14286 0 obj <<
+/D [14283 0 R /XYZ 90 718.682 null]
+>> endobj
+14027 0 obj <<
+/D [14283 0 R /XYZ 90 660.102 null]
+>> endobj
+14288 0 obj <<
+/D [14283 0 R /XYZ 90 655.618 null]
+>> endobj
+14289 0 obj <<
+/D [14283 0 R /XYZ 90 560.977 null]
+>> endobj
+14290 0 obj <<
+/D [14283 0 R /XYZ 90 458.272 null]
+>> endobj
+14028 0 obj <<
+/D [14283 0 R /XYZ 90 399.692 null]
+>> endobj
+14292 0 obj <<
+/D [14283 0 R /XYZ 90 395.208 null]
+>> endobj
+14293 0 obj <<
+/D [14283 0 R /XYZ 90 300.567 null]
+>> endobj
+14294 0 obj <<
+/D [14283 0 R /XYZ 90 222.171 null]
+>> endobj
+14029 0 obj <<
+/D [14283 0 R /XYZ 90 174.615 null]
+>> endobj
+14295 0 obj <<
+/D [14283 0 R /XYZ 90 170.132 null]
+>> endobj
+14282 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14303 0 obj <<
+/Length 2966      
+/Filter /FlateDecode
+>>
+stream
+x��\io#���_�O		��}��Xq6��U�em�8��𐇔�ʯ�랃3�^�ko
�X�;쭮�~]��
i:x��W��x�G��zp}?pt`�#J�o���!�ĸјQJ�W#F��t1��q:\�_�i:�y7�M'���e�x�ܬ�M>����I��ﯿ~�%c�ɸ�D*W�\�φ����\�b�����mv
��4�ǃf�2��ף1Wtx=r|�,��M�=�6�O���dy�G�r6�������.���B������Ň��`��_(�>�A��������o.h
��p����|/\uY�J��0A��0�[0Y$�$��_;�[g��4����2j	0�we����b�$̹�v�(��Y�hF�R
�Y�e"R)

��:��{���+TLs<�釦U?�&�7��~��9O�7ٻ��r��[Ϧ����W��(���I2bj��S��׳��w���&��b:7ߛ4&��[��d%a����`�Z��a�}LG�
���uq����
+��;%��	 ����]͏��.vo�E�S<&Xb[��b�F)�("$�b�j�d�
�|��ю��[��

{dr��^M��ä†E��O���0DI�m���'H��G��Z`f-��X�=!&�mfnjJ��g
�
��i������I�q�e6�dp���2N(��h���Yo�����H���d>��LB�x^$��~�s*��"�:���7*r�6{Z��:���:�ӕ?�qSj����l�j�� ���H"'�:�8ˊ1���:Sw ��1�!a��
1��d<[ޭO��n��L?�6�-�1 at S�ҥ���,.�b�*m�È@8i-=2�
'
�N�
+�jj��	���!�Ʒ_]
�
Qpr��Ѭ(���+:Ѐj�|Ȳ;��{S�ҿ��6
�E�j[L�7�&��m��ȡ{C8"t�Dѝ�p��~����>6�_��� ڪJ�Nl���(twKh�	3�Q�׬�6�כקd�*�$]WY�%
+*�(�k6CY.�/��]ͦm�;�C�#ZV�'�
nQ��-��HW�A�վ��btyy�z^N��n�@
+�"E�.k������
+��.�Vd���O�s�;�����1�F��C]�y���p��v���;�hˎ��ɑ�kI�_�
3Ig���
��<��� �7�F��h�TK
/���i�����л�2��7oAZC(�ۨ(�-[N�i�)o{
�ow�B ���tܝ���p�æ�-,/�Y���`��<���
i�$%:�T��N�/���*	g�nV�zEfA,�)ܙ^Nj���k�)c��7�d�Y_^����§qcz.Ȣ�O�&�8�IZ����ْ M��j1[N6�qn�h����ZxoVˤ�rh��÷�IQ�am�����@V�5
����G
���ѼC�' �a�����ͪ�킡9~��Y�Qj;(�&EF}o�p��".�m��4[��tp ��S�\@�P<&]��CX�}at�3��K�W�3 �
�) pA�{!�Y4��
��ކ�&_|�s\��T����j��R�P`jC�_v�~p����B�d�'�AH�( ���.r�
���������_v
E5p"�{��0��̪	'WFmg�.h,=c5�P��m#�,�m��Qi�F���.�����؄�q�C��= �.K�{7�
+i{
s�i�O,Հ��d�[�-�F��(F���/��md���7�Kv�K{���/��Q�K_|�+�lx��4E��wNo_���cg�H�G���_X7`�1[�-f�R�"�`
��
+��d����s��j��[�0�ϟv�U�)1�|^$iN��WP�:��Y�.�?��l�Q/<�� �I�eL�Ŷ��iHS	v�h$	:��.���`�ϟv�U�9v�OO�rg�� 0)�^��
f��0qz��mTё(�lgH��Ùv�U�ɠfe���V��jJ8<����7y�$j��3�o
+dbH�~D�H
d���>@XN�9�o��<�yh��Px�WTx7E�J�<�T���9?�/�(���-�-�1��m�4�TXM�ѥRa,.
U�6Cv
+iQ�Ri�b�T&�F\g!�6z�TZ[gU*�Z�`�/�Q�궆�n��-�������Էd�	Zc�D��V�F��n\�$���E�I�dUi�vZd��օ
n�zb]��ͬ����j	z���KD\&�-�qdB��>��$m׀%�M�s���eϧ�]ӝ�M�F�1
+���� jZks
W�>r�I���&�>6��^ca���UI?��*�
q�3{@\e�mՂ|�^ڪ=��n��V
cq�U�s��f	k�I�*|�����Ufe���o�����
u��VW�Б�UW�PDQWE�� �%ɫ1�Sȫ'�����
Ȑ�1�Uo�s��a�B_�M������Jm��*�1�@{����I��$V�ک�A� ���� |�J�p!H�>{%V
�J���^��c$V�ގ��$V�Wb�T����
TX
K�!�RX
�>�
TX�\�c)�
+D��
++{t���)�\9l�4�U�TX�O��r�N#"vŢ[
��
��EUX9g��p���ӏ��p͏�Ka=a�H�I
��N�
f�B��ZE�W}ӌ*~���ӟv�U�������ڍ��Q��b�
s�0ƣ꫸>�.��'�=�i�]͟�D_=�� a���[� �m�"j��Ҕ�,���;퀫�󿤲�Ke={��
�������O�Y��DI
]g���kU�6�
A�
����V,��Y���FSY#��PY�<Oe���W��W������}� E�o����f[���XN
����
a��e.�Jf�|���]���$��H�a��L����G�ų�$��nb3�0`1�9��A���*[w�Lm�:~�l�.߼�}~X'��S��1��7��W��řY��6[��"�/H��+A���5/������Sf�/H�_�}������7[��_W�7�}�/\N�
+endstream
+endobj
+14302 0 obj <<
+/Type /Page
+/Contents 14303 0 R
+/Resources 14301 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14274 0 R
+/Annots [ 14296 0 R 14297 0 R 14298 0 R 14300 0 R ]
+>> endobj
+14296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 605.157 267.79 617.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+14297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 523.235 422.924 537.951]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+14298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 271.738 425.662 286.453]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+14300 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14304 0 obj <<
+/D [14302 0 R /XYZ 89 770.89 null]
+>> endobj
+14305 0 obj <<
+/D [14302 0 R /XYZ 90 720.814 null]
+>> endobj
+14306 0 obj <<
+/D [14302 0 R /XYZ 90 642.418 null]
+>> endobj
+14030 0 obj <<
+/D [14302 0 R /XYZ 90 595.792 null]
+>> endobj
+14307 0 obj <<
+/D [14302 0 R /XYZ 90 591.309 null]
+>> endobj
+14308 0 obj <<
+/D [14302 0 R /XYZ 90 493.625 null]
+>> endobj
+14309 0 obj <<
+/D [14302 0 R /XYZ 90 390.92 null]
+>> endobj
+14031 0 obj <<
+/D [14302 0 R /XYZ 90 344.295 null]
+>> endobj
+14310 0 obj <<
+/D [14302 0 R /XYZ 90 339.812 null]
+>> endobj
+14311 0 obj <<
+/D [14302 0 R /XYZ 90 242.128 null]
+>> endobj
+14312 0 obj <<
+/D [14302 0 R /XYZ 90 139.423 null]
+>> endobj
+14032 0 obj <<
+/D [14302 0 R /XYZ 90 81.969 null]
+>> endobj
+14313 0 obj <<
+/D [14302 0 R /XYZ 90 77.486 null]
+>> endobj
+14301 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F7 803 0 R /F8 802 0 R /F13 835 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14322 0 obj <<
+/Length 3853      
+/Filter /FlateDecode
+>>
+stream
+x��\ݓ۶��BO�4c��A��t&I�L�6q�k��znx��T"��������@Iw�;}"E�����.4��OB�|�-\���z�]�&*P�����D���� �k9�8呜}��q„
��~���?]����=�]�����@S8!�@�r��\}�N���G�)9yԝ6N\ד�W�\�g�#E
bF&a�����$
�i�n��N���ߑ���$&�翘
�8���
�m�'�t6�LL߽{�)x@$����C8$a��aF��Ȗ����D���݌��/����1?f$�>�%<���ADԡ��|�L��@����%j�y��6���sa��N1�
�{(�����oN�@A�����d[���<�EF�q匚TUv�4�;��ٜ�t�(���朅2�N�@BE��֓v��# ��ɒ�}�	�hy�PA([� �C�E��Ð�Rn;}��u����FZ
��;���(	�ɜ��Ҽ��ފ
+�"�/�H@�����c'd
v8���u��*��a�����딚A˴ڭks_ܙ��lwu��7|��ff�����_M>� ;�
��4ͷi����grD�@�&G�5�$_��L2�;�P��Z3��a� sR0ؿ8��n�֫�i�z�M��<+n�а4�n�̵��й��IV>fա�^Z;�G�ǽ3�d�2wˬ�}�/,�
`�ND.���Ǭ^�찎
��Q�H�j���n
�PN��q�;�9`��:rd����KZ`�F-p�F>��U�X`p&�2���12��As
������e���B��aA#���2� ɜQM�	�j at R�	@t i��j�>2�f������Ӥ̒�uZݼ���0"H��FJ���9�3M�W
`:"n�����ty�C^��iys=���w�aF�4[�Xz�#,�؂�q�éo�9���@jG��5ݖ8lZ�y��Y�{��o�[΄p.
9:ϟ�i�����;&����+�i��
��8(�p��o�w	v��y�T�&��^	�
���z]Nc�
+��,�}	�
<�&����w0P���ĚW�\�����~�S� �6��G7��Y���]�]��.}��
��� 휢T|���eA�"ay/�,,b`��,�
+���X/ǗA��
&‹D��S�(�^2�Y'�~]�����K�A��X�K����![��7�i|e���A�u��.w�g(
@"6t�[�g�k��`��8�X��B��[m=�j�.2�J�]9x�'
�YXݺ��8�tQ���,�����[�	O 3D�ƛ���NA��i5���ꍇt��ۆэ�5����u�/K1 ����CDC+S.U�8�N�p,�$�Pz at S�e
[0" �g��`�o�h��r�b1�h�b�D�u@|�.n�V��W�� ��a��
� @� ���iG��M��᥋��&/_�q�Aw)/��
����^8:
�8x����7"pX�Y����	�=�	?n�Lh�r
�1
N�Z[�ڶ�δ���m9�rM7���� ����Mhg\�}��{�ja�98��9�}��
)F�)>��h +��$�e ˁ��p8i�!��)�=�	/d
&���մ�3KB�iKW�c�a�:���4v�n�`��0W�]�Uۑ
�jz�1�؄�(�/�8Ҁ"�ؽ4E�]8
��]�
�Y�h�s�A���{~���0�e
�:Q�6�_
+:شݦ�#	�vOYdP
-�}�C5�pQ��
��n�j��Q
M�}�=T{4�9.ċ�u
�p�T�%}�SԨfQ�����)��VQ���
Ha�
7�S�}&#~h�yWTUv�Ɠ����N�
���������\m����L F�?��*5o=�p�P]C�L[m~z�Ҙ#�M(���g�dh0��HL��D�持G
�����ݬ��|܅͗�6͗8O	z"7��HX�6m�P<x�JDϙ�+ �l�C��!
��
+���s��9'l�a�6��E>��eb�D� ����`J5�X� E�n�m88>K�j���Ƈ�Ş/�<�,P��{����
+�X�u��n&v&ç���\�[�+�0��Mm�jl^e&�vlrHͺ�[۴�+ʍ^5 ��}����
e��.�1���$�D����O��u��4��P��c�l�����a\�=[f0��7|Wg���9�
y��e��
.��վ���ز���5 
۳��>�
[sq� �[0�=`^_u�K�=b, yj^M�v�Vx�es8Y`�y=�}�7s��Iض����
3����;����c�7�G�
+h�#:%�7�g\
w��~����
�!)�-��)�
�-��E��P��Ɓ��8Qq7����5
	Г{ʲ��x�D�O1�gq���_�� �F�4���6��p0��$`�Nh�kZh�r��3���Wvc�;���ۊ&��Y�Z�e��OطeOO5�vr���KW|
�@�p��Bra�FF �<�L������(쌲!2�KM��ṯ^M�a!B��x:I:��yP��HG��.3���(�Q��@:�j�axӏ(�o�
�����Ӝ����6F����I� 1\i�2C$��3�
����n�j��Cgq��41�;�Dz��a\di��y#_(z��/���R�R����$륻5.@�F��彜�7�_!M���������H��=��g�N�'Q�9�tE�<}M� M�q(�\�x>
\ɐ"�֣��c�<�e:�;��09��`�y�	���7 `
�T�Ζ7����;�'�o
��	�%�	����D��և���+D/ԝ���4q+�%�P�j��H��K8�`�®��~
�՛s8J�G7��t���='c
�̓q
2}v
�'A�
���M��Pbs����J���cSvJ3mj�[Ew�����C	l
gh�q}E_V�C��'	����I`_�"���$�]���r�ß$�^���i����4�-�9�To� g�D2��P��^��ݢ�S��@=��
�l7�<���o'`F�eꏅRn}��Vd�0�'>㮬����h�'=C�yۤ�l��D]4����j�U�
qܡʥm���
��7C�	R��:Fe
ZE
N�����
#(p�T�K��mi�
~eZg
�G��]n��X�+]��	
�ʹW��U�&�����$�wN�TP�����8x~������⡠
���u���>3ܥe{�/�X�KEW)uG��Ѣ5��D�5�|SM�z�h�B>����` 3�)t�2Uw��_�>� SAĀ�GK�+.���Sj�YDu���h�I�:n"x [...]
+d̎��V���˙1��`r���{ܞ��s>����wJy�C�Rp%*8���$�)	a��â��u�l�u[�>� �Kp B]��p�~oǩ��N��zr1P_��
"�q_%>*V=2#_ڱ�W;2�7
�.l���aɰ~���o�o)F�X��o8x�S�LD3�~��ǽ���騾>V�.[Y�$�=�c���$(xg���ItVs&06�Ѣ����V�?oĬw=#S�(t��_8�}[`���0
 �]��:� �d�]?�
A
I(@w��t_�:�5�!�O2�S���_�����#_?Ɓ���Gtqϩa�Nw�p�@
��+���oA�~���G�&�k7��Ǐ�T�Y
�I���dm�ɺ���Y{�
����� ���
+�+T���a�4ML٩
Я
�u
���Fg�����n��4^��a��@�#7z󎠍�afCp��8V��>ny��w�07�����3��Ə�g���MW�u���3	ȶL���������$��Z��n2
=�b�1���z������}�������k��e�P�aQ{~1)ys��-�{�_�H�

+endstream
+endobj
+14321 0 obj <<
+/Type /Page
+/Contents 14322 0 R
+/Resources 14320 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14274 0 R
+/Annots [ 14299 0 R 14314 0 R 14315 0 R 14316 0 R 14317 0 R 14318 0 R 14319 0 R ]
+>> endobj
+14299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 673.894 322.446 684.798]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+14314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.409 656.27 332.425 667.174]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+14315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 552.279 116.998 563.183]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+14316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 511.083 243.45 525.031]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.883 343.148 361.886 355.666]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+14318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.187 88.445 399.221 99.349]
+/A << /S /GoTo /D (index_pps_bgp99_extrapolation) >>
+>> endobj
+14319 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14323 0 obj <<
+/D [14321 0 R /XYZ 89 770.89 null]
+>> endobj
+14033 0 obj <<
+/D [14321 0 R /XYZ 111.798 647.468 null]
+>> endobj
+14324 0 obj <<
+/D [14321 0 R /XYZ 90 641.451 null]
+>> endobj
+14325 0 obj <<
+/D [14321 0 R /XYZ 90 536.388 null]
+>> endobj
+14326 0 obj <<
+/D [14321 0 R /XYZ 90 277.07 null]
+>> endobj
+14034 0 obj <<
+/D [14321 0 R /XYZ 90 233.518 null]
+>> endobj
+14327 0 obj <<
+/D [14321 0 R /XYZ 90 229.035 null]
+>> endobj
+14035 0 obj <<
+/D [14321 0 R /XYZ 448.074 159.724 null]
+>> endobj
+14328 0 obj <<
+/D [14321 0 R /XYZ 90 153.084 null]
+>> endobj
+14320 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14338 0 obj <<
+/Length 3123      
+/Filter /FlateDecode
+>>
+stream
+x��[[���~�_������/�"@�:��p�-�	��ݕ+�
+I���sfx�(Jڕ�>�@j8s�̙9�o���Gt���˛��1r�i�G7w#GGF:�4����G���F)�ލ��l߾s��LJd�ŷ?.�Y�=^_��źȓ��C>%4�����w��&��
����K������U=�������!��d�9J��2���+݌
���fIh�)�K�1�Q��A��ER9$z�����+d�Q)b�h��z�
͡��%���'�i5�\�s9���W��z�$\�+>ʽp�eYG(�#�q���K؂x��$�r��
�������moe�8�+Ӥgm-�_� a΍��DQ5Dz3��!�-�GD	��I	u<��1H�������L&4m3�5q�t��6
�M:�R&�R<ĥZuV����a_m�Sg&Έ`U�y�+�|�(��c ���x�
�x��$F�j 
���V'I������8�u�?
Z1M�3}�T"IA/y�/N1
tC`���
1F?� L�Am
1��Z̓���v}ҁ
3�����^!x`k���_"�f�"]�oEZ�e�m��CK�cSy��y�!�9O�2��"t��Y~��$xt����^T���
=�%����3�%�&]�=����ܚ��C:_������~���,7`�}c�V��W��w����s}]o�m��\�~L���H-Q�u�-J��&��"�����{�u�f3�W)k��L�+U��t}}�Ƹ�ޤ�,c��JL���k�z
�!������
���1}W��
+
���b�C��DW���m��b8C1�C�"HGC$4��j�<��dm:l��$��V���UC/���҅"V�`�(Zv�!T�
�V����"��ʔ�dڞ�Q�iks�M�Y[��+�a��v5��һ�l��]��l�e�h���:<����`�ms��;����+�L
HO�;���DI��7��zμ���f���'@�4�cf�j�-�ޡ�:z�B6po���60Zh�>ϒd��юI���U>z��� 1������0I^"�ф�Z`hì�t��7躼8��m�][�lA�u��>��M� 0�ߒdh��I������iP�Aw{Ac�t��%V
+e�7/��pl6x�$T'�NJY���J�b�3Dry��+	r
�`��
�l�$�k���LA{I$KFwG�SN�@2�&+�1���4�/���[���
+��sϩ$�������.U	A�Zj�$PG����!
�|
4|q�c���
�.c�$e�
k���cK�?w-����99h�d�F��|�L�Y)�`i�9��UH�#Ś����4���c�i�w���,H3.���l�)3h�^͗J�؊\�~�Y�P*
I�$����d��~��j��wx���w���1���
�}�/*����j��z�:C.�9aԴ*�D��2dQ���
���SO��,S�g�x�$���
*.j���}�C8��	��'QM"s�=���+�v���'n�e�>,��1�|�?=�
+��]J�؏XmL��D0Al7l;��k .fnH
��G���h9���P�����/�r�)�I+��nH�9�VWk�~|�Q�o���h��t'

���H"A�����M�C��Dj�f���`g_!�TMY�uG'Bc�=_U�l�91��eQsz�j�����j�
�'*D���s�8�6J��<sG�r���)���P��C�l%y�BQ[�
w3a
+X���cm�����Kl=���F��	> �t�锄I�$�.��
raW&�e������^�'
�k;08�Ӥ��$�)S�x�b
<]���ܧ�	w�
Z}f��!��YTJ�Z���ej
;!i7�����@ڧ�~
��%�ek�g	$��TY��q'&c�Cw
M�v�5��>���N�KO�ʁ,��	���
�6A�� Lp��v��0���0&.�<_����>e
���
����P��8��x�-�u����Q���_]�
���F
*��X��gQ
�@#>.�m
 ���űC^$D!�F����ns�x�p��<�� ��q#x;�u������=y+
{��
��T��S
��f���s�<�
+�	@�3��W�67^��-@
5��B ��A�Xy�R��+��5�A�w�
�8��<y�y����4˒^���tm>�W��;:5|��_upap����U�Z0
�R}�k��봫A儬P9q�Ә��
+ɝ�Mt��#Лk.񜆽��k%W�N{�1J� G�Г��a�$�%���	�W
�<��/����N]���hz�̵#L^��P|N)�C�g��X)���*�݅>��Y��
���:�=�'�e5�4ϴS�y 3jƂ���r�f��|
ޭ+}�[�ɹ��l�

_��",|��"�����Mխu7	;w��B�2!@���R칩��
Wj5���X�
^sw/H��y�i��ؕ�D�cڲ.����r����ٹлٹoB�߿���4Γ�2d=��2��D��P��
B�<�� �q��6&Q�?-r������a�}0$�kw�_��sa!%�Up�"�,���z��_���
!�ָ̫���a��
+�
��B��<��k Tj<Cu�.	v��	_��	
hU
I
{GZ��v�6�Q�
#D9*�0C
����R�������P�SG@�\ Y�`٦��e��
#�x���W���v��-��5�o�C
$�>�칑��n��a�A�,!�~����	rf�pƆ�)`�>	p�V������� B�/ �Ee�Z��fQY��\
�6
�χ�7�=:�B��䧘�
+0@�2�U����
b�=e|�R���ļ�X^])�l,�_
0�@�+�][d�;�g�
�[U�)��R0
0���a�G���N�4l��]oU��yD/�9�2'�0]|a7�՘ňS�)�ʆ ��x	���`Q\�2<r��ݏ��y��i�TT*����6���救\^k��M��pKm^�s
��=���v�eӰ�
%��E��~�b��ϓ�=���oBZk��\��n���*9Z��qU^�,�E�Q����
�ʌ�� �w��X6�x���� �&�����

+endstream
+endobj
+14337 0 obj <<
+/Type /Page
+/Contents 14338 0 R
+/Resources 14336 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14274 0 R
+/Annots [ 14329 0 R 14330 0 R 14331 0 R 14332 0 R 14345 0 R 14333 0 R 14334 0 R 14335 0 R ]
+>> endobj
+14329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.22 515.239 330.187 526.143]
+/A << /S /GoTo /D (index_BGP99) >>
+>> endobj
+14330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.562 515.239 391.059 526.143]
+/A << /S /GoTo /D (index_BHZ03b) >>
+>> endobj
+14331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.268 447.114 343.546 458.018]
+/A << /S /GoTo /D (index_pps_certificate_widening) >>
+>> endobj
+14332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.153 183.909 513.996 194.813]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+14345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [106.717 172.93 155.195 182.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1BHRZ03__Certificate) >>
+>> endobj
+14333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.482 172.93 232.115 182.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1H79__Certificate) >>
+>> endobj
+14334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.559 86.288 345.883 97.192]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+14335 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14339 0 obj <<
+/D [14337 0 R /XYZ 89 770.89 null]
+>> endobj
+14340 0 obj <<
+/D [14337 0 R /XYZ 90 720.814 null]
+>> endobj
+14341 0 obj <<
+/D [14337 0 R /XYZ 90 570.687 null]
+>> endobj
+14036 0 obj <<
+/D [14337 0 R /XYZ 395.641 518.392 null]
+>> endobj
+14342 0 obj <<
+/D [14337 0 R /XYZ 90 511.752 null]
+>> endobj
+14343 0 obj <<
+/D [14337 0 R /XYZ 90 419.268 null]
+>> endobj
+14344 0 obj <<
+/D [14337 0 R /XYZ 90 293.449 null]
+>> endobj
+14084 0 obj <<
+/D [14337 0 R /XYZ 90 162.055 null]
+>> endobj
+14346 0 obj <<
+/D [14337 0 R /XYZ 90 157.572 null]
+>> endobj
+14085 0 obj <<
+/D [14337 0 R /XYZ 134.214 77.486 null]
+>> endobj
+14336 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14355 0 obj <<
+/Length 2931      
+/Filter /FlateDecode
+>>
+stream
+x��[Ys��~ׯ�SBU��܇��C�]�����*~Y�T\��2	���>��
 A*��j	����>��
��㈎�������[#F�8����a���HG��_��DZ�����FB[œ�[�����ݛ�>�gWo�~�bxDG,%���������t4���F�gG/ɠ�Hr�����տ�h�
%\�K��q�X�3�c)�� �\O�t
G��rG������������tD@�#m> �m����z

���殁������_h�Cj
+�}��r�Y�Ӂ�̙%֪|�kN1p
��>����K�ÍF�!�ٮŅ����
���Z�������S��ѡH��3�~	�4�g]�
��.9��
�~��Κ&U���Uibh8�|�����f��z!�?Q���D`�.L0�)��a`ܰ�\�
+1�x��x�[L?-����|�f4%����?�{g�
+��(I�5�j�J
��"X"��
+o�jZ=a�a�h�aC�H���|�����”�ez?E��~�?Qʣy~�o\rYJ��^�����1[���ra�q�E�t�%��o@��i��?�{5
�f��vk�49����R��v#-`�NuQ��TSC��
Ȫ��HZ
C��
�W.�˹Mb^qԥ���4�
+7!3w���v���C� ���c���o�F��?BIXns��d6����L�g��.�o7��b�����@��:
�){�
,gN�e��&��k
HJXҀ�|6Ş��:�-9R�)2��em�Dڝ6�ú���f?�E��H�'��7^@a��h�T~Y���B1��$�Te4v���G0N(vDYA��,D������ZR���b~�!����w+=��X*�\'V����
+
�Ӿ���p�pk�λ��暫�����x�\^�����
�Td�@U�a9~Zd�;� �@q�O�,|�d��mV�i��-y�����o��-���׻�vG�ݎ�S*
%��LR8d8�
�P<]�s �8\>|:-D�Ӹ|�O����N��@_`.�v�
��O���<�7)�����8�WL������&���ĉ�\�ĉ#�����u&N�{$q��C

+a�,�6w�L��%�
�p�Z$�4�����x|\>���8�A��,�U0oK�ƅF���Vx3�M�2n�ܭ�O
+NX�|����^7�]��Q8X����ꄅ�Zu���)���py
J�
C8�;��	�
��
+����1(�/`�4�Q �~^���yY�Y���[t�Am��p"91��[�r_
,��PW�,�2R�|Z*��j�>8.���fݠ��h&��WM�8'Qi���Uh��M�r�66
r�98�-5�
KmB��Jt��C���I͖��,0�1��]4�s' 
_�H���z
13%�l�8d�� s��N����n��)El7�����G1���.@��+bF��1#��
3:bx�up'|�&�q�Z�Kk��C���t�굇���V����	�p�>�gq�
Vk}LD�_;B	�z툉@
+�M-C�hK0vB[b5�6�i8 ���Ѳ�дS�ل�>ҏ@C�.��5Q^��6B�	\W�yHn�PXߩqj .��� ��,6a��w!=���o�����w��<�C;���k
�&Ց�q���!�f��a]x��l��D���
��'� L˔�QNp	��Y�~�Y���w�u���	7��])����PJ�����}U��W��H[��~n�q��Ł*���0~���|��v��77U-LG �;siS�R�P�n�XWU�0+`�R�Y�hP�&�0h��k5�j�ɳ�TV�z_T��W����l�ܿ��j.
Y��7Z�l%0ƯX�oJp=j���C�<P
�m����ŵ�����!7̱�
��!C~
���)I6W
�(��/��
)͞�+�`�|s�Pz���D��	yK
l걎�|4v|>��Ȍ�67����m���r1����ܧM{���$�2C���S��YҞAtOQb�9��xR����w͚W�м���S^�Ƚi�--}�Y������_G��+�ԭ [...]
O318���;�3�
8�!�����[
�o�����
��h�L��J]1�e�~�����Z��f��,7i�6\�y�viF,�7b�"��'��Р����t�����QB=%�#NЯ�!~�5���r��9�>ﳑ��^`�!��!�V�wFh���
��҄�r��l�/�
���_V�/�J�Oԏ�
�[��/h[���g)|&>�繀框zzJ���ȷM-1Sr�3d�ؓ���R�pY듇?Et��k�#Q+�_]O�����|w���*���l'm9�6�,;�4����9�eu�5.[Ň��/�Iu��=�
T�/N�3\�:e0;�W#*)�V�X�-�U���`���;
ݱ�ͱ�ph�]�N}�/p�ު~����Da�k]��m=�r(
�
�_�
�v�ׇz쿟*
�O�I�T&!){�t�;&���i (/M�� ;º,Yo�
�Dm�†>|U�)=�% Ž�y���B��{���

QnGK��Sѧ�_R6G_��1N��8�8����]�f��ဪj
���ӗ4�&�ۄ������(�0�JA��M�>(F�˱b�?~9��"�N��iݗy����F�w��C���sv��m�N��_�4�@g��:~�
�&��|���
q%�r�GO&e�>���E�j�G�`�.Q�_�*)3���_�:y���ݸ�v%F߀XInz��`c-�eZ3UDb�٘�d���?ҋ������81�����s�%����;�Q0¶��z�  :�h�_��+�헂���<�“�D�"�?���������
�0�mV��V���^M� �B�j��r=��մh�W7��)�?
+endstream
+endobj
+14354 0 obj <<
+/Type /Page
+/Contents 14355 0 R
+/Resources 14353 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14274 0 R
+/Annots [ 14347 0 R 14348 0 R 14349 0 R 14350 0 R 14351 0 R 14352 0 R ]
+>> endobj
+14347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 632.699 243.45 646.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 580.439 485.603 592.957]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.42 368.726 272.524 379.63]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5c5da855445b7c877a626d824dfce64e) >>
+>> endobj
+14350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 181.008 379.76 193.342]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset_a48056bb9473b8c2019f402b21245d80c) >>
+>> endobj
+14351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 138.543 182.164 149.447]
+/A << /S /GoTo /D (index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) >>
+>> endobj
+14352 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14356 0 obj <<
+/D [14354 0 R /XYZ 89 770.89 null]
+>> endobj
+14357 0 obj <<
+/D [14354 0 R /XYZ 90 721.073 null]
+>> endobj
+14358 0 obj <<
+/D [14354 0 R /XYZ 90 658.004 null]
+>> endobj
+14359 0 obj <<
+/D [14354 0 R /XYZ 90 604.315 null]
+>> endobj
+14086 0 obj <<
+/D [14354 0 R /XYZ 90 557.689 null]
+>> endobj
+14360 0 obj <<
+/D [14354 0 R /XYZ 90 553.206 null]
+>> endobj
+14361 0 obj <<
+/D [14354 0 R /XYZ 90 480.343 null]
+>> endobj
+14087 0 obj <<
+/D [14354 0 R /XYZ 90 445.673 null]
+>> endobj
+14362 0 obj <<
+/D [14354 0 R /XYZ 90 441.19 null]
+>> endobj
+14088 0 obj <<
+/D [14354 0 R /XYZ 277.106 371.879 null]
+>> endobj
+14363 0 obj <<
+/D [14354 0 R /XYZ 90 365.239 null]
+>> endobj
+14364 0 obj <<
+/D [14354 0 R /XYZ 90 296.665 null]
+>> endobj
+14365 0 obj <<
+/D [14354 0 R /XYZ 90 230.622 null]
+>> endobj
+14089 0 obj <<
+/D [14354 0 R /XYZ 400.69 141.696 null]
+>> endobj
+14366 0 obj <<
+/D [14354 0 R /XYZ 90 135.056 null]
+>> endobj
+14353 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R /F75 562 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14381 0 obj <<
+/Length 3093      
+/Filter /FlateDecode
+>>
+stream
+x��Zm��6�����=��I��E�4m������}H��֦w�ڒ#i�Ϳ��^(Ӳ7�]�����pf��3#���
��\|{}���`��	Mf��Y�g��(N���}D0�x� ��jNp�U���jNqTn>ݫU�����VY���
�yU7��M��e1_�G�6Y]��_�ZUs"#U,�M�xB�]�p���Ň
�����H��r{��7<[��3�X*g�f�v�)������?/��W��h����mJ��)˜�a(�vð�̶��Z��6z�I�����R��3,Xyrg	
+�m �*�4�%i�b
OI���q<k���&� L$(�N���Ǭ�a�|�^$�0���$x�L���
+_��{ec�V�}(���Z��Ω�˛��{���!D�K��n�)nBy��Z6.�eU�zW����CM�>��w��=��*j8C�?��}�.7+��z�t1I��
�7-��sF��%�>��S@ rBS�)�%R ��
������������
^Ƣ�s�����
�C�QN�
=hCƺ�sS��~���H;��-��7pd|�:L��`#���E�ѹܩ���ğk��'@�T�3�?[��rV�JYj����K�k
PL&��R�0d:��!�	69�L{�1�ZL�
>�X���@�'
Q at M+�R��4<�8�	�ϖP����2/�
C���HxLDwp����
�;�>a7>t�Q�8"��ب�?�h���������a@�(7���k:��gj�l~�+��N�pJ%i�4�ym��$H�c�$Jr�0y�,�;����;=��}`1B!� S��˕�]Έ4��B�!~0���0q��0�@�
,z�x"�(�,/���
��%&�&i� ]A��9h�`@�^nꎡ


��Jb@%vܚ
�y'�# ��}�6�
KK� J�
Hd1;/�~���C
�b!�ػ$�6t`%�$=�y�H�&�g��$�<�����x9�!.�%��|�V��@
�݁�dQ�F{Y
*d��N��#�t��k�}�~ѐa�����揠�p)H�"���=��C���i�6�����


�R<$����8D+A��}Y���m�g�}��H�e��e�c�8�,����ƀ�Y�aD}x�6v�r(�"2~Jl2
e�*`EJ�F���b��,��*�9[���VB at -@
�� )������>�
rJ!;Q�~?�	4�aL
��A��*5]�ۂ:�q�bX������A
EA$
C��MX�*`T@b��iY0�D�u�D���ս�rU����^+�`zr�����X��
���\Fj
9���T�
@(O��,"n�Fmwz���J������6�,�&4�v�ȶ�X��������7h��/"A��v`��.˫�(�e"�H=�9��zS���#.�,�	4�&؞)� ���~أ�4$���)Z��ŀHĽግC�[����
r��v�jNbЕ�P�9|���A��6�'[OPȴ�,�5/ ,B����
R
�DM���1�/8�
��>=���
�!
r��Z�I/�b���Y(�p�n�C�h�e�<�t)��!}���-ˍ5YP���E
�0��a��.����U�΄����d_1�4&����Mz_Y��C�Z/�(�<
a�'�o�a%:9Ym�Q����h�Zw�?2�4h�&����
	U��
-�����
[#_[aY�j���|�:��
�N��~��m�yn�ml ������ !�ğZ �#!�1��M�I��q����͛G
��֦�%}���F��j���A[��t�f����R���Nwi
�IOs��W
���ӫ%��AuB}v�%��_��\��,�x����>W
N��pd٧�o��V����
+>S�|��q��&
P�an:�
�[H�0�q��ر�_��
��)��l��y$�ye�H%`vm�A9<Tq����~���#�����H$z���!�g$����o�U�_f;w�l�=���!��u
�P��?
B����
_%�j;��DN�i�D[���o!��,T��l�)���^o�m�/���_���Z�.-h�V�/�ELF}İ��4�>V!��v����}��E���q���k��S;l^�x��ءܴ*aDm��1���j �=榌��U^����	19jox]�� Z&(�G2a�W
�0`68K��~)˸�N@ͦJH�R���Ca"S?�#����1i
���)�
P-��O?tz��;�*��qsʭ���.��r]x�GաzJ��͆�T���
)�,��4ӫ���~k�+(�u��|U�

讀mAs��
�U ?�r�8��D��I��
�.��t���	
!X��O��a%�!���X��=�V{�*�yq�Q��_/@�'
f�~(~HJI��྄�ۦ�������{(
�)g�'&�<�����ʑQ�����떸�Q�f��F��0���s�
+�ڻ݁�2� ���ƾl�d:5nԥC��5;��(.�v�
��?�]�楦�i�2��d��`��6
��1�	)�fQ�
���
��+�z�Ώ��,��������F�̲���u�Xj�C��f�}�
+���|!#s��'�� 
 ɞE� (H=U^�^��h���L��)b�_tp����f�i/��"n�/�M����	[n��*���j
�*| wW�9]
�uo� jP ��N�{���r�R_^Q�l�Y�ә�^��H�7���w�
n���|im�s��tr÷?��9�`�#���6'W�]�^����a�
u�50}��5�L�&gI�ۖ�]��S�?d��.�34�
+K�������r�+)=
�B_�{����B}I8����6�ȁ@�����R_A��>1��J���a�M�$
!��
Q���i�Z�S�K\_����Ӈ��5�'����Y"S$�˵�yvW�E�9gt�
e���n�


�5�S9������ÿjU�]�1
+?g�}
딵uJUw~r	�_Z:n.��Sm���1k�~�M�^
ݵ��;����]>~�p�q�����
5�K��肣c�۲�90�
�rkv�O017�5�� 3`b;��7x6_�?t��n�������/+�T 
+endstream
+endobj
+14380 0 obj <<
+/Type /Page
+/Contents 14381 0 R
+/Resources 14379 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14393 0 R
+/Annots [ 14368 0 R 14369 0 R 14385 0 R 14370 0 R 14371 0 R 14388 0 R 14372 0 R 14373 0 R 14374 0 R 14375 0 R 14378 0 R ]
+>> endobj
+14368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 695.509 243.45 709.457]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 618.941 535.938 631.459]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 605.556 226.824 617.889]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 551.106 362.844 562.174]
+/A << /S /GoTo /D (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) >>
+>> endobj
+14371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.228 442.16 513.996 453.064]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 431.973 138.817 441.109]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Pointset__Powerset) >>
+>> endobj
+14372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.573 431.973 170.476 441.109]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+14373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 131.183 181.845 142.087]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa4b60ce3ac62aee15faac1b5035fdb4d) >>
+>> endobj
+14374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 102.758 181.845 113.662]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab92b75d150bd5fbfc03cadec75d59e0f) >>
+>> endobj
+14375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 74.333 154.727 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a4cc725a9fe3bdaded2c131bb8bb47ed8) >>
+>> endobj
+14378 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14382 0 obj <<
+/D [14380 0 R /XYZ 89 770.89 null]
+>> endobj
+14383 0 obj <<
+/D [14380 0 R /XYZ 90 720.814 null]
+>> endobj
+14384 0 obj <<
+/D [14380 0 R /XYZ 90 642.816 null]
+>> endobj
+14386 0 obj <<
+/D [14380 0 R /XYZ 90 536.936 null]
+>> endobj
+14090 0 obj <<
+/D [14380 0 R /XYZ 90 514.441 null]
+>> endobj
+14387 0 obj <<
+/D [14380 0 R /XYZ 90 514.441 null]
+>> endobj
+1968 0 obj <<
+/D [14380 0 R /XYZ 90 256.659 null]
+>> endobj
+454 0 obj <<
+/D [14380 0 R /XYZ 90 249.728 null]
+>> endobj
+14389 0 obj <<
+/D [14380 0 R /XYZ 90 150.441 null]
+>> endobj
+14390 0 obj <<
+/D [14380 0 R /XYZ 90 150.441 null]
+>> endobj
+14391 0 obj <<
+/D [14380 0 R /XYZ 90 120.282 null]
+>> endobj
+14392 0 obj <<
+/D [14380 0 R /XYZ 90 91.858 null]
+>> endobj
+14379 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14438 0 obj <<
+/Length 1604      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�8~�_�{��3D�d�?:�p���h{4�pS&u�����v
+��oeK��8i��C_jזV���]�n��k
[
~
�}�
+Q�Q�]Y!�|"����f
uގ^X� z0�z���d��dt.�
��^a��8�+�.�bk�_X�a`}�M-F]�&����V�t��n!���cR7BC��'R�q��iYH-���1�2D�N��c�
D`�rC
T�ʛXIj�J]�}�Y��Qb����(y�#�c�Y�"N���Q�<��a�L��2S�<�����ꁏ��Hr]���
+/ma���)
ơo
	��t���,�b�1�/�,Q�%�����u5�rl��Y��;Y�z�9���(7K8˒Ż�Y��H�e��}� �8�}Sf�M]P)���M�w:r8��E�W�u�N�,M��*�<q����mg�oXq�'��`���r��'� �v����u����7"r(�?
����)o4��ð};��
���q}[
(�Z F�D�Q.5��JҴ�[��K�Wʜ� "i4��旎o'��Wbz)���x�F��ŚM�!
b 
8%
+\w3
E��7���ii,���Z4���4B�y��Bn\jd
+0��w�0��4ޣ����$.�gp:��t�c��w#&�ø��g"�q�B(�fWzZl|����BZ�=���\�|,���8z��#B ��8*a*�+�BDe�݁��v��#���)F�ꇗ20Ε�X_�������DLL�T����^F��b��~;��^�:��
TQ����#����hl�
�
+��f�����,l!mgS��IV���j��Eǻ�:��+�(Z�b�fPD=��i��U�<�{����j��2�{��L�]<|���}�QSH�=RG^H6�R�Y�u�'�<���h���8�olj�+�����J͡_
8t�8d�����
���W�a�s?��u|f�"�t���F���
1�i��8��O�/hmx
+@؏���Ň���?��ͺ���[��m
�a�؝l[&O��+N�V����2Rd�ȶY���(�T����۝�z�~v���,^�|�Q��f&�=���\�-�a �u�.�N��L��uR���Ίڟ-���C^�vyHQ���������.�
�Q�q�����r
'��LQ
�V��ܑ0]�\�\�
E�I݅n�mV���f�ŴW*^�#��t�'J yp��b*L����N��7��noh�،�C�*d��X�U����*�z�G
+�,�K3�AK�.|jYC�*v��:��R9�3�,���^�0�Bf~h?�����!��J8��J�
�xh�.p�U!@��w�u��Y��[�E�
�s� �
��V�x
h��w�ר�ݘ�0�0, ���Dp��������⭵($^^�R���@

+�_L,����s�c�Pn��?=���W'
E>u���1�A�V��|����i��y_��sԃ�?���,aKqC�7\
+��a��7+�XH���pzv�W}���_e;HŭW�t�
q铷2�ya"Ad��@�
9c�}.�2W�����AXC'���n�rvtxx9�.Dz��l���Ʒ/!¾q«L���Yn~�����V ����b
+endstream
+endobj
+14437 0 obj <<
+/Type /Page
+/Contents 14438 0 R
+/Resources 14436 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14393 0 R
+/Annots [ 14376 0 R 14377 0 R 14394 0 R 14395 0 R 14396 0 R 14397 0 R 14398 0 R 14399 0 R 14400 0 R 14401 0 R 14402 0 R 14403 0 R 14404 0 R 14405 0 R 14406 0 R 14407 0 R 14408 0 R 14409 0 R 14410 0 R 14411 0 R 14412 0 R 14413 0 R 14414 0 R 14415 0 R 14416 0 R 14417 0 R 14418 0 R 14419 0 R 14420 0 R 14421 0 R 14422 0 R 14423 0 R 14424 0 R 14425 0 R 14426 0 R 14427 0 R 14428 0 R 14429 0 R 14430 0 R 14431 0 R 14432 0 R 14433 0 R 14434 0 R 14435 0 R ]
+>> endobj
+14376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 695.838 165.446 706.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa317e5d2d782c3589c48cb3b45d6790d) >>
+>> endobj
+14377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.784 695.838 273.381 706.742]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 669.981 150.493 680.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a80b9d602f99df76039d58032b20041d7) >>
+>> endobj
+14395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 602.217 218.029 613.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 602.217 250.965 613.121]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a553ae81ae234cedad36e72b32c967e65) >>
+>> endobj
+14397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 575.986 218.029 586.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 575.986 262.043 586.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a62827195c6aeacf38a8fb3df6df8ff2e) >>
+>> endobj
+14399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 549.755 218.029 560.659]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 549.755 290.804 560.659]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a9f09728ae53c8e3dadeb202f28bb6fdb) >>
+>> endobj
+14401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 523.524 218.029 534.428]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 523.524 266.456 534.428]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a1dd09c87a931132dbee52ea24266866a) >>
+>> endobj
+14403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 497.294 218.029 508.197]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 497.294 255.378 508.197]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ac8b0d22ea3470020b35240f778c34a94) >>
+>> endobj
+14405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 405.122 180.54 416.026]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e) >>
+>> endobj
+14406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 405.122 288.474 416.026]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.207 405.122 410.804 416.026]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 378.891 178.239 389.795]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af7184f692efc0672e3213f6be9d5cf4c) >>
+>> endobj
+14409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 378.891 286.173 389.795]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.906 378.891 408.503 389.795]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 352.66 194.507 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.005 352.66 245.695 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) >>
+>> endobj
+14413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.032 352.66 353.629 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.362 352.66 475.959 363.564]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 326.429 194.507 337.333]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.005 326.429 233.312 337.333]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab9da0d811233cfb64481a7fe08b7f645) >>
+>> endobj
+14417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.649 326.429 341.246 337.333]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.979 326.429 463.576 337.333]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 300.198 226.034 311.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af00b427f47054a80d236d124443c580c) >>
+>> endobj
+14420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 300.198 401.773 311.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 273.967 180.54 284.871]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e) >>
+>> endobj
+14422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 273.967 288.474 284.871]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.207 273.967 410.804 284.871]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 261.848 178.239 272.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af7184f692efc0672e3213f6be9d5cf4c) >>
+>> endobj
+14425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 261.848 286.173 272.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.906 261.848 408.503 272.752]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 249.729 194.507 260.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.005 249.729 245.695 260.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) >>
+>> endobj
+14429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.032 249.729 353.629 260.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.362 249.729 475.959 260.633]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 237.61 194.507 248.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.005 237.61 233.312 248.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab9da0d811233cfb64481a7fe08b7f645) >>
+>> endobj
+14433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.649 237.61 341.246 248.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.979 237.61 463.576 248.514]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14435 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14439 0 obj <<
+/D [14437 0 R /XYZ 89 770.89 null]
+>> endobj
+14440 0 obj <<
+/D [14437 0 R /XYZ 90 712.265 null]
+>> endobj
+14441 0 obj <<
+/D [14437 0 R /XYZ 90 686.035 null]
+>> endobj
+14442 0 obj <<
+/D [14437 0 R /XYZ 90 620.294 null]
+>> endobj
+14443 0 obj <<
+/D [14437 0 R /XYZ 90 620.294 null]
+>> endobj
+14444 0 obj <<
+/D [14437 0 R /XYZ 90 592.414 null]
+>> endobj
+14445 0 obj <<
+/D [14437 0 R /XYZ 90 566.183 null]
+>> endobj
+14446 0 obj <<
+/D [14437 0 R /XYZ 90 539.952 null]
+>> endobj
+14447 0 obj <<
+/D [14437 0 R /XYZ 90 513.721 null]
+>> endobj
+14448 0 obj <<
+/D [14437 0 R /XYZ 90 448.065 null]
+>> endobj
+14449 0 obj <<
+/D [14437 0 R /XYZ 90 342.857 null]
+>> endobj
+14450 0 obj <<
+/D [14437 0 R /XYZ 90 224.785 null]
+>> endobj
+14451 0 obj <<
+/D [14437 0 R /XYZ 90 151.366 null]
+>> endobj
+14452 0 obj <<
+/D [14437 0 R /XYZ 90 128.989 null]
+>> endobj
+14453 0 obj <<
+/D [14437 0 R /XYZ 90 128.989 null]
+>> endobj
+14454 0 obj <<
+/D [14437 0 R /XYZ 90 75.329 null]
+>> endobj
+14436 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F67 3022 0 R /F60 540 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14470 0 obj <<
+/Length 1806      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�F�~����
Ro��
VR�M�(o�k���$���ڦ��wq��;�
�qsnT5_��-��3��>3;Wv�M~:�
>U�	P �t�.� ;�HH��;o]��O�)���
�n�-��c�b7�o��<
�_EY��

U�ϟ���D��*JoJv��a��ቾԙG|W'3mD�].�����䗳��	�C�2)ߙ-&o�cg�_8��wn�I
�S��9��:��0��
ͥ�e@:�$��$�E���E�Ơ��n��Y�J�o
��wX`o*�pgi����
c�[ѵI��
���4�9
+|^�u`g�7� I�	}�#�P�7S��
	L
X��
fT���TN4�L�K�L�=�v���(���
�TN>|*q�U�fܙR���g
n��yѥ�����$����F	D|U���h-���=��B�D��
�����&����*��q�����<*�O�O�d��YZ���
p
 
n��Qmܳ
��ּ?LD��*x@s����r8x����� 4)Q�c� �Ԉ�1ƻ�~S$����d�� ¾�#�`Jk׍

E� �
<xB����e�^]�"�
���u2ۤ��/��y�X��;*0$��?0xy ���Q��2
.`��w쥂x��֎��vãG}�SHI��NB��׃�ـ6�5cp�7!t�����k�9��d
�����d �$m@�Y���2�֞���	���0����c 5c Ì�CV��$�R�a}�;)�G����
�
�Ch�3�KQ�W�
&�sA�At<-�r��7�������W.��B���nj*��{
��#��_��`�����Zv�
�N�0J�P
�
X�>�L���v��
�� 
�}j�UTy���
����Kplɧ��Y�6ݑ���R�\�� A���e�.:T�2���T�7Qre�Ø�����aΜ%R����=��T��\���z�Y+Ғ<[�̜��cDy�1���\��
& !I���Ð(�p�㩺9
=��D!
KUA��
{���O���0?*PK��R�6Ƽ��ͱ�>=�@���G%�mU��g�@@
�Y4�Ϊ�
 �0U�'��S�Ί��؊�JX'��V��B�n�.oB{Y�]�jN��	[֨:�?Ti�B��Q2��s�S�	�TP��G}�$�x}�m��#��Sd}��0��
Ta����˖���

G3k��zq�3;~ZV�y��w@�7ఓ���H�Ѽ�� ,�*�vR�*
�Ϣ�|�^,�2l����Uo�
&=j
r %/��J�(j�B�߳h���EZ�4ނ��i�5�LgU��/0��ћ�B<}��y	D�������}��m$>��x1�S�#�kD�Ŷn��ӃN�c(� !J(�C��_qg��O�/��
��&_Ƴj�g�8�?�j!اc�Y��
8D��y�Mq!�^��r�L�1b��?6
Բֹa\=��mR�-.o7��ꃯX�� l�H8bL�
n�����]�1v�?Z,�H�Ch�}@��֧�
Y�{�ҙ9���8)!�ҽ�a�-���Et+���G�� ����s]������k=3I�C��V
w�(�8d�0�B�)�,���M��Mɣ�c���4
ZL��d�&=k
+v�#��F$
����Q��������][��y����( 34+v�B"�;�����
����;��g_�ɺ��d4�d: :��� �̴o4GޔA�|���*���F/'�n$Se�_���j�<:<�X_��~�fP[o�Xc/ 
U'뺆_�Y�Tx�(���R�����:��5����(E��q�c�b�����9?�`���8�
�
d
+endstream
+endobj
+14469 0 obj <<
+/Type /Page
+/Contents 14470 0 R
+/Resources 14468 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14393 0 R
+/Annots [ 14457 0 R 14458 0 R 14459 0 R 14460 0 R 14461 0 R 14462 0 R 14463 0 R 14464 0 R 14467 0 R ]
+>> endobj
+14457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 257.499 181.845 268.403]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a8ede6a8a55e35d1c41065b01afac0342) >>
+>> endobj
+14458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 229.323 181.845 240.227]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aa303fa28c55c391afe4f067f91db36ce) >>
+>> endobj
+14459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 201.147 154.727 212.051]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a4f7df2a0b66616d7672e562fa8c4e8f6) >>
+>> endobj
+14460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 172.971 165.446 183.875]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a419ea78710f4b45c1542647e1212a3f7) >>
+>> endobj
+14461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.784 172.971 273.371 183.875]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 145.169 150.493 155.7]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a0ca2fc9566495b3d4ac6b970a301d9a1) >>
+>> endobj
+14463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 74.333 218.019 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 74.333 250.955 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aaf9d682418e536d9a1f6bd24991e1c56) >>
+>> endobj
+14467 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14471 0 obj <<
+/D [14469 0 R /XYZ 89 770.89 null]
+>> endobj
+14472 0 obj <<
+/D [14469 0 R /XYZ 90 721.073 null]
+>> endobj
+14455 0 obj <<
+/D [14469 0 R /XYZ 90 674.891 null]
+>> endobj
+14473 0 obj <<
+/D [14469 0 R /XYZ 90 670.407 null]
+>> endobj
+14456 0 obj <<
+/D [14469 0 R /XYZ 90 618.72 null]
+>> endobj
+14474 0 obj <<
+/D [14469 0 R /XYZ 90 614.237 null]
+>> endobj
+14475 0 obj <<
+/D [14469 0 R /XYZ 90 570.022 null]
+>> endobj
+14476 0 obj <<
+/D [14469 0 R /XYZ 90 537.02 null]
+>> endobj
+14477 0 obj <<
+/D [14469 0 R /XYZ 90 502.958 null]
+>> endobj
+14478 0 obj <<
+/D [14469 0 R /XYZ 90 467.894 null]
+>> endobj
+1969 0 obj <<
+/D [14469 0 R /XYZ 90 382.302 null]
+>> endobj
+458 0 obj <<
+/D [14469 0 R /XYZ 90 375.527 null]
+>> endobj
+14479 0 obj <<
+/D [14469 0 R /XYZ 90 276.633 null]
+>> endobj
+14480 0 obj <<
+/D [14469 0 R /XYZ 90 276.633 null]
+>> endobj
+14481 0 obj <<
+/D [14469 0 R /XYZ 90 246.723 null]
+>> endobj
+14482 0 obj <<
+/D [14469 0 R /XYZ 90 218.547 null]
+>> endobj
+14483 0 obj <<
+/D [14469 0 R /XYZ 90 190.371 null]
+>> endobj
+14484 0 obj <<
+/D [14469 0 R /XYZ 90 162.195 null]
+>> endobj
+14485 0 obj <<
+/D [14469 0 R /XYZ 90 93.382 null]
+>> endobj
+14486 0 obj <<
+/D [14469 0 R /XYZ 90 93.382 null]
+>> endobj
+14468 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14520 0 obj <<
+/Length 1564      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�F�_A_\i���� �<�M�i�&n�>d�LKg��(������ !$u&?������oo�V����������
��Jgz���Q�GB���9s�'��
&=D|	o�y�z�������>�
a��R�3[��>bg�_91�s��IK�S���n��[,����
�In��#�9�DH�cz�'.x
d�N�0����2�˫,��ʫ8�/�x1!b�
+ܕ���&p)E�S�%
����>P*Z/9g�� >�pfG��Ӆ5��b�Q|�Dן~��:
+
+�MA;_����z���Z3�

�#�ZO�l�r�*��|>7����6�౎ujL�IZ>�J�Ѽ6ay13S.��|�#g���t��8�����(���Y�X�qĩ_",l��^�O���.��q�|�\c��I��� �YE�Twֵ��sm�}Q)E[�v�D�b*���0EΓ$&H�ҩ���g�|=�]Xf'
}��:�^߅�Ӊ�tm�^X�ĖnI
]�C����@�oDJ�>�՞��R�����`��H@ү']�R�	�	S���"�QU^�_�H���.C(�{�m3�s�G}c
�7�'S��
�n��*�

}g�{?Q|
�h�uR_Å5�l
�|�e!!
+	�
��Aڲ�{(��JJ���R�����*��U���*�/�@u�V|��&��
ʶM�Կq�q�A������r ��Gƺ&�?y�dy��e	���Y����`��7�O�`B��_�5L큒�7��C9��
��ooeo��jm�h�P����{<'}oE�9�<vv�5�C��1��`�:�7;#� 2q	���yFUC��fi���;ܒ��Ui���;�����&h�P�9�yƎ/L��p���&m�JYh��Y����U��p�ȶ��M�Ю9��q��x�5
{	���Z�������	��<�~��"Y&���DO0�@t�h���(vp��V�{R����l���N�X��>^w
�q�ӫ�����kNA¯�BXm
!qR�_��ʹ�nP��U
6e��Z�Xt��8d�B�C
+�S��������!��%���Zh�@���ZJ������%v"OɎa����s�q0�b���k6��A�#��5��&<��6K��"��Mx�ʻ
�<��O����f� �&�����#{�.��|�Kvg�{�<�]�{'�j����Z��<�R��K������Q
RD�I�nR���� ���c�wC|.�	��^[���l��Dؓ{��PZ���Q	����ޔ-�M�C�mL
��$���A�!�����mF�t9��:*?�+L��x���e�BJz�~
+ć���z�""�f;x��!�ƛ�I��}I���G`ӆ�3�������D�muJs+��m����
�m�E�`_*~&�H��U�l^��;���oK�H@�F�
�܍����f�S ��Ji�8vz�Gy�7�y~4K�!�g��@6��b�c:��`���*՞�
�����;���Jl����k`R��:^/�|����|��t�@�d�����>lu�P����_&U�
cx�,ȹ��� 9�M�
+endstream
+endobj
+14519 0 obj <<
+/Type /Page
+/Contents 14520 0 R
+/Resources 14518 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14393 0 R
+/Annots [ 14465 0 R 14466 0 R 14487 0 R 14488 0 R 14489 0 R 14490 0 R 14491 0 R 14492 0 R 14493 0 R 14494 0 R 14495 0 R 14496 0 R 14497 0 R 14498 0 R 14499 0 R 14500 0 R 14501 0 R 14502 0 R 14503 0 R 14504 0 R 14505 0 R 14506 0 R 14507 0 R 14508 0 R 14509 0 R 14510 0 R 14511 0 R 14512 0 R 14513 0 R 14514 0 R 14515 0 R 14516 0 R 14517 0 R ]
+>> endobj
+14465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 694.013 218.019 704.917]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 694.013 259.253 704.917]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_af78754c1ef47797c0acbd31cf48f9caf) >>
+>> endobj
+14487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 592.264 180.54 603.168]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a306699ac7d5f2c2c909c3a3baf303009) >>
+>> endobj
+14488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 592.264 288.464 603.168]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.197 592.264 410.784 603.168]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 562.383 178.239 573.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a5740d23d50b9aa7c95e8b6b51242258d) >>
+>> endobj
+14491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 562.383 286.163 573.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.896 562.383 408.483 573.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 532.502 194.497 543.406]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.995 532.502 245.685 543.406]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) >>
+>> endobj
+14495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.022 532.502 353.609 543.406]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.342 532.502 475.929 543.406]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 502.62 194.497 513.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.995 502.62 233.302 513.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ad99eb5124bfcd9c75379efdde73d1a1a) >>
+>> endobj
+14499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.639 502.62 341.226 513.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.959 502.62 463.546 513.524]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 472.739 226.034 483.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ade82782e3363de460caad677b3583559) >>
+>> endobj
+14502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 472.739 401.763 483.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 442.858 180.54 453.762]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a306699ac7d5f2c2c909c3a3baf303009) >>
+>> endobj
+14504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 442.858 288.464 453.762]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.197 442.858 410.784 453.762]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 428.914 178.239 439.818]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a5740d23d50b9aa7c95e8b6b51242258d) >>
+>> endobj
+14507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 428.914 286.163 439.818]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.896 428.914 408.483 439.818]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 414.969 194.497 425.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.995 414.969 245.685 425.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) >>
+>> endobj
+14511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.022 414.969 353.609 425.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.342 414.969 475.929 425.873]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 401.025 194.497 411.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.995 401.025 233.302 411.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ad99eb5124bfcd9c75379efdde73d1a1a) >>
+>> endobj
+14515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.639 401.025 341.226 411.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.959 401.025 463.546 411.929]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14517 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14521 0 obj <<
+/D [14519 0 R /XYZ 89 770.89 null]
+>> endobj
+14522 0 obj <<
+/D [14519 0 R /XYZ 90 712.265 null]
+>> endobj
+14523 0 obj <<
+/D [14519 0 R /XYZ 90 639.529 null]
+>> endobj
+14524 0 obj <<
+/D [14519 0 R /XYZ 90 520.873 null]
+>> endobj
+14525 0 obj <<
+/D [14519 0 R /XYZ 90 385.217 null]
+>> endobj
+14526 0 obj <<
+/D [14519 0 R /XYZ 90 308.368 null]
+>> endobj
+14527 0 obj <<
+/D [14519 0 R /XYZ 90 285.545 null]
+>> endobj
+14528 0 obj <<
+/D [14519 0 R /XYZ 90 285.545 null]
+>> endobj
+14529 0 obj <<
+/D [14519 0 R /XYZ 90 231.885 null]
+>> endobj
+14530 0 obj <<
+/D [14519 0 R /XYZ 90 227.402 null]
+>> endobj
+14531 0 obj <<
+/D [14519 0 R /XYZ 90 175.715 null]
+>> endobj
+14532 0 obj <<
+/D [14519 0 R /XYZ 90 171.232 null]
+>> endobj
+14533 0 obj <<
+/D [14519 0 R /XYZ 90 119.545 null]
+>> endobj
+14534 0 obj <<
+/D [14519 0 R /XYZ 90 115.061 null]
+>> endobj
+14518 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F91 766 0 R /F111 1509 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+14549 0 obj <<
+/Length 1448      
+/Filter /FlateDecode
+>>
+stream
+xڽX[o�6~���0 ����U��u[ע�
Y�=�E�ȌmL�\Yn��CR�%E�ۤ�C"�:<<���|4�
�^�~�����̋Q
�Ȼ��b�I
#��ܻ�	F�!���~R�����b���z^&7oW�eRޟ�u���"B*��{�l�nx�����T�^�#��_����쏫��˰G�%I������a�������
+�=N<3�����ˆ
+34��Ř
\$��� �D��mQd`�O6�L��|�̼�=8'~Z��ʘ<�
�Ŝ�Vu���:���YR� $vY�"�a5�N�!�+�D�����B�%�Ȕ��#�أ
�G
l�ޏ�k=�P��:ё	#HE�
!A�N��4���
��46
9G�
)E�~��A�i�����&�b:�
�R=&��	dD�&z/r ��G�ǎ�G�$:��'#
��h�O�
�K-��q�O
ZNN -��h1�l*R!Iē6��%�0X�R~XL�Ѿ��Eq�O℡d��q�`

�Bi��ǀEB�'l�*��
+:K@�^h��EL��(��>i۩,�pa�~\0���}c(	���Ee�	p9}�~! 8����v�e^����+砝����A�\�
'ݓ�ϖ0�/
�$�y��,��R�(˲"�����n�=�4�g=�=!Ό�
Au!�T�C-n���r�<<.��z�(e
�����r��D��)�<aT��t�!�dK�j�1�Dꕰ�(�`
Zt�;������b�ql�g���A�|Ks����mAUKuaT7��.-�=:Bݎ&�����&[� Y-��
���
�����7
;G#'ÞEp8�V?��4��us$;��!�,�]�}���m��	K�j�_�D?
+��Jk���*_�rU%��`��*Y��z�
㸻��\J�"�����"�JD����*
��p~�QiE�c��YYO��Z�
�
@�Խ�Y6����F/-�[ݙ����U�vp��FoG]
���@$
L�
+����1�\Ԗ_Z!{�+@ꖩV�
+*����e�pٍ��`� *
�ܖ�=�@��
G���ɡX�6@���F�]��
.���[4U'�
�x���Rq�׷�t��<5�b{ĩ�%���i���{�u�H*7z^��E=q^�Ww��.3rI?P���
+��}9���h�
x�+h�[0u,���n�Tߴ+��tMQ`��
+��&`�,���K����ڕ�H�U�ٽ����'�VM���!��ؚ��ʛ�lN\�Wh 
k�$�AG�m���‘��Hl[r���B�D���4���H`Ҟ���y
�
����W�
dk(Dc8P�!
��]\�u�����)¯q��$
Zc]�-�ȀS�)�2N� ����&L��ڶ�ff;g��j�Ⲫ6g�����V�
�=|�َ/P�d
�����vj����RU��&��A�h��
)i�����Ɔ��_���
+endstream
+endobj
+14548 0 obj <<
+/Type /Page
+/Contents 14549 0 R
+/Resources 14547 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14393 0 R
+/Group 14536 0 R
+/Annots [ 14537 0 R 14538 0 R 14539 0 R 14540 0 R 14541 0 R 14542 0 R 14546 0 R ]
+>> endobj
+14535 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Polyhedron__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 14560 0 R
+/BBox [0 0 362 192]
+/Group 14536 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 14561 0 R>>
+>>
+/Length 526
+/Filter /FlateDecode
+>>
+stream
+x�ݔ�jA
���z�U$��
�

���B!�4�SJ\hz��W���������Z�F��O���
"HahX��+�t
�z~��;���������\�����!��1�G�J>���O�%�y��	��1k��8��)�WݍCow^`�!��=�՝3�r���:W������
X<���m�զ���\��ݼ#"nc�V�F�:���Zm�A<�����E2Ǭ��6j�
�wcʷ�⋪��]���=
�Ŋ1�����	��B���U�ֻ�m�
9pN�>��G�n�z]\s���w3=��J�l�M��$���K8�\"�f��6��J�D>fs�
��N�%
�zڔ�L��!�=5ñ��
0%�&�M�d�X�����h�划

QKW )
��w� ��@0gj&�k
QP�mƊ�z�B�L!k��[�[���ˀfuzl���
�NY}��[%�Mr����VӾ=O�;������z��"ƼG��1�4-���oa��?-�Fi�h��
���D
dN���底���b��
+endstream
+endobj
+14560 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+14561 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /AADMGF+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 14562 0 R]
+/ToUnicode 14563 0 R
+>>
+endobj
+14562 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /AADMGF+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 14564 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 556 722 722]]
+>>
+endobj
+14563 0 obj
+<<
+/Length 14565 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0E���Y���G�CI7^�A�~�,�A-
YY��+Ϙ*����
�;�.�K�l��#����:
p�A!�x�N%h��J��Az�%s7O�֙Q�5d�I�b�a��
� d�Ac��
+��Kǿ���?8������&�{��M���N���6��*�f�P|$5j��T������MZ�@���ʼnm�Q7��H�y�����P0툎%SŚfڳ�0
X[�Ȥ�N���tf��$��L=SŤ����fm�L��
�N9k����vL|�
+)�5�%�e���{)~<�$n
>ކ���&�
+endstream
+endobj
+14564 0 obj
+<<
+/Type /FontDescriptor
+/FontName /AADMGF+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 14566 0 R
+>>
+endobj
+14565 0 obj
+303
+endobj
+14566 0 obj
+<<
+/Length 14567 0 R
+/Filter /FlateDecode
+/Length1 1760
+>>
+stream
+x�UU{lSe?�w��Ѳ�r�`��]׽���ck�^���
+�c�n�c]7�c�MLL�!JL�@b�Ɛ���(���1�d!р�f@j$��|���6�;���;��9��@  ���}g*6���q��w�

���_��|@q71������E�;�
+��P��Dj�d�
E e
�ݣ�1 �e��Q�b���-*��ʫ0f���,p����/7�(�H�dXz���Wt�N<׏�x.�����f��0(E��i�&49�{;�
�'�4���W(�}B��Φm�l�h�2����@%8��0�y����U�2k[\��
O#i N��L�#8�
�������xm^��`�TF���ԥB��R�Zkú�ze�5Z4�U�&w�IW+�Ƽr[O��h]Y�-��W(U�����.}�Y5��jjC5X���Ŝ�!/ z,J�7�a$�H$�ci����ڵKzH5;6�
ڴa1���	�X8�����C[O���)�pv#�j�#�PMך�P���.
 I�'�^�b�c*����eN`_@�7��o��#�8Z2�����A�G1��a�u�T:������ѱ�#�P��uS��̼v��
ɝ�I}�Jm��1_Xg����>a-���.c%7��(�
ƨp1�	'
+䕾{�����ϩW]읦����e~��4L
�dq"wЗ�|	�_Ċ�j�l
+����uݽa��c���[tV��^���ʵ�pf֪�� �&�3�D.�
J+�S"
!%��asD��o��˩��"�t�XI�a���
����B�u5yj��ۻ5�g1�� �,�̔7�d�.'�7�
���ꃮ��{�Cã�S-�H�/bx���~�թ�7�B��x���X�@��s=�U2lMz�)IH���f�R�a�3��
Cߣ7�΄�8
��Z2��ύ��\����7���Bo���
^�LL
N��࿍��Z^#�l9}��{}��Z�R:�;0����
{+�fq��	�G�'���b/,͹���m�T���s40��
�J{��5�X�ގy_��Y�g#�h�W�"�
���Vsv��~�{�z�v`�ȡc��A~�$=�h_Ó��ő�s.���?�n���<��X�4b�'w�]F"��tR:
"S��/"��F�s��
�;A��^��G����EB&Æ]>���9
�W`'U�W.F�5h��(�����"�"Qm�7��(�B��]f��/�~Z�O�H��9E1���W��#�)~�g�N9����e��s�Ok���@+�6Z [...]
i4��ۘ�E����T��
�}�L���
~��H#d��@���&�.r	������P\.(���u�
+endstream
+endobj
+14567 0 obj
+1357
+endobj
+14536 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+14537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.279 189.57 192.296 200.474]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.794 189.57 258.726 200.474]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5dfef947c46e234a1ffd4707312332ec) >>
+>> endobj
+14539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 99.272 190.738 110.175]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 99.272 261.85 110.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a43cd840b1ec99350c222b3f217739cea) >>
+>> endobj
+14541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 190.738 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.236 74.333 262.159 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a97ddb3b93ac699eebaca7e79f691b0ad) >>
+>> endobj
+14546 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14550 0 obj <<
+/D [14548 0 R /XYZ 89 770.89 null]
+>> endobj
+14551 0 obj <<
+/D [14548 0 R /XYZ 90 721.073 null]
+>> endobj
+14552 0 obj <<
+/D [14548 0 R /XYZ 90 693.576 null]
+>> endobj
+14553 0 obj <<
+/D [14548 0 R /XYZ 90 659.513 null]
+>> endobj
+14554 0 obj <<
+/D [14548 0 R /XYZ 90 624.449 null]
+>> endobj
+1254 0 obj <<
+/D [14548 0 R /XYZ 90 541.067 null]
+>> endobj
+462 0 obj <<
+/D [14548 0 R /XYZ 90 533.719 null]
+>> endobj
+14555 0 obj <<
+/D [14548 0 R /XYZ 90 206.325 null]
+>> endobj
+14556 0 obj <<
+/D [14548 0 R /XYZ 90 206.325 null]
+>> endobj
+14557 0 obj <<
+/D [14548 0 R /XYZ 90 139.219 null]
+>> endobj
+14558 0 obj <<
+/D [14548 0 R /XYZ 90 114.109 null]
+>> endobj
+14559 0 obj <<
+/D [14548 0 R /XYZ 90 89.359 null]
+>> endobj
+14547 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F11 621 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R >>
+/XObject << /Im25 14535 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14628 0 obj <<
+/Length 1953      
+/Filter /FlateDecode
+>>
+stream
+x��[[w�F~�W�Ʌs��^t���i��4M���K���� Iء���		�F�q>�bwvv�of/`kla�u����+�Y
q���ͭű��
9.�7�>tm��}�yc1�G���K�~�ǻ���n��w��7��
_a�h�|k8�|����~caĸoݫF3˦
>��u��6��*ݸm���kK݈��G�D�V��I�J=._�ҫ�
#�
+��nQ�g#�y���up7�5����y��-?b�t#Zl�M´fHʐ璼4Q���<[����l"��0=�s��
�f���Q��&O����_w��Ap�#�ԔFBw�3�a
���Ȧy\;k�A��2m�
RUT�Qq	�
s�mߺ �s߸�#�κ���a
��nS��M� ����2�Ĭ� g�e

i]����Gz�ƕf��V�B�k�(Cܳ�x.ܬ
R�xN=�t�^��Z
%mJ�	���(����Q�X��}�M�S�Cs��FA��u}�_��k�$����n�"�
_�%J��MA5���
����1�CP_#��n
�TkP�6 �q��P�9e��nG5���rH�yL�lY��Sw
�0�)]����.ks�(�������{�mWVRȱ��<�T��.{���*��~���~�o+~e.��U���+�
�	k�W��_i��q
�R
�R���T]�?���e`",�w��<	��h�N>��<�*Qu��ތ �

����},�����S��Z	�݉i�W�ق�k�YkxH`P
W��(�1�M�� �@d�BDk��`��%=��jsm�����N4T�d�U]��\�(��<	Ú1
�����#L]
I��(�A��DP+ʤZ��OHۉ���l.����5q��C����f�Q=��ж��J�[��*���i��K�
�T
�x���a�WfG*�j�S�Z������L�_�!���
[�PN��mm�q}�1�J;�u��S9y�9,�yt�=�t�$��$'�
�\�&�z!/u1m��Y
���pL!q
�q*F'7�fmV�fcZc7m_��Z
R�U7
�<p'����
���c��(L���v�m�(
+�
��9Ζ-����b~]q�ˋ��F���{.EWF��^�u�<a�i�>�q���NY�SIeD}�ؘX��0���"���)Y��� �T�Q�NP���?��lM���G�ܜF��"H�d�o�*{��C�a?5���I��]������ 	�������"H�k�_C2wAR3�a	����<�ú�� ��O��|�㵕����n��X�[/"�"߂Ⴄ���<�;3g�����8�j�d*��V�sĩ<"�;`��G��!ද��0�����
Pz�~�������=}���Y�E
���f�7��p�Q8YI�����X��(���PlxJ`�������&���4:�
���9�k.:&�ϔ��G�
���Cb�Q�?f��Wb�#&f���
<�ו>r<�����G���L?���F��c)�0q�Go�(��J�++�i�
�T�
��m?���'ϕġ����C}�1<�W/=
�|�uu�a1��h���r
��<#U�l [...]
+MK
�
򋌡��Uܐ ��\���qZ\ ܠ�1 ��πШ)��o�[��Y��d�����$P��̀�XǪ��߄�X���&���
�حq��
��0����Ƽ�m����V�
��1�J����/{/}�����˥��Az� 6�!Z�#�E
�~����!�x
U_��՗y�����~�A�J�ȻX	T?kR+E�� ��|Pe���WWo��_�H~�9N�X�� Z�����Dq}� ���pEP�@B�9�i��-T�M�
�)��ad�E~�d������b��h��kg�k�
a���m~�<��¿�r��Nm8����;
+endstream
+endobj
+14627 0 obj <<
+/Type /Page
+/Contents 14628 0 R
+/Resources 14626 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14393 0 R
+/Annots [ 14543 0 R 14544 0 R 14545 0 R 14568 0 R 14569 0 R 14570 0 R 14571 0 R 14572 0 R 14573 0 R 14574 0 R 14575 0 R 14576 0 R 14577 0 R 14578 0 R 14579 0 R 14580 0 R 14581 0 R 14582 0 R 14583 0 R 14584 0 R 14585 0 R 14586 0 R 14587 0 R 14588 0 R 14589 0 R 14590 0 R 14591 0 R 14592 0 R 14593 0 R 14594 0 R 14595 0 R 14596 0 R 14597 0 R 14598 0 R 14599 0 R 14600 0 R 14601 0 R 14602 0 R 14603 0 R 14604 0 R 14605 0 R 14606 0 R 14607 0 R 14608 0 R 14609 0 R 14610 0 R 14611 0 R 14612 0 R 14 [...]
+>> endobj
+14543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.225 708.28 390.082 718.186]
+/A << /S /GoTo /D (index_Affine_Independence_and_Affine_Dimension) >>
+>> endobj
+14544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 695.976 226.443 706.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.183 695.976 282.343 706.88]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7b8d597a3c23af1fce9d8d3e1d36e11d) >>
+>> endobj
+14568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 670.02 226.443 680.924]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.183 670.02 329.944 680.924]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab7a35f8df974c9e932df6291754859fb) >>
+>> endobj
+14570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 644.065 224.76 654.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+14571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.499 644.065 278.986 654.969]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a2bf7987a6ee3547c1e125e83e432ee2a) >>
+>> endobj
+14572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.616 618.11 224.76 629.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+14573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.499 618.11 326.587 629.013]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae1c5216e2ba5c80d77e128daea25b46e) >>
+>> endobj
+14574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 592.154 209.547 603.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+14575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 592.154 261.831 603.058]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6fb94f0e966e97bfb9dcf43dddcf12ba) >>
+>> endobj
+14576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 566.199 209.547 577.103]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+14577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.045 566.199 309.432 577.103]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac6ea1802e6a6cfb32e5af6d6d26eb424) >>
+>> endobj
+14578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 529.285 205.692 540.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 529.285 261.312 540.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9f3c5474494eb306717bc3da7c109307) >>
+>> endobj
+14580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 529.285 332.156 540.188]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+14581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 505.322 205.682 516.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) >>
+>> endobj
+14582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.18 505.322 261.302 516.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0514c2e57ac8154666e9fe6bb56c0e18) >>
+>> endobj
+14583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.64 505.322 330.462 516.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+14584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 481.359 205.692 492.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Poly__Con__Relation) >>
+>> endobj
+14585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.19 481.359 261.312 492.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6187dbe974649c7bd4de8e66f70d3e46) >>
+>> endobj
+14586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.65 481.359 338.781 492.263]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+14587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 457.396 183.824 468.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad909d5b60cab5d1a6816577c97b60fcf) >>
+>> endobj
+14588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 431.814 192.272 442.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8c33b9ea975535b5aa0882241cf78986) >>
+>> endobj
+14589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 405.485 241.935 416.389]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8ed700f662722cbebdc9328344ba2839) >>
+>> endobj
+14590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 379.53 213.163 390.434]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac251eb38d1b24b8b570d874ee11df424) >>
+>> endobj
+14591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.501 379.53 288.431 390.434]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 355.941 189.901 366.471]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0d9abbf681b7b0724963d97596286ae5) >>
+>> endobj
+14593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 329.985 193.229 340.516]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa0ac997a15935821583174de968e5bff) >>
+>> endobj
+14594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 303.656 238.459 314.56]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_abbb7562de97ccf13bd97b57bb5e3ac94) >>
+>> endobj
+14595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 278.075 187.689 288.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae3be29eddce8f41019e7dcb731c8ba7b) >>
+>> endobj
+14596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.505 278.075 226.693 288.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 253.738 228.895 264.642]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af740303d5461c838735ec53c5c1f8855) >>
+>> endobj
+14598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.232 253.738 333.482 264.642]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 229.775 229.503 240.679]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a31d70a625e092dfdaed4f3232701f35d) >>
+>> endobj
+14600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.84 229.775 334.089 240.679]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 205.812 187.264 216.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac5c7acc50141a9104ef5b9b7598c1438) >>
+>> endobj
+14602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 205.812 293.213 216.716]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 205.812 371.148 216.716]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 205.812 455.727 216.716]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.98 158.935 187.264 169.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae680437fdc213b7174c581caa2e0c0d3) >>
+>> endobj
+14606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.963 158.935 293.213 169.839]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.131 158.935 371.148 169.839]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.711 158.935 455.727 169.839]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.235 146.98 220.058 157.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+14610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 112.059 186.348 122.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad914801461cad05325559e95b9c4d9c6) >>
+>> endobj
+14611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 112.059 293.772 122.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 112.059 373.367 122.962]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 112.059 456.837 122.962]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14625 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14629 0 obj <<
+/D [14627 0 R /XYZ 89 770.89 null]
+>> endobj
+14630 0 obj <<
+/D [14627 0 R /XYZ 90 711.269 null]
+>> endobj
+14631 0 obj <<
+/D [14627 0 R /XYZ 90 685.314 null]
+>> endobj
+14632 0 obj <<
+/D [14627 0 R /XYZ 90 659.358 null]
+>> endobj
+14633 0 obj <<
+/D [14627 0 R /XYZ 90 633.403 null]
+>> endobj
+14634 0 obj <<
+/D [14627 0 R /XYZ 90 607.448 null]
+>> endobj
+14635 0 obj <<
+/D [14627 0 R /XYZ 90 581.492 null]
+>> endobj
+14636 0 obj <<
+/D [14627 0 R /XYZ 90 472.689 null]
+>> endobj
+14637 0 obj <<
+/D [14627 0 R /XYZ 90 446.734 null]
+>> endobj
+14638 0 obj <<
+/D [14627 0 R /XYZ 90 420.779 null]
+>> endobj
+14639 0 obj <<
+/D [14627 0 R /XYZ 90 370.86 null]
+>> endobj
+14640 0 obj <<
+/D [14627 0 R /XYZ 90 344.905 null]
+>> endobj
+14641 0 obj <<
+/D [14627 0 R /XYZ 90 318.95 null]
+>> endobj
+14626 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F66 3165 0 R /F68 3017 0 R /F111 1509 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14697 0 obj <<
+/Length 2801      
+/Filter /FlateDecode
+>>
+stream
+x��[[o�F~��ГW��\9��-��6E��M�Om!�%�H��⪿�g.���([N��>���3g���w.
��f�'?^���ճ�MR
�&���'�+$<�o5�eJ0��lN0��73��A�
ofO���6\���Ut�����gğ&�lN�>�Yf/߆������e�S���o�����Շ+��	��$��rw��ox���?M0bʟܛA�	�
�n'��s�ݦp}s
�m��<xB����Ra/
��2�ٛ$ٺ�Z�t��zkF0E��(�vџa�i���W,�2��|x�WQ
��?��0�"���\tz
Έ��ӯ�'�ԟ>O���
+X�e�y�p�Q�^ď��ڙV_����&>�?����V��FY����
?�q�y���?^o@��¨�ۦ՟�P
$P�Ǎ�9" �9��+f�y��4����^ B5�����y��Ɯ�!�Y1(Z�H
#^�
��
�-��<
ڨ��>�O�zY� 
y���6�Nˑ�E�$�r����P�ֱ�R�� ���M��W����)����n�{���C
+&��"
+ H�r���B�i������qn
&�I�8 *�}bd��S~�.�X
�j��l��k_}a��%Q����[�4&�a�F� �촖�W���V��1g�
�R�vw�<\��/�hoN�Dܷ��Q�G�s����Z�Ñ�*
��a��fd��@05$�t�
>�V���L�72H�gN�:9ռ� O����
l%6�69g��cY��dU���G�*�����&X�3��aU�*~�K�3��:��#ʴ�i������ލ����L!�e�6�됏��ҍ��#'J�w0
5yd
���T_SN����An��*é��>�F��k%	�GL�:k�㷳��q�2��|U2�0��t�qϣ��4"
�6�ǐ
{�����^qx�7P�<NF{��y��AV�1��� �
�/ǐ��{�1��TW�Ѯ@	�Dġc*��?1Da$�F�@EY�F�|{X|�a���)�(
1;r���B!)�e��du)0���>�g��n���
H�&�vm
+�m^
�a~
�~�J#Z�n�G�N�>i�y֑@B(�2�(�s�J�F`�<� rA+ϻ�`���>څ��଻�Z?�5?��{�u���{���>^��DV�
�L�u��:YE�Ckk
͆��
p6���f�h5��`�Z#�Aԝa�d�烓\/
f
���Ze��e��9=&�m2�Dh��j���uW�
�'-Ce�,wC�f��\D0\
��d��s������sJ��������	�����qd3
h����H���<��F�l��_K`��$�D�핬��A=
i�
��À�{�8���bE
 j��M��Q�60���A����xj��v�
��uf��fA��_��#H�z/�����U�$9C�e��×-��*���s�
�<t��͡��r�V���SI�@X�' �
��E���%�N�f�(�֞�c�<� T�1
oj�C}�螶�ojﲊ_va�p���dc��'���떠� �@�B
l�d��A���Yl�4,�/�i�aqk��(6���D��pP{g���l�δ��>G��nj�^(?�0-��ɓ%��%2�!�m�
"��H�i��1=��j��z36�C��H�4�����`�X_��bM�~9h$�&���$c�� Z� ��;�>CjL_��x����� Yw�Z���N�F^;�|��E|9dh3�'�Y��-��ws��+��C�
+>���&�Qߖ��?/�UOt�
F	EO4��')h�r�%��T쒻��ܸͪE���F�
l�H|�|�k��(e>M�x
+���⧃l���m�G�
+�P�d?0�S��>��$��)

̡M:`�v9-��i��ii�iY`p��ʹ9� �߅�4���p���3�s;l�7
/��B���V���:@����v:�|�	"�i!���ab�?�#�js��~ƈP��$��6��hd<�#B�
�h�<0����[sИ���������Z�����dJ��/+Ծ]��DJ�kw�!��m��m���8*�%�}�\��C¯��
��8�9s�x�x�}7Iwš�f�9�%�hiq �e�N:��x+k��JIaW !�';O{�~�;����5Ƚ��ڑ��	|9�-���}hP(�e�F�	�O���x��G�V@(*��sh-��d��훷aO��i�Υ�
���
jvm�W Zy�w�M��i]����\oõ�)9=e �?� s(���
�	��	��m@��yZ{��T��x-���X���d��l9Z�-���y�%b=2�`Y�#I.���R/��a���wu��f��h
΢��tu���
�c
F��75lݎd�
�t��H��a�]���@3�v��2�quл�Z�?�h��ҟ���g�#=�*I ��J���>Q�
+|5U�
Rʻ�ū�\�Ex9U�O��G����D6��R�?�>0������6�3Խ��ï�cD����	�
+J�\�W���˓c��['�
\DZ�x����� ���Uw8 
+�^�AWrs�<��yAW�
qn��ȫJ_0��yE_�ջtb�;_�.���v΄4��4|�ml%1b��d�U���6;�br��_�"I�د~��|��f}�]gPF����7��t�?fB��^1x��,<?je�iu�� r���}�aO߅E��
+�����Y����+���Ҙ�y~���g7�M��Lvǔ�8��e�'@H�-\����Q�#m����<�� �~��\ 'jFԯ͏Ń�Ƴ�;6�>%WW�*#-�
+endstream
+endobj
+14696 0 obj <<
+/Type /Page
+/Contents 14697 0 R
+/Resources 14695 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14700 0 R
+/Annots [ 14614 0 R 14615 0 R 14616 0 R 14617 0 R 14618 0 R 14619 0 R 14620 0 R 14621 0 R 14622 0 R 14623 0 R 14699 0 R 14624 0 R 14652 0 R 14653 0 R 14654 0 R 14655 0 R 14656 0 R 14657 0 R 14658 0 R 14659 0 R 14660 0 R 14661 0 R 14662 0 R 14663 0 R 14664 0 R 14665 0 R 14666 0 R 14667 0 R 14668 0 R 14669 0 R 14670 0 R 14671 0 R 14672 0 R 14673 0 R 14674 0 R 14675 0 R 14676 0 R 14677 0 R 14678 0 R 14679 0 R 14680 0 R 14681 0 R 14682 0 R 14683 0 R 14684 0 R 14685 0 R 14686 0 R 14687 0 R 14 [...]
+>> endobj
+14614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.717 707.957 186.348 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6e73a7d462d6a9a3891fff6c4a923495) >>
+>> endobj
+14615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.523 707.957 293.772 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.35 707.957 373.367 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.82 707.957 456.837 718.861]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.581 696.002 218.404 706.906]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+14619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.772 662.049 187.446 672.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7af48c81caa850300e6042bea1008a38) >>
+>> endobj
+14620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.73 662.049 292.979 672.953]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.431 662.049 370.447 672.953]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.745 662.049 456.762 672.953]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.06 662.049 513.996 672.953]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 650.467 159.485 660.998]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.603 650.467 240.62 660.998]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 616.141 180.496 627.045]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5df26655af3ae7844569d7086edf8332) >>
+>> endobj
+14653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.834 616.141 255.764 627.045]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 593.146 213.153 604.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac2182f38e9f8acede601c3dcfa71c3b3) >>
+>> endobj
+14655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.49 593.146 288.42 604.05]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 570.152 161.677 581.056]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a13f15417d90174f6c2d3648e83d9fcf5) >>
+>> endobj
+14657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 512.192 205.752 522.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0a5c586d872f15baf7fd70941fc16c41) >>
+>> endobj
+14658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.089 512.192 276.595 522.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+14659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 488.824 204.078 499.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5d53d09dcc839672fedd4ab5d4142d57) >>
+>> endobj
+14660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.415 488.824 273.238 499.728]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator) >>
+>> endobj
+14661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 465.83 212.377 476.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) >>
+>> endobj
+14662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.714 465.83 289.846 476.734]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+14663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 442.836 209.627 453.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af60c3f345fb8ec8c708e49e8fa33f737) >>
+>> endobj
+14664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.964 442.836 314.791 453.74]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 408.883 248.202 419.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a4f9a47ba1b29f1e07a32542584d50686) >>
+>> endobj
+14666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.018 408.883 329.845 419.787]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 385.889 207.953 396.793]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9a45b4b8f148a20359a2f3e2b1c2cb2d) >>
+>> endobj
+14668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.291 385.889 311.434 396.793]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+14669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 362.894 246.528 373.798]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab1b315e7f04c051a36f48d344dd34052) >>
+>> endobj
+14670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.344 362.894 326.488 373.798]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+14671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 339.9 216.252 350.804]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a96e902093a55f87f0aebc2bb13a8d740) >>
+>> endobj
+14672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.59 339.9 328.042 350.804]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+14673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 305.947 254.827 316.851]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3569a428ad758dc9ac8273e0f1f77772) >>
+>> endobj
+14674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.643 305.947 343.096 316.851]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+14675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 272.368 236.745 282.898]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad6a8cc7029bad7ad7ad116c90ff59aec) >>
+>> endobj
+14676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.082 272.368 307.588 282.898]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint) >>
+>> endobj
+14677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 249 243.37 259.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a236a18fe8cc922d00ee92a6c6e42f923) >>
+>> endobj
+14678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.708 249 320.839 259.904]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence) >>
+>> endobj
+14679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 226.006 240.62 236.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_abfd98397c137d81dcc27111fba3ccd54) >>
+>> endobj
+14680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.957 226.006 345.785 236.91]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 203.011 247.246 213.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa26e1a5815b7a0c3b610395c854594bf) >>
+>> endobj
+14682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.583 203.011 359.035 213.915]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Congruence__System) >>
+>> endobj
+14683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.378 168.062 290.595 178.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a075036249d2478e1710f5d6350c849f3) >>
+>> endobj
+14684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.489 168.062 374.904 178.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.429 168.062 417.156 178.966]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.341 156.107 279.756 167.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.177 156.107 321.904 167.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 98.244 339.618 109.147]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aeeb72a31f8e1823de7a8123585a331b6) >>
+>> endobj
+14689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.76 98.244 420.175 109.147]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.824 98.244 460.551 109.147]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.938 86.288 306.353 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.986 86.288 347.713 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 196.835 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+14694 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14698 0 obj <<
+/D [14696 0 R /XYZ 89 770.89 null]
+>> endobj
+14695 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F39 2335 0 R /F11 621 0 R /F67 3022 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14794 0 obj <<
+/Length 2873      
+/Filter /FlateDecode
+>>
+stream
+x��\ms۸��_�O�4�x�io�wMnr�^����FCK���D�Hډ�� (�	$�3���Lfb���ݥ��n�'�_|{sq�Z�I�I��f=	�D� 		��&�\���7?L�Ԉf�������W?�\��.^�\�rA�+<!��@JO����?��
+
�0��z���O8e�s7����.xi���|��7�
o�cD�"�y�cG����Ե�X���2�cn���(�$��A�f[Pj�LR�
�a�ofs�%
��5]&q��3"��6�ݗь���C:cjeY�r�o}\"Q���h�;R�|�Qdz�# ���t{��}��H�n'6��ط�F���on�m�ʑ߅�6��W���6���r;�:7��"��dN0
+DP�#���C�T��D��h�=\2��*�D���Q�`�fs��&��(���Rq:I�@ab&i�SjV�?��
���6�*�y���
��)I$ti{��!��}�D����ѻ$݇�{���h�{�Q�0����śx�x!� �J�}SrR�	e�>MO��Bһ�}1y?gT�A8S]��m���l'\�,OҨ!Q;5�3������c�@
*���SՐ��Pk��?\�c]x}K1��'�A�qvpj��sj�KD�����w\
�����dI�y1!W�y��{���BcD�u�	��q�,�Yy
�Y�A)@����(���&�f��ʭ���<n�`�MG�`���^Ġ Z��� �aAf����=�M�|�o%���~�a�
ow�o�S��C��%9q�_��p����c�ĺ� ,w�x�n��-�7h�>�J־#�	�r�
	�R8�n����~�3;���|���v�Y���G
�.��!L=��ׯ�� ���0˶wV��"V�k
��*�N%3���<j��/��\#e���*_G�*
���Q�#vYX at 6�	P��M�
6ʂ 
+r6Rt+U;��M
��
0��
�fQ�
p�
8�0K���"҂ԌcX�l�J��Q�1x3�7mO���u��n�g3
�_�?@D�蘦bc�
N
��pRz�ɼMv��h�&^"����F�a�-sYߑhT�O��IR
*�+�1*�,�!�
M��
�ŋ�$^�x�
$�rУ��@L���8q���IJv �Xl�w��a�E����FL=�%Œ���P,H�8��Q��M���3T-���m�R���k�I�Āu
�S�!�8W۵	c�Q���#�4�AQ΍(�6��a��'�q+�8�I�Y*1��x�:�mr�ϾOu�	�.��z�$�~d��a�]?.�3�� �<29���o�/���$5%�2�2�{�
��(�3�Q��n�(��s=��

+ .����~�6�g�l����
@C->�s��o�^��"%�u��:Rx���m�:��}G�ŕ
n^���
�9n������0�h�gBL�4�QP��Ԋ��vޝ�3�	Y93��I̸��c:
0a3��m
�����Ce�Go͠K��:���r��¤^���K��"�
+
��
+
���*���6�$�C��O�I����
֜�7��t�8L?�p���#٩�tN�a�	�?q�c��އF����e��4(�X��
+���n����6����0@�x
.M	�<�t�6 ��B
�BDu%���tC\E�GC�š��*��`aˊåC�Q�BdȌ�Ռ�����7z ���:䯬CR����~��M�|REVja7���
&�}f_��2���Z����3�6
]�U�4!�9�M�ؠl��7Ny�%N�x�\��'��Єh�R
�AS���zU�
|+1�v�,�TȬ9��͠��7�������WqAQ�}�Q U���A�XŔ����
�����]�����
4X)%����6�U0`
�����?��)4\!t=h,�	 �(�A����zr�F��]Gi���;Z-��7T���H�ķ�;:��+Z�׮[�Ëk��Ά
�Z>��u�+�C'w&P���L�	�Ȉ;�Ḡece`Y�q�
�6�
u@K1#�nNङP�E�����8r}I�|
�����N�I�]��
 +�|�	5="%���\�! �`H����sS j�5�Q��M�kMG
��_�&�5;}�
�d7;��i�/ee��i��e˯m�m�Y����s��XB���c��s
+" �U�mk�T���5�ʹV=I�jk5n���j�T�2Y��B)"U
�}��MhZ�1�^�.�+
+
;	�c�t�Kb��%�扆�w��Im��'�
��M)k�	��7.�����Ҿq0N�F��.�
��E!���]X�"�\s�"�
����P��>�����
��]�3�����6���4)��_���'_)L�
����|8�r�ΫX2~N��.w���y0Ň���R:3��5��a�O[`M7��Н�L�H@����j;�

�\"��8�3�[�<�a�y#��#����x
���
_��gW
g��npn.
���w�6>��K`��f+I/ ��I$T+��_B6*��C�<Z��G�=��gE�Ӣ/��
�NGݗ|������fa��x�|�o3~F��?�7ZD��Y��"��ԑ~843[5l&?�99�
J�0;	��+����פ��M*pƧ�����Ќ~B6�Lo�Ը�CY 3i�̠���u��4��ļ?Y���
�+ at R��r}��
+�M�
+��&
���*�"�j���9�7{6�S�*rs�7���&�|
�X?=.jO��h�o���>�=��ߙF�Š���aa�F 愢��CD�T�k
�3 ���(J�ۿJ��l�R���d������������]�wh��Om��:p	��L�$u
��;�E���V�W�>�� ��d
+endstream
+endobj
+14793 0 obj <<
+/Type /Page
+/Contents 14794 0 R
+/Resources 14792 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14700 0 R
+/Annots [ 14721 0 R 14722 0 R 14723 0 R 14724 0 R 14725 0 R 14726 0 R 14727 0 R 14728 0 R 14729 0 R 14730 0 R 14731 0 R 14732 0 R 14733 0 R 14734 0 R 14735 0 R 14736 0 R 14737 0 R 14738 0 R 14739 0 R 14740 0 R 14741 0 R 14742 0 R 14743 0 R 14744 0 R 14745 0 R 14746 0 R 14747 0 R 14748 0 R 14749 0 R 14750 0 R 14751 0 R 14752 0 R 14753 0 R 14754 0 R 14755 0 R 14756 0 R 14757 0 R 14758 0 R 14759 0 R 14760 0 R 14761 0 R 14762 0 R 14763 0 R 14764 0 R 14765 0 R 14766 0 R 14767 0 R 14768 0 R 14 [...]
+>> endobj
+14721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.88 673.835 279.318 684.739]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a49fe44155b41ca85f41b2abc99c39e13) >>
+>> endobj
+14722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.914 673.835 302.514 684.739]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+14723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.541 673.835 344.268 684.739]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 637.845 193.577 648.375]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3c1e5a2419a5f4a5cf89133606ed1680) >>
+>> endobj
+14725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.393 637.845 232.581 648.375]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.059 624.594 248.845 634.499]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+14727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 602.478 193.577 613.008]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a05fba1023938607f7c5e345c0be716e3) >>
+>> endobj
+14728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.915 602.478 277.691 613.008]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.391 589.227 247.177 599.132]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+14730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 566.737 223.465 577.641]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8132d1a9b329271fb4f7faeb59c89c39) >>
+>> endobj
+14731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.802 566.737 298.732 577.641]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 542.328 215.176 553.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a4b428098e57a9101473a54cd71a0753f) >>
+>> endobj
+14733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.513 542.328 290.443 553.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 517.92 229.552 528.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7e68bea365fe939d08c91ec4edc61a2b) >>
+>> endobj
+14735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 517.92 304.82 528.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 491.519 239.804 502.423]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a672b0568e7a27c37b3afde649f7c0171) >>
+>> endobj
+14737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.141 491.519 315.071 502.423]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 478.641 275.476 488.547]
+/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
+>> endobj
+14739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 467.11 217.109 478.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aeb14f5522982b3874f2cd19586813421) >>
+>> endobj
+14740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.446 467.11 292.376 478.014]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 440.709 271.126 451.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa809bff4b85d09cd801e5e5cde1b8c06) >>
+>> endobj
+14742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.463 440.709 346.393 451.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.863 427.832 326.259 437.737]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+14744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 405.342 198.26 416.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac93800b9ec7aae75937598e1f2209b1f) >>
+>> endobj
+14745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.478 405.342 236.665 416.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.067 405.342 353.317 416.246]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.074 393.76 246.458 404.291]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+14748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.306 380.509 269.939 390.415]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+14749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.464 346.064 223.57 356.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a26cdbeaa84beec1df0c9f86b73b20cfb) >>
+>> endobj
+14750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.75 346.064 262.938 356.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.197 346.064 359.613 356.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.224 346.064 400.951 356.968]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.288 322.901 212.768 333.805]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af47944944e16e786df5c0671e7baa995) >>
+>> endobj
+14754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.771 322.901 252.959 333.805]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.896 322.901 375.145 333.805]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.616 311.319 286 321.85]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+14757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.401 298.069 277.928 307.974]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+14758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.443 275.579 250.099 286.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a4f514edad990412bd66cc666347103ab) >>
+>> endobj
+14759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.258 275.579 289.446 286.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.772 275.579 379.512 286.482]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+14761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 275.579 513.996 286.482]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 263.623 416.369 274.527]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+14763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.304 249.537 439.335 261.702]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 228.256 261.881 239.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a08e91d11b3deb5b694356b5573d2547a) >>
+>> endobj
+14765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.098 228.256 300.286 239.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.764 228.256 388.504 239.16]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+14767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.95 228.256 520.199 239.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.985 216.301 416.369 227.205]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+14769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.87 202.215 449.708 214.38]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.091 180.933 250.748 191.837]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a50e1047c49fffb06bc5089a06a051a3d) >>
+>> endobj
+14771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.068 180.933 357.317 191.837]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.405 180.933 456.145 191.837]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+14773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 168.978 202.344 179.882]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.005 156.101 446.071 167.057]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 133.611 261.881 144.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_acbc86683af6afc0818cc9e980a84fcb8) >>
+>> endobj
+14776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.022 133.611 365.272 144.515]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.052 133.611 460.793 144.515]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) >>
+>> endobj
+14778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 121.656 202.344 132.56]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.222 108.778 466.67 119.734]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+14780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.933 86.288 239.984 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae89cd985111a1a27c60a6fcc28ae9788) >>
+>> endobj
+14781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.633 86.288 280.82 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.855 86.288 405.104 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 86.288 513.996 97.192]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 171.361 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 74.333 478.077 85.237]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+14791 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14795 0 obj <<
+/D [14793 0 R /XYZ 89 770.89 null]
+>> endobj
+14796 0 obj <<
+/D [14793 0 R /XYZ 90 533.436 null]
+>> endobj
+14797 0 obj <<
+/D [14793 0 R /XYZ 90 482.627 null]
+>> endobj
+14792 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F67 3022 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F66 3165 0 R /F42 539 0 R /F38 3411 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14876 0 obj <<
+/Length 2778      
+/Filter /FlateDecode
+>>
+stream
+x��[�r�F}�W��KV�����*?ĉ�8ko��6٬�B��† ���=3�� ����� s�>}�{f�����o.^�\\�v��!Ϧ�usky�r���
ߖև	�ȥ��O��O�d�WS�'�z'�I�
�I��?�ߞwG�x��:HSs�^�J����e�n{�_n��xus����a�����bs��l-��wF�s�-��8e𹶮/�y��I
~�Iz�ra�6W�$
#
+�!�3�/�4\Ej��L�X����֞b.Du��Ƙ!MTR
��-���05B��)C�u*!iz
7���J�ӷ@��-��2g�@��>�ٝI2e�D�[���8@!F10Ve)c�d����7�-8�w�R.�tp�,
���7���a2F�|�\K �q4
�M�ˈ��5�[��	Tr6"����@�!��j����h�q�l CL�#�9^�6��KK�i`5z+��.�`2��RF�&��,N�l	3d�sZؓ�\Ю	zȡ�9��O4b�`Mq|�C{.��,n�U 
+j�դ�^�1akC�\Dr�]�!`��);x�v � ��GTW�!o����;��px�9
3�xڸƒ34H@�@�
�
+)���%��f�p��8./
���"��H ��<lV=�3����S`�H��-�35*� ���
�M�Mq�f}�d��a$������>���z��)e�yz�y^4?SR`
��E{"�pO�Z���U�'��J��2?K�0K�?�#��L4R�5���V�q�qt�fm!�#��[����������
K����� �=JX:��׭!���8o�N�����IuۈN�^�g_tRO��II7�S�����ؙ��A��%�
�Ü3�S��
�X�hbd��i�`�B{,EĦ�8PE�n��0E΍S����l� ��"U�w�燇*�n��P�Q��"0dn�^�M�hzjccE~�(Į�r����C��Rds���z�
)�k���;6if��i�T�uf�a��E���0Z�c�ͪs�ό���4�ك�Q�!���7�B&��m��l�B��V��<�LQ�
��Ó�$�v`V�< �J��[�����{�gX�=��t�2O��D��^V2�o�.����Q%2�"_KS����qz��N��{�-Hk�C���7�3��m�?����-�(H�JSG��`Q��AS'�ă�
D ��\�z�frs .�k�b���/�
J�^����SVe���N3=�E
+X���}|m��0���
h�.^/_;�L�q�6W�a�
�"���.X��/�d';��X��5
��6)YKeV�ʋ��,�~"�v�M+���T
�U�t�����G�KD�~Cp���Y�n÷�+J�e�
�e��V���)���O�W߿�z���on~j�
��,�J�U
�6_�sㄫ�
�֖��ro�0�{^9�I�ݖNY�\�0�7�Mp�i���H
+'�u
]�tH���"��S�ca�3�SS����k
�ԓb�k�h�-�(�!ᄻ� �r��1�Yo
+0����a��`&c-�2��e�� �p'�2\�XV��`�ڱ
?
`�ܼ��_
���5��+��Qǃ��	���E��p
�L)�6=�
qZ*�
�Ԧ������1ˋx��U���b
���T��hބ*��¬�T�V/��笧���z:��
r�D;c�������B

+x��5�Ic��2��
+l�l�1�DʖA�6
�=DEW4��_��4V�V}d�y�o�-��4?I
Ɋ�6Z
�7a�M�*&�B���+��k�n�ѵe�3��º�﯍�F&�h�z�Rk��xn�!��Eqѽ(�T�g.B;�5š׺[���-�g�-��zW�A G���
+|�#S�����[	v{*%jRl��wy��l��<��뼹�.
�pY� U#��`�V�jT%֟����{$1p,Jb���f �nnPC(���{zJ�7��i�8����7����â�H�蚻#9üI
�4i��h���i��8F���6�H
 8�
+<��� ��'��
��~f U�(��_;�����A
�[�{z)5x�k;�I)c�b���+S7�#�ib+��ϱ/�&'�iw`:
ޏ)�7��_P9��S�4"��b�4�=��/��SQ� ۪.�8��)k5����zn�A�ǂ�keAv�Dȟ,|t�&�a0ѹ9�
Hp1�h���������
��8�.��G1�zn 3(�nfP����\w2���̠}�K"���'�}���S�}�S����9�*�5^�#

+�Q����wr3/6f_�EV���<�~����ex�?8(�u���q��)���&�ֻa=<9�����
#
�K_������v��엏?DP��g�m���Y�ܖ˴
�#�۴@�A6-]"҄�P?��z�C^_hm����b�?
Hm�����F���	T��9c"���&��q�'c}���~
�n�6;�Y�2-�wd5��p��4��tbdRm�>�ڹ�2P�
oo��K���'�JR������Ʌ�a9s�C�ɡzqF�n"7�rs�������S��ű�sX�"�"
+���G�Y�5
�y�'�t��d2�V��Zux����L����9�
}'W�� ꫽Lj-� �妽)
qu��\�+����*WZ$�Ѯ8������H��6��Y
�ĵ,&k��U\�]%��q@
��[Fʻ,�>����V��VJ�c(���!\�B�-p��Y���h�Cŋ$�.&ȶi�
P�oa�8TKԯ��Ń���7f}
���W���!
+endstream
+endobj
+14875 0 obj <<
+/Type /Page
+/Contents 14876 0 R
+/Resources 14874 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14700 0 R
+/Annots [ 14785 0 R 14786 0 R 14787 0 R 14788 0 R 14789 0 R 14878 0 R 14790 0 R 14814 0 R 14815 0 R 14816 0 R 14817 0 R 14818 0 R 14819 0 R 14820 0 R 14821 0 R 14879 0 R 14822 0 R 14823 0 R 14824 0 R 14825 0 R 14826 0 R 14827 0 R 14828 0 R 14829 0 R 14830 0 R 14831 0 R 14832 0 R 14833 0 R 14834 0 R 14835 0 R 14836 0 R 14837 0 R 14838 0 R 14839 0 R 14840 0 R 14841 0 R 14842 0 R 14843 0 R 14844 0 R 14845 0 R 14846 0 R 14847 0 R 14848 0 R 14849 0 R 14850 0 R 14851 0 R 14852 0 R 14853 0 R 14 [...]
+>> endobj
+14785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.257 707.071 432.092 720.229]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+14786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.436 684.86 251.209 695.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a371deb67f73bf27ac9a7ff6f2216db9c) >>
+>> endobj
+14787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.361 684.86 290.549 695.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.719 684.86 409.969 695.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 684.86 513.996 695.764]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 672.905 171.361 683.809]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.693 672.905 478.077 683.809]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) >>
+>> endobj
+14814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.114 659.092 456.992 672.25]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+14815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 636.881 224.57 647.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a98c785602c5af8f7e0c1be92bb5e8b71) >>
+>> endobj
+14816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.908 636.881 299.838 647.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 624.277 347.869 634.182]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+14818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 613.019 196.297 623.922]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6b987d283ce345c52b5d193c0688ad28) >>
+>> endobj
+14819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.439 613.019 279.215 623.922]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.718 613.019 432.878 623.922]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) >>
+>> endobj
+14821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.827 613.019 513.996 623.922]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+14879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 601.063 216.491 611.967]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) >>
+>> endobj
+14822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.094 601.063 362.977 611.967]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) >>
+>> endobj
+14823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.254 601.063 475.081 611.967]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 576.504 164.537 586.409]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+14825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 565.246 273.129 576.15]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a90016052cbe535d7e8b1e20a2c599053) >>
+>> endobj
+14826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.944 565.246 352.41 576.15]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+14827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.209 565.246 495.961 576.15]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+14828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.978 541.383 275.007 552.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ac26060b9b14465d4f1d948ab9c838c9c) >>
+>> endobj
+14829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.101 541.383 362.877 552.287]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.682 541.383 472.148 552.287]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+14831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.234 529.428 233.986 540.332]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+14832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 494.607 255.564 505.511]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae10fbc38125e63858549f5ec8a25e046) >>
+>> endobj
+14833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 468.8 255.574 479.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a7366f9b91109b63f078e963bccd9f5b4) >>
+>> endobj
+14834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.912 468.8 330.842 479.704]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 456.195 373.782 466.101]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+14836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.502 444.937 303.534 455.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a281b8db6a8e0014ab2c41dd15f8c0708) >>
+>> endobj
+14837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.676 444.937 377.606 455.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.017 444.937 494.845 455.841]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.079 420.378 390.169 430.283]
+/A << /S /GoTo /D (index_limited_extrapolation) >>
+>> endobj
+14840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 409.419 208.508 419.324]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+14841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.637 398.161 311.746 409.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1a3647877302fc6e0e583b8b881a7a4f) >>
+>> endobj
+14842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.158 398.161 390.088 409.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.169 398.161 513.996 409.065]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.894 373.601 392.558 383.506]
+/A << /S /GoTo /D (index_bounded_extrapolation) >>
+>> endobj
+14845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 362.642 208.508 372.547]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+14846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 351.384 236.197 362.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af074d4d4d406dd065812b32cc8714222) >>
+>> endobj
+14847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.534 351.384 311.464 362.288]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.542 338.78 359.338 348.685]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+14849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 327.522 214.06 338.426]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6e9d9dd7740b414d407c16687c99a88e) >>
+>> endobj
+14850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.398 327.522 289.328 338.426]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.871 301.714 284.525 312.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_acf531d280805472a54c22fed0f689932) >>
+>> endobj
+14852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.405 301.714 359.335 312.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.78 301.714 477.607 312.618]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.079 277.155 390.169 287.06]
+/A << /S /GoTo /D (index_limited_extrapolation) >>
+>> endobj
+14855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 266.196 192.566 276.101]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+14856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.197 254.938 291.929 265.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9764ef2f159cfdcca3f151e899bd43ef) >>
+>> endobj
+14857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.46 254.938 369.39 265.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.041 254.938 491.868 265.842]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.894 230.378 392.558 240.284]
+/A << /S /GoTo /D (index_bounded_extrapolation) >>
+>> endobj
+14860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.268 219.42 192.566 229.325]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+14861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 169.783 289.866 180.687]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a527e7c81841bbcf1963c6e260dadfe01) >>
+>> endobj
+14862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.681 169.783 359.324 180.687]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 145.921 290.971 156.825]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa6b6fed08414c86d33fc4a44c59e9e22) >>
+>> endobj
+14864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.787 145.921 360.43 156.825]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 122.058 224.003 132.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a87ebe6f7cd176227f61c6d0fe47a4f68) >>
+>> endobj
+14866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.34 122.058 299.27 132.962]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.695 109.454 272.49 119.359]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+14868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 98.196 254.15 109.1]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3065d01256aa333117e0ee24d99b4431) >>
+>> endobj
+14869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.487 98.196 338.263 109.1]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 74.333 284.585 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_adee3b5c0c3800ce2214e68a156cbcf77) >>
+>> endobj
+14871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.401 74.333 354.044 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14873 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14877 0 obj <<
+/D [14875 0 R /XYZ 89 770.89 null]
+>> endobj
+14880 0 obj <<
+/D [14875 0 R /XYZ 90 509.85 null]
+>> endobj
+14881 0 obj <<
+/D [14875 0 R /XYZ 90 342.765 null]
+>> endobj
+14874 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F38 3411 0 R /F66 3165 0 R /F42 539 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+14940 0 obj <<
+/Length 2210      
+/Filter /FlateDecode
+>>
+stream
+x��Z�o�8���B��6P3�n�f�f�ٶ�m�Ǡ
�D���QN����Q�.[����ĔD>���>
+k+
k?]�����v
�C����b�yXsLY6\Eڗ����o��5�v�lXUݾ������ŭxv�~q���GX#���
W
��/�a-��?k��=T���
���ۋ\`���ośgj.�f��7bb���!"�L�lJ����L��I��r�f�5-�8b	M9��j�1ɖ;��iXfj2σP��Y=/(��fE15�	囸d�jo��c�FpOw�J��& B+�a���oJf��g���ȳ<��ߡ�S�e t�(��D�R/�mܱ�̱�ixq׳䊯�n�/r��`"�ȴ�%M�8(��H��t��WO|+g�(��rH�ۜ�A"�e��|J�IP�,���M����w�0t�w��yGGD���&
(P�x?��$c��S �X)��B�R1��_�� ��5�+�p��#�WO^�K���G�U���	��
ރ�Kj�0���+xw'4�q�Ra�U8�$�ŒL=:��\�'�.;�����,�IN@^ga<�\T��[
�Ѯ�� �ɿ��`D��th9�$�<5���q�.|�!Z�XD4:� �JF"�A>Xt�ج=$��uRO���C0�@�Umu	8R1��
�X"��
���
����1�qQL7�*6�K�,�
��G�����[Z{�P�_?������{@u
9՚���9l0��!�
�`l>`m
r�݀�����z��q�A9 �V��g�c �r�n�$����q��l�D�H�;��h
��1h��%����ܷ��5䫖H/�~�
Hsr�\;���F���7P
T��@��*�w��bS�‘A� �
����A|A���~\/��O�GJu� �4�۝k!b�����Md��+�촋<�r-q�+��&8�
�P|7ԷC#xh�03���ܑ�E�e�4��=���=r��~�
+T6�ۍP3��Y�%���g�=�bRE��
�
xȘm���[��ڦ�qX.*��w��:�R�DncF^Foބ���F��ZI������Fe��U�i��.�� � �Y�Y��>�>0D��3
��e��
b%
U����}O�����
aW2��#��
�Ӱy��s��J�s��d;>�<|
F���8��.����L���,�E �)����@�M8o�U�&2
k�w�d
Z��9��,��xv��Q�f��D8|�w�;��>Y�4�
�ݮ�G���Gx� ���lzV�^-�	��E.��6!�䝻�a���m8�>�3M^I���L�d��&�
Q
TN}dfAE����K�nO$�N-�.�>�rS���l��j
�czz��6�|����&~=( T\v�� 惤��fC:��Z����tN��b�q"��]xSB��������77zX��A쫵,�ﶪw�|%Qm��f�bD�Dh����ܖ!�w�0
79�"W
�u�^vZ�/U������
�V��JZ�?ݮI�b������®��ŏn�ȵ�q�
��hR����,��a�^�c�@��쎩��~M�L�lJ���Av�q�M�H��X⧒��O. ���u@$�P������n�L����
�x�{t��$Ni\�M�両�|�S;�G�B���?��A��[q�1/���d���B��濳4����a��S&�Pv�jZ
k(O�Q�U�ց�	�� s�>V�����mS���" ����4�g�K�,C{M
���>m{7baP���t�1e�(K����\gmK�^�G֛�PK'J�q��q�<
���=�d���,e��L����!��9a
p�<P
'7�d=}.���Dz�%����3R�'=��x����iV
vD%?�Y=��O��ʏ���eU��-�ꏭ�O�,���gq���[
����t�t�#O�{W��ME#���c
+
[["]~�~ܰ�0<�Pa����<��LĈ��V���%�����0�s�SGJS�:�}�U�䲤��ʭ%��`
қ����\?|�տ��������,~
�t��~�e��э��ou���껯?��1q�n �u���z��qy�ڻ
���f at o��>�wς-dzz�����U��9�'��_D�>�
�M����E[BD�BI��sKkW���ް�wq�l�>l��l7����\^�mV��+ʶ^͝杇��lR���:�!m6�p3�Zvh׀��E��
+endstream
+endobj
+14939 0 obj <<
+/Type /Page
+/Contents 14940 0 R
+/Resources 14938 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14700 0 R
+/Annots [ 14872 0 R 14898 0 R 14899 0 R 14900 0 R 14901 0 R 14902 0 R 14903 0 R 14904 0 R 14905 0 R 14906 0 R 14907 0 R 14908 0 R 14909 0 R 14910 0 R 14911 0 R 14912 0 R 14913 0 R 14914 0 R 14915 0 R 14916 0 R 14917 0 R 14918 0 R 14919 0 R 14920 0 R 14921 0 R 14922 0 R 14923 0 R 14924 0 R 14925 0 R 14926 0 R 14927 0 R 14928 0 R 14929 0 R 14930 0 R 14931 0 R 14937 0 R ]
+>> endobj
+14872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 674.148 241.726 685.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a5c5da855445b7c877a626d824dfce64e) >>
+>> endobj
+14898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.617 661.583 407.658 671.488]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+14899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 650.365 249.318 661.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6b737abc8f33b2a2362e3f9c9ab08d58) >>
+>> endobj
+14900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.134 650.365 288.321 661.269]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.875 650.365 371.519 661.269]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 626.582 240.62 637.486]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a418f9959fe50f163773ad9de147821ed) >>
+>> endobj
+14903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.958 626.582 324.734 637.486]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.313 626.582 389.5 637.486]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+14905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 564.698 180.773 575.602]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a0c58bbc8bf8db5f570da3db42a0ae2f7) >>
+>> endobj
+14906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 539.05 180.198 549.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a9bc768bb8d7d9b971b44b8b3be738963) >>
+>> endobj
+14907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 539.05 231.943 549.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 515.267 193.029 526.171]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a547a8d96908afe5a7f9e4ba2e10d7ac8) >>
+>> endobj
+14909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 489.619 193.029 500.523]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) >>
+>> endobj
+14910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 463.971 165.911 474.875]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1d7db8ee4d8972c1818a36d6517ebbff) >>
+>> endobj
+14911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 438.696 187.689 449.226]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa38fbbd15d5dc2e98d5b24c92b06c290) >>
+>> endobj
+14912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.557 424.825 476.544 434.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) >>
+>> endobj
+14913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 401.715 202.902 412.619]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+14914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 401.715 300.037 412.619]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a6c7c72e56241da463eaeccdff79b6d49) >>
+>> endobj
+14915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 376.067 202.902 386.971]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+14916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 376.067 314.263 386.971]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa78179b1d8478dce6cf572af8e0b9cb4) >>
+>> endobj
+14917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.819 350.793 199.864 361.323]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a86d2bbceaa288f2f605ac88516d313cb) >>
+>> endobj
+14918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 282.793 203.075 293.696]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 282.793 296.324 293.696]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
+>> endobj
+14920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.377 268.235 355.085 278.141]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 255.024 287.856 265.928]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a3b49993a1cd4fc6891da88a6259b9f93) >>
+>> endobj
+14922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 227.63 194.297 238.16]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_aa39bdf85d6db02629fa73bbcaddab6d5) >>
+>> endobj
+14923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 199.862 188.759 210.392]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ae58a861a42c5216a2267e3f94ecaec8c) >>
+>> endobj
+14924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.636 171.72 294.481 182.624]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af496ec55802726ee3b39e52458ab0647) >>
+>> endobj
+14925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.101 161.84 113.005]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab6ab1820f2fdf444d1431ff3af424451) >>
+>> endobj
+14926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.559 102.101 297.202 113.005]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.765 102.101 456.154 113.005]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) >>
+>> endobj
+14928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 161.84 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ab4959b3da46291de301d9150f5afc3aa) >>
+>> endobj
+14929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.178 74.333 237.107 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.672 74.333 330.138 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+14931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.937 74.333 473.688 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+14937 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+14941 0 obj <<
+/D [14939 0 R /XYZ 89 770.89 null]
+>> endobj
+14942 0 obj <<
+/D [14939 0 R /XYZ 90 581.616 null]
+>> endobj
+14943 0 obj <<
+/D [14939 0 R /XYZ 90 530.471 null]
+>> endobj
+14944 0 obj <<
+/D [14939 0 R /XYZ 90 504.823 null]
+>> endobj
+14945 0 obj <<
+/D [14939 0 R /XYZ 90 479.174 null]
+>> endobj
+14946 0 obj <<
+/D [14939 0 R /XYZ 90 453.526 null]
+>> endobj
+14947 0 obj <<
+/D [14939 0 R /XYZ 90 416.919 null]
+>> endobj
+14948 0 obj <<
+/D [14939 0 R /XYZ 90 391.271 null]
+>> endobj
+14949 0 obj <<
+/D [14939 0 R /XYZ 90 301.638 null]
+>> endobj
+14950 0 obj <<
+/D [14939 0 R /XYZ 90 301.638 null]
+>> endobj
+14951 0 obj <<
+/D [14939 0 R /XYZ 90 272.221 null]
+>> endobj
+14952 0 obj <<
+/D [14939 0 R /XYZ 90 244.452 null]
+>> endobj
+14953 0 obj <<
+/D [14939 0 R /XYZ 90 217.756 null]
+>> endobj
+14954 0 obj <<
+/D [14939 0 R /XYZ 90 189.988 null]
+>> endobj
+14955 0 obj <<
+/D [14939 0 R /XYZ 90 121.031 null]
+>> endobj
+14938 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F39 2335 0 R /F24 537 0 R /F68 3017 0 R /F67 3022 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15018 0 obj <<
+/Length 2271      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�6~���x��@�$<ig6�8M7����N��P$q*,I���~.�H����٦��X4ypx�> �������G���p�}�;�s�c'�8b>�7s>�F!
����bL�(��qt1�x$W�K1���m2�����y{L‘L�'����U\��R̅~&ҩ ��糑����?
��>����e�!���Й��>���������s��֎G]�]9WG�<�֩�_�$����=�$�
��	A�??�c7͒
1�NeV_�E�o���	!ml����Ǎ �P�|�:�"�(�D)k�1
�
����#��	S!�у�5��2�f�z
B�3��
k^��{�0��x�N��&N�2��/J��z�񴀗�
�+�[���eL�8�b��f6��ɪ��X]s�ߺ%X��730&l��.��<I���S���JDo�lSv��m����C�tˈ)���?F�6�k��<@����ꡅBoe�N��2�
�����q;�keR�	0QcB��

ha0"[ťPN�]ސ��| [...]
+j`��Y�
p����� ��J`��X_g	�Y$2=IR�q�LLk���-%���w�k�V΍^v%���b2��fQ!�"JeӖ,D
eR�I�tP�����y�Et%�
ߨ��
��#��x��u�
��E����0���6J
�lhp��k�BO
PדL
.%�2Y,KH}G�.��ɐ
+U�+�Zhb_ma,�4�PwT�͕ͳ��Mʥ�Ju}B5x��̓�����z
 ��O˥�Zd��^�_\��U1X�Kdn�N��tVӝRv��Θ���FWIG�\�`z���q� �q�
�
[:���U��|
[ �k���
+��\vBԲ����2�_�=1�NGR�y���̔e��K�f�q
A
=$�|�p2zk�T���B�Ii�x��o��`ޅQ�
��n�����'d��ݓ�6��
y��;
���G~�Sx����Q��u	�vu��l7i.��j
�B= ��������
=�U��� q4���5�·7o��*�8�fU~	�A��2,w�Nˤ������K̠w��b����vL�}����Lo[���� �O�hI�O�
D
8�6��454
]h#d)����[��z�=��s�A�'
���sCM�9��ۥUTAװ}ቧ�Cq��eT��4�*��U�� ������@����!��0
?
1Xb����J� ��G.TN+Yߛ���.��
�����������Y{��Ԣ�qxv��l��a����3����Ķ�\�a��_O3Ƣ.	<sK 'b�y�R�D
�H��H�p�΀����1�όbE��o��f��װe�}�L�r
��n�02�k��6+��
+e��.KV��Ae�h���?�s/Һ^0 i�ԣ���zWi ���J�t8�2�9;���p�ZK���vVmǸ8�T��_�M�xs!�0���a�v�
�z�A���
(q�A���g� �R���,��4Q[w{�D+��n��BDvW
��*�<0=�R;D�䉕V�
+��YL�"�{���b/;��cI�
�P 9��;U��Lxȣ��Na�=�]�sKQm���"�����
����[�͠���ˢ���ɢ�El��nvw��`�������}! �!�n/1�aJ1�?
�@ϖ�y����m��aS�S�}��_z.1|/Y�J��O��}�
�O}����owFqug�
rD���n�9@]tzk��h��;M �W�v80�r5���+

�=Y}Q�/E����$� n=i��F
:5J��^��ve���1$�΍� �[�tw�<��T�
:���16+���g5�m�~
��G9�����v�V�),zܡ_+�!���M�*��|����⭹�W!���r��tSm��p��AQ�
�P�PYn�U�DE*��8��?ԗ��Wy۽�eYfg���͢����a�4|²],�C#Md�(�t��yM� �U,&��i
���0�t�%���a5��8}�v��K������,��
+endstream
+endobj
+15017 0 obj <<
+/Type /Page
+/Contents 15018 0 R
+/Resources 15016 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14700 0 R
+/Annots [ 14932 0 R 14933 0 R 14934 0 R 14935 0 R 14936 0 R 14962 0 R 14963 0 R 14964 0 R 14965 0 R 14966 0 R 14967 0 R 14968 0 R 14969 0 R 14970 0 R 14971 0 R 15020 0 R 14972 0 R 14973 0 R 14974 0 R 14975 0 R 14976 0 R 14977 0 R 14978 0 R 14979 0 R 14980 0 R 14981 0 R 14982 0 R 14983 0 R 14984 0 R 14985 0 R 14986 0 R 14987 0 R 14988 0 R 14989 0 R 14990 0 R 14991 0 R 14992 0 R 14993 0 R 14994 0 R 14995 0 R 14996 0 R 14997 0 R 14998 0 R 14999 0 R 15000 0 R 15001 0 R 15002 0 R 15003 0 R 15 [...]
+>> endobj
+14932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 694.837 161.84 705.741]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a858e0030826ee6c29545a934166874ef) >>
+>> endobj
+14933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.08 694.837 332.907 705.741]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 666.604 161.84 677.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1cecffe684d1faa9b0f6b8d4f227e9ae) >>
+>> endobj
+14935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.559 666.604 309.386 677.508]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Constraint__System) >>
+>> endobj
+14936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.915 666.604 390.859 677.508]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+14962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 638.371 161.84 649.275]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad6d1e866b7ba9bf4233f3a5254cda0f9) >>
+>> endobj
+14963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.08 638.371 331.224 649.275]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+14964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.138 161.84 621.042]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_afc2a04d2049183cddbcf70316fdf40e7) >>
+>> endobj
+14965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.559 610.138 307.702 621.042]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Generator__System) >>
+>> endobj
+14966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.789 610.138 389.734 621.042]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Recycle__Input) >>
+>> endobj
+14967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 569.95 161.84 580.854]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a1c30b772596f8f342d0f05b9b142a932) >>
+>> endobj
+14968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.33 569.95 274.93 580.854]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Box) >>
+>> endobj
+14969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.471 569.95 316.198 580.854]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.567 569.95 431.033 580.854]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+14971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.126 569.95 513.996 580.854]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+15020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 558.369 180.102 568.899]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) >>
+>> endobj
+14972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 529.762 161.84 540.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.58 529.762 213.387 540.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af15f956dac6d4b19ecd8fee0f9718f29) >>
+>> endobj
+14974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.724 529.762 288.654 540.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+14975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.43 501.529 261.459 512.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a249ea59c1765ea299f4d9471388aa5f9) >>
+>> endobj
+14976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.827 501.529 344.603 512.433]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+14977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.502 501.529 455.968 512.433]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) >>
+>> endobj
+14978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.332 450.382 255.546 461.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af8c0f1f8dc80d82fed8943f2c5737d2d) >>
+>> endobj
+14979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.716 450.382 338.132 461.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.795 450.382 379.522 461.286]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.623 438.427 223.266 449.331]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.7 438.427 337.116 449.331]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.973 438.427 378.699 449.331]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.734 343.92 280.729 354.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a76c9012a376984a1b88823a59bd5bcde) >>
+>> endobj
+14985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.364 343.92 361.779 354.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.675 343.92 402.402 354.824]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.73 331.965 242.373 342.869]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.435 331.965 377.684 342.869]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.594 317.175 369.497 327.08]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.372 280.818 287.242 291.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) >>
+>> endobj
+14991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.515 280.818 370.931 291.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Form) >>
+>> endobj
+14992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.146 280.818 412.872 291.722]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Interval) >>
+>> endobj
+14993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.555 268.862 262.198 279.766]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+14994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.576 268.862 397.825 279.766]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+14995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.988 268.862 469.005 279.766]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.087 257.281 190.104 267.811]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.878 257.281 298.895 267.811]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) >>
+>> endobj
+14998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 159.032 226.034 169.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_ad84befb6d0ded481871cbef1b7306824) >>
+>> endobj
+14999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 159.032 369.106 169.936]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 130.799 156.281 141.703]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a941caad4d0717e0fab30bf246adc0370) >>
+>> endobj
+15001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 130.799 208.027 141.703]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.238 130.799 274.168 141.703]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 102.566 180.54 113.47]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_af882ff84afd3c2507e17ffa62ffd20a0) >>
+>> endobj
+15004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.877 102.566 255.807 113.47]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.54 102.566 345.47 113.47]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 74.333 178.239 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) >>
+>> endobj
+15007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 74.333 253.506 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.239 74.333 343.169 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15015 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15019 0 obj <<
+/D [15017 0 R /XYZ 89 770.89 null]
+>> endobj
+15021 0 obj <<
+/D [15017 0 R /XYZ 90 547.19 null]
+>> endobj
+15022 0 obj <<
+/D [15017 0 R /XYZ 90 374.953 null]
+>> endobj
+15023 0 obj <<
+/D [15017 0 R /XYZ 90 205.473 null]
+>> endobj
+15016 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F39 2335 0 R /F11 621 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F91 766 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15045 0 obj <<
+/Length 2529      
+/Filter /FlateDecode
+>>
+stream
+xڥY�s۸�_����L��w���5w��k릉ۗ��"a��D*$[�뻋]PM+n�b��X,v�i�m<��t��۫�7I�e"�U���y��0Q
_��a&j���/^���b8e�_����Ǜ���v�����+����H$�W�>�*����Ի7��^���y��q%����-
�x�C��W�������}���m�!�o|�=����2ܷGM�
�*I��M��r�"���M�;��f���A(3$"V�n@�3T�H�����	*Æ�]�B_%0構;M�uOӇfw��]��"FKV��ob9R�ʏ"�@7+?~�
���SއU$���R�T���P��5����ۻ��R<L)��G�'O/�2�M=w��/._���'��wW��޽n��嫛�n�i��S�.��뿉x�|;��$��p
 �18b��@�8�HF��
��%H����N�������}5�w:��
+E��-�y�w<*vy���i�W/C� `Z��s�Q����_�)���
�����:�}�@[}hu��L��c�a�z��(z����5d*��к�w�^��,���g���g�^�&G!�@���"a��(i�X���$s_�E΃���꣔��&�~u/my�~p[]�������F[H
Q��	�W
+]��v�D$;���"�6�A�g�`"��>��
�� ��e��zF�8o��Op�0&iH���{���v�C�J����ڡ�j����7��̲�9+m
��b�����IעÉ�nִ�n�*F�,�v$�e
˱֘�%Bp���+n�k&�o����ck���c�{�Qj��Y���_t��G�ᛒ |�
+�B�l;�4�0�qu��a��z����.�u��
�{�_����L-�&~�!bi�������-yv�!�,y�Τn�'�̾��=��:ڽ�B�^�
�Q�O8
������j�����
�9�6�BV�#���c}{�MU�������hڲ�7,��fObh�/��/xtX~����h琓_�	
+0qss�nr$"k�4X �
y{3WV{]w����H{fm�0�e�+G>]%!$ݙ�
��zޒ�$L�5_2ʁ��L�R᜙�c=�e��u�k:R<�	l�l���x�j�RȊ1�P�cg���|���/&@��C�9��9�c��{�uI�Mspԉ�C`+�
�iR>X=�<���Q���6R_y��z�e&Ϥp��d��'�0n���8
�Ĝ4� <dG
+��%M�}gjf5�������T�q��
*< ���#	� ��R�{��B�6�|i�
�[g���B��D ��
+U�g�mkc~�Fy
M)�Y���	M����
���+
C���(��B�
��Gh
�U���6�ӰFw�` ƣ-6;�����x����&���#3ϸ��L��b5?�$J�L�
s��
M�)���L����F���
  PBp2����坹
P��XP�������΋��͙Y�zSLs�-u[!�H�hWiJ��q1`<
�a���#��Վ���Ψ`�1Zs�8 �GC�g����i��g+(��9�5�2_�����2���<��ny68�s�9�oE�ۄ9'��l�~[ۉ���n��Wb��J�ap��6���������B���œ3Y�DP���]UT�L�
�q#R�]g�t�<} �J�R��C5}��j����V�/�40
?TO�l��^�����-ma|@]��q���ʘM�ZX�(j�I�
�@
c���ӄ��7Ր5� ʂ����
v�����MԼ8�
��` ��L�V%M��-��t۬F8�E�@H�#�؍�MC�wb$��A��@=�#�s�f���i ��
y�ֶTNR:�e$�$�������� g�
+H'�]��f	���3��,�
մQ
�� 
M��DH��|ِ�sA���a7$��>�(
������������4aM����������. t�L���جuR�q��Xx�4<��1�Nb��d�s���;D#l��򹇜
+���ŢZ�bp�Ȑ
��{�bsR�����*���[ ������L�I���8�
�H!�Q{���b1�6NMɋCT��;��q|�-�h��.�G'��G�

W�LM�)"^��I�O=�V�ZlF΃���7�6
�1�һ�6��b(�O��g�I�8z=���=ߌ()� ���N�X^�������)�͝�#�	�s���sz�=N/��<l�����Lk]	0�x�0��7S/.���+�=E�1
9�9l�;��הb�`�L�g}��Ý�O����*�E��NOo&4����D�رS�?����º�G-23��d�J$*x�?2G�DD���g�Z�Oe�c�h���������bgr+��:4����}G"̔�����۷��?yXFPe�����h;�(�-
��/|�&Sę �@
+��Z�W��O�!
�>*L���n�����z}�@u�P�>�χ!��dpCƺolԪj�U�;�c��s��
+endstream
+endobj
+15044 0 obj <<
+/Type /Page
+/Contents 15045 0 R
+/Resources 15043 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 14700 0 R
+/Annots [ 15009 0 R 15010 0 R 15011 0 R 15012 0 R 15013 0 R 15014 0 R 15037 0 R 15038 0 R 15039 0 R 15040 0 R 15041 0 R 15048 0 R 15042 0 R ]
+>> endobj
+15009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 694.804 156.281 705.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a941caad4d0717e0fab30bf246adc0370) >>
+>> endobj
+15010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 694.804 208.027 705.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.238 694.804 274.168 705.708]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 681.651 178.239 692.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) >>
+>> endobj
+15013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.576 681.651 253.506 692.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.239 681.651 343.169 692.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 606.937 225.75 617.95]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron) >>
+>> endobj
+15038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.445 577.358 277.732 588.262]
+/A << /S /GoTo /D (index_representation) >>
+>> endobj
+15039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [443.233 523.868 502.79 534.772]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [100.734 511.913 174.677 522.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1NNC__Polyhedron) >>
+>> endobj
+15041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.44 439.784 513.996 450.688]
+/A << /S /GoTo /D (index_representation) >>
+>> endobj
+15048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 427.829 156.301 438.732]
+/A << /S /GoTo /D (index_representation) >>
+>> endobj
+15042 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15046 0 obj <<
+/D [15044 0 R /XYZ 89 770.89 null]
+>> endobj
+15047 0 obj <<
+/D [15044 0 R /XYZ 90 667.622 null]
+>> endobj
+15043 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F111 1509 0 R /F60 540 0 R /F91 766 0 R /F32 772 0 R /F10 773 0 R /F11 621 0 R /F24 537 0 R /F7 803 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15053 0 obj <<
+/Length 2069      
+/Filter /FlateDecode
+>>
+stream
+x��Ym�۸
���B�*�1�o��^g�k�����K������ȶl��%G��q}A�ԛ���޵�~�H$ ��L��G��7x��}���8����b�)� ���{�3J">�3J�?c�O�]�x?��/��6]U��w٢J���]z�"�,fs
P��<�k|}��S����
+�Tb��÷7/n>�0Ќz
5	�������O�[��
%"��'C��$�̽w7��Pk���F^Hb%"m$��(&<�a

}�i�4e���X7�n6��M���
���#�&YQ�U�#
��
+�B
��BzsF8G�_�yIX$�n���
>��Ss6��x��
�?�M�\��*�NE~�wZEqYEѩ(p6���G~
�IM�����M<�tz��V+��[�.1�~��܈Y �,����\
��|�)��sHW�#�e�����8!�P�2
��/X��</g<�b�S�reAY���X�I��bQ
�U���g+
+���ޗŪ�ٔ�LP�6��󺩲=Ng�6����=��T��PT�-��
r(���$d9�
��D��7�Q��M�7���3�?��'�SӜ��q�)F� @�����r��eY�5	�c}w�@� �Qlåe��r
+��
�����m�uQy�g��#>~�l	6��u�K�e� �cvΈP��<���ceX/�X�4��Nv����$�q>Y�:20<t��؊k��&��v�uU�p���
+,�@����k��� ���2[Q(���/O�ؗ8@�`�eZð��XY��RT��߉ԟ�.�/W��9�VD0uvW8���ʰ�e�d}a�E<���P��g�]z�� =a�q\��5,���ItE�K	ME��I�D��cIp���ܒu�=��M9ʫCѫU}&�&�'E��P�S͂�V3���]����S�hTv�D?��-w>v>���s�~�S��-~�~
����o9�oi�[N�w��o��=c~���p�m����qz<䓈q�R��QM451�n y8���UN+H��W�ʒ�N�*��L\<�پ�|m�U��gE���\�� R�+��������C߾�����o��6��}>r[�'��-
���cs����-�e�<�=�i�����Ki�$
+!|1��y�-��[��4éA��xkR2
+��ĉ~c�?Y�ݡn���
+_�e1rmX�"]&��.��M���� #�~F
+�>�Z8���a�[|����HT�~5
�F���C*���
+�����H�
Z�~I z��0���:u����י̊��&��Ҫ¬4J琱�Ȕ# �ZO`�.+�]�ϤɌ��Ѫ��ϴ�
+����*�x�*#\	sԸ�N��)�9�Qe��q̙��xB!n�
q4MmH����=[�G�Ʀ:�>-ӽ�VC_�0��c,&��f(�ra�
��4C�ٸ֙���U��
�q��ڌ�.}(��|,"A_�8&pz��hX0�q��Ң����1�-�
O����
�uM�P0���;��&�"�׶ɸР��t���Q�:cS�T��!84' �����{�`&;zl�g�V9�s�[��k0jZc�`	 l�@ꀳ[>�

��|�
Xo0��F.���ca�'q4����d�b0�`�
 u��<Fu�\y�Z�NyM[�xP�Ʊ�i�fs��L�H�Z��H
:�k���M�
��N%B�
Χ���H}�1H��߯����<��L�d?3qț�
=�}ZZ9�kKY�!'���c
(��gfA�v�����0���
���WX_&\h���fs*���1	[ ѹw��
+�@��
bN
W��zTS'E����6� �&U�"&
� *N��A�p"�����P6
+΋v��~pH�M(@�
O��

+"W� 9ܕ�ra3(���]I����鲙*��9<�Eq�oYȉ��ĕ����`3�0���?�HG#����/?@�v�0~����e���?b��4¦h.��}���T������ŽS�A$Ȯm�fw{�8l�ؐ%ܜ����Wm4�M	
+��*u�V�ܙΕ��
�/�b�0���Џ��)�
E��,:F;q�����X���?%���l�
+endstream
+endobj
+15052 0 obj <<
+/Type /Page
+/Contents 15053 0 R
+/Resources 15051 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15055 0 R
+/Annots [ 15049 0 R 15050 0 R ]
+>> endobj
+15049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 348.692 209.133 356.218]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+15050 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15054 0 obj <<
+/D [15052 0 R /XYZ 89 770.89 null]
+>> endobj
+15051 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F91 766 0 R /F60 540 0 R /F32 772 0 R /F7 803 0 R /F24 537 0 R /F8 802 0 R /F1 834 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15060 0 obj <<
+/Length 1961      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~ׯ�[�Ƃ�8�����dz�M�3���-JbK�
+I�v}w�4-˹&����X,��~������d��br�X�^HBɥ�Xy!�T!���^N��\���RJ�e�������ϋ869YL^O
Q�Y�(�o'/�����(�C�]��p���b��:[�Ok��$	���6FQ��c�1g��<����"�fsI�t�yEe��
ө7W����6$Z.O�󬬊(�*��3���>����.:�O��6���F��tW���U��ǒv|
�8#��V�b��>��(�EYaCL����܎�I��5_��y���dT��U�����-*�L����U�ݥn0�c���F��[#9��V�9ߺ߹q��I��DB�B&ޞ�ˑ�sպ�L���׫*.fs.����:ü���n�����|�i�dk��u�I9�/A4��z��+k-��5��4���_QF����	�!�]1A���U��M�<��( o�C1���t u�'�9W/n.	�����۩�A�
9�3�;�!@[9F�`M<<�i�\��G�
쑡7�H
M [...]
��r�F�uG��bW}�f���2�*t�i��i�L��Tn�y��7��,�x�\�\Y�)E$TО���󴭊�<��mT%5�B�9�e�tx���HՒhzG,�aS����=���.�`TA(��
�A@���,�\Aօ��@�� ���!Y7�|ُ2
6`"-�@sQ��i�.���L���itnb�)�
C,�n<�]�
��
2W�v�
a��F
�v�/?K��@Z��Z7����k�^�
cn|�]�0>��&�!��@?<8H �2B(�8Zb΅
+sΘ~�,^涝��$z��v ����*1�j6?LC��i��έs& -�{w<7
R�S��w���0@�煐�~�)F9���[e��9u�[id�$Z�&��u�f�}�Lxف�)�i��:���>�
\��n�3�H�3.��/�<���_��rAD�b�n�������a�~�\��Ph������5����6C�ƂP
+�� |c��a���vA>@A
�M�9og�6��F�D��^,l#)��
��{ `��
��
+�S�E|��]6-A��b���+���
�B�
f�h`n��(��L���������4^U���mD�uug������M�e�o��&���$#>�&�d�NҏE'�%x����p��D*�m�����P�$�@��=�d�ч��'���MI�T��NZ������DUM�
+P�˳eM��֭7
ƹ$~�7`Q~���>,�
NT����乏1�o�kzd;.��6J�|i�/�	�硿7�����GA����k#�,7��V���_����""4������L)n��f���:�����w9(k��A߼Uh� �c�pL��

B^/ڿ�<{��}�����fBLݑ=����b��p8V6UH$�F/9f�"����m7��hO�c��$�
�o�j�����b]�ٚ��۞�‹M�]
hm��m*�x%�����o
+endstream
+endobj
+15059 0 obj <<
+/Type /Page
+/Contents 15060 0 R
+/Resources 15058 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15055 0 R
+/Annots [ 15056 0 R 15057 0 R ]
+>> endobj
+15056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.219 596.072 209.133 603.598]
+/A << /S /GoTo /D (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899ac7753e1dd51e1b7b3fdfafa9f8332370) >>
+>> endobj
+15057 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15061 0 obj <<
+/D [15059 0 R /XYZ 89 770.89 null]
+>> endobj
+15058 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R /F1 834 0 R /F8 802 0 R /F11 621 0 R /F7 803 0 R /F24 537 0 R /F32 772 0 R /F91 766 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15065 0 obj <<
+/Length 2688      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs��~ׯ��L��
�v����-o�Ye���e�X9��K\ �����9 HP�$�RyPa0G�{������<��wg�.Ξ+Y��TP]\E)�d�".�m}�	F���c
����j�M�G��bs�gU6y�_VY�y�"�
��hL9�_/��v�k��j����D������^��vF�3
�	GRE�����8����F,Uѭݴ��่>���
�B	
E�D��H�q�]\k��U�X�#��ۼ���i9���[��7�u�����պ�69H���4ES`�rP�ey�'�*���,_ꢆs�;��I�(�
|a/��}ڏ	�J�̙1c�hL$JsG�Ӆ����&6u���� ��뗆$��^��k����O��U�v��F	�� �(u��h�DTmg�8�r�M�
� �����~v�(��{�����9)�$��
+
+�zr���ج���ڈ;���z���ʳ˅�'t�N�d��=���&7�l�����5:`7�!�
�1" C	J�
+쟩$���j�雷Up
�=�ݳq�Y\�օn�����"��*�RN"��g�&��S�>���ۼ����B�w��r�P���u2@ A�����:~$��jt�@�N
+��^�W'�v���yws�M�+&'i��(u
7R��}�$"i��d�x�!_
v=�"���|�{&�@`�׋A���G%Es�C`�{��3ˆ��(+"�Z�8���-q���uX��S!#�(z��
+�Ӡ߄L�b�+��D�Ӭ�W�y1jՅ�6�fDx|��	k6��]�J{�
P�sۼ�V#&c
G�l��
�ȁI�ܘcn"���@��� ��
r��$��M�̚|j�f�*]dK=��W͈Đ��7�M���j��C��y�4�딦�U�G�zɕ"��r�y�`�.'���iڗo]h��/+=m�("�.W��iV���v����Bόƅ��5��ʭ�4\0�3K���M�k�o:���N�d?e3%3�m�&I,׋Y�i7�Z8
���W�$d�`.�r�
���~zh�����E�CxK�����
8y�z�z�G��;��Ƥ
���Z۠�Er�5��n�.���N�
�'�����W
���{�G{����G�	�������CM�$�l ��nX�ų1M w����Sk\�1w��0��1��8�6k~�
��̍q~�$j'	Cx��CQ4!�.�^9�Nv`���y^d
7��Y

bax��h9��x��p\�� c���N�޿Q��N
	)��x`B�l� ���l p�5$)�k���܁gk0��YJ�H4/���
8������=�O�%������ [...]
����M��\YR��T�|�h\.F�ĮA������S�@1�}\Gh4V��
+���
W
�-fa 
�L�ߖ�M Ti��
@�����`�آ����`gÓf��Ct�Lሙ�<t��d7��R	�RF,�H����H�K!,-�~y�uC�q�=��7z��<z�va��!	
�iڞ�5/f>�練�%t�\��b���n?�*�I&7������� �Pp�E_���̇��=–�y��L��7|���8��15Y�=Y����Fwx�n,1�.�+�͖�7CkL�u09
������nǓ1	���-O����!ѯKl1�
��i�8�(2Н�׉�!�bN(�����?�TN�x+ -���I�(n�(4��ݚ�˻����'�}XՀG
+����sj��x0D
%��2p�#l�BJ
$�NM}�^/'c�� �J�[q�)׽��$f��+d�3/���͛�Z{F�-���h{3f��颬���C���6*�ȕ:�����5S�$��ib
`�A��ī���Y��4���
lz+���e7�_y��w��ns���nF+��ҟ�4��ߠc,���qЀ
Iz7���(���~�mhsHM�N�A�/<(�k�)
+�
+(<N�B[x�XxZ��+<.�)Rm"���V��O��I4�p��o��q��슘�H�����D�
y].W
�%o6�
�P�0A��>N�I�Eέ���*+�l�}�o��y����߿�ϻ���LS$�
��
X e�1[,����j�Y�i�_��{����Ǩ�=C
H�
�ݻS}X}�m3�����EY�n��}	���Uv��8��)\�P"����tZG
8���#P�9� �) ����CB���F�T��i��b�ܟ�=�P[�b���~�r\J��xp5~U��ކ��cI��N�{����w
q�z^@"�7�^�ߥ�]�| C�~:d��� �*~¼��m����9i3�4��`qt/�i|
&�!_��h�*Y��M�S�V#�1=My��@� 4Y?�3��11h2!���},Ӧ
+�ُ��
-�A �\��d4A��MJʎ�?�Vs
+4P�j�Ą
������n�ZW0i�W�Y�6?)������

A¿��2 �Fci��=F8������?5l�!���y�4�ϟ_��.�r�}
dI�]�p���˲�-�������ڴ�3(���m���*��MR�#
�����x�nɢ7%\�Vc����;
+endstream
+endobj
+15064 0 obj <<
+/Type /Page
+/Contents 15065 0 R
+/Resources 15063 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15055 0 R
+/Annots [ 15062 0 R ]
+>> endobj
+15062 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15066 0 obj <<
+/D [15064 0 R /XYZ 89 770.89 null]
+>> endobj
+15067 0 obj <<
+/D [15064 0 R /XYZ 90 442.328 null]
+>> endobj
+14960 0 obj <<
+/D [15064 0 R /XYZ 90 419.952 null]
+>> endobj
+15068 0 obj <<
+/D [15064 0 R /XYZ 90 419.952 null]
+>> endobj
+15069 0 obj <<
+/D [15064 0 R /XYZ 90 349.405 null]
+>> endobj
+14961 0 obj <<
+/D [15064 0 R /XYZ 90 278.072 null]
+>> endobj
+15070 0 obj <<
+/D [15064 0 R /XYZ 90 273.589 null]
+>> endobj
+15024 0 obj <<
+/D [15064 0 R /XYZ 240.245 204.278 null]
+>> endobj
+15071 0 obj <<
+/D [15064 0 R /XYZ 90 197.638 null]
+>> endobj
+15072 0 obj <<
+/D [15064 0 R /XYZ 90 111.439 null]
+>> endobj
+15063 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F1 834 0 R /F8 802 0 R /F11 621 0 R /F7 803 0 R /F24 537 0 R /F32 772 0 R /F94 771 0 R /F91 766 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15076 0 obj <<
+/Length 2127      
+/Filter /FlateDecode
+>>
+stream
+x��[I��4��W�N�h�ܜXjX&���)w�N�H��8
��<�K���UM1U��V��O�۾g5�
}9
��F� B��2�>�����<xr%���LjD"	�l�W?�4}����m�r:�sD�'
�J�@J����;
̡�� #��}ipʠ]oF��p��m��45ˆt�a�E�XTp^�=K�e�g
��'ST3�	���	��������#��e�aD��8bp|G���EB
�%ВC�f\G��'
Q��ZH�
)�����BfF����p6���.��
���t�>.�L���*��꼆΃b�̼.�
+DW�GD�c+���R�#D����c���?d�	8L��|L�|�/��+0���
t����f��
gj8�[SL7�l�,_��2�_��}H�Ǟ)4���p��g!�u�:~N�E��[r�v�H��W{�I�q�d�KX x(�q#ME|<!�����0.V�S�ID���"����(�Q��)
+"��.��cFC8kB��c2/z P
�K��̈r!���`�
�����l�T���w,�x�%	�c	ݵ=Y�%Dw�@	��
5����n��i�q
BHY�iV��۔ɪ� ��h|�7�	�
�v�$쏤��6���l7[&�_e�m�'Y2�.i�]�ư'�
��!� a�H��!����]y���d��	�~aB�`��
Q��/��r^;��j`����7,��9IX_�-�77�N7NѶ�� 6�� �	QHR��ڤ�4{L���
���:�Տ��&m�^z?u
r3
�

l��b
F�^m|���UR&�Q���#���E(ȏHt<�����-�K��
d�H�
]
*z����#
+#.�A`�.�&ŭH��
�"��
$����*�^�??n�D���G
"�q��*�o���p88!�/�20�Ӻ�^�[B#
�n�uRqnBѯ7]��Db� ��j
�
i:d8O~��6��+�P6��j� tr�*��zd��
�d���d�+����6���{�FF!�i���do7�����Q�:en
�<.�	,h;+�ERw���T�� k���S
� 4hS�,���H�
��TL�4)�+�bl�y��@
���(��tew�Y݆�߮�H��U���%^���ee<+�Y�\������ ښ�e���gu�C���0����^�����<��z?�UDb�|*��/+���*��õ�8����g�iM�+��Z�鈼���!JoU��l�>
����Y��E��i�r@$#~�>7�<Y��#��>����O����傢�M�ǁ���+�(�W�qqs�}ɬ[�E��4�m�%E
Q{�2I�BT
+��3T"���ŦG1��g)�(��K/����#��E�M�zݦ��c,�0I���w�6�`��a~�6LP�^V��I/Mp�<S��z��G͵��Qy|K���I$�<��B
�`mLw
�I͹
F��ta��s�A�n�[���tq���� DrA}���/��
rq�4��$DzML�A��6�셺��5�;�,��q6I�����D��lX��B�8��>�謳K� �&��Z;s����+��Y���W�%��
�hz�X����.c���D%C�v�.���eA�ũ�5ᔂ�bCq��4<$�u��V{��Ǹ}�q��g����j��g��-%�$�$y���D��*�'�f�b�yu�\@^=@hȫ�F�JZ���"���uaao�g�R
F��r3�F���������&���L�x/���
K�������]�M�폴W�K�BX�
y�Hzً��x��������h�]b�<$B�/�\r[��^�b��{�~�邰Zð��{�ltƴ�܎a�p^�{�
v�*hb�*��z��Mlj�
+T�sW!���U�ͻ
+�
����Z�g��1ascSz��`���‹
+7"鷩.������1�A R2��g��X��Mr�e�����5R 
��@;�?v��͘��ū
��A�^��M��ۓ�W��"�ͤn������MR|:"����8����ٰ���;K�}&JY�6�:xkFp�&I�<���G
���u�
L憤n?�=����ŋ��b�d
4�WOs���(BX����I}Wy�4Y5t�bS�s3aP� �5��
+endstream
+endobj
+15075 0 obj <<
+/Type /Page
+/Contents 15076 0 R
+/Resources 15074 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15055 0 R
+/Annots [ 15073 0 R ]
+>> endobj
+15073 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15077 0 obj <<
+/D [15075 0 R /XYZ 89 770.89 null]
+>> endobj
+15078 0 obj <<
+/D [15075 0 R /XYZ 90 718.682 null]
+>> endobj
+15025 0 obj <<
+/D [15075 0 R /XYZ 90 684.012 null]
+>> endobj
+15079 0 obj <<
+/D [15075 0 R /XYZ 90 679.529 null]
+>> endobj
+15080 0 obj <<
+/D [15075 0 R /XYZ 90 591.173 null]
+>> endobj
+15081 0 obj <<
+/D [15075 0 R /XYZ 90 500.822 null]
+>> endobj
+15026 0 obj <<
+/D [15075 0 R /XYZ 90 466.152 null]
+>> endobj
+15082 0 obj <<
+/D [15075 0 R /XYZ 90 461.669 null]
+>> endobj
+15083 0 obj <<
+/D [15075 0 R /XYZ 90 373.313 null]
+>> endobj
+15084 0 obj <<
+/D [15075 0 R /XYZ 90 307.271 null]
+>> endobj
+15027 0 obj <<
+/D [15075 0 R /XYZ 90 260.646 null]
+>> endobj
+15085 0 obj <<
+/D [15075 0 R /XYZ 90 256.162 null]
+>> endobj
+15086 0 obj <<
+/D [15075 0 R /XYZ 90 167.807 null]
+>> endobj
+15074 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15090 0 obj <<
+/Length 2546      
+/Filter /FlateDecode
+>>
+stream
+x��[[�۸~�_���
�
臘����M����"
[�Q+K^Y����
��,ڒ�ؚ��2yx��;$� o.���x��bA�"Iep}D8P<BB·y�1$i:��qx5!8��e|s5�8,���d^�7���2.�./��'D�E>�R��WY�^���]bK�Yt�"�JM>]�p�����
��8NR:�-/>~��
^�`�"
|����
>��狿_�Z��Qa
�G-jD:��a�E�X8q_?ΒU���2�Crg	��Y`�y,��j/�V�zW��禉HRS��^M�2���$�ʹE��pDAɎF�w
"�4�cB(�
�D
+�9Ӭ���e�O8?�Y:���	S��a�䕳֐5(�`b6�� 
xݖ�1��T{䔸#'��y}_*�/;L�0�s��}b
pX�"+O�uqgD� ��0RB����b��xK�x;"]׋�b����6Kܛ/iu߳��H���t�R�4BZ�f�
��dX�����U��L)�F3SBP$j
-�<)�(딒֟yQ��d������H����
�>WE�Wk��y��g��`4��D�f��h�ϗ�:L�x�)
�"U�0�*���9�NU
+I�:Ÿ���B����U��K�
ʢ�m^Aɘ���0���p4�L�K}`�l8�B�m%�-;dR�R�
����:jո�0��|�k�j�(��	!�+��,0*ӣ���FLm���Ѩ��>?F�E>��Y�_X���vx=���$��.����D
1�,:��E����G��fP��:�t1
+�ol�m���D"�Ֆ��H�V�
�|
��g�q�|�I���c�b���ԡa��b�p���OB����W����1��n
��!�"D�(��03��fPO�ܳ�  �Z����_n^����������G�)�
)�}c�3���(�QM��,�dV%�O
��*S! �hX�"�um�4�י;n��
��+��7�x�i
��|xS]m��
+[��'>�'$L�s��_�lQ�P�����b]���-���4l��2���J>w�\1�{[���zgY��6�[�`���n�	�i+PG�m���W�3q�<3
+�Aw����<�=9GB���>�!
+ 1��&�h��l�N ��|j/GC��I���[�k���
�������)Z�.��
+�~ R��O�`3�Dd�
V�-?V�^�ɉ�5R�Z��k 
�5� ���ϛ������������
�uƥ�
�h$��8�����
M!ڻ��ۜ�G��t�h��0d�dU&khMZ����I�uH��8�:Y�aW ���1�kl�ν���M�q/hK�?Є�Qi΀9l�=���c��Ӻ,�8� ��U�Bx�h�ȋ2�����d���
$q��t��)
�,���y�%�������4������|f��ܷ�{l_
�
��i`�#�H$����vC��U��|H�v��D�]�
�]B��8q=8���.9�%���W4�TCg4��H����Z˲�H�9���G`�ch�1�٫5#M
+�`�	�7t6�&
F����
�s
5h�7e2�[X
z��v�x��a�+��-�ýx4�['�H��2_oU�F����"����6��$I>\+-ô����`XoXƬ�� {�ڬL���/���v�랺l̶��- 	�m�Yyh.6����'�*h�M[
+	ڠ��
+�6>1�Q�3д����ƧT������YAM���f<@G���)is\�%js\�GԾ�O��
w=1ʡ�I�|!�72@c�/0��60㲎�y
+�ZC�M��G�֟n����q��
�A�.�1�
z<�y�
D=Z
�z��~cg�
�<ю�=D�‚66�>
c ��`�"}���Z���B�Ӝ���
	p���,za��x�W�

�+ܣ�H��Lܳ�m��
���.`�:
����?��Q���$-�� @9&��<�PIl|�zƔ�=[��z<I�g_X
+(S�6n�ۀ�Ӎ7
P@��Q��
�A5��D������

z�����=���

z�8,�C������1س�
=�vA��
z6P�僽��s
�(Az�|�_nn3�
��X�S`�������
�>�1�i�6{NC=P�8x�s�
�/��žg�iq1p՘�gC�
�C̦��b�r6���D����{��J) '��x��d�
GP�����<�yL\HJ}����ۢ�\UكV��Hka)iJΩ�DCyT�g��eUp>
�r���pZq��u�P
�1f.IA��16O��.�ӭ������2 
����{�ܣFIB�$�P$�!s��=vL��t�V�&=�y$�4�
{�	�����n;�
+���Ę�W��Y��Ӟ�,��1�,�����@T[�=*;��a�6��f˒
��9M�Ӱ���?�Go]޹�z�
��N�o&B�5t}��j%<_����r�6Wx��Ve����ɔ
��$�
����ӏVYv��`��z�W�����ۇ�:��Ү�udU�ߙ�q0
-�F�i/���&��J�	��_jm�B�����W
+�_����L�_�|�d�w(yS4�
99<�
+endstream
+endobj
+15089 0 obj <<
+/Type /Page
+/Contents 15090 0 R
+/Resources 15088 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15055 0 R
+/Annots [ 15087 0 R ]
+>> endobj
+15087 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15091 0 obj <<
+/D [15089 0 R /XYZ 89 770.89 null]
+>> endobj
+15092 0 obj <<
+/D [15089 0 R /XYZ 90 718.682 null]
+>> endobj
+15028 0 obj <<
+/D [15089 0 R /XYZ 90 672.057 null]
+>> endobj
+15093 0 obj <<
+/D [15089 0 R /XYZ 90 667.574 null]
+>> endobj
+15094 0 obj <<
+/D [15089 0 R /XYZ 90 555.308 null]
+>> endobj
+15095 0 obj <<
+/D [15089 0 R /XYZ 90 491.323 null]
+>> endobj
+14642 0 obj <<
+/D [15089 0 R /XYZ 90 466.79 null]
+>> endobj
+15096 0 obj <<
+/D [15089 0 R /XYZ 90 466.79 null]
+>> endobj
+15097 0 obj <<
+/D [15089 0 R /XYZ 90 394.111 null]
+>> endobj
+14643 0 obj <<
+/D [15089 0 R /XYZ 90 359.441 null]
+>> endobj
+15098 0 obj <<
+/D [15089 0 R /XYZ 90 354.958 null]
+>> endobj
+15099 0 obj <<
+/D [15089 0 R /XYZ 90 282.095 null]
+>> endobj
+14644 0 obj <<
+/D [15089 0 R /XYZ 90 247.425 null]
+>> endobj
+15100 0 obj <<
+/D [15089 0 R /XYZ 90 242.942 null]
+>> endobj
+15101 0 obj <<
+/D [15089 0 R /XYZ 90 170.079 null]
+>> endobj
+14645 0 obj <<
+/D [15089 0 R /XYZ 90 134.729 null]
+>> endobj
+15102 0 obj <<
+/D [15089 0 R /XYZ 90 130.246 null]
+>> endobj
+15088 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15106 0 obj <<
+/Length 2438      
+/Filter /FlateDecode
+>>
+stream
+x��[K�۸�ϯ�)��,��䖍�ڍ�q�I.�˥��&�8KIcO~} I%qDh+_F

+���LJ&���'������?*�d$���"18Q� !�y�iĕ
��)aR#b$<�n��ן���|��~w����_�x ��Nf��O�q2��?%1���n�*���2�x�\�R"*��(54���6c�(�«���,}�f�z�:�<�%X�c�U'�w�-h�^�$�p�`�N��h��-X��
i�k@���#
+�\�i�h�����!�"�,��{~q6���m�
s<z�.���i1fj�[��_�c�A1�EfQ
s��h�R�8"R��T↥DY`��c���}]�'T�Q���A���s�"&IG��� Y#�
�
���
 D"�T5��,H�z���S��^&�z������~Y~��s���l ��1��:	f��!y4v,$Q<j<�<��,�!C��'iXq$��1
���&��ч1�2��a%J#� QD�I=)2��Z
�C4W�Rƌ�@BF/���P�R��1T��#�X���쾀<0ѣ��۶>c"F���v	}[L3H�n���.��Y��R ���ϱ�0�����M�n
gLT����h?0�:�$��
d���*�3�؛0��$��0y��=��
+_�Z�
�s�+A�b�v4���:o at jq�jӃ����D���Y=Cϕ����8���6
�^�����=K�y_*�
��f]�
��f>f�.%2��(��A�kBEj�&
+
�H��\��W�t�@�4LhL^Ѐ
�
�K
�"1-��A��
�A`���D��v���m����i:K[�L���%P�����O���
i�|
���$�E
�A�gI���9
I�
I�3����A�Ɯ
�
Jf�S_� �Tp�A�T�����z�9T�1�$Ȉ�
�6^B�^�U�`�@G�
�LS��>���S� �"M�{��bKBAz�S�{(���˻oO`�
��+���u��M���
�ɤ�U72��Y�CH���	~զI�V�S�^��O1�
�G������S"�,�<�ba�|�K.
��IOP4`��XI�"��8���E㐡�����C:��!���1	ZrA�Z�֓E#h1-�Z��
	Z`��W���0��͐P
�i�
��+v<� ��{�A�g�}TS�1բc�<
7Ү��(
����L
w
T���D
�<�r��"�22`W���t��i��}�#�t@�E�L�gdR�wJ��R2�����c��km�{2(��z=3>�Y���0
%c
+�mZDF�G
BȘ��m��E���c��ұ���t��c���D
�D��!�g٘�
+R\��t����ؘ�:	�A��(��
�c�z�P��|
�,���)�C
zѱ��[���kG�������(?!¿�}-Aa��M�E�������H<zӡƄ1	%S�l�<]@��YV���\��~Z
"���S��A� ��B)^�t�4�5��?Eyt`�e0�iO��_�P2I
;
�������7]/Z;�o�;m��m��`���
�n�5%@�U�,���f9Lv��b�l�Ap:6k/<��WY��
�L0����V�{�d/����e�ء�
+� �MKK!5���xR��}N7������E�� D:�_�٣;7���ʪ�]:�l����<�pE�ڕ{�g�o��]ղ�_���v�t�*c7T½�)��+��U�M
[ΐ� �5�J�oNwHa�Y*
ѥE
+��
�x=���
�@"���BY� 
�n~|ƈ�ps�2��iU���U>�t��_W��,�偰j��?KzPmi7����m=�#���7}��3�8;0�ǽ �i���slD�����Vq�ʒ�bQ�rH�kz�e�˙�i���MMjg^�6��n�����_���J[q|�}��c�RlD�Jy����4�ѽ'�{y�0E�=��H�H�t�����\�b3�/<@�3M�W�RlD�J`�q<�Ę����龧�g�i�*��֥/5U�Њ>�r�.7yk`5	�k�^�y�
�#N��K_���"4~�6�HG>�pL�D�#Q{�
�!Mo"	��xMV]��K������+v<� ���}���.x�#��C�?v��p�c,�/
N�3�뾎b�A
�J	����1�Ь
�{G ����ݲ�WA�M׏���j�M��Ʈ
+������'祲#=+)���zԶ�8^��:p���	3?�f�B�5�j��o��&�@��A .�E��߭��n�X��:�>�|�HQ����#:
+	�J�/ 
+Cɥ�����z�����K���
nx�=`<�2�H��А����_�c��

1*��_���t�⽯�7H�� -Ӷy�l�>�i��n��U��'�
�F\�͑����������&]?�Yy8%�-�6 at TT�g�j��ʋ��'�\M-o�ZNX��S;a�
+endstream
+endobj
+15105 0 obj <<
+/Type /Page
+/Contents 15106 0 R
+/Resources 15104 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15055 0 R
+/Annots [ 15103 0 R ]
+>> endobj
+15103 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15107 0 obj <<
+/D [15105 0 R /XYZ 89 770.89 null]
+>> endobj
+15108 0 obj <<
+/D [15105 0 R /XYZ 90 718.682 null]
+>> endobj
+14646 0 obj <<
+/D [15105 0 R /XYZ 90 684.012 null]
+>> endobj
+15109 0 obj <<
+/D [15105 0 R /XYZ 90 679.529 null]
+>> endobj
+15110 0 obj <<
+/D [15105 0 R /XYZ 90 618.621 null]
+>> endobj
+14647 0 obj <<
+/D [15105 0 R /XYZ 90 583.951 null]
+>> endobj
+15111 0 obj <<
+/D [15105 0 R /XYZ 90 579.468 null]
+>> endobj
+15112 0 obj <<
+/D [15105 0 R /XYZ 90 506.605 null]
+>> endobj
+14648 0 obj <<
+/D [15105 0 R /XYZ 90 471.935 null]
+>> endobj
+15113 0 obj <<
+/D [15105 0 R /XYZ 90 467.452 null]
+>> endobj
+15114 0 obj <<
+/D [15105 0 R /XYZ 90 394.589 null]
+>> endobj
+14649 0 obj <<
+/D [15105 0 R /XYZ 90 359.919 null]
+>> endobj
+15115 0 obj <<
+/D [15105 0 R /XYZ 90 355.436 null]
+>> endobj
+15116 0 obj <<
+/D [15105 0 R /XYZ 90 272.75 null]
+>> endobj
+15117 0 obj <<
+/D [15105 0 R /XYZ 90 182 null]
+>> endobj
+14650 0 obj <<
+/D [15105 0 R /XYZ 211.842 82.124 null]
+>> endobj
+15118 0 obj <<
+/D [15105 0 R /XYZ 90 77.486 null]
+>> endobj
+15104 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F118 2438 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15122 0 obj <<
+/Length 2906      
+/Filter /FlateDecode
+>>
+stream
+x��\K�����)!�D���Gvٱ�{S9Ȫ-.9�eBά�����4�y/�C�@�!.U�������h�7X���<N�����&|�������M
2����zb�Dq���o�ɻ)�H�ٜ`��ogO������i������7�����m���i���T��7����?'�������2.Ŕ+3{��͛���nh�'�k"�ғ����{<Y���f��봛p��s;���7�a�3͐�i� Bj�!�Ln�C�m�����9#��K��2V�Ű9�
EF�R��
+x>6�������!S�ݗ
+PJ�R1��#%tC?�����mj3#��v����m�k{%~\�����2KG�u
YDpĔ
��9i��߿����p8l .��!�ʻ��{��]�hQ�H��V���W5�I$"s0����&KֿbL��$=��	�{���q8=KD����r�O�� 
+cfe�Š4d0�H�R��
Uc
5
a�hC�B�Q��ի����R�|:K6�ht	+�g�N��
!
Iʋ��%i�_
�}�}i�/w�c��`�=`boG}b���@��&��m�-L��nt�x��[��wr'�'sJ����sr<��C�A
z��g��)�2�D����f=�3
+�t�Y���[�
[�-$���Y@
�)�
�6�-h���?1͎��잏�*�^>Ba��,C�
'���y�N�*ɭ]�]�������I�4� 1Bz�
h�
`i+��jfQb�
��i�|�� x`��6��\
�~|�0������~�Q1]lO��nx]�<g�.���)�'��`(U��9.��'��S�g���}��2�=���
+5 ��
+ZSmN1CR� �[�X�����%G����)��L��_����v~#a%7̜Op`FT)N@�畈$(���q�����s��9<D�L� 
 Ţ
�7G@�Lj�pq�2
xi�j*sW@~�R�.Ҋ<O�s#�y�<+JVŌy�w�<�}�
�6#e�xg'{��/��(�Dd���"�1�
[�ó �sXg��VE
+ق�a�ʬ�>��#5	���I	��˳�5[_�/��p+:ފ��F�Rt�
JZ�T7&���nQ*���J�4	B��I	�U�f�M���4؎��
�B�u`�-уIQ�`�L�^��t)u�́Q�M�Ti�z�j�t�
j��f�J/���e�!�ɓ�����:N��N���DŽfl�
�\#N�y������!
�3!�����p/(G)�pu%�����N���'{�\&����~�������?9]@f����Op�VHN}����6;���m��s��(F��mG�E��N��e:����I0t�
)��6��ӽ��j�0����ȷ�o>.�g
����C�m
���H��pIt�..p�!$�!��'i����D���c�E!d�L�=
E�Y1V�gQ����&�q@�b�Y�þ���#$ž
�=
�R�YTK�
�m�� $R�3��Z�"0kZz����|���
e`KI���KY(k�`TU�u\��������� �
�|����mo�b���1��EV� [...]
+1�Qg�(�֖�e	��y[���1T�0�D4T���ݤu���[n��".���>�V]A�r$a�x-qkӔ�JY�t
"nDh�&�MI�Z�;Y��s�-�!,� n#��#e�j줖MC��m��|:S�A�*$u�����!�`$�j1� ��Ie&h1/bP-�*��C��Pa_�H?�Z���a�7W�F^�V�J*
+z\JVW���VaZ-�jAU��
3�r����.'[��گ��?��
��ŸǟZMZ�)c��?ݤv�v�E�j�	S�Ȝ�4_��dB�zO"nݣKta�q�VQLf_�0�zs�2�:VC��
���a0��z~s���Ǚ�4#�9�D�g�^Db
+�BB�ͯ/���̑���\S�b��+�^���Vt�;�T"fa?�D�$��1q�d�!-+(]D`��$
��&W���4ؐ��Q�W�G�}���8H�X�6H3ZK�/�/G��/�D�/[�;G`�n��
wK7�@$�*&6K������=ll�J�!QkğA���T�l*&}S9���v�Y4�&��}�2u }Ӱ����o��X�4�L�%VG�
�7�P�(�E
�7���$��/_��f��a��n�-ۢ�
�Ш^��/�K��rY�"�h��a���aH�~z���o

� 
�Z�t �#]��2�j��sl�:ެ/�2��L��
4�ɥ5��%�B���T}����i��
+=��^���*���
+X��C�jh0�}����8þ0D��/�
+��J���,�(]��h
+������tr@�<+�V
+�Ni� �q��H�5d	�Ο�c�߿���X��D1��7��:6W�� SM�9\�L5�%xl����cs��^�s����\��}j�
+��rj\
+��A��A���|������(����#`.���8L��1�
�%���60'YT��إ�\�7�S%XW����6
�b'�McVuc
t at V�i\~@c�;�L�8=�(���e���Ft�9H�lx��uz��xK��~��
+/^>�#�[.}��G���!��yfOS��?-��b[����
+�!ڦsȮ�x�K��+�W�?���w_���!����]����������!I,}/���-aUf���l_� .��	T���`Ò"%-��
F�^������1����
��-'W#�?s,�
+endstream
+endobj
+15121 0 obj <<
+/Type /Page
+/Contents 15122 0 R
+/Resources 15120 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15131 0 R
+/Annots [ 15119 0 R ]
+>> endobj
+15119 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15123 0 obj <<
+/D [15121 0 R /XYZ 89 770.89 null]
+>> endobj
+15124 0 obj <<
+/D [15121 0 R /XYZ 90 634.093 null]
+>> endobj
+15125 0 obj <<
+/D [15121 0 R /XYZ 90 519.034 null]
+>> endobj
+14651 0 obj <<
+/D [15121 0 R /XYZ 192.853 454.785 null]
+>> endobj
+15126 0 obj <<
+/D [15121 0 R /XYZ 90 448.768 null]
+>> endobj
+15127 0 obj <<
+/D [15121 0 R /XYZ 90 367.616 null]
+>> endobj
+15128 0 obj <<
+/D [15121 0 R /XYZ 90 276.866 null]
+>> endobj
+14701 0 obj <<
+/D [15121 0 R /XYZ 211.842 212.616 null]
+>> endobj
+15129 0 obj <<
+/D [15121 0 R /XYZ 90 207.979 null]
+>> endobj
+15130 0 obj <<
+/D [15121 0 R /XYZ 90 113.492 null]
+>> endobj
+15120 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15137 0 obj <<
+/Length 2792      
+/Filter /FlateDecode
+>>
+stream
+x��[m�۸���ŸZ����_zM��K������c˻Bmi#�����
��,ڒl�

+� ���F3�gf
rh<y���ۛ?�߼��b���rr��<Q� !��j�a�5�}��q¤F�Hx���������{���7�7_n�	O� �ғ����G<Y��'1�'���S�������J������
�#1l��It�D0�L�1�1$Fd`�/��4�[�F�B��)N����Ӫ���
�\I�敚H��DJd��5��fs*�t%�6NE����}��8�7�t�ۺ�_gTL�]�ݰ!�HD�0����h.��>�D�&-��$
�(F�0�h�|n��[���u�(с'O�"�EV����qL�
W�Z$�
+k���	��y��&OF��0����K Rb��%:t.8 j�t�����
aC'Ri�w�~8
�W)љ�<%��%�9ć$�mQ�iu'�-�Q��_�W����f���9r��<��he�����|J�p�6a���&�wY䆵���eULx�� �5k�f��S�9�zؼ�_98��Ǩ���ȇ34:+���� �K�4FKl$S'��¤5�� ��DR�(�hΛ_�ѓ�K��P��+z���oӷ�?%���Ix�.1`
9��ȉ>ɡH�\Kdy�pD���d�d=�_��1�ɌsN^�no�d��M����fLMv��o�sІ5� �CK�H5d�_.��y��?f����)��)��xINd��\���TC=T�
Y�u�
��)
���˲�m��
bj
'�t�����d�b̻��A"���s��cD�<����g������q�@ڰ��Au��0��Oŋ�L�.ɰ�3��Y��$-���t��l��_�Y��nG���W
�&0{���
v�PF Շ�΢b�%�;�p��KH��6O��-�� �u=�U��
��bV�ňz@��QM`ѥ|��m��
�4�R�&Z�j��Hɪ��v�=(�� b\�'EW�& o�_�Pp����\L�f��;���=����DpY�8m�o�X;.��д��麛�=���qY�
+�
,�
+�O��
+����������
�3#�O���,�����LM�R�sH ������KQ9�y�
�MȾ��h�}zc#��i���
�I�|������
��FVG+T����)����8�>�֖�.㪒h�uIS�� �a'��w�:1)�Bc.��:J�
KVʪ0�t�
Vj��.;�N}����A�d��{9-;W�v��������� Ǧڬ�u�2�����^S��0	b*�
g�9�Cu�+��)� �k��g���
�"H��V\�WN�/e�ͻ�
)�T��]%ɍ���D���D��W���r)��JJq^T��]Cu���\�����W�#��jHIű�bQt�7H�R�0��5-��xQ��n
+��
X0�;~�VP��!�`Yu��V���%�}3�Q䯟	2�-Z�CS�K��FE��xbA��e:W	
r�.��2Wr
"`�Av�9�R��,�U��S���
ޕ�tn�y�4��M�S�u�-*�R�[�-��Ǹ���.qÓ�O9�"X{��a<��~��H�uHЅ��@��D
dØQ��	�����n�D_��$�ҥr-e~��c�]�.L���T�f���~�1��י�k=<�
+wQ��
��P�MSp�^��Ί��;�KIJ�.L�ȧ�������d�B�������f�ש��"{�����(�4�W=2�6�W^�.W�U�F�b�NI��
���+,Ux\������/� O��oQ��i��[�Z��LȠ-�=�6ECu�]�[-9����Wj�
�muz�Py:��}Ϊ��#�]�ڑߪC.���������Hz"��#�
`���~
�H1,�Rd���M,�ԝ��``�nݬ
�,f�iҍ�&
�Jv�(�Nz
�]QD�^��ː6��~\�;i�%�H��&*,�0){

��ʟWjҍ��&���:֛�(�g`�6��^d0��
L8���xYK�I�T��6P�4
�8�2] r��!;�-��t�W�m� -퐖�-�SG��=K�i7=��
�#I�	��ev��8�.�dݽ�]��ҧiw��ە%CjuO:��Pp���]�tJ9���4��bs�㞮lKZ��tmcWҺ��o�R}���!"��\���ˁXQ�]���Z�P�6v18�S���2M�E��nª���M]p
n�ԝ�I7�H=���
+�л�!����Z��
	���t��旭��W
+����+E���L�<�^O�}5��B4�2�`,8�LCī�e��, -[c,$l���R�-=
+E CZ�KG���}��
F����mg
�z9�T�>����ţ~U�������1;<�ǫd/cA:��I�n`C*�O*���b� ��ՔFx:�I)�0!T���p�p�ȋ,^�~���
�P�q��O|[��UEz	�T��;��g�j��a:C��m�:
+��p
y�oz}�۪�8�~�F2��=��0W�y�
+I�@�߄
+Qb�%�oF�`���&AS�7�YR!KT$U!�PK�5T�v�(	DžBZZs�SGr!����йdh�C��
Dr��YW��:�v�/�(;����Q4$L��x&��a�k]����n��a�&IA�^�
���k�k ��BqX�Wc�����;w��<��8bZm��m��wm��;Ƒ�OxD��Hۺ�fsF��}T
q���Q�'���N
+Cm*�cQ<ݾ~�y��G�4
�������4'Ͷi��^nn�ߗv���
�ڗ�
+endstream
+endobj
+15136 0 obj <<
+/Type /Page
+/Contents 15137 0 R
+/Resources 15135 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15131 0 R
+/Annots [ 15132 0 R 15133 0 R 15134 0 R ]
+>> endobj
+15132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.931 434.082 186.185 446.416]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Grid) >>
+>> endobj
+15133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.668 434.082 272.341 446.416]
+/A << /S /GoTo /D (index_Grid_Frequency) >>
+>> endobj
+15134 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15138 0 obj <<
+/D [15136 0 R /XYZ 89 770.89 null]
+>> endobj
+15139 0 obj <<
+/D [15136 0 R /XYZ 90 633.112 null]
+>> endobj
+14702 0 obj <<
+/D [15136 0 R /XYZ 192.853 568.863 null]
+>> endobj
+15140 0 obj <<
+/D [15136 0 R /XYZ 90 562.845 null]
+>> endobj
+15141 0 obj <<
+/D [15136 0 R /XYZ 90 483.696 null]
+>> endobj
+15142 0 obj <<
+/D [15136 0 R /XYZ 90 368.637 null]
+>> endobj
+14703 0 obj <<
+/D [15136 0 R /XYZ 439.299 316.343 null]
+>> endobj
+15143 0 obj <<
+/D [15136 0 R /XYZ 90 310.325 null]
+>> endobj
+15144 0 obj <<
+/D [15136 0 R /XYZ 90 250.952 null]
+>> endobj
+14704 0 obj <<
+/D [15136 0 R /XYZ 90 216.282 null]
+>> endobj
+15145 0 obj <<
+/D [15136 0 R /XYZ 90 211.799 null]
+>> endobj
+15146 0 obj <<
+/D [15136 0 R /XYZ 90 138.936 null]
+>> endobj
+14705 0 obj <<
+/D [15136 0 R /XYZ 90 81.969 null]
+>> endobj
+15147 0 obj <<
+/D [15136 0 R /XYZ 90 77.486 null]
+>> endobj
+15135 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F24 537 0 R /F118 2438 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15151 0 obj <<
+/Length 2767      
+/Filter /FlateDecode
+>>
+stream
+x��[Ks���W蔥�F0�W�Lv�����s��r�-�F�$5^�ק�ARK�T�$$ݍa���,'��|w��%�������b���rr�41x��AB�_�ɯ�H��`���S��8_��G���9Y���O�c
�ww��)�Q�����U\���)q���<��KqM����p����74��5H��|}���x����f���=��p��w5�t��
Lt��1�DH�2��y�Y�%�C)w���"�!N��İ9�EF�F��>DKĉ
+��8e<8%$���k@�DX�14�� �d��_��LGnACu�D������G�߰���;t��@�nI9b����m='s(���1%��B�™�2Hs
��ʁI
��Lj$",�h�ޖ��_�.R��
+C
*=ū"�OK�8�~�N��y�)�IuJ�~���ތ)�
'x
��������L��o�Z���9��l�
G_�T at 2��ވ��".��7�i�@�a*vL�ad��Ҳ��/I��7E(��(��H�*��3�_/�]��x�-�:C�����^H��ի�[�m�[o
�3�w9f��! h�L������C{�^
�wP���j����DE����
�4"\! U'�]����}�
E�4��2�
3��
F!�_d��Gg6=�ְx!�p-Ǥ��
K���›
�-�)0,;]M+Tv� ^'�-^v5�uX~���i�u
� (2�
�x�jހЯ+![5?&O ����T_��1A�A����
+�lʄhʄ�ޙ�����u��6���8�Y")
^�t�d☪P�� ĵ
@H�*���A�ҧwp!
��g��L=��Q��Q���fY�z�6`�n )xۂ�iT#g��ެ��(�
��W̩i�}��7@��`���d�E|LN�
+��K{8o@��b�L�T�
��A'H�
+��m0Z;
.�C;�M�,_�U��E����]V��E����UZ����6+��q���Lp}����깕o��s=�c�l*��6]��@���n�s
�աL�668
�$��`a
�N61豰I�Y��9�
��:)�x��}-����
��}����(����(wws<�@(nʓ�X�b
��?ȝ��|I�U\Z�4cX���Y>� O��A�����Ӯ�iO��6a��rX�ꏬ�u�����n��@��B�X�<;RqE"u���U�Ŗ�,]��DQ���rc[��z(��I�j}F�=��`'b:���*^LU��E,�
+3�j
z;������r�۾5}Dg; b놻�߿��P���hX�_��A
�b��`_��Z]���FU�D����bQ�)�g�mmz
�b�1%,�#%eG�`r��lH�/ͭ�*^�2Y��hn�
4[��hQc��k�]U_��&]���CB��Ui}���:ep!����i3���Ԙ�zt��6s��.
g)ڟ�͂!�T�q��П�Â��!��J�ׁ������zI뭆����4��KT$���:�X=s#��͇C$RJ�
�%fl�i�s������j��s�l=�;
+g�=�J�<��������+�t��$�%�ޡ�%]����D7N8�_Q�ȓ��q� aR4H��ފ�ƫt� <��h�['��x�S(��1�k |h�PhC�64L]�x�0v�?�e�/@۹���
z�q:e
d��
+��
e ����1b�7k�sm��Zf�l�-_g��vZqi{5{K�-9��:�M�����0{�h�_?x� &�����R�&�52O~`b
�[]
+�I]� Yq�1:�@��[��{�@�Q������@���+�$y\���N� &(��y}�Q�H0q~��
l��oh� ��QZ��t�$h
�(ze��Lx�M�H2��'Y�-+��b|JD��qs|��Q7&�
��Q	`�c,:4��5
+ͼ�
V�ɐ�� �0�馁c�
�I��
�������)
��z�
�[סt
p!�O�s�w(���� a�b#}c�ތ7�O$~�:tS��~
�kb��8�{�S�z6 �g��K�0
�@!ɸw�̓��B���{�H_�	�8n��0��lN8�5'
���\�	��-�?�v&!4H�OM�߿�gs�!���·(!<�������t�<0��2���x=l
�-Z8�������w�<�.��Ps��0oP|^Cq����0�3���ך%n�(]��7_;PZ�[X$��:�j,� KՂ���_A�㑄c�E>"�lI��I��X�ј�v�T�c�e\2���%1�$�����5���"�vң�$%��8	DX@&��=Sl��D�2&
6�M� ���'���ͽ����R��e���6϶Iރd���9�?WXWӸ��`�xW:�l� ���^ީ�2��܂˙���h=� Qp1.&]#�$ﳅPp��}������}�`V��ן���
4;��q1�
+��q�C�f~�1�s�ϰP��[#�VQ?y��)�l�?5����w�ɛfH*r�R�G�b@ȌI�$6��'� �nC<8�SA�
�&�0� ���0�D��!$hߧϋa�E���6
I}4&l6
[J��>�c��+��
�����a�G�v
��KB�Sv��ԅY�~Pa<�p�Dp8���Ǐ?��I��T��*
��7���"o��bS.ɋ��N � ��^u�E8��$�
^�ϓ��GVv�QБ���sYn�nowK��K���-[�?�쏞וi����(�Ӎ�4�7�b�	���� �����R�=Ѿv7������l�
�����g�F]
+endstream
+endobj
+15150 0 obj <<
+/Type /Page
+/Contents 15151 0 R
+/Resources 15149 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15131 0 R
+/Annots [ 15148 0 R ]
+>> endobj
+15148 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15152 0 obj <<
+/D [15150 0 R /XYZ 89 770.89 null]
+>> endobj
+15153 0 obj <<
+/D [15150 0 R /XYZ 90 606.148 null]
+>> endobj
+14706 0 obj <<
+/D [15150 0 R /XYZ 280.943 517.988 null]
+>> endobj
+15154 0 obj <<
+/D [15150 0 R /XYZ 90 511.348 null]
+>> endobj
+15155 0 obj <<
+/D [15150 0 R /XYZ 90 454.729 null]
+>> endobj
+15156 0 obj <<
+/D [15150 0 R /XYZ 90 401.04 null]
+>> endobj
+14707 0 obj <<
+/D [15150 0 R /XYZ 90 354.415 null]
+>> endobj
+15157 0 obj <<
+/D [15150 0 R /XYZ 90 349.932 null]
+>> endobj
+15158 0 obj <<
+/D [15150 0 R /XYZ 90 289.024 null]
+>> endobj
+14708 0 obj <<
+/D [15150 0 R /XYZ 90 242.399 null]
+>> endobj
+15159 0 obj <<
+/D [15150 0 R /XYZ 90 237.916 null]
+>> endobj
+15160 0 obj <<
+/D [15150 0 R /XYZ 90 177.008 null]
+>> endobj
+14709 0 obj <<
+/D [15150 0 R /XYZ 90 133.657 null]
+>> endobj
+15161 0 obj <<
+/D [15150 0 R /XYZ 90 129.173 null]
+>> endobj
+15149 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15165 0 obj <<
+/Length 2169      
+/Filter /FlateDecode
+>>
+stream
+x��[[��~�_���b�yK�M�4I�X}H�@ck<Bmi"��8����d���+7A�>����������h�談��
�T,2�H*��Kdp��AB¯e���k:�q�uĤF�Hx����?����n��>{x7����#
'@ ������q���_G1�����M�)��:�����`�_vh/
BC:�A�H�
wh�O)��E�I���2)k\G�W8~�
�gG�a�`gNj&рn
��T �����H`qJ*�&���v�wv��1(% (F�P�ߋf�v�H
+7�!q���P���"Ϫ8���
+<�^7X�YY��?�+7����n��L���d�L�{��]Y%7�_F��؋�/iwר��z�37
v�0�#�I;�zMK7�S�������.�D�m�R+��v��뢄K�\��{��"y�R8����@ 
�:	�����-	.�N�&�s p%}������>ሂ�5B�$z9
RE�Y1q��ٔ���)ͦ
O~���򧸘25Ym7IV�6{�9� '��������T�T��D�����ȧTL>f.��C�e���v���8[ȁ���j�,���s���q��!�-_��,���-���u�(/�u��	��tޜs����
�
w3)I`׽G��8f�ŕ�zk�
p��`
�bk�<�9�Ѷ���&>����भD�O�`[f���P�I�{?��V`��dY
@�T �d�j�i�7�s���d����3%b�gOO�r�&�cp�z�!�1j��W$
Xx��8�� �&: ��0V> �za"��MD� �����uV��O\IT���[xC���?�T9L�1��fT4k<�
7�u�4j�O/c����&y(&f�"�U?_.���o��!�nX�+�a����,|ط��1�^�mSo�,ݤ��٪�H�����
S�ӚQ0[J�*�Xտ3'�6큅+N�K�
1��e
���Z��kXٝ0Y�c~�n�n���0
p
��04<��1�� ��
+B��8� Bl❯�M�v
����Om��A�b,���,�:RǍ��ShR�
�aK�O ��&
��r��uD�C�8�:
�
�h��z���꺊���]N�n?�q/���{��+����|p���,q���l(���P#�
�^����d`F��d��e���a����!�_E�E��}n���˽�!�R
��L�
�v�۷v�r�X$e��]7
�J&�͇m(���ERm��Ep�|;��
߶*fDk(G��3��%Y7ix�@�ϧ��w��{��%
+)€�@��qrLĩn��Q΁�i{$�f�@��4m��R
���L� ����	���\��VW�%E\�
/��f�3.�+H��]��7��Z'8�5�ӜX�#�y�j�
+
=��T�Й
Ra&&��X
�j�w7k�
+WGa�jU+���"�0�T����	�����:�@: ���M%��dRz>��n��˓au�'w��ȓ�B���(�ߙ(3� [��C
�
[��c�&S�@�F���.��w���
���g��{�}�#�K�k������>n� �b��o�x]UH!}�g��7�H�Z�Ȭ�e
+��A0Qg�
YnGd��6B.f�T
+�6/Cj��ܞ�-�=����4�x�f#<�61��\E�����ȹ*�P at 9�
��X�v��Nf��5$K$u�d�l���m�f�Q���{�k^K&@�vnhw
+�e{��vl���v����
+��M��W��B�qdy�$��3�-�\N)�l����~��N
+JKd�����/�~V�݃����8���d��[�gL�(*
��sU�iXq���(6�Gv)E�M �n�
��I��*8KR����]�(Aַ}bf��I2��X�|�Ю��C%�\�� N���!Cy/��9��G���by�WL";�}8W��/��	����^�X(��,&
����X�ҡ�4(
&� ��5,�N�,؃1?r��bY[V ;�,�(B(��V�#D�^��6n� Rѐ���%6W���yaQ^�	S���π�h��;���47
��a�_sv7y����4
�����1�]�w���q��I���Ƭ���m�|����k
IQֽ
{� �V$���D?$I?
��������&�?���kU�==>>oWe�����\zx�}{G{i�w����4����~��s����Z=
+endstream
+endobj
+15164 0 obj <<
+/Type /Page
+/Contents 15165 0 R
+/Resources 15163 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15131 0 R
+/Annots [ 15162 0 R ]
+>> endobj
+15162 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15166 0 obj <<
+/D [15164 0 R /XYZ 89 770.89 null]
+>> endobj
+15167 0 obj <<
+/D [15164 0 R /XYZ 90 720.814 null]
+>> endobj
+15168 0 obj <<
+/D [15164 0 R /XYZ 90 667.125 null]
+>> endobj
+14710 0 obj <<
+/D [15164 0 R /XYZ 90 632.455 null]
+>> endobj
+15169 0 obj <<
+/D [15164 0 R /XYZ 90 627.972 null]
+>> endobj
+15170 0 obj <<
+/D [15164 0 R /XYZ 90 557.241 null]
+>> endobj
+15171 0 obj <<
+/D [15164 0 R /XYZ 90 503.552 null]
+>> endobj
+14711 0 obj <<
+/D [15164 0 R /XYZ 90 400.817 null]
+>> endobj
+15172 0 obj <<
+/D [15164 0 R /XYZ 90 396.334 null]
+>> endobj
+15173 0 obj <<
+/D [15164 0 R /XYZ 90 339.715 null]
+>> endobj
+15174 0 obj <<
+/D [15164 0 R /XYZ 90 286.026 null]
+>> endobj
+14712 0 obj <<
+/D [15164 0 R /XYZ 90 227.445 null]
+>> endobj
+15175 0 obj <<
+/D [15164 0 R /XYZ 90 222.962 null]
+>> endobj
+15176 0 obj <<
+/D [15164 0 R /XYZ 90 152.231 null]
+>> endobj
+15163 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15180 0 obj <<
+/Length 2410      
+/Filter /FlateDecode
+>>
+stream
+x��ZK���ϯ�)��VX��-q�
�j��T�-�ęaE"e�ڵ�}RE�F���ҁ 	4��F������G��������H*���(���	��ǘ`��lN0��Ì�8�����q�ڽf�*��s�T������xFt\�98�n�ֵk�3{�컬Xd �q)b�����Ow�?��zG at 3
��@JG����O8Z��"�X�����:��u}���
�FuWD�i��75!=Su�0�"
i,������6M^�U�@��n3���X"A�I��J�C
zb��LD�$�
+#.�)�8bip�P,�+�4�z"�s��U�B�,z�Iq��{�CE���D�3�9u���ϋ��t�/?�Ռ��e�Ί��ױ����&�I
s����R�8"R��T➥'��o��kUΨ����Y�?���@�+��F;����D�Jtקy�k�'�_"-�)-�#r���������U��ReN�ܔ��e7ϋE�ޤM����h\V��2����}ޙ)"�;I��AP"�򘑌��e�l�
=�.`sg2�Sf�M�sM�RР0>sO�]�dk�.���%+�*mʪ
[V��ܯ���
+�_b�GQ6}� ���{A�'����k�uw�I�(���>�mʼhjt� 	� &o�G��IO��:P�"��!����=��3�*��e4
�V#ev|'�=�ƛ��b�s-H�۵�J��m��"�O���u��$�
e�I��9,��ݴ���"�����O`"'���3�/���V~�u[�y�v
�O����k�(ա���sfV� �eV7
��e�����
���h� ��
�A
⮇6_f��e'��>�;tQ	�q
+��PQ�3'
�B�I:�:t ���NQX{z0
T�f�"]
�@�@�M�,4�h�
+���:��.���tY�ߧ˙����1H'<�S(�h��
(�(��jk�c���,�l!ɼ���}H�9Z���]'������&I��p=�}�b��2���E{����	�%Al�����(�!Tk7�O˥1W���J�֍=�I6�j3�i�����P�a�x�[�� b�ڧ�r$��aLM�qJ����X�L�wv�V}��m4F��k<�
.,��f�ש�6UVX̖����L}z� �ң#4e�˜~2� 
+�S 
L��ѶQ%]g��@�Ns�@�5̃' vO�8���l:�@�9���D�F~#B�#l���'\� ���||�����F=��)%J��z،n2W�� ���>��r�Oiǀ��ܠ��M� |J�y��� �ń���sN�4%0�2�i��9�.�^H�{��ɸ��s@]��T~B;[�>0����

�W��Hk:E��,�YO�>���!���sK�-�p�+d�v�˾y�Ծ�(I
����3
^
hk�b�*7Y5
����k�xu�܇�"ˍ�>��0�n����hۯ
���J��„�
��}�x���M�n�y:>�t�[����]��vѳ�K�I0�4���.�y��؅��q2��u1jp;�B3C��T��L�[-V����&Q@�LCB�D=�;$z�
u�3���{rBr��Ӽa�#��.�~̋U^d�N�A��"�tPt�$�
�!"G_�Z��i r�I�-F���lb_�� i�T8�w�F�����{�����3=w^��������D�Il$��O.�BR���i�x5�c�B��W��%x�
W�9
�l|�l������.
c�/x�n���������l��t�7K��R)�MN
)�))�b�@�=�(��lBjؓx5���Q�	�l���зQ����S�oI
��N
/c�ov���$2Χ
H7ȼ2J�.R=q�|�wET�tPD5o�"��%X 	��ҁ+��'G���\�|����jD�0��o
i=�ʩV��MyPN5/�r����N�
ж�:4ĕS`
D��ʩb����T@��38��SibEye9u
+,��.��U1������0�v��c�B��T@�S��
+��H
�j
�U���_��h	W1Ƞ�����,�k�"�d��|w.#"��/��r�
+
+XlP��W�R�.It[�
�.u��AÚa:�4�\#��*ђ��7
�W'r�R�U�Y���VK",���\Ct�z�48�H
˕@B�7����|/��ʽ��a�J�N�'��塙-&?a�(�Y@r��@r&'��%�$?	���8�CxnR�(<��x��;��e����� �_�
��������a ŹzWH$z�]���g׀�P�q&D����bk
�M�bAV�y��y�ȦʴIB��ч,�A�)���m��κ�^
�R�>��6�������K�/<�0��l�,�����r�u�zW^��u����uN�	x,mW�W�DL��+�zm��
���q͢�����
�/en
�
+endstream
+endobj
+15179 0 obj <<
+/Type /Page
+/Contents 15180 0 R
+/Resources 15178 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15131 0 R
+/Annots [ 15177 0 R ]
+>> endobj
+15177 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15181 0 obj <<
+/D [15179 0 R /XYZ 89 770.89 null]
+>> endobj
+15182 0 obj <<
+/D [15179 0 R /XYZ 90 718.682 null]
+>> endobj
+14713 0 obj <<
+/D [15179 0 R /XYZ 90 592.037 null]
+>> endobj
+15183 0 obj <<
+/D [15179 0 R /XYZ 90 587.553 null]
+>> endobj
+15184 0 obj <<
+/D [15179 0 R /XYZ 90 507.024 null]
+>> endobj
+15185 0 obj <<
+/D [15179 0 R /XYZ 90 453.335 null]
+>> endobj
+14714 0 obj <<
+/D [15179 0 R /XYZ 90 406.71 null]
+>> endobj
+15186 0 obj <<
+/D [15179 0 R /XYZ 90 402.227 null]
+>> endobj
+15187 0 obj <<
+/D [15179 0 R /XYZ 90 331.496 null]
+>> endobj
+15188 0 obj <<
+/D [15179 0 R /XYZ 90 277.807 null]
+>> endobj
+14715 0 obj <<
+/D [15179 0 R /XYZ 90 163.117 null]
+>> endobj
+15189 0 obj <<
+/D [15179 0 R /XYZ 90 158.633 null]
+>> endobj
+15190 0 obj <<
+/D [15179 0 R /XYZ 90 99.883 null]
+>> endobj
+15178 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15194 0 obj <<
+/Length 2699      
+/Filter /FlateDecode
+>>
+stream
+x��[ms���_�O�4�x�$�i�s��k�ƾO�̍lS6���#���w�AQ�^pI�ŤHbw�.�g��!��?��vsv~�Xb��T&7���Dq���_������&5"FB+����x��Ǜk�����٧3�pB� ��N��~�'����#ft��}�p��L���s�k[0����Km�!=�A�x
F�"�����x�yJ�$��3������O�M
	�S�8i
�]vRd�i-ݴ�h�
+캚��|9%d����P*�1�S��&0�]v[̋�LO^/.��L��䫋�"��1]���1�Q-�D�S��и/Y�8�S�N"�(��@�]�z(^��]�}�x:��7ee��E���}}��}�

@7���A��
+�L���À��IœXm�🂙čU!�w[q�xߌRD���ޗi	�x2����yJ������ӰOJt����
('
\�
�*�b�nu~Iy01���|�4s�]�
+}��͔!C�oP0 at a
+�2�q���
����.}�2�PҶ+�
+��~ړ
|���yϥV=���b��LH�&��@#�K.|�1K�J�"m��H�
<�b�)�dё����P��#���NY�_\d�)��>_f�!�15yxyJW���mI i̢������]�)�H����C|Q���ȧTL��|$e����I�G
���������~�� �Z
��E���g0]%��,[��O��*�]�h��	f���x����L�z��Q�#�A�%D>j�0<�|�`�8j�i�\H���}$�<�a�Z��:
~���������C)�97��0N1�VU�
����V�3��@�G�o}�~-��i ɀ�ٻ�p��5
*�+D���
"����ǴM{�r�w5�� µ�}�#�"#���(L�dvH�M$�
2J���4��
�`&�Ҍ����qt�/	
+����� ҁu@�
q*Eם����S�}UJd�
+̀� ʱy)�3l8yز�O>Bi�ءR:��ubc+� �@�0���D��"��%�	<�/a��\+�i|�āe
�}�.�����ĤKk���%� 
+�-E�gC�Ž
ɕ�~��\i H��: ��FG�����#)��<A�(1� � ����,	9J��q�=�

ۓa�#X`y�
,�A�h
�
/"=�#-X
���4���u�����y�0t7/�X�ϋjA;xpU!�E��H1ڟI�z{*7��vn������R9���"G�e�~'r�4�cl�1��e$j�a��	��Hx�7:юAnر���[p#Š��+���FǏ�v�tu���~��ø���M
?"7b0�B��@�+��	 �߽Gu(9�<�
1�a�X4v��
=�u�H~����m�,.A:~¶G�g���$s�#Q�Ά�
G25G��y9���vs
�F�����
o+t��s�T�����j��ؽ<j�"���I,�D "
:w�����o���z���
X�g�y��!��
<=��
BL0
��v�ptk`��B뭓�
�ȷ������� �
�'xX�.qk�aa��`�\ ��qLp/z&�v���%�)r���������i��.c�&�v��]��F
+����jW�0��e�Ja�6��D	������@�w��i@�Xi?��Y��_�b��X����
��MP�_M��s���Ү������ɰ���@
�g���������'��ٙ~C�C�+���1�\��f&
U�p���c�h��ϸĞ,��q�v\���̙�
��,��+�vR.dR1�y�0eF�7�t4_,Ӆ���q�N�6ϳEz����#�Pף#���8�y�
0<ƴ2-���/�����*?�e
�*�{O7�
� ރ�L��e���Θ�H��1V���㠻�#�����rH(8�X�����@˸���DT�F����
+DaMjVdw�Q=�n�>P�8����|Y
���
P
U ����~�a at 9T�N����\$(l?r�?�ԅh���ֳ~}.��W�����˲��D7	
�c���9p�f�[�����jC0)�
�n��c=ɛ����Xk�s
,S�T�
Ц^ ~
)m�uh=�C]��S>x
���1"�5"c�/Y�
RnV������߸�lO>�u~X.�DWn� K����}Ys��,�4W@���r�)c����,7v�XogB5X��/,pw��_3��}�� Ң�#���,�ϫl��?�.�����eu?/��5�\��MV���;2��b��b?
���Y����9-�U^L�� h	���eX�Κ��]�.lwl&��Ҷ����7��.
�.��{U������
�n���Kl�>^�W��(��4`:������р9ɐ�����6`��s�L�F��
�
~7Cq0n5��o����U�!~h��E��1�N�v����nhF��#���Ƣqv4�α~
C�446�Y3
7]kn�LL����,��o������{��+
݅�3O,%�yp�x��5��e��l���B¸��tf�RԽ�޻�M�����'��=akq3�7[
l�A[VȽ?�
m��Ө�૫w��}�����+��˼NF���HwZ�M�� lE[
+V'��4�a�����<sh�c�`�[>�XU���/e�z@���n�������0$o�S�l'e��+
��!2��K�1
+endstream
+endobj
+15193 0 obj <<
+/Type /Page
+/Contents 15194 0 R
+/Resources 15192 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15131 0 R
+/Annots [ 15191 0 R ]
+>> endobj
+15191 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15195 0 obj <<
+/D [15193 0 R /XYZ 89 770.89 null]
+>> endobj
+14716 0 obj <<
+/D [15193 0 R /XYZ 90 721.073 null]
+>> endobj
+15196 0 obj <<
+/D [15193 0 R /XYZ 90 721.073 null]
+>> endobj
+15197 0 obj <<
+/D [15193 0 R /XYZ 90 655.872 null]
+>> endobj
+14717 0 obj <<
+/D [15193 0 R /XYZ 90 621.202 null]
+>> endobj
+15198 0 obj <<
+/D [15193 0 R /XYZ 90 616.718 null]
+>> endobj
+15199 0 obj <<
+/D [15193 0 R /XYZ 90 545.988 null]
+>> endobj
+15200 0 obj <<
+/D [15193 0 R /XYZ 90 492.299 null]
+>> endobj
+14718 0 obj <<
+/D [15193 0 R /XYZ 90 457.629 null]
+>> endobj
+15201 0 obj <<
+/D [15193 0 R /XYZ 90 453.145 null]
+>> endobj
+15202 0 obj <<
+/D [15193 0 R /XYZ 90 382.414 null]
+>> endobj
+15203 0 obj <<
+/D [15193 0 R /XYZ 90 328.725 null]
+>> endobj
+14719 0 obj <<
+/D [15193 0 R /XYZ 90 294.055 null]
+>> endobj
+15204 0 obj <<
+/D [15193 0 R /XYZ 90 289.572 null]
+>> endobj
+15205 0 obj <<
+/D [15193 0 R /XYZ 90 183.599 null]
+>> endobj
+15192 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15211 0 obj <<
+/Length 3123      
+/Filter /FlateDecode
+>>
+stream
+x��
�n#���_��VV\�94�M�
������e,���
T�Qfƻ�~}ɹQ�.������Ps9��ϱ��a�'�_}s{���b���rr��h<Q\#!��b�~J0J�lN0�ӛ�ӴZ�nfO���c���?�wUZ=__�o�H2-�ٜ
+<�v�ֵ[�͖�}���e\�)O���������� exB
%�dr��z�
�,�����N&��K�	�
��ɻ�\ᖩ���0KsiY�d�j��|�C	���>�g�&/���r��`��%T
���t���없����9b ���i!����m��H{�pDa�[ U6Y������!�"�
�������:/f
O?��|�!�fLM��YѸ��w
s8d�Q`�ns�GD�C�J<�b�(��}���O���K�
h�}�)b��b?Ye�ƽ������a��* 
�`սV��A`%I2FZ�Z�^�p5(�</���&m�U�}ʛG�z�
����{���XE:�h
�:D
C�
��4��%b�WC
H�xT�� 殸xR"�ʚ9>��t�T���~uw��l�ޱO�4����V�}�n�E�U�*k���t�u��Vn��
�1]��{�i�#|Ȋ�J�����k1�rU�u��\�p>�T�s����Zm�fDL?}um
��G�׬Ҫ������f����l��s�v��;@J at u�	�2=L�E�D�:��
�^�JLm���X����
���)��n��9� VZ��Z��=b����7�z��=p�ρ�w�g�O�
�B���6ϛ�H�f�9����u��po�������Iн��:w
+�E�Ăb���oJ^�����-�~(�`&n/��.�
L��2�
,�`�'�biP���&
+����?vΎ$�{�㌂z�
�ٍ�eb�]�8XP�,qC�f>K73F!*�2uc�!F
��	.B5
Q���9�4I��b��,����5L��?v��/G8QI���{�H|�@��T���tY ��F�+�
�=����© �"
+R0$�Q��U^di�?�(�1�2� jL��S�j
@
&<i߾�	�����>�p5��0lC�ٜK㖊�u^���C;m���ׇ7���o��@�Ŗ�� ����'s���G��� M�K:�9�&�Ӿ��l?�F�'8I.2DP$�AP�x������v��Q�� ��Q���
����[�C�
���D�ЁJ�.<��&�B~C�^����6�''�?&o,y���C�fA�D��S�����M�B.�3�!�Q�k���r6gpDJ
+?Z6�F���Ə���^�*,IZ����le���w�*V	ĆS��U���� v
����l����}^O�W�ي���(��^�����u ���
zBRK�%�r���5
+^7+I��V)d`��(ױY
�
+g-��ֻY
!{ѣ�j�:
#.����)
����cV�r
f�)��jQ�@m%b�?�.�V!
%��=����5�O�9IЁR`�:���=[��`!���5��A���4�
�rO���T�C�b�%�
)Tz^R�pD)���9��
�-]
+
�r��p\q(P�k�\X*@�%#�j��,1���_�%dCT�t����E�v�4�׮l=����x�tU�[�l���D%�C��~oJk8��|*i�g�#��e
����􄘝q��ã@f\�1u�rc
+<e5�P1g����Z�ϖmM����L�4�
�ϳ������ݶe��~cY��jD"r�i�n
����.�Zm�j
�,
� �H Ϧ[����\DGPY<:��P<(
�[e1-��]����NY(��~w�B��,�+&Z���k:B�θg��+_[�����{Z{e� 	��-�!:uQ^����ARH�!��
+)��˜V:
՚��	�͘
�7F:�6(w�\�t���M�����H���r6ė��9�6!��Z69l�i�&���T�B1��<yIk����m�z�19�z�[���[�8����u����~
��%q�>>L���,�g�������a���ې�8�J@�-�� ��HTOE��!��7����o��-�7�\[2ڏ3L��:	��Bz�
�X�]��]�`=_��t�y�y�S% I����
�~0%������ُ�g?�����~��c�Àb,��G�����p�#K����
f?b���~x$\<�q`��6� ˭.��0�	�k�q�	��fB�DAi"
�ȁ���$~��q�1ƿX粋X�N���X3���Mi}cn�"е�H��DS~��D'�z�C�4Z�{ �y�0ʡ��O��6jy�bF��TOE9I�(J��G&+��&+XКΙ vf�3�[�N��s���&ެ��t��'5������G�jR�8�`bD�nȡ�:��
V�G
�.Q [...]
+�R,|{���qK������dӄ�[��u!F;�.?u�wR��|&���TRƔ��!
.��\��[�H��g��,灘��n'���$HAR�QvBLkB+
� `
�^D�/j�����n���5��C����4�}�SS\
�;Pe��(�0It((1��ڞ����ŶF���|���MV �m��b�-~����&��
���g��N�ܻ��m�f�
V�!�$�kRvR��m�����ZoR�L���
*0��ײ?v��6��MXq8����µ��m�yZ
��ndI
tP��
����|�k�-�]6 ,�$Tt��e��%��8.�s���	�k��
�����c2zW�j��
�.�}ʻQ�n�adO�~8��� ۛ
��P�Ά���6�~YFoi� }�Qk�_ �U4M ���
 ^������gGd�kA�|�ف�yF*�:M|Eٱ��~�)@Yd������W����Q������[i�#);�_Ft2��?H�m�C��=����:��hf�ɺ�xRE�]'�$��TYbB�v|�]�E���O��߮�l
�3N����c�l�_��{z���ݗ�ݨz�
��v��|����ԼX��
Њ�$�"L����
��_�1Q��7�k��������5����M
N쿜q�
+endstream
+endobj
+15210 0 obj <<
+/Type /Page
+/Contents 15211 0 R
+/Resources 15209 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15222 0 R
+/Annots [ 15206 0 R 15208 0 R ]
+>> endobj
+15206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.4 195.235 212.124 206.139]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+15208 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15212 0 obj <<
+/D [15210 0 R /XYZ 89 770.89 null]
+>> endobj
+15213 0 obj <<
+/D [15210 0 R /XYZ 90 718.682 null]
+>> endobj
+14720 0 obj <<
+/D [15210 0 R /XYZ 406.869 654.432 null]
+>> endobj
+15214 0 obj <<
+/D [15210 0 R /XYZ 90 647.792 null]
+>> endobj
+15215 0 obj <<
+/D [15210 0 R /XYZ 90 543.353 null]
+>> endobj
+15216 0 obj <<
+/D [15210 0 R /XYZ 90 441.046 null]
+>> endobj
+14799 0 obj <<
+/D [15210 0 R /XYZ 406.869 364.443 null]
+>> endobj
+15217 0 obj <<
+/D [15210 0 R /XYZ 90 357.803 null]
+>> endobj
+15218 0 obj <<
+/D [15210 0 R /XYZ 90 277.274 null]
+>> endobj
+14800 0 obj <<
+/D [15210 0 R /XYZ 90 242.604 null]
+>> endobj
+15219 0 obj <<
+/D [15210 0 R /XYZ 90 238.12 null]
+>> endobj
+15220 0 obj <<
+/D [15210 0 R /XYZ 90 169.392 null]
+>> endobj
+15221 0 obj <<
+/D [15210 0 R /XYZ 90 115.703 null]
+>> endobj
+14801 0 obj <<
+/D [15210 0 R /XYZ 90 77.486 null]
+>> endobj
+15209 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15230 0 obj <<
+/Length 2191      
+/Filter /FlateDecode
+>>
+stream
+x��Ks�6���<�RU!��÷�d�J6'��e�J�esW�����}|HEI�UMMM� ���?H�
|3�����k����2���$$�7
ޅ\�����LjD�����_��������{�7��?'n��R:x\N����\�.��
|�-N�.����'�т��}i��SF"�V at 0�1��4"�����p�Φ�:�����2�WH�9�Ie�asL'EF���}MD���8���Ŕ���9��
+(���<EL���>�q>�t�r{�3%"\e����q�e
�Y=^�a��2�nXͽ� [�6~�
+������m�<�ȓ	E�'�Q� Dw�@TIӶ�)�`ӊ,�Q�0&mcPL��m��k�;�#f�F�"X5��Z�7eR�׆��sҘ�Ӓ?5���7��
4����H�Y���1}��t�9�V-I��׊)�c�5z'�fdE��Y޺U>���7T"
>4�>��s�A��䱜Vj��έ�M���V]բXǏͽY�L��)$%���t烢2d���i�0	�H��4{r��Crp�ĪMy����(*��#��]�\2�Vk�93�V�^�E [�ܨ2 �
��K�L�$��U���N�w��^��J���x-�h���^�"�	$Hu�*��/zf��$
�<�"!�AT�mN	n��ЈI��b��!R"C�+��/�:��M�_b�_�v�_Mt?�M��bQ�{h�v�q2C�]D"r���Lr�}���G"�6� pXf��7S���d]�U�pF��=a8,N��
+���!���*���
v<
��Z%�J��c
��u���'��x�0+ H�4U�(g�� 

`-^��? ��
+�6�(�񨧸^<<�	�@�о���RG
u�
u��~�?�)ᇊ�H��9�=��u�i�u����P\�k� ��^C�0k.U���"h�+�v��=��
�<R����E��(�P>��&�U��.�i6�>S�W1ȩ�	U��
��pbK�*�[,.�yr3%`tE��mwS��ݔ5�4���r���Ny�n�
��Siւ �CpD2��!�I��A�pD��=v+'
�j
�wv׵Z4��p�
�t*����ˀ
X��x��
�+�n��U�Y
�0pX�4QW���q��&m���ng�e�}�#��T���8�
m�`o�To�
+���5x���.��jx#��雱8T•ײy�cq(���3�� duLv!�12���bH(㍲|z�bV�����:�Y��g��
�,X�$�h2Q#.�e4���W���K�lu�{�I��H�9Bg�T����"�'�����
�s�ǚS�� 
G�h�� �
G�(�Y7�@lJ�e|#��Q��Y,:���Q�Sn����~�|��PJ?2���z��I>
W�jWf�i8R��)����1 at W�^���*���}�]1�D1⓮:&/�+f�2�]�����gҕ��g�KW�O��,�$Ĩ�̽��I�b�\r٧+y.]YsRRt�(MW
�t��DW
�5t娛���T�I�d��@���ѹ�b�zc�	R�E�P�P��(����-}A��?�DA�C�CT�
x(>�ϼ(�5�]�ʨ%(��gm��͊ʨ�
+B�����K���p��1�G?[$s
=��
??�X";{:'X���M�Kl�2jWV�C�Td��b�1�-��$1��� �`�uD�b1��`كJ��I=	�h�H��E:�1Ϊ��
��O����Ma���w+52 �>��3Ը�q��
����ι=m#���9T_[ݜ�_�;��g���I��aP��A)��
؁O܈:��
Ij�Tt��x�#$R�IRF�<)��}}�.֙p� ,�>�12D�Z�X� ,t�;�GǺ��y
#jL��|h�jٙ�Nj"0ǀUqN�TB�M�%�/l�s��Ys@b�P�;#s�{��@$�u�2��U�
�a���#l�N��y�jy��Yi�O�혼r	��Mz�\�����s�L�u<���c1��	=�e��;~��|�C�����Է}�_u�iVH�'���~0Q��T���>�\��vɂ�V`lg.{��`�hR�:|�9h�v�
!����~�_Xi�9��/��?��&n��
���(,��O��Y[ꀵ�
�M�Okjm��J�Ϥ
+�&���kB��,׷77��"ɞD�>��
65I��_��U�]���B�6��s	��7�?�
+endstream
+endobj
+15229 0 obj <<
+/Type /Page
+/Contents 15230 0 R
+/Resources 15228 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15222 0 R
+/Annots [ 15207 0 R 15223 0 R 15224 0 R 15225 0 R 15227 0 R ]
+>> endobj
+15207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.379 685.85 210.103 696.753]
+/A << /S /GoTo /D (index_Cylindrification) >>
+>> endobj
+15223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 582.442 485.603 594.96]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.334 312.202 242.487 323.106]
+/A << /S /GoTo /D (index_Convex_Polyhedral_Difference) >>
+>> endobj
+15225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.275 200.186 293.971 211.09]
+/A << /S /GoTo /D (index_Meet_Preserving_Simplification) >>
+>> endobj
+15227 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15231 0 obj <<
+/D [15229 0 R /XYZ 89 770.89 null]
+>> endobj
+15232 0 obj <<
+/D [15229 0 R /XYZ 90 721.073 null]
+>> endobj
+15233 0 obj <<
+/D [15229 0 R /XYZ 90 660.006 null]
+>> endobj
+15234 0 obj <<
+/D [15229 0 R /XYZ 90 606.317 null]
+>> endobj
+14802 0 obj <<
+/D [15229 0 R /XYZ 90 559.692 null]
+>> endobj
+15235 0 obj <<
+/D [15229 0 R /XYZ 90 555.209 null]
+>> endobj
+15236 0 obj <<
+/D [15229 0 R /XYZ 90 494.301 null]
+>> endobj
+14803 0 obj <<
+/D [15229 0 R /XYZ 90 459.631 null]
+>> endobj
+15237 0 obj <<
+/D [15229 0 R /XYZ 90 455.148 null]
+>> endobj
+15238 0 obj <<
+/D [15229 0 R /XYZ 90 394.24 null]
+>> endobj
+14804 0 obj <<
+/D [15229 0 R /XYZ 90 359.57 null]
+>> endobj
+15239 0 obj <<
+/D [15229 0 R /XYZ 90 355.087 null]
+>> endobj
+15240 0 obj <<
+/D [15229 0 R /XYZ 90 294.179 null]
+>> endobj
+14805 0 obj <<
+/D [15229 0 R /XYZ 90 259.509 null]
+>> endobj
+15241 0 obj <<
+/D [15229 0 R /XYZ 90 255.026 null]
+>> endobj
+15242 0 obj <<
+/D [15229 0 R /XYZ 90 170.208 null]
+>> endobj
+14806 0 obj <<
+/D [15229 0 R /XYZ 90 81.969 null]
+>> endobj
+15243 0 obj <<
+/D [15229 0 R /XYZ 90 77.486 null]
+>> endobj
+15228 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15249 0 obj <<
+/Length 3018      
+/Filter /FlateDecode
+>>
+stream
+x��[Y���~�_����Ҏ�>6N�
�r�Q�6�:/�K�%�]THbMbu�ק{ 1���J�`����uO_K	W����wW���wW/_1p�i�wӁ�#
Q�&�wCF��kF)
ގ
f�y��v�鰜}~�'�����~�-?��t��
���5Wt��,[����i���qt��j(��|��շwW�\1�X�Dc��ջ��`���g���@r�����?�h�D�4�6��a��2"����>��
���
w��mΘ�����u����Y�r���H���ۑ� �c� �m8Wę^8������k;��3b
+6��&��D)_���	!�ж�0D(
qW����������*�ll`ذ��?���q��"���a0c�;��X3�Bd���E
�#�����bU%������wJ5�]��������"�V(��
�2ś)��b٢v�r�$��c�P-�ߔ�߾q�/���%J��v�//�A�`ʓb��eVT���Vp 
$�o.�^�0O�̧��|�mP
+ʩFV�|Q΋EV�K���9��
+����VGb~_.�ٌ�|�lL��e��R��D:������+M�
1A��8�Q����� [,�Ve����wҀ�d�Y�H�,A���X�1܀������7x�P���]
�yf�鈫amR���<Zb=��&�m������Ϋ �ǚ���b\����y��T,
��\Ddd����D˖�00	 @Դ\��G�����p�]���
��ş���|\��$<�����)P��9����E�J2[LR�����Тmz��
K�]���
�����8f�#���<���`�ULq�t��o�K|��h�,���(pį���_�"a�
4��0:�'&LjWӘ������Ay������B>"�0������C5AlG�蟠&���c1~�5�c�OR
+T�Nl�h>���%+� v��wcH*�Q=��o�
u�"�	u0�F$3��Lc��K�-�!�]�Lz]fZ�-����v�����v��_�N I.L��b��U�����~���h-�g�Ad]�OY?-�bW�
l�g�e�O��d��;�< r!
f��
�Y�>��U]�:{�g`苒�@{��vC�B`s(IphϦ�t'�c
�&��0v��O����G��DI���˾���D�?͠�GK!��
p�6�2��M��Y���$������րqBP)�ڕ^U���b1� �lVLރ����^�s
+P���u��
ڽ�P̹0m�,4����"^���D��FBI�����Bdn�s�
#|=�'���?9L�'@#�O������<�8"��Z�D�!���^b�x�e
2) 
+h]�C@Ƶ \n��Ÿ�?eU�:��O
+�C��H��� m�ݏ�6�Y�e���hmO���%��>��XdA��B�l�&a��b�uٯA����4���4���vu����O��j3Wݓ�fZ��H"bd����|A2�A���D"P`��G�&�2q .� @���\γ*��/n���
��-�

}�T��,u,
+	�
�j����ԧ��f�ݶ	���Rvp̭3Н�lO�A©%��cIyt"^����>XP�[m��j�)8�@^�f������(8��E�e�祐�.pజ����|u3
Ex\����vV>0#r|��E�K��*
�ю�+
�л���I��2Xl�"���Ե�Y`�`d2K�D�h���*��ԵRJ�?i8�����HBJoh0/j�
L���?l�����`���P�b$8l
�
��:��Qױ���%� �)T
�d1��i������"�6]�ఠt�œ5".q}4HPU�@f6�v��S��.Y�I��a������
��ذؖA�q[��Ce��:��R�"�X��mw�D4A���A�\�<xN(�0��,���6a�3�����/��8�c��w�>Q Q���"'�/������L�E||���Q9��#@R�Z5�b@���P4�9�����Ϻ�� �.a"
�.
p���
�0觅�p 	�}>)��S���*��%�4eV�B8�y*
L$��N@r^T=f��I
۾�Y���W�!N���߲�?�ï߼�s�EU�\���3�~������@�D��c���}ڍi �z5��<-�-8��p�����t�T�y�_���
܁Ѵ���v���m�0'kzKl���&�������:��m�w$��/��u����@��ts�{�o~�
I
+
����u�9�'�;�'�\&��w�
I�	e����#
��P�3��ƑE>&ˬ��%�φ�NC��~�'�
hn+���7*�}AEqF
���+���~�ݯ�e6����
��[eͷ:��p���|VT�
+g][�{$��pۭ'#!� t���e>�f���G>Ƅ��e���+(?A�\��4s]?I�<����x���u{�v{��2G_��?��
RT43Bl�~o�
D���E	��� �v
���Z�9�!���x�'��9��j�
����
=4�s%�`��1{ ��t0�؎t���'�����7�Ka6�
�������
NFkY��HJ7}G6��1}�M�{#<�����E�=5�Sw\<�ꃇ'A���lG+��vp�7�M'<kz�Y�	Ϻ���NxJ�9�v*8��;y�
�
���N�/�IƬ�Ժ�tE�}dΰF�x��d�6�yJ&�B>�����/�I^=CXPT�Ց���z7L�$c}v-�N1 �a���q�˔�7�_�L}]f�l3����
�
�>k�S
���h*{m�g�׶���
!?idu���i�?_R�!$%���ΧX_7���.�������7z#�/��P���k=?���GJ
��N�xnv��N�7�h����ۼ���
4��~���5;�P"����U�t������*_<�q9ߎK:kq��i�y��U,��=x%Mh�"�I�y#
�/�������o����~���\
�V���;�_y��R
+endstream
+endobj
+15248 0 obj <<
+/Type /Page
+/Contents 15249 0 R
+/Resources 15247 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15222 0 R
+/Annots [ 15226 0 R 15244 0 R 15245 0 R 15246 0 R ]
+>> endobj
+15226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.269 661.939 238.02 672.843]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+15244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.953 437.793 250.388 448.697]
+/A << /S /GoTo /D (index_affine_form_relation) >>
+>> endobj
+15245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.089 184.466 246.767 195.37]
+/A << /S /GoTo /D (index_Single_Update_Affine_Functions) >>
+>> endobj
+15246 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15250 0 obj <<
+/D [15248 0 R /XYZ 89 770.89 null]
+>> endobj
+15251 0 obj <<
+/D [15248 0 R /XYZ 90 634.093 null]
+>> endobj
+15252 0 obj <<
+/D [15248 0 R /XYZ 90 555.697 null]
+>> endobj
+14807 0 obj <<
+/D [15248 0 R /XYZ 90 509.072 null]
+>> endobj
+15253 0 obj <<
+/D [15248 0 R /XYZ 90 504.589 null]
+>> endobj
+15254 0 obj <<
+/D [15248 0 R /XYZ 90 409.947 null]
+>> endobj
+15255 0 obj <<
+/D [15248 0 R /XYZ 90 331.95 null]
+>> endobj
+14808 0 obj <<
+/D [15248 0 R /XYZ 364.289 255.745 null]
+>> endobj
+15256 0 obj <<
+/D [15248 0 R /XYZ 90 249.105 null]
+>> endobj
+15257 0 obj <<
+/D [15248 0 R /XYZ 90 156.62 null]
+>> endobj
+15247 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F11 621 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15266 0 obj <<
+/Length 2839      
+/Filter /FlateDecode
+>>
+stream
+x��\�r�}�W�SBV-a�/J�!q��l���V���r��HbE$�C�^��� �!��E$\����5�!���8���!M�ۂ�^�����_�(
q����p�0���פx7�������4�
+�_����W�_���]�������#Z�(@c���Ż�h1���
+J��ŧ0hVH.p�/�^��ֶ���+�/����,��P*
��TEs^�r]>����2�%rKE��lO5Q��>8�nϠ%�K��b�B[N$��iZpA�T*Õu%��Z�s&	�����,nZB�����0�	��
�ťY�&����P�����t�~\
��>���*�֮��Tb�E�ib2@��SI�6{�ik��:��yuW-�\
>͇#%�`z���R���%��&�&�|1��ǫE�&:
#|3v��XE��P��d:d�>]�jd�~��C��4�O��,�#V�f̏����g�cVw��aeU'2�	K��($�ׂpɋcĩڽ���b�0^M?��5�y���k��
r�卪��޹S����^�|��7�xY>��k�kCkn���(�V���z�)J������3uy������,��7/
�:�߰
P&��Q�
4�r��N�#����k\������hX�r���R��tkS��bV�Ljٛ��������rR�����"�	���z��Bh�����eמ!S������^��
+���p?ٶT(K�d9,���ۆ�oH|^�(�~mu�X%��.�<4�Y�yG��H�C�]7��4����V]��g�8�5
��^b�ΖN�2n���
y�j:��G�����Cy?�����g�n=ҍ"έ_�����Y-8��$ƙf�5��U�z�Ql] ����q����W��
�q[6��ג�[��3��o��ǝ�qB"oıL����/e����)*:�̰� %(.ΌeI��EE��U5�����k�u�Xp��w�TυB�"R�Uy��U9��G��T�Wv�Pb
�س؈gc��G����y�Wo(b�l|���YA�0s�5�%5{gD�)�Q6�T¨�o�	p���-[��jѳKI�sG����>��]�͠2*Eb��o{
ʼn�&��O��]�Z�ˇ�z�vA�ޕ�3=���?|{Q�� 5�m29�xxc|��:�ւcb鬊M�@��`>�
458�3�����������
@۾r���Qd�j|�vYK �a���Tie���
}����4D]��B��q-	�bS���=
�1���obe+Qr*����������r���ZI���1n���8��z5c5��p�l����{���M�7�
���&Ǔ�O
+��dO U��t�F�&��UY�r�@O�(xJ���"�C����/l�K
]�Bۨѩ�-�kH�b{:t��zY(�K�=��+�9
�iF
+Z� �&1㪁�}yS�`w�#���N�O?�|ՔTM#�b>Mr��K�\+,�p���f�Θ�n�@�Ć�{�%F�!�?�:
z����������Y�:�
��Y��#�m�վ�y
TN�p��B"5,'RrK�H	�
+:S���el���
�
5��!��gL?R�Ƭ�2�!׬�Ө�\TMo��d����4@��:t'�v7F �0�u�%�I爦��^=���0xH1�XM�ߩ���<s�a�6'���N�L��5�p� �����xn��Ǩxq�o��X���v�>���-I0*
�Ҵ½2 ��~����k�3��c`~�swb�K�4gx�ħ�_�+��/����z��d���
�8p�]�&G�_-�m��r4���P����3m��Tl�T��d��ؗ��T&x����S`(D%;@���Ե
��
+�ߌ㥦��m�
�S`
+)0���!��Zw��RN���U6
�>T��l��Y°e'�����>*�5 �
�p��!��#^LJw�~�rUM�W���#)�ӓ��
��4/�x�̃�����D�S�ۜ"u�8E�{g�;�ST�kˎ�}�g0�s�̙Ԅ���A�sX*�x2=�t?��뉝���#9ь��+6�xE�=4~��*^Qx�g��(͟�+fP����0��
��+
+B��Qi�P۷yE�4��������/.e3!��^�Z�����E? 9u��#�(�0�h
�.#����c�E�X>�Z�5"�^jBٙ�b#
+��=�\D���3��u���
+:��Rv���[K8�Y�E�P�?�[<ӊރӖ_/�x��w�ċ�,'��]bD�񑝕Z��!{�D-�gM? �֜O-�l��u�D�sR��%F���Q4/�ȱ�Rw�x�1�Hi�UQ���v7F RМ�bv�u"
od����@�j�<s�a�6�7M-���ݘ�ͱ�Y��.�iԢg�����"܋�!/��d��g��R�-��P��/��G-�iC-v�z"����Z|�����7j���{G�H��R�g�<H-2�m���(��E��!jQ"�'� �Lj1lYmˎ���9L��"U&5!/�h,�a�_�g����E��ʡ�ĤJ5����L�G�ѝ\�=z��r4;�=@�1��
+�$�����8H!�
���a�>��|�̫�eme�
��p��2ݟ�I���p���]
�A���W��
��~�Tv�u��_�E���_�I�9����5>��p�xBg�>�����]jl]��p3�V�nc+m�����3
���		�b�5�ݜ�H�w��v���������cz�������"�)?c?��
>l߇�w�/�6�_�7���F`�� �k-��
*\����7��Ϳ�e���R�����ǵw}���wò��_������<d$
�-�؈��wm��/�j�lB�(7%��j�p��Ň��e9�%�
���e�+jֱq�
f�U=��
g*[
�?L�v
+endstream
+endobj
+15265 0 obj <<
+/Type /Page
+/Contents 15266 0 R
+/Resources 15264 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15222 0 R
+/Annots [ 15258 0 R 15259 0 R 15272 0 R 15260 0 R 15261 0 R 15276 0 R 15262 0 R 15263 0 R ]
+>> endobj
+15258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.899 599.5 431.977 612.417]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+15259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [523.983 434.397 535.938 445.301]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 421.012 261.145 433.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.307 339.09 434.874 352.007]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+15261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [523.983 173.987 535.938 184.891]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 160.602 261.145 172.935]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.631 91.71 429.297 104.189]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+15263 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15267 0 obj <<
+/D [15265 0 R /XYZ 89 770.89 null]
+>> endobj
+15268 0 obj <<
+/D [15265 0 R /XYZ 90 718.682 null]
+>> endobj
+14809 0 obj <<
+/D [15265 0 R /XYZ 90 672.057 null]
+>> endobj
+15269 0 obj <<
+/D [15265 0 R /XYZ 90 667.574 null]
+>> endobj
+15270 0 obj <<
+/D [15265 0 R /XYZ 90 572.932 null]
+>> endobj
+15271 0 obj <<
+/D [15265 0 R /XYZ 90 470.227 null]
+>> endobj
+14810 0 obj <<
+/D [15265 0 R /XYZ 90 411.647 null]
+>> endobj
+15273 0 obj <<
+/D [15265 0 R /XYZ 90 407.164 null]
+>> endobj
+15274 0 obj <<
+/D [15265 0 R /XYZ 90 312.522 null]
+>> endobj
+15275 0 obj <<
+/D [15265 0 R /XYZ 90 209.817 null]
+>> endobj
+14811 0 obj <<
+/D [15265 0 R /XYZ 90 151.033 null]
+>> endobj
+15277 0 obj <<
+/D [15265 0 R /XYZ 90 146.55 null]
+>> endobj
+15264 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F11 621 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15286 0 obj <<
+/Length 2950      
+/Filter /FlateDecode
+>>
+stream
+x��\[s۸~���S+�D� ��C���t7��&i_�
mѶ��x)�����"�"eID��Ƀh:8�p.ߡBG�#:����.^o�(!��z��n�Б�	Q�Fnj�'SF)
_M
��2���p:^/�<d�<�~;������e�����z5�rE�o�fS\���2�,[�f�+�Vci��/~����ů
��+4Q�������/t4��G��Ď>�Aˑ�������/hiT�I�r��45a
SmB(�#�Ida-
��0]f[�%o�^{�;g�Z<t��,��`�Z�I�m
�_U aI2҉&��CR1��D���b�ec���DJE)�	/�{�P.p�R1�qs�
�6�К$��LJ����"��W�jV\m��iz7�j��R�*�d�ƿ=��f3_��r��4a���|'RИp�.�����)O�k9db�-�1�3��/ˣ`5L�NX�԰ʳE��W��ݬǁ�l�����)
,�%`1���Fr>�	�|����G:�azt����%���އ
�����~�Tذ��:[�i�_
C�d�6|��m���
1���f���>ɲ'�I|��1������q�YK*�'kKt_kH���$
񮐑g���G�qB�@5gD'�؛�vvy9_M$
?����:����i����aϩ$���v����
�Z����ӄ {
����!��H!���q�������B�7�D1ƨ��XV��>�7ŘP�"��� 
�S��XS�N����z���u���3=�<�>tL� Maj�ʤn�\�d�1�K#�I�����u�P��X
��
��n�!"�/���T�%���_{s}UVFH�f���p���L-j��:�ii(,V.�J/�� �|~��OD^�"!Bp�.
�(9,�t79D������j���Q���
�s���j�e�_�2$L
��g�Ae9�Ԫ�+Ŭ&
4���:��E����n�X
8���4((��Ԏ=-�㲖�����=�VY������+*�Aa�b(*4%Z�4M�ʌjf�I���K��pf�ms�a��^��Ut2Uڌo��lK��dh�\"�u�{y;_ei~�
�AϮ����v��@UZ��?#��!�bMg��C	f��՘w�S�~��I�L��
+
��W
�	S�ھ%��Z�ײ��?�y3pjT
�y�/OE�� �M�Ѳ,�T�_9'�s�]w���lj\���dŔ���_l�Zib+���*����$(�(V�!�
�����Wd�������n�
�K}B��Vr1���
�8r3�*�PZ�!J!��Ѵ1�L��_cm��Ps8�aq���+g2��,�:����/L
+�(�D;C�
"(�Y�,+�ћ/��F�_NR��4��UV{[gnʬD~�C����7�j�C�c���%�BN�Eb2*Y+���d'�����K=�%Y{�1���(=�b�)��Of�d�D
���3�ځ�tê��p��|����u�E�
+��
���h��d��H���ځzt����7%kϷ��!RRPgK<�����BE�j%JjxT�+����|�a�D��!q W+i�[���ڈvV\m�������s�<�V�A�ڳP�Ks������"W+4�d��U�\m«br��}t�0�KԉJ�
+lL��Qt�����爧��*
��ެ�V�N�V)E�N(�:�C�p�Y�QfF1 q'��E�*��ݧ$���T�g��i>O�;� �ܕ
+&$o���s�M�]�(s'A
A�*#N�Fq2v<]7�m=bq�Q
0m�R��:�'�V���d���V	t��t���.��
�Ա@ҽm��(
$%�)��-B!�&[��7����y����"�Ł���t~~TyQ�z�e������ޯ�'�����9�(s��9}���g�
�cW�[��Y�Z/�t�����
S��iO����U֑9hE�j���V���
+j�&{|�%�R_���������d��%ٌI��U���p�"u��)��(�k?@�~pKq����U��[�=
��
L�����ڵ�jzR��n�&z�lץ��pF�^�̝�}g�r�	2�σ�t=I
��l;Q������'�A�q]
GdU��\vvE��?O�v��
#|�EY؎	�V���ߍ���4h*�KUSTuF5=vk#,�ö!��	�
+[.�](%�K�y�&��1�kV��)-dt�0��`Z�[.\ccbrT�z6�+���H��$w��İr{�����9P�N�3У�<��ϫ�Z��q�n�����O�VN�(>�|�����}1ߔ�.�����a�xl�
[�=u^Y%Uܹ�\�Qy��06L�n�5��1�zZfy�`�O$!�閕�}P���#��η�$�(�"�.��vȶ%���=��
��	�u�=
v���]S��a����5!w��� �H�E�\l��%���Tv ����p����7D�n�5�)�f���n���z�8��_X\b�]uQVN"p~�_�
qQ�C�t#Ze�h�s�Sg�8u+sz�E�|(�$I���wʚ
+W3���O�m3YX<���9C��z����0��=����d��S%��<
4�QQ��� ӻ&�����lH
��d�b�L��gD;��g���Z���͖'׺n��
G!����U["i�
��߳�q2���a�D�g�u2�Y�Y�~

�u�y�!��Jv
n�DF�
�լ��aoS�"�Y����Eߦy�`���>�)S��ud½xZ
�i��˕\�����6l_>��mu�je�����4zP�����$=���;AH�/�
+�d�:Df�\��ű��B�%�{A�}V��L��WWo��o�����%b�����t�
�g��d�(�0$'���)���"f
��;��~��P٩�
`jk��a�}�|����~���	N�>]ްQw�f�]uf����W�������T8�Z�j5���b�)3��ĿƵX}�����K1����sk��-�
+endstream
+endobj
+15285 0 obj <<
+/Type /Page
+/Contents 15286 0 R
+/Resources 15284 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15222 0 R
+/Annots [ 15278 0 R 15279 0 R 15280 0 R 15281 0 R 15283 0 R ]
+>> endobj
+15278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 605.157 267.79 617.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.883 536.469 440.282 548.948]
+/A << /S /GoTo /D (index_Generalized_Affine_Relations) >>
+>> endobj
+15280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 392.967 267.79 405.3]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1C__Polyhedron) >>
+>> endobj
+15281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.059 311.044 422.924 325.76]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+15283 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15287 0 obj <<
+/D [15285 0 R /XYZ 89 770.89 null]
+>> endobj
+15288 0 obj <<
+/D [15285 0 R /XYZ 90 720.814 null]
+>> endobj
+15289 0 obj <<
+/D [15285 0 R /XYZ 90 642.418 null]
+>> endobj
+14812 0 obj <<
+/D [15285 0 R /XYZ 90 595.792 null]
+>> endobj
+15290 0 obj <<
+/D [15285 0 R /XYZ 90 591.309 null]
+>> endobj
+15291 0 obj <<
+/D [15285 0 R /XYZ 90 508.623 null]
+>> endobj
+15292 0 obj <<
+/D [15285 0 R /XYZ 90 430.227 null]
+>> endobj
+14813 0 obj <<
+/D [15285 0 R /XYZ 90 383.602 null]
+>> endobj
+15293 0 obj <<
+/D [15285 0 R /XYZ 90 379.118 null]
+>> endobj
+15294 0 obj <<
+/D [15285 0 R /XYZ 90 281.435 null]
+>> endobj
+15295 0 obj <<
+/D [15285 0 R /XYZ 90 178.729 null]
+>> endobj
+14882 0 obj <<
+/D [15285 0 R /XYZ 90 81.969 null]
+>> endobj
+15296 0 obj <<
+/D [15285 0 R /XYZ 90 77.486 null]
+>> endobj
+15284 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R /F8 802 0 R /F13 835 0 R /F11 621 0 R /F7 803 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15304 0 obj <<
+/Length 3870      
+/Filter /FlateDecode
+>>
+stream
+x��\[s�~���S+�DX����$�d���6�&I�C[��V&�������!A�l1���/ ��.S���~B����[�~~u��K#&	I4ד��IB'F&DixZL~�ʄ�~��f"�%,��{����]����#�]�����A�0O@c'�?�J'
x�

,;yr�
&�
��&/�qA�
G	��1˜�Qb9D�ٜQJ��3.�e��͹����V�>g�
+�8j�&���$�I��>O�j¥�0|Z�f�M��٢�p��"	��-I�
+8�6���j6�����]vfLM������l�Ϝ��P6o �$I�[z�
���"��N�F�("�
^WYh0�{\�̣��
�w�+ a{Z��8K8@)OoV��̘
�J�p&'s.Q�p���L��'��9x�d7�mY�M�.�2���m^diu���5�"̡���|Kλ����m�
��D�pi8�:I�P�ƭ"ZG�u�!q&���>i���@��Ia���(
$%%���-�\P��d!�(3w�n�hb���m
�x��pȔ#���M��M}y����'������P�i1
����tgUV�F�� Ai��Ȋ�!/ҦA	Bt�i]ʂ����.�uY�����_hE��q�������D&v��u��/5
�4
#�5�����>|�5�O�)�(\�@Wz;
+�%�K�r��k�'` �5�N��
�{��L˻
Zý�;��~Ş�f�y��z��6�X�ˬ]O^u�"�.&?����s�ӻW�V1��*[�M+<�2�$FX��ƀO�w)�P�:���4��-�n'?h�-ڮl�~_�p
+z�%ʊ�� �%Ó3
mK�_f�0D at d�����E.}��c(���>ΔF��O�.��IX��Yk\�Ȩ
+�#�o{mG
Nh.) 4�<!
t�@`�l�%��mH��H@|)A����BGI�͈oB�~)�[�~H ��x��h�P��,1���
��!k�
+��:$�{��
�V߈m�^�f���1
u48�,EXP�T#�1��۫ڐ�WOC�2�.o4�	��
~���b1���|�a0�M�Ǖ���yL�7lݛ�z�6N*��ͳ�6]�
1	o:1����@�;� ��[cSt�R	�J֎�-8�V�	����:C���[/`�L~�
��1Vl
�����L�S�1����N-���!�uF�7�O����z$H��dD؍N���8*�H�'��Bg��NϾv���ݐ��a�Y��HȽy�����?"�Ʀ�!�
1\�:`9��8j�7�� \�M�w;q�
��ҹz���CY8_މ
:�u7
��e(��}Z,�M�O�2�'��	�!>�-;�z�B�4���NW-�]��
K��7�_w
�t٬����ڴ��D�I�᭛p�
+�/cڔo�5��#6!�ʉ��N�V���6[7n׎��'X�n�a�c��x�}Ś�O����x���x`pe��E��I©jiT��a(��D���\������e^�$ ?]�k8+�tg�(�9g��1�	���݉
+fȢ�
C(|d��jYyT���z����3
�Y
���{���
��'����Ќ6S'��d���<�}wX&zg�0�$B�e�l#�)�6�"�96Q$�G'`�)!�傸��qӪ���
Іb}��]��l��Zg�Dב	A���
�ilʜ�e�Sh:���O��^�����V���0p5�c�

�i�8�hD�=C�
�2�
�|T�z���R%D3��&5�iRn��I9��̑����*P` $!g'�I�
`�T�
NJ�6 �H��c0qƄ`N��e�t]�F��QvDh�
�M]:���%F�R郙7�R�^@/�\�Kg�Ѵ��L��nL���9B�(�OO�$�hX�i��i0�at!
�&.lV�Vu皢x�4�z<��
 ��R�%h�o��)ˊ��N@��12��z=�!M�1;P��{�����`e�f-M��[��8�V�*�ǧ�,j�j��7
���C��%r�M-E45���cδ3�w���G�����V��H
�
(f��oN"��[��7A�r]����#h�J=�b{��
<e�+>�/|�M6�Tu2�7��ɦ�K�m�G�(vnee:��D�M�QX@�M�N2ڞ�t
1���ʎ��!M�Zo?�&y�I1q�~Lok��5f��Ǭ��>h�m=��Ӡܣ�@�E�?�p�J
H�����F\]4�}V]_͌�>���Ю��260�ѦAO(�cc2�=D_
rp����
C_��7��`��+2��ڝ(,]�ډ����Y���ۧ��R���Q+�E~p�;����A��Ҽh�?>�M�Q
p̭���#�Ѐ��
���������
;��
�����eWs��ç1u$���Ml�?�
c�k@��_��h
+��*:j�����s�T΀�#8���g����D8ZHk�9��r�
���
��@�s:�N��Y���f�L2�މKP8l`�&�,	����K���1_l��
+7����(�Ѷ�6�&�Ր�<��}�j���^#L�?���O�6u����;,H�1GӕR�R} ����n���
����$�n�
+����‡���A�WfcF��$�,�/�N��a`Y0��.�"(f}Q���<��hj2`�υ�Y3��
)� a�J�]��7���]��˜{9H����� �ǎ��Mێg�-NJ(�}�#H��<"�Ǧ�1,�����uň�@����r;�g1��	])�}v�&�j'2�Uӵ���
+�S���5w����w;8�ވ=lB5
�t��&���_�ٷ��a�E�옐
���,M��v
Ȃڇ���d�3�OA�Y<�;���Z�u�X��;-�S�p�R��A�9�
��9��ݮ�5m};\
r�VӍ
�W�3��7I۷��a�EIǬ���C.��8��&
ؤ���.�)�=��8l�,x�
+	� ������m7�2�P�c�S�<�EWƄ]zD�C�h��
w��Z���=$:@t���
�ፋz}HoL�wdz
˔���Y[g��̠*����$D��H�#ʺ�oV�<j5-6Xp�.�m����L�嶏���ڇ^��Ӳ�3�հb�n	�@�'� w
+�1/"^��֥�e'>̅�ӯc	���Pc���)��n��	����|�Y�h+
+�6���X�V�X�3f��^3�O�\"�*�=	�#�\���Őp�璉�Oˬ�(�9�
��iK�)�C�$i���#. � ������.����7��,��u7�-
+���_�T�Ǫ,�(
#2�3�q?n�rz�I���m�4�2���
^;Tc�2�]��(�����W묺+��j ��Ǽp���U��&�1�"���m�3yZc
�]+�:�F7m�+�\lZ
+�q��l���M�#�
1@�+<W-
+�D�.�C�3f�c
o=k :Zg�a|�=�����{0�=`�]]j��=�����ӴmG=�ׇ�j� '�y�u��E���~��&�
�!�{��k���˶�%�}��[�<�Up��N����!9��.��߬5kY�\�kD�=6E��A�%t��z
�I‰�6��8�]��qL��=Q��m��E�Q5?����u�C��
�x�{ă!Xr��;n��l��x$��M/�$�N�����/���sw,qԼc�7H�)��寫��j����N:"o]�p��
|sI|��:N
��1�a͌qj>�
X�̸�� ������}���1�k	Ķ��@o�%�!�Ҵ�HSD����	�>|�o�Yg՟g
+�D�����t?���o�h����0�K�1ؠӏY�H�ۿ{��v��'C���-�f}�����
��{�w�n�q���؋�.�൐��h8�� a���
+endstream
+endobj
+15303 0 obj <<
+/Type /Page
+/Contents 15304 0 R
+/Resources 15302 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15222 0 R
+/Annots [ 15282 0 R 15297 0 R 15298 0 R 15299 0 R 15300 0 R 15301 0 R ]
+>> endobj
+15282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.333 660.661 425.662 675.376]
+/A << /S /GoTo /D (index_Single_Update_Bounded_Affine_Relations) >>
+>> endobj
+15297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 434.352 322.446 445.256]
+/A << /S /GoTo /D (index_Time_Elapse_Operator) >>
+>> endobj
+15298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 298.426 116.998 309.33]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+15299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 257.23 243.45 271.178]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.883 89.295 361.886 101.813]
+/A << /S /GoTo /D (index_Wrapping_Operator) >>
+>> endobj
+15301 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15305 0 obj <<
+/D [15303 0 R /XYZ 89 770.89 null]
+>> endobj
+15306 0 obj <<
+/D [15303 0 R /XYZ 90 631.051 null]
+>> endobj
+15307 0 obj <<
+/D [15303 0 R /XYZ 90 528.345 null]
+>> endobj
+14883 0 obj <<
+/D [15303 0 R /XYZ 90 481.72 null]
+>> endobj
+15308 0 obj <<
+/D [15303 0 R /XYZ 90 477.237 null]
+>> endobj
+15309 0 obj <<
+/D [15303 0 R /XYZ 90 416.329 null]
+>> endobj
+14884 0 obj <<
+/D [15303 0 R /XYZ 90 381.659 null]
+>> endobj
+15310 0 obj <<
+/D [15303 0 R /XYZ 90 377.176 null]
+>> endobj
+15311 0 obj <<
+/D [15303 0 R /XYZ 90 282.535 null]
+>> endobj
+15302 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F7 803 0 R /F8 802 0 R /F13 835 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15317 0 obj <<
+/Length 2668      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s۸~���S+�D� ��C6ͦ��n���t��xh��8+�
+I���@�E�9ݗ��



�����<�����n�^�X�PR�>!���k|
�4
O�xt3&x���fL�([>/�Y
�}H��(��n�
=���
+<z����5?���_�Nc�˸#
������^}�"���D ������
����F,����
+8e�\���q��Ia$L
���#1
�'��	�@j��>�8�
��#Ӛ>�-�"�I�0E�Sg�'0�E뻉�P0!�kx�j��t�<&�M�\>[;���lJ$���h�D[c)QH��q�ob����%n��i�A�S��>�r��,Y�i�di�~�l����}��)���ؾ�v�c*F��m�_��E���E���!�ҵ��,�j�$u��f�p��4�L;�����?�ŘNp_�0��?eV=�tLc���Q�~f���ibf	z������V;c��Ø
Hl$S'��&.H�st�y E!gn]�}���Һ�5bW��;�l�$#�ث�͈��
/��J� �<�<IW���%Ѿ'
Q,*y
<�OY�"�@
+�[���]_Cxq<z����.��L��{}�b�4fC�f�C�e�#"՞���
�J�7��E�����Djr�M{�m!�ʺ�z�:���Q�BM�>��nݓ>F�4���
�d�I�N��:*��e���������H��������,U�W��l��{��$�*<e����c&js3#�`�\r�;f�=n"���,���Y��_��O�0���g�C���
���|�~����Kd� ]���U
�"�xX!��1�,��,n�_�n�L��+�'#���B��a��RD�A}�4�3
+�xL�ȁ�m(8
��!T�� 	����x�G���
����Uk��
WWt�cH���3`�gP�"v�Q�F�	������ԾaU
+�ug�$-�Y��[�s(S���c
5J�c�3�p�`0r����oB%D#%~�}
yuK��;��쇄�֗
+t�
+[':��q'�dQ�G� �����Ͽܽ��O7�����_\w?�C��xɸ��7�(m���$]&i�Ń���;� ��fР;�
+۬(����>�/�8-zꀂ���:@�=���W#��l��L�����xD��M����V���~^��i��$S +{I�cmH�I�-+
+Im�H#�W�ē���p
+&P�4����%Z<.��:�Ϫp:H��� �3�I����bLG��
U����J�5�]EߒU��ݬ�-��-�
-�Y.���wSij������Н�y���-�42̡�
��9+��@�.�����!aV�ּ��9в&�-�Zޤ��J����a��՝o @��_���͎�n˘%�����1xY�ª
+&��Q{yGs�l
+��#]���[M<� ���]ܽ/!2�<c�@P��z�ŝT�C��$N�:�N����)���w�!T��\�*
�;��C�g�'�Wo7�d�,���L���;p'P5ATA�f�A�Nnw=�c^�1s�T 
,��!�Ӣ܅A���&��!�8J"`��ݧ�쁇��M�*���S5a��hjjd��xգ	�qV�>KFv�`E�Q0��L�F��e`� 
�
%�n�(N��
��T����� �`�W/�����5��0�o|
�Vh�n�ax�Bî�CV��m���hZ	n
J���C�u�A-�Y:k�z���<[Q}ʾ�)x=��}5\��p�1����%�jˈ��
�qH8��²ִ��$\�y?N�L�^���rS3~Ϋ�0����$���e��4 (��5
����k$����H�v��>�%�;��~F�F��H���v��ހ&�֡%:o�i2,�d���\ry�J�^�V��"��Ol�S�HIؐnv����%P-(spK�n9
�$�ܒ
8� L))A!u陆@
+��%�iܒ�AT0ܒw48�Z~�׏�q �C�8C*�C��8�T-|垒Y�(�=�Y8��fa��Gb��S��kq�wr-a����suk�}���!��E^ ��X�ѫ
Aɟ@���&5�dz��V�%�缵C� ��V����@!L�ŽD
	ڥY;Y�0
�!���Q��������KH_.M*ܔ/LeQgw����ԏ﯂϶�����Ե�.�q��i�)��P�aak�Q:�[T�J��޶�FJ�î̶���w:
!
+���!�K���pxu"��
+	ɺ>y8
+�^�D/D��xS��dY�q��
]
�Dx���M��}�v�R�편մ��
��0��t���x��1��|C�vK
+�!!�������G�
e�(�
'��u��_�E����xc<[	
γ�r1�e7��v���rLF�kFU麗�_�]��(����뿦�nV��P[��]d ��,_��of�%��U�+���vw�@2,�:+_Դ!Z���Ǘ���u��[��T�Y��j�Oi�u}�����

��J�C����g��R�
{ݿ�bs!
Tp�¸����^�����g�

pB���(��{
ƍ
��͎�{	xw��ڭل�J�kOq��ԭ����/���
o\�������ͼ��9 �
)[s	��)�눫���)�\E&4QM52P*k�A�^�k�JQۣݶ��?�^��ał�d`��/��mN
+endstream
+endobj
+15316 0 obj <<
+/Type /Page
+/Contents 15317 0 R
+/Resources 15315 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15326 0 R
+/Annots [ 15312 0 R 15313 0 R 15314 0 R ]
+>> endobj
+15312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 180.371 353.45 191.275]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+15313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 114.867 362.353 127.2]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+15314 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15318 0 obj <<
+/D [15316 0 R /XYZ 89 770.89 null]
+>> endobj
+15319 0 obj <<
+/D [15316 0 R /XYZ 90 657.82 null]
+>> endobj
+14885 0 obj <<
+/D [15316 0 R /XYZ 90 611.195 null]
+>> endobj
+15320 0 obj <<
+/D [15316 0 R /XYZ 90 606.711 null]
+>> endobj
+15321 0 obj <<
+/D [15316 0 R /XYZ 90 535.98 null]
+>> endobj
+14886 0 obj <<
+/D [15316 0 R /XYZ 90 447.397 null]
+>> endobj
+15322 0 obj <<
+/D [15316 0 R /XYZ 90 442.914 null]
+>> endobj
+15323 0 obj <<
+/D [15316 0 R /XYZ 90 350.43 null]
+>> endobj
+14887 0 obj <<
+/D [15316 0 R /XYZ 90 237.538 null]
+>> endobj
+15324 0 obj <<
+/D [15316 0 R /XYZ 90 233.055 null]
+>> endobj
+15325 0 obj <<
+/D [15316 0 R /XYZ 90 164.481 null]
+>> endobj
+15315 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F75 562 0 R /F60 540 0 R /F91 766 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15338 0 obj <<
+/Length 2471      
+/Filter /FlateDecode
+>>
+stream
+x��[[s��~��S
΄��_�郓:I�4uc��N����		� hE��g� �%^׵;Ջ@�����=�K
=D8�n�����[�"���2���
�7HH�o�����_o~��Ԉ	OU����O7��yk���}�
+G�	H��n>z�+��p��#ft�T
�G�2�΢���p���"*�G{��A�
˜G�0��pp^�~�.�l��*@;"w�p3�	v�c�U{�W
�w5���2a3L$
G
�o�\M�bK,�+�i�눬��(�r-�H����9��9�P����ۜU9����1���d�M�'Ř��a=O�����~P�a�YPEA
0 ��)c
��i*qGS�
��S��X������
+
g�V��oiw�8EL�Ə~���AJt!��1�c�rc| q�J�i�
"�V���#E#^Y�R�y�X.f���I��-�ˤ�ng�W��]�l�
+\����`���p}̊$��ۋd�bV�!�UKO0�`&��1�ʘ�x�M�j���%�<�
��3R�8��
j�B�E��%�>�7cF��lLH���N�
�
+$)�R�$a>�����D�����x�Dċ��z�ͳ2��cL#!tt�$���}����v^�5�bȐ Ô����M��^	�jb��.nW$��ARiB�Zeu��
<�L�;��e
���ń0H4�]��/
+QeV漏�
[�
��h���B�Ɉ4�P�q�U� �3�V1C@)GX������$���o�We:������w���׌X�vi�iO
+����n
+��SzX�C��IT��K
+�
v<�ht3� ^���Q&��b�]���{�Ue)+@�(����ȑ����H'FI;�3u��j=+��Ž��ĵ.����c�f�y��ڋ~�n��,v1fLb�����
l�z�Ʒi���y�ʔ��q
���
(`�́b@���֫cׅB�T]„I ��<���lx�<e�4��W��˴HJ�,���_�{it�,'��@�Y�F�(�yZ��
�:O�)}x`�Z{�
����Fp�U� E��3J���^�g
)�
3^(�G\���Qf���x�2в�"�:#��I
�=-�S]��|ݤ ߡb�
t[��0JHi]�e}N-��4D
��C3�O
+k����<l� �1��CKtf.��X9��
+vK�N*���}��_���λ(n
kC\�B�E���8�:e�n�W��B�u;_B�
+9���4{��*D7�l��8�;W�a;�J|-/�DgyL@�M���|�p|��(�qh����˻E��uQ��1UA�U�l����\����P2.�.Z��I=�-b��>Zr$)�đ	pgI��2DS��8_�o��R��l��d���r�ۘ�8u����W]�r^�ф�S<=�u�H��ٳ�Q��p���I;�)+/k��9�t�<�ӻ�<��Nm-��r�s�w�@�T4�{�-�4�ZL$	��rKJ����'�Y
�`��3���0H�v$v�_'�hޗk��#~���[�6�ﰢ}���g��U����� �^�*����#����#
�
���,B���(�CB
�P�u�c�� wl��ܱ�c�5��ش�Ϡ�϶�a����1��Ye�RBo��l�U���
M��f���T�J���$���ʂmA8�T�]��i/��%���@�`�%#>�AR��sjk�V�B�I荂���i��>��P�t�2�r�PfP
+�}���DŽ2�|�P��3,D�U�|B�N��L��M��:�r�k_+a�k�K5� �\=1�&��L�̓U� ��&{�djx�L>�&�B�{��B�''���@f��
Xp�U���FL�2��k?�A�D/��x��
�p�B�%�$�Z
=�Dg�P��PoJj�A�c_F��!_��Ի0�\�|ՇM�gA�_���RT�d��qڼ98�E�
E��uQ��ȟ�E>{{��$
+���u���Xd�Tu�14�L�uh�1�2��c;�I@�#��J�c��ٰ�[���"{z���_�|��
�/��AӰ1��Yd
+�+�w�-��{Xdq�l2���4��M���Ev,��h�,��(�{ez�\���0!�1�k�G��3CmFD�5�����d�⊆�5�ǂ����c�[���lC�
��fke�u^��)%p+B�����zO�R�œ���$�m	ۓ�^��9y{L�

�~���v;��_�@�
8����c �|���C"$]\bU��ͨ�t%�o��)t� zi�
]�:��z�,��	y�;�Dg蠖>�Ԟ��H�I�/�o�
/|�g����aW �2軀�%�W��)ʎ��w�	�� +&J�����������_�,���m�M@�d#�q
�ur�*qC�I}V�͛݇�����h]��=�ו
�?�s�}a;hw� �,R��c���ަ�Q:l����6��{�ˆ붖},�������a��ʽ��u�1��K�o~c<_4?H�r�9�^��%X� ��
+endstream
+endobj
+15337 0 obj <<
+/Type /Page
+/Contents 15338 0 R
+/Resources 15336 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15326 0 R
+/Annots [ 15327 0 R 15328 0 R 15342 0 R 15329 0 R 15330 0 R 15331 0 R 15332 0 R 15333 0 R 15334 0 R 15335 0 R ]
+>> endobj
+15327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.29 624.689 361.65 635.593]
+/A << /S /GoTo /D (index_limited_extrapolation) >>
+>> endobj
+15328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.848 624.689 513.996 635.593]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+15342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 612.733 154.089 623.637]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+15329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 534.875 362.353 547.209]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+15330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.644 400.543 376.001 411.447]
+/A << /S /GoTo /D (index_bounded_extrapolation) >>
+>> endobj
+15331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 388.587 167.927 399.491]
+/A << /S /GoTo /D (index_BHRZ03_widening) >>
+>> endobj
+15332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 310.729 362.353 323.063]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+15333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.526 176.397 335.736 187.301]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+15334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 110.892 362.353 123.226]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+15335 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15339 0 obj <<
+/D [15337 0 R /XYZ 89 770.89 null]
+>> endobj
+15340 0 obj <<
+/D [15337 0 R /XYZ 90 718.682 null]
+>> endobj
+14888 0 obj <<
+/D [15337 0 R /XYZ 90 684.012 null]
+>> endobj
+15341 0 obj <<
+/D [15337 0 R /XYZ 90 679.529 null]
+>> endobj
+15343 0 obj <<
+/D [15337 0 R /XYZ 90 596.843 null]
+>> endobj
+15344 0 obj <<
+/D [15337 0 R /XYZ 90 506.491 null]
+>> endobj
+14889 0 obj <<
+/D [15337 0 R /XYZ 90 459.866 null]
+>> endobj
+15345 0 obj <<
+/D [15337 0 R /XYZ 90 455.383 null]
+>> endobj
+15346 0 obj <<
+/D [15337 0 R /XYZ 90 372.697 null]
+>> endobj
+15347 0 obj <<
+/D [15337 0 R /XYZ 90 282.345 null]
+>> endobj
+14890 0 obj <<
+/D [15337 0 R /XYZ 90 235.72 null]
+>> endobj
+15348 0 obj <<
+/D [15337 0 R /XYZ 90 231.237 null]
+>> endobj
+15349 0 obj <<
+/D [15337 0 R /XYZ 90 160.506 null]
+>> endobj
+15336 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15360 0 obj <<
+/Length 2701      
+/Filter /FlateDecode
+>>
+stream
+x��[[s�~���SC�DX��Ӈm��I�7�<m2
Z�mN$J+Q����@REJ��m2�}�H<8���#���G�_�����w�E	J$���C��H�		g��}L0�t2%��fBp�n���̈́�x�xy�����~�n^��ۗ'Dǫb2���,���
��=d�Y1�@.�R�<a��n�������pD�&)
͖W���
.�a�
=�AˈS������peT�0��25!-Su�0�"
i,���~�e�2_[�Ёȃ)�
f��D����ەև��~n��$I$���\MP"DG,�_�i�k���	GV��ɢ���9��9�P����ۜm9��΋	���t����̈́��q�̊����~P�a�YPC�
 �Z�GD�c�Jܲ��Q�z��YM���+���uo����1it����1s��hB�nƔO�֍����fPZ�{���R���
)q�:'d�9���z�X=�L�b�Z��2�_T�Zm��<��ۂ�yc���,�/�D�~{���Q�H [...]
+�j��
=\��Lul���τ�X�׋|����P;�@$a!�c� ebG[���gR��a&��"ՙ43�*7)8jj2ߡ
+��b�B��	�L.}�8�
��_�������A.�PԮP�TA�ߟV~]���z�
��h��_�B�ƈL�qN���
A�dB֣��
V�����I�{��-�e�Xp at s4Z�ٶW9����,m6�� f��a����	�$�5l����2�Bx�;
X4��O��ꤓ)����`B �rw��H��$��җ!�J���en�M��-Js
���]3IkW��c��u���<VN���W�{;��/VHf�΁�ՋR�q���YV�K�� �<\$'���D���5�&�M��wɐ�r�]D��<+�����_g���jB��U��:;h�b�@�"P����I��2+M�B�]�'�5�8
��Dg#_a�h��(��Q^�T�
Z�H(
h
B�
E ߈Ku��I�D	�Om%޺2t]%��g-��*�{V(^e8{�rWG~ߗb�t_��'J������g ?�t�;�S�� �����(�����<
Jɘ	��
̡0":
ʡ�W�[„1��<=
+�iя��O���p��gU�TD�n[��r
m)����O���Bm��o�;�8�k�0NDbs^@䅖��4���ΗO�W��2P�@&gM�6yiя��oMLU�]Yj-]���
+Ж@ɸ��x��jtS�ڳ��I7y������*
8q8��b����Zpõ�4N@��
(W�F3�%�����`��]�!|��OY�(��z�RU:�T����LuV>�^�(�S�̳E�R
�fOE�a���r�s�w�@��N2�{�-�ul��Iƒ���Q,,��dڠ���q��doKb��u2Fs�\
�VI0�7��5��1��z�
�z=;�\��V���P��M^�*���Ãv��c-
a��9��>�_-��H�&$A�	�/V����Ϳ
_�<��5��+ ���T��h�_���.�y�I�LA�;L�<d��>�$cέ�D�K�d̘��X&Q�0�2��
+����ծ��2�\"���1�ph�k��$K@3�Ԉ�Τc�d
+��*ppE��EC$<+"��#D��H��H�?&���D���a!r�B��I6��L2x��S̵�l�:�K����bG�d��
�L2̔A=�O�ar�qr{�;L�5�2��$��φY���q�?��̓<�C�_�%�F�qHZ�����D�W��*��nxZ|!�
�p�B�DX��@-���*�e��%���0�����^
+�|Ӈ�bh��O/�Kt��!9d9���
�qȗi���_8�?�C>{{��$
+���u���q�T)��ch�*��$(_�dڠc��I@�%��J���Ys�
C��=;�p��l�
�/��AӰ1��'9d
+�+�'�
��9d�Nq��	#Nz)�
1��l$��� *9a�Wa���'*�8�X�P��Ē�r�u:��^Gv�煘VH���m<s��
c
+7�ss�Ŋ�SWq萱ւ�
_W�7�fPiV�`�^�Z@,�7"�u�+_�Y�*!O�=��ǣB��r4�J &���:�o��7�<��ɇ�)2�����"��6��(���l�N��Z��������s�謬?H��
+df���WI�a]DH.0�D[0h�I�q���f	3Ͼx
d���
��mS=-���![
I�5-��磚���l�MB��|���ua���_�I8����‹�
��yz��
<�cА@67����Y�X>�e�̈́
S����W�]�u�u]m㼏43M�R��գ�NNT�
r<'�D
�D^�D���׳�|V;���t���H�����|i6�%��p��'��TAL�Gi���T����Ok{�Owv޻F�)xNU
������6�\�
��2"�)��"�_�
S(�)��|
phJ����?
+�Dw����O��m���<$�r׿�bgYX86�0���	"�M�
�8e �wY�k:���9���!�<|�]�SY��߼��=n!� ��1Ӳ�j*߇��[�ꯒ�..�CrT��
��
��֫
�6��
�>���o�.��aɢ�`��;�_!I��
+endstream
+endobj
+15359 0 obj <<
+/Type /Page
+/Contents 15360 0 R
+/Resources 15358 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15326 0 R
+/Annots [ 15350 0 R 15351 0 R 15364 0 R 15352 0 R 15353 0 R 15354 0 R 15355 0 R 15356 0 R 15357 0 R ]
+>> endobj
+15350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.631 624.689 359.783 635.593]
+/A << /S /GoTo /D (index_limited_extrapolation) >>
+>> endobj
+15351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [491.531 624.689 513.996 635.593]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+15364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 612.733 128.077 623.637]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+15352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 534.875 362.353 547.209]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+15353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.644 400.543 376.001 411.447]
+/A << /S /GoTo /D (index_bounded_extrapolation) >>
+>> endobj
+15354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 388.587 148.55 399.491]
+/A << /S /GoTo /D (index_H79_widening) >>
+>> endobj
+15355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.673 310.729 362.353 323.063]
+/A << /S /GoTo /D (index_Widening_with_Tokens) >>
+>> endobj
+15356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 69.557 379.76 81.89]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
+>> endobj
+15357 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15361 0 obj <<
+/D [15359 0 R /XYZ 89 770.89 null]
+>> endobj
+15362 0 obj <<
+/D [15359 0 R /XYZ 90 718.682 null]
+>> endobj
+14891 0 obj <<
+/D [15359 0 R /XYZ 90 684.012 null]
+>> endobj
+15363 0 obj <<
+/D [15359 0 R /XYZ 90 679.529 null]
+>> endobj
+15365 0 obj <<
+/D [15359 0 R /XYZ 90 596.843 null]
+>> endobj
+15366 0 obj <<
+/D [15359 0 R /XYZ 90 506.491 null]
+>> endobj
+14892 0 obj <<
+/D [15359 0 R /XYZ 90 459.866 null]
+>> endobj
+15367 0 obj <<
+/D [15359 0 R /XYZ 90 455.383 null]
+>> endobj
+15368 0 obj <<
+/D [15359 0 R /XYZ 90 372.697 null]
+>> endobj
+15369 0 obj <<
+/D [15359 0 R /XYZ 90 282.345 null]
+>> endobj
+14893 0 obj <<
+/D [15359 0 R /XYZ 90 235.72 null]
+>> endobj
+15370 0 obj <<
+/D [15359 0 R /XYZ 90 231.237 null]
+>> endobj
+15371 0 obj <<
+/D [15359 0 R /XYZ 90 160.506 null]
+>> endobj
+15372 0 obj <<
+/D [15359 0 R /XYZ 90 106.817 null]
+>> endobj
+15358 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F24 537 0 R /F75 562 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15381 0 obj <<
+/Length 2853      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸~���S+�DnA�i�&;�n�i��Kv'CK���E9
�����B��(Z��M;}�H�����~�it��ۋ?^]�|��(%��*���4JdJb��E�~"S9���H(MX��m����z���;�w�����C��#�DG�����i�@�w%"�у
��$��F�.�qAۼ(��1˜��j�Og\�I�Oy<y0|����}�Z��v�)���au{�]��r����l����qC���ru�̷�{X�|����o��UQS�]C�!6���>.�E�)^�9yX��KO�S�/��L?����
�L�ح3�Wy��5_LgB�����f�B'��m��]�棻α��VE�u
�Cs�S��,����5+W��m�Eaa
�e���Y��{�Y�im
ڲVz�Ŧ�[Q�_� H�䵑禄4Dn�UV�s#/I�t^�4���!<},7kw�����ʹ/_s�R5�Q�7�Y��O�s7X��`F(�طnD)�&B�	�?�Q�/�S	4V-D4k�ʊ�c5[,��d梱�U�{k-�m#�V�3�a;T�u��̷��������k��
�
+���f����h��?QF�P����h�	M�a���$A(�ka~��t�T21z
O�ï�Ĺ$Z5[ �l
a	� �S��x
9��֨�
O�����S�}�%�
3F�����b�J��p��P�b��Lٓ����#�b"�|Z��9��DÈ��G�Ҩ���,"�0�֝K<(᱉ ��-"@�~s&$�
Ϥ$�{!3J4'������&'���%��#��r��'�T�E�"�Q6�8Iu�)��pي��R��.F���v���Z[�C-�
p�]�i������e�'���]v��-./��nf�7��s&c��vD��sp�SƂ �e�X�����H�7��
/���"�AN�m\���
�
�
cR[q8������Y�Υy
�
c���C�x��F
��1�q�k7$4
F4U]'Ԥy��9c��<㜰�5|�Xl=�q[�a�w&�i"����2D�:��6�M��
����q��&��L��������|Ӫ��
�lS�ye���1�h�'
+�p�Ɠ0]{
��u����6$ؽ���N����c�%N��O��D[���i
�!�4@�F>��CR�U�,�F,b�?��}�E�G�\���8<t��U�b��C�Q�,8R呕���Lv�B�;H*���IϦ�k�
W��R$OiB"�݁W_��]�D��w�mI�@�5Ŀ����2�
hZ���F.��B�_C~!U�+�R4��(�v&	���Q���a5{/QhF-}�Q-./o��Z~��r*m�9�
+�b��aP�]�H�U2����9�<2�`}W(�md�������#���~ M�1�|�����7%*�	�
�
^��v�
���֏��^H��"49�e��
W�&)R�$�{������7^�oM�
�kB
m
+�u�僝�CC�dGO�(
�65��ܥ@2�ΰ�Ö
�T�q���i��uR@�d������u��N�;�M��5���`�:\k�Nj���@�C���k�n��n�ux�:�tx����L�/���j����}v��'� {�7v�
:�Ȟn�=t��=��=Cm�gD�3U#k!{(�����s����� {`�A��}�
��Y/&�<vѻ���E�f	���ǀ�}<
+
<m���R����l�(@J���# =���(���[���}H��aH�[_ �B���'����'azr

�'t��� =x�yV���@���d�Z�D�a�ݮn
+�SV�g2V.�� O`F&�S�U�æ
!�联bFX�ԯ����ȥ�졁�M�JI�l	��C��:����U��F��Z�f��'	��qb!Rl{�
�TI�nP~ ߍ�[fvۿK���� d
=.A�ܲ����g�S�RIg�*ι�u8�~1�E^t���߆M���i
ONA�8jK����
y�"m�=9S��-�r��t\�`
�"ٮ�=��
y�	E\�	���B
�/����
�H&7�H���
+�1WZW����R�J�`�AIo4��pM^�������-��Dn��y����f}ׄ������u؀@R
�<�(ǧ�q$
ԇ��4�I�jBƁ��}&���
(�+T>Z�
�}5i4f
��y�] ���
�X�U�'��
�fG8���6Ed3
�δ�7������Pp���!�3������x�O8����n�c�âI���I�'�&�Xr&<�hB>pvl�$�,��I�8dᨲ���s���j�p
+��#0($���ߡ"TB�q&M(Q&��g�"��\S��r-I�*7���i�0�û�ꩴf.�c��U<]�}6�`f�f�C�|�G��\��Ӄv����
6G�5��`jۻ|�BV������+��}�eK�֡>���ؘG��S�yC�5��(���T4���ũ�Q?Z�y�l�Lfz��f���m^M[U�a�G(	�ͳ�6y-�o�2��m
+_�}	s�'�
`�6��>+x�
k
H�a����)��YB8�15:�
+¸
5����o�Z�

���1
��H;�h8�xk�˓p�ϫNZk
� �+=�Xs�dQ=�:�������,GBW�&��gO�0� 
��A�>R�����e���|����	
+�&�����]b'B�U����yϘ
�
�������#�����CB������He��l����
���/k�yb;r3Л��Ƥ��J�0��&���a��{w��m^��@�>��-+�izLm>�hi�r���+smR^sȎ�]^k��헆������� �;�XV���˗��7ۼ�!0��,z�r�������Nnכ�[h\[�"Lv���~�e�
+endstream
+endobj
+15380 0 obj <<
+/Type /Page
+/Contents 15381 0 R
+/Resources 15379 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15326 0 R
+/Annots [ 15373 0 R 15374 0 R 15375 0 R 15376 0 R 15377 0 R 15378 0 R ]
+>> endobj
+15373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 465.246 379.76 477.579]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
+>> endobj
+15374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.334 311.187 236.659 322.091]
+/A << /S /GoTo /D (index_Concatenating_Polyhedra) >>
+>> endobj
+15375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 243.55 335.755 255.501]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
+>> endobj
+15376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 133.666 243.45 147.614]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.415 81.407 485.603 93.925]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15378 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15382 0 obj <<
+/D [15380 0 R /XYZ 89 770.89 null]
+>> endobj
+14894 0 obj <<
+/D [15380 0 R /XYZ 90 631.409 null]
+>> endobj
+15383 0 obj <<
+/D [15380 0 R /XYZ 90 626.926 null]
+>> endobj
+15384 0 obj <<
+/D [15380 0 R /XYZ 90 556.195 null]
+>> endobj
+15385 0 obj <<
+/D [15380 0 R /XYZ 90 502.506 null]
+>> endobj
+14895 0 obj <<
+/D [15380 0 R /XYZ 90 358.555 null]
+>> endobj
+15386 0 obj <<
+/D [15380 0 R /XYZ 90 354.072 null]
+>> endobj
+15387 0 obj <<
+/D [15380 0 R /XYZ 90 293.164 null]
+>> endobj
+14896 0 obj <<
+/D [15380 0 R /XYZ 90 234.186 null]
+>> endobj
+15388 0 obj <<
+/D [15380 0 R /XYZ 90 229.702 null]
+>> endobj
+15389 0 obj <<
+/D [15380 0 R /XYZ 90 158.971 null]
+>> endobj
+15390 0 obj <<
+/D [15380 0 R /XYZ 90 105.282 null]
+>> endobj
+15379 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F24 537 0 R /F32 772 0 R /F7 803 0 R /F1 834 0 R /F8 802 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F94 771 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15399 0 obj <<
+/Length 2858      
+/Filter /FlateDecode
+>>
+stream
+x���r���_��V�����t;}h�M�ng܍ۗm�CK��D"�Z���7��@�k������� �<$8���ϷW�ާ,�Q.�Ln�I����HHxZ%�f���c<��<+�]qw3�xVo�6j�w���h������$���|A�}�-;����|S�R\ƥ��\�����۫߮`�b1(͒�����8Y���X�%�f�.���6���W��z��
�9�H"d@!bHG��9峺\�YDÓ&�C�1Ę0����IQ��
��8�L"Fy��͜Q�朐�e�)�
+�����
f�X����7DgN���Q�Z�?�S�'H�K��8G
��۔P��]S����6e;
+���}��њK�����($uU�Tu(��`���X`���zTD�&�6b���}�+���l�N�r���_)-�ǘ�qD���9b�%�ᖔ�� 

��`j�
��@o�p����w�%
r��Q
A�%��U����y��Y�Qv��Ɍ������d
b��n��
+;��ܢ
�j��&4k���d�c��:L
+�I�#|���H]�@z�
=)Y���.܍ L9JS�����W
�f!1����b:���T�ְ0 4��,|
~
$�H��)n�V�=��6LD�<�#~�8`�I��?��� �{��iT�
@���
�3
�#̽kW��e5�gŶ\݁�g�����Z�M	�b�2�.J)Ѓ0�cR�
'=Gj���'c!�����Sph.)��H2����8��$M���%7�*Z�A����#e��a؛�y�
N4����y��0�a���9��K��Ȯ��+8w�=�69�݇���泉��R`�
e�>!n�n����:T�:i��?F�Y�Rޅ3
��b��H�s�."E��Db.QJ�!��7%~���, ���Z�]� aJ�$��!��e���tjۧ��b�4�:�&��	�
+H�C�^�N�L��A @�i
b0H�]��G
�^��S�]������%"����EL\�f�]
+j�ˋ��A]�h�a���
+L����͖�/�7�A
�H2�
9@�3���b�5��;�_Ê��@ڮ+��@�0��!��]�[���$�6ڄ�d6
T�rY7+���%�{�0�\n

�?~�|2��Ec$b
�g��	&�R�9ɼA���1l�<3��5٧ :�=߆ ��ui�&��I"^�##>�4��j�4����뭘JN�D9
ar��6�fN�ղ\?����:@���)�U,7�y�sY���
�O�ɉ�����t4�#��\���>鮃��3W�x��`Ex�>���Y�؊�\�� ��vk�N� {S�(��@���`�W��ѫ���@v
:����ρ��k�}]oGn
j_
��hn�����e�#���滍Z����"�,�F���
a�O��]>�6GK�!��]�u΂e鬨VvPW�';�
/��Q�F
��SnngY���,��z���n��z��yP"���/8%��u���[�P~4]姃͈�o�� !:V+���Js������I�d�c���r�@
�i��Z]LY�:3�ec���{e���vk���պn�{�e8��3��Υ����)	��iJ��@����s�l�0}=0�R�3	&#��4rXx:���Ry�W4���,2��?f>���	s?�MF����s�t���6KǶ�+�ܕ�e

$����\�;��YS^l��O��D=�\�
��z��@��9
|��Z?xv�EQx�[�d�񮜛����_�7+����]b�����������u���<��R~3�%��g!@Aa&�2�t4��jXZ���-� s��)�d���
u�j#�>�5�tNq
�3���S�
�GY�G�(���A0�� [...]
+����Bn���@�ź�
bl`�=�&�p��:���w�:��{���C��@5��
R�C*�th�3k��
\~�Q��[��s��.�{��d��(�Zn��i-�w�%\y�,$A&�M��bPTi#1g��
{�	t�|�y:�biC��fìqU+�IU�]��z�)�__'���Dz�8��$@1�W�@u�l����w��sAX��
U���|X� ��;hD
+-�xS�\3
+�-��X��^ ����
$
�S ��
$8��/�_x�$��@_ IE���.�(����y�q�
�.��>^�
��!a
+��U�G�w
:P���
P��W2�5�)(QY�o�8�(�l�/jͥ�#�D�/#��n��b'?�����;4���h|kQ��>��F��
x?aY�����e݀���U��8՜@�б�s�ĪiH�{͍
+*��)�jy����]NjC4Mo�O	�Lӛs���a�I ��Z�o�#����
]�8OpFa_��~�o�@��-!���^��~=�Ӛ ��&���ޥ!Z��
�H���	�sPA��y:�p�j�۰�k��N����w�?u�r���Ҹ�Ջ�N^OǴ��<�k������
+�V�כ������
y6���;��A5��
1s��{Q
�i��:\7�w�}�2�eg�~R>�������lc�GG�n<���M��߽�?>
T�����4В#�v�t�k��i��^a/wE�
Łu�	��zn C����$b�+���_�^��aǒ����^b��q	�
+endstream
+endobj
+15398 0 obj <<
+/Type /Page
+/Contents 15399 0 R
+/Resources 15397 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15326 0 R
+/Annots [ 15391 0 R 15392 0 R 15393 0 R 15394 0 R 15395 0 R 15396 0 R ]
+>> endobj
+15391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.376 538.815 385.519 549.719]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+15392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 369.858 149.577 377.384]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.847 306.714 191.42 314.24]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.164 306.714 266.737 314.24]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 216.584 239.856 227.488]
+/A << /S /GoTo /D (index_Mapping_the_Dimensions_of_the_Vector_Space) >>
+>> endobj
+15396 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15400 0 obj <<
+/D [15398 0 R /XYZ 89 770.89 null]
+>> endobj
+14897 0 obj <<
+/D [15398 0 R /XYZ 90 721.073 null]
+>> endobj
+15401 0 obj <<
+/D [15398 0 R /XYZ 90 721.073 null]
+>> endobj
+15402 0 obj <<
+/D [15398 0 R /XYZ 90 644.763 null]
+>> endobj
+14367 0 obj <<
+/D [15398 0 R /XYZ 90 610.093 null]
+>> endobj
+15403 0 obj <<
+/D [15398 0 R /XYZ 90 605.61 null]
+>> endobj
+15404 0 obj <<
+/D [15398 0 R /XYZ 90 522.924 null]
+>> endobj
+14956 0 obj <<
+/D [15398 0 R /XYZ 244.439 219.737 null]
+>> endobj
+15405 0 obj <<
+/D [15398 0 R /XYZ 90 213.097 null]
+>> endobj
+15406 0 obj <<
+/D [15398 0 R /XYZ 90 144.523 null]
+>> endobj
+15397 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F118 2438 0 R /F60 540 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F11 621 0 R /F8 802 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15415 0 obj <<
+/Length 3418      
+/Filter /FlateDecode
+>>
+stream
+x��\[�۶~�_��V�F0��3m�t���o�;�Õ���%R!����� o�@ݖ
�g�/��|�h<y���߮�rs��[�&I���~b�Dq���_�ɻ)7r����&5"F�[��7������7o��7W�^��'�
H��bs��<Y���'1�'�C�	�
���۫]�J�戨���PihHGCm�|�C
���O�t�[�Y���ׄo�6��<�HPuP{7 at z�
��[&L��H���; �&��K�H�"�{
��:��(WB�trߑ�'�w&��0�b\�S��׫l���d�Z�&Ō����&�v~���b��F�(t
��{�GD�C=���S�
�,���c�Ϩ�~�fs*�tuo{&:�q��$��c���F�C�3�<-��,���E^i�ͳ�����1��
+��w�?����ԟ�6#b�.vy���d���S!��_bs��aE�Gu�� ӻ��K~���!Y}�FQ���x�
��)�m�]��-
wOF��b"�@w�s�f��۴(f\L��D��R��8q8
�Gԇ��81c։�H��r��
"��q�Mĝ5�m��R'�
w���7>[�[g<�i��?�SY=���n
Js.��H���e�2Hq5�W��K-|��k������w���o��ֵ{ۈy��?��ސ*�h"ܩ��rk�� -Ÿ��r��j�A�������J)��� L4�
cK;���Hw��2�v$�͜<&�MkUpXʫoI ����j�<"^�
+���fs����j���nZYs&��O�A
�I�>�#mݮM�ed�(E�ңyY
:�}�N$n��{LyD
+x.���q���ym���1���T�	��9�Y��.�0
���P`�p�
0�wU[�
����CL۟6���_.�~�QO0���10�L�>����'@:�8�@%J�$�${���-]��
�A�!"�!ں��@rDuު
=8c�	
+��@��Z=���B�1?��I�����P��+��� �"���"�a)��+�������d��%�
8�����OAS�D���@���8Q�T���
rz��2}~L�ED
+�3�
+���h
���ꮀ�8�����>�s����ޝ����1��J��c�A�@�&��0�J�Ҭ�HB^�
Q��Z�3�s%�D��]��
 0������ �,V��:-oߦ�A���j��w�����8"�a�녒�MN�UD�JTј*�6E�iӕ�XiZg>��
�hxᷕ���5
�}j�b��Ѧ��@��讲x��"����=��g���V?�0�� �����]�I6�.-��
����!��K%�U$v:
]���?��:�x�����k�	��V-惚�<\�I��
�	���1P榱�tװ8���`$���}�����Ų� ٪6 �Nq��ٻ��=�k���:� ���

��E�k�cK�&�%�G�.`c
U!DNa�
�a`:j�/�#n�]=nZ��7��V��ס+*j��T
��~$���){|���*Kvͳ��습fZ�8��,�L�o�½�N2�KGp��@"6lL�X�y+1\Y���.9��qWb>�L���V�\�o�
1
����:
�J�m!f�~�n���Q�A?
+W��0A�	�Ӵ���X3�r�%�I��U��7[-6-�=�a�zx
��c(3h�Q�М��Y�/��*�g 8�p�{.�B��7�%N�.Ye��*�Qi���K� �?������&L3v|4����~ت
��q�}��
=��K<?�^.3�rsXR�,�F��q����'q�i�
$q⊜A�Rk�47G�ux�9U:Fsq-�5Ds�
����q_m`>D'�vn��S#�r��=
��;=]U
M����
N\ ��
bӲ���F��B����/�a�*��<m��b�pa
�x����lpZ��έ���{x���������虓�
(αM6�B�����P��ad�&P2��"�ܥEՕX�V ��S")���5܄@��ބrJ!{��}8X Ø>�gJ��p5�
�X�uUS����Yk9Ct�q�h���b�G�Gyt�ɄAY�9{)���q�$���c(`itK�
+�D�o"D�Kr
�L��P�UZ%>&[?C�Ǝ��ִ�Xz9_W��i���AD��5��>Gd@��e�S��J@��	��V���/�g�	ؚ�L���޺}ɶ�$0�,��	�
� �XPaw�m5�ypj��S?����hng���Lu�Z4���V��ck��$
��x)��*�����m�lt��Y
�rT��d:��p)A��7���}�
C���+��iMX�z��Ѡ��
�t̏FqF�S*P�)x}���I�
j �	6���H�a��J�l+4�$Y$ u�F���	��}Y��!	���@��q at f��>��#�e��)�

�5�
+�)PN�dP?FPX��GP��{k�C��2� ��!� w��Š�8U�a!�p�:�B?����.������VՊ����Z6
�El���]���i�Q��OX G�$!�4`��
��i�X�mIlք
�Nx�K�
_폱v�@Z�nI�k�h��ah�?!;u�v֚ͺas�"���^��r?�\d�-�v�DC�_.*~�\d
�`�3��]A�N�:�\�B���-5W�
+'E��l�P {%C=� h�W��+�Gi2 S&l4����m*
��Ҩ�Ȱ^����;i��8�xS�2�
+W��osh����S��zp��8�-谁�fA�����-am�+vH�����.��{X�ѐ�m���6Km�	�ae�z�o�����"�7 X�������uR��.����9
��ۏ
oE(	��g�p�C�E�K�ty8S�[��P{��% �g��ǧ����.�b��_ˈq(��~W��,�����y�w���R$�n:�^c���Q�pq������H����ꎧku���6l�{�U���a�9܈q��YK��˽�
ͽgm�ͅ�R��UHP=�.��%��n��s�G�)�T����͗��V??�ǶK�L��v��2��gp�0�K��B9.[��v*."N��N�S��ީ�J���ʹؼ�]��V�U��� ys��q)H�B
`�ER,��I��.��a;���1=gl��s�^?��ܩ�d�p��P�K V��)�ΌǼ�e
+E���P�Q֭��RW�	<�
,
�W��C^�sm�2��<��.�֠=�
�n�<�X`u
?k�E٩��Cw���<�WP��%�뜻��;ՅW�m��9k��A޼X[���0�B�W0�n4��7o~�'�.���3a����${�-Ǣk�am�~�F���8�ZWy��
�^�����vtP�����n{�����C�f,u�/[�T5���b�׼�*������J���˱p�
+endstream
+endobj
+15414 0 obj <<
+/Type /Page
+/Contents 15415 0 R
+/Resources 15413 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15326 0 R
+/Annots [ 15407 0 R 15408 0 R 15409 0 R 15410 0 R 15421 0 R 15411 0 R 15412 0 R ]
+>> endobj
+15407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 669.068 379.76 681.402]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) >>
+>> endobj
+15408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.144 626.97 182.164 637.874]
+/A << /S /GoTo /D (index_expand_space_dimension) >>
+>> endobj
+15409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 529.604 243.45 543.552]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [514.03 453.036 535.938 465.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 439.651 226.824 451.985]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.397 385.599 362.844 396.667]
+/A << /S /GoTo /D (index_fold_space_dimensions) >>
+>> endobj
+15412 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15416 0 obj <<
+/D [15414 0 R /XYZ 89 770.89 null]
+>> endobj
+15417 0 obj <<
+/D [15414 0 R /XYZ 90 718.682 null]
+>> endobj
+14957 0 obj <<
+/D [15414 0 R /XYZ 400.69 630.124 null]
+>> endobj
+15418 0 obj <<
+/D [15414 0 R /XYZ 90 623.484 null]
+>> endobj
+15419 0 obj <<
+/D [15414 0 R /XYZ 90 554.909 null]
+>> endobj
+15420 0 obj <<
+/D [15414 0 R /XYZ 90 476.912 null]
+>> endobj
+14958 0 obj <<
+/D [15414 0 R /XYZ 487.765 388.752 null]
+>> endobj
+15422 0 obj <<
+/D [15414 0 R /XYZ 90 382.112 null]
+>> endobj
+15423 0 obj <<
+/D [15414 0 R /XYZ 90 323.361 null]
+>> endobj
+14959 0 obj <<
+/D [15414 0 R /XYZ 90 288.691 null]
+>> endobj
+15424 0 obj <<
+/D [15414 0 R /XYZ 90 284.208 null]
+>> endobj
+15029 0 obj <<
+/D [15414 0 R /XYZ 431.18 226.851 null]
+>> endobj
+15425 0 obj <<
+/D [15414 0 R /XYZ 90 220.834 null]
+>> endobj
+15426 0 obj <<
+/D [15414 0 R /XYZ 90 139.682 null]
+>> endobj
+15413 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F11 621 0 R /F8 802 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15431 0 obj <<
+/Length 3408      
+/Filter /FlateDecode
+>>
+stream
+x��\[o#�~���S++.��,��6�n�Iݬ4�,��<��fi�]����2��D],��(� j.�����#e<���7��x�F�A�2I���n�����>
	F���c<�
<̗���rD�=M��e~���Y�˧W���GD�j4�_����5(�
+{��&�e\�!����շ__]�zA at 3< N��
L�>��-\�v����}h>���l������DT����C�Ho�:C�"
e܍���)�&��^����*�H�l0�O̘{���rYT���
����5K?��v���)���l����2���x�>׸F1�b�8"��E��`�DOJ$L��V�I=_̊�F�}6�\RD�jͶ�e�0�>���?]���w����۫�"5CRw}#g���f30<c
+aՃ2�<֚���x���FQ���O
����Ӣ��
·o.��FA�f)9L�܇7�2�u���e
	�AC�����a�4�3�<�P�-L�r4�n��ٶ�����2���S@
U|[ݙ�눹�Ĵ��s��0wD�����ú�u#�4ߌ��
'
1�S
�
3�r�(8�!C�"*	2Ҩ �-6Tp��L,8DZ�߀� �$�/���v.�W�j�x,��b�s~���Tc���!�+M΂���.AZS�㬬
+�v�*CR�$��Җ���:`.�n���
�y���U�ƻ�~58�Z8��Z_�1����7
�a��N� pp�n�B$|��p	N���CY��1�ąNaQ.�}"���G/Z<��@� ��
�H$��O�Z:��0���2z�Cbt�l\��%��]��C+I�C	(�M���L��l��)��5<
+�o�o�yQ�ʺ�6�>ֹ�W����ק�'9�1�
T�ʝ�/"�ẇ�#�?��8O��ƌ3��
w[P�ZI��`S�>�XX��D.�P�6՘R}����8%)ԡ� 8	�ٿ|p&��ޱ~��c��y�e�z�519���1p�$�t��Q���a��L|���t|#�
S����b�^�[1[��p�PM���C�i�3kXmfm�k킪O��6�6��h Sh�� �dÌ��Z؛��'�ë(#���6=�DЮ2\E������YI	ő�r)%Q���	��JD$�B�
�W*�$,�!�-
��J2P��u�ew��@}$��"��w�n-���2=8	
'��l�V�ҧ������:o���}_��{��~�n�eY����}���F���w�ܭ��w�X�`�:��;�tJ'%T�~�|���+׺��E��,�b%��y7(A"*%�SKt0g[1�?r?q���� a�X?�q~�����Bq����aՄHi���Z��\��t�� &)�"̛6U0�n���x�vcD��"����
!$i��A#�|�[���r�԰Kb�<u�X��㪸��ܪ����t��q�9Y��3
"!�O�n���L!-Y�,��u?ۂo����1�Qs(Ge,u
��+֕p7Ť����G@M�.�����Z��|R/��V�k]8�T�:

+v�\�w80�5KfB�W���v]�
���)a�]5˼tqUe��Ii��*\��\.�!*�^'֘E��P=t�E3m�@{c��]�>I����D��M�[���i�Uo������[�[w�7\�g3װ9�*��I|m�e;�2��y1���Z���xh�in�\V���P�ƫ�&�䕏D��N�iK����$�ʆ�U�
P�
�~$��W`�Y���#�p
�-
�}A
+�ʉ�87���)�*�x����
����!=�O����S�r?K��y4� r�Ĩ��x�1�XgA�(FĀ��ĵ�#=B6!�'�Q$	
z4e߽�Xc�%�v�St-�St]�^���I8��3�Z�$>@O�Č;Q��L!9���DF)wc�G
�N���7�鮬�IwnHC�_	Hwn4a�(H�>k�w��t���
iF�b����ú�g��L�C�;��D+o��r����Yw�������;4�j
�ͳ

av���0W�@?�Վ��H����a�@&=��
+cҴ[�/�Y����/dI��F����˺� ��+L���
S�P��*nrN������c�o.��]�f7D�Ȩo�lv	�n��*�Bf�]*��Z�EU�!�.���X�5�dc_��U�l�
+
������A�
�~�S��a P9�ߘ�f��(���N.�21��H�R�ߌsD�����/�WmM
����1��7�o���oh�7|o�oh�)�k��.C~s���?����[�n��78���
6���bVN��^zr��E��O�ۘ�Q��?׏��Ե3��]�Om��L<��<y�w���eJ�=�D��`������k�1�g�_mku~�����ߍ#��HL-�!��iyw��eIN���T'�ľ:�y��5�=� 2m�p��(�N!Jd��yw��^�k����
+{K8�����4MOv���Q汍Xk�DSD
+a�Y9�
�
f�n�1Y��E�����^��ڝ�gHe�c�����#_E�:�c������h�aL�

���a�!淠�y
+Hg���K=zف�g�9�(V�
Ŕ�d��'���݇�<���4q�����Q�#zK�@O�}N�x��2�!R�Ć���}4q�>=O
�yQ��s���T����+��vq�N$Yj�x�ۗT��{"�T���)�q��v+=0nH��J�D�� ����� ��r�l
R�m��*�bk����^����	졊�z��(�X�Tq�(V'�x�(�
+5|`�Cdz&'�D
4y����
�� ��|]w�6}���Nv�s��;�ְ�,�͡
q�ͩ9B`���m�2�G�?ż9�����l�
E�I�>�C�*�E�����
���
�9̤z��N�X�e���t
+y ��ߋ�-E_V9T�a�CXT�]`H�|�}vھ
	���K�i� ��ʁy�1R:���-�D�DR��;��D=g��<-��Q���w
�����s�{E�D��lK.ѭ1
�#%Iw
V([o�=o��L��뭯��~��t
���$��Dcj���J�4`�f��L !x�gp

��$�¾&�Gc��\�m�y/���I��I��0.���ô���EU��^��@w�xw"$*�%�\j�q���7����(R�$�
�m��w=�?]���P�
�u��W}������O���|�����
h���3v�N
�N�DNN�N�g L�Yf���v:̏�%ob� N�������w���X�q$İ�!b^=���5$��i�:8D�B�����*��E��~��
���/l[�C��W]�6���˗7����G�z�].�ƒ!��:|��뺝ϲ��t_W
�|w��	���� ��
+S���G�׶7����o�l������� l���
+endstream
+endobj
+15430 0 obj <<
+/Type /Page
+/Contents 15431 0 R
+/Resources 15429 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15439 0 R
+/Annots [ 15427 0 R 15428 0 R ]
+>> endobj
+15427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.602 390.719 354.851 401.623]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Linear__Expression) >>
+>> endobj
+15428 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15432 0 obj <<
+/D [15430 0 R /XYZ 89 770.89 null]
+>> endobj
+15030 0 obj <<
+/D [15430 0 R /XYZ 90 683.788 null]
+>> endobj
+15433 0 obj <<
+/D [15430 0 R /XYZ 90 679.305 null]
+>> endobj
+15434 0 obj <<
+/D [15430 0 R /XYZ 90 586.82 null]
+>> endobj
+15031 0 obj <<
+/D [15430 0 R /XYZ 399.318 473.953 null]
+>> endobj
+15435 0 obj <<
+/D [15430 0 R /XYZ 90 467.313 null]
+>> endobj
+15436 0 obj <<
+/D [15430 0 R /XYZ 90 364.931 null]
+>> endobj
+15032 0 obj <<
+/D [15430 0 R /XYZ 277.933 264.019 null]
+>> endobj
+15437 0 obj <<
+/D [15430 0 R /XYZ 90 257.379 null]
+>> endobj
+15438 0 obj <<
+/D [15430 0 R /XYZ 90 152.939 null]
+>> endobj
+15429 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F118 2438 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15448 0 obj <<
+/Length 2324      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s������MgZrF<�8��LRǙ��������@�QD�
����>{��#�����G3p8������{wē�	�|����ً�MR����j��$�
+		O�ɛ)W����&cD���l��~zy��������w�'N���œE~��
�,���	FLœ�)�p��M^���{]0���'�İ:.O��KC�D*��ǤBo����NS|�4�b2�D���S�jƢ��߯���R�f$�����j�\G$��G*&�P1)��{��n�J׳9xڬ��Y��k]���r[,�j���^״X�yy�
]n[1��􆡶Y��[.�D��ĎT1t��;�_�Cc�Q��q�)C�������,�ݜ/uQ�i����	��R'��:��E�
29��h�����i��[��p#���� k���ƛ�>�%�PD�{�
+�X<�7(�#w��b�4O��2�������f����[��"�ES�A�&F���:-`�h��nq���=
 Q��s��C%�F�����R9���d�N�4�
O2-��$-��5_�ܵ(�<��_���u��K�
�@"f�d!�XX�
� -���0d7�cQd��Xv&��k��ʵ�b �Tir��8���⛩1(�&���{X�b��)�fN����
�.2�����@1E|6'��
+����x��	*s�JgI��Ëm�hR���y���``b��
+
���@Ӝrĸ
���n���e�T:ɝ�?�K	�o����CX�p�[<{���l� �dGo���928�!
|.�D������P��ˢ,���簲۱���bF!Yg��^V�4)��`A �t�Ճ�PvB7�v
	���~A�v~|S��~7��=��(S�@�}f�i�l���Eډ�@ �C�H�����Y�C��JfF��c�M2�^�
o�/�)���B���}1
��T
;�8��U�����*�j
( �Q�����j�W6
)
3Kcr]�h	n"S/X�f��x$��_�L�l�yQM�
�B#@1
�g��C�b�S#��죌��cP�Iv�>>t���HK̅O�Ej��]�ڽ
�	
��
	!��_-?A�zW7:w�,CC���
+2�M<�b�
5����_D�����Qݤ�>�	D
|�LS��p��jGE[˗�)7�֛��,|Ƅ�W��z�t�DZ�22��
Y
lH=��3Hx7��=Y
�Mr
+�9�I9��i`�1?ɸ��
�G>�R��-�F~�x33�Ҧ��+܅�� ZM��Y{�6�@	�{���(�O�!���0c
fWe��3��_@f����jI����|�������Kvτo(�1,_�f[!P2Ȥ}mv(�H at nϢ~��.�
�e���ib�θ7b��(�+��'�Tzo��Nr�'(W��	7�C��
��/�Ƭ�1IЈ�B���f�~us�,��
7k $OvN�+��}J�����]3
rf��~�B�_C96O�E�o�4�
�Y�*'N�MbVܺ��Ջ��PH���|��n	�� �2��	��C��Ej���.�A�^ޅ��� g���{p�H��%I>���S��!�z�%
+�9_�i�L��JW��V�+���
�W�>pz ]y	#��t%�T�o%�����{�E~I-L-��EZ(�\�%�r�)j�Ve�֍m�/����nq����`i���|��\�Y�6�^54��L��t6����m���{K��z3 ��&C��!�q����R!a�j at 9����MR����i" y�1�51$ۣg�
�8���A�H"Ạ�Ec��Q���8��u�8L|(�K)�*��^U	Lv<ݝ�;},���\j�c2�@p@��6��Z�2��
X
�� =(����P���fC����_͢�)��f3%����
��è��k��\�E�5��X�l琜�ݿ���<Iݲj/x�6��9>�.u�@0�}/�d}��}@��a�R�
�	�Wℎ�].�W��,]
�`�q��}B	{��kX�pv<��ԾPM�S�7��O��sgu���3/؄Ou����m��|�����
�g4��RF{���0
[��֏�����v>�D
+rԻ 
�o��%��=(�oI��/��e�-�������;8���eZ�ל���_l$l�Y4�/f1�
�[δ�3m����u�4�
�믃��@(����vL"[���޾l��
g���y	�zqs�7�����
)���3�����Ϳk]��
/y_�3)��L�j�=?���M�cS S�c i�O��ϝ��8��0�)2	��%�M�9?;��^׺�F���͓��
+�~�X^V��zV�ۀ�����(>
+endstream
+endobj
+15447 0 obj <<
+/Type /Page
+/Contents 15448 0 R
+/Resources 15446 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15439 0 R
+/Annots [ 15440 0 R 15441 0 R 15442 0 R 15445 0 R ]
+>> endobj
+15440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 88.955 164.319 99.859]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
+>> endobj
+15441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.056 88.955 205.82 99.859]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.181 74.656 391.739 84.562]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15445 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15449 0 obj <<
+/D [15447 0 R /XYZ 89 770.89 null]
+>> endobj
+15450 0 obj <<
+/D [15447 0 R /XYZ 90 622.134 null]
+>> endobj
+15033 0 obj <<
+/D [15447 0 R /XYZ 90 597.7 null]
+>> endobj
+15451 0 obj <<
+/D [15447 0 R /XYZ 90 597.7 null]
+>> endobj
+15034 0 obj <<
+/D [15447 0 R /XYZ 264.215 516.618 null]
+>> endobj
+15452 0 obj <<
+/D [15447 0 R /XYZ 90 509.978 null]
+>> endobj
+15035 0 obj <<
+/D [15447 0 R /XYZ 90 470.246 null]
+>> endobj
+15453 0 obj <<
+/D [15447 0 R /XYZ 90 465.763 null]
+>> endobj
+15036 0 obj <<
+/D [15447 0 R /XYZ 170.288 398.608 null]
+>> endobj
+15454 0 obj <<
+/D [15447 0 R /XYZ 90 393.97 null]
+>> endobj
+15455 0 obj <<
+/D [15447 0 R /XYZ 90 320.176 null]
+>> endobj
+15456 0 obj <<
+/D [15447 0 R /XYZ 90 296.126 null]
+>> endobj
+1970 0 obj <<
+/D [15447 0 R /XYZ 90 225.343 null]
+>> endobj
+466 0 obj <<
+/D [15447 0 R /XYZ 90 217.746 null]
+>> endobj
+15457 0 obj <<
+/D [15447 0 R /XYZ 90 117.585 null]
+>> endobj
+15446 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15493 0 obj <<
+/Length 2080      
+/Filter /FlateDecode
+>>
+stream
+x��Zms�6��_�O=r����יk|�m.n�~J:J�l���TRݯ��ER�$Dz��qH���b��7�عs�������uH�Ł8�K'�N�b���:\�QD�)��7
�nR��ٍ�c�̷�"���/ټJ���
���������Oׄt蓘"0�����D �>�팫"1
+����GI�ʓ���>����X��z�X��#�+�
��g.�cIt���ɧ	2�!Z3
���XM>����r0�q�|Q�V�)\s����	6J�]e�'f����
T�~�}���לS�o�k���|�D��3��b��k����Yֈ*i�j֔352�<��;�L.��3k}�㾨]���6J_]A|FA��t�ֲ�5�x
��1��@
�LY�b@Ĕ0ű&�/m�y�f�GCW,��,�\�y����/
}m�
`Ҭ�cS,��r���
���7^s�H��5��5��#r�E�Z�)h��(`>��G1�aFQ��������r��C{�
د
��	X�߀%���`���NF

!�E5�&|k�1#|�V��1#�n�&#�&��sYy����qX�����}\���SB��p�!�C�� s��o��	k��A>�c�V�����ꨏ�zu7���y� ���}#VsQ��k
!��G4�O�
�%`}�����fB�`������!�����C�uT��nJ	�]!3��1��GF9���B�(���J,��5�b��KoJ���i=�?�i ���>\wSL��2~V��z[7��ȐB'�v@
+�f�OX����CT4��
�o���p��7ۧ��U�����#���P
{>�h7їoүZi��{���tf�(lv�'�(����̀�(�.���:
�� �@qV���,ߎ�FBÔ
�#���s�=�1o{�
�V}�j�=��N"D���v���t�ϲ��1�zi=^`֦�sF1hV@�
6:qx�D�)
��2�D�!���i�?�-
�R_�ca�L��v`��.T�����S��q�yY懃O*>b��x��LH����Dz]<�Zg'�M�3�Ы(��;�����)ܶ������F��;
c:ƌ� �x�g�Q^]��"B��wj������C
T
��v�2��Q�Ĉ�3�&|�nV�R	5���u�T�w at 7!�v5�~ E����#?�٧������j;-�0�
X#G���k�/[�g�.a٫[����0�����R�
��"�
�$���OVϚr}0�?!XG�`=
O
�
���k�|bһ�E���3��
�f���E��Ac�[�
�2R{�N�M�ko�c��q�/50Ur�>>�F���ߦ�M��-�#��s δ&��2ą]�}tPqt4dt"��

��C���rԚ�2��n�<y�󈫡'�Fh3��'i��>9l�'_��a.ѧQF!��b���H>X+?�K|t+�������b��M����-�$��w�b6�6�~!�v��\Y��B��є�*q�Ja�&
�-i-��F�^�y�Xl֙H�[c�9�xM�Y�)A�Ļ��(tE,�/
���Q/����H�z�"���N�w౔�/���ϕ�����ջ�
'�s�S���ϥ:��u�<�׿�
ى�Y��G`<0�a�sReIT�i�m�4Y-��~E�

�R���*��
�l'E���|����H�<��g��g�aC�+��w
$�Y%���<�L��98�қ�k��YgO
~����}�pT�R�
w�
�0�|���:y?K�����0'�!	�)�t������ԶF����J�1A�le��
��R<]� �C��R$�h��t^J��
��0�< <�_�dh=���\��^�����u��k.)�

o.À���	�i.;�Yn�v�n/�����C��!{�,:�8%�Q��S?N���x	p5�w�}s����?<�ݺ�[�J���6=D֕�t#����
�8Z�?
{���a�����4l+���Y_^\�7w�yܡŠ�
�%F8l����
j�6���J�2d?���䘠 �6@��&a��׹W�f����:W%(y�
�� eJ
Q
+endstream
+endobj
+15492 0 obj <<
+/Type /Page
+/Contents 15493 0 R
+/Resources 15491 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15439 0 R
+/Annots [ 15443 0 R 15444 0 R 15460 0 R 15461 0 R 15462 0 R 15463 0 R 15464 0 R 15465 0 R 15466 0 R 15467 0 R 15468 0 R 15469 0 R 15470 0 R 15471 0 R 15472 0 R 15473 0 R 15474 0 R 15475 0 R 15476 0 R 15477 0 R 15478 0 R 15479 0 R 15480 0 R 15481 0 R 15482 0 R 15483 0 R 15490 0 R ]
+>> endobj
+15443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 684.047 164.319 694.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
+>> endobj
+15444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.056 684.047 231.833 694.951]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
+>> endobj
+15460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.435 669.472 345.993 679.377]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 645.264 154.914 655.191]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.651 645.264 229.76 655.191]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) >>
+>> endobj
+15463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.817 629.712 323.613 639.617]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 605.504 180.926 615.432]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
+>> endobj
+15465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.664 605.504 281.785 615.432]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) >>
+>> endobj
+15466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.817 589.953 347.024 599.858]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
+>> endobj
+15467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 513.449 163.361 523.979]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a26efa1a670d98531267d66b3cdc3de6f) >>
+>> endobj
+15468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 487.354 163.361 498.258]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a4720b45317a1d7a600af6e6dceb2b55a) >>
+>> endobj
+15469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.698 487.354 228.964 498.258]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 462.007 163.361 472.538]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ac4cd77344ad58f2051c29770912fba81) >>
+>> endobj
+15471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 436.287 171.11 446.817]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0db69116a7111121b39ae808911c77c1) >>
+>> endobj
+15472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 373.958 215.923 384.862]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2a875ab79a20b1421a1bfde273b984e6) >>
+>> endobj
+15473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.26 373.958 281.526 384.862]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 337.278 171.65 348.182]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5ff03c3a22a89b7fdd332a5bdb3ca128) >>
+>> endobj
+15475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 300.972 187.151 311.502]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_abcd9dc4a5540f148b05c786b2d563d07) >>
+>> endobj
+15476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 263.919 202.902 274.823]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+15477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 263.919 300.037 274.823]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6e970db12e0581dd7014d8cb334adaef) >>
+>> endobj
+15478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 238.198 202.902 249.102]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+15479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.4 238.198 314.263 249.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a120e2e92a13bf7e4ccd20b14b322196f) >>
+>> endobj
+15480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 212.851 161.677 223.381]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a1d52d042b5e633bc5444947ceaa65cd4) >>
+>> endobj
+15481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 150.522 204.985 161.426]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_af7c0e7d0ee07ead390818cd2b34089b8) >>
+>> endobj
+15482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.214 115.744 182.698 126.648]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6509a5f02a17396160e5302952d2273a) >>
+>> endobj
+15483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 90.023 172.198 100.927]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aee9b737150b5b96ae9ff85b9f0cec535) >>
+>> endobj
+15490 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15494 0 obj <<
+/D [15492 0 R /XYZ 89 770.89 null]
+>> endobj
+15495 0 obj <<
+/D [15492 0 R /XYZ 90 721.073 null]
+>> endobj
+15496 0 obj <<
+/D [15492 0 R /XYZ 90 673.457 null]
+>> endobj
+15497 0 obj <<
+/D [15492 0 R /XYZ 90 633.697 null]
+>> endobj
+15498 0 obj <<
+/D [15492 0 R /XYZ 90 553.805 null]
+>> endobj
+15499 0 obj <<
+/D [15492 0 R /XYZ 90 530.011 null]
+>> endobj
+15500 0 obj <<
+/D [15492 0 R /XYZ 90 502.576 null]
+>> endobj
+15501 0 obj <<
+/D [15492 0 R /XYZ 90 476.855 null]
+>> endobj
+15502 0 obj <<
+/D [15492 0 R /XYZ 90 451.135 null]
+>> endobj
+15503 0 obj <<
+/D [15492 0 R /XYZ 90 388.991 null]
+>> endobj
+15504 0 obj <<
+/D [15492 0 R /XYZ 90 352.5 null]
+>> endobj
+15505 0 obj <<
+/D [15492 0 R /XYZ 90 316.08 null]
+>> endobj
+15506 0 obj <<
+/D [15492 0 R /XYZ 90 279.141 null]
+>> endobj
+15507 0 obj <<
+/D [15492 0 R /XYZ 90 253.42 null]
+>> endobj
+15508 0 obj <<
+/D [15492 0 R /XYZ 90 227.699 null]
+>> endobj
+15509 0 obj <<
+/D [15492 0 R /XYZ 90 132.692 null]
+>> endobj
+15510 0 obj <<
+/D [15492 0 R /XYZ 90 105.245 null]
+>> endobj
+15491 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F94 771 0 R /F91 766 0 R /F111 1509 0 R /F24 537 0 R /F68 3017 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15550 0 obj <<
+/Length 2044      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~���)��b��H�^��;�T�;Io��i&Յ��C��x����hl�������]������#A�ރ�w���ή^s� 
p�ݮ�z����-���
��/�?x$ ��je���ӏ���x�V�}{;�8C���.��f���Ū�
+oo*m<��z���ٿg���2�%B
�G dx�13���ы{'���ͼw
%��T�������r���d����{Ƞ��^W�y�:��PBT
�1(�
p+�ϲ�Y9_��Q���ȧ�42�/�<ɪ$��߫ܖV���
B�Z@��l�8)�e��k���Z˧t(Z� �Ǵ����ZHi�P�� ��R�!)m���Օ7�,w��Ͷz���ϡ�+��}RJ-���Ŝp���fbۨ��ma�����BB��dύ-:jS��A�*=-s@�9{Z
i�=�3�4��Qڗ��*����)8f�L�+L�F#�8�{�.?pN�iΙ��2��9���9�2�9�T� 9�s|�s"ڜ�B��?5�(y�9-^�sz>zb�dDA��.�
cj at m"�>�Ƙ7!�FH��
+�����c���ɢ���x���`a��CJ=�'i�%��T�[�To���i��:I#�HU�b$��#	��L�
+R@�a��2R�U3����H-^��nF��i��K��m�����mT�/
vϺX�`5Z��,
��
:c��	��Z7iE����p����
�uQ;�e�R���p����Ж9Rk���6�5���oE�ݕ�ҙ� ���Y�Ï�Lu�!`���嗢]��Os�³���mEq|W���֬���+��*�
o�M
׺ˇ��;�$�%��P��=�G�*N�&�t��!4>m-�f �<���ȷ��<����\�m^&U�g�c�WŜ2?���"QA|��)�KI<�MEa� �,
2v�V���P�
Jš����TG|�K���-/m#K5�Nǘ	w#P��
+�Ӑ��������4��$]`� �
ֹ��s�@ �t>
̖ӂ��K�����T:.���Ӧio�8�ܼ�m�͐Y� 
6 �(�!�+�Ѓ�ˇ�
+F��4�Ϙ��F�ڠ���],���|"P�
�+�TFŤ����L_��M�[C�n�Q�1��e���%^\ ��AD�L��j_ .@���tF�gx#7KY�._�I*/��5�[��Dn�7y��z�1�Ӣ�u������U�֡~�� ʔX���_�6��:Dt���`ʷ��=
��cT���q
��z��L̜b��_4b�ܕ{m�h{��~Z���G�r(�d��ӳr�T}5A��z!��kn�ܵZ�'���j3��*
�-�]�Y��<*8���Ԏ� ��v�<x�_0����vO��qr(Q B@�L��b�����37.
��^���
Շ�_
+o�*�0%L�A�c��1����R|�%�;�m�=Km���͹�;��K+���G�=
6��b'�T�2:s��!����ᖔՋ]��
�V�	�Re�	�N7�"d���4U��|����ԯ
}@&���_́	�����f{���<`�?��v����k�
�ԗe^U���T�=��ő�ַĻ�N!�~r[!��e�ݧ��3[�/�(���[��7�]� 8�
źc+؋��]=��p0�ik�1(j���r���[Cl�1�ͼR�y#<��
+�a+�#(�n�@�u�A��V��X���U|}�&e��ouʕ{=�/s�a��7���Ps
��v�2'{}+?�d���j8B��C�BPs�n��㜎�\�|j��Z<ʸ�
+���U-I
��܍J�2P=���^��ߩ�;�w6���4���΋
��|�H�i[:pU�j*����l��ј�N�Rzr�
�f�D������$Jν��jHՊ�+��G��sl>����uWp���x�r�١���oq谾�Z�h��A�ٹ���?�)e�9c~Y�L�]����4;��� �R�\�� m�ړX�~kD��N�N�	zp��j{}u��ݗ2�+{��Eo�  �7�Gc�M^�I%�*�D:�Ȁ��$y
+endstream
+endobj
+15549 0 obj <<
+/Type /Page
+/Contents 15550 0 R
+/Resources 15548 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15439 0 R
+/Annots [ 15484 0 R 15485 0 R 15486 0 R 15487 0 R 15488 0 R 15489 0 R 15512 0 R 15513 0 R 15514 0 R 15515 0 R 15516 0 R 15517 0 R 15518 0 R 15519 0 R 15520 0 R 15521 0 R 15522 0 R 15523 0 R 15524 0 R 15525 0 R 15526 0 R 15527 0 R 15528 0 R 15529 0 R 15530 0 R 15531 0 R 15532 0 R 15533 0 R 15534 0 R 15535 0 R 15536 0 R 15537 0 R 15538 0 R 15539 0 R 15540 0 R 15541 0 R 15542 0 R 15543 0 R 15544 0 R 15545 0 R 15546 0 R 15547 0 R ]
+>> endobj
+15484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 707.957 155.859 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.357 707.957 180.337 718.861]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aa90416015e75acf0dcb0ffb98b023b9a) >>
+>> endobj
+15486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 674.83 155.859 685.36]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.357 674.83 172.735 685.36]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a02d1e51b7a8affe603ac7b98b728bc21) >>
+>> endobj
+15488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 651.914 181.871 662.818]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
+>> endobj
+15489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.369 651.914 206.349 662.818]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0bbdc3e9db50dea0c8354bab95c403f2) >>
+>> endobj
+15512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 618.786 181.871 629.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) >>
+>> endobj
+15513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.369 618.786 198.748 629.316]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aca824a578b979ffb69e85022a847aa29) >>
+>> endobj
+15514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 595.87 189.204 606.774]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) >>
+>> endobj
+15515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.702 595.87 216.999 606.774]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0eee2ac77a306882c5646ddc6cfeaf40) >>
+>> endobj
+15516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 562.743 189.204 573.273]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) >>
+>> endobj
+15517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.702 562.743 209.398 573.273]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a92b9e90d341774e9006bd56a7c9b650c) >>
+>> endobj
+15518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 539.827 215.216 550.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) >>
+>> endobj
+15519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.714 539.827 243.011 550.731]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a8e0d6f30e164f445ee75eee3f634ebca) >>
+>> endobj
+15520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 506.699 215.216 517.23]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) >>
+>> endobj
+15521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.714 506.699 235.41 517.23]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2628654eea57cfe7d07b3d3d9d563b45) >>
+>> endobj
+15522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 483.783 198.011 494.687]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a1df108cb7c2a626eaa0764c74cc509d1) >>
+>> endobj
+15523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 461.241 155.859 472.145]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.357 461.241 213.143 472.145]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_afe83427c5f1ad69dbc3b9a8bf22946c1) >>
+>> endobj
+15525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.959 461.241 247.723 472.145]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 427.74 205.762 438.644]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a3736962783853df4ddc48f73a786fb30) >>
+>> endobj
+15527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.577 427.74 240.341 438.644]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.322 427.74 292.086 438.644]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 405.571 166.449 416.102]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a7c2f551013b9639485e2dd2cd2b20ecb) >>
+>> endobj
+15530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 351.983 163.361 362.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.1 351.983 214.907 362.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5ee343513b3166ba11eb14ae041211b7) >>
+>> endobj
+15532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.244 351.983 280.51 362.887]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 329.441 180.198 340.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ac26b963b54a0caf2d13c3af01577a702) >>
+>> endobj
+15534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.013 329.441 222.279 340.345]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 306.899 252.795 317.803]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2e3095e400511537f5fa5c5c9bca4690) >>
+>> endobj
+15536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.132 306.899 318.398 317.803]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 284.356 229.552 295.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a3a8a4fc58571becf60983f083b711c83) >>
+>> endobj
+15538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.89 284.356 295.156 295.26]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 262.126 266.673 273.03]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aebef0c6c47af055bfb03332886019aa1) >>
+>> endobj
+15540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.01 262.126 332.276 273.03]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 239.896 196.347 250.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2cd76c051063496368e5b7519398b963) >>
+>> endobj
+15542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.684 239.896 261.95 250.8]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.1 217.354 179.739 228.258]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5a57714c7c7e5222664f1ac298ce3871) >>
+>> endobj
+15544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.79 142.701 245.959 153.605]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
+>> endobj
+15545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.256 116.486 295.178 127.39]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5534b8f8fbd973bfb7051cf5fb31f19d) >>
+>> endobj
+15546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.269 90.271 347.203 101.175]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5c3bee913efb87e4661df746e184e1e1) >>
+>> endobj
+15547 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15551 0 obj <<
+/D [15549 0 R /XYZ 89 770.89 null]
+>> endobj
+15552 0 obj <<
+/D [15549 0 R /XYZ 90 721.073 null]
+>> endobj
+15553 0 obj <<
+/D [15549 0 R /XYZ 90 690.609 null]
+>> endobj
+15554 0 obj <<
+/D [15549 0 R /XYZ 90 666.341 null]
+>> endobj
+15555 0 obj <<
+/D [15549 0 R /XYZ 90 632.84 null]
+>> endobj
+15556 0 obj <<
+/D [15549 0 R /XYZ 90 610.297 null]
+>> endobj
+15557 0 obj <<
+/D [15549 0 R /XYZ 90 576.796 null]
+>> endobj
+15558 0 obj <<
+/D [15549 0 R /XYZ 90 554.254 null]
+>> endobj
+15559 0 obj <<
+/D [15549 0 R /XYZ 90 520.753 null]
+>> endobj
+15560 0 obj <<
+/D [15549 0 R /XYZ 90 498.21 null]
+>> endobj
+15561 0 obj <<
+/D [15549 0 R /XYZ 90 475.668 null]
+>> endobj
+15562 0 obj <<
+/D [15549 0 R /XYZ 90 442.62 null]
+>> endobj
+15563 0 obj <<
+/D [15549 0 R /XYZ 90 419.625 null]
+>> endobj
+15564 0 obj <<
+/D [15549 0 R /XYZ 90 366.221 null]
+>> endobj
+15565 0 obj <<
+/D [15549 0 R /XYZ 90 343.868 null]
+>> endobj
+15566 0 obj <<
+/D [15549 0 R /XYZ 90 321.326 null]
+>> endobj
+15567 0 obj <<
+/D [15549 0 R /XYZ 90 254.323 null]
+>> endobj
+15568 0 obj <<
+/D [15549 0 R /XYZ 90 231.781 null]
+>> endobj
+15569 0 obj <<
+/D [15549 0 R /XYZ 90 158.857 null]
+>> endobj
+15570 0 obj <<
+/D [15549 0 R /XYZ 90 132.905 null]
+>> endobj
+15571 0 obj <<
+/D [15549 0 R /XYZ 90 106.69 null]
+>> endobj
+15548 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F91 766 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15595 0 obj <<
+/Length 2739      
+/Filter /FlateDecode
+>>
+stream
+x���n�8�=_᧎
�
/�f���v1�m6�<�C�hG[YR%�i�?��<�n����0�h�:<<���l;�����=�x�YD"�����,������ÿd��a��b�`�R�zΨW�xy=��)��;�T��tU����%N�]���e3�����7���H�p���
P�#��쎫	 ��ď'A���u=_p�:��;rWfq#q�Fnd5g�#�5L
w
�2���g����3���H�ֻ���Yӿ�(Q8�כv3�
xf�wg�:��Ȁ����aH
��#pC��5`�9E#׍L G
:���
+���7�|ݤE^k
�3���O�t�+��H��C�8����/<��(23��[mͽo�E��^;����='^V2ٯ�0���(��x
�6��Y��H �����قy�
+����f_�u���vA	�esS�%��$�ݔn�8OpP���`I�퇽�݀�@K��J�".�i��q��'�H
+iD2/��JM��v6_��/�.�pBfr'�&:��
�N�L��
���5M�s}]dY\����y�nsi�	8/������ZK�7���� R/r��
-�
�(�D�,
rI�
�O�
�o�����,��=���:(�ZyPc��@�n�
��|�2��x�2�zPl�������E���t
�ç��@!/�3�HL�~򫹋��fF~�[�k��+�!����+�Q�?���F+c�/��k+Iq�bhF�����.S���,�^ ԋU�ϓ�} ��2�JyR a� �N�֗I�%��rU4M�k	�,+Y�곲���UC;��^��Er~�fO�ق����� ���&%w�ܯ�DYA��6�m
�񍞢��i����_⡖
�P�h��L���/�
|b]�wi��H	��
�h������'-�(B8iL.�K����}���{ʸjR�Ѱ���K�m�@�3wBSX�>�S������
#�=�7�b=��� �֣��1��ȣ"�qy��<�����X��E)��DaS�E���o�D� �?.����De�_�o����__@u�x@��H��d �'^�Y��R����u�C
+�|[��\��UT4q
+�cT����5!c*n�� �L��4�*㴺Ok���2{X�-���(��bv�K��`^<�}ϊ�"`xQd����%,#�!
�Q.�&�1��F���������4-�Z��bJ�UHb7ZV��
��
M�O#R��o��bO N��}|8a�����Qf��������ǯ��JWjz���K��~� F��'�~����N���-�~�h��"KZ#[����^i~P���d�E�	n�t�`�Z�
T�y3�b$�� �x,�
�D�1�x~m��s����)Z�(SȌ�,��Xr�(4�'�������G�Y�2X�e���6'�����l%
+�{(yd�;��t����O_M �H(��Q�
��Q>t�u�\^uS��D?/�k at Qv�Ը�	b%Z�{��`
��"�N`R�?.�}���n%

�{K�G@����p���À��)��U�� ��Pj���_"���5�
�5�[ю�f:0W\}f�����UZ>ʐ�nj��P,7RB1�� I�n4!�
+�	��O�G�:
p���4k ��������U4�nH���d�5l�<n�p�
z�'�	2�;р��&�
+���<(@�������;k
+���3�]���@�(?&�!aCr�8>d�.JV4�O˾6v*\�b�i�����Z.2����)'�b[m��
3U�p�qX�����t�
@l�h\�qz+!>N�8�����7��D&�S�m4�#[������	��u]����DNlPJ�����I�s�
�d��5i�BK�hh���OE�0��02��d9͙$�kY���Q1_e��-�}4�Eߖ$}�׫�[�,^efz'��"1 4��/��\%t
���a�H=���r��
+����ʪP����*M�
+ig--��n��M	\�%nce8*�2�6����,N�y]J� ��贈a�
Ö"d��9ot�;�4)�����
��r�!P�S
ۦ]�e���݌Tĺ�3��o��� 쎜Ћ  �ku��R��
�I�]mC��wAB�
��h�v����:�1���`���6����H����M
p*%��4�1�W�u�LE�$�����M���螺a���d�Ó��
+R�:Yu�z���Ϥ*J\/r����]Q�E`�
Ĉ)��h�����
���
�؜j��L�O-%	����G{T�*
�
�7��U��"�
s�Y^Y����K��a�Z���:�J����a�"�`�O��hgN�T�
�rd,F�.d�^���T,��oC"�,| �����9S
Z�ǔ���{�:�}fJ�w�v*ێ躰��R�<�mA����6J�#��"�$?�:}D0A
�{�E�) �� 9PǡD9?4�zx��8ʇ�E�U=
+Am�5DN�㰴_\�!쵹��~
:�ꕉct�Q�
��a��n0TV9�)�w�vr��$nY�W�~'U׉^(i/�~|1ׇ���Q�����X�
li���Ɵ'�
,�x��I:
���TY/�����p�G-��gˈ��y����@�T�$#��d�fc!�*�Z6!�gv�+�I��
P�v�5Myyq��ok�o	(���w����7��cGu�
&wq�sjZZz�reC
 �'� �]dT,��zѾh&.~މ�UD��/-g�~
+endstream
+endobj
+15594 0 obj <<
+/Type /Page
+/Contents 15595 0 R
+/Resources 15593 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15439 0 R
+/Annots [ 15574 0 R 15575 0 R 15576 0 R 15577 0 R 15578 0 R 15579 0 R 15580 0 R 15581 0 R 15582 0 R 15583 0 R 15584 0 R 15585 0 R 15586 0 R 15587 0 R 15588 0 R 15589 0 R 15590 0 R 15606 0 R 15591 0 R 15592 0 R ]
+>> endobj
+15574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 685.162 210.607 696.066]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ab31df347be74e19c85e0ef3953a63d9e) >>
+>> endobj
+15575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 657.088 168.555 667.992]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a1e718bbe851af32e715da7b02afe166f) >>
+>> endobj
+15576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 618.055 144.674 628.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.173 618.055 332.409 628.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a3c49109381987d2cf7272562566833cb) >>
+>> endobj
+15578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.143 618.055 417.907 628.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.888 618.055 469.652 628.959]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) >>
+>> endobj
+15580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 589.98 321.152 600.884]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ae61b8233ebbfce8a9feeb4018265b734) >>
+>> endobj
+15581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 549.951 226.666 560.855]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a635cce5ca8b683b44ed7299a31fb5646) >>
+>> endobj
+15582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.004 549.951 292.27 560.855]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 479.726 154.079 490.63]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) >>
+>> endobj
+15584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.578 479.726 193.083 490.63]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5d2c2fc2c077e77db657af49d332c9b5) >>
+>> endobj
+15585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 453.709 167.639 462.556]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_ad34bafd07f582c558936f9ea8892abd6) >>
+>> endobj
+15586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 342.194 226.034 353.098]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) >>
+>> endobj
+15587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 342.194 359.442 353.098]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 302.164 226.034 313.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) >>
+>> endobj
+15589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 302.164 359.442 313.068]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.162 203.365 513.996 214.269]
+/A << /S /GoTo /D (index_powerset) >>
+>> endobj
+15606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 193.467 125.865 202.314]
+/A << /S /GoTo /D (index_powerset) >>
+>> endobj
+15591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.08 173.785 366.346 184.689]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15592 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15596 0 obj <<
+/D [15594 0 R /XYZ 89 770.89 null]
+>> endobj
+15597 0 obj <<
+/D [15594 0 R /XYZ 90 704.246 null]
+>> endobj
+15598 0 obj <<
+/D [15594 0 R /XYZ 90 704.246 null]
+>> endobj
+15599 0 obj <<
+/D [15594 0 R /XYZ 90 674.437 null]
+>> endobj
+15600 0 obj <<
+/D [15594 0 R /XYZ 90 498.81 null]
+>> endobj
+15601 0 obj <<
+/D [15594 0 R /XYZ 90 498.81 null]
+>> endobj
+15602 0 obj <<
+/D [15594 0 R /XYZ 90 469.001 null]
+>> endobj
+15603 0 obj <<
+/D [15594 0 R /XYZ 90 400.511 null]
+>> endobj
+15604 0 obj <<
+/D [15594 0 R /XYZ 90 288.389 null]
+>> endobj
+15605 0 obj <<
+/D [15594 0 R /XYZ 90 239.67 null]
+>> endobj
+15593 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F39 2335 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15623 0 obj <<
+/Length 1421      
+/Filter /FlateDecode
+>>
+stream
+x��XYs�6~ׯ`^Zib� H�p���J2M�č��C��P"�%	��
�3��]�D
V\��L� ��=�=@l]Z�z1�v:8}�;V�B�x�ti����Q�b�ݐb2�0}i9^���*=�ݛ��g������tp5�a	[�a@�X�t���b�~ia䄁�IoJ-�8�L���O\ɂQ�6
+/̴ook9���w-g�
/�|�F�mdZ�B�S3�ލ=���1��|˽e
��6gY��m���+$S�'O�θbE������y���%����g�h����� �2�3��}J�j��4{J�G�Z#�Ⱥ�d֘`�=�/w����l�3�0���T�Y.�r����1z�c_���,���U�P�sI�� q7x�D�\����C�Y������Q.�>�p�6cj�L?�P�bi�D�z[$��f81�t%���tx�㚴�I"F�?��"c꣈%ZӢ}��b��A⥰.��Ț�T�3�g��=�}^�o�PQ2�hy6��*&{ ��3��0�Bd���1�wM���U�U֋̣2
+��\��(�"�Q�k���fī]FxC�����b�s�T��
ԉ�[�4��%�(% Sdÿ���]��
�
�-.gJ�;ݣ�������k7:r�N�X�-܈�\lכxe���[RY�/�n�(7���KX
+ig�wc�F<;���4��C�粒PJ��%WUy��,l�ܶ�Eh\�/�����oۢ���:$>�Ɔ���l��
�]l8�G�� 囨�'���c83ӱ^O�Dqs��Q(x3�7�јo�v��B�A�2�Z�
O�
U�0�ҨR#���6uAv��Sg��>`�+�@CZ�K7<����".u9�"���)�"��}"���b]ø
څX%q��y-[@{�;�c��BOAܵ(�<>,�WyΊ��
fО������Q��>�N��s�jT�2Z��~h?`ʤ�	
B��W�]���w<�� .���iʘ�����>��+
y��v/{
сPG(	�YZ߼��v@����w��N���R5�8(vR7?��U씛�
+<�Fʾfݯ����
��B�� _�_U�\3En>K�]���o�m�G����=~�
-R�ggB��Ei���>�T/�o
�_
+��*��^��F��h��ɲ�*^[W|�D�$>
+���~�{#���7��'O��Wo����?x7�<�B��41|���j�w{n�=�W��2)* ��/������&M�
Q:��aA�\��
��—��D,Y���М��9�C|�`CC��
+�
+l�>ыݱ^�i����Sǚ`ֲ�q�P����s�U(�>t�ܝ��`?KV����Q�����e�f�l��l�ځ�Ō
/X�����[#�+9
�|
�j��Q����t���*p��/?=���[[�W�TM���T�
�	
K0
+endstream
+endobj
+15622 0 obj <<
+/Type /Page
+/Contents 15623 0 R
+/Resources 15621 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15439 0 R
+/Annots [ 15611 0 R 15612 0 R 15613 0 R 15614 0 R 15615 0 R 15616 0 R 15617 0 R 15618 0 R 15619 0 R 15620 0 R ]
+>> endobj
+15611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 609.194 157.945 616.721]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+15612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.137 609.194 250 616.721]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a6e970db12e0581dd7014d8cb334adaef) >>
+>> endobj
+15613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.925 549.2 137.024 556.726]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a5ff03c3a22a89b7fdd332a5bdb3ca128) >>
+>> endobj
+15614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.925 497.332 149.577 504.701]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_abcd9dc4a5540f148b05c786b2d563d07) >>
+>> endobj
+15615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.925 445.15 187.235 452.676]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2a875ab79a20b1421a1bfde273b984e6) >>
+>> endobj
+15616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.925 381.17 187.235 388.696]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a3a8a4fc58571becf60983f083b711c83) >>
+>> endobj
+15617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.925 329.145 157.945 336.671]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a2cd76c051063496368e5b7519398b963) >>
+>> endobj
+15618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [109.925 277.427 120.286 284.646]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a1d52d042b5e633bc5444947ceaa65cd4) >>
+>> endobj
+15619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 207.471 132.839 214.997]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) >>
+>> endobj
+15620 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15624 0 obj <<
+/D [15622 0 R /XYZ 89 770.89 null]
+>> endobj
+15621 0 obj <<
+/Font << /F73 560 0 R /F75 562 0 R /F60 540 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15631 0 obj <<
+/Length 3043      
+/Filter /FlateDecode
+>>
+stream
+x��Z�s�������Zr�<����t���N�d���'������ ����{<	��J�E"�ݽ�����.�����_W��\�~��� #�����
�)n����>�	F�-�c<� x����ӻ��b�xo�2��C�*����:
�Y��l��x��뷄����
�{�
S" K�L3����nI��,�n��Z,��󛅡s��m�چ���-D�m��!%(�
�
ѫoo�~�"@�H������W>�Y
+���0bF�
���S�7��W?]�� �p?ݿ�册��+�v
Ѹ�?��
+�[R�Ax��;���0�X�6��:+r/�4OZR�7�D&u�#�[��T��k �B��j/O�no��<;.�ztx���0�S

�U�^_o�jJ�$A�'K:%�@��sz�i3�"� 12Z�{�tJ�%
aifK�##��u[�������強��]�y��1���aW�]�6�8���o%�
J�@B)PG�>������+T4;�G�h���u�n�0��I�W5b���6���
+9��	��<�w�pM�:[�7I�{��P��ѳ���}UǙ�ݮ(�h(�
�t��0���4=�,�I� b��U�Lq�ң��|��
���P �Z�k�
����1
``�
xx
+
(�@�iPPHz�T
��#�նL�<�ljb`\����pS�B�B�!HS���'����C�
K�N�<G�Ȑ��'�pM��_
���A
 M� @�@,i�u��C��:�I�<�mt1P�c�F���mPMET�d
L�e�WA
��}�oWT.���$]��1�
��`��]�*K�`
>�D�lX����}�4�����u5��$��ipyU�g�
>������߉�>Bm@ڥ�3&�mԎo ��,�*���O29|w���~
���3m�v3zb�)�$ϋ:�Z�0V8T�����������)�>Nw$��' �^EF�����e+��om}_�Ց���.�e��Ԭ�,p�n�;W o�)us!4Q���3�$
��� �T���feU�
+��F J��aM��A�]���t�*h��}���Y��&j�ͫ}�7����E�=<�ú7�F�����{��dY�t�~�3\F��1���D(���Zp�ώ�����N�)��} v:����"K��b�45]P|�F��炼4�P��[{�L8k��2I����s���H@��%lGt^�8
[,
�so&~����=�
T��
��Bm�e�u�t�J�X7�
�
�<��{"���m3/�>�T�ߟ�1��KQ�~�
`��q�2�y^��m�%�&�M���U��O�)9�'�	rү�3���
P�
���F��ݩ�iҸ����g-�q7c�]C�a�	y
 P��0o 1��n'��:�W�Y��Y磃��W࿿����1J�<�ր�w6
��~T��l0{

K�+m��(&���j�����#��]��
McȐ�Kɚ覲[8�l
Z���
,¯8}��P :\N%M�E�&��1���M
+ODpqy��~~C�m�)��CL��!�g�7w
@{J���*�1�2U
N�^���	ؕ>Ӥ���<�z�\�>

S�_F��Nn��_����
+ܭ6���	Zp&
�5��8�u7�3����ӷP��`|���}�H�1f�/��^G"�]p&'��x�w
=� �R/ ɔ_���痦rR��jq5I��m��4Ihi���>�m���IU��
+��%|�SwG}���D�@��b��Ѱ�t4�H�`�%�#6ϻ�lU�)/cz��RP�c;�UB^��hd��7r�Yy`
�L���Q��K�հW�����
��X.�K��@�ٹ�ov;�����}y.O�g
�O�~��K����U0qԵ.����-�"�
P�t���o%�@��G�?ʹ>ӗ�Twe���P,��D�7��e^MI�f���ޞˠЉ۫��b�VP[�'��X �헵ݹ�R:�����N�CJv���[�Dɽ#��4�H�R�r�5 �"�
��O�$�w=�~���@`
��vvۣ@p
+�d�k�hRsW?������&K?%��p�o/chr�@(�Hcvѕ� �����R��:�`�yʆ+��/C�"F���-�ȟԼ˶b�S�E-�|]lwI��6�>-�\��
�<nB at R(sY�|ͳ�5"g��0��/Hks�����#�%.[�p�,�Y)�1򹦑^��	�P��Ϗ.B<{��o�.�|"��.���O���A(�>v(_^LE��5�\��s�|ij��&
a2�ڭ��.��"	���˥�i�8'�Q#=)�b᫩FLp6
+Q"/��b
<f�󮴮uf���D�x
��E�3�#�����n���$1	�o¿ɠޅ�5�������L�/��1g��*
+-]��U}�B��ɓ������S��[��
KF�E�(�zj���)�GYH��IA\-C]$�`9LA0
(�a��H�Ez���9\�MU�>A��N
��v*ޯ|9}SŤ:"��
�t�!�0�W�DZ������x8U	�%����w�S�1�(zj-��k
+k��}"��k���Zt�
}KW�
᫇��� Sv�1
@��뮤�)G�o�<�0ie�k�)�'�kTZ�M�UAC�ş
+bTsh�'�i��X�Ŭ_��ܯȍ��V6
��-`�~}n�Wp���M^�~�&i���V�Y�dž\�,IӬi��-w���H[L)�J�ӚĻޯ�s�{ev���#�+%F=��W4�
�h�z��M�B�@F��>r�7��
o�����.QXw����5L��������G|��C�_b�6s����v��y[�=V���9M��گ׶�n����Hl��m��B`6u߸��}�D���v�7i��M�<f"����Q5�ݻ�Bd�ׅ 
�L�}���B���V��u��3�9Pz �[�b��Y��ߡ
��u{���wׯ_��w����:����[��u��m�߸-��5�ap�t�W��mr�!$���
����@
�3������8���-��)`�
���q/�
+endstream
+endobj
+15630 0 obj <<
+/Type /Page
+/Contents 15631 0 R
+/Resources 15629 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15644 0 R
+/Annots [ 15625 0 R 15626 0 R 15627 0 R 15636 0 R 15628 0 R ]
+>> endobj
+15625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.255 563.795 379.521 574.699]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset) >>
+>> endobj
+15626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 534.839 282.279 545.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_afe83427c5f1ad69dbc3b9a8bf22946c1) >>
+>> endobj
+15627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.458 534.839 513.996 545.12]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a3736962783853df4ddc48f73a786fb30) >>
+>> endobj
+15636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 522.261 120.884 533.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Powerset_a3736962783853df4ddc48f73a786fb30) >>
+>> endobj
+15628 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15632 0 obj <<
+/D [15630 0 R /XYZ 89 770.89 null]
+>> endobj
+15633 0 obj <<
+/D [15630 0 R /XYZ 90 721.073 null]
+>> endobj
+15458 0 obj <<
+/D [15630 0 R /XYZ 90 702.288 null]
+>> endobj
+15634 0 obj <<
+/D [15630 0 R /XYZ 90 702.288 null]
+>> endobj
+15459 0 obj <<
+/D [15630 0 R /XYZ 111.081 623.119 null]
+>> endobj
+15635 0 obj <<
+/D [15630 0 R /XYZ 90 618.536 null]
+>> endobj
+15637 0 obj <<
+/D [15630 0 R /XYZ 90 508.687 null]
+>> endobj
+15511 0 obj <<
+/D [15630 0 R /XYZ 90 486.31 null]
+>> endobj
+15638 0 obj <<
+/D [15630 0 R /XYZ 90 486.31 null]
+>> endobj
+15572 0 obj <<
+/D [15630 0 R /XYZ 305.44 405.228 null]
+>> endobj
+15639 0 obj <<
+/D [15630 0 R /XYZ 90 398.588 null]
+>> endobj
+15573 0 obj <<
+/D [15630 0 R /XYZ 321.092 331.433 null]
+>> endobj
+15640 0 obj <<
+/D [15630 0 R /XYZ 90 324.793 null]
+>> endobj
+15641 0 obj <<
+/D [15630 0 R /XYZ 90 254.087 null]
+>> endobj
+15607 0 obj <<
+/D [15630 0 R /XYZ 90 205.742 null]
+>> endobj
+15642 0 obj <<
+/D [15630 0 R /XYZ 90 201.258 null]
+>> endobj
+15608 0 obj <<
+/D [15630 0 R /XYZ 360.931 84.126 null]
+>> endobj
+15643 0 obj <<
+/D [15630 0 R /XYZ 90 77.486 null]
+>> endobj
+15629 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F75 562 0 R /F60 540 0 R /F94 771 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15648 0 obj <<
+/Length 2475      
+/Filter /FlateDecode
+>>
+stream
+x��Z����~���D{��R�u�:Mb'�~���;��H�_���/ݞt���I�rwfv��	#*w
l>�z��#|����|
�E�bI���v�E�c$$|��K����շ
&"��Sv�/o��懫����7W�\x��(R�tq�/2X��X-����S�����/�L2+QL$"�8�C
�՚`����W���F���dz2�����+�cF;B6��.��^�)�����[
:�:@�#���qE���3�o�f�PL�~���rE��^׍n��B��cw��I�@��1�g��l�l-��fL�	"k��cv�(V�`�Ƕep-�Se�)8>O!��<oʶ-��J )��U)$A�S�Y���+��1_N1��:c5$D4c\պ��j��u�� O��rk.	�J̘�:��6+�8�'�f�5�x(Y�as,�۝�E��N������k�)#'���,�ܐ��7 S�RLC����n�΋]^�b<�
��� )� [...]
�ۼq{fܩD
O6i�t꤇T�pt��M��H�j�����yq"(&),D��
��^-E�z��2�p��z����;�"s.>1������Xޭ�2Y
��c���j�y���
�7�c�h��L
9�'�������ѷe�݋�p�y���T
(&i�B��-o�{�ͮ�u�-30��y�^��]O�G�쪞^ӥ�n��n�ok�ڿ��]
]�9A�D�h
,�@.f � ��<��/���Y��C�R'�?����l�"f�d�ò�̋�&�@��qH<�
+( �U� 9���`�m��-�P���E�s��
+��S�/�&�+z�pc�;m��L��#��wȥ�L@�c9���O��fS%y}�7��M�% �$�(��sLA�)@8C�c/\RU�!!�L��9XS���s�`Ú+��c�J�0��
:B�0�6��?�$�X�����J�
`
��mGsxD��
f1�>7��Y�CP)��8sJ���gu���^V�$E��O�� {J����C_}l7�����p��z>Fr��}ጦ�:$�U���Ӏ$ �n�q�A$�A2ycAA!#�
�5��
dJ|�!3�7�CC�"�"��c���5a�g��HEr
� �CR��-���Ǖ�$S�K��)V��uU�����2��&���n�dE at G�����i�Q�E�3��z�`�EOҭ�f
���
̯u�-]�m`
�=�
��XG[�{���N
ֿ/��
�
z1��O'�r��
+�An���\I�
VR,���D*p
H0
�[s��_׹.l�	=�
�7��O� Z���
]#o��2�y\�1�OsI,�����E䷄�4~
+ҋ1ҟ�ט
�k�l�)�����Q��}��x�#fhl��
+�
+�:���E6B����
g�M,����b�`y���D}a�D���i�"�L����(r"���	����

��v
��F07�Wܷ][u}���C<+:�M/$�?"�9
!��!WÌqV:\U.�
��s�tX�=��'�˝.�k�lR�����
�~P��Nof2�2̙�BƂy
P*滮��0�n��eg�K���>CH����J$�>	4� ��R
����iS���
5P94�
�hha&zftY��~�
2
+t�
+|�,"Px�R�E�.��}�����U�|H
����-�d|
ibj��L�7�K� h޷u��=��t��T�s�
��y��1��x2
+D�Ϙ����B�^@#
&����h���%��b�]N �3B
pēeG�J�I��Q�+ݤu^=B����U١��̄�lc��>G0FlGa���i!컼ٺ��k�?aR�1tY7���u$jm
�!�������
w�,���a��j������Mq��

+]U��$���˓��t�x-���|#��!>)�6����s*
���W�{�C?����!-n�����������$뽑C���B�Y��`�YXC*3�/ˮȞ�R�6�ga�7��4�;i:�N��M/dx���?O��Kv��&�ű<�mt�R�_�L3���<n�$x��:%��x
�Tg_�X$
�x��v�/mF�k7O���c�5Љ��BN�>p0nF��4�7���
��1?�3�Ӆ�[s�)b�KuYչ��,���<?p�^�
G�!���⍳܃gZ�,�y7��Mu"��N��ա��nPB3�a�Fqn�R�1�K�>��Pl�&�yW�C�lK?��wv�u at j
��D�[��}��_�������kr0��3��/��1�"j_N�����_�|�g�W%ɭ��z$hc\U��$wPX e��W�w�s�ht�gӱ{����A[���j�K�j�Lׄ ��)C}�8�~
D�����D&����zm۶�\^�tw�.�P���4���p
�x
�~_ [...]
+endstream
+endobj
+15647 0 obj <<
+/Type /Page
+/Contents 15648 0 R
+/Resources 15646 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15644 0 R
+/Annots [ 15645 0 R ]
+>> endobj
+15645 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15649 0 obj <<
+/D [15647 0 R /XYZ 89 770.89 null]
+>> endobj
+15609 0 obj <<
+/D [15647 0 R /XYZ 140.132 647.468 null]
+>> endobj
+15650 0 obj <<
+/D [15647 0 R /XYZ 90 642.885 null]
+>> endobj
+15651 0 obj <<
+/D [15647 0 R /XYZ 90 533.63 null]
+>> endobj
+15610 0 obj <<
+/D [15647 0 R /XYZ 90 511.254 null]
+>> endobj
+15652 0 obj <<
+/D [15647 0 R /XYZ 90 511.254 null]
+>> endobj
+15653 0 obj <<
+/D [15647 0 R /XYZ 90 453.111 null]
+>> endobj
+1971 0 obj <<
+/D [15647 0 R /XYZ 90 373.143 null]
+>> endobj
+470 0 obj <<
+/D [15647 0 R /XYZ 90 364.495 null]
+>> endobj
+15654 0 obj <<
+/D [15647 0 R /XYZ 90 289.551 null]
+>> endobj
+1972 0 obj <<
+/D [15647 0 R /XYZ 90 171.47 null]
+>> endobj
+474 0 obj <<
+/D [15647 0 R /XYZ 90 162.823 null]
+>> endobj
+15646 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15662 0 obj <<
+/Length 2490      
+/Filter /FlateDecode
+>>
+stream
+x��Zm�۸���B@��
�\��Z��M���a/�~J�֢��ْ#�I�����z�w���`a�"�Ù�<�P��c���_}wu�:aQ�RIet��R
%� AIt�G�c����%��w
���e����i��:��C�Pg���ͻM����Q�ntm�.�Ǐou~X�EU.~����5!��ˆ�	�c��2P
+��,�FܒW�%8��3�A
+��c�}V�_�Y�8y����z��f�6�%c�TFKBP*���V���b�r�8V
ىX��_}�2��X�r��vW��Q��G�TE_�]�)��m����+�}�
+�4?�c)y
�#=�	D��nu�[�����fU��'���%���Il{&��y��u���`��i��l�A��o��T��q��ڌb�(�$���
GQ��`���(�n%A|;u��e�Y�f�
a�.�8��d����ò�9�V
E�Ĩ�д5�-g�wz��=�
�p*���^D�|f/%3
s3�^ba��D���A���^ׯ\<�������ܱ�)����a��	I�/4#��sJ.�x�'/��c;~�}�
d����f�2�?�vo,K�W>�3
���j�iq}�:�����ua��(;]+p�ht�/�
��޹�g�'�h����$\�v��Κ��� d'x�`w��d 8
����5!c�F�0fՂ���{��h7աuE�:�5��{l��5v��f*j��
%>�Ľ��Ϋ�t�s]`/|Sx5Cr2�X��_<�R�`��O��]7WwҶ[���4l�n�� ""g
+
P�$N���Q��p�ߢ�ƽ`�
TgljC��j�9.D��B��B�DJ�HH�R{���p�LLO"1≰���:=���Z;6���H.������(�M�����Dz%��P8�C;Ԗd��iBd����^D�a
9bDk)���	J���@߻@۔�Zx�v(�(N����-Ix �
�� � �@g(�*0�E��#����
��^�d{��H�!�ڬR�]�
+��syHC��'���*
�p[Q��U
2K^�D��! �ן 
n�
�~
�k k at e��dL��eZx�V�\�3f� �1�$�W��� ��+G�Ի
d�~}(WP~�S!9B�t�$9��R?�c�6�ˉ��O�.;

�^)��%�=��B8�pD|���uv�z��`: �9t6
�4
+Ҟ��϶t-r�nf�>n�N?zX>��[��&���
S����,Q���A;�7
���	
'�tU���h�=�;?�U�[�pL�[���!Y���:dۢ-�JI\@�(
>��ݠle��xk����]ր!/�����8he����n��R����:y�0�	ޖ�����`s|�91��V=��K!i��u�E'�i���Y{5���^�ݙs�غ�,��uQ�G���=
d����!y}�
��5XjPV���>�$ȃã?w��&M�~�r��ѳ?��éCzF�q��}&�$y�: �dϧ`#�
O��DR���Ad}�
G
+�)�V�LՋi*72�\B�)bx��Kh*�0��K��1�\ch�gX*�	�.�>O� �8X���+�?eg/*�R4�STK��DUjX���/E	�#>t"���@Zy�

-gu���C�չm�U�M����e�*�e$w?j���>�d���LJ�Ӟ�m�R�W�<v�2mO��@���2� bAb��0ٓ�}f��f"kW�Ů��΃h���3�C��
ٸ��Y�
܋4~m�Wy.0����
+&E
 �	�6z�k3���5�-��'��)
+3D�\�
<q��O��]��ŕ�_j��L[���C�6.Ơ�����b��4�4�4��4~�v�a�q��9�l�B��|W��E�~L��A/����^<>X��jW�����yg��U�}�{��߇�혦� s�2�ĵ�FUؖLE�S���Wf�p��m`��i=$�Y��ۑ
�����-\{�3�nr��l
�L�
��s��zR3Wz�3��{9���m:Cy�A�s�G�|�$���ı��L�/g�Ѐq<C|@y�C���P
_ٍ?���1����3%�1���ʞ:�3�<A����`g/�ϱ����-$�Yx��(�	�2�`�5\�(��V��
8�-5D���p�t���o�}���J�(^�
��%�p����>%�B��@'r:'�[�ZgT�LHpW�[h��
p9�;9DLx4ŷ/�!�]���PxK:(��
?$+;�0c��7<; Ԯ���n��.#f�~۞�˹d�S��!�³����B��#tX{��8�W{:����}I������_t�C�MX������ ���Xw�k�~�=Wk���K ����
�=4L��D�
+C5b�ww?�ƿ ��y!D��1+�˒����&J���2Q��Y���):����?���Q
�`���\_?

]>"0��`���)	�'p�]�ٻ(�g/
8�KE�-vw��`�O D�$�����e7�w\�ٱ�#�#�� �y�"
+endstream
+endobj
+15661 0 obj <<
+/Type /Page
+/Contents 15662 0 R
+/Resources 15660 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15644 0 R
+/Annots [ 15655 0 R 15656 0 R 15657 0 R 15658 0 R 15659 0 R ]
+>> endobj
+15655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 452.291 233.78 463.195]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_ad5d7e854d7a70d0bfaa9d04fa0127454) >>
+>> endobj
+15656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 425.904 197.875 436.808]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_abdb0ca782331e07ae621657aaa308810) >>
+>> endobj
+15657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 377.599 241.529 388.503]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_abecc6b6a4233ade3181b254fe7c005f0) >>
+>> endobj
+15658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.021 253.616 392.442 264.52]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+15659 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15663 0 obj <<
+/D [15661 0 R /XYZ 89 770.89 null]
+>> endobj
+15664 0 obj <<
+/D [15661 0 R /XYZ 90 721.073 null]
+>> endobj
+15665 0 obj <<
+/D [15661 0 R /XYZ 90 667.692 null]
+>> endobj
+1973 0 obj <<
+/D [15661 0 R /XYZ 90 591.19 null]
+>> endobj
+478 0 obj <<
+/D [15661 0 R /XYZ 90 582.252 null]
+>> endobj
+15666 0 obj <<
+/D [15661 0 R /XYZ 90 470.53 null]
+>> endobj
+15667 0 obj <<
+/D [15661 0 R /XYZ 90 470.53 null]
+>> endobj
+15668 0 obj <<
+/D [15661 0 R /XYZ 90 394.105 null]
+>> endobj
+15669 0 obj <<
+/D [15661 0 R /XYZ 90 352.564 null]
+>> endobj
+15670 0 obj <<
+/D [15661 0 R /XYZ 90 291.629 null]
+>> endobj
+15671 0 obj <<
+/D [15661 0 R /XYZ 90 175.276 null]
+>> endobj
+15672 0 obj <<
+/D [15661 0 R /XYZ 90 152.899 null]
+>> endobj
+15673 0 obj <<
+/D [15661 0 R /XYZ 90 152.899 null]
+>> endobj
+15660 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F22 2982 0 R /F75 562 0 R /F94 771 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15681 0 obj <<
+/Length 2339      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��~�_!�@*1�w��E�6���dw���c
�%�$�`��{x�,ɲ禶�$�:<<��|���U���/�ys�滄EiIetsi
%\#!�i}����o~��T�h	o��o~����_n>ؾ�oo.>_���JT��^|�
GKh�!ˆiݻAۈS�M���
��E�.� B��7k3�S��m�g���f�E�*�&_�nWUm��oi>aL�,_�纑�,�i��{�1[��v-`
�р�%�U/��Ӓp�o�d������«�X�ş�)��+�%���>>U^��2�:L����9k�$A��h��B���=�3��Ei�*�eh��i
�� wMWhX�D��3�n�����v�����
�$
�T��9��.��du�va_���3.���7��b�_8��{���f�Ǖ����vW?��{F�d��&�A�ɠ=�ET3��[A���fB��Ѝ%?2
rz�	S��t�tֱ�
�-��\�
���۱��8S�g�U��	ޤ��{�'�}� /��Y�:~��~�.�~�"
�T#JB
�6
��CJ$�v_�~ �5#"��-�䩿�Nv��:��� %.m��s*p|W�[�У�������=@�&�ȟc�!�!�]�(��2�pꌐ��^{�{}��™d
���DLj��ߕЬ#I�ؚ��
+�}|�@/��E�{ ^I�t�ﴭ����J5��'%�4��A��٥�}j����=�� �Wh{ڻ 2�b�x�Z�����8\C��)a��˫�����F�K�=�Z��9�2X^*q��A�!�$����{k��Ί�t�ˢ�[l�*������2�)��$�fYl�WM#l�)fT����A���s��x�8"e�A%?Q*��>���m�z
�|Tj�ר�5�T��*��H%�9� )T�mz�~��H)	Jb}�	
-i��s���q���_��P�����wk�,Gt�X!<�
+�%lz*��ݖ)8[����i�
�A���T%H���Xd���dJ�o���@���Cƅ�і�_ˋ���<F�u�f����M�|���
���
�oyo�f@�Jǝ��:�>`q`<�!���@B��W��U�T*[C�G`K�by��a����-�l��lX,�K`��+��,_l�K�G�.{
ʗ����A��l
2u �	����ڨ�	SR(y ���`�M�����g��5���H���8�<*7|(��)���P�B^�o�ț��]��'0��	e�+P�MP�S�G��\��t�	~�^�%LVX�Lbt6�Zq"���/3��"[������K��ţ9��+��j�2� #C
}�-��U9��1c����(vv/۶�ɍ6Iv�Öq��R����T&���`K
2�������a
Uᤣ;���������`ܞ��rLH�ㄾ
��6���K��(�>9�I�<Q!.۵}�
�
rX(h�b�,���b�$ciqT����c
+��DA�2u�m
�P�e�;ҿ?���.��M��A(��
��pZ?�L�䠍K,{H�o�#,��u��D
�9�(��34�j`�
.P��Y�
+�没�:'tT�iE%�>�$1[K�0������S8�@��*p 
+6�z*
R?���s�)��SaB�h1(˧��n>!�\���;��_&����N1�<�ey��
��5�"��u��
s��g�"
�v妄W6��tf��;�;&[�
��t���L�KW3[�L5v�x�beu��p�	�����!
p8ưB8���O� ��3`�X���R��%`��#p���ذs2A5��s�iSK���Ţd`O�o1�E�+�åJ(k䱬>L��u*�Ş
���;ǜq�;��f�X0r�^�v�R��EU��@+�c,#�A8P���Χ{_5kV�EC`�k"_�Q�@l�H�.��I��$N4 2C�$0;�ݩe�X�ir{LlGIm
S��޾�q�أ�ϸ<"�=)�fu����1��.��ņ �����֙���s7X�s�I8G	~�C!oU��F��x0WS7�G�V󡯊�B��MU��i�D�
)��|�!J f�T M����
� �Oxx:�DwҮ)�h=�I����s�˼N�у������Xד��x�O2�sa�hؒ�I�D1���9�c^��h�t��4L^��I��Dy^�3����u�
%�=��5�y��v��3��I�P�ٽw��;��ͻ-��
+v7y����c%)״���P���7��L�יq�H?����s�%p_,�4e�2�Ȯ4�2$��!��3�����g�����vtJ0�`[7�u��|��v��L�B��9&]��a���������}�U�����mb��b�?i��
+endstream
+endobj
+15680 0 obj <<
+/Type /Page
+/Contents 15681 0 R
+/Resources 15679 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15644 0 R
+/Annots [ 15674 0 R 15675 0 R 15676 0 R 15677 0 R 15678 0 R ]
+>> endobj
+15674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 422.261 188.41 432.791]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction_a4c129841def42c25fe6b521871107eaa) >>
+>> endobj
+15675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 393.992 197.875 404.896]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction_a7b1c5cb64b4a03090300e0228209187f) >>
+>> endobj
+15676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.47 196.159 377]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Smash__Reduction_ac4b52696d07221d118e0717c9091c391) >>
+>> endobj
+15677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.911 252.635 391.332 263.539]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) >>
+>> endobj
+15678 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15682 0 obj <<
+/D [15680 0 R /XYZ 89 770.89 null]
+>> endobj
+15683 0 obj <<
+/D [15680 0 R /XYZ 90 646.303 null]
+>> endobj
+1974 0 obj <<
+/D [15680 0 R /XYZ 90 545.934 null]
+>> endobj
+482 0 obj <<
+/D [15680 0 R /XYZ 90 539.333 null]
+>> endobj
+15684 0 obj <<
+/D [15680 0 R /XYZ 90 440.881 null]
+>> endobj
+15685 0 obj <<
+/D [15680 0 R /XYZ 90 440.881 null]
+>> endobj
+15686 0 obj <<
+/D [15680 0 R /XYZ 90 383.356 null]
+>> endobj
+15687 0 obj <<
+/D [15680 0 R /XYZ 90 339.628 null]
+>> endobj
+15688 0 obj <<
+/D [15680 0 R /XYZ 90 288.94 null]
+>> endobj
+15689 0 obj <<
+/D [15680 0 R /XYZ 90 227.106 null]
+>> endobj
+15690 0 obj <<
+/D [15680 0 R /XYZ 90 204.729 null]
+>> endobj
+15691 0 obj <<
+/D [15680 0 R /XYZ 90 204.729 null]
+>> endobj
+15692 0 obj <<
+/D [15680 0 R /XYZ 90 116.558 null]
+>> endobj
+15679 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F91 766 0 R /F94 771 0 R /F22 2982 0 R /F11 621 0 R /F111 1509 0 R /F24 537 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+15722 0 obj <<
+/Length 1470      
+/Filter /FlateDecode
+>>
+stream
+x��Y[��F~�WX�Cm)�����JI��r�D��)�����
1&�������!�����'�=s��w��{+{�FOf��k�<���қ�y{J$(�fK�O0�:��?
��<	�Ӏb?�?��e
�_mn�0�4����u���&]Uk6i1�q�D��n��������5!-��p�� ���%
��������rk�gT<������#��3�5��
���]T��P
�!�Z�Z~>a3��_�p�
�T`�G�6����:��J�Ӆ�Ŕ���J
=��ޏ��
q1�)�-�ћw�[��
F�h��-J<N������n�O�^��cReo���Yf�}��2�n�eyyQ�7��Ɵ{���*J�

[V;�,��F��8�lh�!�孷�8�8wk�="gڃHY���o)�Uo����h�.� *�C��
|6�+�J���Z*�?6\�
p�cO��uړ�{r.�
	�2.�]+�Ĉ+�02�J�4`��d9��b��%
�p-��Pr3k���~� j�(���]�zp���
aP̈A����3��s�8��^������V�v����EP��U�
�("�6���N%��p�S�4V]��
+���*�����d�K�z�\�Bn-x�DJ��x��[�%S�@H�w�CL½��\��D7�
��M�O�$�Y�OP]z��	�}"P~��6�.���>�
+�C�vB����$?n�͢�cY�.�s���
(�z�h)�PP��n��6�"�/��~ɐ�0��v[�B�	TS�{r �Z�^<���8��e���.ª�J�	Wy����Sc7�|nd9�+'G� �B�|��
+��`ҟU>������s
+70��9���S��]C�q?$�ۃ��@��R�J���$@���{��\Ҿv�Ս��	��5�5SJ�y�;Ƶ�qK[M��@ñAr_���-�%vX����
��OL=|�,�]3�G��|UY�iĥ�%�
�Z&u2�+�,�Z#�i8���
reH��T#�A|x׻��T(�M�6i�ݽl
祉=���M�!�FJ�\�@�
��Ue��xSϬ��Q]��
|W-��
���0+�Q2Z�R����Zёj��R|�

LN�S��=K�߳��`b���B�~�p2�F�wr\�

�
��<\�"ˣ��2.K�'��!Dc$(�_�Dr���Γ���]�|��˲eW,'�$��[A�����(s@�r�D�M�܂�
�4�y@#�)�}�\�
^a��Υ
s�6ۧKx�)�� ޜ�rY�
5�ɤ��:f�/0I�����f!)?�Mz�}
O-�Plt=��H�e�
Phwl	�ѽ� ����]���W��-L�a\��
����|w�\ ����A��AC���씆�y8	x9r�@��(�Θ+H��b;���ݯvQ�B�,9�d��l:U���6�X,��������p��ѨN40Q�V'���
�?��
����
+endstream
+endobj
+15721 0 obj <<
+/Type /Page
+/Contents 15722 0 R
+/Resources 15720 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15644 0 R
+/Group 15694 0 R
+/Annots [ 15695 0 R 15696 0 R 15697 0 R 15698 0 R 15699 0 R 15700 0 R 15701 0 R 15702 0 R 15703 0 R 15704 0 R 15705 0 R 15706 0 R 15707 0 R 15708 0 R 15709 0 R 15710 0 R 15711 0 R 15712 0 R 15713 0 R 15714 0 R 15719 0 R ]
+>> endobj
+15693 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 15730 0 R
+/BBox [0 0 456 130]
+/Group 15694 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 15731 0 R>>
+>>
+/Length 509
+/Filter /FlateDecode
+>>
+stream
+x��U�j
1��+�Z��.:
�@��$
9Ƴ8;���wI-i:=
��5���Su�բ~�o�
D:Xl��
��_� ?Owp�F�{��o���E |�߽���[AW�<��#L|`
 �y�����Jo"*X�
�ñ�q`��3���h
��Ť�$S�Fe��[WL}���a|��zƽ������ϫJ�1�u^M
+�m�4?��
πW�!
�fK����r�$?b��u�]�v�pt�B��
$M6�SI{�C�ar1D���V��JD�=/M���$���Y~d�Q{�=��~�Q��n:A���¢��F��Ct��{8�r�-�4�2�mmiu�Ԟ��f��(�u�KM��-�֨��Ƶ�:N����Q����5�{�s�;iIwJ��3��A�]r,��%�+:S4Up��#z3៖�)=
]N��xOO�-=����
=�������z�i���^x\偦PZ�.�@���&��^�
+��>����3f�~ ��
���6���.�i:/�W�x8��
+endstream
+endobj
+15730 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+15731 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /WGBSWX+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 15732 0 R]
+/ToUnicode 15733 0 R
+>>
+endobj
+15732 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /WGBSWX+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 15734 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 667 556 611 278 556 556 667 500 556 500 584 278 278 500 611 278 584]]
+>>
+endobj
+15733 0 obj
+<<
+/Length 15735 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mk�0����
��E�� B�^<�n�b2n�Ct��Ƽa

(<Nf2����=wf\Y��fu��
�ю�������I�`zTk��V��I�/۲�ԙaN���>��nc�'=��0��7�ɍ��_�
>]n���DfeYҶL��˽H�*'biH>v���u;���
��%&s��fM����4WJ�̯�5�_mBF���i����
۹ߞee��*��T �A%�P�X��@��r�{IP	�AH*b�X�B���(��x��r�j���WT���x�#���"V�_

��9��x:�r8p���3���ï�������O���_N��M�W���}���9?Bax���S3�Ϸ���_Ǡ
+endstream
+endobj
+15734 0 obj
+<<
+/Type /FontDescriptor
+/FontName /WGBSWX+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 15736 0 R
+>>
+endobj
+15735 0 obj
+362
+endobj
+15736 0 obj
+<<
+/Length 15737 0 R
+/Filter /FlateDecode
+/Length1 2708
+>>
+stream
+x�UV{lS�?�q��81~5qpn켃��G��<�
;&6I�é!g�	�
RV
�:�U+ڲ����Mڦi�`҄:VMc��?S�t[+1�Z�`�Z�z�{�@��;�~���
��wν�c٬�q�ܓJ
 ��猭9�����O�j�
+�G�V�ܛ�������b͛Ă��|-�v�����9�Q��Г�ON��I0v�"�/���J�
����X�A�s�1>��
+90Qo��mz� �J]4!���*��n�
�nv�l
cd�Ԑ^��\f���
5�'g�o�R��!��Z[0�v��Fg�|a��srv�U���[Ys3f�.�Io]>�F(sTȃ�ݜ�k���ve�l�˻�t*�ٯ� 1^��#�+�Աx�hN^��������M�h�`��@��f��)}Pŷ��+C�.���� ?;7K�)*2;*��ﻫ��m]���
~�
IG&%��ItY���B�m�y&���q��Q�=�(�k챡�eky0˻��W?t�ʂ�D�}���7&֋�3�6VGj˃]�34��E6I�Wf����������
S�l
޺�����
�Ӌ$!~.3�q�2v^K��hF?<n�
{n������H��cG/��{�;g�њs���Tj$1-�"&w��f@�brˡ˿���kYQ�
��6R�:9�X__h���m�ծ�\�tzjmPc)�r��d��3�2`~���_��^m�j	G��`cϮ(��9�S� }��J�Z+�B�FV˜�f� ��#�`����6�`x�$͓�&:!�
+�
�>~"�-4I��A�����l�l���
�7-�Z���5���x�E��̊L��Gq�qÿE�BڏP�(��~��#S�W�c���HDƫ����S���|���ᑙ���
���	~�2�6�M�sJJ[��pV9kE��VΞ���$x^�FA��\���d&?/0ȃ��ʌ�+'G�y�I0<�7�i29w4�K�km��_�}��
�ч3Wffv�d|����Ub�q
����]J*�s"n��bN �j�
�Fʠb��$(���R2u*��^U!����������~�s�gh���]��ˁ
�����U�p��
5;�UWY���~jϷ���j�U;�5�l+ٴ��t��iR����gx�G�n"_pɶ� p)S�^��A{ds�pt���v�k�~:+���1�*y��n�9��
�_
�E� �P��_�[���ҥ��/ʧ
�(12w��=�I�7X
�+J�]]Q�m�^/6duf�Tҙ�W^a+��xkxtG���Vvl�B�-a�{��
���~9a�S�go��Y%c�6zP��˷�(�ˑV�����#㻛C�c�#��;u��f!hk
��[{���ǎ�p�G
+��W��c	���nM��R��S��e���<�v���H�/�
��qz�z��[��
��{2قA%Z|"���8qj췿
����Xܿ~��^���>[3|���}Lh�j>��L%ٛh��B�X�c�Yo����·���'��L�
����`s)e
l�zn2]
��*zV���9j£�ӿ�M��	��^��;����Wg/)�5�ۚ�b�XMy��5:в_g�ե��f��i�c7�%S
��4��ǎ����R�l3�k���k�Uwk�r7j��6A%ZI���+�3g�x��Oe��}�r+�{6�
�Ǜ�
K��
}}�H��{,)����	
��)
LN
+�Mɹr��6s!_k&_2�=u��V�B/!引�37�J�����Ͳ��0f�+�6��Y:-�

�Qf�R��?
7�Y��i�3�x��p��-�p"����,�	��
/a�l=��
i��ϗ7��
�<�m������2�T��2����F�m�lH��o�Zڬ�ry����
�7�0�e�b
*?���;���'��
0#���*!E��[1{�̦�׉g?�Æ��mK�>��z��+��Y
~g�q蹰7�y ��\p��T&u—]��#C)��@�BEY<����ڀ߳ކ ���75�k�M
oM͟�A�Y�9��߃ܖ�#��6��
�\�s��\ò�o�67
+endstream
+endobj
+15737 0 obj
+2032
+endobj
+15694 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+15695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 371.248 224.395 382.152]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 348.314 189.925 358.242]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+15697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 348.314 260.898 358.242]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5cd04912407d0b7f7c3e4bf9becff0bf) >>
+>> endobj
+15698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 332.586 422.545 342.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 307.224 224.395 318.128]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 284.29 232.982 294.218]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+15701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 284.29 347.013 294.218]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a1e3eb354a88609b46573e1dc2ce6dba9) >>
+>> endobj
+15702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 268.562 389.11 278.467]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 243.201 224.395 254.104]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 220.266 254.671 230.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+15705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 220.266 390.391 230.194]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a11a03a73950216b9010c2350cf5ea7e3) >>
+>> endobj
+15706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 204.538 465.458 214.443]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 179.177 224.395 190.081]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 155.266 181.207 166.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+15709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 155.266 243.464 166.17]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_aaba6bdfeae05d8463a8208b0c6b7a62a) >>
+>> endobj
+15710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 140.514 420.593 150.419]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 115.153 224.395 126.057]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 91.242 159.628 102.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+15713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 91.242 200.306 102.146]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a74fd79622aa9418de9e842a0d72bbcbe) >>
+>> endobj
+15714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 76.49 400.176 86.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15719 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15723 0 obj <<
+/D [15721 0 R /XYZ 89 770.89 null]
+>> endobj
+1234 0 obj <<
+/D [15721 0 R /XYZ 90 675.126 null]
+>> endobj
+486 0 obj <<
+/D [15721 0 R /XYZ 90 668.361 null]
+>> endobj
+15724 0 obj <<
+/D [15721 0 R /XYZ 90 400.331 null]
+>> endobj
+15725 0 obj <<
+/D [15721 0 R /XYZ 90 400.331 null]
+>> endobj
+15726 0 obj <<
+/D [15721 0 R /XYZ 90 336.571 null]
+>> endobj
+15727 0 obj <<
+/D [15721 0 R /XYZ 90 272.547 null]
+>> endobj
+15728 0 obj <<
+/D [15721 0 R /XYZ 90 208.523 null]
+>> endobj
+15729 0 obj <<
+/D [15721 0 R /XYZ 90 144.499 null]
+>> endobj
+15720 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F60 540 0 R /F91 766 0 R /F22 2982 0 R /F75 562 0 R /F94 771 0 R /F67 3022 0 R >>
+/XObject << /Im26 15693 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15749 0 obj <<
+/Length 3045      
+/Filter /FlateDecode
+>>
+stream
+x��[�o�������V�}?|��^|�5���[H���X�
>�����;��c���$Js?A@�Z���|����go3��p�˓�g�eIevy��)n����M�j$�
���1cR#b$��
���?]>�����v�����?��R:�.N^���
<�1�=�F��S�yvq�
d��
+{k/A2Cz����o��j4�M�J��e��.J�YN��j�v�5����3�;��8����
+}��TD�f�&���j5��T˷a��t-�� ϲ���/E�u��k,�Ī��qv~�|Y�Ø�Q>���z]������Ve��'�eu����4��h�(/��Wgc"F�r�w ��4�
`D�Ɠ�m=�Α�H�ԟ�m��,֛y:"c��;��
����Y�#���	/ڋ�
k�WuW��bL���}9fjT�� �|�����=�Љ���)���S	؃�Ŕ�$� �ޏ�+�jv�_����㘀T�)
Z��|t�Y\��Wy5[��:_Y�<U5�� ]�#� �h���m�^n�Lݢ��˱ƣ���
5��w�G���?
��{�X�0���<�%���c~���Nk*�(�1f���ӊ#�uݨ�����qaFJ���㬺K�D��p��Ě�Ў�Ft>!� �`Ĥ���g��) 9�G���7��/��M�K
���$�-Ї�Т�
B�G!�
+�>��a��� DS)z���k)���dL�-�"�82���Ig�w�������@J
�~~T�߫�h�T�p��� -
y[��{���y�_b
W��>��Ţ %X�^��'
�ז�7��MQZo��ߘy
�����/\�U�ݯ�7͛�*�/�Q$D��w	����-��~
��#y��D2#b�FbP�p2�A†'���$�ȶn�a,�֡؁���9
b]�J�B�^�
d	��0�F���@�{3��m>�����]Q�&
+�a�^�����@!�_о� 
f�v��ټ�D�������t�!����<����3��a=>��
Y��X�7����|;� `�H�%��Ҟ��+�&���1�HP�
q\6�hЬWϷ���� >}xJ4�FE�_����iEpѽ�j(����L�t���)���S�n�N�F��z�'r>�|�C���aJ���À���|�nj� ��yWܔ	8%�c ̀0d]^̮�܁���)0Sb|e�y
�sP���3��$��sAz��1�o`{<u�n׷m��RBG�@z
C4r��=s�������
vRtD���(�k��"��C��9�r�{�s����XH@�a�#�B����Cp
l�塝1�3�r�](KXZ����:J����u��h-�О����cd�t�#hG����[9m�;/��rk�?P�R�3�' �R�/F\��T��4г���~��V g%��A#��ؤ���
���ZÕ��g���a̻0d=8�nÓZ�Y'��oօ�����6�!�
+:�K?M8��2���f��g=�f��
�cf�.��.��
]��t��^]
+�4�j���H��a�T��
$�tÍ�loo}����Ͻ`UU�����X��mMˢ*v�o�CP�
fp�%�����W>�Gp���ϞঝΤN��ia��q�A%���'��+t��Uj���o��$T��

DY��
b"�h�(�6R�lmŭ7�n$^g�
봃��5��wJ\��x�k�2G�1`	��9ʎF��I >˶�2.f���SB&	K���0����W]#��h�!Qj����=dr�P�YIH�!k�*+�@k\���ӕ�W��{a�c���X�������2
	�Ց܇����.E�@,�^��]�6�.iEh9d[�e�k0�'���4H�9JJ��9j���u���:�F����1����fx�qB�
+Rg��(�����-.�p �)����Q�I@�[z����r?<),���,���?�%E�'Zf]%�&*��$V�>hq�B-�C��S��Ȅ*i„�v��);ck�N�]ƦG4�8ll�4���m��P���ht�%)Dl�o���
(�
N�ew�'m�Y��
�i[�
��m�ua�A�&3H�[1������,i��;��2�K�θ݃�1�0&����;���	;�6���[9J"J#]=@H.G��uu�8�N�@*�㇙͍\�X�˻��
�}�
>-��H��V�w��BG�v1��N��6C
��4Mh��hw���)�e�Zܯֳ�؎4�h]�!�(��,���A���*�E���4dm�EM�ט�����f��ݯ��*�!X
+��O�T;�4�:mѥu�g��& o����p�k��%�vn�4T�
�Z�a�,�w�y7kOs	�&T�=m��p�d��
�է��"�
���c��hv�U:�^�pV C��b�3@��� �ý��a{�v5��,�
ק)� �)F|��)�x�n��{�m�
m?x���a�ч	��*��i5���gA���c�M�������
�h�K�|F�E)b��2D��ib��L�c`����b`2����g��Zv
[��Ȃ���U��
�i�t��%E�38���G�J������s�j�{����$��F�
+��!Ƨ�~Y�-nS��G,�H!/��"�v��*�Rwp�K<��6MH�dt��oR�p�v�&U��R"N|���w�xW��3hT"ڞh��"J�v(��
+|���
,";�I��J6�73�r�g
.�n�<��.avw���qg�_����|>w����EQݭv}v�߃����������e1��
�I���o_e���9S`�Foɢ���Оj{z���.��8>�1<�^�����Z�_n"dT�M-z
z
�ۛ|�.ݩKh7[4	�N`��z��j�`�4Vl�4)Ӈ{�G�$P�����g��}A��	��_���X�
<}�`��+��n�M���"�Q�
i��i=�?�S9?�o��.�ߏ�����|�qŪp6ؗT��d6At��3# ���?�����oު�/A0�Q�]Uݟ>}z�y�.�ox���:dz
�D��Y���c��������J`��Z3u
+endstream
+endobj
+15748 0 obj <<
+/Type /Page
+/Contents 15749 0 R
+/Resources 15747 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15644 0 R
+/Annots [ 15715 0 R 15716 0 R 15717 0 R 15718 0 R 15738 0 R 15739 0 R 15740 0 R 15741 0 R 15742 0 R 15743 0 R 15744 0 R 15758 0 R 15745 0 R 15759 0 R 15746 0 R ]
+>> endobj
+15715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 686.259 169.81 696.789]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_acf7ac787c211436eb1f3710b8e4e07f0) >>
+>> endobj
+15716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 686.259 309.485 696.789]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+15717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 686.259 514.653 696.789]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+15718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 674.304 227.553 684.834]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+15738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 647.221 169.013 658.125]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5060174ad0f3a68e5a28368b5e2fca7b) >>
+>> endobj
+15739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 647.221 306.566 658.125]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) >>
+>> endobj
+15740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 588.113 258.832 599.016]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a3176e4afbc2c084e48afe86d8512e057) >>
+>> endobj
+15741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.453 588.113 372.937 599.016]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.56 576.157 274.045 587.061]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 552.628 266.581 563.532]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_aa2c3ce51f68aadd03339865f90fc6d41) >>
+>> endobj
+15744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.089 97.91 513.996 109.865]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+15758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 86.288 126.862 97.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) >>
+>> endobj
+15745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.811 86.288 513.996 97.356]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+15759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 75.18 126.862 82.826]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) >>
+>> endobj
+15746 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15750 0 obj <<
+/D [15748 0 R /XYZ 89 770.89 null]
+>> endobj
+15751 0 obj <<
+/D [15748 0 R /XYZ 90 704.286 null]
+>> endobj
+15752 0 obj <<
+/D [15748 0 R /XYZ 90 663.888 null]
+>> endobj
+15753 0 obj <<
+/D [15748 0 R /XYZ 90 604.501 null]
+>> endobj
+15754 0 obj <<
+/D [15748 0 R /XYZ 90 567.302 null]
+>> endobj
+15755 0 obj <<
+/D [15748 0 R /XYZ 90 506.124 null]
+>> endobj
+15756 0 obj <<
+/D [15748 0 R /XYZ 90 506.124 null]
+>> endobj
+15757 0 obj <<
+/D [15748 0 R /XYZ 90 443.473 null]
+>> endobj
+15747 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F11 621 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F75 562 0 R /F8 802 0 R /F1 834 0 R /F10 773 0 R /F13 835 0 R /F29 939 0 R /F7 803 0 R /F35 1248 0 R /F100 4949 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15764 0 obj <<
+/Length 2688      
+/Filter /FlateDecode
+>>
+stream
+x��Zm��6�����w6s�*��C�ޥ[�M��E>�����PY�Jrr�_3$%���u�.�O�%j8�y��t�0����5�������h4[�

������ØQ��d�(��	���$�	��2��N�U2��WI���f��&L��z]����I��I�X������[��6�� el�}����ް�]1��r\%YSQ�I
,���=I��yRד)W�>N7�yҤ���t�����.�XQ�D�~�]�qŀ

1',Eb=Zl�>|��%<�iD�0z��.ڌ$p�G�~��^����[�x-��c��)A���&��S���v[,��,ܯ��b�I�&�����
�єK"�	��whZq

+:�I�uOk�	�-h�<�E�A�J>��;�!�|*F���)Arb��Dy(4��^qK)���^
�J�?M�1`@��%��8Q܄��&R�AN /��!��!�
p%$'�
pu[�7��P�{v�������2�5C"���m7�ۼP�sdE3�⇀�H��F�)��(�>�῏ޓ�
�=>eDt,O��t�� �(l( x�"��gi�Jb8 /�D��l�	I�"&�i��z���a9Č��2r��c֓�Q���Z�xk�J:�}s�gE�T���@�;�oT��TJ3^�E�
`N�r{7wz�H�Ɇ�|��}�Tɢ��kJ��!�sA�����=��[31,�t�e���Й�$b�u"��ke
��$�d
+����7��bCh��0-��� B0�gB�Q���	
�z���T��

+b��6�W�|4"� 1Q8�iq���u(�!�b��CWi�͛!U���ܙs�"� b��5�B��
o�|��U�6�?��mD��
&,��
�ݗ���>uj�>cJ�Ł����>��5q��
�e}aھq�q?�
+�=
d'
�
�v}������'�Nφ��Fh��.j��r����:���NP�
)`d� p��N#T
��@wl5�
`
+T+i��W�Ѐ���Dz��<5������)�Pnh
7��U
�YB�ɉ��l\���`�÷�%��'�*FV���\�@�#��R$
B�C��NP���C�.>�~��IAPBm|���&"v��f���(� ����8�h�B0�P�	a���;Ƴba������d��ti�@J	��2 ��1�.��R��+��<�����,��~���y�f��k
Hr�/��KSt����
������,�
 �6x>	��q3
�=n:�l�e���a<��o������6�I~-l���
%
�	��63�r~�6۪�|�a�n /ӄ
+�Ӛj�>�֬�γ��b���t�b �b���w�*��]'"�j���>g�O(�̀ߔ���D��-�O����0*�a���#��,��1��w�b�����-�|
�ڃ�0��T)>H!�.ݪ�/CY,�ޒv9�*��f^>�UR,Ϊ���ݒ��8�b�v\��b��w��Zt����n't�N����S|€��r�%�̂zY�[�,+��mĎ�6)R�$�5��d��Z��l�m���3�3|׾)���@���0��;��cT��MA�Ρ�
+$�K�ɶn��ģy[,StZE��S/�
��R���Tߥ��d�kQ/�zQe�;��W˴I����#1O�����u���<�B���+�����&[P��8
C��*��^m
�ԭ�A�W=x7��ǫ�K��v���pȰk%�6���s��[��}�0 s��?�!;�M4�
�
wHx}��
kia��pq���[^j��Z �.
.��~��
n>����`�M
�UUnz�[�y��aM!���&8�l"��u�2^��q��U�����cN�k��QgWܖ�-U@!k]t8}���&覩�h�!@2q�].���0��`%�i�&n�b��e�����P;B�eX�pEQȂ�?�>ݠ�
��0��˺�
+�Y
��
E�4�I<�{��A�#�}!CL�u�f8(ܛ��8���.q�Z��1�]��1#p������j	�!�����
k����f�^��C,���ae�[�)O�����K�~ɀ��E��e�"�.��u6R�5�
+���V�S!Et�z^�do	�-�~
�2ֺk�݌��.d��r/�==��'?1� n#�S��1%0��c@��;�}�� t���x�'������

�y�
F1;�BR<6��0�GEa�HI�p����\�Sb �|
��>���E��._?��t|VB �j���s��!Sd�r�t�@vO���1���t����E�_��	4m�'`�O6  & ِ*�+�S���(��
w�<�*
�N7���V5��aQ�j
*����Y���?��5�<�n��O&0��,l=P�|x0��Xu�C�_�GuڸˤI�#�~�����Ŧ�?mƍd�i�G�#����% q?vCs+p
Q�l���#¿
�΁B�}�=�����=��+��k��
+�b�/$X�=�M���p>nx at Q�����4q���_� c-�_]������	�
r�?�Z�A.E�
OƐ���Kww��ͯuZ�ݏ�˛�ض�&��k1U��2#
j~��p42�7�+dy�}����:�;v��K�%��y�����>�)���
�轳Bw]�N���71[�� �Jڼ�3 �e
o��T@�
s�b�޾l?��_m��e	B�����Q(�
+endstream
+endobj
+15763 0 obj <<
+/Type /Page
+/Contents 15764 0 R
+/Resources 15762 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15772 0 R
+/Annots [ 15760 0 R 15761 0 R ]
+>> endobj
+15760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 401.05 501.708 411.954]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+15761 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15765 0 obj <<
+/D [15763 0 R /XYZ 89 770.89 null]
+>> endobj
+15766 0 obj <<
+/D [15763 0 R /XYZ 90 721.073 null]
+>> endobj
+7518 0 obj <<
+/D [15763 0 R /XYZ 90 704.201 null]
+>> endobj
+15767 0 obj <<
+/D [15763 0 R /XYZ 90 704.201 null]
+>> endobj
+15768 0 obj <<
+/D [15763 0 R /XYZ 90 592.12 null]
+>> endobj
+1975 0 obj <<
+/D [15763 0 R /XYZ 90 350.857 null]
+>> endobj
+490 0 obj <<
+/D [15763 0 R /XYZ 90 344.257 null]
+>> endobj
+15769 0 obj <<
+/D [15763 0 R /XYZ 90 268.719 null]
+>> endobj
+15770 0 obj <<
+/D [15763 0 R /XYZ 90 219.458 null]
+>> endobj
+15771 0 obj <<
+/D [15763 0 R /XYZ 90 182.889 null]
+>> endobj
+1976 0 obj <<
+/D [15763 0 R /XYZ 90 84.452 null]
+>> endobj
+494 0 obj <<
+/D [15763 0 R /XYZ 90 77.486 null]
+>> endobj
+15762 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F22 2982 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15791 0 obj <<
+/Length 1692      
+/Filter /FlateDecode
+>>
+stream
+x��Ymo�6��_!`�&a5�Q/�:`K���Y�m��b�%:֪W�����(R��(�ۺݰ�(��;>���HcD�uma��y�U�?�&'�>�BzԳf
+Ė{�[olN��v��b^�H�����٫���/g��o�x6y?!Ѕ-�p�V�M޼�V
���b֦�Y.e�L���/<���($!(䜶&�+!Z5�(�Δ`��
���(3q��=A3��p�5
������x�>�q�0j�C�}��q9b��DZ�B���-x��KQ:���==�-K�p�P�l����T:SJ�,U����:d)�H6�<89�p�SB��)u��Z߯�m�c���%���/�R����s݈D�v��C��q<n#���{�0��G]��$��u,�HX�v$g��
����# n;`�J�r9"�qx�
��Fa���
��\B�)�(d�8� �D�2�7�@�|�GuR�� �{�&
rY 03D\��+J�`��fʁ�7IY�E���q(�!��@Ŷ����u3e��������0 [...]
LSy:
�.5rR�?���~, z�贕�\�ʷ!@/(\�P���J���V�0��(&
J�'�*�
NOW��:��o�Psh�
�����:�rU�
+��x#rC�L��j��mת��:Q4�Q�s'ƒ����i���L��X��}�u��Ǚø�d��
+
�����0�RB�W��
+~x�ŤEK�H�,�>j}f�?SU���5iŻ-��#_���~����>��u_���I���I!�4S����Y�޺�5����#y-�u��Wc��,�T�`M���J<�wd��T���zۑ��T�_]���KC̘�
���÷]��SD�� ��,e�?�8npT���2"�u�{]�eU+j����Nͻ�Dc�ur#��
+"n���\�t&
7��5m����8�g�=B����m��X�Y�?g��V�z�@��R��*J�V�ވQlO���)r�
+�;1�п�
+*6(
͘�~���gu<���|m���z^7�uB��G|�`Ѓ��Й'q=	���C|
�{�U�ߙ�_�����QtBi�u�lϞp�/k�
IE>&���s�B��߭���:�X�G	��e�6�w��4������m��H���ճϼ��-e���]ՑHWn�; �M�(���HB�@C8�U��@�C�v���(�);�/��D�G<lN���4���Ӧ��n:�9��ɓ�Y�
+�7yӭ��P��E���(L[�Ë���L]�}�.r
"/D�]
+*7�oYu�78:�}ș2��K٦5mۻ��g���ڳ���?˺^������P\�Hg�!5{;O�\d�y�-ݳ��<
�����e�
+endstream
+endobj
+15790 0 obj <<
+/Type /Page
+/Contents 15791 0 R
+/Resources 15789 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15772 0 R
+/Annots [ 15773 0 R 15774 0 R 15775 0 R 15776 0 R 15777 0 R 15778 0 R 15779 0 R 15780 0 R 15781 0 R 15782 0 R 15783 0 R 15784 0 R 15785 0 R 15786 0 R 15787 0 R 15788 0 R ]
+>> endobj
+15773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.418 610.136 204.56 620.666]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable_a14c081beabe1e165b1dc44b2a84b6c2b) >>
+>> endobj
+15774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.413 581.584 194.963 592.114]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Throwable_a5024cc2b142473f5f733a8808cb09162) >>
+>> endobj
+15775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 302.634 136.585 313.164]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a67d50389960334cc0cddaf9e18cae713) >>
+>> endobj
+15776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 273.709 136.585 284.613]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6137f32f30cd8f8c6081c20a5a6bb200) >>
+>> endobj
+15777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 245.157 136.585 256.061]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a833c9f70c384faeb871fa267cca49df6) >>
+>> endobj
+15778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 216.605 167.648 227.509]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a249e8899494cc9ee79d69b7b5eef475e) >>
+>> endobj
+15779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 188.053 190.891 198.957]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a1d613c80931007bd46f479582f90542e) >>
+>> endobj
+15780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.344 173.104 494.695 183.01]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a249e8899494cc9ee79d69b7b5eef475e) >>
+>> endobj
+15781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 148.543 136.585 159.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
+>> endobj
+15782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.325 148.543 193.75 159.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a2f9b37006a7b28800bf7c2aebb7e331d) >>
+>> endobj
+15783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.087 148.543 243.762 159.447]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
+>> endobj
+15784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 119.991 136.585 130.895]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
+>> endobj
+15785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.325 119.991 191.25 130.895]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a993b094f35284bdf86bfc6a06ea69649) >>
+>> endobj
+15786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.587 119.991 241.261 130.895]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) >>
+>> endobj
+15787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 91.813 150.493 102.343]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6018819ab591dad51060b4d01d989374) >>
+>> endobj
+15788 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15792 0 obj <<
+/D [15790 0 R /XYZ 89 770.89 null]
+>> endobj
+15793 0 obj <<
+/D [15790 0 R /XYZ 90 629.084 null]
+>> endobj
+15794 0 obj <<
+/D [15790 0 R /XYZ 90 629.084 null]
+>> endobj
+15795 0 obj <<
+/D [15790 0 R /XYZ 90 598.798 null]
+>> endobj
+15796 0 obj <<
+/D [15790 0 R /XYZ 90 553.675 null]
+>> endobj
+1977 0 obj <<
+/D [15790 0 R /XYZ 90 428.079 null]
+>> endobj
+498 0 obj <<
+/D [15790 0 R /XYZ 90 421.069 null]
+>> endobj
+15797 0 obj <<
+/D [15790 0 R /XYZ 90 321.583 null]
+>> endobj
+15798 0 obj <<
+/D [15790 0 R /XYZ 90 321.583 null]
+>> endobj
+15799 0 obj <<
+/D [15790 0 R /XYZ 90 293.023 null]
+>> endobj
+15800 0 obj <<
+/D [15790 0 R /XYZ 90 262.745 null]
+>> endobj
+15801 0 obj <<
+/D [15790 0 R /XYZ 90 235.919 null]
+>> endobj
+15802 0 obj <<
+/D [15790 0 R /XYZ 90 205.641 null]
+>> endobj
+15803 0 obj <<
+/D [15790 0 R /XYZ 90 166.131 null]
+>> endobj
+15804 0 obj <<
+/D [15790 0 R /XYZ 90 138.032 null]
+>> endobj
+15805 0 obj <<
+/D [15790 0 R /XYZ 90 109.027 null]
+>> endobj
+15789 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F24 537 0 R /F111 1509 0 R /F68 3017 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15813 0 obj <<
+/Length 1535      
+/Filter /FlateDecode
+>>
+stream
+x��Y�n�6}߯ЇJK�.�(
+4��&N_�����-t%m$mR�}G"u�K��A� XJ���3s�
e��z��}��rvv2O#-��.o<���k$$\-�>�H�`N0��" ؏�4�Z�����,���Ur]D�����
~�ެMUy̩���UT�v��ܘ" �7Yl�&!������������T�#�@���t����p�������LJ=N���w�?g�m#*�a�㶧�d{� B������3SE��,-UpU�E���<k �K�]H<���9�qm-�f����i=Q�uaJ�UIvk�D���(K֛U�?Z�eR%����ػU��Q�U��R?�V%��HH�$��坛���M
+�F�VƘ����B������5Y
N��yھjZc�U^#�ڡ��1]���<"g
+��P�
ȏ���s�X�W���>���'DP
Ak��[�
��dW�R�$�v�!�Rʓ`OQz(�*청ͫ"1�hlI���X�MB|K�m
+�O��KoG,7���
?��

+#BO�CA(p8�1�V+
+0QB��&
�ٜhkv�6���a>R�)is��ݔ�en�gqa*wej��Ss��4�qc��S�ū��ؙd�3��ϰ���[!�@��t��a)����>B
ܤC�	>���1d���yZ�Z�
[���Z�?O�e�-��C��Z-Ax����Ӳ�N˶Vf�
+�p�������O�4�<=� e
��B&'�3	+t:J�S.	�CQ�����v��4
��N���┝�
V�`6]C[c�
��yC�9�
+i- �����E�CԤ<�J��������@]ip�[l������V��&�6�H_l����r�=���"��
A�$)n
[�v��y��y���o�~���U>$�@���

�Iڲڳ'�=HL)yC~�$I�����6E�,���u�˺ſ��
+HW\j�u"�9����J5X�H�`md���6�d0�#�;f6�ϒs����n:�,
+�
e�[P����
�DeGH'돲Y!.5,��ʈ�4��f��0�
SPګ

�!d*_��}[_���P)�<� 4��	�o�A}����R
�p�`�R�FЍ�Qꈌ"z�RU�p�Q�
){`G:^fڑVm�١�Pk{>��q��V�k�E�A�쫓�$�N��2�g��V��t���� (x�hDxx���H+��P
�  $�����
������$�1&�����
+sL 
P��M
���<I
�����Mݴ�3

�[�����Ɗ(���'��Z!�
��f�{�Z?֧�G?�㏃rV
+}��`m�ˇ�O��=
�d���I�4��?|d�v�];�	�Z�%�n�d�j�.��u�Cg�}�
+����c?�7��
���vi5��b��ޗ��9�w4|
e�ht���c�{� ��P m�ߙ6���^;z9k
4�C����{WU����mi�[��a��pع���4/���p3m��h})p�K��8�30
��i
��`�<l_t7��H��,'����'�
+endstream
+endobj
+15812 0 obj <<
+/Type /Page
+/Contents 15813 0 R
+/Resources 15811 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15772 0 R
+/Annots [ 15806 0 R 15807 0 R 15808 0 R 15809 0 R 15810 0 R ]
+>> endobj
+15806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 325.328 226.029 336.232]
+/A << /S /GoTo /D (namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) >>
+>> endobj
+15807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.527 325.328 289.381 336.232]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common_a56b1bfd700c1f088b6be622b7b67a257) >>
+>> endobj
+15808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 298.358 224.644 309.262]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Concrete__Expression) >>
+>> endobj
+15809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.378 286.403 208.82 297.307]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Unary__Operator__Common_aba21572aebe99f81b7f09b75f3b2d903) >>
+>> endobj
+15810 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15814 0 obj <<
+/D [15812 0 R /XYZ 89 770.89 null]
+>> endobj
+15815 0 obj <<
+/D [15812 0 R /XYZ 90 721.073 null]
+>> endobj
+1978 0 obj <<
+/D [15812 0 R /XYZ 90 637.117 null]
+>> endobj
+502 0 obj <<
+/D [15812 0 R /XYZ 90 629.082 null]
+>> endobj
+15816 0 obj <<
+/D [15812 0 R /XYZ 90 553.961 null]
+>> endobj
+1979 0 obj <<
+/D [15812 0 R /XYZ 90 463.878 null]
+>> endobj
+506 0 obj <<
+/D [15812 0 R /XYZ 90 455.843 null]
+>> endobj
+15817 0 obj <<
+/D [15812 0 R /XYZ 90 343.859 null]
+>> endobj
+15818 0 obj <<
+/D [15812 0 R /XYZ 90 343.859 null]
+>> endobj
+15819 0 obj <<
+/D [15812 0 R /XYZ 90 315.155 null]
+>> endobj
+15820 0 obj <<
+/D [15812 0 R /XYZ 90 259.087 null]
+>> endobj
+15821 0 obj <<
+/D [15812 0 R /XYZ 90 210.061 null]
+>> endobj
+1980 0 obj <<
+/D [15812 0 R /XYZ 90 144.954 null]
+>> endobj
+510 0 obj <<
+/D [15812 0 R /XYZ 90 136.92 null]
+>> endobj
+15811 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F75 562 0 R /F11 621 0 R /F22 2982 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15862 0 obj <<
+/Length 1483      
+/Filter /FlateDecode
+>>
+stream
+x��Y[��6~���)53�,	�%��l���ެۗ$�����p
{鯯c����mgg�t�}��|G at m�A��ѫ�hzi�
\
[��Zs�f�. ��h_�a���fX@�%z��/>}���8���Fof��#$
A
U`;���~�Z n�� 0\G�+_�5�iW��GP�&�)/�2u,C �,�<�(+
h�P��[=�L��&�U�o�����	�p�x^�\=��ɗja_�w0��4μ�N�2�55G�`��1�ebm�L@�2�U�x��^��a�i�
�խ�~�'a��~����܋�fZv
h޼�&����CoQ*3��� ;1\ >�K*�>
�
G�/���x����!{�x;�\
�ke���
+�`;�i���ϯ���a���ݡ�{� ��/^��T���
����	�A�:Bh��
��V́6@���
+��n�QE�B�Z[ծx0�� �h��yվ��>Y�
b(	މ��i#
� �i¶�
>��&�0
+X'��ة�$���ei��1���rNY� ��C��m�T:��4vz)`ig`����5�^Y3� A�z����k�-�!W��J�C���Hib�Gm�N/�
�/�y��i�λ�#�C���l< �]X׶�
j�y>�7=��:@��_�>��-�y��+{�&M�(e2�J������q�mٵ���g
ʼn	,؄�	�@�`r���İ
K`L�4���oz �e���a2_<�Nf=O ���\A
Uյ2j���t����,�Ci�0�-�"���ٹ%`d���rϸ�4O�F��X}<���x:�����`�б�!�ރ`�o�Z�!d���E�F��ާwO�7ԗ�ꇂ>T�{Q��k��rP��UiE��C&�� ;)�����Iw�õ�N)��=}u�elh�! ��k��w�
+�$�
!����JvL{]�_qA��O��񮒶�+��"�w??D��0q��ø�{��K�#�;���7�N��i9��u�
�"��N�?�-I��6׿�&��
��}o�����5	�������r�NS0f�1��H��k���n�
1�^--ԛ���u���<L���G�W��K��p��R�-�E.�z�v`���60������7� ]g�v���.�o(��B
�$����3�/4Re��
�A
+�M`�n
7���̔�x����Z:�F��F�.��N�z������ǽ�v��e4�d���rۥ�l|���m� [l-�����'�#�>���Z�#�)�A�y�8�-�#��(�[�"��G|������hP�w�_
�VR<eAq,�
��<��$R+o<Y��
�������ƾ��Z
M��f�Sd��25��V�|X�Q7��ņ�:������&��O�‰[����I���������脌U0}�#�Эܼh�*7@YN
	�E��BW�8V��hL'?���M6������t�(��&K�q?*W�]�Y�F�42,N��HA܌�����<�
+endstream
+endobj
+15861 0 obj <<
+/Type /Page
+/Contents 15862 0 R
+/Resources 15860 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15772 0 R
+/Annots [ 15822 0 R 15823 0 R 15824 0 R 15825 0 R 15826 0 R 15827 0 R 15828 0 R 15829 0 R 15830 0 R 15831 0 R 15832 0 R 15833 0 R 15834 0 R 15835 0 R 15836 0 R 15837 0 R 15838 0 R 15839 0 R 15840 0 R 15841 0 R 15842 0 R 15843 0 R 15844 0 R 15845 0 R 15846 0 R 15847 0 R 15848 0 R 15849 0 R 15850 0 R 15851 0 R 15852 0 R 15853 0 R 15854 0 R 15855 0 R 15856 0 R 15857 0 R 15858 0 R 15859 0 R ]
+>> endobj
+15822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 685.736 177.053 696.64]
+/A << /S /GoTo /D (structParma__Polyhedra__Library_1_1Variable_1_1Compare) >>
+>> endobj
+15823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.284 617.218 254.064 628.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) >>
+>> endobj
+15824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.206 617.218 384.393 628.122]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 548.701 149.098 559.604]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
+>> endobj
+15826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.914 548.701 218.557 559.604]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 521.692 179.554 532.596]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 521.692 189.795 532.596]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) >>
+>> endobj
+15829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 494.684 179.554 505.588]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 494.684 250.666 505.588]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a44e2225e59844067e005297572cd9ca5) >>
+>> endobj
+15831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 467.675 191.718 478.579]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+15832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 467.675 288.852 478.579]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a7102c6fe85d4c8e6939d29a047becbdb) >>
+>> endobj
+15833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 440.667 191.718 451.571]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+15834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 440.667 303.079 451.571]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a49b4a338d3d82bfb7a404ea87481fc4d) >>
+>> endobj
+15835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 414.032 150.493 424.562]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aed0f237309569c2bfbf9e6f60740974e) >>
+>> endobj
+15836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 386.65 169.013 397.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aae21b0f5a4289485ef86a9d11fcbfc50) >>
+>> endobj
+15837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 386.65 208.017 397.554]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 318.132 203.075 329.036]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 318.132 296.324 329.036]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) >>
+>> endobj
+15840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 303.955 309.384 313.86]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 291.124 255.627 302.028]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aed36717941671bac2df2568792acb768) >>
+>> endobj
+15842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.769 291.124 385.957 302.028]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 264.115 239.129 275.019]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a5012c55d8fdb1420b80a3bfbe5a5b843) >>
+>> endobj
+15844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.945 264.115 330.725 275.019]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) >>
+>> endobj
+15845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.206 249.938 329.585 259.843]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 237.107 225.212 248.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) >>
+>> endobj
+15847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.182 237.107 315.981 248.011]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a75683687bda865c93db529b76271bed2) >>
+>> endobj
+15848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 142.641 226.034 153.545]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a4f6d85b054ae413ec0b77ff6522b7304) >>
+>> endobj
+15849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 142.641 356.363 153.545]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 116.006 151.051 126.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_ad71d7986fdfd19215fc87726ebacf555) >>
+>> endobj
+15851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.866 116.006 190.054 126.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.867 116.006 235.055 126.537]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 88.624 156.281 99.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a2617e76e0aef9021ef98ea381cd1ac3c) >>
+>> endobj
+15854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.097 88.624 195.284 99.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.496 88.624 248.684 99.528]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 76.49 151.051 87.02]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a616f25ab81383a9c22ff3577a89a74c3) >>
+>> endobj
+15857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.388 76.49 213.575 87.02]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.91 76.49 282.098 87.02]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15859 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15863 0 obj <<
+/D [15861 0 R /XYZ 89 770.89 null]
+>> endobj
+15864 0 obj <<
+/D [15861 0 R /XYZ 90 704.201 null]
+>> endobj
+15865 0 obj <<
+/D [15861 0 R /XYZ 90 633.771 null]
+>> endobj
+15866 0 obj <<
+/D [15861 0 R /XYZ 90 633.771 null]
+>> endobj
+15867 0 obj <<
+/D [15861 0 R /XYZ 90 567.251 null]
+>> endobj
+15868 0 obj <<
+/D [15861 0 R /XYZ 90 538.508 null]
+>> endobj
+15869 0 obj <<
+/D [15861 0 R /XYZ 90 484.491 null]
+>> endobj
+15870 0 obj <<
+/D [15861 0 R /XYZ 90 457.483 null]
+>> endobj
+15871 0 obj <<
+/D [15861 0 R /XYZ 90 430.475 null]
+>> endobj
+15872 0 obj <<
+/D [15861 0 R /XYZ 90 403.466 null]
+>> endobj
+15873 0 obj <<
+/D [15861 0 R /XYZ 90 336.598 null]
+>> endobj
+15874 0 obj <<
+/D [15861 0 R /XYZ 90 336.598 null]
+>> endobj
+15875 0 obj <<
+/D [15861 0 R /XYZ 90 307.94 null]
+>> endobj
+13330 0 obj <<
+/D [15861 0 R /XYZ 90 280.932 null]
+>> endobj
+15876 0 obj <<
+/D [15861 0 R /XYZ 90 253.923 null]
+>> endobj
+15877 0 obj <<
+/D [15861 0 R /XYZ 90 187.14 null]
+>> endobj
+15860 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F111 1509 0 R /F68 3017 0 R /F24 537 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15894 0 obj <<
+/Length 2570      
+/Filter /FlateDecode
+>>
+stream
+xڵZKs�6��W��){ <�P��ĶR�:����"�T���c�#K���x�g$�J�@ݍ��~:�����4fA�҈F��U�� �)<���`��Œ`��w
�CY��Ż�aU�ߨU-/�旵��ON�\�&��P�%8|UȦ���Օ�$	U��[�cNCA����/GoΎ>
�	�� P�����#V0�K�K�೙�8ep-�?��s��9Q�o�����q� BF�!�{�Z�j������7m^�F�n����$�`I9b<�����*��y��쵽q^�]���j��ld��^G
$1�(wA�㰺��w�W�j���8�j��W_;G���(8�)Q���o�� 3!k��U�ʶ�2���,�]�h�r��8�A�4̝��T{�{%�V5�tr��H3���T�Ow-Yx҂Dn�cf��#���3;tYT�_n8/�XU� 
�P[�i:��y�����
+aV�7�.P�ξ*�R�ھ���k�?��2�q�Ff7��킊!�
+�g�˰|^�?`L�%$/��U�KY��Ҭv� �m���0����0�C�����yymY��M^�z��۝������MU��o�K�;������P[Q7��.�/h,��nFjИ�Dp#KDxfRM���㬂G�Up�v��n#�-c�n*����^Z��h�\9���e�b�|�ޑ�h���O7R�ܭ�y�fy
a!��� r�Ӻ�#��V�e�Oj�5�u�1�Q0
��<���

%ڎm�R�M��}.w'w�7s6����S2�^�I���L;��R�8�݄��A�,�ڬ���
q>Y-M�>�޿ИOC2��P#zA��v1D`�B�3���uy��ܹ�����%�8�r;h��&��s�w���@^<���,�k�*��s�Qـ@C�'��!�
��z����n!�
�
�p5��ot@��V'�	�F�K�!4� ۯ���VV�/��"�:o
+%�t
�$|�ⅽ)dy���n���X���f�S
�jUuV�@+Y�6�:⒮�'�UU���f2
Y�HS7��]�f����],�q�Dq������M��jNNd*M'�>,�v���J��W@!�9A*�e65����ae����M e½Rw3:%H����j��䐟�R�ܚL�Y����Q�-���p���Q��Y�qC�"L
�ٓ�p�;]EM��n_���D?,�^�"�#닯���[�o�8^�o T��_�rg//���+�POν'狳�#���0�H*�l�:��j�K����~o�u�m�ܴr��מvn��������i��!"E,J�9�PU4=�Iڷ=�
�(b"Q
%��n�ZP
B۰�@1�DI�C��$�U�
�b���K䉅�E
gg@�jx���qJE4����FuD`\��)�0O�%�@
�s`hL{p���?�� ����슂���!�ҹ��y����K�?
���‰��Gݺ4;-���`dB���j��
��-��y�Q!���O@��
�ړN�Bݡ(�D� ,���.S�Co� ���Z��zd�=x�`�E��C�A��-�,
X��y at .\l�b	\�T��n$Ҍ%�<��*�I�9�����ib �wtѴ���
��ͅ��35,ˢ������.�g�������!#ŇL�"��Q�[xvS[��u"W3Y���^�9 {�eI�I�L��>�?Y�����]=?9Y˻
�7]�0�Q���} C�LL�tߞ	f����l�H�&ϛ��"���E���G�# ����r��t[f�m`��bp�x��)��N
����P$�� UuQ�a ��7�
��@ 	E
�Tb���hC�F���a�b!vtҠ�jp�f�X
{J��������%̲\Ō�nz| �)��h�^����B�R
G�߫v[�S��cn{�ʬ�MD��t\M(6�!�lV��=��7�!��

��
�P�+̈ts�i\;�!Yϡ��4=
�Id��;�_�b�>u�+
8TM��5"�Q�u�^G$
�t�ֹۜ*
C�P��t�p�W�l��;����T
���Rr�uY�Fղ�t`rrG�N��}�?W�wq4��\�cͬ7�Ĉ
4�y9��觌Ӌ�g�X�}�
��5�,Kg���ά
+��D��D�b^�]| �I���~߶�m�2��!
rؗ��z�Z_VUa��ί;��u`�@�:0�}�嵈P����ٗ��s���?L��?|Ԯ�4A�M����簥rX+�F�5��z���W}�a�w���-��ʭ� U�������
�ʔ�����_漍����y���m�R�1+��V���IN�
a�@�
�&���n{�CfPpZ���Γ2c�m����� �o�ɯDJʡx��ώ�
���h��:rc8�=h�����K�p�J
�
������0�����/�@==����N=����z[��(�q�:��{�����Q�?uqp��*�m�G:�,ѫ*rS���A�������ݿ-�!@���j7m�99>��^7��FxmgG�@��}d�cӷ'X0�6;�:*������v� �~:�gu�A6�ݛ�݇n���5
^W��k�?�+��
+endstream
+endobj
+15893 0 obj <<
+/Type /Page
+/Contents 15894 0 R
+/Resources 15892 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15772 0 R
+/Annots [ 15884 0 R 15885 0 R 15886 0 R 15887 0 R 15888 0 R 15889 0 R 15890 0 R 15891 0 R ]
+>> endobj
+15884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.141 665.984 219.329 676.888]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.006 588.583 331.193 599.487]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 530.506 124.471 537.725]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
+>> endobj
+15887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 522.229 124.471 529.755]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
+>> endobj
+15888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 514.565 124.471 521.785]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) >>
+>> endobj
+15889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 363.301 492.188 377.249]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) >>
+>> endobj
+15890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.628 265.057 201.531 274.9]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) >>
+>> endobj
+15891 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15895 0 obj <<
+/D [15893 0 R /XYZ 89 770.89 null]
+>> endobj
+15896 0 obj <<
+/D [15893 0 R /XYZ 90 721.073 null]
+>> endobj
+15897 0 obj <<
+/D [15893 0 R /XYZ 90 484.744 null]
+>> endobj
+15878 0 obj <<
+/D [15893 0 R /XYZ 90 461.285 null]
+>> endobj
+15898 0 obj <<
+/D [15893 0 R /XYZ 90 461.285 null]
+>> endobj
+15899 0 obj <<
+/D [15893 0 R /XYZ 90 388.606 null]
+>> endobj
+15900 0 obj <<
+/D [15893 0 R /XYZ 90 348.934 null]
+>> endobj
+15879 0 obj <<
+/D [15893 0 R /XYZ 90 324.321 null]
+>> endobj
+15901 0 obj <<
+/D [15893 0 R /XYZ 90 324.321 null]
+>> endobj
+15902 0 obj <<
+/D [15893 0 R /XYZ 90 251.088 null]
+>> endobj
+15880 0 obj <<
+/D [15893 0 R /XYZ 90 227.572 null]
+>> endobj
+15903 0 obj <<
+/D [15893 0 R /XYZ 90 227.572 null]
+>> endobj
+15881 0 obj <<
+/D [15893 0 R /XYZ 90 185.867 null]
+>> endobj
+15904 0 obj <<
+/D [15893 0 R /XYZ 90 181.384 null]
+>> endobj
+15882 0 obj <<
+/D [15893 0 R /XYZ 90 141.652 null]
+>> endobj
+15905 0 obj <<
+/D [15893 0 R /XYZ 90 137.169 null]
+>> endobj
+15883 0 obj <<
+/D [15893 0 R /XYZ 90 115.121 null]
+>> endobj
+15906 0 obj <<
+/D [15893 0 R /XYZ 90 115.121 null]
+>> endobj
+15892 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F60 540 0 R /F11 621 0 R /F8 802 0 R /F75 562 0 R /F118 2438 0 R /F94 771 0 R /F24 537 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+15937 0 obj <<
+/Length 1405      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~����I@��~1�m�m��k�����ĊcL�]Y��CҒ%�g3�b˓h�<<<���C�8�8x�{1읜)d$���&08P� !��8�
�ѧᛀI���0˽~�˻�����{�{�p@����g��O8��7F���7hp���_{x�
n�$q�'�%�L�D�w�#��-^M
.c�q�Xd���� *l�}���`�A�јx�13�
�QL0XD��I1K6�H�DZ�@*����vʐЪޫ�[�"1�J8[�p~
"F�y�ߦ�b�k������[.�O����b
���"�!��*Ra�n�F�=�;�!Ft۝�l���|��4cy��pAq�
�i^nY��
gm������H���<����Qڜ"(҂U����
�E5�l���	��8{� |܍��L
��DD�I��
a�!�F�!����~�Z/�����b��@�
+IA 
0d�� ߔ<c@
HI���$�b�S
�9d�r��I�M�;P�5^f�rŔj��t�Ȓ2�oާ7��H�봕>;)76l��r$�񖟃
��I����z5��������a;��.�SF�v�
P
��8������D�v
R��ޥ��uv7N�H(� T��h�R�h
�u��؁�k):��K!Nh۳��-D�Ll�cH,�x�L�df��f^��'
+�~4�g>׏|�ui��Q��
�h���uz��
E��N څ�@	���0rZ�Q��Q����
+vg	'+Eil��cS��F$n����|_[P�[|�>A��(�BD�
X���ʾf������^���Q�4�6�!�SC5#���kU�n��8�I镪w�`�X�z��-�n�
��|B���?��`t
��!I��4+ E���ɴbRå��mc+� p���#iC`��מM�����ߙ����<M�z�;2ڃ�h�7Rr�[�x)�|�U>ͦ��G���(oS�X����`�a�IF�n�o�
+��z
��"nZ�PÕ�֛�U�8�!�)"����5�,j�E
��&��,�[��ѠO�6��I
GG˧�W˲H���E9/҃�r�������6F�����N�R��*�-�D����_�ʣ�
�r�Z��ߟ%�-�V��I�f�x:Ks
�ȒJV��Bf!�}�Z�pQ&Rz-=�ǎ&���]>�뎧�A��7�e[-�������
+%)��>��
EI�0%����t�5���z;�k�s4�~�)���ߘ�FW�vL��������;����

��k�տ��Á���}5�ƨ�;���o˴�>"\��s��%�o����i��^BQ ]h�#(�����"�������=���ˆ��_�۲\�ON��&�4����lS���h� Z�Zk��챡楕M�)�	�u�<�
+endstream
+endobj
+15936 0 obj <<
+/Type /Page
+/Contents 15937 0 R
+/Resources 15935 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15772 0 R
+/Group 15909 0 R
+/Annots [ 15907 0 R 15910 0 R 15911 0 R 15912 0 R 15913 0 R 15914 0 R 15915 0 R 15916 0 R 15917 0 R 15918 0 R 15919 0 R 15920 0 R 15921 0 R 15922 0 R 15923 0 R 15924 0 R 15925 0 R 15926 0 R 15927 0 R 15928 0 R 15929 0 R 15934 0 R ]
+>> endobj
+15908 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 15945 0 R
+/BBox [0 0 418 144]
+/Group 15909 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 15946 0 R>>
+>>
+/Length 557
+/Filter /FlateDecode
+>>
+stream
+x��UMo�0
��W��%�aI��C�a��
�ء�!�G�!�?Җ
Ǚ�=F"J"�(?���"Z�
+�w�
�>�Ox�&|���_>�� �(�p��Tn�	?� Y�G̀��N,�;�w(^+�:�D�$���l�5�H��`r��ĒME
����U�N)��K��x���;�ݾ���S���wD�mt4m���VG�Ƴu�Z�4e#�!#Pl+�u%e�uqy��_�n�m+ۃ���EDY��C��Rq�t�a�
(�35��H�t���B�Y�*en�2m{և����Sp`�C��^�1�,�,�����|��\�g4�3�W�qj+n�X�
+�\r���0)ٟ7.›�֜�
e�5�b�BR�d��S��
��J��aZ3M�47���e���%��N��Q��F��
uLA4jxb����D�.bt��f�!�Xg
�t���� ��M���J�����B[��[h~��W�	�uQ�
=���Nz�k5E�Ioœ�dি
��X
F�F�d�N�
�O�7���jn��uD�
2����Zoo���Pv�����s��/.��|
+endstream
+endobj
+15945 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+15946 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /NQEGTO+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 15947 0 R]
+/ToUnicode 15948 0 R
+>>
+endobj
+15947 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /NQEGTO+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 15949 0 R
+/W [ 0 [ 700 667 556 333 833 556 556 222 500 556 556 556 556 222 556 278 667 611 278 556 556 667 500 556 500 584 278 278 500 611 278 584]]
+>>
+endobj
+15948 0 obj
+<<
+/Length 15950 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0��>E��Š�:"���E/��br�j
�Y�����*(|���3'��/�
W�Yv��a���2߭$��u�O���?�$L��n[V�Z=�Q]�����n��枞"�X�n�Q_�����Uw7�&�+K��a���U�71�}�U.>��ѕ�e|m�X�c$9+Z��d��RT'�jX=���H��,����	�ӹKO�"i<��J�<U)(GL�
+�
��@H�N�r�;�� ��
$=塋B,t!P�l�	O<�d%~y �U��_I��W��c2�
+Ss�U�g<�e �e���/
������W���W����.�������w����Ȼ�ni���m��d���h3���߿����
+endstream
+endobj
+15949 0 obj
+<<
+/Type /FontDescriptor
+/FontName /NQEGTO+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 15951 0 R
+>>
+endobj
+15950 0 obj
+356
+endobj
+15951 0 obj
+<<
+/Length 15952 0 R
+/Filter /FlateDecode
+/Length1 2532
+>>
+stream
+x�UV{lS�?��#/���E��8q������~9NL쒐�3�G��QA
+Ii���Z�Z�Ж�$�=�m��V&U�c�4��DŽ�n�mt
�
+Ha�\�w��l}�����|��w�e��`
��ڱdl������au�c��ş���X��'b��j��}�2DZ�
�or
���K��#��B�9��?953c��Ʋ��N��g�k\�K�Ű9��KL�d���� ���4)�͗V�;x'� ��\6�����dp�n�Fr�<�j≹��#�:*�^k��q�Ȝ|�/���e��8�J-s+��J�a�����$��f���Y.��>�_O{��t�h3�n�^ҫL�F��ظ++�a���D��#Y9�Fז��ҝν�v�i­�]u>��ng�|����*�Fڭ΢��܌l�F[P`qV�j�wVEuy:W���V
��if=��d�'�m��H$,m��1�/x�S�=��#���
�<�
;�X��E�V
���,	xb5e
��ވ�]�H\׵�*TSh��D	�?����
WRwR!ޔzua��˛V���v3%���e�a?��!
+�&��<��Dk��
^�������]X�i
��Z��r۹��?{�2��W���ش�ELT�Rf��"����;S�I]y`$l�{��}���tzp�2�-�f(ؚS�Ã/r��S�Zka���8K�>�.#�Gy�
빢7�+z�����a:쯍��?�%����&��k0C��Ċ+�[���/�I	z��]
��E�U�'
��g�O�Jv������}}w:*Z�p��;]
��n<؟�g�y~�2<58��z����~�ջ]%��/>{|r��FK$��
+�|��~������+��
�LEg��Ы�����Q\ރ
����Y����{"�~���f8
p��p݇�D�?r�9=��3(�#j^nv��~"�??�'p�5�<F2�y��s/|e��>��23s0:��)�
�Ul
�F��Kq�~[!xv���
$�H�����~3� ��d!�
��t���FhY>B��-_�K}�}i��S�L�ja� �N��9���Y>`��������E~�Шn˨��W[^��c�����Q�Y���
�ww�w�z��mO#<9�c���.�����U0f]��W2��\�B�H&
�X��'���n�
�
��xR?�w��==-M�����_
ꖻ�"]�1���nOGG�������E�&��
���Z������8�F��֓Èa	��<
��J��%*�q�ԙџ�`tq1
+�ݿ~�r��^M��	���8�� {
�F��Lŏ
��5|Y�I$���7����=�]��
8!V�޸��@�VJ+�A�	yC�9���,�h+�
=�������=#��?9D�I�n��i;:vC{q��UVT�m�4�w�G����B��hlE�~���J��[�#�9��̼��.`�z�W����ƥ^!#�k�Ϭk�
gV�r��ҘU)�-�}�lwZ?}G� |?�3�n��f:4r���V���� ӟJ�X\��Kf��+n%G"�ȯ�ϟr��#.B憿���d�x]��6�J���u��
�Rf#e�05�_�Q-V�mK�0�TJ
����u)s��د�I��י�l C�[K�S+hٌ�0!2
��-�/Boci�4����M٣�ux��S���_���>��\��L] 6����Q���{6����O���|����W��g�
6�kXY������
��c�B+̄g��
+P(��&�>��i����� ��krEX�>�"��Jxs�=��φ���Xw���nfSk���.�.���
+Aà�#5�*|O�.�����Gj�W�
��;�:47QT@��G{y�~Z���P��.S�� �(��>k-��L�?��O
+endstream
+endobj
+15952 0 obj
+1889
+endobj
+15909 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+15907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.498 634.453 165.685 645.357]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 373.464 224.395 384.368]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 350.53 189.925 360.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+15912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.423 350.53 260.898 360.458]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a72b690903949d7e94dd627f7b49ab4cb) >>
+>> endobj
+15913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.47 334.555 422.545 344.461]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 308.948 224.395 319.852]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 286.014 232.982 295.941]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+15916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.48 286.014 347.013 295.941]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a082d6ea17c164846898241075349cd31) >>
+>> endobj
+15917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.035 270.039 389.11 279.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 244.431 224.395 255.335]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 221.497 254.671 231.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+15920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.169 221.497 390.391 231.425]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) >>
+>> endobj
+15921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.383 205.523 465.458 215.428]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 179.915 224.395 190.819]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 156.005 181.207 166.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49) >>
+>> endobj
+15924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.706 156.005 243.464 166.909]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a7ddc454f90fc8200f333eee7896deb1e) >>
+>> endobj
+15925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.518 141.006 420.593 150.912]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 115.399 224.395 126.303]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.449 91.488 159.628 102.392]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) >>
+>> endobj
+15928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.127 91.488 200.306 102.392]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a0ca3ec141b70de5ebcbf18d22aa1242f) >>
+>> endobj
+15929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.102 76.49 400.176 86.395]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression) >>
+>> endobj
+15934 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15938 0 obj <<
+/D [15936 0 R /XYZ 89 770.89 null]
+>> endobj
+1232 0 obj <<
+/D [15936 0 R /XYZ 90 700.606 null]
+>> endobj
+514 0 obj <<
+/D [15936 0 R /XYZ 90 693.533 null]
+>> endobj
+15939 0 obj <<
+/D [15936 0 R /XYZ 90 402.793 null]
+>> endobj
+15940 0 obj <<
+/D [15936 0 R /XYZ 90 402.793 null]
+>> endobj
+15941 0 obj <<
+/D [15936 0 R /XYZ 90 338.54 null]
+>> endobj
+15942 0 obj <<
+/D [15936 0 R /XYZ 90 274.024 null]
+>> endobj
+15943 0 obj <<
+/D [15936 0 R /XYZ 90 209.508 null]
+>> endobj
+15944 0 obj <<
+/D [15936 0 R /XYZ 90 144.991 null]
+>> endobj
+15935 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F91 766 0 R /F22 2982 0 R /F75 562 0 R /F11 621 0 R /F94 771 0 R /F67 3022 0 R >>
+/XObject << /Im27 15908 0 R /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15965 0 obj <<
+/Length 2786      
+/Filter /FlateDecode
+>>
+stream
+x��ZYo�H~�� �@V�v�d�Y,�݌�M ��;/I �m��#�r2�~�������O�ZͪꪯN�F��~������4QJҘ���]��(�Q�E7���Q���QJG�cFG�v�ͮǜ�6���b��>��l����q�aC��.��t�ɪb}�6�j�ӷ���Q^��f=�z��唱w�� �a�7��# ��"�;�׳��*ߢd;#�rv3N���c���&�3B5�&��QT��t��h���(F�N<����ˬ,�������
�Y�ە_�ܞ{=�%��j��B�?�\�~����ѾT$��|u��+���KD�Hu�l6�"�\�ѧ�_PgHF�-^�YS�3+��9�^?ݎ�Ѳ��4\�>�[���O���
+�S�j��z9�i[	1�BG� �ili�\u��>O��v�Y�u<��ޝ�W����Y瀞?�������
Ī�ix@�к ���e�����S��	�Bd���k� �Ӹ|0���A� #Md�v�jy�
�����?�z��˧e:br�3�-�J(�ci,(	\O�*'�o����9GOF��a�^�kf/��.�+�
4cW���y\%
{�BT�
&���0�v6�,kS��!lv��-��}Z\��!��Ab`�
�(�j�?��� �s(p~����X���ޣ
>6=��\����꡷��V���¢�����P�t
�
����_(>d��6Ib����(��A� ����ø
�eh�BY���_
+g侚��&�=�������Ơ�@��u�����w�c��=�]>=g�e�ʊ0����~J,!q��{��3��Ɂ�vJ���r�
+l-I"�+
�	�Os@�w���޼��?C�a�H�	����=�!�@z��O��mQ��5ҘUPt��f���C��p����R$�Pd���R��
����U��X��-z�S�\�v��A�L�p�fu�H���m(�!��f��
7�E�$F�#�0�(M%��=�C����1h�ƟU� J ���
����E��ФS�tj$�L�
��)�-2��t㿂:'o�J�/jq_��S�5*�i�d��%p��н�|�p 7�h���
(�V���V�������E��
�r��
AC�f���0�u�˫�Xz� �|[<V}�
S�|?h�Q��u\��wl�>�6ٛA�5���a��(� s���
'�N�Vf�iaZ�

IQ�҇m�&�=����m4�琀C�А�;܌�������<A+<�Ԑ�E�T	�VG��N�C�Ӫ��
��
�j�Y<
+��Ҵ��'IBx��q"����]�A��c�
�"H4;�2D��v��f6�
���U�9�atB��,��)D ݓ���Ipl �
���kj7 %�Ӷ0��9�%q����A���ù�{���T<� �R�L�Ba����s����KXW���P�9$�8%dO��8e�;�Ȥ 2��CI�tO�Ñ	��;c;X�0�yJ�nV{�ڶ|
9w>\�vj�PE���Ҽ���6@$�_/�C��@+BٲG3s����A�j��@�pd�)�0���#C��k(]ݸR�408�4oIdg���Sj��G�;
���'c
+�ac�m�
+�צHE���g.p
`W��Ek��*��r�!|��������!s3�k�YeEϢP�
+
O�t) �;]
+
�t)\Q`�u��)1m�
��F�\�h�Y��N+c�[,��%m����*O�*�����a�|���vH�
�}J\���;i�*;KO0�7C8��; ��`�da�����^z��ڹ'8���?/� �@���V����w��b�فŘ"q\��vk�D]���@��|�zܔE��5��_�
+^NEJP.sB������
�SO�۠]���/�	*72�� �3����%�����]o�v��4S�H6��y���	��JSΖ��Z��gb^�y
��wO
+�PH5z�P���N��N��+n$h

+4� �H�rG��M�{�޵������D���!vh^F}4"(�`��������/��&��,��!Ǥ Ok�xXFp�'7��<3EX_���{�o;�̣wz����Q��)���a�"�����⍛�ط�E���y�Ց��6�Mݩ=t�52?�
��'I{(DiHQI3�b�j�Q]˿�' �0o|
"��b
-;e
$�/�Xb�^��
ws��KU7��̟V�����8��dh`��y����TG�Ou�`�.r
�1& ���u	P�kRR��.��d�sHs3�HдK�l��8A1B�D�(FHn^�u�l�R>4��
Xաÿ�� aZ�f$;��ĥ�8!��}Rq����P
��e<Զs�!L�/y��|	
+(�
CJQy2���9$ �+��ߵ������H���L�1;-N�'^]��:�@ΏL&�Ș5o�{�L XL}��yEn`2�r�����X�S@��lx�8?J9L�]^L)S� -壻��!��^Nᷙ��$
��ܧ����+8�4&c›lx\[˻@X�1_$gQ��]�TWWmu�+"�ڸ���~q���_�A����������f��
�b�^�5�M&��߯�pp�P���)[~
����G|!ȡؠ��WA�f8�EP����kv�	�	7�섋S?�30�S5�qH�����x�?؛�����c�F����y���7Z��!apj�&&�#?�~�h�o���ua�����ټ�y��ǫ��ۧ�2_����-�:K
+�^�ػ��Ree\��ߎz�%h��RQF�{m�B�“�$�fG����t
��W"z�%7��Hx*"
+endstream
+endobj
+15964 0 obj <<
+/Type /Page
+/Contents 15965 0 R
+/Resources 15963 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15976 0 R
+/Annots [ 15930 0 R 15931 0 R 15932 0 R 15933 0 R 15953 0 R 15954 0 R 15955 0 R 15956 0 R 15957 0 R 15958 0 R 15959 0 R 15960 0 R 15961 0 R 15962 0 R ]
+>> endobj
+15930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.517 686.234 169.81 696.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a6b20922fdda0a1d3edcd6e642d882f68) >>
+>> endobj
+15931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.952 686.234 309.485 696.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251) >>
+>> endobj
+15932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.432 686.234 514.653 696.765]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+15933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 674.279 227.553 684.81]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+15953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.687 647.148 213.6 658.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_ad476cd68eb7f02eff3a184b8626352a3) >>
+>> endobj
+15954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.48 647.148 312.955 658.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) >>
+>> endobj
+15955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.009 647.148 469.23 658.052]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) >>
+>> endobj
+15956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 608.435 169.013 619.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_af41610855fb92674656e2f24427f002b) >>
+>> endobj
+15957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.829 608.435 321.49 619.339]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) >>
+>> endobj
+15958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 549.105 273.756 560.009]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a39f667f349cf531d9948abac9bdc0250) >>
+>> endobj
+15959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.093 549.105 366.736 560.009]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 514.518 281.504 525.422]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_aa216cf725abad2dd8e9fe71fc4555880) >>
+>> endobj
+15961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.498 386.587 165.685 397.491]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15962 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15966 0 obj <<
+/D [15964 0 R /XYZ 89 770.89 null]
+>> endobj
+15967 0 obj <<
+/D [15964 0 R /XYZ 90 704.286 null]
+>> endobj
+15968 0 obj <<
+/D [15964 0 R /XYZ 90 625.126 null]
+>> endobj
+15969 0 obj <<
+/D [15964 0 R /XYZ 90 565.517 null]
+>> endobj
+15970 0 obj <<
+/D [15964 0 R /XYZ 90 529.216 null]
+>> endobj
+15971 0 obj <<
+/D [15964 0 R /XYZ 90 467.919 null]
+>> endobj
+15972 0 obj <<
+/D [15964 0 R /XYZ 90 467.919 null]
+>> endobj
+15973 0 obj <<
+/D [15964 0 R /XYZ 90 405.268 null]
+>> endobj
+15974 0 obj <<
+/D [15964 0 R /XYZ 90 173.742 null]
+>> endobj
+7519 0 obj <<
+/D [15964 0 R /XYZ 90 152.899 null]
+>> endobj
+15975 0 obj <<
+/D [15964 0 R /XYZ 90 152.899 null]
+>> endobj
+15963 0 obj <<
+/Font << /F73 560 0 R /F11 621 0 R /F91 766 0 R /F60 540 0 R /F94 771 0 R /F68 3017 0 R /F111 1509 0 R /F24 537 0 R /F75 562 0 R /F35 1248 0 R /F7 803 0 R /F10 773 0 R /F8 802 0 R /F118 2438 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+15992 0 obj <<
+/Length 2634      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�F~�������\y��n
�M��X�K�4��R�JRq��~�\Hq��|��]�A�8:��9߹�xt7£7g?O�^^Dl��$��h�%x�����>���/�_G,�IB��������~?�V��^O��<#p
�� P�f��O_�h_�:ˆ%��^/Z�8e𙏮��}��XB<�B"���.�cLp k�)���4F� -�J֛�1�
�,FLt����r%�*p�,�E�2����MV�raDQ�E ����c���Qw��eV{@�q�-ʊ��lLE�uLD �=��.묱+�ۺ��Yc�����H�U-FT�K�������J0Jp%$60�Ɣi��d#�1!A�J
~:;��57ս!Y��z�-!��K_����OFa�H
d5�&@C�#v�p�2�IH	b���on���,
+�Q�>���—G"r8H�%4rM[
+4Y}U4L�(�3D����� R���:�DC !�����$s	�{��V�x"}���O�ԍ��zQV�#�l���
")�dЩ%q�4b��y
"C�ȦM͝6u>ȟ�����G��gU�3H�T��|z
m��v��9E1�
'dͳ%z���z?��	��:!/�6��ͦ*��}P̐E8M�3fk�j#�iY�f6�r.�/<e�q�Zy�4�}�2�X���Jخ��jW vA��P�@x�-�ޗ��� .��H�0y`R^������Tg�%R�e����Qx����Y�L�����K횴��Y�6���n�o��x��$A
+4�
>M���[��FYp�hO
+u��p��b�M���0u��z��pg"�+
���P
��i��M�f���rޮ���
+H��M1�ʳ�ֵo��X�
��a ��ڲ�Zk�Y�4�sYϪl�
�n�.h�,o7����­���TF��Y�q(��'���T���[^��i,�!��/W�\�dѴ��bDug�Ň7g�OZ֕:@Z�қ�2����*�y��Vi����"/�X�
�Sdy�婆J��	"��̏��@�@Yw苫��^]x3
�8����p�Ba� �6��T

�N7?9h�1Ԍ<ْل�C-
�� J�P��U�i��`
�c�@�HYb�
g�H�϶��c�n%)���v�b=5O�n��x
+-c҅�� ��Z�(�k at Ce��$6���]"ѕ�)@�g� 
�1����	��|X1�AN�'Q
��	wa]��h1�f��<&VW�]�U��e6���
�b�妏ㄶ9�f�*�i'���B�B,wB�r�1���N
+�Q
�C���-/1���x
���Q<��X�œ>��<���J塋`��X�	�
��M0;	���8�.���c`���s�����ww]�c���< ��C�s���۳3 l��s

+��3d��N%cƂ�X���͢n<��-��i�V���j�1d\����F��9��) ����|�F�/|Q�@q
�Gq��6�7תKW^�s_�ph��	���
�u�-��2��?5���1h"iY���{E����$�NDQq?v
ׯ���q�>e�b��C� �J�
͘�n[�W�.�S���M9�
�>�f9XT��n67��0�d4�n��t�X�����M��:��i��L�9Q�z�&���h�c���N2��0���{�0����
	�;�q`<4�Ӟ�6W��QS��g��A$�c��Q����ȭ�aN9.f������#y�� �N����kq%�D=[���)
���p&\<�&\�����$��Eԭ-������h�d�߫o�G���p ���Ŧ�uv&S4U&��6���G[���`�B��y��l�4b�$i��V��T;#P�ƃ�XZY�γz�V�v���NG�y9ۨYN�K��8g�u�����s'
Y��B�eU�quQ湙Uu385 [...]
��?<!7Tr
+��

[;����y=�r�n�m-��i5�)��t��@��T����tѵ���
8�|r�>K��BkHO�l�G~C����>)�iZe5���/QeN�ݿ�lާ� $SU`��x�L$A,"�N���N�P/:�
-���v��=�8��c��W�*=R2�� �jh�EP���H��?� ���}���t
��?�o�-a� �s��n�8�m�u:�7�/��
f�e;o�QQ���>�
t�D�_���L��#݃�_�Z�lc�xy�b�� l+n�&[�m{�P��Y�Y��WWo��ﵬ~PO�-ߥŦ}�M���ݪ���	"�J�J_�i;T=�6�2����f^��a��$ߒe�4��/o7w�,��̰�eO��	t�
+��bUV]rZ�G�

�_Η/�
+endstream
+endobj
+15991 0 obj <<
+/Type /Page
+/Contents 15992 0 R
+/Resources 15990 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15976 0 R
+/Annots [ 15978 0 R 15979 0 R 15980 0 R 15981 0 R 15982 0 R 15983 0 R 15984 0 R 15985 0 R 15986 0 R 15989 0 R ]
+>> endobj
+15978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.537 512.951 501.708 523.855]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5612670116c6576925acad22b7df89e5) >>
+>> endobj
+15979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 158.156 170.687 168.686]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371) >>
+>> endobj
+15980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 130.339 170.687 140.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_afbcfd5d585123fad758b763b4e2ed336) >>
+>> endobj
+15981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 130.339 233.211 140.87]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.523 170.687 113.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_ab90c3d16fa19df74d838587f40d74477) >>
+>> endobj
+15983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 102.523 233.211 113.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.546 102.523 301.734 113.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+15985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 179.554 85.237]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+15986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.052 74.333 250.666 85.237]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a3d49b2488d36bda4fef0109bedf6b0cc) >>
+>> endobj
+15989 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+15993 0 obj <<
+/D [15991 0 R /XYZ 89 770.89 null]
+>> endobj
+15994 0 obj <<
+/D [15991 0 R /XYZ 90 692.066 null]
+>> endobj
+15977 0 obj <<
+/D [15991 0 R /XYZ 90 513.948 null]
+>> endobj
+15995 0 obj <<
+/D [15991 0 R /XYZ 90 509.464 null]
+>> endobj
+15996 0 obj <<
+/D [15991 0 R /XYZ 90 428.935 null]
+>> endobj
+2008 0 obj <<
+/D [15991 0 R /XYZ 90 299.5 null]
+>> endobj
+518 0 obj <<
+/D [15991 0 R /XYZ 90 292.778 null]
+>> endobj
+15997 0 obj <<
+/D [15991 0 R /XYZ 90 176.736 null]
+>> endobj
+15998 0 obj <<
+/D [15991 0 R /XYZ 90 176.736 null]
+>> endobj
+15999 0 obj <<
+/D [15991 0 R /XYZ 90 147.186 null]
+>> endobj
+16000 0 obj <<
+/D [15991 0 R /XYZ 90 91.553 null]
+>> endobj
+15990 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R /F24 537 0 R /F91 766 0 R /F94 771 0 R /F11 621 0 R /F118 2438 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16020 0 obj <<
+/Length 2006      
+/Filter /FlateDecode
+>>
+stream
+x��YKs�F��W��j��� ���{H���g���ك�b��PB� <(k��<	� E;�j/� �����v�
��c�����]�;	JB:�k'�N$���r>�C�7'c��#�M�"]\{�����t�>_�i�xy���P���
o7���a��&m���׼�H��2�,e�#���폳�����
;D	�P;Y1��vV��G#?��9�p���ƹ��k��N��c81(BGB�c'"����ۮ.���=W�U^�ɫR=V�QS��T���Y[պg�fzh�����S�0c���XL=>�W������l����#���<�Z�x��-���B܃wN)
+��	C�J�O���$���;�r��}��N��A�Rb4�n��E�'��ѹ�
!İej��A�^��V�� R:]I�ƀZ�����xb�ɂa�H�L��Sc�G(��
�˶��)P�OQ�硲���iD�&��ŦJW�Pi���e޴5O
%�櫬���{�K�:$���VŔ-�XS6����
��j��o�\]�&u����e���x�0�X���*)V]�W�����`ee�UWl��*0��(-^I�ȅ��l�tw��i�R��Z�0�i��%42:~�؟4
+�E�A�}>e��R`X��f��Z�UR���ͣǘ���O�ur�E &��~u�'��>��=���i�,�M��6�M*#
ZM�香\:f�A���!��D�~ҝa���=qr&Ag��EU?.���|�>n�ӳ����t��s�r�|lys�if��!q���M()��t�%�t�R���,붹<'r�i)�6�� -%���
z]�%�ˢ+Y���u���#[�e*r�;�s`�1��s �� ��������{�����a��=�D��6�q��9
 輢l����\L���}���t�O�[�BR4�'?@�哌���	R1��p���&/��Ѽ@
�C�'1
+��;4H�"�,�6�'{/��S��!���'#q�"`�3���*�
ڵ�c*K�A?�S�C$�v�$G��{�Nީ'����R���:�r�d4��`�2���
I�|��8�(&��dx�1b0e�./��f ���n�E��<�̋%�U�]Wf���<�#����@���i�5j��|�Ŏ/ȕ���B�:�R�)ƞKS2��t^��EW
\FU��ڃ2�*ZMh��t��M�br�
�,4
��o�V�bG�%ƾq*`�V�� ܧ�5�)��n�Uk�BE2h�͞� �=��
�DOq� �����$�����tx�?BI�
���C����jwv�d.BP�
C�/]��4
��B�b��,�"�˳oy��C�����|ێ��Ir}�Y.
ژ��-�y�Y;��WQ&�Û3�Z��
+T��F�Uw��
+Z���
^������� ���V����5ٵGY�>�?� ?Ld�؏�SUh
+|Ll
Z՛�)�!�KXJ�^ϧ.�h }UF?�b�0��C��p�
�����<ve�>��":��P��=��
�D��a(
�s��!�&��XB;"4:C�L���
�Nd�$��mv���a|\��
���
�1vu�l���c;C~��I�Y;[9�7��^�<rt�t7 >�!m�S������7���}҉0�6��d�ìW��n�kSe�X�4��})c��U?�����A~:XlC�
�X��p�0���`^
B�=��zb�4>.� h�����A,���!��'�"	��#�h
��
Z:�ZO
w)�2�� �a�>��
�!�ShHEȹh
+�{�׃`�?7���z�5BS+�
�F�A䄱����"���ض��s��a
o������O����3?�J�	���jX؄�x)������j���u�T����)Q
;�$��>='�lk

�h�o��}(�wL맙�y�za���ݷ����b��5��C��C/����ram>�Um�x�92q�ؒa�e��X
��
b#*G�۲�L�/.�
+�y[���_�����
+endstream
+endobj
+16019 0 obj <<
+/Type /Page
+/Contents 16020 0 R
+/Resources 16018 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15976 0 R
+/Annots [ 15987 0 R 15988 0 R 16002 0 R 16003 0 R 16004 0 R 16005 0 R 16006 0 R 16007 0 R 16008 0 R 16009 0 R 16010 0 R 16011 0 R 16012 0 R 16013 0 R 16014 0 R 16015 0 R 16016 0 R 16017 0 R ]
+>> endobj
+15987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 693.177 158.044 703.707]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a7176b36adef9683aae06961175ad94cb) >>
+>> endobj
+15988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.86 693.177 197.048 703.707]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variable) >>
+>> endobj
+16002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 660.876 176.505 671.406]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4090b6696c19cb93c705d9a9e06f4915) >>
+>> endobj
+16003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.408 643.679 450.955 653.584]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4c3c15515e1335fb69130aad4f371a1c) >>
+>> endobj
+16004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 617.243 191.718 628.147]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+16005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 617.243 288.852 628.147]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a32b7f9e0a2f54d199ad55bc008bfa62e) >>
+>> endobj
+16006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 584.942 191.718 595.846]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) >>
+>> endobj
+16007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.216 584.942 303.079 595.846]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4e8f85cded8a6be1916c2cc0bb31c540) >>
+>> endobj
+16008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 553.015 150.493 563.545]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a3a5d4b3fb638414792155bcef8b54c1c) >>
+>> endobj
+16009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 520.341 181.845 531.245]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a0b93ff227453cf62d922dab902055f8b) >>
+>> endobj
+16010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 488.04 181.845 498.944]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a4c3c15515e1335fb69130aad4f371a1c) >>
+>> endobj
+16011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 455.739 154.727 466.643]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_aca3690ce9d77a85740cdf8a508edf127) >>
+>> endobj
+16012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 375.583 203.075 386.487]
+/A << /S /GoTo /D (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) >>
+>> endobj
+16013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.573 375.583 296.324 386.487]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a587efac6e5a2fbde0a1866dbe4427224) >>
+>> endobj
+16014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.005 358.76 328.312 368.665]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+16015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 268.149 226.034 279.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set_a6e710cc6607e4ec2791b182707bb4f1f) >>
+>> endobj
+16016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.176 268.149 377.952 279.053]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Variables__Set) >>
+>> endobj
+16017 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16021 0 obj <<
+/D [16019 0 R /XYZ 89 770.89 null]
+>> endobj
+16022 0 obj <<
+/D [16019 0 R /XYZ 90 712.265 null]
+>> endobj
+16023 0 obj <<
+/D [16019 0 R /XYZ 90 679.965 null]
+>> endobj
+16024 0 obj <<
+/D [16019 0 R /XYZ 90 636.705 null]
+>> endobj
+16025 0 obj <<
+/D [16019 0 R /XYZ 90 604.404 null]
+>> endobj
+16026 0 obj <<
+/D [16019 0 R /XYZ 90 572.104 null]
+>> endobj
+16027 0 obj <<
+/D [16019 0 R /XYZ 90 539.803 null]
+>> endobj
+16028 0 obj <<
+/D [16019 0 R /XYZ 90 507.502 null]
+>> endobj
+16029 0 obj <<
+/D [16019 0 R /XYZ 90 475.202 null]
+>> endobj
+16030 0 obj <<
+/D [16019 0 R /XYZ 90 396.695 null]
+>> endobj
+16031 0 obj <<
+/D [16019 0 R /XYZ 90 396.695 null]
+>> endobj
+16032 0 obj <<
+/D [16019 0 R /XYZ 90 316.624 null]
+>> endobj
+16033 0 obj <<
+/D [16019 0 R /XYZ 90 232.795 null]
+>> endobj
+16034 0 obj <<
+/D [16019 0 R /XYZ 90 172.038 null]
+>> endobj
+16001 0 obj <<
+/D [16019 0 R /XYZ 90 146.613 null]
+>> endobj
+16035 0 obj <<
+/D [16019 0 R /XYZ 90 146.613 null]
+>> endobj
+16018 0 obj <<
+/Font << /F73 560 0 R /F94 771 0 R /F60 540 0 R /F111 1509 0 R /F68 3017 0 R /F67 3022 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16044 0 obj <<
+/Length 1298      
+/Filter /FlateDecode
+>>
+stream
+x��W[o�6~��0`����U��`@�4C�^��[�`Pd�*K�$'�~�/�%G1�n(�bS��~�!�����_&?/'���y1�Cz�[/�^�c$B�ZyW� 2�^��X(�C�e���{�|�v��k����	�%��@�Hz�vru��L��0b��������-&�M��#*�P�9�br�!�����X0%c���T���)��V���ʓF���}�6YYد�2�oU�$fJG1�LM)G����8�u���˺�T������NUISVZ���#!,BX�6�ggVf-�P�V�#8�r��sdo{!E����1
1щ�eQ7Vj��
����#���TYr���υjF����;F�(��λz�9�B��8��0J�4^U��׃j�.B��2e� �b(*EGv�}��7�N�u�G�� �Fp0�ˍ������-�3�f��v��I���~�>֪І
:�Ϊܶ[U�,�ˀ
+�>+�v�#�4W�A�
	g"H��e�R1���
+��n���Ʈ
pn�	���&Q�V��� ���2�
��M
� "B$a���<:�������A N
��uQ��u0�y@��e�VՈK����q�p����J����2���$MD�fU�-/��›>t
K�RE�N��Pkj�r���Ӥ΂FJ�U�
��E��wY����iG��(�v6�
z��z�Б
&�
E+��c �Cq�cG���
�*�R��7j{��a���z<�
+(dT<�
+��j�@��ɇ@
�}�#KD��eZ�z���H�2-�$	J�s
*�C~�l�Y���
Œ
[�m	.�!j�<��t�9.̐�
��;\<�ʫ}
+
o6 ��
c�(;��U�#��6(�p�!O�Ƽ����fynGM�����"���QݡHz��8�
$�Sw2��vR�3�,��w�eE��
�'�5��MR��G�jn�]9�����
΍�%�$�9�:��y2���")�)
� ES���)�}*\�>��V�U
輤��I�3]�!���t���dwԮ[�=�:��f���"k�$��R�6��?N�Y]���]:��zqo��Sp���������wF���S���JwU?WM���s ��V�����(���������}gO�3���_HQO�'��zy��S�3�Û�����,�{����y�%(;�����A���A-{�>�Ǵ5:����k;��V���.�o�b��A�;}䩪�
+o�]��&
+�
�P-U�o�:����Uϧ{Wo�f7��n��Zk�B���Y��Q��; m�J�M&�#

+�7��B
+endstream
+endobj
+16043 0 obj <<
+/Type /Page
+/Contents 16044 0 R
+/Resources 16042 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15976 0 R
+/Annots [ 16037 0 R 16038 0 R 16039 0 R 16040 0 R 16041 0 R ]
+>> endobj
+16037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 487.261 156.052 498.165]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_ac051318c19299feb9e33e822a773e8a7) >>
+>> endobj
+16038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 459.366 163.801 470.27]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_a0f5f7c074992bb3c4464fa554490fb3d) >>
+>> endobj
+16039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 389.936 194.297 400.466]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_ad5a1348ca7621bbaac38c11716affd61) >>
+>> endobj
+16040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.437 362.04 188.759 372.571]
+/A << /S /GoTo /D (classParma__Polyhedra__Library_1_1Watchdog_ae59da834d6abca4c75ec2cba498871f5) >>
+>> endobj
+16041 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16045 0 obj <<
+/D [16043 0 R /XYZ 89 770.89 null]
+>> endobj
+16046 0 obj <<
+/D [16043 0 R /XYZ 90 721.073 null]
+>> endobj
+16036 0 obj <<
+/D [16043 0 R /XYZ 90 704.201 null]
+>> endobj
+16047 0 obj <<
+/D [16043 0 R /XYZ 90 704.201 null]
+>> endobj
+2009 0 obj <<
+/D [16043 0 R /XYZ 90 611.308 null]
+>> endobj
+522 0 obj <<
+/D [16043 0 R /XYZ 90 604.708 null]
+>> endobj
+16048 0 obj <<
+/D [16043 0 R /XYZ 90 506.255 null]
+>> endobj
+16049 0 obj <<
+/D [16043 0 R /XYZ 90 506.255 null]
+>> endobj
+16050 0 obj <<
+/D [16043 0 R /XYZ 90 476.626 null]
+>> endobj
+16051 0 obj <<
+/D [16043 0 R /XYZ 90 408.471 null]
+>> endobj
+16052 0 obj <<
+/D [16043 0 R /XYZ 90 408.471 null]
+>> endobj
+16053 0 obj <<
+/D [16043 0 R /XYZ 90 379.998 null]
+>> endobj
+526 0 obj <<
+/D [16043 0 R /XYZ 90 333.472 null]
+>> endobj
+16042 0 obj <<
+/Font << /F73 560 0 R /F91 766 0 R /F11 621 0 R /F118 2438 0 R /F75 562 0 R /F60 540 0 R /F24 537 0 R /F94 771 0 R /F111 1509 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16123 0 obj <<
+/Length 1119      
+/Filter /FlateDecode
+>>
+stream
+x��Zms�6��_�o�s5���K��rI&��s�ܙޤ
F�Ђ�	�&��/n
'�6in��$��V���
+C.p�jbZ6�����l0>�@Ĵ����x�
5�\�"�C����o���6>�!�L��v�.#
M�����~�䟾��N�~��}*' H
V�G��"���7o�#L�1a"Z���w����f����m#
d)�l|���j�C
�S�˱j9l�D�	_��w
.�x���gy�� K˂q&�P��Au�]P�
+j�<�#�ʴ��d��i����P2�%��''WS�U����	�z�˳dYp�K��n�ΓLiXD�/�v��\-3[V"l%�
�k��
��g�m�
C��"�K.�
��w��[�ط�m �mddw��'��鉎)�8ܷ�.��}P�(,ٯ)�
�9 at SMg�$��?�p�p�+3��\�TfjH�g�>�v

W֜�B������FϤ���] ���<��L͂]����'���_��X=��:��
n�����/�������L-����۟�������>��崴�y��}�C��y)�¢�0=U�°�]����uӆ
��]؀�
X_��s��l�y�&q1��cb���T�#��8��6~��0�_��x��c�҉�M'�u�Έ
.Y�~
+�
+�q������d��n��PO��
�nZ��C5w,�g2��w�r��@�k� mx?r�.K_Ù.�''qmtv�A
ԗ4��Z!��[�FԽ6�`�,�G"�<+�,����#��ɫ,�Zy���w5خ�Lw���.yPʼ���B�
w�|������7&j��m:�]Ҿlj�+˦h/��#�M
~Zz�	E�
����[xh)�8�x�4�}�tw��W��m
�#�z �/X�U�M�Ϝ��}&B��s
�� ��� �_�`�Ï
z�n������l��_�G�Ru���GXe��[
��6ɧ�I��Y�~�
)5�����%K�����:-������T��>dG��G�$�Z�`��A�r�*�@��TuUpn�bq2
ϗQ�EdY�kI�gB�[�{�*�
+P��fQ�P��_f5��l��}����qL� H�Є�qp5b�]u�^l
�/S
��?��
+�?E7�
+endstream
+endobj
+16122 0 obj <<
+/Type /Page
+/Contents 16123 0 R
+/Resources 16121 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15976 0 R
+/Annots [ 16054 0 R 16055 0 R 16056 0 R 16057 0 R 16058 0 R 16059 0 R 16060 0 R 16061 0 R 16062 0 R 16063 0 R 16064 0 R 16065 0 R 16066 0 R 16067 0 R 16068 0 R 16069 0 R 16070 0 R 16071 0 R 16072 0 R 16073 0 R 16074 0 R 16075 0 R 16076 0 R 16077 0 R 16078 0 R 16079 0 R 16080 0 R 16081 0 R 16082 0 R 16083 0 R 16084 0 R 16085 0 R 16086 0 R 16087 0 R 16088 0 R 16089 0 R 16090 0 R 16091 0 R 16092 0 R 16093 0 R 16094 0 R 16095 0 R 16096 0 R 16097 0 R 16098 0 R 16099 0 R 16100 0 R 16101 0 R 16 [...]
+>> endobj
+16054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 659.306 223.309 670.21]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 634.84 223.309 645.744]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.627 610.373 296.564 621.277]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+16057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 576.108 145.791 584.855]
+/A << /S /GoTo /D (page.241) >>
+>> endobj
+16058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 549.485 285.097 560.389]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 537.251 258.537 548.155]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 525.018 260.191 535.922]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+16061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 512.785 311.727 523.689]
+/A << /S /GoTo /D (page.371) >>
+>> endobj
+16062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 489.314 186.747 499.5]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+16063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 466.465 145.791 475.312]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+16064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 452.175 287.867 463.079]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+16065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 427.708 285.097 438.612]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 415.475 258.537 426.379]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 403.241 260.191 414.145]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+16068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 391.008 311.727 401.912]
+/A << /S /GoTo /D (page.371) >>
+>> endobj
+16069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 367.537 186.747 377.724]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+16070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 344.689 145.791 353.535]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+16071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 330.398 287.867 341.302]
+/A << /S /GoTo /D (page.483) >>
+>> endobj
+16072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 305.931 285.097 316.835]
+/A << /S /GoTo /D (page.110) >>
+>> endobj
+16073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 293.698 258.537 304.602]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+16074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 281.465 260.191 292.369]
+/A << /S /GoTo /D (page.283) >>
+>> endobj
+16075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 269.232 297.909 280.135]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+16076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 256.998 311.727 267.902]
+/A << /S /GoTo /D (page.370) >>
+>> endobj
+16077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 233.527 186.747 243.714]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+16078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 220.576 295.069 231.48]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+16079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 198.445 145.791 207.292]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+16080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 184.155 287.867 195.059]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+16081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 159.688 285.097 170.592]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 147.455 258.537 158.359]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 135.222 260.191 146.125]
+/A << /S /GoTo /D (page.283) >>
+>> endobj
+16084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 122.988 297.909 133.892]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+16085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 110.755 311.727 121.659]
+/A << /S /GoTo /D (page.370) >>
+>> endobj
+16086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 87.284 186.747 97.47]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+16087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 74.333 295.069 85.237]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+16088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 661.642 362.272 670.488]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+16089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 647.364 504.348 658.268]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+16090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 613.025 362.272 621.872]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+16091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 586.527 504.348 597.431]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+16092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 562.087 504.348 572.991]
+/A << /S /GoTo /D (page.482) >>
+>> endobj
+16093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 537.646 476.672 548.55]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+16094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 513.205 476.672 524.109]
+/A << /S /GoTo /D (page.285) >>
+>> endobj
+16095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 478.867 362.272 487.713]
+/A << /S /GoTo /D (page.172) >>
+>> endobj
+16096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 452.369 513.045 463.273]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+16097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 428.91 362.272 439.097]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+16098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.261 428.91 382.197 439.097]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.748 403.752 494.684 414.656]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+16100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 379.312 501.578 390.216]
+/A << /S /GoTo /D (page.112) >>
+>> endobj
+16101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 367.091 475.018 377.995]
+/A << /S /GoTo /D (page.143) >>
+>> endobj
+16102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 354.871 476.672 365.775]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+16103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 342.651 528.208 353.555]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+16104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 319.192 403.228 329.379]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+16105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 306.255 504.348 317.159]
+/A << /S /GoTo /D (page.483) >>
+>> endobj
+16106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 281.814 501.578 292.718]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 269.594 475.018 280.498]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 257.373 476.672 268.277]
+/A << /S /GoTo /D (page.283) >>
+>> endobj
+16109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 245.153 528.208 256.057]
+/A << /S /GoTo /D (page.371) >>
+>> endobj
+16110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 221.695 403.228 231.881]
+/A << /S /GoTo /D (page.405) >>
+>> endobj
+16111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 208.757 504.348 219.661]
+/A << /S /GoTo /D (page.482) >>
+>> endobj
+16112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 184.316 504.348 195.22]
+/A << /S /GoTo /D (page.482) >>
+>> endobj
+16113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 159.876 476.672 170.78]
+/A << /S /GoTo /D (page.285) >>
+>> endobj
+16114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 135.435 501.578 146.339]
+/A << /S /GoTo /D (page.124) >>
+>> endobj
+16115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 123.215 475.018 134.119]
+/A << /S /GoTo /D (page.152) >>
+>> endobj
+16116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 110.994 476.672 121.898]
+/A << /S /GoTo /D (page.293) >>
+>> endobj
+16117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.454 98.774 514.39 109.678]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+16118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 86.554 528.208 97.457]
+/A << /S /GoTo /D (page.382) >>
+>> endobj
+16120 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16124 0 obj <<
+/D [16122 0 R /XYZ 89 770.89 null]
+>> endobj
+16125 0 obj <<
+/D [16122 0 R /XYZ 90 684.655 null]
+>> endobj
+16121 0 obj <<
+/Font << /F91 766 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16189 0 obj <<
+/Length 1261      
+/Filter /FlateDecode
+>>
+stream
+x��_s�8���~;�
�$[����ɥ�I�n�iG�`A|ّ�%��'�!B�&I瞰e���jw�����Fg�8��s,jS��5YX�KmL�]`]41��C�MԽ����㿳��A㺑�
�����pڸ��@7���Pߺ��4�\��߉�o�� � ,�@DmC˃І���z*
+f���\s�R�K��'
뢍0h��(�[m��j�m-�b\� nr5�M�D�8;
/Ww���n/Sv9�*e�_V���l�d��^��%1
+�S!�0�	�2`����4�ɥ�� �s��W<�����V�����OTT�Gt�_�)G�O�-P��wPU>LC>�ܱs��A퇙]��zB���ˮ�/�
e*2�c�
��cw61�Yhg��bsИ+>im�;d�'1g2L��Z7o��P�j2��#9V3!���]�n ^碐���S��e�Q��
 $Ej��)��k�Ҡ�ה�z/�r<�^U���{&��8�/1�d��H��.���3W������_�"��$"����'��yV�r��;�q�M!DքP���;�E��"�3F~�(2Z�&�I�3��Lq�#�c6��a��Pg�'c���w�\�)��Y��]W���Q
��~�����Iě�2�WZ��e_ڦ
��r�5�
ͽ9g�|�s��EYX�^ҽD�[g)�8�M��g�2��~I
�*��kh*�2.
3�G9����&W��M��
�7M��y�
+V��ܺ�
�
�TB��Q U���e��A���x2
C6�x��PN����2�EWB�M��L�~a�A�6u�S.������W�;�3X��k�TGu
§ !o��Ao���o��
�GY`lͦ�	p��
�,�P�M��	�r=�I�_/�c� /v>�}�݄��ٲ�
��>Z[�̑j�ߴ=T���W�T���w��
�F��=�n���K���j�71�e��ni��P
+���m�D��]?o�EF�f2+��<o���Ĝ%���
�c(%hw��Π��],ؗ�&��S8���{_�Lx�E�~B�|}��X�j���իc�}uӗ��x��
&]��y5�aҵ���		�l9�'$:���i~��l =����>e�Aw�XG�� �����_�6%���_l��3W�hpUzD�wZ\���K
�fRܟq9�����
�,?�І:b|�
ڭ��}�/Di����=���p
+^d����U�Ƈ������=��K�_�6��y�Q�
+�i��A�2�����$HO��$2
+endstream
+endobj
+16188 0 obj <<
+/Type /Page
+/Contents 16189 0 R
+/Resources 16187 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 15976 0 R
+/Annots [ 16119 0 R 16126 0 R 16127 0 R 16128 0 R 16129 0 R 16130 0 R 16131 0 R 16132 0 R 16133 0 R 16134 0 R 16135 0 R 16136 0 R 16137 0 R 16138 0 R 16139 0 R 16140 0 R 16141 0 R 16142 0 R 16143 0 R 16144 0 R 16145 0 R 16146 0 R 16147 0 R 16148 0 R 16149 0 R 16150 0 R 16151 0 R 16152 0 R 16153 0 R 16154 0 R 16155 0 R 16156 0 R 16157 0 R 16158 0 R 16159 0 R 16160 0 R 16161 0 R 16162 0 R 16163 0 R 16164 0 R 16165 0 R 16166 0 R 16167 0 R 16168 0 R 16169 0 R 16170 0 R 16171 0 R 16172 0 R 16 [...]
+>> endobj
+16119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 708.674 186.747 718.861]
+/A << /S /GoTo /D (page.411) >>
+>> endobj
+16126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 696.002 295.069 706.906]
+/A << /S /GoTo /D (page.428) >>
+>> endobj
+16127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 684.047 287.867 694.951]
+/A << /S /GoTo /D (page.493) >>
+>> endobj
+16128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 660.136 285.097 671.04]
+/A << /S /GoTo /D (page.124) >>
+>> endobj
+16129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 648.181 258.537 659.085]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+16130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 636.226 260.191 647.13]
+/A << /S /GoTo /D (page.293) >>
+>> endobj
+16131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 624.271 311.727 635.175]
+/A << /S /GoTo /D (page.383) >>
+>> endobj
+16132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 601.078 186.747 611.265]
+/A << /S /GoTo /D (page.411) >>
+>> endobj
+16133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 588.405 287.867 599.309]
+/A << /S /GoTo /D (page.494) >>
+>> endobj
+16134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 564.495 297.909 575.399]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+16135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 540.585 295.069 551.489]
+/A << /S /GoTo /D (page.428) >>
+>> endobj
+16136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 506.657 145.791 515.623]
+/A << /S /GoTo /D (page.191) >>
+>> endobj
+16137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 480.809 285.097 491.713]
+/A << /S /GoTo /D (page.117) >>
+>> endobj
+16138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 468.854 258.537 479.758]
+/A << /S /GoTo /D (page.147) >>
+>> endobj
+16139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 456.899 311.727 467.803]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+16140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 444.943 287.867 455.847]
+/A << /S /GoTo /D (page.487) >>
+>> endobj
+16141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 421.033 285.097 431.937]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+16142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 409.078 258.537 419.982]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+16143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 397.123 260.191 408.027]
+/A << /S /GoTo /D (page.287) >>
+>> endobj
+16144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 385.168 311.727 396.071]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+16145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 361.975 186.747 372.161]
+/A << /S /GoTo /D (page.407) >>
+>> endobj
+16146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 339.404 145.791 348.251]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+16147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 325.392 287.867 336.296]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+16148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 301.481 285.097 312.385]
+/A << /S /GoTo /D (page.117) >>
+>> endobj
+16149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 289.526 258.537 300.43]
+/A << /S /GoTo /D (page.147) >>
+>> endobj
+16150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 277.571 260.191 288.475]
+/A << /S /GoTo /D (page.287) >>
+>> endobj
+16151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 265.616 311.727 276.52]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+16152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 242.423 186.747 252.609]
+/A << /S /GoTo /D (page.407) >>
+>> endobj
+16153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 219.852 145.791 228.699]
+/A << /S /GoTo /D (page.455) >>
+>> endobj
+16154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 205.84 287.867 216.744]
+/A << /S /GoTo /D (page.487) >>
+>> endobj
+16155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 181.93 223.309 192.834]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+16156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 158.019 223.309 168.923]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+16157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 134.109 223.309 145.013]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+16158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 110.199 223.309 121.103]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+16159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 86.288 223.309 97.192]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 707.957 439.79 718.861]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 674.084 362.272 682.931]
+/A << /S /GoTo /D (page.461) >>
+>> endobj
+16162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.537 636.814 407.492 647.001]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+16163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 602.224 362.272 611.071]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+16164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 578.281 362.272 587.128]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+16165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 541.748 439.79 552.652]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 517.773 439.79 528.677]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 493.798 439.79 504.702]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 469.823 439.79 480.727]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 445.848 439.79 456.752]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 421.873 506.56 432.777]
+/A << /S /GoTo /D (page.104d) >>
+>> endobj
+16171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 388 362.272 396.847]
+/A << /S /GoTo /D (page.458) >>
+>> endobj
+16172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 361.968 501.578 372.872]
+/A << /S /GoTo /D (page.122) >>
+>> endobj
+16173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 349.981 528.208 360.885]
+/A << /S /GoTo /D (page.381) >>
+>> endobj
+16174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 326.006 504.348 336.91]
+/A << /S /GoTo /D (page.491) >>
+>> endobj
+16175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 292.013 362.272 300.979]
+/A << /S /GoTo /D (page.459) >>
+>> endobj
+16176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 266.101 447.89 277.004]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 232.108 362.272 241.074]
+/A << /S /GoTo /D (page.329) >>
+>> endobj
+16178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 206.195 504.348 217.099]
+/A << /S /GoTo /D (page.492) >>
+>> endobj
+16179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 182.22 504.348 193.124]
+/A << /S /GoTo /D (page.493) >>
+>> endobj
+16180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 158.246 439.79 169.149]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 134.271 439.79 145.175]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 110.296 439.79 121.2]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 86.321 501.578 97.225]
+/A << /S /GoTo /D (page.119) >>
+>> endobj
+16184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 74.333 475.018 85.237]
+/A << /S /GoTo /D (page.149) >>
+>> endobj
+16186 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16190 0 obj <<
+/D [16188 0 R /XYZ 89 770.89 null]
+>> endobj
+16187 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16284 0 obj <<
+/Length 1383      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�H}�+�
�E
�4��
�QHA���$5%ЀUхHb��;�9`IF8W�t=���O�4
`�
`.:�V��\��UD(2ւQ #	
+�Dz�0��d�^�>Yo�,@"}/�� �^�V�K��W��o#V������	0���,�����!� O�=���mCD�e�1D��q,��F�C];�ml���8��G�,������������-
��
�C"Ѕ�R<��ҏ>�W���<��a`{ؼ�W��	�./ɏ2�M����k{�O�����
�E̱ʱ����y�s��
�Ȯ�
��$�^��Wѓ����* ��
��0�sW~�]�C5
ׁC
l/R�> �Wq}{I~
=a�N��	B���S�4�V�.
����H�����#�IY�$��fEp����~��ʋ�
~��&���<"	��7��8vàb,��
��zޯ�}^ae��f�^�"��B��N�9/ŭ:���Nr����"
+}l϶��y�8������Vq�Uq�\
����
?��?�о*^hhF�=��%�G������i��yЬ�$����BA9g9{���=?���:ma�3�N�Ѣǁ�=�S��vy
S�`r���1R�5�P�Db���	�-@��H�i2�S7���j���������
��ڎ]
��g7X��:�g$xl��#�`X���0��f '��
��Y
+{
8��=e�T]#�z�@[czXJ<��ޏj�S�21��D��m�@�mSxxQ8���h^����'����|F��N�r����z覭Y;g�Br��s��]k�����o7��3ώ�j�T���:1�:T
QD/ ��v�
�8�W������D'���g��J�ԱQ?qVGI}9��8�B����eK1|��,�k��]�/���R�X��#Y�Yo�v����P�<
�L���&�qTU��p
�
+�7���q���
���*VwCYꨈV�-u2T[��i=-f��V�b%�H5�#%|�"�
���Zk�
,M���0�ڤ-�X"i{9���t�\���'~mp�~'G(��:��醕�K
��ݩNSv�.�~@�!����N�G��Ɔn�Z�
+txI�y�M��)4û�
�
VHW��K�M�ܚ���h�Q��ʤh�P�U��U�&
�
�~;Y�P�T�*q}���S�v�f裛�>���?��A
�n�l#L�e6(��%s
�o����S����[RD�J�o�%�܊"��(
+ŞAb�R��f���Qs�˘D������ֶ�����?���<��M�L�ql��s�kR����)�ޥ[tЖ9�XAF�F��$Y�>9����	]����	�}_HJ���03�Σ�Sn��z j+[n�)c� NJ",�A��X�I̞�>�n�/N4�g�!
�?��u�
+endstream
+endobj
+16283 0 obj <<
+/Type /Page
+/Contents 16284 0 R
+/Resources 16282 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16286 0 R
+/Annots [ 16185 0 R 16192 0 R 16193 0 R 16194 0 R 16195 0 R 16196 0 R 16197 0 R 16198 0 R 16199 0 R 16200 0 R 16201 0 R 16202 0 R 16203 0 R 16204 0 R 16205 0 R 16206 0 R 16207 0 R 16208 0 R 16209 0 R 16210 0 R 16211 0 R 16212 0 R 16213 0 R 16214 0 R 16215 0 R 16216 0 R 16217 0 R 16218 0 R 16219 0 R 16220 0 R 16221 0 R 16222 0 R 16223 0 R 16224 0 R 16225 0 R 16226 0 R 16227 0 R 16228 0 R 16229 0 R 16230 0 R 16231 0 R 16232 0 R 16233 0 R 16234 0 R 16235 0 R 16236 0 R 16237 0 R 16238 0 R 16 [...]
+>> endobj
+16185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 707.957 260.191 718.861]
+/A << /S /GoTo /D (page.289) >>
+>> endobj
+16192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 695.967 311.727 706.871]
+/A << /S /GoTo /D (page.378) >>
+>> endobj
+16193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 672.74 186.747 682.926]
+/A << /S /GoTo /D (page.409) >>
+>> endobj
+16194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 650.135 145.791 658.982]
+/A << /S /GoTo /D (page.457) >>
+>> endobj
+16195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 636.088 287.867 646.992]
+/A << /S /GoTo /D (page.489) >>
+>> endobj
+16196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 612.108 285.097 623.012]
+/A << /S /GoTo /D (page.119) >>
+>> endobj
+16197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 600.119 258.537 611.023]
+/A << /S /GoTo /D (page.149) >>
+>> endobj
+16198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 588.129 260.191 599.033]
+/A << /S /GoTo /D (page.289) >>
+>> endobj
+16199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 576.139 311.727 587.043]
+/A << /S /GoTo /D (page.379) >>
+>> endobj
+16200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 552.912 186.747 563.098]
+/A << /S /GoTo /D (page.409) >>
+>> endobj
+16201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 530.307 145.791 539.153]
+/A << /S /GoTo /D (page.457) >>
+>> endobj
+16202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 516.26 287.867 527.164]
+/A << /S /GoTo /D (page.489) >>
+>> endobj
+16203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.493 480.325 175.43 491.229]
+/A << /S /GoTo /D (page.178) >>
+>> endobj
+16204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.493 444.391 175.43 455.294]
+/A << /S /GoTo /D (page.178) >>
+>> endobj
+16205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.493 408.456 175.43 419.36]
+/A << /S /GoTo /D (page.178) >>
+>> endobj
+16206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 384.477 285.097 395.38]
+/A << /S /GoTo /D (page.107) >>
+>> endobj
+16207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 372.487 258.537 383.391]
+/A << /S /GoTo /D (page.138) >>
+>> endobj
+16208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 360.497 260.191 371.401]
+/A << /S /GoTo /D (page.279) >>
+>> endobj
+16209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 348.507 311.727 359.411]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+16210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 325.28 186.747 335.466]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+16211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 302.675 145.791 311.522]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+16212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 288.628 287.867 299.532]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+16213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 264.648 285.097 275.552]
+/A << /S /GoTo /D (page.107) >>
+>> endobj
+16214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 252.659 258.537 263.563]
+/A << /S /GoTo /D (page.139) >>
+>> endobj
+16215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 240.669 260.191 251.573]
+/A << /S /GoTo /D (page.279) >>
+>> endobj
+16216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 228.679 311.727 239.583]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+16217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 205.452 186.747 215.638]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+16218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 182.847 145.791 191.693]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+16219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 168.8 287.867 179.704]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+16220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 144.82 263.518 155.724]
+/A << /S /GoTo /D (page.135d) >>
+>> endobj
+16221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.429 122.292 203.384 133.196]
+/A << /S /GoTo /D (page.65) >>
+>> endobj
+16222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.669 111.02 216.625 121.206]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.607 98.313 262.562 109.217]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.158 86.323 286.113 97.227]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+16225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.12 74.333 296.076 85.237]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+16226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.627 707.957 476.582 718.861]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+16227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.59 696.002 486.545 706.906]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+16228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [462.415 684.047 474.37 694.951]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.378 672.092 484.333 682.996]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.906 660.854 383.861 671.04]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.924 648.899 378.88 659.085]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.924 636.943 378.88 647.13]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.924 624.988 378.88 635.175]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.943 613.033 373.898 623.22]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [466.282 600.361 478.237 611.265]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [488.816 588.405 500.772 599.309]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.559 576.45 465.514 587.354]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.416 565.212 386.371 575.399]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.865 552.54 415.82 563.444]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.491 541.302 374.446 551.489]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.788 528.63 425.743 539.534]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.042 516.674 405.997 527.578]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.155 505.437 376.11 515.623]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.145 493.138 376.1 503.668]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.242 480.809 435.198 491.713]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.883 469.227 445.838 479.758]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.977 457.616 420.932 467.803]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.59 445.661 406.546 455.847]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.609 433.706 401.564 443.892]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.294 421.75 424.249 431.937]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.908 409.795 409.863 419.982]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.668 397.496 412.623 408.027]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.313 385.885 419.268 396.071]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [462.645 373.93 474.6 384.116]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.616 361.975 370.571 372.161]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 349.676 423.153 360.206]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 338.064 398.247 348.251]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.197 326.109 418.152 336.296]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.321 314.154 414.277 324.34]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.189 302.199 428.144 312.385]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.207 289.526 418.162 300.43]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.599 277.945 401.555 288.475]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.799 266.333 470.754 276.52]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [455.482 254.378 467.437 264.565]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [448.837 242.423 460.792 252.609]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.711 230.468 459.666 240.654]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.036 218.512 436.991 228.699]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.175 205.84 477.13 216.744]
+/A << /S /GoTo /D (page.78) >>
+>> endobj
+16269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [475.138 193.885 487.093 204.789]
+/A << /S /GoTo /D (page.78) >>
+>> endobj
+16270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [462.964 181.93 474.919 192.834]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+16271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.926 169.975 484.881 180.878]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+16272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.705 158.019 378.66 168.923]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.338 146.064 383.293 156.968]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 134.109 423.153 145.013]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.424 122.871 477.38 133.058]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.871 110.916 424.827 121.103]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.706 98.961 407.661 109.147]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.451 87.006 446.406 97.192]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.893 75.05 445.848 85.237]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16281 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16285 0 obj <<
+/D [16283 0 R /XYZ 89 770.89 null]
+>> endobj
+16282 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16379 0 obj <<
+/Length 1420      
+/Filter /FlateDecode
+>>
+stream
+x�͚aw�:���)xw��J!���B=�"0�n��N��r��ޭ��� ڢ�5��^�"�_���I�#p+Nঽ��wq�J��k
+P���N�5
*�ݒ��C �����	�&��Tq۴u�C��g�������eiȫ#n���~�%���xIqߊm8H�u���w=�*D*BD�^ȩ�ȋbY���m
��{�Ϣ�R����M{��@��J��%��R�a�cNm�3� �N�l��
�
�x�$@�a��i�T����-��u�EI����]�n
���8+�,d���:c1�Y)h�ӔER��ޭ�0�EX'��]�Dˈt����R2 ��-�u��u��h'��Ēd���@�}LR܅�8�P��/���u�Ӭ`��h�z$
!w�v/�D�
+���8?��t�0t�ę��13���J�͜�a��`[�ܱ��f�
�M�SOF��|P}-��H���� ���4�
S#9���%����t)Ϲ��.����1�M
+�)L�>2��Q#Ϗ��]��vC�Mn�<�Bs��v��
����9m9��eu&�]{�#{�#Ӿ6m��$�t���'�S�5!hO�Ƥ*�g��,
+U�ƺ����
�Gvsԑ���w��[�ƚT��ϯ괎����V[�#�
+���jJi1�O_9 *�<�"I��C-4��F��ı�v�爧�FC“���ז�-����Ӷ���v��9��6��ҁ�:~[fE�g����|{|e�6�����r
�X�?�h��vPlt��)7���M��d����$DVtGB�xy9�1&a���Tп:��A`��<S��㏚`
ME
+G��5�0T�@m�
+�-��[?]�n����oצ���sO�$q3���s���hYG�DU�����p�췾�4�Vq3ۮt�?�[֦�ij���:�E��8\���^H#��bE
Rn�����܆��;
��s�
�o���
�
5^��h�ZG1I�/n�ٓ$^�ad|Ϸ��s;pb�3�QV'�n
%�A�؎bC:�l��/�
D�����m�0aM!�VǾ55���Y�	6�-Y>��t6��j�8�ƉU�Y%J�Ϝ��@�f���\$1
�(���/f<�c��AaLe��!.�TU�2��s��l|�#m����#
8p:u���%��%^�o �L|�/O�,"��
���͛A�ƫ]���;���֙�lE5g���)J
��W�I
�$���
+H6�p�Ai�8OI�Du�Y�a|�ܕ�mH��'OO(�W�T��A����P+�)|�	� �*(
V����2��F��žqC�>gF��(rq�A����C�E낇�p]������1�����ga�
���'
+���,X�y�N�#�L�C�"�*�}y��W~�V5�/��Á��,�^^\��V)�W<�����i/��C�����6	�7*���M���
�}sU�
+endstream
+endobj
+16378 0 obj <<
+/Type /Page
+/Contents 16379 0 R
+/Resources 16377 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16286 0 R
+/Annots [ 16280 0 R 16288 0 R 16289 0 R 16290 0 R 16291 0 R 16292 0 R 16293 0 R 16294 0 R 16295 0 R 16296 0 R 16297 0 R 16298 0 R 16299 0 R 16300 0 R 16301 0 R 16302 0 R 16303 0 R 16304 0 R 16305 0 R 16306 0 R 16307 0 R 16308 0 R 16309 0 R 16310 0 R 16311 0 R 16312 0 R 16313 0 R 16314 0 R 16315 0 R 16316 0 R 16317 0 R 16318 0 R 16319 0 R 16320 0 R 16321 0 R 16322 0 R 16323 0 R 16324 0 R 16325 0 R 16326 0 R 16327 0 R 16328 0 R 16329 0 R 16330 0 R 16331 0 R 16332 0 R 16333 0 R 16334 0 R 16 [...]
+>> endobj
+16280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.292 708.674 197.247 718.861]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.937 696.719 203.892 706.906]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.604 684.764 231.559 694.951]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.414 672.809 255.369 682.996]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.041 660.854 178.996 671.04]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.658 648.181 195.613 659.085]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.675 636.226 185.631 647.13]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.374 624.988 151.33 635.175]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.395 613.033 172.35 623.22]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.464 601.078 183.419 611.265]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.812 589.123 207.767 599.309]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.203 577.168 165.158 587.354]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.819 565.212 176.774 575.399]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.022 553.257 175.977 563.444]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.464 540.585 183.419 551.489]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.589 528.63 179.544 539.534]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.358 517.392 182.314 527.578]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.062 505.437 200.017 515.623]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.024 492.764 209.979 503.668]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.476 481.526 209.431 491.713]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.097 468.854 164.052 479.758]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.474 456.899 183.429 467.803]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.009 445.661 245.964 455.847]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.71 433.706 237.665 443.892]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.453 421.75 162.408 431.937]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.044 409.795 209.999 419.982]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+16313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.006 397.84 219.961 408.027]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+16314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.832 385.885 207.787 396.071]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+16315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.795 373.93 217.75 384.116]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+16316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.723 361.975 263.678 372.161]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.521 350.019 261.476 360.206]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.203 338.064 258.158 348.251]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.165 326.109 175.12 336.296]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.819 314.154 176.774 324.34]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.823 302.199 207.778 312.385]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.782 290.243 186.737 300.43]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.848 278.288 171.803 288.475]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.365 265.989 151.32 276.52]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.585 254.034 236.54 264.565]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.844 242.079 228.799 252.609]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.365 230.468 151.32 240.654]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.365 218.512 151.32 228.699]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.585 206.557 236.54 216.744]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.617 194.602 174.573 204.789]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.726 182.647 201.681 192.834]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.85 170.692 197.805 180.878]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.358 158.737 182.313 168.923]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.246 146.781 212.201 156.968]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.524 134.826 199.479 145.013]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.259 122.871 150.214 133.058]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.452 110.916 157.407 121.103]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.259 98.961 150.214 109.147]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.29 87.006 171.245 97.192]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.738 75.05 227.693 85.237]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.802 708.674 408.757 718.861]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.145 696.47 376.1 706.657]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.846 684.266 367.801 694.453]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.908 672.062 409.863 682.248]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.485 659.514 405.44 670.044]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.907 647.653 492.862 657.84]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [478.705 635.449 490.66 645.636]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.874 623.245 450.829 633.431]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 598.119 498.241 609.023]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 573.711 511.551 584.614]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 549.302 511.551 560.206]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 524.894 511.551 535.798]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 500.485 511.551 511.389]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [498.56 476.077 520.477 486.981]
+/A << /S /GoTo /D (page.158d) >>
+>> endobj
+16355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 451.668 501.578 462.572]
+/A << /S /GoTo /D (page.121) >>
+>> endobj
+16356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 439.464 528.208 450.368]
+/A << /S /GoTo /D (page.381) >>
+>> endobj
+16357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 415.055 501.578 425.959]
+/A << /S /GoTo /D (page.122) >>
+>> endobj
+16358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 402.851 475.018 413.755]
+/A << /S /GoTo /D (page.152) >>
+>> endobj
+16359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 390.647 528.208 401.551]
+/A << /S /GoTo /D (page.382) >>
+>> endobj
+16360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 366.239 475.018 377.142]
+/A << /S /GoTo /D (page.151) >>
+>> endobj
+16361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 331.932 362.272 340.779]
+/A << /S /GoTo /D (page.176) >>
+>> endobj
+16362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.384 305.466 530.32 316.37]
+/A << /S /GoTo /D (page.169) >>
+>> endobj
+16363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.454 281.058 514.39 291.962]
+/A << /S /GoTo /D (page.344) >>
+>> endobj
+16364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 268.854 511.551 279.758]
+/A << /S /GoTo /D (page.428) >>
+>> endobj
+16365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.44 232.49 451.377 243.394]
+/A << /S /GoTo /D (page.200) >>
+>> endobj
+16366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.649 209.048 507.585 219.235]
+/A << /S /GoTo /D (page.205) >>
+>> endobj
+16367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.826 183.922 497.763 194.826]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+16368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.273 183.922 517.21 194.826]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+16369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 174.024 362.272 182.871]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+16370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 147.559 439.79 158.463]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+16371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 123.15 506.55 134.054]
+/A << /S /GoTo /D (page.184) >>
+>> endobj
+16372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 110.946 499.924 121.85]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+16373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 98.742 498.241 109.646]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+16374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 86.537 521.005 97.441]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+16376 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16380 0 obj <<
+/D [16378 0 R /XYZ 89 770.89 null]
+>> endobj
+16377 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16452 0 obj <<
+/Length 1376      
+/Filter /FlateDecode
+>>
+stream
+x��Z[w�8~���m��
���\6M��7q��ٴG�`���+�$�_"q
��9��7���Fcd �s8����X�gzcpox�pl��D�
������ɿ�o�O�
\`"��0����ɠ�e+0`1��k���7`
e�'���Oy��a#K�F�M���B�
�3†�	a�f�q��c���h���ܧ��
����������G���+ (��3�X`�#���c�lrb���=���!rU�����W%�S
5��!���sޮ	����-fA�L@��T;
$�/»0
+Ō,������:��g}:�Y����ɰ�m�U�ԒG^IJu�3|G���+�
}���Ct��x4�G�x;���=�~P�J�u,
PAg����x�Q�Ne�������a��^n5Dg��nzl�7��j�G��~��@��$��zMe&�!��(B?�f�
����Bd�}��.�Fz�u�L?	c�2!���>1._�b��{�(���N���^��q����	g҇��
^���Q

���9��;�CV���K�3�S�]�{
_��pсo��#�FЛY*���
��
j�f�;][��b��\�5��!��x��hEh��z����R_$��!\��o'l��b"Um'�yk�{�a�|>璫�A[8� �YF*���v�
ړ�F����5�ft��qw�n��K7 ��醚޶�*d�醣w�P�#Z�_wƒvCC7`%�5����
C�Q��N�D��D;_��
A1m�IJL��
FS�-����hj���o*���=����i/J]4�-�iU	EK-��V�*���n}��("xQ��?�'N/��;�҂w!
^n�]T���ب�9����Ԁ��%Uj��!���t�2��(��R�Kx�٠���ɸ�"������Hj�(ᕉs;3iP��پF��v������*��'�7'+����'���!+f�F�r�i�Ij��U�:����C�p��5���z'>���Tk�,J 
�=Vv����

l>Yނ�Y:��g�y�x^Y��4�2��/�n�F������k���w������R;�P:X^����Ta�5�pf�>R�ho��i��>={��:�%��up�Z{���P�����`��eʷ������;�^nq9�0�/ޒ�p��i�+<��43Kw���&��*�6����	�哅
����@2
d��)���G��.�؎�e�
��A�~��x��2�G�nZ�_��ԏ�� ��秋B3&����o���Y2T�0�d)�7ʧ�ٽ<:��]\�~ybr��7
�Twd���Re�L�x��{�n9�q•Pa,�y�l��jJ]b MBP�
��
`�8(�1��,�����e
'Rɯ�m��\g�
+endstream
+endobj
+16451 0 obj <<
+/Type /Page
+/Contents 16452 0 R
+/Resources 16450 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16286 0 R
+/Annots [ 16375 0 R 16382 0 R 16383 0 R 16384 0 R 16385 0 R 16386 0 R 16387 0 R 16388 0 R 16389 0 R 16390 0 R 16391 0 R 16392 0 R 16393 0 R 16394 0 R 16395 0 R 16396 0 R 16397 0 R 16398 0 R 16399 0 R 16400 0 R 16401 0 R 16402 0 R 16403 0 R 16404 0 R 16405 0 R 16406 0 R 16407 0 R 16408 0 R 16409 0 R 16410 0 R 16411 0 R 16412 0 R 16413 0 R 16414 0 R 16415 0 R 16416 0 R 16417 0 R 16418 0 R 16419 0 R 16420 0 R 16421 0 R 16422 0 R 16423 0 R 16424 0 R 16425 0 R 16426 0 R 16427 0 R 16428 0 R 16 [...]
+>> endobj
+16375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 698.059 145.791 706.906]
+/A << /S /GoTo /D (page.128) >>
+>> endobj
+16382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.261 684.047 306.197 694.951]
+/A << /S /GoTo /D (page.297) >>
+>> endobj
+16383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.155 672.092 305.092 682.996]
+/A << /S /GoTo /D (page.312) >>
+>> endobj
+16384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.355 648.181 305.291 659.085]
+/A << /S /GoTo /D (page.438) >>
+>> endobj
+16385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 624.271 223.309 635.175]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 600.361 285.097 611.265]
+/A << /S /GoTo /D (page.124) >>
+>> endobj
+16387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 588.405 258.537 599.309]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+16388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 576.45 260.191 587.354]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+16389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 564.495 311.727 575.399]
+/A << /S /GoTo /D (page.383) >>
+>> endobj
+16390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 541.302 186.747 551.489]
+/A << /S /GoTo /D (page.411) >>
+>> endobj
+16391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 518.612 145.791 527.578]
+/A << /S /GoTo /D (page.459) >>
+>> endobj
+16392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 504.719 287.867 515.623]
+/A << /S /GoTo /D (page.494) >>
+>> endobj
+16393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.454 480.809 231.409 491.713]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.454 456.899 231.409 467.803]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.454 432.988 231.409 443.892]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.654 409.078 289.59 419.982]
+/A << /S /GoTo /D (page.183) >>
+>> endobj
+16397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.101 409.078 309.037 419.982]
+/A << /S /GoTo /D (page.184) >>
+>> endobj
+16398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 375.15 145.791 384.116]
+/A << /S /GoTo /D (page.191) >>
+>> endobj
+16399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 349.302 260.191 360.206]
+/A << /S /GoTo /D (page.291) >>
+>> endobj
+16400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 314.154 145.791 324.34]
+/A << /S /GoTo /D (page.197) >>
+>> endobj
+16401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 314.154 165.716 324.34]
+/A << /S /GoTo /D (page.198) >>
+>> endobj
+16402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.158 290.243 211.095 300.43]
+/A << /S /GoTo /D (page.202) >>
+>> endobj
+16403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 265.616 285.097 276.52]
+/A << /S /GoTo /D (page.110) >>
+>> endobj
+16404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 253.661 258.537 264.565]
+/A << /S /GoTo /D (page.138) >>
+>> endobj
+16405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 241.706 260.191 252.609]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+16406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 229.75 311.727 240.654]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+16407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 206.557 186.747 216.744]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+16408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 183.987 145.791 192.834]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+16409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 169.975 287.867 180.878]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+16410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.028 146.064 282.965 156.968]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+16411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.475 146.064 302.412 156.968]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+16412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 112.356 145.791 121.103]
+/A << /S /GoTo /D (page.222) >>
+>> endobj
+16413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.355 86.288 305.291 97.192]
+/A << /S /GoTo /D (page.436) >>
+>> endobj
+16414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 707.957 501.578 718.861]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 695.971 475.018 706.875]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+16416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 683.984 476.672 694.888]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+16417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 671.998 528.208 682.902]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+16418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 648.773 403.228 658.96]
+/A << /S /GoTo /D (page.402) >>
+>> endobj
+16419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 626.172 362.272 635.018]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+16420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 612.128 504.348 623.032]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+16421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.454 588.155 514.39 599.059]
+/A << /S /GoTo /D (page.342) >>
+>> endobj
+16422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 576.169 511.551 587.073]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.454 552.196 514.39 563.1]
+/A << /S /GoTo /D (page.342) >>
+>> endobj
+16424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 540.209 511.551 551.113]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 516.236 504.348 527.14]
+/A << /S /GoTo /D (page.497) >>
+>> endobj
+16426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 492.263 504.348 503.167]
+/A << /S /GoTo /D (page.497) >>
+>> endobj
+16427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 457.806 439.79 468.71]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 433.833 506.55 444.737]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+16429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 421.847 499.924 432.751]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+16430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 409.86 498.241 420.764]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+16431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 397.874 521.005 408.778]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+16432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 373.901 439.79 384.805]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 349.928 501.578 360.832]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+16434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 337.942 475.018 348.845]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+16435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 325.955 476.672 336.859]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+16436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 313.969 528.208 324.873]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+16437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 290.744 403.228 300.931]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+16438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 268.143 362.272 276.989]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+16439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 242.112 439.79 253.016]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 218.139 513.045 229.043]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+16441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.208 194.167 489.145 205.07]
+/A << /S /GoTo /D (page.319) >>
+>> endobj
+16442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 160.296 362.272 169.142]
+/A << /S /GoTo /D (page.175) >>
+>> endobj
+16443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 134.266 498.241 145.169]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+16444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 122.279 521.005 133.183]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+16445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 98.306 501.578 109.21]
+/A << /S /GoTo /D (page.121) >>
+>> endobj
+16446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 86.32 475.018 97.224]
+/A << /S /GoTo /D (page.150) >>
+>> endobj
+16447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 74.333 476.672 85.237]
+/A << /S /GoTo /D (page.291) >>
+>> endobj
+16449 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16453 0 obj <<
+/D [16451 0 R /XYZ 89 770.89 null]
+>> endobj
+16450 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16529 0 obj <<
+/Length 1388      
+/Filter /FlateDecode
+>>
+stream
+x��Z�w�8~���m��J�@ ��]gێS�svOgN��� X�mݿ~@ki����a_�������� �� �u>j�\��b���
e4V,����b�߹�]#��c�Y�,�Z �^Ys��S����
Z�
(0�U�(δu�(.o�� U���4Ut���@����:���_#����Z
��v<�� 
+��6���c;^��~qRۋB;�É=c�f�rX�W໽l)w]P[#�x!��� 	U��Է�`Ao�;w����j�˂��q.�∿�n��A[�%Hݕ0i`��	K����G�j�ªc�%��vl��;o�ŠQ�-X]��x

V��k9���`������?~���>��������,
w h��0��m@��������q��o1�֡��I��
+� �K�a��
Ǖ2;���Y̒���YoE���8���K��N����'�
:��\�6�|�B�iW�4*\e ��{�0G�6e�!(�o�cs;e4���9��7�gt<yC��@�������M��]7d�K({����_r��
P��
��U�o`i�3;ti2��́NY�4��������Ad4O���S�����n�m-�\~�2B?�2Bۖ��Ô8LQ >تJQ�R_�̂���JX�~c
+�sJ���A�‹��V�8�v�d8�)�5��E٩z4���w�n4��;fv��\@gB�qd���_�ם�q�� h��^t�
WU��Čg���B[��Eu��R�
�ra�2<�d�A�u4ɰ��e*��ch�j }?�K%��-b�or46%b�kU�9u&���s�*~e{	dh,$&fs:Bˢ	���k�]C�kh��m��;�6����
ms�O�wV��j䅋N
+��흍z���--���\do+&%�]�vv��
��4�N�ԝ��r�rVI�Z����0n�� t^)��Q*�h���~�Ǭ��
u�g���r8�3w`���7+^@]{�l�,�aʛ���-cw��9�l����|g3�ה���+f�\��j�2\�C
J1��
;|p]f �g�&3��g�����Vl㑺��
�2�cV����Nh�o �e1)z������~��|Zk
�5�K�Aʨ3O��w��a�����\VϏ5m������\3�R�{��0�0�J
.��Mw�TH�e5d@	�y+���B���i�n�]����9�&�dϩ�u�M[���P4M�=\��
.�
'���|���gq].��,py
+���a��)����J3
�&��q0��/�%,���q;����U~�
`���پa�4*�
�Ϡ��j|�9d�0[���
+���^�d>7�G�&i:;=9��{	
=Չ�/�_� �R�I�}9�怦b�!���|e�cU_��/��w
+endstream
+endobj
+16528 0 obj <<
+/Type /Page
+/Contents 16529 0 R
+/Resources 16527 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16286 0 R
+/Annots [ 16448 0 R 16454 0 R 16455 0 R 16456 0 R 16457 0 R 16458 0 R 16459 0 R 16460 0 R 16461 0 R 16462 0 R 16463 0 R 16464 0 R 16465 0 R 16466 0 R 16467 0 R 16468 0 R 16469 0 R 16470 0 R 16471 0 R 16472 0 R 16473 0 R 16474 0 R 16475 0 R 16476 0 R 16477 0 R 16478 0 R 16479 0 R 16480 0 R 16481 0 R 16482 0 R 16483 0 R 16484 0 R 16485 0 R 16486 0 R 16487 0 R 16488 0 R 16489 0 R 16490 0 R 16491 0 R 16492 0 R 16493 0 R 16494 0 R 16495 0 R 16496 0 R 16497 0 R 16498 0 R 16499 0 R 16500 0 R 16 [...]
+>> endobj
+16448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 707.957 311.727 718.861]
+/A << /S /GoTo /D (page.380) >>
+>> endobj
+16454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 684.711 186.747 694.898]
+/A << /S /GoTo /D (page.410) >>
+>> endobj
+16455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 660.748 145.791 670.935]
+/A << /S /GoTo /D (page.453) >>
+>> endobj
+16456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 660.748 165.716 670.935]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+16457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.452 648.023 287.388 658.927]
+/A << /S /GoTo /D (page.491) >>
+>> endobj
+16458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.899 648.023 306.836 658.927]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+16459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 613.162 223.309 624.066]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 589.146 223.309 600.05]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 565.13 283.443 576.034]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+16462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 531.096 145.791 540.063]
+/A << /S /GoTo /D (page.329) >>
+>> endobj
+16463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.345 505.142 281.281 516.046]
+/A << /S /GoTo /D (page.254) >>
+>> endobj
+16464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.792 505.142 300.728 516.046]
+/A << /S /GoTo /D (page.255) >>
+>> endobj
+16465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 495.245 145.791 504.091]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+16466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 469.171 297.909 480.075]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+16467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.627 445.155 296.564 456.059]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+16468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 421.139 285.097 432.043]
+/A << /S /GoTo /D (page.126) >>
+>> endobj
+16469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 409.131 258.537 420.035]
+/A << /S /GoTo /D (page.154) >>
+>> endobj
+16470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 397.123 260.191 408.027]
+/A << /S /GoTo /D (page.295) >>
+>> endobj
+16471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 385.115 311.727 396.019]
+/A << /S /GoTo /D (page.384) >>
+>> endobj
+16472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 361.869 186.747 372.055]
+/A << /S /GoTo /D (page.413) >>
+>> endobj
+16473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 339.245 145.791 348.092]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+16474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 325.18 287.867 336.084]
+/A << /S /GoTo /D (page.495) >>
+>> endobj
+16475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 301.164 285.097 312.068]
+/A << /S /GoTo /D (page.114) >>
+>> endobj
+16476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 289.156 311.727 300.06]
+/A << /S /GoTo /D (page.385) >>
+>> endobj
+16477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 244.278 145.791 253.244]
+/A << /S /GoTo /D (page.239) >>
+>> endobj
+16478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 218.324 297.909 229.228]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+16479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 194.308 223.309 205.212]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.493 158.337 175.43 169.241]
+/A << /S /GoTo /D (page.179) >>
+>> endobj
+16481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 134.321 285.097 145.225]
+/A << /S /GoTo /D (page.126) >>
+>> endobj
+16482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 122.313 258.537 133.216]
+/A << /S /GoTo /D (page.154) >>
+>> endobj
+16483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 110.304 260.191 121.208]
+/A << /S /GoTo /D (page.295) >>
+>> endobj
+16484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 98.296 311.727 109.2]
+/A << /S /GoTo /D (page.385) >>
+>> endobj
+16485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 75.05 186.747 85.237]
+/A << /S /GoTo /D (page.413) >>
+>> endobj
+16486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 362.272 706.906]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+16487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 684.014 504.348 694.918]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+16488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 660.04 447.89 670.943]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+16489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 636.065 501.578 646.968]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 624.077 475.018 634.981]
+/A << /S /GoTo /D (page.140) >>
+>> endobj
+16491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 612.09 476.672 622.994]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+16492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 600.102 528.208 611.006]
+/A << /S /GoTo /D (page.370) >>
+>> endobj
+16493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 588.115 504.348 599.019]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+16494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 553.639 439.79 564.542]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 529.664 439.79 540.567]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 505.689 513.045 516.593]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+16497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 481.714 513.045 492.618]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+16498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 457.739 501.578 468.643]
+/A << /S /GoTo /D (page.118) >>
+>> endobj
+16499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 445.751 475.018 456.655]
+/A << /S /GoTo /D (page.147) >>
+>> endobj
+16500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [478.007 445.751 494.943 456.655]
+/A << /S /GoTo /D (page.148) >>
+>> endobj
+16501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 433.764 476.672 444.668]
+/A << /S /GoTo /D (page.287) >>
+>> endobj
+16502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.661 433.764 496.597 444.668]
+/A << /S /GoTo /D (page.288) >>
+>> endobj
+16503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 421.776 528.208 432.68]
+/A << /S /GoTo /D (page.377) >>
+>> endobj
+16504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 398.551 403.228 408.738]
+/A << /S /GoTo /D (page.407) >>
+>> endobj
+16505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.217 398.551 423.154 408.738]
+/A << /S /GoTo /D (page.408) >>
+>> endobj
+16506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 374.608 362.272 384.795]
+/A << /S /GoTo /D (page.455) >>
+>> endobj
+16507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.261 374.608 382.197 384.795]
+/A << /S /GoTo /D (page.456) >>
+>> endobj
+16508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 361.903 504.348 372.807]
+/A << /S /GoTo /D (page.488) >>
+>> endobj
+16509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.164 337.928 501.1 348.832]
+/A << /S /GoTo /D (page.118) >>
+>> endobj
+16510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [503.611 337.928 520.547 348.832]
+/A << /S /GoTo /D (page.119) >>
+>> endobj
+16511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 325.941 475.018 336.845]
+/A << /S /GoTo /D (page.148) >>
+>> endobj
+16512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 313.954 476.672 324.857]
+/A << /S /GoTo /D (page.288) >>
+>> endobj
+16513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [479.661 313.954 496.597 324.857]
+/A << /S /GoTo /D (page.289) >>
+>> endobj
+16514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 301.966 528.208 312.87]
+/A << /S /GoTo /D (page.378) >>
+>> endobj
+16515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 278.741 403.228 288.927]
+/A << /S /GoTo /D (page.408) >>
+>> endobj
+16516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 256.138 362.272 264.985]
+/A << /S /GoTo /D (page.456) >>
+>> endobj
+16517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [486.933 242.093 503.87 252.997]
+/A << /S /GoTo /D (page.488) >>
+>> endobj
+16518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [506.38 242.093 523.317 252.997]
+/A << /S /GoTo /D (page.489) >>
+>> endobj
+16519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 218.118 501.578 229.022]
+/A << /S /GoTo /D (page.114) >>
+>> endobj
+16520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 206.131 528.208 217.035]
+/A << /S /GoTo /D (page.373) >>
+>> endobj
+16521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 194.143 504.348 205.047]
+/A << /S /GoTo /D (page.485) >>
+>> endobj
+16522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 160.271 362.272 169.117]
+/A << /S /GoTo /D (page.433) >>
+>> endobj
+16523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 134.238 498.241 145.142]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+16524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 100.365 362.272 109.212]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+16525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 74.333 476.672 85.237]
+/A << /S /GoTo /D (page.291) >>
+>> endobj
+16526 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16530 0 obj <<
+/D [16528 0 R /XYZ 89 770.89 null]
+>> endobj
+16527 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16596 0 obj <<
+/Length 1334      
+/Filter /FlateDecode
+>>
+stream
+x��Z]S�8}ϯ��&��H�%ۼ�&�tSHK:����0�&r�
>�ׯ�B+YxG���=�:��
�� �i�x�:<qm�7}lactm��p
�DX�
+��v������5�b8�3²]�YH�z��m
�R`��52]�&��_�e�����y���X��?6.Z�Z`K@ 4!,��X2a��:
?� �@ԾS�HsxP6��q - �h4T��P2LƏ7,�
�+A����0�y��L��X�}/
���ܧ��^}?m�4M�¼��e��	���M�^�������"v+��i�1�XH�x�x'�!�!94��P/,ږc/�{�����#2��J^���k�jH�"��I
@�� .�w=�!�ӌ�ܩ���{	�*{�&8DL�I�򇇩؄�}3��DՌ���
D�9�f.��8l�jY�uBM
�q&h��f����&\�j��ј��M���4c��@W��JAmuT�3�9{
/��y��GS� 5�����׸��}1Cl�!��L��
+��]���!�1��
+G��4u��
��I����T%�nY�uꆦd\�
�*��Yp7�啲� ���J�����3��A;�f�*���\f>u�jaM�f��z�^k%�s#���,iG��:j��*�RY������y��(�2k�R:���U�2��}�w�
�GvI�U�+�dub W&�x�!�a�R�w�
�����9���?�J��?���S�Ӈ����hF#V��<�Z�
�f��4&��r�?;-�<U~jd��tdel�&��=�[��~��s�󂫥j�7��'/�������af
Io
�l��QCz?G��n���#�� ��g�}:'���ڂ����<��YM�4�:���NA�Q�N���#\q�2�5$(ᑘ1
0���
Zழ4�"���@��,d��
����A

��A�*�\�p蒵en�9�2�
Y��;�mBI� Ԝ ������Nn�?���s��R���f�)��N���y9����M=������_�l�����c��!�{�
+��C��ȱ
�+9��3*ȉ����#y���T�〧�"�׼��II��`Y���:���������H&�_��W|asql��
O�?��@|��+��

���ʯtI�4΁�LP�L]�풻i���N���Ta��[�kٺ����g�;����/�WF7�������U��A����R.Y.��Tb��}��oB�dy�
4;��
�J_
+࿍��/��Z�]`:
��m�ɲ�����,J�̠��'2�}�M��U��D�&�(���,�P���7�@c�bCz�&��k�5��Uò�?��n"I�L��r��
+endstream
+endobj
+16595 0 obj <<
+/Type /Page
+/Contents 16596 0 R
+/Resources 16594 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16286 0 R
+/Annots [ 16531 0 R 16532 0 R 16533 0 R 16534 0 R 16535 0 R 16536 0 R 16537 0 R 16538 0 R 16539 0 R 16540 0 R 16541 0 R 16542 0 R 16543 0 R 16544 0 R 16545 0 R 16546 0 R 16547 0 R 16548 0 R 16549 0 R 16550 0 R 16551 0 R 16552 0 R 16553 0 R 16554 0 R 16555 0 R 16556 0 R 16557 0 R 16558 0 R 16559 0 R 16560 0 R 16561 0 R 16562 0 R 16563 0 R 16564 0 R 16565 0 R 16566 0 R 16567 0 R 16568 0 R 16569 0 R 16570 0 R 16571 0 R 16572 0 R 16573 0 R 16574 0 R 16575 0 R 16576 0 R 16577 0 R 16578 0 R 16 [...]
+>> endobj
+16531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 685.933 145.791 694.899]
+/A << /S /GoTo /D (page.449) >>
+>> endobj
+16532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 649.964 145.791 658.931]
+/A << /S /GoTo /D (page.449) >>
+>> endobj
+16533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.602 624.013 284.539 634.917]
+/A << /S /GoTo /D (page.243) >>
+>> endobj
+16534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 600 295.069 610.904]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+16535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.602 575.986 284.539 586.89]
+/A << /S /GoTo /D (page.242) >>
+>> endobj
+16536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.602 551.973 284.539 562.877]
+/A << /S /GoTo /D (page.242) >>
+>> endobj
+16537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 527.96 258.537 538.864]
+/A << /S /GoTo /D (page.155) >>
+>> endobj
+16538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.602 515.953 284.539 526.857]
+/A << /S /GoTo /D (page.242) >>
+>> endobj
+16539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 491.94 265.172 502.844]
+/A << /S /GoTo /D (page.274d) >>
+>> endobj
+16540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 467.926 304.524 478.83]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+16541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 434.015 145.791 442.862]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+16542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 407.944 304.524 418.848]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+16543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 398.046 145.791 406.893]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+16544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 371.976 304.524 382.88]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+16545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 360.738 145.791 370.924]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+16546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 360.738 165.716 370.924]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+16547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 325.186 285.097 336.09]
+/A << /S /GoTo /D (page.123) >>
+>> endobj
+16548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 313.179 287.867 324.083]
+/A << /S /GoTo /D (page.492) >>
+>> endobj
+16549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 289.165 258.537 300.069]
+/A << /S /GoTo /D (page.155) >>
+>> endobj
+16550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.237 265.152 291.174 276.056]
+/A << /S /GoTo /D (page.226) >>
+>> endobj
+16551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 241.139 258.537 252.043]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+16552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 217.125 285.097 228.029]
+/A << /S /GoTo /D (page.127) >>
+>> endobj
+16553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 205.119 258.537 216.023]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+16554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 193.112 260.191 204.016]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+16555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 181.105 311.727 192.009]
+/A << /S /GoTo /D (page.386) >>
+>> endobj
+16556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 157.861 186.747 168.047]
+/A << /S /GoTo /D (page.413) >>
+>> endobj
+16557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 135.239 145.791 144.085]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+16558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 121.175 287.867 132.079]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+16559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 86.34 223.309 97.244]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 707.957 439.79 718.861]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 684.047 439.79 694.951]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 660.136 439.79 671.04]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 636.226 439.79 647.13]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 612.316 439.79 623.22]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 588.405 439.79 599.309]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 554.478 362.272 563.444]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+16567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.028 540.585 528.965 551.489]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+16568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 506.657 362.272 515.623]
+/A << /S /GoTo /D (page.191) >>
+>> endobj
+16569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 482.866 362.272 491.713]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+16570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 456.899 501.578 467.803]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+16571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 444.943 528.208 455.847]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+16572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 421.033 501.578 431.937]
+/A << /S /GoTo /D (page.115) >>
+>> endobj
+16573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 409.078 475.018 419.982]
+/A << /S /GoTo /D (page.145) >>
+>> endobj
+16574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 397.123 476.672 408.027]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+16575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 385.168 528.208 396.071]
+/A << /S /GoTo /D (page.374) >>
+>> endobj
+16576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 361.975 403.228 372.161]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+16577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 339.404 362.272 348.251]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+16578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 325.392 504.348 336.296]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+16579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 291.584 362.272 300.43]
+/A << /S /GoTo /D (page.240) >>
+>> endobj
+16580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.897 277.571 510.834 288.475]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+16581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 253.661 439.79 264.565]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 229.75 476.672 240.654]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+16583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 205.84 501.578 216.744]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 193.885 475.018 204.789]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+16585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 181.93 476.672 192.834]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+16586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 169.975 528.208 180.878]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+16587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 146.781 403.228 156.968]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+16588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 124.211 362.272 133.058]
+/A << /S /GoTo /D (page.446) >>
+>> endobj
+16589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 110.199 504.348 121.103]
+/A << /S /GoTo /D (page.477) >>
+>> endobj
+16590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 86.288 499.924 97.192]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+16591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 74.333 498.241 85.237]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+16593 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16597 0 obj <<
+/D [16595 0 R /XYZ 89 770.89 null]
+>> endobj
+16594 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16660 0 obj <<
+/Length 1326      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�H~�W�Z����
�-�qV':[S�LQ
�j
�$�_�
H�L��I�"�}��sN� �V�r�8
5�t���IUFw�	]3UBů�r�$��~��(��	����^�v���Q��
+LGU7��q�(q��Tl�cr�T�߮2l|m�U � �@
#����V-H�,�2k���|0���,x><<��u�=
���L���{�꼡ܴ@M
��Ծ�h
C�A$,�
����<�
���m5ch:5YL�1\7�Ʀj��	-�0g�='�Ô
y�'�gs�y
4��AE�5[)
��H�W��\�EV�WFs�� 
��z���!���Z��Ƶ�EN	��
��@�{N_<������G��"'� b�nEP����?-�VC�93�y
�r�Gl
��o;c��O�(�ȟe������C>��@�)�P�
�(M6qi�Z�4������:��f����k~�2����ȃ�Ŗ ��E�TM[�^g8�.����oG��T�|��J&�1Ϟ3����� �A�
+Z�1MЌ>]�?��E�����-�[��U��6N�h���(�Ld)�����v��H��
O����X'�=6/E5L�������P\u�BZ�(Cɺ�T$��u��
����$ʀ�ܢh�^-�O��=��-����r
1���[l*V�K�ru
�����Y�,:
��zr���
+_�5���T4=��SG�?��{���p��W&,
%8�o��m<(���(U	�
+�X�H[G^
w�k����✎�܀gg��Pm7�n��\I�"h3���\��&�M7"4g�)���ͬj�(�'F6��<Գ�Lk�&)P�F�z�R=,޳�޾��=����8-�=}x�w"F�r�Z�i����:�m�K����x��oY�J��q��(�FK�	���c����
2�<�U� u��%ے�
jJ�.�S�.޸��A�W� c�
�$�d_߉��!Fu�k���ΥJ&���n��\g�6/9d�jd��͑�/g3?}�.�F]t��t����O��+���>�u�Ͻ��*���4ӻ�G߻���Ѩ{y��[lZj�{�{����
+��f���}�?`d�ӿZ[��իڟ�Օ���:²o
+�
�t�����P�u�\\=N.fc'�S���b��tm1_{9a�
����j�{����2�	e���t�^z�-��-B�a��ϼ9s����_1�<H�Wi�B�l�T[m,�2�|A[����/i�UL:P5�f/c�G�����vn�ܳU�ޯ��i�@7����NM�`���MwR�Ե�D �Dy
+endstream
+endobj
+16659 0 obj <<
+/Type /Page
+/Contents 16660 0 R
+/Resources 16658 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16286 0 R
+/Annots [ 16592 0 R 16599 0 R 16600 0 R 16601 0 R 16602 0 R 16603 0 R 16604 0 R 16605 0 R 16606 0 R 16607 0 R 16608 0 R 16609 0 R 16610 0 R 16611 0 R 16612 0 R 16613 0 R 16614 0 R 16615 0 R 16616 0 R 16617 0 R 16618 0 R 16619 0 R 16620 0 R 16621 0 R 16622 0 R 16623 0 R 16624 0 R 16625 0 R 16626 0 R 16627 0 R 16628 0 R 16629 0 R 16630 0 R 16631 0 R 16632 0 R 16633 0 R 16634 0 R 16635 0 R 16636 0 R 16637 0 R 16638 0 R 16639 0 R 16640 0 R 16641 0 R 16642 0 R 16643 0 R 16644 0 R 16645 0 R 16 [...]
+>> endobj
+16592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 707.957 304.524 718.861]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+16599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 686.074 145.791 694.921]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+16600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.132 660.047 290.068 670.951]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+16601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 636.077 283.443 646.981]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+16602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.823 624.092 281.759 634.996]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+16603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 612.107 304.524 623.01]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+16604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.132 588.136 290.068 599.04]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+16605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 576.151 283.443 587.055]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+16606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.132 552.181 290.068 563.085]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+16607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 528.211 297.909 539.115]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+16608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 516.226 295.069 527.13]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+16609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.132 492.256 290.068 503.16]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+16610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 480.271 283.443 491.175]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+16611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 456.301 260.191 467.205]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+16612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.547 432.331 312.484 443.235]
+/A << /S /GoTo /D (page.320) >>
+>> endobj
+16613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 422.433 145.791 431.279]
+/A << /S /GoTo /D (page.321) >>
+>> endobj
+16614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.266 408.39 278.203 419.294]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+16615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 373.96 223.309 384.864]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 349.989 223.309 360.893]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.823 326.019 281.759 336.923]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 314.034 304.524 324.938]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+16619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.823 290.064 286.741 300.968]
+/A << /S /GoTo /D (page.255d) >>
+>> endobj
+16620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.627 266.094 296.564 276.998]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+16621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.188 242.124 275.124 253.028]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+16622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 218.154 285.097 229.058]
+/A << /S /GoTo /D (page.122) >>
+>> endobj
+16623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 206.169 311.727 217.073]
+/A << /S /GoTo /D (page.381) >>
+>> endobj
+16624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 182.199 287.867 193.103]
+/A << /S /GoTo /D (page.492) >>
+>> endobj
+16625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 158.229 285.097 169.133]
+/A << /S /GoTo /D (page.123) >>
+>> endobj
+16626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 146.244 258.537 157.147]
+/A << /S /GoTo /D (page.151) >>
+>> endobj
+16627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 134.258 311.727 145.162]
+/A << /S /GoTo /D (page.382) >>
+>> endobj
+16628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 110.288 285.097 121.192]
+/A << /S /GoTo /D (page.124) >>
+>> endobj
+16629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 98.303 287.867 109.207]
+/A << /S /GoTo /D (page.493) >>
+>> endobj
+16630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 74.333 260.191 85.237]
+/A << /S /GoTo /D (page.292) >>
+>> endobj
+16631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 695.963 476.672 706.867]
+/A << /S /GoTo /D (page.293) >>
+>> endobj
+16632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 671.976 476.672 682.88]
+/A << /S /GoTo /D (page.292) >>
+>> endobj
+16633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.826 647.988 497.763 658.892]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+16634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.273 647.988 517.21 658.892]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+16635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 638.091 362.272 646.937]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+16636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 602.028 362.272 610.995]
+/A << /S /GoTo /D (page.329) >>
+>> endobj
+16637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.897 576.103 510.834 587.007]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+16638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 542.218 362.272 551.064]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+16639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 506.275 362.272 515.122]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+16640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.613 468.275 437.549 479.179]
+/A << /S /GoTo /D (page.516) >>
+>> endobj
+16641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.572 432.333 416.508 443.237]
+/A << /S /GoTo /D (page.164) >>
+>> endobj
+16642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 410.441 362.272 419.288]
+/A << /S /GoTo /D (page.176) >>
+>> endobj
+16643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.594 384.435 442.53 395.339]
+/A << /S /GoTo /D (page.208) >>
+>> endobj
+16644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.594 360.486 442.53 371.39]
+/A << /S /GoTo /D (page.229) >>
+>> endobj
+16645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.594 336.537 442.53 347.441]
+/A << /S /GoTo /D (page.232) >>
+>> endobj
+16646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 314.526 362.272 323.492]
+/A << /S /GoTo /D (page.239) >>
+>> endobj
+16647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.594 288.639 442.53 299.543]
+/A << /S /GoTo /D (page.350) >>
+>> endobj
+16648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.594 264.69 442.53 275.594]
+/A << /S /GoTo /D (page.388) >>
+>> endobj
+16649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.572 240.741 416.508 251.645]
+/A << /S /GoTo /D (page.509) >>
+>> endobj
+16650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.613 216.793 437.549 227.696]
+/A << /S /GoTo /D (page.515) >>
+>> endobj
+16651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 182.907 362.272 191.754]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+16652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 146.257 439.79 157.161]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 122.27 439.79 133.173]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 88.265 362.272 97.231]
+/A << /S /GoTo /D (page.198) >>
+>> endobj
+16655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.028 74.333 528.965 85.237]
+/A << /S /GoTo /D (page.321) >>
+>> endobj
+16657 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16661 0 obj <<
+/D [16659 0 R /XYZ 89 770.89 null]
+>> endobj
+16658 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16736 0 obj <<
+/Length 1383      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�8~�W�ma�qt�|��KH���
d��iG��B<�25�
��W���lbf�|�u��I���hS
hw��Q���š�;&2�ѓ� �2
���i�=�۽f����� ��)�K>důk�Q�{
ʷ@���D�lm��
�m"_Ѐ�
[���5ay�i�ڧ�b�
 �{D4
B
�Ԧۀ��B�Q7����$d��=�,\]]u<�YH[/�/^ .�0���.d5!i=WW�@,"�E<dQ��x��N3_w5��PG eR����JmG��U rl����l٩�nۥn<θ��$)�g��c� �coz��c��0v
Žnx�!:�X�\
���ݻFBU���My���1��٘�l�c
gv|6�����N<���G�e+�}ݤ�g6�C�,P�A����ꉱ�z�Bo���(�?��4l��T�'�\�>F
��Vt�'�1��Y ���,��
�J�OD

�o
D�?y(
+i�0�QT>{�|�o^.J�
+X�
+;�
+�r�&
Ӯ^8��p <�Ϟ,
�R
�2؆}>�Y��Ը�+��j��j�+
@�
+ O�C�v��7@�ڷ�����ﵟ/��H�O�v�h�1Z8*�\�(���9er�4�tz�ui
:�2S�;�2�"�S0%��Gܺl�CGe. ͒���x����@�C
�	j�N-|`
��N@���
G��͈�{�O��;�џ�8��g�!�Z�kRh(4i�?�	�J�%���wC_�T���:�/A�-\�Wi�ԉ�p��&2R "����
�CV �=Ӫ�*��r�w��U�
�T�ɡu�
vD �ζDkpJ�`.���y�6�S�@
<����7��Q����դ�Rˠ�iuv��Тyh�۰��=�
+U��������L�]�?
�%�J�:�	�`��5[�2�7+�d����;��Ք�|,#U�tX>0�'n6Pqs;�/׊�
����OǙ��K�d�P�E��3��x�){�+� �!�<1�OK1�d���a�r�U�S IQ�2{��J.m�&
��qy.�k.���S\���/�	B��7�~KKlm�]@�#�)��(��R��E����M��w��ƋU>��l����'}�B��EtdSp+ͶH��ͻ
+ P�m�'��Y)�f�h#t�M����2���`Q^s"tBs�q���
���:?ԗQX��7ᩝLi��e�T�{
Nar�R:1�{�$v�s�H�V=α>�aˠm�y�҉�-������u;������4�/��.K6K� ~�<�TP��K�C9O��7�7.�
���g����i뻏���Z at 7�Ǚ�(�_]^>.�
.��8�H���с��}��X���)O<��
q���Ǭ�$ ꦉ�lHB�׀�e����}�q�c���c�H�_O����!�
+endstream
+endobj
+16735 0 obj <<
+/Type /Page
+/Contents 16736 0 R
+/Resources 16734 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16738 0 R
+/Annots [ 16656 0 R 16663 0 R 16664 0 R 16665 0 R 16666 0 R 16667 0 R 16668 0 R 16669 0 R 16670 0 R 16671 0 R 16672 0 R 16673 0 R 16674 0 R 16675 0 R 16676 0 R 16677 0 R 16678 0 R 16679 0 R 16680 0 R 16681 0 R 16682 0 R 16683 0 R 16684 0 R 16685 0 R 16686 0 R 16687 0 R 16688 0 R 16689 0 R 16690 0 R 16691 0 R 16692 0 R 16693 0 R 16694 0 R 16695 0 R 16696 0 R 16697 0 R 16698 0 R 16699 0 R 16700 0 R 16701 0 R 16702 0 R 16703 0 R 16704 0 R 16705 0 R 16706 0 R 16707 0 R 16708 0 R 16709 0 R 16 [...]
+>> endobj
+16656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.158 696.719 211.095 706.906]
+/A << /S /GoTo /D (page.202) >>
+>> endobj
+16663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 684.013 287.867 694.917]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+16664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 660.036 297.909 670.94]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 650.138 145.791 658.985]
+/A << /S /GoTo /D (page.344) >>
+>> endobj
+16666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 624.104 223.309 635.008]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 600.127 285.097 611.031]
+/A << /S /GoTo /D (page.125) >>
+>> endobj
+16668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 588.138 258.537 599.042]
+/A << /S /GoTo /D (page.154) >>
+>> endobj
+16669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 576.15 260.191 587.054]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+16670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 564.161 311.727 575.065]
+/A << /S /GoTo /D (page.384) >>
+>> endobj
+16671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 540.935 186.747 551.121]
+/A << /S /GoTo /D (page.412) >>
+>> endobj
+16672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 518.331 145.791 527.178]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+16673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 504.285 287.867 515.189]
+/A << /S /GoTo /D (page.495) >>
+>> endobj
+16674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 480.308 285.097 491.212]
+/A << /S /GoTo /D (page.107) >>
+>> endobj
+16675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 468.319 258.537 479.223]
+/A << /S /GoTo /D (page.139) >>
+>> endobj
+16676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 456.331 260.191 467.235]
+/A << /S /GoTo /D (page.279) >>
+>> endobj
+16677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 444.342 311.727 455.246]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+16678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 421.116 186.747 431.303]
+/A << /S /GoTo /D (page.401) >>
+>> endobj
+16679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 397.172 145.791 407.359]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+16680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 397.172 165.716 407.359]
+/A << /S /GoTo /D (page.448) >>
+>> endobj
+16681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 384.466 287.867 395.37]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+16682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 360.489 223.309 371.393]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 336.512 285.097 347.416]
+/A << /S /GoTo /D (page.108) >>
+>> endobj
+16684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 324.523 258.537 335.427]
+/A << /S /GoTo /D (page.140) >>
+>> endobj
+16685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 312.535 260.191 323.439]
+/A << /S /GoTo /D (page.280) >>
+>> endobj
+16686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 300.546 311.727 311.45]
+/A << /S /GoTo /D (page.369) >>
+>> endobj
+16687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 277.32 186.747 287.507]
+/A << /S /GoTo /D (page.401) >>
+>> endobj
+16688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.736 277.32 206.672 287.507]
+/A << /S /GoTo /D (page.402) >>
+>> endobj
+16689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 253.376 145.791 263.563]
+/A << /S /GoTo /D (page.448) >>
+>> endobj
+16690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 253.376 165.716 263.563]
+/A << /S /GoTo /D (page.449) >>
+>> endobj
+16691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 240.67 287.867 251.574]
+/A << /S /GoTo /D (page.479) >>
+>> endobj
+16692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.627 216.693 296.564 227.597]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+16693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.727 192.716 272.664 203.62]
+/A << /S /GoTo /D (page.319) >>
+>> endobj
+16694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 158.841 145.791 167.688]
+/A << /S /GoTo /D (page.173) >>
+>> endobj
+16695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 122.287 283.443 133.191]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+16696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 98.31 223.309 109.214]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+16697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.464 74.333 318.382 85.237]
+/A << /S /GoTo /D (page.352d) >>
+>> endobj
+16698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 695.776 513.045 706.68]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+16699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 672.357 362.272 682.543]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+16700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.261 672.357 382.197 682.543]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 647.277 506.55 658.18]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+16702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 625.197 362.272 634.044]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+16703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 585.045 439.79 595.949]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 560.682 439.79 571.586]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 536.32 439.79 547.224]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 511.957 439.79 522.861]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 487.594 439.79 498.498]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 463.232 476.672 474.136]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+16709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 451.05 504.348 461.954]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+16710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 426.688 533.19 437.591]
+/A << /S /GoTo /D (page.364d) >>
+>> endobj
+16711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.748 402.325 494.684 413.229]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+16712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 377.962 439.79 388.866]
+/A << /S /GoTo /D (page.78) >>
+>> endobj
+16713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 353.599 439.79 364.503]
+/A << /S /GoTo /D (page.78) >>
+>> endobj
+16714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 329.237 439.79 340.141]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+16715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 304.874 439.79 315.778]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+16716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.51 280.511 499.446 291.415]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+16717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [501.957 280.511 518.893 291.415]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+16718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 256.149 501.578 267.053]
+/A << /S /GoTo /D (page.127) >>
+>> endobj
+16719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 243.967 475.018 254.871]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+16720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 231.786 506.55 242.69]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+16721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 209.587 362.272 218.553]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+16722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 195.468 499.924 206.372]
+/A << /S /GoTo /D (page.218) >>
+>> endobj
+16723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 173.488 362.272 182.236]
+/A << /S /GoTo /D (page.222) >>
+>> endobj
+16724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.719 159.15 507.655 170.054]
+/A << /S /GoTo /D (page.226) >>
+>> endobj
+16725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.826 146.969 497.763 157.873]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+16726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.273 146.969 517.21 157.873]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+16727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 124.89 362.272 133.736]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+16728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 110.651 476.672 121.555]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+16729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 98.47 521.005 109.374]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+16730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 76.39 362.272 85.237]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+16733 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16737 0 obj <<
+/D [16735 0 R /XYZ 89 770.89 null]
+>> endobj
+16734 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16817 0 obj <<
+/Length 1237      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�F~�W�0���hWZ�d�ul���@:�q2��� �E4���ꂍ�nxh�{;��Ξˮ�����o�N��$�a�M�55��2���n�[��ӷ�p�Ԭ�y����QG�r��։ڡ�����6[vn�B�U�o5����f`�~ڤ�w�0�A���f"J��{�v
�t�q�x|�t��N:�q0��|�H����?��`r�"�t��P�2�t�2�4Y�#
� RMG���B5�fg�O�b��!_Ec�,ȳa*���n4��2�[�\1w�a
SF��Й���'�J��X}Qig�9�ţ�I���p�x�
2p���l #Ϫe�
��:F`���i��~�Ed�jQ�`��
�x�
�G{�����|p�1��ɾ|�NX5�4u����
�h@Ԕ#9�|ܪN�A��w!עȣ(4��?z!��9ʝ�!Ғ��=)V
Y�LE�$+!�0������c�	��8�&�_��h��������xŔ3�C�x~X02�d�xϣ��H��舨�ZWW�#�i���5`���V�6�j��;)2	?Aa�+f�K9EQ���[ho7 
�}9m�I��$�Ps�I^=��:��$�Ӟ�_
P�̮���T0
�ȇm/L���
�e�ly(� ��
������Y#���ein�IS6ʀ����jQ!<B�E�+X�=��쇍f{����i����ϖ
�Tv��L\���y���3ɿQ���E/|�z�T���4�����&1@�{2U0U$����h�3*�a����h,��d4VJ��VV`^H��NFc/�^FCyY�[�h��k
�F�#q+ ���Αs�������^ �<��Ir9�ݑE[��l��y��aM�7
�O���Н�3�c{��)��3�]R�v��Y�pٓ�u���p�[���`=UUZ�Ș��wǴ���s�����vY�	lMR��D:a��_+n�B�NP�V��M@
+%�ے|"N��:����Uԉ^�7�kӗ�U�q�݉��001)�i��D����}�@ �i�s�9���I��%��j���t�������#
pƌ��#F���Vh���!���o���k!�Q�]'��9��Y$�_ �G2
+I#H�K�!�Ӊ��)m	�����
}�Ew1�۾<z�ՠ߿���Ÿ�Y���� ��v�:�ƀ��L��|ո�w
+�,�
�/�Yٔ
+endstream
+endobj
+16816 0 obj <<
+/Type /Page
+/Contents 16817 0 R
+/Resources 16815 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16738 0 R
+/Annots [ 16731 0 R 16732 0 R 16741 0 R 16742 0 R 16743 0 R 16744 0 R 16745 0 R 16746 0 R 16747 0 R 16748 0 R 16749 0 R 16750 0 R 16751 0 R 16752 0 R 16753 0 R 16754 0 R 16755 0 R 16756 0 R 16757 0 R 16758 0 R 16759 0 R 16760 0 R 16761 0 R 16762 0 R 16763 0 R 16764 0 R 16765 0 R 16766 0 R 16767 0 R 16768 0 R 16769 0 R 16770 0 R 16771 0 R 16772 0 R 16773 0 R 16774 0 R 16775 0 R 16776 0 R 16777 0 R 16778 0 R 16779 0 R 16780 0 R 16781 0 R 16782 0 R 16783 0 R 16784 0 R 16785 0 R 16786 0 R 16 [...]
+>> endobj
+16731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 696.719 145.791 706.906]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+16732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 696.719 165.716 706.906]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.416 683.724 294.352 694.628]
+/A << /S /GoTo /D (page.339) >>
+>> endobj
+16742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 671.445 297.909 682.349]
+/A << /S /GoTo /D (page.347) >>
+>> endobj
+16743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 659.167 311.727 670.071]
+/A << /S /GoTo /D (page.386) >>
+>> endobj
+16744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 635.651 186.747 645.838]
+/A << /S /GoTo /D (page.414) >>
+>> endobj
+16745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 622.655 295.069 633.559]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+16746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.355 610.377 305.291 621.281]
+/A << /S /GoTo /D (page.438) >>
+>> endobj
+16747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.056 586.861 191.011 597.048]
+/A << /S /GoTo /D (page.97) >>
+>> endobj
+16748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 563.967 145.791 572.814]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+16749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 539.734 145.791 548.581]
+/A << /S /GoTo /D (page.464) >>
+>> endobj
+16750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 525.398 287.867 536.302]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+16751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.266 513.12 278.203 524.024]
+/A << /S /GoTo /D (page.504) >>
+>> endobj
+16752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.188 500.842 275.124 511.746]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+16753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.776 488.564 296.713 499.468]
+/A << /S /GoTo /D (page.518) >>
+>> endobj
+16754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.028 464.007 282.965 474.911]
+/A << /S /GoTo /D (page.217) >>
+>> endobj
+16755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.475 464.007 302.412 474.911]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+16756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 439.45 288.424 450.354]
+/A << /S /GoTo /D (page.216d) >>
+>> endobj
+16757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 414.894 288.424 425.798]
+/A << /S /GoTo /D (page.217d) >>
+>> endobj
+16758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 379.099 145.791 389.286]
+/A << /S /GoTo /D (page.332) >>
+>> endobj
+16759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 379.099 165.716 389.286]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+16760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.705 379.099 185.641 389.286]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 342.588 145.791 352.774]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+16762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 342.588 165.716 352.774]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 306.076 145.791 316.263]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+16764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 306.076 165.716 316.263]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+16765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 270.785 145.791 279.751]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+16766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.547 256.569 312.484 267.473]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+16767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.158 233.053 211.095 243.239]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+16768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.959 208.102 234.895 219.006]
+/A << /S /GoTo /D (page.200) >>
+>> endobj
+16769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.167 184.586 291.104 194.772]
+/A << /S /GoTo /D (page.205) >>
+>> endobj
+16770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 148.074 145.791 158.261]
+/A << /S /GoTo /D (page.332) >>
+>> endobj
+16771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 148.074 165.716 158.261]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+16772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.705 148.074 185.641 158.261]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 122.8 223.309 133.704]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 99.284 145.791 109.471]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+16775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 99.284 165.716 109.471]
+/A << /S /GoTo /D (page.332) >>
+>> endobj
+16776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.705 99.284 185.641 109.471]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+16777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.63 99.284 205.567 109.471]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 76.39 145.791 85.237]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+16779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 362.272 706.906]
+/A << /S /GoTo /D (page.465) >>
+>> endobj
+16780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 662.074 362.272 671.04]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+16781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.028 648.181 528.965 659.085]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+16782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.64 624.988 427.576 635.175]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+16783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.44 600.361 451.377 611.265]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+16784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.649 577.168 507.585 587.354]
+/A << /S /GoTo /D (page.206) >>
+>> endobj
+16785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 542.642 367.253 551.489]
+/A << /S /GoTo /D (page.333d) >>
+>> endobj
+16786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.135 516.674 506.072 527.578]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+16787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.582 516.674 525.519 527.578]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+16788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 492.764 506.55 503.668]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+16789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 469.571 362.272 479.758]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+16790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.261 469.571 382.197 479.758]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+16791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 434.926 362.272 443.892]
+/A << /S /GoTo /D (page.198) >>
+>> endobj
+16792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.028 421.033 528.965 431.937]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+16793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.64 397.84 427.576 408.027]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+16794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 363.195 362.272 372.161]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+16795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.028 349.302 528.965 360.206]
+/A << /S /GoTo /D (page.323) >>
+>> endobj
+16796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.135 337.347 506.072 348.251]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+16797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [508.582 337.347 525.519 348.251]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+16798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 315.374 362.272 324.34]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+16799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 301.481 504.906 312.385]
+/A << /S /GoTo /D (page.217d) >>
+>> endobj
+16800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.826 289.526 497.763 300.43]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+16801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.273 289.526 517.21 300.43]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+16802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 277.571 476.672 288.475]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+16803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 265.616 521.005 276.52]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+16804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 243.763 362.272 252.609]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+16805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.64 218.512 427.576 228.699]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+16806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.44 193.885 451.377 204.789]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+16807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.649 170.692 507.585 180.878]
+/A << /S /GoTo /D (page.206) >>
+>> endobj
+16808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.07 146.781 401.006 156.968]
+/A << /S /GoTo /D (page.195) >>
+>> endobj
+16809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 122.871 403.228 133.058]
+/A << /S /GoTo /D (page.414) >>
+>> endobj
+16810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.537 98.961 407.492 109.147]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+16811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 75.05 362.272 85.237]
+/A << /S /GoTo /D (page.462) >>
+>> endobj
+16812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.261 75.05 382.197 85.237]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+16814 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16818 0 obj <<
+/D [16816 0 R /XYZ 89 770.89 null]
+>> endobj
+16815 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16891 0 obj <<
+/Length 1335      
+/Filter /FlateDecode
+>>
+stream
+x�͚[s�8���)xٮ=�q���u���8�L�ѐ�8���
+ܴ��W����b��Cb,�_?

�s$jFj���tN"Gɴ,��<P2�D^��@�M�ۮf��׽����P ϥ7 +'�
��|�0�PL�4�E��_tn�jJ�/(@s�D=���r�sN�;�
�"�5�kR"��
��i��u��EV8���M��t�����YR��^�lo��~���e`x����$�uB�e3i^�����VKj$E{Z�=a!�򲴭-��%fm�K�q���;5�F�:8�0���{8�$4�������c/��`�rg^�M
b?��u+Q�F$�&ub�����s��{�m���XB�dZ�L٬��p��{�%���κ#�B���b`�
/��13���K�F�t
�x<��k����2�x'���$4����*1W;0�
X�W�P�4�=�G^���?���
����b��EK���ؐ�
 \��OQ;��<$
K��J<�?�؋���:˃C%=�� �C,]a)�۵2�,͋�2���HuT��
1��4���Y��� [...]
+5�#�*�K
��H8S����#h
��)�I�׿Q�ݍ���\�^N��OY����4H���
��G�<X����ׁ��n�'����e�\h�Z�
��6���
+'.�;�[�$��
+J�yނk����;�-�f�-�+
d)iLy� lUٶ5P�̵PNs�#)�xS���I�<y�$0q�����`��<�_)�~l��ld���l��E��{�]�`K�,|~�΋4$�SZ�1ϲH��]L"�ك�e�Gn�r��� A~�
d�
�,�'�{
�;�H�6���=��*�>''�p
��K�8��������jy���F)�E��(�>��-Z�8�$9�)
]�.��%
-la
b�o
@Fٴ��uz�x0/8�
u
#��`�*y
�
+endstream
+endobj
+16890 0 obj <<
+/Type /Page
+/Contents 16891 0 R
+/Resources 16889 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16738 0 R
+/Annots [ 16813 0 R 16822 0 R 16823 0 R 16824 0 R 16825 0 R 16826 0 R 16827 0 R 16828 0 R 16829 0 R 16830 0 R 16831 0 R 16832 0 R 16833 0 R 16834 0 R 16835 0 R 16836 0 R 16837 0 R 16838 0 R 16839 0 R 16840 0 R 16841 0 R 16842 0 R 16843 0 R 16844 0 R 16845 0 R 16846 0 R 16847 0 R 16848 0 R 16849 0 R 16850 0 R 16851 0 R 16852 0 R 16853 0 R 16854 0 R 16855 0 R 16856 0 R 16857 0 R 16858 0 R 16859 0 R 16860 0 R 16861 0 R 16862 0 R 16863 0 R 16864 0 R 16865 0 R 16866 0 R 16867 0 R 16868 0 R 16 [...]
+>> endobj
+16813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 698.059 145.791 706.906]
+/A << /S /GoTo /D (page.464) >>
+>> endobj
+16822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 684.015 287.867 694.919]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+16823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.132 660.043 290.068 670.946]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+16824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 636.07 223.309 646.974]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+16825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 602.199 145.791 611.045]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+16826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 576.917 145.791 587.104]
+/A << /S /GoTo /D (page.464) >>
+>> endobj
+16827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 576.917 165.716 587.104]
+/A << /S /GoTo /D (page.465) >>
+>> endobj
+16828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 552.227 297.909 563.131]
+/A << /S /GoTo /D (page.347) >>
+>> endobj
+16829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 528.254 223.309 539.158]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 504.281 297.909 515.185]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+16831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 480.308 295.069 491.212]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+16832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 456.335 287.867 467.239]
+/A << /S /GoTo /D (page.497) >>
+>> endobj
+16833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 422.464 145.791 431.311]
+/A << /S /GoTo /D (page.240) >>
+>> endobj
+16834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.416 408.421 294.352 419.325]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+16835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 373.963 304.524 384.867]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+16836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 349.991 295.069 360.895]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 326.018 295.069 336.922]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 302.045 295.069 312.949]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.823 278.072 281.759 288.976]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 266.085 304.524 276.989]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+16841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 242.112 223.309 253.016]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+16842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 218.139 297.909 229.043]
+/A << /S /GoTo /D (page.342) >>
+>> endobj
+16843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 194.167 297.909 205.07]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 170.194 297.909 181.098]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 146.221 297.909 157.125]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.088 122.248 295.024 133.152]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 112.35 145.791 121.197]
+/A << /S /GoTo /D (page.428) >>
+>> endobj
+16848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 86.32 223.309 97.224]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+16849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 362.272 706.906]
+/A << /S /GoTo /D (page.432) >>
+>> endobj
+16850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 672.092 439.79 682.996]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 648.181 439.79 659.085]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 624.271 439.79 635.175]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+16853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.748 600.361 494.684 611.265]
+/A << /S /GoTo /D (page.504) >>
+>> endobj
+16854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 566.552 362.272 575.399]
+/A << /S /GoTo /D (page.458) >>
+>> endobj
+16855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 540.585 521.005 551.489]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+16856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 530.687 362.272 539.534]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+16857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 494.821 362.272 503.668]
+/A << /S /GoTo /D (page.432) >>
+>> endobj
+16858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.449 469.571 441.405 479.758]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 457.616 382.745 467.803]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.379 445.661 404.334 455.847]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.709 433.706 433.664 443.892]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.974 421.75 394.929 431.937]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.491 409.451 374.446 419.982]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.491 397.84 374.446 408.027]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.491 385.885 374.446 396.071]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.385 373.93 373.34 384.116]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.578 361.975 380.533 372.161]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.385 350.019 373.34 360.206]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.491 338.064 374.446 348.251]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.743 313.81 397.679 324.34]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+16871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.134 301.855 469.071 312.385]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+16872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.555 289.9 447.492 300.43]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+16873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.092 266.333 427.029 276.52]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [353.076 254.378 370.013 264.565]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.721 242.423 376.658 252.609]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.423 230.468 368.359 240.654]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+16877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [353.076 206.557 370.013 216.744]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+16878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.725 194.602 407.661 204.789]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+16879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.721 182.647 376.658 192.834]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+16880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.242 158.737 387.178 168.923]
+/A << /S /GoTo /D (page.342) >>
+>> endobj
+16881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [492.005 146.781 508.941 156.968]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.899 134.826 507.835 145.013]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [428.902 122.871 445.838 133.058]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+16884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.113 98.961 448.05 109.147]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [455.462 87.006 472.399 97.192]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [478.715 75.05 495.651 85.237]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16888 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+16892 0 obj <<
+/D [16890 0 R /XYZ 89 770.89 null]
+>> endobj
+16889 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+16999 0 obj <<
+/Length 1633      
+/Filter /FlateDecode
+>>
+stream
+xڽZks�8�ί𷅙ődɏ���44M�&
���n�1X�[�*�&�_�A�lcv:M�GW�qt��@Y(@9�LzGo
M�TKG�2�+P
l�D9��>����䝢Y@� weo�x}�1��w:�����w�0�����(�x��T�2���"_�H�=��W<7D�
�@�FD1 T!�W
�N&����������_����f�{fGn _�\����CD@#�� _J�
+L��
t|��Մ^_���9�줗�>������0�L=�w���tաf�&�k ��ܷ�8�
���6�p���|S+��<�%�
�K�,X�Q�8K=��8�c7
��ո{��n�t�z���"��hEgK6�N݀�Ѻ�g�
U�)lKBΨ0�������q��~��,^y	
yv
����yv"|�X��r�!�^���@ERԵ��<�"K�K����U�����DŽw挳`�^\vW�[x?RxɈaq�l��Q��a�~~�F���A��
+
�>x�ȯ�8*T�Y�+&���/X�*����?w �����xm�
+
+|��
|u��,�=��AڎCga���H�AX�e��-Zٴ8�$R0� �
�D���y�ٮQc�}�^�g>@�� ��2|*�h!zu�PB���lم��:�� �T㼽��s
��+Nw!cr��C>Mi\D��'�ʀ���QKntL�<�=
�|�����ب�;e^�Z~�'�hd�4o]D%Ea~��

�c6繥�%�(����@��
�+��G�=�T %u`@u9n����]s���c
فC����볠F�Q-��V.H���.��&�+W��ޖ�q[�ם;g?�C);L�
ׂ�A���_��l^��6𥽕���Vc��*�v���H��Ұ^5˿��P$����H��[(�3��3S<�w�ԅ�I��X|;j^+e'l�V�Ul"E�4UGx��4DZ�y �nP��L�HT��wL
�hh��Qf�,CTl5g��,
bS�-T�EΊ:�s�e�9B&솕s��
��l�Z��onQ3)n�C�1R��
�.�Œ�}kh���"
�Ǯy����└�6���n�5w�x��'�"�Q\���n�V�cn�e�"V�`����
!w��[nrXҖ��4	V�M$�mS%�)q��"�&�B�&l$⼽�4:b<qS�I炪Uڦ�]N��~dsy?b�
�
8>
I�/iyE�B��W><qŴ�@������A��^"��W�m�7���gAr;
�
+Zm��~�
�VZ$F]j�u�Ebإ����H�
L�������s;�L�-$r���x��I���D�/P��Qq�:*>����I���R%>�T���K�Z�����9�")��
��&B�L�l(rJJ���)�m�@B��DNI];<�h
��"��[LA
��Ga
f&�@*��[)�D��6Q818�¹I��f
+X�◵li$v�g�i�H5�V�!�g7bѪZ��]?z@�Ⱦ�����>\�S�qt�k��P�=�
��	p��)�^
gC���ah�h�L/� ��x|�����m at H?�������寿 �S�����	U(�c�Ϡ:j�o+ܖ��������q�MP���{�e�D�GG��"f�B�Z���,<
��)�
�C^l�
�N%ӓ���Yt��
+endstream
+endobj
+16998 0 obj <<
+/Type /Page
+/Contents 16999 0 R
+/Resources 16997 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16738 0 R
+/Annots [ 16887 0 R 16893 0 R 16894 0 R 16895 0 R 16896 0 R 16897 0 R 16898 0 R 16899 0 R 16900 0 R 16901 0 R 16902 0 R 16903 0 R 16904 0 R 16905 0 R 16906 0 R 16907 0 R 16908 0 R 16909 0 R 16910 0 R 16911 0 R 16912 0 R 16913 0 R 16914 0 R 16915 0 R 16916 0 R 16917 0 R 16918 0 R 16919 0 R 16920 0 R 16921 0 R 16922 0 R 16923 0 R 16924 0 R 16925 0 R 16926 0 R 16927 0 R 16928 0 R 16929 0 R 16930 0 R 16931 0 R 16932 0 R 16933 0 R 16934 0 R 16935 0 R 16936 0 R 16937 0 R 16938 0 R 16939 0 R 16 [...]
+>> endobj
+16887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.741 708.674 263.678 718.861]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.47 696.719 245.407 706.906]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.579 684.764 277.516 694.951]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.029 660.854 157.965 671.04]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+16896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.528 648.181 211.484 659.085]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+16897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.018 636.943 152.974 647.13]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.488 624.271 235.444 635.175]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.036 612.316 235.992 623.22]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.036 600.361 235.992 611.265]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.008 588.405 200.963 599.309]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+16902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.825 576.45 233.78 587.354]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+16903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.944 565.212 177.899 575.399]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.119 553.257 190.074 563.444]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+16905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.986 540.585 219.941 551.489]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+16906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.679 528.63 216.634 539.534]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+16907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 506.657 140.809 515.623]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+16908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.412 480.809 233.368 491.713]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+16909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.195 456.899 196.132 467.803]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.071 444.943 200.007 455.847]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.57 433.706 189.506 443.892]
+/A << /S /GoTo /D (page.110) >>
+>> endobj
+16912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.445 421.75 193.382 431.937]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.646 409.078 238.582 419.982]
+/A << /S /GoTo /D (page.112) >>
+>> endobj
+16914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.02 397.123 231.957 408.027]
+/A << /S /GoTo /D (page.111) >>
+>> endobj
+16915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.024 385.168 206.961 396.071]
+/A << /S /GoTo /D (page.117) >>
+>> endobj
+16916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.676 373.212 182.612 384.116]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+16917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.398 361.257 195.334 372.161]
+/A << /S /GoTo /D (page.117) >>
+>> endobj
+16918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.078 349.302 178.996 360.206]
+/A << /S /GoTo /D (page.104d) >>
+>> endobj
+16919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.604 337.347 241.541 348.251]
+/A << /S /GoTo /D (page.122) >>
+>> endobj
+16920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.968 325.392 221.905 336.296]
+/A << /S /GoTo /D (page.119) >>
+>> endobj
+16921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.69 313.437 234.627 324.34]
+/A << /S /GoTo /D (page.119) >>
+>> endobj
+16922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.514 302.199 212.451 312.385]
+/A << /S /GoTo /D (page.107) >>
+>> endobj
+16923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.122 290.243 213.058 300.43]
+/A << /S /GoTo /D (page.107) >>
+>> endobj
+16924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.455 277.571 241.391 288.475]
+/A << /S /GoTo /D (page.121) >>
+>> endobj
+16925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.729 265.616 229.665 276.52]
+/A << /S /GoTo /D (page.122) >>
+>> endobj
+16926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.821 253.661 207.757 264.565]
+/A << /S /GoTo /D (page.124) >>
+>> endobj
+16927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.308 242.423 171.245 252.609]
+/A << /S /GoTo /D (page.110) >>
+>> endobj
+16928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.115 230.468 164.052 240.654]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.927 217.795 200.863 228.699]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+16930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.136 205.84 233.073 216.744]
+/A << /S /GoTo /D (page.126) >>
+>> endobj
+16931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.532 193.885 239.468 204.789]
+/A << /S /GoTo /D (page.114) >>
+>> endobj
+16932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.439 181.93 224.375 192.834]
+/A << /S /GoTo /D (page.126) >>
+>> endobj
+16933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.591 169.975 170.528 180.878]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.574 158.019 233.511 168.923]
+/A << /S /GoTo /D (page.118) >>
+>> endobj
+16935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.296 146.064 246.233 156.968]
+/A << /S /GoTo /D (page.118) >>
+>> endobj
+16936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.222 146.064 266.158 156.968]
+/A << /S /GoTo /D (page.119) >>
+>> endobj
+16937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.015 134.109 219.952 145.013]
+/A << /S /GoTo /D (page.123) >>
+>> endobj
+16938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 122.871 172.899 133.058]
+/A << /S /GoTo /D (page.127) >>
+>> endobj
+16939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.283 110.199 207.219 121.103]
+/A << /S /GoTo /D (page.115) >>
+>> endobj
+16940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.782 98.244 196.719 109.147]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.573 86.288 268.509 97.192]
+/A << /S /GoTo /D (page.124) >>
+>> endobj
+16942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.544 74.333 225.481 85.237]
+/A << /S /GoTo /D (page.125) >>
+>> endobj
+16943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.684 708.674 386.62 718.861]
+/A << /S /GoTo /D (page.107) >>
+>> endobj
+16944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.03 696.719 384.966 706.906]
+/A << /S /GoTo /D (page.108) >>
+>> endobj
+16945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 684.047 396.021 694.951]
+/A << /S /GoTo /D (page.127) >>
+>> endobj
+16946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [426.67 672.092 443.606 682.996]
+/A << /S /GoTo /D (page.112) >>
+>> endobj
+16947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.545 660.136 447.482 671.04]
+/A << /S /GoTo /D (page.113) >>
+>> endobj
+16948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.044 648.899 436.981 659.085]
+/A << /S /GoTo /D (page.112) >>
+>> endobj
+16949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.92 636.943 440.856 647.13]
+/A << /S /GoTo /D (page.113) >>
+>> endobj
+16950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.522 624.988 400.458 635.175]
+/A << /S /GoTo /D (page.110) >>
+>> endobj
+16951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [467.885 612.316 484.821 623.22]
+/A << /S /GoTo /D (page.125) >>
+>> endobj
+16952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [437.449 600.361 454.386 611.265]
+/A << /S /GoTo /D (page.125) >>
+>> endobj
+16953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.226 588.405 471.162 599.309]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+16954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.254 576.45 413.19 587.354]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+16955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.87 564.495 424.806 575.399]
+/A << /S /GoTo /D (page.120) >>
+>> endobj
+16956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.877 553.257 393.813 563.444]
+/A << /S /GoTo /D (page.115) >>
+>> endobj
+16957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.852 540.585 429.788 551.489]
+/A << /S /GoTo /D (page.115) >>
+>> endobj
+16958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.194 528.63 397.131 539.534]
+/A << /S /GoTo /D (page.120) >>
+>> endobj
+16959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [491.283 516.674 503.238 527.578]
+/A << /S /GoTo /D (page.97) >>
+>> endobj
+16960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.088 504.719 521.025 515.623]
+/A << /S /GoTo /D (page.127) >>
+>> endobj
+16961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.693 492.764 381.629 503.668]
+/A << /S /GoTo /D (page.128) >>
+>> endobj
+16962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 470.791 362.272 479.758]
+/A << /S /GoTo /D (page.169) >>
+>> endobj
+16963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.055 456.899 505.991 467.803]
+/A << /S /GoTo /D (page.128) >>
+>> endobj
+16964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.582 432.988 402.519 443.892]
+/A << /S /GoTo /D (page.128) >>
+>> endobj
+16965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.676 409.078 412.613 419.982]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.552 397.123 416.488 408.027]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 385.885 405.987 396.071]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+16968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 373.93 409.863 384.116]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.127 361.257 455.063 372.161]
+/A << /S /GoTo /D (page.143) >>
+>> endobj
+16970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.501 349.302 448.438 360.206]
+/A << /S /GoTo /D (page.142) >>
+>> endobj
+16971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [473.165 337.347 490.101 348.251]
+/A << /S /GoTo /D (page.152) >>
+>> endobj
+16972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.271 325.392 491.207 336.296]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+16973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.505 313.437 423.442 324.34]
+/A << /S /GoTo /D (page.147) >>
+>> endobj
+16974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.157 301.481 399.093 312.385]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+16975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.879 289.526 411.816 300.43]
+/A << /S /GoTo /D (page.147) >>
+>> endobj
+16976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.45 277.571 438.386 288.475]
+/A << /S /GoTo /D (page.149) >>
+>> endobj
+16977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.172 265.616 451.108 276.52]
+/A << /S /GoTo /D (page.149) >>
+>> endobj
+16978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.995 254.378 428.932 264.565]
+/A << /S /GoTo /D (page.138) >>
+>> endobj
+16979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.603 242.423 429.539 252.609]
+/A << /S /GoTo /D (page.139) >>
+>> endobj
+16980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.999 230.468 368.917 240.654]
+/A << /S /GoTo /D (page.135d) >>
+>> endobj
+16981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.21 217.795 446.147 228.699]
+/A << /S /GoTo /D (page.152) >>
+>> endobj
+16982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.594 205.84 442.53 216.744]
+/A << /S /GoTo /D (page.151) >>
+>> endobj
+16983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.302 193.885 424.239 204.789]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+16984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 182.647 387.726 192.834]
+/A << /S /GoTo /D (page.138) >>
+>> endobj
+16985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.597 170.692 380.533 180.878]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+16986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.408 158.019 417.345 168.923]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+16987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.428 146.064 473.365 156.968]
+/A << /S /GoTo /D (page.150) >>
+>> endobj
+16988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.617 134.109 449.554 145.013]
+/A << /S /GoTo /D (page.154) >>
+>> endobj
+16989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.92 122.154 440.856 133.058]
+/A << /S /GoTo /D (page.154) >>
+>> endobj
+16990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.073 110.199 387.009 121.103]
+/A << /S /GoTo /D (page.140) >>
+>> endobj
+16991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.056 98.244 449.992 109.147]
+/A << /S /GoTo /D (page.147) >>
+>> endobj
+16992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.981 98.244 469.917 109.147]
+/A << /S /GoTo /D (page.148) >>
+>> endobj
+16993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.778 86.288 462.714 97.192]
+/A << /S /GoTo /D (page.148) >>
+>> endobj
+16994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.733 74.333 394.67 85.237]
+/A << /S /GoTo /D (page.155) >>
+>> endobj
+16996 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17000 0 obj <<
+/D [16998 0 R /XYZ 89 770.89 null]
+>> endobj
+16997 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17107 0 obj <<
+/Length 1715      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�6~����0��I)h���v]���0�-�bl����4�~��.vbE)��^Y�?

~�Jbce`����br�R���
N���2
l�A��'��4}�����g_o

�3���`&)_O^,&�&�b�ԿfH��2�|��
^�102
۸�E�EM�'L�}A8�'��L�!A��s���
�e�k���I�O*!���U#ƇW�Ӝ2<%�5�y��
 
����F�����2��H� �e��e
$��eY��U��#�l�1�\?��I ٽJ�H	Gz
�(ȥ
��aӛ<�6I�
���y7�xK	�G2� 8SBZ
+��_���N?Lk�X�&�yy���N^���o��8lkjO��C��!
��2�ps�F�1�I�I�������K�q���a���W�#��H�T~Ƙ�ҽ����UZ�x)����U�ylv(.��6�\�*��V�%���^���:X���6ms�$GF�d�VN�{|�pd�ɂhW�n��ܶ�q��޾?~ 	�e
�V�@��Pw߰!=���M&u���E��ꡁm�t������np��8o��D��(�
[�cN�hog.J��4�܋$�]K?�ܷ�eꥷ��ϒ���B� ׿�-]�#j�F�^�Յ� l���ځ"����uڋ����i�w�绗I<4
�l����@@r�E
B)N�������bf2p���<ҷ*�xtr�A6#���w���9�9A�:G�C���؊�ٯU��Qdynv=#x�mF
+���~�e�D�����|~$��CW�[8gC�cM���Qۺ.gLJ���)�IoRr
�������*�dU�U���8j s4Y=�/��h��.�����&�Y��V-�.�0���jT���T����i�_��O�'QT+��SP �w
���dNAn�l1�����ӕ̻�b���G7[᭜t."dP���˯��J�}WD�2�C�!S��r��Mqj56,���[��N_�>\�v*h���o�
ĭ݀�LX�b�Oa�ye
+s(�孄#X���vMj������Ž2�$^�2��l�oRL�@����
��]m� ��߲4C}��J��R�� <�h)���٤�Ȥ(���Õ��=�P��4md
+��Y:6b�<�Y���vB�v�
z�Vq����ak����M���
�S�i�9��k61���
�D^�&Z6��T����/�m-�S���2�-��Me�XN՟T��|=s��
�\Lm�KP5��,��5S�U��e:����̽"O�d,�
LZ\�D��m���@��#�;�@h�@'C�4�Z���Ƚѯȏ����?���E�p���l��(�Z�#M=[W��[u$��]}�b��?�
�XF��O�11��x
�7R%��)�f
Z����O�8�i~(���*
:�Ujt������|���� �W!�6��F�|���}],w嶺
w��}�.4M�2�����]C�?8�/�@�����1��Zҵ�
� l���;����ɓY%�s�e�ٔ
�zz�� �cR�{q��C�V�r>�KI�}��Ի+z����ٙk_{�	��5��m���@
+n5��,��a|]��eͱ����ßB~�16��Ͽ{1.��g�p}�!����"��6|G�ln���(e��Z����� �'Y��8�y�9=9�,VPy��2����^
�صޠz����YT�%5Ȋ����d� ��V��o�0�V#�?W_nؼ8y
����|w��?���
+endstream
+endobj
+17106 0 obj <<
+/Type /Page
+/Contents 17107 0 R
+/Resources 17105 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16738 0 R
+/Annots [ 16995 0 R 17001 0 R 17002 0 R 17003 0 R 17004 0 R 17005 0 R 17006 0 R 17007 0 R 17008 0 R 17009 0 R 17010 0 R 17011 0 R 17012 0 R 17013 0 R 17014 0 R 17015 0 R 17016 0 R 17017 0 R 17018 0 R 17019 0 R 17020 0 R 17021 0 R 17022 0 R 17023 0 R 17024 0 R 17025 0 R 17026 0 R 17027 0 R 17028 0 R 17029 0 R 17030 0 R 17031 0 R 17032 0 R 17033 0 R 17034 0 R 17035 0 R 17036 0 R 17037 0 R 17038 0 R 17039 0 R 17040 0 R 17041 0 R 17042 0 R 17043 0 R 17044 0 R 17045 0 R 17046 0 R 17047 0 R 17 [...]
+>> endobj
+16995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.495 708.674 201.432 718.861]
+/A << /S /GoTo /D (page.155) >>
+>> endobj
+17001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.744 696.002 201.681 706.906]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+17002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 684.764 172.899 694.951]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+17003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.283 672.092 207.219 682.996]
+/A << /S /GoTo /D (page.145) >>
+>> endobj
+17004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.782 660.136 196.719 671.04]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+17005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.67 648.181 274.606 659.085]
+/A << /S /GoTo /D (page.151) >>
+>> endobj
+17006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.544 636.226 225.481 647.13]
+/A << /S /GoTo /D (page.154) >>
+>> endobj
+17007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.202 624.988 170.139 635.175]
+/A << /S /GoTo /D (page.139) >>
+>> endobj
+17008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.549 613.033 168.485 623.22]
+/A << /S /GoTo /D (page.140) >>
+>> endobj
+17009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 600.361 179.539 611.265]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+17010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.416 588.405 214.353 599.309]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.292 576.45 218.228 587.354]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.189 564.495 227.125 575.399]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.064 552.54 231 563.444]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.563 541.302 220.5 551.489]
+/A << /S /GoTo /D (page.143) >>
+>> endobj
+17015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.438 529.347 224.375 539.534]
+/A << /S /GoTo /D (page.143) >>
+>> endobj
+17016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.04 517.392 183.977 527.578]
+/A << /S /GoTo /D (page.138) >>
+>> endobj
+17017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.404 504.719 268.34 515.623]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+17018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 492.764 237.904 503.668]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+17019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.146 481.526 177.083 491.713]
+/A << /S /GoTo /D (page.155) >>
+>> endobj
+17020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 468.854 254.681 479.758]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+17021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.772 456.899 196.709 467.803]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+17022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.389 444.943 208.325 455.847]
+/A << /S /GoTo /D (page.149) >>
+>> endobj
+17023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.396 433.706 177.332 443.892]
+/A << /S /GoTo /D (page.145) >>
+>> endobj
+17024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.371 421.033 213.307 431.937]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+17025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.292 409.078 250.228 419.982]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+17026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 397.123 180.65 408.027]
+/A << /S /GoTo /D (page.150) >>
+>> endobj
+17027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.752 385.168 275.688 396.071]
+/A << /S /GoTo /D (page.129) >>
+>> endobj
+17028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.631 373.212 279.568 384.116]
+/A << /S /GoTo /D (page.156) >>
+>> endobj
+17029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.474 361.257 193.392 372.161]
+/A << /S /GoTo /D (page.158d) >>
+>> endobj
+17030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.916 349.302 235.852 360.206]
+/A << /S /GoTo /D (page.162) >>
+>> endobj
+17031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 327.329 145.791 336.296]
+/A << /S /GoTo /D (page.196) >>
+>> endobj
+17032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.694 314.154 185.631 324.34]
+/A << /S /GoTo /D (page.197) >>
+>> endobj
+17033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.619 314.154 205.556 324.34]
+/A << /S /GoTo /D (page.198) >>
+>> endobj
+17034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.898 302.199 152.834 312.385]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+17035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.016 289.526 163.952 300.43]
+/A << /S /GoTo /D (page.198) >>
+>> endobj
+17036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 277.571 175.28 288.475]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+17037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.541 265.616 170.478 276.52]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+17038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.724 253.661 169.661 264.565]
+/A << /S /GoTo /D (page.198) >>
+>> endobj
+17039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 241.706 175.28 252.609]
+/A << /S /GoTo /D (page.199) >>
+>> endobj
+17040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.1 229.75 293.037 240.654]
+/A << /S /GoTo /D (page.319) >>
+>> endobj
+17041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.898 218.512 152.834 228.699]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+17042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.682 206.557 159.618 216.744]
+/A << /S /GoTo /D (page.320) >>
+>> endobj
+17043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.607 206.557 179.544 216.744]
+/A << /S /GoTo /D (page.321) >>
+>> endobj
+17044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.016 193.885 163.952 204.789]
+/A << /S /GoTo /D (page.321) >>
+>> endobj
+17045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 181.93 175.28 192.834]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+17046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.541 169.975 170.478 180.878]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+17047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.724 158.019 169.661 168.923]
+/A << /S /GoTo /D (page.322) >>
+>> endobj
+17048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 146.064 175.28 156.968]
+/A << /S /GoTo /D (page.323) >>
+>> endobj
+17049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 122.871 165.148 133.058]
+/A << /S /GoTo /D (page.164) >>
+>> endobj
+17050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.169 110.199 280.105 121.103]
+/A << /S /GoTo /D (page.164) >>
+>> endobj
+17051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.101 86.288 186.037 97.192]
+/A << /S /GoTo /D (page.165) >>
+>> endobj
+17052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.827 707.957 377.763 718.861]
+/A << /S /GoTo /D (page.169) >>
+>> endobj
+17053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.581 684.047 389.518 694.951]
+/A << /S /GoTo /D (page.165) >>
+>> endobj
+17054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [506.29 672.092 523.227 682.996]
+/A << /S /GoTo /D (page.171) >>
+>> endobj
+17055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.06 660.854 400.996 671.04]
+/A << /S /GoTo /D (page.172) >>
+>> endobj
+17056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.165 648.899 402.102 659.085]
+/A << /S /GoTo /D (page.176) >>
+>> endobj
+17057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.157 636.943 399.093 647.13]
+/A << /S /GoTo /D (page.175) >>
+>> endobj
+17058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.692 624.988 381.629 635.175]
+/A << /S /GoTo /D (page.176) >>
+>> endobj
+17059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.175 613.033 402.112 623.22]
+/A << /S /GoTo /D (page.173) >>
+>> endobj
+17060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.512 601.078 400.448 611.265]
+/A << /S /GoTo /D (page.172) >>
+>> endobj
+17061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.582 576.45 402.519 587.354]
+/A << /S /GoTo /D (page.177) >>
+>> endobj
+17062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 554.597 362.272 563.444]
+/A << /S /GoTo /D (page.178) >>
+>> endobj
+17063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.843 540.585 434.779 551.489]
+/A << /S /GoTo /D (page.179) >>
+>> endobj
+17064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [469.688 528.63 486.624 539.534]
+/A << /S /GoTo /D (page.179) >>
+>> endobj
+17065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.194 517.392 389.131 527.578]
+/A << /S /GoTo /D (page.184) >>
+>> endobj
+17066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.531 504.719 395.467 515.623]
+/A << /S /GoTo /D (page.183) >>
+>> endobj
+17067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.456 504.719 415.393 515.623]
+/A << /S /GoTo /D (page.184) >>
+>> endobj
+17068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.377 492.764 436.313 503.668]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+17069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.117 480.809 391.053 491.713]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.619 469.571 406.555 479.758]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.919 456.899 435.856 467.803]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.061 444.943 405.997 455.847]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.232 433.706 387.168 443.892]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 421.033 396.021 431.937]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.356 409.078 383.293 419.982]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.282 409.078 403.218 419.982]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+17077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.975 397.123 388.912 408.027]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 385.168 391.761 396.071]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.75 385.168 411.686 396.071]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+17080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.504 373.212 394.441 384.116]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.762 361.975 397.699 372.161]
+/A << /S /GoTo /D (page.184) >>
+>> endobj
+17082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.063 349.302 432 360.206]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.583 337.347 442.52 348.251]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.821 325.392 408.757 336.296]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.119 313.437 417.056 324.34]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 301.481 367.702 312.385]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.69 301.481 387.627 312.385]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+17088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [503.531 289.526 520.467 300.43]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+17089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.852 277.571 429.788 288.475]
+/A << /S /GoTo /D (page.191) >>
+>> endobj
+17090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.528 266.333 369.465 276.52]
+/A << /S /GoTo /D (page.191) >>
+>> endobj
+17091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 253.661 396.021 264.565]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 241.706 391.761 252.609]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [440.517 229.75 457.454 240.654]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.063 217.795 432 228.699]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 205.84 367.702 216.744]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.07 182.647 401.006 192.834]
+/A << /S /GoTo /D (page.204) >>
+>> endobj
+17097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.359 158.019 409.295 168.923]
+/A << /S /GoTo /D (page.193) >>
+>> endobj
+17098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.886 134.826 406.823 145.013]
+/A << /S /GoTo /D (page.193) >>
+>> endobj
+17099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.692 98.961 381.629 109.147]
+/A << /S /GoTo /D (page.208) >>
+>> endobj
+17100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [463.062 86.288 479.999 97.192]
+/A << /S /GoTo /D (page.209) >>
+>> endobj
+17101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.194 75.05 389.131 85.237]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17104 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17108 0 obj <<
+/D [17106 0 R /XYZ 89 770.89 null]
+>> endobj
+17105 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17222 0 obj <<
+/Length 1722      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�6~����̚Hq�������u7�Lgvw��,G�����`��a��d&v|::��w�t@�JC�������mh��Z�Үo5i���Ԃ�B��	5����[�p��"
O����rv������zv?ב����n;Z��>}AZ��jH7\G{(oJ4��kW��fh�
��|'T�1�1�F}��y��(-^�cW��U=��˙�iA(:!جo���Y����0�Ki5t�n������8[s����(K��n/p�{�~��^�I�,�hN�ɟ���#`�'�(
��Q^0�K�,�M���*
+�xdT�5�~�qq����?��c�n��cuG�a�L��0tZ
+O��0a�����	
Ku
+N� G�\�[y��
��u�O�9��cMm��G�z5
���8K�9r������ya�0
���;gEr,�]t[Ln�C��C��p����z�5�
�ʬ�Y,E}���2��X�}�}t�}����s���
!
$}Cb{����y2Q./�mS:�T�m0���#�
_,�ZOwh�k^TT�
l�.�0�r�#
7���J��&�晸J2���2�JhY�b
AD7�ۗ,�":�ns�3�b^{F���u���؞?lW7I3��8c@�$J��

ѝ�{i���L#(u��U�
�F�Jj���Y�-S,{�
�O�a-��;%b��#
¶�cyu~��>؂g<M������	�#��Yt+�p�8K!_����
+
���%�]�V:Wo
�����r-p�j�YMha�t�[�� ��% f޲��.J�$`�@%]��@���H�~-0$J�t��
�c{~0m��� ?\,�_�ćelը��Y��
���ѫ_�v]�_�q�u�H�o).0��Y���/@���5�P�&Y��Aj�P��^���>IgY=�|�
1 �I���E�*��V�@ޛ��z���H
&2&K�&n{[:Bd��佮�vp��"�5R�qX�_gI�Y^�DG6�����J��ؚ,`{��0�	��h_��F�@�7yo
+�1��uz�S�c�
�+$"5�ڟš�,(�,���4���s�?#dd��|���g1�:L-O7�܊Ɗ��Jgjݖ
h�60C��h%=?��^��a�%�x��r�G�̤��S���%�⏃�C�
+�if
@���4xq�L$�:m(Ҋ�Ә�}��^�
³��.�1,���4��77CV
[�_�T�L�TИ ��
g�:S��Q<�ċ���?62V�A!a� R�kQ�˧����V��(�lj��l�Q���Q^��V�
�L�t��^P�*�Su[��M���`k
Ű��L��qp�h�F\��Ҕ��Y�=[�Ro|oU�b;€��#'b0��%ѷ�E׹��=Xɂ"��?��N̘�]\I�9��+C<��+�j�n����ťh�zO��J
��e
D�g~(�W�Z�W4N�o搶)͌0�_{`�ü��ŭ��jkwϴ.�~�x��t�.
ŬV|#�G2D�H5���cѬ��k���bڶ�<�
+"�T�i�5�&R)"�F��� fc��l��j�&����;�=��������h���^�s�L}��Mbhg�=�- o�
�}���̪,$�l�2�
�^
X.�W_~��aN�I^���OaoS}��(�E�c��"�1lM
���
銱�m�m_�L'^
��6�H7�'�+����ӛ�
+��+=Ȓ��[r]
�O-�[P�Ҡ$����.&�Yo A �
�M
+endstream
+endobj
+17221 0 obj <<
+/Type /Page
+/Contents 17222 0 R
+/Resources 17220 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 16738 0 R
+/Annots [ 17102 0 R 17103 0 R 17109 0 R 17110 0 R 17111 0 R 17112 0 R 17113 0 R 17114 0 R 17115 0 R 17116 0 R 17117 0 R 17118 0 R 17119 0 R 17120 0 R 17121 0 R 17122 0 R 17123 0 R 17124 0 R 17125 0 R 17126 0 R 17127 0 R 17128 0 R 17129 0 R 17130 0 R 17131 0 R 17132 0 R 17133 0 R 17134 0 R 17135 0 R 17136 0 R 17137 0 R 17138 0 R 17139 0 R 17140 0 R 17141 0 R 17142 0 R 17143 0 R 17144 0 R 17145 0 R 17146 0 R 17147 0 R 17148 0 R 17149 0 R 17150 0 R 17151 0 R 17152 0 R 17153 0 R 17154 0 R 17 [...]
+>> endobj
+17102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.424 708.674 172.361 718.861]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+17103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.349 708.674 192.286 718.861]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.895 696.002 219.832 706.906]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+17110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.848 684.047 176.784 694.951]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+17111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.274 672.092 196.211 682.996]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+17112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.137 660.854 190.074 671.04]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+17113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.579 648.181 189.516 659.085]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.854 636.226 171.791 647.13]
+/A << /S /GoTo /D (page.216) >>
+>> endobj
+17115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.78 636.226 191.716 647.13]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+17116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 624.271 179.539 635.175]
+/A << /S /GoTo /D (page.218) >>
+>> endobj
+17117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.473 612.316 177.41 623.22]
+/A << /S /GoTo /D (page.217) >>
+>> endobj
+17118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.398 612.316 197.335 623.22]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+17119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.854 600.361 176.772 611.265]
+/A << /S /GoTo /D (page.216d) >>
+>> endobj
+17120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.473 588.405 182.391 599.309]
+/A << /S /GoTo /D (page.217d) >>
+>> endobj
+17121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 576.45 180.261 587.354]
+/A << /S /GoTo /D (page.217d) >>
+>> endobj
+17122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 564.495 237.904 575.399]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.582 552.54 215.518 563.444]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.102 540.585 226.039 551.489]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 528.63 151.22 539.534]
+/A << /S /GoTo /D (page.218) >>
+>> endobj
+17126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.209 528.63 171.145 539.534]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+17127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.587 516.674 150.523 527.578]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+17128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.578 504.719 297.515 515.623]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+17129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.745 492.764 206.681 503.668]
+/A << /S /GoTo /D (page.222) >>
+>> endobj
+17130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 480.809 179.539 491.713]
+/A << /S /GoTo /D (page.222) >>
+>> endobj
+17131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 468.854 151.22 479.758]
+/A << /S /GoTo /D (page.222) >>
+>> endobj
+17132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.209 468.854 171.145 479.758]
+/A << /S /GoTo /D (page.223) >>
+>> endobj
+17133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.588 445.661 184.525 455.847]
+/A << /S /GoTo /D (page.223) >>
+>> endobj
+17134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.878 421.033 192.814 431.937]
+/A << /S /GoTo /D (page.224) >>
+>> endobj
+17135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.405 397.84 190.341 408.027]
+/A << /S /GoTo /D (page.224) >>
+>> endobj
+17136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.706 373.212 235.643 384.116]
+/A << /S /GoTo /D (page.226) >>
+>> endobj
+17137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 361.257 179.539 372.161]
+/A << /S /GoTo /D (page.226) >>
+>> endobj
+17138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 339.404 145.791 348.251]
+/A << /S /GoTo /D (page.225) >>
+>> endobj
+17139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 302.199 165.148 312.385]
+/A << /S /GoTo /D (page.229) >>
+>> endobj
+17140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 266.333 165.148 276.52]
+/A << /S /GoTo /D (page.232) >>
+>> endobj
+17141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.584 242.423 158.521 252.609]
+/A << /S /GoTo /D (page.232) >>
+>> endobj
+17142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.382 217.795 239.319 228.699]
+/A << /S /GoTo /D (page.243) >>
+>> endobj
+17143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.862 205.84 220.799 216.744]
+/A << /S /GoTo /D (page.242) >>
+>> endobj
+17144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.429 193.885 224.365 204.789]
+/A << /S /GoTo /D (page.242) >>
+>> endobj
+17145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.252 181.93 178.189 192.834]
+/A << /S /GoTo /D (page.242) >>
+>> endobj
+17146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.987 158.019 226.924 168.923]
+/A << /S /GoTo /D (page.241) >>
+>> endobj
+17147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 136.166 145.791 145.013]
+/A << /S /GoTo /D (page.236) >>
+>> endobj
+17148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.412 110.199 238.349 121.103]
+/A << /S /GoTo /D (page.236) >>
+>> endobj
+17149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.454 87.006 188.39 97.192]
+/A << /S /GoTo /D (page.241) >>
+>> endobj
+17150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.713 75.05 172.649 85.237]
+/A << /S /GoTo /D (page.240) >>
+>> endobj
+17151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.692 708.674 381.629 718.861]
+/A << /S /GoTo /D (page.239) >>
+>> endobj
+17152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.136 696.719 386.073 706.906]
+/A << /S /GoTo /D (page.240) >>
+>> endobj
+17153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.209 684.764 401.146 694.951]
+/A << /S /GoTo /D (page.240) >>
+>> endobj
+17154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.183 672.092 493.12 682.996]
+/A << /S /GoTo /D (page.263) >>
+>> endobj
+17155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.559 660.136 390.496 671.04]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.148 648.181 412.085 659.085]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.962 636.226 413.898 647.13]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.615 624.271 415.552 635.175]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.665 612.316 391.602 623.22]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.69 600.361 403.626 611.265]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.223 588.405 392.159 599.309]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.98 576.45 416.917 587.354]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.516 564.495 391.452 575.399]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.487 553.257 388.424 563.444]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.771 540.585 392.707 551.489]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.223 528.63 392.159 539.534]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.6 516.674 411.537 527.578]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [461.379 504.719 478.315 515.623]
+/A << /S /GoTo /D (page.243) >>
+>> endobj
+17169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.628 492.764 401.564 503.668]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.553 492.764 421.489 503.668]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.478 492.764 441.415 503.668]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.194 481.526 389.131 491.713]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.377 468.854 436.313 479.758]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.818 457.616 374.755 467.803]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.084 444.943 453.02 455.847]
+/A << /S /GoTo /D (page.254) >>
+>> endobj
+17176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.009 444.943 472.946 455.847]
+/A << /S /GoTo /D (page.255) >>
+>> endobj
+17177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [475.935 444.943 492.871 455.847]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.222 433.706 387.158 443.892]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.329 421.033 393.265 431.937]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.756 409.078 412.692 419.982]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.45 397.123 456.368 408.027]
+/A << /S /GoTo /D (page.255d) >>
+>> endobj
+17182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.335 385.885 362.272 396.071]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.261 385.885 382.197 396.071]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.186 385.885 402.122 396.071]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 373.212 396.021 384.116]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.01 373.212 415.946 384.116]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 361.257 391.761 372.161]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.75 361.257 411.686 372.161]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [440.517 349.302 457.454 360.206]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.875 337.347 367.811 348.251]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.8 337.347 387.736 348.251]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.725 337.347 407.662 348.251]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.114 325.392 360.05 336.296]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.039 325.392 379.976 336.296]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.964 325.392 399.901 336.296]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.295 313.437 460.213 324.34]
+/A << /S /GoTo /D (page.253d) >>
+>> endobj
+17197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [463.202 313.437 480.138 324.34]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [437.449 301.481 454.386 312.385]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.063 289.526 432 300.43]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.583 277.571 442.52 288.475]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 265.616 367.702 276.52]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.69 265.616 387.627 276.52]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.068 253.661 367.004 264.565]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+17204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.7 241.706 512.636 252.609]
+/A << /S /GoTo /D (page.258) >>
+>> endobj
+17205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 230.468 387.726 240.654]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+17206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.543 217.795 421.479 228.699]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+17207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 205.84 396.021 216.744]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+17208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 193.885 367.702 204.789]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+17209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.07 170.692 401.006 180.878]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+17210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.81 158.019 456.747 168.923]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.676 146.064 412.613 156.968]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+17212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.552 134.109 416.488 145.013]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+17213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 122.871 405.987 133.058]
+/A << /S /GoTo /D (page.283) >>
+>> endobj
+17214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 110.916 409.863 121.103]
+/A << /S /GoTo /D (page.283) >>
+>> endobj
+17215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.408 98.244 425.345 109.147]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+17216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.284 86.288 429.22 97.192]
+/A << /S /GoTo /D (page.285) >>
+>> endobj
+17217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.127 74.333 455.063 85.237]
+/A << /S /GoTo /D (page.282) >>
+>> endobj
+17219 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17223 0 obj <<
+/D [17221 0 R /XYZ 89 770.89 null]
+>> endobj
+17220 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17330 0 obj <<
+/Length 1711      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6}�W��L�S��!��:Ik�q��q2��(�����(_��E�MQ)2�e�"vg!b�W��f��fr���9�j*7K����;�0ᓧ�N/u��٧����m�
�+�04�8<���|�8�R]m �V�pr�	+

~�`�9�rW�*����@�0�c�1�"�{�P,B!�=��є�gĘn܀{ԍ�,O�����ME#�k>��(�3��S������
�
�8 �^x�S�ǩ
ސ�g	s9�DȣL q�"��p�=������g����%��g�1���q*B�si0��|&)s�#�vY�?pg�
�3�L㐲E\���E�ku�]� .�ߝ�YWL5��<�?ʲL�����$�O�<���
�D�w&2�J��ֲe at y�8O����i9�nc���i��,9�∂��n|��$�BX'�D���)�q
\���V
�L����J�
��J���4)ih��Tz�}��d�f�t`+�X����7��J���
�b�
+,�'��s|r�)�`��
g��
�=sS��T!}.&y��™;�<N� ��˂`C� ��DB2��+{���JQ@��f�G`
�ӝN��:��W�GȒ���K ���|��������z7P���@q��k��[MC�1��ɳg�)��	�Ђԧ�Շ�n#���	=>PnR^����W�4`�I�٩��ܺ�n��N�>0�t%�����Z�&#�g"L���uV���-�eh��	"-ܼ���������)K΋
�Gy���s�q\��Ѯ����&?-۬qR�HŲ^l���?�^'��U;�V���wbBf���y�w]���!��q�Yq/e�X�,���/�/y��B
��oU��ҍÄ�r��~���Md@�MX�LU?i8��K	�A�A
�X�ȶ�%��fklz������"�
�\�$h��,� ��u�ӔC˓fi�����#/h~�t�2������:_n9"�}q��F����s�s��o��
+K�A���\f�B���xa�p����Ѫ�E����V�`��@�S,�&6}�
+
�d3/��C��xʐ�|d�~;q�!��2�G	�n�oDM�������M"WN�͐�'/���&�y�k��K�+b�+
b&ی���fe�7�<��5�<�4���IFֵd�X�S9��ն2���n����� �]����W��e��b�n
+�Xm��Cû��s֗W�*���q��ju�o=z�����e�<�����U�^��"��
WF��{�j���fM

�Nj�"�[�I���E�f�$H7v��F���?���B��y�Qk��3�DIJ��
V������҈s,L#�n�E��d��,mH�]���+/�3h��@�n�6v
K
��u���<�i�&K��KvC_�
$�
�!X
�o���t^��Ol0�y���#��F1�8ӻR��Wl�]TW�d�2�f�H��*��*�,]E�팕a}?Ö�y���ہE� /i�;͘�L�Y�p� }��5[y��Ȱ�A+�	M���Ap�h�@SE�P�g ����6S�B�-d��u��J����Wo����3Øf���X�fA��#6p�K�-mu� ��܆�:�i`X>p^��"���}��x&�x@,!��]����d~~�X��|�QP�cq�/�%��%�0N�A��e�����m,
�0��n��2��lR�3
�/��^X8�
5�U
A���?ضT�
+endstream
+endobj
+17329 0 obj <<
+/Type /Page
+/Contents 17330 0 R
+/Resources 17328 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17332 0 R
+/Annots [ 17218 0 R 17225 0 R 17226 0 R 17227 0 R 17228 0 R 17229 0 R 17230 0 R 17231 0 R 17232 0 R 17233 0 R 17234 0 R 17235 0 R 17236 0 R 17237 0 R 17238 0 R 17239 0 R 17240 0 R 17241 0 R 17242 0 R 17243 0 R 17244 0 R 17245 0 R 17246 0 R 17247 0 R 17248 0 R 17249 0 R 17250 0 R 17251 0 R 17252 0 R 17253 0 R 17254 0 R 17255 0 R 17256 0 R 17257 0 R 17258 0 R 17259 0 R 17260 0 R 17261 0 R 17262 0 R 17263 0 R 17264 0 R 17265 0 R 17266 0 R 17267 0 R 17268 0 R 17269 0 R 17270 0 R 17271 0 R 17 [...]
+>> endobj
+17218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.02 707.957 231.957 718.861]
+/A << /S /GoTo /D (page.283) >>
+>> endobj
+17225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.378 696.002 251.314 706.906]
+/A << /S /GoTo /D (page.285) >>
+>> endobj
+17226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.684 684.047 273.62 694.951]
+/A << /S /GoTo /D (page.293) >>
+>> endobj
+17227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.789 672.092 274.726 682.996]
+/A << /S /GoTo /D (page.293) >>
+>> endobj
+17228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.676 660.136 182.612 671.04]
+/A << /S /GoTo /D (page.287) >>
+>> endobj
+17229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.398 648.181 195.334 659.085]
+/A << /S /GoTo /D (page.287) >>
+>> endobj
+17230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.968 636.226 221.905 647.13]
+/A << /S /GoTo /D (page.289) >>
+>> endobj
+17231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.69 624.271 234.627 635.175]
+/A << /S /GoTo /D (page.289) >>
+>> endobj
+17232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.514 613.033 212.451 623.22]
+/A << /S /GoTo /D (page.279) >>
+>> endobj
+17233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.122 601.078 213.058 611.265]
+/A << /S /GoTo /D (page.279) >>
+>> endobj
+17234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.821 588.405 207.757 599.309]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+17235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.777 576.45 248.714 587.354]
+/A << /S /GoTo /D (page.291) >>
+>> endobj
+17236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.308 565.212 171.245 575.399]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+17237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.115 553.257 164.052 563.444]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+17238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.927 540.585 200.863 551.489]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.947 528.63 256.883 539.534]
+/A << /S /GoTo /D (page.291) >>
+>> endobj
+17240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.136 516.674 233.073 527.578]
+/A << /S /GoTo /D (page.295) >>
+>> endobj
+17241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.439 504.719 224.375 515.623]
+/A << /S /GoTo /D (page.295) >>
+>> endobj
+17242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.591 492.764 170.528 503.668]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+17243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.574 480.809 233.511 491.713]
+/A << /S /GoTo /D (page.287) >>
+>> endobj
+17244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.499 480.809 253.436 491.713]
+/A << /S /GoTo /D (page.288) >>
+>> endobj
+17245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.296 468.854 246.233 479.758]
+/A << /S /GoTo /D (page.288) >>
+>> endobj
+17246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.222 468.854 266.158 479.758]
+/A << /S /GoTo /D (page.289) >>
+>> endobj
+17247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.478 456.899 240.415 467.803]
+/A << /S /GoTo /D (page.291) >>
+>> endobj
+17248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.172 445.661 154.089 455.847]
+/A << /S /GoTo /D (page.274d) >>
+>> endobj
+17249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 433.706 172.899 443.892]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+17250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.283 421.033 207.219 431.937]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.52 409.795 173.456 419.982]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+17252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.782 397.123 196.719 408.027]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+17253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.554 385.168 225.491 396.071]
+/A << /S /GoTo /D (page.278) >>
+>> endobj
+17254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.334 373.212 297.271 384.116]
+/A << /S /GoTo /D (page.292) >>
+>> endobj
+17255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.436 361.257 246.372 372.161]
+/A << /S /GoTo /D (page.293) >>
+>> endobj
+17256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.035 349.302 288.972 360.206]
+/A << /S /GoTo /D (page.292) >>
+>> endobj
+17257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.544 337.347 225.481 348.251]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+17258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.202 326.109 170.139 336.296]
+/A << /S /GoTo /D (page.279) >>
+>> endobj
+17259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.549 314.154 168.485 324.34]
+/A << /S /GoTo /D (page.280) >>
+>> endobj
+17260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.296 302.199 145.233 312.385]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+17261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 289.526 179.539 300.43]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+17262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 277.571 175.28 288.475]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+17263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.189 265.616 227.125 276.52]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.064 253.661 231 264.565]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.563 242.423 220.5 252.609]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.438 230.468 224.375 240.654]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.404 217.795 268.34 228.699]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+17268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 205.84 237.904 216.744]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+17269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 193.885 254.681 204.789]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.772 181.93 196.709 192.834]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+17271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 169.975 151.22 180.878]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+17272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.389 158.019 208.325 168.923]
+/A << /S /GoTo /D (page.290) >>
+>> endobj
+17273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.396 146.781 177.332 156.968]
+/A << /S /GoTo /D (page.285) >>
+>> endobj
+17274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.371 134.109 213.307 145.013]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.292 122.154 250.228 133.058]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.878 110.199 197.815 121.103]
+/A << /S /GoTo /D (page.292) >>
+>> endobj
+17277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 98.244 180.65 109.147]
+/A << /S /GoTo /D (page.290) >>
+>> endobj
+17278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.814 86.288 286.75 97.192]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+17279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 74.333 165.148 85.237]
+/A << /S /GoTo /D (page.297) >>
+>> endobj
+17280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 362.272 706.906]
+/A << /S /GoTo /D (page.170) >>
+>> endobj
+17281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.622 684.047 501.558 694.951]
+/A << /S /GoTo /D (page.297) >>
+>> endobj
+17282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.194 672.809 389.131 682.996]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.377 660.136 436.313 671.04]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+17284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.818 648.899 374.755 659.085]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [393.465 636.943 410.401 647.13]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.366 624.271 383.303 635.175]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 624.271 403.228 635.175]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.906 612.316 388.842 623.22]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.831 612.316 408.767 623.22]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.756 612.316 428.693 623.22]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+17291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.329 600.361 393.265 611.265]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.756 588.405 412.692 599.309]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 576.45 396.021 587.354]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 564.495 391.761 575.399]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.222 552.54 387.158 563.444]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.147 552.54 407.083 563.444]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [437.449 540.585 454.386 551.489]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.447 529.347 412.383 539.534]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.868 517.392 390.804 527.578]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.063 504.719 432 515.623]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.583 492.764 442.52 503.668]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 480.809 367.702 491.713]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.69 480.809 387.627 491.713]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+17304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.068 468.854 367.004 479.758]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+17305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 447.001 362.272 455.847]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+17306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 433.706 387.726 443.892]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.528 421.75 369.465 431.937]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 409.078 396.021 419.982]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 397.123 391.761 408.027]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 385.168 367.702 396.071]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.64 361.975 427.576 372.161]
+/A << /S /GoTo /D (page.195) >>
+>> endobj
+17312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [485.189 349.302 502.126 360.206]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.693 337.347 381.629 348.251]
+/A << /S /GoTo /D (page.312) >>
+>> endobj
+17314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 315.494 362.272 324.34]
+/A << /S /GoTo /D (page.170) >>
+>> endobj
+17315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.323 301.481 488.278 312.385]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+17316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.983 289.526 389.938 300.43]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+17317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.964 265.616 431.9 276.52]
+/A << /S /GoTo /D (page.232) >>
+>> endobj
+17318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.643 242.423 383.58 252.609]
+/A << /S /GoTo /D (page.234) >>
+>> endobj
+17319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.202 218.512 423.139 228.699]
+/A << /S /GoTo /D (page.235) >>
+>> endobj
+17320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.945 194.602 404.882 204.789]
+/A << /S /GoTo /D (page.313) >>
+>> endobj
+17321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.875 169.975 512.812 180.878]
+/A << /S /GoTo /D (page.314) >>
+>> endobj
+17322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [428.353 146.781 445.29 156.968]
+/A << /S /GoTo /D (page.315) >>
+>> endobj
+17323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.577 122.154 504.513 133.058]
+/A << /S /GoTo /D (page.414) >>
+>> endobj
+17324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.369 98.244 469.305 109.147]
+/A << /S /GoTo /D (page.416) >>
+>> endobj
+17325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.538 75.05 393.475 85.237]
+/A << /S /GoTo /D (page.510) >>
+>> endobj
+17327 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17331 0 obj <<
+/D [17329 0 R /XYZ 89 770.89 null]
+>> endobj
+17328 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17445 0 obj <<
+/Length 1721      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�6~ׯ�[�I���;N�Ʈ���N�
�� �-�Gl��wAR�DS(2I_,�LJ=�],��R�������᙭k.r-ji�
�Śm�ȴ࿹���ԍ��7��b�b_��/O_�%
�^]�nG�>�H���lG�����6��o4�t��B͠:�����#�)��k��)���KB�]���
�'
{�O/y8::�2.�/y�N�(ͼ(����+YV�{=�>L��tbU/���	
����EƑ =<��4�� ��k��T����8ٶ�-���� Ø80Rքl#�Xk��m�\���$��[

�|
Sx#(hC@jV��x�3���_FR��V?�y0
P�?bL#�
+���iƣ��)���G���'io��W��x`y�GK6�+N�g����O�|���k�$Ai彋,�1����h�c��N(���"n@!���ͫ]�w����
,�֏���W����b���=d������\�!����V�M�T��ui0
�{"�)㷹�,��D��*�t�S�dA�7��)\I��
�X����E���d5!�-*����{�����@�≗�ICz�uD\�1o5%.b"�UN,e
���A��o�b[j�T� �A	�Uցv֡�ֺ��mE���>[�xѕ��͎w�|���� ��`�L�
544T`�\	�����e9�3�ҕ7�l�<k�s�Ix������FOo�E6���̗�=M�%̧߳�K��֠�o��;/?�qGG3��T

�d��Y�(&M��V��`ꐴ�4!S4�N�z~!��3�d ��p�)[�hu[��M|o�
�xv
���ޔ`D�����uj��w�J�a�NS���Q˨
�]��evg���ŋ�Q^yx��*��1���I2T,m��
2���� ��"�
*��+DwjQD���3����IV�oa�
~&ށ��kZ���h������ڨ=�XK���P�ieLk=���X�i-�WMk]�^���e<I������ޤH��j��|���V�I��L�d/Ӧ��q��
Ծ8�bWI
�#�J�&�6j��˷����x,�6
��R��J�$��$XeR/�/�%�J��
�f�?DŽHEy_x^�S��r���>�
+�E
�
y��h��[p/��Ml�����SH���Q��dp
�nt^�I��-��a�d�U��♭Y����<���&��)���T�������
�gi��UӴr��T��PX)��۾��E
d�*�g�p,;
b���-��+A��"tcYQ�/7y
+9�U����񶜟���H�U��;>ϋ �Y!��X���ܮ��B=��\H���&{܊8%զ�)m���
�:�ږ���a˻�
~�e�2� Y���V|�o�zi��<���&*�W���X�xȺ�n�$
��τ
�F�5�
+Z�V�Zn�zK�yќ�pʥ���
�_L�R�����Szudg�-��RNXK
��� ��B����ol�;�#Q*��88�\(
 �����
X��
;e�$�7��%�p-��OV?"iQdS]���Ƈ�y��l��#Ll�7����o��确�� �7���� &L2�e����z��D�
�^]�-/�Hy���4���
/ʽ����M�>�&�Ȳ.C���3��
����Wf+e��Q�_��TsS&#�y�s�d����p�/S
-�,��_S�u�;
ܥ@a�TJ������C[@��� G�a)
+endstream
+endobj
+17444 0 obj <<
+/Type /Page
+/Contents 17445 0 R
+/Resources 17443 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17332 0 R
+/Annots [ 17326 0 R 17333 0 R 17334 0 R 17335 0 R 17336 0 R 17337 0 R 17338 0 R 17339 0 R 17340 0 R 17341 0 R 17342 0 R 17343 0 R 17344 0 R 17345 0 R 17346 0 R 17347 0 R 17348 0 R 17349 0 R 17350 0 R 17351 0 R 17352 0 R 17353 0 R 17354 0 R 17355 0 R 17356 0 R 17357 0 R 17358 0 R 17359 0 R 17360 0 R 17361 0 R 17362 0 R 17363 0 R 17364 0 R 17365 0 R 17366 0 R 17367 0 R 17368 0 R 17369 0 R 17370 0 R 17371 0 R 17372 0 R 17373 0 R 17374 0 R 17375 0 R 17376 0 R 17377 0 R 17378 0 R 17379 0 R 17 [...]
+>> endobj
+17326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.54 707.957 290.476 718.861]
+/A << /S /GoTo /D (page.316) >>
+>> endobj
+17333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.101 684.047 186.037 694.951]
+/A << /S /GoTo /D (page.316) >>
+>> endobj
+17334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.281 660.136 173.217 671.04]
+/A << /S /GoTo /D (page.319) >>
+>> endobj
+17335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.3 648.181 176.236 659.085]
+/A << /S /GoTo /D (page.319) >>
+>> endobj
+17336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.383 636.943 199.319 647.13]
+/A << /S /GoTo /D (page.318) >>
+>> endobj
+17337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.7 624.988 194.637 635.175]
+/A << /S /GoTo /D (page.318) >>
+>> endobj
+17338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 612.316 254.681 623.22]
+/A << /S /GoTo /D (page.318) >>
+>> endobj
+17339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.584 589.123 158.521 599.309]
+/A << /S /GoTo /D (page.316) >>
+>> endobj
+17340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.324 576.45 297.261 587.354]
+/A << /S /GoTo /D (page.323) >>
+>> endobj
+17341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.667 564.495 195.603 575.399]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+17342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.592 564.495 215.529 575.399]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.898 552.54 152.834 563.444]
+/A << /S /GoTo /D (page.329) >>
+>> endobj
+17344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.296 541.302 145.233 551.489]
+/A << /S /GoTo /D (page.329) >>
+>> endobj
+17345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.848 528.63 176.784 539.534]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+17346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.167 516.674 206.104 527.578]
+/A << /S /GoTo /D (page.329) >>
+>> endobj
+17347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.887 505.437 192.824 515.623]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.043 493.481 209.979 503.668]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.234 481.526 183.17 491.713]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.035 468.854 174.971 479.758]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+17351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.96 468.854 194.896 479.758]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.75 457.616 170.687 467.803]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+17353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 444.943 179.539 455.847]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.528 444.943 199.465 455.847]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.087 432.988 169.023 443.892]
+/A << /S /GoTo /D (page.332) >>
+>> endobj
+17356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 432.988 188.949 443.892]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.937 432.988 208.874 443.892]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.706 421.033 174.642 431.937]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+17359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.631 421.033 194.567 431.937]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.724 409.078 169.661 419.982]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+17361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.65 409.078 189.586 419.982]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 397.123 175.28 408.027]
+/A << /S /GoTo /D (page.332) >>
+>> endobj
+17363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.268 397.123 195.205 408.027]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.194 397.123 215.13 408.027]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.224 385.168 167.16 396.071]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+17366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.149 385.168 187.086 396.071]
+/A << /S /GoTo /D (page.332) >>
+>> endobj
+17367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.074 385.168 207.011 396.071]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210 385.168 226.936 396.071]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.843 373.212 177.76 384.116]
+/A << /S /GoTo /D (page.333d) >>
+>> endobj
+17370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.494 361.257 172.43 372.161]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+17371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.419 361.257 192.356 372.161]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.036 349.302 240.973 360.206]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 337.347 237.904 348.251]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [209.102 325.392 226.039 336.296]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.339 313.437 192.276 324.34]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+17376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.119 301.481 195.055 312.385]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+17377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.044 301.481 214.981 312.385]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 289.526 151.22 300.43]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.209 289.526 171.145 300.43]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.588 266.333 184.525 276.52]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+17381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.694 254.378 185.631 264.565]
+/A << /S /GoTo /D (page.202) >>
+>> endobj
+17382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.016 241.706 163.952 252.609]
+/A << /S /GoTo /D (page.202) >>
+>> endobj
+17383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 229.75 175.28 240.654]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+17384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.541 217.795 170.478 228.699]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+17385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.724 205.84 169.661 216.744]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+17386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 193.885 175.28 204.789]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+17387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 181.93 151.22 192.834]
+/A << /S /GoTo /D (page.204) >>
+>> endobj
+17388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.75 170.692 162.687 180.878]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+17389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.968 146.781 239.905 156.968]
+/A << /S /GoTo /D (page.200) >>
+>> endobj
+17390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.489 110.916 152.426 121.103]
+/A << /S /GoTo /D (page.200) >>
+>> endobj
+17391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 98.244 175.28 109.147]
+/A << /S /GoTo /D (page.200) >>
+>> endobj
+17392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.541 86.288 170.478 97.192]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+17393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 74.333 175.28 85.237]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+17394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.232 708.674 379.168 718.861]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+17395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.37 684.764 467.307 694.951]
+/A << /S /GoTo /D (page.205) >>
+>> endobj
+17396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.194 660.854 389.131 671.04]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+17397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.815 648.899 399.751 659.085]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+17398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 636.226 396.021 647.13]
+/A << /S /GoTo /D (page.339) >>
+>> endobj
+17399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.136 624.988 386.073 635.175]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+17400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.209 613.033 401.146 623.22]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+17401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [499.421 600.361 516.358 611.265]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [478.006 588.405 494.943 599.309]
+/A << /S /GoTo /D (page.339) >>
+>> endobj
+17403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 577.168 405.987 587.354]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+17404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 565.212 409.863 575.399]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+17405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.749 553.257 366.685 563.444]
+/A << /S /GoTo /D (page.344) >>
+>> endobj
+17406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.829 541.302 451.765 551.489]
+/A << /S /GoTo /D (page.342) >>
+>> endobj
+17407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.723 529.347 450.66 539.534]
+/A << /S /GoTo /D (page.342) >>
+>> endobj
+17408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.381 516.674 459.317 527.578]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+17409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.839 504.719 403.776 515.623]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+17410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.868 493.481 398.804 503.668]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+17411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.849 481.526 403.786 491.713]
+/A << /S /GoTo /D (page.343) >>
+>> endobj
+17412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.775 481.526 423.711 491.713]
+/A << /S /GoTo /D (page.344) >>
+>> endobj
+17413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 468.854 396.021 479.758]
+/A << /S /GoTo /D (page.347) >>
+>> endobj
+17414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.148 456.899 404.085 467.803]
+/A << /S /GoTo /D (page.347) >>
+>> endobj
+17415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.033 444.943 415.97 455.847]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+17416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.752 432.988 437.688 443.892]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+17417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.273 421.75 368.21 431.937]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+17418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 409.078 367.702 419.982]
+/A << /S /GoTo /D (page.347) >>
+>> endobj
+17419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 387.105 362.272 396.071]
+/A << /S /GoTo /D (page.194) >>
+>> endobj
+17420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 373.212 391.761 384.116]
+/A << /S /GoTo /D (page.195) >>
+>> endobj
+17421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.692 338.064 381.629 348.251]
+/A << /S /GoTo /D (page.350) >>
+>> endobj
+17422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.499 325.392 510.435 336.296]
+/A << /S /GoTo /D (page.350) >>
+>> endobj
+17423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.341 313.437 424.259 324.34]
+/A << /S /GoTo /D (page.352d) >>
+>> endobj
+17424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.359 289.526 409.295 300.43]
+/A << /S /GoTo /D (page.356) >>
+>> endobj
+17425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.066 266.333 375.002 276.52]
+/A << /S /GoTo /D (page.356) >>
+>> endobj
+17426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.676 241.706 412.613 252.609]
+/A << /S /GoTo /D (page.371) >>
+>> endobj
+17427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.552 229.75 416.488 240.654]
+/A << /S /GoTo /D (page.371) >>
+>> endobj
+17428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 218.512 405.987 228.699]
+/A << /S /GoTo /D (page.370) >>
+>> endobj
+17429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 206.557 409.863 216.744]
+/A << /S /GoTo /D (page.370) >>
+>> endobj
+17430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.127 193.885 455.063 204.789]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.501 181.93 448.438 192.834]
+/A << /S /GoTo /D (page.371) >>
+>> endobj
+17432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [473.165 169.975 490.101 180.878]
+/A << /S /GoTo /D (page.382) >>
+>> endobj
+17433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.271 158.019 491.207 168.923]
+/A << /S /GoTo /D (page.383) >>
+>> endobj
+17434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.505 146.064 423.442 156.968]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+17435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.157 134.109 399.093 145.013]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+17436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.879 122.154 411.816 133.058]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+17437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [441.086 110.199 458.022 121.103]
+/A << /S /GoTo /D (page.381) >>
+>> endobj
+17438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.45 98.244 438.386 109.147]
+/A << /S /GoTo /D (page.378) >>
+>> endobj
+17439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.172 86.288 451.108 97.192]
+/A << /S /GoTo /D (page.379) >>
+>> endobj
+17440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.995 75.05 428.932 85.237]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+17442 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17446 0 obj <<
+/D [17444 0 R /XYZ 89 770.89 null]
+>> endobj
+17443 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F24 537 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17558 0 obj <<
+/Length 1634      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�6~ׯ�[���H��$}h���T��Ng�
"!�
/�T
��wyH�d )��[	}�
�.�D��@��ɯW���mf�Z�q�2dx$0
�EƇ�wϞ�=�t�� �7������Է'ϯ&�
w���_;��a:��	�~m �|��IJ�31.'L�]A\tG���r
c�v�e�͢��D��%O��Lo~n�h��N��/'Ƈ�堩��݀v&�7��qZ̧O=��v�_+��<aU�g��e��T�>VcgL�V�8[��ZR�0�BV�
�t�~@wX��qV�hM ��`<)L�j����Y�����1E^�2O9���qV5N_sA�
�)E���
��e-
BGqʳbI	Lt�sQ5B�/�eXB�>�ݑz�'��
��I��z
Ϋ��UzNn�5ϸ`I��G�5��!+�4Nٚ+��q��z���a�|)q|W������ v���q	�.�������l�qF<�P�ė�bx��W�?���8Ӄ	�0��[�,��
+�h$��8/ ��\ԃ.^@��_m�ā����CS�c��ݐ��;'����~�w�kU
�[�dV�qO]+�Yn�^|�Z�\�^��(Xez�0܎�NJ��a˳�!�3�]�"���V�'[�c�z�yI�4���K���M��@�?3�
M2]n�2N�$^��mYאu���n&p����UrK�T�U�8�v�&��m�߱Io�T %�f#q���> �W]�>;�2�H�q��:������E��nx$}/��

%����}l��>%�%��t��pՃᙁ��҃��Uf�9v]���C{��Qd����
|8Jn���K�d�$����K�y�	�C�ϿB�X�
���=��j��(|_�F
���Z �NQy"kJ�'e�d
�/��	>ҬO1E�	�Xr�8+OD
p�Cq� �*�v&e)����O%��G���0�P]mG��7I]�kZ�uw�Ė��`R�*+뒂A�����=�����.0�.��Zd'`U�jZ)�d[iXP�� [...]
+=m*�����Q	���P�%�
+|����
+�.��:w��P�a�>�b��~�=��!�j����)?� �JH�� 9

�)��E�X��U|�	�
aC�wn������o��$�-ǜ�?�����9�'(�-�v�~d�;�=J\�����|�
�"$�%��Dm5Ϙ���"$��1=<��4��� �{��ؽ�������}4�nM��}4U�
죩�Lj
��N�f�� |�
�=�ز�7�,&�R�H�'O��S����v�
,[ܓ:U��=S)tZW��U�뚨�|pׄ����W�\��,[���ݫX>, �t��t`|{���f���m{�g��O3Ǚ����X�eI{�9���hNț��Đ|x�����hz�y�K+�gcw��~E͹#��I����TU���b�]�<[��%?0ʱ.����V�)�@i.:��ne6�Gs���Ζ¦�Z;k�A�'�D��f������ݍ�W�m<�����|�s�{
+endstream
+endobj
+17557 0 obj <<
+/Type /Page
+/Contents 17558 0 R
+/Resources 17556 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17332 0 R
+/Annots [ 17441 0 R 17447 0 R 17448 0 R 17449 0 R 17450 0 R 17451 0 R 17452 0 R 17453 0 R 17454 0 R 17455 0 R 17456 0 R 17457 0 R 17458 0 R 17459 0 R 17460 0 R 17461 0 R 17462 0 R 17463 0 R 17464 0 R 17465 0 R 17466 0 R 17467 0 R 17468 0 R 17469 0 R 17470 0 R 17471 0 R 17472 0 R 17473 0 R 17474 0 R 17475 0 R 17476 0 R 17477 0 R 17478 0 R 17479 0 R 17480 0 R 17481 0 R 17482 0 R 17483 0 R 17484 0 R 17485 0 R 17486 0 R 17487 0 R 17488 0 R 17489 0 R 17490 0 R 17491 0 R 17492 0 R 17493 0 R 17 [...]
+>> endobj
+17441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.122 708.674 213.058 718.861]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+17447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.455 696.002 241.391 706.906]
+/A << /S /GoTo /D (page.381) >>
+>> endobj
+17448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [212.729 684.047 229.665 694.951]
+/A << /S /GoTo /D (page.382) >>
+>> endobj
+17449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.821 672.092 207.757 682.996]
+/A << /S /GoTo /D (page.383) >>
+>> endobj
+17450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.308 660.854 171.245 671.04]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+17451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.115 648.899 164.052 659.085]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+17452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.927 636.226 200.863 647.13]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+17453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.947 624.271 256.883 635.175]
+/A << /S /GoTo /D (page.380) >>
+>> endobj
+17454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.136 612.316 233.073 623.22]
+/A << /S /GoTo /D (page.384) >>
+>> endobj
+17455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.532 600.361 239.468 611.265]
+/A << /S /GoTo /D (page.385) >>
+>> endobj
+17456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.439 588.405 224.375 599.309]
+/A << /S /GoTo /D (page.385) >>
+>> endobj
+17457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.591 576.45 170.528 587.354]
+/A << /S /GoTo /D (page.370) >>
+>> endobj
+17458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.574 564.495 233.511 575.399]
+/A << /S /GoTo /D (page.377) >>
+>> endobj
+17459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.296 552.54 246.233 563.444]
+/A << /S /GoTo /D (page.378) >>
+>> endobj
+17460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 541.302 172.899 551.489]
+/A << /S /GoTo /D (page.386) >>
+>> endobj
+17461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.283 528.63 207.219 539.534]
+/A << /S /GoTo /D (page.374) >>
+>> endobj
+17462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.782 516.674 196.719 527.578]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+17463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.67 504.719 274.606 515.623]
+/A << /S /GoTo /D (page.382) >>
+>> endobj
+17464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.544 492.764 225.481 503.668]
+/A << /S /GoTo /D (page.384) >>
+>> endobj
+17465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.202 481.526 170.139 491.713]
+/A << /S /GoTo /D (page.368) >>
+>> endobj
+17466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.549 469.571 168.485 479.758]
+/A << /S /GoTo /D (page.369) >>
+>> endobj
+17467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.186 456.899 206.104 467.803]
+/A << /S /GoTo /D (page.364d) >>
+>> endobj
+17468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 444.943 179.539 455.847]
+/A << /S /GoTo /D (page.386) >>
+>> endobj
+17469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.356 432.988 262.292 443.892]
+/A << /S /GoTo /D (page.386) >>
+>> endobj
+17470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.189 421.033 227.125 431.937]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.064 409.078 231 419.982]
+/A << /S /GoTo /D (page.373) >>
+>> endobj
+17472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.563 397.84 220.5 408.027]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.438 385.885 224.375 396.071]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.135 373.212 273.072 384.116]
+/A << /S /GoTo /D (page.373) >>
+>> endobj
+17475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.04 361.975 183.977 372.161]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+17476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.404 349.302 268.34 360.206]
+/A << /S /GoTo /D (page.384) >>
+>> endobj
+17477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 337.347 237.904 348.251]
+/A << /S /GoTo /D (page.383) >>
+>> endobj
+17478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 325.392 254.681 336.296]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+17479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.772 313.437 196.709 324.34]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+17480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.389 301.481 208.325 312.385]
+/A << /S /GoTo /D (page.379) >>
+>> endobj
+17481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.396 290.243 177.332 300.43]
+/A << /S /GoTo /D (page.374) >>
+>> endobj
+17482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.371 277.571 213.307 288.475]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+17483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.292 265.616 250.228 276.52]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+17484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 253.661 180.65 264.565]
+/A << /S /GoTo /D (page.379) >>
+>> endobj
+17485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 231.808 145.791 240.654]
+/A << /S /GoTo /D (page.357) >>
+>> endobj
+17486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 194.602 165.148 204.789]
+/A << /S /GoTo /D (page.388) >>
+>> endobj
+17487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.943 181.93 302.88 192.834]
+/A << /S /GoTo /D (page.417) >>
+>> endobj
+17488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.208 169.975 275.144 180.878]
+/A << /S /GoTo /D (page.418) >>
+>> endobj
+17489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.57 158.737 189.506 168.923]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.445 146.781 193.382 156.968]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.267 134.826 150.204 145.013]
+/A << /S /GoTo /D (page.428) >>
+>> endobj
+17492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.348 122.871 235.284 133.058]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+17493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.242 110.916 234.178 121.103]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+17494 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.105 98.244 252.041 109.147]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.386 87.006 182.323 97.192]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 74.333 179.539 85.237]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.66 707.957 427.596 718.861]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.532 696.719 400.468 706.906]
+/A << /S /GoTo /D (page.427) >>
+>> endobj
+17499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.457 696.719 420.394 706.906]
+/A << /S /GoTo /D (page.428) >>
+>> endobj
+17500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.301 684.047 403.238 694.951]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.501 672.809 379.437 682.996]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.273 660.854 368.21 671.04]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 648.181 367.702 659.085]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.781 636.226 517.717 647.13]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.29 624.271 398.227 635.175]
+/A << /S /GoTo /D (page.433) >>
+>> endobj
+17506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.178 612.316 420.114 623.22]
+/A << /S /GoTo /D (page.432) >>
+>> endobj
+17507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.042 600.361 410.979 611.265]
+/A << /S /GoTo /D (page.433) >>
+>> endobj
+17508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [485.389 588.405 502.325 599.309]
+/A << /S /GoTo /D (page.433) >>
+>> endobj
+17509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.746 576.45 428.682 587.354]
+/A << /S /GoTo /D (page.438) >>
+>> endobj
+17510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.559 565.212 390.496 575.399]
+/A << /S /GoTo /D (page.436) >>
+>> endobj
+17511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 552.54 396.021 563.444]
+/A << /S /GoTo /D (page.438) >>
+>> endobj
+17512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.211 540.585 366.147 551.489]
+/A << /S /GoTo /D (page.436) >>
+>> endobj
+17513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.126 528.63 386.062 539.534]
+/A << /S /GoTo /D (page.437) >>
+>> endobj
+17514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.273 517.392 368.21 527.578]
+/A << /S /GoTo /D (page.437) >>
+>> endobj
+17515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.705 504.719 407.641 515.623]
+/A << /S /GoTo /D (page.437) >>
+>> endobj
+17516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.676 480.809 412.613 491.713]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+17517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.552 468.854 416.488 479.758]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+17518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 457.616 405.987 467.803]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+17519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 445.661 409.863 455.847]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+17520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.127 432.988 455.063 443.892]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+17521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.501 421.033 448.438 431.937]
+/A << /S /GoTo /D (page.405) >>
+>> endobj
+17522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.157 409.078 399.093 419.982]
+/A << /S /GoTo /D (page.407) >>
+>> endobj
+17523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.879 397.123 411.816 408.027]
+/A << /S /GoTo /D (page.407) >>
+>> endobj
+17524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.45 385.168 438.386 396.071]
+/A << /S /GoTo /D (page.409) >>
+>> endobj
+17525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.172 373.212 451.108 384.116]
+/A << /S /GoTo /D (page.409) >>
+>> endobj
+17526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.995 361.975 428.932 372.161]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+17527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.603 350.019 429.539 360.206]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+17528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.302 337.347 424.239 348.251]
+/A << /S /GoTo /D (page.411) >>
+>> endobj
+17529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 326.109 387.726 336.296]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+17530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.597 314.154 380.533 324.34]
+/A << /S /GoTo /D (page.402) >>
+>> endobj
+17531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.408 301.481 417.345 312.385]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.617 289.526 449.554 300.43]
+/A << /S /GoTo /D (page.413) >>
+>> endobj
+17533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.92 277.571 440.856 288.475]
+/A << /S /GoTo /D (page.413) >>
+>> endobj
+17534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.056 265.616 449.992 276.52]
+/A << /S /GoTo /D (page.407) >>
+>> endobj
+17535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.981 265.616 469.917 276.52]
+/A << /S /GoTo /D (page.408) >>
+>> endobj
+17536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.778 253.661 462.714 264.565]
+/A << /S /GoTo /D (page.408) >>
+>> endobj
+17537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.444 242.423 389.38 252.609]
+/A << /S /GoTo /D (page.413) >>
+>> endobj
+17538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.764 229.75 423.701 240.654]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.264 217.795 413.2 228.699]
+/A << /S /GoTo /D (page.400) >>
+>> endobj
+17540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.026 205.84 441.962 216.744]
+/A << /S /GoTo /D (page.412) >>
+>> endobj
+17541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.684 194.602 386.62 204.789]
+/A << /S /GoTo /D (page.401) >>
+>> endobj
+17542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.03 182.647 384.966 192.834]
+/A << /S /GoTo /D (page.401) >>
+>> endobj
+17543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.955 182.647 404.892 192.834]
+/A << /S /GoTo /D (page.402) >>
+>> endobj
+17544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 169.975 396.021 180.878]
+/A << /S /GoTo /D (page.414) >>
+>> endobj
+17545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 158.019 391.761 168.923]
+/A << /S /GoTo /D (page.414) >>
+>> endobj
+17546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [426.67 146.064 443.606 156.968]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+17547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.545 134.109 447.482 145.013]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+17548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.044 122.871 436.981 133.058]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+17549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.92 110.916 440.856 121.103]
+/A << /S /GoTo /D (page.405) >>
+>> endobj
+17550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [437.449 98.244 454.386 109.147]
+/A << /S /GoTo /D (page.412) >>
+>> endobj
+17551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.254 86.288 413.19 97.192]
+/A << /S /GoTo /D (page.402) >>
+>> endobj
+17552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.87 74.333 424.806 85.237]
+/A << /S /GoTo /D (page.410) >>
+>> endobj
+17555 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17559 0 obj <<
+/D [17557 0 R /XYZ 89 770.89 null]
+>> endobj
+17556 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17675 0 obj <<
+/Length 1587      
+/Filter /FlateDecode
+>>
+stream
+xڽZ�r�6}�W�f"$��$}H�8Iӎ�3�&-BS�b���~}��d��	���/�ݳ����6�q5yu3�x���XĸY� �+0>M�Mf_n�6��BS>U�~����?�
��7��I~
f�4�k,�ɧ/����6u�}qSd ˖������xj�'��P
[�pL�f9�.^&�ȸ�ϊ��Q����jb|�[N��
%�|X�9s94Ÿ;M�n�]
x��:
���Z̈́�hs����bf��#�[$��

��}o���?�.f����{�,�-Y�-x"�
��t�C,
l
C����,HsӅ@R�4��̥�lV�|iU�
����O
��L<ܠp��Қ{�	 "]ܓ�q&X&��,<�3.�o��$��X�d��a��
+�`b
�2O2%��L�E#hA(��D
l�*��g��ya��A@��)gz��
3My�M"e2O�,L��N�_��ՂR��T�&��&[?G�,#�m�����	�֠5SV�
sZ�m֎���V<�<�6ɽ�O�G���qoٶ,51e~.%��e�"� X&��k9e:0���E�W���Q�
��=�I�$b^,�Gֶ"��r�O�Jgwm0������/_3#
����U��R�Ŭ�f1��6��_^wn�p{/��9��@�/���pY�N˓r��)B;@����

+���F��i�'�l��]��J�P��`E	T�h{X"?
��GH9]K
u-|j
+���7
+c������%�C��x�"�@4v�J
Q�JΪtއ�f���1X16�8��c�b0n�A�Kg�Iq�6�z#gԑ'�� ]�͏�t��[༅���q����FFi�2��
a*�;��v���Ro�j����I�uIy��{Mx0]t�<4�d
nX|�*���X�sn�뛦! ��
WS�@v�7�A�|#���L��*�ۆ��wk��ò	@�1�mb�҄$�MX�����Lz�ȋ&�� ����Ԙ7G. �:��� 
N�]a3�˗J ��
M���0�?t�J�E�+S�X�Ԇl�%�x,b��Œ:3
�A����r��M>u�1�S�
Q>uG�O]�|Z.u%MF�숥6L-9s���s�ܲ��Q��vgG�G�G�-�re�E�,P�S[ɂF�'_�ZX�
t�U�#=M�uF��]2�\�0����
�75�T�
+��pO--����o����v=�ӧ��u�����;���&��+RY_�W���RՅ*���4��Lx�p΄��M�����P/!ꆎ�V*��L�x���^�W���B1�ذ�	�}�m��x�Rm����m3�Wx\�+����=�[*!k�2���uƴ�ٿP�������ᴗ�m�ٓ��Q��5�<���p�C�gGGQ�twt�q�g
ڨ��?�#p,[�3���0-����@ MDZ�������3Չ�w�m\&�n.������\@	A��Br��:
Z8�f�ʯ������gOE��W?�զ<�
1<��`�'M`ʊ��k&��mI���Un+m��h�/����&��=h�e����Z�x
�It���
Q
+�s^eq,
�^�T��H
p$��
+
+endstream
+endobj
+17674 0 obj <<
+/Type /Page
+/Contents 17675 0 R
+/Resources 17673 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17332 0 R
+/Annots [ 17553 0 R 17554 0 R 17560 0 R 17561 0 R 17562 0 R 17563 0 R 17564 0 R 17565 0 R 17566 0 R 17567 0 R 17568 0 R 17569 0 R 17570 0 R 17571 0 R 17572 0 R 17573 0 R 17574 0 R 17575 0 R 17576 0 R 17577 0 R 17578 0 R 17579 0 R 17580 0 R 17581 0 R 17582 0 R 17583 0 R 17584 0 R 17585 0 R 17586 0 R 17587 0 R 17588 0 R 17589 0 R 17590 0 R 17591 0 R 17592 0 R 17593 0 R 17594 0 R 17595 0 R 17596 0 R 17597 0 R 17598 0 R 17599 0 R 17600 0 R 17601 0 R 17602 0 R 17603 0 R 17604 0 R 17605 0 R 17 [...]
+>> endobj
+17553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.396 708.674 177.332 718.861]
+/A << /S /GoTo /D (page.405) >>
+>> endobj
+17554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.321 708.674 197.257 718.861]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.371 696.002 213.307 706.906]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.878 684.047 197.815 694.951]
+/A << /S /GoTo /D (page.410) >>
+>> endobj
+17562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.031 660.854 201.968 671.04]
+/A << /S /GoTo /D (page.389) >>
+>> endobj
+17563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.195 636.226 196.132 647.13]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+17564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.071 624.271 200.007 635.175]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+17565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.57 613.033 189.506 623.22]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.445 601.078 193.382 611.265]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.829 588.405 181.765 599.309]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.676 576.45 182.612 587.354]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+17569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.398 564.495 195.334 575.399]
+/A << /S /GoTo /D (page.455) >>
+>> endobj
+17570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.457 552.54 219.394 563.444]
+/A << /S /GoTo /D (page.461) >>
+>> endobj
+17571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.542 540.585 247.478 551.489]
+/A << /S /GoTo /D (page.458) >>
+>> endobj
+17572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.748 528.63 232.684 539.534]
+/A << /S /GoTo /D (page.459) >>
+>> endobj
+17573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.968 516.674 221.905 527.578]
+/A << /S /GoTo /D (page.457) >>
+>> endobj
+17574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.69 504.719 234.627 515.623]
+/A << /S /GoTo /D (page.457) >>
+>> endobj
+17575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.514 493.481 212.451 503.668]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+17576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.122 481.526 213.058 491.713]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+17577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.821 468.854 207.757 479.758]
+/A << /S /GoTo /D (page.459) >>
+>> endobj
+17578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.308 457.616 171.245 467.803]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+17579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.115 445.661 164.052 455.847]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+17580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.927 432.988 200.863 443.892]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+17581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.947 421.033 256.883 431.937]
+/A << /S /GoTo /D (page.453) >>
+>> endobj
+17582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.872 421.033 276.809 431.937]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+17583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.136 409.078 233.073 419.982]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+17584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.439 397.123 224.375 408.027]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+17585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.574 385.168 233.511 396.071]
+/A << /S /GoTo /D (page.455) >>
+>> endobj
+17586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.499 385.168 253.436 396.071]
+/A << /S /GoTo /D (page.456) >>
+>> endobj
+17587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.296 373.212 246.233 384.116]
+/A << /S /GoTo /D (page.456) >>
+>> endobj
+17588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.379 361.257 216.315 372.161]
+/A << /S /GoTo /D (page.449) >>
+>> endobj
+17589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [199.13 349.302 216.066 360.206]
+/A << /S /GoTo /D (page.449) >>
+>> endobj
+17590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.962 338.064 172.899 348.251]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+17591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.283 325.392 207.219 336.296]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+17592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.782 313.437 196.719 324.34]
+/A << /S /GoTo /D (page.446) >>
+>> endobj
+17593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.544 301.481 225.481 312.385]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+17594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.202 290.243 170.139 300.43]
+/A << /S /GoTo /D (page.447) >>
+>> endobj
+17595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.128 290.243 190.064 300.43]
+/A << /S /GoTo /D (page.448) >>
+>> endobj
+17596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.549 278.288 168.485 288.475]
+/A << /S /GoTo /D (page.448) >>
+>> endobj
+17597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.474 278.288 188.41 288.475]
+/A << /S /GoTo /D (page.449) >>
+>> endobj
+17598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.195 265.616 196.131 276.52]
+/A << /S /GoTo /D (page.458) >>
+>> endobj
+17599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.274 254.378 209.192 264.565]
+/A << /S /GoTo /D (page.444d) >>
+>> endobj
+17600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.189 241.706 227.125 252.609]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+17601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.064 229.75 231 240.654]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+17602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.563 218.512 220.5 228.699]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.438 206.557 224.375 216.744]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.04 194.602 183.977 204.789]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+17605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.404 181.93 268.34 192.834]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+17606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 169.975 237.904 180.878]
+/A << /S /GoTo /D (page.459) >>
+>> endobj
+17607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 158.019 254.681 168.923]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+17608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.772 146.064 196.709 156.968]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+17609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.389 134.109 208.325 145.013]
+/A << /S /GoTo /D (page.457) >>
+>> endobj
+17610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.396 122.871 177.332 133.058]
+/A << /S /GoTo /D (page.453) >>
+>> endobj
+17611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 110.199 180.65 121.103]
+/A << /S /GoTo /D (page.458) >>
+>> endobj
+17612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.249 87.006 173.186 97.192]
+/A << /S /GoTo /D (page.438) >>
+>> endobj
+17613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.194 74.333 300.13 85.237]
+/A << /S /GoTo /D (page.461) >>
+>> endobj
+17614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 707.957 396.021 718.861]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+17615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.705 696.002 383.642 706.906]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+17616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 684.047 391.761 694.951]
+/A << /S /GoTo /D (page.462) >>
+>> endobj
+17617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.75 684.047 411.686 694.951]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+17618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.088 672.092 396.025 682.996]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+17619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [499.665 660.136 516.602 671.04]
+/A << /S /GoTo /D (page.463) >>
+>> endobj
+17620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 648.181 396.021 659.085]
+/A << /S /GoTo /D (page.464) >>
+>> endobj
+17621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.705 636.226 383.642 647.13]
+/A << /S /GoTo /D (page.465) >>
+>> endobj
+17622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.824 624.271 391.761 635.175]
+/A << /S /GoTo /D (page.464) >>
+>> endobj
+17623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.088 612.316 396.025 623.22]
+/A << /S /GoTo /D (page.464) >>
+>> endobj
+17624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.014 612.316 415.95 623.22]
+/A << /S /GoTo /D (page.465) >>
+>> endobj
+17625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [467.486 600.361 484.423 611.265]
+/A << /S /GoTo /D (page.465) >>
+>> endobj
+17626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.676 588.405 412.613 599.309]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+17627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.552 576.45 416.488 587.354]
+/A << /S /GoTo /D (page.483) >>
+>> endobj
+17628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 565.212 405.987 575.399]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+17629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 553.257 409.863 563.444]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+17630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.378 540.585 404.314 551.489]
+/A << /S /GoTo /D (page.481) >>
+>> endobj
+17631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.253 528.63 408.189 539.534]
+/A << /S /GoTo /D (page.482) >>
+>> endobj
+17632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.127 516.674 455.063 527.578]
+/A << /S /GoTo /D (page.483) >>
+>> endobj
+17633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.501 504.719 448.438 515.623]
+/A << /S /GoTo /D (page.482) >>
+>> endobj
+17634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [429.828 492.764 446.764 503.668]
+/A << /S /GoTo /D (page.482) >>
+>> endobj
+17635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [473.165 480.809 490.101 491.713]
+/A << /S /GoTo /D (page.493) >>
+>> endobj
+17636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.271 468.854 491.207 479.758]
+/A << /S /GoTo /D (page.494) >>
+>> endobj
+17637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.505 456.899 423.442 467.803]
+/A << /S /GoTo /D (page.487) >>
+>> endobj
+17638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.157 444.943 399.093 455.847]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.879 432.988 411.816 443.892]
+/A << /S /GoTo /D (page.487) >>
+>> endobj
+17640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.874 421.033 455.81 431.937]
+/A << /S /GoTo /D (page.491) >>
+>> endobj
+17641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.509 409.078 510.445 419.982]
+/A << /S /GoTo /D (page.492) >>
+>> endobj
+17642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.132 397.123 491.068 408.027]
+/A << /S /GoTo /D (page.493) >>
+>> endobj
+17643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.45 385.168 438.386 396.071]
+/A << /S /GoTo /D (page.489) >>
+>> endobj
+17644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.172 373.212 451.108 384.116]
+/A << /S /GoTo /D (page.489) >>
+>> endobj
+17645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.995 361.975 428.932 372.161]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+17646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.603 350.019 429.539 360.206]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+17647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.302 337.347 424.239 348.251]
+/A << /S /GoTo /D (page.494) >>
+>> endobj
+17648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 326.109 387.726 336.296]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+17649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.597 314.154 380.533 324.34]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+17650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.393 301.481 469.33 312.385]
+/A << /S /GoTo /D (page.497) >>
+>> endobj
+17651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.269 289.526 473.205 300.43]
+/A << /S /GoTo /D (page.497) >>
+>> endobj
+17652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.428 277.571 473.365 288.475]
+/A << /S /GoTo /D (page.491) >>
+>> endobj
+17653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.353 277.571 493.29 288.475]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+17654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.617 265.616 449.554 276.52]
+/A << /S /GoTo /D (page.495) >>
+>> endobj
+17655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.92 253.661 440.856 264.565]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+17656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.073 241.706 387.009 252.609]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+17657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.056 229.75 449.992 240.654]
+/A << /S /GoTo /D (page.488) >>
+>> endobj
+17658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.778 217.795 462.714 228.699]
+/A << /S /GoTo /D (page.488) >>
+>> endobj
+17659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.703 217.795 482.639 228.699]
+/A << /S /GoTo /D (page.489) >>
+>> endobj
+17660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 195.942 362.272 204.789]
+/A << /S /GoTo /D (page.485) >>
+>> endobj
+17661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.497 181.93 436.433 192.834]
+/A << /S /GoTo /D (page.492) >>
+>> endobj
+17662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.444 170.692 389.38 180.878]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+17663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.764 158.019 423.701 168.923]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.264 146.064 413.2 156.968]
+/A << /S /GoTo /D (page.477) >>
+>> endobj
+17665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.431 134.109 504.367 145.013]
+/A << /S /GoTo /D (page.492) >>
+>> endobj
+17666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.054 122.154 484.99 133.058]
+/A << /S /GoTo /D (page.493) >>
+>> endobj
+17667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.497 110.199 380.434 121.103]
+/A << /S /GoTo /D (page.496) >>
+>> endobj
+17668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.026 98.244 441.962 109.147]
+/A << /S /GoTo /D (page.495) >>
+>> endobj
+17669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.684 87.006 386.62 97.192]
+/A << /S /GoTo /D (page.478) >>
+>> endobj
+17670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.03 75.05 384.966 85.237]
+/A << /S /GoTo /D (page.479) >>
+>> endobj
+17672 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17676 0 obj <<
+/D [17674 0 R /XYZ 89 770.89 null]
+>> endobj
+17673 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17756 0 obj <<
+/Length 1732      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~����L�����!�$�K7nv�v&�hX#۴������
���1�}���|�~t���^��.^�T���u���4k�a#�ᗫ}
���z�����[��Œ�s�
F����������F��2-m�>Ś
��0�����|��)|/�����
��
 õ�4�DH��û'9ςY<_s��z�}
�


�d�c
�ی�H�N�٢�W at vˏRDlVJ��i�dCȱ^�Ŷ���

q��z��+��d#†߳ Eq���N*��
��Y��
�zkO���p��Hg�e0��Io
��7B�	/V��y�M��B�q�J�dn#�X~�X��E�
R�dw �]���4	�N��ej\�t!�a0�W�r[���&}��#t3U�vZ��np�d���a'�����Yz���,�N�A΢���Z�N$��7_�X$���z�
`Ԫ�uaҙz��$�-�٣X%^0�L�ʌ�Cz����)���2�HrbMH�G������xB���E��*�D���
*BOLcRT�=
O2s:��2�:�w;����$̒佌��}�
�5"�uE s�i��%����b�di6��X��iXGA��>i�i��U^Z��}
�V]?w���Q�})�ޡ0l(t(����^��QA��F�+j��̫P�ڴ��@Y�C��U�Օ��f��^P�R׹~��x 1LD�-x�`�S�\qUC�F�2�?א0� zw��d�V���QN�ۏӥo�h���]��nN$Ť�3Y}�Xf���
+��l�j|�S��bŚ�nY��%�IJ��>�+�d�#���r
A�~.'9ԉi#C��IM��L�O6�!�j�Z5��� ��%9h��(�U��9q��L�^�:�:ҹ�E'+_�Z����NB���ˇ��'MAVt����F�O5���,¥+~Y���S�kM^��6�m��vD�ڵ4�!� ��}=�\Um@�`.��(�N��-[
@p���)�/�!Rk�9'�"����I,d�iZ�Y�`��}'
k8�-�:X���Ъ2�Pg	�
��o#B����\aW�ӭt��e w ��ݭl�;Ҭ~�{qd@%� 
׍N;�Z�A6�� �͞GwE;����"*rZ�_���2]9Vj�8�$�F#��V�m�ؑT��vV�%�F������^���T��I��o�
b���vS��p�U\�'��%�r�N�Є���k邮���hT2k�ڼ2�
o�`�
�
�*=
����f|,n
�T��#��d�֏�l� ^�@�gЙ�b�z&���6t��R�b�,y�3���:����ϟ��Oԉ�3�$z)\&z"SQ?"�Zu�� �;%�0\��_z���r��
+ٱ���eԃڛ���?B
#�2�'d����(S�
6��m�
�άw��6��c�7Qlr�ס+[dP�
+H$�r�?��$@�:�ַ�+cJA��x�i�T	���֩�<�έ:Vszj5�}����M T��:T�]F:�Sƹ�[@%<�CfeT���
�
DM9��0h<����9���moijAS*�Q����9)�#S�����Qlḱ>������8j!�q�d����ӈ�aR���	Vβ���^���rD���
A�1%xxS�A9��V^��΍�
8��Ȱ6��E�F�w�y"�9����R�����I�
v�9 ?��ByAvd#?e��Sg�.&�s��(�� #LLS�W�^�7��\��v������Q��
+endstream
+endobj
+17755 0 obj <<
+/Type /Page
+/Contents 17756 0 R
+/Resources 17754 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17332 0 R
+/Annots [ 17671 0 R 17678 0 R 17679 0 R 17680 0 R 17681 0 R 17682 0 R 17683 0 R 17684 0 R 17685 0 R 17686 0 R 17687 0 R 17688 0 R 17689 0 R 17690 0 R 17691 0 R 17692 0 R 17693 0 R 17694 0 R 17695 0 R 17696 0 R 17697 0 R 17698 0 R 17699 0 R 17700 0 R 17701 0 R 17702 0 R 17703 0 R 17704 0 R 17705 0 R 17706 0 R 17707 0 R 17708 0 R 17709 0 R 17710 0 R 17711 0 R 17712 0 R 17713 0 R 17714 0 R 17715 0 R 17716 0 R 17717 0 R 17718 0 R 17719 0 R 17720 0 R 17721 0 R 17722 0 R 17723 0 R 17724 0 R 17 [...]
+>> endobj
+17671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.296 708.674 145.233 718.861]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+17678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 696.002 179.539 706.906]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+17679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.343 684.047 175.28 694.951]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+17680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.132 672.092 250.069 682.996]
+/A << /S /GoTo /D (page.497) >>
+>> endobj
+17681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.622 660.136 223.558 671.04]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.994 648.181 198.931 659.085]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.848 636.226 181.766 647.13]
+/A << /S /GoTo /D (page.475d) >>
+>> endobj
+17684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.356 624.271 262.292 635.175]
+/A << /S /GoTo /D (page.485) >>
+>> endobj
+17685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.189 612.316 227.125 623.22]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.064 600.361 231 611.265]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.563 589.123 220.5 599.309]
+/A << /S /GoTo /D (page.483) >>
+>> endobj
+17688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.438 577.168 224.375 587.354]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.135 564.495 273.072 575.399]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.04 553.257 183.977 563.444]
+/A << /S /GoTo /D (page.477) >>
+>> endobj
+17691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.404 540.585 268.34 551.489]
+/A << /S /GoTo /D (page.495) >>
+>> endobj
+17692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 528.63 237.904 539.534]
+/A << /S /GoTo /D (page.494) >>
+>> endobj
+17693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 516.674 254.681 527.578]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.772 504.719 196.709 515.623]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+17695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 492.764 151.22 503.668]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+17696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.389 480.809 208.325 491.713]
+/A << /S /GoTo /D (page.490) >>
+>> endobj
+17697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.396 469.571 177.332 479.758]
+/A << /S /GoTo /D (page.485) >>
+>> endobj
+17698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 456.899 180.65 467.803]
+/A << /S /GoTo /D (page.490) >>
+>> endobj
+17699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 423.09 145.791 431.937]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.682 409.795 159.618 419.982]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.803 397.123 188.739 408.027]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 385.168 179.539 396.071]
+/A << /S /GoTo /D (page.504) >>
+>> endobj
+17703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.669 373.212 221.605 384.116]
+/A << /S /GoTo /D (page.504) >>
+>> endobj
+17704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.087 361.257 169.023 372.161]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.371 349.302 213.307 360.206]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.292 337.347 250.228 348.251]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.013 325.392 285.949 336.296]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+17708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.02 313.437 279.956 324.34]
+/A << /S /GoTo /D (page.504) >>
+>> endobj
+17709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.878 289.526 192.814 300.43]
+/A << /S /GoTo /D (page.505) >>
+>> endobj
+17710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.405 266.333 190.341 276.52]
+/A << /S /GoTo /D (page.505) >>
+>> endobj
+17711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.878 241.706 192.814 252.609]
+/A << /S /GoTo /D (page.506) >>
+>> endobj
+17712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.249 218.512 173.186 228.699]
+/A << /S /GoTo /D (page.506) >>
+>> endobj
+17713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.211 194.602 165.148 204.789]
+/A << /S /GoTo /D (page.509) >>
+>> endobj
+17714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.584 170.692 158.521 180.878]
+/A << /S /GoTo /D (page.509) >>
+>> endobj
+17715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.877 158.019 264.813 168.923]
+/A << /S /GoTo /D (page.510) >>
+>> endobj
+17716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.352 146.064 287.289 156.968]
+/A << /S /GoTo /D (page.511) >>
+>> endobj
+17717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.101 122.154 186.037 133.058]
+/A << /S /GoTo /D (page.511) >>
+>> endobj
+17718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.262 110.199 255.199 121.103]
+/A << /S /GoTo /D (page.511) >>
+>> endobj
+17719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 98.961 145.79 109.147]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.603 86.288 179.539 97.192]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.532 74.333 199.469 85.237]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.765 707.957 367.702 718.861]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.587 696.441 380.523 706.628]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.805 683.491 513.742 694.395]
+/A << /S /GoTo /D (page.169) >>
+>> endobj
+17725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.692 647.786 381.629 657.973]
+/A << /S /GoTo /D (page.515) >>
+>> endobj
+17726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.332 634.836 493.269 645.74]
+/A << /S /GoTo /D (page.516) >>
+>> endobj
+17727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.084 622.603 396.021 633.507]
+/A << /S /GoTo /D (page.518) >>
+>> endobj
+17728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.175 611.087 402.112 621.273]
+/A << /S /GoTo /D (page.517) >>
+>> endobj
+17729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [461.698 598.136 478.634 609.04]
+/A << /S /GoTo /D (page.518) >>
+>> endobj
+17730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 562.432 408.21 572.619]
+/A << /S /GoTo /D (page.396d) >>
+>> endobj
+17731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 527.231 362.272 536.197]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 513.06 498.241 523.964]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 490.929 362.272 499.776]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.826 464.405 497.763 475.309]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.273 464.405 517.21 475.309]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 454.507 362.272 463.354]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 418.086 367.253 426.933]
+/A << /S /GoTo /D (page.444d) >>
+>> endobj
+17738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 391.562 504.348 402.466]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 367.096 504.348 378]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [498.56 342.629 515.496 353.533]
+/A << /S /GoTo /D (page.162) >>
+>> endobj
+17741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.946 330.396 529.882 341.3]
+/A << /S /GoTo /D (page.355) >>
+>> endobj
+17742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 305.93 509.329 316.834]
+/A << /S /GoTo /D (page.475d) >>
+>> endobj
+17743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.836 281.463 521.772 292.367]
+/A << /S /GoTo /D (page.436) >>
+>> endobj
+17744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 256.997 511.551 267.901]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.836 232.531 521.772 243.435]
+/A << /S /GoTo /D (page.437) >>
+>> endobj
+17746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 198.047 362.272 207.013]
+/A << /S /GoTo /D (page.193) >>
+>> endobj
+17747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 174.078 362.272 182.825]
+/A << /S /GoTo /D (page.224) >>
+>> endobj
+17748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [499.107 159.688 516.044 170.591]
+/A << /S /GoTo /D (page.356) >>
+>> endobj
+17749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.273 136.216 408.209 146.403]
+/A << /S /GoTo /D (page.505) >>
+>> endobj
+17750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [513.503 123.266 530.44 134.17]
+/A << /S /GoTo /D (page.506) >>
+>> endobj
+17751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 98.8 475.018 109.704]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 74.333 475.018 85.237]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17753 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17757 0 obj <<
+/D [17755 0 R /XYZ 89 770.89 null]
+>> endobj
+17754 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17837 0 obj <<
+/Length 1175      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�8~�W�ma�8�e�vޚ@�XBf�I;�Y��l���+_h������>0غ
}::�9G��dI at jU.���+
I�l�H�{� ��2&�m,�V1�k߇�$d � P�
+���F�KPQi+��
H0�eM�F���w �E�'	��Хǰ�LR$���u��
+XB@�2�р��_C
P�P�TU�Q]�q��3����r��ܤ
���|y~�b���?C�Nnŀ��t[W0��_� B$��2Ԡw�m�F��N4�>�B�
ӱ�Ţ���3~_��j�X
+
���Ci���A�t`6���
i��l4o��pо
�A��q�5��\=�
8�H�A���I��}`
�X,�bD�mY"Ӂ"�7a�VS{��=B�ds�LG��c��8���v�����|�1jz�m9e+�skD˲�� ��hh ObN��ms��tB��bi�y��ϩ�&��w��͑O=��-� �^�31�il�J�4@��F�i��@�:�X3�jU�:)Ru�G�
���#�q��A mBG�c���^Vc���+t�>��W��ŷ�=N��z4[�
+h*�
<�tIl��q�yeޛ��+��i��^��d�
y�u�)?
+B0?[��ūX)"3��<LO�+�Ih�}����d*�I8'��2��&I����Ix��$\($%��l"c�k��L�
b�d����P�z5&�׉����!�df���=r f�=�����bR���ɤ�,���3��f
sj�˝y��Iu���z���ۮC���;w��o�v���b<�
���T/���ъ�Sqg��L4-SX���t�2�]�_L���B�c�PQ��4����W�n����Q'�WA��Ϊ���m���y�v�S����@^�tۚ0N��p0tlϘ(��K���\r�e
/�ڕ˝0���H��}����*�O�����M[�`�Id�K��]�ȧY?
"P�3ın�`�Pa����%��
�
����n�"k
+�z�f�����o�<T�
��)a��sX����gHj�Bس���W��ң�!jp�,���4T�p�A��N�p�1�G
��6
�q���
V�
+�=E�P���tQ�Z
�]�5c��"l����Wp�	�cҀ��du�i���󳳻��1ǒG�lC��	�
4}�W�s#@��q�d;��7�
+�����j�
+endstream
+endobj
+17836 0 obj <<
+/Type /Page
+/Contents 17837 0 R
+/Resources 17835 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17332 0 R
+/Annots [ 17760 0 R 17761 0 R 17762 0 R 17763 0 R 17764 0 R 17765 0 R 17766 0 R 17767 0 R 17768 0 R 17769 0 R 17770 0 R 17771 0 R 17772 0 R 17773 0 R 17774 0 R 17775 0 R 17776 0 R 17777 0 R 17778 0 R 17779 0 R 17780 0 R 17781 0 R 17782 0 R 17783 0 R 17784 0 R 17785 0 R 17786 0 R 17787 0 R 17788 0 R 17789 0 R 17790 0 R 17791 0 R 17792 0 R 17793 0 R 17794 0 R 17795 0 R 17796 0 R 17797 0 R 17798 0 R 17799 0 R 17800 0 R 17801 0 R 17802 0 R 17803 0 R 17804 0 R 17805 0 R 17806 0 R 17807 0 R 17 [...]
+>> endobj
+17760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.823 696.002 281.759 706.906]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+17761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 672.092 223.309 682.996]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 648.181 223.309 659.085]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 624.271 223.309 635.175]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 600.361 223.309 611.265]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 576.45 223.309 587.354]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.627 552.54 296.564 563.444]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.345 528.63 281.281 539.534]
+/A << /S /GoTo /D (page.251) >>
+>> endobj
+17768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.792 528.63 300.728 539.534]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 518.732 145.791 527.578]
+/A << /S /GoTo /D (page.256) >>
+>> endobj
+17770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.345 492.764 286.263 503.668]
+/A << /S /GoTo /D (page.253d) >>
+>> endobj
+17771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.773 492.764 305.71 503.668]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.727 468.854 272.664 479.758]
+/A << /S /GoTo /D (page.318) >>
+>> endobj
+17773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 444.943 285.097 455.847]
+/A << /S /GoTo /D (page.126) >>
+>> endobj
+17774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 432.988 311.727 443.892]
+/A << /S /GoTo /D (page.386) >>
+>> endobj
+17775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 421.033 287.867 431.937]
+/A << /S /GoTo /D (page.485) >>
+>> endobj
+17776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.727 397.123 272.664 408.027]
+/A << /S /GoTo /D (page.318) >>
+>> endobj
+17777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 373.212 285.097 384.116]
+/A << /S /GoTo /D (page.112) >>
+>> endobj
+17778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 361.257 258.537 372.161]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 349.302 260.191 360.206]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 337.347 311.727 348.251]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 314.154 186.747 324.34]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+17782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 291.584 145.791 300.43]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+17783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 277.571 287.867 288.475]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 253.661 285.097 264.565]
+/A << /S /GoTo /D (page.113) >>
+>> endobj
+17785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 241.706 258.537 252.609]
+/A << /S /GoTo /D (page.144) >>
+>> endobj
+17786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 229.75 260.191 240.654]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 217.795 311.727 228.699]
+/A << /S /GoTo /D (page.373) >>
+>> endobj
+17788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 194.602 186.747 204.789]
+/A << /S /GoTo /D (page.404) >>
+>> endobj
+17789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 172.032 145.791 180.878]
+/A << /S /GoTo /D (page.452) >>
+>> endobj
+17790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 158.019 287.867 168.923]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 134.109 285.097 145.013]
+/A << /S /GoTo /D (page.112) >>
+>> endobj
+17792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 122.154 258.537 133.058]
+/A << /S /GoTo /D (page.143) >>
+>> endobj
+17793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 110.199 260.191 121.103]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 98.244 311.727 109.147]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 75.05 186.747 85.237]
+/A << /S /GoTo /D (page.403) >>
+>> endobj
+17796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 362.272 706.906]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 684.047 504.348 694.951]
+/A << /S /GoTo /D (page.483) >>
+>> endobj
+17798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 660.136 501.578 671.04]
+/A << /S /GoTo /D (page.113) >>
+>> endobj
+17799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 648.181 475.018 659.085]
+/A << /S /GoTo /D (page.143) >>
+>> endobj
+17800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 636.226 476.672 647.13]
+/A << /S /GoTo /D (page.284) >>
+>> endobj
+17801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 624.271 528.208 635.175]
+/A << /S /GoTo /D (page.372) >>
+>> endobj
+17802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 601.078 403.228 611.265]
+/A << /S /GoTo /D (page.405) >>
+>> endobj
+17803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 578.508 362.272 587.354]
+/A << /S /GoTo /D (page.451) >>
+>> endobj
+17804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 564.495 504.348 575.399]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 540.585 501.578 551.489]
+/A << /S /GoTo /D (page.113) >>
+>> endobj
+17806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 528.63 528.208 539.534]
+/A << /S /GoTo /D (page.373) >>
+>> endobj
+17807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 516.674 504.348 527.578]
+/A << /S /GoTo /D (page.484) >>
+>> endobj
+17808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 492.764 439.79 503.668]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 468.854 501.578 479.758]
+/A << /S /GoTo /D (page.110) >>
+>> endobj
+17810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 456.899 475.018 467.803]
+/A << /S /GoTo /D (page.138) >>
+>> endobj
+17811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 444.943 528.208 455.847]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+17812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 423.09 362.272 431.937]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+17813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 409.078 504.348 419.982]
+/A << /S /GoTo /D (page.477) >>
+>> endobj
+17814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 375.27 362.272 384.116]
+/A << /S /GoTo /D (page.240) >>
+>> endobj
+17815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.897 361.257 510.834 372.161]
+/A << /S /GoTo /D (page.338) >>
+>> endobj
+17816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 337.347 513.045 348.251]
+/A << /S /GoTo /D (page.264) >>
+>> endobj
+17817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 313.437 501.578 324.34]
+/A << /S /GoTo /D (page.125) >>
+>> endobj
+17818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 301.481 475.018 312.385]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+17819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 289.526 476.672 300.43]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+17820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 277.571 528.208 288.475]
+/A << /S /GoTo /D (page.384) >>
+>> endobj
+17821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 254.378 403.228 264.565]
+/A << /S /GoTo /D (page.412) >>
+>> endobj
+17822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 231.808 362.272 240.654]
+/A << /S /GoTo /D (page.460) >>
+>> endobj
+17823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 217.795 504.348 228.699]
+/A << /S /GoTo /D (page.495) >>
+>> endobj
+17824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 193.885 501.578 204.789]
+/A << /S /GoTo /D (page.125) >>
+>> endobj
+17825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 181.93 475.018 192.834]
+/A << /S /GoTo /D (page.153) >>
+>> endobj
+17826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 169.975 499.924 180.878]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 158.019 498.241 168.923]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 146.064 476.672 156.968]
+/A << /S /GoTo /D (page.294) >>
+>> endobj
+17829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 134.109 521.005 145.013]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 112.256 362.272 121.103]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 98.244 528.208 109.147]
+/A << /S /GoTo /D (page.383) >>
+>> endobj
+17832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 75.05 403.228 85.237]
+/A << /S /GoTo /D (page.412) >>
+>> endobj
+17834 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17838 0 obj <<
+/D [17836 0 R /XYZ 89 770.89 null]
+>> endobj
+17835 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17903 0 obj <<
+/Length 1353      
+/Filter /FlateDecode
+>>
+stream
+x��]s�6���+�+�m	�Ng6�7㭓���N:�

�2���������ص��8�}�+c��{�t�@�W�r�9�tN�Y�� ��Le2S
�X����M��j��w��2y�������
q�ӛt
:���
+*����o���*S~������׼�\14���ʸ�WAL�� ?ְb!*�
vV]6w�0��t�\2�˖gg�8�҄��ZW��W����s���%�誣 ѻ����
���
��
(~u���� �Sq��ȟO4
U�1�������	�R7
�(7öfo�t�^n�g�O��(�l�EPu=��ca	
ΒƌE��aqM���F�
G��'���Ue�� ��$�!�g��W1�
V`x�R��]Ly��&��9��$&Ӏ
	��c�)bIt$8�EvD�
+��G�c���T��&"���U�(NID�N�D&��C�#��0%)
�cZ�s�lqp�Q�_��W���30�
�t�q��wI4r��z8�]�n&��$����D��O�8<���h�;x�>���ҿ�}��vP'Lm=sG|v���j�Ґ�8�熔�1b"�>I�ځ]�`J�hD��K�:8��:����<� ��U:_�s1��`��
��"�)��x1�R�j��[Q�K�d��u�ihU��Ώ����� '�'رʒ��tuck@�]��떡-`}o�`@
�
��� K7Sׁ��f<�D�J�ݨ��e�J���kj�j4Q�ou�]�^µ�p+��̔ ;��TBX���<�r7�ռ$k�W^�Ve��y<��,ig1�J�,��&}lC�'���/�+�9%�e��nUI�v��!��.��&�2dmXm��Y��~�!�,x��soN�����
74��F!�%O�����x�ʨvg
+�pP��1�V01��d��Rj����)9�C���S>��2� ���H�I�p
��²k]���;��h�jI�G���a�=�5i_5P���
+�0�-I�����<!LO)q!U;��/���]4ʃ��3L"�1����iV�{��7��#��8�����"b�Z{<R��mx�m[]�(��o�lS&��a��N^�r���
9�"�l��K¹���] 1̤�c�QJn�i�o�%#�K$��wB�j�r��X$U�>�����!闫�O���biڴD:z����2<<YJ^7�@g�v���
+�,M��\��L��i���0o��O��
=Q����~�b�&��k7�ܰ8�bX���W�ē �_C�{�#��)-�� �[��~�o�
dA`ظ��O�����]�'4���D�|@˩��Ee4/y� ��dJ�������CLS���>t �Ȳ����q~���<qڟ��e�E��Uȿ�A�
+endstream
+endobj
+17902 0 obj <<
+/Type /Page
+/Contents 17903 0 R
+/Resources 17901 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17905 0 R
+/Annots [ 17833 0 R 17839 0 R 17840 0 R 17841 0 R 17842 0 R 17843 0 R 17844 0 R 17845 0 R 17846 0 R 17847 0 R 17848 0 R 17849 0 R 17850 0 R 17851 0 R 17852 0 R 17853 0 R 17854 0 R 17855 0 R 17856 0 R 17857 0 R 17858 0 R 17859 0 R 17860 0 R 17861 0 R 17862 0 R 17863 0 R 17864 0 R 17865 0 R 17866 0 R 17867 0 R 17868 0 R 17869 0 R 17870 0 R 17871 0 R 17872 0 R 17873 0 R 17874 0 R 17875 0 R 17876 0 R 17877 0 R 17878 0 R 17879 0 R 17880 0 R 17881 0 R 17882 0 R 17883 0 R 17884 0 R 17885 0 R 17 [...]
+>> endobj
+17833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 697.94 145.791 706.906]
+/A << /S /GoTo /D (page.459) >>
+>> endobj
+17839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 684.017 287.867 694.921]
+/A << /S /GoTo /D (page.494) >>
+>> endobj
+17840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 660.047 223.309 670.951]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+17841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.454 636.077 231.409 646.981]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+17842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 612.107 223.309 623.01]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.454 588.136 231.409 599.04]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+17844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.454 564.166 231.409 575.07]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+17845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 540.196 223.309 551.1]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 516.226 223.309 527.13]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 492.256 223.309 503.16]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 468.286 223.309 479.19]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 444.316 223.309 455.22]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 420.346 223.309 431.25]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 396.376 223.309 407.279]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 372.405 223.309 383.309]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 348.435 223.309 359.339]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 324.465 223.309 335.369]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 300.495 223.309 311.399]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 276.525 223.309 287.429]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 252.555 223.309 263.459]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 228.585 223.309 239.489]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 194.154 223.309 205.058]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+17860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 170.184 223.309 181.088]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+17861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 146.214 223.309 157.118]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+17862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.506 122.244 283.443 133.147]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+17863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 98.273 304.524 109.177]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.733 74.333 185.669 85.237]
+/A << /S /GoTo /D (page.504) >>
+>> endobj
+17865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.748 696.002 494.684 706.906]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 672.092 521.005 682.996]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 648.181 475.018 659.085]
+/A << /S /GoTo /D (page.155) >>
+>> endobj
+17868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 624.271 447.89 635.175]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+17869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 600.361 506.55 611.265]
+/A << /S /GoTo /D (page.184) >>
+>> endobj
+17870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.454 576.45 514.39 587.354]
+/A << /S /GoTo /D (page.345) >>
+>> endobj
+17871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 552.54 447.89 563.444]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+17872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 528.63 506.55 539.534]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 506.657 362.272 515.623]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 492.764 499.924 503.668]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 480.809 498.241 491.713]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 468.854 521.005 479.758]
+/A << /S /GoTo /D (page.304) >>
+>> endobj
+17877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 444.943 506.55 455.847]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 432.988 499.924 443.892]
+/A << /S /GoTo /D (page.215) >>
+>> endobj
+17879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 421.033 498.241 431.937]
+/A << /S /GoTo /D (page.252) >>
+>> endobj
+17880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 409.078 521.005 419.982]
+/A << /S /GoTo /D (page.305) >>
+>> endobj
+17881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 387.225 362.272 396.071]
+/A << /S /GoTo /D (page.330) >>
+>> endobj
+17882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.613 361.257 506.55 372.161]
+/A << /S /GoTo /D (page.185) >>
+>> endobj
+17883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 339.404 362.272 348.251]
+/A << /S /GoTo /D (page.331) >>
+>> endobj
+17884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 313.437 501.578 324.34]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+17885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 301.481 475.018 312.385]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+17886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 289.526 476.672 300.43]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.208 277.571 489.145 288.475]
+/A << /S /GoTo /D (page.318) >>
+>> endobj
+17888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 265.616 528.208 276.52]
+/A << /S /GoTo /D (page.376) >>
+>> endobj
+17889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 243.763 362.272 252.609]
+/A << /S /GoTo /D (page.454) >>
+>> endobj
+17890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 229.75 504.348 240.654]
+/A << /S /GoTo /D (page.486) >>
+>> endobj
+17891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 205.84 511.551 216.744]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.454 181.93 514.39 192.834]
+/A << /S /GoTo /D (page.346) >>
+>> endobj
+17893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.614 169.975 511.551 180.878]
+/A << /S /GoTo /D (page.429) >>
+>> endobj
+17894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.836 158.019 521.772 168.923]
+/A << /S /GoTo /D (page.437) >>
+>> endobj
+17895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.669 134.109 491.606 145.013]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.109 110.199 513.045 121.103]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.093 98.961 334.048 109.147]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+17898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 74.333 501.578 85.237]
+/A << /S /GoTo /D (page.109) >>
+>> endobj
+17900 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17904 0 obj <<
+/D [17902 0 R /XYZ 89 770.89 null]
+>> endobj
+17901 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F11 621 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17982 0 obj <<
+/Length 1330      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�8~�W�ma�(�X��[Sh�nB�@:;�v<
+(ijƦ�n���+_h�[��dg�_d�����9���6ѠvU�
�.>D���0ӆ��5C� e�j��ש߇_4bA`A$�Jow{��_IC�3���%�����)0Lm4����X���A@,S{N�j:&��i�ڟ5�
��% �sL5!�P��n Z��;v�>�qȝk�!��k�u���"ʠ��
S����71�u����̩�iJ떥`�*t��Y���(���3x�3���uŒ�Tx�#�{ޫ��x$���#��r�٢4���a �
+:�C�
+��lL�;p�h."�����,By���6�:��0(���
+����[}ѕ��#ih�������7��:/���0�H����Aʻ?�
��+ �"N�e����Cֶτ��P!0)��9�=�K�Ы����H����h�2Zz�^���%�����^���B�s�:��0�d2�����7��L��r��HL՘Ϋ��f)�_�j.SUA'12�#�
+-9��h�c|` bL���+ዐGAXD
%�I���/T�xd�2+
+:�b�d���<��#{k^�F�Ѷ
+�̈'U�P5��s{e�[�]NO�5J2��F���
�+b��ډ�|��|�<����V��8+Hi�f� �

+��h�>Ja�
B<��z������QE�[Fee�*j-�4�_!��r�z�����1�$w'���>�d ;��Az3�T2�g���C#5}��I�'"�J�_����B�lł~
$�W'DŽv���'�d�4��m4��r��
��E�I�e�x��L�p�������׏F
�&�!�a�X�cK�0@&=��a�wU��A�-q��S~e`��q��5�:�r�s=e�װa���L���v��T{H/J�7qB+���z�
+S`y&��]���ڝ������u�f�hz�����]�s��+��WX�>X�x�����N�9)?D	Ƞ{��O
+DW ��Ũ߉�(5��Y��jɢ��z�j���j
�g
�}����>���gS%�ij1��3�8��F\�P��t�{)�
�o�՛@�d���8Wf���C�™�� ��S�s�-v���N�����}y�UO 
+�'_I��T�:�/��Gщ�����̇3��⸾ńa``���d�E� �J����A �a�q�<m\��߸�N����7sMi��fp���cz���Q�[x�4�+?�ڶ�����kPZ�g�7܏�����L���%�;
x�f�0e�&��| DN[���_��Hv��eL�,#�.��(��..
��\�0
+�+��uȲ 4�Ż�A��a�)�Lv:$���_�Y�
+endstream
+endobj
+17981 0 obj <<
+/Type /Page
+/Contents 17982 0 R
+/Resources 17980 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17905 0 R
+/Annots [ 17899 0 R 17906 0 R 17907 0 R 17908 0 R 17909 0 R 17910 0 R 17911 0 R 17912 0 R 17913 0 R 17914 0 R 17915 0 R 17916 0 R 17917 0 R 17918 0 R 17919 0 R 17920 0 R 17921 0 R 17922 0 R 17923 0 R 17924 0 R 17925 0 R 17926 0 R 17927 0 R 17928 0 R 17929 0 R 17930 0 R 17931 0 R 17932 0 R 17933 0 R 17934 0 R 17935 0 R 17936 0 R 17937 0 R 17938 0 R 17939 0 R 17940 0 R 17941 0 R 17942 0 R 17943 0 R 17944 0 R 17945 0 R 17946 0 R 17947 0 R 17948 0 R 17949 0 R 17950 0 R 17951 0 R 17952 0 R 17 [...]
+>> endobj
+17899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 707.957 258.537 718.861]
+/A << /S /GoTo /D (page.141) >>
+>> endobj
+17906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 695.967 260.191 706.871]
+/A << /S /GoTo /D (page.281) >>
+>> endobj
+17907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.79 683.976 311.727 694.88]
+/A << /S /GoTo /D (page.367) >>
+>> endobj
+17908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [169.81 660.748 186.747 670.935]
+/A << /S /GoTo /D (page.402) >>
+>> endobj
+17909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 638.143 145.791 646.989]
+/A << /S /GoTo /D (page.450) >>
+>> endobj
+17910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 624.095 287.867 634.999]
+/A << /S /GoTo /D (page.480) >>
+>> endobj
+17911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.132 600.114 290.068 611.018]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 566.236 145.791 575.083]
+/A << /S /GoTo /D (page.172) >>
+>> endobj
+17913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.627 540.198 296.564 551.102]
+/A << /S /GoTo /D (page.265) >>
+>> endobj
+17914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 516.97 145.791 527.156]
+/A << /S /GoTo /D (page.333) >>
+>> endobj
+17915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 516.97 165.716 527.156]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.654 492.272 289.59 503.176]
+/A << /S /GoTo /D (page.186) >>
+>> endobj
+17917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.101 492.272 309.037 503.176]
+/A << /S /GoTo /D (page.187) >>
+>> endobj
+17918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 470.264 145.791 479.23]
+/A << /S /GoTo /D (page.192) >>
+>> endobj
+17919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.028 456.336 282.965 467.24]
+/A << /S /GoTo /D (page.218) >>
+>> endobj
+17920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.475 456.336 302.412 467.24]
+/A << /S /GoTo /D (page.219) >>
+>> endobj
+17921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 433.108 145.791 443.294]
+/A << /S /GoTo /D (page.222) >>
+>> endobj
+17922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 433.108 165.716 443.294]
+/A << /S /GoTo /D (page.223) >>
+>> endobj
+17923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.345 420.4 281.281 431.304]
+/A << /S /GoTo /D (page.253) >>
+>> endobj
+17924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.792 420.4 300.728 431.304]
+/A << /S /GoTo /D (page.257) >>
+>> endobj
+17925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 398.512 145.791 407.359]
+/A << /S /GoTo /D (page.261) >>
+>> endobj
+17926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.254 384.464 260.191 395.368]
+/A << /S /GoTo /D (page.296) >>
+>> endobj
+17927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.587 372.474 304.524 383.378]
+/A << /S /GoTo /D (page.306) >>
+>> endobj
+17928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 362.576 145.791 371.423]
+/A << /S /GoTo /D (page.307) >>
+>> endobj
+17929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 338.631 145.791 347.477]
+/A << /S /GoTo /D (page.311) >>
+>> endobj
+17930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 313.345 145.791 323.532]
+/A << /S /GoTo /D (page.334) >>
+>> endobj
+17931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.78 313.345 165.716 323.532]
+/A << /S /GoTo /D (page.335) >>
+>> endobj
+17932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.158 289.4 211.095 299.586]
+/A << /S /GoTo /D (page.204) >>
+>> endobj
+17933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.972 276.692 297.909 287.596]
+/A << /S /GoTo /D (page.347) >>
+>> endobj
+17934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.133 264.702 295.069 275.606]
+/A << /S /GoTo /D (page.430) >>
+>> endobj
+17935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.056 241.473 191.011 251.66]
+/A << /S /GoTo /D (page.97) >>
+>> endobj
+17936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.93 228.766 287.867 239.67]
+/A << /S /GoTo /D (page.498) >>
+>> endobj
+17937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.188 216.776 275.124 227.679]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+17938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 182.246 223.309 193.15]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+17939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 158.265 223.309 169.169]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+17940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 134.285 223.309 145.189]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+17941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 110.304 223.309 121.208]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+17942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.161 86.324 285.097 97.227]
+/A << /S /GoTo /D (page.120) >>
+>> endobj
+17943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.6 74.333 258.537 85.237]
+/A << /S /GoTo /D (page.149) >>
+>> endobj
+17944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 707.957 476.672 718.861]
+/A << /S /GoTo /D (page.290) >>
+>> endobj
+17945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 695.772 528.208 706.676]
+/A << /S /GoTo /D (page.379) >>
+>> endobj
+17946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 672.349 403.228 682.536]
+/A << /S /GoTo /D (page.410) >>
+>> endobj
+17947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 649.549 362.272 658.395]
+/A << /S /GoTo /D (page.457) >>
+>> endobj
+17948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 635.306 504.348 646.21]
+/A << /S /GoTo /D (page.490) >>
+>> endobj
+17949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.988 610.936 499.924 621.84]
+/A << /S /GoTo /D (page.214) >>
+>> endobj
+17950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.304 598.751 498.241 609.655]
+/A << /S /GoTo /D (page.250) >>
+>> endobj
+17951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.069 586.566 521.005 597.47]
+/A << /S /GoTo /D (page.303) >>
+>> endobj
+17952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 548.402 439.79 559.306]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 524.031 439.79 534.935]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+17954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 499.661 439.79 510.565]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+17955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 475.291 439.79 486.195]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 450.921 439.79 461.825]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+17957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 426.551 501.578 437.455]
+/A << /S /GoTo /D (page.115) >>
+>> endobj
+17958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 414.366 475.018 425.27]
+/A << /S /GoTo /D (page.145) >>
+>> endobj
+17959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 402.181 476.672 413.085]
+/A << /S /GoTo /D (page.285) >>
+>> endobj
+17960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 389.996 528.208 400.9]
+/A << /S /GoTo /D (page.374) >>
+>> endobj
+17961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 366.573 403.228 376.759]
+/A << /S /GoTo /D (page.405) >>
+>> endobj
+17962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.217 366.573 423.154 376.759]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17963 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 343.772 362.272 352.619]
+/A << /S /GoTo /D (page.453) >>
+>> endobj
+17964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 329.53 504.348 340.434]
+/A << /S /GoTo /D (page.485) >>
+>> endobj
+17965 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 295.262 362.272 304.109]
+/A << /S /GoTo /D (page.433) >>
+>> endobj
+17966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.836 268.835 521.772 279.739]
+/A << /S /GoTo /D (page.437) >>
+>> endobj
+17967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 244.464 501.578 255.368]
+/A << /S /GoTo /D (page.115) >>
+>> endobj
+17968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 232.279 475.018 243.183]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+17969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 220.094 476.672 230.998]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 207.909 528.208 218.813]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+17971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 184.486 403.228 194.673]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.748 171.584 494.684 182.488]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 147.214 501.578 158.118]
+/A << /S /GoTo /D (page.116) >>
+>> endobj
+17974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 135.029 475.018 145.933]
+/A << /S /GoTo /D (page.146) >>
+>> endobj
+17975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 122.844 476.672 133.748]
+/A << /S /GoTo /D (page.286) >>
+>> endobj
+17976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 110.659 528.208 121.562]
+/A << /S /GoTo /D (page.375) >>
+>> endobj
+17977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 87.236 403.228 97.422]
+/A << /S /GoTo /D (page.406) >>
+>> endobj
+17978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.748 74.333 494.684 85.237]
+/A << /S /GoTo /D (page.503) >>
+>> endobj
+17979 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [334.981 43.314 433.811 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+17983 0 obj <<
+/D [17981 0 R /XYZ 89 770.89 null]
+>> endobj
+17980 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+18041 0 obj <<
+/Length 1024      
+/Filter /FlateDecode
+>>
+stream
+x�͙Qw�8������٦	� ���z�A����t��P���
+����o�(Gj;����_��&71���r�.w~-��"޽��˒0a�f�mG3�?�o�G^�= 1a�m*���Ŝ�r�9�J!���1�{�t��~����!�
��i��%Ad��p7
�!� �@(37�W�:�M�Ƨ
bm̟�F
+�Y���g�
�
����~ia���];���{�����-�=���M[Y��g`��v&t�M�W�6�C!9�:��/-�D�i
i�ء�q�Z�
&KoҋLC�
n
�3t[0;�Pgl� �iB/����ZӬ��Fi��������#����X�_�q7U��۰���[R;��)ܖ�_R��kw[N����ڴ1.���hô1'�}���[��sc�L�as��1�0?k�z��9�e:M`��,��FDA��i���:��^\�(R�p;����`��y��pNj�
����?�=�w�?��(����S����i�.���
���T�v�o����4�{�|\��w�ŵ��e��]oRw�9ݻ!���-�S ���.J�0���~t�6&=}/���U�'I�gG���4
+��,�zi��@�U�H�G��j�jBTa��~��ۑ"*
^�Y )��
+�aT�.��P�O�!l7��Ʈ|$vf�2�O���pN=&�<<�m�2��©�"��i�-���g�S�[qĚ�	$!X�O��z�8��<x��hB<,P%�ϲ�����_x��i�ͣ�[�+��(+�Ŋ�O��խW�'?N~3�E��{o]��(,
Ѣ���&D�4f����Lj��0)�҇ϐśU" Y�ެ�7�=�"moT%`e�J��äe���8�㿺w����
�E��/���z�̹,d� �
z����Vx���c�����O�f���d�
���t�??�{�'~8�h�'Jq,
+���{��2���
+BV��R�
+�{�\K
 D��`�~� �H��M���Me���\[�� b"������h
+endstream
+endobj
+18040 0 obj <<
+/Type /Page
+/Contents 18041 0 R
+/Resources 18039 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 17905 0 R
+/Annots [ 17984 0 R 17985 0 R 17986 0 R 17987 0 R 17988 0 R 17989 0 R 17990 0 R 17991 0 R 17992 0 R 17993 0 R 17994 0 R 17995 0 R 17996 0 R 17997 0 R 17998 0 R 17999 0 R 18000 0 R 18001 0 R 18002 0 R 18003 0 R 18004 0 R 18005 0 R 18006 0 R 18007 0 R 18008 0 R 18009 0 R 18010 0 R 18011 0 R 18012 0 R 18013 0 R 18014 0 R 18015 0 R 18016 0 R 18017 0 R 18018 0 R 18019 0 R 18020 0 R 18021 0 R 18022 0 R 18023 0 R 18024 0 R 18025 0 R 18026 0 R 18027 0 R 18028 0 R 18029 0 R 18030 0 R 18031 0 R 18 [...]
+>> endobj
+17984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 696.002 223.309 706.906]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 672.092 223.309 682.996]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 648.181 223.309 659.085]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 624.271 223.309 635.175]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 600.361 223.309 611.265]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 576.45 223.309 587.354]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 552.54 223.309 563.444]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 528.63 223.309 539.534]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 504.719 223.309 515.623]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 480.809 223.309 491.713]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 456.899 223.309 467.803]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 432.988 223.309 443.892]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 409.078 223.309 419.982]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+17997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 385.168 223.309 396.071]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 361.257 223.309 372.161]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+17999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 337.347 223.309 348.251]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 313.437 223.309 324.34]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 289.526 223.309 300.43]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 265.616 223.309 276.52]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 241.706 223.309 252.609]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 217.795 223.309 228.699]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+18005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 193.885 223.309 204.789]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 169.975 223.309 180.878]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 146.064 223.309 156.968]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+18008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 122.154 223.309 133.058]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+18009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 98.244 223.309 109.147]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+18010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.354 74.333 223.309 85.237]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+18011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.835 696.002 439.79 706.906]
+/A << /S /GoTo /D (page.73) >>
+>> endobj
+18012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 672.092 447.89 682.996]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 648.181 447.89 659.085]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 624.271 447.89 635.175]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 600.361 447.89 611.265]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 576.45 447.89 587.354]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 552.54 447.89 563.444]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 528.63 447.89 539.534]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 504.719 447.89 515.623]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 480.809 447.89 491.713]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 456.899 447.89 467.803]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 432.988 447.89 443.892]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [435.935 409.078 447.89 419.982]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+18024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.669 385.168 491.606 396.071]
+/A << /S /GoTo /D (page.513) >>
+>> endobj
+18025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.64 350.019 427.576 360.206]
+/A << /S /GoTo /D (page.203) >>
+>> endobj
+18026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.44 325.392 451.377 336.296]
+/A << /S /GoTo /D (page.201) >>
+>> endobj
+18027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.649 302.199 507.585 312.385]
+/A << /S /GoTo /D (page.206) >>
+>> endobj
+18028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.258 277.571 513.194 288.475]
+/A << /S /GoTo /D (page.517) >>
+>> endobj
+18029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 243.698 476.672 254.602]
+/A << /S /GoTo /D (page.292) >>
+>> endobj
+18030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.292 220.505 403.228 230.692]
+/A << /S /GoTo /D (page.410) >>
+>> endobj
+18031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.642 195.877 501.578 206.781]
+/A << /S /GoTo /D (page.120) >>
+>> endobj
+18032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.082 183.922 475.018 194.826]
+/A << /S /GoTo /D (page.150) >>
+>> endobj
+18033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.735 171.967 476.672 182.871]
+/A << /S /GoTo /D (page.290) >>
+>> endobj
+18034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.272 160.012 528.208 170.916]
+/A << /S /GoTo /D (page.379) >>
+>> endobj
+18035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 138.159 362.272 147.005]
+/A << /S /GoTo /D (page.458) >>
+>> endobj
+18036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.411 124.146 504.348 135.05]
+/A << /S /GoTo /D (page.490) >>
+>> endobj
+18037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.248 100.236 508.203 111.14]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+18038 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [259.489 43.314 358.318 56.266]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+18042 0 obj <<
+/D [18040 0 R /XYZ 89 770.89 null]
+>> endobj
+18039 0 obj <<
+/Font << /F73 560 0 R /F60 540 0 R /F75 562 0 R >>
+/XObject << /Im3 555 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+17759 0 obj
+[530 0 R /Fit]
+endobj
+17758 0 obj
+[530 0 R /Fit]
+endobj
+17677 0 obj
+[530 0 R /Fit]
+endobj
+17224 0 obj
+[530 0 R /Fit]
+endobj
+16821 0 obj
+[530 0 R /Fit]
+endobj
+16820 0 obj
+[530 0 R /Fit]
+endobj
+16819 0 obj
+[530 0 R /Fit]
+endobj
+16740 0 obj
+[530 0 R /Fit]
+endobj
+16739 0 obj
+[530 0 R /Fit]
+endobj
+16662 0 obj
+[530 0 R /Fit]
+endobj
+16598 0 obj
+[530 0 R /Fit]
+endobj
+16381 0 obj
+[530 0 R /Fit]
+endobj
+16287 0 obj
+[530 0 R /Fit]
+endobj
+16191 0 obj
+[530 0 R /Fit]
+endobj
+9414 0 obj
+[530 0 R /Fit]
+endobj
+18043 0 obj
+[511.1 460 421.7 408.9]
+endobj
+18044 0 obj
+[398.6]
+endobj
+18045 0 obj
+[525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525]
+endobj
+18046 0 obj
+[611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 351.8 351.8 351.8 935.2 578.7 578.7 935.2 896.3 850.9 870.4 915.7 818.5 786.1 941.7 896.3 442.6 624.1 928.7 753.7 1090.7 896.3 935.2 818.5 935.2 883.3 675.9 870.4 896.3 896.3 1220.4 896.3 896.3 740.7 351.8 611.1 351.8 611.1 351.8 351.8 611.1 675.9 546.3 675.9 546.3 384.3 611.1 675.9 351.8 384.3 643.5 351.8 1000 675.9 611.1 675.9 643.5 481.5 488 481.5 675.9 643.5 870.4 643.5]
+endobj
+18047 0 obj
+[571 571 856.5 856.5 285.5 314 513.9 513.9 513.9 513.9 513.9 770.7 456.8 513.9 742.3 799.4 513.9 927.8 1042 799.4 285.5 285.5 513.9 856.5 513.9 856.5 799.4 285.5 399.7 399.7 513.9 799.4 285.5 342.6 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 285.5 799.4 485.3 485.3 799.4 770.7 727.9 742.3 785 699.4 670.8 806.5 770.7 371 528.1 799.2 642.3 942 770.7 799.4 699.4 799.4 756.5 571 742.3 770.7 770.7 1056.2 770.7 770.7 628.1 285.5 513.9 285.5 513.9 285.5 2 [...]
+endobj
+18048 0 obj
+[531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3 531.3]
+endobj
+18049 0 obj
+[416.4 450.6 513.2 481.1 363.8 592.2 599.5 619.2 506.9 450.6 588.2 529.4 587.7 452.4 556.3 611.7 640.8 670.5 639.4 477.1 609.5 852.5 529.4 374.4 671.1 1027.8 1027.8 1027.8 1027.8 285.5 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 799.4 513.9 799.4 513.9 543.7 770.7 777.7 733.6 847.5 756.3 656.2 804.8 850.1 449.3 566.3 870.4 699.4 992.9 821.6 782.1 656.2 810.6 777.6 627.8 599.6 699.1 599.4 970.5 849 596.5 699.2 399.7 399.7 399.7 1027.8 1027.8 4 [...]
+endobj
+18050 0 obj
+[285.5 799.4 513.9 799.4 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 513.9 513.9 799.4 799.4 799.4 799.4 799.4 799.4]
+endobj
+18051 0 obj
+[761.6 489.6 761.6]
+endobj
+18053 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410]
+endobj
+18054 0 obj
+[826.4 531.3 826.4]
+endobj
+18055 0 obj
+[500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 832 667 667 667 722 667 667 722 778 389 500 667 611 889 722 722 611 722 667 556 611 722 667 889 667 611 611 333 278 333 570 500 333 500 500 444 500 444 333 500 556 278 278 500 278 778 556 500 500 500 389 389 278 556 444 667 500 444]
+endobj
+18056 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+18057 0 obj
+[777.8 777.8 777.8 777.8 777.8 611.1 888.9 555.6 333.3 611.1 611.1 666.7 666.7 722.2 722.2 444.4 444.4 1000 777.8 666.7 666.7 611.1 611.1 777.8 777.8 777.8 777.8 777.8 777.8 500 694.4 777.8 777.8 777.8 777.8 777.8 777.8 666.7 666.7 666.7 666.7 777.8 777.8 777.8 777.8 444.4 444.4 402.8 402.8 388.9 388.9 777.8 777.8 777.8 777.8 777.8 777.8 555.6 555.6 555.6 555.6 0 0 0 0 0 1000 1000 1000 833.3 833.3 833.3 833.3 833.3 833.3 444.4 611.1 1111.1 1111.1 1111.1 1111.1 1111.1 1111.1 555.6 833.3 8 [...]
+endobj
+18058 0 obj
+[686.6]
+endobj
+18059 0 obj
+[1083.3 458.3 1083.3 736.1 1083.3 736.1 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1361.1 736.1 736.1 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1083.3 1361.1 1361.1 1083.3 1083.3 1361.1 1361.1 736.1 736.1 1361.1 1361.1 1361.1 1083.3 1361.1 1361.1 875 875 1361.1 1361.1 1361.1 1083.3 441 1361.1 944.5 944.5 1222.2 1222.2 0 0 805.6 805.6 944.5 736.1 1013.9 1013.9 1083.3 1083.3 875 1113.5 919.3 782.1 1083.9 770.8 988.2 850.4 1194.5 819.5 958.3 1055 964 [...]
+endobj
+18060 0 obj
+[777.8 777.8 777.8 777.8 277.8 666.7 666.7 777.8 777.8 1000 1000 777.8 722.2 888.9 611.1 1000 1000 1000 1000 833.3 833.3 416.7 416.7 416.7 416.7 1111.1]
+endobj
+18061 0 obj
+[1109.9 1007 867.4 1064 1110.4 626.7 772.9 1138.9 955.6 1284 1075.7 1047.5 875.4 1082.2 1030 856.3 832.3 943.9 827.8 1279.2 1112.9 824.3 943.1 597.2 597.2 597.2 1361.1 1361.1 597.2 774.4 633.3 649.4 739.7 677 684 700.6 827.6 533.6 588.2 758.1 480.3 1228 880.8]
+endobj
+18062 0 obj
+[575 575 575 575 575 575 575 575 575 575 319.4 319.4 350 894.4 543.1 543.1 894.4 869.4 818.1 830.6 881.9 755.6 723.6 904.2 900 436.1 594.4 901.4 691.7 1091.7 900 863.9 786.1 863.9 862.5 638.9 800 884.7 869.4 1188.9 869.4 869.4 702.8 319.4 602.8 319.4 575 319.4 319.4 559 638.9 511.1 638.9 527.1 351.4]
+endobj
+18063 0 obj
+[760.6 659.7 590 522.2 483.3 508.3 600 561.8 412 667.6 670.8 707.9 576.8 508.3 682.4 611.8 685.9 520.8 630.6 712.5 718.1 758.3 717.8 528.8 691.6 975 611.8 423.6 747.2 1150 1150 1150 1150 319.4 319.4 575 575 575 575 575 575 575 575 575 575 575 575 319.4 319.4 894.4 575 894.4 575 628.5 869.4 866.4 816.9 938.1 810.1 688.9 886.7 982.3 511.1 631.3 971.2 755.6 1142 950.3 836.7 723.1 868.6 872.4 692.7 636.6 800.3 677.8 1093.1 947.2 674.6 772.6 447.2 447.2 447.2 1150 1150 473.6 632.9 520.8 513.4 [...]
+endobj
+18064 0 obj
+[1027.8 402.8 472.2 402.8 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 680.6 402.8 402.8 1027.8 1027.8 1027.8 645.8 1027.8 980.6 934.7 958.3 1004.2 900 865.3 1033.4 980.6 494.5 691.7 1015.3 830.6 1188.9 980.6 1027.8 900]
+endobj
+18065 0 obj
+[892.9 339.3 892.9 585.3 892.9 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 585.3 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 1138.9 892.9 892.9 1138.9 1138.9 585.3 585.3 1138.9 1138.9 1138.9 892.9 1138.9 1138.9 708.3 708.3 1138.9 1138.9 1138.9 892.9 329.4 1138.9 769.8 769.8 1015.9 1015.9 0 0 646.8 646.8 769.8 585.3 831.4 831.4 892.9 892.9 708.3 917.6 753.4 620.2 889.5 616.1 818.4 688.5 978.7 646.5 782.2 871.7 791.7 1342.7 935.6 905.8 80 [...]
+endobj
+18066 0 obj
+[458.3 458.3 416.7 416.7 472.2 472.2 472.2 472.2 583.3 583.3 472.2 472.2 333.3 555.6 577.8 577.8 597.2 597.2 736.1 736.1 527.8 527.8 583.3 583.3 583.3 583.3 750 750 750 750 1044.4 1044.4 791.7 791.7 583.3 583.3 638.9 638.9 638.9 638.9 805.6 805.6 805.6 805.6 1277.8 1277.8 811.1 811.1 875 875 666.7 666.7 666.7 666.7 666.7 666.7 888.9 888.9 888.9 888.9 888.9 888.9 888.9 666.7 875 875 875 875 611.1 611.1 833.3 1111.1 472.2 555.6 1111.1 1511.1 1111.1 1511.1 1111.1 1511.1 1055.6 944.5 472.2 8 [...]
+endobj
+18067 0 obj
+[938.5 569.5 938.5 877 323.4 446.4 446.4 569.5 877 323.4 384.9 323.4 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 323.4 323.4 323.4 877 538.7 538.7 877 843.3 798.6 815.5 860.1 767.9 737.1 883.9 843.3 412.7 583.3 874 706.4 1027.8 843.3 877 767.9 877 829.4 631 815.5 843.3 843.3 1150.8 843.3 843.3 692.5 323.4 569.5 323.4 569.5 323.4 323.4 569.5 631 507.9 631 507.9 354.2 569.5 631 323.4 354.2 600.2 323.4 938.5 631 569.5 631 600.2 446.4 452.6 446.4 631 600.2 815.5 600.2]
+endobj
+18068 0 obj
+[833.3 777.8 694.4 666.7 750 722.2 777.8 722.2 777.8 722.2 583.3 555.6 555.6 833.3 833.3 277.8 305.6 500 500 500 500 500 750 444.4 500 722.2 777.8 500 902.8 1013.9 777.8 277.8 277.8 500 833.3 500 833.3 777.8 277.8 388.9 388.9 500 777.8 277.8 333.3 277.8 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 2 [...]
+endobj
+18069 0 obj
+[592.7 662 526.8 632.9 686.9 713.8 756 719.7 539.7 689.9 950 592.7 439.2 751.4 1138.9 1138.9 1138.9 1138.9 339.3 339.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 585.3 339.3 339.3 892.9 585.3 892.9 585.3 610.1 859.1 863.2 819.4 934.1 838.7 724.5 889.4 935.6 506.3 632 959.9 783.7 1089.4 904.9 868.9 727.3 899.7 860.6 701.5 674.8 778.2 674.6 1074.4 936.9 671.5 778.4 462.3 462.3 462.3 1138.9 1138.9 478.2 619.7 502.4 510.5 594.7 542 557.1 557.3 668.8 404.2 472.7 607.3 3 [...]
+endobj
+18070 0 obj
+[777.8 555.6 722.2 666.7 722.2 722.2 666.7 611.1 777.8 777.8 388.9 500 777.8 666.7 944.5 722.2 777.8 611.1 777.8 722.2 555.6 666.7 722.2 722.2 1000 722.2 722.2 666.7]
+endobj
+18071 0 obj
+[500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389 400 275 400 541 0 0 0 333 500 556 8 [...]
+endobj
+18072 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410 319 230 319 479 0 0 0 228 456 410 8 [...]
+endobj
+18073 0 obj
+[639.7 565.6 517.7 444.4 405.9 437.5 496.5 469.4 353.9 576.2 583.3 602.6 494 437.5 570 517 571.4 437.2 540.3 595.8 625.7 651.4 622.5 466.3 591.4 828.1 517 362.8 654.2 1000 1000 1000 1000 277.8 277.8 500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.3 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520 [...]
+endobj
+18074 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+18075 0 obj
+[556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444 394 220 394 520 0 0 0 333 500 500 [...]
+endobj
+18076 0 obj
+[556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1 [...]
+endobj
+18077 0 obj
+[638.9 963 638.9 963 963 963 963 963 963 963 1222.2 638.9 638.9 963 963 963 963 963 963 963 963 963 963 963 963 1222.2 1222.2 963 963 1222.2 1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 1222.2 1222.2 963 365.7 1222.2 833.3 833.3 1092.6 1092.6 0 0 703.7 703.7 833.3 638.9 898.1 898.1 963 963 768.5 989.9 813.3 678.4 961.2 671.3 879.9 746.7 1059.3 709.3 846.3 938.8 854.5 1427.2 1005.7 973 878.4 1008.3 1061.4 762 711.3 774.4 785.2 1222.7 883.7 823.9 884 833.3 8 [...]
+endobj
+18078 0 obj
+[472.2 472.2 472.2 649.3]
+endobj
+18079 0 obj
+[777.8 277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 1000 777.8 777.8 1000 1000 500 500 1000 1000 1000 777.8 1000 1000 611.1 611.1 1000 1000 1000 777.8 275 1000 666.7 666.7 888.9 888.9 0 0 555.6 555.6 666.7 500 722.2 722.2 777.8 777.8 611.1 798.5 656.8 526.5 771.4 527.8 718.7 594.9 844.5 544.5 677.8 761.9 689.7 1200.9 820.5 796.1 695.6 816.7 847.5 605.6 544.6 625.8 612.8 987.8  [...]
+endobj
+18080 0 obj
+[222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500]
+endobj
+18081 0 obj <<
+/Length1 1425
+/Length2 6251
+/Length3 0
+/Length 7209      
+/Filter /FlateDecode
+>>
+stream
+xڍtT���6a�R H3tw�4H0��03C���t��"J��R��HI#%���7���s���k}ߚ���������v��,�F|��{����IʺJ�  �����ٍ�h�o=�)��"�R��PFB�h�N��up@�

+�bR��R  I�
D � �7����p��]�AB�]��<N. at PRR���;��AB
�p@�v��c3:�a��
+Ac��S�����������Hg9.^��v
!(����
��!����.P�_#���� X
� ���.^pG�f�4u�{
�_`�� ���� ����
+���W (��3�����c�pg�	
+� ��t�Ѿh^ 
w��P�?�
����Wj� ��?��F񣠰_
~���Ypw���(�_�S�"!غc�4�
����-9A�N�h8zy����^M�?����:g�@�b ���:��J`���6
+�Rc9�y < ',
H �	��#�C��! �	��O�?%"AA���!�P8ѿ�c���dl��P_��
?A �����5v�
p����-06PU����C�_F%%�/��'*�	�� AA1@
{�g�U�o����`���GDM�����z��3�ֆ
�g=v�! ���
+$
+r�~��K����7��������7R��~�9��?v�;��������j�k��0���i���
Q�;��UF(J
�
qԇ�
\�����
��!��׃�	�@�e��QAa{�����?S��
��vO�w0	�a[��D?A�:B|�6 �G��. �\ �@�� H���-�H�W�߲ � �D�V�#���]�ߣ������ �8MM 
��V=j:�T���[
�
c_5K���B��:�q=�����y�bjo;��*��4��VC�����g�綉�#��D��ou
�o)Vw22�+��_x�����7�h��zzI��ϣ<��P���,��<�j�V!�M|^<�kcR���}�8-�54#��=_���c7s�~2k%�l�
+��X�;0Wj,�j��CgAˈp���Oi��ͤ_᫘y��l�����G
I�ڦt�����GE|�O�uZ(���8<E�L
�� ����~a��N��l���Y
Р�
6F�$s\G�wmL��;&-��I�R��_ݙe)�����O�	��G�u��:�|f�ֻwkt��y��a/*�&�ϲ��s�WG|��������V��:�}%h����k֓w�^�lIp鵬��:�
&�m��X
F
]
+'׉{ī)D�t�kI�D�V�<h��
�`�g6lp�h���0�)c�"��k������m���h�Xb�(�
� ���g!+;�R�
�z��^�*���6=�ڱٵ�	�4�ZؾHO���U��L �YfX��X���>A��ˢAp�`�VW����]k�kOC֋��0���N+c}���U
� }��D��S�#U����Li��~����`ӱJO
-
�ױ�%"��}o�<�w+/�
�=�8�$Mʼn�ۛ'��붟�rl���K���6�<Q�v��E��We�P�b�}*�����6���)
�
�y���x�
kI��,���^i���(q
�����ʩ`��e'^�w�6���v�1R�	oC��LJn_�H3o_�ҧ��R�!��������ϕ$(G
�ګ����p���IG�C�
%?*����M[����<q�l<w"�n��z
�A(��	l8dC��y�C�J������P#[#�r����_u��$[�����<��WO���+]���?R�t����a�֪V�ML
�WZ��*
�(ϖ c��.alw�[��;9��>���5�n�����`�ЫƼ�R����2:+�*k��G�R�7����`tp���cw립o�[Ӆ/����m�b����&F���mNҡ*~��E���bZ��E���w
^q
���z�'�6{-���*g�~�[�]����@U^���ޤ�x�tr��h�C�
����K㯭4B7�S�
}H���&8�t`o%
�b�&��D� 
H���Y^�[�{|�|5�L��(��À���/w#9�2t9��k((��-�ϮX!��ESu
ވ�V?�n� kaܞޔ��LU����m����ʓ���������VNo�/��ȅ
�d��Ra:`q}�u"���Q3Q���pmY�^���oC�6P�&���݇�U�
+p
��h��>PNH�
�J��H{�V�
+�+�B�Ce
NO2�R����<�����:4��}j�
��ҷ2f˾��]�����I= oƮi*�Ak����iP#�:�I^����kw��遑�F�#�k��B�+YO�ѝ��Vx����=0��}�ܒ��sM\AN
\����Vn~A\#'���#�zS�ݎ:.
+$�ۥ�Ѹ�
�މ
+��y��O���E��_!U�Vn\ι0��?�(XR�L,e9	Q>����-��+{�ղC���C��&�AW�C��{��w�O]��
�p�
lI�"+MV�#7�Q\ڶuv�[4����8�
?Z�=�.�$O��-��I���
�U��@�Sw���գ5�Ey��z��SC*}%�܏�᭗��3��j�V�.n��u�WȟI\a���qew��ZKc���m�I��?#E&��C� ��J�漽u�T���2�&�Ϋ�N>s���J�n�ȧ�y`/|�L�ဏ�شү����Vc7!�&ܲB	S�^Z"M�c<������F�j��k���$�e�aF���ı
h� ���zq�����=��Y:��Y���Mt��^�)$k��4�\|-'�K��8
Y@�K�R�aYv3�`�S.
�I|l��6N>��Cl��
=��,'1sD�h
��Z��e����]�Lt�:��_lx�D
LV/��I>����Ə���*
+�v�)�0%�8���Sܕ�
:F
 �+6A�ܫ����R��V]}�,'�����%��F�I'2t�*��Ĕ��T�tJ���
�Ս�-"�
\���I�>�y]F:ȑ��fL��S�~��`��^�[���[��}&9(qĵ������Q��,��<��J���Yv�Jj�͟yu�?��0<kZ��Q�7qߩd�#|�����w�-�,�b.�ҝL��D.�c���
��6�H:}T�u͹1��9m
�y������6Uk�K�ˢ�YΏY���z�dNu��м^`�f!��=Z�ሤA[+�83���0�X�Z�5C�2����\�ETOU㬐=f�$mc#I���Ô8���).���=�f�i琍�!-yw@��s*�Ѿ����H�YˈJN
�\R�d9�M�_Yo�ӛ%,5�v|�i�T<�n�'�ç��+
So?E=G�\�Q�u
%���kF�����ҍ��*j�!�_�ghZ�E��L
B��=^ž�8TIy�+ի=�i�J�Hכ�eOV3����s�����/^\e�:�w����`�5���m>6	�%k�_�~c��N��
L����l��@f;��q68.�6ݑ�d��J�sIq/�<K��=�!�-�;�6�8-�ý��������� [...]
+\2�J�k⥿pe
��)�v�%5��|֧Z���\��7{c�
�
+�\����r�>s�gՋ�wh�E6���P�3D��!���%+$a��
Œ�
2'�<�}�*t�WSy
+g$�⩞0�`��}�G��r8
���LYi�ގ@2g����h9ӓd�.J�ͨ���.���s>�~�����6�h��!�����B��v�
�d��K
�j7U8t
��ێ_����&y�7�VӤ�M��ݤ�uH���v�n����d��V��]�j�_��+��g1C�^��.%n-�"����sq�7nj��
̒�V��.L�{F1~���S"�W�)΀t� ��d��f�jp��#zY\��y��ہ��,�EJ����]=�9_��7z�
+#�9�j���0���+�o�����6�ڽx���S5���$�1�8$�F�VlӲ�D�|b�
񦍾ޘ��,A�s�Ȕ*9�&�o�$���$d�8�Fs���G�)h/˚1���3U�n��V̟P�>�?
�VLm��-1��%~Li AH��Z����B_ at 4�_F���$��V�7�*d�`ͻ4�Z	�,�S���u_�|*v��]>�k#y�7P��'h
K��[�2'�⺲'�F�iP��������F�}�D>�O��:
+��ZrU�\w)x.�~1�΁#���N��8%]քN^#�M���X�$٤:i��ͤ���#|9T��o_����b�
� ��F����f����k0�w���rh9�u��
1��C0%��〗�����A��
��݃�Gj'̄�����P��uu
2L���wՙݥ�V�H�@嚼��t?d�@��
�OI�@r?_I�S�����Y�f3��+�{�?���lJ>nf;n��{��T�ͼ
8;�L8�J�Ad��1%�Fe��V�o�Ϣ2��F��H�S����'�	����߻�<}�Q�����zGs����N
6Ś$��Eջ��O�92�C�b‡��ڟ��O���eD��
��U_�N�i��lt\�v�s��km�:���=��f��\��R�����!ϖ'l

��]K��LrzcV�
�
��IC=
�&��C��ѧ��zA��������"Խb�c)\���^M���0�
sk�[2�!I9�y@𥻄=�EF�g�P�M>e��U�Tߟ���V��
���Ǩ n����_�d�p�
+̐�iUXNhK�{�ڰ*���=WR\op�΃����(<9w��:z˒G�ȭ�6���8 x�����9�
+���΄dSV����P�n܈yCC?)����z�~/.��?������˲����/��
*}�I�׸$ƶ;��'��W
�e>":����'���z>{WO��QR��b1�<��B�;��v�ɹ*�gN۝@˟��<���@*�q+�'�H+��
__�8)��S�!���Fc�E\�l.�sUm���V��F��ڝ�9
���>��t���f�Y0�
�{����>*�)d��8h!-��,�@�v>k�X���(�WO|]K�����EA��	�ܪҴ�'}�vve��<�-LMD��Y���Te�r��	���,��"'�
�O�?d�:��gj����ŒC;��m/?�O��%3
�n�փ�p�Me=�5<��2ޔm��{���É����H�PI���iР�d��Ki��md�
$
K,d{`[���ft'tV/4�?c�4�U���&���Ѥkc�S&��{��*��s- at Wh,W4
�eެ/?��;����pơ��Cjܧ^�u�yH�#z0�3������+�/Wl�����Hg
�R��MW^�&W�6����A�w7�qt
�Vo�
���!)��]V|�9��mwq�u�z)�窖� �E
��QԔ6ڂ�gng��ݎ�i��M#�DJe�ړ��qa�����g���ܼ�
O&
M
�z8K1�H\��$��c���x�H[� �_a��AYs�U�,Y?s��ݨFg�������C��d���2�a� )P_�F���z�,�q���
^�v���)�v�%�d)�ھC'I.����2O
�ɯ���_�R����� ���my�Q�
�?��vߘ��܏�j�Ė�����
���d��ʯ����BS�M��
1s3�Zd	�#�n�[���cb���.Fs�
+�\o��3O�ߎL����_D��W^��nIi���q F
��I�p����v.���,:
 �g�N,�R/&�}�7����R�
�Sm�Ly��+z���7Ӯ��TI�su��
 �t�i�9W�nh�0��7 ��&��լ���)ia�'3�}�2�i���
�`t<�c������b4a��7{O�M\k��f�	n�{�L�e��	^�=g[[��\PXT�&�z�����u
u�$��N�IHkU�ęy��̳8�w�q�Z]���iޜ�*U5��:�%Aѓ�K�S�e�3�O���Z�M��/16�3e?�_�.d�UYŬ/G�G_
�[Q�rH30<�'�;r~&�y���^�P�3.�R��2�C#��!xv�{�Q�����d
+��fd�o�3e��˘d]�A��XА|��[��xs?�'���2��عs� �'u�M
+�jX
k��
���{���S=����At��ȣ�o��RR��W��<��;�a�V�PѸQ����
�NS-y��=n-Q�掞&���3�Z0�voW�\�r��J ~7��)����'عX$��

+�X�b�"uo���
��d�)JJJg��;��?���S
+���9E�����a�?�V-�X'�<�Z�_������:��9Se%��"�/g��(ۢR:N+��e��f
��Y"u���%��M����:�
R2��'�*���]�
�sd�º$���k
�	ʡ�7�$�_v���Ȕ��S�UT^{��� �78��}|��R�9����g�[.NJ|�O𧟠�x8N������LNbV;}�V� ���N�^`ݩ�z;������V`|7�E�[/�d��B�]n#�pGI�D�o!�ix���
��.�	,��qv:��'���Z
+���
�b���v���|+��0���#s-�t	�n��ʶ������%W!
w�����䑟�ߣ�	���u�ʹ��=ĵ�c�w�
;N�nN��V��}[2����or����+`d`F*E.vP
�
�K���7�
P�G�x���A���f�YߛļC%���q��)!�zN	y
ކ[�p��h�S;�R�k��4�D��5w�[���z@��z[����J
U��"e~f�"ڔ%
:��`4��/���XC
w��9���+�Ca���Z��_<�S�PY�g頞�y��WF�
&�!��C�i����?V؃�P/�x%�?QU
�#��z��U���8o�]t�G��t[���¬Ri����WN���>��$�<�Zh�ЏV
&��d��Þ���V�]�H�:|�ϾP�Q��
�s�ތ�-o�в��[I�\�mVV^&�U�s�}&ʖ�F�"�0�����d<���¸��������GD`�#��*��OTU��,��HjR�նKC�M�`�s��
˖�旉�A��*,���˚
-�����{Vєɪh��
3�y?0���3�K^8���y+��Zy�����f!W+��aQ1���n~����^��

+endstream
+endobj
+18082 0 obj <<
+/Type /FontDescriptor
+/FontName /TQEGZP+CMBX10
+/Flags 4
+/FontBBox [-56 -250 1164 750]
+/Ascent 694
+/CapHeight 686
+/Descent -194
+/ItalicAngle 0
+/StemV 114
+/XHeight 444
+/CharSet (/f/one/zero)
+/FontFile 18081 0 R
+>> endobj
+18083 0 obj <<
+/Length1 1384
+/Length2 5983
+/Length3 0
+/Length 6924      
+/Filter /FlateDecode
+>>
+stream
+xڍTT���P@���%%��\�Ai؅�؅e�����P at JJZJB��;TBi����}���{νg�y���<3�{f�y٘t
x�m(G�
+ �%�Z
+�b ~~! ?� 
�!
�
�c�c{ E��p��PDB�(�M	�B�p���3@@  *) &�����
�@J���0[����C����>H��
+]�W �
'@@BB��W8@���ـ� -0�ꂮhv l`P�ϿRpH;�P��||^^^@��;�����x�P }�;�	��$
��@3�

`��;�	�
�0(�

���"�� 5M��+������� P��t�&���ml.�`�
n��9C: M �� �m���t<�
sCЀ_7@�z 0��z�6H�+�
�s�I��gt��ᶊ(
���~J0$��v�ߓu�#��~v0���O�
�|Fp��TM�m���fED����DE P7 ��Ɓ�gzCW�/��O3�A��+�`�&
��A�x~�`O( ����wǿOx [�
+ ����x�dG��v����#a� 3~��	 ���~�@��-�����|��5u���3�ۧ����� xE��� 1@����݀�����a.��OF5�
 ��y����
$�	�wmz�� �Vߜ_����
�W����?��_���y8;�rs���7�����^eZZ�8��	}�-e�����P`�8����7��yCmua(����
�ɝap�.�
��S����Zn6N�ω;zR�\P���]Rn���);AQ ����>� �����z�Zl �@�C hr ;��<�|�lx��k�D���k���i
+�����L!l��
��ޞV��z�n
ˌ�m<L����A�x��pVd�,!��S��ϯ)s
��2^�m7���hJ�k���a���a�oz��g��|M7�m:^C�M�K7��NX�m�l�n
℺���^]*�5�%s���6�6+D5��(�5�1.�`˃dOR1c�x�q�H�yM

���\3�'r���
+��.
ƝM�.�
+��S�R�R�c
�
~`�S���N���Ua����B;z˩z�"��pS��^%i
��݋�+���B%�\z`1�!��}.\��q��sS[" ^��)D�<U—��r�jiB�
�ek�I&���ǒ&,⹍��u-�M�Z�ڗ��^�|�e���uO�)w��u��ne{ �}
���
��o�%jhe�.-�j_��
C��1���
NGO��[�N�l�0�����⚃m)J��X�|
��
p��~,�=�Z>�P�2%nO֨.�q�e1���|Fmu�h
�d�����
���F��Fѝx^��k,BY�;m�q�I���
)�O�>['���2�{T�ɽ�K:���&�{�A��o��"�ځv#�a�B����fBB��@��pWS���>�f�o����@�s�2
r!���Ar��da��6��S'x�	��C�I*���7{��M�T
��cP
t��Zm�6ٜ
fW�z<��I"�y�+w^J�s
=���� �-H�9�\�/��B[�w6�b�Q�	{)�
+�ȸp��5<�:Y[��^���|g�s�4�Rmb�9*3�P;�&����qc�`M��ny�?���2��M�[E>meT7.�v�m
�j2[� �{�TCiχ�@֡a���=�^D�0|G���M��_W�xiз��[���x�Y*�R����/�z�Byc�tc��X͵��DF�;���l{A���9G̒M*
+��G����` Q��Qd�Z��m�7
�z�!a�^؍�
fԿvC\��@'I����T̊`�OV�δ��q�%4�oh��w�9��Y;>�7�P�e�L\{2�v'�.��+H������%U��j\�o5MڈN�Ճ���@�l�!^���7b�ω5���t1۬Zk}���%��S7mj��}�
=,�,�
�����-�¬��;�M
��
�zkYSuI
x�
�s�>�̡>�#���	�7�
�!�$�8.�C:�
Ļ
�t
�}h��
+�
��0f����Խ��I�\JK���yi��YVI���a�k�B�-��y����n�\� 	͙�O$i\��|�:�c�"��¤7-Ǵfg�|_��
̌�{��#�C��}����̱
�)�&�bNp���K��;��SH�&�&�-�C:ƕ�K6&6�R�9y�ofcR����l5�ॺ�4|cŶKԢ� +\Z�5mƬ5�m����x(���7�P� ���<�J�4����)H�
F;\J�һ�<�r���
�Em��k��i�F=��é�j3ؒ���8�3
�%�a���*�hL|\n�4�$<�X�Ev0I	��	���5�Ʋ��]����(knY���,[Ec���4�R){���G�7�7&D�H8k�i�(�$��:����o�������	
���a���JZ�LϼQ���rJ�w
z
+�	Zv<�Qǣ�(^}'�+�rS�w�[1���Z���|���ֹF�gS��@KA����͏��{
�Z�
1���;��Ĕ����^a7l%d��~��e�:7�p��Ȟb81{URi�{�6h\�u�
S%����G�`Sm�����̉�w�i��T�MW=�Rߵq\,��*:U'oy�5V�S׳�3D��*hm9=]�`
7Y
0]��k�
+�U�� ��n�Y��k=��w�baU������TUf�CM�!E�t�C��"L��F'UT�INŵ�,�������R��{f�E�᭙C_PB�9Ŧ���.eL>���q��
+��F��I��=Nǝ�õi��WW���T�� �ގ�v=����и�Y-�O�z���҇d$�Ⱦ@F���R��+M����6���J
���s��?�vܪ_�8���n�؛�.$���ɚ�NXA�r
�L��W�X�M0�c�UU;�d2W��>߄��9X7x)(\��=Cn"�X�1�����
��lQ	�<�
+]�>��B����~Ѵ�Ɠ�˸��Ak����CO]I����'h\0R����Ɣ�jI�ٱ�唝i{+���Z�Q{
E���8���R���QH�d�N��L�
SrxJb�&>k�x�X��4RE�K��m+��
��͏�X4MGa�{��O{��/7�yI�.��
�9V�>�
ځ�2ߔ�(�t18���<�Ƣ�k�q�}d�"Ut|
��X��=J��D���Ƭ1��
1�֭[J��"�d�A�U�x�ʖe�
-�n��O��/���������C.pn�^w�뜱'���|�mT5�!u4,�%�jء�}L^nT=�{3W6Ñ��j�0���������:�����I,8w���<6����FJ�5��%q�}��E���nY[E,�6E� �:��T�IH��ێ�Y&�a��s��o��π<�t��������f
�)�i�x���W���
n
*M}�4���;#�d�
]�
�i%���t�������u'�=]��O^3Cb��LH�M�=kh��3�췱��q>G�{�/>ܻ�s�3s(�k�:'�٧���&D6
3���t{H�q�ȿ�J�$�����b�
���c���38.K
��wx
�7S��I���K�Tc�
K�ܠ��W�c���&�ud[£3{��`�=\r�^�g
�Aǫ�7�pc;�D��[!�˯E�՜�>��hj���Xý�V�h^9���Fz�,n��u��������I-8��H��#���<YW�Cp�z&�kk�����v�|Fs+�4�,���B�z�y�du����\w�~���L�߱�HDNL�c�'�r�:��ȗ[	�{��BjBj��7
��G�Jنkr8"-$,�uJ�C������[z
�Z�-
Ė9FK讈ɵ�/��H�Ax�8-�m�Uo)�=�n]�D�fP�W��z|{uEe@��0-���Œ���9��N�]l
�7
!X>�^���ȴ��wai�K��ئ,��Q{�e��U��_
+P��1�T�EK
:(Sc���e�Q����'BKG�l!�Z�
0�lk4�/��As�!����Ef�
���1f� �6��)9�̈́PlE�F5EEڳ^����e�BW��n
���z��s~��j񝣒��-��
���
+g��N|V�>=��YD��q�nr��c���[��L��?
�0q��
P
+�i��Ld�T_�'�p>�s
 ��FՖF|}�^�K "/��
oe���a�G�١���q��w��6�ͽ��`��9eL�ƺ��f§j
ǵ��ȝ7�Ջ��P+f?����B���+i����
<�pn�J�=>��N5X�(�̭C�����/
u�Z]�;+�C�����
�6�C�L�fC�[��g�!T�xg:-�����
M@ Ô�U��Ť�8����Y���9�0�=��C���W�����KTB���Ch����g�L�{^l�8��p��l�I�%�
Y��rm`�tfFY~�.����Xk�z�
�¶���-�ɯk;t�@CPh0�b�p�+�B�G�;Q����ߪ
+�nxA��Vjp4
+�.��`u�mk���w9��"*�\M�ҥ��\�,�#���d�e/��̐
m'�l7N[DO�bq�%�%�?B������h��؂���/�*��^�ײ�k��sY,�ڭU��
K���Ɵ��-O��ƕ�ט����
p`q2�w;t'
O�WojF�DjI�z�����wzN�z
g���(	J�u�E9�lѬ��>�
+�K9���� C�|��l�1Ej�g��M�=\��[����u�
	m�?�2L�#�IN��i�^Ө!�
�u�n�ɿ�u��U��gX2�(��u䴧mL�E�9����!/��u�����^+rb�?RIF�S�u�=�tC��땿��i0�>�
����4���X��.^jw�L���kirB<���P�̾Y�ynU�5�4'��"��S6�`[-TJp��I�W[c&f"������Ϥ�F�
V��d>��\T�EL4-�,�	�n7�TS��,�,��}ŷ�zza�y��?HC~�ߤ���M(�1��m�2ұ�׬�w�Dm���@n��
I�����c{jUu��r�����C��pE�[ߞ¯�?��бr��W�u�,��cDS�m���3Ť�ޕoW������X��j��Ŋ�P�t�ƹƞ����QʝR/�������n
��g�0�ݕw}��H�d|��Z�a�dF��w���O���=
&GV���}�Q[r�B��e@�l�M�tlI���C�s�����]��� [...]
g�g�e�
'i�`�ѵf��ǚGJ�t�7#��b1��$�
Q���雌�Y�O��~��
g�9U�f:{��Q�Af���	�4J�:ة���m�B��l�:�+i0IE	l/��Ъ����.��Ո�Z.5

�;%�5��bH�O;w39w��dX$cj2
Iy�~�_b
\?
+�8�g
�IQH�)@nQ��b�eV�(�v
���@�~Te�h�קz��"�[�������V��
���amO�tDJ?#7��gO#�`����M�'�ە�
��E݊���ˠ-��2��2��Y�=�s��<1y~����@KT�����1��G�t1>
������Z��4P��Qm�qJJ'I�<V�]
i
y�v/(
EI�"�wϦ�����R��u�.Z�&M
��-خ�#˰I�i�
��~�Cݒ%
غ�=N�0.
�h�u��ѶQ�a�'��]HM��cZ;���Ϭ^�G�^2xJ
8G�tuk��TJ��B��ZFg��P%���y>.N6k'�����=L]I�I=UllCtqܗ�
+G"1���½�&
+�05�
$ۺ�R����@|
o�.�NzcX�w
��ǻ%��M
��������w�<
+Z]]�6�ϩ%���!@x�c����C8�Э�����"�;����Ѕ�
+��Ȩ���[�Y������G!����}w����ڧg��RӴZ"� G7/������O#���}�]�s����PW�䇖W}�c/
+�*�f�
vf��B�l��@8�oN�f�V��xz�'���:V���%z�ܧ,�yq&̷�@?�mӷt7v3Y[��+\��E��blu�R�F���'���~�kS�[l��N��ҟ�\?�I{�&Z�}�UrI�
<
�_�<6jO�0�����D���7�Ie��!��)U1w��R�����h_��R|_�;���y��1)n��zO��� �6��L��$ 
��)��%����RFq!����ltp��x6A��wU�D;����r>�M�E��_$�vY�R8��F�4��[�⡎��������o�T\���C�~	E��G�B5
HL�V���Q�0f�>�ק͊����K��E}JJ?��W��Zk�		�x�f�Upkx*?�N��#�Ns<1iҏ䛅��F�k�E��&cO.��{��hn$p
-M� M��h�
��i��I���'\�[H�`in��d�̓�Y��7�Ui2�H�v�J�=�a� �#3�;~x�}q|�s`|Z8ڲ��lC��.��>�3�Y5�I���~g�N�
_�w����
	��jXi�)|w.��,ޡ�=�)�S
+�6�̓��l���~
+k�D��0�0��@�;ﬞ��� �0*k��H�z���EqBj����V��l!�V�M7�o��/˩�/�`H���
�˦7����ǸFI�
ԪU�SX;����1��[5<E��9�1�fԀ��i��XO����
/����_�2
͋���#��O�
�?��=4M�M�Ws�J�PvGL��OJY�_��e0�̳�o$�/��uB���8��V�B�x���M�|O�
���&�k<��v����Xo@��4�L�_�*�v:m<
+endstream
+endobj
+18084 0 obj <<
+/Type /FontDescriptor
+/FontName /XLOABE+CMBX7
+/Flags 4
+/FontBBox [-55 -250 1289 751]
+/Ascent 694
+/CapHeight 686
+/Descent -194
+/ItalicAngle 0
+/StemV 127
+/XHeight 444
+/CharSet (/f)
+/FontFile 18083 0 R
+>> endobj
+18085 0 obj <<
+/Length1 2250
+/Length2 10984
+/Length3 0
+/Length 12226     
+/Filter /FlateDecode
+>>
+stream
+xڍ�T������.�kpwww('8���n�]���B��E�;����̙s�3�]�ޕ����ϖg����J]�U���
,����
+d�H���9 

\l

�����7{�娴�`�+��Q�7
)(��,��=+�89��@. �W�'��������T 
�XT� �N�`WTZ)'go(����9�
� �� ˟� 	0br���l��-@� -'
���.�m�ܜ��===�@�lNPkQF�'���	vC=���?R��
��ƆJ
���r�r�A��g�=����l��h	�����j�`��(+�G��Wq @6����e��#��� 

'g��7��`��d��ܼ�X  G�?A��N�� �
d���'u@VB z���\-�g7W6W��9�����2��RN`G7W�?�IC�`��{���\;G'OG���� ��V�a��̮�qq+H���,B�[f
v�pp����. ���
�������?��9��:;9��� �A���?��� 0�
����
��	XB,� �`k�#��ޟ�`������x�8������'��	�tr���[�������)H2����@II'/�/+'7��S�� �����q����%�o�J�A�����R���	 �,����L<�
�������N�
0�=��
<
�_���[���������s���H����O��?
+�9@���x
hw���Pqz^������*`K��ÿQ7��H8Z����WY��R
�fa�9�o���C
��N��?�
 +���_���Y�=�+����?o�?C�8Z8Y��~�<� 
+�F}n���
|�SK�ן�
`gstr{6<���r����S^N �9d~V{�����?B{���$�������� ��,8y�	�������r��c8<_��3�ݕ��ot�N�?����
��1�?�߈���?�����F����@-����Wg{���� �V�NN�׌�/���&�la�d�Ǣ<_M�v|����E���qq����
�=/���o%�=�o���������%�?�����7�
�+� ���G��y	��F�������ßo����7���߁�Y�;>K
��� ���u�xV^RWȟw��?���
�����+�Y��?_��+�@]�s�
+�m
�� �d�
�J�������t��DJe��	^�^I�~��Zޔa�_�|�=�Ќ�1Y������Dͩ�vԅI����C��Ar2Vm�7�.ot���?�v+����c���x�y5
V~�>���Sǫ��P9��c
�n���<w��э�
�	�������W���'J�DfT��X�R_�uθ�Y��jmN�
�WĆD��8_��|%��	�}�KW�g�⬜��Č������s�y����cFl���%S�$�8R�0��:!��	���?$���R�TB"��36�����p�
�@����(�V��
�e4X���5�K H�Zh"����F+��q�ǀ�=�OFSV����!�\�]P�OU&_����g� F̻��k���j��<f�=������&�c��Y�\/�bZh.�x�:,�S\>v�
Rj�z��՝"w�!�­�G���E�M���6�l���I�Y
�߇g"~�[

*���;(�ۑ��!����� ��b#W���F����7M�O��=�7��
��P�	�
� ���<
��7ē�-�+��S�q��ۂW����%R�����h�.
Ӷ�ih����j9	"ߛ�{}Dd���2sw�K�ik4�/�8Ӥ��dk�_:����vi(���p��(��a�j1RG�+a�
�Ax�z��9յC?Bi+!�i,�8w1��s-VQ��*���z3�"{���?W6�巓
�Q��ΗתS9
�K?<������������[]�꿗3����"w���L���
?�7��8ʜrlkk�8(�I���|{wl/a�6�x�9l���r[FsL�ӹ�~�P
+&�/�`E���՘���
c�,�
��)���F�J�p�8��Yx..��ldl6��pF�Y���<N��K�4��5�ML��ֽ�m�+��=k�Vy�"z(����7����V�
��
��}�&
jb�+ц8oGTiNj�a��=?������;������A'���a�sT�1��Uiя����D#�Āۑ'��|��Y�.KL�dL��T�^��;�j[�u
v������,�A���8k�
~Z|�,~Q:XMQwk��Hx�1�X�}b�-i�hj�1T
�D�-
��Ki�z�	�~���
%��U��0�z�S]Fy�R\�b�+b�����6 at x���I����9$��҂���u��"�z�6/�4��Pq|[�أ?T��n�7�-�+y
B�T1���_�� ����dl㐾G<�8�����y����������
hE�[�
v$j�ð\�w���rn��S�*�vK�
�����R5_�B�||��a�6�Ч���f#�ɟL0d���.��B|M��p����മ���R˧Vύ���o���L�}c
�u�4�J�d9
Mȵ�cg�8��B"�_�V
��xQ��_�R,��`��3�����|�)�1����-�>�
_�73����_��
�~E���쳙���)$��k��.�}��*JT�<�
�DV�#2
��򞫆�������K	4����T�B�h�Kk����t��
�!

mg�gVvR�HxFA��i�^�1+�"^�z�?*� �����p��=#ncc���J:uj#� �3����D_�h�R�}g�W2�d [...]

L���
+� �s߇���zǗo~�T��j�x��.~g9�z�I��(:5���Q;@�{7mƎ�8��oөQ�ISg�%n�7rK������,�Kz�l �IPf����J(/�`Dzxm����j�e��De^*��I����w�
��~���q�Q���4���g��2s�r�"Ӈ(��1^�tèz�����Ȑ7uf#bx�n
�{E�
�PNơIrʷs�[���j

<�ؽ���� ��4�O��S�n�z���œR���|6��t�cs3���Hr�Ѻ�7�WTO;]���]�ĤJ{�H�Y��z��|1�
+*L��
~E
+��LH

�k\B�B,�� ���Pƽ�p���;
$����A��Q(��>�IL>V���w}�xކ4H!}��
�|��ݔL����	��&��F�
ч�
O�!r�
?6�%���e���W�
+�¨X�Ǐ��6A$_"��e���y-X/_��4go�!�&�p�!��H�C,�*�g�y���\��1�[_=C-���@+�>u9v���~˝�e��*�����㺑:em�2b��nc��bov����.sNz>���y���2�	>~hRmAA�I���E�u�L8
w�y����1Z�K�E(�<S#�0KР��G����^D�Ҡ�<ioށ^��c�I̟;�O�#���b,��w[9=`����i1̚�h �x21�T�榻�%�:=H(���m��{bc(
�sf�!�#���N;�{q�%K���R����xD0�����e*j��N��"ӳ���$J�Y����_2}�ٵO��zj�
+��Q!��S#�sͯ�
dv0�]ᷞ=�#&�O�9��|d@����
U˥��
�j���z�7�i�3��=;$��?��jJ��}|:�|f�q�|[�<M����#D�7� �Ā[x�l�B��lh����_������
���C���@98�����
�}�85Y"&|8L9qs��_ *=�寡����+k�uK����$L�ꍀ�.�8���(�5�Ъ}ɏ^/�X�W�@M5�7a�a���c����>��C#� ,pK�ׯ��b	��8�(�:���x��_d��^�m��U�
+$׮[p[
��n}�<�xkxh�
'�OQ�c�
m
I,S\�oi�;�Y��iis 	!]r�Q�

����n �0!�S��_xf�0���
+`�̶
��
�!֏�
�a��S�lP�8a�-�
�ä
2���4�<L��
��Yd�-�2ȣfȩ��H��l�st����8Qw�Q՚��d
���������1�Z��0�&��
�Ix��_>�HP²iEb|��q�R.
*�Mg_��N��U��Kl�D 
_��`	ڞl�6���$3��4�� �6h&T��ӝV�Z���y��K��>��W���)�R�pwK�zJ43
Y��4��N��:����ȝ��+ib�U.��2�U�o�ba۾������.�����6[�z�{:�x����:fN�
iE�ti�m���
���IJ9'�+o\��D6�\��a,|�q�feK�Ȗd+�������+�~W�s�q�I�M΍�ZoN˷"�CƉ�u^��#��
~|��gfk�ڡ��O`;��7Q��#T�����~q	�?݁�Z�4֫�5kg���9�E�x��ya|����N/����e
%13@u	��З��<���2�J��>'��c�l�F<!�\���h�)�||�:"���4�ug��ȱ��_ͰXPm�׌�N\Je���..!Y(h�
�_�k�l��I�|z�F*2�-
����+�
�6*
���/���":"��.;
JekIty���c.���‚k���h�
e�N6���P��_/h��L���
+!������vn��[34���1�.	����'�u]��:��`aR��Ctb��f�N�m�ڒT�T,ư>�$��C?r_6��߿ms�qP� HT
V�
_����I�q�/�
+����S+���Po�h��A�
�ż4��PJ
T<�ݘ0���ow%8��~./�x^䧧�ޥ1|�"�,3��xϠ��
�õh��sa5M6�/�ߖR��N�7�kx)ep��
���Z�z� 
U[ң^��+�%#��>ZX��=��.���4^�IQMMVlA���ʴ�y�E	���ZVհ�">T��F�i�EZ��[O6tw
+�;	
G����֜=u��z\һ ��PH�6�j
�҅��>9Δ~�a�׋�>Lo�:��0!����êQ"��1)-��3��Gæ�(
���]��n����
eگ�K	�˾z�Z�cޝcl"S���_L�Ω�$N��d�dX6�m�W��[��-�eH�
�'
+[.əy uN=��)�'�_�W�͵	���
!w����`T�TJƧ����1ԁ�9J���mvj B�<�5q*�
+e������l�i$
�:c���A���Èk�����K6�a3/��
��ɜ.����
e�nz*D��J�BC�uCe9�Gt.�N.��tm_h h!�\vAI0�
/^�������0�����w(��k�^l>‹ά@�g���
P��K
 ��Y#]Sl�f�z
cS�?�9v�a�=�=��L��������+�T���>�sԣ�!�kv�c�����,5Yfv��
+��G�_�K�D�ī/0�ݖ���
ʴ���
����	���1kMz}�mP{��S#_�u~��} b��=�p�\�hv(�����?+g�"����\�\���7`��L�Qg��4ø�Q?;��
�
 ���ȧ _��n.v���ː*�\�"N�]��<S��Pm�g��Ew�
�DZ}�r��ز2�EP�
Hh�
]��e����P��<b1kJ�{;��.Pb|��W���M2W�!Z�#`�����,����=�{5�
��xa��2}S�I��t����dUT��~
��N
Un���|�`D96Ȉ�;!�
+'Ag
�+��ö�byU/���W>w՛��c��]�D�2�ܭsBW���{�@_'9�5+P�\���_V&�c�o�e�s���Yg��
+�`���Oϭj�׻X>����7:�Q��Ae��ת����� �M3�6A�Wg���	
�n�� U��
-�P����
yce)�]��8��6���('�W����Rso��w�]��a��;wW/,��Ix4�_����Vz˰҈O���c;��+��%H��?�>dF4G�G�����G�`�-�XO�z-��p07�y3;��(�&��0�y���n�-L�ꊱii
���RF�”���Zd	[�(�~��%���OM��\/m�����s];��{|�[��˺]ىq�D�ѹ0���ݡ�K�4}��$�$-��(��?M7��>�����MzaR�����+CM,���b��I͍6J1�����}
+�
+s�M���"-�[H�
xsەµN�dh�
�%�)��A�G
+S��	2���=�N�X��׺�7ڶ�:���-ݧ��'ۡ��uޥ��P�ze]��NV8^`��/�i�&=J�%�W�y
-}���*��ɝ��?�z���v��X�#V�����\�9�?�~tǕԽ��m'�|��<�–���I���U���/J\�1��?e������^N?�����>�aQg�\#���2A�C�@�
�e��K�Zy c`t������]�[�~���,�j�L�A3l����?��sC.^�ޕ��INSqi������_)Y
g�YD�E‚2;�7��i�w��E^h�/a��u
�3T*	�U��NV�\XXd�Y�M�3u��Ԗ��U��4 �$^�
[�e��u��!�:�F���L�y�ӫ�Ehԝ�M�lqm$\S�i�T�
�
�G������H��j
+��Ŧ+�{7�)4�Д�,VV��g��~oi���b��od�W�֡��>!l���	�İ�X4
&�ϝ��7 Y�)4y�i_�nyeG�W�mS!YL�A�]2GƘ�U��S�z9H�N�"]H�BJ{��,�����W
�.��$lEt���Ԗ_�/!
��~��7�I��ԏ
��8'*0�o�D
+����|{a˜�&[�qV<����:����c��U�V�9�	�J�M����Czq�����Z
4�pT�ˊ��r
+�>�	F���2�y��L�C|��Ѹ�/A��)���Ryj �z�Df��L3i�>���;��
{���4�@`�!�F:Y1�I�k����w�'�O�#~�Ki���
0<
+;�[Fr�]0�����(1�wLyU�l�-��^�ѿ�Bn7CuI
��5�̌��,�Szb�ֈ�5O�]�x�,ϐ�r�!X�2���'�/&�,���l&�PB��"
 ߸4,�aa�r4eY�u_S�8y=Ō��Fr�&f0n-
������t.ڎv�H�+J��5�Q.o������$�Ob�|�w��>U�D��O
X�oci7��z��6E*�Ն��l��vd��M�����	�ڥ��p
~������x��O�թ������O��|	lh=�YI6�e�YQ ��N?�wՊ,��j�|�{��*�V*#���/�v��n�=�cd�+��D���+�ob�`K1]�g���r��ԛ�
m�G�,��.c��Y�9&pT��dP�5���P���������~�3���ڪ��5��(sB��!�fCP�q	f
6
Jq_
0�eȬ!"r}P�5bn��W"��G(E���pm��Y�|�$��Es�qvj*2�Ek�O�;V���&�}*�
��f6
-�5���-�7Y{�g���i1��4�!��O�
��r��4 ��$��O�1e�5�.%Hp�K�+y�N����&mk�20�u�Q���j�u/K�H� �-s�W��Ry���5en�u�����|a�M��h�¿�s��sT����]
<s�ʧ����5���C~^N�dM�6��|WV�A����ƒ�q,�"�ݲ��㎉�0�x�n�Y���"��L�f	�|��#�G����ZI64{�G����]�S [...]
+c���"2�SN8��53D�p/
+�~3�*�z�
��q�'�{�v����d��(Q�	W�I
��.D&��+l��X���Ln�W
+P��ʲGra��4�Q�}
�o����]Q�
�)-���
�u����,,�z�T�Κˍ
�5�_�9�ճҥI�X�i��
��T����.U��L'�u�B(��&>.�;�� =�F B2�h�?M^��F�׍!
o��.���|FN<��o,�YG�3R
.N���j�v�
+��dp���%y�N!2
\���e˩m�L�Y����!�0�
+��[��tGR�A���^z�u˺�௙��+=�S��@�O�a�Ȫ+����z����E®/27ٴ
+�̃�bPN]��&�iN���V*���]�~����N��U�+(���v�e*G���WA��ߙ��	Ѳq���
�Z��Ʊ*�yO��u�w;�~��� �n���mM��V����x�̈́�������zt�=d�hta,��fȰ�W���z�{b�����>�����`��ꗧ�{�#���ek��>�D�Q84L����t�'
$���S�E�p��q�
�y��t�ۻ�3�5vD����u��:�����x�5k�k��dHK�����&Bzl�F�S�Q}���X��;�׃�<��
�W�e�/�lc�i���Kx�J�%C��4�����}?b�J	+d��	ſ�3ao��44`���nAc <��3$1�#Y��[�����Ƿn6,i%�45Cn�ߏ���J�;2�H
+L��lE-I��RB����
��Ù%�I�梹?S��Y�d%\!�Q��(�j � *B��	` ~
+��?�IQ�G~1u����8
ĝ/_>܀jy�Q�xr����\׶����-G�)~Tɉd��gt�hP��f��"
r��-
k�'Ĉ�KL��\�R�r�\(O���[ƙ#BU�?��������І�H\�|���6���q)y��
 V���U ǜc��a`v��t_!�:Ά#�[\d.��00��a��h��Ó
_
0!�gE�+��W
yu
<�Suw��\	J��o� <�ɇwU����.
���MV\�l��V����!�i�w�}�&i	:W�j�y�j��������8������m���H�~�NLwX7P	9��`�-=�
���sH
�*����,���V
*�`��Ƴ4��{��ہ}�
����O�������@�CceK����w��e��dIC��b��!8
�i��$��3Md�l�7����
��q}z��I.�
35h|&�{�"�V�>�����*]��X��I3�"d��Q;�ygRY(\�;�
+/4w({�1r:����}3p��W�aYY�а]avgoǮ3c��%�2�p ���1e�bD�tj�v���DC�25�A��KvI����:�i��q��=�K�KjJmC�͛ٲZ��#>	����+����H�Z@��/�ۢ��Ȃ�����"�
@P�+=�۰z=�"Ԏ��q#C���|V����0�%K�٣��؉�ʆ�
�܋L
�H6�B��+�
S���lķ�z#h�\+�HX'�
��gh��#�W�p����o�
+_�Nl0�l}o?�Ew�`z7G]��&��c��
?��}
���
��i$癜Y�'�����v����";� �NN�� �J�6v(��x�A�
�E�6��o���D/$m��0���d"��6�|b�F���ͦmu�_�˪$ܵ�ۛ���ć?,'��y�
U4Gs���M�E�)���P��À�Ҕ"�L#C�:��ayH_��Ȣ���~������^ʹ�AWbL�|��W�'��=�%H}ˋ��/�����O:����4�|�aR=
�Q
I=��_f�
+�>��2o��
mu(��e+u�?dtoFY�U�3��X��CK ��
H|�m)u	�\n��3�L�$,�w;��(�`�i�#_
�j8��s
+�fE�n������
���zdM�n
+S{�
��ӯ8�2�};�oO�N6���IV�SFeo^��
+�
r���ۭ
�0Zդrb�ݓݍƖ�"�����Z�������Ѓ�҆��O��b���k��v1J]�N	��:�w�t)�l3��wj��p
���oE����E�a��Y��E&b�F:�9a�5<s,�v�AF8uo��/^c�;i�����{�0��*
�qT
�Ǵm�ֆ��
+ʓN\��ځ|���>"�L�_���`!oZ�
N�W'析�,EBy_���N
�m)��Ř�v����w�����>-�ꜷ;�/�z��!u�Q��ك#�7�� �+Ȱ63n���3u���Zr�<bӺ+��SZ@�E
[~ �
-�.�
��!
<#|'�L�$�"̄$z���\���jg#MZ�
is���oo
(��9�eN�3�E��zm
���ݝ�(�۞2��e���7XY�$��`'��-
?o�?Xa:HI���E}�~d������-�'�Ą��O�X��62�!nGbV�cS]u������C�M��Ұ?6P��| F�R\��:mڧ�K�l�a���ځ�5R��L�Տ��g+#"����
+�;
�0
��7�ߝ�L	BbeJ��
��7����

���ڰ�'���
G ��b�)F�s��k��0�֖Q�mdק��3�J�|���p��,��%F��_���Y�Kj6���R$�gt&�Y� ��u�-t)��ϵ�R�!b�j��`��y�
���&��=����
�y�h�,�Ƽ�V�$ *�]
�����$H=#�.ϥ?�K_h���5��
�S���/<���?��d��G��\�p

+:���A�3=�*
%��f8'��bA����6U(ʬ��٣Z
+о�-��l��d)��TX�e��
Rh���ٳ�N uu��q��Z�0J������#��/gt�X�wϖto��,�]śt/�	�3]�Q�o���T{���`����@CĆ�d(�T��HR��w�	�x�0�i�
.
iP����kBO�@�
Q at gcM
ab��4���󐡵E�
�44MLpC���7�KI���x�ȡ�p��[umfO}����Ir��݈	;>���qwR.��Ҧu"}�Y�˛�iGu�j�
u-�&[)Q�nw� Sp��0A��jS��El�
�ch�u�
����<D5.h���'�ib�1��S)�&|si�<3���ա�Ӊ��$E�W~sh�ݭ�h_q�Ƽ�\��%�Qƾ�L�W�8f�#�
�М|\ �Y8˶���Tܤ�DZ���1�+�c�å������^��*��`F"13���/��]/��;m�
T����Ht��RI
+�?�K�-�.�5i��/��J�k�cu�j5Ʈ#�R������t��V��9�Ǟ��f�J0*�-�/�.6��I�r ɽ��"etL&2w�yCٝk>c�%�M�HU�ٕ�K'�ό]�	H�E�Y@���jٽ�Y����SΜX���j�k�6'mLN�q�)�
a�w���%�^�f�o�~e.�w
�}lt��d�� ��]9q�9(��0�ó�~u6����;Q���X�f8����Η�Z��-��=�0+��HE�y�
b�n��Tm�&t#&��)�tƖ���#�ȶw�a<�֏H�
+q~���%:�����o��4�%W.����ц����xI?i�:/
+��sxʤ��X���?|g�{?WO��a)R�7gE���0�[�9��	1�i^L�c���C
+�R�%�\��jҦڨ�Y�p�g%c*-ɾ�y�Í	܎׬��d���s�ü8�>U��[�`F���,H�Y&����'x�?�������,�����"iO�Y��C�+	o4l��r����J�R.â㷲������Q�!!�>��
��]\r������-|)�c��IC�?S�Z�~KoZ��J����T��x�� �Th�%u��0@��?���|&_w%��3����M��Fށձ�ا"�dHv�����1$T�J� ��G

+endstream
+endobj
+18086 0 obj <<
+/Type /FontDescriptor
+/FontName /XGUGIB+CMEX10
+/Flags 4
+/FontBBox [-24 -2960 1454 772]
+/Ascent 40
+/CapHeight 0
+/Descent -600
+/ItalicAngle 0
+/StemV 47
+/XHeight 431
+/CharSet (/braceex/braceleftBig/braceleftBigg/braceleftbig/braceleftbigg/braceleftbt/braceleftmid/bracelefttp/bracerightBig/bracerightBigg/bracerightbig/bracerightbt/bracerightmid/bracerighttp/circleplusdisplay/floorleftbig/floorrightbig/logicalanddisplay/parenleftBig/parenleftBigg/parenleftbig/parenleftbt/parenleftex/parenlefttp/parenrightBig/parenrightBigg/parenrightbig/parenrightbt/parenrightex/parenrighttp/summationdisplay/summationtext/unionmultidisplay/vextendsingle)
+/FontFile 18085 0 R
+>> endobj
+18087 0 obj <<
+/Length1 2316
+/Length2 16820
+/Length3 0
+/Length 18199     
+/Filter /FlateDecode
+>>
+stream
+xڌ�p�m�
+�l��Xac۶��X�m[�m��Ѱ��4m�6��W������ޓ��>��lj�^k&$J��¦��@	{;zf&
����43���������B�����s
+
�����
�_�N@#��
HQ�� �j`f0s�0s�01X�����h��3r�4�3 d������N��.�8�yP�P���9��1��,M�� �F.@[PD#����%���\P�Y��8�02���3�:3�;�
P��-], *@g����2@���oj
 5
K�	T��\܍�� Ё��	��d�jg
+t��T�� �@�)��K���� ������ֿ
Y��cldbbo�`d�iig0��%�\<\� Fv���l��A�FnF�6F� �R7H+�@
��������ř����7G��n at e�3���ڹ8#��O��	h��'㿛kmg�n��dfigj����������+PZ��:�#�?g�@ ;'+; � z�X0���� �G���������`��4�� x;�.N�@_�������&. c���
��c�ٿ0��N�
 
&��1�~���I4a��v6���i1�������)�W("b��geг�3��ظ �������
+���?�JF����/��vf���!~� ��?L��=T��j���P�
4@�g�u�ؙL@���?o�?&�����������I����#���������������vu-��=hE����&�_-4�t���Ri#Вۙ��������_���
@S%K�
���aciT�w��}񀬘���
�{&֠��Գ���A���O{c h��7q;{��;���0rr2�D ����A�k
+��g��
v�.  ��/���	�w�9��¿���8 �"'�Q��0��q2%� V ���`���@>�� �O�?����_��`T��@��  �����_�
�i�_ZFF#�?'ܠ̍��A���.�AI����F���/��61��A���� �@�e��P
�� (]�?�72�;H���k4��@���AiYڻ����VAP��� �6��,��m�l�M��	"e�{��[�?�]����������_���Ú���h�w+@J
��t��)&+ȃ��_4��/���Rt���K
��
 ��6F�)�,��a�t
�^Z��_�?��c<�l��
�����������ݚ.NFՖ����/���/*��?�v����	���\ʠ�����
z MV��MxC�B:������������X觊��\��
�Us���~�X`�з�Qq��]_���m$n�d��'��7'6�_z�_H�# ]Bi+�L!�)sS"�F�45T�@�����-ɝ�\�S&�S����<[��[�x[ť�xDm���C޶����4�LRY���D�Z��᱑U�¾�@���s�04q�16�Z��B��2��LtocI
�#���
����K���#=��^N
�d��c�B4�UL�t����Q�?rÉ![���5�3,���WoZ˄��z~_��|v�M�֙

+���O���=�m��u3
���P���+N��M}�k\8Dn��zK��ɢÕnѩ&P��
����ʊ�f�^�����k�D��ۋ��[��cm�],z��f�Ofq��3�h�IF}�����֭O�ǖ�ܰ�}�o�W�-���2Z\�=�8��'*$��#�����@�
QD�)X�B~��u ��}'+�[y`����D&@���
���{^��
s���AD���
��4� 6[a��֖�v��n�B��]tn��PK׽i��]E!
_z�TqHA��#���b:�7������N�u���1pW��>�f5�ǻ��G&��6 ~3~�7x.B�Q��84�r�IJ|�
�ے��u��������buHr1ř)�e�{�—�y)�1ߛs�9	��)ȝ'M��Vk��ˑaz���۳e>�v[Ė�S��k���P2Y%�7h�qzޛ#`�[શ�RB���;���
�-����
�mؼ4���T�6{
b�B��4^>�	)��
���q�Y"a�qάӟ>Y����'f�{���!������
b@��>
M=2���~G�G9�ln`s��{ʮ����3[�j|�!�S���T��c�}B���:d����p�zi�&:4\�e�H�hܭ�������������<�a���~�Y]���~�S��d
�.V��p0r
2��c��~l��E�
�,�%�G
����[�>�͓[��ܮS\ے�fp����a[ɍ��>��M+1{�b�a��G�-�J|�6V��4�	�>ɯ����;����E����+�|�;m�
���ۤ��m��T�=s~�!�(
�~��x	ٱOHЇ���t҆�����Vap)g���KȦ٣o/���d�0.(U�y�Olt�l�&�E�έ�T��w��s:B7�b�j+Dm�7���(�|

~`����b�B���w+=*_�"@
Y�j��o
+�4
�9��d�%hl&>=
_߼��%��59�i��p-�<��f?�_LC��6:��Y
�B�C��>E`T��î��'��O[r֛���DC�����I��>�%�4  x��Q������-����S�7���4}R�+�>��ߴ#�1��䏊X�h����}>�p�b��ru6�!�2}�!9*X|e��N
4갦�����`,����d��I�z�9pO\�:�ۖҎ���pC���
ؕ�'�"�2�$�j��SV1v�m
F>�*nȱF�U��e���a{ȸ�h\}���24�
W�\� OU��w<�NI�8D��xR���_�x@)�C�P�
��P*8��u���ap]
+�6g���>�S�W����v�k͘XCY�~�nt���y�|`=���������lZ�:L�VX�
�

$Z��r��-��	�iu�Y; �p�G5)���WϬ����۳s�0�jv�}(+�
1�V/c�'�W{�B
e
+^��:�Ps#7��4�ᴄW2yiw��7FYH�e3��|BxO�w�� ))�F���)�I������
3-V5�i
E
�]鐺���v؂
��A2-�D0��#��F��:X^�f���i�f�4k:f����X����5�I��kZ��{t�?����
��#HQ8)��7*�������2
+L�[����+�*�rb�?G���,��`�)	&4�a+���T��]�<[D�.���64}��nfيL�?G�k?��r��2��U"jcl"����\��?��r��4yKGj���7
,[�}��"
�D?�%THn��J��ml�Ǣy?w ◣
+U:hA�O��p�WK�
��6TA;r���._�!����O���{q+m��h����0����C�h*��O]�A��:p���l$CD
+��U���qn�(D�J�;�9�y"X�>EC�e��SS��+`�j'���{�
l����A���
+��^�%�Ο:
�ͯ���/n��vN����54?g�2��Цw��H?��n`��Y�H)
G�S�pan�X3�b��3
+,�L�k�Ѐ:�c�ՂU
Y��D݄�xRtK(:�~�
u�CNl�G8=���eP��pF }�m6��E�*5h�.���R�����ӳ1�H�+���ۏ
N�pu�DW�:�U/��7����^]�{��j�Q7��KD>#�A0F���i��,�/SH���M1�r0�9"$^��dv$Q�c��m�Q
��4�УYw~i�
J�.ٺ~�"KTc�&�nP,���r�ǎ�^t8:r �킘dulo����y�y$"��j��
�����ͯl(�n^��
?
����n���۴�m�����I
+3yuq>� Y�S�^፻�aC��n+
FDl�����^�K)h
9�u�]����J���7v��C� iU
�;t���JkY�nYS,�y!��yХ^28~ݑc�[����EJ��l�(�Alk�e
��8��.������p���+�w�I]��=S\QU�wQ�t��I�6���m�� �
T�2�&r�ωR��`���Ŭ�U.*{�Y6�L
�$/�<��
���Z���
+�:���4.�?�_i��ں6����x>�^�Y��C�!!
�G�.,�c�U���j�

��Y0�ʏ�Gg�䦢�o��&�����?���'~n@���EӉ�8^�S��ha
Ie
-�C9u��h�4�����7tK��p2�v<�^���6[�zS_�Ԯ	}��pe
S<5"�O�J��'�������y��X=���Ro�6=��Op]���.
��E�4nr��4n���K�
¢��1�+�Zf2��:��}BR�b�r_�}p(�c��0%gG�;�$�^WH.�H-MO��ū��
Mߝ:o��,�^h��5��
���֞�.��n��cYG����Q�2�ꬃ��Y�e���	���	B�
�
g,��N�%<yT�RU���Jk�
��w߆�
B|m5��/�巄���
��}�scV^��ۄ0
��;!�rw$"zBPſV�ٜF�[�J��qg��S�_�諳b�:f6-ܜ�\�B�V���D��X����
+��=��
η�dg(w�����b�	�j��ij0�D�}S*��&��8�wa��ƈ�8�`�����b�ĸ�s0�l�5���irr縄K�-�a�s�h�U��g>����+��j�>;���������B�$�-~�b��d\���
.�ޮ�������E�
������`yc
�:���f ���HF�g���}�
+NI���Q|
�~n�؋�#
�,�V����
'��`xb`��8r��� C��ߝ�+�x��<X��nKI��e]��g�w	m���ըK�̋��=�6�t�W�Y
mO_s��ȶ<��z�ܨ������}�T�Px���	�m}�9`���'m!�?
\Q����PK��E�8�z:�bYí!C*	��x=
ԁ�KCXL4q}�lWW	�ބ�}"i
�į�
�	
���RZ����:�Z�=��v��Wp�ɛ��4A˨��KD4�u�^X���9d#�(+k��(8��}w�vҀ)��GU�<jVOA���0%�C���:��!
+Q�̯.�x皕��U�J� 9
��H���Ѫn`��qcEz�����e�I��<L2iRAu8�d�e�c�	�!lm�sQ4N_T$+z���)~�0�3�Ʊ��Eo�'C��#����Hx,X6���zw���~���
�P�O���_v�MP��,~Ve#�Ud��.9
<��r
�ǒk7�Ѷ�zA�c0t3
�a���N�:I�khx�>����
��xɭ�u����2���JB�]nb$��tX-V�J�/ї}كo�j�d�\x[1�)�<��c9��X�&�Iy�U���7�e2Æ��Z�*
g��
��
�-���:Ĥp�V�F L���ڱdJ�턵���8Ba
�Xxʮ5�J��i��̈́>���\V�n�/�a\�1:���מ	v5=��TQ�x]3e�9�JSU`��mY��)(Nv�b7w�Bz�eM��w�(����#�H�v-�
���K�<�.(�G
0�z�W��R|���<�j{�@rf�/	�5S�|_Z�v�3,�
��Q�Ч���,�ߐo:�	c��z�Ȳp���!%;�

a''����)
J򇿿*���eXy�����\siz��|@��TlL����S��q�6Q�;�p��z�������nE"�
Ǚ=T��T�<�"~����A���H�J
~�%��Ц��)r�	�N��"ny���{��U�C�ԻQ��n%�}�K0T0�מ�X���kO��
X[�R�D�h��Twj4i�M��~K##�!�.z�
5R�a!ʟ�B]'X��A�00�������\f�=S�nh'�h8[Τ�
���q�ݜڃ��X/���j9?�J���Zk:p�9z���
my �_�g�E@=KNc��i��z�d,\�N�S[B\�j,mPU�e��h�GW��:M�3֣�P2K����]t�l��RPʷy�i�'�?촕���
���-B��T'd��s��h:������ˏ��Ed�}Hw�%|T�D��
��-�J��CL���3�C�
+�nR�B�;��AC��~×{�
�\(�����;�'S��s��GC9��Y���
O�>�9�c���}
q�`W���Ski_>A!�U��

��K
>��\� �M�Y]Ӥ3�F�;X�0�\�]1
�'	���4����h�^���#%����U����IOc���A�`�ʊ��������w����
�t�ec��� :8�4���չ�i*�̝�1(z�{$z�B����j�ͯ7璕�48ej$	\���*�
>�����줽�J�m��y^R�r�U���V�m�����R.��GS;j�3#�c���Y�T &2
B6
I�uQ�TU�����9�A����:�1���w��ր�}�(���a?�tx�D�ʊa-w�IF��-�r* .9#κLe�$b�f��M_.���=��ì����
8�J>�@	��#�\��
{�E��Y��4�k���R��R��EE���p��3�
[;NJ�~Y�zH��F�}!
�$��ऊ�|9�f����NܡC���
;�W�n�!fӪ���ف#t
9�6G�&���~��c
$�G�S���[����8�鞤����c_�<�V�O���R
,��i�X����P��(��_�i���X|@N6G"�S�JA
�i���%��22Lj ��(H����'|��E�Ӄ긃��F�����ʍ�0�yܘ�&�QON9���E�$e��UH �@�������WQ�\�Ԃ� �1Գ�Y]?\���n���b%���6�^=���0~���%Q
0��U�<�X�E��7��Wr!�p���
� .Y(~
+�*3�9�2�OI����S���ɨ�I�q1i^�֋�\?��%u>��6�V���'�JŐ0�?���ᤨ��M�4�xVo!�(��ʄ2%\ZƎ���P����۔1�D�҇ �go�1Js{�Vi���?^vg����ڶ��6؂���C|7����,����PW�\wA��)����
����-W�;��
�b�x-�k�dp]_��AS�?���һT����i��n�^1ܧ� �F,�
)��
7.�^����t�;�SR�Uo�܆��x���*�t!
0�,|J���e�8�2�u*vo��\��_�$H �#�

m�����6힜�.{����y����9T� �<3��I�M��e2U�Ʋem�߷�4 �6�s�� �^����"�o�� ��
�>N*S�"¼�m��+
�����g
�ר��<=��j�pnF(�r`�&���cf_�o�xQI��%ɣ}��GM������rJGuʓ:n����R�USY�sX�M��ʲ2�T
+�$�>3��+Om<ő�D5���>���)I��@����S.I��@|�9e]�b�;�
+�
FD:	�w�卍ϙ-ç\+���2��ఠx�y�gxqov��wN-���wX}L�We����H�_�
!.�\d�!�
O&�M�z�	ʮSs�����-J��<��j]��p��9��/����he��I7f�it�̞5L��fKC���=��nj�|�<�kX��#h
D*�!��&�Q�T����0ߍ�+�h�|QӁAG�l=����mN^�SU�2�����@����y�V������گc�^XY�
+�5� g���K�*�e�H���ɅZ|
'��a�9�Ig���秜���_f��@��{ǍQZ� /����*'eL���J��Ks��Mߕ]L�aVZ�m��n��`Z4
�Ԣ'&�$,��&Cx<�7�q�o+:צd�/3��2�`.{Gn��:j��|�_.�������r�x�@�f���0�m�s�8�I�n�w��<&�̛0�?[��Ւ8K������y�
������	E[?�A� �.��F�
lm��
Jc֛��H�zS�z��{p�$�,�v=��|B�==Y��[cO� լ���:
1�W�fǒ+3�Jpӄ廪
��^�,�q}R���
��0�_3�`]�>Q
!��G�^Q���R?f�#U�$��E(l�%����L���w���'9�*�~�&a�cf?��0L@�

+co���1B,4��!
��L��!�� Bh��t��Ӄ؊1"�\QT4i�M~��y�"�
�	�xe$��ݥ‥�Nz�"
�s���Tw�(�
���3K� X^���U]U��_?��
�DgP.s��M1#� �M6[��mP6���4T�D����{Hֻ��8��OMy=ߪ�>aP��;'��M�
�!M׀��S��
N4Cr�Հ�WF�+�Ȁ�X��+�wd}�$���/��![
��#Y���1��R�	��W;���y(�X�^2�Uk}�M�p��	��Jwk�'��N˟e)�Т����~!�:7������n����H\W��o&�3=WkN�<�yio�«���_��8H�P�1�
�j/D�A�4������1ڠ1��Y��U���ݗoƮjҫF�ج��sD���AW���N��
���,���ƌ��Xuqb�X�l�����7UWh1
+�
n4 �?���G f���	
�}�
���\wTvU>V"f���tu��\�
4��������Iϥg�[��L?M�*��)DAɐ�`��q��'
+��
�s�8���F��:�'ڕ�1-_j<�����E�J�8�m��B1GG ��ED�
�HqM7ۺ.�H���[>�ES at L)�����J�%
�)ni��2�Y�rhI�8:��3�����Bz��,�?�$@h�d�3�/���eƄy����t��2�?���KlQ���ꐍP�Qz$�p��ʪ��KD�� �xݗ�TB�PS��>�]�•|̃�oUU�M�r�i~�"W�����Uc�k���?>r
��́���&4&�q
�L��B7{��m�ĭ$zè�����t�k%
V������
�����@��T�8���Q/Sp�^c I_�q
�1]��\���/� :U�n�F��ߏ�����	������e��a'Z�����y��SW\
F�3XՎg�6
\��/�l9a>�j	��G
���كAk����'QƭU9>��}����[(����\����p#	C���Aw��T��ǎ��Kd�1��D���	����h�'O�)�]E$z����𯑏gp�DJf�����"m
+����Su��,8�xdN�c�2�Y�]�g��(��$��t)f͌�W��.�l�"y�	U����p�A�h��>��S�)-�
�b��f=I��_�4�w����l����.�';���
�8j&�\�Z��^�Ѻb�0�Jf�e謏�IRo�LN���>�@�	39Cyx��ܽ��Lp`FJ��Q��*o�屌:��>�Ln�]��<$,�3tk�������Q`m��*�Ŏ;��}X��dzo�����3� R�.Ӟ�TE%��U�z qQW���C�W4�
נ���X_�W�
�^8.q-�rN��+���0�l
����"�
I���G	�a.4����ԛ4J���P�&L�S�����'�k%�����7»��B%�=�
`�u�6�x~*/�W���h�!�D

+��ٻ^�ꛊ.|a���1>�W<����ݮ����ν����:��Ҡ�ѱfx+�>	��#�_��+�>�G�N�Q�t)�q�mݟy	b�{/�r�s訯ʯm
8U���~ԍ�♁H�ܶ\
T�1�F{��fE&�H/�3��82*�AS�|V�؀а�x�>5�Y4�?µ�^F[��F�a�@�����d1�����U����2A���]��3���e��aa�`�!g��;i7l��7~h] ���-yPm{W�J>m��M�'��}��H�APw�v� ^�rEn���i{��\ ��Q�� �������p�����+���
Y�5
��6s|��+-uhID�!\��R��Оx��?p���i�"�5Q�{�TfD1��9����V	���@>�G�Ds��
�����,?��Q��d�10�g?
w�g�>/��c��wL}�5|�
��٤V�T3^����=�F���M�
��6j�e�ߒt���!�M2f�6��K�c|��ɀ�]鵚O�� 2���r���
fp�!�Jy�hGm��̶�Z1+3����r9���X@�|c=�O��
�M�����d�t��/�ή2��S���Z*�P�׻ )+�2�=K�30G��i	J�H�U��7�
k&�$��Nz�|M�*�
+㌞�͢BۍL��#lᣇ ��?�{��[1)x�>8S!�'�]h1��� �n.'�
�g$���_!2�/�c>Hx�À�M(��*!k�%z0��qWئÿ0��̕ ��J�� �
��=�U�k%��n��2C��;�  ����x�Q�����y�3J��U��
�qI?�E��Q��+�~Zd�m@¥sX9Q�[ ����������Z���D{
��n�y�sh0Xƺ«j\���{m�}�'���Ҹ0�Ɋ��

ۋ�g�]F�B��j���[�9���R]G�u����V�"�������϶<!�OS�O��@�:A�{�O�F~��.���M�8�K4L�a�{��j6-�	u
l�FB��)�6�fM��z�����O.C���߂�y}}��>?���`y*��o��P'$�«V�|�`��;�V����W���ö�G�[�++g`BU$�>��c�k�e���riF�ݝ
d��e�a�k#I
_\.��.<
�o�D*�)��
��7�QI+�(��O)�VR��>�$ "��&�U�t�"_��[�u�W ��i&�`Y��j�D�~
�kmL�L ��<M�49}��^�Ą5�1E�y��
���5�p�$m}�r|����yb~���b�IvH=S��a�X\�8�Q̭�2�
*�
wm^�͋��=fBS��s��FҲ�I
+����o�z�Rf���<�khEI�_��&����
i�"\C�/ơ����],�_r�AS�&���/v�:O8��r�[I�
ץ����1�WӴ��(%��� �
MZ`F~��A>4K�{�v��.�e@'J�.���2᱌��)�i:LuV>Q��ra�0���텊�" .�X�
߿.�˚
+��x����c<^ȅ��67,�s�V�aF�󿻵���x@��bױ���\�4�@�i���e~?RL��İè� ]����jR}��m�ЍDB
�NJ\���Vf�²|
�.�
�T>"���U|?��Wg���n�w�@%@R_ k�d�A��c�qPuJ'K�_�U(�@�<�Ԏ1h
���B1)�X�vE�J&C�v�:H�23@�
��㬔B�B,�C�mH�Y�B_A�
+g��i��0��Mp�
�۷,
&��h����50�y�|-]��z��~Ҿ_N��{�4s�`��@�k�`B?r8��><�:3�d�R%j]���E�b�b�sܰRѧ���ꢎ|�%��mv(j
ݕ��@"�7t�Ɛ��-�4��&,p���J^S��*IϕLm��+Jqֽ��)�Ƕ�jw�B��9��*JS�]���%��5ZC*%�I�@V�H �����;����k>�m��t���f�2��E���Qw�m�����Es�wX�L�
���_�B~�i��m��(��м=�G�B6��]]���~�&�����j
޲p `rچc��
�2WYp*�SUKqV�����5�
����%q�E������y8�m
�X�
Ѣ�_�.Z���yQk ��Ϟ̨��:��O������1�~��k
S�P6lB�9�ܪ-���r�ٷh�W2�
�~Q>���x�"���B@��)c�N�s0k;
�.��bT��=�5-
��l^U����+�IbM�R���3�xI:/�Z�#}U�
�&u��e���'��G.�����'E��<�I�]���m�@ρO�O<;
t�b-������FI�j.Ǎ�����IG
S1��|_n��ׁ��V�8Y,��#U2�xv0
+<�}��Q�Q)B�B�����r)n�!%^�úT��FVc�*ހ6�r~���N��r��a.�h2P�Ț���i�io��ΐ�Q岌y���Л7��M� �6����q�T{������9%j�5��G- �jM���.��
��7�ʱ�1�X�i�Ӆ���j�wp'�."ń3+��u=غ��C��.��ћ-βd�3d�K�xA��ah�b�Pt~!�����d�ͼȣ7b�^�
��(�pa�.���u��t�qBkj�G�oH�)�'{OV-�-��u��>��~!�:nzntp�
Ԯ
�5�@U4���V�� ���k�ٚ�qg�r���i@����U�����
�Ɓ��Q|�4c��
�,}�
�I�'d�
ͮ�p萈��A�u���Ň�(�Y�I�����#<@�o��r�¾����7J�1��ْhSy̻A�Ig>�
_����ߒ�
+�?F������޼Z��T�C)4������78��@M*�04v۸�%����9���7�`Z�Q�@�*!Y��Yf�@�f[*e�$v��?���j������eh}6��/=(3}�����V�#Q�-{
+p���+���/��Q
��$���C~���U:q������CJ��:�4�V��<��`��ܢ��D����X�~M
+�~�B�i§����Q��ד��Z%6��F�'aY��3
+
�Wm�⷟L�Z71�3����Q�?Tts�`�Ms'��p�q���4$Q���2�䦘M�`����݀�
�ݔ�
qϻ4��y�˥�Ũ���	���|�f����[R�5%0�ث`�@͒�E�mT�X�O��WuL�N�V(�O� �1���}Y˛���2��=�0�0���(�PG~���A1�@��c�[A��r���oN����s�پIV��M�c�"� .�4؜{LG�)���`KZC at .!	[H�bj�z^t���١�Ӳ��^�P/��T0�҃.
�od�`��\ ��6�����,�Y��2q���
!�oM!׭��
�^�Lc���c��E�а�m���|�
�����$?��G �"
g�UTa�'\'
���v
w�ȣ��Ǻ=�MX�E=�f
i/gl��mj�u�)�ݧ�/�Lߚq�D
*QG侸��i�V��f{����\��`�8�xT���<�ʴBRca�ւx������*y��\
+��l��~�Җ����07�3�����
t���ꧻf
+:�A��� �#��U"��m$ea2
�"~�
Td
=]�t��9����V��G�Z�6�^S�Ƅe��;0d�@0�\|f�D}
+�R�&��.�mb��Ut������A�x�'�e�ˆuؾd-)�}�g�˄�Sx���u���{���bȗ���<&��A�`��

�rIG�����'�z'OqZ#���G�A��
�^�
�EΩ߻���JB��
ܮH�*edM�PQ�^f8č��[$Kɚ��Ym
O�>w�o�K�k�\�mځ}�
+��3\�<�W1e�|]~�yK����ʕ"x�)�	i5C�F	qe(Kj���d/����j�Y6��ݾ5�_��r�G���
�>��3�Iw�n��E��^�{�:k��
v劄<��
+E�Q
���
��W�c%�:ʫ�>�C
ޓېYO��:�}���d�T��;X?�E���D� iK`�0[�׷Gp�r�I4g��R����f2`ACM[UIѢ٩��`f�
��+���
��+|�N�,!�� �r�蔏�|g�����Lb�ʼnk���1���pW�n�E�e��(Ayr����VT� �8<5)�xχ��;�xs�QAԧ��猖�{N-9fR]���<vZ�6�

צ�J�a_h��'�H��D��ۓ����t��~�.m=�W)dB��t܇P�J%U&
J���#v��
BvNYu��X�?>���'ּ�
|�����k�o
%�+A�����ը�M�0?�-y���w;?�����9��I9�����!m[ш���zf�c��
+$ý�N�8�"�|���I������ʱ(��勀.�����l������e�:�Z�(T&��'j��P�LY�C��!��I�~@�Z�u
�"��UV���(��r?p)���!^�p�f�<>�a�-�\	�g1 b�~5���i<�8d�9�,_�x��2�F3k
+��2f#�h���ñ�����&ʼn%����b�
=���a�
X8E�E��>�ҫM�{(l�"ƶ��������z+_ sJQ8M$�uۙ��(�欑.D>i��es�����T���E�l��iA�?���L�ZtZ��KD������t
��|������Fva�Ȝ\Bٌ?��hm\D
+by����Ƃ@d��{-
3�"r�����]=W�40&՛�
^^
�ՀwA����~K��$����2�8IUe���-����N���.^-Uo��jqE|̆P�%���S�`tj K�n b�ܝ�K'}����#j(rVV+��o�f�`:��X0�K��	�
@N���g�{j��1榠�P�u��@���%
+�-�xM��<�VB�����k�jc��5׮�wa9���c=�a�k�g�'��s�wm_�����O���^�0`�V��|��r4�#��>^��
�.E}J�@�`q���'sԢ{�.��G�� �}7��L{
$�F�Nv|�BQ-ֆ?��a""��n�
�r�O�(���>��U�.ȥ����5z��N�_��_�z��=7v]}�|Q?�d�@5�P��iE
+t٘J�T�Qx-�ya�#�JꨝY�z�q�_��N������'�7(H&f�H��w��]eW$�D	�=��[�hg�|xҼא!}ǿ"�r
+��T�OX��)�{dN��������~��F�ɰT�B _T{O}
��X��A?�3$m⋢��(6�}��_�������{�-"�cNx_�X]Ge�Ʊ�'�n��X0@;�7A�n�|� �w��z�p<�(ۺ�JI*�I)��M�

��
	Y�Y�
+�bvo�nF�n?-�0�n at .��>��>��;���$t���z�m�M�1��Y��)]�"s�3;M�

�Ux�+r��\�Ϫ�i��
�&�k	�j�N
���F�C@�L?u��E�
q^v'|���9���	�@��� (��Ê�pt��9��d�9�k�D�m��@w@�Qta�xUe��.d@;O��l�쫰8�JL��4f�0���M�մy|�J�y2��s~�G�a��w���%�.¡u�5�C�hE
�Td����Z#�i;��͹|�Z'�E�'iW����^���:�j��
��/.ɿ���׬�s䉓�*��^�
%�v�
���̘�l�DF8�̋R�݁ꚽ���Ӧ�q5�.L��F%uP��X��aa�6�!��H�����S�
�~n.�C��.ݕts���e��
n�T����jѰ']@�[F���YU��݈�x���*�V��!���. X&��䵭���@��_ͽ?1
cC�
��h+7�œ�~�+�;� F�y�l�.��g�D_
S [...]
+����X����.˺�U����4�~a5c�Pr��@�G��Ə�J7���Q�cv�T��~wb��}�"�r��k�Z����Mw��,
��67�C��Mb��
�
rC�~�]��
�h�rɼ<tgOe5���0��W3��k��Pf�ˑ\
�li,�<��?�����%�i�;
�
L���C�O���uC-��2����L����N��
�	1p�/��Eb�P ��h��E��ү�&US�<(���˙��'SJֽϻt+�󒶀���(5k�����I��b��j@R���)�h..J {Dc���5�j"��'
o�l�_�ÿ*��
�7���ý
5f���W1��_�3�
���E��`s���Gǃ0R�u�?

;]�"��?{u
�J��O|j��6��DA��?�2;,�_�Q+l00'��8�v��\�U�e���s`L�':1Y��Flx�sz%̝����	����zrLaw�y���E�
n_��K9����R/��{���5Ӆ��}��x����5�
��}��r0m����ܜ?mn�I���w.%
�N��U�1�rH^�r�]s4�k��}����=�:@|
+��TbA}(*\��vB������P��yP)7��q�$
j��-�.���&�y �\��;�L�`�Z�
���o
_!	#]������ط8��A���z�j�p��
Ҙ4
,Ū�7f�|��g{5�r�J!x
��U����$49�"B�H?J	�ؓa+0='p1����5{���Zʘ�gS�yC
[U�4��������@���ڂ�o��$��m_�rQ��S}�zt6 
*%��d
+�C�EB��@�{��o�]��V%�+���d��$�s�����:��K����.F�^G��;\��X�6-�%�Q�/�ρo�XR�c/���?�u�L�E����s��{?]�kbCWڿ
!����)�֑��u����H�����'��FX�.��� �5
��|f/hs���:8r�J��B�G*>
]5p}P���
�t=?�z��b�5LD���Z�V�2�
���Z%N��|��3%�w4~V-'B?6B�_Ɩ>�F6h��8R�q�K�Lf��z������P��}���F��?��	E �a�L�eP��^c�Qݸ4�Q�q��
CH?C�+�M[�=5�9jXl	A|ʨ��+��.��
+]MD�Xv��t͖O�Wu�O������
+u�E��C:P�8XE/{;"����蕳/�C_�?O���U�?��g
��b��x@�/[o���̔ٶL���B�N��.�ޗ��
��Ƽ�4��iH{
J�g0;��Z�w�6�͑k
.��
����Y��%���!�+�Fk��m����|�r�
+7]�<���� ��	1��!v����fB�fH9s	-��z��n����x�
�C\C
r���(c������lj��
s��% ��Y�Z���`�K��bd�]�gdQuk'�T7����I1VZ� � ?����+�3�4�	��7紦��٠X��Z��#�YX��]�iG
W��
��
�\��}��
T��|��-�I/Q��
�ȍ=d=H�yR�6���
��㵮�?��4�Y�E�� ���	v��驺P�����:��s]6@�hGq�m�s���7Bʽs�{���G�ۧ�z:!���3�����0�տ����&�f�<�>0�A�8����$���/u�Dٶ����2��="��r)�v���0/
=�O_�k���i�ho{S�P��IO��q��7Y/?���&#�C\BC	#j�b�<�`�������#b���Ѓ�!K������ 
�<4����R�
'*� =��_
+�n��OSx���,Eו��H��=���6�������P��I���gl�4L��������?[�S�%Ri!O'u���
 ��"�D�K�3��ߐ���X7%�
�ن�*�^D?��'<YP��>����
+1�܀��q.��uL�Wa���[
G2�c�p�`�#��������:�W?�d
;
�6-��m�`ҧtU=�X=Bo���'�b��"�u��Is�-ۥ�����X� ��øY������U��SW@�5dv��}�(�2
+�p� ,$r�������9�*����)�]�8��ho�o�HӜ����9.�	��5	�y
}G矴' k�ov:�����-n�V4��6N�vM?�\��p�\!`�2����aƫ^
[�}*����� �ҜqLuػ�?\�h��:���:�<�8"z�Z�S�B&��O�J�}[D��D�=�|��6[
u'�H�ȣ�^N���G�
+
+���u��F��b�{0f
�K�c!�^
��Cձ?�bp�^�2:�l+�[J��2�0i��㡩Q_��ʠ\�Uo#<�2;;6��4Z��� S�!��y\��8��
K��/BÐ
r^��7+YQ�66��%��]F�S�?���0�=)����^�y���gX6H���3 at RX��M����u���r�-�ǵ�t{y�,�	
��x0y.�SNA�~�]��D\����L_Uူ
�ʐ���
�-h�/�h�|%w�ҥl�LN$�"
��z~7�]����j�X�&���>c������dG[^pBo]�5G��T.��1�}��
+endstream
+endobj
+18088 0 obj <<
+/Type /FontDescriptor
+/FontName /EERJVP+CMMI10
+/Flags 4
+/FontBBox [-32 -250 1048 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 72
+/XHeight 431
+/CharSet (/A/B/C/D/G/I/J/L/M/O/P/Q/R/S/a/alpha/b/beta/c/comma/d/e/epsilon/f/g/gamma/greater/i/iota/j/k/l/lambda/less/lscript/m/mu/n/omega/p/period/phi/q/r/rho/s/slash/t/triangleleft/triangleright/u/v/w/weierstrass/x/y/z)
+/FontFile 18087 0 R
+>> endobj
+18089 0 obj <<
+/Length1 1438
+/Length2 6052
+/Length3 0
+/Length 7022      
+/Filter /FlateDecode
+>>
+stream
+xڍW4������n�����j�ڻ���$$���TQ{oB�Q�Z�F��=����j����}�����{O�I~�~>���|'���F���p;�
��
+I�ut4�� !!!!abNNc(�򗞘�>���a���C�0:
+��4=\ @ P\(!-$�������<�� 
�&
As*��|PG'��_� .07 (%%��+
��
+A@� @�r��b*�A. #8
+A��+��
+�&-(���% rE
+��r�| /(�	`AB�{�O� ]�+�4bN����`w at y� F�C`HL��
� `��4�zn�og��|�?� 
+ �N�'�g"(�W0
����`>P�#���i
��Q| ���#�	�ă<AP�
��W� ��� �A������H��O��?�`�Yf�
wu��PH���@0��}�
�!
���Kr���
~°�p4�A�= *|0*�t�@LHRBDR
 q@��N�?
��A~�?�
~np7�$ � ���!A� 
+�	���K�@ �

+F� �P�?�1j��o3�`)�� �����5�a�p���?�F,h���kp��俍JJpo���/,& 
+	�$0����	����V�ӝ�?5`pL��(0���?����7܀�Ѕc
p��+!1!0�
��ނ_!��f�?���
�y����s�v�v�+�����
(�r��1+�OWS��ց�C=\�Ӫ�a�D�!:?PT at H�
�T�zC���(��o2�5
L
(
�GB^<�(!���av�s� 13�m!1���5ޟ2�j��C����Ia1q � �c(��� ~@���C�q
 ( ��0! 
� �
A�s��� Aǟ7
�0��:!����&~*�U
�@`��EL+ɿ��&���eœ��Z��(2x�
���}7�*�!D���>��`��5�U�6��f�ܡ���=g~��o��兏�7~�uG�g�W߰?%��0���5a囦(1K� z���;���
{�8����uO&zݾY�&�ު��YS��M�(u{��l�o�"vD{'w�5.t�UT�n��l�)q�W5�B�@�,�������!+{
(
+U�~FQ������%�[�~v�T��F:�������Iͻ�V�f�YQN��[�dmk�N��S��P���Ol�
�����7O<
�9��[Xv��9��+��ߩ�� ��;E�h�*���i
d�*�
%�X��I�:0U�;��� �=\�::�(������a}����~�`���ɪ���
D��/���dE����P��+�TARr��N���M�|b�QN�u�$]����	wO�
%����k�
ˣ�$
˷�����R�w�Zn}O�l�4>V�u�^
�j�)
���=�ъ����XT�H�}{�|�1}l%,춄���r�
g*\D	�L����|���JȂ�lӭ#�)����ÚYOo
�5����8�Wz
��BZ�E(��$>Pqci����*��f{a]���M��g� �崿K�x�J�6 '�d&[ÄS�1��ڌ�S�Z����on�Rj��t��O��Z_
��W���{�
+5�p���6E�G�+�!�3�����T<�
+�M��7D
+sP�ۻ
	ӃO
�
`�'�Ác��"�֏�e��;���'&����'��ʙ�Ƶ���h�wb�
���-�a�Ĵ�hb�4�z]^@B
�a+�HwyRl����0_��j���"�F�xM��U��
V\��g����ڴ
+Crh�%Sq��
��ܔ��,����b8��V��g�
��d�&O��
��M����M�>�,Ta���v.��
�y�_���	�\^���=r)ֹ�� J�>�����	��y�bq�
Q괹��Wz�

��O��F��H�L_&ٹ�
��HfqV
����
����
cV at sPtɚ)'lΆ
 
R����ꠔE�U�u|��"��>�����K������+�2c��	K�K
���ɭ�����r�c�
+�w�&u������|��I09k?���}�+�T
+_�5x��K}�n��aKiӞ�:>� }%�z������!��5�4�E����ym� d��m/%�h��2#�_�-�����u*7�8�
l2��
g�g�Z';����2ߣ���!į�C c�p9�����K� j��y8�g�Du�9�+-�Gi2��('��r�>DOpV���tݜ	�=�Z�'@��J#����Z�$���9Tr�IS�h

+>$�m��o�,4hꖆb� Z1
���k��b��
|�3hY��������pI�-�t�}itW��gӡ�
�+ň�!�ljT4*_	�AKF�.T����aEH�̿�j�Թ�A��9׹4�	d��Pb9�|��ְw���S� ���@������e������A){��'� 
@�¦̭8Qp�IQM桓N/��h&�0�k[�RA:_xM��>p��_b=
��}Ǻ���
!b�L[N骔S�\E�1{��ᫌ
�b�c�^����l|ޛl]�L�b%MZ փ�����y�g�;7WO
YS�6��+[��[�T�,�l>@����S�MF��X5�u;���A3+��7_/I8����}����I	��\o|���˻j�.ja�
{�
�
H?�d;���~8#�U�9�s�Jn�1�L��m�Umq��@o�Q��6ix���G2�E��o��h�����h,����+˱T�x=N��`yW{

6�|p7^��ܼc����T�f��������j��=K)��4t3S⚒��#�Gt^cɮt��3�(y�1���H����x���w��ٿ�.���NtI|�Id8.���K�^�"
+�5�
��v~���m�
'��!�Ti�eM�k�2Ұ;����0MI~üIk����5�2�9����#ה7�I�f:8��Љ�d����S�����N=�f�b��U����
����
����
�\��g<
�
���=+8p�{�&|�e�ш�6I;_
'o��J0
��p/�_ҖF�%4Wf7��C�G'ih}�"��N �t���Ać�Vx6��j`(�л�`g��P�޲�n�y���1��[z�Ru�Ih�fAN��+ߖ�[��-�UBS.Ӟl&±�7%.�B���
r���w!�֞�v,=�6nsظR�B�C�}����	젘W,��3*�U+�j<,{�(�/���l�Bo��;��%_��"�MA��C���C�ӑ^�[֨(�ݖ�q���H�Z+[�B���%;��{������
������IL��j��Jús��Eu�l�U�'�>!G�t6˱c&E��1蝠OO�i�	74����?l��
��Y�:V����*˝�M��
+e���
;�]k�C�v��5���^�]��"d�0�:�
�%�5���C�^3#0P0|��a���{cX��n�[��k
��I�
���)c#�]���*
%��63 �\�c���9�M�#�4�IƙI<�x�V})���[�]��
jLzd{��LU9{�����^
üdYMq
+��������	��78<��	h���=N
+[�.�k�
�V
'�^,�Ÿ<�B'9���p#
Qc7�n~�%4@�F�+�
-ߣM�BQ���`S����C��NJC���B�(��}��izG����$��u�[c!�}v�Jj}��w.폵�ɸ �;�f\1�I�`�F�腾�20Fxm�^��Ahx�Wj�Κ���/^o�5��,�i�:VP(��]����z9���V�k��х������Z�B؇��
7�������dM�d�+��+��|Ƴ�X�o����#0k֪��w��E��T���ndI4"��T���f󍒺� 
u��D1�
��
+DХ���q��	�m��X�u_�X�`�;����ʩrg7��1

+�&��R��}��yt��/�D8!�/oN
U��o�Ҫ��m%�ow��3[D����%ϼ�~��^��m�o_P�H}����B�6�E�vt��܊�Xj]:�l��`��~��bHa�06���{V��>-�l�`�d�o�Pu΅���չ��Z-j*�X:z�l���TY�i�q;}@�w��:�^��eV���<"!�mC3�
[��J
���ԾrNS�kL
�x	�r����-oL��;
r�0�D
i��
���ڙ�v�w]��A�("=���ް�*cr������1��8�i�hm���>OhD�{�.ܯlOHB����C�
.�:�L�?�Y�%���e���K
J|/N
u
+)�lo�`�3$�
_?������H�K��֫�)<��hn�m=UDL�$���a �-�nّ���`t1�3�5꩔gN��BźCzY�=�q�9`����L"T+x4�<�b�G�Ks�(gv8�ZrO�����Ԝkx/f�S;]�h����6������F�E
Ԕ/d��l&Ɗy�R&+��
�\�fq�T�
1���`y�c��ʹ1��U����mmZ�9�-	fgd}א�˖�
��$Q�Az�+f��Z�=�l2�LT� ��-�a�!�e�"���e���O���TW��"�`r�Őj�Q�w���2���z�6x��9���s@�M�b���೽��z4��\�W$j��
����������s�⢰>Bō�g"��l)��I
NAtS�o�S�����
@�%a����s���.��U	{��\�P�/(��R�����Wķ]T-?��'��2
+�nqj{e|�0�J�Js)�5*�E?����[Nެ�#�O���`�W���������LkX)�<��+Gj���z��G*�6E�BT���FS�	�Ն���L��.�a�R3w��$���kR�x�]�����A@�]2��jHVZ���
ҹ'��{�Fc��]��o�S
+�=� �7q���&�XQ��&�S�\8#.W
+���#r"�s^�ԛ3���%�1��j�Z=>ȉ1�f�J�
�\zx;�E���j�

+��������7f9��q�w
��D^�Ǔ0:nJ����Y�}���Ɣ%�RjL �%��
]�5�ٲj�O>BD�_�X+�ͦ�e7l*�64�JְK����Rn��2��7K���>BvU�e��s�꺙�r��Ԫo���]l+#�
�J\X�\�K��֔)���-vΚ
+�
t%]u9Q	�箱a����k�}�/�:
+��I�L��e�<
��������l��?'���̛6�I�I]
ʝ�u�=� �
�7
�x����hA�
r�q X�{���xu�6|Z<�& 2Z� � ;e��z��نI����ַ��x�8��sL�����[5G)���-�|̢T�(
^M��
m[�
�cj�
F�.
�*x�e/��I�ڱ2&�"_=`���:�>�Y�S?�(�
k�g�5�4�!AԺDɯour��{��6qgLE��ǃ
hD�G�b
��	{h;�C�!>y�ַ�ү�83�e�Ė>>V�
q�xJ�e�;�^LѽM
V�Ux~M^¡3��U\�~2�'/ev^��͌��S�����~�
 �
f3C[����9}��)cc�
%���3|f
:�7*��Y��Gxx� *�AB_��ؿz~�����{E)k8ej3İ܆�	��{��b���4<�j�d��������,����N�aDJ��D �v�*��#&��+œ�Y{�������2>��˦Ix1/Ֆ^Q8�pH�)���c�–�mjKC��ͬx�����z�d���h��|�e+U��/S�D��g�
;����vVM;t�g:472����Ex�����.��q(�j.>)�o��DRl�V_s(�L��-�5F��#�7��0�M�����
�Ŕ�?�>ᓹ\8^eꀞ�w7��(<�3�"-����5�_��v�L���
��2�"j���Wr at g�K���d��o��MB�{G���O)4�k��%8Nؒz�Y뒯>8|?�/l��"�$���%��]o�5�Q�Z���\_����ŝ�i
���(��'MG������O��>L/�<��6�]��];��nP~�
e�da�/ͯ�]����A��;�u����r5�#��=@�{\|8���������]�-����ǡR���W$�J��G��ll�u�H� <�V$Վ���b���kn�vRH��;�x?|�*7o~.��{��Of��Y�d�E�
���Aϓ�� �����H��4��]��_�_��a�:��lgV�>g%�ÍHQh�*o>|d93I'�՛ϑN�GR��دh7�GE�o

4=xPx������:]鏔[{/����.
�z��~�4���c<��MpǴ7$/���w�L�Ɔ�.R�y�ْ[=_�<��-��O�U��j���'4J�уHd�[00�@;>�j2�=O2D��>,���H:M\�~A-�2�aˇ�|Mvڝ=������C<a
o+��@�.��]�S�Uur��Ƌh�i���J��z-��N�:�/L�
x�G~�:yH�qѩQ땳��DK��WH�������\
=�ؐ�i�\�n�(lN���пa��L�/�~g#[]�k�+�N�}�HD\��Õ�g����v�L��;6�xc�
$��`�9�
G��U�>7��}�Mwֽ��:�I>HM��׋P�A��L�
mV�m!\��>ꊷ7��*~}�w
g�j%��Q��F�MhQ��ȴ�S
,��=WmC��Ee�5&\�-ϛ8����N�|+w+�Y����
�� ��BcRHK%�+�ZM�ִd���{��B�h�����V��
��0��d ^��1�)6���9����z��<��6����#�("^�֝���<��'�є�Ujhᘟ��� �`�ˇ��YI+3�,���֜�i�dNT�.�sH{rw�
�
1
VT]b���)*+�U�\��nᒎ_=>�v�Q@��f�	+�r�U�4-��v^y���vx��l�s���?�%�2|��ȃcv!'q�{.�|������上ͧ4�h�7C��hL
�;	=Ż�V�L9���
�
�������G��9�Y9���]C)��p�η*�Ef+}>
�IW5���I�L��[e$�M���W��C�Y
+endstream
+endobj
+18090 0 obj <<
+/Type /FontDescriptor
+/FontName /ZGGNQH+CMMI12
+/Flags 4
+/FontBBox [-31 -250 1026 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 65
+/XHeight 431
+/CharSet (/greater/less)
+/FontFile 18089 0 R
+>> endobj
+18091 0 obj <<
+/Length1 1451
+/Length2 6815
+/Length3 0
+/Length 7792      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�k�.)]"!9�twww��
0��H#�]"-�Ҩt�tHJwH�?�����w�Z�Y���羞��^z-]vik�%H
+��ssp� d�Օ�\\�
\\<���z`��/7&���
����Y��a�<u(��� ��p
�p
�pqx����N��� ��`k�:@
+�b��B�<]��v0�1������‚l��Ҏ �P��@���� ]���W
&1;�I�������u��`fx�av 
�+��
d
��t�AƁIг����Bm`
@ �p [� ��
+7�5� ?
����tA�$��I`�u7 n������W#0�w1��
+���x�!� �����{c !ֿ��Px=�
v Z�~O(Hk�p��s�r;�\9\�� r�j�ey��,����b��O���_�'���C�
�
0���k7'N}��
�,�W
+܅����s		�
+q@� �++;�_��<�@��ܿ�p��NP'�

�l��az��A ������mars��V0�%�
���;�
��c×�~0�s������738�������P㹚�
������@_�y�<�\p��	�/�����c�������럆�(���������/Z0�%f���Ѐ¹
0�C}S.~.+����[ �K�o�����E��
H����w��w��
��%�����B

+�S
A����9�wT��Cb
�8;7�?�U�
+d��Y��!�߻��� ������__
x��ળ��U\����%���_6.��!��Z�R#�  ���Ąn���Ჵ���w '
+�� �}6P�_kp��r��~M�i��L~ '��N�o�_3X������M
��ۿ? �+����J4�eup�e�4�����a��s
��stX��؋�D��9�
+���
+�/�h�8_�]���VC]��w�N��eKm?�p�8��}AA;�׀�k�*C%R�҅�E��C�ڶK�
χ��c&Ƀ��{A����_��g�S��Ё5Z���2��p�
Z�6�H�ȠU�|���Q�����;O�I��Z�=p��Y(�@^��B���`>�6��}7㱷�"�ԮuW�s�e�Ɖ��ɮ
�s��z�N�B5�D�����D�����	�Sea��'����HBQhF�n�D	6ԑ��=�ھ�E��
^�M�垗N�
�|0X�X|

[��x��8@����=oAe��Ad�s(j�xho{�
�e�tb���P|��e�xb>�����N��?Oqra���Ҏ�O�).��}˂77>cN����>���\^?�
��h�
S:�LA�G�<�U�Q���
+
�c�Hdz��1�
��l#��ʦ����w�/P��·�n0�Ob8�J;�@{��]B
O���6���t#J��D|_!#5.}�$�mz�2�e-�x0��s[ɡƍ�GQU�
�(�k�}�&��	>���3׮�W�S��*E��
�(ͩ�O�R�!���y��$
+oHw�_g��d���3�q3^I��=(�C�a����N�L~�f�z���E;n�]"R�I��__��:��$o�Ɍ����%�&��@62]�[7�Ƈ�if�w.z����e��y�ғ��PB����]W�	sC
q��U��i��4���TU�����7s���^O�-<\�P�@Ew�G��C�����7RC��ls��X�1V�
��g\��<���h=B^(��[N�_i��7Il�2a�[.Zʿ!�\]1�"�
i�!''~��<X����C͇�j�˰�1���
�3���T:�K|
�@ҋ G!~����PN�#X�BM���U혘I�Pn�)����kef$�xK�&-���l�>L�!����CX��CCͱ�����h�9S�á��!t�4���[��m��Oc���XC,o"UZi�O�
�*r->]ln'�c�*#����k��$��Fac?�_�m�#V/;��q�~�?�fh�̡�h[Do`��@C����>�X��f ��\
��z_8��
A/n�V�	���#
+~�
����lV�\�
-�wT+t&��*2����o�������R���L�'�+g�͉l���f��k
]S޾�L
��~�YT��ŅpVo�M/k,q�St���(�흘#j^9���g��nN�L�s��
�~�Ͳ�)ma����I�� �7+���ݕ��5-���I��yĵ�c�g�u��4�
+���<<�|J.��_�eۅ�N�ҝ��5��<�ߨq?�
f\nZp����
�\2��~|e��B��O��ԇ��#;?�E�>f�I�>�Õ�DZ���i��C�}!׃3�z��Y^]��B~
�ҙv���0��<��Π���
rt&)>e|}X�8jl
�A4��>�F*�/�D14��l�K���T%�ܿ
�MDy9!mي;�|!�P.���Du�T�?�:��B�ً�u�|��
aZ�sK\����6�˒�����Ě暲�)��vK:�/zCzϰ�2�&dGΆF18!�hu��Z���f�$���� jX�54yO�;H�j�,Ľ�gls���6��
٤���k���L����Vgf���t'Ԟ%\�,1�[�jC(��
.�����=��E
J��BN
ڞ�C�Jm͑v�u�۫i�tU-�O��؟��dڥ,�	l��xá��ݵ�q�K?ı�n�zvTC�P��u���'�����R�9�L�)^�q������_Z��0[|�HW�O�s�
sC4H�}"��Q���"-/�w�:X�2+��X�7:{���@�<e�XB��0���czc5͏k���ͫfv��C�y��_�Er�p�r���i�L��گ�j
fU��ǫ�u�C�E!�u.6��  �~G?Z�#�]�R���@����91�'�eT��ٕ`b%�83/!���9�U
�e�
D�_X�o�k���)�\�
I�F�b�-^ר-�Y�VL+�uBU�E1Q+G묝Zw�j�Ȫ��x�@Q:^ͭ%�Z �d�<G볧Ċ|�C�+I���-��n�B�A���
��	����(W�sgo��Xה����wudt��0����Vd~8�
ɬV XI��7Ƅ9�pS�rn�^q�����e8��f�b�Oc
�������3K�
���|!��x��6�U֪7;o0��� [...]
w?G��P��O�� ����Y�����n#��r7��\,>3����80���1�Cl
SwR��y���o���5�l�E�u+x�a�u?0���?��͘#m�#�7�5���������##�+��Ҽ�A(O��(u!
��`:
6ui�C�x㒞Q���Ž{^t�՞c�����)�.f,�sQ$+g������j�l�[���댋B���
���1���{�l��%b��9�F�}�*|�^y�ҩEm�0yA����'yJ�!���
f�I֥�{j8cfm��O#��m�����&���Qy�է:�W��鎮H�����X��C����#-Ւ�/ ��dz�uu�q�#o�˃��%�Һ��lg�6�Bp!>]���u�����
�����nQ�3	"
�T[O�Zw�:
��N��NӶ��r�*

�JF�#�5�
+0=L:��G
�&�T�
�|���5�Q�b�3&e=��z�\�Y��������W�ѓW
�o�
�&�/,����i�*z�5D��{�U�<#��cUl��B�w<� _�z��*���c����}ʤ7��00nЮi=�ɜ���G�
�&���54,|�
+I�����g�7Q
�_�2����d���d�o��4Jy`�5� o�ט"
�1��ͫ0���x	��e��7U
>�TNbd��<�/�\��<rj��up
���+���(�4}��]Jsz���K
�/=v3�!eKL3��u���9o����*�o
��&]xm:���$Xk��"PY�GL���)瞪�D<�^���f!›z���^/�rn at oh=�P�r1�R��|����� ���K�����q�Hc�Y�
�y��aV[
�s
F
+g���#�vX�-�

��h���ҫ�`���/}�Dž)��'��骲���J
E<(�r�{��.�-���������g��"j_����%��,�
_�����'�C�O�J
��1�e��
�^�1�ݪ��-���P���K�9��u�)�[8
�ӯ��aX�H��y�#}d��2�4�Ϡؗ!�s[�5�3�gA�B��B�S\����`޵s�ɹ"i�縨�)��/��W
+`�;��L�ƕg�jX�t�
�&UH��8^"~�b2?�O�}�C�	�^.��|���*D���]Y������=�Ga�����
mQ4
�ۊ�#�}���P�˺;1�%�^~��*�o����#��l��~I�7V���Ǝ�5k��
?H������Z�PP�7K��?'o��kZ�]Ɔn�R�h�'�����{N
��
l6�^����B��]����a���n�ʶ��Z3��+	�����To������.�I�����F��U�s���ޚ$r�|�
�֥���k����U`]O�q��D�w���J���v|��z%G9ۺ�Q��վ9��m8c�щ�!�AQ<��A7ݠv�u�"�
+�1���
3NV��ʡ�'�;R��IT�;�X��'}#L��������&�m�ȫ�qR�����@N߯1��ʉx$��5�
YQ!)���j7lbx�4�
�#�-�7E�z�x�c�Alx����o��t/����މ�if�յ?~B
��x����v1�4�(�o�e� (#�1~pw�+�̜J�߭=�D��=ڔ޽0c�z���7��
+N��e�R�F�
8�
|����<�q(8�)SDh
 �4��@�5�VM�2��-��\�	��ܿ���vD\�A��W�v�A��
��	ȓ�9�ؿ����3�Lk�bRPg�0�
RU9�:j���[,�
�
�/�J:�+�0�K��1�	��H�;�{d&��$�nN�m���	�\���d���W��x����
&?��4� 
s,i�D��f���R�3T��Y�3O�[�n�TmUՋ����b�}
7@��8
��M�M'��/b��c������?����]+���_�
��G\>�a��p�b�
\���s\�_ePV�jz�b�޵S���I���
���gΪ��g�C�5Bю�B�p����9���Թy6'�!�FG%�w]�b�5-xH�$�?��1Y�fR�
S7��U,���U!�mS�l�s\�K�93h��ъ�"����y�^)�����2���Mx"sKԯ��F��G7�x\�</����:xފ"iOo��(�(�,?1���,Fu;6?�eFUx��ط��?��`��P����d2*�
���ѡ}�LtG��
���'��	�a	���U
��
+M������S�UA/̐|�'��j��������=\r0���n#�Ǖk.)Q���vM�׌#C���o2��|"����I��s�ඃk��R���������$'�8��_g6�;f�y9����f�$z��(����'ʚ�טK��N���py.��Dh/�
���JxJP�K���
56�c�F֮W[C\��Z��b�����m-^���ߊ�ڴ�5�K�tn�l;Z�9Ω=��E�f��$�~WFt� Z���;~�?3庫��{��ep��Ρ�����G�\O�ή�)
+�2��K�������NK���
'�4'm
7}�����!6�4M��h�|�3�Țj [?�a�%ӊ&���\+��N���
+�D��O�D#"�q���4�y�f�ջ�(�#tT�Ƣg�����ku
�[�`R��Ei@��2CI��L�M�w��s���w<]m�.){c�Ly$.y��
��ޞ�(j]���N�w,����3��M��l����}W ������;�ra���Z&��@���O��΅�|ӓ���E�Hu���@�?��=�M�
{� T#0% �y,$&��sޗ����%DK��B5�Tz^�'��m��]:Ħ�o�$�r&0�Rt@�1(��*�bC2���'���N�V"o�#MJ$����Ey"��J2;y�qg�=��
b�'[�*B扮]
��IEh��C�ѡ���f,~�k�ϸ�)��!a%�4���&����Ќ��"��⛫.�����	�Ź��1��[+�7��_$D\;�1��Ċ!�/R1�K���Uq^,���潛�M��
cJ�T�b:����ĆM���;�]9��
þ�"'�
�U>���s����q�؊.��+8tK�jC�$`�\��YВ.2��ʛ
+����-H�7�'<"ă�
�T��I�(��Y��'�}7�&�T�t� 4�Za��0+T�a��h
�%�?�'z��j�ڂ��
+4���ib_�(�mSr����-� �=���
��>�~݀
+�]���	�"��30��
���T���2t]zʨ?�cG���ɭ:��
נ��^��
���}v�#�
g�}�B2O�=�+����
7	�బa%�O۷؀�njC�8���"{��Y%�mP��6At�E�w&\ӎؗG��-���O�k�˅IO�^���1���
+�R����yB.\=1�M�l����%�f~�]�ɕ
Ќj(��T!G�^��ǫ�m�_�=&�:Q��6��A8W
/��漊�T�' �0.3����ͼ��'q�Qq�pz�'�x���	�ɫ8�(�<�?/�2��o9���9(��^KJ�]�]~/9 K͍��JxJ/��~�V��x{H0O�2��z��;@FƲ���p���9害
��P��-��/����i&Q�0œ|C6�ǩg�x���3޸��
+%O��:�� �[���� �R �j�����„�9J�/�
��Tп�>w�qL��f��W*R�a��B�����#��>{ϕ½`�Z<��Z@����t�5E�}gA��� 6��(�����
D7��'�_�z
�/����ei_��uVY$�w�3
�v謒R~^P�-}_k�ݤ2�f�y%��Eh�u�ԑ�H֧����YC��{������2~�[�X�o�
����
�I��4�n�#3�ޅ���W�'���]:2��W<4��}I>�״�
+�*��WnaX��|��,���?H�
z�ނ�>��$S,���{k7x*.��
��P��E�<WNm��¦[�ǩ5)��F��ʾ
6���e-�c�$����7q"��QN��\��
v��Y^��t���
�Wk(u&��p�]G��Q�I���
Y����I���iܥ�UTj�+V�+m����d5'^W�¹�VU���EI�T��
͊��]
]����(���O���ẾM�ߪ� �!GYy' 9"ϑ���k��Y?=���N�B:�F�FHW�2Z9O>�
�����X<%l��_�"�)�
	��y�>O��&��1ª7���]]�X��`��l�m���se,8&w
+yZ�ms�T��=̹���񤪛(Ȃ_,
�����[?
~�S�v���i��
�;������S4���Q6�*=
:Rb�
�V�ң�w�(ov�{��+��D�)��ќ�!᜶r�:��E�4w)�?+���-������b>b��W�d�~�
�xp���?�D1�
+endstream
+endobj
+18092 0 obj <<
+/Type /FontDescriptor
+/FontName /WNXLJT+CMMI5
+/Flags 4
+/FontBBox [37 -250 1349 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 90
+/XHeight 431
+/CharSet (/D/d/i/n)
+/FontFile 18091 0 R
+>> endobj
+18093 0 obj <<
+/Length1 1728
+/Length2 10259
+/Length3 0
+/Length 11364     
+/Filter /FlateDecode
+>>
+stream
+xڍ�P��-�Bpڸ����h��ƥq
\�k��A�
�!�;�呙�3s��W�W]��Y���{*2U
&1sS���=����� ��$�`e�`feeG���ClA����A�.`{�H8����$�b��`�w��q ظ��x�YY쬬|�1tp�H��� %f���=��J����liyI�#�֌�������;@��
6���+��KF3�-@��

�x�WZA+đ����ݝh����l)L�pC� � ���
�0@h��3@�
+��\���t^�`3��ˋ���9��
�!�Pq��i���#௻�1��
�/�߁��8��
�
���`{K��P�Vd�x@@{�߆@[��l
4}1��r @ZL
 |!�=3g�#ą�l��"��0/�,eo.�`g��� ��O�
2{�vO�?;kc��n��� ۛ[�&a��Ȣevr�I�e�"B�Gf	� �Xyy8x� ' ��̊�wxMOG�J����ގ� � _������@�]A���V�7Bbc���  S�%�
��/b�ş����`����X��>�{/s{[����/������,ß��։�;x ��� L�\� 66
6 ���������?��������O at 9{
 �
^.�?<��
ڿV���)�
^f��g�
Y�X�^>l��
����������-H����5����h�����e�]!/k���
��k��s��@�`W����A�/�!fo�2�Ll�̬���.�`��*bf�� ��/9l�� U���ŋ��t/[gf�򪸼t�O��e!4�7�,��!eo�`�{ٹ�@gg�'��@� .�7��ښ�<��w 
�������`�����\/#�[�'�����x_��߈����X��F\�������͍��_�
�b�/���/����_�%�Ϳ /����_�����Kyq���=���KEv����f��|���_����7d��l��/���_��^�q�|�����Ƙ�:;�t�}z���o&�2C��q0��
n��#tg��?I��eg�7B��JM��kde.(�J���IYw(�;�|Z���ެ#���b"�޵$5��y���J�&"�Ak���I'�/r�R%�D��Z�ܲW�
+͇��{.���X�G>�U��[uq�".���:�����%>M��]l�F�ax�r:��`�-R�{�����K=ĝ��n�[�� R߉$9����P����1�Me��e�
&���2zu��B���]?
t�[�>d�-�s�9f��
�m
��\,�_�>���j���8�Dr�.��JTe�S�
+�Z'Ҹ�g�L=K��
CV>;X��5�L�]p���tB}�Kf�hP�>��2a�z� "��@�I�
O�ޗ
?\��f��;����ĐY�0S�X���\K>�+�h�f>>U�,�F�7�g�k�.����.\����%|�1
�{o�L�u@g}�]q�%'��I
��G�]Z��8=�/�%
a��{%��\�����V��R�h���ތ�4��T`n�:}��y=��K�#UH5B�L��M��/_Q�G��;%�AR�a��+8ԧ�d�S��TU=��f��Gp�+<^(�U��
u��31C��[�
�
�m�;x�n�̉�U)��P�탲
+�e�TS�v(o
+�3//5L
jX��lr�@�CY1�{��K٢M956?���6�����˃�_�w�8�k5�/8�0O�cnD7,�	�0��D

�%GCˍ�0�i�M�
xCGP��:�
���0#|J9�%��9׵﫻�)��T�]�����B������,�T|��؝���f6'Ż��,S'�>�?��0Č�4<�Iq^@���o��/@���M.\Ճ䒡x��ݹ����L�W	�K��I���6�n�ϋb�X�È0q�₱��x{<�����r�^3d�'-�W���`�@=`d�
�	�*�,�X?
��8Xe"���
�,�?�ע�Y��N���E?�L�7�璁��#��U��ek���d�u����`̝�vx$
J8�g~�yG�g���i��!��B�t��h�^��9�z��KkK��H�=�b�
l����7�4E�vT�5�q�ħ��fr�
\��(Q[7;C)t
�qC
/g{+��2���e����>�)u��QW�[8m6��{�}Q�k���q�NX���z�|�����K�'^��7�����^ԯ�

+��I�]��)���3�a=��/

�;�O����:��m��]o���p���Az���Î�ߪ,��a��hQ����L9C�[|)ψ��0�`%p�pq�&M����=����VS

{
+��c�B~�Zp��i�C�����Y[8�)ja�8����O;����l
�!Rm&�X��������S�=�u���䑨���L�%/�B5���l}
"
�+}<���<�~�w�.<	
����%�CH��Xpw
62˝��{�]��.
&�
+�[<1|�TNu�~C���c��dP̡{4׶�#I}N��l��݆n�G�N*�„)_���&�Q#Kru����K ��k����!l?�a3�������Qj*��0c�(��B#&UQ��k���)[�=T�����ä\}ו`
g�Ċ%%=��oC
���"���3p%���e��Tc�#�h�ZY(��
�TLQLx���
�
#N���x������d
m�
+�4���%(�kxQy
�oH��	q��C��E�|�
�X��U 
+�-�"p�o�	�<1��J��'q���}
S�g.T�eO-�ya1�Uf�/M��d�J8�m
+
+���d��3��y�LW|��!%��jHh�́a�T�U�k�v��Y�S�@U��B��)N1��p9�4-,���C�%s<7��oD�SΡ��w�F�X|7M�@�C�0�����]�S��
ev.�����0��ZZx�m�!D���>�bF-��!�\�u�z\�e��z}qH
�{�pc
+�!���
+P�XCƍ���%
1��x��]�BG=v����M:��S�h�w�l�x#f�Rs��4�8ڸ!_s#'M~6>�Ћi�
+5�����b|}�a����$���@ީw7�h��
�?���>��
 E#~�v��aa+��.����oX�zR$�p����
��X�l�WK��d56�v��Ո\s �LN��h ���g�Ir�l�~V�9"�����mы6��#q;�q��G���
J��:��S���	�@yk�ƐѬ9	
�qB�aYUĩ/vfA��׏jg�`�R�c�3:$�uqUP��no$�
���E8g4����Q�����
�WӴ�;�緖
��$�)$4؂
ɚY
�=	�A���u
!�~3�dQ!�P
H"���
�I�|�Tߐ���;T\��&�]��^���o��8���u�U���8c@�d�������[��B�{�>���Q�hb@��[�<��y�U{]D�����]K)��M��g�xG� \Gj
>�E
5��LJ�d�X%�w���[@'-i�Ú��O��<˺t�s�-b"�����G��
�����W�>=%L��s
2G�'�eh�Y~"4;��
^s����	�7���9[��uM���b_$�+Ғ��>��9�b�*�s�i�;&� {G47+��31)�.�X�߲7��3�)�Z��2����]�N
^ �I�!=�/��@ۍ�f�Qj��P�վ�Y�=Jv�����>�xY�{��"��.8Ǔ��]5x6
�����14��� [...]
��іI�y�]m��{��,_X�
�'�ν�)��M���E��]{^S��b�7��@^
+��`�S�	�8jQ`>%:�JR�G
��*8y��+:"�nzb{�
I��
#$w�EI+���3��%
��B[]`kOܐ䠄�y��zZ�ә� ���-{q[ED��겚s�D�<����;'����A�a���
U5u
}iZ�P����
�^Y� ���e�o�D.6y��g�|d�7s"�
��)�R
�
�
���񟮚䅩�������0K���|K2���%�e'���j5���ǦDg�w:�H�z�H��b��9�oJ}2k���KX�D6���jU}ms��Ѻ��K�DC�-��'
GmC��v�ڐr�
{R��`�G=8�qU�]��>�����0���{��^
+&�s��M0���~�W&L.:�M��
'"i�������֥���,jxśf,�Cz��h����բR�����:1��6r���t%-���	��/C
o
� K/�
$7Q_�2�n����@]e"
x+��J�ת3�lR1�=Ub�Ϭ����z��
�l��9��R�ӆ�ڍvp��Qj
mb��a*!<�6�J1=��Ĵ%U�!�j
bձ��S�Ӱ�QD�Rq|���-c�Jx��
v7e�>[�
-R��MO��A)��WX�
��5z�9&]�
]�"P“�Z/��%Qڹ�C�'�R&��|3�m9�drT�o		Y�M��@��]�Z
9��w�W,�����I�{�A^Ҋ��T��;Q�'����
Y_
�����q�
+��(���n/g�;���Pe�j���500y���S�ԋY���
T��E��6�L
�����r�DE�����N���W��H��M�6
�#�(9���iEG;�#pf �\��\=�0����(������}���~�#׽w�*LK
`j�W0$�r�v�)�5!~.�c���Y���;��MJO����H:�xx'V�_�{=�K�m���
HFB\a+9:
$�E) �bs���¯[$� 1�9
����_���c�a"�fƣ�ywH�۴�����i���J�H�M�GD
+��;��f�s[�_m-]^M=����q�b?�eڃbK1+�o5?���&����7�.7�m�;��
+�]��ms}��SZ<	�6$�A��G�+�"���}M׉���Sk���Nl�F'Qr�������X�u�H�@W!F񄝼W���2<����B`��U�$�I�
E���_��6�G2`�N�Ե�]a����!��4//3����9
���x&�o�%��ߏ���"���)_����
��jy_�ޚf��p�?��Z��.���f��"#��iԸ�HWqY:�D�Q޺5���O�u�ڳ&o��[�Ќ���c��_��&c_}�f�rr4�Jw�vs�N�1�]$ʑ���d��.}�7��"�͈V
W�W����2+�\�G��
�Cf����?�P
&���w
+�f'�7{&��1)�"ݚ,V]N�Ʈ0�M����FZ�xB+M]tk�rYC��eqξ3Đ��#�7��S�(F��ܑ8ٺdx�=web���
�kKH��@�X�������3T��k
�G���
5������wYg�%W����{�
h/����u��Q��k86�
�\䶅�=�ق(0��RW���M�!�����{��Д���M�wl�rHw�.JmV!vJ�6[ �|�yI�ʝz}�EtcAk9k!��s"T�s~��
�I��+khm���/zvg���&K�*�Eb�— ~$�1�g�AN��/%�#���-6f*N7Q����E�tr
����9QHv�B���N�~N�$��[���,�D�]��B���
�F��F�綳#���M�i�c�}͵��W�kT�T\e؟��v�"����
,�B̘�;
7E�!޲DV9R}��-�y^|M�J��4lu˝ʸ�PH��ݻR�&lmq��Q�@��Xq稷h�
k������:��s��,�
;��	ko �ۏ&u�ʁptWoA���X_vqc�i���Lɂ���C�D������S�И��������%���R���wa�\�[:�X��j�͓P�; [...]
+�8�o��

;e��0<��
�c�B
+�Z�`Bݩ
�c����kB1�g�
�|="h��Ef��
���DG�5^X# ��u�����T��l�_�}��}� �	�q�HA��f&
V]T��SL�0r�U旿�����d�
����oU�c]���V����s�rNS����Ơ"S7�[�m�s*�P����~ʛm��^�L{��	%��8���-U�o�`j�*�
�0�*kI��%������%-�*�)2��6cn�

V8��b�"՞d�_���
��<���I����~/���6��I�Q+
��3]�
z�KR��	���J�L��V���T��O_��Cb�5I���E&դ���W������C�\�$����๠yG��ء%�[��&���1��<I>�wP�M1Tzy���k��*���X0�灦elG���|?߇Ÿ����~�;U�)�U�ut��$��KD1AM��~P�7
������-o/Q/�M����T,���=y�XBN,ɘ-6E�~
n����u�n�7�}������W�Ro[�L4\�
�`�,d� B�U�Z�NY�3K�a���aWQ

�;�6�H5�(��u0xwD�yz������ ��������8����S��;��֍�)FR�GJv�<D�PPZԕDX[�E���
V�7]Aq�m�v�u� ��n�p6?f�*˭0�Ӝ��b5�	e,��C���(��)/�RS���#��_?���<��f����(�L��%��b�|�݉�
^�0!�}��!�d\��\M�T���
\�����ۚ�䎩>o�k�Nv���/��\�:d�G3���(\��18��eOx���U�UT\�T�仢����5qv{(:i�I���tU�Z"X^��V���(ޓuPߩ2
�4�d�`|���q|0�H���!�
+ፆ2J���kv�c��u'(��,ʹ���
+�g6=4m_b��=�\��+΋g���z
S���	���	
�[���
Q9co�45%tv��t\�oOS"P2~&��Z�q��s�1��Ք���b�j��A���~�74;W��Cq� >l�R%��L��
o>c��iʼ��>�6���!���_!����Dw���Pd�L�+ �tKw:#�Ed�x��iR�����3<Q�4G��ې�;s*"��_=(��*ڌ'�J�8Ag�"��X�6^�,��>�kVV�
�!�qo-7��վ��+��
�>鹫���o�M[8��.��Ѻ~���1���=���
WV4��m9,����UH�%�3Q�^��m<��sfF�#Q
7�a��Wb2N�u�Δ9��Pj4��3F��X�<�:�^W��S�ʨ�Y����ڢ��W��,2�Y�:wH��F�/א+G�P��o`T(�d�4�ʔ!A}"O��{k3BϘ��c��I�oآКj�JPN���8B��z��~h��v
Q-����isX@}�AG٠;m�酭�!���v0z3� [...]
+䊯���q{�*�B�$C��^2�Yc��QH�/�K	�mf^Qɵ����˺�
+�1V���m���:�BZ�f���v��3��(��fy�ǰ'��g	�m�&9��Z�&z~Ʈvo �<Y�e���yM?����z���/��Jd�i�jϑ����Ii��i�C��|�q�(��Z䅇
�q5$��>�͔���f
aPw��U
+~�/�+�L"-z�������/�E��Guޡ�Q݄(����C
,�*���mP[��:xo��LU�(�og9���GC���2�
�ߊ��e,hs�Me�<"(��n��C럿�
�PQ|\!ϲE79�vX��
]��~�ug�����
@�	��"��,^P��g/�Zs[�/�=�/3j
~�m��=��5B�Pc�ۨƢ�-4�:������w~��m�4�H'dӱ7���U
���ö�pHo\f�n����Q�l��UP ������ֻ�iɝ�b��٣>;�n���#�����Z�r-�@﹎�`�o
pu�}!�<�G�ݤ��!��~�T��t��a�
 v������h>�`g�q8q�\2.;^"�]�F<TV&A����0Â�Է;
w/-�t=|�g֫JIY�7&�8$�O]�=ao:���R���V���+��_��@lk$��`9>�h��Oϊ�s��i%oY<+��>�=���}�Ea�y;uÔÚJ>,ǔ@�v�{xJ��.��$|j��/J\P�M [...]
;�!��hQ���`!J�7�s�g��<��}f?�v�n�7�0�����Zi-F
+�����p��
����/�M1�
�����c�w_��WVP��{kv�0��Bɝ�$�b$��`M��|[-��^	��&�hkcP��-��I���a�2���*��{FOx�S��^��DXk���z�ܦ��|U��v!���T��5Vs����ٸר{>�Z8�'�u.^x��
Ju:��F�� �/1�+�<���0w�ܤ)�-���ߠ����
ȹ��>�K
(�����+)�VX45���PS�SS"�j������W�t?������8��2�lȼ�U�e,X[���u�}�"gѳ��o�"��>H��eeNz��U�����㶂B;����)�C�ۓ/X���\_�f�T
_�H�
e��tC�o-�����'��\<l���UkG
6C} ѹ��2&��U�gB��l��j���Is,��1[p�d�є��`��

HAiQzēX���R&X�>8Қӌ�.�Y��L�F�i
�G2
S�	
�#��Q�SO.���]�ú˜g���y�andg
ox��
ω-���h7��4�C�$�J�P�� Q��-��GY���X���gV�0���o���m\��=����'�䖋���_� ���wgNك���SM�z%�G
+��)_�`Z?�p۶��6��#��膾j��麟Ih�	MRh
��f·\
+E��No��bQ�{��yF�u�(�*c������Zr�܊�q�������:Z�Q�˥�1lS'^�{	�3� �O&C����
8�A��RF�~D��Ar�L�0U�%Z#6u�{"2����4�?�+���y��]^b���F�.�����
���.���&j��Y9�1�
�ĩ����<��͹�֭�{Qw�n�o�����`�ؙ����kȐ�
����Ѧ��cY��k��/ڡ��b6�+'��
!�~U�j^}��c{>p���V��
��xu�}x��W*x[T澔W�o.8;䡀��
fV��xSV߀���@�qS/پ��m�~�lt�Ǐ�F����\�9��L=���<̐����d���鰖Q+{����_�h�䵗,K*����r㺗X��(ɗ>���N���D;�$���s�� �8���Zq_��1W9"-�-�i&ƭ	���k��`���I������<�&1b�I �S
`M��#/0��+C��b/���
�$E�h��}��hh�
[VD1�Y��;�vZޱR��t>u��+,�
&E�8��T��M�F�~�k�2��LJ��5��1�ntPXbe0T�0ɍ,|�U��!�2
m�OR��)c��(�u�p��׷��: �N�(>��y���⼮e�^�a��B޼àAM���
ٗ>j
�Q��£_���9����yS���*��B1˨-!��&��j(���(�I�"R� �����w�շ�o+:������O$"�U��)^q��!��y��4�
��I���Q�f��X��u�"&�FC�b��n=�� #�e�Z�N�\%�頝�����)��h�U+�
�I�"�33gK
�z/r&W5|�2�
+�n0ɴ���WR�S�܆i4)�;������F-��p��>��<WN��;$����(�EKFu1�>
�/��0u�3��W��r�ƃ�])�
d������!u�9?3y�+`|]Eyrl����8�=��$���˲:L���LV���*4�����
+}J��ed��d�&(Ʈ��;
�c°����C��6��`�!�5^��v����Re	��Q�[����Q
ާ
��	M�~��vM� �Q�3�'M�D�M��[啸��1ꙝZ���Z��K
���C�j$�N����9�%�$���s����&Ēx� p�
Eֺ9�Rr`(-i}���ؒ�k(�~�_H}��S��Ρ�u@�}�f���(7F�j�{*�j_�
�	!�eA���U8�3��8>4��<�ƭ�!	YsH��X!ԥ�1z/:�k7@�k7
zr��Q-ƀ4��CQa)]bT�Wҿ2|P=f_,���y�-��Iίl�����퐗�g���)dYE������m�
+�=P:k_�q�����ݐaw�p��;�']"��
c�O	(�F{4hz<V=I"2t����t�)8��I�I�pxw'�o揵�%�O0��%@�e�`�g�
�Q"pf����9$�6_
R34	�H(B9�{�K�I���
+\��,ԙ
۳�I4Ҟ�E�xW���T$x
+��v�6߼�!5
"��xZ�
RV��.���k�..����EQq�T��ܕO�J�����+K.T��ueP
�vCU�d4_�L
�*#���Dc���O|���5<��c]���2�u�H���I����j�׌P�L����o؊U�C���l.{�ϰ�	�#�t�
��}����*s��"��<y�	,>��U��?P���g��(�ޒ��R�p����oH6��_'�j�T<T
���=�T!<���
+LP,r�	�B����*�â�`�ેO�q�H�V&I#�w���l����]��(�G��M4v��A��r�bd���I��M���w
����x.0�z�z���7g
+endstream
+endobj
+18094 0 obj <<
+/Type /FontDescriptor
+/FontName /AXPGTH+CMMI7
+/Flags 4
+/FontBBox [-1 -250 1171 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 81
+/XHeight 431
+/CharSet (/A/B/V/a/c/comma/d/f/i/j/k/l/less/lscript/m/n/p/q/rho/t/v/w)
+/FontFile 18093 0 R
+>> endobj
+18095 0 obj <<
+/Length1 1430
+/Length2 6052
+/Length3 0
+/Length 7024      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�k�.�H(RJ�/
�3�t�tw9� �
0Cw#!���t	**HI�t
+
+H�t�������uΚ��y�Y׀O�
e
SA!1|~�����&��B�`� 1�!
����&f3�y��(���rP�A1X����B!uO  ���`0 ���� ��^p{@�PG!ahb6E�����	�-���� ��wy��0�
	hA1N0WlE;(0@��a���r�`�$������h~���
/�
�8�04��
f�
hC]a����Np����
��XnC���H{��-�i:n0�g�?��_w@�!�I�W�Dp��`��
��
��#
8�h�c|0� i���@���P/(
��:��

+���P,����<�n4?��Q�W�-+#�Q��0$M��?%��{�&�Dy#��
�H{�_ �=���pwO���_.X�?:G��`� ���I�WzC_7�o#�� ��
�8`A��0��?�0
��@��m��D
� �p;
`
s�#��ɎU�
����{�} 
0�{ ������^�($�����0��4R�����?6���'(
�	���b��N�
��o�.�Ws�2�!
P 6�o�����_���kg����Fa�
8��%Xl��@��7�w�����������
�x"�͜�����
+G����'�Z(�v ����g��`�pO����a����G:b9��
����*p��.
c��I�[G�tQh��'��
�vv.�g�����A�����a�-�w�H;���u�

P_b,!�����=��7�~$
+�
����1�
+���6�5`
t`@ �_�U�������$�V���0�̎xze'�\
�x\%O�ͷ�Q
++��T��c�5!�Cy�f�����r��v���s����q���=���;��‡|wTV
��&M\
^{���2A�'�$M�I�ԣG�1���H�ޱÀ�4�����co�[e*w�#��Z�ʲ5�č�/�c��v.���p�.�&���|���ɢ!�tB�Ȼ�l���{����5.T�+ly�5
+C�,�͠$LPi<[p�<��k#���V�R��@+�Y���[� ����9���9���c�
���ߊ�P!�'B"m�b�c,ю���Rs*�!Mo'�{G�����{��[�8�AN��v����
�3^ڙ����&(��)����׏ުBҥ|r:�v3�"%���#1i�3Q��]��L�
e�I��=�\V��r[<
��Q���e
��Nq
��F�S0=��J+��<�1!�Y-6S�_�
�
�qc����-�;���r���m��|�0
���y��+&
�a��C��=��0��G���hOF>]}����ʎo*����CN��	���P�]~F������ɓ���#XzCf֒Ol��ǩ�a��r
�v9�bJNb��gyn~_�25��T�[�/e46�ZЛ�毞��Z}H9�cmv���O�A6��.��K����r��d�nX24�6�[
��e�(D����F%��[b��/g�`�
VU� �	��0hU|q�N!(�<eU)N͖���5�뢼�%g�P�C�jZ��I6�^�(�e�nr���n=��m����������LM��v��C�w��
�Zė�>z{�+�U{f+���
+��8���7�0X���t �̵
��L�S����f%��xZ|
������&[@Q�~���'��l�$Y:d,�߽�����O~>�$���Rn\�����I�KN���ø��{�؁yX{�r%6DžA�B�<NAW|���zy�(,��.���uy}�ď���q��9A�*]~���C�t�U�þ�N_
��i�ζt\�s$���r)����D.�'%h<Di}Y�`u���
|7Õf9B-��m������֓��R�
�O��
���/����D�2����mB�
}Œ���qgL�1�b�� �yf[a� Ǯ$bB���.
o��
E� d�o�픝�u9�HxM���nĆ;s�,�AD�fP����?�o�11+�����
�jAT�U����Q�
+x�l$Bf]K��ƕI�!��{��Wj2�~Z�H�B�Y�M~uZ^�۱c�d��
�ۧ�V��d�Hd�Yp4��ĄG�8��q��>7`M^�������9u�n#�e�����g������
�ѮF�:7掃��Fiߊ��hg�E5���Q) Q���dvҪ�|���4�*�4�~�v���*'V����D�{
|
R
mTL�$\����ΚA�Oi%ꃈ�-˔�F+l��I	6���i�j���_�
=a�w(
+��3
+��='�T���;S���񹊽 էU� V��ơ~�s�

��l�ć8;��=>��x�jC��A)��䖧ɜDZ��f]
8c����U/
�X9/ٮ��E�y*%d��Tv
�_.�m+�7��h�(�j����i�w �7\���U�$��ez���4ͳ�d�����A��lG!��\�1̫�]���&�>\�3�
}$
��4��-�QDt����g��gv��Ù�@��V��߾�
]�iX����i0>��9F��]Щ	H��
u3p��@�.�N��,U�����
+��Y%M h^�Q���P��y)���g��4˕��l�����&~2zaDޥ����Rˎ��b{C�{��E�I�1�
+3� ���'�R��f�T�d:ER�|�W��8z��[�t,��N���.�WxNj-�e�����˽��W�
,�Z
/Z
&�[h�S��>��~��j呱v����X��>d�l�z�̜\Y
A�B.-��w�G6a�Ԏys���]&�L��u�>���\d3��b at w[(f��������rL�N�}ɑf�+��|��?��i<��͖�u�{7��>���ݵܭ���l�}B߼(�����1�{#w�l�6�
���盇%
�ͥ�TH�;_�151S�.X%`�9x#�z�p� ���S}^ݤBݙ
�m��A��
�ۜ�k4���f+�
^d�I�|��F0usg�E��M�K|
�ZsF�tI��S7#M
+x4s��]���x\D"��8��ήk6��賮~�-@��H�O������Z��qJ�5�Q�og�1�>�㾙TڴxT��r+�Y��V�E+ AR�S���FC�
 rp��}~����Ff]�AD�ҊY�0]/�In���ۮ��7)6���9���<�����b^v�(#�s�z�pu��F�j��ݷ0݋��M�Yĕ�q��
�iY�ȋ�

�M��ҙ���l�%7�7
7��*��rnF�P�����'�Y�]�!x&�u�OeUR�Zp�&??]ϯ�D�Lݕ�{�}�S.f
+ r8�ʻ��uS��?"z�f�������CL���`�*���,Q��A�{�7{� Id�{_�A
j�vS�7ŀu�Kv��U�3)�=�|/�.�.��w� $�0�z�Vc���
�
h l�P��fӟ�s̶R������d�$��6R����%�����}Pt�k
+�+��������5SGL���u��*��ߝ��]� ��E̅A��B
-%�/ڵ>6�E��:�
�=��[-�]��_H��g�}
�PS�C��b޴�j~��
��F�M�TW�
�m7��4z6t~�c���>���EMd�Ey���
NG���;?��[Gd:C\�{4�7�ܨ����>j�G~Ԭa�)η�i�c�J���p��n�v�7��Ċv�+��JD�qg�w������8�����Feu�?�j�&_U��+�8�!W���6����|~��$�3�[��>ؕ�޵+	MdH�
~gk^����j/�3
��,�^2�/߉#L{���k�
+-����$���F�˖��&3�Ր=w|�X�ܑ,��_����镆&R���Ɲo6F_v�8�?L;�>��NM�����㚫rG|\i<�����%"�~A3�e3���(�6^�RX��b���/Z��E��o{'�_�O�gj8�t�:ǥ
���(;�	nC�`�/���X[@��"�d�4�7Ydؤ�䈿o�Ĩ��ibv�T���
�Վ
��[W�-�U��R_�1�

+%��
�(�W�dk
���]ǩ����|�p�X��

�Ԣ�D;� �/N� /��
5/@�+��> �=�ͥ��5��1�d�c� "�d��~�:�I?~�z�
+q81�S�ѝ�(~У�ȅ��]S}��<����r��r��f)�|�'ǻ���gW�
q�j��<{
+����K�;�k���F��
���ʭ��*��>�eCU��H�F�~~2��v�<$������<��� L
u:��V+(
��<�7��$��$�2 at Y/��WȮ��3���"A*.�A��<�<���dN� [�O�U�W2�T
+�H�]�#�}�"�Ҥ(�n�Xƒ�

����4�����9��w�����5?���)��&ؘ���W_�߅�55���Nϧ`��	Bl�#

fH�V��o����M�i-P�W
��m~ ,r�KÔVäy��y��#
ʯn���}MN^��d�S��%*Z�r@>�b1�N$��$�Bw��J�)珥t0�a%�n���ﺆSs?�a��
�j���eށ�
�����y/g�v�<�!}	<e
e�0��/4���ό�H~�>���^%v���h���3�"�����6�Xw�W}����u7���_d�r��K�6��6������j���T�R�m�~�d���|a2|*�h*�a���6��-k���3
m�Rc �%PCO=��٬H�V�'�w-���y�����ᗴ�ۡ����)#O��|�޳��T�
�����#?A�~ۭ��4�������#����C/�mwR��W�2P��"��_����
[�zI��=(�Z&��Hr}�vI�9�-}�S���
��
i�>��c�1ϲ��5Y����|�X���
I���
?E𬹝���m��Bp�L
dU޸5�
�
9���C�s�G�y5�)�|h���J}�vu$qt/{����4����z��+_E��M�t1/��fTĔ��`��LDξ���v��P���	&'1�r�P�<x�Mbs�j$�f�ph�O����*џ��dBg{7Џ=�$l�@w��N��
+!��Ƶ�%v>+ʪ+y����u:2�Ew�
+��$
e �i�(��W�Z�,�v�l��k
�����@��>Dq�A�d�g�Ed��nM)e�4�dp��՚\mF�
?'�j��PYT�^T��
k}��k�`*�)N�m� T�D���~
���

�-Oè��фz����
+e����7�/����1z͘��S:*�2 Qr]#�+,���Yo��bf�OZ9��S�n"YA�#��[�Z?ϭ��	��68�Nx�N,��0-$��ϲ����r̓�>���,*�x�}��<C3�r����4�";�l���x�2E徟;�_
+��|*F*3��GY̥���C��c2�3�h���b��%�(����2Ƒ~3���R
��q�!���w�X���߆
�IE�p�2W�~�f�tѫ
�u;���;w�Ƅ���sp���{�\����K���
�|N�
���9
!�d?�W�ةo��f�������y���ݣ�
�M>�Q�8�b
�-H���t�l
'�ءW��T�\���7%y�A���~񌀄3+�	���)�/֦k d<1љ&��9�K�3�N�/E|途�T�Q���Z(l�#��i����GP�=1�p'�g*?����X����d���<G����s�Q���^�ǭ�\�j(�T��
�9�H{
0� �h�G��$�[I�G5x��L��rY��1E"�/x�ǘk�Q�=�xe�����}|�k����m��ct
�[��i�����d���|�Ȓ\P+�6Yu��
LFw�Ѓ�ӞZ7�/�Ɖ�U�gH�����¯������?N$�m[�P���Q���
<>w͒���B������г~Π�tg+�`2 [...]
�?Q�Z�oț<<}9RR��^���p� 4˲7��>rrnb#B��$���1`XVN��:	�Ɖ~ˏ���L߾n��w��A7i�a�d�NE����tf�CD�͛��b�B;����K	�
��>���
�C�G��)c&�kc�M<4�
/R5�M�'r��p
�Q۶x�Wě��.�&q�J1�sX�������w��~�M[�y��X���Y��V��r[�\I�B�hAI�f�ޏ��-H��e7M�����C�*�
+dX�?�2��
�.Y�7�Ӧ$x
n(�KX��+6�����p;��8Q²����{��E Em�H������t})�3�C�Ԯ4u!6{*�%0��f�+�U`��zh��y�{]bmP�"&�n���@�_�����ꚇ�iVA��g�����Υ�Pք�ʼv���I��]|+�Zޑ~L���s!a�fe�u�|䓓�ދ��
�掲X�vͧ-C�qj�zi�Z��N�/(���%���fG	q
+�DULFł{
+?%j)�}GYL�`����tzA��k�)�`ʷisj&��\Fq�����d9���vn�{�.i��]���N:�Ue(s-��4�!���s�M/��>��(<YD�o!��������:S��>�.�|�I(ƃ�Q7hc���0����w��J�t�Z`��N�T�N��p�7^mȍN����e
���#�f�p
��Of��-h�˟�l��0W��|5̟��y$��}��}����:����<�m�c���:C�o�0�s�=*{�_�n�B�p$�%2%�x)��H�V�%�a�<'\����H)ۄB�Ŧ[3iA���[�Å��̳$
zy�틟4]x��޶�U��1�gV��7&�ω,�劾�~�9]
�L��yT�W�p��?����
+endstream
+endobj
+18096 0 obj <<
+/Type /FontDescriptor
+/FontName /ZRLUIR+CMMI8
+/Flags 4
+/FontBBox [-24 -250 1110 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 78
+/XHeight 431
+/CharSet (/greater/less)
+/FontFile 18095 0 R
+>> endobj
+18097 0 obj <<
+/Length1 1597
+/Length2 7380
+/Length3 0
+/Length 8434      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�_�.�R�
)��!�
��0
0�
0C�4ҩt*(]�� "(-���J�7�?���w�{k
���8g��<��QW�G�nQ�Ð<��@	�����8 �XY
�Hg�_0��
��$�W��;�Da� $*N
�{8��"��@ @ �;�.PyBmZ� u8
� `U����C�
��c����9 ���ܿ�r.w(h��ԉ`�3@�B�>�Q�]��t�������� x����
� /(�����{Bl�h�\ :�%`8@p}�
�
�� g(C�2<`�w �p���&@����'���l ������+�W!(�w2
����`>P�=��
�(k�"��� ��W �G�<APg�
*���A e9= ��_�!��PW$�u��"߯2�)+�l�..A��~�Pw5v�?�u���`~vP��ݯ&l=\�
aP7���_!(��_�
��Dń 7 ��������+䷓��� ���
+�C5	��AP�� O ��	��ߎ�����P0`�������!vl��ݡ� s �{� ௿�,Q�Ü}�
��_>
mEUc�?
�㓗�{�x�<�@ ?PT ����2�
����� �_��[Q
fG���jz7��/���
�?�І��
���}
�0�����V����U�q��/�����������A.Pg��P\�@�t�G��ߡƐ?Zւ�B=\�۫���!�Gq��_���t�e�7�V�;�a�߻@��
�At��'���%;��YA�6��B�4����_6�����

��%Ga ��
�C�"���tk
��Mx /
�D� P= �����,*�������|(����A�Q��k
+�,W�j�0�@ ����5�0 ���W#�d����׏*�p!
�A�D|(��~M�b���!�����)���������=��QS��e����?X�7L�y~�X�vV-wߋgsT� ��D�g��
+ٯ4n�����=�Q����_�ʱS[��,wi���[�:�
�m{�������S:�i�&��T�o���t�cH��el���YI���Φx�Q+����iwtUgkRщ�=F6�
l
+��~����
k���ɤ!�qN��UE�28<�@�G�
���y��$Sz4D�(�[e���*��n&����]�]���e�ԳZ�c���]KFN���F�>��"M�䧙��ɲ���'YL�?�-Qx�v�8yWьDǟG
��
j�m /��XvW?W�#���`9�U

{���w�؋,9�
��[p(���
Z�`X�kqpp�DŽ�K����
+/VN-�h�����$��}%�)�Ù,����s|���Y��0r�-�e�����^�
+~�>{������O�@��`U5N���HC^�Ǵ��%��Eⱀ
�@�L�xk܋c4G�h\Ɛq�:�`D>��	Mke�_�@	����tm�b�>Ġw%Q��̩�
+m�������b��KDϫ2(���9v����ktu�*>��W��NZ�@��
y�k�+�y
�D��SV�!�lz*��%y
�
��kR?�S�Q�� �Ŋ\��
����
+���
�wddY�̚s2r(�/�X�ݙ�
B:a
T�g�\�g:��9!��s���%�M�1}�p��i���\&�!x��<�
S{;��M�	ʣ�����Ū��8h���3��L
+�YE��fʸN���k�����D�7y
$��Mߞߏ�����6Q|���y�v�
ŗ�����{�^'@{����Gtm/
>r1��G�eԎZ��,6�6|�����9�JL�����Y�dh�%`TiXPrK��n�����V���+�_�֙	��ĥ�*sܡhn���2�p�La�wso�Ry
��(�%�Y�b��Y<��f�*a�"
NuЋ��9���g�����">
U�u߄���3��T��ʊLu4�
�����櫭��ƾ��%<o7�=z�*&q�~wn�2o�>�̫w��g��r(z
+��q����e�rd����
+��D2p��b��-02���3���7��5��6?
�y���{f�q����n��Q��7��g.�ʋ��$,�Xq���W�l��ƌ}T��ɰ�/�-�>�oUu��u�J	���K� :�9�a�	
&Z��O�E^(�v
�h�Г��CH������H��Rv/<<��҉%AIԼS���޵{	
��K�9S?�-�O�`+��+���.�<7�����N��f�	w��c�0g��B����N�}
b_�=�e,���z�k�=����	���&�X�z
)!!7�-&�6	�
EΓ֔����2�E��iď���=v_�������R����~��Ў�]
�\�^�c����¢҈Ӓtn����L|�EL�/|
��Kc�>�'l���T�OM?uԀk&��d4_�< �z+Lrs���'��^f�n���f{����Y;%�<2�e��rjI$��Û$��
Єm
��
l
�$?�䕲�s0P��v�&�5���[%w�֬��ܻi�"�� ��eM�&G�`��
x��3�B#F��n�q$��QF9��p��6k�
���
5��O&��V�V���Lrg�Dw�˹"i5;��H�n�'\{/ؓ+���#W��-��li-U5�/�Î֑�x�Bd���
iشl�XO[R�BأR"�B
����A;L����Om[��s�Y{�+_��Bw�S��5)�M��}r���m��E�a걇����g#8r��o�!����c��l�F�)�vhǺ"��MJ�Q7Ž$i���ĿG�������$�X�1'�a����l*5g�����I����6�9�)	�E��L�~��
澚DIO���Ϣ�	����R�����&���b�O�/Nn"����|��g �O+%x{��H��S�W
S���y�Pї�d.����
gSj�p�
+�j��C�3�d��@X�YPGp^���z�[���Wz�h�B�:��%�F{��j��7&uS�|,T�<$��y��N��{=��C�yDr`p
��;M�j�M	�݇F���
����ϝi���[L~*�rO@�#4�
4�6]"���� �gW��U [v���Iz����4
���op<
�q���rȕ�,r|K���5W/mb
�ĪRC��fr=��=�]�9I*ŝ�5���v�L���hx���D\�b�5�@��E�U�uk�����b:7\uj�;�3�8���<���%[�H.����ƿ�iǜ���K�������l�]��t�y�m�j�
�1�Q�#ѕD�Y�76���ϔ"\3߾��|���G
d'��T(�
�J�}�N�9� 0�����Ťwp�Ҫtk�b�=qg�"�P�\x�<aM�Cy�8!�*��T/�����J��*̾
+a?��Ր�ݢn/{��a4��`�o6'؛�+>k��O�0��%듷��{�H�A<`�[�ZC����ש�=5!�#+YB�t���j���M#�Ls`�E\w�I�rNa�n�'�&��T~�(�}�����(��j�������ą�я8�H��	>l.Ք�dߔGX#
��bE��T���9-�?8I_�w�ة��k��f�UtQ�W2�2��KJ�]h�ȵ\ݛw�����Lm<Q��������=G�����&���\��\�G��]�6[�M��|���������C/~Y�$�>^x���›O��MK"����i�Y��0lGñgj���6�Ǎ�ى��m�}J[�
ʬ@��e�,�����e:�Ǥ�[/YK
�Yŗ�n�j���`���sL۩��a�K]�ʜ5ⷎ=�Ć�]�&�.+%e����(����%S�,�/�Q�{(G#D�G�4	^19�~�I�
��6Ef;��yO���^�z��<�$��M[oB��x	X�\���V@��U�ξUj
+*^.�YpZ����MH�3�0����o,s���L����”�x�N�{g
���l�I�.8�l�_P.��)4:��
+�<9�-�t���+?�s=� !�6�}�����q�K-�1a]�Y�X$Y%�o��t�M�GD��:w��������k_�g�'�m��
6.?a��P(ȍ�e�;�k&3=���|�N�P� ̃9��s�;����&�
+^bI�U�fl�Ġ�/�O+
�P��������}��V���*UF��LSɥ�C!�q4���i�
+�[�.t☺R�j��S��yC����Y��2�A�}-�`q[��/!�!

g�`��
lûf'��_�����b%ɴP�\?#ۈ�`N]s�_UB�����;�֙!H�%:1
ڪ��� x$�(!%rM۟{����^M���C�ǜB��K�l���u�

u�§C2��
tUr��?�.��C��^�.
(Uj��4!^#��+. 
+�O��1X��K�R�3�7�%c
�Ցe��̙	;�1
mSɄ�'��y h_T�����p!�4Ɖj2����S�(�˝��N���<A]�@lU�w�Knf:>$,_R��AK�#z�
�x�l�X�����3��݋��Dޮo.��-�ۛ�X�U('��1���������E�y�`l>(&�fX�:���-��zz\<'�ꭰ�ށd���Z�$'\���2��;��G�d�ө�7hf�R�dkR�߲Ǩ�u��	v8�L,��/!�[��1�*�v�>O��FÂ�W�]
�����]���B�^�����
8lg�nV+�<� 	��㴥���m`1d�k�
��D��

��*��GM���[X
19�c��(9v�)u�$2��s���O���6��Лۘtչ��d�l
/
`�W�
e�����n8�hm��� 3po�Ihb�
�Y|�:�!��H�.��`U:ǃ.��G�Ϋ
eU|V}9nvj���
s�,�sbU���Cf��ٲ�N|8�l�%Z`hTJ��P�E7�4.F��
��^@�\%[]

��Z}��#����<���rk��g��z�8�%N�F�FK�P�68����.㛴k����J#O�~��:.�N'�>-4����L6.H>S
�|a�#��z�|Ɲ[%@"�Z�2JGQ�[3
�Kf6�o~(w��龘��N{����"Q�k�����
+���l��Dx6w}�
΍;��>��q��Cy.��1;���B�Z�
"�3o,�ف1��ˏG~�� ��&��*8�}fO�?��R\�a
9a>��5�{,����ݚ�[����C���G9i�E���:�j���_��k�F�����9<���B�0�����9��Y[�#��`��>�
W3Ь_<����/��KDa4���>U`���0�s��"R�N��y��Gsey�)B�������t|u��@ǃ
���[Ɇ��
+L��j�
7d4�e���J���Y-�ClsY�w�e��x��CIi���+���̙	J�U1
+oH6�r�~���Sw� y���{�H��Bv�s�䉘6�t�/���;��c�bX��r�x�l�,���6�ԙ,L/�3�jlk����5�� /�?t�.̛�8��tbIf��	n���c�$�JC��鰷�ɸ�9j:�O w�!�&¡��21�������{5/�tV��k
J�"�%0�Plf�����>��6���$�$<0E��іi1I���"
+����/� jky�<�[�����̗;���0�4�<����$U�N��Բ�u]���ԧ
7N�����������Fk֯
'�b���Se
��d�q����{Z�
峕�(���q
-\1���y�$�%��Vزv��'�}�,b��f��>
tR�L`Rp�NHpL����"��VX^=6�
[�f#�R[t���
��*�=�޼0���S��9����h��򆀝h�;�j���C��ڐEN�wS��2Z��/�7�.�H6Ί;T O�Sď4g7�KW
+��=V���tƑr��/Bgc&{ 2M���޾��%��:ۈ"
�)�n%i��e':��t0E-�Oq\no�n��ާәt�i��Uw(�'?DO
��H�a��-�yF���
y��;�������p=��M�'޾b��L#�NP#y��̣E�G(;�#� �����."��t—pSJ�OJ�J�˒c'����"��6ѩ��?
�-��7O���٢��_�p��\�luPN7�A�\W�uw�
��s��)&�L�~M�A��
uM���f�������

#��Y�Y�7w��Jx$1����<e":}�\���nTW���?�w�
w5�~��ah'������S�7����7a_��1w���rz�[5��(���V��y���5[
|R��eX
�A�'���o"!_ٷ �캸��s.���g�an).�IS�_
I�����$5�%3hh��7bn����D�rfÕq�SL����0�|r���.���g�g���X��vz^�=����i�ijR {v�ɼa�׬����ַ��,V}!�W9ȚT��D�.�u 8{�E���>�k=|`��l���:�Z~�N2�c�	T���f
+zlp'i
{F
����y�ȵ��7�|
J�Irt�	T�=�D*�I'�}��L�@���Y�: ����۾�>C
���ҫw�C�<�>��,g~&�
��i�yy��Es_�q:��仂�!
ayQw��� �G؋$��T�*evn��<0���
_���UW<�y���&h�U
O�9%���l
R���ܐ�I�3��L
+�хn?�A`J<[���`7	�Zm����� v"�x���#]dk�l����'"�]�Z��&"33M<���8�а^�T��(AK��֨C�� �.�G	r�:�F*?��7�s���;�lv�����r&
�g4�z����f���̟��x�����L(�Z��ED��jj{��EW�!!,�Fĩ��

	2"�B[i�o5,��f=�{
,����˽C�>�]��O�S��NJLJ&k;0�L�������E1��9�
Q��
+�o�Wn��7b6e��,���n�#o_�?c #3��Q��f���Ķ����$[��"!ۤ ��g�vj�[�3uaUB3e<U���X� "�OeN���\�y��e��
�k�a�U/�����_7)_�,�8M<`���g��j@�>��!�ܾF�D������V�����Nm�
�
,�6��'�ac:f�2��0g՞�s���g�g�	��^ԥ�U�)#F�Հ��H-�7�{�� $�,�)��,�^
��O���޼��
�
���\�:x/䕮���9	H.����"�2��y��6��C
��L!i�1k�]O;*(��qW�
"v��dˇ�)תʿE���=ƕ ν`r�LJ���l�-��,/Y o���
�;b^�rr�P"��F�'@;9\����2�G���{F��le�h#"�ZԯK������A��N�
�ߊ��W��[6��3muRA���7�y�/�nYЫ^������"o�w�#	
���0����W�m(Nq*Ӳ}��C�	U [...]
�8�W�G����h�:U����&q&a?3�Xw?�v�P����Psf���ʍ�
�!�vt�j���ѥ��|�� �@�W�����w���]�OR�o
�
E0i��H� %BR��
+�j
d#�ny�vy����S)T��R�--�v� �Ǯ#c�/LnU�ã�.�
�}k�)�h�<H
�9�Ǧ
�r����,�?�'���*"����k=E�)�����d�7�k�����}�!�$�	+�6���͙?���}"R�Ѳ���ﶟ�b`%��Ϻ.�\
�]fy8���&��[]�cU��S.�a�zbT�L =�����rj�W�
�
��&�y�͂e��
�$M��mj(b�7"���@�M�A}M�L���::�1�n�/�v�b��kD�U��[�
��fZaWNB߮I��Ф��G�K���#CJ�8� v~?t*��0�h~�Es��y�~
~�x�NUM
���6�C-�
����e����� �4�6S<+�0��i>�����~K>�.�M6�l
+���!��)@Q!��)D�ݾ�R�WP��E
}��ZMy	w��դ���z�G:��Z�d
#�#��$ /Ŝz���βt,�s��E"��vz$٬ӺaA��JͽC
vƄk�7™�V
m<56�2�������n5Ub�i�0ќ�
U�G\u]zB_
+�=T3
+endstream
+endobj
+18098 0 obj <<
+/Type /FontDescriptor
+/FontName /KGNDHW+CMMI9
+/Flags 4
+/FontBBox [-29 -250 1075 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 74
+/XHeight 431
+/CharSet (/L/comma/e/epsilon1/greater/less/n/slash/triangleleft/triangleright/y)
+/FontFile 18097 0 R
+>> endobj
+18099 0 obj <<
+/Length1 1546
+/Length2 8458
+/Length3 0
+/Length 9471      
+/Filter /FlateDecode
+>>
+stream
+xڍwT�k�.]R��� 9twJ��5
300��!H#%ҥ����4HIHK�tH7�?�����s�:g�Z3�u?ם�u�Z/��!��
���Dx��$J���@������ 
��
�<6#��;
���E�
�)�<��H�'
  E%�b� A���H7I�2�
f��<F" �xlJH_7����}���`. PBB��w��3�
! � ��}F00D�a��
+�)����"������rv�C���r� �a
 �;��
b��4@�
��7><6����'�H��7�
�7�a`����aqܧjht] �?�Zx M ��'�_޿�8��`��
�
C��08�������� !�~Apw�?�
��l�	��*�@�-�ՠ;�
�������n��w��9� 씐����;����an���}���_'����!젿��t����zB4��"ݛ����C< "�bB� �+ �v���≯
�C�o�}��\�. �}#��0(����
�x�yB�����
���= �{���f�O|/7��\�^�@�����,�Ef�D�}���q��:
+O͸���?���H�/P�+("  
+Eb���;�F�w�X�@����WD
	������݉�_���ku� ��Ay�i��� ��������G����.I������� ��ap߿(����_m��� �7���Z+"�v��L�t�&
+�{���������Ua>;=���O1�i������C��� �H���%("
+ ���|���
� ���{h��C� ~>���p_�s ����$� ��ߦ?н"�Ap�,� ~�����^����{.�_��.��B ~�Aa �ۿ�}
���������z� �>�������~X��~P�?�w oz	�
+s�
k��I�֛wmPP���(��xU��kC?DI��X�}̔B��z��"ɶ`�]��	���Ղz�$�tu&�v���D�r�]�Sp]����FagO�_o��}"?�E��z�6��SM�����a��v�m06�J\\-�Y!��L�Bat������n"��ϋ��>A�宙b
T�R:�����I֖l�f�(���0`�m�]��*�3�),��ֽ_/�Ts3c�ۗ�h*]��j��
+��@�c'�/�S���h��m빐�bw��I푟X�M`��鯩�u���ݏ⒡.�XQ5w+���Ad�K-��[�5��)����;�n�n-�(9Č���r�U*E�G��h/�������Dd�x�9��|�+�ø��آ
dT��^�k�r�מ2�L�������E���/0(/HR- � �cGy#�+��wrn@'NS�mإ#��y3Ҁ�T^
_�mQ_����ڔ�>@�����w�Afm3;�{ۤpPO4�x0!ʀ�A^h18�^X�\���Π���\�8gd�R~VlJ
������r�3D̵�L��T�M��ώ�"�>�Ojb#�n�U��W���11�Ȳ
+�h����������؂S���C�z�y88M6XR��1
�Vs��3����Pv�F>�ߊ��m8��w�)Qg�4�ם�2L߲��~șP�ОV�ݚѯE�J%ڽ9�ϑ������R#���d���7i陲R�.O�!!r#!΀t��43B��i�'�Z����T�_�b�lfl��%ō9��a.h�rKX��X?�Cۋ�)�&��"BC� t��Q,��#�6���p����N��ں2���_�����7]TQ�>�h_��m�'S<���S8 vE�w�����
�j/�":���̜���������
��v�{z~(�P���E�/���u�>(�����S�g�ز$;
�����'�n�����E9��ʹ���KZV�t=�ul�H����.'t��~&�)N�m4��
��/��̎�-����TO����0�w�Pd74�qD����F'
�&�Cv�G$�6o���4O/۩��#WӰ�4������aކ�w
+M���
z���u�#�;m"p(��XJ':�V
��{�����c'�> =�w�;%�@�7y��v��
N�'�,�?����j�X�z�yq�����Kz
27���r�CAe���P��Q����f�1���U|��
\
K����b�.��ʈ?z
%��)*
U��/�;f�
{Ac)_Z����f铚�7LS*�)�H�YZ��
&>(��D���:�Qc
+�I4`]�f
1s��
&
���`[�����45�>�{BX{.��h�qQ���^6<��w5ť�cV{�]W#�]4��8��Ѿ�n^�EC���9�
+���T�����
v{2(-���>�:<�mr
N w�OR��#�ض���R�Ÿ8�.'�M�e�_�R��*A�/_Yz��cW�U������Z-F/��?F��I
�Z��{��"Y�� �y�
�a����(*��$E�kP�c��Q��3r��HQg�aH�D|z�<�&;�
Sv�!}���Jox�*j�am�ԵUkRx��p9�8 �ם0�w�J:z�{��/$��C�Ga��ne����/Y�$:�1�b_��
�¦o�����ަ�X��x��ϞR=�9��ͩݫ�u4��\A��o����.a�5���v4�j�cC�$R�Z�Th�ד��+��}��Hv��S ��5N��z�G�F�S$:T"ܿ��p�v0�Y��q�����;W���c�g��]�g��@�y)Ԙ�ڴ�C�역�i�.9�d��b�l�
x��6ۊ�
4A+y7R���_�w(8��͞�u�F�|3疳%�UP{3��|�cL���.�-���PQb��i:�l�W�7��M޳����C��4�Kb�e�
o��p#�5L����N�F�&èS+]��ψw$v� ��]��_��+� `H��v")�B)��9֋fY�qR�
��.�&�Nl����	g�A�'u�h�" �ɵ�U�z��l�������d�5=�k�P 
�ݗ!��IS���HӀ�C��Q�� G �	�`�)%�A�
����`0����L
������T�?�X���`}�8kY��~uة�f���U+\
���\?�JD���((8~�a*ϕb�`+{B���'b`0Ͳ�G	}cb�z���]�݄�\���gb�A�zY�
+)#�G�C;��B�.�8Q�3�ٕ	CS�
n4��
+�U�^Fu�x����K'�eǜ�݃
+�>�����ǝC��e?Pol���3z�3�o};�jgy��x��P��h���7J���u�%�b�.���J�U/�}%��Gk��+�%KUj�E'��
6�d`
�R�B�ʾ�����D}j
̺�&̰�~���/9�b���A	/�
c5������@#z~���=o~&wZ�n�9^�K
��d�-4�i��S��|�ü���r�v�nS��]�P9����9c.ǯBV	�E|�$����.b�n��H�j��3��
^�6L�a_�����qd���"��'$�Ko"�Dk�C��|����׽��>��������=�E����&-_��e���
2�Q��MT_dy*�F�l<���}_���	���a��Q�
�^Z�K����lɟ[�J���i"�o1s)�:tV��/��s͕:kW�v��Řf��o��=�������U�:��圡�گ�
��R�DWc����ɪ[���ǘ^��NLD%���M�$Ixس�P&�v�
t�վ�U_�ɰ��X�
�.�{5%�W;���R|�'�
�'�X
�‰뷀�p&<���Û�vm�f�8����T��*"�ic� �F�0��0�m�whYؐ'g��KF�Q:���d����l�g�a����C�O͢C��3��$$

+>�(ܶrX��q834�ݴ���{6����ELv"ɜ�̨��qݰ��x�͋�MHM�%[)��d�`���^�*��h8��g&�h~����w�%3+f˗oGa���\I��
�+������U��Ou��+
S��=�LJ}�8��fFh�M��{z��Ћ
�ehJ�U��Ԕ$@�[�ʒ�O+�L\߿K���1�E*��|�a��X�H>��:
���������IV��
ґ���l[� �z:�&c�!KU�����}i
���bP]��*x��O�Mr�ɱ�ZN�`=��6} Ԟ�"N��"ԜgN�x��E���9��0o�
��dR�^���h^�6T�A-�K�R�z%b�̯�נ��V�~5bG���,���^=ohљ��`���)dL���) 3/d����ۿ�VLd��#�#���$c��i�X����3�V1��AE�n�b��%���
̐}�n�
+��|�{I|8%�noqX
Y�����'Kb�QuǴ'pX�{r�e+Y�GY<���Q�Sd�=���r>_�!d�:y���)�y+l01��Q]�l�����!�
�xRL
�KK�k?�
B�F� }/�V���>���^��
n�h	���%t���E�6HY��%�����/{m��Nܑ9:bی��VQ�Yc��wv^ȝ|G��O�l�j��fz�
+�H�Z�.���g
���"s�6��Q����C�9�	���G��I���=)�o�0�nW�(Vb6@����`�Fj3K�4.�������
��@
T�V�Ǔ	�f�@��b�4��#+�_��U]��au�W-,�G��_���}
�u}t��q��>��!ds)/�/�������߮5,6����
fAh3�$-�/�����<'�����jw���
�~�_NKU�h�2��ܑ.d����j\�R㹋̈́���_����R�b�Do��%(�2�?3�$K�����f;�-�µ�Du�Xu������/�̨�_�oג^��j b���'9r��W��
I��Xw�B��.Tc1rYSZe_(!
+[�� �ͪ��*�G
s&./pTx�F�����'K�Q|@�6-a��t(�s��s�NG�t�����k��MS069�$��P�f���$ɽ[.�hߨW�s
)hnC��
�*�	{2��|&4�
5��p�<��H���V�U�s�랠���ya��u
�ܶ΅E��އu6���D�kZF鿸yA�\O�]%�XG�L�W���^3�oS)�뉣5�0OoD�Y�,�9;��:Jhܨ�V�~1��Pp+�X��O

gk�.�{�N��n�
>
�3'Tq(�V�:_$�WB��`Y�i�eѦ�<�I
��$� F���2i<��#ְ����rm��gP�~�9��L�i7�n��9𥾥4�b�
3$ҳ�J���[�yJB
A^��A��!��՝:N%������.1���,�gn ��jcWt��G�y�,k�i ̲���
m�ojA{�Hb�޶������h9vc��7X����
k�D�������d2�J6�
��
-��;����.(;S7�]���E���r}��j���j��^�
X�a�Ùξ�Y��ìp����gʯC��:��j��!N\�V��x����L��΢r{�sU���3Di��6�=��5�2X����KY�(ѻt16���e9(M ��rघ���ԃ��׋�t��@.�ױU�&��kO)O��^�%h���r��jr�G_� p<r/�!��������ċ���uѣNv�DU$�<�v�N�
�}z�
P��A'�`v���@
�3��A������Ŧ�!<]�;�����ZS����5��
��׍��/T{�N�X��^���
M	=�I�W�� �.P�z�Q����9�_L8�P�{�$F���0uÐ�uGA���ԳY�����[�5S�����X?C��m���k�/�}���b�oq�_O��Ȥ�E
aG� 
X>���>�A���^-8��_�nJ�3{�����8�8F
�
�_��r�;
4���f��o%�-.��{�J(
<�Q�Ƽҫ�Y�郈0P���]�JT�cZF��x@�u�,_8�A���;1����c�f^�;�K�^��F�1��
�\��ꠣ�xT4fa�ɐ�֚U�d��;�7�������z>�R�بo
�K��]�(���7��P���@��?����\%�#b_�~�Df�#�X\@n���
}�ێ� 65�[,v=�t�a�R�L����q�A��d�6���ȧ�Φ����[
�ɗ����4�<��I�W�W�p�V
x���,QIH#8��Х!|���_X��Z/�# ��3V� �
.\r�
�
����
x�S-XYLU��hnȂ�vD�V#<G���u��@Uk<u�����U�Z�}$5�@HF3]�B(ڦ�2x��"���balK ʏ���Zς�H� f�m��\X��:���S���5W�I�����-�����CP��]�ѩ�z|��7�:�	�����
+w&����.h�.P�G��Uې��)
+vm��`��e�P ���짼���β
�ܚ��XL��n�4��}`Rf���1F>Z��������մ���k!�$����L�VV��~�]
W)=�9�QcF���)c �3�g
�T�7bD���H��7�9OX�p7��	>������
��1hn����uZ2)����ᡈ�(7�!s���{�)	��|V�
��S
��	o�����g�I*6kK71v��)�af��;5�,}\�El�n�uט
}�m�t�V�y��M-@��<N�ڴ��s&#9!M���u����2~�Jf��=@/���ƣ���/簛�O�Ӝ��7�����H�YY��W�cA9N�߉�w�Ws2���A��+�/P�<)~��nz!���YH0+��%뜿�$���Y�#���i����l���fUHڪ�
���G���Î@4� �RRo��1-լ�c=D�/�3�N��	��
wpwkP�x����=cD�b�j��y��&�k���!�
?�U[Ϟ�Yﴽ�QN��g
��M_B'?j��p�����R�<hr��ȼf,q��i�p����fw��";Jyk��m
q}���c
%@n
a�b��1��g��Cs�����j�'Q�MӮ�Uϛ��H:l�dQ4�M6vo3��i;{���:� �%�C�W�"A
O�kږ�� sY�PB��U�!N�47~�Fg��Ѕ������¢/$�kQ,:OJ��p��E��>d�=2߻����iE�LL��I	�A2�KSy|�W>#� �G�Z�m�.�#(����K_ਏ85&���%*�{ ��ͺ���6K�1i�ܔ,��7����J��grZ-Ե7��u�[��?�d�Hk�ݑ�5��u�,�0�oY���y������B�N������m$
�7׎א�Q
���i�_>c6ޘ�[�� �Jq�6�i'�ւ�u�FV��P����!?��li���h���#���R%1񰟓�����4�c�?"��
c�F��T��S- �D9�,���5T��t�������U-I�����-�Zv�E���:�F���~�W
��rs�7�O�FzkxU���z	
_��Oģ ���qH}��21�G�\ͻI���0
<���'��������B����vz;���(
5����E����Sĥ�KY�k�72 
�z���=��l�A���|A��^���(y���/Z��kx�T{;/�}�J��U�R8 �[�ҫ����[�
��Ҟ��G�{D�DC��y��k7� �
4
��D,s�U�Y��*8��h�X�����RbM�[�������d�)�h^�,*k��2!M�+
���$�H2�=�*y�Y�<�4���j�����j}�����Wyk��a��
R'����nX{E��^��$�w��f�
Dzi>���M�Aơ���+�;��g�|�k燕�����X珩�6�)��֔��5yy�&� f��[�������0סg;c$��sȼ��Ub����
��p^$�?}G
�|
��X�.h����Մ��a	VZJE2�����f����w9,��7�̱Bj6U��(��@;��t�!rs�\����ar E�+�:Z��D��l)�5��YY
t-����It8ߩ	7��y2Ѯl����
~)�%��1��`�{G
���{Ppk�� �;̩X����~�h����V��
A���w#�<1��4+~����yS�5߄?t�l�ZGL�t����E =(���
������#�k�Qy��x�BPRn&��
��< �R
Z)ĭ�Bo��@ͽ+Lu��xi�kFtSN̾��h�q����(�%S�&����_+v�
��?�_K,��
�
-c�Ш� [...]
+"�>�m�z�������B$�}�AJn���Gߕ��K�,w��sn��I7��2�ܲʽ�Rɛ
+߮v6��������O_���>=Y����N�ry�?E�F�0�K�Rl5Ms��,
Ba
�4񝖸pG���[+gGt
�)������� m���j�
�ڬny�S�����~���5�4w1�]��+����y�v�+�K��M�'�
��	��NU
+zIY�F)�q��]8H��Wg��ɦ��q;_�
�ϯ2�{�b
��0�b{�j�����oz\���:4�*C���Ͷ()��GU":|�C'�ۃ��|dÃ�ȯSB
+�Ԟ��qG���������01T�g�|~��M�ru
����|-Ta��u���uD�,��p7��7:�9KSx�7~�0eu��Яna;[�׬�r�dw<]�F���.�<�96>v��AM�\�  �����
����V�o
��K	18�r���w�n�Q4��zO��׮ܣT_��Ҭ�Q[X$�̋�#������LZ9��§�ɷ�
+4���:
㣵Q��m��
y�Pq��Z6m�г&�?J�Rn��hմ�v��` �K�/� ���q:b_*So�"y�_�&�虣���$(���̦�������e/c����9b��˫V������oPIsZ'���
+�,��<=�ʟ`�����Ez�{DȡD��ܾ�	!
�cv��R���ˇ
�YypR�����M}hۺ�4��@��8��-`>\�[<�<�\��$�b�"W�\{���=uԤ[Vg�Np�a������X���O�]]i�

+�A�bI�)��zT�_�Md��#ʫf,��_�+
���bG��%���sh.�P��A�]����)���B&w�n@/�s]����Hf6�Kګs�����S
k�����:��nY��
�	�T�O��
y���`��6�U<�--����/�
Qhv��ӂb�eaVۦ%O��[�5J��ji̤�0�)�:�]��謇y��Ӌ$ރl���>H`��[���W�R�įv��Ǒ�3�V� 
����V�=خG�,�I:�p$YX[z�+`��
F�=~6�L��A��lam8-���jʃӥ�=��Yu��Z'
�|Wu��d�[�=)���m �`�k������_�1;J˻�|���!�_��-Gc�
+�tc��bb�L�6�a �6�#����u�[^��9����K��t���~H��hU-�ˀ��v�w]
+endstream
+endobj
+18100 0 obj <<
+/Type /FontDescriptor
+/FontName /NAIRUZ+CMMIB10
+/Flags 4
+/FontBBox [-15 -250 1216 750]
+/Ascent 694
+/CapHeight 686
+/Descent -194
+/ItalicAngle -14
+/StemV 113
+/XHeight 444
+/CharSet (/a/alpha/b/c/e/l/p/q/r/u/v/w/x)
+/FontFile 18099 0 R
+>> endobj
+18101 0 obj <<
+/Length1 1358
+/Length2 6062
+/Length3 0
+/Length 6991      
+/Filter /FlateDecode
+>>
+stream
+xڍwT�k�-�tA����kB/�	HoR�J �H�7�
�4��Q@��"UA�&E@���?���|��u��Z�;3{f��̞��pq
);"�`
%�����U����	���ȸ�L`(w��~2.S��7
��_U/(��AP8�.��q � @IY����( $**�7�%
P���
�� -
�Mƥ�@�{��]P�>?x
� @)�_� e���BP.P\G�;�� ����U�W��Bʊ���ha���0��Y�O���\ FPo��/��2@��CM��
`���
0F8��/( �p�9@�޸�#�
��0���GB��:���?� 
+�S�O��B0��d���	����� '�;��F����O ���ˇ�B`�{
���! ��! �c�����
�������(�
��Ꭺ(
�M��|j0/����E�
�
�@����`pG��4
}�"��0O�]�?����3�����@=P?��
L���_A�O7�Cp �8�h@�aNP�Y�7�
+ at y�@��w��p�9� �Pg���87�鷍���`%�� ���'k��
pw��F,r�P���H���UT~�@!)�HB'Yq @
+���2�������@`'�O��p'@�7�������0x�l
��
�89C���������
����R�o��Y�����>����W��7���C<`��89��p����-���f�����pw���]� �pg�ȅ��¢b�0o0��h C9��V�o?��N�_S�iCq
���p����IH ^^2�dq� �[AG��/�D��.�;{0�	�E�s`@  ���#�W]//\�_��5�����P�ԁlz
+� �Z���V�-�<|g�k�,�O(p���	%q:_Mn؜סrz��럖�y�f��7�_?jI5l=
:�M6]n%��g�dC�E7+)����Jйg�i�A3~�W���4�Aэ�~/�+?FM-��Hj��U�	�ߋ�Z6�Uh�7��I�b%���88
��k�]+Y�,x3^�4�r
�p<0�����t�ɒ���fp�;Pe�����כ����Ϸ��C��2C�K���9
i����R�mO����UM)�[�^x����k~�`��SFߓΡ����&�C	y3�}d�
+��K�F\H�D���5��ZG@dϱ����8W
+4����L��ke�k�Hɍ�*��ԙB�36�
,9����
t
�Ib#\���"6Ϯ-J�<��z%E�Y9��^y�����}��=x�3~,�$���fR2$djǬ`���

V��H��P��M�4�0.
���E�	�?�?̀�oLgbl����8Y�K
̂�����hp,���(�*����:]s�ɧWgr.�G&K�@��U�d_�$��8[-�
�͙��1���#��a'�EKg�̍6��a,?�l��	8�V6tHF�&���gAsn����6Իnr��	5ι�z{��h &A:�*&�M�=(���V�-Q��x����{\��օ�
�6���M
†s
���
��������s�͚�[�e�;����_���,��>jy`4O��.�ly�q�@�ƳK6R���u2TPf�$��X�D�l�D���D�\��*^K���;��O�M��?e
)�
�婉x-�m�fBx
D4a�3��6s�ͧ��ƆAF�3�<tu��)��V�C��&��g�F����W�#?��N��
����hT1N�z슑��ے2�>�p|�/����)�_�
%��V��@tS����s�dz�	�*�g��Dj�\���E{���	V���rY#)�Ǻ���g{���GZmO|�����,ԝg���=�6�f�D������%��
�}���+�%t��_�о��U�x�9�T�ؙ�I+�tg�����R53�_��]�T��EE���՚q [...]
9���\�Dm�qGb�s/�\���W�f ��ϰCC���ߵg�%aھ�Uxj�HA<�
+�����O=�TT
BA���mS�.fgu��Ę��ɸ��XԮ�%�K/�3꾞�G<�*�F�𗎛�wȶ��R�Xۙ�=�L��4.���w*\�Ƿ�
�����$[

߭O�*9�,��*��\șV��85�0�R��3�s�\��2H�&[grf6{


d]\TB��
+JsKA�
d
+~����-c�1=�V����d�<㏈Y���-5
��m��d�8�]G�Z�%2����9?
l^�}/}Hw�N�2F}��2�6���|��lkS{0 
a5
\�Q
��IÄ�0���黛�
O�qt�T�?
,�_���Kg��s����c;�
mɚ��Q��l���r>�r��YC}��JhF�|z��N9)E2���a[AA{���]��J2,
)2 �'9j	�/܇�
���"�����M���nn����<$���Z���.��@Q����U�6�؉a�*޻S��Ri$�-x�:�rA.[��p,��.�r
1��\^�w0�K
+***��r�(�Ԃ
ۼ��-�q�+&���lx����Q<N)�2m��(S�F�ꪶ���
�m� ?K�o�o�Nߪ��^�+�
	ר�Y
�Nw����.2�iB3�ǻ�='{�u��T��Q|�+��|k�+}�>�4Z'i��|��W������ݕ��u��j0p]{,����	{Ix���}��™
�-3��އ$2[��H��y~��O��a��'25��
#�����
�k��Ji3��ف#�$ləϙ׉x#V�z��
Xoh�DW�<�]�_ t.K�}�*��
�d��+I��Ę�dK�דGe��-Y��q|�_<")��誁*�C��\�4T[��;5��I��^~l&e�;xğwC�2̽�a�Hb�#׍�BP����)e;ɰ2����W.�+�_��n���`N�����&�K=�󽜈���4{��Q��I��:��

T��7�;ۑ�R�]���H��e8M�o^���h����>{�)�I�HYo��W�	;Iw���Y�w7���4��A��}d�h�w8L�#�:�]X�_ڡ��p�ӻ�&�����&��\��=-��Q9��_�8#�OsI�![z�U`§(z�C느�-��o���C2���t5���a�Hs��6��x�dx����d�l�����i�+=�����Lok��1��jp'tw����<���|7J��׏
�r�k����B�`ж@Hh;�XȈ���
�Z���3��OpΧ��zKn����ʴ��>hq��_{��[{{͐�M�R���/ƍgՅg1e7�17!�R��ī�^�
+��80
0�
+
/P/r��-ss��V��6�n?}
�2�2H�^~E`��(�1�+��;���6>Q��ާG!��������h��T��
�5_�ۘ�-�E����>�/�X�+sK���-jO_�,�����B
�3���@��L�>S�9@��,�"��
��7���x��
�G��9�4.E�����Ģ&�V�do�.���0v�fN��w�''�(��x�&�쮫_v4�Vp$2Q���UN�y�
�J1]	�Y~��vϘ�;�I(
�F
+�1
+����O��
`±����"VB�
+���0�g�[��/z"�����8{�]_
�,�����8�ꥰ�̨i&�V �%�+�{�	�b����
�g���o�D(���M��������
+�OQJ�W� ˴�:LGvs�\�1�N���}U�G%���/��u�N|�[	f��?'d��Sp?��䫓u�/�kڍ��-d
C�����WM�������o��'��c��)��:AF-�
����r�z��6��Y�z����1\����Vo^�j��35B"�:�)Y��~ړ1�ϩ+=o�F̵��-������lV�n���{�9�t�l�<*I�V�J�q|KS1�-P�`k�
+��b
Z%��B⟬oEwא<�]}���WE��=NMk4�s{ļ�\�|?e��I^L"����d�u�`��v �d�>��ǧ��@V�*��O�
XV�^hb!�a�{��_���6
��ߺ
�"IC���ٜ�۔���)/�(NI������*����U�1�o��;`9�~C=��U��y���덲
z &�F��B�!Ջ+����(����rPq
�I
t�����2�H��i���7��i�5<�ĭ�2_< �P���g�h5��
���G���
����*G���Oc� O��G���6�9�;|p�����i��Z��x�4���Q
,�Q��JU.�jH�O�$Y{�;H�w��]���i^c����q��`rQ����D�� E�%�S߹%??���絵 X�8�T���>�Z�_>TAh+�v];;Q��6:�������z����L��*V��V߭�@'u��_
i�D7�s��ڍ?-w���
+�TX\�/^�h���Q�t
�l��rҲ+�p��-��t!��,ME^tU
�����?S���
с(�U���q��w|�r���>.7��N�[���?E�n�Q?�qh2o\�٘�KVe���!������0�^��3e۠�QN��v>��d���4k�U�"��m͞&�;.��&`�U&��8%[��)G
+�Eq��(��X`��Yw���'[�V
+i;S�?�(�i�f�t��k�TF4?ZB���IP��o�_��gE�SԵ�T�>�Y���S���}L�V�.�k9J2;�.�A<�f�M�1#y�amY���0�~yM�����&c����ʩ�8{�h
��7�G�!��E�\`��\�i�D�
�M醺���4ߪf�$�
�k�h�I`l(f��Ƹ��L
����aW xf��S��	�֏��q�(�μ��
�
	�%��
~��8N~��6�C��z貺d�C�T�4c&O��y�5��M ~����tUf
�et�r`��
�U��d5�)W6zC#Q�@����W<� �A���J�e_����n����C0��d��S��W������m����h'��g��M`�?�k_Y��䘼
�r���q�'�i���
(4�!�w����20�0�� �.����ս��ˁ<���Ĵ�
[�P��>��D�*�]F��,�����Oޖ>/1
��Ċ<c��C/���j��ʑ�UI
��w*��C~��\���l[$��k�?o�MS �L�� I�`�;;4=l
�OL6I�|�T�^h��zk��/�_{˪y�x�͈��>�x��_��]����@	��yY6�������Ac�x{�4���,�m
Fg;�߽^��4�Z��i!Mhv���$�H�~
���3�����wSD�Ҽ8&-/�fV����+0#��9n�~;$Q���%�d&���0�7ɨ
D�bf��$��tK��NJ��],�%aB��v_�a켓h���#S�xpc<�ZyE1��Ws$�"vq>Y��z�w8V��������'۵���Ut�'
�Ucg�T���{��X�G�3�4U��}	���g[�E���ц8�W�mp�?K7
=��,z!����*me�c���͇�>N��9�3���/>�WX�!k�f��0+��4�D(�[�`�;���4;��W�!��^;�^g/�?q��`�CY��Z�8P1-�+�eE�2���k>�'��p��[CI�Ӎ�7�/Z��"F#��۟2"��L�&e��
ߒ2�՛���.�b寙Or�{C���\�=���(h‘*jwy˜^U(R�
R!>U
^��Ɵ�EW���߮��]>�'|y�
+��S7!�T������O�F�^�A����ڤ��Ǐ�blA�=����
2����,�'X�>�"	�NϨ95䆺<*A�Ն����KT^^�ȿ���6�i�p�I�E03e��w�L���9^��P��n��Ӡ������R9�+Nź�s}'
+; �D=a��%Y�J�d�t��A��GѤm��(˫�z�԰
k:�]���5��"��n�1٫'�
�9�D��>S���RI���A;f�zf9�����E]2z�5야1�t���-j��ǚ�N�]�H}��2}���*1+�*8S�� {O7�0�S{F�u���~��sHd� ��C��
������cI��W� �3M�M}��
�έ�9|�ϖ�BB �j�@�g����r��:J��c���G��Ϥ���g��\���^����x��x��#3�k�Z����3MO�xC�Djȟ�'�4�5�偊�ս9�g�]/�H�5�s��+��)�1
��i)���s#�P��SӇ��j�~���i���#g�خٶ�
���g�SCi�:�z���{ʂ�r6����&��p/���]�ϼ��M��0v qi�++��	s��h�h�[�{��{Ú�6H�%�m~�	�{���
b�ȪJ�y1���{G���_QG�6Á<�L� ��H��I9m��z��f
z����l��o1&�3��?���
+��M
��
�����ؽ
�^=#��5f�]?����#|����~��I�Z9�ߕHV��>A6.��,|��g�|&E��rQ '���
��\Ϣ� 2����4��O��F�FAE��	c�Bx�hi�Q����@֢/瑱����ݹGy��O�j��MQ ;�E���1��ն�ss��AE�B
6���ٱ�0*R~=��C�����?��
+endstream
+endobj
+18102 0 obj <<
+/Type /FontDescriptor
+/FontName /UQOYSR+CMMIB7
+/Flags 4
+/FontBBox [-7 -250 1341 750]
+/Ascent 694
+/CapHeight 686
+/Descent -194
+/ItalicAngle -14
+/StemV 63
+/XHeight 444
+/CharSet (/p)
+/FontFile 18101 0 R
+>> endobj
+18103 0 obj <<
+/Length1 2131
+/Length2 16352
+/Length3 0
+/Length 17640     
+/Filter /FlateDecode
+>>
+stream
+xڌ�T&��
g�5�ɶm�5O�mM�lk�f�m��LvMx�8g������w�V=���ƯV��J��¦��@	{;zf&
���
+3���������\������\��lio��/Q'��ˇL����N�� �j`f0s�0s�01X����ch��3r�4�3 d���p���N��.i��@eB
`�����
 l
t�41���X m?2�� T�M,�.�������Ł����ݝ��֙���\���n�bP:�܀��?�l�1c�#�YX:�%W�7sq7r>6�&@;�W;S��#9 at UZ�� ���X�/:�߽030�7�������������������
`fi(J�1�x����L�04�q���7r3��12�0��r#���2�����M�,
\��-m����G��.�ۙ�����\����O��	h��vOƿ&kmg�n��70��35����������+PZ�o��?2s�
������� t =L,���� �S���������������
������
pqr�z�[���`ji�0�[����C
4�

������{� �?���I�c�L��l<�1�s���JZ��h�b�_��������	@���`�c�8?>��o��6�?���*Y�]ܿ"Jۙ�����Ѽ��p�{-��>j��fP���e ����ebg2������ �t����D�[��[����͟j�?��?j#[KϿ
>V����,��?�����j�:ey�������J�}�������h�,a�4U�t1��k��3���6�v@%{g�?
 ��������L�?
�Y��~�����3�7���X�9 FNNF�p��@� o�
5z��� F;{��=_����e0�m\����%`0*����ps��� ����c'#k�Ǔj������
+n ���G0{������o�/�� ��=���x
�
]?�� ��?���Y������Y��n�J�����_�>L��?Z�
����ѿk��k�����pe�h��ǔ�+`��e�jk��y���'���!�GL�y1�A���G�������������Q����E���_W�%�����0������
g����Α���_�� �/�?a>��O֏�����	��I|qq����G�����v�����_c���'ۇ���`�s@&�N]q�������?��
@��E{���!폵Ÿ��&���4Ө�W�:\�����k����GzQ��ĩ�V�^���C��&*���y1�W�9h�[���*�%�c� �^M�����G#���K�<�ѕ
I� �ѽ_���@��x���a
�,�K�,}�z�n`�<y�q�	�
=

ڥ����
Z��;�L<-��i
k���m��O
^�j,�ݸd��q����g(�E�Sd���K���=Z���r�R��Q�Y2k,U������W:���!�����ʚ0
�H1k�
��]�X��ǝf"��=fV���ܳ?�����{��;n���?���>�4����j�⛻3ӈ[�D���d�B��L�uk�1P�Vݒ�^ �B����D��w���>sA���㟳��\}��j�T�ܞG]�qG�
~�Px7�J��,µ`7�
+�������K���
�0\�x�]�� V�I$��˾|5DV�&-�w�T=��i��]�p�Q���^�L�E?q�8,
��}oz�{_Q!��yb��tY�
!2�uG�3$�K�J at n��b��pط���>Xc�357bۦXdM5�罉�o/�t��b��+��'|�>+z�b�}��BX_�X�w(>R� d�l|%�:\'5�iҸz�����X@�
ҷ4;�G<6�G�mS�[���
�e�N��� ^�
ȸ�⧊�|3�l�Tw�_ů˜n��C��Bw�2aL�J��(�6�i1�s�v�����b����u�ob��V��vk��m�	F����>|�HΝ���W������oYC���C�4'��]����z�W�OM
m�cr��Ƿ@�1�=6�J]�U<�8����u�mZI��r�����$��K9E�7'T
G

i��t�t���E��O�7Q�e�HK��$�I��W�d>5���|�G����3�~�|ل�Le>0��|m'��MO�Y�#��y![U'0

����#���7�)���
�� u�;o�<��ؘn�]�
�@V�y9�[�}�d]�OXg���@Zf`�K�T}�����!\|�3!$��r��mm=dSds#��4x�n-���Q�9xh�ǴEPq-/�$���T9
��ͱ������ s�u
� a�� O�V�ՖeX���9B�C�-9*�m!�YD2����s�
+)R�2��E�iN#��CZ������se3}"��N7ίy��H��

���
�y�q�W���8n:����|%K?�צkBz^�<MF�7ā^Ċ�w���-��B�$,j����
�K�\�*
+����S�����~�w$
���*�6gM�*�/N	k�x
s9˙�V�}���Ϭ�=,�/Tw�|F̔У�o��Dv�4�0@�_�53�龳�âg_޷�6x��Cv=��=����i`F�YN1�)��x�^�H ����ٱ�^�S������ɑ�z,����?L��O5��.�b��\�软�@Jc�s3Y�ń�l��M1L"�Ӷ_�Is!�
+���vݘ�i%
���0�t~�V"��]_�M��8K>��0���
�!_9�9;z�h�p��C�
o��X7<i���T	LHH��ʲ}jO�6վ��%��𛿬��<���\�&��~|����;G at E^�~ǃ�K��"�|�l�+��FVOB��=dy��iɁϯ:ඕ�^S��P�h6�O$�2�@�e
�XM|�#
�8�u��5K\����͒
4�f��6��!���l��9�� �G�o8:�Z��C7��y5�jJ�wn�yOp�Q���U�`'����DW����hCZo<����b���6+�Ԗ��ی���Am����
+fB������Xy�!c��0^��q��*eV�c

������9$D�jEŜmK�v.��E��Ӿ�P�\~]�m!��gY�G�|��i��_m�l̫{�W�g�b6����R�tw^��ؔ��k�� ܻ���%�ŀg}�gӯ�vH^�=0�U�GE<��r9^�z_Q/˝�#�
ʃ��:��%9�ɤ�,�(���?���px�����J(6\���
�R�(R�*,�3���9kS at q��}�TO�2	��:}L�]�(
x���`���\�u�5��������*^�e��d����h��pav�*�Fp�b�a+T]f1vO�5���+ �p,��ƿo�����W��r:��{�i�J��o��WO�'b������H6<�\�P
+#�4�Ϝ3�s�2ܸҞﭐ<��^��{��ϐ�ٷ�l�y�3�9�.�i2KxL���n��l�c<4<�VQg�I�H��pRK
ܮ{�	����J�D���a�5k�V�2?����
+�>�r�L[+��G�ւ���v��O�	�x���_�V���ʻ�Sl�V���
4�
+�e��=�o�[~�� zz9�s�7n��XDQq�P���펑~rL��I�b{�����`���V��%�%���1��᠔�{U���N��O<
+Iŧ��swCIMDBPf�Y���,l�he6^�d�,����7BO���
H�墏Nh��H��m0~3�,�V���I�UN��$AS�n��us�� �75(�7
.
+S%W���*�[C���x��T��2�}7�~���m�[�G(�zX�Wz���� U/8�y����
�^@�����  �YYhYzeۅ�p�=%�[�������%�b�.��D�r~ͨ�Q��R��~+����.\F.

�*E��Q��t\U����D��ڥ�u��f��O?�3C��B=�5�"�|Ж�4��
�������[�42t'[��s�d����k��[�4�m�e��w����B���0Ģ�DQ��&0
���O/���෍
B͝��L��gt�k&�3)��
� К�m�|Z�2빎�F�Si�&��<K݂�v
��xU���ݲ�ͷ�@���i�[
+��5*$��](��KY
�1w_!���y�<����T��
+�K�z��Y<�L�%J�v#fz:n��H
+B��z>/�2҉2{T�`
�
+����	��Rϻ&I�����N�*r˾r�r��#�K2W��Ȝ2�~f®��]� ��)�&�z���~
�hNu[恩L��"�S��5�(�<�
�C�BƭǁA�l�YMmـ�6rb�{�Y%ׯ"�O�"bd����Aޒv6�wv������5��Hh�mU�
��K3Z�n���n&�����.�_T�j!���*9B
w�.�j��^`X�ƿZ�ìpJA1�=�[�A�T|�sV���C�K�J�4���7]3�Hh�����1$��>+�	߼� �7����7�	$
�t);ć�U��Qw�5f?5_3��B��R"����@��Y	����,N�$9�;ي�����l(�Z���2�7�/����k����(s�V?�}/�1~��q�8Pp?jڋYT���P��Ϗ8��2�Z!�"�:�lCu5�@C�
+
Q>`�uP`���|F�P��-oEJ�Tmn��as�Q���?�-��P���h'��y"�����>(��ŕ%?6)�i>%���/�2.��)@��@z3׊j�4��
&gQ�M����i��WҖ,[��%䆈�׃(�����
+bH�ؚ�ƒ{̊���
n��
+/@�s�t�
�XO�;d�X�^��ɟ�N�^���H�!�;Zͨ��Q���Kxe6
5	�I���JQ��C�'�C ��@���%��u�4��Yn����==��x��h1rL�
=.!S�������0���n�d��6�G"Y��ZuDi&�<=O������r��Ԭ���0�Dn51D,�y�(�32���1��8�����L�[>��@�uR8��r�5JQ
�@�t�U�W����ڞ+��*�l�
��� z�ta�Ȱ{M�zy��X('���5åi;mo�5CV07�j�VJi��W��:�����9���S�(�
�I�c}��e�_����M�{��U\���dN�)7ɮpf�&�}��=�~įz
�ϟ
�O���@;]�-y���:C�ר�
���'�o��PX������<;W�^�9��R�u�c��ܖ�A����q��Db<��v�Y�q��~m
��b�$<b�ϱ�<X�-I	���M�Z7�0�ʼ{u�
�e@��P��k_��|!��L�*@о[�Q5`{Ҡ�X#��n �	�ذ���7�
c�<��v���%�6ۗ:�*���b�P��f���dϥ�zB�O����-�����PE�C�� ���
/�KŸ́���Q-]+z7���;f.NgѴ�PN���ybcVM	�U��7 ��.������0�w[�ʋFZ-v��u�K\�aT�p�epCP��dˌ�����G�uv�<�>9zBHS���[��˕�Kw�4��Xv��{��O�ƹ�i��v�V~晼8�*�b�n��_v5t}��<%�\\�8���_��tΘ�9����2��0b�N�d$��l�xNa�;^��'�|�C�k9�l4_��ڣ�߅���
ȇ�����v��_Ә�h���jl?�y�D%��E	4q�9���P
 [...]
��|�I�\|U
�)U06
�]k��
ɱ'��Y)Q�m���1�i>a��5ε^"o&��]��s���r왦
l����MP�E�7��T*c� s�:C�g�Qh�=+M����8!a�S�z��&]�..���J����[,L�����U~`�����[�okni���²������ߴ�+ߴ�OKRP�~�wO���Ȭ�r"u�j���C^X�!P̮� �V
Ft�������ߥ(��q�}W�S�F�B��S-���6Yr~$�	2Ey����/�m�!)�HG{��Y)�V����\�X�1rj=�\����+D��E������{,�,$`Eͧia�/�
!�T0���>��Y�Imm�B��)u�
�
T
>�7�yK+LHR�兌$�k���#��W�kB�xx�=�{}ПO'���M�������B�r��xW
x�N��Vf
6�� m�J�zC�:�Sne�z�F��"�(0���~�Eऱ؋�W��.@�{��Ӡ`���n߉�s�?-��B�@QJ�nY�[���#}- [...]
�Z_r��0�����>�B�8�(�m��6|�
+$���w����}V�q����M{��0[�� ӣ'&\=�'�R+�a(<DRY}�C^�(=�h�^�gD��7؈��7ni&_��]�eL�
V�U����}�,3���;���Qj�.���gw��Ks��1L�y�mS+�▚u�
h�!��vg{D��8YpI��=�*��p������k/g�� ��~��zU��b� �����^a֋��KUx�~~��E��Mˉ/2Y��?���LNWq^��}��\:��g3����"1��g��p�e�z�d�|@a��C��56����^2�C�u�7��{�x�!�V�Mh�ɷ�`���ETٹ�
�{~�Ɣ��-�g�0?V;i���7.�
��Z��NC�v��|<�ƌ�N�
��P v����*�+��vJ�6��d��
Go ���
��F
�̒eã����]��,V=P���.��
���_��1=;.~��<-��ك]Cx���9B�]bM\>~I/cX��n.��
9�r���!�������i���ꐷ�7�� [...]
+*:%���E���
�
��;UxB�GK����x��G����M��.�㋡m�����͚=�:��� �_֓R"��sLpD~�O��_�	��!Rg%�1�o�M��,Ė=AE��X��v����Ƒ,t�D)arA,s}��n�'����x���μ-������w���h���f!����M��m-�!�ɡ�I�	N�O��G�5_˖mI�e�bHY�����ؚr���ӎ�j

R�q 4K��;�UFviT
+A��"nǿ���tM��K�!�
�&_F!��5>7�f���V��{
�R�yUV��=!^tp/�b@�szX��������d/�ag�%�>���S �~
�������% NE3����[��R�s@�_G=ys�)�7Ii�:C��D�+���8N����[�J��j';�I� ;�
$1�_�&(D�V�?�7��{+��w��+P���� 
FUAO���i�ð�T���vו��A�����b��K#s�Sa�#�uV#R��)e�\��ZЖn� R6"䖜�,�Ƴ�75�ȍ@���Ո�݁w�	Es|FG�sG[�}�dbMϝ�M� �}�х��
�a]�Y��/G*صX�a�0D����y�Lw鴏������FdZS"��Qy���
X�P���xi��2���'S~]��V\
D���fR�)
U��*�T��=Jb����]��ZcW鱻`��{����G�D�
1� ��ק�Þ�e���5�~|{�7
-�1'n����	%���,"p�P��*�n�����ϑ�� �a�p��u �.WT�
�@5�
-
Mp55k�tQ� �Hl[ڦ���
�h�=
��s���}m.��ľ��9�}͏�7L(�4
Cy��q[
��	�|ڬƧ�
c��
Ed��i�p
�
��V�
9��ȥ�^9��.ES��,ĵu��#���㨴^�Ҹ��"B�:���ћ�U����4���;��92
�,�L0�3��xLA��r�$�#�#VV JD�v(�
+*TTJΠB�@��K�ȹd.����@�ܺ��8q���΃���
G�6�S��̢v;�E:�A�$X�
+qrF��)Li�4'�Nv��
+=�(�
.���Қ����<,!�@q����|�Q��������3��
�.w���E�ȕ��qx,��Qу����7|��+M�	�1� U���� e	�up?Ⓕ�.>��m_0|l*���+]�m
V
��S����|�k�_	۸4��U(;?ٸ��@�{tHr�̝�$��,
��,��l����Q�I5��/F���`�i��gvQ��m��`��)����j$��%��)k�-�5��Lt�oD}
v�a������,Z�Ͳ����t_=#����� ����[��Kh����yﱚ�XfC+,�ГK���	����6�mQ��Y�K2]pic(�
��g��>ˋ�%���-i����^B��pɶ"���j�q� _��N����C}�������j782���J[��baY�rޑ0�Aテ���Ҳ,\U ������1��9X�!���#���;
+��H��s3&��Q��1�2.^����V1ʐQA�,a
��v���g�:�tg���\zـ���ܥb���^���Vm�[���u
+�~�M���e_����\
P���pn���XL��;
��;
<�4���sj��2l��������.+�� �
+�%���ͺ @
2dg�7M
��|��4�j[��k �?�
�`o̿z�7PX��{��>g�Jl�V���u�#�VKՍ ��aLV2o��j=|�y0R
�O��}�5R{,������ّ�D��d#��%�fK
+��+Y��g
�i���dﱳ�)�
���6��B���Gm��e��3NA�Oߧ:� KoqE�/��:�n+�屆���^�C�y��q��L~:��|ey�:����
aD{p�mr7��NԆ�; ���v�Ԩ�r�n�IA���U�\��Qd��f�.�� ��{R��K�Ľ(�l��?/� 7�.=�cM�VS VN��D���H-�[�ܧ��j�0�)�����$V/ [��
��Ny��WUTq�
j\1R��|����W��Ŋʱ��g�6�O:1���W��(��-�\�>z�
B9���N(Z�^��|�!�����E�vo�
=��w�,�揝}�´e�_S�F��%;*���cđ�>	���lAN�����N�m����Y6;��3D�•Dr}`��z-&��*��k�����~��z Mb�q����o�kf�\��A
�^^,L�
I
7�=��K��O��|w2� m�r�4U�
1�,�b��j���K��T�O�
��H�Nq��]d�;�PU�\8��ƴ樔��!b� �8G��t
V��!{?O©���覦[�]Nǵ9kԘ���Tb���5������4�o~�h���X��S�_��I{(�f<���gI6�C�p�?�\c�h8����N�o�
��o�f@����a~����y�##��}�.����P��_,#�)���I��e�
��
�3��Uw�l�3
U��
��|�g �R����۩��B_ū֥�0��}��t�J� A�҄j�%~����,#T��
��!�KOŗ���~Ϻ�R�����5�o��Z7��b�i2YY�u����������4���9�#�R�SڀE
�P�'*��?�u$|�x^2�4=7a/������:�KE�ͼ
Q�zg���g��c�yl��
��_�z'��<�-�
w-�ܹ��U�O�n� *�?BwCM��O����rT�?�P�5\ �F �W��0�L����\�,�4W�lo��R0G����Za�GC�q�q�:\0�z�����P��:	3�a]2�Э�9
v�{�ʽG.� *e��0��7�ǐk��H�_PJs�qWu��wr�&��?�O��4٫���)�#�Kk�០Xe¡�LV6^_�s�����*����l�|d� �p�����}w�N�%q�,oB����mn�E������W�Sܐ��B<�G ���
��2N߰ӹ�
�A�r����$�yA�k1
+�޴X{î�Rqfl
��4!uk�3ٻ�;X}�ΡOЈȚqr��G�\w��8��;
%
�;���;ػ 延N�N3��f��� �wC/!ߣ�νC=�ģh!���hg�G
+t��9�5�k�U��9&�a�L�@7C�"y� �۸=e�fW'�E���}���u�>{�W�N�(��8�f��,�Ш�H
��G��
+5��֕N�8-��
X�}H
��׍)ҟ�/.R��Z�(nxZ����ʮ��������h*�"v����G�T�We�e�t�S�*bsm<U��`RN�V�'��� �
YGL�w˶�ߙ�qD}�G:ł�d�����o��12E�Ҕ
,��֓)��4�K��3Ģ*�[����m}�9P�&��C��g
�_�I«�v���Y�����#��'��A,�x�.!w7P�����$����	�
���Ej
�mEt��[��r�f7����	fԀ��a�
+�ȸ�zp9�R'`�uSp���>��aÁQ�g���G�9�g��KM���C��
�.y�m?Ш?H6B�U-*^�
z⨹W���5��Z0�Q�rA_Jƽ���(�b�¯\kK�8�n��hH�h�W5�6FϜ�z`׉퉘.�0��?%1H��K��� \
P���
;R�2��]ң��X�SS�^��§��`2ڔZ�-��H5�,�����G�
�D:8O_~
�H7+��.Nk7S�զ��me�ܴyv�m���/�;����(��P��9�Mw�*��x��+ at i,��@I>�f�x�-oƯ�n�~&#�ѓ
8-��
qz�
Μ��1,�չx�c����צ�-7��CL�x�i�����P-�TȮ����&Z/;�;�Xs����Z;���3�c��po�ONc�l���ś�(Ժ;3�8`
�R9�q�iϲ�������r���mQWS`t���5�"���
+Z
4ͯxJ��
+X�{�jA���LM���
�[$��k�S;`��.c���^�؟1r�4��h�
��cRиڰ4t��-�-��#�
�7�*����
+#��]�6������˨���T�'Зu}
B��ğ�to�x�v�D^���J�Ԛ�k�}�����T�cV
+�jc�)�
l�x�M��L��Y�����LȞ��y�"�(m�ǟ�FJdQ���ͤ�ٸ�G ���
�$�AMy��&_N;��iXH��q�7��>����z�3K��
�^�IZ�C
!4U�c	ݏb�����DC��Ǹǧu�c���6�h6��6&��n���$q�8��o���w[��j*�ʆDr�T���<�C
+�wZ>h���t��݉��@���ނ�H��v�N�Y�v#�ی��a9RCH�m���\C~�]5:w���?T�#�|L�FIⵆG�r���t����Ao"�f�UJ��Ps�Mp���q�_
������x� �]
ѱ��n�Hß�*
��~zDe�j��s�4����?f_�5�
ZfW}�8��
�����m̊�*�3���m�`{�8�ػ��ye5�dT�L��fj;+����eL�RԣL (v�:t�K��~�W�_�羬|��
/�D�˘ڜ�4�,�
+��3B|_�YWW���~$�w�^�[��A-�È�Y���":-)��.m���{R:Fcn��<��*fo���1�U�Dk�oӃ0���X����8��MiH
/��5H�߀R�xSA;��lۨː��t�+ɾ<��g`�t�
+Xd�xH1�R�臀LN��%�C�ߙ�a���M
b>�=ʻ
�A�y����>�h�)0
�
�O�0����L�
+_�):�%&�_}Q�ag�nK��ec�쐠��sV�.��|��u/{�=TT��^=��[�tt
}
V�˺LH���	+��#!����g)H����
+t��GV$
K�5�ri. _�mѯ��D
9�X��o��o�H=x�6�7��]�~���x����'
+:���~�J
{| ���	ɩ�A���(��)+w�*߽)<�� ��Q��Ǐ��8��N(3����Y�o���DCN^�g���
9yRe(|��ua!�S�2�k�j=8V*|M��@h�ʂ8L;%A�"
c�Y�q���([�=��P���%�s펀���k��
�m�%�j?�>U���Q�1���yVdfu���wfw�ii*%������
l��'���:q�h�#��$�)5��X2��?Sx�!���<�l�����i�
�v�!A���X���t
+�`��u�5
+�1Ǚ�W��x�;��}�(����5e���_�^)������̰N'[��G'��]N�$[���$�����<����}-�
�G�JL]�+
\� a��g��\
8H ]"�ึ?�Ui�lb�Hn�(.-�{c1����z"@
+��P	�S�@�L˙�2��-U�wq����P6�
Խ$}{��.ak˸�bǯlm�-��b�<�
+�����2~䚵�LByd+���|����y�
^j
%���t��r�娄6��M/[~��׵��
aMˁtN��
p�^�����B��4�L\Z��2����hq��uS���l�WC��>M>%�$2�6P��̏%�,d��
�6ۃˮ�d2�L�X#�=6vN�C��VT�ކmb��8�y�P�����Rx֠���a�ɞ8�LB�4bN�l���	d��y�DyYo�c�;.�#�79�k��e��G_�5מ� ��C�ƪ��dJX�����";Md�T*v��4!��%6�/�:�
��o��ҖI֧ARM�_7�%���
	_�F�V����]o���a���6��F0���8�V��'E�����W kx���g�P�����.�1�� b���UKh��ϕH�w���=?(�F
��
�U���|�͉�.�����U+u�D�J"٘q�%%I*�4�w�����c��
	�>���u�Wpc �F}�5&�R_�@R���
p��$ �C��R�=�^OR6�dyu��{��TN�H��|��.����y�!�n�h/��|�
�Z4�
.����@}�a���-� .�-��_ A�2`{��(����c��*�m��̐�z)$�o�7
�'�QxM�v;я��O��~�%)�؄�c�P
6�
2X
��m'F��3�%���֕�΄��<��Խ��T���=�!���i�a�Y��9ւz��de2!������F�.��Qc$�/ZĤs��cb�0�x"�f! `�ֆƥ�	����
� ^H�y�R�l��&��n�q
��w�Ԙ����E��	���`I|7N(u��2��&gk�k�9E���IM0d�.R��l���I�y��v/��f�x"c�FXX��.j���g!�Uj��n���պ���w��˃V�ǁ�2�A����<F��,i�V�
b�o��G]B'�/�ggl�B�������B�
+�p�[����.M�0�

^ӕ�ڭK��ɔA6��&y?$_n�U��ǝg�?��
W�\�F}�|9
�6udH+
���t���z��ڇ�}M�����L�G���3�WgcH�F褨s�������9��|�
&�����\���۶�9gu4��;�j覡vd�����;3U�یgI�5ڷ�M(L�
�y2f�3�

+Vc6�V���&v�����&11��I���R�uM��tx��$/�5�
��c�1�,���L��үn�}��K� ��}���v��n��L���3}=nA
�W�h#b'3x>�l����[����A�ԇf�:qjg
+�J�w�2�����D!�f��s2,Bo����T���(䙴�iM���%�f��A�bA�{�_���b?>-���E.CE����?��L��@�GIJ�(JI�YY�����,���	C��gA�~�L�o
���?��ϛ�yX
���>���ِm��
s�alOv��8P�V)�\7��҇��S���0�$Ru+-�M��H����ž�1"jb�D%є��3	iaI���vl�b����
+nrk�DɅ�$��e{�KN�H�k
�~�JTp4��\5�B%`G_�����3�/��~w
d��TD*�ۯ��|�e&a
b~w|�� �jf�06Ok�|-��m�W���7���ܘ�ξ1��p���:`y�[��Ƶ�
%ӱ�eU7�JgX�A�
�
G�,_�LS����^�˿�8ҥ9�[�,�`�U�e+"IS6̣�x�6�h��Um!�dA���C�\
�w�=M�j	~+t>��}��޹�!����Z]ڥY�h�O�S
!����*c�
�Q��M3�/=�儜0�
	ۈ���K?�lX��!}�>��V�����{;l��j�'>�V�"i��
+�#�rz��t� /������FZ/bz`?
��"�(
��M\pi>�}��D��
�8
���f�
�

ރx3)�Of���x��!�m�ǯ�T]�>
��%����#���JW�� 6�_]u_��
��{7�*�7��C
���f�N�
��ʴ�1cy��69q��T�0�v	
���V�\�`��nf��/�Z�W�b`��?Qk]������_{0? ��[Od\�
�U��쮍:���+X�\���m��}l��o�;� b@�E�P��@�zI;�|�9�Y��۸n4&(�beU1C��SK�yê�Z|
o9�	)�]�6,�Z�µ��Nq\`��Ru1:���=�G���HChU�BI[����gs�m�����p�a/�JG�x���A����O���#%�UwVoG�l�����SxR���N�1�
+sC��M
+�v�	 � d|���Ze0
�E
*�=�
+%���"~�>��w�� �]��K3��÷_Q at B&b$<���I�;��@��P� K���h�5�w�=l��'gnf��3��ʊ�/`��`?;W���͒n��}[��-�b���8�I��]�_���`r
�5��f�
�.�
�|s�#Q�T�owv��=��>���7z�D ��|�IYy���H�Sy�R�S�t�y���a	?�A
wb� c���;�'T�`B�l��[	Mΐ������,�L3_�!t�{���Y��M��8*G�!�=V*'��o�p����"��F�s
��O*.^�S�v��Tu�s�x�"�D�?M&��Ҽ�S#z�/Y:����,o���
ô
��d��Bg�ܔ�����1�V�D�r�]�n�,-�d�ϹOD�-�	͵*�Pw����\���t���e�UjY<�ISIDf���(WnG��,� �� ���ϯ��U��yT�Uh䰋|��e���l�
2ˊB��6��Ի$�����W�E�aK��s�`���F��J�ij6���$)����˭G+m�
+r]4���:�
R�����M�&��n�:��3^"Z���
�o�-�]�#��z�o^�}��V6��FJ��H_6��q�V:{,R����c�
+�;J�T
!�^c��5�%,}�[$�2�v�
�+7���9�g7s���3A��e��
�
�'s�ơ'��F�*�.�n"
����hb� J�Gf�J? X�C�[A�*1P�v/�)tp.�+����$�Rj�f|��>}4/�zp[�#
dJݑ-
1��
L���0�4B9��U�3������Ȑ�I������G�b�0�lΤ�s|
��|�5��H
+��
��t�����i�B�q>�>7��yB��'ϲ���Ռ�������m�F
��k���a�U�=��G��SΥu�t�j.!7N�g�t�|nR��*���2pV}�2b����D����H�b
.�K�`X̍5� ׵����
�������De�
+�ˁA�	:diĄv(��A+��;���{z���%�/��@��Y2E9Mr"]K!��vłEGф�N/� Z��F���8�x�9:�mb�����n�i3s�}�A;e�_�t��
A��w�??!8
w�,��eʋ�
�b)�2�[�a�c�"pZb�E^��\��i����Qxi�P�@��l���z	sQ$��e\�A���.g��޸υ{.˞���9��J�Y��6�����alb����p߃EnT���R��P�9�������$f���$� ���x��8�)�Q�.��)l^̒��ĠKCF`XAL#Q֜`��W��*w�8dn��$\q�{�q�+	�m>�3	����
�ꈅK��]�4S!�e���
�w+ː��7l��ą���,�Ţ��Ec�zű� �C%��~��I��󬳛rً����_�iz�Y

M֔���eD;�tw�
@*��X�6(�h,{ɞ�
A�J����� �Ɇ5��I؍
3��Ș
a�f��X��9~��������B�v��7�H�i�}ŜhKa��+l$0
��a����!��E�t�M�����>WH���s�.��U� �u6v(γc���@"�+�愩��8�W��#�p�o�k�ƞ�Nj����iO6˓�8�
+��xf�S�d�~c[
�U�R`rk;���Sڽ��,p!��Q�z�=��Ny��ZT�f��2�xC@����z)���
�+ع�#��X�T�J�Ѐw�z���q��N{��Q��T?�
{;���BOsT
�c��x�U���v��|nv`D|99�MU�d+�#sK٧O��	���&�a(�J�૔��gU �K����F��\��[^�w�u[��9O >'Ϩ����k��M_*��J�ل(���yN��k
+�j?}�×��’{��F�
����>�K�nD$�˟R�ȷ�]
m��ר�����/m��#B��)����-@
.5?e��<e�B��S�&����P2����q�2������M��X#2���@��'�Mir��&�(,T�<���i�d�Z�f��
+	VL�Ǵ�!�(��B�߃+�s~
b�˨�؉�TC��,
G)Y�O c��=�{�r�^���r��5K�D�U���Y��u��
�8��coG�$Z?���
 �Z2-���0��4�������fr��i��5�L�����-���
%@�s���?�vE��Hv		�ٟ��ST��=�67FG��i��:}�X�x�b5w��{F�n�F��
���<
џ�}欎��x���畉q��Ƿm�6vP���6��o��|F@��N4 ��.�V����o|\y|�>�i�=����Y��eV��;�(��)5�ѵ��	<�ʓ������A?�%>�
gk��*9G����G^Q�
d�HG�̅}��
�ۓ�g���?�Gހ��g��:�u�1�����A�i��j�fAֹ��
�ǫ��89�U��l	�c"�:����(`on��
}����Ƶ�w�2d�`^7�[�����Y��ܹ`��
/�`Ӧ8��:�zP�Zsr뇙��'�ANO>�!�CKb�D1������I(�8Z��H� ��M����t���䬫�D�вT¢a�\ R��捊���/e�ƙ5\/��EC�a��(
u��i��H��4��
O�zsY� [...]
+endstream
+endobj
+18104 0 obj <<
+/Type /FontDescriptor
+/FontName /CPXVZD+CMR10
+/Flags 4
+/FontBBox [-40 -250 1009 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 69
+/XHeight 431
+/CharSet (/Delta/Omega/a/b/bracketleft/bracketright/c/colon/d/e/eight/equal/f/ffi/fi/five/four/g/h/i/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/plus/r/s/semicolon/seven/six/t/three/two/u/v/w/x/zero)
+/FontFile 18103 0 R
+>> endobj
+18105 0 obj <<
+/Length1 1427
+/Length2 6368
+/Length3 0
+/Length 7335      
+/Filter /FlateDecode
+>>
+stream
+xڍWT\���;���[BBJ�����ah�T�K钔n�S�����A�~������[�s�>qϾg��6&m=^y[�5H
+��
+�%�4uE @�(��Ʀ�;��@��
A0w0"���` +8S��#�4����3@@  *) &	�@��
�0I���'���P�B@�xl���>0��
y�_K �
@@BB��w8@��XA �Vp�
�D+g�
�
���+��
�*������g�����?��x�� ]�;�	���
xb��M��
�� v�փ����`  pۀ �� �-@�
�S� h�� 8k�����j |��3�W"0�w���
���
+������ ���������r�rv�"�<���V�H�߅[��u VH~�s���]��|�`�_
��A^����������O
� o݇�w[� P/��k;0���[W~����������"@ PL\
 r��m
�%��q�6
+������B]vH
+� �
����n�	�a
� ��n��O@ `
���A�`�?ّ0��=��0�7���  �����
�-[(��������x���������&�7��W �"�
+�!���7����F�����'�*�
+����������&8�
.��OxE���G��@�
���[��C�7������?�Q�pv�m��e�V+��ϟv��=�ȉЄ"��OA
�&����VU�r2�!��_"�]�
���m
��_=@�wC@�Pw�g�l�?l�Y�qB>%��N�6�����#� 6P�_3'("
+����|�G�D ~��y��5���#C Hz ;(
�W?Ł ~�_���t���:{����}A0�o�_��x�`���-d��� �7�oaj#�X�vU-O�Ż=.�m��+.^�X��;��*+d
v!�:�C����y.�x��o��=vxK�N���D���V���T���u}
��x���ߺ�;�7�v���y�i�_y��x���-������R%����l�7� �4�x��u�

3����wo���Odo&~�WK��
8�*�3^����]��t�e�5�a@?'�d�S�IS���+)\��n�.����'}���oG�uX7����st�C�sn* �����srMi#��Y����"�
^#�b��SX�2՝e�K:�)�/� Gg�K��K��
������M��8�Lhf�fϿ�إ�;�7� Bw�=M"h���w�~~�z����i˳�"N�L^����
Q�[Z������f���{b
���J�m#��,z]Bg�Y5�W��������AX
b����)�O���8� **D�
��-s�f��6;�3��J'&Nł���l�^�a�>u�T���P�[Q��TN
R��q��{I���Qヘ�yC9�����,)y?�v�,�Tb�y*��칀���WF�[DR��
`Q2��
/����|�W�����?��~�<ָ����BzZdF7M�����c��.���9��k�R����ŭI��8o�Ҋ��0�[���=
0"�

HgQ"�'WQ�+1��|�? r���fYK��(S�,�Cwq�,aD�(����$�v~����eX9���:~%�!ӓ=+�4u�f�TZ.��Ƀ�ۖs#��{�8�'��˧�yt�
+G;��荒lP�����
"#'��
��;3ɑG�)~�$��%�3
�[�Z�3����=*�T��yro3z��e.Qv��p�uO���f��_GIA��&��(��5�FZ�j�-����BR�-����uv�9��_��h��4��9ܞ?��ԏg�;$���e�8W�4xjh-9^6?��/#�yc_���=��>�t�.Th2�Xc�{
{��}�]�P���kޢ���ζ
�X�����v����G_�z��V�VUV����ug�6�I|5�=r�
m��Rx4|H>>2�
�ӲI��ÑqIa�Dh�Rk���X�k��F���Dp��nj�B��?���
c"�c��$��Ӕ4%�h��E"J/�9y�������X��Q�xTD�~g���0����Ƽ����:���Eesy$�t��d�/�
X�EC��9Wt�0x�.vw��>+ӥ
� [_rh?`��L���\1��V���
���B�i����8A�Ib[��	©�+�Cn����N�*V��sT��3��m��%.\�˙X���vՎ�Z���^��T����X�,���A���xlaVi\�
Y����nj��ץ6��8"�u'�����*��i$'LC�
�nQ�GO�ܰ;%q�!�������N��
�c
F�
+���ȟJi|��ݖ�_�d'Զc��!���
�z<
�$
{���$X��&����3�a;�a��6eyi�$��j�
fD,ꘚE�i�8��;q5��T����D]���8��v�97��bbF����x���)��ۗ�f-�)���bsi���޶�
4���V�Icit	�l���9I3V��4k~68�c����і�)�ʾksc��
+U`,:�%��D��8V���ӣPz��
+�G��O�1_ڪ4�6ǂ;⁧�����;�M	�ΙRT��p�
+����*PS�c�~� ��єCs�ڊH'욟~�ʛ��AW¶C�/�򐴡
+������R\q�M��^�n2�r�m�k��|IY��Z����4�=L&4�T,��ɓ����+�:Y�s�/�2%�e���1����~*�Ǫ-e
+��}�D=uM����ǂ�O��+��B��}�YBi�{�,CRh�T���\�1�E��,��̊ek3�Ꞃ�?��|�LDb�e@���"6߳+��k�I2�1T�6bɏ�	��z75�j��
��Z����ј
/���'�o�nF����r`�LI'r���N���:��Qw�{~m1�|v��OʹZ!Sש}�=�a'-rB5��d�j�����f��|��ŝ���ʆ�D&�樦�.�ר �
���mr2\
�����4���ļ�Z��a�5��<DR����(�,^K�����eD{k���
:c.�]}���R�����
�w���T������)(t�r|8��̢��w%9>�5a�*�f�`K�*C�
�`_F����*�q�Vi���
��8���!S{p�˥q:��XYԔ&eI�A!�K93��zO2L���3
�y6����֬�8���l�q��D�A���"�r4�5unw ��pc��̳�'���i��`HPn
���v���.��̤�U~?q}3�&�i0�v{:Tb<w��R����M3 ��\T�M
�k��FY�'�>�|<�ɰ�X��#&�~ɕ�.D+BP|�f��
��q_��[�F�
+�ĕ#j����缧rķ;�&�t�<�t�11e���
ʣ�4�G�I��g916�S��Cߝ�����~�T�?��^�u��}%}��/aĺt�9��z&�U9~(������-&�%� ��j#�e� �G���I���緟�KS+�eJ�^����Q/PY

w�*Y�
Ĩ��~���'庒zM�ͭ^���
�u������;���'���3�͹En�34Ԩi�6Sj̇�6��ԟ5Ҷ*H���1q����zw�K>
	�����E,V

W乔�&K"
�
S�;R�[������U��5ip���`��f���:�$�
�Z~%�>�)�}��A�P�!1�ul��
3���x.Z��+�1�=O�v���6����NxY�6	��(��6i6�9�O�,1��`('bc�'y̐�y�j�
+Pt§
+aX����O �F��#����uy���!�j��oKH5I��!#�Ӛ
+�%%B�K��s3�{W���}��iz���^��� S�c�黱]��s9��ģWޚo�*��TRTMu��/َɪã"�
��z
і
+ڻ��%� Ю ۙ׭(b��t���6x��t
��m�v�0Nݭ���n�0�č/�aqRe4��9���H)#���囆��s��
E��c���w
{���]�)��B�d.୯
aS뒀������lH��m�:�i�� �܃
?}j�y��-�#�|K���.MB����{t��D5�]�[��x�Nn� )
�0{Iqz737��-k\.��ɘ[�l�mL��@����Ӹ&E�X��D�Qxu�-��A
%0i��)_�j�N$,
Y��/�bz���n2��)�n��ܺZ���
��E���9r�Zޠ�U,�1����|*g��N&kqHpJ9����%��h���kx��8t_����>�}<C�^ ��G��^Z�o��4L$dcyz�����g+���n9ѥ���p"�N�E��P}J~t
��YŊ9�T��$Jf��vCP�"��~��,���n~���
�?����2��1�޻=E���ȴ{ԡW��HdT6Jq��n�|J5��mC_]
+l�-G%�hj��-��a�
E�N]���Ha�e��Dȳ�ƛ�벼�v�:�?��"tW	-���^sx�v���+md��w��8sSKš�,�)����EgzNo�e|��,�s
��˦�� ���z�Ԝc�}�ZI��%��޸����x�(
�����(*��]~^�dX�|y/�ޟ?���ZV��"Kk����{���N
�ke��/�XX䤉\f���X�|)�����RG�I����G(�y����s���[�>#2|�wW;D�o��֪�
�"�tR�g�!�$�]_,jTH�]���0�4MW�-$��
U^�{�)�
g�-�;�P�L_Z����T*{}��� �"�F���}b�_&�?8'�
+
8}2�BE^���$����kYiY�2y7/	ԴNF��I�ݮ��\����lmajP�ar����ǵ*���\��n�49����X�ԛ0�-𬝙��E�+�m����p��MFO��7�x
?R3��o2�UKy�ۤx	..�O����.:��dž׌D-,l��
��L��8�D���;kqP�rvfN+��MM�&I��ܮ�
�/��+��o�hL�
��>��1�C|"���жB&4N�r������
���~�s)�tyA^оS�����~Td�
Jo��gyl?e?SV��6�u�y3��
�iL�ʈ΅��Sg��\�n�|�
|4�;�i��9��N�c��h�q
��������e��a
]�#�l��?�
�a΍
�H�n�\|҉�>��K|�
���p�1f-�GsL��a>��j]F}���.6 ��,F���{�x�l���>$̔	9H��
=��L@�B���É#7=�-�����Si�@.��b�sa�sIR���������BK�'�s ���G�$��@4��w��	�B
+&�DŽ۵�����Ln�E�w��끝q�fooB�;�[�-~ؗ4�3��
�N:+�
�_��+��5�D1��8�������C>�J=>|֡�,�Va�Ƚ��A�l�i�F���گ~���nZ0�
2d,^�`O�
+��leǷbFy-D�-
+�������@qZ
�dŊz���
�M�w
Ƃo|�\n��u����w�u�8٤gk[!z!:�°f��ۨ⒚2&����+�f:Rէ!��}�����s����465�s���o���5�[�j~�H�X�&�3:r�4Q'��-ܿ�oS��P�J�kF��a����u׎�*��5o�t�����+���P�.7��r^��+�c�¤�~�QT��*4�Yf�jI�|xC#C�)Є��ή�Ώ�ی��˵�"��=�*&O��N7]G��d0�+
_
 җX�6Ql�Ҽq��|��Pۗ	L
x���(�^�\53Ӗ��ϭ�@��K�l\��v�/%8�Q�o
U�t��4q�d}�/�Uݖ^o4\�F�
���F�p����:�N�ۋ\爋��eK9A�Ko��n�sͻ8�w���O�^I�JG
��*+}�N
��3X�%���nW�(�೼�	~���hU���^�x��8��+�;����~�N�u�d:	;�cqTP�h��+ϻ�( %�l���6�s K��@x�&��P�1Lm�Ќ	�&����� vFE?i�LYt�����
;M�oU���>�������1>VZ���ur[�4���7�����
�i#���"��,����BlЮ��x���I���>3L��
�ӷU�č^��>�f}�5#B"�(��E
D��_��c�k8�/��VuP~H����.��YPO�ͬ�w/pK�s���}�G��b�/^�2v]�6[�_����`���&��g�U6b���Hm��M~[�}��!����yx`%��eU�&�<q���!͝��;(��u�y��U�%�T
?m�R�
@[n�g��<j\�uʹ<դD,����E�eU��� �
�;������`r:
+Hnd�L�򢟵~�h�
�����/�'*�N�F��K�r_�(������g5�z
v�ώ��9ם�N��(�4qk7S=��'����Q�Q�g�ޜ	�����†q+	.���
�I�j,!�
+����b�T7=��tj�,
����<���!ի���R�d\�{����`��@��Ο9/bJq��jT�w_L	�*~
��X.E1^ȡwO	�+�ʛ��p|�"�Pj�nY��U� g^\$W=譪0>/�b�8�cڽ0XD�	`�zlO��i�큲Xq�":�΋٦Q_a&�
%�^p��WUe�� >M��pa������p�/7�9߆DĨ��j�
��:��?V�;�{��e�s�������
�z,W�=��X�y�Y�U���*�#�:�w�k(>�Ps�i�ƈٽ6���o�]SW�)B
|�2
eĺ�S�	i�/��
�d
�dh����{��"l��)��H�C��yS��r_p��y�ȟ�,�� *x���痓�t[�S����z۰�923B�U�h� �Zb��^���!
+����
+k,��$$�`΋4,J�Xw�Ɍ|qё�i�DjW"L���m��vch�O���k|��@|.��C#�p;B�ڒP�P2�p-��$���c*[��@����+�d��	�8��ث�'��L�˧����b�EG�_�0����}��i���z�;y����g���ɇ3ia4���H�*�4yFJ����Ƹ�4�1{9���D�>�Im\�Nϳu��/�W�I�5�<;
�~}M;���3�E��nE�
���>yd�MxŦL�K�TSx/U��l)�E�
F<�KK�X&u_ɷF݄I�&E�)i�@ꨪ- E�6����I��K��b�L�������ș�nivzf���A9�oK�R�-
�Z��
+�7�Y%��pଘ�Fڭ���]܊=����ꑔ�:�J�
{X�9����[O��"\���(�T��;u����Ԕ�2���pE#��E��c���"\K�
+endstream
+endobj
+18106 0 obj <<
+/Type /FontDescriptor
+/FontName /LYFRJR+CMR5
+/Flags 4
+/FontBBox [-10 -250 1304 750]
+/Ascent 694
+/CapHeight 680
+/Descent -194
+/ItalicAngle 0
+/StemV 89
+/XHeight 431
+/CharSet (/P/one/plus/zero)
+/FontFile 18105 0 R
+>> endobj
+18107 0 obj <<
+/Length1 1620
+/Length2 8625
+/Length3 0
+/Length 9672      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T��6N��t�0�����)��p��n$iD�;��CZ��x�o���s����s����
�6FZ-]Ni�XEprs�D ��: ��
��adԃ 
�Hq
�p
*�/�,
l����Y"���aP���#���- �-(x@ �
ap������P�A�.8��0gO8��
q�_� kV ��� �ow������-�`���-
�0k���,b�������e�����I�r �!{��
w� ~�hX:���a��C\���l�p0�^��C]�
\�6`8��l���@�
��X����psq�
�O�_� ����0'gK�'j��8��
+j\�j�����v�o�f	q���7���%@AZ`y��Ov.�p�3
����!�W��"�CmdaNN`(��W~r8������mu��ܡ�<�B�6��(ظ:����`e�?-�E8���� ?�_ �
���_��<����ܿ����z;Ü����[����������}����/����@� +�
��O�{1��|�y8�`�<n ����'��ٲ�A
=�1��\������
�o��dd`
 oN
�������?��7������[�e	�37�?���0���k�
�?g���ua��
��
�,���)�d}����<��]��f�W�����o>
+�����,��������O���"�7B
v���55����`����j����!
�s�����F
����c����}xG�s���f �� ����w����*q���o�~��{�<�f�k�x� �p��'�}��?���~9m�
�� ���.�{z� [
�W?�@�_�?� h�7����_� �
����{_�Aa ���}
+�/x
+�7价��1��� ��� @���  ���W�p��K}O��x�
@�����

���?��v���o�ߓ~_���

� [�,���EC�ׄ�]VI?v��
�f�4Lc��^������La��
Z�_H�
v?Z�,�r.����{��3�%I���ϵy���f+��i�x��tm�l*N=�-��>�����Us_�
+�i�]��(z���,���mjoU
+��^�Lq��ǘ�0�Ye͒�a 8�`�
{�Ϝ_L��Ѩ$������z���]�z����tR0P�?A='
�d��~�B6���p
>�:K�>�����⵩�s	�����q\���
�J�

�֢��TD����u�����M��ʅC3r��(X�V6��vˊ�������d�箼
oBT3FlS��D��e��nʣ�
]6M��m��k��gU�9�14�T����?�1.��v�BHj.F��&�d�JUΠ��p��M�m��KQ���/�ˆ�˜����Z�5
8�WL?�Uy*f��e��$���kP
+����������P�h��,�.77�n����`��ɤ�X��
�΀85W����VR�1t,6�Y��b~���כ.3�j���NJ�^,��3l�
�O��^�j��p�X��:�ёh��
�A��gҀ�3�
�ko
y^]
�;��(v�d�B͛|�
�µt=M���)ڰ�_��Q+��V���B������<��.c���m�
�V;��U�DZvU�&�]D��V��x%������b�̍�N��N���썎֕��1�rr��gs�^�D �0�3��s�`?
t��P-H>Ã9�I�
ՉV��Q�O�Q�4PLJ8��-pC��vu��h}
O��d�m�^AU�y��h%(�9�q�ׂϒx[�/�K�����3�v#���4sDP����琧�I��0�LY>�n7=dA�&咧�zi�A��1�� �яm^^t��݄lE~��3���E+��=mq�]
}�
+
��贆(2�ہ�T�
oQ���%�(�l?-�N}
Y�~�h���^-x�7�#n��c
oC��ƶ��'��M������c����w�'��<���}o�,(א���{���"���f��	�h}��I��]O�wD��juD���
�I�fv	U�D�3�o`.�%I�������B��Q���Y��Ix���
+��C���_G�R
��-�G�"҇���
L���
F�t�f��f/@@�$Nܮ�A�d�|�L����~L���SXvv�%�l�'�ķoʝ���`p/4�T��b��͕/�|ym
6H`�^�����Q
2�
�� 7κt0�#�w7X,��u���.^���a�-�)
FBG�5ZI�س��`QeԂ�F
��_Up�؞?o;?L]��lm̛��^d��_��qa_gK���̬�Y�7�a���3�a��^eDC��b������*-~ů��[;ա
߾t��Ї�ҿ��x��h�d�-Z�7>e\��ʈ{3�u�]��3��Y'&�
�՜�;�7
$��TO��
�����	Rb��9����N�`�}����y��Y�n҆D��8�~3*��&
I�6���]�(��Nr��X�pi�5/�
+�<���
2�%*��{�Ӡǖī�iu�Y?H�:��Қ|Z\�E���tC���㻡�#
��.�Ï� Õ�����<�~����zCѽ�l�)UP��V��¢���r-��Q�Vϻ��"1�����Ⲋ
�c�WMR6�]��~�����BAҜ>k�V�^��ϑ u��^�>���?�������5]��.�����ׯ��r�G�j麳��e^�[�R�n阛55�_����ۛ�=����o���zk�!C�����؃�5����
s+���;�\ܓ���
���`5��
+j�C5b�E��1dy��t��S��PF�^��# F�ju�%#��w�
Ld�qM,���5�e47*b%�b���г*��d:v���S�����4���J�J���ͥ��$�<ߟ��
yJߤv�}�OٗR�iwg��؏M�ɆM��)���:nmz���Is�U6
���j�;��O"�,*�)��ak�i᣼4�<Eh���N���
+m�X,�%���
+���O&_�@���X���(&�L-�	u��UXA
+�SNrs��ٵ]��C����d��Gܩb:ts�̶�rN�L=0kc��i�>�@^��F
�)
WrV7����<��;���y�j�t\�'�e����y?d������$�}��B�L�v�N��N��s�tۑ����k^Q�A�
��ЙT�Ͷ9pK6�Y0�^2�*�.��r^mN���P�
5y}���M���)���S�Fk����{���r���򻵊0S��C:�
+�-7<�
l��FΙ�Zfw�>w�>p͏�����;2 ��XU��ܽ0�� Y��Ο��

+I�m�f�~��<�[�g��ǹ?��V���A�he�1
+�h�P��ڛ����<����L6�	5����8�ɪ��������8���f�X�L
?zk#�F$F�|��#���-�@d
�C�D�h���)�d=mL�G��W�

��-�A�ڗ�Xw_�P6��k]"	6F=^� ���
+���m���w N�LE�'�S!�,ylW'��m�5���|�4MK��w=�G�D9�͌ޜ��y?,J�V6�D?����PP�<^}�sj�L�~l'���΀���b��(I�T���Il�^4�S��
U���%��6���������)^��G't�(ÿ�-�t�a"w�<�(�
�q��[���>4���^*�$VNm��ux���W
+фn̔Ŝ�-���0d�
+M�ȎJ?�+
P>�wS,�^��%ח����WRV���������ʩ�b
+�3h at v�����y{]\��/a�O
0��m�*��	��R
+��4 at d��53p�	���R5<��FsĨɺٱ��A

c��
종���%}	�x�,yyj�( 
(�]�
�b���!Y����r��=��nԈ
u7k	
RC�w�e��{pu�rK컇ʤNn�~h�vн��!
+a�e��kY=*V�4J
���g�Tc��,��F"R��Iķc��O�&2�$<��Qc񤠮i�jS
$r���#�13
MH⮾)�N
)O�=�>�x��m������^$�7�x�l#
���m�f��ڄ�,��o
k	z�uD:�Q;�}
���ag�D:�Ƣ�Y����Hn{Y���S\]G�����e$�i�b��|{�������� ��
2RQ9RA�+H4�K*ٹ�Q�E��l��p�
��*C���>Wis��
�[�c��`�9IB['�d��^�ʂr�/z�
���K<�zϬ����̞�Ͷl%v|�&\!�'�>�3�����&t G��D�;M�D0e0?���5�a	��4h��-���$7G��{���ͷ՜���*l�{HP����ؗC�~S���z{�{��s�q;�
�;��P�8���+�UL��
�N"�`���g�Q\�)׷-2)����,�n}��J���w~Hr9�
����-?��M<�J���5!y<�A����u���s�&��=BG�����
(+�U������5V[�{L
�G��Q����x%���鷫rخ�x��K;��0L���QH-)!��'��n�Ix�O�~L\��1�ȇ1���z�s�hC;N�x��
��?)<M��0X�t����G�c�e�����doŅ�yV��6�Ik�e�n�R���*�~�9����>�)��
�?�o
^f�l�k!��m�]ĞPF���

{U$B
��
�o/'�/�Rh򄉂>�<9�\]�ZrҚ�����O��Q��8N�_�������J�L�H}K�^�in��m�U�g �G�p���U�c�bH�����`��?�!����vC�j]J�]'^�-'��
�R�d݀	򮛢���0�K��G:b
�$�_V�7x�,���.�Hs�
egr/��64�

+�
+6З�|��S�>?�\֫��"�6�39ڜ��M\�UZ<oFH�]��w|6�%��;T���#��>`ӫ|�4`��?>�P���P�<��q��3fb!˴K���a�5s
M���ļ{S�Ԋ�!��

�FG�'K���3��q�6r�+Ng^��s=f�$a5�s��^����h
�$8��"gg�-��N��|��%F
�yW�Z�қկ���^���Ͽ�L���"秇;}��,?ƃ1�����L�{	A���瓵�ٓ,��=�,
��o5y�qw���ֹܴ���^�
&t
� �Q~ݺ�Pî��	#�H[�_44��p��z�� �O����m�
��L� �]�GF����K��h;�i����C��6Ư����H�2�
��߱XV*�ҙ�𞥟�eGk�=7߮^�.�
�y��΄�-5�<>���

�f.ڂ����8��9�y�MS��Aע�a)��$6�$��-��K��-�O�֢S�ow'0µr�^P�N��kC��鼱Ǟ�C8�Ƴ�4g�g�x�v�
(�렟rf�95�NɱWZ3�����cK���q-��H����Z� HXw���� �:�kև#�M���w',�F6�$3��B�O��i��%j|�S����g�̽բ�{"�@k#��%�Wnf�h�i����-s5����NB=������s�C�.�Y��\6���'[����˪�_�yD+eW�~V�<t�%|Y�@7M�gR�)W�2�A?j��
i
a�&� XKS�"�

7��9��",�̪L��@��3
|wU/�qKd������#��}c��/FsEL�M���v�
��
��"T�*]���b�q[�����e��9���'�9<��|�çu [...]
+�ʲc�Nn�/�
��"��s�f|4�
{d�
�_���-������!�D&�庒f�d|���/
���
1� pq
� /?W�������G;���&;�s��P������2��`������C
RW,8����zO�����yI4;�n���b����B���ٱ��W�IV)#kx������66!\���J�"U�c
mX<r,��7o�K�K��UaeY
Y�E��D#5&F� �
+�LĔ���~�n�������{��%��O�O�s	O�3h �薛[�1������ϼ��UYj���g�a�����6Wn>�*
Y����IDך0�k�6"
���;D�Cgף��\��{]#�U�F3�ƴ�e���1]�M%b��+�b(ؚ�R����NH�1���n����^��&b�z}�@��X=�1�@t����
nC6�u���)�YΛ�,�B��,u�uˈG�ԗ��#���‘s���\�~����U�c�}�t��xۇ�!Q�{��Ȁ>��UD���b
��\&
M�u��H�
����[I~Dz)�sL�${��,���ㅊ�<
��P�����ч��=�������p�e�D�g�DP5zUЈ;��
+�@����QkE��"_y��A/���U<×�/�sJ���-ߝ��s`��:���3��׺�l��U���ҋfdw����FMZ#����
+�
+�T�|(�df�5�6�XZ�b%)ބWl�O]F���ٲq
��nR
+]��
 �3]*@ٮ
���5�|NW(�}�)�f�X"q��Ӧ�Ѧ�Oy��`.���0[\��B/���}�b4��p���,�kZ��wYᕢm��J��M�ƻ�mds��dm�p�c'��
�S�q�<�qbd�
n��r�F�]{�eV�v=�j_h�`³"��w!9��ˋR;$����tӄ�(�H��ف�`+OFl���<���xq"y�)���s|��;��rX�D���o$���;'-l��
ҋ������g�%�$M��3	�~����jP�4I��j�j��C�d��>
+�x(l�K��wIN-?��A]�O����c[�Wz��=1�����0�]Ĝ����}����$��kl�g�Q�ȉ�|ꠃb���{�V�?��v����3����
�f͢����C�D��]u���� N�
(����0ܚ"��;��s���k�Z�
���:O#:a���/w����w��pR��?0
��.�h }!�RA���<ޡ���M7�R�
{�Y�9��S��J��g���m۾�\��n�����f�Y6/�w��(�@.�&n�B4$
��c
+g������I-ރ�e���ص�pT���=���	�Zi�ɫ���v�_�||'3߳��!�X��

��q��dj-y@U�Z��zZ4
+��Q	ZCڧM���!&��
���
�����t�d}b�C��Vk&���r��֊c���`M@��̻��v�u"��e��c��8�h�="��I�v;n���u>d�y<��u8�Ao�ip�����<,�T��nUZ��Ň��T*D��޽��&�|�W��U�@�n^�Ԫ!�`������OBO�e�J��h�-��y�ܴ�li	8WX['Z(�6����$��_�DW
]��=�;=����@w紆g�3�ې�dҚsLg��c��^�BYJA�8�cܿ���U�y}F-iX��C�N�P�1�hg$��
����N�x�K�%�1�&LѨeOc����߸_,e��v�� ��\p�����|M���?��
�dzǂ�EP
+��4K}FVh��:g��8VJ��h,^{ObQ�����\3	�1��7�W,��$�R�T��T�?��.���O������eNr<�¹\\{_�ý�e
{�MMs޵8��n�zL���9�Cěb����w�U�
��v��g-�9#g'���3���+���
+�cB�>�|xb�k�j�
�IX���&v+�@l��3k��9R<)��^� x
+<�����p쎽�[B@]<ӣ����(�+O����`��zЛ�b<��풲�@+;�S�
>cS����vvݧ{���IP=
��gu}\� �:2��b��}VƉ ��{�*�,���_����?���KE�ã�ɬ�S$��c�N�ܩ'j��%D�eN����4Ղ�~)�3A(����h��Jb����RW���2?�P�R�1
+_+���en�PQ܃�;x�l�!��7�o���>��4ý�Q;���
+
+8��C/������S�o�)
m�W��]�n�֜������8����A�ܚwҜpWܹ��T�ܙ��Z���%��σ�gi`W{�t�u�d���(�b� )���gڥ
UF�ر(��:4����(/`�I���A��8����l�jK<��~���t�=S~�~�h��Q_�c�xE�����w�SPhD��qm��6
/�{f-B�b��g��"��/��q›��_s�FP)>���=�\�]KZ���.���"_k�-
�H�O����:�g���)�͋�����6��^�l��͒(�Er�g^�eUrc+�S65�w�<��Q�R�A9�0��n��P����$U���C�������u�ۖ^��2�;�C�U�&r��˵�3'���NQdng�*%��/9VՓ]{܁4�.d�Ik2�L�<§���ڝNgLO�*W�ڼ��7�]Z������ȦX�=9�
�
�Yǯ�!O����ѯٌ�5��zO����љ
w�
�Q�?��
C�6�h at W�unE��/���a��FR3��rY=V֖rP�YN���R����'�w�U��xf�kW�b���*�+�v%b���%*N��Œƫ��z� ��Q���ow�H��as�
�0+�
� [...]
+���R��Jm�q��6a>(Ӱ��a�5$�'�1��ȳF=^�� חv����u���f�+
M�\�r

Eˢ�@R�[׊����N鞛�!�)剉X��
z�f��fc1���7�V�͖M��&(��p�&�m�;#�

�m���חG�
'�
+�2�5`�F�,%���oJ���y�UU-ƻW=�
�9��l�y��
��QR����bҖ�M��uҠ`���N
������]���������0bd�q�3L�.�L�˴ij���L���0<R�SE;iw
�(o|�����W����A�� �
��C�z��gz��ψx�,�
+2'�
�<�3Ծ���FQ�5�C��4�LY�ʵs��
n�G�?B��]�)�T�� s!f��'K�LC�I�h<jB���LJ�H>�%��v2Ʃ���m}X�X!;��%��T�n���
*�y�E��}Z�q#�?]x�Q
fV #��‚'�I�]�u
HZ�h�p�n]��i�%���2ɪ��5uZ��c�l�O��^�b�E�

a�T�O
c4�FRv�0�$
/U��V�F�
.�	
+.	����$�O��bƐ�
/)��>�:��_��1�'xa�
꡴×�y&��pVf-R��?�
9BW���X�8��w����xCu�e&P�|w
�~Β�b�΢�?�Y�5�m+DE?ϱ�
+BӲ��,aZ!�W�Z�h���aE���hi(�_�OF�9)�/q���i���FD���*߀93эXehv�"x�8ŋ�E��U:�{R3�6Ԫ�u$k�nʗ�L�
��\�:�;�y����'Ү���
x{s��/6����.�- ^$h�r�0�7/"�J
�}�]\v0ˠ�T�6/Y{��1��.[�!g�v�r-�l�=�~{�
�թY�ZE_��q�DYgMdq�l}��g�5鯧�+��<Tu[�}$�����9�3�C��"��
+endstream
+endobj
+18108 0 obj <<
+/Type /FontDescriptor
+/FontName /YPFGSD+CMR6
+/Flags 4
+/FontBBox [-20 -250 1193 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 83
+/XHeight 431
+/CharSet (/a/b/d/e/i/l/m/n/o/one/p/r/t/two/u/x/zero)
+/FontFile 18107 0 R
+>> endobj
+18109 0 obj <<
+/Length1 1865
+/Length2 11015
+/Length3 0
+/Length 12188     
+/Filter /FlateDecode
+>>
+stream
+xڍ�P
�-Jpw�иK���=X
4ָ�[���
N�.�	ܝ�Gf��̽�W�W]E��}��i�Ե�$,��`Y����S ������f���B��ӆ�ك�����]\!PG��\� �g�4���L�Pt� �@>! �''���S�?�P!�4�b	Pa(B
���tRP'o����s��
�L �� ?�� 	�
��P�ـ
�3Z��ZP
����B0
+۸�9	qpxzz��
\١.֢L� O��
@�
+v� [~���
�cG�h�@\�kA��<A.`���
bvt}vpw�� �s��jN`�?���4`�� �
�w����8��
���:8�
�!�� +�=�&������
+ 9Z�6ٻB��A
 �=�����A Y	
 ��_�\-\ Nn����
9~�yn�����������>i�
����
\��#����ϳ����7Kw'
G��;XA�/�g�?2k������_� v��,l8~��v���?����uX=S �C���_��� 0���
���o�#T `	�p���!���D�����7����|
< �������lYB
��1��r9��$��Y� ��JR��e���q�r�@.. ���������?����� ���ODG+(@�O
+Ͻ�
��f��ua�wU��
�����'/�����������7��_���u���C��[��т
 ��韧���y#T��{����z�?�Xl	qw�_���y3$
���n"�U��T��Y��9@������G�:�����99�G��kv�O���M��?����q��Z��9.^> ����|�ψ�
|^NK��s
�`w��=� �����.���S����[��p��A �� ���o�V�A ��7����ݟ��. ��ߐ��A<��������������_���|���џ�s���s�'�3+��n�-�~����`�{��
���\6�o��
�/��mp8��~�����:ڃ�������9����8ٻ��+�s����\ҿ�| ����������v='w���ᙣ�?��Y��O��f��]�4���pwy����~����?�o0�
l�:?
�xf[�v]%A�ɶ5&2E������;���~������}Ȋ˥D�P��
�
��߃�:�Ȗd��;�{�$�ɭVԹ	�/�$j�)P�ٴŷ�
��t���_t*��:�
`���]{��y���-�D�nil�SB�/���F'�(�x�.���
15�23�����n���b
����B_�U�����
+m.�.ZCb
+�
ܑIz_��4E��%���F�E��?�`��f�Q���!I�b�pT��kW��hMÎ�rQ�
i�X�+�`y�w�9/r��}g)�pj�;�?�K]׽#X�R��"�`H�<u�]�]��;'I����������T�
��pxIƜ�e̦���v�*�≢�ܣX&�*��ׇ������������~c&C�U�egS:k�������Ԏ�5y�T,����P��K�dG�ˢ���d��䴙XJ�.�1
+�"�7v�i�1�fGo
?5��r�'h�b��1����#Z�!m�l��[C;���
fH�V֘wCl���
UX�۰�
&ټ�<�����A���[%�s�]N��&3ۓ��M����n�r
&(��~��)����Ul�bWS���v�
bK�7�)��
�'�!wiK��9�x
��tIC-+ow
�����բ���I��ǜ8�
ٷ�<�5�T~�)��fQ:��]��@�9��-�wOL��
+tcOΫo�hj�Tp��wu���0{��ŗۦ���(���|Z_��X�ZA��I���z�,�s�;�
(ϱ�^���Sp&�"\X�����'ͷ�Y�n���/�e2���w�[�Ix�t�JW�&��
��'�9Hf�3)i����j"bj� ����`�q���ᤅĪ�	�\3����l9�Q[�����^��ۯ�!>Js*Ք��Յ�O��PXL��f=$j�P�2Ïr^�e
�G��
+^�Cgzu9�ogD��z�:x'�CS�O�<�L���o���
+�<R��'yX�
+B�=?ۦZ
��84�7���k����i=8ޔ�#ײ�� {�

h/~d�!L�g憶�Uf�L�p�����>����GE1��7((ޑ��Z�DJQ�:9�T�r� Q|�oEd�l+`y.�
U�r��|�P
+`�
n{|qN�q��&�.7^����9j
�S��7&���zw2���s\�1y)U^|=�º&J�p�c>�	�W��e
+�䰯��7��:$�l�1w�bz�2��L�H�2�X
+��iA��
�R�)
rH`TAZ󻲆�c�'�X9��巭�[�c�����x�<�m
��7N��{D{��?���C9{�)�d�U0�+X���q*�#��^P�,�Y���gO�S}�SM����IM�N������HO\6���R�E7˱(y����\
+����J0�
*3�={���~�fH��LK&Z�,f�r�w{�f��R�Uq���(���͟�x��h���̭g"	S��a���ؠf�ƑsV�Os7AkM
�
�f���0ݰ���!5*��X�1�Ud��i!w �� ٷ���Ȯ�QHpHj�;������ �
����*#yz�+�|�-A�<y5���Jd0.�>r\YQ?ߖ��ցc�Dn����w����Q�Y2�Q�쳚^�<$-v+ی�0�xY��ܜ*7�ep�9��kF201$�.�O��u+��.�
�Fݎ��PHW�GX�7�/|�A���.���P_K�+gO;v�T�� ��j?~1�m
�ƪ�vGw�r&�|ٖ_d
+�:��f�9�:"�.&c
�%@��!7WK_|��	�X�SҴ�>��AkJ�S�u��]�s1�2Io�d���Wfۊ�
�Y�8tZ��!v��t�2'{�d���ޖ�����vL����L��7
^��)��G;��.��i��q��Nx���^
Q��I	��ȲP�b�NL�
Df8��K��k��
^��8,��T�����#��O�r���urx�I�Zءcɿ��d�~�I*{�[�gٯ
�.3
���u�V
��3t���>��r*��"���'���0���8�N_�7.�I�L-�5>
���&�m�����ʳs��w��x��u&�1��Y+�4�'�z���O
�J�6Z�2��
��r��>�xSgG#��Ұ
�
���M
M	�N�)K5�h�R�."]��uBֽ;��|��W06���y�Y_�ض�U���;�}�
A�Ƽ_Bڑ��yJ�������5N�+��r�����>�]�ҔB_"-O��2�WO���?NOtz��G-�y��8й*� ��:��00􃒶X�ui�� ���@��e����t��W�=~Vo�a'�:!U�tJ)�%�%y#v\��M��S��mm:��pw��.�p����k󽂈�ǘ��.���]���
�a���ǁ��ʖ����\zgY8�<���ǭ&t�̅�����~'�b�Ga�a�z���Й1���7�ö�7ѫh>�
xש�K��oE)~�K�戩�>��M@�FϔbR�c,�b.)`.�Q~��D��: [...]
�w�ǀc���P at X�0Y�_�i�K�S�ĦG�q�O�O������0�7���0{�Z�sT��F]��PX�6�"0�R!M�{���C����7�g4[�/��2w*�S�N��e#�2F�}�w,s�i_M�Z5��}B5��1Ɖ!�Pɷ�E�rs
i��	t{�:�(�O��5O�O3M�����h">uF�V�z��o5j���V��e�M��|�~rF���3�z�J�s�2�9���H}櫛��͋�����5MV����X2�0!��-���"���Y7�H�N�g��_���h�jJ�
�r�-#�"�͈�cQ;/3bMJ�ED^��]���S.dӔ����vF�r��#�`��JmU�K
+���[(�a9nA�TGT��Ɍf�ß���Gh
�x�l��~�;�+�^��Z݌���
-so�Q����
'
+�*���+?�`���i'�+��Ht(�G8�h�
^�7�A���
��64~3������p��k	�n6-���(� L�*J
��c�b�%$3Ӹ?�
v�V�v���
����^�G�
+�51+ίS���7
w�R�;1E���/,^Ҙ}����5)�n����!��_Ux���h��
�%���'ʂd��D&e�NW�����m�j����I^�HZ�M��
lt\�"�zi��,����bcb�@�=�:�&^�ު��e�.��ܴ(~P�(/��$��c���:�z2�������h�#궋��sC#^�A�
��([���-�;�q4U=FR�[��2+����G���C��X����
�X�IoX�zO��T��q:Q���g��O��y}���K(�OQ&
+���qD��;DL)��|'�����'��qߨ�~b.V�J�6��扔;=����*p�X����KŻ���)6��,�1�4)�m�� ���;��I}Q�"hP�%$�7�Ջ����HafőG�P�k�����좹
�W�S�h��.�����E�X�1�Yd����~
�?}�[��\�[�3D at Ou� ��ο�ь�/J���̮�X=q�
��J;��{%;�Rn��'�C�PMi�%�!�~丣�Bۅ�hI��3�19��R�Jk��ͩQX����f(�T^���a��
���y}�_Cz��Z��R?z \S�9`��D%
���f��
9��
�
�i��ˁxˮ�ov�#ּ��^�8�7�f����('l:^4���k���-@1PP�
U:�=�jL�9�#��lzܾaOik�
"�ݳ���q��=�kliQ������%+�a&
�b�����nYĸ�����G�
f��3
]�q�B}�Ɉ��
@���-�F����2~.�p
�Ic@�}ah�]M�M�ovk9bm��Oh�
�
mT��^!�6��I��I�5P�p�>�M������Y�MK��1�%�_t�ukb�`��֚�
+iI�t,8�a�|#���
+*�X,�F�{�6S��`빁z��
�n~�wm�m-�at��~x�]���
?����X�����5m�Z�bn{�
���FH��+1	C��C�RŲ�!@L­^��II����x�3 �#|�AS��;y� uY3�x�($�l�uë������ב��{M�̌�ԭ����󅆘�>�d����Ĉd��S�HI:�Zϐ]������
w�)-��Y6�+��y��G�����<����3�az�C�'9q�8B���Z]RA����
f%���ir��A7��|)
O�ʢ<���1`"�;v����>�o�
 Y�`�e�����R�a>~���[�Y	�HP�n�mb���4��Lڢʿ�+MHQPј��gô�:6V�H�Q�$��Y�Vd���l�V�,�ۆ�r�����w�e�ڪ3p@E����
K�*-[��9`Jv��ˆ�Y�U�9�y	�o�:��������Xo�@�D�a��0�H�ʙ vo%�T� ���热36Hl
�����#g���DI*��C@ǃ"�8Pb?5�g�5|��Wo[�j����I�	���� .%��m_A�wxQ&�
cqf5d�
)����ڀj@��(�
+k�uQG��eS��]� �I���bg���=ܯy���W�J�W������*����Z�� уX���g�W��O�,��:�s3��:�2�K�K1�ʞ�p��@��/�s+Q��6m)_�ub�Cj3�	G
3^���*Yyѣú%-Rmr	-.g
<x{֞�q_��Hv��
e���H?{Cb�3+�'�l���Q�_�G�F���)-�!<Dz���_��Nj�c8��k��M
~/�[
}K�
R��
D���M�ҵ��:0��'n�N�),ez(ڋG�!`!������0�1G�e�����ǜ"��D�2�����;"Ӊ�q�3wzvذ��e
+.�l��~88�Q�%��[l{��P�a
�p!S.xE�-��`�X��*��)]�\�ϐ��݄<��}��m�/��
F ��Z��BAM��Y_�{g8V-�x�gˎ�`���?����q���I��Ӗ�X6
�
+0
�&Ǫճ(2x:�J�T���?��'�"�6�D�����|b3� �D��E,���ohSt�������T
C�}�f�
W^�E�.��0 at O퍘.2w?7�*�l�T�{��H����ѩ[�]
*���2�}���)I�v���Mo;Є7�P��4�>=^H
�ⴹȭ	W>	��cx��}A�6jS_�9��h6�4 T^�����`WIuȚ��٫h��y�N�2��w����J�����m~l�n!�P-xJR[�-<�|�K������P��S�"	wDɐA�(�})���YK�@�ER��u��
�$n����6�촃<�
�$����"\<���j�G.�I4ˇ��+�����İ�I_��;w�	a�
slVf�2�O=�I��V�2AQ�V���֘y�f�������%.h�[8s��.-<�$qZl�:�C�D�^���Of#�4�+[���c0	�:�%:���@f�	h�R��b��YU�mu�C \���F(g?���o|��(7[$�}��Q��|��X��ug�1Q���Qv-�wFjI��"4hJ-���.ͯo���)���N�7�u�ilh��8
��ggVxioD�
w�h��-��
+\�2&j�i�f܎�1Y�P�U�¢ɥܶ�:�%w��dN��XSHֆ�^gG�h�ct��wTj,k�L/w�ֲ�F"�!�M0��Y�ё�T�$�oj�1�2*Ձ��Ҍ?��&k*��H'��6��{2}(�Aof.�N-t��ұF�1������W���:�}$���T�mK����Z�T����
+\؊��8l߀Ҧb�F ��
bܵH�B�p��-A����hFM�w��F~��W��"�Q���`xޯu%�i���R���F��
�$7��j�������6���0`E at NK�h�z����Ǟ��2���Oi9�����,c6�":U��y��Q\�W4��'Ku~�A��5�O�z��uQD&S�[�������m���"-Ӱ��(��kzj'8�{�)��׫Kg��'#�m�'�a�;��q7�2�W��a-嗩ʬ�E���<z������O�k{׆
�DaJ=h��|P�
�:�0��-���z��N~j:�_X�
�� �
��鑝(:�Edj�^A,!�؛�#��_&Z�
	w͉
^֤Gˬ7�k������
?�!!���hA�9GN����}���n]5j3�c�o_uo���
xi�\ó!��Y��;���I
+,��c\8�%8����$�ݖnF�?V)� ���׽�ދ<�L���
�KͷS"��3������&��z
D���"�0��g�w��^c����w��[��rDP�9-��w`Q‚��*>�D�1	��~5=��
y��
[�E.;�T��G���Pkz_h��|L��t]�
NV�g^�X���/=�N7�yլlZ�̋���c�Vf���^ۇ����EY�tQ
�}~��)EE�
j����5_j1��}�v��^%�
�O�8N�8Y��$���G�Lj�e(v]�
+�VE]U�^�MZ��5��dñ��]}�0iMYPD^�[�������Jr��`?+�
��{$l��O
��œ���̍����r3������/�e��~�����s�
��Y�����W���7�/��<����~pm]��	ٝ�,+�����YR5�hMGk�4���*��gA�ohĺ
F�(�탟��Y���~���>j�%��ө�/���H���od��>В�r�Fǧ<+�/a�O�E�r#%�ƁuR8�ٰ�0���
�N6!.$-�����=�]4Go�M�W���Y� U�։��Iߗ١��W�j~`����#�c�L��O������]3�[�D	����}��k��"�w��BkLb���n�$CbT3��
+��U�7/�ntЍ8�
�5�1=VP!"˕X��@s�c�7�*�C��^�©���)?ǃf��E�F�O���
Q5EZ��ӊF�NVXL7���-b�Ρ�c�8�\Gҁ�0H�jL
+q�W����0~��a_k*������[:\�"�-,��g)�
���
�j˱4�%+3����4����W�o�L@�ߠ��d���<�^R�K�I\\�
���K��K�8�x�CAm]$���iN��W9t�
(��g������ǟ�̫%o"�zTvY�qh9����޶�X�^-/��[��E��t��̯�u��”��e��jl���xI�:l5�.B@����_H�4�V�v����@�!�M�� 
 �BAeT���..�Ϣ�{O��P��Z�Fm
(3lh���e�No��� z
-$Rn�db��2F����l*���:�pʕ�3��iL���
�5d�yi^n�<,?����KW���.���jLO��7O~W�`��x�<{�І�~��`��5��E�Z��Xbwe:�⥏������q%r!�O�)��n�
�S�
=E��u5����"b�����0��]
+iK_�
�Hi���6L��a,���[��fT��ffl�=8�������:�B�*���z�J��WR�g�E��
�7?|Y1��bk	��)V�z�R��3�k��J(#���HI���Ӈ)S��`?gj� :h�T��T�����̄�3�!��")�Ҝ����>�G�H�)��g�B&`
�3�NW�������ī{�.��Qp
�#yqI�O'c'��|zz���u#���y�n�
W�����^3`Hc��5����i#]Ēg��Mn�`B
���r\ŌHZ�
����T
17��T�[i9�,��
�۰�;b�sp#Ar�\�
��jM���r7A�A���	R�{kE�]�s��s�Z��k�7%R��Jm)��<ž���Ѫ]7k���m«\C����7d
J�K-�����C��nm�Pn�Elc߶����M�D�*�jv��]���tm��D�3�$��
Fc/q\˜=�T�
+᧶���]JD�3{!稷���?�}�t�_�wtc���~��2�0a�
�
+��˞�������Pn�8d�M�;)βd�Y���@b�W�ͫ*�,�u~Oɵ
�;���D������:#�[hҷ�y_�I&���BآT~��\��Jݖ����H��j��i���{������
�f��o
]�Wڡ#a�%���ъg�\	��*��R�Ŝ.�t'��\
+���KmDZd�O�S!��pw��Ĉ��c��q��"?Բ��n����C)D����E+�(����U_Ja
9ٕy�����T�3~:�
:�u(�'���
+��%|���6FUqN��|����Z��T�ћ��*�+#ܵk����a���V���JE�����έ|�M�%�����;�4d��

�=�۵~�)����5���b4�
X�hP�1^
+�N�Z��",&g��N���x#e��<~��'��ih�K,�	
q������l�9#���q kS�
z��d�X�\j�yM�(��᥂��#eI���|�q��G'ݺF���l���+U�����
��kTA85��]`���g�%���Z�$�9���ЧRO�A���Gg����H�f�}�W����	����{�,��� ��7&�K_�<���2�
+�_�M

8��Y��lOy�'jXЊ�	}��Y��O+5�(bǏ
���Ե&-M+��#\@i��0͂+���Ei>�cX<����Ӥꜣ]ٙ�I�Nu���^�k�^
�߃`C����G
o�� �����-��x���{�W��$��U���*��M�yQ@�|��� jD�Y�
����k���ڲ2
�UA O5�Qz�r_�%کY}� ӳ��+��R�h�sT�g�������ն	Yy櫇�o��TR^���\IP�4Z�
,�6{,���
9���Vw��T�/!n�8���p(���7���,_Z\�6�1џ�fs����Q�*,��ZW���+����p�o'O�k��qN4���@E�n5�e
T#ߩ��-�����C�B���4F�k����d4�P���R2i$�c
�h
�Ĕ��s��$�P�K2<ʝ/ص�v��k|�-jL�󝬀�T&�
ٌ��\+ 'm�e��?WD�%��W]��H)�fr�D��
�r+�ik���B
�ߖ�Z<����v7��T����b����J�4�V�;3ʋ��?=�npld����
�����2{�M�u�]/h[R�T~t.7L��W�O12�n��e����1"!�{�n
�98�=1����f
��"{�n���9�	dΆB%u���I�n��I.�Kv�?T��
>Fp��џ���y�N
��������vB��(��c�?0]��B���"�
�ـ�Yj�˻����0����s�+OQ����y���kҽ��sK�^
�( A9 ��$�ef��)
�`W�Q+y&�v2�C]��� p)D�fT'�
U��$Q�	�O
f��*�U'�9n�y�
%Qv�)}k�f���Ox��X�6���ղ
ߗ
�\�i���6��~H��B�X���t<"TF5[*K�V1�؆��pY��#񗎱=��3i;�R1�f
�:
p?����E������DN�����I5^�9)�~�~�!D��GF'��@q��o|��!`j5���<�Jh�f���n�.��D8�QY
+7o�m�����e5�☀��˵�=݄�*d��Lg��h��^ŵFi���c���[*
o�4���.Q6�W6t�z�c�
+T�����E����/��Ypz�[�p�_s��h
M�|�ѕ�
�Fb��Q^��ۙ���Uk�qCH��u"�J�?��+������
�ƋV�j��]Gpō�p�T�&�)p�g�G�(��>rf��
K�#�Fu��T2Pz8 �]��p=�	���-+!-W��<���J����u�ƾc�S����
�P�
�D�2��h���*�df�W9~�_�3;�_�
��0	��Y�S�c"�q�,x(��4�������<��%j|����#a
�]0VKO}]���V���DH�����m��c
+���[T�D>�!��v����q�
&����Q듄r��E���ØY�8����n�])���mZl�|cgQ
���>�U&�=Q�c�R��YB(�w�lH37��7�g�qFkKJj�T6Q�iʞ�
UI
+wA�IZ��>�.'�ؒ���yK�:�~m
+��8P�|ը�Vu�1Ӓf�u�I���/V��'��o�~��ofpm�(�Y��d�K
#O6or��W1��}tV~�9�2\�*���4

���7�ޤ��+�c��em�6��8�t8�_��+;�S���
��o��]��@ۃc6�!�v�*?13�24�x�p�2�!y��T�uW�HN��/RJ]�
I�d{�!�A�1�rv�:/��&ܠpH_�^~�ɘ>.V���G���9���f$94K2~ЯUX7/ ���w���fi6
RK�/
������F�P��2w*q�%ՙ
�I��fLĤ�O��!
�ө
+l��
�����
ٍ���@��ŝ._I#Z
�Mt�4
]��W=sD�7G&o�*�.����ً�"l`�
����j�}��LMf�k��l-�c$S%�
H
^����%�N�_�����pC��

��,
q�+b$K������4L�^G�����
C;��@q��Z���<z��p��c�O���\Tm���j��f����r)���T�G 䍼�IU1I�O�A�0�{_g���69�)��0j����
z��I%��;�����^��N͉�@V����/+�f��lʼ�^�Ԭ>�� �3�ep�x	�&�R��yA��cka��|��Y�����2F�x N�e�N6�M�)jW^r��FwB�֞U�4m���>��n�����r��?�A�d�OƵ<^��XC��

O�+u?�j鬪�U��+��`^M�TO���d�i�t�1�R�Ȩ�)&����;4�S뗃ME���tM�/傞xb�e��(�!%\�E���
�s�g&�*����n���W���qP�$9]<�Z6?4O�����+_����\G�zo0��
+m#�Nm���.��l���p^
6� �?��
+endstream
+endobj
+18110 0 obj <<
+/Type /FontDescriptor
+/FontName /SWADHT+CMR7
+/Flags 4
+/FontBBox [-27 -250 1122 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 79
+/XHeight 431
+/CharSet (/T/a/b/c/d/e/equal/f/five/four/g/i/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/plus/r/s/t/three/two/u/x/zero)
+/FontFile 18109 0 R
+>> endobj
+18111 0 obj <<
+/Length1 1678
+/Length2 9808
+/Length3 0
+/Length 10897     
+/Filter /FlateDecode
+>>
+stream
+xڍ�P
�-�wָ������F���-hp�'@<�-�[��n��	{df�����{�U�g���}��4uؤl V at y����)
�Q�pr�srr���邠N�?��t�@7w,�/����,���>�� `�������/�% ��	�����&
���� ���0�
�N������>{���h��`��:@�����,��@�g�֖N 
�5��/���P��0������;;��N��������@7O�
�w� uKg�����t�A��u �P/K7 �Y���ݟ/x�m�n�g� 
%U��
�'Y�O+�� �ع�6���߆@�?.[Z[C�],�> �
��hȫ�C��� K��o���;�����%�����G� y)-��s~e�n�r������~g����s���62gg ��;>Y�����>
��
���y��ml�`��¡�z �d�b<�P���� >NNN!n � ���m\�������9� ?�
��9` ������n�	@�<�~�V�7B��؀�� +�
����g1��O��y7�7���y� ��?�L�g�v����Gs9t��du�Y�H�o��4����#`���pq����m������RMK�_�q�cQ	l
���s�����_3��׺0�ۃ:�y�� ���'��������q��o�[������#���������t9����b��F�A����T�K��y8��V	j��R`;���r�y [...]
+Yu��J
��^ڐc��\�|�;h�EzӔ��|�o��=�Ռ:���o,�@���
��MWr����_?���]�.��CS3�ƫG����tq8bfKk��_�t�-N/�Up�]�Շib�P6rdf�So����I܏cO�ʉ,��q<~�k��Ӿ�_t��;HhI����p�����wӔ�f��
���E
(?b��/�a��rgV��c�
�U���m\�9��0�>��䪒|s7j
��f�<h�#�|��Vz��Z���!�lAh��	0-@�\��
�5�l(܁Γ�1_��d$�(�
+����-��=у��CvGO��a�e���"�E�t�k���%S*j�����q7�C婂X	����[�D�Q0���g�f��m1D���7��t�^�~@�ht\ݶl�1ئYF�p���D
]
0�]�!H7q�N�2�2GC::�Ó�3B:�ǿ�l�s��3J��4��)����f�K��&Ƣe�=�/�[�pd��P)���Gf":%Z/��셬����^2������/��=Rt��.=��G��#�}��C*6�߶l��?��K�����
_�:��I?8m+^f�
�附ˇT�Xh]�0Y��-��� I��
������Hc���x#T
��0�:烾��L�H��أ}��:{�!�vW�I�U��
FRU�(�%�Ⱦt�_��+�'[�|Ο�1���דC,�
�I�ͯ��I
-`�ܲ��1���I��P�4���譴�Ŭ�A�ցր
+��u
+~������ܹ��J���.�n��!`諪.��1�) ��
�{o�F�j���-�C5q�5&
fcGIX�2������9i�q%2z$�.���#��Ql����|�`h�:
� �D1|
(�,�s0{����$����L��]�E�b]�[�H�8m c���H* &�)� ��LֻӒ���̪kq|��"J�s����"콳���[Kkbo�2��edUit����
Ԙop�Ud��5�!i�-ַ����N�q$Y�Tw��g�W6
�)������R>M�;���qU�(9
����3�����!�1��� q��Qf�w�9
+�U�‡�g۟ {�6}��i�7zI|�KŎ�'��JH��|)(��?#�-��kmT+�ԉ�ZH��v�A�65{aG�d�B/F�0�=����7�~�t.6V
���z�K|�R�v�::o�dS
L��Ad����ȸT7N�U�r�m�Lnٌ�";\��0o&B� ���_+^�t/����"��UuP�>lhE6ً
ۻ��i-9�΃kDگ��=Qƴ]�+϶#N ��h��qzX�V�����+#�I��V.kr�,G��8e�R�6���>g��ٚ�\��
�=�+��:��
w�P/8�wP��,y[M�t�S7yd��qOO�=��8�������
�϶x~5�@�$�O�[�u�,���9�atb|�^��3~�F�z&b۬>����b�?���>��})hB�w����	?��oJH�Ё@�����d�]��t�~�s�JԚ
�zN���̀�콏?�7J?�#�z�#�: �.�dc)���dg��xM
'(U�
۶��ko^[i0��=ҵ�hP�ʀ����#�{��Jۇ��_8��X7ƗK_l��fdlm��t�}r��!Y4oDT(vp�����ɀ��˓�}z�>�d��`�AQQ^� 4Q������ϕ
$�Y�erg�� o��~*vc�e����_(���/E�<�(d�m��X)b *��_K���)z�N:ģR�_8��&��ijU���2)�P�/����ӹ��H��ゃI^F��F��a���M幈�`���s!� ����
�T�w?\��w���]}֋�Fb:�?-Z�.��8p�ke����O�D�������fJ��|�k��ZĨ_��y'�r��u����;���ej�ش�����EW�Rd��.&���c�J��"���l���B�U�N���0_Ƞ. ���1=c�0�;ѕq��L
���xH o)R�kԻսF�J��F��	�[z��
�9j
=�
�A�\������RdmD���PL�
��"��NL
�?!|������C+��D�����YK,�T�J��d�h���U�~k/��
�gA�5�����Lz��J���
k�zF���E.G}_�(f���d�@?����sX��߿#�X
��y;�Ʈ
��LTeE��;C3�66��`��s��P�V��jr��K�ݬ��,��[���
-�u��'�[\OM�W��+-`���cΫ��ռ
��

+_;lQa
+�y@B���C>�f�
�՜���2��>ox�1z
+�|]=�U�߭
'�
nhʪS����U}�
� ���+:ܽ�*d��]wp�] D��zy������)
4��9��H4+�y�B�
w4`s�؁�Ʀ�kƓE�Q=�
"�ЉuW��m��-p��*a�
&��%S��[�k��|��S�yw�g?�~��̈́���u
�䝑>{��I�
Z#셃#��`�Y�P���]�KY��r�P冥X�^�,�^�u�R��칉���
�}_�/{�4�䠎��b
+!y��{���C�?D]��^���A��B����8�"c�KKFp�a�~��ra���D�B('A'?��Q��"��]TR���<�0�bР"�[I�/=��f���4�+��H�g2�Bx;_�Tu�
����jZPfp�U��c��O����g.I��g�
����}Q�jnWm��W�uL�Y���C�H�ӟ�
�#�G��u��y���-�@�j���q��6�LI
+��C�!�Pq
sT�8� k*1}T
��J���,n�s� �[[y�i�n% �8P�V��s�(�?=�
�]6S�*���
+
T�|Y�Z�Ҡ�s@��f����)@@���?U8��jA�@�-�*��ۑ�s��AU�*�yP�a�"VH��|?[i�SF�Ǫ�\(��~L
{2v�8�߭Q
�c�i���!�jw����7@���Eqj!�L������.�H�ר~�:�0�.&�ҩo�![L��$����2�[�Ӌy*�
hu󜭲)I8#��7n�%&�W� G�M�Q�������lʰ���c����zx365G���e���@��D/>v��*!Kl�V�������9Tm��6
B(��Ė���hĄ�N�P�U=���6*�z���1�t��ML���V�2�ߊ�bQ�b�C}����d�+�
��<�ø����`T�_�zY

DRH
뷷��b]
�z���՛f0J�4�"
Ќ|9��Y�����ge��z	��u���졡��9�d�ur,ey�(Z2����f
��@&���z�p�
�+�
7�*%�ou�<#�EX\���Ĺ7�o��'�.��ܭ<�Q�����-=��>�bl?�w��ȶS.)J~l�h����\�
+A�w��E���!��� Ŗ�
L��
��G�%���/�Ͷ�ab}�~(s.h�n�X�2�X$��my at 6{�
+&�
e�����QṚ����tؿ�vU8
�'�"m� ���'x8��F�17�%��A���f:'����g
+ T�Z�{�g����TL�M�>�,��ot<����Ĵ,�{
O��7Jk�:&2C��Zϻ���}�v��-
+���P�"
^�;�K�PTJ搝�^1�Z^D߃-L�0+�S2O�He]9_�UCs;
���v�����e���wF�hd:��BY��
5��pH1.O7֢�ߊ�$dǃ�.M+n�3�P��	3���$��k����Br7:�L��қ�����p�]�Y�tsR�GF
���L�4U�&�Is��v]��r~!x���=�kا�Vd��U՛�&zO�VR�jN(48���*s3.�&I� �R{KN��z�2
G�|�|թy�CsY,�N���QL�J�ڼx�fߤ1���g��U_��و�"�j]�#����w��Dl�^�_�+�,/O/�_�-D<�.SZf�3Gb�k���v�z�����/rΩMl���b:��W���*j� �$B�{�$E��	v "����%5�*�$�#W9�*5`�m����FP�?p\���wz��3@\~)gB�MN��+2ŔO�KW�h5x4��Ӄ�H5I7}e(�0�'y7��
���[mezި����7���?�Wo�R�j �^
5 [...]
't��z

p1�9��y�iJ"_͞LM.��0�
)�����G�� \��ko��k�d�+��|!)
���v�S1
ֲ-�6�r?��],Z����
��W��=����d�!	 ������D��M1�dk���q��P)�1}���
��/}��p��=l�������ޚ>Q�7}�k2
�jx���B9��*H�D,n��Ѐ�o�7ĥY8�0ɢ�^��"�Y�:��|�n�r�W��8cL�^*^�����[��8K$TO����j]�\3�5���c���慖�^ ��=J3^�
^S+���mm�Gɔ��}�3W��Q3�v�ő��|��x�VE��#2�o�~��Z�}{+��C����#-w���H��ps
�P�ؤ���3q�9�SJ�|
�^62_<��G���VTd%���F�R���;3D�G�����+kkL��2_�� M��k��0�
+N����	��K�b�Lm���
7�Q�+�pDL���ؙGu�h
l�Es޾�
�tv
œs�h����^�=}L$�-2����
ivG
+H���#T��P�af�T��c��[d�$�������k��V��g�.J)3��&g�p
�eV�U|�1�ѢRj�-""��Oʪ<}�k\}�k
ͽ0�V;"ZdY:6�
S��L~�"5Q�2�l��.]�<	AJ`{����a�K{�K�x����<B���ǡ��{�
�0W6yG����|�r��
W��KuZe�R�_`U�M?iW�o�$�u��F�
n��GaW�6�
�j���;ej�s\�QC�����/L�'�|e���4I�h4�̰o����X�+3׆0�k���
+�q�U�(XbS�Z� q��Րgl�k&����2�0Z��?��R�T5'����IFF.�i��t�2��V+r/E
�8�*�,����9vФ(�������8�Q�{�)]y��kR��S��v�
�
��2ŷ��Bͪ�wI�}��lq��Ҙn�
�����XIkڈVl�MijNRau�zNo9ϡ)S%V1��Wq�T�
t���

��,j����fQ�9���	#Ϗ"w�drŽ�;:i��
"KJ�ѵCiOL�ɟ�TeG�o"���Qe���8
RD(
o�ϴd1�
+������&F�_[R�P���Y��ĦF�$��$R���\i뫹����8����U|���,�݂��
ڑ�jA|6��{]� �ڲ`�}����^Ӏo�7�W4*�
�#����4<���o0
a���?���4�)�E��U��{0
��,o��|6h:�2/�=X'�� �$=Vkt⫞qӎV��Ty�+.���ǜI�	-N	���IT9�8�Z�]7��
r���C-l�O�0���?�?ԑ�
+�Q$:���5�4hAI7>��G����8�e���k�Rlˈ�掉 �[�d_�Mfw.�^#dv��
��T����~�C��L�����x�N�'A=”&ﳲd�W��,%�V�?������Y�[�7��]8��0�V���>r��ͯ	+�
��Kr>�g��x�}����+��5{8d�8\���Yi���v�8��>^�Ԣg�
��-dT�]�F�C:
]�Wck��/�*���M.�1�'�d�e��k ��x�&�l�:��_W�}�jO�M��3���d�$
����\�#m�ה6�����do����ɛ-��U���37]��J�d� K^N�
��^�{dܱ7w|`�"���
^/bR�Z7?��� ^G�L(�:���U�o(߭uʕ�@&��U��]ض�����r�[����G�j@)�͘�nM�wtV^�� ���k���Cg� �N�n��l�
X5�#"��BW��u�fJ���'���d�-O9刜.�jڵ���Qy2��2+�Ro�V�`� [...]
+�T�SֶRy��
=�L�����z>��snK_D*�5�eL
ƨB���ŋ{
��{W����jf���=����TwEw��wg�g|}T��	����Z�ٍ7���u��\���{���Unss1u/�8+R��~�äk�*~��,���q孮7�=����{�哑��h���?+�^4͗���Z[�_��8F��;b��u{$��?L�8
�'&�zK0��K��R��Yu�p��L���
+�o�)@�^ej�AX#g5��m�m]�c�MI����^
)���w��Ά��s�0ǰ���(Q-�Du
�,�# i�����VzC~�>Me!~)4Rjw�`R��+�2���uT��
.ݱj�{ԶK���{~�	�P/��D�p�ء�HJ�����V��:��C�*_DT�o\V,�Y
}J��G��V��&�Q�^��5�d�q����P���S�
+�
2c�I�{?�r���6P�.6�e�yr>ֆ#
i��	�fA�A
Uf�l3M�.�N)�t�FdO� �̑a#h&H
+��:q|F�Xb��(
��J����������}6��rH^
�nBH��b�>c�$�����o��=~2��B$�R!�.F�yAۓ�����m�P�	�2� �
+��|oY�)|n��u�lL?
+t�z�ьv1��-�īG��}#)~�J���0��bB��j,��_hUv[k�
�^\�ք���}M�2q�3����,ƾ���
�}�}�l{���#��w�Yn�&�
�i��
���7����k�/��	���[�$Rp_�G��/Z��	����
~�
fƠ���*�b/�`
ZUӕ2;+�K��N�+�Қ�
�혒�	|w���a��
��C�b�=5`�s��:.��2oi�SĴƧ0����>��˧��H�c���ɂcCl�6*鉫����w�z?�
+�Z�ks��l�JU�D�b~�v�
aϟY����8�x��-��I���?�h��ֹ��D�6	�k��h�3)���bX�u?&+-
��X�}yν1=f�bc#��!��ס��C0azM�0��/��꺶��v��	X>���tC�9���*�� �M��#v�=;M�I|V
�	�
ȭ�2����&�Ƅ��u�wf�*ag
+�AL�~E�
+�}�"�8�n��r��痚S�9J���Ȏ�X��S0�o.4񇌠ڮ��P��
+�͖D�`��F����\�[��8�bžh?6z`��U�8�7�u4�ڀ�f[�br�3k��Hq�i
+)^8\WZ�Ć����@�9Զ��
k�/�y�u�e�mX�~��5��V_P��f�[�{�E�
9N '�\��	; k��@��gHsL$�	��i
�!ն�e�q�VH�vgQ���~�I���;�5!ͫ
aB�!��!��4��X�\�O�œ�3w��PS��l4MQ2���
���=%x*�؀�����\y`H%
	��ύ��p�~��Hb��k��f5�cg�
R���D�s�P,��U9�܊��WF�:X��6
���i5��
�P�yL;آXJ�y9E-��S����
e5�O�\�G��i�ܛۆ�qߠ	l��w6�9�eFkqO<e�}>�DhQbv��t��eCV“��ѕ��f�V1�!����}5k�	k!YO+џ`�=
t�Çe�:U9����d�R�h.,�=X�'(��E?��5

+w�]�ԟ�c��kӵXN��VD�*k
n�%F��b9[g�=lפ�D���r}5�I]#���kW8I�k>>��̓U�{���
�U\X�����-A|�@jox�Ko
������v���`���|�����T��C��_jN�
c
%5}�K��s����抔x����

T _㭉�t��9�0�K=�8��\Ik�yq���f�
`��=�.��ezK)[����r+_?A�p�%(-i��
:O��mg
�,�O�м��nP ���X�~��LKTTa~t�����n.ǩ7]���������������#�{@韆�n�	g�yW�ć��Jw�wlF !��ڸE�Av��"_
i
Qb�r&<��7V���&�2�\���#v��U	�u�S����z0�
^*o�y��aQ�*Q�7�)\���\L
��V��.8��6Ÿ
��6���Rإ'���<����Mfk�o�d��r�J��o��v�7��z�M�
z�;5z1,����[�4�ɓ�2�B�O�
|ٸl�'H>�pƝ5��Y_��C��|Txɒ}����K͸sF]�d�%��Q7�L�2�٫�~ew'�ܡz�����W��5���`L6�4L��>���t�}�Q���I at 4|)TB��&(d0E*��et֧A�`׊��e釒7�t˵Q�)"�=�IV�Y�g
?�b���Kd��͛
+�
���T�8^�0R�f�d��
p���͎P�j�<
m�l;�3	��EZW�

+��B�|
!�x�jG2q9&y��
�|�4��%4*���*<�_��%l�<��%-���#ӶM{�9�%�~G����~�����'N��r�����>;6�b�E����BUyr��%9FV�x��g�'*d����Y��fK�G���3��,f2m��z�q���G��'�(����uꗅJ�t���"�
)��2b���߀��VA�Zr at Lˋ,��2;+[̰���lКϏ�~�?���΂��]��W�wtI������*��SU^�����{��[��s�ռ�T�]^�j��_A�I&[�z�
xLh#5��4<[q8��:���,W��%����� �S��S�f�9=e%�ye�1�&��f��do� �3dtq�d�iy��]4فl駫I���n�s���S�ѿ�6>ob���O��xe�ē�����՜S�L�(�^�|�*�4�O[�5"SX
��~�!�����+�i*�";��ea�h	�wL^�|�#5Zw�C��4�����ۑe�
+�t��|��e/:,���&f5
+�aY��|����c�p=�X.,;�K�E�v�
YDJS2�����;Fk��L�Ԉl���~!�Aa�/+����?qy\J�4♿�(+�5�

+�"���(�أ׻�I�c/f󂑿;��ew�)�`�=��
9J�~���ʺQ�?ޜ�yj�I�]�v,�g�Ƽm��7K����SĿh�Qjq�n��-R�g��۽S�_�l��
9%�E��X+��:3nTF=O�u�ȇ)o�?�GX��1(
_r
M���C�9]�����A�R?��i��ȑ�՚|�}y�k����GV�z*��컈[b��	�o��u����2���<�H��O�j�u�M�������r���1=n�B���5�0\�^'�i�Y:��؍���{�r
�w
+��
�}��l���Y��N
�hkQ

����0��x���s��笰�QX���-�0./� 
"���<Z\�f�n9���ٛ�mm���kA�y��,�S2�,�zKR��`�[?]wT
���@��
$v��C��K�$~u8� u��B��o at K3g���)Ig[l	$�}��m�1���<I=?�N[�m�n[�;���;	�񄁖��0�_��[�\�弲���i�?���9o��۫D<�o�T�ļZ�LU�I��g�!�{y	�_�`:�"d�����猰_Z=��
+X~��u�G�K
�>
o���U�{0�4{���
)?��H�
��s��]��Ry���X�n.VP
]� Š�0�ԡ�Yi��R��Ee�+����V�n��q�h�@<2B��� �6.�
+endstream
+endobj
+18112 0 obj <<
+/Type /FontDescriptor
+/FontName /SRQDSN+CMR9
+/Flags 4
+/FontBBox [-39 -250 1036 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 74
+/XHeight 431
+/CharSet (/a/bracketleft/d/equal/fi/h/l/m/o/one/parenleft/parenright/r/s/t/two/u/v/zero)
+/FontFile 18111 0 R
+>> endobj
+18113 0 obj <<
+/Length1 2493
+/Length2 13753
+/Length3 0
+/Length 15228     
+/Filter /FlateDecode
+>>
+stream
+xڍ�T\.����
Cw
H�tw7C
0C�t�t#�ݝ"!� %�)!��~���w���]��g�>�>g��RU�U�l�;BY9�8 �Jz�
 n6.4ZZM[(�_
�V��;
+��B�h�ao͠0C%�#@���p�
+p�	pp �88��kv �5s��(����@�$������
+���_
� N~~>�?��@[
3G���� �hah�-l�P��`��B��������
 l`kF��-��� ]܀���-��
��ƆF
��G������ 0 dkt��\\
-�. Xv���"@�	��c��� �
����pz�d��������������`e
T�٠
P����oC3
�7s3����
�(�
 -�0�u�g
['(�
b
��#��0�1K9ZJ�

��P����ں -`s�d��p�
������l
-�~�a��Į�h��
+�{��

B��B<
���<� �3 �aa��;�����0�_o'��
+����
+���
1s�.�@_�*�-�qr,m-� s���#���a0��?2��]l= 
0�q8~����a�`G����
1������
�-���� { �Y�����
 NNN^ ���q�����U5����D�s����lz�m��Of0��6��gP��
0�MC

�7���%���������_���I��@��c���
lA�Z���
+���!��k���B+-m]
�W+5�툸�5�笜��8^���H�z -Um�6����d�TCl�;0/����V��
v�@`G��
+۬�r� [�^A.
^�����'�0���	�UK����9��0 �G_��������%~C��� �I|�0��-q�e��`~�K� v���7
 vտ%X��%X��%n ���,��_'l��f���.f�@��m���矺�P��װ�A��-�A��z�����.�|j
�.0F�A����S�?
0�-�
�_��+��%�9�*�
����7�� 6�����1�?���](��. �`��/�q[GW�?�������N0��5��j�@�p��
V����� �� �]m��@@G��s���=la�;Bma��W-��V 0��_-������#.XGֿ_R�
,�?�����:®s[��E�s�a���{Y�
+�[���Q��}��~��*
�3'�s���`����qr��9ž0��C�F��|b����;�Nl	{07�wz^�?T�v�����9~���T�u�< ���?�6g���
+��������
���u���K uuq�@a����
ք��?����'��p�
���w�����v�puq�M�g���?>- �
@
��y��`�]}p�m�8�;��'����x��p
(�B���"r�̌���e�x��bY��)���a_V�j�l.NjhS�5��E�5��Lb��/5b�$A�
�� р>Ig�!���{��G�c7dG�� � (�ƢL!�ƈ�t�G�QҬC��
�bq\
�\5�>?�G���HtF���4�M���c��P*�y��@
oU(.1��<e�x�1~B�|
�N��Z�,9����!�n��o�~�`�#a�۵�ZY2���D�k�g^8�����V��Ovt�����T	�K�뱴�nP� "9 ��{�Ii\Rz����
���m�c���4&#���(Y�f��	^U�Ӹ���P2 ��WUA��n�u�����Ðm�.E���n��α��S0�1�L@�nW���~B�
��lm&)^h���DŽ1.'n�_=7Q��[FP_�q�*N�3_{ASq.MUO D��,��qY�r%�D�p`�p�w
~+S��ު
�a�m�P����8��唝
�X!�[�ƴD�^
�:޶� �aWBo&�o~5W◖�	n��a�U�}���e�I��xC�>(�}ό��ɇ	�.���Wi�S�]��;
�Mw׈���c2#T�E���8�v�o��Z�f����(.�V͗?_r���
+p2�mR>q�/w�x
���_
��ެRzG���2\��-��
t���@�yG68�f�-���2A��MTk$vÝ������o��u���G�,n���ܻ�r�ή����S
�Sw�w�c��L�6P�
)\��Z�Eh+v�^��D���ԩ�#צ	Wۋ��2�l�7'��
1��>}O�+�O���NG��L=C��y�Qz[�,��=���4�����"6��
g5�t��Yq�g_�0����h��%����
8���3Q���E��
H��j8�q���z��r��-�/�%�
+�*�3��r/��g��w��Ա�@gu�{&��F\��ˡL%��/��}6���|͸��KA��o<+I�
g���:��U�
��ګS��%����
�+n�9����
�)�g�	�a	
�,��6���ٜ�A8�~��M]2y�1K�
1Ƭ�	K��xf�=A��hG\�V���!�})��RnT�˞��;��>�<r4�PcLKU���[a���$���'����#�C�����m��䭊�*�b�A�I8B�����W���X�i�l�J�D/Dד�����0�WT9!��2�Ib�ʉ<Ƨ����
o��C$�j�aAm*����
|�?fh1BP�e^�%�{}�������2�~k��Rh��;=}C"y|���wx)�eE/yṺQk2R=[-fdA�&�Α�ϙ>���3����*„G�*�� ��_A,�T�RQ��?�ῤ3a�8#,S"
�ܵL.���;�hZ袷/΍�߀��Z mt��}��ƌ��ۃ���/��+����	�4���v�\��4"��y��y%��W
+�
W�57Q����>wR�Lߔ��#}b����

˝Ma�z�a�����l��qte�q���w9�rY ܉
-�g��i �ma]�� pk�R{ykr$�Ǭ,��rWt��%�ѹ94��f�ś���oR���7���0FP=�Ts�A�'�is���,j�O���r[$��
K�$���$H�vta�dG|ę5%p�
lT�-��KFR��6���ȝr�.�o�x���.͏�6���/��]�Rԋ�E���=��m�/?r���h�b}ÖzH���t�� ,P�x��r)�b���3o	�22SQ��K���ˋ�
ƴ+d�
�
=��O
E����pM�&�MY��9p��
I�/�>�M]�A5JG
1-E����#�2��
��+�4��
I/
+�J�6���7�
 ��1,�}6�Z���x<t����8�g?
��&V�nǯ
+�����I�[v��9a��/�%|/�d��~	!Qi�`��Ꚍ� ��� 
�]R�l�sS>ޡ���}Y|�~���c�ę/N����g��a�M{�l-R����`E����kr$|/C�M_�z<TW	P��C4�\zB�����y�kFq@?ا-��3��׬�?�9����#I�5�Z/�G��*Q�>�/��o�o�낂��&e�
�4< �Jd!�L�y@`Y\�Uq7���r��,'#Ji�-U���I 
�⯀ƊmQ�

����7�C>=E"�Ov��1M�#?R׉�K&�%Lj.N{�3��{=���
�\�g���'
��>/�1
��G�|������h
)\�z�巳�� }�e6笝�?{9 �	z�x����
pӬ����<����ZC�
r��bD��D3I�P�Z���cS��$�Eh~!H�zYSN�3} ���>���ª|p��S��Mܐ������,&Nc\�@������������~��
n
��@f��F�x�lTŦ�
e&�j-���I��z��b�ǐ�!��<�l�Aq�f>U3��xU��W|mɩ�[`_Q1i�Ϳ� �ԑË�\��l��9�%���LGm��+x�H��mQ�����*��1���
q�:b� ���,�-�ԗ�D'�i��ҫ��4��Y�IG>���3V�AL5���W�;"#�L�Vɬ�?���'ҙ%�	2�y�wp��2N-�'Z�*0��*�ïh7�{-�_L��-3�:
_~�0���
{ =~Eqr
C���|���m�A� D(�k+W?�ުV؝O&\
+5�O
���i��}g� ߛ���
��~
��]H�Y	y���v����;�Z�>a�
+.
l��@�̫���')5M�������إKIIG��9
+R��Y���lT�܁/mH�{0T����
�Ώ����b�u)O&���3��%j�{=�ڗ~4��R��v�hQF����lo��5&�<�7E��ֳ=
��%�w�2�K+pֻ��?��cR���N�nB�$+��:�V�"��Zy�2�1��{����U�Ka�A·>7��/;���c/{�=ndh�rI���?���M��x�RJ��s�����u	��DU}V���(�ƻ�ِ�wܑ#�ߴ3�--Eex�[�v�
(��9��|� �K��!x6&6	"��y��і�ݽ�~�Şp.Ṑ�m��+��{���Ү!���x�rc�`8��
��^\�(��P�ӿY��Ǔ^ʒcI`
Rz�
])�q,�H���
��]˨����Pa�M7�4�Q-���R9�{
��w�B�~����t�� ~'J�n����-�b�L�Ɠ��i"�C��z�q
/�uE��D��
�V�
y�e�N��Lh�� B��i7�{�}�'�-x#��+��E��f?z�[���[��w/�H��,��NJ�����ӱ�h��wlH�Y�^�4��4F�j�O-�Z��j�:$uR���/�S�(@j5yIj?�#��K�ٝ.�5]��Lr~�h�kN
;��� W�
�S��B�7����\OR�����-��g�ƃ�g�L�κ�4�9�C�H����QD˸
�s�?[]��
%�o�zR3l֘�.{��b�Pv��g�s�A�<�.�v$*�+�\�N��N
����*
+�b�>����
�|\�ݷ�`�2�.'I�؟{5Gˤ�+�j�$}�(GP���z��Q�.�ZN<��\il��p�4�H��fC�0�݉����W�	Evc�
C�]fQ�
%�v���`t�a7�暱ɵmne�fE}H�����w���s�jN3kvUY�VTj��֭*U��dh(sE�^7�W���!��֒�4C�Q��
���AO�5>dZ}u,h:���C|
+EV��:o]O�̜3�i�CvĻ�=hD�Xo:��-�F��K��ۥsmQ�sd���6<�UZi����a�0���|�EU�?�F�VD�1���w�(��^�3V�;�B�)�������R������hL}�Q�0���
K�ao(s�[�]�]�����������{.�Vt���fW�E�bʔ΍~
+�
�a�Qć`�=��|
,A��Q��Ǧ�.'(�K�Y`{�!8D��2ڪJ�֍���1���7��;%���pM(�f��$B��1zt�Tܥ.D�|;T��p����f1w�b �AP�j
�	�*�%�`�z�b:�\�ŕ�j�A��FrJ�[���Õ�_�h�|P{�4�[-���%�W��`b��يiჀ3���Q�X�h}��r���W��oT�;���?�i���xYs%vQKeU�_d�$0�z�l�sg{l0	Y37Z��A��zC
i�g�&.,5�Χ6��'�/��L��⛜�}��$%��5;BhI�� ��s���Q�Ѥѐ��Q��bI�[�تSTu�n©4���
��_�;���U�������!�J���
���:���M\����
+��a�eC���e;��b�Y���s�f�T��
+>�j
+��
>n���
�J���{�8����q��cǜ�M‚�_��Y��(Oq8
��R�MUd���UNzG@��~1
ICKe�bÎK����{�
+�H��Ν}QAY��n
}P�1Y1A&~��VI����E���
+d�+L�e:5)�Y�4�^7���Y���Ty
	%�2�����y�C[6{��3����X�"K7�(=�P$���_�`'�˽t�t�A�l>iQ0��A;UL���*��>�$����ɡ%���KA	c�8��$�=L/��\
;hZ��1��rMT���L��Q������㫱m+5 ��.������6=#�:��B0�,6?�A}��د0������2̌�u}�_^k�9�.�X>�W��X!�R�\��
:��i�
)(tΐ���|sz�\I[���i��^n�K�_�*ŷ��5u;�|�

k�xjϷ+-
�*i�qy
?��;2j�?�i�
���������_��DM�,�h�R�1�s	��x
��I+`on�->�tdS�M�w�(΁eu�F�UG'aR�����fL�t뫻�vv��\ ��V�gMu+�}�d*B�#�Ra�;bj��x{����/~�:+�aA'*�_cV
l��2��9���HT��g�8c(%N�iޭk�r���)
+�����x�_�4��T�ݓOK*^\$�x���~�.&
�n]�|N��G�%�$�)ԧY�s��=�-�r�����<��I >�J&U��.f�)�3���1'�j��@��i�W�iI�T���y�O%�hT����|�W�^���
+2q_�U&�����U�v�x�����A4���=rcLqn�Jԑ
�L���W�\��^�y�mk��ލs,}�3���|f����9q��Y�b?Ǔj�.~h�0"�
/��SG��4|K�.�f�S���S���
��R�
��N9�0�+Q�yĵ�>+
�r���j����庵o��	�U��
���>��
+�=Gc
�@����D�s��-*qm�*�w\X����
wP(�ՆP.�%��6:5
;r2��A���^�muir�s�R
����#�\J�^��!���z��@cP����dG���N�#��K��TD\M�hiR�D�[���ZH��9=	
+^][�U��
�p�z���Z
N���5 ���
ٍk�݆-����2^~d����
��>2�&P�k[X��ˈ� o1���P`�Dk�k�Ud�3|�cf��N{^����t�k&��v6��
;��ztk_?��
�
���#Jo���x��"��8&�&
�̞%�0���ndakTf�C�aQ� �'��4p�P��-��=p�gEf�r%U�&�[���9�o�t�*��v��
(E�$�Vm��QE�|L�7W	
I���->L�8�d������C�8�o���w�*s3�N	^E^�e���O[>.�	936�֗��-�~5-����f�Y?�����8���r_�r�D�7�lj��7yesI�,?_�
�0t���&����"���%t�wJp+Q㷭���܈B�!�������X�6Ϩ�?�z�N
�0���ŗ^V~p
�mM
�
+a� k��[x��.��M���|����V�y��:�&�S/����5�rY.���a�8c(m�H����e�Pǜ-p��8�i��_��f�M֝ws�=_����d�E�;��]�%:F��Xa���B�-S�7b����t�Ľ�pxw~E\%!�>���-�Mp�Z1=�w�g���\�U�m��[UyAԝ�xf��PVH�D
�Cm�M��
!Pِ��{�|�]x����Bty��@
Æ�\�e�;ښ�7�����Zt�z�7�YMr����4����d>�˕
�hinf�7���g���d��˩Wt��h\Tw�����K<.S,(.7Xx�󏕀���
����[+VfО�����I+�H���ǿXa�;&ʖ8>ﱏ��r�uu`� �pR���w KB� Fr=*�� q��&fO����9E7�k�Q�4��u�Z9��g�A
�4E�t�P��{ui� A�xsx<QL�=o�U*
0w`p�����2
�����B춪�ڕ���Ec��Zp��Kn��mZ }y��,����Qp�["u #��;�0����GwB�	
y�����B����1���^��R�d�/_�l\:.�=N�,o�0�����ha+zp5����
�@d��M�GY�L�^y;8g�azi0cYS�c��Zt�-ָG��
_\g�Hf��
bk�;̈́�ئE��
c2���C�iB� ���xM���/���
�,nЍj��S�A�z/���Α$`5�5�9&�O"����d��Y�K"��SDxT���ș�E�V��ɽ��FfK.v��\������m_�s��G�{�k �vt��I��h�'�h$������-��P_E�����g���)�9,6�a�y�j��3�g�gj������'�;���d�Wc6PR�z�d3;OQ�+�����F1���EP
�5M]�[p��!�\I߱vx�2�U�FĠ���A}^�@ܾ7��p��Ip��z���i��
y6_��q��آD���
 F+����iv�<��q�G�1�>�dH*��su�t��P��wޭױ]
��sZ�ד���`m{ͥ+��%�u
�����u�z�–Τ�@�0�T�<3��pw>`jͫ|�:qؤI/�!ol�Q/a�m�t�ݗg���,<�.1g��[�s�G��-%4Q�\�z(d�>�T��ұ���l;�
o�K�%�<����ũA<U&��,��~�P�x;��P�c=�j�8/
�z�c�&���
������ݧ�Y�����1'��JMm����rȁC[�N�oC���2��<�
yWj�op�n���rk��I)^;��JP�鈺<�u>Nd�4����N�y�8�9�}˦�^��4sb���
B�B��V��[x�d�5�1L�^���!E��sn�oW{*�Ȱ��[�^�1}�r��t
�kq8 ���T���0��>��^��V������]�t_lS���&�K:�\@h�o>���������r�4ʡҲ�N�8p�<�2
�w��0�Q�IB�I����_s
��kr|l}��VD����
E%�I����`LΡ�L��Z�V���|�vw�vS�z=v���։W�O�Iu����/Q��>�ob2�ë��bQ+�ЎPW���&�X��/���}W#��Υ-Z����dï3ٍ��>{Ge��p��L�W�,y.��
�\�jN�G`ݸ�!�"�G3��Oj5���8�.��IƎ��wԴ�S���G��mn��{^��*r��=�
�w�>����

�8�ޘ;?�^���i�	9n-�~�
���[
i���ڡ|�
+��ӣ>�v�%^�����
K4�0��B?lL
(��|��Y
A�4�~�����fA�ɍ�m�>�(�2`���:�B\��%B��U�Ԯ����œ���*ˏ�+��W�^�j�"�.���TR٩���!V�*AI�г~
���q��C��M��/RkaWH3HZ���-F>�J7δ
�t�˒O�9l�$B!)r���/f��
�
���2~c�P��9�� .�)��w=��#�� ���S0���g�q76%�߰V��ү�&���i3�z��=�Q����lGj_�ݰ~���r�0�=�"׃E �s��D�j���lmTf���pL�?cٯ3���V�~�fs�
(�!��I��~e�
/"]�5�\��"�ٴMFI��㷇m��11�0u
+4W�;������Vܧ6�5���b������SL���;���Y�#�u5���EN_G���ͭ���0E"��S'�J~b�gӿ?1l�w+!�/:E.6���K��VI�ae���
��e���ê�u�
���6L�41��X
��A��$��
��م���n�F���"�#Q��5td.����S6.�
�([!�C�l�T
J��Q��	���"~���"
D!����r�^镏�!��:.,SٓV׬:<vʈ���+�`��|�J�F�	H��u�.P�}�-���e�+!k˼�V�;G�ʢ�BO��W�����ܝ<�؛�?a��s�4O-�f��#�Ҭ�b#'�p��H�>/�����I2��`�
2�;L䂏�k�!Zq�n�������ܫg)L�4xiiSw��w��9��O�#T�z�m���
~�2���M�߷�x���=g��[���h���~{Qe��c��݀�[��3��6"�5p�JzX�+�@�|��k
#G��
я�Ðv���O
�

�p�e�ە
<L
E�xW��ݵ������5�>zT��
+hQ31��GT�#M�a��m��U!p�A?rE��
@���
K���"6p��"�t����^�˳
dy��bole�q
F�K}�WO���<�p1*c�Xčitk��ES����

�J
w���ǁܝ=�����E
+&&αJ/��(��˟iy���|#Gx��	� wPK4���#x
C?��Mz#O�7P�7<D*xPI�h/�
c�VR<g���EU�_�
e5[�}�F
�
��v��-?:}��P�丬����"d��vۍ>��°�w��o�T������>K4@Â��w��R��S�?�x�x�]�˴�N)��R� ���8������I�
I�z��ll���2�](v�Jn�ZY}�gG)��
�Ek�=���e����p@�-���G��v�v�K���
�!6���'$YpT��U1
�c;�t[��+��W+4
nqt��[�<�%\1��!R�mP"�*�H��FD
�ϵ�������<�^��A�2��B�eU��!y)�2���;�&�����U���[Hc`�
!}��OL����-Y�!}�a���癱�%N�p�]3��&�c�|nTK\�/��s;�
�e��d�f"�N0�I��7H���#�D(��!��:�%,j��w
�Cr6�I�ñ'C.Ir���d�c8_U
+�0�h9W
�<��O˳�1x����
�	�j�W�(~��?�V��"�-Ω6w��:e� >�vcX�"�ޓ�*�B��}�&���}�}G|�ZS�u�ÄoI�Y�
�9�8V����dGrCy�N�O��aG�lCi#�fy�e�D/|�.D^��@^'�%��-J�2:��xd�'�B5�|�a�v���W�󵇎ۙ5W�2=s�y~��"���!�[�Ʊ���Ǐ
�-Q�D���w�"�W[�q�^ȝ�����LMB�H�f�GG<Α�"'��h����e h����\�i��j
+7>v��Vk0j���
W=�L�&$�PB���ڌ��Q�-��U$#�G4>%
����
�̣���Bs����A�N�N-y��)�	���r
���?Y����o��0����\
�R�4��VJ���\�[�
F�+���a�.�c�O�.�کm�!�-4)��/̐O�Xo������+O1>
/+!�y���&ѡ�)�4`�7���;9�ǮS�)ַxې ǝ����D�-�X�#�Ut�$�J��q�b���:3c
�ڻC'F����m�Dnn�1a9K�
������B�s�~�¨��~�R�����圞6������;;�S9�P���`�_
��R�>��%HDU����~{ ΃� �;Q�͒}Lw�Y����j��Ӿ����b^6f#����Z�4��#���2
+��H� ����\�f���[�a�������HS�ZW�"{�oV"΂��m
GF���w�
�Z>��E-cc1������~��=xz�u
+�
�1"v��]*��x�=���
+�ȹWn��bR�w���ϕ�l(}��E�<����$k��Y_�^���fr*��yc��������m�
���E9r7�۽�2XQcI*՗�
P#�����@�uI^���f��Ca�s�㩯����R��Rw/�=��T���A�Z�e�6M~�O�Q��3v�CxV���f�l��v _�+Uc;W`�M�WKo�W֔H�h~�5_���R�9�M�F3	E͂���H
������%�W�+���9BY�
2���k�;�����xʭ8�x���V�_��565=�̵�9���	h�1��P*�r�:NL�
ԕ�Ƅ���H�x��	�}�2IT�)�Dyf�uS�4>h��`���.Vs�[3R\Ŭ�1f�H�.PEF�
�غ��d
��	����B��TsN(�U����Ny7�JC&4l�ҧ_$�a�ﮯ��0r�q�:���d��D�U��z�0�
%��w2��Y:�<���K=햲�������34䉈pQI6}��%f�^�ˑ�J
�F��z��>��<�]
j���g� ����T�<�I/2i�[���wŘ�=ʐ��`��B�R˥��<K�
+g�;��X9���]�tF
+��E����%�h
_Uu9g5�*A�I��<�vAR�Z��!�o���A�J
��/����x!��O������zr/�9Ҟ�|t������o�K���[���۬�G��2�N+�G
�ݥ�㨺��__�&&
p��^��3ܾ�L����9Ri�
+���Hy�	S=c����H/U����h��#̝3����3�g��!i�7V��(��Ŗ�|��₏�έ&�:�Wk�κ7�Q��Γ��>1��;�B��nI�$U����!�YL��)��M8C�m٫S��
��ʇ���^�
s�/��
l�Χ9x���
+���?
�&r흴~
���:KU��_�eu[�#���
+�
7�$���lEY,ȟO,��:N������
�d|����2��
��D����9���/��E2/��ZM1�2�ݥ*i�.e�Q���c8�X���u�̈��mK �0�����э���
��KX!�
�j9y�N�.�'��3��/��{�
O��h��&R��g߼�h��.�a�ȕ��LQә�o >��#�{d�4���f%���fW���������:_�TH����8����5���"�q�-�vN;�0'����|�ߛ-��ehF�j��y�5w�a��UŲ
>�$m���[�8���@�@��\�@��bD`L�7�t�k`���i>
Rۓ�+��9��(�q˒� �v1S$7/W�&X��M��C�f��cou���{_^~�,�
����l{�vz��k�;H5��ް�&���=�ȁ1���Č�ͪ�@�\��\|����!���r�v�����'���3#6�����Ju��w�=M}Ɨ��!�D�L��8��sQ�J>
IQ|�;��ڡ�7
7��o�xK��z��kQ�ik���LR������%�����\Z7v��9�bt��1Q�%DD�Q�2۱܏修�Q�*���_|��əxi8�\�����5�����k�F�
�Ĝ�JS��E{{+=e�.�3�\
�MO���3�gF��TBs�^4�ܭ���D�i�vI���2V�˸�q
+���p�G�ܞ�MdU$#6���t#2�fP

̡/Z�r��&J逻��#Ln���*.%�D;vcYM}��
"^�k-����
�5BJ
+0n
[�z�������M�?*�w!@�
ex�5��7�#�|Z{�

Ml��ҏn��v]���O>T���_�\�i���d�Y��
s�׸O97�1q�߷{
Z��
�O�E���G���ؗ�)��hzf��d��ba����X�n
��*��n��7|��)Ļ�B��l�#�J��fpuaT��PB5z�M�v~�
�~�����x�|��?�_R��І
[�'���R��っ�8N�iN�-�x��f������+�G͹/;�2�o�9T��+~(��5r��
f�{%m>{��[��N\�-6�,^x����{,=I�
B�(����<��o���1ZX(�
+��.JS�w����<�Y_�z1#X1��P�$���Fy,JY.`mHKW�+��!�c'�AB�p^P]�k/�|��#)K4�Rʿ���
2
���!���Z?��3���w(�D��Ůϭ
�:
H�R 
�RHB��K��P���(䧄�O6Z�&�I��'um��J�������j
��t�fx�w�q�1vD�?Ɍ1���I
��d���v��E�_��X}יu
1Z�������I�f�u���*st�Ҝ�-�Z�b���~����CdT��#-�K���]��2��g~�O<����
+���3N�£�{�Kx	���5񢹮�7��צ�G��3e��Xd�#��1��?zr�M
+��
1
�)���Rʬاj�Ez)�Yg�hf]�����j6Mc���X�t�q��i����	��:*JQ���3�
��*�'yF��3������
�+�
31/�ž��w��d^��@���-ہ3�|%�Λ2�

�� ���G�GnX��\-l
�q��%�f�E�7rz�
��S��J&��:�Yv
6��R�O`��S��X�ů��CV�=J��)5۰�z|O���7�)�2i'h"D\ip�#O���y��x�a��J?b�Q.�_*nO-@�7��0=kQ5�$
rq��ր��{��L�S�*�k�Ks�_U��ݘ�H�%�G�R�7\N��i��
	K��.Ow?����愩��j+�x���R���.~m���L� ��@4>ւa/��ޣ�*�'97�
+
����h���t�Сfɓ�a2�U��^"JP'�D��:ѹ���A�֋�����х�!'�U���KD'E'g��g�Ms�Ɲ��B
+�#��
��.�3�B�	��H�G�C��8�/����1��6�:=��W��.�µ���Rf��MLo���W$D}��u���4�)�LX
+#��OƒQW�
�3�ۆ��������D�$���ȅ����	�;��w"i�����h4��(^�#�x����/i�s���ܶ�g�G	SR���U�~ㄟyv=�O(�;�e�1��V���N�q'Q���ҳ��[1��]
�	�1Q��w�TEj�@A��>�����~�S�$��#Z�+=�C��/�
�^��*`e)!�i-ά��	�m��ڒv�n�:
_YYmy
��8���
b�ɫ])դ
`{m?�N�L
���E#���t\Z��λ��ٯ�i�ͤms���U����g��r��|i��
��t1
d� �����z�gvV��-U@�G�KY��!���x<�B�y���L�
�<�����Z)t��<���7Q�N��od�L���I㌄]>~+s�f���Λ���xT�9I��Lko��jG�;t]p�wJ��,�d����\�����.�:'�ǟA�D�kTk��0CZ<<�E3P��l/�
�&>�����ec��G��
��ș&��
�l��'�V|�Un���~Z�e{�|܉1�ث¸�%��0us@�lD"K]�C����<A&Vd}����J�ӯ�1�c�(E$$m(�X���|���b�~R �
�Z��
+Rr��9�[g5���
���Y�@7Q�[‹�m�K��b<%�����>s{N��遍��T���m] ;~�p�I]0Q�ڳ,/��C�z^�i�_=J
{��-qnZ
��n�~;<G��o��ƌ��
�Cl�l���������&<��NB���q�RE�o�tH���/�:r!Ԃq��U�~&�OTq[��J����ֈ�O�._���z�|GKN6U�"�g�C�2W2��Zz�l����
8
+endstream
+endobj
+18114 0 obj <<
+/Type /FontDescriptor
+/FontName /GXJSMI+CMSY10
+/Flags 4
+/FontBBox [-29 -960 1116 775]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 40
+/XHeight 431
+/CharSet (/B/C/G/H/L/O/P/Q/R/S/V/angbracketleft/angbracketright/arrowdblleft/arrowdblright/arrownortheast/arrowright/asteriskmath/backslash/bar/braceleft/braceright/circledivide/circleminus/circlemultiply/circleplus/element/equivalence/existential/floorleft/floorright/greaterequal/infinity/intersection/lessequal/logicaland/mapsto/minus/multiply/nabla/negationslash/periodcentered/perpendicular/plusminus/propersubset/reflexsubset/reflexsuperset/similar/turnstileleft/union/unionmulti/universal)
+/FontFile 18113 0 R
+>> endobj
+18115 0 obj <<
+/Length1 1436
+/Length2 6211
+/Length3 0
+/Length 7187      
+/Filter /FlateDecode
+>>
+stream
+xڍvT�[�6(H���<H8t�4H!]#3�30
ݥ��H)ҝ�tJ�t
+Hw)�4�7�9�����k����f�}�y�}��v�>�<���D�yx�%E-}��_���_���� �v����Pnp$B�9(�`4S��1~ZH�����b���� ?��ߎH�$��C-^@
����+"]�Qp;{4��ߏ �
  !!�
�;�PpЂ��aΘ�6'@i������S�
�v�������8��"Qv��@�'
m���`(�EІ8��0�%d
��np}�-����	nC�a"�P
+���4
⏳���� ��I�W�Dp��`��
����#� [�
�Q��E{�A ��qrCb�!
����w�@E^�`�E��wA����~Q�������"���@���O	���`�ݛ���:"��߿�p��	��
�C��
���
"����~	QQaQ �
+��l��~�7�v��6
+��1
�}]�.�-��n
����A<` ����߆� (�
<�����d��0�?k���^�?F{ ����,0�"N����>_>�����{�Ǧ���| 
	aa@@XX
� ����?����C����OB5�-��C�w���K�M
��
+�H��a �?�7���|	���w��M��������
��;9�6s���f�3���/���ј��Bbf�߮F�?����ݝ�۪��`�C
a�Q8��0/��
���A�p���
�}�Np
�t���p0Q���e�
��#�Rq�
�o
3S�����AB
���( A� ބ��	�� ��)�¼~���E ј ���E�
+?��
G���B���������(�3�N0[�o˿��qG�0#�[,��^��`0/�
��$�F*̡:��R���gm���RKd�IW��c*��^�ꨫ�5������#�~
�_N���Ӄ�d����V�y^8��n�
E��
��D�P|M�e"�6�1��h4y.�!�Q�����m�Tbp��Y��O�3Zv�E���-��L��co��R�
�
��
�=Qh��;�^1�M뛛�M��J:���-{LIG�Β��Y
uB��;7,�cŢ��;tyΏ9�[��_�ew7&����i+��uC�{S�x/��9�ٮ_
�&k��ľ��"h�
�dH�/�N'��U�y��
+h_���a�T�)
��&f����-��N����5"1�O��n��i��hw�ns�����d
"�ՅD�����W
+	��
�������[u�HϤi�6;F�n��
1[�A!
DŽ�:ר�@�6����Ĩ���3
�n����#�=V˱_e�/�������-هl�_N4<|a02�
.�=g���M;%W���k���\Fl�j����ɡMP�W������.T^�BYn:��
��'}?�~�����F�.i����^_Pm�b�K�붲hPw�qb���i�n���
���QU��L�S�
����˛�b�	fImn�U�m�
?���4�������:~����X%��m:����oat2����Ff:W��E-�z?)�,���ԡ�l��R8j�� 
���y����6�)��3�3�_�ƫ�tE����(���F�z�C�ѼbLY~bcO���`�է�?��$z{�$>�ɟ���V��Q_�q���S��K�=��%�2
�<1x�9=�ƍ��G��7��
�
��7/��[z�X�( y�w���N1tC���
+�O��>/RS<��^}D�
��-���'��"��#�zj��ά���o8�{./�V�Ch�j���ʰZ
�
1��
�`'���/�J�y����a���P��:�� [���-��ȏ�����Ck?q��#=��m��G"���Z{ŵ
+��hʬm�2Al�%F��O��*��|D��%W47�	Y��j���|�i����Z���
��}��RhΧ4�QG
��t�#��ZH�~��`�Р� OR�J���{,�92��ɾ5��w��
(��h���?!T�~��/�)���]
+�Q��$��ղ -{�|��(��q��X�=!��p��"\u�'���(z�Έl�y
�;�Q�t7���SSU��R��S�,����w�]e��`/{���E �r��4�����E�E���+:+�M^�-�ʛ���z�\ˊ�[U�����b�
P�p?}V.�
�@YK�O:s��E_�J����-I�Ŷ��>+�m���;���i��0�Re��r��#z</
�
��~H���+fCi�C�+{m5֎h�'������k�Jw�D���ן3�ح��myԣ����ཌ@�֏��;U�*�GB�z�U�
�źLÓ�b��_��9P$���ҷ�h;5�����q��̕� ٱ�������
���s�T~P4�p1Ae��o4
G��
Qй�K?�`�$�����1���`���I"���mB���6����k��z/�s4�|��4F�Z�X�܀@E�ԩ�ֳ7�c�ɮ>��ꇖ�Xg
D8�gd)_2$.*A���'��W0
�
.�X��3�
ؿªM�~�!8͕8�?�7�

C����KŪ}�qq-�����T��i���i}��NA�>&�UB�}�*���h�x�8�mW��(�LZ���e	V��{�4��i�"@�ZĠ)�jǼL���
�e��[ڿǦ�#|B="%�s%dj]��n�$o*q2&	�{$,4h�Rف���}��pmU��Z_�a�B~�^F����1UW��h�3�B
�9�ҝI^��������9�G��,�,7�䚼Qi���.�����N�$J����Q3[��2 at E��I
�z;�j��(�����,W8d��:a���xL�?z���|nA�h�U�����D�h��D�L�{�a
��k+
�O�Ր��b�����y]��YB0��5_aQ�(��55�-[����\���l=djKe?�������������H�
���P4�CT�'���5�4]��$��+Y��,:�8fֳ�
a����Xpj?[	���[��
�O@������I����D�@�ګ
��X��0���`Y��jQ>a�����M�0Ah_��������x [...]
+���ª`�C�������;>�4S����������E]ܛW���k
4,.8��b��_�;�0�^�0�H�=
=��q�r�C�%�J��`E�
+�8ר���9Ug݋��o��	��uF7��T@>����,�ĸ��Υ�_X8m���b��
+����i�)xoR��Pi��9�ݰj E#��r# ���l���NE���`sW 6#-wH��T �����t␒����S���@�x�(n�e�@
Q�y{��<��� ^��x�����`��>j�"y�.]�1�>�UN@�j��)h�Ek �W��u��>��\g}
k[pT[~}���Dw=���g�,.i����٧�6��̷�u�u�8g�8�<7�
|
��X4Zm"BF����o�u�ݻ
+5�&�:rmC1u����fʁ"�ۭ]�'�SqUH�#2灗A�ʸ(�c�ֳ,�>
+[�5S�,�8	ȫm���Y�m���zs�>�F�L������_�B�k>7 � �n��A�,nu��2
�X���_5�))��4z+��
+���u�֚���6qN&ڴ/�Hq	[>���R�p�7(G�~�}�����֏5_n *�	�󫬉x,�
��n��ִ�J�;qT���b
�
�L�qa��&�v�5�@:#Q
���R�B��� BL��,l�
���]�����lOdd�*~�V$�Y,�2d܋{ �7xtB��e��1/�z���F��e0�`>���4�`A�D#7GluK��w0~Ƙ�Jq�Fp���$�d�gPno�s&�vk��5�9�2`_�U;�DX��W|rTz��&��ǩ6(���T!�x�kATy4������-���HApsR��k��QA���ڶ��
����H��x��:���7�o�\jݮHvCn�4j�S
%k*�T(_y{p�[5R��o�~d�upʐR��e��h�0+ǻޞ���c�(UX@!��N
�n����Ԅ���G�O����h
V}Z���ĦH�u5خp�����%
�\ Y�;�nƟ�
E>rJ 	��:dq;$L�w[�x�!~/&a�����o���I� >dֿ�����4	-��(b[2�Y�c�����үkpG�Rr����2
��
Et3�r�A�Ke�r�����"'��
~��q[��C}��N�����K�%mҨ٫��
y/EI6݁c�D.�j�ZmHGg<�A]�ׂ���͜;�S�Lfͭ�5�(������l0]f�"
+�����M���7�����{�)��^��2|���5���B��"V�T|GuJ(𫋄I2J&��&g���v��%�cS��L��?�!,%:_=q�';?t �Y�%��j��ۅ�~꿯N���1#��<{Mo���_3�V�b��ήMU�^��6x�>���b:G<;���֊������O훞B�� ��8�~ȔnaV�o��nz�n,�O
�u��2W
+���$g�&6���X�t3�@h׾VZ����
�Y��(���c��}�	�-�r�ݡN�۟.
��Z�`+jP�v��gcN�
+����
��t�/�V��U�W�z�S�3*7��
�۽G�
+PO*L�
kP
F����O��{�EB
�P�g�w�浚t��(_?���$
�"�s�
wP-����ޫ2�6�7-N��go�P==�\N����3_0Icɂ�����H�;�A
ʨ�
X�ȼ�X~�	v��Ε���D^Iz#�{H松
��~�:�Nj-�y�76�H��$���ht��)���X,G�gLN��vѾX�z6q���m���Y��1x�knl���*�q�K����@�7t1�O�X=�>�
ͽe�0���-�aJ�]M'�-�̚N��}
+:�ezt���g�0�8��!&>�
���lZ���&j��F>	p�}E.�
�o�o�M��%K-�
h�����Q���ӊC�t
r����P~�.K�����߸#i9��Z�7ѡ���N����Į�m�uP@��V,k�'L�p5�m��#s���u�!������C�rND�'6��xL�e��ڋ�דsވ
��v}}����X�
p���6�P�������p�k��*e��ui
��F[��>	�kgsQZL�
�
�/Mm�XVN��q��ꂆ��,O��۷=�p��Q�$&K��%�]>j�K�e��'��r�~��K��.skA]������]���l�]�h��F��T���6
�;������
��C�{���p
Q
L�����tj����
+[�Ir
��@�g�Ǘ�Y���9k�GpD@:�1l�С�������D�
��~c>r�!�[X���˘�G'�2��#M�dG[�|̅�O���i�^�h���,���Z5d��j6�E<�!s��
s~��j��Q��i����p��7�� %\�\����n�o��Kcc���4C�����P���C8s�E��Js~��HE�yϣ2�
��X�~��m8���q�O����������؈��l�������%�y5~�m_����'V����E��8>�(:�Qb�R-cf}(+�
�e���^j�Z��-��]���ᚽ}
�ݽ��`�ғ��_[/���"ߩ߮��wM��W�2�u#\�`��9�u}�����y��~J���S�erZ8Nqr�y����I���{����GA}�R����ޒ�ũ��� �ns�T��O����;q31�s�Jz�`ŧ��w*�4���b\	��׺�Y�Kf�<A�ƣX,~��/�Jig�7 0|�Ҳ����z�I���9�o�_E�]o�atC�� [...]
+bckg}S�x˼����#/f�3�C	�X��繜F���3�85�]�B��5\��S���"�^I2�P�$tO�@��3�7ye/i/��T�>$|K�.
P?��
�Kr
4��2�<�g��6��v�r}��X�G��� לTVB�&�y
��~c�h��X<�񙎪W�uJ��h�h#���Am��Q��]�3&����Λ�C�)F,�oc��L*�{����"N�ZQ��T��lK�4
+���4A�}����*�9�s�W��Ǘ;}��:%,%|955�����ݘ��z(�u��j"�k��έH���^�����w�7r�Qx��5Ʒ7[�/���T��}눺��
�~�]���[z"[p�Eq���ȴL�	�:�F_LWd���J�>��X��F�5��E���cl�ҷ�0H���Ǝ�&����*Y
+6K偳�[T�!����t
=����#�[�qf��"ig�Hk+}n�iޛ���$��V�Gѹ��
+2�T�k#�샫��H]�����77���x�rbs�7�?�af}�)}�x�E��n��1k��~�t�e����)>�q�ن}����A���;ɏ�^�fAgS�qh�;Zy�>;����ζ{��
�9�M����@�A�_�$����ۧ���br����*ҜHQz��8&)���5�)�d�^t�mb�)�)wNJ{΂�c~Y�A穀aCS
߮���$��㑰�i����|�
q3k���1q�!��F�[BjwmB,��x�ߥ8_̍��`j���
�e�ԗ�|�
+���5��S.&h���
+l�Z�P*1��i���ܦ�5�-�I
��9Ѣ8�Q���֑�,��'#9���|ήҨ/+��5!�x%
�$r_�A
�kl��1#vC,R͜�O(QE���R��l�����O�\�S�I	*E<FϮ�VZ�g^�$X�
A[iٍ��SꂙV�
��F{#upZy�QR�P"2k�i
+p�{���k�Ur��d����L�i���i\�c;g�,�ߺ�SyM��`�k-��lEa>�洕	�
����Q����wl��`)�Gb�O�$�

+endstream
+endobj
+18116 0 obj <<
+/Type /FontDescriptor
+/FontName /TPJSSH+CMSY5
+/Flags 4
+/FontBBox [21 -944 1448 791]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 56
+/XHeight 431
+/CharSet (/minus/prime/turnstileleft)
+/FontFile 18115 0 R
+>> endobj
+18117 0 obj <<
+/Length1 1525
+/Length2 7290
+/Length3 0
+/Length 8322      
+/Filter /FlateDecode
+>>
+stream
+xڍvT���6�)-��{0���.i0a�� (�!
R��H�H�����R�)� ��<��������=;g�~��>�}_����E�H@����"hPH��cd.
+		qp�Юп`"S�
+�DH�/%(����h����t�D  qi����@XHH�oG��4@�� t� M$�"�PB��z���ј2?�
x  ))	��� 8�� F t�hg(
S��
+0B:��h���uF�ݤ����`8
+��p���x��� C(
+��� ~���?̀D
 cg�n�tD{�=� 
�
+s�"P�O��ih�ܠ�?��
�� �����_�`���`$�
��!� �0W(@OU��A���/G�+
+��{�a�`{���
+ 0��_�P
074
+�����(�+
��*��"�(�_�S�y@
0m��3Y�������8�"�t4A��=���` �0'( &$%..*���>΂����AA�`
�@7��Cs�b~��Q`/( ��	
��߆��@  ��C�`��c`��3f�
0��F{ ����1� �������������1����)*"} �� )QI�\�� ���g�����F�����&�OB
�# ���w���K�m
��t�)C��(�JHL����������e�)��/������������p���_%{�1[�����]͠6Y
+�y��۪�c�C�Q� H($���Ta>P�>
���GG�S����#Q�_/
L����0K��y��0�m�bv��uUHȯ��=<��DB�	���A�-�@}~� D ј �c ��A�k�" A0
+��r�L����7!`''L;����� ����E� �0f�`������� ;y���I�Ѧ��
��
� �(�N�j�/�_�
<=<0��[����h�P����A���ڧ-�5
+��+�x�m����bh��������F�� ���i�S�a#����C>V�Y��R�s�X*�K�{y�g�N�;�m�Oi�K��
���,q-���&.B%�D֪V
/�PkR[ 8����%�
��Ӷ�
m�¾��3�����a��i�a��;w���p�d��7;�1�Cw��~�ֻj��0*j?M����
��,�F��رRiJ<+C<�s^;bbb�{� �0=�W�E�H�P!wg�a�\�l� |��_���p��<u仙�P
��"ok*=�C� �R�=K��:s�j5ۏS�� ��T�̑n��-�&pg<z�2��>�}4�Я���٦^ۉG����l�8rlz}��v�
�q�3��%��nm�j�V曽ׅ��l��R[
�_��O��;��y`
Ҕ�Ʒ=Vs8܄���qgࣛ%�1C��:W���Y�,��JS��t�u-+j�Q�/��H�G
��
}1��(����>��T�6\��mz[
��a�m��{

�!�wJv24x���F��b [...]
+�
ҷ��M����9��m;&d�#z��?���d�vx�$��8��^��.�l!,M'(#�qZ҈ܭwQ�`l_e�r����tm�ﯶH�L稼L0|��o��/�`��$ZUc���m�N��_��]֢�Qf
�g��d�G<��n)�C�~��������q����R�W��P�n��#�|�r�� �:h��&��<��H}%��?�RS2�"b*�z$諸�5���za�����F�o��D��
�E^6�Z�:�2e����-,lB*K[g*�t}�
/"���X�HL4i���	V����=z[>k��Q�=������0����xe�M��r=.#O;�h=�vD`;_sqE�{,6խ3k�?T'
�i/>�
������z��e��ú��Ȣ
�5���(g�>ei�a#!�ɌRh��̓
+9֭��
c�JK�RT�U[Ί�SFuq�`]�E;�.��ϖղ7�~f���������Г��
�_PL�h�W�~�8<��

+�e!~+h޶V#�����Q(�'��(�*�2%�z���
+�Sd	�~��T.�|�3��V�y-
��*Q^��qs���S{[@U�v��K$	ŝz��Z��a��l�������Ŀ%�9��I&1��fh��o�*��'�(�Lu��5�W.-���w���~� c+�5��=��Z���Qk����_n2m
V}�ש�f���3Ac�y�J�ŧU�፧��?�CBq�[KŽ�Q��~?�I���ZB���
����w��
p��(sg���?�~6L�~��k=]x�����k�G��1��D�b5bx{�A�!Lݽ�j�_���ĕ7}.\
%T�ǒ/��$�M�v%c���?|��g��
�e��}rƚN"�z��\n{��X��i�焛��K�� Q���B���k�U�8��tB$��������NM0[Z>��#k�^5�!�C���]٣ߕk�s�J�ҳ��)>�ˮCN����a;%�@P�(�Tasn�F����"^���d�	Ǹ`Q
I��)�t��� [...]

�$�EnZƓ

���x�}]g;����W�A��7�m=	���*�~{읎�|��ho�������>�	Fmx�]P�ښ����؛���nSyF����p��n%��쨯�v��|�}�����12Mt;7����r�P�	�	(���t�vd��~���gc+��_�vrG���	VJ��D˼�h���0N\��f����75��e�7�,Q��Z�}C�-��0=�Q�
��Un'S�0�\��i�Y�"k?$_����Dc����u��ki˫���Lo4t��uq��_%Q�{�:�f�շ�����9�|l��
�5�Z�xC����R��*t�Y�c��-��z`�@�Ģ��z��3�.����>,��Ak�@��������9Wj��/�q����3�ě���/)��/��ς�*���.Vv7�kNG�
��_E����.�z��N��<�ӗL�6�%͐Em�f�.u�1��1�;���C$8O�NV��uȧ�I����/G6�GF$�R

ai�ֽ7�
_5�����
��������}�qzjB�ЅF����}h�,�5~���b���.�$6��n�~97����>
+rHMl����q�kPE�V�}
'KApD�2�`M�}�o�2����(�@����.G���i���\��CH��L��i���9���>�t����\ ��;�vj�
���J
�4�g��+
:��������
+��;+�y�+5W�+��^����
{G?"�-O�Qj����5�eE@����@<�"u
�찇8�U��@��Ն�Xwg�>�Xh��1;��9z�4��	�6uQO��t�!�m�̳�p�!i��N1���/��9�PG��-]�E.W�>(2
=���qm�Q';�t��baR�� \��
��qe�'��
�|o�>��p��AWk�R�`��S�6SҮ��,*Es�>=��x������/�{r�AĀ_2�����NYɬ"��&�R�����=���W�$~r�+�^����(�uea�7|�5rY�طc?�.�wƞ��D?R�N�1�LJI.F�Ί�-��%�g��D�
@r�Ȟ?ˆſP
.y��S�R�b�gC̯;�-�â`�\af6�ie���m|��G/4N?�u��7d�*�z�-����9��74�ck����{d����;��|��kt���
g�)�� �"MX���8LȨ0�P��
x��Xӈ
+K�N at 4 /�q[�z�
�j�r*˯�XA�3�z�@��/L�c��܃�
+�!�jl.���v;+������,������1s���@!�-![�ۯ��O�'�w�F����
lJ;�?�j�z�	��=$���4 �/>?���ޢJ:�/�ڥ9;�XsP⼵�Tb6ݣ�{f ������s�fVT�`SDC�����R����\��9$.1k4}�~�&��'�`��:�Ef���Μ�O��ڊH��c9|���������l:
V�,��
q��춖��
+!��
+�x���~��B쵖 ��
x(��Xm��n^n�K�A��[�O�O�_���-�32�a������T��f�w�&�DR�����<њ�o�
�S\Ʋ"[��3����Etݙ�T�M~�_�����?��U��/I�͕A~����2C��7�?�V^&�D2�M���GF�
+4�_4
�T>
���d��D�RX��B��f�O�:e��e�i����XL���<[!�#F�p�ϛ8' e�U�$�0�y��q`]H�fڀ�;'����n�i�N���v��lǺPI�7�.�6��ԫ�
��Y�pI�
hy�~q�{�🐹��ר�J�Zt��T}-�+5ĹhO7��|Zi�?}���t
%h7xpe���ȝ����n�Xnx':M)K1&����w�!�稴��:`Ktk>5?PkÐ�Q�{WJy�e��ղ�~J�����+�������+�b#sauV\�����-6������7��bg߹Nk��{t��>�R�!�?��G�-�r��f�T�q�Ue��>iD�3�1��K�D\]�������81v�>z���*s���dw�7�,��v�:�{@��m?Nx|w{�]�Y{�V�
+qo^��0�Fշ��Q%/�!�T��'�;܉]���
D�t�	s^壉h{!�,�gE0.�"�w��,WGEB[�:�+��]5��b��2�aL��kƋ3�t>�
+�d>���%�U^�?)�u>0N����]�8��1Q�{K�.?�#�E�2�*�*g���M��"��^)~(a��}B�c��eG]��v_	�f�&�ś���T���,���^˾��'�G?�-&Ū��i�&�g�w"+�d�
V
+��Qab&���=�����vy�O8
ē]�-�-*�
����J�).{H
+‡�?v������GI6��<Cؤ�/ѽ
�W�y��+���is���|��U9�t���Vi8
X&��[���q�:���I�?D���T8�=��:�V��?��G�#�|E�~|�A��8o|�bօf0tH��1�+JY����8-sd�m�P�6V̓r�~��4��l��/�%vt&!�!��&[�k�Z��T73ym��W�����m�P*����;x��ʹ�,�R�
���=�q�ϟ\� �SF��]A ��!|
;I ���J��
l�^����	\���|f|+�q�[q��5���'�C
_������Ӥ�
�YN�v٩��W���ckPذ���y�;��g�/�X��
/=}�^hL�-=�V� M&��E�y�{Zr�O��7yS3��aOp��UP!��ю�d��v�߰У-��l�b���ˆ�
]�r�!�����C�6�Դ�cK:ex�#�vxIRq��|����g
�9*��&6�
y��_��;򸮙Yd��T��5��C� ���i�U�A��^����nz^�@�/����
l^�*@R0ߦ`�Lx1كY�{]���o�yg��	�
U at KM�q#u��g$K�dє�o�4^ZY
*?�& ��M��'��?^'Z�fV�E�'�U�u:O��1�_y)�%�>����|�Ҽ��L=�
0>��x��x����t7m��-uCz��Kث!J�.��;^mi��˽���C4S�C~�ԟVC�>���f�*�mW)#�l&wm��

�
���!��n�{��x?{�M�
uU�L�r�Rk3
d"k�S��:-�\��ן��DN�z�䧯^s���G�<�+	OӾ�
���m:�a6�L�P��G��
q��Gu^�B�U�
���*n�
+q K�IF B"
�P[�)�������[
+��_�u�Ћ9�'<����_a
��i���%!���CJ
��0��Oe),*���C�w��UM5i�HK���Z������qIy����H�=�
��
+(��L���E m�p�� {�� ]�R�0�[�^ɮ�+��6�]
1],.�is�Uy��P�6C0��^�X>7�B��1]���,�TQ���ܡ	4�w�`h�����Z��L(?�r�[����nz�rD��������\�ό��~����>����Oq�`���cNs���$CYYS6Ƴz썸v�J�H��͆�0��ƊxNf)<�ek�A0�_vQ��H�ǖт�
~tl헥}�
+��
|x�ձ1���T��X5�V����/
�솂��&�
í��2׉�����{v��TLX��?[�V�Ԯ��W��7$��
�<rQ���_m�����C�����
ǯ>\f���d7�v?�C�
G�ulū2��|l[�i�-�3�ݹ��hQ��k���1	�,������J�
�Z�Iz4�CK�8�h-<�̱+=Tny�{�,��漶�[�vL���|a%Ϝ�,�\��������,�{�b�]~I*�<a���jqD�.W'Ą��'�ٕ�
�r_V�8�::!Z��߱��J-��{Q�dҌwE�7|�ByY��D�$�����Z3��G���O�?p���>8v�[_�Js�>��7E��x
�VK�wƺof�<JޅȬ�d���
#϶��7�r�fI��7cS��b���\�)�@����;v>���+\`;J
a��������N�U��=*hH�qz����sF�s�f+�
��B�?����1�Ӷ8-*9�{G(��d��j��{�JԖ��ԧ��뫪=QB��͍��!9��ύ�,]zCM����5���]�E���Si��g9�
򐬰ͭġӶ�]vqm�
��J��g���%�6��V��4l�j�jM�u�W���1��T�b,����޲�*�F�w=�Z�(3j\
�V�p/M�E,�K$d����h��k�2���G�R<��K��J��w���퍑W^
]Y�*��O%�H���b:��	� ^m�O���GX�Ot��\��a��vޟsP4�f�e����Y���
�]:��3��_M�Z����gF���f�M�ӃYd]O+���[
+���Ұ[�!+�K
��۞T�Z��cyW!�DH�����Ji����̈́�X6�U�j
+�Z�7�X��s�$��{vh�����mH��G�(ё�ǀ�ʴ�3��Y9[�X���v����G�6��~�Y�X�G֡q!#)�҇�(Gl�@���g3����K�����
��S��FO�s�oO
?�X���`ƹ�#wY0
�+��Y���s�!�^ ��F!�e��D��z���P����ޗ�~-F�lW�$�[ɼ"ъ�m�9
=2�ٰ���@y�f�z�K�7���9m�6J�g�M�2��R1Y�5cK
+���%���'(������cKǨIwO%�ip�pVJ�<�P����
��9K�s��_ګW���:~���;�l�
+��(
=M̼�m����9��+!
+md>C�<]�7��찷KӦ����u�m
�F�W�и�E�o�G�*����k�%7�.]g+QӇS_yR��R�
�-O�;���e��O?)�|�Z��8DA#���Q^�ǥP�(�tZ��
�ٕc׾�f
.h����R� =�]E���^H ��y�<8H�&���*��i�qRRYL6J��s)h�
��.����Lw�t?�8� XV�\�s��}����|���r�4��B��eR��^v)\Qy
� ��%{�7��D� "�V!�A������
�`��?

>�%��n���nTP
�q>ҳ1�*�h*��#�f��1����p���0}�O���r�~�]�l�
dJ���<-
K_WZ�86��'<�
��D-8����SA:��i:$��u����pv�\/g�!u�k���>[�v��E�9[4|r�CYşA/� �1��k��n��-l
�
+�
!@����f��6v��uh��^0Q;�!q~�U
,CY�3�t[��l`{������{�x���5}�Ni��<�d��%C��H�P�#��B��ҕ�9��ѩ��&�@����"�Wi
/�C��h���6��$�X���o”���쎲�l( ���R*[MN
�Jj,��
o2���9��o^�
� wtd�
@|u�Ӑ0����`ӻ�B�D-:����*����r�|��`�\�0a�sT)[_G�_�A�(�u�
i�[�98�K_��_-j���s��h��p�L�?W̏Oз�ħ��
N��_=�Z��I�_�,�!�k�\P�
�:v9]�o��%|��LW&j.Hm3���GM:��	�_V��U�A���`��2�g~�t0�o7�����W��y�z��;4b�J
�
��
8"gq/���j 

+endstream
+endobj
+18118 0 obj <<
+/Type /FontDescriptor
+/FontName /TOOBUT+CMSY6
+/Flags 4
+/FontBBox [-4 -948 1329 786]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 52
+/XHeight 431
+/CharSet (/asteriskmath/dagger/daggerdbl/infinity/paragraph/prime/section)
+/FontFile 18117 0 R
+>> endobj
+18119 0 obj <<
+/Length1 1557
+/Length2 7140
+/Length3 0
+/Length 8191      
+/Filter /FlateDecode
+>>
+stream
+xڍtTTm�.]�
���� !
��H	� C��0t7RJ7��(
�H)�-)�!

+�������w�Z笽�����z��MG�_�
+a	UA�Q� A)�����8 at PPX@PP���� �r��qB�.0\�9("�`S��~Z8@�� �Ĥ@�R�� !AAɿ
H)��
f� h �P"E��'fc�B����
��$%����;B�0��l����@�AQ��J�-m�B9I����`G�F��
�
���A]�H7��a�#�#�3"��-�����F���P p�A�pt�+�
+�����5�NP�g�?� �
 $ �O���%���!���	�� �aP���� �u �[�r;� ��`70�l�v��s0 at E^ F���
	sB���
~Q�J�>ee��"��
+G��ڟ
	��������p�;����5
ne������1
��
+UW��
���@Q QAI11	 � ����7�t��6�~�h��N'�5��f
E��]�nP 
+�
+���߆��@ �
�XBm`p���a���5��H��T�=@��󟿧hyY!������/�𡞪�����)( < �� Q ��( B��%� ��N����oT
�ks��dT�[# �8��o
nɂ�������#Z�P �?�7��_����
����,�/����T\

~����3�����Zʮ(�Xh!���o�'�?�����:��U
F��<�-q~�����
��Z��P�?B���08T��u㠣�ˆ�:�=�VqA7�	�
��U�CV��OHT
 F"��D�h�	���A�1��z��7 ( G��! 4G_�5I�bhI��~�@ A �
�wq ���FB
����?��$ ��G�n�ߠ���]��+���h�wu��

�:�`N���� �p��������2:!a��B��
�D�7�[���{��"�B=���	�~�]UH�y�<�;�� ��R���
�(��W޶��骣�
+ϬJ��Rt���F&|y��=�>g�'��0�;V�s{.�?�@Y�
6C�)�W���t�o?3�1�Jx2�3T�Ux�l=���e�Dr�(<#cKfD��g7�`E��/�z���b)����ꏇ���`����/<WLc�z��3;;R��^?l++
�����`����Ԩs��T=S,Nzy���1�s
۱j
���
�N/�(b�듇E`�#�ok
�44��
qvK�����{�!3@ڈ4H�c���a�ܐ-Ϣ޸�����5k
�In�;`c��H����o�܊9�FQ�j���/#7>��tj��
>e�-U1�џլ"����F��=^7S�AAA�x���h}2]�pg3pB�@��ϴ�$��
Cy�tI��RM�(��M��B�d9㔽`bY�<L�⟅��g��*�Z�5���8Z�BQ�ٵ9����
+#�k�L??�#�l����7�f�h�J����ʘU���j$iq�)z�1���#TG���neM��D��켚��GX�Ѩ�%�����xm�{,]bZ���x����6��w�\$G��[E6��s�

�f"��5�v�k�Qƍ\�N�'e܇ꅱ
 ��nh�K�W�P������X�@��IKg,^�F�
+�a��m
����Sgpc��'�������/
�>`U�.e�x�F�Z��텔D�1�?�R�ʮ)m���E�;(�3r��h��G�B��Y�����j��_��[(
M���m����}�|� �O$�:�[[uv��-�a�7��95
�9aQk�q�#�?04���w͋ZC�5�cf+�,<l6 a�o4���[�+ at v�A�
�\��t�A
_˘��V# �uZ�g�{Y䵿�=��`���s ��U����G_+��wf��!n��a��Gw�.�!8n���w�n2&�遼�م/�N�|b(DR<O��o�0���sƤ&�@�����Ŝl��M譽���"�2ޢ���d�0���@ #��z��Z��p�����Aև-�?��d�kP)���s�|x(wE�tL��'�6�1LIN*\
x�"^��/
��1���]���Gt��
ߛ���K�K�Vi����xWLL�8�4~�i'��%�z�
B
++ҴE�sH��
t�}Y���T���!��m��[8���q�Ta�R�b������Vc�싫&�*Z��
%��
+J�.noX�d}�
��
wb"����'��:q�/�E�5��-G_�����G�8�JAc��
�\J�4�q�r�ˤ���z��a�?n\�
�u#�W�=ꌬ��3��AC�NT�h֐�Jb:�1k��������+���%<^�yq?�|���Y@嫊���r߀��Lڳ)���{��mࢾ3ެv�ݙ%�jo��e�0�S��bI�nu$��ً�h&�w�a
���V�4���bv� N�PuhX�a��F����ǥ&m!s�_�t�Fg�j�H�/�V���?��H��q=3k���]�R��`i�~?��E�Pj�hF�dLg�A��H�~���-ˎg�Ɓ��d����c4����n?�`/+C�ٳ�)*`��2�\��K?pt������$������o$V���F
�v"J�ũ �;`r�s�g��Г$�1y���
="q
�A�z�'�����jU:�WҭZ�Բ�x���7ţ���R70�b
�h(K]rp$m�LY	���?�T0��.���I��
DP�Owy�'؄��D�a觭 [...]
+�����9���B3��De�N4ϭh�\����H�qt����!�~Y0��a��T����
Ako�šL'�c@���V���n�Hyrh���D΄��U�O-�
��{��*p,f�L
.�3U��
׽6<
ޘ�U�j#�2�Rycg�+��
+y�
�d5/Ix�t\6��o~N�k~�i�r�ѳ"�ΔH#�ƪ|
�gKW�
D�
��u�(�RG(���0ێ��S�^�3|\�O����헛%�Z����=8��[W@��(7�:��~�P�|���6LzHfP
��9�u&i����O5�\�c�:3�Tq1Y�O�wLƓ��y�t������`\QE�`-�����ȋ0[sb�%ʎ���m½EvC��
���;N29�b(WV�=��^��b˶1m"���
��f�{��)bi��{��\��R-���X�
�?с�c�;}�/'iYL���V�4�4��Vo����8�Fh�`(�ۇ�v���Q�o��T�E�p���Ow&��=r��{R���,��w�Y>��z�)	M��O�\�����{�"b��9ǰL��*�8��,�{
ɾ
st�t6*S40B�ob�A�8.��-G�Oԓ�&z	GM
�
���u�%�Kʾ������FL��	@}UH_4;T���&�ľ1 nU��Hl�u�

R$��iݞ<���{~[$
����Y7\^wo[�Q�g69���m�Su����w_���3y	;,p���s`�<�Y�
��m.�N�.	G��;髁���
�����
h���t�F��	u
+
���|})#hR�t"��b�WH��
�����'��s����:"�@k�}���qiv��I���b�
K��
S��-�MM��G�WZ�fBՍY��6,}|���r+v>���3��X�>՘'�vt.�J+��j`K��T񳑳��8��>9u�����[�	h�gQ�[?�[��}��0ơ+a�qyS; N\i�c�=*����
�J5�>
Ay$��N��`Ӛ.ވ��{�Ӆ�xq����%�o�o��G���&�
�Rô��%�������qb�Vy��m
�X�������K�yU�% ��g~%��I����ڀ��Z_pX_Y\�U��Th;��~��!	S��蜒|�#��	�<���}�ە��lr����Q"�:����X�4
��
�x<̄.5)���j����Q�����F�z����.x�n���i���V,\=(��<��R�����-s.�Ɲ�?�d��
e�o�U8��4�C荞}��7�U2)�
�W
mb�'Ԫ
^�u
+� c
+)��!� �^�$w���=cZ��C������O]a��*��۠��$����G��FvA;��	
Z��u����Yi��]�G�P,�W�R�61��S

�b3��o
�姑a���C��ί'ϫ�͵��A�7��ٶ	7��Є��WW�^?,BS[^��� Y�y
^-}NݧLL�!�)�J��D���p*؜T�sK��3s�k��e�݄�Б�L��ۊ
������g:xb��|._Ù�QU�.��Cؠ"?W"�������g[�^H�6o;Ue�'jQo���m|_j�N���W��_X9S
V�nG���DLF��6b �=ii��Hf�
�+a��o�@��g�LJ!�;|ݭ��
�S+	�ϛ����رc�Ì4D
6�3���`
+f6�>sF��5��(��Er�0,��~�D쨗06*ie� ����?aΟ�T�^>��hCN���O�Q����1��@L�ie2Rd��9���X�����7�1�Q?��.d��������Y�MS��O�xMr�6T�=Üʍ���iҽZ�֣7�אW�TG}�6O�W(�K�\�
6���~�^��d�\��?��"ʆtr�|��''��Kܸ&r��^7�P�B,(�i�e�
#�.�z�
�[����G�0J����屣����
�ָYG�doʈv����N�r�|�
�ޡ��#��Sǿ?R

�松�]�]# �o,;eZ��
v Y?*<%���t}��Ϡn.�,4�C�Ѭקs��CCf�:�~��bT�
�b��u#�<�&��8�B�(?_��Osw�3.pnIa����b�z
���$�L�W��j-
�	�| 
+(�hm��zv�x�sݪeo�+IOVo��)�����l��X
hY���
I�5�V���3�����
I�"n?�
�
f�C�$3qQ�J���U��O�`H;Y]�d�B���a��
��d	$m'��)�m���|�Y;��1A/Mr�F�
f���E>$�d:Udfk
?��T�܎`��?�א�

ZKj��mp|��I:�>i}��j0�g��� �Z�ͮi�ҥ��l���-�,��t�?��C

��Fe�;��p5�!ı3k�*]�#+Bڴ
+#m���O�D[�"��+y �L
7�75
����
�#�s��)��זp�^NEPp�D>3�lY^�My�w���[�=X"@�]c��q~c��s���<�`C�**�-\�	�xWr��O��W��ܔ̨��
�#`�_����>�!�����҆�z�ԗ�j�
W�OU�>K�4T�Y‰���i��1���r��N���h�.�a��j�JVSR��uQR$�����y�f]���NI��
��!+>���O�R�~�r��D�̀_w��J3O�M�����-Dj�;�Foy�%��sS����.M�+���ͧݬ$���\����}	���0
����m|HQ�e�E��7۷�]������ୄH%vɪ�p��ٛ���g�c�B��z�
�r�N
�hN�:m2�����#[:�5��L��9,
+�%��%��iH/`�
��DY$�2�
+��I&�Ҟ55
[�I�I׶ ���G��΀���:v��ޫ��o�()��[P�Ҟ| V8	CՀ��o{x`��w|x|�)��RN�w��p�,
xܡ17�e�|D�y�C�&���Z�a�j,U�y���,����`a�C���#��.w(A��+����
q��~����a�JTt3��cf%�%��š�e�갂��H��V�R-r�h�2:b�}2-�}�%^�
���{�M,&�A��W�Xf"(e�Iju���j멉�p�[��ئ�+
��xg��
��9�����6X��E�	5k�ɒ�)�p�F
�d�
+��
��=u��l�9*�ȽIǠ���
����W-i�E�r�8�Wrpj
��d?XB��
���|���Dn}޴�N/嵖X����Qe��6I�f��1D��w+Y)�fըtl�y
S��-
����ZGTr�h蒗�3%�`�2��|~A� ����Uނ��L�~�q����	���\��J�Us�|�T[c���8A�
���!�=
+�X��4
��% �pϳ�X�Z ���,��X�k9���#�]1��[j>��:e�v�y��E��F�_���H<T����f
�@�x>	��+�ԣ�y�����jia��&����M�����
W����O�
�t
9g���Ǹ
+�^'��8ݟ{��N�^m[�/���I��3�ܱ���O��F��|��4Ye
1�*�z��"<�Q�n),�e���#�
+�#_�
+��=���
�[�StmO
<���?Ӥ��Ac���{�����"b	���/�]�:[;UwŸe�SV7V�[c��_�T.�,����0z,����~K:��� ���z;��d|΂XD�6��J�o
�2q����ɓ8�w�sG4N�,A��&t�

s�϶�����Pu�=
�o/���S�"{@d��.
�TP�	�#,��Y�y��sp@͕:�S
���	R�ّn=U'ݣ?j
5�3���E��;��
[?ک�)j]�*��.�Ek�P�Ξ�ɣh����M����|���>md�Z��d��"))Gv��	.�����G3���
�_j�X���oy����Q,�����uB�1��8���D\JɈj���F����{A8R�/*~��
qxj
ڇ��
�
e��ሾd��]o��_f�)h��RR������M���h;�l_��*~��Ѯ�4���n�EVJ�iY��" @�Lox���%M�\�gλ\�eR���[`ҏ�O\InKt�ۈ�Π��ƾW�T�O<�����g)AD�H�tqi�p�����1b��T��Œ�9��z�&_�W�~V�
+ӈ�B2*���(���z��Bt���bA��G��
+ɘ��
��S������|*�u�[�ܣ�R3�'��xît+MMB�ƥ���������?�V�-+Y`|5�ʸ�H'@�:'��1��}5u6Q��V)y�2?��v#p����Fw4vS�O��,���x�[i>�����
!���[��$f�S!\��v�qXԒ��M/��A���G�K�8#vܯ�Z*e�p���9�-D
4�e�>@���k�F�Q��!oB�
g_p��t���8#�i�������9�z�*�?�=����y�B
�]����𱄦�1�0$}�@;����#ͼ�jB�KL��x�S�y>*�C?�;Z�xro���?�㯇����Wf�2$�����B|��i��2�vg[O�[t�#
O
yW5
§G�o���wԟ,�X�ݚL�%�|����'��_�t!�d�����?p&�J�\�}�k0�0s<�
Kw����zo
_<��L�2�E�W�j�x�RM�� ��m
�g���W��(�k�
��,?��`Y�g4#���X�<dn4^8Sm]�mpe�7*��
��Xgϼmt�e��\vO� rb��q.��|�qjp
+_�*aD�i�/�kG�АJ�vT
�XHO��!:P�$'
�t[�N�z�����k���!���Ar)-�@�/�
�kHp���:ޙR�}�m�b`W��4Y�(��éa�
~ ���p,rl��PF�����:`KD��p������
�,���
O,A�D7�@�y�6ϵ��>�R���ː������x3�k��G��A^�0���vp�����2-�Bof�dc++d�&·���ƃ�d2������w���O�	�D]yB�h7G��n�����턚�07:�G.[��s�P��0��?ߍ&9�
���h*���K���a�3���V�0�௪�[�Xi$�%͓Tnh>��္&�쁽�&3
+!��NΣ!?H���lԊ�`�BR�:��D����4Ϗ����e���0�|�<���!A�q�����>�Q���]g�F)�����V��
+endstream
+endobj
+18120 0 obj <<
+/Type /FontDescriptor
+/FontName /VKRGIJ+CMSY7
+/Flags 4
+/FontBBox [-15 -951 1251 782]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 49
+/XHeight 431
+/CharSet (/V/backslash/element/infinity/lessequal/minus/multiply/negationslash/prime)
+/FontFile 18119 0 R
+>> endobj
+18121 0 obj <<
+/Length1 1463
+/Length2 6796
+/Length3 0
+/Length 7790      
+/Filter /FlateDecode
+>>
+stream
+xڍuX�m�>
N�	at��n�AR�6ƈ
�� �HIH�"
"%-
"��� !�H�ߌ�}��������
�v_篮���
������F!�"� 1�����
PLL$&&��@`�a` �
�A��
+�������8L�����@}ow��$P\FA\VAL
(!&&�w"
+� �� �@#P��a <(O4�ō��� ����
+�*�y��	4c]`
���;�
A����h����z*�������

+
W�"�. at 3���A�?	o�=`��� <@
�7n�r����0 pG@`H
��	�����@s=C��'
�;��w�0��� �A��j���g#�W1Ayx���$
�p���
AX?�0���L�cP�z��v�%��9��f
+�������X
�p�IQ�g�)k!�(��ܟ&
���_��ͺ!Q���?
g�����S�����i�I�A�cp(-&/##%�ya~џ�-�=a���?a
��@O�'�G�p��~ ��
�E{�3��@\
E@�@'
���;�9�^�.��ډ�'���דN^P������WTS��L�J�7����Q~�@I1����4P\\N(++
�g�
����&`ğ͉���
����wx���#
�?� �s�-N�0 ���o/&-�}���
������]�7�������������0����''eo,�F(�9���j
�me#����Q=,g5$
'qq)���o
��F���&,�巐��
+�
wf�� ~�qpUbb�ù�{�`p�+Ù�s����$�e�`4�ÉL��@q�M�0�_����(,���
tF�?�U\B
(
+��8ڸ�L�o
����$P����`O���ŀ��+r�	�co4��_2�m����W
�� �M� ���u���5j,�"�GH?�ǥ���Jcyg�����Lz�߅V^�2�}=1
�"�}<�gߙ�!S�1O�wY}G�`�d�c����c�Yq���RMoP޵#��{`=}
%�%�V�Z|юY���z K�82Y�����7	l8�?bm쩒h�v�-�,�.IGꭉL'��vIك

���z�$w

��e*�i���9�����S��0x��҇�2R8��zD�~ �v���o~��3������ݤ�A��b�>;�/
v��[0��F#޺[ I;]�����H�Y�.�4 eT�Ժ�$�lŚ�үAIFQ���~�ٯ��լM
�U�
+)Wx>P9�����}��W{@BYC�p��6�"�������-x&��]�k�0�5�[Э}���ԙV1�J�^
����n�)�?秸����9v��$"�`i$�y�}�8C��3wM�!f��Ҋδ��6�'�G�J��}\s�&5}���
m]�T����ӶA�0C�2���}+ap7���R�H��/�ݳW#��7�y����)Q4�

}x�H9r�|�j���^Bx��e(qw��K���=�_�$�6�>A]j�aq��0�Sd�n���4;�������x�p��^%�mQ�J�����t��i
�.�a�?�`���\�
�
"E������R'�;Y�O&�ڤyf罃|Z�ܵw�'��ʣ��&�&�L�M�����*����.܃�Q9=Qe��
W����g_h��.���M�M�㽔��;v�Lm
�����>��6�-Kv��p$��0�x�@,�KZq���b�K���e2;t����G�t\@i���(s����tF�Cٱh�Y�7u�6zөX���wDaJg^Y;�����h?z�ԅ������뿄)�Z���P
�d�IM
+�������%�

�N��fQ�2�y������?05	�d��C���_SL�dr�~�t��G���b�X�
I�����IӢ��Cg��'R
�?���Y	*d����x���ތ;�
I!u0�.���L%A{vL�&
{k-V:�}�4���k�|�¾#��]�B1DvJ׮_�qp�n`�
L�O��? �W at S��Gٚ��H�ri�oa<�8D7�
<�R�eX�o^�����ɠ����s��m�Zt�s(��38����;+���J��m�>r̞�'�+-k(N����nh��`2Ag
+��ĖH���m2�c�C�
4[�6
�m�n>�o���JCy
+Ҩ��
8M�(=h��#�%P�an�t8�!���4dʹ�_ɿ��1q��6�8`�\��HQj%��q���7ϳr/uM 
%�l��
=���#�!Է�Nz�5����f�4�n�����b���pL�l[o�x����#�g�����xHw\q�C��6�;�1�v쟿X�ZPW�܈u���U����pyY0��gr�g���cv3|�+��6�s?�*���Q��
WD�
M�I��J�0������3O�
8m{�C��Lo�����si��^�/�j>y6#�[����.�Y\��8��G`-1����Bm�)�=Y�����L�
�#���"#M	�	ֳ�bf�T�K���Q��DjN�e�"���^N^K������{c�m8ض<DMgo9���u�$l���Rt��a{u��K�
�人>�͘�uD��~H��Si��k2�?fR75g���J�f'jm�?���
�����dP�}gv
�j�+��\�r�	�lNA�8��̈
�K߮2x��|��9�s=
K�G���+��
n���ɮ�˫6;ľ����%]�z,���ۮpEw�G
��8A�� �
��-��o'����~�����
d�}�
+�&�-�y}�&�A�P�}��"��Ҹ��Qu
�2��%qmnZ/���J���n�
+W
+�1WX�ۥ�@Å�
:g%[���
�t"X�n4ߡ)�uWy�._��Ǐ���
z�|ӢXW����A�hؖ9�̺��_�/K}�{\��*K��������W/�9Y�Z8��MXI�|�D�u�g�_
+�w�
gɌ
�_&R�1a�p/f���d��c�apQ��7���
s�	�����O�<nw�]�g���}۟�ĉ
V�i�5������%K���+���a�
��	Fi0�E���o�J��xH��{�7B�{�����^��A��E=X+���i�j-F��"�
�?k�L;{��
���n�i���-a蒲��0���
�b*{��(Ke�'sh
|�V��:Ft�δip{�
U��5_T2	�}H�mMBn��4ܬ�#C�p_���"^y��ce at hőKfQٵ�
�e�J���,!����8�+o^L��â���2��Ӫl�N?ʿ��J�d��$�ɯ��h~�za��\^u9	�JΧ��Њrsg�:�P>��F�6�f�P������㪇��4
�����q���i��y�|����;�p'�u�A��Xc/~h
L,Hyska�TO�(,CL���16���ׄ���tk� ��C�걻?�*+�� �
gYT��2&ԛ�G荸�
+䘳�Yw�:^�
ý�5���cU���*ZOA2+�.�I
$*
Q\v|�t˝N������U�=gõ���٨���O����S|�imGwDf�
^y^bqZ��2��?��ĊJx����)��
Oo�hN9�5:�,Z�u���/qY0��~w(X���qrh�E)yFe�
<�@x�4��8]'�� [x29BP�΀�Ǘ黻�
'FY1�kMEr����̢����:.3��)����I4�D���*�C/F#u;�r���$Z�����*��a4@�٪5����Fn��o����c]�W�xx��H۹�Ų�G�X��e�'Ɖ�	%6
+3�BK���b���@�1}00+�s�n\� 7�х@x�\V��KÁd��سRq��i'u�\��.�
(��u/����B�{�`}�!�a`
5e��g���e
,bo~p|�<���EJ�}y�M��V��1bI��_ZHn-O���1VƧ|G
�i�yz<S�yw��҇
,f~Q&n�ۚ
+������F���M%S�R�
p�>�
+ֱ�ς/#_�>6��,jYl)}�9SV���G�s�WM�������(��f�����	����z�S�˪6���ό7�&M
�,�����3X�{��
+�Ca��d��4�'
��N�x����>����m�i:��_���y��
,��
�g&T������LHg5�N�5��X�����@��؍F����'�*��3�dfk+J������8}���.,�� �?�h=.[H�I�
7�4W벜O��ߧ�Ԝ����ai�n��e�
���ٕE�I�qf� �� DSDS�Y����)pk�,]��ޯ�%�I��W���_�v��RpF�[
+�*NP&��\��DG[�۝�dK�Ѳ�a�B�^�ب߸�8���k�O��B����P1��
�
+�����(�c�[FHV�"�(���c
������̈́Q`�j�Mѽ�Ϛמ�

�%��p�қ�]p'�U�%\��rs���g��H-�}i�G��GQݥ���x;�MmEȾ��7݂�������)�\�-��(:7K.�1m:}[��q*7�1�|��.�o}�_�����4kZ
d�gB�?�l
����w������Aq�Jƕ�������d����WA��{��'\D��uxGNE3��0C�B�
Z>3��}�=M-��]n��=$���ˬi�g{j

+
+s
+��\��
+P���
Sn�</HK�

������{������/J�(��;f��Cw-s���31�.�1��`�x,s�FG����ȋC{���c���̵d�l�H|twM���|5�{�Di���a���G�v��7"*��|
s��z�:�5�O��Q��`6Q�y���<�VZG��)��(�L�J��
�`b���{^�ԞV/.,Y� 4�W��_�k��_�m1GU�GK����
�g�
�&$���5
+���pZ<K�׏1bݸ��S��I{�A�F�e�&�W�@���6E~TN�g�� �
�֜��u�k—�S�^�������~��dVE��C��j���9g��kϘ�W�';NQ���V�����T�^4<��]5""�\�	������ ��c�k�#�
�2�1=l�%�� ��s8JN�j�/ņ�nH���Ӏ2'�t�
W�.�%|#�������[���#�o	�m�6���=񫆣�0��o^5]��(��O
&:�2��a��"{�Z�敏�1��'�
�����V������,E�
&�����X��/�r���p�g�Vn�z����C&H��;
���#��FR��{�=t���
�$q�Ӆ"Y�lS��F]��^w
s�G_��.�I�1�v�/
��B��x��hg����9�d����$�������f*٧��A�
e 	�Up|����dpebh+�n�OR�^@pR51͛��GV#���kx'����� !��<����@J�B.4k#���L%�����݇�rn%i�_
�=���
~=*E�j 1��q�z<��M��^�u'�X�d�pq�
+�q�QVv,�
+��EvK�4|�?�2�� ���_QKv��P��C�N?,x}�X�C\��9� L�n�&?���ڮ��)��+����
�4�� �
����j�I�7����
��y_[c#�> "fr�����K
+�Wc��D
N���fL1[M!����c�y_�&F�wW��+��5��T�l+^/l���}�
i�`ً��F��^iO�/V8�@�����g��
�ݙo���n��
+s?�ۣ���W��-?|{��/����D��f�p����i��&�
���_��k���l'.l���Ƴ�|
�a|0�;���oo���Y��a���w��4�'z���2de����
��n��nr��������RxLDŽE�����g��K�L?>����P�
s����y;�a�l�0��]!������\�
6��ʹ�c�r��5�wb�l�"��0J�s���?x�Ŋ�o�
��V�������[�zT�*��}��b�.ɢk���������v�:Yu���Eϰ�[�BW�?�PJE0}I��687
/�q��pG��,~�7�<�d����Z�^c)	^�UՈ�m���چ�Wg}��&�K��V�]
TvKZ���)�B�r�lN�ܟ�Zr]���)D_�{`���>��%�
N鯑��
�/��׬{H1&��i��N
��Eo����i��p��	��*E��ϘI�"��*�
��J/�4���y�Vp���akup{��x#�S�v
� ���,�`��'�x��2�ևo^F����
��h�Y�L����*��0X�I4�_��B�	֣�k�����r��U�+�!YI��T��������m1��/��\
�+���I%���aX���k���k�^�3
+)Ӈ���
�
�3H�&����A�q�����l��}H��&��;���6~����Ʊ�y��a'����
�g��j̔��wRȔ�vDr�����5d�:4~~��S-�����#�X����V<z���jk�o�h�:��L�$#^��/�
j�8.\�%�U����<���&�H7��/�&hW�ҵ����]����5b�u��
+r���
'�9�(�(n��_��R��x}U��ጽ'��Pe���ni�dؼJ���D�N-͸�Dj��u�hE;����&U�
�@|sf��X�	;� _I
����Б��
�������B�
_Ǯ�Z�}�E��b��x5+}�����x�d��%�YC�iP�
E ^�N����`���h�>�=z�^�mKV�y�[0s�%�J�Q��8�� `my���r��
�� 
G��B
Y��6C�_��vʩcDONX-x��.u�
o�_��
��4�	�m�7�J����S�!
��D!C��1_o�j�
+�B�1�`Pu
���fw3�`�lV��v����I-�Ur�⑲����_68��Ig��>a��IN+ܶ���y�����늘|��d�$`�}@0z��Pm���|:bz{�wә|�&|$LQ;�R�zmu��^D��e�
��PυwuCц�h�[+�m%ƫ}��Bߓ��U�7
�w� ��3�@�E��A��ث��|7��4��V-<7Nk>S'��J0���QGa�r9�>z,V�uޓz�T��,[��_�I6`9�H
r��&B��<NPXHP
tW9��
��N��㱢
E�s���r�\.|x=�f
���
�=t�e��F�w��C�3�Βx4Hv
��[P)�����)���/d����孤��2mT��f��Δ+��T��`����k��j��F�E���'�	5���|�7���cjac��!x,�;�8e��Z�?
�Φ_�*�h�����K��d\�cxN}P�Δ&��ԛ��9a#�no��V����W�I�3��o\k/����k�
��nmgOm��%2_X���Ũ@tE�>EJ�%2�xI�#��!4�n�|��J���c"�$�5�ы	ڬ�p�{�
K�~�\�c���{�
��W�jRS���9H�����ܷ�9�s}�x�g�%Z�#��B�#�u��.�
Z����)Ց��)�
+�ݘ� �k%�b��
���%���_I?��0h!OV���[���U�݂��6��w)��)��NM؉�i9~?Ts�$�kg�>�?{��a�槮9��|]�TU��x��rE-̐:H@���i7�û)�V�ճ)��W��Y�8��R�
+�z��6�j�[}�8䫓6|��ܨO���7�8A�@���E
��
��t�i[�o�0�2�okE��)���5u�ɽ#���Imަyz��!�v�5*:
+@
���/C3 at L�#&M[��Q��HZ/���"B��hkw�<���7�a$}p��� SZ�
+endstream
+endobj
+18122 0 obj <<
+/Type /FontDescriptor
+/FontName /DFVRAV+CMSY8
+/Flags 4
+/FontBBox [-30 -955 1185 779]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 46
+/XHeight 431
+/CharSet (/dagger/daggerdbl/paragraph/section)
+/FontFile 18121 0 R
+>> endobj
+18123 0 obj <<
+/Length1 1570
+/Length2 7152
+/Length3 0
+/Length 8196      
+/Filter /FlateDecode
+>>
+stream
+xڍtT��>
CD�aH�JwI*H�t��
�64"H��� �"
" ���t�t�|ӷ~���?��������
����}�p�
+(C�vP5$+ "(,
T�14�
+
�	
+
�xx�`X8�O3��������pPECAX��
���A"��88PD
(")+"%+,
�������� @
A�&� xT�(O4���/��_ �PDFF��w8P����A��u�W��@C$�z�+��#��rww�`�h�[�@w�����ݠ�/�@]�
�f� 
��#
��i�u��@�C|�����@C
m�

+���Y�~�o�;ݟѿ���A`0�Bx�@{

+�S��z`�� �#�A��An 
d�w�}sPM� ���
����A

���Я4�W����"]\�,��~�`h(��Bt��tGx�y��! ��H at p(!c�ո��
���� �%�e$%%��PW ��(�+��'
+��e�3��F!Q@{<	�/�
��xc at nP ���z�'��@D���@;�
�';�
���o>���kO(����?k�� H�����2�0ֵP���1��[@T( #!
�JII}�������o�>����ɨ��Ge����x��)
�?G���t�x-C�|�H�JXB���?�����e�ߤ��R���a�����\`p�?
�R�a�c����]M���ù�7����Cဗ�������vF
���ð`�?��W+�5�0T����8�(a����Sv�o
��^A�C���`$���JHAh4� �����[?���o}�H,>���
�G���*a�ag|
���x�
+�ah0
O�ߠ2�]`
���88��_�/H�/�� Q|�_;��������g��)�ۊ�F�o���7Я�o�_Oơ�x�b������V�B=�`���H��S���MG�,�
�dS3-�1�]!XޱLoGm�T�W[H)c_��xa��g��?�<�޾�L|��%��5��%��s����A2;
J%���n��]��$��o��,H�]l�l1���d!�t��p&�`#��[ֈ��9�g���V4QWі�8#
��s�pXԡJSӱ�eTJ����_��J����(�,
�c��ə���D�B�C��"q�Z�s�)�%�w��Vj�t4�]cl���AW5�J���\5<,MR������QK�>Z}S�yQ�[P�}��Z��@�E��t���,���|�i2�vw�vF�-��H=��v?���i{������)!�Q��l�����
���VU\sf~���N�l�aR����q�lҵN�v�
+t\�¨��2_˷�����-c�P�B �A�K*P!B}=z��x�w`��
-ayx{-�ԗZ��y%㢾��F��4;?��\�|�|o춓�qz��.�󘵿6���b�D}����"&!�!M2w��D��*$`���qQ�T_�F����]��S{����Y����D*mTU��4\S�]����;��kɔ ��P���0]�0��.H�ϋ)<��+���,�!2��xAݳ�u���zkK�|fΛ�n�������jCδ����ޔpEf�^z�^��)-�]\@�6kz���2K�XA��6׵�a-�p�s�bo�yi��F�ˊ���yjVy�c�"�]��Qp�k����Q16��r��p�m��*.�]��O}��[i�y0�Q%
+�zV@
+ra�0���H`�����F}dM�כGȖ�*YI��z>�;�S@�
C;v���`�#Siŏ�Zj䨒+-�р]xd|?f�T
+�3�
�� _��lg2�iq&4��0_�Y/5�>�fok���m(T���kH���� ~�-��ģcI�8*>nx�@�|��f �z�w
%�������Z��(���_��aSҰ	w��X�FQ�z��+�]���Z�s
��B���8~�� #
��ь�J�J'_5*ŊZ��ܚt
���c,OFW���LmYF;���z�h���-1C{;���ŗ9���gT�G�r�EM��n#(����ң�5�:"[�ҕ
��^��c/
Y�08�xb��5a`t"�bΔS
�ҸV`KR+Q�y��
\���;��D��{������
:>%ذ���
�����>��
!��c�7����lU�x�
k���׹�_Q�r��Еq��L�~)k1#��O��!a]�M嗁T���[и�t
 �B
+d���S���?s�Z��t{���Y6�O��<m�ծ�����c,���5��pF�3��(O
#�rt�xր��\�� �Y���X������j밞�.���۠���U%x�T�i�tH�I���
�K���|�C�c���y#r���6ig5?7�Nd�{�(W�
̳N�Gl��	R
�����w���|�a�[�4�c6�[A�DjPϲ�����O�Hl{[�LM���#�Ĭ���ٍ$��������`=�����>��hj�Ƈ���@���P�9sW�νPά<�,�^�ˏ|$'���?�<�\Z~�W�afhL����>�Eߔ�H�f�iJ���=
���i(��/�:����]�:;��ϑ�_��{�O�%��@}����d�G�`���t%�fD.]�%�"�J��c��d\�(�m�\�y�e����/��K�5��7�����
+yI�$Gs��]�ar��q��a\}2��D�����I��Q� ����'N�m���	#�;AD�P���Dcb�5"e�jh�X��?,�th�q&���Tn����줦�=�v��|�Z�# ��[�0;��V��R��-ȃ161�4�"	M��v��4l���
:�0fW�땗4l$�
�J�M�E��⟡�ɛ�vșՔ+%Bj�}��
������!�"{�T���߈�����Z�p�#G�%\�,
,q9}
�%t
+���A�NNL�P0`u��{��.~7!�_�Ϊ��e)�a��ĎJ�
�唸���
DnYʬ�ko�T)�}�`˜��1�j�+���E�P˶�.5Z1�
*���'6���&��37�ǁ��?�d��
 	骦���}����+��Ǝ
�9��6���~��,-E�#N���Iv^A8���q����ojC�n.���'_0�*�r���S����=�7H��b���v���!�~�`�If��t��j�Z�sk��_��:W���b�^�j�d�W,�΅�
s��F+��i8��.�oU��
<�o�!��ܵ
�@��U�)��
I���{��ĝ���S��c��)�0���Y.p�
��Pn.!��E
��<�)���
�e앙`������	[`2��-3erN\�M��KT֜
^���P-��-!�
+i�0��rF�!�����׭�{;�a(A��D��̌]�j�ڧ���<��]Z-�$ehFI�|2R]+
+����K� �y��b�|'_�<�:��L+xn�Þ���[�؛��e>���I3'_�����]������͓���T8ܶ�&��q �/��"f�D�����l��Ld�䑉�M�
�hj
��
+��/Ǐ�2��g
�rgb\�ð1
��#�V~�:����)�5R��K��Mr��c�Y֗��ntG�Υ?6�2m������9��5��u�O����U�"
��"���+QP[�%�+��v�rF~�{NZ�[o��s��>������s��S�#H8!��/�Ng���풝�n�=ͦ"��*
���ۘ
4���
+΃��WK�3ф{T>��-���滌��ec�+1�KE��
�N-�e���=�YUG����A�6�]���#�Yv�i>a��ނ�3٤FϏ�|���n�#�����ڦ�J��N�c�
�}u�E�K�I,��{�)�D$&������R�:J��;�dI���h��/�Xa p�l3����/N�h˃�-X��:�y�m�͖:SM%�9��/��y�4�Q�[Wr��;�9X�9{ܨ�Wh��޽�aۣ�tـ/�����A�����Êǁ���O��¹���
���
�����?+L
�l�0nT���5 '�jbz#0������vU��~���)'�:�����
=��ۊ���26�~�����u�9�N
�a<���{D��Zl�J�}v�QX���XG>//%�$����g:�F�|&��
�o���x9�;�����NƉ�L
�8Y~�VD}�M[�n�eR�xݟ}7ܚ`�	g�)�^��2�=_
Sz?��J��2Zi�ė3k�xhh�\=p�&W
�(!yK
����#K8�xү������5�{?��=X8ُ�)�IA�8���

��!/utR�{/��
=YKG���s�Úp�R5�B�	�[AS��
J𪲔o$
:#뭮1�!yW/Cl
ͯL��ɟky	
+C���2P�f��,<\b��S���Ϊ+ 3�8uώ�y[K����
VUSo$����
ئ/����ㄸ�S���i$�c��s����X����G�G
d_�����ݚ�,n��X[GU
+�t����ey�����vT�G]�G}
EI2V�:I�= &�4=���<�JZ|\�ߊ]}q�G�,a™O�UZY��+_���G��)i�C2+ސS��eљ���PY�o?�I*���N"cV
<�ȱ>})6�+m:�)?���_\��˱��G��
m�b
@#�q��ǝ���
r�+w��)
MDn$N@��
�9O����PDŽ��'H��X
�C

��(���IC^��_�L'�x̛4FI��C����8'�-�_��u��1��x��.+��<z�8��:e��9=�j�qs�!x�9v@��ަ�#��0�O�C��
R�����Ga3��y���c&"j:�,�
�*��]�%	jR$�z���)ό�
g`~.���i-�5sp��z^r�p�-�_��{�P#������[=�~T����qv����9�����z���V}ςҢ3��U���}+�.6��Z�Ԉ��|6
j/�Iw݁ې����+�zg�6�'2�9�����'
+���š[�o�	{o�Fͷ*"s�8��Mk�4L�-�,Vn�Q����D_>o
�j�6���s(K=WRI��\
Y��+Mϻ��
p�ͮ/���.�
B�����

�VРycQ�s[�8�)H�2���'%�9�=�8���}s�B�0i�IyX�y��Ca�`'�Z�@���c0fK5^f�#�z�'��/�)@�骮��X�j�Ѷ��[��C�ֆc��n����F�
+��
������:�,��
n�s!P\\Tل�U�H���R�N^�sV�����p�e��`SFڨ>���qQ-��
d)���a���Zu�/'��=k�^���KD���=@*8t �T��I�H(�}���HؾR8(N8��B
��tMاn��GH	ɨ���
��
�<z��nB�%�A)t1����m�T?dM5��)�a���1�/��|�V��8����Y�$�a�w at Q��ǰ���-Qŕ����dw�� ��em����F�N-�:�
+��8������,����Ys�v�gcZ�[	
�4_�Z����e��6~"I7�1���.+*���H�G����=��z���O���o
��_�>�G��,dT�
�n�&r�C��d��������
Qҙb����#�^�y����x�i�-)�Y���>�~(���r�Ծ{�L�TA��8?�4���6
x�����"���4Sd^=�#%{(�Q��
�i9��z�ఊ.�h?-�OqU�_�n>�\�͠ c����H9��}o�.�*<�����2죿s��%������yh ��h��#����s�S&�AW�Jr�p���Kl�͊o��شn�n^X�~	ZI
���۪���9C촼 b�df��.޸�[�ك�
�Om�R�7\BR���<'�A�����j���}��i,�#;a���| I=n�2w��s•U6ϤNA?6gV=���.���6~���
+�7sCU*z`����p;Bn��Z�bR�8���������G*�C�<�!�|���%I���y(��m�.[�]{���Ihn��bE�y���^܍�r?����c�׹!��O�J!�f�Y8��B��p���{鶀�#RO�� 弯�䊧�!ky�fr�w���C�Z(�ͱ���e
�4��8�������_y_
|�c���d��
���A5�.U��QJ4�Z+eZ
AS���6u�� ���"J����jZ�M���ϴ���׌K�2��
+�������6�h}��V؄�
9a�����;�^}=�kMaLMm��γ��ۜ�Ѻ�.S�n�ݸ� ��5����޹��R��8/cy\����94i�w���&#�3M"C
�md�hQ 
�����%K������9���7@���p=�h���f�����6�+���Ŭ���g\���W���a�#"��K#T\��:Wah�n_�����X=+�}�4Vv���!����
+����革	q��	wػq�F���e�ʸc��N�!��M��5?%���X��� kI�lk���
���Ćy`0�d����%��! g�es
U�`��"
I;�z6��:
�V|5�B�/�a�˲9���,�$ܐy��u>w���H�D
|���,�r[Y�/CRS�p�STi�f	Ew�n��Tńs`�Sd.z��;�٧j���"��k�'xK
>�}y�~"��4���
���e���S�
��q���Cyт�˙�&��Ƭ�_��6�<�^Ft�����[�n.����r{���N=8S=ؼݣ�'#O�N��{27��O�F�8G9�^W0V��[
+��^�Ni���G�߻�UPL�,�BĊ�Q~��±��T"�*����*��]�;qؑ���%Ei1t�V�	J�A����D��J�&Jx�]Ζ_�U�⛩�ۢ�P��7 v����R�AE���2�eO)���Q ]��}��Ӓ���hɥ0��s�`��1�Ӣw6�\*u��\�ߪ�-��́��
{����>
u���]�E<X.�/`yI"Vo^|���v�n�T�>��\�9=z�?@��+ȟ�7��#�ܝ��Vū�����S�+��^���J
��?���y�YQ�2ׇ��F%L�*.<�x���w�IZ�mrf�.d7�8�d٥�U�`��IH��df��S�b{�f{�b�η���iǠ�8����U���ZŤ�W!��tu�ei����D�+Dk���~
+���՞v4
��CLo�{�{�mT��$�tt�[P��U��U 
s�V{ox00�bש[�&�W�����(�
����K��[;��r��J�5	/u麏J^�|���~�������v��-���AF5����H9�
��5R��/u
���ۃ��DX�=խ�w�X��l�ށ���ڷ����[L �]N�/ �I}��� ���	�II�����3�m���/
ew��xi�tE;[^�Gݜhf%�R�t���s��yW��\�t�b�Ut�=�t��0�,�������L��
��.ƣg�S^s�J*�1hh�5-C��o�ƦI�$J��&S��7]
���CXO�FӓT�{]��	e,Mn(ps�7�c �Gs��j/z��6�3�ヾ��{ӧ
+���Vxo{p���n��c
�-
]�D����c?m;*��6��'��r�F'r��.y�T��D�bT��C��gJ��ɶY/��,���
�1����qђvq��|��4ΏS�d
Z�@^��������b�3�ڵ��:n��X=�3o�T|��x�s�I��q�b�d�׏!�
|1��^L
d^<Ϡ{�/�Fn�T����f[���>�������!�)A7�ɣ�
����1����1^&�g*]q���R�}{�0݅�"�,E6B���
���ӒV?_�L9�k��ݓC:R��f�7nq�N�����>
4~K'
��'�
=��,����y��tq��1������A_�z�Ό��
��sEƩe������.J����w7�e��Tr��ju�k�_���=�R
�8��CH��Y��9��qQW48/pa�]+m��>��SYh4��� �^%´S����4�a�y�G��{6�F���f�g��+ɵ�ԏ�k
�
�
۔Z��f�aU���?_��A�ʡ
;>���iJKȘ�����A�h~!}���O����~��べ�{��[�[�6a>�o�ʞ������ 6���h��h�^��ū�s>�X
+U��Ž��5�
+u_l��?�
�����ըm��Ùq�����r��°�c���o�u{G=��,Z� @w
+endstream
+endobj
+18124 0 obj <<
+/Type /FontDescriptor
+/FontName /XIUNZC+CMSY9
+/Flags 4
+/FontBBox [-29 -958 1146 777]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 43
+/XHeight 431
+/CharSet (/asteriskmath/circledivide/circleminus/circlemultiply/circleplus/greaterequal/lessequal/periodcentered)
+/FontFile 18123 0 R
+>> endobj
+18125 0 obj <<
+/Length1 1414
+/Length2 7012
+/Length3 0
+/Length 7971      
+/Filter /FlateDecode
+>>
+stream
+xڍtT���6!�
�<4CHwJ��R�0�3�
�RR"
+H�tJ�HKw*Jw~��{�y����}k�z��{_{�����6&
��r�+�2��/��/(h�	������� |66������	C�����
+�n|�`�
P
�9������q~~ ��/�7�*(��aր&/��"���^�0[;�M��_N  &���w: �u�A�p@���:�t��
}Ey����

+�,������
vB�"\m��x �Ѓ"���Pk�e@
��C��
0��!�
+�#lP
`W(p�p�A�p�M���
+�t��4 mg(�/��_ 
��� ��*�'�W!�w2A89��^0�-`s����(O �[��
���|�;����>:P���7
��CB\a�($/���#߯27׬�V at 89A�($���)�\���{���3\8���e�[���a���g���A��`n\����BQ�0??�(H�� PO�
߯^���A�_�~>�g���f����A�ݡ ��
���Z��5
����08���߸�6�7�w�yO�o�' �������Fa���׿�Ģ�e�g�������O�羠0p$����7/~������o���t�QQ
n� ��"qs{q��
�?k�����F�P����7���<��K�;����_U�W������

�9��?q�����F�n����D�l���FпZj
ss��
+|�#rp�������C*�<��:0��/-�=��
�08T������d���W�f� 7����~��7��ϾJp���
+��E ��+�
�F7�0�#p���P���x��M
+p���A����V >�_�?�0���m��
����f���
ۿ�

+��B����򐆓R��
�������"p�V����t�$O��EMʵ�~�:]$��_�8S�;�/��D�SOU6`�X����K�m"5�@�ԛ�[
+­m��k�>y
Ȏp���~
K[W�d�->�`���Q���c :
+�VTT�#�Q.��X�Lnd�I��';�3���iJg/Hx�k��
��r{c��Y� mC���6zu�!`�m�M���g�AC�SN+d��
�D�����j���m�j�"fg2���
�E<���V
�����?FN%�x

+s��PH)�tL�)�)�}K��Q�3
on�LJI���M����������F���x������Ʊ�p��
D�f7����1�D���d	z���+2�է"ˤJ�;�k���D
Ϸ�V�E��n}�����0ꍲP	��o�xS&t�`vcꟽ���G�e�V���W�$�CǞT0d2r�n���;��$�ٌ\֭0�>3�������(��N}阾c�|
zǰ��&.���o0�%�
�*�>�'��W��{A&�~syaG��!kb����u�\�9~�kƷ��t�d6�������
��e���X������+o@[��a��K����e,��R�86�V�{#��V��T��l�X}�9ʬ���6����� ��b�Uq����n���{��
*B�ؤ��t��9Y�nj���=GFo�ܺ����_J���v�w�����L�^S�"h6X"I:��M�	��8����
L��Cq��ڏ�tg���i�GN���D�p燖�$(���2��]��4Rד [...]
���D�[��[\��w���6e_8d�|a\��b��Qd��v��i���;W��<�m!>h�L)�F���e���^��Qi��,��
�iC�x�a��^��1Fհ���aAq�w�D��u�Ec��
s�
+�I\W2��V��uỤȋ�X2�Xn��
Ff�oi(�ߵM���w)�5�	�l�{�}�4E��Ĕ�n�j6�Y!Ƃ������d=}��A@��|d]0�hɬ���I��ν���B��v�⶷um_g��qPZ�/?�1ױ�+��e�.lH#_��2��ŴѲ�H}��_���y
����2�yƓ?�~�V-"",
#�H���9DC�#���7����ٝ�}X���Ɏ֫GRf���4��}�Kє��މ�3f�@�5�;���u��+���O&��LQk�y\^����o�G�m�
��n��̞qfS�1۳�8��P����rb�J�b���&�دHo���y>W�_ SX2s�,B
C*����
+3�3���^�@r��
弪����Й�U��S���؍y~��>
����V����E�#;^:tvH���|ZN{�1!T�d�$�a>�����ˆ�"�C�x���;_���	
H��"m�Ӝ2��Y�m<�h�������$�n�	�ц�v%���D}���_�
6�̓G���>��e?�UM�uK_�
+,ү�A<�3������\�.nZdG��$�U��)��
+sm�C���W�z/ �_�ʆ��d���V�t�sP�kdWف6���m�LJ�6���=S���ƀ/��R�������Ɯ�b�bAv�}�P!]q�n�W
��p�Q��q�ME�x2����+���΄Vt�Q@~-o�
,�����m�n�ks���V��%�[��n	Xv�D������#��&$�����
+�c��FB�o��V$���K��՜�}AF�N<��6Uj�
n���}F�~�K���kŧ��L�I�	��P�YK3��
�l��k��c$�=��X*Fǝk㾒_�Š*95�cV���eP;tN�;̣��WW ��a��'��wdA�]Jf�oWa��r��{$�Z`a`���9Y�vy� �-&�m^9�uQ�)�>T6�s������4�f��O�7\?��&M�?iJ
��4{c3f�M����n��$���P�l�i�,���K���8��~^J"���-�J��>8,t^�C���1�B�}K[)z�b�9.|��r%����g4�T57%�`���m[��V�Xa\l%1S�����k{�x�7`���jK�	e�h�����
^��W�3Qޓ-ǟ%m$���ddq�|E'��%8R8A:f�xK�㑲�|G�����E�wIK��8|� ��B�ƅѡ+��y��P�s����r��d��,����,�$8�ǂ@�ұ���"l�
�jnF����`�k��C�����AU_� [...]
+�S�ܣD���o��aj0f`��n���tʏ
+��ӧ�D��au\�j~��J�s����^�kH=.�:��v7�JC�+����H

*��b�ؘ�R��;&?�
�����x�忝Z�9]*G�Q�5s�(�<T�A��r�%�cI�T��1�GG��������how��/1��ܛ
�z\2��^@
�[����9��G��\�Y耨}���?rz��{�
�u������k�H0,KI}%����O�qO
�{�M�_Գ0�/zb(���b�x��u�k� �-��y��s���e��h4�U
�b��%�_���3����ǐ��Ux��lp��Q�s�L_��[��P�o�w
=�E^�?|$���"�@]��vw7��j

�^5k��
6�n�
x�
������J
\/Zh$Ɇ�
z�k}���S��6�����
����m{��#X3Ҟ�ɗ�Űkeu7@��*5�2_dcC�B�j�u���R�d����F�����EV"�<?'-<Q�{
�t�8)��q
D�U��8�
+枬
=n��z�Npy
���Tn[I�a�.�R�Q��HS�z<v�:>d����dA��Z6y�����;j�9
�[n	� SR6ZwFuiE�������t �s�_Xq��(��Ux�I`�^C��^��3��
��WG�o��5���W�3�-�
o+ڜ0-.H�F��N�c��_�&p6�=�l��W!�F�ߵH���P�C`˰·C[!�=N������nFuk��c��6룂a12�����
U�פw�(���j�P!c��.}�?�R��8@���|���|��>�b\j��|��2�tW�����E�)��%&-�)'*�� �=�&.-����Y�����LTrb�B��J]�#�������;t
�
��O�l>;_�+��ٽ�p��K���
5��
墷��C�g���O�p�rx�=
*e��K�p��ZD�F��+Y
�֬Ϫ�Ǔ���z�
hC��P����T�� !w;��7��[���"��K����
�Ƨjٍ�cF{r�2g
bxd
�C%<���
F��n�zj�[�
��
�b�9�C���w�����c��4/��:��H���U�T���8P�F�F�ß/����Yub�Њ]h-�`FW����Mװ��Ý�p&������J!��8�kD���!���ç
MIY�᠐��F
Q��:i����B���h�@u����f�fS"�;ѬɣS=��?�4��۔��"��X&Dѡ�=��	��eI�Z���������yXi	3��r�1X֒�4�+�w�
�Hhf�{��04��_V����OL��mz��Z��k��e
-Ar5k�3
��U�> �yH��2��
�
4�l�Y�
6�A\��� 
rB��%�q��bJC_�A
8}���)T��h�=	��(
9!���f{*�LrGv��!�eތ�4��0�]�
m�)z�|�+�U�i�� �Y&��%�в�]�^�9ᘃ`O�>#1~3ѐҿ�n�z�$%���Ȕ:� _�*����
+g��
����`s�b�~O
p�A�4�!��o:Qm�q
 Ƕ��V�\B�*c��T�����xo$c�+zS�=��itɅ)�T�6��P
:!�
�7Xc�–kuy�s�dz�~|;��]�O�Bߵծe�C�v5jcґ����-Z��9>Y�a�*�wS��R�����ƚ
��v�ǭ=�������Lj6Zl4?Ao���鸨��Jg�Z�״)���d�L�mY�g]qH��6O�C��k�a�ɡ^��X��x�;2Tdҝ0��kto]�M�b;�8�<%��ޞ)t���x�1�S�#��?�wzj�V�Ӭ��A,g��1�n(��I ���N��ʕ�������]�a'<���}/3U�Ks	-b/U�x,�9f��cרZ�mނ�����T�G��D�;>�^
+s�
+V�QCM�Hk�S$�V�
P8�&$f��_�o�
�5�Z}��3jA��M
�V,��5V=#O3��I��o
+��e�_r8hMT��yg%Nz��sj��0*ma�![Y���$n��6���ډ���ʊ[���%=��G�<�./�z�f17#�օ��
�p�ZV�P$C�f���>�%2�ļ�i�.�u�}�8Ǟ�FIO
��k�!��� ��
n�%ʭ&�ab��N1[�(a����� x�
m�,yݎ�^j��ܽ9�C)���?
Eb�l�sR��'���
+��`27�"diPK>��r�r��^��8
��d�H������ŦU�琍!�ƋX#2��lY�0���"�Й�����j�]I�
&#:���'9���@����:���c&�3ڻ���^��&p1��c��X%���8����#N�b�����?�
o��} lg;$�R���]�n&c���ɋlW��׭O3x>���	*W{�
*� �?X�~��s�}Tq��<:��!
�-zס�
+$�� ��ϙn���Z��zH���:��&v׆�VxԟK���$F�]�� �XNr� �d���)M���V�]/{�ɢ^��u>��)�
�|��
H�U)$P���[�P�:�A�� 2���g"Y�)��YJN��p�[Ѽz*+��ra�������uP��
_|u��2��a��H��E�9�)UVL7!�f��aʨD��dw����� QSh&6
��eN�?{�vT�r>*M�J�s��
��|�U��W���V�q�\ȑ���X�{�W��*�'�n�P)3<�L8�	�'�W��n�BM����
�{ZA9�Gk�{�mK��YV�\̼�I��	�T P���ϥ1��8M�6�e�^_ 
A�Ҷ��+4}�c �7u~p
��4�y���uT�*�QȭбQ��;z݋7�
���S�ir]Ѫ���/[���~ʞ�g���ζmu��x������k�|&(٦
^� �S�v] ��>D3��*%�D�V�fh���h�@��ƅ�ں/�^|c[�I5���JP��}��6��k�A�s�QE���2�����h�oȤ�UG6�� 
�Z�T
+;��0�ud���JHumy8�`�crQ9��D�ǚv�_:)
�8��8Zɰ���_u�CÇ�`o&h(/6]	J�H�N�n�MM��)�me&�ky}��G��r\�8=���=�A� �
;v[|'@�f1�w~��8u�\Ee�Exhi��|��V�}d�ѷ=�[��WJ�V�6�=�\>��U6T�sGO9
o��	}3�
+���޼.F?J�pDF��yP�bhud
�
����!]7E1����y����g��/�(�>��7K��������_k����=1�$��&�4�*
ЗiE{�1�5%c�gȯ���"_�ˎo��L�q�9�x�L(���|� ����`�X�l�ۂJ��
{aI�BG��0KW�i�����Д��#Rq��ift��z?�;�Ƈ�E)f2>,
����Õrfc���\��+=�
�=��B= �+��r� ߈�b�w>L��Ԁ��{q^6�Ҕ̞z`"�?����K�Z0�H���,}�Uc*�����F�#�V��-~����5G��7*+���_�
���X
�$�
v�j(=�Aw^���ȹ�Em�dJ:���Ho���Q�dؚ�x�: �w�4aN�d���j��
Ln�*=Og#}8����p,�����������w,5_ߡA�`��
Ė�wF�o�.@����Ϊ;�\�ǟr��Ț�
e����}-���p^1}#�~e`�"�dlp/~8���a�6�[��U�N4�������ھf��k���{��$�4�����0�
���5���U������1�jͦ�R��c��\Ȗ
CN*��R�ĕw�W�*�u+�7n
+��Zas��c������ڨ-1!�Ջ͊�V;�T��f;���ճ�
����u/a���� �1!7��=KOt`����L��~�y�}9�\�-
c�����¤���rd��	��1*}�[9*�
]Tޮd��M�~�Nc��	v��
C-f
pF�?
��=f���"࿛���S��CR\Yk�x�6�'�ۼ�q
���v_<��۹�bH����l�5��?
+��m}/Z\�	�|Z��d�L��h�ѤȆ��)���c���`��f�1OR�g�
h^����~o��6E��?A�C�t���0P�H��Wl
=�
+���3�w����z
iL;k0:p(���i�?�i���d�Id��+m�C;�X����Q����O�
"E��=����W$s����
¤�h��ܭL�DE��ha�{��
��VWķ�zl��%
~�H�>�=��3��q�I3�Ŕg�y�K��_p��|;Zo%�
�M�}k'SԢ�M�Hī�C8�����D��:?���Z�cg�3�K���
)��	�|m�ڱ��F���"
��*�����R�\?NC;�s��R��K�|%(Jy����k�6a��g�>�����a,�5D`F�V��{���\J��cm�}Qx�3�X�_1Y�0Iz��ݙ,3*?^����g7��-�:��c��P�A��ա4
��F�Ahy��7�Դ~�����I�A���t�B"w^
+��\P��~��.h��<�MoC���Ɗ�0C�k��>��t�b�PN�IS�B��%9m&��.�(���� n-8aմC���{�=5
��o?$����_*��ʹ�8u��Dn,�DK��I\|2�#�C7�Y����h�^
=6z�s[>'TZn�Y�Z���WĖ3�*�O�M&r�01����y
+endstream
+endobj
+18126 0 obj <<
+/Type /FontDescriptor
+/FontName /KNYRWO+CMTI10
+/Flags 4
+/FontBBox [-35 -250 1124 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 68
+/XHeight 431
+/CharSet (/p/s)
+/FontFile 18125 0 R
+>> endobj
+18127 0 obj <<
+/Length1 1481
+/Length2 7969
+/Length3 0
+/Length 8957      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T��6Nw7�� �ݒ�

H,�K-,K.�J� %҈��(ݍ���4R��������?��Ξ��33����=�<�Lz��
+`�
D����(i�� a>!<VV �
�Ǐ�j
�{@a�R��P�C@�{��
�
shx:��bR��R !��0��	�

+h�4`�<V%��/
j���+�Ö ())��'
���CmA� m��r���
0��B!��*�!�@�I��{{{�\<�`p{YN
�7� 0�x@�^0�7e���75><V ���W�f���!�{�3���q���
+������Z ]7��_`�� <��/ �'��rg�.u��
������\}��� ;�3����A� @���@���>��:�l���(�@�
���a
��!<�<�ο9��.s�ʮ`%��
����|O�p�������=\'W��+���
+��M���o�
+u���?�s�����
� �
+H
 � �����@_7ȟ��o�=� ��
`wO �����!=@^ �		@�g�-<AA j� �@졮x��~���e����
��O ����7�{��a�ξ���1�������ߔ�TT�� ��" ^!aa���8 at LR
��U�����z ��g��z�v0��_���^�����w
ؽ�! ���������C��y����)�w������D*����
�?q�
���oĽ�=���
������@�Zgm���Qu�~C\��u�P��E�:�Q�?c���
u���<���7 ^A���ݯ����7��~XB�����ʮ�0�����p�/�����DEH��
C|�H���
+Cܧ �� �`p��#��?��oS���o�^����0E ���0� ���B ~��0�s}���ub[O8�~�����?��/����6��w�	�|�^�Λwm��8�I'/����%v*gUv�"�T!���d~U��D~����X�
�)Y�����*�`l�	of��{�pG���!.=/P~�����8�	��E�5��S�H���ܻSէ��ln0rjM�JL���+o�Qܳ��	�|�ד4�Xއ8\d>�'��d�#w���x���o�fKB/.&�*�B
��,�f4�O��ؐ��i��Ȓ�����9�|(��]��-L?�̵�ɨ���$UY�j�C�v�f�Z�qո�M�p�y{���~,�\��=��s���^b��"ח�a���h���1��7�[��[��oP\xr�
@��E�.��_�U�R��p
�u�Y�1��]���I��]��ILB^��8k_�I5��3�*�&�gm��}��*Fs|��"?��2$4������}�SF��Em�
 [...]
+�!݄>F�"FMԔvUƬ��p�0?�+��Ny���0[^�:~�����)a��4b7'��h
��lV*����*�v9{�L��Z��C	2��z�[�_V�}|R�b>Hߑ�������A��6��~�ު�����'��[(Yld�k�&��%�"�.�[:�@'S�|V7��y�j��
�������/�Ƶƹ|\>NR���K��ݝ'䃯�W$��!����ɗo�n�����jv��;/6P����^s�%���r��d>�:v���Ppp���`a���������>��@u�ȷ��T at q�y�+]=�>�
	qj���ȧ�9�5I�9�]�OO��=�?��ir�KPT�\��c��.�w��/"`���91)r�i�K�m��#�U��k���ѯ}�i�o���
�3c>�d/�r}{����~k
�Ћ ��z.B�
�wX�����hl��t'Ύ뢜�I}!�d��^���"+[t��� n��{��m�;P��t��^RNZԱ� ?ʨ{���Q��계F���H [...]
+H�
%
�8�ȳ&[8�Z
�>�^ ��0�E/q<�(7l\?-�g�2VQ¿�{�	�c�fۥG�s�hvI�)�B�4%
Z|ԺxɽV��'D|�D��^�}�t
��8���,�n3`��Γ�v��M~�)ѵ����zf֩z����9���S=����|�f�5�GG�Æ�
����F������B�v>P�'�W #�D��H�G*<��^}h- %ȩ�%�';�&C!+��:[�q5+�╫���zF�1���W�����n�,��](�7�_���%4�#���b� ~�*��㷬U�V4�u�Z�o���{:�(�qJ�Q�FXs�ö�m�༫$
�^g�
�q�o�'``s�!��
��o�������?UW�n��P��v	w3��\'�
��E|0��?�
��jt랹����^L5ɠw�����
��O���^�w
+��t8��ƝC��{�K��o(�3�Å�K/^v��
F�@-đ_DVi�}'�83�d%'[�t�
���
+��\Dd����Mp�6#�;I�ܩ	�w˞�"���K�0Z��!�����-"�������v���r�O�<{}�Tm����M��"2a<���o���4�ؒv8���<��[��l�邿�i����L��>���h��쮸Ѯ�V�P��r�4�(׏:ģ�Âq�6�L�w��b�|�3�'(����▼�%'��U%�k�]\$,	!lo�a���_!��[��Wؚ���)���7�+0.4_,Ƀ�@|���l�6d��)SQ���M[#������o���1ȿ�KݨlkT�1���Y���b��
;�ʹ�
�&�
F�I�L&��o|o֊��
�DK���bЌ�~wr�or�:�4%��e&J�ڦO�m�N��Jq�aJÀU̜��S�);~��Ś]���
���g�6y��£n��` �
}
3�
�,��i1[�As�r��E��V�vd'������ %�"��.�4-����@t���A[�+�� ���E1ʆ���EA�5芸��
K�H5�}]-`�Tk��k8詿	k�Z8z|�^�n��cհ`H�/����wN|�Ulأ_��XC�M�z�d_���
P[nS�7S?���0��e�N9]�Q�
��S
�����L���k�2��P�b���a,�<A&9�%�e�ƴ5*�#��%*9�Ʊ�T�����߫\�JD �с3���.�#�eNx�n��׉�ga��Mnl.ԧζ{�>G�oݠ'$R���"{I�r��J�'�P�p��y�B�fʲa�Y�^y2�I3-�C�גJj�n at f1�����s��ho���
����k[�/Ϧ�EKg-tso);��
+�������EZ&
�Z��V�`�"�O�{�W Ԓ��J7#ӀT]�Q��
�

+ߏ
��0-8a0�]�
+v��yW �I�W,�e�%�Q@�����g���U�U��j�P�L��
`[(�����
5f���Ï��Wjmd�PW�)+BÍw�V$��X�xtY��M�*Qb��@���|ty]�B���'q�5@�z7�IYP��S�*1�;n@?��G�
�o�pgNM�X_|̺�(���:B���$�54RG��~�6v�(�&O�ҩ���Yױ%�˃w����u�&���
�ړ�鱜e�i�ږ��4M��$�v[�n���4���ȵ�z�ș��l��ۈ����lF�s�u_��e����EM�4G
��
Z���
���E'�<�B�N�)����V>�:�/x���J�ɏ��#	`qN
MY���j��U_l���G&Xb����C4>�vt�_/��5Ǧ�ç�[��
_����>��C�6��Կ
�uҳ�	�A��ȯn�8/�[U�d
+'�}�5(c�y�Z�˟���R��¦��%�V��s���mt��+�>3�ɓ�-�2�^l��X�rǻk'r5��D��7�I�o�ѺҨ|d��H��'�]<_G�]�n�*�m��H'_�Z	�����a�щl1�|HUX3Z�}�LDDX
+��Ha���B��ob�q�=����'�
5,��x���n	J<�����Α�f��b�b֖�b��ݚ^q��Q���-�0�@��,9����eO���+�e�uoY�;&�����o#� Q����A촿@f� �
���S�
��a�`�W�4f}�o�a�,��I���g���'%��u�E��2#
���.�DU[��!$V	�aK|:F+\p:�s9�� {o�7֝�*��AM��J��
-s[����i��3��{�HH��^i�B?���^��:��y�EW4O���Bƾ�� #��T�����\�@��c
�֍N��~�<����z& �b`�U�]���#���HIw���y�uP�򴮚p��œ�֚,(�
�Yd:yR���\�ޖ��U%JQ���)[B���΀����
�Σ|�i����W�..���椕+���;-���+
���WG5 
��`��<�+^�x���M\�AtRCw��
+�=+9
+7#���Y?�0	��(��I20�f�����@P�pthtn��
eք}nQ�����"+nD�`���r��|�6l�}^by��
��@i�����q�Y�'��KrǾ�R
+4�/�V]��4��4�o�Z\:
��o.�
�z�
��
����`4�����;�
fr����y5^Ý�!_��g��(�`��T�Mm4EIr����!�!��z�*u��� ��^ղ���6��Go
�2Xs��-uے�iē�d��),rv
�
鳯H����mFo_g��p# ��'��>�*�ISX�ɀT
+O�����*�
+�����aR�dh�'�v�c�F�7�����6
+L�^�1h�4� 
�+��U�Rs��a�D?�eS�S�Cz��
���-��;
+��b�R]���.i�\���
�J�7r�9&k��ғ������R���?�lj^
{��"�8�hl#��.���
+{��	���Em�w.�d���Z�im"Br3��z:�+�q�OŽf-�82q����.���*塄}�:*ˉ*O�ݠ��o��vQ6u�
�m�<��_i��ė5�$���pF��'@��0�P�OzF{�i6��
	�ɔ=�|�m�SF[��O!�y
A4	-{���q����d\T��}�$e����~>��
W� 0� �ST6�MNx
�}�l��3�49y9��WB�v���������a�j��ѵ�^~�Y]a��o�"/�Kz!�6g��ʍ٫@>�
�\�CT�=��M���kJJ��ߥ�|e�����6Tz������o?����Մ�
o� �{Q���ڤ�꼲�T�)�{(�Q�G�d�{l��/�#
UF��_,~��jR$E�.���W1qGj��zf��7�Vz�ڰ����v5�u�(~З�ֆ}�ˋD�^���.;q=S�3͓K�W��j��g��,A� ���;c
���v�*&�^����\"p9��;�W����Q, at p��ɧ'��&y�>+�Ơ��R�>��}nj]�a�a�X���P<�~�E.A�$��w4�C���٢�}Vѳ��eӒR��I�B��4���]nj�a�'�
	'�M��'4�?�#=(g�,%^G5����O?�Ğ��N�{c�ͭ��v
#�߽�M-�*aב�&֎f��V��Ë�gG�8^�_��
*�
1%xa]�BpV=�
�?��/e��X����t>0s��Q�%��

�x[m�=�*��
x̲kp�p�[;_q�Y�ˎ��!e�X&\j'���T/%��� �K���,D�[� '��e"
+�4NӋ����
h��p�������(���\����7_�U��v	
�<Ap��C@�T�x���u�G��L������E�A���(�K�!�ô��7
(��p��4�!��6����,�[�eS�ƻ 
�4�����oV�sHO��
+�L�
�)�ug���l����nO�^R
+
�j���f^-:�z� �<g���o[�Gu�w/�����
+1���t!�{�
�y�an[U���I����IU!��n�h�=�"��ߎ��3�h�
+�f����D �M�[����WV6K\xAvc�N at x?��3۬L�Z�Q�k���jD����~.~��Ra���k��n�KFY1�B4;8��-�1�7�"8�@��q��-Hd���Y��V��Tj�~0b��RT�0�
�p\�S%*���^� rZ���C#�2�l�:��`R��
{�7?4+鬘F�f���m;}����
+���
Yb�	[�ea�v$�$��3�M�������5��U���V���>ѨJ�\t[{皎��-���v�
/(��:�fo�<�'Dn
�ڐ~�N)���;c��h^�W�̐�����7�l�ɒyI�
�J� ��H�
e�F"���v
*�����p@��	S3SE8��|��)2S/%���H�� �)�W{{�5��V�y�F���oN2̌c3
�Y�'@
�JxW�oאۤպp��όW6��nS����щd�a���'�ɲY�zaK[C�_;��>WN��ȣ�
����>�m24N��+h
í�\MZ�_�m�Zn�fO�����t^
^O

i����
)4t�4��lxL�'�FyM�W\�ڞ�.�̧�S{I����\��
���9��]��J�<��G��d�M�)��>������!.����S�
�|;	�e�
z�T�N��Lj��k�_��4�
�!g�=gs2Y!����-��Z��~
p����${D��v��J��}N\Q�W9?&��[5՜�?G��KD�e���Iy��:_�L�:�'�46�UUטW�n}E*T��3�uyU��8�у�a�rI��*p�2}��&/֍�T�J������u�-��z�*lZ��Xz�f�2�d�ܖ���d�>ț�3���}LH�Q�klvJsG��eͰ�ES [...]
0�� $go�0���1�YBN��K2J�J��q�y��|=�!���$���j���prX�H�:�����Ѫ������?���
f$C��{�;�H� �����,/���T���
+/8��c�MnZ��*e�|��5z�*V�������}�ު^��Ļ0�Yz�~�0�����C5��S��ȓ��
+��!b/1�|ތ�H%��B^s���a&�=}�$-��c
J,Ls�#y,~���`�Hȱķ�U��J-4��	D=���,0�f�W7'���
�A�1���&����bG�X��iu��jg��
+�ZE��_�fya�g���MﭴBQN=~���Y&��D�><pb-�Tղ`eg+FO�
y� p��YWn�CF�EG�>�w��vu�
+'�I��U�̉��ȇ���pK�za�7�T1� ��e8l]KM�i�#N7�h�Fs�*j$��锥���]yKCO^�����>)�<���􇩥��uܥ�����1B�*��OO[�+�5P���`�����7��"2LK
DMf(�QUyO��w�I�X��acU��+�ў�zi�m�!�4��/�C���D�������1����씹����3qD2�x���K����Pv]���6��ۭd�7��R���$jʼ;k� 2BL+fWӲ���;zK�9<m�÷�A~��
+_uFi1Ƽ*�dt�m��2s���]\5���(��'��DҮ8��e�S���z�q�ß:�a�Y1��3ǚ
��U,~w���VE�]�)}� ���c��{pO�s\��pĶ
+�BI���7:�B
��d�
�
+�X+U��)��wd��Q���D�����3-6���
�'
+�
ǿ
`X/�KT�4;�E#���\�������{"��hm����f�,�U'�Q�|"ju۫��d�s��,#&p� |�@X^����V��ͤ#l��I:0S�*����qG�
+
�߱B&uCUq�2�-3Q˨���.�Za�=�R,됻���C�|�i��T�N6�[�����Ϭ��������m9�#d���Jaӱ+%�
+��1KќWV]:ۃ������E��2z�9��!��%��
��F
���.Yr�0�>��y��P���	�\�Β<儧c��`3X�
RЊ
������
�1/-
+�Jh�`*\m��x�ߢݾ��H� f�4�C�v�~�'�,9�,�P����M,�ɏ.MU�#a<��*�7|:}�}V��9��������N����Ψޱ�vB�q? \��kIj�c��g~$׽?�J/L��<��͋��D"%��K���^���e�l�=/�<u\
E��$�s�f&tk�����﷈E8@�'E�;d������e����Q��o5���I
R�oDK��=���~�o��wcp�+
~
z� #��*����#��!�=5�����%
�{ݤ�<	�#9���@�����d%
+endstream
+endobj
+18128 0 obj <<
+/Type /FontDescriptor
+/FontName /BKKFBC+CMTT10
+/Flags 4
+/FontBBox [-4 -233 537 696]
+/Ascent 611
+/CapHeight 611
+/Descent -222
+/ItalicAngle 0
+/StemV 69
+/XHeight 431
+/CharSet (/e/l/o/r/t/x/y)
+/FontFile 18127 0 R
+>> endobj
+18129 0 obj <<
+/Length1 1503
+/Length2 2523
+/Length3 0
+/Length 3465      
+/Filter /FlateDecode
+>>
+stream
+xڍT	8T��&e��-G��a��
��ʚD���2��a�
f3Y�PLY��R*J+�V��R>�,iO%�"���i���������3�~��y��~��9z:n�h
��#�ЈhL�6.

� �lL �0zz
��
N�1z�@� B`�/>��1[�� 0���d�hB%�R	�D �}'"|*`�
�8��1��� �g�����]��+�e D33S�T9@�|�̈́�0 �+��\`#†@���X� �0��LJ��3yc��� �C� �
��0�L
+\�<�2c�
� 	��7"~�p&� b�� ��9 @6:8�A���L�
@4&�h7]=�����l6�
f�b�� .��w6��8�	s&�L� A�aL��d����3{���
+��'`�`��X q'%�'۠�lsl
�����l!>�F�]��v�A0GL?��M���=a($t����!�Ϙ?((a� �! (b�'�{����$q2�*��F�?T���&B�
!?���5�;�� b
������0��
��χD�7�
 L�~����� 0W��>u���47G;�o�䬭aD�Hd@YIL�̀�ߛ���]�Tԍ	Mo��� f��G�]Eش)��c ���+�:�?�� Pl�A���?U���~��3��7d��N��S���f� �x��9T��
���o��m�]@��w�A�D���s
#$��D �
�������\�4����¿r贱�Я� ������+��l�39u$�	���b
5�B"��xr@є��1�� U�!|��N���LƦ!���@3 ��	�(��d�H����� ��
4�?!	m%����a����O�
O}R at P�1
��<.�8��"�v�ѫz��95�F佺�4��l���OΕ��n����?S�%��z9��N��42KBU�()���z��lT]��W�
Jz�TQ�/���^q�>b�l��
~� ��Z
�+c��_�3�=�~�Dn��U��3��i����i�-�
t���3ٿ
Ϫ�G���yx'
=�����4�ݳfw����o#Ь�Ui�`";R�e	���g�/��L�����K�T���c)���v���¦̤�y� ��G'��^��
����W��,�z����U΅su{�I�~~bm�5� �Ȓ
g��#i
�
��,��8T/M��0�Iz�y�
����m�a�􃏟u�MOd�)�'��0L�6�7
��e>��v�Ƕ�.qcϘ���PfBr"WB�˰�f
�(���~͌�����,�_{�=�B���US�k響��=+�Ky�M�A���(�"e�Z%??lqG
�:d�mi|�z��2��¢�������ix���
�Y��,j��յ�M)��j���l���2��^�W�ӑa �VbH��L��s�A��K��ػGr2�+�Ǝ����rcn���G�>�O�5Rz��E+�j��+��
s���������m[��x��v8�����"Ƿ�
��-SfXb�������r��l�R�tU�^Al���N᫪B\ov��aE���
֝���Q}�+Q�٭�
ޭm�t�S�K,
�T��ѵZ{?��n�y^�.�j�$��d��?�����_�Ƽ�?�jB��w�na���JM-��~�U�5��$vh���ҫҸ댉B�a�YC���`����A�y�R•맩w�L��g�C\�q�D]���ze'w:��7ٗ4�� Ke��H��4Ho?�n0�E�}Bc|i��-��ŨY�e6���	u1�Z�}���DGf3�
ᑥyI��#^+�K�k��Uw%ŝ�n���_���5�����ϴ��s��|y�u�\ⱪ�:��m|	j)�Ew��x
+��B��
�4����cd���k%i1�#9�$�A��w�p
����t�19�٩���%�j���^��د�y�U����5r�0(]#^���f6W��~Y����2��q��ѓ�Hm��	�9Av
��8��"ل�J֑�9�����
VS��
��J̪]>~U�幜��)����duP�T�v��R
+�&n3(k��jH��u�u��
ܓ�)��T����Z�ޜ`p�&�ȧj�[a�ވԡ���]��Y����\�'��NKj���{��]a�l����������&��Wm�
+Z}w�=�� ʡG�Z^:z�w�%�[��b}����a��yy�f��Ie�S��׋��џ��<>�?bɊ�Yd&i(&_&o۶*]�e�g�R.|3�1w6����s|l����������-��
+.Y��v}<
�%���{�)t9^{��nߴr-��a)��C��j
c�,/���$�55
/H�U�Fc�
�ؔ�8'��i
��E&q
էT��5��])�> &�͙�Vq�/�����~��������r���*R����_��Y��Y�]h�q~�;#��_���T��
����s�w�R���Ɇ�������y/7�/0�X�A�f��6�o�q�8�͜��+�������B��:Hq�8��{�����}�rb��;
�g8����'�kv_�wy)
\�~�G�p
+�
�}o�ǖ���}������k^���k�KR���"�:�Z���#��5kL#<wz|�8SM{T�z,�!e�W��'���*��z��>ٛq�ؤ�Р��m��0��=������53
#�Y�7Z��9cO)�0y���������\l�l�KY��S8�
c8kX�5�˺ögc�Z��n����E�
������i�O�
J�p'`Ge��ۘ�1b������8�����o�UTA$͑��
ԃS���1�$��u΀�̘E�/�Y2񵷎)�S4<���uVi[�����n{JRU}V�[�"�Y���uy����#�z�u)�T��4-��Nϑ��]z�j��&Pj��g��5+p/�ݿ^7^U
� ��d;v�e{�D��{�1�=�N/K�=J8�ž�Ԯ�y��p�N�6�q�bً���o�oe�r�:�	l=n]h;��)��pu��9���������=&�
ߒRncW<<�is�K�^���0��<-��a�9G�Ԑ�s=�ߠ�p惷�a�.L�EC�޴�M����kvsSo|f|����

��[����M2&�Ҷ��X�?ci��}�Zv]�疞��
+�*�
WU���ʒ+�]�$�T��J1���(�>7#{��L�釧�qJ�
�
�R!q�L����\柂�����=]�`a7Ʀ�5�[�.��9���J������|�iz�;�!�>�.Q����TU���PUI�&Һz�H��ر���=�6
;ev*�iu���e��s;�������ҭ��ij��hq�8�t9B�=��ycS���hx�A;Wǭ֩u�^߮#�4߰�b��]r��I��e���~��:s'R��N��ž=��\���E�}��[��e���΂����F�*Ҹc�x���t̾
+endstream
+endobj
+18130 0 obj <<
+/Type /FontDescriptor
+/FontName /SIAPJE+CMTT8
+/Flags 4
+/FontBBox [-5 -232 545 699]
+/Ascent 611
+/CapHeight 611
+/Descent -222
+/ItalicAngle 0
+/StemV 76
+/XHeight 431
+/CharSet (/d/e/m/n/o/p/r/u/x)
+/FontFile 18129 0 R
+>> endobj
+18131 0 obj <<
+/Length1 1431
+/Length2 6799
+/Length3 0
+/Length 7755      
+/Filter /FlateDecode
+>>
+stream
+xڍtTZ�6!]� ��
��4�)R��
00����p�n�.	�I��[:%DE����������}k֚���g�s�}�}�Xt�y��K�2���J4��4�  P�$dc3��a��pB�'$
+��K�C	�o0E�'�9� B QI1I  J�ED %� (��PC�!(B6��;jc�����a�	������s� �V 8@���8��h��VP��_%8�m�hGI~~WWW>��������BѶ =
+�t��?%�@����� �Pԟ}�5��� n �
+Gݤ8��$�fw��c
��#�'Y�O�ws |������+de�pp�ݡp�5h+k���< 
����7� ��!�::�,�
 �(��e��:�Q|((�F��enڬ+ 

 p4�����H��M���_�=
�
+��ke
���� ;;�¡NΐNJ�97�?�


+	H�
  N ���-��

�
!����
ޞ�G���
�7�r�C��@ h�3���?�^
+ �P+4�b��S��X����$�
`
+���  ����?���p��?�_W�o�D�PQ���促��7��8�WX�ƮBB �_��]���%����>�|
�F ���pӼ�t��6����{-č�! ��oZ�|	��g�W����?������);�`��
��8�
+s����
� ��`�s�5!`���G�A7�!����>(J��@�V�z����*����#("
+ !� wB�AED �7C����&���@ߤ 
��� k�����o�������7�_��7���fA�	�QN�7O�����
CC
o��w�_G�o���o�Dތ�/��h�k��
�@� V��3+� �ꀖ�J9Wޭ���l[F/9y=瑭��x���/V��r���n��P�8y��|��T��&^����E���V3��M��}��������������c7a���e;9����R��v���t/�l�nW��}/��4�0�+�b˱̘����潋�E�ɍl��t�"k�Y-���� R(��dU0�|�c��@�A�JoBw��bh��S~7I�vֳ(�}Ϝ[#ʮ�x�
+�7��R��ҟ�b
I4�:"�X�ک��$�A�`�J�δ�F���K�
����D�jy���`��������8��z4P�i"x��;dNa7oNޗK�8����$i���p	��7nw�s>��̞v]xћ�|�$#�H�_����q�سzy;&4�L}��lI���x�GD"�VM��`�
sv��dp��JN�qU��z5�hUH�d_����1�F�9�$���]]���Pn�f�!�����q�����
+ho-�
:���n���t�M\�nl���a��P���~ɇ�k�5�b�C��v����3�CR�Dѭ�i�H��5Gr�y�pַ��~�<��h���|�}zut�v����9dM�����As1�~
X�[a���oMr��X��#!Ӕl�͉��}p���|Ƴ.x�=�/|ϋjL��Qi

��>^-.B�ě�FV�#%�%����)=
��׼�g�S��m�϶�
��Q�fωA?�g����q"�!����t�7$1�������x�,�ߏ���a�vӅ��G�Ld�G}�:qE�(�_Y�IK���!
�
�c��#�3b���$���
+�F�4>4���A��.D���խ�XR,
��ᤡ
�@&
.39���(��
��Xt}�;�j^8�PY6y�Z
� }
w��N��>�x��sNʹ~-��q}aޮ��il��*���V���G-3_h�E���q��#�
ܟ�-�����N:ޱ%�{���v~��G�
+&Ҿ5-��(fO����'�·/B�����'�չ�����7�ُ�����}�	��8gI[[��,��n�ȩ��Pf���:�1De��S��=�\��Uu��F�U��d�
��L훒����ۘ.�|V�7
G��5������)�4#M.o��罏L+��oϝ����c\W
�0I��0�m˜�U#��|8��^
+���@�߄��UIV��N
+}j��nZ�f�XE`�#��m�E���i����"���ߵ2?8�0�CQX���n�
+�
D!��	{�(;��4-e�9�a��<���<ɕh��4u��ǵ�GV��-�&���
+S7��l�Q����
pu��un�_+��͡!�
��qs�rNM���L+�<�o��=�9v��Da�=+.��f��1�)��#H�3�*n��]�U�����a�|wL�8���<A-�hSB_V��t
�Y���w�N��ռЬ��yo���
������W��	�ר���C�ԂA�0
�<�fqɊ4�ڬkO
�'
򍯊��g�y���w1}.��YZ$�t>7�����~ER�=�ˮ�
^5�
�J���0c�CRq]�����繒�
�w�y��':�"�5�R\��*sigk��_r�))9B<<*�G_'��1�����p��	,��)�u˫�ϛ����7ryeP_L��M��V=X
�
��
�K�5�x����O�����"*CK�w5�^Z�66���1�����h4��5�]�ׂ� �
�<�C}[��{}
h�h�|�&����S�Y�f�l�3�)�%
x$w�h�O-�.S�hB�b|VM'�6��sWQ����;�-�%�	�w��#�)^|o#�kY
Hef���������K�Ir�rO�e{� ;����Geũ
��])��"���p1�B�r�\���No��~�I���،�<H���7I
�~�zD�i2+ 2wlH8��R����������q��}���f��l_�@F_��#�yh��FK��{�
��Bw4��8ZC>����#���?p%����(�����U*��#qR
�R@���k9��*q����p�M�

�5��@�d�e
�X*"�k�}�����U�z� 8w���D�^�9��V���	�C!J�T>���
+'�40}�.�A�PƆ����
:����u��a[݈pǶ�mȝ��L
��a��[.�T�<s�cg�=Xy�
�����uU�ֆ̴x��K��q/D[ȵ_��9��N�pL��LD�mh$��5�6�q�<�
��:

w���rl�?��0��4_$�
��4$E�IT�w�!�X}�n�A�ܼ�}����I�%TY}��i���`�0�
-��n��qD��b��6E�;�ډQ �q��ޘO at b����⚙[�3hG����+� J~�O(p�a��Y�ד�l��yxט�!�K��LK�1R!P��qK��X�Y��)ϲ=� �V`e�^��4�l	�
�|fm��vx�@V��	k��e]w��q ,��(���e�p&~�t�s�[��T*��^)�׃P�N	PL�� �3{�w���^�VV��zҜ$�>�bΆ�
M��
�]b��i�uHW�ھR�{��x��^qt���W��.�-�`
S�;��������Xd6�L;�$��a#1�

�wG����/?)�Yg�O=(�B��Zk���%Gfq7d���V^ݝY���N_�|����&뿇�nZ*T��b�`"u/���l(�?4�p���#�u;V��c����S��e|5	ZY��O�!z���t�Cce۟w�X�_
�0��3 [...]
�V����9
+�T2:9��N�%O�e��$+y[Z
�P�j�S�)Fk��cw�)b�V!gӰeSX�Wz,� t�j��
V��S3�HyZ��l%�߼xy]�k��y5ݦz�.��d5z�
0�'R�J?������h.yC�)Ew7���r�ț��37�g.���
��d	����y���$Q�cU�YU��"���
!ᴕ�/O:��o�*��W?����SY߮�G�*�5��1Zf�%׉�8��|��I���H?�!J��y���8T`���v:�E��G|D��N��L���z>�T�э�<�>yn�+����P?�o^�X��QŠߋ����шM�B��[���	����÷��rkץ�l�lw7�HI��� �͔Q��_��ZS1��ӭ��L���"��K	���yX��b���]�Љp$�٨�۽�9��!��B��C@)�M��>���B�u�U���#QY�%���j��A@���1����}��q��Vih�ք���v�pL
�����u�;a�5˗�<'�Y�1cK���`��c��k�Ac~�
+~Vfʶ+�)+b���˂�J/�
���@O6���ֻ�#���	�A�a�'N�a,|&�%�8�D(K]7���r
QX�dz�!R4Q�� ��d����U^c0O�_�i9�y�w%�r��S�@<���S�R�mj�
���%*҂�w�X�.
J-�>��P5���Mkh0���ſ]-�g��m=r�a. ����3��
��	�/eun���*Q�1�:�L�hN9������Cl.�5|$nO#�51v��[��=&Rg͖�@���>���e[}x<��
��iY���D����'Ѯ$���HtZ`�v;�Zdl �4�[��Th}lܻ2&�rA
ݽH��g��"��|w'�kA��׸�W&�Bm�{�QNx� ��b��u���9{�, at l�(��L3�W��E����K�tbn��x4���Pj�!/�
K�LW��A�_;KcP&2Ltx[�9>��#zwV�)`��-�_r�:f༔9
;�-챪W�ۢN,E
+~^������|��s��[���v���"�e<����
�={)�iI�}�=<���(�2��"��U`Aؠ���{
�(��7�:����sQ^f癝��
+���H�6�X�������>}
:�]S/��V��V�[۵gx6C��&>�M
��S�C�>�cg�� ��Z��
+§����j))PPoυAS���w���9�Z3h?N}aq�G�m�ϥ����H0FLP8��/�l%��
�
i�cx�t�baq���r?;�P��H��s"�N�Nᔰ3e�Ӷ�!Ғʾ�p��Q�ȝ�Ṉ����9^
���FO�+^�`Y�RUQ��UI[vseXd��|��4Yw��`��l
y��=8]����d at E���f/ZJ�7�
A-o�	

+R�q� ���ۃ�Ռ�M�|�\Pͽ6�H8�iml�dwL=+Ǿ_���)����t�Ih��Ǒ$|
+�=��J\�\�"���}B�}ć�\f�Z;�Q��:��g�$	�"��cU�A�g��Z��1���q�kM{�l2����赐M[3%���"Ay>ǴO#�
�]G�	��^�	�������.fE.Ý8�~�)mꃒ�!%
Y�-pq���d�3�d{6eiY²
+�3o�;�o�
��;
v�u�Y���4`d�h�7��6 ���
)9�S��Cޜ3
)�$Z�/�4QZ(��}��w�;YIXѧP�a:{/,}���3z߲��rQ���c��
ljte��J1��y;��d�p�K��,�����\�[�g.@%(%���$;�!&x�@}T��5>����%��'~�����o>�ŵ,�i}
�ۻ
B��
�ƇP	��$
+�>�6���U��
ڒ\�K)�^��L��sTόq�ɲaLF�^S�y Eܘ"�31���m��:��
#��OB�=�H30����B�p	�
�
n�B�K�i��i
M�a��x�%V;�3�(3q��u�Z��+|Ĥ5���<�pj
+7��2��߬kB��M����I.��s93oU����!�ٷ�	�c��狷?��/�t�æ
h��xѼ��o��#�dj��DO-�j�YGH���ںj�?�Q
��L�:��;y��O�x[��u�;ų(�����6'w�
��
�)�`�a���{�B;���ʶZw���S��{4I��Om
J��e��E41�Z�3�x9���m���
B
��wƾ��梠P�,zj�r�,�߯�Z�_��w������n�� �G۰+�B�A+�,�t�^�1:�eI���9���#<B�h�`��d�6��ξ��o&[�,d���Z��� B3�6\&R�'-����O�UJ�I�$�uT���o����?�r 
+co�G�tѤ��5���;� ��Y��m9d������IY�d�-�gz#�i`�BB�Z��tv�~X�}A�6����t��T[	
�se��W+��u+n{R(���
>�f�zc�s

O�o����7�{9%��9\�kc
�k&�M_�1���>"o�,Za���y����{��о�%<B�
�G�ܷ�}@�T�?Wh��)Ql ���C2,�V]W
+�3w�=����Ř\Xա�ύ��]�Ԫ��~"
�]��X��Âfl���|"�.Y���U~ZԠ�F7���O��c+�
�+fR��go���'��Hz�\�:�)
�f�\��"��
-���!�Nc";������p���G�z��ȉ�(���wBdG�do�~��
�z�MF��u��X��@���6
�:��`�eeŒ1?�O]_�
i�/?��엝bU�MG�*
�Q
zl�/�3<

��H2p��?3�0H������
�����uV��m	��xa
+Xz߼4���O�������0>6]dLV��}����W[��U!+%�R⯑I�[pI��@�R2�'���'�}�
+��~:�%of���h�l��
[|����ó�A�ڑ�y��m�f��|�]�E�C��̢-@����w��C��������3�ǝ�	�����fj�

2�<���

���>4�{V|7F�J���uf���_a��8�����'�j�M����C�
��aNw
{:���`]
���X�z!�{�����(�q������"�݊��UHU_����+����
����@�^;z�G%�
}":�T(I��-��+�Ċ����
�i�ބ|�����*�=%k��/������	�����CB����}
�Wo|����Yr6�;�

uE�=�.*Er���ɂ���	�W���0��Ae����@B��P�@(E�IT3���U�A�[�"ڛ�"�ˉѠ�o�{�0���ý��C��d��>�>��y#(�'}���
A�g؎�qyZDdj�Px�����e
d�vw�[rbvn%��}I��u�ye��%=yr�"��\���	bZ)�`�jHW���F.{�����|x��>IѦ��k	�M�U)��8G���'�ތ׾j��~�$X��u���4��Sgĸ/��:e��o^��,v�/���)�bk���a�z¿�4�)�����
)��ˡ��t�Jb�.�0ٖ�p��=>pqY�zZ3!����[����uo�
��5��ݒ��+�ڟ�eJ
����̹*m���S��W���L�}��S��R�r�Bwc��5�-��W����v�ju�
����Q��φ˷�vK�q�Ï/m1�g�eWdT�-���`��ǬS��.��gq��סP��/P��5meD�F�ѧ9���F��u ��#vG��=r�k(G���Ȅ'�������ymG����
}=�F�
�I��N��S�4�oy�f�rh5.Q�eZw��NM�V��)�}M�ջÈ�
�tQ��2 ؍�/��
+endstream
+endobj
+18132 0 obj <<
+/Type /FontDescriptor
+/FontName /TVEUDK+MSAM10
+/Flags 4
+/FontBBox [8 -463 1331 1003]
+/Ascent 692
+/CapHeight 550
+/Descent 0
+/ItalicAngle 0
+/StemV 40
+/XHeight 431
+/CharSet (/arrowtailright/forces/squareminus/squaremultiply/squareplus)
+/FontFile 18131 0 R
+>> endobj
+18133 0 obj <<
+/Length1 1489
+/Length2 5062
+/Length3 0
+/Length 6031      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�]�6% ��tܔ���
�H�� 
13L�)HK)�` �������4J�H�H|c<�>����}k֚9׮s���=���ׅT��-8
-$
+�
���� ""� 1nn3(�򏝄��DA�0���PGB�h�M����0���8 *%'*-'"�����G�`�3` ��a	�:
Ꮔ����?G�׉������zA�P'0
0 �� ^�����u����W	^74!',���
{�@p��� �
E���q~P
�^���@$܀���q
��#! ��	u��P�
�����u�#�+X�W� �9�(H�O���?
+Aa?��NNp/���.PO`��B��0��G ���}�PO�#6�������	 �2��億"�(
+�����2�6kœ��^^E��}P$�	�w������}a� (���
g
B�
��@t5~�`M$m�4 )".*+#@������
����N�f,�� 
�`i@��.�I 
+��H
$(�?
�F$���3�	
8B\�0��ձf��/��?�؊`�'
+����9��*�����s����V&��)�q����� !II at HB
�Sq	q@{�w�?
���O�1��u�QQ����v�">����{m���`�����������K���?S���Q����H
������+��񃽠���"41��XB~������o�.��
U����AQZP?��1���K<?��N�;W�w��<b�R ����`"�
c�(v˜!~?�	�`p46@`�A�

I�c$RҀ���O$-k�E����_$��ER���_$�A2�*����_$��Eؚ�� Yl��$��A�hv�~���	�Db�����M����@� N$�p'��Wo�^�2�
+-��I�u���[.h2�,���+|�?��<�����/bOϫ=�hE<n~
+̊���x�悋�`��e��/(}�ؒ^S���8�ٕv�ƴ�wOe��N�{{q$wU[�jM��s�M"��u)^_B<���8)^D�jnC�Z���p�.jG��k*��귬�
1ɹ��bA\�l��Bo/wM)s�U�Q�a �^hդ�����&"���{]Q{û�i��f�x(�{�q��>�h���sCVCEZ%q�!
�q��V��S��>�� }6���3�x�Z

�S�v��)�q{�\�uN8-��]�8
/Il\�R��e�6�
7;��ȅ%-]v+Ykez
+���,�_
+z+JS��S�|�V��������
�f�:'�ޥ���h��F��R���u&?
X:��
�GvOx߀�:����I��xw����iћf�L����v1�gUmK~/]�!�۰�G-�>1�V�.�b���V
��
�ʁ�[�g�Z�]j�
2��b�@�%9�C�����H�N�O�߽�Dqo7x�d�[�ٍ�W*1a|���ƹ��ǵƔ
�����
:���
ȂvL��bMto=E�29dtg�pZ&�*Y:?�
 L[�[#�>D~m�iA6��/\�M�����z���9I'}�ln�����2+�K#-Jŏ�b��xe��K�d���dn��R3gv���%1�

��ԗf
+��I:]�/��8E%1:�W�ľ��ŕ�.�7
+

��/��2푺Pc�gZD�&�1�*��E�ڠ�O<�W)�X$r���ϻ�ک*2\��"�4�I�a6���
����l�s����u{��6����T_�7���
+�dQ�xı]LV�kz�`��2&�����z`%�����Dj2��+�5�,���18�۫l�)�Rig�* ����O�=k��_	O	�d�)�7\긴,bI�V!/���*����%>��
�Y�-�p�
#��"�OO��l4���+:����B|v�8���Y�3��i�I��B������2���������r�
ޜ+��z_
+ہ��N��+:x��{�1z�)'�.�*���HN���
4����g�9�7b���{�EӬ�qK�I{&�
+�����WW�����:]
�B��o8a�e-�
�޷�0�$�Z^�����1��H�����ʼ���T$�F��w<���Wr����v?�|Q��M�g*BI�!�b�I�a{2��$l�d�ݝ�X�Gt�g�ʲ��d�QZ[����8qⵙh[IE��Z�ϼ�)���{6;3��C�u��Z�r�eִ�"Kԙ.��O��~�\�\a���tD at 2������A̩i�W�H��W�|�Ql�� 緛��Zih��0����"�!���x1�B�b����W܈�I�=��G�_��"�����ƫ{L��5���d{gV
+�k�e��Μ�>iK�&`\c	o�Nx�y��@��ci���C��\���G�M�J���Ӻ*���&BM�y^k�7L0=!����'
8k�o^��SO�{�߫���\�M�˶��@���	�%9<�W�+�i5�]Ío�
R��A�
ޫ'��V�8B�����,w�-����9����x\U�B�/_�ē$#Q܉�"r�7�3p��֊���H�ۼy�*��wO��ݚ��5�o�}e���۠�HfD8^�^I�����'K\>�Y����U
�Q��kƦ+c����
6^*۶v�dЖK/�E��?`�e��k;��
�=qa��P�[�E*��6o��>��3�XK܋Z!���zw����� � X�}q�x-���
}�0je"�йj@=��OZ�u�
/���/��1o�c6N��
��w'&��N��l�c��fXq���G��
vM#�[B�+kμ)*� }.�@}G��o���X�p�;e��>x=i�Rm���Q�{��h}��9�
#h�tH����G�l�4O��	yn�5���2�Z�^���%����
\��
+#��Ix�V�f;_��#��KV�|AZ�	O�b��6��w�M'�=��Ɣ
+M=4�+�z��S���{΍��0r݁�a2g���� ��vJ����,��zv��|�S;�z���8q$fEw�
�hV�,��M�-iMf
��C�� O+�Z�N��H�����t�+�X��eޚ��0�`����E<=�V������O�f�k]
���(lK����V�0�]^����J�$\�����e
+֨k�()�NP�F��r����J��>T
Vۭgb�D����d���I �f�v�3�W�E�
�S���]r.g�
�lx'���W������zN1��WwJZ�r�5�>��g昍�{�+��,����BjM�#�[�T���l^�ٛ_F8:KQ�GE�bC(��lm�����ͦ:G�3�:տ5�$�H���` ʴ�>S����OP�� ��W>1�p�`�gO
�c��o&�ݫ>��G�Í��u=W�SV�L�y�j���e�u�W���Lw�ioǭ4z���~Ѷvw��}�&?�,�a�;C�w���>���O���ڤPX�v�$I�
�J*�;�~
�4��
?i��̳��辫ʽ`t	�Vp2��Ϗ�n�d†�ym�J����ԫI���A���,�	l���
��
Ъ�d5<
X�-�O��ҧ��e� �[q����S�K�^u�C���P��R��5v���9;��:N�G���¨8i��Y�G
��x�V�
����]�L-HC�|�C�͠K��x
+w�t
�K�F�6�F׼+�.}�NK.������U��+�����`},��z��̵D�݅�C�!�w[q���x,6���3ޯI�e?��}`��5ÐE at g���b�ڥh�{񭬻k����
2��q�P0Kt������w`�t��˭�Q+�}7{CN�d�=ޘ�<�
M
{�A�MX�#����P�
�� ��#bgu*�����"��sJBC*�4�
�(|�{j��{����Fh��6�۝Chs�#a�{䗌_f��
.�=�L����zY9��{�����;�(�d�}�όe��&8�9��_�L`l�:j���Ţ��Go���+n4�vs���a�X�Z£o��D������^���Q��~�f, ��է�,��my�h�� /�8z!�R�[��
v��/K��F�_�ũ�Bd:�7�ϔ.�S�ʶ��d
�'�d�?��3��Iw���#�iC�”�4
�t^w�S��
�byގ��&�!��	}B�S��~��m=e�2A���mb���I�:��Ɛ�a�e����+�[V�.j��Gs�ÝĽ��^'��
5��֋�����tHu�X�KYў�\T�o�i}~��>`�Bv�>@��@IRh�ƹ�gާQlo��J�}S��Nǟs/�g$ɭ3V�6���F?�����n}M���=�W_ό�7��U���O�:���[Usv�Z��SM��H�����pYso6�y��7���_�E�q�gq�O[:Q�K�JC��N�I}��Y]9�ofp at Y�k��x�yg"�]�,�O��-?s*�;�d�fbkĥpe�%�xGey3��VIeb���8VmO�
�<X�;�������a��U�׾8C�7���ԩ��H	���0
+�lW2��%��o�Y#�����iM{���킛��@�t�&�G��i����,)M<��O1�Ҧ��ۣ�el�q�� G9yn6�:��d/?ߕO�	�jK1_:
ؒ%�^��aG4�"� )�{cś�k.Nv#�O�
מ�M�{�{-�3E����W$R�
������zXJ��N�^x�ldo_m�頼�q
c�d���b��H�����Y���ښ���z���e���
+��2�EN�7`�N���u�G��W'Ƿ'ť�"��r�F�p�/-DopNo�x�u�Eهs׳��ӂ�ꆿl�!k���e�A�M��Y�5����2M�[����yD
�B]�2\KO�t�0-����$Ȼ-~Z�|�]�E*�
t������j�<����%Kf
�8WS��Z3w4�
SRA={;5!GЬ�c�'`�d��m^Q�%y�A{:�~�ǡ�D����q-Nv捾
-��B¸���#�C��=�&[5
$�ZIP�3�:n��$@�}�cv�WsV��w�ɸ|
��;�ѱ[����
!����da�!
V�͝aOג

̀�c��c]m��>��C�W'��u�>�����Cc��N}�n\k�n1Z�2J�7���s�zB^�f�S<�
��������XcBg�[�&5||�����E�
�������xJ�B>��/���a�
�+�ºrh�����).�M�l\�w��>~B�2�nhR�R�0�e at 1����f1ݰ\1�L�6V�-���D�<�$�:c��������(�Y����<^��I]����c*+���
k_d��KL)�-W���v�9w�l�҅���VeF��Q,��d����7W�v��;��H��~t�,�����\hM�,a&��ڹM
#TY(c
�4�=5��[T|,�؈���)͕,��*����=Lv��䬖jh���o���.M@�T�L�9C
*��ztɞD�pR��U�q�)z/�o4�9-!��2�Q8��Wq�g���f�~GO��/��G
���7�*%�QH�?�7ѡ	r`bP4�

+TQ�Q�h�T@�3o_�|��C��t��`Ps���Ʒ9�
5?]��WY�������/QrQ�gl1�e?98v�*ސ�K����׹�O�ȝo\U����
音�'��sd_r���FmX}��·�ؓ�`�Z��&#�V�0��Q��T�bA�6�@>�n�Y�s��'��D&
ޱ.���yE�Y�k�ڈ�3�e�yL��qK�ߺv����\��P��^�
:��k�v�s�1Oۊ�#j�z:���W�]G�7��ߺj���D�"��J�ե�1�ڔ�mp8
�(�_bf��Ǵ���ѿ`x��T)��e�å����;l�gZ,Q(�J��r.�B;j�NM +�9O'g��4+G�@�wr�u���;/+�q�֘I�|̓�Y
��ܒL�5�>B4
�'�Y�6M�%]�7�
+ɗS��
g
�����x�u��,�����9]��tԬ���jI��2��2G��ȁ
�\7��=���jU�D�d�}��8?ږ���L6�'b˹z	=|g1���b(͐�v�kg��X�� �Ʃ�
+endstream
+endobj
+18134 0 obj <<
+/Type /FontDescriptor
+/FontName /UDLXQN+MSBM10
+/Flags 4
+/FontBBox [-55 -420 2343 920]
+/Ascent 464
+/CapHeight 689
+/Descent 0
+/ItalicAngle 0
+/StemV 40
+/XHeight 463
+/CharSet (/C/F/G/I/L/N/P/Q/R/S/Z/emptyset)
+/FontFile 18133 0 R
+>> endobj
+18135 0 obj <<
+/Length1 953
+/Length2 1757
+/Length3 0
+/Length 2422      
+/Filter /FlateDecode
+>>
+stream
+x�}S{<TywKLmԪ&��
���1
FH��ȥ��1s���3�ܚ�����ץtѶjCmx�K*%*�&a\ze��UEYރ������~��<���{����`L�����ž<Td
ڐ
��
	d 	 ���D��!<���@� `k
�$G
+�Hv @*�#���P
�m��$ �̼p �����G���A�< \?�g���1	,bJ�Ŝ:h	`�,
ʑ,��#���2/,�y�g6�
pa��
+L�@
�X0��,��3
R��3
� ?e�ϯ
�!Lx���\(���<8a6�`��6�&���"Bd�̯�)�p!.V��F��q���s|DanB�80@�K!BOD
+�興�!��ˇ�,X�AP��"3�
�I�yXh<�L at a�����
��Dž�y�0ʚ�3��َ��na�a^V_�2
�P&���q�-��H��\�E 	�
) K���6(O�
�b�
���fL b� �C�8�É@�X4C��0��a�|��
 ��B$������
��(
"¿�.�G�>(
BPQ���e�3����_q $ R �4cU��=��������xR ��%ֶT
+vmH�b
H�='c�im�n`��s�F0��f�:����+���|�ɦV�ȇ���䕶�֏R}
��73S�&�a0�c^%U��h���&3�Y�[�Kv��I#���y���ր���ÙWs�n�rHխ 㒯�������0Ot����#B�D�.��uo�
+�t�B�4���sm.�Z_�.U����ui?�0حBnd1F�朊�Rs��
e����<")]ϟm��b
�h��?x�}L=�s{Y6�Y|i���O��ۭ�	o�o��F\԰�b�T�^4ңI\t���J�=��Z�^�Ve9�u�Q-__�N�X��
��* ?[�iuR��>��4�Y�%�K��do#)�n��
ٵ��kl��A+��p)cx����M�ҽ%uG�:�
'���F�S��MJN�*i��}�j�e�HEOY�͹����� Ciu�֏�F��Bg����	�w���=�j]�U^��cv��,\�#���������H�k�WQ�{��ejA9ڈQ��8�0$6S�g�ι�j#��.����aT�9�t��qݺ��E�M\"�w߼➾y˨��]��Q���&�w�Q�w�{�z�w��o`�=F�&�5|\����}�i���Q���L��/��\S���M���=��*%�B�u�#����j����m��F?��k5��ǃ h�Ǜ��C�?L�Ot3V. [...]
+��e�i���z2���mg�Ҥ�b#�X�3�.d�6���K0y�o�����į=�#�s��;�n�i��N��r�ig�M�z�a	�Ԅ�5�i�i˖���;
Aj��O�n
+;1�v�A������s��R��*e�j��
ѿ�b��[�J|�?kYݮ`�
3
�^��Y�x#OEbAI;:ب���
-�Y�E�i��zx':��em��6!�0������&�?
��� #�F�j����޲u�k�j��GU��2a�^��3�
�8��T7w�[
]&g�kn��˳]9fib��	U<���N��Qw�����o�.�&^�V|~���)��x��jږM��-�������P���^�UOk�������>�c,��VQo���*�P\����X���Ƿ�C�x	�����Ke�k�Y$�@3|��+y:��ȩ)p�!Wl
~��EIt�*G.�&K~�C�µ�ۙ'��e�`+.�GϽ�_���6^vQTܗǜ
+�VM/�א��\\ǃ{��[��^��@���?���+a���Z���M��{���u�Ӎ9#��d�#/[��c���R���
Ws�
�쩄�O�?P�
r��v?�}dV�8T�Y+K�iM��֩�}:�5_E�
��胆vŅL2��"�X��4�s�/�����o�ҡꝥ�3= (A�P{H����lQ�����Q���s�=3�lO_�&�t^�Խ�����S��֜��M�}w�Ӣ���	��T
)	+�;Y�x�PR�wu �ӹ6t-��#�]�H��u9�O��i��}�F����G���"^6-�SRW1�au/�V��Jݾ��tzƥ]:'�
3I��
+endstream
+endobj
+18136 0 obj <<
+/Type /FontDescriptor
+/FontName /FBUTUG+stmary10
+/Flags 4
+/FontBBox [-123 -2958 1055 803]
+/Ascent 100
+/CapHeight 750
+/Descent -1160
+/ItalicAngle 0
+/StemV 25
+/XHeight 431
+/CharSet (/Largellbracket/Largerrbracket/boxslash/llparenthesis/rrparenthesis)
+/FontFile 18135 0 R
+>> endobj
+18137 0 obj <<
+/Length1 1612
+/Length2 18724
+/Length3 0
+/Length 19564     
+/Filter /FlateDecode
+>>
+stream
+xڬ�ct�]�.�Î�b�㎝�mgŶ͎m۶mvl�vn�>��3�=�Ϲ���U5�z���s�IF$�H'`dc ��v�c�g�ȘY89H�XK�) M� ��pddB�@}G3ka}G @h��L���pd ![7{3SG ���*

�Z�	��O�ߝf&� ��@K[+���_��덊@ ��06��d��%d� �b2� 1�5�^� �d`if�23Z; � �6� ��X 
m����)́�/��@�`
44��
�j���E
��[�98���9 L���
����`fmh�d���vc�	���������
&g���`hof���UNX�?x:��;�����`c�7����韒������u�7�v 8]
��e �9�Z��������_Nf�&�ɀ`4ѷ7�:8�����Ow��N��V�����ۿ�m���_
�

����pL�s:��mbf
��ϠHX� ���n�d�?}�@�D���P�%�odcm�0�1��8�M	���S���O����[�o������U�����=��Z���RF��� ���{�� � ��1�����p}+3K��Æ��
+���8���!`m�WFz��0�9������

M���;��]��hoif
�����112��������?�g���迒�+ҿ���e�i���o��_�
��l���H����?��6� ��'���;��oB&&��C�a��s-��ho�
+��[2#ӿ�������
������?���om�w���������_U�=�
���
t­,��
4OIOu���
����a
+�-�W*����I	��,�{��o���lu[8����E}0҃aIѝ����"���C� og�9�g�)FH=S�𸚗ڂ�`cT9ؙ�W�)z�Ÿj�as�D�K��F�h��m�\�ށ� �&��<���b`txh���w�&+��>�w�)Q�����}��'�3���O� �
+p�����G�+�A�F��P��&s,��Yy���R�l
���\_�E�F���ƛI���l,+�vs�=���$mL�	��A�kɾk8˞u�P��o�� �����6bqC�s��H�,��U�j�4_؂�Rf��;)���G�=@�"�ǒ	���-���y�Jɘg�u�Z�`Y��'��/��7# }�~h	�V|�
dfC(5%�"%髣�٧��D�@0 M���{��4KW~��%sK�f5�|k3��e�·�JBv@�L�h)�%{=\�ӑ�0$g���^
oĝ�Afx!6�q1/�}�.�'��ru8μ���3 z��W4��/��t������T�y�>?�^C+(o�?=�5���6���7bA�M�sj)?��{g��d�~)I�@^�0�.���Ki��xX_��N ��.�	�#[0�m(?.�sߛd^�+/�m{�]�,�_�<W�W��v�>`�d��6��`�j��w9 �?Ė�*�0�vS!K�*^mٗ����o�����㨉9*�+;���8�A��v�x���rΪ������
�h�9�/	?K��DN���-�
*�utg��⦛���,3
�L�}�HM�IaG�s�X����B*��
��Z�<�+�������G7��Tj{�^4uKB�cI+�R�u�
��d�\eD�I�(x�s��G �UO�ߘ�z�-%5�0�!���=�Y�]k!ɕﱇ09���)|?&S� �����	Ml��m�Q�1�+
�<��2
��U�	�6�<���`��qᶝz�
,�F_*�f��a��3
m-�����F��-�_��nP���|¢#�d
s�v�	�j����ж~$Jn�
u��.�3g&���O\$���։ 
�u-z�V��$s����a­YE����܍m�9#�^k7
+.�6s�?�gC�'�M�g��ÿ�\�y�vח{�w�3���w1�o>��j�W�̺k�]�m]$y�GR�'�ާ
7S�f
;�:�Z�֨�黟j�Voʋ4��ԟ����7�t<��8�,l880ђ ������S$є4�R,t��
�h�

B���T�61�_;�sR���q
0M��	V�=]�=�
�1�]9�̇q�2�	a��Ӂ� M�"�F3�`� c��z6��$Ύ����)��� �ށ�c����C��D
A�r�߳A;�j�c��f}��и�TQIH"T�)�:�l^VD���g­v��5*�^pc��"G�X��s�I��_,��y��l+����?��&�p�4H�sg9
+|��O����Y����i'�!~���c���� o�
���㏱��h�j��5���%��>����EQ���lݦ��_Mf�6�H7w��(�s�[��,Y�v&�5��yLi
�,����%���ފ�7�@���c�7���a3�F
���#UV�P������Yo���$+շD��J�-�U�����@��1���-��ui�>�P�zl�P�#�d��K2��~_F������G
��H(/� �����2�o
B�f0Kb����
�cos��`P�u���y���Sy߈��6�	xy�����ɸ0��7�2"��dI �w
a��0%=�
�W/E��!o����r�b�
4
�3t�<��{p�Ã�K%f5�Đض�����v�E��3���G˕W�)��R��d�4ˊ^(�\u�)=Vט�Ҡ�t�5�79
R���J	�a�f��=r��T_�x�奵�B����M��bv����
�-��n���E��6�Gw�V�RZ[D7���-[s	2iHh'Ҍ<���
���%��Q m#ic	:���2�/~k�-Z�>$9��H
��Cv�)ܶ���7�x*)���W�����; F輾��_-�%_w�Pw_XgO k<��;�Q��U�(��5����
 
+�\,p�m��BQ�~r����x|�
(#�w8x�[h�ޠ2[���<
f}f�C��KB�������Gc��M���C;n�,N��v��V�
�P�U؇U}�!�x20޿�`�����H����M����cE�Q	O�TD:g�
�M9�W"�g���~�}��Dz��(t�,O>��MLH���8�f\)�K�
2U�w.��i]��U���+���8pA}
^Y_�U�^"�t�:�ͬ8�.���~I
�Z9�3�$�tdٍ/�c��yв/�ta��I�-�3������Ц�9����Y,{j�\ug�]fK��zKƸh�:K�mGJ;����"]�HZ�
+��_��"��H��\w����MZ�);:)s���;��G
3����ύ�l�E��	k{�UxE]�V�E�?k�|����k
��;�
_��m�
7Ob��Qm���x\W
@�ֿ�Ke�3�hZ��hQ�������pﲘ��A����W�~�IaX>;�?��Z��7��ymn�xj�pE
HG.�o鱬&����i+{�@�*�]j����I����R
}� ��
U׸�<M�2�F�A��$�Nn%7�b��T߆�%��
�.��V�fug�d���כ��1����;�SRR�5�޲,|`��\�>K�1�NQ6_J0�;�0*v=�7$%P;�*�Z ��'$;߮(P� �UB�O,�Z
��zt[�"aE���V�'
[�:�;5u�z4I�q�r�.l�D�}%{��(�Jl�o����e�j�$_f�*�
]�����dH1���
b]d�#�;d�8�e�i���Dh��PR0���q�
�d(uя,CyӢ�G�#ݓ����!;MCX�p_2:��]�6�����鱙�G fO[�K�iҽ.G�����B&��gG�l�U�'Ѷ$�Xz�6�^�	z����ͽbR�1 9�ߏ'�|~��O��� [...]
%
+qv��%����'��� �#J~`|x��X%'��p�����VE�90�^�A�7�f�/��0/�F�\�]H�R���;5��/(��>/��X<���y�J������#���
/���(�.��c<q�G�z4��$�V4>���kJVK<� MvL��V�C YOj:.���D�S)A��EN�<V%Y�8=ظ��9v�0��=�H��VP��Q���&���ف��ﭾp�� ��b�.��CQ����x�

+�C���_r�EG ���恄��C_�n<V���B:;�CEp�g�&���(ے=UA	C$��^�;�}���
+M����w���8!x*}Q1/9�b�i���{�YN*B�*GJq�s�-
�
,�z��b�&!�
j��
�Ƚ(��G��T^�&��2���N���Q�(�c��� ���U�YU�Јs����o-h�J@�6ϲe�-�ӌ�
�ݷ�N��������9�f󃛇Zy$p�*�k�o����L���&)w���X��?c��N׭�dy��y��^���.�4�6�`#nrM�e���Z��?��㉷ৢ���~.�A+�-#I�i�A�g_�'��a�gn|�1 ͛�qE��ب�[l;��ɪ�Aۍ��������\`A+��/35y��,�w��U����.���n8�`����@�6ւJiyt�x���Nz�����:V�*��ũ(~�
a�eSX�㬸��$�A�.���֭�>�����k鸞��'��X��Ԅ�Q�,ؕ��H��ej��\�(��%�H�WD��
|���f{=$u�m>���;C
À�re�=���ы�)�`
M�o;-���dP�]W��+��
�
+�P�O�|�y]_����f��K
���@ԖqEk�$O�$V��#yX=����Į�=ԋ�=��^+
�_4���0����gh�d�
�h8.� �h&�z'1)�˚�FX��,�)�V�o�\�2B�/B�i��B�h�5w��̨����|.3b����&T%
��J0�I��l:ّ����JZ	]D�����m�(����OC�t��
��Gn��W	�KU�V
��0lۻ�i4�SfSrK[�B��d��J���O}�Ė"e
�C[��*�+�$�ӷ���%�� B' �yL:%=v�x���.J�u���f���A��B���2Id䴅��8��;Y����0�:�>����D�(}�턨�M�I�g8g����;�
+�����-�/�fd���zj�&XLh�aJFŘ�m�gL'��(۠�A`��i�8�
H��S��uHs70��/+ž�#�a�cB&J`��
0Y���c4�H;�a>� �$��|1�1�����
�
DJ�E��
��ة/��+5�YNe��vl�vHe���l��b"(��Q?L
ɬ�T=\�q+Shy��rI��EV��E��d�%�*
��7ذQ��sE�Q��*�=���
L
[?7]��Ԇ��
M��"~6�
����aFй�<W~BI;�'̡��
��f/ч�(�Ly+�(+hf���'M�9-���P�ԁ.Ȥ
�O�!��y�H
+!�>��/dp�W
��$��5ZG�
����"�����ü�Мm����¶��Ә9�D�=
��v}K�v�� �"b�R�I��v�#נ�S:&�s<"��4�Y�<��o~���k%%x�����K$��}X�m(B��$4�@?�nk����|�V�}��+�E�܉��4���d�K���O��w6��r��F�r7/3Y�eUC��i!�Z�
�#�OP9�(7�9cE
�x���j�$�����i��Kk�x��^B;M
 ��i'�U���=+q�p:Eau=5� �;��@v�ҋ�
�a�o+u��cX��~e�R��D[f�ɚ��F��C��JĪr�
+��*17�n5�u.�Ƅ��ץ0�c����e��%�2��H�$v��$���P
˹�JnB��(��
Ș���UA�<K�$��M8E�ey�*
��K5���w�t��7t
���
��X(�LZ�Q
+��
d4�9��6ccI�\�r���!��x)�R���<k�*�W̭�޶-*K�|�9\9��aق҂��{��٣����������w�O���V�3ف��*���Ë:���+R��=�5�(�k�/b�Tr�ѵ(q�q3��qD��՟o
�k��VV��4#���1��pنޜ��hQ��2_��En��qG�[�N�|����%ą5�}�
���ֿbR��mp���6gqA*Ձi3٧R� �gYc
lP��e���N��
r�
+A�Q�{l���L}����������{9����ώ��̨9��3�ͺe���L����.�j�.���.F[
@��<��0�&`c�{����S����Vu_zo�Ծ|'I�ɲ�B�:vX#���
+h0�����j��W�i�f�����禈��FE���?�˻�a��(�A����r�
�/oS�C�3��
�Ҹt���?����C��
���ŷ���LtYXY4G�7�/;�2�!zbJkA��=]�l9s?��1a��|��@�x�$����&#�Je������`X�S���X0
+�E��� �N>���p��
�,���,����[���Ӟ=�5�m|����X�KB�/)��^����
K��_�En�ޖv����y�����Z�@��px�*�_iKEj%-L
��"���(I�*u����W��J�W�P1�S�
+=�-t�z�ݓl;��,����v!
��K�`e���s�3e��e�����\fA̓+&`�ő
T>�x�p
%�G,bjW�);�����)��=X;�
��n�u
�͇��s�JY�]M��;��B%"�K��g��8ebj���nG `T+�t̀�~.W�����čyDz�
�
n���!��3V�����2�
��i��ѳ�$N+�2Q&d�P�
��
+^Zi_�vu�I�U������.�d݇o8��l�̟
R���3��
+�����J���B��X��E��=�N��u4*
���U��H|t��a|�>{>����"�d�L��x�ynf~��K���(9d�<o�B���#O�%���Ɇ��c��rN�ґR�!=���~�W�<r�GQD�ȯ� A���K��o���H8 ���&e]�P��&,��P(���f=�������"��R�7-R��e�Gf����������
+�AH��NB��OW���e=LD���5_7�k ��wͶe�J��t�U�nZo�XBlPw�	��_�(S�m�&A��X�WȾ��CO'�w�6��
��S�Fe���Ԣ2�q��`�x��;�G-��CPA�$I.t��RА�IU�*�7��J�B�	�� 1,�+�~O�
|b��3K�&
8����o�7��������ٍ	��`ؓ���bo�lya0�����2"�Io֏b;��ɱq�����	%�n<�u���5���~I�Z!�K�^�Џruϧ���WZ�J�a�	�Met��!Y²g̙Ue�H.n�ف:$b�N��n�br+��Qh�� J/�x���ꞌ7����޸UM�����&�
+�.8��a_;�

�4MU��I_��=
�t8�V
8�X�':�8Q6)���|T��2�צ���

M�Ÿ0q�E�|��]�mr�0�љ��iNhd��Xw��M�?�eDTF��'��b7���������h�r�G���XI�M��g�L�m�b4{�Y��mD��I��^�b5u?ae'��D���I�3	j�3�G&��
9�܃�\�W��n�!4� �@?�O���DU1N:Z11g�t?�ʫ�k|����"LR�Y��x	�
>
+>�#��s����I�Z
{���f�,q-��?��*X��</����
���J�لԷ��k�r�)���axW��ƄD�5"�d�l#�1Sy7��ƶb�^J
�7
��聥V�]���b2j�˝d"oP���@�U�����e��[4�F2��0�8
ʙ�|�,�_Q|����E7<��,k3ja���lI�ʌI�aŅ�wIA:޹�P)���x&�8S�:�
+�]�&h���XVox#>�9X��^�aF���ׇ�	���~Jۘ7�0�؛�5��1ɮaZ���΂`AD����p�tQ��U�
�/�Z>�����s�Q/�`�X
+Ox�y������.#9�
+�_(RFJR�IױI��e�W:�vsj����U�>�+�����\Vk������
+�(AG#��>Lc0"��Ѭ�K�p
+�L�]M�9}
z��N�P���L�aTH�M�Z4�(I�q��R�80��W��^��qó\U��o�W
�-��7��y���H�)�
�
Z;���"umJ�����k�F+��VoY�K5{�
��6�յ���U����/F�S�Lx�Yj�@�b��a2��
��
+xj�s?�IbV
�u�Y%hL���>���)$
��{�q�v�}l��M얓PS�����,��B7�2	wk��?B�#����r֭��p\_�:�J�Q%�|?k�
Z��. 'ʯ��UEn�(�p sH5_��cA���!7���˛5�nX9/�������X�/
N�9�=%P����:��V�#�gV/D
)v�
����ߟCh�&����
`���@�>tWV���|�n��TM%3;�Z[?�+=_\�<&S��J0�Tj��<÷
�_�}}0
�`�}Y'H���ec2%q|6@���-�H�o`q��s�jT#�Xf��I��YE��	v����Whz��Q(��vD� ���4<���J����PA�r��|I�H��x{�b�V隷��"@����X�����̩Ho�O
�$d���W��@��Lj�魃E���%� s�[a�8~�_/{
"
�n	
��6y���b�:g4�˰���@N
w����-
��5����c_/��o�Mcb6�.�Ww���$UE��GA���sI��t�U��+�Y�m��SI�NKA�6v\�Z2
?c�+F��kB���8:���� �
+����V'��PC��b�� ��n����M�B���|68���8�=P�c���ɧA�@ێ��f��Z��<��u?�5\��� ��@�G:':*�1=�e���F=�o��'���v�P���<�I��zغ�
��C�$�a��~�iz($YK��h۹�-�*
q�G겭�y
+�S�9��'�_�TUN��%�d5��-�
8UT^��ji���Mд�7����p�X=y떦r1�s��Fa2#
 �|���!�&�=fLe��o
+
E�@��߿g�}:��.ڊ��k�l�Q1�XAFjF�+���Q��O2#�X$
Bg~���(э�[��=�hx�ܛh_��������>coX#S5B���X�s#��LL��XQR
��jw���N�=��+�K�3h�����w�V
�\"��M(�a�_� m���� ��" t�ؐ�Z��ʜgWŋ��
+�}��1׿�4?e��(�C�ߔڢ�%"Nw^�~��t��Ww ���ѠH6����:e�\��Հ�L?�z
B
���(�S�i���剌��bZ�u��)��R�	bą��������Pw�H�T=������ߛ�g�ӄ-C���%��^�nF�k�l����蘻`$D�U�{Ma/��[j�q�݄�6��<1�A�Ă�wy,�
��s&��tEl�
n����t��\��B(æ<H����
+�cb��Ye�R����I�j��+Lvr�0��
��Ȉ[xi�u��%H�'DE�
�N�����_MtLȜ���ٮ�u�2��)oKI�~�*3�dQ� 'G���P�L�

���׵oÓ���ӿ�M at X���� i�}-%V>��
�0p��oɡt#>�`��"����\��0��t��
څ�
��Xl��8y�"q�u�����by����u=H'�RDm ��u,4�,���&-���$_ėU��	����@ԓ��C�+J��b@�=�;
� �7�n~�6j��Gw���d�ؔ� �;�4V?5����`K[�bl�V:�v��v)�ۻ����?�N�
u��K9؃�)�����
+O)�
ȵ�z7�G�>&�|{�c
���_颾�9��hy4~�7���)u�?����u*L�F�'���ȍ�O�j\�Z���<^W�eC�8��~{:Q
A~i��z7g���yO��Ј��7�
���I�>�9��
��uH
+�p%zT�]ĸ�
3%Y�y'P
��%JS D
��<Љj��)b�;��Ӈvՠ��hB����"�L;��5�����K��+!{B�9_��PCl�DE^�5"�K�lʽ�TE�O2�l�����dլ���\��ļY6|����%������MY&�� �Le�m~�
����m�"p�5�7�1SڥX�pd*�n!��.vQ�14DfjGxK��aj�Q��=F2�\X�e��x���n.*jA
+�h�5��oq�X��ƙ%������{#�E[њ�����?f��0�n��
�온�
V�c���
�R�=�
�"S��(s�}Z�F�62h�=��tz�6J�;��)�B�X
+ܚE�fVE2�X2
���\q�G]�V)CDp�o��D�l-�
���,�w�Y��V�dѥ��-����C_R.Ζ�@l��pt�'Ci�C׻!N��g~��Ҍ3�ϲ.��c/\uj�a�<J}��Y���՛פM�gd1%�S�Dd84��xq���*p�
}o��#;47a�<՞�s�L� �?o�
� ��-�r$IlO��w��`$�z�����X������d7Q&)���^��T
V�� -HZH���=�� �
�4��#����O��l��� �;->A�u�%ِ������&��5t�-�d�i�_�kR�Cc�-/����b�����y��I�
�@T4
+������Θ	�3�\�G�
P[�������w4�*�ՙP�bfaA)�z
m �����*� c�^��t
+۳�~
�t�a�1�%��)�q�9؆Uo �X˹������4T#�����A�u8A�{��:��R�]J���/�wHS��l:8S��u�I��
�9����R���n
F
+�hE�T��voO�B�d�w��˫Gs�� L��
K
jP��&�Kqdt�ܕ��+�u�#�U����Ƶ��!H�˜WI
j}S�e&>����k1�?�x�QKhܶ�c��PL�����
�>i�)3�qZ�ӆ�O�*���d�K-0�r+*��
`z>/6�$�!�MD\��VU�x�Ž��ö�Xߩ�n@�Ec���Lhܟ��Y��q��D5��ck����p;�X�.�R�
]t�4MF���p_�;ͭӌ��B^}��C7��J:+7��oxx)���ݑ
&��� /O3rFwө����r,�_��˞;���l
��a��P}47V+ۨ�b��}�
�B�Nvx�y|�{~qX�V x۫>PfxK�֖��)
���T_�#�� V$��l�zG6:k*�m�v�^3�<��{����$g}�����nU��
+\*�8hnH`u���۟ci�9) ��1�Wⱝ4���3a��BJ�5<Y1�I�1�j��q
�����X�=�ydr�����>x4#��:�zR(RpxN�&U!ҧ1�Ŗ����V��l�Rt�ASaLt��y !s�:��Fߙ���
��8�!��FՐ>q��U���2�<� �f8��}6�o�H
Mf}^p�?��U�i��/߹
�Lg/��v$������K��
6a��ypp(ޱ�����XRp��_�X=�����E>:u7�r�䐜"Ԡ>)k��9�{֢|,"���cA�@Xj��<�
�;��e�v�.bt��@�*�,�z�����FեU�L4��At��%?����/�
���P��G�k
�h"X�>�S7�-O
*�?O�
պ`#�]��Ӊ#��^滣�)](���E����V2d�
+��[�˛"g.�y��&�G�Q2���ǡIj at M��AG�
'��3)�|��@#��<�?�ke�+���M5���0V�@P�_<9<�t̄�����b(���R[w�RԖ��nG��i��s8�p|��k���i}��h�
�S���W�3���@��?niRg����Т
+N��&���r�4��E� F�k�5�񩶜��>��O�
�C��� n�!
�
+Ƥsɫ'�ߤ�J���Fɡ�j���y��K���R���xE�
`�}�Z�'A�{��z��/��/9cX��8ٿ�t�
�2�A�sY��+�����ӛ�*SW�p>���
*�Q���
�f\e^q�g� ��Â�W&EϚ�
��s`L����C}8�FnN�lD
,O��D��&K�r{�߷�YT$�W�ϘJ�|�Ol}��S	�X��~���E=q�1]
�TQ�XL,Y�0���`
F��)3ܼU��@]�Q�qO
f��o9��T����B�mǿC�a�� �B�ޟJt0���zf��__^R�a�ϾƏ��MA
�&�������{s�f�����m~ʼ��C��}#�o�)�Y�f?c�
_R��LSBz�,�s����GT���Pj��u�����>�]�2̊�3��Եo�Z��i���^���ߖb��`F���׊� g�*���^
���ܤh�R:怘�5�n�'�(�'��)o.�iu�湓���l
�4ޙ���+�;m���(�Ub�Dn��Jz�^^�L�3�yx*�m
u)	���Z%O6Q'bl=.�p�����ܫ�SM�� [...]
&S´�
 һ��R�������#���
28���jq�A�,9�O&Y.�+�{�]��bB�z�JҨ�z��ϥHd�-�( ��7q��E���I���yq�dv'F�D����o��q�2�)<j�a2��<<=������7/���D��9p�§AH�
+�K6O��P���	s���X���\�
+b\qE�-2�

-O@�vv̖揠
��,�e�{zT�#Ɍ��/�!�����jQ?	��\
=��a	!�z�<+=�F���������NN��s`�6
o�5��^�'�y=���.b�wW at Q-�ߴ��.5|���d{�? ߩ�y�>��,
+�߽osT
���Z9v[}
�ﭦ�G����R�p�_ K9��+!q����,�dr����]�J<��A�f�΁~r -����S!��|׮K
+�����bV�Xg
J=�~�jĠ<o��%����S�T���y���% �	u]��uf
΍RL������!�bP
�Ǜ-Lק�����Y�`<�2n�3��#�jQ���s�ʒ�Y�'%+��4�E ��k��o���%�=�S�WB,�m5�܏

��T0��
��
q̝�y�m�v�Wi����y+W�����������e�0��������ə�sf�;n[5$�~�-�V
�t�@�﬍��M{
Y

�+��E�����`�z�V	�G]u'�����X�|&}9غ���&�#
ZC(��Z%0�2��*��!�$�t
+��4�,�s������x*:b�
Y�����22<r�0�C�5�"�{~�����t�
�-�H}�"r�n�����4
+�6/��A����]�1R�|�,����0�nJ�l�e�؞rm������G0���w���{�:�&�4G/%�>>1U�
�b=�����@�V��L<��l��J+�1���񘪆K�e·�Â\���s�[T^eh$��j2F�>�C�*�W�쏴aww�Dm.�p
�l��=R�f�N/��|���y��MP+�h�N����@�n-��
��W*V#
5��U(h��=d���;�%�ݴPK���
"c\����v���U��u_1U���ڲ��QF�©�
+-�F�f�R��	4M�R-h�Z�ɡ�5�ҍ�sf{t�,ׅ�ռ�����X��
o#���%��)��%��!��@�
+*��S��O[�4
~����U��ӟJ�t�3k.⒫�a�LhZ�&��
��������T����'ǟ��S
+�>�<������
+��
4WBNTޑ������)�-��G��
����M
����n��n\']���fD{�~y���	�c�e
+�	���`Uz�
gT}񤀎{�3�FF��`�7e[-�m
�5t@��_%
*ͨ��
j~��&0m<��0L�zmc�
m9Ҹ�w���GC�\�rɜ�ğzq����
�h/o�,bh���ѹs��mX.�ұ�g��+U é~D�b�?�w���B�\�o�������muTM(,E$"!3�w�h
���$���X�ԏ~@B�wg�m��o��{��vm�آ+��G7�=G��n����^�>^g�����L���C�M�k����<�����DFU&"����>�x���I�u��DO[Q[�O�:������*
�kr
޺��g)�rK%�u~Ydb�#OX B3~�cb|f���,�-A<J)���^�+���
m���=dމ�>"�i�<Uс���<υ	1��+�eD���r�Z
��h*��D��}FK�M�97wȥqa s��^���}~����9w���J6�
T���ku��p���^�"h��?����P����!�zP�=e�nd�����ٰ�v>m��������[`���Ƈe̼���
��i&���QuZ޸*��Էc1�j�
�U�6Wn���ZÂ|�e��k��S?9q
�{&7(Q 
�:���ɳ�
+Z��O4�I�5���KD�����GL&`�:��Β[�%yJ����l�0�;��hgު՜
�#
~ 7��
�K�b���>
ar���.��7o�]���� S�C�D 
�-�^�	%f4VD	�
K�ڊ����+淭����J���w
$FD���9\Q��|�m�6��"i>9�I�fB��mW���ؐ��ѓ��R7���Uvƍ��5���W���Ǹ�@�Z�����q�,4_Њ��C���pÇ$U_qqwމ2���C�@�f0&��{\$�
槈-�	�ψ=���2�S���]��~3L�ྟ� �.%߂�9͍I��ֺ�Y?B\@��P~m!�>

+�P{��#
����j)���n���bш7�95i��h{&ġ�ơ�t���
����g8���c������!����FbH�޶���NKn~^M���~ӽ.�أ��i[�hAHm��Ǔ�V���� ��������A
+�����tI/
�66L��_F�r2��"�UW�:K8 D
��>N�	��PB���C
��,�����َ*�:t5�����[f:�xU�NqA���"ڶ@����RI71JR��E:
���(
���; �4s}�1��<��,N9�R߮���!���Ջo���R}�����5.(Oe
�t�~Y����\Bu+=�Z�����	���b3�Si2����M��?�%��Ng�����t�h�}��
�ip*ƳAka1��j��^�<
�y�D7�D#P	���ZN��s� �?���yW�T�8
��Hx��x��.!�Tg�0���q�*w��;F}��kR4���Ej]�pPo�x�?�{N{U��S<ՉVbޞ;r
ɵ�H�N12�R)杮�B1�<����o�B��voڥ��T>�~�Λ�*�b�%E���^/�a�S���k��_~����k	K؝
+U0ɪ����<)�m�N�����s��}��56#��~1
�;x���9***j��˭���."�j�tkZ�!M�F��խ���2����(�l�_,�-������^R>�
�
!�"M���0u%^�����y�YN�W����s��*
9>c�C��Άg|��
>"�Y���9;�k�\�v~j3#�ћv*n�5
$�9�ZWf�f.��R�oA�x��aL_��N�]�w
	|�h��C��E#�Ḍ�u��-�L�e6��ֈC
+�|DZ�S╶��8D�{0�,x Z�|�(>�	��7�o��?�\�Rn��} �-�"Y�vP
l9��L��x�s�o
���r�
�BV
�݆&t3��7�7�$�2�c6+����s�Y2�O�Vz��[q�3�v`���29�_z�VC4*1{��]�bŠHMgڅ�n�DVG>1ɮ:i��5:��Pe�
ߚ��T
`�2�Y��-������8����8
�K�*
�12(���&\87F�u!z��n�
+��bG�
+|�/ �^��%�-�Ŋ�o=����q��=H�cNi�t�BէE�
�Mp��U!�:��
q7#a�����v?����f��
���“��T宅W��d�޴^k�G|q�5{��>�0$B���	-���=$�5o�g����
2b�T4�٘X���Vb��K�o:
�io�Da
+����(|R��¨ef
�
�Yk��
��ڦ--8��\�k�\sr�?7C��3��R3�`�����L���ǽ{gR�gj ��f��A�-)��� �U6ۆ?���SJw��;�-��I���	f
��q�I*��fU�%q�k7�}_�������)�ܨ�-�Z�!�RR�a���;T���sQ���2�@��ϑ3�������z �
�K���:�
b���;r�1�W���7S��U�2w����V j9�%.U��2f��?;�*��2��� N��0w��zJ���g8��umG������cg����
K�^�k�����v9j��-�4h���݅����xUꢇ}�<}�ڭd�?ghog��3� k,Dc����HAB�nD�:-]������l�+>�>�{�?6��)~����hJ‹20"�p���^���@�f>�U ��4z�����%�
'�����R
����zt�UΈ�I-qHT;
��1��($i����!|2D��$�B�ﯓ<��!����c ��]{��K�w��H"��E�"�F�W�f�4��u�
+K�ʼ����M+Q�`�
rt�B��"K?	��{�Ь=��X��B4�=��4�Մ$�s��Z�!�we�.Bfj
��σn at t[H��=�I��XA<
�յSK;�O�rƶL�ȓJ��,lE��}� �"�:*�����کS�&R�Xg
�L�6�M8�I02y[
�Z��
��U
u��A��
L����~
>3VϺ�b
۰8�K�.�C�Žs�(Xő����5w��^I�g�
+�3����YF���k��`���	
+""�9�_ՋV@������d�ڳ��w^��5���h�_��:��B��?�шN�_
-��E�L҃$U�c�.E�=}�nM��wr�.p`���q��f"��y�(��^J�1��5
0���ٍ9�j�v
s����g�}Pm��K�R&�f�.�
��'ݑ"e:硾����'*iA]:VeT�UT �<N��AT���cFߠ�8�,�h��2E�`u<�4�j'nj�:��XN��!����C�n���U�������Ɛ?��@��}Ҟl��d
�k�8iž|h�~���R��-`x�C7�vh�k���f}�]C��Լ�e_�D(M��/�j9��#��\`�~[�����:T�2
H����X��
�F�A7��[@��-�
��4���
�PU�?�>�}G�N͟��
�c���M6�(���G�N
+�"��pbM粱���ʆ�1s���9���t0�B�
��+p��W�������K<k�d�`��^
0,6���
�#%@��Џ
:��q�
I��
u�y�]����/A���k!r��0o�6HL��p|�m����r(
P�n3셳�� ��W����]p�!�H��Q���0z�hx�y�@q���
u��9����UTp����?��n��֔��Z*U<5gٓ 	�Bjx�����ԫ;Sڟ
+4.T���k(�x�����	,��0��<ͽЎ
��9�{�;�
Gj*7Gt��7��}Al���"�9���u�sp�K����#@5�(����wlw�n��>���Ev��
���B�F��Ŵ��.��n�b�Kߗ�k��/?�n�&��J�481�̯H�$аЃ�\�
����
ߵ��pS
�Oё�\�!�?1��mVr�x!D�CFc�a�����������;Y!�02����\X���MN�wl
l�4��f8>��+R:��G�$rF�E��R(3�km4�֭��}�x��;g�8a4dVG��vɓd��҄�uSǒ���xx(�~�E���
�=|�A� \�@`=���Qesj0��l����H���fdd�)il�]�M��^�sI�^�0Q
\��l^��E^YR��
���R%���5B�tN�S���%���WԀ�P/�'۸�دZ��^��N�Ў9�
���t�L��,n
)�vG���5ez�%�E���@SIRX���pb�fa��+vXcGq^
���y���5#>M
��T��>
+,��_aH�>EwvI
m����7 �=r at c�O��Gc�Ssų#-O�*���`�
W%/����d"/�A���`��?�^
�Del����#�kK���!�3�H�BT�v.HN}�1.�YR_g���"I��F����,�o�4����{� i��S�HS�f��0]�y��t.\���[=��tf����=���l����f��
̑����ڐ�o�+ ���v� ˆ�*?�$ Z2h��٠��q9c�cW�TQ�("�1

3ն�dT
M.+B�δ95��B��e� [�E6
ؖ�oH���9.��ωͼMM6Jfr?��ު�0Z�`���r l�5��%�j���!o~Hv���>'�қ`{jL���j
�tW��E�Y�n�L3X�����ȞL;x�%wv�s�J8mҹ�r��r�a�.�y��d��ot�cc�
6p�g�e=^K�K���s>6�X�P'e>'�0��
��CZ���%��4�[ߎR�1'���v"���<@
� i���lf��"ʶ*	G(yD�H
+h�ȽK
oƌ)�?�1��C��`s�b�mG���Y-:�
�m�T� �)���J2jC�$�
�/2Ǧ�$]A\�4c�X˴s>_��Ggy�m���
�H����
T]e�&dj�J�%�b���~�}��6�
 
E�0y���XW�*r\�
�]HgfTo�0�7�	Ab�=戕f��'�ue��'��c�w��R�j��L���[�k�i�pY��cg��mQ�������-K��S!���!
�O�c��.� ����C
 ��#�2n�h�G�ˋpӻ2��T�0�L�$�=��w�g�,>�+؅q�1&[ Y�z\��0�\�/R-��R�∩ku
%���w�D�V�2_�}��Q��P��%\ih#�g���8[#rR���LG��
�ﳂ�C�M�
C^�+%���O�:��X��I
�
B��
�3����k����:oA�'X]�U��jx¬�r�����T*�(C�I@��C�D�9�f{F&|�-��;�u�V��*Y�S�7��8�
+endstream
+endobj
+18138 0 obj <<
+/Type /FontDescriptor
+/FontName /PCGBOM+NimbusMonL-Regu
+/Flags 4
+/FontBBox [-12 -237 650 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle 0
+/StemV 41
+/XHeight 426
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/ampersand/asterisk/b/bar/braceleft/braceright/bracketleft/bracketright/c/colon/comma/d/e/eight/equal/exclam/f/five/four/g/greater/h/hyphen/i/j/k/l/less/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/quotedbl/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 18137 0 R
+>> endobj
+18139 0 obj <<
+/Length1 1630
+/Length2 12054
+/Length3 0
+/Length 12900     
+/Filter /FlateDecode
+>>
+stream
+xڭwUT�k�6��@�����]
+(

+	���݂Cp�@p�@p��szzzV�s53U�{���������Tԙ�,
̀Ҏ�Ll̬��O {37����"���M��x����$\��� GISW ?@h����l|||HT 	G'O���+�VSM�����_��T f��D�-� + ���;����
�����l�\�� K�
 ���+�I@+�I t ���T��K1(�́` 
���`�������Wi`�w_b`�) �4��?����N@{��
 �V.���=pu�
���,�J�]n��wBN.����ػ3G�+����
+x��")��<]�M]��
�� G�wM
Gs��J�{w󎺚�
� W�g׿b� �����{�wgN.���p�
���#�he�ba��ݼ���;���_�7ur������o����
+�Y2#����4w}�mr at b�kX�
,
l���[�9�s��� ڿf��=	S
G;O���哣�{H ���e��;��(�?!�����
����������ﮥ���>�ڿ�?�
�}�8�;S�_���
����ڃ�<��W��#����ﰜ��{S�
�މabcgf���}Z��\ͭ��v�=�[��`t�9 ߹����F����iX��m
�"�����������Y�4%5����
�����$�jx:�F[���?�w�
�f�f0�s� xx8�ll��MĿݰ��d���
�gefee����Ό�r0w��kr�]M
,އ�?��n..�
�}�ߋ����?͑V
�Bl2�3]���'%��{٠�C��5�
j
{�3"���L���27M�~�\8qzٓ���ų��I�|��+�\���a�b1*C�<Վ�>�W܄��f��ߞTU3*}��8���p~G@�^�Cy��g���ۉ��UWtrJ�|twK3862<�s۷G̐�H%`��zB���i�r�h�
+����-��Q
�|���;�Jz�;$��
#6
�S�bC@�9��;�Z����>VR@�(�L7���z��ު���MI�s,^\y+�4��NJ(
D�4�(74e��th<Y��6��Nu"�#1��@R�ψ��H�����	_��5�G('��s�Z?�6�e`I3�<�~Vs�����V���;��99 at ++(f
+�E����Hǝg���E�1dxU�JNa��@�rg�a\p��-��f���ށ�ɥ��Ye^�������6H�`Z{D����om�R�I5Rah{����R�۝}4���Դ"-���j�L]���I
0�K=�K��`L&�VZ�\�8�9ϐ��8���{BMd�u€F��
ű/Ѓ��
>]�@�).�)�sI��4�;�V;�M4~bR�c�
d�j�
�hPT�W��u?�8 jGu���H/�}��i�Y
��4���v��b�L��WBs��٫U���^o&.����-Z�����Ax�^����F
H���=ɂ�/A���8I�$
��c��U!By߰��9;4̲�P~)dIa�E��v"J�Mx��	��
O��
=��
���U�w����>k���d�����&��_bG�����Z��� �~�]
i!�'��A�����>ct�� z=�Qf$]1AMk���'�q����/&�L�+�)�o=:����-��fϑ�'-rj�����3dP5h�ό��,|,C��r�E��֑'�-"�dK��
����
d�� U`d%�t
xZ��
y�%�����?;*aDK�8w�V�)����q����`?NM��D�
U��p�r]!FY�;��e��muۃe�c��"<s���X1�|{��k�H�����@�������̽��1õc���K	��A�ӓTR��"�rw�d� �I2��M
�����L
���%��k`�AV�q�6���3n�}`"����xo���
�x~�_��(�fy��3��B��+�H �C����YO�z��1֖o� �ᕤ	}�sJ��{q�ͷ��˯z ���u�J�<Ρz�N���4j����`(��M��|!���p\~�I{��.�m����PvF�*��Î��Ȓ��I���A}�̭�f�io
{y���\҅ϭL�4�� R�[��qЄ�ذ���i�m=QI��HxM
{i~
U��'�t	�O s=y�IP���Տ�e���*������UI	�����(EtK�؄
W��ҍZ�)��ڈ�vi��i
����Q7t'���'�
�M�1:Xֱ^�g-A��&
\�LU~�(�"���
='��#��������?<�u�=W�=�~\w:
����z�������>��^T��
e��?��5�7q�ܗ�l(� �|���
��*��,>~�ڟ�w]�mP	�����H�%�Ԥ}Ds{�P�3�Ti�v�"q;�[�[T�:A<t��I�d
�3��\��S	��{@��� 
+������k�s��t��{�h0���
+�.�Qb,G!�Z��W"'�)9l:Gy>���v!
�G���q�IY}F
TǻU�^�!�vT��zE�3�7�"1d+�0�������W�
���Ṙ�����3�yJ+|�*��Z�
+q��
���%��D�4�� ��'��X��l0
��C�]�U�	M�F�g
�̣[�ς�n��<k���4u�*��F��͚�8�
+�&T�)b����#x�;���!�� �Y����;��O
=Nzމ�`�%�Up䠧a� n#g���R��E\g����U��r5�
9Te�ԾH^.�r���S}k*p6>ܡ�"���

+�Wm�D?#���QB�W
z�"5$�t&	m!
!4�[3����0��[)�G�,�����]Cj�7�	��Yn\���`wP����1�@�U�qH�dꉐ�0���^��͸�/�c1l�zO��T�y�wX	O_D�[}8�PndCc���%�N%�a��#���r	!���t�}�c,�i���������N�!�wΆ�V�[�z�TFl*��s.��x$���������l̦ �P3�\����j,I�ϼÜ�"�f�:�Ѿ�dڦ$\u)�����<�2�Hݐ3&#%�٫x9M��z�a��-�~
ӫ��}U�+��
�~�X����䚬gZ��/b��3�05j�K���_O�
u�Vv�2���|�4j^���y�c������"�%JQ���6�

+f�C�U��3Y�<�c,��E��s���5��ID�
���8^�Ex����
HsI/��uҖ��::a漪��������B��g�.�ί��
�
,��_�� 4
+3U�&���Ͽ)�U�5�`�Z*!�j�-�
��
+���F�����
M�F��L��J����RcF�P*�b�O
A������}�r���{��0���v�Md�^�?���
t
��(t%�o�2���Ϫq1Ik�YM�F����%��eD:]�����O
+D<�
+5�պ�
�|�3R
)x�ɂ>��YJJ��&j	�>@�xz�kܹ
�7j9��M4��Z�0���
����v����gl�//��4C{f6/�]�,�
ޟ��*(�w�T���m
ΰֆ��3��<y
Z�	Ǵ^��6�
�r�m�#�1�vE/���.t�xO at Vz~��\&�80*�+-أzAh��\G[ᕄ��5
 ��Ad���p׬��8��_,j
ہ���G��$��v5�b.�����y9>�
)\CQHZ&������Jw�4Of�&�J�B����fD^�~B�5j�Z+�$����_�g�:�lZz���6kA����?
������t�
"���f���ZD[7�7bq�	�[]4M$��O�T�x
�%0
ғ�����H�V�1|Ȳ�t�c�
�qF(n��"��X��'hD�߱����
_��6�_zI.r8�J#4�gb�k
��
�?%��i��XW���,+ �V��n���$tl�ٟb�Q(�^DњS#��"=D�@	CI|wO1���v%��Q��P'Ð"�)X�(KA>�M��n��j�i`u��9�{�Ǘ�E
�;*�C�\� h�Mm�}摧{2��oU.�%wv�N.n����vf��qZ!��=�����4I��N\_a�F���
+�ss�~ԓzHM�
+}�nܮF7#I����uvnHvLjr�u��&]����WYs�}��$�P��
9���_����j�Ӝ�#�N�H�۵x&K��)���K'���h>���%
�+��H����d�n�X3����מ��v>r��g�k~:���#gI�
F����R>8-\_�dH`�DcE
��%;�6
TS�Xoy~�h[�t������WJ~Ҕs&���Su4���H=�ie���'l|͠����O4�#z��c�Hs�i^�����.zM���v*>C�I$A��F�j%v��Jg�zn+�E�$|�@o�M�1>���
{k�+|A��A)�@�����4�?N:��;�蘽���6vٵ9�����
��\�2�y��r�˕-D�,����:������)k�b
�
�ć�_�yco,���-�,�d�0x��z��P�P��>yF
G�[���W,���o��n�Si�jC����	_g��\ֶ)[3�obU�t�+����4ҿ%'C
g��L!KS�&`�R�d�
+���	�+WT��l�N,+.E��r^Z���	���ڗ�c�f-�-=m�H&�EO �W��s��Ŏ������W�*��&� "D-�Hfz�p]�:j�=��r�&��b_�p`��oD�����B�	W�3]��[.2+��=r��f������5��u$ݵkb#+ۧPAE
�H���
��(�����53���Ćs�S~���
�(	��Y_;�xX�\s�V����'dE��
��vȇX-�$=i��
	,&� �Y��ʈ]�]�`�Oմj�)Ѫ�$�
a�����N��g��:ƾ��U�t��
�\
�6ҩ93���~"���^��
-�e�x���4����
k4�M�c|����֑V�>=b}!�d����G}L�c
�$���M
+6]�jQ?��ٵa����i&*����~H6��&�=?�<�1q��	�v�̎cnv���! N�Rc)��W��B/��h�|�p���T��n�|�e��с����r�ڂ�
��`,�����v��*o
g�=a~�o
-��Z[�y��/o,���	NS����
Q�ą���Ӡˬ�;��MM6Z�`�Myi�.n#{?''�;�>��
��䰁:گ���_L)W"a�k�b`�H	�߲�<�+�u�jt$�9� �M��sf/?�U
��DRNF`��B-�� �)�)����W0�
+�
��g��P8�X��%�4��7:��
��֐1�KNStn�=�.\u�q�^(����
��Y̱�+����Y�3�ټڀ��發,�c	
.d��1d������z�������/G9Tb����4D�Y�?~�Q��g�]���=�,Z���k�}wK�
V�K|C�
+���h
�e��9;P�F��TC�-����/��w��;�J��̷o}�Ȋ�z{����6����0�aPGn��	`�^7�|��sJ	r���/�>T��� |N0Y���=󊆾�L�'��}1E �
��
�nj�y���-݂�|���b�!qV����24نʖ����zH�RU��H��q3{>D�-����� �6N��U���o �u�ˇJ_���a�
��
��N�'Ge�����$⨝�?�l�|��}	���8&����;"�3��R8ai��	֍cA���c��M�~fR�6V
J���7�u_�6� K�W8gȡ�{vg�jޖ
�U-[p�ڞ�(�%�#��+�3_���wڕ�2T�@���� O󴯲=V���޻�b=9�x��&v0R>�����A�C��!$�l%�
d���(���Z���W�\�����m�J�͸��La+����H�G��vQ�*�.A������	��9I*[dI��i=e�
��3�;�2lYT
B�>�*����6�r�pZ�� [...]
+�|�w���e�� G,~|p��Wz;�"%ػy
�(�^�f
�uwJ�#w�H����L�ʄ��
��im�H�g�턧�nSw-"��;χqwe���*l���c�7��X�f��6;U���o�9T�{���a�$������Pn�qQU�u_)s���o�y��A���)�`)�V�@z���7d�^,/��0�T%��	�EM
���pQu�w����~)�܇7LBo���z���Y~�,�'S?��p�� OS<�[:j�ɫ���
+�<�o5�n��V[�����J���:�K�F�(�M��T�3��f�������7�W�X�u�J��>�2_�:��
bm���Tn��
����|~�e�Jb���0*�6-���
�
27-z
��h`�+2�Em9F���v����sY�@
�7�H��L�&��>Y'Q�9���*�?b�@�nYRA�Tdg������������	|s#�8��\����7'�6Yأ%�N��c��҃�(a�Bs�j,�/�3	�֫N���%�a��?f�V�����d��2�$Z��� 0f�z�=A�����ds�v����}�9�+�2�Wdh��M�7=���^�����	
�Js���� �zU�'@U��Ug��E�)�݈��E�������c�@�R���/��+���-}��.��&V7e���V���)��
��g{��
>튻~���.}����l�����ć�EbOuѝ`>��
yw;*�v�+� 9{ł
�(ˆ.̨z�[M�|"�-_�4���b���<��?��N���ѝ��������7mK6��q4Oy��F�+�E�i�ȗǟ��E~⦱tȳ���\�
I)*�pSJ�]�ۋ�F#3�O��A�#�E�A���m��Qƞe4N�D]<����R� Q�!#��*���">��|9i}&�y�'+��0B,o��m.���,j$�����ڣ/�����R����咿`%B��X|��
+!�<U��d� ��A	5�x�7��.[�N?�Z�#~:�������g�!X�	&<�S���R�Ŋe���{f�
2.��Pl
]�G\��j�����]F4�k7ǰ%��|{e��
i�q]��>���+[�;�Pg
�0 at k�֫u���RG���
IZ4�
o���mTx���Pn�C&��H�e�� �@s��.`'�?�c4�aꅥ�[�	
+e���):�a��|��=��?S<$��2*yvK�E��'1Eq��|�D�Ь
(o�~$��kw��
+<��;�X��:��'q�P��J���\�_I9�ИdUW�y��jFe+#��sɍ`�26<g�5+, ڷ�b?d ��1��х��s#dk�ڈ1�����mA!��S�a;�s�!_�
�U˙��T�
v�~C�70��~0�3;��Y��}�[��wd�0fL��P";��a�f���VZSj
f���[��E0�.п/L=���
��Ի{ꝅ �̢
+�/���p4n�X]�2WW���΃|(̋�-y{I���������'�c�-����(�U�&�)L�����!X����nB���(L
c�"]iA6���h#�c��R����p؋�lį���Ј�0Y
~>G�V4��5��͵��z'��ʍ�/��!�ZA��
+��Z� �V�	o��V@���7��!
+�E�:��Z2��ݕ̈��G�fRO�����Ƣ�BJ����"�L���|����&S.,���%�+�*��D�[�D�_���b�p��~ܢ8�%\%N[��x�/�i���cb����։��/�/�t�c���G����Y`
�4g��>��3��pR�T�[M>��œ��DB�/2�����4��X
������瀠*�&�% r�;u�Z�J�>�i��u-�[�HF��&�oO���p�ޱ(0�Y|�W4/��p�C�痼�2�<�F3X��3�|1����݉h��S`���'Z����ܲép���|;�C���+�m~�vq�5*�����
A6v;�k�N�+��y�

����:
6#�
�yO���Ev��e����K� +=�9��o�'��BDssO�����Isp�c�����*�"���ބ�(j���1��$��
2�(��J���~��-��
>�t_?�z�I���~��d�Z���:]��r����r�[���_��ǭ��wڽd�q����g<2�
+ΞF��w��F�،Q�2h2�JD�./;v�t����(�6�Kv�N%�.c3��]JE;�B��
+���w�J73���:
�
+9�މM!Q��M�n�f%+n+�O
+�J41�TJ���u�� �s��`_�R"9
��A?ś���4���c�T����>-9>=w�\(�o��B�q#�\x������>~� X3�`����{�n��������!*�����{�—�6z^��/>U��6�������eb}���%
�l�Qr{X��3�9
+�d5AK��u�`�5���i�H��W��
�GL+>gq�u��o������L��d�
O��/�u��	ⲃ��]I�i6�Q��z��7:
���a`�ƹ3�N0=	\��{��-7gh����Dr$��bոҫ���o��N�E�\�wPE�埢V_+�
2m��Ĵ\�3�n���@1��}�;D�]
˥3�b�hg2���X��q�grX�	�>HKD�IDKdj`
]�a ��.��1(Z�G�
�9�@uF�H�])p*?�:�}����T��7\*|�����(���r$�V٬>̉궬D����Fv�q��
�K�
��K���f��0�^�T2�u���x����Šd�G�'�/�cM�ӟ����
����x�{�H�?l�
vstM
+���KJ���1�}���mw���ڶ�����)�ڗ�&]�R/V"���0��
Ļ�CԞ��h�N` Z�Ddi\x� �.������h�و�����B�-h06�ZG<�e&L���߸o6�_��LQ�"�����%���8�cX�A�2t.�� ��`�o�8��-�Y�.**~�y�9
/!��\���F`V�����QWz�ڞ�B�����o+�
�j;�.7T��+b�����0�D�(ɇ~.�ݪ��pc����䜛�(���t�EFD��ZF��?��ć�����+>�|�H�h��w�T�
b�C]�Į^���0i�F��"��(-
�@��J�%�j�.X+dz*��bP�N`jl�O;��P����
�N�&�P?g�?��ĂpyWJ1$
�Z�b���e�@��~�RO��K
+����'=(�8�/U*
�2�Rk�>��1\���yі�8
����B���qg�+�������RD���}T
a�	�
+P��d�r�}^��"k�tF�9I�Tr�g
�|Kg�76��j�����N�`Ja��h�h����ߏ[[���a.^�����y�d
ML
�|�����H	�D����7�SRƻp�y/j��(ǎ@\Xr�X��g�:�]�T�ıs��]3�&x�,Z���re_� ���/-�
Q��v7�(��Q�?���H�
�������U��P
��[��5
+kf�d.Mʤ�iI|����I���e�!�Y2�T�X�x��aQ����Cz�
+p�j�~ez��ZkO�Ǽ\u'�6�s+��n"B��\Q�VA��2^�
=��X��c4
+�']��}�Y%��}�7N8��2`����Eɏ�5��SK���������p�uU��~���',u�O�L
+l�$��O뛬�c%�r�d�E��^;�T,8��W � y��ձ"�ǂ�A�6)�!~�T��"�	}��K(O"����bF2�PIM�_����iL�#s�
K�~
9NЫ>�7Hk�U`s
�D�����h�������Q�iY�g����;T�J�\L�e�ٰ�h��jy%
+��h���(�f#c��Q4��F����j���v�)6~Kv4�Bc���?'V�l:3~���
�_���!
�����Օ1��m���m�{햝��JA�&*
+f0H�"�%�W@��
�4�fu����Kl�Y
+3l7d��<�G2�hp;6�ye
��̕�×fH
+y>�Å;�U0�8\ 
k�9�cd�
�<o�W
�nuٔ{�24���
V%+����i����RE�I#��J��
�~zx�P�Cl/7� Uh"��(A,��K�S� }��&�,D�v8D�Ԣm7��h�B� �05y�9�9������G�Lj�*�su�ʻ�I,?N��F
B��C�4!��F
�N���S����_
�pɶ?�w'ϙ��ؒRlU)�N%�B�v��?S[H��d}���_*�*�^4�͑'
����*��]Gr�`<i�P�OCB��4|�
�6�a<��ۼr�@^#f;x�qE�]f��k�u��|�͡Qi
�\v���܎��:��P_3U~�?�1�>���чaB�v�����,���aFd��4�@� � 1�j��N�|� _�쑗e��U�ِ7����mjź2
^;���k񹈭�k{��~Ig����Dʐb�B��vvxI�^<��zr�&D���qE�umamŮ'N\q�
B;մ�3������>GbB!���H%�t.�mz��6�I�����QGR�#C�
�0���SDf$�� [F����n2��r	I�'��D��wh�g�G;3��L�_�tVC��׽i�"o��˂�
���`Wc��߯�?���w%r
+�[r5�r�@��4��	-G�e������.x�>@T�6�%�,�'Zj��@U���P�f��^����Y�d�7�}�w|�������#�/zk
K�
�ru�D����:rx�-���V��1���FBմ؃����W�
+|�U
�⸝���{?,�(*IU�J�y�Y
$�V{�{}�
��Q*
��7���͗��oE>� �c�-
+�f���s�
_9���Q��7���c��x�'7�"E��0,�m�T��}"QhX���cG��<C&1=�M�w�9L���-�9o:7�h:�1���e�.�aQ��j.�
+��v��=�����n6v,�lAῴ�a�[��Z�k��;v
��1��"�J�7?�Ym�p&�9#�tD@+��Ɗ�����S-�`�3ucWl���w�T�t�n:UtHACy���l�j�냳#^��0�h>r��
+����Kk�y�.��(L���2CHt �
B
�9�%W���3��+FrJ|��G�7���I
dG9�Xz��7S=��Z�V�+5Bp�O}�Y[?8�֥�Ǭ���/jZ}�S�hT~9N���EZ-�u3�
+�Ta�7fw�$$e�IME4F��%R���Q��_m��k�hV����T:s]��G�}�t��Z!�IU�P6X��
`R�O
ݘqO��������S�����\���*^�.�vw�ck�����f�tZ?���dV9/

_��g���
+�g�;�׾?7�����
�|������8
�V�?�
B�HL��|�-�c\۹P����sf�a�AN�!�b���5d�O�tǡ�vKBХ�}o��<
�2�Y�H����u�Mt�|��k��ϗ�
��a�z��/�Q��H<L'�zL-��$�
L�;.�sSM`��vF�.�
+��]]�fN:
%q�@{�
sm��=�ש��#,t��t�P��tΠG���$�(�(����SׂF�祗am.2e{�^́g�믐��
^�t�7;ն������Ti�x
���
%��
+�
+ZŜ[�?8@{F<�1�V�Z�s��Q�*�	Y�5��g�t�4L��/\⎧_p���.�
��-�Q�C�_?�RE
������
�B��#r��}Cᄥ--�_�����=�c&���_���<����M罐��ͫ
#kwT��ߔ�ˏN:
+?9���Y��_a4%�f�������9����F�ՄG�
�o�����bp����L!���JRlM�l�tbl�H�h�k�
�f� �H'��϶
+̘ u�:k?l�s+'ϗ�|��tl��
�S�k����_��q�/�4�v'���K�O�k�Q�/��a��8,
"��W�5
���\:
�>�Ij�7���u$����D�y�22��
$7>��x�-/dJ��cp	E
�<�}���>}$<j9
uc(n��N;
R���y
w�����6
�"l<f�#Y��vw�{�1���z�n��vSn2���2��rs�ae����B�G�^�xM�".�1��M–E�ki**�ugm/7C�
p6/�jQb̷H�AUj<�����
�Ѧf(>�\��
++2zu7��
GI@���H=�n�=���``
��z����T!���0�'ݏ}�;��T����DOh��z�;$׸=�I�7�w�F�(O9:, 4�rr2��s�㦋ğ+ۘ���D�x�8!�h_-h��#\o��l[#'7�J�
�m�'+ٸ�&YDE6�K�aD�d� � ��P�ŲY���f��������*	�W0�m)V��wx�s:��n��8�V���,��T��H����N-kgoK=@cv�A_R�v?هf,�0��=�1n����	�z� �?|q�����2�!s�
v�
����Ku$��tt’"�J8�_?�%ʯ����uQ��g��Hg �
m�1e�p��^$�沇I��4ڊ�_�ʝQ�{>����f��?�*懛�3*�Ï
bC��Dq��&�um"�He��l�0�VI�����c�
+B��j��*$t53�pǣ��@�e���/<|1���M�0�r�P5�A�O|P�ᕰ�=V�G��j�Φ/�S��'�l�X1E����H�����5?�=�
C7��QmV�1P�K����l	AEC
|�n�'��@�J�G
�����.�KL�s��G�+bT7a�J���2_7bG��g;����Qh"�ʹ����Ѩ1�D����Vѯ
����E�N��Դ�d�D�W�
+endstream
+endobj
+18140 0 obj <<
+/Type /FontDescriptor
+/FontName /MUDTES+NimbusMonL-ReguObli
+/Flags 4
+/FontBBox [-61 -237 774 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle -12
+/StemV 43
+/XHeight 426
+/CharSet (/A/C/D/E/F/H/I/L/M/N/O/P/Q/S/T/X/Y/a/b/c/colon/d/e/equal/f/g/h/hyphen/i/j/k/l/m/n/o/one/p/parenleft/parenright/period/plus/q/quoteright/r/s/t/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 18139 0 R
+>> endobj
+18141 0 obj <<
+/Length1 1625
+/Length2 14063
+/Length3 0
+/Length 14908     
+/Filter /FlateDecode
+>>
+stream
+xڭyeP�]�%��N���w��.�KCpw'H��ww
n��!�Cp�~s������?��9{�����ꮦ"SQg�d�hj!�� bbcf�(�M�\�M
��
���

� ����	�� a��h[�$,� �� 6>>>*�����
����TӦc``�/�_��� 7]�V �w
;G'{
����Eu

 ��`	�� �+���*Ih��4�.&v 7S;�@hf��jA�tt��� 0���75W��O� �����㚅����_��d�btu�x ]V.&���
@3;7�>얎�rrq����>�T
]A�f.@'�#���Կt��M@c�?`��凧����ߔ��>h>P�	�� �� ��ej0�:ٙx~�� sr�#���`�_
+.V&.�v��4���_y���M���<������j �\-�,���?b��>b[
X�����#���_vs7����-\�)�ߙ��ab��`�	0��D`Qr}����u�����-�i��H{�����=�?^�����ߩ����L�?�_K�e\
+��{�w��l��2��y�7���Q��_Z���;&
2�(�'����2���t�zX�� Af� K��j�c��P�bt����?0�����a
4�u�[~�A��ߔ4��,bZ*�J
��n��S�c@�N��w.����y��#&���fb��0q�� x?�.���
��:+��\�
 ���Y������d�o4�f���F
d�`�1g�i�
����|���W�#��8�3�
f�
�f!6i��ܜ�q	��
6��P��z����*�n���-�r��P�I��V��c��=9���

;��T��<"_
+��|�u�v
�� �b����9�M(]nV���qU5�/0ē�
.p�t��X��P�̾��cw�5�a�
�P'
����9248�}ݻGȐ
O%`��rL�
�4v��7{�~r疿y�
j�|*g|��~i�c�_/i�)@f��
��U� ��MR����1��҅�`V�R��.���s(ʨ(�G��������ӟq����X�ـI���Yx!-<�
�ҳ���Ll#��<E�
���hzK#ܕ
5�!=>��ue�'�4/�U$u�,�Eq8�h�"��e�GG�b
Q��>�t텝��I]J��|I����n_Gx��ؕ���߹����dK���w�(�M��3~�lx�<�|������� �]����
O`�.��G�:
��jX�e�	"9j	����Ws�̋�2�1ѵ�L�iO�<V������%G��
YTZ�5�}ۙqy�
�[7 at eޘ���k����]18�7�|e(�HJ��ف	=��s��c#�#�C�
�Lh�V73ڳغJ�,�=gv�J�p�65
l�(��pR��j2�?'A�Z�˶�3�nj�"�Ӿ����ѕ�q�(G���{i�)y3w��e�����r�`�Cq�f����*e��:��W�Rxrkx����%�yK�O���u�_�jO
�� 8u��u
I���m���sZtIG��=�c�Pr�#�⅐ 
���zZ��ԷSF�s�H=H�,r�W%���<F1�Dvk��*i�$�P˸x
+�6��Q�
�:�8����AӇ�K����#^�����cĖD'K������_���O�z?�V�-~�
��\$,I�}�ؒcrp���:�_nX���7������������
���
+��N*I
C��$#cן�^�i�:2�|F�B2q��
)#��cL��Ӥ�ރlY����@7�¦q����������:�����pK��N_�$E�n���)[g'��t#'=�!�7;1��a)3�+H�lӷ����2��72�I���
=UN֛|g7��Ikȹ�0�	=�܄����s�Z �d��6T��qo"�)W?���
ѹ���gk3�O��U����Q�\T_U[�<��c���ˆRZ�E��z����t�1��s��y����`f�����!
�k�A���յ��T��(Vkg�5�?u��z�	i�`�7�!AQ�9MU䧣�#�~��DCa�<�ASo���R�EJ�c���ݿtnv���	�aY�6����FZ��:?�z�������l�Ѱ|��JX9�-�G [...]
6�F'_�Ku�#岍B���.k
+�������^���7���W?
(^� `Q2z����E��!4\��
�$�I
�b!4�l)�zg�O��z�XVw���JV�������qN�_3R�J[fTTkN<i���9�6X���a�e��Q�C>��X��&�n��>��e.��m��`

+bC���	�֓��_c)+�c����J0���ѷRj)�~L�N�3]��F���T�#|~󒏴Ȟو;*�N���!f!��N�2�z�YR(�*����!iw(
+IT�E����X�f�R���l���o3���~O�
=�"W$I��&�ٵ�k�8;$ۃ�f��!B�4��b.;��`�p��O��7�\~2c��=���jf��X��ɠ)ei��
u-�qXVe~�
+��B�(�7�b`l��j�
�=u��4:�
Š�PW�l}�#3oC�hڲ)�$�X��d�.?'j6����w<��~�>�t�
�����%بj�LY�,@�g���!�cd�BzB��Hs%j?�2 �eۜ1Q�aU0+�M�ؾ)��q��I��dߚ���
+��Bn�2���Xb���B��0�M��9�C��X4�x���c0�ww�>���H��IH`ɑ�df�
)#�k۶Y+�nE��%	N��j�.�mX���x�!�}�#����X����.�3'��4
{�\ť�E�p��E��
-�!�o6i|Պ�p���'j����K؝U����{����z9�7?<��.ѧ�H��i����f�+��r1M*J�:6�UX�
װ[Sf��'n�I~H3����b�M
�5
+�n��͜_���.�g0M<�G�7]f�wCnn�[����mGs�5 ��LW
��{���\�4F
���j]��j�=�w���e�(��kIƅ� �H��R�ᔺ�J�>��
(�ͶW�}�-�~h�uHU��܀���Aϊ��1���o��:5\�K�V�
��;
+p�bL�
�d!��P��%�@�\�4
+v����
�}%9����.K=?���N���
E����r#{(�ɋ-D����l&�5��x
4���pa��u����$e��=��5n����q@=_�'���M��3�*8���@_(�0�Ё������
h��hh����Zڃ���4#�Y"�2[S��M�uɂ>=Y��%Ľ�A(Q@�o@;����XR�f�ႎ�|�@������!�1�0�{WzY|��g
AUik�
��	4�Ƈ�÷���N9Wzśi]��4��Ӈt����ʢ�|�;w��$�(	M#��$~5𘵄��hh��f
S��)��DJ�
`T�u��&
ɴ���X*Ry�����
/
+�N�L��g��H\m�ͭ������y
�X����A���9��{�5���jM7�h?pA{���h�h\vL^s�]�%��*Kp K�m��qYfQ��@�i�l���x�Y��(;
C�T`X��#K���fK!��8T��A��e�Y�\���ן.w�6�\ڱ�{D��U�U"l

�9cJ9UN^%v�
@L�Y;�a��/ϣ`�~>3�5L"�_%��)��Ou�T
���Q���C#\���'tIoF7=V��
H���]ag��Ƚ�h
�P
+8�e��>a7�ԓr��L;-�a�E'����
W���Utƹ�U*�MRl}˩�1.U�7�
C�[���.�SB~]'�3X
:�n�CL�k��G�>�.�/cY<[��6<w�o|��?��L�2íGm���ܯf���!A7���1I���t
o�����N��i�!X�ӄ�8g��ӡ�n�Q�V/�HB�f
�zX��#sΖN
l(SmY�_,�gܨ��#�
1�iu!f��(܁k�o23(%?��eN��~Z���m�㌋���IjW\��.��I#i
7�y��X��5�R�
4���'�'{�tlr(���CTU�Wp\2���#��S��BZ�5�e4\�=�T
\���9��Q�
|����[Yj�-���%I
 jy�Ƌ�#KiaC���[�f�����
\]�
�ѫ.
iv����� ~�D�l��Q
+��j��ջ�o#e�$Ƶ�S,��
#U2�
��9Ÿ�h��#p�~�sF�k>��H�џ�bl�4��cj5'a�J@;Eoۼ��9%�-r��A~;�v"K�J�Ij�c��m
���
�����ٲ��_���5
Ԫ�6@����j�W�)���M�_�Ǚ�]�.�Mo��y��"K����29
�� ��fp�
��ˉz���ɚ�/��
~���_�0���
\��Ys��3��q��%	7���O�r�]��z&�dcx�'�ǰd��
+�m|��D��_
c�}
��"H�Z.��	M
\v�r#��oa{$�x�{y���}�
��3�G��rS	)��H�j*�	M��Q�񮖈ce���q��)�}�2�
#�*>SS\���PS���a�d�qJ��ދ�W t_Uk�7�|
+���
)䬪W*k6���зMm�Mg*|a���T�@��KM=��`s���'R�m�
+U�78��pT�m<��&�Hl���e�KFӅ���r�7X�CZ[����\o뗨�+ύ�[rMQ<A���5�95K,����r���Y�9df���N]G���x"�%o.)4
:"L�NZ���n
.kD=���ߣ�?���x
��(��
��������G7�h�������E�O����ͣuz>�B�UuSe��ԃ��<s
�� �\��j��E7�Yp:��U�ƾ�

�G��+���!,������i�qq>w� ��#��F=ff�0�9(l�w0��tSH���z�~ ��"���I9�|�
lUX0��,U`�Z>#��!B,����ɟU0����i:s�I�{��������w����R9PQ�A�
���bO��Y�q��Ú�6ۖG\��mi�d��
�,
9�׃�j�*���!��S4�Y�>@I\ڟ0�J>e�Ƀ�W�?�E�r�KOz���ŏ�9����i>Y��:�[N���
W�	��n,�bظ��v)��V(�࿞�=�gQB�4r�4*` [...]
+��šI�Uy����3]�Z\�Xe�֟/�"��E�_
�\����P�q�X���s��㐅�I(�h&l9��+]G��I�1��"��Y
+�	��q6W�
jǘ��+Ť��F
\7;�{���&ͦ�\�E��4�	���e)l�=ؑ��T�"�mL,m��K �Ч�	M�z��g|�B�)��~c(��+P;XQ<�N�AB�vR���+U���a�^﵃q/�h"$�lON�vA��>]��~g/��'� ���E,��ʳgY�ֽٟ�2��BTy:N����T�8��0
+�B�;<fpQG�u<~N-��JX%�3�?dQ����:����<����E��
Zsy�99A'��Z��yK���Oγ�X�������5ʩ
+�MW�]6QR�P����h��JU�m��7�
9�gp��������d*�\����F#�m�K�a�TV9��]����4��(��
+q�@pZ�!\�h����Y�i��Џ����(Q+C�H��e�9��ݞ�'�Stq�c���. �᫮�|���#�â�v�
+*�D�6�eմ)�$m��#�:�NXZ��ƨn
[�5˂��J��1
OYCq
+��Jd��p{SW:$��q�7Gi|�ϖ8
�T����[ޘ�
�F�y��j/�'��X�
�����a�>��췛���
+ͺr�o)���Gol\(��~��2�_&�>������+LSt�]U�1OLA�W�=���H�gȋ�c�0d��j�!�Վ��3Ѣ��Z�!����뺙���~�|K��Dn�l��,&� ���k)�r��'h��j��z�`�rm��H�E3�?aӣ�Nv��]�74�9C1�{A����^�sd�z��i�Ź��iM���}�`B����g
[U?T	��AQ���p���q
�߃x�|h-��2��
z�MY�����
��|���-���Rm��K���A_�f��Y
d�7��I4��i��/�\�mةwM�݂uPZM��d�� \��B����w��|n�
,'�x�~}�P��J����>����=��'�Y�u�:�Kc/c&4q��•��j�y��^�,C
HX�}�:ޜC1;u%���M�Q�^oJD�H�$�ڄٶ=���s��
��b*�J���L1tRؼw�fT�ә�#�:��z�!�M�u�bT�+�+��E��8*M��q/
�pݫM���Z�Ec�Ii��>��
����In��\Bݾ�i��mm�����
.}oؕ֡B[R(yO��
�.�t�z�Q+������Փ�3��Mj�T�Zխ� �='e5ݜ��Z2j��l���ܗ0�h�*��
N
dw"I%���z_�ح-��P����8���␐Xs�d�\l2k&�3������ʞ�
+��
H
�s��3����������2%ދm��F��P���%�����$��8V���y.{?�e"�(���b+\�.�t
��t��~ڴq�L���5s!A
:�r{���R�������/]̗�%���B��w0 -�=u_SϺf�������m�y�Xn�94�G5�QL�W�^���3.�5=�=��:3��h��'�w}��4[�t�
�C��m�$j^�S�_}y/�
�~�C�
��0z3t�{wQJ�.�$�W����
cȾ/��~�	K�s����M��/��k7��
e��ƙ�ݸ���"�R6�J�Г=���b̥���e������k��pkoy��\?�׶���ְ��9)d��:m7F�s1�
'o->-�{�V�dCHіu�@��X��#���D?�
�CZ*�k&!Ҽ�����檔^ߧ�]��
6�d�=�mh�c�n�3]�ag�$��P��	����K��e3��
��}��Qy$��+���f��Ie-���~I��R�;��‘@�vih]��\�EWC􀊼�
����������C�W��a�b�#�BX��A}���M�h��.����/��L�\^
�
]]S
P�
���2[A�W%j��cI��6.}G�3���ST��~��G
^��]�ur��}z5�|�6
�{�V`d�WX���h����~�~
d\�U����Yq ݥl|�,
�;/s��QTT��6q}um�F���6�p��U��y=mfV��DB�ŝ>G��mΒ
�	�Kj��n��ƉS�N�����8o<��=�
+"�
+C�S
|g
ff'?�}���E�<3C��h=s46�v��셯��,�A�MG�[�2LМ����Ҁҟl��(Ґ����s;2f
����%�Jd��?*�u�D^i 6=�(�hk�9�������P�n�0�I����:Dt8����Vm
]��S��&�-
�,mD�V�`l�M'����J������g�>=(�aÜD��ȭ�y��Y}~��;W�V�Y��&��Md�X]ӯL-�[~������\R��F���ۧ�:��"��QY>�޵8G�X�|Hy��v�Z�]��*�k�#nb���U-wo���J>k�
�c�����Py�$Ԕ-͘�6�GԸ�� s��ش|��G
J^#�p�O
��Uq���I�+�(*�r^�5,Q�c-n�þ�sA��w$�����X��aҒ('�Cz���l���vdFg��&��r䠕:	*�������D1¬̤�ϋi��
|ї����1��dX��o�m7�*��;
�`��4��5���m��`&
3����/��B�@�f��d�	l��`���|
\\�_O۳���ɨ��
�F���F
+�BI�||-�)�|��
��5E,ɴ�E����Z��g������$��%����
+��^��ŏk��rY
�
�CF�o�d�x��=���b�G�"�Չ��"��F��x���s�.[�V�*��c
�:m���]@�^�j�!邨�g�{q״fM�2�96���T�$��yo�f
�1O���:��
+��3&z���J"� l~��4%�sx��x�#�?ŷ��������S5���r@����ߩX}�a�

~�P�r���{�n��`z�
�!�� p����z"l���n�$�X�q���rC�b��!GlbO������\����Y�|�^5W+
%(�~�n|��S��
�#
~�[�I6k� ��-NJ������n!������|na��7E
ߛ�{LS��60����ss���V�\�	S �I��o<�Es8
�i"Up-a��AH�uf��1�\A�U�"_�:5����ϐ�����?�m���+�����������/���w��l�HP$�N>~z��b��Eq�Q��]EZ�c���Y4q�N
�'�+�|+"kL&���&�y
 *}-E�f�S�����'��*�
�6Fv�H~ �k?&GP�o:��pYo�&��R��w+8W��^�Տ��>q�/���ÃzId���X1=��$����/�R��g��-�U�ىi�
aL�~�5�- ��Y\=�)Nx��7C�R7`h�L�G󀆍H#�D�����uv�^�k$J���#�l��
Ar_ ��Ol5*g�7�t�E�W�U
ɒ�DdS�Ot��M����
�.t1�S��iW�S��Uڽ�,.��
]&�OX�O,��I^|�<�^d[��m<-��;)0o��flZ��uoE�l��kn鉸��9�q��/�c���8�@g�Ŷɩ9���?�OL_��2�U輋L�I��ݠi���$�l������=��iG}Y�v�Шa��M�?`&���'�����|ISիu�:F���KI�-�OCҲ2n<��h}��Oc%4���
���z�����q4���Z+�����/�Ї�b`M9��@�:3��-��H��"L�ʙUF|e����yQ�WƯ�]�%<�=�άCkJ��'R���ދy{�8P4�����n��B�f:�Ce]�WW%�W�������	aI���Ik�D@Ֆ���ϼ�s��%Iߔ9����qpȾ=�=$�'9��B����ddv�^:M�B�LM�2�v�r���	ee�7Jxw>_�m�8#�3Rb¯��?�Mk�	���җG����J��s�eb����3^	�m�
�s�hOO)�tg�ձ� ��1����=B�TX�� ��� [...]
��֋����-�O
�ff�����:w}��
��Qʀi@^���*���
>i�
u�_7�v��[|
ަ�&I�~�$/ӎ�6�#��'	���
+�_�K��� ���r���V/���l)�ƽU����<z�b/�n{��ВZOa�@O�����71~4$��EL١�2[A\�
���{7D��y+9?V���	Nj.�-��"��%��Ͼ�Ԉ6����c&�g�����CM�|@����h~�81�q���'�f1���W�0�OF^柹(�h��bu���*E��py�j�{	�u'Š���<�N�#RTK�f]'���H
+�,�gL�L�#
���Y�4K��4u�kAg�Cr�/��~���LW��MLR�
��
��2�S+�y�f#��F�H�!������ICݬ>��-����
F����tᵄ�� ���߉ƥ<��
+n4���.q\�����n����f�`��ʉ��S��Q25�J��re"Q���R�����q�%���}���~4Z�v�
)�Q������
f�QUMB�ż>/s
1
��ʉO(����"�"Jr����m b03�~
�1e�w�D����B�o�)��z�1���
4���HRm?�LW�4�D�E{��[~���'�_o���.�Uc�L�%
+`�9�� ������
2$�u��@
�/���Z�Ւuz�+��%@�I�'�1��zf at Z�`����<"��㱢��9H�0��0�W���~�H�_���p�ZDT��#Kq����pc�+�3U���᥇�C6���+m�F��*2Y�G)�@���(��V���ߕ���uJR�D�2��>��H�����E�3]�_8�$�����ei�&y=��2҂���cȺ&��K�=��I��I@|�\!�C���Z>�
1��&����co�c|2;�a��j��yL�֝}�I�ÆK�V��H�ima�;���Ё�Y1��T�aI��L�
���Eu9��
�7nH&��(]
5/���F�q��@
��M;N�S0�C�kx�T&A��Xn��xb�Y=���&��
a
���\Z	{�%��ʌ
{
��HX�-&��8 @����QD��&�G�<
����+
�\z�[6v�eL.�OA�|n��}��#��Yc4Jv'n�n���'
д>���Y�YhO{�t
P��+:�+���?�+K*�V���оI󘛄�'�*�0��8�M%u�C>���ޠqm�x
"B��:�=\���x��؜'ZwkK�𓛡�sG��ܹG��E�wmP�����
F��Ibr��$��IMg���ck��&7 �Ƽ�7���
+�wD�v��K�#q�40�΂� �Uoyv;�U��5K5(�
��7�B0� h�6���J:b҃�T����q����|��]�^��p�����
����
�4�]�cW-m�<���A�\/س�4�s���1U2��# G�w� ų��t���m4�s�
n(:�q�J
2�)�����W�)J�	���7��	��b��Z�*+����&��NP��jD
�ϳ��C��)A�g]I�4�s
#͹�T�n�,V��Gg�~����26�zU�oB��Y׿���k#;�ܕ���M��U,�	v�.����(��S��G�j�D�#¾��
H~
�@�^$v�w��R;��5
�X�bʌ�}$+���Nƾ���z[>�g��������Y��'�D�8�/q�CZC���B���j-E����l)��_☛��O����/OZz����*%�@3�J�Q�
H?e<��s�K�|��y9�r���F
Y���ɿHk��:��r���Ͷ=�A@
��N�S�0 ��p�c5����V��z'�z���8�
��k���u�7G �F�[
A��#y��_�'9p����
��Q�B!���&����}q
�a�#C�

����nr��	�$���<���ܬr�[l��d
RX#�
�ۦD���@�2ʴd���+{]��0~��*��m��\�b{��iF���tK��R��w��Q�F
v��ݗ�p�$b��o?��Y)�����tO�'
+/���3��_7�v�	h�a�l��N=��
�����
1�
+����eF<�}v3<X������k7��i��e�i�˜i��"j�M�ș�;���ˑ�H�o���>�_��VW	P4Q�DS4X��X-Am��Ziv�
�(ߨx��L��{�|P��&�'.�TS��<.dm� �]F1����fhe�����@�� �M6��"��Y��^�:����~`NKH�aO��_~0���a߬Jz
��-��~����gj�V-������r ܥ8�]1�O��,r�
+2�x��O��it�A�~��C-�t~L�w��N��?I.p3�SD2�t����5�,&YY|!��)�� ��;?Q���p���P��?
�Lt��
a
��]�VU��x
4"U2]X]���+e�� S{
�~D��
�
+n
+"*
�����*��)��7�@v�=���b[�'�^��|Dx at 8�9탋��Z�U���U��E��
��X�@�[�
R5��� z�3�i�<ɋVs�Ƙ�m��qv
+$y͡RQ{�
1� �������&#Bݦ��(E�c]d� ��<����a�[��>�J�q��H��~��VJ3����]�VA���L����c�C� ]
��z��N��b�Bـ6<J�|6�)��)X��D�
"Ӊ��#���&��\FY��=�"b
����iu��~���_��s 2
H����A�o�Y�QۦRK�K��^���0�����(��!�:�2r�1�
.	84�_��n���A�':�����px_J�:���ՙmla�&
1�lx��탓-��6Ҷ�p͢�^��w'T�w�X��qS at Yj1�
i��"Kr I�ݗ��E&�O�v)&=��i�2Sq�&�u?^*�`�A��"U�Upkem��d�S�$Cz��
D���C�c�iL���	��
�(��g��|.޾��w�o�ij��^������&N��޿�;��
�A��1�B�@�-�D��l���Z�����i�4f�D��+�5�1
7��U!�$�V���n�L��W+ɵߊW	�3�f�[����������LK��e����t��9Ɠ��V����]���M�
Zۃ^]x#���8���
����t~(�59�|��
	W7��L�/Bx=���M�Y}�#�́xF��ۘ�����.����׻��aL��Q�\���4g��\/{�n\
Ӽ���n��D\[jCĺTiВ_�ͻܖ���v	���.��r�B���~����zʐf������:sT2qz��T�<���l���GiP��8�e�Hv�L(�l��������X�nfR�^Ʊ

]���<�MWB��갡f�������TƼ
+5�y���I��>��z����e��B�k8+���K�K��#�)]Wj׉�~2���I��]��3�vZ��u��}�Ie)q�G_K��i����F�~�/Ā������kR�A���
+�������
'���!˃�呝
��>˭)%Utu�;��M�W����b�	��@��
�C/g��!���Z�c�Y�x�Z�V�rg�ׅ��T���v��-f�;�/�
Aj��U/|�P�s�~��d|[{����.�"�\T�5҇���%/���p�u(���j���Z�˛�9
+�
�%�x�.f9�<c�@�]v�g6/S�Z�X�
����L�2���M��K�c��/"�w<�!�Y�"��3���>�>�k�TM������!w�-�F��J��LDŽ:���ujwp��.
v����_�)�U��i�ea��\
�W�ܘ!��@�>�Y
KPy1�k�t
G��s�ҩa i˺`����)(��@�|�!e�xO2iB��$^X�4��t4@�O.�V���m�GV���'x&��-)O��

b��m�V����]Kp�
d1���HMO�j�m��lJ�y�y5b���v8o�z^5��%ʯWD��T)�ᅌ2��J�4�Uۋ�Q�2�zB�iq�'<rk垒Um�Ͽcc��ϕ��z�z��0��\��9�����U
��g���ʪR�4�8�u0�UTMW^�
��Yi��؅%<:�c�L�]V�R
+"���
U2�#"�T���"Ѡ���J�*#U�[qM�(r�4��e}��MM��|���1�`�_3�2�����V��.�Sn�����D�9�T���%ZwU���ZCV0�l_
��}�����
ˡIs�
��z��w'���6�,E������+��o5"�����	�<L�$_O�9
b|��p��
��倻�xtu��
���D�
��~��Z�-�0���L���=2���t���|�X�l8�#��P�7����Fy����qٗ`��1�ԯ(��
+}��
����1�@���
�L��|�]��$j��z�.��󮏡���d�ASL"_�[�S���s7����薎�1���6F~�R�o�v,G0+rF���E���um�	C5?,EA��°��|S~��|gܨ��1j����͛I�
�+��Ýf��%/
%~���Ί��5�4�(�G�ܯ�=g�
^T�L�,h�e�u�̑�6�Vu�r�����ѭ�n4�\�ؠ��@��v���Ok ����mU
g��A�{�T���6�
?f���l�XzZ������Ojl�@�[F][�RVQ�.k�v���s*z�Hf�H,��p0~	W��Zyd(���ZS�;d�����V�D��9s�s�볼�E�
Ի\1-zB���b
=�ʃc-w��9FR���AV�V�
d")�O�_k at F
�q_��
,��=��h⋃���X�ѵ:A�+�X�wxKL�TƂ��Z�,���
��쫰�<�2 ��� ��)[𪈌'^qH}�,��a��u(劢����W}��P��ΐ"�׏�ݕ,���%�G��X���R�7
w^
��U{@���1^�^���6Rf(@)�g�<w�`t�8N���v/1[������RxX�tñ?�
�(z��.@�
��v�0w���H�
PO���?����@{�'@_��HZ��1�Vf�����o[_X^��jľ�T=|��-����Q�NNH�$�eٝy��D��Mk�
�LM#��
|co�T���
.��#Ņ�&&�/�5|sG؏VgT
_��t5L�Ů"��Fq�
�Y�T~��[���\Z�ބԍ�7�Ӌ=��� ��;E��6Urdt�̾��{���ɷ_��袕�ۘ
����M��D	.��yWM����PS�(
���r_�`ȁ��/�A=P#>"P��SR�"��ߡ.d�����z����rf}�PHɡd�r_�{�gt/��0�O�u,Z��z�Ea����4_Tk�G\	��
��(>�u�^Zw�Y��Mr|�E�5�)��
�8&��(B�_�W�v
+endstream
+endobj
+18142 0 obj <<
+/Type /FontDescriptor
+/FontName /BVTPQN+NimbusSanL-BoldCond
+/Flags 4
+/FontBBox [-139 -307 822 975]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle 0
+/StemV 114
+/XHeight 532
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/Y/Z/a/ampersand/b/c/colon/comma/d/e/eight/equal/exclam/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/quotedblright/quoteright/r/s/seven/six/slash/t/three/two/u/v/w/x/y/z/zero)
+/FontFile 18141 0 R
+>> endobj
+18143 0 obj <<
+/Length1 1641
+/Length2 7948
+/Length3 0
+/Length 8787      
+/Filter /FlateDecode
+>>
+stream
+xڭteT�۲-��i
��[pw
o���	4
,�ww���A
��

�~��;���Ͻ�G��VͪYUk�*zj
m6)+�P�e�b���
,\]��
U�^A�V�G+E�9�
���K;͡ ���9(
�Zd�� nn ���=@���
����t��YXX���vXx�
y�t�8�?܀`����L�?�P[ ���5
��L�j� y�#���	
W
0���:� ��g ����S���\؟��\ � '�%�9
�a	t�
���� ��o �`�l�}�( r��Z�.��n
�S��3����{&Ӏ�@],�ANP�sV
���ښC�v=� �������wK�g�gjrt@�
�߹,� +�����9�3��3�O�. G��+`8m̝��@�g�g�߷�w���ҽ����O4�׿k A]�`kv4.�眖���6 G4����h
pq�e�ru��t�sAL�g���s+�#�`�F�P�@�S��g*���D�H��?"��N�j�_
���=��Z�
V3wx
��
�yӸ T �w
����]����Y�?�� ���OG}�_%�f�'����ͳ6lB�BYA.r ��ji
�6?����sE�`�#�Y�?
`�����c
��w�-�_��꟥?
��p%5]mu
��ߞ���<P
O' ����W�X�����+��������-$��	
+��7i��p�}V5�:�< F�윜\�����>�����%��� iC�
��g�߆߰�������s��:��~ �h��mb)d����%�
�1���
v*��)����|�K
[�0{�	fo�"�����������nB0�d�q
�-sO���v���
&%�i��Q�'�*�^�s�m��ij�? Q|i�qF9�f��u��ǧ�r��L�KЁ� �[[ppȐ�w}��?248���g��%;�^Ĝ�7�:�i�|Qo�
�΍_��&�}�]�m��C�%��Ji
a&�;��
�2se-���<I8�9���0��?��9ecO�UU��1��?m���K�jLv�
�Mr��g�Z���YP at I�\��\��=#!�Y��i���l2�Z�Q�
+
�7k�:y�\�
+�T^ 
^[�RWE�/}O�C�
x
Q�ݴ_��k
n���4�o�\�O�h���}?��q�mt�UE-���E;���b-H�p��u$t�S�-%r=b����(
r����MĄ���s�=dk
��{�R2�Vu���b�ؿ���U�Y�����d���qy��F9��"x��[��ŷ������Mh�3������<�E�J�*��fY28S[�e�N!I;�i����~������>��H��"�`]g7��8ھY�W��7�;� )�,�4��p�f�S��t�]ǭ���Q��eG]�,C*�ț�)����f[[*�����iO�Z���B�"4ʓ��\u�D�\��bﺒ���
�,���q��� �
8
�h	�7�nW'�VKf31���:�Z1;������C	��׉/��\=��b'�U��ᴅ)��^��=��&�3}3]�>cS�/�e�O1��V���R��E���
?g���#&�ke�E�濌�
���ũ��u:�0���:+��)���>؟WN ��ͤ��f�y�v������
+)�q�8
+9���q��r2	OW���+��,C
��װ����j�/'
ts���w����H$9s5�rGG�q=�� �\<��ԍ��C��8W�A��L�D��Y�n-wQ&f�7Eo)0(B]��v�LbN��#��e��oީw���TD(r
Ի�kg4�'%
twl9��v�`�޶%M�M�T��ٲ��Vn��㐠lى|b��Y����ئ	ٹFǏ����j��}e�5�����O\
����x8r#�
���e-*S?K|w
cF��4��Q��)���,?p�s��Lf����Re�^B7�^.A3F���J���j?*O��x?��
I�c��T�܊[2�$�܇��
)�.$�B���[�æ�]���
}DE�0E��.|#_�
�H[���:�Д;qT|_w�߆�'ڏP

~J�j�ׄi���Y�
+5
�T���-N�c����}Z�Tz�����d�Q4�-+�L���C\�7�^���8nW
d�dEK�f��w���e%���>Y1+�S��ޙ�}���6��x.h*$��+�V���1�N΃�U�nH 
h �۽>
���L�f�e�z�Y�,���fO��������
��BY�ʭ"�4���7%k��ڊh�
>�>���╂��B�
��Nu�m��1�x
�۫�7s�i�[�F5��� �����#��t�N�-c�O����G|�<H�L,�E6J<��!Ê��
+_e��ٺ� tV�g.Ћ�6���vHcJ����z_���xH�&��쏽��|��ymG[�?,��}/�l�
1�JIJ
v���;f,�痊b�:��c'�m����s�Tđ�%�Y��
����
�Ҋ٧#8�������M0;�E��6���Fb>O'�o[O�b
�t�^�Q�N�H}O�2~E��ۦP�k�yW���,�-3��,�}4�~��
	�}��
�9�]�� �#���IQ��6U��W
xWXˣx�ܾ�w�-5�dp����>�����痣��U#�3�`{�~̼ɁPn�J<�<S�`�aeHi'
�	��R4Z?�y��2Ǹ+
Z�=i�hx���P�Lz�c+
h��7[�&�����4
WQ�����wmq!K���
��z?��U�}�x�m0ي�YߑP	jX���
�٧�)���JM�R�Ava�ӌ�ġ#���灵����!|��ׯD�������L' .� ��"}H+F �e����Nh�3�hg�����~t(��0�����5?](1%1߸��jL��Y/#o�jB�v
��]m�9�(��Ć�p�4�����\��ݚM��]b��h�6c� �T酩u�
|Ζ�艎�a���X/�|��
o��*��
l�F��]��l�Od��ax����Vk-
+[{�E׶��vn(U\B

H��yCL��S�s ,{A���gx����toE.:/��w��T�
0c�|7��	_cD�:I1�!g�^Z��ϴ� !���9v��|���g�4!tM��?�2X�('��Q�DE��3v�!2倫�ʇ06�n#8kɹ�q���k=��>���d

s�^q/���b�6!�(�IÆ(��T�ԟo��MPf��rt=�g:�
[��Y�U���
�Lx��>�[-ώ�rP�j�>�%�<�Z֩��ʙ�{����
[ڷS��*�B�4�������#����&^���\��8���E\�G��>�xM�m���g�P>��@���@D�}�v��?�#�ȹjfў�����xd�('��T�l�bq
U~4��d��0�hS»*_b���s�g��~ok�Vf�KJZVʜ��j��ڒ0C�*�*
z�����iPL0�Tj�0���"Q
]H���E&gҔ͍��
���~g��t���V���+̸^��E>W��lج<+�X|�2!Ӱ�5W̑t��E�]�
�[q/9�ՄoX������͙��O�2�����I
��p?D��[:��:�8��}&C(��3�M�V����Y�95S�NfoDI��0n����ὔ0*{�0��C��$N��[7S)�vr8Z�f������)J%�D�&C���"�:�]���oˣ
I�=��*�@6:10����X�
������0��6l+q��rgU`��Dz
kg�h|.��c.��'�ő�ˏ��4NH��-
˔'�N��+�K�<�b���2��$�0:��w��
+5���z
3k�@Q�����e��rF��-cw2������|}
�=MYO�$d�W?��NX�x
p4�����p
u؉0�O,�~�����
��y0g J��	��R�٢PȬ+�K�p�SD����u:��&�������4#�U	�Q�c|�cm��
����y���G�IM [...]
%Ӫ���]zd���u�U
+�'
��"}N��
�c'�
h������yh1�Xe0!����A��=��	
^5R��b_-p�K^��]�M[>�evq�#՛SQAj=7d�u
@�a�r#+�@&a�p��hf�Q�軘E|79� ��\}��#.
+�\�f�n����%H�&�
sV@
kt�S$%���g�]�/�֤e-ր��uĶmJ��*���n�5��*���o�V)f�P͓�C�	��?�^�uCHH�U2�d�����Z����&oT
��JA�(��[m��Kn>Gԇ�B��|�*O�Ì�C��N�WϢ�6�NbjQ�[]��2�$t�ӧI�~��3���8K����t*��~Q��R��
.ͷ�-_b/-�+dS�U�$�)�����_���Y���Q����;�O2
���|�yt*�:s�BckNh�
��
�5)��hv����i�.�'��	�r,/3��R(n�3A�DM$��H �[�����!b�N�
+Jۤ<I�Y�%@�H}��I�`4UX�'����n5�Lt�%ߎ�G����2�TP����v|OF#��q��A�R�
+f�����
&%j:�5�;z�۞��n�b��o-�H�d�U:���O
�R�M�%��녞6#���1
��O���
�W�Uǻ*�4�6� �f�H�dq���"g��q����_p�;��M�E
+}�7[z0Ys=��9
�,
r����I�Ch�
+����_�T
�	����0<����c
i�����
+r?F0M�����"��|��jcQ�(� Y0��sw"w鸓_�ϼ��wI6R
�'��0EF�E�;5���cH8��?x�w/����8US�0
.
+��=���9�����-���#
F�l	����"�A�v3�
�/����N��J�L�N	����Ox��abQ�ޏ^{i����b4�6
$�`��`�1��'�k��ɶ)Ƅ1/���&��O��:��
�����}^IA1`/��1;l�.8����k)%�B�#Z�1$
�L���+Jz�֥
d���T�9�mۻ����<^��JOb�۞R���a�M��P4)�_KG���@�
KP?Bk/)�;p6HMk�G���*-F:Q�g*��[/��L�"e�&��|����mv�7�?�
J�h�M��M�R<w����e��c���x���v��'�q�%
`�(�?��΂+3�u����Ҿ��z����q��Tn��/�Yls��J �to����4�2.�f
7��z\
T1��ra�$r�����]@
�Ӵ�gʗ��_�@`���'�uB8F�VC��On����ɤ}0��7]K��{uf��lCz����3����|��N���ŶBү���҆

	f�>����%�{���^�h�\E6�h�
+Lۋ�M�7w�J�/��n!:�ѡt�o�S5�?#
�W	�t=i2���v��k��F�x�%��ԝ\�n1�"�;���ؾ�#M�!�S!�q*�C�b9�)+W.��~�!��aر���4������h��r��o9��*��pin��t�����6��L}@ä1���7%��ؚ����.D��f��C>6S�Z�c�Z Af�����w�C��:a���o&R��'Ө[AC
�d
�^
	��p$��Hޒ4�p��*��To&҈]��ǎ�{G��&����6Z�5~Pl_�j	�a
+��
�a�@�ޯ� �by{zO��fX�-��91���s'�j��ˏI���(�^9�3�n���Kdv��^NAF���^��F��[�?�QS�3�a�۶�[
Ny����[�M��?bPhE\�̏K/7��uLB�B�}H�ŏ��=L���w��P�s>��p�E9����x��(�2¥��61�9�'ZOo�O��M�y� �}��½uo>.��r��<C:�3� ך�����
�kO
gK�}���H]wL��`zn"F�"��8���?��jU�4

,6)a���:Ƶi���6"�
W��"K���0��jSIh�c9՛�8�u���U�Ǟ�f.�����Qha��|dsɈ�%�B�q������X��h��:��j��Y�_��	�����R�
+I� [X
+��jxǥB�
�(B�V����L��Iih��*E�*T9`�qji	
�XEg��P\�v
/�z�t� \j��jn��S���ڲ}=H�;��Ǜ��4���Kk
˃��� V'�l
�ӭ�;ё��Rɯn���#�$tttx�zN��zf
��
b&ʕ9� (Jm�O|$]��"�|:$��P�뒚P_�=bRԐ�� _d b�N����+�T����A��	�
,/���h�g��Z%���[g��_��b띁lr@���?M�
��c8t�p��R�ba
`gs��5����t^�T�WEN��X#�����Mgg�G@
^�z��0t��	&��k�Ę�9�=�ϩ�}�(��Y�q!�)�k�	5���d��+��#����O����#���J��NN{D_�\��;Q��}�>�+t��ށ�,w�$W�B��~b3�G��Yl��=
I
���%p�p�y����:�1I������Vߛ��Ɛ�`D�
���7��
����|o�Y�Aϛ�-���zT��s{_(V��c��+N�a�����;ž����i����b���7�ї�i��#q�XJwI
�,W`R�S�A
L��
>
+�1ޢU��߂M`���5�
+��t�X��e�#	a�JM�~q�e{
)�
<4m�����*K�/u���q��v��r��ӼO���"����A�G=1T�VǢ
����3}H�ϷW��S_W!#��:ج��>�ȯ����A�+~!1���6N$�O�u\����X�������-�IRX��o��;��E�%=�[phwYU��g��Sy����+M
B��:J��m�ŚaP��_�$h��>4 D���pQ��/.(�O#
�6g�L?*�
��f$n&���x���u� /��}�"9��>�
W�w��X5�<�uv(w'1]�t�*	پe�h�,�Sˤ_���X���h���m8�.�GJT��Y�BO�HYV�b�"�!ѵ�g7韷'a���["���:�����$̵�ݦZu{�vm�	�������4�e�����Lc��v�����JaE� ?YE;j���-@�wO��D8stvkV#{�ݯ(�tҶ7y��W'S�#Z��_h�O,/
:
�sz�lK�G�׽!W
r4��
��G#g�v���d"~T���RG_�X}O�����{<ձ��#�D��gQ�G��_�4�H�1�nx�
+]��N�yK#�7��;���y
��^E�0{�Q�
��s��Ќ��[A
+�5���p�iX%lnwq6Ͻd$�]0���g���s��a^�)5��/��a�a�nK��]�دzK�r,��|�(�^P\ކ(��L�9�J���g�v���yU��/�
�Ӱ����U0إ³29���Mfa8�}\��/�97=N�%�=��v�$)bY~�=16d5�X��8)�N��"t�

���`4mA��d'��)�	Ɨ�ӦW�O�`g�'����eİR,�
���)H��V)��{-9���ۥ���ʧ:��(��h�
+�фIlr
+��4��
'*W����0��qA��I��n�;��,���@��t~�/�r�^
�-k�� ��I
}UIU�'�w��D�$\oe�໎
���d�d�uA��k/,&��ȱ4K*.()Z�
��%1��`�����o��!�����r�6�����`J8��Z��wJ��,0�
���G�Ý���5����G���#���LU^ء��qcc�
�6D1c

�"�|����{�c]t���L9�!C*�D����
���`C��cl0�&Q;��$˔�E �:����yIӞ��m�"S��Sn`�e�
V�u�����>��q K.zN|-��E?
8��-	!&5�:g��m��n\
�c)�șT��
 
W����OB�ҋ���>Z��o���ӫ��u(+�I����������P��ܘ9h�%��$ڐYh,�m-:�"/&j5��������ҚI�W`�r�������D�_�N�I+�Un(J��1�?���v3��Vb��W�η�a#1��S�c��/��P�Ϗs������Vq�	i�]
*2�/�D9I���G�B�QuF�R�H� �/�ϯo͛�6�u16tJ:rj�l����!0�E�k�ڞ��P�S����|C��}|y��к��x�LV��ˁ0�
+Z�1����{�j2/'���/��"�]�)�ӒV���}�� ��.�$���Gg4a�4=�.�RUl���F�k�U��zF��cp�I�P�s���j
~�g\\��W� sY=h�4S�JY$C�dM��{q^��l�G@��E$�v����
�w�;R��� �N�oF�R��.m�|��'�M]���d�j�	R�<�Uc`��6¥�	�H�򻾇�M�@Ъ�
B��"@\��Wh�؝���4c���AJ�[���d���U�/����ĵ69K+
T�Ld�6�3���$w�K��^o��9���<�h����o|l	�/;�}/�e�)�9ńw˟�#I��M�X�W(��3
	�E��������
���5�)�W��
��t
�wV��|��̜�ط��6�����/*�ѕ�!eu�N�mƂaF�e���'��(N~/Q-m��K@���Qʧ�����t34��p/"�=��x#�����=����%N�8��#��b����R4H���D�;�̆��P�2
+endstream
+endobj
+18144 0 obj <<
+/Type /FontDescriptor
+/FontName /JNUSOP+NimbusSanL-BoldCondItal
+/Flags 4
+/FontBBox [-143 -298 913 989]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle -9
+/StemV 120
+/XHeight 532
+/CharSet (/a/b/c/comma/d/e/equal/f/fi/g/h/i/j/k/l/m/n/o/one/p/q/r/s/t/two/u/v/w/x/y/z/zero)
+/FontFile 18143 0 R
+>> endobj
+18145 0 obj <<
+/Length1 1166
+/Length2 6439
+/Length3 0
+/Length 7206      
+/Filter /FlateDecode
+>>
+stream
+x�uUu\�ۺ�����[J��f���V:�F�A��))	��0��{�}�=�������z��{�Y��}�,z����T��	 � :07o/C{w-~��7���gg7�������e$�
C��أ�x#go��= ��R@	)Q��(�W )�C��� =(
+�����(��
�2����	�zI
�:�Ϫ e����p�r������$%%~1 ���
�q���
�+ݥP��C�wMC~��9�?��P��p9�P
R��
���;L��Q�
��k�;D��;��o�T`H(�n(?�����u����c$�����;������w�ߘ
+%�B �' ��,��������w�x < ��p/h�z�����PHohP��%�}� 00
+� u�;�����P�?���($�1�( � ��ϿV�w
+A����ױw����TU�x�9�����w)�A�" ~!	�;��e��g�i��z�����wJ
wG@��q�t�k$(��Λ �?l�
���:

p�m
+�(��5w/��Կ���X����
���
+ןr ���h~+�G�G��
��_>�g�)�O��?y4P�pX��	�/�`^���P�

v��.�
��
B�^��7���3r��]ݡ^^wg�u����Cw0sw��\i���
�M����;y�8��o��;���BC���`������:E_��	�7bƗ���"����[��uh]�D
+�J���:��Xbhc�G&2<|&��*��%�CN���z
��@����	.��)�
}R<mFޞ��[�c��Ksv9�qr�HU0ӵ�ή�.6��ʢj<��ynI��aG���'�Rس��*@���
͞��o��͇W�]�vs�JD����j����rq���
���]���{�^��s�
��Z�%ĦMIbZ%$���
�r�� �eȞ+
��&�X�Wt�;p��e�]�/��@뭅����|�:&4�е�p<w�����l
��m2�F�:c=��G������Z��}4}�`DmJ��,�y?P�ж�(KL-�]�ER�X�Ɏ�]����˼�˴3ixlsfÁŧWy9�@���ZL�Uܹ�Up�����>�T��Y�U�g֎���w���~;��
m�|ڏ�~i���������B�r��AY��un�q
WI��m'�I6�>�)$�Y1�r�����f���õ���F�s�N����h
�BN
���Z��_5r��b�J�T������/<1qC���T�����	�i^��9d���`�p�'�|��n�r����[%
0
uW(�q��m��ar���s\�j��6��`�N�?͢Lj��
q�%�]8 'XCL�
���&��6J��%?��l�&����}Gq
+7f3F�bGh\ѻW�\J�I�vހ�����f�Ԓ5�*/A�c��+�N
͡jl�_���o���<Jv�?������	�F��؉����R'����E
)E���
��de�z��5 �]��� ���Pt8?�,#���]u�SÖ��q<��E��kj"#��%۟��>�
��,�6�0�'�i�|`�|i���������+�[ک~yrx��l��4�skla�����dߝ�9Cm�%�j>N䔥���
�Փz�G�
;o~����O[v�c
�9��pF[��Ò.����}�
�3o�vL�������c�\�׬[W��R�T�y�$�f=��-�f
+
i��A[�N��1\Ip��Tw_��֞�\ZX��fѷ�,��K��N�G�|[���

�Ν:�[�ag�M�����})y��i�AsS?���� �
�w��U�ɣV,'���
�&�NE?�
��gQ2���q�5~��N�����V������WnW��^t�������v�C��%���p�v;S���V��]k�ȩ�@P���DŽ�74!!��*
I���s�d��
�5�[�U)�I(pѧ�%�?��%�x,��A�lߣg LO������ �
�ï#=a�F����v������f�t
{�B������r�	�p�2�]ptu�k�d?K���]���}����j��߉��6_�VB���r2�-Z��Z��
�hv�U� ��K��T+;�^I^,�4���Ot�E?�q����c��(��z?Z�&}%�v�t��MY�gv�sg)��
�x.6���,~�����`X���t�ў��9��K�$�x�l�L��ٰ����s���do�vګ�Ynl_gm0'
�v��0���y��F^1�X�kƕ��;�P���:
+Š�e�����aK*���z�}�̷@����ȹ,�1f5����L���':R3��ͥ���s#�.%���K����b@*%<F�|��.�zE�"�7���{��z���V4�E|Ӗ��
�0�k�o�?�>c,+�(�ee������r�tyZ�k�ҡ�3�
��
�4	w�p-e�Qԙ��w�T�VP��ъie���re'TN����ي���p��&��)�D/����X_ϑwگ��ULM߈�����H>���|}a���B����h�[���z(�JY{%(��i�������n�0[EQ/�1h��zf�yKݓz=�;1���
�$�)�*� B
o��CM%|��򜧵p���U
+�c{�g_�1�%���V�
�9���^�h�DO�ҾX��	
����#轭�(2���/�X����9
���o��f�S"_���9d���u��H���t'G��-��Up#U�#�{h|�fo]c���G��;2gZ?��ì�*q.F��Q]6��~�Y��S��
rS��}���ݜ:�� "�9�H����
���!���=Pj�6�`F_�
^jmX4��Y���B�D��~�з�����U�u�1ڽdcL��I-������'o��
+��GsM8=�Y(؂�!
�5��6���"J	?���B�NqI��Y�s>lڿ����G��
�L�z��� ��Q��iz|k��F7�`���	���(����U����iHg',

7�6
1>Ԏ�w��;������m�G��4����:�}���Ԇ
���<��sZD�TE���M(��o熤���1�H��U�6��CZЋ/�.��1
١����Gb[��|z��-W��\�l�蘑�2
���:G�T�~Z�
+������֒�V�W3��s q��
S
�U�	��.1�6l�dU|���ɝ�W�Y]��U�U�� ����.�T=��8$D	��
��4Ig���Ӗ�
�w$�z���=?�\u
��0��AS�4�P�|
0i��.��,��6cd�?~�H������y�ir$�W��b<I�HU�L-�~�Ao�	w �[��$_jǸ���mKBգ��"?�ǂ�X����"li�v����V?��e;�,�'K��>�s���,�k@��onrJf˸���=�D]k�
�G��:���Ej�5ݙ��>��b�Φ����  �BP�h��J
L-��H;�z�|��cm����KE��^� ������@Z��v5,>�k>|s�������b8�z&�c,7�7m!��bl�8Hd9":���Qc��ap�#(u
�EkT�Ic���������n����i47��w#�Zj���
+�b�.�@�lHD~I���
�ȴ�U7�
G�sf��ks��!cR0��"�1a�/s�b
8��X�2�S��
�����f_?�|��T�-�dܮV���2z�V'�vi��+�5�Cц��S�9aMQJƭ��kƅ"v�9
�J6
{?Ӄ��M�7��D�"����j�N���{�S����uh���<YL�.
�	Y��[s�Ǜu�ɠW���йh�ⶬߓ��0���B������tѯI���
n3?���'
�����S������7��l��8��i�h"
�S�/�����2�tŤ0�R���n�eva,�W�?Cb��K���p�
����{�Yw�gI��%0�V���D&4�f��Z��$9ӧD�Y
&�	{e	Q9Hv�+�b��F�O��]��?Y�B�׃0J�UC�@u��(�tѬk)�4�����d
������V�̨�j�9��(%�V|�H����=����j��ݬ.;V�
>�ir��T�̟p��n�
�0/z�"��9ɋ�9^�K;
���!D[]�b�Hev
#�P�M���0[�Â`�lW���^�$CS�'�J
�J	1k�!W�l�]�h��!H�]	�]���Jɉ�J�
aMhIW6{#u�&�z��?׼QE�$���-���"���\�0��[Z�*��hJ��~/jo�Qљy�Ƿ
>�3��f��wB.Q��
�� ID�5���v`�[#
c�w$M;�G���+������.�t���
�q�X���;JGcbDUU��E�
��#�ɲ��͈y�V�7|��#
+dKH��@^q�fa�I�^����$�p�z����Qۺ�x���jUow/�;o�aړ��NA�&���e73C{?����Y�p�z	NJ3�v������&�C{[�Vx_ZJ�f��&�ƹP�{[p�
Hu"3I��h�TP���
�g�s���+���JF�w�'D����=��x�^z#�3�q�t��zr�WȰ��+Ņ�α�0�2�
��Q#9npB
+'N^{N��y
�c
+���-�z�z�����&5�ӆ���\2�&a����0��u
+Ǎ���	�|��-
Ѫ�
�\�]
J|�w{��CU��`�h���MH�,�7'��d��w�������m
.]��~�SIs���K�"���zz�O��7O2���[
��|�K�9+?���9o��^��RM�
m^|Q���'j*���NŃ����Qd iA6��R:�t�q��ˋ����s���
g7^r��іp�D�ÂK��䑈�g��zyjӮ�����i��_�|w�x�c	�W��v�\�]�����t��,��(�TCQ�Ƨ�_p��r�
3{w�ծ�#2m�^ɂ(���8͔R�T?
�\�r�
�
}��'�Y/2�{;��U~Gt�j0�^Q*a�I<���-&ɑ�X�L#�{�ѽ1� �$aKs\����'�#_�~�E%j.�=�TwݎW')>��!��ldmI�|ƌ|�%`PvzV���f����ŷ{�g� N�+����4��͇�,�?�:���5G�U|���c�l��4�[d㤒v��ٵyt���������GZ�|
���
���i��ԬT�O�lb$��
>2u9Lኬ뛓h�X%e�v4H�ϫ
�E����|ĝ���M�P�&r
9���}�����,%s�j�z����>��Y�e� �o��'�%ő%��5�f�.�Ȯ����	W)�%�0��`�׻D@eg��.~4l%�z%U��p�>�H#�鴆��-c蠻#ʻ.4W�#��İ�朧ߨf��ЗEl�֙Y��4��hf}�٘��N��N�#��w��2����
�Mt�
+;��
r�/�_�b�'��ΙHJK�
�p�?��.�=��,\�${��-��
z�p:�%N65n$��i��|�,pޏ5����x_B �ʺ��a[M��(� ���@��ѷAd��پ�J�r���L�_
W8Iͼq�L�a�ۺ�a��U��<�=\IUխh-[����s��"�T"G.�AA�~}+D4|�/u�٢cF���[+��F:

�����-2�TrD��d<̹����*p�:�m�wc(:�я��OR
�?�?�׾w�!^�+�Z�Z<%�.3�� O�'�_��98N���/"䄭,>�������- �N[�a?�[<)�ͪ�U��^�G�U'*f����(�
����]�hVnv���~Y�����gƙq�U�[��{?�0q��Ŭwd›�K-_�}��!0��]�u��U����H�
��+W��Y���F;�\�x$���Ks�Y��P����s,�K�b�
5�.G�_��]��Z�)5b�KMI)E��fZM�XVD���膸'f13���֓u��vö
[�ʍS��)�Ndyǻ�:�/|������x3�G��Q�
��oێ�J
$>y [...]
+��$RR�
B{�$�g���«�w�Q�
�u�FU�x���

+=�-h*
��<*^�>;Q�[]/�$L�^f,�=�ߙ�GN8<��aJr��0ү�b�9���"sU*��a���_���38��k���0�\�!I��@C�e ���U�Y�|��Ƿod�^n�
j}j�t�&m�v'F�0�O�՗ux����&���1`�w����P��sU��EK�z<�)�9�H�Favմk)Qt��B��X
�NT�1�0���]�����k�i���3IOq�x�F[��^�t�������CF�.I4�T.�;YJ��5����ڥ���j�����
� ���Y�
dA$�C6� F�<ؘ&�.g���G��bx��k�KZ1G*�C�-RN%§�uU}b[z;
U���2Hi44ȕ���h	�nmxN'+�R1���}s� 
�r���]�)�_BB�3X�'��lx���x����+p_`E���|q
У~'����[WOjQa4s�cd�bd�k>p>݅d�)��&����X���Rֽ��,F�iJ#������dz�`2���h
ᬑY��a�wR}�xa�T�Q�4V,i�{
K�u����CNmS�X:�^"�3645=#{�=V��đ��lB��!�7p�Vm,K[�i9��
��Ȇ�.L�-3~���P+o�~
��*�"k���ZT [...]
qJ�3H���5a�f�Q4�Zh���C�Ό�v��Z����k[M��0D`���x�����p���<c�<
+_Њ�n}ұ8�m��H�
�ŇI�	�\�ox�E�v�s���~��C��{`9�RР���;��@�X��*���3X�Mit\5�gC� U��.� 髂��Q�Y�����E���5��v����k�轣�{�k�� ���7JJ��y/'̿�b�&6`#s���r�ZaxL/���E��<.&8�M�6�60IZF��FLqLu~Y��<J(
+I�
+�%c�MT�O�e$�
[��P��1��iZ��x0Md�dtr>�%h�e�J��
+endstream
+endobj
+18146 0 obj <<
+/Type /FontDescriptor
+/FontName /LPPFDT+NimbusSanL-Regu
+/Flags 4
+/FontBBox [-174 -285 1001 953]
+/Ascent 712
+/CapHeight 712
+/Descent -213
+/ItalicAngle 0
+/StemV 85
+/XHeight 523
+/CharSet (/A/B/E/H/L/M/P/R/T/U/Z/a/b/c/comma/d/e/eight/f/four/g/h/i/l/m/n/o/one/p/parenleft/parenright/period/quoteright/r/s/t/three/two/u/v/y/zero)
+/FontFile 18145 0 R
+>> endobj
+18147 0 obj <<
+/Length1 1626
+/Length2 16613
+/Length3 0
+/Length 17469     
+/Filter /FlateDecode
+>>
+stream
+xڬ�ct���&�vv��m�bۨ`'ٱmۨضm۬�bUT�X���t���ܾ_����5��g�g�56%������	P��΅������5quV��U��gT �� ���_���. {;qc @
h��� ���������N 
K ���-==�Y�	�x�O��Lg��
�������h����:Q
�X�  ૒�����FJQ �:� �]Ml@� y�)��H
0�w��� 0��3�Ӛ3�_,Qg�1��h
+���0:��b 8 �lA��� g���������@v�6�f��k7��!'���}���]�M�@.��U��%��������Π�n����H3{S�Z���/�_��1����p���	`rv�1��[�/���_4\�Av�ŀ��0v2�:;������t��O��ֽ����翲����8�\��6�L�lk����m�C`�gWd����,����:�O���_��ggh��06��������]����ߩ���'����-�����O���������BK���(��]��1�����
��;���и���R�mA6��_I���7[1{���ɸ�
����_YX�X�m9K�<�f� SK�����y�ˮagt�������YYX�çn	2���G ���vf�I��T�"Ϭ�*���I�x\���w	\�=
�r��(؛���?0bb�
 oFV.
 #;�߻��/����俀X��`��� ��훅�_�����
�F�� [...]
+9�P֤^\Pk���=�'oշ��P��Y��ϕs��CY���~
�4�U�/�@!�6U7�Q�arƅV�����.�.���޴��a�
�l���#m �[a ֗?���x�n�f0����
�����ቱё�[�CB��xxJ~c\��s��oN�L?�_ܸ
�4&\
te7�2%��tf*��l��g1��h3���>��*�jĈ�>����֝.6H9B�
��5%d�U@�h$�?ƶ�@�O
? �s�p2�C˲W׷�DZ�cF��1�B��yp$Lx	�q��6��q*�	�d
E{�
����^B�dz������l�hW
+�ݒ�J4w����P���������7���#�?1�vB;��	�x�y��N
c����'�,hs+�h'M��E5��� ��Z0>��38�rɂ<�%�$�W`[��=˫� q�=���
��N�

F���\�<o� ��6N.�
��h,�{�e��3�e�l�F:�W%�*Fj��� �@W��
��(�2��ŝf%'8��_��L��"�>\�"���-\1{���#�/���f%p�EUE�A�솗��	�m�?
�=ۆ����
$��	�c��4e���/:j��ü<
�`�)�uI�q>�2G����X�;}�} 3�Ѝ���ⓝP�k�-�0���Y�xD�1��6ڒ.��üo��!�z�6��OӽJ������d'��+�i��R��7�&4wzw^��A�y�N�����P��o�i����IV���t�N��_D����6�Ϝs
��{���z�?�����O����ґ�
�c�{i�\M~�<��3��-6�Md�v7+`�����n�"; [...]
�B�u�g�PPr�4�b2��X�����G�v�Smz�I:Dw�X_�"�z�CΎ�3�l��W���R
�#�+(ú������~����������6�Rq��m�
+X���?$�����\H
����U�u��
�
:�hx�
&��/�� uc(dYpL��K�_?z
��M�P�o��ޓ&��l�u��%��[
Eرߚ��b�Vz�֦*��h��Gk��D��=�j����1�Y��5��#V�1�	-�o
+~����7*����,aZ��C�t/V%-��Y?�
>�m*W#�Z��`�,���@�T�H�jU^q�\+���Q�3B�j�4����
V�jn
+p����i0>�X<x�.�G�{i�����' Ev�䐻stJt{:��*�nl	�]�(��
��o�\�aj(BL.&�N��Bq��,�}�GK̮��$���
�J��-Ō�@~i�������'ӄ#_ʙ�Ãh��/CG#���]���F�����R��2���d�����k�d��)͂/?�-+��گͿS�Pn����+�ϵ��TFk�>L�ECm��TS6n��P������-C�����U~H.&��bt/p!�I�bxx��z�QAv��|���'_�֊���OW	�
OO�F��:�	U��F�/lqD��H��Y"��`i�
+6�:� �_���
Ѩp`N���Mj�t
�
+:����|opuJe�q�x�z��
��ez�>[{\�k��I`{r#<34�L�虵�P��5��<�y�F�,�$��'��4m�t��r(�v��oF�(Kܡ�IApoq����U�<D�Y8}vP&��7rK\��
���Q��b�kN=\4���}��s�D� �m͒�w����2�HΗ��iǥnPEX?8
%K��<Gj�]�DD��6f.lcPY������|H5�:�7)���� �f�3���yd�t�
%������9�|�
�����n��c���[{��q��� K�T-��3y�~`�MLU�yZZ�:�-.�%�,o̮FWx����3�J.��.Le��R�6seV���X&�g�Nj]��U�8���i�A6�����߹
+�K��?3���MbBs3�l]�o?�x���5ң�mZ/K�!kkX?;7(y.]��vB0�lCFX�ڲE���k��MHO	�&�-�d�j��f�o�e�0#^
�1�6���2��
+�=lE��#�
W(o��ɝ�W�
+�#��R�n
+~��/����DZ�Y&�&w|QN�Ђ�O`*^�N�7d .UsV�("B
4�4��
8�AY[�cq���o�R6/-"i*��һ%���J�ɩ�]�oK�h6"�~�n?4]�5D�'|
r�Oɲ���W�$���(��c��?N����06���J�ug�:�*
>�/\1ri�t�Z
뢰�z�
����(�0���Ѩ-��q���~�e��,�V�
W1��9Ie�ɘ[?��}=�f2w$��oi0���
+��S�`�1�3�cG\T�T��C����v�V胱�`�8ܮ�s�K�[�rMp�-t*�ae�M֢�{��D#������+s08�rd�F��Pƥak����H�
�ǟ���̸I�/�Т�KԜZ��IE���i|5hk�l\/p7K���D�#�B

<}�$
%L.p�?�U�z�%���"�
���}L3�eٯ�^#+7�Rd[rj��F�X
9��~7O���
D�"l4s�_7�e��%E�f)3�l �B!��fF��{�D���O���8uS�=%fꣅw8��Q�-�����M�fU#�8<�}���&�A~�p8tr7Ҿ�
�h�
�>5s���5O[Z^P�Z�ʇ��DS�%##�kr��[�FA��>��W����h��IF��l�͑cRn�
|x�w�Y�����:��+�8���Or�z����~�0�A�̽ʞ�	�@Rt��!�o��r�Y��������h U�0�����5!X犡y��%����?PY.��2�U�,b�t�\��w�|jj��͂n]A�	�л�TB�#�F����va���P�g��VB�}��n�!4��
į�^��{d��	�4
�7�"x��c��UX_��]10.���7j6E�(�ꀑ�i ERh7��@]X�'�CX���6%�VO��ό�$�R����Y������%�:�R}
\Z������~AU*���Tglr~�OA��闆�A�ջ�*����yC�I���o��m��?*�t�@��~��ĕ
��_>7r)N����r�C�	�u�b�Y7�M��u��+���ug���&�$���/�`�Y��Zr�
�ڶΠ��������t��X�zDDߊ�����I� [...]
ɭ��
�.�MN�d)�X.!}�*�����%�awڅ�,\mtڨB�YhԘ��b��;53�*��*�y
�il=��"�����r:O�|����
E���1�.�F���pâ�]m\�7c��-]��ƻm)�Yz�.!���\7��=u+'Z.�c}��k�'{�կ�E��F4࠽L��M�9�nT��f�Q�0M�0V�G���;e�y1v��
,�҉���
�f^��p֝4.G����`\8����d�z�����U:��*a�H�h�>�L.IY��x���U��Ң9�{E����!��./-49+̨����*f���&��^r��~M�&�\�t�U�Jn�ޕ����U�g�Fи58���t��e3�*8�����s���(|�̋��9":Q�)?�Z�.8J
���p��:�\/�$}��*a�	���l��A0���p%��P��=�j.N� ���F
�:��X;
�b��ĵ�E���CԙD��H�6��R���\)��̏�������
+��6\H���ƀ64'�ZF�1J+��֕dH�.C�%�B���8��3*9�eZ�n�2��.D
+o�!�_�u����� ȟx�h����KdH�(�Pn��f!s"�m�E6+a��:t�R,�̌�
+�
	�w�ON�AV�J�jY�n�Q�w�3���锄�NP�}ʜb�T�#�(�HYni����|6�P4PB��m�gA������^o���y�)/�H12G��kΧ�$ 2�k��=�
��Y�
���;"b�m��
F��^]^:�o0�,GԾzO���z4>5�	;j"Y��g��1U��
_������*�&�#�
^@w�ﺵ����)3��>e��B�t/0�w��G�lrj h\��cxs�2�'���L�#�2�0�DS�7�_Z�)3 �?�!�:`(�	{僫�VN���&|k�
s�t���ȭ���0)ug
���hQ��C㳤��2��2}p�k �8����"簹�H��>xb�8H���90G\\�`�zc|���W�ۄ!/�q�U�ם݁Zw�D�*UbQ�T܂�گ��`�b��>�ȼ�-���"�
~��碥6��	d��{ EҘa9��Rns٬�
{�ER�Ʃk�V�����b��쌈�9�b
r:k>�
+3j_���_�3��T2TLQ�g� �
v�J不[*�ťa�TEJ,d�Yȳ4�4�댮y����jE�3=�ð=���+k*
;�/��<���nW�q���q,�!M5�gɿ[o�C�x
Ti�cn��b��I*�bb>]�>ǺF����T]N�-���e"����R��>�V�� �1�ʯdά��ҳ�S�vݨ��E�[gi�o"���م�r����ۼ�
+�:2�P��c��(�W8Z
���O߹�Q$sG_����V�j����C�����4|Gт�����(�8
���,�����)/�<��b�6=:
[�m�}�����Jya�;��>/6�����䞋��[������P��z����l��ʤQ<t�6�������ʒ��|��g�J�
��o�e|(O�E��K�m�#�fV���S��V�Yi��M!@v<5���*�u!��O��-�9��V���ǐ�U���
�Ѳw�u�O�J}MZ��&�*�Y22�5�q����;���в���4akY;L͌�-�3p[f�i��R��������� �]�_
�����l�1��q�`(s�̾�W*��筬s�h�?J��p�;�з�>C_HR+����}$�/vQ��~}�3�]�W��Z�?��
P�\�^��!g�R��?�~�:2��k�s�����A��	f�ԣ�.
Z8Lb�J���ފ�olUA��i�]��н^yN��4w�n�^�o f��}=��	��Ro����D��vh<�5��o�rnS��4L��D�塌��#{��'d ��]��
��
=Z����x׾�d�曰�R伡V����H���R�w�3�
����[����H�&���s
+
+[C}�o�.��S�R_3�5��:�c
	�6g�H;�@���*��4nbH�ob�H<O��&"��\�f�f���4UY���<�N��lL�6Є�����
<v�86E�Ec��k��f��:7�*y�%>Nx�̯�\4
�m��#w�y�m-�i�wY�"8�Jt�յ�t1w�PC������MF;�<W��9Y̲6��:20����T�|bQ���w�d;I#���8�N<M6���	�>�C
��X�9q���,T���Qa���Z:h���t������!
,I��$س�
W�pyѩ5QQ�&m+|I�/���5��v�A��da�H6�Fut�,�	n}��0A�#Vd������B�A�V�1�ʜ���[b2��5X�-wpXTy��g��r� 
����tnO�΍�����]����ō�W2��'��TƐ3;����>���U�.��^��[���Z?C���P���|�-�Kk��t��h�5,ka�
|L�%tR��k���
�
���0k�: ��Z3x���� ��-5�i�^��Sʪ���U���y��)4��S(��!~4�&�,6��;y��cC�XZ
+�+��Vm���hʺ��5w���6lj%Ƕ��R	I1�rE'ȱ>{��I
+������h�����6|�L����([�����8z>^���`��g�p���	�~@�E���0��QA��
'�ߋ5��
b�*��C��t
)���t<CI/B4ʡ
��+{h
[�MG�߁9�6d��@Y�e
5�)�$�zM�u�+V(�4
g!{�
����4^dEo��'vyL��ه�o�ڼ%��'�xu�
+@���ݎ�
\��{UW6�S���f~�EL��>�N��k>�?��I]o���2z���}
�l|c�z�T���QDP�y:R����>���5�x7'
:�9̥-���*a���
��v2���������g�i�����J�Z�)�7%�"�oC�Pr�$p�(�_$
{B!�M�:���z�~��$ ����=ǥ<�`g*v��� �#G�8�?�]������N�����}�tҘ��[�����Q�j��
��><���
�NH��h6N�����α�/~
�7R�
-M��32!�g�:n�*��
��@��](�E�R\W$�L������	��7G��n�rEofI9}-��4y����Q?����M��e��3;a�?U�;�fl�†��Rl�*
G`kn]�]Ո2k�xl�
q&Ǜ�F����T���U�=I&U�rCj�����\�_�64֖��s�Wt15k�w�s[�M_�l�?�i�����{�$��ު&D+(b���\	�Eۄ�G�EE�J<�[�B[�63��`�=�
��pŇڻL������ngI�k2����l#z�����s��
!1��g�Ie������<����#�^��ǭ���T����|O�T�k�?I@��1}�9��ׁ��S1۴quۆs�V�`�*�g/I�$�0�:me���_Q�p&(~� T7}��~ޮA�s��f��>��
H΀�Zq�%�_��G�g���5�
mYO^t���woxa� k7^�Y��Z��|T�v��n�6��#(��G��;��'������8A��myy��R�)
Ou�Ҳ�q1
�ڏ���g�g��κ���qd��q2wUzLA
]f
9+������Zgc<�S��
+�,���ڹ��W�X���1,�m��
���|��k���1�Dj���x
|���[_÷�>�c>۶XV�-ʞ�L��kjn�|SXV�*��1�ĦM��%ŭ���a���ʮ
�c[V�q���{X����ɯYw��2�ub��	Wd�8�عu�j *�����7�Xi%�B��Zj��U��J���_�
j��R�%F�V��
�
	�d�8�q�(?VS�9s���[]ż�F���.�z㶙��/40{6��
�U�7:�4Bz ģĝ go��
�gw��;�8yxś�|Xn��ɇ�z"N֒\X,Lj�ՠ�&莻pE_���W���5�"��.v*�T�Z�c�8�x����e����3'�4��Z��
��+<�Rѝ�kr1�WXm����U0�Z���p�C��
Ǥ��V
+ߏ�K�AL��OM?Z;��'2�j�ޱ����;�
� �#0-/+��LZ
�wy��j�f���L&�O���I�mrB���#Є�U�Vrk���a/x,--�&� AAS���9Ƙ,t�'�YIg��~RI<��
uj� ��
��?(���b��Ü���}��	��$�G�Ч��%C��<:p����[Q�W���.vQ=J6�dD:Ɵ��F�~3�a}�rI�h��P�Pŀ^4|�})O���ͷL�S����K
b��)G���b�(-�[�:p4/�Ub�/�q�����n^&'=t,5%F7��ؐ4>��d==U�G��Rс
+R��kR�˾�C�`�א�W���%��Yhv�7�R�tW ���޼�1,H����v�Cd6��iG
/�湗��1����s�/��{�c9�/�~�b�sܫ��`�F%�-w�Uڶ�a�.E@�����K�JGrG�ޏ�#G�*S�|��a��
��4��X�~�k�0�l���	X���
w
Nԑ�tT+kY�����Y�3
2���w��I�Gӕ�H#���$w�i7���hK�m�sE-U��j]
c�w���U*��d �{�� �����3��@����c��|7r��E��ӱ
�<Gc�!��M��<F�W{b��N��
P�Z
+�n�z���/Am�D]���z}�"u�[�S;���i&����x��쿻ݣ�o���1���̶�Ok�h���V�����
�b��ŧa+V�����~�=�_�ѾJ�] ̳�#MK�0�i��͗a�#�s�� ����U��qi��F�<��`�ar���H�/��OUX��0��
g�2k� ����<��� �m+ٻ��mq�8�Fy�x�IN�y���ۄ�Jݦ��^��N \���Q?�
+k/�:��b���#
<@��
��?��kE(�����hPg�*/~"��j&�z��GC�:S��`9Ǟ=����*�����
�;7�k��!�F)��q��g��U��s�M�e������5	��9Ss���iz��ja)-3t��9'���+j7�8��
��X�fΠ

֯����"mC���u
<[���4��+l?W⬕�y�y_���
0[TgY��}{0��׭��Xt���v<ᯜ\�
vV*q��
 �s��� �/�����1`�.۱0HG�(
�~s��X���F����<��;���059�q�"t,��@�j)
+Ç�Ɍ:~�w�ĸ!�n�H�u�B��k�U��ց�(�4��"��	�J[O� �Wم�q���ħ�r(T�
�f�_|
��ʖ�p���_����NI��6v��|�IdX>��;�q���1����8J���~��-e P�\�Rzш[
��X�67�%f얕t�#�:�����r
�1�i���Db�l�'S�Dk�R�B �J���R\�|�$�Y��n�>_��=�;>E�=�� �/�[�m�cֱ�����&ap~���	'�d���t�<+��*}�J�U٢����
̮���L�C菚K�VU#��B��� X�;8
+�v�yw��k��
1v>�
��PZPf�*ȴ�f��"ף���
D1�^��,�Ν~Cj��wz�VϠ�\	H�	��7�,
Z_�W�e���T��W�.��:���SO�RF�P�pT�f����X�2U�}��N��^��O�bs&rE
_� ܕ5S�K�2�g�����px��B���zHRg�D
+� *Af7P*Be�m����$l��S�W��ݩ\��N�	�5���J:���.��Y at bi�<@Xg�}����+�����K񞵬�?����H�,I��A�}�G!��Y>L��V#
?��#A3�_?9R�Sׯw�-Y��?�p��؝�'����u��ڝ�9��'�(|��Lkx�Eja�mZr땔=陲d'
o���� �*
�2�5����G�,#�JΗU
.P/�H	ۅG�]�W@'�O���4V�t�
+c�@���x��� z���[簟c�tkOT
�F���
���
��wk蛷��(��AK=���I�Ycr�mk��b0r�<�!�u≔$	��`9�?n���(
=e�'&��`֦Z̽G��,�pUkT?a�����î��̌�O�^�	}T�_
7��8����덤	�s�㈶��
	�
���2�v�6Hsf��
D�s���ai{��H�5�Kq��ĉ����_h�%��8
��	���I��~�|,�D�N�2y�
�g��04B$��.��>�"�/
+ ����Jo6X^�
"㻩� ����}J��~�ާ
+��N6Wވ����O(
p�.�����Y����QD<��4Oz;�j x��
���Vۮf at m�;���N�M��˸̠��//_�5�����rg�~�c��ү��ɴ5_����g�ISzC
+����2m�A*���r�|��ʒp;��x��G"O?!���	�lg����~|-�<�Y=V���NZ�%��v�$���ɶצ��y.�\q#�,4UDr��Z(��D�4�`��8����%�%�s�uR.��Ex��ٹ�չ,E��	��
��� ��@�At�_KL�Q��
UҺRD;
l�/v�9ɔ{�s�+!���0��� ���n$
ޠ��n'�^x:V_��2�Xl�W�D,K�K�b|y������h���\ɿ�΍eg�{��BZ�J72h�ȶ��9:�4[�e3	�/����;��QYI"�]%��{$#�o;*��yi��J՝9V�I; ����eP;�����HG�Q9
�߂���
+d?'��g����/=�v���
|j�>\鰝�Ӵ����S�D��'�/x�%DK�;�P��8�=�'�(A�)��d��Ա�
�s��s�y|M��];��z(l �\��UQ� ��MS��*�	̮����^���=�KL��U�N�_
+��)B��%1�'�x�*�
k��O��ri��M�͔	������L5GҰ�P�L�>��e����r#
�p�=7d�
:��{��7¿��\����]�"{뭣���t|�sE�1��{K�ڂ�m�MѿZ5s|WH_Y+wF�F�ˤ�&|��(�
0/<&���=8~�5���\6�e4Q�T� kB˽�7h���+?�g���hӋ�6	w��q	�"���w�m|�jek�
[,�i�L6
+ �h-��R�b[�ws�"B2W�ڂwB�Z������gں�t�q��Ca�V���/�b��]~Ez���1�oD�闍�g���}�5�A������\yMT#1\�	Ž>Q��
��lk��FХr�mwۍ������N��R
�Qb��>
�u��n��M��L�7UY�ٳ�H0O��n�`�����(�2V<@w����1��{�/-FkoԆc#I�<�֡�Ȳ�`2t�+,�~�-))绩 sN�ٓ}�3�o�
+s%Kh�F:"ɵV�/7fE�Nrw��(�b�Q�|��w|�H-��
+�UE?��cZ�.
+�$ke�o?Di�K���W"������2��w�^>�n�)�E�c�B�0�յ�Z&nR�����H�m� �
T4���f%�!��:��f'D�;l������$�{M��K�
C��X��KV�w1n�Ey���N9|
�;93��
'�̥2R���i�%��
�[b1��7���N
+�Z?�!�X^�x���S�#�vUw~ۆr
�������.P�>2�Rp���֠�c�\�ӊ�OH}o��͡1��.��cZt|��m�P�,��}=�6D+"uE.����I�`o=��D��tMS�䤾�)T%*���)�acI
�<F�A-��b�#1ld?���}�!~��t�i�$D�\M��3Rjm�� ��I��m�D#3~��˘aA4�G�������Y
(0W�Ћ[ꛦ�+z2%R���Y�
�n���&��:� /Ӵ� ��{�C�,���eq�Mә�`�	��
����n'&̏)�Ze�DŽ�8�;�INgK���f��s$��el�;�:G:�r7���M#i�b#�2]K}S�_A��w�C<iA�U�B���Y�?���S(=�<@��ѪU,\�9е��{}4���t�$q�p���nvWV#�WtQ�����;�Oۗ���㯞K�Hc�9��Zɴ-���Ƈ�ѩ����p�*'{ZĖ����4Qq��rV�#��s�(��u��j�/zg��<5ui
������:�R�W.A��e^ե����% ��
���Z���5p��B?�aɆ�R�f�x���[�U�
����C�~XM�N���+X螀
��1�(��L�;�
@V��JǙ����H�K��W��xIHZ
@ƺ���1�h��t����4΢$O�|
�䔶�Zs�!��IC��ˋ05e�=�f�
+Z{��l�U�5t�N�vUu欯S �<�(%-�N�B�
�N�6�=����мQ��
�
�.3%r�6��/|f�	;!����V��*T�Gp��,�٫%��՝u���C�iioR�u��F!'�r��
و
'�1NV�'|omDޮ���q����
����V��%o���zo2b'�=Pv&? >�F\�1��N�p�]b� ��a�Iͤ�_��m	��CR�-�a�C�vI͍�����f��"L�Ycq�@+�4��,�8���,��Xy�)�ԀT<aKk ��������>�g��E�8ڱ��L<B��~�Q:L��17$<P�,�0�Iy[�S��6k�a<k�I*EL�|��C���.6�}���dX��\��?*�=�}9�:v��\٨K�׸D�^%�w�>WN�I%��p�rD�q|�K����mp�i�+E�&�g3��"3��E����{v,�.IX�����Q�>���`n���G ��n@>̡�f��F�!X��
�|9Y��c2�
Ĵ�{3z����@ 
�V���-Cw
+��n;�̲<��st�i�����(���iB|����0UBW�#f�l�,�����ܦn��u��Qq�1�3�SF_Cf
�jB�
j
��n�|#�E�/֞�o)�:i��p¿�����
vZ��xiV�N�
Ar/!���S�8���^�}6l��FkSç
���
_F��
��Fu;-�@�C/u^0
+l���	Ki���!��3Rq��.^Q C���
+d�M���L�U��	�N�RBE�q�Ӌς�
+p�� ������X����`z�"�s�p� �$�<;���ִ(�Ʋf�<~��]
1�[�E>�yG��C��]�
+?
Ɇ��c�r�������~���S
Ē8��Yc�
`+�
����N�ϣ�B+	��vK���K�rD�1P?�G��
��]>�
[�^n�����m��6�m��|T��s�/Y���iR֎OX����4M�!��na��Ƞj�"L�����|�"�ܴ6����w
���``!�	-ˍp�gx���"/�
+"c��(�S�p�e�@|q�W�ů�����"�� '�X�<�Ý&�
�0ŏ��a�~�����ʓ<�
LNj�t,��b�eQJ�"䧔��H�H3�����v �D�A�B�������bvP2�\?V��7��4�1^0H��1$�[�8�;�x��O��%�V��1

��Ṽs�OHRJ�.�iݠ�Kz�T�D
OHri��3�-�)
��.=wPʌi�#H��V�E�Ǵ�_�s1&#S�1ó�uV��
�y)���Լ��'HR
+jO �ޞ.镄��Mx
�"�1���Ay���}��d
��.f>��Δ\�_w�?6sj���%�O�J�H`�n�JɎ�߰M��+L��D��"+_b��q�Ķ��4ϖ
� 0�y0��g��*,�3�]Y�����B|կJ��
�=}`y��W�z-JR�H6<�
�r�����XT,{j�$,�*�s	��Zv������
�6��>
_��|�r�
)x��]��
���O|���qkhd���������
_�	V�dGpX"P�c�^�{=p�\�����B���D���>�fD��8Ԇ1OM��ތ�g�����3��� ��
��tC��n�eU
�����S�pD��ˏ���@&�rЩ�HVc2�
p�"q'��a��i�;�E�+�'��Y��0v
�>4w�J\�i��S6��w|�se��s��I8I��8�pc�_pp��dVf�\rn�b��RȽ.��}՛��nQ.�>�d�
��	�qS��̘/r�2�k���-{
+�I!-|�(̼�y7W֛
�HM�I��U
Pc�8
/,��J�o	/j �B(�?,�����V��+2e��L��V/Wwc��
��Q-�핋x J!:�V�E�����J��>+��;|L�0��Z��> pƕ� Q%��/�Ʌavd=_U�%�n{t��V��C��A�D�q����#ć�����	*Aߟ.)��,NK~�3h+d�-��Z���;��iK|�F|�Ŭ=$>�)�]ޓ������J�~���c�'C����2
#ޕx�ړV��:���)�y8�
K2|�1tH��_�79\���N�\d��r�b^�溓C�&F[>��ͣN�N£*�p.8o��$e�	qo�퐾z���Pb��	�\�g��6��
+�
�#�
=������ W&�g�g�l��^�s�LdG��Ao�l�a+��	�������7��ET	w���sh
#CV�*/H���䞒���l�
&HS��C`���[�]�b[��J=p��ҮH<�X�ў 7+���u
�l��

p�e+�
ᣙ��ʑ���y�5�O\2=#Ye�'�A_95N�+,6��@
�"-V��q`V�?�3�LZ��3�S��e-m���AB��B�;@(Px�)�!�`��tȷ�o��8�h"�Jv�1�ѮnȦu'�����V�-K�����
nI(S�Z�X�PO��)�p7����T�d��6�9������97��w��:�뤑W���y5λ���z$x4�aO�}B�

|\�[H�C��Z����Q��:]��=�G�w�屈�I�}_4�I���,��)y�����ι�#�!Cs:X1|Qh�6�ݯ�e���w��
zsQ���g�~�U����S#%ڷE��/��	@3���;Hh?B�'�j^B��>��?aWeTӯo��9/���i
�m�͞Y�����i�٣X��!{�4��eRK�w��.���Ш��
G�R��UՓ�����N��/u��)�]ɺ�Q�{u;����;�
^�*g��%Y��ݤ4_����U,>X��.���D�x#�����u=�ټ�G���e [...]
�ͷ:�,^�R;�ʆ�\�^Pc��!b0;z����;���Q-~i�D"������Bs�ncCb�j��:+�v�4z��H=�L���մ/C��mzl�г*�a�
��r�s��>>���7 ��V�-|��(�<~��O�Úˑ�P
�� U�>o������g
��ZXQ�ͻW�д��c��u�;hl�
s�Fx��}� �Z��]N�0�)�?�;�4O���ɥ�RI����)��.n�����3(��3�9
+��by�N*^�e�����`�@ �jO�(�
+��>��<	������)�ܔf����}�lu º���ՂK�ﭷh��?�A��Lm�c�#���
(���

+W֮M�)60
�2�O��b-����R\�h݀��Hb(��q�{&lj����
0��B�Gw	6.1�!v�6G�\Ye�N�@E�Sk�0n^���im��hMn2j����;CI��N��F<m�&wf3��OГE|���
Y�����?��J����oWdjD�Wĺˋ���#O��6��Y}
�5�'N���J���� �ƬR�;I͟���
ECd*���
-I:��n��N�-8R\"nҵ��#��	�k���:Q;v2�6m��
D׶p,��2��eԫ�W�g�&�]�U��Z�$J��^�P�<b�`.�}����F<�[�K����.@��x�[��:��Z��3�{<�$�>������
�ٽ\�g
�lWH���f_!:���P߭
+ �W��Kn��꾆�X5�T�K�(��K�v����b
b�D�4�C����{�v�kOnvv!7�ީO���"VNhsd�@�� b��eZ��;���7=�|
�^
�=���0�Ů_�gl�
~�ٕQ�\r���?P��$�G�)���Pa�)]|.LT��"�Z��.u�	0�
�յdH��H"풂{�wR�7@��s��G��a�v�xc1��2i�l���N׻�Z�z���B�C�tb!���X��=7�qe��`���|��cI��k0�W���IO�IiP�-Ow��J�
�����;����Y��@<�F��w�P܏5
�q8v��ߟi��o��{<
���lAFA�ȵ~E���̭��2}�hG"��~n�2!}Dͨ�]�m�
�j�O :���>��<u�M�Q��h�#a�
/k�i
���*s�6�����
�PJetI�m�������_�]iEM�	f��w�Jͨ:@�*[zj^�殯]VF�$d�G�m$ˈ"�۔���Q�J���� [...]
�ěo
�?�+�t�֒IBއe@ˊ^�{5X�a����x��4;[؁
 -`D��b�c�ʣ�+D0q{�#�gF�|�h����lb�y. W�	bCK�ڵ~� �w���n�y`b:9
�%k�
�{����P��Kȍ�
י���
`�"��̐��q�g�{=*
��h-��ǔ��zgyR�M��ֵ�+
�Ag���9�(�/�Ў��{8eф�+#�bϣ�
	�|g���H�W�Z��hhm�
+_
:�T�&b�!�Y����5,� ��;������*	N�w\���S
+��M�g��Py���v�]}<
C�8r�E՚u*^2&��̠
+���_A���B��''Q<�͑
rH���N��
k�Z�	
[
+�,K��]b��hb�Fc��ɯ)S�/:N
GJ��ڳX����
+�14��w8��o��g�8�x�y��h��~��X���J�%����Sy�U�5B
+Aϕ�
����pn����4A�Fϓmڎɬ�m�|��[�~
�j�.�sw4�$
h˜�		t�~����(��{x!vt
�Ȃ5'J�F
�Q���/@�� JA��_�d�5I��א*�����2L�u�?��5M#���-�4Wm~���;��$iY��vIv��Q>Zd����?A7;���$Z��_���X:8燁T�&�Mt�{�n�l�A�&ף�%�=�U
�����e�mZ��2
 M�"�u�3b�����
+endstream
+endobj
+18148 0 obj <<
+/Type /FontDescriptor
+/FontName /URKSXV+NimbusRomNo9L-Medi
+/Flags 4
+/FontBBox [-168 -341 1000 960]
+/Ascent 690
+/CapHeight 690
+/Descent -209
+/ItalicAngle 0
+/StemV 140
+/XHeight 461
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/b/bracketleft/bracketright/c/colon/comma/d/e/eight/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quoteright/r/s/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 18147 0 R
+>> endobj
+18149 0 obj <<
+/Length1 1642
+/Length2 11972
+/Length3 0
+/Length 12819     
+/Filter /FlateDecode
+>>
+stream
+xڭweT\�-���Bpww���P�B��(\������
��!��!x��9�ݾ=�{���T������d���شoյX%�!�@9����!P9Z��hB
� �*��@k�"������JC�0,c
+�� ���
�)((�N
��8yBAla 
M=Fff�Y�����'���� н<�
 N�@0���`�@�
��~�n��&`�W���@�Kꮖ +�
+�
+v2l P��? +��Wi.l/\�. 
���
+���:�� ��PG����3 �� � �^z � @`+W�x��@�N�	
+y�������C\`.VP�
�U]F�y�l-`�v�� ���Mk���_%���м�0
� z���e	X�\�
,<_b��9AA����W, (������B���Ww�U'�?Uo������7��[���t�aC��z�i{��Fg�k^�6 '�?�֮N��܀п����0�$aa
;x��6��j�KH �Oe��=��$�_�E�������z�����S˹:8�Y8�
�?�
�e�X�/���kٸ:��7 ��������_���m=�?���8X�;�~I�uX9yٸ�a�ȁ<��� ��-����q�u��@�
|��޾8qp��m
�����?  ���
x����ٵ������M��e����i{:�7��*��?QIIA< ެ\/��rs� � �|<�����p��j��< F
l

������u2�7Y����҂Y��_��?
�V�P��/����y�{��@����J8�.5#
VK�38&c�q0ĩ�^�0߿��15lM����&��aB��s���qK�i{��Ё�;x�G����7�];?�v �i	Vڡ^����*�!�������i�
+�D;7�����[�?>͵��UʗX���7��t	{7���#C���Ƚ[d�ٱ�h�-����&�<͡��VO��n�Л+I�o��e����2�������7�~	
U���a�&K�2��f�r�&��V�03s.�"����5
���f�W��W}�9U��z!��g�����î=_�I��Q�y��v�r�Ki�<{猝�f�u2��{EȰ�iH=�ngu�
�X�1.��i��'D�>=	�r�<;���^qD 5��ٳF������ҍ�PZ�$1��i��K��d�l�]�:.9x
D_sV}00�3Ȓ~���
�H���%ЁJ��"-d�X2��@T����|(�q��M]\
��0e)W�2���dU+�|��'D��+G��Sm�sK�����(JB-�'�8��9��4��rӅ&5,P�d��*Q3����FIPj
�}�ib�f#m�
�($�@b�ŗ%V��0�M�иm�:��"����zO�5
U���}�A9�+��ώ왏�Ϋ�h�J���m�P��?";��7����A:&x at r&��s�ϭb��)�x�Lد�Z�i1P1$4
:�o�Bt����!��W��$��QP�w���<X����I�O6�
+$H��F���ʸ=�14���z��>L�qn�ڶ��>��m]��X���-eS�El)���t8͞���)rl*1z̜����lNݏ��U��.�H��IXߓq'^�g%.x���|n�B�ٻRH�v
��Z;��#�����<9�)Vׯ3���ُ��q�iZ"���Ƥƅ���z�N+Re
���\�rZ��B�n�����5̙i
�����$>����6��-[�f��.��E��y�p�a���O��3f������4.g�`:��N9�a�o/�
y��E�!��VƓL5��#��ʨ�
V�� �m��n��
�J�
��/�LI\V�
+��x�u���QĞ)N�X*1�z�ÙLҬ�䨔E
���[���q�ژ�G.��כ��o��L�
��ܖη�^��|2��C3^to��Wc���gNSG���m��!��)L�nM
dW���-D:Ä0n�*��=xF����5�(���]��h�R�y��Qnl��6�P�,nBC��ӛI+6���0l�rNU��pAWe�l_Py&7�i�����)�1�� �AG�}6
�8z�kx˲��Ɂun�`AW�]��8'2���9d†�r2h�Vl����Kx���U�QpѐL�p�~�7���B�?����#�!��#!��
[���DY9Y�(�����k��+K�Z�8Fm�0���E��
Fz\\:¾-�����&x26�K��D�'�́��#���5S̅7����To�J�Rr��Lt�1�9F��\�M�fX��E�S�ָ�vZ�������
�G%"'��y"wb$�W+��W�.�v��J�ͭ��ME9[�
&ؒF�B3���
��x��⭈�CP�`�Sǫ�5�ǟ$����2�j��b�KSd	�5�a�5IS�KK� ' ~�A�%3Oj���LFZ�vi�c���2y���FA)
K���x��,����Y��YB>�D��O�1��
���'@�[{T��>��.C���
�6Ly-B?)��	4�ˀ/ }T{sE�n�h����N�*����
���x؊�Q����	Nr#����"�,���ˣR�S�3̨��P�����X�"��a>�w8~+�<ZI��ͮno�\

�o͡N�y�z[ߙ��x$�6 C%������Ԝq\"���

�\̸{��R_Yg�Ֆ��}�샋��Hld���-��
�l���|�a��.
+[GT�����ܔ��Q�O����
r�ė�Ӎ��Y���F�z��cK��(Y���S|Wd��!גi�Qp�(jfu�
�Cyo���S���/�%�5bgĀE���a)Yq]
�4�]�r6�Ć��T�L�o��6HM��j���m�ˢnXM�)W�g++�Rt��c[�\��)�1d�y����bp�n�"��")!Kn|R�\7t��&Uz
+YѼ#K�?�iEPI��w~m{;�
��{�C���׎�sƉep�DJ�4x
���d�J����`5�
Z��{S�?��H�`�H��_�m�ڢ�[�0!E�
+ea%�$�	'��~�T]��p�ѱ��,�U �Y��b�_Gȫ$�G�L�-� އK~�g�$����^qF�&��8$
�
�1����BopQ��n"�m 'g2PC����hD���'���U�P�`;z�b�j�!9�*��v5
��Z�g9���,4����jnh�&���E���.}~�bs1�n�qH'
}��:���bA�%rƜV�OP��Z�m9`��o��CNs�Z$�
+
�V*s�@����
=���
��HD|^֣�����������``���oaT�,6�Som���]�!��l_+�U�&bPAѺ�2�X�^�������1G_ڊw��c�#b�O�O!>�kQ�Q
}z�����������*�#�n
�nK�&�q&��	������yR��N;��`��qg�m�J�i�[����ڵx��J�KH��W�q���Q��g��$�7ٍ����8��
\
+���j��P��8����p
+sz=:�U��Ѧ:�[�}f��&9�T�
�&�.�	��!̑��L�
��A[�5J���z����@�%�"P����J������J���YZY�%�
���q\���y�18m�.!^
���
�w���������e�B�q�����XEG
K?��ž�X�W
 ��H�n��d��l���=������q�m�`�����J?fzM�fj�q�>�(�!m��,UhO:b}�������e{;������*`%�\`tu9��J�=9j��I��"�&5�]�����v>3��Gn�����I�/������
�S���XA�aR6yak��V�
�M�u����z��Ԫcf>|��3bC�GȺI�,����b���=�뢆��L92a4F�	T�U��+�8U�/��nc���T��
��Q��sN
Kh8E)�PeY�[Bzw�=`H��#�I`�w3�p�s���6L��w���(p�ɚ%�9	��
�3�C�
�
n$X�h2>p&�����~�w�ji�
�i�֢���}K?޾ii�/��E��R���m�Lj��|�9!<N�ܽ�������
��V�0���
��f�t�p��
h����rn2���/�ִU�fѷ'��|
z�C�o..y�&��3Q(�1A�N��vw�
O���>m�[
�{Z�����[�����|ɤ]L6�v�~�rfߒ�F,��X���H�d�~��Z�:��"�Q-$�R�z�T#�U����ޏ�<�1�>�0��G�l-�[Y	��:�ݍ��zF�����qjlq���.ݦW��i��E�Kɱ6�W/{Z(v��IhaSrwR����k�:~��-����
M��O�
+�i�G� R\�	蚽��7#uj_vG�X��<�_
�ܒu���O��YP�4Vne�s�D#���ZM�r��-��8v��L�#������-���֌�W�&g~FU�&�i�T���q�����[tk������ŬeZ;���J�.�*u����2R����7aECT��V�@
d��&|�7g&E���tQt��
dFD.P�>���
0r�c�-���'�9�#�j�!�z�}��@4�c�Y�O�Q�w�N�ɮ��CL����!i��:��!�
�D��i��6�a�u��CZ�{�[
Ʊә���1̫��b~�M
��=`�@̂(��`�Λ����Ͼ�__썯a@�	��ve��3�\)ʳE���U�%)�+�ȳ�J������H�o��Wj1�;MC���oέjA��{��L!`��|ƕJ���� :t�˥�{2��P>�?cc��
�VQ���UpV���b5s�M�1jv}y����+�e�O�d�/�@�]\ԟ���n���]�&�̳GU��Z�3�t������� [...]
����$�
8V
��;��Y�1G��OC����?�
�;�[8
�Y
�Й��$Po�2ݩ�r�9���fva�^�$��p &9����z�W������k��m���@��W�{���y?. ��{�ϛ���%�Q-��)
��q	����A�A�|u퍳D�4�|*[s7P.C
'd*`O��Uѱ�:����m"ކ����J��\ļl,�;}dzL֋0��)IP��^z���W;ǚ����t��E�G�I�޲�>9e$ʷ���h��l^lg�n-��Ogf5�+��LhTB��0[^c�XĹ��O��{6�/��f;��?[�|��p
+�P�>ºH|�Vn|��g�����/Jp���׃Y)6<Ƹs���&^���h��t�b�0�/yC?�㱟{i�Z#1
U�����+
�ռ
+���Q��.<ʃ��7fJ�uDfppg���
+�E.�@zk�.hp��1d�_��#��H�Ie��ϓ���Sj �W�B|ʩ
C��O���-����.�e��b��݄?����R
u7,6{A�y#����A��eMpQ���wiW�G�@���7��7�9f
O[-��~��'�����*y]�fH�35b}�6+�g|=b��
ep���f5A�G���H�����;
�mpP��Ɲ�y�FBP������	i�P��9��;�hs��c��{1+9�~p��l������=j:���2����An�4�P�k"5�T#���fc% >�i���x�O�!j��,I��=w���KT���v�u�K&��i���>.�G1\:u��&ja���.m�V��a+ �@��O`>V�X�n��l"{j����و�:��c4��
�֙�Wu�laQl_F�kH{V��l5��g�� �����
f����epG�$�BzI�4�@�݇N��D
39�:�k�V+Z�jB�Z	 <�9D ��[�l���ޟ
+*Si���߱|��;���
l$^����I�`s��*T�Z���3O�=;H
��!��<���v�ɀ?����9�����5c�p7҃.�C�X�&l8��*8B��ދ��}�^h�
+N�܌-M������-��D
���w}������b��b5_
�������o���B9�mpo��$��lc�Dz̲��m�8Qy[8�HU�&�[�x���l�<7����sz ��c;�731��.���9��
h}:�b���O>�#T���{fP|;]Z�1C��=��';��l{
�-��E����cۈ�/�zh�f���_��׶�kX���z�U�]���ʈ�_�*c�\� 8^�>���i1L����k�׶��sWl����lM�%oᚕ7���;�j�����Y�����Bu]�8����#]Q0�H�*C)M]�n���¥�{1�߬�#�}�
*'��K.&�3���Q��p�3f�
���S{d\����
Z�X�� 4
���$��1���j��NX��p���ņ��cXy
F��n
�
���'����3����K�����-'mK�X�����Iy4���NTR�"�
�b�Tt�1��R��O�+�M^|¤}˭p�
�g�G�OmP:P�� [...]
:;��G0��gW�̤s1�b���[�P�c�1	=rG@ʽ~�k��p���*m�&����L�Eڜ��c���Zk�`�lr��o�OS�5�;,}W
+=E^�%�BA�~�����Ӎqh;���$���!Z�z��
۷�K�v&�=�9�H�#+�*�)�$��W����@qcED�,{�<����||J	���k�vb��j��X��ACq���n�s�(7>����,�i8��WԼw(:�By��͐pޞt
e7,a��R�%�
*�B�8�
�e� m{��M���]m_#�{��
+���m�P%,���
+'u�Us�(nh
9����2� �!s��u�X
{Qe�K=f�^�C�7�,���,���S�>��S<q"�`Ubp����i��c��ϔl���v~6��{�
+��β3�� �����B��b�^y���I���H-<L\�����$j}��g�B�Ŏ�K���䈣G���j�"�BV$�᭏�~�"S��K�E�v
�����=��


`�&���'��R/I�.9���`�
�R�P�o
š
o�]f����?!4��a
�d%�v�8;���F
/�
���L��3p�-B��z>u#o+�RA�T0���ҲDQ�@x�j�v�

��ͩã�O��a�d��.y��%B��L:J�:�q�f����m�_����'��U�e�(��
f�����t
b����y
�RM�(��k�c��2�$>֙Gn��wk�q�&�aj�:5X}��,��IO37�=6
ی
�\�����	
}�3𬟎dd�Z�QP��X�o)<�-�����}����p�Y��0R���,�-֘ʀ
��j:-C(a�C
mY6���ʇ4��*c��X=`$�
�ӷ\�uP�;&��z�����W��]f��X}E;}L�)աp6�j�
\5�����B^U��A�������96W��T5����k-�����#�y��RA���TD�Ýp�L'OB�[�	��F���^w��b� ��x����1��va1r6w���":\C$�+�W;�I�q�f�^o���ic�#&E�jYJ���5�)*_/G�!I�.r��+��̠����dD[H��
F=�1_)���u|:�S�_mk��
3���5~�M`��$���.+�I���<�E".t
��!�l�Xqa.k
+�Z�U�
���^����
���:׷���TD�&�JX��!X���|�h��z��[�|KZ��E�ģfѓ����x{��Y)�;qZ��DZ��	t�����X-�Cy�i=�]�הj���x`�)��(�Y��
�
��

+4�e�ߛ�
�cD�+1Zq�C	B�XhIFg���O���U�;nǟeu�Y5�p�f��9k�[@�
��������D?�~�
�'Rp���[2�t���`vŽo��6�տr��%��_x#��w
�G�]	;6��}�Q`@��t-_�����
��tJ$�X�Ֆ���s��������k#����i+��=E��F	�`F'�#?RG���m���Đ�����%
��~�(����!
+/�R�_��U�]�d U@����3��<�ܫ�!������|���wjy.o|��K°zH�,/�
V�j�U,��Q�\}�7o��
����8UQ	0�PM���m�>?�d0
�"�Ѵ�[J�
�}b}p�9@�sз<�s�v y-[k[�
��J(��K�zw����5#��#
=��o�V�_�M���~&S^ �+�K[k���`�f�xs�9
�l�% �:G�6����uV���GJ��:�����έx�g0�W
���Hk�O�i{��1��|�����b�c�k��d
+��3��P_�B����5ь2Y��nt�/rm������f>N	��g�t
K�Lq�Wh7�{Ÿ����,a}�rr�P�����
+c�%��L�@e�
+ ��N,f�k�Yv�}~jr��{�'t���d6R��)�ݨ��[Ũ}�J(U���.q5����V�J�s��YϱR��CG/SR�����h��*���q��U��mK��1_M�Ɍe��ư<7����Cu��w$�H~��\�=qmvkI��1�{��5�~�;Ó
�Y
E�?�d
!��QI
���?9�pQ���%���'�m�N���TNB�y[�,��,��^�s��a�R��cW���D���YV���^o�ԡ0;7� h����KLz���	I'bi���=�7
+��$}BN�>:���(U����L���QR�K,I�)�wie,cm�3)U'�:'V��nŃ k�<��)��qh����������դ���|S��g?�@v!���?��,q
��=.S�y�\�ʌ{AH�^��0a\�'!��xԟ,�m��]ɞ��+`MՈ��.6�!<7Nax��xkL[��?:�%[y͛�gao�MN�M��"Z[�Y���UE~�F%��@]]�#�Xs���&��n��z��]R��+˝�Mi����M��*�"}��o��{�̕��1:ʛ
[y�
���.7t�º�XM%x&k9r����\WރTMZ�j
g���O܈�Md�fz�[��Us��Z���Bn8v��
���t���H�lN5
<o�%�,��FFf����)(^�C�p�P�� 9�V`[�A�}�m�d#�I�
`�7kC���>��Yb�)��Ad�S4�<���;�Ҁ�����e�6D������i�-�8t��Y� j�L���΂Ż�v��B�
�
b�����h���\j�5��7W�|e�G:
q�e
��෡b#M�7oU�ɖ*U�bd���Tљ�b3=J�s�	C�W	�M
�:L�8T�8�T3��i�]o�t�iZ��A�0���Zӯ��F!p���[4r�{���"e��_&I#�G�^w{�Z����4Z�,�‹:�!$�]�Cz�4]~�>�x�J6
�-M
����/����l�K���Q{Q�/o��E����3<��ja�,0��,�ѝ
6����4I�"��d$%�?�g��mxF#_wӯ:���|�I!�*�Gn
�?���>=�F��Cu�5�iaY��TN�4��
+k���r}~j��T��������k��8
�O�9DF!��4]>��ZH�˰�$�Pfʆ�M'�
+�TM��C��Zc���L�2I5�bo��Ԡ� 40�����Q��K��+��f�i����u��� Ŧ�n�r�Uj��ny��	6�5�
>).��dHLbX0�G��������r�*���z�r��q�=5��hG+�Š�eY|R9�6_bԶ�_��#�4����7�����9���q�ߡnyZD
��lF�q�[���o!�K���6~�۳����KԸ~CH��v��r�G�Q�;;��̹řU���9^��NG6
+�J)+-���c{�	�� fA�<)��9�e-��M�Y�����.n�N�
��A&�=�d�
�|���	������(��-s�8��
+?@[���u6|ui@���
�YGT;��)�����'9{��D�G�������n_ю|���A
{bn%'��b��d4���"{�x�ժp�C_%)'Z`�x9�N]��6��1_��뤳�e���{A���K��[߹T���Z��05��k��$V����Q���
�vb����N�����Qz�
S��o��}5  ?p���5q
�ǝ�p{��t��P�g=�Y
+Gt�{)��2��q�i��h�<B
D�
uݥԒċ�h�>αV��cC��	
�ZL�|wM�U�#F��4�
�S�<�� �o����
>��7BE�
�,1��z�Z�̆:�!��\͖�c���\��
��Q���gm�2�̣�i���V�OJ��]o-F��H�\wt��\����p��I�=��}j�&��h;=
�OTO�׮s�#�<���Y:z�=�o�
����m��6�T�`o�ޒ���Z�3��:4$׭E~�+��
rf
�+���=-^*��.ŕv�O�^O���7ݤ�r��qTY`b=^F1V��2
!ϙN��9Q��y�8��e�E�J�n~�4ΐS����DjHQyh�9�v����[]�5c���,
���Ѽ�*a5p$��7\�̃Y�5 �V>�V��=�]��ouL�
x~�ĉ2;�6�41&�1�A�
+g��g8J�
�eL;J�b���J��‹ �'ڏ��M��[�N�6p��.8���TCr�}V7�U�O-�'1����0l
b�
�F�U��°��%XdîuG��}����M���&
+OP(v^r�zztQs�F�7��?�Y�1<ǃ��/
��TP��
^��fd#�rS�rU�"7�
��c!�
���tp���C���fpF*�
v	���*b��c�;��b�V(s�#4�Q�&�-=����x{��:�}��V�\�/��c�٥Eg
5�`�]����U�x�

��p?��G��E�M���g
ur��4����p���Zi�kH�E�L�ٴ����XBvQ����Nm�:��"*�Ä��@:"J�������Ȏ�.��i�k3�}�
+>�+��)�­ri�t]�At��ð�������ex���{J �"J\&�"���P5�׹
۟���\
���"�G3��|B��x~fO��b��
+S'�
�}�5%�p����qB}�p�*U�1g֑A
zT���BI���n�����}�U�����i_R�+�sg/I�ܨ��0��5�T��Ԫ�q.�"!
%�*y����E�v�v}y5�cYG������[���J*d7�o����\ģ�ǮOV��u��z���e�����7*��?{��q�nG�ś8��*r��H~c)pi�D�osD�8�ܗ�!�g�����:tAb��0��R^��I�.����LA�
+��C�N3n�[�K³�).d�0s&��o]�4�r�
�
+ ��^u��o�si{3^�aY�I=�������l����o���2�R���dLMڌ�C�)U����$��P@`
������OB�lZ��4�tI�)0=I���0Cֿ5��Q��
�8��1nm�A_^����n��Q����wPۑݛ8����:��)̀�A5O��ݘg����k��C�0-)�O���Z�
�H�OJ
C�ޕ�q�w�5�
�?p��_��kfPl��#N�PLR=�=`���
2�X��yױ�
+�E�-4{��#:A"D����n��2cia
~e¹➏�[�&X�uZ0�g������Ӡ�9�7����N��w;Vf�"P9��xE�f҃���:
ҨU�����L��]:�e8��LP�B&
vl��㉲��>�W��KN��w|��ŕ�u��I�e�v��燫p������'yH[3^��o��
+����TX�h֛a{�^�RQ�6iE
'�߮�Sо5������b[�����	�g���r�۵|�
1p�
+�I
+��Q7,"ʹI?$
�Ԝ�G�eJMt ���>0��&YE���O��T}��x�q��.wd��
*�a���4L�Qɗ�ˇ}�D�I�����4�}M�*:�����
m� S���;��w̠
s��tb;�m;�iួz�Xn�
+�3����Jڨ<ϫ��Z���;��ȕ��3�@=�Q�
~���{�9�&
�#
-$��S��-�Q;�6��'������{zv��~e"�M"�����4��=�y8�vY�T���a�BOV������~o�WO�M1�O�
2*�X��m�G(�
���[�
��yޑ��!��� ��2�S>+i�(�R�r,o_�
��uF�4?+$�
6�U%��B.��g���Q������;g�5����`|� rm�Ҽ�~.8?ˉ�ͬžƷ�����|�%Md�.ko�����#��kpg��v�+_�8C�V-@�Ԯ�C�md��NIˊ�A�g���
�WM�1�����Y��]T���o�3�7)��$�/�"������Yv7�|�R%�Y4�{����J�Fd,�g��+��B�P�G
���A}it�5�K���t�oc��
>�i=��\�~���)մ��1#�ȑ�֩���0���������Q��7ٽ�0����4&��XH3vf�|�y�Q4SV)b�k
���A�"�]�k���
���Q+1%qB��<�R�.�ԑu�Ğ�
V�c�F0��\5�dּ�D���u5zK�Y�J~�$"��'�{�SC��īm��> ^Y�OKt����] ���c@=����+��+.�r,�O+��1�4iw�G�d-U21ᦣt�%��e�
ş=\��ƺ%
���p��o�s$��
Eե��_�>��&'~�<���OaX
6PyFܔE�����{
+endstream
+endobj
+18150 0 obj <<
+/Type /FontDescriptor
+/FontName /SBCPHW+NimbusRomNo9L-MediItal
+/Flags 4
+/FontBBox [-200 -324 996 964]
+/Ascent 688
+/CapHeight 688
+/Descent -209
+/ItalicAngle -15
+/StemV 120
+/XHeight 462
+/CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/c/d/e/eight/five/four/i/m/n/o/one/r/s/seven/six/t/three/two/underscore/y)
+/FontFile 18149 0 R
+>> endobj
+18151 0 obj <<
+/Length1 1630
+/Length2 21405
+/Length3 0
+/Length 22250     
+/Filter /FlateDecode
+>>
+stream
+xڬ�c�e�&�f�핕�m�Ҷm۶]i۶m۬�}�ۻO��s��t�+b���3�wF,B9E#[cQ['ZzN�����������-�4����3௜��D��X����FX�ɘ�jl6602888`H B�v��fN reU
+**����c0p��_OGsS ��c+[;kc���׎��� '3c����1 at HVN]BF
@.&�
3�1vз�9X���
�m
�) &� � ��6F����H�K��p�364��f�fhl���`g�`m����`�0uзq��'[�������?	�����+!;ۿ�u��l
�


�� ��	��;O'3}�b;��UlM�Z�:�Sҿta�j���m
N�nN��20�;�Y��������_i8;�ۘ�g� cS}#+cGǿ0�����	�_�׷��r�����g�N��V&�0
�c:��mjnC�ϬHؘ���-7r�����ÿD���P�MB�����
`dlC'c��7$����e��>��(�o!�����7r�+G��K���>�WhQg++}���
��d�m �
@�Ϣ��w����[�[�����������?�I8��m����_j�i��-4w5w36�3w24��[��ٿ��6F�V�6���W[4
���E�dfnhi�	,�V���
+������e�%�$��7
�_�r�I���on���_�F������������
@��������#���&俀���K����
���nz�U�?~�y��/0"6��F���������i���Ԇ�I���[���5���nƆ0k˶�\Ai��N�9Óš��
���v%
J��~ն=�ia�
z5���Ӝ_m�K�v����G���Vd=)�Wy��D}�H[�
lTGt:%p��Q�׋�;`��*G{��
+:�x�
LP��~D.�~��Ov�>����h���@ȵ�����Od�c#�C=��}�8Tٱ�$\�>��IN�z
�_�o.l��KY-��H�ʮ
8���ď1�(
�L��������R�W�!�1��	���B3J�:u������y9�,3W9b�a�#��҈
+Y���T���35B��U�����U"yfؘ��HDx�#�k��ʓ����u:���x������~_��
��D3
�F<�s���[�P^D=A�)�1���sc��l5�
�OYT���C�5�t!ոJ]
�0�a�"�oY7pFI��{�'��hvu����-��͜�7J�A�7
��w_�JA�����0'k\|�/�
56RkF�j�V�d�
�d�D��'q�e�����I]���R��B�",�b�j�%ǀu�L��$�ՠ�\
���&�/y"� ��{��S��B� *� I���mv��$v�^..�Kq�9UhD]�K�AνM����sEZv
�v�3.Y)qf�����x�)`�(JS�]�M�8en9.nJ��O�Y����$�Q\R^T=UbFDjC���Eҿ��X���CJu���
U�\��P
���� �
j������/U?Q�#�́�0u�����!@�re�}�Zk.�dir�^���m�
um��љ����b7Ly�,��y���#��-����V�� ��hg�Ik��
	���嬆h,ʴQ�/d��Hj�Ӣ���
pq؞1o��nC/���]oK�n	2�J�O]�7�,<��V�0B������#,ŔS����׊���_����N�V�$T��Q"_L�K�P�X��TO��1MQi�S��m�2U�XŨ���ʕ�������*v�ل7L���Ȅư�y�]/�
+2n�K=����4[�B�b��泦���:�3.,`�}���c0xw�����j��p��ʄ�>W����ݞb{��ۚ���.���ߙ��������TH؏ n��h[�x�
�e2ۜ��Ky�v�۳4�?�
�f�C[�9�l��E�3�m����V�ko2l{ؾ/}.z��0BT1��T'\RZ�_�Lb�	��\8���k:
� �U :hE�@.G~5C���7�kr�
�yw�%�\ϝ�9�m��+�2ż.o�6�&D6�,�������}��s��v%s�e��Fc
B��� ɛ�%yj
�S��
)g�X���0J
.䄰f
ḇ!�Z�2E�An����JW�敜�:c��KT�~CLB
��#�N�,�I}�uj��x�J�0�o�R��uj��,*����@���jsǯ���`�Y،�f
+� N� ��
���U,x���?/�v��b� Q��Ta���q��#f5���kj:F
?H�Q*uA��d�D~K{l��/ϡ��7x}+q�4k��A�κP��J�G��*v&"��%��g���hя��o�"o(��u�30���_��6�����#��
t�Qܗ���g��3k�����(�aQ�h9hR�;�4�j�(,N��Mn+)/-mI$�5��
]v;V3],���;����7P��_����(pxQ���V�t��Һ����J��ףx���C� =�H�A����C΁
��MB
+>�	�O%�rGA1���{.��faY��qi{�Y��o.�j�:*�/eb���Ǡ�5[
r�y��
�鐇F�`�f��1S��ǘe�&}h�������)KR��(���{x�Qqy0&-�V�
� ر^�	���<���eJO|ۤ�|� ���$�B��� Bu����� ����^ ���`�^�P
�r k�χ�s�p��j�����tG��[R��5���H�Czħ~L�"'�F}�1�5�h �!�&ڬ
���ʁXl^i	d|es�T�S	�K�s��K�T� ��ƾ�q;�J<J,��<��:0���=U�	Lk7ax�
o�7V
����*V*1����R��?(gj�
ès��!�|��
�?_!vl�Op��}
�V�R�uQ 8'
P�}�4"�<����7����]�옠̹�H����^􂙮��#Op���[��E$�
�@ ��D\;�N}0��!�.���j��w�J6����] &6;��2�.��`d���C��d���O�T��3}S���9Ӭ�F����(B�2�~�F��O��G
��
�vwc�Ng3�ϳ�6h/���@�8
Y��)�g�ß
F
+�2���
c�R���M`bk��
e�q���X��Ҕ�nN �n�;O�sYv��蝇s£}��^\�M
������MƵ�l�腭Ԍ3n��.�Y2��S9�8�caW'(x�a{�>Zn5�
B�!v\�������Gޤ�n����me
�v|�:������;VlA���*�Z��][�`Z*nU��LqdR	����8w�����A�	��@D6�6��A���
#s��
��Ujja|��,ć��ӳ��u�t�Z�������g�8jW	����m�(Z���"ן�VUC�+��n��:5�]���DI��
kcU�	k5'�"�mҮ�l}���aGh
t��波uE��M&��jO���5�$�GK�������:� M%��N�����p4ct�OA��
��}sԧ�nhW�
�� �[�D����X�����2�{�O!�N"Ѵ�/ �<6�� rj�J�a��V�z�Aw���>�Q
70y-[p��]�c�EB��
�ـߔp�aa����uF3+�
�v�����I�q�]!¯q�߅��z��tq�LJw䲊�q��#�J�lV`�
�I��/���%���*L�F˂��1C-��7 H�9I/]�$�5��흡<
�OW
+C��
��P��G
5=<}��o�j��m�T�=���ʢ�1e��GөraV�&��F3x�<�/�ز 7И�
�w��2�^���o���������g 'd��w��ͦΖ���i	��K���M�sz�
�	P��>Bs~d}P&�� ˃W�������h��G
�
^a6��j�`�X���������>
=�0��W�±�5v����by:e`(|�"�i��[
��D���*�
�*�+O�����ʲ����=
+�nzg7#�n�y
�̬��ݡ�8ʛ��k`����>��e�۴~t���7������QHw բ��e��6
���O���&�?!��%}���d�0���ҍ��$j���%Ӕ?>
gd���/o:syL4Sd�C���=��s1��Ir"��.
W�4��	9Jsا��N��W�8A
+�1Z�n%.gŎ]q�u�ú�-��Lk�l7h�:�c�����>Cꐾ���7v���'閳�mf���S]�C�r��
-�=�X�5YU�lP%	�������<��w���b>��_\��\(D�!��P���:r�]�!�#�9�c^��w#�ZOO\
s͹��'5��&Z��{����G���z�
+���Z�=�K��w��2�P
+v�x�XI����at~���O
+�FLX�{eS���"�v�Ɔ����[#��;����xD�L���u'���*��ʁ��@��t�fR�η�
)H
.�/�n�w��E�ư�FiT!*�߸+nYm�2�������
���
���~|��ϭP��)�i0'�q^XuO�~
+��t��xJC�1	��_E-2�)��aA$V35ݫ
�� ���Y,/�e׾g��ځr��,Q�H��S�����d�*����o�ℳ K���-M �����K?c��7
��/��2 ��y��]�Q�'|G�b㭏v��s�H��Ĝ���ƴ+
���z��3�=Le������W��2�%fޡۆԣ0�r�=��捸�^5����iҒo�OT�
�Tr-��<�.-�z�
���θCg>Z�����������p
\�-\��-�8+ at 0��
R(�t��'�@�* D
�w��������糉U��Q\z�W)E�շ���c
����v��8�x��c��֥UH	=[>��g'��+v����˵�a�8Tm�ښD� h����ɤK!5�[$r�R2�;
+ӎމ'{�H�锲|*}6���x�[�����X=]W�)�q��M��]
�O�b��L�9nT����d��S8T
+�<Q 
�CE���w9*"�?����H����Î�������g��B<?�U.�_����d��q�3ՌH��ͺY;��L� ;���� [�㒓�ѦCYʂ���.���m�ݲJ�����_,O�����z�Z�\���+��r��K���q�E�b��gtk�Hn��
u��� =�{B�|�P��@L���	<c���,,
+�떥��?�2a�cXV��Ć��
�|K����(�$r�����f���y>3�]1%�n�#d[�;��L?l��7�x��
+!I+K,#��䃵����M�������4�:_8w
��\fCLgjf��'���FZǼ�hj�
�{m��Wv�Y���J������/��R�$B�a�����S
�Y2R��bt�D�'%�r���ט�!U�*Fu�;T��z�з/0�=_u�k�R��
+�\��
��+=�Xi���XPt%�BRL���ۢ��u<uV*y�\1V�kc�hw~���tgv
�
h�s�{8�
+��ؠ�:*^c$�pultY\��㑧oI	]��v5�j֍K;%P�
:kt`�d\\PZ�z���8�!�
)ɰ��U6n4�P�����f�|[��K���w��
�����KWR~����%�?�9�t/�W�	]��p�ێ�F?�a���a{f�l￵��L.טQ9XtAfU��W��)��
t�4�`�,�G$8��6u�M�H�@"��U��P�C�G^.�
xw��C��3O��r�+;����37����z�Bly
�c'�"|)M
+�C2ӎYD�M���� PN
U~�f�OXU��j��
�;`�9���4a�fS���E���$��ޏ�D�X�;���~�)UC�V
�eu/q�v�F��h�{H	J���ꏻ3�����2���+%fu���Y��뉽�Tu���@�]�n��
+�'o�����v��>3�c�Eٛ������rP�
�u�E~^��mV�f6~��4��G���6!��E-P�ʩ�
+TH�
G�}�3?vL�d�u�z��?����� �XP7W�M
��A���^�ֳ΍̘ĭ�� �9K�F���(� ��۵�� �
���5����Mdž�j)J^E�d�]�, �TUbBw��6꼺s�
+c�B��������p��k{��GE��6�i}���۱��];��Z�%�O|<��	P��itߦyw�3����E���y�έ.Л�
LQ��P�Gq{Ԕ6��ŵD'�Q�廣�zw�3=�i���>%��@�V
!A�U��8GKԃ(�d
+���+�c3Xq^���A�ٟ�š�<꘍���=P���fתY��3ta�ڽ��:'�s�f�ֿF2wۜ�b�
�Jd+�m�.��x��x�'/��i�Ujͭ
�����lj�q�G�h��P!6/��|c[!�3�re7�O�x��[j�zU�Z7��
�R�H<���0
a��&Β$mA��S!.�͸�,V��7s^��FnX��4!w������!�bV�
W⤳?���u�s{*4�r05�Z�
�Y���-.I.��Ϫ�������~NY��ZTm����¹ѕ���$Y�>T>�9 ��Zie�1��>���hDG�w�%���9��͠R�$`pP�{�uD������G�\<\p�'C5u���Le?\[�Q�M�03�#���A�'��D��
+��(��0�.<Р^j f�r�\
+������X�,.��ADGΆ]��J�����l����Mp�L����<kwH]@���֩�T���u7��
���
��`d}y.ҏ��;�yP	�N�����=��O���93'��ki�4���;\$��=
Y��_CEX���wHE冂<'
'_���F���
+ݭ~���T&:
�3I�JT}�XR�dI���
�`~/�c�>���[
��
���SQw���FPc�"M��r�Oth����P�
V#�K���҇���)�
E@��@�
�����F'��1bv���v�l���#d���y��\Ʉ"�$.�M���r�� -�
}n
�K���9�����Ͱ�����/}3����Yͼň��w�!�qq5
�sK�v~X �{b
+傌���_�w;�� 
)!^�ّS��p��}le`vͪ�is��R{n�_(��˧/$G��H
\)B<���W��>�>�x�A�`�9԰�A����D��4��b��[@���

�C�Tf�5Xam�+s��B���fb
+ �@Z�syt~x
B
g�٘j��DBzF�<{xs@��?�gI�ޕ�Qy��X�((
���B ��t���T���W�ɠ��!u��A�{(r[��u�(��>�Ÿ6��-q�Q�#�$�o���R�d��В�gH�-�2��q�Z"P��7��p��	��
{�6Iޞ�R��d���O�|�����>�1R��%��y���N���
��$:�I����}&2㉒�ͳU߇�Fq��o��"��
+U�Q�UlR6�P�?��e��)\Ϲ|4�'߃�d)���-R>�4=�&�c=O 
0
�8�1��Xle�*4W�t_��[d��tG���Sj�� ��
�}Z��<�b�.�� ��	��v�y3� j
�����rw�+;��m�+"z9��\Db��ԉ16�K����4ƍ��<]W��lmlg-4�L��

�h�����)

ZǺ:���!=;�0q� 5,��)4
Og0�3�ޣ)�'�џ�c������l�t��=��^�]Q��yb%:��i+��"�k<�w_E\�y���
S� �\[�ts��\o� �_��
�ճ��۝C�
^%�5�L�	�?���
ӕV��lK}����q�~YQÅ��r�FF S��G�<�
���o894^������K�"j�&�x��
�a
�k>Y�P
Nu�#$��e��mHj�f�#vNTx 
v�9�Cŀ�}O��d���6U	��_"M{�$T��J
9�g�� KPη��;d����&�ݐ�{Jɾ�D<�f�8*�
G�T}���
s~
�0�=3E%�@'Gd+)�V at a��-�z_� d�_۰��� f�.�]����q�K�\ڑ� [...]
D�)p����m�m�,	�Qg��+V�X�B��Ӫ�z�����&��X���Ur'�ؘN��I�tB��Ń
wS:�o������\�����>���V��c��
v
!V�p2:q9�Ex3<��j9%ʭgL+�@�Oe���ߖ�./�C� ��;l\������T��Co��P&�$4�
��E�
*2`��`t3������?��w�@���?�����^2L�{��-0K�*V\d�G�wW{�`��i�BL��i0�����F�/�~�s�R�
'�p<��,���H���,��g�\�+%k ����va�#�U�����<�w���
�4c׌X�y�Z
r �s��L��=6��<C����I2y:(* HƦ����d���'<J��
�GSq�k�xB��k~�n����y
$Sf��
��˼�d
"�k<m�jG����J�T��vޏX�����d�� ,v}S`J�2?�E�
��pR�ʐ�mkd��3�^$�f,9X0!' �qy'��`"�v��0�);���r&cT�8OwК��T�D��U���̀�h�b����
v���(�</K�=\�D����D��5�U�`68��
���z���^ЌF� �dvR-���
 \7aH8X�J=NF
�5k蟷	.a��R��o����h�vN�Τ�Xa�f�|�,��eϦ�z�Wd�Lc9�/��C�/�"e�
�K��L��9l�|0A���yȐ��2ä�_q�-�2���H�QuV�b+�Y������Pˊ��n'����׺$�c��%.m>:�<�B�E`�e-�#
�}�����m���ϩt�
hJ*��L{�i�,�� ����x0Xonw܊p�H"vj�5�e`���F��ܒ���]4�yA��.]Z
K7L>7�Ю���Gt݁.l���}���Ӥ˭@I���얗��y�>�ɲ��e6�����>L�m�KF�$�tYr��x�N�F:l��
+���Fv&m�:�,:N�aw�s���4�u��
O���j|i��ɭ�ֱ�[�j�����a|�#��[At�
f�@�N`t�]���L
��N�T���o�B
+̏�K���T'	�ս) ř@��٧z
��G��=�@Se����_	��y(I,�cib'>�$�+ĥ4s�uo�ta��6/��SѺ��!y��s*��.ߕ�
*�
Ѯv�My��� �E{y�s��M���o�%O�u
+��4I�
+�`�!�,ʏk^��❇c��~t!zPv%*��9T���RU������IH!
��w;�G�]:�8
ɗ\�R�39ƒ��*O��Z�-
f����x����,c��-p�~�7
�x����؎�<
�/-���a�d,Z��O�S�io�ʽ
�L,��ʙ�E$��s�5m�^^;�_wx	S|nS�zu��c���Fk�Ť~
�
�	&dHn����1%��O%
朱71�x$�e�`Q��^wl�PQ�]^��
b�ܗ���O#�bGb!
�Y���P�J^�
�����b���S�<v�|�
O>Eԑ(��<
+xD4,tY�� �=�7�t���k��'˔��
��@��[��{����__O����	�7W���S�k����R�;b�kG��JC���i:@ �[��B�����-�by�!`��7�з=��%�
u����sjʸ�#��Q��6��?���f<�Ie_Li
�9J��c\���`e���G�z�<~�

�YWo5�VNx)�r(y���W0|;[�)]�4�,ðų��Kڰ��?�w8_�&�I�o7�>�?ē6tGOM�

X��E$r���8
\=ŀY�/�c����*"Z�`
+��ӹ���Bܒ���u�E�&���uQ����t�̶
!��c~�ʮ��j$
�(���r݃kk��
p&��V�͉
+��Bf�4�-'~h��le[z���Fe��1c����:C��8|��TM\�u�
6
�zN�1G����=��Gz�\�$	����f�*�_����F<A�N���`�2(�:{�;�\	�I�V0�X���%
���)�%
Tb��z�K“\�W9��3'����2JAI�R����i6A�`�9+bv`Q�Xw�Iӎ�E��,�L
��kV\��2Oݗ4��Z�lz�fYz�7i��d�U�)a�S����6�#8d���p���v�]Nz*V��9:�q

�c���DŽq����-"{�X��Е���&n�7 at 7�c&]���u��"
�"�O�����W	2w�1#��y�Մҥ8�������~�g�x$S�΁�td�w��i����f;�
t:�THw�M�����0P�X�P������:��B=�ȺP�)LC��p鵟cᓽ!�e�����)0"=*�������A�1ˋ�.W�5����E��Ϣg����cE��E�Jen�e��I6C=Ti�(�	m9*�h	
�d
��+��t��c#5vmo���%��?�jjJ{篻� '
+�#hc-J=[�A�iէ
2������˾X��1p�;�F暈6�]���
�oxg0x��(D�[��IIc��-
Y�(���E�c/W�6�OH��䪺W��G��G��4����� K��R�e���J��5|c���_i)���(+�Q�,��HL��y4#�"�fA��Y���_/�fZ��9D�|6���녡kG�]&�Sͫ5�
�(IX�Dž����K0x�Q
+����e���H�{�Z
f�M�i��L���$��Y�e��B�h��-z���������d��U����u�!R����C�@?*����������n[�
6y���ɶ�睨�X	Z���<�7�0:�yi���J
�>
�S�V�Ѹ�	]�������u��,���,|`�S#q3��BUg�"�1tn��?
+���W�M84i:7
��Cƅ�Rm$�����<���"�˜��˜u�y�l�I#��%XVR�~��CM�q��GF�5����k�b�6I*�/�ň�G�[���l'��s)2b�xb�R|k�v7o�����
%����*�þ;*#
��y��xN�֬��K_��.
7zd�^K��_�Q
��,6��o�M;��/k��!��K��f��
��܀�&���4$A�
��U��Y�f|����E֟���3���_��v�g��

�v�Z�����F~��6��~l��%L<X@��5?Q��C��^�S����H7�P�����{�`��%}��KU�!P*$g��i��U�fL8�C
Cp�rl+��r�¾/����\]�7�Mvd����L]��pZ��ۮ+ �_ ��q�K¾�.�Է7
K�,6��K
+��Eq�i��a�������P]���	Oùq����ߣ�0ZrJ�9��G	�(ֳ��vK:�����wbVٖ�j
����Y�)�
�d���VG
+��<��ٰ\'��ػK�d�Q$>G{m�,��`�`��j��l���}Zcf��Cd�}kԚzW������`ɡ�y����<R�b|4�-GQ�}t��.1㗾yF�?	-#>�(�9b ~T1�nuU?�c8����3���܌��Xx_�ѼH?��K�$��Y[(�2�:l� ��nt�vԒR|`��� �k��rRڪ���Ѯ?�

+�E�H��`�<ͦ;�X�dZ�d٨2��R�
�ӱ݀���,<�2Z����6��X�.���c���>��(��-�!�K�>�X�H~c��AFX	Y at d��	����T(�`a���Y�U/�%�"2u�|�eh!�
��А�B������a��J(����Bu����1K����$�	��f
\D��?)�R{g[��Jh��sk���e
�5
�|��Z���?�Vt��N�)�/G��IJO�Y"ш�r��0���54�+mš~ڼ๒
��Q)K�^�}��|4�6�w5��
.��kϾZe�,���(ѼP��nl�	9HQO����v��X
+�i>&S�jG�)��r��mOf�w���yi�
�g^^9����|��r��p_Y0����Z��&�f
�!n�Gk"�bkG�!��[�z�keI�]!�F�C�
+���<�|=����]��SzJ�1��de���B�xX���w$„1�ߒ�ف���_L��⏨�����P=���r�����z=e�ۗ9�{�:Ѕ���LƸ0�󲳈�&��s�>@��ʫD�y���#��1���Ǎ��h�9{0P������
+ ��+
����늙i}�yq��>�y5)fJ�-�&�F�u�L�\����7LyI�p�K	����B���άɟ�-EF
ZT���
+?L ��ב�hz��Z�8,s��EuK:�^1���Kf5�u3Bht<��(F�D?8�:
���Tܶ�X�k���>�ޱ=�������=���Ʒq�����5\����
�[�Ћ�cf�
�v�����M��b�v$���='F/
˂�OA$��QDV�^=�P �vh�;X ��Hd���1��
+�܏��2������+����o�'�J�N�I�gO�(�p��A���;\�+�/�P]ޞ���0y1��sA1�V�
R�BX"/9�����=Jۉo� Y�L��q��>7
+��#�1�<$�]\H��
++���y��M�2��H�X`�tg���$�N���{Y�ztN�4�]���J�n�2e�"���v�rs���\��G���
Ғ�4$
+�9N�?)~x{�g ]4�l/X
_���K�3XLX�^/�džWAg#[ L�ر�h�U�c��*Jغw�z�J�V�(x��L�oe����؜B���NJ�8+��
���ڳ��#5�i̴�A�h�����8�t�}}�2�Z���"p3��#�~/�Y#��*

�2�*v��X3�3
+Z28u5�na(��-p%�o��N���g�Mu
O#��v���6nyĊ�Tg�����⟯��M�Z:x�߲���"��
U��ޙ���6���
��,l�G��������>tc>�xv����ST�����J94�Wۥ9��
+Ɩ���l?��f,���
;��y�S�˯���Q�D���%o�-~2(eVpʼ3`s�ޡ�~R2������2Fݱ*�����]	��$>O�Z�;�dO*$&�=��Z0/�6E��q�ٺ2Zl�yq��˵4:6!�'�
{G�#0�k���
)4�h��]����\0��*ܻ-���
�a֥H��h4W��dV 9��
Y�/�F@�<’�ei��'p���g�^ݬTqW��X���Ӆ�ز��j�r
P+��)`����c���%��<YOj�	�0Zi��#����{WO��|��G#�:ܡ�
4s0�6>2�d
۽���S��r
����D������4����@	8��:ƛC�΁�m�[�WLP�.:�!�]�j��o���O�?��q�b�
��u���t��R�yg�X��׌�c�X
~���rNٍ��b^󻼞ܙ�e�?�3}6Oӎ�5�TeZW���3}P�٢��A�E��2�Y�XY�)�A�]s-a�����~�Z��\���{:-K���\@Wu)wﵬ���UB�z��5���S%a��	���/~�

"`�3�J���Eh�j�/��ѯP
nޝ�F"���vVӬn|"
+��g3�v�pb��72�G������T9w1���_���a����]��0bJ�W�>����%n�X�4�XE ��7n��x׼5��|�0*樶b�y���+(��&?U�M��=W݈]�
+�v��8��(�=�?��S;�4���	�^�P�H�����U��z��y��r�߶�#�CW٣j��Mp	4ZJ�趶R�'�}Ҳ�K���WE��1y��,������q��o�Ş���c�Gl۠��N�:ӳ�Ta3E�\d �+���鲯�F_��d���/�GCwEG��5
�Ɍ���A�6��K����U*Q�SN��s�P2�4�n2�
b�:
�/E���,�(n�~�ހ	��R�.y>)�k�^E���B�b�s�]2u����Iו��mUC�/�k,l[�+bt���Vg:��O�
0�|;��QT��|��k��
+���?�\t�V�4�0�
��	$�WE��m�,�G��Eu���$�_"?6;��M�3o�U�Ѩ��;�i~F
+���CJY��}����uż���	������E�e�M���x�}�5W?,�
{���'7�H<x�8�V��
�k��?0��a�e���ɂ�WQ�4��:��Z{+|/r}p
kҖ�����"��v���.�;�,���<�S��<GU�W��v��
��;j�?0V$X�����z
BM�>�/�/k����A�d
�0}���n��s����
��О�ܾ`<&�:����r`I�:�4ć�lVX�ͺ�6l-�|��K�G
+�`�6x��|�q䧆^�.���$��2��_�e�
tV�6� ��g
+�l�.�x����]�i0hо{?[>��y=(&,t{���rqP������

+j�i���
,��)�
��藐�(2�a��CE�}øaF9���@8�V-Atud�ơ�x�m��7��n�I3}(���%����Q��&[��io
#�
���<11��~��E
պU%�ܻ7]��H
w#]=З�,�x���t@�e�,�8�,����>'ݟHkMl��	�e.l���DĖA	DkA����Q�&�Do��x�:��#��|�
��^�Y�,�K_��!L��\
���v�Y��Q#jLdF8��nA9��yO򵹯ǟ6*2����`{2PY�~��=
+��������G��7
�^L����
�b�
��E�y��O5�(��%u��Dpe'Ҹ
�|�f��{�_B
�_� A�o	\�	G�D�
�g����kP�}³ʗ>e�$�?T-I�
+�Py�
�
F���L
/,Z.��!�bi��>Q�u:��܃^�۠�
�|�*����ܣ�K�2����m;�Ȓ)3I}�g79^���|�||R�M�B��W���ʺ���v�Y-�Ė �*E=Q�յ~E>�C5�ݾ/�琛����ӟ%
+�X�ę@��0L��f��#*|Z���N��-��S�	ҳ*��T��2�|�#���B����=H
+	��"������ ōzg*B�Р&�ܩ����L��Y���B�Hx\+�t��ď�
ѷ
y�,��kru�һ,B3�ӄ�8���
+�y
+�6��N��Q.r	�4�H�i��>
ԩM�y=t{�i
��[�
��2&��£4E���
�TxWR+	P����J�o��.I�6��������!�=V�F�o�&fKE^�&?���n!����<C�^��ct
+���g�&5��`t��.�@���峹�a�pN��E�"{"Im��QT��ə���%�戀u4\B��:E��^+d�3c�E��1��T�j��@e
+��r�DΣ7|�ӌ!+
,��!

p�q"��?� �d��=���;x \��M

�'��>b`절B(
Zvr��s�R�A������
{�J++�
w%��ye��
F��i*�X���RXc1f�JmkD,�
|QD�}�)l�ձ���`ď��y_�4M�>0�Z�]��><��g�e��THRګ��)��u�v&"��%g�"��\��b�x��;�\u�pI}�	7�X��X���D�,25�
�
��;l	 �j/t<����!S�m��ݛ�
��Y+37��
�ۢf�e�
u6��l��ֶ����^m����M]��T�l-�]$Y���m|znu�T|��)ʼZ����%oo�6�md�-�V�����ډ���2.������	Yz��>��Ŀ
����Ͻj��/�m_5�x����9�}=��`�X����c�{:({�{��k7
O�
#WK4E�z/�
:�Q��;�S�:��d�s`@cpu{忼����fE��kF�.F/��B"�c��39�x��
�
'�|O��h�"B������&��0>��Zh�}n�j���.
�5.���Ɠ$��v�o��_1|%�-�B-���v���\L�?�,/,-�%`
Q*դ^���^
+���o�h��F�Ѡ��)���E�ɏ�x���|��p��
~d�1<.y�ƙ��:
D�@Z1�B����$	d9S%��
���E���i��q���
j\�~������t
+�'y�K?U�u�h��Ұ>��!�
S)�L�<K����<Y�Hh�J�ͺ�9a4Ć$���<����ق
u�
+�ٓ���d������n_����V�������G�G`��;�r�����6^%���c*�M�_ï�=�Y�o��
0��l�t�'\�6H!Ȁ\�nB���:��<�X��6g�5<�Ny������
+7K8[Z��x�T\��O��G��L�
'<"&AǦ_��0��4
�ٰ��������-�
q<��@K�bK��-�轫�E
S�3S�@�
4�[>|n�W�z�F1�x@�_���� ����p��D�@���� ܊�o�D��'Oo������qQ�$�P����p6�$}Kb�⿀�N�ʒ�'뼖��
�L���f�<<-C��m&���ƻ&huٴ�M30q��-K@
?^'�P�-Fc���{�JEG��2�p/���`	��;ԙf?����uȷN at 9Ho
��h�2ȠI��%�eN��DN�"�ՠPk�����"���,��y�,��?VL�:�F
ߣ�yƼV���Y
�;�Uƫ����H�fI���
���#+��.%"��f�'B�B��`h2vy2���b�f��K��ۆ>6�
+���E���X��`1�
-6cW-C��H�ϼ�r���ߗ��W�Y�1=b����Xog%
+ƙ	D�
+�=#�Y���(_��5ǂ��t�q�h�� �L[\�\: z�x��

U���*5Ž
+ N`nT}�Y�LO�s�2ڙ���9�`�|�U+Vw���V0��䩨|U�=D����ǖ
�
+i�"��@S�/=Tk���A0![�!ܸ�

��U�)�
+�R���<�Pz+Jvي���*�Nz�~C��;��%b�pѭ������Aa��.��,DJ`��	���O4���o�!���ٗ���;����Z����ޕMi��`P4Kb
g)|c[!m����,&
s�r��
,�fj�%����v;-Oڷ�N�# &��?Z%�\��Ч��]nX
��
+����I9���������
�� �m
���N��`�'ճ�ޢ��΢�z�m
�P�iL
�F�d�>�&�ݮ�y҃�Wec�-
+����fڐ��W��d�^ph�,��ӊ+zE���L�.�S�
ޮ����T��� �B1��$
�8��z��ޢ�`����|�3�_��b��r�.�1
�{��2�
x�e��W�K���Cr����a��%�'��N��J��/6� c�)�m�#�����p	.A�.jd
7�����DŅ���|(�-Q�;��l<�tۣ.��9R���<�V��pc��My�H�G�
d}g�v�)Ć�W�E)땱�Ҋ�F�_f�0>H��!*0�9�"S
e������*c�M���F� ��,&�q��}�EKv�]��+W�⭝�����Kq��=�p�
���xY. �
h}xl�����U

Ǽ�>����V���..
�E^��M��`���4�
�-	"Z�9
+��Xa�>	s��E�tـ�ޒy3�.Ӛ�\O
�~
�4�Ӿ�2����I�� �vD��7�`�}sv<t�!}��Mo��
�[}fx�����f��Vu|Ö�Ӓ�ZgM�8�K|?ye���SN���;�υ����|_��ddg�����c{�q�\O��0���C
�Íd�����y9C5�7�.+OO��t�����r@�_�`J�eG^/R3�
D 5
�p-�){̦I
�@Z
��N��n"��df�m�� ��7ʺ����9�6V�b����p�E��U�b�)��H詂y}�Wl��v��ub�����y��d Z6��>���؏P 
� �EP�7!�&k Ƅ7
��~�޼8	Q"��
��B<
-R귞t{�W��E��u_��:�I�!s�Q=��:Q=ˆ�d�AG����ŗ	
'�u�A���9
���.k�J�4g�v����%�r�f��5pvE���p��7oH�z9�`�k�F�=	*AZF
+�C��21q2�m�K�i��x���b���q�=
�u6
��6�-AM��#��"���.��
	�
�ҳ��ڜ��#����2M�x�BÌ
P+��8�F���"
զ��3�3}8>��6�.�/
�T]����K_�c?M_C��&)��*��b�\-u�|�	-cFh4& �Z
��-��r�V
+{���M]�p�Cn���U��";4��K}/X!�9[k�	�#�7�Qdσ�ު?J�5�D?��O,`Ta꒟��_��o��kͨML� ���߽xP�{�诤��;!���k+��8ԋ�*���T at t��ħ147�dYsg�����x4�[!I��5�������]Z��F͵7B�~(n`�FUy��'gT�Pƀ��F(�k��Z�(�C�������ś4|�,n��F�)�
�F$6Qع�b�dQ�B�
�W+�>⋧C����e���Q���!��nU�%ފQ�<��&�L�b����*Q,��V�>����
�OFWbiԌ�9)��ȴ��X����P.#y�Q ��R�����r.�n�4��-��N	
M��&��&��F�g���Z����k`��& ��]��O
vƷ���`����m��T���v�� ˕����`�ul��5{�IW�-���F�U덠������P8����џg�D��@ii�U�C�� (~b=w�VwݎJ�8)�V/�r:[��
+߰�L9gH�c'�q؍�m1\BM�H�d�@�вmD����Zxg,cM8����
3��뫶�DeFq�@v<6(2@j���
���7i䀱�K�@�q��O(y��P�C��.�ha
AN�
����WI��5��|\���
�Rjb�ʡ@�����kMj�zHՎ��h�������.�
+��������[3Bp��VÅW
s:��;ۑ�^���`�mk�6i} |
+uݝ�����2jY�X�}�Y�0�yC�K<��
�9��+HM�
޶_���K/�"���'�ې=��ž>


`�A�8�wE�����u�����?�@��-�
�9H*�>�
>AO��d��d�Xs;HOQ4��0��2�q�˳}-j�m�$n������2�
m��t-@)�C��?�~@��9A��Y%!o�j�Vd�
�����~��}8��́S4VZ�\��Q�.��qY��VI�c�r���E�5C$)��5�j�m�9-RyE2��<�^6#4��HzßU��h>��|ms:a���(���OU�F���
Y2T0�I�d AQ�
+��s�����$ss�&�b9;V�ݴք��0P�z��������c��
���S�x��01<�`�d��/%/*3��	��=��-�������a
+VN�O�ٿ�V�yu�� �B��˞vY�9���^\����S���L���P��V��G�߄�l
}κ+�+!J��A��l�5�$��T0����
ms��s
I
�쮘_��s�J��p�ϻo�͟@�Pu�+��>�ܱȃV!*����q��wx�Bh����" 4��y�3�
�v%�Zm���~��J�ܘx�3��$�񪨀�Kys�WX�2G�"cl��+~��4���p
 �X����sELc�����g	�
�G�NNť����T=��\�i�n��_U�S�s-Y�
Ÿ~鯇<,�P%BY��j��m�]1�kH��k�
�T
�
�кY��^���]{o�f�˯���#���Ԇi�߰���d"�������GC��H��JS1�82çzR"D����_�)���,3a�dgp�E|˝t� �{�+z���!>�����c�mCO�;O�QLNzj�X�eX�#�&P~
���iυ=�#6����S톎��Դ��Ud���}IȄ�.�ж�͹6
�wSO��Fɿ�;���v�/lL�$�qK7
+���'dD�L.5)��*��ZL�F����U�ˠ��vb���r�0�ԙ����E����
�
�}G�����o$j��D�I� C���"��
쇶�����f��}��7���
�O�ܲ�
�z#�~h�"�z�$Sp��3� ȹCS�t�un�-s�$ީ�K����VC�ZO�������I�b%��B��j�즯�/3�#�P{���/�H���
����F������
�*�xS;��ܝ���6�����Z9U��:t(��0n2.[J�{4������'�gj��t��F�g&m��42���J�4ۏ����C;����icf0d��99����n�	u.QЛ���.��
� �~�C���2�(ܵ�G��%����
�
�jG����L3��
�ô4@�+�Sx�t�7��;��>��g�ï�L�!��o��D�͆�’ 7^�c_��'�ϑ
�ߗ?�'�s�}9�
kc
E�۝s�+�*��~A'1^T�
+�Y�Ѩ`j���	.�vD��ڗ�l%\�炭R�iX:�;��U�2�8V��K+�
�3�����
V>��]8�8s9"��My�K0<��<c78B
�t�8Ǻ!��C���סhv�P���5�"p�[K�!Z��u��ioa����[�W���]֞!Gi��[�x�
�-�s�?;�q�	$r�`�x\��|ŵ�o����p"bi��"ws��b�Ļ~�M0�[
��`���M.)���W?�f��1RY��a�,ښ�֊�>�:^�=v\b��pʀc�M±䠃jP�I�H���#
�G=e����tvN�!�<�2G�W�s:|�
��
oƀ���~̳%m�{Q7��
+=��|�"k�e|Ӥu���(�����`�ˇ�
���s#�.1ڍ���5�@L9)���b�'@��qn�at1�LO,�R��$�%5v/4@�<JS�a&�N�O�8�2�O��f���Xkh0)AfY��
&�3�����}��c�
9��aL�޺1%FW/_�x1
+���#ei�!��d6����/6n����ˇ�N��� 6�
^G��;�1�db�7>I�3k?X�\�:����v�#��{��V޳�Gc����9�zbp�s&}��Ea
�/6�Zrp��숂��b��"Vu��;a/K��,�}�(��/}k���tp��
���L?vaPЖ��>�����_투�/|K̆�U��eR-&��f�Đ��b���4#�
z�4�o
��|Z�CNd����}��|w�>��z%�{����f]�=jOH�6X�:��bYua5 0ԩ!
�Q~g�z4���\jl��fA;y��J���7���6Q[W*
��ƻ���$�7��>!�� 	*6&^���
�LR8��$6��zE��$b�'�冲j<����]�&
ʱ��=�kU�m� ^+�W�Ma��5�~x�%�|�^���eI7eZ���J��-l����x_�
pwIZX�CJ�
+��C˦bn�������f��}T�|#@���-��GC�����ר!��t5Tu���]8�AجQ��PO�c=��*N��t����̴wى�%Ko��P�4����ӢƼ���x9ZJ��ԡ��lܘ!!s�>(�d���
�l��j�tЄ,+Cq~a�jY�e}�Ѐ%"��39y�Q�@#�hwm����k9�7�t�
�
l�x���1�;�s��%
�w��
s���cV+6	 �F�[Ky=��г�yi�����J��M�rq�=���1:�n�NTU5�U&�S;�*Y���B~1�<�If��)�}v�{�+
w��_M�O
%�Aخ�����|%s�5{ ]#��C;������2,�
�
�T�%S���8nF�s1u���X.a�I#����g�I�-��1V0+�B��τFJ{�-ʖ3`�%)�h'�UG����t�{��8�*�)��d� ��b�T���N!���h1pD��5��Ƕ�M;c
<�9�%��3$�<Q2P2����׶�x�3�ۋ�m
��y�p.v��]L��)�1�#3o�������Q�	�1q/�URqņ �8~X��C�Qb�.o�0�+v��3�9�_yI%1�[���4N]�
�I�
+endstream
+endobj
+18152 0 obj <<
+/Type /FontDescriptor
+/FontName /DODIPJ+NimbusRomNo9L-Regu
+/Flags 4
+/FontBBox [-168 -281 1000 924]
+/Ascent 678
+/CapHeight 651
+/Descent -216
+/ItalicAngle 0
+/StemV 85
+/XHeight 450
+/CharSet (/A/AE/B/C/D/E/Eacute/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/aacute/adieresis/agrave/ampersand/at/b/backslash/braceleft/braceright/bracketleft/bracketright/bullet/c/colon/comma/copyright/d/e/eacute/egrave/eight/emdash/endash/equal/exclam/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/quotedbl/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 18151 0 R
+>> endobj
+18153 0 obj <<
+/Length1 1647
+/Length2 18029
+/Length3 0
+/Length 18888     
+/Filter /FlateDecode
+>>
+stream
+xڬ�c�eݲ%����i�vVfVڶm۶�J۶+mVڶ���ӷo?���O�����f�#"�k��+�	�����:�1�3rd-l
]��ld��M�\$�
�1622Gg
;[Qgn���1@����
`���!���{8Z��;(Uըhhh������� =�,�l�\M���mLl��R�_;*�� ��M ��& 9y
I� ��*�&�&���w1��0H[��:�PL�
��^ ��l�-�)͉�/��� �dobd���������`o�hc����`�0s4�u�{�v 
[#k��k7��WB��vw�������99;9Z�;�F��w������v��
�L��4�3r���ai����N gw�b� �-��
<���Kf�h�4\�,l��3Z�����������_�������	�ߪ7�������ݿv��
,��L�M�a����4r������~��5�01��n�b������򟞡������������A���oH ������}"�7H��"����o��W���K��z��+�������������
4���� 
�g�X8�8F�W
k����ݭf���'���
B���BtLl�l�6[8�[���[8�L
��
޿�*��&���&E����ubd�/�������?j��2�5��5���_0��++�P��?L�m�����
�&��IM���-���sx�1�s�9�^ƿב�����'쿈��s-c��h��b�gdd������t�
������?}��l`k��������������+����.������ڲ�O�ezV�s
f�Ȥ��@�H�}i��B��^���
�J�����i�v��3��)�ñ>
k��T��<��B�?�
4��
����j�^׋��`�쌪���
+��%�ӝ,�P��T�$���h�O��Fi
q�]HM@(uEg��I'�OC�#ý����4�q�d<��)gD��
���F_�o�
.�n�^��.$���v"���������A���iN�k�M���#�"|$�0���L� �:�X���GDF��-)��nWu����TxoqJ��
I�;�|5uV�V
�uJ�
�,X�'a��?
�Ă��ɑ����چ���Ŷb	'����n'%�2��SP,���d(�	yo��O�Š5J�
�g���%��k�w�
�
�ӊh=���>�C�U�ޣ�
ϭL-5������"[�X���!�� WI��Ԃ�)
+��`j�175%��HK �/����
��z�3�6~��FL�ƙ��y�P(�
+<cj�4�x�x_��X��E�K`�_chQ�~Z�X��0^S��qˢ���Ѕ�uX�F�������jZ���h�9�|����5e��Wi�
��
�t����XYp�캝B@᧚Z�@G4K�'�����ʥQ�6��C�5}P>�+��x�
�'�(
2n�\8 ���+䆦��gP��V?4ԣ�L*
�=r����dV8�ڥ|�Z#�SĜ�
�T7Չ�6��Ȑ&�.rA�G?�kwsq�3�C�X�Z L��FW:UH-z��yT�
*�Jc�q������4
vdo�$���@C��0��0o��Q2�m`FPy�N���p�
��DB�y8�W��*
ldQ�b5��麚�:���G}M_m��y�0_
�45�;�w	 ��i�Vs~�8��l��z#�Vf��H	�!0���fs��Q0f��D
=3�
+	
l�.��#Ԇ0?X3��xc�r@�
v�4�곜!�)�Z� �iω!%�(3�t*�"�:|�?+�eu%Z�sm=�9Ǭ��й�Q��gS�_�O��~�K��Qmt3�:|�<�*�~Z���� ��*��L���T�i��a2"N�'c�W�u-�v�lm�/�Q9�䣮lm؞�#�����a�ĭ�SF��IuCؽ�8b��Gn54�y'���Ja�F�:3w"�s-N�O�
+����ѕ��=F$s�↿�8
�=�ˀ���'?��W]� Yfr2Y!#控gv�\�@�i��B�T���]>Vw����8+�Ս�x�
1�!>T#��)��쒝�W�0s��wcN����OD���
Q-q�J���[
rT��Ц���♍q�:_|Y�8Q'8{�Ջ��o���椗.C����7B�qH�۷��
��x6 �=p]��+�db��t�P���Q��lW%�G~��õץhn�p� 3�?��O�J*
��U��`,��ڔ������q�����SP� ��s�ړ�)����T.���Nڔ8�������.�v�`ʢHծ)jyM4���W����| �Q,ğ"�@b���s�����W��b��@\���ؔ��J ,�?5�I�,����ٚi�=U��5�ĕ�6
<F��&��y�����J5{�M��Q��9���vy��������r:QI�
9C"����B���v�l��,�h��
w���uD;��s$�T�4E�R�>�L�
�#�L

QQJf"-�8f;:���},kw8��
�n��`���؈m��K@�eR}�*Jl����)[�+b�0d�=6K� �]�l�&W�ٽA�?�+��#��<�k��W�XK�'ԟ��-�0�
�.�RTs�uL���`j���L
����Fw��-�G+�Y������5�>�?<�M7�7��ݭOwv����F�V��,��M�w $�+oQ��А�K�)j)�5c9�,"�Xs����?a��c����;��|�zN���I��XB��Co�%m��Z���!e�]uI̻��4�\jm�!�~(���!��H-�g�g�/J �	خ�(�@�Z�Vd��ﻍ�*���3�
W�~Gn�'���9�#�
�.��m@�1-rc<�Q����r4(0k�r� e0�$�n�H�]p	V��q3���v���qd_�#���0�P�ӧW��E0u.�R���Յ�[j�+���3a��]���� �J����?�[��(����=�=%�Bq����3`����e [...]
+�s�N����./�+�T��X'�;q�P���l�C��
��\�%ӎ�]*��L3��/c��UK#ZxX�-��,�s��UT�h��W�jY��x��}��Jy��1n�r#5y(O�<�eqj��i���Yn.���+J�Ǔ��f}��k�1�I{�W�<��Jݞ�I,;{���r��w(��]�[�金��0|:��8"�{��k��縸 �IHݠ�;R;C9
b
l�B9�r���
+ގ�5�&��{�������G�P��ګr��8�s#[�����v��Q��bhR��ի�NК�F�<Y�+�vS�n��m3?Zb��%J_�€ve���1>��BE�|skk�x�Ilk��A�F��&� ���)��g�܆z�Y�H����~�ubX^x�Y�DGW�� N��6���r��B����
l#հ�.� �m���I�!R�[8�/����_�[s�t��mT���R[F���Q���>nS�]i���O��La�y�U�
���t��e�t-G"
�&�$K�Z�qWR�Ϩ~&[�hi����-��� b_��H�Ðv���P��g�L犁a��pTj���=7)�hW�KL^���Ģ���ZiX�D��3��g����
��;��V�D���LR��e�B՞^��*��Z��+GH�"�1Y�]\+/	�
���o�L쯉s�3Ϯ[Ѓ)K5u�w������O��w�(r�t�B���	�F�`�i�\���N,,��|Q��%
�թ��V)�Ja��&��,�⽣�#�\{�gNUҬ���1����h������
��x��ڐ#0Wpԯ
<��@�	2m�H~�9�znq���j�o�=8Kҋ���.4H߾�%�
i�91��b��Tpi��.:�RΩ, �!n�ģЫf�I�Hx�:qm�(�|	��/f�W�
��p�E�Kt?�����f#��
�ڃ؎�:��o$�QV�����פ����f�T,�a�����d at o�e~@G"ӆ/
�25]���e�iъ{�8?�YG�
\g��p��*��@�G־�Wh���m
��I���iA��.�L��Tu��ힲ@���l�vЖ�����E��r�3n)�K������m���?#�\|5�6��	L�>�i�r�
uľ/;�D/���#�"����-��!���K�����A��y
C�jvk5�H�W�a�. at Y^\ԇ�cx>ٌ��>��*�`��5����B!OPkh at 4#�/V��u��h��]_���c5�cՄ>�v\�5ia��\iK
�N<C��1�9qP�\7T)�\��C7[9w$m���FM��\���ǫ�H-�����f�f;T�Cs����z0H?
v�m�~k���
+��,|��W4�
͵�
R���5��v�5���&tϽ�����S�.���UFiF��1"KP����Sw��$�
`5�_�?�j�"�~�q]'��@�:m��={%�|$�
+�J9�T�M��	�},���K

�xEh_�9z����-���Jt
����k��A�&>W2נ.��}z� ޶�Xg�3�V�OB'/$�����6	ה���6���tLw`Hb�G�X
���i;��>Qb��a!W���f�K�I�p��iЄ��w�wN_�2����
�[-���
+��6�'͔����0���m�+���lH������1
w�ث~�p㦽��#�ی��<�ь��8+O���4�
+��Ψ��`�&T�:���������;-��"}Ceɽ�.��A><D�2d�ʟ�}1	H��ǡ+T2n#��B�PH���I�){��HJԑ�@�9f�[�Tƺ��	ŸcidW�ݙ=��������C9 .O��㐞�
+]����
+�
�R�����}������Ʉ����0��$"9�&��
+��B&ҟ�aC}{��#�q'n�18�𪭜�C�s���3������皐�b�;�H⍒]���<��~�4��[8F����
�̱�ʊqRf�ȩ���1^���4s��&ᅬAi�[���)oH��ה�,���{���Z5,!��9;�{j�T��3���wuʟ��	��G��s���$�

G3�

+Wl�5hܼr9KVty��nr}�9����X��b
k��Y H+X���d�K�$�H��.o�e�8�
h� �H�ߤ�-c���M��S���8W��]n��掼�69?
���Tߟmr��CUn��z�
+^l��ΙJ��3�rv
`�`���v��򓬼��7�@��փ����3�Ř_vٚ]����" Q�O��y�V-p����
��ie�,)��}�L���4�iٽ���J��E(
6����r�05R���W��[VE�W�
�f���{$F����Q
���(3�xs����ߐb-Ro
��/����
2��
jA硼7�%���B�(�6a���h
5��.
+��N@�ګ�h�z��Ó��������9e�����c��A}NU�ǾRx��g�����HP�N}�p�
���5?�)sϴ��@�Ϻ��JRFK�*c؃y���w�/�욲�STZX��Ӈjw$�Qe���BT(2�=eO0Wm�|��N�T2Z��@;ѱ{�
+�g
��33�:*��}F���p����
��}�E�+
}�A� �!�`R^t]�w�c�91!��2q�+���P='0��GO?�"�Fqd�[��2���,?�Xy�~��0��8l��7//�7�Ed�ĺ��e)ad3ɽU��N�\
�r,{�p
�(��%�7�H
+��V
+ wv�%��W󨂦z~� ]R�]�1��,�2�J��3�R
u�����K�B[�L�8
+�j��c:h�rM��ݑ���l�.+*� ��B*����f?��vj$�i�i�6�j�l6[��]�os����/��N�U1���:�{‡
�.�+齷۩spX�vk�������ii*^%H�vC�cd����3wemE���?�KU��ew���3;����%�����|˄Ү]9�uc��赊=����@t�T�O0���d���w�P���;�Y
���0��d�e�`�O����Y��Bz��<���Cr��FY��]�ͤ�`.���2lϮz����g7Ft5�
�f��!���|���'�5T�Bꂇ|�	�E��"���Q	�U����*���H��o�;]�0��i�;I,�4�|q���(W3�o8���Q]>�O2J
F�� ��+q��g^�O|�aa��)���{a+��:}Χ
�;��+�!'�b����^����)��!�!�k����>�
��E�iU��
�5��.�T����@���ީ'�e�)��Nb�Ac�up�<���C��?Y���s 3���u��.�
+�1h�w[�<<�,�����EA2iK���
%�!:
�a���2�:��>
 &���hП���j��`��a�5�ȝJ`��m�^��)V�R�(�Ҿ�P���M��f~ �{��1���y{It�
�QZ*jH���n�4w�澳+=�N�UA�4���̀Q����Fn���t.\iRE)�'wP��[��Yu�䆋f�Œp
@�&M<�Y�]�rG2ػ ��@d�γW����j��EF��<�w��yV��D��/^T�ns��x�<
���ZTVaq%�Q�q4i%
U����a�xb{-ט��,'������u�NdT�-��-@�.�;�$�k O�=������$�ب���ZU��_ĉ�+�I���R��s��Ƶ�j�p=D�5�xM�GȖ[��;/�岌�g�Q�l�<xq3ZC��s�����
�
+mR���\ ��N8�_:�4�Y
ƍ  u���N/�&VD�w�‪�ȏ�d��`��M�=����~�F⃃2��0������Shpz�tF,T��H�9����1�*�(����`BZ���@-��z^�b�
����5�"P{�#2E
y7�F����W�N��(P��m*�U��<x#MXI_���>|j&���vӶ�����B�B��L�y`.hNtDl
G_�%�T�ˡs��Ν�ڱ.����ļ:(a|��3��/�c{�B��������b*��բ����"�{�)
��;I�|���k�S�
+��}>`��B+
,���9Γ
-�m�
�(ŽB�y�$�%�7�wz4�
t�l�X!w�<�	NTsR���GI0c"
��:�5���ɝ�H/��́
N>֧n�3��_�Pԛ6N� �vu���]�t��#�
+�M
8��%k?���Cvb��̓�Ź�Ɋ_4ߔ����z�ib"�U����i�=��<[1�i=��	Oz�4���8��^#�y�����&�5�3w��c7M`���}�PRa���\�W����
�~M|Աk��7�?~9���óm�)H[�^K��
�7�“��OF(�)����� F�Y�'�D���@��T�+L�
ai���)$���H-��r��
9rp��^��
���@�>�޶@")���<�7U��[p�h�@c�~�,�ޣ?�Q8���&��sc��Tr���mq^
j�[�N5��ث�ڍ�%·;{�o$�����
�\��N��\��");���t�lE�X*�3I
~w3
�D�[0�ם��!�I�l���!��ZN��
%A�!
+��"F#����A�����B	f����
D�
@��lV�����䋻0�)`�t�jg�J�=,�u��.ǭ�JY��(��]�T������������h3�~F��!��8��j8Ш��uK����6�H���P���<J�m��:�?6U}�zk0���#"�C�i�eoa+���&���XpU�|��W!`�٭�P(vt�'�
�|�!��&
+̒J���U!�P�a�TjS���̨�p����
o�{���iA
��C��
p�ޟ��8�T���_����fq�+��8�R3"��z�'��7MSi>���gTb�9���2���֞��W��0m)�Pj�t�a�L����TA�f�&<������� ��G�ں�~�L�S:n��O��|�˟�<w>T��WB�gW�h<4�Ԗz�+i"ٌ����z;ӥ���e�)aޣEc�����_W��[��r��J1
+��Vѯ2�^+&WY�n4��
����#ix�%��^�1���{҅���"�Y��v-N�
�F!R���[��ڈ���?W�ҐN�
΂��Z:AH�U��T�;x�=l��"���b
�-��sL
F"���w���/�!�gD�����d�<�[����
���p�fq͓��������7���.zza�
����^�*��v�`:�R��r�y��^�ݡ~����`S[�%��wQ�R�&�������o�y����Y��X�D�_�a
��>�1�
��&lr�)#�%�7�.`�
{�8�@��*b�,���t���Z]��I_ڂQ�H��h�
Q�g
��>�~"Y_VgX<
�,�
|P�"�ߑ����@:]�Q�F�`�W��Zp��QoWéG�N*X.�WJo��J.����I~�ތ�2�O.�*�DD+�8����sŒ�c�.����_�"X�&4t0�
���Qּ���
s �
+F���/<l�6�e����hMv0�X�����pJԤ�h/���@�3|뽊�y�p�����{l��тm �+u�!U�R�6�_
O|BKA��vUA���<]�j��y�$�C��=Y��C�7,&���R��j-��
*�i��W
QǼ@�q:f���%�n�4R��5�u
�$�X��c6h��R������
K����襽5��#{�/��~R��pP ��\�+�O@�a��w�
,�I
�.�EMeɯ-ø05U�|9�\x�$m���_2>��vń.i��$f���.���D|������[��
��BU��2�������\a��}�������z�p
�}&`�Mtع�;n����(��?P�M}��,4��5�3�	Qm},DG0���Ւ.�D��k��_Ej�
Y�`#�S��
�����
+�����Әȓ��w����S,���\�売�d�
�,�Ӄ
S��:�@��1Ͼm.N݀���~[����R�*�Iz��S��?@��3�'mf�c*DjԞ@�%'
�� �r��Y��I���3(N	�}z?���(e�\�ٙsF?�a+F�@0\���J�7�
����Cz���|�W�e�����eص���TDä
}� ���n�WN��ݾ-��������T������R
��=*`�m^����rQY��6TB��
іt��>�<rl�ٮ&V�p�Mf2ʜ�'H���v~k��rG�1M>R��L
���8)+���9��
(3FU����O��>��ʛ�_e>0>�2��kw��f�5_
�8zy�Ѿ�����vK���z�z��HO�o� ��5�}�Z�z�v} \7��x�
+![2���@Ћ�Y��r�K�|���[@��V�?su��O����a�j����r�Ћ��{�+v{�.�����
|h�<h�-;�klg9P����tI�u�Rʩ��T�4e��OM�Rcǁ�����f�T��#�� �(
m��8
-`Զ��{#��rjD"u��Y�	Ѩ�;
+�4�g�k
ޏ����_5�
+{��#O�
�UM�rr
+��z;wԴ_}Pl1,���H�ċ3'�W�0�V �
k	̟k��K��PF}6�1j�*��X��\$�e6x��0�8>�מ2t�����D}���߾V��U��K
����O@��+��]
���w�g�R�g�Mggq���B�O�/��q��j��6���g���l泿ԥ
ɡ�8:��������Eg��RP�-w/.�K����V����ʽ�S�M�땊��ҡ���M��jG6��M��z�/�u�ʡJ�\�ݍ�5P�Aw�cI=e�XWD+b�a܄@j�M�����4-Br��D�o!��0p꼷�
ܱ)�z)��j!���[�DlO��!��!-Fy�^��1py7?�]�
�)�'�
+��8��4qm�
Y"c]rߴ��AE�F#�Ə�R�[�lŜt����Wdvz������&����zI�[/�Q���8�~�'��.�
e�eD��]��w�ʋ^BsX\Q���G�hMK[Ѯ\�H����h�!�gv�

Q����&
v_l��lɭ
'Ƹ�޴�9���@�R��Lt�tT�ikI�s��N�u�v����cB�
���<t���G�b�
+�jPY?g(�$Y�C��
nc�u�zP���/Gd��H���� ���Ngo�ӆ��j3
�2̈́�4�hx�G���;��8T�p����.l2ܐ�(��)�2��N����"�o�T)`�lu�HӀ2�H�sdk�8�}�
epq0��9�"?b53�������f?���z�����	���#��K^�R��
Z
�M�:�b�l��k�˂y"�id{9ww��<A��z�S����x��0r˰�xyU��Ͱ)�:
i�+ZG�L
�@�����ʎ�!����;MU!� ګ�T�;��ڭ5�_ԭ�?���%�+�]�5�ιL���.�
Ns䓊�4��& ,�4�vEp�����ɠ�zܶZ
fZE٤{�ΕՠWd
+�O�Ngȉ�o@�*e��n�N��̄����V�|5�#,�G	�/+,�%�P�u�t�c�E��]pDV� �Z�%�!p�?b�6
;t���F�	��v�
���w騫Jo&���0�Ҏ[?�I�[ɀ#җ��3��x;JЩ-.ܫ��Z�
d�:`Q�h�zH�~�̲��
+m�ٷ0��Z�1�I�w$�UUMd��!�ՆPm��c�?�����;�P+������
<w�N�����Cɂ��*�������0��VI[�
���Z���@�d
^4a#��lY
]W	��J�q͗5��C��;j��2\�-�#�O����h� L����V��d�ޗ�����?���C�B5�j�����7řO`�z+�)��$�x\E���W-�v)aڊ��Ub����2��Ͽ��ʏE�itf� ��|\a��̕P�x6��<bH#hF2
nوS資��L�BA���/�\?�j�Əy�0�Ԣ#6yNYFR��Dh|�w�R ?ФHנ�2!�����I���
c�`��ouh���M��f��>Si|������K}�<�{J�4Q�
����_
��R��A��zo0]!o�]r���3�W=]��$= ,��o͝�%� i")�
Ex�2?(d�d"zN��nzC@�z�S�=R3�wL����ȭ̑H������/I����;��F�h����[�[�h˅���99u��X�s�4�����rV��S|&t�aj�&�Uf
m)�K7"
�����De>���yǸ�ph�eN@ܑ��o�(!l�69��	|7cJ��~హ�K�\?`�qtԴ�5��b$����L��-�Ϥ�k�^&��\5�U��H:
�ơ0��Db�^
�Vh}�4~�{�
���;��"^i$™UזJ�
ړ�?�;)��?�Ԙ�����$�	�z�q���>+���	�C�қ��
�_zj�1�#{�����HN&���`����]i��
��)��M��+��{J�B[�b����w�iہ
�
+��2i
ZP��w���6�1T->A�wÜ"8��1�~���͒9�tD�0mWn± [�FC�A}�k4D��'��W5�����F����E3���p��-ARW@�?o�nO��b�id���I���<؏��tPX���id7�/��A�[���Y�A�7L���:�2�=�D��
!��;,|I0oeT�dD~KA�3
f:�7�h��dz|}�U����k��J���B^��6�,��M#���A�-���r��|9ލ	k1�ǘn at l޸=�LI	2�]w���?�wc��D�R�B@�
��cAi���d
+;�KWj�W��81F�Fr�����F�R6����5��$�x�/�m�sׄ:N�+����m]�N-�13�
�r_3�5�e�� B�n}�S�̻t�Q����s�
�==�t���݈�Hƃ/�'��*?R���
�}�x�M
�	���]�4ڗ)��|�i�i�,\��_�]3��`v
XY֧�m����Z��
>Rq��\��t.y8V�X��[��!]���n�g��ˠ(���oc����b�< �Mh?=�����hvY�(�*!�쁓a��v�yp��ϼá��$��e�
��DV�FCt�2�
��5q�m�F�#��ص�#v�-WLv+.��8���xPk�r����)"����ca��g�h����$�z�i���U�Ǚ��C�uE^xZ��JgǬ����-�H������k�`��4��kMY*�M#?W��/
����Ά(�\QRϽ���P���z��sϗ
+���p	�l,�
�JWWy��F�d'<�w�@��_	��(��e������)v>�EJAqM?�,u$�H���#�)C�5
���<{
gɦ����|�7�޶�
;R8�&�< �;=�a
Լ z������B������ :	�4)!�F��%?�%��ަkM��iL.��Z6��q����̪��s���@����fT��o���%)sŁ�������=�
!��I���o�z5U57�����K����j7��Vx����~�T"a�J��
e��Qr'���49ю���#�z�X��.��Z0�/
s�>g������O]j��i\
�G�;��H�r��|�G����$�I,�\��UpR�m�n��tiîA�Ka�&��qK|Jm���a�uC���s��#��YY�
X�j,�B�J��
+ʷmW�(�֪5�h������wT�:����V�Ō\zا�#�`��x��L��H�_yJ 	�U��
��x�1�oaD��
%* ��K�P�q��R�՘cn�<�:�6�r$�ܓz����,\�d£����E�s�{��o��P��
�I\Ɖk��h|��:��%��E�9�D
�\�_���d{�w
�fI�	")l�t�
+[�-�{���kT��V��|�C��3$��$W�C�V�F+�X��
�ךK])��,����U�����3E�����D
+��l>Ge�q�s�MXK
+�qb<��z�Kp�
+���
+�ި�h2����E"�b���
T���Ǝ2�A�O�����d���V�������/‚�9������S���/B
�ѽL�$� +�y���ރR\����2
+d�g�D�<�t��
ͥH����]{J�7A��C�AB8�Ա��8m$r�N�ͳ�l��Кs��C����
+Q!B�Wk�F�6�
�%�����Oi롨K��_�Ξ�$_��b|
+��_X�h�pM#;"
�՟vCw��oð�P�y�Lz
��c�j� `���

���4����a��2>�=�7�B��F/���ib�9E|�.�0�8
4��bԆ�9],�����:�Ny� &W⭿��^�dWbP4��~:�mzΝ���$e�i��!�a���"�WihN4c�d���9.s��U�,E�j���>Ĉ�\,S�b�g
g/��d0� �'~6Oa�[���!�i�r���h^�$v;�τ`L�_|��,��W�]�8�Ǝ�Z�m���=����e/Bv�K"'�n��`V:�ܷ<]�V���a�#e�V������r�q�2Vv<�~O�l<��d+����t*�D�-@�D�H!aj̶歛e{��H�Q�]�,t����	��;97D��نd�D�����Rۄ-�~X�9��da�X
�ΰS�i�����{
+}�x�C�J��¬蜏#
��[Nv͚�,��ct囌37]å�ҫ1
+��!�"�8[��x��y�}Do0� h^�!��ޚ���
��bK�o��4JL���k����ڗ!;a�v���&0���M����t��/��È"�Z�^5
��
<�����Ƀ�	[

)rذ�eݸ�'��x�w
+�
+a l��%l,�������x1P���ke���k�5a ?)�j
+�M�[��k�H>
�߯� q���ږ����_,��v�����R�NY�
RM��S��Qlc�P/n̾<B^�[tM��	���L���d&y�\N�V�6m���|�!U�7���X��	��d����w���.Le4VXw� �npU����$��iF���	�A V<���`��V�w���:ϼY
0�Ii�����	�]5��+��_��M�!����l �
�(U�V��
	&�)�]
+�Od '�`p\+���Zo�r�����ٿ���v�mL���*4jM�nf��GWw��f�ub��Y���r.c��ƍ§Q��܇��
H�C�����clԝ
��p�QP�bRbCINt@?c�^s ij���m�9�i�X`�`E8h�����V%	C
�u�հ���	a��.D+E�J᎙��ݨ���	?n]������h*��Jx�
�\M\�gx�
�
.>��->�DңmҲ����Y
���5ԩ͉x�lE���&�� ����^�7d���*��)`����6�]����.A�.��F�
q��'
"P��D�s|�c|���h�P(���to^Gz�	�1��)E"0�1��N��S�>�x<�!�#
P��ꍻnOI��
V��"uj6a�3��ԋnGN�x�b3+VV�դO�q �����y�{p�6}[��ݿ�����4#�����t��a�@׊�-bƒ��ˑ�JK
�F젻

a��� �>ė�1���:�����r�=Q��+���7�ږ���TT/1�n8���, c
ч��:����v�ۖ�Ji���>���T
�uһS���QȜZj�-;Nh��������g;H�};n4 ���Ь1��d���<��>]�a�mM
+�D
(�-{vk��M�����,���U�{s��
M��C;�\��Ɵg'�S���>k�x�9���q���۫���X/���`3�gl�X ݬ�>l���qe��j���q/�����F1����G|B@#�5���le�,<>��N�'��O��~]_3#)���/������O��I�dW�%mw�R��&�eM�⏵�B2��י&9U�it�@�"1�\k{a9��c2��<�U�����i��
,Uz���
�3ܥ9��bS+�	�ش�&{s��x��8��QĐ
+�_�Z�x����
�ލ�e�ɣ��j`/�4�M�׼P�2U�<�*��D���<a�RX�?�e��K���[�$���n���3F����dD�<UC��o�H�gD�	���JG�,T�46�����M��
�y�2�Jm�g&
�<���/��6��烑\c��G1~���ng����>1�
lߨC�*��;M� [��Tw���Y%�J�T�/���fpʻ4�^7�K�����
(������#Us��߬�e@�ב��"�����^>t�8��
+�E�){�ۃ�=ȹ��ӂr^E�l�:K4�α��*	�����A�ۗ�O���1�����8K���T
M����O`G@�~�}�:[U
�j��PTf
+f��IkP1��*�wfؘ��jK��D�e�/�a�(�,
�=+u��%=�w!ٷk��*?�f4;K�ɋ��7�n$w��o
S�1j����\�$aւ�2t�:O��h�9RM�Gμ �T��c%
�<�Jw�&s��]-s���R��vZD��^�b�G,���
U��u ��jO}4ƨ>�V�Go+��B�����ڲ�4n���jXä���
n �QZ��:
DG
 �h"�Lk�i��T!lS�H\IƟ���
�2���')����A�pRmrx_0�cxu�A�"K��
k�A��٥�B�+��qZkWǂ�= �/C5�<�������ԡ����c�K�0��#�s�[�I ��vc��1��3~� }�	�5�4��Q����f��C� >��
�k����)�]�ӟ��+B�T\/��Q9׋�ʁ��`Uż��)�����~s��ۥّ���6Xz-̠�3���4/����!�ϕ
O��]�hj���}2���؃�}�
�����:>�R���nn�*>�����D:Dy�6(0̂2lm5^b z݇�~@�n�ρY_��d�y�
��o9D�6}{�0YY�#�����#u��C�q�q`�];%j�&�������[c8l��ȁ���f�<�^
FmOj�V��cK.�*3��0��n�uP}�j��>�Ր���G�Q�L�px�sg3�V�`��
���+c*�r��
Z?��}w�$V�-b%��a�8���B��(]�
+���j�<�k.��Pk�^�LU��#�LC�Vb�א%4�����߉/�ˈ�9�L^��?!��S��]7bR�P=��~��@�Җw3O
ϴ}�2n���v��[:R�
��ܘ5D���I��
����ș_�ϒlbT��'�
k�Y\�%��Y`݈{d�(�~�%��ƀ�~�|Ɂ�).�?�}�z��(��k&Ow��m��$R�_��k�Yz�Q8��g�!�C,ːrV�4i��v80����;�1ߍ��%2��Kܖ��w$e��u�Y��~�2��|
�jȴiYqo���#$h&B|��[O�;^
6kw�Ob��vJUP��҃��A�p�'y=�W��@��Ս���
���w���|�| ������@��Q"��E۲��Tb�o3��M
dKr��
龄pu�+/����۔y��I���Gz������?t��C��ś{bA��-��V�����ڰ��{t��G(��v�� k�Yt|�8�6��%K�O�t�
X���
��+l

==�HK��+�� $�-:�0�
�@�V��c�����Yo�B�麗)�K��z�+S�3��l�V�‘�<
+nN�6i����}�!7�ָfm
��o���nD�v���2:A2��g�	���?���}��AA�QhZ��ڣ�|`��� KeA�](���Q�ϐ����AF��d/�$%q�m%g�F��"��.����O��P�3��Ľ�up�ٸJ-Q3�щ�i9�8;��7O|>k�1_$�$��DQ�$��H`�:F0�@�*ѡ��Bf~y�+&��|�
�uT
���Zh
+���a�D\4�eMBMşq��mRc̫
�U�I��b�KiU���"���D�/�]tD�ў�)��狏�����,�R
 �P�
"�÷���S���ǚ�X��ҹ:�ul,��9$(�76�`�(8���W[ӽ$`��
��9(>�N����ˋ����f�˺N	ym�����P(U(��h?�{٦ >��,-����Ǵ6~�y}��o�q�� BM�Ma�6��5��T�	��G����L�AO��
+ �$�o��ퟂ��tg���p�:��u.�F��8<�-�l�|&��qn� �a4���Ν�A��22#&=_;3p�|��`�����Z�S�a�1�6uA6<��:?A[�
�Xw�`��q-=�UD v� }ʟъ��h��0
+)+gZ�-���?I�t�8�:j,��ΡiB�B��'*z
�Ѝ��0L���wJ�m��n96C�y��ݱµ�4�΅��V���6S�MN-��N�
�����"vN]�dw�aB�rlM�_L����ʐ
����Js��M	�>�Ɯ��Z���
e��]��y�S�B#Jy�Ε]��A�;Ӯ�K��W0����n
�Q_�zX4O�{����VB�=�q�+�=�Uy�k�\��L<�
+��,a���m
��-�^���9e��2��-0hK�B�-P�W�M�|O�P! �d^ip��F"-+ͺ�
��rQh�%q^y W���7�Bd���
����k�w�J��
'
��t�6�-���tC�����\l�p��U���
+��+��=��_��C�H�
+q��
�G+.�B>�2�
�i�
�#V�6��g�(��Ѓ	�Y�u`.uh�.j:���ƫ5���8��j at lL��z�2����-������
ƶ��bP�{[�
�_�͊�U!�ӟ_|�7��-c�H���vg?6~�4B��Zs}�QT�l׫���.(��m8���'��eB#7
)k��,��%�
q�Ȥ
�s3w�
�~8���1W���N
D
|lp𚧝Kv�_�
>I���΀��O����4z��#ǢZ2�B�����B��i��(�E������
+̈́N3g�Mkf���J�5t	���oT�m�4e��:璣�_J{��kG��ڐ��ʸ
�v��$2��Ί�
�(K
 ����(�L��c��g��׌��j=�0/侮��\�rt�:����������]�ӭ����
+<:�+#zg\f� ��s��If�
���e�+fc4������G�V�7k�?5���T=Ӕ�檾�F�B�xI�*{=<L��ؽ�	��:�r������'
Ui�
\�����oNQ��>fޕW�bU�J�<���z��������b����2�F�1�º�#
;,*@�eY��ӹZ�}-�qu�����=�Ɂ�J�A�.]a�y���B4�Ŀ�[�-����
ʽ�>>-@
J�K0������an7��_d��˼�ܤ�ۼ���˒�.gV���%��h�0�\@����
+Jg�g�Z�y
��N�?f�|����L
�lf��:�CȢ��
���;o���OJM�!���TX�Խz"���~�5A���wfp+���,��i3s9�B�6$ʗ�,�(KF��Q�k<�2����)'� ˱�]��UW�	`�N�yO#�B\'��T3e��}M/ N���2��r	�0˻��_,�
+��_�
�Ə��8
nF��h�L���$���aߍ7=�ZQN�8;
|�x}T�	ȸ�)0��X�<�����j,dq_o{�]@x_���
�ϥ$ȳt��jC���O��iԨ��7}�6f�΄{��Y.A��ET��/�`a�,S�^O$F~�QP3,3Xd�/Զ��M|�W>/�
v_���Q'*�����\NX*�"�$Gf������*���
+endstream
+endobj
+18154 0 obj <<
+/Type /FontDescriptor
+/FontName /EFTTGV+NimbusRomNo9L-ReguItal
+/Flags 4
+/FontBBox [-169 -270 1010 924]
+/Ascent 669
+/CapHeight 669
+/Descent -193
+/ItalicAngle -15
+/StemV 78
+/XHeight 441
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/Y/Z/a/agrave/ampersand/b/backslash/bracketleft/bracketright/c/colon/comma/d/e/eacute/eight/equal/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quotedblleft/quotedblright/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 18153 0 R
+>> endobj
+18052 0 obj <<
+/Type /Encoding
+/Differences [2/fi/fl 33/exclam/quotedbl/numbersign 37/percent/ampersand/quoteright/parenleft/parenright/asterisk/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon/less/equal/greater/question/at/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft/backslash/bracketright 95/underscore/quoteleft/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/braceleft/bar/braceright 147/quotedblleft/quotedblright/bullet/endash/emdash 169/copyri [...]
+>> endobj
+864 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /TQEGZP+CMBX10
+/FontDescriptor 18082 0 R
+/FirstChar 48
+/LastChar 102
+/Widths 18062 0 R
+>> endobj
+4949 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /XLOABE+CMBX7
+/FontDescriptor 18084 0 R
+/FirstChar 102
+/LastChar 102
+/Widths 18044 0 R
+>> endobj
+834 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /XGUGIB+CMEX10
+/FontDescriptor 18086 0 R
+/FirstChar 0
+/LastChar 111
+/Widths 18066 0 R
+>> endobj
+621 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /EERJVP+CMMI10
+/FontDescriptor 18088 0 R
+/FirstChar 11
+/LastChar 125
+/Widths 18073 0 R
+>> endobj
+2982 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /ZGGNQH+CMMI12
+/FontDescriptor 18090 0 R
+/FirstChar 60
+/LastChar 62
+/Widths 18051 0 R
+>> endobj
+880 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /WNXLJT+CMMI5
+/FontDescriptor 18092 0 R
+/FirstChar 68
+/LastChar 110
+/Widths 18061 0 R
+>> endobj
+773 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /AXPGTH+CMMI7
+/FontDescriptor 18094 0 R
+/FirstChar 26
+/LastChar 119
+/Widths 18069 0 R
+>> endobj
+2335 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /ZRLUIR+CMMI8
+/FontDescriptor 18096 0 R
+/FirstChar 60
+/LastChar 62
+/Widths 18054 0 R
+>> endobj
+3022 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /KGNDHW+CMMI9
+/FontDescriptor 18098 0 R
+/FirstChar 15
+/LastChar 121
+/Widths 18049 0 R
+>> endobj
+863 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /NAIRUZ+CMMIB10
+/FontDescriptor 18100 0 R
+/FirstChar 11
+/LastChar 120
+/Widths 18063 0 R
+>> endobj
+1084 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UQOYSR+CMMIB7
+/FontDescriptor 18102 0 R
+/FirstChar 112
+/LastChar 112
+/Widths 18058 0 R
+>> endobj
+802 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /CPXVZD+CMR10
+/FontDescriptor 18104 0 R
+/FirstChar 1
+/LastChar 120
+/Widths 18068 0 R
+>> endobj
+862 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /LYFRJR+CMR5
+/FontDescriptor 18106 0 R
+/FirstChar 43
+/LastChar 80
+/Widths 18064 0 R
+>> endobj
+3411 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /YPFGSD+CMR6
+/FontDescriptor 18108 0 R
+/FirstChar 48
+/LastChar 120
+/Widths 18046 0 R
+>> endobj
+803 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /SWADHT+CMR7
+/FontDescriptor 18110 0 R
+/FirstChar 35
+/LastChar 120
+/Widths 18067 0 R
+>> endobj
+3165 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /SRQDSN+CMR9
+/FontDescriptor 18112 0 R
+/FirstChar 12
+/LastChar 118
+/Widths 18047 0 R
+>> endobj
+537 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /GXJSMI+CMSY10
+/FontDescriptor 18114 0 R
+/FirstChar 0
+/LastChar 114
+/Widths 18079 0 R
+>> endobj
+940 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /TPJSSH+CMSY5
+/FontDescriptor 18116 0 R
+/FirstChar 0
+/LastChar 96
+/Widths 18059 0 R
+>> endobj
+539 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /TOOBUT+CMSY6
+/FontDescriptor 18118 0 R
+/FirstChar 3
+/LastChar 123
+/Widths 18077 0 R
+>> endobj
+835 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /VKRGIJ+CMSY7
+/FontDescriptor 18120 0 R
+/FirstChar 0
+/LastChar 110
+/Widths 18065 0 R
+>> endobj
+538 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /DFVRAV+CMSY8
+/FontDescriptor 18122 0 R
+/FirstChar 120
+/LastChar 123
+/Widths 18078 0 R
+>> endobj
+3017 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /XIUNZC+CMSY9
+/FontDescriptor 18124 0 R
+/FirstChar 1
+/LastChar 21
+/Widths 18050 0 R
+>> endobj
+14147 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /KNYRWO+CMTI10
+/FontDescriptor 18126 0 R
+/FirstChar 112
+/LastChar 115
+/Widths 18043 0 R
+>> endobj
+3831 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /BKKFBC+CMTT10
+/FontDescriptor 18128 0 R
+/FirstChar 101
+/LastChar 121
+/Widths 18045 0 R
+>> endobj
+3056 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /SIAPJE+CMTT8
+/FontDescriptor 18130 0 R
+/FirstChar 100
+/LastChar 120
+/Widths 18048 0 R
+>> endobj
+939 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /TVEUDK+MSAM10
+/FontDescriptor 18132 0 R
+/FirstChar 1
+/LastChar 26
+/Widths 18060 0 R
+>> endobj
+772 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UDLXQN+MSBM10
+/FontDescriptor 18134 0 R
+/FirstChar 63
+/LastChar 90
+/Widths 18070 0 R
+>> endobj
+562 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /PCGBOM+NimbusMonL-Regu
+/FontDescriptor 18138 0 R
+/FirstChar 33
+/LastChar 125
+/Widths 18074 0 R
+/Encoding 18052 0 R
+>> endobj
+1509 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /MUDTES+NimbusMonL-ReguObli
+/FontDescriptor 18140 0 R
+/FirstChar 39
+/LastChar 122
+/Widths 18056 0 R
+/Encoding 18052 0 R
+>> endobj
+766 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /BVTPQN+NimbusSanL-BoldCond
+/FontDescriptor 18142 0 R
+/FirstChar 2
+/LastChar 148
+/Widths 18072 0 R
+/Encoding 18052 0 R
+>> endobj
+2438 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /JNUSOP+NimbusSanL-BoldCondItal
+/FontDescriptor 18144 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 18053 0 R
+/Encoding 18052 0 R
+>> endobj
+536 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /LPPFDT+NimbusSanL-Regu
+/FontDescriptor 18146 0 R
+/FirstChar 39
+/LastChar 121
+/Widths 18080 0 R
+/Encoding 18052 0 R
+>> endobj
+560 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /URKSXV+NimbusRomNo9L-Medi
+/FontDescriptor 18148 0 R
+/FirstChar 2
+/LastChar 150
+/Widths 18075 0 R
+/Encoding 18052 0 R
+>> endobj
+1791 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /SBCPHW+NimbusRomNo9L-MediItal
+/FontDescriptor 18150 0 R
+/FirstChar 49
+/LastChar 121
+/Widths 18055 0 R
+/Encoding 18052 0 R
+>> endobj
+540 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /DODIPJ+NimbusRomNo9L-Regu
+/FontDescriptor 18152 0 R
+/FirstChar 2
+/LastChar 233
+/Widths 18076 0 R
+/Encoding 18052 0 R
+>> endobj
+771 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /EFTTGV+NimbusRomNo9L-ReguItal
+/FontDescriptor 18154 0 R
+/FirstChar 2
+/LastChar 233
+/Widths 18071 0 R
+/Encoding 18052 0 R
+>> endobj
+1248 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /FBUTUG+stmary10
+/FontDescriptor 18136 0 R
+/FirstChar 27
+/LastChar 122
+/Widths 18057 0 R
+>> endobj
+541 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18155 0 R
+/Kids [530 0 R 545 0 R 557 0 R 570 0 R 618 0 R 667 0 R]
+>> endobj
+741 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18155 0 R
+/Kids [728 0 R 749 0 R 764 0 R 786 0 R 800 0 R 807 0 R]
+>> endobj
+823 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18155 0 R
+/Kids [816 0 R 826 0 R 844 0 R 859 0 R 872 0 R 886 0 R]
+>> endobj
+904 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18155 0 R
+/Kids [898 0 R 907 0 R 920 0 R 934 0 R 952 0 R 960 0 R]
+>> endobj
+983 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18155 0 R
+/Kids [973 0 R 991 0 R 1012 0 R 1029 0 R 1048 0 R 1066 0 R]
+>> endobj
+1096 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18155 0 R
+/Kids [1081 0 R 1101 0 R 1112 0 R 1128 0 R 1140 0 R 1164 0 R]
+>> endobj
+1207 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18156 0 R
+/Kids [1192 0 R 1225 0 R 1245 0 R 1257 0 R 1269 0 R 1290 0 R]
+>> endobj
+1333 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18156 0 R
+/Kids [1315 0 R 1344 0 R 1361 0 R 1380 0 R 1404 0 R 1425 0 R]
+>> endobj
+1447 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18156 0 R
+/Kids [1441 0 R 1450 0 R 1457 0 R 1465 0 R 1471 0 R 1477 0 R]
+>> endobj
+1489 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18156 0 R
+/Kids [1485 0 R 1492 0 R 1504 0 R 1513 0 R 1519 0 R 1524 0 R]
+>> endobj
+1532 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18156 0 R
+/Kids [1529 0 R 1536 0 R 1551 0 R 1588 0 R 1617 0 R 1651 0 R]
+>> endobj
+1686 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18156 0 R
+/Kids [1683 0 R 1729 0 R 1787 0 R 1850 0 R 1907 0 R 1962 0 R]
+>> endobj
+2007 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18157 0 R
+/Kids [2001 0 R 2037 0 R 2064 0 R 2120 0 R 2224 0 R 2329 0 R]
+>> endobj
+2380 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18157 0 R
+/Kids [2369 0 R 2391 0 R 2400 0 R 2411 0 R 2424 0 R 2432 0 R]
+>> endobj
+2470 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18157 0 R
+/Kids [2461 0 R 2475 0 R 2486 0 R 2498 0 R 2509 0 R 2526 0 R]
+>> endobj
+2552 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18157 0 R
+/Kids [2543 0 R 2580 0 R 2609 0 R 2639 0 R 2714 0 R 2788 0 R]
+>> endobj
+2887 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18157 0 R
+/Kids [2873 0 R 2927 0 R 2935 0 R 2952 0 R 2967 0 R 2978 0 R]
+>> endobj
+3026 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18157 0 R
+/Kids [3009 0 R 3047 0 R 3077 0 R 3154 0 R 3232 0 R 3311 0 R]
+>> endobj
+3416 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18158 0 R
+/Kids [3408 0 R 3484 0 R 3514 0 R 3527 0 R 3535 0 R 3549 0 R]
+>> endobj
+3576 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18158 0 R
+/Kids [3563 0 R 3579 0 R 3594 0 R 3608 0 R 3624 0 R 3639 0 R]
+>> endobj
+3668 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18158 0 R
+/Kids [3655 0 R 3675 0 R 3691 0 R 3707 0 R 3724 0 R 3740 0 R]
+>> endobj
+3767 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18158 0 R
+/Kids [3756 0 R 3774 0 R 3788 0 R 3808 0 R 3826 0 R 3842 0 R]
+>> endobj
+3874 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18158 0 R
+/Kids [3862 0 R 3883 0 R 3907 0 R 3928 0 R 3962 0 R 4044 0 R]
+>> endobj
+4141 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18158 0 R
+/Kids [4128 0 R 4203 0 R 4297 0 R 4358 0 R 4385 0 R 4400 0 R]
+>> endobj
+4426 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18159 0 R
+/Kids [4414 0 R 4429 0 R 4444 0 R 4458 0 R 4474 0 R 4490 0 R]
+>> endobj
+4518 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18159 0 R
+/Kids [4505 0 R 4522 0 R 4542 0 R 4558 0 R 4577 0 R 4594 0 R]
+>> endobj
+4622 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18159 0 R
+/Kids [4610 0 R 4630 0 R 4645 0 R 4662 0 R 4676 0 R 4695 0 R]
+>> endobj
+4721 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18159 0 R
+/Kids [4710 0 R 4726 0 R 4776 0 R 4822 0 R 4839 0 R 4855 0 R]
+>> endobj
+4879 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18159 0 R
+/Kids [4869 0 R 4887 0 R 4923 0 R 4946 0 R 4978 0 R 5036 0 R]
+>> endobj
+5116 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18159 0 R
+/Kids [5094 0 R 5148 0 R 5175 0 R 5196 0 R 5245 0 R 5262 0 R]
+>> endobj
+5281 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18160 0 R
+/Kids [5275 0 R 5288 0 R 5297 0 R 5310 0 R 5328 0 R 5361 0 R]
+>> endobj
+5425 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18160 0 R
+/Kids [5410 0 R 5477 0 R 5552 0 R 5616 0 R 5639 0 R 5651 0 R]
+>> endobj
+5677 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18160 0 R
+/Kids [5666 0 R 5680 0 R 5713 0 R 5774 0 R 5836 0 R 5870 0 R]
+>> endobj
+5895 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18160 0 R
+/Kids [5881 0 R 5898 0 R 5916 0 R 5955 0 R 5993 0 R 6037 0 R]
+>> endobj
+6079 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18160 0 R
+/Kids [6069 0 R 6092 0 R 6108 0 R 6129 0 R 6160 0 R 6190 0 R]
+>> endobj
+6220 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18160 0 R
+/Kids [6208 0 R 6242 0 R 6273 0 R 6292 0 R 6331 0 R 6357 0 R]
+>> endobj
+6426 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18161 0 R
+/Kids [6412 0 R 6473 0 R 6561 0 R 6707 0 R 6743 0 R 6754 0 R]
+>> endobj
+6778 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18161 0 R
+/Kids [6765 0 R 6782 0 R 6796 0 R 6814 0 R 6837 0 R 6896 0 R]
+>> endobj
+6964 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18161 0 R
+/Kids [6949 0 R 6970 0 R 6999 0 R 7024 0 R 7067 0 R 7103 0 R]
+>> endobj
+7160 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18161 0 R
+/Kids [7151 0 R 7179 0 R 7195 0 R 7234 0 R 7260 0 R 7278 0 R]
+>> endobj
+7310 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18161 0 R
+/Kids [7299 0 R 7341 0 R 7389 0 R 7415 0 R 7432 0 R 7468 0 R]
+>> endobj
+7492 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18161 0 R
+/Kids [7483 0 R 7503 0 R 7531 0 R 7544 0 R 7578 0 R 7640 0 R]
+>> endobj
+7745 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18162 0 R
+/Kids [7726 0 R 7834 0 R 7946 0 R 7991 0 R 8030 0 R 8046 0 R]
+>> endobj
+8072 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18162 0 R
+/Kids [8058 0 R 8075 0 R 8096 0 R 8115 0 R 8125 0 R 8134 0 R]
+>> endobj
+8167 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18162 0 R
+/Kids [8150 0 R 8204 0 R 8255 0 R 8282 0 R 8289 0 R 8322 0 R]
+>> endobj
+8403 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18162 0 R
+/Kids [8398 0 R 8422 0 R 8453 0 R 8531 0 R 8608 0 R 8694 0 R]
+>> endobj
+8793 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18162 0 R
+/Kids [8786 0 R 8851 0 R 8896 0 R 8916 0 R 8927 0 R 8933 0 R]
+>> endobj
+8953 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18162 0 R
+/Kids [8941 0 R 8956 0 R 8971 0 R 8985 0 R 9003 0 R 9019 0 R]
+>> endobj
+9043 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18163 0 R
+/Kids [9031 0 R 9046 0 R 9062 0 R 9076 0 R 9094 0 R 9113 0 R]
+>> endobj
+9143 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18163 0 R
+/Kids [9132 0 R 9148 0 R 9163 0 R 9183 0 R 9199 0 R 9219 0 R]
+>> endobj
+9250 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18163 0 R
+/Kids [9238 0 R 9260 0 R 9282 0 R 9297 0 R 9327 0 R 9394 0 R]
+>> endobj
+9495 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18163 0 R
+/Kids [9478 0 R 9568 0 R 9639 0 R 9683 0 R 9697 0 R 9709 0 R]
+>> endobj
+9740 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18163 0 R
+/Kids [9727 0 R 9745 0 R 9786 0 R 9849 0 R 9900 0 R 9921 0 R]
+>> endobj
+9941 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18163 0 R
+/Kids [9927 0 R 9958 0 R 9981 0 R 10004 0 R 10028 0 R 10054 0 R]
+>> endobj
+10086 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18164 0 R
+/Kids [10079 0 R 10095 0 R 10109 0 R 10146 0 R 10169 0 R 10184 0 R]
+>> endobj
+10209 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18164 0 R
+/Kids [10202 0 R 10264 0 R 10335 0 R 10438 0 R 10567 0 R 10639 0 R]
+>> endobj
+10665 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18164 0 R
+/Kids [10652 0 R 10668 0 R 10681 0 R 10700 0 R 10719 0 R 10736 0 R]
+>> endobj
+10781 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18164 0 R
+/Kids [10762 0 R 10817 0 R 10852 0 R 10863 0 R 10888 0 R 10957 0 R]
+>> endobj
+11037 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18164 0 R
+/Kids [11020 0 R 11055 0 R 11068 0 R 11082 0 R 11097 0 R 11112 0 R]
+>> endobj
+11138 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18164 0 R
+/Kids [11127 0 R 11170 0 R 11195 0 R 11208 0 R 11259 0 R 11306 0 R]
+>> endobj
+11338 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18165 0 R
+/Kids [11325 0 R 11341 0 R 11355 0 R 11373 0 R 11419 0 R 11497 0 R]
+>> endobj
+11588 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18165 0 R
+/Kids [11578 0 R 11662 0 R 11749 0 R 11805 0 R 11830 0 R 11837 0 R]
+>> endobj
+11860 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18165 0 R
+/Kids [11848 0 R 11863 0 R 11876 0 R 11893 0 R 11909 0 R 11923 0 R]
+>> endobj
+11949 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18165 0 R
+/Kids [11936 0 R 11952 0 R 11968 0 R 11985 0 R 12001 0 R 12018 0 R]
+>> endobj
+12045 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18165 0 R
+/Kids [12035 0 R 12051 0 R 12069 0 R 12084 0 R 12100 0 R 12119 0 R]
+>> endobj
+12146 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18165 0 R
+/Kids [12136 0 R 12155 0 R 12175 0 R 12191 0 R 12230 0 R 12252 0 R]
+>> endobj
+12307 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18166 0 R
+/Kids [12298 0 R 12364 0 R 12439 0 R 12535 0 R 12602 0 R 12649 0 R]
+>> endobj
+12693 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18166 0 R
+/Kids [12687 0 R 12696 0 R 12707 0 R 12723 0 R 12735 0 R 12749 0 R]
+>> endobj
+12775 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18166 0 R
+/Kids [12764 0 R 12778 0 R 12791 0 R 12806 0 R 12823 0 R 12841 0 R]
+>> endobj
+12872 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18166 0 R
+/Kids [12860 0 R 12884 0 R 12902 0 R 12917 0 R 12933 0 R 12952 0 R]
+>> endobj
+12985 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18166 0 R
+/Kids [12973 0 R 12990 0 R 13015 0 R 13061 0 R 13103 0 R 13160 0 R]
+>> endobj
+13248 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18166 0 R
+/Kids [13233 0 R 13283 0 R 13302 0 R 13313 0 R 13325 0 R 13338 0 R]
+>> endobj
+13350 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18167 0 R
+/Kids [13347 0 R 13354 0 R 13361 0 R 13375 0 R 13390 0 R 13407 0 R]
+>> endobj
+13456 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18167 0 R
+/Kids [13441 0 R 13498 0 R 13524 0 R 13555 0 R 13619 0 R 13657 0 R]
+>> endobj
+13694 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18167 0 R
+/Kids [13682 0 R 13701 0 R 13775 0 R 13856 0 R 13929 0 R 14017 0 R]
+>> endobj
+14083 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18167 0 R
+/Kids [14069 0 R 14100 0 R 14113 0 R 14126 0 R 14141 0 R 14155 0 R]
+>> endobj
+14178 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18167 0 R
+/Kids [14168 0 R 14181 0 R 14197 0 R 14213 0 R 14232 0 R 14249 0 R]
+>> endobj
+14274 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18167 0 R
+/Kids [14264 0 R 14283 0 R 14302 0 R 14321 0 R 14337 0 R 14354 0 R]
+>> endobj
+14393 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18168 0 R
+/Kids [14380 0 R 14437 0 R 14469 0 R 14519 0 R 14548 0 R 14627 0 R]
+>> endobj
+14700 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18168 0 R
+/Kids [14696 0 R 14793 0 R 14875 0 R 14939 0 R 15017 0 R 15044 0 R]
+>> endobj
+15055 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18168 0 R
+/Kids [15052 0 R 15059 0 R 15064 0 R 15075 0 R 15089 0 R 15105 0 R]
+>> endobj
+15131 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18168 0 R
+/Kids [15121 0 R 15136 0 R 15150 0 R 15164 0 R 15179 0 R 15193 0 R]
+>> endobj
+15222 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18168 0 R
+/Kids [15210 0 R 15229 0 R 15248 0 R 15265 0 R 15285 0 R 15303 0 R]
+>> endobj
+15326 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18168 0 R
+/Kids [15316 0 R 15337 0 R 15359 0 R 15380 0 R 15398 0 R 15414 0 R]
+>> endobj
+15439 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18169 0 R
+/Kids [15430 0 R 15447 0 R 15492 0 R 15549 0 R 15594 0 R 15622 0 R]
+>> endobj
+15644 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18169 0 R
+/Kids [15630 0 R 15647 0 R 15661 0 R 15680 0 R 15721 0 R 15748 0 R]
+>> endobj
+15772 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18169 0 R
+/Kids [15763 0 R 15790 0 R 15812 0 R 15861 0 R 15893 0 R 15936 0 R]
+>> endobj
+15976 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18169 0 R
+/Kids [15964 0 R 15991 0 R 16019 0 R 16043 0 R 16122 0 R 16188 0 R]
+>> endobj
+16286 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18169 0 R
+/Kids [16283 0 R 16378 0 R 16451 0 R 16528 0 R 16595 0 R 16659 0 R]
+>> endobj
+16738 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18169 0 R
+/Kids [16735 0 R 16816 0 R 16890 0 R 16998 0 R 17106 0 R 17221 0 R]
+>> endobj
+17332 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 18170 0 R
+/Kids [17329 0 R 17444 0 R 17557 0 R 17674 0 R 17755 0 R 17836 0 R]
+>> endobj
+17905 0 obj <<
+/Type /Pages
+/Count 3
+/Parent 18170 0 R
+/Kids [17902 0 R 17981 0 R 18040 0 R]
+>> endobj
+18155 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18171 0 R
+/Kids [541 0 R 741 0 R 823 0 R 904 0 R 983 0 R 1096 0 R]
+>> endobj
+18156 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18171 0 R
+/Kids [1207 0 R 1333 0 R 1447 0 R 1489 0 R 1532 0 R 1686 0 R]
+>> endobj
+18157 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18171 0 R
+/Kids [2007 0 R 2380 0 R 2470 0 R 2552 0 R 2887 0 R 3026 0 R]
+>> endobj
+18158 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18171 0 R
+/Kids [3416 0 R 3576 0 R 3668 0 R 3767 0 R 3874 0 R 4141 0 R]
+>> endobj
+18159 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18171 0 R
+/Kids [4426 0 R 4518 0 R 4622 0 R 4721 0 R 4879 0 R 5116 0 R]
+>> endobj
+18160 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18171 0 R
+/Kids [5281 0 R 5425 0 R 5677 0 R 5895 0 R 6079 0 R 6220 0 R]
+>> endobj
+18161 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18172 0 R
+/Kids [6426 0 R 6778 0 R 6964 0 R 7160 0 R 7310 0 R 7492 0 R]
+>> endobj
+18162 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18172 0 R
+/Kids [7745 0 R 8072 0 R 8167 0 R 8403 0 R 8793 0 R 8953 0 R]
+>> endobj
+18163 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18172 0 R
+/Kids [9043 0 R 9143 0 R 9250 0 R 9495 0 R 9740 0 R 9941 0 R]
+>> endobj
+18164 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18172 0 R
+/Kids [10086 0 R 10209 0 R 10665 0 R 10781 0 R 11037 0 R 11138 0 R]
+>> endobj
+18165 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18172 0 R
+/Kids [11338 0 R 11588 0 R 11860 0 R 11949 0 R 12045 0 R 12146 0 R]
+>> endobj
+18166 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18172 0 R
+/Kids [12307 0 R 12693 0 R 12775 0 R 12872 0 R 12985 0 R 13248 0 R]
+>> endobj
+18167 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18173 0 R
+/Kids [13350 0 R 13456 0 R 13694 0 R 14083 0 R 14178 0 R 14274 0 R]
+>> endobj
+18168 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18173 0 R
+/Kids [14393 0 R 14700 0 R 15055 0 R 15131 0 R 15222 0 R 15326 0 R]
+>> endobj
+18169 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 18173 0 R
+/Kids [15439 0 R 15644 0 R 15772 0 R 15976 0 R 16286 0 R 16738 0 R]
+>> endobj
+18170 0 obj <<
+/Type /Pages
+/Count 9
+/Parent 18173 0 R
+/Kids [17332 0 R 17905 0 R]
+>> endobj
+18171 0 obj <<
+/Type /Pages
+/Count 216
+/Parent 18174 0 R
+/Kids [18155 0 R 18156 0 R 18157 0 R 18158 0 R 18159 0 R 18160 0 R]
+>> endobj
+18172 0 obj <<
+/Type /Pages
+/Count 216
+/Parent 18174 0 R
+/Kids [18161 0 R 18162 0 R 18163 0 R 18164 0 R 18165 0 R 18166 0 R]
+>> endobj
+18173 0 obj <<
+/Type /Pages
+/Count 117
+/Parent 18174 0 R
+/Kids [18167 0 R 18168 0 R 18169 0 R 18170 0 R]
+>> endobj
+18174 0 obj <<
+/Type /Pages
+/Count 549
+/Kids [18171 0 R 18172 0 R 18173 0 R]
+>> endobj
+18175 0 obj <<
+/Type /Outlines
+/First 3 0 R
+/Last 527 0 R
+/Count 11
+>> endobj
+527 0 obj <<
+/Title 528 0 R
+/A 525 0 R
+/Parent 18175 0 R
+/Prev 135 0 R
+>> endobj
+523 0 obj <<
+/Title 524 0 R
+/A 521 0 R
+/Parent 135 0 R
+/Prev 519 0 R
+>> endobj
+519 0 obj <<
+/Title 520 0 R
+/A 517 0 R
+/Parent 135 0 R
+/Prev 515 0 R
+/Next 523 0 R
+>> endobj
+515 0 obj <<
+/Title 516 0 R
+/A 513 0 R
+/Parent 135 0 R
+/Prev 511 0 R
+/Next 519 0 R
+>> endobj
+511 0 obj <<
+/Title 512 0 R
+/A 509 0 R
+/Parent 135 0 R
+/Prev 507 0 R
+/Next 515 0 R
+>> endobj
+507 0 obj <<
+/Title 508 0 R
+/A 505 0 R
+/Parent 135 0 R
+/Prev 503 0 R
+/Next 511 0 R
+>> endobj
+503 0 obj <<
+/Title 504 0 R
+/A 501 0 R
+/Parent 135 0 R
+/Prev 499 0 R
+/Next 507 0 R
+>> endobj
+499 0 obj <<
+/Title 500 0 R
+/A 497 0 R
+/Parent 135 0 R
+/Prev 495 0 R
+/Next 503 0 R
+>> endobj
+495 0 obj <<
+/Title 496 0 R
+/A 493 0 R
+/Parent 135 0 R
+/Prev 491 0 R
+/Next 499 0 R
+>> endobj
+491 0 obj <<
+/Title 492 0 R
+/A 489 0 R
+/Parent 135 0 R
+/Prev 487 0 R
+/Next 495 0 R
+>> endobj
+487 0 obj <<
+/Title 488 0 R
+/A 485 0 R
+/Parent 135 0 R
+/Prev 483 0 R
+/Next 491 0 R
+>> endobj
+483 0 obj <<
+/Title 484 0 R
+/A 481 0 R
+/Parent 135 0 R
+/Prev 479 0 R
+/Next 487 0 R
+>> endobj
+479 0 obj <<
+/Title 480 0 R
+/A 477 0 R
+/Parent 135 0 R
+/Prev 475 0 R
+/Next 483 0 R
+>> endobj
+475 0 obj <<
+/Title 476 0 R
+/A 473 0 R
+/Parent 135 0 R
+/Prev 471 0 R
+/Next 479 0 R
+>> endobj
+471 0 obj <<
+/Title 472 0 R
+/A 469 0 R
+/Parent 135 0 R
+/Prev 467 0 R
+/Next 475 0 R
+>> endobj
+467 0 obj <<
+/Title 468 0 R
+/A 465 0 R
+/Parent 135 0 R
+/Prev 463 0 R
+/Next 471 0 R
+>> endobj
+463 0 obj <<
+/Title 464 0 R
+/A 461 0 R
+/Parent 135 0 R
+/Prev 459 0 R
+/Next 467 0 R
+>> endobj
+459 0 obj <<
+/Title 460 0 R
+/A 457 0 R
+/Parent 135 0 R
+/Prev 455 0 R
+/Next 463 0 R
+>> endobj
+455 0 obj <<
+/Title 456 0 R
+/A 453 0 R
+/Parent 135 0 R
+/Prev 451 0 R
+/Next 459 0 R
+>> endobj
+451 0 obj <<
+/Title 452 0 R
+/A 449 0 R
+/Parent 135 0 R
+/Prev 447 0 R
+/Next 455 0 R
+>> endobj
+447 0 obj <<
+/Title 448 0 R
+/A 445 0 R
+/Parent 135 0 R
+/Prev 443 0 R
+/Next 451 0 R
+>> endobj
+443 0 obj <<
+/Title 444 0 R
+/A 441 0 R
+/Parent 135 0 R
+/Prev 439 0 R
+/Next 447 0 R
+>> endobj
+439 0 obj <<
+/Title 440 0 R
+/A 437 0 R
+/Parent 135 0 R
+/Prev 435 0 R
+/Next 443 0 R
+>> endobj
+435 0 obj <<
+/Title 436 0 R
+/A 433 0 R
+/Parent 135 0 R
+/Prev 431 0 R
+/Next 439 0 R
+>> endobj
+431 0 obj <<
+/Title 432 0 R
+/A 429 0 R
+/Parent 135 0 R
+/Prev 427 0 R
+/Next 435 0 R
+>> endobj
+427 0 obj <<
+/Title 428 0 R
+/A 425 0 R
+/Parent 135 0 R
+/Prev 423 0 R
+/Next 431 0 R
+>> endobj
+423 0 obj <<
+/Title 424 0 R
+/A 421 0 R
+/Parent 135 0 R
+/Prev 419 0 R
+/Next 427 0 R
+>> endobj
+419 0 obj <<
+/Title 420 0 R
+/A 417 0 R
+/Parent 135 0 R
+/Prev 415 0 R
+/Next 423 0 R
+>> endobj
+415 0 obj <<
+/Title 416 0 R
+/A 413 0 R
+/Parent 135 0 R
+/Prev 411 0 R
+/Next 419 0 R
+>> endobj
+411 0 obj <<
+/Title 412 0 R
+/A 409 0 R
+/Parent 135 0 R
+/Prev 407 0 R
+/Next 415 0 R
+>> endobj
+407 0 obj <<
+/Title 408 0 R
+/A 405 0 R
+/Parent 135 0 R
+/Prev 403 0 R
+/Next 411 0 R
+>> endobj
+403 0 obj <<
+/Title 404 0 R
+/A 401 0 R
+/Parent 135 0 R
+/Prev 399 0 R
+/Next 407 0 R
+>> endobj
+399 0 obj <<
+/Title 400 0 R
+/A 397 0 R
+/Parent 135 0 R
+/Prev 395 0 R
+/Next 403 0 R
+>> endobj
+395 0 obj <<
+/Title 396 0 R
+/A 393 0 R
+/Parent 135 0 R
+/Prev 391 0 R
+/Next 399 0 R
+>> endobj
+391 0 obj <<
+/Title 392 0 R
+/A 389 0 R
+/Parent 135 0 R
+/Prev 387 0 R
+/Next 395 0 R
+>> endobj
+387 0 obj <<
+/Title 388 0 R
+/A 385 0 R
+/Parent 135 0 R
+/Prev 383 0 R
+/Next 391 0 R
+>> endobj
+383 0 obj <<
+/Title 384 0 R
+/A 381 0 R
+/Parent 135 0 R
+/Prev 379 0 R
+/Next 387 0 R
+>> endobj
+379 0 obj <<
+/Title 380 0 R
+/A 377 0 R
+/Parent 135 0 R
+/Prev 375 0 R
+/Next 383 0 R
+>> endobj
+375 0 obj <<
+/Title 376 0 R
+/A 373 0 R
+/Parent 135 0 R
+/Prev 371 0 R
+/Next 379 0 R
+>> endobj
+371 0 obj <<
+/Title 372 0 R
+/A 369 0 R
+/Parent 135 0 R
+/Prev 367 0 R
+/Next 375 0 R
+>> endobj
+367 0 obj <<
+/Title 368 0 R
+/A 365 0 R
+/Parent 135 0 R
+/Prev 363 0 R
+/Next 371 0 R
+>> endobj
+363 0 obj <<
+/Title 364 0 R
+/A 361 0 R
+/Parent 135 0 R
+/Prev 359 0 R
+/Next 367 0 R
+>> endobj
+359 0 obj <<
+/Title 360 0 R
+/A 357 0 R
+/Parent 135 0 R
+/Prev 355 0 R
+/Next 363 0 R
+>> endobj
+355 0 obj <<
+/Title 356 0 R
+/A 353 0 R
+/Parent 135 0 R
+/Prev 351 0 R
+/Next 359 0 R
+>> endobj
+351 0 obj <<
+/Title 352 0 R
+/A 349 0 R
+/Parent 135 0 R
+/Prev 347 0 R
+/Next 355 0 R
+>> endobj
+347 0 obj <<
+/Title 348 0 R
+/A 345 0 R
+/Parent 135 0 R
+/Prev 343 0 R
+/Next 351 0 R
+>> endobj
+343 0 obj <<
+/Title 344 0 R
+/A 341 0 R
+/Parent 135 0 R
+/Prev 339 0 R
+/Next 347 0 R
+>> endobj
+339 0 obj <<
+/Title 340 0 R
+/A 337 0 R
+/Parent 135 0 R
+/Prev 335 0 R
+/Next 343 0 R
+>> endobj
+335 0 obj <<
+/Title 336 0 R
+/A 333 0 R
+/Parent 135 0 R
+/Prev 331 0 R
+/Next 339 0 R
+>> endobj
+331 0 obj <<
+/Title 332 0 R
+/A 329 0 R
+/Parent 135 0 R
+/Prev 327 0 R
+/Next 335 0 R
+>> endobj
+327 0 obj <<
+/Title 328 0 R
+/A 325 0 R
+/Parent 135 0 R
+/Prev 323 0 R
+/Next 331 0 R
+>> endobj
+323 0 obj <<
+/Title 324 0 R
+/A 321 0 R
+/Parent 135 0 R
+/Prev 319 0 R
+/Next 327 0 R
+>> endobj
+319 0 obj <<
+/Title 320 0 R
+/A 317 0 R
+/Parent 135 0 R
+/Prev 315 0 R
+/Next 323 0 R
+>> endobj
+315 0 obj <<
+/Title 316 0 R
+/A 313 0 R
+/Parent 135 0 R
+/Prev 311 0 R
+/Next 319 0 R
+>> endobj
+311 0 obj <<
+/Title 312 0 R
+/A 309 0 R
+/Parent 135 0 R
+/Prev 307 0 R
+/Next 315 0 R
+>> endobj
+307 0 obj <<
+/Title 308 0 R
+/A 305 0 R
+/Parent 135 0 R
+/Prev 303 0 R
+/Next 311 0 R
+>> endobj
+303 0 obj <<
+/Title 304 0 R
+/A 301 0 R
+/Parent 135 0 R
+/Prev 299 0 R
+/Next 307 0 R
+>> endobj
+299 0 obj <<
+/Title 300 0 R
+/A 297 0 R
+/Parent 135 0 R
+/Prev 295 0 R
+/Next 303 0 R
+>> endobj
+295 0 obj <<
+/Title 296 0 R
+/A 293 0 R
+/Parent 135 0 R
+/Prev 291 0 R
+/Next 299 0 R
+>> endobj
+291 0 obj <<
+/Title 292 0 R
+/A 289 0 R
+/Parent 135 0 R
+/Prev 287 0 R
+/Next 295 0 R
+>> endobj
+287 0 obj <<
+/Title 288 0 R
+/A 285 0 R
+/Parent 135 0 R
+/Prev 283 0 R
+/Next 291 0 R
+>> endobj
+283 0 obj <<
+/Title 284 0 R
+/A 281 0 R
+/Parent 135 0 R
+/Prev 279 0 R
+/Next 287 0 R
+>> endobj
+279 0 obj <<
+/Title 280 0 R
+/A 277 0 R
+/Parent 135 0 R
+/Prev 275 0 R
+/Next 283 0 R
+>> endobj
+275 0 obj <<
+/Title 276 0 R
+/A 273 0 R
+/Parent 135 0 R
+/Prev 271 0 R
+/Next 279 0 R
+>> endobj
+271 0 obj <<
+/Title 272 0 R
+/A 269 0 R
+/Parent 135 0 R
+/Prev 267 0 R
+/Next 275 0 R
+>> endobj
+267 0 obj <<
+/Title 268 0 R
+/A 265 0 R
+/Parent 135 0 R
+/Prev 263 0 R
+/Next 271 0 R
+>> endobj
+263 0 obj <<
+/Title 264 0 R
+/A 261 0 R
+/Parent 135 0 R
+/Prev 259 0 R
+/Next 267 0 R
+>> endobj
+259 0 obj <<
+/Title 260 0 R
+/A 257 0 R
+/Parent 135 0 R
+/Prev 255 0 R
+/Next 263 0 R
+>> endobj
+255 0 obj <<
+/Title 256 0 R
+/A 253 0 R
+/Parent 135 0 R
+/Prev 251 0 R
+/Next 259 0 R
+>> endobj
+251 0 obj <<
+/Title 252 0 R
+/A 249 0 R
+/Parent 135 0 R
+/Prev 247 0 R
+/Next 255 0 R
+>> endobj
+247 0 obj <<
+/Title 248 0 R
+/A 245 0 R
+/Parent 135 0 R
+/Prev 243 0 R
+/Next 251 0 R
+>> endobj
+243 0 obj <<
+/Title 244 0 R
+/A 241 0 R
+/Parent 135 0 R
+/Prev 239 0 R
+/Next 247 0 R
+>> endobj
+239 0 obj <<
+/Title 240 0 R
+/A 237 0 R
+/Parent 135 0 R
+/Prev 235 0 R
+/Next 243 0 R
+>> endobj
+235 0 obj <<
+/Title 236 0 R
+/A 233 0 R
+/Parent 135 0 R
+/Prev 231 0 R
+/Next 239 0 R
+>> endobj
+231 0 obj <<
+/Title 232 0 R
+/A 229 0 R
+/Parent 135 0 R
+/Prev 227 0 R
+/Next 235 0 R
+>> endobj
+227 0 obj <<
+/Title 228 0 R
+/A 225 0 R
+/Parent 135 0 R
+/Prev 223 0 R
+/Next 231 0 R
+>> endobj
+223 0 obj <<
+/Title 224 0 R
+/A 221 0 R
+/Parent 135 0 R
+/Prev 219 0 R
+/Next 227 0 R
+>> endobj
+219 0 obj <<
+/Title 220 0 R
+/A 217 0 R
+/Parent 135 0 R
+/Prev 215 0 R
+/Next 223 0 R
+>> endobj
+215 0 obj <<
+/Title 216 0 R
+/A 213 0 R
+/Parent 135 0 R
+/Prev 211 0 R
+/Next 219 0 R
+>> endobj
+211 0 obj <<
+/Title 212 0 R
+/A 209 0 R
+/Parent 135 0 R
+/Prev 207 0 R
+/Next 215 0 R
+>> endobj
+207 0 obj <<
+/Title 208 0 R
+/A 205 0 R
+/Parent 135 0 R
+/Prev 203 0 R
+/Next 211 0 R
+>> endobj
+203 0 obj <<
+/Title 204 0 R
+/A 201 0 R
+/Parent 135 0 R
+/Prev 199 0 R
+/Next 207 0 R
+>> endobj
+199 0 obj <<
+/Title 200 0 R
+/A 197 0 R
+/Parent 135 0 R
+/Prev 195 0 R
+/Next 203 0 R
+>> endobj
+195 0 obj <<
+/Title 196 0 R
+/A 193 0 R
+/Parent 135 0 R
+/Prev 191 0 R
+/Next 199 0 R
+>> endobj
+191 0 obj <<
+/Title 192 0 R
+/A 189 0 R
+/Parent 135 0 R
+/Prev 187 0 R
+/Next 195 0 R
+>> endobj
+187 0 obj <<
+/Title 188 0 R
+/A 185 0 R
+/Parent 135 0 R
+/Prev 183 0 R
+/Next 191 0 R
+>> endobj
+183 0 obj <<
+/Title 184 0 R
+/A 181 0 R
+/Parent 135 0 R
+/Prev 179 0 R
+/Next 187 0 R
+>> endobj
+179 0 obj <<
+/Title 180 0 R
+/A 177 0 R
+/Parent 135 0 R
+/Prev 175 0 R
+/Next 183 0 R
+>> endobj
+175 0 obj <<
+/Title 176 0 R
+/A 173 0 R
+/Parent 135 0 R
+/Prev 171 0 R
+/Next 179 0 R
+>> endobj
+171 0 obj <<
+/Title 172 0 R
+/A 169 0 R
+/Parent 135 0 R
+/Prev 167 0 R
+/Next 175 0 R
+>> endobj
+167 0 obj <<
+/Title 168 0 R
+/A 165 0 R
+/Parent 135 0 R
+/Prev 163 0 R
+/Next 171 0 R
+>> endobj
+163 0 obj <<
+/Title 164 0 R
+/A 161 0 R
+/Parent 135 0 R
+/Prev 159 0 R
+/Next 167 0 R
+>> endobj
+159 0 obj <<
+/Title 160 0 R
+/A 157 0 R
+/Parent 135 0 R
+/Prev 155 0 R
+/Next 163 0 R
+>> endobj
+155 0 obj <<
+/Title 156 0 R
+/A 153 0 R
+/Parent 135 0 R
+/Prev 151 0 R
+/Next 159 0 R
+>> endobj
+151 0 obj <<
+/Title 152 0 R
+/A 149 0 R
+/Parent 135 0 R
+/Prev 147 0 R
+/Next 155 0 R
+>> endobj
+147 0 obj <<
+/Title 148 0 R
+/A 145 0 R
+/Parent 135 0 R
+/Prev 143 0 R
+/Next 151 0 R
+>> endobj
+143 0 obj <<
+/Title 144 0 R
+/A 141 0 R
+/Parent 135 0 R
+/Prev 139 0 R
+/Next 147 0 R
+>> endobj
+139 0 obj <<
+/Title 140 0 R
+/A 137 0 R
+/Parent 135 0 R
+/Next 143 0 R
+>> endobj
+135 0 obj <<
+/Title 136 0 R
+/A 133 0 R
+/Parent 18175 0 R
+/Prev 119 0 R
+/Next 527 0 R
+/First 139 0 R
+/Last 523 0 R
+/Count -97
+>> endobj
+131 0 obj <<
+/Title 132 0 R
+/A 129 0 R
+/Parent 119 0 R
+/Prev 127 0 R
+>> endobj
+127 0 obj <<
+/Title 128 0 R
+/A 125 0 R
+/Parent 119 0 R
+/Prev 123 0 R
+/Next 131 0 R
+>> endobj
+123 0 obj <<
+/Title 124 0 R
+/A 121 0 R
+/Parent 119 0 R
+/Next 127 0 R
+>> endobj
+119 0 obj <<
+/Title 120 0 R
+/A 117 0 R
+/Parent 18175 0 R
+/Prev 111 0 R
+/Next 135 0 R
+/First 123 0 R
+/Last 131 0 R
+/Count -3
+>> endobj
+115 0 obj <<
+/Title 116 0 R
+/A 113 0 R
+/Parent 111 0 R
+>> endobj
+111 0 obj <<
+/Title 112 0 R
+/A 109 0 R
+/Parent 18175 0 R
+/Prev 103 0 R
+/Next 119 0 R
+/First 115 0 R
+/Last 115 0 R
+/Count -1
+>> endobj
+107 0 obj <<
+/Title 108 0 R
+/A 105 0 R
+/Parent 103 0 R
+>> endobj
+103 0 obj <<
+/Title 104 0 R
+/A 101 0 R
+/Parent 18175 0 R
+/Prev 95 0 R
+/Next 111 0 R
+/First 107 0 R
+/Last 107 0 R
+/Count -1
+>> endobj
+99 0 obj <<
+/Title 100 0 R
+/A 97 0 R
+/Parent 95 0 R
+>> endobj
+95 0 obj <<
+/Title 96 0 R
+/A 93 0 R
+/Parent 18175 0 R
+/Prev 87 0 R
+/Next 103 0 R
+/First 99 0 R
+/Last 99 0 R
+/Count -1
+>> endobj
+91 0 obj <<
+/Title 92 0 R
+/A 89 0 R
+/Parent 87 0 R
+>> endobj
+87 0 obj <<
+/Title 88 0 R
+/A 85 0 R
+/Parent 18175 0 R
+/Prev 79 0 R
+/Next 95 0 R
+/First 91 0 R
+/Last 91 0 R
+/Count -1
+>> endobj
+83 0 obj <<
+/Title 84 0 R
+/A 81 0 R
+/Parent 79 0 R
+>> endobj
+79 0 obj <<
+/Title 80 0 R
+/A 77 0 R
+/Parent 18175 0 R
+/Prev 75 0 R
+/Next 87 0 R
+/First 83 0 R
+/Last 83 0 R
+/Count -1
+>> endobj
+75 0 obj <<
+/Title 76 0 R
+/A 73 0 R
+/Parent 18175 0 R
+/Prev 71 0 R
+/Next 79 0 R
+>> endobj
+71 0 obj <<
+/Title 72 0 R
+/A 69 0 R
+/Parent 18175 0 R
+/Prev 3 0 R
+/Next 75 0 R
+>> endobj
+67 0 obj <<
+/Title 68 0 R
+/A 65 0 R
+/Parent 3 0 R
+/Prev 63 0 R
+>> endobj
+63 0 obj <<
+/Title 64 0 R
+/A 61 0 R
+/Parent 3 0 R
+/Prev 59 0 R
+/Next 67 0 R
+>> endobj
+59 0 obj <<
+/Title 60 0 R
+/A 57 0 R
+/Parent 3 0 R
+/Prev 55 0 R
+/Next 63 0 R
+>> endobj
+55 0 obj <<
+/Title 56 0 R
+/A 53 0 R
+/Parent 3 0 R
+/Prev 51 0 R
+/Next 59 0 R
+>> endobj
+51 0 obj <<
+/Title 52 0 R
+/A 49 0 R
+/Parent 3 0 R
+/Prev 47 0 R
+/Next 55 0 R
+>> endobj
+47 0 obj <<
+/Title 48 0 R
+/A 45 0 R
+/Parent 3 0 R
+/Prev 43 0 R
+/Next 51 0 R
+>> endobj
+43 0 obj <<
+/Title 44 0 R
+/A 41 0 R
+/Parent 3 0 R
+/Prev 39 0 R
+/Next 47 0 R
+>> endobj
+39 0 obj <<
+/Title 40 0 R
+/A 37 0 R
+/Parent 3 0 R
+/Prev 35 0 R
+/Next 43 0 R
+>> endobj
+35 0 obj <<
+/Title 36 0 R
+/A 33 0 R
+/Parent 3 0 R
+/Prev 31 0 R
+/Next 39 0 R
+>> endobj
+31 0 obj <<
+/Title 32 0 R
+/A 29 0 R
+/Parent 3 0 R
+/Prev 27 0 R
+/Next 35 0 R
+>> endobj
+27 0 obj <<
+/Title 28 0 R
+/A 25 0 R
+/Parent 3 0 R
+/Prev 23 0 R
+/Next 31 0 R
+>> endobj
+23 0 obj <<
+/Title 24 0 R
+/A 21 0 R
+/Parent 3 0 R
+/Prev 19 0 R
+/Next 27 0 R
+>> endobj
+19 0 obj <<
+/Title 20 0 R
+/A 17 0 R
+/Parent 3 0 R
+/Prev 15 0 R
+/Next 23 0 R
+>> endobj
+15 0 obj <<
+/Title 16 0 R
+/A 13 0 R
+/Parent 3 0 R
+/Prev 11 0 R
+/Next 19 0 R
+>> endobj
+11 0 obj <<
+/Title 12 0 R
+/A 9 0 R
+/Parent 3 0 R
+/Prev 7 0 R
+/Next 15 0 R
+>> endobj
+7 0 obj <<
+/Title 8 0 R
+/A 5 0 R
+/Parent 3 0 R
+/Next 11 0 R
+>> endobj
+3 0 obj <<
+/Title 4 0 R
+/A 1 0 R
+/Parent 18175 0 R
+/Next 71 0 R
+/First 7 0 R
+/Last 67 0 R
+/Count -16
+>> endobj
+18176 0 obj <<
+/Names [(Doc-Start) 535 0 R (GFDL) 1516 0 R (GFDL_GFDL) 567 0 R (GPL) 1438 0 R (GPL_GPL) 568 0 R (Item.1) 812 0 R]
+/Limits [(Doc-Start) (Item.1)]
+>> endobj
+18177 0 obj <<
+/Names [(Item.2) 813 0 R (Item.3) 819 0 R (Item.4) 820 0 R (Item.5) 821 0 R (classParma__Polyhedra__Library_1_1Approximable__Reference) 1687 0 R (classParma__Polyhedra__Library_1_1Approximable__Reference__Common) 1688 0 R]
+/Limits [(Item.2) (classParma__Polyhedra__Library_1_1Approximable__Reference__Common)]
+>> endobj
+18178 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape) 778 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0116f88c40d760b836053dc1ef9ed4ca) 3492 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0658fdb9ef74cb1d3915d0cdafada883) 3332 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a07e8e56f20bb15bc686dcabc5c6fa4a3) 3168 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0cd2f7c7eb4acf21db838c99cec45209) 3245 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0d2b8d6a7fc03c4f5ca8f82264c8 [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape) (classParma__Polyhedra__Library_1_1BD__Shape_a0d2b8d6a7fc03c4f5ca8f82264c8665b)]
+>> endobj
+18179 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a0d75045e4088147a88f089b9d8c8df80) 3330 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0dcfbef37051b2a6d19c103cae4fd05e) 3314 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a0f6c31cfbda606cce98b462d4ac77965) 3249 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a1150d4335975e5975c312dcca1f559f4) 3499 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a12dc6df3a06f4c97c6bb2264bbad05ac) 3086 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a0d75045e4088147a88f089b9d8c8df80) (classParma__Polyhedra__Library_1_1BD__Shape_a132b0fc4c8babd873edebce9d3f8efca)]
+>> endobj
+18180 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a13e45ff9cb1e2f17deffb62b0dad2e7e) 3323 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a1a3d9e134f0d16c37a70d2a27047c3f7) 3491 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a24830275e95c7145681ef8f8f8406eae) 3247 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a266c8bcbc9ff3b87e744bf81a5d42afc) 3160 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a28f0f720c0985b12628cc8503aa993d9) 3430 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a13e45ff9cb1e2f17deffb62b0dad2e7e) (classParma__Polyhedra__Library_1_1BD__Shape_a2b71578c4754dc514ec9230bc0b27531)]
+>> endobj
+18181 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a2d1adfbfb01688a6698e37f170e3359b) 3237 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a30f39e11a47c43d5748bf61ab5b128fa) 3426 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a322bac0792d905334bff250275c75604) 3246 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a32f6f4de4f5f4ca71e465109241ae20b) 3172 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a38d2d7506b66e2f0f019e4558662eeb0) 3497 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a2d1adfbfb01688a6698e37f170e3359b) (classParma__Polyhedra__Library_1_1BD__Shape_a39b8f1fb08978701670894460a54cf61)]
+>> endobj
+18182 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a3a679103070e0356c10d4a1ef627f78d) 3328 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a3be9bbebc060e84a56cd47a3e92f68d9) 3162 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a3c7501dcb9894827f8edd8c3c428a79c) 3169 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a3e34e0a5b5b5841e189749bf9d1cd295) 3255 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a416575f07c033f50b7232cbd32c782ef) 3324 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a3a679103070e0356c10d4a1ef627f78d) (classParma__Polyhedra__Library_1_1BD__Shape_a44c65e7b5033b536da403cf38c420a9c)]
+>> endobj
+18183 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a47b43abdd9ab63d425cff5975ab469d6) 3326 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a49528f56a14aee0673f8dfdabff8a106) 3167 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a4c8cd4023eb230066e1854fde4c8a6b3) 3505 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a4f289d7e8d85e3225df99b1183548db8) 3092 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a4f9abd7604d980aada03b937e3c8d928) 3320 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a47b43abdd9ab63d425cff5975ab469d6) (classParma__Polyhedra__Library_1_1BD__Shape_a4ff866dbcea2662194a1e8541a6e77ec)]
+>> endobj
+18184 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a571cda80a2239703a8588dc5c4010144) 3241 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a59614f8f6b4560e5c59ee0323ae94c8e) 3248 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a5c88ed488f60782df67bd2ac2b6c2731) 3419 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a62a3609f7f68b60f8e54e534ff9d7d53) 3174 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a65e4afeac0b018f92c0111764182e8b8) 3487 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a571cda80a2239703a8588dc5c4010144) (classParma__Polyhedra__Library_1_1BD__Shape_a67833db3724bbbb5ebd176933686d09c)]
+>> endobj
+18185 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a67d795554d1caaf2ca4672d078eb3ee6) 3178 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a6871eebde08090cb02572b4f8daa467f) 3235 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a6945e8de7f4abb44bbd6bf522f4ab18b) 3327 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a70ae1ffea56bb9c7953cb0225caf4df2) 3163 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a73bae93d6fb72c37ef4945e9116c020b) 3500 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a67d795554d1caaf2ca4672d078eb3ee6) (classParma__Polyhedra__Library_1_1BD__Shape_a7691d9950e06ce1b4282f70ce7f4f1bf)]
+>> endobj
+18186 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a798f3b87e54a6c934c17626f2316e375) 3325 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a7a513effc5fdf2da0f04fbe26c874eff) 3317 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a7e23ffbc30ab77025fa08d20098d3d36) 3429 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a7e6ea8860a9be5cfadaefc0954a9a214) 3238 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a7e9d64ffc94c61daef4246b833efc0f2) 3322 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a798f3b87e54a6c934c17626f2316e375) (classParma__Polyhedra__Library_1_1BD__Shape_a7fd7969cfe0f6714a7937407b66bb053)]
+>> endobj
+18187 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a80396c0358a6779da28e96e8056e87f2) 3329 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a810ed3dd32909e9882ffde86321b2a73) 3243 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a817f9a9e8d05f1dac454e3a8da1075c3) 3244 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a863d6eb629dedad5b72d5bef6bcab9f4) 3415 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8753833d56000447de862c0bf26259b7) 3493 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a80396c0358a6779da28e96e8056e87f2) (classParma__Polyhedra__Library_1_1BD__Shape_a883c6690834c25c2a363ccfdee259851)]
+>> endobj
+18188 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a88c162dae957cc0a7c4245e0416a34d6) 3504 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a88c770a5e454fd7a600b2be0bcfbfa0e) 3431 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8a1cd7df2586fcb1c129b1ec5a28fe9f) 3522 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8ea88c8b9c07cff8afbea97a30fd8402) 3420 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a8ea9551f7124d61a3ba37b2625487cd1) 3171 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a88c162dae957cc0a7c4245e0416a34d6) (classParma__Polyhedra__Library_1_1BD__Shape_a91265643984fda317743e70a2f8f887e)]
+>> endobj
+18189 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_a93c1c491c0035f6c38b9ee036184aa7e) 3090 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a9ba9626bf1d58badcdf6931f784bef41) 3179 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a9d7348b591f41aa2bec4701aed6e3fd4) 3175 0 R (classParma__Polyhedra__Library_1_1BD__Shape_a9f66e595842edb48b2ba1089ae78afd4) 3489 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aa37486c5f7e745ee0297c151c1709c27) 3321 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a93c1c491c0035f6c38b9ee036184aa7e) (classParma__Polyhedra__Library_1_1BD__Shape_aaa92431687ae9fd0c516ed7059acb6f2)]
+>> endobj
+18190 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_aaac5dc37ad883270db68e3ca168d410f) 3496 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aab2bb670f874f8dceffad602c09c3f43) 3091 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aab43c1426f6a2f0fbf049242786c2f0a) 3494 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aadefe87cdfbb2c5fb288f045538d271c) 3417 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aae5fd5e214d5b758e5f05360e8138131) 3089 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_aaac5dc37ad883270db68e3ca168d410f) (classParma__Polyhedra__Library_1_1BD__Shape_ab07eb7656e7af947b8c1190ffea0ef4d)]
+>> endobj
+18191 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ab22fa6ad8c08777e4e4872f46e93294e) 3423 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ab93fc9c66c2ccb499e3e6dd88efb6347) 3502 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ababff4889ba6ce01e2eaf4454db450eb) 3424 0 R (classParma__Polyhedra__Library_1_1BD__Shape_abdb22ab9ca25ec598257820b7d9da99a) 3518 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ac14604e047be1b9b21de64d12efd4574) 3490 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ab22fa6ad8c08777e4e4872f46e93294e) (classParma__Polyhedra__Library_1_1BD__Shape_ac2b562d993daccd41cbf9b49008f112c)]
+>> endobj
+18192 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ac51af16de2e751d78b72424793383783) 3517 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ac655c600b28b5286dae20fd0330e6565) 3254 0 R (classParma__Polyhedra__Library_1_1BD__Shape_ac819bb3796a10a52e28d4a0c74338413) 3418 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acab010b53f9252b4dfa62eb9f9f78061) 3242 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acd9aad06b85b345bf27c50403a4ed5be) 3422 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ac51af16de2e751d78b72424793383783) (classParma__Polyhedra__Library_1_1BD__Shape_acdfc00755efc1b4105caf1e460a8b1c9)]
+>> endobj
+18193 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_aceaf5104c60fa96b7a7b0f3b386d870e) 3498 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acf0acb2be8236174a75d2044613dfc17) 3316 0 R (classParma__Polyhedra__Library_1_1BD__Shape_acfed8bc19e046453778c9d99d84df283) 3085 0 R (classParma__Polyhedra__Library_1_1BD__Shape_adca2c5c09b89833b1af80fbade02cf86) 3253 0 R (classParma__Polyhedra__Library_1_1BD__Shape_add45a2b2ae350cc34b4721214548d68c) 3252 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_aceaf5104c60fa96b7a7b0f3b386d870e) (classParma__Polyhedra__Library_1_1BD__Shape_ae19446701e7a216e5faefffd1188a2d2)]
+>> endobj
+18194 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_ae348ffaa6b9c476915222198ac021f42) 3170 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aea2a4666928ce284581790d37e94eec7) 3251 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aed0a7bbd57c5a7ebbf13e37927a79394) 3425 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aedabe8ecd0866b972e97709e17f94681) 3088 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aee6f239b759a4e7001d2018fe0142193) 3315 0 R (classParma__Polyhedra__Library_1_1BD__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ae348ffaa6b9c476915222198ac021f42) (classParma__Polyhedra__Library_1_1BD__Shape_aefd226c7945e61d8cd18f9e63cbe4655)]
+>> endobj
+18195 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BD__Shape_af051d63a780fb581f1d4555f2c882317) 3157 0 R (classParma__Polyhedra__Library_1_1BD__Shape_af13f330a6140e378687d9bbef46e52a3) 3421 0 R (classParma__Polyhedra__Library_1_1BD__Shape_afa1bbe3a8e77331adb07bce018d9f458) 3503 0 R (classParma__Polyhedra__Library_1_1BD__Shape_afd5346bf36add8144c7b618fc31da567) 3256 0 R (classParma__Polyhedra__Library_1_1BD__Shape_aff1718bcc72c8835fa079ae5a0de448c) 3177 0 R (classParma__Polyhedra__Library_1_1BHRZ [...]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_af051d63a780fb581f1d4555f2c882317) (classParma__Polyhedra__Library_1_1BHRZ03__Certificate)]
+>> endobj
+18196 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a35ea0c10995c89f8a11a2e8bb5dc7f17) 3922 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a5ebec8f5ff32009c4cf98dead90f4a3c) 3918 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a67b4e0eba7692bced073431cd3cc22ae) 3917 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a6ab41afc79135511037718442fcad4d4) 3921 0 R (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a97b2101d371edae52746a53cf34e4b67 [...]
+/Limits [(classParma__Polyhedra__Library_1_1BHRZ03__Certificate_a35ea0c10995c89f8a11a2e8bb5dc7f17) (classParma__Polyhedra__Library_1_1BHRZ03__Certificate_af2ec3c62388f9aef1414a527e82cd1a7)]
+>> endobj
+18197 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Binary__Operator) 1733 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Common) 1734 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a35b06cfa8331827b55846da95b222287) 3966 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Common_a5621564b142adc0eaee14971b379084c) 3968 0 R (classParma__Polyhedra__Library_1_1Binary__Operator__Common_aa26b7ac0a5822f668664afb29033b4e0) 3967 0 R (classParma__Polyhedra__Library_1_1Box)  [...]
+/Limits [(classParma__Polyhedra__Library_1_1Binary__Operator) (classParma__Polyhedra__Library_1_1Box)]
+>> endobj
+18198 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a0502713719a7ec27442ee314c0518ce7) 4302 0 R (classParma__Polyhedra__Library_1_1Box_a0541d092976a45f0536672282080b5f8) 4213 0 R (classParma__Polyhedra__Library_1_1Box_a05599cc4434b264117a5cbfa7e369acb) 4048 0 R (classParma__Polyhedra__Library_1_1Box_a0771b9671858526a0bc8c9563bbe6d03) 4210 0 R (classParma__Polyhedra__Library_1_1Box_a0a3af4761ddba931bf8e58add0afb234) 4049 0 R (classParma__Polyhedra__Library_1_1Box_a0cc609127bac73d7b4fdce98dfe53 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a0502713719a7ec27442ee314c0518ce7) (classParma__Polyhedra__Library_1_1Box_a0cc609127bac73d7b4fdce98dfe53ff5)]
+>> endobj
+18199 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a0d95ca2c2460f76192aa685809c44bce) 4312 0 R (classParma__Polyhedra__Library_1_1Box_a10bc77ab4d8e4abe74a7f4388b475d46) 4372 0 R (classParma__Polyhedra__Library_1_1Box_a1717ae1040fcb9dfa558f0592121bfb6) 4224 0 R (classParma__Polyhedra__Library_1_1Box_a17a3728922f9ea3c3448ddff2ba8f03c) 4305 0 R (classParma__Polyhedra__Library_1_1Box_a18acc1eda6de3cecae90d1745595e652) 4369 0 R (classParma__Polyhedra__Library_1_1Box_a1946e416f0a015ffa8c3397b13ccf [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a0d95ca2c2460f76192aa685809c44bce) (classParma__Polyhedra__Library_1_1Box_a1946e416f0a015ffa8c3397b13ccfcd9)]
+>> endobj
+18200 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a1ac45fdc32c1f71277c20bf99ba897b2) 4060 0 R (classParma__Polyhedra__Library_1_1Box_a1c3b68155c550c2db530870748fab905) 4229 0 R (classParma__Polyhedra__Library_1_1Box_a1c919831670c62f804f34bed961d05d0) 4212 0 R (classParma__Polyhedra__Library_1_1Box_a1ec16e0616d2caf2b2b9ddc5ab1f9095) 4365 0 R (classParma__Polyhedra__Library_1_1Box_a1ecc166599a5f4148ffb8501a7b06b2f) 4216 0 R (classParma__Polyhedra__Library_1_1Box_a20cc9fb3dab976e3efab4fb687a5e [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a1ac45fdc32c1f71277c20bf99ba897b2) (classParma__Polyhedra__Library_1_1Box_a20cc9fb3dab976e3efab4fb687a5ee27)]
+>> endobj
+18201 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a21f26d7888710beb265f4dbf86b740a6) 4363 0 R (classParma__Polyhedra__Library_1_1Box_a22ea9cc129dcd3d767850704b2e089bb) 4217 0 R (classParma__Polyhedra__Library_1_1Box_a252043e3c039025c8e7711ba54640be9) 4062 0 R (classParma__Polyhedra__Library_1_1Box_a2de34e0b200f5778015b9e30801c80ef) 4138 0 R (classParma__Polyhedra__Library_1_1Box_a30fb611cd3b23f903e1b5f285c238c38) 4395 0 R (classParma__Polyhedra__Library_1_1Box_a3195a9c16b89df35770bf13cfa40d [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a21f26d7888710beb265f4dbf86b740a6) (classParma__Polyhedra__Library_1_1Box_a3195a9c16b89df35770bf13cfa40d3f3)]
+>> endobj
+18202 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a35eea48c9cfb87e065f6aeee620d6e25) 4151 0 R (classParma__Polyhedra__Library_1_1Box_a375fe6faa28320fd69632bd4f2121216) 4140 0 R (classParma__Polyhedra__Library_1_1Box_a3997abcdd433134571a7f47430cb56a2) 3975 0 R (classParma__Polyhedra__Library_1_1Box_a3a9ad95beee0ae1caebad2c6e412cc9b) 4069 0 R (classParma__Polyhedra__Library_1_1Box_a3c29d34f9481e3ac12c258c6b2e4fe7b) 4361 0 R (classParma__Polyhedra__Library_1_1Box_a3e45b1f4a434befb7613067681138 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a35eea48c9cfb87e065f6aeee620d6e25) (classParma__Polyhedra__Library_1_1Box_a3e45b1f4a434befb7613067681138a0c)]
+>> endobj
+18203 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a3e9c71d9592c8ea126bb0eb538159e17) 3976 0 R (classParma__Polyhedra__Library_1_1Box_a3eb224ee7296a48a896628d717af08ca) 4064 0 R (classParma__Polyhedra__Library_1_1Box_a3f3d352ec0d1be7e07b7865fe62266ac) 4371 0 R (classParma__Polyhedra__Library_1_1Box_a41d2a55e5cffc82a38f316bf132682c7) 4136 0 R (classParma__Polyhedra__Library_1_1Box_a499bc952185641d6b5a4e06df33cb15d) 4308 0 R (classParma__Polyhedra__Library_1_1Box_a501e789db7ee01e6987cabd000d8d [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a3e9c71d9592c8ea126bb0eb538159e17) (classParma__Polyhedra__Library_1_1Box_a501e789db7ee01e6987cabd000d8dee3)]
+>> endobj
+18204 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a5445aa770edda1aa04a60627e27221be) 4366 0 R (classParma__Polyhedra__Library_1_1Box_a54ffe31caa56e074a89cb19c27902229) 4370 0 R (classParma__Polyhedra__Library_1_1Box_a556f4d24accd80146165ddcde32f1ed0) 4139 0 R (classParma__Polyhedra__Library_1_1Box_a5b239b53a82bdcda95c97ab3b68e118a) 4070 0 R (classParma__Polyhedra__Library_1_1Box_a63fc60fa5641393daa4941bfbd221ea0) 4132 0 R (classParma__Polyhedra__Library_1_1Box_a642eec722adef1eed5e2ce7154639 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a5445aa770edda1aa04a60627e27221be) (classParma__Polyhedra__Library_1_1Box_a642eec722adef1eed5e2ce71546394c5)]
+>> endobj
+18205 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a6622f3ebaa0a7ca49ae31de570c9c5d7) 4066 0 R (classParma__Polyhedra__Library_1_1Box_a670a48f16c6832b218d772c267501cbc) 4310 0 R (classParma__Polyhedra__Library_1_1Box_a6cd706c19e9390869e487d6477e68873) 4133 0 R (classParma__Polyhedra__Library_1_1Box_a6f72dd3b1bbb47f4464d5e8909b26be1) 4051 0 R (classParma__Polyhedra__Library_1_1Box_a7116b71d356ae4ad3e759b828aabdbdc) 4375 0 R (classParma__Polyhedra__Library_1_1Box_a73264e4e6986e1b5c39d7a9e15b7e [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a6622f3ebaa0a7ca49ae31de570c9c5d7) (classParma__Polyhedra__Library_1_1Box_a73264e4e6986e1b5c39d7a9e15b7e983)]
+>> endobj
+18206 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a738468a82c6d887970a834617108ad38) 4304 0 R (classParma__Polyhedra__Library_1_1Box_a78b9cd4dc3fe1b22453da1f204263092) 4137 0 R (classParma__Polyhedra__Library_1_1Box_a79aa95bed46b8ab83b8a5d8354e72572) 4214 0 R (classParma__Polyhedra__Library_1_1Box_a7deecc429c0f5b6c5045f8384e4da34c) 3979 0 R (classParma__Polyhedra__Library_1_1Box_a7f13a5487370bd6131906660ec918e40) 3974 0 R (classParma__Polyhedra__Library_1_1Box_a818b1050a44c6fb4d635a6fc088ee [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a738468a82c6d887970a834617108ad38) (classParma__Polyhedra__Library_1_1Box_a818b1050a44c6fb4d635a6fc088eeeca)]
+>> endobj
+18207 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a8854920e8f71343aef3d711113bf4217) 4313 0 R (classParma__Polyhedra__Library_1_1Box_a88f8bca95abe664d3060372b61c49279) 4376 0 R (classParma__Polyhedra__Library_1_1Box_a897010fa370130e9d22b4e373ad2ada3) 3980 0 R (classParma__Polyhedra__Library_1_1Box_a898f5c9b6f44790c9a63e9a3c58240b6) 4227 0 R (classParma__Polyhedra__Library_1_1Box_a8d53eb99ecd29659516d17fb012da785) 4053 0 R (classParma__Polyhedra__Library_1_1Box_a937ab5b4a2e842b50072acc1a7b65 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a8854920e8f71343aef3d711113bf4217) (classParma__Polyhedra__Library_1_1Box_a937ab5b4a2e842b50072acc1a7b65ec8)]
+>> endobj
+18208 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_a98968306e896f1b6d0f14af2bc1d4d64) 4223 0 R (classParma__Polyhedra__Library_1_1Box_a9c6845f45ea7af3648a9c7f0483745df) 4317 0 R (classParma__Polyhedra__Library_1_1Box_aa2160390dc1737a88c9e99bddbd5b868) 4367 0 R (classParma__Polyhedra__Library_1_1Box_aa3d9bcd4a6443f9a464b5c1d054e61c7) 4134 0 R (classParma__Polyhedra__Library_1_1Box_aa57b2d0bd022842767e8ea09d0bcaca3) 4306 0 R (classParma__Polyhedra__Library_1_1Box_aadf0b61e103f67cceddc7f906fcd5 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a98968306e896f1b6d0f14af2bc1d4d64) (classParma__Polyhedra__Library_1_1Box_aadf0b61e103f67cceddc7f906fcd5d54)]
+>> endobj
+18209 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_aaedd389a755e8a8af62c5ceeeb7159b5) 4146 0 R (classParma__Polyhedra__Library_1_1Box_ab00f85f9c6e8ac122128b882b57aef6f) 4219 0 R (classParma__Polyhedra__Library_1_1Box_ab61175b7fba7302cb6afadb5b323bf5b) 4131 0 R (classParma__Polyhedra__Library_1_1Box_ab8509cde4b1541c96fb3f9617cb3a2a0) 4148 0 R (classParma__Polyhedra__Library_1_1Box_abac7045e04f0acd65976bd206587c1ba) 4307 0 R (classParma__Polyhedra__Library_1_1Box_abbc2f0efa777834582e50b84a118e [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_aaedd389a755e8a8af62c5ceeeb7159b5) (classParma__Polyhedra__Library_1_1Box_abbc2f0efa777834582e50b84a118e11a)]
+>> endobj
+18210 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_abf72d7c1638611a5c71bf52a8876e271) 4208 0 R (classParma__Polyhedra__Library_1_1Box_ac257361c1e50e8bdb3df14b10efccd8d) 4211 0 R (classParma__Polyhedra__Library_1_1Box_ac2b7fcab5dcf39429fd6f646dac8c00c) 4047 0 R (classParma__Polyhedra__Library_1_1Box_ac2f9f8298fa010f8f6fa57d0f3aa34d5) 4207 0 R (classParma__Polyhedra__Library_1_1Box_ac72c231542712976d1f9223d0537f5d5) 4052 0 R (classParma__Polyhedra__Library_1_1Box_acb3a642ede7e834de34d863314e07 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_abf72d7c1638611a5c71bf52a8876e271) (classParma__Polyhedra__Library_1_1Box_acb3a642ede7e834de34d863314e07810)]
+>> endobj
+18211 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_acbf26ad2a67dbfbd24eb9c89448a793b) 3972 0 R (classParma__Polyhedra__Library_1_1Box_ad72705a881e3ebdbc1872e278e453411) 4314 0 R (classParma__Polyhedra__Library_1_1Box_adad0a8c0777894840eb1e47415bd2dd8) 4225 0 R (classParma__Polyhedra__Library_1_1Box_adba7125dc65aecea57c44c18767a7d6d) 3977 0 R (classParma__Polyhedra__Library_1_1Box_adc0c5285fb27f97b159343d073147583) 4057 0 R (classParma__Polyhedra__Library_1_1Box_add1749de593080b326f6fb04bf1ef [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_acbf26ad2a67dbfbd24eb9c89448a793b) (classParma__Polyhedra__Library_1_1Box_add1749de593080b326f6fb04bf1efe50)]
+>> endobj
+18212 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_ade1f0e51d72f00210547d258764758e8) 4068 0 R (classParma__Polyhedra__Library_1_1Box_ade461ee9d38a42feae8beba99ac14f23) 4364 0 R (classParma__Polyhedra__Library_1_1Box_adfa6c6f25a86b7a8ba9e8ca6b1020e58) 4147 0 R (classParma__Polyhedra__Library_1_1Box_ae02c20f1b068eb38700e4f61f50f5886) 4150 0 R (classParma__Polyhedra__Library_1_1Box_ae0fdd96e9e1b49de034111388ccdf76c) 4373 0 R (classParma__Polyhedra__Library_1_1Box_ae22cab253269d7d9c8098d7b107b8 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_ade1f0e51d72f00210547d258764758e8) (classParma__Polyhedra__Library_1_1Box_ae22cab253269d7d9c8098d7b107b8282)]
+>> endobj
+18213 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_ae43ec2c3ad2a7aa6067b1e4183ffc8d3) 4135 0 R (classParma__Polyhedra__Library_1_1Box_ae56880dabc96438041d5520c084eab29) 4226 0 R (classParma__Polyhedra__Library_1_1Box_aed0590bb20123efb8b5a9cf6bf874c05) 4067 0 R (classParma__Polyhedra__Library_1_1Box_aee4fdb270cbcc8a6c5fc5ab619f75c2e) 4059 0 R (classParma__Polyhedra__Library_1_1Box_aef4feee62ba32afe0ead38e6684b5ce4) 4142 0 R (classParma__Polyhedra__Library_1_1Box_af26815fa2663eaee5589d5b6e3896 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_ae43ec2c3ad2a7aa6067b1e4183ffc8d3) (classParma__Polyhedra__Library_1_1Box_af26815fa2663eaee5589d5b6e3896405)]
+>> endobj
+18214 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_af4596a33925d3d0f614611c49a93e63a) 4061 0 R (classParma__Polyhedra__Library_1_1Box_af46728314c76649e2da343cdd66057fc) 4220 0 R (classParma__Polyhedra__Library_1_1Box_af6ee94f21dca99f7a394f5c2d3ddf90e) 4222 0 R (classParma__Polyhedra__Library_1_1Box_af76b83d6dc4342096be7f3eeff5813f5) 3978 0 R (classParma__Polyhedra__Library_1_1Box_af8aa5e3f210b0f082fc5f6d1be91d31c) 4315 0 R (classParma__Polyhedra__Library_1_1Box_af92ee9bb7bcbcb21f9258383d1324 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_af4596a33925d3d0f614611c49a93e63a) (classParma__Polyhedra__Library_1_1Box_af92ee9bb7bcbcb21f9258383d1324237)]
+>> endobj
+18215 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Box_afad7c372c3fe87cfaf8b4791009dbb10) 4071 0 R (classParma__Polyhedra__Library_1_1Box_afb4f9e889f3565e5bdf6fbb58202a9db) 4221 0 R (classParma__Polyhedra__Library_1_1Box_aff8b02e03fc1ad496d15eab2f7bc9bcd) 4215 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator) 1796 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a0ec1eb879aa24c8e3f8b9abc08a51f27) 6082 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__i [...]
+/Limits [(classParma__Polyhedra__Library_1_1Box_afad7c372c3fe87cfaf8b4791009dbb10) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1ddeb95722df9e5f35009c6e017e2404)]
+>> endobj
+18216 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1e45c485643b62ed4d751fd0bfaa3677) 6085 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a2c9678fbda42018549d63c11e4c806a6) 6046 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a412d0108a72eca07f0075f7a60662e34) 6080 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a4db44a79e5e6eea466723a565634b017) 6087 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__it [...]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_a1e45c485643b62ed4d751fd0bfaa3677) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_abed774daa9ed3c470c7fd237bf40e28c)]
+>> endobj
+18217 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) 6083 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac8af5985d99461f4c7d765a67da5f02c) 6048 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_acade7cd192977aa0b43a42bbaafe1c27) 6084 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ad9a4e7c1648f42300ec153db346dffb2) 6072 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__it [...]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ac1af3129a578ad1519defead5bf9dfa4) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_adf87eef74d0ff9ff35e15aeea0a361c7)]
+>> endobj
+18218 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) 6047 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_aef8ddf62527c76662e377fdc9b46b928) 6081 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator) 1913 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a150a3fcf4b23e91a58c5acb8a455fec2) 10158 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ba31de49e0fcff11975c0e8670269b9) 10154 0 R (c [...]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a1ffe9c9777d454e5bc5d0ad41887ae8c)]
+>> endobj
+18219 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a27ebe448697b1357cb06c60b471f4045) 10149 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a64ca0878a1f4a3c338b920ecb7c56c4e) 10155 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a701efa51459fa5353f1620f9a1524f52) 10159 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a939f1c932a39f3ac0d579352534ee0d8) 10160 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aa29c608bc5c4c8d0b1d42da [...]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_a27ebe448697b1357cb06c60b471f4045) (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_aadf870c4d6fea9b5650aa888c2e79ca2)]
+>> endobj
+18220 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab18c32ab9d8e6a7fc785165b6aa4db56) 10157 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab331b1dede4f6e83d3eefb864929a9d9) 10117 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad4a1398505beae32e88bdc66625dcf92) 10164 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ad9420cd4a63cbe1e155a94a8064f86b5) 10150 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae432dca61c738591a5c53f1 [...]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ab18c32ab9d8e6a7fc785165b6aa4db56) (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae6ce7cc93a11ff81885948a776dd0e56)]
+>> endobj
+18221 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae8f1b6153c04bde0aac8592ff6edbe36) 10161 0 R (classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_af7e70970808607a85d1daa4548c400d9) 10165 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron) 776 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a09726be54fe2a591787de59eeffdd2ea) 4827 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a2b220dabc613a89a062968101429e58c) 4794 0 R (classParma__Polyhedra__Library_1_1C__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1iterator_ae8f1b6153c04bde0aac8592ff6edbe36) (classParma__Polyhedra__Library_1_1C__Polyhedron_a2d68c082ea8fcddda6aa41afdd7ab476)]
+>> endobj
+18222 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1C__Polyhedron_a33d58476db85f48e4ad680c69bca524f) 4793 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a4b841053fdf5718c17a018ff650b550a) 4792 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a59d06e9b429faef7a632d58e4a0b12bd) 4825 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a5eb7f86790ada6549123a0225d68a4de) 4836 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a6424da8931d774f6a2e403c1e2f0d09a) 4828 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_a33d58476db85f48e4ad680c69bca524f) (classParma__Polyhedra__Library_1_1C__Polyhedron_a6f581bf46ab0488f444977453ba2ea2d)]
+>> endobj
+18223 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) 4802 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a8a6c3f01edb04382620066f17b63b20c) 4796 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a9720487deabf813a31afd4e9cfe695aa) 4799 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_a9eb55b3f27138d74d5002cc9782fd381) 4800 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_ac3126925bcd3349b150771d52c19639d) 4798 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_a75d4c8a80362dcd840c664b8c3c8182c) (classParma__Polyhedra__Library_1_1C__Polyhedron_ac86d25d06285c9a2e890770fed084574)]
+>> endobj
+18224 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) 4795 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_ae46f7a91b9fac1a62ef875ec5c72aab6) 4797 0 R (classParma__Polyhedra__Library_1_1C__Polyhedron_afaae25a26dbecf9341c7fb2c2575f81f) 4835 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression) 1230 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a02093e67947f8d2936d16e50a8f0b3e6) 4940 0 R (classParma__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a311e87a81daa4ca81dfb5ff62bd29b0f)]
+>> endobj
+18225 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a4361018a588858b1fe08b1b0c3db3dee) 4933 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a56648c2436a8c8b290e54ff23a69d7a9) 4927 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a77967b19f065c13620c847e2b08b81f5) 4931 0 R (classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a8f7ce2a1a1cb1c97a7883f945a7a6686) 4932 0 R (classParma__Polyhedra__Library_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Cast__Floating__Point__Expression_a4361018a588858b1fe08b1b0c3db3dee) (classParma__Polyhedra__Library_1_1Cast__Operator)]
+>> endobj
+18226 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Cast__Operator__Common) 1736 0 R (classParma__Polyhedra__Library_1_1Checked__Number) 1737 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a02949da26a3761489d2fb98018010990) 5152 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a033db92b1a0ad47eef6ddde4295f38ca) 5110 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a06c0a4ba25cbc3d59797bf1c73c49497) 5165 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a0803532e7523865597 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Cast__Operator__Common) (classParma__Polyhedra__Library_1_1Checked__Number_a0803532e7523865597c394e1371d2b16)]
+>> endobj
+18227 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a0b4f37e65d50f82b84ee59ee550943ac) 4988 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a0d0febd1b0b9373cae658b57f6413ed5) 5107 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a0edbf435f928c1702dc879bc4862bbf8) 5159 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a111d55b8ee2701ec3d03c00de136cd74) 5109 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a164f8732d5fe6b526a34e168145a95ad) 5099 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a0b4f37e65d50f82b84ee59ee550943ac) (classParma__Polyhedra__Library_1_1Checked__Number_a1a79ab4c49d7ae4406b56dc2b3d94463)]
+>> endobj
+18228 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a1bdc1023fb4478270594d0e965eb90c9) 5045 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a2024878c4c26cb836d454e2e93f40c8f) 5041 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a24e90bb8bb38d248aca79c76a1717d9d) 5059 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a257a415453078f71a54d6d0b3b57ff4d) 5113 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a298300b8f88eb674c317b99ad09a474b) 5040 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a1bdc1023fb4478270594d0e965eb90c9) (classParma__Polyhedra__Library_1_1Checked__Number_a3cb9b031ec4e6fd7e53e53da5b0f04a1)]
+>> endobj
+18229 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a3dc4a1fb95b9f86f622fbe557265f85d) 5151 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a3f0416bda0c321489e3eb1fdad315c2c) 5162 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a404beea19c04f4e7bbcfe81aae0d6a7d) 5052 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a4058dda09c1a7b6bc6993f703ab1b9ea) 4987 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a461dbfcb8f68886137794e4a408fc55e) 5046 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a3dc4a1fb95b9f86f622fbe557265f85d) (classParma__Polyhedra__Library_1_1Checked__Number_a4bed59d493c4fd91537602efb267c938)]
+>> endobj
+18230 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a4ce2f9170fb3470ba10d87607c3c0bf3) 4989 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a4f3206ab2d3c47e2014e5b306167c7c0) 5042 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a55e9dfdf5da9a55b7523bda6b7f56c78) 5060 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a584917b259b17e155eb5ea10518320f2) 4991 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a589cc1d8001fd57ded3f964928e66738) 5153 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a4ce2f9170fb3470ba10d87607c3c0bf3) (classParma__Polyhedra__Library_1_1Checked__Number_a65b1cc4ac0c0c8a2efcbf3d36d4ac0ac)]
+>> endobj
+18231 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a6625b3bd49cc1e038931a4c4d04c19f0) 5111 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6957dba3dbf92459a364893d7ecfb897) 5048 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6a2d561ac8088ed64a0bb51d8fffcd9b) 5158 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6afe848ad84ff68d48142caf0599760a) 5105 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a6d113d317b02ed4e14ff704deb304ce2) 5055 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a6625b3bd49cc1e038931a4c4d04c19f0) (classParma__Polyhedra__Library_1_1Checked__Number_a6e4e84f9ccaf35d6c56acc6c6c3de53c)]
+>> endobj
+18232 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a74b0a8cfdec7831e7a3e296b3e3751dd) 5047 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a77a2c5c27e9c0838fea6e6447b20c320) 5051 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a79f64d099a652834da74cc8fd68f2452) 5098 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a7ce6dfd81e04c3eb8d196bf13a96ebe6) 5155 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a80f6de87ec43c33fac3832b14a507c0b) 5039 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a74b0a8cfdec7831e7a3e296b3e3751dd) (classParma__Polyhedra__Library_1_1Checked__Number_a8772f767006f16e376d8eca9b1578b73)]
+>> endobj
+18233 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_a8abdf2e292960e1fb216ce3c2c0816ff) 5061 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a98dae78cdd16f7127a4b3e18c3976562) 5100 0 R (classParma__Polyhedra__Library_1_1Checked__Number_a9d2cd0aa9626fd28ec99bde5bff4c020) 5056 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aa07ea1b002e7f295fe941b15a8f74711) 4985 0 R (classParma__Polyhedra__Library_1_1Checked__Number_aa3de5a2fe7f06d0aa3e4972be2023933) 5057 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a8abdf2e292960e1fb216ce3c2c0816ff) (classParma__Polyhedra__Library_1_1Checked__Number_aafe0bdaacef3657f8ed1368c3d1f374a)]
+>> endobj
+18234 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_ab19be1f26efb21370e8460b325a7f57c) 5103 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab4d4a0ebee3fcc93490aa029028a810b) 5044 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ab75c0e7d52f4b166574fa66584ce92e4) 5160 0 R (classParma__Polyhedra__Library_1_1Checked__Number_abce60ff247b3d293291a2ee49f52457b) 5054 0 R (classParma__Polyhedra__Library_1_1Checked__Number_abdf3631e599e5641e1fea94cfd46a3a2) 5115 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ab19be1f26efb21370e8460b325a7f57c) (classParma__Polyhedra__Library_1_1Checked__Number_abf60cc7fa60d33c4fe958126d55cbac2)]
+>> endobj
+18235 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_ac8b0427ab092068fffe6c4db194e9602) 5157 0 R (classParma__Polyhedra__Library_1_1Checked__Number_acca11ef67e39b711f96604b6bf806feb) 5043 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ace79521e8aabcba7193a9a2087c50b22) 5106 0 R (classParma__Polyhedra__Library_1_1Checked__Number_acf545e278c4b69db51df0a36e43d4e38) 4986 0 R (classParma__Polyhedra__Library_1_1Checked__Number_ada2aea654f9945088d4ebc062581883d) 5112 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ac8b0427ab092068fffe6c4db194e9602) (classParma__Polyhedra__Library_1_1Checked__Number_ade4a5582f82333f20fd6a8be13ff8d7f)]
+>> endobj
+18236 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_ae09d1e8f6ab1eea10ceba92f21681110) 5053 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af0647cd431d30a9658d4bdc77e32d9e4) 5102 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af442fec6f6ffdad1948cf89d69c574b3) 5108 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af47ee9cf59cfac8a346660698c61d113) 5049 0 R (classParma__Polyhedra__Library_1_1Checked__Number_af9d7eaecf113e25020c55ed0bf79eb03) 5062 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ae09d1e8f6ab1eea10ceba92f21681110) (classParma__Polyhedra__Library_1_1Checked__Number_af9daca45c3c1d0d1afd57ab47c6cacd4)]
+>> endobj
+18237 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Checked__Number_afad3fbdebb1ba319083c56fa2ae679e6) 5097 0 R (classParma__Polyhedra__Library_1_1Checked__Number_afcb46dd5c0701130f067f577f99ef27f) 5058 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression) 1742 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common) 1743 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a603e2a97c5ea7e4e81bad4464a9aba2b) 5334 0 R (classParma__Polyhedra__Library_1_1Concrete__E [...]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_afad3fbdebb1ba319083c56fa2ae679e6) (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a6ceeebd94402797c5ad4a69f8bb73bcf)]
+>> endobj
+18238 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a9eeea4961725654dcc5f4526fa729df1) 5336 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_aa1ae2d642bd66d32f64b708c28fbf044) 5333 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Common_ae7432f48686d9fa7923ed66d070988d6) 5335 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type) 1744 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a0c0e22bb6388967d928cb6cde [...]
+/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Common_a9eeea4961725654dcc5f4526fa729df1) (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1558ce3303b13a4d17df20c2f4d20ada)]
+>> endobj
+18239 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1b95213b929e61be2683bf1d9c220d70) 5371 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a5d1e8bb981043726cc2ffacfdd3c3013) 5374 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a67bee18b81c21e09116b7423b3465a2a) 5378 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a722647b9832d183eedcc441913b25edb) 5365 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression__Typ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_a1b95213b929e61be2683bf1d9c220d70) (classParma__Polyhedra__Library_1_1Concrete__Expression__Type_abf158dc171228668bd20a36339b60f10)]
+>> endobj
+18240 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_aef17a5e76a36d74b648706582fd2487d) 5376 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_a307595e3959d8b493eef756efaf0631b) 5254 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_a34ee73e8a8cb7e13a65fc6ed7e0d3678) 5252 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_a51da7be45180533a6f05d193a193fde5) 5251 0 R (classParma__Polyhedra__Library_1_1Concrete__Expression_a837cb016717cabc430d63 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression__Type_aef17a5e76a36d74b648706582fd2487d) (classParma__Polyhedra__Library_1_1Concrete__Expression_aa13879760b95faeaebfcd40e1723005b)]
+>> endobj
+18241 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Concrete__Expression_ae9988816fab7d8ef0cae14eab37167fe) 5253 0 R (classParma__Polyhedra__Library_1_1Congruence) 1745 0 R (classParma__Polyhedra__Library_1_1Congruence__System) 1746 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator) 1799 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a0ac88c873a13c4afa6f99d3d436e13a3) 6259 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Concrete__Expression_ae9988816fab7d8ef0cae14eab37167fe) (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a12f3d0ee3885355092a65262f24d46af)]
+>> endobj
+18242 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a192ff11375b59075c9ea19a8c2b5511e) 6256 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a400c02f876d8f4e3f6aef2bfc5fb16cb) 6255 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a70e56452f6edfc1943b555156e6bf828) 6257 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a97586e332fd16ccf6e7d642bb4bbf83e) 6258 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a192ff11375b59075c9ea19a8c2b5511e) (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae575efc6c01c4bf9968c7e27bb94951b)]
+>> endobj
+18243 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae7c03963759dfdb937135a7f99165361) 6250 0 R (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_af0ea51d59b5026db43b2edd4cee928ba) 6252 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a067b4c27cf8643f8ded50ebda77da8aa) 5796 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a0a4f8e3f3469f021594ea9311c21aadd) 5794 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_ae7c03963759dfdb937135a7f99165361) (classParma__Polyhedra__Library_1_1Congruence__System_a0dd6aa622dcadcee1746650f8ca164eb)]
+>> endobj
+18244 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a11de7a0cc309058d6aee273d613c9432) 5852 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a1557515cde9d0030743cd45ce2471e0a) 5778 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a1685b5eb65ba36a9e715a8e3344dbcd8) 5789 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a1a897aa9f5d0da382de3c8baafba247c) 5726 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a20b0080e4a1abdb68ce945191c540b2e) 585 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a11de7a0cc309058d6aee273d613c9432) (classParma__Polyhedra__Library_1_1Congruence__System_a21f1586e66349acf7aa0d70c77f92b60)]
+>> endobj
+18245 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) 5839 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a32012e3b09434b858367d216108e42c6) 5847 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a339fab488002bb5b341e1bb82edee103) 5876 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a3fe60e1a76b2a92143004e52ccfcb7c7) 5786 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a548ae200545f7d25b875f190b5611368) 584 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a2e45b62cb223f5a21ced82480712e64f) (classParma__Polyhedra__Library_1_1Congruence__System_a562fa08178e809398402920e5e674ff8)]
+>> endobj
+18246 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a5c85932f5fb67a78d1faf8165783d5d3) 5790 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a6605130131af1ca6e54f8ce1e71a993b) 5856 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a6e742d7ffa4f4b7037760cf3ebf62348) 5850 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a705b9ccde802cccb058145896a399b50) 5780 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a77c72d8473dc3e9856d7ff6c05ce7b07) 584 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a5c85932f5fb67a78d1faf8165783d5d3) (classParma__Polyhedra__Library_1_1Congruence__System_a7c083d56e96fb1b5bc3c5fb23350f0a2)]
+>> endobj
+18247 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_a87998e7258a2c529be20f456ded30c90) 5855 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a8bca7707491a770d78b523ae5570b139) 5727 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a8f66b17d5e71aebc89be0af0e3a4c7df) 5797 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a8f78066abbc29188a3dccfad42477aec) 5777 0 R (classParma__Polyhedra__Library_1_1Congruence__System_a9d7fe3b07d9e1d35c04fa2d81e32bf34) 577 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_a87998e7258a2c529be20f456ded30c90) (classParma__Polyhedra__Library_1_1Congruence__System_a9e8a61b2b759dde8f65219688548ffaa)]
+>> endobj
+18248 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) 5843 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aa83361b2264ca8ed30599dca32447874) 5854 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aa8e40c27df6ef5afcad226530be53c54) 5725 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aaf3b18ae83d99811dad22d336a1a117f) 5877 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ab8ae5d861fb56c8ed906f604be7c4f02) 578 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) (classParma__Polyhedra__Library_1_1Congruence__System_ac759e2fa9ea2058d86292dc3c5b43a7a)]
+>> endobj
+18249 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_acf4cf2f1d8c3e1d339b1eddc94139272) 5793 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ad05bc9046303661aa532423ac5a5c16d) 5840 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ad7c61256a3d02a8f345701bf5eabdf6b) 5846 0 R (classParma__Polyhedra__Library_1_1Congruence__System_ae4a4890ceb257496b788e0d31dbf6d7f) 5785 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aea6d543c90be52299d6ffc57fc9ba5d1) 584 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_acf4cf2f1d8c3e1d339b1eddc94139272) (classParma__Polyhedra__Library_1_1Congruence__System_aeb80e8469483bf1408d49901fee73802)]
+>> endobj
+18250 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence__System_aec5860620ae92988c1740dc393064fe7) 5845 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aedf8e546cc63ff0ade5d34cb995beb09) 5875 0 R (classParma__Polyhedra__Library_1_1Congruence__System_aee8ca9a278a53c88ad387a619bc80f27) 5787 0 R (classParma__Polyhedra__Library_1_1Congruence__System_af97f2d43a487ec81e040aec36bbc6ebe) 5851 0 R (classParma__Polyhedra__Library_1_1Congruence__System_afefca839fc7b4d2d166e7a1fe6196fd5) 578 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_aec5860620ae92988c1740dc393064fe7) (classParma__Polyhedra__Library_1_1Congruence_a016c2304fe3a1a73988eb83b2ccf1fe9)]
+>> endobj
+18251 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_a07bb90eb18242945afb161e4deadb09e) 5569 0 R (classParma__Polyhedra__Library_1_1Congruence_a0ff04e47054c14b2edf29096ecc95ab7) 5485 0 R (classParma__Polyhedra__Library_1_1Congruence_a11d3ecf7df43ab6f40620de32004f339) 5496 0 R (classParma__Polyhedra__Library_1_1Congruence_a146b211f83e22bd011d3de2e5975073b) 5489 0 R (classParma__Polyhedra__Library_1_1Congruence_a29c63b939ed830a0395170835e60beaf) 5572 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a07bb90eb18242945afb161e4deadb09e) (classParma__Polyhedra__Library_1_1Congruence_a29c6deef0eb3911adbb08d36a8f0b3f2)]
+>> endobj
+18252 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_a2ca2446f563956eb2b92ddd17e5c0b2c) 5558 0 R (classParma__Polyhedra__Library_1_1Congruence_a2cb39e7c88e9e724e7970d0e953f2c81) 5623 0 R (classParma__Polyhedra__Library_1_1Congruence_a33e6005a1fe40cb202eb619912c25c3c) 5486 0 R (classParma__Polyhedra__Library_1_1Congruence_a39b6f38fff55dd953ec509b3739dd17d) 5482 0 R (classParma__Polyhedra__Library_1_1Congruence_a3c9879f0c9dcb81fe1bbf78828509ef6) 5481 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a2ca2446f563956eb2b92ddd17e5c0b2c) (classParma__Polyhedra__Library_1_1Congruence_a408ca35042312cfb3c8fb63d41ed2bf5)]
+>> endobj
+18253 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_a42e13324ee4f4b86975c282078a646fb) 5423 0 R (classParma__Polyhedra__Library_1_1Congruence_a43983a6ee447e480f8700915bccb4811) 5487 0 R (classParma__Polyhedra__Library_1_1Congruence_a484373d269a31c21efae44a83f8be6f0) 5484 0 R (classParma__Polyhedra__Library_1_1Congruence_a501af16aca73aef5735b86c5240c8974) 5418 0 R (classParma__Polyhedra__Library_1_1Congruence_a54cdd6074f90a5623c8ae7ddcfedc5c2) 5621 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a42e13324ee4f4b86975c282078a646fb) (classParma__Polyhedra__Library_1_1Congruence_a584cb5084fe5479b0c373e3d17fe5ffd)]
+>> endobj
+18254 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_a5a207ecd92e9fd8f3b1937a5064746a9) 5556 0 R (classParma__Polyhedra__Library_1_1Congruence_a5f3003416d324720351da9235a0a3802) 5563 0 R (classParma__Polyhedra__Library_1_1Congruence_a6609e54e84d50cd074c2dd65f38b47da) 5501 0 R (classParma__Polyhedra__Library_1_1Congruence_a6a24743a95176da13995bb6c17151c9b) 5571 0 R (classParma__Polyhedra__Library_1_1Congruence_a6e42477ffa8462fd1fadde0362e7bc3a) 5480 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a5a207ecd92e9fd8f3b1937a5064746a9) (classParma__Polyhedra__Library_1_1Congruence_a7415de7b412a5e297810ff35a97a2849)]
+>> endobj
+18255 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_a77a4ec4e4b5b11f3ce61f6c6701d8a7d) 5502 0 R (classParma__Polyhedra__Library_1_1Congruence_a792bc245b5674677eb1cf9cb5d10def9) 5426 0 R (classParma__Polyhedra__Library_1_1Congruence_a79c648d88214174287e3763b804f4aaf) 5495 0 R (classParma__Polyhedra__Library_1_1Congruence_a844aeb45177c00f4d4ad0755509d9e69) 5483 0 R (classParma__Polyhedra__Library_1_1Congruence_a8aab82f7118966662582f88725ce4735) 5560 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a77a4ec4e4b5b11f3ce61f6c6701d8a7d) (classParma__Polyhedra__Library_1_1Congruence_a94b3624c208219e401569cd289049b38)]
+>> endobj
+18256 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_a95560c356a7aa70cccb41b866a8455c0) 5421 0 R (classParma__Polyhedra__Library_1_1Congruence_a9aa9789183ac22bcb28a092c3e1f804f) 5494 0 R (classParma__Polyhedra__Library_1_1Congruence_aa03b119140132112557907b772102b33) 5497 0 R (classParma__Polyhedra__Library_1_1Congruence_aa948df90fc7880e7e52ceef297ee9bbf) 5622 0 R (classParma__Polyhedra__Library_1_1Congruence_aaf7dc46b2cfbd6650ac1d2035d331f15) 5575 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a95560c356a7aa70cccb41b866a8455c0) (classParma__Polyhedra__Library_1_1Congruence_ab45e800217e1c61d8595e2ffc51a83ad)]
+>> endobj
+18257 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_ab6054ead00332969adad17cdf785088b) 5565 0 R (classParma__Polyhedra__Library_1_1Congruence_ab917a480b6afe7e2750aa2862c6783cf) 5557 0 R (classParma__Polyhedra__Library_1_1Congruence_aba7dbedd485eab91821f129132a04723) 5427 0 R (classParma__Polyhedra__Library_1_1Congruence_aba9d8397055aa341d1ffc6702f67e60f) 5504 0 R (classParma__Polyhedra__Library_1_1Congruence_ac26379e5f82fd0223682b11b9e052ea5) 5499 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_ab6054ead00332969adad17cdf785088b) (classParma__Polyhedra__Library_1_1Congruence_ac53e4323b140cdd4ba1ac96e7204d93a)]
+>> endobj
+18258 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_ad07dc0dabac5685f9db8d9dc11e513f1) 5559 0 R (classParma__Polyhedra__Library_1_1Congruence_ad76648f21279e7e7c852cfc1daa1887f) 5422 0 R (classParma__Polyhedra__Library_1_1Congruence_ad8229aed551687502c5af78a4143254f) 5491 0 R (classParma__Polyhedra__Library_1_1Congruence_adeee840f3313b6050d439dbe5fe2fdd7) 5574 0 R (classParma__Polyhedra__Library_1_1Congruence_ae0c9395c1ac4d96e245be43fcd76424c) 5576 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_ad07dc0dabac5685f9db8d9dc11e513f1) (classParma__Polyhedra__Library_1_1Congruence_ae405ccb73f65071d6702baf98ae5e699)]
+>> endobj
+18259 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_ae96eebded76c559c95910dc233c68f06) 5498 0 R (classParma__Polyhedra__Library_1_1Congruence_aeb05cfafe5dbcb57a7f831180204ef7f) 5419 0 R (classParma__Polyhedra__Library_1_1Congruence_aed38df906a6f7c01305168df91d7d095) 5503 0 R (classParma__Polyhedra__Library_1_1Congruence_aef9838273809d695f9c52a96b37123b6) 5428 0 R (classParma__Polyhedra__Library_1_1Congruence_af66a2692f29cc03aa773c48a2cc644ab) 5570 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_ae96eebded76c559c95910dc233c68f06) (classParma__Polyhedra__Library_1_1Congruence_afcf86304f17dc474e1e5bbe0486c1b59)]
+>> endobj
+18260 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Congruence_afd55d0cb3ab31c5e800c18eb849aa295) 5492 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction) 1747 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction_a7a41076eb4ff956a7cd86f87dad1e470) 5920 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction_aa687f39208cd480b29e7e6d09662441a) 5925 0 R (classParma__Polyhedra__Library_1_1Congruences__Reduction_ac4c3a18e15580a4213589aa55790f60f) 5921 0 R (classParma__Polyhed [...]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_afd55d0cb3ab31c5e800c18eb849aa295) (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression)]
+>> endobj
+18261 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a017b50a53d3f73e61cb5c9d787cb1907) 6338 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a10111aaf9879fb501147e3d8d51d215b) 6362 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a20a1a23e17edcba771385da4510f4786) 6335 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a2455d0df0fa4e1bf0781207fae5453c9) 6352 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a017b50a53d3f73e61cb5c9d787cb1907) (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a5de206a495a44970b2dcd4b769fb2ef3)]
+>> endobj
+18262 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a79a27720fc3f7a3e989f10ebdb6b2800) 6339 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a8669f7f8a54a22c294c94b36106edfb4) 6337 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_aa272377eb99f1a8b4b48114da9bc6051) 6336 0 R (classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_afaea5e43dc4ba9daa7b8cb9f3a221da9) 6360 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constant__Floating__Point__Expression_a79a27720fc3f7a3e989f10ebdb6b2800) (classParma__Polyhedra__Library_1_1Constraint__System)]
+>> endobj
+18263 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) 1803 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a168ed0cbd2cf59717febf52a6d6e107a) 7010 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a177ecd1fb2bec07a416a3369f22d068d) 7014 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a40dee04f6adce4b8c60a569662f37f96) 7011 0 R (classParma__Polyhedra__Library_1_1Constraint__System__con [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator) (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a6d8bd16c6f8ccff0228956f76a9b7464)]
+>> endobj
+18264 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a8ab042e81927db600ee725d3c983b252) 7006 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aa1ff4528466150c5a3ce8d110c0c92e1) 7005 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_aaa37fb590232bdc2474283e83bc019cf) 7009 0 R (classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_acefade434fe64088a872391d152455c1) 7008 0 R (classParma__Polyhedra__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System__const__iterator_a8ab042e81927db600ee725d3c983b252) (classParma__Polyhedra__Library_1_1Constraint__System_a09afd391300355989769ad52d3cc97aa)]
+>> endobj
+18265 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a2552e7a194f5fb0d591bafb591b91968) 6952 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a2b451e6b09162c7c19b0a2ad36545c69) 6954 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a2b9db6ddc26573299d412b80ee0dc018) 6966 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a2cd0082c00a9bf823852c95674680b48) 6900 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a314eb5fed86c6bbe4a7223ca8362f0a9) 691 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a2552e7a194f5fb0d591bafb591b91968) (classParma__Polyhedra__Library_1_1Constraint__System_a32d97203a9cbf1abf97af74fc70df05b)]
+>> endobj
+18266 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a3410a53827de9155ac7d6cbd84263364) 6914 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a5498315352fd30826df848010c6bac1d) 6902 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a5a79ce2b52efebd42da2736164a043ad) 6953 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a5cebd3d6d6ec070c47682e77b0248f22) 6918 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a5fbb0274f3a0a91ad283aef6e608909a) 691 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a3410a53827de9155ac7d6cbd84263364) (classParma__Polyhedra__Library_1_1Constraint__System_a6293b813e42a59a9795cafe0efa762cc)]
+>> endobj
+18267 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) 6919 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a6aec148aa41935a4072c64a43c51c577) 6911 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a70e9ad42674d62ed9bd73268e3af7064) 6959 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a78a4d5f5e4702a16d6aae656293ec7ad) 6955 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a809a4546135123a08f12c0a65fb22241) 690 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a67f95ed6867827f03a6af0a7334376e3) (classParma__Polyhedra__Library_1_1Constraint__System_a8388d0d6d7ff68c627d516ec17f56b4c)]
+>> endobj
+18268 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System_a92333180e0163e9c87f2220dceef012d) 6920 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a964e4bcbbfde58f43977d0a8e686ec35) 6904 0 R (classParma__Polyhedra__Library_1_1Constraint__System_a999f627225c179795a8922d8335065fe) 6956 0 R (classParma__Polyhedra__Library_1_1Constraint__System_ab79c93f68d0f4589de855e872f9e72f6) 6909 0 R (classParma__Polyhedra__Library_1_1Constraint__System_ac3223cf8c7d19b02b5e3c04038024b47) 695 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a92333180e0163e9c87f2220dceef012d) (classParma__Polyhedra__Library_1_1Constraint__System_ad350b84c25b7c37693d2e7a08d3165ca)]
+>> endobj
+18269 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System_ad876557324aba0b545e25ebabe5a064b) 6907 0 R (classParma__Polyhedra__Library_1_1Constraint__System_add9738866968b13e938d5669dd94a55e) 6965 0 R (classParma__Polyhedra__Library_1_1Constraint__System_adfa7b03e2ac3a6666a7538431f1bdee9) 6905 0 R (classParma__Polyhedra__Library_1_1Constraint__System_ae36d644db84375b3aed9a748c6dff35b) 6916 0 R (classParma__Polyhedra__Library_1_1Constraint__System_aea9a4fb9807eb61cda3eedf8e5a7acae) 696 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_ad876557324aba0b545e25ebabe5a064b) (classParma__Polyhedra__Library_1_1Constraint__System_af2d6708545759fc6836df550bab529a0)]
+>> endobj
+18270 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint__System_af59c44aeed3fb4b88852730664a84e9e) 6915 0 R (classParma__Polyhedra__Library_1_1Constraint_a047a99eb91872d19730f4fd14a81f55c) 6583 0 R (classParma__Polyhedra__Library_1_1Constraint_a097e454cd31f0dddb7e7a7ceab1a2511) 6423 0 R (classParma__Polyhedra__Library_1_1Constraint_a09c8fc0753a389cc42f84c12f7920832) 6565 0 R (classParma__Polyhedra__Library_1_1Constraint_a0ab383f3930179982937f7733a283a03) 6485 0 R (classParma__Polyhedra__Li [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_af59c44aeed3fb4b88852730664a84e9e) (classParma__Polyhedra__Library_1_1Constraint_a0ab38d6ea061e7c2cb1595ba9cf2fd42)]
+>> endobj
+18271 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a0d23bda1485bb810ad2b6745d067dc6a) 6416 0 R (classParma__Polyhedra__Library_1_1Constraint_a0d50a5df6b31c6de90fe366e18e750ff) 6490 0 R (classParma__Polyhedra__Library_1_1Constraint_a0e0942b92b2f099b4ad4897d2b986dea) 6433 0 R (classParma__Polyhedra__Library_1_1Constraint_a182ea33f63c0eea708e02a32b0904f30) 6719 0 R (classParma__Polyhedra__Library_1_1Constraint_a1e7682395739069fa5bee820540b2bd3) 6491 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a0d23bda1485bb810ad2b6745d067dc6a) (classParma__Polyhedra__Library_1_1Constraint_a239b0622fbcfe1638b4246deab2caa29)]
+>> endobj
+18272 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a2679da4dbd5b8c33ef607aee49690c2a) 6496 0 R (classParma__Polyhedra__Library_1_1Constraint_a29202eb817eb5c9d59433abeeb4f2eea) 6497 0 R (classParma__Polyhedra__Library_1_1Constraint_a2935fff040a5b31930fff594a0b2596d) 6568 0 R (classParma__Polyhedra__Library_1_1Constraint_a2fb9117b8937e3d9a9b4d3ae397bb79a) 6712 0 R (classParma__Polyhedra__Library_1_1Constraint_a32d23987abcbb26d66dcc31aa003b70d) 6727 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a2679da4dbd5b8c33ef607aee49690c2a) (classParma__Polyhedra__Library_1_1Constraint_a340e8b886fb185bed798dcbc1391c126)]
+>> endobj
+18273 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a36a0c8ccab7923610bd27f637af63e1d) 6432 0 R (classParma__Polyhedra__Library_1_1Constraint_a3c1dcd74ba0b2509f45aad45a5d922ce) 6425 0 R (classParma__Polyhedra__Library_1_1Constraint_a3c920e734593812d8529bc12be6f503e) 6576 0 R (classParma__Polyhedra__Library_1_1Constraint_a405f3dfb1b620defbadb0b2f103b8f28) 6495 0 R (classParma__Polyhedra__Library_1_1Constraint_a423e3bb0d9886c630c3c227def9f2073) 6713 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a36a0c8ccab7923610bd27f637af63e1d) (classParma__Polyhedra__Library_1_1Constraint_a442aecbe0ce384a7c1add146fb125ed6)]
+>> endobj
+18274 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) 6710 0 R (classParma__Polyhedra__Library_1_1Constraint_a4b4c0277d3b6c85ab6633ae9f5e235c6) 6575 0 R (classParma__Polyhedra__Library_1_1Constraint_a50213d8479884e1f0d7fae1c4f817943) 6434 0 R (classParma__Polyhedra__Library_1_1Constraint_a54742578f3ff98e32e7e15d6b554f13f) 6577 0 R (classParma__Polyhedra__Library_1_1Constraint_a600a652347fb8718e0bc05f7230b8d8a) 6716 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a448b4387171ec166085eb46aacedaad9) (classParma__Polyhedra__Library_1_1Constraint_a61208276a246a505bd753ffbb568bfe7)]
+>> endobj
+18275 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) 6715 0 R (classParma__Polyhedra__Library_1_1Constraint_a660c04b4c90264ea97b3367acb01e8a9) 6420 0 R (classParma__Polyhedra__Library_1_1Constraint_a6742bd7f3f2cb079b96900dda0147940) 6486 0 R (classParma__Polyhedra__Library_1_1Constraint_a745ac1cdddf74c6f387cfbbbc566dc78) 6479 0 R (classParma__Polyhedra__Library_1_1Constraint_a78c24741e21a4406ea8ad1588c768147) 6484 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a61bc4f536e4c04b9594e1b6c7e13d76e) (classParma__Polyhedra__Library_1_1Constraint_a7bdaff085ea6859cdec9b27bffb6de4b)]
+>> endobj
+18276 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) 6574 0 R (classParma__Polyhedra__Library_1_1Constraint_a858b9fe39b14cf51d179a84be1605436) 6726 0 R (classParma__Polyhedra__Library_1_1Constraint_a85ca415a40fbd066ad850e26b1fe1653) 6493 0 R (classParma__Polyhedra__Library_1_1Constraint_a89943bdfa5424bf7acecc51a7b6949c8) 6581 0 R (classParma__Polyhedra__Library_1_1Constraint_a8d9338b98f6d33e111c0c0d70508b4ee) 6422 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a852f422dfdf14a1e8a97b4dad77f7e36) (classParma__Polyhedra__Library_1_1Constraint_a8e5a205098d89ad9473676ae57f29ac5)]
+>> endobj
+18277 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_a93d5d6abf06ec551294c4c18abb4349d) 6489 0 R (classParma__Polyhedra__Library_1_1Constraint_a9960963fb1f8fb56631e0402557065ae) 6483 0 R (classParma__Polyhedra__Library_1_1Constraint_a9a66ca9c0638705ea9620ecb49a41852) 6418 0 R (classParma__Polyhedra__Library_1_1Constraint_a9dc926136daee1f47975434ee45298ec) 6424 0 R (classParma__Polyhedra__Library_1_1Constraint_aa8a21b3b30b29ca087ecc032d1a3f922) 6500 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a93d5d6abf06ec551294c4c18abb4349d) (classParma__Polyhedra__Library_1_1Constraint_aaf207e746f4a3dc2722e254612dab3b3)]
+>> endobj
+18278 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_ab0f18894c8f97fa0cd38736462f36132) 6487 0 R (classParma__Polyhedra__Library_1_1Constraint_ab12acbd3962ac07c4db8f1994351668b) 6723 0 R (classParma__Polyhedra__Library_1_1Constraint_ab3186208850238a080373f035cd532cc) 6481 0 R (classParma__Polyhedra__Library_1_1Constraint_ab6976f576e6e50941ee7a7b1a737c0eb) 6480 0 R (classParma__Polyhedra__Library_1_1Constraint_abbde4b86cfca3e29a917650f4c9c62d5) 6569 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_ab0f18894c8f97fa0cd38736462f36132) (classParma__Polyhedra__Library_1_1Constraint_abdd61469bc5c6dfc6e97f306a751035c)]
+>> endobj
+18279 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_ac7bf9d127644aa14a09eab633e87f544) 6421 0 R (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6ab) 6427 0 R (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6aba7491a8ba26958c3e27bed23b7eef1a7e) 6430 0 R (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8ed8e2c3c38d0435adff6abab5b32713c840499d9e29facf95a17f41) 6428 0 R (classParma__Polyhedra__Library_1_1Constraint_ac9b8aa34a8e [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_ac7bf9d127644aa14a09eab633e87f544) (classParma__Polyhedra__Library_1_1Constraint_acc5c5125e7237c5913981b99a502f332)]
+>> endobj
+18280 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_accc738986aa1e74d232da8c9cc10966a) 6477 0 R (classParma__Polyhedra__Library_1_1Constraint_acedadd7f7742a18d941ded77da69ba9a) 6720 0 R (classParma__Polyhedra__Library_1_1Constraint_ad3ea3f2d15908e9ae70759f247c39727) 6431 0 R (classParma__Polyhedra__Library_1_1Constraint_adba3d929f4317a38ad387c5b45a91199) 6582 0 R (classParma__Polyhedra__Library_1_1Constraint_adda5908777a9d901f2e7bcf7f61b9d67) 6725 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_accc738986aa1e74d232da8c9cc10966a) (classParma__Polyhedra__Library_1_1Constraint_ae3674890a93b407b8080fdd7ea85d93f)]
+>> endobj
+18281 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) 6717 0 R (classParma__Polyhedra__Library_1_1Constraint_ae5339ea3f93440d6815df903f304e36c) 6492 0 R (classParma__Polyhedra__Library_1_1Constraint_ae615df068adfbb40a0b0b7a993579d22) 6718 0 R (classParma__Polyhedra__Library_1_1Constraint_ae73aae9c2283b936cdaf92e13ab5d727) 6476 0 R (classParma__Polyhedra__Library_1_1Constraint_ae86d21a6490f299af6229d70cf20c3ba) 6722 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_ae3cacddb2450b8b685b8f39936a2b69d) (classParma__Polyhedra__Library_1_1Constraint_aea0fedb82a525e6ada13cd7fd2d03225)]
+>> endobj
+18282 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_af023b7e8ad5a15b2617878bf2bf93d5c) 6571 0 R (classParma__Polyhedra__Library_1_1Constraint_af06b2331eb3d080794682080b7f7eb1d) 6711 0 R (classParma__Polyhedra__Library_1_1Constraint_af245f065572b31c8ca97e196e45f9cf9) 6580 0 R (classParma__Polyhedra__Library_1_1Constraint_af2eb5d22ef23937a261cfe3f6bc435e6) 6584 0 R (classParma__Polyhedra__Library_1_1Constraint_af8fcee7f8582b0afc9115eb1304c24f9) 6499 0 R (classParma__Polyhedra__Library_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_af023b7e8ad5a15b2617878bf2bf93d5c) (classParma__Polyhedra__Library_1_1Constraint_afbee4abe5b3b83f47971e19f47f3bb53)]
+>> endobj
+18283 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Constraint_afe7cc9f7ed389844bb2484ba6bebdde0) 6724 0 R (classParma__Polyhedra__Library_1_1Constraints__Reduction) 1804 0 R (classParma__Polyhedra__Library_1_1Constraints__Reduction_a4a8af06ff9f0434860b2c253a02406c0) 7028 0 R (classParma__Polyhedra__Library_1_1Constraints__Reduction_a770ca19b06c82d0de4780b7ee091df72) 7029 0 R (classParma__Polyhedra__Library_1_1Constraints__Reduction_a9e8323bcacdbcdfedf9a76ab296389cf) 7033 0 R (classParma__Polyhed [...]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_afe7cc9f7ed389844bb2484ba6bebdde0) (classParma__Polyhedra__Library_1_1Determinate)]
+>> endobj
+18284 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Determinate_a054973ef19a18393fa8036b0de2e4dbe) 7074 0 R (classParma__Polyhedra__Library_1_1Determinate_a067bfa8ae61a33390e27ae981fde671b) 7081 0 R (classParma__Polyhedra__Library_1_1Determinate_a34a906d66497c7b42c6c9ea77165bc38) 7071 0 R (classParma__Polyhedra__Library_1_1Determinate_a382c0dc82b8c78f56d128417d61d66de) 7078 0 R (classParma__Polyhedra__Library_1_1Determinate_a3c0fc9e2b5b43528857c2fbe3e96b81e) 7111 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Determinate_a054973ef19a18393fa8036b0de2e4dbe) (classParma__Polyhedra__Library_1_1Determinate_a4107301b10dfc19aff5b3df720622abd)]
+>> endobj
+18285 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Determinate_a4d7661321b11a65279b5d936a1fba56b) 7073 0 R (classParma__Polyhedra__Library_1_1Determinate_a55311ef7c4114673de51e497bd427a7c) 7077 0 R (classParma__Polyhedra__Library_1_1Determinate_a5691758c1bc58425ab2e47b5ef1b5431) 7107 0 R (classParma__Polyhedra__Library_1_1Determinate_a5c44d3d0955540b98975a14f5b97e942) 7085 0 R (classParma__Polyhedra__Library_1_1Determinate_a6874db32fb21728ef129e7a2e39343dd) 7118 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Determinate_a4d7661321b11a65279b5d936a1fba56b) (classParma__Polyhedra__Library_1_1Determinate_a7eb3a57714b03eb33869ebe8c42ad52f)]
+>> endobj
+18286 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Determinate_a8c77d6b1d2bd2e952fe64efad3349d54) 7075 0 R (classParma__Polyhedra__Library_1_1Determinate_a8cb48474739502030e86ee234c17f0bb) 7108 0 R (classParma__Polyhedra__Library_1_1Determinate_a9ca80278a9bd107a4e3bd1f08f90fa88) 7110 0 R (classParma__Polyhedra__Library_1_1Determinate_aaaa17e7ba528aced3a8436194c4d7119) 7114 0 R (classParma__Polyhedra__Library_1_1Determinate_aab39fb7c66f4105c941430d9931b0189) 7072 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Determinate_a8c77d6b1d2bd2e952fe64efad3349d54) (classParma__Polyhedra__Library_1_1Determinate_aae7e5b25ce9803fc9b573763f85d37d2)]
+>> endobj
+18287 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Determinate_aaf7354d4275ed3c36ba7e24536fd0d00) 7109 0 R (classParma__Polyhedra__Library_1_1Determinate_ab6dbf75ccfaa0f7b0a103622dfcc9d76) 7079 0 R (classParma__Polyhedra__Library_1_1Determinate_abbd1a3e57c1f33d638b4ae3aa852416f) 7086 0 R (classParma__Polyhedra__Library_1_1Determinate_ad2240e857f3c1b0c3d76a26e8f731340) 7113 0 R (classParma__Polyhedra__Library_1_1Determinate_ae49b82ae95d6fecdbe7d3d44d84dfb55) 7112 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Determinate_aaf7354d4275ed3c36ba7e24536fd0d00) (classParma__Polyhedra__Library_1_1Determinate_ae7990e15a0193c52e91a48bb29a48c78)]
+>> endobj
+18288 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) 1235 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a10c114a4a966a22b16ec30dc8fa036d7) 7183 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1a5c8e881f8449ae038fc40642062df6) 7155 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a1ac494c155283df2c60cc98fd44e526a) 7184 0 R (classParma__Polyhedra__Library_1_1Differe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a5e0223ac875a8b0d999efbb9b349159e)]
+>> endobj
+18289 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a722ccfd31ef9e2761c705d678eb42662) 7185 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a7cac2a7ab2e138c7c0e96354b32b0110) 7157 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_ab156f789e720f2d04086a672448ded40) 7156 0 R (classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_af0800054c69699766ed5188e3e11641c) 7159 0 R (classPa [...]
+/Limits [(classParma__Polyhedra__Library_1_1Difference__Floating__Point__Expression_a722ccfd31ef9e2761c705d678eb42662) (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a443736bb8156073cf1c5f672737eb02b)]
+>> endobj
+18290 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a6cfe9f46fa0f15b09149f89ef35430c4) 7242 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a7b57685cf4be76a8b527f897899752f0) 7264 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a97422036ac465eef627efdda59fe796a) 7253 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a983bda3cdbc99be37b6d97901098c765) 7263 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a6cfe9f46fa0f15b09149f89ef35430c4) (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ab33acaf64e56c6c81ec31eeed6f86d35)]
+>> endobj
+18291 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ace2048bede4b2b3dc32d64f0355e398e) 7244 0 R (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_adaf83ce888c996163559b520ebda628c) 7239 0 R (classParma__Polyhedra__Library_1_1Domain__Product) 1806 0 R (classParma__Polyhedra__Library_1_1FP__Oracle) 1857 0 R (classParma__Polyhedra__Library_1_1FP__Oracle_a34f9d9a55678514e434ebed37cf89f01) 7552 0 R (classParma__Polyhedra__Library_1_1FP__Orac [...]
+/Limits [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_ace2048bede4b2b3dc32d64f0355e398e) (classParma__Polyhedra__Library_1_1FP__Oracle_a534e99d940f191cba72c31acb19989cc)]
+>> endobj
+18292 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1FP__Oracle_a70b0fbcc1272e8bb764a95cb3f1e2d17) 7538 0 R (classParma__Polyhedra__Library_1_1FP__Oracle_ae11646b9e6b853245a5d04301f39c134) 7540 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Constant) 1855 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Constant__Common) 1856 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression) 1229 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb [...]
+/Limits [(classParma__Polyhedra__Library_1_1FP__Oracle_a70b0fbcc1272e8bb764a95cb3f1e2d17) (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a1227429514fcb31eb82e53cfee117251)]
+>> endobj
+18293 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) 7271 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a39d93a2090abf51259c8620dc44fc7f0) 4955 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a422b3e7ced74f7052a7421c0936af970) 4956 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a47ad848995778e50f0d50dc73a147ef1) 7479 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expr [...]
+/Limits [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_a335f6a6b447abacad72c1817a6911587) (classParma__Polyhedra__Library_1_1Floating__Point__Expression_a5fec18209ac7b45aa96a0e42680cbe49)]
+>> endobj
+18294 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) 4939 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad188910a1f5315a330c49dc7eaf6eaa5) 6351 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_ad38e3f11db47d8cdd6e9d8d796d04b28) 4937 0 R (classParma__Polyhedra__Library_1_1Floating__Point__Expression_afaa9803d7f13e98f459c0ce6980b25bf) 7473 0 R (classParma__Polyhedra__Library_1_1GMP__Integer) 1861 0  [...]
+/Limits [(classParma__Polyhedra__Library_1_1Floating__Point__Expression_ac4bd733422313639358cb5c241cd0637) (classParma__Polyhedra__Library_1_1GMP__Integer_a01c5bdd401e8bc17ea983d941be2aa49)]
+>> endobj
+18295 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1GMP__Integer_a081a1af02e55d9903d0bf3816a6e91f1) 8416 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a11810ad660a4aa63766e8ebb0334b7d6) 8409 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a29b14636d21c90e28ee1821666dc1d64) 8410 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a2f220b5f73e79a2e6feab3a97a7e2445) 8411 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a38ab8dc3ca19cacef112ca316bc7ce09) 8415 0 R (classParma__Polyhedra__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a081a1af02e55d9903d0bf3816a6e91f1) (classParma__Polyhedra__Library_1_1GMP__Integer_a4039bbdc92a28fade431cb98f20b0fa6)]
+>> endobj
+18296 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1GMP__Integer_a6d5c75bcc32f8aea006e8da4b3f736b2) 8402 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a6e613e3f02e896503d38da788ad593b8) 8404 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a7f9dc23eef0ab2ef9d07f4d53177afce) 8412 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a83b02e8cbb5d14a2ebf2843e6551391d) 8414 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_a84565fd9471a52f83618d0d5ce461c3c) 8419 0 R (classParma__Polyhedra__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a6d5c75bcc32f8aea006e8da4b3f736b2) (classParma__Polyhedra__Library_1_1GMP__Integer_a952922658abcdfb880fcf0a8483c9620)]
+>> endobj
+18297 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1GMP__Integer_a9a22818e12d0abab8d8a8e0d3346f51a) 8406 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_ab8dbbfce1fd68d57df6b05d5cc74c012) 8405 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_abc1d7e892f343522c751d672d5632f17) 8417 0 R (classParma__Polyhedra__Library_1_1GMP__Integer_acf54a358f4ddf09f56364da87de68a49) 8407 0 R (classParma__Polyhedra__Library_1_1Generator) 1858 0 R (classParma__Polyhedra__Library_1_1Generator__System) 1859 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a9a22818e12d0abab8d8a8e0d3346f51a) (classParma__Polyhedra__Library_1_1Generator__System)]
+>> endobj
+18298 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System__const__iterator) 1860 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a53db1aeb67216c949d1aa627299ab5bf) 8335 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a71f52ba9ef61e0f336d025241003646c) 8334 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a76aee99fe2a1984162c8efbf867a97b2) 8331 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__i [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System__const__iterator) (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a8ba666eb5beace7b116d9f9e16e9a742)]
+>> endobj
+18299 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a94534f2d8132436533398ce6cdca13c8) 8327 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_acd703faaddfab4f29bdd2958b4a9d1c3) 8326 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ad21fe8d252487a1df3b3c90f94fbcfb0) 8332 0 R (classParma__Polyhedra__Library_1_1Generator__System__const__iterator_ae23adcce73c0875e8a7dc6b3797e57ac) 8329 0 R (classParma__Polyhedra__Libr [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System__const__iterator_a94534f2d8132436533398ce6cdca13c8) (classParma__Polyhedra__Library_1_1Generator__System_a02b52b4ef5b1806566495cb7b6d35abb)]
+>> endobj
+18300 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System_a071ec60375df0a0f5051dc431f445e37) 8267 0 R (classParma__Polyhedra__Library_1_1Generator__System_a25fce97f25e1814c62ec46b7a04ee942) 8261 0 R (classParma__Polyhedra__Library_1_1Generator__System_a2b29f5668213f9171cfdc666ef4142ea) 8221 0 R (classParma__Polyhedra__Library_1_1Generator__System_a37abf9e26c109cf608ec7829284883ec) 8272 0 R (classParma__Polyhedra__Library_1_1Generator__System_a558bee1e7045c2ed558e68002cb3dd4f) 8209 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a071ec60375df0a0f5051dc431f445e37) (classParma__Polyhedra__Library_1_1Generator__System_a5b6f5bd4d4b79ef1721075830c19716d)]
+>> endobj
+18301 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System_a6135986b7669c295a1855279a9347433) 8211 0 R (classParma__Polyhedra__Library_1_1Generator__System_a6b57cf93153051d3aa63c33e34ee4127) 8258 0 R (classParma__Polyhedra__Library_1_1Generator__System_a6e9c19c25562f9d1a71523d00b337450) 8269 0 R (classParma__Polyhedra__Library_1_1Generator__System_a7072dc2f1979eb1198aea49e10bcd59d) 8263 0 R (classParma__Polyhedra__Library_1_1Generator__System_a7b9d70f9508c08b9a86272878ca03b5f) 8260 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a6135986b7669c295a1855279a9347433) (classParma__Polyhedra__Library_1_1Generator__System_a7bda239eefab2b9cc9cabc123bbaef31)]
+>> endobj
+18302 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System_a804b0e848b19f18d99664d5bbd57a3f1) 8212 0 R (classParma__Polyhedra__Library_1_1Generator__System_a92ed2a28d3c4689eec62eae04cdc2520) 8214 0 R (classParma__Polyhedra__Library_1_1Generator__System_a9eef881b5ea4e9dae4b2ff713a43af79) 8219 0 R (classParma__Polyhedra__Library_1_1Generator__System_a9fe4a78fa5899317f5a060d7b607b5c1) 8259 0 R (classParma__Polyhedra__Library_1_1Generator__System_aa33b89d7143376193110dde339707b0d) 8217 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a804b0e848b19f18d99664d5bbd57a3f1) (classParma__Polyhedra__Library_1_1Generator__System_aad63aea0771a124cfb70c8e8e80779a3)]
+>> endobj
+18303 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System_aaf6afcf59d181946f02b27418d9b651a) 8215 0 R (classParma__Polyhedra__Library_1_1Generator__System_ab0063024b3761b3ff89c3f259ebac6fe) 8262 0 R (classParma__Polyhedra__Library_1_1Generator__System_ab174d3f8d008aca83801ae0de294528d) 8222 0 R (classParma__Polyhedra__Library_1_1Generator__System_ab9156785517cdd6c775b365ea12d2d18) 8264 0 R (classParma__Polyhedra__Library_1_1Generator__System_acb15b3a65e5dba1c113539f2912c75f8) 8213 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System_aaf6afcf59d181946f02b27418d9b651a) (classParma__Polyhedra__Library_1_1Generator__System_acce6ad80815e7d09970ed92968967585)]
+>> endobj
+18304 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator__System_acea4ab79eb91ca6bad6a126f08de1cc5) 8210 0 R (classParma__Polyhedra__Library_1_1Generator__System_ad53075833d1bde0c9e36dd70afb4b967) 8266 0 R (classParma__Polyhedra__Library_1_1Generator__System_adcd147a1c5474a820c7379514f629fda) 8273 0 R (classParma__Polyhedra__Library_1_1Generator__System_aed024de0dc1ad69e380f706d25740cb0) 8223 0 R (classParma__Polyhedra__Library_1_1Generator__System_afb150cd8c06fd986b4b57ffe29bc871e) 8274 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System_acea4ab79eb91ca6bad6a126f08de1cc5) (classParma__Polyhedra__Library_1_1Generator_a088d6ae30ad9a32fc26bb02fe46a26e0)]
+>> endobj
+18305 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) 7851 0 R (classParma__Polyhedra__Library_1_1Generator_a137b1f86858576e71034aec1ce54fd65) 8000 0 R (classParma__Polyhedra__Library_1_1Generator_a13c726daa7d565ded0b177e24b6d1104) 7658 0 R (classParma__Polyhedra__Library_1_1Generator_a1a8e5994aa0d6de25ef4806664b8486b) 7733 0 R (classParma__Polyhedra__Library_1_1Generator_a1ad16d1e8a395685314dedffe17fbb8c) 7854 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a0c26ae11a4146369ff86288347cc54db) (classParma__Polyhedra__Library_1_1Generator_a1b5063a9931b8a9d4a0db756c0b1c9e6)]
+>> endobj
+18306 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a1c884f5152f75040139ec3d9ec8ac293) 7648 0 R (classParma__Polyhedra__Library_1_1Generator_a2673a95cb7d41f3c6078024874d1f8b1) 7847 0 R (classParma__Polyhedra__Library_1_1Generator_a2a7d3afc8dd852529b766ccf8e908948) 7749 0 R (classParma__Polyhedra__Library_1_1Generator_a2aba27eb7310045e1a35c7e68af01ab2) 7654 0 R (classParma__Polyhedra__Library_1_1Generator_a2c0762c7e8b14cb1d2032bf920b57732) 7647 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a1c884f5152f75040139ec3d9ec8ac293) (classParma__Polyhedra__Library_1_1Generator_a2ca4d826872609fb433f459d805f436a)]
+>> endobj
+18307 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a2ef38aca6ca4ade62193017e6e794c94) 7732 0 R (classParma__Polyhedra__Library_1_1Generator_a303b4ed4262469c1834228e0f88dba74) 7844 0 R (classParma__Polyhedra__Library_1_1Generator_a37b12f6fbf02f9a3a51dee028128d446) 7643 0 R (classParma__Polyhedra__Library_1_1Generator_a37eddcfd7d63573ae2bf02e2f5ed6d50) 7955 0 R (classParma__Polyhedra__Library_1_1Generator_a39da685d64f5bc693cfe8869ee4fe9bc) 7999 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a2ef38aca6ca4ade62193017e6e794c94) (classParma__Polyhedra__Library_1_1Generator_a3bc88b2886b0b86865186d142e5ee414)]
+>> endobj
+18308 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a3f29f8b40d09b17eaa4cbaac069f72a0) 7594 0 R (classParma__Polyhedra__Library_1_1Generator_a42867df59ec40173391b76074f9f0fb2) 7666 0 R (classParma__Polyhedra__Library_1_1Generator_a42b10b56cb7a582076a2d279ae07cf85) 7998 0 R (classParma__Polyhedra__Library_1_1Generator_a43a020d3bbe2b93b7ffa78a1c817b647) 7960 0 R (classParma__Polyhedra__Library_1_1Generator_a475ead5848d02d5c879bb96f22ce1cc5) 7953 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a3f29f8b40d09b17eaa4cbaac069f72a0) (classParma__Polyhedra__Library_1_1Generator_a4904a65badd41facf2b598f09eb726a5)]
+>> endobj
+18309 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a497cd4705484de0b938f6e03fd2ff460) 7662 0 R (classParma__Polyhedra__Library_1_1Generator_a4da7504ef9aeba8a782d47c83ce1abe7) 7667 0 R (classParma__Polyhedra__Library_1_1Generator_a4f591f8dde74ad99d0fb16a8c7e4a59c) 7853 0 R (classParma__Polyhedra__Library_1_1Generator_a4fb7d78e7b37d7f4b99babdc5cc84783) 7645 0 R (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5) 7588 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a497cd4705484de0b938f6e03fd2ff460) (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a05abaa6ff4aa204c25c94719e8a2b6f4)]
+>> endobj
+18310 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a4312979a12cae5ebb0791496e1ccce7a) 7589 0 R (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5ab7fe867b1243e111ef4364e3ef5b5329) 7591 0 R (classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5abed2d3fff60e7c0b8fc325bf46f9725f) 7592 0 R (classParma__Polyhedra__Library_1_1Generator_a59d0c508c656bdeee15a1a332a474b00) 7737 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a55b76ba0041601d8da38ab5ad619eed5a4312979a12cae5ebb0791496e1ccce7a) (classParma__Polyhedra__Library_1_1Generator_a5c96c17c3224a111a56381a75f564896)]
+>> endobj
+18311 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) 7843 0 R (classParma__Polyhedra__Library_1_1Generator_a600c942b0a2e94b550ccd84ef9c30928) 7742 0 R (classParma__Polyhedra__Library_1_1Generator_a66af65679979f949af0457fbcb07dcca) 7660 0 R (classParma__Polyhedra__Library_1_1Generator_a6804f93015ae6e1dc0c2e42e726380c4) 7743 0 R (classParma__Polyhedra__Library_1_1Generator_a6d57d53909ab5cabeb63d17394f9617d) 7735 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a5e24c88b976e1972777ddca6f259a30e) (classParma__Polyhedra__Library_1_1Generator_a75190def344d4c1ba6c59a6f0fcf7420)]
+>> endobj
+18312 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a76769b829453746113dd32f9fe880c9d) 7841 0 R (classParma__Polyhedra__Library_1_1Generator_a77fc44f44b1bdda486e19e30310634e2) 7656 0 R (classParma__Polyhedra__Library_1_1Generator_a787318df4682a2571d9cad8fc37c8fd6) 7965 0 R (classParma__Polyhedra__Library_1_1Generator_a78d14a45bade2c29f565fe13390ab13c) 7964 0 R (classParma__Polyhedra__Library_1_1Generator_a7c502c8d46ed2f68679404fdfdf8e0bf) 7650 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a76769b829453746113dd32f9fe880c9d) (classParma__Polyhedra__Library_1_1Generator_a855eb1638a9b23f78fac816e8c9f7a05)]
+>> endobj
+18313 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_a866f4ea2872ce75eecb0cddf8be815d7) 7584 0 R (classParma__Polyhedra__Library_1_1Generator_a8c20504e1b73166cb984911a273bd304) 7586 0 R (classParma__Polyhedra__Library_1_1Generator_a8d0452265a9138357bbccc5902f80d97) 7649 0 R (classParma__Polyhedra__Library_1_1Generator_a9518a0d513563a1a7c144f35d639695f) 7838 0 R (classParma__Polyhedra__Library_1_1Generator_a95bad70fc4276b46478ff7100cbce347) 7958 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a866f4ea2872ce75eecb0cddf8be815d7) (classParma__Polyhedra__Library_1_1Generator_a974166a1fe54f72e254c8f02687084e6)]
+>> endobj
+18314 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) 7954 0 R (classParma__Polyhedra__Library_1_1Generator_aa2fbe779d999b06aa1cb9df1425b4064) 7593 0 R (classParma__Polyhedra__Library_1_1Generator_aa40eabb29ea4abe082c3a2e6dc820276) 7729 0 R (classParma__Polyhedra__Library_1_1Generator_aab2bceb460b09e14922ef0ad8011e74b) 7840 0 R (classParma__Polyhedra__Library_1_1Generator_ab339ccb929a7255295ad19a5b168d5d0) 7644 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) (classParma__Polyhedra__Library_1_1Generator_ab5a5a3f29a348a7280c00b8742a8222e)]
+>> endobj
+18315 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) 7849 0 R (classParma__Polyhedra__Library_1_1Generator_abb59cb64a8f7864eac1bb8253d164db0) 7738 0 R (classParma__Polyhedra__Library_1_1Generator_abc8ae851f2a0a6260d954b3bd8505249) 7731 0 R (classParma__Polyhedra__Library_1_1Generator_abccc1b3be92c83b70dd47667198d62cf) 7646 0 R (classParma__Polyhedra__Library_1_1Generator_abed1f1d1ff610a4d56c514a7b75509ab) 7855 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_ab6e741ec611a4779e6b45c4acd821181) (classParma__Polyhedra__Library_1_1Generator_ac240ffbfd08a91635aada843229f6814)]
+>> endobj
+18316 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) 7845 0 R (classParma__Polyhedra__Library_1_1Generator_ac5a61f5b91d0db37a1a2fa6c843a26a8) 7852 0 R (classParma__Polyhedra__Library_1_1Generator_ad006db44540ea4786f611e882bfe8da5) 7956 0 R (classParma__Polyhedra__Library_1_1Generator_ad593d3aa49a632911d8d49c83b3f4985) 7739 0 R (classParma__Polyhedra__Library_1_1Generator_ad7552a414d66f92897d12767579fa3ca) 7850 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_ac39915aa29a5fcedd542ef9441a353a4) (classParma__Polyhedra__Library_1_1Generator_ad7576379843ab0fb9a33484bd4d68e71)]
+>> endobj
+18317 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_ad8cee05f88ad5aea288c1f6b8bf7cdc7) 7651 0 R (classParma__Polyhedra__Library_1_1Generator_ade2531310fd7806c9e4f745cab145926) 7730 0 R (classParma__Polyhedra__Library_1_1Generator_ade98f4e320d7d21e223afb83240b3800) 7655 0 R (classParma__Polyhedra__Library_1_1Generator_ae5902ab7e2d3304037a56ecda7fc22a4) 7652 0 R (classParma__Polyhedra__Library_1_1Generator_ae6e33f7246f4e3683fdab905d2e26819) 7663 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_ad8cee05f88ad5aea288c1f6b8bf7cdc7) (classParma__Polyhedra__Library_1_1Generator_aebb212a14f52ed934059925c1f5f2010)]
+>> endobj
+18318 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_aeff190ba56f86d3425859043689d499a) 7665 0 R (classParma__Polyhedra__Library_1_1Generator_af1827b1f7a42393a2526944530559c5a) 7653 0 R (classParma__Polyhedra__Library_1_1Generator_af1bf8c762c6f36b30f2abcaffe591acb) 7657 0 R (classParma__Polyhedra__Library_1_1Generator_af4f9b4584e455154e3f201876af1848f) 7962 0 R (classParma__Polyhedra__Library_1_1Generator_af64f0b6ef53df6ef8024b03b187d197c) 7661 0 R (classParma__Polyhedra__Library_1_1Gene [...]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_aeff190ba56f86d3425859043689d499a) (classParma__Polyhedra__Library_1_1Generator_af6f47b657c8fc219371405bf4728b244)]
+>> endobj
+18319 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Generator_afceefab91d648d188e42e5a75a3a977e) 7664 0 R (classParma__Polyhedra__Library_1_1Generator_afed6e254937adbecd53072747e51cb3f) 7848 0 R (classParma__Polyhedra__Library_1_1Grid) 794 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate) 1862 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_a3b727ab728f8758af9fb217eca9d791a) 9336 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f) 9334 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_afceefab91d648d188e42e5a75a3a977e) (classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f)]
+>> endobj
+18320 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) 9339 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_ac03d43b46ab7f9e5d0ea3c46a5eab7b3) 9332 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_acf34edb23c376600051bbc563e4122c4) 9333 0 R (classParma__Polyhedra__Library_1_1Grid__Certificate_adf9fc5ac7e45f36bc03af31b98b31a72) 9335 0 R (classParma__Polyhedra__Library_1_1Grid__Generator) 1863 0 R (classParma__Polyhedra__Library_1_1 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) (classParma__Polyhedra__Library_1_1Grid__Generator__System)]
+>> endobj
+18321 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) 1795 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a26673943182a6efc6cc6e3aad8c731a7) 6041 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a2be2c8b9d00f81fc24dcbc36ad05afea) 6007 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a41cb3496510a68512516cf65f8d214c2) 6002 0 R (classParma__Polyhedra__Librar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator) (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a61b27b2ed8bbc9a128f9001d160b078d)]
+>> endobj
+18322 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9571074ab0249afc1e440c8c5eb5d429) 6005 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9af54d524de94ada872d460c1dbd5cc0) 6003 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa6e183ba7e931dc88e16fb9ecfa8b3c7) 6008 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_aa82cf61e903a201fe8892501b209ab8e) 6004  [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_1_1const__iterator_a9571074ab0249afc1e440c8c5eb5d429) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a023dc725ab60578fb2161f06211fa023)]
+>> endobj
+18323 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a102ffa79248502b4998a70fba5f13d98) 9863 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f0983add75d3a9c3663fbf925739212) 9870 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a1f6d9240b4cf201eee98359c903c1918) 9856 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a3ddc697f9236b117382c35d7f7da5419) 9868 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4254da492e5e [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a102ffa79248502b4998a70fba5f13d98) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a465d046e2570dea82e57ab6af9b179e9)]
+>> endobj
+18324 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a494a5dcf815a292978b1864d2d7f77ae) 9865 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a4e6c82baa2eac91c07d9ae925b8d42b2) 9852 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a62e7b71f72659356d1d732236ed5f330) 9905 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a63fd965105d740ff7003037964ec7d10) 9874 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a6a5f64baba3a [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a494a5dcf815a292978b1864d2d7f77ae) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a773be362898fec2d48f0948c89870cf6)]
+>> endobj
+18325 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a7d4c3ba6b9e9b575d07b2e87b69a24e3) 9872 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8530a0719104225bd022dbe9529ae527) 9904 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a864a52992178820135a7ae3a75e65377) 9906 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8a0c95f43fd48c07a63db5efa3564769) 9801 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8cf170e729ac [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a7d4c3ba6b9e9b575d07b2e87b69a24e3) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8e247a33c9eb40439c706a98c5d363d0)]
+>> endobj
+18326 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a8f29bc3aa01b8f5c67a3323189f9cf9e) 9800 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a90e26e60ccfbe3c6ab8d91b5bf06dab5) 9907 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a998804f094e131a7f06d05c6e9eb5f5c) 9802 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_a9e847f0bfafeac6438cecb2d2114e665) 9858 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_aa09a1ddc7936 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a8f29bc3aa01b8f5c67a3323189f9cf9e) (classParma__Polyhedra__Library_1_1Grid__Generator__System_aafcd2b876b8ea8235219720a10cf6e8e)]
+>> endobj
+18327 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) 9796 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ab289fda31b27c62873b4542280a90719) 9797 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_abba3cc93433c6564ba34c1fdd360bde9) 9860 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac485f37c083be7bc0238a3f5c6c112e3) 9854 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac53b2bea17ae [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_ab014a801ad8cda797ce946b718ac7a72) (classParma__Polyhedra__Library_1_1Grid__Generator__System_ac5764ede75697ec70757c5e208945ca2)]
+>> endobj
+18328 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator__System_aca9c22c405ba1378296cc85f850aff21) 9798 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ace4c05e99016850c16c2bdaff5914afd) 9859 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_adfc60b971ed974350d241482f15f46ac) 9869 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_ae64d3d01d4baab5102f00046f941188f) 9912 0 R (classParma__Polyhedra__Library_1_1Grid__Generator__System_aefcc22cba81d [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_aca9c22c405ba1378296cc85f850aff21) (classParma__Polyhedra__Library_1_1Grid__Generator__System_af1afb697fed68cd53ff8d90b1d7cbc28)]
+>> endobj
+18329 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a00017ad58d66a7948b0355b3e02c750b) 9403 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a041afb1a2cc7277572fb7235cf08cf64) 9575 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a06120732f13ccb8a783990187512c123) 9492 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a081718c23b5785da17c63ffec13536cc) 9486 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a082a74ad0ce931ec2e517bf0f009daa2) 9588 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a00017ad58d66a7948b0355b3e02c750b) (classParma__Polyhedra__Library_1_1Grid__Generator_a091c62cb35ccf09353d79a532e6c1758)]
+>> endobj
+18330 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a0f19da4c46bb8b3be01875eff4c00538) 9489 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66) 9415 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a25b86c6f0633416506503de2bf693876) 9418 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a10e7c95784e356487a6a6263a89cec66a4ac3b90df83c2e43249ccfa2702640de) 9417 0 R (classParma__Polyhedra__Library_1_1Gri [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a0f19da4c46bb8b3be01875eff4c00538) (classParma__Polyhedra__Library_1_1Grid__Generator_a1177f236d8c66c01bbb43b37ff90bc7d)]
+>> endobj
+18331 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a13419c5d820bde20af5eabd23e479ec8) 9483 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a164c38a51c8718e6ac3a3f3e4af77bf0) 9487 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a1aabacaac0806d617f53db4b34b3349e) 9410 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a1f0828932daf26d10e94120c1f4a4d6b) 9499 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a271a32761c20049948570491e6b5b9dd) 9421 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a13419c5d820bde20af5eabd23e479ec8) (classParma__Polyhedra__Library_1_1Grid__Generator_a2a0bc130f7cf6a0678ee3b982fcc7ab6)]
+>> endobj
+18332 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) 9573 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a3024467f23276b9db83e3bbb6fc05b12) 9423 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a3075c67d9868fc0b483db13256fb4e0c) 9647 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a32364020a67e8172442cbd9d1077cf44) 9500 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a39f2fef2ef250b8dafb8be3c37d020ac) 9503 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) (classParma__Polyhedra__Library_1_1Grid__Generator_a41227446c918730e97998799bfe04da6)]
+>> endobj
+18333 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) 9406 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a4be36a9309c5ecfa863e326c44296391) 9584 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a4cf4938d837fcf701695a0828bf56cef) 9409 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a538c16dacec86f66e9520c728a7c5f35) 9590 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a58b86510b9c4dc05004c0fc01622430b) 9490 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a44d16f88718ec30357b12b5185b033e0) (classParma__Polyhedra__Library_1_1Grid__Generator_a5f47fcccf4795964925294d448335f0a)]
+>> endobj
+18334 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a60d9658ef91fbd3a1b0064253246f36b) 9407 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a622b8ffad2bd654696c12d7d07ba51c6) 9585 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a64600674ceb04a95caa3db13515aa9ff) 9491 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a657341bcebb7b81abd715a80d4aefc0f) 9419 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a6fb154017052c68b63121cef49c568ce) 9649 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a60d9658ef91fbd3a1b0064253246f36b) (classParma__Polyhedra__Library_1_1Grid__Generator_a76fce1702224700691a26cf5e780a1dd)]
+>> endobj
+18335 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) 9488 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a7718a50034230b311e3f3cc35d7709e9) 9402 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a77a904793c99cfb1d61fadd277d59471) 9485 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a77fd92da113b8b277b8626ce74bde0ad) 9494 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a80ef003442edc6db8e77caa4de7f7ef1) 9582 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a77123fc17c8bc6d59a76802c0592a2c6) (classParma__Polyhedra__Library_1_1Grid__Generator_a811f6f947785240bcb76bfca023fed17)]
+>> endobj
+18336 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_a82f262d4a5b57ea92ef25f5f49006ffe) 9650 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a8950f38d19f1b721d66b756b0ae10cb3) 9571 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a8ab7b9abebd48fe0ad129a237338aa96) 9648 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a8ec4a26e544123076ee254d238a06d21) 9587 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_a9188a38b44fd9b356f73459148e5f57e) 9651 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a82f262d4a5b57ea92ef25f5f49006ffe) (classParma__Polyhedra__Library_1_1Grid__Generator_a9a297ff1741690be337828dbbc0da636)]
+>> endobj
+18337 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_aaaba43818b9aa3f407359d15a971984e) 9398 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ab1db3272b7beca7b1d9d17f23d22ecbd) 9420 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_aba6b40a4b9708e94d6cd10f54144ed70) 9498 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_abaa6c80abf60b23dd19db6cc042719b0) 9405 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ac1e87cdf51be31f4c9c43c4c86bccb66) 9652 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_aaaba43818b9aa3f407359d15a971984e) (classParma__Polyhedra__Library_1_1Grid__Generator_ac3e03bc2df621903d136c689c38bdb6f)]
+>> endobj
+18338 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_ac74dafaa0b06e9cd3d15ea0d2af1b213) 9574 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ac915c8d26a7dbcdbbd0c4985ec5b7d4b) 9481 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_aca47a151389a78c2474186b9628ab5cc) 9646 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_acb1fb1a16ca8e051a815ae73b178dd62) 9414 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_acdc0aeddab3d98e336719f42e6e5b06c) 9497 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ac74dafaa0b06e9cd3d15ea0d2af1b213) (classParma__Polyhedra__Library_1_1Grid__Generator_ad32b963be25112be3f4856164c255730)]
+>> endobj
+18339 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_ad350a787056fefe667783a60a9f2923e) 9501 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ad582c312a54b52e80b7fa8b836de9450) 9572 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_add0d04eab672e924694d77cc48921add) 9401 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_ae94a99f8e8d290b5791baa01fd540a14) 9576 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_aeabcfd0fb026563fd3464f04d32c8e60) 9424 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ad350a787056fefe667783a60a9f2923e) (classParma__Polyhedra__Library_1_1Grid__Generator_aeca84d3bda389453f22a494ab9923088)]
+>> endobj
+18340 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) 9589 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_af00dd6aeffc847b73a3aee11d6d169b6) 9577 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_af3146d81190eacbe889e3d0949907271) 9502 0 R (classParma__Polyhedra__Library_1_1Grid__Generator_af4e7705af87f5eb64d2ebdc60cd7a36e) 9496 0 R (classParma__Polyhedra__Library_1_1Grid_a0047a6aa4f26d9133b9d741f68384f38) 8615 0 R (classParma__Polyhed [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_aeed6163372d663031201f5b4c77b9d5c) (classParma__Polyhedra__Library_1_1Grid_a0262a2b32220536d8bc60d84ad8dac4c)]
+>> endobj
+18341 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a042613c3f4ad30b298d70143c935d7cd) 8623 0 R (classParma__Polyhedra__Library_1_1Grid_a0441c9c3b0ab0d55165bb6b4fd107f64) 8797 0 R (classParma__Polyhedra__Library_1_1Grid_a06894477c4e748b61eb0779ea8c0600f) 8872 0 R (classParma__Polyhedra__Library_1_1Grid_a071aa57e439ba4f358c7fd43b03a6a49) 8715 0 R (classParma__Polyhedra__Library_1_1Grid_a07bdac3717a59f64634da7d9b1cfaefd) 8855 0 R (classParma__Polyhedra__Library_1_1Grid_a092f5c04d267ab5709dda2d [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a042613c3f4ad30b298d70143c935d7cd) (classParma__Polyhedra__Library_1_1Grid_a092f5c04d267ab5709dda2d3e51aaeb9)]
+>> endobj
+18342 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a0c02302b6281fa91ef9275bd37e43efc) 8546 0 R (classParma__Polyhedra__Library_1_1Grid_a0d00cf0ecbb8edf21a37cc06f05ece26) 8800 0 R (classParma__Polyhedra__Library_1_1Grid_a0d8ed7a0e48fe76e7221842c780192b0) 8625 0 R (classParma__Polyhedra__Library_1_1Grid_a10e3116398b920cb137cf576a073cc68) 8867 0 R (classParma__Polyhedra__Library_1_1Grid_a1287b254a91451368e7e2e456f448114) 8631 0 R (classParma__Polyhedra__Library_1_1Grid_a145cc7c23d407576222e5af [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a0c02302b6281fa91ef9275bd37e43efc) (classParma__Polyhedra__Library_1_1Grid_a145cc7c23d407576222e5af347f401c1)]
+>> endobj
+18343 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a19422844125a988daaf489cbaff3835b) 8707 0 R (classParma__Polyhedra__Library_1_1Grid_a1a26d0018999e56d94a7e96db2b6e553) 8860 0 R (classParma__Polyhedra__Library_1_1Grid_a1a5606b64a035977b9d76b1932227246) 8614 0 R (classParma__Polyhedra__Library_1_1Grid_a1b528a2e8d4d096f62535454e05b74ba) 8869 0 R (classParma__Polyhedra__Library_1_1Grid_a1ba97c180500b43954b09532151f6c9d) 8534 0 R (classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a19422844125a988daaf489cbaff3835b) (classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25055e33235)]
+>> endobj
+18344 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) 8858 0 R (classParma__Polyhedra__Library_1_1Grid_a214e376adb9dc271c61b58f8b2c927f0) 8708 0 R (classParma__Polyhedra__Library_1_1Grid_a2528b5f433e743dda827b1028b6c74cd) 8619 0 R (classParma__Polyhedra__Library_1_1Grid_a2581586de73769088ece60dc01409a08) 8792 0 R (classParma__Polyhedra__Library_1_1Grid_a2d4a31320735e93af31c8d2cc7e78329) 8801 0 R (classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) (classParma__Polyhedra__Library_1_1Grid_a2f31170286d3abc2f4867d0b193ae8bc)]
+>> endobj
+18345 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a31603d81a2b0571a82c4c79b8c6e4564) 8466 0 R (classParma__Polyhedra__Library_1_1Grid_a323efbe5d43695cc65f8cd5935da94dc) 8807 0 R (classParma__Polyhedra__Library_1_1Grid_a3628b6d6e250d4c6b8301173c6ecc777) 8866 0 R (classParma__Polyhedra__Library_1_1Grid_a36cc3783cdc92ab5fc69904c298ed12c) 8553 0 R (classParma__Polyhedra__Library_1_1Grid_a3ac47497148e61f3d7a3da09d17a03bf) 8620 0 R (classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b8 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a31603d81a2b0571a82c4c79b8c6e4564) (classParma__Polyhedra__Library_1_1Grid_a3cd0fe4ed600eb3430539b864ad4142b)]
+>> endobj
+18346 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a453e51570268eb4d63fc529130a54440) 8540 0 R (classParma__Polyhedra__Library_1_1Grid_a508103dc808fc747a90b573083a60461) 8857 0 R (classParma__Polyhedra__Library_1_1Grid_a527ffa31e1581a8beb83a832244dada8) 8547 0 R (classParma__Polyhedra__Library_1_1Grid_a53b24395ac61f8b2b2accc5a3900bf69) 8537 0 R (classParma__Polyhedra__Library_1_1Grid_a53f980fb1ac8fa21265bec985bd1382f) 8626 0 R (classParma__Polyhedra__Library_1_1Grid_a59634a195948ff0617177d0 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a453e51570268eb4d63fc529130a54440) (classParma__Polyhedra__Library_1_1Grid_a59634a195948ff0617177d0a41e30602)]
+>> endobj
+18347 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a596fc5b3ee0d04895aca9139cb6cbcb6) 8805 0 R (classParma__Polyhedra__Library_1_1Grid_a5cdf44f392505e1371a85b1245775224) 8870 0 R (classParma__Polyhedra__Library_1_1Grid_a5f6fcc1dab2b08eff20b41d1412d1e2d) 8875 0 R (classParma__Polyhedra__Library_1_1Grid_a621d377682c2c67051c24b1cc8a03497) 8618 0 R (classParma__Polyhedra__Library_1_1Grid_a659cb16eede4860a0c3597638ca77830) 8551 0 R (classParma__Polyhedra__Library_1_1Grid_a65f00faeb048901323ffd31 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a596fc5b3ee0d04895aca9139cb6cbcb6) (classParma__Polyhedra__Library_1_1Grid_a65f00faeb048901323ffd316d30d61a4)]
+>> endobj
+18348 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a68665d093308c111817eca341b98d70a) 8713 0 R (classParma__Polyhedra__Library_1_1Grid_a688572fbdc35859515f5ea8ba583a45a) 8874 0 R (classParma__Polyhedra__Library_1_1Grid_a69a6e807d63018625b02e06c07a578db) 8548 0 R (classParma__Polyhedra__Library_1_1Grid_a6ae1850664122e9917f174d10fd3bf06) 8542 0 R (classParma__Polyhedra__Library_1_1Grid_a6f703ba611b9e5ff613f4df35347ee95) 8545 0 R (classParma__Polyhedra__Library_1_1Grid_a727dc2405cfc5f2252e6f21 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a68665d093308c111817eca341b98d70a) (classParma__Polyhedra__Library_1_1Grid_a727dc2405cfc5f2252e6f21aa0f18074)]
+>> endobj
+18349 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a7fc86a6331f34f34a506ab2b0609ac37) 8865 0 R (classParma__Polyhedra__Library_1_1Grid_a7ff92e5d40e6faf667a0b1f6b8fad791) 8871 0 R (classParma__Polyhedra__Library_1_1Grid_a803035024ab9670971868f4b1092f7c5) 8544 0 R (classParma__Polyhedra__Library_1_1Grid_a82b76e3f18679ea161b53bfa80349009) 8705 0 R (classParma__Polyhedra__Library_1_1Grid_a85b2560352485ac05d10aab0ee483252) 8699 0 R (classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a7fc86a6331f34f34a506ab2b0609ac37) (classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816d72524790)]
+>> endobj
+18350 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a87d004db7f8febf6f9c96b4a2a1c85e5) 8903 0 R (classParma__Polyhedra__Library_1_1Grid_a880344de195aef75a6b3f2a4db4787b4) 8538 0 R (classParma__Polyhedra__Library_1_1Grid_a8865893c48cc07adae5dca6b35081751) 8541 0 R (classParma__Polyhedra__Library_1_1Grid_a8d060ee1328743ae25698bc5835a5703) 8552 0 R (classParma__Polyhedra__Library_1_1Grid_a8d2cc5d18d050975101f2860f2919da8) 8629 0 R (classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a87d004db7f8febf6f9c96b4a2a1c85e5) (classParma__Polyhedra__Library_1_1Grid_a8edc85ba3e8a09593959814eaad72499)]
+>> endobj
+18351 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a8f97dbc7a7c307fa72f7e904b2cbf21b) 8706 0 R (classParma__Polyhedra__Library_1_1Grid_a8fa02815bb561135934f91c9adcd0cb5) 8624 0 R (classParma__Polyhedra__Library_1_1Grid_a90ca2b1613fda31a2ac7e79d9388680d) 8536 0 R (classParma__Polyhedra__Library_1_1Grid_a90e87cbe8ae0717fa09ff51b70d64b47) 8717 0 R (classParma__Polyhedra__Library_1_1Grid_a943c42b0d1b3580e54b3ab60aa55255f) 8701 0 R (classParma__Polyhedra__Library_1_1Grid_a953a608f6f9d413870fb3ee [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a8f97dbc7a7c307fa72f7e904b2cbf21b) (classParma__Polyhedra__Library_1_1Grid_a953a608f6f9d413870fb3eee5cc6ad1e)]
+>> endobj
+18352 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_a9831db06919c6ee05360b08e84cccbb7) 8712 0 R (classParma__Polyhedra__Library_1_1Grid_a9bdab8408169307fbd899ec3670cb2bf) 8808 0 R (classParma__Polyhedra__Library_1_1Grid_a9e17201a9a12235a9a96cc31cfffd38f) 8904 0 R (classParma__Polyhedra__Library_1_1Grid_a9e4e32230b187284ac0b9ca8efba8f82) 8798 0 R (classParma__Polyhedra__Library_1_1Grid_a9e87405c740d202951ba788f9e52cbf7) 8700 0 R (classParma__Polyhedra__Library_1_1Grid_aa033cfca735240b3699b523 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a9831db06919c6ee05360b08e84cccbb7) (classParma__Polyhedra__Library_1_1Grid_aa033cfca735240b3699b523d60ad692a)]
+>> endobj
+18353 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_aa26f672c32271db69ed68fc60eee8cff) 8698 0 R (classParma__Polyhedra__Library_1_1Grid_aa28d735beef86789b73b41dbbde71abf) 8554 0 R (classParma__Polyhedra__Library_1_1Grid_aa76828d01f5c454221427eef68227f78) 8802 0 R (classParma__Polyhedra__Library_1_1Grid_aa9c12ecd84df4ed86b5676a09fa39208) 8795 0 R (classParma__Polyhedra__Library_1_1Grid_ab602d97b867b5d2ea800ea7ceef4c6b5) 8794 0 R (classParma__Polyhedra__Library_1_1Grid_ab6bba83ceaafdb71df04b77 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_aa26f672c32271db69ed68fc60eee8cff) (classParma__Polyhedra__Library_1_1Grid_ab6bba83ceaafdb71df04b77e43bed022)]
+>> endobj
+18354 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_abb10ea556dd34e0c1e13f7e99b9efe70) 8716 0 R (classParma__Polyhedra__Library_1_1Grid_abd8e73adc9b36c272118525242f9b50a) 8856 0 R (classParma__Polyhedra__Library_1_1Grid_ac009459805692e582a00d4b5954ab8e5) 8799 0 R (classParma__Polyhedra__Library_1_1Grid_ac418d88df400bcd2233fb6281debb08f) 8710 0 R (classParma__Polyhedra__Library_1_1Grid_ac4e1b49845e553ff84dc73e710def76c) 8868 0 R (classParma__Polyhedra__Library_1_1Grid_ac9d9eaf8b76024bc20ce524 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_abb10ea556dd34e0c1e13f7e99b9efe70) (classParma__Polyhedra__Library_1_1Grid_ac9d9eaf8b76024bc20ce524e13bf86a6)]
+>> endobj
+18355 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_ace98c3e57a1237e6dd5042b5a0919193) 8611 0 R (classParma__Polyhedra__Library_1_1Grid_ad09e4e3f9a9da562c6cdb73dd7b47fbe) 8697 0 R (classParma__Polyhedra__Library_1_1Grid_ad14942b33fb82bb3e6a13e5e92ada475) 8543 0 R (classParma__Polyhedra__Library_1_1Grid_ad42265530a9e3b2f3bda9ab40d4a835b) 8718 0 R (classParma__Polyhedra__Library_1_1Grid_ad743f8b71eb68f6b41f7ea7b5d21dc22) 8628 0 R (classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_ace98c3e57a1237e6dd5042b5a0919193) (classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6)]
+>> endobj
+18356 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) 8550 0 R (classParma__Polyhedra__Library_1_1Grid_ae47fdbff76383891b3896ac5fc213d5d) 8806 0 R (classParma__Polyhedra__Library_1_1Grid_ae5955a311fc4fde1edf2d5460f0a8356) 8714 0 R (classParma__Polyhedra__Library_1_1Grid_ae5dc5003b3652660bc4ff4a15e4060af) 8709 0 R (classParma__Polyhedra__Library_1_1Grid_ae8d42fcd571a9c9d64f0e7ffe67e995e) 8804 0 R (classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549b [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) (classParma__Polyhedra__Library_1_1Grid_aeb9b562373b4d288c03549bdba93fede)]
+>> endobj
+18357 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_aee33974909cfc1cba605734a57d44df0) 8859 0 R (classParma__Polyhedra__Library_1_1Grid_af1ab967a6606266f7e583fc9752667fe) 8704 0 R (classParma__Polyhedra__Library_1_1Grid_af39e1b0519a47aafb9dba4121dc41a9c) 8861 0 R (classParma__Polyhedra__Library_1_1Grid_af6df34e5e4ab9beab41cd76897d64c72) 8873 0 R (classParma__Polyhedra__Library_1_1Grid_afae3a58c19c9a3b9916f29b7aca4d0e0) 8627 0 R (classParma__Polyhedra__Library_1_1Grid_afb9d83c4e182f640833116d [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_aee33974909cfc1cba605734a57d44df0) (classParma__Polyhedra__Library_1_1Grid_afb9d83c4e182f640833116dc2f725076)]
+>> endobj
+18358 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Grid_afc06f600e94b7bedb91d0371a51f4c38) 8535 0 R (classParma__Polyhedra__Library_1_1Grid_afde364ce088f82cf2b9a231e7d9f2abc) 8622 0 R (classParma__Polyhedra__Library_1_1Grid_afe613a3da3edc3cb4506f70d409f061d) 8864 0 R (classParma__Polyhedra__Library_1_1H79__Certificate) 1211 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a061c4c3b4f1eef970794b274dae62504) 9963 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a1e1a505b4cd4a4ac97d3a [...]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_afc06f600e94b7bedb91d0371a51f4c38) (classParma__Polyhedra__Library_1_1H79__Certificate_a1e1a505b4cd4a4ac97d3a38864bd3977)]
+>> endobj
+18359 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1H79__Certificate_a517f4965fd423413531cd1d2058748de) 9967 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a553c3b19a36235d228039a6bb3452918) 9969 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a5cca0390f76c0a92703e65d3707f157a) 9964 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_a7e6d252ce9557b9d73833ef594f6276b) 9972 0 R (classParma__Polyhedra__Library_1_1H79__Certificate_aab939414cdbcf1ba174334859443a72c) 9966 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1H79__Certificate_a517f4965fd423413531cd1d2058748de) (classParma__Polyhedra__Library_1_1H79__Certificate_ab8bee5e53740adc193668686030bb4bb)]
+>> endobj
+18360 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) 1807 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a07ed557a736512bd1fc7ea8b1e1c3ef7) 7303 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a219cd8d22c6a8d3dc648e5464bdefdbe) 7306 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a3dceb0032276944ce7f7ac5822eca166) 7305 0 R (classParma__Polyhedra__Library_1_1Imp [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object) (classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_a86de0322fd10ae0c9061a9a84b64ae4d)]
+>> endobj
+18361 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_ae364e96f44ce12c3011243a21955a792) 7304 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList) 1808 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator) 1854 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a0b8c563512e846bce0d716066f049fcd) 7421 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a1fa6cf4049dfd8fbc21202b6cfef9d64) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Doubly__Linked__Object_ae364e96f44ce12c3011243a21955a792) (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a253054117c47dec9e844a92455b63b23)]
+>> endobj
+18362 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a2a78b4dccc5cb62f5dc676955349fe22) 7404 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a6804b8c7fe2610cb292dcf81eb7504b6) 7400 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a74e639a1c2aa8f473ac344c64fe52d70) 7406 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a8ce6913cba94e871f6014f123ede511a) 7418 0 R (classParma__Polyhedra__Library_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a2a78b4dccc5cb62f5dc676955349fe22) (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_aa143851bb6cac69786ce70609932cc55)]
+>> endobj
+18363 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_aa3a4f75d78e0b38122121796fc6391bd) 7401 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_ae1fda4cb1a649224fbda7c57cde73039) 7419 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a0b29950a1eb609da39a45cc7bf202c1a) 7353 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a14c6c5fcc8fc260d07ebaf21e0e4b4e7) 7346 0 R (classParma__Polyhedra__Library_1_1Implementation_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_aa3a4f75d78e0b38122121796fc6391bd) (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a2bd415f397cb476b557cb3d5e3ba0b1f)]
+>> endobj
+18364 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1EList_a38ad9466c728fff8d6447b0a4737b11a) 7348 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a51cb421fbcb83cc818a44ac33ee2a599) 7392 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a5a20a3e74db0ae30d0a97eb97b5711e0) 7363 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a6e212b144c2c2b4aaf6c7e52cdec0d69) 7352 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a93d9c4f14856 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1EList_a38ad9466c728fff8d6447b0a4737b11a) (classParma__Polyhedra__Library_1_1Implementation_1_1EList_a9e101065f67b05a59a2d22de338b5016)]
+>> endobj
+18365 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1EList_ab8cc645c9acb57cc0b36a162f8a0df5a) 7351 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ac0fb25117711f33a24d966834f08d653) 7345 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_aca1baadce7ec948bc61c893ccba84cc4) 7350 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1EList_ad2346bbed9370544b17d1ceb23a7bd71) 7394 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1EList_ab8cc645c9acb57cc0b36a162f8a0df5a) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag)]
+>> endobj
+18366 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_a091459894ae74d82670a777e88a75f3f) 10008 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_ae0a0ac883cf939f343665ecf0c069379) 10009 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function) 1867 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Function_a085281189e709a4b28e5858a758bb5bf) 10032 0 R (classParma__Po [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler__Flag_a091459894ae74d82670a777e88a75f3f) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_a3690915d5c30a08607ade652aa157cd3)]
+>> endobj
+18367 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_add9a15bae9fb3c788a0ae526ef65733d) 9986 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element) 1918 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a13dbdd3f93f360c7f782849c479196de) 13022 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_a67922c0641253df46bb34952904c08fd) 13019 0 R (classParma__Polyhedr [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Handler_add9a15bae9fb3c788a0ae526ef65733d) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ae93b5801e403e1dc169b6891774756cd)]
+>> endobj
+18368 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_aecd9a36bb78f2cd4987654e4164469ed) 13024 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_af6d5c806d659ad7d4dfacc99d4795297) 13020 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List) 1919 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a0ae3b5779ea65e64f5bcc20db688c7b2) 13072 0 R (classParma__Poly [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_aecd9a36bb78f2cd4987654e4164469ed) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a3e9f7bde672c12c6ae7e756b95322ead)]
+>> endobj
+18369 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a5a818a5f473f962780c537455841b47b) 13074 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7836c5ddf1d77728796eb9a89575c6cb) 13073 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a7f751c08cc4c3bef195bf163632412c5) 13075 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ab8bd17717d507e18820a9551ab84a604 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_a5a818a5f473f962780c537455841b47b) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_ad044318e9f55db6c5bbfc96557b15407)]
+>> endobj
+18370 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_add323d329ab401717a910d387cdfaeda) 13069 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time) 1977 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a1d613c80931007bd46f479582f90542e) 15802 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a249e8899494cc9ee79d69b7b5eef475e) 15801 0 R (classParma__Polyhedra__Library_1_1Implementation_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__List_add323d329ab401717a910d387cdfaeda) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6018819ab591dad51060b4d01d989374)]
+>> endobj
+18371 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6137f32f30cd8f8c6081c20a5a6bb200) 15799 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a67d50389960334cc0cddaf9e18cae713) 15798 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a833c9f70c384faeb871fa267cca49df6) 15800 0 R (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a993b094f35284bdf86bfc6a06ea69649) 15804 0 R (classParma__Polyhedra__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Time_a6137f32f30cd8f8c6081c20a5a6bb200) (classParma__Polyhedra__Library_1_1Integer__Constant__Common)]
+>> endobj
+18372 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Interval) 795 0 R (classParma__Polyhedra__Library_1_1Interval_a105b70ec7bd017d77ee138da113ad600) 10087 0 R (classParma__Polyhedra__Library_1_1Interval_a33841a1e5c7d5c28fc531d788731bd39) 10065 0 R (classParma__Polyhedra__Library_1_1Interval_a33aee6054a84f5843978f68ef4670e55) 10089 0 R (classParma__Polyhedra__Library_1_1Interval_a42eb3d8a75f35d8f1a7d23c0724bd33b) 10088 0 R (classParma__Polyhedra__Library_1_1Interval_a51b99f0a7f6ed7aa96577e464bdc57 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Interval) (classParma__Polyhedra__Library_1_1Interval_a51b99f0a7f6ed7aa96577e464bdc574c)]
+>> endobj
+18373 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Interval_a59a61c7f332d1239fb6f71834703a0e3) 10061 0 R (classParma__Polyhedra__Library_1_1Interval_a61e437035d45d0ae897b6465d1c0d0f4) 10083 0 R (classParma__Polyhedra__Library_1_1Interval_a66faf0e36578340ea5b3f18a5bbcf426) 10091 0 R (classParma__Polyhedra__Library_1_1Interval_aa3d3212cc1d821d780513a6b6c369256) 10082 0 R (classParma__Polyhedra__Library_1_1Interval_abc7a7c19a6d457b4a37e05878086a430) 10064 0 R (classParma__Polyhedra__Library_1_1Inte [...]
+/Limits [(classParma__Polyhedra__Library_1_1Interval_a59a61c7f332d1239fb6f71834703a0e3) (classParma__Polyhedra__Library_1_1Interval_abed7286726807179efc1001a249f0eec)]
+>> endobj
+18374 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Interval_ac02677c5008f5842ba8100572684e8f4) 10063 0 R (classParma__Polyhedra__Library_1_1Interval_ad7a9b929f459945a7578b161edcf5d4b) 10084 0 R (classParma__Polyhedra__Library_1_1Interval_afb730d60db4b7e1ddd4c9994ec077cf6) 10062 0 R (classParma__Polyhedra__Library_1_1Linear__Expression) 1914 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator) 1798 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterat [...]
+/Limits [(classParma__Polyhedra__Library_1_1Interval_ac02677c5008f5842ba8100572684e8f4) (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a030483dd2c1346262825de9b2a7f985f)]
+>> endobj
+18375 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a47dc6fa13c0ff235b9ad27ae26973bc7) 6173 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a50973a7d753dc94afb42a610aa71d68d) 6204 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a5d627d5308cf0cc64f5017c13d956532) 6171 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a81fad4c0c11e6214ddf1851573e56b5f) 6193 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_a47dc6fa13c0ff235b9ad27ae26973bc7) (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac54489beb3010518b290d6afa08902b5)]
+>> endobj
+18376 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8179a7265eb8cfa0fbb55b7f46c18b0) 6170 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8d7d3ac7c1bf2bab50a5594a41a2f25) 6203 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ae4fc34e44b3473124567a5ee4b03fe57) 6172 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_aeafa7f136ae6eb82b0b996a2df4c6606) 6205 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_1_1const__iterator_ac8179a7265eb8cfa0fbb55b7f46c18b0) (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a21c60e2a5b7d04de458f4d6ff0c3bd9b)]
+>> endobj
+18377 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a2eb19a01c9b844f52f86464fc8f0ddd3) 6143 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a5bfc7fe8384a4382f89fdb9dc06d7f77) 6140 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a6fa16eb9302f619ceb4bafaa952394ac) 6141 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_ad7326cf3c2ddd70745aa4a527ece65be) 6 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression__Impl_1_1const__iterator_a2eb19a01c9b844f52f86464fc8f0ddd3) (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface)]
+>> endobj
+18378 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a0c5be0f5a6fef022b59c78a41f1fa0a1) 6287 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a4fd7b6cb64e68a51df8a7f8435e09805) 6282 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a50728db7969b64c9c4fe14e1da04f006) 6279 0 R (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_a0c5be0f5a6fef022b59c78a41f1fa0a1) (classParma__Polyhedra__Library_1_1Linear__Expression__Interface_1_1const__iterator__interface_afd298b0bb1553ae69fdf50038423813d)]
+>> endobj
+18379 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) 10451 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a033a152c478db97a4e08bc562dbff4b1) 10285 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a0540634ba6d2d2175bf25e92a0831af1) 10588 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a0912217f15a36eb486b243ee592f3379) 10349 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a0dddfc1f0ff6f55a90c4ea8829b9752b) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a0308fb71a28c28f4e33aabfa9c5d3781) (classParma__Polyhedra__Library_1_1Linear__Expression_a0ed481e43baf024d4a5b5e86e85c4a87)]
+>> endobj
+18380 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a114f91c420cc8060d6834730c8e55721) 10455 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a15c22785d951d9f8f6ec2e14f07b2dc1) 10644 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a2666c570468f53609bf420024a12628d) 10572 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a297e7ae510626af6f52a9aeca8154f53) 10282 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a298a32e26d8133869f28560cca4ba73b) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a114f91c420cc8060d6834730c8e55721) (classParma__Polyhedra__Library_1_1Linear__Expression_a29d81c4c365b593f707cbfd0f960631f)]
+>> endobj
+18381 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) 10454 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3024f7593cf48937f80197fb8030c290) 10586 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3221626e22e187252b866eb371001183) 10590 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a32a44c95ae4348ff889b48c309f9eab3) 10460 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3393f0e95870b681e528c15803a26f60) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a2e4d2efe88475a75dab18c7f9fe5e217) (classParma__Polyhedra__Library_1_1Linear__Expression_a34bbf3ed8e75730f44ca8a461881adb6)]
+>> endobj
+18382 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) 10269 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a37de3f55cf5e917e32f7f2f9c6d34840) 10585 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a37e6e92bcce55054b61338c740ecabe6) 10354 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a385e4d3cfe442f4fcbeefd9acf5c10eb) 10573 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a3878ace0dfcc23f80d55d206d2117c84) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a372cb81e5fdd27bd56a3fa2eb7aa8ac2) (classParma__Polyhedra__Library_1_1Linear__Expression_a392d8d530782ff1240e73a9fb15f7975)]
+>> endobj
+18383 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a3a808cf2742df02d856a8d9882845861) 10346 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a41cdb256f546f09bd317deef44ac0009) 10458 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a447ce24e7e4fdf595ebaa4cf5d1c38b8) 10589 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a48ac89bc22c6c6013dcea1bff3522fdc) 10442 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a49574f120ec3f9fbfda58d6f826587e9) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a3a808cf2742df02d856a8d9882845861) (classParma__Polyhedra__Library_1_1Linear__Expression_a4d372c4dff7d328d3da118817ed3d8b7)]
+>> endobj
+18384 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a51f1b18014b098a53242c06d657040c6) 10356 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a5812366691d9099f839e01326923425f) 10277 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a58ce6d6e87e4bf19e99478994bbb6010) 10648 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a5bb7f6903958069b19f70d1391987a51) 10347 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a5c4134b034447fcf2b7b154102233dcf) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a51f1b18014b098a53242c06d657040c6) (classParma__Polyhedra__Library_1_1Linear__Expression_a61a01c066394a2b9ee5d797f6733c5e4)]
+>> endobj
+18385 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) 10446 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a65766b549090f6b52281c99cfba9eed3) 10577 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a691b91bcd9b5c336892574e975235de5) 10576 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a695843d7e86aecb1d5e9632aae3eec88) 10579 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a6e35bc42eb22008e842e81b150eeab6f) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a62b7a88cefba86a6731c6b46487fc28a) (classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b)]
+>> endobj
+18386 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) 5644 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a701574facbfd5461d399dccbc88a2999) 10280 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a703e355f3726c0cace243d4fe4b74125) 10646 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a72b6b45299672d85c7984392454296d6) 10453 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a74deedff2114e5a1c72305ba6c6e42ed)  [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) (classParma__Polyhedra__Library_1_1Linear__Expression_a7776ccee499dd435c4b95d8627849eda)]
+>> endobj
+18387 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) 10580 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a80d43634ca26fd76dcb1fdede6363dc5) 10575 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a8a1eeaa7f9845c9d33a22c8c5f5acab2) 10363 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a8ae08699620424e3c3c97dd7a3885d02) 10275 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a8d443d5098921978efd7b625000f3b68) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a77edd516d26f3ad1466ddf2fe2a4baaa) (classParma__Polyhedra__Library_1_1Linear__Expression_a9075dd07574234cc124e6076c272e987)]
+>> endobj
+18388 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) 10452 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a97f2c2912a13988f28555bee4fe96ef4) 10584 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a98b5ccd1157e6ec8beec7702af9acb36) 10574 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_a9dd6ce1cb02b58fd3b973e40867362ac) 10448 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aa66d8fe880ea6f99aa1a70805427d9d6) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a920af28903c20a4a4962761b834d577f) (classParma__Polyhedra__Library_1_1Linear__Expression_aa74c2bb5c2c947d02fabe33f854fa7d6)]
+>> endobj
+18389 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_aa8f43e35dec15be4374b207a9440eb2c) 10340 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aadaa110a051cded2af6bb04516e8b72e) 10352 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab1a39b5a84040af5feee0336b275fa95) 10645 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab33dcdd2d3caf28d71cf7d3f2270535d) 10270 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ab4396e8bfbdd5831fd37d13c19194cc4) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_aa8f43e35dec15be4374b207a9440eb2c) (classParma__Polyhedra__Library_1_1Linear__Expression_ab48b93c69098ab1dccd8d063f9c41575)]
+>> endobj
+18390 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_ab60766264325cf8fc82be004b2565ddb) 10283 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_abaf335015f8c71026d2bee65ce4d109f) 10443 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_abca5613972564c8ec5c832bc8ff200d6) 10345 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ac1b93dcadc82e52690114301554801b0) 10278 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ac220e6f2cf884a8b2bb4017fc9ae53da) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ab60766264325cf8fc82be004b2565ddb) (classParma__Polyhedra__Library_1_1Linear__Expression_ac455ad97639d9e7f59dbdc22e35dc1e7)]
+>> endobj
+18391 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_ac9ef23a57b1e85eb8c0e905b16feda93) 10357 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aca00917f32f160b28b9870beb5ce5f8d) 10284 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ad44ed4e61b7e7c0c86918b66f44ec665) 10279 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ad5080c3ee416a445b60ac48971d9b808) 10582 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_adfed1afbbfc5b41dac982e9e1f43883e) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ac9ef23a57b1e85eb8c0e905b16feda93) (classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae)]
+>> endobj
+18392 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) 10350 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae25d01221fd2014bead64c551c33c9c5) 10344 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae9cc837bbae1745ada3780634c73858f) 10274 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_ae9de3534d98524f48d9f6c0cdfbf239c) 10359 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_aea20a64dc7e9dd789fb069c7b8faca16) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) (classParma__Polyhedra__Library_1_1Linear__Expression_aea8819f3edb590eff758fe295c7f3300)]
+>> endobj
+18393 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Expression_aeba04371a7fce3d1b5a20b287937feea) 10364 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_af0d240ef2e0e5d6771cb1767f6fa64b3) 10583 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_af50d791f3a12296299a8aa7579ef5758) 10273 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_af5bbfb14fef626aee9f34e71a78c0d7d) 10449 0 R (classParma__Polyhedra__Library_1_1Linear__Expression_af7ecd20eda142aac578efabe2cddee72) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_aeba04371a7fce3d1b5a20b287937feea) (classParma__Polyhedra__Library_1_1Linear__Expression_afda2273cf9b1d62249e3604c2c538d92)]
+>> endobj
+18394 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Form) 1238 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a029ab9a95a7a2294c64305a10a1eb1b3) 10824 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a035ac574273473466efbdd057e0c94ae) 10821 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0593ba623dd81efd555f2ea41f1f104d) 10779 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0801eaf17912403e4e1028f8a369d340) 10858 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0aae6 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Form) (classParma__Polyhedra__Library_1_1Linear__Form_a0aae60933043b8a5733655f003b49855)]
+>> endobj
+18395 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a0c8da5fb852473a4552fb67ce00b62f8) 10828 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0e2249d61de907685faa4be0ed966f67) 10827 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a0f6e7b8fecb60b49b68bad8576548e46) 10832 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a1251bf9a71caa2e554ab22242374c1a6) 10836 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a1536912b00035624ffadf2fd0298e27d) 10820 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a0c8da5fb852473a4552fb67ce00b62f8) (classParma__Polyhedra__Library_1_1Linear__Form_a237ec5be197ef82cd3045f68d8c223bc)]
+>> endobj
+18396 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a239a191aa5c1d63d9aa65d0ae44ad491) 10825 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a29017b2a17f08373830d7072b178a57d) 10822 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a2ef0b7afa0f59700854cf2dbd51c4cd7) 10834 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a365743de53f5e65ceb69a2b8d89b0343) 10840 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a44eb40b6727686a6074e6053fec3a4a4) 10837 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a239a191aa5c1d63d9aa65d0ae44ad491) (classParma__Polyhedra__Library_1_1Linear__Form_a4cd383a0e5302639104689a197061d5c)]
+>> endobj
+18397 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Linear__Form_a4e46696e098918fb68f044865aa74d5e) 10838 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a5f263887740d68ef52175cf69063fcd2) 10839 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a64f7448aba6cc2e8eb4ddd3159faa32d) 10823 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a768af1a1ab63ec4ae39ec442ec69ffb2) 10829 0 R (classParma__Polyhedra__Library_1_1Linear__Form_a9fcdfff651b77ae9c87a326e106b05e1) 10830 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Form_a4e46696e098918fb68f044865aa74d5e) (classParma__Polyhedra__Library_1_1Linear__Form_ab5088f9329846a09702bcd0a05490b67)]
+>> endobj
+18398 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem) 1915 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator) 1794 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a108e6a6005f1a43bf906d349b9c40ea1) 5970 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a2d2a836128949f204da12c2fd3aa4f1c) 5961 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a3d8ac57c5e5aa2a5c2f5576d490c4f11) 5966 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem) (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a400322acab704cef7a052982929182ff)]
+>> endobj
+18399 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4699390a942c1aaeaccd2b89b67e5855) 5967 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4734a40ed0f8923109e02efe4cedc4c2) 5973 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a73e4d633b9400d175d45eb4e16f694d3) 5968 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a83032ffb501255f28077473407e1df81) 5963 0 R (classParma__Polyhedra__Library_1_1MIP__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_a4699390a942c1aaeaccd2b89b67e5855) (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_ad9dae1bccc03e59bf39357297de71360)]
+>> endobj
+18400 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_add6624f4b11313bba2819951fb70ea2f) 5960 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af47168d758e7b40a1a458f985427ae28) 5969 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_af6ff26a7d66d601d93e6548e8472c892) 5964 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a01993c545c5d4dc725147ac29b1d26e5) 10974 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a0bf7e46a6 [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_1_1const__iterator_add6624f4b11313bba2819951fb70ea2f) (classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983a)]
+>> endobj
+18401 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983aac4528dcb9794c502cf7c9bd65e9c54ae) 10898 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a162d95e1149e222a317370e2fa25a120) 10972 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a1e73b39b2848f8141aa58219cf97dead) 11033 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a1ee38be62a49852994bf906003b0c23c) 10973 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a1ef2a882e1f0a3121f94eea90a9a16 [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a0f5e373c7067f61d03e3a90724a6983aac4528dcb9794c502cf7c9bd65e9c54ae) (classParma__Polyhedra__Library_1_1MIP__Problem_a21e9dae374ecb009d8f7f268f5e673e7)]
+>> endobj
+18402 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a25be5d5e126674d8aca8b9ec828e289f) 11030 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a28dfc886a103ede666395ab45fc7950c) 11036 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3601b97efe162fca1df11d70b0b3d607) 11042 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3800cc1eb2fb15d0c42dd71740bb661a) 10971 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3805575c5d920cbc808cf34e44c11fee) 10964 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a25be5d5e126674d8aca8b9ec828e289f) (classParma__Polyhedra__Library_1_1MIP__Problem_a3a010e69cfabe1a026ee21f7639207e3)]
+>> endobj
+18403 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) 11043 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a3aa58c4d8ded71e574db9d1c59533300) 10978 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a40f18b846fb1fe73b63da7fa7cbbbbca) 10966 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a42acbf3b42263a3dc137395dc8fe1421) 11034 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a485bfce228009ebec2a7bd83d695eddd) 11041 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a3a94fde78bde319c0c1806ff074dea70) (classParma__Polyhedra__Library_1_1MIP__Problem_a49625522da117289c0312c67060210f2)]
+>> endobj
+18404 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) 10977 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a57dab2bd4d371c36b4ebf610a6c85759) 11063 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a5da8e430d26c6471590e2c7ae5f7d82e) 10976 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a797f9cf758c537ea0abaffe280cc9682) 11032 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_a8a238e31c3b4acf8a023a6346bbf752f) 11028 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) (classParma__Polyhedra__Library_1_1MIP__Problem_a8ccc13c9fa8f27701c935b481a371f89)]
+>> endobj
+18405 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_a97539a3abb32c8f6dee940d553cec62b) 11040 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aa4a79e7bb87171b31d49429f9d875dcb) 10965 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aa9f9e9fbb372e1f21bd0472b2db20567) 10968 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232d) 10899 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da4d21924dceed7aac6368d4bc5affec [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a97539a3abb32c8f6dee940d553cec62b) (classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232da6a4badcfd0bb8d6e536fa16b2d5108d0)]
+>> endobj
+18406 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) 10901 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aabfec033a504656ea05620f485442b1e) 11029 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_ab151aa3732a4737e63c5142b42159dc3) 11031 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_ab5ff957e959947c6016cd28be6e2fadd) 11025 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_abd1a41cf267b29ebf81851eb096dc6 [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_aabc43ede7fd0577eaeb7255a0eca232dafb044a16e827afb114b4a2b9ba86fcbb) (classParma__Polyhedra__Library_1_1MIP__Problem_ae60e06beac90231262189084333bda57)]
+>> endobj
+18407 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1MIP__Problem_aea40406b8f95d9ca4f61f23598448cd5) 10982 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_aedfa8f360379ceb195993b2ef04424d4) 10975 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_af46e579954688eec46ac0a43029fdaa1) 10970 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_af9e8e2ee2a429df52a8755417e8c8df6) 11062 0 R (classParma__Polyhedra__Library_1_1MIP__Problem_afc1e5cbd96d9c2819ba1ec2151f3897e) 11023 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_aea40406b8f95d9ca4f61f23598448cd5) (classParma__Polyhedra__Library_1_1MIP__Problem_aff27d012a01487b7c9c14a9a3b40d9b1)]
+>> endobj
+18408 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) 1236 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a05a6e1bf3090174d9336b8dfe53d6df7) 11198 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a100e2b8d786b8aa7f2b10125deddb7c8) 7517 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a12e89691311b8923ae33e930a7c89f4b) 11175 0 R (classParma__Polyhedra__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_a89dba3caf804c7ca6db844c67de99371)]
+>> endobj
+18409 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) 11176 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab6da9fdc4ae1693fafd4588fca46e809) 11199 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_aea854e6dd41e3a0b77153d315d697710) 11180 0 R (classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_aefe92c8417c543823a7ac000dc6d4595 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Multiplication__Floating__Point__Expression_ab22bb6327730a73a66ebd117ca90aaed) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a163f5dff452c6cf2e3a0c929eb2b8187)]
+>> endobj
+18410 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a16829d6b83d0c21f3d3e1f87c46ac239) 11275 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a2f41d86c5a949d903179e82072854ef4) 11313 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a35d0734550a70a165a87b145be5e8728) 11284 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a42e87760e6f69306e6322cc77f20d162) 11280 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a56849f08cce0bbdb7b8118abb30471c2) 11282 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a16829d6b83d0c21f3d3e1f87c46ac239) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a60ae86027d4480aec07a5eed85f6977a)]
+>> endobj
+18411 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a691bb5ef88a4c9638034de4c1b9532cc) 11283 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a6b1f2d6606a0b4d4fc8bbde3b24ce553) 11315 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a7358056031cb08692ae07044715987cd) 11277 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a86c7ff797f1b5e1b31217a176176eb4c) 11321 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a89d5bd03139c8fcaf1ab035208d680dd) 11278 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a691bb5ef88a4c9638034de4c1b9532cc) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a8ee7e3364443dc8cd55f3f6388c81ecf)]
+>> endobj
+18412 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a91cfad066b0e12cdaf7454fe4585cfc5) 11312 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a9dc9e3a464def0e2d929fab9cae6e360) 11314 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_ad5c6d64b009045df8248bcb8ffeea69e) 11279 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_aee8ba0ffc68e00046b55e12427c582cd) 11322 0 R (classParma__Polyhedra__Library_1_1NNC__Polyhedron_af5aee1171c6c67b9c57f3949b7b75be8) 11276 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a91cfad066b0e12cdaf7454fe4585cfc5) (classParma__Polyhedra__Library_1_1No__Reduction)]
+>> endobj
+18413 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1No__Reduction_a57a09616d44764f6c63a37c26986f154) 11380 0 R (classParma__Polyhedra__Library_1_1No__Reduction_ae20190c8d340b9d36a945b0a58ac8d84) 11379 0 R (classParma__Polyhedra__Library_1_1No__Reduction_af999fae66cdac4ceae98689fc25d1d26) 11384 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape) 779 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a02f64ed2505526a3265738f72fa17bec) 11671 0 R (classParma__Polyhedra__Library_1_1Octagonal [...]
+/Limits [(classParma__Polyhedra__Library_1_1No__Reduction_a57a09616d44764f6c63a37c26986f154) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a04704288741dbaf6f50e8fc09c43f737)]
+>> endobj
+18414 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a070725ccbafe78e4c5fff018814df408) 11429 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a079ab370103bd84c354f53173664cde5) 11508 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a07b4e1dbeb0e7020780d911a3dbe7e52) 11591 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a0e0ebabbfd873d4a5d7076ebc02aaeb2) 11600 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a1471791dde276599f724696b054d8060) 11675 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a070725ccbafe78e4c5fff018814df408) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a14e9595f982172047485a897079e2e64)]
+>> endobj
+18415 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a15b6fd54370651a7884d81c6a6178601) 11513 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a165d6b70d974556eadf494f305ccec98) 11505 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a16f76a07b461817e79f8f10811206810) 11506 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a180261988d8bec7295dcfbfc7f458dc4) 11821 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a18331c91f5fb527759c43da03bb75a34) 11668 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a15b6fd54370651a7884d81c6a6178601) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a26d8154ade10de97de8dea739300059b)]
+>> endobj
+18416 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a293c185dd2a1e1d3e8444f13a3a4600a) 11767 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2c32e2eea3afd94dbf1bcb6973d980c3) 11599 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2d0d4c4268514182c172e823f3343a26) 11507 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2e86a2f104abe01c52cbc1bc31249d58) 11597 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a2f41b8cdce44d152a3f50677d5fe34ae) 11755 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a293c185dd2a1e1d3e8444f13a3a4600a) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3b9f6fbac96e03a00d061a2cd2ca2baf)]
+>> endobj
+18417 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a3e2e5566d96001db1e141bdd098fda42) 11760 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a3efb45c45d24223addb9abcc922876c4) 11510 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a421196cbbaf6a1ebe24ca31ddf4a6ca2) 11590 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4392d92c159c820229e9edeaaa1fde08) 11768 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a45fa62259c7d5c327bed58252c5d2535) 11761 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a3e2e5566d96001db1e141bdd098fda42) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a45fd26849ccae749af76d0b5844bd263)]
+>> endobj
+18418 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a4706e460848762e3a7642f2c99a06666) 11763 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4815c19ebb19e86a5c58ac16c17e671e) 11516 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a48ca5552a4b0a84570430527e50d114b) 11815 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4c61c716f9b0c406953b9dac9b828699) 11520 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a4eb80821512bd8d880716af85e30267d) 11673 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a4706e460848762e3a7642f2c99a06666) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a500704447a47b59161c7b87a9a6e5a5e)]
+>> endobj
+18419 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a50a4a535b9fc079cea6154105e752126) 11677 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a51b8a7ab7c9d312049b21add6cc8140e) 11672 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a54ce22f211a77cb0eef849d146af8435) 11822 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a55f0409ad0da54065b64778ee19811c7) 11512 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5911188c5ec8dca792b4ef117e29e876) 11582 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a50a4a535b9fc079cea6154105e752126) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5c0ee0095333aebf1465dcc23b728aad)]
+>> endobj
+18420 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a5eca2acffa010b8e1b0311ef65584167) 11511 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a5f967c6b34fa38d22fac082d979db374) 11523 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a60e481255ba2a7e0d44bb2fe0c14a392) 11809 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a615afc2d71928f51973a0605de50dde2) 11770 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a65737f26c11afd6146e8831048e5f167) 11515 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a5eca2acffa010b8e1b0311ef65584167) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a657b456ab883ab71b6d31e408bbe2216)]
+>> endobj
+18421 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a659108de10cd72f412b1bb6883e21b36) 11679 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a67a8415144aabfbe2b1118a6931cbeed) 11820 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6b43af400f0bc0ee0e8e91ca0bf085b7) 11594 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6edd4cd29fbac8a7b8b3905b6b31eefc) 11766 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6fb799a5569502c8429578e9137d034e) 11681 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a659108de10cd72f412b1bb6883e21b36) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6fd695131c86734bc6d325b5d803677c)]
+>> endobj
+18422 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a72b4003eb85d959872be6607bdd86450) 11437 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a760e3ec9f524b03f810a04cdaac070f4) 11771 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7614330bd99c7e64df07b99073872558) 11522 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a781438b8f9047db7df9146f7f45c3ccc) 11816 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a7cbf00ba912f6ebd370aa286367f5f4f) 11756 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a72b4003eb85d959872be6607bdd86450) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a82373711bf37090c84a7a8245f73c661)]
+>> endobj
+18423 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a855f549ca6f288eda04f16c23eaf8b02) 11593 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a86ff7be69c1f0966767931a97d73b8a3) 11595 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a87239943c9354cb76acd3c7c3a5fcd92) 11667 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a881c271d524d7acf0387d666ffa19820) 11584 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a891529f721ff485fe2ec90ac48952cc6) 11424 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a855f549ca6f288eda04f16c23eaf8b02) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a89bdd81414c3119d65b37cc28e14b8c3)]
+>> endobj
+18424 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e202d4f687e3925b37da76b20c24d3e) 11581 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e4111a38f00baaf26dbf2ae57ce5376) 11596 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e7f36b9aaa87a6713fd45edf4c92ccd) 11435 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a931c8a50b23a993d5a820b94c4b94da8) 11514 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9482e35d2c98aaf69f34a70f06290e07) 11814 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a8e202d4f687e3925b37da76b20c24d3e) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a96859bc9dd73f8b6f5db13631192c258)]
+>> endobj
+18425 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a96bae54a01fe00bad4306bec61bb4687) 11423 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a97348f369bbfdd4af775175a546db4c1) 11764 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a99641a13bcdd49b7391dc6d16bffa4bc) 11598 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9ae28a5402544157a27a18af8088bbb0) 11524 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_a9d1aa0e6e39894621b94991044173e52) 11602 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a96bae54a01fe00bad4306bec61bb4687) (classParma__Polyhedra__Library_1_1Octagonal__Shape_aa9d4170ba31cb624f515f45dbd52a652)]
+>> endobj
+18426 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aaeb3f18cecfa915b9cdfca4237772b85) 11759 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab0172dade8a8b47ea85a3dcbd1e218e3) 11509 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab15ec5f9b437b77ff4850dc1c0bf9351) 11601 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab2dd186b2cc006f23a3206b920873f3d) 11666 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab3fc80231d3cc1a0eb6aed24fc8edefd) 11765 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aaeb3f18cecfa915b9cdfca4237772b85) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab408b475a1d6b0d2221fae755ee75cab)]
+>> endobj
+18427 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ab45b377c9c34a198290559e6571529dc) 11810 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ab54db7ae8f9d5601034ea84424a1a0be) 11769 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_abba3c64cf02628dd82076607a4d509d4) 11431 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac15d97c4db0f7b5570380bae5592f2d2) 11678 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac399cf75be0bdd526e299833c4330873) 11519 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ab45b377c9c34a198290559e6571529dc) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac549f855c22dcda23d882bd8e659b38c)]
+>> endobj
+18428 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6973f94432db196ff06218b7c38205a) 11762 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_acbc3c3c9c0761ed1c5988bb9c29e446b) 11517 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_acd03be4b1944ce95bbff9ac4d5cb9001) 11583 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_acde611096aa4b8fc8826262bf67484f9) 11817 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad5be1286c2cd8a227742f1d81b52f9c6) 11427 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6973f94432db196ff06218b7c38205a) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ad9e4b27a90287bc7f17da3de37be34d2)]
+>> endobj
+18429 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ada1a3fa1ca6f341e57d9f9f5eda2b308) 11504 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae532824081a0b50d3688e0ab72066fe9) 11585 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_ae5d22f897dedab2230da11af28069825) 11676 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aeb635bf8c5edfacd4feff91b64fb436c) 11818 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_aebfcd81c55429a63a36b41f4223a2f8d) 11758 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ada1a3fa1ca6f341e57d9f9f5eda2b308) (classParma__Polyhedra__Library_1_1Octagonal__Shape_aec1a9292123f47946225b3389f74de43)]
+>> endobj
+18430 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aef89ae29f8c0dc6f2e566149a1732f8e) 11665 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af1b57d321cb5695be7cadd0d4194bd04) 11757 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af8c9072858fe3d8d47d6333e48071e58) 11587 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af90f3efba85458dcd239a34b8126c466) 11811 0 R (classParma__Polyhedra__Library_1_1Octagonal__Shape_af98a7a6da325511098f6b8f0a21a182e) 11518 0 R [...]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_aef89ae29f8c0dc6f2e566149a1732f8e) (classParma__Polyhedra__Library_1_1Octagonal__Shape_afd6cbc70ab6cbd8675a8e65b98e8f1f6)]
+>> endobj
+18431 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) 1233 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a0d7c444f0642b60fb3a6d7f86da57707) 12238 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a18324115d64b5357cb01e4f5d00ea385) 12255 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a2b16fa08980a81f9666d911c13304d7f) 12237 0 R (classParma__Polyhedra__Library_1_1Opposite__Fl [...]
+/Limits [(classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a7a1350528a7ad90dfdafa97409db9517)]
+>> endobj
+18432 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8cfa8df0c1472235cf53c0b03c70d0d1) 7516 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_aa533c6049f2d1352ad7659aeb6b0eb5a) 12236 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_abf06af1843d7e050eda09c687eed453b) 12256 0 R (classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_ac24cc83f88a80ad3e3742f4c9f075db0) 12234 0 R (classParma__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Opposite__Floating__Point__Expression_a8cfa8df0c1472235cf53c0b03c70d0d1) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a031ecc9f79496b10a1b48d6626fd98aa)]
+>> endobj
+18433 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a058de183d237813010822dc5c734ce5c) 13111 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a27ccfe6ce15264f53bda385c5d93d0c3) 13113 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a3d06dcc99da3a287c6881d2b1e43935a) 13112 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a47e031aae6928828862422b0ceedec71) 13109 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a4d75a1f9b3e618d337fde1b4de9f [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a058de183d237813010822dc5c734ce5c) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a81497d1095efd042cd3034335a3d19e6)]
+>> endobj
+18434 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) 13168 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aa5e48e146300e08949a783b435f7672c) 13107 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ab6e5b1dd2b5b7cc9dae9b4ca656cd05a) 13117 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_ad096a02cc969dcd4b8606cd77d501070) 13108 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_aebe39b79533783e53ef583a9ea30 [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_af6356910030e23dc05bd4e500f073428)]
+>> endobj
+18435 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_af8feb908f5def7ba99abb739dd2dc6cc) 13110 0 R (classParma__Polyhedra__Library_1_1PIP__Decision__Node_afab20885083717c18371349d4c182481) 13167 0 R (classParma__Polyhedra__Library_1_1PIP__Problem) 1921 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a04f2cd33bf24eddaa306c392810004ef) 13249 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a06368fdf7c40ae26305476c42e412172) 13187 0 R (classParma__Polyhedra__Library_1_1PIP__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_af8feb908f5def7ba99abb739dd2dc6cc) (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ece)]
+>> endobj
+18436 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) 13180 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1eceaed708535b4103023ee1a5d24ea5ff7b3) 13179 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a08ee3b2a32e3b7b8088a84a8beaca0f4) 13257 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a1c6db3c7a9e8bcc79574dfbb087cf996) 13253 0 R (classParma__Polyhedra__Library_1_1PIP__Proble [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a0683916154cde6bb308ccdd9c22e1ecea3581e26c004ac37575fd4449822d09c5) (classParma__Polyhedra__Library_1_1PIP__Problem_a1fefbce40046822771b243b1d2f1277e)]
+>> endobj
+18437 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a25cc092f9c3d26be5b6dac41eb54186c) 13239 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a26a3ca0eb57793c00b0517a6856b8c10) 13245 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a2a7a0b9f3dc8cd6d55e839e20fa28f12) 13287 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a2f2683794347b7bceb41d88e1b1412d8) 13247 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a38cc9e4158abcf9fa6fb719d079108d1) 13237 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a25cc092f9c3d26be5b6dac41eb54186c) (classParma__Polyhedra__Library_1_1PIP__Problem_a56ce97c41ec068deda3ccfd81766ff83)]
+>> endobj
+18438 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) 13298 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a5fdacdaf0ba18f647ac7bf95a2624af0) 13297 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a62d38f242bfeb5c6d1a4ccdb28518538) 13236 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a6dd86308a6aa3b0a99e7464fa6d64534) 13254 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a6ffb7a29c69bf20f56f8ba9f16dc74b8) 13250 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a5958bfbbb683917b5f3d165a09fb00a3) (classParma__Polyhedra__Library_1_1PIP__Problem_a77a39c345913dd490ff33b698d45b7e2)]
+>> endobj
+18439 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a785a8dddb80c0cf25b4b02f3f38b0631) 13242 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a86401a66d7add563a9fec4a610ca33b3) 13291 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2) 13181 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a2b86312f1e0350f49b28c23bd3815e9c) 13182 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7 [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a785a8dddb80c0cf25b4b02f3f38b0631) (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1)]
+>> endobj
+18440 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) 13185 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2adf2b5f608f0f0f055f58d9bedb694855) 13186 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a920510b7460ca0933ea807b88484ed8c) 13288 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_a934053580363fb6c281a614d593231f2) 13252 0 R (classParma__Polyhedra__Library_1_1PIP__Proble [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) (classParma__Polyhedra__Library_1_1PIP__Problem_aa7ceb834deaff6303def1cbe95373edc)]
+>> endobj
+18441 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_ab9663a6c08e6c35bea0da7fa41c81393) 13258 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abaa2167b4f8ff4184a73ebe46aef2720) 13293 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abac8b241f6c2a61248fa768b9157203d) 13255 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abe6c178703fd2e036909f2cbd6cee470) 13173 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_abfb5615fad7429cb2c340d763df8a43b) 13289 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_ab9663a6c08e6c35bea0da7fa41c81393) (classParma__Polyhedra__Library_1_1PIP__Problem_ad750455647786b5cb28c5422930f0ec0)]
+>> endobj
+18442 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) 13243 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_ae6a4663bfee916adb9330010328493d6) 13290 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_ae9d3cb337b4a4a0fc296d2b5b742b7f2) 13246 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_aeffbd9c469a175051d71f3fd7fb525d4) 13188 0 R (classParma__Polyhedra__Library_1_1PIP__Problem_af353ca460687792eb573428e18467f44) 13238 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_ae37362cbad36fd84d0896ab2f30679f3) (classParma__Polyhedra__Library_1_1PIP__Solution__Node)]
+>> endobj
+18443 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a02d378f2284277bd0cf98f4f5e9daa37) 13513 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a082a2f74f2c88339b84f233dc45e3370) 13454 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a49e1548e93467d9fd12ba992f8712c56) 13450 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4ec7c4c8093efb70675c35a17d6a7e28) 13342 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a4f54448c4e6823e33a0f5121e5d2 [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a02d378f2284277bd0cf98f4f5e9daa37) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a50a4be6352d2c6b88989c7a49bae79cf)]
+>> endobj
+18444 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) 13452 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a68753415da58ce7afaf72efc835a65be) 13518 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c1045d83957e66a37f4b9605431945c) 13448 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a6c2621d99e009a3c99558671ab046b9b) 13507 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a727cd68e90dd481583b6a2bd5fdf [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a58ca16812eb7bf483600d204a504c63c) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a7ef6a6a1d69f65fd28e518f0de795ffa)]
+>> endobj
+18445 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a8db329a321108295b995b5af1058ff37) 13446 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_a996dc24a90ed7bf0e7231563f3c78975) 13447 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ab41e16bb175c436813472be1b131f853) 13455 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb1b3eeef8a1a793899d9b66f1200fb0) 13449 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_abb91a97e6b843121536f02146fb4 [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_a8db329a321108295b995b5af1058ff37) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac3cf88993e63370f39ad5ea8915ba2af)]
+>> endobj
+18446 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) 13509 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ad5d38b578c833abb397e67cacce7f54d) 13505 0 R (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ae941ad9d780f0c225b88c5a681132007) 13508 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node) 1967 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter) 1689 0 R (classParma__Polyhedra__Library_1_1PI [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a022891f0008542ea787d812e6e6f9e48)]
+>> endobj
+18447 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a243d9267fe6a9414af634749b27dac8d) 3015 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a2bd978ad611c80d14315255b1577772d) 3018 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a3611ca64bf028cea3b37bbfe3c5f84e6) 3024 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a514da3c88769e7584fe9d6da6f2cb003) 3014 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a243d9267fe6a9414af634749b27dac8d) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a6cb598653a5f9e64b0b42b88e5a9b5d1)]
+>> endobj
+18448 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) 3013 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a8ca5257af8014cbcb2b4723340b9139d) 3023 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9561e112f9dc57e63230b0fda3858e1a) 3025 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a9b395593b699094656f3cc00361976f4) 3020 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_a78184503805baea26065449944702c97) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ac2c8b1fa8685b79a6e0dac07128b24d9)]
+>> endobj
+18449 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_acd547a5df8e528ed1ab16c8f19c97685) 3016 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_ad59c13d00ea95d4ed045bca314f5e5fc) 3061 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_adcaa7cd147b3ebb7c52d232824de49e4) 3050 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a048588fb0ac55c4315b0ce6cb1ec274b) 13566 0 R (classParma__Polyhedra__Libr [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_1_1Artificial__Parameter_acd547a5df8e528ed1ab16c8f19c97685) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a263d8e40807241816cef0286661553e1)]
+>> endobj
+18450 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a2d4cc0630c7f91e7e490a1322c53e5c0) 13636 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3b556a97f08c7fc9cbf0e4e9e7b6d901) 13662 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd1af04908aea1d1e5deda23b627a24) 13672 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a3cd966830899423f741449e6567241cd) 13628 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a43eb178d5fe05266ba5f76962e836bfe) 13331 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a2d4cc0630c7f91e7e490a1322c53e5c0) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a454c2aefff18b334bc3e37c1f6e2fb77)]
+>> endobj
+18451 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a48b522405ad8896775cbe6d2344bba4a) 13567 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a4a60232026ce7d82ef5a4cee5e482fa9) 13667 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a675704312a01f43f3f2d23f1f24c50c2) 13665 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a6ff7edd489b1d20b1bca1f4431d802f1) 13629 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a740610ebd6849a2b7058991fa52071f8) 13177 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a48b522405ad8896775cbe6d2344bba4a) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a77459bc72a66ade5bdb58c0ce1aaf020)]
+>> endobj
+18452 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) 13565 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a850e5f1b5da521aff7ff926c0b54aa7a) 13639 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a8cd66485ef35802c6c117eab5f641d08) 13624 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9579b18f0878bf26e817c7215ceb4aa3) 13661 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a97ccf10304ef9ba8b58549f7570b8cea) 13341 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9957fb5cc207114f8401d86fd66c7fba)]
+>> endobj
+18453 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9ac8b3ffed6355e1de3f16b194a90a42) 13638 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aa53032d6032bb4c199a517187c46636e) 13562 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_aafa858d51c2ba75d0778692e95c895c7) 13632 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ab57aada46f9e76478cf7db1ca6ec9091) 13631 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac5612e1699099eb4ce49e81b696ae89f) 13564 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a9ac8b3ffed6355e1de3f16b194a90a42) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac963d832360fbbf4936bd81bd82f4d44)]
+>> endobj
+18454 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) 13664 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad0f4f20d94ed76c2a147a571e3f44e6c) 13673 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ad2e8f2d9c5b2732df9e001bb155320ca) 13560 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ade3035e2021726b1d2c0c563d6c1216e) 13622 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_ae3905fc4ad45180a029f856c7ca7a2fc) 13563 0 R (cla [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_ac9be59196bce4192897f34838353409b) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af0d04edca3b2e3d30f5d6de7499396b5)]
+>> endobj
+18455 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_af46a1a2668f581e1bc158db432912f35) 13623 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_af6518b1b7e729018dfc57b6800d904f8) 13630 0 R (classParma__Polyhedra__Library_1_1PIP__Tree__Node_afe89a5e748cfb2fabd6c6d46458f0d4e) 13175 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product) 797 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a022e765ebe010dc476a32c653478b373) 12445 0 R (classParma__Pol [...]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_af46a1a2668f581e1bc158db432912f35) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a044a9170ed6ce87a5639723422c558d3)]
+>> endobj
+18456 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a087db98367a61b27b10726a05a218dbf) 12374 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a09bc61764011405fa7116db68f86966f) 12313 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0a6c5e81e21629102510fd3506314ab5) 12461 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a0ec85f16ba039eada95199c90e8cfd21) 12455 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a087db98367a61b27b10726a05a218dbf) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a150344138f9e354d0055c7d3fd5cd88e)]
+>> endobj
+18457 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a168a4e19029add524dbf799870bcf8bb) 12456 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a17bc3014dc53a7bd3a40fc003741964d) 12446 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a17c576fa2e9e3796a7d7264e1e07ed98) 12309 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a189b8a5a14c05d63cf5724a8561f8088) 12658 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a168a4e19029add524dbf799870bcf8bb) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1c64dc50a3b4915af285e1fbf558336e)]
+>> endobj
+18458 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2c79439f4041447a648d8179889955a2) 12545 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2d12805af932544a4fc1575f8db62a3d) 12663 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a343e039e48425126b187827066d12bf2) 12655 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a355ac20e2a9b7dddcfc47fe612e4c6c5) 12622 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2c79439f4041447a648d8179889955a2) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3b08ea3b8fd40d91de352d9309f28428)]
+>> endobj
+18459 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3ce6d8050a4040c9cea2beabc7c28a20) 12619 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3d6de44b038048aa085ddcebe17afcc3) 12314 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3e222e92137c5646b6dc549ad55a48a1) 12370 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3ee94f79c57490afac29380bb06e4ab1) 12549 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a3ce6d8050a4040c9cea2beabc7c28a20) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a43ab45399b7e22ffcd6403b7e59a473c)]
+>> endobj
+18460 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a49539890b469353a26a03151300162f1) 12542 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4ac4e4131c756f0ffce85b9dec7d2b3a) 12656 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4d614db695a0f4d0cbaa706c55457b35) 12377 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a4dd1972c589bdb54a5fd83a7857e53d9) 12453 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a49539890b469353a26a03151300162f1) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5258df790eeaa83139880fb3e0d5827c)]
+>> endobj
+18461 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a53ca09403244f4b551c5d8fb56d1f5f1) 12548 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a5683b0d430e6c058bc91b4ba63d41ddf) 12653 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a569bd6bc031876c71761771dbef65b65) 12611 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a57fc3d9d838fd7e20e80806307452a91) 12608 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a53ca09403244f4b551c5d8fb56d1f5f1) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a625147567c82a825d4db81d626b9f4ee)]
+>> endobj
+18462 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a63b08061fa91e50fd3c4d95cbf59c931) 12458 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a658be3d5f34e4c3ade6b82cdf4d54ecd) 12376 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6a92522d3632ac22254186400ed623cb) 12607 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a6b427a649f2f3ea994b981a7005bc49e) 12609 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a63b08061fa91e50fd3c4d95cbf59c931) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7443f73507419c6878dd520aa9e9d18d)]
+>> endobj
+18463 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7462cb31f797293eaf81b23e1faf1e1c) 12543 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7c243295a367d654adee85d3e0dc5042) 12625 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a82d076b6e20bf6bf31c5dc7399cffa6b) 12541 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a85ae65f464f7b414259190b60cb43d27) 12372 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a7462cb31f797293eaf81b23e1faf1e1c) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8b7aa1436b25cff4dddb7ce3710003eb)]
+>> endobj
+18464 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8d3933bc0c35af723fe62c1c062df074) 12546 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8f776db845493e0c959fac93d1c270e3) 12557 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8ff90cd506e2377d88aafe850f46ac5b) 12669 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a90667f8cdc3e2d0ee95f445288d1c6fc) 12623 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8d3933bc0c35af723fe62c1c062df074) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a921999e1013b4936bb5154049328e9c9)]
+>> endobj
+18465 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a945094f7ebf99bb443e9757d2682b7d9) 12383 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a95bb13da923b1b8d4af02f551b121b1c) 12312 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a963f864f2dad3d988b1b254f8a2ddfd5) 12614 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9974447658c195960d694cc7e74ba119) 12547 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a945094f7ebf99bb443e9757d2682b7d9) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a9c9bdca928eade3b5ab3b23fc2edb04d)]
+>> endobj
+18466 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa14d5c151bc22663b9b78b7ec179c67f) 12388 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa299eb4f7b82130a37da3732ec837137) 12660 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa2a8683afd33a1d57db43c9db16de1f5) 12664 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa4c2b2e6f4d736db4dd9cf860b1d49ee) 12620 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa14d5c151bc22663b9b78b7ec179c67f) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aa842e5c1b8cd44fdc80130394e4e9d29)]
+>> endobj
+18467 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aaf291f349e897dc78d61d973c1af154b) 12449 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab865be417a99a98ca540f46e43ac6779) 12379 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ab9fab28be620bda6bb6b19eea53969b3) 12443 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_abf3c153d5bdc2092cad23a9d48dfd44b) 12381 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aaf291f349e897dc78d61d973c1af154b) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac197524e1627e3a7c4e82bf95d9c0248)]
+>> endobj
+18468 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac1b48492ce30d0d7e7e61683a21e0a28) 12544 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac2f1209d77894eb265d41b923b74f9d9) 12668 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac7206839379551b5fd12536a44d8af67) 12447 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac9a9e60bed97446ddc353ef804e73fcb) 12460 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ac1b48492ce30d0d7e7e61683a21e0a28) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_acee9156486e9850613d6f29a3d498cd3)]
+>> endobj
+18469 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad13c6fb9dcb0424003eaaca0deb541d3) 12617 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad455ab5ad0a5ee1824930508e1965754) 12380 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ada035c6b9498ff508b1486005b09681e) 12621 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ada897960c826778c906bbac42b4adc32) 12315 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ad13c6fb9dcb0424003eaaca0deb541d3) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adcb2fdf8455a113cbfaaab29c5a3ff22)]
+>> endobj
+18470 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae18801dc804c40ce09a8f1c59be9b329) 12454 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae5402f96e0359679d7f6ce049410a4ec) 12550 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae5c1fa69782d6fd3c44e41b925599d98) 12605 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aec093aabb8eff04714d94a1d8f549c5c) 12442 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae18801dc804c40ce09a8f1c59be9b329) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aefa817da18e0cb4cfb7f3cb347bef71f)]
+>> endobj
+18471 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af05b6221aff8bf1bfe8140fee0b091a6) 12624 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af2b56a84ab595b61c694994533eed6b5) 12462 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af5bf0606fb2c69a7061feba433742ab3) 12606 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af7046af1c844b59163bbd44aea38554a) 12615 0 R (classParma__Polyhedra__Library_1_1Partially__Reduce [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af05b6221aff8bf1bfe8140fee0b091a6) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_af9aee83bd717e4448cc4644256df8c78)]
+>> endobj
+18472 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afcef4ec8bfd8a65014ee769a36e0e415) 12459 0 R (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_aff0d1fd8010233de587efc7c369e5642) 12311 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset) 796 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0b732034ee43763d080df03b09cef738) 13874 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0ba6b33311c2b8269768b50d37f2023b) 13935 0 R (classP [...]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_afcef4ec8bfd8a65014ee769a36e0e415) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a0d4596f8ceb58f2661667fd70d14c27b)]
+>> endobj
+18473 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a10d9890b8689f81eb523e564b90155e8) 13873 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1172af7e7d2ee7986b1b6e5502722026) 13950 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a134614da6c987d405075d26a14334dda) 13800 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a17e25309469009012f40ed891a2c3f01) 14090 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a1a08648e6ffda9d2aebe72b5fd5276a4) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a10d9890b8689f81eb523e564b90155e8) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a22770e59d89376a756880f6dd45a7705)]
+>> endobj
+18474 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a26f8f4c25f9c73d238537711374dc159) 14084 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a2f238d94389078c34108540c600836cc) 14074 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a33462aa3bbe9c6a069783274031d7dce) 13802 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a3495ffcfb82ab7074ea4b3227dc0ce84) 14035 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a387971d4f658b3b5294ca3b282db0332) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a26f8f4c25f9c73d238537711374dc159) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a393ff49cc4d91834f6af25f73c3be617)]
+>> endobj
+18475 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a43af52f7bc75535df6830e5672dbe9fe) 14031 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a48056bb9473b8c2019f402b21245d80c) 14078 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4908a79cf1d4182da8044569f54e4c2e) 13788 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a49a3e85706df1d3b23727ec6044f3332) 13876 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a49e115d36463ed948b66bc80da8797bf) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a43af52f7bc75535df6830e5672dbe9fe) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4de33097ab368fe3a04efcb7d06e951f)]
+>> endobj
+18476 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a4ef22528f01e0580396340c7c1a35411) 13866 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4f759d9cde19d1654178afdc211a71c9) 13945 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a531a253e03d062333a8cb762f14ab131) 13797 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a5586c5fb00764130c2933b3ca57d2406) 13862 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a576cc345fee807dab1b7632f0399d205) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a4ef22528f01e0580396340c7c1a35411) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a5efd5e4204c7c95c1b0e3cfd829f27e2)]
+>> endobj
+18477 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a6638f2b6c8bf898f8161471fc5f574e8) 13782 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a66ea2ce3b2953de1a16353b4a0494f99) 13948 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a687054502f5eb589faf427d88c3d65c4) 13860 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6b00d457f34b8baa95ff0bee93ca2104) 13936 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6bb5b7d9f8f287478c9d1e80dffe6f61) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a6638f2b6c8bf898f8161471fc5f574e8) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6f5194268604a038e2bbc5b80fa39d28)]
+>> endobj
+18478 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a6f5c679d18caa143808dee561a677526) 13794 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a6fe5d4b4668903bd121f09cf42dafc26) 13859 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a70cfc1a90d96296a91eb0bfddc55713b) 13954 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a71e812fb33a773ec01d3401bb98cca7c) 13867 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a71eda0300dc88b24d6b0d6af3630f18a) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a6f5c679d18caa143808dee561a677526) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a7d24a62d5e49ebf26da8f09777c0f3c6)]
+>> endobj
+18479 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a7e233e312a4eb954ae6072fb67066ed8) 14028 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a82fdfec45a014eda72368a83eb9b262f) 14025 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8401ba86478c28adc82a461373af899e) 13949 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a863e64aac781b787cef654d50f7a4bfb) 13795 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a88358b265bd62da2cd81c56fcd645ff4) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a7e233e312a4eb954ae6072fb67066ed8) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a8c49dfc766d00310a09b70787fa0abd7)]
+>> endobj
+18480 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a9c55ec0c67edc3d1a79651ff8bfe1d7f) 13953 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9d8f4d157c42e5e39278d7d66d76c885) 13787 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_a9f44065933ee85b8d5aa18afbf25cdc4) 13799 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa1443fb30fc4074fced75ff90fd6c6ea) 13786 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa215c11ded71b5bdba3261ef4a120db8) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a9c55ec0c67edc3d1a79651ff8bfe1d7f) (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa228b23d0485640e4605c02cda7ef927)]
+>> endobj
+18481 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_aa3310914f7ae4e787b5a313c0408128a) 13932 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa3e819067de141368f02ae0cfc42f707) 14087 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa799531de0e163fee81fe310c196d06a) 13877 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aa9fc9fdcb869bab25e625e30700ac946) 14027 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_aac42e5e97960d9aa2cedd2b9dcab697e) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_aa3310914f7ae4e787b5a313c0408128a) (classParma__Polyhedra__Library_1_1Pointset__Powerset_aae1cd388ec3212a9ffe035fb50a0c433)]
+>> endobj
+18482 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ab58e79d1bb74e1d280f13f67b4a72088) 13941 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab599638afe2eeffd2e717dcf1f4024b0) 13801 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab6f406a463e3ba5410f4cbdaa11f4ab4) 14023 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab715169978303aca2ce5ddfa3bbd835d) 14024 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab7da6c8657f9fd5012eedbf06f125f55) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ab58e79d1bb74e1d280f13f67b4a72088) (classParma__Polyhedra__Library_1_1Pointset__Powerset_ab98a54c0e234a92a719a14dc82dd0bc4)]
+>> endobj
+18483 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_abd234893e53023df0b4580cdc80c1b04) 14030 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ac038cf769127bae1af0098ec5b9bd1d3) 13872 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ac8ee6f133d133ecb820f1ef4bc9f844e) 14075 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_acaeef75119aef1facd18b0f1b3288704) 13798 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_acccf4bd9a0496d0ee342b024db60e456) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_abd234893e53023df0b4580cdc80c1b04) (classParma__Polyhedra__Library_1_1Pointset__Powerset_ace39d6fb25dd1e014394aa0b87b2271f)]
+>> endobj
+18484 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ad02d0d77972ad5c0e985d6e545ebdee6) 13947 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad1574856ed0bd50691f53d457f7050a3) 13781 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad3c81efacdeb13f86545d21a1e042842) 13937 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad4d5c7ecaf25c8ecb621c67f736a36f1) 13780 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad50fd9b69923ff4d148cc0d730007ed1) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ad02d0d77972ad5c0e985d6e545ebdee6) (classParma__Polyhedra__Library_1_1Pointset__Powerset_ad88d1b3a6eb0d9cf72ab0f38ca00dd05)]
+>> endobj
+18485 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_adc14d69a6aa5791d0c7f8a4b33e6555f) 14088 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_adc580eb211e4b01ea98205fd00cc10ed) 13942 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_add02f1e43203f711fb4ff5a3a2964c88) 14089 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae304e2fce9a44bf70cb231d3c5eee805) 14033 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_ae312d1f6cbaa566ae76eba2d5343afd0) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_adc14d69a6aa5791d0c7f8a4b33e6555f) (classParma__Polyhedra__Library_1_1Pointset__Powerset_aef0a1e3939a61e4689c395faa11ea2d3)]
+>> endobj
+18486 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Pointset__Powerset_af2a0481ba54986a813ecd5ddf38b32e3) 14073 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_af301ce44669a47cba65f442cb83df09e) 13938 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_af92f79edc91ff46f8c78bb88e125909d) 13951 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_afae9026c6dd798922151da40278851be) 13871 0 R (classParma__Polyhedra__Library_1_1Pointset__Powerset_afbcad3e472c43fa5fbaedc7ca116285c) [...]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_af2a0481ba54986a813ecd5ddf38b32e3) (classParma__Polyhedra__Library_1_1Poly__Con__Relation)]
+>> endobj
+18487 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a1dd09c87a931132dbee52ea24266866a) 14446 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a4cc725a9fe3bdaded2c131bb8bb47ed8) 14392 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a553ae81ae234cedad36e72b32c967e65) 14443 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a62827195c6aeacf38a8fb3df6df8ff2e) 14444 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a80b9d602f99df76039d58032b200 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a1dd09c87a931132dbee52ea24266866a) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e)]
+>> endobj
+18488 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a9f09728ae53c8e3dadeb202f28bb6fdb) 14445 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa317e5d2d782c3589c48cb3b45d6790d) 14440 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_aa4b60ce3ac62aee15faac1b5035fdb4d) 14390 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab92b75d150bd5fbfc03cadec75d59e0f) 14391 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ab9da0d811233cfb64481a7fe08b7 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a9f09728ae53c8e3dadeb202f28bb6fdb) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_ac8b0d22ea3470020b35240f778c34a94)]
+>> endobj
+18489 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) 14455 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af00b427f47054a80d236d124443c580c) 14456 0 R (classParma__Polyhedra__Library_1_1Poly__Con__Relation_af7184f692efc0672e3213f6be9d5cf4c) 14454 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation) 1969 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a0ca2fc9566495b3d4ac6b970a301d9a1) 14484 0 R (classParma__Polyhe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_ad1bc9d7804925b15f8205df0b3efc8a4) (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a306699ac7d5f2c2c909c3a3baf303009)]
+>> endobj
+18490 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a419ea78710f4b45c1542647e1212a3f7) 14483 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a4f7df2a0b66616d7672e562fa8c4e8f6) 14482 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a5740d23d50b9aa7c95e8b6b51242258d) 14529 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a6d5d2010157ae8f712e4a3e551d355d7) 14531 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a8ede6a8a55e35d1c41065b01afac [...]
+/Limits [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_a419ea78710f4b45c1542647e1212a3f7) (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aa303fa28c55c391afe4f067f91db36ce)]
+>> endobj
+18491 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aaf9d682418e536d9a1f6bd24991e1c56) 14486 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ad99eb5124bfcd9c75379efdde73d1a1a) 14524 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_ade82782e3363de460caad677b3583559) 14533 0 R (classParma__Polyhedra__Library_1_1Poly__Gen__Relation_af78754c1ef47797c0acbd31cf48f9caf) 14522 0 R (classParma__Polyhedra__Library_1_1Polyhedron) 1254 0 R (classParma__Polyhedra__Libr [...]
+/Limits [(classParma__Polyhedra__Library_1_1Poly__Gen__Relation_aaf9d682418e536d9a1f6bd24991e1c56) (classParma__Polyhedra__Library_1_1Polyhedron_a0514c2e57ac8154666e9fe6bb56c0e18)]
+>> endobj
+18492 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a05fba1023938607f7c5e345c0be716e3) 14801 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a075036249d2478e1710f5d6350c849f3) 14719 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a08e91d11b3deb5b694356b5573d2547a) 14810 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a0a5c586d872f15baf7fd70941fc16c41) 14706 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a0c58bbc8bf8db5f570da3db42a0ae2f7) 14942 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a05fba1023938607f7c5e345c0be716e3) (classParma__Polyhedra__Library_1_1Polyhedron_a0d9abbf681b7b0724963d97596286ae5)]
+>> endobj
+18493 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a13f15417d90174f6c2d3648e83d9fcf5) 14705 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a1a3647877302fc6e0e583b8b881a7a4f) 14889 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a1c30b772596f8f342d0f05b9b142a932) 15028 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a1cecffe684d1faa9b0f6b8d4f227e9ae) 15025 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a1d7db8ee4d8972c1818a36d6517ebbff) 14945 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a13f15417d90174f6c2d3648e83d9fcf5) (classParma__Polyhedra__Library_1_1Polyhedron_a236a18fe8cc922d00ee92a6c6e42f923)]
+>> endobj
+18494 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a249ea59c1765ea299f4d9471388aa5f9) 15029 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a26cdbeaa84beec1df0c9f86b73b20cfb) 14807 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a281b8db6a8e0014ab2c41dd15f8c0708) 14888 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a2bf7987a6ee3547c1e125e83e432ee2a) 14632 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a3065d01256aa333117e0ee24d99b4431) 14896 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a249ea59c1765ea299f4d9471388aa5f9) (classParma__Polyhedra__Library_1_1Polyhedron_a31d70a625e092dfdaed4f3232701f35d)]
+>> endobj
+18495 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a3569a428ad758dc9ac8273e0f1f77772) 14714 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a371deb67f73bf27ac9a7ff6f2216db9c) 14882 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a3b49993a1cd4fc6891da88a6259b9f93) 14951 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a3c1e5a2419a5f4a5cf89133606ed1680) 14800 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a418f9959fe50f163773ad9de147821ed) 14957 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a3569a428ad758dc9ac8273e0f1f77772) (classParma__Polyhedra__Library_1_1Polyhedron_a43cd840b1ec99350c222b3f217739cea)]
+>> endobj
+18496 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a49fe44155b41ca85f41b2abc99c39e13) 14799 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a4b428098e57a9101473a54cd71a0753f) 14803 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a4f514edad990412bd66cc666347103ab) 14809 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a4f9a47ba1b29f1e07a32542584d50686) 14710 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a50e1047c49fffb06bc5089a06a051a3d) 14811 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a49fe44155b41ca85f41b2abc99c39e13) (classParma__Polyhedra__Library_1_1Polyhedron_a527e7c81841bbcf1963c6e260dadfe01)]
+>> endobj
+18497 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a547a8d96908afe5a7f9e4ba2e10d7ac8) 14943 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a5c5da855445b7c877a626d824dfce64e) 14367 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a5d53d09dcc839672fedd4ab5d4142d57) 14707 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a5df26655af3ae7844569d7086edf8332) 14703 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a5dfef947c46e234a1ffd4707312332ec) 14556 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a547a8d96908afe5a7f9e4ba2e10d7ac8) (classParma__Polyhedra__Library_1_1Polyhedron_a6187dbe974649c7bd4de8e66f70d3e46)]
+>> endobj
+18498 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a672b0568e7a27c37b3afde649f7c0171) 14804 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6b737abc8f33b2a2362e3f9c9ab08d58) 14956 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6b987d283ce345c52b5d193c0688ad28) 14884 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6c7c72e56241da463eaeccdff79b6d49) 14947 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a6e73a7d462d6a9a3891fff6c4a923495) 14701 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a672b0568e7a27c37b3afde649f7c0171) (classParma__Polyhedra__Library_1_1Polyhedron_a6e9d9dd7740b414d407c16687c99a88e)]
+>> endobj
+18499 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a6fb94f0e966e97bfb9dcf43dddcf12ba) 14634 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7366f9b91109b63f078e963bccd9f5b4) 14887 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a73cb0d61cccb259e06b68d4f83deb6d7) 14950 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a76c9012a376984a1b88823a59bd5bcde) 15031 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7af48c81caa850300e6042bea1008a38) 14702 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a6fb94f0e966e97bfb9dcf43dddcf12ba) (classParma__Polyhedra__Library_1_1Polyhedron_a7b8d597a3c23af1fce9d8d3e1d36e11d)]
+>> endobj
+18500 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) 14708 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a7e68bea365fe939d08c91ec4edc61a2b) 14796 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a8132d1a9b329271fb4f7faeb59c89c39) 14802 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a858e0030826ee6c29545a934166874ef) 15024 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a86d2bbceaa288f2f605ac88516d313cb) 14959 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) (classParma__Polyhedra__Library_1_1Polyhedron_a87ebe6f7cd176227f61c6d0fe47a4f68)]
+>> endobj
+18501 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) 15036 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a8c33b9ea975535b5aa0882241cf78986) 14637 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a8ed700f662722cbebdc9328344ba2839) 14638 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a90016052cbe535d7e8b1e20a2c599053) 14885 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a941caad4d0717e0fab30bf246adc0370) 15034 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a8af124edba7c75bc76ec394405aa893e) (classParma__Polyhedra__Library_1_1Polyhedron_a96e902093a55f87f0aebc2bb13a8d740)]
+>> endobj
+18502 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_a9764ef2f159cfdcca3f151e899bd43ef) 14892 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a97ddb3b93ac699eebaca7e79f691b0ad) 14559 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a98c785602c5af8f7e0c1be92bb5e8b71) 14883 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a9a45b4b8f148a20359a2f3e2b1c2cb2d) 14711 0 R (classParma__Polyhedra__Library_1_1Polyhedron_a9bc768bb8d7d9b971b44b8b3be738963) 14958 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a9764ef2f159cfdcca3f151e899bd43ef) (classParma__Polyhedra__Library_1_1Polyhedron_a9f3c5474494eb306717bc3da7c109307)]
+>> endobj
+18503 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_aa0ac997a15935821583174de968e5bff) 14640 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa26e1a5815b7a0c3b610395c854594bf) 14718 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa38fbbd15d5dc2e98d5b24c92b06c290) 14946 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa39bdf85d6db02629fa73bbcaddab6d5) 14952 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aa6b6fed08414c86d33fc4a44c59e9e22) 14894 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_aa0ac997a15935821583174de968e5bff) (classParma__Polyhedra__Library_1_1Polyhedron_aa78179b1d8478dce6cf572af8e0b9cb4)]
+>> endobj
+18504 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_aa809bff4b85d09cd801e5e5cde1b8c06) 14805 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ab1b315e7f04c051a36f48d344dd34052) 14712 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ab4959b3da46291de301d9150f5afc3aa) 14961 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ab6ab1820f2fdf444d1431ff3af424451) 14960 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ab7a35f8df974c9e932df6291754859fb) 14631 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_aa809bff4b85d09cd801e5e5cde1b8c06) (classParma__Polyhedra__Library_1_1Polyhedron_abbb7562de97ccf13bd97b57bb5e3ac94)]
+>> endobj
+18505 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_abfd98397c137d81dcc27111fba3ccd54) 14717 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac2182f38e9f8acede601c3dcfa71c3b3) 14704 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac251eb38d1b24b8b570d874ee11df424) 14645 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac26060b9b14465d4f1d948ab9c838c9c) 14886 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ac5c7acc50141a9104ef5b9b7598c1438) 14649 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_abfd98397c137d81dcc27111fba3ccd54) (classParma__Polyhedra__Library_1_1Polyhedron_ac6ea1802e6a6cfb32e5af6d6d26eb424)]
+>> endobj
+18506 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ac93800b9ec7aae75937598e1f2209b1f) 14806 0 R (classParma__Polyhedra__Library_1_1Polyhedron_acbc86683af6afc0818cc9e980a84fcb8) 14812 0 R (classParma__Polyhedra__Library_1_1Polyhedron_acf531d280805472a54c22fed0f689932) 14891 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad020ca98ef94bc16e1050da4e0d54971) 15032 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad6a8cc7029bad7ad7ad116c90ff59aec) 14715 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ac93800b9ec7aae75937598e1f2209b1f) (classParma__Polyhedra__Library_1_1Polyhedron_ad6d1e866b7ba9bf4233f3a5254cda0f9)]
+>> endobj
+18507 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ad84befb6d0ded481871cbef1b7306824) 15033 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad909d5b60cab5d1a6816577c97b60fcf) 14636 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ad914801461cad05325559e95b9c4d9c6) 14651 0 R (classParma__Polyhedra__Library_1_1Polyhedron_adee3b5c0c3800ce2214e68a156cbcf77) 14897 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae10fbc38125e63858549f5ec8a25e046) 14880 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ad84befb6d0ded481871cbef1b7306824) (classParma__Polyhedra__Library_1_1Polyhedron_ae1c5216e2ba5c80d77e128daea25b46e)]
+>> endobj
+18508 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_ae3be29eddce8f41019e7dcb731c8ba7b) 14646 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae58a861a42c5216a2267e3f94ecaec8c) 14953 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae680437fdc213b7174c581caa2e0c0d3) 14650 0 R (classParma__Polyhedra__Library_1_1Polyhedron_ae89cd985111a1a27c60a6fcc28ae9788) 14813 0 R (classParma__Polyhedra__Library_1_1Polyhedron_aeb14f5522982b3874f2cd19586813421) 14797 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ae3be29eddce8f41019e7dcb731c8ba7b) (classParma__Polyhedra__Library_1_1Polyhedron_aeeb72a31f8e1823de7a8123585a331b6)]
+>> endobj
+18509 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) 14944 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af074d4d4d406dd065812b32cc8714222) 14890 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af15f956dac6d4b19ecd8fee0f9718f29) 15021 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af47944944e16e786df5c0671e7baa995) 14808 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af496ec55802726ee3b39e52458ab0647) 14954 0 R (classParma__Polyhedra__Libra [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_aefab726809c553c136e5d8fda50c276e) (classParma__Polyhedra__Library_1_1Polyhedron_af60c3f345fb8ec8c708e49e8fa33f737)]
+>> endobj
+18510 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Polyhedron_af740303d5461c838735ec53c5c1f8855) 14647 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af882ff84afd3c2507e17ffa62ffd20a0) 15035 0 R (classParma__Polyhedra__Library_1_1Polyhedron_af8c0f1f8dc80d82fed8943f2c5737d2d) 15030 0 R (classParma__Polyhedra__Library_1_1Polyhedron_afc2a04d2049183cddbcf70316fdf40e7) 15027 0 R (classParma__Polyhedra__Library_1_1Powerset) 1970 0 R (classParma__Polyhedra__Library_1_1Powerset_a02d1e51b7a8affe603ac7 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_af740303d5461c838735ec53c5c1f8855) (classParma__Polyhedra__Library_1_1Powerset_a02d1e51b7a8affe603ac7b98b728bc21)]
+>> endobj
+18511 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) 15610 0 R (classParma__Polyhedra__Library_1_1Powerset_a0bbdc3e9db50dea0c8354bab95c403f2) 15554 0 R (classParma__Polyhedra__Library_1_1Powerset_a0db69116a7111121b39ae808911c77c1) 15502 0 R (classParma__Polyhedra__Library_1_1Powerset_a0eee2ac77a306882c5646ddc6cfeaf40) 15556 0 R (classParma__Polyhedra__Library_1_1Powerset_a120e2e92a13bf7e4ccd20b14b322196f) 15507 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a0a4e3c1a54120a8a02ec161d3ba1a30b) (classParma__Polyhedra__Library_1_1Powerset_a1d52d042b5e633bc5444947ceaa65cd4)]
+>> endobj
+18512 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_a1df108cb7c2a626eaa0764c74cc509d1) 15560 0 R (classParma__Polyhedra__Library_1_1Powerset_a1e718bbe851af32e715da7b02afe166f) 15599 0 R (classParma__Polyhedra__Library_1_1Powerset_a2628654eea57cfe7d07b3d3d9d563b45) 15559 0 R (classParma__Polyhedra__Library_1_1Powerset_a26efa1a670d98531267d66b3cdc3de6f) 15499 0 R (classParma__Polyhedra__Library_1_1Powerset_a2a875ab79a20b1421a1bfde273b984e6) 15503 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a1df108cb7c2a626eaa0764c74cc509d1) (classParma__Polyhedra__Library_1_1Powerset_a2cd76c051063496368e5b7519398b963)]
+>> endobj
+18513 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_a2e3095e400511537f5fa5c5c9bca4690) 15566 0 R (classParma__Polyhedra__Library_1_1Powerset_a36becc8c3ace976043199807351d5b04) 15496 0 R (classParma__Polyhedra__Library_1_1Powerset_a3736962783853df4ddc48f73a786fb30) 15562 0 R (classParma__Polyhedra__Library_1_1Powerset_a3a8a4fc58571becf60983f083b711c83) 15572 0 R (classParma__Polyhedra__Library_1_1Powerset_a3c49109381987d2cf7272562566833cb) 15607 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a2e3095e400511537f5fa5c5c9bca4690) (classParma__Polyhedra__Library_1_1Powerset_a4720b45317a1d7a600af6e6dceb2b55a)]
+>> endobj
+18514 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_a5534b8f8fbd973bfb7051cf5fb31f19d) 15570 0 R (classParma__Polyhedra__Library_1_1Powerset_a5a57714c7c7e5222664f1ac298ce3871) 15568 0 R (classParma__Polyhedra__Library_1_1Powerset_a5c3bee913efb87e4661df746e184e1e1) 15571 0 R (classParma__Polyhedra__Library_1_1Powerset_a5d2c2fc2c077e77db657af49d332c9b5) 15601 0 R (classParma__Polyhedra__Library_1_1Powerset_a5ee343513b3166ba11eb14ae041211b7) 15564 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a5534b8f8fbd973bfb7051cf5fb31f19d) (classParma__Polyhedra__Library_1_1Powerset_a5ff03c3a22a89b7fdd332a5bdb3ca128)]
+>> endobj
+18515 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_a635cce5ca8b683b44ed7299a31fb5646) 15609 0 R (classParma__Polyhedra__Library_1_1Powerset_a6509a5f02a17396160e5302952d2273a) 15509 0 R (classParma__Polyhedra__Library_1_1Powerset_a6e970db12e0581dd7014d8cb334adaef) 15506 0 R (classParma__Polyhedra__Library_1_1Powerset_a6f4469416e02c586de17284317f8a92e) 15497 0 R (classParma__Polyhedra__Library_1_1Powerset_a7c2f551013b9639485e2dd2cd2b20ecb) 15563 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a635cce5ca8b683b44ed7299a31fb5646) (classParma__Polyhedra__Library_1_1Powerset_a8e0d6f30e164f445ee75eee3f634ebca)]
+>> endobj
+18516 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_a92b9e90d341774e9006bd56a7c9b650c) 15557 0 R (classParma__Polyhedra__Library_1_1Powerset_aa90416015e75acf0dcb0ffb98b023b9a) 15552 0 R (classParma__Polyhedra__Library_1_1Powerset_aab7519865a52fbbc8dc2031135a9fb41) 15459 0 R (classParma__Polyhedra__Library_1_1Powerset_ab31df347be74e19c85e0ef3953a63d9e) 15598 0 R (classParma__Polyhedra__Library_1_1Powerset_abcd9dc4a5540f148b05c786b2d563d07) 15505 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a92b9e90d341774e9006bd56a7c9b650c) (classParma__Polyhedra__Library_1_1Powerset_ac26b963b54a0caf2d13c3af01577a702)]
+>> endobj
+18517 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_ac4cd77344ad58f2051c29770912fba81) 15501 0 R (classParma__Polyhedra__Library_1_1Powerset_aca824a578b979ffb69e85022a847aa29) 15555 0 R (classParma__Polyhedra__Library_1_1Powerset_ad25e2d27e5d731e6b63fb84a65700faf) 15458 0 R (classParma__Polyhedra__Library_1_1Powerset_ad34bafd07f582c558936f9ea8892abd6) 15602 0 R (classParma__Polyhedra__Library_1_1Powerset_adab8b3f43dd9a5e707b95e15a9c282f8) 15495 0 R (classParma__Polyhedra__Library_1_1Powe [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_ac4cd77344ad58f2051c29770912fba81) (classParma__Polyhedra__Library_1_1Powerset_ae61b8233ebbfce8a9feeb4018265b734)]
+>> endobj
+18518 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Powerset_aebef0c6c47af055bfb03332886019aa1) 15573 0 R (classParma__Polyhedra__Library_1_1Powerset_aee9b737150b5b96ae9ff85b9f0cec535) 15510 0 R (classParma__Polyhedra__Library_1_1Powerset_af7c0e7d0ee07ead390818cd2b34089b8) 15511 0 R (classParma__Polyhedra__Library_1_1Powerset_afe83427c5f1ad69dbc3b9a8bf22946c1) 15561 0 R (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction) 1973 0 R (classParma__Polyhedra__Library_1_1Shape__Preserving__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_aebef0c6c47af055bfb03332886019aa1) (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_abdb0ca782331e07ae621657aaa308810)]
+>> endobj
+18519 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_abecc6b6a4233ade3181b254fe7c005f0) 15668 0 R (classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_ad5d7e854d7a70d0bfaa9d04fa0127454) 15667 0 R (classParma__Polyhedra__Library_1_1Smash__Reduction) 1974 0 R (classParma__Polyhedra__Library_1_1Smash__Reduction_a4c129841def42c25fe6b521871107eaa) 15685 0 R (classParma__Polyhedra__Library_1_1Smash__Reduction_a7b1c5cb64b4a03090300e0228209187f) 15690 0 R (classParm [...]
+/Limits [(classParma__Polyhedra__Library_1_1Shape__Preserving__Reduction_abecc6b6a4233ade3181b254fe7c005f0) (classParma__Polyhedra__Library_1_1Smash__Reduction_ac4b52696d07221d118e0717c9091c391)]
+>> endobj
+18520 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) 1234 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a11a03a73950216b9010c2350cf5ea7e3) 15727 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a1e3eb354a88609b46573e1dc2ce6dba9) 15726 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a3176e4afbc2c084e48afe86d8512e057) 15753 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression [...]
+/Limits [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression) (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a5cd04912407d0b7f7c3e4bf9becff0bf)]
+>> endobj
+18521 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a74fd79622aa9418de9e842a0d72bbcbe) 15729 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_aa2c3ce51f68aadd03339865f90fc6d41) 15754 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_aaba6bdfeae05d8463a8208b0c6b7a62a) 15728 0 R (classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_acf7ac787c211436eb1f3710b8e4e07f0) 7518 0 R (classParma__Polyhedra__Library_1 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Sum__Floating__Point__Expression_a74fd79622aa9418de9e842a0d72bbcbe) (classParma__Polyhedra__Library_1_1Throwable)]
+>> endobj
+18522 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Throwable_a14c081beabe1e165b1dc44b2a84b6c2b) 15794 0 R (classParma__Polyhedra__Library_1_1Throwable_a5024cc2b142473f5f733a8808cb09162) 15795 0 R (classParma__Polyhedra__Library_1_1Unary__Operator) 1978 0 R (classParma__Polyhedra__Library_1_1Unary__Operator__Common) 1979 0 R (classParma__Polyhedra__Library_1_1Unary__Operator__Common_a56b1bfd700c1f088b6be622b7b67a257) 15818 0 R (classParma__Polyhedra__Library_1_1Unary__Operator__Common_aba21572aeb [...]
+/Limits [(classParma__Polyhedra__Library_1_1Throwable_a14c081beabe1e165b1dc44b2a84b6c2b) (classParma__Polyhedra__Library_1_1Unary__Operator__Common_aba21572aebe99f81b7f09b75f3b2d903)]
+>> endobj
+18523 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variable) 1980 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression) 1232 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a082d6ea17c164846898241075349cd31) 15941 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a0ca3ec141b70de5ebcbf18d22aa1242f) 15944 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a104ead3dc8b407e3246dc9e3c6040713) 159 [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variable) (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a39f667f349cf531d9948abac9bdc0250)]
+>> endobj
+18524 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a6b20922fdda0a1d3edcd6e642d882f68) 7519 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a72b690903949d7e94dd627f7b49ab4cb) 15940 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a7ddc454f90fc8200f333eee7896deb1e) 15943 0 R (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_aa216cf725abad2dd8e9fe71fc4555880) 15970 0 R (classParma__ [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a6b20922fdda0a1d3edcd6e642d882f68) (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_af41610855fb92674656e2f24427f002b)]
+>> endobj
+18525 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variable_a2617e76e0aef9021ef98ea381cd1ac3c) 15882 0 R (classParma__Polyhedra__Library_1_1Variable_a394f0886d3b63fd890fdf9ee7c6cf2f2) 15866 0 R (classParma__Polyhedra__Library_1_1Variable_a44e2225e59844067e005297572cd9ca5) 15879 0 R (classParma__Polyhedra__Library_1_1Variable_a49b4a338d3d82bfb7a404ea87481fc4d) 15870 0 R (classParma__Polyhedra__Library_1_1Variable_a4f6d85b054ae413ec0b77ff6522b7304) 15880 0 R (classParma__Polyhedra__Library_1_1Vari [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variable_a2617e76e0aef9021ef98ea381cd1ac3c) (classParma__Polyhedra__Library_1_1Variable_a5012c55d8fdb1420b80a3bfbe5a5b843)]
+>> endobj
+18526 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variable_a616f25ab81383a9c22ff3577a89a74c3) 15883 0 R (classParma__Polyhedra__Library_1_1Variable_a7102c6fe85d4c8e6939d29a047becbdb) 15869 0 R (classParma__Polyhedra__Library_1_1Variable_a75683687bda865c93db529b76271bed2) 15876 0 R (classParma__Polyhedra__Library_1_1Variable_a8dfe38ded52523b20209cce599411c4c) 15878 0 R (classParma__Polyhedra__Library_1_1Variable_aa5f2c0410e128e2f082d761ef36820da) 15874 0 R (classParma__Polyhedra__Library_1_1Vari [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variable_a616f25ab81383a9c22ff3577a89a74c3) (classParma__Polyhedra__Library_1_1Variable_aae21b0f5a4289485ef86a9d11fcbfc50)]
+>> endobj
+18527 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) 15868 0 R (classParma__Polyhedra__Library_1_1Variable_ad71d7986fdfd19215fc87726ebacf555) 15881 0 R (classParma__Polyhedra__Library_1_1Variable_aed0f237309569c2bfbf9e6f60740974e) 15871 0 R (classParma__Polyhedra__Library_1_1Variable_aed36717941671bac2df2568792acb768) 15875 0 R (classParma__Polyhedra__Library_1_1Variables__Set) 2008 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a0b93ff227453cf62d [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variable_abb6a26c12f7bdee7504d577ca81992e0) (classParma__Polyhedra__Library_1_1Variables__Set_a0b93ff227453cf62d922dab902055f8b)]
+>> endobj
+18528 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variables__Set_a32b7f9e0a2f54d199ad55bc008bfa62e) 16024 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a3a5d4b3fb638414792155bcef8b54c1c) 16026 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a3d49b2488d36bda4fef0109bedf6b0cc) 16000 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a4090b6696c19cb93c705d9a9e06f4915) 16023 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a4c3c15515e1335fb69130aad4f371a1c) 16028 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_a32b7f9e0a2f54d199ad55bc008bfa62e) (classParma__Polyhedra__Library_1_1Variables__Set_a4e8f85cded8a6be1916c2cc0bb31c540)]
+>> endobj
+18529 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variables__Set_a587efac6e5a2fbde0a1866dbe4427224) 16031 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a6e710cc6607e4ec2791b182707bb4f1f) 16036 0 R (classParma__Polyhedra__Library_1_1Variables__Set_a7176b36adef9683aae06961175ad94cb) 16022 0 R (classParma__Polyhedra__Library_1_1Variables__Set_ab90c3d16fa19df74d838587f40d74477) 16001 0 R (classParma__Polyhedra__Library_1_1Variables__Set_aca3690ce9d77a85740cdf8a508edf127) 16029 0 R (classPar [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_a587efac6e5a2fbde0a1866dbe4427224) (classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371)]
+>> endobj
+18530 0 obj <<
+/Names [(classParma__Polyhedra__Library_1_1Variables__Set_afbcfd5d585123fad758b763b4e2ed336) 15999 0 R (classParma__Polyhedra__Library_1_1Watchdog) 2009 0 R (classParma__Polyhedra__Library_1_1Watchdog_a0f5f7c074992bb3c4464fa554490fb3d) 16050 0 R (classParma__Polyhedra__Library_1_1Watchdog_ac051318c19299feb9e33e822a773e8a7) 16049 0 R (classParma__Polyhedra__Library_1_1Watchdog_ad5a1348ca7621bbaac38c11716affd61) 16052 0 R (classParma__Polyhedra__Library_1_1Watchdog_ae59da834d6abca4c75ec2cb [...]
+/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_afbcfd5d585123fad758b763b4e2ed336) (classParma__Polyhedra__Library_1_1Watchdog_ae59da834d6abca4c75ec2cba498871f5)]
+>> endobj
+18531 0 obj <<
+/Names [(group__PPL__CXX__interface) 2004 0 R (group__PPL__CXX__interface_ga00a906832c41c42a70a5c9d194e07a7d) 2298 0 R (group__PPL__CXX__interface_ga113f1e845cba6b1c3c5705d0e14f1cc1) 2260 0 R (group__PPL__CXX__interface_ga13bf4cf2db045bfd362c5c8aae7f785b) 2341 0 R (group__PPL__CXX__interface_ga1755dd7580d51df2976efb2f0275790e) 2336 0 R (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae) 2253 0 R]
+/Limits [(group__PPL__CXX__interface) (group__PPL__CXX__interface_ga1c2a279a3ffa1d1e9947f2667be312ae)]
+>> endobj
+18532 0 obj <<
+/Names [(group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) 2384 0 R (group__PPL__CXX__interface_ga233295f67896774a4fa42920a4b8522b) 2385 0 R (group__PPL__CXX__interface_ga25ea3a289eadef732f4c7fd823387fb2) 2244 0 R (group__PPL__CXX__interface_ga266a81f442cf72bfded10a4ecb79f130) 2337 0 R (group__PPL__CXX__interface_ga2a514a2edd5c272133f56c6cec381142) 2354 0 R (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13) 2280 0 R]
+/Limits [(group__PPL__CXX__interface_ga2173e32c6bc6800c0d43b2a92ad49fb6) (group__PPL__CXX__interface_ga2bd5ce486a5d2d2f1c8feef003906d13)]
+>> endobj
+18533 0 obj <<
+/Names [(group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) 2142 0 R (group__PPL__CXX__interface_ga34d9dfd53548ce172ae94462d24f41e6) 2352 0 R (group__PPL__CXX__interface_ga3895a522ff33b50d1540541ef2fcd9e9) 2360 0 R (group__PPL__CXX__interface_ga3ccd0ef2cbdc282106525b2f0e734c7e) 2349 0 R (group__PPL__CXX__interface_ga3e0617011cb5b87be0b1d614fbcfbe7d) 2382 0 R (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f) 2283 0 R]
+/Limits [(group__PPL__CXX__interface_ga2c7a4b4311ef3639f73f40b414376899) (group__PPL__CXX__interface_ga41d2435f434bd8ef0f23cb68622b1f6f)]
+>> endobj
+18534 0 obj <<
+/Names [(group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) 2381 0 R (group__PPL__CXX__interface_ga470bfc567789301bfdc28fd70ed82f92) 2362 0 R (group__PPL__CXX__interface_ga4c655d3e5468ef60a37ff40ac0f744f6) 2357 0 R (group__PPL__CXX__interface_ga4fcd1fb98a48b131a0448fb694cb9504) 2359 0 R (group__PPL__CXX__interface_ga56eb4e32ec57658bc9e7823cd42ecbae) 2344 0 R (group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1) 2345 0 R]
+/Limits [(group__PPL__CXX__interface_ga46ae7a59153f96588076702dc876c4aa) (group__PPL__CXX__interface_ga5d78cb515ce33c9a54c7fd82098d06e1)]
+>> endobj
+18535 0 obj <<
+/Names [(group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) 2343 0 R (group__PPL__CXX__interface_ga60f87e33c0dde9f5c2c7d3b4b78818ab) 2361 0 R (group__PPL__CXX__interface_ga61102bed0c7780ab782fcc8cd57a384a) 2273 0 R (group__PPL__CXX__interface_ga616fcdc7600a3a11a8a9152e75730899) 2250 0 R (group__PPL__CXX__interface_ga62bbf00f3cdb29436772c58f7f2bb67e) 2350 0 R (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0) 2346 0 R]
+/Limits [(group__PPL__CXX__interface_ga5eff576922bf3646f7dd85cb1a05b93c) (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0)]
+>> endobj
+18536 0 obj <<
+/Names [(group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) 2353 0 R (group__PPL__CXX__interface_ga73813939ed838a85ae565152ba3cb6fd) 2267 0 R (group__PPL__CXX__interface_ga760aa1f95d13e389ec6eb33fdbf88783) 2141 0 R (group__PPL__CXX__interface_ga7968ac8ddb26250cb705117e6ed23048) 2355 0 R (group__PPL__CXX__interface_ga79bd3696a302bb721ef8168fa5d650fb) 2139 0 R (group__PPL__CXX__interface_ga7a529f51bfebdd4b3e69c866dced9bc1) 2124 0 R]
+/Limits [(group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) (group__PPL__CXX__interface_ga7a529f51bfebdd4b3e69c866dced9bc1)]
+>> endobj
+18537 0 obj <<
+/Names [(group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) 2358 0 R (group__PPL__CXX__interface_ga809c78f95611c4b838b4e8f097a03e32) 2348 0 R (group__PPL__CXX__interface_ga8458e58a5e857de11c35ce3076a70ab8) 2137 0 R (group__PPL__CXX__interface_ga84cc2bd35e1437f8df3be984dd1f4638) 2276 0 R (group__PPL__CXX__interface_ga853432469169b07e42c557e1d6d144de) 2140 0 R (group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d) 2383 0 R]
+/Limits [(group__PPL__CXX__interface_ga7e927a18b0f68715e9721e7f62e82b38) (group__PPL__CXX__interface_ga899c609558397160b3227c19d6ccc82d)]
+>> endobj
+18538 0 obj <<
+/Names [(group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) 2339 0 R (group__PPL__CXX__interface_ga984f2c32e934b6510731f6a7faf28296) 2342 0 R (group__PPL__CXX__interface_gaa7159523299c8f193184a1bda20d6044) 2291 0 R (group__PPL__CXX__interface_gaa88e9b9cb2588cbf5914695fc14e69a8) 2143 0 R (group__PPL__CXX__interface_gaac82e7e0179442ef589f2fc61302d654) 2264 0 R (group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca) 2351 0 R]
+/Limits [(group__PPL__CXX__interface_ga95f3cc785d7b89f59b3ca216461c34b0) (group__PPL__CXX__interface_gaad2f9666d98048451c6cfe54e37b16ca)]
+>> endobj
+18539 0 obj <<
+/Names [(group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) 2386 0 R (group__PPL__CXX__interface_gabadfeba0a415d210cdd6d7309365e800) 2138 0 R (group__PPL__CXX__interface_gac40e401b77b5ec6e9625c317ce6d760d) 2340 0 R (group__PPL__CXX__interface_gadf9d6f17d8974c81e3499f170e7762a2) 2294 0 R (group__PPL__CXX__interface_gae19dfe022c51c874d905e2a7c81c18f1) 2136 0 R (group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b) 2338 0 R]
+/Limits [(group__PPL__CXX__interface_gab5cd24a1e332f51c649d05482bc7c90a) (group__PPL__CXX__interface_gae45a5a00d54a1e42ac214eab207d720b)]
+>> endobj
+18540 0 obj <<
+/Names [(group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) 2347 0 R (group__PPL__CXX__interface_gafdc6a039a856c60836df918848a21416) 2356 0 R (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a40409716eac06f7ee5c44a200d3702f0) 2263 0 R (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1a71c9b0459dc8ba8cc0c8178b6cf4f017) 2261 0 R (group__PPL__CXX__interface_gga113f1e845cba6b1c3c5705d0e14f1cc1ab39e3c667ce455313f8ff578722af2e9) 2262 0 R (group__PPL__CXX_ [...]
+/Limits [(group__PPL__CXX__interface_gaef6aa41f2904a20dce16a55ee8073a38) (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea079e4b80f17b0095497103a52cffa3ab)]
+>> endobj
+18541 0 obj <<
+/Names [(group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) 2254 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea556cc08f48e769b9c15bea83d5d883a1) 2255 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea8191bdbdcd041a9859ed465d16062ab1) 2259 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea94cf20719046117aece5acba61dcae4d) 2257 0 R (group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667 [...]
+/Limits [(group__PPL__CXX__interface_gga1c2a279a3ffa1d1e9947f2667be312aea3e4424ce8e7ebe86e125541b561fc300) (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb)]
+>> endobj
+18542 0 obj <<
+/Names [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) 2246 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2abeee33de6f8542b0228161d044640eaa) 2245 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2ae0c0414fd69996a2edb8ea476ab236e1) 2249 0 R (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aeafcc7ca16bda73dc6b0f7deaf9470dd) 2248 0 R (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef00 [...]
+/Limits [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) (group__PPL__CXX__interface_gga2bd5ce486a5d2d2f1c8feef003906d13af0346be78c7e06bbfa7f2876edf54ade)]
+>> endobj
+18543 0 obj <<
+/Names [(group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) 2284 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa28dca27d7ee1f30dd8b1797aa8f26a2d) 2289 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa8d3ab7646117632841be76c043efc39b) 2290 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa9a536188402a81d1494837de4269d35d) 2286 0 R (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb686 [...]
+/Limits [(group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fa0e276f8d715a744e012830a77880eb6c) (group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6fad29b7289ecceb32e5c0020885fb8293d)]
+>> endobj
+18544 0 obj <<
+/Names [(group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) 2287 0 R (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaafd3e20e35e86cff976d68ffc4283c32) 2274 0 R (group__PPL__CXX__interface_gga61102bed0c7780ab782fcc8cd57a384aaf4462ec77078de4bbabb446cf61e5123) 2275 0 R (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e75730899a0edf84fcb94023ff4a7183bf3f8dace5) 2251 0 R (group__PPL__CXX__interface_gga616fcdc7600a3a11a8a9152e7 [...]
+/Limits [(group__PPL__CXX__interface_gga41d2435f434bd8ef0f23cb68622b1f6faf050a7168b9fa5d10468384bfe007c5a) (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda405c8934c8b3f4d8c5ba0b21b674e559)]
+>> endobj
+18545 0 obj <<
+/Names [(group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) 2268 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda9a59b7fa00c2cf8df942badc9c414aef) 2272 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdac58a6ff6765224e937fefbadf45a4860) 2269 0 R (group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fdad09cef587030649e808d0e255b83d1ef) 2270 0 R (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984d [...]
+/Limits [(group__PPL__CXX__interface_gga73813939ed838a85ae565152ba3cb6fda591549aad4d57135c2dcc6fd73daf554) (group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a7b85b6b4c644857c3809eeef6aa35dbb)]
+>> endobj
+18546 0 obj <<
+/Names [(group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) 2277 0 R (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a3b60d6dfe175b3a5d48361ac121f23ae) 2293 0 R (group__PPL__CXX__interface_ggaa7159523299c8f193184a1bda20d6044a7fee51bad737377323f3d7ddb036a74e) 2292 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a02347568b111860e1ac15154a1832252) 2158 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
+/Limits [(group__PPL__CXX__interface_gga84cc2bd35e1437f8df3be984dd1f4638a832f214eaa5bc2ce48e1e2d67473cf10) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0905d51325862cb4db00635875efcff8)]
+>> endobj
+18547 0 obj <<
+/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) 2151 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a202263943c451b9fdfe003b2bc8d0b1f) 2170 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a261922c7bb53bf71459671df868e55da) 2168 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a3d884f787b884a260970cdef004fcc10) 2144 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
+/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a0d808c2d0d6514c33e06445d7aa34270) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057)]
+>> endobj
+18548 0 obj <<
+/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) 2154 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a5912e00d1de38a643d48af1f0e5dd35f) 2163 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a6c817c11198882f3864d8ace4ec326dd) 2150 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a930a62d56d7231cdb1ed57e1d3eff0f7) 2165 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
+/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa0f28596ac7d4a43766fab174c28ccab)]
+>> endobj
+18549 0 obj <<
+/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) 2162 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aaee8efad6ea4263d7aa15cb0db2497ea) 2159 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ab30277f972f730fe26f6cfc39098cc77) 2146 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8abb38c3a22ea0af9a40c568e55afa897b) 2157 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
+/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aa1bf7bec2cb0d949e45c3cd0e25874a6) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ac77955fc77a169347da8820b46c3247b)]
+>> endobj
+18550 0 obj <<
+/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) 2156 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aceefc8c6d25b8e2ae5e538a9f793516e) 2171 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ad5e386c6a05c9656eac42fe9e2cdd8b5) 2148 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8adeb9e65ceecfb8271acec22e00a226ca) 2152 0 R (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc [...]
+/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8aca1ef0806f3a27d811b8f7352d53a21b) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8ae704947d33ff1b60a2475950d5f18ec3)]
+>> endobj
+18551 0 obj <<
+/Names [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) 2164 0 R (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a0e1a601a53491f60c89282fde55b5352) 2266 0 R (group__PPL__CXX__interface_ggaac82e7e0179442ef589f2fc61302d654a324bf568397fdfc332a4c06e7a4facf5) 2265 0 R (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2a53f4353b82f1a10a08b1e756bb7c84ad) 2295 0 R (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170 [...]
+/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8afda2f32e2fc3f61357ce0d9d7813f5fc) (group__PPL__CXX__interface_ggadf9d6f17d8974c81e3499f170e7762a2ab2bc77b49f9450faf5b5f8ca5374421d)]
+>> endobj
+18552 0 obj <<
+/Names [(index) 767 0 R (index_A_Note_on_the_Implementation_of_the_Operators) 1252 0 R (index_Adding_New_Dimensions_to_the_Vector_Space) 926 0 R (index_Adding_a_Disjunct) 1151 0 R (index_Affine_Hyperplanes_and_Half_spaces) 865 0 R (index_Affine_Independence_and_Affine_Dimension) 910 0 R]
+/Limits [(index) (index_Affine_Independence_and_Affine_Dimension)]
+>> endobj
+18553 0 obj <<
+/Names [(index_Anc91) 1273 0 R (index_Approximating_Bounded_Integers) 832 0 R (index_Approximating_Integers) 829 0 R (index_BA05) 1274 0 R (index_BCCetal02) 1041 0 R (index_BDHetal05) 1061 0 R]
+/Limits [(index_Anc91) (index_BDHetal05)]
+>> endobj
+18554 0 obj <<
+/Names [(index_BDHetal06) 1276 0 R (index_BDHetal07) 1278 0 R (index_BFT00) 1279 0 R (index_BFT01) 1293 0 R (index_BGP99) 1208 0 R (index_BHMZ04) 1294 0 R]
+/Limits [(index_BDHetal06) (index_BHMZ04)]
+>> endobj
+18555 0 obj <<
+/Names [(index_BHMZ05_widening) 1054 0 R (index_BHMZ05a) 1060 0 R (index_BHMZ05b) 1295 0 R (index_BHRZ03_widening) 1001 0 R (index_BHRZ03a) 1004 0 R (index_BHRZ03b) 1296 0 R]
+/Limits [(index_BHMZ05_widening) (index_BHRZ03b)]
+>> endobj
+18556 0 obj <<
+/Names [(index_BHRZ05) 1297 0 R (index_BHZ02a) 1298 0 R (index_BHZ02b) 1299 0 R (index_BHZ03a) 1300 0 R (index_BHZ03b) 1209 0 R (index_BHZ04) 1156 0 R]
+/Limits [(index_BHRZ05) (index_BHZ04)]
+>> endobj
+18557 0 obj <<
+/Names [(index_BHZ05) 1302 0 R (index_BHZ06a) 1318 0 R (index_BHZ06b) 1320 0 R (index_BHZ07a) 1321 0 R (index_BHZ07b) 1322 0 R (index_BHZ07c) 1323 0 R]
+/Limits [(index_BHZ05) (index_BHZ07c)]
+>> endobj
+18558 0 obj <<
+/Names [(index_BHZ08a) 1324 0 R (index_BHZ08b) 1325 0 R (index_BHZ09a) 1326 0 R (index_BHZ09b) 1327 0 R (index_BHZ09c) 1328 0 R (index_BHZ09d) 1330 0 R]
+/Limits [(index_BHZ08a) (index_BHZ09d)]
+>> endobj
+18559 0 obj <<
+/Names [(index_BHZ10) 1331 0 R (index_BJT99) 1332 0 R (index_BK89) 1347 0 R (index_BMPZ10) 1348 0 R (index_BMPZ12a) 1349 0 R (index_BMPZ12b) 1350 0 R]
+/Limits [(index_BHZ10) (index_BMPZ12b)]
+>> endobj
+18560 0 obj <<
+/Names [(index_BRZH02a) 1351 0 R (index_BRZH02b) 852 0 R (index_BRZH02c) 1352 0 R (index_Bag97) 1275 0 R (index_Bag98) 1155 0 R (index_Basic_Geometric_Descriptors) 790 0 R]
+/Limits [(index_BRZH02a) (index_Basic_Geometric_Descriptors)]
+>> endobj
+18561 0 obj <<
+/Names [(index_Bounded_Difference_Shapes) 1035 0 R (index_Bounded_Polyhedra) 875 0 R (index_CC76) 1040 0 R (index_CC76_extrapolation) 1055 0 R (index_CC76_interval_widening) 1024 0 R (index_CC79) 1353 0 R]
+/Limits [(index_Bounded_Difference_Shapes) (index_CC79)]
+>> endobj
+18562 0 obj <<
+/Names [(index_CC92) 1354 0 R (index_CH78) 1059 0 R (index_Certificate_Based_Widenings) 1200 0 R (index_Che64) 1355 0 R (index_Che65) 1356 0 R (index_Che68) 1357 0 R]
+/Limits [(index_CC92) (index_Che68)]
+>> endobj
+18563 0 obj <<
+/Names [(index_Collapsing_a_Powerset_Element) 1154 0 R (index_Combinations_and_Hulls) 881 0 R (index_Concatenating_Polyhedra) 924 0 R (index_Congruence_Relations) 1057 0 R (index_Constraint_Geometric_Descriptors) 792 0 R (index_Constraints_Representation) 878 0 R]
+/Limits [(index_Collapsing_a_Powerset_Element) (index_Constraints_Representation)]
+>> endobj
+18564 0 obj <<
+/Names [(index_Convex_Polyhedra) 867 0 R (index_Convex_Polyhedral_Difference) 917 0 R (index_Cylindrification) 977 0 R (index_Dan63) 1364 0 R (index_Double_Description) 894 0 R (index_Dropping_Non_Integer_Points) 830 0 R]
+/Limits [(index_Convex_Polyhedra) (index_Dropping_Non_Integer_Points)]
+>> endobj
+18565 0 obj <<
+/Names [(index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) 942 0 R (index_Extrapolation_Operators) 1018 0 R (index_FCB07) 1365 0 R (index_FP96) 1367 0 R (index_Fea88) 1366 0 R (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension) 945 0 R]
+/Limits [(index_Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions) (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension)]
+>> endobj
+18566 0 obj <<
+/Names [(index_Fuk98) 853 0 R (index_GDDetal04) 949 0 R (index_GJ00) 1369 0 R (index_GJ01) 1370 0 R (index_GR77) 1371 0 R (index_Generalized_Affine_Relations) 967 0 R]
+/Limits [(index_Fuk98) (index_Generalized_Affine_Relations)]
+>> endobj
+18567 0 obj <<
+/Names [(index_Generator_Geometric_Descriptors) 804 0 R (index_Generators_Representation) 890 0 R (index_Generic_Operations_on_Semantic_Geometric_Descriptors) 810 0 R (index_Geometric_Comparisons) 1173 0 R (index_Gra91) 1372 0 R (index_Gra97) 1373 0 R]
+/Limits [(index_Generator_Geometric_Descriptors) (index_Gra97)]
+>> endobj
+18568 0 obj <<
+/Names [(index_Grid_Affine_Dimension) 1091 0 R (index_Grid_Affine_Transformation) 1094 0 R (index_Grid_Extrapolation) 1135 0 R (index_Grid_Frequency) 1106 0 R (index_Grid_Generalized_Image) 1104 0 R (index_Grid_Generator_Representation) 1075 0 R]
+/Limits [(index_Grid_Affine_Dimension) (index_Grid_Generator_Representation)]
+>> endobj
+18569 0 obj <<
+/Names [(index_Grid_Minimized_Representations) 1085 0 R (index_Grid_Relation_With) 1116 0 R (index_Grid_Space_Dimensions) 1089 0 R (index_Grid_Time_Elapse) 1108 0 R (index_Grid_Widening) 1131 0 R (index_Grid_Widening_with_Tokens) 1133 0 R]
+/Limits [(index_Grid_Minimized_Representations) (index_Grid_Widening_with_Tokens)]
+>> endobj
+18570 0 obj <<
+/Names [(index_Grid_Wrapping_Operator) 1118 0 R (index_Grids_Double_Description_Grids) 1087 0 R (index_H79_widening) 1000 0 R (index_HH95) 1375 0 R (index_HHL90) 1383 0 R (index_HKP95) 1384 0 R]
+/Limits [(index_Grid_Wrapping_Operator) (index_HKP95)]
+>> endobj
+18571 0 obj <<
+/Names [(index_HLW94) 1385 0 R (index_HMT71) 984 0 R (index_HPR94) 1386 0 R (index_HPR97) 985 0 R (index_HPWT01) 1387 0 R (index_Hal79) 1003 0 R]
+/Limits [(index_HLW94) (index_Hal79)]
+>> endobj
+18572 0 obj <<
+/Names [(index_Hal93) 1374 0 R (index_Images_and_Preimages_of_Affine_Transfer_Relations) 948 0 R (index_Integer_Combinations) 1071 0 R (index_Intersection_and_Convex_Polyhedral_Hull) 915 0 R (index_Intervals_and_Boxes) 1022 0 R (index_JMSY94) 1389 0 R]
+/Limits [(index_Hal93) (index_JMSY94)]
+>> endobj
+18573 0 obj <<
+/Names [(index_Jea02) 1388 0 R (index_KBBetal06) 1390 0 R (index_Kuh56) 1391 0 R (index_LW97) 1395 0 R (index_Le) 1392 0 R (index_Loe99) 1393 0 R]
+/Limits [(index_Jea02) (index_Loe99)]
+>> endobj
+18574 0 obj <<
+/Names [(index_MRTT53) 1409 0 R (index_Mapping_the_Dimensions_of_the_Vector_Space) 937 0 R (index_Mas92) 1396 0 R (index_Mas93) 1397 0 R (index_Meet_Preserving_Simplification) 981 0 R (index_Meet_and_Upper_Bound) 1148 0 R]
+/Limits [(index_MRTT53) (index_Meet_and_Upper_Bound)]
+>> endobj
+18575 0 obj <<
+/Names [(index_Min01a) 1398 0 R (index_Min01b) 1407 0 R (index_Min02) 1408 0 R (index_Min04) 1212 0 R (index_Min05) 1213 0 R (index_Minimized_Representations) 892 0 R]
+/Limits [(index_Min01a) (index_Minimized_Representations)]
+>> endobj
+18576 0 obj <<
+/Names [(index_NF01) 1410 0 R (index_NJPF99) 1411 0 R (index_NO77) 1412 0 R (index_NO80) 1413 0 R (index_NR00) 1414 0 R (index_NW88) 854 0 R]
+/Limits [(index_NF01) (index_NW88)]
+>> endobj
+18577 0 obj <<
+/Names [(index_Octagonal_Shapes) 1037 0 R (index_On_Const_Correctness_A_Warning_about_the_Use_of_References_and_Iterators) 1264 0 R (index_On_Object_Orientation_and_Polymorphism_A_Disclaimer) 1262 0 R (index_On_Pointset_Powerset_and_Partially_Reduced_Product_Domains_A_Warning) 1260 0 R (index_Operations_on_Convex_Polyhedra) 914 0 R (index_PS98) 1416 0 R]
+/Limits [(index_Octagonal_Shapes) (index_PS98)]
+>> endobj
+18578 0 obj <<
+/Names [(index_Pairwise_Merge) 1176 0 R (index_Points_Closure_Points_Rays_and_Lines) 883 0 R (index_Points_Parameters_Lines) 1073 0 R (index_Powerset_Extrapolation_Operators) 1196 0 R (index_Powerset_Meet_Preserving_Simplification) 1002 0 R (index_Pra77) 1415 0 R]
+/Limits [(index_Pairwise_Merge) (index_Pra77)]
+>> endobj
+18579 0 obj <<
+/Names [(index_QRR96) 1417 0 R (index_QRR97) 1418 0 R (index_QRW00) 1419 0 R (index_RBL06) 1428 0 R (index_Rational_Grids) 1069 0 R (index_Rational_Polyhedra) 912 0 R]
+/Limits [(index_QRR96) (index_Rational_Polyhedra)]
+>> endobj
+18580 0 obj <<
+/Names [(index_Relation_With_Operators) 996 0 R (index_Removing_Dimensions_from_the_Vector_Space) 928 0 R (index_Ric02) 1429 0 R (index_SK07) 851 0 R (index_SS07a) 1432 0 R (index_SS07b) 1433 0 R]
+/Limits [(index_Relation_With_Operators) (index_SS07b)]
+>> endobj
+18581 0 obj <<
+/Names [(index_SW70) 1434 0 R (index_Sch99) 1097 0 R (index_Semantic_Geometric_Descriptors) 769 0 R (index_Sho81) 1430 0 R (index_Single_Update_Affine_Functions) 956 0 R (index_Single_Update_Bounded_Affine_Relations) 963 0 R]
+/Limits [(index_SW70) (index_Single_Update_Bounded_Affine_Relations)]
+>> endobj
+18582 0 obj <<
+/Names [(index_Space_Dimensions_and_Dimension_Compatibility) 902 0 R (index_Sri93) 1431 0 R (index_Syntactic_Geometric_Descriptors) 788 0 R (index_The_Powerset_Domain) 1144 0 R (index_Time_Elapse_Operator) 979 0 R (index_Topologies_and_Topological_compatibility) 869 0 R]
+/Limits [(index_Space_Dimensions_and_Dimension_Compatibility) (index_Topologies_and_Topological_compatibility)]
+>> endobj
+18583 0 obj <<
+/Names [(index_Upward_Approximation) 822 0 R (index_Vectors_Matrices_and_Scalar_Products) 849 0 R (index_War03) 1435 0 R (index_Weakly_Relational_Shape_Interface) 1039 0 R (index_Weakly_Relational_Shapes) 1034 0 R (index_Wey35) 1436 0 R]
+/Limits [(index_Upward_Approximation) (index_Wey35)]
+>> endobj
+18584 0 obj <<
+/Names [(index_Wey50) 1437 0 R (index_Widening_Operators) 998 0 R (index_Widening_and_Extrapolation_Operators_on_Boxes) 1032 0 R (index_Widening_and_Extrapolation_Operators_on_WR_Shapes) 1052 0 R (index_Widening_with_Tokens) 1015 0 R (index_Wil93) 855 0 R]
+/Limits [(index_Wey50) (index_Wil93)]
+>> endobj
+18585 0 obj <<
+/Names [(index_Wrapping_Operator) 847 0 R (index_affine_form_relation) 965 0 R (index_affine_relation) 947 0 R (index_bibliography) 1272 0 R (index_bounded_extrapolation) 1021 0 R (index_convex_polys) 774 0 R]
+/Limits [(index_Wrapping_Operator) (index_convex_polys)]
+>> endobj
+18586 0 obj <<
+/Names [(index_expand_space_dimension) 941 0 R (index_floating_point) 1204 0 R (index_fold_space_dimensions) 944 0 R (index_fp_abstract_domains) 1249 0 R (index_interval_linear_forms) 1205 0 R (index_intervals) 1023 0 R]
+/Limits [(index_expand_space_dimension) (index_intervals)]
+>> endobj
+18587 0 obj <<
+/Names [(index_limited_extrapolation) 1020 0 R (index_pointset_powerset) 1157 0 R (index_powerset) 1137 0 R (index_powerset_domain) 1143 0 R (index_pps_bgp99_extrapolation) 1195 0 R (index_pps_certificate_widening) 1199 0 R]
+/Limits [(index_limited_extrapolation) (index_pps_certificate_widening)]
+>> endobj
+18588 0 obj <<
+/Names [(index_pps_geometric) 1172 0 R (index_pps_pairwise_merge) 1175 0 R (index_preamble) 768 0 R (index_ps_add_disjunct) 1150 0 R (index_ps_collapse) 1153 0 R (index_ps_meet_upper_bound) 1147 0 R]
+/Limits [(index_pps_geometric) (index_ps_meet_upper_bound)]
+>> endobj
+18589 0 obj <<
+/Names [(index_ps_operations) 1146 0 R (index_rational_grid_operations) 1093 0 R (index_relation_with) 995 0 R (index_representation) 877 0 R (index_sect_rational_grids) 1056 0 R (index_use_of_library) 775 0 R]
+/Limits [(index_ps_operations) (index_use_of_library)]
+>> endobj
+18590 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library) 1554 0 R (namespaceParma__Polyhedra__Library_1_1IO__Operators) 1555 0 R (namespaceParma__Polyhedra__Library_1_1IO__Operators_a9ccf426c9d89537e0351aac50a333e95) 2963 0 R (namespaceParma__Polyhedra__Library_a03ed91fbbeb6d32952c5d2a30bfd3830) 2797 0 R (namespaceParma__Polyhedra__Library_a05dd6b345e96427a50b45f9756e302ab) 2798 0 R (namespaceParma__Polyhedra__Library_a0adf6106892886dc859985042b8a7433) 2802 0 R]
+/Limits [(namespaceParma__Polyhedra__Library) (namespaceParma__Polyhedra__Library_a0adf6106892886dc859985042b8a7433)]
+>> endobj
+18591 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_a19b0ebdb3476fe1feb0f51d9328fd384) 2889 0 R (namespaceParma__Polyhedra__Library_a20874a85120477d5cf11da451870d497) 2795 0 R (namespaceParma__Polyhedra__Library_a30a5addfb775d0e3586f1575ece47bf6) 2796 0 R (namespaceParma__Polyhedra__Library_a3bb2c0ddb1b766959ee6149bb52a7e61) 2721 0 R (namespaceParma__Polyhedra__Library_a3e6dcd6f5d8e3ea263c9205b21a83e48) 2884 0 R (namespaceParma__Polyhedra__Library_a5604f97d216583cdf012a50d2f8cdbde) 2877 0 R]
+/Limits [(namespaceParma__Polyhedra__Library_a19b0ebdb3476fe1feb0f51d9328fd384) (namespaceParma__Polyhedra__Library_a5604f97d216583cdf012a50d2f8cdbde)]
+>> endobj
+18592 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_a5e801a56c2c3dcec13d2d87adf07ac47) 2886 0 R (namespaceParma__Polyhedra__Library_a63bd7c7767faf3c219f9c2762095e2dd) 2804 0 R (namespaceParma__Polyhedra__Library_a66438955854cf73ddaf27a40a69fec7b) 2800 0 R (namespaceParma__Polyhedra__Library_a6a54c55d8b52ef353df7cefdfa632d8d) 2885 0 R (namespaceParma__Polyhedra__Library_a6c841f33162c2419bd53a078e6c788ee) 2805 0 R (namespaceParma__Polyhedra__Library_a74074a5ed3718745a4d82bacd5b381ed) 2883 0 R]
+/Limits [(namespaceParma__Polyhedra__Library_a5e801a56c2c3dcec13d2d87adf07ac47) (namespaceParma__Polyhedra__Library_a74074a5ed3718745a4d82bacd5b381ed)]
+>> endobj
+18593 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) 2799 0 R (namespaceParma__Polyhedra__Library_a99e9dc5df3cf7c0ab581e602d1176e41) 2879 0 R (namespaceParma__Polyhedra__Library_a9c118832fed4c0b9b40547578459dad4) 2881 0 R (namespaceParma__Polyhedra__Library_abdd9791a8d91b11a5bd3a6ef0770bc86) 2803 0 R (namespaceParma__Polyhedra__Library_ac3020576e4171dbe16a6979ab672d833) 2720 0 R (namespaceParma__Polyhedra__Library_aca6003248d614d68c07f5330b468a242) 2801 0 R]
+/Limits [(namespaceParma__Polyhedra__Library_a93c37cc32a1f50c36ec15d67fdbec3aa) (namespaceParma__Polyhedra__Library_aca6003248d614d68c07f5330b468a242)]
+>> endobj
+18594 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) 2722 0 R (namespaceParma__Polyhedra__Library_ace0cdceaa0c7eea84cc1c38cf5bea680) 2880 0 R (namespaceParma__Polyhedra__Library_ad31eeb0067d6cad2eb2ea5ab5bd0a2b2) 2882 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8) 2723 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a9606fc251d767040929d3e2645dbb446) 2727 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c9 [...]
+/Limits [(namespaceParma__Polyhedra__Library_acbcc9c464e7d910f38ad2534e49ff925) (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a96b8890edb38e9960c455aa178e508ba)]
+>> endobj
+18595 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a979f37a289d4cb316643f1dcc07ec7cd) 2726 0 R (namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8abd640c30f757e4ecccd08ac527536ca6) 2725 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98) 2728 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a44ed03f4b908d58ac405493b10be3012) 2734 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a0 [...]
+/Limits [(namespaceParma__Polyhedra__Library_ada2f48b1fec9c98a2ddb26953ed1cfb8a979f37a289d4cb316643f1dcc07ec7cd) (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c)]
+>> endobj
+18596 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9223ac459b80b2eb397dd7810be7aa07) 2733 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9afce68d66f8c8eedec345f8df2e822f) 2730 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98accf532c4e56a06e520b6b3f638371667) 2732 0 R (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98ae9e9040024adaad2b7a0d9ceea0c8b62) 2731 0 R (namespaceParma__Polyhedra__Libr [...]
+/Limits [(namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9223ac459b80b2eb397dd7810be7aa07) (namespaceParma__Polyhedra__Library_aee4e9b54e65780ac3010fda40ea235a6)]
+>> endobj
+18597 0 obj <<
+/Names [(namespaceParma__Polyhedra__Library_af127b16b1a8e300aa97caca515284b6f) 2878 0 R (namespaceParma__Polyhedra__Library_af9dd9190c5f29dbbfa3d6e442dea7e7d) 2876 0 R (namespacestd) 1556 0 R (page.1) 534 0 R (page.10) 888 0 R (page.100) 3313 0 R]
+/Limits [(namespaceParma__Polyhedra__Library_af127b16b1a8e300aa97caca515284b6f) (page.100)]
+>> endobj
+18598 0 obj <<
+/Names [(page.101) 3410 0 R (page.102) 3486 0 R (page.103) 3516 0 R (page.104) 3529 0 R (page.104d) 16191 0 R (page.105) 3537 0 R]
+/Limits [(page.101) (page.105)]
+>> endobj
+18599 0 obj <<
+/Names [(page.106) 3551 0 R (page.107) 3565 0 R (page.108) 3581 0 R (page.109) 3596 0 R (page.11) 900 0 R (page.110) 3610 0 R]
+/Limits [(page.106) (page.110)]
+>> endobj
+18600 0 obj <<
+/Names [(page.111) 3626 0 R (page.112) 3641 0 R (page.113) 3657 0 R (page.114) 3677 0 R (page.115) 3693 0 R (page.116) 3709 0 R]
+/Limits [(page.111) (page.116)]
+>> endobj
+18601 0 obj <<
+/Names [(page.117) 3726 0 R (page.118) 3742 0 R (page.119) 3758 0 R (page.12) 909 0 R (page.120) 3776 0 R (page.121) 3790 0 R]
+/Limits [(page.117) (page.121)]
+>> endobj
+18602 0 obj <<
+/Names [(page.122) 3810 0 R (page.123) 3828 0 R (page.124) 3844 0 R (page.125) 3864 0 R (page.126) 3885 0 R (page.127) 3909 0 R]
+/Limits [(page.122) (page.127)]
+>> endobj
+18603 0 obj <<
+/Names [(page.128) 3930 0 R (page.129) 3964 0 R (page.13) 922 0 R (page.130) 4046 0 R (page.131) 4130 0 R (page.132) 4205 0 R]
+/Limits [(page.128) (page.132)]
+>> endobj
+18604 0 obj <<
+/Names [(page.133) 4299 0 R (page.134) 4360 0 R (page.135) 4387 0 R (page.135d) 16287 0 R (page.136) 4402 0 R (page.137) 4416 0 R]
+/Limits [(page.133) (page.137)]
+>> endobj
+18605 0 obj <<
+/Names [(page.138) 4431 0 R (page.139) 4446 0 R (page.14) 936 0 R (page.140) 4460 0 R (page.141) 4476 0 R (page.142) 4492 0 R]
+/Limits [(page.138) (page.142)]
+>> endobj
+18606 0 obj <<
+/Names [(page.143) 4507 0 R (page.144) 4524 0 R (page.145) 4544 0 R (page.146) 4560 0 R (page.147) 4579 0 R (page.148) 4596 0 R]
+/Limits [(page.143) (page.148)]
+>> endobj
+18607 0 obj <<
+/Names [(page.149) 4612 0 R (page.15) 954 0 R (page.150) 4632 0 R (page.151) 4647 0 R (page.152) 4664 0 R (page.153) 4678 0 R]
+/Limits [(page.149) (page.153)]
+>> endobj
+18608 0 obj <<
+/Names [(page.154) 4697 0 R (page.155) 4712 0 R (page.156) 4728 0 R (page.157) 4778 0 R (page.158) 4824 0 R (page.158d) 16381 0 R]
+/Limits [(page.154) (page.158d)]
+>> endobj
+18609 0 obj <<
+/Names [(page.159) 4841 0 R (page.16) 962 0 R (page.160) 4857 0 R (page.161) 4871 0 R (page.162) 4889 0 R (page.163) 4925 0 R]
+/Limits [(page.159) (page.163)]
+>> endobj
+18610 0 obj <<
+/Names [(page.164) 4948 0 R (page.165) 4980 0 R (page.166) 5038 0 R (page.167) 5096 0 R (page.168) 5150 0 R (page.169) 5177 0 R]
+/Limits [(page.164) (page.169)]
+>> endobj
+18611 0 obj <<
+/Names [(page.17) 975 0 R (page.170) 5198 0 R (page.171) 5247 0 R (page.172) 5264 0 R (page.173) 5277 0 R (page.174) 5290 0 R]
+/Limits [(page.17) (page.174)]
+>> endobj
+18612 0 obj <<
+/Names [(page.175) 5299 0 R (page.176) 5312 0 R (page.177) 5330 0 R (page.178) 5363 0 R (page.179) 5412 0 R (page.18) 993 0 R]
+/Limits [(page.175) (page.18)]
+>> endobj
+18613 0 obj <<
+/Names [(page.180) 5479 0 R (page.181) 5554 0 R (page.182) 5618 0 R (page.183) 5641 0 R (page.184) 5653 0 R (page.185) 5668 0 R]
+/Limits [(page.180) (page.185)]
+>> endobj
+18614 0 obj <<
+/Names [(page.186) 5682 0 R (page.187) 5715 0 R (page.188) 5776 0 R (page.189) 5838 0 R (page.19) 1014 0 R (page.190) 5872 0 R]
+/Limits [(page.186) (page.190)]
+>> endobj
+18615 0 obj <<
+/Names [(page.191) 5883 0 R (page.192) 5900 0 R (page.193) 5918 0 R (page.194) 5957 0 R (page.195) 5995 0 R (page.196) 6039 0 R]
+/Limits [(page.191) (page.196)]
+>> endobj
+18616 0 obj <<
+/Names [(page.197) 6071 0 R (page.198) 6094 0 R (page.199) 6110 0 R (page.2) 547 0 R (page.20) 1031 0 R (page.200) 6131 0 R]
+/Limits [(page.197) (page.200)]
+>> endobj
+18617 0 obj <<
+/Names [(page.201) 6162 0 R (page.202) 6192 0 R (page.203) 6210 0 R (page.204) 6244 0 R (page.205) 6275 0 R (page.206) 6294 0 R]
+/Limits [(page.201) (page.206)]
+>> endobj
+18618 0 obj <<
+/Names [(page.207) 6333 0 R (page.208) 6359 0 R (page.209) 6414 0 R (page.21) 1050 0 R (page.210) 6475 0 R (page.211) 6563 0 R]
+/Limits [(page.207) (page.211)]
+>> endobj
+18619 0 obj <<
+/Names [(page.212) 6709 0 R (page.213) 6745 0 R (page.214) 6756 0 R (page.215) 6767 0 R (page.216) 6784 0 R (page.216d) 16819 0 R]
+/Limits [(page.212) (page.216d)]
+>> endobj
+18620 0 obj <<
+/Names [(page.217) 6798 0 R (page.217d) 16820 0 R (page.218) 6816 0 R (page.219) 6839 0 R (page.22) 1068 0 R (page.220) 6898 0 R]
+/Limits [(page.217) (page.220)]
+>> endobj
+18621 0 obj <<
+/Names [(page.221) 6951 0 R (page.222) 6972 0 R (page.223) 7001 0 R (page.224) 7026 0 R (page.225) 7069 0 R (page.226) 7105 0 R]
+/Limits [(page.221) (page.226)]
+>> endobj
+18622 0 obj <<
+/Names [(page.227) 7153 0 R (page.228) 7181 0 R (page.229) 7197 0 R (page.23) 1083 0 R (page.230) 7236 0 R (page.231) 7262 0 R]
+/Limits [(page.227) (page.231)]
+>> endobj
+18623 0 obj <<
+/Names [(page.232) 7280 0 R (page.233) 7301 0 R (page.234) 7343 0 R (page.235) 7391 0 R (page.236) 7417 0 R (page.237) 7434 0 R]
+/Limits [(page.232) (page.237)]
+>> endobj
+18624 0 obj <<
+/Names [(page.238) 7470 0 R (page.239) 7485 0 R (page.24) 1103 0 R (page.240) 7505 0 R (page.241) 7533 0 R (page.242) 7546 0 R]
+/Limits [(page.238) (page.242)]
+>> endobj
+18625 0 obj <<
+/Names [(page.243) 7580 0 R (page.244) 7642 0 R (page.245) 7728 0 R (page.246) 7836 0 R (page.247) 7948 0 R (page.248) 7993 0 R]
+/Limits [(page.243) (page.248)]
+>> endobj
+18626 0 obj <<
+/Names [(page.249) 8032 0 R (page.25) 1114 0 R (page.250) 8048 0 R (page.251) 8060 0 R (page.252) 8077 0 R (page.253) 8098 0 R]
+/Limits [(page.249) (page.253)]
+>> endobj
+18627 0 obj <<
+/Names [(page.253d) 17224 0 R (page.254) 8117 0 R (page.255) 8127 0 R (page.255d) 16662 0 R (page.256) 8136 0 R (page.257) 8152 0 R]
+/Limits [(page.253d) (page.257)]
+>> endobj
+18628 0 obj <<
+/Names [(page.258) 8206 0 R (page.259) 8257 0 R (page.26) 1130 0 R (page.260) 8284 0 R (page.261) 8291 0 R (page.262) 8324 0 R]
+/Limits [(page.258) (page.262)]
+>> endobj
+18629 0 obj <<
+/Names [(page.263) 8400 0 R (page.264) 8424 0 R (page.265) 8455 0 R (page.266) 8533 0 R (page.267) 8610 0 R (page.268) 8696 0 R]
+/Limits [(page.263) (page.268)]
+>> endobj
+18630 0 obj <<
+/Names [(page.269) 8788 0 R (page.27) 1142 0 R (page.270) 8853 0 R (page.271) 8898 0 R (page.272) 8918 0 R (page.273) 8929 0 R]
+/Limits [(page.269) (page.273)]
+>> endobj
+18631 0 obj <<
+/Names [(page.274) 8935 0 R (page.274d) 16598 0 R (page.275) 8943 0 R (page.276) 8958 0 R (page.277) 8973 0 R (page.278) 8987 0 R]
+/Limits [(page.274) (page.278)]
+>> endobj
+18632 0 obj <<
+/Names [(page.279) 9005 0 R (page.28) 1166 0 R (page.280) 9021 0 R (page.281) 9033 0 R (page.282) 9048 0 R (page.283) 9064 0 R]
+/Limits [(page.279) (page.283)]
+>> endobj
+18633 0 obj <<
+/Names [(page.284) 9078 0 R (page.285) 9096 0 R (page.286) 9115 0 R (page.287) 9134 0 R (page.288) 9150 0 R (page.289) 9165 0 R]
+/Limits [(page.284) (page.289)]
+>> endobj
+18634 0 obj <<
+/Names [(page.29) 1194 0 R (page.290) 9185 0 R (page.291) 9201 0 R (page.292) 9221 0 R (page.293) 9240 0 R (page.294) 9262 0 R]
+/Limits [(page.29) (page.294)]
+>> endobj
+18635 0 obj <<
+/Names [(page.295) 9284 0 R (page.296) 9299 0 R (page.297) 9329 0 R (page.298) 9396 0 R (page.299) 9480 0 R (page.3) 559 0 R]
+/Limits [(page.295) (page.3)]
+>> endobj
+18636 0 obj <<
+/Names [(page.30) 1227 0 R (page.300) 9570 0 R (page.301) 9641 0 R (page.302) 9685 0 R (page.303) 9699 0 R (page.304) 9711 0 R]
+/Limits [(page.30) (page.304)]
+>> endobj
+18637 0 obj <<
+/Names [(page.305) 9729 0 R (page.306) 9747 0 R (page.307) 9788 0 R (page.308) 9851 0 R (page.309) 9902 0 R (page.31) 1247 0 R]
+/Limits [(page.305) (page.31)]
+>> endobj
+18638 0 obj <<
+/Names [(page.310) 9923 0 R (page.311) 9929 0 R (page.312) 9960 0 R (page.313) 9983 0 R (page.314) 10006 0 R (page.315) 10030 0 R]
+/Limits [(page.310) (page.315)]
+>> endobj
+18639 0 obj <<
+/Names [(page.316) 10056 0 R (page.317) 10081 0 R (page.318) 10097 0 R (page.319) 10111 0 R (page.32) 1259 0 R (page.320) 10148 0 R]
+/Limits [(page.316) (page.320)]
+>> endobj
+18640 0 obj <<
+/Names [(page.321) 10171 0 R (page.322) 10186 0 R (page.323) 10204 0 R (page.324) 10266 0 R (page.325) 10337 0 R (page.326) 10440 0 R]
+/Limits [(page.321) (page.326)]
+>> endobj
+18641 0 obj <<
+/Names [(page.327) 10569 0 R (page.328) 10641 0 R (page.329) 10654 0 R (page.33) 1271 0 R (page.330) 10670 0 R (page.331) 10683 0 R]
+/Limits [(page.327) (page.331)]
+>> endobj
+18642 0 obj <<
+/Names [(page.332) 10702 0 R (page.333) 10721 0 R (page.333d) 16821 0 R (page.334) 10738 0 R (page.335) 10764 0 R (page.336) 10819 0 R]
+/Limits [(page.332) (page.336)]
+>> endobj
+18643 0 obj <<
+/Names [(page.337) 10854 0 R (page.338) 10865 0 R (page.339) 10890 0 R (page.34) 1292 0 R (page.340) 10959 0 R (page.341) 11022 0 R]
+/Limits [(page.337) (page.341)]
+>> endobj
+18644 0 obj <<
+/Names [(page.342) 11057 0 R (page.343) 11070 0 R (page.344) 11084 0 R (page.345) 11099 0 R (page.346) 11114 0 R (page.347) 11129 0 R]
+/Limits [(page.342) (page.347)]
+>> endobj
+18645 0 obj <<
+/Names [(page.348) 11172 0 R (page.349) 11197 0 R (page.35) 1317 0 R (page.350) 11210 0 R (page.351) 11261 0 R (page.352) 11308 0 R]
+/Limits [(page.348) (page.352)]
+>> endobj
+18646 0 obj <<
+/Names [(page.352d) 16739 0 R (page.353) 11327 0 R (page.354) 11343 0 R (page.355) 11357 0 R (page.356) 11375 0 R (page.357) 11421 0 R]
+/Limits [(page.352d) (page.357)]
+>> endobj
+18647 0 obj <<
+/Names [(page.358) 11499 0 R (page.359) 11580 0 R (page.36) 1346 0 R (page.360) 11664 0 R (page.361) 11751 0 R (page.362) 11807 0 R]
+/Limits [(page.358) (page.362)]
+>> endobj
+18648 0 obj <<
+/Names [(page.363) 11832 0 R (page.364) 11839 0 R (page.364d) 16740 0 R (page.365) 11850 0 R (page.366) 11865 0 R (page.367) 11878 0 R]
+/Limits [(page.363) (page.367)]
+>> endobj
+18649 0 obj <<
+/Names [(page.368) 11895 0 R (page.369) 11911 0 R (page.37) 1363 0 R (page.370) 11925 0 R (page.371) 11938 0 R (page.372) 11954 0 R]
+/Limits [(page.368) (page.372)]
+>> endobj
+18650 0 obj <<
+/Names [(page.373) 11970 0 R (page.374) 11987 0 R (page.375) 12003 0 R (page.376) 12020 0 R (page.377) 12037 0 R (page.378) 12053 0 R]
+/Limits [(page.373) (page.378)]
+>> endobj
+18651 0 obj <<
+/Names [(page.379) 12071 0 R (page.38) 1382 0 R (page.380) 12086 0 R (page.381) 12102 0 R (page.382) 12121 0 R (page.383) 12138 0 R]
+/Limits [(page.379) (page.383)]
+>> endobj
+18652 0 obj <<
+/Names [(page.384) 12157 0 R (page.385) 12177 0 R (page.386) 12193 0 R (page.387) 12232 0 R (page.388) 12254 0 R (page.389) 12300 0 R]
+/Limits [(page.384) (page.389)]
+>> endobj
+18653 0 obj <<
+/Names [(page.39) 1406 0 R (page.390) 12366 0 R (page.391) 12441 0 R (page.392) 12537 0 R (page.393) 12604 0 R (page.394) 12651 0 R]
+/Limits [(page.39) (page.394)]
+>> endobj
+18654 0 obj <<
+/Names [(page.395) 12689 0 R (page.396) 12698 0 R (page.396d) 17759 0 R (page.397) 12709 0 R (page.398) 12725 0 R (page.399) 12737 0 R]
+/Limits [(page.395) (page.399)]
+>> endobj
+18655 0 obj <<
+/Names [(page.4) 572 0 R (page.40) 1427 0 R (page.400) 12751 0 R (page.401) 12766 0 R (page.402) 12780 0 R (page.403) 12793 0 R]
+/Limits [(page.4) (page.403)]
+>> endobj
+18656 0 obj <<
+/Names [(page.404) 12808 0 R (page.405) 12825 0 R (page.406) 12843 0 R (page.407) 12862 0 R (page.408) 12886 0 R (page.409) 12904 0 R]
+/Limits [(page.404) (page.409)]
+>> endobj
+18657 0 obj <<
+/Names [(page.41) 1443 0 R (page.410) 12919 0 R (page.411) 12935 0 R (page.412) 12954 0 R (page.413) 12975 0 R (page.414) 12992 0 R]
+/Limits [(page.41) (page.414)]
+>> endobj
+18658 0 obj <<
+/Names [(page.415) 13017 0 R (page.416) 13063 0 R (page.417) 13105 0 R (page.418) 13162 0 R (page.419) 13235 0 R (page.42) 1452 0 R]
+/Limits [(page.415) (page.42)]
+>> endobj
+18659 0 obj <<
+/Names [(page.420) 13285 0 R (page.421) 13304 0 R (page.422) 13315 0 R (page.423) 13327 0 R (page.424) 13340 0 R (page.425) 13349 0 R]
+/Limits [(page.420) (page.425)]
+>> endobj
+18660 0 obj <<
+/Names [(page.426) 13356 0 R (page.427) 13363 0 R (page.428) 13377 0 R (page.429) 13392 0 R (page.43) 1459 0 R (page.430) 13409 0 R]
+/Limits [(page.426) (page.430)]
+>> endobj
+18661 0 obj <<
+/Names [(page.431) 13443 0 R (page.432) 13500 0 R (page.433) 13526 0 R (page.434) 13557 0 R (page.435) 13621 0 R (page.436) 13659 0 R]
+/Limits [(page.431) (page.436)]
+>> endobj
+18662 0 obj <<
+/Names [(page.437) 13684 0 R (page.438) 13703 0 R (page.439) 13777 0 R (page.44) 1467 0 R (page.440) 13858 0 R (page.441) 13931 0 R]
+/Limits [(page.437) (page.441)]
+>> endobj
+18663 0 obj <<
+/Names [(page.442) 14019 0 R (page.443) 14071 0 R (page.444) 14102 0 R (page.444d) 17677 0 R (page.445) 14115 0 R (page.446) 14128 0 R]
+/Limits [(page.442) (page.446)]
+>> endobj
+18664 0 obj <<
+/Names [(page.447) 14143 0 R (page.448) 14157 0 R (page.449) 14170 0 R (page.45) 1473 0 R (page.450) 14183 0 R (page.451) 14199 0 R]
+/Limits [(page.447) (page.451)]
+>> endobj
+18665 0 obj <<
+/Names [(page.452) 14215 0 R (page.453) 14234 0 R (page.454) 14251 0 R (page.455) 14266 0 R (page.456) 14285 0 R (page.457) 14304 0 R]
+/Limits [(page.452) (page.457)]
+>> endobj
+18666 0 obj <<
+/Names [(page.458) 14323 0 R (page.459) 14339 0 R (page.46) 1479 0 R (page.460) 14356 0 R (page.461) 14382 0 R (page.462) 14439 0 R]
+/Limits [(page.458) (page.462)]
+>> endobj
+18667 0 obj <<
+/Names [(page.463) 14471 0 R (page.464) 14521 0 R (page.465) 14550 0 R (page.466) 14629 0 R (page.467) 14698 0 R (page.468) 14795 0 R]
+/Limits [(page.463) (page.468)]
+>> endobj
+18668 0 obj <<
+/Names [(page.469) 14877 0 R (page.47) 1487 0 R (page.470) 14941 0 R (page.471) 15019 0 R (page.472) 15046 0 R (page.473) 15054 0 R]
+/Limits [(page.469) (page.473)]
+>> endobj
+18669 0 obj <<
+/Names [(page.474) 15061 0 R (page.475) 15066 0 R (page.475d) 17758 0 R (page.476) 15077 0 R (page.477) 15091 0 R (page.478) 15107 0 R]
+/Limits [(page.474) (page.478)]
+>> endobj
+18670 0 obj <<
+/Names [(page.479) 15123 0 R (page.48) 1494 0 R (page.480) 15138 0 R (page.481) 15152 0 R (page.482) 15166 0 R (page.483) 15181 0 R]
+/Limits [(page.479) (page.483)]
+>> endobj
+18671 0 obj <<
+/Names [(page.484) 15195 0 R (page.485) 15212 0 R (page.486) 15231 0 R (page.487) 15250 0 R (page.488) 15267 0 R (page.489) 15287 0 R]
+/Limits [(page.484) (page.489)]
+>> endobj
+18672 0 obj <<
+/Names [(page.49) 1506 0 R (page.490) 15305 0 R (page.491) 15318 0 R (page.492) 15339 0 R (page.493) 15361 0 R (page.494) 15382 0 R]
+/Limits [(page.49) (page.494)]
+>> endobj
+18673 0 obj <<
+/Names [(page.495) 15400 0 R (page.496) 15416 0 R (page.497) 15432 0 R (page.498) 15449 0 R (page.499) 15494 0 R (page.5) 818 0 R]
+/Limits [(page.495) (page.5)]
+>> endobj
+18674 0 obj <<
+/Names [(page.50) 1515 0 R (page.500) 15551 0 R (page.501) 15596 0 R (page.502) 15624 0 R (page.503) 15632 0 R (page.504) 15649 0 R]
+/Limits [(page.50) (page.504)]
+>> endobj
+18675 0 obj <<
+/Names [(page.505) 15663 0 R (page.506) 15682 0 R (page.507) 15723 0 R (page.508) 15750 0 R (page.509) 15765 0 R (page.51) 1521 0 R]
+/Limits [(page.505) (page.51)]
+>> endobj
+18676 0 obj <<
+/Names [(page.510) 15792 0 R (page.511) 15814 0 R (page.512) 15863 0 R (page.513) 15895 0 R (page.514) 15938 0 R (page.515) 15966 0 R]
+/Limits [(page.510) (page.515)]
+>> endobj
+18677 0 obj <<
+/Names [(page.516) 15993 0 R (page.517) 16021 0 R (page.518) 16045 0 R (page.519) 16124 0 R (page.52) 1526 0 R (page.520) 16190 0 R]
+/Limits [(page.516) (page.520)]
+>> endobj
+18678 0 obj <<
+/Names [(page.521) 16285 0 R (page.522) 16380 0 R (page.523) 16453 0 R (page.524) 16530 0 R (page.525) 16597 0 R (page.526) 16661 0 R]
+/Limits [(page.521) (page.526)]
+>> endobj
+18679 0 obj <<
+/Names [(page.527) 16737 0 R (page.528) 16818 0 R (page.529) 16892 0 R (page.53) 1531 0 R (page.530) 17000 0 R (page.531) 17108 0 R]
+/Limits [(page.527) (page.531)]
+>> endobj
+18680 0 obj <<
+/Names [(page.532) 17223 0 R (page.533) 17331 0 R (page.534) 17446 0 R (page.535) 17559 0 R (page.536) 17676 0 R (page.537) 17757 0 R]
+/Limits [(page.532) (page.537)]
+>> endobj
+18681 0 obj <<
+/Names [(page.538) 17838 0 R (page.539) 17904 0 R (page.54) 1538 0 R (page.540) 17983 0 R (page.541) 18042 0 R (page.55) 1553 0 R]
+/Limits [(page.538) (page.55)]
+>> endobj
+18682 0 obj <<
+/Names [(page.56) 1590 0 R (page.57) 1619 0 R (page.58) 1653 0 R (page.59) 1685 0 R (page.6) 828 0 R (page.60) 1731 0 R]
+/Limits [(page.56) (page.60)]
+>> endobj
+18683 0 obj <<
+/Names [(page.61) 1789 0 R (page.62) 1852 0 R (page.63) 1909 0 R (page.64) 1964 0 R (page.65) 2003 0 R (page.66) 2039 0 R]
+/Limits [(page.61) (page.66)]
+>> endobj
+18684 0 obj <<
+/Names [(page.67) 2066 0 R (page.68) 2122 0 R (page.69) 2226 0 R (page.7) 846 0 R (page.70) 2331 0 R (page.71) 2371 0 R]
+/Limits [(page.67) (page.71)]
+>> endobj
+18685 0 obj <<
+/Names [(page.72) 2393 0 R (page.73) 2402 0 R (page.74) 2413 0 R (page.75) 2426 0 R (page.76) 2434 0 R (page.77) 2463 0 R]
+/Limits [(page.72) (page.77)]
+>> endobj
+18686 0 obj <<
+/Names [(page.78) 2477 0 R (page.79) 2488 0 R (page.8) 861 0 R (page.80) 2500 0 R (page.81) 2511 0 R (page.82) 2528 0 R]
+/Limits [(page.78) (page.82)]
+>> endobj
+18687 0 obj <<
+/Names [(page.83) 2545 0 R (page.84) 2582 0 R (page.85) 2611 0 R (page.86) 2641 0 R (page.87) 2716 0 R (page.88) 2790 0 R]
+/Limits [(page.83) (page.88)]
+>> endobj
+18688 0 obj <<
+/Names [(page.89) 2875 0 R (page.9) 874 0 R (page.90) 2929 0 R (page.91) 2937 0 R (page.92) 2954 0 R (page.93) 2969 0 R]
+/Limits [(page.89) (page.93)]
+>> endobj
+18689 0 obj <<
+/Names [(page.94) 2980 0 R (page.95) 3011 0 R (page.96) 3049 0 R (page.97) 3079 0 R (page.98) 3156 0 R (page.99) 3234 0 R]
+/Limits [(page.94) (page.99)]
+>> endobj
+18690 0 obj <<
+/Names [(page.i) 620 0 R (page.ii) 669 0 R (page.iii) 730 0 R (page.iv) 751 0 R (paragraph.1.1.2.1) 791 0 R (paragraph.1.1.2.2) 793 0 R]
+/Limits [(page.i) (paragraph.1.1.2.2)]
+>> endobj
+18691 0 obj <<
+/Names [(paragraph.1.1.2.3) 809 0 R (paragraph.1.3.2.1) 848 0 R (paragraph.10.10.2.1) 4953 0 R (paragraph.10.13.2.1) 5181 0 R (paragraph.10.18.2.1) 5266 0 R (paragraph.10.18.2.2) 5269 0 R]
+/Limits [(paragraph.1.1.2.3) (paragraph.10.18.2.2)]
+>> endobj
+18692 0 obj <<
+/Names [(paragraph.10.18.2.3) 5280 0 R (paragraph.10.18.2.4) 5300 0 R (paragraph.10.18.2.5) 5313 0 R (paragraph.10.18.2.6) 5316 0 R (paragraph.10.20.2.1) 5375 0 R (paragraph.10.20.2.2) 5377 0 R]
+/Limits [(paragraph.10.18.2.3) (paragraph.10.20.2.2)]
+>> endobj
+18693 0 obj <<
+/Names [(paragraph.10.20.2.3) 5413 0 R (paragraph.10.20.2.4) 5414 0 R (paragraph.10.21.2.1) 5643 0 R (paragraph.10.21.2.2) 5654 0 R (paragraph.10.21.2.3) 5656 0 R (paragraph.10.21.2.4) 5657 0 R]
+/Limits [(paragraph.10.20.2.3) (paragraph.10.21.2.4)]
+>> endobj
+18694 0 obj <<
+/Names [(paragraph.10.21.2.5) 5658 0 R (paragraph.10.21.3.1) 5661 0 R (paragraph.10.21.3.10) 5676 0 R (paragraph.10.21.3.11) 5683 0 R (paragraph.10.21.3.12) 5684 0 R (paragraph.10.21.3.2) 5663 0 R]
+/Limits [(paragraph.10.21.2.5) (paragraph.10.21.3.2)]
+>> endobj
+18695 0 obj <<
+/Names [(paragraph.10.21.3.3) 5669 0 R (paragraph.10.21.3.4) 5670 0 R (paragraph.10.21.3.5) 5671 0 R (paragraph.10.21.3.6) 5672 0 R (paragraph.10.21.3.7) 5673 0 R (paragraph.10.21.3.8) 5674 0 R]
+/Limits [(paragraph.10.21.3.3) (paragraph.10.21.3.8)]
+>> endobj
+18696 0 obj <<
+/Names [(paragraph.10.21.3.9) 5675 0 R (paragraph.10.21.4.1) 5686 0 R (paragraph.10.21.4.10) 5695 0 R (paragraph.10.21.4.11) 5716 0 R (paragraph.10.21.4.12) 5717 0 R (paragraph.10.21.4.13) 5718 0 R]
+/Limits [(paragraph.10.21.3.9) (paragraph.10.21.4.13)]
+>> endobj
+18697 0 obj <<
+/Names [(paragraph.10.21.4.14) 5719 0 R (paragraph.10.21.4.15) 5720 0 R (paragraph.10.21.4.2) 5687 0 R (paragraph.10.21.4.3) 5688 0 R (paragraph.10.21.4.4) 5689 0 R (paragraph.10.21.4.5) 5690 0 R]
+/Limits [(paragraph.10.21.4.14) (paragraph.10.21.4.5)]
+>> endobj
+18698 0 obj <<
+/Names [(paragraph.10.21.4.6) 5691 0 R (paragraph.10.21.4.7) 5692 0 R (paragraph.10.21.4.8) 5693 0 R (paragraph.10.21.4.9) 5694 0 R (paragraph.10.21.5.1) 5722 0 R (paragraph.10.22.2.1) 5885 0 R]
+/Limits [(paragraph.10.21.4.6) (paragraph.10.22.2.1)]
+>> endobj
+18699 0 obj <<
+/Names [(paragraph.10.22.2.2) 5887 0 R (paragraph.10.22.3.1) 5889 0 R (paragraph.10.22.3.2) 5890 0 R (paragraph.10.22.3.3) 5891 0 R (paragraph.10.22.3.4) 5893 0 R (paragraph.10.22.3.5) 5894 0 R]
+/Limits [(paragraph.10.22.2.2) (paragraph.10.22.3.5)]
+>> endobj
+18700 0 obj <<
+/Names [(paragraph.10.22.3.6) 5902 0 R (paragraph.10.22.3.7) 5904 0 R (paragraph.10.22.4.1) 5906 0 R (paragraph.10.22.4.2) 5907 0 R (paragraph.10.22.4.3) 5908 0 R (paragraph.10.22.4.4) 5909 0 R]
+/Limits [(paragraph.10.22.3.6) (paragraph.10.22.4.4)]
+>> endobj
+18701 0 obj <<
+/Names [(paragraph.10.23.2.1) 5926 0 R (paragraph.10.24.2.1) 5997 0 R (paragraph.10.24.2.2) 5999 0 R (paragraph.10.26.2.1) 6075 0 R (paragraph.10.26.2.2) 6076 0 R (paragraph.10.26.2.3) 6078 0 R]
+/Limits [(paragraph.10.23.2.1) (paragraph.10.26.2.3)]
+>> endobj
+18702 0 obj <<
+/Names [(paragraph.10.26.2.4) 6096 0 R (paragraph.10.26.2.5) 6098 0 R (paragraph.10.26.3.1) 6101 0 R (paragraph.10.26.3.10) 6119 0 R (paragraph.10.26.3.2) 6103 0 R (paragraph.10.26.3.3) 6105 0 R]
+/Limits [(paragraph.10.26.2.4) (paragraph.10.26.3.3)]
+>> endobj
+18703 0 obj <<
+/Names [(paragraph.10.26.3.4) 6112 0 R (paragraph.10.26.3.5) 6113 0 R (paragraph.10.26.3.6) 6114 0 R (paragraph.10.26.3.7) 6115 0 R (paragraph.10.26.3.8) 6116 0 R (paragraph.10.26.3.9) 6117 0 R]
+/Limits [(paragraph.10.26.3.4) (paragraph.10.26.3.9)]
+>> endobj
+18704 0 obj <<
+/Names [(paragraph.10.27.2.1) 6139 0 R (paragraph.10.27.2.2) 6163 0 R (paragraph.10.27.2.3) 6164 0 R (paragraph.10.27.2.4) 6165 0 R (paragraph.10.27.2.5) 6166 0 R (paragraph.10.28.2.1) 6197 0 R]
+/Limits [(paragraph.10.27.2.1) (paragraph.10.28.2.1)]
+>> endobj
+18705 0 obj <<
+/Names [(paragraph.10.28.2.2) 6198 0 R (paragraph.10.28.3.1) 6201 0 R (paragraph.10.28.3.2) 6212 0 R (paragraph.10.28.3.3) 6214 0 R (paragraph.10.28.3.4) 6215 0 R (paragraph.10.28.3.5) 6216 0 R]
+/Limits [(paragraph.10.28.2.2) (paragraph.10.28.3.5)]
+>> endobj
+18706 0 obj <<
+/Names [(paragraph.10.28.3.6) 6217 0 R (paragraph.10.28.3.7) 6219 0 R (paragraph.10.28.4.1) 6247 0 R (paragraph.10.28.4.2) 6248 0 R (paragraph.10.3.2.1) 3055 0 R (paragraph.10.3.3.1) 3060 0 R]
+/Limits [(paragraph.10.28.3.6) (paragraph.10.3.3.1)]
+>> endobj
+18707 0 obj <<
+/Names [(paragraph.10.3.4.1) 3081 0 R (paragraph.10.3.4.2) 3082 0 R (paragraph.10.3.4.3) 3083 0 R (paragraph.10.30.2.1) 6283 0 R (paragraph.10.30.2.2) 6295 0 R (paragraph.10.30.2.3) 6296 0 R]
+/Limits [(paragraph.10.3.4.1) (paragraph.10.30.2.3)]
+>> endobj
+18708 0 obj <<
+/Names [(paragraph.10.30.2.4) 6297 0 R (paragraph.10.30.2.5) 6298 0 R (paragraph.10.31.2.1) 6367 0 R (paragraph.10.32.2.1) 6758 0 R (paragraph.10.32.3.1) 6760 0 R (paragraph.10.32.3.2) 6768 0 R]
+/Limits [(paragraph.10.30.2.4) (paragraph.10.32.3.2)]
+>> endobj
+18709 0 obj <<
+/Names [(paragraph.10.32.3.3) 6769 0 R (paragraph.10.32.4.1) 6772 0 R (paragraph.10.32.4.2) 6773 0 R (paragraph.10.32.4.3) 6774 0 R (paragraph.10.32.4.4) 6775 0 R (paragraph.10.32.4.5) 6777 0 R]
+/Limits [(paragraph.10.32.3.3) (paragraph.10.32.4.5)]
+>> endobj
+18710 0 obj <<
+/Names [(paragraph.10.32.4.6) 6785 0 R (paragraph.10.32.4.7) 6786 0 R (paragraph.10.32.4.8) 6787 0 R (paragraph.10.32.5.1) 6789 0 R (paragraph.10.32.5.10) 6803 0 R (paragraph.10.32.5.11) 6804 0 R]
+/Limits [(paragraph.10.32.4.6) (paragraph.10.32.5.11)]
+>> endobj
+18711 0 obj <<
+/Names [(paragraph.10.32.5.12) 6805 0 R (paragraph.10.32.5.13) 6806 0 R (paragraph.10.32.5.14) 6807 0 R (paragraph.10.32.5.15) 6808 0 R (paragraph.10.32.5.16) 6809 0 R (paragraph.10.32.5.17) 6810 0 R]
+/Limits [(paragraph.10.32.5.12) (paragraph.10.32.5.17)]
+>> endobj
+18712 0 obj <<
+/Names [(paragraph.10.32.5.18) 6811 0 R (paragraph.10.32.5.19) 6817 0 R (paragraph.10.32.5.2) 6790 0 R (paragraph.10.32.5.20) 6818 0 R (paragraph.10.32.5.21) 6819 0 R (paragraph.10.32.5.22) 6820 0 R]
+/Limits [(paragraph.10.32.5.18) (paragraph.10.32.5.22)]
+>> endobj
+18713 0 obj <<
+/Names [(paragraph.10.32.5.23) 6821 0 R (paragraph.10.32.5.24) 6822 0 R (paragraph.10.32.5.25) 6823 0 R (paragraph.10.32.5.26) 6824 0 R (paragraph.10.32.5.27) 6825 0 R (paragraph.10.32.5.28) 6826 0 R]
+/Limits [(paragraph.10.32.5.23) (paragraph.10.32.5.28)]
+>> endobj
+18714 0 obj <<
+/Names [(paragraph.10.32.5.29) 6827 0 R (paragraph.10.32.5.3) 6791 0 R (paragraph.10.32.5.30) 6828 0 R (paragraph.10.32.5.31) 6829 0 R (paragraph.10.32.5.32) 6830 0 R (paragraph.10.32.5.33) 6831 0 R]
+/Limits [(paragraph.10.32.5.29) (paragraph.10.32.5.33)]
+>> endobj
+18715 0 obj <<
+/Names [(paragraph.10.32.5.34) 6832 0 R (paragraph.10.32.5.35) 6833 0 R (paragraph.10.32.5.36) 6834 0 R (paragraph.10.32.5.37) 6840 0 R (paragraph.10.32.5.38) 6841 0 R (paragraph.10.32.5.39) 6842 0 R]
+/Limits [(paragraph.10.32.5.34) (paragraph.10.32.5.39)]
+>> endobj
+18716 0 obj <<
+/Names [(paragraph.10.32.5.4) 6792 0 R (paragraph.10.32.5.40) 6843 0 R (paragraph.10.32.5.41) 6844 0 R (paragraph.10.32.5.42) 6845 0 R (paragraph.10.32.5.43) 6846 0 R (paragraph.10.32.5.44) 6847 0 R]
+/Limits [(paragraph.10.32.5.4) (paragraph.10.32.5.44)]
+>> endobj
+18717 0 obj <<
+/Names [(paragraph.10.32.5.45) 6848 0 R (paragraph.10.32.5.46) 6849 0 R (paragraph.10.32.5.47) 6850 0 R (paragraph.10.32.5.48) 6851 0 R (paragraph.10.32.5.5) 6793 0 R (paragraph.10.32.5.6) 6799 0 R]
+/Limits [(paragraph.10.32.5.45) (paragraph.10.32.5.6)]
+>> endobj
+18718 0 obj <<
+/Names [(paragraph.10.32.5.7) 6800 0 R (paragraph.10.32.5.8) 6801 0 R (paragraph.10.32.5.9) 6802 0 R (paragraph.10.32.6.1) 6853 0 R (paragraph.10.33.2.1) 6974 0 R (paragraph.10.33.3.1) 6976 0 R]
+/Limits [(paragraph.10.32.5.7) (paragraph.10.33.3.1)]
+>> endobj
+18719 0 obj <<
+/Names [(paragraph.10.33.3.2) 7002 0 R (paragraph.10.33.3.3) 7003 0 R (paragraph.10.35.2.1) 7034 0 R (paragraph.10.36.2.1) 7119 0 R (paragraph.10.36.3.1) 7121 0 R (paragraph.10.36.3.2) 7122 0 R]
+/Limits [(paragraph.10.33.3.2) (paragraph.10.36.3.2)]
+>> endobj
+18720 0 obj <<
+/Names [(paragraph.10.37.2.1) 7201 0 R (paragraph.10.38.2.1) 7282 0 R (paragraph.10.4.2.1) 3531 0 R (paragraph.10.4.2.10) 3560 0 R (paragraph.10.4.2.2) 3538 0 R (paragraph.10.4.2.3) 3539 0 R]
+/Limits [(paragraph.10.37.2.1) (paragraph.10.4.2.3)]
+>> endobj
+18721 0 obj <<
+/Names [(paragraph.10.4.2.4) 3540 0 R (paragraph.10.4.2.5) 3543 0 R (paragraph.10.4.2.6) 3546 0 R (paragraph.10.4.2.7) 3553 0 R (paragraph.10.4.2.8) 3554 0 R (paragraph.10.4.2.9) 3557 0 R]
+/Limits [(paragraph.10.4.2.4) (paragraph.10.4.2.9)]
+>> endobj
+18722 0 obj <<
+/Names [(paragraph.10.4.3.1) 3569 0 R (paragraph.10.4.3.10) 3605 0 R (paragraph.10.4.3.11) 3612 0 R (paragraph.10.4.3.12) 3614 0 R (paragraph.10.4.3.13) 3616 0 R (paragraph.10.4.3.14) 3618 0 R]
+/Limits [(paragraph.10.4.3.1) (paragraph.10.4.3.14)]
+>> endobj
+18723 0 obj <<
+/Names [(paragraph.10.4.3.15) 3620 0 R (paragraph.10.4.3.16) 3628 0 R (paragraph.10.4.3.17) 3631 0 R (paragraph.10.4.3.18) 3634 0 R (paragraph.10.4.3.19) 3642 0 R (paragraph.10.4.3.2) 3571 0 R]
+/Limits [(paragraph.10.4.3.15) (paragraph.10.4.3.2)]
+>> endobj
+18724 0 obj <<
+/Names [(paragraph.10.4.3.20) 3645 0 R (paragraph.10.4.3.21) 3648 0 R (paragraph.10.4.3.22) 3651 0 R (paragraph.10.4.3.23) 3660 0 R (paragraph.10.4.3.24) 3663 0 R (paragraph.10.4.3.25) 3666 0 R]
+/Limits [(paragraph.10.4.3.20) (paragraph.10.4.3.25)]
+>> endobj
+18725 0 obj <<
+/Names [(paragraph.10.4.3.26) 3679 0 R (paragraph.10.4.3.27) 3682 0 R (paragraph.10.4.3.28) 3694 0 R (paragraph.10.4.3.29) 3697 0 R (paragraph.10.4.3.3) 3573 0 R (paragraph.10.4.3.30) 3700 0 R]
+/Limits [(paragraph.10.4.3.26) (paragraph.10.4.3.30)]
+>> endobj
+18726 0 obj <<
+/Names [(paragraph.10.4.3.31) 3702 0 R (paragraph.10.4.3.32) 3711 0 R (paragraph.10.4.3.33) 3713 0 R (paragraph.10.4.3.34) 3715 0 R (paragraph.10.4.3.35) 3717 0 R (paragraph.10.4.3.36) 3719 0 R]
+/Limits [(paragraph.10.4.3.31) (paragraph.10.4.3.36)]
+>> endobj
+18727 0 obj <<
+/Names [(paragraph.10.4.3.37) 3729 0 R (paragraph.10.4.3.38) 3732 0 R (paragraph.10.4.3.39) 3743 0 R (paragraph.10.4.3.4) 3582 0 R (paragraph.10.4.3.40) 3746 0 R (paragraph.10.4.3.41) 3749 0 R]
+/Limits [(paragraph.10.4.3.37) (paragraph.10.4.3.41)]
+>> endobj
+18728 0 obj <<
+/Names [(paragraph.10.4.3.42) 3760 0 R (paragraph.10.4.3.43) 3763 0 R (paragraph.10.4.3.44) 3766 0 R (paragraph.10.4.3.45) 3779 0 R (paragraph.10.4.3.46) 3781 0 R (paragraph.10.4.3.47) 3792 0 R]
+/Limits [(paragraph.10.4.3.42) (paragraph.10.4.3.47)]
+>> endobj
+18729 0 obj <<
+/Names [(paragraph.10.4.3.48) 3794 0 R (paragraph.10.4.3.49) 3796 0 R (paragraph.10.4.3.5) 3585 0 R (paragraph.10.4.3.50) 3799 0 R (paragraph.10.4.3.51) 3813 0 R (paragraph.10.4.3.52) 3816 0 R]
+/Limits [(paragraph.10.4.3.48) (paragraph.10.4.3.52)]
+>> endobj
+18730 0 obj <<
+/Names [(paragraph.10.4.3.53) 3819 0 R (paragraph.10.4.3.54) 3832 0 R (paragraph.10.4.3.55) 3835 0 R (paragraph.10.4.3.56) 3846 0 R (paragraph.10.4.3.57) 3849 0 R (paragraph.10.4.3.58) 3851 0 R]
+/Limits [(paragraph.10.4.3.53) (paragraph.10.4.3.58)]
+>> endobj
+18731 0 obj <<
+/Names [(paragraph.10.4.3.59) 3865 0 R (paragraph.10.4.3.6) 3588 0 R (paragraph.10.4.3.60) 3867 0 R (paragraph.10.4.3.61) 3870 0 R (paragraph.10.4.3.62) 3872 0 R (paragraph.10.4.3.63) 3886 0 R]
+/Limits [(paragraph.10.4.3.59) (paragraph.10.4.3.63)]
+>> endobj
+18732 0 obj <<
+/Names [(paragraph.10.4.3.64) 3889 0 R (paragraph.10.4.3.65) 3893 0 R (paragraph.10.4.3.66) 3911 0 R (paragraph.10.4.3.7) 3598 0 R (paragraph.10.4.3.8) 3601 0 R (paragraph.10.4.3.9) 3603 0 R]
+/Limits [(paragraph.10.4.3.64) (paragraph.10.4.3.9)]
+>> endobj
+18733 0 obj <<
+/Names [(paragraph.10.4.4.1) 3913 0 R (paragraph.10.4.4.2) 3914 0 R (paragraph.10.45.2.1) 7487 0 R (paragraph.10.45.2.2) 7488 0 R (paragraph.10.45.3.1) 7490 0 R (paragraph.10.45.3.2) 7511 0 R]
+/Limits [(paragraph.10.4.4.1) (paragraph.10.45.3.2)]
+>> endobj
+18734 0 obj <<
+/Names [(paragraph.10.45.3.3) 7513 0 R (paragraph.10.45.3.4) 7515 0 R (paragraph.10.45.4.1) 7536 0 R (paragraph.10.46.2.1) 7550 0 R (paragraph.10.46.2.2) 7551 0 R (paragraph.10.46.2.3) 7581 0 R]
+/Limits [(paragraph.10.45.3.3) (paragraph.10.46.2.3)]
+>> endobj
+18735 0 obj <<
+/Names [(paragraph.10.46.2.4) 7582 0 R (paragraph.10.47.2.1) 8050 0 R (paragraph.10.47.3.1) 8062 0 R (paragraph.10.47.3.2) 8063 0 R (paragraph.10.47.4.1) 8065 0 R (paragraph.10.47.4.10) 8086 0 R]
+/Limits [(paragraph.10.46.2.4) (paragraph.10.47.4.10)]
+>> endobj
+18736 0 obj <<
+/Names [(paragraph.10.47.4.11) 8099 0 R (paragraph.10.47.4.12) 8100 0 R (paragraph.10.47.4.2) 8067 0 R (paragraph.10.47.4.3) 8069 0 R (paragraph.10.47.4.4) 8071 0 R (paragraph.10.47.4.5) 8079 0 R]
+/Limits [(paragraph.10.47.4.11) (paragraph.10.47.4.5)]
+>> endobj
+18737 0 obj <<
+/Names [(paragraph.10.47.4.6) 8080 0 R (paragraph.10.47.4.7) 8081 0 R (paragraph.10.47.4.8) 8083 0 R (paragraph.10.47.4.9) 8084 0 R (paragraph.10.47.5.1) 8102 0 R (paragraph.10.47.5.10) 8118 0 R]
+/Limits [(paragraph.10.47.4.6) (paragraph.10.47.5.10)]
+>> endobj
+18738 0 obj <<
+/Names [(paragraph.10.47.5.11) 8119 0 R (paragraph.10.47.5.12) 8120 0 R (paragraph.10.47.5.13) 8128 0 R (paragraph.10.47.5.14) 8129 0 R (paragraph.10.47.5.15) 8130 0 R (paragraph.10.47.5.16) 8137 0 R]
+/Limits [(paragraph.10.47.5.11) (paragraph.10.47.5.16)]
+>> endobj
+18739 0 obj <<
+/Names [(paragraph.10.47.5.17) 8138 0 R (paragraph.10.47.5.18) 8139 0 R (paragraph.10.47.5.19) 8140 0 R (paragraph.10.47.5.2) 8103 0 R (paragraph.10.47.5.20) 8141 0 R (paragraph.10.47.5.21) 8142 0 R]
+/Limits [(paragraph.10.47.5.17) (paragraph.10.47.5.21)]
+>> endobj
+18740 0 obj <<
+/Names [(paragraph.10.47.5.22) 8143 0 R (paragraph.10.47.5.23) 8144 0 R (paragraph.10.47.5.24) 8145 0 R (paragraph.10.47.5.25) 8146 0 R (paragraph.10.47.5.26) 8147 0 R (paragraph.10.47.5.27) 8153 0 R]
+/Limits [(paragraph.10.47.5.22) (paragraph.10.47.5.27)]
+>> endobj
+18741 0 obj <<
+/Names [(paragraph.10.47.5.28) 8154 0 R (paragraph.10.47.5.29) 8155 0 R (paragraph.10.47.5.3) 8104 0 R (paragraph.10.47.5.30) 8156 0 R (paragraph.10.47.5.31) 8157 0 R (paragraph.10.47.5.32) 8158 0 R]
+/Limits [(paragraph.10.47.5.28) (paragraph.10.47.5.32)]
+>> endobj
+18742 0 obj <<
+/Names [(paragraph.10.47.5.33) 8159 0 R (paragraph.10.47.5.34) 8160 0 R (paragraph.10.47.5.35) 8161 0 R (paragraph.10.47.5.36) 8162 0 R (paragraph.10.47.5.37) 8163 0 R (paragraph.10.47.5.38) 8164 0 R]
+/Limits [(paragraph.10.47.5.33) (paragraph.10.47.5.38)]
+>> endobj
+18743 0 obj <<
+/Names [(paragraph.10.47.5.4) 8105 0 R (paragraph.10.47.5.5) 8106 0 R (paragraph.10.47.5.6) 8107 0 R (paragraph.10.47.5.7) 8108 0 R (paragraph.10.47.5.8) 8109 0 R (paragraph.10.47.5.9) 8110 0 R]
+/Limits [(paragraph.10.47.5.4) (paragraph.10.47.5.9)]
+>> endobj
+18744 0 obj <<
+/Names [(paragraph.10.47.6.1) 8166 0 R (paragraph.10.48.2.1) 8293 0 R (paragraph.10.48.3.1) 8295 0 R (paragraph.10.48.4.1) 8297 0 R (paragraph.10.48.4.2) 8298 0 R (paragraph.10.48.4.3) 8299 0 R]
+/Limits [(paragraph.10.47.6.1) (paragraph.10.48.4.3)]
+>> endobj
+18745 0 obj <<
+/Names [(paragraph.10.5.2.1) 3933 0 R (paragraph.10.50.2.1) 8427 0 R (paragraph.10.50.2.10) 8436 0 R (paragraph.10.50.2.11) 8437 0 R (paragraph.10.50.2.12) 8456 0 R (paragraph.10.50.2.13) 8457 0 R]
+/Limits [(paragraph.10.5.2.1) (paragraph.10.50.2.13)]
+>> endobj
+18746 0 obj <<
+/Names [(paragraph.10.50.2.14) 8458 0 R (paragraph.10.50.2.15) 8459 0 R (paragraph.10.50.2.16) 8460 0 R (paragraph.10.50.2.2) 8428 0 R (paragraph.10.50.2.3) 8429 0 R (paragraph.10.50.2.4) 8430 0 R]
+/Limits [(paragraph.10.50.2.14) (paragraph.10.50.2.4)]
+>> endobj
+18747 0 obj <<
+/Names [(paragraph.10.50.2.5) 8431 0 R (paragraph.10.50.2.6) 8432 0 R (paragraph.10.50.2.7) 8433 0 R (paragraph.10.50.2.8) 8434 0 R (paragraph.10.50.2.9) 8435 0 R (paragraph.10.51.2.1) 8937 0 R]
+/Limits [(paragraph.10.50.2.5) (paragraph.10.51.2.1)]
+>> endobj
+18748 0 obj <<
+/Names [(paragraph.10.51.2.10) 8980 0 R (paragraph.10.51.2.11) 8988 0 R (paragraph.10.51.2.12) 8991 0 R (paragraph.10.51.2.2) 8945 0 R (paragraph.10.51.2.3) 8948 0 R (paragraph.10.51.2.4) 8951 0 R]
+/Limits [(paragraph.10.51.2.10) (paragraph.10.51.2.4)]
+>> endobj
+18749 0 obj <<
+/Names [(paragraph.10.51.2.5) 8960 0 R (paragraph.10.51.2.6) 8963 0 R (paragraph.10.51.2.7) 8966 0 R (paragraph.10.51.2.8) 8974 0 R (paragraph.10.51.2.9) 8977 0 R (paragraph.10.51.3.1) 8993 0 R]
+/Limits [(paragraph.10.51.2.5) (paragraph.10.51.3.1)]
+>> endobj
+18750 0 obj <<
+/Names [(paragraph.10.51.3.10) 9026 0 R (paragraph.10.51.3.11) 9035 0 R (paragraph.10.51.3.12) 9038 0 R (paragraph.10.51.3.13) 9040 0 R (paragraph.10.51.3.14) 9042 0 R (paragraph.10.51.3.15) 9050 0 R]
+/Limits [(paragraph.10.51.3.10) (paragraph.10.51.3.15)]
+>> endobj
+18751 0 obj <<
+/Names [(paragraph.10.51.3.16) 9052 0 R (paragraph.10.51.3.17) 9054 0 R (paragraph.10.51.3.18) 9057 0 R (paragraph.10.51.3.19) 9065 0 R (paragraph.10.51.3.2) 8994 0 R (paragraph.10.51.3.20) 9068 0 R]
+/Limits [(paragraph.10.51.3.16) (paragraph.10.51.3.20)]
+>> endobj
+18752 0 obj <<
+/Names [(paragraph.10.51.3.21) 9071 0 R (paragraph.10.51.3.22) 9079 0 R (paragraph.10.51.3.23) 9082 0 R (paragraph.10.51.3.24) 9085 0 R (paragraph.10.51.3.25) 9088 0 R (paragraph.10.51.3.26) 9098 0 R]
+/Limits [(paragraph.10.51.3.21) (paragraph.10.51.3.26)]
+>> endobj
+18753 0 obj <<
+/Names [(paragraph.10.51.3.27) 9101 0 R (paragraph.10.51.3.28) 9104 0 R (paragraph.10.51.3.29) 9107 0 R (paragraph.10.51.3.3) 8996 0 R (paragraph.10.51.3.30) 9118 0 R (paragraph.10.51.3.31) 9120 0 R]
+/Limits [(paragraph.10.51.3.27) (paragraph.10.51.3.31)]
+>> endobj
+18754 0 obj <<
+/Names [(paragraph.10.51.3.32) 9122 0 R (paragraph.10.51.3.33) 9124 0 R (paragraph.10.51.3.34) 9126 0 R (paragraph.10.51.3.35) 9136 0 R (paragraph.10.51.3.36) 9139 0 R (paragraph.10.51.3.37) 9142 0 R]
+/Limits [(paragraph.10.51.3.32) (paragraph.10.51.3.37)]
+>> endobj
+18755 0 obj <<
+/Names [(paragraph.10.51.3.38) 9153 0 R (paragraph.10.51.3.39) 9156 0 R (paragraph.10.51.3.4) 8997 0 R (paragraph.10.51.3.40) 9167 0 R (paragraph.10.51.3.41) 9170 0 R (paragraph.10.51.3.42) 9173 0 R]
+/Limits [(paragraph.10.51.3.38) (paragraph.10.51.3.42)]
+>> endobj
+18756 0 obj <<
+/Names [(paragraph.10.51.3.43) 9188 0 R (paragraph.10.51.3.44) 9190 0 R (paragraph.10.51.3.45) 9202 0 R (paragraph.10.51.3.46) 9204 0 R (paragraph.10.51.3.47) 9206 0 R (paragraph.10.51.3.48) 9209 0 R]
+/Limits [(paragraph.10.51.3.43) (paragraph.10.51.3.48)]
+>> endobj
+18757 0 obj <<
+/Names [(paragraph.10.51.3.49) 9223 0 R (paragraph.10.51.3.5) 9006 0 R (paragraph.10.51.3.50) 9226 0 R (paragraph.10.51.3.51) 9229 0 R (paragraph.10.51.3.52) 9242 0 R (paragraph.10.51.3.53) 9245 0 R]
+/Limits [(paragraph.10.51.3.49) (paragraph.10.51.3.53)]
+>> endobj
+18758 0 obj <<
+/Names [(paragraph.10.51.3.54) 9248 0 R (paragraph.10.51.3.55) 9264 0 R (paragraph.10.51.3.56) 9266 0 R (paragraph.10.51.3.57) 9269 0 R (paragraph.10.51.3.58) 9272 0 R (paragraph.10.51.3.59) 9286 0 R]
+/Limits [(paragraph.10.51.3.54) (paragraph.10.51.3.59)]
+>> endobj
+18759 0 obj <<
+/Names [(paragraph.10.51.3.6) 9008 0 R (paragraph.10.51.3.60) 9289 0 R (paragraph.10.51.3.61) 9302 0 R (paragraph.10.51.3.7) 9010 0 R (paragraph.10.51.3.8) 9013 0 R (paragraph.10.51.3.9) 9023 0 R]
+/Limits [(paragraph.10.51.3.6) (paragraph.10.51.3.9)]
+>> endobj
+18760 0 obj <<
+/Names [(paragraph.10.51.4.1) 9304 0 R (paragraph.10.51.4.2) 9305 0 R (paragraph.10.51.4.3) 9306 0 R (paragraph.10.51.4.4) 9307 0 R (paragraph.10.51.4.5) 9308 0 R (paragraph.10.51.4.6) 9309 0 R]
+/Limits [(paragraph.10.51.4.1) (paragraph.10.51.4.6)]
+>> endobj
+18761 0 obj <<
+/Names [(paragraph.10.52.2.1) 9340 0 R (paragraph.10.53.2.1) 9701 0 R (paragraph.10.53.3.1) 9713 0 R (paragraph.10.53.3.2) 9714 0 R (paragraph.10.53.4.1) 9716 0 R (paragraph.10.53.4.10) 9737 0 R]
+/Limits [(paragraph.10.52.2.1) (paragraph.10.53.4.10)]
+>> endobj
+18762 0 obj <<
+/Names [(paragraph.10.53.4.11) 9738 0 R (paragraph.10.53.4.12) 9739 0 R (paragraph.10.53.4.2) 9718 0 R (paragraph.10.53.4.3) 9720 0 R (paragraph.10.53.4.4) 9722 0 R (paragraph.10.53.4.5) 9730 0 R]
+/Limits [(paragraph.10.53.4.11) (paragraph.10.53.4.5)]
+>> endobj
+18763 0 obj <<
+/Names [(paragraph.10.53.4.6) 9731 0 R (paragraph.10.53.4.7) 9732 0 R (paragraph.10.53.4.8) 9734 0 R (paragraph.10.53.4.9) 9736 0 R (paragraph.10.53.5.1) 9750 0 R (paragraph.10.53.5.10) 9759 0 R]
+/Limits [(paragraph.10.53.4.6) (paragraph.10.53.5.10)]
+>> endobj
+18764 0 obj <<
+/Names [(paragraph.10.53.5.11) 9760 0 R (paragraph.10.53.5.12) 9761 0 R (paragraph.10.53.5.13) 9762 0 R (paragraph.10.53.5.14) 9763 0 R (paragraph.10.53.5.15) 9789 0 R (paragraph.10.53.5.16) 9790 0 R]
+/Limits [(paragraph.10.53.5.11) (paragraph.10.53.5.16)]
+>> endobj
+18765 0 obj <<
+/Names [(paragraph.10.53.5.17) 9791 0 R (paragraph.10.53.5.2) 9751 0 R (paragraph.10.53.5.3) 9752 0 R (paragraph.10.53.5.4) 9753 0 R (paragraph.10.53.5.5) 9754 0 R (paragraph.10.53.5.6) 9755 0 R]
+/Limits [(paragraph.10.53.5.17) (paragraph.10.53.5.6)]
+>> endobj
+18766 0 obj <<
+/Names [(paragraph.10.53.5.7) 9756 0 R (paragraph.10.53.5.8) 9757 0 R (paragraph.10.53.5.9) 9758 0 R (paragraph.10.53.6.1) 9793 0 R (paragraph.10.54.2.1) 9931 0 R (paragraph.10.54.3.1) 9933 0 R]
+/Limits [(paragraph.10.53.5.7) (paragraph.10.54.3.1)]
+>> endobj
+18767 0 obj <<
+/Names [(paragraph.10.54.3.2) 9934 0 R (paragraph.10.54.4.1) 9936 0 R (paragraph.10.54.4.2) 9937 0 R (paragraph.10.54.4.3) 9938 0 R (paragraph.10.54.4.4) 9939 0 R (paragraph.10.54.4.5) 9940 0 R]
+/Limits [(paragraph.10.54.3.2) (paragraph.10.54.4.5)]
+>> endobj
+18768 0 obj <<
+/Names [(paragraph.10.55.2.1) 9973 0 R (paragraph.10.61.2.1) 10101 0 R (paragraph.10.61.2.2) 10102 0 R (paragraph.10.61.2.3) 10112 0 R (paragraph.10.61.2.4) 10113 0 R (paragraph.10.61.2.5) 10114 0 R]
+/Limits [(paragraph.10.55.2.1) (paragraph.10.61.2.5)]
+>> endobj
+18769 0 obj <<
+/Names [(paragraph.10.62.2.1) 10153 0 R (paragraph.10.62.2.2) 10172 0 R (paragraph.10.62.2.3) 10174 0 R (paragraph.10.62.2.4) 10176 0 R (paragraph.10.62.2.5) 10178 0 R (paragraph.10.62.3.1) 10181 0 R]
+/Limits [(paragraph.10.62.2.1) (paragraph.10.62.3.1)]
+>> endobj
+18770 0 obj <<
+/Names [(paragraph.10.62.3.10) 10207 0 R (paragraph.10.62.3.2) 10188 0 R (paragraph.10.62.3.3) 10190 0 R (paragraph.10.62.3.4) 10192 0 R (paragraph.10.62.3.5) 10193 0 R (paragraph.10.62.3.6) 10194 0 R]
+/Limits [(paragraph.10.62.3.10) (paragraph.10.62.3.6)]
+>> endobj
+18771 0 obj <<
+/Names [(paragraph.10.62.3.7) 10195 0 R (paragraph.10.62.3.8) 10196 0 R (paragraph.10.62.3.9) 10205 0 R (paragraph.10.63.2.1) 10656 0 R (paragraph.10.63.2.2) 10657 0 R (paragraph.10.63.2.3) 10658 0 R]
+/Limits [(paragraph.10.62.3.7) (paragraph.10.63.2.3)]
+>> endobj
+18772 0 obj <<
+/Names [(paragraph.10.63.2.4) 10659 0 R (paragraph.10.63.3.1) 10663 0 R (paragraph.10.63.3.10) 10685 0 R (paragraph.10.63.3.11) 10686 0 R (paragraph.10.63.3.12) 10687 0 R (paragraph.10.63.3.2) 10664 0 R]
+/Limits [(paragraph.10.63.2.4) (paragraph.10.63.3.2)]
+>> endobj
+18773 0 obj <<
+/Names [(paragraph.10.63.3.3) 10671 0 R (paragraph.10.63.3.4) 10672 0 R (paragraph.10.63.3.5) 10674 0 R (paragraph.10.63.3.6) 10675 0 R (paragraph.10.63.3.7) 10676 0 R (paragraph.10.63.3.8) 10677 0 R]
+/Limits [(paragraph.10.63.3.3) (paragraph.10.63.3.8)]
+>> endobj
+18774 0 obj <<
+/Names [(paragraph.10.63.3.9) 10678 0 R (paragraph.10.63.4.1) 10689 0 R (paragraph.10.63.4.10) 10704 0 R (paragraph.10.63.4.11) 10705 0 R (paragraph.10.63.4.12) 10706 0 R (paragraph.10.63.4.13) 10707 0 R]
+/Limits [(paragraph.10.63.3.9) (paragraph.10.63.4.13)]
+>> endobj
+18775 0 obj <<
+/Names [(paragraph.10.63.4.14) 10708 0 R (paragraph.10.63.4.15) 10709 0 R (paragraph.10.63.4.16) 10710 0 R (paragraph.10.63.4.17) 10711 0 R (paragraph.10.63.4.18) 10712 0 R (paragraph.10.63.4.19) 10715 0 R]
+/Limits [(paragraph.10.63.4.14) (paragraph.10.63.4.19)]
+>> endobj
+18776 0 obj <<
+/Names [(paragraph.10.63.4.2) 10690 0 R (paragraph.10.63.4.20) 10722 0 R (paragraph.10.63.4.21) 10723 0 R (paragraph.10.63.4.22) 10726 0 R (paragraph.10.63.4.23) 10727 0 R (paragraph.10.63.4.24) 10728 0 R]
+/Limits [(paragraph.10.63.4.2) (paragraph.10.63.4.24)]
+>> endobj
+18777 0 obj <<
+/Names [(paragraph.10.63.4.25) 10729 0 R (paragraph.10.63.4.26) 10730 0 R (paragraph.10.63.4.27) 10731 0 R (paragraph.10.63.4.28) 10732 0 R (paragraph.10.63.4.29) 10733 0 R (paragraph.10.63.4.3) 10691 0 R]
+/Limits [(paragraph.10.63.4.25) (paragraph.10.63.4.3)]
+>> endobj
+18778 0 obj <<
+/Names [(paragraph.10.63.4.30) 10739 0 R (paragraph.10.63.4.31) 10740 0 R (paragraph.10.63.4.32) 10741 0 R (paragraph.10.63.4.33) 10742 0 R (paragraph.10.63.4.34) 10743 0 R (paragraph.10.63.4.35) 10744 0 R]
+/Limits [(paragraph.10.63.4.30) (paragraph.10.63.4.35)]
+>> endobj
+18779 0 obj <<
+/Names [(paragraph.10.63.4.36) 10745 0 R (paragraph.10.63.4.37) 10746 0 R (paragraph.10.63.4.38) 10747 0 R (paragraph.10.63.4.39) 10748 0 R (paragraph.10.63.4.4) 10692 0 R (paragraph.10.63.4.40) 10749 0 R]
+/Limits [(paragraph.10.63.4.36) (paragraph.10.63.4.40)]
+>> endobj
+18780 0 obj <<
+/Names [(paragraph.10.63.4.41) 10750 0 R (paragraph.10.63.4.42) 10751 0 R (paragraph.10.63.4.43) 10752 0 R (paragraph.10.63.4.44) 10753 0 R (paragraph.10.63.4.45) 10754 0 R (paragraph.10.63.4.46) 10755 0 R]
+/Limits [(paragraph.10.63.4.41) (paragraph.10.63.4.46)]
+>> endobj
+18781 0 obj <<
+/Names [(paragraph.10.63.4.47) 10756 0 R (paragraph.10.63.4.48) 10765 0 R (paragraph.10.63.4.49) 10766 0 R (paragraph.10.63.4.5) 10693 0 R (paragraph.10.63.4.50) 10767 0 R (paragraph.10.63.4.51) 10768 0 R]
+/Limits [(paragraph.10.63.4.47) (paragraph.10.63.4.51)]
+>> endobj
+18782 0 obj <<
+/Names [(paragraph.10.63.4.52) 10769 0 R (paragraph.10.63.4.53) 10770 0 R (paragraph.10.63.4.54) 10771 0 R (paragraph.10.63.4.55) 10772 0 R (paragraph.10.63.4.56) 10773 0 R (paragraph.10.63.4.57) 10774 0 R]
+/Limits [(paragraph.10.63.4.52) (paragraph.10.63.4.57)]
+>> endobj
+18783 0 obj <<
+/Names [(paragraph.10.63.4.58) 10775 0 R (paragraph.10.63.4.59) 10776 0 R (paragraph.10.63.4.6) 10694 0 R (paragraph.10.63.4.60) 10777 0 R (paragraph.10.63.4.7) 10695 0 R (paragraph.10.63.4.8) 10696 0 R]
+/Limits [(paragraph.10.63.4.58) (paragraph.10.63.4.8)]
+>> endobj
+18784 0 obj <<
+/Names [(paragraph.10.63.4.9) 10703 0 R (paragraph.10.64.2.1) 10867 0 R (paragraph.10.64.3.1) 10871 0 R (paragraph.10.64.3.2) 10872 0 R (paragraph.10.64.3.3) 10874 0 R (paragraph.10.64.4.1) 10892 0 R]
+/Limits [(paragraph.10.63.4.9) (paragraph.10.64.4.1)]
+>> endobj
+18785 0 obj <<
+/Names [(paragraph.10.64.4.2) 10893 0 R (paragraph.10.65.2.1) 11061 0 R (paragraph.10.65.2.2) 11071 0 R (paragraph.10.65.3.1) 11073 0 R (paragraph.10.65.3.2) 11076 0 R (paragraph.10.65.3.3) 11086 0 R]
+/Limits [(paragraph.10.64.4.2) (paragraph.10.65.3.3)]
+>> endobj
+18786 0 obj <<
+/Names [(paragraph.10.65.3.4) 11089 0 R (paragraph.10.65.4.1) 11093 0 R (paragraph.10.65.4.10) 11121 0 R (paragraph.10.65.4.11) 11130 0 R (paragraph.10.65.4.12) 11132 0 R (paragraph.10.65.4.2) 11100 0 R]
+/Limits [(paragraph.10.65.3.4) (paragraph.10.65.4.2)]
+>> endobj
+18787 0 obj <<
+/Names [(paragraph.10.65.4.3) 11103 0 R (paragraph.10.65.4.4) 11105 0 R (paragraph.10.65.4.5) 11107 0 R (paragraph.10.65.4.6) 11109 0 R (paragraph.10.65.4.7) 11116 0 R (paragraph.10.65.4.8) 11117 0 R]
+/Limits [(paragraph.10.65.4.3) (paragraph.10.65.4.8)]
+>> endobj
+18788 0 obj <<
+/Names [(paragraph.10.65.4.9) 11118 0 R (paragraph.10.65.5.1) 11135 0 R (paragraph.10.65.5.2) 11136 0 R (paragraph.10.65.5.3) 11137 0 R (paragraph.10.66.2.1) 11215 0 R (paragraph.10.67.2.1) 11319 0 R]
+/Limits [(paragraph.10.65.4.9) (paragraph.10.67.2.1)]
+>> endobj
+18789 0 obj <<
+/Names [(paragraph.10.67.2.10) 11359 0 R (paragraph.10.67.2.11) 11361 0 R (paragraph.10.67.2.12) 11363 0 R (paragraph.10.67.2.2) 11329 0 R (paragraph.10.67.2.3) 11331 0 R (paragraph.10.67.2.4) 11333 0 R]
+/Limits [(paragraph.10.67.2.10) (paragraph.10.67.2.4)]
+>> endobj
+18790 0 obj <<
+/Names [(paragraph.10.67.2.5) 11336 0 R (paragraph.10.67.2.6) 11345 0 R (paragraph.10.67.2.7) 11347 0 R (paragraph.10.67.2.8) 11349 0 R (paragraph.10.67.2.9) 11351 0 R (paragraph.10.67.3.1) 11366 0 R]
+/Limits [(paragraph.10.67.2.5) (paragraph.10.67.3.1)]
+>> endobj
+18791 0 obj <<
+/Names [(paragraph.10.69.2.1) 11385 0 R (paragraph.10.70.2.1) 11841 0 R (paragraph.10.70.2.10) 11871 0 R (paragraph.10.70.2.2) 11843 0 R (paragraph.10.70.2.3) 11844 0 R (paragraph.10.70.2.4) 11845 0 R]
+/Limits [(paragraph.10.69.2.1) (paragraph.10.70.2.4)]
+>> endobj
+18792 0 obj <<
+/Names [(paragraph.10.70.2.5) 11853 0 R (paragraph.10.70.2.6) 11856 0 R (paragraph.10.70.2.7) 11858 0 R (paragraph.10.70.2.8) 11859 0 R (paragraph.10.70.2.9) 11868 0 R (paragraph.10.70.3.1) 11880 0 R]
+/Limits [(paragraph.10.70.2.5) (paragraph.10.70.3.1)]
+>> endobj
+18793 0 obj <<
+/Names [(paragraph.10.70.3.10) 11903 0 R (paragraph.10.70.3.11) 11906 0 R (paragraph.10.70.3.12) 11914 0 R (paragraph.10.70.3.13) 11917 0 R (paragraph.10.70.3.14) 11927 0 R (paragraph.10.70.3.15) 11930 0 R]
+/Limits [(paragraph.10.70.3.10) (paragraph.10.70.3.15)]
+>> endobj
+18794 0 obj <<
+/Names [(paragraph.10.70.3.16) 11933 0 R (paragraph.10.70.3.17) 11941 0 R (paragraph.10.70.3.18) 11944 0 R (paragraph.10.70.3.19) 11947 0 R (paragraph.10.70.3.2) 11882 0 R (paragraph.10.70.3.20) 11956 0 R]
+/Limits [(paragraph.10.70.3.16) (paragraph.10.70.3.20)]
+>> endobj
+18795 0 obj <<
+/Names [(paragraph.10.70.3.21) 11959 0 R (paragraph.10.70.3.22) 11962 0 R (paragraph.10.70.3.23) 11965 0 R (paragraph.10.70.3.24) 11973 0 R (paragraph.10.70.3.25) 11976 0 R (paragraph.10.70.3.26) 11979 0 R]
+/Limits [(paragraph.10.70.3.21) (paragraph.10.70.3.26)]
+>> endobj
+18796 0 obj <<
+/Names [(paragraph.10.70.3.27) 11990 0 R (paragraph.10.70.3.28) 11993 0 R (paragraph.10.70.3.29) 11996 0 R (paragraph.10.70.3.3) 11884 0 R (paragraph.10.70.3.30) 12005 0 R (paragraph.10.70.3.31) 12007 0 R]
+/Limits [(paragraph.10.70.3.27) (paragraph.10.70.3.31)]
+>> endobj
+18797 0 obj <<
+/Names [(paragraph.10.70.3.32) 12009 0 R (paragraph.10.70.3.33) 12011 0 R (paragraph.10.70.3.34) 12022 0 R (paragraph.10.70.3.35) 12024 0 R (paragraph.10.70.3.36) 12027 0 R (paragraph.10.70.3.37) 12030 0 R]
+/Limits [(paragraph.10.70.3.32) (paragraph.10.70.3.37)]
+>> endobj
+18798 0 obj <<
+/Names [(paragraph.10.70.3.38) 12040 0 R (paragraph.10.70.3.39) 12043 0 R (paragraph.10.70.3.4) 11886 0 R (paragraph.10.70.3.40) 12055 0 R (paragraph.10.70.3.41) 12058 0 R (paragraph.10.70.3.42) 12061 0 R]
+/Limits [(paragraph.10.70.3.38) (paragraph.10.70.3.42)]
+>> endobj
+18799 0 obj <<
+/Names [(paragraph.10.70.3.43) 12074 0 R (paragraph.10.70.3.44) 12077 0 R (paragraph.10.70.3.45) 12079 0 R (paragraph.10.70.3.46) 12088 0 R (paragraph.10.70.3.47) 12090 0 R (paragraph.10.70.3.48) 12103 0 R]
+/Limits [(paragraph.10.70.3.43) (paragraph.10.70.3.48)]
+>> endobj
+18800 0 obj <<
+/Names [(paragraph.10.70.3.49) 12106 0 R (paragraph.10.70.3.5) 11888 0 R (paragraph.10.70.3.50) 12109 0 R (paragraph.10.70.3.51) 12112 0 R (paragraph.10.70.3.52) 12124 0 R (paragraph.10.70.3.53) 12127 0 R]
+/Limits [(paragraph.10.70.3.49) (paragraph.10.70.3.53)]
+>> endobj
+18801 0 obj <<
+/Names [(paragraph.10.70.3.54) 12130 0 R (paragraph.10.70.3.55) 12140 0 R (paragraph.10.70.3.56) 12142 0 R (paragraph.10.70.3.57) 12144 0 R (paragraph.10.70.3.58) 12159 0 R (paragraph.10.70.3.59) 12161 0 R]
+/Limits [(paragraph.10.70.3.54) (paragraph.10.70.3.59)]
+>> endobj
+18802 0 obj <<
+/Names [(paragraph.10.70.3.6) 11890 0 R (paragraph.10.70.3.60) 12163 0 R (paragraph.10.70.3.61) 12179 0 R (paragraph.10.70.3.62) 12183 0 R (paragraph.10.70.3.63) 12194 0 R (paragraph.10.70.3.64) 12196 0 R]
+/Limits [(paragraph.10.70.3.6) (paragraph.10.70.3.64)]
+>> endobj
+18803 0 obj <<
+/Names [(paragraph.10.70.3.7) 11897 0 R (paragraph.10.70.3.8) 11899 0 R (paragraph.10.70.3.9) 11901 0 R (paragraph.10.70.4.1) 12198 0 R (paragraph.10.70.4.2) 12199 0 R (paragraph.10.71.2.1) 12261 0 R]
+/Limits [(paragraph.10.70.3.7) (paragraph.10.71.2.1)]
+>> endobj
+18804 0 obj <<
+/Names [(paragraph.10.72.2.1) 12700 0 R (paragraph.10.72.2.10) 12742 0 R (paragraph.10.72.2.11) 12745 0 R (paragraph.10.72.2.12) 12753 0 R (paragraph.10.72.2.2) 12703 0 R (paragraph.10.72.2.3) 12711 0 R]
+/Limits [(paragraph.10.72.2.1) (paragraph.10.72.2.3)]
+>> endobj
+18805 0 obj <<
+/Names [(paragraph.10.72.2.4) 12714 0 R (paragraph.10.72.2.5) 12717 0 R (paragraph.10.72.2.6) 12720 0 R (paragraph.10.72.2.7) 12728 0 R (paragraph.10.72.2.8) 12731 0 R (paragraph.10.72.2.9) 12739 0 R]
+/Limits [(paragraph.10.72.2.4) (paragraph.10.72.2.9)]
+>> endobj
+18806 0 obj <<
+/Names [(paragraph.10.72.3.1) 12755 0 R (paragraph.10.72.3.10) 12788 0 R (paragraph.10.72.3.11) 12795 0 R (paragraph.10.72.3.12) 12797 0 R (paragraph.10.72.3.13) 12800 0 R (paragraph.10.72.3.14) 12802 0 R]
+/Limits [(paragraph.10.72.3.1) (paragraph.10.72.3.14)]
+>> endobj
+18807 0 obj <<
+/Names [(paragraph.10.72.3.15) 12810 0 R (paragraph.10.72.3.16) 12813 0 R (paragraph.10.72.3.17) 12816 0 R (paragraph.10.72.3.18) 12819 0 R (paragraph.10.72.3.19) 12828 0 R (paragraph.10.72.3.2) 12757 0 R]
+/Limits [(paragraph.10.72.3.15) (paragraph.10.72.3.2)]
+>> endobj
+18808 0 obj <<
+/Names [(paragraph.10.72.3.20) 12831 0 R (paragraph.10.72.3.21) 12834 0 R (paragraph.10.72.3.22) 12844 0 R (paragraph.10.72.3.23) 12847 0 R (paragraph.10.72.3.24) 12849 0 R (paragraph.10.72.3.25) 12851 0 R]
+/Limits [(paragraph.10.72.3.20) (paragraph.10.72.3.25)]
+>> endobj
+18809 0 obj <<
+/Names [(paragraph.10.72.3.26) 12853 0 R (paragraph.10.72.3.27) 12864 0 R (paragraph.10.72.3.28) 12867 0 R (paragraph.10.72.3.29) 12870 0 R (paragraph.10.72.3.3) 12759 0 R (paragraph.10.72.3.30) 12889 0 R]
+/Limits [(paragraph.10.72.3.26) (paragraph.10.72.3.30)]
+>> endobj
+18810 0 obj <<
+/Names [(paragraph.10.72.3.31) 12893 0 R (paragraph.10.72.3.32) 12896 0 R (paragraph.10.72.3.33) 12907 0 R (paragraph.10.72.3.34) 12910 0 R (paragraph.10.72.3.35) 12921 0 R (paragraph.10.72.3.36) 12923 0 R]
+/Limits [(paragraph.10.72.3.31) (paragraph.10.72.3.36)]
+>> endobj
+18811 0 obj <<
+/Names [(paragraph.10.72.3.37) 12926 0 R (paragraph.10.72.3.38) 12936 0 R (paragraph.10.72.3.39) 12938 0 R (paragraph.10.72.3.4) 12761 0 R (paragraph.10.72.3.40) 12941 0 R (paragraph.10.72.3.41) 12944 0 R]
+/Limits [(paragraph.10.72.3.37) (paragraph.10.72.3.41)]
+>> endobj
+18812 0 obj <<
+/Names [(paragraph.10.72.3.42) 12956 0 R (paragraph.10.72.3.43) 12959 0 R (paragraph.10.72.3.44) 12961 0 R (paragraph.10.72.3.45) 12977 0 R (paragraph.10.72.3.46) 12980 0 R (paragraph.10.72.3.47) 12984 0 R]
+/Limits [(paragraph.10.72.3.42) (paragraph.10.72.3.47)]
+>> endobj
+18813 0 obj <<
+/Names [(paragraph.10.72.3.5) 12768 0 R (paragraph.10.72.3.6) 12771 0 R (paragraph.10.72.3.7) 12774 0 R (paragraph.10.72.3.8) 12783 0 R (paragraph.10.72.3.9) 12786 0 R (paragraph.10.72.4.1) 12994 0 R]
+/Limits [(paragraph.10.72.3.5) (paragraph.10.72.4.1)]
+>> endobj
+18814 0 obj <<
+/Names [(paragraph.10.72.4.2) 12995 0 R (paragraph.10.72.4.3) 12996 0 R (paragraph.10.72.4.4) 12997 0 R (paragraph.10.76.2.1) 13365 0 R (paragraph.10.76.2.2) 13366 0 R (paragraph.10.76.3.1) 13368 0 R]
+/Limits [(paragraph.10.72.4.2) (paragraph.10.76.3.1)]
+>> endobj
+18815 0 obj <<
+/Names [(paragraph.10.76.3.2) 13379 0 R (paragraph.10.76.4.1) 13383 0 R (paragraph.10.76.4.10) 13410 0 R (paragraph.10.76.4.11) 13413 0 R (paragraph.10.76.4.2) 13384 0 R (paragraph.10.76.4.3) 13387 0 R]
+/Limits [(paragraph.10.76.3.2) (paragraph.10.76.4.3)]
+>> endobj
+18816 0 obj <<
+/Names [(paragraph.10.76.4.4) 13394 0 R (paragraph.10.76.4.5) 13396 0 R (paragraph.10.76.4.6) 13398 0 R (paragraph.10.76.4.7) 13399 0 R (paragraph.10.76.4.8) 13400 0 R (paragraph.10.76.4.9) 13401 0 R]
+/Limits [(paragraph.10.76.4.4) (paragraph.10.76.4.9)]
+>> endobj
+18817 0 obj <<
+/Names [(paragraph.10.76.5.1) 13415 0 R (paragraph.10.76.5.2) 13416 0 R (paragraph.10.76.5.3) 13417 0 R (paragraph.10.77.2.1) 13514 0 R (paragraph.10.77.3.1) 13516 0 R (paragraph.10.77.3.2) 13529 0 R]
+/Limits [(paragraph.10.76.5.1) (paragraph.10.77.3.2)]
+>> endobj
+18818 0 obj <<
+/Names [(paragraph.10.77.3.3) 13531 0 R (paragraph.10.78.2.1) 13671 0 R (paragraph.10.78.2.2) 13685 0 R (paragraph.10.78.2.3) 13687 0 R (paragraph.10.78.2.4) 13690 0 R (paragraph.10.78.2.5) 13693 0 R]
+/Limits [(paragraph.10.77.3.3) (paragraph.10.78.2.5)]
+>> endobj
+18819 0 obj <<
+/Names [(paragraph.10.78.2.6) 13706 0 R (paragraph.10.78.3.1) 13708 0 R (paragraph.10.79.2.1) 14104 0 R (paragraph.10.79.2.2) 14106 0 R (paragraph.10.79.2.3) 14107 0 R (paragraph.10.79.2.4) 14109 0 R]
+/Limits [(paragraph.10.78.2.6) (paragraph.10.79.2.4)]
+>> endobj
+18820 0 obj <<
+/Names [(paragraph.10.79.2.5) 14117 0 R (paragraph.10.79.2.6) 14120 0 R (paragraph.10.79.2.7) 14123 0 R (paragraph.10.79.2.8) 14131 0 R (paragraph.10.79.2.9) 14134 0 R (paragraph.10.79.3.1) 14138 0 R]
+/Limits [(paragraph.10.79.2.5) (paragraph.10.79.3.1)]
+>> endobj
+18821 0 obj <<
+/Names [(paragraph.10.79.3.10) 14176 0 R (paragraph.10.79.3.11) 14184 0 R (paragraph.10.79.3.12) 14186 0 R (paragraph.10.79.3.13) 14188 0 R (paragraph.10.79.3.14) 14190 0 R (paragraph.10.79.3.15) 14192 0 R]
+/Limits [(paragraph.10.79.3.10) (paragraph.10.79.3.15)]
+>> endobj
+18822 0 obj <<
+/Names [(paragraph.10.79.3.16) 14194 0 R (paragraph.10.79.3.17) 14200 0 R (paragraph.10.79.3.18) 14202 0 R (paragraph.10.79.3.19) 14204 0 R (paragraph.10.79.3.2) 14145 0 R (paragraph.10.79.3.20) 14207 0 R]
+/Limits [(paragraph.10.79.3.16) (paragraph.10.79.3.20)]
+>> endobj
+18823 0 obj <<
+/Names [(paragraph.10.79.3.21) 14210 0 R (paragraph.10.79.3.22) 14218 0 R (paragraph.10.79.3.23) 14220 0 R (paragraph.10.79.3.24) 14223 0 R (paragraph.10.79.3.25) 14226 0 R (paragraph.10.79.3.26) 14237 0 R]
+/Limits [(paragraph.10.79.3.21) (paragraph.10.79.3.26)]
+>> endobj
+18824 0 obj <<
+/Names [(paragraph.10.79.3.27) 14240 0 R (paragraph.10.79.3.28) 14243 0 R (paragraph.10.79.3.29) 14252 0 R (paragraph.10.79.3.3) 14148 0 R (paragraph.10.79.3.30) 14254 0 R (paragraph.10.79.3.31) 14255 0 R]
+/Limits [(paragraph.10.79.3.27) (paragraph.10.79.3.31)]
+>> endobj
+18825 0 obj <<
+/Names [(paragraph.10.79.3.32) 14257 0 R (paragraph.10.79.3.33) 14259 0 R (paragraph.10.79.3.34) 14269 0 R (paragraph.10.79.3.35) 14272 0 R (paragraph.10.79.3.36) 14288 0 R (paragraph.10.79.3.37) 14292 0 R]
+/Limits [(paragraph.10.79.3.32) (paragraph.10.79.3.37)]
+>> endobj
+18826 0 obj <<
+/Names [(paragraph.10.79.3.38) 14295 0 R (paragraph.10.79.3.39) 14307 0 R (paragraph.10.79.3.4) 14150 0 R (paragraph.10.79.3.40) 14310 0 R (paragraph.10.79.3.41) 14313 0 R (paragraph.10.79.3.42) 14324 0 R]
+/Limits [(paragraph.10.79.3.38) (paragraph.10.79.3.42)]
+>> endobj
+18827 0 obj <<
+/Names [(paragraph.10.79.3.43) 14327 0 R (paragraph.10.79.3.44) 14328 0 R (paragraph.10.79.3.45) 14342 0 R (paragraph.10.79.3.46) 14346 0 R (paragraph.10.79.3.47) 14357 0 R (paragraph.10.79.3.48) 14360 0 R]
+/Limits [(paragraph.10.79.3.43) (paragraph.10.79.3.48)]
+>> endobj
+18828 0 obj <<
+/Names [(paragraph.10.79.3.49) 14362 0 R (paragraph.10.79.3.5) 14152 0 R (paragraph.10.79.3.50) 14363 0 R (paragraph.10.79.3.51) 14366 0 R (paragraph.10.79.3.6) 14160 0 R (paragraph.10.79.3.7) 14163 0 R]
+/Limits [(paragraph.10.79.3.49) (paragraph.10.79.3.7)]
+>> endobj
+18829 0 obj <<
+/Names [(paragraph.10.79.3.8) 14171 0 R (paragraph.10.79.3.9) 14174 0 R (paragraph.10.79.4.1) 14387 0 R (paragraph.10.8.2.1) 4392 0 R (paragraph.10.8.2.10) 4422 0 R (paragraph.10.8.2.11) 4423 0 R]
+/Limits [(paragraph.10.79.3.8) (paragraph.10.8.2.11)]
+>> endobj
+18830 0 obj <<
+/Names [(paragraph.10.8.2.12) 4424 0 R (paragraph.10.8.2.13) 4425 0 R (paragraph.10.8.2.14) 4432 0 R (paragraph.10.8.2.2) 4394 0 R (paragraph.10.8.2.3) 4403 0 R (paragraph.10.8.2.4) 4404 0 R]
+/Limits [(paragraph.10.8.2.12) (paragraph.10.8.2.4)]
+>> endobj
+18831 0 obj <<
+/Names [(paragraph.10.8.2.5) 4406 0 R (paragraph.10.8.2.6) 4408 0 R (paragraph.10.8.2.7) 4410 0 R (paragraph.10.8.2.8) 4418 0 R (paragraph.10.8.2.9) 4420 0 R (paragraph.10.8.3.1) 4434 0 R]
+/Limits [(paragraph.10.8.2.5) (paragraph.10.8.3.1)]
+>> endobj
+18832 0 obj <<
+/Names [(paragraph.10.8.3.10) 4465 0 R (paragraph.10.8.3.11) 4468 0 R (paragraph.10.8.3.12) 4479 0 R (paragraph.10.8.3.13) 4481 0 R (paragraph.10.8.3.14) 4483 0 R (paragraph.10.8.3.15) 4485 0 R]
+/Limits [(paragraph.10.8.3.10) (paragraph.10.8.3.15)]
+>> endobj
+18833 0 obj <<
+/Names [(paragraph.10.8.3.16) 4493 0 R (paragraph.10.8.3.17) 4496 0 R (paragraph.10.8.3.18) 4499 0 R (paragraph.10.8.3.19) 4502 0 R (paragraph.10.8.3.2) 4436 0 R (paragraph.10.8.3.20) 4510 0 R]
+/Limits [(paragraph.10.8.3.16) (paragraph.10.8.3.20)]
+>> endobj
+18834 0 obj <<
+/Names [(paragraph.10.8.3.21) 4513 0 R (paragraph.10.8.3.22) 4516 0 R (paragraph.10.8.3.23) 4527 0 R (paragraph.10.8.3.24) 4530 0 R (paragraph.10.8.3.25) 4533 0 R (paragraph.10.8.3.26) 4536 0 R]
+/Limits [(paragraph.10.8.3.21) (paragraph.10.8.3.26)]
+>> endobj
+18835 0 obj <<
+/Names [(paragraph.10.8.3.27) 4547 0 R (paragraph.10.8.3.28) 4550 0 R (paragraph.10.8.3.29) 4553 0 R (paragraph.10.8.3.3) 4438 0 R (paragraph.10.8.3.30) 4562 0 R (paragraph.10.8.3.31) 4564 0 R]
+/Limits [(paragraph.10.8.3.27) (paragraph.10.8.3.31)]
+>> endobj
+18836 0 obj <<
+/Names [(paragraph.10.8.3.32) 4566 0 R (paragraph.10.8.3.33) 4568 0 R (paragraph.10.8.3.34) 4570 0 R (paragraph.10.8.3.35) 4581 0 R (paragraph.10.8.3.36) 4584 0 R (paragraph.10.8.3.37) 4587 0 R]
+/Limits [(paragraph.10.8.3.32) (paragraph.10.8.3.37)]
+>> endobj
+18837 0 obj <<
+/Names [(paragraph.10.8.3.38) 4598 0 R (paragraph.10.8.3.39) 4601 0 R (paragraph.10.8.3.4) 4440 0 R (paragraph.10.8.3.40) 4604 0 R (paragraph.10.8.3.41) 4615 0 R (paragraph.10.8.3.42) 4618 0 R]
+/Limits [(paragraph.10.8.3.38) (paragraph.10.8.3.42)]
+>> endobj
+18838 0 obj <<
+/Names [(paragraph.10.8.3.43) 4621 0 R (paragraph.10.8.3.44) 4634 0 R (paragraph.10.8.3.45) 4637 0 R (paragraph.10.8.3.46) 4648 0 R (paragraph.10.8.3.47) 4650 0 R (paragraph.10.8.3.48) 4653 0 R]
+/Limits [(paragraph.10.8.3.43) (paragraph.10.8.3.48)]
+>> endobj
+18839 0 obj <<
+/Names [(paragraph.10.8.3.49) 4656 0 R (paragraph.10.8.3.5) 4447 0 R (paragraph.10.8.3.50) 4667 0 R (paragraph.10.8.3.51) 4670 0 R (paragraph.10.8.3.52) 4679 0 R (paragraph.10.8.3.53) 4681 0 R]
+/Limits [(paragraph.10.8.3.49) (paragraph.10.8.3.53)]
+>> endobj
+18840 0 obj <<
+/Names [(paragraph.10.8.3.54) 4682 0 R (paragraph.10.8.3.55) 4685 0 R (paragraph.10.8.3.56) 4699 0 R (paragraph.10.8.3.57) 4701 0 R (paragraph.10.8.3.58) 4704 0 R (paragraph.10.8.3.59) 4716 0 R]
+/Limits [(paragraph.10.8.3.54) (paragraph.10.8.3.59)]
+>> endobj
+18841 0 obj <<
+/Names [(paragraph.10.8.3.6) 4449 0 R (paragraph.10.8.3.60) 4718 0 R (paragraph.10.8.3.61) 4720 0 R (paragraph.10.8.3.62) 4729 0 R (paragraph.10.8.3.63) 4730 0 R (paragraph.10.8.3.7) 4451 0 R]
+/Limits [(paragraph.10.8.3.6) (paragraph.10.8.3.7)]
+>> endobj
+18842 0 obj <<
+/Names [(paragraph.10.8.3.8) 4454 0 R (paragraph.10.8.3.9) 4462 0 R (paragraph.10.8.4.1) 4732 0 R (paragraph.10.8.4.2) 4733 0 R (paragraph.10.80.2.1) 14453 0 R (paragraph.10.80.2.2) 14472 0 R]
+/Limits [(paragraph.10.8.3.8) (paragraph.10.80.2.2)]
+>> endobj
+18843 0 obj <<
+/Names [(paragraph.10.80.2.3) 14473 0 R (paragraph.10.80.2.4) 14474 0 R (paragraph.10.80.2.5) 14475 0 R (paragraph.10.80.2.6) 14476 0 R (paragraph.10.80.2.7) 14477 0 R (paragraph.10.80.2.8) 14478 0 R]
+/Limits [(paragraph.10.80.2.3) (paragraph.10.80.2.8)]
+>> endobj
+18844 0 obj <<
+/Names [(paragraph.10.81.2.1) 14528 0 R (paragraph.10.81.2.2) 14530 0 R (paragraph.10.81.2.3) 14532 0 R (paragraph.10.81.2.4) 14534 0 R (paragraph.10.81.2.5) 14551 0 R (paragraph.10.81.2.6) 14552 0 R]
+/Limits [(paragraph.10.81.2.1) (paragraph.10.81.2.6)]
+>> endobj
+18845 0 obj <<
+/Names [(paragraph.10.81.2.7) 14553 0 R (paragraph.10.81.2.8) 14554 0 R (paragraph.10.82.2.1) 15068 0 R (paragraph.10.82.2.2) 15070 0 R (paragraph.10.82.2.3) 15071 0 R (paragraph.10.82.2.4) 15079 0 R]
+/Limits [(paragraph.10.81.2.7) (paragraph.10.82.2.4)]
+>> endobj
+18846 0 obj <<
+/Names [(paragraph.10.82.2.5) 15082 0 R (paragraph.10.82.2.6) 15085 0 R (paragraph.10.82.2.7) 15093 0 R (paragraph.10.82.3.1) 15096 0 R (paragraph.10.82.3.10) 15126 0 R (paragraph.10.82.3.11) 15129 0 R]
+/Limits [(paragraph.10.82.2.5) (paragraph.10.82.3.11)]
+>> endobj
+18847 0 obj <<
+/Names [(paragraph.10.82.3.12) 15140 0 R (paragraph.10.82.3.13) 15143 0 R (paragraph.10.82.3.14) 15145 0 R (paragraph.10.82.3.15) 15147 0 R (paragraph.10.82.3.16) 15154 0 R (paragraph.10.82.3.17) 15157 0 R]
+/Limits [(paragraph.10.82.3.12) (paragraph.10.82.3.17)]
+>> endobj
+18848 0 obj <<
+/Names [(paragraph.10.82.3.18) 15159 0 R (paragraph.10.82.3.19) 15161 0 R (paragraph.10.82.3.2) 15098 0 R (paragraph.10.82.3.20) 15169 0 R (paragraph.10.82.3.21) 15172 0 R (paragraph.10.82.3.22) 15175 0 R]
+/Limits [(paragraph.10.82.3.18) (paragraph.10.82.3.22)]
+>> endobj
+18849 0 obj <<
+/Names [(paragraph.10.82.3.23) 15183 0 R (paragraph.10.82.3.24) 15186 0 R (paragraph.10.82.3.25) 15189 0 R (paragraph.10.82.3.26) 15196 0 R (paragraph.10.82.3.27) 15198 0 R (paragraph.10.82.3.28) 15201 0 R]
+/Limits [(paragraph.10.82.3.23) (paragraph.10.82.3.28)]
+>> endobj
+18850 0 obj <<
+/Names [(paragraph.10.82.3.29) 15204 0 R (paragraph.10.82.3.3) 15100 0 R (paragraph.10.82.3.30) 15214 0 R (paragraph.10.82.3.31) 15217 0 R (paragraph.10.82.3.32) 15219 0 R (paragraph.10.82.3.33) 15232 0 R]
+/Limits [(paragraph.10.82.3.29) (paragraph.10.82.3.33)]
+>> endobj
+18851 0 obj <<
+/Names [(paragraph.10.82.3.34) 15235 0 R (paragraph.10.82.3.35) 15237 0 R (paragraph.10.82.3.36) 15239 0 R (paragraph.10.82.3.37) 15241 0 R (paragraph.10.82.3.38) 15243 0 R (paragraph.10.82.3.39) 15253 0 R]
+/Limits [(paragraph.10.82.3.34) (paragraph.10.82.3.39)]
+>> endobj
+18852 0 obj <<
+/Names [(paragraph.10.82.3.4) 15102 0 R (paragraph.10.82.3.40) 15256 0 R (paragraph.10.82.3.41) 15269 0 R (paragraph.10.82.3.42) 15273 0 R (paragraph.10.82.3.43) 15277 0 R (paragraph.10.82.3.44) 15290 0 R]
+/Limits [(paragraph.10.82.3.4) (paragraph.10.82.3.44)]
+>> endobj
+18853 0 obj <<
+/Names [(paragraph.10.82.3.45) 15293 0 R (paragraph.10.82.3.46) 15296 0 R (paragraph.10.82.3.47) 15308 0 R (paragraph.10.82.3.48) 15310 0 R (paragraph.10.82.3.49) 15320 0 R (paragraph.10.82.3.5) 15109 0 R]
+/Limits [(paragraph.10.82.3.45) (paragraph.10.82.3.5)]
+>> endobj
+18854 0 obj <<
+/Names [(paragraph.10.82.3.50) 15322 0 R (paragraph.10.82.3.51) 15324 0 R (paragraph.10.82.3.52) 15341 0 R (paragraph.10.82.3.53) 15345 0 R (paragraph.10.82.3.54) 15348 0 R (paragraph.10.82.3.55) 15363 0 R]
+/Limits [(paragraph.10.82.3.50) (paragraph.10.82.3.55)]
+>> endobj
+18855 0 obj <<
+/Names [(paragraph.10.82.3.56) 15367 0 R (paragraph.10.82.3.57) 15370 0 R (paragraph.10.82.3.58) 15383 0 R (paragraph.10.82.3.59) 15386 0 R (paragraph.10.82.3.6) 15111 0 R (paragraph.10.82.3.60) 15388 0 R]
+/Limits [(paragraph.10.82.3.56) (paragraph.10.82.3.60)]
+>> endobj
+18856 0 obj <<
+/Names [(paragraph.10.82.3.61) 15401 0 R (paragraph.10.82.3.62) 15403 0 R (paragraph.10.82.3.63) 15405 0 R (paragraph.10.82.3.64) 15418 0 R (paragraph.10.82.3.65) 15422 0 R (paragraph.10.82.3.66) 15424 0 R]
+/Limits [(paragraph.10.82.3.61) (paragraph.10.82.3.66)]
+>> endobj
+18857 0 obj <<
+/Names [(paragraph.10.82.3.67) 15425 0 R (paragraph.10.82.3.68) 15433 0 R (paragraph.10.82.3.69) 15435 0 R (paragraph.10.82.3.7) 15113 0 R (paragraph.10.82.3.70) 15437 0 R (paragraph.10.82.3.8) 15115 0 R]
+/Limits [(paragraph.10.82.3.67) (paragraph.10.82.3.8)]
+>> endobj
+18858 0 obj <<
+/Names [(paragraph.10.82.3.9) 15118 0 R (paragraph.10.82.4.1) 15451 0 R (paragraph.10.82.4.2) 15452 0 R (paragraph.10.82.4.3) 15453 0 R (paragraph.10.82.4.4) 15454 0 R (paragraph.10.82.4.5) 15455 0 R]
+/Limits [(paragraph.10.82.3.9) (paragraph.10.82.4.5)]
+>> endobj
+18859 0 obj <<
+/Names [(paragraph.10.82.4.6) 15456 0 R (paragraph.10.83.2.1) 15634 0 R (paragraph.10.83.2.2) 15635 0 R (paragraph.10.83.3.1) 15638 0 R (paragraph.10.83.3.2) 15639 0 R (paragraph.10.83.3.3) 15640 0 R]
+/Limits [(paragraph.10.82.4.6) (paragraph.10.83.3.3)]
+>> endobj
+18860 0 obj <<
+/Names [(paragraph.10.83.3.4) 15642 0 R (paragraph.10.83.3.5) 15643 0 R (paragraph.10.83.3.6) 15650 0 R (paragraph.10.83.4.1) 15652 0 R (paragraph.10.83.4.2) 15653 0 R (paragraph.10.86.2.1) 15673 0 R]
+/Limits [(paragraph.10.83.3.4) (paragraph.10.86.2.1)]
+>> endobj
+18861 0 obj <<
+/Names [(paragraph.10.87.2.1) 15691 0 R (paragraph.10.88.2.1) 15767 0 R (paragraph.10.9.2.1) 4832 0 R (paragraph.10.9.2.10) 4874 0 R (paragraph.10.9.2.11) 4876 0 R (paragraph.10.9.2.12) 4878 0 R]
+/Limits [(paragraph.10.87.2.1) (paragraph.10.9.2.12)]
+>> endobj
+18862 0 obj <<
+/Names [(paragraph.10.9.2.13) 4891 0 R (paragraph.10.9.2.2) 4843 0 R (paragraph.10.9.2.3) 4846 0 R (paragraph.10.9.2.4) 4849 0 R (paragraph.10.9.2.5) 4852 0 R (paragraph.10.9.2.6) 4860 0 R]
+/Limits [(paragraph.10.9.2.13) (paragraph.10.9.2.6)]
+>> endobj
+18863 0 obj <<
+/Names [(paragraph.10.9.2.7) 4862 0 R (paragraph.10.9.2.8) 4864 0 R (paragraph.10.9.2.9) 4866 0 R (paragraph.10.9.3.1) 4893 0 R (paragraph.10.94.2.1) 15898 0 R (paragraph.10.94.3.1) 15901 0 R]
+/Limits [(paragraph.10.9.2.7) (paragraph.10.94.3.1)]
+>> endobj
+18864 0 obj <<
+/Names [(paragraph.10.94.4.1) 15903 0 R (paragraph.10.94.4.2) 15904 0 R (paragraph.10.94.4.3) 15905 0 R (paragraph.10.94.4.4) 15906 0 R (paragraph.10.95.2.1) 15975 0 R (paragraph.10.95.2.2) 15995 0 R]
+/Limits [(paragraph.10.94.4.1) (paragraph.10.95.2.2)]
+>> endobj
+18865 0 obj <<
+/Names [(paragraph.10.96.2.1) 16035 0 R (paragraph.10.96.3.1) 16047 0 R (paragraph.8.1.2.1) 2374 0 R (paragraph.8.1.2.2) 2375 0 R (paragraph.8.1.2.3) 2376 0 R (paragraph.8.1.2.4) 2377 0 R]
+/Limits [(paragraph.10.96.2.1) (paragraph.8.1.2.4)]
+>> endobj
+18866 0 obj <<
+/Names [(paragraph.8.1.3.1) 2379 0 R (paragraph.8.1.3.2) 2394 0 R (paragraph.8.1.3.3) 2395 0 R (paragraph.8.1.4.1) 2397 0 R (paragraph.8.1.4.10) 2427 0 R (paragraph.8.1.4.11) 2428 0 R]
+/Limits [(paragraph.8.1.3.1) (paragraph.8.1.4.11)]
+>> endobj
+18867 0 obj <<
+/Names [(paragraph.8.1.4.12) 2429 0 R (paragraph.8.1.4.13) 2435 0 R (paragraph.8.1.4.2) 2403 0 R (paragraph.8.1.4.3) 2404 0 R (paragraph.8.1.4.4) 2405 0 R (paragraph.8.1.4.5) 2414 0 R]
+/Limits [(paragraph.8.1.4.12) (paragraph.8.1.4.5)]
+>> endobj
+18868 0 obj <<
+/Names [(paragraph.8.1.4.6) 2415 0 R (paragraph.8.1.4.7) 2416 0 R (paragraph.8.1.4.8) 2417 0 R (paragraph.8.1.4.9) 2418 0 R (paragraph.8.1.5.1) 2437 0 R (paragraph.8.1.5.10) 2447 0 R]
+/Limits [(paragraph.8.1.4.6) (paragraph.8.1.5.10)]
+>> endobj
+18869 0 obj <<
+/Names [(paragraph.8.1.5.11) 2448 0 R (paragraph.8.1.5.12) 2449 0 R (paragraph.8.1.5.13) 2450 0 R (paragraph.8.1.5.14) 2451 0 R (paragraph.8.1.5.15) 2452 0 R (paragraph.8.1.5.16) 2453 0 R]
+/Limits [(paragraph.8.1.5.11) (paragraph.8.1.5.16)]
+>> endobj
+18870 0 obj <<
+/Names [(paragraph.8.1.5.17) 2454 0 R (paragraph.8.1.5.18) 2455 0 R (paragraph.8.1.5.19) 2456 0 R (paragraph.8.1.5.2) 2439 0 R (paragraph.8.1.5.20) 2464 0 R (paragraph.8.1.5.21) 2467 0 R]
+/Limits [(paragraph.8.1.5.17) (paragraph.8.1.5.21)]
+>> endobj
+18871 0 obj <<
+/Names [(paragraph.8.1.5.22) 2478 0 R (paragraph.8.1.5.23) 2481 0 R (paragraph.8.1.5.24) 2491 0 R (paragraph.8.1.5.25) 2501 0 R (paragraph.8.1.5.26) 2505 0 R (paragraph.8.1.5.27) 2514 0 R]
+/Limits [(paragraph.8.1.5.22) (paragraph.8.1.5.27)]
+>> endobj
+18872 0 obj <<
+/Names [(paragraph.8.1.5.28) 2531 0 R (paragraph.8.1.5.29) 2532 0 R (paragraph.8.1.5.3) 2440 0 R (paragraph.8.1.5.30) 2533 0 R (paragraph.8.1.5.31) 2534 0 R (paragraph.8.1.5.32) 2546 0 R]
+/Limits [(paragraph.8.1.5.28) (paragraph.8.1.5.32)]
+>> endobj
+18873 0 obj <<
+/Names [(paragraph.8.1.5.33) 2547 0 R (paragraph.8.1.5.4) 2441 0 R (paragraph.8.1.5.5) 2442 0 R (paragraph.8.1.5.6) 2443 0 R (paragraph.8.1.5.7) 2444 0 R (paragraph.8.1.5.8) 2445 0 R]
+/Limits [(paragraph.8.1.5.33) (paragraph.8.1.5.8)]
+>> endobj
+18874 0 obj <<
+/Names [(paragraph.8.1.5.9) 2446 0 R (paragraph.8.1.6.1) 2549 0 R (paragraph.9.1.2.1) 2939 0 R (paragraph.9.1.2.2) 2940 0 R (paragraph.9.1.2.3) 2941 0 R (paragraph.9.1.3.1) 2943 0 R]
+/Limits [(paragraph.8.1.5.9) (paragraph.9.1.3.1)]
+>> endobj
+18875 0 obj <<
+/Names [(paragraph.9.1.3.2) 2944 0 R (paragraph.9.1.4.1) 2946 0 R (paragraph.9.1.4.2) 2955 0 R (paragraph.9.1.4.3) 2956 0 R (paragraph.9.1.4.4) 2958 0 R (paragraph.9.1.4.5) 2960 0 R]
+/Limits [(paragraph.9.1.3.2) (paragraph.9.1.4.5)]
+>> endobj
+18876 0 obj <<
+/Names [(paragraph.9.2.2.1) 2971 0 R (section*.1) 1444 0 R (section*.10) 1474 0 R (section*.100) 6415 0 R (section*.101) 6417 0 R (section*.102) 6564 0 R]
+/Limits [(paragraph.9.2.2.1) (section*.102)]
+>> endobj
+18877 0 obj <<
+/Names [(section*.103) 6572 0 R (section*.104) 6573 0 R (section*.105) 6899 0 R (section*.106) 6957 0 R (section*.107) 6962 0 R (section*.108) 7004 0 R]
+/Limits [(section*.103) (section*.108)]
+>> endobj
+18878 0 obj <<
+/Names [(section*.109) 7027 0 R (section*.11) 1480 0 R (section*.110) 7031 0 R (section*.111) 7070 0 R (section*.112) 7084 0 R (section*.113) 7106 0 R]
+/Limits [(section*.109) (section*.113)]
+>> endobj
+18879 0 obj <<
+/Names [(section*.114) 7116 0 R (section*.115) 7154 0 R (section*.116) 7182 0 R (section*.117) 7186 0 R (section*.118) 7188 0 R (section*.119) 7237 0 R]
+/Limits [(section*.114) (section*.119)]
+>> endobj
+18880 0 obj <<
+/Names [(section*.12) 1481 0 R (section*.120) 7243 0 R (section*.121) 7265 0 R (section*.122) 7267 0 R (section*.123) 7285 0 R (section*.124) 7302 0 R]
+/Limits [(section*.12) (section*.124)]
+>> endobj
+18881 0 obj <<
+/Names [(section*.125) 7344 0 R (section*.126) 7347 0 R (section*.127) 7396 0 R (section*.128) 7398 0 R (section*.129) 7399 0 R (section*.13) 1482 0 R]
+/Limits [(section*.125) (section*.13)]
+>> endobj
+18882 0 obj <<
+/Names [(section*.130) 7420 0 R (section*.131) 7424 0 R (section*.132) 7427 0 R (section*.133) 7471 0 R (section*.134) 7472 0 R (section*.135) 7475 0 R]
+/Limits [(section*.130) (section*.135)]
+>> endobj
+18883 0 obj <<
+/Names [(section*.136) 7476 0 R (section*.137) 7478 0 R (section*.138) 7537 0 R (section*.139) 7548 0 R (section*.14) 1488 0 R (section*.140) 7583 0 R]
+/Limits [(section*.136) (section*.140)]
+>> endobj
+18884 0 obj <<
+/Names [(section*.141) 7585 0 R (section*.142) 7734 0 R (section*.143) 7744 0 R (section*.144) 7837 0 R (section*.145) 8207 0 R (section*.146) 8265 0 R]
+/Limits [(section*.141) (section*.146)]
+>> endobj
+18885 0 obj <<
+/Names [(section*.147) 8270 0 R (section*.148) 8325 0 R (section*.149) 8401 0 R (section*.15) 1495 0 R (section*.150) 8461 0 R (section*.151) 8463 0 R]
+/Limits [(section*.147) (section*.151)]
+>> endobj
+18886 0 obj <<
+/Names [(section*.152) 8863 0 R (section*.153) 8899 0 R (section*.154) 9330 0 R (section*.155) 9331 0 R (section*.156) 9397 0 R (section*.157) 9399 0 R]
+/Limits [(section*.152) (section*.157)]
+>> endobj
+18887 0 obj <<
+/Names [(section*.158) 9493 0 R (section*.159) 9578 0 R (section*.16) 1496 0 R (section*.160) 9579 0 R (section*.161) 9794 0 R (section*.162) 9795 0 R]
+/Limits [(section*.158) (section*.162)]
+>> endobj
+18888 0 obj <<
+/Names [(section*.163) 9903 0 R (section*.164) 9908 0 R (section*.165) 9961 0 R (section*.166) 9962 0 R (section*.167) 9984 0 R (section*.168) 10007 0 R]
+/Limits [(section*.163) (section*.168)]
+>> endobj
+18889 0 obj <<
+/Names [(section*.169) 10011 0 R (section*.17) 1497 0 R (section*.170) 10031 0 R (section*.171) 10059 0 R (section*.172) 10060 0 R (section*.173) 10099 0 R]
+/Limits [(section*.169) (section*.173)]
+>> endobj
+18890 0 obj <<
+/Names [(section*.174) 10115 0 R (section*.175) 10267 0 R (section*.176) 10268 0 R (section*.177) 10441 0 R (section*.178) 10445 0 R (section*.179) 10778 0 R]
+/Limits [(section*.174) (section*.179)]
+>> endobj
+18891 0 obj <<
+/Names [(section*.18) 1498 0 R (section*.180) 10835 0 R (section*.181) 10855 0 R (section*.182) 10857 0 R (section*.183) 10894 0 R (section*.184) 10895 0 R]
+/Limits [(section*.18) (section*.184)]
+>> endobj
+18892 0 obj <<
+/Names [(section*.185) 10960 0 R (section*.186) 11035 0 R (section*.187) 11058 0 R (section*.188) 11173 0 R (section*.189) 11179 0 R (section*.19) 1499 0 R]
+/Limits [(section*.185) (section*.19)]
+>> endobj
+18893 0 obj <<
+/Names [(section*.190) 11200 0 R (section*.191) 11202 0 R (section*.192) 11262 0 R (section*.193) 11316 0 R (section*.194) 11378 0 R (section*.195) 11382 0 R]
+/Limits [(section*.190) (section*.195)]
+>> endobj
+18894 0 obj <<
+/Names [(section*.196) 11422 0 R (section*.197) 11425 0 R (section*.198) 11808 0 R (section*.199) 11812 0 R (section*.2) 1445 0 R (section*.20) 1507 0 R]
+/Limits [(section*.196) (section*.20)]
+>> endobj
+18895 0 obj <<
+/Names [(section*.200) 11834 0 R (section*.201) 12233 0 R (section*.202) 12239 0 R (section*.203) 12257 0 R (section*.204) 12259 0 R (section*.205) 12302 0 R]
+/Limits [(section*.200) (section*.205)]
+>> endobj
+18896 0 obj <<
+/Names [(section*.206) 12652 0 R (section*.207) 12654 0 R (section*.208) 12657 0 R (section*.209) 12661 0 R (section*.21) 1508 0 R (section*.210) 12665 0 R]
+/Limits [(section*.206) (section*.210)]
+>> endobj
+18897 0 obj <<
+/Names [(section*.211) 12691 0 R (section*.212) 13018 0 R (section*.213) 13026 0 R (section*.214) 13064 0 R (section*.215) 13067 0 R (section*.216) 13077 0 R]
+/Limits [(section*.211) (section*.216)]
+>> endobj
+18898 0 obj <<
+/Names [(section*.217) 13106 0 R (section*.218) 13163 0 R (section*.219) 13169 0 R (section*.22) 1539 0 R (section*.220) 13171 0 R (section*.221) 13174 0 R]
+/Limits [(section*.217) (section*.221)]
+>> endobj
+18899 0 obj <<
+/Names [(section*.222) 13292 0 R (section*.223) 13294 0 R (section*.224) 13444 0 R (section*.225) 13445 0 R (section*.226) 13501 0 R (section*.227) 13510 0 R]
+/Limits [(section*.222) (section*.227)]
+>> endobj
+18900 0 obj <<
+/Names [(section*.228) 13558 0 R (section*.229) 13559 0 R (section*.23) 2005 0 R (section*.230) 13561 0 R (section*.231) 13626 0 R (section*.232) 13627 0 R]
+/Limits [(section*.228) (section*.232)]
+>> endobj
+18901 0 obj <<
+/Names [(section*.233) 13660 0 R (section*.234) 13663 0 R (section*.235) 13668 0 R (section*.236) 13778 0 R (section*.237) 14077 0 R (section*.238) 14079 0 R]
+/Limits [(section*.233) (section*.238)]
+>> endobj
+18902 0 obj <<
+/Names [(section*.239) 14080 0 R (section*.24) 2006 0 R (section*.240) 14082 0 R (section*.241) 14389 0 R (section*.242) 14442 0 R (section*.243) 14448 0 R]
+/Limits [(section*.239) (section*.243)]
+>> endobj
+18903 0 obj <<
+/Names [(section*.244) 14479 0 R (section*.245) 14485 0 R (section*.246) 14523 0 R (section*.247) 14555 0 R (section*.248) 14557 0 R (section*.249) 14949 0 R]
+/Limits [(section*.244) (section*.249)]
+>> endobj
+18904 0 obj <<
+/Names [(section*.25) 2123 0 R (section*.250) 14955 0 R (section*.251) 15022 0 R (section*.252) 15023 0 R (section*.253) 15457 0 R (section*.254) 15498 0 R]
+/Limits [(section*.25) (section*.254)]
+>> endobj
+18905 0 obj <<
+/Names [(section*.255) 15569 0 R (section*.256) 15597 0 R (section*.257) 15600 0 R (section*.258) 15603 0 R (section*.259) 15605 0 R (section*.26) 2125 0 R]
+/Limits [(section*.255) (section*.26)]
+>> endobj
+18906 0 obj <<
+/Names [(section*.260) 15665 0 R (section*.261) 15666 0 R (section*.262) 15670 0 R (section*.263) 15684 0 R (section*.264) 15688 0 R (section*.265) 15724 0 R]
+/Limits [(section*.260) (section*.265)]
+>> endobj
+18907 0 obj <<
+/Names [(section*.266) 15751 0 R (section*.267) 15755 0 R (section*.268) 15757 0 R (section*.269) 15770 0 R (section*.27) 2126 0 R (section*.270) 15793 0 R]
+/Limits [(section*.266) (section*.270)]
+>> endobj
+18908 0 obj <<
+/Names [(section*.271) 15797 0 R (section*.272) 15817 0 R (section*.273) 15821 0 R (section*.274) 15864 0 R (section*.275) 15865 0 R (section*.276) 15867 0 R]
+/Limits [(section*.271) (section*.276)]
+>> endobj
+18909 0 obj <<
+/Names [(section*.277) 15873 0 R (section*.278) 15877 0 R (section*.279) 15939 0 R (section*.28) 2243 0 R (section*.280) 15967 0 R (section*.281) 15971 0 R]
+/Limits [(section*.277) (section*.281)]
+>> endobj
+18910 0 obj <<
+/Names [(section*.282) 15973 0 R (section*.283) 15997 0 R (section*.284) 16030 0 R (section*.285) 16032 0 R (section*.286) 16048 0 R (section*.287) 16051 0 R]
+/Limits [(section*.282) (section*.287)]
+>> endobj
+18911 0 obj <<
+/Names [(section*.288) 16125 0 R (section*.29) 2332 0 R (section*.3) 1446 0 R (section*.30) 2333 0 R (section*.31) 2334 0 R (section*.32) 2550 0 R]
+/Limits [(section*.288) (section*.32)]
+>> endobj
+18912 0 obj <<
+/Names [(section*.33) 2551 0 R (section*.34) 2717 0 R (section*.35) 2718 0 R (section*.36) 2794 0 R (section*.37) 2931 0 R (section*.38) 2961 0 R]
+/Limits [(section*.33) (section*.38)]
+>> endobj
+18913 0 obj <<
+/Names [(section*.39) 2984 0 R (section*.4) 1453 0 R (section*.40) 3012 0 R (section*.41) 3051 0 R (section*.42) 3052 0 R (section*.43) 3084 0 R]
+/Limits [(section*.39) (section*.43)]
+>> endobj
+18914 0 obj <<
+/Names [(section*.44) 3087 0 R (section*.45) 3488 0 R (section*.46) 3519 0 R (section*.47) 3521 0 R (section*.48) 3915 0 R (section*.49) 3916 0 R]
+/Limits [(section*.44) (section*.49)]
+>> endobj
+18915 0 obj <<
+/Names [(section*.5) 1454 0 R (section*.50) 3965 0 R (section*.51) 3970 0 R (section*.52) 3971 0 R (section*.53) 3973 0 R (section*.54) 4362 0 R]
+/Limits [(section*.5) (section*.54)]
+>> endobj
+18916 0 obj <<
+/Names [(section*.55) 4388 0 R (section*.56) 4390 0 R (section*.57) 4779 0 R (section*.58) 4829 0 R (section*.59) 4926 0 R (section*.6) 1460 0 R]
+/Limits [(section*.55) (section*.6)]
+>> endobj
+18917 0 obj <<
+/Names [(section*.60) 4930 0 R (section*.61) 4934 0 R (section*.62) 4936 0 R (section*.63) 4983 0 R (section*.64) 4984 0 R (section*.65) 5179 0 R]
+/Limits [(section*.60) (section*.65)]
+>> endobj
+18918 0 obj <<
+/Names [(section*.66) 5182 0 R (section*.67) 5199 0 R (section*.68) 5202 0 R (section*.69) 5205 0 R (section*.7) 1461 0 R (section*.70) 5249 0 R]
+/Limits [(section*.66) (section*.70)]
+>> endobj
+18919 0 obj <<
+/Names [(section*.71) 5332 0 R (section*.72) 5339 0 R (section*.73) 5364 0 R (section*.74) 5368 0 R (section*.75) 5415 0 R (section*.76) 5417 0 R]
+/Limits [(section*.71) (section*.76)]
+>> endobj
+18920 0 obj <<
+/Names [(section*.77) 5555 0 R (section*.78) 5567 0 R (section*.79) 5568 0 R (section*.8) 1462 0 R (section*.80) 5723 0 R (section*.81) 5724 0 R]
+/Limits [(section*.77) (section*.81)]
+>> endobj
+18921 0 obj <<
+/Names [(section*.82) 5848 0 R (section*.83) 5853 0 R (section*.84) 5873 0 R (section*.85) 5919 0 R (section*.86) 5923 0 R (section*.87) 5959 0 R]
+/Limits [(section*.82) (section*.87)]
+>> endobj
+18922 0 obj <<
+/Names [(section*.88) 6001 0 R (section*.89) 6044 0 R (section*.9) 1468 0 R (section*.90) 6133 0 R (section*.91) 6136 0 R (section*.92) 6168 0 R]
+/Limits [(section*.88) (section*.92)]
+>> endobj
+18923 0 obj <<
+/Names [(section*.93) 6194 0 R (section*.94) 6249 0 R (section*.95) 6278 0 R (section*.96) 6334 0 R (section*.97) 6340 0 R (section*.98) 6363 0 R]
+/Limits [(section*.93) (section*.98)]
+>> endobj
+18924 0 obj <<
+/Names [(section*.99) 6365 0 R (section.1) 2 0 R (section.10) 134 0 R (section.2) 70 0 R (section.3) 74 0 R (section.4) 78 0 R]
+/Limits [(section*.99) (section.4)]
+>> endobj
+18925 0 obj <<
+/Names [(section.5) 86 0 R (section.6) 94 0 R (section.7) 102 0 R (section.8) 110 0 R (section.9) 118 0 R (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare) 1739 0 R]
+/Limits [(section.5) (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare)]
+>> endobj
+18926 0 obj <<
+/Names [(structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare_a98c515b16e12424b273eaff073b31f3b) 5200 0 R (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare) 1741 0 R (structParma__Polyhedra__Library_1_1Grid__Certificate_1_1Compare_a92edb0b8b1e2097c5d20795e576517cf) 5206 0 R (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare) 1740 0 R (structParma__Polyhedra__Library_1_1H79__Certificate_1_1Compare_abf5e694ab674c48a452893f021986318) 5203 0 R (struct [...]
+/Limits [(structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare_a98c515b16e12424b273eaff073b31f3b) (structParma__Polyhedra__Library_1_1PIP__Solution__Node_1_1No__Constraints)]
+>> endobj
+18927 0 obj <<
+/Names [(structParma__Polyhedra__Library_1_1Recycle__Input) 1971 0 R (structParma__Polyhedra__Library_1_1Variable_1_1Compare) 1738 0 R (structParma__Polyhedra__Library_1_1Variable_1_1Compare_af6c069432956f215967c61be24a40939) 5183 0 R (structSelect__Temp__Boundary__Type) 1972 0 R (subsection.1.1) 6 0 R (subsection.1.10) 42 0 R]
+/Limits [(structParma__Polyhedra__Library_1_1Recycle__Input) (subsection.1.10)]
+>> endobj
+18928 0 obj <<
+/Names [(subsection.1.11) 46 0 R (subsection.1.12) 50 0 R (subsection.1.13) 54 0 R (subsection.1.14) 58 0 R (subsection.1.15) 62 0 R (subsection.1.16) 66 0 R]
+/Limits [(subsection.1.11) (subsection.1.16)]
+>> endobj
+18929 0 obj <<
+/Names [(subsection.1.2) 10 0 R (subsection.1.3) 14 0 R (subsection.1.4) 18 0 R (subsection.1.5) 22 0 R (subsection.1.6) 26 0 R (subsection.1.7) 30 0 R]
+/Limits [(subsection.1.2) (subsection.1.7)]
+>> endobj
+18930 0 obj <<
+/Names [(subsection.1.8) 34 0 R (subsection.1.9) 38 0 R (subsection.10.1) 138 0 R (subsection.10.10) 174 0 R (subsection.10.11) 178 0 R (subsection.10.12) 182 0 R]
+/Limits [(subsection.1.8) (subsection.10.12)]
+>> endobj
+18931 0 obj <<
+/Names [(subsection.10.13) 186 0 R (subsection.10.14) 190 0 R (subsection.10.15) 194 0 R (subsection.10.16) 198 0 R (subsection.10.17) 202 0 R (subsection.10.18) 206 0 R]
+/Limits [(subsection.10.13) (subsection.10.18)]
+>> endobj
+18932 0 obj <<
+/Names [(subsection.10.19) 210 0 R (subsection.10.2) 142 0 R (subsection.10.20) 214 0 R (subsection.10.21) 218 0 R (subsection.10.22) 222 0 R (subsection.10.23) 226 0 R]
+/Limits [(subsection.10.19) (subsection.10.23)]
+>> endobj
+18933 0 obj <<
+/Names [(subsection.10.24) 230 0 R (subsection.10.25) 234 0 R (subsection.10.26) 238 0 R (subsection.10.27) 242 0 R (subsection.10.28) 246 0 R (subsection.10.29) 250 0 R]
+/Limits [(subsection.10.24) (subsection.10.29)]
+>> endobj
+18934 0 obj <<
+/Names [(subsection.10.3) 146 0 R (subsection.10.30) 254 0 R (subsection.10.31) 258 0 R (subsection.10.32) 262 0 R (subsection.10.33) 266 0 R (subsection.10.34) 270 0 R]
+/Limits [(subsection.10.3) (subsection.10.34)]
+>> endobj
+18935 0 obj <<
+/Names [(subsection.10.35) 274 0 R (subsection.10.36) 278 0 R (subsection.10.37) 282 0 R (subsection.10.38) 286 0 R (subsection.10.39) 290 0 R (subsection.10.4) 150 0 R]
+/Limits [(subsection.10.35) (subsection.10.4)]
+>> endobj
+18936 0 obj <<
+/Names [(subsection.10.40) 294 0 R (subsection.10.41) 298 0 R (subsection.10.42) 302 0 R (subsection.10.43) 306 0 R (subsection.10.44) 310 0 R (subsection.10.45) 314 0 R]
+/Limits [(subsection.10.40) (subsection.10.45)]
+>> endobj
+18937 0 obj <<
+/Names [(subsection.10.46) 318 0 R (subsection.10.47) 322 0 R (subsection.10.48) 326 0 R (subsection.10.49) 330 0 R (subsection.10.5) 154 0 R (subsection.10.50) 334 0 R]
+/Limits [(subsection.10.46) (subsection.10.50)]
+>> endobj
+18938 0 obj <<
+/Names [(subsection.10.51) 338 0 R (subsection.10.52) 342 0 R (subsection.10.53) 346 0 R (subsection.10.54) 350 0 R (subsection.10.55) 354 0 R (subsection.10.56) 358 0 R]
+/Limits [(subsection.10.51) (subsection.10.56)]
+>> endobj
+18939 0 obj <<
+/Names [(subsection.10.57) 362 0 R (subsection.10.58) 366 0 R (subsection.10.59) 370 0 R (subsection.10.6) 158 0 R (subsection.10.60) 374 0 R (subsection.10.61) 378 0 R]
+/Limits [(subsection.10.57) (subsection.10.61)]
+>> endobj
+18940 0 obj <<
+/Names [(subsection.10.62) 382 0 R (subsection.10.63) 386 0 R (subsection.10.64) 390 0 R (subsection.10.65) 394 0 R (subsection.10.66) 398 0 R (subsection.10.67) 402 0 R]
+/Limits [(subsection.10.62) (subsection.10.67)]
+>> endobj
+18941 0 obj <<
+/Names [(subsection.10.68) 406 0 R (subsection.10.69) 410 0 R (subsection.10.7) 162 0 R (subsection.10.70) 414 0 R (subsection.10.71) 418 0 R (subsection.10.72) 422 0 R]
+/Limits [(subsection.10.68) (subsection.10.72)]
+>> endobj
+18942 0 obj <<
+/Names [(subsection.10.73) 426 0 R (subsection.10.74) 430 0 R (subsection.10.75) 434 0 R (subsection.10.76) 438 0 R (subsection.10.77) 442 0 R (subsection.10.78) 446 0 R]
+/Limits [(subsection.10.73) (subsection.10.78)]
+>> endobj
+18943 0 obj <<
+/Names [(subsection.10.79) 450 0 R (subsection.10.8) 166 0 R (subsection.10.80) 454 0 R (subsection.10.81) 458 0 R (subsection.10.82) 462 0 R (subsection.10.83) 466 0 R]
+/Limits [(subsection.10.79) (subsection.10.83)]
+>> endobj
+18944 0 obj <<
+/Names [(subsection.10.84) 470 0 R (subsection.10.85) 474 0 R (subsection.10.86) 478 0 R (subsection.10.87) 482 0 R (subsection.10.88) 486 0 R (subsection.10.89) 490 0 R]
+/Limits [(subsection.10.84) (subsection.10.89)]
+>> endobj
+18945 0 obj <<
+/Names [(subsection.10.9) 170 0 R (subsection.10.90) 494 0 R (subsection.10.91) 498 0 R (subsection.10.92) 502 0 R (subsection.10.93) 506 0 R (subsection.10.94) 510 0 R]
+/Limits [(subsection.10.9) (subsection.10.94)]
+>> endobj
+18946 0 obj <<
+/Names [(subsection.10.95) 514 0 R (subsection.10.96) 518 0 R (subsection.10.97) 522 0 R (subsection.4.1) 82 0 R (subsection.5.1) 90 0 R (subsection.6.1) 98 0 R]
+/Limits [(subsection.10.95) (subsection.6.1)]
+>> endobj
+18947 0 obj <<
+/Names [(subsection.7.1) 106 0 R (subsection.8.1) 114 0 R (subsection.9.1) 122 0 R (subsection.9.2) 126 0 R (subsection.9.3) 130 0 R (subsubsection.1.1.1) 770 0 R]
+/Limits [(subsection.7.1) (subsubsection.1.1.1)]
+>> endobj
+18948 0 obj <<
+/Names [(subsubsection.1.1.2) 789 0 R (subsubsection.1.1.3) 811 0 R (subsubsection.1.10.1) 1095 0 R (subsubsection.1.10.2) 1105 0 R (subsubsection.1.10.3) 1107 0 R (subsubsection.1.10.4) 1115 0 R]
+/Limits [(subsubsection.1.1.2) (subsubsection.1.10.4)]
+>> endobj
+18949 0 obj <<
+/Names [(subsubsection.1.10.5) 1117 0 R (subsubsection.1.10.6) 1119 0 R (subsubsection.1.10.7) 1132 0 R (subsubsection.1.10.8) 1134 0 R (subsubsection.1.10.9) 1136 0 R (subsubsection.1.11.1) 1145 0 R]
+/Limits [(subsubsection.1.10.5) (subsubsection.1.11.1)]
+>> endobj
+18950 0 obj <<
+/Names [(subsubsection.1.12.1) 1149 0 R (subsubsection.1.12.2) 1152 0 R (subsubsection.1.12.3) 1167 0 R (subsubsection.1.13.1) 1171 0 R (subsubsection.1.13.2) 1174 0 R (subsubsection.1.13.3) 1177 0 R]
+/Limits [(subsubsection.1.12.1) (subsubsection.1.13.3)]
+>> endobj
+18951 0 obj <<
+/Names [(subsubsection.1.13.4) 1197 0 R (subsubsection.1.13.5) 1201 0 R (subsubsection.1.14.1) 1206 0 R (subsubsection.1.14.2) 1250 0 R (subsubsection.1.15.1) 1253 0 R (subsubsection.1.15.2) 1261 0 R]
+/Limits [(subsubsection.1.13.4) (subsubsection.1.15.2)]
+>> endobj
+18952 0 obj <<
+/Names [(subsubsection.1.15.3) 1263 0 R (subsubsection.1.15.4) 1265 0 R (subsubsection.1.3.1) 831 0 R (subsubsection.1.3.2) 833 0 R (subsubsection.1.4.1) 850 0 R (subsubsection.1.4.2) 866 0 R]
+/Limits [(subsubsection.1.15.3) (subsubsection.1.4.2)]
+>> endobj
+18953 0 obj <<
+/Names [(subsubsection.1.4.3) 868 0 R (subsubsection.1.4.4) 876 0 R (subsubsection.1.5.1) 879 0 R (subsubsection.1.5.10) 913 0 R (subsubsection.1.5.2) 882 0 R (subsubsection.1.5.3) 889 0 R]
+/Limits [(subsubsection.1.4.3) (subsubsection.1.5.3)]
+>> endobj
+18954 0 obj <<
+/Names [(subsubsection.1.5.4) 891 0 R (subsubsection.1.5.5) 893 0 R (subsubsection.1.5.6) 895 0 R (subsubsection.1.5.7) 901 0 R (subsubsection.1.5.8) 903 0 R (subsubsection.1.5.9) 911 0 R]
+/Limits [(subsubsection.1.5.4) (subsubsection.1.5.9)]
+>> endobj
+18955 0 obj <<
+/Names [(subsubsection.1.6.1) 916 0 R (subsubsection.1.6.10) 957 0 R (subsubsection.1.6.11) 964 0 R (subsubsection.1.6.12) 966 0 R (subsubsection.1.6.13) 976 0 R (subsubsection.1.6.14) 978 0 R]
+/Limits [(subsubsection.1.6.1) (subsubsection.1.6.14)]
+>> endobj
+18956 0 obj <<
+/Names [(subsubsection.1.6.15) 980 0 R (subsubsection.1.6.16) 982 0 R (subsubsection.1.6.17) 997 0 R (subsubsection.1.6.18) 999 0 R (subsubsection.1.6.19) 1016 0 R (subsubsection.1.6.2) 923 0 R]
+/Limits [(subsubsection.1.6.15) (subsubsection.1.6.2)]
+>> endobj
+18957 0 obj <<
+/Names [(subsubsection.1.6.20) 1019 0 R (subsubsection.1.6.3) 925 0 R (subsubsection.1.6.4) 927 0 R (subsubsection.1.6.5) 929 0 R (subsubsection.1.6.6) 938 0 R (subsubsection.1.6.7) 943 0 R]
+/Limits [(subsubsection.1.6.20) (subsubsection.1.6.7)]
+>> endobj
+18958 0 obj <<
+/Names [(subsubsection.1.6.8) 946 0 R (subsubsection.1.6.9) 955 0 R (subsubsection.1.7.1) 1033 0 R (subsubsection.1.8.1) 1036 0 R (subsubsection.1.8.2) 1038 0 R (subsubsection.1.8.3) 1051 0 R]
+/Limits [(subsubsection.1.6.8) (subsubsection.1.8.3)]
+>> endobj
+18959 0 obj <<
+/Names [(subsubsection.1.8.4) 1053 0 R (subsubsection.1.9.1) 1058 0 R (subsubsection.1.9.2) 1070 0 R (subsubsection.1.9.3) 1072 0 R (subsubsection.1.9.4) 1074 0 R (subsubsection.1.9.5) 1076 0 R]
+/Limits [(subsubsection.1.8.4) (subsubsection.1.9.5)]
+>> endobj
+18960 0 obj <<
+/Names [(subsubsection.1.9.6) 1086 0 R (subsubsection.1.9.7) 1088 0 R (subsubsection.1.9.8) 1090 0 R (subsubsection.1.9.9) 1092 0 R (subsubsection.10.1.1) 2981 0 R (subsubsection.10.10.1) 4935 0 R]
+/Limits [(subsubsection.1.9.6) (subsubsection.10.10.1)]
+>> endobj
+18961 0 obj <<
+/Names [(subsubsection.10.10.2) 4952 0 R (subsubsection.10.11.1) 4981 0 R (subsubsection.10.12.1) 4982 0 R (subsubsection.10.13.1) 5178 0 R (subsubsection.10.13.2) 5180 0 R (subsubsection.10.14.1) 5184 0 R]
+/Limits [(subsubsection.10.10.2) (subsubsection.10.14.1)]
+>> endobj
+18962 0 obj <<
+/Names [(subsubsection.10.15.1) 5201 0 R (subsubsection.10.16.1) 5204 0 R (subsubsection.10.17.1) 5248 0 R (subsubsection.10.18.1) 5250 0 R (subsubsection.10.18.2) 5265 0 R (subsubsection.10.19.1) 5338 0 R]
+/Limits [(subsubsection.10.15.1) (subsubsection.10.19.1)]
+>> endobj
+18963 0 obj <<
+/Names [(subsubsection.10.2.1) 2983 0 R (subsubsection.10.20.1) 5372 0 R (subsubsection.10.20.2) 5373 0 R (subsubsection.10.21.1) 5619 0 R (subsubsection.10.21.2) 5642 0 R (subsubsection.10.21.3) 5660 0 R]
+/Limits [(subsubsection.10.2.1) (subsubsection.10.21.3)]
+>> endobj
+18964 0 obj <<
+/Names [(subsubsection.10.21.4) 5685 0 R (subsubsection.10.21.5) 5721 0 R (subsubsection.10.22.1) 5874 0 R (subsubsection.10.22.2) 5884 0 R (subsubsection.10.22.3) 5888 0 R (subsubsection.10.22.4) 5905 0 R]
+/Limits [(subsubsection.10.21.4) (subsubsection.10.22.4)]
+>> endobj
+18965 0 obj <<
+/Names [(subsubsection.10.23.1) 5922 0 R (subsubsection.10.23.2) 5924 0 R (subsubsection.10.24.1) 5971 0 R (subsubsection.10.24.2) 5996 0 R (subsubsection.10.25.1) 6042 0 R (subsubsection.10.26.1) 6073 0 R]
+/Limits [(subsubsection.10.23.1) (subsubsection.10.26.1)]
+>> endobj
+18966 0 obj <<
+/Names [(subsubsection.10.26.2) 6074 0 R (subsubsection.10.26.3) 6100 0 R (subsubsection.10.27.1) 6135 0 R (subsubsection.10.27.2) 6137 0 R (subsubsection.10.28.1) 6195 0 R (subsubsection.10.28.2) 6196 0 R]
+/Limits [(subsubsection.10.26.2) (subsubsection.10.28.2)]
+>> endobj
+18967 0 obj <<
+/Names [(subsubsection.10.28.3) 6200 0 R (subsubsection.10.28.4) 6246 0 R (subsubsection.10.29.1) 6276 0 R (subsubsection.10.3.1) 3053 0 R (subsubsection.10.3.2) 3054 0 R (subsubsection.10.3.3) 3059 0 R]
+/Limits [(subsubsection.10.28.3) (subsubsection.10.3.3)]
+>> endobj
+18968 0 obj <<
+/Names [(subsubsection.10.3.4) 3080 0 R (subsubsection.10.30.1) 6280 0 R (subsubsection.10.30.2) 6281 0 R (subsubsection.10.31.1) 6364 0 R (subsubsection.10.31.2) 6366 0 R (subsubsection.10.32.1) 6746 0 R]
+/Limits [(subsubsection.10.3.4) (subsubsection.10.32.1)]
+>> endobj
+18969 0 obj <<
+/Names [(subsubsection.10.32.2) 6757 0 R (subsubsection.10.32.3) 6759 0 R (subsubsection.10.32.4) 6771 0 R (subsubsection.10.32.5) 6788 0 R (subsubsection.10.32.6) 6852 0 R (subsubsection.10.33.1) 6963 0 R]
+/Limits [(subsubsection.10.32.2) (subsubsection.10.33.1)]
+>> endobj
+18970 0 obj <<
+/Names [(subsubsection.10.33.2) 6973 0 R (subsubsection.10.33.3) 6975 0 R (subsubsection.10.34.1) 7015 0 R (subsubsection.10.35.1) 7030 0 R (subsubsection.10.35.2) 7032 0 R (subsubsection.10.36.1) 7115 0 R]
+/Limits [(subsubsection.10.33.2) (subsubsection.10.36.1)]
+>> endobj
+18971 0 obj <<
+/Names [(subsubsection.10.36.2) 7117 0 R (subsubsection.10.36.3) 7120 0 R (subsubsection.10.37.1) 7187 0 R (subsubsection.10.37.2) 7200 0 R (subsubsection.10.38.1) 7266 0 R (subsubsection.10.38.2) 7281 0 R]
+/Limits [(subsubsection.10.36.2) (subsubsection.10.38.2)]
+>> endobj
+18972 0 obj <<
+/Names [(subsubsection.10.39.1) 7284 0 R (subsubsection.10.4.1) 3520 0 R (subsubsection.10.4.2) 3530 0 R (subsubsection.10.4.3) 3568 0 R (subsubsection.10.4.4) 3912 0 R (subsubsection.10.40.1) 7309 0 R]
+/Limits [(subsubsection.10.39.1) (subsubsection.10.40.1)]
+>> endobj
+18973 0 obj <<
+/Names [(subsubsection.10.41.1) 7397 0 R (subsubsection.10.42.1) 7423 0 R (subsubsection.10.43.1) 7425 0 R (subsubsection.10.44.1) 7426 0 R (subsubsection.10.45.1) 7477 0 R (subsubsection.10.45.2) 7486 0 R]
+/Limits [(subsubsection.10.41.1) (subsubsection.10.45.2)]
+>> endobj
+18974 0 obj <<
+/Names [(subsubsection.10.45.3) 7489 0 R (subsubsection.10.45.4) 7535 0 R (subsubsection.10.46.1) 7547 0 R (subsubsection.10.46.2) 7549 0 R (subsubsection.10.47.1) 7997 0 R (subsubsection.10.47.2) 8049 0 R]
+/Limits [(subsubsection.10.45.3) (subsubsection.10.47.2)]
+>> endobj
+18975 0 obj <<
+/Names [(subsubsection.10.47.3) 8061 0 R (subsubsection.10.47.4) 8064 0 R (subsubsection.10.47.5) 8101 0 R (subsubsection.10.47.6) 8165 0 R (subsubsection.10.48.1) 8271 0 R (subsubsection.10.48.2) 8292 0 R]
+/Limits [(subsubsection.10.47.3) (subsubsection.10.48.2)]
+>> endobj
+18976 0 obj <<
+/Names [(subsubsection.10.48.3) 8294 0 R (subsubsection.10.48.4) 8296 0 R (subsubsection.10.49.1) 8336 0 R (subsubsection.10.5.1) 3931 0 R (subsubsection.10.5.2) 3932 0 R (subsubsection.10.50.1) 8425 0 R]
+/Limits [(subsubsection.10.48.3) (subsubsection.10.50.1)]
+>> endobj
+18977 0 obj <<
+/Names [(subsubsection.10.50.2) 8426 0 R (subsubsection.10.51.1) 8900 0 R (subsubsection.10.51.2) 8936 0 R (subsubsection.10.51.3) 8992 0 R (subsubsection.10.51.4) 9303 0 R (subsubsection.10.52.1) 9337 0 R]
+/Limits [(subsubsection.10.50.2) (subsubsection.10.52.1)]
+>> endobj
+18978 0 obj <<
+/Names [(subsubsection.10.52.2) 9338 0 R (subsubsection.10.53.1) 9645 0 R (subsubsection.10.53.2) 9700 0 R (subsubsection.10.53.3) 9712 0 R (subsubsection.10.53.4) 9715 0 R (subsubsection.10.53.5) 9749 0 R]
+/Limits [(subsubsection.10.52.2) (subsubsection.10.53.5)]
+>> endobj
+18979 0 obj <<
+/Names [(subsubsection.10.53.6) 9792 0 R (subsubsection.10.54.1) 9909 0 R (subsubsection.10.54.2) 9930 0 R (subsubsection.10.54.3) 9932 0 R (subsubsection.10.54.4) 9935 0 R (subsubsection.10.55.1) 9970 0 R]
+/Limits [(subsubsection.10.53.6) (subsubsection.10.55.1)]
+>> endobj
+18980 0 obj <<
+/Names [(subsubsection.10.55.2) 9971 0 R (subsubsection.10.56.1) 9987 0 R (subsubsection.10.57.1) 10010 0 R (subsubsection.10.58.1) 10034 0 R (subsubsection.10.59.1) 10057 0 R (subsubsection.10.6.1) 3934 0 R]
+/Limits [(subsubsection.10.55.2) (subsubsection.10.6.1)]
+>> endobj
+18981 0 obj <<
+/Names [(subsubsection.10.60.1) 10058 0 R (subsubsection.10.61.1) 10098 0 R (subsubsection.10.61.2) 10100 0 R (subsubsection.10.62.1) 10151 0 R (subsubsection.10.62.2) 10152 0 R (subsubsection.10.62.3) 10180 0 R]
+/Limits [(subsubsection.10.60.1) (subsubsection.10.62.3)]
+>> endobj
+18982 0 obj <<
+/Names [(subsubsection.10.63.1) 10642 0 R (subsubsection.10.63.2) 10655 0 R (subsubsection.10.63.3) 10662 0 R (subsubsection.10.63.4) 10688 0 R (subsubsection.10.64.1) 10856 0 R (subsubsection.10.64.2) 10866 0 R]
+/Limits [(subsubsection.10.63.1) (subsubsection.10.64.2)]
+>> endobj
+18983 0 obj <<
+/Names [(subsubsection.10.64.3) 10870 0 R (subsubsection.10.64.4) 10891 0 R (subsubsection.10.65.1) 11059 0 R (subsubsection.10.65.2) 11060 0 R (subsubsection.10.65.3) 11072 0 R (subsubsection.10.65.4) 11092 0 R]
+/Limits [(subsubsection.10.64.3) (subsubsection.10.65.4)]
+>> endobj
+18984 0 obj <<
+/Names [(subsubsection.10.65.5) 11134 0 R (subsubsection.10.66.1) 11201 0 R (subsubsection.10.66.2) 11214 0 R (subsubsection.10.67.1) 11317 0 R (subsubsection.10.67.2) 11318 0 R (subsubsection.10.67.3) 11365 0 R]
+/Limits [(subsubsection.10.65.5) (subsubsection.10.67.3)]
+>> endobj
+18985 0 obj <<
+/Names [(subsubsection.10.68.1) 11377 0 R (subsubsection.10.69.1) 11381 0 R (subsubsection.10.69.2) 11383 0 R (subsubsection.10.7.1) 3969 0 R (subsubsection.10.70.1) 11833 0 R (subsubsection.10.70.2) 11840 0 R]
+/Limits [(subsubsection.10.68.1) (subsubsection.10.70.2)]
+>> endobj
+18986 0 obj <<
+/Names [(subsubsection.10.70.3) 11879 0 R (subsubsection.10.70.4) 12197 0 R (subsubsection.10.71.1) 12258 0 R (subsubsection.10.71.2) 12260 0 R (subsubsection.10.72.1) 12690 0 R (subsubsection.10.72.2) 12699 0 R]
+/Limits [(subsubsection.10.70.3) (subsubsection.10.72.2)]
+>> endobj
+18987 0 obj <<
+/Names [(subsubsection.10.72.3) 12754 0 R (subsubsection.10.72.4) 12993 0 R (subsubsection.10.73.1) 13025 0 R (subsubsection.10.74.1) 13076 0 R (subsubsection.10.75.1) 13170 0 R (subsubsection.10.76.1) 13295 0 R]
+/Limits [(subsubsection.10.72.3) (subsubsection.10.76.1)]
+>> endobj
+18988 0 obj <<
+/Names [(subsubsection.10.76.2) 13364 0 R (subsubsection.10.76.3) 13367 0 R (subsubsection.10.76.4) 13382 0 R (subsubsection.10.76.5) 13414 0 R (subsubsection.10.77.1) 13511 0 R (subsubsection.10.77.2) 13512 0 R]
+/Limits [(subsubsection.10.76.2) (subsubsection.10.77.2)]
+>> endobj
+18989 0 obj <<
+/Names [(subsubsection.10.77.3) 13515 0 R (subsubsection.10.78.1) 13669 0 R (subsubsection.10.78.2) 13670 0 R (subsubsection.10.78.3) 13707 0 R (subsubsection.10.79.1) 14081 0 R (subsubsection.10.79.2) 14103 0 R]
+/Limits [(subsubsection.10.77.3) (subsubsection.10.79.2)]
+>> endobj
+18990 0 obj <<
+/Names [(subsubsection.10.79.3) 14137 0 R (subsubsection.10.79.4) 14386 0 R (subsubsection.10.8.1) 4389 0 R (subsubsection.10.8.2) 4391 0 R (subsubsection.10.8.3) 4433 0 R (subsubsection.10.8.4) 4731 0 R]
+/Limits [(subsubsection.10.79.3) (subsubsection.10.8.4)]
+>> endobj
+18991 0 obj <<
+/Names [(subsubsection.10.80.1) 14450 0 R (subsubsection.10.80.2) 14451 0 R (subsubsection.10.81.1) 14525 0 R (subsubsection.10.81.2) 14526 0 R (subsubsection.10.82.1) 15047 0 R (subsubsection.10.82.2) 15067 0 R]
+/Limits [(subsubsection.10.80.1) (subsubsection.10.82.2)]
+>> endobj
+18992 0 obj <<
+/Names [(subsubsection.10.82.3) 15095 0 R (subsubsection.10.82.4) 15450 0 R (subsubsection.10.83.1) 15604 0 R (subsubsection.10.83.2) 15633 0 R (subsubsection.10.83.3) 15637 0 R (subsubsection.10.83.4) 15651 0 R]
+/Limits [(subsubsection.10.82.3) (subsubsection.10.83.4)]
+>> endobj
+18993 0 obj <<
+/Names [(subsubsection.10.84.1) 15654 0 R (subsubsection.10.85.1) 15664 0 R (subsubsection.10.86.1) 15669 0 R (subsubsection.10.86.2) 15671 0 R (subsubsection.10.87.1) 15687 0 R (subsubsection.10.87.2) 15689 0 R]
+/Limits [(subsubsection.10.84.1) (subsubsection.10.87.2)]
+>> endobj
+18994 0 obj <<
+/Names [(subsubsection.10.88.1) 15756 0 R (subsubsection.10.88.2) 15766 0 R (subsubsection.10.89.1) 15769 0 R (subsubsection.10.9.1) 4830 0 R (subsubsection.10.9.2) 4831 0 R (subsubsection.10.9.3) 4892 0 R]
+/Limits [(subsubsection.10.88.1) (subsubsection.10.9.3)]
+>> endobj
+18995 0 obj <<
+/Names [(subsubsection.10.90.1) 15796 0 R (subsubsection.10.91.1) 15815 0 R (subsubsection.10.92.1) 15816 0 R (subsubsection.10.93.1) 15820 0 R (subsubsection.10.94.1) 15896 0 R (subsubsection.10.94.2) 15897 0 R]
+/Limits [(subsubsection.10.90.1) (subsubsection.10.94.2)]
+>> endobj
+18996 0 obj <<
+/Names [(subsubsection.10.94.3) 15900 0 R (subsubsection.10.94.4) 15902 0 R (subsubsection.10.95.1) 15972 0 R (subsubsection.10.95.2) 15974 0 R (subsubsection.10.96.1) 16033 0 R (subsubsection.10.96.2) 16034 0 R]
+/Limits [(subsubsection.10.94.3) (subsubsection.10.96.2)]
+>> endobj
+18997 0 obj <<
+/Names [(subsubsection.10.96.3) 16046 0 R (subsubsection.10.97.1) 526 0 R (subsubsection.8.1.1) 2372 0 R (subsubsection.8.1.2) 2373 0 R (subsubsection.8.1.3) 2378 0 R (subsubsection.8.1.4) 2396 0 R]
+/Limits [(subsubsection.10.96.3) (subsubsection.8.1.4)]
+>> endobj
+18998 0 obj <<
+/Names [(subsubsection.8.1.5) 2436 0 R (subsubsection.8.1.6) 2548 0 R (subsubsection.9.1.1) 2932 0 R (subsubsection.9.1.2) 2938 0 R (subsubsection.9.1.3) 2942 0 R (subsubsection.9.1.4) 2945 0 R]
+/Limits [(subsubsection.8.1.5) (subsubsection.9.1.4)]
+>> endobj
+18999 0 obj <<
+/Names [(subsubsection.9.2.1) 2962 0 R (subsubsection.9.2.2) 2970 0 R (subsubsection.9.3.1) 2973 0 R (table.1) 2465 0 R (table.10) 2492 0 R (table.100) 3748 0 R]
+/Limits [(subsubsection.9.2.1) (table.100)]
+>> endobj
+19000 0 obj <<
+/Names [(table.101) 3750 0 R (table.102) 3759 0 R (table.103) 3761 0 R (table.104) 3762 0 R (table.105) 3764 0 R (table.106) 3765 0 R]
+/Limits [(table.101) (table.106)]
+>> endobj
+19001 0 obj <<
+/Names [(table.107) 3777 0 R (table.108) 3778 0 R (table.109) 3780 0 R (table.11) 2493 0 R (table.110) 3782 0 R (table.111) 3791 0 R]
+/Limits [(table.107) (table.111)]
+>> endobj
+19002 0 obj <<
+/Names [(table.112) 3793 0 R (table.113) 3795 0 R (table.114) 3797 0 R (table.115) 3798 0 R (table.116) 3811 0 R (table.117) 3812 0 R]
+/Limits [(table.112) (table.117)]
+>> endobj
+19003 0 obj <<
+/Names [(table.118) 3814 0 R (table.119) 3815 0 R (table.12) 2502 0 R (table.120) 3817 0 R (table.121) 3818 0 R (table.122) 3829 0 R]
+/Limits [(table.118) (table.122)]
+>> endobj
+19004 0 obj <<
+/Names [(table.123) 3830 0 R (table.124) 3833 0 R (table.125) 3834 0 R (table.126) 3836 0 R (table.127) 3845 0 R (table.128) 3847 0 R]
+/Limits [(table.123) (table.128)]
+>> endobj
+19005 0 obj <<
+/Names [(table.129) 3848 0 R (table.13) 2503 0 R (table.130) 3850 0 R (table.131) 3852 0 R (table.132) 3866 0 R (table.133) 3868 0 R]
+/Limits [(table.129) (table.133)]
+>> endobj
+19006 0 obj <<
+/Names [(table.134) 3869 0 R (table.135) 3871 0 R (table.136) 3873 0 R (table.137) 3887 0 R (table.138) 3888 0 R (table.139) 3890 0 R]
+/Limits [(table.134) (table.139)]
+>> endobj
+19007 0 obj <<
+/Names [(table.14) 2504 0 R (table.140) 3891 0 R (table.141) 3910 0 R (table.142) 4393 0 R (table.143) 4405 0 R (table.144) 4407 0 R]
+/Limits [(table.14) (table.144)]
+>> endobj
+19008 0 obj <<
+/Names [(table.145) 4409 0 R (table.146) 4411 0 R (table.147) 4417 0 R (table.148) 4419 0 R (table.149) 4421 0 R (table.15) 2512 0 R]
+/Limits [(table.145) (table.15)]
+>> endobj
+19009 0 obj <<
+/Names [(table.150) 4435 0 R (table.151) 4437 0 R (table.152) 4439 0 R (table.153) 4441 0 R (table.154) 4448 0 R (table.155) 4450 0 R]
+/Limits [(table.150) (table.155)]
+>> endobj
+19010 0 obj <<
+/Names [(table.156) 4452 0 R (table.157) 4453 0 R (table.158) 4455 0 R (table.159) 4461 0 R (table.16) 2513 0 R (table.160) 4463 0 R]
+/Limits [(table.156) (table.160)]
+>> endobj
+19011 0 obj <<
+/Names [(table.161) 4464 0 R (table.162) 4466 0 R (table.163) 4467 0 R (table.164) 4477 0 R (table.165) 4478 0 R (table.166) 4480 0 R]
+/Limits [(table.161) (table.166)]
+>> endobj
+19012 0 obj <<
+/Names [(table.167) 4482 0 R (table.168) 4484 0 R (table.169) 4486 0 R (table.17) 2515 0 R (table.170) 4487 0 R (table.171) 4494 0 R]
+/Limits [(table.167) (table.171)]
+>> endobj
+19013 0 obj <<
+/Names [(table.172) 4495 0 R (table.173) 4497 0 R (table.174) 4498 0 R (table.175) 4500 0 R (table.176) 4501 0 R (table.177) 4508 0 R]
+/Limits [(table.172) (table.177)]
+>> endobj
+19014 0 obj <<
+/Names [(table.178) 4509 0 R (table.179) 4511 0 R (table.18) 2529 0 R (table.180) 4512 0 R (table.181) 4514 0 R (table.182) 4515 0 R]
+/Limits [(table.178) (table.182)]
+>> endobj
+19015 0 obj <<
+/Names [(table.183) 4517 0 R (table.184) 4525 0 R (table.185) 4528 0 R (table.186) 4529 0 R (table.187) 4531 0 R (table.188) 4532 0 R]
+/Limits [(table.183) (table.188)]
+>> endobj
+19016 0 obj <<
+/Names [(table.189) 4534 0 R (table.19) 2530 0 R (table.190) 4535 0 R (table.191) 4545 0 R (table.192) 4546 0 R (table.193) 4548 0 R]
+/Limits [(table.189) (table.193)]
+>> endobj
+19017 0 obj <<
+/Names [(table.194) 4549 0 R (table.195) 4551 0 R (table.196) 4552 0 R (table.197) 4561 0 R (table.198) 4563 0 R (table.199) 4565 0 R]
+/Limits [(table.194) (table.199)]
+>> endobj
+19018 0 obj <<
+/Names [(table.2) 2466 0 R (table.20) 2957 0 R (table.200) 4567 0 R (table.201) 4569 0 R (table.202) 4571 0 R (table.203) 4580 0 R]
+/Limits [(table.2) (table.203)]
+>> endobj
+19019 0 obj <<
+/Names [(table.204) 4582 0 R (table.205) 4583 0 R (table.206) 4585 0 R (table.207) 4586 0 R (table.208) 4588 0 R (table.209) 4597 0 R]
+/Limits [(table.204) (table.209)]
+>> endobj
+19020 0 obj <<
+/Names [(table.21) 2972 0 R (table.210) 4599 0 R (table.211) 4600 0 R (table.212) 4602 0 R (table.213) 4603 0 R (table.214) 4613 0 R]
+/Limits [(table.21) (table.214)]
+>> endobj
+19021 0 obj <<
+/Names [(table.215) 4614 0 R (table.216) 4616 0 R (table.217) 4617 0 R (table.218) 4619 0 R (table.219) 4620 0 R (table.22) 3057 0 R]
+/Limits [(table.215) (table.22)]
+>> endobj
+19022 0 obj <<
+/Names [(table.220) 4633 0 R (table.221) 4635 0 R (table.222) 4636 0 R (table.223) 4638 0 R (table.224) 4649 0 R (table.225) 4651 0 R]
+/Limits [(table.220) (table.225)]
+>> endobj
+19023 0 obj <<
+/Names [(table.226) 4652 0 R (table.227) 4654 0 R (table.228) 4655 0 R (table.229) 4665 0 R (table.23) 3058 0 R (table.230) 4666 0 R]
+/Limits [(table.226) (table.230)]
+>> endobj
+19024 0 obj <<
+/Names [(table.231) 4668 0 R (table.232) 4669 0 R (table.233) 4671 0 R (table.234) 4680 0 R (table.235) 4683 0 R (table.236) 4684 0 R]
+/Limits [(table.231) (table.236)]
+>> endobj
+19025 0 obj <<
+/Names [(table.237) 4698 0 R (table.238) 4700 0 R (table.239) 4702 0 R (table.24) 3532 0 R (table.240) 4703 0 R (table.241) 4713 0 R]
+/Limits [(table.237) (table.241)]
+>> endobj
+19026 0 obj <<
+/Names [(table.242) 4714 0 R (table.243) 4717 0 R (table.244) 4719 0 R (table.245) 4833 0 R (table.246) 4842 0 R (table.247) 4844 0 R]
+/Limits [(table.242) (table.247)]
+>> endobj
+19027 0 obj <<
+/Names [(table.248) 4845 0 R (table.249) 4847 0 R (table.25) 3541 0 R (table.250) 4848 0 R (table.251) 4850 0 R (table.252) 4851 0 R]
+/Limits [(table.248) (table.252)]
+>> endobj
+19028 0 obj <<
+/Names [(table.253) 4858 0 R (table.254) 4859 0 R (table.255) 4861 0 R (table.256) 4863 0 R (table.257) 4865 0 R (table.258) 4872 0 R]
+/Limits [(table.253) (table.258)]
+>> endobj
+19029 0 obj <<
+/Names [(table.259) 4873 0 R (table.26) 3542 0 R (table.260) 4875 0 R (table.261) 4877 0 R (table.262) 4890 0 R (table.263) 4894 0 R]
+/Limits [(table.259) (table.263)]
+>> endobj
+19030 0 obj <<
+/Names [(table.264) 4954 0 R (table.265) 5267 0 R (table.266) 5268 0 R (table.267) 5278 0 R (table.268) 5279 0 R (table.269) 5291 0 R]
+/Limits [(table.264) (table.269)]
+>> endobj
+19031 0 obj <<
+/Names [(table.27) 3544 0 R (table.270) 5292 0 R (table.271) 5301 0 R (table.272) 5302 0 R (table.273) 5314 0 R (table.274) 5315 0 R]
+/Limits [(table.27) (table.274)]
+>> endobj
+19032 0 obj <<
+/Names [(table.275) 5317 0 R (table.276) 5331 0 R (table.277) 5655 0 R (table.278) 5659 0 R (table.279) 5662 0 R (table.28) 3545 0 R]
+/Limits [(table.275) (table.28)]
+>> endobj
+19033 0 obj <<
+/Names [(table.280) 5886 0 R (table.281) 5892 0 R (table.282) 5901 0 R (table.283) 5903 0 R (table.284) 5958 0 R (table.285) 5998 0 R]
+/Limits [(table.280) (table.285)]
+>> endobj
+19034 0 obj <<
+/Names [(table.286) 6000 0 R (table.287) 6077 0 R (table.288) 6095 0 R (table.289) 6097 0 R (table.29) 3552 0 R (table.290) 6099 0 R]
+/Limits [(table.286) (table.290)]
+>> endobj
+19035 0 obj <<
+/Names [(table.291) 6102 0 R (table.292) 6104 0 R (table.293) 6111 0 R (table.294) 6118 0 R (table.295) 6132 0 R (table.296) 6167 0 R]
+/Limits [(table.291) (table.296)]
+>> endobj
+19036 0 obj <<
+/Names [(table.297) 6199 0 R (table.298) 6211 0 R (table.299) 6213 0 R (table.3) 2468 0 R (table.30) 3555 0 R (table.300) 6218 0 R]
+/Limits [(table.297) (table.300)]
+>> endobj
+19037 0 obj <<
+/Names [(table.301) 6245 0 R (table.302) 6299 0 R (table.303) 6368 0 R (table.304) 6770 0 R (table.305) 6776 0 R (table.306) 7035 0 R]
+/Limits [(table.301) (table.306)]
+>> endobj
+19038 0 obj <<
+/Names [(table.307) 7202 0 R (table.308) 7283 0 R (table.309) 7491 0 R (table.31) 3556 0 R (table.310) 7512 0 R (table.311) 7514 0 R]
+/Limits [(table.307) (table.311)]
+>> endobj
+19039 0 obj <<
+/Names [(table.312) 7534 0 R (table.313) 8066 0 R (table.314) 8068 0 R (table.315) 8070 0 R (table.316) 8078 0 R (table.317) 8082 0 R]
+/Limits [(table.312) (table.317)]
+>> endobj
+19040 0 obj <<
+/Names [(table.318) 8085 0 R (table.319) 8087 0 R (table.32) 3558 0 R (table.320) 8938 0 R (table.321) 8944 0 R (table.322) 8946 0 R]
+/Limits [(table.318) (table.322)]
+>> endobj
+19041 0 obj <<
+/Names [(table.323) 8947 0 R (table.324) 8949 0 R (table.325) 8950 0 R (table.326) 8952 0 R (table.327) 8959 0 R (table.328) 8961 0 R]
+/Limits [(table.323) (table.328)]
+>> endobj
+19042 0 obj <<
+/Names [(table.329) 8962 0 R (table.33) 3559 0 R (table.330) 8964 0 R (table.331) 8965 0 R (table.332) 8967 0 R (table.333) 8968 0 R]
+/Limits [(table.329) (table.333)]
+>> endobj
+19043 0 obj <<
+/Names [(table.334) 8975 0 R (table.335) 8976 0 R (table.336) 8978 0 R (table.337) 8979 0 R (table.338) 8981 0 R (table.339) 8982 0 R]
+/Limits [(table.334) (table.339)]
+>> endobj
+19044 0 obj <<
+/Names [(table.34) 3566 0 R (table.340) 8989 0 R (table.341) 8990 0 R (table.342) 8995 0 R (table.343) 8998 0 R (table.344) 9007 0 R]
+/Limits [(table.34) (table.344)]
+>> endobj
+19045 0 obj <<
+/Names [(table.345) 9009 0 R (table.346) 9011 0 R (table.347) 9012 0 R (table.348) 9014 0 R (table.349) 9022 0 R (table.35) 3567 0 R]
+/Limits [(table.345) (table.35)]
+>> endobj
+19046 0 obj <<
+/Names [(table.350) 9024 0 R (table.351) 9025 0 R (table.352) 9027 0 R (table.353) 9034 0 R (table.354) 9036 0 R (table.355) 9037 0 R]
+/Limits [(table.350) (table.355)]
+>> endobj
+19047 0 obj <<
+/Names [(table.356) 9039 0 R (table.357) 9041 0 R (table.358) 9049 0 R (table.359) 9051 0 R (table.36) 3570 0 R (table.360) 9053 0 R]
+/Limits [(table.356) (table.360)]
+>> endobj
+19048 0 obj <<
+/Names [(table.361) 9055 0 R (table.362) 9056 0 R (table.363) 9058 0 R (table.364) 9059 0 R (table.365) 9066 0 R (table.366) 9067 0 R]
+/Limits [(table.361) (table.366)]
+>> endobj
+19049 0 obj <<
+/Names [(table.367) 9069 0 R (table.368) 9070 0 R (table.369) 9072 0 R (table.37) 3572 0 R (table.370) 9073 0 R (table.371) 9080 0 R]
+/Limits [(table.367) (table.371)]
+>> endobj
+19050 0 obj <<
+/Names [(table.372) 9081 0 R (table.373) 9083 0 R (table.374) 9084 0 R (table.375) 9086 0 R (table.376) 9087 0 R (table.377) 9089 0 R]
+/Limits [(table.372) (table.377)]
+>> endobj
+19051 0 obj <<
+/Names [(table.378) 9097 0 R (table.379) 9099 0 R (table.38) 3574 0 R (table.380) 9100 0 R (table.381) 9102 0 R (table.382) 9103 0 R]
+/Limits [(table.378) (table.382)]
+>> endobj
+19052 0 obj <<
+/Names [(table.383) 9105 0 R (table.384) 9106 0 R (table.385) 9116 0 R (table.386) 9117 0 R (table.387) 9119 0 R (table.388) 9121 0 R]
+/Limits [(table.383) (table.388)]
+>> endobj
+19053 0 obj <<
+/Names [(table.389) 9123 0 R (table.39) 3575 0 R (table.390) 9125 0 R (table.391) 9135 0 R (table.392) 9137 0 R (table.393) 9138 0 R]
+/Limits [(table.389) (table.393)]
+>> endobj
+19054 0 obj <<
+/Names [(table.394) 9140 0 R (table.395) 9141 0 R (table.396) 9151 0 R (table.397) 9152 0 R (table.398) 9154 0 R (table.399) 9155 0 R]
+/Limits [(table.394) (table.399)]
+>> endobj
+19055 0 obj <<
+/Names [(table.4) 2469 0 R (table.40) 3583 0 R (table.400) 9157 0 R (table.401) 9166 0 R (table.402) 9168 0 R (table.403) 9169 0 R]
+/Limits [(table.4) (table.403)]
+>> endobj
+19056 0 obj <<
+/Names [(table.404) 9171 0 R (table.405) 9172 0 R (table.406) 9186 0 R (table.407) 9187 0 R (table.408) 9189 0 R (table.409) 9191 0 R]
+/Limits [(table.404) (table.409)]
+>> endobj
+19057 0 obj <<
+/Names [(table.41) 3584 0 R (table.410) 9192 0 R (table.411) 9203 0 R (table.412) 9205 0 R (table.413) 9207 0 R (table.414) 9208 0 R]
+/Limits [(table.41) (table.414)]
+>> endobj
+19058 0 obj <<
+/Names [(table.415) 9210 0 R (table.416) 9222 0 R (table.417) 9224 0 R (table.418) 9225 0 R (table.419) 9227 0 R (table.42) 3586 0 R]
+/Limits [(table.415) (table.42)]
+>> endobj
+19059 0 obj <<
+/Names [(table.420) 9228 0 R (table.421) 9230 0 R (table.422) 9241 0 R (table.423) 9243 0 R (table.424) 9244 0 R (table.425) 9246 0 R]
+/Limits [(table.420) (table.425)]
+>> endobj
+19060 0 obj <<
+/Names [(table.426) 9247 0 R (table.427) 9249 0 R (table.428) 9263 0 R (table.429) 9265 0 R (table.43) 3587 0 R (table.430) 9267 0 R]
+/Limits [(table.426) (table.430)]
+>> endobj
+19061 0 obj <<
+/Names [(table.431) 9268 0 R (table.432) 9271 0 R (table.433) 9285 0 R (table.434) 9287 0 R (table.435) 9288 0 R (table.436) 9290 0 R]
+/Limits [(table.431) (table.436)]
+>> endobj
+19062 0 obj <<
+/Names [(table.437) 9300 0 R (table.438) 9717 0 R (table.439) 9719 0 R (table.44) 3589 0 R (table.440) 9721 0 R (table.441) 9733 0 R]
+/Limits [(table.437) (table.441)]
+>> endobj
+19063 0 obj <<
+/Names [(table.442) 9735 0 R (table.443) 9748 0 R (table.444) 10173 0 R (table.445) 10175 0 R (table.446) 10177 0 R (table.447) 10179 0 R]
+/Limits [(table.442) (table.447)]
+>> endobj
+19064 0 obj <<
+/Names [(table.448) 10187 0 R (table.449) 10189 0 R (table.45) 3597 0 R (table.450) 10191 0 R (table.451) 10206 0 R (table.452) 10208 0 R]
+/Limits [(table.448) (table.452)]
+>> endobj
+19065 0 obj <<
+/Names [(table.453) 10660 0 R (table.454) 10673 0 R (table.455) 10684 0 R (table.456) 10713 0 R (table.457) 10724 0 R (table.458) 10868 0 R]
+/Limits [(table.453) (table.458)]
+>> endobj
+19066 0 obj <<
+/Names [(table.459) 10873 0 R (table.46) 3599 0 R (table.460) 10875 0 R (table.461) 11074 0 R (table.462) 11075 0 R (table.463) 11077 0 R]
+/Limits [(table.459) (table.463)]
+>> endobj
+19067 0 obj <<
+/Names [(table.464) 11085 0 R (table.465) 11087 0 R (table.466) 11088 0 R (table.467) 11090 0 R (table.468) 11091 0 R (table.469) 11101 0 R]
+/Limits [(table.464) (table.469)]
+>> endobj
+19068 0 obj <<
+/Names [(table.47) 3600 0 R (table.470) 11102 0 R (table.471) 11104 0 R (table.472) 11106 0 R (table.473) 11108 0 R (table.474) 11115 0 R]
+/Limits [(table.47) (table.474)]
+>> endobj
+19069 0 obj <<
+/Names [(table.475) 11119 0 R (table.476) 11120 0 R (table.477) 11122 0 R (table.478) 11131 0 R (table.479) 11133 0 R (table.48) 3602 0 R]
+/Limits [(table.475) (table.48)]
+>> endobj
+19070 0 obj <<
+/Names [(table.480) 11216 0 R (table.481) 11320 0 R (table.482) 11328 0 R (table.483) 11330 0 R (table.484) 11332 0 R (table.485) 11334 0 R]
+/Limits [(table.480) (table.485)]
+>> endobj
+19071 0 obj <<
+/Names [(table.486) 11335 0 R (table.487) 11337 0 R (table.488) 11344 0 R (table.489) 11346 0 R (table.49) 3604 0 R (table.490) 11348 0 R]
+/Limits [(table.486) (table.490)]
+>> endobj
+19072 0 obj <<
+/Names [(table.491) 11350 0 R (table.492) 11352 0 R (table.493) 11358 0 R (table.494) 11360 0 R (table.495) 11362 0 R (table.496) 11364 0 R]
+/Limits [(table.491) (table.496)]
+>> endobj
+19073 0 obj <<
+/Names [(table.497) 11376 0 R (table.498) 11842 0 R (table.499) 11851 0 R (table.5) 2479 0 R (table.50) 3611 0 R (table.500) 11852 0 R]
+/Limits [(table.497) (table.500)]
+>> endobj
+19074 0 obj <<
+/Names [(table.501) 11854 0 R (table.502) 11855 0 R (table.503) 11857 0 R (table.504) 11866 0 R (table.505) 11867 0 R (table.506) 11869 0 R]
+/Limits [(table.501) (table.506)]
+>> endobj
+19075 0 obj <<
+/Names [(table.507) 11870 0 R (table.508) 11872 0 R (table.509) 11873 0 R (table.51) 3613 0 R (table.510) 11881 0 R (table.511) 11883 0 R]
+/Limits [(table.507) (table.511)]
+>> endobj
+19076 0 obj <<
+/Names [(table.512) 11885 0 R (table.513) 11887 0 R (table.514) 11889 0 R (table.515) 11896 0 R (table.516) 11898 0 R (table.517) 11900 0 R]
+/Limits [(table.512) (table.517)]
+>> endobj
+19077 0 obj <<
+/Names [(table.518) 11902 0 R (table.519) 11904 0 R (table.52) 3615 0 R (table.520) 11905 0 R (table.521) 11912 0 R (table.522) 11913 0 R]
+/Limits [(table.518) (table.522)]
+>> endobj
+19078 0 obj <<
+/Names [(table.523) 11915 0 R (table.524) 11916 0 R (table.525) 11918 0 R (table.526) 11926 0 R (table.527) 11928 0 R (table.528) 11929 0 R]
+/Limits [(table.523) (table.528)]
+>> endobj
+19079 0 obj <<
+/Names [(table.529) 11931 0 R (table.53) 3617 0 R (table.530) 11932 0 R (table.531) 11939 0 R (table.532) 11940 0 R (table.533) 11942 0 R]
+/Limits [(table.529) (table.533)]
+>> endobj
+19080 0 obj <<
+/Names [(table.534) 11943 0 R (table.535) 11945 0 R (table.536) 11946 0 R (table.537) 11948 0 R (table.538) 11955 0 R (table.539) 11957 0 R]
+/Limits [(table.534) (table.539)]
+>> endobj
+19081 0 obj <<
+/Names [(table.54) 3619 0 R (table.540) 11958 0 R (table.541) 11960 0 R (table.542) 11961 0 R (table.543) 11963 0 R (table.544) 11964 0 R]
+/Limits [(table.54) (table.544)]
+>> endobj
+19082 0 obj <<
+/Names [(table.545) 11971 0 R (table.546) 11972 0 R (table.547) 11974 0 R (table.548) 11975 0 R (table.549) 11977 0 R (table.55) 3621 0 R]
+/Limits [(table.545) (table.55)]
+>> endobj
+19083 0 obj <<
+/Names [(table.550) 11978 0 R (table.551) 11988 0 R (table.552) 11989 0 R (table.553) 11991 0 R (table.554) 11992 0 R (table.555) 11994 0 R]
+/Limits [(table.550) (table.555)]
+>> endobj
+19084 0 obj <<
+/Names [(table.556) 11995 0 R (table.557) 12004 0 R (table.558) 12006 0 R (table.559) 12008 0 R (table.56) 3627 0 R (table.560) 12010 0 R]
+/Limits [(table.556) (table.560)]
+>> endobj
+19085 0 obj <<
+/Names [(table.561) 12021 0 R (table.562) 12023 0 R (table.563) 12025 0 R (table.564) 12026 0 R (table.565) 12028 0 R (table.566) 12029 0 R]
+/Limits [(table.561) (table.566)]
+>> endobj
+19086 0 obj <<
+/Names [(table.567) 12038 0 R (table.568) 12039 0 R (table.569) 12041 0 R (table.57) 3629 0 R (table.570) 12042 0 R (table.571) 12044 0 R]
+/Limits [(table.567) (table.571)]
+>> endobj
+19087 0 obj <<
+/Names [(table.572) 12054 0 R (table.573) 12056 0 R (table.574) 12057 0 R (table.575) 12059 0 R (table.576) 12060 0 R (table.577) 12072 0 R]
+/Limits [(table.572) (table.577)]
+>> endobj
+19088 0 obj <<
+/Names [(table.578) 12073 0 R (table.579) 12075 0 R (table.58) 3630 0 R (table.580) 12076 0 R (table.581) 12078 0 R (table.582) 12080 0 R]
+/Limits [(table.578) (table.582)]
+>> endobj
+19089 0 obj <<
+/Names [(table.583) 12087 0 R (table.584) 12089 0 R (table.585) 12091 0 R (table.586) 12104 0 R (table.587) 12105 0 R (table.588) 12107 0 R]
+/Limits [(table.583) (table.588)]
+>> endobj
+19090 0 obj <<
+/Names [(table.589) 12108 0 R (table.59) 3632 0 R (table.590) 12110 0 R (table.591) 12111 0 R (table.592) 12122 0 R (table.593) 12123 0 R]
+/Limits [(table.589) (table.593)]
+>> endobj
+19091 0 obj <<
+/Names [(table.594) 12125 0 R (table.595) 12126 0 R (table.596) 12128 0 R (table.597) 12129 0 R (table.598) 12139 0 R (table.599) 12141 0 R]
+/Limits [(table.594) (table.599)]
+>> endobj
+19092 0 obj <<
+/Names [(table.6) 2480 0 R (table.60) 3633 0 R (table.600) 12143 0 R (table.601) 12145 0 R (table.602) 12158 0 R (table.603) 12160 0 R]
+/Limits [(table.6) (table.603)]
+>> endobj
+19093 0 obj <<
+/Names [(table.604) 12162 0 R (table.605) 12164 0 R (table.606) 12178 0 R (table.607) 12180 0 R (table.608) 12181 0 R (table.609) 12184 0 R]
+/Limits [(table.604) (table.609)]
+>> endobj
+19094 0 obj <<
+/Names [(table.61) 3635 0 R (table.610) 12185 0 R (table.611) 12195 0 R (table.612) 12301 0 R (table.613) 12701 0 R (table.614) 12702 0 R]
+/Limits [(table.61) (table.614)]
+>> endobj
+19095 0 obj <<
+/Names [(table.615) 12704 0 R (table.616) 12710 0 R (table.617) 12712 0 R (table.618) 12713 0 R (table.619) 12715 0 R (table.62) 3636 0 R]
+/Limits [(table.615) (table.62)]
+>> endobj
+19096 0 obj <<
+/Names [(table.620) 12716 0 R (table.621) 12718 0 R (table.622) 12719 0 R (table.623) 12726 0 R (table.624) 12727 0 R (table.625) 12729 0 R]
+/Limits [(table.620) (table.625)]
+>> endobj
+19097 0 obj <<
+/Names [(table.626) 12730 0 R (table.627) 12732 0 R (table.628) 12738 0 R (table.629) 12740 0 R (table.63) 3643 0 R (table.630) 12741 0 R]
+/Limits [(table.626) (table.630)]
+>> endobj
+19098 0 obj <<
+/Names [(table.631) 12743 0 R (table.632) 12744 0 R (table.633) 12746 0 R (table.634) 12752 0 R (table.635) 12756 0 R (table.636) 12758 0 R]
+/Limits [(table.631) (table.636)]
+>> endobj
+19099 0 obj <<
+/Names [(table.637) 12760 0 R (table.638) 12767 0 R (table.639) 12769 0 R (table.64) 3644 0 R (table.640) 12770 0 R (table.641) 12772 0 R]
+/Limits [(table.637) (table.641)]
+>> endobj
+19100 0 obj <<
+/Names [(table.642) 12773 0 R (table.643) 12781 0 R (table.644) 12782 0 R (table.645) 12784 0 R (table.646) 12785 0 R (table.647) 12787 0 R]
+/Limits [(table.642) (table.647)]
+>> endobj
+19101 0 obj <<
+/Names [(table.648) 12794 0 R (table.649) 12796 0 R (table.65) 3646 0 R (table.650) 12798 0 R (table.651) 12799 0 R (table.652) 12801 0 R]
+/Limits [(table.648) (table.652)]
+>> endobj
+19102 0 obj <<
+/Names [(table.653) 12803 0 R (table.654) 12809 0 R (table.655) 12811 0 R (table.656) 12812 0 R (table.657) 12814 0 R (table.658) 12815 0 R]
+/Limits [(table.653) (table.658)]
+>> endobj
+19103 0 obj <<
+/Names [(table.659) 12817 0 R (table.66) 3647 0 R (table.660) 12818 0 R (table.661) 12826 0 R (table.662) 12827 0 R (table.663) 12829 0 R]
+/Limits [(table.659) (table.663)]
+>> endobj
+19104 0 obj <<
+/Names [(table.664) 12830 0 R (table.665) 12832 0 R (table.666) 12833 0 R (table.667) 12835 0 R (table.668) 12836 0 R (table.669) 12845 0 R]
+/Limits [(table.664) (table.669)]
+>> endobj
+19105 0 obj <<
+/Names [(table.67) 3649 0 R (table.670) 12846 0 R (table.671) 12848 0 R (table.672) 12850 0 R (table.673) 12852 0 R (table.674) 12863 0 R]
+/Limits [(table.67) (table.674)]
+>> endobj
+19106 0 obj <<
+/Names [(table.675) 12865 0 R (table.676) 12866 0 R (table.677) 12868 0 R (table.678) 12869 0 R (table.679) 12871 0 R (table.68) 3650 0 R]
+/Limits [(table.675) (table.68)]
+>> endobj
+19107 0 obj <<
+/Names [(table.680) 12887 0 R (table.681) 12890 0 R (table.682) 12891 0 R (table.683) 12894 0 R (table.684) 12895 0 R (table.685) 12905 0 R]
+/Limits [(table.680) (table.685)]
+>> endobj
+19108 0 obj <<
+/Names [(table.686) 12906 0 R (table.687) 12908 0 R (table.688) 12909 0 R (table.689) 12911 0 R (table.69) 3658 0 R (table.690) 12920 0 R]
+/Limits [(table.686) (table.690)]
+>> endobj
+19109 0 obj <<
+/Names [(table.691) 12922 0 R (table.692) 12924 0 R (table.693) 12925 0 R (table.694) 12927 0 R (table.695) 12937 0 R (table.696) 12939 0 R]
+/Limits [(table.691) (table.696)]
+>> endobj
+19110 0 obj <<
+/Names [(table.697) 12940 0 R (table.698) 12942 0 R (table.699) 12943 0 R (table.7) 2482 0 R (table.70) 3659 0 R (table.700) 12955 0 R]
+/Limits [(table.697) (table.700)]
+>> endobj
+19111 0 obj <<
+/Names [(table.701) 12957 0 R (table.702) 12958 0 R (table.703) 12960 0 R (table.704) 12962 0 R (table.705) 12978 0 R (table.706) 12979 0 R]
+/Limits [(table.701) (table.706)]
+>> endobj
+19112 0 obj <<
+/Names [(table.707) 12981 0 R (table.708) 12982 0 R (table.709) 13369 0 R (table.71) 3661 0 R (table.710) 13378 0 R (table.711) 13380 0 R]
+/Limits [(table.707) (table.711)]
+>> endobj
+19113 0 obj <<
+/Names [(table.712) 13381 0 R (table.713) 13385 0 R (table.714) 13386 0 R (table.715) 13393 0 R (table.716) 13395 0 R (table.717) 13397 0 R]
+/Limits [(table.712) (table.717)]
+>> endobj
+19114 0 obj <<
+/Names [(table.718) 13411 0 R (table.719) 13412 0 R (table.72) 3662 0 R (table.720) 13527 0 R (table.721) 13528 0 R (table.722) 13530 0 R]
+/Limits [(table.718) (table.722)]
+>> endobj
+19115 0 obj <<
+/Names [(table.723) 13532 0 R (table.724) 13686 0 R (table.725) 13688 0 R (table.726) 13691 0 R (table.727) 13704 0 R (table.728) 14105 0 R]
+/Limits [(table.723) (table.728)]
+>> endobj
+19116 0 obj <<
+/Names [(table.729) 14108 0 R (table.73) 3664 0 R (table.730) 14110 0 R (table.731) 14116 0 R (table.732) 14118 0 R (table.733) 14119 0 R]
+/Limits [(table.729) (table.733)]
+>> endobj
+19117 0 obj <<
+/Names [(table.734) 14121 0 R (table.735) 14122 0 R (table.736) 14129 0 R (table.737) 14130 0 R (table.738) 14132 0 R (table.739) 14133 0 R]
+/Limits [(table.734) (table.739)]
+>> endobj
+19118 0 obj <<
+/Names [(table.74) 3665 0 R (table.740) 14135 0 R (table.741) 14136 0 R (table.742) 14144 0 R (table.743) 14146 0 R (table.744) 14149 0 R]
+/Limits [(table.74) (table.744)]
+>> endobj
+19119 0 obj <<
+/Names [(table.745) 14151 0 R (table.746) 14158 0 R (table.747) 14159 0 R (table.748) 14161 0 R (table.749) 14162 0 R (table.75) 3667 0 R]
+/Limits [(table.745) (table.75)]
+>> endobj
+19120 0 obj <<
+/Names [(table.750) 14164 0 R (table.751) 14165 0 R (table.752) 14172 0 R (table.753) 14173 0 R (table.754) 14175 0 R (table.755) 14177 0 R]
+/Limits [(table.750) (table.755)]
+>> endobj
+19121 0 obj <<
+/Names [(table.756) 14185 0 R (table.757) 14187 0 R (table.758) 14189 0 R (table.759) 14191 0 R (table.76) 3678 0 R (table.760) 14193 0 R]
+/Limits [(table.756) (table.760)]
+>> endobj
+19122 0 obj <<
+/Names [(table.761) 14201 0 R (table.762) 14203 0 R (table.763) 14205 0 R (table.764) 14206 0 R (table.765) 14208 0 R (table.766) 14209 0 R]
+/Limits [(table.761) (table.766)]
+>> endobj
+19123 0 obj <<
+/Names [(table.767) 14216 0 R (table.768) 14217 0 R (table.769) 14219 0 R (table.77) 3680 0 R (table.770) 14221 0 R (table.771) 14222 0 R]
+/Limits [(table.767) (table.771)]
+>> endobj
+19124 0 obj <<
+/Names [(table.772) 14224 0 R (table.773) 14225 0 R (table.774) 14235 0 R (table.775) 14236 0 R (table.776) 14238 0 R (table.777) 14239 0 R]
+/Limits [(table.772) (table.777)]
+>> endobj
+19125 0 obj <<
+/Names [(table.778) 14241 0 R (table.779) 14242 0 R (table.78) 3681 0 R (table.780) 14244 0 R (table.781) 14253 0 R (table.782) 14256 0 R]
+/Limits [(table.778) (table.782)]
+>> endobj
+19126 0 obj <<
+/Names [(table.783) 14258 0 R (table.784) 14267 0 R (table.785) 14268 0 R (table.786) 14270 0 R (table.787) 14271 0 R (table.788) 14273 0 R]
+/Limits [(table.783) (table.788)]
+>> endobj
+19127 0 obj <<
+/Names [(table.789) 14286 0 R (table.79) 3683 0 R (table.790) 14289 0 R (table.791) 14290 0 R (table.792) 14293 0 R (table.793) 14294 0 R]
+/Limits [(table.789) (table.793)]
+>> endobj
+19128 0 obj <<
+/Names [(table.794) 14305 0 R (table.795) 14306 0 R (table.796) 14308 0 R (table.797) 14309 0 R (table.798) 14311 0 R (table.799) 14312 0 R]
+/Limits [(table.794) (table.799)]
+>> endobj
+19129 0 obj <<
+/Names [(table.8) 2489 0 R (table.80) 3684 0 R (table.800) 14325 0 R (table.801) 14326 0 R (table.802) 14340 0 R (table.803) 14341 0 R]
+/Limits [(table.8) (table.803)]
+>> endobj
+19130 0 obj <<
+/Names [(table.804) 14343 0 R (table.805) 14344 0 R (table.806) 14358 0 R (table.807) 14359 0 R (table.808) 14361 0 R (table.809) 14364 0 R]
+/Limits [(table.804) (table.809)]
+>> endobj
+19131 0 obj <<
+/Names [(table.81) 3695 0 R (table.810) 14365 0 R (table.811) 14383 0 R (table.812) 14384 0 R (table.813) 15069 0 R (table.814) 15072 0 R]
+/Limits [(table.81) (table.814)]
+>> endobj
+19132 0 obj <<
+/Names [(table.815) 15078 0 R (table.816) 15080 0 R (table.817) 15081 0 R (table.818) 15083 0 R (table.819) 15084 0 R (table.82) 3696 0 R]
+/Limits [(table.815) (table.82)]
+>> endobj
+19133 0 obj <<
+/Names [(table.820) 15086 0 R (table.821) 15092 0 R (table.822) 15094 0 R (table.823) 15097 0 R (table.824) 15099 0 R (table.825) 15101 0 R]
+/Limits [(table.820) (table.825)]
+>> endobj
+19134 0 obj <<
+/Names [(table.826) 15108 0 R (table.827) 15110 0 R (table.828) 15112 0 R (table.829) 15114 0 R (table.83) 3698 0 R (table.830) 15116 0 R]
+/Limits [(table.826) (table.830)]
+>> endobj
+19135 0 obj <<
+/Names [(table.831) 15117 0 R (table.832) 15124 0 R (table.833) 15125 0 R (table.834) 15127 0 R (table.835) 15128 0 R (table.836) 15130 0 R]
+/Limits [(table.831) (table.836)]
+>> endobj
+19136 0 obj <<
+/Names [(table.837) 15139 0 R (table.838) 15141 0 R (table.839) 15142 0 R (table.84) 3699 0 R (table.840) 15144 0 R (table.841) 15146 0 R]
+/Limits [(table.837) (table.841)]
+>> endobj
+19137 0 obj <<
+/Names [(table.842) 15153 0 R (table.843) 15155 0 R (table.844) 15156 0 R (table.845) 15158 0 R (table.846) 15160 0 R (table.847) 15167 0 R]
+/Limits [(table.842) (table.847)]
+>> endobj
+19138 0 obj <<
+/Names [(table.848) 15168 0 R (table.849) 15170 0 R (table.85) 3701 0 R (table.850) 15171 0 R (table.851) 15173 0 R (table.852) 15174 0 R]
+/Limits [(table.848) (table.852)]
+>> endobj
+19139 0 obj <<
+/Names [(table.853) 15176 0 R (table.854) 15182 0 R (table.855) 15184 0 R (table.856) 15185 0 R (table.857) 15187 0 R (table.858) 15188 0 R]
+/Limits [(table.853) (table.858)]
+>> endobj
+19140 0 obj <<
+/Names [(table.859) 15190 0 R (table.86) 3710 0 R (table.860) 15197 0 R (table.861) 15199 0 R (table.862) 15200 0 R (table.863) 15202 0 R]
+/Limits [(table.859) (table.863)]
+>> endobj
+19141 0 obj <<
+/Names [(table.864) 15203 0 R (table.865) 15205 0 R (table.866) 15213 0 R (table.867) 15215 0 R (table.868) 15216 0 R (table.869) 15218 0 R]
+/Limits [(table.864) (table.869)]
+>> endobj
+19142 0 obj <<
+/Names [(table.87) 3712 0 R (table.870) 15220 0 R (table.871) 15221 0 R (table.872) 15233 0 R (table.873) 15234 0 R (table.874) 15236 0 R]
+/Limits [(table.87) (table.874)]
+>> endobj
+19143 0 obj <<
+/Names [(table.875) 15238 0 R (table.876) 15240 0 R (table.877) 15242 0 R (table.878) 15251 0 R (table.879) 15252 0 R (table.88) 3714 0 R]
+/Limits [(table.875) (table.88)]
+>> endobj
+19144 0 obj <<
+/Names [(table.880) 15254 0 R (table.881) 15255 0 R (table.882) 15257 0 R (table.883) 15268 0 R (table.884) 15270 0 R (table.885) 15271 0 R]
+/Limits [(table.880) (table.885)]
+>> endobj
+19145 0 obj <<
+/Names [(table.886) 15274 0 R (table.887) 15275 0 R (table.888) 15288 0 R (table.889) 15289 0 R (table.89) 3716 0 R (table.890) 15291 0 R]
+/Limits [(table.886) (table.890)]
+>> endobj
+19146 0 obj <<
+/Names [(table.891) 15292 0 R (table.892) 15294 0 R (table.893) 15295 0 R (table.894) 15306 0 R (table.895) 15307 0 R (table.896) 15309 0 R]
+/Limits [(table.891) (table.896)]
+>> endobj
+19147 0 obj <<
+/Names [(table.897) 15311 0 R (table.898) 15319 0 R (table.899) 15321 0 R (table.9) 2490 0 R (table.90) 3718 0 R (table.900) 15323 0 R]
+/Limits [(table.897) (table.900)]
+>> endobj
+19148 0 obj <<
+/Names [(table.901) 15325 0 R (table.902) 15340 0 R (table.903) 15343 0 R (table.904) 15344 0 R (table.905) 15346 0 R (table.906) 15347 0 R]
+/Limits [(table.901) (table.906)]
+>> endobj
+19149 0 obj <<
+/Names [(table.907) 15349 0 R (table.908) 15362 0 R (table.909) 15365 0 R (table.91) 3727 0 R (table.910) 15366 0 R (table.911) 15368 0 R]
+/Limits [(table.907) (table.911)]
+>> endobj
+19150 0 obj <<
+/Names [(table.912) 15369 0 R (table.913) 15371 0 R (table.914) 15372 0 R (table.915) 15384 0 R (table.916) 15385 0 R (table.917) 15387 0 R]
+/Limits [(table.912) (table.917)]
+>> endobj
+19151 0 obj <<
+/Names [(table.918) 15389 0 R (table.919) 15390 0 R (table.92) 3728 0 R (table.920) 15402 0 R (table.921) 15404 0 R (table.922) 15406 0 R]
+/Limits [(table.918) (table.922)]
+>> endobj
+19152 0 obj <<
+/Names [(table.923) 15417 0 R (table.924) 15419 0 R (table.925) 15420 0 R (table.926) 15423 0 R (table.927) 15426 0 R (table.928) 15434 0 R]
+/Limits [(table.923) (table.928)]
+>> endobj
+19153 0 obj <<
+/Names [(table.929) 15436 0 R (table.93) 3730 0 R (table.930) 15438 0 R (table.931) 15641 0 R (table.932) 15683 0 R (table.933) 15692 0 R]
+/Limits [(table.929) (table.933)]
+>> endobj
+19154 0 obj <<
+/Names [(table.934) 15768 0 R (table.935) 15771 0 R (table.936) 15899 0 R (table.937) 15994 0 R (table.938) 15996 0 R (table.94) 3731 0 R]
+/Limits [(table.934) (table.94)]
+>> endobj
+19155 0 obj <<
+/Names [(table.95) 3733 0 R (table.96) 3734 0 R (table.97) 3744 0 R (table.98) 3745 0 R (table.99) 3747 0 R]
+/Limits [(table.95) (table.99)]
+>> endobj
+19156 0 obj <<
+/Kids [18176 0 R 18177 0 R 18178 0 R 18179 0 R 18180 0 R 18181 0 R]
+/Limits [(Doc-Start) (classParma__Polyhedra__Library_1_1BD__Shape_a39b8f1fb08978701670894460a54cf61)]
+>> endobj
+19157 0 obj <<
+/Kids [18182 0 R 18183 0 R 18184 0 R 18185 0 R 18186 0 R 18187 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a3a679103070e0356c10d4a1ef627f78d) (classParma__Polyhedra__Library_1_1BD__Shape_a883c6690834c25c2a363ccfdee259851)]
+>> endobj
+19158 0 obj <<
+/Kids [18188 0 R 18189 0 R 18190 0 R 18191 0 R 18192 0 R 18193 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_a88c162dae957cc0a7c4245e0416a34d6) (classParma__Polyhedra__Library_1_1BD__Shape_ae19446701e7a216e5faefffd1188a2d2)]
+>> endobj
+19159 0 obj <<
+/Kids [18194 0 R 18195 0 R 18196 0 R 18197 0 R 18198 0 R 18199 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1BD__Shape_ae348ffaa6b9c476915222198ac021f42) (classParma__Polyhedra__Library_1_1Box_a1946e416f0a015ffa8c3397b13ccfcd9)]
+>> endobj
+19160 0 obj <<
+/Kids [18200 0 R 18201 0 R 18202 0 R 18203 0 R 18204 0 R 18205 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a1ac45fdc32c1f71277c20bf99ba897b2) (classParma__Polyhedra__Library_1_1Box_a73264e4e6986e1b5c39d7a9e15b7e983)]
+>> endobj
+19161 0 obj <<
+/Kids [18206 0 R 18207 0 R 18208 0 R 18209 0 R 18210 0 R 18211 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Box_a738468a82c6d887970a834617108ad38) (classParma__Polyhedra__Library_1_1Box_add1749de593080b326f6fb04bf1efe50)]
+>> endobj
+19162 0 obj <<
+/Kids [18212 0 R 18213 0 R 18214 0 R 18215 0 R 18216 0 R 18217 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Box_ade1f0e51d72f00210547d258764758e8) (classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_adf87eef74d0ff9ff35e15aeea0a361c7)]
+>> endobj
+19163 0 obj <<
+/Kids [18218 0 R 18219 0 R 18220 0 R 18221 0 R 18222 0 R 18223 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1CO__Tree_1_1const__iterator_ae2203bd0c93393bccdc66bc07ca93d68) (classParma__Polyhedra__Library_1_1C__Polyhedron_ac86d25d06285c9a2e890770fed084574)]
+>> endobj
+19164 0 obj <<
+/Kids [18224 0 R 18225 0 R 18226 0 R 18227 0 R 18228 0 R 18229 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1C__Polyhedron_ac98ed1378829f72aee73c40dff16f269) (classParma__Polyhedra__Library_1_1Checked__Number_a4bed59d493c4fd91537602efb267c938)]
+>> endobj
+19165 0 obj <<
+/Kids [18230 0 R 18231 0 R 18232 0 R 18233 0 R 18234 0 R 18235 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_a4ce2f9170fb3470ba10d87607c3c0bf3) (classParma__Polyhedra__Library_1_1Checked__Number_ade4a5582f82333f20fd6a8be13ff8d7f)]
+>> endobj
+19166 0 obj <<
+/Kids [18236 0 R 18237 0 R 18238 0 R 18239 0 R 18240 0 R 18241 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Checked__Number_ae09d1e8f6ab1eea10ceba92f21681110) (classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a12f3d0ee3885355092a65262f24d46af)]
+>> endobj
+19167 0 obj <<
+/Kids [18242 0 R 18243 0 R 18244 0 R 18245 0 R 18246 0 R 18247 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_1_1const__iterator_a192ff11375b59075c9ea19a8c2b5511e) (classParma__Polyhedra__Library_1_1Congruence__System_a9e8a61b2b759dde8f65219688548ffaa)]
+>> endobj
+19168 0 obj <<
+/Kids [18248 0 R 18249 0 R 18250 0 R 18251 0 R 18252 0 R 18253 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) (classParma__Polyhedra__Library_1_1Congruence_a584cb5084fe5479b0c373e3d17fe5ffd)]
+>> endobj
+19169 0 obj <<
+/Kids [18254 0 R 18255 0 R 18256 0 R 18257 0 R 18258 0 R 18259 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_a5a207ecd92e9fd8f3b1937a5064746a9) (classParma__Polyhedra__Library_1_1Congruence_afcf86304f17dc474e1e5bbe0486c1b59)]
+>> endobj
+19170 0 obj <<
+/Kids [18260 0 R 18261 0 R 18262 0 R 18263 0 R 18264 0 R 18265 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence_afd55d0cb3ab31c5e800c18eb849aa295) (classParma__Polyhedra__Library_1_1Constraint__System_a32d97203a9cbf1abf97af74fc70df05b)]
+>> endobj
+19171 0 obj <<
+/Kids [18266 0 R 18267 0 R 18268 0 R 18269 0 R 18270 0 R 18271 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint__System_a3410a53827de9155ac7d6cbd84263364) (classParma__Polyhedra__Library_1_1Constraint_a239b0622fbcfe1638b4246deab2caa29)]
+>> endobj
+19172 0 obj <<
+/Kids [18272 0 R 18273 0 R 18274 0 R 18275 0 R 18276 0 R 18277 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_a2679da4dbd5b8c33ef607aee49690c2a) (classParma__Polyhedra__Library_1_1Constraint_aaf207e746f4a3dc2722e254612dab3b3)]
+>> endobj
+19173 0 obj <<
+/Kids [18278 0 R 18279 0 R 18280 0 R 18281 0 R 18282 0 R 18283 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Constraint_ab0f18894c8f97fa0cd38736462f36132) (classParma__Polyhedra__Library_1_1Determinate)]
+>> endobj
+19174 0 obj <<
+/Kids [18284 0 R 18285 0 R 18286 0 R 18287 0 R 18288 0 R 18289 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Determinate_a054973ef19a18393fa8036b0de2e4dbe) (classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a443736bb8156073cf1c5f672737eb02b)]
+>> endobj
+19175 0 obj <<
+/Kids [18290 0 R 18291 0 R 18292 0 R 18293 0 R 18294 0 R 18295 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Division__Floating__Point__Expression_a6cfe9f46fa0f15b09149f89ef35430c4) (classParma__Polyhedra__Library_1_1GMP__Integer_a4039bbdc92a28fade431cb98f20b0fa6)]
+>> endobj
+19176 0 obj <<
+/Kids [18296 0 R 18297 0 R 18298 0 R 18299 0 R 18300 0 R 18301 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1GMP__Integer_a6d5c75bcc32f8aea006e8da4b3f736b2) (classParma__Polyhedra__Library_1_1Generator__System_a7bda239eefab2b9cc9cabc123bbaef31)]
+>> endobj
+19177 0 obj <<
+/Kids [18302 0 R 18303 0 R 18304 0 R 18305 0 R 18306 0 R 18307 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Generator__System_a804b0e848b19f18d99664d5bbd57a3f1) (classParma__Polyhedra__Library_1_1Generator_a3bc88b2886b0b86865186d142e5ee414)]
+>> endobj
+19178 0 obj <<
+/Kids [18308 0 R 18309 0 R 18310 0 R 18311 0 R 18312 0 R 18313 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_a3f29f8b40d09b17eaa4cbaac069f72a0) (classParma__Polyhedra__Library_1_1Generator_a974166a1fe54f72e254c8f02687084e6)]
+>> endobj
+19179 0 obj <<
+/Kids [18314 0 R 18315 0 R 18316 0 R 18317 0 R 18318 0 R 18319 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Generator_aa19ce1717f502bd8078edf02574f2df2) (classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f)]
+>> endobj
+19180 0 obj <<
+/Kids [18320 0 R 18321 0 R 18322 0 R 18323 0 R 18324 0 R 18325 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) (classParma__Polyhedra__Library_1_1Grid__Generator__System_a8e247a33c9eb40439c706a98c5d363d0)]
+>> endobj
+19181 0 obj <<
+/Kids [18326 0 R 18327 0 R 18328 0 R 18329 0 R 18330 0 R 18331 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator__System_a8f29bc3aa01b8f5c67a3323189f9cf9e) (classParma__Polyhedra__Library_1_1Grid__Generator_a2a0bc130f7cf6a0678ee3b982fcc7ab6)]
+>> endobj
+19182 0 obj <<
+/Kids [18332 0 R 18333 0 R 18334 0 R 18335 0 R 18336 0 R 18337 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_a2d4aa4b95cb53d23b232457b212e82e4) (classParma__Polyhedra__Library_1_1Grid__Generator_ac3e03bc2df621903d136c689c38bdb6f)]
+>> endobj
+19183 0 obj <<
+/Kids [18338 0 R 18339 0 R 18340 0 R 18341 0 R 18342 0 R 18343 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Generator_ac74dafaa0b06e9cd3d15ea0d2af1b213) (classParma__Polyhedra__Library_1_1Grid_a1cb88a546d32e7b5c07dc25055e33235)]
+>> endobj
+19184 0 obj <<
+/Kids [18344 0 R 18345 0 R 18346 0 R 18347 0 R 18348 0 R 18349 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a1d51ba9ca3c3e0bf0042502f40d2e11b) (classParma__Polyhedra__Library_1_1Grid_a8688fd38682b19e97422816d72524790)]
+>> endobj
+19185 0 obj <<
+/Kids [18350 0 R 18351 0 R 18352 0 R 18353 0 R 18354 0 R 18355 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_a87d004db7f8febf6f9c96b4a2a1c85e5) (classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6)]
+>> endobj
+19186 0 obj <<
+/Kids [18356 0 R 18357 0 R 18358 0 R 18359 0 R 18360 0 R 18361 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) (classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a253054117c47dec9e844a92455b63b23)]
+>> endobj
+19187 0 obj <<
+/Kids [18362 0 R 18363 0 R 18364 0 R 18365 0 R 18366 0 R 18367 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1EList__Iterator_a2a78b4dccc5cb62f5dc676955349fe22) (classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_ae93b5801e403e1dc169b6891774756cd)]
+>> endobj
+19188 0 obj <<
+/Kids [18368 0 R 18369 0 R 18370 0 R 18371 0 R 18372 0 R 18373 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Implementation_1_1Watchdog_1_1Pending__Element_aecd9a36bb78f2cd4987654e4164469ed) (classParma__Polyhedra__Library_1_1Interval_abed7286726807179efc1001a249f0eec)]
+>> endobj
+19189 0 obj <<
+/Kids [18374 0 R 18375 0 R 18376 0 R 18377 0 R 18378 0 R 18379 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Interval_ac02677c5008f5842ba8100572684e8f4) (classParma__Polyhedra__Library_1_1Linear__Expression_a0ed481e43baf024d4a5b5e86e85c4a87)]
+>> endobj
+19190 0 obj <<
+/Kids [18380 0 R 18381 0 R 18382 0 R 18383 0 R 18384 0 R 18385 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a114f91c420cc8060d6834730c8e55721) (classParma__Polyhedra__Library_1_1Linear__Expression_a6ea3cf85efb71cf62fa3e233c9e9cf7b)]
+>> endobj
+19191 0 obj <<
+/Kids [18386 0 R 18387 0 R 18388 0 R 18389 0 R 18390 0 R 18391 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_a6f8cd8fbee64faaa5e47c8e41ba7662e) (classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae)]
+>> endobj
+19192 0 obj <<
+/Kids [18392 0 R 18393 0 R 18394 0 R 18395 0 R 18396 0 R 18397 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) (classParma__Polyhedra__Library_1_1Linear__Form_ab5088f9329846a09702bcd0a05490b67)]
+>> endobj
+19193 0 obj <<
+/Kids [18398 0 R 18399 0 R 18400 0 R 18401 0 R 18402 0 R 18403 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem) (classParma__Polyhedra__Library_1_1MIP__Problem_a49625522da117289c0312c67060210f2)]
+>> endobj
+19194 0 obj <<
+/Kids [18404 0 R 18405 0 R 18406 0 R 18407 0 R 18408 0 R 18409 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1MIP__Problem_a4d480f0b906eef0c0094c8fabc69a3b3) (classParma__Polyhedra__Library_1_1NNC__Polyhedron_a163f5dff452c6cf2e3a0c929eb2b8187)]
+>> endobj
+19195 0 obj <<
+/Kids [18410 0 R 18411 0 R 18412 0 R 18413 0 R 18414 0 R 18415 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1NNC__Polyhedron_a16829d6b83d0c21f3d3e1f87c46ac239) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a26d8154ade10de97de8dea739300059b)]
+>> endobj
+19196 0 obj <<
+/Kids [18416 0 R 18417 0 R 18418 0 R 18419 0 R 18420 0 R 18421 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a293c185dd2a1e1d3e8444f13a3a4600a) (classParma__Polyhedra__Library_1_1Octagonal__Shape_a6fd695131c86734bc6d325b5d803677c)]
+>> endobj
+19197 0 obj <<
+/Kids [18422 0 R 18423 0 R 18424 0 R 18425 0 R 18426 0 R 18427 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_a72b4003eb85d959872be6607bdd86450) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac549f855c22dcda23d882bd8e659b38c)]
+>> endobj
+19198 0 obj <<
+/Kids [18428 0 R 18429 0 R 18430 0 R 18431 0 R 18432 0 R 18433 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6973f94432db196ff06218b7c38205a) (classParma__Polyhedra__Library_1_1PIP__Decision__Node_a81497d1095efd042cd3034335a3d19e6)]
+>> endobj
+19199 0 obj <<
+/Kids [18434 0 R 18435 0 R 18436 0 R 18437 0 R 18438 0 R 18439 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Decision__Node_a9be1cd3f6bd0582f6a60bffe2d72d2cc) (classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a624c8a3766d76f8eabbb18e9270b32c1)]
+>> endobj
+19200 0 obj <<
+/Kids [18440 0 R 18441 0 R 18442 0 R 18443 0 R 18444 0 R 18445 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Problem_a8fc1017d7db28f674678a1ccc49ae7b2a9fbd7fce64abd6f1a6459300d77884f4) (classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac3cf88993e63370f39ad5ea8915ba2af)]
+>> endobj
+19201 0 obj <<
+/Kids [18446 0 R 18447 0 R 18448 0 R 18449 0 R 18450 0 R 18451 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Solution__Node_ac75ace456537db34732d1e1cca5e06de) (classParma__Polyhedra__Library_1_1PIP__Tree__Node_a77459bc72a66ade5bdb58c0ce1aaf020)]
+>> endobj
+19202 0 obj <<
+/Kids [18452 0 R 18453 0 R 18454 0 R 18455 0 R 18456 0 R 18457 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1PIP__Tree__Node_a7d8d70c48e3726d157cdaf49f6e1028d) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a1c64dc50a3b4915af285e1fbf558336e)]
+>> endobj
+19203 0 obj <<
+/Kids [18458 0 R 18459 0 R 18460 0 R 18461 0 R 18462 0 R 18463 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a2c79439f4041447a648d8179889955a2) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8b7aa1436b25cff4dddb7ce3710003eb)]
+>> endobj
+19204 0 obj <<
+/Kids [18464 0 R 18465 0 R 18466 0 R 18467 0 R 18468 0 R 18469 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8d3933bc0c35af723fe62c1c062df074) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_adcb2fdf8455a113cbfaaab29c5a3ff22)]
+>> endobj
+19205 0 obj <<
+/Kids [18470 0 R 18471 0 R 18472 0 R 18473 0 R 18474 0 R 18475 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_ae18801dc804c40ce09a8f1c59be9b329) (classParma__Polyhedra__Library_1_1Pointset__Powerset_a4de33097ab368fe3a04efcb7d06e951f)]
+>> endobj
+19206 0 obj <<
+/Kids [18476 0 R 18477 0 R 18478 0 R 18479 0 R 18480 0 R 18481 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_a4ef22528f01e0580396340c7c1a35411) (classParma__Polyhedra__Library_1_1Pointset__Powerset_aae1cd388ec3212a9ffe035fb50a0c433)]
+>> endobj
+19207 0 obj <<
+/Kids [18482 0 R 18483 0 R 18484 0 R 18485 0 R 18486 0 R 18487 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Pointset__Powerset_ab58e79d1bb74e1d280f13f67b4a72088) (classParma__Polyhedra__Library_1_1Poly__Con__Relation_a825bf274e880e1c8d51b42d32c69004e)]
+>> endobj
+19208 0 obj <<
+/Kids [18488 0 R 18489 0 R 18490 0 R 18491 0 R 18492 0 R 18493 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Poly__Con__Relation_a9f09728ae53c8e3dadeb202f28bb6fdb) (classParma__Polyhedra__Library_1_1Polyhedron_a236a18fe8cc922d00ee92a6c6e42f923)]
+>> endobj
+19209 0 obj <<
+/Kids [18494 0 R 18495 0 R 18496 0 R 18497 0 R 18498 0 R 18499 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a249ea59c1765ea299f4d9471388aa5f9) (classParma__Polyhedra__Library_1_1Polyhedron_a7b8d597a3c23af1fce9d8d3e1d36e11d)]
+>> endobj
+19210 0 obj <<
+/Kids [18500 0 R 18501 0 R 18502 0 R 18503 0 R 18504 0 R 18505 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) (classParma__Polyhedra__Library_1_1Polyhedron_ac6ea1802e6a6cfb32e5af6d6d26eb424)]
+>> endobj
+19211 0 obj <<
+/Kids [18506 0 R 18507 0 R 18508 0 R 18509 0 R 18510 0 R 18511 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_ac93800b9ec7aae75937598e1f2209b1f) (classParma__Polyhedra__Library_1_1Powerset_a1d52d042b5e633bc5444947ceaa65cd4)]
+>> endobj
+19212 0 obj <<
+/Kids [18512 0 R 18513 0 R 18514 0 R 18515 0 R 18516 0 R 18517 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_a1df108cb7c2a626eaa0764c74cc509d1) (classParma__Polyhedra__Library_1_1Powerset_ae61b8233ebbfce8a9feeb4018265b734)]
+>> endobj
+19213 0 obj <<
+/Kids [18518 0 R 18519 0 R 18520 0 R 18521 0 R 18522 0 R 18523 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Powerset_aebef0c6c47af055bfb03332886019aa1) (classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a39f667f349cf531d9948abac9bdc0250)]
+>> endobj
+19214 0 obj <<
+/Kids [18524 0 R 18525 0 R 18526 0 R 18527 0 R 18528 0 R 18529 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Variable__Floating__Point__Expression_a6b20922fdda0a1d3edcd6e642d882f68) (classParma__Polyhedra__Library_1_1Variables__Set_ada205f4442f845f797fb108c121fe371)]
+>> endobj
+19215 0 obj <<
+/Kids [18530 0 R 18531 0 R 18532 0 R 18533 0 R 18534 0 R 18535 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Variables__Set_afbcfd5d585123fad758b763b4e2ed336) (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0)]
+>> endobj
+19216 0 obj <<
+/Kids [18536 0 R 18537 0 R 18538 0 R 18539 0 R 18540 0 R 18541 0 R]
+/Limits [(group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) (group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2a0f182c5824807f7bc66d2d2033810feb)]
+>> endobj
+19217 0 obj <<
+/Kids [18542 0 R 18543 0 R 18544 0 R 18545 0 R 18546 0 R 18547 0 R]
+/Limits [(group__PPL__CXX__interface_gga25ea3a289eadef732f4c7fd823387fb2aa57b0c1a34eced57ca8437eea92a4328) (group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a44e009680d1b9995b04ac762c6ef8057)]
+>> endobj
+19218 0 obj <<
+/Kids [18548 0 R 18549 0 R 18550 0 R 18551 0 R 18552 0 R 18553 0 R]
+/Limits [(group__PPL__CXX__interface_ggaa88e9b9cb2588cbf5914695fc14e69a8a4e2e7513e80017645e24e2fc7bb6846d) (index_BDHetal05)]
+>> endobj
+19219 0 obj <<
+/Kids [18554 0 R 18555 0 R 18556 0 R 18557 0 R 18558 0 R 18559 0 R]
+/Limits [(index_BDHetal06) (index_BMPZ12b)]
+>> endobj
+19220 0 obj <<
+/Kids [18560 0 R 18561 0 R 18562 0 R 18563 0 R 18564 0 R 18565 0 R]
+/Limits [(index_BRZH02a) (index_Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension)]
+>> endobj
+19221 0 obj <<
+/Kids [18566 0 R 18567 0 R 18568 0 R 18569 0 R 18570 0 R 18571 0 R]
+/Limits [(index_Fuk98) (index_Hal79)]
+>> endobj
+19222 0 obj <<
+/Kids [18572 0 R 18573 0 R 18574 0 R 18575 0 R 18576 0 R 18577 0 R]
+/Limits [(index_Hal93) (index_PS98)]
+>> endobj
+19223 0 obj <<
+/Kids [18578 0 R 18579 0 R 18580 0 R 18581 0 R 18582 0 R 18583 0 R]
+/Limits [(index_Pairwise_Merge) (index_Wey35)]
+>> endobj
+19224 0 obj <<
+/Kids [18584 0 R 18585 0 R 18586 0 R 18587 0 R 18588 0 R 18589 0 R]
+/Limits [(index_Wey50) (index_use_of_library)]
+>> endobj
+19225 0 obj <<
+/Kids [18590 0 R 18591 0 R 18592 0 R 18593 0 R 18594 0 R 18595 0 R]
+/Limits [(namespaceParma__Polyhedra__Library) (namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a4e456df02ee601b05831536311de132c)]
+>> endobj
+19226 0 obj <<
+/Kids [18596 0 R 18597 0 R 18598 0 R 18599 0 R 18600 0 R 18601 0 R]
+/Limits [(namespaceParma__Polyhedra__Library_ae511c510b0e7687e7866c274f3a06a98a9223ac459b80b2eb397dd7810be7aa07) (page.121)]
+>> endobj
+19227 0 obj <<
+/Kids [18602 0 R 18603 0 R 18604 0 R 18605 0 R 18606 0 R 18607 0 R]
+/Limits [(page.122) (page.153)]
+>> endobj
+19228 0 obj <<
+/Kids [18608 0 R 18609 0 R 18610 0 R 18611 0 R 18612 0 R 18613 0 R]
+/Limits [(page.154) (page.185)]
+>> endobj
+19229 0 obj <<
+/Kids [18614 0 R 18615 0 R 18616 0 R 18617 0 R 18618 0 R 18619 0 R]
+/Limits [(page.186) (page.216d)]
+>> endobj
+19230 0 obj <<
+/Kids [18620 0 R 18621 0 R 18622 0 R 18623 0 R 18624 0 R 18625 0 R]
+/Limits [(page.217) (page.248)]
+>> endobj
+19231 0 obj <<
+/Kids [18626 0 R 18627 0 R 18628 0 R 18629 0 R 18630 0 R 18631 0 R]
+/Limits [(page.249) (page.278)]
+>> endobj
+19232 0 obj <<
+/Kids [18632 0 R 18633 0 R 18634 0 R 18635 0 R 18636 0 R 18637 0 R]
+/Limits [(page.279) (page.31)]
+>> endobj
+19233 0 obj <<
+/Kids [18638 0 R 18639 0 R 18640 0 R 18641 0 R 18642 0 R 18643 0 R]
+/Limits [(page.310) (page.341)]
+>> endobj
+19234 0 obj <<
+/Kids [18644 0 R 18645 0 R 18646 0 R 18647 0 R 18648 0 R 18649 0 R]
+/Limits [(page.342) (page.372)]
+>> endobj
+19235 0 obj <<
+/Kids [18650 0 R 18651 0 R 18652 0 R 18653 0 R 18654 0 R 18655 0 R]
+/Limits [(page.373) (page.403)]
+>> endobj
+19236 0 obj <<
+/Kids [18656 0 R 18657 0 R 18658 0 R 18659 0 R 18660 0 R 18661 0 R]
+/Limits [(page.404) (page.436)]
+>> endobj
+19237 0 obj <<
+/Kids [18662 0 R 18663 0 R 18664 0 R 18665 0 R 18666 0 R 18667 0 R]
+/Limits [(page.437) (page.468)]
+>> endobj
+19238 0 obj <<
+/Kids [18668 0 R 18669 0 R 18670 0 R 18671 0 R 18672 0 R 18673 0 R]
+/Limits [(page.469) (page.5)]
+>> endobj
+19239 0 obj <<
+/Kids [18674 0 R 18675 0 R 18676 0 R 18677 0 R 18678 0 R 18679 0 R]
+/Limits [(page.50) (page.531)]
+>> endobj
+19240 0 obj <<
+/Kids [18680 0 R 18681 0 R 18682 0 R 18683 0 R 18684 0 R 18685 0 R]
+/Limits [(page.532) (page.77)]
+>> endobj
+19241 0 obj <<
+/Kids [18686 0 R 18687 0 R 18688 0 R 18689 0 R 18690 0 R 18691 0 R]
+/Limits [(page.78) (paragraph.10.18.2.2)]
+>> endobj
+19242 0 obj <<
+/Kids [18692 0 R 18693 0 R 18694 0 R 18695 0 R 18696 0 R 18697 0 R]
+/Limits [(paragraph.10.18.2.3) (paragraph.10.21.4.5)]
+>> endobj
+19243 0 obj <<
+/Kids [18698 0 R 18699 0 R 18700 0 R 18701 0 R 18702 0 R 18703 0 R]
+/Limits [(paragraph.10.21.4.6) (paragraph.10.26.3.9)]
+>> endobj
+19244 0 obj <<
+/Kids [18704 0 R 18705 0 R 18706 0 R 18707 0 R 18708 0 R 18709 0 R]
+/Limits [(paragraph.10.27.2.1) (paragraph.10.32.4.5)]
+>> endobj
+19245 0 obj <<
+/Kids [18710 0 R 18711 0 R 18712 0 R 18713 0 R 18714 0 R 18715 0 R]
+/Limits [(paragraph.10.32.4.6) (paragraph.10.32.5.39)]
+>> endobj
+19246 0 obj <<
+/Kids [18716 0 R 18717 0 R 18718 0 R 18719 0 R 18720 0 R 18721 0 R]
+/Limits [(paragraph.10.32.5.4) (paragraph.10.4.2.9)]
+>> endobj
+19247 0 obj <<
+/Kids [18722 0 R 18723 0 R 18724 0 R 18725 0 R 18726 0 R 18727 0 R]
+/Limits [(paragraph.10.4.3.1) (paragraph.10.4.3.41)]
+>> endobj
+19248 0 obj <<
+/Kids [18728 0 R 18729 0 R 18730 0 R 18731 0 R 18732 0 R 18733 0 R]
+/Limits [(paragraph.10.4.3.42) (paragraph.10.45.3.2)]
+>> endobj
+19249 0 obj <<
+/Kids [18734 0 R 18735 0 R 18736 0 R 18737 0 R 18738 0 R 18739 0 R]
+/Limits [(paragraph.10.45.3.3) (paragraph.10.47.5.21)]
+>> endobj
+19250 0 obj <<
+/Kids [18740 0 R 18741 0 R 18742 0 R 18743 0 R 18744 0 R 18745 0 R]
+/Limits [(paragraph.10.47.5.22) (paragraph.10.50.2.13)]
+>> endobj
+19251 0 obj <<
+/Kids [18746 0 R 18747 0 R 18748 0 R 18749 0 R 18750 0 R 18751 0 R]
+/Limits [(paragraph.10.50.2.14) (paragraph.10.51.3.20)]
+>> endobj
+19252 0 obj <<
+/Kids [18752 0 R 18753 0 R 18754 0 R 18755 0 R 18756 0 R 18757 0 R]
+/Limits [(paragraph.10.51.3.21) (paragraph.10.51.3.53)]
+>> endobj
+19253 0 obj <<
+/Kids [18758 0 R 18759 0 R 18760 0 R 18761 0 R 18762 0 R 18763 0 R]
+/Limits [(paragraph.10.51.3.54) (paragraph.10.53.5.10)]
+>> endobj
+19254 0 obj <<
+/Kids [18764 0 R 18765 0 R 18766 0 R 18767 0 R 18768 0 R 18769 0 R]
+/Limits [(paragraph.10.53.5.11) (paragraph.10.62.3.1)]
+>> endobj
+19255 0 obj <<
+/Kids [18770 0 R 18771 0 R 18772 0 R 18773 0 R 18774 0 R 18775 0 R]
+/Limits [(paragraph.10.62.3.10) (paragraph.10.63.4.19)]
+>> endobj
+19256 0 obj <<
+/Kids [18776 0 R 18777 0 R 18778 0 R 18779 0 R 18780 0 R 18781 0 R]
+/Limits [(paragraph.10.63.4.2) (paragraph.10.63.4.51)]
+>> endobj
+19257 0 obj <<
+/Kids [18782 0 R 18783 0 R 18784 0 R 18785 0 R 18786 0 R 18787 0 R]
+/Limits [(paragraph.10.63.4.52) (paragraph.10.65.4.8)]
+>> endobj
+19258 0 obj <<
+/Kids [18788 0 R 18789 0 R 18790 0 R 18791 0 R 18792 0 R 18793 0 R]
+/Limits [(paragraph.10.65.4.9) (paragraph.10.70.3.15)]
+>> endobj
+19259 0 obj <<
+/Kids [18794 0 R 18795 0 R 18796 0 R 18797 0 R 18798 0 R 18799 0 R]
+/Limits [(paragraph.10.70.3.16) (paragraph.10.70.3.48)]
+>> endobj
+19260 0 obj <<
+/Kids [18800 0 R 18801 0 R 18802 0 R 18803 0 R 18804 0 R 18805 0 R]
+/Limits [(paragraph.10.70.3.49) (paragraph.10.72.2.9)]
+>> endobj
+19261 0 obj <<
+/Kids [18806 0 R 18807 0 R 18808 0 R 18809 0 R 18810 0 R 18811 0 R]
+/Limits [(paragraph.10.72.3.1) (paragraph.10.72.3.41)]
+>> endobj
+19262 0 obj <<
+/Kids [18812 0 R 18813 0 R 18814 0 R 18815 0 R 18816 0 R 18817 0 R]
+/Limits [(paragraph.10.72.3.42) (paragraph.10.77.3.2)]
+>> endobj
+19263 0 obj <<
+/Kids [18818 0 R 18819 0 R 18820 0 R 18821 0 R 18822 0 R 18823 0 R]
+/Limits [(paragraph.10.77.3.3) (paragraph.10.79.3.26)]
+>> endobj
+19264 0 obj <<
+/Kids [18824 0 R 18825 0 R 18826 0 R 18827 0 R 18828 0 R 18829 0 R]
+/Limits [(paragraph.10.79.3.27) (paragraph.10.8.2.11)]
+>> endobj
+19265 0 obj <<
+/Kids [18830 0 R 18831 0 R 18832 0 R 18833 0 R 18834 0 R 18835 0 R]
+/Limits [(paragraph.10.8.2.12) (paragraph.10.8.3.31)]
+>> endobj
+19266 0 obj <<
+/Kids [18836 0 R 18837 0 R 18838 0 R 18839 0 R 18840 0 R 18841 0 R]
+/Limits [(paragraph.10.8.3.32) (paragraph.10.8.3.7)]
+>> endobj
+19267 0 obj <<
+/Kids [18842 0 R 18843 0 R 18844 0 R 18845 0 R 18846 0 R 18847 0 R]
+/Limits [(paragraph.10.8.3.8) (paragraph.10.82.3.17)]
+>> endobj
+19268 0 obj <<
+/Kids [18848 0 R 18849 0 R 18850 0 R 18851 0 R 18852 0 R 18853 0 R]
+/Limits [(paragraph.10.82.3.18) (paragraph.10.82.3.5)]
+>> endobj
+19269 0 obj <<
+/Kids [18854 0 R 18855 0 R 18856 0 R 18857 0 R 18858 0 R 18859 0 R]
+/Limits [(paragraph.10.82.3.50) (paragraph.10.83.3.3)]
+>> endobj
+19270 0 obj <<
+/Kids [18860 0 R 18861 0 R 18862 0 R 18863 0 R 18864 0 R 18865 0 R]
+/Limits [(paragraph.10.83.3.4) (paragraph.8.1.2.4)]
+>> endobj
+19271 0 obj <<
+/Kids [18866 0 R 18867 0 R 18868 0 R 18869 0 R 18870 0 R 18871 0 R]
+/Limits [(paragraph.8.1.3.1) (paragraph.8.1.5.27)]
+>> endobj
+19272 0 obj <<
+/Kids [18872 0 R 18873 0 R 18874 0 R 18875 0 R 18876 0 R 18877 0 R]
+/Limits [(paragraph.8.1.5.28) (section*.108)]
+>> endobj
+19273 0 obj <<
+/Kids [18878 0 R 18879 0 R 18880 0 R 18881 0 R 18882 0 R 18883 0 R]
+/Limits [(section*.109) (section*.140)]
+>> endobj
+19274 0 obj <<
+/Kids [18884 0 R 18885 0 R 18886 0 R 18887 0 R 18888 0 R 18889 0 R]
+/Limits [(section*.141) (section*.173)]
+>> endobj
+19275 0 obj <<
+/Kids [18890 0 R 18891 0 R 18892 0 R 18893 0 R 18894 0 R 18895 0 R]
+/Limits [(section*.174) (section*.205)]
+>> endobj
+19276 0 obj <<
+/Kids [18896 0 R 18897 0 R 18898 0 R 18899 0 R 18900 0 R 18901 0 R]
+/Limits [(section*.206) (section*.238)]
+>> endobj
+19277 0 obj <<
+/Kids [18902 0 R 18903 0 R 18904 0 R 18905 0 R 18906 0 R 18907 0 R]
+/Limits [(section*.239) (section*.270)]
+>> endobj
+19278 0 obj <<
+/Kids [18908 0 R 18909 0 R 18910 0 R 18911 0 R 18912 0 R 18913 0 R]
+/Limits [(section*.271) (section*.43)]
+>> endobj
+19279 0 obj <<
+/Kids [18914 0 R 18915 0 R 18916 0 R 18917 0 R 18918 0 R 18919 0 R]
+/Limits [(section*.44) (section*.76)]
+>> endobj
+19280 0 obj <<
+/Kids [18920 0 R 18921 0 R 18922 0 R 18923 0 R 18924 0 R 18925 0 R]
+/Limits [(section*.77) (structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare)]
+>> endobj
+19281 0 obj <<
+/Kids [18926 0 R 18927 0 R 18928 0 R 18929 0 R 18930 0 R 18931 0 R]
+/Limits [(structParma__Polyhedra__Library_1_1BHRZ03__Certificate_1_1Compare_a98c515b16e12424b273eaff073b31f3b) (subsection.10.18)]
+>> endobj
+19282 0 obj <<
+/Kids [18932 0 R 18933 0 R 18934 0 R 18935 0 R 18936 0 R 18937 0 R]
+/Limits [(subsection.10.19) (subsection.10.50)]
+>> endobj
+19283 0 obj <<
+/Kids [18938 0 R 18939 0 R 18940 0 R 18941 0 R 18942 0 R 18943 0 R]
+/Limits [(subsection.10.51) (subsection.10.83)]
+>> endobj
+19284 0 obj <<
+/Kids [18944 0 R 18945 0 R 18946 0 R 18947 0 R 18948 0 R 18949 0 R]
+/Limits [(subsection.10.84) (subsubsection.1.11.1)]
+>> endobj
+19285 0 obj <<
+/Kids [18950 0 R 18951 0 R 18952 0 R 18953 0 R 18954 0 R 18955 0 R]
+/Limits [(subsubsection.1.12.1) (subsubsection.1.6.14)]
+>> endobj
+19286 0 obj <<
+/Kids [18956 0 R 18957 0 R 18958 0 R 18959 0 R 18960 0 R 18961 0 R]
+/Limits [(subsubsection.1.6.15) (subsubsection.10.14.1)]
+>> endobj
+19287 0 obj <<
+/Kids [18962 0 R 18963 0 R 18964 0 R 18965 0 R 18966 0 R 18967 0 R]
+/Limits [(subsubsection.10.15.1) (subsubsection.10.3.3)]
+>> endobj
+19288 0 obj <<
+/Kids [18968 0 R 18969 0 R 18970 0 R 18971 0 R 18972 0 R 18973 0 R]
+/Limits [(subsubsection.10.3.4) (subsubsection.10.45.2)]
+>> endobj
+19289 0 obj <<
+/Kids [18974 0 R 18975 0 R 18976 0 R 18977 0 R 18978 0 R 18979 0 R]
+/Limits [(subsubsection.10.45.3) (subsubsection.10.55.1)]
+>> endobj
+19290 0 obj <<
+/Kids [18980 0 R 18981 0 R 18982 0 R 18983 0 R 18984 0 R 18985 0 R]
+/Limits [(subsubsection.10.55.2) (subsubsection.10.70.2)]
+>> endobj
+19291 0 obj <<
+/Kids [18986 0 R 18987 0 R 18988 0 R 18989 0 R 18990 0 R 18991 0 R]
+/Limits [(subsubsection.10.70.3) (subsubsection.10.82.2)]
+>> endobj
+19292 0 obj <<
+/Kids [18992 0 R 18993 0 R 18994 0 R 18995 0 R 18996 0 R 18997 0 R]
+/Limits [(subsubsection.10.82.3) (subsubsection.8.1.4)]
+>> endobj
+19293 0 obj <<
+/Kids [18998 0 R 18999 0 R 19000 0 R 19001 0 R 19002 0 R 19003 0 R]
+/Limits [(subsubsection.8.1.5) (table.122)]
+>> endobj
+19294 0 obj <<
+/Kids [19004 0 R 19005 0 R 19006 0 R 19007 0 R 19008 0 R 19009 0 R]
+/Limits [(table.123) (table.155)]
+>> endobj
+19295 0 obj <<
+/Kids [19010 0 R 19011 0 R 19012 0 R 19013 0 R 19014 0 R 19015 0 R]
+/Limits [(table.156) (table.188)]
+>> endobj
+19296 0 obj <<
+/Kids [19016 0 R 19017 0 R 19018 0 R 19019 0 R 19020 0 R 19021 0 R]
+/Limits [(table.189) (table.22)]
+>> endobj
+19297 0 obj <<
+/Kids [19022 0 R 19023 0 R 19024 0 R 19025 0 R 19026 0 R 19027 0 R]
+/Limits [(table.220) (table.252)]
+>> endobj
+19298 0 obj <<
+/Kids [19028 0 R 19029 0 R 19030 0 R 19031 0 R 19032 0 R 19033 0 R]
+/Limits [(table.253) (table.285)]
+>> endobj
+19299 0 obj <<
+/Kids [19034 0 R 19035 0 R 19036 0 R 19037 0 R 19038 0 R 19039 0 R]
+/Limits [(table.286) (table.317)]
+>> endobj
+19300 0 obj <<
+/Kids [19040 0 R 19041 0 R 19042 0 R 19043 0 R 19044 0 R 19045 0 R]
+/Limits [(table.318) (table.35)]
+>> endobj
+19301 0 obj <<
+/Kids [19046 0 R 19047 0 R 19048 0 R 19049 0 R 19050 0 R 19051 0 R]
+/Limits [(table.350) (table.382)]
+>> endobj
+19302 0 obj <<
+/Kids [19052 0 R 19053 0 R 19054 0 R 19055 0 R 19056 0 R 19057 0 R]
+/Limits [(table.383) (table.414)]
+>> endobj
+19303 0 obj <<
+/Kids [19058 0 R 19059 0 R 19060 0 R 19061 0 R 19062 0 R 19063 0 R]
+/Limits [(table.415) (table.447)]
+>> endobj
+19304 0 obj <<
+/Kids [19064 0 R 19065 0 R 19066 0 R 19067 0 R 19068 0 R 19069 0 R]
+/Limits [(table.448) (table.48)]
+>> endobj
+19305 0 obj <<
+/Kids [19070 0 R 19071 0 R 19072 0 R 19073 0 R 19074 0 R 19075 0 R]
+/Limits [(table.480) (table.511)]
+>> endobj
+19306 0 obj <<
+/Kids [19076 0 R 19077 0 R 19078 0 R 19079 0 R 19080 0 R 19081 0 R]
+/Limits [(table.512) (table.544)]
+>> endobj
+19307 0 obj <<
+/Kids [19082 0 R 19083 0 R 19084 0 R 19085 0 R 19086 0 R 19087 0 R]
+/Limits [(table.545) (table.577)]
+>> endobj
+19308 0 obj <<
+/Kids [19088 0 R 19089 0 R 19090 0 R 19091 0 R 19092 0 R 19093 0 R]
+/Limits [(table.578) (table.609)]
+>> endobj
+19309 0 obj <<
+/Kids [19094 0 R 19095 0 R 19096 0 R 19097 0 R 19098 0 R 19099 0 R]
+/Limits [(table.61) (table.641)]
+>> endobj
+19310 0 obj <<
+/Kids [19100 0 R 19101 0 R 19102 0 R 19103 0 R 19104 0 R 19105 0 R]
+/Limits [(table.642) (table.674)]
+>> endobj
+19311 0 obj <<
+/Kids [19106 0 R 19107 0 R 19108 0 R 19109 0 R 19110 0 R 19111 0 R]
+/Limits [(table.675) (table.706)]
+>> endobj
+19312 0 obj <<
+/Kids [19112 0 R 19113 0 R 19114 0 R 19115 0 R 19116 0 R 19117 0 R]
+/Limits [(table.707) (table.739)]
+>> endobj
+19313 0 obj <<
+/Kids [19118 0 R 19119 0 R 19120 0 R 19121 0 R 19122 0 R 19123 0 R]
+/Limits [(table.74) (table.771)]
+>> endobj
+19314 0 obj <<
+/Kids [19124 0 R 19125 0 R 19126 0 R 19127 0 R 19128 0 R 19129 0 R]
+/Limits [(table.772) (table.803)]
+>> endobj
+19315 0 obj <<
+/Kids [19130 0 R 19131 0 R 19132 0 R 19133 0 R 19134 0 R 19135 0 R]
+/Limits [(table.804) (table.836)]
+>> endobj
+19316 0 obj <<
+/Kids [19136 0 R 19137 0 R 19138 0 R 19139 0 R 19140 0 R 19141 0 R]
+/Limits [(table.837) (table.869)]
+>> endobj
+19317 0 obj <<
+/Kids [19142 0 R 19143 0 R 19144 0 R 19145 0 R 19146 0 R 19147 0 R]
+/Limits [(table.87) (table.900)]
+>> endobj
+19318 0 obj <<
+/Kids [19148 0 R 19149 0 R 19150 0 R 19151 0 R 19152 0 R 19153 0 R]
+/Limits [(table.901) (table.933)]
+>> endobj
+19319 0 obj <<
+/Kids [19154 0 R 19155 0 R]
+/Limits [(table.934) (table.99)]
+>> endobj
+19320 0 obj <<
+/Kids [19156 0 R 19157 0 R 19158 0 R 19159 0 R 19160 0 R 19161 0 R]
+/Limits [(Doc-Start) (classParma__Polyhedra__Library_1_1Box_add1749de593080b326f6fb04bf1efe50)]
+>> endobj
+19321 0 obj <<
+/Kids [19162 0 R 19163 0 R 19164 0 R 19165 0 R 19166 0 R 19167 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Box_ade1f0e51d72f00210547d258764758e8) (classParma__Polyhedra__Library_1_1Congruence__System_a9e8a61b2b759dde8f65219688548ffaa)]
+>> endobj
+19322 0 obj <<
+/Kids [19168 0 R 19169 0 R 19170 0 R 19171 0 R 19172 0 R 19173 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Congruence__System_aa341843d5eadfc196441cad0af63ac9d) (classParma__Polyhedra__Library_1_1Determinate)]
+>> endobj
+19323 0 obj <<
+/Kids [19174 0 R 19175 0 R 19176 0 R 19177 0 R 19178 0 R 19179 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Determinate_a054973ef19a18393fa8036b0de2e4dbe) (classParma__Polyhedra__Library_1_1Grid__Certificate_a67cbe06cd666025c2ff64652d5824a2f)]
+>> endobj
+19324 0 obj <<
+/Kids [19180 0 R 19181 0 R 19182 0 R 19183 0 R 19184 0 R 19185 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid__Certificate_a869306ea4afb6453b8e9cee36c96f46e) (classParma__Polyhedra__Library_1_1Grid_adc7cdee1981f44b5db23f6c28c79d0a6)]
+>> endobj
+19325 0 obj <<
+/Kids [19186 0 R 19187 0 R 19188 0 R 19189 0 R 19190 0 R 19191 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Grid_adcf35e414093ac621958d1badd313e25) (classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae)]
+>> endobj
+19326 0 obj <<
+/Kids [19192 0 R 19193 0 R 19194 0 R 19195 0 R 19196 0 R 19197 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) (classParma__Polyhedra__Library_1_1Octagonal__Shape_ac549f855c22dcda23d882bd8e659b38c)]
+>> endobj
+19327 0 obj <<
+/Kids [19198 0 R 19199 0 R 19200 0 R 19201 0 R 19202 0 R 19203 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Octagonal__Shape_ac6973f94432db196ff06218b7c38205a) (classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8b7aa1436b25cff4dddb7ce3710003eb)]
+>> endobj
+19328 0 obj <<
+/Kids [19204 0 R 19205 0 R 19206 0 R 19207 0 R 19208 0 R 19209 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Partially__Reduced__Product_a8d3933bc0c35af723fe62c1c062df074) (classParma__Polyhedra__Library_1_1Polyhedron_a7b8d597a3c23af1fce9d8d3e1d36e11d)]
+>> endobj
+19329 0 obj <<
+/Kids [19210 0 R 19211 0 R 19212 0 R 19213 0 R 19214 0 R 19215 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Polyhedron_a7df62db3bf13024d4ee9f8aaf0d27dc6) (group__PPL__CXX__interface_ga6aaca5d438457de4baabe545c7e732f0)]
+>> endobj
+19330 0 obj <<
+/Kids [19216 0 R 19217 0 R 19218 0 R 19219 0 R 19220 0 R 19221 0 R]
+/Limits [(group__PPL__CXX__interface_ga6f9e36186616092e3affae42fd9728a0) (index_Hal79)]
+>> endobj
+19331 0 obj <<
+/Kids [19222 0 R 19223 0 R 19224 0 R 19225 0 R 19226 0 R 19227 0 R]
+/Limits [(index_Hal93) (page.153)]
+>> endobj
+19332 0 obj <<
+/Kids [19228 0 R 19229 0 R 19230 0 R 19231 0 R 19232 0 R 19233 0 R]
+/Limits [(page.154) (page.341)]
+>> endobj
+19333 0 obj <<
+/Kids [19234 0 R 19235 0 R 19236 0 R 19237 0 R 19238 0 R 19239 0 R]
+/Limits [(page.342) (page.531)]
+>> endobj
+19334 0 obj <<
+/Kids [19240 0 R 19241 0 R 19242 0 R 19243 0 R 19244 0 R 19245 0 R]
+/Limits [(page.532) (paragraph.10.32.5.39)]
+>> endobj
+19335 0 obj <<
+/Kids [19246 0 R 19247 0 R 19248 0 R 19249 0 R 19250 0 R 19251 0 R]
+/Limits [(paragraph.10.32.5.4) (paragraph.10.51.3.20)]
+>> endobj
+19336 0 obj <<
+/Kids [19252 0 R 19253 0 R 19254 0 R 19255 0 R 19256 0 R 19257 0 R]
+/Limits [(paragraph.10.51.3.21) (paragraph.10.65.4.8)]
+>> endobj
+19337 0 obj <<
+/Kids [19258 0 R 19259 0 R 19260 0 R 19261 0 R 19262 0 R 19263 0 R]
+/Limits [(paragraph.10.65.4.9) (paragraph.10.79.3.26)]
+>> endobj
+19338 0 obj <<
+/Kids [19264 0 R 19265 0 R 19266 0 R 19267 0 R 19268 0 R 19269 0 R]
+/Limits [(paragraph.10.79.3.27) (paragraph.10.83.3.3)]
+>> endobj
+19339 0 obj <<
+/Kids [19270 0 R 19271 0 R 19272 0 R 19273 0 R 19274 0 R 19275 0 R]
+/Limits [(paragraph.10.83.3.4) (section*.205)]
+>> endobj
+19340 0 obj <<
+/Kids [19276 0 R 19277 0 R 19278 0 R 19279 0 R 19280 0 R 19281 0 R]
+/Limits [(section*.206) (subsection.10.18)]
+>> endobj
+19341 0 obj <<
+/Kids [19282 0 R 19283 0 R 19284 0 R 19285 0 R 19286 0 R 19287 0 R]
+/Limits [(subsection.10.19) (subsubsection.10.3.3)]
+>> endobj
+19342 0 obj <<
+/Kids [19288 0 R 19289 0 R 19290 0 R 19291 0 R 19292 0 R 19293 0 R]
+/Limits [(subsubsection.10.3.4) (table.122)]
+>> endobj
+19343 0 obj <<
+/Kids [19294 0 R 19295 0 R 19296 0 R 19297 0 R 19298 0 R 19299 0 R]
+/Limits [(table.123) (table.317)]
+>> endobj
+19344 0 obj <<
+/Kids [19300 0 R 19301 0 R 19302 0 R 19303 0 R 19304 0 R 19305 0 R]
+/Limits [(table.318) (table.511)]
+>> endobj
+19345 0 obj <<
+/Kids [19306 0 R 19307 0 R 19308 0 R 19309 0 R 19310 0 R 19311 0 R]
+/Limits [(table.512) (table.706)]
+>> endobj
+19346 0 obj <<
+/Kids [19312 0 R 19313 0 R 19314 0 R 19315 0 R 19316 0 R 19317 0 R]
+/Limits [(table.707) (table.900)]
+>> endobj
+19347 0 obj <<
+/Kids [19318 0 R 19319 0 R]
+/Limits [(table.901) (table.99)]
+>> endobj
+19348 0 obj <<
+/Kids [19320 0 R 19321 0 R 19322 0 R 19323 0 R 19324 0 R 19325 0 R]
+/Limits [(Doc-Start) (classParma__Polyhedra__Library_1_1Linear__Expression_ae197d31ddce9785add2d89475653f0ae)]
+>> endobj
+19349 0 obj <<
+/Kids [19326 0 R 19327 0 R 19328 0 R 19329 0 R 19330 0 R 19331 0 R]
+/Limits [(classParma__Polyhedra__Library_1_1Linear__Expression_ae1dfbc8be3858f2423df19c32e043110) (page.153)]
+>> endobj
+19350 0 obj <<
+/Kids [19332 0 R 19333 0 R 19334 0 R 19335 0 R 19336 0 R 19337 0 R]
+/Limits [(page.154) (paragraph.10.79.3.26)]
+>> endobj
+19351 0 obj <<
+/Kids [19338 0 R 19339 0 R 19340 0 R 19341 0 R 19342 0 R 19343 0 R]
+/Limits [(paragraph.10.79.3.27) (table.317)]
+>> endobj
+19352 0 obj <<
+/Kids [19344 0 R 19345 0 R 19346 0 R 19347 0 R]
+/Limits [(table.318) (table.99)]
+>> endobj
+19353 0 obj <<
+/Kids [19348 0 R 19349 0 R 19350 0 R 19351 0 R 19352 0 R]
+/Limits [(Doc-Start) (table.99)]
+>> endobj
+19354 0 obj <<
+/Dests 19353 0 R
+>> endobj
+19355 0 obj <<
+/Type /Catalog
+/Pages 18174 0 R
+/Outlines 18175 0 R
+/Names 19354 0 R
+/PageMode/UseOutlines/PageLabels<</Nums[0<</S/D>>4<</S/r>>8<</S/D>>]>>
+/OpenAction 529 0 R
+>> endobj
+19356 0 obj <<
+/Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords()
+/CreationDate (D:20130404152438+02'00')
+/ModDate (D:20130404152438+02'00')
+/Trapped /False
+/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0)
+>> endobj
+xref
+0 19357
+0000000000 65535 f 
+0000000015 00000 n 
+0000105516 00000 n 
+0004485959 00000 n 
+0000000060 00000 n 
+0000000248 00000 n 
+0000105685 00000 n 
+0004485889 00000 n 
+0000000298 00000 n 
+0000000415 00000 n 
+0000123852 00000 n 
+0004485805 00000 n 
+0000000465 00000 n 
+0000000595 00000 n 
+0000123970 00000 n 
+0004485719 00000 n 
+0000000646 00000 n 
+0000000786 00000 n 
+0000129897 00000 n 
+0004485633 00000 n 
+0000000837 00000 n 
+0000000947 00000 n 
+0000140117 00000 n 
+0004485547 00000 n 
+0000000998 00000 n 
+0000001209 00000 n 
+0000154204 00000 n 
+0004485461 00000 n 
+0000001260 00000 n 
+0000001446 00000 n 
+0000192928 00000 n 
+0004485375 00000 n 
+0000001497 00000 n 
+0000001625 00000 n 
+0000197617 00000 n 
+0004485289 00000 n 
+0000001676 00000 n 
+0000001826 00000 n 
+0000203373 00000 n 
+0004485203 00000 n 
+0000001877 00000 n 
+0000001977 00000 n 
+0000213990 00000 n 
+0004485117 00000 n 
+0000002029 00000 n 
+0000002205 00000 n 
+0000230723 00000 n 
+0004485031 00000 n 
+0000002257 00000 n 
+0000002415 00000 n 
+0000236134 00000 n 
+0004484945 00000 n 
+0000002467 00000 n 
+0000002701 00000 n 
+0000241915 00000 n 
+0004484859 00000 n 
+0000002753 00000 n 
+0000002929 00000 n 
+0000249449 00000 n 
+0004484773 00000 n 
+0000002981 00000 n 
+0000003215 00000 n 
+0000260730 00000 n 
+0004484687 00000 n 
+0000003267 00000 n 
+0000003385 00000 n 
+0000270237 00000 n 
+0004484614 00000 n 
+0000003437 00000 n 
+0000003524 00000 n 
+0000312550 00000 n 
+0004484525 00000 n 
+0000003570 00000 n 
+0000003736 00000 n 
+0000351714 00000 n 
+0004484435 00000 n 
+0000003782 00000 n 
+0000003968 00000 n 
+0000371321 00000 n 
+0004484308 00000 n 
+0000004014 00000 n 
+0000004104 00000 n 
+0000371378 00000 n 
+0004484247 00000 n 
+0000004155 00000 n 
+0000004217 00000 n 
+0000371435 00000 n 
+0004484120 00000 n 
+0000004263 00000 n 
+0000004368 00000 n 
+0000371492 00000 n 
+0004484059 00000 n 
+0000004419 00000 n 
+0000004519 00000 n 
+0000371548 00000 n 
+0004483931 00000 n 
+0000004565 00000 n 
+0000004685 00000 n 
+0000371605 00000 n 
+0004483869 00000 n 
+0000004736 00000 n 
+0000004842 00000 n 
+0000397425 00000 n 
+0004483736 00000 n 
+0000004889 00000 n 
+0000004975 00000 n 
+0000397483 00000 n 
+0004483671 00000 n 
+0000005027 00000 n 
+0000005108 00000 n 
+0000451065 00000 n 
+0004483537 00000 n 
+0000005155 00000 n 
+0000005286 00000 n 
+0000451181 00000 n 
+0004483472 00000 n 
+0000005338 00000 n 
+0000005482 00000 n 
+0000569177 00000 n 
+0004483338 00000 n 
+0000005529 00000 n 
+0000005675 00000 n 
+0000569293 00000 n 
+0004483259 00000 n 
+0000005727 00000 n 
+0000005982 00000 n 
+0000659531 00000 n 
+0004483166 00000 n 
+0000006034 00000 n 
+0000006362 00000 n 
+0000663340 00000 n 
+0004483087 00000 n 
+0000006414 00000 n 
+0000006563 00000 n 
+0000665361 00000 n 
+0004482952 00000 n 
+0000006611 00000 n 
+0000006737 00000 n 
+0000665477 00000 n 
+0004482873 00000 n 
+0000006790 00000 n 
+0000007148 00000 n 
+0000665652 00000 n 
+0004482780 00000 n 
+0000007201 00000 n 
+0000007701 00000 n 
+0000665887 00000 n 
+0004482687 00000 n 
+0000007754 00000 n 
+0000008183 00000 n 
+0000689392 00000 n 
+0004482594 00000 n 
+0000008236 00000 n 
+0000008603 00000 n 
+0000883704 00000 n 
+0004482501 00000 n 
+0000008656 00000 n 
+0000008994 00000 n 
+0000887101 00000 n 
+0004482408 00000 n 
+0000009047 00000 n 
+0000009370 00000 n 
+0000887277 00000 n 
+0004482315 00000 n 
+0000009423 00000 n 
+0000009888 00000 n 
+0000895905 00000 n 
+0004482222 00000 n 
+0000009941 00000 n 
+0000010290 00000 n 
+0001072025 00000 n 
+0004482129 00000 n 
+0000010343 00000 n 
+0000010651 00000 n 
+0001113326 00000 n 
+0004482036 00000 n 
+0000010705 00000 n 
+0000011330 00000 n 
+0001127015 00000 n 
+0004481943 00000 n 
+0000011384 00000 n 
+0000011697 00000 n 
+0001132859 00000 n 
+0004481850 00000 n 
+0000011751 00000 n 
+0000012206 00000 n 
+0001133094 00000 n 
+0004481757 00000 n 
+0000012260 00000 n 
+0000012700 00000 n 
+0001169532 00000 n 
+0004481664 00000 n 
+0000012754 00000 n 
+0000013089 00000 n 
+0001169826 00000 n 
+0004481571 00000 n 
+0000013143 00000 n 
+0000013531 00000 n 
+0001174198 00000 n 
+0004481478 00000 n 
+0000013585 00000 n 
+0000013958 00000 n 
+0001174492 00000 n 
+0004481385 00000 n 
+0000014012 00000 n 
+0000014390 00000 n 
+0001185174 00000 n 
+0004481292 00000 n 
+0000014444 00000 n 
+0000014787 00000 n 
+0001216847 00000 n 
+0004481199 00000 n 
+0000014841 00000 n 
+0000015326 00000 n 
+0001224791 00000 n 
+0004481106 00000 n 
+0000015380 00000 n 
+0000015751 00000 n 
+0001233846 00000 n 
+0004481013 00000 n 
+0000015805 00000 n 
+0000016100 00000 n 
+0001298637 00000 n 
+0004480920 00000 n 
+0000016154 00000 n 
+0000016487 00000 n 
+0001338071 00000 n 
+0004480827 00000 n 
+0000016541 00000 n 
+0000017001 00000 n 
+0001351175 00000 n 
+0004480734 00000 n 
+0000017055 00000 n 
+0000017441 00000 n 
+0001358610 00000 n 
+0004480641 00000 n 
+0000017495 00000 n 
+0000017934 00000 n 
+0001367242 00000 n 
+0004480548 00000 n 
+0000017988 00000 n 
+0000018354 00000 n 
+0001387426 00000 n 
+0004480455 00000 n 
+0000018408 00000 n 
+0000018893 00000 n 
+0001394620 00000 n 
+0004480362 00000 n 
+0000018947 00000 n 
+0000019363 00000 n 
+0001412112 00000 n 
+0004480269 00000 n 
+0000019417 00000 n 
+0000019833 00000 n 
+0001418731 00000 n 
+0004480176 00000 n 
+0000019887 00000 n 
+0000020409 00000 n 
+0001422630 00000 n 
+0004480083 00000 n 
+0000020463 00000 n 
+0000021108 00000 n 
+0001451282 00000 n 
+0004479990 00000 n 
+0000021162 00000 n 
+0000021457 00000 n 
+0001537255 00000 n 
+0004479897 00000 n 
+0000021511 00000 n 
+0000021844 00000 n 
+0001569603 00000 n 
+0004479804 00000 n 
+0000021898 00000 n 
+0000022312 00000 n 
+0001574868 00000 n 
+0004479711 00000 n 
+0000022366 00000 n 
+0000022826 00000 n 
+0001584061 00000 n 
+0004479618 00000 n 
+0000022880 00000 n 
+0000023274 00000 n 
+0001603555 00000 n 
+0004479525 00000 n 
+0000023328 00000 n 
+0000023983 00000 n 
+0001615435 00000 n 
+0004479432 00000 n 
+0000024037 00000 n 
+0000024682 00000 n 
+0001639338 00000 n 
+0004479339 00000 n 
+0000024736 00000 n 
+0000025161 00000 n 
+0001639573 00000 n 
+0004479246 00000 n 
+0000025215 00000 n 
+0000025646 00000 n 
+0001659926 00000 n 
+0004479153 00000 n 
+0000025700 00000 n 
+0000026129 00000 n 
+0001668703 00000 n 
+0004479060 00000 n 
+0000026183 00000 n 
+0000026660 00000 n 
+0001674271 00000 n 
+0004478967 00000 n 
+0000026714 00000 n 
+0000027080 00000 n 
+0001674446 00000 n 
+0004478874 00000 n 
+0000027134 00000 n 
+0000027642 00000 n 
+0001682253 00000 n 
+0004478781 00000 n 
+0000027696 00000 n 
+0000028293 00000 n 
+0001708968 00000 n 
+0004478688 00000 n 
+0000028347 00000 n 
+0000028843 00000 n 
+0001720890 00000 n 
+0004478595 00000 n 
+0000028897 00000 n 
+0000029187 00000 n 
+0001857699 00000 n 
+0004478502 00000 n 
+0000029241 00000 n 
+0000029569 00000 n 
+0001877328 00000 n 
+0004478409 00000 n 
+0000029623 00000 n 
+0000030032 00000 n 
+0001899528 00000 n 
+0004478316 00000 n 
+0000030086 00000 n 
+0000030389 00000 n 
+0001909813 00000 n 
+0004478223 00000 n 
+0000030443 00000 n 
+0000030708 00000 n 
+0002105839 00000 n 
+0004478130 00000 n 
+0000030762 00000 n 
+0000031090 00000 n 
+0002112216 00000 n 
+0004478037 00000 n 
+0000031144 00000 n 
+0000031462 00000 n 
+0002210684 00000 n 
+0004477944 00000 n 
+0000031516 00000 n 
+0000031872 00000 n 
+0002242634 00000 n 
+0004477851 00000 n 
+0000031926 00000 n 
+0000032249 00000 n 
+0002255821 00000 n 
+0004477758 00000 n 
+0000032303 00000 n 
+0000032713 00000 n 
+0002264354 00000 n 
+0004477665 00000 n 
+0000032767 00000 n 
+0000033360 00000 n 
+0002271716 00000 n 
+0004477572 00000 n 
+0000033414 00000 n 
+0000033872 00000 n 
+0002276270 00000 n 
+0004477479 00000 n 
+0000033926 00000 n 
+0000034254 00000 n 
+0002276450 00000 n 
+0004477386 00000 n 
+0000034308 00000 n 
+0000034778 00000 n 
+0002276690 00000 n 
+0004477293 00000 n 
+0000034832 00000 n 
+0000035264 00000 n 
+0002291312 00000 n 
+0004477200 00000 n 
+0000035318 00000 n 
+0000035651 00000 n 
+0002314034 00000 n 
+0004477107 00000 n 
+0000035705 00000 n 
+0000036038 00000 n 
+0002428079 00000 n 
+0004477014 00000 n 
+0000036092 00000 n 
+0000036474 00000 n 
+0002455722 00000 n 
+0004476921 00000 n 
+0000036528 00000 n 
+0000036831 00000 n 
+0002510307 00000 n 
+0004476828 00000 n 
+0000036885 00000 n 
+0000037560 00000 n 
+0002534369 00000 n 
+0004476735 00000 n 
+0000037614 00000 n 
+0000037932 00000 n 
+0002573082 00000 n 
+0004476642 00000 n 
+0000037986 00000 n 
+0000038410 00000 n 
+0002573262 00000 n 
+0004476549 00000 n 
+0000038464 00000 n 
+0000038879 00000 n 
+0002583708 00000 n 
+0004476456 00000 n 
+0000038933 00000 n 
+0000039335 00000 n 
+0002767633 00000 n 
+0004476363 00000 n 
+0000039389 00000 n 
+0000040034 00000 n 
+0002795200 00000 n 
+0004476270 00000 n 
+0000040088 00000 n 
+0000040589 00000 n 
+0002956214 00000 n 
+0004476177 00000 n 
+0000040643 00000 n 
+0000041215 00000 n 
+0002976160 00000 n 
+0004476084 00000 n 
+0000041269 00000 n 
+0000041811 00000 n 
+0002987681 00000 n 
+0004475991 00000 n 
+0000041865 00000 n 
+0000042201 00000 n 
+0002999977 00000 n 
+0004475898 00000 n 
+0000042255 00000 n 
+0000042558 00000 n 
+0003063502 00000 n 
+0004475805 00000 n 
+0000042612 00000 n 
+0000042948 00000 n 
+0003090607 00000 n 
+0004475712 00000 n 
+0000043002 00000 n 
+0000043318 00000 n 
+0003137056 00000 n 
+0004475619 00000 n 
+0000043372 00000 n 
+0000043799 00000 n 
+0003294346 00000 n 
+0004475526 00000 n 
+0000043853 00000 n 
+0000044189 00000 n 
+0003312290 00000 n 
+0004475433 00000 n 
+0000044243 00000 n 
+0000044579 00000 n 
+0003330269 00000 n 
+0004475340 00000 n 
+0000044633 00000 n 
+0000044928 00000 n 
+0003543833 00000 n 
+0004475247 00000 n 
+0000044982 00000 n 
+0000045346 00000 n 
+0003587962 00000 n 
+0004475154 00000 n 
+0000045400 00000 n 
+0000045718 00000 n 
+0003588141 00000 n 
+0004475061 00000 n 
+0000045772 00000 n 
+0000046215 00000 n 
+0003592490 00000 n 
+0004474968 00000 n 
+0000046269 00000 n 
+0000046757 00000 n 
+0003597087 00000 n 
+0004474875 00000 n 
+0000046811 00000 n 
+0000047241 00000 n 
+0003609032 00000 n 
+0004474782 00000 n 
+0000047295 00000 n 
+0000047915 00000 n 
+0003621018 00000 n 
+0004474689 00000 n 
+0000047969 00000 n 
+0000048406 00000 n 
+0003621319 00000 n 
+0004474596 00000 n 
+0000048460 00000 n 
+0000048750 00000 n 
+0003627699 00000 n 
+0004474503 00000 n 
+0000048804 00000 n 
+0000049199 00000 n 
+0003631552 00000 n 
+0004474410 00000 n 
+0000049253 00000 n 
+0000049571 00000 n 
+0003631732 00000 n 
+0004474317 00000 n 
+0000049625 00000 n 
+0000050085 00000 n 
+0003632156 00000 n 
+0004474224 00000 n 
+0000050139 00000 n 
+0000050424 00000 n 
+0003660488 00000 n 
+0004474131 00000 n 
+0000050478 00000 n 
+0000051123 00000 n 
+0003673822 00000 n 
+0004474038 00000 n 
+0000051177 00000 n 
+0000051490 00000 n 
+0003684710 00000 n 
+0004473959 00000 n 
+0000051544 00000 n 
+0000051829 00000 n 
+0003685135 00000 n 
+0004473878 00000 n 
+0000051888 00000 n 
+0000051941 00000 n 
+0000053432 00000 n 
+0000053551 00000 n 
+0000056889 00000 n 
+0000051993 00000 n 
+0000056776 00000 n 
+0000056832 00000 n 
+0004458430 00000 n 
+0004456085 00000 n 
+0004456669 00000 n 
+0004456377 00000 n 
+0004458971 00000 n 
+0004459484 00000 n 
+0000056545 00000 n 
+0000056729 00000 n 
+0000057316 00000 n 
+0000057141 00000 n 
+0000057041 00000 n 
+0000057260 00000 n 
+0000064343 00000 n 
+0000064509 00000 n 
+0000064661 00000 n 
+0000064827 00000 n 
+0000065125 00000 n 
+0000059164 00000 n 
+0000065305 00000 n 
+0000061367 00000 n 
+0000065525 00000 n 
+0000058977 00000 n 
+0000057357 00000 n 
+0000065469 00000 n 
+0004458607 00000 n 
+0000064977 00000 n 
+0004457706 00000 n 
+0000061136 00000 n 
+0000061320 00000 n 
+0000064112 00000 n 
+0000064296 00000 n 
+0000351830 00000 n 
+0000312666 00000 n 
+0000065939 00000 n 
+0000065764 00000 n 
+0000065664 00000 n 
+0000065883 00000 n 
+0000068254 00000 n 
+0000068405 00000 n 
+0000068562 00000 n 
+0000068719 00000 n 
+0000068874 00000 n 
+0000069031 00000 n 
+0000069188 00000 n 
+0000069345 00000 n 
+0000069502 00000 n 
+0000069659 00000 n 
+0000069815 00000 n 
+0000069972 00000 n 
+0000070129 00000 n 
+0000070287 00000 n 
+0000070444 00000 n 
+0000070601 00000 n 
+0000070759 00000 n 
+0000070916 00000 n 
+0000071067 00000 n 
+0000071218 00000 n 
+0000071369 00000 n 
+0000071526 00000 n 
+0000071677 00000 n 
+0000071832 00000 n 
+0000071983 00000 n 
+0000072140 00000 n 
+0000072291 00000 n 
+0000072448 00000 n 
+0000072599 00000 n 
+0000072756 00000 n 
+0000072907 00000 n 
+0000073064 00000 n 
+0000073220 00000 n 
+0000073375 00000 n 
+0000073524 00000 n 
+0000073681 00000 n 
+0000073996 00000 n 
+0000074153 00000 n 
+0000074311 00000 n 
+0000074469 00000 n 
+0000074627 00000 n 
+0000074939 00000 n 
+0000078086 00000 n 
+0000075095 00000 n 
+0000075315 00000 n 
+0000067763 00000 n 
+0000065980 00000 n 
+0000075259 00000 n 
+0004454170 00000 n 
+0000073839 00000 n 
+0000074784 00000 n 
+0000078244 00000 n 
+0000078561 00000 n 
+0000078720 00000 n 
+0000079036 00000 n 
+0000079194 00000 n 
+0000079353 00000 n 
+0000079511 00000 n 
+0000079670 00000 n 
+0000079829 00000 n 
+0000079987 00000 n 
+0000080304 00000 n 
+0000080463 00000 n 
+0000080621 00000 n 
+0000080780 00000 n 
+0000081097 00000 n 
+0000081256 00000 n 
+0000081415 00000 n 
+0000081574 00000 n 
+0000081891 00000 n 
+0000082050 00000 n 
+0000082208 00000 n 
+0000082525 00000 n 
+0000082842 00000 n 
+0000083001 00000 n 
+0000083160 00000 n 
+0000083319 00000 n 
+0000083477 00000 n 
+0000083636 00000 n 
+0000083952 00000 n 
+0000084268 00000 n 
+0000084427 00000 n 
+0000084585 00000 n 
+0000084744 00000 n 
+0000085060 00000 n 
+0000085218 00000 n 
+0000085535 00000 n 
+0000085852 00000 n 
+0000086169 00000 n 
+0000086327 00000 n 
+0000086484 00000 n 
+0000089775 00000 n 
+0000086641 00000 n 
+0000086861 00000 n 
+0000077515 00000 n 
+0000075454 00000 n 
+0000086805 00000 n 
+0000078403 00000 n 
+0000078878 00000 n 
+0000080146 00000 n 
+0000080939 00000 n 
+0000081733 00000 n 
+0000082367 00000 n 
+0000082684 00000 n 
+0000083794 00000 n 
+0000084110 00000 n 
+0000084902 00000 n 
+0000085377 00000 n 
+0000085694 00000 n 
+0000086011 00000 n 
+0000089934 00000 n 
+0000090093 00000 n 
+0000090252 00000 n 
+0000090410 00000 n 
+0000090569 00000 n 
+0000090728 00000 n 
+0000090887 00000 n 
+0000091204 00000 n 
+0000091521 00000 n 
+0000091679 00000 n 
+0000091996 00000 n 
+0000092155 00000 n 
+0000092313 00000 n 
+0000092472 00000 n 
+0000092631 00000 n 
+0000092790 00000 n 
+0000093107 00000 n 
+0000093265 00000 n 
+0000093423 00000 n 
+0000093580 00000 n 
+0000093738 00000 n 
+0000094053 00000 n 
+0000094370 00000 n 
+0000094686 00000 n 
+0000095002 00000 n 
+0000095160 00000 n 
+0000095319 00000 n 
+0000095478 00000 n 
+0000095637 00000 n 
+0000095796 00000 n 
+0000095955 00000 n 
+0000096114 00000 n 
+0000096273 00000 n 
+0000096432 00000 n 
+0000096591 00000 n 
+0000096750 00000 n 
+0000097067 00000 n 
+0000097226 00000 n 
+0000097543 00000 n 
+0000097702 00000 n 
+0000097860 00000 n 
+0000098017 00000 n 
+0000099573 00000 n 
+0000098174 00000 n 
+0000098394 00000 n 
+0000089212 00000 n 
+0000087000 00000 n 
+0000098338 00000 n 
+0000091046 00000 n 
+0000091363 00000 n 
+0000091838 00000 n 
+0000092949 00000 n 
+0000093895 00000 n 
+0000094212 00000 n 
+0000094528 00000 n 
+0000094845 00000 n 
+0000096909 00000 n 
+0000097385 00000 n 
+0004459603 00000 n 
+0000099890 00000 n 
+0000100049 00000 n 
+0000100365 00000 n 
+0000100524 00000 n 
+0000100682 00000 n 
+0000100845 00000 n 
+0000101065 00000 n 
+0000099370 00000 n 
+0000098533 00000 n 
+0000101009 00000 n 
+0000099732 00000 n 
+0000100208 00000 n 
+0000104097 00000 n 
+0000104258 00000 n 
+0000104421 00000 n 
+0000104610 00000 n 
+0000104800 00000 n 
+0000104985 00000 n 
+0000105176 00000 n 
+0000108594 00000 n 
+0000105352 00000 n 
+0000105859 00000 n 
+0000103902 00000 n 
+0000101204 00000 n 
+0004458065 00000 n 
+0000105571 00000 n 
+0000105628 00000 n 
+0000105740 00000 n 
+0000105802 00000 n 
+0004459150 00000 n 
+0004457559 00000 n 
+0004454613 00000 n 
+0000129835 00000 n 
+0000260668 00000 n 
+0001071968 00000 n 
+0002534310 00000 n 
+0000689335 00000 n 
+0002583649 00000 n 
+0000895847 00000 n 
+0000108774 00000 n 
+0000108959 00000 n 
+0000109152 00000 n 
+0000109355 00000 n 
+0000109874 00000 n 
+0000108423 00000 n 
+0000106063 00000 n 
+0000109519 00000 n 
+0000109581 00000 n 
+0000109638 00000 n 
+0000109699 00000 n 
+0000109755 00000 n 
+0000109817 00000 n 
+0001909755 00000 n 
+0002276631 00000 n 
+0003136997 00000 n 
+0002795142 00000 n 
+0000112776 00000 n 
+0000112996 00000 n 
+0000112637 00000 n 
+0000110039 00000 n 
+0004455354 00000 n 
+0004455792 00000 n 
+0000112940 00000 n 
+0000115866 00000 n 
+0000116320 00000 n 
+0000115727 00000 n 
+0000113198 00000 n 
+0000116030 00000 n 
+0000116087 00000 n 
+0000116149 00000 n 
+0000116206 00000 n 
+0000116263 00000 n 
+0000119440 00000 n 
+0000119887 00000 n 
+0000119301 00000 n 
+0000116472 00000 n 
+0000119604 00000 n 
+0000119660 00000 n 
+0000119717 00000 n 
+0000119774 00000 n 
+0000119831 00000 n 
+0004459722 00000 n 
+0000123632 00000 n 
+0000124264 00000 n 
+0000123493 00000 n 
+0000120039 00000 n 
+0000123796 00000 n 
+0000123908 00000 n 
+0000124026 00000 n 
+0000124088 00000 n 
+0000124145 00000 n 
+0000124207 00000 n 
+0004454023 00000 n 
+0004456523 00000 n 
+0000128560 00000 n 
+0000128712 00000 n 
+0000128888 00000 n 
+0000129043 00000 n 
+0000129196 00000 n 
+0000129348 00000 n 
+0000129501 00000 n 
+0000130070 00000 n 
+0000128373 00000 n 
+0000124517 00000 n 
+0000129665 00000 n 
+0000129721 00000 n 
+0000129778 00000 n 
+0000129953 00000 n 
+0000130014 00000 n 
+0000312022 00000 n 
+0000290046 00000 n 
+0000295440 00000 n 
+0000307084 00000 n 
+0000312492 00000 n 
+0000134833 00000 n 
+0000135020 00000 n 
+0000135477 00000 n 
+0000134686 00000 n 
+0000130310 00000 n 
+0000135184 00000 n 
+0004455500 00000 n 
+0004455055 00000 n 
+0004453726 00000 n 
+0000135240 00000 n 
+0000135302 00000 n 
+0000135359 00000 n 
+0000135420 00000 n 
+0000149556 00000 n 
+0000139721 00000 n 
+0000140472 00000 n 
+0000139582 00000 n 
+0000135769 00000 n 
+0000139885 00000 n 
+0000139941 00000 n 
+0000139998 00000 n 
+0000140055 00000 n 
+0000140173 00000 n 
+0000140235 00000 n 
+0004454466 00000 n 
+0000140292 00000 n 
+0000140354 00000 n 
+0000140411 00000 n 
+0000145135 00000 n 
+0000145768 00000 n 
+0000144996 00000 n 
+0000140750 00000 n 
+0000145299 00000 n 
+0000145355 00000 n 
+0000145412 00000 n 
+0000145474 00000 n 
+0000145531 00000 n 
+0000145593 00000 n 
+0000145650 00000 n 
+0000145712 00000 n 
+0000149336 00000 n 
+0000149791 00000 n 
+0000149197 00000 n 
+0000146060 00000 n 
+0000149500 00000 n 
+0000149616 00000 n 
+0000149673 00000 n 
+0000149734 00000 n 
+0004459841 00000 n 
+0000153691 00000 n 
+0000154440 00000 n 
+0000153552 00000 n 
+0000150021 00000 n 
+0000153855 00000 n 
+0000153911 00000 n 
+0000153971 00000 n 
+0000154028 00000 n 
+0000154085 00000 n 
+0000154142 00000 n 
+0000154260 00000 n 
+0000154322 00000 n 
+0000154379 00000 n 
+0000158553 00000 n 
+0000159181 00000 n 
+0000158414 00000 n 
+0000154707 00000 n 
+0000158717 00000 n 
+0000158773 00000 n 
+0000158830 00000 n 
+0000158891 00000 n 
+0000158948 00000 n 
+0000159010 00000 n 
+0000159067 00000 n 
+0000159124 00000 n 
+0000163424 00000 n 
+0000163581 00000 n 
+0000163737 00000 n 
+0000164523 00000 n 
+0000163269 00000 n 
+0000159434 00000 n 
+0000163901 00000 n 
+0000163957 00000 n 
+0000164014 00000 n 
+0004457413 00000 n 
+0004456232 00000 n 
+0000164069 00000 n 
+0000164126 00000 n 
+0000164183 00000 n 
+0000164240 00000 n 
+0000164297 00000 n 
+0000164354 00000 n 
+0000164411 00000 n 
+0000164467 00000 n 
+0000295498 00000 n 
+0000169477 00000 n 
+0000169873 00000 n 
+0000169338 00000 n 
+0000164827 00000 n 
+0000169641 00000 n 
+0000169697 00000 n 
+0000169754 00000 n 
+0000169816 00000 n 
+0000174916 00000 n 
+0000175428 00000 n 
+0000174777 00000 n 
+0000170140 00000 n 
+0000175080 00000 n 
+0000175136 00000 n 
+0000175197 00000 n 
+0000175254 00000 n 
+0000175311 00000 n 
+0000175367 00000 n 
+0000179768 00000 n 
+0000179922 00000 n 
+0000185016 00000 n 
+0000180076 00000 n 
+0000180709 00000 n 
+0000179613 00000 n 
+0000175695 00000 n 
+0000180240 00000 n 
+0000180296 00000 n 
+0000180353 00000 n 
+0000180414 00000 n 
+0000180471 00000 n 
+0000180533 00000 n 
+0000180590 00000 n 
+0000180652 00000 n 
+0004459960 00000 n 
+0000301114 00000 n 
+0000301231 00000 n 
+0000185391 00000 n 
+0000185545 00000 n 
+0000185698 00000 n 
+0000185852 00000 n 
+0000186482 00000 n 
+0000184837 00000 n 
+0000181000 00000 n 
+0000186016 00000 n 
+0000185204 00000 n 
+0000186072 00000 n 
+0000186129 00000 n 
+0000186186 00000 n 
+0000186243 00000 n 
+0000186305 00000 n 
+0000186361 00000 n 
+0000186424 00000 n 
+0000241972 00000 n 
+0000295851 00000 n 
+0000276560 00000 n 
+0000191323 00000 n 
+0000191636 00000 n 
+0000191791 00000 n 
+0000191945 00000 n 
+0000192117 00000 n 
+0000192285 00000 n 
+0000193043 00000 n 
+0000191126 00000 n 
+0000186724 00000 n 
+0000192450 00000 n 
+0000192508 00000 n 
+0000192567 00000 n 
+0000191480 00000 n 
+0000192626 00000 n 
+0000192690 00000 n 
+0000192748 00000 n 
+0000192806 00000 n 
+0000192864 00000 n 
+0000192985 00000 n 
+0000197377 00000 n 
+0000196841 00000 n 
+0000196995 00000 n 
+0000197154 00000 n 
+0000197983 00000 n 
+0000196680 00000 n 
+0000193286 00000 n 
+0000197319 00000 n 
+0000197436 00000 n 
+0000197495 00000 n 
+0000197554 00000 n 
+0000197674 00000 n 
+0000197738 00000 n 
+0000197797 00000 n 
+0000197861 00000 n 
+0000197920 00000 n 
+0000290163 00000 n 
+0000270530 00000 n 
+0000202163 00000 n 
+0000202317 00000 n 
+0000202474 00000 n 
+0000202628 00000 n 
+0000202786 00000 n 
+0000203552 00000 n 
+0000201984 00000 n 
+0000198214 00000 n 
+0000202951 00000 n 
+0000203009 00000 n 
+0000203068 00000 n 
+0000203132 00000 n 
+0000203191 00000 n 
+0000203250 00000 n 
+0000203309 00000 n 
+0000203430 00000 n 
+0000203494 00000 n 
+0000290340 00000 n 
+0000276442 00000 n 
+0000270589 00000 n 
+0000212544 00000 n 
+0000212698 00000 n 
+0000207674 00000 n 
+0000208383 00000 n 
+0000207531 00000 n 
+0000203820 00000 n 
+0000207839 00000 n 
+0000207897 00000 n 
+0000207960 00000 n 
+0000208019 00000 n 
+0000208083 00000 n 
+0000208142 00000 n 
+0000208206 00000 n 
+0000208265 00000 n 
+0000208324 00000 n 
+0000212857 00000 n 
+0000213036 00000 n 
+0000213214 00000 n 
+0000214170 00000 n 
+0000212364 00000 n 
+0000208651 00000 n 
+0000213379 00000 n 
+0004455204 00000 n 
+0000213437 00000 n 
+0000213500 00000 n 
+0000213559 00000 n 
+0000213623 00000 n 
+0000213682 00000 n 
+0000213746 00000 n 
+0000213804 00000 n 
+0000213867 00000 n 
+0000213926 00000 n 
+0000214047 00000 n 
+0000214111 00000 n 
+0004460083 00000 n 
+0000311904 00000 n 
+0000219737 00000 n 
+0000219915 00000 n 
+0000220447 00000 n 
+0000219584 00000 n 
+0000214429 00000 n 
+0000220080 00000 n 
+0000220138 00000 n 
+0000220202 00000 n 
+0000220261 00000 n 
+0000220325 00000 n 
+0000220384 00000 n 
+0000224822 00000 n 
+0000224989 00000 n 
+0000225512 00000 n 
+0000224669 00000 n 
+0000220727 00000 n 
+0000225154 00000 n 
+0000225212 00000 n 
+0000225271 00000 n 
+0000225330 00000 n 
+0000225389 00000 n 
+0000225453 00000 n 
+0000229595 00000 n 
+0000229754 00000 n 
+0000229922 00000 n 
+0000235200 00000 n 
+0000235355 00000 n 
+0000235509 00000 n 
+0000230077 00000 n 
+0000230780 00000 n 
+0000229424 00000 n 
+0000225780 00000 n 
+0000230242 00000 n 
+0000230300 00000 n 
+0000230359 00000 n 
+0000230418 00000 n 
+0000230477 00000 n 
+0000230536 00000 n 
+0000230600 00000 n 
+0000230659 00000 n 
+0000235675 00000 n 
+0000236660 00000 n 
+0000235029 00000 n 
+0000231022 00000 n 
+0000235840 00000 n 
+0000235898 00000 n 
+0000235957 00000 n 
+0000236016 00000 n 
+0000236075 00000 n 
+0000236191 00000 n 
+0000236250 00000 n 
+0000236309 00000 n 
+0000236367 00000 n 
+0000236426 00000 n 
+0000236485 00000 n 
+0000236544 00000 n 
+0000236602 00000 n 
+0000270471 00000 n 
+0000276973 00000 n 
+0000241851 00000 n 
+0000240346 00000 n 
+0000240661 00000 n 
+0000240841 00000 n 
+0000241166 00000 n 
+0000241569 00000 n 
+0000242449 00000 n 
+0000240139 00000 n 
+0000236938 00000 n 
+0000241734 00000 n 
+0000241792 00000 n 
+0000240504 00000 n 
+0000241004 00000 n 
+0000241368 00000 n 
+0000242036 00000 n 
+0000242095 00000 n 
+0000242154 00000 n 
+0000242213 00000 n 
+0000242272 00000 n 
+0000242331 00000 n 
+0000242390 00000 n 
+0000246474 00000 n 
+0000246783 00000 n 
+0000246938 00000 n 
+0000247094 00000 n 
+0000247439 00000 n 
+0000247607 00000 n 
+0000247760 00000 n 
+0000247914 00000 n 
+0000248307 00000 n 
+0000248499 00000 n 
+0000248654 00000 n 
+0000252839 00000 n 
+0000248809 00000 n 
+0000249626 00000 n 
+0000246204 00000 n 
+0000242665 00000 n 
+0000248974 00000 n 
+0000249032 00000 n 
+0000249091 00000 n 
+0000249150 00000 n 
+0000246629 00000 n 
+0000249208 00000 n 
+0000249267 00000 n 
+0000249326 00000 n 
+0000247267 00000 n 
+0000248111 00000 n 
+0000249385 00000 n 
+0000249506 00000 n 
+0000249568 00000 n 
+0004460209 00000 n 
+0000276324 00000 n 
+0000276914 00000 n 
+0000883647 00000 n 
+0002242575 00000 n 
+0000306612 00000 n 
+0000306671 00000 n 
+0000253247 00000 n 
+0000253457 00000 n 
+0000253669 00000 n 
+0000253883 00000 n 
+0000254097 00000 n 
+0000254306 00000 n 
+0000254520 00000 n 
+0000254740 00000 n 
+0000254954 00000 n 
+0000255144 00000 n 
+0000255367 00000 n 
+0000252596 00000 n 
+0000249843 00000 n 
+0000255309 00000 n 
+0000253044 00000 n 
+0001674620 00000 n 
+0001113267 00000 n 
+0001422571 00000 n 
+0003660428 00000 n 
+0002767573 00000 n 
+0003608972 00000 n 
+0001592238 00000 n 
+0002510247 00000 n 
+0001615376 00000 n 
+0002428019 00000 n 
+0000259392 00000 n 
+0000259573 00000 n 
+0000259760 00000 n 
+0000259954 00000 n 
+0000260327 00000 n 
+0000260905 00000 n 
+0000259203 00000 n 
+0000255634 00000 n 
+0000260492 00000 n 
+0004459333 00000 n 
+0000260550 00000 n 
+0000260609 00000 n 
+0000260142 00000 n 
+0000260787 00000 n 
+0000260846 00000 n 
+0003330209 00000 n 
+0000265055 00000 n 
+0000265636 00000 n 
+0000264911 00000 n 
+0000261173 00000 n 
+0000265220 00000 n 
+0000265278 00000 n 
+0000265337 00000 n 
+0000265396 00000 n 
+0000265454 00000 n 
+0000265513 00000 n 
+0000265577 00000 n 
+0000269554 00000 n 
+0000269951 00000 n 
+0000270825 00000 n 
+0000269392 00000 n 
+0000265802 00000 n 
+0000270116 00000 n 
+0000270174 00000 n 
+0000270294 00000 n 
+0000270353 00000 n 
+0000270412 00000 n 
+0000270648 00000 n 
+0000269754 00000 n 
+0000270707 00000 n 
+0000270766 00000 n 
+0000274772 00000 n 
+0000274938 00000 n 
+0000275119 00000 n 
+0000275304 00000 n 
+0000275489 00000 n 
+0000275674 00000 n 
+0000280997 00000 n 
+0000281366 00000 n 
+0000276042 00000 n 
+0000277091 00000 n 
+0000274565 00000 n 
+0000270978 00000 n 
+0000276207 00000 n 
+0000276265 00000 n 
+0000276383 00000 n 
+0000276501 00000 n 
+0000276619 00000 n 
+0000276678 00000 n 
+0000276737 00000 n 
+0000276796 00000 n 
+0000276855 00000 n 
+0000275858 00000 n 
+0000277032 00000 n 
+0000281531 00000 n 
+0000281687 00000 n 
+0000281871 00000 n 
+0000282037 00000 n 
+0000282222 00000 n 
+0000282388 00000 n 
+0000282544 00000 n 
+0000282728 00000 n 
+0000282884 00000 n 
+0000283214 00000 n 
+0000283395 00000 n 
+0000284382 00000 n 
+0000280727 00000 n 
+0000277231 00000 n 
+0000283560 00000 n 
+0000283618 00000 n 
+0000281182 00000 n 
+0000283677 00000 n 
+0000283736 00000 n 
+0000283795 00000 n 
+0000283854 00000 n 
+0000283912 00000 n 
+0000283971 00000 n 
+0000284030 00000 n 
+0000284089 00000 n 
+0000284148 00000 n 
+0000283049 00000 n 
+0000284205 00000 n 
+0000284264 00000 n 
+0000284323 00000 n 
+0004460335 00000 n 
+0000288187 00000 n 
+0000288343 00000 n 
+0000288509 00000 n 
+0000288689 00000 n 
+0000288845 00000 n 
+0000289002 00000 n 
+0000289187 00000 n 
+0000289372 00000 n 
+0000289529 00000 n 
+0000290576 00000 n 
+0000287971 00000 n 
+0000284522 00000 n 
+0000289694 00000 n 
+0000289752 00000 n 
+0000289811 00000 n 
+0000289869 00000 n 
+0000289928 00000 n 
+0000289987 00000 n 
+0000290104 00000 n 
+0000290222 00000 n 
+0000290281 00000 n 
+0000290399 00000 n 
+0000290458 00000 n 
+0000290517 00000 n 
+0000294570 00000 n 
+0000294981 00000 n 
+0000296028 00000 n 
+0000294408 00000 n 
+0000290716 00000 n 
+0000295146 00000 n 
+0000295204 00000 n 
+0000295263 00000 n 
+0000295322 00000 n 
+0000295381 00000 n 
+0000294776 00000 n 
+0000295556 00000 n 
+0000295615 00000 n 
+0000295674 00000 n 
+0000295733 00000 n 
+0000295792 00000 n 
+0000295910 00000 n 
+0000295969 00000 n 
+0000300178 00000 n 
+0000300559 00000 n 
+0000300714 00000 n 
+0000301937 00000 n 
+0000300007 00000 n 
+0000296181 00000 n 
+0000300879 00000 n 
+0000300937 00000 n 
+0000300996 00000 n 
+0000301055 00000 n 
+0000301172 00000 n 
+0000301289 00000 n 
+0000301348 00000 n 
+0000301407 00000 n 
+0000301466 00000 n 
+0000301525 00000 n 
+0000301583 00000 n 
+0000301642 00000 n 
+0000300370 00000 n 
+0000301701 00000 n 
+0000301760 00000 n 
+0000301819 00000 n 
+0000301878 00000 n 
+0000305811 00000 n 
+0000305964 00000 n 
+0000306118 00000 n 
+0000306271 00000 n 
+0000307436 00000 n 
+0000305640 00000 n 
+0000302090 00000 n 
+0000306436 00000 n 
+0000306494 00000 n 
+0000306553 00000 n 
+0000306730 00000 n 
+0000306789 00000 n 
+0000306848 00000 n 
+0000306907 00000 n 
+0000306966 00000 n 
+0000307025 00000 n 
+0000307142 00000 n 
+0000307200 00000 n 
+0000307259 00000 n 
+0000307318 00000 n 
+0000307377 00000 n 
+0000311089 00000 n 
+0000311244 00000 n 
+0000311399 00000 n 
+0000311563 00000 n 
+0000312724 00000 n 
+0000310918 00000 n 
+0000307576 00000 n 
+0000311728 00000 n 
+0000311786 00000 n 
+0000311845 00000 n 
+0000311963 00000 n 
+0000312080 00000 n 
+0000312139 00000 n 
+0000312198 00000 n 
+0000312257 00000 n 
+0000312316 00000 n 
+0000312375 00000 n 
+0000312433 00000 n 
+0000312607 00000 n 
+0000316295 00000 n 
+0000316695 00000 n 
+0000316151 00000 n 
+0000312877 00000 n 
+0000316460 00000 n 
+0000316518 00000 n 
+0000316577 00000 n 
+0000316636 00000 n 
+0004460461 00000 n 
+0000320249 00000 n 
+0000320590 00000 n 
+0000320105 00000 n 
+0000316835 00000 n 
+0000320414 00000 n 
+0000320472 00000 n 
+0000320531 00000 n 
+0000323925 00000 n 
+0000324325 00000 n 
+0000323781 00000 n 
+0000320730 00000 n 
+0000324090 00000 n 
+0000324148 00000 n 
+0000324207 00000 n 
+0000324266 00000 n 
+0000328124 00000 n 
+0000328404 00000 n 
+0000327980 00000 n 
+0000324465 00000 n 
+0000328289 00000 n 
+0000328347 00000 n 
+0000331864 00000 n 
+0000332146 00000 n 
+0000331720 00000 n 
+0000328544 00000 n 
+0000332029 00000 n 
+0000332087 00000 n 
+0000335637 00000 n 
+0000336037 00000 n 
+0000335493 00000 n 
+0000332286 00000 n 
+0000335802 00000 n 
+0000335860 00000 n 
+0000335919 00000 n 
+0000335978 00000 n 
+0000339876 00000 n 
+0000340158 00000 n 
+0000339732 00000 n 
+0000336177 00000 n 
+0000340041 00000 n 
+0000340099 00000 n 
+0004460587 00000 n 
+0000343410 00000 n 
+0000343928 00000 n 
+0000343266 00000 n 
+0000340298 00000 n 
+0000343575 00000 n 
+0000343633 00000 n 
+0000343692 00000 n 
+0000343751 00000 n 
+0000343810 00000 n 
+0000343869 00000 n 
+0000346929 00000 n 
+0000351118 00000 n 
+0000347106 00000 n 
+0000347447 00000 n 
+0000346776 00000 n 
+0000344068 00000 n 
+0000347271 00000 n 
+0000347329 00000 n 
+0000347388 00000 n 
+0004457883 00000 n 
+0000351295 00000 n 
+0000351491 00000 n 
+0000351888 00000 n 
+0000350956 00000 n 
+0000347602 00000 n 
+0000351656 00000 n 
+0000351771 00000 n 
+0000355904 00000 n 
+0000356127 00000 n 
+0000355760 00000 n 
+0000352028 00000 n 
+0000356069 00000 n 
+0000359794 00000 n 
+0000360017 00000 n 
+0000359650 00000 n 
+0000356254 00000 n 
+0000359959 00000 n 
+0000363508 00000 n 
+0000363731 00000 n 
+0000363364 00000 n 
+0000360144 00000 n 
+0000363673 00000 n 
+0004460713 00000 n 
+0000367324 00000 n 
+0000367501 00000 n 
+0000367783 00000 n 
+0000367171 00000 n 
+0000363858 00000 n 
+0000367666 00000 n 
+0000367724 00000 n 
+0000369781 00000 n 
+0000369939 00000 n 
+0000370117 00000 n 
+0000370275 00000 n 
+0000370470 00000 n 
+0000370627 00000 n 
+0000370783 00000 n 
+0000370941 00000 n 
+0000373417 00000 n 
+0000371098 00000 n 
+0000371662 00000 n 
+0000369565 00000 n 
+0000367923 00000 n 
+0000371263 00000 n 
+0000569235 00000 n 
+0000659467 00000 n 
+0000663281 00000 n 
+0000373576 00000 n 
+0000373735 00000 n 
+0000373889 00000 n 
+0000374047 00000 n 
+0000374205 00000 n 
+0000374363 00000 n 
+0000374522 00000 n 
+0000374680 00000 n 
+0000374839 00000 n 
+0000374997 00000 n 
+0000375156 00000 n 
+0000375315 00000 n 
+0000375474 00000 n 
+0000375632 00000 n 
+0000375790 00000 n 
+0000375949 00000 n 
+0000376108 00000 n 
+0000376267 00000 n 
+0000376426 00000 n 
+0000376585 00000 n 
+0000376743 00000 n 
+0000376901 00000 n 
+0000377060 00000 n 
+0000377219 00000 n 
+0000377378 00000 n 
+0000377537 00000 n 
+0000377696 00000 n 
+0000377854 00000 n 
+0000380159 00000 n 
+0000378011 00000 n 
+0000378234 00000 n 
+0000373012 00000 n 
+0000371802 00000 n 
+0000378176 00000 n 
+0000380318 00000 n 
+0000380477 00000 n 
+0000380636 00000 n 
+0000380795 00000 n 
+0000380954 00000 n 
+0000381111 00000 n 
+0000381270 00000 n 
+0000381429 00000 n 
+0000381587 00000 n 
+0000381746 00000 n 
+0000381904 00000 n 
+0000382063 00000 n 
+0000382222 00000 n 
+0000382381 00000 n 
+0000382540 00000 n 
+0000382699 00000 n 
+0000382858 00000 n 
+0000383017 00000 n 
+0000383176 00000 n 
+0000383335 00000 n 
+0000383494 00000 n 
+0000383653 00000 n 
+0000383812 00000 n 
+0000386020 00000 n 
+0000383969 00000 n 
+0000384192 00000 n 
+0000379799 00000 n 
+0000378374 00000 n 
+0000384134 00000 n 
+0000386179 00000 n 
+0000386337 00000 n 
+0000386495 00000 n 
+0000386653 00000 n 
+0000386811 00000 n 
+0000386969 00000 n 
+0000387128 00000 n 
+0000387287 00000 n 
+0000387446 00000 n 
+0000387605 00000 n 
+0000387764 00000 n 
+0000387923 00000 n 
+0000388082 00000 n 
+0000388241 00000 n 
+0000388400 00000 n 
+0000388559 00000 n 
+0000388718 00000 n 
+0000388877 00000 n 
+0000389036 00000 n 
+0000389195 00000 n 
+0000389354 00000 n 
+0000389513 00000 n 
+0000389672 00000 n 
+0000389830 00000 n 
+0000389988 00000 n 
+0000390146 00000 n 
+0000390304 00000 n 
+0000390463 00000 n 
+0000392860 00000 n 
+0000390619 00000 n 
+0000390842 00000 n 
+0000385615 00000 n 
+0000384332 00000 n 
+0000390784 00000 n 
+0000393019 00000 n 
+0000393177 00000 n 
+0000393336 00000 n 
+0000393495 00000 n 
+0000393654 00000 n 
+0000393813 00000 n 
+0000393972 00000 n 
+0000394131 00000 n 
+0000394290 00000 n 
+0000394449 00000 n 
+0000394608 00000 n 
+0000394767 00000 n 
+0000394926 00000 n 
+0000395085 00000 n 
+0000395244 00000 n 
+0000395403 00000 n 
+0000395604 00000 n 
+0000395763 00000 n 
+0000395971 00000 n 
+0000396130 00000 n 
+0000396348 00000 n 
+0000396506 00000 n 
+0000396692 00000 n 
+0000396851 00000 n 
+0000397046 00000 n 
+0000399619 00000 n 
+0000399812 00000 n 
+0000397202 00000 n 
+0000397541 00000 n 
+0000392482 00000 n 
+0000390982 00000 n 
+0000397367 00000 n 
+0004460839 00000 n 
+0000665419 00000 n 
+0000665593 00000 n 
+0000665828 00000 n 
+0000399970 00000 n 
+0000400172 00000 n 
+0000400330 00000 n 
+0000400511 00000 n 
+0000400669 00000 n 
+0000400859 00000 n 
+0000401015 00000 n 
+0000401437 00000 n 
+0000401596 00000 n 
+0000401788 00000 n 
+0000401947 00000 n 
+0000402147 00000 n 
+0000402306 00000 n 
+0000402498 00000 n 
+0000402657 00000 n 
+0000402855 00000 n 
+0000403014 00000 n 
+0000403223 00000 n 
+0000403382 00000 n 
+0000403587 00000 n 
+0000403746 00000 n 
+0000403953 00000 n 
+0000404134 00000 n 
+0000404293 00000 n 
+0000404491 00000 n 
+0000404650 00000 n 
+0000404855 00000 n 
+0000405014 00000 n 
+0000405218 00000 n 
+0000405377 00000 n 
+0000405565 00000 n 
+0000405724 00000 n 
+0000405920 00000 n 
+0000406079 00000 n 
+0000406277 00000 n 
+0000409000 00000 n 
+0000409209 00000 n 
+0000406434 00000 n 
+0000406657 00000 n 
+0000399133 00000 n 
+0000397694 00000 n 
+0000406599 00000 n 
+0000401226 00000 n 
+0000887042 00000 n 
+0000887218 00000 n 
+0001126956 00000 n 
+0001132800 00000 n 
+0001133035 00000 n 
+0001169473 00000 n 
+0001169767 00000 n 
+0001174139 00000 n 
+0001174433 00000 n 
+0001185115 00000 n 
+0001216788 00000 n 
+0001217376 00000 n 
+0001233787 00000 n 
+0001298579 00000 n 
+0001338013 00000 n 
+0000409368 00000 n 
+0000409588 00000 n 
+0000409747 00000 n 
+0000409952 00000 n 
+0000410111 00000 n 
+0000410332 00000 n 
+0000410491 00000 n 
+0000410706 00000 n 
+0000410865 00000 n 
+0000411080 00000 n 
+0000411239 00000 n 
+0000411476 00000 n 
+0000411635 00000 n 
+0000412065 00000 n 
+0000412224 00000 n 
+0000412412 00000 n 
+0000412571 00000 n 
+0000412767 00000 n 
+0000412926 00000 n 
+0000413138 00000 n 
+0000413297 00000 n 
+0000413496 00000 n 
+0000413655 00000 n 
+0000413842 00000 n 
+0000413996 00000 n 
+0000414154 00000 n 
+0000414587 00000 n 
+0000414746 00000 n 
+0000415175 00000 n 
+0000415332 00000 n 
+0000415525 00000 n 
+0000415684 00000 n 
+0000415900 00000 n 
+0000416059 00000 n 
+0000416258 00000 n 
+0000418851 00000 n 
+0000419062 00000 n 
+0000416415 00000 n 
+0000416638 00000 n 
+0000408496 00000 n 
+0000406797 00000 n 
+0000416580 00000 n 
+0000411850 00000 n 
+0004458786 00000 n 
+0000414371 00000 n 
+0000414960 00000 n 
+0001351117 00000 n 
+0001358551 00000 n 
+0001367183 00000 n 
+0001387367 00000 n 
+0001394562 00000 n 
+0001412053 00000 n 
+0001418672 00000 n 
+0001451223 00000 n 
+0001537196 00000 n 
+0001569544 00000 n 
+0001574809 00000 n 
+0001584002 00000 n 
+0001639279 00000 n 
+0001639514 00000 n 
+0001649541 00000 n 
+0000419221 00000 n 
+0000419424 00000 n 
+0000419583 00000 n 
+0000419794 00000 n 
+0000419953 00000 n 
+0000420157 00000 n 
+0000420317 00000 n 
+0000420504 00000 n 
+0000420663 00000 n 
+0000420849 00000 n 
+0000421008 00000 n 
+0000421202 00000 n 
+0000421361 00000 n 
+0000421572 00000 n 
+0000421731 00000 n 
+0000421920 00000 n 
+0000422079 00000 n 
+0000422257 00000 n 
+0000422416 00000 n 
+0000422610 00000 n 
+0000422792 00000 n 
+0000422951 00000 n 
+0000423143 00000 n 
+0000423302 00000 n 
+0000423502 00000 n 
+0000423661 00000 n 
+0000423854 00000 n 
+0000424013 00000 n 
+0000424226 00000 n 
+0000424385 00000 n 
+0000424825 00000 n 
+0000425039 00000 n 
+0000425198 00000 n 
+0000425423 00000 n 
+0000425637 00000 n 
+0000425796 00000 n 
+0000425989 00000 n 
+0000428702 00000 n 
+0000428905 00000 n 
+0000426146 00000 n 
+0000426369 00000 n 
+0000418347 00000 n 
+0000416793 00000 n 
+0000426311 00000 n 
+0000424604 00000 n 
+0001668644 00000 n 
+0001674212 00000 n 
+0001674387 00000 n 
+0001708909 00000 n 
+0001720831 00000 n 
+0001857640 00000 n 
+0001877270 00000 n 
+0001885368 00000 n 
+0002105780 00000 n 
+0002112157 00000 n 
+0002210625 00000 n 
+0002255762 00000 n 
+0002256115 00000 n 
+0002271656 00000 n 
+0002272018 00000 n 
+0000429064 00000 n 
+0000429250 00000 n 
+0000429409 00000 n 
+0000429607 00000 n 
+0000429766 00000 n 
+0000429962 00000 n 
+0000430121 00000 n 
+0000430311 00000 n 
+0000430470 00000 n 
+0000430660 00000 n 
+0000430819 00000 n 
+0000431261 00000 n 
+0000431420 00000 n 
+0000431613 00000 n 
+0000431772 00000 n 
+0000431988 00000 n 
+0000432147 00000 n 
+0000432338 00000 n 
+0000432497 00000 n 
+0000432691 00000 n 
+0000432850 00000 n 
+0000433279 00000 n 
+0000433438 00000 n 
+0000433643 00000 n 
+0000433802 00000 n 
+0000434026 00000 n 
+0000434185 00000 n 
+0000434406 00000 n 
+0000434565 00000 n 
+0000434762 00000 n 
+0000434921 00000 n 
+0000435111 00000 n 
+0000435270 00000 n 
+0000435465 00000 n 
+0000438187 00000 n 
+0000438380 00000 n 
+0000435622 00000 n 
+0000435845 00000 n 
+0000428216 00000 n 
+0000426509 00000 n 
+0000435787 00000 n 
+0000431040 00000 n 
+0000433064 00000 n 
+0002276390 00000 n 
+0002291252 00000 n 
+0002313974 00000 n 
+0002455662 00000 n 
+0002573022 00000 n 
+0002573202 00000 n 
+0002956154 00000 n 
+0002967483 00000 n 
+0002977073 00000 n 
+0002999917 00000 n 
+0003063442 00000 n 
+0000438539 00000 n 
+0000438735 00000 n 
+0000438894 00000 n 
+0000439087 00000 n 
+0000439246 00000 n 
+0000439439 00000 n 
+0000439598 00000 n 
+0000439785 00000 n 
+0000439944 00000 n 
+0000440129 00000 n 
+0000440288 00000 n 
+0000440480 00000 n 
+0000440639 00000 n 
+0000440816 00000 n 
+0000440974 00000 n 
+0000441180 00000 n 
+0000441338 00000 n 
+0000441532 00000 n 
+0000441687 00000 n 
+0000442107 00000 n 
+0000442266 00000 n 
+0000442461 00000 n 
+0000442620 00000 n 
+0000442806 00000 n 
+0000442965 00000 n 
+0000443176 00000 n 
+0000443335 00000 n 
+0000443526 00000 n 
+0000443685 00000 n 
+0000443884 00000 n 
+0000444043 00000 n 
+0000444227 00000 n 
+0000444386 00000 n 
+0000444812 00000 n 
+0000444995 00000 n 
+0000447338 00000 n 
+0000447529 00000 n 
+0000445152 00000 n 
+0000445375 00000 n 
+0000437692 00000 n 
+0000435985 00000 n 
+0000445317 00000 n 
+0000441897 00000 n 
+0000444599 00000 n 
+0003090547 00000 n 
+0003294286 00000 n 
+0003312230 00000 n 
+0003543773 00000 n 
+0003587902 00000 n 
+0003588082 00000 n 
+0003592431 00000 n 
+0003597027 00000 n 
+0003620958 00000 n 
+0003621260 00000 n 
+0003627639 00000 n 
+0003631492 00000 n 
+0003631672 00000 n 
+0003632096 00000 n 
+0000447688 00000 n 
+0000447874 00000 n 
+0000448033 00000 n 
+0000448228 00000 n 
+0000448384 00000 n 
+0000448570 00000 n 
+0000448768 00000 n 
+0000448955 00000 n 
+0000449147 00000 n 
+0000449336 00000 n 
+0000449529 00000 n 
+0000449714 00000 n 
+0000449908 00000 n 
+0000450095 00000 n 
+0000450282 00000 n 
+0000450475 00000 n 
+0000450663 00000 n 
+0000453123 00000 n 
+0000450842 00000 n 
+0000451355 00000 n 
+0000447023 00000 n 
+0000445515 00000 n 
+0000451007 00000 n 
+0000451123 00000 n 
+0000451238 00000 n 
+0000451296 00000 n 
+0004460965 00000 n 
+0003673764 00000 n 
+0003684650 00000 n 
+0000453319 00000 n 
+0000453532 00000 n 
+0000453727 00000 n 
+0000453942 00000 n 
+0000454139 00000 n 
+0000454334 00000 n 
+0000454546 00000 n 
+0000454743 00000 n 
+0000454930 00000 n 
+0000455120 00000 n 
+0000455321 00000 n 
+0000455503 00000 n 
+0000455690 00000 n 
+0000455881 00000 n 
+0000456074 00000 n 
+0000456264 00000 n 
+0000456461 00000 n 
+0000456654 00000 n 
+0000456849 00000 n 
+0000457031 00000 n 
+0000457224 00000 n 
+0000457418 00000 n 
+0000457618 00000 n 
+0000460340 00000 n 
+0000460546 00000 n 
+0000457816 00000 n 
+0000458039 00000 n 
+0000452763 00000 n 
+0000451521 00000 n 
+0000457981 00000 n 
+0000460737 00000 n 
+0000460941 00000 n 
+0000461130 00000 n 
+0000461284 00000 n 
+0000461470 00000 n 
+0000461666 00000 n 
+0000462086 00000 n 
+0000462514 00000 n 
+0000462942 00000 n 
+0000463128 00000 n 
+0000463547 00000 n 
+0000463979 00000 n 
+0000464420 00000 n 
+0000464847 00000 n 
+0000465275 00000 n 
+0000465464 00000 n 
+0000465679 00000 n 
+0000465888 00000 n 
+0000466108 00000 n 
+0000466316 00000 n 
+0000468913 00000 n 
+0000469119 00000 n 
+0000466520 00000 n 
+0000466743 00000 n 
+0000459926 00000 n 
+0000458192 00000 n 
+0000466685 00000 n 
+0000461877 00000 n 
+0000462300 00000 n 
+0000462728 00000 n 
+0000463338 00000 n 
+0000463763 00000 n 
+0000464200 00000 n 
+0000464633 00000 n 
+0000465061 00000 n 
+0000469300 00000 n 
+0000469505 00000 n 
+0000469710 00000 n 
+0000469914 00000 n 
+0000470119 00000 n 
+0000470323 00000 n 
+0000470528 00000 n 
+0000470733 00000 n 
+0000470938 00000 n 
+0000471143 00000 n 
+0000471381 00000 n 
+0000471620 00000 n 
+0000472097 00000 n 
+0000472336 00000 n 
+0000472573 00000 n 
+0000472811 00000 n 
+0000473288 00000 n 
+0000473527 00000 n 
+0000473765 00000 n 
+0000474004 00000 n 
+0000474481 00000 n 
+0000474720 00000 n 
+0000474957 00000 n 
+0000475434 00000 n 
+0000475669 00000 n 
+0000476146 00000 n 
+0000476384 00000 n 
+0000476623 00000 n 
+0000477100 00000 n 
+0000477339 00000 n 
+0000477576 00000 n 
+0000477814 00000 n 
+0000478290 00000 n 
+0000478529 00000 n 
+0000478766 00000 n 
+0000479242 00000 n 
+0000479480 00000 n 
+0000483003 00000 n 
+0000483208 00000 n 
+0000483446 00000 n 
+0000483685 00000 n 
+0000484162 00000 n 
+0000484401 00000 n 
+0000479954 00000 n 
+0000480413 00000 n 
+0000468337 00000 n 
+0000466896 00000 n 
+0000480119 00000 n 
+0000480177 00000 n 
+0000480236 00000 n 
+0000480295 00000 n 
+0000480354 00000 n 
+0000471859 00000 n 
+0000473050 00000 n 
+0000474243 00000 n 
+0000475196 00000 n 
+0000475908 00000 n 
+0000476862 00000 n 
+0000478052 00000 n 
+0000479004 00000 n 
+0000479719 00000 n 
+0000511339 00000 n 
+0000511457 00000 n 
+0000511575 00000 n 
+0000511693 00000 n 
+0000511870 00000 n 
+0000511988 00000 n 
+0000515275 00000 n 
+0000515452 00000 n 
+0000515570 00000 n 
+0000515634 00000 n 
+0000515698 00000 n 
+0000515762 00000 n 
+0000515826 00000 n 
+0000515890 00000 n 
+0000515954 00000 n 
+0000516018 00000 n 
+0000516082 00000 n 
+0000516146 00000 n 
+0000516210 00000 n 
+0000516274 00000 n 
+0000516338 00000 n 
+0000516402 00000 n 
+0000516466 00000 n 
+0000516530 00000 n 
+0000516594 00000 n 
+0000516658 00000 n 
+0000516722 00000 n 
+0000516785 00000 n 
+0000519055 00000 n 
+0000519118 00000 n 
+0000519182 00000 n 
+0000519246 00000 n 
+0000519310 00000 n 
+0000519374 00000 n 
+0000519437 00000 n 
+0000519501 00000 n 
+0000484639 00000 n 
+0000484843 00000 n 
+0000485082 00000 n 
+0000485559 00000 n 
+0000485762 00000 n 
+0000486000 00000 n 
+0000486239 00000 n 
+0000486715 00000 n 
+0000486953 00000 n 
+0000487191 00000 n 
+0000487430 00000 n 
+0000487635 00000 n 
+0000488111 00000 n 
+0000488349 00000 n 
+0000488824 00000 n 
+0000489029 00000 n 
+0000489505 00000 n 
+0000489744 00000 n 
+0000489947 00000 n 
+0000490185 00000 n 
+0000490424 00000 n 
+0000490897 00000 n 
+0000491132 00000 n 
+0000491370 00000 n 
+0000491572 00000 n 
+0000492048 00000 n 
+0000492286 00000 n 
+0000492491 00000 n 
+0000492968 00000 n 
+0000493207 00000 n 
+0000493684 00000 n 
+0000493887 00000 n 
+0000494125 00000 n 
+0000494601 00000 n 
+0000494806 00000 n 
+0000495044 00000 n 
+0000495283 00000 n 
+0000495759 00000 n 
+0000495998 00000 n 
+0000496236 00000 n 
+0000496711 00000 n 
+0000496950 00000 n 
+0000497155 00000 n 
+0000497631 00000 n 
+0000497869 00000 n 
+0000498074 00000 n 
+0000498549 00000 n 
+0000498786 00000 n 
+0000499261 00000 n 
+0000501654 00000 n 
+0000499465 00000 n 
+0000499747 00000 n 
+0000482220 00000 n 
+0000480566 00000 n 
+0000499630 00000 n 
+0000483924 00000 n 
+0000485321 00000 n 
+0000486478 00000 n 
+0000487874 00000 n 
+0000488586 00000 n 
+0000489267 00000 n 
+0000490663 00000 n 
+0000491810 00000 n 
+0000492730 00000 n 
+0000493446 00000 n 
+0000494364 00000 n 
+0000495521 00000 n 
+0000496474 00000 n 
+0000497393 00000 n 
+0000498313 00000 n 
+0000499023 00000 n 
+0000499688 00000 n 
+0000519565 00000 n 
+0000519683 00000 n 
+0000519747 00000 n 
+0000519810 00000 n 
+0000519874 00000 n 
+0000519938 00000 n 
+0000520002 00000 n 
+0000520120 00000 n 
+0000520183 00000 n 
+0000520247 00000 n 
+0000520364 00000 n 
+0000520428 00000 n 
+0000520492 00000 n 
+0000520554 00000 n 
+0000520618 00000 n 
+0000520682 00000 n 
+0000520745 00000 n 
+0000523437 00000 n 
+0000523501 00000 n 
+0000523565 00000 n 
+0000523629 00000 n 
+0000523747 00000 n 
+0000523811 00000 n 
+0000523875 00000 n 
+0000523992 00000 n 
+0000524056 00000 n 
+0000524120 00000 n 
+0000524184 00000 n 
+0000524248 00000 n 
+0000524312 00000 n 
+0000524430 00000 n 
+0000524493 00000 n 
+0000524557 00000 n 
+0000524675 00000 n 
+0000528134 00000 n 
+0000528197 00000 n 
+0000528261 00000 n 
+0000528379 00000 n 
+0000528443 00000 n 
+0000528507 00000 n 
+0000528625 00000 n 
+0000528689 00000 n 
+0000528753 00000 n 
+0000528817 00000 n 
+0000528881 00000 n 
+0000528944 00000 n 
+0000529008 00000 n 
+0000529072 00000 n 
+0000529190 00000 n 
+0000529254 00000 n 
+0000529317 00000 n 
+0000532748 00000 n 
+0000532812 00000 n 
+0000532874 00000 n 
+0000569059 00000 n 
+0000501859 00000 n 
+0000502064 00000 n 
+0000502269 00000 n 
+0000502473 00000 n 
+0000502678 00000 n 
+0000502883 00000 n 
+0000503087 00000 n 
+0000503292 00000 n 
+0000503497 00000 n 
+0000503702 00000 n 
+0000503907 00000 n 
+0000504112 00000 n 
+0000504316 00000 n 
+0000504521 00000 n 
+0000504726 00000 n 
+0000504931 00000 n 
+0000505135 00000 n 
+0000505340 00000 n 
+0000505545 00000 n 
+0000505750 00000 n 
+0000505954 00000 n 
+0000506157 00000 n 
+0000506362 00000 n 
+0000506567 00000 n 
+0000506770 00000 n 
+0000506975 00000 n 
+0000509768 00000 n 
+0000509973 00000 n 
+0000507179 00000 n 
+0000507579 00000 n 
+0000501267 00000 n 
+0000499913 00000 n 
+0000507344 00000 n 
+0000507402 00000 n 
+0000507461 00000 n 
+0000507520 00000 n 
+0004454760 00000 n 
+0000532997 00000 n 
+0000533115 00000 n 
+0000533233 00000 n 
+0000533351 00000 n 
+0000533469 00000 n 
+0000533592 00000 n 
+0000533715 00000 n 
+0000533833 00000 n 
+0000533951 00000 n 
+0000534069 00000 n 
+0000534192 00000 n 
+0000534310 00000 n 
+0000534428 00000 n 
+0000534546 00000 n 
+0000534664 00000 n 
+0000534782 00000 n 
+0000534900 00000 n 
+0000535018 00000 n 
+0000535134 00000 n 
+0000539011 00000 n 
+0000539247 00000 n 
+0000543672 00000 n 
+0000543908 00000 n 
+0000548237 00000 n 
+0000552822 00000 n 
+0000553115 00000 n 
+0000557849 00000 n 
+0000510178 00000 n 
+0000510383 00000 n 
+0000510588 00000 n 
+0000510793 00000 n 
+0000510998 00000 n 
+0000512046 00000 n 
+0000509570 00000 n 
+0000507746 00000 n 
+0000511163 00000 n 
+0000511221 00000 n 
+0000511280 00000 n 
+0000511398 00000 n 
+0000511516 00000 n 
+0000511634 00000 n 
+0000511752 00000 n 
+0000511811 00000 n 
+0000511929 00000 n 
+0004461091 00000 n 
+0000563292 00000 n 
+0000563415 00000 n 
+0000563536 00000 n 
+0000563659 00000 n 
+0000568759 00000 n 
+0000568882 00000 n 
+0000514611 00000 n 
+0000514800 00000 n 
+0000514993 00000 n 
+0000516848 00000 n 
+0000514449 00000 n 
+0000512200 00000 n 
+0000515158 00000 n 
+0000515216 00000 n 
+0000515334 00000 n 
+0000515393 00000 n 
+0000515511 00000 n 
+0000518832 00000 n 
+0000520803 00000 n 
+0000518688 00000 n 
+0000517003 00000 n 
+0000518997 00000 n 
+0000519624 00000 n 
+0000520061 00000 n 
+0000520305 00000 n 
+0000522615 00000 n 
+0000522795 00000 n 
+0000522975 00000 n 
+0000523155 00000 n 
+0000524738 00000 n 
+0000522444 00000 n 
+0000520983 00000 n 
+0000523320 00000 n 
+0000523378 00000 n 
+0000523688 00000 n 
+0000523933 00000 n 
+0000524371 00000 n 
+0000524616 00000 n 
+0000527558 00000 n 
+0000527721 00000 n 
+0000532276 00000 n 
+0000527911 00000 n 
+0000529375 00000 n 
+0000527396 00000 n 
+0000524931 00000 n 
+0000528076 00000 n 
+0000528320 00000 n 
+0000528566 00000 n 
+0000529131 00000 n 
+0000532466 00000 n 
+0000535250 00000 n 
+0000532123 00000 n 
+0000529530 00000 n 
+0000532631 00000 n 
+0000532689 00000 n 
+0000532938 00000 n 
+0000533056 00000 n 
+0004458245 00000 n 
+0000533174 00000 n 
+0000533292 00000 n 
+0000533410 00000 n 
+0000533533 00000 n 
+0000533656 00000 n 
+0000533774 00000 n 
+0000533892 00000 n 
+0000534010 00000 n 
+0000534133 00000 n 
+0000534251 00000 n 
+0000534369 00000 n 
+0000534487 00000 n 
+0000534605 00000 n 
+0000534723 00000 n 
+0000534841 00000 n 
+0000534959 00000 n 
+0000535076 00000 n 
+0000535192 00000 n 
+0000538476 00000 n 
+0000538632 00000 n 
+0000538788 00000 n 
+0000539483 00000 n 
+0000538314 00000 n 
+0000535433 00000 n 
+0000538953 00000 n 
+0000539070 00000 n 
+0000539129 00000 n 
+0000539188 00000 n 
+0000539306 00000 n 
+0000539365 00000 n 
+0000539424 00000 n 
+0004461217 00000 n 
+0000543140 00000 n 
+0000543295 00000 n 
+0000543449 00000 n 
+0000544085 00000 n 
+0000542978 00000 n 
+0000539727 00000 n 
+0000543614 00000 n 
+0000543731 00000 n 
+0000543790 00000 n 
+0000543849 00000 n 
+0000543967 00000 n 
+0000544026 00000 n 
+0000547740 00000 n 
+0000547896 00000 n 
+0000548473 00000 n 
+0000547587 00000 n 
+0000544341 00000 n 
+0000548061 00000 n 
+0000548119 00000 n 
+0000548178 00000 n 
+0000548296 00000 n 
+0000548355 00000 n 
+0000548414 00000 n 
+0000552443 00000 n 
+0000557196 00000 n 
+0000552599 00000 n 
+0000553231 00000 n 
+0000552290 00000 n 
+0000548729 00000 n 
+0000552764 00000 n 
+0000552881 00000 n 
+0000552940 00000 n 
+0000552999 00000 n 
+0000553058 00000 n 
+0000553173 00000 n 
+0000557352 00000 n 
+0000557508 00000 n 
+0000558031 00000 n 
+0000557034 00000 n 
+0000553487 00000 n 
+0000557673 00000 n 
+0000557731 00000 n 
+0000557790 00000 n 
+0000557913 00000 n 
+0000557972 00000 n 
+0000561872 00000 n 
+0000562077 00000 n 
+0000562233 00000 n 
+0000562438 00000 n 
+0000562592 00000 n 
+0000562796 00000 n 
+0000567074 00000 n 
+0000567279 00000 n 
+0000562951 00000 n 
+0000563775 00000 n 
+0000561674 00000 n 
+0000558287 00000 n 
+0000563116 00000 n 
+0000563174 00000 n 
+0000563233 00000 n 
+0000563356 00000 n 
+0000563478 00000 n 
+0000563600 00000 n 
+0000563717 00000 n 
+0000567435 00000 n 
+0000567640 00000 n 
+0000567796 00000 n 
+0000568001 00000 n 
+0000568157 00000 n 
+0000568351 00000 n 
+0000568536 00000 n 
+0000569466 00000 n 
+0000566858 00000 n 
+0000564031 00000 n 
+0000568701 00000 n 
+0000568823 00000 n 
+0000568941 00000 n 
+0000569000 00000 n 
+0000569118 00000 n 
+0000569350 00000 n 
+0000569408 00000 n 
+0004461343 00000 n 
+0000571383 00000 n 
+0000571569 00000 n 
+0000571755 00000 n 
+0000571948 00000 n 
+0000572138 00000 n 
+0000572331 00000 n 
+0000572517 00000 n 
+0000572708 00000 n 
+0000572904 00000 n 
+0000573092 00000 n 
+0000573279 00000 n 
+0000573472 00000 n 
+0000573658 00000 n 
+0000573838 00000 n 
+0000574034 00000 n 
+0000574246 00000 n 
+0000574441 00000 n 
+0000574638 00000 n 
+0000574833 00000 n 
+0000575044 00000 n 
+0000575241 00000 n 
+0000575428 00000 n 
+0000575618 00000 n 
+0000577793 00000 n 
+0000577994 00000 n 
+0000575821 00000 n 
+0000576044 00000 n 
+0000571032 00000 n 
+0000569660 00000 n 
+0000575986 00000 n 
+0000578176 00000 n 
+0000578362 00000 n 
+0000578553 00000 n 
+0000578746 00000 n 
+0000578950 00000 n 
+0000579156 00000 n 
+0000579357 00000 n 
+0000579558 00000 n 
+0000579758 00000 n 
+0000579961 00000 n 
+0000580172 00000 n 
+0000580381 00000 n 
+0000580571 00000 n 
+0000580764 00000 n 
+0000580961 00000 n 
+0000581158 00000 n 
+0000581355 00000 n 
+0000581549 00000 n 
+0000581744 00000 n 
+0000581926 00000 n 
+0000582118 00000 n 
+0000582311 00000 n 
+0000584577 00000 n 
+0000584777 00000 n 
+0000582510 00000 n 
+0000582733 00000 n 
+0000577433 00000 n 
+0000576184 00000 n 
+0000582675 00000 n 
+0000584983 00000 n 
+0000585174 00000 n 
+0000585379 00000 n 
+0000585572 00000 n 
+0000585761 00000 n 
+0000585916 00000 n 
+0000586102 00000 n 
+0000586298 00000 n 
+0000586508 00000 n 
+0000586722 00000 n 
+0000586937 00000 n 
+0000587123 00000 n 
+0000587333 00000 n 
+0000587550 00000 n 
+0000587771 00000 n 
+0000587986 00000 n 
+0000588201 00000 n 
+0000588386 00000 n 
+0000588582 00000 n 
+0000588779 00000 n 
+0000588973 00000 n 
+0000589166 00000 n 
+0000589358 00000 n 
+0000592309 00000 n 
+0000592512 00000 n 
+0000589552 00000 n 
+0000589775 00000 n 
+0000584208 00000 n 
+0000582873 00000 n 
+0000589717 00000 n 
+0000592713 00000 n 
+0000592903 00000 n 
+0000593108 00000 n 
+0000593313 00000 n 
+0000593524 00000 n 
+0000593734 00000 n 
+0000593945 00000 n 
+0000594149 00000 n 
+0000594361 00000 n 
+0000594606 00000 n 
+0000594851 00000 n 
+0000595096 00000 n 
+0000595341 00000 n 
+0000595553 00000 n 
+0000595797 00000 n 
+0000596042 00000 n 
+0000596287 00000 n 
+0000596531 00000 n 
+0000596775 00000 n 
+0000597020 00000 n 
+0000597265 00000 n 
+0000597510 00000 n 
+0000597715 00000 n 
+0000597952 00000 n 
+0000598191 00000 n 
+0000598430 00000 n 
+0000598669 00000 n 
+0000598907 00000 n 
+0000599146 00000 n 
+0000599385 00000 n 
+0000599624 00000 n 
+0000599862 00000 n 
+0000600100 00000 n 
+0000600339 00000 n 
+0000600578 00000 n 
+0000600816 00000 n 
+0000601055 00000 n 
+0000601294 00000 n 
+0000601533 00000 n 
+0000601771 00000 n 
+0000602010 00000 n 
+0000602249 00000 n 
+0000602488 00000 n 
+0000602726 00000 n 
+0000602964 00000 n 
+0000603203 00000 n 
+0000603442 00000 n 
+0000603680 00000 n 
+0000603919 00000 n 
+0000604157 00000 n 
+0000604634 00000 n 
+0000604839 00000 n 
+0000605077 00000 n 
+0000605316 00000 n 
+0000605555 00000 n 
+0000605793 00000 n 
+0000606030 00000 n 
+0000606235 00000 n 
+0000606474 00000 n 
+0000606712 00000 n 
+0000606916 00000 n 
+0000607152 00000 n 
+0000607389 00000 n 
+0000607626 00000 n 
+0000607863 00000 n 
+0000608099 00000 n 
+0000611149 00000 n 
+0000611354 00000 n 
+0000611593 00000 n 
+0000611832 00000 n 
+0000608336 00000 n 
+0000608677 00000 n 
+0000591544 00000 n 
+0000589915 00000 n 
+0000608501 00000 n 
+0000608559 00000 n 
+0000608618 00000 n 
+0000604396 00000 n 
+0000653058 00000 n 
+0000653176 00000 n 
+0000653299 00000 n 
+0000653480 00000 n 
+0000653598 00000 n 
+0000653662 00000 n 
+0000653726 00000 n 
+0000653790 00000 n 
+0000653854 00000 n 
+0000653971 00000 n 
+0000654035 00000 n 
+0000654099 00000 n 
+0000654163 00000 n 
+0000654227 00000 n 
+0000654291 00000 n 
+0000654354 00000 n 
+0000654418 00000 n 
+0000612309 00000 n 
+0000612514 00000 n 
+0000612753 00000 n 
+0000612992 00000 n 
+0000613197 00000 n 
+0000613435 00000 n 
+0000613674 00000 n 
+0000613913 00000 n 
+0000614152 00000 n 
+0000614390 00000 n 
+0000614595 00000 n 
+0000614834 00000 n 
+0000615073 00000 n 
+0000615277 00000 n 
+0000615516 00000 n 
+0000615755 00000 n 
+0000616232 00000 n 
+0000616437 00000 n 
+0000616676 00000 n 
+0000616915 00000 n 
+0000617119 00000 n 
+0000617357 00000 n 
+0000617596 00000 n 
+0000617835 00000 n 
+0000618074 00000 n 
+0000618312 00000 n 
+0000618551 00000 n 
+0000618790 00000 n 
+0000618994 00000 n 
+0000619233 00000 n 
+0000619472 00000 n 
+0000619677 00000 n 
+0000619916 00000 n 
+0000620392 00000 n 
+0000620631 00000 n 
+0000620835 00000 n 
+0000621047 00000 n 
+0000621259 00000 n 
+0000621469 00000 n 
+0000621681 00000 n 
+0000621892 00000 n 
+0000622104 00000 n 
+0000622316 00000 n 
+0000622528 00000 n 
+0000622740 00000 n 
+0000622944 00000 n 
+0000623156 00000 n 
+0000626522 00000 n 
+0000626733 00000 n 
+0000623365 00000 n 
+0000624117 00000 n 
+0000610519 00000 n 
+0000608830 00000 n 
+0000623530 00000 n 
+0000612071 00000 n 
+0000615994 00000 n 
+0000620155 00000 n 
+0000623588 00000 n 
+0000623647 00000 n 
+0000623706 00000 n 
+0000623765 00000 n 
+0000623824 00000 n 
+0000623883 00000 n 
+0000623942 00000 n 
+0000624001 00000 n 
+0000624059 00000 n 
+0000659044 00000 n 
+0000659226 00000 n 
+0000659344 00000 n 
+0000626944 00000 n 
+0000627154 00000 n 
+0000627366 00000 n 
+0000627578 00000 n 
+0000627783 00000 n 
+0000627988 00000 n 
+0000628192 00000 n 
+0000628397 00000 n 
+0000628602 00000 n 
+0000628807 00000 n 
+0000629011 00000 n 
+0000629216 00000 n 
+0000629421 00000 n 
+0000629626 00000 n 
+0000629831 00000 n 
+0000630036 00000 n 
+0000630248 00000 n 
+0000630453 00000 n 
+0000630658 00000 n 
+0000630870 00000 n 
+0000631075 00000 n 
+0000631280 00000 n 
+0000631483 00000 n 
+0000631686 00000 n 
+0000631889 00000 n 
+0000632099 00000 n 
+0000632311 00000 n 
+0000632521 00000 n 
+0000632733 00000 n 
+0000632945 00000 n 
+0000633155 00000 n 
+0000633364 00000 n 
+0000633576 00000 n 
+0000633779 00000 n 
+0000633982 00000 n 
+0000634184 00000 n 
+0000634386 00000 n 
+0000634591 00000 n 
+0000634796 00000 n 
+0000635000 00000 n 
+0000635205 00000 n 
+0000635410 00000 n 
+0000635615 00000 n 
+0000635820 00000 n 
+0000636025 00000 n 
+0000636230 00000 n 
+0000636434 00000 n 
+0000636639 00000 n 
+0000636844 00000 n 
+0000637049 00000 n 
+0000637253 00000 n 
+0000637457 00000 n 
+0000637662 00000 n 
+0000637866 00000 n 
+0000638070 00000 n 
+0000638273 00000 n 
+0000638476 00000 n 
+0000638677 00000 n 
+0000641750 00000 n 
+0000641955 00000 n 
+0000642160 00000 n 
+0000642365 00000 n 
+0000642570 00000 n 
+0000642775 00000 n 
+0000642980 00000 n 
+0000638880 00000 n 
+0000639749 00000 n 
+0000625838 00000 n 
+0000624270 00000 n 
+0000639045 00000 n 
+0000639103 00000 n 
+0000639162 00000 n 
+0000639221 00000 n 
+0000639279 00000 n 
+0000639337 00000 n 
+0000639396 00000 n 
+0000639455 00000 n 
+0000639514 00000 n 
+0000639573 00000 n 
+0000639632 00000 n 
+0000639691 00000 n 
+0004461469 00000 n 
+0000654539 00000 n 
+0000658928 00000 n 
+0000643185 00000 n 
+0000643390 00000 n 
+0000643595 00000 n 
+0000643781 00000 n 
+0000643985 00000 n 
+0000644172 00000 n 
+0000644375 00000 n 
+0000644565 00000 n 
+0000644770 00000 n 
+0000644961 00000 n 
+0000645166 00000 n 
+0000645355 00000 n 
+0000645546 00000 n 
+0000645751 00000 n 
+0000645941 00000 n 
+0000646131 00000 n 
+0000646334 00000 n 
+0000646538 00000 n 
+0000646741 00000 n 
+0000646926 00000 n 
+0000647130 00000 n 
+0000647317 00000 n 
+0000647519 00000 n 
+0000647710 00000 n 
+0000647910 00000 n 
+0000648295 00000 n 
+0000648482 00000 n 
+0000651215 00000 n 
+0000651408 00000 n 
+0000651600 00000 n 
+0000651792 00000 n 
+0000651987 00000 n 
+0000652190 00000 n 
+0000652391 00000 n 
+0000652584 00000 n 
+0000648687 00000 n 
+0000649028 00000 n 
+0000641291 00000 n 
+0000639917 00000 n 
+0000648852 00000 n 
+0000648102 00000 n 
+0000648910 00000 n 
+0000648969 00000 n 
+0000652776 00000 n 
+0000654657 00000 n 
+0000650999 00000 n 
+0000649208 00000 n 
+0000652941 00000 n 
+0000652999 00000 n 
+0000653117 00000 n 
+0000653240 00000 n 
+0000653363 00000 n 
+0000653422 00000 n 
+0000653539 00000 n 
+0000653913 00000 n 
+0000654481 00000 n 
+0000654598 00000 n 
+0000657845 00000 n 
+0000658266 00000 n 
+0000658477 00000 n 
+0000658705 00000 n 
+0000659707 00000 n 
+0000657665 00000 n 
+0000654838 00000 n 
+0000658870 00000 n 
+0000658985 00000 n 
+0000659108 00000 n 
+0000659167 00000 n 
+0000659285 00000 n 
+0000658057 00000 n 
+0000659408 00000 n 
+0000659589 00000 n 
+0000659648 00000 n 
+0000663104 00000 n 
+0000662644 00000 n 
+0000662822 00000 n 
+0000663456 00000 n 
+0000662491 00000 n 
+0000659888 00000 n 
+0000662987 00000 n 
+0000663045 00000 n 
+0000663163 00000 n 
+0000663222 00000 n 
+0000663398 00000 n 
+0000668042 00000 n 
+0000672119 00000 n 
+0000665138 00000 n 
+0000665945 00000 n 
+0000664994 00000 n 
+0000663638 00000 n 
+0000665303 00000 n 
+0000665534 00000 n 
+0004454318 00000 n 
+0000665710 00000 n 
+0000665769 00000 n 
+0000672187 00000 n 
+0000672438 00000 n 
+0000672689 00000 n 
+0000672885 00000 n 
+0000673136 00000 n 
+0000673354 00000 n 
+0000673606 00000 n 
+0000673858 00000 n 
+0000674076 00000 n 
+0000674327 00000 n 
+0000674545 00000 n 
+0000674797 00000 n 
+0000675015 00000 n 
+0000675266 00000 n 
+0000675518 00000 n 
+0000675770 00000 n 
+0000676022 00000 n 
+0000676273 00000 n 
+0000676477 00000 n 
+0000676729 00000 n 
+0000676931 00000 n 
+0000680820 00000 n 
+0000677181 00000 n 
+0000678110 00000 n 
+0000667693 00000 n 
+0000666112 00000 n 
+0000677346 00000 n 
+0000677404 00000 n 
+0000677463 00000 n 
+0000677522 00000 n 
+0000677581 00000 n 
+0000677640 00000 n 
+0004456817 00000 n 
+0000677699 00000 n 
+0000677758 00000 n 
+0000677817 00000 n 
+0000677876 00000 n 
+0004454907 00000 n 
+0000677934 00000 n 
+0000677993 00000 n 
+0000678052 00000 n 
+0004461595 00000 n 
+0000668917 00000 n 
+0000669048 00000 n 
+0000669198 00000 n 
+0000669506 00000 n 
+0000669929 00000 n 
+0000670167 00000 n 
+0000670189 00000 n 
+0000672096 00000 n 
+0000683435 00000 n 
+0000683730 00000 n 
+0000681071 00000 n 
+0000681323 00000 n 
+0000681541 00000 n 
+0000681759 00000 n 
+0000682011 00000 n 
+0000682229 00000 n 
+0000682481 00000 n 
+0000682699 00000 n 
+0000682917 00000 n 
+0000683846 00000 n 
+0000680595 00000 n 
+0000678320 00000 n 
+0000683082 00000 n 
+0000683140 00000 n 
+0000683199 00000 n 
+0000683258 00000 n 
+0000683317 00000 n 
+0000683376 00000 n 
+0000683494 00000 n 
+0004457264 00000 n 
+0000683553 00000 n 
+0000683612 00000 n 
+0000683671 00000 n 
+0000683788 00000 n 
+0000689040 00000 n 
+0000689158 00000 n 
+0000686598 00000 n 
+0000686819 00000 n 
+0000687012 00000 n 
+0000687233 00000 n 
+0000687454 00000 n 
+0000687675 00000 n 
+0000687896 00000 n 
+0000688117 00000 n 
+0000688337 00000 n 
+0000688539 00000 n 
+0000692996 00000 n 
+0000693200 00000 n 
+0000688758 00000 n 
+0000689980 00000 n 
+0000686364 00000 n 
+0000684071 00000 n 
+0000688923 00000 n 
+0000688981 00000 n 
+0000689099 00000 n 
+0000689217 00000 n 
+0000689276 00000 n 
+0000689450 00000 n 
+0000689509 00000 n 
+0000689568 00000 n 
+0000689627 00000 n 
+0000689686 00000 n 
+0000689745 00000 n 
+0000689804 00000 n 
+0000689863 00000 n 
+0000689922 00000 n 
+0000693421 00000 n 
+0000693642 00000 n 
+0000693863 00000 n 
+0000694068 00000 n 
+0000694273 00000 n 
+0000694512 00000 n 
+0000694733 00000 n 
+0000694920 00000 n 
+0000695125 00000 n 
+0000695364 00000 n 
+0000695585 00000 n 
+0000695772 00000 n 
+0000695977 00000 n 
+0000696216 00000 n 
+0000696437 00000 n 
+0000696633 00000 n 
+0000696854 00000 n 
+0000697050 00000 n 
+0000697269 00000 n 
+0000697462 00000 n 
+0000697683 00000 n 
+0000697871 00000 n 
+0000698076 00000 n 
+0000698314 00000 n 
+0000698535 00000 n 
+0000698716 00000 n 
+0000698902 00000 n 
+0000699107 00000 n 
+0000699583 00000 n 
+0000699803 00000 n 
+0000699984 00000 n 
+0000700188 00000 n 
+0000700426 00000 n 
+0000700646 00000 n 
+0000700839 00000 n 
+0000701043 00000 n 
+0000701520 00000 n 
+0000701707 00000 n 
+0000701928 00000 n 
+0000702115 00000 n 
+0000702334 00000 n 
+0000702521 00000 n 
+0000702742 00000 n 
+0000702947 00000 n 
+0000703167 00000 n 
+0000703371 00000 n 
+0000703591 00000 n 
+0000703781 00000 n 
+0000703977 00000 n 
+0000704196 00000 n 
+0000704392 00000 n 
+0000704612 00000 n 
+0000704807 00000 n 
+0000708867 00000 n 
+0000709063 00000 n 
+0000709284 00000 n 
+0000709505 00000 n 
+0000709701 00000 n 
+0000709922 00000 n 
+0000705027 00000 n 
+0000705780 00000 n 
+0000692339 00000 n 
+0000690231 00000 n 
+0000705192 00000 n 
+0000705250 00000 n 
+0000699345 00000 n 
+0000701281 00000 n 
+0000705309 00000 n 
+0000705368 00000 n 
+0000705426 00000 n 
+0000705485 00000 n 
+0000705544 00000 n 
+0004455938 00000 n 
+0000705603 00000 n 
+0000705662 00000 n 
+0000705721 00000 n 
+0000883294 00000 n 
+0000777756 00000 n 
+0000780692 00000 n 
+0000780810 00000 n 
+0000780933 00000 n 
+0000781174 00000 n 
+0000781410 00000 n 
+0000784729 00000 n 
+0000784847 00000 n 
+0000785087 00000 n 
+0000785323 00000 n 
+0000710117 00000 n 
+0000710337 00000 n 
+0000710533 00000 n 
+0000710738 00000 n 
+0000710943 00000 n 
+0000711163 00000 n 
+0000711359 00000 n 
+0000711564 00000 n 
+0000711769 00000 n 
+0000711956 00000 n 
+0000712177 00000 n 
+0000712373 00000 n 
+0000712577 00000 n 
+0000712781 00000 n 
+0000713002 00000 n 
+0000713198 00000 n 
+0000713402 00000 n 
+0000713606 00000 n 
+0000713793 00000 n 
+0000714014 00000 n 
+0000714209 00000 n 
+0000714414 00000 n 
+0000714619 00000 n 
+0000715028 00000 n 
+0000715232 00000 n 
+0000715453 00000 n 
+0000715640 00000 n 
+0000715861 00000 n 
+0000716047 00000 n 
+0000716268 00000 n 
+0000716455 00000 n 
+0000716652 00000 n 
+0000716872 00000 n 
+0000717059 00000 n 
+0000717256 00000 n 
+0000717476 00000 n 
+0000717663 00000 n 
+0000717859 00000 n 
+0000718078 00000 n 
+0000718263 00000 n 
+0000718483 00000 n 
+0000718700 00000 n 
+0000718921 00000 n 
+0000719141 00000 n 
+0000719357 00000 n 
+0000719578 00000 n 
+0000719798 00000 n 
+0000719983 00000 n 
+0000724344 00000 n 
+0000724563 00000 n 
+0000720202 00000 n 
+0000720896 00000 n 
+0000708228 00000 n 
+0000706003 00000 n 
+0000720367 00000 n 
+0000720425 00000 n 
+0000714823 00000 n 
+0000720484 00000 n 
+0000720543 00000 n 
+0000720602 00000 n 
+0000720661 00000 n 
+0000720720 00000 n 
+0000720779 00000 n 
+0000720838 00000 n 
+0000788918 00000 n 
+0000789095 00000 n 
+0000789271 00000 n 
+0000789507 00000 n 
+0000793221 00000 n 
+0000793462 00000 n 
+0000797494 00000 n 
+0000797734 00000 n 
+0000797916 00000 n 
+0000798093 00000 n 
+0000801000 00000 n 
+0000801177 00000 n 
+0000801354 00000 n 
+0000801531 00000 n 
+0000724751 00000 n 
+0000724970 00000 n 
+0000725158 00000 n 
+0000725377 00000 n 
+0000725573 00000 n 
+0000725792 00000 n 
+0000725988 00000 n 
+0000726207 00000 n 
+0000726402 00000 n 
+0000726621 00000 n 
+0000726817 00000 n 
+0000727036 00000 n 
+0000727224 00000 n 
+0000727442 00000 n 
+0000727630 00000 n 
+0000727848 00000 n 
+0000728044 00000 n 
+0000728263 00000 n 
+0000728459 00000 n 
+0000728680 00000 n 
+0000728870 00000 n 
+0000729056 00000 n 
+0000729246 00000 n 
+0000729432 00000 n 
+0000729619 00000 n 
+0000729840 00000 n 
+0000730030 00000 n 
+0000730216 00000 n 
+0000730406 00000 n 
+0000730592 00000 n 
+0000730797 00000 n 
+0000730982 00000 n 
+0000731200 00000 n 
+0000731419 00000 n 
+0000731605 00000 n 
+0000731771 00000 n 
+0000731990 00000 n 
+0000732182 00000 n 
+0000732348 00000 n 
+0000732567 00000 n 
+0000732754 00000 n 
+0000732973 00000 n 
+0000733158 00000 n 
+0000733379 00000 n 
+0000733564 00000 n 
+0000733785 00000 n 
+0000733972 00000 n 
+0000734189 00000 n 
+0000739180 00000 n 
+0000739401 00000 n 
+0000739588 00000 n 
+0000734374 00000 n 
+0000734597 00000 n 
+0000723750 00000 n 
+0000721078 00000 n 
+0000734539 00000 n 
+0000801707 00000 n 
+0000804843 00000 n 
+0000805079 00000 n 
+0000805310 00000 n 
+0000805546 00000 n 
+0000808736 00000 n 
+0000808972 00000 n 
+0000809208 00000 n 
+0000812885 00000 n 
+0000813121 00000 n 
+0000813357 00000 n 
+0000817696 00000 n 
+0000817937 00000 n 
+0000822150 00000 n 
+0000822391 00000 n 
+0000822626 00000 n 
+0000822803 00000 n 
+0000826220 00000 n 
+0000826397 00000 n 
+0000826573 00000 n 
+0000739768 00000 n 
+0000739988 00000 n 
+0000740174 00000 n 
+0000740370 00000 n 
+0000740582 00000 n 
+0000740762 00000 n 
+0000740982 00000 n 
+0000741167 00000 n 
+0000741355 00000 n 
+0000741539 00000 n 
+0000741709 00000 n 
+0000741930 00000 n 
+0000742116 00000 n 
+0000742312 00000 n 
+0000742520 00000 n 
+0000742700 00000 n 
+0000742921 00000 n 
+0000743107 00000 n 
+0000743312 00000 n 
+0000743508 00000 n 
+0000743718 00000 n 
+0000743895 00000 n 
+0000744116 00000 n 
+0000744312 00000 n 
+0000744517 00000 n 
+0000744713 00000 n 
+0000744891 00000 n 
+0000745111 00000 n 
+0000745296 00000 n 
+0000745500 00000 n 
+0000745694 00000 n 
+0000745906 00000 n 
+0000746083 00000 n 
+0000746304 00000 n 
+0000746500 00000 n 
+0000746705 00000 n 
+0000746900 00000 n 
+0000747078 00000 n 
+0000747299 00000 n 
+0000747484 00000 n 
+0000747680 00000 n 
+0000748072 00000 n 
+0000748284 00000 n 
+0000748472 00000 n 
+0000748693 00000 n 
+0000748879 00000 n 
+0000749075 00000 n 
+0000749467 00000 n 
+0000749679 00000 n 
+0000749867 00000 n 
+0000750085 00000 n 
+0000750272 00000 n 
+0000750442 00000 n 
+0000750663 00000 n 
+0000750855 00000 n 
+0000751060 00000 n 
+0000751470 00000 n 
+0000751675 00000 n 
+0000751871 00000 n 
+0000752038 00000 n 
+0000752257 00000 n 
+0000752461 00000 n 
+0000752700 00000 n 
+0000752921 00000 n 
+0000753113 00000 n 
+0000753318 00000 n 
+0000753556 00000 n 
+0000753774 00000 n 
+0000753991 00000 n 
+0000757906 00000 n 
+0000758073 00000 n 
+0000758292 00000 n 
+0000754176 00000 n 
+0000754458 00000 n 
+0000738361 00000 n 
+0000734807 00000 n 
+0000754341 00000 n 
+0004455645 00000 n 
+0000747876 00000 n 
+0000749271 00000 n 
+0000751265 00000 n 
+0000754399 00000 n 
+0004461721 00000 n 
+0000826750 00000 n 
+0000826926 00000 n 
+0000831264 00000 n 
+0000831499 00000 n 
+0000835933 00000 n 
+0000836169 00000 n 
+0000836404 00000 n 
+0000841229 00000 n 
+0000841465 00000 n 
+0000841701 00000 n 
+0000846806 00000 n 
+0000846979 00000 n 
+0000850816 00000 n 
+0000850993 00000 n 
+0000851169 00000 n 
+0000758478 00000 n 
+0000758645 00000 n 
+0000758864 00000 n 
+0000759051 00000 n 
+0000759214 00000 n 
+0000759434 00000 n 
+0000759620 00000 n 
+0000759814 00000 n 
+0000759977 00000 n 
+0000760196 00000 n 
+0000760383 00000 n 
+0000760551 00000 n 
+0000760772 00000 n 
+0000760959 00000 n 
+0000761155 00000 n 
+0000761323 00000 n 
+0000761542 00000 n 
+0000761729 00000 n 
+0000761890 00000 n 
+0000762108 00000 n 
+0000762295 00000 n 
+0000762516 00000 n 
+0000762703 00000 n 
+0000762899 00000 n 
+0000763058 00000 n 
+0000763277 00000 n 
+0000763482 00000 n 
+0000763701 00000 n 
+0000763905 00000 n 
+0000764124 00000 n 
+0000764308 00000 n 
+0000764480 00000 n 
+0000764698 00000 n 
+0000764890 00000 n 
+0000765109 00000 n 
+0000765314 00000 n 
+0000765533 00000 n 
+0000765725 00000 n 
+0000765944 00000 n 
+0000766130 00000 n 
+0000766335 00000 n 
+0000766553 00000 n 
+0000766745 00000 n 
+0000766929 00000 n 
+0000767148 00000 n 
+0000767329 00000 n 
+0000767513 00000 n 
+0000767716 00000 n 
+0000771534 00000 n 
+0000771755 00000 n 
+0000767935 00000 n 
+0000768333 00000 n 
+0000757303 00000 n 
+0000754722 00000 n 
+0000768100 00000 n 
+0000768158 00000 n 
+0000768217 00000 n 
+0000768275 00000 n 
+0000851403 00000 n 
+0000855978 00000 n 
+0000856213 00000 n 
+0000856449 00000 n 
+0000861064 00000 n 
+0000861300 00000 n 
+0000865437 00000 n 
+0000865673 00000 n 
+0000865850 00000 n 
+0000866027 00000 n 
+0000870884 00000 n 
+0000871120 00000 n 
+0000871297 00000 n 
+0000877381 00000 n 
+0000877622 00000 n 
+0000877862 00000 n 
+0000771976 00000 n 
+0000772196 00000 n 
+0000772382 00000 n 
+0000772602 00000 n 
+0000772788 00000 n 
+0000776910 00000 n 
+0000772978 00000 n 
+0000773495 00000 n 
+0000771327 00000 n 
+0000768555 00000 n 
+0000773143 00000 n 
+0000773201 00000 n 
+0000773260 00000 n 
+0000773318 00000 n 
+0000773377 00000 n 
+0000773436 00000 n 
+0000883470 00000 n 
+0000777098 00000 n 
+0000777286 00000 n 
+0000777474 00000 n 
+0000777933 00000 n 
+0000776739 00000 n 
+0000773728 00000 n 
+0000777639 00000 n 
+0000777697 00000 n 
+0000777815 00000 n 
+0000777874 00000 n 
+0000780469 00000 n 
+0000781528 00000 n 
+0000780325 00000 n 
+0000778177 00000 n 
+0000780634 00000 n 
+0000780751 00000 n 
+0000780874 00000 n 
+0000780997 00000 n 
+0000781056 00000 n 
+0000781115 00000 n 
+0000781233 00000 n 
+0000781292 00000 n 
+0000781351 00000 n 
+0000781469 00000 n 
+0000784447 00000 n 
+0000785441 00000 n 
+0000784303 00000 n 
+0000781709 00000 n 
+0000784612 00000 n 
+0000784670 00000 n 
+0000784788 00000 n 
+0000784911 00000 n 
+0000784969 00000 n 
+0000785028 00000 n 
+0000785146 00000 n 
+0000785205 00000 n 
+0000785264 00000 n 
+0000785382 00000 n 
+0000788518 00000 n 
+0000789570 00000 n 
+0000788374 00000 n 
+0000785622 00000 n 
+0000788683 00000 n 
+0000788741 00000 n 
+0000788800 00000 n 
+0000788859 00000 n 
+0000788977 00000 n 
+0000789036 00000 n 
+0000789154 00000 n 
+0000789212 00000 n 
+0000789330 00000 n 
+0000789389 00000 n 
+0000789448 00000 n 
+0004461847 00000 n 
+0000792821 00000 n 
+0000793644 00000 n 
+0000792677 00000 n 
+0000789764 00000 n 
+0000792986 00000 n 
+0000793044 00000 n 
+0000793103 00000 n 
+0000793162 00000 n 
+0000793285 00000 n 
+0000793344 00000 n 
+0000793403 00000 n 
+0000793526 00000 n 
+0000793585 00000 n 
+0000796866 00000 n 
+0000797048 00000 n 
+0000797212 00000 n 
+0000798209 00000 n 
+0000796704 00000 n 
+0000793838 00000 n 
+0000797377 00000 n 
+0000797435 00000 n 
+0000797558 00000 n 
+0000797617 00000 n 
+0000797675 00000 n 
+0000797798 00000 n 
+0000797857 00000 n 
+0000797975 00000 n 
+0000798034 00000 n 
+0000798151 00000 n 
+0000800718 00000 n 
+0000801884 00000 n 
+0000800574 00000 n 
+0000798415 00000 n 
+0000800883 00000 n 
+0000800941 00000 n 
+0000801059 00000 n 
+0000801118 00000 n 
+0000801236 00000 n 
+0000801295 00000 n 
+0000801413 00000 n 
+0000801472 00000 n 
+0000801590 00000 n 
+0000801648 00000 n 
+0000801766 00000 n 
+0000801825 00000 n 
+0000804561 00000 n 
+0000805604 00000 n 
+0000804417 00000 n 
+0000802078 00000 n 
+0000804726 00000 n 
+0000804784 00000 n 
+0000804902 00000 n 
+0000804961 00000 n 
+0000805020 00000 n 
+0000805138 00000 n 
+0000805193 00000 n 
+0000805251 00000 n 
+0000805369 00000 n 
+0000805428 00000 n 
+0000805487 00000 n 
+0000808336 00000 n 
+0000809326 00000 n 
+0000808192 00000 n 
+0000805798 00000 n 
+0000808501 00000 n 
+0000808559 00000 n 
+0000808618 00000 n 
+0000808677 00000 n 
+0000808795 00000 n 
+0000808854 00000 n 
+0000808913 00000 n 
+0000809031 00000 n 
+0000809090 00000 n 
+0000809149 00000 n 
+0000809267 00000 n 
+0000812358 00000 n 
+0000812544 00000 n 
+0000813534 00000 n 
+0000812205 00000 n 
+0000809520 00000 n 
+0000812709 00000 n 
+0000812767 00000 n 
+0000812826 00000 n 
+0000812944 00000 n 
+0000813003 00000 n 
+0000813062 00000 n 
+0000813180 00000 n 
+0000813239 00000 n 
+0000813298 00000 n 
+0000813416 00000 n 
+0000813475 00000 n 
+0004461973 00000 n 
+0000816802 00000 n 
+0000816989 00000 n 
+0000817193 00000 n 
+0000821005 00000 n 
+0000817414 00000 n 
+0000818177 00000 n 
+0000816631 00000 n 
+0000813728 00000 n 
+0000817579 00000 n 
+0000817637 00000 n 
+0000817760 00000 n 
+0000817819 00000 n 
+0000817878 00000 n 
+0000818001 00000 n 
+0000818060 00000 n 
+0000818119 00000 n 
+0000821208 00000 n 
+0000821412 00000 n 
+0000821575 00000 n 
+0000821741 00000 n 
+0000821927 00000 n 
+0000822921 00000 n 
+0000820816 00000 n 
+0000818371 00000 n 
+0000822092 00000 n 
+0000822214 00000 n 
+0000822273 00000 n 
+0000822332 00000 n 
+0000822450 00000 n 
+0000822508 00000 n 
+0000822567 00000 n 
+0000822685 00000 n 
+0000822744 00000 n 
+0000822862 00000 n 
+0000825758 00000 n 
+0000830394 00000 n 
+0000825938 00000 n 
+0000827042 00000 n 
+0000825605 00000 n 
+0000823115 00000 n 
+0000826103 00000 n 
+0000826161 00000 n 
+0000826279 00000 n 
+0000826338 00000 n 
+0000826456 00000 n 
+0000826514 00000 n 
+0000826632 00000 n 
+0000826691 00000 n 
+0000826809 00000 n 
+0000826868 00000 n 
+0000826984 00000 n 
+0000830574 00000 n 
+0000830744 00000 n 
+0000830923 00000 n 
+0000831733 00000 n 
+0000830223 00000 n 
+0000827236 00000 n 
+0000831088 00000 n 
+0000831146 00000 n 
+0000831205 00000 n 
+0000831323 00000 n 
+0000831382 00000 n 
+0000831441 00000 n 
+0000831558 00000 n 
+0000831617 00000 n 
+0000831674 00000 n 
+0000835177 00000 n 
+0000835355 00000 n 
+0000835532 00000 n 
+0000835710 00000 n 
+0000836581 00000 n 
+0000835006 00000 n 
+0000831927 00000 n 
+0000835875 00000 n 
+0000835992 00000 n 
+0000836051 00000 n 
+0000836110 00000 n 
+0000836228 00000 n 
+0000836286 00000 n 
+0000836345 00000 n 
+0000836463 00000 n 
+0000836522 00000 n 
+0000840393 00000 n 
+0000840571 00000 n 
+0000840759 00000 n 
+0000840947 00000 n 
+0000841819 00000 n 
+0000840222 00000 n 
+0000836812 00000 n 
+0000841112 00000 n 
+0000841170 00000 n 
+0000841288 00000 n 
+0000841347 00000 n 
+0000841406 00000 n 
+0000841524 00000 n 
+0000841583 00000 n 
+0000841642 00000 n 
+0000841760 00000 n 
+0004462099 00000 n 
+0000845778 00000 n 
+0000845947 00000 n 
+0000846113 00000 n 
+0000846298 00000 n 
+0000846465 00000 n 
+0000847156 00000 n 
+0000845598 00000 n 
+0000842050 00000 n 
+0000846630 00000 n 
+0000846688 00000 n 
+0000846747 00000 n 
+0000846865 00000 n 
+0000846920 00000 n 
+0000847038 00000 n 
+0000847097 00000 n 
+0000850196 00000 n 
+0000850364 00000 n 
+0000854630 00000 n 
+0000850534 00000 n 
+0000851519 00000 n 
+0000850034 00000 n 
+0000847350 00000 n 
+0000850699 00000 n 
+0000850757 00000 n 
+0000850875 00000 n 
+0000850934 00000 n 
+0000851051 00000 n 
+0000851110 00000 n 
+0000851228 00000 n 
+0000851287 00000 n 
+0000851346 00000 n 
+0000851461 00000 n 
+0000854798 00000 n 
+0000854968 00000 n 
+0000855132 00000 n 
+0000855302 00000 n 
+0000855467 00000 n 
+0000859885 00000 n 
+0000855637 00000 n 
+0000856565 00000 n 
+0000854432 00000 n 
+0000851713 00000 n 
+0000855802 00000 n 
+0000855860 00000 n 
+0000855919 00000 n 
+0000856037 00000 n 
+0000856095 00000 n 
+0000856154 00000 n 
+0000856272 00000 n 
+0000856331 00000 n 
+0000856390 00000 n 
+0000856507 00000 n 
+0000860053 00000 n 
+0000860221 00000 n 
+0000860391 00000 n 
+0000860553 00000 n 
+0000860723 00000 n 
+0000861477 00000 n 
+0000859696 00000 n 
+0000856759 00000 n 
+0000860888 00000 n 
+0000860946 00000 n 
+0000861005 00000 n 
+0004457114 00000 n 
+0000861123 00000 n 
+0000861182 00000 n 
+0000861241 00000 n 
+0000861359 00000 n 
+0000861418 00000 n 
+0000864824 00000 n 
+0000864985 00000 n 
+0000869382 00000 n 
+0000865155 00000 n 
+0000866085 00000 n 
+0000864662 00000 n 
+0000861698 00000 n 
+0000865320 00000 n 
+0000865378 00000 n 
+0000865496 00000 n 
+0000865555 00000 n 
+0000865614 00000 n 
+0000865732 00000 n 
+0000865791 00000 n 
+0000865909 00000 n 
+0000865968 00000 n 
+0000869555 00000 n 
+0000869776 00000 n 
+0000869961 00000 n 
+0000870147 00000 n 
+0000870339 00000 n 
+0000875443 00000 n 
+0000875646 00000 n 
+0000870543 00000 n 
+0000871474 00000 n 
+0000869184 00000 n 
+0000866328 00000 n 
+0000870708 00000 n 
+0000870766 00000 n 
+0000870825 00000 n 
+0000870943 00000 n 
+0000871002 00000 n 
+0000871061 00000 n 
+0000871179 00000 n 
+0000871238 00000 n 
+0000871356 00000 n 
+0000871415 00000 n 
+0004462225 00000 n 
+0000875850 00000 n 
+0000876041 00000 n 
+0000876261 00000 n 
+0000876432 00000 n 
+0000876617 00000 n 
+0000876988 00000 n 
+0000877158 00000 n 
+0000877985 00000 n 
+0000875218 00000 n 
+0000871668 00000 n 
+0000877323 00000 n 
+0000877445 00000 n 
+0000877504 00000 n 
+0000877563 00000 n 
+0000877685 00000 n 
+0000877744 00000 n 
+0000877803 00000 n 
+0000876802 00000 n 
+0000877926 00000 n 
+0000880655 00000 n 
+0000880864 00000 n 
+0000881094 00000 n 
+0000881323 00000 n 
+0000881510 00000 n 
+0000881740 00000 n 
+0000881937 00000 n 
+0000882167 00000 n 
+0000882398 00000 n 
+0000882595 00000 n 
+0000882825 00000 n 
+0000883012 00000 n 
+0000884174 00000 n 
+0000880412 00000 n 
+0000878191 00000 n 
+0000883177 00000 n 
+0000883235 00000 n 
+0000883353 00000 n 
+0000883412 00000 n 
+0000883529 00000 n 
+0000883588 00000 n 
+0000883762 00000 n 
+0000883821 00000 n 
+0000883880 00000 n 
+0000883939 00000 n 
+0000883998 00000 n 
+0000884057 00000 n 
+0000884115 00000 n 
+0000886924 00000 n 
+0000886388 00000 n 
+0000890096 00000 n 
+0000890307 00000 n 
+0000886584 00000 n 
+0000887335 00000 n 
+0000886235 00000 n 
+0000884397 00000 n 
+0000886749 00000 n 
+0000886807 00000 n 
+0000886866 00000 n 
+0000886983 00000 n 
+0000887159 00000 n 
+0000890543 00000 n 
+0000890741 00000 n 
+0000890976 00000 n 
+0000891174 00000 n 
+0000891410 00000 n 
+0000891625 00000 n 
+0000891840 00000 n 
+0000892026 00000 n 
+0000892241 00000 n 
+0000892427 00000 n 
+0000892642 00000 n 
+0000892828 00000 n 
+0000893033 00000 n 
+0000893238 00000 n 
+0000893452 00000 n 
+0000893637 00000 n 
+0000893841 00000 n 
+0000894045 00000 n 
+0000894240 00000 n 
+0000894455 00000 n 
+0000894650 00000 n 
+0000894865 00000 n 
+0000895058 00000 n 
+0000899389 00000 n 
+0000899584 00000 n 
+0000895271 00000 n 
+0000896314 00000 n 
+0000889727 00000 n 
+0000887542 00000 n 
+0000895436 00000 n 
+0000895494 00000 n 
+0000895553 00000 n 
+0000895612 00000 n 
+0000895671 00000 n 
+0000895729 00000 n 
+0000895788 00000 n 
+0000895963 00000 n 
+0000896021 00000 n 
+0000896079 00000 n 
+0000896138 00000 n 
+0000896197 00000 n 
+0000896256 00000 n 
+0001067669 00000 n 
+0001067851 00000 n 
+0001068028 00000 n 
+0001071499 00000 n 
+0000899799 00000 n 
+0000900003 00000 n 
+0000900218 00000 n 
+0000900422 00000 n 
+0000900637 00000 n 
+0000900851 00000 n 
+0000901066 00000 n 
+0000901281 00000 n 
+0000901496 00000 n 
+0000901711 00000 n 
+0000901925 00000 n 
+0000902129 00000 n 
+0000902333 00000 n 
+0000902571 00000 n 
+0000902786 00000 n 
+0000902967 00000 n 
+0000903172 00000 n 
+0000903411 00000 n 
+0000903626 00000 n 
+0000903807 00000 n 
+0000904012 00000 n 
+0000904251 00000 n 
+0000904466 00000 n 
+0000904662 00000 n 
+0000904875 00000 n 
+0000905069 00000 n 
+0000905260 00000 n 
+0000905475 00000 n 
+0000905670 00000 n 
+0000905885 00000 n 
+0000906080 00000 n 
+0000906273 00000 n 
+0000906488 00000 n 
+0000906684 00000 n 
+0000906899 00000 n 
+0000907095 00000 n 
+0000907287 00000 n 
+0000907502 00000 n 
+0000907689 00000 n 
+0000907894 00000 n 
+0000908372 00000 n 
+0000908587 00000 n 
+0000908781 00000 n 
+0000908986 00000 n 
+0000909463 00000 n 
+0000909677 00000 n 
+0000909864 00000 n 
+0000910068 00000 n 
+0000910305 00000 n 
+0000910520 00000 n 
+0000910702 00000 n 
+0000910907 00000 n 
+0000911146 00000 n 
+0000911359 00000 n 
+0000911562 00000 n 
+0000911765 00000 n 
+0000915801 00000 n 
+0000915981 00000 n 
+0000916195 00000 n 
+0000916375 00000 n 
+0000916587 00000 n 
+0000912236 00000 n 
+0000912872 00000 n 
+0000898696 00000 n 
+0000896536 00000 n 
+0000912401 00000 n 
+0000912459 00000 n 
+0000912518 00000 n 
+0000912577 00000 n 
+0000912636 00000 n 
+0000912695 00000 n 
+0000912754 00000 n 
+0000912813 00000 n 
+0000908133 00000 n 
+0000909225 00000 n 
+0000912000 00000 n 
+0001071617 00000 n 
+0000975794 00000 n 
+0000975970 00000 n 
+0000976088 00000 n 
+0000979410 00000 n 
+0000979592 00000 n 
+0000979769 00000 n 
+0000979946 00000 n 
+0000983360 00000 n 
+0000983537 00000 n 
+0000983714 00000 n 
+0000983831 00000 n 
+0000983954 00000 n 
+0000984077 00000 n 
+0000987199 00000 n 
+0000916767 00000 n 
+0000916971 00000 n 
+0000917184 00000 n 
+0000917387 00000 n 
+0000917600 00000 n 
+0000917790 00000 n 
+0000918005 00000 n 
+0000918219 00000 n 
+0000918434 00000 n 
+0000918649 00000 n 
+0000918864 00000 n 
+0000919079 00000 n 
+0000919294 00000 n 
+0000919480 00000 n 
+0000919677 00000 n 
+0000919891 00000 n 
+0000920078 00000 n 
+0000920275 00000 n 
+0000920489 00000 n 
+0000920676 00000 n 
+0000920872 00000 n 
+0000921085 00000 n 
+0000921270 00000 n 
+0000921485 00000 n 
+0000921681 00000 n 
+0000921896 00000 n 
+0000922091 00000 n 
+0000922305 00000 n 
+0000922501 00000 n 
+0000922706 00000 n 
+0000922911 00000 n 
+0000923125 00000 n 
+0000923321 00000 n 
+0000923526 00000 n 
+0000923731 00000 n 
+0000923918 00000 n 
+0000924133 00000 n 
+0000924329 00000 n 
+0000924533 00000 n 
+0000924737 00000 n 
+0000924952 00000 n 
+0000925148 00000 n 
+0000925352 00000 n 
+0000925556 00000 n 
+0000929586 00000 n 
+0000929801 00000 n 
+0000929996 00000 n 
+0000930201 00000 n 
+0000930406 00000 n 
+0000930815 00000 n 
+0000931019 00000 n 
+0000931234 00000 n 
+0000931415 00000 n 
+0000931630 00000 n 
+0000925741 00000 n 
+0000926554 00000 n 
+0000915216 00000 n 
+0000913082 00000 n 
+0000925906 00000 n 
+0000925964 00000 n 
+0000926023 00000 n 
+0000926082 00000 n 
+0000926141 00000 n 
+0000926200 00000 n 
+0000926259 00000 n 
+0000926318 00000 n 
+0000926377 00000 n 
+0000926436 00000 n 
+0000926495 00000 n 
+0004462351 00000 n 
+0000987381 00000 n 
+0000987558 00000 n 
+0000987734 00000 n 
+0000987910 00000 n 
+0000988086 00000 n 
+0000991581 00000 n 
+0000991758 00000 n 
+0000991994 00000 n 
+0000995801 00000 n 
+0000996042 00000 n 
+0000931810 00000 n 
+0000932025 00000 n 
+0000932206 00000 n 
+0000932421 00000 n 
+0000932634 00000 n 
+0000932822 00000 n 
+0000933035 00000 n 
+0000933231 00000 n 
+0000933444 00000 n 
+0000933640 00000 n 
+0000933853 00000 n 
+0000934041 00000 n 
+0000934254 00000 n 
+0000934449 00000 n 
+0000934662 00000 n 
+0000934858 00000 n 
+0000935071 00000 n 
+0000935259 00000 n 
+0000935471 00000 n 
+0000935667 00000 n 
+0000935879 00000 n 
+0000936067 00000 n 
+0000936280 00000 n 
+0000936476 00000 n 
+0000936689 00000 n 
+0000936877 00000 n 
+0000937089 00000 n 
+0000937284 00000 n 
+0000937487 00000 n 
+0000937698 00000 n 
+0000937882 00000 n 
+0000938048 00000 n 
+0000938261 00000 n 
+0000938453 00000 n 
+0000938619 00000 n 
+0000938831 00000 n 
+0000939011 00000 n 
+0000939224 00000 n 
+0000939403 00000 n 
+0000939618 00000 n 
+0000939797 00000 n 
+0000940007 00000 n 
+0000945033 00000 n 
+0000945248 00000 n 
+0000945429 00000 n 
+0000945608 00000 n 
+0000945822 00000 n 
+0000946008 00000 n 
+0000946204 00000 n 
+0000940185 00000 n 
+0000940467 00000 n 
+0000928965 00000 n 
+0000926750 00000 n 
+0000940350 00000 n 
+0000930610 00000 n 
+0000940408 00000 n 
+0000996283 00000 n 
+0001000332 00000 n 
+0001000513 00000 n 
+0001000688 00000 n 
+0001000865 00000 n 
+0001003869 00000 n 
+0001004105 00000 n 
+0001004341 00000 n 
+0001004576 00000 n 
+0001007843 00000 n 
+0001008077 00000 n 
+0001008313 00000 n 
+0001011793 00000 n 
+0001012028 00000 n 
+0001012264 00000 n 
+0001012499 00000 n 
+0001016417 00000 n 
+0001016653 00000 n 
+0001016889 00000 n 
+0001020770 00000 n 
+0001020947 00000 n 
+0001021124 00000 n 
+0000946416 00000 n 
+0000946596 00000 n 
+0000946808 00000 n 
+0000946993 00000 n 
+0000947180 00000 n 
+0000947350 00000 n 
+0000947565 00000 n 
+0000947751 00000 n 
+0000947947 00000 n 
+0000948155 00000 n 
+0000948335 00000 n 
+0000948548 00000 n 
+0000948732 00000 n 
+0000948935 00000 n 
+0000949129 00000 n 
+0000949341 00000 n 
+0000949519 00000 n 
+0000949734 00000 n 
+0000949920 00000 n 
+0000950125 00000 n 
+0000950320 00000 n 
+0000950532 00000 n 
+0000950709 00000 n 
+0000950923 00000 n 
+0000951118 00000 n 
+0000951322 00000 n 
+0000951518 00000 n 
+0000951696 00000 n 
+0000951911 00000 n 
+0000952107 00000 n 
+0000952312 00000 n 
+0000952508 00000 n 
+0000952684 00000 n 
+0000952899 00000 n 
+0000953084 00000 n 
+0000953280 00000 n 
+0000953672 00000 n 
+0000953884 00000 n 
+0000954072 00000 n 
+0000954287 00000 n 
+0000954473 00000 n 
+0000954669 00000 n 
+0000955061 00000 n 
+0000955273 00000 n 
+0000955460 00000 n 
+0000955672 00000 n 
+0000955853 00000 n 
+0000956023 00000 n 
+0000956236 00000 n 
+0000956451 00000 n 
+0000956643 00000 n 
+0000956848 00000 n 
+0000957258 00000 n 
+0000957463 00000 n 
+0000957659 00000 n 
+0000957826 00000 n 
+0000958039 00000 n 
+0000958243 00000 n 
+0000958482 00000 n 
+0000958697 00000 n 
+0000958889 00000 n 
+0000959094 00000 n 
+0000959333 00000 n 
+0000959514 00000 n 
+0000963122 00000 n 
+0000959727 00000 n 
+0000960009 00000 n 
+0000944223 00000 n 
+0000940636 00000 n 
+0000959892 00000 n 
+0000953476 00000 n 
+0000954865 00000 n 
+0000959950 00000 n 
+0000957053 00000 n 
+0001021301 00000 n 
+0001021477 00000 n 
+0001026117 00000 n 
+0001026352 00000 n 
+0001026593 00000 n 
+0001030907 00000 n 
+0001031143 00000 n 
+0001031378 00000 n 
+0001035607 00000 n 
+0001035842 00000 n 
+0001036077 00000 n 
+0001041301 00000 n 
+0001041536 00000 n 
+0001041712 00000 n 
+0001046096 00000 n 
+0000963289 00000 n 
+0000963470 00000 n 
+0000963685 00000 n 
+0000963853 00000 n 
+0000964065 00000 n 
+0000964246 00000 n 
+0000964461 00000 n 
+0000964642 00000 n 
+0000964838 00000 n 
+0000965005 00000 n 
+0000965186 00000 n 
+0000965401 00000 n 
+0000965569 00000 n 
+0000965782 00000 n 
+0000965987 00000 n 
+0000966200 00000 n 
+0000966404 00000 n 
+0000966617 00000 n 
+0000966796 00000 n 
+0000967008 00000 n 
+0000967200 00000 n 
+0000967412 00000 n 
+0000967616 00000 n 
+0000967829 00000 n 
+0000968021 00000 n 
+0000968233 00000 n 
+0000968418 00000 n 
+0000968622 00000 n 
+0000968834 00000 n 
+0000969026 00000 n 
+0000969210 00000 n 
+0000969414 00000 n 
+0000969628 00000 n 
+0000969809 00000 n 
+0000970024 00000 n 
+0000973813 00000 n 
+0000974028 00000 n 
+0000970238 00000 n 
+0000970756 00000 n 
+0000962654 00000 n 
+0000960273 00000 n 
+0000970403 00000 n 
+0000970461 00000 n 
+0000970520 00000 n 
+0000970579 00000 n 
+0000970638 00000 n 
+0000970697 00000 n 
+0001046332 00000 n 
+0001046568 00000 n 
+0001051429 00000 n 
+0001051665 00000 n 
+0001056323 00000 n 
+0001056499 00000 n 
+0001056616 00000 n 
+0001056857 00000 n 
+0001062224 00000 n 
+0001062401 00000 n 
+0001062642 00000 n 
+0000974209 00000 n 
+0000974424 00000 n 
+0000974605 00000 n 
+0000974784 00000 n 
+0000974965 00000 n 
+0000975144 00000 n 
+0000975335 00000 n 
+0000976151 00000 n 
+0000973597 00000 n 
+0000970978 00000 n 
+0000975500 00000 n 
+0000975558 00000 n 
+0000975617 00000 n 
+0000975676 00000 n 
+0000975735 00000 n 
+0000975853 00000 n 
+0000975912 00000 n 
+0000976029 00000 n 
+0001071792 00000 n 
+0000978810 00000 n 
+0000978969 00000 n 
+0000979128 00000 n 
+0000980123 00000 n 
+0000978648 00000 n 
+0000976346 00000 n 
+0000979293 00000 n 
+0000979351 00000 n 
+0000979474 00000 n 
+0000979533 00000 n 
+0000979651 00000 n 
+0000979710 00000 n 
+0000979828 00000 n 
+0000979887 00000 n 
+0000980005 00000 n 
+0000980064 00000 n 
+0000983078 00000 n 
+0000984198 00000 n 
+0000982934 00000 n 
+0000980304 00000 n 
+0000983243 00000 n 
+0000983301 00000 n 
+0000983419 00000 n 
+0000983478 00000 n 
+0000983596 00000 n 
+0000983655 00000 n 
+0000983773 00000 n 
+0000983895 00000 n 
+0000984018 00000 n 
+0000984140 00000 n 
+0004462477 00000 n 
+0000986976 00000 n 
+0000988144 00000 n 
+0000986832 00000 n 
+0000984379 00000 n 
+0000987141 00000 n 
+0000987263 00000 n 
+0000987322 00000 n 
+0000987440 00000 n 
+0000987499 00000 n 
+0000987617 00000 n 
+0000987676 00000 n 
+0000987792 00000 n 
+0000987851 00000 n 
+0000987969 00000 n 
+0000988027 00000 n 
+0000991240 00000 n 
+0000992176 00000 n 
+0000991096 00000 n 
+0000988338 00000 n 
+0000991405 00000 n 
+0000991463 00000 n 
+0000991522 00000 n 
+0000991640 00000 n 
+0000991699 00000 n 
+0000991817 00000 n 
+0000991876 00000 n 
+0000991935 00000 n 
+0000992058 00000 n 
+0000992117 00000 n 
+0000995519 00000 n 
+0000996406 00000 n 
+0000995375 00000 n 
+0000992370 00000 n 
+0000995684 00000 n 
+0000995742 00000 n 
+0000995865 00000 n 
+0000995924 00000 n 
+0000995983 00000 n 
+0000996106 00000 n 
+0000996165 00000 n 
+0000996224 00000 n 
+0000996347 00000 n 
+0000999472 00000 n 
+0000999652 00000 n 
+0000999814 00000 n 
+0000999991 00000 n 
+0001001099 00000 n 
+0000999301 00000 n 
+0000996600 00000 n 
+0001000156 00000 n 
+0001000214 00000 n 
+0001000273 00000 n 
+0001000396 00000 n 
+0001000455 00000 n 
+0001000570 00000 n 
+0001000629 00000 n 
+0001000747 00000 n 
+0001000806 00000 n 
+0001000924 00000 n 
+0001000982 00000 n 
+0001001041 00000 n 
+0001003646 00000 n 
+0001004694 00000 n 
+0001003502 00000 n 
+0001001305 00000 n 
+0001003811 00000 n 
+0001003928 00000 n 
+0001003987 00000 n 
+0001004046 00000 n 
+0001004164 00000 n 
+0001004223 00000 n 
+0001004282 00000 n 
+0001004400 00000 n 
+0001004459 00000 n 
+0001004518 00000 n 
+0001004635 00000 n 
+0001007502 00000 n 
+0001008490 00000 n 
+0001007358 00000 n 
+0001004888 00000 n 
+0001007667 00000 n 
+0001007725 00000 n 
+0001007784 00000 n 
+0001007900 00000 n 
+0001007959 00000 n 
+0001008018 00000 n 
+0001008136 00000 n 
+0001008195 00000 n 
+0001008254 00000 n 
+0001008372 00000 n 
+0001008431 00000 n 
+0004462603 00000 n 
+0001011085 00000 n 
+0001011511 00000 n 
+0001012615 00000 n 
+0001010923 00000 n 
+0001008684 00000 n 
+0001011676 00000 n 
+0001011734 00000 n 
+0001011298 00000 n 
+0001011852 00000 n 
+0001011910 00000 n 
+0001011969 00000 n 
+0001012087 00000 n 
+0001012146 00000 n 
+0001012205 00000 n 
+0001012323 00000 n 
+0001012382 00000 n 
+0001012440 00000 n 
+0001012557 00000 n 
+0001015560 00000 n 
+0001015724 00000 n 
+0001015890 00000 n 
+0001016076 00000 n 
+0001017007 00000 n 
+0001015389 00000 n 
+0001012809 00000 n 
+0001016241 00000 n 
+0001016299 00000 n 
+0001016358 00000 n 
+0001016476 00000 n 
+0001016535 00000 n 
+0001016594 00000 n 
+0001016712 00000 n 
+0001016771 00000 n 
+0001016830 00000 n 
+0001016948 00000 n 
+0001020129 00000 n 
+0001020309 00000 n 
+0001020488 00000 n 
+0001021653 00000 n 
+0001019967 00000 n 
+0001017201 00000 n 
+0001020653 00000 n 
+0001020711 00000 n 
+0001020829 00000 n 
+0001020888 00000 n 
+0001021006 00000 n 
+0001021065 00000 n 
+0001021183 00000 n 
+0001021242 00000 n 
+0001021360 00000 n 
+0001021419 00000 n 
+0001021535 00000 n 
+0001021594 00000 n 
+0001025310 00000 n 
+0001025480 00000 n 
+0001025659 00000 n 
+0001025835 00000 n 
+0001026770 00000 n 
+0001025139 00000 n 
+0001021847 00000 n 
+0001026000 00000 n 
+0001026058 00000 n 
+0001026176 00000 n 
+0001026235 00000 n 
+0001026294 00000 n 
+0001026416 00000 n 
+0001026475 00000 n 
+0001026534 00000 n 
+0001026652 00000 n 
+0001026711 00000 n 
+0001030092 00000 n 
+0001030270 00000 n 
+0001030448 00000 n 
+0001030625 00000 n 
+0001031495 00000 n 
+0001029921 00000 n 
+0001027001 00000 n 
+0001030790 00000 n 
+0001030848 00000 n 
+0001030966 00000 n 
+0001031025 00000 n 
+0001031084 00000 n 
+0001031202 00000 n 
+0001031261 00000 n 
+0001031320 00000 n 
+0001031436 00000 n 
+0001034891 00000 n 
+0001035078 00000 n 
+0001039951 00000 n 
+0001035266 00000 n 
+0001036193 00000 n 
+0001034729 00000 n 
+0001031726 00000 n 
+0001035431 00000 n 
+0001035489 00000 n 
+0001035548 00000 n 
+0001035666 00000 n 
+0001035725 00000 n 
+0001035783 00000 n 
+0001035900 00000 n 
+0001035959 00000 n 
+0001036018 00000 n 
+0001036135 00000 n 
+0004462729 00000 n 
+0001040120 00000 n 
+0001040286 00000 n 
+0001040471 00000 n 
+0001040652 00000 n 
+0001040833 00000 n 
+0001041019 00000 n 
+0001041770 00000 n 
+0001039753 00000 n 
+0001036424 00000 n 
+0001041184 00000 n 
+0001041242 00000 n 
+0001041360 00000 n 
+0001041419 00000 n 
+0001041478 00000 n 
+0001041595 00000 n 
+0001041654 00000 n 
+0001045252 00000 n 
+0001045419 00000 n 
+0001045588 00000 n 
+0001050402 00000 n 
+0001045755 00000 n 
+0001046684 00000 n 
+0001045081 00000 n 
+0001041964 00000 n 
+0001045920 00000 n 
+0001045978 00000 n 
+0001046037 00000 n 
+0001046155 00000 n 
+0001046214 00000 n 
+0001046273 00000 n 
+0001046391 00000 n 
+0001046450 00000 n 
+0001046509 00000 n 
+0001046626 00000 n 
+0001050570 00000 n 
+0001050740 00000 n 
+0001050908 00000 n 
+0001051088 00000 n 
+0001051841 00000 n 
+0001050222 00000 n 
+0001046878 00000 n 
+0001051253 00000 n 
+0001051311 00000 n 
+0001051370 00000 n 
+0001051488 00000 n 
+0001051547 00000 n 
+0001051606 00000 n 
+0001051724 00000 n 
+0001051782 00000 n 
+0001055731 00000 n 
+0001055916 00000 n 
+0001056100 00000 n 
+0001056975 00000 n 
+0001055569 00000 n 
+0001052062 00000 n 
+0001056265 00000 n 
+0001056382 00000 n 
+0001056441 00000 n 
+0001056558 00000 n 
+0001056680 00000 n 
+0001056739 00000 n 
+0001056798 00000 n 
+0001056916 00000 n 
+0001060562 00000 n 
+0001060754 00000 n 
+0001060958 00000 n 
+0001061162 00000 n 
+0001061367 00000 n 
+0001061558 00000 n 
+0001061772 00000 n 
+0001061942 00000 n 
+0001062762 00000 n 
+0001060355 00000 n 
+0001057231 00000 n 
+0001062107 00000 n 
+0001062165 00000 n 
+0001062283 00000 n 
+0001062342 00000 n 
+0001062465 00000 n 
+0001062524 00000 n 
+0001062583 00000 n 
+0001062704 00000 n 
+0001066602 00000 n 
+0001066787 00000 n 
+0001067157 00000 n 
+0001067328 00000 n 
+0001068146 00000 n 
+0001066422 00000 n 
+0001062968 00000 n 
+0001067493 00000 n 
+0001067551 00000 n 
+0001067610 00000 n 
+0001066971 00000 n 
+0001067733 00000 n 
+0001067792 00000 n 
+0001067910 00000 n 
+0001067969 00000 n 
+0001068087 00000 n 
+0004462855 00000 n 
+0001074213 00000 n 
+0001077593 00000 n 
+0001071276 00000 n 
+0001072083 00000 n 
+0001071132 00000 n 
+0001068353 00000 n 
+0001071441 00000 n 
+0001071558 00000 n 
+0001071676 00000 n 
+0001071735 00000 n 
+0001071851 00000 n 
+0001071910 00000 n 
+0001077661 00000 n 
+0001077885 00000 n 
+0001078090 00000 n 
+0001078295 00000 n 
+0001078534 00000 n 
+0001078758 00000 n 
+0001078954 00000 n 
+0001079178 00000 n 
+0001079374 00000 n 
+0001079567 00000 n 
+0001079790 00000 n 
+0001079984 00000 n 
+0001080208 00000 n 
+0001080403 00000 n 
+0001080596 00000 n 
+0001080818 00000 n 
+0001081012 00000 n 
+0001081236 00000 n 
+0001081432 00000 n 
+0001081624 00000 n 
+0001081848 00000 n 
+0001082041 00000 n 
+0001082246 00000 n 
+0001082722 00000 n 
+0001082945 00000 n 
+0001083125 00000 n 
+0001083310 00000 n 
+0001083514 00000 n 
+0001083989 00000 n 
+0001084213 00000 n 
+0001084400 00000 n 
+0001084605 00000 n 
+0001085081 00000 n 
+0001085303 00000 n 
+0001085495 00000 n 
+0001085697 00000 n 
+0001089666 00000 n 
+0001089889 00000 n 
+0001090070 00000 n 
+0001090274 00000 n 
+0001086170 00000 n 
+0001086452 00000 n 
+0001073693 00000 n 
+0001072264 00000 n 
+0001086335 00000 n 
+0001086393 00000 n 
+0001082484 00000 n 
+0001083751 00000 n 
+0001084843 00000 n 
+0001085934 00000 n 
+0001074969 00000 n 
+0001075100 00000 n 
+0001075250 00000 n 
+0001075518 00000 n 
+0001075896 00000 n 
+0001076134 00000 n 
+0001076156 00000 n 
+0001077570 00000 n 
+0001094651 00000 n 
+0001097720 00000 n 
+0001097960 00000 n 
+0001098195 00000 n 
+0001098431 00000 n 
+0001101474 00000 n 
+0001101651 00000 n 
+0001101828 00000 n 
+0001102005 00000 n 
+0001105193 00000 n 
+0001105370 00000 n 
+0001090512 00000 n 
+0001090735 00000 n 
+0001090924 00000 n 
+0001091127 00000 n 
+0001091365 00000 n 
+0001091555 00000 n 
+0001091780 00000 n 
+0001091970 00000 n 
+0001092160 00000 n 
+0001092385 00000 n 
+0001092577 00000 n 
+0001092801 00000 n 
+0001093026 00000 n 
+0001093217 00000 n 
+0001093442 00000 n 
+0001093633 00000 n 
+0001093823 00000 n 
+0001094016 00000 n 
+0001094826 00000 n 
+0001089333 00000 n 
+0001086661 00000 n 
+0001094181 00000 n 
+0001094239 00000 n 
+0001094298 00000 n 
+0001094357 00000 n 
+0001094416 00000 n 
+0001094474 00000 n 
+0001094533 00000 n 
+0001094592 00000 n 
+0001094710 00000 n 
+0001094769 00000 n 
+0001105547 00000 n 
+0001112914 00000 n 
+0001113090 00000 n 
+0001097438 00000 n 
+0001098547 00000 n 
+0001097294 00000 n 
+0001095062 00000 n 
+0001097603 00000 n 
+0001097661 00000 n 
+0001097784 00000 n 
+0001097843 00000 n 
+0001097902 00000 n 
+0001098018 00000 n 
+0001098077 00000 n 
+0001098136 00000 n 
+0001098254 00000 n 
+0001098313 00000 n 
+0001098372 00000 n 
+0001098489 00000 n 
+0001101133 00000 n 
+0001102121 00000 n 
+0001100989 00000 n 
+0001098715 00000 n 
+0001101298 00000 n 
+0001101356 00000 n 
+0001101415 00000 n 
+0001101533 00000 n 
+0001101592 00000 n 
+0001101710 00000 n 
+0001101769 00000 n 
+0001101887 00000 n 
+0001101946 00000 n 
+0001102063 00000 n 
+0001104852 00000 n 
+0001105665 00000 n 
+0001104708 00000 n 
+0001102289 00000 n 
+0001105017 00000 n 
+0001105075 00000 n 
+0001105134 00000 n 
+0001105252 00000 n 
+0001105311 00000 n 
+0001105429 00000 n 
+0001105488 00000 n 
+0001105606 00000 n 
+0004462981 00000 n 
+0001108256 00000 n 
+0001112564 00000 n 
+0001116011 00000 n 
+0001116214 00000 n 
+0001116452 00000 n 
+0001112632 00000 n 
+0001113384 00000 n 
+0001108096 00000 n 
+0001105847 00000 n 
+0001112797 00000 n 
+0001112855 00000 n 
+0001112972 00000 n 
+0001113031 00000 n 
+0001113149 00000 n 
+0001113208 00000 n 
+0001109198 00000 n 
+0001109329 00000 n 
+0001109479 00000 n 
+0001109803 00000 n 
+0001110240 00000 n 
+0001110478 00000 n 
+0001110500 00000 n 
+0001112541 00000 n 
+0001116696 00000 n 
+0001116899 00000 n 
+0001117103 00000 n 
+0001117341 00000 n 
+0001117584 00000 n 
+0001117788 00000 n 
+0001117992 00000 n 
+0001118231 00000 n 
+0001118476 00000 n 
+0001118681 00000 n 
+0001118923 00000 n 
+0001119160 00000 n 
+0001119397 00000 n 
+0001119636 00000 n 
+0001119881 00000 n 
+0001120092 00000 n 
+0001120337 00000 n 
+0001120542 00000 n 
+0001120787 00000 n 
+0001121656 00000 n 
+0001115678 00000 n 
+0001113606 00000 n 
+0001120952 00000 n 
+0001121010 00000 n 
+0001121069 00000 n 
+0001121128 00000 n 
+0001121186 00000 n 
+0001121245 00000 n 
+0001121303 00000 n 
+0001121362 00000 n 
+0001121421 00000 n 
+0001121480 00000 n 
+0001121539 00000 n 
+0001121598 00000 n 
+0001690832 00000 n 
+0001694897 00000 n 
+0001695013 00000 n 
+0001126780 00000 n 
+0001125306 00000 n 
+0001125783 00000 n 
+0001126260 00000 n 
+0001126498 00000 n 
+0001127072 00000 n 
+0001125117 00000 n 
+0001121878 00000 n 
+0001126663 00000 n 
+0004453874 00000 n 
+0001125545 00000 n 
+0001126022 00000 n 
+0001126721 00000 n 
+0001126839 00000 n 
+0001126898 00000 n 
+0001702911 00000 n 
+0001708791 00000 n 
+0001695195 00000 n 
+0001129538 00000 n 
+0001129765 00000 n 
+0001129968 00000 n 
+0001130194 00000 n 
+0001130421 00000 n 
+0001130648 00000 n 
+0001130841 00000 n 
+0001131068 00000 n 
+0001131261 00000 n 
+0001131466 00000 n 
+0001131658 00000 n 
+0001131885 00000 n 
+0001132090 00000 n 
+0001132315 00000 n 
+0001135536 00000 n 
+0001135763 00000 n 
+0001135968 00000 n 
+0001136195 00000 n 
+0001132518 00000 n 
+0001133560 00000 n 
+0001129268 00000 n 
+0001127370 00000 n 
+0001132683 00000 n 
+0001132741 00000 n 
+0001132917 00000 n 
+0001132976 00000 n 
+0001133152 00000 n 
+0001133209 00000 n 
+0001133266 00000 n 
+0001133325 00000 n 
+0001133384 00000 n 
+0001133443 00000 n 
+0001133502 00000 n 
+0001169355 00000 n 
+0001136399 00000 n 
+0001136625 00000 n 
+0001136829 00000 n 
+0001137056 00000 n 
+0001137261 00000 n 
+0001137488 00000 n 
+0001137693 00000 n 
+0001137920 00000 n 
+0001138125 00000 n 
+0001138351 00000 n 
+0001138555 00000 n 
+0001138782 00000 n 
+0001138987 00000 n 
+0001139214 00000 n 
+0001139418 00000 n 
+0001139645 00000 n 
+0001139849 00000 n 
+0001140076 00000 n 
+0001140281 00000 n 
+0001140507 00000 n 
+0001140711 00000 n 
+0001140938 00000 n 
+0001141143 00000 n 
+0001141370 00000 n 
+0001141575 00000 n 
+0001141802 00000 n 
+0001142007 00000 n 
+0001142234 00000 n 
+0001142439 00000 n 
+0001142665 00000 n 
+0001142857 00000 n 
+0001143049 00000 n 
+0001143276 00000 n 
+0001143503 00000 n 
+0001143730 00000 n 
+0001143956 00000 n 
+0001144183 00000 n 
+0001144409 00000 n 
+0001148380 00000 n 
+0001148607 00000 n 
+0001148834 00000 n 
+0001149061 00000 n 
+0001144634 00000 n 
+0001146269 00000 n 
+0001135014 00000 n 
+0001133768 00000 n 
+0001144799 00000 n 
+0001144857 00000 n 
+0001144916 00000 n 
+0001144975 00000 n 
+0001145034 00000 n 
+0001145093 00000 n 
+0001145152 00000 n 
+0001145210 00000 n 
+0001145269 00000 n 
+0001145328 00000 n 
+0001145387 00000 n 
+0001145446 00000 n 
+0001145505 00000 n 
+0001145564 00000 n 
+0001145623 00000 n 
+0001145682 00000 n 
+0001145740 00000 n 
+0001145799 00000 n 
+0001145858 00000 n 
+0001145917 00000 n 
+0001145976 00000 n 
+0001146034 00000 n 
+0001146093 00000 n 
+0001146152 00000 n 
+0001146211 00000 n 
+0001149288 00000 n 
+0001149515 00000 n 
+0001149741 00000 n 
+0001149968 00000 n 
+0001150194 00000 n 
+0001150420 00000 n 
+0001150647 00000 n 
+0001150874 00000 n 
+0001151100 00000 n 
+0001151327 00000 n 
+0001151554 00000 n 
+0001151747 00000 n 
+0001151974 00000 n 
+0001152167 00000 n 
+0001152356 00000 n 
+0001152579 00000 n 
+0001152772 00000 n 
+0001152998 00000 n 
+0001153191 00000 n 
+0001153384 00000 n 
+0001153610 00000 n 
+0001153801 00000 n 
+0001157258 00000 n 
+0001157451 00000 n 
+0001157677 00000 n 
+0001157870 00000 n 
+0001158062 00000 n 
+0001158287 00000 n 
+0001158479 00000 n 
+0001154025 00000 n 
+0001155367 00000 n 
+0001148002 00000 n 
+0001146449 00000 n 
+0001154190 00000 n 
+0001154248 00000 n 
+0001154307 00000 n 
+0001154366 00000 n 
+0001154425 00000 n 
+0001154483 00000 n 
+0001154542 00000 n 
+0001154601 00000 n 
+0001154660 00000 n 
+0001154719 00000 n 
+0001154778 00000 n 
+0001154837 00000 n 
+0001154896 00000 n 
+0001154955 00000 n 
+0001155014 00000 n 
+0001155073 00000 n 
+0001155132 00000 n 
+0001155191 00000 n 
+0001155250 00000 n 
+0001155309 00000 n 
+0004463107 00000 n 
+0001158705 00000 n 
+0001158898 00000 n 
+0001159125 00000 n 
+0001159317 00000 n 
+0001159510 00000 n 
+0001159737 00000 n 
+0001159930 00000 n 
+0001160157 00000 n 
+0001160350 00000 n 
+0001160577 00000 n 
+0001160770 00000 n 
+0001160963 00000 n 
+0001161190 00000 n 
+0001161382 00000 n 
+0001161609 00000 n 
+0001161802 00000 n 
+0001162028 00000 n 
+0001162221 00000 n 
+0001162414 00000 n 
+0001162640 00000 n 
+0001162833 00000 n 
+0001163058 00000 n 
+0001163250 00000 n 
+0001163475 00000 n 
+0001163668 00000 n 
+0001163895 00000 n 
+0001164088 00000 n 
+0001164315 00000 n 
+0001164505 00000 n 
+0001164729 00000 n 
+0001165893 00000 n 
+0001156790 00000 n 
+0001155547 00000 n 
+0001164894 00000 n 
+0001164952 00000 n 
+0001165011 00000 n 
+0001165070 00000 n 
+0001165129 00000 n 
+0001165188 00000 n 
+0001165246 00000 n 
+0001165305 00000 n 
+0001165364 00000 n 
+0001165423 00000 n 
+0001165482 00000 n 
+0001165540 00000 n 
+0001165599 00000 n 
+0001165658 00000 n 
+0001165717 00000 n 
+0001165776 00000 n 
+0001165834 00000 n 
+0001168352 00000 n 
+0001168584 00000 n 
+0001168769 00000 n 
+0001171665 00000 n 
+0001171908 00000 n 
+0001172105 00000 n 
+0001168955 00000 n 
+0001169883 00000 n 
+0001168181 00000 n 
+0001166073 00000 n 
+0001169120 00000 n 
+0001169178 00000 n 
+0001169237 00000 n 
+0001169296 00000 n 
+0001169414 00000 n 
+0001169590 00000 n 
+0001169649 00000 n 
+0001169708 00000 n 
+0001172302 00000 n 
+0001172542 00000 n 
+0001172736 00000 n 
+0001172930 00000 n 
+0001173112 00000 n 
+0001173352 00000 n 
+0001173546 00000 n 
+0001177283 00000 n 
+0001177465 00000 n 
+0001173740 00000 n 
+0001174665 00000 n 
+0001171431 00000 n 
+0001170092 00000 n 
+0001173905 00000 n 
+0001173963 00000 n 
+0001174022 00000 n 
+0001174081 00000 n 
+0001174256 00000 n 
+0001174315 00000 n 
+0001174374 00000 n 
+0001174549 00000 n 
+0001174607 00000 n 
+0001177647 00000 n 
+0001177879 00000 n 
+0001178072 00000 n 
+0001178260 00000 n 
+0001178465 00000 n 
+0001178655 00000 n 
+0001178845 00000 n 
+0001179076 00000 n 
+0001179269 00000 n 
+0001179456 00000 n 
+0001179661 00000 n 
+0001179851 00000 n 
+0001180041 00000 n 
+0001180273 00000 n 
+0001180466 00000 n 
+0001180654 00000 n 
+0001180859 00000 n 
+0001181049 00000 n 
+0001181239 00000 n 
+0001181470 00000 n 
+0001181664 00000 n 
+0001181852 00000 n 
+0001182057 00000 n 
+0001182247 00000 n 
+0001182437 00000 n 
+0001182669 00000 n 
+0001182860 00000 n 
+0001183047 00000 n 
+0001183252 00000 n 
+0001183442 00000 n 
+0001183632 00000 n 
+0001183864 00000 n 
+0001184061 00000 n 
+0001184249 00000 n 
+0001184454 00000 n 
+0001184643 00000 n 
+0001184833 00000 n 
+0001185350 00000 n 
+0001176797 00000 n 
+0001174846 00000 n 
+0001184998 00000 n 
+0001185056 00000 n 
+0001185232 00000 n 
+0001185291 00000 n 
+0001190148 00000 n 
+0001190384 00000 n 
+0001195824 00000 n 
+0001205862 00000 n 
+0001211279 00000 n 
+0001211520 00000 n 
+0001189293 00000 n 
+0001189490 00000 n 
+0001189678 00000 n 
+0001189866 00000 n 
+0001190505 00000 n 
+0001189122 00000 n 
+0001185530 00000 n 
+0001190031 00000 n 
+0001190089 00000 n 
+0001190207 00000 n 
+0001190266 00000 n 
+0001190325 00000 n 
+0001190447 00000 n 
+0001194909 00000 n 
+0001195106 00000 n 
+0001195294 00000 n 
+0001195483 00000 n 
+0001195947 00000 n 
+0001194738 00000 n 
+0001190803 00000 n 
+0001195648 00000 n 
+0001195706 00000 n 
+0001195765 00000 n 
+0001195888 00000 n 
+0004463233 00000 n 
+0001199578 00000 n 
+0001199775 00000 n 
+0001204875 00000 n 
+0001205065 00000 n 
+0001199963 00000 n 
+0001200304 00000 n 
+0001199416 00000 n 
+0001196245 00000 n 
+0001200128 00000 n 
+0001200186 00000 n 
+0001200245 00000 n 
+0001205254 00000 n 
+0001205451 00000 n 
+0001205639 00000 n 
+0001206103 00000 n 
+0001204695 00000 n 
+0001200587 00000 n 
+0001205804 00000 n 
+0001205926 00000 n 
+0001205985 00000 n 
+0001206044 00000 n 
+0001210094 00000 n 
+0001210284 00000 n 
+0001210474 00000 n 
+0001210671 00000 n 
+0001210859 00000 n 
+0001211056 00000 n 
+0001211693 00000 n 
+0001209905 00000 n 
+0001206401 00000 n 
+0001211221 00000 n 
+0001211343 00000 n 
+0001211402 00000 n 
+0001211461 00000 n 
+0001211579 00000 n 
+0001211634 00000 n 
+0001214709 00000 n 
+0001214897 00000 n 
+0001215098 00000 n 
+0001215337 00000 n 
+0001215548 00000 n 
+0001215788 00000 n 
+0001216028 00000 n 
+0001216267 00000 n 
+0001216506 00000 n 
+0001217434 00000 n 
+0001214493 00000 n 
+0001211965 00000 n 
+0001216671 00000 n 
+0001216729 00000 n 
+0001216905 00000 n 
+0001216964 00000 n 
+0001217023 00000 n 
+0001217082 00000 n 
+0001217141 00000 n 
+0001217200 00000 n 
+0001217258 00000 n 
+0001217317 00000 n 
+0001220184 00000 n 
+0001220421 00000 n 
+0001220659 00000 n 
+0001220862 00000 n 
+0001221100 00000 n 
+0001221304 00000 n 
+0001221542 00000 n 
+0001221746 00000 n 
+0001221983 00000 n 
+0001222186 00000 n 
+0001222423 00000 n 
+0001222661 00000 n 
+0001222865 00000 n 
+0001223103 00000 n 
+0001223308 00000 n 
+0001223717 00000 n 
+0001223921 00000 n 
+0001224125 00000 n 
+0001224363 00000 n 
+0001224568 00000 n 
+0001225681 00000 n 
+0001219860 00000 n 
+0001217723 00000 n 
+0001224733 00000 n 
+0001224849 00000 n 
+0001224908 00000 n 
+0001224967 00000 n 
+0001225026 00000 n 
+0001225085 00000 n 
+0001225143 00000 n 
+0001223513 00000 n 
+0001225201 00000 n 
+0001225260 00000 n 
+0001225319 00000 n 
+0001225377 00000 n 
+0001225436 00000 n 
+0001225495 00000 n 
+0001225559 00000 n 
+0001225618 00000 n 
+0001233664 00000 n 
+0001228367 00000 n 
+0001228562 00000 n 
+0001228783 00000 n 
+0001229004 00000 n 
+0001229209 00000 n 
+0001229430 00000 n 
+0001229650 00000 n 
+0001229837 00000 n 
+0001230058 00000 n 
+0001230246 00000 n 
+0001230451 00000 n 
+0001230672 00000 n 
+0001230860 00000 n 
+0001231065 00000 n 
+0001231287 00000 n 
+0001231508 00000 n 
+0001231695 00000 n 
+0001231917 00000 n 
+0001232105 00000 n 
+0001232309 00000 n 
+0001232531 00000 n 
+0001232753 00000 n 
+0001232958 00000 n 
+0001233161 00000 n 
+0001237241 00000 n 
+0001237462 00000 n 
+0001237684 00000 n 
+0001237906 00000 n 
+0001233382 00000 n 
+0001234492 00000 n 
+0001228007 00000 n 
+0001225889 00000 n 
+0001233547 00000 n 
+0001233605 00000 n 
+0001233728 00000 n 
+0001233904 00000 n 
+0001233963 00000 n 
+0001234022 00000 n 
+0001234081 00000 n 
+0001234140 00000 n 
+0001234199 00000 n 
+0001234258 00000 n 
+0001234317 00000 n 
+0001234376 00000 n 
+0001234433 00000 n 
+0004463359 00000 n 
+0001298461 00000 n 
+0001279451 00000 n 
+0001279569 00000 n 
+0001238092 00000 n 
+0001238314 00000 n 
+0001238536 00000 n 
+0001238758 00000 n 
+0001238980 00000 n 
+0001239167 00000 n 
+0001239389 00000 n 
+0001239611 00000 n 
+0001239833 00000 n 
+0001240055 00000 n 
+0001240277 00000 n 
+0001240481 00000 n 
+0001240703 00000 n 
+0001240906 00000 n 
+0001241127 00000 n 
+0001241349 00000 n 
+0001241571 00000 n 
+0001241793 00000 n 
+0001242014 00000 n 
+0001242236 00000 n 
+0001242458 00000 n 
+0001242646 00000 n 
+0001242867 00000 n 
+0001243055 00000 n 
+0001243260 00000 n 
+0001243481 00000 n 
+0001243669 00000 n 
+0001243874 00000 n 
+0001244078 00000 n 
+0001244299 00000 n 
+0001244486 00000 n 
+0001244691 00000 n 
+0001244896 00000 n 
+0001245339 00000 n 
+0001245560 00000 n 
+0001245756 00000 n 
+0001245948 00000 n 
+0001246143 00000 n 
+0001246363 00000 n 
+0001246548 00000 n 
+0001250309 00000 n 
+0001250531 00000 n 
+0001250736 00000 n 
+0001250956 00000 n 
+0001251142 00000 n 
+0001251347 00000 n 
+0001246733 00000 n 
+0001247779 00000 n 
+0001236692 00000 n 
+0001234700 00000 n 
+0001246898 00000 n 
+0001246956 00000 n 
+0001247015 00000 n 
+0001247073 00000 n 
+0001247132 00000 n 
+0001247191 00000 n 
+0001247249 00000 n 
+0001247308 00000 n 
+0001247367 00000 n 
+0001247426 00000 n 
+0001247484 00000 n 
+0001247543 00000 n 
+0001247602 00000 n 
+0001247661 00000 n 
+0001245118 00000 n 
+0001247720 00000 n 
+0001284053 00000 n 
+0001284228 00000 n 
+0001287606 00000 n 
+0001287729 00000 n 
+0001287852 00000 n 
+0001287970 00000 n 
+0001288088 00000 n 
+0001283577 00000 n 
+0001283695 00000 n 
+0001283813 00000 n 
+0001251569 00000 n 
+0001251791 00000 n 
+0001252013 00000 n 
+0001252218 00000 n 
+0001252440 00000 n 
+0001252628 00000 n 
+0001252848 00000 n 
+0001253070 00000 n 
+0001253257 00000 n 
+0001253478 00000 n 
+0001253666 00000 n 
+0001253888 00000 n 
+0001254076 00000 n 
+0001254298 00000 n 
+0001254494 00000 n 
+0001254690 00000 n 
+0001255099 00000 n 
+0001255321 00000 n 
+0001255507 00000 n 
+0001255728 00000 n 
+0001255923 00000 n 
+0001256331 00000 n 
+0001256552 00000 n 
+0001256738 00000 n 
+0001256959 00000 n 
+0001257154 00000 n 
+0001257562 00000 n 
+0001257783 00000 n 
+0001257988 00000 n 
+0001258210 00000 n 
+0001258449 00000 n 
+0001258669 00000 n 
+0001258856 00000 n 
+0001259043 00000 n 
+0001259265 00000 n 
+0001259453 00000 n 
+0001259641 00000 n 
+0001259861 00000 n 
+0001264204 00000 n 
+0001264391 00000 n 
+0001264612 00000 n 
+0001264808 00000 n 
+0001265004 00000 n 
+0001265191 00000 n 
+0001265412 00000 n 
+0001260047 00000 n 
+0001260919 00000 n 
+0001249742 00000 n 
+0001247962 00000 n 
+0001260212 00000 n 
+0001260270 00000 n 
+0001260329 00000 n 
+0001260388 00000 n 
+0001260447 00000 n 
+0001260506 00000 n 
+0001260565 00000 n 
+0001260624 00000 n 
+0001254895 00000 n 
+0001260683 00000 n 
+0001256127 00000 n 
+0001260742 00000 n 
+0001257358 00000 n 
+0001260801 00000 n 
+0001260860 00000 n 
+0001288211 00000 n 
+0001288334 00000 n 
+0001288457 00000 n 
+0001291480 00000 n 
+0001291603 00000 n 
+0001291785 00000 n 
+0001291903 00000 n 
+0001292021 00000 n 
+0001265608 00000 n 
+0001265795 00000 n 
+0001266016 00000 n 
+0001266204 00000 n 
+0001266391 00000 n 
+0001266612 00000 n 
+0001266800 00000 n 
+0001267022 00000 n 
+0001267210 00000 n 
+0001267397 00000 n 
+0001267584 00000 n 
+0001267805 00000 n 
+0001268001 00000 n 
+0001268197 00000 n 
+0001268383 00000 n 
+0001268603 00000 n 
+0001268798 00000 n 
+0001268984 00000 n 
+0001269204 00000 n 
+0001269391 00000 n 
+0001269578 00000 n 
+0001269799 00000 n 
+0001269987 00000 n 
+0001270208 00000 n 
+0001270396 00000 n 
+0001270584 00000 n 
+0001270806 00000 n 
+0001270994 00000 n 
+0001271182 00000 n 
+0001271404 00000 n 
+0001271592 00000 n 
+0001271779 00000 n 
+0001271965 00000 n 
+0001275673 00000 n 
+0001275894 00000 n 
+0001276115 00000 n 
+0001276337 00000 n 
+0001272186 00000 n 
+0001272468 00000 n 
+0001263700 00000 n 
+0001261128 00000 n 
+0001272351 00000 n 
+0001272409 00000 n 
+0001292139 00000 n 
+0001292257 00000 n 
+0001292375 00000 n 
+0001292493 00000 n 
+0001292616 00000 n 
+0001276559 00000 n 
+0001276781 00000 n 
+0001277011 00000 n 
+0001277233 00000 n 
+0001277463 00000 n 
+0001277685 00000 n 
+0001277907 00000 n 
+0001278112 00000 n 
+0001278316 00000 n 
+0001278538 00000 n 
+0001278760 00000 n 
+0001278982 00000 n 
+0001279169 00000 n 
+0001279627 00000 n 
+0001275385 00000 n 
+0001272752 00000 n 
+0001279334 00000 n 
+0001279392 00000 n 
+0001279510 00000 n 
+0002357336 00000 n 
+0001282470 00000 n 
+0001282658 00000 n 
+0001282853 00000 n 
+0001283040 00000 n 
+0001283236 00000 n 
+0001284344 00000 n 
+0001282290 00000 n 
+0001279845 00000 n 
+0001283401 00000 n 
+0001283459 00000 n 
+0001283518 00000 n 
+0001283636 00000 n 
+0001283754 00000 n 
+0001283877 00000 n 
+0001283936 00000 n 
+0001283995 00000 n 
+0001284112 00000 n 
+0001284171 00000 n 
+0001284286 00000 n 
+0001287383 00000 n 
+0001288580 00000 n 
+0001287239 00000 n 
+0001284525 00000 n 
+0001287548 00000 n 
+0001287670 00000 n 
+0001287793 00000 n 
+0001287911 00000 n 
+0001288029 00000 n 
+0001288152 00000 n 
+0001288275 00000 n 
+0001288398 00000 n 
+0001288521 00000 n 
+0004463485 00000 n 
+0001291257 00000 n 
+0001292851 00000 n 
+0001291113 00000 n 
+0001288823 00000 n 
+0001291422 00000 n 
+0001291544 00000 n 
+0001291667 00000 n 
+0001291726 00000 n 
+0001291844 00000 n 
+0001291962 00000 n 
+0001292080 00000 n 
+0001292198 00000 n 
+0001292316 00000 n 
+0001292434 00000 n 
+0001292557 00000 n 
+0001292675 00000 n 
+0001292734 00000 n 
+0001292793 00000 n 
+0001295367 00000 n 
+0001295582 00000 n 
+0001295811 00000 n 
+0001296016 00000 n 
+0001296244 00000 n 
+0001296448 00000 n 
+0001296651 00000 n 
+0001296880 00000 n 
+0001297066 00000 n 
+0001297271 00000 n 
+0001297498 00000 n 
+0001297682 00000 n 
+0001301771 00000 n 
+0001302000 00000 n 
+0001302194 00000 n 
+0001297884 00000 n 
+0001298988 00000 n 
+0001295115 00000 n 
+0001293043 00000 n 
+0001298049 00000 n 
+0001298107 00000 n 
+0001298166 00000 n 
+0001298225 00000 n 
+0001298284 00000 n 
+0001298343 00000 n 
+0001298402 00000 n 
+0001298520 00000 n 
+0001298695 00000 n 
+0001298754 00000 n 
+0001298812 00000 n 
+0001298870 00000 n 
+0001298929 00000 n 
+0001332612 00000 n 
+0001302399 00000 n 
+0001302628 00000 n 
+0001302822 00000 n 
+0001303047 00000 n 
+0001303237 00000 n 
+0001303438 00000 n 
+0001303667 00000 n 
+0001303862 00000 n 
+0001304092 00000 n 
+0001304288 00000 n 
+0001304491 00000 n 
+0001304720 00000 n 
+0001304950 00000 n 
+0001305155 00000 n 
+0001305359 00000 n 
+0001305589 00000 n 
+0001305819 00000 n 
+0001306015 00000 n 
+0001306244 00000 n 
+0001306474 00000 n 
+0001306704 00000 n 
+0001306892 00000 n 
+0001307122 00000 n 
+0001307309 00000 n 
+0001307502 00000 n 
+0001307732 00000 n 
+0001307920 00000 n 
+0001308150 00000 n 
+0001308346 00000 n 
+0001308575 00000 n 
+0001308769 00000 n 
+0001308961 00000 n 
+0001309191 00000 n 
+0001309405 00000 n 
+0001309635 00000 n 
+0001309850 00000 n 
+0001310065 00000 n 
+0001310279 00000 n 
+0001310509 00000 n 
+0001310724 00000 n 
+0001310954 00000 n 
+0001314937 00000 n 
+0001315167 00000 n 
+0001311183 00000 n 
+0001312350 00000 n 
+0001301231 00000 n 
+0001299184 00000 n 
+0001311348 00000 n 
+0001311406 00000 n 
+0001311465 00000 n 
+0001311524 00000 n 
+0001311583 00000 n 
+0001311642 00000 n 
+0001311701 00000 n 
+0001311760 00000 n 
+0001311819 00000 n 
+0001311878 00000 n 
+0001311937 00000 n 
+0001311996 00000 n 
+0001312055 00000 n 
+0001312114 00000 n 
+0001312173 00000 n 
+0001312232 00000 n 
+0001312291 00000 n 
+0001332789 00000 n 
+0001332965 00000 n 
+0001333083 00000 n 
+0001333206 00000 n 
+0001333388 00000 n 
+0001315397 00000 n 
+0001315627 00000 n 
+0001315856 00000 n 
+0001316060 00000 n 
+0001316290 00000 n 
+0001316493 00000 n 
+0001316722 00000 n 
+0001316925 00000 n 
+0001317154 00000 n 
+0001317357 00000 n 
+0001317586 00000 n 
+0001317816 00000 n 
+0001318012 00000 n 
+0001318242 00000 n 
+0001318447 00000 n 
+0001318677 00000 n 
+0001318862 00000 n 
+0001319091 00000 n 
+0001319277 00000 n 
+0001319463 00000 n 
+0001319693 00000 n 
+0001319898 00000 n 
+0001320102 00000 n 
+0001320331 00000 n 
+0001320527 00000 n 
+0001320757 00000 n 
+0001320987 00000 n 
+0001321183 00000 n 
+0001321413 00000 n 
+0001321635 00000 n 
+0001321864 00000 n 
+0001325855 00000 n 
+0001326084 00000 n 
+0001326279 00000 n 
+0001326475 00000 n 
+0001326705 00000 n 
+0001322056 00000 n 
+0001323222 00000 n 
+0001314496 00000 n 
+0001312574 00000 n 
+0001322221 00000 n 
+0001322279 00000 n 
+0001322338 00000 n 
+0001322397 00000 n 
+0001322456 00000 n 
+0001322515 00000 n 
+0001322574 00000 n 
+0001322633 00000 n 
+0001322692 00000 n 
+0001322751 00000 n 
+0001322809 00000 n 
+0001322868 00000 n 
+0001322927 00000 n 
+0001322986 00000 n 
+0001323045 00000 n 
+0001323104 00000 n 
+0001323163 00000 n 
+0001333506 00000 n 
+0001337232 00000 n 
+0001337413 00000 n 
+0001326901 00000 n 
+0001327131 00000 n 
+0001327327 00000 n 
+0001327523 00000 n 
+0001327753 00000 n 
+0001327949 00000 n 
+0001328145 00000 n 
+0001328340 00000 n 
+0001328528 00000 n 
+0001328758 00000 n 
+0001328988 00000 n 
+0001329329 00000 n 
+0001325576 00000 n 
+0001323431 00000 n 
+0001329153 00000 n 
+0001329211 00000 n 
+0001329270 00000 n 
+0001337595 00000 n 
+0001337713 00000 n 
+0001337831 00000 n 
+0001332135 00000 n 
+0001332330 00000 n 
+0001333627 00000 n 
+0001331982 00000 n 
+0001329532 00000 n 
+0001332495 00000 n 
+0001332553 00000 n 
+0001332671 00000 n 
+0001332730 00000 n 
+0001332848 00000 n 
+0001332906 00000 n 
+0001333024 00000 n 
+0001333147 00000 n 
+0001333270 00000 n 
+0001333329 00000 n 
+0001333447 00000 n 
+0001333569 00000 n 
+0004463611 00000 n 
+0001336950 00000 n 
+0001338128 00000 n 
+0001336806 00000 n 
+0001333845 00000 n 
+0001337115 00000 n 
+0001337173 00000 n 
+0001337295 00000 n 
+0001337354 00000 n 
+0001337477 00000 n 
+0001337536 00000 n 
+0001337654 00000 n 
+0001337772 00000 n 
+0001337895 00000 n 
+0001337954 00000 n 
+0001341184 00000 n 
+0001341417 00000 n 
+0001341651 00000 n 
+0001341884 00000 n 
+0001342089 00000 n 
+0001342782 00000 n 
+0001341004 00000 n 
+0001338371 00000 n 
+0001342254 00000 n 
+0001342312 00000 n 
+0001342371 00000 n 
+0001342430 00000 n 
+0001342488 00000 n 
+0001342546 00000 n 
+0001342605 00000 n 
+0001342664 00000 n 
+0001342723 00000 n 
+0001345020 00000 n 
+0001345263 00000 n 
+0001345471 00000 n 
+0001345679 00000 n 
+0001345922 00000 n 
+0001346130 00000 n 
+0001346372 00000 n 
+0001346579 00000 n 
+0001346820 00000 n 
+0001347027 00000 n 
+0001347269 00000 n 
+0001347477 00000 n 
+0001347720 00000 n 
+0001347928 00000 n 
+0001348171 00000 n 
+0001348379 00000 n 
+0001348622 00000 n 
+0001348830 00000 n 
+0001349073 00000 n 
+0001349260 00000 n 
+0001349503 00000 n 
+0001349690 00000 n 
+0001349932 00000 n 
+0001350174 00000 n 
+0001350383 00000 n 
+0001350626 00000 n 
+0001350835 00000 n 
+0001351998 00000 n 
+0001344642 00000 n 
+0001342990 00000 n 
+0001351000 00000 n 
+0001351058 00000 n 
+0001351232 00000 n 
+0001351291 00000 n 
+0001351350 00000 n 
+0001351408 00000 n 
+0001351467 00000 n 
+0001351526 00000 n 
+0001351585 00000 n 
+0001351644 00000 n 
+0001351703 00000 n 
+0001351762 00000 n 
+0001351821 00000 n 
+0001351880 00000 n 
+0001351939 00000 n 
+0001358198 00000 n 
+0001358375 00000 n 
+0001354412 00000 n 
+0001354665 00000 n 
+0001354918 00000 n 
+0001355136 00000 n 
+0001355389 00000 n 
+0001355608 00000 n 
+0001355862 00000 n 
+0001356081 00000 n 
+0001356274 00000 n 
+0001356528 00000 n 
+0001356721 00000 n 
+0001356975 00000 n 
+0001357193 00000 n 
+0001357446 00000 n 
+0001357664 00000 n 
+0001361725 00000 n 
+0001361978 00000 n 
+0001357916 00000 n 
+0001359198 00000 n 
+0001354133 00000 n 
+0001352206 00000 n 
+0001358081 00000 n 
+0001358139 00000 n 
+0001358257 00000 n 
+0001358316 00000 n 
+0001358434 00000 n 
+0001358493 00000 n 
+0001358668 00000 n 
+0001358727 00000 n 
+0001358786 00000 n 
+0001358845 00000 n 
+0001358904 00000 n 
+0001358963 00000 n 
+0001359022 00000 n 
+0001359080 00000 n 
+0001359139 00000 n 
+0001362198 00000 n 
+0001362451 00000 n 
+0001362670 00000 n 
+0001362888 00000 n 
+0001363288 00000 n 
+0001363526 00000 n 
+0001363730 00000 n 
+0001363966 00000 n 
+0001364204 00000 n 
+0001364409 00000 n 
+0001364613 00000 n 
+0001364851 00000 n 
+0001365054 00000 n 
+0001365292 00000 n 
+0001365490 00000 n 
+0001365695 00000 n 
+0001365934 00000 n 
+0001366139 00000 n 
+0001366342 00000 n 
+0001366580 00000 n 
+0001369879 00000 n 
+0001370083 00000 n 
+0001370322 00000 n 
+0001370519 00000 n 
+0001370723 00000 n 
+0001366783 00000 n 
+0001367359 00000 n 
+0001361374 00000 n 
+0001359392 00000 n 
+0001366948 00000 n 
+0001367006 00000 n 
+0001367065 00000 n 
+0001367124 00000 n 
+0001363089 00000 n 
+0001367300 00000 n 
+0001374662 00000 n 
+0001374780 00000 n 
+0001374962 00000 n 
+0001378210 00000 n 
+0001378392 00000 n 
+0001378632 00000 n 
+0001378809 00000 n 
+0001370962 00000 n 
+0001371165 00000 n 
+0001371402 00000 n 
+0001371606 00000 n 
+0001371844 00000 n 
+0001372048 00000 n 
+0001372287 00000 n 
+0001372525 00000 n 
+0001372729 00000 n 
+0001372968 00000 n 
+0001373206 00000 n 
+0001373411 00000 n 
+0001373650 00000 n 
+0001373855 00000 n 
+0001374060 00000 n 
+0001374264 00000 n 
+0001375085 00000 n 
+0001369555 00000 n 
+0001367567 00000 n 
+0001374429 00000 n 
+0001374487 00000 n 
+0001374545 00000 n 
+0001374604 00000 n 
+0001374721 00000 n 
+0001374844 00000 n 
+0001374903 00000 n 
+0001375026 00000 n 
+0004463737 00000 n 
+0001378991 00000 n 
+0001381711 00000 n 
+0001381834 00000 n 
+0001381957 00000 n 
+0001382079 00000 n 
+0001382202 00000 n 
+0001382325 00000 n 
+0001382502 00000 n 
+0001377519 00000 n 
+0001377724 00000 n 
+0001377928 00000 n 
+0001379111 00000 n 
+0001377357 00000 n 
+0001375320 00000 n 
+0001378093 00000 n 
+0001378151 00000 n 
+0001378274 00000 n 
+0001378333 00000 n 
+0001378456 00000 n 
+0001378515 00000 n 
+0001378574 00000 n 
+0001378691 00000 n 
+0001378750 00000 n 
+0001378873 00000 n 
+0001378932 00000 n 
+0001379053 00000 n 
+0001381429 00000 n 
+0001382618 00000 n 
+0001381285 00000 n 
+0001379317 00000 n 
+0001381594 00000 n 
+0001381652 00000 n 
+0001381775 00000 n 
+0001381898 00000 n 
+0001382020 00000 n 
+0001382143 00000 n 
+0001382266 00000 n 
+0001382384 00000 n 
+0001382443 00000 n 
+0001382560 00000 n 
+0001385375 00000 n 
+0001385628 00000 n 
+0001385883 00000 n 
+0001386138 00000 n 
+0001386393 00000 n 
+0001386577 00000 n 
+0001386830 00000 n 
+0001387085 00000 n 
+0001387960 00000 n 
+0001385168 00000 n 
+0001382824 00000 n 
+0001387250 00000 n 
+0001387308 00000 n 
+0001387484 00000 n 
+0001387543 00000 n 
+0001387602 00000 n 
+0001387661 00000 n 
+0001387720 00000 n 
+0001387779 00000 n 
+0001387838 00000 n 
+0001387897 00000 n 
+0001394139 00000 n 
+0001394262 00000 n 
+0001394385 00000 n 
+0001390871 00000 n 
+0001391119 00000 n 
+0001391334 00000 n 
+0001391582 00000 n 
+0001391795 00000 n 
+0001392044 00000 n 
+0001392259 00000 n 
+0001392473 00000 n 
+0001392722 00000 n 
+0001392936 00000 n 
+0001393150 00000 n 
+0001393399 00000 n 
+0001393611 00000 n 
+0001397157 00000 n 
+0001393857 00000 n 
+0001394737 00000 n 
+0001390610 00000 n 
+0001388197 00000 n 
+0001394022 00000 n 
+0001394080 00000 n 
+0001394203 00000 n 
+0001394326 00000 n 
+0001394444 00000 n 
+0001394503 00000 n 
+0001394678 00000 n 
+0001400795 00000 n 
+0001400913 00000 n 
+0001401154 00000 n 
+0001403995 00000 n 
+0001404175 00000 n 
+0001404298 00000 n 
+0001397405 00000 n 
+0001397590 00000 n 
+0001397839 00000 n 
+0001398087 00000 n 
+0001398302 00000 n 
+0001398551 00000 n 
+0001398766 00000 n 
+0001399015 00000 n 
+0001399230 00000 n 
+0001399445 00000 n 
+0001399694 00000 n 
+0001399909 00000 n 
+0001400124 00000 n 
+0001400339 00000 n 
+0001401272 00000 n 
+0001396887 00000 n 
+0001394960 00000 n 
+0001400504 00000 n 
+0001400562 00000 n 
+0001400621 00000 n 
+0001400679 00000 n 
+0001400738 00000 n 
+0001400854 00000 n 
+0001400977 00000 n 
+0001401036 00000 n 
+0001401095 00000 n 
+0001401213 00000 n 
+0001404421 00000 n 
+0001404544 00000 n 
+0001404721 00000 n 
+0001411878 00000 n 
+0001403713 00000 n 
+0001404839 00000 n 
+0001403569 00000 n 
+0001401507 00000 n 
+0001403878 00000 n 
+0001403936 00000 n 
+0001404058 00000 n 
+0001404117 00000 n 
+0001404239 00000 n 
+0001404362 00000 n 
+0001404485 00000 n 
+0001404603 00000 n 
+0001404662 00000 n 
+0001404780 00000 n 
+0004463863 00000 n 
+0001407181 00000 n 
+0001407429 00000 n 
+0001407676 00000 n 
+0001407888 00000 n 
+0001408136 00000 n 
+0001408350 00000 n 
+0001408599 00000 n 
+0001408813 00000 n 
+0001409001 00000 n 
+0001409250 00000 n 
+0001409438 00000 n 
+0001409687 00000 n 
+0001409901 00000 n 
+0001410150 00000 n 
+0001410364 00000 n 
+0001410612 00000 n 
+0001410860 00000 n 
+0001411075 00000 n 
+0001411323 00000 n 
+0001411537 00000 n 
+0001412818 00000 n 
+0001406866 00000 n 
+0001405045 00000 n 
+0001411702 00000 n 
+0001411760 00000 n 
+0001411819 00000 n 
+0001411936 00000 n 
+0001411994 00000 n 
+0001412170 00000 n 
+0001412229 00000 n 
+0001412288 00000 n 
+0001412347 00000 n 
+0001412406 00000 n 
+0001412465 00000 n 
+0001412524 00000 n 
+0001412583 00000 n 
+0001412641 00000 n 
+0001412700 00000 n 
+0001412759 00000 n 
+0001415505 00000 n 
+0001415719 00000 n 
+0001416110 00000 n 
+0001416346 00000 n 
+0001416616 00000 n 
+0001416886 00000 n 
+0001417156 00000 n 
+0001417426 00000 n 
+0001417612 00000 n 
+0001417883 00000 n 
+0001418154 00000 n 
+0001418390 00000 n 
+0001419205 00000 n 
+0001415253 00000 n 
+0001413041 00000 n 
+0001418555 00000 n 
+0001418613 00000 n 
+0001415915 00000 n 
+0001418789 00000 n 
+0001418847 00000 n 
+0001418906 00000 n 
+0001418965 00000 n 
+0001419024 00000 n 
+0001419083 00000 n 
+0001419142 00000 n 
+0001422148 00000 n 
+0001422271 00000 n 
+0001422394 00000 n 
+0001424617 00000 n 
+0001428931 00000 n 
+0001421866 00000 n 
+0001422688 00000 n 
+0001421722 00000 n 
+0001419414 00000 n 
+0001422031 00000 n 
+0001422089 00000 n 
+0001422212 00000 n 
+0001422335 00000 n 
+0001422453 00000 n 
+0001422512 00000 n 
+0001428999 00000 n 
+0001429203 00000 n 
+0001429442 00000 n 
+0001429691 00000 n 
+0001429895 00000 n 
+0001430098 00000 n 
+0001430336 00000 n 
+0001430583 00000 n 
+0001430786 00000 n 
+0001430990 00000 n 
+0001431228 00000 n 
+0001431476 00000 n 
+0001431681 00000 n 
+0001431885 00000 n 
+0001432124 00000 n 
+0001432373 00000 n 
+0001432578 00000 n 
+0001432782 00000 n 
+0001433020 00000 n 
+0001433268 00000 n 
+0001433473 00000 n 
+0001433721 00000 n 
+0001433960 00000 n 
+0001434199 00000 n 
+0001434438 00000 n 
+0001434685 00000 n 
+0001438756 00000 n 
+0001439005 00000 n 
+0001439244 00000 n 
+0001434898 00000 n 
+0001435593 00000 n 
+0001424223 00000 n 
+0001422896 00000 n 
+0001435063 00000 n 
+0001435121 00000 n 
+0001435180 00000 n 
+0001435239 00000 n 
+0001435298 00000 n 
+0001435357 00000 n 
+0001435416 00000 n 
+0001435475 00000 n 
+0001435534 00000 n 
+0001425563 00000 n 
+0001425694 00000 n 
+0001425844 00000 n 
+0001426168 00000 n 
+0001426605 00000 n 
+0001426843 00000 n 
+0001426865 00000 n 
+0001428908 00000 n 
+0001690891 00000 n 
+0001690949 00000 n 
+0001440616 00000 n 
+0001439483 00000 n 
+0001439732 00000 n 
+0001439981 00000 n 
+0001440793 00000 n 
+0001438567 00000 n 
+0001435816 00000 n 
+0001440146 00000 n 
+0001440204 00000 n 
+0001440263 00000 n 
+0001440321 00000 n 
+0001440380 00000 n 
+0001440439 00000 n 
+0001440498 00000 n 
+0001440557 00000 n 
+0001440675 00000 n 
+0001440734 00000 n 
+0001443353 00000 n 
+0001443592 00000 n 
+0001443814 00000 n 
+0001444069 00000 n 
+0001444323 00000 n 
+0001444577 00000 n 
+0001444772 00000 n 
+0001444993 00000 n 
+0001445214 00000 n 
+0001445418 00000 n 
+0001445640 00000 n 
+0001445859 00000 n 
+0001446044 00000 n 
+0001446265 00000 n 
+0001446452 00000 n 
+0001446657 00000 n 
+0001446877 00000 n 
+0001447063 00000 n 
+0001447267 00000 n 
+0001447488 00000 n 
+0001447675 00000 n 
+0001447880 00000 n 
+0001448085 00000 n 
+0001448305 00000 n 
+0001448492 00000 n 
+0001448695 00000 n 
+0001448915 00000 n 
+0001449136 00000 n 
+0001449339 00000 n 
+0001449560 00000 n 
+0001449782 00000 n 
+0001449987 00000 n 
+0001450172 00000 n 
+0001450392 00000 n 
+0001450576 00000 n 
+0001450779 00000 n 
+0001454759 00000 n 
+0001454981 00000 n 
+0001455186 00000 n 
+0001455407 00000 n 
+0001455593 00000 n 
+0001451000 00000 n 
+0001451986 00000 n 
+0001442885 00000 n 
+0001441014 00000 n 
+0001451165 00000 n 
+0001451340 00000 n 
+0001451399 00000 n 
+0001451458 00000 n 
+0001451517 00000 n 
+0001451576 00000 n 
+0001451635 00000 n 
+0001451694 00000 n 
+0001451752 00000 n 
+0001451811 00000 n 
+0001451869 00000 n 
+0001451928 00000 n 
+0004463989 00000 n 
+0001516552 00000 n 
+0001516670 00000 n 
+0001516733 00000 n 
+0001516797 00000 n 
+0001537078 00000 n 
+0001516920 00000 n 
+0001517038 00000 n 
+0001520938 00000 n 
+0001455779 00000 n 
+0001456001 00000 n 
+0001456193 00000 n 
+0001456415 00000 n 
+0001456600 00000 n 
+0001456820 00000 n 
+0001457006 00000 n 
+0001457211 00000 n 
+0001457432 00000 n 
+0001457654 00000 n 
+0001457875 00000 n 
+0001458097 00000 n 
+0001458319 00000 n 
+0001458541 00000 n 
+0001458763 00000 n 
+0001458949 00000 n 
+0001459171 00000 n 
+0001459375 00000 n 
+0001459597 00000 n 
+0001459801 00000 n 
+0001460023 00000 n 
+0001460244 00000 n 
+0001460466 00000 n 
+0001460688 00000 n 
+0001460876 00000 n 
+0001461098 00000 n 
+0001461286 00000 n 
+0001461507 00000 n 
+0001461728 00000 n 
+0001461950 00000 n 
+0001462172 00000 n 
+0001462394 00000 n 
+0001462615 00000 n 
+0001462837 00000 n 
+0001463025 00000 n 
+0001463245 00000 n 
+0001463466 00000 n 
+0001464692 00000 n 
+0001454246 00000 n 
+0001452222 00000 n 
+0001463631 00000 n 
+0001463689 00000 n 
+0001463748 00000 n 
+0001463807 00000 n 
+0001463866 00000 n 
+0001463925 00000 n 
+0001463984 00000 n 
+0001464043 00000 n 
+0001464102 00000 n 
+0001464161 00000 n 
+0001464220 00000 n 
+0001464279 00000 n 
+0001464338 00000 n 
+0001464397 00000 n 
+0001464456 00000 n 
+0001464515 00000 n 
+0001464574 00000 n 
+0001464633 00000 n 
+0001521174 00000 n 
+0001521292 00000 n 
+0001521415 00000 n 
+0001521537 00000 n 
+0001521717 00000 n 
+0001524908 00000 n 
+0001525026 00000 n 
+0001525144 00000 n 
+0001467063 00000 n 
+0001467267 00000 n 
+0001467488 00000 n 
+0001467676 00000 n 
+0001467898 00000 n 
+0001468120 00000 n 
+0001468308 00000 n 
+0001468530 00000 n 
+0001468716 00000 n 
+0001468934 00000 n 
+0001469122 00000 n 
+0001469344 00000 n 
+0001469532 00000 n 
+0001469754 00000 n 
+0001469959 00000 n 
+0001470181 00000 n 
+0001470420 00000 n 
+0001470607 00000 n 
+0001470829 00000 n 
+0001471025 00000 n 
+0001471221 00000 n 
+0001471408 00000 n 
+0001471630 00000 n 
+0001471816 00000 n 
+0001472002 00000 n 
+0001472189 00000 n 
+0001472411 00000 n 
+0001472607 00000 n 
+0001472793 00000 n 
+0001473014 00000 n 
+0001473209 00000 n 
+0001473396 00000 n 
+0001473618 00000 n 
+0001473814 00000 n 
+0001474010 00000 n 
+0001474197 00000 n 
+0001474419 00000 n 
+0001474605 00000 n 
+0001474791 00000 n 
+0001474978 00000 n 
+0001475200 00000 n 
+0001475396 00000 n 
+0001475581 00000 n 
+0001475801 00000 n 
+0001475995 00000 n 
+0001476182 00000 n 
+0001476403 00000 n 
+0001476599 00000 n 
+0001476795 00000 n 
+0001476982 00000 n 
+0001477203 00000 n 
+0001477389 00000 n 
+0001477575 00000 n 
+0001477760 00000 n 
+0001477979 00000 n 
+0001481766 00000 n 
+0001481952 00000 n 
+0001482172 00000 n 
+0001478173 00000 n 
+0001478986 00000 n 
+0001466424 00000 n 
+0001464888 00000 n 
+0001478338 00000 n 
+0001478396 00000 n 
+0001478455 00000 n 
+0001478514 00000 n 
+0001478573 00000 n 
+0001478632 00000 n 
+0001478691 00000 n 
+0001478750 00000 n 
+0001478809 00000 n 
+0001478868 00000 n 
+0001478927 00000 n 
+0001525325 00000 n 
+0001525443 00000 n 
+0001525561 00000 n 
+0001525679 00000 n 
+0001525797 00000 n 
+0001525915 00000 n 
+0001528284 00000 n 
+0001528401 00000 n 
+0001528518 00000 n 
+0001528636 00000 n 
+0001528754 00000 n 
+0001482367 00000 n 
+0001482554 00000 n 
+0001482775 00000 n 
+0001482971 00000 n 
+0001483167 00000 n 
+0001483353 00000 n 
+0001483573 00000 n 
+0001483758 00000 n 
+0001483943 00000 n 
+0001484130 00000 n 
+0001484351 00000 n 
+0001484547 00000 n 
+0001484734 00000 n 
+0001484955 00000 n 
+0001485151 00000 n 
+0001485337 00000 n 
+0001485557 00000 n 
+0001485752 00000 n 
+0001485947 00000 n 
+0001486134 00000 n 
+0001486355 00000 n 
+0001486541 00000 n 
+0001486727 00000 n 
+0001486913 00000 n 
+0001487133 00000 n 
+0001487328 00000 n 
+0001487515 00000 n 
+0001487736 00000 n 
+0001487932 00000 n 
+0001488153 00000 n 
+0001488340 00000 n 
+0001488562 00000 n 
+0001488784 00000 n 
+0001489004 00000 n 
+0001489191 00000 n 
+0001489378 00000 n 
+0001489600 00000 n 
+0001489788 00000 n 
+0001489976 00000 n 
+0001490197 00000 n 
+0001490384 00000 n 
+0001490571 00000 n 
+0001490792 00000 n 
+0001490980 00000 n 
+0001491168 00000 n 
+0001491390 00000 n 
+0001491578 00000 n 
+0001491766 00000 n 
+0001491952 00000 n 
+0001492172 00000 n 
+0001492367 00000 n 
+0001492562 00000 n 
+0001492749 00000 n 
+0001492970 00000 n 
+0001493156 00000 n 
+0001493342 00000 n 
+0001493529 00000 n 
+0001493750 00000 n 
+0001493946 00000 n 
+0001494142 00000 n 
+0001494329 00000 n 
+0001494550 00000 n 
+0001494736 00000 n 
+0001494922 00000 n 
+0001495109 00000 n 
+0001495331 00000 n 
+0001495527 00000 n 
+0001495723 00000 n 
+0001495910 00000 n 
+0001496132 00000 n 
+0001496318 00000 n 
+0001496503 00000 n 
+0001496690 00000 n 
+0001496911 00000 n 
+0001497107 00000 n 
+0001497294 00000 n 
+0001497515 00000 n 
+0001497711 00000 n 
+0001497898 00000 n 
+0001498120 00000 n 
+0001498316 00000 n 
+0001498503 00000 n 
+0001498724 00000 n 
+0001498920 00000 n 
+0001499107 00000 n 
+0001499328 00000 n 
+0001499524 00000 n 
+0001499711 00000 n 
+0001499933 00000 n 
+0001500129 00000 n 
+0001500315 00000 n 
+0001500535 00000 n 
+0001500730 00000 n 
+0001500925 00000 n 
+0001501112 00000 n 
+0001501333 00000 n 
+0001501519 00000 n 
+0001501705 00000 n 
+0001501892 00000 n 
+0001502113 00000 n 
+0001502309 00000 n 
+0001502495 00000 n 
+0001502715 00000 n 
+0001502910 00000 n 
+0001503097 00000 n 
+0001503319 00000 n 
+0001503515 00000 n 
+0001503711 00000 n 
+0001503898 00000 n 
+0001504120 00000 n 
+0001504306 00000 n 
+0001504491 00000 n 
+0001504678 00000 n 
+0001504900 00000 n 
+0001505096 00000 n 
+0001505281 00000 n 
+0001505501 00000 n 
+0001505695 00000 n 
+0001505914 00000 n 
+0001506099 00000 n 
+0001506284 00000 n 
+0001506507 00000 n 
+0001480515 00000 n 
+0001479209 00000 n 
+0001506449 00000 n 
+0001528872 00000 n 
+0001528990 00000 n 
+0001529108 00000 n 
+0001529226 00000 n 
+0001529344 00000 n 
+0001529462 00000 n 
+0001529580 00000 n 
+0001531984 00000 n 
+0001532101 00000 n 
+0001532218 00000 n 
+0001532336 00000 n 
+0001532453 00000 n 
+0001532571 00000 n 
+0001532688 00000 n 
+0001533101 00000 n 
+0001533278 00000 n 
+0001536429 00000 n 
+0001536724 00000 n 
+0001509361 00000 n 
+0001509547 00000 n 
+0001509769 00000 n 
+0001509991 00000 n 
+0001510213 00000 n 
+0001510435 00000 n 
+0001510657 00000 n 
+0001510878 00000 n 
+0001511107 00000 n 
+0001511328 00000 n 
+0001511557 00000 n 
+0001511777 00000 n 
+0001512005 00000 n 
+0001512224 00000 n 
+0001512506 00000 n 
+0001509100 00000 n 
+0001506689 00000 n 
+0001512389 00000 n 
+0001512447 00000 n 
+0001515213 00000 n 
+0001515435 00000 n 
+0001515639 00000 n 
+0001515860 00000 n 
+0001516082 00000 n 
+0001516270 00000 n 
+0001517096 00000 n 
+0001515024 00000 n 
+0001512747 00000 n 
+0001516435 00000 n 
+0001516493 00000 n 
+0001516611 00000 n 
+0001516861 00000 n 
+0001516979 00000 n 
+0001520282 00000 n 
+0001520470 00000 n 
+0001520656 00000 n 
+0001521835 00000 n 
+0001520120 00000 n 
+0001517304 00000 n 
+0001520821 00000 n 
+0001520879 00000 n 
+0001520997 00000 n 
+0001521056 00000 n 
+0001521115 00000 n 
+0001521233 00000 n 
+0001521356 00000 n 
+0001521478 00000 n 
+0001521600 00000 n 
+0001521658 00000 n 
+0001521776 00000 n 
+0004464115 00000 n 
+0001524463 00000 n 
+0001524685 00000 n 
+0001525973 00000 n 
+0001524310 00000 n 
+0001522016 00000 n 
+0001524850 00000 n 
+0001524967 00000 n 
+0001525085 00000 n 
+0001525208 00000 n 
+0001525267 00000 n 
+0001525384 00000 n 
+0001525502 00000 n 
+0001525620 00000 n 
+0001525738 00000 n 
+0001525856 00000 n 
+0001528002 00000 n 
+0001529696 00000 n 
+0001527858 00000 n 
+0001526216 00000 n 
+0001528167 00000 n 
+0001528225 00000 n 
+0001528343 00000 n 
+0001528460 00000 n 
+0001528577 00000 n 
+0001528695 00000 n 
+0001528813 00000 n 
+0001528931 00000 n 
+0001529049 00000 n 
+0001529167 00000 n 
+0001529285 00000 n 
+0001529403 00000 n 
+0001529521 00000 n 
+0001529638 00000 n 
+0001531761 00000 n 
+0001533572 00000 n 
+0001531617 00000 n 
+0001529864 00000 n 
+0001531926 00000 n 
+0001532043 00000 n 
+0001532160 00000 n 
+0001532277 00000 n 
+0001532394 00000 n 
+0001532512 00000 n 
+0001532629 00000 n 
+0001532747 00000 n 
+0001532806 00000 n 
+0001532865 00000 n 
+0001532924 00000 n 
+0001532983 00000 n 
+0001533042 00000 n 
+0001533160 00000 n 
+0001533219 00000 n 
+0001533337 00000 n 
+0001533396 00000 n 
+0001533455 00000 n 
+0001533514 00000 n 
+0001535970 00000 n 
+0001537313 00000 n 
+0001535826 00000 n 
+0001533740 00000 n 
+0001536135 00000 n 
+0001536193 00000 n 
+0001536252 00000 n 
+0001536311 00000 n 
+0001536370 00000 n 
+0001536488 00000 n 
+0001536547 00000 n 
+0001536606 00000 n 
+0001536665 00000 n 
+0001536783 00000 n 
+0001536842 00000 n 
+0001536901 00000 n 
+0001536960 00000 n 
+0001537019 00000 n 
+0001537137 00000 n 
+0001539747 00000 n 
+0001539976 00000 n 
+0001540181 00000 n 
+0001540410 00000 n 
+0001540598 00000 n 
+0001540803 00000 n 
+0001541032 00000 n 
+0001541228 00000 n 
+0001541433 00000 n 
+0001541662 00000 n 
+0001541858 00000 n 
+0001542087 00000 n 
+0001542283 00000 n 
+0001542488 00000 n 
+0001542717 00000 n 
+0001542912 00000 n 
+0001543142 00000 n 
+0001543338 00000 n 
+0001543541 00000 n 
+0001543770 00000 n 
+0001544000 00000 n 
+0001544205 00000 n 
+0001544408 00000 n 
+0001544637 00000 n 
+0001544866 00000 n 
+0001545070 00000 n 
+0001545300 00000 n 
+0001545529 00000 n 
+0001545759 00000 n 
+0001545947 00000 n 
+0001546177 00000 n 
+0001546407 00000 n 
+0001546619 00000 n 
+0001546849 00000 n 
+0001547061 00000 n 
+0001547291 00000 n 
+0001547521 00000 n 
+0001547751 00000 n 
+0001552043 00000 n 
+0001552273 00000 n 
+0001547979 00000 n 
+0001549437 00000 n 
+0001539261 00000 n 
+0001537481 00000 n 
+0001548144 00000 n 
+0001548202 00000 n 
+0001548261 00000 n 
+0001548320 00000 n 
+0001548379 00000 n 
+0001548438 00000 n 
+0001548497 00000 n 
+0001548556 00000 n 
+0001548614 00000 n 
+0001548673 00000 n 
+0001548732 00000 n 
+0001548790 00000 n 
+0001548849 00000 n 
+0001548907 00000 n 
+0001548966 00000 n 
+0001549025 00000 n 
+0001549084 00000 n 
+0001549143 00000 n 
+0001549202 00000 n 
+0001549261 00000 n 
+0001549320 00000 n 
+0001549379 00000 n 
+0001561969 00000 n 
+0001552503 00000 n 
+0001552733 00000 n 
+0001552937 00000 n 
+0001553167 00000 n 
+0001553371 00000 n 
+0001553601 00000 n 
+0001553831 00000 n 
+0001554027 00000 n 
+0001554232 00000 n 
+0001554462 00000 n 
+0001554658 00000 n 
+0001554888 00000 n 
+0001555118 00000 n 
+0001555313 00000 n 
+0001555542 00000 n 
+0001555764 00000 n 
+0001555994 00000 n 
+0001556190 00000 n 
+0001556419 00000 n 
+0001556614 00000 n 
+0001556809 00000 n 
+0001557039 00000 n 
+0001557235 00000 n 
+0001557431 00000 n 
+0001557626 00000 n 
+0001561228 00000 n 
+0001557812 00000 n 
+0001558742 00000 n 
+0001551656 00000 n 
+0001549645 00000 n 
+0001557977 00000 n 
+0001558035 00000 n 
+0001558094 00000 n 
+0001558153 00000 n 
+0001558212 00000 n 
+0001558271 00000 n 
+0001558330 00000 n 
+0001558389 00000 n 
+0001558448 00000 n 
+0001558507 00000 n 
+0001558566 00000 n 
+0001558624 00000 n 
+0001558683 00000 n 
+0004464241 00000 n 
+0001562146 00000 n 
+0001562264 00000 n 
+0001561457 00000 n 
+0001561687 00000 n 
+0001562326 00000 n 
+0001561066 00000 n 
+0001558976 00000 n 
+0001561852 00000 n 
+0001561910 00000 n 
+0001562028 00000 n 
+0001562087 00000 n 
+0001562205 00000 n 
+0001564686 00000 n 
+0001564932 00000 n 
+0001565177 00000 n 
+0001565388 00000 n 
+0001565634 00000 n 
+0001565845 00000 n 
+0001566091 00000 n 
+0001566303 00000 n 
+0001566491 00000 n 
+0001566738 00000 n 
+0001566926 00000 n 
+0001567173 00000 n 
+0001567385 00000 n 
+0001567632 00000 n 
+0001567844 00000 n 
+0001568091 00000 n 
+0001568336 00000 n 
+0001568548 00000 n 
+0001568795 00000 n 
+0001569008 00000 n 
+0001569204 00000 n 
+0001570369 00000 n 
+0001564362 00000 n 
+0001562544 00000 n 
+0001569369 00000 n 
+0001569427 00000 n 
+0001569486 00000 n 
+0001569661 00000 n 
+0001569720 00000 n 
+0001569779 00000 n 
+0001569838 00000 n 
+0001569897 00000 n 
+0001569956 00000 n 
+0001570015 00000 n 
+0001570074 00000 n 
+0001570133 00000 n 
+0001570192 00000 n 
+0001570251 00000 n 
+0001570310 00000 n 
+0001573313 00000 n 
+0001573546 00000 n 
+0001573780 00000 n 
+0001574011 00000 n 
+0001574216 00000 n 
+0001574398 00000 n 
+0001574586 00000 n 
+0001575456 00000 n 
+0001573115 00000 n 
+0001570592 00000 n 
+0001574751 00000 n 
+0001574926 00000 n 
+0001574985 00000 n 
+0001575044 00000 n 
+0001575103 00000 n 
+0001575162 00000 n 
+0001575220 00000 n 
+0001575279 00000 n 
+0001575338 00000 n 
+0001575397 00000 n 
+0001578072 00000 n 
+0001578226 00000 n 
+0001578449 00000 n 
+0001578671 00000 n 
+0001578866 00000 n 
+0001579089 00000 n 
+0001579285 00000 n 
+0001579508 00000 n 
+0001579697 00000 n 
+0001579920 00000 n 
+0001580140 00000 n 
+0001580327 00000 n 
+0001580548 00000 n 
+0001580737 00000 n 
+0001580958 00000 n 
+0001581147 00000 n 
+0001581368 00000 n 
+0001581556 00000 n 
+0001581728 00000 n 
+0001581950 00000 n 
+0001582139 00000 n 
+0001582362 00000 n 
+0001582551 00000 n 
+0001582772 00000 n 
+0001582961 00000 n 
+0001583184 00000 n 
+0001583373 00000 n 
+0001583593 00000 n 
+0001587801 00000 n 
+0001583779 00000 n 
+0001585003 00000 n 
+0001577676 00000 n 
+0001575664 00000 n 
+0001583944 00000 n 
+0001584118 00000 n 
+0001584177 00000 n 
+0001584236 00000 n 
+0001584295 00000 n 
+0001584354 00000 n 
+0001584413 00000 n 
+0001584472 00000 n 
+0001584531 00000 n 
+0001584590 00000 n 
+0001584649 00000 n 
+0001584708 00000 n 
+0001584767 00000 n 
+0001584826 00000 n 
+0001584885 00000 n 
+0001584944 00000 n 
+0001592003 00000 n 
+0001592121 00000 n 
+0001588022 00000 n 
+0001588245 00000 n 
+0001588468 00000 n 
+0001588691 00000 n 
+0001588880 00000 n 
+0001589103 00000 n 
+0001589292 00000 n 
+0001589495 00000 n 
+0001589717 00000 n 
+0001589921 00000 n 
+0001590144 00000 n 
+0001590367 00000 n 
+0001590590 00000 n 
+0001590744 00000 n 
+0001590899 00000 n 
+0001592296 00000 n 
+0001587522 00000 n 
+0001585239 00000 n 
+0001591064 00000 n 
+0001591122 00000 n 
+0001591181 00000 n 
+0001591240 00000 n 
+0001591299 00000 n 
+0001591358 00000 n 
+0001591416 00000 n 
+0001591475 00000 n 
+0001591534 00000 n 
+0001591593 00000 n 
+0001591652 00000 n 
+0001591711 00000 n 
+0001591770 00000 n 
+0001591828 00000 n 
+0001591887 00000 n 
+0001591946 00000 n 
+0001592062 00000 n 
+0001592179 00000 n 
+0001594344 00000 n 
+0001598780 00000 n 
+0001598848 00000 n 
+0001599051 00000 n 
+0001599290 00000 n 
+0001599541 00000 n 
+0001599745 00000 n 
+0001599949 00000 n 
+0001600188 00000 n 
+0001600438 00000 n 
+0001600642 00000 n 
+0001600846 00000 n 
+0001601085 00000 n 
+0001601336 00000 n 
+0001601541 00000 n 
+0001601745 00000 n 
+0001601983 00000 n 
+0001602233 00000 n 
+0001602438 00000 n 
+0001602640 00000 n 
+0001602878 00000 n 
+0001603128 00000 n 
+0001607516 00000 n 
+0001607764 00000 n 
+0001608001 00000 n 
+0001608238 00000 n 
+0001603332 00000 n 
+0001603965 00000 n 
+0001594004 00000 n 
+0001592507 00000 n 
+0001603497 00000 n 
+0001603613 00000 n 
+0001603671 00000 n 
+0001603729 00000 n 
+0001603788 00000 n 
+0001603847 00000 n 
+0001603906 00000 n 
+0004464367 00000 n 
+0001595298 00000 n 
+0001595429 00000 n 
+0001595579 00000 n 
+0001595911 00000 n 
+0001596359 00000 n 
+0001596597 00000 n 
+0001596619 00000 n 
+0001598757 00000 n 
+0001608477 00000 n 
+0001608728 00000 n 
+0001608945 00000 n 
+0001609196 00000 n 
+0001609401 00000 n 
+0001609603 00000 n 
+0001613728 00000 n 
+0001614204 00000 n 
+0001609851 00000 n 
+0001610487 00000 n 
+0001607282 00000 n 
+0001604173 00000 n 
+0001610016 00000 n 
+0001610074 00000 n 
+0001610133 00000 n 
+0001610192 00000 n 
+0001610251 00000 n 
+0001610310 00000 n 
+0001610369 00000 n 
+0001610428 00000 n 
+0001615199 00000 n 
+0001614679 00000 n 
+0001617375 00000 n 
+0001621654 00000 n 
+0001614918 00000 n 
+0001615493 00000 n 
+0001613539 00000 n 
+0001610800 00000 n 
+0001615083 00000 n 
+0001613967 00000 n 
+0001614442 00000 n 
+0001615141 00000 n 
+0001615258 00000 n 
+0001615317 00000 n 
+0001621722 00000 n 
+0001621926 00000 n 
+0001622165 00000 n 
+0001622414 00000 n 
+0001622618 00000 n 
+0001622821 00000 n 
+0001623059 00000 n 
+0001623306 00000 n 
+0001623509 00000 n 
+0001623713 00000 n 
+0001623951 00000 n 
+0001624199 00000 n 
+0001624404 00000 n 
+0001624608 00000 n 
+0001624847 00000 n 
+0001625096 00000 n 
+0001625301 00000 n 
+0001625505 00000 n 
+0001625743 00000 n 
+0001625991 00000 n 
+0001626196 00000 n 
+0001626444 00000 n 
+0001626683 00000 n 
+0001626922 00000 n 
+0001627161 00000 n 
+0001627408 00000 n 
+0001632293 00000 n 
+0001632542 00000 n 
+0001632746 00000 n 
+0001627621 00000 n 
+0001628316 00000 n 
+0001616981 00000 n 
+0001615728 00000 n 
+0001627786 00000 n 
+0001627844 00000 n 
+0001627903 00000 n 
+0001627962 00000 n 
+0001628021 00000 n 
+0001628080 00000 n 
+0001628139 00000 n 
+0001628198 00000 n 
+0001628257 00000 n 
+0001618321 00000 n 
+0001618452 00000 n 
+0001618602 00000 n 
+0001618926 00000 n 
+0001619362 00000 n 
+0001619600 00000 n 
+0001619622 00000 n 
+0001621631 00000 n 
+0001639103 00000 n 
+0001632951 00000 n 
+0001633200 00000 n 
+0001633674 00000 n 
+0001634147 00000 n 
+0001634619 00000 n 
+0001635136 00000 n 
+0001632059 00000 n 
+0001628539 00000 n 
+0001634784 00000 n 
+0001634842 00000 n 
+0001634901 00000 n 
+0001634959 00000 n 
+0001635018 00000 n 
+0001635077 00000 n 
+0001633438 00000 n 
+0001633911 00000 n 
+0001634384 00000 n 
+0001703088 00000 n 
+0001638389 00000 n 
+0001638628 00000 n 
+0001641417 00000 n 
+0001646183 00000 n 
+0001638821 00000 n 
+0001639631 00000 n 
+0001638227 00000 n 
+0001635449 00000 n 
+0001638986 00000 n 
+0001639044 00000 n 
+0001639162 00000 n 
+0001639221 00000 n 
+0001639396 00000 n 
+0001639455 00000 n 
+0001646251 00000 n 
+0001646502 00000 n 
+0001646753 00000 n 
+0001646971 00000 n 
+0001647189 00000 n 
+0001647440 00000 n 
+0001647658 00000 n 
+0001647910 00000 n 
+0001648127 00000 n 
+0001648344 00000 n 
+0001648596 00000 n 
+0001648846 00000 n 
+0001649599 00000 n 
+0001641158 00000 n 
+0001639839 00000 n 
+0001649011 00000 n 
+0001649069 00000 n 
+0001649128 00000 n 
+0001649187 00000 n 
+0001649246 00000 n 
+0001649305 00000 n 
+0001649364 00000 n 
+0001649423 00000 n 
+0001649482 00000 n 
+0004464493 00000 n 
+0001642654 00000 n 
+0001642785 00000 n 
+0001642935 00000 n 
+0001643267 00000 n 
+0001643711 00000 n 
+0001643949 00000 n 
+0001643971 00000 n 
+0001646160 00000 n 
+0001651720 00000 n 
+0001655938 00000 n 
+0001656006 00000 n 
+0001656217 00000 n 
+0001656452 00000 n 
+0001656663 00000 n 
+0001656898 00000 n 
+0001657130 00000 n 
+0001657363 00000 n 
+0001657598 00000 n 
+0001657833 00000 n 
+0001658066 00000 n 
+0001658300 00000 n 
+0001658534 00000 n 
+0001658768 00000 n 
+0001659003 00000 n 
+0001659238 00000 n 
+0001659470 00000 n 
+0001663073 00000 n 
+0001663306 00000 n 
+0001659703 00000 n 
+0001660631 00000 n 
+0001651416 00000 n 
+0001649823 00000 n 
+0001659868 00000 n 
+0001659984 00000 n 
+0001660043 00000 n 
+0001660102 00000 n 
+0001660161 00000 n 
+0001660220 00000 n 
+0001660279 00000 n 
+0001660338 00000 n 
+0001660397 00000 n 
+0001660456 00000 n 
+0001660515 00000 n 
+0001660574 00000 n 
+0001652568 00000 n 
+0001652699 00000 n 
+0001652849 00000 n 
+0001653173 00000 n 
+0001653610 00000 n 
+0001653848 00000 n 
+0001653870 00000 n 
+0001655915 00000 n 
+0001668231 00000 n 
+0001663540 00000 n 
+0001663774 00000 n 
+0001664009 00000 n 
+0001664242 00000 n 
+0001664476 00000 n 
+0001664710 00000 n 
+0001664945 00000 n 
+0001665180 00000 n 
+0001665423 00000 n 
+0001665666 00000 n 
+0001665883 00000 n 
+0001666093 00000 n 
+0001666338 00000 n 
+0001666556 00000 n 
+0001666800 00000 n 
+0001667043 00000 n 
+0001667253 00000 n 
+0001667498 00000 n 
+0001667706 00000 n 
+0001671335 00000 n 
+0001671545 00000 n 
+0001671790 00000 n 
+0001672000 00000 n 
+0001667949 00000 n 
+0001669233 00000 n 
+0001662740 00000 n 
+0001660854 00000 n 
+0001668114 00000 n 
+0001668172 00000 n 
+0001668290 00000 n 
+0001668349 00000 n 
+0001668408 00000 n 
+0001668467 00000 n 
+0001668526 00000 n 
+0001668585 00000 n 
+0001668761 00000 n 
+0001668820 00000 n 
+0001668879 00000 n 
+0001668938 00000 n 
+0001668997 00000 n 
+0001669056 00000 n 
+0001669115 00000 n 
+0001669174 00000 n 
+0001672245 00000 n 
+0001672489 00000 n 
+0001672700 00000 n 
+0001672911 00000 n 
+0001673156 00000 n 
+0001673367 00000 n 
+0001673578 00000 n 
+0001674677 00000 n 
+0001671101 00000 n 
+0001669455 00000 n 
+0001673743 00000 n 
+0001673801 00000 n 
+0001673860 00000 n 
+0001673919 00000 n 
+0001673977 00000 n 
+0001674035 00000 n 
+0001674094 00000 n 
+0001674153 00000 n 
+0001674328 00000 n 
+0001674504 00000 n 
+0001674563 00000 n 
+0001676032 00000 n 
+0001681962 00000 n 
+0001682030 00000 n 
+0001682311 00000 n 
+0001675872 00000 n 
+0001674873 00000 n 
+0001682195 00000 n 
+0001678031 00000 n 
+0001678162 00000 n 
+0001678312 00000 n 
+0001678668 00000 n 
+0001679143 00000 n 
+0001679381 00000 n 
+0001679403 00000 n 
+0001681939 00000 n 
+0001684969 00000 n 
+0001685158 00000 n 
+0001685397 00000 n 
+0001685577 00000 n 
+0001685814 00000 n 
+0001686018 00000 n 
+0001686256 00000 n 
+0001686495 00000 n 
+0001686734 00000 n 
+0001686973 00000 n 
+0001687212 00000 n 
+0001687451 00000 n 
+0001687689 00000 n 
+0001688166 00000 n 
+0001688405 00000 n 
+0001688642 00000 n 
+0001688878 00000 n 
+0001689117 00000 n 
+0001689356 00000 n 
+0001689595 00000 n 
+0001689834 00000 n 
+0001690073 00000 n 
+0001690312 00000 n 
+0001690550 00000 n 
+0001691362 00000 n 
+0001684609 00000 n 
+0001682493 00000 n 
+0001690715 00000 n 
+0001690773 00000 n 
+0001691008 00000 n 
+0001691067 00000 n 
+0001687928 00000 n 
+0001691126 00000 n 
+0001691185 00000 n 
+0001691244 00000 n 
+0001691303 00000 n 
+0001702734 00000 n 
+0001694434 00000 n 
+0001694615 00000 n 
+0001695372 00000 n 
+0001694281 00000 n 
+0001691556 00000 n 
+0001694780 00000 n 
+0001694838 00000 n 
+0001694955 00000 n 
+0001695077 00000 n 
+0001695136 00000 n 
+0001695254 00000 n 
+0001695313 00000 n 
+0004464619 00000 n 
+0001699288 00000 n 
+0001699784 00000 n 
+0001700280 00000 n 
+0001700787 00000 n 
+0001701287 00000 n 
+0001701772 00000 n 
+0001702021 00000 n 
+0001702268 00000 n 
+0001702511 00000 n 
+0001703209 00000 n 
+0001699027 00000 n 
+0001695553 00000 n 
+0001702676 00000 n 
+0001699536 00000 n 
+0001700033 00000 n 
+0001700533 00000 n 
+0001701038 00000 n 
+0001701530 00000 n 
+0001702793 00000 n 
+0001702852 00000 n 
+0001702970 00000 n 
+0001703029 00000 n 
+0001703151 00000 n 
+0002785305 00000 n 
+0002534128 00000 n 
+0003620777 00000 n 
+0003668037 00000 n 
+0001707185 00000 n 
+0001707407 00000 n 
+0001707611 00000 n 
+0001707833 00000 n 
+0001708036 00000 n 
+0001708255 00000 n 
+0001712349 00000 n 
+0001712571 00000 n 
+0001712772 00000 n 
+0001708450 00000 n 
+0001709085 00000 n 
+0001706987 00000 n 
+0001703507 00000 n 
+0001708615 00000 n 
+0001708673 00000 n 
+0001708732 00000 n 
+0001708850 00000 n 
+0001709026 00000 n 
+0001713570 00000 n 
+0001713688 00000 n 
+0001713806 00000 n 
+0001712974 00000 n 
+0001713171 00000 n 
+0001713864 00000 n 
+0001712169 00000 n 
+0001709370 00000 n 
+0001713336 00000 n 
+0001713394 00000 n 
+0001713453 00000 n 
+0001713511 00000 n 
+0001713629 00000 n 
+0001713747 00000 n 
+0001720713 00000 n 
+0001716908 00000 n 
+0001717120 00000 n 
+0001717341 00000 n 
+0001717595 00000 n 
+0001717849 00000 n 
+0001718103 00000 n 
+0001718356 00000 n 
+0001718551 00000 n 
+0001718771 00000 n 
+0001718991 00000 n 
+0001719196 00000 n 
+0001719417 00000 n 
+0001719637 00000 n 
+0001719823 00000 n 
+0001720042 00000 n 
+0001720227 00000 n 
+0001723814 00000 n 
+0001724034 00000 n 
+0001724220 00000 n 
+0001724425 00000 n 
+0001724645 00000 n 
+0001724831 00000 n 
+0001725036 00000 n 
+0001720431 00000 n 
+0001721243 00000 n 
+0001716620 00000 n 
+0001714060 00000 n 
+0001720596 00000 n 
+0001720654 00000 n 
+0001720772 00000 n 
+0001720948 00000 n 
+0001721007 00000 n 
+0001721066 00000 n 
+0001721125 00000 n 
+0001721184 00000 n 
+0001816222 00000 n 
+0001816340 00000 n 
+0001816404 00000 n 
+0001816468 00000 n 
+0001816530 00000 n 
+0001847625 00000 n 
+0001821015 00000 n 
+0001725241 00000 n 
+0001725461 00000 n 
+0001725647 00000 n 
+0001725868 00000 n 
+0001726055 00000 n 
+0001726259 00000 n 
+0001726480 00000 n 
+0001726701 00000 n 
+0001726906 00000 n 
+0001727110 00000 n 
+0001727331 00000 n 
+0001727552 00000 n 
+0001727757 00000 n 
+0001727977 00000 n 
+0001728163 00000 n 
+0001728349 00000 n 
+0001728570 00000 n 
+0001728762 00000 n 
+0001728983 00000 n 
+0001729168 00000 n 
+0001729387 00000 n 
+0001729573 00000 n 
+0001729778 00000 n 
+0001729997 00000 n 
+0001730217 00000 n 
+0001730438 00000 n 
+0001730659 00000 n 
+0001730880 00000 n 
+0001731101 00000 n 
+0001731322 00000 n 
+0001731508 00000 n 
+0001731728 00000 n 
+0001731931 00000 n 
+0001732151 00000 n 
+0001732355 00000 n 
+0001732576 00000 n 
+0001732797 00000 n 
+0001732984 00000 n 
+0001733205 00000 n 
+0001733392 00000 n 
+0001733612 00000 n 
+0001737755 00000 n 
+0001737976 00000 n 
+0001733832 00000 n 
+0001734996 00000 n 
+0001723238 00000 n 
+0001721424 00000 n 
+0001733997 00000 n 
+0001734055 00000 n 
+0001734114 00000 n 
+0001734172 00000 n 
+0001734230 00000 n 
+0001734289 00000 n 
+0001734348 00000 n 
+0001734407 00000 n 
+0001734466 00000 n 
+0001734525 00000 n 
+0001734584 00000 n 
+0001734643 00000 n 
+0001734702 00000 n 
+0001734761 00000 n 
+0001734819 00000 n 
+0001734878 00000 n 
+0001734937 00000 n 
+0001821133 00000 n 
+0001825574 00000 n 
+0001825692 00000 n 
+0001825815 00000 n 
+0001825996 00000 n 
+0001826118 00000 n 
+0001826300 00000 n 
+0001830578 00000 n 
+0001830696 00000 n 
+0001738196 00000 n 
+0001738417 00000 n 
+0001738638 00000 n 
+0001738859 00000 n 
+0001739046 00000 n 
+0001739266 00000 n 
+0001739487 00000 n 
+0001739674 00000 n 
+0001739895 00000 n 
+0001740091 00000 n 
+0001740296 00000 n 
+0001740517 00000 n 
+0001740704 00000 n 
+0001740925 00000 n 
+0001741121 00000 n 
+0001741326 00000 n 
+0001741545 00000 n 
+0001741732 00000 n 
+0001741953 00000 n 
+0001742149 00000 n 
+0001742379 00000 n 
+0001742590 00000 n 
+0001742794 00000 n 
+0001743014 00000 n 
+0001743201 00000 n 
+0001743422 00000 n 
+0001743627 00000 n 
+0001743814 00000 n 
+0001744035 00000 n 
+0001744231 00000 n 
+0001744436 00000 n 
+0001744623 00000 n 
+0001744844 00000 n 
+0001745040 00000 n 
+0001745269 00000 n 
+0001745481 00000 n 
+0001745686 00000 n 
+0001745907 00000 n 
+0001746094 00000 n 
+0001746315 00000 n 
+0001746520 00000 n 
+0001746707 00000 n 
+0001746928 00000 n 
+0001747124 00000 n 
+0001747329 00000 n 
+0001747534 00000 n 
+0001747755 00000 n 
+0001747942 00000 n 
+0001748163 00000 n 
+0001748384 00000 n 
+0001748571 00000 n 
+0001748792 00000 n 
+0001748979 00000 n 
+0001749200 00000 n 
+0001749404 00000 n 
+0001749624 00000 n 
+0001749862 00000 n 
+0001751027 00000 n 
+0001737089 00000 n 
+0001735191 00000 n 
+0001750027 00000 n 
+0001750085 00000 n 
+0001750144 00000 n 
+0001750203 00000 n 
+0001750262 00000 n 
+0001750321 00000 n 
+0001750379 00000 n 
+0001750438 00000 n 
+0001750497 00000 n 
+0001750556 00000 n 
+0001750615 00000 n 
+0001750674 00000 n 
+0001750732 00000 n 
+0001750791 00000 n 
+0001750850 00000 n 
+0001750909 00000 n 
+0001750968 00000 n 
+0004464745 00000 n 
+0001821315 00000 n 
+0001821492 00000 n 
+0001821669 00000 n 
+0001821846 00000 n 
+0001753906 00000 n 
+0001754127 00000 n 
+0001754314 00000 n 
+0001754535 00000 n 
+0001754721 00000 n 
+0001754908 00000 n 
+0001755094 00000 n 
+0001755314 00000 n 
+0001755510 00000 n 
+0001755715 00000 n 
+0001755935 00000 n 
+0001756155 00000 n 
+0001756340 00000 n 
+0001756559 00000 n 
+0001756752 00000 n 
+0001756956 00000 n 
+0001757175 00000 n 
+0001757396 00000 n 
+0001757582 00000 n 
+0001757802 00000 n 
+0001757998 00000 n 
+0001758228 00000 n 
+0001758440 00000 n 
+0001758645 00000 n 
+0001758865 00000 n 
+0001759307 00000 n 
+0001759493 00000 n 
+0001759714 00000 n 
+0001759918 00000 n 
+0001760138 00000 n 
+0001760324 00000 n 
+0001760545 00000 n 
+0001760741 00000 n 
+0001760946 00000 n 
+0001761167 00000 n 
+0001761353 00000 n 
+0001761574 00000 n 
+0001761770 00000 n 
+0001762000 00000 n 
+0001762212 00000 n 
+0001762417 00000 n 
+0001762637 00000 n 
+0001763079 00000 n 
+0001763265 00000 n 
+0001763485 00000 n 
+0001763690 00000 n 
+0001763910 00000 n 
+0001764095 00000 n 
+0001764314 00000 n 
+0001764509 00000 n 
+0001764711 00000 n 
+0001764932 00000 n 
+0001765152 00000 n 
+0001765337 00000 n 
+0001765524 00000 n 
+0001765744 00000 n 
+0001765930 00000 n 
+0001766116 00000 n 
+0001766337 00000 n 
+0001766530 00000 n 
+0001766716 00000 n 
+0001766903 00000 n 
+0001767108 00000 n 
+0001767328 00000 n 
+0001767520 00000 n 
+0001767706 00000 n 
+0001767893 00000 n 
+0001768098 00000 n 
+0001768319 00000 n 
+0001768512 00000 n 
+0001768698 00000 n 
+0001768885 00000 n 
+0001769090 00000 n 
+0001769310 00000 n 
+0001769503 00000 n 
+0001769687 00000 n 
+0001769872 00000 n 
+0001773427 00000 n 
+0001773648 00000 n 
+0001773841 00000 n 
+0001774027 00000 n 
+0001774214 00000 n 
+0001770075 00000 n 
+0001770591 00000 n 
+0001753051 00000 n 
+0001751250 00000 n 
+0001770240 00000 n 
+0001770298 00000 n 
+0001770357 00000 n 
+0001759086 00000 n 
+0001770416 00000 n 
+0001770473 00000 n 
+0001762858 00000 n 
+0001770532 00000 n 
+0001830878 00000 n 
+0001830996 00000 n 
+0001831114 00000 n 
+0001831231 00000 n 
+0001831349 00000 n 
+0001831467 00000 n 
+0001831585 00000 n 
+0001831703 00000 n 
+0001831821 00000 n 
+0001835234 00000 n 
+0001835352 00000 n 
+0001835470 00000 n 
+0001774419 00000 n 
+0001774639 00000 n 
+0001774832 00000 n 
+0001775018 00000 n 
+0001775205 00000 n 
+0001775410 00000 n 
+0001775631 00000 n 
+0001775824 00000 n 
+0001776197 00000 n 
+0001776384 00000 n 
+0001776589 00000 n 
+0001776810 00000 n 
+0001777003 00000 n 
+0001777376 00000 n 
+0001777563 00000 n 
+0001777768 00000 n 
+0001777989 00000 n 
+0001778182 00000 n 
+0001778555 00000 n 
+0001778742 00000 n 
+0001778947 00000 n 
+0001779168 00000 n 
+0001779389 00000 n 
+0001779575 00000 n 
+0001779796 00000 n 
+0001779992 00000 n 
+0001780197 00000 n 
+0001780383 00000 n 
+0001780604 00000 n 
+0001780800 00000 n 
+0001781005 00000 n 
+0001781191 00000 n 
+0001781412 00000 n 
+0001781608 00000 n 
+0001781813 00000 n 
+0001781999 00000 n 
+0001782220 00000 n 
+0001782424 00000 n 
+0001782610 00000 n 
+0001782831 00000 n 
+0001783027 00000 n 
+0001783232 00000 n 
+0001783418 00000 n 
+0001783639 00000 n 
+0001783835 00000 n 
+0001784244 00000 n 
+0001784430 00000 n 
+0001784650 00000 n 
+0001784855 00000 n 
+0001785041 00000 n 
+0001785261 00000 n 
+0001785457 00000 n 
+0001785660 00000 n 
+0001785880 00000 n 
+0001786065 00000 n 
+0001786252 00000 n 
+0001786473 00000 n 
+0001786660 00000 n 
+0001786847 00000 n 
+0001787068 00000 n 
+0001787261 00000 n 
+0001787447 00000 n 
+0001787634 00000 n 
+0001787838 00000 n 
+0001788059 00000 n 
+0001788252 00000 n 
+0001788438 00000 n 
+0001788625 00000 n 
+0001788830 00000 n 
+0001789051 00000 n 
+0001789244 00000 n 
+0001789430 00000 n 
+0001789617 00000 n 
+0001789822 00000 n 
+0001790042 00000 n 
+0001790235 00000 n 
+0001790421 00000 n 
+0001790608 00000 n 
+0001790812 00000 n 
+0001791030 00000 n 
+0001791221 00000 n 
+0001791405 00000 n 
+0001791590 00000 n 
+0001795534 00000 n 
+0001795754 00000 n 
+0001795947 00000 n 
+0001796133 00000 n 
+0001796320 00000 n 
+0001791793 00000 n 
+0001792016 00000 n 
+0001772455 00000 n 
+0001770786 00000 n 
+0001791958 00000 n 
+0001776011 00000 n 
+0001777190 00000 n 
+0001778369 00000 n 
+0001784040 00000 n 
+0001838928 00000 n 
+0001839046 00000 n 
+0001839164 00000 n 
+0001842433 00000 n 
+0001842551 00000 n 
+0001842668 00000 n 
+0001842785 00000 n 
+0001842903 00000 n 
+0001843139 00000 n 
+0001846445 00000 n 
+0001846563 00000 n 
+0001846681 00000 n 
+0001846799 00000 n 
+0001846917 00000 n 
+0001796525 00000 n 
+0001796746 00000 n 
+0001796939 00000 n 
+0001797312 00000 n 
+0001797499 00000 n 
+0001797704 00000 n 
+0001797925 00000 n 
+0001798118 00000 n 
+0001798491 00000 n 
+0001798678 00000 n 
+0001798883 00000 n 
+0001799104 00000 n 
+0001799297 00000 n 
+0001799670 00000 n 
+0001799857 00000 n 
+0001800062 00000 n 
+0001800283 00000 n 
+0001800469 00000 n 
+0001800656 00000 n 
+0001800841 00000 n 
+0001804275 00000 n 
+0001804496 00000 n 
+0001801004 00000 n 
+0001801286 00000 n 
+0001795138 00000 n 
+0001792225 00000 n 
+0001801169 00000 n 
+0001797126 00000 n 
+0001798305 00000 n 
+0001799484 00000 n 
+0001801227 00000 n 
+0001847035 00000 n 
+0001847153 00000 n 
+0001847271 00000 n 
+0001847389 00000 n 
+0001804717 00000 n 
+0001804938 00000 n 
+0001805159 00000 n 
+0001805380 00000 n 
+0001805601 00000 n 
+0001805822 00000 n 
+0001806043 00000 n 
+0001806264 00000 n 
+0001806485 00000 n 
+0001806705 00000 n 
+0001806925 00000 n 
+0001807146 00000 n 
+0001807367 00000 n 
+0001807588 00000 n 
+0001807809 00000 n 
+0001808029 00000 n 
+0001808249 00000 n 
+0001808470 00000 n 
+0001808691 00000 n 
+0001808912 00000 n 
+0001809133 00000 n 
+0001809354 00000 n 
+0001809575 00000 n 
+0001809794 00000 n 
+0001813310 00000 n 
+0001813531 00000 n 
+0001810013 00000 n 
+0001810236 00000 n 
+0001803897 00000 n 
+0001801580 00000 n 
+0001810178 00000 n 
+0001813752 00000 n 
+0001813973 00000 n 
+0001814194 00000 n 
+0001814415 00000 n 
+0001814636 00000 n 
+0001814840 00000 n 
+0001815061 00000 n 
+0001815281 00000 n 
+0001815500 00000 n 
+0001815719 00000 n 
+0001819481 00000 n 
+0001815940 00000 n 
+0001816593 00000 n 
+0001813058 00000 n 
+0001810466 00000 n 
+0001816105 00000 n 
+0001816163 00000 n 
+0001816281 00000 n 
+0001819666 00000 n 
+0001819851 00000 n 
+0001820081 00000 n 
+0001820293 00000 n 
+0001820522 00000 n 
+0001820733 00000 n 
+0001821964 00000 n 
+0001819283 00000 n 
+0001816864 00000 n 
+0001820898 00000 n 
+0001820956 00000 n 
+0001821074 00000 n 
+0001821197 00000 n 
+0001821256 00000 n 
+0001821374 00000 n 
+0001821433 00000 n 
+0001821551 00000 n 
+0001821610 00000 n 
+0001821728 00000 n 
+0001821787 00000 n 
+0001821905 00000 n 
+0004464871 00000 n 
+0001825292 00000 n 
+0001826477 00000 n 
+0001825148 00000 n 
+0001822132 00000 n 
+0001825457 00000 n 
+0001825515 00000 n 
+0001825633 00000 n 
+0001825756 00000 n 
+0001825879 00000 n 
+0001825937 00000 n 
+0001826060 00000 n 
+0001826182 00000 n 
+0001826241 00000 n 
+0001826359 00000 n 
+0001826418 00000 n 
+0001829251 00000 n 
+0001829471 00000 n 
+0001829692 00000 n 
+0001829913 00000 n 
+0001830134 00000 n 
+0001834434 00000 n 
+0001830355 00000 n 
+0001831939 00000 n 
+0001829062 00000 n 
+0001826683 00000 n 
+0001830520 00000 n 
+0001830637 00000 n 
+0001830760 00000 n 
+0001830819 00000 n 
+0001830937 00000 n 
+0001831055 00000 n 
+0001831172 00000 n 
+0001831290 00000 n 
+0001831408 00000 n 
+0001831526 00000 n 
+0001831644 00000 n 
+0001831762 00000 n 
+0001831880 00000 n 
+0001834627 00000 n 
+0001834820 00000 n 
+0001835011 00000 n 
+0001835588 00000 n 
+0001834263 00000 n 
+0001832120 00000 n 
+0001835176 00000 n 
+0001835293 00000 n 
+0001835411 00000 n 
+0001835529 00000 n 
+0001838260 00000 n 
+0001838453 00000 n 
+0001838646 00000 n 
+0001839222 00000 n 
+0001838098 00000 n 
+0001835769 00000 n 
+0001838811 00000 n 
+0001838869 00000 n 
+0001838987 00000 n 
+0001839105 00000 n 
+0001841958 00000 n 
+0001842151 00000 n 
+0001843373 00000 n 
+0001841805 00000 n 
+0001839416 00000 n 
+0001842316 00000 n 
+0001842374 00000 n 
+0001842492 00000 n 
+0001842609 00000 n 
+0001842727 00000 n 
+0001842844 00000 n 
+0001842962 00000 n 
+0001843021 00000 n 
+0001843080 00000 n 
+0001843198 00000 n 
+0001843257 00000 n 
+0001843315 00000 n 
+0001846105 00000 n 
+0001847743 00000 n 
+0001845961 00000 n 
+0001843567 00000 n 
+0001846270 00000 n 
+0001846328 00000 n 
+0001846386 00000 n 
+0001846504 00000 n 
+0001846622 00000 n 
+0001846740 00000 n 
+0001846858 00000 n 
+0001846976 00000 n 
+0001847094 00000 n 
+0001847212 00000 n 
+0001847330 00000 n 
+0001847448 00000 n 
+0001847507 00000 n 
+0001847566 00000 n 
+0001847684 00000 n 
+0004464997 00000 n 
+0001850384 00000 n 
+0001850611 00000 n 
+0001850814 00000 n 
+0001851042 00000 n 
+0001851229 00000 n 
+0001851434 00000 n 
+0001851662 00000 n 
+0001851857 00000 n 
+0001852085 00000 n 
+0001852280 00000 n 
+0001852485 00000 n 
+0001852713 00000 n 
+0001852907 00000 n 
+0001853134 00000 n 
+0001853329 00000 n 
+0001853533 00000 n 
+0001853762 00000 n 
+0001853991 00000 n 
+0001854196 00000 n 
+0001854400 00000 n 
+0001854629 00000 n 
+0001854856 00000 n 
+0001855059 00000 n 
+0001855288 00000 n 
+0001855517 00000 n 
+0001855704 00000 n 
+0001855933 00000 n 
+0001856119 00000 n 
+0001856312 00000 n 
+0001856541 00000 n 
+0001856752 00000 n 
+0001856981 00000 n 
+0001857190 00000 n 
+0001861464 00000 n 
+0001857417 00000 n 
+0001858699 00000 n 
+0001849943 00000 n 
+0001847911 00000 n 
+0001857582 00000 n 
+0001857757 00000 n 
+0001857816 00000 n 
+0001857875 00000 n 
+0001857934 00000 n 
+0001857993 00000 n 
+0001858051 00000 n 
+0001858110 00000 n 
+0001858169 00000 n 
+0001858228 00000 n 
+0001858287 00000 n 
+0001858346 00000 n 
+0001858405 00000 n 
+0001858464 00000 n 
+0001858523 00000 n 
+0001858582 00000 n 
+0001858641 00000 n 
+0001876622 00000 n 
+0001861693 00000 n 
+0001861922 00000 n 
+0001862151 00000 n 
+0001862380 00000 n 
+0001862609 00000 n 
+0001862838 00000 n 
+0001863042 00000 n 
+0001863271 00000 n 
+0001863474 00000 n 
+0001863702 00000 n 
+0001863931 00000 n 
+0001864126 00000 n 
+0001864331 00000 n 
+0001864560 00000 n 
+0001864755 00000 n 
+0001864981 00000 n 
+0001865210 00000 n 
+0001865405 00000 n 
+0001865634 00000 n 
+0001865854 00000 n 
+0001866083 00000 n 
+0001866277 00000 n 
+0001866506 00000 n 
+0001866700 00000 n 
+0001866895 00000 n 
+0001867123 00000 n 
+0001867316 00000 n 
+0001867510 00000 n 
+0001867704 00000 n 
+0001867890 00000 n 
+0001868938 00000 n 
+0001861050 00000 n 
+0001858907 00000 n 
+0001868055 00000 n 
+0001868113 00000 n 
+0001868172 00000 n 
+0001868231 00000 n 
+0001868289 00000 n 
+0001868348 00000 n 
+0001868407 00000 n 
+0001868466 00000 n 
+0001868525 00000 n 
+0001868584 00000 n 
+0001868643 00000 n 
+0001868702 00000 n 
+0001868761 00000 n 
+0001868820 00000 n 
+0001868879 00000 n 
+0001876795 00000 n 
+0001876972 00000 n 
+0001877090 00000 n 
+0001871504 00000 n 
+0001871733 00000 n 
+0001871962 00000 n 
+0001872191 00000 n 
+0001875690 00000 n 
+0001872419 00000 n 
+0001872642 00000 n 
+0001871324 00000 n 
+0001869147 00000 n 
+0001872584 00000 n 
+0001875919 00000 n 
+0001876114 00000 n 
+0001876342 00000 n 
+0001877386 00000 n 
+0001875519 00000 n 
+0001872870 00000 n 
+0001876507 00000 n 
+0001876565 00000 n 
+0001876679 00000 n 
+0001876736 00000 n 
+0001876854 00000 n 
+0001876913 00000 n 
+0001877031 00000 n 
+0001877153 00000 n 
+0001877211 00000 n 
+0001879745 00000 n 
+0001879990 00000 n 
+0001880234 00000 n 
+0001880445 00000 n 
+0001880690 00000 n 
+0001880901 00000 n 
+0001881147 00000 n 
+0001881359 00000 n 
+0001881546 00000 n 
+0001881792 00000 n 
+0001881977 00000 n 
+0001882220 00000 n 
+0001882431 00000 n 
+0001882677 00000 n 
+0001882888 00000 n 
+0001883134 00000 n 
+0001883379 00000 n 
+0001883591 00000 n 
+0001883837 00000 n 
+0001884049 00000 n 
+0001884438 00000 n 
+0001885426 00000 n 
+0001879412 00000 n 
+0001877605 00000 n 
+0001884603 00000 n 
+0001884661 00000 n 
+0001884720 00000 n 
+0001884779 00000 n 
+0001884838 00000 n 
+0001884897 00000 n 
+0001884956 00000 n 
+0001885014 00000 n 
+0001885073 00000 n 
+0001885132 00000 n 
+0001885191 00000 n 
+0001885250 00000 n 
+0001885309 00000 n 
+0001884244 00000 n 
+0001888128 00000 n 
+0001888351 00000 n 
+0001888541 00000 n 
+0001888765 00000 n 
+0001888955 00000 n 
+0001889177 00000 n 
+0001889367 00000 n 
+0001889588 00000 n 
+0001889777 00000 n 
+0001889965 00000 n 
+0001890186 00000 n 
+0001890376 00000 n 
+0001890597 00000 n 
+0001890787 00000 n 
+0001890977 00000 n 
+0001891199 00000 n 
+0001891389 00000 n 
+0001891579 00000 n 
+0001891768 00000 n 
+0001891990 00000 n 
+0001892180 00000 n 
+0001892370 00000 n 
+0001892560 00000 n 
+0001892784 00000 n 
+0001892973 00000 n 
+0001893163 00000 n 
+0001893353 00000 n 
+0001893543 00000 n 
+0001893732 00000 n 
+0001893954 00000 n 
+0001894144 00000 n 
+0001894334 00000 n 
+0001894523 00000 n 
+0001894745 00000 n 
+0001894935 00000 n 
+0001895125 00000 n 
+0001895315 00000 n 
+0001895537 00000 n 
+0001895727 00000 n 
+0001895917 00000 n 
+0001896106 00000 n 
+0001896328 00000 n 
+0001896518 00000 n 
+0001896708 00000 n 
+0001896929 00000 n 
+0001897118 00000 n 
+0001897307 00000 n 
+0001897529 00000 n 
+0001897719 00000 n 
+0001897909 00000 n 
+0001898099 00000 n 
+0001898321 00000 n 
+0001898511 00000 n 
+0001898701 00000 n 
+0001898925 00000 n 
+0001899115 00000 n 
+0001902077 00000 n 
+0001902265 00000 n 
+0001899305 00000 n 
+0001899703 00000 n 
+0001887480 00000 n 
+0001885647 00000 n 
+0001899470 00000 n 
+0001899586 00000 n 
+0001899644 00000 n 
+0004465123 00000 n 
+0001902773 00000 n 
+0001902889 00000 n 
+0001903007 00000 n 
+0001903124 00000 n 
+0001903242 00000 n 
+0001903359 00000 n 
+0001903477 00000 n 
+0001903594 00000 n 
+0001903711 00000 n 
+0001903829 00000 n 
+0001903952 00000 n 
+0001909162 00000 n 
+0001909280 00000 n 
+0001909397 00000 n 
+0001909514 00000 n 
+0001909632 00000 n 
+0001902432 00000 n 
+0001904068 00000 n 
+0001901915 00000 n 
+0001899941 00000 n 
+0001902597 00000 n 
+0001902655 00000 n 
+0001902714 00000 n 
+0001902831 00000 n 
+0001902948 00000 n 
+0001903065 00000 n 
+0001903183 00000 n 
+0001903300 00000 n 
+0001903418 00000 n 
+0001903535 00000 n 
+0001903652 00000 n 
+0001903770 00000 n 
+0001903893 00000 n 
+0001904010 00000 n 
+0001906644 00000 n 
+0001906849 00000 n 
+0001907065 00000 n 
+0001907280 00000 n 
+0001907484 00000 n 
+0001907689 00000 n 
+0001907928 00000 n 
+0001908143 00000 n 
+0001908339 00000 n 
+0001908553 00000 n 
+0001908747 00000 n 
+0001912978 00000 n 
+0001913193 00000 n 
+0001908939 00000 n 
+0001910047 00000 n 
+0001906401 00000 n 
+0001904236 00000 n 
+0001909104 00000 n 
+0001909221 00000 n 
+0001909338 00000 n 
+0001909455 00000 n 
+0001909573 00000 n 
+0001909696 00000 n 
+0001909870 00000 n 
+0001909929 00000 n 
+0001909988 00000 n 
+0002006053 00000 n 
+0002008914 00000 n 
+0002009150 00000 n 
+0001913389 00000 n 
+0001913603 00000 n 
+0001913797 00000 n 
+0001913989 00000 n 
+0001914204 00000 n 
+0001914405 00000 n 
+0001914620 00000 n 
+0001914820 00000 n 
+0001915013 00000 n 
+0001915228 00000 n 
+0001915409 00000 n 
+0001915595 00000 n 
+0001915800 00000 n 
+0001916039 00000 n 
+0001916254 00000 n 
+0001916441 00000 n 
+0001916646 00000 n 
+0001916885 00000 n 
+0001917100 00000 n 
+0001917294 00000 n 
+0001917499 00000 n 
+0001917738 00000 n 
+0001917953 00000 n 
+0001918141 00000 n 
+0001918345 00000 n 
+0001918584 00000 n 
+0001918798 00000 n 
+0001918979 00000 n 
+0001919183 00000 n 
+0001919421 00000 n 
+0001919602 00000 n 
+0001919817 00000 n 
+0001919999 00000 n 
+0001920204 00000 n 
+0001920419 00000 n 
+0001920624 00000 n 
+0001920840 00000 n 
+0001921011 00000 n 
+0001921207 00000 n 
+0001921421 00000 n 
+0001921617 00000 n 
+0001921832 00000 n 
+0001922028 00000 n 
+0001922244 00000 n 
+0001922439 00000 n 
+0001922654 00000 n 
+0001922855 00000 n 
+0001923070 00000 n 
+0001923271 00000 n 
+0001923486 00000 n 
+0001923682 00000 n 
+0001923896 00000 n 
+0001924082 00000 n 
+0001924277 00000 n 
+0001924490 00000 n 
+0001924680 00000 n 
+0001924875 00000 n 
+0001925088 00000 n 
+0001929208 00000 n 
+0001929403 00000 n 
+0001929616 00000 n 
+0001929801 00000 n 
+0001925272 00000 n 
+0001926201 00000 n 
+0001912294 00000 n 
+0001910268 00000 n 
+0001925437 00000 n 
+0001925495 00000 n 
+0001925554 00000 n 
+0001925613 00000 n 
+0001925672 00000 n 
+0001925731 00000 n 
+0001925790 00000 n 
+0001925848 00000 n 
+0001925907 00000 n 
+0001925966 00000 n 
+0001926025 00000 n 
+0001926084 00000 n 
+0001926143 00000 n 
+0002009385 00000 n 
+0002012458 00000 n 
+0002012694 00000 n 
+0002012929 00000 n 
+0002016101 00000 n 
+0002016337 00000 n 
+0002016572 00000 n 
+0002016808 00000 n 
+0002020100 00000 n 
+0001930017 00000 n 
+0001930233 00000 n 
+0001930449 00000 n 
+0001930665 00000 n 
+0001930847 00000 n 
+0001931063 00000 n 
+0001931279 00000 n 
+0001931495 00000 n 
+0001931709 00000 n 
+0001931893 00000 n 
+0001932109 00000 n 
+0001932305 00000 n 
+0001932521 00000 n 
+0001932716 00000 n 
+0001932931 00000 n 
+0001933127 00000 n 
+0001933332 00000 n 
+0001933537 00000 n 
+0001933752 00000 n 
+0001933948 00000 n 
+0001934153 00000 n 
+0001934358 00000 n 
+0001934544 00000 n 
+0001934760 00000 n 
+0001934956 00000 n 
+0001935160 00000 n 
+0001935364 00000 n 
+0001935580 00000 n 
+0001935776 00000 n 
+0001935980 00000 n 
+0001936184 00000 n 
+0001936371 00000 n 
+0001936587 00000 n 
+0001936782 00000 n 
+0001936987 00000 n 
+0001937192 00000 n 
+0001937601 00000 n 
+0001937805 00000 n 
+0001937969 00000 n 
+0001938185 00000 n 
+0001938367 00000 n 
+0001938582 00000 n 
+0001938762 00000 n 
+0001938978 00000 n 
+0001939190 00000 n 
+0001943338 00000 n 
+0001943552 00000 n 
+0001943745 00000 n 
+0001943959 00000 n 
+0001944154 00000 n 
+0001944368 00000 n 
+0001939376 00000 n 
+0001939893 00000 n 
+0001928614 00000 n 
+0001926411 00000 n 
+0001939541 00000 n 
+0001939599 00000 n 
+0001939658 00000 n 
+0001939717 00000 n 
+0001939776 00000 n 
+0001939835 00000 n 
+0001937396 00000 n 
+0002020277 00000 n 
+0002020395 00000 n 
+0002020577 00000 n 
+0002020695 00000 n 
+0002024342 00000 n 
+0002024519 00000 n 
+0002024695 00000 n 
+0002024929 00000 n 
+0002029279 00000 n 
+0002029520 00000 n 
+0002033350 00000 n 
+0002033591 00000 n 
+0002033772 00000 n 
+0002033949 00000 n 
+0002037248 00000 n 
+0001944564 00000 n 
+0001944778 00000 n 
+0001944966 00000 n 
+0001945180 00000 n 
+0001945376 00000 n 
+0001945590 00000 n 
+0001945786 00000 n 
+0001945999 00000 n 
+0001946187 00000 n 
+0001946401 00000 n 
+0001946597 00000 n 
+0001946811 00000 n 
+0001946999 00000 n 
+0001947211 00000 n 
+0001947406 00000 n 
+0001947620 00000 n 
+0001947821 00000 n 
+0001948035 00000 n 
+0001948236 00000 n 
+0001948450 00000 n 
+0001948636 00000 n 
+0001948801 00000 n 
+0001949015 00000 n 
+0001949207 00000 n 
+0001949373 00000 n 
+0001949587 00000 n 
+0001949769 00000 n 
+0001949983 00000 n 
+0001950164 00000 n 
+0001950380 00000 n 
+0001950561 00000 n 
+0001950775 00000 n 
+0001950955 00000 n 
+0001951133 00000 n 
+0001951349 00000 n 
+0001951531 00000 n 
+0001951710 00000 n 
+0001951925 00000 n 
+0001952111 00000 n 
+0001952307 00000 n 
+0001952519 00000 n 
+0001952695 00000 n 
+0001952911 00000 n 
+0001953097 00000 n 
+0001953293 00000 n 
+0001953499 00000 n 
+0001953675 00000 n 
+0001953891 00000 n 
+0001954077 00000 n 
+0001954282 00000 n 
+0001954478 00000 n 
+0001954689 00000 n 
+0001954900 00000 n 
+0001959528 00000 n 
+0001959744 00000 n 
+0001959930 00000 n 
+0001960135 00000 n 
+0001960330 00000 n 
+0001960542 00000 n 
+0001960753 00000 n 
+0001955070 00000 n 
+0001955293 00000 n 
+0001942663 00000 n 
+0001940062 00000 n 
+0001955235 00000 n 
+0002037430 00000 n 
+0002037607 00000 n 
+0002037843 00000 n 
+0002040666 00000 n 
+0002040902 00000 n 
+0002041137 00000 n 
+0002044086 00000 n 
+0002044321 00000 n 
+0002044556 00000 n 
+0002044792 00000 n 
+0002048059 00000 n 
+0002048295 00000 n 
+0002048526 00000 n 
+0002048762 00000 n 
+0002052462 00000 n 
+0002052639 00000 n 
+0002052815 00000 n 
+0002052991 00000 n 
+0002053168 00000 n 
+0002057806 00000 n 
+0002058042 00000 n 
+0002058277 00000 n 
+0001960924 00000 n 
+0001961140 00000 n 
+0001961336 00000 n 
+0001961541 00000 n 
+0001961736 00000 n 
+0001961947 00000 n 
+0001962119 00000 n 
+0001962335 00000 n 
+0001962531 00000 n 
+0001962736 00000 n 
+0001962932 00000 n 
+0001963144 00000 n 
+0001963315 00000 n 
+0001963531 00000 n 
+0001963716 00000 n 
+0001963912 00000 n 
+0001964304 00000 n 
+0001964516 00000 n 
+0001964703 00000 n 
+0001964919 00000 n 
+0001965105 00000 n 
+0001965301 00000 n 
+0001965693 00000 n 
+0001965905 00000 n 
+0001966092 00000 n 
+0001966305 00000 n 
+0001966487 00000 n 
+0001966653 00000 n 
+0001966869 00000 n 
+0001967061 00000 n 
+0001967266 00000 n 
+0001967676 00000 n 
+0001967881 00000 n 
+0001968077 00000 n 
+0001968244 00000 n 
+0001968458 00000 n 
+0001968662 00000 n 
+0001968901 00000 n 
+0001969117 00000 n 
+0001969309 00000 n 
+0001969514 00000 n 
+0001969752 00000 n 
+0001969966 00000 n 
+0001970179 00000 n 
+0001970359 00000 n 
+0001970522 00000 n 
+0001970735 00000 n 
+0001970917 00000 n 
+0001971077 00000 n 
+0001971290 00000 n 
+0001971472 00000 n 
+0001971635 00000 n 
+0001971851 00000 n 
+0001972033 00000 n 
+0001972229 00000 n 
+0001972391 00000 n 
+0001972607 00000 n 
+0001972789 00000 n 
+0001972985 00000 n 
+0001973148 00000 n 
+0001973363 00000 n 
+0001973545 00000 n 
+0001973741 00000 n 
+0001977269 00000 n 
+0001977483 00000 n 
+0001973902 00000 n 
+0001974184 00000 n 
+0001958727 00000 n 
+0001955503 00000 n 
+0001974067 00000 n 
+0001964108 00000 n 
+0001965497 00000 n 
+0001967471 00000 n 
+0001974125 00000 n 
+0004465249 00000 n 
+0002062462 00000 n 
+0002062698 00000 n 
+0002067385 00000 n 
+0002067621 00000 n 
+0002067857 00000 n 
+0002073356 00000 n 
+0002073529 00000 n 
+0002077923 00000 n 
+0002078100 00000 n 
+0002078277 00000 n 
+0002078513 00000 n 
+0002082967 00000 n 
+0002083202 00000 n 
+0002083436 00000 n 
+0002088179 00000 n 
+0001977688 00000 n 
+0001977879 00000 n 
+0001978093 00000 n 
+0001978297 00000 n 
+0001978488 00000 n 
+0001978702 00000 n 
+0001978883 00000 n 
+0001979055 00000 n 
+0001979268 00000 n 
+0001979460 00000 n 
+0001979674 00000 n 
+0001979879 00000 n 
+0001980259 00000 n 
+0001980473 00000 n 
+0001980665 00000 n 
+0001980879 00000 n 
+0001981065 00000 n 
+0001981270 00000 n 
+0001981482 00000 n 
+0001981673 00000 n 
+0001981856 00000 n 
+0001982070 00000 n 
+0001982282 00000 n 
+0001982462 00000 n 
+0001982676 00000 n 
+0001982890 00000 n 
+0001983104 00000 n 
+0001983320 00000 n 
+0001983536 00000 n 
+0001983741 00000 n 
+0001983955 00000 n 
+0001984160 00000 n 
+0001984374 00000 n 
+0001984590 00000 n 
+0001984794 00000 n 
+0001985009 00000 n 
+0001985191 00000 n 
+0001985407 00000 n 
+0001989523 00000 n 
+0001989739 00000 n 
+0001985622 00000 n 
+0001986551 00000 n 
+0001976756 00000 n 
+0001974407 00000 n 
+0001985787 00000 n 
+0001980070 00000 n 
+0001985845 00000 n 
+0001985904 00000 n 
+0001985961 00000 n 
+0001986020 00000 n 
+0001986079 00000 n 
+0001986138 00000 n 
+0001986197 00000 n 
+0001986256 00000 n 
+0001986315 00000 n 
+0001986374 00000 n 
+0001986433 00000 n 
+0001986492 00000 n 
+0002088415 00000 n 
+0002088651 00000 n 
+0002094323 00000 n 
+0002094500 00000 n 
+0002094735 00000 n 
+0002094911 00000 n 
+0002100479 00000 n 
+0002100719 00000 n 
+0002105000 00000 n 
+0001989920 00000 n 
+0001990136 00000 n 
+0001990318 00000 n 
+0001990500 00000 n 
+0001990715 00000 n 
+0001990897 00000 n 
+0001991079 00000 n 
+0001991295 00000 n 
+0001991476 00000 n 
+0001991658 00000 n 
+0001991874 00000 n 
+0001992055 00000 n 
+0001992237 00000 n 
+0001992453 00000 n 
+0001992635 00000 n 
+0001992817 00000 n 
+0001992998 00000 n 
+0001993166 00000 n 
+0001993336 00000 n 
+0001993677 00000 n 
+0001989199 00000 n 
+0001986774 00000 n 
+0001993501 00000 n 
+0001993559 00000 n 
+0001993618 00000 n 
+0002105182 00000 n 
+0002105300 00000 n 
+0002105423 00000 n 
+0002105540 00000 n 
+0001995577 00000 n 
+0001995793 00000 n 
+0001996009 00000 n 
+0001996225 00000 n 
+0001996440 00000 n 
+0001996656 00000 n 
+0001996872 00000 n 
+0002000304 00000 n 
+0002000519 00000 n 
+0001997088 00000 n 
+0001997311 00000 n 
+0001995370 00000 n 
+0001993896 00000 n 
+0001997253 00000 n 
+0002000757 00000 n 
+0002000973 00000 n 
+0002001189 00000 n 
+0002001404 00000 n 
+0002005103 00000 n 
+0002005318 00000 n 
+0002001642 00000 n 
+0002001865 00000 n 
+0002000106 00000 n 
+0001997501 00000 n 
+0002001807 00000 n 
+0002005556 00000 n 
+0002005771 00000 n 
+0002006229 00000 n 
+0002004932 00000 n 
+0002002080 00000 n 
+0002005936 00000 n 
+0002005994 00000 n 
+0002006112 00000 n 
+0002006171 00000 n 
+0002008632 00000 n 
+0002009562 00000 n 
+0002008488 00000 n 
+0002006472 00000 n 
+0002008797 00000 n 
+0002008855 00000 n 
+0002008973 00000 n 
+0002009032 00000 n 
+0002009091 00000 n 
+0002009209 00000 n 
+0002009268 00000 n 
+0002009326 00000 n 
+0002009444 00000 n 
+0002009503 00000 n 
+0004465375 00000 n 
+0002012176 00000 n 
+0002013165 00000 n 
+0002012032 00000 n 
+0002009730 00000 n 
+0002012341 00000 n 
+0002012399 00000 n 
+0002012517 00000 n 
+0002012576 00000 n 
+0002012635 00000 n 
+0002012753 00000 n 
+0002012811 00000 n 
+0002012870 00000 n 
+0002012988 00000 n 
+0002013047 00000 n 
+0002013106 00000 n 
+0002015878 00000 n 
+0002016866 00000 n 
+0002015734 00000 n 
+0002013333 00000 n 
+0002016043 00000 n 
+0002016160 00000 n 
+0002016219 00000 n 
+0002016278 00000 n 
+0002016396 00000 n 
+0002016454 00000 n 
+0002016513 00000 n 
+0002016631 00000 n 
+0002016690 00000 n 
+0002016749 00000 n 
+0002019700 00000 n 
+0002020875 00000 n 
+0002019556 00000 n 
+0002017047 00000 n 
+0002019865 00000 n 
+0002019923 00000 n 
+0002019982 00000 n 
+0002020041 00000 n 
+0002020159 00000 n 
+0002020218 00000 n 
+0002020336 00000 n 
+0002020459 00000 n 
+0002020518 00000 n 
+0002020636 00000 n 
+0002020758 00000 n 
+0002020816 00000 n 
+0002023931 00000 n 
+0002028434 00000 n 
+0002024119 00000 n 
+0002025110 00000 n 
+0002023778 00000 n 
+0002021056 00000 n 
+0002024284 00000 n 
+0002024401 00000 n 
+0002024460 00000 n 
+0002024578 00000 n 
+0002024636 00000 n 
+0002024754 00000 n 
+0002024813 00000 n 
+0002024871 00000 n 
+0002024992 00000 n 
+0002025051 00000 n 
+0002028622 00000 n 
+0002028810 00000 n 
+0002028997 00000 n 
+0002029702 00000 n 
+0002028263 00000 n 
+0002025291 00000 n 
+0002029162 00000 n 
+0002029220 00000 n 
+0002029343 00000 n 
+0002029402 00000 n 
+0002029461 00000 n 
+0002029584 00000 n 
+0002029643 00000 n 
+0002032904 00000 n 
+0002033068 00000 n 
+0002034066 00000 n 
+0002032751 00000 n 
+0002029883 00000 n 
+0002033233 00000 n 
+0002033291 00000 n 
+0002033414 00000 n 
+0002033473 00000 n 
+0002033532 00000 n 
+0002033654 00000 n 
+0002033713 00000 n 
+0002033831 00000 n 
+0002033890 00000 n 
+0002034007 00000 n 
+0004465501 00000 n 
+0002036966 00000 n 
+0002038078 00000 n 
+0002036822 00000 n 
+0002034247 00000 n 
+0002037131 00000 n 
+0002037189 00000 n 
+0002037312 00000 n 
+0002037371 00000 n 
+0002037489 00000 n 
+0002037548 00000 n 
+0002037666 00000 n 
+0002037725 00000 n 
+0002037784 00000 n 
+0002037902 00000 n 
+0002037961 00000 n 
+0002038020 00000 n 
+0002040443 00000 n 
+0002041373 00000 n 
+0002040299 00000 n 
+0002038259 00000 n 
+0002040608 00000 n 
+0002040725 00000 n 
+0002040784 00000 n 
+0002040843 00000 n 
+0002040960 00000 n 
+0002041019 00000 n 
+0002041078 00000 n 
+0002041196 00000 n 
+0002041255 00000 n 
+0002041314 00000 n 
+0002043863 00000 n 
+0002044969 00000 n 
+0002043719 00000 n 
+0002041554 00000 n 
+0002044028 00000 n 
+0002044145 00000 n 
+0002044204 00000 n 
+0002044263 00000 n 
+0002044379 00000 n 
+0002044438 00000 n 
+0002044497 00000 n 
+0002044615 00000 n 
+0002044674 00000 n 
+0002044733 00000 n 
+0002044851 00000 n 
+0002044910 00000 n 
+0002047613 00000 n 
+0002051593 00000 n 
+0002047777 00000 n 
+0002048878 00000 n 
+0002047460 00000 n 
+0002045150 00000 n 
+0002047942 00000 n 
+0002048000 00000 n 
+0002048118 00000 n 
+0002048177 00000 n 
+0002048236 00000 n 
+0002048354 00000 n 
+0002048409 00000 n 
+0002048467 00000 n 
+0002048585 00000 n 
+0002048644 00000 n 
+0002048703 00000 n 
+0002048820 00000 n 
+0002051758 00000 n 
+0002051943 00000 n 
+0002056824 00000 n 
+0002052121 00000 n 
+0002053284 00000 n 
+0002051422 00000 n 
+0002049059 00000 n 
+0002052286 00000 n 
+0002052344 00000 n 
+0002052403 00000 n 
+0002052521 00000 n 
+0002052580 00000 n 
+0002052698 00000 n 
+0002052757 00000 n 
+0002052873 00000 n 
+0002052932 00000 n 
+0002053050 00000 n 
+0002053109 00000 n 
+0002053226 00000 n 
+0002057003 00000 n 
+0002057178 00000 n 
+0002057354 00000 n 
+0002057524 00000 n 
+0002058395 00000 n 
+0002056644 00000 n 
+0002053465 00000 n 
+0002057689 00000 n 
+0002057747 00000 n 
+0002057865 00000 n 
+0002057924 00000 n 
+0002057983 00000 n 
+0002058101 00000 n 
+0002058160 00000 n 
+0002058219 00000 n 
+0002058336 00000 n 
+0004465627 00000 n 
+0002061781 00000 n 
+0002061952 00000 n 
+0002062123 00000 n 
+0002062875 00000 n 
+0002061619 00000 n 
+0002058613 00000 n 
+0002062288 00000 n 
+0002062346 00000 n 
+0002062405 00000 n 
+0002062521 00000 n 
+0002062580 00000 n 
+0002062639 00000 n 
+0002062757 00000 n 
+0002062816 00000 n 
+0002066555 00000 n 
+0002066727 00000 n 
+0002066915 00000 n 
+0002067103 00000 n 
+0002067975 00000 n 
+0002066384 00000 n 
+0002063093 00000 n 
+0002067268 00000 n 
+0002067326 00000 n 
+0002067444 00000 n 
+0002067503 00000 n 
+0002067562 00000 n 
+0002067680 00000 n 
+0002067739 00000 n 
+0002067798 00000 n 
+0002067916 00000 n 
+0002071713 00000 n 
+0002071879 00000 n 
+0002072045 00000 n 
+0002072230 00000 n 
+0002072446 00000 n 
+0002072613 00000 n 
+0002072829 00000 n 
+0002073015 00000 n 
+0002073765 00000 n 
+0002071506 00000 n 
+0002068193 00000 n 
+0002073180 00000 n 
+0002073238 00000 n 
+0002073297 00000 n 
+0002073415 00000 n 
+0002073470 00000 n 
+0002073588 00000 n 
+0002073647 00000 n 
+0002073706 00000 n 
+0002077029 00000 n 
+0002077191 00000 n 
+0002077366 00000 n 
+0002077527 00000 n 
+0002077700 00000 n 
+0002078689 00000 n 
+0002076849 00000 n 
+0002073946 00000 n 
+0002077865 00000 n 
+0002077982 00000 n 
+0002078041 00000 n 
+0002078159 00000 n 
+0002078218 00000 n 
+0002078336 00000 n 
+0002078395 00000 n 
+0002078454 00000 n 
+0002078572 00000 n 
+0002078630 00000 n 
+0002081673 00000 n 
+0002081836 00000 n 
+0002082011 00000 n 
+0002082173 00000 n 
+0002082348 00000 n 
+0002082510 00000 n 
+0002082685 00000 n 
+0002083611 00000 n 
+0002081475 00000 n 
+0002078870 00000 n 
+0002082850 00000 n 
+0002082908 00000 n 
+0002083026 00000 n 
+0002083085 00000 n 
+0002083144 00000 n 
+0002083260 00000 n 
+0002083319 00000 n 
+0002083378 00000 n 
+0002083494 00000 n 
+0002083553 00000 n 
+0002086965 00000 n 
+0002087127 00000 n 
+0002087302 00000 n 
+0002087492 00000 n 
+0002087707 00000 n 
+0002087897 00000 n 
+0002088828 00000 n 
+0002086776 00000 n 
+0002083792 00000 n 
+0002088062 00000 n 
+0002088120 00000 n 
+0002088238 00000 n 
+0002088297 00000 n 
+0002088356 00000 n 
+0002088474 00000 n 
+0002088533 00000 n 
+0002088592 00000 n 
+0002088710 00000 n 
+0002088769 00000 n 
+0004465753 00000 n 
+0002092495 00000 n 
+0002092710 00000 n 
+0002092883 00000 n 
+0002093099 00000 n 
+0002093284 00000 n 
+0002093469 00000 n 
+0002093849 00000 n 
+0002094041 00000 n 
+0002095029 00000 n 
+0002092279 00000 n 
+0002089071 00000 n 
+0002094206 00000 n 
+0002094264 00000 n 
+0002094382 00000 n 
+0002094441 00000 n 
+0002094559 00000 n 
+0002094617 00000 n 
+0002094676 00000 n 
+0002094793 00000 n 
+0002093659 00000 n 
+0002094852 00000 n 
+0002094970 00000 n 
+0002098781 00000 n 
+0002098985 00000 n 
+0002099188 00000 n 
+0002099392 00000 n 
+0002099583 00000 n 
+0002099797 00000 n 
+0002100013 00000 n 
+0002100197 00000 n 
+0002100900 00000 n 
+0002098574 00000 n 
+0002095272 00000 n 
+0002100362 00000 n 
+0002100420 00000 n 
+0002100543 00000 n 
+0002100602 00000 n 
+0002100661 00000 n 
+0002100782 00000 n 
+0002100841 00000 n 
+0002103949 00000 n 
+0002104320 00000 n 
+0002104536 00000 n 
+0002108224 00000 n 
+0002104718 00000 n 
+0002105897 00000 n 
+0002103769 00000 n 
+0002101106 00000 n 
+0002104883 00000 n 
+0002104941 00000 n 
+0002104134 00000 n 
+0002105064 00000 n 
+0002105123 00000 n 
+0002105241 00000 n 
+0002105364 00000 n 
+0002105481 00000 n 
+0002105604 00000 n 
+0002105663 00000 n 
+0002105722 00000 n 
+0002108430 00000 n 
+0002108612 00000 n 
+0002108840 00000 n 
+0002109067 00000 n 
+0002109247 00000 n 
+0002109474 00000 n 
+0002109668 00000 n 
+0002109896 00000 n 
+0002110124 00000 n 
+0002110318 00000 n 
+0002110547 00000 n 
+0002110729 00000 n 
+0002110911 00000 n 
+0002111106 00000 n 
+0002114853 00000 n 
+0002111287 00000 n 
+0002112273 00000 n 
+0002107945 00000 n 
+0002106103 00000 n 
+0002111452 00000 n 
+0002111510 00000 n 
+0002111569 00000 n 
+0002111628 00000 n 
+0002111687 00000 n 
+0002111746 00000 n 
+0002111805 00000 n 
+0002111864 00000 n 
+0002111923 00000 n 
+0002111982 00000 n 
+0002112041 00000 n 
+0002112099 00000 n 
+0002115080 00000 n 
+0002115273 00000 n 
+0002115499 00000 n 
+0002115758 00000 n 
+0002116017 00000 n 
+0002116275 00000 n 
+0002116468 00000 n 
+0002116692 00000 n 
+0002116918 00000 n 
+0002117123 00000 n 
+0002117350 00000 n 
+0002117576 00000 n 
+0002117769 00000 n 
+0002117995 00000 n 
+0002118188 00000 n 
+0002118392 00000 n 
+0002118618 00000 n 
+0002118811 00000 n 
+0002119015 00000 n 
+0002119240 00000 n 
+0002119432 00000 n 
+0002119635 00000 n 
+0002119838 00000 n 
+0002120062 00000 n 
+0002120254 00000 n 
+0002120481 00000 n 
+0002120674 00000 n 
+0002120878 00000 n 
+0002121105 00000 n 
+0002121332 00000 n 
+0002121537 00000 n 
+0002121741 00000 n 
+0002121968 00000 n 
+0002122195 00000 n 
+0002122400 00000 n 
+0002122626 00000 n 
+0002122812 00000 n 
+0002122998 00000 n 
+0002123225 00000 n 
+0002123417 00000 n 
+0002123644 00000 n 
+0002123829 00000 n 
+0002124054 00000 n 
+0002124240 00000 n 
+0002124445 00000 n 
+0002124670 00000 n 
+0002124896 00000 n 
+0002125123 00000 n 
+0002125350 00000 n 
+0002129733 00000 n 
+0002129960 00000 n 
+0002125576 00000 n 
+0002126799 00000 n 
+0002114259 00000 n 
+0002112508 00000 n 
+0002125741 00000 n 
+0002125799 00000 n 
+0002125858 00000 n 
+0002125916 00000 n 
+0002125975 00000 n 
+0002126034 00000 n 
+0002126093 00000 n 
+0002126151 00000 n 
+0002126209 00000 n 
+0002126268 00000 n 
+0002126327 00000 n 
+0002126386 00000 n 
+0002126445 00000 n 
+0002126504 00000 n 
+0002126563 00000 n 
+0002126622 00000 n 
+0002126681 00000 n 
+0002126740 00000 n 
+0004033479 00000 n 
+0002188032 00000 n 
+0002188150 00000 n 
+0002188214 00000 n 
+0002188276 00000 n 
+0002210507 00000 n 
+0002192918 00000 n 
+0002193036 00000 n 
+0002193748 00000 n 
+0002193866 00000 n 
+0002197989 00000 n 
+0002130187 00000 n 
+0002130413 00000 n 
+0002130598 00000 n 
+0002130825 00000 n 
+0002131029 00000 n 
+0002131256 00000 n 
+0002131460 00000 n 
+0002131687 00000 n 
+0002131914 00000 n 
+0002132107 00000 n 
+0002132334 00000 n 
+0002132527 00000 n 
+0002132754 00000 n 
+0002132979 00000 n 
+0002133206 00000 n 
+0002133433 00000 n 
+0002133659 00000 n 
+0002133886 00000 n 
+0002134113 00000 n 
+0002134338 00000 n 
+0002134529 00000 n 
+0002134756 00000 n 
+0002134983 00000 n 
+0002135209 00000 n 
+0002135436 00000 n 
+0002135629 00000 n 
+0002135854 00000 n 
+0002136050 00000 n 
+0002136255 00000 n 
+0002136481 00000 n 
+0002136672 00000 n 
+0002136895 00000 n 
+0002137089 00000 n 
+0002137317 00000 n 
+0002137527 00000 n 
+0002137730 00000 n 
+0002137955 00000 n 
+0002138146 00000 n 
+0002138371 00000 n 
+0002142240 00000 n 
+0002142469 00000 n 
+0002142662 00000 n 
+0002142889 00000 n 
+0002143085 00000 n 
+0002143290 00000 n 
+0002143483 00000 n 
+0002143708 00000 n 
+0002143904 00000 n 
+0002144134 00000 n 
+0002144346 00000 n 
+0002144551 00000 n 
+0002138574 00000 n 
+0002139619 00000 n 
+0002129220 00000 n 
+0002127034 00000 n 
+0002138739 00000 n 
+0002138797 00000 n 
+0002138856 00000 n 
+0002138915 00000 n 
+0002138974 00000 n 
+0002139033 00000 n 
+0002139092 00000 n 
+0002139151 00000 n 
+0002139210 00000 n 
+0002139269 00000 n 
+0002139327 00000 n 
+0002139386 00000 n 
+0002139445 00000 n 
+0002139504 00000 n 
+0002139562 00000 n 
+0004465879 00000 n 
+0002198111 00000 n 
+0002198293 00000 n 
+0002198470 00000 n 
+0002198587 00000 n 
+0002198710 00000 n 
+0002198833 00000 n 
+0002193218 00000 n 
+0002193395 00000 n 
+0002144778 00000 n 
+0002144971 00000 n 
+0002145198 00000 n 
+0002145403 00000 n 
+0002145596 00000 n 
+0002145823 00000 n 
+0002146019 00000 n 
+0002146222 00000 n 
+0002146427 00000 n 
+0002146654 00000 n 
+0002146846 00000 n 
+0002147073 00000 n 
+0002147300 00000 n 
+0002147492 00000 n 
+0002147718 00000 n 
+0002147922 00000 n 
+0002148148 00000 n 
+0002148386 00000 n 
+0002148612 00000 n 
+0002148804 00000 n 
+0002149031 00000 n 
+0002149224 00000 n 
+0002149417 00000 n 
+0002149608 00000 n 
+0002149834 00000 n 
+0002150029 00000 n 
+0002150233 00000 n 
+0002150685 00000 n 
+0002150911 00000 n 
+0002151103 00000 n 
+0002151329 00000 n 
+0002151525 00000 n 
+0002151755 00000 n 
+0002151966 00000 n 
+0002152170 00000 n 
+0002152397 00000 n 
+0002152851 00000 n 
+0002153043 00000 n 
+0002153270 00000 n 
+0002153474 00000 n 
+0002153700 00000 n 
+0002153892 00000 n 
+0002154119 00000 n 
+0002154315 00000 n 
+0002154520 00000 n 
+0002154747 00000 n 
+0002154939 00000 n 
+0002155166 00000 n 
+0002155362 00000 n 
+0002155592 00000 n 
+0002155803 00000 n 
+0002156007 00000 n 
+0002156234 00000 n 
+0002161010 00000 n 
+0002161202 00000 n 
+0002161428 00000 n 
+0002161633 00000 n 
+0002161859 00000 n 
+0002162051 00000 n 
+0002162277 00000 n 
+0002162473 00000 n 
+0002162678 00000 n 
+0002156683 00000 n 
+0002157673 00000 n 
+0002141484 00000 n 
+0002139829 00000 n 
+0002156848 00000 n 
+0002156906 00000 n 
+0002156965 00000 n 
+0002157024 00000 n 
+0002157083 00000 n 
+0002157142 00000 n 
+0002157201 00000 n 
+0002157260 00000 n 
+0002157319 00000 n 
+0002157378 00000 n 
+0002157437 00000 n 
+0002150459 00000 n 
+0002157496 00000 n 
+0002152624 00000 n 
+0002157555 00000 n 
+0002157614 00000 n 
+0002156459 00000 n 
+0002193571 00000 n 
+0002202158 00000 n 
+0002202276 00000 n 
+0002202394 00000 n 
+0002162904 00000 n 
+0002163130 00000 n 
+0002163323 00000 n 
+0002163516 00000 n 
+0002163743 00000 n 
+0002163936 00000 n 
+0002164128 00000 n 
+0002164355 00000 n 
+0002164582 00000 n 
+0002164807 00000 n 
+0002164999 00000 n 
+0002165191 00000 n 
+0002165417 00000 n 
+0002165609 00000 n 
+0002165800 00000 n 
+0002165992 00000 n 
+0002166219 00000 n 
+0002166415 00000 n 
+0002166620 00000 n 
+0002166812 00000 n 
+0002167038 00000 n 
+0002167234 00000 n 
+0002167643 00000 n 
+0002167835 00000 n 
+0002168062 00000 n 
+0002168266 00000 n 
+0002168458 00000 n 
+0002168685 00000 n 
+0002168881 00000 n 
+0002169086 00000 n 
+0002169278 00000 n 
+0002169505 00000 n 
+0002169701 00000 n 
+0002170110 00000 n 
+0002170302 00000 n 
+0002170528 00000 n 
+0002170733 00000 n 
+0002170925 00000 n 
+0002171151 00000 n 
+0002171347 00000 n 
+0002171552 00000 n 
+0002171779 00000 n 
+0002171972 00000 n 
+0002172165 00000 n 
+0002175828 00000 n 
+0002176054 00000 n 
+0002172357 00000 n 
+0002172698 00000 n 
+0002160371 00000 n 
+0002157881 00000 n 
+0002172522 00000 n 
+0002172580 00000 n 
+0002167439 00000 n 
+0002169906 00000 n 
+0002172639 00000 n 
+0002202511 00000 n 
+0002202629 00000 n 
+0002202746 00000 n 
+0002202864 00000 n 
+0002203100 00000 n 
+0002203218 00000 n 
+0002203454 00000 n 
+0002176280 00000 n 
+0002176506 00000 n 
+0002176732 00000 n 
+0002176958 00000 n 
+0002177184 00000 n 
+0002177410 00000 n 
+0002177637 00000 n 
+0002177863 00000 n 
+0002178089 00000 n 
+0002178315 00000 n 
+0002178542 00000 n 
+0002178768 00000 n 
+0002178995 00000 n 
+0002179221 00000 n 
+0002179447 00000 n 
+0002179673 00000 n 
+0002179900 00000 n 
+0002180126 00000 n 
+0002180352 00000 n 
+0002180578 00000 n 
+0002180799 00000 n 
+0002181025 00000 n 
+0002181252 00000 n 
+0002181478 00000 n 
+0002181705 00000 n 
+0002181929 00000 n 
+0002185510 00000 n 
+0002185736 00000 n 
+0002182154 00000 n 
+0002182377 00000 n 
+0002175432 00000 n 
+0002172980 00000 n 
+0002182319 00000 n 
+0002185962 00000 n 
+0002186187 00000 n 
+0002186412 00000 n 
+0002186616 00000 n 
+0002186843 00000 n 
+0002187070 00000 n 
+0002187296 00000 n 
+0002187523 00000 n 
+0002191368 00000 n 
+0002187750 00000 n 
+0002188339 00000 n 
+0002185276 00000 n 
+0002182620 00000 n 
+0002187915 00000 n 
+0002187973 00000 n 
+0002188091 00000 n 
+0002191561 00000 n 
+0002191754 00000 n 
+0002191983 00000 n 
+0002192194 00000 n 
+0002192424 00000 n 
+0002192636 00000 n 
+0002193929 00000 n 
+0002191170 00000 n 
+0002188610 00000 n 
+0002192801 00000 n 
+0002192859 00000 n 
+0002192977 00000 n 
+0002193100 00000 n 
+0002193159 00000 n 
+0002193277 00000 n 
+0002193336 00000 n 
+0002193454 00000 n 
+0002193512 00000 n 
+0002193630 00000 n 
+0002193689 00000 n 
+0002193807 00000 n 
+0002197295 00000 n 
+0002197480 00000 n 
+0002197707 00000 n 
+0002198953 00000 n 
+0002197133 00000 n 
+0002194110 00000 n 
+0002197872 00000 n 
+0002197930 00000 n 
+0002198052 00000 n 
+0002198175 00000 n 
+0002198234 00000 n 
+0002198352 00000 n 
+0002198411 00000 n 
+0002198528 00000 n 
+0002198651 00000 n 
+0002198774 00000 n 
+0002198895 00000 n 
+0004466005 00000 n 
+0002201365 00000 n 
+0002201590 00000 n 
+0002201817 00000 n 
+0002203570 00000 n 
+0002201203 00000 n 
+0002199134 00000 n 
+0002201982 00000 n 
+0002202040 00000 n 
+0002202099 00000 n 
+0002202217 00000 n 
+0002202335 00000 n 
+0002202452 00000 n 
+0002202570 00000 n 
+0002202687 00000 n 
+0002202805 00000 n 
+0002202923 00000 n 
+0002202982 00000 n 
+0002203041 00000 n 
+0002203159 00000 n 
+0002203277 00000 n 
+0002203336 00000 n 
+0002203395 00000 n 
+0002203512 00000 n 
+0002206180 00000 n 
+0002206400 00000 n 
+0002206634 00000 n 
+0002206838 00000 n 
+0002207072 00000 n 
+0002207265 00000 n 
+0002207470 00000 n 
+0002207704 00000 n 
+0002207909 00000 n 
+0002208114 00000 n 
+0002208347 00000 n 
+0002208546 00000 n 
+0002208780 00000 n 
+0002208980 00000 n 
+0002209185 00000 n 
+0002209419 00000 n 
+0002209617 00000 n 
+0002209850 00000 n 
+0002213957 00000 n 
+0002214161 00000 n 
+0002210048 00000 n 
+0002211213 00000 n 
+0002205874 00000 n 
+0002203764 00000 n 
+0002210213 00000 n 
+0002210271 00000 n 
+0002210330 00000 n 
+0002210389 00000 n 
+0002210448 00000 n 
+0002210566 00000 n 
+0002210742 00000 n 
+0002210801 00000 n 
+0002210860 00000 n 
+0002210919 00000 n 
+0002210978 00000 n 
+0002211037 00000 n 
+0002211096 00000 n 
+0002211155 00000 n 
+0002241625 00000 n 
+0002214396 00000 n 
+0002214631 00000 n 
+0002214836 00000 n 
+0002215040 00000 n 
+0002215275 00000 n 
+0002215509 00000 n 
+0002215743 00000 n 
+0002215935 00000 n 
+0002216170 00000 n 
+0002216362 00000 n 
+0002216555 00000 n 
+0002216790 00000 n 
+0002216990 00000 n 
+0002217183 00000 n 
+0002217418 00000 n 
+0002217636 00000 n 
+0002217870 00000 n 
+0002218089 00000 n 
+0002218309 00000 n 
+0002218528 00000 n 
+0002218763 00000 n 
+0002218983 00000 n 
+0002219187 00000 n 
+0002219422 00000 n 
+0002219626 00000 n 
+0002219861 00000 n 
+0002220065 00000 n 
+0002220300 00000 n 
+0002220534 00000 n 
+0002220768 00000 n 
+0002220968 00000 n 
+0002221203 00000 n 
+0002221438 00000 n 
+0002221673 00000 n 
+0002221908 00000 n 
+0002222143 00000 n 
+0002222378 00000 n 
+0002222582 00000 n 
+0002222817 00000 n 
+0002223021 00000 n 
+0002223256 00000 n 
+0002223490 00000 n 
+0002227949 00000 n 
+0002228154 00000 n 
+0002223690 00000 n 
+0002225151 00000 n 
+0002213417 00000 n 
+0002211422 00000 n 
+0002223855 00000 n 
+0002223913 00000 n 
+0002223972 00000 n 
+0002224031 00000 n 
+0002224090 00000 n 
+0002224149 00000 n 
+0002224208 00000 n 
+0002224267 00000 n 
+0002224326 00000 n 
+0002224385 00000 n 
+0002224444 00000 n 
+0002224503 00000 n 
+0002224562 00000 n 
+0002224621 00000 n 
+0002224680 00000 n 
+0002224738 00000 n 
+0002224797 00000 n 
+0002224856 00000 n 
+0002224915 00000 n 
+0002224974 00000 n 
+0002225033 00000 n 
+0002225092 00000 n 
+0002241802 00000 n 
+0002241918 00000 n 
+0002228389 00000 n 
+0002228589 00000 n 
+0002228824 00000 n 
+0002229059 00000 n 
+0002229259 00000 n 
+0002229494 00000 n 
+0002229720 00000 n 
+0002229955 00000 n 
+0002230156 00000 n 
+0002230391 00000 n 
+0002230592 00000 n 
+0002230793 00000 n 
+0002231026 00000 n 
+0002231226 00000 n 
+0002231426 00000 n 
+0002231660 00000 n 
+0002231861 00000 n 
+0002232062 00000 n 
+0002232296 00000 n 
+0002232496 00000 n 
+0002232696 00000 n 
+0002232896 00000 n 
+0002233089 00000 n 
+0002233322 00000 n 
+0002233956 00000 n 
+0002227580 00000 n 
+0002225334 00000 n 
+0002233487 00000 n 
+0002233545 00000 n 
+0002233604 00000 n 
+0002233663 00000 n 
+0002233721 00000 n 
+0002233779 00000 n 
+0002233838 00000 n 
+0002233897 00000 n 
+0002242099 00000 n 
+0002242217 00000 n 
+0002242340 00000 n 
+0002236604 00000 n 
+0002236838 00000 n 
+0002237071 00000 n 
+0002237305 00000 n 
+0002237539 00000 n 
+0002240907 00000 n 
+0002237773 00000 n 
+0002237996 00000 n 
+0002236415 00000 n 
+0002234162 00000 n 
+0002237938 00000 n 
+0002241108 00000 n 
+0002241343 00000 n 
+0002242692 00000 n 
+0002240745 00000 n 
+0002238224 00000 n 
+0002241508 00000 n 
+0002241566 00000 n 
+0002241684 00000 n 
+0002241743 00000 n 
+0002241860 00000 n 
+0002241982 00000 n 
+0002242041 00000 n 
+0002242158 00000 n 
+0002242281 00000 n 
+0002242398 00000 n 
+0002242457 00000 n 
+0002242516 00000 n 
+0004466131 00000 n 
+0002244681 00000 n 
+0002244887 00000 n 
+0002245114 00000 n 
+0002245341 00000 n 
+0002245568 00000 n 
+0002245756 00000 n 
+0002245983 00000 n 
+0002246177 00000 n 
+0002246404 00000 n 
+0002246632 00000 n 
+0002246826 00000 n 
+0002247054 00000 n 
+0002247282 00000 n 
+0002247470 00000 n 
+0002247666 00000 n 
+0002248654 00000 n 
+0002244411 00000 n 
+0002242873 00000 n 
+0002247831 00000 n 
+0002247889 00000 n 
+0002247948 00000 n 
+0002248007 00000 n 
+0002248066 00000 n 
+0002248125 00000 n 
+0002248183 00000 n 
+0002248242 00000 n 
+0002248301 00000 n 
+0002248360 00000 n 
+0002248418 00000 n 
+0002248477 00000 n 
+0002248536 00000 n 
+0002248595 00000 n 
+0002250511 00000 n 
+0002254974 00000 n 
+0002255042 00000 n 
+0002255290 00000 n 
+0002262967 00000 n 
+0002255539 00000 n 
+0002256173 00000 n 
+0002250333 00000 n 
+0002248892 00000 n 
+0002255704 00000 n 
+0002255879 00000 n 
+0002255938 00000 n 
+0002255997 00000 n 
+0002256056 00000 n 
+0002251547 00000 n 
+0002251678 00000 n 
+0002251828 00000 n 
+0002252152 00000 n 
+0002252588 00000 n 
+0002252826 00000 n 
+0002252848 00000 n 
+0002254951 00000 n 
+0002258618 00000 n 
+0002262899 00000 n 
+0002263181 00000 n 
+0002263435 00000 n 
+0002263690 00000 n 
+0002263906 00000 n 
+0002264128 00000 n 
+0002264718 00000 n 
+0002258407 00000 n 
+0002256380 00000 n 
+0002264294 00000 n 
+0002264413 00000 n 
+0002264474 00000 n 
+0002264535 00000 n 
+0002264596 00000 n 
+0002264657 00000 n 
+0002259518 00000 n 
+0002259650 00000 n 
+0002259803 00000 n 
+0002260125 00000 n 
+0002260560 00000 n 
+0002260800 00000 n 
+0002260823 00000 n 
+0002262875 00000 n 
+0002270481 00000 n 
+0002266454 00000 n 
+0002270412 00000 n 
+0002270697 00000 n 
+0002270954 00000 n 
+0002271214 00000 n 
+0002271430 00000 n 
+0002272077 00000 n 
+0002266249 00000 n 
+0002264928 00000 n 
+0002271596 00000 n 
+0002271775 00000 n 
+0002271836 00000 n 
+0002271897 00000 n 
+0002271958 00000 n 
+0002267318 00000 n 
+0002267450 00000 n 
+0002267603 00000 n 
+0002267905 00000 n 
+0002268320 00000 n 
+0002268560 00000 n 
+0002268583 00000 n 
+0002270388 00000 n 
+0002274347 00000 n 
+0002274568 00000 n 
+0002274755 00000 n 
+0002274975 00000 n 
+0002275180 00000 n 
+0002275401 00000 n 
+0002275606 00000 n 
+0002275827 00000 n 
+0002279349 00000 n 
+0002276044 00000 n 
+0002277115 00000 n 
+0002274119 00000 n 
+0002272273 00000 n 
+0002276210 00000 n 
+0002276329 00000 n 
+0002276509 00000 n 
+0002276570 00000 n 
+0002276749 00000 n 
+0002276810 00000 n 
+0002276871 00000 n 
+0002276932 00000 n 
+0002276993 00000 n 
+0002277054 00000 n 
+0002279570 00000 n 
+0002279790 00000 n 
+0002280011 00000 n 
+0002280232 00000 n 
+0002280412 00000 n 
+0002280633 00000 n 
+0002280854 00000 n 
+0002281060 00000 n 
+0002281281 00000 n 
+0002281487 00000 n 
+0002281707 00000 n 
+0002281925 00000 n 
+0002282394 00000 n 
+0002279080 00000 n 
+0002277338 00000 n 
+0002282091 00000 n 
+0002282151 00000 n 
+0002282212 00000 n 
+0002282273 00000 n 
+0002282334 00000 n 
+0004466260 00000 n 
+0002286267 00000 n 
+0002286389 00000 n 
+0002286511 00000 n 
+0002291003 00000 n 
+0002291125 00000 n 
+0002285678 00000 n 
+0002285858 00000 n 
+0002286571 00000 n 
+0002285519 00000 n 
+0002282604 00000 n 
+0002286024 00000 n 
+0002286084 00000 n 
+0002286145 00000 n 
+0002286206 00000 n 
+0002286328 00000 n 
+0002286450 00000 n 
+0002290253 00000 n 
+0002290485 00000 n 
+0002293652 00000 n 
+0002293884 00000 n 
+0002290716 00000 n 
+0002291432 00000 n 
+0002290084 00000 n 
+0002286768 00000 n 
+0002290882 00000 n 
+0002290942 00000 n 
+0002291064 00000 n 
+0002291191 00000 n 
+0002291371 00000 n 
+0002300205 00000 n 
+0002300327 00000 n 
+0002294090 00000 n 
+0002294322 00000 n 
+0002294554 00000 n 
+0002294753 00000 n 
+0002294986 00000 n 
+0002295185 00000 n 
+0002295383 00000 n 
+0002295616 00000 n 
+0002295815 00000 n 
+0002296013 00000 n 
+0002296246 00000 n 
+0002296444 00000 n 
+0002296677 00000 n 
+0002296875 00000 n 
+0002297108 00000 n 
+0002297306 00000 n 
+0002297539 00000 n 
+0002297737 00000 n 
+0002297970 00000 n 
+0002298203 00000 n 
+0002298436 00000 n 
+0002298641 00000 n 
+0002298874 00000 n 
+0002299106 00000 n 
+0002299305 00000 n 
+0002299538 00000 n 
+0002299736 00000 n 
+0002300392 00000 n 
+0002293223 00000 n 
+0002291654 00000 n 
+0002299902 00000 n 
+0002299962 00000 n 
+0002300023 00000 n 
+0002300084 00000 n 
+0002300144 00000 n 
+0002300266 00000 n 
+0002303095 00000 n 
+0002303283 00000 n 
+0002303471 00000 n 
+0002303720 00000 n 
+0002306331 00000 n 
+0002306518 00000 n 
+0002306706 00000 n 
+0002306833 00000 n 
+0002306960 00000 n 
+0002307086 00000 n 
+0002307213 00000 n 
+0002313608 00000 n 
+0002313791 00000 n 
+0002302747 00000 n 
+0002303842 00000 n 
+0002302598 00000 n 
+0002300613 00000 n 
+0002302913 00000 n 
+0002302973 00000 n 
+0002303034 00000 n 
+0002303161 00000 n 
+0002303222 00000 n 
+0002303349 00000 n 
+0002303410 00000 n 
+0002303537 00000 n 
+0002303598 00000 n 
+0002303659 00000 n 
+0002303781 00000 n 
+0002306044 00000 n 
+0002307340 00000 n 
+0002305895 00000 n 
+0002304049 00000 n 
+0002306210 00000 n 
+0002306270 00000 n 
+0002306396 00000 n 
+0002306457 00000 n 
+0002306584 00000 n 
+0002306645 00000 n 
+0002306772 00000 n 
+0002306899 00000 n 
+0002307025 00000 n 
+0002307152 00000 n 
+0002307279 00000 n 
+0002309246 00000 n 
+0002313313 00000 n 
+0002316715 00000 n 
+0002313382 00000 n 
+0002314093 00000 n 
+0002309080 00000 n 
+0002307548 00000 n 
+0002313548 00000 n 
+0002313669 00000 n 
+0002313730 00000 n 
+0002313852 00000 n 
+0002313913 00000 n 
+0004466393 00000 n 
+0002310100 00000 n 
+0002310232 00000 n 
+0002310385 00000 n 
+0002310695 00000 n 
+0002311121 00000 n 
+0002311361 00000 n 
+0002311384 00000 n 
+0002313289 00000 n 
+0002316931 00000 n 
+0002317160 00000 n 
+0002317366 00000 n 
+0002317595 00000 n 
+0002317824 00000 n 
+0002318021 00000 n 
+0002318249 00000 n 
+0002318445 00000 n 
+0002318648 00000 n 
+0002318876 00000 n 
+0002319105 00000 n 
+0002319311 00000 n 
+0002319540 00000 n 
+0002319746 00000 n 
+0002319973 00000 n 
+0002320177 00000 n 
+0002320381 00000 n 
+0002320576 00000 n 
+0002320805 00000 n 
+0002321002 00000 n 
+0002321232 00000 n 
+0002321461 00000 n 
+0002321667 00000 n 
+0002321896 00000 n 
+0002322083 00000 n 
+0002322289 00000 n 
+0002322493 00000 n 
+0002322723 00000 n 
+0002322954 00000 n 
+0002323160 00000 n 
+0002323375 00000 n 
+0002323606 00000 n 
+0002323821 00000 n 
+0002324052 00000 n 
+0002324267 00000 n 
+0002324498 00000 n 
+0002324685 00000 n 
+0002324890 00000 n 
+0002325121 00000 n 
+0002325351 00000 n 
+0002329546 00000 n 
+0002329777 00000 n 
+0002329964 00000 n 
+0002330194 00000 n 
+0002325556 00000 n 
+0002326575 00000 n 
+0002316156 00000 n 
+0002314304 00000 n 
+0002325722 00000 n 
+0002325782 00000 n 
+0002325843 00000 n 
+0002325904 00000 n 
+0002325965 00000 n 
+0002326026 00000 n 
+0002326087 00000 n 
+0002326148 00000 n 
+0002326209 00000 n 
+0002326270 00000 n 
+0002326331 00000 n 
+0002326392 00000 n 
+0002326453 00000 n 
+0002326514 00000 n 
+0002400805 00000 n 
+0002400927 00000 n 
+0002401049 00000 n 
+0002401171 00000 n 
+0002401415 00000 n 
+0002401537 00000 n 
+0002405166 00000 n 
+0002330381 00000 n 
+0002330612 00000 n 
+0002330843 00000 n 
+0002331074 00000 n 
+0002331271 00000 n 
+0002331458 00000 n 
+0002331689 00000 n 
+0002331886 00000 n 
+0002332116 00000 n 
+0002332312 00000 n 
+0002332542 00000 n 
+0002332729 00000 n 
+0002332916 00000 n 
+0002333147 00000 n 
+0002333340 00000 n 
+0002333569 00000 n 
+0002333756 00000 n 
+0002333962 00000 n 
+0002334193 00000 n 
+0002334379 00000 n 
+0002334610 00000 n 
+0002334841 00000 n 
+0002335046 00000 n 
+0002335277 00000 n 
+0002335481 00000 n 
+0002335711 00000 n 
+0002335942 00000 n 
+0002336172 00000 n 
+0002336403 00000 n 
+0002336634 00000 n 
+0002336865 00000 n 
+0002337096 00000 n 
+0002337327 00000 n 
+0002337524 00000 n 
+0002337752 00000 n 
+0002337948 00000 n 
+0002338151 00000 n 
+0002338380 00000 n 
+0002338577 00000 n 
+0002338781 00000 n 
+0002338986 00000 n 
+0002339215 00000 n 
+0002339410 00000 n 
+0002339641 00000 n 
+0002339871 00000 n 
+0002340101 00000 n 
+0002340293 00000 n 
+0002341614 00000 n 
+0002328897 00000 n 
+0002326798 00000 n 
+0002340459 00000 n 
+0002340519 00000 n 
+0002340580 00000 n 
+0002340641 00000 n 
+0002340701 00000 n 
+0002340762 00000 n 
+0002340823 00000 n 
+0002340884 00000 n 
+0002340944 00000 n 
+0002341005 00000 n 
+0002341066 00000 n 
+0002341127 00000 n 
+0002341188 00000 n 
+0002341249 00000 n 
+0002341310 00000 n 
+0002341370 00000 n 
+0002341431 00000 n 
+0002341492 00000 n 
+0002341553 00000 n 
+0002405293 00000 n 
+0002405481 00000 n 
+0002405608 00000 n 
+0002405735 00000 n 
+0002405861 00000 n 
+0002405987 00000 n 
+0002409209 00000 n 
+0002409336 00000 n 
+0002409462 00000 n 
+0002343909 00000 n 
+0002344114 00000 n 
+0002344344 00000 n 
+0002344539 00000 n 
+0002344770 00000 n 
+0002345001 00000 n 
+0002345197 00000 n 
+0002345426 00000 n 
+0002345621 00000 n 
+0002345852 00000 n 
+0002346049 00000 n 
+0002346246 00000 n 
+0002346441 00000 n 
+0002346672 00000 n 
+0002346858 00000 n 
+0002347045 00000 n 
+0002347240 00000 n 
+0002347471 00000 n 
+0002347657 00000 n 
+0002347854 00000 n 
+0002348049 00000 n 
+0002348280 00000 n 
+0002348477 00000 n 
+0002348664 00000 n 
+0002348859 00000 n 
+0002349090 00000 n 
+0002349287 00000 n 
+0002349482 00000 n 
+0002349713 00000 n 
+0002349907 00000 n 
+0002350102 00000 n 
+0002350333 00000 n 
+0002350530 00000 n 
+0002350725 00000 n 
+0002350956 00000 n 
+0002351153 00000 n 
+0002351348 00000 n 
+0002351579 00000 n 
+0002351776 00000 n 
+0002351973 00000 n 
+0002352168 00000 n 
+0002352399 00000 n 
+0002352585 00000 n 
+0002352772 00000 n 
+0002352966 00000 n 
+0002353196 00000 n 
+0002353381 00000 n 
+0002353577 00000 n 
+0002353772 00000 n 
+0002354003 00000 n 
+0002354200 00000 n 
+0002354387 00000 n 
+0002354582 00000 n 
+0002354813 00000 n 
+0002355010 00000 n 
+0002355204 00000 n 
+0002355434 00000 n 
+0002355630 00000 n 
+0002355825 00000 n 
+0002356056 00000 n 
+0002356253 00000 n 
+0002356445 00000 n 
+0002356673 00000 n 
+0002360352 00000 n 
+0002360547 00000 n 
+0002360776 00000 n 
+0002360972 00000 n 
+0002361169 00000 n 
+0002361364 00000 n 
+0002361593 00000 n 
+0002361789 00000 n 
+0002356867 00000 n 
+0002357457 00000 n 
+0002343130 00000 n 
+0002341825 00000 n 
+0002357033 00000 n 
+0002357093 00000 n 
+0002357154 00000 n 
+0002357215 00000 n 
+0002357276 00000 n 
+0002357396 00000 n 
+0002409650 00000 n 
+0002409770 00000 n 
+0002409891 00000 n 
+0002410013 00000 n 
+0002410134 00000 n 
+0002410256 00000 n 
+0002410378 00000 n 
+0002410500 00000 n 
+0002413460 00000 n 
+0002413582 00000 n 
+0002413704 00000 n 
+0002413825 00000 n 
+0002413947 00000 n 
+0002414068 00000 n 
+0002414189 00000 n 
+0002414310 00000 n 
+0002361976 00000 n 
+0002362171 00000 n 
+0002362400 00000 n 
+0002362596 00000 n 
+0002362790 00000 n 
+0002363018 00000 n 
+0002363212 00000 n 
+0002363408 00000 n 
+0002363603 00000 n 
+0002363832 00000 n 
+0002364027 00000 n 
+0002364214 00000 n 
+0002364409 00000 n 
+0002364638 00000 n 
+0002364833 00000 n 
+0002365028 00000 n 
+0002365257 00000 n 
+0002365454 00000 n 
+0002365649 00000 n 
+0002365878 00000 n 
+0002366075 00000 n 
+0002366306 00000 n 
+0002366503 00000 n 
+0002366697 00000 n 
+0002366927 00000 n 
+0002367123 00000 n 
+0002367309 00000 n 
+0002367540 00000 n 
+0002367737 00000 n 
+0002368128 00000 n 
+0002368359 00000 n 
+0002368556 00000 n 
+0002368949 00000 n 
+0002369144 00000 n 
+0002369375 00000 n 
+0002369572 00000 n 
+0002369758 00000 n 
+0002369989 00000 n 
+0002370186 00000 n 
+0002370416 00000 n 
+0002370612 00000 n 
+0002370808 00000 n 
+0002371003 00000 n 
+0002371234 00000 n 
+0002371431 00000 n 
+0002371626 00000 n 
+0002371857 00000 n 
+0002372054 00000 n 
+0002372249 00000 n 
+0002372480 00000 n 
+0002372677 00000 n 
+0002372864 00000 n 
+0002373058 00000 n 
+0002373288 00000 n 
+0002373484 00000 n 
+0002373679 00000 n 
+0002373910 00000 n 
+0002374097 00000 n 
+0002374284 00000 n 
+0002374479 00000 n 
+0002374710 00000 n 
+0002374907 00000 n 
+0002375102 00000 n 
+0002375331 00000 n 
+0002375527 00000 n 
+0002375722 00000 n 
+0002375951 00000 n 
+0002376146 00000 n 
+0002376341 00000 n 
+0002376572 00000 n 
+0002376769 00000 n 
+0002376966 00000 n 
+0002377160 00000 n 
+0002377390 00000 n 
+0002377576 00000 n 
+0002377772 00000 n 
+0002377967 00000 n 
+0002378198 00000 n 
+0002378395 00000 n 
+0002378589 00000 n 
+0002378819 00000 n 
+0002379005 00000 n 
+0002379191 00000 n 
+0002379384 00000 n 
+0002379613 00000 n 
+0002379808 00000 n 
+0002380001 00000 n 
+0002380230 00000 n 
+0002380425 00000 n 
+0002384325 00000 n 
+0002384520 00000 n 
+0002384751 00000 n 
+0002384938 00000 n 
+0002385135 00000 n 
+0002385329 00000 n 
+0002385559 00000 n 
+0002385755 00000 n 
+0002385941 00000 n 
+0002386136 00000 n 
+0002386367 00000 n 
+0002386564 00000 n 
+0002386759 00000 n 
+0002386990 00000 n 
+0002380620 00000 n 
+0002380846 00000 n 
+0002359213 00000 n 
+0002357653 00000 n 
+0002380786 00000 n 
+0002367933 00000 n 
+0002368753 00000 n 
+0002414431 00000 n 
+0002414553 00000 n 
+0002414736 00000 n 
+0002418090 00000 n 
+0002418212 00000 n 
+0002418394 00000 n 
+0002418515 00000 n 
+0002418637 00000 n 
+0002418759 00000 n 
+0002418881 00000 n 
+0002419002 00000 n 
+0002419123 00000 n 
+0002419244 00000 n 
+0002421880 00000 n 
+0002422002 00000 n 
+0002422245 00000 n 
+0002422427 00000 n 
+0002422793 00000 n 
+0002422976 00000 n 
+0002387186 00000 n 
+0002387381 00000 n 
+0002387610 00000 n 
+0002387806 00000 n 
+0002388003 00000 n 
+0002388197 00000 n 
+0002388425 00000 n 
+0002388620 00000 n 
+0002388806 00000 n 
+0002389001 00000 n 
+0002389230 00000 n 
+0002389425 00000 n 
+0002389622 00000 n 
+0002389817 00000 n 
+0002390046 00000 n 
+0002390241 00000 n 
+0002390428 00000 n 
+0002390623 00000 n 
+0002390852 00000 n 
+0002391049 00000 n 
+0002391244 00000 n 
+0002391473 00000 n 
+0002391670 00000 n 
+0002391901 00000 n 
+0002392098 00000 n 
+0002392293 00000 n 
+0002392524 00000 n 
+0002392721 00000 n 
+0002392908 00000 n 
+0002393103 00000 n 
+0002393334 00000 n 
+0002393531 00000 n 
+0002393716 00000 n 
+0002393947 00000 n 
+0002394144 00000 n 
+0002394375 00000 n 
+0002394572 00000 n 
+0002394769 00000 n 
+0002394964 00000 n 
+0002395150 00000 n 
+0002395336 00000 n 
+0002395567 00000 n 
+0002395798 00000 n 
+0002396029 00000 n 
+0002396260 00000 n 
+0002396491 00000 n 
+0002396722 00000 n 
+0002397009 00000 n 
+0002383576 00000 n 
+0002381042 00000 n 
+0002396888 00000 n 
+0002396948 00000 n 
+0002423220 00000 n 
+0002423342 00000 n 
+0002427168 00000 n 
+0002427351 00000 n 
+0002427654 00000 n 
+0002427776 00000 n 
+0002400056 00000 n 
+0002400518 00000 n 
+0002401662 00000 n 
+0002399887 00000 n 
+0002397238 00000 n 
+0002400684 00000 n 
+0002400744 00000 n 
+0002400866 00000 n 
+0002400988 00000 n 
+0002401110 00000 n 
+0002401232 00000 n 
+0002401293 00000 n 
+0002400287 00000 n 
+0002401354 00000 n 
+0002401476 00000 n 
+0002401602 00000 n 
+0004466526 00000 n 
+0002404940 00000 n 
+0002406114 00000 n 
+0002404791 00000 n 
+0002401857 00000 n 
+0002405106 00000 n 
+0002405232 00000 n 
+0002405359 00000 n 
+0002405420 00000 n 
+0002405547 00000 n 
+0002405674 00000 n 
+0002405800 00000 n 
+0002405927 00000 n 
+0002406053 00000 n 
+0002408922 00000 n 
+0002410620 00000 n 
+0002408773 00000 n 
+0002406321 00000 n 
+0002409088 00000 n 
+0002409148 00000 n 
+0002409275 00000 n 
+0002409401 00000 n 
+0002409528 00000 n 
+0002409589 00000 n 
+0002409710 00000 n 
+0002409830 00000 n 
+0002409952 00000 n 
+0002410073 00000 n 
+0002410195 00000 n 
+0002410317 00000 n 
+0002410439 00000 n 
+0002410560 00000 n 
+0002412773 00000 n 
+0002413234 00000 n 
+0002414856 00000 n 
+0002412604 00000 n 
+0002410827 00000 n 
+0002413400 00000 n 
+0002413521 00000 n 
+0002413643 00000 n 
+0002413764 00000 n 
+0002413886 00000 n 
+0002414007 00000 n 
+0002414128 00000 n 
+0002414249 00000 n 
+0002414370 00000 n 
+0002414492 00000 n 
+0002414614 00000 n 
+0002414675 00000 n 
+0002413003 00000 n 
+0002414796 00000 n 
+0002417402 00000 n 
+0002417864 00000 n 
+0002419364 00000 n 
+0002417233 00000 n 
+0002415038 00000 n 
+0002418030 00000 n 
+0002418151 00000 n 
+0002418272 00000 n 
+0002418333 00000 n 
+0002417633 00000 n 
+0002418455 00000 n 
+0002418576 00000 n 
+0002418698 00000 n 
+0002418820 00000 n 
+0002418941 00000 n 
+0002419062 00000 n 
+0002419183 00000 n 
+0002419304 00000 n 
+0002421654 00000 n 
+0002423464 00000 n 
+0002421505 00000 n 
+0002419546 00000 n 
+0002421820 00000 n 
+0002421941 00000 n 
+0002422062 00000 n 
+0002422123 00000 n 
+0002422184 00000 n 
+0002422306 00000 n 
+0002422367 00000 n 
+0002422488 00000 n 
+0002422549 00000 n 
+0002422610 00000 n 
+0002422671 00000 n 
+0002422732 00000 n 
+0002422854 00000 n 
+0002422915 00000 n 
+0002423037 00000 n 
+0002423098 00000 n 
+0002423159 00000 n 
+0002423281 00000 n 
+0002423403 00000 n 
+0002426124 00000 n 
+0002426348 00000 n 
+0002426570 00000 n 
+0002426759 00000 n 
+0002428320 00000 n 
+0002425945 00000 n 
+0002423646 00000 n 
+0002426925 00000 n 
+0002426985 00000 n 
+0002427046 00000 n 
+0002427107 00000 n 
+0002427229 00000 n 
+0002427290 00000 n 
+0002427412 00000 n 
+0002427473 00000 n 
+0002427532 00000 n 
+0002427593 00000 n 
+0002427715 00000 n 
+0002427837 00000 n 
+0002427898 00000 n 
+0002427958 00000 n 
+0002428138 00000 n 
+0002428199 00000 n 
+0002428260 00000 n 
+0004466659 00000 n 
+0002431222 00000 n 
+0002431446 00000 n 
+0002431670 00000 n 
+0002431894 00000 n 
+0002432081 00000 n 
+0002432305 00000 n 
+0002432502 00000 n 
+0002432707 00000 n 
+0002432932 00000 n 
+0002433157 00000 n 
+0002433343 00000 n 
+0002433568 00000 n 
+0002433793 00000 n 
+0002433998 00000 n 
+0002434223 00000 n 
+0002434428 00000 n 
+0002434653 00000 n 
+0002434878 00000 n 
+0002435103 00000 n 
+0002435328 00000 n 
+0002435553 00000 n 
+0002435777 00000 n 
+0002436002 00000 n 
+0002436227 00000 n 
+0002436418 00000 n 
+0002436643 00000 n 
+0002436867 00000 n 
+0002437072 00000 n 
+0002437262 00000 n 
+0002437486 00000 n 
+0002437675 00000 n 
+0002437880 00000 n 
+0002438104 00000 n 
+0002438292 00000 n 
+0002439553 00000 n 
+0002430743 00000 n 
+0002428529 00000 n 
+0002438458 00000 n 
+0002438518 00000 n 
+0002438579 00000 n 
+0002438640 00000 n 
+0002438701 00000 n 
+0002438762 00000 n 
+0002438823 00000 n 
+0002438883 00000 n 
+0002438944 00000 n 
+0002439005 00000 n 
+0002439066 00000 n 
+0002439126 00000 n 
+0002439187 00000 n 
+0002439248 00000 n 
+0002439309 00000 n 
+0002439370 00000 n 
+0002439431 00000 n 
+0002439492 00000 n 
+0002449417 00000 n 
+0002449661 00000 n 
+0002449783 00000 n 
+0002449971 00000 n 
+0002442755 00000 n 
+0002442980 00000 n 
+0002443171 00000 n 
+0002443396 00000 n 
+0002443587 00000 n 
+0002443777 00000 n 
+0002443964 00000 n 
+0002444151 00000 n 
+0002444338 00000 n 
+0002444562 00000 n 
+0002444971 00000 n 
+0002442516 00000 n 
+0002439790 00000 n 
+0002444728 00000 n 
+0002444788 00000 n 
+0002444849 00000 n 
+0002444910 00000 n 
+0002455480 00000 n 
+0002448494 00000 n 
+0002448942 00000 n 
+0002449130 00000 n 
+0002450159 00000 n 
+0002448315 00000 n 
+0002445227 00000 n 
+0002449296 00000 n 
+0002449356 00000 n 
+0002449478 00000 n 
+0002449539 00000 n 
+0002448718 00000 n 
+0002449600 00000 n 
+0002449722 00000 n 
+0002449849 00000 n 
+0002449910 00000 n 
+0002450037 00000 n 
+0002450098 00000 n 
+0002453049 00000 n 
+0002453248 00000 n 
+0002453457 00000 n 
+0002453682 00000 n 
+0002453940 00000 n 
+0002454165 00000 n 
+0002454423 00000 n 
+0002454937 00000 n 
+0002458946 00000 n 
+0002459169 00000 n 
+0002455193 00000 n 
+0002455903 00000 n 
+0002452810 00000 n 
+0002450444 00000 n 
+0002455359 00000 n 
+0002455419 00000 n 
+0002455541 00000 n 
+0002455602 00000 n 
+0002455781 00000 n 
+0002455842 00000 n 
+0002454681 00000 n 
+0002488253 00000 n 
+0002488375 00000 n 
+0002488440 00000 n 
+0002492289 00000 n 
+0002492355 00000 n 
+0002492421 00000 n 
+0002459374 00000 n 
+0002459597 00000 n 
+0002459802 00000 n 
+0002459994 00000 n 
+0002460386 00000 n 
+0002460616 00000 n 
+0002460822 00000 n 
+0002461062 00000 n 
+0002461286 00000 n 
+0002461492 00000 n 
+0002461688 00000 n 
+0002462149 00000 n 
+0002462354 00000 n 
+0002462594 00000 n 
+0002462818 00000 n 
+0002463024 00000 n 
+0002463221 00000 n 
+0002463418 00000 n 
+0002463879 00000 n 
+0002464085 00000 n 
+0002464325 00000 n 
+0002464549 00000 n 
+0002464740 00000 n 
+0002464964 00000 n 
+0002465153 00000 n 
+0002465375 00000 n 
+0002465565 00000 n 
+0002465770 00000 n 
+0002465995 00000 n 
+0002466187 00000 n 
+0002466411 00000 n 
+0002466619 00000 n 
+0002466843 00000 n 
+0002467052 00000 n 
+0002467277 00000 n 
+0002467473 00000 n 
+0002467697 00000 n 
+0002467902 00000 n 
+0002468127 00000 n 
+0002468351 00000 n 
+0002468576 00000 n 
+0002468781 00000 n 
+0002469006 00000 n 
+0002469198 00000 n 
+0002469423 00000 n 
+0002469612 00000 n 
+0002469837 00000 n 
+0002470033 00000 n 
+0002470256 00000 n 
+0002474213 00000 n 
+0002474438 00000 n 
+0002474643 00000 n 
+0002470451 00000 n 
+0002471285 00000 n 
+0002458257 00000 n 
+0002456160 00000 n 
+0002470617 00000 n 
+0002470677 00000 n 
+0002460190 00000 n 
+0002461919 00000 n 
+0002463649 00000 n 
+0002470738 00000 n 
+0002470799 00000 n 
+0002470860 00000 n 
+0002470921 00000 n 
+0002470982 00000 n 
+0002471042 00000 n 
+0002471103 00000 n 
+0002471163 00000 n 
+0002471224 00000 n 
+0002492548 00000 n 
+0002492792 00000 n 
+0002497516 00000 n 
+0002497759 00000 n 
+0002498064 00000 n 
+0002501684 00000 n 
+0002501933 00000 n 
+0002502119 00000 n 
+0002502302 00000 n 
+0002502483 00000 n 
+0002474868 00000 n 
+0002475071 00000 n 
+0002475296 00000 n 
+0002475521 00000 n 
+0002475709 00000 n 
+0002475915 00000 n 
+0002476323 00000 n 
+0002476511 00000 n 
+0002476736 00000 n 
+0002476922 00000 n 
+0002477145 00000 n 
+0002477369 00000 n 
+0002477573 00000 n 
+0002477776 00000 n 
+0002478001 00000 n 
+0002478226 00000 n 
+0002478451 00000 n 
+0002478676 00000 n 
+0002478901 00000 n 
+0002479124 00000 n 
+0002479329 00000 n 
+0002479554 00000 n 
+0002479759 00000 n 
+0002479984 00000 n 
+0002480209 00000 n 
+0002480400 00000 n 
+0002480624 00000 n 
+0002480849 00000 n 
+0002481074 00000 n 
+0002481299 00000 n 
+0002481524 00000 n 
+0002481729 00000 n 
+0002481953 00000 n 
+0002485638 00000 n 
+0002485862 00000 n 
+0002482141 00000 n 
+0002483160 00000 n 
+0002473694 00000 n 
+0002471523 00000 n 
+0002482307 00000 n 
+0002482367 00000 n 
+0002476121 00000 n 
+0002482428 00000 n 
+0002482489 00000 n 
+0002482550 00000 n 
+0002482611 00000 n 
+0002482672 00000 n 
+0002482733 00000 n 
+0002482794 00000 n 
+0002482855 00000 n 
+0002482916 00000 n 
+0002482977 00000 n 
+0002483038 00000 n 
+0002483099 00000 n 
+0004466792 00000 n 
+0002505905 00000 n 
+0002506027 00000 n 
+0002506149 00000 n 
+0002506393 00000 n 
+0002506576 00000 n 
+0002509700 00000 n 
+0002486052 00000 n 
+0002486277 00000 n 
+0002486468 00000 n 
+0002486659 00000 n 
+0002486884 00000 n 
+0002487075 00000 n 
+0002487266 00000 n 
+0002487462 00000 n 
+0002487653 00000 n 
+0002487844 00000 n 
+0002488500 00000 n 
+0002485379 00000 n 
+0002483372 00000 n 
+0002488010 00000 n 
+0002488070 00000 n 
+0002488131 00000 n 
+0002488192 00000 n 
+0002488314 00000 n 
+0002509944 00000 n 
+0002510066 00000 n 
+0002491777 00000 n 
+0002496554 00000 n 
+0002492002 00000 n 
+0002492975 00000 n 
+0002491618 00000 n 
+0002488697 00000 n 
+0002492168 00000 n 
+0002492228 00000 n 
+0002492487 00000 n 
+0002492609 00000 n 
+0002492670 00000 n 
+0002492731 00000 n 
+0002492853 00000 n 
+0002492914 00000 n 
+0002496779 00000 n 
+0002497004 00000 n 
+0002497229 00000 n 
+0002498184 00000 n 
+0002496375 00000 n 
+0002493197 00000 n 
+0002497395 00000 n 
+0002497455 00000 n 
+0002497577 00000 n 
+0002497638 00000 n 
+0002497699 00000 n 
+0002497820 00000 n 
+0002497881 00000 n 
+0002497942 00000 n 
+0002498003 00000 n 
+0002498124 00000 n 
+0002501234 00000 n 
+0002501458 00000 n 
+0002502603 00000 n 
+0002501075 00000 n 
+0002498391 00000 n 
+0002501624 00000 n 
+0002501750 00000 n 
+0002501811 00000 n 
+0002501872 00000 n 
+0002501998 00000 n 
+0002502058 00000 n 
+0002502180 00000 n 
+0002502241 00000 n 
+0002502363 00000 n 
+0002502422 00000 n 
+0002502543 00000 n 
+0002505618 00000 n 
+0002506636 00000 n 
+0002505469 00000 n 
+0002502797 00000 n 
+0002505784 00000 n 
+0002505844 00000 n 
+0002505966 00000 n 
+0002506088 00000 n 
+0002506210 00000 n 
+0002506271 00000 n 
+0002506332 00000 n 
+0002506454 00000 n 
+0002506515 00000 n 
+0002512311 00000 n 
+0002516743 00000 n 
+0002509352 00000 n 
+0002510366 00000 n 
+0002509203 00000 n 
+0002506834 00000 n 
+0002509518 00000 n 
+0002509578 00000 n 
+0002509639 00000 n 
+0002509761 00000 n 
+0002509822 00000 n 
+0002509883 00000 n 
+0002510005 00000 n 
+0002510127 00000 n 
+0002510188 00000 n 
+0004466925 00000 n 
+0002516812 00000 n 
+0002517017 00000 n 
+0002517255 00000 n 
+0002517509 00000 n 
+0002517713 00000 n 
+0002517918 00000 n 
+0002518157 00000 n 
+0002518411 00000 n 
+0002518616 00000 n 
+0002518821 00000 n 
+0002519061 00000 n 
+0002519317 00000 n 
+0002519521 00000 n 
+0002519725 00000 n 
+0002519965 00000 n 
+0002520221 00000 n 
+0002520427 00000 n 
+0002520632 00000 n 
+0002520872 00000 n 
+0002521128 00000 n 
+0002521334 00000 n 
+0002521589 00000 n 
+0002521829 00000 n 
+0002522069 00000 n 
+0002522309 00000 n 
+0002522565 00000 n 
+0002526982 00000 n 
+0002527238 00000 n 
+0002527442 00000 n 
+0002522786 00000 n 
+0002523499 00000 n 
+0002511885 00000 n 
+0002510590 00000 n 
+0002522952 00000 n 
+0002523012 00000 n 
+0002523073 00000 n 
+0002523134 00000 n 
+0002523194 00000 n 
+0002523255 00000 n 
+0002523316 00000 n 
+0002523377 00000 n 
+0002523438 00000 n 
+0002513276 00000 n 
+0002513408 00000 n 
+0002513561 00000 n 
+0002513895 00000 n 
+0002514343 00000 n 
+0002514583 00000 n 
+0002514606 00000 n 
+0002516719 00000 n 
+0002527648 00000 n 
+0002532165 00000 n 
+0002532644 00000 n 
+0002533123 00000 n 
+0002527904 00000 n 
+0002528435 00000 n 
+0002526793 00000 n 
+0002523725 00000 n 
+0002528070 00000 n 
+0002528130 00000 n 
+0002528191 00000 n 
+0002528252 00000 n 
+0002528313 00000 n 
+0002528374 00000 n 
+0002533601 00000 n 
+0002536638 00000 n 
+0002540091 00000 n 
+0002533841 00000 n 
+0002534428 00000 n 
+0002531946 00000 n 
+0002528749 00000 n 
+0002534007 00000 n 
+0002532405 00000 n 
+0002532884 00000 n 
+0002533363 00000 n 
+0002534067 00000 n 
+0002534188 00000 n 
+0002534249 00000 n 
+0002540160 00000 n 
+0002540387 00000 n 
+0002540593 00000 n 
+0002540799 00000 n 
+0002541039 00000 n 
+0002541266 00000 n 
+0002541462 00000 n 
+0002541689 00000 n 
+0002541886 00000 n 
+0002542080 00000 n 
+0002542307 00000 n 
+0002542502 00000 n 
+0002542729 00000 n 
+0002542925 00000 n 
+0002543119 00000 n 
+0002543346 00000 n 
+0002543542 00000 n 
+0002543769 00000 n 
+0002543966 00000 n 
+0002544160 00000 n 
+0002544386 00000 n 
+0002544577 00000 n 
+0002544782 00000 n 
+0002545259 00000 n 
+0002545486 00000 n 
+0002545668 00000 n 
+0002545855 00000 n 
+0002546061 00000 n 
+0002546540 00000 n 
+0002546767 00000 n 
+0002546949 00000 n 
+0002547154 00000 n 
+0002547393 00000 n 
+0002547620 00000 n 
+0002547808 00000 n 
+0002548014 00000 n 
+0002551887 00000 n 
+0002552114 00000 n 
+0002552309 00000 n 
+0002552514 00000 n 
+0002548492 00000 n 
+0002548779 00000 n 
+0002536082 00000 n 
+0002534701 00000 n 
+0002548658 00000 n 
+0002548718 00000 n 
+0002545020 00000 n 
+0002546301 00000 n 
+0002548254 00000 n 
+0002537404 00000 n 
+0002537536 00000 n 
+0002537689 00000 n 
+0002537963 00000 n 
+0002538348 00000 n 
+0002538588 00000 n 
+0002538611 00000 n 
+0002540067 00000 n 
+0002557874 00000 n 
+0002561003 00000 n 
+0002561191 00000 n 
+0002561374 00000 n 
+0002561618 00000 n 
+0002564803 00000 n 
+0002564986 00000 n 
+0002565168 00000 n 
+0002565351 00000 n 
+0002568724 00000 n 
+0002568907 00000 n 
+0002552992 00000 n 
+0002553219 00000 n 
+0002553413 00000 n 
+0002553619 00000 n 
+0002554095 00000 n 
+0002554288 00000 n 
+0002554516 00000 n 
+0002554710 00000 n 
+0002554903 00000 n 
+0002555131 00000 n 
+0002555323 00000 n 
+0002555549 00000 n 
+0002555777 00000 n 
+0002555971 00000 n 
+0002556198 00000 n 
+0002556391 00000 n 
+0002556585 00000 n 
+0002556776 00000 n 
+0002556970 00000 n 
+0002557161 00000 n 
+0002558057 00000 n 
+0002551488 00000 n 
+0002548991 00000 n 
+0002557327 00000 n 
+0002552754 00000 n 
+0002557387 00000 n 
+0002553859 00000 n 
+0002557448 00000 n 
+0002557509 00000 n 
+0002557570 00000 n 
+0002557630 00000 n 
+0002557691 00000 n 
+0002557752 00000 n 
+0002557813 00000 n 
+0002557935 00000 n 
+0002557996 00000 n 
+0002569090 00000 n 
+0002569334 00000 n 
+0002560716 00000 n 
+0002561801 00000 n 
+0002560567 00000 n 
+0002558321 00000 n 
+0002560882 00000 n 
+0002560942 00000 n 
+0002561069 00000 n 
+0002561130 00000 n 
+0002561252 00000 n 
+0002561313 00000 n 
+0002561435 00000 n 
+0002561496 00000 n 
+0002561557 00000 n 
+0002561679 00000 n 
+0002561740 00000 n 
+0004467058 00000 n 
+0002564516 00000 n 
+0002565531 00000 n 
+0002564367 00000 n 
+0002561970 00000 n 
+0002564682 00000 n 
+0002564742 00000 n 
+0002564864 00000 n 
+0002564925 00000 n 
+0002565047 00000 n 
+0002565108 00000 n 
+0002565229 00000 n 
+0002565290 00000 n 
+0002565412 00000 n 
+0002565472 00000 n 
+0002568437 00000 n 
+0002569456 00000 n 
+0002568288 00000 n 
+0002565713 00000 n 
+0002568603 00000 n 
+0002568663 00000 n 
+0002568785 00000 n 
+0002568846 00000 n 
+0002568968 00000 n 
+0002569029 00000 n 
+0002569151 00000 n 
+0002569212 00000 n 
+0002569273 00000 n 
+0002569395 00000 n 
+0002571853 00000 n 
+0002572078 00000 n 
+0002572304 00000 n 
+0002572529 00000 n 
+0002572735 00000 n 
+0002573807 00000 n 
+0002571664 00000 n 
+0002569651 00000 n 
+0002572901 00000 n 
+0002572961 00000 n 
+0002573141 00000 n 
+0002573321 00000 n 
+0002573382 00000 n 
+0002573443 00000 n 
+0002573503 00000 n 
+0002573564 00000 n 
+0002573624 00000 n 
+0002573685 00000 n 
+0002573746 00000 n 
+0002576771 00000 n 
+0002577000 00000 n 
+0002577194 00000 n 
+0002577423 00000 n 
+0002577652 00000 n 
+0002577881 00000 n 
+0002578109 00000 n 
+0002578338 00000 n 
+0002578567 00000 n 
+0002578772 00000 n 
+0002579001 00000 n 
+0002579206 00000 n 
+0002579435 00000 n 
+0002579664 00000 n 
+0002579893 00000 n 
+0002580099 00000 n 
+0002580305 00000 n 
+0002580785 00000 n 
+0002581014 00000 n 
+0002581209 00000 n 
+0002581415 00000 n 
+0002581895 00000 n 
+0002582124 00000 n 
+0002582319 00000 n 
+0002582524 00000 n 
+0002583003 00000 n 
+0002583230 00000 n 
+0002587507 00000 n 
+0002587736 00000 n 
+0002587931 00000 n 
+0002588160 00000 n 
+0002583423 00000 n 
+0002584376 00000 n 
+0002576322 00000 n 
+0002574016 00000 n 
+0002583589 00000 n 
+0002583767 00000 n 
+0002583828 00000 n 
+0002583889 00000 n 
+0002583950 00000 n 
+0002584011 00000 n 
+0002584072 00000 n 
+0002584133 00000 n 
+0002584194 00000 n 
+0002584255 00000 n 
+0002584315 00000 n 
+0002580545 00000 n 
+0002581655 00000 n 
+0002582764 00000 n 
+0002767207 00000 n 
+0002667813 00000 n 
+0002667996 00000 n 
+0002668118 00000 n 
+0002668245 00000 n 
+0002588354 00000 n 
+0002588583 00000 n 
+0002588772 00000 n 
+0002588978 00000 n 
+0002589454 00000 n 
+0002589683 00000 n 
+0002589865 00000 n 
+0002590052 00000 n 
+0002590258 00000 n 
+0002590738 00000 n 
+0002590966 00000 n 
+0002591146 00000 n 
+0002591349 00000 n 
+0002591588 00000 n 
+0002591817 00000 n 
+0002592005 00000 n 
+0002592211 00000 n 
+0002592689 00000 n 
+0002592884 00000 n 
+0002593113 00000 n 
+0002593308 00000 n 
+0002593534 00000 n 
+0002593728 00000 n 
+0002593957 00000 n 
+0002594163 00000 n 
+0002594391 00000 n 
+0002594597 00000 n 
+0002594826 00000 n 
+0002595017 00000 n 
+0002595214 00000 n 
+0002595441 00000 n 
+0002595638 00000 n 
+0002595866 00000 n 
+0002596063 00000 n 
+0002596292 00000 n 
+0002596489 00000 n 
+0002596718 00000 n 
+0002596947 00000 n 
+0002597142 00000 n 
+0002597371 00000 n 
+0002597565 00000 n 
+0002597794 00000 n 
+0002597989 00000 n 
+0002598187 00000 n 
+0002598415 00000 n 
+0002598603 00000 n 
+0002598801 00000 n 
+0002599029 00000 n 
+0002599217 00000 n 
+0002599413 00000 n 
+0002599639 00000 n 
+0002599824 00000 n 
+0002603965 00000 n 
+0002604194 00000 n 
+0002604423 00000 n 
+0002600051 00000 n 
+0002600885 00000 n 
+0002586768 00000 n 
+0002584614 00000 n 
+0002600217 00000 n 
+0002589217 00000 n 
+0002590498 00000 n 
+0002592451 00000 n 
+0002600277 00000 n 
+0002600338 00000 n 
+0002600399 00000 n 
+0002600460 00000 n 
+0002600521 00000 n 
+0002600582 00000 n 
+0002600642 00000 n 
+0002600703 00000 n 
+0002600764 00000 n 
+0002600825 00000 n 
+0002671275 00000 n 
+0002671519 00000 n 
+0002671702 00000 n 
+0002671824 00000 n 
+0002675016 00000 n 
+0002675260 00000 n 
+0002678139 00000 n 
+0002678322 00000 n 
+0002678505 00000 n 
+0002678687 00000 n 
+0002678869 00000 n 
+0002679052 00000 n 
+0002604652 00000 n 
+0002604881 00000 n 
+0002605110 00000 n 
+0002605339 00000 n 
+0002605526 00000 n 
+0002605754 00000 n 
+0002605950 00000 n 
+0002606179 00000 n 
+0002606375 00000 n 
+0002606603 00000 n 
+0002606800 00000 n 
+0002607006 00000 n 
+0002607212 00000 n 
+0002607440 00000 n 
+0002607637 00000 n 
+0002607843 00000 n 
+0002608049 00000 n 
+0002608236 00000 n 
+0002608465 00000 n 
+0002608662 00000 n 
+0002608867 00000 n 
+0002609072 00000 n 
+0002609300 00000 n 
+0002609496 00000 n 
+0002609700 00000 n 
+0002609904 00000 n 
+0002610092 00000 n 
+0002610321 00000 n 
+0002610517 00000 n 
+0002610723 00000 n 
+0002610929 00000 n 
+0002611340 00000 n 
+0002611545 00000 n 
+0002611774 00000 n 
+0002612001 00000 n 
+0002612190 00000 n 
+0002612417 00000 n 
+0002612614 00000 n 
+0002612841 00000 n 
+0002613038 00000 n 
+0002613265 00000 n 
+0002613454 00000 n 
+0002613681 00000 n 
+0002613877 00000 n 
+0002614101 00000 n 
+0002618824 00000 n 
+0002619051 00000 n 
+0002619240 00000 n 
+0002619466 00000 n 
+0002619655 00000 n 
+0002619881 00000 n 
+0002614295 00000 n 
+0002614887 00000 n 
+0002603326 00000 n 
+0002601109 00000 n 
+0002614461 00000 n 
+0002614521 00000 n 
+0002614582 00000 n 
+0002614643 00000 n 
+0002614704 00000 n 
+0002614765 00000 n 
+0002611134 00000 n 
+0002614826 00000 n 
+0004467191 00000 n 
+0002682328 00000 n 
+0002682511 00000 n 
+0002682694 00000 n 
+0002682877 00000 n 
+0002683116 00000 n 
+0002686892 00000 n 
+0002687141 00000 n 
+0002691414 00000 n 
+0002691663 00000 n 
+0002691911 00000 n 
+0002695002 00000 n 
+0002695244 00000 n 
+0002695487 00000 n 
+0002698648 00000 n 
+0002620078 00000 n 
+0002620305 00000 n 
+0002620502 00000 n 
+0002620730 00000 n 
+0002620920 00000 n 
+0002621106 00000 n 
+0002621297 00000 n 
+0002621484 00000 n 
+0002621713 00000 n 
+0002621904 00000 n 
+0002622091 00000 n 
+0002622280 00000 n 
+0002622465 00000 n 
+0002622669 00000 n 
+0002622896 00000 n 
+0002623083 00000 n 
+0002623250 00000 n 
+0002623477 00000 n 
+0002623670 00000 n 
+0002623837 00000 n 
+0002624064 00000 n 
+0002624258 00000 n 
+0002624485 00000 n 
+0002624679 00000 n 
+0002624908 00000 n 
+0002625102 00000 n 
+0002625331 00000 n 
+0002625526 00000 n 
+0002625753 00000 n 
+0002625948 00000 n 
+0002626177 00000 n 
+0002626372 00000 n 
+0002626553 00000 n 
+0002626780 00000 n 
+0002626966 00000 n 
+0002627162 00000 n 
+0002627375 00000 n 
+0002627541 00000 n 
+0002627770 00000 n 
+0002627957 00000 n 
+0002628147 00000 n 
+0002628333 00000 n 
+0002628504 00000 n 
+0002628733 00000 n 
+0002628920 00000 n 
+0002629117 00000 n 
+0002629326 00000 n 
+0002629492 00000 n 
+0002629719 00000 n 
+0002629904 00000 n 
+0002630108 00000 n 
+0002630303 00000 n 
+0002635147 00000 n 
+0002635324 00000 n 
+0002635553 00000 n 
+0002635750 00000 n 
+0002635956 00000 n 
+0002630514 00000 n 
+0002630740 00000 n 
+0002618095 00000 n 
+0002615070 00000 n 
+0002630680 00000 n 
+0002698892 00000 n 
+0002699136 00000 n 
+0002699380 00000 n 
+0002702904 00000 n 
+0002703148 00000 n 
+0002703392 00000 n 
+0002707821 00000 n 
+0002708070 00000 n 
+0002708314 00000 n 
+0002711966 00000 n 
+0002712149 00000 n 
+0002712332 00000 n 
+0002712519 00000 n 
+0002716976 00000 n 
+0002717159 00000 n 
+0002717402 00000 n 
+0002717645 00000 n 
+0002722101 00000 n 
+0002636152 00000 n 
+0002636329 00000 n 
+0002636558 00000 n 
+0002636744 00000 n 
+0002636941 00000 n 
+0002637335 00000 n 
+0002637548 00000 n 
+0002637736 00000 n 
+0002637965 00000 n 
+0002638152 00000 n 
+0002638358 00000 n 
+0002638554 00000 n 
+0002638767 00000 n 
+0002638946 00000 n 
+0002639175 00000 n 
+0002639372 00000 n 
+0002639578 00000 n 
+0002639775 00000 n 
+0002639953 00000 n 
+0002640181 00000 n 
+0002640367 00000 n 
+0002640563 00000 n 
+0002640956 00000 n 
+0002641169 00000 n 
+0002641358 00000 n 
+0002641584 00000 n 
+0002641779 00000 n 
+0002641950 00000 n 
+0002642179 00000 n 
+0002642372 00000 n 
+0002642578 00000 n 
+0002642990 00000 n 
+0002643196 00000 n 
+0002643393 00000 n 
+0002643560 00000 n 
+0002643786 00000 n 
+0002643990 00000 n 
+0002644229 00000 n 
+0002644458 00000 n 
+0002644651 00000 n 
+0002644857 00000 n 
+0002645097 00000 n 
+0002645324 00000 n 
+0002645551 00000 n 
+0002645746 00000 n 
+0002645915 00000 n 
+0002646144 00000 n 
+0002646339 00000 n 
+0002646508 00000 n 
+0002646735 00000 n 
+0002646930 00000 n 
+0002647095 00000 n 
+0002647321 00000 n 
+0002647516 00000 n 
+0002647745 00000 n 
+0002647940 00000 n 
+0002648137 00000 n 
+0002648302 00000 n 
+0002648529 00000 n 
+0002648724 00000 n 
+0002648892 00000 n 
+0002649118 00000 n 
+0002649311 00000 n 
+0002652782 00000 n 
+0002649506 00000 n 
+0002649854 00000 n 
+0002634288 00000 n 
+0002630951 00000 n 
+0002649672 00000 n 
+0002637138 00000 n 
+0002640759 00000 n 
+0002642784 00000 n 
+0002649732 00000 n 
+0002649793 00000 n 
+0002722345 00000 n 
+0002727194 00000 n 
+0002727437 00000 n 
+0002727681 00000 n 
+0002732807 00000 n 
+0002733050 00000 n 
+0002733233 00000 n 
+0002737285 00000 n 
+0002737466 00000 n 
+0002741825 00000 n 
+0002742069 00000 n 
+0002742312 00000 n 
+0002742556 00000 n 
+0002746907 00000 n 
+0002747151 00000 n 
+0002652950 00000 n 
+0002653176 00000 n 
+0002653381 00000 n 
+0002653608 00000 n 
+0002653813 00000 n 
+0002654040 00000 n 
+0002654234 00000 n 
+0002654407 00000 n 
+0002654632 00000 n 
+0002654824 00000 n 
+0002655051 00000 n 
+0002655257 00000 n 
+0002655484 00000 n 
+0002655675 00000 n 
+0002655902 00000 n 
+0002656089 00000 n 
+0002656295 00000 n 
+0002656520 00000 n 
+0002656712 00000 n 
+0002656896 00000 n 
+0002657122 00000 n 
+0002657349 00000 n 
+0002657531 00000 n 
+0002657716 00000 n 
+0002657922 00000 n 
+0002658151 00000 n 
+0002658380 00000 n 
+0002658609 00000 n 
+0002658838 00000 n 
+0002659033 00000 n 
+0002659259 00000 n 
+0002659451 00000 n 
+0002659982 00000 n 
+0002652313 00000 n 
+0002650119 00000 n 
+0002659617 00000 n 
+0002659677 00000 n 
+0002659738 00000 n 
+0002659799 00000 n 
+0002659860 00000 n 
+0002659921 00000 n 
+0002747395 00000 n 
+0002751409 00000 n 
+0002751591 00000 n 
+0002751774 00000 n 
+0002756856 00000 n 
+0002757039 00000 n 
+0002757222 00000 n 
+0002762967 00000 n 
+0002763215 00000 n 
+0002767019 00000 n 
+0002767390 00000 n 
+0002663997 00000 n 
+0002664189 00000 n 
+0002664378 00000 n 
+0002664567 00000 n 
+0002664756 00000 n 
+0002665104 00000 n 
+0002663808 00000 n 
+0002660192 00000 n 
+0002664922 00000 n 
+0002664982 00000 n 
+0002665043 00000 n 
+0002667526 00000 n 
+0002668370 00000 n 
+0002667377 00000 n 
+0002665321 00000 n 
+0002667692 00000 n 
+0002667752 00000 n 
+0002667874 00000 n 
+0002667935 00000 n 
+0002668057 00000 n 
+0002668184 00000 n 
+0002668310 00000 n 
+0002670928 00000 n 
+0002671949 00000 n 
+0002670779 00000 n 
+0002668577 00000 n 
+0002671094 00000 n 
+0002671154 00000 n 
+0002671215 00000 n 
+0002671336 00000 n 
+0002671397 00000 n 
+0002671458 00000 n 
+0002671580 00000 n 
+0002671641 00000 n 
+0002671763 00000 n 
+0002671889 00000 n 
+0004467324 00000 n 
+0002674668 00000 n 
+0002675503 00000 n 
+0002674519 00000 n 
+0002672131 00000 n 
+0002674834 00000 n 
+0002674894 00000 n 
+0002674955 00000 n 
+0002675077 00000 n 
+0002675138 00000 n 
+0002675199 00000 n 
+0002675320 00000 n 
+0002675381 00000 n 
+0002675442 00000 n 
+0002677852 00000 n 
+0002679174 00000 n 
+0002677703 00000 n 
+0002675685 00000 n 
+0002678018 00000 n 
+0002678078 00000 n 
+0002678200 00000 n 
+0002678261 00000 n 
+0002678383 00000 n 
+0002678444 00000 n 
+0002678566 00000 n 
+0002678627 00000 n 
+0002678747 00000 n 
+0002678808 00000 n 
+0002678930 00000 n 
+0002678991 00000 n 
+0002679113 00000 n 
+0002682041 00000 n 
+0002683241 00000 n 
+0002681892 00000 n 
+0002679369 00000 n 
+0002682207 00000 n 
+0002682267 00000 n 
+0002682389 00000 n 
+0002682450 00000 n 
+0002682572 00000 n 
+0002682633 00000 n 
+0002682755 00000 n 
+0002682816 00000 n 
+0002682938 00000 n 
+0002682999 00000 n 
+0002683059 00000 n 
+0002683181 00000 n 
+0002686544 00000 n 
+0002687329 00000 n 
+0002686395 00000 n 
+0002683436 00000 n 
+0002686710 00000 n 
+0002686770 00000 n 
+0002686831 00000 n 
+0002686958 00000 n 
+0002687019 00000 n 
+0002687080 00000 n 
+0002687207 00000 n 
+0002687268 00000 n 
+0002690779 00000 n 
+0002690962 00000 n 
+0002691127 00000 n 
+0002692033 00000 n 
+0002690610 00000 n 
+0002687524 00000 n 
+0002691293 00000 n 
+0002691353 00000 n 
+0002691480 00000 n 
+0002691541 00000 n 
+0002691602 00000 n 
+0002691729 00000 n 
+0002691789 00000 n 
+0002691850 00000 n 
+0002691972 00000 n 
+0002694654 00000 n 
+0002695670 00000 n 
+0002694505 00000 n 
+0002692240 00000 n 
+0002694820 00000 n 
+0002694880 00000 n 
+0002694941 00000 n 
+0002695061 00000 n 
+0002695122 00000 n 
+0002695183 00000 n 
+0002695305 00000 n 
+0002695366 00000 n 
+0002695427 00000 n 
+0002695548 00000 n 
+0002695609 00000 n 
+0004467457 00000 n 
+0002698361 00000 n 
+0002699500 00000 n 
+0002698212 00000 n 
+0002695865 00000 n 
+0002698527 00000 n 
+0002698587 00000 n 
+0002698709 00000 n 
+0002698770 00000 n 
+0002698831 00000 n 
+0002698953 00000 n 
+0002699014 00000 n 
+0002699075 00000 n 
+0002699197 00000 n 
+0002699258 00000 n 
+0002699319 00000 n 
+0002699440 00000 n 
+0002702556 00000 n 
+0002703517 00000 n 
+0002702407 00000 n 
+0002699695 00000 n 
+0002702722 00000 n 
+0002702782 00000 n 
+0002702843 00000 n 
+0002702965 00000 n 
+0002703026 00000 n 
+0002703087 00000 n 
+0002703209 00000 n 
+0002703270 00000 n 
+0002703331 00000 n 
+0002703457 00000 n 
+0002706955 00000 n 
+0002707119 00000 n 
+0002707286 00000 n 
+0002707473 00000 n 
+0002708434 00000 n 
+0002706776 00000 n 
+0002703712 00000 n 
+0002707639 00000 n 
+0002707699 00000 n 
+0002707760 00000 n 
+0002707887 00000 n 
+0002707948 00000 n 
+0002708009 00000 n 
+0002708131 00000 n 
+0002708192 00000 n 
+0002708253 00000 n 
+0002708374 00000 n 
+0002711367 00000 n 
+0002711523 00000 n 
+0002711679 00000 n 
+0002712645 00000 n 
+0002711198 00000 n 
+0002708629 00000 n 
+0002711845 00000 n 
+0002711905 00000 n 
+0002712027 00000 n 
+0002712088 00000 n 
+0002712210 00000 n 
+0002712271 00000 n 
+0002712397 00000 n 
+0002712458 00000 n 
+0002712584 00000 n 
+0002716172 00000 n 
+0002716353 00000 n 
+0002716519 00000 n 
+0002721231 00000 n 
+0002716689 00000 n 
+0002717770 00000 n 
+0002715993 00000 n 
+0002712840 00000 n 
+0002716855 00000 n 
+0002716915 00000 n 
+0002717037 00000 n 
+0002717098 00000 n 
+0002717220 00000 n 
+0002717281 00000 n 
+0002717342 00000 n 
+0002717463 00000 n 
+0002717524 00000 n 
+0002717584 00000 n 
+0002717710 00000 n 
+0002721397 00000 n 
+0002721574 00000 n 
+0002721753 00000 n 
+0002722528 00000 n 
+0002721052 00000 n 
+0002717965 00000 n 
+0002721919 00000 n 
+0002721979 00000 n 
+0002722040 00000 n 
+0002722162 00000 n 
+0002722223 00000 n 
+0002722284 00000 n 
+0002722406 00000 n 
+0002722467 00000 n 
+0004467590 00000 n 
+0002726364 00000 n 
+0002726551 00000 n 
+0002726729 00000 n 
+0002726907 00000 n 
+0002727802 00000 n 
+0002726185 00000 n 
+0002722760 00000 n 
+0002727073 00000 n 
+0002727133 00000 n 
+0002727255 00000 n 
+0002727316 00000 n 
+0002727376 00000 n 
+0002727498 00000 n 
+0002727559 00000 n 
+0002727620 00000 n 
+0002727742 00000 n 
+0002731746 00000 n 
+0002731935 00000 n 
+0002732106 00000 n 
+0002732273 00000 n 
+0002736830 00000 n 
+0002732459 00000 n 
+0002733416 00000 n 
+0002731557 00000 n 
+0002728034 00000 n 
+0002732625 00000 n 
+0002732685 00000 n 
+0002732746 00000 n 
+0002732868 00000 n 
+0002732929 00000 n 
+0002732990 00000 n 
+0002733111 00000 n 
+0002733172 00000 n 
+0002733294 00000 n 
+0002733355 00000 n 
+0002740584 00000 n 
+0002736998 00000 n 
+0002737649 00000 n 
+0002736671 00000 n 
+0002733648 00000 n 
+0002737164 00000 n 
+0002737224 00000 n 
+0002737346 00000 n 
+0002737405 00000 n 
+0002737527 00000 n 
+0002737588 00000 n 
+0002740753 00000 n 
+0002740923 00000 n 
+0002741092 00000 n 
+0002741263 00000 n 
+0002741429 00000 n 
+0002745713 00000 n 
+0002741599 00000 n 
+0002742676 00000 n 
+0002740375 00000 n 
+0002737844 00000 n 
+0002741765 00000 n 
+0002741886 00000 n 
+0002741947 00000 n 
+0002742008 00000 n 
+0002742130 00000 n 
+0002742190 00000 n 
+0002742251 00000 n 
+0002742373 00000 n 
+0002742434 00000 n 
+0002742495 00000 n 
+0002742616 00000 n 
+0002745879 00000 n 
+0002746050 00000 n 
+0002746219 00000 n 
+0002746388 00000 n 
+0002746559 00000 n 
+0002747515 00000 n 
+0002745514 00000 n 
+0002742871 00000 n 
+0002746725 00000 n 
+0002746785 00000 n 
+0002746846 00000 n 
+0002746968 00000 n 
+0002747029 00000 n 
+0002747090 00000 n 
+0002747212 00000 n 
+0002747273 00000 n 
+0002747334 00000 n 
+0002747455 00000 n 
+0002750533 00000 n 
+0002750707 00000 n 
+0002750936 00000 n 
+0002751122 00000 n 
+0002751956 00000 n 
+0002750354 00000 n 
+0002747710 00000 n 
+0002751288 00000 n 
+0002751348 00000 n 
+0002751470 00000 n 
+0002751530 00000 n 
+0002751652 00000 n 
+0002751713 00000 n 
+0002751834 00000 n 
+0002751895 00000 n 
+0004467723 00000 n 
+0002755381 00000 n 
+0002755568 00000 n 
+0002755761 00000 n 
+0002755966 00000 n 
+0002756171 00000 n 
+0002756377 00000 n 
+0002756569 00000 n 
+0002757408 00000 n 
+0002755172 00000 n 
+0002752200 00000 n 
+0002756735 00000 n 
+0002756795 00000 n 
+0002756917 00000 n 
+0002756978 00000 n 
+0002757100 00000 n 
+0002757161 00000 n 
+0002757287 00000 n 
+0002757347 00000 n 
+0002760912 00000 n 
+0002761140 00000 n 
+0002761312 00000 n 
+0002761498 00000 n 
+0002761871 00000 n 
+0002762043 00000 n 
+0002762248 00000 n 
+0002762477 00000 n 
+0002762680 00000 n 
+0002763464 00000 n 
+0002760673 00000 n 
+0002757615 00000 n 
+0002762846 00000 n 
+0002762906 00000 n 
+0002763032 00000 n 
+0002763093 00000 n 
+0002763154 00000 n 
+0002761684 00000 n 
+0002763281 00000 n 
+0002763342 00000 n 
+0002763403 00000 n 
+0002766588 00000 n 
+0002769659 00000 n 
+0002773969 00000 n 
+0002766793 00000 n 
+0002767692 00000 n 
+0002766429 00000 n 
+0002763672 00000 n 
+0002766959 00000 n 
+0002767085 00000 n 
+0002767146 00000 n 
+0002767268 00000 n 
+0002767329 00000 n 
+0002767451 00000 n 
+0002767512 00000 n 
+0002774038 00000 n 
+0002774243 00000 n 
+0002774483 00000 n 
+0002774733 00000 n 
+0002774938 00000 n 
+0002775142 00000 n 
+0002775381 00000 n 
+0002775629 00000 n 
+0002775834 00000 n 
+0002776039 00000 n 
+0002776278 00000 n 
+0002776527 00000 n 
+0002776733 00000 n 
+0002776938 00000 n 
+0002777178 00000 n 
+0002777428 00000 n 
+0002777634 00000 n 
+0002777839 00000 n 
+0002778078 00000 n 
+0002778327 00000 n 
+0002778533 00000 n 
+0002778782 00000 n 
+0002779022 00000 n 
+0002779262 00000 n 
+0002779502 00000 n 
+0002779750 00000 n 
+0002784008 00000 n 
+0002784258 00000 n 
+0002779963 00000 n 
+0002780677 00000 n 
+0002769233 00000 n 
+0002767901 00000 n 
+0002780129 00000 n 
+0002780189 00000 n 
+0002780250 00000 n 
+0002780311 00000 n 
+0002780372 00000 n 
+0002780433 00000 n 
+0002780494 00000 n 
+0002780555 00000 n 
+0002780616 00000 n 
+0002770609 00000 n 
+0002770741 00000 n 
+0002770894 00000 n 
+0002771220 00000 n 
+0002771659 00000 n 
+0002771899 00000 n 
+0002771922 00000 n 
+0002773945 00000 n 
+0002784464 00000 n 
+0002784713 00000 n 
+0002785426 00000 n 
+0002783829 00000 n 
+0002780903 00000 n 
+0002784879 00000 n 
+0002784939 00000 n 
+0002785000 00000 n 
+0002785061 00000 n 
+0002785122 00000 n 
+0002785183 00000 n 
+0002785244 00000 n 
+0002785365 00000 n 
+0002788410 00000 n 
+0002788650 00000 n 
+0002788889 00000 n 
+0002789095 00000 n 
+0002789301 00000 n 
+0002789780 00000 n 
+0002790019 00000 n 
+0002790216 00000 n 
+0002790455 00000 n 
+0002790650 00000 n 
+0002790889 00000 n 
+0002791086 00000 n 
+0002791325 00000 n 
+0002791522 00000 n 
+0002791761 00000 n 
+0002791952 00000 n 
+0002792158 00000 n 
+0002792637 00000 n 
+0002792875 00000 n 
+0002793068 00000 n 
+0002793273 00000 n 
+0002793751 00000 n 
+0002793990 00000 n 
+0002794173 00000 n 
+0002794378 00000 n 
+0002798144 00000 n 
+0002798383 00000 n 
+0002798565 00000 n 
+0002798751 00000 n 
+0002798957 00000 n 
+0002799435 00000 n 
+0002799673 00000 n 
+0002799860 00000 n 
+0002800064 00000 n 
+0002794855 00000 n 
+0002795319 00000 n 
+0002787971 00000 n 
+0002785739 00000 n 
+0002795021 00000 n 
+0002795081 00000 n 
+0002795259 00000 n 
+0002789541 00000 n 
+0002792398 00000 n 
+0002793512 00000 n 
+0002794617 00000 n 
+0004467856 00000 n 
+0002877178 00000 n 
+0002877422 00000 n 
+0002880202 00000 n 
+0002880446 00000 n 
+0002880690 00000 n 
+0002880934 00000 n 
+0002883926 00000 n 
+0002884170 00000 n 
+0002800542 00000 n 
+0002800781 00000 n 
+0002800976 00000 n 
+0002801182 00000 n 
+0002801661 00000 n 
+0002801900 00000 n 
+0002802106 00000 n 
+0002802312 00000 n 
+0002802790 00000 n 
+0002803029 00000 n 
+0002803235 00000 n 
+0002803440 00000 n 
+0002803679 00000 n 
+0002803884 00000 n 
+0002804124 00000 n 
+0002804330 00000 n 
+0002804570 00000 n 
+0002804776 00000 n 
+0002805015 00000 n 
+0002805221 00000 n 
+0002805461 00000 n 
+0002805652 00000 n 
+0002805824 00000 n 
+0002806064 00000 n 
+0002806303 00000 n 
+0002806500 00000 n 
+0002806738 00000 n 
+0002806935 00000 n 
+0002807174 00000 n 
+0002807371 00000 n 
+0002807611 00000 n 
+0002807808 00000 n 
+0002808048 00000 n 
+0002808246 00000 n 
+0002808485 00000 n 
+0002808673 00000 n 
+0002808871 00000 n 
+0002809110 00000 n 
+0002809298 00000 n 
+0002809496 00000 n 
+0002809735 00000 n 
+0002809922 00000 n 
+0002814437 00000 n 
+0002814677 00000 n 
+0002814917 00000 n 
+0002815157 00000 n 
+0002810160 00000 n 
+0002811298 00000 n 
+0002797445 00000 n 
+0002795500 00000 n 
+0002810326 00000 n 
+0002799197 00000 n 
+0002800303 00000 n 
+0002801422 00000 n 
+0002810386 00000 n 
+0002802551 00000 n 
+0002810447 00000 n 
+0002810508 00000 n 
+0002810569 00000 n 
+0002810629 00000 n 
+0002810690 00000 n 
+0002810750 00000 n 
+0002810811 00000 n 
+0002810872 00000 n 
+0002810933 00000 n 
+0002810994 00000 n 
+0002811055 00000 n 
+0002811116 00000 n 
+0002811177 00000 n 
+0002811238 00000 n 
+0002887241 00000 n 
+0002887484 00000 n 
+0002887728 00000 n 
+0002890862 00000 n 
+0002815363 00000 n 
+0002815603 00000 n 
+0002815843 00000 n 
+0002816083 00000 n 
+0002816270 00000 n 
+0002816509 00000 n 
+0002816705 00000 n 
+0002816945 00000 n 
+0002817141 00000 n 
+0002817380 00000 n 
+0002817577 00000 n 
+0002817783 00000 n 
+0002817989 00000 n 
+0002818228 00000 n 
+0002818425 00000 n 
+0002818631 00000 n 
+0002818837 00000 n 
+0002819025 00000 n 
+0002819265 00000 n 
+0002819462 00000 n 
+0002819667 00000 n 
+0002819872 00000 n 
+0002820112 00000 n 
+0002820309 00000 n 
+0002820514 00000 n 
+0002820719 00000 n 
+0002820906 00000 n 
+0002821146 00000 n 
+0002821352 00000 n 
+0002821592 00000 n 
+0002821797 00000 n 
+0002822037 00000 n 
+0002822275 00000 n 
+0002822464 00000 n 
+0002822702 00000 n 
+0002822891 00000 n 
+0002823129 00000 n 
+0002823318 00000 n 
+0002823554 00000 n 
+0002823742 00000 n 
+0002823978 00000 n 
+0002824172 00000 n 
+0002824408 00000 n 
+0002829173 00000 n 
+0002829411 00000 n 
+0002829608 00000 n 
+0002829846 00000 n 
+0002824603 00000 n 
+0002825134 00000 n 
+0002813818 00000 n 
+0002811495 00000 n 
+0002824769 00000 n 
+0002824829 00000 n 
+0002824890 00000 n 
+0002824951 00000 n 
+0002825012 00000 n 
+0002825073 00000 n 
+0002891045 00000 n 
+0002891228 00000 n 
+0002891411 00000 n 
+0002891594 00000 n 
+0002894967 00000 n 
+0002895211 00000 n 
+0002895459 00000 n 
+0002899071 00000 n 
+0002899319 00000 n 
+0002899507 00000 n 
+0002902417 00000 n 
+0002902599 00000 n 
+0002902837 00000 n 
+0002903019 00000 n 
+0002905895 00000 n 
+0002906139 00000 n 
+0002830043 00000 n 
+0002830280 00000 n 
+0002830477 00000 n 
+0002830714 00000 n 
+0002830910 00000 n 
+0002831148 00000 n 
+0002831335 00000 n 
+0002831502 00000 n 
+0002831740 00000 n 
+0002831933 00000 n 
+0002832099 00000 n 
+0002832337 00000 n 
+0002832543 00000 n 
+0002832781 00000 n 
+0002832986 00000 n 
+0002833226 00000 n 
+0002833431 00000 n 
+0002833669 00000 n 
+0002833875 00000 n 
+0002834114 00000 n 
+0002834301 00000 n 
+0002834498 00000 n 
+0002834711 00000 n 
+0002834892 00000 n 
+0002835132 00000 n 
+0002835319 00000 n 
+0002835516 00000 n 
+0002835725 00000 n 
+0002835905 00000 n 
+0002836145 00000 n 
+0002836332 00000 n 
+0002836538 00000 n 
+0002836735 00000 n 
+0002836948 00000 n 
+0002837126 00000 n 
+0002837298 00000 n 
+0002837538 00000 n 
+0002837725 00000 n 
+0002837931 00000 n 
+0002838127 00000 n 
+0002838340 00000 n 
+0002838518 00000 n 
+0002838690 00000 n 
+0002838930 00000 n 
+0002839127 00000 n 
+0002839333 00000 n 
+0002839530 00000 n 
+0002839709 00000 n 
+0002839882 00000 n 
+0002840122 00000 n 
+0002840319 00000 n 
+0002840525 00000 n 
+0002840720 00000 n 
+0002840898 00000 n 
+0002841070 00000 n 
+0002841310 00000 n 
+0002841496 00000 n 
+0002841693 00000 n 
+0002842087 00000 n 
+0002842300 00000 n 
+0002842488 00000 n 
+0002842726 00000 n 
+0002842911 00000 n 
+0002843106 00000 n 
+0002843496 00000 n 
+0002847962 00000 n 
+0002848151 00000 n 
+0002848388 00000 n 
+0002848594 00000 n 
+0002848765 00000 n 
+0002843707 00000 n 
+0002843933 00000 n 
+0002828314 00000 n 
+0002825317 00000 n 
+0002843873 00000 n 
+0002841890 00000 n 
+0002843301 00000 n 
+0002906383 00000 n 
+0002906627 00000 n 
+0002909884 00000 n 
+0002910128 00000 n 
+0002910371 00000 n 
+0002914113 00000 n 
+0002914357 00000 n 
+0002914540 00000 n 
+0002914723 00000 n 
+0002914906 00000 n 
+0002919528 00000 n 
+0002919772 00000 n 
+0002920016 00000 n 
+0002925568 00000 n 
+0002925811 00000 n 
+0002926054 00000 n 
+0002931318 00000 n 
+0002931561 00000 n 
+0002848932 00000 n 
+0002849169 00000 n 
+0002849406 00000 n 
+0002849612 00000 n 
+0002849850 00000 n 
+0002850055 00000 n 
+0002850295 00000 n 
+0002850535 00000 n 
+0002850728 00000 n 
+0002850934 00000 n 
+0002851174 00000 n 
+0002851412 00000 n 
+0002851618 00000 n 
+0002851856 00000 n 
+0002852061 00000 n 
+0002852299 00000 n 
+0002852504 00000 n 
+0002852678 00000 n 
+0002852915 00000 n 
+0002853108 00000 n 
+0002853346 00000 n 
+0002853552 00000 n 
+0002853790 00000 n 
+0002853983 00000 n 
+0002854221 00000 n 
+0002854408 00000 n 
+0002854614 00000 n 
+0002854851 00000 n 
+0002855044 00000 n 
+0002855229 00000 n 
+0002855468 00000 n 
+0002855706 00000 n 
+0002855912 00000 n 
+0002856150 00000 n 
+0002856388 00000 n 
+0002856625 00000 n 
+0002856865 00000 n 
+0002857104 00000 n 
+0002857310 00000 n 
+0002857548 00000 n 
+0002857753 00000 n 
+0002857990 00000 n 
+0002858228 00000 n 
+0002859002 00000 n 
+0002847343 00000 n 
+0002844158 00000 n 
+0002858394 00000 n 
+0002858454 00000 n 
+0002858515 00000 n 
+0002858576 00000 n 
+0002858637 00000 n 
+0002858698 00000 n 
+0002858759 00000 n 
+0002858820 00000 n 
+0002858881 00000 n 
+0002858941 00000 n 
+0002935781 00000 n 
+0002935964 00000 n 
+0002936207 00000 n 
+0002936390 00000 n 
+0002940524 00000 n 
+0002940768 00000 n 
+0002941011 00000 n 
+0002945738 00000 n 
+0002945982 00000 n 
+0002946165 00000 n 
+0002952553 00000 n 
+0002952802 00000 n 
+0002953050 00000 n 
+0002861167 00000 n 
+0002861373 00000 n 
+0002861613 00000 n 
+0002861853 00000 n 
+0002862093 00000 n 
+0002862332 00000 n 
+0002862572 00000 n 
+0002862812 00000 n 
+0002863050 00000 n 
+0002863289 00000 n 
+0002863529 00000 n 
+0002863768 00000 n 
+0002863973 00000 n 
+0002864213 00000 n 
+0002864418 00000 n 
+0002864829 00000 n 
+0002865069 00000 n 
+0002865275 00000 n 
+0002865686 00000 n 
+0002865922 00000 n 
+0002866125 00000 n 
+0002867203 00000 n 
+0002860798 00000 n 
+0002859267 00000 n 
+0002866291 00000 n 
+0002866351 00000 n 
+0002866412 00000 n 
+0002866473 00000 n 
+0002866534 00000 n 
+0002866595 00000 n 
+0002866656 00000 n 
+0002866717 00000 n 
+0002866778 00000 n 
+0002866839 00000 n 
+0002866900 00000 n 
+0002866960 00000 n 
+0002867020 00000 n 
+0002867081 00000 n 
+0002867142 00000 n 
+0002864624 00000 n 
+0002865481 00000 n 
+0002955722 00000 n 
+0002955844 00000 n 
+0002955971 00000 n 
+0002871196 00000 n 
+0002871388 00000 n 
+0002871582 00000 n 
+0002871765 00000 n 
+0002871960 00000 n 
+0002872336 00000 n 
+0002872518 00000 n 
+0002872723 00000 n 
+0002872915 00000 n 
+0002873121 00000 n 
+0002873276 00000 n 
+0002873515 00000 n 
+0002873707 00000 n 
+0002873890 00000 n 
+0002874079 00000 n 
+0002874427 00000 n 
+0002870897 00000 n 
+0002867399 00000 n 
+0002874245 00000 n 
+0002874305 00000 n 
+0002874366 00000 n 
+0002872148 00000 n 
+0004467989 00000 n 
+0002876891 00000 n 
+0002877605 00000 n 
+0002876742 00000 n 
+0002874644 00000 n 
+0002877057 00000 n 
+0002877117 00000 n 
+0002877239 00000 n 
+0002877300 00000 n 
+0002877361 00000 n 
+0002877483 00000 n 
+0002877544 00000 n 
+0002879915 00000 n 
+0002881054 00000 n 
+0002879766 00000 n 
+0002877787 00000 n 
+0002880081 00000 n 
+0002880141 00000 n 
+0002880263 00000 n 
+0002880324 00000 n 
+0002880385 00000 n 
+0002880507 00000 n 
+0002880568 00000 n 
+0002880629 00000 n 
+0002880751 00000 n 
+0002880812 00000 n 
+0002880873 00000 n 
+0002880994 00000 n 
+0002883578 00000 n 
+0002884352 00000 n 
+0002883429 00000 n 
+0002881236 00000 n 
+0002883744 00000 n 
+0002883804 00000 n 
+0002883865 00000 n 
+0002883987 00000 n 
+0002884048 00000 n 
+0002884109 00000 n 
+0002884231 00000 n 
+0002884292 00000 n 
+0002886954 00000 n 
+0002887910 00000 n 
+0002886805 00000 n 
+0002884534 00000 n 
+0002887120 00000 n 
+0002887180 00000 n 
+0002887302 00000 n 
+0002887363 00000 n 
+0002887424 00000 n 
+0002887545 00000 n 
+0002887606 00000 n 
+0002887667 00000 n 
+0002887789 00000 n 
+0002887850 00000 n 
+0002890575 00000 n 
+0002891716 00000 n 
+0002890426 00000 n 
+0002888092 00000 n 
+0002890741 00000 n 
+0002890801 00000 n 
+0002890923 00000 n 
+0002890984 00000 n 
+0002891106 00000 n 
+0002891167 00000 n 
+0002891289 00000 n 
+0002891350 00000 n 
+0002891472 00000 n 
+0002891533 00000 n 
+0002891655 00000 n 
+0002894680 00000 n 
+0002895584 00000 n 
+0002894531 00000 n 
+0002891911 00000 n 
+0002894846 00000 n 
+0002894906 00000 n 
+0002895028 00000 n 
+0002895089 00000 n 
+0002895150 00000 n 
+0002895277 00000 n 
+0002895337 00000 n 
+0002895398 00000 n 
+0002895524 00000 n 
+0004468122 00000 n 
+0002898723 00000 n 
+0002899627 00000 n 
+0002898574 00000 n 
+0002895779 00000 n 
+0002898889 00000 n 
+0002898949 00000 n 
+0002899010 00000 n 
+0002899137 00000 n 
+0002899198 00000 n 
+0002899259 00000 n 
+0002899385 00000 n 
+0002899446 00000 n 
+0002899567 00000 n 
+0002902130 00000 n 
+0002903201 00000 n 
+0002901981 00000 n 
+0002899822 00000 n 
+0002902296 00000 n 
+0002902356 00000 n 
+0002902478 00000 n 
+0002902539 00000 n 
+0002902658 00000 n 
+0002902719 00000 n 
+0002902780 00000 n 
+0002902897 00000 n 
+0002902958 00000 n 
+0002903080 00000 n 
+0002903140 00000 n 
+0002905608 00000 n 
+0002906749 00000 n 
+0002905459 00000 n 
+0002903396 00000 n 
+0002905774 00000 n 
+0002905834 00000 n 
+0002905956 00000 n 
+0002906017 00000 n 
+0002906078 00000 n 
+0002906200 00000 n 
+0002906261 00000 n 
+0002906322 00000 n 
+0002906444 00000 n 
+0002906505 00000 n 
+0002906566 00000 n 
+0002906688 00000 n 
+0002909372 00000 n 
+0002909536 00000 n 
+0002910615 00000 n 
+0002909213 00000 n 
+0002906944 00000 n 
+0002909702 00000 n 
+0002909762 00000 n 
+0002909823 00000 n 
+0002909945 00000 n 
+0002910006 00000 n 
+0002910067 00000 n 
+0002910189 00000 n 
+0002910250 00000 n 
+0002910310 00000 n 
+0002910432 00000 n 
+0002910493 00000 n 
+0002910554 00000 n 
+0002913533 00000 n 
+0002913700 00000 n 
+0002913887 00000 n 
+0002915028 00000 n 
+0002913364 00000 n 
+0002910810 00000 n 
+0002914053 00000 n 
+0002914174 00000 n 
+0002914235 00000 n 
+0002914296 00000 n 
+0002914418 00000 n 
+0002914479 00000 n 
+0002914601 00000 n 
+0002914662 00000 n 
+0002914784 00000 n 
+0002914845 00000 n 
+0002914967 00000 n 
+0002918528 00000 n 
+0002918708 00000 n 
+0002918889 00000 n 
+0002919068 00000 n 
+0002919241 00000 n 
+0002920197 00000 n 
+0002918339 00000 n 
+0002915223 00000 n 
+0002919407 00000 n 
+0002919467 00000 n 
+0002919589 00000 n 
+0002919650 00000 n 
+0002919711 00000 n 
+0002919833 00000 n 
+0002919894 00000 n 
+0002919955 00000 n 
+0002920076 00000 n 
+0002920137 00000 n 
+0004468255 00000 n 
+0002923619 00000 n 
+0002924003 00000 n 
+0002924182 00000 n 
+0002924355 00000 n 
+0002924739 00000 n 
+0002924918 00000 n 
+0002925091 00000 n 
+0002930051 00000 n 
+0002930230 00000 n 
+0002925282 00000 n 
+0002926174 00000 n 
+0002923380 00000 n 
+0002920429 00000 n 
+0002925448 00000 n 
+0002925508 00000 n 
+0002923811 00000 n 
+0002925629 00000 n 
+0002925690 00000 n 
+0002925750 00000 n 
+0002924547 00000 n 
+0002925872 00000 n 
+0002925933 00000 n 
+0002925993 00000 n 
+0002926114 00000 n 
+0002930402 00000 n 
+0002930592 00000 n 
+0002930781 00000 n 
+0002930970 00000 n 
+0002931744 00000 n 
+0002929852 00000 n 
+0002926406 00000 n 
+0002931136 00000 n 
+0002931196 00000 n 
+0002931257 00000 n 
+0002931379 00000 n 
+0002931440 00000 n 
+0002931500 00000 n 
+0002931622 00000 n 
+0002931683 00000 n 
+0002934989 00000 n 
+0002935159 00000 n 
+0002935324 00000 n 
+0002935495 00000 n 
+0002936450 00000 n 
+0002934810 00000 n 
+0002931976 00000 n 
+0002935661 00000 n 
+0002935721 00000 n 
+0002935842 00000 n 
+0002935903 00000 n 
+0002936025 00000 n 
+0002936085 00000 n 
+0002936146 00000 n 
+0002936268 00000 n 
+0002936329 00000 n 
+0002939530 00000 n 
+0002939769 00000 n 
+0002940004 00000 n 
+0002940176 00000 n 
+0002941133 00000 n 
+0002939351 00000 n 
+0002936645 00000 n 
+0002940342 00000 n 
+0002940402 00000 n 
+0002940463 00000 n 
+0002940585 00000 n 
+0002940646 00000 n 
+0002940707 00000 n 
+0002940828 00000 n 
+0002940889 00000 n 
+0002940950 00000 n 
+0002941072 00000 n 
+0002944442 00000 n 
+0002944682 00000 n 
+0002944868 00000 n 
+0002945055 00000 n 
+0002945248 00000 n 
+0002945451 00000 n 
+0002946348 00000 n 
+0002944243 00000 n 
+0002941328 00000 n 
+0002945617 00000 n 
+0002945677 00000 n 
+0002945799 00000 n 
+0002945860 00000 n 
+0002945921 00000 n 
+0002946043 00000 n 
+0002946104 00000 n 
+0002946226 00000 n 
+0002946287 00000 n 
+0002950301 00000 n 
+0002950506 00000 n 
+0002950712 00000 n 
+0002951097 00000 n 
+0002951336 00000 n 
+0002951553 00000 n 
+0002951739 00000 n 
+0002952112 00000 n 
+0002952327 00000 n 
+0002953175 00000 n 
+0002950052 00000 n 
+0002946543 00000 n 
+0002952493 00000 n 
+0002950905 00000 n 
+0002952619 00000 n 
+0002952680 00000 n 
+0002952741 00000 n 
+0002952867 00000 n 
+0002952928 00000 n 
+0002952989 00000 n 
+0002951925 00000 n 
+0002953115 00000 n 
+0004468388 00000 n 
+0002958425 00000 n 
+0002962888 00000 n 
+0002955435 00000 n 
+0002956273 00000 n 
+0002955286 00000 n 
+0002953383 00000 n 
+0002955601 00000 n 
+0002955661 00000 n 
+0002955783 00000 n 
+0002955910 00000 n 
+0002956032 00000 n 
+0002956093 00000 n 
+0002962957 00000 n 
+0002963215 00000 n 
+0002963474 00000 n 
+0002963690 00000 n 
+0002963947 00000 n 
+0002964205 00000 n 
+0002964464 00000 n 
+0002964723 00000 n 
+0002964939 00000 n 
+0002965198 00000 n 
+0002965457 00000 n 
+0002965716 00000 n 
+0002965932 00000 n 
+0002966191 00000 n 
+0002966449 00000 n 
+0002966708 00000 n 
+0002967542 00000 n 
+0002958109 00000 n 
+0002956469 00000 n 
+0002966874 00000 n 
+0002966934 00000 n 
+0002966995 00000 n 
+0002967056 00000 n 
+0002967117 00000 n 
+0002967178 00000 n 
+0002967239 00000 n 
+0002967300 00000 n 
+0002967361 00000 n 
+0002967422 00000 n 
+0002959344 00000 n 
+0002959476 00000 n 
+0002959629 00000 n 
+0002959963 00000 n 
+0002960411 00000 n 
+0002960651 00000 n 
+0002960674 00000 n 
+0002962864 00000 n 
+0002970052 00000 n 
+0002970252 00000 n 
+0002970476 00000 n 
+0002970732 00000 n 
+0002970987 00000 n 
+0002971187 00000 n 
+0002971411 00000 n 
+0002971667 00000 n 
+0002971923 00000 n 
+0002972176 00000 n 
+0002972431 00000 n 
+0002972686 00000 n 
+0002972942 00000 n 
+0002973158 00000 n 
+0002973383 00000 n 
+0002973637 00000 n 
+0002973892 00000 n 
+0002974147 00000 n 
+0002974403 00000 n 
+0002974659 00000 n 
+0002974914 00000 n 
+0002975170 00000 n 
+0002975425 00000 n 
+0002975681 00000 n 
+0002975934 00000 n 
+0002977132 00000 n 
+0002969663 00000 n 
+0002967754 00000 n 
+0002976100 00000 n 
+0002976219 00000 n 
+0002976280 00000 n 
+0002976341 00000 n 
+0002976402 00000 n 
+0002976463 00000 n 
+0002976524 00000 n 
+0002976585 00000 n 
+0002976646 00000 n 
+0002976707 00000 n 
+0002976768 00000 n 
+0002976829 00000 n 
+0002976890 00000 n 
+0002976951 00000 n 
+0002977012 00000 n 
+0002979529 00000 n 
+0002983220 00000 n 
+0002983289 00000 n 
+0002983483 00000 n 
+0002983715 00000 n 
+0002983947 00000 n 
+0002984179 00000 n 
+0002984377 00000 n 
+0002984609 00000 n 
+0002984807 00000 n 
+0002985039 00000 n 
+0002985233 00000 n 
+0002985465 00000 n 
+0002985657 00000 n 
+0002985888 00000 n 
+0002986120 00000 n 
+0002986352 00000 n 
+0002986583 00000 n 
+0002986788 00000 n 
+0002987020 00000 n 
+0002987224 00000 n 
+0002991314 00000 n 
+0002991544 00000 n 
+0002987455 00000 n 
+0002988469 00000 n 
+0002979173 00000 n 
+0002977342 00000 n 
+0002987621 00000 n 
+0002987740 00000 n 
+0002987801 00000 n 
+0002987862 00000 n 
+0002987923 00000 n 
+0002987984 00000 n 
+0002988045 00000 n 
+0002988105 00000 n 
+0002988164 00000 n 
+0002988225 00000 n 
+0002988286 00000 n 
+0002988347 00000 n 
+0002988408 00000 n 
+0002980324 00000 n 
+0002980456 00000 n 
+0002980609 00000 n 
+0002980899 00000 n 
+0002981300 00000 n 
+0002981540 00000 n 
+0002981563 00000 n 
+0002983196 00000 n 
+0002991741 00000 n 
+0002991973 00000 n 
+0002992163 00000 n 
+0002992369 00000 n 
+0002992778 00000 n 
+0002993004 00000 n 
+0002993196 00000 n 
+0002993424 00000 n 
+0002993618 00000 n 
+0002993850 00000 n 
+0002994041 00000 n 
+0002994233 00000 n 
+0002994438 00000 n 
+0002994666 00000 n 
+0002994898 00000 n 
+0002995103 00000 n 
+0002995328 00000 n 
+0002995586 00000 n 
+0002995844 00000 n 
+0002996034 00000 n 
+0002996259 00000 n 
+0002996516 00000 n 
+0002996774 00000 n 
+0002997289 00000 n 
+0002997546 00000 n 
+0002997803 00000 n 
+0002997992 00000 n 
+0002998217 00000 n 
+0002998441 00000 n 
+0002998647 00000 n 
+0002998869 00000 n 
+0002999073 00000 n 
+0002999264 00000 n 
+0003000218 00000 n 
+0002990805 00000 n 
+0002988694 00000 n 
+0002999430 00000 n 
+0002999490 00000 n 
+0002999551 00000 n 
+0002999612 00000 n 
+0002992575 00000 n 
+0002999673 00000 n 
+0002999734 00000 n 
+0002999795 00000 n 
+0002999856 00000 n 
+0003000036 00000 n 
+0002997032 00000 n 
+0003000096 00000 n 
+0003000157 00000 n 
+0003114427 00000 n 
+0003127982 00000 n 
+0003128165 00000 n 
+0003049585 00000 n 
+0003049707 00000 n 
+0003049772 00000 n 
+0003049837 00000 n 
+0003049959 00000 n 
+0003050025 00000 n 
+0003050091 00000 n 
+0003050157 00000 n 
+0003050223 00000 n 
+0003050350 00000 n 
+0003055030 00000 n 
+0003002989 00000 n 
+0003003212 00000 n 
+0003003401 00000 n 
+0003003625 00000 n 
+0003003814 00000 n 
+0003004038 00000 n 
+0003004228 00000 n 
+0003004433 00000 n 
+0003004658 00000 n 
+0003004851 00000 n 
+0003005076 00000 n 
+0003005300 00000 n 
+0003005525 00000 n 
+0003005749 00000 n 
+0003005974 00000 n 
+0003006199 00000 n 
+0003006424 00000 n 
+0003006629 00000 n 
+0003006833 00000 n 
+0003007058 00000 n 
+0003007251 00000 n 
+0003007476 00000 n 
+0003007665 00000 n 
+0003007890 00000 n 
+0003008086 00000 n 
+0003008311 00000 n 
+0003008516 00000 n 
+0003008741 00000 n 
+0003008934 00000 n 
+0003009159 00000 n 
+0003009351 00000 n 
+0003009575 00000 n 
+0003009800 00000 n 
+0003010025 00000 n 
+0003010249 00000 n 
+0003010474 00000 n 
+0003010699 00000 n 
+0003014593 00000 n 
+0003014817 00000 n 
+0003015022 00000 n 
+0003015247 00000 n 
+0003015452 00000 n 
+0003010922 00000 n 
+0003011877 00000 n 
+0003002470 00000 n 
+0003000441 00000 n 
+0003011088 00000 n 
+0003011148 00000 n 
+0003011209 00000 n 
+0003011270 00000 n 
+0003011331 00000 n 
+0003011392 00000 n 
+0003011453 00000 n 
+0003011514 00000 n 
+0003011574 00000 n 
+0003011635 00000 n 
+0003011696 00000 n 
+0003011756 00000 n 
+0003011817 00000 n 
+0004468521 00000 n 
+0003055335 00000 n 
+0003055457 00000 n 
+0003055706 00000 n 
+0003058930 00000 n 
+0003059113 00000 n 
+0003059295 00000 n 
+0003059417 00000 n 
+0003059538 00000 n 
+0003059660 00000 n 
+0003062707 00000 n 
+0003015677 00000 n 
+0003015902 00000 n 
+0003016093 00000 n 
+0003016317 00000 n 
+0003016542 00000 n 
+0003016767 00000 n 
+0003016991 00000 n 
+0003017215 00000 n 
+0003017440 00000 n 
+0003017646 00000 n 
+0003017851 00000 n 
+0003018076 00000 n 
+0003018281 00000 n 
+0003018505 00000 n 
+0003018694 00000 n 
+0003018919 00000 n 
+0003019110 00000 n 
+0003019334 00000 n 
+0003019523 00000 n 
+0003019713 00000 n 
+0003019938 00000 n 
+0003020128 00000 n 
+0003020319 00000 n 
+0003021155 00000 n 
+0003014174 00000 n 
+0003012088 00000 n 
+0003020485 00000 n 
+0003020545 00000 n 
+0003020606 00000 n 
+0003020667 00000 n 
+0003020728 00000 n 
+0003020789 00000 n 
+0003020850 00000 n 
+0003020911 00000 n 
+0003020972 00000 n 
+0003021033 00000 n 
+0003021094 00000 n 
+0003062954 00000 n 
+0003063137 00000 n 
+0003063259 00000 n 
+0003024372 00000 n 
+0003024562 00000 n 
+0003024788 00000 n 
+0003024213 00000 n 
+0003021351 00000 n 
+0003024728 00000 n 
+0003027770 00000 n 
+0003027957 00000 n 
+0003028182 00000 n 
+0003028373 00000 n 
+0003028597 00000 n 
+0003032133 00000 n 
+0003028803 00000 n 
+0003029029 00000 n 
+0003027571 00000 n 
+0003024942 00000 n 
+0003028969 00000 n 
+0003032353 00000 n 
+0003032580 00000 n 
+0003032808 00000 n 
+0003033272 00000 n 
+0003033491 00000 n 
+0003037527 00000 n 
+0003037717 00000 n 
+0003033884 00000 n 
+0003034110 00000 n 
+0003031904 00000 n 
+0003029209 00000 n 
+0003034050 00000 n 
+0003033040 00000 n 
+0003033688 00000 n 
+0003643108 00000 n 
+0003101418 00000 n 
+0003101357 00000 n 
+0003037907 00000 n 
+0003038135 00000 n 
+0003038366 00000 n 
+0003038591 00000 n 
+0003038817 00000 n 
+0003037328 00000 n 
+0003034264 00000 n 
+0003038757 00000 n 
+0003122031 00000 n 
+0003086229 00000 n 
+0003041850 00000 n 
+0003042074 00000 n 
+0003042299 00000 n 
+0003042525 00000 n 
+0003041681 00000 n 
+0003039035 00000 n 
+0003042465 00000 n 
+0004468654 00000 n 
+0003045594 00000 n 
+0003045819 00000 n 
+0003046045 00000 n 
+0003045435 00000 n 
+0003042754 00000 n 
+0003045985 00000 n 
+0003048916 00000 n 
+0003049107 00000 n 
+0003049298 00000 n 
+0003050533 00000 n 
+0003048747 00000 n 
+0003046274 00000 n 
+0003049464 00000 n 
+0003049524 00000 n 
+0003049646 00000 n 
+0003049898 00000 n 
+0003050289 00000 n 
+0003050411 00000 n 
+0003050472 00000 n 
+0003054068 00000 n 
+0003054293 00000 n 
+0003054518 00000 n 
+0003054743 00000 n 
+0003055831 00000 n 
+0003053889 00000 n 
+0003050780 00000 n 
+0003054909 00000 n 
+0003054969 00000 n 
+0003055091 00000 n 
+0003055152 00000 n 
+0003055213 00000 n 
+0003055274 00000 n 
+0003055396 00000 n 
+0003055523 00000 n 
+0003055584 00000 n 
+0003055645 00000 n 
+0003055771 00000 n 
+0003058643 00000 n 
+0003059787 00000 n 
+0003058494 00000 n 
+0003056038 00000 n 
+0003058809 00000 n 
+0003058869 00000 n 
+0003058991 00000 n 
+0003059052 00000 n 
+0003059173 00000 n 
+0003059234 00000 n 
+0003059356 00000 n 
+0003059477 00000 n 
+0003059599 00000 n 
+0003059726 00000 n 
+0003062269 00000 n 
+0003065907 00000 n 
+0003069619 00000 n 
+0003062481 00000 n 
+0003063561 00000 n 
+0003062110 00000 n 
+0003059970 00000 n 
+0003062647 00000 n 
+0003062772 00000 n 
+0003062832 00000 n 
+0003062893 00000 n 
+0003063015 00000 n 
+0003063076 00000 n 
+0003063198 00000 n 
+0003063320 00000 n 
+0003063381 00000 n 
+0003069688 00000 n 
+0003069906 00000 n 
+0003070137 00000 n 
+0003070327 00000 n 
+0003070521 00000 n 
+0003070753 00000 n 
+0003070985 00000 n 
+0003071217 00000 n 
+0003071415 00000 n 
+0003071647 00000 n 
+0003071845 00000 n 
+0003072077 00000 n 
+0003072274 00000 n 
+0003072504 00000 n 
+0003072691 00000 n 
+0003072923 00000 n 
+0003073155 00000 n 
+0003073387 00000 n 
+0003073592 00000 n 
+0003073824 00000 n 
+0003074028 00000 n 
+0003074259 00000 n 
+0003075216 00000 n 
+0003065531 00000 n 
+0003063756 00000 n 
+0003074425 00000 n 
+0003074485 00000 n 
+0003074546 00000 n 
+0003074607 00000 n 
+0003074668 00000 n 
+0003074729 00000 n 
+0003074790 00000 n 
+0003074851 00000 n 
+0003074912 00000 n 
+0003074973 00000 n 
+0003075033 00000 n 
+0003075094 00000 n 
+0003075155 00000 n 
+0004468787 00000 n 
+0003066701 00000 n 
+0003066833 00000 n 
+0003066986 00000 n 
+0003067276 00000 n 
+0003067679 00000 n 
+0003067919 00000 n 
+0003067942 00000 n 
+0003069595 00000 n 
+0003078382 00000 n 
+0003078613 00000 n 
+0003078810 00000 n 
+0003079040 00000 n 
+0003079236 00000 n 
+0003079453 00000 n 
+0003079685 00000 n 
+0003079876 00000 n 
+0003080065 00000 n 
+0003080297 00000 n 
+0003080488 00000 n 
+0003080719 00000 n 
+0003080908 00000 n 
+0003081113 00000 n 
+0003081522 00000 n 
+0003081749 00000 n 
+0003081942 00000 n 
+0003082169 00000 n 
+0003082401 00000 n 
+0003082633 00000 n 
+0003082827 00000 n 
+0003083059 00000 n 
+0003083250 00000 n 
+0003083443 00000 n 
+0003083649 00000 n 
+0003083877 00000 n 
+0003084109 00000 n 
+0003084315 00000 n 
+0003084508 00000 n 
+0003084712 00000 n 
+0003084944 00000 n 
+0003085149 00000 n 
+0003086351 00000 n 
+0003077913 00000 n 
+0003075428 00000 n 
+0003085315 00000 n 
+0003085375 00000 n 
+0003085436 00000 n 
+0003085497 00000 n 
+0003085558 00000 n 
+0003085619 00000 n 
+0003081318 00000 n 
+0003085680 00000 n 
+0003085741 00000 n 
+0003085802 00000 n 
+0003085863 00000 n 
+0003085924 00000 n 
+0003085985 00000 n 
+0003086046 00000 n 
+0003086107 00000 n 
+0003086168 00000 n 
+0003086290 00000 n 
+0003090181 00000 n 
+0003090364 00000 n 
+0003089643 00000 n 
+0003092627 00000 n 
+0003096713 00000 n 
+0003089833 00000 n 
+0003090665 00000 n 
+0003089484 00000 n 
+0003086576 00000 n 
+0003089999 00000 n 
+0003090059 00000 n 
+0003090120 00000 n 
+0003090242 00000 n 
+0003090303 00000 n 
+0003090425 00000 n 
+0003090486 00000 n 
+0003096782 00000 n 
+0003097001 00000 n 
+0003097219 00000 n 
+0003097447 00000 n 
+0003097666 00000 n 
+0003097860 00000 n 
+0003098088 00000 n 
+0003098316 00000 n 
+0003098544 00000 n 
+0003098742 00000 n 
+0003098970 00000 n 
+0003099168 00000 n 
+0003099396 00000 n 
+0003099592 00000 n 
+0003099819 00000 n 
+0003100047 00000 n 
+0003100275 00000 n 
+0003100478 00000 n 
+0003104843 00000 n 
+0003105071 00000 n 
+0003100704 00000 n 
+0003101662 00000 n 
+0003092281 00000 n 
+0003090847 00000 n 
+0003100870 00000 n 
+0003100930 00000 n 
+0003100991 00000 n 
+0003101052 00000 n 
+0003101113 00000 n 
+0003101174 00000 n 
+0003101235 00000 n 
+0003101296 00000 n 
+0003101479 00000 n 
+0003101540 00000 n 
+0003101601 00000 n 
+0003093555 00000 n 
+0003093687 00000 n 
+0003093840 00000 n 
+0003094142 00000 n 
+0003094555 00000 n 
+0003094795 00000 n 
+0003094818 00000 n 
+0003096689 00000 n 
+0003105298 00000 n 
+0003105524 00000 n 
+0003105752 00000 n 
+0003105956 00000 n 
+0003106183 00000 n 
+0003106388 00000 n 
+0003106616 00000 n 
+0003106804 00000 n 
+0003107032 00000 n 
+0003107259 00000 n 
+0003107449 00000 n 
+0003107675 00000 n 
+0003107867 00000 n 
+0003108057 00000 n 
+0003108283 00000 n 
+0003108472 00000 n 
+0003108700 00000 n 
+0003108891 00000 n 
+0003109082 00000 n 
+0003109310 00000 n 
+0003109501 00000 n 
+0003109699 00000 n 
+0003109927 00000 n 
+0003110155 00000 n 
+0003110353 00000 n 
+0003110581 00000 n 
+0003110771 00000 n 
+0003110977 00000 n 
+0003111387 00000 n 
+0003111614 00000 n 
+0003111807 00000 n 
+0003112001 00000 n 
+0003112229 00000 n 
+0003112420 00000 n 
+0003112612 00000 n 
+0003112817 00000 n 
+0003113045 00000 n 
+0003113237 00000 n 
+0003113465 00000 n 
+0003113693 00000 n 
+0003117722 00000 n 
+0003113897 00000 n 
+0003115097 00000 n 
+0003104264 00000 n 
+0003101887 00000 n 
+0003114063 00000 n 
+0003114123 00000 n 
+0003114184 00000 n 
+0003114245 00000 n 
+0003114306 00000 n 
+0003114367 00000 n 
+0003114487 00000 n 
+0003114548 00000 n 
+0003114609 00000 n 
+0003114670 00000 n 
+0003114731 00000 n 
+0003114792 00000 n 
+0003114853 00000 n 
+0003114914 00000 n 
+0003111183 00000 n 
+0003114975 00000 n 
+0003115036 00000 n 
+0003122153 00000 n 
+0003128348 00000 n 
+0003117950 00000 n 
+0003118178 00000 n 
+0003118406 00000 n 
+0003118597 00000 n 
+0003118825 00000 n 
+0003119016 00000 n 
+0003119214 00000 n 
+0003119442 00000 n 
+0003119638 00000 n 
+0003119866 00000 n 
+0003120093 00000 n 
+0003120321 00000 n 
+0003120548 00000 n 
+0003120740 00000 n 
+0003120937 00000 n 
+0003121134 00000 n 
+0003122218 00000 n 
+0003117413 00000 n 
+0003115306 00000 n 
+0003121300 00000 n 
+0003121360 00000 n 
+0003121421 00000 n 
+0003121482 00000 n 
+0003121543 00000 n 
+0003121604 00000 n 
+0003121665 00000 n 
+0003121726 00000 n 
+0003121787 00000 n 
+0003121848 00000 n 
+0003121909 00000 n 
+0003121970 00000 n 
+0003122092 00000 n 
+0003136694 00000 n 
+0003136877 00000 n 
+0003125866 00000 n 
+0003126057 00000 n 
+0003126289 00000 n 
+0003126752 00000 n 
+0003126943 00000 n 
+0003127174 00000 n 
+0003127634 00000 n 
+0003128468 00000 n 
+0003125637 00000 n 
+0003122427 00000 n 
+0003127800 00000 n 
+0003127860 00000 n 
+0003127921 00000 n 
+0003128043 00000 n 
+0003128104 00000 n 
+0003126521 00000 n 
+0003128226 00000 n 
+0003128287 00000 n 
+0003127405 00000 n 
+0003128408 00000 n 
+0004468920 00000 n 
+0003135712 00000 n 
+0003135944 00000 n 
+0003131627 00000 n 
+0003135643 00000 n 
+0003136407 00000 n 
+0003137115 00000 n 
+0003131431 00000 n 
+0003128664 00000 n 
+0003136573 00000 n 
+0003136633 00000 n 
+0003136176 00000 n 
+0003136755 00000 n 
+0003136816 00000 n 
+0003136937 00000 n 
+0003132485 00000 n 
+0003132617 00000 n 
+0003132770 00000 n 
+0003133076 00000 n 
+0003133497 00000 n 
+0003133737 00000 n 
+0003133760 00000 n 
+0003135619 00000 n 
+0003140510 00000 n 
+0003140741 00000 n 
+0003140972 00000 n 
+0003141202 00000 n 
+0003141433 00000 n 
+0003141664 00000 n 
+0003141894 00000 n 
+0003142098 00000 n 
+0003142303 00000 n 
+0003142782 00000 n 
+0003142979 00000 n 
+0003143210 00000 n 
+0003143407 00000 n 
+0003143613 00000 n 
+0003144093 00000 n 
+0003144324 00000 n 
+0003144521 00000 n 
+0003144727 00000 n 
+0003145207 00000 n 
+0003145438 00000 n 
+0003145644 00000 n 
+0003145849 00000 n 
+0003146089 00000 n 
+0003146286 00000 n 
+0003146517 00000 n 
+0003146714 00000 n 
+0003146911 00000 n 
+0003147142 00000 n 
+0003147339 00000 n 
+0003147535 00000 n 
+0003147766 00000 n 
+0003147958 00000 n 
+0003148164 00000 n 
+0003148644 00000 n 
+0003148875 00000 n 
+0003149069 00000 n 
+0003149275 00000 n 
+0003149755 00000 n 
+0003149985 00000 n 
+0003150167 00000 n 
+0003150372 00000 n 
+0003150610 00000 n 
+0003150841 00000 n 
+0003151036 00000 n 
+0003151242 00000 n 
+0003151722 00000 n 
+0003151953 00000 n 
+0003152141 00000 n 
+0003152347 00000 n 
+0003152827 00000 n 
+0003153056 00000 n 
+0003153236 00000 n 
+0003153421 00000 n 
+0003153625 00000 n 
+0003157748 00000 n 
+0003157954 00000 n 
+0003154101 00000 n 
+0003154815 00000 n 
+0003139741 00000 n 
+0003137340 00000 n 
+0003154267 00000 n 
+0003154327 00000 n 
+0003154388 00000 n 
+0003154449 00000 n 
+0003154510 00000 n 
+0003154571 00000 n 
+0003142542 00000 n 
+0003143853 00000 n 
+0003144967 00000 n 
+0003154632 00000 n 
+0003154693 00000 n 
+0003154754 00000 n 
+0003148404 00000 n 
+0003149515 00000 n 
+0003151482 00000 n 
+0003152587 00000 n 
+0003153863 00000 n 
+0003216003 00000 n 
+0003216186 00000 n 
+0003216308 00000 n 
+0003216496 00000 n 
+0003219681 00000 n 
+0003219924 00000 n 
+0003220168 00000 n 
+0003223122 00000 n 
+0003223366 00000 n 
+0003158184 00000 n 
+0003158390 00000 n 
+0003158621 00000 n 
+0003158851 00000 n 
+0003159082 00000 n 
+0003159313 00000 n 
+0003159544 00000 n 
+0003159775 00000 n 
+0003159972 00000 n 
+0003160203 00000 n 
+0003160434 00000 n 
+0003160621 00000 n 
+0003160852 00000 n 
+0003161049 00000 n 
+0003161280 00000 n 
+0003161476 00000 n 
+0003161705 00000 n 
+0003161901 00000 n 
+0003162106 00000 n 
+0003162311 00000 n 
+0003162540 00000 n 
+0003162736 00000 n 
+0003162941 00000 n 
+0003163146 00000 n 
+0003163334 00000 n 
+0003163565 00000 n 
+0003163762 00000 n 
+0003163967 00000 n 
+0003164172 00000 n 
+0003164403 00000 n 
+0003164600 00000 n 
+0003164805 00000 n 
+0003165010 00000 n 
+0003165198 00000 n 
+0003165428 00000 n 
+0003165625 00000 n 
+0003165856 00000 n 
+0003166053 00000 n 
+0003166284 00000 n 
+0003166480 00000 n 
+0003166710 00000 n 
+0003166905 00000 n 
+0003171042 00000 n 
+0003171240 00000 n 
+0003171470 00000 n 
+0003171658 00000 n 
+0003171856 00000 n 
+0003172086 00000 n 
+0003172273 00000 n 
+0003172471 00000 n 
+0003172701 00000 n 
+0003167134 00000 n 
+0003167846 00000 n 
+0003157159 00000 n 
+0003155039 00000 n 
+0003167300 00000 n 
+0003167360 00000 n 
+0003167421 00000 n 
+0003167482 00000 n 
+0003167543 00000 n 
+0003167604 00000 n 
+0003167665 00000 n 
+0003167726 00000 n 
+0003167787 00000 n 
+0003223671 00000 n 
+0003226977 00000 n 
+0003227160 00000 n 
+0003227343 00000 n 
+0003227526 00000 n 
+0003231260 00000 n 
+0003231508 00000 n 
+0003235232 00000 n 
+0003235481 00000 n 
+0003235669 00000 n 
+0003238347 00000 n 
+0003238530 00000 n 
+0003172889 00000 n 
+0003173095 00000 n 
+0003173324 00000 n 
+0003173530 00000 n 
+0003173759 00000 n 
+0003173990 00000 n 
+0003174221 00000 n 
+0003174449 00000 n 
+0003174678 00000 n 
+0003174867 00000 n 
+0003175095 00000 n 
+0003175283 00000 n 
+0003175511 00000 n 
+0003175707 00000 n 
+0003175935 00000 n 
+0003176132 00000 n 
+0003176360 00000 n 
+0003176548 00000 n 
+0003176776 00000 n 
+0003176965 00000 n 
+0003177194 00000 n 
+0003177390 00000 n 
+0003177619 00000 n 
+0003177816 00000 n 
+0003178045 00000 n 
+0003178232 00000 n 
+0003178399 00000 n 
+0003178628 00000 n 
+0003178821 00000 n 
+0003178988 00000 n 
+0003179217 00000 n 
+0003179422 00000 n 
+0003179662 00000 n 
+0003179892 00000 n 
+0003180084 00000 n 
+0003180289 00000 n 
+0003180529 00000 n 
+0003180758 00000 n 
+0003180985 00000 n 
+0003181180 00000 n 
+0003181407 00000 n 
+0003186588 00000 n 
+0003186819 00000 n 
+0003187016 00000 n 
+0003187206 00000 n 
+0003187436 00000 n 
+0003187623 00000 n 
+0003187820 00000 n 
+0003181602 00000 n 
+0003182071 00000 n 
+0003170393 00000 n 
+0003168016 00000 n 
+0003181768 00000 n 
+0003181828 00000 n 
+0003181889 00000 n 
+0003181950 00000 n 
+0003182011 00000 n 
+0003238713 00000 n 
+0003238895 00000 n 
+0003239076 00000 n 
+0003239257 00000 n 
+0003242237 00000 n 
+0003242424 00000 n 
+0003242607 00000 n 
+0003242851 00000 n 
+0003243095 00000 n 
+0003245954 00000 n 
+0003246137 00000 n 
+0003246381 00000 n 
+0003246622 00000 n 
+0003250489 00000 n 
+0003250733 00000 n 
+0003250977 00000 n 
+0003254494 00000 n 
+0003254676 00000 n 
+0003254798 00000 n 
+0003188033 00000 n 
+0003188213 00000 n 
+0003188444 00000 n 
+0003188631 00000 n 
+0003188828 00000 n 
+0003189037 00000 n 
+0003189218 00000 n 
+0003189449 00000 n 
+0003189636 00000 n 
+0003189842 00000 n 
+0003190039 00000 n 
+0003190252 00000 n 
+0003190430 00000 n 
+0003190661 00000 n 
+0003190848 00000 n 
+0003191054 00000 n 
+0003191250 00000 n 
+0003191463 00000 n 
+0003191641 00000 n 
+0003191871 00000 n 
+0003192067 00000 n 
+0003192272 00000 n 
+0003192469 00000 n 
+0003192648 00000 n 
+0003192879 00000 n 
+0003193076 00000 n 
+0003193282 00000 n 
+0003193479 00000 n 
+0003193657 00000 n 
+0003193888 00000 n 
+0003194074 00000 n 
+0003194271 00000 n 
+0003194664 00000 n 
+0003194876 00000 n 
+0003195065 00000 n 
+0003195296 00000 n 
+0003195483 00000 n 
+0003195680 00000 n 
+0003196073 00000 n 
+0003196285 00000 n 
+0003196474 00000 n 
+0003196701 00000 n 
+0003196897 00000 n 
+0003197068 00000 n 
+0003197299 00000 n 
+0003197492 00000 n 
+0003197698 00000 n 
+0003198109 00000 n 
+0003198314 00000 n 
+0003198510 00000 n 
+0003198678 00000 n 
+0003198907 00000 n 
+0003199138 00000 n 
+0003199334 00000 n 
+0003199507 00000 n 
+0003199735 00000 n 
+0003199931 00000 n 
+0003203628 00000 n 
+0003203825 00000 n 
+0003204056 00000 n 
+0003200104 00000 n 
+0003200330 00000 n 
+0003185769 00000 n 
+0003182254 00000 n 
+0003200270 00000 n 
+0003194468 00000 n 
+0003195877 00000 n 
+0003197904 00000 n 
+0003254986 00000 n 
+0003255169 00000 n 
+0003259508 00000 n 
+0003259752 00000 n 
+0003265149 00000 n 
+0003265393 00000 n 
+0003265637 00000 n 
+0003270136 00000 n 
+0003270379 00000 n 
+0003270623 00000 n 
+0003276380 00000 n 
+0003276628 00000 n 
+0003276750 00000 n 
+0003282105 00000 n 
+0003204253 00000 n 
+0003204450 00000 n 
+0003204681 00000 n 
+0003204878 00000 n 
+0003205107 00000 n 
+0003205303 00000 n 
+0003205532 00000 n 
+0003205738 00000 n 
+0003205966 00000 n 
+0003206170 00000 n 
+0003206399 00000 n 
+0003206595 00000 n 
+0003206823 00000 n 
+0003207016 00000 n 
+0003207245 00000 n 
+0003207451 00000 n 
+0003207679 00000 n 
+0003207908 00000 n 
+0003208095 00000 n 
+0003208301 00000 n 
+0003208529 00000 n 
+0003208722 00000 n 
+0003208907 00000 n 
+0003209113 00000 n 
+0003209344 00000 n 
+0003209526 00000 n 
+0003209722 00000 n 
+0003209905 00000 n 
+0003210133 00000 n 
+0003210316 00000 n 
+0003210499 00000 n 
+0003211391 00000 n 
+0003203149 00000 n 
+0003200582 00000 n 
+0003210665 00000 n 
+0003210725 00000 n 
+0003210785 00000 n 
+0003210845 00000 n 
+0003210906 00000 n 
+0003210966 00000 n 
+0003211027 00000 n 
+0003211088 00000 n 
+0003211149 00000 n 
+0003211210 00000 n 
+0003211271 00000 n 
+0003211332 00000 n 
+0004469053 00000 n 
+0003282354 00000 n 
+0003282476 00000 n 
+0003287399 00000 n 
+0003287582 00000 n 
+0003287703 00000 n 
+0003287952 00000 n 
+0003294164 00000 n 
+0003214387 00000 n 
+0003214579 00000 n 
+0003214773 00000 n 
+0003214956 00000 n 
+0003215151 00000 n 
+0003215339 00000 n 
+0003215521 00000 n 
+0003215717 00000 n 
+0003216678 00000 n 
+0003214168 00000 n 
+0003211615 00000 n 
+0003215883 00000 n 
+0003215943 00000 n 
+0003216064 00000 n 
+0003216125 00000 n 
+0003216247 00000 n 
+0003216374 00000 n 
+0003216435 00000 n 
+0003216557 00000 n 
+0003216617 00000 n 
+0003219394 00000 n 
+0003220290 00000 n 
+0003219245 00000 n 
+0003216860 00000 n 
+0003219560 00000 n 
+0003219620 00000 n 
+0003219742 00000 n 
+0003219803 00000 n 
+0003219864 00000 n 
+0003219985 00000 n 
+0003220046 00000 n 
+0003220107 00000 n 
+0003220229 00000 n 
+0003222774 00000 n 
+0003223791 00000 n 
+0003222625 00000 n 
+0003220472 00000 n 
+0003222940 00000 n 
+0003223000 00000 n 
+0003223061 00000 n 
+0003223183 00000 n 
+0003223244 00000 n 
+0003223305 00000 n 
+0003223427 00000 n 
+0003223488 00000 n 
+0003223549 00000 n 
+0003223610 00000 n 
+0003223731 00000 n 
+0003226690 00000 n 
+0003227648 00000 n 
+0003226541 00000 n 
+0003223973 00000 n 
+0003226856 00000 n 
+0003226916 00000 n 
+0003227038 00000 n 
+0003227099 00000 n 
+0004456963 00000 n 
+0003227221 00000 n 
+0003227282 00000 n 
+0003227404 00000 n 
+0003227465 00000 n 
+0003227587 00000 n 
+0003230912 00000 n 
+0003231757 00000 n 
+0003230763 00000 n 
+0003227883 00000 n 
+0003231078 00000 n 
+0003231138 00000 n 
+0003231199 00000 n 
+0003231326 00000 n 
+0003231387 00000 n 
+0003231447 00000 n 
+0003231574 00000 n 
+0003231635 00000 n 
+0003231696 00000 n 
+0003235006 00000 n 
+0003235852 00000 n 
+0003234857 00000 n 
+0003231952 00000 n 
+0003235172 00000 n 
+0003235298 00000 n 
+0003235359 00000 n 
+0003235420 00000 n 
+0003235547 00000 n 
+0003235608 00000 n 
+0003235730 00000 n 
+0003235791 00000 n 
+0004469186 00000 n 
+0003238121 00000 n 
+0003239377 00000 n 
+0003237972 00000 n 
+0003236047 00000 n 
+0003238287 00000 n 
+0003238408 00000 n 
+0003238469 00000 n 
+0003238591 00000 n 
+0003238652 00000 n 
+0003238774 00000 n 
+0003238835 00000 n 
+0003238954 00000 n 
+0003239015 00000 n 
+0003239137 00000 n 
+0003239196 00000 n 
+0003239317 00000 n 
+0003242011 00000 n 
+0003243215 00000 n 
+0003241862 00000 n 
+0003239572 00000 n 
+0003242177 00000 n 
+0003242302 00000 n 
+0003242363 00000 n 
+0003242485 00000 n 
+0003242546 00000 n 
+0003242668 00000 n 
+0003242729 00000 n 
+0003242790 00000 n 
+0003242912 00000 n 
+0003242973 00000 n 
+0003243034 00000 n 
+0003243155 00000 n 
+0003245606 00000 n 
+0003246742 00000 n 
+0003245457 00000 n 
+0003243410 00000 n 
+0003245772 00000 n 
+0003245832 00000 n 
+0003245893 00000 n 
+0003246015 00000 n 
+0003246076 00000 n 
+0003246198 00000 n 
+0003246259 00000 n 
+0003246320 00000 n 
+0003246442 00000 n 
+0003246502 00000 n 
+0003246563 00000 n 
+0003246682 00000 n 
+0003249623 00000 n 
+0003249787 00000 n 
+0003249954 00000 n 
+0003250141 00000 n 
+0003251159 00000 n 
+0003249444 00000 n 
+0003246937 00000 n 
+0003250307 00000 n 
+0003250367 00000 n 
+0003250428 00000 n 
+0003250550 00000 n 
+0003250611 00000 n 
+0003250672 00000 n 
+0003250794 00000 n 
+0003250855 00000 n 
+0003250916 00000 n 
+0003251038 00000 n 
+0003251098 00000 n 
+0003254078 00000 n 
+0003258620 00000 n 
+0003254268 00000 n 
+0003255289 00000 n 
+0003253919 00000 n 
+0003251354 00000 n 
+0003254434 00000 n 
+0003254555 00000 n 
+0003254616 00000 n 
+0003254737 00000 n 
+0003254864 00000 n 
+0003254925 00000 n 
+0003255047 00000 n 
+0003255108 00000 n 
+0003255229 00000 n 
+0003258800 00000 n 
+0003258981 00000 n 
+0003259160 00000 n 
+0003259935 00000 n 
+0003258441 00000 n 
+0003255484 00000 n 
+0003259326 00000 n 
+0003259386 00000 n 
+0003259447 00000 n 
+0003259569 00000 n 
+0003259630 00000 n 
+0003259691 00000 n 
+0003259813 00000 n 
+0003259874 00000 n 
+0004469319 00000 n 
+0003263369 00000 n 
+0003263751 00000 n 
+0003263930 00000 n 
+0003264313 00000 n 
+0003264492 00000 n 
+0003264683 00000 n 
+0003264862 00000 n 
+0003265759 00000 n 
+0003263140 00000 n 
+0003260167 00000 n 
+0003265028 00000 n 
+0003265088 00000 n 
+0003263561 00000 n 
+0003265210 00000 n 
+0003265271 00000 n 
+0003265332 00000 n 
+0003264122 00000 n 
+0003265454 00000 n 
+0003265515 00000 n 
+0003265576 00000 n 
+0003265698 00000 n 
+0003269219 00000 n 
+0003269410 00000 n 
+0003269599 00000 n 
+0003275120 00000 n 
+0003269788 00000 n 
+0003270743 00000 n 
+0003269040 00000 n 
+0003265991 00000 n 
+0003269954 00000 n 
+0003270014 00000 n 
+0003270075 00000 n 
+0003270197 00000 n 
+0003270258 00000 n 
+0003270319 00000 n 
+0003270440 00000 n 
+0003270501 00000 n 
+0003270562 00000 n 
+0003270683 00000 n 
+0003275291 00000 n 
+0003275461 00000 n 
+0003275628 00000 n 
+0003275814 00000 n 
+0003275982 00000 n 
+0003276154 00000 n 
+0003276877 00000 n 
+0003274911 00000 n 
+0003270975 00000 n 
+0003276320 00000 n 
+0003276446 00000 n 
+0003276507 00000 n 
+0003276568 00000 n 
+0003276689 00000 n 
+0003276816 00000 n 
+0003280509 00000 n 
+0003280664 00000 n 
+0003280821 00000 n 
+0003280996 00000 n 
+0003281391 00000 n 
+0003281585 00000 n 
+0003281757 00000 n 
+0003282541 00000 n 
+0003280290 00000 n 
+0003277084 00000 n 
+0003281923 00000 n 
+0003281983 00000 n 
+0003282044 00000 n 
+0003282171 00000 n 
+0003282232 00000 n 
+0003282293 00000 n 
+0003281194 00000 n 
+0003282415 00000 n 
+0003285949 00000 n 
+0003286135 00000 n 
+0003286322 00000 n 
+0003286543 00000 n 
+0003286773 00000 n 
+0003286990 00000 n 
+0003288078 00000 n 
+0003285750 00000 n 
+0003282736 00000 n 
+0003287156 00000 n 
+0003287216 00000 n 
+0003287277 00000 n 
+0003287338 00000 n 
+0003287460 00000 n 
+0003287521 00000 n 
+0003287643 00000 n 
+0003287769 00000 n 
+0003287830 00000 n 
+0003287891 00000 n 
+0003288017 00000 n 
+0003528187 00000 n 
+0003291710 00000 n 
+0003291896 00000 n 
+0003292269 00000 n 
+0003292486 00000 n 
+0003292878 00000 n 
+0003293061 00000 n 
+0003293293 00000 n 
+0003293525 00000 n 
+0003297150 00000 n 
+0003297382 00000 n 
+0003293755 00000 n 
+0003294648 00000 n 
+0003291461 00000 n 
+0003288285 00000 n 
+0003293921 00000 n 
+0003293981 00000 n 
+0003294042 00000 n 
+0003292082 00000 n 
+0003294103 00000 n 
+0003294225 00000 n 
+0003292682 00000 n 
+0003294405 00000 n 
+0003294466 00000 n 
+0003294527 00000 n 
+0003294588 00000 n 
+0004469452 00000 n 
+0003297580 00000 n 
+0003297812 00000 n 
+0003298010 00000 n 
+0003298242 00000 n 
+0003298439 00000 n 
+0003298670 00000 n 
+0003298868 00000 n 
+0003299100 00000 n 
+0003299298 00000 n 
+0003299530 00000 n 
+0003299728 00000 n 
+0003299960 00000 n 
+0003300191 00000 n 
+0003300389 00000 n 
+0003300587 00000 n 
+0003300819 00000 n 
+0003301017 00000 n 
+0003301215 00000 n 
+0003301411 00000 n 
+0003301642 00000 n 
+0003301839 00000 n 
+0003302036 00000 n 
+0003302233 00000 n 
+0003302465 00000 n 
+0003302663 00000 n 
+0003302861 00000 n 
+0003303093 00000 n 
+0003303291 00000 n 
+0003303522 00000 n 
+0003303720 00000 n 
+0003303918 00000 n 
+0003304150 00000 n 
+0003304348 00000 n 
+0003304546 00000 n 
+0003304743 00000 n 
+0003304975 00000 n 
+0003305173 00000 n 
+0003305371 00000 n 
+0003305567 00000 n 
+0003305798 00000 n 
+0003305995 00000 n 
+0003306192 00000 n 
+0003307332 00000 n 
+0003296571 00000 n 
+0003294884 00000 n 
+0003306358 00000 n 
+0003306418 00000 n 
+0003306479 00000 n 
+0003306540 00000 n 
+0003306601 00000 n 
+0003306662 00000 n 
+0003306723 00000 n 
+0003306784 00000 n 
+0003306845 00000 n 
+0003306906 00000 n 
+0003306967 00000 n 
+0003307028 00000 n 
+0003307089 00000 n 
+0003307150 00000 n 
+0003307211 00000 n 
+0003307272 00000 n 
+0003311744 00000 n 
+0003311866 00000 n 
+0003309675 00000 n 
+0003309907 00000 n 
+0003310139 00000 n 
+0003310371 00000 n 
+0003310603 00000 n 
+0003310801 00000 n 
+0003311031 00000 n 
+0003311227 00000 n 
+0003315176 00000 n 
+0003315374 00000 n 
+0003311457 00000 n 
+0003312835 00000 n 
+0003309446 00000 n 
+0003307557 00000 n 
+0003311623 00000 n 
+0003311683 00000 n 
+0003311805 00000 n 
+0003311926 00000 n 
+0003311987 00000 n 
+0003312048 00000 n 
+0003312108 00000 n 
+0003312169 00000 n 
+0003312349 00000 n 
+0003312410 00000 n 
+0003312471 00000 n 
+0003312532 00000 n 
+0003312593 00000 n 
+0003312654 00000 n 
+0003312715 00000 n 
+0003312775 00000 n 
+0003315606 00000 n 
+0003315837 00000 n 
+0003316035 00000 n 
+0003316233 00000 n 
+0003316465 00000 n 
+0003316663 00000 n 
+0003316861 00000 n 
+0003317058 00000 n 
+0003317290 00000 n 
+0003317488 00000 n 
+0003317686 00000 n 
+0003317882 00000 n 
+0003318113 00000 n 
+0003318310 00000 n 
+0003318507 00000 n 
+0003318739 00000 n 
+0003318937 00000 n 
+0003319168 00000 n 
+0003319366 00000 n 
+0003319564 00000 n 
+0003319796 00000 n 
+0003319994 00000 n 
+0003320192 00000 n 
+0003320389 00000 n 
+0003320621 00000 n 
+0003320819 00000 n 
+0003321017 00000 n 
+0003321214 00000 n 
+0003321446 00000 n 
+0003321644 00000 n 
+0003321842 00000 n 
+0003322861 00000 n 
+0003314707 00000 n 
+0003313060 00000 n 
+0003322008 00000 n 
+0003322068 00000 n 
+0003322129 00000 n 
+0003322190 00000 n 
+0003322251 00000 n 
+0003322312 00000 n 
+0003322373 00000 n 
+0003322434 00000 n 
+0003322495 00000 n 
+0003322556 00000 n 
+0003322617 00000 n 
+0003322678 00000 n 
+0003322739 00000 n 
+0003322800 00000 n 
+0003324816 00000 n 
+0003328392 00000 n 
+0003328461 00000 n 
+0003328666 00000 n 
+0003328888 00000 n 
+0003329093 00000 n 
+0003329314 00000 n 
+0003329518 00000 n 
+0003333534 00000 n 
+0003333724 00000 n 
+0003333920 00000 n 
+0003329739 00000 n 
+0003330632 00000 n 
+0003324590 00000 n 
+0003323059 00000 n 
+0003329905 00000 n 
+0003329965 00000 n 
+0003330026 00000 n 
+0003330087 00000 n 
+0003330148 00000 n 
+0003330328 00000 n 
+0003330389 00000 n 
+0003330450 00000 n 
+0003330511 00000 n 
+0003330572 00000 n 
+0003325708 00000 n 
+0003325840 00000 n 
+0003325993 00000 n 
+0003326267 00000 n 
+0003326652 00000 n 
+0003326892 00000 n 
+0003326915 00000 n 
+0003328368 00000 n 
+0003334142 00000 n 
+0003334338 00000 n 
+0003334560 00000 n 
+0003334755 00000 n 
+0003334978 00000 n 
+0003335172 00000 n 
+0003335394 00000 n 
+0003335591 00000 n 
+0003335814 00000 n 
+0003336011 00000 n 
+0003336234 00000 n 
+0003336432 00000 n 
+0003336654 00000 n 
+0003336842 00000 n 
+0003337040 00000 n 
+0003337262 00000 n 
+0003337449 00000 n 
+0003337647 00000 n 
+0003337869 00000 n 
+0003338057 00000 n 
+0003338278 00000 n 
+0003338501 00000 n 
+0003338724 00000 n 
+0003338946 00000 n 
+0003339134 00000 n 
+0003339357 00000 n 
+0003339580 00000 n 
+0003339802 00000 n 
+0003340025 00000 n 
+0003340212 00000 n 
+0003340435 00000 n 
+0003340632 00000 n 
+0003340855 00000 n 
+0003341051 00000 n 
+0003341273 00000 n 
+0003341470 00000 n 
+0003341676 00000 n 
+0003341882 00000 n 
+0003342104 00000 n 
+0003342301 00000 n 
+0003342507 00000 n 
+0003342713 00000 n 
+0003342900 00000 n 
+0003343123 00000 n 
+0003343320 00000 n 
+0003343525 00000 n 
+0003348443 00000 n 
+0003348666 00000 n 
+0003348863 00000 n 
+0003349068 00000 n 
+0003349273 00000 n 
+0003349461 00000 n 
+0003349684 00000 n 
+0003349880 00000 n 
+0003350086 00000 n 
+0003350292 00000 n 
+0003350703 00000 n 
+0003343730 00000 n 
+0003344686 00000 n 
+0003332895 00000 n 
+0003330859 00000 n 
+0003343896 00000 n 
+0003343956 00000 n 
+0003344017 00000 n 
+0003344078 00000 n 
+0003344139 00000 n 
+0003344200 00000 n 
+0003344261 00000 n 
+0003344322 00000 n 
+0003344383 00000 n 
+0003344444 00000 n 
+0003344505 00000 n 
+0003344565 00000 n 
+0003344626 00000 n 
+0003442791 00000 n 
+0003442972 00000 n 
+0003443155 00000 n 
+0003443338 00000 n 
+0003446612 00000 n 
+0003446795 00000 n 
+0003446978 00000 n 
+0003447161 00000 n 
+0003447400 00000 n 
+0003451193 00000 n 
+0003350908 00000 n 
+0003351131 00000 n 
+0003351320 00000 n 
+0003351542 00000 n 
+0003351728 00000 n 
+0003351951 00000 n 
+0003352172 00000 n 
+0003352361 00000 n 
+0003352582 00000 n 
+0003352770 00000 n 
+0003352990 00000 n 
+0003353178 00000 n 
+0003353398 00000 n 
+0003353594 00000 n 
+0003353815 00000 n 
+0003354012 00000 n 
+0003354233 00000 n 
+0003354429 00000 n 
+0003354650 00000 n 
+0003354846 00000 n 
+0003355065 00000 n 
+0003355259 00000 n 
+0003355480 00000 n 
+0003355677 00000 n 
+0003355898 00000 n 
+0003356087 00000 n 
+0003356303 00000 n 
+0003356488 00000 n 
+0003356707 00000 n 
+0003356903 00000 n 
+0003357124 00000 n 
+0003357321 00000 n 
+0003357544 00000 n 
+0003357735 00000 n 
+0003357922 00000 n 
+0003358113 00000 n 
+0003358300 00000 n 
+0003358522 00000 n 
+0003358711 00000 n 
+0003358897 00000 n 
+0003359086 00000 n 
+0003359271 00000 n 
+0003359475 00000 n 
+0003359701 00000 n 
+0003347754 00000 n 
+0003344870 00000 n 
+0003359641 00000 n 
+0003350497 00000 n 
+0004469585 00000 n 
+0003451442 00000 n 
+0003455491 00000 n 
+0003455740 00000 n 
+0003455928 00000 n 
+0003456111 00000 n 
+0003459711 00000 n 
+0003459959 00000 n 
+0003460142 00000 n 
+0003460325 00000 n 
+0003463378 00000 n 
+0003463622 00000 n 
+0003463866 00000 n 
+0003467160 00000 n 
+0003467404 00000 n 
+0003467647 00000 n 
+0003471168 00000 n 
+0003471351 00000 n 
+0003471595 00000 n 
+0003471839 00000 n 
+0003476034 00000 n 
+0003363667 00000 n 
+0003363889 00000 n 
+0003364071 00000 n 
+0003364258 00000 n 
+0003364479 00000 n 
+0003364666 00000 n 
+0003364833 00000 n 
+0003365054 00000 n 
+0003365247 00000 n 
+0003365414 00000 n 
+0003365635 00000 n 
+0003365824 00000 n 
+0003366045 00000 n 
+0003366234 00000 n 
+0003366454 00000 n 
+0003366640 00000 n 
+0003366861 00000 n 
+0003367050 00000 n 
+0003367229 00000 n 
+0003367449 00000 n 
+0003367637 00000 n 
+0003367860 00000 n 
+0003368049 00000 n 
+0003368230 00000 n 
+0003368452 00000 n 
+0003368639 00000 n 
+0003368836 00000 n 
+0003369048 00000 n 
+0003369229 00000 n 
+0003369451 00000 n 
+0003369637 00000 n 
+0003369828 00000 n 
+0003370015 00000 n 
+0003370238 00000 n 
+0003370425 00000 n 
+0003370622 00000 n 
+0003370830 00000 n 
+0003371011 00000 n 
+0003371234 00000 n 
+0003371421 00000 n 
+0003371627 00000 n 
+0003371824 00000 n 
+0003372037 00000 n 
+0003372216 00000 n 
+0003372438 00000 n 
+0003372624 00000 n 
+0003372829 00000 n 
+0003373024 00000 n 
+0003373237 00000 n 
+0003373414 00000 n 
+0003373637 00000 n 
+0003373834 00000 n 
+0003374040 00000 n 
+0003374237 00000 n 
+0003374416 00000 n 
+0003374639 00000 n 
+0003374836 00000 n 
+0003375042 00000 n 
+0003375238 00000 n 
+0003375416 00000 n 
+0003375637 00000 n 
+0003375821 00000 n 
+0003376016 00000 n 
+0003376406 00000 n 
+0003380886 00000 n 
+0003381075 00000 n 
+0003381297 00000 n 
+0003381483 00000 n 
+0003381679 00000 n 
+0003382072 00000 n 
+0003376617 00000 n 
+0003376965 00000 n 
+0003362868 00000 n 
+0003359912 00000 n 
+0003376783 00000 n 
+0003376843 00000 n 
+0003376904 00000 n 
+0003376211 00000 n 
+0003476283 00000 n 
+0003476471 00000 n 
+0003476714 00000 n 
+0003480552 00000 n 
+0003480735 00000 n 
+0003480917 00000 n 
+0003481099 00000 n 
+0003481282 00000 n 
+0003485743 00000 n 
+0003485986 00000 n 
+0003491095 00000 n 
+0003491339 00000 n 
+0003491583 00000 n 
+0003496253 00000 n 
+0003496497 00000 n 
+0003382285 00000 n 
+0003382473 00000 n 
+0003382693 00000 n 
+0003382882 00000 n 
+0003383053 00000 n 
+0003383276 00000 n 
+0003383469 00000 n 
+0003383675 00000 n 
+0003384087 00000 n 
+0003384293 00000 n 
+0003384490 00000 n 
+0003384658 00000 n 
+0003384878 00000 n 
+0003385082 00000 n 
+0003385321 00000 n 
+0003385544 00000 n 
+0003385737 00000 n 
+0003385943 00000 n 
+0003386183 00000 n 
+0003386404 00000 n 
+0003386623 00000 n 
+0003386810 00000 n 
+0003386976 00000 n 
+0003387199 00000 n 
+0003387388 00000 n 
+0003387585 00000 n 
+0003387757 00000 n 
+0003387923 00000 n 
+0003388146 00000 n 
+0003388335 00000 n 
+0003388532 00000 n 
+0003388704 00000 n 
+0003388870 00000 n 
+0003389091 00000 n 
+0003389280 00000 n 
+0003389442 00000 n 
+0003389662 00000 n 
+0003389851 00000 n 
+0003390074 00000 n 
+0003390263 00000 n 
+0003390459 00000 n 
+0003390630 00000 n 
+0003390793 00000 n 
+0003391016 00000 n 
+0003391203 00000 n 
+0003391400 00000 n 
+0003391572 00000 n 
+0003391734 00000 n 
+0003391955 00000 n 
+0003392161 00000 n 
+0003392382 00000 n 
+0003392587 00000 n 
+0003392808 00000 n 
+0003392995 00000 n 
+0003393168 00000 n 
+0003393385 00000 n 
+0003393575 00000 n 
+0003393794 00000 n 
+0003397361 00000 n 
+0003393998 00000 n 
+0003394345 00000 n 
+0003380077 00000 n 
+0003377217 00000 n 
+0003394164 00000 n 
+0003381875 00000 n 
+0003383881 00000 n 
+0003394224 00000 n 
+0003394284 00000 n 
+0003496741 00000 n 
+0003502471 00000 n 
+0003502653 00000 n 
+0003506595 00000 n 
+0003506777 00000 n 
+0003506959 00000 n 
+0003511918 00000 n 
+0003512162 00000 n 
+0003512406 00000 n 
+0003517461 00000 n 
+0003517705 00000 n 
+0003517949 00000 n 
+0003522724 00000 n 
+0003522968 00000 n 
+0003523151 00000 n 
+0003528004 00000 n 
+0003397582 00000 n 
+0003397775 00000 n 
+0003397996 00000 n 
+0003398183 00000 n 
+0003398389 00000 n 
+0003398609 00000 n 
+0003398802 00000 n 
+0003398987 00000 n 
+0003399210 00000 n 
+0003399430 00000 n 
+0003399618 00000 n 
+0003399839 00000 n 
+0003400060 00000 n 
+0003400281 00000 n 
+0003400504 00000 n 
+0003400727 00000 n 
+0003400933 00000 n 
+0003401154 00000 n 
+0003401360 00000 n 
+0003401581 00000 n 
+0003401804 00000 n 
+0003402010 00000 n 
+0003402233 00000 n 
+0003402422 00000 n 
+0003402645 00000 n 
+0003402866 00000 n 
+0003403089 00000 n 
+0003403311 00000 n 
+0003403532 00000 n 
+0003403738 00000 n 
+0003403944 00000 n 
+0003404163 00000 n 
+0003404350 00000 n 
+0003404554 00000 n 
+0003409129 00000 n 
+0003409350 00000 n 
+0003409546 00000 n 
+0003409767 00000 n 
+0003409964 00000 n 
+0003404792 00000 n 
+0003405872 00000 n 
+0003396862 00000 n 
+0003394569 00000 n 
+0003404958 00000 n 
+0003405018 00000 n 
+0003405079 00000 n 
+0003405140 00000 n 
+0003405201 00000 n 
+0003405262 00000 n 
+0003405323 00000 n 
+0003405384 00000 n 
+0003405445 00000 n 
+0003405506 00000 n 
+0003405567 00000 n 
+0003405628 00000 n 
+0003405689 00000 n 
+0003405750 00000 n 
+0003405811 00000 n 
+0003528369 00000 n 
+0003533886 00000 n 
+0003534134 00000 n 
+0003534322 00000 n 
+0003435259 00000 n 
+0003435442 00000 n 
+0003410158 00000 n 
+0003410379 00000 n 
+0003410574 00000 n 
+0003410795 00000 n 
+0003410991 00000 n 
+0003411185 00000 n 
+0003411405 00000 n 
+0003411584 00000 n 
+0003411770 00000 n 
+0003411975 00000 n 
+0003412453 00000 n 
+0003412640 00000 n 
+0003412862 00000 n 
+0003413051 00000 n 
+0003413273 00000 n 
+0003413466 00000 n 
+0003413672 00000 n 
+0003413895 00000 n 
+0003414086 00000 n 
+0003414273 00000 n 
+0003414479 00000 n 
+0003414668 00000 n 
+0003414855 00000 n 
+0003415077 00000 n 
+0003415267 00000 n 
+0003415453 00000 n 
+0003415658 00000 n 
+0003415855 00000 n 
+0003416051 00000 n 
+0003416274 00000 n 
+0003416465 00000 n 
+0003416652 00000 n 
+0003416858 00000 n 
+0003417055 00000 n 
+0003417261 00000 n 
+0003417467 00000 n 
+0003417673 00000 n 
+0003417896 00000 n 
+0003418085 00000 n 
+0003418308 00000 n 
+0003418497 00000 n 
+0003418686 00000 n 
+0003418907 00000 n 
+0003419095 00000 n 
+0003419281 00000 n 
+0003419502 00000 n 
+0003419689 00000 n 
+0003423388 00000 n 
+0003423611 00000 n 
+0003423800 00000 n 
+0003423989 00000 n 
+0003424212 00000 n 
+0003424401 00000 n 
+0003419876 00000 n 
+0003420284 00000 n 
+0003408450 00000 n 
+0003406096 00000 n 
+0003420042 00000 n 
+0003412214 00000 n 
+0003420102 00000 n 
+0003420162 00000 n 
+0003420223 00000 n 
+0003435564 00000 n 
+0003438642 00000 n 
+0003438886 00000 n 
+0003439130 00000 n 
+0003442547 00000 n 
+0003534444 00000 n 
+0003538911 00000 n 
+0003539093 00000 n 
+0003539281 00000 n 
+0003543158 00000 n 
+0003543276 00000 n 
+0003543403 00000 n 
+0003543525 00000 n 
+0003424590 00000 n 
+0003424776 00000 n 
+0003424941 00000 n 
+0003425132 00000 n 
+0003425326 00000 n 
+0003425654 00000 n 
+0003425941 00000 n 
+0003423119 00000 n 
+0003420507 00000 n 
+0003425820 00000 n 
+0003425880 00000 n 
+0003425490 00000 n 
+0003428485 00000 n 
+0003428725 00000 n 
+0003428951 00000 n 
+0003428326 00000 n 
+0003426174 00000 n 
+0003428891 00000 n 
+0004469718 00000 n 
+0003431370 00000 n 
+0003431610 00000 n 
+0003431836 00000 n 
+0003431211 00000 n 
+0003429167 00000 n 
+0003431776 00000 n 
+0003434972 00000 n 
+0003435752 00000 n 
+0003434823 00000 n 
+0003432052 00000 n 
+0003435138 00000 n 
+0003435198 00000 n 
+0003435320 00000 n 
+0003435381 00000 n 
+0003435503 00000 n 
+0003435630 00000 n 
+0003435691 00000 n 
+0003438355 00000 n 
+0003439313 00000 n 
+0003438206 00000 n 
+0003435996 00000 n 
+0003438521 00000 n 
+0003438581 00000 n 
+0003438703 00000 n 
+0003438764 00000 n 
+0003438825 00000 n 
+0003438947 00000 n 
+0003439008 00000 n 
+0003439069 00000 n 
+0003439191 00000 n 
+0003439252 00000 n 
+0003442260 00000 n 
+0003443460 00000 n 
+0003442111 00000 n 
+0003439482 00000 n 
+0003442426 00000 n 
+0003442486 00000 n 
+0003442608 00000 n 
+0003442669 00000 n 
+0003442730 00000 n 
+0003442851 00000 n 
+0003442911 00000 n 
+0003443033 00000 n 
+0003443094 00000 n 
+0003443216 00000 n 
+0003443277 00000 n 
+0003443399 00000 n 
+0003446325 00000 n 
+0003447525 00000 n 
+0003446176 00000 n 
+0003443655 00000 n 
+0003446491 00000 n 
+0003446551 00000 n 
+0003446673 00000 n 
+0003446734 00000 n 
+0003446856 00000 n 
+0003446917 00000 n 
+0003447039 00000 n 
+0003447100 00000 n 
+0003447222 00000 n 
+0003447283 00000 n 
+0003447343 00000 n 
+0003447465 00000 n 
+0003450845 00000 n 
+0003451630 00000 n 
+0003450696 00000 n 
+0003447707 00000 n 
+0003451011 00000 n 
+0003451071 00000 n 
+0003451132 00000 n 
+0003451259 00000 n 
+0003451320 00000 n 
+0003451381 00000 n 
+0003451508 00000 n 
+0003451569 00000 n 
+0004469851 00000 n 
+0003454856 00000 n 
+0003455039 00000 n 
+0003455204 00000 n 
+0003456231 00000 n 
+0003454687 00000 n 
+0003451812 00000 n 
+0003455370 00000 n 
+0003455430 00000 n 
+0003455557 00000 n 
+0003455618 00000 n 
+0003455679 00000 n 
+0003455806 00000 n 
+0003455867 00000 n 
+0003455989 00000 n 
+0003456050 00000 n 
+0003456171 00000 n 
+0003459424 00000 n 
+0003460447 00000 n 
+0003459275 00000 n 
+0003456425 00000 n 
+0003459590 00000 n 
+0003459650 00000 n 
+0003459777 00000 n 
+0003459838 00000 n 
+0003459899 00000 n 
+0003460020 00000 n 
+0003460081 00000 n 
+0003460203 00000 n 
+0003460264 00000 n 
+0003460386 00000 n 
+0003463030 00000 n 
+0003464049 00000 n 
+0003462881 00000 n 
+0003460629 00000 n 
+0003463196 00000 n 
+0003463256 00000 n 
+0003463317 00000 n 
+0003463439 00000 n 
+0003463500 00000 n 
+0003463561 00000 n 
+0003463683 00000 n 
+0003463744 00000 n 
+0003463805 00000 n 
+0003463927 00000 n 
+0003463988 00000 n 
+0003466873 00000 n 
+0003467829 00000 n 
+0003466724 00000 n 
+0003464231 00000 n 
+0003467039 00000 n 
+0003467099 00000 n 
+0003467221 00000 n 
+0003467282 00000 n 
+0003467343 00000 n 
+0003467464 00000 n 
+0003467525 00000 n 
+0003467586 00000 n 
+0003467708 00000 n 
+0003467769 00000 n 
+0003470942 00000 n 
+0003472022 00000 n 
+0003470793 00000 n 
+0003468011 00000 n 
+0003471108 00000 n 
+0003471229 00000 n 
+0003471290 00000 n 
+0003471412 00000 n 
+0003471473 00000 n 
+0003471534 00000 n 
+0003471656 00000 n 
+0003471717 00000 n 
+0003471778 00000 n 
+0003471900 00000 n 
+0003471961 00000 n 
+0003475582 00000 n 
+0003479432 00000 n 
+0003475747 00000 n 
+0003476774 00000 n 
+0003475423 00000 n 
+0003472217 00000 n 
+0003475913 00000 n 
+0003475973 00000 n 
+0003476100 00000 n 
+0003476161 00000 n 
+0003476222 00000 n 
+0003476349 00000 n 
+0003476410 00000 n 
+0003476532 00000 n 
+0003476592 00000 n 
+0003476653 00000 n 
+0004469984 00000 n 
+0003479598 00000 n 
+0003479784 00000 n 
+0003479963 00000 n 
+0003484864 00000 n 
+0003480143 00000 n 
+0003481402 00000 n 
+0003479243 00000 n 
+0003476969 00000 n 
+0003480309 00000 n 
+0003480369 00000 n 
+0003480430 00000 n 
+0003480491 00000 n 
+0003480613 00000 n 
+0003480674 00000 n 
+0003480796 00000 n 
+0003480857 00000 n 
+0003480977 00000 n 
+0003481038 00000 n 
+0003481160 00000 n 
+0003481221 00000 n 
+0003481342 00000 n 
+0003485044 00000 n 
+0003485215 00000 n 
+0003485395 00000 n 
+0003486173 00000 n 
+0003484685 00000 n 
+0003481584 00000 n 
+0003485561 00000 n 
+0003485621 00000 n 
+0003485682 00000 n 
+0003485804 00000 n 
+0003485865 00000 n 
+0003485926 00000 n 
+0003486052 00000 n 
+0003486113 00000 n 
+0003489508 00000 n 
+0003489685 00000 n 
+0003490069 00000 n 
+0003490247 00000 n 
+0003490631 00000 n 
+0003490808 00000 n 
+0003491704 00000 n 
+0003489289 00000 n 
+0003486368 00000 n 
+0003490974 00000 n 
+0003491034 00000 n 
+0003491156 00000 n 
+0003491217 00000 n 
+0003491278 00000 n 
+0003489877 00000 n 
+0003491400 00000 n 
+0003491461 00000 n 
+0003491522 00000 n 
+0003490439 00000 n 
+0003491644 00000 n 
+0003495158 00000 n 
+0003495349 00000 n 
+0003495528 00000 n 
+0003495717 00000 n 
+0003501245 00000 n 
+0003495905 00000 n 
+0003496861 00000 n 
+0003494969 00000 n 
+0003491936 00000 n 
+0003496071 00000 n 
+0003496131 00000 n 
+0003496192 00000 n 
+0003496314 00000 n 
+0003496375 00000 n 
+0003496436 00000 n 
+0003496558 00000 n 
+0003496619 00000 n 
+0003496680 00000 n 
+0003496801 00000 n 
+0003501434 00000 n 
+0003501605 00000 n 
+0003501771 00000 n 
+0003501956 00000 n 
+0003502123 00000 n 
+0003502836 00000 n 
+0003501046 00000 n 
+0003497093 00000 n 
+0003502289 00000 n 
+0003502349 00000 n 
+0003502410 00000 n 
+0003502531 00000 n 
+0003502592 00000 n 
+0003502714 00000 n 
+0003502775 00000 n 
+0003505975 00000 n 
+0003506140 00000 n 
+0003506309 00000 n 
+0003507142 00000 n 
+0003505806 00000 n 
+0003503055 00000 n 
+0003506475 00000 n 
+0003506535 00000 n 
+0003506656 00000 n 
+0003506717 00000 n 
+0003506838 00000 n 
+0003506899 00000 n 
+0003507020 00000 n 
+0003507081 00000 n 
+0004470117 00000 n 
+0003510117 00000 n 
+0003510287 00000 n 
+0003510618 00000 n 
+0003510789 00000 n 
+0003510961 00000 n 
+0003511126 00000 n 
+0003511297 00000 n 
+0003511460 00000 n 
+0003511631 00000 n 
+0003512588 00000 n 
+0003509878 00000 n 
+0003507324 00000 n 
+0003511797 00000 n 
+0003511857 00000 n 
+0003511979 00000 n 
+0003510453 00000 n 
+0003512040 00000 n 
+0003512101 00000 n 
+0003512223 00000 n 
+0003512284 00000 n 
+0003512345 00000 n 
+0003512466 00000 n 
+0003512527 00000 n 
+0003515783 00000 n 
+0003515955 00000 n 
+0003516280 00000 n 
+0003516451 00000 n 
+0003516623 00000 n 
+0003516784 00000 n 
+0003516955 00000 n 
+0003517174 00000 n 
+0003518192 00000 n 
+0003515554 00000 n 
+0003512770 00000 n 
+0003517340 00000 n 
+0003517400 00000 n 
+0003517522 00000 n 
+0003516118 00000 n 
+0003517583 00000 n 
+0003517644 00000 n 
+0003517766 00000 n 
+0003517827 00000 n 
+0003517888 00000 n 
+0003518009 00000 n 
+0003518070 00000 n 
+0003518131 00000 n 
+0003521509 00000 n 
+0003521731 00000 n 
+0003521905 00000 n 
+0003522127 00000 n 
+0003522313 00000 n 
+0003522498 00000 n 
+0003523395 00000 n 
+0003521310 00000 n 
+0003518374 00000 n 
+0003522664 00000 n 
+0003522785 00000 n 
+0003522846 00000 n 
+0003522907 00000 n 
+0003523029 00000 n 
+0003523090 00000 n 
+0003523212 00000 n 
+0003523273 00000 n 
+0003523334 00000 n 
+0003526779 00000 n 
+0003526972 00000 n 
+0003527177 00000 n 
+0003527381 00000 n 
+0003527586 00000 n 
+0003527778 00000 n 
+0003528557 00000 n 
+0003526580 00000 n 
+0003523639 00000 n 
+0003527944 00000 n 
+0003528065 00000 n 
+0003528126 00000 n 
+0003528248 00000 n 
+0003528308 00000 n 
+0003528435 00000 n 
+0003528496 00000 n 
+0003532474 00000 n 
+0003532696 00000 n 
+0003532868 00000 n 
+0003533054 00000 n 
+0003533427 00000 n 
+0003533599 00000 n 
+0003534631 00000 n 
+0003532265 00000 n 
+0003528764 00000 n 
+0003533765 00000 n 
+0003533825 00000 n 
+0003533951 00000 n 
+0003534012 00000 n 
+0003534073 00000 n 
+0003533240 00000 n 
+0003534200 00000 n 
+0003534261 00000 n 
+0003534383 00000 n 
+0003534509 00000 n 
+0003534570 00000 n 
+0003538488 00000 n 
+0003538685 00000 n 
+0003539469 00000 n 
+0003538329 00000 n 
+0003534838 00000 n 
+0003538851 00000 n 
+0003538972 00000 n 
+0003539033 00000 n 
+0003539159 00000 n 
+0003539220 00000 n 
+0003539347 00000 n 
+0003539408 00000 n 
+0004470250 00000 n 
+0003542250 00000 n 
+0003542468 00000 n 
+0003542686 00000 n 
+0003546721 00000 n 
+0003546941 00000 n 
+0003542871 00000 n 
+0003543953 00000 n 
+0003542071 00000 n 
+0003539664 00000 n 
+0003543037 00000 n 
+0003543097 00000 n 
+0003543217 00000 n 
+0003543342 00000 n 
+0003543464 00000 n 
+0003543591 00000 n 
+0003543651 00000 n 
+0003543712 00000 n 
+0003543892 00000 n 
+0003583413 00000 n 
+0003583535 00000 n 
+0003547162 00000 n 
+0003547349 00000 n 
+0003547569 00000 n 
+0003547789 00000 n 
+0003548010 00000 n 
+0003548230 00000 n 
+0003548451 00000 n 
+0003548672 00000 n 
+0003548893 00000 n 
+0003549114 00000 n 
+0003549301 00000 n 
+0003549522 00000 n 
+0003549742 00000 n 
+0003549963 00000 n 
+0003550149 00000 n 
+0003550369 00000 n 
+0003550590 00000 n 
+0003550796 00000 n 
+0003551015 00000 n 
+0003551221 00000 n 
+0003551440 00000 n 
+0003551661 00000 n 
+0003551880 00000 n 
+0003552101 00000 n 
+0003556414 00000 n 
+0003556635 00000 n 
+0003556856 00000 n 
+0003557075 00000 n 
+0003557294 00000 n 
+0003557515 00000 n 
+0003552321 00000 n 
+0003553519 00000 n 
+0003546312 00000 n 
+0003544149 00000 n 
+0003552487 00000 n 
+0003552547 00000 n 
+0003552608 00000 n 
+0003552669 00000 n 
+0003552730 00000 n 
+0003552791 00000 n 
+0003552852 00000 n 
+0003552913 00000 n 
+0003552974 00000 n 
+0003553035 00000 n 
+0003553096 00000 n 
+0003553155 00000 n 
+0003553215 00000 n 
+0003553276 00000 n 
+0003553336 00000 n 
+0003553397 00000 n 
+0003553458 00000 n 
+0003583723 00000 n 
+0003557736 00000 n 
+0003557957 00000 n 
+0003558178 00000 n 
+0003558398 00000 n 
+0003558618 00000 n 
+0003558839 00000 n 
+0003559060 00000 n 
+0003559281 00000 n 
+0003559502 00000 n 
+0003559722 00000 n 
+0003559941 00000 n 
+0003560160 00000 n 
+0003560381 00000 n 
+0003560602 00000 n 
+0003560823 00000 n 
+0003561041 00000 n 
+0003561261 00000 n 
+0003561481 00000 n 
+0003561700 00000 n 
+0003561887 00000 n 
+0003562106 00000 n 
+0003562292 00000 n 
+0003562511 00000 n 
+0003562698 00000 n 
+0003562917 00000 n 
+0003563104 00000 n 
+0003563322 00000 n 
+0003563507 00000 n 
+0003563727 00000 n 
+0003563912 00000 n 
+0003564129 00000 n 
+0003564313 00000 n 
+0003564532 00000 n 
+0003564752 00000 n 
+0003564972 00000 n 
+0003565192 00000 n 
+0003566634 00000 n 
+0003555855 00000 n 
+0003553728 00000 n 
+0003565358 00000 n 
+0003565418 00000 n 
+0003565479 00000 n 
+0003565540 00000 n 
+0003565601 00000 n 
+0003565661 00000 n 
+0003565722 00000 n 
+0003565783 00000 n 
+0003565844 00000 n 
+0003565905 00000 n 
+0003565965 00000 n 
+0003566026 00000 n 
+0003566086 00000 n 
+0003566147 00000 n 
+0003566208 00000 n 
+0003566269 00000 n 
+0003566330 00000 n 
+0003566391 00000 n 
+0003566452 00000 n 
+0003566513 00000 n 
+0003566574 00000 n 
+0003583843 00000 n 
+0003583969 00000 n 
+0003569991 00000 n 
+0003570212 00000 n 
+0003570433 00000 n 
+0003570653 00000 n 
+0003570874 00000 n 
+0003571095 00000 n 
+0003571316 00000 n 
+0003571536 00000 n 
+0003571757 00000 n 
+0003571943 00000 n 
+0003572162 00000 n 
+0003572382 00000 n 
+0003572603 00000 n 
+0003572824 00000 n 
+0003573011 00000 n 
+0003573232 00000 n 
+0003573419 00000 n 
+0003573736 00000 n 
+0003573922 00000 n 
+0003574694 00000 n 
+0003569652 00000 n 
+0003566830 00000 n 
+0003574088 00000 n 
+0003574148 00000 n 
+0003574209 00000 n 
+0003574270 00000 n 
+0003574331 00000 n 
+0003574391 00000 n 
+0003574451 00000 n 
+0003574512 00000 n 
+0003574573 00000 n 
+0003574634 00000 n 
+0003573578 00000 n 
+0003584157 00000 n 
+0003584279 00000 n 
+0003587532 00000 n 
+0003587719 00000 n 
+0003576647 00000 n 
+0003576852 00000 n 
+0003577069 00000 n 
+0003577288 00000 n 
+0003577509 00000 n 
+0003577729 00000 n 
+0003577949 00000 n 
+0003578170 00000 n 
+0003578391 00000 n 
+0003578611 00000 n 
+0003578837 00000 n 
+0003576408 00000 n 
+0003574904 00000 n 
+0003578777 00000 n 
+0003582280 00000 n 
+0003582467 00000 n 
+0003582686 00000 n 
+0003583126 00000 n 
+0003584404 00000 n 
+0003582091 00000 n 
+0003578965 00000 n 
+0003583292 00000 n 
+0003583352 00000 n 
+0003583474 00000 n 
+0003583601 00000 n 
+0003582906 00000 n 
+0003583662 00000 n 
+0003583783 00000 n 
+0003583908 00000 n 
+0003584035 00000 n 
+0003584096 00000 n 
+0003584218 00000 n 
+0003584344 00000 n 
+0004470383 00000 n 
+0003587306 00000 n 
+0003588200 00000 n 
+0003587157 00000 n 
+0003584599 00000 n 
+0003587472 00000 n 
+0003587598 00000 n 
+0003587659 00000 n 
+0003587780 00000 n 
+0003587841 00000 n 
+0003588021 00000 n 
+0003591158 00000 n 
+0003591397 00000 n 
+0003591638 00000 n 
+0003591878 00000 n 
+0003592083 00000 n 
+0003593035 00000 n 
+0003590969 00000 n 
+0003588396 00000 n 
+0003592249 00000 n 
+0003592309 00000 n 
+0003592370 00000 n 
+0003592549 00000 n 
+0003592609 00000 n 
+0003592669 00000 n 
+0003592730 00000 n 
+0003592791 00000 n 
+0003592852 00000 n 
+0003592913 00000 n 
+0003592974 00000 n 
+0003595855 00000 n 
+0003596082 00000 n 
+0003596311 00000 n 
+0003596534 00000 n 
+0003596740 00000 n 
+0003597694 00000 n 
+0003595666 00000 n 
+0003593244 00000 n 
+0003596906 00000 n 
+0003596966 00000 n 
+0003597146 00000 n 
+0003597207 00000 n 
+0003597268 00000 n 
+0003597329 00000 n 
+0003597390 00000 n 
+0003597450 00000 n 
+0003597511 00000 n 
+0003597572 00000 n 
+0003597633 00000 n 
+0003599838 00000 n 
+0003604209 00000 n 
+0003604278 00000 n 
+0003604483 00000 n 
+0003604723 00000 n 
+0003604968 00000 n 
+0003605173 00000 n 
+0003605378 00000 n 
+0003605617 00000 n 
+0003605860 00000 n 
+0003606065 00000 n 
+0003606270 00000 n 
+0003606510 00000 n 
+0003606755 00000 n 
+0003606961 00000 n 
+0003607166 00000 n 
+0003607405 00000 n 
+0003607649 00000 n 
+0003607855 00000 n 
+0003608060 00000 n 
+0003608299 00000 n 
+0003608543 00000 n 
+0003613085 00000 n 
+0003613329 00000 n 
+0003613569 00000 n 
+0003613809 00000 n 
+0003608746 00000 n 
+0003609457 00000 n 
+0003599472 00000 n 
+0003597919 00000 n 
+0003608912 00000 n 
+0003609091 00000 n 
+0003609152 00000 n 
+0003609213 00000 n 
+0003609274 00000 n 
+0003609335 00000 n 
+0003609396 00000 n 
+0003600735 00000 n 
+0003600867 00000 n 
+0003601020 00000 n 
+0003601350 00000 n 
+0003601794 00000 n 
+0003602034 00000 n 
+0003602057 00000 n 
+0003604185 00000 n 
+0003614049 00000 n 
+0003614294 00000 n 
+0003614505 00000 n 
+0003614750 00000 n 
+0003614956 00000 n 
+0003615161 00000 n 
+0003615406 00000 n 
+0003615881 00000 n 
+0003616355 00000 n 
+0003617008 00000 n 
+0003612796 00000 n 
+0003609668 00000 n 
+0003616521 00000 n 
+0003616581 00000 n 
+0003616642 00000 n 
+0003616703 00000 n 
+0003616764 00000 n 
+0003616825 00000 n 
+0003616886 00000 n 
+0003616947 00000 n 
+0003615644 00000 n 
+0003616119 00000 n 
+0003620251 00000 n 
+0003620490 00000 n 
+0003621377 00000 n 
+0003620092 00000 n 
+0003617321 00000 n 
+0003620656 00000 n 
+0003620716 00000 n 
+0003620837 00000 n 
+0003620898 00000 n 
+0003621077 00000 n 
+0003621138 00000 n 
+0003621199 00000 n 
+0004470516 00000 n 
+0003623660 00000 n 
+0003623881 00000 n 
+0003624103 00000 n 
+0003624349 00000 n 
+0003624595 00000 n 
+0003624841 00000 n 
+0003625088 00000 n 
+0003625335 00000 n 
+0003625581 00000 n 
+0003625793 00000 n 
+0003626039 00000 n 
+0003626252 00000 n 
+0003626464 00000 n 
+0003626710 00000 n 
+0003626923 00000 n 
+0003627169 00000 n 
+0003628307 00000 n 
+0003623361 00000 n 
+0003621586 00000 n 
+0003627335 00000 n 
+0003627395 00000 n 
+0003627456 00000 n 
+0003627517 00000 n 
+0003627578 00000 n 
+0003627758 00000 n 
+0003627819 00000 n 
+0003627880 00000 n 
+0003627941 00000 n 
+0003628002 00000 n 
+0003628063 00000 n 
+0003628124 00000 n 
+0003628185 00000 n 
+0003628246 00000 n 
+0003630323 00000 n 
+0003630535 00000 n 
+0003630771 00000 n 
+0003630970 00000 n 
+0003631205 00000 n 
+0003632214 00000 n 
+0003630134 00000 n 
+0003628516 00000 n 
+0003631371 00000 n 
+0003631431 00000 n 
+0003631611 00000 n 
+0003631791 00000 n 
+0003631852 00000 n 
+0003631913 00000 n 
+0003631974 00000 n 
+0003632035 00000 n 
+0003634522 00000 n 
+0003634720 00000 n 
+0003634941 00000 n 
+0003635128 00000 n 
+0003635348 00000 n 
+0003635554 00000 n 
+0003635759 00000 n 
+0003635980 00000 n 
+0003636185 00000 n 
+0003636406 00000 n 
+0003636611 00000 n 
+0003636832 00000 n 
+0003637037 00000 n 
+0003637258 00000 n 
+0003637479 00000 n 
+0003637699 00000 n 
+0003637885 00000 n 
+0003638091 00000 n 
+0003638312 00000 n 
+0003638498 00000 n 
+0003638719 00000 n 
+0003638906 00000 n 
+0003639127 00000 n 
+0003639348 00000 n 
+0003639535 00000 n 
+0003639756 00000 n 
+0003639977 00000 n 
+0003640198 00000 n 
+0003640385 00000 n 
+0003640606 00000 n 
+0003640793 00000 n 
+0003640980 00000 n 
+0003641199 00000 n 
+0003641384 00000 n 
+0003641569 00000 n 
+0003641786 00000 n 
+0003641969 00000 n 
+0003642151 00000 n 
+0003643290 00000 n 
+0003634003 00000 n 
+0003632437 00000 n 
+0003642317 00000 n 
+0003642377 00000 n 
+0003642438 00000 n 
+0003642499 00000 n 
+0003642560 00000 n 
+0003642621 00000 n 
+0003642682 00000 n 
+0003642743 00000 n 
+0003642804 00000 n 
+0003642865 00000 n 
+0003642926 00000 n 
+0003642987 00000 n 
+0003643048 00000 n 
+0003643169 00000 n 
+0003643230 00000 n 
+0003648193 00000 n 
+0003648437 00000 n 
+0003648620 00000 n 
+0003648742 00000 n 
+0003648864 00000 n 
+0003648986 00000 n 
+0003646371 00000 n 
+0003646558 00000 n 
+0003646745 00000 n 
+0003646965 00000 n 
+0003647185 00000 n 
+0003647405 00000 n 
+0003647626 00000 n 
+0003647845 00000 n 
+0003649108 00000 n 
+0003646152 00000 n 
+0003643499 00000 n 
+0003648011 00000 n 
+0003648071 00000 n 
+0003648132 00000 n 
+0003648254 00000 n 
+0003648315 00000 n 
+0003648376 00000 n 
+0003648498 00000 n 
+0003648559 00000 n 
+0003648681 00000 n 
+0003648803 00000 n 
+0003648925 00000 n 
+0003649047 00000 n 
+0003655520 00000 n 
+0003651180 00000 n 
+0003655451 00000 n 
+0003655707 00000 n 
+0003655912 00000 n 
+0003656151 00000 n 
+0003656400 00000 n 
+0003656605 00000 n 
+0003656810 00000 n 
+0003657050 00000 n 
+0003657299 00000 n 
+0003657504 00000 n 
+0003657709 00000 n 
+0003657949 00000 n 
+0003658199 00000 n 
+0003658405 00000 n 
+0003658610 00000 n 
+0003658850 00000 n 
+0003659100 00000 n 
+0003659306 00000 n 
+0003659511 00000 n 
+0003659750 00000 n 
+0003659999 00000 n 
+0003664271 00000 n 
+0003664520 00000 n 
+0003664760 00000 n 
+0003665000 00000 n 
+0003660202 00000 n 
+0003660912 00000 n 
+0003650804 00000 n 
+0003649316 00000 n 
+0003660368 00000 n 
+0003660547 00000 n 
+0003660608 00000 n 
+0003660669 00000 n 
+0003660729 00000 n 
+0003660790 00000 n 
+0003660851 00000 n 
+0003652130 00000 n 
+0003652262 00000 n 
+0003652415 00000 n 
+0003652741 00000 n 
+0003653179 00000 n 
+0003653419 00000 n 
+0003653442 00000 n 
+0003655427 00000 n 
+0003665239 00000 n 
+0003665487 00000 n 
+0003665726 00000 n 
+0003665965 00000 n 
+0003666215 00000 n 
+0003666430 00000 n 
+0003666680 00000 n 
+0003666886 00000 n 
+0003667136 00000 n 
+0003667323 00000 n 
+0003668158 00000 n 
+0003663992 00000 n 
+0003661123 00000 n 
+0003667489 00000 n 
+0003667549 00000 n 
+0003667610 00000 n 
+0003667671 00000 n 
+0003667732 00000 n 
+0003667793 00000 n 
+0003667854 00000 n 
+0003667915 00000 n 
+0003667976 00000 n 
+0003668097 00000 n 
+0004470649 00000 n 
+0003673581 00000 n 
+0003671389 00000 n 
+0003671629 00000 n 
+0003671855 00000 n 
+0003672080 00000 n 
+0003672266 00000 n 
+0003672492 00000 n 
+0003672679 00000 n 
+0003672866 00000 n 
+0003673069 00000 n 
+0003676742 00000 n 
+0003676969 00000 n 
+0003673294 00000 n 
+0003674124 00000 n 
+0003671150 00000 n 
+0003668433 00000 n 
+0003673460 00000 n 
+0003673520 00000 n 
+0003673642 00000 n 
+0003673703 00000 n 
+0003673881 00000 n 
+0003673942 00000 n 
+0003674003 00000 n 
+0003674064 00000 n 
+0003681444 00000 n 
+0003677155 00000 n 
+0003677382 00000 n 
+0003677609 00000 n 
+0003677814 00000 n 
+0003678041 00000 n 
+0003678246 00000 n 
+0003678473 00000 n 
+0003678700 00000 n 
+0003678927 00000 n 
+0003679153 00000 n 
+0003679380 00000 n 
+0003679586 00000 n 
+0003679813 00000 n 
+0003680005 00000 n 
+0003680232 00000 n 
+0003680425 00000 n 
+0003681566 00000 n 
+0003676423 00000 n 
+0003674334 00000 n 
+0003680591 00000 n 
+0003680651 00000 n 
+0003680712 00000 n 
+0003680773 00000 n 
+0003680834 00000 n 
+0003680895 00000 n 
+0003680956 00000 n 
+0003681017 00000 n 
+0003681078 00000 n 
+0003681139 00000 n 
+0003681200 00000 n 
+0003681261 00000 n 
+0003681322 00000 n 
+0003681383 00000 n 
+0003681505 00000 n 
+0003684528 00000 n 
+0003683361 00000 n 
+0003683581 00000 n 
+0003683800 00000 n 
+0003684021 00000 n 
+0003684241 00000 n 
+0003685194 00000 n 
+0003683172 00000 n 
+0003681791 00000 n 
+0003684407 00000 n 
+0003684467 00000 n 
+0003684589 00000 n 
+0003684769 00000 n 
+0003684830 00000 n 
+0003684891 00000 n 
+0003684952 00000 n 
+0003685013 00000 n 
+0003685074 00000 n 
+0003687405 00000 n 
+0003687556 00000 n 
+0003687707 00000 n 
+0003687860 00000 n 
+0003688013 00000 n 
+0003688166 00000 n 
+0003688317 00000 n 
+0003688470 00000 n 
+0003688622 00000 n 
+0003688772 00000 n 
+0003688925 00000 n 
+0003689077 00000 n 
+0003689230 00000 n 
+0003689381 00000 n 
+0003689534 00000 n 
+0003689686 00000 n 
+0003689838 00000 n 
+0003689991 00000 n 
+0003690143 00000 n 
+0003690296 00000 n 
+0003690447 00000 n 
+0003690600 00000 n 
+0003690753 00000 n 
+0003690905 00000 n 
+0003691057 00000 n 
+0003691209 00000 n 
+0003691362 00000 n 
+0003691514 00000 n 
+0003691667 00000 n 
+0003691818 00000 n 
+0003691971 00000 n 
+0003692124 00000 n 
+0003692276 00000 n 
+0003692425 00000 n 
+0003692576 00000 n 
+0003692729 00000 n 
+0003692882 00000 n 
+0003693035 00000 n 
+0003693188 00000 n 
+0003693341 00000 n 
+0003693493 00000 n 
+0003693646 00000 n 
+0003693799 00000 n 
+0003693952 00000 n 
+0003694104 00000 n 
+0003694256 00000 n 
+0003694409 00000 n 
+0003694562 00000 n 
+0003694715 00000 n 
+0003694868 00000 n 
+0003695021 00000 n 
+0003695174 00000 n 
+0003695327 00000 n 
+0003695480 00000 n 
+0003695633 00000 n 
+0003695786 00000 n 
+0003695939 00000 n 
+0003696092 00000 n 
+0003696245 00000 n 
+0003696397 00000 n 
+0003696549 00000 n 
+0003696702 00000 n 
+0003696855 00000 n 
+0003697008 00000 n 
+0003697159 00000 n 
+0003699818 00000 n 
+0003697310 00000 n 
+0003697597 00000 n 
+0003686606 00000 n 
+0003685404 00000 n 
+0003697476 00000 n 
+0003697536 00000 n 
+0003699970 00000 n 
+0003700123 00000 n 
+0003700275 00000 n 
+0003700427 00000 n 
+0003700578 00000 n 
+0003700730 00000 n 
+0003700882 00000 n 
+0003701034 00000 n 
+0003701186 00000 n 
+0003701339 00000 n 
+0003701492 00000 n 
+0003701645 00000 n 
+0003701798 00000 n 
+0003701949 00000 n 
+0003702101 00000 n 
+0003702253 00000 n 
+0003702406 00000 n 
+0003702557 00000 n 
+0003702710 00000 n 
+0003702862 00000 n 
+0003703014 00000 n 
+0003703167 00000 n 
+0003703319 00000 n 
+0003703472 00000 n 
+0003703622 00000 n 
+0003703775 00000 n 
+0003703926 00000 n 
+0003704078 00000 n 
+0003704231 00000 n 
+0003704382 00000 n 
+0003704533 00000 n 
+0003704685 00000 n 
+0003704837 00000 n 
+0003704989 00000 n 
+0003705139 00000 n 
+0003705290 00000 n 
+0003705443 00000 n 
+0003705595 00000 n 
+0003705748 00000 n 
+0003705901 00000 n 
+0003706052 00000 n 
+0003706203 00000 n 
+0003706354 00000 n 
+0003706505 00000 n 
+0003706656 00000 n 
+0003706809 00000 n 
+0003706958 00000 n 
+0003707111 00000 n 
+0003707264 00000 n 
+0003707416 00000 n 
+0003707569 00000 n 
+0003707720 00000 n 
+0003707873 00000 n 
+0003708026 00000 n 
+0003708178 00000 n 
+0003708329 00000 n 
+0003708480 00000 n 
+0003708629 00000 n 
+0003708780 00000 n 
+0003711790 00000 n 
+0003708931 00000 n 
+0003709157 00000 n 
+0003699069 00000 n 
+0003697725 00000 n 
+0003709097 00000 n 
+0004033445 00000 n 
+0003711943 00000 n 
+0003712095 00000 n 
+0003712246 00000 n 
+0003712399 00000 n 
+0003712551 00000 n 
+0003712704 00000 n 
+0003712855 00000 n 
+0003713008 00000 n 
+0003713160 00000 n 
+0003713312 00000 n 
+0003713465 00000 n 
+0003713616 00000 n 
+0003713768 00000 n 
+0003713920 00000 n 
+0003714071 00000 n 
+0003714223 00000 n 
+0003714374 00000 n 
+0003714527 00000 n 
+0003714679 00000 n 
+0003714830 00000 n 
+0003714983 00000 n 
+0003715135 00000 n 
+0003715288 00000 n 
+0003715439 00000 n 
+0003715592 00000 n 
+0003715744 00000 n 
+0003715896 00000 n 
+0003716049 00000 n 
+0003716199 00000 n 
+0003716350 00000 n 
+0003716502 00000 n 
+0003716653 00000 n 
+0003716804 00000 n 
+0003716954 00000 n 
+0003717103 00000 n 
+0003717255 00000 n 
+0003717406 00000 n 
+0003717557 00000 n 
+0003717709 00000 n 
+0003717860 00000 n 
+0003718011 00000 n 
+0003718161 00000 n 
+0003718312 00000 n 
+0003718463 00000 n 
+0003718615 00000 n 
+0003718767 00000 n 
+0003718918 00000 n 
+0003719070 00000 n 
+0003719220 00000 n 
+0003719372 00000 n 
+0003719523 00000 n 
+0003719675 00000 n 
+0003719826 00000 n 
+0003719976 00000 n 
+0003720128 00000 n 
+0003720280 00000 n 
+0003720432 00000 n 
+0003720583 00000 n 
+0003720735 00000 n 
+0003720886 00000 n 
+0003721038 00000 n 
+0003721190 00000 n 
+0003721342 00000 n 
+0003721491 00000 n 
+0003721643 00000 n 
+0003721795 00000 n 
+0003721947 00000 n 
+0003722099 00000 n 
+0003722250 00000 n 
+0003722402 00000 n 
+0003722553 00000 n 
+0003722705 00000 n 
+0003722856 00000 n 
+0003723008 00000 n 
+0003723160 00000 n 
+0003723312 00000 n 
+0003723464 00000 n 
+0003723614 00000 n 
+0003723766 00000 n 
+0003723917 00000 n 
+0003724069 00000 n 
+0003724220 00000 n 
+0003724372 00000 n 
+0003724524 00000 n 
+0003724675 00000 n 
+0003724827 00000 n 
+0003724978 00000 n 
+0003725128 00000 n 
+0003728163 00000 n 
+0003725277 00000 n 
+0003725503 00000 n 
+0003710751 00000 n 
+0003709285 00000 n 
+0003725443 00000 n 
+0004470782 00000 n 
+0004033411 00000 n 
+0003728315 00000 n 
+0003728467 00000 n 
+0003728619 00000 n 
+0003728771 00000 n 
+0003728922 00000 n 
+0003729074 00000 n 
+0003729225 00000 n 
+0003729376 00000 n 
+0003729526 00000 n 
+0003729678 00000 n 
+0003729830 00000 n 
+0003729982 00000 n 
+0003730134 00000 n 
+0003730286 00000 n 
+0003730438 00000 n 
+0003730589 00000 n 
+0003730741 00000 n 
+0003730893 00000 n 
+0003731045 00000 n 
+0003731197 00000 n 
+0003731349 00000 n 
+0003731501 00000 n 
+0003731653 00000 n 
+0003731804 00000 n 
+0003731955 00000 n 
+0003732107 00000 n 
+0003732258 00000 n 
+0003732410 00000 n 
+0003732560 00000 n 
+0003732712 00000 n 
+0003732864 00000 n 
+0003733016 00000 n 
+0003733167 00000 n 
+0003733318 00000 n 
+0003733470 00000 n 
+0003733621 00000 n 
+0003733773 00000 n 
+0003733923 00000 n 
+0003734074 00000 n 
+0003734226 00000 n 
+0003734377 00000 n 
+0003734528 00000 n 
+0003734679 00000 n 
+0003734831 00000 n 
+0003734983 00000 n 
+0003735134 00000 n 
+0003735286 00000 n 
+0003735438 00000 n 
+0003735590 00000 n 
+0003735742 00000 n 
+0003735894 00000 n 
+0003736045 00000 n 
+0003736194 00000 n 
+0003736343 00000 n 
+0003736495 00000 n 
+0003736644 00000 n 
+0003736796 00000 n 
+0003736948 00000 n 
+0003737099 00000 n 
+0003737250 00000 n 
+0003737401 00000 n 
+0003737553 00000 n 
+0003737706 00000 n 
+0003737859 00000 n 
+0003738012 00000 n 
+0003738165 00000 n 
+0003738318 00000 n 
+0003738471 00000 n 
+0003738624 00000 n 
+0003738777 00000 n 
+0003738930 00000 n 
+0003739083 00000 n 
+0003739236 00000 n 
+0003739389 00000 n 
+0003739542 00000 n 
+0003739693 00000 n 
+0003739845 00000 n 
+0003739998 00000 n 
+0003740149 00000 n 
+0003740302 00000 n 
+0003740455 00000 n 
+0003740607 00000 n 
+0003740760 00000 n 
+0003740911 00000 n 
+0003741062 00000 n 
+0003741214 00000 n 
+0003741366 00000 n 
+0003744149 00000 n 
+0003741517 00000 n 
+0003741743 00000 n 
+0003727134 00000 n 
+0003725631 00000 n 
+0003741683 00000 n 
+0004033377 00000 n 
+0003744302 00000 n 
+0003744455 00000 n 
+0003744608 00000 n 
+0003744761 00000 n 
+0003744913 00000 n 
+0003745066 00000 n 
+0003745217 00000 n 
+0003745369 00000 n 
+0003745521 00000 n 
+0003745673 00000 n 
+0003745826 00000 n 
+0003745978 00000 n 
+0003746130 00000 n 
+0003746282 00000 n 
+0003746434 00000 n 
+0003746586 00000 n 
+0003746739 00000 n 
+0003746891 00000 n 
+0003747044 00000 n 
+0003747196 00000 n 
+0003747347 00000 n 
+0003747499 00000 n 
+0003747651 00000 n 
+0003747802 00000 n 
+0003747955 00000 n 
+0003748106 00000 n 
+0003748258 00000 n 
+0003748411 00000 n 
+0003748563 00000 n 
+0003748716 00000 n 
+0003748869 00000 n 
+0003749022 00000 n 
+0003749173 00000 n 
+0003749326 00000 n 
+0003749479 00000 n 
+0003749632 00000 n 
+0003749785 00000 n 
+0003749937 00000 n 
+0003750090 00000 n 
+0003750243 00000 n 
+0003750395 00000 n 
+0003750548 00000 n 
+0003750698 00000 n 
+0003750851 00000 n 
+0003751003 00000 n 
+0003751156 00000 n 
+0003751306 00000 n 
+0003751458 00000 n 
+0003751611 00000 n 
+0003751763 00000 n 
+0003751916 00000 n 
+0003752067 00000 n 
+0003752220 00000 n 
+0003752373 00000 n 
+0003752526 00000 n 
+0003752679 00000 n 
+0003752832 00000 n 
+0003752985 00000 n 
+0003753136 00000 n 
+0003753289 00000 n 
+0003753441 00000 n 
+0003753594 00000 n 
+0003753747 00000 n 
+0003753900 00000 n 
+0003754051 00000 n 
+0003754201 00000 n 
+0003757055 00000 n 
+0003754352 00000 n 
+0003754578 00000 n 
+0003743330 00000 n 
+0003741871 00000 n 
+0003754518 00000 n 
+0003757207 00000 n 
+0003757359 00000 n 
+0003757512 00000 n 
+0003757664 00000 n 
+0003757817 00000 n 
+0003757970 00000 n 
+0003758122 00000 n 
+0003758273 00000 n 
+0003758425 00000 n 
+0003758578 00000 n 
+0003758731 00000 n 
+0003758884 00000 n 
+0003759037 00000 n 
+0003759190 00000 n 
+0003759343 00000 n 
+0003759496 00000 n 
+0003759647 00000 n 
+0003759800 00000 n 
+0003759952 00000 n 
+0003760104 00000 n 
+0003760257 00000 n 
+0003760408 00000 n 
+0003760561 00000 n 
+0003760712 00000 n 
+0003760865 00000 n 
+0003761018 00000 n 
+0003761170 00000 n 
+0003761322 00000 n 
+0003761475 00000 n 
+0003761626 00000 n 
+0003761779 00000 n 
+0003761928 00000 n 
+0003762077 00000 n 
+0003762230 00000 n 
+0003762383 00000 n 
+0003762533 00000 n 
+0003762686 00000 n 
+0003762839 00000 n 
+0003762991 00000 n 
+0003763144 00000 n 
+0003763297 00000 n 
+0003763448 00000 n 
+0003763599 00000 n 
+0003763752 00000 n 
+0003763905 00000 n 
+0003764058 00000 n 
+0003764211 00000 n 
+0003764364 00000 n 
+0003764517 00000 n 
+0003764670 00000 n 
+0003764822 00000 n 
+0003764975 00000 n 
+0003765128 00000 n 
+0003765281 00000 n 
+0003765434 00000 n 
+0003765587 00000 n 
+0003765738 00000 n 
+0003765891 00000 n 
+0003766044 00000 n 
+0003766197 00000 n 
+0003766350 00000 n 
+0003766502 00000 n 
+0003766655 00000 n 
+0003766808 00000 n 
+0003766960 00000 n 
+0003767112 00000 n 
+0003767265 00000 n 
+0003767418 00000 n 
+0003767571 00000 n 
+0003767724 00000 n 
+0003767877 00000 n 
+0003768030 00000 n 
+0003768181 00000 n 
+0003768407 00000 n 
+0003756176 00000 n 
+0003754706 00000 n 
+0003768347 00000 n 
+0003770711 00000 n 
+0003770864 00000 n 
+0003771017 00000 n 
+0003771170 00000 n 
+0003771319 00000 n 
+0003771471 00000 n 
+0003771624 00000 n 
+0003771774 00000 n 
+0003771927 00000 n 
+0003772080 00000 n 
+0003772232 00000 n 
+0003772385 00000 n 
+0003772538 00000 n 
+0003772691 00000 n 
+0003772843 00000 n 
+0003772996 00000 n 
+0003773148 00000 n 
+0003773300 00000 n 
+0003773452 00000 n 
+0003773603 00000 n 
+0003773756 00000 n 
+0003773907 00000 n 
+0003774060 00000 n 
+0003774211 00000 n 
+0003774364 00000 n 
+0003774516 00000 n 
+0003774668 00000 n 
+0003774821 00000 n 
+0003774973 00000 n 
+0003775122 00000 n 
+0003775273 00000 n 
+0003775424 00000 n 
+0003775574 00000 n 
+0003775724 00000 n 
+0003775874 00000 n 
+0003776025 00000 n 
+0003776178 00000 n 
+0003776331 00000 n 
+0003776484 00000 n 
+0003776637 00000 n 
+0003776790 00000 n 
+0003776943 00000 n 
+0003777096 00000 n 
+0003777249 00000 n 
+0003777402 00000 n 
+0003777555 00000 n 
+0003777708 00000 n 
+0003777861 00000 n 
+0003778014 00000 n 
+0003778166 00000 n 
+0003778319 00000 n 
+0003778470 00000 n 
+0003778622 00000 n 
+0003778774 00000 n 
+0003778927 00000 n 
+0003779079 00000 n 
+0003779232 00000 n 
+0003779385 00000 n 
+0003779538 00000 n 
+0003779691 00000 n 
+0003779842 00000 n 
+0003782485 00000 n 
+0003779993 00000 n 
+0003780219 00000 n 
+0003769952 00000 n 
+0003768535 00000 n 
+0003780159 00000 n 
+0004033343 00000 n 
+0003782638 00000 n 
+0003782791 00000 n 
+0003782944 00000 n 
+0003783097 00000 n 
+0003783250 00000 n 
+0003783402 00000 n 
+0003783554 00000 n 
+0003783707 00000 n 
+0003783860 00000 n 
+0003784013 00000 n 
+0003784165 00000 n 
+0003784317 00000 n 
+0003784470 00000 n 
+0003784623 00000 n 
+0003784776 00000 n 
+0003784929 00000 n 
+0003785081 00000 n 
+0003785232 00000 n 
+0003785384 00000 n 
+0003785537 00000 n 
+0003785690 00000 n 
+0003785844 00000 n 
+0003785997 00000 n 
+0003786150 00000 n 
+0003786303 00000 n 
+0003786455 00000 n 
+0003786607 00000 n 
+0003786760 00000 n 
+0003786911 00000 n 
+0003787063 00000 n 
+0003787216 00000 n 
+0003787367 00000 n 
+0003787518 00000 n 
+0003787671 00000 n 
+0003787823 00000 n 
+0003787976 00000 n 
+0003788128 00000 n 
+0003788281 00000 n 
+0003788434 00000 n 
+0003788587 00000 n 
+0003788740 00000 n 
+0003788893 00000 n 
+0003789046 00000 n 
+0003789199 00000 n 
+0003789352 00000 n 
+0003789504 00000 n 
+0003789655 00000 n 
+0003789807 00000 n 
+0003789960 00000 n 
+0003790112 00000 n 
+0003790263 00000 n 
+0003790416 00000 n 
+0003790569 00000 n 
+0003790722 00000 n 
+0003790873 00000 n 
+0003791023 00000 n 
+0003791174 00000 n 
+0003793984 00000 n 
+0003791325 00000 n 
+0003791551 00000 n 
+0003781756 00000 n 
+0003780347 00000 n 
+0003791491 00000 n 
+0004033309 00000 n 
+0003794137 00000 n 
+0003794289 00000 n 
+0003794441 00000 n 
+0003794594 00000 n 
+0003794746 00000 n 
+0003794899 00000 n 
+0003795050 00000 n 
+0003795202 00000 n 
+0003795354 00000 n 
+0003795506 00000 n 
+0003795659 00000 n 
+0003795811 00000 n 
+0003795964 00000 n 
+0003796115 00000 n 
+0003796268 00000 n 
+0003796420 00000 n 
+0003796572 00000 n 
+0003796725 00000 n 
+0003796877 00000 n 
+0003797028 00000 n 
+0003797180 00000 n 
+0003797333 00000 n 
+0003797484 00000 n 
+0003797637 00000 n 
+0003797788 00000 n 
+0003797939 00000 n 
+0003798091 00000 n 
+0003798244 00000 n 
+0003798396 00000 n 
+0003798547 00000 n 
+0003798700 00000 n 
+0003798852 00000 n 
+0003799005 00000 n 
+0003799158 00000 n 
+0003799308 00000 n 
+0003799460 00000 n 
+0003799612 00000 n 
+0003799765 00000 n 
+0003799918 00000 n 
+0003800069 00000 n 
+0003800222 00000 n 
+0003800373 00000 n 
+0003800524 00000 n 
+0003800674 00000 n 
+0003800825 00000 n 
+0003800976 00000 n 
+0003801129 00000 n 
+0003801281 00000 n 
+0003801434 00000 n 
+0003801587 00000 n 
+0003801738 00000 n 
+0003801889 00000 n 
+0003802040 00000 n 
+0003802191 00000 n 
+0003802343 00000 n 
+0003802496 00000 n 
+0003802649 00000 n 
+0003802802 00000 n 
+0003802953 00000 n 
+0003803106 00000 n 
+0003803259 00000 n 
+0003803412 00000 n 
+0003803564 00000 n 
+0003803717 00000 n 
+0003803869 00000 n 
+0003804021 00000 n 
+0003804174 00000 n 
+0003804325 00000 n 
+0003807051 00000 n 
+0003807204 00000 n 
+0003804475 00000 n 
+0003804701 00000 n 
+0003793145 00000 n 
+0003791679 00000 n 
+0003804641 00000 n 
+0004470915 00000 n 
+0004033275 00000 n 
+0004033241 00000 n 
+0003807356 00000 n 
+0003807509 00000 n 
+0003807662 00000 n 
+0003807814 00000 n 
+0003807966 00000 n 
+0003808119 00000 n 
+0003808272 00000 n 
+0003808424 00000 n 
+0003808577 00000 n 
+0003808730 00000 n 
+0003808882 00000 n 
+0003809034 00000 n 
+0003809187 00000 n 
+0003809340 00000 n 
+0003809493 00000 n 
+0003809646 00000 n 
+0003809799 00000 n 
+0003809953 00000 n 
+0003810106 00000 n 
+0003810258 00000 n 
+0003810411 00000 n 
+0003810564 00000 n 
+0003810716 00000 n 
+0003810869 00000 n 
+0003811021 00000 n 
+0003811174 00000 n 
+0003811327 00000 n 
+0003811480 00000 n 
+0003811633 00000 n 
+0003811786 00000 n 
+0003811939 00000 n 
+0003812091 00000 n 
+0003812244 00000 n 
+0003812394 00000 n 
+0003812546 00000 n 
+0003812697 00000 n 
+0003812849 00000 n 
+0003813000 00000 n 
+0003813150 00000 n 
+0003813303 00000 n 
+0003813455 00000 n 
+0003813608 00000 n 
+0003813760 00000 n 
+0003813912 00000 n 
+0003814065 00000 n 
+0003814219 00000 n 
+0003814372 00000 n 
+0003814525 00000 n 
+0003814677 00000 n 
+0003814830 00000 n 
+0003814983 00000 n 
+0003815136 00000 n 
+0003815289 00000 n 
+0003815440 00000 n 
+0003815593 00000 n 
+0003815746 00000 n 
+0003815899 00000 n 
+0003816052 00000 n 
+0003816204 00000 n 
+0003816358 00000 n 
+0003816510 00000 n 
+0003816661 00000 n 
+0003816814 00000 n 
+0003816966 00000 n 
+0003817119 00000 n 
+0003817271 00000 n 
+0003817423 00000 n 
+0003817576 00000 n 
+0003817728 00000 n 
+0003817881 00000 n 
+0003818032 00000 n 
+0003818182 00000 n 
+0003820939 00000 n 
+0003818332 00000 n 
+0003818558 00000 n 
+0003806162 00000 n 
+0003804842 00000 n 
+0003818498 00000 n 
+0004033207 00000 n 
+0004033173 00000 n 
+0004033139 00000 n 
+0003821092 00000 n 
+0003821244 00000 n 
+0003821397 00000 n 
+0003821548 00000 n 
+0003821701 00000 n 
+0003821854 00000 n 
+0003822006 00000 n 
+0003822159 00000 n 
+0003822311 00000 n 
+0003822464 00000 n 
+0003822617 00000 n 
+0003822769 00000 n 
+0003822922 00000 n 
+0003823075 00000 n 
+0003823228 00000 n 
+0003823381 00000 n 
+0003823534 00000 n 
+0003823687 00000 n 
+0003823840 00000 n 
+0003823993 00000 n 
+0003824145 00000 n 
+0003824298 00000 n 
+0003824450 00000 n 
+0003824603 00000 n 
+0003824756 00000 n 
+0003824909 00000 n 
+0003825061 00000 n 
+0003825210 00000 n 
+0003825363 00000 n 
+0003825514 00000 n 
+0003825665 00000 n 
+0003825816 00000 n 
+0003825969 00000 n 
+0003826122 00000 n 
+0003826275 00000 n 
+0003826428 00000 n 
+0003826581 00000 n 
+0003826733 00000 n 
+0003826884 00000 n 
+0003827036 00000 n 
+0003827188 00000 n 
+0003827339 00000 n 
+0003827491 00000 n 
+0003827642 00000 n 
+0003827794 00000 n 
+0003827944 00000 n 
+0003828096 00000 n 
+0003828247 00000 n 
+0003828399 00000 n 
+0003828550 00000 n 
+0003828703 00000 n 
+0003828853 00000 n 
+0003829005 00000 n 
+0003829158 00000 n 
+0003829311 00000 n 
+0003829464 00000 n 
+0003829617 00000 n 
+0003829770 00000 n 
+0003829923 00000 n 
+0003830076 00000 n 
+0003830229 00000 n 
+0003830382 00000 n 
+0003830535 00000 n 
+0003830686 00000 n 
+0003830837 00000 n 
+0003834236 00000 n 
+0003830987 00000 n 
+0003831213 00000 n 
+0003820130 00000 n 
+0003818712 00000 n 
+0003831153 00000 n 
+0003834389 00000 n 
+0003834541 00000 n 
+0003834694 00000 n 
+0003834846 00000 n 
+0003834998 00000 n 
+0003835149 00000 n 
+0003835301 00000 n 
+0003835452 00000 n 
+0003835604 00000 n 
+0003835756 00000 n 
+0003835906 00000 n 
+0003836058 00000 n 
+0003836210 00000 n 
+0003836362 00000 n 
+0003836513 00000 n 
+0003836665 00000 n 
+0003836817 00000 n 
+0003836970 00000 n 
+0003837123 00000 n 
+0003837275 00000 n 
+0003837427 00000 n 
+0003837580 00000 n 
+0003837732 00000 n 
+0003837885 00000 n 
+0003838038 00000 n 
+0003838191 00000 n 
+0003838345 00000 n 
+0003838498 00000 n 
+0003838651 00000 n 
+0003838802 00000 n 
+0003838955 00000 n 
+0003839107 00000 n 
+0003839260 00000 n 
+0003839412 00000 n 
+0003839565 00000 n 
+0003839718 00000 n 
+0003839871 00000 n 
+0003840024 00000 n 
+0003840176 00000 n 
+0003840329 00000 n 
+0003840481 00000 n 
+0003840634 00000 n 
+0003840787 00000 n 
+0003840940 00000 n 
+0003841093 00000 n 
+0003841246 00000 n 
+0003841399 00000 n 
+0003841552 00000 n 
+0003841704 00000 n 
+0003841855 00000 n 
+0003842006 00000 n 
+0003842158 00000 n 
+0003842310 00000 n 
+0003842463 00000 n 
+0003842615 00000 n 
+0003842767 00000 n 
+0003842920 00000 n 
+0003843071 00000 n 
+0003843224 00000 n 
+0003843376 00000 n 
+0003843529 00000 n 
+0003843682 00000 n 
+0003843833 00000 n 
+0003843985 00000 n 
+0003844138 00000 n 
+0003844291 00000 n 
+0003844443 00000 n 
+0003844595 00000 n 
+0003844748 00000 n 
+0003844901 00000 n 
+0003845054 00000 n 
+0003845207 00000 n 
+0003845360 00000 n 
+0003845513 00000 n 
+0003845666 00000 n 
+0003845819 00000 n 
+0003845971 00000 n 
+0003846124 00000 n 
+0003846277 00000 n 
+0003846430 00000 n 
+0003846583 00000 n 
+0003846735 00000 n 
+0003846888 00000 n 
+0003847040 00000 n 
+0003847192 00000 n 
+0003847344 00000 n 
+0003847497 00000 n 
+0003847650 00000 n 
+0003847804 00000 n 
+0003847956 00000 n 
+0003848107 00000 n 
+0003848260 00000 n 
+0003848412 00000 n 
+0003848565 00000 n 
+0003848718 00000 n 
+0003848871 00000 n 
+0003849024 00000 n 
+0003849176 00000 n 
+0003849329 00000 n 
+0003849481 00000 n 
+0003849633 00000 n 
+0003849784 00000 n 
+0003853268 00000 n 
+0003849934 00000 n 
+0003850160 00000 n 
+0003833057 00000 n 
+0003831341 00000 n 
+0003850100 00000 n 
+0003853421 00000 n 
+0003853574 00000 n 
+0003853727 00000 n 
+0003853880 00000 n 
+0003854032 00000 n 
+0003854184 00000 n 
+0003854336 00000 n 
+0003854489 00000 n 
+0003854641 00000 n 
+0003854794 00000 n 
+0003854947 00000 n 
+0003855099 00000 n 
+0003855252 00000 n 
+0003855400 00000 n 
+0003855551 00000 n 
+0003855704 00000 n 
+0003855856 00000 n 
+0003856008 00000 n 
+0003856161 00000 n 
+0003856314 00000 n 
+0003856467 00000 n 
+0003856620 00000 n 
+0003856773 00000 n 
+0003856926 00000 n 
+0003857079 00000 n 
+0003857232 00000 n 
+0003857384 00000 n 
+0003857537 00000 n 
+0003857690 00000 n 
+0003857844 00000 n 
+0003857997 00000 n 
+0003858150 00000 n 
+0003858302 00000 n 
+0003858454 00000 n 
+0003858607 00000 n 
+0003858759 00000 n 
+0003858911 00000 n 
+0003859063 00000 n 
+0003859216 00000 n 
+0003859368 00000 n 
+0003859518 00000 n 
+0003859671 00000 n 
+0003859824 00000 n 
+0003859977 00000 n 
+0003860130 00000 n 
+0003860281 00000 n 
+0003860434 00000 n 
+0003860587 00000 n 
+0003860739 00000 n 
+0003860892 00000 n 
+0003861045 00000 n 
+0003861196 00000 n 
+0003861349 00000 n 
+0003861502 00000 n 
+0003861654 00000 n 
+0003861805 00000 n 
+0003861958 00000 n 
+0003862110 00000 n 
+0003862263 00000 n 
+0003862415 00000 n 
+0003862568 00000 n 
+0003862720 00000 n 
+0003862873 00000 n 
+0003863026 00000 n 
+0003863178 00000 n 
+0003863331 00000 n 
+0003863484 00000 n 
+0003863637 00000 n 
+0003863790 00000 n 
+0003863943 00000 n 
+0003864096 00000 n 
+0003864249 00000 n 
+0003864402 00000 n 
+0003864555 00000 n 
+0003864708 00000 n 
+0003864861 00000 n 
+0003865014 00000 n 
+0003865167 00000 n 
+0003865320 00000 n 
+0003865472 00000 n 
+0003865625 00000 n 
+0003865778 00000 n 
+0003865927 00000 n 
+0003866079 00000 n 
+0003866232 00000 n 
+0003866384 00000 n 
+0003866537 00000 n 
+0003866689 00000 n 
+0003866841 00000 n 
+0003866994 00000 n 
+0003867146 00000 n 
+0003867299 00000 n 
+0003867452 00000 n 
+0003867604 00000 n 
+0003867753 00000 n 
+0003867905 00000 n 
+0003868057 00000 n 
+0003868210 00000 n 
+0003868363 00000 n 
+0003868515 00000 n 
+0003868666 00000 n 
+0003872247 00000 n 
+0003872400 00000 n 
+0003868816 00000 n 
+0003869042 00000 n 
+0003852099 00000 n 
+0003850301 00000 n 
+0003868982 00000 n 
+0003872553 00000 n 
+0003872706 00000 n 
+0003872859 00000 n 
+0003873012 00000 n 
+0003873164 00000 n 
+0003873317 00000 n 
+0003873469 00000 n 
+0003873620 00000 n 
+0003873773 00000 n 
+0003873924 00000 n 
+0003874076 00000 n 
+0003874230 00000 n 
+0003874384 00000 n 
+0003874537 00000 n 
+0003874690 00000 n 
+0003874842 00000 n 
+0003874995 00000 n 
+0003875146 00000 n 
+0003875298 00000 n 
+0003875451 00000 n 
+0003875604 00000 n 
+0003875757 00000 n 
+0003875910 00000 n 
+0003876062 00000 n 
+0003876215 00000 n 
+0003876368 00000 n 
+0003876521 00000 n 
+0003876673 00000 n 
+0003876826 00000 n 
+0003876979 00000 n 
+0003877132 00000 n 
+0003877285 00000 n 
+0003877437 00000 n 
+0003877590 00000 n 
+0003877743 00000 n 
+0003877895 00000 n 
+0003878048 00000 n 
+0003878200 00000 n 
+0003878353 00000 n 
+0003878506 00000 n 
+0003878659 00000 n 
+0003878809 00000 n 
+0003878959 00000 n 
+0003879112 00000 n 
+0003879265 00000 n 
+0003879418 00000 n 
+0003879570 00000 n 
+0003879722 00000 n 
+0003879875 00000 n 
+0003880027 00000 n 
+0003880180 00000 n 
+0003880332 00000 n 
+0003880484 00000 n 
+0003880637 00000 n 
+0003880788 00000 n 
+0003880941 00000 n 
+0003881094 00000 n 
+0003881247 00000 n 
+0003881399 00000 n 
+0003881550 00000 n 
+0003881703 00000 n 
+0003881856 00000 n 
+0003882009 00000 n 
+0003882162 00000 n 
+0003882315 00000 n 
+0003882468 00000 n 
+0003882621 00000 n 
+0003882773 00000 n 
+0003882926 00000 n 
+0003883079 00000 n 
+0003883232 00000 n 
+0003883385 00000 n 
+0003883538 00000 n 
+0003883691 00000 n 
+0003883844 00000 n 
+0003883997 00000 n 
+0003884150 00000 n 
+0003884303 00000 n 
+0003884455 00000 n 
+0003884608 00000 n 
+0003884760 00000 n 
+0003884913 00000 n 
+0003885066 00000 n 
+0003885217 00000 n 
+0003885370 00000 n 
+0003885522 00000 n 
+0003885675 00000 n 
+0003885828 00000 n 
+0003885981 00000 n 
+0003886133 00000 n 
+0003886286 00000 n 
+0003886434 00000 n 
+0003886586 00000 n 
+0003886738 00000 n 
+0003886889 00000 n 
+0003887042 00000 n 
+0003887193 00000 n 
+0003887345 00000 n 
+0003887498 00000 n 
+0003887650 00000 n 
+0003887803 00000 n 
+0003887955 00000 n 
+0003888107 00000 n 
+0003888260 00000 n 
+0003888413 00000 n 
+0003888566 00000 n 
+0003888719 00000 n 
+0003888871 00000 n 
+0003889021 00000 n 
+0003892502 00000 n 
+0003889172 00000 n 
+0003889398 00000 n 
+0003870988 00000 n 
+0003869183 00000 n 
+0003889338 00000 n 
+0004033105 00000 n 
+0003892654 00000 n 
+0003892807 00000 n 
+0003892959 00000 n 
+0003893112 00000 n 
+0003893264 00000 n 
+0003893417 00000 n 
+0003893569 00000 n 
+0003893721 00000 n 
+0003893873 00000 n 
+0003894026 00000 n 
+0003894179 00000 n 
+0003894331 00000 n 
+0003894484 00000 n 
+0003894637 00000 n 
+0003894790 00000 n 
+0003894942 00000 n 
+0003895095 00000 n 
+0003895248 00000 n 
+0003895401 00000 n 
+0003895554 00000 n 
+0003895707 00000 n 
+0003895860 00000 n 
+0003896013 00000 n 
+0003896166 00000 n 
+0003896320 00000 n 
+0003896473 00000 n 
+0003896626 00000 n 
+0003896778 00000 n 
+0003896931 00000 n 
+0003897084 00000 n 
+0003897237 00000 n 
+0003897390 00000 n 
+0003897543 00000 n 
+0003897696 00000 n 
+0003897849 00000 n 
+0003898001 00000 n 
+0003898154 00000 n 
+0003898306 00000 n 
+0003898458 00000 n 
+0003898610 00000 n 
+0003898759 00000 n 
+0003898910 00000 n 
+0003899063 00000 n 
+0003899215 00000 n 
+0003899367 00000 n 
+0003899520 00000 n 
+0003899672 00000 n 
+0003899824 00000 n 
+0003899977 00000 n 
+0003900130 00000 n 
+0003900283 00000 n 
+0003900436 00000 n 
+0003900589 00000 n 
+0003900740 00000 n 
+0003900890 00000 n 
+0003901041 00000 n 
+0003901194 00000 n 
+0003901347 00000 n 
+0003901500 00000 n 
+0003901652 00000 n 
+0003901805 00000 n 
+0003901957 00000 n 
+0003902110 00000 n 
+0003902263 00000 n 
+0003902415 00000 n 
+0003902567 00000 n 
+0003902719 00000 n 
+0003902872 00000 n 
+0003903025 00000 n 
+0003903177 00000 n 
+0003903330 00000 n 
+0003903482 00000 n 
+0003903634 00000 n 
+0003903787 00000 n 
+0003903940 00000 n 
+0003904093 00000 n 
+0003904242 00000 n 
+0003904394 00000 n 
+0003904547 00000 n 
+0003904699 00000 n 
+0003904852 00000 n 
+0003905005 00000 n 
+0003905157 00000 n 
+0003905309 00000 n 
+0003905462 00000 n 
+0003905615 00000 n 
+0003905768 00000 n 
+0003905920 00000 n 
+0003906073 00000 n 
+0003906226 00000 n 
+0003906378 00000 n 
+0003906530 00000 n 
+0003906681 00000 n 
+0003906831 00000 n 
+0003906983 00000 n 
+0003907136 00000 n 
+0003907289 00000 n 
+0003907442 00000 n 
+0003907594 00000 n 
+0003907747 00000 n 
+0003907899 00000 n 
+0003911459 00000 n 
+0003908049 00000 n 
+0003908275 00000 n 
+0003891333 00000 n 
+0003889539 00000 n 
+0003908215 00000 n 
+0004471048 00000 n 
+0003911611 00000 n 
+0003911764 00000 n 
+0003911916 00000 n 
+0003912067 00000 n 
+0003912219 00000 n 
+0003912370 00000 n 
+0003912522 00000 n 
+0003912675 00000 n 
+0003912827 00000 n 
+0003912980 00000 n 
+0003913133 00000 n 
+0003913285 00000 n 
+0003913438 00000 n 
+0003913590 00000 n 
+0003913743 00000 n 
+0003913896 00000 n 
+0003914049 00000 n 
+0003914201 00000 n 
+0003914354 00000 n 
+0003914506 00000 n 
+0003914658 00000 n 
+0003914811 00000 n 
+0003914964 00000 n 
+0003915117 00000 n 
+0003915270 00000 n 
+0003915423 00000 n 
+0003915576 00000 n 
+0003915729 00000 n 
+0003915882 00000 n 
+0003916034 00000 n 
+0003916186 00000 n 
+0003916339 00000 n 
+0003916491 00000 n 
+0003916643 00000 n 
+0003916796 00000 n 
+0003916949 00000 n 
+0003917098 00000 n 
+0003917251 00000 n 
+0003917403 00000 n 
+0003917556 00000 n 
+0003917709 00000 n 
+0003917862 00000 n 
+0003918015 00000 n 
+0003918167 00000 n 
+0003918320 00000 n 
+0003918473 00000 n 
+0003918624 00000 n 
+0003918776 00000 n 
+0003918928 00000 n 
+0003919081 00000 n 
+0003919234 00000 n 
+0003919385 00000 n 
+0003919538 00000 n 
+0003919690 00000 n 
+0003919842 00000 n 
+0003919993 00000 n 
+0003920145 00000 n 
+0003920298 00000 n 
+0003920451 00000 n 
+0003920602 00000 n 
+0003920753 00000 n 
+0003920903 00000 n 
+0003921056 00000 n 
+0003921208 00000 n 
+0003921360 00000 n 
+0003921513 00000 n 
+0003921665 00000 n 
+0003921818 00000 n 
+0003921970 00000 n 
+0003922123 00000 n 
+0003922276 00000 n 
+0003922429 00000 n 
+0003922582 00000 n 
+0003922735 00000 n 
+0003922888 00000 n 
+0003923040 00000 n 
+0003923193 00000 n 
+0003923346 00000 n 
+0003923499 00000 n 
+0003923652 00000 n 
+0003923805 00000 n 
+0003923958 00000 n 
+0003924111 00000 n 
+0003924263 00000 n 
+0003924416 00000 n 
+0003924567 00000 n 
+0003924720 00000 n 
+0003924873 00000 n 
+0003925026 00000 n 
+0003925179 00000 n 
+0003925332 00000 n 
+0003925485 00000 n 
+0003925637 00000 n 
+0003925789 00000 n 
+0003925942 00000 n 
+0003926094 00000 n 
+0003926247 00000 n 
+0003926400 00000 n 
+0003926553 00000 n 
+0003926705 00000 n 
+0003926858 00000 n 
+0003927011 00000 n 
+0003927164 00000 n 
+0003927317 00000 n 
+0003927470 00000 n 
+0003927623 00000 n 
+0003927774 00000 n 
+0003927925 00000 n 
+0003931391 00000 n 
+0003928075 00000 n 
+0003928301 00000 n 
+0003910220 00000 n 
+0003908416 00000 n 
+0003928241 00000 n 
+0003931544 00000 n 
+0003931697 00000 n 
+0003931850 00000 n 
+0003932003 00000 n 
+0003932155 00000 n 
+0003932308 00000 n 
+0003932460 00000 n 
+0003932613 00000 n 
+0003932765 00000 n 
+0003932918 00000 n 
+0003933071 00000 n 
+0003933223 00000 n 
+0003933376 00000 n 
+0003933528 00000 n 
+0003933681 00000 n 
+0003933833 00000 n 
+0003933986 00000 n 
+0003934138 00000 n 
+0003934291 00000 n 
+0003934444 00000 n 
+0003934597 00000 n 
+0003934751 00000 n 
+0003934904 00000 n 
+0003935057 00000 n 
+0003935210 00000 n 
+0003935359 00000 n 
+0003935509 00000 n 
+0003935662 00000 n 
+0003935815 00000 n 
+0003935967 00000 n 
+0003936119 00000 n 
+0003936272 00000 n 
+0003936425 00000 n 
+0003936577 00000 n 
+0003936730 00000 n 
+0003936882 00000 n 
+0003937035 00000 n 
+0003937187 00000 n 
+0003937339 00000 n 
+0003937492 00000 n 
+0003937645 00000 n 
+0003937796 00000 n 
+0003937949 00000 n 
+0003938101 00000 n 
+0003938254 00000 n 
+0003938407 00000 n 
+0003938560 00000 n 
+0003938713 00000 n 
+0003938865 00000 n 
+0003939016 00000 n 
+0003939167 00000 n 
+0003939319 00000 n 
+0003939472 00000 n 
+0003939625 00000 n 
+0003939778 00000 n 
+0003939931 00000 n 
+0003940082 00000 n 
+0003940235 00000 n 
+0003940387 00000 n 
+0003940539 00000 n 
+0003940691 00000 n 
+0003940844 00000 n 
+0003940997 00000 n 
+0003941149 00000 n 
+0003941302 00000 n 
+0003941454 00000 n 
+0003941607 00000 n 
+0003941759 00000 n 
+0003941911 00000 n 
+0003942064 00000 n 
+0003942217 00000 n 
+0003942370 00000 n 
+0003942523 00000 n 
+0003942676 00000 n 
+0003942829 00000 n 
+0003942982 00000 n 
+0003943135 00000 n 
+0003943288 00000 n 
+0003943440 00000 n 
+0003943593 00000 n 
+0003943746 00000 n 
+0003943899 00000 n 
+0003944052 00000 n 
+0003944204 00000 n 
+0003944356 00000 n 
+0003944509 00000 n 
+0003944661 00000 n 
+0003944813 00000 n 
+0003944965 00000 n 
+0003945117 00000 n 
+0003945270 00000 n 
+0003945422 00000 n 
+0003945574 00000 n 
+0003945725 00000 n 
+0003945877 00000 n 
+0003946029 00000 n 
+0003946181 00000 n 
+0003946334 00000 n 
+0003946487 00000 n 
+0003946640 00000 n 
+0003946792 00000 n 
+0003946945 00000 n 
+0003947098 00000 n 
+0003947250 00000 n 
+0003947402 00000 n 
+0003947552 00000 n 
+0003951018 00000 n 
+0003951171 00000 n 
+0003947702 00000 n 
+0003947928 00000 n 
+0003930172 00000 n 
+0003928455 00000 n 
+0003947868 00000 n 
+0003951324 00000 n 
+0003951477 00000 n 
+0003951630 00000 n 
+0003951782 00000 n 
+0003951934 00000 n 
+0003952087 00000 n 
+0003952238 00000 n 
+0003952391 00000 n 
+0003952544 00000 n 
+0003952696 00000 n 
+0003952849 00000 n 
+0003953001 00000 n 
+0003953154 00000 n 
+0003953306 00000 n 
+0003953459 00000 n 
+0003953611 00000 n 
+0003953764 00000 n 
+0003953917 00000 n 
+0003954070 00000 n 
+0003954223 00000 n 
+0003954376 00000 n 
+0003954529 00000 n 
+0003954682 00000 n 
+0003954835 00000 n 
+0003954988 00000 n 
+0003955141 00000 n 
+0003955294 00000 n 
+0003955447 00000 n 
+0003955600 00000 n 
+0003955753 00000 n 
+0003955905 00000 n 
+0003956058 00000 n 
+0003956211 00000 n 
+0003956363 00000 n 
+0003956516 00000 n 
+0003956668 00000 n 
+0003956820 00000 n 
+0003956973 00000 n 
+0003957125 00000 n 
+0003957277 00000 n 
+0003957431 00000 n 
+0003957584 00000 n 
+0003957732 00000 n 
+0003957883 00000 n 
+0003958036 00000 n 
+0003958188 00000 n 
+0003958339 00000 n 
+0003958492 00000 n 
+0003958645 00000 n 
+0003958798 00000 n 
+0003958951 00000 n 
+0003959104 00000 n 
+0003959256 00000 n 
+0003959407 00000 n 
+0003959557 00000 n 
+0003959710 00000 n 
+0003959863 00000 n 
+0003960016 00000 n 
+0003960168 00000 n 
+0003960321 00000 n 
+0003960473 00000 n 
+0003960626 00000 n 
+0003960778 00000 n 
+0003960931 00000 n 
+0003961083 00000 n 
+0003961234 00000 n 
+0003961387 00000 n 
+0003961540 00000 n 
+0003961692 00000 n 
+0003961845 00000 n 
+0003961998 00000 n 
+0003962151 00000 n 
+0003962303 00000 n 
+0003962456 00000 n 
+0003962609 00000 n 
+0003962762 00000 n 
+0003962915 00000 n 
+0003963068 00000 n 
+0003963221 00000 n 
+0003963374 00000 n 
+0003963527 00000 n 
+0003963679 00000 n 
+0003963832 00000 n 
+0003963985 00000 n 
+0003964137 00000 n 
+0003964290 00000 n 
+0003964443 00000 n 
+0003964596 00000 n 
+0003964749 00000 n 
+0003964901 00000 n 
+0003965053 00000 n 
+0003965205 00000 n 
+0003965357 00000 n 
+0003965510 00000 n 
+0003965662 00000 n 
+0003965814 00000 n 
+0003965966 00000 n 
+0003966119 00000 n 
+0003966271 00000 n 
+0003966424 00000 n 
+0003966577 00000 n 
+0003966730 00000 n 
+0003966882 00000 n 
+0003967034 00000 n 
+0003967187 00000 n 
+0003967338 00000 n 
+0003967491 00000 n 
+0003967643 00000 n 
+0003967796 00000 n 
+0003967948 00000 n 
+0003968098 00000 n 
+0003971338 00000 n 
+0003968247 00000 n 
+0003968473 00000 n 
+0003949739 00000 n 
+0003948069 00000 n 
+0003968413 00000 n 
+0004033071 00000 n 
+0003971491 00000 n 
+0003971644 00000 n 
+0003971796 00000 n 
+0003971949 00000 n 
+0003972101 00000 n 
+0003972254 00000 n 
+0003972407 00000 n 
+0003972560 00000 n 
+0003972712 00000 n 
+0003972861 00000 n 
+0003973012 00000 n 
+0003973165 00000 n 
+0003973318 00000 n 
+0003973470 00000 n 
+0003973622 00000 n 
+0003973774 00000 n 
+0003973927 00000 n 
+0003974080 00000 n 
+0003974232 00000 n 
+0003974385 00000 n 
+0003974538 00000 n 
+0003974690 00000 n 
+0003974842 00000 n 
+0003974995 00000 n 
+0003975148 00000 n 
+0003975301 00000 n 
+0003975454 00000 n 
+0003975607 00000 n 
+0003975760 00000 n 
+0003975913 00000 n 
+0003976066 00000 n 
+0003976217 00000 n 
+0003976369 00000 n 
+0003976521 00000 n 
+0003976674 00000 n 
+0003976827 00000 n 
+0003976980 00000 n 
+0003977133 00000 n 
+0003977286 00000 n 
+0003977439 00000 n 
+0003977592 00000 n 
+0003977745 00000 n 
+0003977896 00000 n 
+0003978047 00000 n 
+0003978198 00000 n 
+0003978351 00000 n 
+0003978504 00000 n 
+0003978657 00000 n 
+0003978810 00000 n 
+0003978962 00000 n 
+0003979115 00000 n 
+0003979268 00000 n 
+0003979420 00000 n 
+0003979573 00000 n 
+0003979726 00000 n 
+0003979878 00000 n 
+0003980031 00000 n 
+0003980184 00000 n 
+0003980336 00000 n 
+0003980489 00000 n 
+0003980643 00000 n 
+0003980796 00000 n 
+0003980945 00000 n 
+0003981097 00000 n 
+0003981248 00000 n 
+0003981401 00000 n 
+0003981554 00000 n 
+0003981707 00000 n 
+0003981860 00000 n 
+0003982013 00000 n 
+0003982166 00000 n 
+0003982319 00000 n 
+0003982472 00000 n 
+0003982623 00000 n 
+0003982773 00000 n 
+0003982924 00000 n 
+0003983150 00000 n 
+0003970429 00000 n 
+0003968614 00000 n 
+0003983090 00000 n 
+0004033037 00000 n 
+0004033003 00000 n 
+0003985428 00000 n 
+0003985581 00000 n 
+0003985733 00000 n 
+0003985885 00000 n 
+0003986037 00000 n 
+0003986189 00000 n 
+0003986340 00000 n 
+0003986492 00000 n 
+0003986644 00000 n 
+0003986796 00000 n 
+0003986949 00000 n 
+0003987103 00000 n 
+0003987255 00000 n 
+0003987408 00000 n 
+0003987561 00000 n 
+0003987713 00000 n 
+0003987865 00000 n 
+0003988018 00000 n 
+0003988171 00000 n 
+0003988322 00000 n 
+0003988475 00000 n 
+0003988627 00000 n 
+0003988778 00000 n 
+0003988930 00000 n 
+0003989082 00000 n 
+0003989235 00000 n 
+0003989386 00000 n 
+0003989538 00000 n 
+0003989690 00000 n 
+0003989842 00000 n 
+0003989995 00000 n 
+0003990147 00000 n 
+0003990300 00000 n 
+0003990451 00000 n 
+0003990604 00000 n 
+0003990755 00000 n 
+0003990904 00000 n 
+0003991057 00000 n 
+0003991210 00000 n 
+0003991362 00000 n 
+0003991515 00000 n 
+0003991667 00000 n 
+0003991820 00000 n 
+0003991973 00000 n 
+0003992126 00000 n 
+0003992279 00000 n 
+0003992432 00000 n 
+0003992584 00000 n 
+0003992737 00000 n 
+0003992888 00000 n 
+0003993041 00000 n 
+0003993194 00000 n 
+0003993347 00000 n 
+0003993499 00000 n 
+0003993652 00000 n 
+0003993804 00000 n 
+0003993957 00000 n 
+0003994110 00000 n 
+0003994262 00000 n 
+0003994415 00000 n 
+0003994567 00000 n 
+0003994720 00000 n 
+0003994873 00000 n 
+0003995026 00000 n 
+0003995179 00000 n 
+0003995332 00000 n 
+0003995484 00000 n 
+0003995637 00000 n 
+0003995790 00000 n 
+0003995943 00000 n 
+0003996096 00000 n 
+0003996249 00000 n 
+0003996401 00000 n 
+0003999100 00000 n 
+0003996551 00000 n 
+0003996777 00000 n 
+0003984549 00000 n 
+0003983291 00000 n 
+0003996717 00000 n 
+0003999252 00000 n 
+0003999404 00000 n 
+0003999556 00000 n 
+0003999708 00000 n 
+0003999859 00000 n 
+0004000010 00000 n 
+0004000161 00000 n 
+0004000311 00000 n 
+0004000462 00000 n 
+0004000613 00000 n 
+0004000764 00000 n 
+0004000915 00000 n 
+0004001066 00000 n 
+0004001218 00000 n 
+0004001370 00000 n 
+0004001522 00000 n 
+0004001674 00000 n 
+0004001826 00000 n 
+0004001978 00000 n 
+0004002130 00000 n 
+0004002282 00000 n 
+0004002434 00000 n 
+0004002586 00000 n 
+0004002738 00000 n 
+0004002891 00000 n 
+0004003043 00000 n 
+0004003194 00000 n 
+0004003347 00000 n 
+0004003500 00000 n 
+0004003653 00000 n 
+0004003804 00000 n 
+0004003956 00000 n 
+0004004107 00000 n 
+0004004257 00000 n 
+0004004408 00000 n 
+0004004561 00000 n 
+0004004714 00000 n 
+0004004867 00000 n 
+0004005020 00000 n 
+0004005172 00000 n 
+0004005325 00000 n 
+0004005478 00000 n 
+0004005631 00000 n 
+0004005784 00000 n 
+0004005936 00000 n 
+0004006089 00000 n 
+0004006241 00000 n 
+0004006394 00000 n 
+0004006546 00000 n 
+0004006699 00000 n 
+0004006851 00000 n 
+0004007004 00000 n 
+0004007156 00000 n 
+0004007308 00000 n 
+0004007459 00000 n 
+0004007612 00000 n 
+0004007765 00000 n 
+0004007918 00000 n 
+0004008071 00000 n 
+0004008222 00000 n 
+0004011042 00000 n 
+0004008373 00000 n 
+0004008599 00000 n 
+0003998341 00000 n 
+0003996905 00000 n 
+0004008539 00000 n 
+0004471181 00000 n 
+0004011193 00000 n 
+0004011346 00000 n 
+0004011497 00000 n 
+0004011649 00000 n 
+0004011802 00000 n 
+0004011954 00000 n 
+0004012107 00000 n 
+0004012260 00000 n 
+0004012413 00000 n 
+0004012565 00000 n 
+0004012716 00000 n 
+0004012868 00000 n 
+0004013021 00000 n 
+0004013173 00000 n 
+0004013325 00000 n 
+0004013477 00000 n 
+0004013630 00000 n 
+0004013782 00000 n 
+0004013933 00000 n 
+0004014084 00000 n 
+0004014237 00000 n 
+0004014390 00000 n 
+0004014543 00000 n 
+0004014696 00000 n 
+0004014849 00000 n 
+0004015002 00000 n 
+0004015154 00000 n 
+0004015305 00000 n 
+0004015458 00000 n 
+0004015611 00000 n 
+0004015762 00000 n 
+0004015913 00000 n 
+0004016066 00000 n 
+0004016217 00000 n 
+0004016369 00000 n 
+0004016521 00000 n 
+0004016673 00000 n 
+0004016824 00000 n 
+0004016973 00000 n 
+0004017126 00000 n 
+0004017279 00000 n 
+0004017432 00000 n 
+0004017585 00000 n 
+0004017737 00000 n 
+0004017889 00000 n 
+0004018042 00000 n 
+0004018194 00000 n 
+0004018345 00000 n 
+0004018496 00000 n 
+0004018647 00000 n 
+0004018798 00000 n 
+0004018949 00000 n 
+0004019102 00000 n 
+0004019254 00000 n 
+0004019407 00000 n 
+0004019558 00000 n 
+0004019711 00000 n 
+0004019864 00000 n 
+0004020017 00000 n 
+0004020169 00000 n 
+0004020322 00000 n 
+0004020475 00000 n 
+0004020628 00000 n 
+0004020781 00000 n 
+0004020934 00000 n 
+0004021087 00000 n 
+0004021240 00000 n 
+0004021393 00000 n 
+0004021546 00000 n 
+0004021699 00000 n 
+0004021852 00000 n 
+0004022005 00000 n 
+0004022156 00000 n 
+0004022307 00000 n 
+0004022533 00000 n 
+0004010153 00000 n 
+0004008740 00000 n 
+0004022473 00000 n 
+0004024457 00000 n 
+0004024609 00000 n 
+0004024761 00000 n 
+0004024913 00000 n 
+0004025065 00000 n 
+0004025217 00000 n 
+0004025368 00000 n 
+0004025519 00000 n 
+0004025670 00000 n 
+0004025822 00000 n 
+0004025974 00000 n 
+0004026126 00000 n 
+0004026278 00000 n 
+0004026430 00000 n 
+0004026582 00000 n 
+0004026734 00000 n 
+0004026886 00000 n 
+0004027037 00000 n 
+0004027188 00000 n 
+0004027339 00000 n 
+0004027491 00000 n 
+0004027643 00000 n 
+0004027795 00000 n 
+0004027947 00000 n 
+0004028099 00000 n 
+0004028251 00000 n 
+0004028402 00000 n 
+0004028552 00000 n 
+0004028703 00000 n 
+0004028854 00000 n 
+0004029005 00000 n 
+0004029156 00000 n 
+0004029307 00000 n 
+0004029457 00000 n 
+0004029607 00000 n 
+0004029757 00000 n 
+0004029908 00000 n 
+0004030059 00000 n 
+0004030210 00000 n 
+0004030361 00000 n 
+0004030512 00000 n 
+0004030665 00000 n 
+0004030817 00000 n 
+0004030969 00000 n 
+0004031122 00000 n 
+0004031275 00000 n 
+0004031428 00000 n 
+0004031581 00000 n 
+0004031734 00000 n 
+0004031887 00000 n 
+0004032040 00000 n 
+0004032193 00000 n 
+0004032346 00000 n 
+0004032498 00000 n 
+0004032649 00000 n 
+0004032875 00000 n 
+0004023768 00000 n 
+0004022661 00000 n 
+0004032815 00000 n 
+0004033512 00000 n 
+0004033555 00000 n 
+0004033582 00000 n 
+0004033687 00000 n 
+0004034145 00000 n 
+0004034776 00000 n 
+0004034923 00000 n 
+0004035588 00000 n 
+0004035736 00000 n 
+0004453120 00000 n 
+0004035775 00000 n 
+0004036252 00000 n 
+0004036291 00000 n 
+0004036604 00000 n 
+0004036961 00000 n 
+0004037539 00000 n 
+0004037566 00000 n 
+0004038203 00000 n 
+0004038375 00000 n 
+0004038655 00000 n 
+0004038976 00000 n 
+0004039610 00000 n 
+0004039865 00000 n 
+0004040560 00000 n 
+0004041253 00000 n 
+0004041764 00000 n 
+0004042435 00000 n 
+0004043019 00000 n 
+0004043205 00000 n 
+0004044103 00000 n 
+0004044666 00000 n 
+0004045325 00000 n 
+0004045718 00000 n 
+0004046294 00000 n 
+0004047194 00000 n 
+0004047893 00000 n 
+0004047938 00000 n 
+0004048600 00000 n 
+0004048954 00000 n 
+0004056285 00000 n 
+0004056519 00000 n 
+0004063565 00000 n 
+0004063789 00000 n 
+0004076138 00000 n 
+0004076824 00000 n 
+0004095146 00000 n 
+0004095579 00000 n 
+0004102723 00000 n 
+0004102960 00000 n 
+0004110874 00000 n 
+0004111104 00000 n 
+0004122591 00000 n 
+0004122872 00000 n 
+0004130018 00000 n 
+0004130254 00000 n 
+0004138810 00000 n 
+0004139102 00000 n 
+0004148695 00000 n 
+0004148951 00000 n 
+0004156064 00000 n 
+0004156289 00000 n 
+0004174052 00000 n 
+0004174476 00000 n 
+0004181933 00000 n 
+0004182169 00000 n 
+0004191963 00000 n 
+0004192224 00000 n 
+0004204535 00000 n 
+0004204870 00000 n 
+0004215889 00000 n 
+0004216186 00000 n 
+0004231537 00000 n 
+0004232246 00000 n 
+0004239555 00000 n 
+0004239803 00000 n 
+0004248247 00000 n 
+0004248532 00000 n 
+0004256845 00000 n 
+0004257142 00000 n 
+0004265054 00000 n 
+0004265312 00000 n 
+0004273630 00000 n 
+0004273955 00000 n 
+0004282048 00000 n 
+0004282276 00000 n 
+0004291355 00000 n 
+0004291589 00000 n 
+0004295176 00000 n 
+0004295413 00000 n 
+0004303290 00000 n 
+0004303568 00000 n 
+0004309721 00000 n 
+0004309971 00000 n 
+0004312514 00000 n 
+0004312808 00000 n 
+0004332495 00000 n 
+0004333111 00000 n 
+0004346134 00000 n 
+0004346543 00000 n 
+0004361574 00000 n 
+0004362093 00000 n 
+0004371002 00000 n 
+0004371323 00000 n 
+0004378651 00000 n 
+0004379020 00000 n 
+0004396612 00000 n 
+0004397120 00000 n 
+0004410061 00000 n 
+0004410427 00000 n 
+0004432799 00000 n 
+0004433519 00000 n 
+0004452530 00000 n 
+0004471284 00000 n 
+0004471407 00000 n 
+0004471535 00000 n 
+0004471663 00000 n 
+0004471791 00000 n 
+0004471919 00000 n 
+0004472047 00000 n 
+0004472175 00000 n 
+0004472303 00000 n 
+0004472431 00000 n 
+0004472565 00000 n 
+0004472699 00000 n 
+0004472833 00000 n 
+0004472967 00000 n 
+0004473101 00000 n 
+0004473235 00000 n 
+0004473328 00000 n 
+0004473463 00000 n 
+0004473598 00000 n 
+0004473713 00000 n 
+0004473800 00000 n 
+0004486070 00000 n 
+0004486241 00000 n 
+0004486576 00000 n 
+0004487245 00000 n 
+0004487983 00000 n 
+0004488721 00000 n 
+0004489459 00000 n 
+0004490197 00000 n 
+0004490935 00000 n 
+0004491673 00000 n 
+0004492411 00000 n 
+0004493149 00000 n 
+0004493887 00000 n 
+0004494625 00000 n 
+0004495363 00000 n 
+0004496101 00000 n 
+0004496839 00000 n 
+0004497577 00000 n 
+0004498315 00000 n 
+0004499053 00000 n 
+0004499743 00000 n 
+0004500561 00000 n 
+0004501190 00000 n 
+0004501880 00000 n 
+0004502570 00000 n 
+0004503260 00000 n 
+0004503950 00000 n 
+0004504640 00000 n 
+0004505330 00000 n 
+0004506020 00000 n 
+0004506710 00000 n 
+0004507400 00000 n 
+0004508090 00000 n 
+0004508780 00000 n 
+0004509470 00000 n 
+0004510160 00000 n 
+0004510850 00000 n 
+0004511540 00000 n 
+0004512230 00000 n 
+0004512920 00000 n 
+0004513672 00000 n 
+0004514554 00000 n 
+0004515436 00000 n 
+0004516252 00000 n 
+0004517084 00000 n 
+0004517916 00000 n 
+0004518674 00000 n 
+0004519444 00000 n 
+0004520214 00000 n 
+0004521030 00000 n 
+0004521854 00000 n 
+0004522552 00000 n 
+0004523338 00000 n 
+0004524124 00000 n 
+0004524910 00000 n 
+0004525696 00000 n 
+0004526482 00000 n 
+0004527268 00000 n 
+0004528054 00000 n 
+0004528840 00000 n 
+0004529626 00000 n 
+0004530412 00000 n 
+0004531187 00000 n 
+0004532035 00000 n 
+0004532909 00000 n 
+0004533747 00000 n 
+0004534527 00000 n 
+0004535489 00000 n 
+0004536356 00000 n 
+0004537166 00000 n 
+0004537976 00000 n 
+0004538786 00000 n 
+0004539596 00000 n 
+0004540406 00000 n 
+0004541216 00000 n 
+0004542010 00000 n 
+0004542756 00000 n 
+0004543502 00000 n 
+0004544248 00000 n 
+0004544994 00000 n 
+0004545740 00000 n 
+0004546486 00000 n 
+0004547232 00000 n 
+0004547978 00000 n 
+0004548724 00000 n 
+0004549470 00000 n 
+0004550432 00000 n 
+0004551227 00000 n 
+0004552105 00000 n 
+0004553017 00000 n 
+0004553827 00000 n 
+0004554637 00000 n 
+0004555447 00000 n 
+0004556257 00000 n 
+0004557067 00000 n 
+0004557829 00000 n 
+0004558575 00000 n 
+0004559321 00000 n 
+0004560067 00000 n 
+0004560813 00000 n 
+0004561559 00000 n 
+0004562305 00000 n 
+0004563051 00000 n 
+0004563797 00000 n 
+0004564642 00000 n 
+0004565388 00000 n 
+0004566134 00000 n 
+0004566880 00000 n 
+0004567574 00000 n 
+0004568328 00000 n 
+0004569082 00000 n 
+0004569836 00000 n 
+0004570590 00000 n 
+0004571500 00000 n 
+0004572438 00000 n 
+0004573400 00000 n 
+0004574164 00000 n 
+0004574897 00000 n 
+0004575779 00000 n 
+0004576582 00000 n 
+0004577344 00000 n 
+0004578106 00000 n 
+0004578773 00000 n 
+0004579643 00000 n 
+0004580547 00000 n 
+0004581349 00000 n 
+0004582151 00000 n 
+0004582953 00000 n 
+0004583755 00000 n 
+0004584541 00000 n 
+0004585279 00000 n 
+0004586017 00000 n 
+0004586755 00000 n 
+0004587493 00000 n 
+0004588297 00000 n 
+0004589167 00000 n 
+0004589905 00000 n 
+0004590643 00000 n 
+0004591381 00000 n 
+0004592119 00000 n 
+0004592857 00000 n 
+0004593595 00000 n 
+0004594333 00000 n 
+0004595071 00000 n 
+0004595767 00000 n 
+0004596477 00000 n 
+0004597411 00000 n 
+0004598375 00000 n 
+0004599225 00000 n 
+0004600075 00000 n 
+0004600925 00000 n 
+0004601775 00000 n 
+0004602625 00000 n 
+0004603475 00000 n 
+0004604261 00000 n 
+0004605146 00000 n 
+0004605932 00000 n 
+0004606718 00000 n 
+0004607504 00000 n 
+0004608290 00000 n 
+0004609076 00000 n 
+0004609862 00000 n 
+0004610648 00000 n 
+0004611434 00000 n 
+0004612220 00000 n 
+0004612973 00000 n 
+0004613671 00000 n 
+0004614369 00000 n 
+0004615067 00000 n 
+0004615765 00000 n 
+0004616463 00000 n 
+0004617161 00000 n 
+0004617859 00000 n 
+0004618557 00000 n 
+0004619255 00000 n 
+0004619953 00000 n 
+0004620651 00000 n 
+0004621349 00000 n 
+0004622047 00000 n 
+0004622745 00000 n 
+0004623443 00000 n 
+0004624141 00000 n 
+0004624839 00000 n 
+0004625551 00000 n 
+0004626345 00000 n 
+0004627263 00000 n 
+0004628129 00000 n 
+0004629059 00000 n 
+0004629939 00000 n 
+0004630789 00000 n 
+0004631591 00000 n 
+0004632571 00000 n 
+0004633557 00000 n 
+0004634547 00000 n 
+0004635563 00000 n 
+0004636490 00000 n 
+0004637295 00000 n 
+0004637961 00000 n 
+0004638697 00000 n 
+0004639459 00000 n 
+0004640421 00000 n 
+0004641367 00000 n 
+0004642341 00000 n 
+0004643479 00000 n 
+0004644295 00000 n 
+0004645111 00000 n 
+0004645927 00000 n 
+0004646743 00000 n 
+0004647559 00000 n 
+0004648375 00000 n 
+0004649191 00000 n 
+0004650006 00000 n 
+0004650822 00000 n 
+0004651638 00000 n 
+0004652454 00000 n 
+0004653270 00000 n 
+0004654086 00000 n 
+0004654902 00000 n 
+0004655718 00000 n 
+0004656417 00000 n 
+0004657185 00000 n 
+0004657953 00000 n 
+0004658721 00000 n 
+0004659495 00000 n 
+0004660409 00000 n 
+0004661250 00000 n 
+0004662084 00000 n 
+0004662852 00000 n 
+0004663620 00000 n 
+0004664388 00000 n 
+0004665255 00000 n 
+0004666089 00000 n 
+0004666857 00000 n 
+0004667803 00000 n 
+0004668699 00000 n 
+0004669491 00000 n 
+0004670283 00000 n 
+0004671002 00000 n 
+0004671754 00000 n 
+0004672554 00000 n 
+0004673354 00000 n 
+0004674154 00000 n 
+0004674954 00000 n 
+0004675754 00000 n 
+0004676554 00000 n 
+0004677354 00000 n 
+0004678154 00000 n 
+0004678954 00000 n 
+0004679754 00000 n 
+0004680554 00000 n 
+0004681354 00000 n 
+0004682154 00000 n 
+0004682954 00000 n 
+0004683754 00000 n 
+0004684554 00000 n 
+0004685354 00000 n 
+0004686253 00000 n 
+0004687131 00000 n 
+0004687955 00000 n 
+0004688779 00000 n 
+0004689533 00000 n 
+0004690400 00000 n 
+0004691168 00000 n 
+0004691936 00000 n 
+0004692836 00000 n 
+0004693703 00000 n 
+0004694471 00000 n 
+0004695184 00000 n 
+0004696008 00000 n 
+0004696832 00000 n 
+0004697656 00000 n 
+0004698468 00000 n 
+0004699454 00000 n 
+0004700440 00000 n 
+0004701329 00000 n 
+0004702121 00000 n 
+0004702913 00000 n 
+0004703705 00000 n 
+0004704497 00000 n 
+0004705289 00000 n 
+0004706093 00000 n 
+0004706981 00000 n 
+0004707869 00000 n 
+0004708757 00000 n 
+0004709645 00000 n 
+0004710533 00000 n 
+0004711421 00000 n 
+0004712309 00000 n 
+0004713197 00000 n 
+0004714085 00000 n 
+0004714973 00000 n 
+0004715861 00000 n 
+0004716749 00000 n 
+0004717637 00000 n 
+0004718525 00000 n 
+0004719413 00000 n 
+0004720301 00000 n 
+0004721108 00000 n 
+0004721924 00000 n 
+0004722740 00000 n 
+0004723556 00000 n 
+0004724372 00000 n 
+0004725188 00000 n 
+0004726004 00000 n 
+0004726820 00000 n 
+0004727636 00000 n 
+0004728452 00000 n 
+0004729268 00000 n 
+0004730084 00000 n 
+0004730900 00000 n 
+0004731716 00000 n 
+0004732465 00000 n 
+0004733289 00000 n 
+0004734113 00000 n 
+0004734902 00000 n 
+0004735726 00000 n 
+0004736488 00000 n 
+0004737240 00000 n 
+0004737992 00000 n 
+0004738744 00000 n 
+0004739496 00000 n 
+0004740248 00000 n 
+0004741000 00000 n 
+0004741752 00000 n 
+0004742504 00000 n 
+0004743256 00000 n 
+0004744008 00000 n 
+0004744760 00000 n 
+0004745512 00000 n 
+0004746264 00000 n 
+0004747016 00000 n 
+0004747768 00000 n 
+0004748520 00000 n 
+0004749272 00000 n 
+0004750024 00000 n 
+0004750735 00000 n 
+0004751471 00000 n 
+0004752207 00000 n 
+0004752943 00000 n 
+0004753679 00000 n 
+0004754415 00000 n 
+0004755151 00000 n 
+0004755887 00000 n 
+0004756648 00000 n 
+0004757449 00000 n 
+0004758308 00000 n 
+0004759071 00000 n 
+0004759807 00000 n 
+0004760613 00000 n 
+0004761580 00000 n 
+0004762316 00000 n 
+0004763052 00000 n 
+0004763771 00000 n 
+0004764555 00000 n 
+0004765339 00000 n 
+0004766052 00000 n 
+0004766592 00000 n 
+0004767202 00000 n 
+0004767812 00000 n 
+0004768422 00000 n 
+0004769032 00000 n 
+0004769642 00000 n 
+0004770252 00000 n 
+0004770862 00000 n 
+0004771472 00000 n 
+0004772252 00000 n 
+0004773134 00000 n 
+0004774016 00000 n 
+0004774898 00000 n 
+0004775780 00000 n 
+0004776662 00000 n 
+0004777544 00000 n 
+0004778426 00000 n 
+0004779308 00000 n 
+0004780190 00000 n 
+0004781072 00000 n 
+0004781954 00000 n 
+0004782335 00000 n 
+0004782596 00000 n 
+0004782820 00000 n 
+0004783070 00000 n 
+0004783286 00000 n 
+0004783502 00000 n 
+0004783720 00000 n 
+0004783936 00000 n 
+0004784196 00000 n 
+0004784484 00000 n 
+0004784713 00000 n 
+0004785086 00000 n 
+0004785404 00000 n 
+0004785873 00000 n 
+0004786127 00000 n 
+0004786469 00000 n 
+0004786819 00000 n 
+0004787167 00000 n 
+0004787442 00000 n 
+0004787651 00000 n 
+0004787968 00000 n 
+0004788178 00000 n 
+0004788480 00000 n 
+0004788732 00000 n 
+0004788935 00000 n 
+0004789365 00000 n 
+0004789702 00000 n 
+0004789946 00000 n 
+0004790224 00000 n 
+0004790545 00000 n 
+0004790954 00000 n 
+0004791270 00000 n 
+0004791590 00000 n 
+0004791882 00000 n 
+0004792187 00000 n 
+0004792510 00000 n 
+0004792795 00000 n 
+0004793086 00000 n 
+0004793684 00000 n 
+0004794350 00000 n 
+0004795016 00000 n 
+0004795682 00000 n 
+0004796447 00000 n 
+0004797344 00000 n 
+0004798208 00000 n 
+0004798573 00000 n 
+0004798761 00000 n 
+0004798945 00000 n 
+0004799131 00000 n 
+0004799315 00000 n 
+0004799501 00000 n 
+0004799685 00000 n 
+0004799873 00000 n 
+0004800057 00000 n 
+0004800243 00000 n 
+0004800427 00000 n 
+0004800616 00000 n 
+0004800800 00000 n 
+0004800986 00000 n 
+0004801169 00000 n 
+0004801352 00000 n 
+0004801538 00000 n 
+0004801723 00000 n 
+0004801909 00000 n 
+0004802091 00000 n 
+0004802277 00000 n 
+0004802462 00000 n 
+0004802651 00000 n 
+0004802838 00000 n 
+0004803024 00000 n 
+0004803209 00000 n 
+0004803395 00000 n 
+0004803580 00000 n 
+0004803766 00000 n 
+0004803951 00000 n 
+0004804142 00000 n 
+0004804327 00000 n 
+0004804513 00000 n 
+0004804698 00000 n 
+0004804886 00000 n 
+0004805071 00000 n 
+0004805257 00000 n 
+0004805441 00000 n 
+0004805622 00000 n 
+0004805806 00000 n 
+0004805990 00000 n 
+0004806178 00000 n 
+0004806368 00000 n 
+0004806560 00000 n 
+0004806750 00000 n 
+0004806943 00000 n 
+0004807133 00000 n 
+0004807325 00000 n 
+0004807515 00000 n 
+0004807709 00000 n 
+0004807899 00000 n 
+0004808092 00000 n 
+0004808282 00000 n 
+0004808474 00000 n 
+0004808664 00000 n 
+0004808856 00000 n 
+0004809045 00000 n 
+0004809238 00000 n 
+0004809422 00000 n 
+0004809614 00000 n 
+0004809803 00000 n 
+0004809992 00000 n 
+0004810184 00000 n 
+0004810374 00000 n 
+0004810566 00000 n 
+0004810756 00000 n 
+0004810949 00000 n 
+0004811139 00000 n 
+0004811331 00000 n 
+0004811521 00000 n 
+0004811713 00000 n 
+0004811903 00000 n 
+0004812096 00000 n 
+0004812286 00000 n 
+0004812478 00000 n 
+0004812667 00000 n 
+0004812853 00000 n 
+0004813042 00000 n 
+0004813231 00000 n 
+0004813423 00000 n 
+0004813613 00000 n 
+0004813805 00000 n 
+0004813995 00000 n 
+0004814187 00000 n 
+0004814374 00000 n 
+0004814550 00000 n 
+0004814728 00000 n 
+0004814904 00000 n 
+0004815082 00000 n 
+0004815258 00000 n 
+0004815436 00000 n 
+0004815612 00000 n 
+0004815790 00000 n 
+0004815991 00000 n 
+0004816257 00000 n 
+0004816531 00000 n 
+0004816805 00000 n 
+0004817082 00000 n 
+0004817356 00000 n 
+0004817635 00000 n 
+0004817912 00000 n 
+0004818186 00000 n 
+0004818460 00000 n 
+0004818734 00000 n 
+0004819008 00000 n 
+0004819283 00000 n 
+0004819557 00000 n 
+0004819831 00000 n 
+0004820105 00000 n 
+0004820376 00000 n 
+0004820646 00000 n 
+0004820920 00000 n 
+0004821194 00000 n 
+0004821471 00000 n 
+0004821753 00000 n 
+0004822034 00000 n 
+0004822316 00000 n 
+0004822597 00000 n 
+0004822879 00000 n 
+0004823159 00000 n 
+0004823438 00000 n 
+0004823712 00000 n 
+0004823986 00000 n 
+0004824256 00000 n 
+0004824522 00000 n 
+0004824794 00000 n 
+0004825066 00000 n 
+0004825340 00000 n 
+0004825613 00000 n 
+0004825887 00000 n 
+0004826160 00000 n 
+0004826434 00000 n 
+0004826707 00000 n 
+0004826981 00000 n 
+0004827254 00000 n 
+0004827524 00000 n 
+0004827795 00000 n 
+0004828069 00000 n 
+0004828345 00000 n 
+0004828622 00000 n 
+0004828898 00000 n 
+0004829180 00000 n 
+0004829461 00000 n 
+0004829743 00000 n 
+0004830024 00000 n 
+0004830306 00000 n 
+0004830580 00000 n 
+0004830854 00000 n 
+0004831131 00000 n 
+0004831409 00000 n 
+0004831683 00000 n 
+0004831961 00000 n 
+0004832235 00000 n 
+0004832517 00000 n 
+0004832798 00000 n 
+0004833080 00000 n 
+0004833361 00000 n 
+0004833643 00000 n 
+0004833924 00000 n 
+0004834206 00000 n 
+0004834487 00000 n 
+0004834769 00000 n 
+0004835045 00000 n 
+0004835319 00000 n 
+0004835595 00000 n 
+0004835872 00000 n 
+0004836148 00000 n 
+0004836430 00000 n 
+0004836706 00000 n 
+0004836980 00000 n 
+0004837254 00000 n 
+0004837533 00000 n 
+0004837813 00000 n 
+0004838095 00000 n 
+0004838375 00000 n 
+0004838658 00000 n 
+0004838938 00000 n 
+0004839223 00000 n 
+0004839511 00000 n 
+0004839797 00000 n 
+0004840083 00000 n 
+0004840371 00000 n 
+0004840658 00000 n 
+0004840946 00000 n 
+0004841233 00000 n 
+0004841521 00000 n 
+0004841805 00000 n 
+0004842085 00000 n 
+0004842365 00000 n 
+0004842648 00000 n 
+0004842928 00000 n 
+0004843208 00000 n 
+0004843492 00000 n 
+0004843772 00000 n 
+0004844053 00000 n 
+0004844333 00000 n 
+0004844621 00000 n 
+0004844908 00000 n 
+0004845196 00000 n 
+0004845483 00000 n 
+0004845771 00000 n 
+0004846058 00000 n 
+0004846346 00000 n 
+0004846633 00000 n 
+0004846921 00000 n 
+0004847207 00000 n 
+0004847487 00000 n 
+0004847770 00000 n 
+0004848050 00000 n 
+0004848336 00000 n 
+0004848622 00000 n 
+0004848910 00000 n 
+0004849197 00000 n 
+0004849485 00000 n 
+0004849772 00000 n 
+0004850060 00000 n 
+0004850340 00000 n 
+0004850620 00000 n 
+0004850902 00000 n 
+0004851182 00000 n 
+0004851462 00000 n 
+0004851742 00000 n 
+0004852022 00000 n 
+0004852302 00000 n 
+0004852590 00000 n 
+0004852877 00000 n 
+0004853165 00000 n 
+0004853452 00000 n 
+0004853740 00000 n 
+0004854027 00000 n 
+0004854315 00000 n 
+0004854599 00000 n 
+0004854875 00000 n 
+0004855145 00000 n 
+0004855411 00000 n 
+0004855685 00000 n 
+0004855958 00000 n 
+0004856232 00000 n 
+0004856505 00000 n 
+0004856779 00000 n 
+0004857052 00000 n 
+0004857326 00000 n 
+0004857599 00000 n 
+0004857873 00000 n 
+0004858143 00000 n 
+0004858414 00000 n 
+0004858694 00000 n 
+0004858974 00000 n 
+0004859254 00000 n 
+0004859537 00000 n 
+0004859825 00000 n 
+0004860112 00000 n 
+0004860400 00000 n 
+0004860687 00000 n 
+0004860975 00000 n 
+0004861261 00000 n 
+0004861547 00000 n 
+0004861835 00000 n 
+0004862122 00000 n 
+0004862410 00000 n 
+0004862695 00000 n 
+0004862975 00000 n 
+0004863255 00000 n 
+0004863535 00000 n 
+0004863810 00000 n 
+0004864078 00000 n 
+0004864349 00000 n 
+0004864629 00000 n 
+0004864895 00000 n 
+0004865156 00000 n 
+0004865417 00000 n 
+0004865677 00000 n 
+0004865943 00000 n 
+0004866208 00000 n 
+0004866474 00000 n 
+0004866739 00000 n 
+0004866999 00000 n 
+0004867257 00000 n 
+0004867515 00000 n 
+0004867740 00000 n 
+0004867958 00000 n 
+0004868175 00000 n 
+0004868393 00000 n 
+0004868609 00000 n 
+0004868825 00000 n 
+0004869043 00000 n 
+0004869260 00000 n 
+0004869478 00000 n 
+0004869695 00000 n 
+0004869913 00000 n 
+0004870130 00000 n 
+0004870349 00000 n 
+0004870571 00000 n 
+0004870795 00000 n 
+0004871016 00000 n 
+0004871237 00000 n 
+0004871461 00000 n 
+0004871679 00000 n 
+0004871903 00000 n 
+0004872125 00000 n 
+0004872349 00000 n 
+0004872571 00000 n 
+0004872795 00000 n 
+0004873017 00000 n 
+0004873241 00000 n 
+0004873463 00000 n 
+0004873687 00000 n 
+0004873908 00000 n 
+0004874129 00000 n 
+0004874353 00000 n 
+0004874575 00000 n 
+0004874799 00000 n 
+0004875021 00000 n 
+0004875245 00000 n 
+0004875457 00000 n 
+0004875667 00000 n 
+0004875876 00000 n 
+0004876086 00000 n 
+0004876294 00000 n 
+0004876502 00000 n 
+0004876712 00000 n 
+0004876921 00000 n 
+0004877131 00000 n 
+0004877340 00000 n 
+0004877550 00000 n 
+0004877759 00000 n 
+0004877969 00000 n 
+0004878158 00000 n 
+0004878457 00000 n 
+0004879241 00000 n 
+0004879676 00000 n 
+0004879906 00000 n 
+0004880128 00000 n 
+0004880363 00000 n 
+0004880607 00000 n 
+0004880850 00000 n 
+0004881094 00000 n 
+0004881336 00000 n 
+0004881578 00000 n 
+0004881822 00000 n 
+0004882065 00000 n 
+0004882309 00000 n 
+0004882552 00000 n 
+0004882796 00000 n 
+0004883039 00000 n 
+0004883283 00000 n 
+0004883526 00000 n 
+0004883770 00000 n 
+0004884012 00000 n 
+0004884245 00000 n 
+0004884483 00000 n 
+0004884760 00000 n 
+0004885042 00000 n 
+0004885324 00000 n 
+0004885606 00000 n 
+0004885879 00000 n 
+0004886148 00000 n 
+0004886416 00000 n 
+0004886690 00000 n 
+0004886965 00000 n 
+0004887236 00000 n 
+0004887508 00000 n 
+0004887782 00000 n 
+0004888061 00000 n 
+0004888351 00000 n 
+0004888641 00000 n 
+0004888929 00000 n 
+0004889219 00000 n 
+0004889509 00000 n 
+0004889799 00000 n 
+0004890085 00000 n 
+0004890373 00000 n 
+0004890663 00000 n 
+0004890953 00000 n 
+0004891243 00000 n 
+0004891529 00000 n 
+0004891819 00000 n 
+0004892109 00000 n 
+0004892399 00000 n 
+0004892687 00000 n 
+0004892977 00000 n 
+0004893267 00000 n 
+0004893557 00000 n 
+0004893848 00000 n 
+0004894144 00000 n 
+0004894440 00000 n 
+0004894736 00000 n 
+0004895032 00000 n 
+0004895326 00000 n 
+0004895622 00000 n 
+0004895918 00000 n 
+0004896214 00000 n 
+0004896510 00000 n 
+0004896797 00000 n 
+0004897093 00000 n 
+0004897389 00000 n 
+0004897685 00000 n 
+0004897974 00000 n 
+0004898270 00000 n 
+0004898566 00000 n 
+0004898846 00000 n 
+0004899120 00000 n 
+0004899351 00000 n 
+0004899545 00000 n 
+0004899738 00000 n 
+0004899932 00000 n 
+0004900125 00000 n 
+0004900319 00000 n 
+0004900512 00000 n 
+0004900706 00000 n 
+0004900898 00000 n 
+0004901090 00000 n 
+0004901284 00000 n 
+0004901477 00000 n 
+0004901671 00000 n 
+0004901864 00000 n 
+0004902058 00000 n 
+0004902251 00000 n 
+0004902445 00000 n 
+0004902638 00000 n 
+0004902832 00000 n 
+0004903021 00000 n 
+0004903215 00000 n 
+0004903407 00000 n 
+0004903599 00000 n 
+0004903793 00000 n 
+0004903986 00000 n 
+0004904180 00000 n 
+0004904373 00000 n 
+0004904567 00000 n 
+0004904760 00000 n 
+0004904954 00000 n 
+0004905147 00000 n 
+0004905341 00000 n 
+0004905533 00000 n 
+0004905725 00000 n 
+0004905919 00000 n 
+0004906112 00000 n 
+0004906306 00000 n 
+0004906497 00000 n 
+0004906691 00000 n 
+0004906884 00000 n 
+0004907078 00000 n 
+0004907271 00000 n 
+0004907465 00000 n 
+0004907658 00000 n 
+0004907852 00000 n 
+0004908044 00000 n 
+0004908236 00000 n 
+0004908430 00000 n 
+0004908623 00000 n 
+0004908817 00000 n 
+0004909010 00000 n 
+0004909204 00000 n 
+0004909397 00000 n 
+0004909591 00000 n 
+0004909784 00000 n 
+0004909978 00000 n 
+0004910167 00000 n 
+0004910361 00000 n 
+0004910553 00000 n 
+0004910745 00000 n 
+0004910939 00000 n 
+0004911132 00000 n 
+0004911326 00000 n 
+0004911519 00000 n 
+0004911717 00000 n 
+0004911915 00000 n 
+0004912115 00000 n 
+0004912313 00000 n 
+0004912513 00000 n 
+0004912710 00000 n 
+0004912907 00000 n 
+0004913107 00000 n 
+0004913305 00000 n 
+0004913505 00000 n 
+0004913700 00000 n 
+0004913900 00000 n 
+0004914098 00000 n 
+0004914298 00000 n 
+0004914496 00000 n 
+0004914696 00000 n 
+0004914894 00000 n 
+0004915094 00000 n 
+0004915291 00000 n 
+0004915488 00000 n 
+0004915688 00000 n 
+0004915886 00000 n 
+0004916086 00000 n 
+0004916284 00000 n 
+0004916484 00000 n 
+0004916682 00000 n 
+0004916882 00000 n 
+0004917080 00000 n 
+0004917280 00000 n 
+0004917473 00000 n 
+0004917673 00000 n 
+0004917870 00000 n 
+0004918067 00000 n 
+0004918267 00000 n 
+0004918465 00000 n 
+0004918665 00000 n 
+0004918863 00000 n 
+0004919063 00000 n 
+0004919261 00000 n 
+0004919461 00000 n 
+0004919659 00000 n 
+0004919859 00000 n 
+0004920056 00000 n 
+0004920253 00000 n 
+0004920453 00000 n 
+0004920651 00000 n 
+0004920851 00000 n 
+0004921046 00000 n 
+0004921246 00000 n 
+0004921444 00000 n 
+0004921644 00000 n 
+0004921842 00000 n 
+0004922042 00000 n 
+0004922240 00000 n 
+0004922440 00000 n 
+0004922637 00000 n 
+0004922834 00000 n 
+0004923034 00000 n 
+0004923232 00000 n 
+0004923432 00000 n 
+0004923630 00000 n 
+0004923830 00000 n 
+0004924028 00000 n 
+0004924228 00000 n 
+0004924426 00000 n 
+0004924626 00000 n 
+0004924819 00000 n 
+0004925019 00000 n 
+0004925216 00000 n 
+0004925413 00000 n 
+0004925613 00000 n 
+0004925811 00000 n 
+0004926011 00000 n 
+0004926209 00000 n 
+0004926409 00000 n 
+0004926607 00000 n 
+0004926807 00000 n 
+0004927005 00000 n 
+0004927205 00000 n 
+0004927402 00000 n 
+0004927599 00000 n 
+0004927799 00000 n 
+0004927997 00000 n 
+0004928197 00000 n 
+0004928392 00000 n 
+0004928592 00000 n 
+0004928790 00000 n 
+0004928990 00000 n 
+0004929188 00000 n 
+0004929388 00000 n 
+0004929586 00000 n 
+0004929783 00000 n 
+0004929949 00000 n 
+0004930144 00000 n 
+0004930407 00000 n 
+0004930670 00000 n 
+0004930927 00000 n 
+0004931178 00000 n 
+0004931429 00000 n 
+0004931704 00000 n 
+0004931989 00000 n 
+0004932262 00000 n 
+0004932537 00000 n 
+0004932834 00000 n 
+0004933134 00000 n 
+0004933407 00000 n 
+0004933672 00000 n 
+0004933945 00000 n 
+0004934218 00000 n 
+0004934483 00000 n 
+0004934715 00000 n 
+0004935008 00000 n 
+0004935302 00000 n 
+0004935576 00000 n 
+0004935847 00000 n 
+0004936110 00000 n 
+0004936381 00000 n 
+0004936666 00000 n 
+0004936949 00000 n 
+0004937224 00000 n 
+0004937488 00000 n 
+0004937741 00000 n 
+0004937994 00000 n 
+0004938276 00000 n 
+0004938600 00000 n 
+0004938899 00000 n 
+0004939170 00000 n 
+0004939451 00000 n 
+0004939732 00000 n 
+0004940007 00000 n 
+0004940242 00000 n 
+0004940514 00000 n 
+0004940790 00000 n 
+0004941067 00000 n 
+0004941344 00000 n 
+0004941624 00000 n 
+0004941933 00000 n 
+0004942242 00000 n 
+0004942521 00000 n 
+0004942808 00000 n 
+0004943107 00000 n 
+0004943406 00000 n 
+0004943696 00000 n 
+0004943977 00000 n 
+0004944259 00000 n 
+0004944533 00000 n 
+0004944798 00000 n 
+0004945063 00000 n 
+0004945326 00000 n 
+0004945587 00000 n 
+0004945877 00000 n 
+0004946173 00000 n 
+0004946425 00000 n 
+0004946690 00000 n 
+0004946989 00000 n 
+0004947208 00000 n 
+0004947345 00000 n 
+0004947539 00000 n 
+0004947670 00000 n 
+0004947800 00000 n 
+0004947940 00000 n 
+0004948080 00000 n 
+0004948324 00000 n 
+0004948542 00000 n 
+0004948667 00000 n 
+0004948792 00000 n 
+0004948918 00000 n 
+0004949043 00000 n 
+0004949168 00000 n 
+0004949292 00000 n 
+0004949417 00000 n 
+0004949542 00000 n 
+0004949667 00000 n 
+0004949792 00000 n 
+0004949917 00000 n 
+0004950040 00000 n 
+0004950164 00000 n 
+0004950288 00000 n 
+0004950423 00000 n 
+0004950570 00000 n 
+0004950717 00000 n 
+0004950864 00000 n 
+0004951012 00000 n 
+0004951158 00000 n 
+0004951304 00000 n 
+0004951451 00000 n 
+0004951599 00000 n 
+0004951748 00000 n 
+0004951897 00000 n 
+0004952046 00000 n 
+0004952195 00000 n 
+0004952343 00000 n 
+0004952492 00000 n 
+0004952640 00000 n 
+0004952788 00000 n 
+0004952936 00000 n 
+0004953085 00000 n 
+0004953233 00000 n 
+0004953381 00000 n 
+0004953529 00000 n 
+0004953677 00000 n 
+0004953825 00000 n 
+0004953972 00000 n 
+0004954118 00000 n 
+0004954265 00000 n 
+0004954413 00000 n 
+0004954561 00000 n 
+0004954706 00000 n 
+0004954850 00000 n 
+0004954989 00000 n 
+0004955122 00000 n 
+0004955255 00000 n 
+0004955388 00000 n 
+0004955521 00000 n 
+0004955654 00000 n 
+0004955786 00000 n 
+0004955917 00000 n 
+0004956102 00000 n 
+0004956326 00000 n 
+0004956467 00000 n 
+0004956608 00000 n 
+0004956753 00000 n 
+0004956902 00000 n 
+0004957052 00000 n 
+0004957202 00000 n 
+0004957352 00000 n 
+0004957503 00000 n 
+0004957654 00000 n 
+0004957805 00000 n 
+0004957954 00000 n 
+0004958091 00000 n 
+0004958218 00000 n 
+0004958345 00000 n 
+0004958471 00000 n 
+0004958598 00000 n 
+0004958725 00000 n 
+0004958852 00000 n 
+0004958978 00000 n 
+0004959105 00000 n 
+0004959232 00000 n 
+0004959359 00000 n 
+0004959485 00000 n 
+0004959612 00000 n 
+0004959739 00000 n 
+0004959866 00000 n 
+0004959993 00000 n 
+0004960119 00000 n 
+0004960246 00000 n 
+0004960373 00000 n 
+0004960500 00000 n 
+0004960626 00000 n 
+0004960753 00000 n 
+0004960880 00000 n 
+0004961007 00000 n 
+0004961133 00000 n 
+0004961260 00000 n 
+0004961346 00000 n 
+0004961535 00000 n 
+0004961801 00000 n 
+0004962041 00000 n 
+0004962314 00000 n 
+0004962580 00000 n 
+0004962847 00000 n 
+0004963126 00000 n 
+0004963414 00000 n 
+0004963696 00000 n 
+0004963944 00000 n 
+0004964125 00000 n 
+0004964253 00000 n 
+0004964378 00000 n 
+0004964503 00000 n 
+0004964640 00000 n 
+0004964788 00000 n 
+0004964936 00000 n 
+0004965084 00000 n 
+0004965232 00000 n 
+0004965372 00000 n 
+0004965509 00000 n 
+0004965654 00000 n 
+0004965792 00000 n 
+0004965919 00000 n 
+0004966046 00000 n 
+0004966173 00000 n 
+0004966300 00000 n 
+0004966386 00000 n 
+0004966590 00000 n 
+0004966793 00000 n 
+0004966930 00000 n 
+0004967068 00000 n 
+0004967174 00000 n 
+0004967290 00000 n 
+0004967332 00000 n 
+0004967517 00000 n 
+trailer
+<< /Size 19357
+/Root 19355 0 R
+/Info 19356 0 R
+/ID [<0B3E1E0D77AE2F66944CAFE88DA9E90F> <0B3E1E0D77AE2F66944CAFE88DA9E90F>] >>
+startxref
+4967845
+%%EOF
diff --git a/doc/ppl-user-1.1pre8.ps.gz b/doc/ppl-user-1.1pre8.ps.gz
new file mode 100644
index 0000000..4319356
Binary files /dev/null and b/doc/ppl-user-1.1pre8.ps.gz differ
diff --git a/doc/ppl-user-c-interface-1.0-html.tar.gz b/doc/ppl-user-c-interface-1.0-html.tar.gz
deleted file mode 100644
index b2e7bdd..0000000
Binary files a/doc/ppl-user-c-interface-1.0-html.tar.gz and /dev/null differ
diff --git a/doc/ppl-user-c-interface-1.0.pdf b/doc/ppl-user-c-interface-1.0.pdf
deleted file mode 100644
index 694735a..0000000
--- a/doc/ppl-user-c-interface-1.0.pdf
+++ /dev/null
@@ -1,26568 +0,0 @@
-%PDF-1.4
-%����
-1 0 obj
-<< /S /GoTo /D (section.1) >>
-endobj
-4 0 obj
-(\376\377\000M\000a\000i\000n\000\040\000P\000a\000g\000e)
-endobj
-5 0 obj
-<< /S /GoTo /D (section.2) >>
-endobj
-8 0 obj
-(\376\377\000G\000N\000U\000\040\000G\000e\000n\000e\000r\000a\000l\000\040\000P\000u\000b\000l\000i\000c\000\040\000L\000i\000c\000e\000n\000s\000e)
-endobj
-9 0 obj
-<< /S /GoTo /D (section.3) >>
-endobj
-12 0 obj
-(\376\377\000G\000N\000U\000\040\000F\000r\000e\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000L\000i\000c\000e\000n\000s\000e)
-endobj
-13 0 obj
-<< /S /GoTo /D (section.4) >>
-endobj
-16 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000\040\000I\000n\000d\000e\000x)
-endobj
-17 0 obj
-<< /S /GoTo /D (subsection.4.1) >>
-endobj
-20 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000s)
-endobj
-21 0 obj
-<< /S /GoTo /D (section.5) >>
-endobj
-24 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
-endobj
-25 0 obj
-<< /S /GoTo /D (subsection.5.1) >>
-endobj
-28 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000L\000i\000s\000t)
-endobj
-29 0 obj
-<< /S /GoTo /D (section.6) >>
-endobj
-32 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-33 0 obj
-<< /S /GoTo /D (subsection.6.1) >>
-endobj
-36 0 obj
-(\376\377\000C\000\040\000L\000a\000n\000g\000u\000a\000g\000e\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e)
-endobj
-37 0 obj
-<< /S /GoTo /D (subsection.6.2) >>
-endobj
-40 0 obj
-(\376\377\000L\000i\000b\000r\000a\000r\000y\000\040\000I\000n\000i\000t\000i\000a\000l\000i\000z\000a\000t\000i\000o\000n\000\040\000a\000n\000d\000\040\000F\000i\000n\000a\000l\000i\000z\000a\000t\000i\000o\000n)
-endobj
-41 0 obj
-<< /S /GoTo /D (subsection.6.3) >>
-endobj
-44 0 obj
-(\376\377\000V\000e\000r\000s\000i\000o\000n\000\040\000C\000h\000e\000c\000k\000i\000n\000g)
-endobj
-45 0 obj
-<< /S /GoTo /D (subsection.6.4) >>
-endobj
-48 0 obj
-(\376\377\000E\000r\000r\000o\000r\000\040\000H\000a\000n\000d\000l\000i\000n\000g)
-endobj
-49 0 obj
-<< /S /GoTo /D (subsection.6.5) >>
-endobj
-52 0 obj
-(\376\377\000T\000i\000m\000e\000o\000u\000t\000\040\000H\000a\000n\000d\000l\000i\000n\000g)
-endobj
-53 0 obj
-<< /S /GoTo /D (subsection.6.6) >>
-endobj
-56 0 obj
-(\376\377\000L\000i\000b\000r\000a\000r\000y\000\040\000D\000a\000t\000a\000t\000y\000p\000e\000s)
-endobj
-57 0 obj
-<< /S /GoTo /D (section.7) >>
-endobj
-60 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-61 0 obj
-<< /S /GoTo /D (subsection.7.1) >>
-endobj
-64 0 obj
-(\376\377\000p\000p\000l\000\137\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000S\000e\000q\000u\000e\000n\000c\000e\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-65 0 obj
-<< /S /GoTo /D (subsection.7.2) >>
-endobj
-68 0 obj
-(\376\377\000p\000p\000l\000\137\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-69 0 obj
-<< /S /GoTo /D (subsection.7.3) >>
-endobj
-72 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000e\000f\000f\000i\000c\000i\000e\000n\000t\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-73 0 obj
-<< /S /GoTo /D (subsection.7.4) >>
-endobj
-76 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-77 0 obj
-<< /S /GoTo /D (subsection.7.5) >>
-endobj
-80 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-81 0 obj
-<< /S /GoTo /D (subsection.7.6) >>
-endobj
-84 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-85 0 obj
-<< /S /GoTo /D (subsection.7.7) >>
-endobj
-88 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-89 0 obj
-<< /S /GoTo /D (subsection.7.8) >>
-endobj
-92 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-93 0 obj
-<< /S /GoTo /D (subsection.7.9) >>
-endobj
-96 0 obj
-(\376\377\000p\000p\000l\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-97 0 obj
-<< /S /GoTo /D (subsection.7.10) >>
-endobj
-100 0 obj
-(\376\377\000p\000p\000l\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-101 0 obj
-<< /S /GoTo /D (subsection.7.11) >>
-endobj
-104 0 obj
-(\376\377\000p\000p\000l\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-105 0 obj
-<< /S /GoTo /D (subsection.7.12) >>
-endobj
-108 0 obj
-(\376\377\000p\000p\000l\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-109 0 obj
-<< /S /GoTo /D (subsection.7.13) >>
-endobj
-112 0 obj
-(\376\377\000p\000p\000l\000\137\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-113 0 obj
-<< /S /GoTo /D (subsection.7.14) >>
-endobj
-116 0 obj
-(\376\377\000p\000p\000l\000\137\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-117 0 obj
-<< /S /GoTo /D (subsection.7.15) >>
-endobj
-120 0 obj
-(\376\377\000p\000p\000l\000\137\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-121 0 obj
-<< /S /GoTo /D (subsection.7.16) >>
-endobj
-124 0 obj
-(\376\377\000p\000p\000l\000\137\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-125 0 obj
-<< /S /GoTo /D (subsection.7.17) >>
-endobj
-128 0 obj
-(\376\377\000p\000p\000l\000\137\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-129 0 obj
-<< /S /GoTo /D (subsection.7.18) >>
-endobj
-132 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000D\000e\000c\000i\000s\000i\000o\000n\000\137\000N\000o\000d\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-133 0 obj
-<< /S /GoTo /D (subsection.7.19) >>
-endobj
-136 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-137 0 obj
-<< /S /GoTo /D (subsection.7.20) >>
-endobj
-140 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-141 0 obj
-<< /S /GoTo /D (subsection.7.21) >>
-endobj
-144 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-145 0 obj
-<< /S /GoTo /D (subsection.7.22) >>
-endobj
-148 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-149 0 obj
-<< /S /GoTo /D (subsection.7.23) >>
-endobj
-152 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-153 0 obj
-<< /S /GoTo /D (subsection.7.24) >>
-endobj
-156 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-157 0 obj
-<< /S /GoTo /D (subsection.7.25) >>
-endobj
-160 0 obj
-(\376\377\000p\000p\000l\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-161 0 obj
-<< /S /GoTo /D [162 0 R  /Fit ] >>
-endobj
-165 0 obj <<
-/Length 1265      
-/Filter /FlateDecode
->>
-stream
-x��WIs�6��W��)5c�X.�%�kO�q-���9 at 4D�墂P
9��$*�۴��gD���}�{i
����?<	��3�i
Č#���h��<ˆ�4���pm�7���!�Ew�3�m����h`�lvtrų���
�E@�
q�� �x0{
-އ���D4���I�C�`��Fle
�]�Y�'5!p��o��ۂ6��f�av�
��8CPN2g��닶\��ݴZ��.�B��������^��
|�n݉�@�Em��\]�SK
g(Oi� {�a̜�a"�)"�\�H·�
� u���k
&A�doe ��A�b��L<ts	�(���?e+|଍�)���1Y`yĈ1��f
)�J`���[M�,
p��UQ���!������4A8�CėQ�4G)�/[�A~
��V��1p�A	��]�4N,A)'�0����o
!F��CB�Ǒ(� 1����t;�PN�/J�
�&��ص��lЅ9��
�,5=���@~k�6ςg��$��SX����bL����W

��f��/+6�����P�(#l۳��
-���&2����‹�R��Y�J�'�׫U��|�J�`���c[���8!������yo�j�#=���[o��d�+p�N�d/�*����.
�L�Ic��'�;�a�Rv�V��D��<]���9mƀ^FvhD'Asg�Ų�*z0��)�����tK���0[�I��ӵ��%�s��R���K�y���	Fc�q���^+��17�VJj�9���
�o�
[��1�}�ͥ�J}
N7��M��ۀ�y�j���Uݙ�>;�i+�M_탓��
P.Ke�WN�
�����ݺ1�*z���ڪ-��E���5��9�^��p��f����BU�C���u٩J/
�̎W��&xU���'��i�
���ݺ�U/u]�n����Z���>8�08�
�!r
-S����/B�Ѱp�N�m-h&�S��g��6���w�2��~�|���� Ԍ�i_��Sp�
�[��=\^�O�_��,���VtR��ۘ<��i����{��_֢� �[�k�5R+S���'k�v[_f1�ļ�0�n�a��|3�ȿLg2�͠MP����1C9���4��W�xS�h�V+e�$����f7��|\�
d~\y��1<���^�F�I�C��I�ᙉ�����ݵ�
#
y.{�/�Dx%L.*����fnߣe/�]s��} 
�9A��ba���ue�D��	����
��<B�k
2 �P�
�V޿L�������_|�L�
-endstream
-endobj
-162 0 obj <<
-/Type /Page
-/Contents 165 0 R
-/Resources 164 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 173 0 R
->> endobj
-163 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/ppl_logo.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 174 0 R
-/BBox [0 0 640 829]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 175 0 R
->>>>
-/Length 2688
-/Filter /FlateDecode
->>
-stream
-x�m�K�#�
D�ZEm�4	�
{�(�#�sD��'�*�>��j�V��L��ǑS9���������9����qӸל�i�Қǟ�>�u��V���)�2k�%[�׍�jk
e���<F��bȣ��u��5�ID���q�^��%�R��ˬ���|�T�4��yԮ������hYϔc�ԭ��V�»�>�������������J�k�>�si���3�4���Hݏ��{�l��V����^.&ϩ�<&;�����u��I
@����Z�KD�P���\�i����s|��R4�h}�9��艥����b\K��؆��j�ik�L���=�̸�"ؼZI��(	���%s6W���+�y�1�H')�ql�
��g���y�Qs�_7������/�;ji�y�'x���k%_�J>8{w@�wv�NQȁ�l�=("JY�s����Iy
ǹ�k�S���+���}hk�>"���Rd�'n$�4��
�įGh
�Y�ϲ����Ȭbeh&f������3(0Ϝw�9��Б ��‘�^@�A}� �T�4D�߶V�?5�$��[e��!�f�b[�l��E�4����Y4�9p��	���n<���
��9;�D4%�q�+^�kK��%��9�5��|?ĝS�Ī��@.�"�A���T�5&�%^�n59:�/H��(%�~����a	Z=�d�I��fJ+�^+�︌�B2X����#ѥ�S�����0V[-NS� �(b&�C��*�s�

��*d�K
��5ɫ�6�؄KC�hz�4��)�
�y� DF^Akz�\3W��m9�`����@�l:�MYe��B�:x6+b� h�6$sܨ��W�Z�^,����Ddx&hI���
��$�a"q���
�:��RSH�2<Z<�H�r{v%��.W次�8��?�BJ6
b�H4
,Fߎ� �Ԛ�������2��B�Z�	�.Ŋ�>@��񸵊��d�J�
�S����Q��ufG�.-�+���]��ҢxR�ِNV1�0	K��r�ہ�
��.�Q�<��͙N��*7b�_<��6���G"Cd�t�6 D�x�RkT����`; F'���́�����Gy����.C��EK�+��
(�eC�K8T�2�Q)� [...]
���B[�}��T�<��W��Z�.q[C�T"WCNҵ�e;WCk��KC�CV �E���*!��h�n�o�v������"?�1˪���롋q� vZ��K�	��.����_�6=:�+Ң�y�����
���K�4zx��
�L�ť���IoOCE
;Q6M�`]�����TD��s��E��a�,|ʙd9�Iङ��CK-���{|�׎�Aг�=GD�~W�#�J�6l=��W#,�8�$���9G�=UT�����o	���2+�S�2��Q{��u���QnU=�Qc����0Wv�b�0�����J
�QK
Ց7�4<�U��
�Sz
�j}��RdJ-��U"�
Yl���U-��q"N)����I�+�F�ۜ+����Ӽ
��M�תoÂ���l6����Q�j�q�'���}BR�
PKǧ��ѓ�%2V����,^��
j�b�K����L�N͙
�q����MW��.�P��W$������
-D���5G�\����84I���$�h<u�k�L59�0%Q��)�FX�C��ӻ�
�����
���a:׊]G'�u
��Z��B�^LE��e����Z7D�C���c�I��
U��]��iQ8s�2��*'��X�"���h6b�B��k���L2(:����I�1�s�˹�����{�uo:�k�%�.�k[��x�R�����u�
�<�����-�o�ͻ�m���

�	x���}�H�e�.��XD
�8r�D��\�%#
����k�6
%o؁zW>
 ><�ϸ�x�G���/�#�"pb:�h]�F��7��>��KHݗT��r�kwت �ӠD���Ւy��K���կ���,�G��C�Ss|��<g��uo?�������K@�
��	4�ͺ'��)�$&O:3
��.��[�G�¸���E�;{
��*����Kw�-K���T@�O���+LH�㛃��ӊwĪfgh*�� Mj�TV���F1�k
I
�?5ڮ����åےT�ѻP.d�wѩ/��"\G�
���
��G"�
�u��+��t�bg��[����pS�jeg)s_�螢bM��R
-εQo��
}� ���������@1n�M͢
���6"�-lW�Z7U���
;���mD+�|G�F��Z��@
����Q�5����(g�`R���X�6T�����.��|��6���ч��
�?��3
o���3��� m�B ��MY:c�q�P}E'�-2���
-@!S#����s����I���U$ZJZ$��\!X��P8���+�x^�|�f�:��d|?@__��h���^�a9��n]چ�*5s|Y��E���v_�#^��[�/�s͢O��
�?v�s`\�ؿ��^X{��~Ej�aW�K/Tz�
����Z���\��j�
|��>�?��a��x(~?�B�
<q����
T��5F#��
�s�B�
-����[���N��o�ِW]r�a'tܯ�_�|�"�8w�VۥDD�#��n���f���?�
�
-endstream
-endobj
-174 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100336+01'00')
-/ModDate (D:20111106100336+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-175 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-166 0 obj <<
-/D [162 0 R /XYZ 89 770.89 null]
->> endobj
-167 0 obj <<
-/D [162 0 R /XYZ 90 721.073 null]
->> endobj
-164 0 obj <<
-/Font << /F58 168 0 R /F24 169 0 R /F41 170 0 R /F42 171 0 R /F60 172 0 R >>
-/XObject << /Im1 163 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-178 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-177 0 obj <<
-/Type /Page
-/Contents 178 0 R
-/Resources 176 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 173 0 R
->> endobj
-179 0 obj <<
-/D [177 0 R /XYZ 89 770.89 null]
->> endobj
-176 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-190 0 obj <<
-/Length 1553      
-/Filter /FlateDecode
->>
-stream
-xڝWݓ�8
���%3K��/�{9v�n��-���t�>�` Ӑ�$����'Y6����ɶ$K���l3kc1�s;���#f�n
�К����]�c+�c7���>۞�u��3�w�w8�c�b"���t����Y+ �����}�I	�,_x0�֬�G��M�m���s�s2vW�
���*�l�+f��`�"�3�L˥����ɦH�D�b[ᷴvE��� �ݬ�3�G]0
�O��L��

-/
f��"�U~��m���^o�f6�,6nZ��LGn(|2=�f5�]��a'
m%�ʖR3�����ၝT;}�I�?o�ʜ}�-��z>93��Ѳ{fZ�z"�]V�YY8]�EGp�TI��.��!Fb�C䄁}$�o����9IbI���w�*[?Ӽ��c��C����:�K
��3
�
D�����ʷZ}Ҩs	H�8KeQ�\����ܖU}�sW

GBR`��i�'����޹?,��b�p��[�[D��2��;�g%��W�Y�n�0�I�)�h����H��+
-���^;���G��p|

��,Qe�LQi���ã�}UM��D�����1["��
��p��F�j�1Jn���K
Q[GS�Nׇ<�u�*���T*v��9Z(��X��a1�r����KM��E��-D��tp1=�F���
-�*43�b/K��Һ����Bn�������ke��b�n$��C)��J��&�|�>T��xD��Ba�oP��A��Q��P�Y�*ɯ�~�XH1E�Xp;���
�X��#���Nl� 
�~(U	`�j �
ѩ��)>�n1�� Tl�IC����Z(�=��:>��?�̥�'Ho������@�	�R逑ҁ*Lx��
-G
%�@h��O@��	(�@�M���t0�����xt�!1�>Ά�
	��Ёp^�+�,�Ii¶�KCR�A��(OY��l���\�M$մ�k4�q1'���'Mu8�
������
UQ>���l��e)�ŵ�蒂
��yF �m]�x�>�J0�?
�w���CE܎ƣ�'-P�x?�?g3��8�ɀ�	�9�:!�磻�x�ٓ�t�q6t��Lj�4�.}>�?yzn��z�Z����vSI�i�,��k���4�ScQdo�ŐXE�Ф���N^ц���
V*��,
�Dy�e	���P.`�,[7Ias�����Y���ؐ��{ϵA��hf�5�o�W���f�|���vC�Q��zj
��P>�rs��P�h��l���i^B$�k�mY7G�42�.�X����*bɷ��݁N�
�ݦ�皓P
�֭Y�s��Wm
�}s�]N���9����<p�Al�&7�u1�����W��6uo��{��~G�o$<憞o	_�^?���s��~�D�s�4;5�7�	�m	��ӿ�$��>�d�n�?�;*0v[
�Y�Ƒ���2?�����9�O��F��C���6�Z[�N5iQ���y�?̇�8$����s��C��g�끞�|�a��zr���+b
�+	=K��y��e!7{�4�V���Glb0�&b:�G���4%��e��"���
-endstream
-endobj
-189 0 obj <<
-/Type /Page
-/Contents 190 0 R
-/Resources 188 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 173 0 R
-/Annots [ 180 0 R 181 0 R 182 0 R 183 0 R 193 0 R 184 0 R 186 0 R ]
->> endobj
-185 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/bugseng_logo.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 195 0 R
-/BBox [0 0 640 166]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 196 0 R
->>>>
-/Length 1662
-/Filter /FlateDecode
->>
-stream
-x�}W[�
7
��S�	��8F�
�c6���)R"��Y��Z��J$U��ʩ\Y��Ϗ�o��ۿ��|��r)�j5�hu�9��]^�<r9��m)S�M�:)��v��� j��a+%�z}
$�$�/�*i^�jjS.*s&,t���R�<+h�:��wݱ��)�Z��
i%�z-�{�
Q݆��V,�Y���W���I_���'�ԫq�"��
��'
�*���b.i��\O�>���%�h�&�Ȥ�~˄@�D���N���$�_�&a#��e�Uj�|[Q�^o��2o���îi!cZ�ף����
i����s4eW

E����݆��
�<+Z
I��P꽇�8Y�Ɨ��3����4�W)�����/r�]w��<�ʶ�q�<��~�t��
�_u)�V��Y�U�����
-����/ 8� &���Ua���j��Je��+%
-��̉�)i�U
�
�S���F_@��rG�T���HE�
nw�6[.�:�o��@r�������ЊCAT���F_�n�n��)|�d�Q��
H�i��?
�h=�8�8΍=U��UPC%Ӎ�.
��(R�ae*77=�󱁉�S�^�
-��3��j_
��
�Z�|>j�$�3�#a���>�׹2D���'N)�
�+ }��"��{�7��Aw�a���mŏ�
-FVCg��
�ԭ����)_����'�\G�^����\��1B��g��n�\ڠ�NY�
:��Yq�&�Fa�-��� B��S��f���7�G	#S���
٬7��E�� 9�D��M
-G
-�20��Ci�e�+������D�����ô b�~#����z�'�\.���F�է��]xv���i�@ I�8a�=�z[PjVkn��w|0S��t�h�m�ل֩�H�F��@0#����5�jN�1�-�R�F;p1jվ(�֙EHG´��i
�;i�`
 {��&4X��s[4�I�
d�!
޴r/^�a��@��Ƕ�?Zr�W��U��PǗ}2
��di8�ÍU���Q{?��b:���H��l�D��
�0ձ�vxk�ڱ�ʜ�

ו��^Y�"Ƃ۸���8�z��Hح�(;�����_۲h��a
�
-�e���f���hX�R�iqV`z��!��9s���}���g�z^���A�.a?�S�*To
-�W�h@�+V�C�`�x�k��a�<��]a�M�:r�#�`[�{���T�|�W��$̽�g����+�xآ%��
-$�*^*��w��+�M��M1����Q���o*Z6�P)�P�n�+T�`����jV�
-	�
-�,r ��U��W
O�qj�T�M�J�p/������5쐯�kC����u�%��u_(�@�3~Gvig\��W�A�^���j;+t,q�pLM{9i�I�s$��!w�tꡎ�+�!�HB�$���� ������d�_
d7e"�yξ��W��w$����+N�n�� 8�uXl���W(��DY6�~٭����Ȧ�<6��IJGfQ%?4�
�
��L+Bt���{1m�8�MS&L��r9=56*�Q�*�RȾ�{O�C=��P���Yb���
���h��k
9K,k�8�n#�f:Vl07�:��+��i�v,��~"[
�k�� :)��
z��U����3���b��X��?k���1�G���f��σo��?Q��B
-endstream
-endobj
-195 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100335+01'00')
-/ModDate (D:20111106100335+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-196 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-187 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/ppl_logo_no_ppl.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 197 0 R
-/BBox [0 0 640 640]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 198 0 R
->>>>
-/Length 2432
-/Filter /FlateDecode
->>
-stream
-x�m�]�$7���y��%R����
-��C��s���ʬ��6
�Z��"#�d�u�Tά������ۿ����_G>K>{���gM^ο�8�s��(�czʥ����z���-U[�%�b�
9'cYSu��ó�T�*�^���δ��i��O/<��Y�J�8�|�6�i�G����T�2
�Q��R�RNk
]ΙϞ=��ǟ\�ۡ�Z��~��(�����YZ�<k�-����5k��Z��Q����~]7���Z
F���~��f��|����B5n��1�Sֈ�g
�
k+���㨥���h}�Sd�R�6{��X7S0�>��zʤ�@�����X�k���bq��x����e��2�ݒ9O�~&3y�-�qN�\Vy�V6����׍��}�p��
FX��k�0H
m֖F�uM@��办®�M쒑Rqp,�񶖕���y���W�2��
����:9FLs9o���n�	��S(v�A'{��� �\w|Q���҆�<i=ML�ZR�%��
-�&�
/81���L�n������``^I���*��g
��l���q��Ǘ�_� ������Q�Ov��vT�p���в8>���
d��o�ўAC�+���
b�8�$=��Zs����	~�4��ɓd�7^�ۣ�� X�~�����>�v��Я*�6[�h�b��h�G2o '
L4��dV2��?�i=�kq���@�7Ye�i���
�|G`ped�m��ڵ��\*'3�	
-�V/#�0�ۜ��!0�x/uA�N��ㄵ�"3 H�W�
v"젰aC"`� 6����{	�T�g��H]~!
b��S'����Z���>���]<ˀ����'
?��M��������
q�K�ؓc<1�c�3����x�h�H/r�ђ�'�
��(
���4��-0Y�~�BJ�1L��	�
^,t�����

"��bQ�N�b�3J"�� ����B	���
�����6\�h,�0pRٖ��Ѡ= Pz=�%�B�Mޑ�>ؙ�/1��
#��@ңvR��`r+pB���{Qo`
	@���_轁D^��j�J��H���(�B�3qy_�
�����G��K�cG� ��-TlFq�4T�G08��2�
�,E�
⃝VTD�
JY��&x;w+d�H\��)SU�t�����_!ԙ�q��P��h�[z
I��f�Q�M�sTQ؜���"�Ch&,�ɮ� ������M�k���C[�}���<��N�Ӑ7�}���C<;�d��./�F\KXS�>�"�
-}W,T&w�>8�[�����
-wx�_R�O;��{U�⑨���A��Wn�_N����#b��,���n~v�7�hI�W�{�Zw�LV1'�HI(6�;�C���
JBCFU$�=z����Ԝ�� ��8 ��{S�b�wH�g�Uk"�n�)[dA4ohw�@M�z�|��Z?��v#�քD�v��V�S"�Ed��
�5���:ND
,��	��{�!���}����?>'��+�S�2����mj� ��A�U=�Zf�wH�x�d��y�J����H#��� �Ҙ�
y�NP�'
b���#�U�
�\_j���D�[���</������r뤈J�o���jQ�e
-��3��˵O�yK�b���C���C�a��!쩨.6%g�'���Ս��@�/��4qS�@
bgS}w�}-���Cw#B�ZD�k�B�,&%U4�һbܴ������!'QE��n���	�� )�rO��1
h���m@��P�&�q��S��J��Yn��PxV��S;uc��D���z�S�_b
���-�]���8,�@GC�U���$�
zٲ�4w����L�@ԁ���SQ�H&�0�tJZ�*6�?�R���A��e� �!�0nI��-���R��ʵ� ĞƮ'*اq��n/���u�!m� 
����ss
 =��-
- z�`�k�,�~�D�x�mC�`M�`�+_���x?�d�։U�uh�g}P�d�v-���q����:(��ڕ/�Ƿ�'��_�D�Q�fBc��/�fMj%�i���	%�8���U`�ԏ�a�l� 0v��s��DRn��h|�n�r��6pd�q�e�c�h�v0��Af�
���� ��jw-:��v��{�Њ$�&H��

�|��|�zL�w�zW|ׄ����_�N+��H�z)x_�{h ��\1Dz^ �Kc��!�aw�w�h
�(��.����
m��HA3À%�br�\�g�(���N�m��Ppn��
�88}�B?
-��?��"�`�����tu8��5���w\�S��i��h�R;�%{��.�L�
�
����3Lp	�rp
3Z[���&=K٣�E'h�>��o��4�	���^4�ѵlP���m�
�p#�י)ח�,�����M��ڮ5unT��7���*�G�F�Xjf%�A�H�K�;�4�ьw��
�JV��q��
<��d��������S2
�
-endstream
-endobj
-197 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100336+01'00')
-/ModDate (D:20111106100336+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-198 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-180 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [385.063 648.798 490.947 659.702]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
->> endobj
-181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 626.945 322.585 635.792]
-/A << /S /GoTo /D (GFDL_GFDL) >>
->> endobj
-182 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [231.464 595.308 337.877 606.212]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
->> endobj
-183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.112 583.353 513.996 594.257]
-/A << /S /GoTo /D (GPL_GPL) >>
->> endobj
-193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 573.455 169.87 582.302]
-/A << /S /GoTo /D (GPL_GPL) >>
->> endobj
-184 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [204.862 457.687 398.138 467.585]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
->> endobj
-186 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-191 0 obj <<
-/D [189 0 R /XYZ 89 770.89 null]
->> endobj
-188 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im2 185 0 R /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-203 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-202 0 obj <<
-/Type /Page
-/Contents 203 0 R
-/Resources 201 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 173 0 R
->> endobj
-204 0 obj <<
-/D [202 0 R /XYZ 89 770.89 null]
->> endobj
-201 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-248 0 obj <<
-/Length 1322      
-/Filter /FlateDecode
->>
-stream
-x��MW�6�����YD�[Vw-0�)�t�醙�c|&�Avf���ʶ
�	A8p�
Xő-_�Gコ����������=	$��^zz�J���7�����Ά�g�A���G1���ũ(o�
;7
dڠ���
���;�_�71�=�
��Ess��3o����( ���I�I�L�YZ-��5����z���3����?
����
��.�~8U�v�Sx "Yy�
1���
K+��
[+Gg�K#G*V:�Y���Y4.�O���ӆ��
�
�m
��p�4�}�]�J����bn��Y����2
0!G����L3k�8���M�@"�X�GG��G�g��$^�
�d��f1d�մ�4�@���[��R>��F�kFb)�z&%�˃������4u
{��س���=�Ҭ�*������Pj at l��",g�f����>
-�TP��k��k��Oy��̔�,R��az��v�&�/SƖ�It�C}[э�(�E�֦�0��I'��O5�s3
�,��|
-
����.B�W:�c���ߢx��C~�I��1r�)���Nt	����
-�[�����ę5���]��h��E��x 軞s�̙1_�vB3��^��u�;�
�&E�xXȮ�a�k���0⮆����~�Y�B<63�ȬF��p�L
3�����j4N�4E�-�=���r�h��.��;=��<7?@���M튻��	�Z=<et�TY(�pg<��g?Q�]���QZK*&�^
;��8�.��2&�i��/��z�l���ٖމ픀;��J+
B��
-�Q�eTi�����)ɫF
E��k�m�
�N	`�)WSiW5bW�J�u����,��e}

/4����K��^�!���N���{���J8����l	wb�NLG�׉#��K��t��>���ԟ��3
:�2�=�eaFv $�{u�x��I�P�^k�毄[Je��w:�F��?���b�6���NYC��tP��7��8*�s�LT���vbq_"����x�ؽ���O[6`
��"�LC
����ݗI5�6�R�`�|��ݳ4���Ĭ#S��������?�����JM�Qԋ�`����4w_�a�<76s����U/K��b��9�rP�V��}��ْ��%��mF���͝�
�����b�%7��$�.� L�d�+˰�?����zS4}N���˘o�������2�=�0T� � 4���I�}��ҹo^u�g�e�
`ɪ}fWYv�����b��x
-��|	X�_! ��{Ym$�'��Ŧq^|
�^׊7�p�+b�M��y����qq��h����;H�@�o��
�u
-endstream
-endobj
-247 0 obj <<
-/Type /Page
-/Contents 248 0 R
-/Resources 246 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 173 0 R
-/Annots [ 205 0 R 206 0 R 207 0 R 208 0 R 209 0 R 210 0 R 211 0 R 212 0 R 213 0 R 214 0 R 215 0 R 216 0 R 217 0 R 218 0 R 219 0 R 220 0 R 221 0 R 222 0 R 223 0 R 224 0 R 225 0 R 226 0 R 227 0 R 228 0 R 229 0 R 230 0 R 231 0 R 232 0 R 233 0 R 234 0 R 235 0 R 236 0 R 237 0 R 238 0 R 239 0 R 240 0 R 241 0 R 242 0 R 243 0 R 244 0 R 245 0 R ]
->> endobj
-205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 686.174 151.499 697.053]
-/A << /S /GoTo /D (section.1) >>
->> endobj
-206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 666.159 229.087 675.135]
-/A << /S /GoTo /D (section.2) >>
->> endobj
-207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 644.241 252.131 653.217]
-/A << /S /GoTo /D (section.3) >>
->> endobj
-208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 622.323 165.446 631.299]
-/A << /S /GoTo /D (section.4) >>
->> endobj
-209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 610.388 173.686 619.235]
-/A << /S /GoTo /D (subsection.4.1) >>
->> endobj
-210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 588.45 155.484 597.426]
-/A << /S /GoTo /D (section.5) >>
->> endobj
-211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 576.515 178.398 585.362]
-/A << /S /GoTo /D (subsection.5.1) >>
->> endobj
-212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 554.577 206.393 563.553]
-/A << /S /GoTo /D (section.6) >>
->> endobj
-213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 540.585 225.023 551.489]
-/A << /S /GoTo /D (subsection.6.1) >>
->> endobj
-214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 528.629 289.071 539.533]
-/A << /S /GoTo /D (subsection.6.2) >>
->> endobj
-215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 516.674 209.93 527.578]
-/A << /S /GoTo /D (subsection.6.3) >>
->> endobj
-216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 504.719 199.409 515.623]
-/A << /S /GoTo /D (subsection.6.4) >>
->> endobj
-217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 492.764 211.803 503.668]
-/A << /S /GoTo /D (subsection.6.5) >>
->> endobj
-218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 480.809 211.025 491.713]
-/A << /S /GoTo /D (subsection.6.6) >>
->> endobj
-219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 460.928 196.43 469.905]
-/A << /S /GoTo /D (section.7) >>
->> endobj
-220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 446.936 438.46 457.84]
-/A << /S /GoTo /D (subsection.7.1) >>
->> endobj
-221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 434.981 335.537 445.885]
-/A << /S /GoTo /D (subsection.7.2) >>
->> endobj
-222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 423.025 298.367 433.929]
-/A << /S /GoTo /D (subsection.7.3) >>
->> endobj
-223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 411.07 396.568 421.974]
-/A << /S /GoTo /D (subsection.7.4) >>
->> endobj
-224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 399.115 336.803 410.019]
-/A << /S /GoTo /D (subsection.7.5) >>
->> endobj
-225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 387.16 302.482 398.064]
-/A << /S /GoTo /D (subsection.7.6) >>
->> endobj
-226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 375.205 389.942 386.109]
-/A << /S /GoTo /D (subsection.7.7) >>
->> endobj
-227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 363.25 330.177 374.154]
-/A << /S /GoTo /D (subsection.7.8) >>
->> endobj
-228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 351.294 295.856 362.198]
-/A << /S /GoTo /D (subsection.7.9) >>
->> endobj
-229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 339.339 388.259 350.243]
-/A << /S /GoTo /D (subsection.7.10) >>
->> endobj
-230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 327.384 328.494 338.288]
-/A << /S /GoTo /D (subsection.7.11) >>
->> endobj
-231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 315.429 294.173 326.333]
-/A << /S /GoTo /D (subsection.7.12) >>
->> endobj
-232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 303.474 411.501 314.378]
-/A << /S /GoTo /D (subsection.7.13) >>
->> endobj
-233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 291.519 351.736 302.423]
-/A << /S /GoTo /D (subsection.7.14) >>
->> endobj
-234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 279.563 317.415 290.467]
-/A << /S /GoTo /D (subsection.7.15) >>
->> endobj
-235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 267.608 329.6 278.512]
-/A << /S /GoTo /D (subsection.7.16) >>
->> endobj
-236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 255.653 310.8 266.557]
-/A << /S /GoTo /D (subsection.7.17) >>
->> endobj
-237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 243.698 335.697 254.602]
-/A << /S /GoTo /D (subsection.7.18) >>
->> endobj
-238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 231.743 307.483 242.647]
-/A << /S /GoTo /D (subsection.7.19) >>
->> endobj
-239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 219.788 334.053 230.692]
-/A << /S /GoTo /D (subsection.7.20) >>
->> endobj
-240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 207.832 318.183 218.736]
-/A << /S /GoTo /D (subsection.7.21) >>
->> endobj
-241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 195.877 450.017 206.781]
-/A << /S /GoTo /D (subsection.7.22) >>
->> endobj
-242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 183.922 424.004 194.826]
-/A << /S /GoTo /D (subsection.7.23) >>
->> endobj
-243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 171.967 390.252 182.871]
-/A << /S /GoTo /D (subsection.7.24) >>
->> endobj
-244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 160.012 300.28 170.916]
-/A << /S /GoTo /D (subsection.7.25) >>
->> endobj
-245 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-249 0 obj <<
-/D [247 0 R /XYZ 89 770.89 null]
->> endobj
-246 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-252 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-251 0 obj <<
-/Type /Page
-/Contents 252 0 R
-/Resources 250 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 173 0 R
->> endobj
-253 0 obj <<
-/D [251 0 R /XYZ 89 770.89 null]
->> endobj
-250 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-259 0 obj <<
-/Length 3730      
-/Filter /FlateDecode
->>
-stream
-xڵk�۶���
-M;�J�	>Ӧ3��d.�
׾�K��@$1G�2>_}w�
�D%Nf�EK`w�oH,
���櫻��_'b�yY
ċ��"�$̼(���⧥�Z�X�T����/��W��}���~k12 o^�ݼ��&>�yI�؞n~�E,v �v!<����tZ���g�x{���	/�p�&4
~��0
���b�t��Bt�)��K�J���:]Z���~
��u�x��h�gEK�r�
5��No
U�&/MMSF���x_V��ֹ9�>��ׯ�[e��o�(Zք��fr��jo�e�E$Ε>W�V׵[�~<mʢ~�|��N5��x<k��
-���r�)4����
p��^��[����fx�)`V�۲(���H!=�
����?
V��D�@�~�xa�8�8��w[�H�#�������y�u(���1��  ��c�=2U<��u~0�֦��
-����-o�+��٫��V$�@d�
X0|�(�uGK�fG��-O��UM��>�僶��A ?���z���5��8[�Dz-i�陛mтZ1�⭴aj�Wp0�#�\2�C�hP�'=:l���t���q/Zxa����[�:�a�G��4BSN��;��^G�7hi���% dK�|���+s�Z�`��`U����j�k��
�7ҭZds�[�]i�F�lө�U1\B�x,ۊF��胜Wh
�o\�
��
�%�'�ڈ���������%Sw��{ھ9�����8�J/�UF
-Q�JU�Fi�YRn�F����^(�3J3F%�!�}� ��I��V��0>��R
�^����gM��g��^"}��}��Q���˪tĞ+�8JT��&�Gb��XL���s���U~86;�_#�I
-�V2��@��BzI�5K^RoK�rh+=ٮ;&�rXA8#��>C� �T�_�Us4���6$�.�>�kp���������N����� W��\�9��dہ��v��ޔx5�>�_�4��˜���d�6�i�B�΍�X�x@�
-X�S�ؙ�Qh$�QZ���i��^
{�H?�v�Ƴ��!{�jQn���R$�
 �s�����s���.Ŏk�*�����©H�/�_�m݂D��]i4M[S���A
RȱZ��$aq�q���a
P�pFk<��

.�� $�;+�$X�è>�����ӳqX��
-A��1ɪ,��c#��S&|GX@��AA�r8 z9�m��i���%�r�i��K�B,�iO�RJ��
�h5���7��E�de���sO�F��
���^���јO�r:�#�����
�d���lk�ai�	
��_��
��c��©|�t"o��0!x�O}P���8������'��d���K^� ���A]�[p#a�<�V�jzc���|
�h����1G�%

��*��]k�t����4�j[��t��4'���HSUbp� [֬9����)��&>����'(xTU��*5�_~�HpW� ��m��(L���00'���{��g�2�Q��(s^���
-�(U�M�
N�]��s�0�(�<�jE��~��@}v�o'e�s[��ذ;�b�w�[2 �M�n�(�8JY�q�
�+
�A�w���S�j�w�Ʉ;����S0�]9�� ���p=T�q.vz�iR���2C*Da��9��@<*s` ki�J\hU�a!��
��i�W��<,B�����A�k���H0�h�HY���h�l�
KY}�P$6��
;#��L���Ϩ9a;��X
/��,�JnN�*��
-j7S/H<���f�
�� zm�=�g m���ܜۆ��Z��� 1�8��g�
�Cvc4������=�5Fuk�n99�Q>k�
-,���K�-1�j�j�L�uU��;�*OE��v4�<��ͯ`�s��6?
�H_�ñUt�	�!��n�>t�+�ӥbȘq�
ɳ�d�0g�
P
�Sf�� QL&� �����w������
�i�}���[}�̟}*Jž+zp�a=�V' 	�	�I`CuS��3�

�W�;!
-�x�O�w��p�fzGLbVb�Ð׹��%��(}� D΍e��$�6�H�y��O$�
-�	�����u2\�
�A�$q8e�F픡��L������"0z�92��	�Ĩ�qG��"�
i;U��/�X�����`� ��2�c�B"�d��i&�a*�/:��
��&�R$��[
�
8q^�'�b!��嵥�p&�!��؍�4�	�	\�a5�H�!�\�!�e>	#s�!Ѩ0J�hgy~6t4!����x�iy�Y0�G��f�E@%������n����D�S;:���L� �w�
83�Qgj#(�t���\;��=����=Y��˩���
���Q �G L���'ש=��Uc�	Н��~x�@Y� �hkGψ�
���4y�	�
��^�-1rz9sX���no�?��d �h�p\m?3ȸ���X3���~�p
)A�v�.�xR�S�
���W6_ �����P6fG
�-ڪ���K	��~�a��ìr{��[��
x�h�ۢ�����#k�8�h
3GX�p�:5�&?1*�m�k
��7�P��Uɓ�l��ś��߿z��ٷ߿y2G���b�:o���[
�Lܗ�C��^�={B��0���M��@����3�Ӌ�Z~�
-�8_#�r3zw�C�9�`�}�+,����2^��
�gwbx`
�����\	@y��:�bټ�
���ەƞz��L�/�����g��`�a�=�I���D�\d!~���oL]p�{8���r��4px��ԃ�
��_��5�򇙘n#������c

$3稠�GjI�\)�
}j���o�	��� �kLF?��ɷm����s3.�4U�yUW-I��2���J
�{4�-(�bp7�
-�����8>a���o� (�7<}���X���Gs"(�;� r_�����
-#/�ۤ�XQ޹ʆ1Fܐ�i�e^����L�f�3ۑ��̈́���?��ͭYi�asI�E��6*
�6,}Y<��u�3IF��}V��
JJ,���+#Oē
g������q ��1R%�}h�~���8�d��04�K
)|�$�?Դ�!%Mlg�R[jF�k�T�Ti�;Tw	f	�;B0{�!
�Fa>��6]��vT�G�ke��S,HВ$
^Gª�pWE��1Ab�iS�]��f��4��7�o;�*����p�ׅ�ed(!W���M�~W�`���&���
(ZV�L^瓠�������:��DY�CF|'�Y3TL@{N3S�U�����`Ԅ���F��9֋w�����U2�� ����
�����O$.�O�~6��zs�q'�O�#�$'
�ߎF���"S���ߠ%�xuX]�'��`����q��7���������.�����Ma�#ј�k�F������Z'��=.u�7t�q*�>%b���?���+]`�n��j�w��	�08�W� ��/ [...]
-�?�؅�d�
Ӱ_�ڹO鱂�ɢ�-9w�ҋ�N�-�����*òtl1ӻo��W�!:��,|q�
-@�\

ڻ��`��O��^�O����S"��W�D�x��u�2�9=�S�Ъ��^�
-~��l�T�UEq1	lb�{���r�V��b�~�F��/�
-!1����4�/�>ݴ�ZCj	�L����rt#l
���� ]��ܟC��#L���I
��
j�'I`1�c;�>d��ۓ\������5�?�,
-endstream
-endobj
-258 0 obj <<
-/Type /Page
-/Contents 259 0 R
-/Resources 257 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 263 0 R
-/Annots [ 256 0 R ]
->> endobj
-256 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2 0 obj <<
-/D [258 0 R /XYZ 90 721.073 null]
->> endobj
-261 0 obj <<
-/D [258 0 R /XYZ 90 697.183 null]
->> endobj
-257 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F24 169 0 R /F83 262 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-269 0 obj <<
-/Length 3404      
-/Filter /FlateDecode
->>
-stream
-xڍZYs�6~ׯ�7s�$���}J���D��%eS[Ij��`fP�1�y�}�ȡ(�O@�������
6����wW�oRo��y$���&�6i��q���7'�����&L2��C���?����
ۮ~x���ʇ&o����M�MY_������Ǎ�y�y�N�&
-B�V����\y"��˒���S�7�����,á,�7��9��Ե���ݖ	7��T���UL�P�>�UP��7�|���&� �y�w�-�g8�
K��kUϴ�
���=��>]C5�
-�ZMo�����qs��']����'�:�bf�����N7�Lq�J?vE��<OG�I���j����*���ބ^�|{��N��k�+��4�e���4��j��Ge�e1�R�epa�v[?s$+ԇ���釢��x�a,�+m��%c�L�C�o���mn�_�+:�X�e1��%��f]YdU
mu9eA
JbHO���R�Hh�Ee4�yA@)N`|�N��J�s�߽���tfS��L-�c7�>us�b�"�tv�L����؜�B~�1r�cљXK�Q}[��@-u3?�ܢ��`���z�_����f�0���b82�W��jU
�F�5�[
��k؋��3�>�3��j�Nϭ��
k�
������P�j
���y��T�6L����<t>~�c
-Y7|��猺�}�ѷ���>mL駫��|/s����N?m[�hƮ���M'%��X������*]ʪ��,� �[�Z���=FQ������C�-��P����5L�?O�B����͂�k 1̄�s:�sj$νRL���!i�7$�ި����;ǖ�3L-d���f�:3G3~�"oEh ����r��6J,z��
�� ���6F�C��s��𛈴��e����:[hC��MY���@�q
�k���]�X�9Pw禨A�)U[��I�3��C3@ߪ������M&c�h���`1V���ׇ_2b?��8�
'W�(� /����Iq�4[��<.�q�BΝg��#�
���D8*��R �����mC��y1�5�u0/~�@Q1Jbc��<�ګ�3�X���J���Ty����[u?s�03۴Su��b:R����]��<s�i_)�%�	0
@�ؕX��zt?t���Ļ�s�
�\���c,���¹pq⦹o&�Y� <`����` ���3�
-�� @�� �i��q��C�u-8�X"D��M�ld��p�=���i�
Wh��y�r����ng����V� ���i�3�
q���[����IZ�ҹ�4p�$2�����O_r� q�Y(�$����nvѱt�fKa�R�$�D����,���,1_�'AZ#|;UX��٠,PgF
<���

�.��
b\ ~p�D e�(	$A��
n|ϳK̜��Q]Qq���� �%W� �7���
bzG�Pl�[��w�6�

-�9
%�K�##\	���	m����qந��b�f$��tJ�ݷ���!	��A
�8#b�kJ���	3��b�qN�������v��/�ʍz��?��[ڂ<��B��jt�
�9}�	�w�D%��
�$�a�5w��

��"22>�+Q-3���ӂT��Ad����!5�sLNG���ת�`�v/�(
�6�Q䛨���
�M�<�QG�;�6�iCL��:��]_xf!�%�b��R��x�l 'U1B���XUPhS��V;���_�t��D�%����O
�d� ��� 	 R ?�\�[��2�
�)�Z���|
>Kg�6���9F�|�����
N�ךɰ��ؙ�2���7����,�!�vE�����`U�z(O���`D�LN�|�>�
Ƣ��]IgY!4��&!�%��
y��l�H����^Ψ@!��W%�
�a^O���F�I�(��%�ʞ;^Z	��)�\F
=�0�S
�z�ί�
f�^K�9/�3b,]1�-�8
cI,�lbAʣ�Q
V��l��>�B`f?@
��K�Z?�X�U-}锧Va����2Fé�p~���>M$�T1�w�'G�ʣ|y���8
[�k��X��@�DQ����M�r�3\��*��z��.Ex�/X�I��D֗Z��|�s��qlHЇ�v��x�0G�Q

��ԁ
q�Y�| �ӹǦ3�&w [...]
-�S��ܛ�Z��%+
-2ܻ-����T�������.����w�P�σ/�1��<��L
��<�XG��Q�($�CQ/�(L�t}:f�0��w ��?yג7|k�����C�s�x�
�� ڛ	&˜��K�6-I�����~LU{b@����767�6�&���-�D�

�ؠ#�,LA�I���ጌy��:���c�o�q!��!����F�k��#9p�`�� ��=؛��jg�/�6�Y���Ao�r��;�~�h1�b/
�14-}�Cݭ9�^�ت.'���I[;��4
. at J~�m��cOL���k�N���ҙ�Y�SB��}1��D�Ć��\*�\�o��e�NIB���G�+�6׶�
����ؒ�y9�^qY���|�
��.�7�/�C0�s�
�g1��I+�̢���=�%{
�a�vN�v��k\f:3�%=V� ���be.x
�
3���@ۨv�͉Ş�x_.C�I_4
`�|���ᆳ�!Q�Os��ox�m��\�!��$@晑!	Ǖ���wg/�Ё�Z��\��tXhzpD5���w���z�«��MRZ�����<a�P��h^
!"u/��}+�A�>�7^{<��Kae�
�CT��3��S*t��!��}�����(I�A��?��F���˟W���iP�L�f�n������M�n���Đ~kI at 67OÌ�d����Lzy��/�Px-�
6e.�g/\L���
���f
C��l��
FQڽ���ř�Y�y���~
�jn��U�w���4u��>���`n4g/��R��i�t
-endstream
-endobj
-268 0 obj <<
-/Type /Page
-/Contents 269 0 R
-/Resources 267 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 263 0 R
-/Annots [ 254 0 R 255 0 R 264 0 R 265 0 R 266 0 R ]
->> endobj
-254 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [197.068 637.862 240.904 648.766]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/software/libtool/)>>
->> endobj
-255 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [103.669 602.619 231.19 612.9]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.dwheeler.com/program-library/)>>
->> endobj
-264 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [361.468 560.462 387.371 571.365]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/software/glpk/)>>
->> endobj
-265 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [297.062 464.4 388.718 475.304]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://fsf.org/)>>
->> endobj
-266 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6 0 obj <<
-/D [268 0 R /XYZ 90 534.558 null]
->> endobj
-270 0 obj <<
-/D [268 0 R /XYZ 90 502.537 null]
->> endobj
-200 0 obj <<
-/D [268 0 R /XYZ 90 502.537 null]
->> endobj
-271 0 obj <<
-/D [268 0 R /XYZ 90 397.689 null]
->> endobj
-267 0 obj <<
-/Font << /F70 192 0 R /F72 194 0 R /F60 172 0 R /F83 262 0 R /F82 260 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-275 0 obj <<
-/Length 3139      
-/Filter /FlateDecode
->>
-stream
-xڍɖ�6��_�[��u�\�Es�؎�3�f�s�s�HHB�-\��|���T3
_�@(j�R����߼����͋�S���0�<
7{����8�Y���
o�����~�U�֝*y�y<�&��{���0ɲ]�E��?�r����ϛ ��7���i�ɫ��~�7����h�m�hS�م|���Ϳo�9��5�A�
&r�u��W�"��i]4O����Y�'-��
��8<���:������{tk�~Е�u0o�0��Is�Mc~�:܆>�!�|�z
���Z�M-�]S���#�����}
�ӎM��
�)�m{�L1����>X�����t6D��Mm�s����৳��x��yU���Vy��A
J�M o:
丛4>+|��� �m�{s�u���lV_�'��4ġLر��ʼ���
�a 0�lD�|_۩
$��
�pnz�Y����;��
-�0�K��g�3�d?
�AՃQ%1VY�{������)S�ȧH�&
�A��
A�
C�i!���נyK�\� 
׾���}!��N��w
��d�z3���U�7a
��;)�R�-�
�o�@$��u���0&LF�'��J�Y�M�
#�����$��P�B`�D2p*���NU<A��w8/�k�l8��u(��%�A�m]��1��)�� S�ٟ��|u3� �k��'�+���fM
:��A�D>�g���i+8�
�8 ��~�hƕ��'v���ص�=�7U;��B���"�%�-�f'���,m�
y��'ӟe������Oc
->J��0��
��v;^�� :1��mK�-�F�<E5b�$| �"V�+rHv�@��G�K3��šj;�Ց� }����Xp���i�!��+=�+�����3��8�UM���vR�!����oq��NꦾG6-�JH��PD���
-�HHN�e߀�tv�E_L}���Z��]�
S������
�8��������߳p�\1��C��6݉�x|��2����<x����w��>}|`|�,���@�;�a�#Y��Hp���.�]�
���
_�0zdG=e@ �Y�
u�/%��z ��NrҦ͸V=*R�JDי�y`��$O֣�%�Wi��F`>�{_gU��TH��3FD`��Bv
 ��
-	�
!�_rfM��<�>��K�z>��ʠ*B�nVCk�������,�yQ�}fQD3Q�"����w]xÂ���
K2�J�x�GF�MD�J #'p���FQ�1
��^/T�
-A 'V����4#�1M��t?��3C\G�o
��iC�.K��<�Dm��7ȼ�-Ŀ��WMr�o�>�C+^�^�x�k��3c'�D�p8�Y+�
;�!`D��}�jAY�� �k'KdL����ٽ�
MD
)��g6I t���t��4�j�Fp��G�F�O�@%��X�T���,�
c��v���*�:vp�څ��tX���a�=f��� �D��w0EV<�����+�̘���:�U�[ev�L}��"�P.Թ��o��ٿ���'�S,z{xf�ux�A��
�w����w߶x�^��]�"~
-�(��n�x��E�+qf�x�e�
-����JBG����R���t�P��b3
-|�ӑ{�$^�y���7���f�+��P"�'�.
j,�� �v��x��L}DԒ)�6�HIc>�Z�(�$jٚHf�ª�w��%ِ�b���m��^���߾,�<�z��兵�d�!ɓ�W�
C��y:�"�f�

�L��U2%k����Ǿ�f���|��4
wke��U������9�l���r����d�
���6�
k �&��d��&�e%�']�߷!(s�
Է;ט@CK�Y2��g"�Z��N��1�a0Wf�-XJ�*+.�2(�9��fDx
-⓱�A(�ّ/��ѷ�zV��"H�o���t�͠��?�Xf

�p+��O�U��\]�����]m��ێ���cղ|3$
-{{~p�Ǖ�@�֝=�ɏ�G�Y�
�6��#{.�`+m�.x=T��"�1/[.�2q�{���[2�c��%�D�1��o;'��{3�%#jVQn
��?��ט��V�lB;T��Ԛ�a
QOH�<�V��#Wu��h�<�1�Q��?�1!~�PqoM\ !Ɩ��Ї�����Yh�
-�c��s�N"	5v"�.�T:6\B�f��b"����;2�������D]
I���:r�.�sR���d_b��zoeG�
��
� � ������m��v7V[��Fl��<Ꭵ#�$�����#��)� ⽶��:νmu�|F�~U�����A���qQ��T~����,0(�������F�Ϡ�eHr��H,z�V��������ƢS�����@Z
�ء��S��h
-��Cm�yWJta= �e�2qR0�N��5 m
ZI �*�SgFP�;ų�K\�&�-�u��^���
T s����v�W-���T�K
̱�{W�j0���D�'�
�S���!���-Ԥ.[�
�E�{m	�mz���p�\
l�_Iܢ�)�����7���ڄ�?�.4'(�u1��_�eR�!�M�2'��h��aD6�� W�����n�VAI�_W8�#�x�(��R	X:�+
 JU�FuҖ�Z�Aacč�>��]/3�.����^��][Ϊ�Kr'�`۶�����;
\U?Џ�<o�����@��-���Ử?$���Y� xc��|��Eaw�� �=�]ˁF�(�c�3���)���g﹆P�W��ҩ+O0=&�g(�X �`��S  �*#�v��*��N\-������E��c�6踁�]�~�H3�C'�+��5 �N��]�
�����6�I��AR�"��X�z^nj�eU*!�r����p*�(��&]�����i�\�oY��%q�g��JS���ʈC�=p�ֲd�ָ���
-k�GdטJ�
l[�5����0��]㫵���B�s�YB��QRa�+ؓ_θ�s�sq���
�a��_`�� ���(��+إ��/?�l�y%�w�	<�f%�~-��L��U�������g�`룊Iw�Aky'?��Ǝ�����H�p�cX"������ŋ�x�
촅T�yb1
Nӭ����ѧj�rEA2�������b�$��0�Oȉ� �p�|L��� ^�����1���� 	dJ�
-endstream
-endobj
-274 0 obj <<
-/Type /Page
-/Contents 275 0 R
-/Resources 273 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 263 0 R
-/Annots [ 272 0 R ]
->> endobj
-272 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-276 0 obj <<
-/D [274 0 R /XYZ 90 550.374 null]
->> endobj
-277 0 obj <<
-/D [274 0 R /XYZ 90 525.951 null]
->> endobj
-278 0 obj <<
-/D [274 0 R /XYZ 90 201.906 null]
->> endobj
-273 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-282 0 obj <<
-/Length 3179      
-/Filter /FlateDecode
->>
-stream
-xڕZK��6�ϯ�-TUF&>��)q⬓Yǻ���V�EBb>d������(J�qٗ!� @??�&\
V����o^���U��S�����<\eq�IR�U�?�x���/+�n7Q��"�����Oo�����O�7o"
-W/O6�vU67��* ��
-7:߮
hR����o�zw�ϛp~���$Q��"ٳkN]k��R��[�t`[���`8Zǭ�k������iL���2��OS����4�c[Ԟ�l���a~XGa`�������U�VI���ܣLC�*(�
-�y�:
�Z`I{O"
W�p�<I�z�Ѭo�F'S��a�J�w'��m2L�`;���=Ӌo���к��G[
�9���?�
�bW
�o���}?�.��PP�
���lm�8:S�
O}W��9�pa��|�V���L9p��*�-
��O��L���E{�N-s�ʹo�I��{OB�y v�_v}o
(�b�]7��A#���N��?3A-��q�-��
��
-[0?�
�i�?��-���Tt9����`Z���Dm�`��Tlp��J�z�I��]� ��o'�
-3I�8D�E��+���8,�i:+~����ǫ�3��!m[�#�
������M|.��w$A���s��E9Xt�Ov��m��t�w�PCt�~
 ���@xi�T��wB�s��4��Y'	����1��/z�^6`�	Ek��i�OӁ�����
9(�~U�"
0?�%�&��Ea0k�i��
��q<]�
��0��Ic���(�)
J� �
Z-��"b�s!b���S�O�=�D'PY$�Ʃ詥0
��

/e�a�Po$Ic�-�SmP�Y\{0Lz��	ڢH�{8�ȿ�*�Rh�J03�P�~E�\WZ�j1��C+����>3��r��R�4�Oi��ل䂗�hM���)kjoq�r�U=�EcK�
��r
-�	n�M�2�X�Q���%H�0��= s�
g�J��1�=�lX��ڛ���Qm:O�:A��w��
A��
Ȝ	U1<�N3�p-V�PhH��<Zr��vfx0F��� М�DR���� ��V��p
�pf�������`��
VGE}���`c
-Fؑ<��WG�+
��
7K
-����e|���8t _o8m�w
���
r��կ�H|�Ϥ��-��~��X@�6[qF
-�zq��-O��YR�M��
��� G�jG�:�ġ�;(O
-R�����ޮU
��΁}:�)��
-�7o�}O� m��
m��v ���Vd�����;[���:
c/�E"�T205
	&��
߲;�
isj�V�e�����83�Ԃ"9�B>�n3��̔RZ�'� '��F��b��
}����0;$9�����02��ږv�����x@�U=y8L{�����mce����Q��-EI�������*����L,��8�Ɓ��!��	@.�V���0Wu�5[x���j��8(f���r�4�m��w���Ąl ��3�jy����	����s�
Ɓr�+����2��1*w
��|jdR~h9�צ:x֢NhM~����+�_W!�6X~-WK$saN��f���)
]z���>�������`�`
�^P|��*�oL��,�G[A�0q*k8!G��S	�4/a�s|� W`R�1A�=�43#J>xx9"�n
sŕNX�
�-�l��XoZ#L%c�t�`��@&k
-K���UM���m�n碃�,:�.�_�����|�Konj�-��a�u��<�_��=�����<�oE����c�I ��x��:����R�A>�"u��⌟�&�V��8�eK���#�9�)8iz�?s�I��$q|�
��y8�|$a=���S�>�Ɯ�
7əi�
-�
bŘ �
:-S��

D�=�|p'J�_�%Д�i􉅫�c&IgoR��|
��,%(�f�����APO*a'�%��?�l!V&��]�J��HiF'�:����<kBt�v�Z��v�X�{��v�%q6�Q�/�=]
q��$K���l�
�fG�����
Z�*��hqk�
�����~v��b�LW>x���88�A%
�JV�MM�w�'��l�Ђ�q��g�t��)f�
t|
dYھ
�Gm�����J�
|�P<��0��_r����`lgjy:Q��<
�qǁ�v��t���T�L�� ��0��^�
����Ii�m
����-�
-�k��o{*!
��/���J�.�
��́4�y� �W������`o_Z��*>a�ؗY�
-d���*�"�/U�7
�ا�(����~
]���V�4~2WTt��Lz����_�a�!�ɱ���oA&5�pc/�b=�Mr'vN���
-}�j�c?�T�9wda���HV��i�
Q>�L�q�Q$k���
��_���[W �f��
�]՝Ⱥ�
�
��B������Q��X��"�b�p�F���ɝA E���)P����y��X������+#��	��?�@�E�V� 
M�wh��w.�:�x	����fF sj.-�&k
>���<�ѓ�ܴ�����q
-��\�
-�P�<'ť�"�PR�@��`_��E�b�$h���I(f�'�,��:)3��7FNQ��b�vxF&ٔ
22��ϗ�n"0A�_�3_x�Be]Y�y�3EЙ�����e.�{Ӥ���38z���qg
�����c+r�`�"��Ji��3���3��E\���E�u�ھ:W� |ýKF�Y����ـ����_�.�����|K>Cb�d0�<N)�?���߁�$_�$(�5����R��'6�"
��0��4S��h���LE�Im@:��T�S�� <�*fi.�-?ĵTg�N�7�
�q�
-Y�r�T�l�"*\�l9v�c,%��c������<f��
�à@�(��')Y�>��
�
�~2�8�
W-(��3W����BH!Nd���<��q��Բ2a�X��O�s !���]dd�P�W���&=ՑT�]/4yr�<"�N&3O��[����j�)���c0[g�$�N��FY�hpަA�F/^7z�c���n��홡��t�gz���z��ozY�~��N����+��X
d���/U at B�zv�0�Gю>��o��7!��� 
��3FD���0]�W�5?�VmT����8��o/^�ƃ3�a����8�6a��S	����7|��S�\+����`k
-endstream
-endobj
-281 0 obj <<
-/Type /Page
-/Contents 282 0 R
-/Resources 280 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 263 0 R
-/Annots [ 279 0 R ]
->> endobj
-279 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-283 0 obj <<
-/D [281 0 R /XYZ 90 495.818 null]
->> endobj
-284 0 obj <<
-/D [281 0 R /XYZ 90 266.607 null]
->> endobj
-285 0 obj <<
-/D [281 0 R /XYZ 90 116.859 null]
->> endobj
-280 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-289 0 obj <<
-/Length 3015      
-/Filter /FlateDecode
->>
-stream
-xڭZY���~�_���U�ⲟ
%VɑUJi�����%� �Z�������XY��B
������a�m^�����ŏ����,����&�6�.s�o��l��s^��E�Q]^�˻˾�
-n��
-��
-/i�K�h���O7���|��(o��֑����t��WoS�����Y�yԓN�]�Yo����ƛ�2^���]��K��.�cg8*nm��Gs�9����(u恪�b�v^��h�����}X��{�j>�7[?r���HG�]�7�UN͛���6��/4[-��TQ�+�
rrn�~�����T=�
��Y1�#�!��n�7���-M��V�
����m7v�Ϳ�>�l/���N���S
�n��A�%�^�]UH����}2��c����(�Z
-MY>p�j�/�f��
��q��b0����r]�,0�A�m����v��sa�*
-��AC�+h���������)(=^AA�`���4���Ox��%����5
�/ �w��V�:?�e���U�����ٚ�x�qTaQ���r1��m��`�B	�HfɬBc�ź���%̥��ĝ���WCS�O�*4D�ne�[
���"'��2��)�uy)df5��kO_=��\a�" ���l��=�Y��g�֥)U�0�Au�~�x�
�[~��ij/U�����Z����ƾ��I������qto�֔���w3�n��݅�k��~
�h>��]�ဏ^��~����0�2�^.S�
���S������dg��
-������Kl�h����)u�V�
񓛳�|Ps�N�4���L{��L{�fک�i���N�	��:F,����N��<eQ�6B��Y��������

�k
*�q���l�ˣJ�7���%+\X�E諸�O�jv�
�z����KթK��d�?36��	;��F�WH#�Av�
Mȝ��0kw
Y�6|��
Q�$�����8���;G/��i4��6M���)9?
�m�dȰ\�Tɼ7�ZY�bmew�	E{R�|��s��=� 	G��{�|���37�I
Ep$�{��:�L��
h�3
:)��\��J�)B��"�&Q_VTE��e�Q5�Ȝ��8qE!���."c�E���1���Eڱd&�(3�%1Z��,{n��n�#R(5������������<�G	��o��vŧ��J09
}�d
&�P9~4;N
�p8`�և���1eT���щG�6J<G��%�Nf�V������ ��V�������
1O�/�a]]�f���p��d�~9�B6ظ��P�	�l�^��d��P��`�I
��)���R3�N3.�檙�Y
�E�
C�iYhIY��Z�,t�pFtfVb�ͨ�5Oyˮ�{�16�Ƌt$���"D��Ϥ+����w�@;`�2{�8��e�=ZC�a���q4}N
M���0 �x���a�7ʨ+&A��#��L���� <�j4D�9T���O��\չ8��x�]����5�c�3��g8غDZ+��F�f���,�
-?:�N�Һ�
��BvcG�������J�i��ҭ����8F
-��KJDY/4�\�G��&��B�|7��v�� z��=𒙪yj��q�ԣ�o�^>�\�$#<P������8��F+�����_�Ӵ��$XFKw
�f��Nh��U�
-�9���P�z�S	�*d
�ʛ���$�
�
��
f�*X( ��F6���Bq��K-Л ����:
�b�a�ʍ
gj��<��T� _���TR6�7�L�j+D)
�;8�ν
B&�M���6���ޤ��^	
��=��YC�Ĵ�H�P^ؕ���
��=Y�n���єƸhpEeŲ�ۙe��+�rȤqq���^F��쥻�5Rx�;kY�q.dd�d��w�/�)_"�zY�m��-K?„�����B��n�lQ95
לq8s�!��V���(�_�e:�GK� h�
֡���������һ�[(���e�O[qB���5I�2@�y�5�g��(���#Y
�^��:����i�e��'�))�9)��Km��&�ni(��pyL�gk�����Ы�ݰ
�:�����W��_�����8�h�tI�U5�U'�ձ��G���:6�1��9a-�
)L�ӹ%��6^E΄9L]ϭ{<�Ah
N��[��y̼�+�)�03�-�Ls��i�r��,\F�(!��Z^:���2�7&�}x� jmO� �n5�'% [...]
-a&�d��$RìHM|��03�8�ԁ9
k��Йtڭ�+�JY|��ȥ0�a*cD��6�+��&}�$Q
#F ���N�~����en
A2�

���%��-���&g�"�����i�]z�����Ef�a<�X
�m�6��E
�������W�.�� �

��K�e'���ӄ�1ZR�@T�L���^n͗�eS��Ԯh�
ڑ󇖱
ߨa�� �� x��< ��σ_s�ѷq��w�>Ih.h���-v���cXHmXHL��Vn�,�2�f���uyԺ�L��,���
R��VWp�L4�
����m}9������

�Y�tM]jF%�hVM�(�^�aM�yLj�!
���)'&x�}�ʮh������t�c��m�@-�E��Ȧ:�����A��ʧ{�g��=-�k���q�&A��F0B��,��?!�7�$����޽{#�'���úp�o��7��vf3g���7�
�b����w=2�ki�:��O����#�\�O�C���a8����r�Usp�O�qq��^웵�K�""G�
�����7��ǁ������'�͘���Y(
/^����Zb�_�ﳊ5$
-endstream
-endobj
-288 0 obj <<
-/Type /Page
-/Contents 289 0 R
-/Resources 287 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 263 0 R
-/Annots [ 286 0 R ]
->> endobj
-286 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-290 0 obj <<
-/D [288 0 R /XYZ 89 770.89 null]
->> endobj
-291 0 obj <<
-/D [288 0 R /XYZ 90 628.972 null]
->> endobj
-292 0 obj <<
-/D [288 0 R /XYZ 90 299.073 null]
->> endobj
-287 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-296 0 obj <<
-/Length 3487      
-/Filter /FlateDecode
->>
-stream
-xڍɖ���_�[���9ܗ���7����}ȳ}�H��
E�9��ק6��
�"�B�P�
���]�����ǻ7_�
-�<�w��]
-�
z��}~����]��AT�0��o���
?���W�w��E0�"��E��/w��� �
��*wτt٥q�n���_w�p�
�>GQ�iR�(
-���5�3Z�N�����5̢�C%��CH���C��5��0|:kn
���z�v���F�GAN�8۟���O
Qu����i
.e�6�S�&�0�کZ(K�Ө�V����F�$�}}V�!*�O7q��ګ��(�4�v �*�X���C\�
�[|���~b�e�� _�6���u��f\���<�2��+|�.�z>D�^���q��ί"�4�
a�h_��N��Q.I�	$8<dE���!�E���{M���0qcD!��v��ڂ

�q�Dv�"�x�I!� �(dE�m�
��Ng!	�7va5+�rҬ����	A�$�Y�@�N��j1���*BQ��x����0~d��#����p��r��>{ ��j8\o��4
��j��
��ZmdŃouBA;�zd#A�b��QAU
���(�W5N/l�<Bzf�^�q2��4��b�����o�v��js�u��q@�?�
�
ޏ���E����:�Ww��
h_=�Co�ߓ��c�
�B��a���бb�(���`
��
øoV�nsc7|���U����z:��Ʀc�P��Q�[��$]hݜ!`�C�.����b�pe*�[�A^Hf�1
���ge at zc����Y-��گ���r�m��������
�t"V
�A��W�^x�Fȉw��K	n�σ��8	�*��1J�W�f��+k�U��}UZ��l�[������?L��y��zsi�M�@V+mƩ|.��� ��,��ג6��Z�J
E�f��2
P�`��LO�X��O�u�<_�j�Q��l���C��G�I��p:
�Πt�p5�w;
-��O~����|4l���R8�4��b��\T�
^�hp_����+�ﶝnI1#)��p�
�I��9e[(D������R�d�F.q`
RW���L������ƗC�qx	%*Sk+�!��
W��o��
8'-�*��_��_�$p�A
g���
-�0����A��84s=0e 	
����)�"�ђ�V�|�xׅ���̃�z��zk�ЙT�Բ& 	���'�d� ���m
�!�0Z�u/ܛ
eC��2�
uJ%mȻ��=.2n�
��Nh\��
-�fVX(�XR�0�;�0M� pl9�ӌ�{� Ѕ�
�f�
0_FI��ԍ
�ٚg�u�&��9�U���I���������&�\95�l�1
��|=L�C�0����X�@8<ɜ��6�j���
�?�7I�$��>�]V��D��cs�U��e����W�ӣ��;%�e�!%�Z�"�D�
K����l\֘�1���p�А!ml}�'�
I�q=�KZ�/׶F���"Ɣ�r����

�d�}
�;e��wH)����斒fBfR����$b��F&�GP��bj��h9���q-�W"��fR�giW8d�(�aG�h�!�JA��Gg�
���I:����N�Y��BR�""�X��� �s�J6#	|�b�� ��������/x�
���n��a�j�f6���qk'��?x
c�g�r�&)ړC�^���jq��NrF�-�鵲X�h�L������Z���]B�:�q���
� �R��P��0f��	�6R!��T��CCBI��j�@bnj������#�=�p�eY�r+�-�f��{���,��e
���S��I�(H�doI��4|)C	<�[f
޺Y;�K>s�U�
����"L�-„�Z��R��7�{�! ]H�c���%=�nr3
Yi�� q-�n���dRH��Nb/[
���E62�����ZMOy03��'�/O���vS�6��*�Z�>2��A0��V����ɑu��@�� }��`
�&���Q�j6+�j� [...]
'[�
���}/��.�^�D���_�
D�p�	';(�ȣ��/J��6�n�6�c��K�赔
q���)3 4e�a�!Js��"A��*�*�S0�L��.����"),xm#�c�i$9�sZQ��l���KBUI���?P��6�VK*�j�2��˸
�z���ŏܕM�+N�*2�?��
k���Pn�;.!� �G�y^��
���E�t,
.^7R�N�^
-I	�B��sB�+�VՆ�6K��X��;��(����U�-�^x�"�*J�=��H�p	�r�xHL+��"JH��
�@�z%#X{�1w��qv 4C Kd͗�&4���(�Ɗ��(�{RG,XR�beK�؈@���{�H*�ȑr�H�����E�S.ٲN&6�T�kGɣ3�ԏ��H>��3$<Z��M�����Q�6������dR7�J���+ �w�1��g���XQ�"C�_�i���llS*�<
�-�J3{s�B���R����ڨ�9.��.l���
慍`��`����{K�;%��r�^AI�~vh��K�
7�%[��
-�/��g^Hb�nG�!�;w|�+�sI r����
��ˡ�,�|�F��3�,#���� 
�&��+����
s7ݝ�
�
�f��R�Fc�?�Ƥ�)W��zmH
��ĭ1�nƳ�}��?�C�Js�?Ν��'��o{�P�Y����5�m��$I��`oL��q�i����(^�Gm�{�������Y8�����|���t�)��W����
�J��z���_��Ŗ�%�.@�
�Iɿ��b�[���Ne_
���ТF|{
U��
-R����
ʥ�q,5�Z����v$�S勒ko�����_�
c�I�qz�3FԢ�}��n�+�����?����UT�jċZ�>y�	@Ӟv������e��� ���A
V��"��+8�� A�E�à-�����^|V�Q zqD�����P�@�#V��ɫ��5�\^6��ɝ�&k
�0Zt6���M/��
-�;�)�L��%�Z~d�A[^	�U
+���u��
\
-�1&���B�Ul�h�D��iu#D�D�$ly�bA �+p0��8���Ж�*����Ө.<��X���Ay��9���8���
��nu�
�[��x!wU�i��E���}X=��;�d����2 X^�[Y�]�� f�p�3�
�f"��Q�T}e���I�C�����eUR��B��ј�M��	�C����L� [�SPY�kB�ml�v=�QZ ��|�[��(��"N�߿y�"�*�����(¨(b��4h��ͻK��� �r@�a!h���U����*	�8����,�����V^�T�4+����J�_a&�������g�]1h�jJ�>
-BN�!��M[�2������}��8������<M׿�ys���'[��������<�s�/g����mlu��,%�A
-endstream
-endobj
-295 0 obj <<
-/Type /Page
-/Contents 296 0 R
-/Resources 294 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 263 0 R
-/Annots [ 293 0 R ]
->> endobj
-293 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-297 0 obj <<
-/D [295 0 R /XYZ 89 770.89 null]
->> endobj
-298 0 obj <<
-/D [295 0 R /XYZ 90 130.877 null]
->> endobj
-294 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-302 0 obj <<
-/Length 3084      
-/Filter /FlateDecode
->>
-stream
-xڭ]�۶��~��J��h$E*yr��u�d�ƙN����N�P�LR�^}�
$HѮ�r
`�߻:�yܨ��?��{�}�6�x�ӻ���f�6E���
������\E��E����y���P���o]e��¤,�2*��������>�%p��$|t
�:�}�Um �a��t_n���t
-�z���?�TH�nIe��I�D^lwv}�ڦ�f{�)
=l�����>-�h8Y
�fp���u�cg�8�Qg��5=�<��$�~�?�k쁡��0����~ré��
��q�G���C˛FZ����x	��w�Ã�y~�x\/��x�_'��9*���+tT��6SB7�yfß��l�@
���b�dz1 ���~��x
_�Fg�O
�0X��^�I<��2�i�I�i8@�7�X"�x�Z��NQx3��G���e at 0/M�x)q'��^E,@�b�?�>�\�
h"�&�E�Ǖ�ߧ�

-�(k�����iL�uBT��y�$�� ��QwYT�n0<a���
"5@ IA����
$e#<e
oL�y�{� �ʘ�,��Ԧ�M�|g�
@h�y��35J`W�>T!� �Yy�
->��_ß-D`��8=�|~rՉ��y'�f�!
�2


r;D1�K�^���z2X�:�x4=}�j��~0��5����j�D��y��3]O�B�G��o���|t��� �����:
�lb(�s�P �
-�t� 
��qMp�
-N�s���A�Hr<}�u��>خq
�#��E��鯗Km������
�/��#��-�"M6�.��r
-��D��Z�s�����@�_����;��@�4]g����dm�����v��Վ���U�i�Z��`$6[��=���o~E��bo�A ;!��r�I�8���~}7�����~�>Nu�e=x���?!�D�@���¨c��
;:�:�D�y�_l�>*�Y�2���P[F��xZ3F�����3QO��a�d�2�pr�׿|�����;�,����m�]��-x"�����4
o��7�
�0�
�FB�/K���0�9����~�w��(5�N.����1��Gw�Ȍ�fA`�I.�P���C��d>z�~V{��<��z�8Dd����7�g��\����YxoFI*Q��3�?s��
P��0y÷�+	o�zW7��
���eh�]��.�ec�KPM��
=�
Ƕt�n��y��:�a�i
��U��
�8Σ��й�BJ��ks�h���9X�7�����
��R�8 �۳���!1���b:���q'�1����m���Q5��:ZN
��ܐ�T�KL	=|q�bC��I�!2[#�&;��:��R���<:�<��5z�X3�*$��d0O�����`�<��^e� OU@򪆫?����|���,�����W���쿙i�TC�$Eᙳ�N����'
-�ׄ�Ӂ�9
@�uF�5#�Z�,' ��r�z��x�
-�s�֗5��j�G�'�ͽ�[��az
˳*���0\��׻����=juz�v�
_ 
s��CQ��
�Z`����8
�B�s��{�%��NVqE�92���{,�J>
���bV����:R ��;�7%��א��U�/�[n1��d��=FY~�X��|����=�=���X�`]I���n�
���h.
 �Bd�� 0>dD����r���W�W�6/���1��$$ Ʃ'�!?n�+e�+�؛�7��E�N�",�4L� ���=��,�ˮUZ���n#�D
�.�  N�Z��>I�I�0�<K%�1�o[ki>��<
]h��#�C�%���pb��dm阅a�
9�y	yc�z�g�>T����`�����C��0
-_�AD]�S�7�Ҭ�_�Ҽ<�KI�|K'����ěDJ焔
-���Hf�H�� �����liI�2�}Ն\�z"�|�F���,�>�N����j�%�l����U������X�-�:���ⶴ4#0s� |ѣ�B$�˟e���
� RQ��4{@
x at z��U�	��莝�gQL�ޏ���z؈��Z$@�W�3��
:]�w��:󠗈�G%�Z��������:���)B�ӏ���sB�������E�^�I�
�
-�Y��
��*�	�w�d�<̝v>�/Qc��K���ܧ
-
-��1�1X
���y}���Rm{ 9�}�S�܂z���%�PB��E�_Q^�f��L]�T�3��sA��j��2������3�Y�g��#��I��3ñ�������}"��%x +�"�^~>�4�g�Wg��=92�LY ϟK�
c�m�Lq�0rP�B!D��iI'3�M��Ō���_]�!�L(�� pa,�`�
�,��Qj���D�Ǧ�����O�V�p����D?�R�zﯝuO�;�S:��Ӽ�?͓$�Jc5�����vr
"
�Y
9��| �Me
�HD)Y͋���
����c���AJ�Q�L��E��ܟH9{�ULQ]u�M'D��������� �(�
-���'��Y/�t��I�� �@N�2T�d�:���/a�i
kB-�iQs��o��ΣH!J�gz��{�]�5��^�|��η31��L�]Z��	��ȫ��7�Ú��Gr���e[�_
�d�0� ���tv*
-Nd��_�aKk�XL��\:�C���e����Z`���p*��䗗��Ƕ���K@?2��)���^Z�!/S3]��������ޫg9�v��gj&-F<��:��w�JU���R����*���gƬXF�e!B�v��
-Z�
��r��ܒt��^
��.��څK��,B}�%į�I�e�haQ�?G���.�J��2,��1V�	D�M�q�[ވ��Et���$��/�a׵��$,��^���7U�EȚ���R�\�
�i}27�9���
v:.t�������a�oȊ8|�����ݻ�<��4�M�x5���`�ަ�/����şXx��i��1�I؋�=p�*��Zy'?�
�oD$'���>�%"�4
�o_�x�>���
-��&��6E�v��;���mg}� ;�{~�*�w;�9L�Y�J
-�1�1-��x��n^� ��?N�"�x
-endstream
-endobj
-301 0 obj <<
-/Type /Page
-/Contents 302 0 R
-/Resources 300 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 299 0 R ]
->> endobj
-299 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-303 0 obj <<
-/D [301 0 R /XYZ 89 770.89 null]
->> endobj
-304 0 obj <<
-/D [301 0 R /XYZ 90 225.816 null]
->> endobj
-300 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-309 0 obj <<
-/Length 3181      
-/Filter /FlateDecode
->>
-stream
-xڝZK�۶��_�]�s|e$E�;�q���ַ��$
\
-YS�5�Q~}�����`��|���in�������o�pS슽�o
��"�dI�K��;l~
���?l�}���=�!�뿿x���#�ݽy��|�P��xz���My����ps ��p�晘ΛD��m6��q�'�_�$�vQ�{>l�00��n�Xw��^eI�
��n��קj
�=��3�X�B
L9�?tF�m7
-��a�>V�h�Ҵ���q<�~���UǍJoU�����0oJSoU*�I5����4���-'p����:�>�ݙ[p]n�
��7��;>�n{�Q���欬�<)R
�ieE+��u+
�6��C��
��څzS�È
� )�!����,uh|�tS/�e�Jh2� �;ޣ@�R�*a
�YZg8F_�{V3���t�pG:
�T�����@1s�)&�2V�0-��Z�*xU��i�m�;�<xOw��?���Q��;�]���^o�(��nO�M* g˸2
�]%�8���

��C
��W��<Pz�9�P�8��BcŁ�(��-��Ư}�.�'N���}��-��"\G
�B‡�;���ʚ������F�����wO��M�8U�^�f�-;<�/
�gܿ�?1gW�Sߓ�qp��\d��in1���Ћ��#L���d at 8`A�cwOmb
{��z�9At�r��Y��#��rCbS�
�~=�%|���޲�SI�o�G��
-`�=�mh�Y��T����6
-*�[�-�9#�S$�#�w�����Dd�T�f�����G�<���
�
��y/<�村þ3�5
������;j��lu{�痭��	��>��4rP2���g�"���P8�x�� >u������/d_�y� �����a�����'�=�%�z�%�_�X#���K���%Q���
<[�� ͜D�e��*pcc�\�
����D:|��+����F�-��5 &h��`�]V�,�`��!��5!	�
MB,�U��_#
L��0��x����nr�7,�j

�x��[��ݬ)"������� D �B��E�G�=��l����#�y���,������1��8h����2�M��M��M���Z?6�YЗ�\˴0P�n������E���h#���ܜ#4�<�c�8��j��v{%۽B�����T
�X�(�(g�gT������0����x���:`]���y�.{� �Go�ֿ��C��
= � �Wp,�' AKV3k"${J��[���-x_X���XD�
��W����L,3�⦮L�=E���O�ir [...]
d�
�0
��K�!
�-��f�Z�7�
����i1�s�s;�|���V
�LC��T3ބ,�"?�M�$@�l��bI!b/dS`x���?��8�\e)�K��X��}����ĵ�dVx�
Q��g/�e�Pi��Z�&;PjI`Nf\r̈^s�ZM�}sDI���tؗ�f
-��"��0�
��d�g��~�8g `���_H��E
-�����Z[�vɫLA�i+�)��F��CӅ~
-C՟�ձX��6�"��
��[���|2
>�2Nm�
'V
�i��9�I<�b1v��#�
��>
�j7�� �4C�]by���Yl%�rW'7��I�r����@��C�
�Ab��
	�S��<��{��X�xN/��u[6�8 i��=��}���̄N�����F�8<s��x
�z��"������X���d�
�J��v��H��we�Y�
�C)#�v
�i摎����\��ƠI��KH�C=�����X���K��D���E��h!����#��?`�N���P��N(~�`�~�l���&��,h`����Ȁ��V��ِ}+�����&�Of��r[��w5��6�ɥ�g}
6f�梇�h�u�[���/
�ƛ�z0
�"�Q��x��E��\Ks�]�׺o
Z?H�0H
�
cR���q��c���Ŋ���D����O�?50X��-7��Պ��Cxjw��E�}4I��(V��%��73�p݀�<\�S����f�b����!L/��b3�T^�C�>�zH��>�^Cw��n[W��%�d2��Å._�9���o�ޑ���h��zf��N=�b7
-�DOada�a,	��"d�hu��ź��V^�“���Xz�Rz �-��
-)�qޕ�e�\�v�����b�P�b�
�$0\�z"����9f��f�1ܒ+�J^,�<zPhy��5�[fxy�̒
-@��L�]����QkVH����hEf��գ6J�
��\bH��j
�
�l����?H�� ��Z|�R�W[�[��2)�_�=GC ���1(��[`m���i��{cx%��
�a����z��s
-�,f\D7�6�%����*���c�ͅ^"G�Ԅ�T�.��)
P@���9��E�R=�m)wquV�{Q
-��peq��%���Yu:oQ;)05�8޳;`��1z;l����]	9n��-9+����ؕ��#��rN`���~��k� k�nS�ztF��Z���W$w0m'��Q�V�RI�J�չ
5��@c�a"�I���.�� }y�E���D�*�1~g+z��+<'p:�����w{���Jd��
!�+�(I��)8J��m��,��6�/7|}��?��3�T~h�|�v�r6�~pL�2�ۤ��Y�jk��K�f\��y��\��J��&���ϧ�5:<d��fs�L�b\�fljMPo����
���uv�\쏊
�fAYg�-9è��J��Ef��ظ.��tWx�|�K��~T
���!�C��C�l���
�=��9t�r���r�����Q���A
-«̜;�-8���0�?������aѸ��T-2��?X��.S���
ob��҂�����0�2E�~��
!�|{�7�t�ؼ�=�w?/h����Y�c"�.T�ݔ������Z�ݞ&}�ѷ����5�
f���M���1���'�K�.tP����?���� ��s�j����եǧ?�|�8����v`ط��<9�v�>�s���]/�����s����R�l
-endstream
-endobj
-308 0 obj <<
-/Type /Page
-/Contents 309 0 R
-/Resources 307 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 306 0 R ]
->> endobj
-306 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-310 0 obj <<
-/D [308 0 R /XYZ 89 770.89 null]
->> endobj
-311 0 obj <<
-/D [308 0 R /XYZ 90 646.255 null]
->> endobj
-312 0 obj <<
-/D [308 0 R /XYZ 90 530.071 null]
->> endobj
-313 0 obj <<
-/D [308 0 R /XYZ 90 308.971 null]
->> endobj
-307 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-317 0 obj <<
-/Length 3429      
-/Filter /FlateDecode
->>
-stream
-xڥZI�����_���*��F,�9���8J$�*e�  9%,�0�>_/��īr�
1�ݳtO�3t6獳�����޼��M�OB/�|<mg����o~�z�����~����(�MK���ɤ��Ɋ�+Љ� �&�_?~���ǧ/O.�r6�L}�G�&��~���� �q�~o������o�����'g���~���w]�d�{�;�핷Sި�9��v�a��2=���E��s�m�~@W����öhe\�
-��/�ind^̖eEיqªH���XCj�ޚA�C��,��3
������Ǖn�]!T�!с���09
��o��-�kS�>�����f���F�G��N�B�F�$`&	O��d4,m۴>�͙���"&���+ʓ����y�#���x�*
G��E��Ҽ^�تSp؞x�	�t��mo��L[��3%��H�
�?_�CW�S"S+T>UZׅ.�5ug:�#M������R|L[T��=1�L"�
�Q�Z��
����o,�[
u�QFh��uE#��:��론��Uf����'}���<���J�i�Е7t�
�j,�����H��[?ڟu�ry|�8���(��Pړ��p{���)
�T�@)G��.��x ���q2�`�~nb�p�'k�V]����z|���v�P��m
���l.��<����nC�d�+�+
-�O�x��X�DF(ݻ-%��en�O�Qk��Mm�LS5�BL�M2Gq�QwB*+�I-gt�s��ay�1|�*�ɮ�����(M�p% ��6�O�&ߏ+D��
d�w'r�I7�vCJz�O퇱��P���Г��z��
&L*����P�Х3j�-����Wձ�w��GE{�����5=��V�K
ok�]6���d��s�u�"�jq��%�ŏ�ED3wȤu.��V�@im�@��!
���
-i�R3� v�E'
�G!aB�H
b���G[H������i�Ķ6�JP�K	[
q�
!�Ҩ���tB6�$X;0Ƨ�o2�L�Ys�-�IN�:t��c��ľ��99`s��Ə���\<����&B6M�"��%{s���;�Y
h�9�� �0C�<2��Th��ܭ�yL;;�ڿ�WM�kɚF�fR qL@�a���T�N���I�b��И^�yS診Q���r�
��`�)��pغf3��	`!���ߏI�.�T�Ki�
���
�.�*2a/R���6LHEsC^H�V,$%�-S��&�C��N��`F2�֚�������)z2	U�P=��b�ԏ֌"�E�M�(A����&TUz�5Vm4bg%�{
p���$} ��."�Ls���e�HS[����Ԓ�J(�W��:p��3x$Z,��SHC� D T��j޷F�$�~�v�I�0C�����}���"M��*�L�
�|S�
M���9cC�x-�ai�:
�����g^"ϦN�Ph�� ��4� [...]
[��)uY*>V\�����EIp
Z�|����7�w�o�TWT�4A't�
W��щE���T�ey��3ԥx_oh ��
��m>��s�=Om9Z��4S~�,�qF�,G)r��
'�E�X�M[�R9N����P|>�Oa��њ��|�lIo|���Vn�Ei�8�=��ԏ��`~S]Q��n\y��D�̋�uA��zR�U�T'YK0�c�9���іI��Ys����4��g��8Sb�j>�'g�
�>�=�y{�
7�����
���j��i����C������c�H���۶(���~��rky��[��eE�����	�Sj8�$(pQ�e��/�^���
��7��4��v?���m�	Z���4
-��t{�"s��B�B�Xr!�Ɨ`����[��!
-I������h�^��\ih������ن���NwsfiM
�Vt�i��Rc�k%�;�w�u�����k����N:]g���Ӻh��T�$�~���!��P>ҕ�r
-���+̢��T캶@�e��^�
-� �fT�,�'��	�o�=��	9r�谦tŗ��� ���А|�y�f�(>�߲$�L۷D��	`Q�n��]qzl�y$�4%1ķh�n������<ֆq`dJʲ�z��k���Rr�X� Ap�-�']���D8�) ��)��dBɘ"�ݬ���0 x�6_K'z�h����R�T;Zb�eɥ\4�W�
�~LJe��d�jڙ[��K�,����8��ΠYk[�Z�(	�{C��2����{�zB_uD$ *�~f��5[�lɉ��$���鴋�Յ�Uq��:�#���œ`�p������nCc΢|8��s8�T���/��,
�
���A{�����e9�%*�MS�t�_�_2s�x4R�/6��
�e��7�"�
)Y�;�f1���Tb����
�TC�bА��%#��m1�
:��`<BS�H��
9m���.D���@��K�hYZ+���%B�kz��GT���"t��,-��� �1ŗ˜��y���Π;�D��doW�zr�X��u�Gpm�஽&��B,�7{kq�i$W-|H��=a���5���fqڄO��ў�vѽ\e��+{�P��r
t[H�����$�m������Y��rIb�U���,;��r����ܶ����\^�.���p
|�W�$��W��Yb�z��5�R7�9�����0�%R
;WX�2L0N2���˻�@[y��� V���Q֌|��Qt!����[b��UB[%!��zE-4ty0S�j,����D��6��
z^x�AB�j�u�	�Iy;��
��W�rb�ӊ
q�Ӑ���\��3k��&��V�\)/P��/�
-�Z�y+%>�e��k$_E�-kv��nYS�ߦ$(ߍ�^� �
�{��V)��w7�I�� U����i�:�����y.
4��f��N�Βq
�ʳ `F�F��ף�r+�
-��wt�6r�j#��6b*�������m uJ$����՗"�j��7z~7
5A�
�}����U_ �;֌Y���O�����Ɔ�����Y�|���A!��]��Y=Z�����Y�
�tJX��zc��ع��i�s�w�����G��{�0d�(�ȏ��BA�?�~r����Q�迗RhxzV�;
-@'�����Ҷ�?_eՃ�]1,��;tM@�
-�|(,����m�@���f[vco�B(yX���޼9g���
��1HL��h
{��A��8�Xq8�ۿhYy
w�������q#�(�mFځ
-x��7ip���
?=R�
-endstream
-endobj
-316 0 obj <<
-/Type /Page
-/Contents 317 0 R
-/Resources 315 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 314 0 R ]
->> endobj
-314 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-318 0 obj <<
-/D [316 0 R /XYZ 89 770.89 null]
->> endobj
-319 0 obj <<
-/D [316 0 R /XYZ 90 392.327 null]
->> endobj
-320 0 obj <<
-/D [316 0 R /XYZ 90 264.394 null]
->> endobj
-321 0 obj <<
-/D [316 0 R /XYZ 90 160.456 null]
->> endobj
-315 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-325 0 obj <<
-/Length 2819      
-/Filter /FlateDecode
->>
-stream
-xڝ]��F�}~�o���p���'Fq��Qx's�< ��	��d��o}������SW�WWWUWS��{�i���������z#udv/��FZ��Tˆ٦���k�ߢz�=T��
B�
/�7�B��y��w:������
{���ߴ��?�4�

{Ĵ�

Ƽ��t�uM��M�uU�y�i����)a�m>����b��2��R
�M�de��`5��2�ىܲ*߫xϓM��L/ʆQ�!M��'cc����Ӫ��}ܯӊ���
-O� i�Vq���q�g	�Q�=��F��{�eIZ��=�Y��Y
�ǟ
$���S��M¥Y�H���bs�U�]���Z$�V ğ ]���֟��j6��;pD�`��.`ɕ�j�ANj��&�<
��O�%q��
mD��.Kv��
�#Ypg㢹�6�� �s`"A q�ED$���V�)��:�`|L�� ���-K��j�n�&ݧ��}0�I�
��H�+<���u��
-�CZ��4��{lve��7�e9c hJ
%an��+w�eu�˛�����%?>��:2z�� �g��df6
Sn��0�(L0/E���E�mZ�/��jZ�1r��y>.��)1݁���U Z�}K��o��t��<*�����Y���Iy��Ye�;q���7�ٌky����
���S��]bT�A�s����\�sg
-䝦V[
����N������
���:xh(��NPQ
g{�lȑ��o�*.�Ͼm)��T�r
�
�x���
<(�C�C
ue�����<z��t0$�
O��rϳhqE�~ƻIX��ŏ"o�<���].g���V����1me��G�����y�-Q��(��ޜ�
�ƫ�H������~�ϟx�F���b��O������*�;�|AC��C�V�n�^�x��W���,���5
���+"~�ï~�XE�x�>�8�ѝ���֏�|�q0-���8�^^�+,�"�.y�{��?�Vp��W� 3��*��>�D��(��	){a?�6��/^0~����|�*��L���
��	�
�<'��W37��*X.BOe&��9��>e��(����G�`M��O+��251
���`̋;
��B�p���
����b�޲.���p"�2:�X�/���7�Ƒ�ջg>P�7
W/ޕ��"�E�G�ٌIso
Nv��yz�W̹��,�0��q�4e1��͖�6��YC��ei [...]
�����0�MA�K\��%�7`��x,dS� �W�D����[�m��_
-���\��F�Ι��;������q/������	J͢��_�7!\��q��
p���v�qAI����̗r
0�'$rqh��}q��PdOeG��.lO��
��X%\zc�4
Pl�z�xN��;
!�x�[�,��>��BT�����ұ»�p������Uˑ, ��
 �
�_5K��
%��"��-�zKzD�lA9�H�����a�4�l(\q����Exs�3Z���x���T
Қ�K �+�U�9��Q4ם�L���[��nJ�09V0�<L]��ʌ�)�\O8�%b1�
��%�H)���
-i�k�,����[y��Xm��)��j�
-m]N$c�(��sH�tbl<�:w�����D7�
��
-�6���V&[��J��:�H��
�.=T�Z�I#]�t�Ǹ���[�w��݈{SB'Q'��+Ja���?^	C+�H޹�"��R�)t��e�'�"�#�2ACI
���
-Y�L�9�UR$P{"�T���٪$IYm�A�o\j��e���m���L�5h팆��T�FS�d������@�'�b!2�1Z�!ʥ�ו}Y
���3���:�]��ЙԢ��q]����ٯrx��g
�p�X�W ����y2�vclY!\eQp�1�#kvL�D@�^*�C�X�i]3%�ˌAcĨ�����Y;�5�;q��"K/���w���{s�N���l��u;/��iz�ȟ>J'�A5�1�
7d�mip�M|��
-�w�yKF{��f�� ��Ni��_(��
��O�F��
��
-f��[�+�
�l�vt.+z�Bw��Df���<��}��L+Ҷ�6��K��Er��wf[S�fY#'��9=)
$��}�Ҕ�*��!b����u.�#����Z���Il9a׬٘���>"��.K/�f(�2I�vl���勉}����!���!�}Żz��,
a��6�`(�M���l�9=zn�G��x�8=�4�>b��L��^܂=P64�`�=(�M��@d'����hPij�N*Л�B`�&��)~�X��u��tD�뚨f/
-�FD��m�6 at KO��p,����^s�m
҉#�gS�;�I����Fϗ"��n����X˝hȝht�b�N����~��:5�`��fջ�
�.ƨ��M���i\7W��S���d��B��y$5�Pf�顬M�]Z�W�v{����$.���/�N�%hd�P��� �V���!KuL���C`k�؉���{�g��	 )����E�� 
�U&�LY
-�nk�Ɉ?Bh
_�N��K5��O
�)�s\
�M�Ğb�߶,}�ߡ�ڣa���3��������$y?�:����m��a����:�G�F�/���4݁-"�
���o�&%(;�{ }g��+[
9�(س>2U���E������LnT
fPώq[���xKG�ͱU�V�_
0��c,�����_W5
� �����������(�
���j��6X��9��˗��N�w>R��[�Ž�j��ʞ�=���� ���#���.:.�
-endstream
-endobj
-324 0 obj <<
-/Type /Page
-/Contents 325 0 R
-/Resources 323 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 322 0 R ]
->> endobj
-322 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-326 0 obj <<
-/D [324 0 R /XYZ 89 770.89 null]
->> endobj
-327 0 obj <<
-/D [324 0 R /XYZ 90 587.178 null]
->> endobj
-328 0 obj <<
-/D [324 0 R /XYZ 90 447.102 null]
->> endobj
-329 0 obj <<
-/D [324 0 R /XYZ 90 295.071 null]
->> endobj
-330 0 obj <<
-/D [324 0 R /XYZ 90 182.701 null]
->> endobj
-323 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F82 260 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-338 0 obj <<
-/Length 2679      
-/Filter /FlateDecode
->>
-stream
-xڥYmo�6��_!엵�X������M��e�\���8Z�m!��Jr\����
eɧls8���
��ڱV�c}9���]\ǎ��i�E�li���
F�[X�G�x�����35���������*�mdو&W%�n�L�5�G��\w���׳��ٟg.��X.��qbe���8�ȿZ����L+�|����?�
��K�{V�G�ﺮ
����u��u^�'�㌶�ZUbC
C\Vxl�j��E%?Q��v��DI�J.�����)yC_Q..TE�Z��
������)Ib�w�B2s��YmX"�<���
Y�J�y�͋<�v�u-�9.2�k���|P�v��VO��+W_�9dsX�WY����!>
��AMb�hZ���j��˜k�|�F!�lmg���x�
;�l�x����<9�Zmͅ����Z�y�W3g�]-���|���	���f����:ӻoL�>>N�f�~2K7kef�Wy*V����esh�c`��W���
��7�7�o��Е����s�Ȳ��Mg7��o�L~x~|�����C��(�����-/�^e
r!���.��q��W����U��d�j'�����{���E����>��'iy�{��aϩ��3S$}�L�g�w��n����~o�ʝ���EA�=��<Z��Q7�O<
-�/ %�$���Ew�XP#/�f6��o�k5��ў:
O�䈬����؀�����YS�U�7)y��آ�csWn�J���c�PMn��a�ul7�G
%k
����xc��K�D�<'�
^�.���
}��;n
��!UL����NEޝO�������f݈���
4[�'r�_�n8:Z�
�ć�Yj��/��n>�";IӾK���e� �7�u4�gp�*_�9�`���C����&q�(m'
��[s4^��}W;�d����� ��>�F���F֧�4�|��}�]�r8����mH�@�~x0���p�{^��=��G���-08Amb����۫@�:"���4�)9�u��Ε}
VŻ#�
�
�f=G���W@��og���51����%/���M�F�>Gc6[0�m��Fߖ<
���:��1b#�#v׵�r��(���
W�8Ѯ��KB�'^���8AF�ٞ
z�l"&�9 �,KYp�K����= ��ϗ�b��`��Ed��k�tV��4��Eʡ����b�A���/���p�
�ze.<^�eh�dC
�F�$��2
tԆ1�����]��5���ȊP��_gk� MM|'�e�%�(
�N:Ȟ���ڨ��ZB
-lj��
-�� �
�8����lLI��$$
PK@u-*-
XPรk���+��s�R�L̗ �LN�t�*����_
�I�.�
- �겯吥�5ݗ��sj�a�p}

�o;�oB��a�Ipq���a]^����cp!=��Q�OY�.C��`�n$vx����E,���T�U\�3��?4�Kh_T-����@3��'���d���Q�|n���T�$
-�ֻyN����E>�آ�<�H��⁠_�:������"���6�Հ�"/_H$_�|0���}2t,�lP��S��%�(^�C����,9O3߽��p���$
�J&k�=�RT��s�
-q �<Qk�m��������
-��˺�bA#j�
-��a7M��_��a�s��n�x`��z�
�~�o�~d�a��ڮ�B�j�>\�ׇ	X��Xm
{�l���
-;
����96�i`��H<�
l?�<�����	����q
��B�c
-"�
=`��QH���-ɰn������� �Y~]����
G�;�1���fn*�C�
H�Ù'�(WwaQ�
���zy����RrSf��Ѭ~
e�Ka�ۓ��󥁴ׅR�/UݴK��0���3�Ȕ���W��:�R��+������c
�"�S`
-���-"��h�=�fϢ[�/�\�`�H��*7�yc1K�X��+
-��
F��Iu0���
-����j����j �:)�
 �� E����2HM0�N	8�
e��SXbOb�e4�DS���+��$
�KOm��rW�zU�1\Ig� �G&jeR��%�r?ڜ�X��1�%> 4	9G��Y��'1
���ws�c�ʖ�[S2�헳ݵy/m�odꃶ${�h��
-���"'
���y,.���
 eZ$��7M��e��`YB�����
rRh�$��U^��:����]
�U���D���  �ӱN>=)&��]=5�ځ�F�Ѫ�
Z�
���7
qӼ��p~N�ryF҈�8l�%�/l��\��p�-��fR�*
�c&/
ݍX��Ð��z�هJp/�
��́�/"O�����]僱�B.�x��ǃfk��H�M��/�l��O�t��z��{�uF=��fW����ea�a at -X7��
�:/R��ب�+
�
J(*o� ��׽y����$���
ǧ{ߋ���)��A�=�*%Jq��-�$�f���DB��L�ڌ+��=�
)������;���~d�����]���|������W-�E;��ћnUN�g��� �_u��6b
-��]8� ����w��Qd7�l�fO��|���_�p��������v"��mUϥB�]�6��}��kG 
-Yc��?;:n�
8�����Ȅ���o���"�?���]��
-endstream
-endobj
-337 0 obj <<
-/Type /Page
-/Contents 338 0 R
-/Resources 336 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 332 0 R 333 0 R 334 0 R 335 0 R ]
->> endobj
-332 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [314.956 584.602 472.963 593.709]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
->> endobj
-333 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [152.087 383.427 321.452 393.708]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
->> endobj
-334 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [225.562 329.315 508.501 340.219]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/philosophy/why-not-lgpl.html)>>
->> endobj
-335 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-339 0 obj <<
-/D [337 0 R /XYZ 89 770.89 null]
->> endobj
-10 0 obj <<
-/D [337 0 R /XYZ 90 315.138 null]
->> endobj
-340 0 obj <<
-/D [337 0 R /XYZ 90 283.117 null]
->> endobj
-199 0 obj <<
-/D [337 0 R /XYZ 90 283.117 null]
->> endobj
-336 0 obj <<
-/Font << /F70 192 0 R /F72 194 0 R /F60 172 0 R /F92 331 0 R /F82 260 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-344 0 obj <<
-/Length 3699      
-/Filter /FlateDecode
->>
-stream
-xڍɖ���_��K���5�):�Y�vfƝ�Jb��"�3܆�۝�Om !5��E
-�P�
rW+w��՛�ի��J�i�ǫ�q���$L�Q
�|�����_�߯�x���&�����?��q������C�����6٭����_�U��W�6Hw�GB�V���\�_��ʵ�_n���k�k�s
��	v�sR�u~�x���/
j�so8=�>��{A*j�6]�;�l�;N8��`T�
U�_@���	}s

7��N_onB/u:S�eL⪻���Q�'���q
?6���ɛl�t=l<G
ESKā�.�ڮy�T���Ԍe��4�
����� 
3���yQ?0h8ɔ^UBWʛ�7jX:M�#���7~��At��� {3
�{B�鞰C@���eQ^.Mj^ZB��W�"�d�f�A���)�N
-��I���} Z<J�4ݗ�#w����`y�{�\Ps�o?
����;��<D���IפSb!T��P���o]�JF��
�ءi� c8��* �4 �`�f@�p�>�(=�͊V��3`�����1w֎]ۜ] ~�~��
��N����u�����
��$����Լ���x����ۏ�������������Ϸ��>�3���AbY�`稶-
-#d�;	b�|� ]~��`x�� J��<#��b����p��
pKf0.�?�Am�2�ih�*ۂ@fM�yꊇ���95%Y<��^=��#�\E p0�Z�����(��k!�=']骞a(�RD�+�w?f'��I��|�U�ٰ���o�d�����)SC�U��t���y`3hq��ن�|���cGV�vbZ L�|C�2���
+Ep������%�yȈ.j`D�� ���~'�~}-���f�G�t
9#�A1�x��o/��eO�
-P�V�_�I����JW-xd�p	v.����=�.w���ڈ{�À�pJ��
IbL�
��f\#���i��.G��2��f^C���t�#����on�TM^
�x��|υ�b�q�Z6c
*!��cѡN-
��(�~2�Fp�y�������v���K��f��'8�/��#��'p�s at 0`��X�#M
�H�*�HNc�}���!1Kl/`t��7Yu�ݶ�,�4���GuAs�p|"�u�����wpC�6dʨ
����A
���!�#<�Z
7��~Ճ>�y8�<�bg}�Q�U��}��m�J�W񧆰)Hۂ�-~�^�z8�
;`�� ���-��Zh�1h�lg��V�9��&�.Y9�,��/Р0sɹ��b~ƪ�v�V@�	\=-�&g����=�>q

�8�.̲D��
��D1

�OY" (aDX-��7r��&t$�ɘ�=�y�rj�
�x���,�E��<�%�=�ۄpk Ɔ�آ����0��0�)ݔ��?��5�}
��{�P�9��������(���E
 1s):=i�)2\9�3�}���d�&	��u�0}X�f���x^dK�_��=�X�p�4�X�AR<b�A$t�Hdh�"�@>�\����q��~���:�7Boƛ�hZ����_8S9�	�q �wY1�SQ6}�l�Ar ��L`۔iL`����%$���1;��a}[oB��>�,I���5w)�
- ��t7�
3�$"�
�I��͡J�_P��
�J	��y�36NIw��&�
^�=��N�BQ
?2�M4�~h
*@!H�
��MS,��^!� ZQ\�=��<Ϡ��pD�푡J��\�pL�q��(4��I��
u�l
�r���HBH��k_�B��K���p��J�&�����F� ��
����R
l9���	�Y��_�5�Z�v�6�N!��x���g���`�s��^����0�H/-�2�\�'=�$�R�Q7��݄{��v
�oW��@�	0V)h�ʉ9�せ��{�t$���|!c�~5\�?��1�+ ?P���vf% �}��/S�� yA.�����0���`r��h�9L��������Ks�7e����v&
�����{��0K1

E^�������y=�V��.���;@���
-�|M�r��aH���
�0��!����kS��ő�\� �e:��.J
�� d�7�V�:��TG���\
i����p�eDŽ�XUJ�a��
�:�8}�vϏ1�������%o1(����b�A��q�3e���32�B6���fR\X�1������a��L=���CN�	#̔�g����$f�c�
&゚X��C:/�}	` ��'o
�E����R2��rA?2����	O���$ �!.Uj�gְ�\��$a챊�B��27fy��з	2
m�5k�D���`����(o��v4ƥaL���)�!�y�?S�$��0X�H�z���6M���
=<1�T�yٞ���e���wl2���� ����ˬ
�t;F��
eR=�\-�m�q��k �0�	���>}�\h����꾌-Eq������
�ȌA<��<���AS�-��f
8P󥈆e<Q��I�>� ��@	��A���/
�"��R�֏=m�C,�ؕx#v/���&�@��m ���*<���xz��M=?�k? ţ
�@B�褪f4�#S�1�cJ��-�Wc��w�'b�A�S�����V�׋u���������ƶ������]�y�0
�B�`uV�$�=%�������-7��6�R�2K���n���������`�!�
@��x���f�
B-v����� :?�Ⱦ��?��'|f.�n���H*� B��T!��
W���x	���w�O�5?^s�b���+���J��s��}`��|�`O �Ɗ^& v�Y����{G��S�����ў�_��؋�1�QN��G�s��[)]����)��<��ݷ[�x2t�
Z
���6�]�P��x��җh������ƀc
ijr�iĶ'
/�M�)��

g���e�™|���x*�A'�L����!Sv���7E�Ӕ��Q
-�R���%������"���ߔ�9�d\�0�%�$4�d��M��$ `������"ԲX��p��+GX�;*�
 �SA��{V�/
-cl8����;�1 �k�R`}������Gc��5���*`�L����u�uy�JW[������E5��g�-x�|;���uX^��o��,'���P� ��$��Po!ؤ�����} |�O���F��
/�Qu^u���7?�F@��ׁ��
���ۯ��9�Y���d�9n"��wz�
��s:��r1 $�&.�%
ѹp �-
�����
¬��5�$qg�a

 �V�!qPQ��d�e�R�.
�����M	�Ӡr��"��5� N�?�04�)���8��״-
-������5Lܣ�
~䱇H���X��: h#hs2g��g�?Ms�Д2�X�Z����B�#
��6�bx_�j�o<i6:^�Ly�qi��TA�e��^">��Ag~Y#�w\����*`��s�ȇ��v����&~�g�`fM
�m��?Ӿ^�[�K��6
�9xu[�w
��� ������Z�M�`�:��`���YԲ� �ww��V��$|��-�_�2��ם�3��q��U�����������Bka)���t���? }{�;

����4
�7�^
�H�
�YS���š�d�ƞ�;���1�΢f�H1��%��q
�
-endstream
-endobj
-343 0 obj <<
-/Type /Page
-/Contents 344 0 R
-/Resources 342 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 341 0 R ]
->> endobj
-341 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-345 0 obj <<
-/D [343 0 R /XYZ 89 770.89 null]
->> endobj
-342 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-349 0 obj <<
-/Length 3610      
-/Filter /FlateDecode
->>
-stream
-xڝْ�6�}�B5/+UY2oJ~��8�lb;�Iv�I
 �����g����Ct��*U	h4�n�
z���[|s�������[�6�$H����[��n'���.��:���7o�ƛz�o�Zs�ɺ��Z��b��E���/��~���񻻯�>������y�x�n����߽E���&�mO�t^DA��⧻��q��q}��|Z�n��梳�7�
2��L�J��t����px�9C��4� ^>��x�
`�t�tىg����_f+�+u~�ȁ�^��_�Ȉ!�.○rS78���8擛z�cX�ۢiM}������j����q����a���nt�y��K�Sړ4
W��-�=�́��l)X~`�餥u5
or6yq�NV�wͽ�VUc1� �v��Z�U��(
�������c���ׇ�
r��:/�#w[#��BV�5�rU�Z�w�I���Ē88}��WWUVv�f�?�Ϫ�U�����JU�u�0������2t��c
!�2-�?�N	4�V�������0n1%���,��R�=�L�2�e˴'lW�H0�(r�)9��j��@Z�\�t���˸�IF�W��� S��!�d�
- Bլ��W���Hr⥩�+�IUk#��+��y�c���$O+ߒ�z�Z�>y�3e9���Y������;��q
�
s
G\C J�
A'�Y�D�b�L!�*i���W"���F� ��}� "_
i�ST�:�I&v��E�g
P\�w�|��W/~��_�{����7<=��.�~X�0���EҦp��]�B�
&:
��օܷ�A6+080+ F���
�;�-��`�
�Q���n%+TY
-����T�A2�3wv�
n�`��&V9a-�+���5
�e���uq<���6�d�lZWs�t�����F]�n	��N���00����s�
�Ŭ�ب5Мwҋ}�8"�%7�����.	��
-��K�\�P|��ꚗ�=��*�
�	 =�
-��(�#��l���3��"P1k���#p��0�@L�.D�2�#���٩
P
-�VMW7�G�$�a�2����@O[�R֡�h��x'�.]�|�y,=֡_cH��[�|�>��8�Wq�`q�k�"N��o9,qV��LY1��K��՗���0`�5� !وpgtz�IUG9����,�?
�����
�����(P]��x�؝��΁ɳl�6EƱk�n���z0���ƖT�ظ��f�p
SDS�G����6-���N���U���
��`t�@3�6"R{�Rt��&^�zs�K�#SJ�~)퐽�?u�8�h��[����o
?��� �B�<h�ٚ�t�""��D��z$a8	$��GP��D���A4��3��
���nvY�e���`�d�N1n�x�b�a��=�M7�nm�և�[AT��`�
�A<	���l���������J������Gc��k�i�9g}�ӯ�y
D��c<&�Z�LW�5E�2+��Ia*SX%už
����8x�)S�`tD�
v*oj0��?Cf�B�� 8�d9�h��3laoF�W* [...]
-�0S�*���
�J���l����m*>����v��v��@Dž�
-���@��\��H(Nh�?�j4*c������,�qP��˨1ZWn
�䰇c�<<��u4pM���o�)�c�BlI�F����BT�{N���{���<� 2D r}�/4�a �� �	6�@�����	$`†�_�=�	��9.k
78y,;�L�5v����������E��d�2���k'G�u�FV2��m@癓�{��Ӛ�Kֆ
�G#6��T
-N�~v6�UY�Qd
{s�x
�`8^T�����2g[,R�T&���Q�:��Fݡ7�T$�v��, ���O���>X���2"22 b�r�h
; �c�0�Jlf/H3��<�l/�Z��N`�֘��eh
��a����Gl��A"OK�-�&[
��U� f�M�}΋`��E��١?\u>8�U������x3�J������sW�\�JgnI��|K�{ԕ��dt�Һk�� �6���C'�\�ixJj�s�Q�F�s��5!T�5���*Wu��1%�U��d�l����/5�9̀�[e��<��x��6�Hw
��cLpI:�� ��6
z�e�c��D��DZ���e+
�����hN�9���߀�֘���rQo��[}�t+��6Nqk��FV�
)3J�\]�h��B
���s+^#]BP�El'��-W�pc���%`�W��
��C
���B�x+�t�D'K����0›���[�M΅N5��9j[�N��
���n#�J3�
-�&�ԁ�ц54�M okg�
@�@��9&o�!`�O�5kK��k-��e�"�կZqL�9�V�K��U%�Bs�1}��D{����C.�?�@Cs����
�H�J1� $wߺr?$�2��Y��:JL--C�A��'M�cuക6��}\\<����+7_��<3�X�5*���(��m����I�C�H,��K�G�6�u��_��1�/TG"������Û��^>>�{��TCn+GQ�.��클G�R�V�i��~09=q} ���{��l�9��l�Q�5Q2.B
����@��)�9�pS�
-��j{h����{DK���h;.���
KO�>AgE��T��5����8"1e
-+��_�OR
-x˒U&�<�Fm�*'�GGC��ozd�a��@n�GEP�?�{�C;C���{�(����_zhD�:Mj����i4���:�Y�~�(�Ce#r��g_��潡m�q nLj�NsG�AH�
���~A��Mn�J*_
��k���M��`��_nf��6i�P~�w�D�Vl����
=��#O�Qz�a�{Kµφ��2I�C��B
J�>K��7��B��@
q$���#a������l((k�v$.�`��w� �OII�
-N`ad`��A��9 p�JÙ��u-K?I��n�m ��q�����M[M�|g�о�ϧ�����
-2
vH*B��@a���0���\��I(��g�1�p`�@�n�*8��D���`ifP��
c���3n<��5��]t}.��~f��Ӛ�c��6���C�^}A���Z��
�y1���_�5�Pе
-E�2g
�FM8�
%3�I��d6�`9Ƃi�Y��SM?���=�)
)��T\d���
s+M�
��v�[������&��
��$t����C�J�u��a<W{F��N����Z�~,�,q<Ə����{�~啠���W^��d�K�D��]Q���1H�����
�݃����!�C)Ɂ�
��#X��=���P�+6��Q�~���I[:���
��;�v08�����9�=����������긁<}�#z�t�%��{���<+���Y�ϝ��߱�o�$�
���6����cئA;Q ���ⵁ��?��<~�\
-endstream
-endobj
-348 0 obj <<
-/Type /Page
-/Contents 349 0 R
-/Resources 347 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 351 0 R
-/Annots [ 346 0 R ]
->> endobj
-346 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-350 0 obj <<
-/D [348 0 R /XYZ 89 770.89 null]
->> endobj
-347 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-355 0 obj <<
-/Length 3077      
-/Filter /FlateDecode
->>
-stream
-xڭ˒۸�>_��%T��&�wr��ػ����IR��=P"4bL�2I�Q�>�	R��Z�D��4�~���q�~��������[en�x��[e�*	37��W�~u�p����U����0���߿{x���
q7/
n>����V>���$]m7���
- �^yn����DtX�*�o�����g�۬�~�f^�J|��}^��ٞ��׷�
-�߼�˫�;͎�e�q�ؖ��<��O��i���
�S����2j��*r>떻�>��b�BԿ�~�hXڧ��TW��
�F�{��t�i���6C]v$^ou
�̢�w��O��ոQ�Dl���M�0΀ĔL��Rфjv�<Ĝ
M8��r�$4$�}��*��/n�� �U�=�zFQ�3x7C
O����(�E�ۦ(Qʺ���׾�;��ʦ~� <�+sF�3���8
DZ�H�n�<gQbpZId�>���-+��Z9at�
׾���qߋ������4��/l*
�oP�W6䇾!���#�|�_y�ɏǶ�
Ś��v �����iy h}ˠ���6��<;���W�������A, 4=k�҂�\Fws�lb���%hޕ��\%��U��N�F�Lc�<
t�"����$u�]O�'�l	`�} N�f������N�<�cIV��g3�U�2��C���a
H�̭�?�6'ZE�S�����!����٣`�<V?ce&\�q�
o��@R�l,�ˁ[ݾ!,����.NB�����������E\/����T1é���g�x��uIR�� ܝ�\m��
�$C ��ס^v�����{�5���������7���2��:�
rR�1+�FU-z»��IY_�PB�+fl��`����|Ņ%���K������+�Q�]�E���Rv"{a~}��7ؖWK�gn,�T�,qlt|��I�u���`ԓ�Au�����D-�4'.��<��
i�!�%(:BDm����2AH�
F;=+mh�>�	�4J:oQ��[s��tV�(frErp���`E��xD�w��<}�q6+���$���]�Ơ<�v��-
v�=���b�	��x���
0��
:a&.
������Ԛ�ǃ�0r�9
�e��Èy!e�*b�nI��%1
c\�h�� :0��Eʈ
;���S�[{-H7�!3�."��ݶ-7��[67�jVt�24f���
[��9rظ����{}5��y���^hԺ��F�i?" �s���7�������<�Z��
-f~7���'�{v2�Hȇ
����-�F at NFa���o�;�:�Fo��69)^�
,��=���e��a�?�����ظ���
S3)!}3�؝�@e}ei�,�1Q�
�ܙ���—8���,�������~�k�I�
�3#78VU2a�_a5�X�I�Y��O�|)U
'N���|�tz �e��/#A
E
�)���(m�I��a�6&���=���ȴ'�M�
�hXM��5�-����t��P¬V��٘"�B���}-���U���|�����
m���o��˕�)�;/�K�:��3��z���c͡8�
�v�=aJ3ד;H��fa���l
@��Hn{����x�
7O�n�
�WJ�p�����Ƹ7�r�>A�6��
f���b������voC�I�M݃�Bkw�I*8Ղ���g�(\1
-�R�F����+Л+
-�z��8eyb��4�� ά����ۣl��vD�X�tL^�ҔLGب'�ل5�
	�L��������t�
ٜ�p�1����Ulx0�h���$!uWcR���bS:{}���x�o�6t՘���JS
(�lېY�Ʋ
�{�. ������]�far<�`Iz#������X�R��C�[��j��%����ݵ�t,��5�Bq���%À� Tk/�k��=��K���۷2B����o�1�H+(��,X�\��)k��&�]*U��ޛ��j����
-���B��/%��@��n[���CLA��q l*�&�O��~&v	v��g�,�@
-Qێ{C���]
n����T,���`ߴ�͏G]\1��1&�֧S^A��㾈R(@�M]��y��
9+;��4��9�(mE 0��@+Cr,�`E�L��
�H�(�w���c(��Ԇ��
�i�0�+ky� /�
��f62��XL$�
����KE���TK1��jCôEôX�}dR
A�8
j��f at sky��@ ].奓R^&��5Ϥ
�rI�m)_*�AZ��at#�>�:���dx�5'=�C�D�E���Q!�f������6�3�:51mjn��
.� ���ea��q/1:�q��g{
-
	Ƹ��Y�	��µ���p^l���_s�T5@ ��Rw`�bIC��������lC��r�h�e��0��R	�M��4ƈ�3ϞȦ��p~�]LyZ��,���<��²����u�����23\t*�V5�&�E���8ڄB�P�A�V|M�B%����H��̻��.F2Ň�#����^|'�k��t���ݗd�gUw��Uw<��4DZKR� �%p��lP�m)c@����%O꒧P�1%
h躰edaغa��z��?l@E�'�\!�O���R��uu��j}!-�`a�ˇ�E�"�"SF�Ǝ���[�Cj%�Dc꜖i7����߷��q/��<�
�+��?F�lf�8U!V����b0ȧpE��	Ј�r�Q�:/���B�g;{FR��
x�%B��� .s�Y�lR�du���m~7�E]���D�5d�)IƇR�-I���
��4ll{�)�R��P{�W;�Q
)
ǡ
� �Ӗ$1ek�=�S��	t;H#�S��;��f&��
-�~:�]���!��;Mރ'��
u�Y�K�th�嘮�3����������?�&n�яE�n<��D�nҌ��W�`u��d�t�0��8���(v�$H)���S�Y���l�Ç7�x.o��{��_�W5D�;�e�S��!�3�ۼ>�������zx�%d��ZD��
��
�H��;U�ʆ_S�}��g��c��Gw
�>ͯ&�N׋�Dug
-��.�_���t�q �
-endstream
-endobj
-354 0 obj <<
-/Type /Page
-/Contents 355 0 R
-/Resources 353 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 351 0 R
-/Annots [ 352 0 R ]
->> endobj
-352 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-356 0 obj <<
-/D [354 0 R /XYZ 89 770.89 null]
->> endobj
-353 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-360 0 obj <<
-/Length 3117      
-/Filter /FlateDecode
->>
-stream
-xڥ�r�8��P�2T�X���{��N�3�����ښ�%R6|(9^��v� H��T�E�F��/4䮎+w����ū����6Y�ǫ�a���$�6Q
�b������u��}���n�NYR��u��y/چ@�žl$��n9^��s�������k�+�ֈ6I������
- ��r7A��
R�
-� �������n<g��6�G�nOja�ɇ��v��+��C���MA��aW	y*���
��d���W��mڞ�vO�OBR�ڽ�
�ڏ���^�0�s��BJNl	s���T��W��R��`�W��,�h���#Q�m�E�D]�_E
���e�O�D}�x^�m'K�'�
x^��3և���_�����<��p3ds�H�t������6��s�7�~����{�
-t��󇛻�Q��(��
oLtc�Α/7q�m�MIP:8hX8��?�����H��ʪ̥�

M���p��G�\&(z}8_F.J�V�P��~��rO���,ߵ(v�6R'���:�BH�
$���s�h�() ��ZO(=l�f_
EID43j� ��3`��5c�z۬C� =�;q���
O!��6+�)OӶ D�8k�a
sb�U?��� e�
��z5�x)X�y�r��h�|�(�ni��l�kT��
[;E��
���?���1:.l��R�ޕ`�Ƒ 6n���a@�u
-]�`��r_�
��-�"w�D�
�g�zM��m�\F>�|�96T�8�����@˲�T{c VU/��m@,yE݅#B�9��Q�!�BgWҷ+�U�W� �G�FO��>R4NJ��.������s�*�)U�+׍�{�-i�-�2�N��
���VcZ���:C���B
p��CN;PG¶��:���(�G
-���I^>p�|��
LK�%�
��:�I>E<��E"�v?[�$U
�=s%��9G�O���/Iba�$
?��V�W��{��G�P��a~N�8��mƎ��/M��}lg��VV�W�	q�K�4C��u"�2�>X���s^r�ſُ!X�n��ڬ�t�r�b
&y>;�/��G�|��3W5%k0�=�ǹ�UR-�4�c
�;�����FR;�x�J`D�-�� �M��S��� ��{����c�u Z&� 	`)�Yg9��˜�`�XP�������OA¬#�n�$����
��J›��׺
��J��叄��v18[)��(�E
z��e^Y�_r.ged����R�~
��I�fLA���g���&߿�y����{ J�o���2	9��c9�D�	��۪2����3%-01��:6�<�4:�r���44	�4z:Ǵ�h8����^�G
Ŏ�%���$�P�q�@g�m�&I3̅�h?��� ��
�H���>:��œ.�L��j�WSI�7�h�Z'����Y
��<8�yp&\Ud1D������`���?5&bdB$:jp.��5O�A�
�|)�"����l�|�1*�GЄ�
XN�,
�[��q?����w�����>���]�
3][3%
zR8=�OYۑ�H'8�)	[�S�T����C�� ���OO�C#�
�~C2�0�Ր.
���кū�*�ڪÉ��rZL��F�w����g�J��u�Gu�ȗ:܅�����
�h�:)sg�HQ���i
�����'�_�{����kt�|
����i������������_��!���Vw���te��s�#>hX�zm�5K T�
0�z��\�CcG �%$�y�K�+�Y�!�5�`��Y}�;-�
�m���V_����
M��up��9c��)��q	M��h=��
-�D9T¥J�\E�/���Ҡ��$���#���@�t�	z��Ч��<E��&
f'
-#��K5�(�ᤖ���2
���VQLIBSj2.�ˢ
6?��!�r
��S4�چ�$���EW�X����O�����Q���*���T6f�����<�D>�򤼡���Tޜj��Z�	��V�;�X�@�L�?���_�?V|�7�t]�sųN��.ݘ�.a�ֲ�F�T��KF��Ƴ�ȵ�ž�>�=^g
�xc��:m׉�
<A��� :��"�e2c�:}��e$cȗw����%�t�e�4�]��$
ԍ���‰�
-�e�Rh1R�}C0ucA�)�
:h�� X��mI��H�f������h�|K�#8��eu�a-���I-�}8��1Cd�콟��$�
� �֢����m���mĞ��(��VfrI�|�UK,��B�GT��f�� j��h��B_��x��j��e��
]n��G�͞�<����
���V/��o����w������=�/'��l�A�ty#M�	]�KW5�.����
-���0��@����:b��9*��
zK8�\��JC�Y�
�~�EN��Lҵz��.�6��+~`�����
A'��p�O��G�]*KF�]��t:��S�q�} �0��Y�8,^H�"�ؿ�
,VcU}�Nx�
-���}]�T�ta�����
����ZE{�֌�v����*���ͣz'K�Sɉ���:$?�&��l�F�^E9h�X���]f�Ak�I�%c݋�Q͙�����6�5!V9~|
5��#�X��
�
��k�.�A�h7P��|ڮj���g�/j��]��Q^��9(���Bk���
��Y��
�y�D
c���*ԕl�U U�+�8CF%�ѓs��&b�9�X؏8Wdz���>�35�|��@���o
q�,U.j�g*��')�|=��O����t��]����XS�
]�7������S�w�
 ��$�
���^L
}���M�*���^��~��&�˜�Ԫi��j,��&�T�)�D]%f�Y��Cġ��`�����9�㳇D�2���~
r�S�Fj�d��3>��0��8@�y4ņ��}fJ^�Ql�t6p�������B��.��M�������x�%A��*	�
���L�����o��.��A������Z��J>��u>��D�7f�(�gJ�m\�3���,y���/+�����[,{����˧�?��ի�p�es��)
����$7��\�?���g)�,��n��y��#��ı�%B�z�n\/��n�A=��n�`u��A���/c��
-endstream
-endobj
-359 0 obj <<
-/Type /Page
-/Contents 360 0 R
-/Resources 358 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 351 0 R
-/Annots [ 357 0 R ]
->> endobj
-357 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-361 0 obj <<
-/D [359 0 R /XYZ 89 770.89 null]
->> endobj
-358 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-369 0 obj <<
-/Length 2501      
-/Filter /FlateDecode
->>
-stream
-xڕYY��F~�_�����2
��O����
�������JlI��Px������)��x�r��
t ����f��5{s�����!�f�N0��g�5
����%�φ
����2s��iGl"���O���f������X�����.f�����,�/3�t���L������7�����cSl۴m���ܶ-�l�wNhy|��ceÔ]y�Â�<��y���+!0�v��;U�JV�oNҺ���ܱ��Q,�9*f�\��\�G�m���S����u�~�T]g&����i���Y�c�E�*r�5����|�?�9� е|�-5�w
X��@QdF	�U�*n��-HoJ&�|����.|�����X���#W ��
-$�����4Uq�0��f��7�mS�q���
]��Ѩ*O����q)ۊUz865S�i������wa�-�o����
�
�E߼�S\5����cɃc���jVT��J�"^^��"���
[��-�}U�0Z���`�� i�8z�a��3"sfih�U���ּ�sc�ܺdzV�Ģ�nwG�uNAr��8-�&H �;Ƿ�}K�����q��Æ����

O��21;,������%K���u�^�Z����nޮ��z�|Z/Y|�
�:�vh<T�F��.���A\i
���@��b �	�C}djA	t����ʇ�&��zɮ$ռ��3��o�>����� ��?�N�A�Ls%�RS� �����k'е�0	�F[�
F[X�y��O(�H<�Uڰ�N�Qv �1
:?��\��`6� ?h�^�4%���l*�H/$A�$��<�~
L `��ʅE�Jy	)Y�$�Z�oo�<a��s�G������"3 ���cӜ~��?���hͲ:�\2�o�E$�Qn�Ah�W1t:fw����
�vc�\o*&`:��_ t8��?�=�p��
1s����BR�x�'�m����>Xy�G���3��ڃ|�]��.�ݲ
U�uqãx*�	\v-�b(�ӈ:4��Wx�{���R��]5�IxW}%�VV� �4�7��i#(N�<Q����o��1-���8z��"�L�4H�$m�L"C�Rρ�Q_t~�z.O�5
-bĥz/z�#��D{gj�V�5�f�V�b2�
�dx�w˷�@��:6%
L�*�7������\v	
q4�h�
 svRN::$N�##}%�F�E��e`V��'�FNTA��|�u5�kƨ����{�n��
˒K�MN\1�9r�	-�t�E^,�c���[���
)4@�v"�cG������?j
gXp]�\ز-��2��
-�
� 	�8]���Iiœ
u���	i�-`
τ4��?_�,:��v�����U�b�,x3;����n�`0궀r�J�(�n�
uk������m�Q��%jlL��u\��A ��T�����>l:\��
�B�v�8t�>�@YI��O[��{�
-
vj���dx���Ax�a�j��0
��uL'�(V
�_�p�]�����D�
���|�Q��ȋ�^�[��,p����5�)\���C�����d��C��н��{LG
���
��.8}+l�4�A$
-���`��v|Jq4j�tE����'��LyCA\���8|���
N����W�=�����?��|��B\�*��
-n��Q��a��*���u���ݨ/�^D��_�S��SO�@[MɠW�����4�GNv�g�=5O fx0�)[n�V�o͉��]w�|�
%߸
J�q
gܴ kU�m�aA ɽ � a���8�+���CK
2��
:�i����{DA�NY�S,A��k�b���9�a�23K��:�����?�m���{��]<_HR9�P��Zo$?�.WM���q��\

-�Ȉ�L��4N�	�{'���L��=��r�@�`䏫 �&R
�W��6��l�5J$}�,����.�
R�y
��2���O�\�#��Dx�C&�r�f/�C�*������eh�*���TF}�۴��:m�k�ԽF�=w�u���p�+��H����N����q�4�Q��22&�����B�˵��z���7/ZW)��JxE�2��"𭆚���	'Q�Dx���L�a<���G:$B���S�N��
�j�v�K���~�
-�"�;��UJ&RިBU���.��8E�'l^�R�qZ�uO[l2��g򋽱��h��� �vY��Ȃ3��L�Lz�8[�/C�K�j��\G`�3���+�U��Z��X7�����с�������70.t	]"[P�<��š��~
Z����R�1�:ȟ>���}ƣly���ԫ�QY��
�mW���q��W#G�~ @�X/�A�v4i��o
�c������m�Bӏ�%A.XvH�F�7&��#��U��~.A�U�
Ȼ�
-�Q	�(t��5-��J{��
y�щ�	�S���ˑ�ӻ�hc�
l�7_�W
;��}��ٽ�n(�G�r��P��`�}}���д[���G¼��Cļ
��g�%�
-endstream
-endobj
-368 0 obj <<
-/Type /Page
-/Contents 369 0 R
-/Resources 367 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 351 0 R
-/Annots [ 362 0 R 363 0 R 364 0 R 366 0 R ]
->> endobj
-362 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [258.676 600.977 428.041 611.881]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/copyleft/)>>
->> endobj
-363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 100.311 513.996 109.287]
-/A << /S /GoTo /D (subsection.6.1) >>
->> endobj
-364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.6.2) >>
->> endobj
-366 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-370 0 obj <<
-/D [368 0 R /XYZ 89 770.89 null]
->> endobj
-371 0 obj <<
-/D [368 0 R /XYZ 90 486.093 null]
->> endobj
-14 0 obj <<
-/D [368 0 R /XYZ 90 201.124 null]
->> endobj
-18 0 obj <<
-/D [368 0 R /XYZ 90 167.167 null]
->> endobj
-367 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R /F82 260 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-406 0 obj <<
-/Length 958       
-/Filter /FlateDecode
->>
-stream
-x��X]s�8}�W�maf-����+M7��n���v<˄�������W )��,�������s�`t( '��i0~#��T�
�"�ra���"�шp�ZfMc���\~�>M��)D46���8ng�7��:�fl�q' ���O���{� M�[TF��.�y�W�
����H1b��C�-�#�P(US�j�J�˺�YL�p��>	�ň��!�n����ψ`���RN•�Y�e�|ٓŰ��`^)B��������6cY��F?.k�
�8$� ng��ԍ��:ә�Y˦7	A!���@��a{91�K�
R&H[���3D!Eɭ�L��^#I����c��w�[6�%���ߏ{V6z/�����Và�.�;���#�}�yU6�ۻF�M��ݦ6>t�����ZK�0F
�\�?���ʎ.U)v8�M�ʵnc���
-�-��=�d�-�z����t�!���r6鰨����\^od��Yn��Yi�2�R3�{��)3��{��,�ܲ�y��s��b~�wl���ݭ߸�Ӊ�|��ά=�
Sb�0
i��xr�i
 Y�4���<W�XPRq4
^����
��n�
~�lPv\~u����o-��{䷀��C�Wr&P�d at Is��dӄ���hn����$I��1��OSf�=���
���cAC��'	�dȚF� ��!��X��m�Ȏ��D��¿��
��Ѿ������L�C�Ĺ�����s���0�,��*��4�8��
�'Z�Rd���p
x:�8�����F� 0&���!b��1M\�Ő��8=�'�����B��,��MVH���9�ک�~�8��z��
G_"���,"3�a4�&ι���%��џ����@�	�$�/r����x|�)Y0_U��ۇ�"���
_�j���em&��-+�)�7G
-A�bF�� A�c��]�;������iE��)Ķg�
��3
-endstream
-endobj
-405 0 obj <<
-/Type /Page
-/Contents 406 0 R
-/Resources 404 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 351 0 R
-/Annots [ 365 0 R 372 0 R 373 0 R 374 0 R 375 0 R 376 0 R 377 0 R 378 0 R 379 0 R 380 0 R 381 0 R 382 0 R 383 0 R 384 0 R 385 0 R 386 0 R 387 0 R 388 0 R 389 0 R 390 0 R 391 0 R 392 0 R 393 0 R 394 0 R 395 0 R 396 0 R 397 0 R 398 0 R 399 0 R 400 0 R 401 0 R 402 0 R 403 0 R ]
->> endobj
-365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 710.114 513.996 718.971]
-/A << /S /GoTo /D (subsection.6.3) >>
->> endobj
-372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 688.073 513.996 697.049]
-/A << /S /GoTo /D (subsection.6.4) >>
->> endobj
-373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 666.152 513.996 675.128]
-/A << /S /GoTo /D (subsection.6.5) >>
->> endobj
-374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 644.35 513.996 653.207]
-/A << /S /GoTo /D (subsection.6.6) >>
->> endobj
-375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 526.815 340.256 537.694]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) >>
->> endobj
-376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 516.763 513.996 525.739]
-/A << /S /GoTo /D (subsection.7.1) >>
->> endobj
-377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 492.939 230.688 503.818]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag) >>
->> endobj
-378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 482.887 513.996 491.863]
-/A << /S /GoTo /D (subsection.7.2) >>
->> endobj
-379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 459.063 188.187 469.942]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag) >>
->> endobj
-380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 449.01 513.996 457.987]
-/A << /S /GoTo /D (subsection.7.3) >>
->> endobj
-381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 425.186 293.88 436.065]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag) >>
->> endobj
-382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 415.134 513.996 424.11]
-/A << /S /GoTo /D (subsection.7.4) >>
->> endobj
-383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 391.31 229.144 402.189]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag) >>
->> endobj
-384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 381.258 513.996 390.234]
-/A << /S /GoTo /D (subsection.7.5) >>
->> endobj
-385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 357.434 193.727 368.313]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag) >>
->> endobj
-386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 347.381 513.996 356.358]
-/A << /S /GoTo /D (subsection.7.6) >>
->> endobj
-387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 323.557 288.351 334.436]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag) >>
->> endobj
-388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 313.624 513.996 322.481]
-/A << /S /GoTo /D (subsection.7.7) >>
->> endobj
-389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 289.681 223.614 300.56]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag) >>
->> endobj
-390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 279.748 513.996 288.605]
-/A << /S /GoTo /D (subsection.7.8) >>
->> endobj
-391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 255.805 188.197 266.684]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag) >>
->> endobj
-392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 245.872 513.996 254.728]
-/A << /S /GoTo /D (subsection.7.9) >>
->> endobj
-393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 221.928 286.677 232.807]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag) >>
->> endobj
-394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 211.876 513.996 220.852]
-/A << /S /GoTo /D (subsection.7.10) >>
->> endobj
-395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 188.052 221.941 198.931]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag) >>
->> endobj
-396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 178 513.996 186.976]
-/A << /S /GoTo /D (subsection.7.11) >>
->> endobj
-397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 154.175 186.524 165.055]
-/A << /S /GoTo /D (interfaceppl__Generator__tag) >>
->> endobj
-398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 144.243 513.996 153.099]
-/A << /S /GoTo /D (subsection.7.12) >>
->> endobj
-399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 120.299 312.141 131.178]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag) >>
->> endobj
-400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 110.247 513.996 119.223]
-/A << /S /GoTo /D (subsection.7.13) >>
->> endobj
-401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 86.423 247.405 97.302]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag) >>
->> endobj
-402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 76.371 513.996 85.347]
-/A << /S /GoTo /D (subsection.7.14) >>
->> endobj
-403 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-407 0 obj <<
-/D [405 0 R /XYZ 89 770.89 null]
->> endobj
-22 0 obj <<
-/D [405 0 R /XYZ 90 627.618 null]
->> endobj
-26 0 obj <<
-/D [405 0 R /XYZ 90 595.459 null]
->> endobj
-404 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-449 0 obj <<
-/Length 1004      
-/Filter /FlateDecode
->>
-stream
-x��W�v�6��+�+��$HtY��q�(j���

Z�h�")ST
�}�]E��f bf��!��(C�v~uz"�$��
4�"IQH
-�R�Y�}}D��	�6�٫σ��`t��:7��s��E��I�I�y�BQ
-�%��ы��@�a����
�B���:sv�<,�a��"�c6��|6���t|�JU'MU��$3���
�
ԅm2
��u�^��'ej�鲜4yU����C\�V����Zg
�i7x���L�l+�Æ0]�
�e�f?/UR�o��k��X-���Ό;+�-��@S�
�g��n8
���L��
��0_{;�J
�g:��j�RU�.u�BM�?����(�< j�"~j�?Km at 9�Y��W�e��.��S��
~V�&|{j�
�6�q>�IA㜟���cq��k�q���l�q��(~Q���rS��'�ڪ,�@׌���X�t���.��������UM���<)+������VSg�&�#�����k�t̡��f�S�q)��O�����̵���Q[޴���V5oz4�ia�7�>u��T=,�
�a�N ˏ}"y���)��%��y8�؉d�%}

�~b�/E�x��4���c�"�Et���T�U���'���X
�

C^@�7�M����.�#�n��G
��p
MG�58?\w
].�ۈt�.}W��kQ
-��*]�t�<���dY��I̽�#&k�5.$��4a�����O�l�x��
�3;yW�a0M&j�Q��l��e
�Y
����q^�SWi3j?����MsѲ����|�
/y��rc�܄���aY��Hv��
�L���w[K�I�㉭��� "�4=�3$��(�fqS6��
7ѻ+|t]����.��
���,���ش��'����N���-�}�jw�)�k��_�0�.럒r�̬�7
�7�
�
��
#�����^�a��g�w�N�͸c
�G�S����
��B���Kk�9��ݻ⹨j�VL�_�#�_�Hp
-endstream
-endobj
-448 0 obj <<
-/Type /Page
-/Contents 449 0 R
-/Resources 447 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 351 0 R
-/Annots [ 422 0 R 423 0 R 424 0 R 425 0 R 426 0 R 427 0 R 428 0 R 429 0 R 430 0 R 431 0 R 432 0 R 433 0 R 434 0 R 435 0 R 436 0 R 437 0 R 451 0 R 438 0 R 439 0 R 440 0 R 452 0 R 441 0 R 442 0 R 443 0 R 444 0 R 445 0 R 446 0 R ]
->> endobj
-422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 211.988 718.971]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag) >>
->> endobj
-423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.7.15) >>
->> endobj
-424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 674.219 222.897 685.098]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag) >>
->> endobj
-425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 664.166 513.996 673.143]
-/A << /S /GoTo /D (subsection.7.16) >>
->> endobj
-426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 640.346 202.952 651.225]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag) >>
->> endobj
-427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 630.293 513.996 639.27]
-/A << /S /GoTo /D (subsection.7.17) >>
->> endobj
-428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 606.473 226.384 617.352]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag) >>
->> endobj
-429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 596.42 513.996 605.397]
-/A << /S /GoTo /D (subsection.7.18) >>
->> endobj
-430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 572.6 199.635 583.479]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag) >>
->> endobj
-431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 562.547 513.996 571.524]
-/A << /S /GoTo /D (subsection.7.19) >>
->> endobj
-432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 538.727 225.846 549.606]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag) >>
->> endobj
-433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 528.674 513.996 537.651]
-/A << /S /GoTo /D (subsection.7.20) >>
->> endobj
-434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 504.854 209.408 515.733]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag) >>
->> endobj
-435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 494.801 513.996 503.778]
-/A << /S /GoTo /D (subsection.7.21) >>
->> endobj
-436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 470.981 350.557 481.86]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) >>
->> endobj
-437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.759 459.025 513.996 469.905]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 447.07 192.243 457.949]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 448.973 513.996 457.949]
-/A << /S /GoTo /D (subsection.7.22) >>
->> endobj
-439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 425.152 323.439 436.032]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) >>
->> endobj
-440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.411 413.197 513.996 424.076]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 401.242 138.375 412.121]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 403.145 513.996 412.121]
-/A << /S /GoTo /D (subsection.7.23) >>
->> endobj
-442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 379.324 285.821 390.203]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 369.272 513.996 378.248]
-/A << /S /GoTo /D (subsection.7.24) >>
->> endobj
-444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 345.451 191.146 356.33]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag) >>
->> endobj
-445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 335.399 513.996 344.375]
-/A << /S /GoTo /D (subsection.7.25) >>
->> endobj
-446 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-450 0 obj <<
-/D [448 0 R /XYZ 89 770.89 null]
->> endobj
-30 0 obj <<
-/D [448 0 R /XYZ 90 318.801 null]
->> endobj
-453 0 obj <<
-/D [448 0 R /XYZ 90 286.645 null]
->> endobj
-34 0 obj <<
-/D [448 0 R /XYZ 90 286.645 null]
->> endobj
-447 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-474 0 obj <<
-/Length 1703      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�8~���m��"��[��;��l��>4
�e�)�K3�_�GH€��i�L������U��`g�`������d`'B��¹\:v?B\�����
-D�
��o��".��
��=͒*���߸J�L���B�I����>wI4�t�f��r�eD at 6v���Q:����'�,`����B�Y�v|��:��Fب��j�.ƈ�:���sj��[B�1�B���l��ӆ��g�R���
��Q1?�§u6W��
�u2]��|�Q��W��޳�G��-IV�i��be�z�,Pq�l�Yb��-Ԋ+���1�n�,`L��bȜT�RT>u<�#N�V���,u
-T7R��!dF��;�yzw#Řp�L��4��_��h�1��˛�l�4>�w뺬���H��i*vn�c�Ҧ���
�*������Xx��qz�X\aL�'��t
�M'�O�xYY��<�(e5+�:[$�j�2;;{��!���0ӳzP�p]�C�YT����F4�^�.+
-�2:qi#`���r�2+f�+_5ì^_CD ���ۼ�lb��0ͫ�d�sF��e�r����F�g�Vl�J�Wo����=�3_��y]�E�O�*oϓrX�:n��2Ye�a��dJ�^#ȏT��*A��U=�}�Į�
-C!��"�Z�˵��v
c>
-E�J�+zHPj�!ؘ�׮�S�>kk��Zݞ4e
�B���lAq^��Ty`Gj�Q��w8�Qzj����<!
��-�Eİ�Yʼn.]��Nd9/������=>d{0ˍ�MA��IK,(XY�v
RøwU3BC
�s+Ӵ?AV�>�ԣ��[��,��lM�
�AkC�
�R��M˵�[������̪��!}nvl#�U�� �w
-�1œ9,��UD�� (j
�Bt`�3�!��Vܨ��P�R����p�����=��Ω�9�z�ߧ�
k��!m
�f��Թ��J䡌��c�Q	0����ɹ���-QЋD�
Ar�3�+�
-�:?��|v���oOOf/�_x����ZCx�"8�ޓa�M���bA�p�i!��ݠj��!PCE���0i�P'3}P2�H���
��dV[A�Vf
AG���@�7�����^��$�la����N��
�˘!"���2��¤Լ=B�H��8�P"��}�

��#=����Y;�t�DAjO���^�
�%0?�`J��
�֝�c��0�m-��
�?�7.;'���X���!Q���Q��k�Y@�]k��U��
-���Te��1F�JֲD꾄�FUۭ���I�����
-��A�n��ݦ[�	nc�Ͷ����y�����u��u1�0&��
/��� >��
^�V$0o`���	bL
Ep�����+4�
0:�P�1$+�
�/�� B�Q�R����](},���{��G�e�eN��vy�^��`N�
CRD؜���졆�Ρ��Fu-�: �<�+�
6���\��& p[�۽���|v�5�mm�q]�m9̛
bő�v���k;�.vbז�~{m���5��P����C�C59
i��9
�'?��Z�������٪�W�~E��/�̚���,~Q�Y���⬶o;�
N8��5����]H�mA�ٱ�?4ݪLB ؈[*ySU��&��zU�l���z��m�E��}G��

�xK�����
$�
��ҀI�fEw��i4��5sNr����y�,4
-endstream
-endobj
-473 0 obj <<
-/Type /Page
-/Contents 474 0 R
-/Resources 472 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 490 0 R
-/Annots [ 465 0 R 466 0 R 467 0 R 468 0 R 469 0 R 470 0 R 471 0 R ]
->> endobj
-465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 661.375 181.496 672.279]
-/A << /S /GoTo /D (group__Init_ga7c98bac1ccfac398657571409a3fcd9c) >>
->> endobj
-466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 634.343 175.957 645.247]
-/A << /S /GoTo /D (group__Init_ga4af2931282f6a5f1b3444fb8e833d6a1) >>
->> endobj
-467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 607.311 237.396 618.215]
-/A << /S /GoTo /D (group__Init_ga635128363efd9f4c8c63e21702f40183) >>
->> endobj
-468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 580.279 254.542 591.183]
-/A << /S /GoTo /D (group__Init_gafdb2c887a3a2d1daf54a764d0d7f7f76) >>
->> endobj
-469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 553.247 224.654 564.151]
-/A << /S /GoTo /D (group__Init_gaf090a4178ad2e0dc0ea185961e13b3f1) >>
->> endobj
-470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 526.215 240.703 537.119]
-/A << /S /GoTo /D (group__Init_ga234d52733263ece8ac36c980a80292c9) >>
->> endobj
-471 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-475 0 obj <<
-/D [473 0 R /XYZ 89 770.89 null]
->> endobj
-476 0 obj <<
-/D [473 0 R /XYZ 90 721.073 null]
->> endobj
-38 0 obj <<
-/D [473 0 R /XYZ 90 721.073 null]
->> endobj
-477 0 obj <<
-/D [473 0 R /XYZ 90 679.937 null]
->> endobj
-478 0 obj <<
-/D [473 0 R /XYZ 90 570.075 null]
->> endobj
-479 0 obj <<
-/D [473 0 R /XYZ 90 498.84 null]
->> endobj
-480 0 obj <<
-/D [473 0 R /XYZ 90 432.464 null]
->> endobj
-481 0 obj <<
-/D [473 0 R /XYZ 90 408.03 null]
->> endobj
-482 0 obj <<
-/D [473 0 R /XYZ 90 408.03 null]
->> endobj
-483 0 obj <<
-/D [473 0 R /XYZ 90 316.73 null]
->> endobj
-484 0 obj <<
-/D [473 0 R /XYZ 90 312.247 null]
->> endobj
-485 0 obj <<
-/D [473 0 R /XYZ 90 222.919 null]
->> endobj
-486 0 obj <<
-/D [473 0 R /XYZ 90 218.436 null]
->> endobj
-487 0 obj <<
-/D [473 0 R /XYZ 267.991 151.281 null]
->> endobj
-488 0 obj <<
-/D [473 0 R /XYZ 90 144.641 null]
->> endobj
-489 0 obj <<
-/D [473 0 R /XYZ 484.685 77.486 null]
->> endobj
-472 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F24 169 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-494 0 obj <<
-/Length 839       
-/Filter /FlateDecode
->>
-stream
-xڭU�n�0
}�W�mP+�,���v�Ю�64t��&Jj,�S_��u��A�CX�D�<�� ��G���<#Ha%�D�5Re\a!AZ�ۘ�ُ�%Je���`�o>]/�]/n�^�n=D���^�,G�*��A�
-ԗ��T���
�g)|��&�� �`&��~��
�S�H��'f	%�ĥ�f	cy��m�b��`"Rg��
2�U�FlOQP�b���Vw'bJ�9��%&Ԟ�� f�4EW֦8�.#)V�DfDb���ȻF/�B��'��.dܛ�������*���9Ԃ������2
�'ui
ܘ��)GF	V�ÂaJ2ou��0	w��/�X�X4E�;�x�o�[�렚����b��N�bwJh�%���X�d��d2.��=H at a���[	�S��n�*����
�
�n�ޢ�ˮ>T`��N/�??��v"6�8��p��{l]�\l[;���Ή��Y�������YyZ�gp3�㜊��%���p��!�`�N��J�n,���0l��u�Zu�j���)�ƋE�Л��7+�8��8��o�Y�������ޛ����& j꺳T?�5Ie䰥���;�=j
�l�J����	d^iSW���<���`|�U�
䇮�/�g|�
ɱ`b1Ij�'9�d�oM
���"����db�3,�{y
�=!4�vs�v��MP�/������]���C7
!!;�܍eO�CЁ����?_����*̦/6a���EZ�(tmT_��/fB�a�},L?L!˱�3*b���Ē۫E`��PR��טއ�uj�;��S�=�������ߴ�l0�����g&r���ܬ�&�QPV�<i��d�
-endstream
-endobj
-493 0 obj <<
-/Type /Page
-/Contents 494 0 R
-/Resources 492 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 490 0 R
-/Annots [ 491 0 R ]
->> endobj
-491 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-495 0 obj <<
-/D [493 0 R /XYZ 89 770.89 null]
->> endobj
-496 0 obj <<
-/D [493 0 R /XYZ 90 721.073 null]
->> endobj
-492 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F60 172 0 R /F72 194 0 R /F24 169 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-512 0 obj <<
-/Length 1572      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~����Y@��*�{k�dH״]�um�6�h�%W�3��~�ɖ-'Y�+�`�����|$��8�
-p�����`�H�@!�88�
$WH��4	>
c�ˆ`���Ch����"#*���
��0b$�xHI������|�e@@>��'�L��l��&0�*���$��N��2h�������0��tM�&4 )!h�
	��
ΐ���J�5$bh�����E�l� �
I��'�4B��+·�G�*�$F�% �!�|�Tt>
>D �4�1���/
s啧��N3��{���������7�R��=���d	
@s��RsDD���О�=����鏋�N��}��u��p�C3�4���kTD�
%l�\\�<�����l�7��ҿ��u��l�}���-%d��
���?��,
-NvN�����mw�ᬔ!�Cm��M���?֡yqx���Qj8�u�z-#з�@[7�
#��0q���r����`���e�J��Q}��S7�6g��J���|���A��zZ�g:��`�����a����S��.����m>%b
-ap
�#"���h��kPu�~%Էn�|>��1Z:�~��]�	���	)
�l��6���^�y�v����,k����1�d�l�:��m|
��m������Z�'?l�n�PsK�V�m�S{s��(_5�D"�|� a������7=�̛ߗwp
Aj�!��2�u�{�ւDf�3p�\�&)�2��v��M�-Q
W�O�{:/��fS�µ��M�
M�v�#%��4�����<��C��@4��y(I��9
~G���	���#Ս� �Għ�`�������@W�2����m���^8yg_g�b��[�:�kϿ��s�FgΕ�iZ�I��i6*��?�+�ȟ1W)���xSc�5n���6����qP�&RM7h�.�N�]�%v�7X�f�6�:�1�HD���C�JT[�i�8+�L�=S
-��&�m�
 �N6ͭ&$q��g!`?����>�F���xt�u�ݰ<��Ku�k(�h}�9]=B$�q�̙�%d���೜
�7��r�iU���j^��j�7�'��=��M)�e"p�1Z��P���k�!6���M����[
�T�
�A��,�M_�Œ����@V�Ѣ�F.�>�pP�О����bKC���FE}� ��
��0�m1�=k
-�d�����@��A�1AR�.{�7$�t+� D��h
�
-"-��	in�G(��/����y��Hߪ
-p�]�a�-$+bs���,Q��˻X��WLlZ�n`���o��ұy���[S���Y�_C��b��c���j=˻ȫL�"�*�����,qR����p��`�IB��}��P��t������a�
�h�03]�
�
-��q�wl����^R׍��d�)����O�@?p9�%��.�P�ZU�u
-/]�:ͯ�{l"�K�c?�G�˟C00�h����V��Tm-60�
n)2����n�uN��A��m`�y	�$
�h�亮���W��Hc\�6���cp�8n��eSP�
�Y��u��
���u�1 �
D�jg�����C?�<c�A�����`c
-endstream
-endobj
-511 0 obj <<
-/Type /Page
-/Contents 512 0 R
-/Resources 510 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 490 0 R
-/Annots [ 498 0 R 499 0 R 500 0 R 501 0 R 502 0 R 503 0 R 504 0 R 505 0 R 506 0 R 507 0 R 508 0 R 509 0 R ]
->> endobj
-498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 660.249 213.038 670.177]
-/A << /S /GoTo /D (group__Version_ga79bd3696a302bb721ef8168fa5d650fb) >>
->> endobj
-499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 630.596 251.782 640.523]
-/A << /S /GoTo /D (group__Version_gae19dfe022c51c874d905e2a7c81c18f1) >>
->> endobj
-500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 600.942 251.225 610.87]
-/A << /S /GoTo /D (group__Version_ga8458e58a5e857de11c35ce3076a70ab8) >>
->> endobj
-501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 571.289 264.505 581.217]
-/A << /S /GoTo /D (group__Version_gabadfeba0a415d210cdd6d7309365e800) >>
->> endobj
-502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.731 541.635 244.032 551.563]
-/A << /S /GoTo /D (group__Version_ga7a529f51bfebdd4b3e69c866dced9bc1) >>
->> endobj
-503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 455.765 204.032 466.669]
-/A << /S /GoTo /D (group__Version_gabdf8f4e9416010573d48e21cf0584762) >>
->> endobj
-504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 426.112 204.589 437.016]
-/A << /S /GoTo /D (group__Version_gab51f10ea37de5299e9bc840afa206d4e) >>
->> endobj
-505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 396.458 212.639 407.362]
-/A << /S /GoTo /D (group__Version_gaa50f472bf6d1869a2fc1500d2fdf8213) >>
->> endobj
-506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 366.805 197.387 377.709]
-/A << /S /GoTo /D (group__Version_ga676f27ad949159a3b79577f78870f60f) >>
->> endobj
-507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 337.152 175.808 348.056]
-/A << /S /GoTo /D (group__Version_gac6abee034f6ac000f15d1206fdeb8316) >>
->> endobj
-508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 307.498 173.736 318.402]
-/A << /S /GoTo /D (group__Version_ga63fef7041da34ac5bb372a2535d99377) >>
->> endobj
-509 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-513 0 obj <<
-/D [511 0 R /XYZ 89 770.89 null]
->> endobj
-514 0 obj <<
-/D [511 0 R /XYZ 90 721.073 null]
->> endobj
-42 0 obj <<
-/D [511 0 R /XYZ 90 721.073 null]
->> endobj
-515 0 obj <<
-/D [511 0 R /XYZ 90 679.146 null]
->> endobj
-516 0 obj <<
-/D [511 0 R /XYZ 90 647.758 null]
->> endobj
-517 0 obj <<
-/D [511 0 R /XYZ 90 618.105 null]
->> endobj
-518 0 obj <<
-/D [511 0 R /XYZ 90 588.451 null]
->> endobj
-519 0 obj <<
-/D [511 0 R /XYZ 90 558.798 null]
->> endobj
-520 0 obj <<
-/D [511 0 R /XYZ 90 475.638 null]
->> endobj
-521 0 obj <<
-/D [511 0 R /XYZ 90 475.638 null]
->> endobj
-522 0 obj <<
-/D [511 0 R /XYZ 90 444.251 null]
->> endobj
-523 0 obj <<
-/D [511 0 R /XYZ 90 414.597 null]
->> endobj
-524 0 obj <<
-/D [511 0 R /XYZ 90 384.944 null]
->> endobj
-525 0 obj <<
-/D [511 0 R /XYZ 90 355.29 null]
->> endobj
-527 0 obj <<
-/D [511 0 R /XYZ 90 276.447 null]
->> endobj
-528 0 obj <<
-/D [511 0 R /XYZ 90 217.206 null]
->> endobj
-529 0 obj <<
-/D [511 0 R /XYZ 90 194.434 null]
->> endobj
-530 0 obj <<
-/D [511 0 R /XYZ 90 194.434 null]
->> endobj
-510 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F24 169 0 R /F100 526 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-535 0 obj <<
-/Length 793       
-/Filter /FlateDecode
->>
-stream
-xڍTIS�0��W�V{��K�z,KJ)
��88��xH� ;0��>KJ� �����[��4G}����ѹ"Hc-�D���Lc!�o��bƒ��%�2�TK0rܓ_����m/����SDAD���
���)�/�\���)�P�8�Kt��H�B0=�?X�� �S�H�1ORJ��7����$)cy|ڔ�Ue�±z�� V�2�3=�i�Y�λ[��ﳤ�`"8�����ʰ��.��iQ�1ɘ�dHnRSY������q٘6�*/
-���l�/��r���=!����V��
3.��k�qXq,8�{��s9���J�	D |���ں�Z�,H�5��3͆p��ɠ��
҃�9Τ�*>ܺ��"���
�jW�;i���̃��ɩ��[T�����Dh�1v��
-�t0�
-K�,b��(ݷ��xm����������6�Ʈ�0��(&ͦ�
f>2p�{�ʶ�}�s�V��˺�L
�,^�Wif!��ݼz�KB�*��{��EѵM�0���d$>v����
-j��A�,>9:�	�[���؛��z��䓄�xS/�l���-�k"E�'�	�Q�jh�ŶZ7�:��^R��pg�wV˦y��ڋf
��A
����=k�
w�?���0SXhw���s�!�[��]�8:m���]
-�ҽCwO`�
-)����pO�

�p�O�sU�����E�/37e`�i+�����?
�)����`"=�b�_
-��
��VU(����K�G�v|�;�{�w�h�u믣�Z\�9��z|��Ja"w��������� �޵g
-endstream
-endobj
-534 0 obj <<
-/Type /Page
-/Contents 535 0 R
-/Resources 533 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 490 0 R
-/Annots [ 532 0 R ]
->> endobj
-532 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-536 0 obj <<
-/D [534 0 R /XYZ 89 770.89 null]
->> endobj
-537 0 obj <<
-/D [534 0 R /XYZ 90 721.073 null]
->> endobj
-531 0 obj <<
-/D [534 0 R /XYZ 90 704.201 null]
->> endobj
-538 0 obj <<
-/D [534 0 R /XYZ 90 704.201 null]
->> endobj
-533 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F24 169 0 R /F97 497 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-556 0 obj <<
-/Length 2054      
-/Filter /FlateDecode
->>
-stream
-x��YYs�F~�W�-P	�ht��Kֆ
���5cPV;��8����\B`�dSy�Fs4�_w�##cc �U�e���GFh�
���"�wB���mm|�{�3Z������s6b�_�l���f0���{}l~]~ߛ,{�{G�%���Q���+2�0���L;
��)5
l�31��~�!�2�ˇ���
�aYf�X�	��uTKWj����\��҅�= �bǴ�PJ�d�_���2γ�-G=/��&�hc ���������Ƈ�
�ҬJ�<�mr
����%+�kE��*�״+�o���t��
-�O߾�^M��b5�\ͯV7���◎��7��BԐ2��8���W�ū�7���
χ|+�����f4��
gH��%_Of�����Q�K-���7���r5�q�����t�N��
)����l��i
�r������MR��ٛ����6��G��j�����r:�}	ٓ��N.����Fۡ+-�7
��k�ex�P���^��L��Q�D �u"��+�<G�cZ�
"
3t1��G�pF
I���$��qk2�Y]o!�
��Q�,��#�R��� ���L��S� �H�Ʀ*R�Rr�g5�iV���yR+h�8m�I��c�D.�`���5�=W�i*f{&
-C8%uBȖ�Z�OK�ق(���b���Ѿ�
-��hK�1�C[`x��
�w�[Jw�%!9�-܎�A9I�tc�*� �p��v}4V��$<9�Zoԁ{�(́8kdG@��Fo喖��	��_���sm�v�
-��jƴ$q"ԃ^`�ǰ�]�N��1�͓8j8�de�St�NQ5�hBjXʼ�Qc��.g%�%[ՠ��^th(�]O�K��.N��Qe|
�zV��ۿ�5_�J
(��#}��]p��{ͬ�M�a�t`*	�`,�?K��P'o���&u��3
"3
=P�5C�
��9��hJ���T�ӷ 1���Y��6C��#ě����I�KJӜ=�1�)���!5�m��� O-`���|�5��bD9¿oIU@��
ۖ��C�Ahu�}����c��X�;:�b�� "�-���fC%�4�@}��q��c��JbMm"�7"��3ViVC@�B���v�k(��,?�b��UY�k�?�&�u��X
��ԜL����s�*%O�z��~�VĶJ�e������|�����hT�9��|���W�Z.�P�(U��z�/%�ǩ�30�{���(K㲦�"�C!(~B�O`G�{>0H��C���U
��Q����� F!�SZ�Z�97������9��Ec�,~2SI�0��tW������^��
hP�d���~� ON��ŻA��J��

r-"Y�4
�P
���ɳ��H�����:h�d�I ~�?q?�oa�_
\�_襈���Z
��B|���y��(Jmކ2���hWd�m�rz����`}�XT,4.��
��д]��W�E��ax[WLZ��P�ԥ|�8��
��N�&O�@P
�B�
�Q\P}~
GD����%!l#��+M0u�~ �Ԉ�B?NN:�+�����?p�z�y�Vx Y~,dB3�=�i9`�)r{�~�F���t��=���6v����"2��:����&�
�bp �l������M��{.\E��\�L���ޑ�+i���'
�jS��v�?����O
]�9��mD��w�k�8&�W3�NU
x5���ɧ�%�|�Q��-(Av���˯�VMc�
�8�m�,�1Įl
@$��&����=�[�A3�5�)�
-�ۡj��S&
G��w�%�;��
R��H�}#'e��8D�Xtm���OQ�"ep��fp7�`j��U���p{2i�9�6@�啢 \��8��D�ey�o�n��_��\��M��\̺}K�>P���~�_�<J8����z�
��J/��&٦"�:��x'0RS�������
��
g��H4;E]q�1����慨�J�>z�'��^e+�r���mY���6��:tG���?
Uyu�r�o����(�ɔ�l@\��"K��@!��k)�|�
ͱX����4��q���;�o%�xK
-endstream
-endobj
-555 0 obj <<
-/Type /Page
-/Contents 556 0 R
-/Resources 554 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 490 0 R
-/Annots [ 539 0 R 540 0 R 541 0 R 542 0 R 560 0 R 543 0 R 544 0 R 545 0 R 546 0 R 547 0 R 548 0 R 549 0 R 550 0 R 561 0 R 551 0 R 552 0 R 553 0 R ]
->> endobj
-539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 660.945 228.51 671.849]
-/A << /S /GoTo /D (group__Error_ga0c0ab09a97e49f85f42c966e14cfdee6) >>
->> endobj
-540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 649.708 264.246 659.894]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6af29a62bdfcf44dbeec14afb409035438) >>
->> endobj
-541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.637 649.708 431.896 659.894]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a093ae02f8ceebbc40321d1eaf186f726) >>
->> endobj
-542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.287 649.708 513.996 659.894]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) >>
->> endobj
-560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 637.752 180.66 647.939]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) >>
->> endobj
-543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.648 637.752 324.021 647.939]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a6aa28e72200f879cbb83a36b60644fb2) >>
->> endobj
-544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 625.797 259.802 635.984]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6abd22c4eaabb49bcb6c654a25e402c64a) >>
->> endobj
-545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.653 625.797 356.319 635.984]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) >>
->> endobj
-546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.17 625.797 511.506 635.984]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a7dae659f72f654afae1c5c6f331192a3) >>
->> endobj
-547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 613.842 348.35 624.029]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106) >>
->> endobj
-548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 601.887 279.747 612.074]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6ab42a97917f263e8305d561f52cbd9c57) >>
->> endobj
-549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.185 601.887 413.47 612.074]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a24fd14db2a8ae42b3abcae3288e46edf) >>
->> endobj
-550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.907 601.887 513.996 612.074]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8bf236a519f7da9efd5f874a17d9689d) >>
->> endobj
-561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 589.588 154.099 600.118]
-/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8bf236a519f7da9efd5f874a17d9689d) >>
->> endobj
-551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 519.418 216.893 530.322]
-/A << /S /GoTo /D (group__Error_gad6765993c08a2ae2f0ef377f822f4d33) >>
->> endobj
-552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.766 519.418 372.738 530.322]
-/A << /S /GoTo /D (group__Error_ga0c0ab09a97e49f85f42c966e14cfdee6) >>
->> endobj
-553 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-557 0 obj <<
-/D [555 0 R /XYZ 89 770.89 null]
->> endobj
-558 0 obj <<
-/D [555 0 R /XYZ 90 721.073 null]
->> endobj
-46 0 obj <<
-/D [555 0 R /XYZ 90 721.073 null]
->> endobj
-559 0 obj <<
-/D [555 0 R /XYZ 90 679.937 null]
->> endobj
-562 0 obj <<
-/D [555 0 R /XYZ 90 538.409 null]
->> endobj
-563 0 obj <<
-/D [555 0 R /XYZ 90 491.228 null]
->> endobj
-564 0 obj <<
-/D [555 0 R /XYZ 90 434.363 null]
->> endobj
-565 0 obj <<
-/D [555 0 R /XYZ 90 410.074 null]
->> endobj
-566 0 obj <<
-/D [555 0 R /XYZ 90 410.074 null]
->> endobj
-567 0 obj <<
-/D [555 0 R /XYZ 107.713 328.501 null]
->> endobj
-569 0 obj <<
-/D [555 0 R /XYZ 107.713 300.61 null]
->> endobj
-570 0 obj <<
-/D [555 0 R /XYZ 107.713 284.675 null]
->> endobj
-571 0 obj <<
-/D [555 0 R /XYZ 107.713 268.74 null]
->> endobj
-572 0 obj <<
-/D [555 0 R /XYZ 107.713 240.849 null]
->> endobj
-573 0 obj <<
-/D [555 0 R /XYZ 107.713 201.003 null]
->> endobj
-574 0 obj <<
-/D [555 0 R /XYZ 107.713 173.113 null]
->> endobj
-575 0 obj <<
-/D [555 0 R /XYZ 107.713 145.222 null]
->> endobj
-576 0 obj <<
-/D [555 0 R /XYZ 107.713 117.332 null]
->> endobj
-577 0 obj <<
-/D [555 0 R /XYZ 107.713 89.441 null]
->> endobj
-554 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F24 169 0 R /F92 331 0 R /F106 568 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-583 0 obj <<
-/Length 1133      
-/Filter /FlateDecode
->>
-stream
-xڭVKs�8
��Sp[<SdI 	��4��6��{j;d�)D�|�������'����I8�8x�z�]m�2�qʃ�.�p �
1E�)�����]������^�~�^~����r���"��q�
�4��է/8(��.�(����
-�ABc�V�������yH�YL
$H
B!.��o
.��n�
nn�^_��
g4�����H�!JĘ����eI�W�j�9��ص�N֎!�V�Q���t��C����L(�R6� ��Ӛ�P>{��Ԏ��l+�Uo�"�2s@c.�R� K	XԪkde�hX��2G�(��/{G=��Q5�+�'�]ۍ���M�<���pq��9}�ޭ�$\�s
]֪
���&��U�K�^&�ڊ`W
��=�q� 8,ZջS�zR?
�m�GIU#�ZD�����t���c_
-���(A�:"Jv54�.mH4
ߴ�PC�Ғ想�bR�`$�f�6˱��c�rl�=�1J�$��
-rٴv�<��8��+}�'g(�8���9Y:U]�&,�1{�:(&�
Lp�t}�MQ)?ߟ1��(IH�}M��-
K��6W4��b�\���8v"
o	D3�a�}�P;�F�
�l�B���j���V&��<�m�θ�8䒌zV(J�W~X�Z��;�
��Ɇ�2���<�!7�9�L��S��I�p.n�b^�_�l�P؜��
�tm����i���[S
F��\h���0�S����@�B#|<>��C��#��OY-e(SVȡ1%4�
*s�fWE��1,s�Š���j�Р���慸�cNI���6�ЃyC�5�KX�4�}��
�
�/��齔
�-O���b�����̝g��U���^1�_���0��+��#��jY6ӿk)-�1�E>�`�-��,����
���p�J�2������I�	�s���8:��-� �HvJ
�Z���/N����o�lf��@,�O�op�`"����2G
O�\�q�c's؋N-v�`s�8u�#L��t����c�5>7���=�ڼ7���I����e��W�ٸ�����Ǯ/ǻ� l0�
عWʗ���uJ�����,��S贳Z��l
�}��=���%윔 #��q7�G�v>��r�h��@��\
-endstream
-endobj
-582 0 obj <<
-/Type /Page
-/Contents 583 0 R
-/Resources 581 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 490 0 R
-/Annots [ 580 0 R ]
->> endobj
-580 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-584 0 obj <<
-/D [582 0 R /XYZ 89 770.89 null]
->> endobj
-578 0 obj <<
-/D [582 0 R /XYZ 107.713 711.11 null]
->> endobj
-585 0 obj <<
-/D [582 0 R /XYZ 90 670.473 null]
->> endobj
-579 0 obj <<
-/D [582 0 R /XYZ 90 648.096 null]
->> endobj
-586 0 obj <<
-/D [582 0 R /XYZ 90 648.096 null]
->> endobj
-581 0 obj <<
-/Font << /F70 192 0 R /F106 568 0 R /F60 172 0 R /F82 260 0 R /F24 169 0 R /F97 497 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-596 0 obj <<
-/Length 2279      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�R�ƃ Ȥ����d���z4����\�DK�H���q��~����X�6{��&���nt
�z�z?��myv�ZQ/"Q�oy�E�S~Dd ����Y@�|�(��圅�t��u5_pIg���.�6�`"�g\�]�tv�<�rƀ=��a'�
-������[�'��޽���|.��>���Z�(����z��c�DR�FQ���H�VG
v:�fӼ5�� �[p�?2|_�٪J�t9����o<_���� ���/�ڥY�}^HP3�*KF;k�+=�{w��.�꺲���)�PI�L7Y�6>Y�ɪ2{@�Px!���.��so�|��Q�cR��U�M���ۼ����]]��6�r��ˤ{�K�]��Y
��P��K���!�v^2�t��]�%Y��;�r�י��v:͙�g�w,�
rv�#<�7�����
-
t���
�y3/�+zN2����r;��E}W%�#l�O�����,-�tu\��r�<8�*�%���$�l�-�7[�8͹�� .�y��?Gz�vR
-&ω�̡z��P',�m�"̖�WI�;
�P�^%�H���{�H�q����@%�Q�8tk��{��mp��F��|U�!N��F\�Íh��i��Vq�1�`�*��KN�a�!
F-�h�D�nKA(��J�F�H���I�!��Z��

��—A��@��ב�Q�,9z���f�#�+0�jf���09�PA#�%U4Щo�� �=6���%Q�%�����9�gq�1}��M��i�÷C
,"HJ
����V�<� k9P�
�����B�#'���rrÓ'�B�: W��%F���,��7�+

	H[a��Vy�.͛2�B|�fB|[�5
"3]mͤ�Pژ֯���2_���{��U���K;�&A
`:3-�M!U����&@7Ek���� �wR�dl?	�;� [...]
-�����?�CV����t�j!�#��EF�9�H�B:��A�J���t�K��e�m4m�x
B�2��=8"�D�wM_?��Ѝa���!�,B"��@�L�d(�ݬo�d���J�.
-N{I�F�W:�?t!���(l#�I����������w?������W?~z{�n9��%�E��
���p��6h�g$H�Z/cE��0
G�

�,��y_��Ar��
�����C�$Y��}�{����g�]>���u_�W����Zcw[��Ohn�b���'"�g���
����Y�
�!$q�}� ���
�?DmL�?O�k����lb�M��H��&!]��P�f�m�d,����7�:
VK=5d��ڄ�������[Oj�
-��K��ST[]&�iR�#�/�
	���[
�WUSt�>���M��ˉ슥�E�O�P�����S�s�!\��r���s���֖QĻ��_N�&0�PGT&�n���SP֕ �<�-�)	X�Ѧ����Hx	<�cEDN�#�x�gh7�^���06i̷
��ܶi ��1�e�f�h'��_�V5H�
[�!]�P��m�m�b�Q�rB{�k�c�����E
 ��	�`3 ��f�Q�D9)��)j�p+��J�GO�B��`����DH��"�x�
Z������,�-ֵ��Ut���Kqn�`�e�e��E���D�v��p�-�k��
-{c*z�; 
T
|��E�^�Z����(�ob�7! �oB�t6���J0r�Q8�
�Ѫ��D�4��Qsq�csq�GlC
�Eq��?Z4��"`�E5
- ��4�7q���}{���eƒ>�I����o�n ��쇗eE�v7����G��1I�>��~��?Lѩ�BNx�b�mU�}w~~So�$�p۸�+Eh�泶/��Ms�f@���͖���A� �[��ѿ d�.����~�,���˽�^���?/�
���
-endstream
-endobj
-595 0 obj <<
-/Type /Page
-/Contents 596 0 R
-/Resources 594 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 613 0 R
-/Annots [ 587 0 R 588 0 R 589 0 R 590 0 R 591 0 R 593 0 R ]
->> endobj
-587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 660.943 193.122 671.847]
-/A << /S /GoTo /D (group__Timeout_gaf0d33c5ec6461b246420cebe2d6866ed) >>
->> endobj
-588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 633.048 200.863 643.952]
-/A << /S /GoTo /D (group__Timeout_ga3ebabd1a7396005fadcd08efb53c1f58) >>
->> endobj
-589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 605.152 250.127 616.056]
-/A << /S /GoTo /D (group__Timeout_ga93f815a338ce597c6ae3e7b2018d962d) >>
->> endobj
-590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 577.257 257.868 588.161]
-/A << /S /GoTo /D (group__Timeout_ga7e11189e03e9d1452b16e24dae5d6bc3) >>
->> endobj
-591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.829 307.959 482.396 318.863]
-/A << /S /GoTo /D (group__Timeout_ga3ebabd1a7396005fadcd08efb53c1f58) >>
->> endobj
-593 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-597 0 obj <<
-/D [595 0 R /XYZ 89 770.89 null]
->> endobj
-598 0 obj <<
-/D [595 0 R /XYZ 90 721.073 null]
->> endobj
-50 0 obj <<
-/D [595 0 R /XYZ 90 721.073 null]
->> endobj
-599 0 obj <<
-/D [595 0 R /XYZ 90 679.937 null]
->> endobj
-600 0 obj <<
-/D [595 0 R /XYZ 90 650.307 null]
->> endobj
-601 0 obj <<
-/D [595 0 R /XYZ 90 594.517 null]
->> endobj
-602 0 obj <<
-/D [595 0 R /XYZ 90 549.062 null]
->> endobj
-603 0 obj <<
-/D [595 0 R /XYZ 90 492.195 null]
->> endobj
-604 0 obj <<
-/D [595 0 R /XYZ 90 469.819 null]
->> endobj
-605 0 obj <<
-/D [595 0 R /XYZ 90 469.819 null]
->> endobj
-606 0 obj <<
-/D [595 0 R /XYZ 90 411.227 null]
->> endobj
-607 0 obj <<
-/D [595 0 R /XYZ 486.978 311.112 null]
->> endobj
-608 0 obj <<
-/D [595 0 R /XYZ 90 304.472 null]
->> endobj
-609 0 obj <<
-/D [595 0 R /XYZ 90 184.042 null]
->> endobj
-594 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F97 497 0 R /F72 194 0 R /F11 610 0 R /F8 611 0 R /F24 169 0 R /F10 612 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-617 0 obj <<
-/Length 1155      
-/Filter /FlateDecode
->>
-stream
-xڕVKo�6��W{�
�
I�z�֦���l�6Z`�d�����KI���wȡl9I��A�p�����v
���~^Ϯ����4⑷�z)��0%"�]�}�y4����QBX����<ܯo�׏F6�]Ͼ����P_�8��z��3�
-`�(	��;�C�� ��{��>��P���0FC�y[H��S��(`c`����z����i�|����j�|�G�
ی
"x:����'��ЗRT'�`�r_m�l$��}֫�93*���՗���f#U�3d諦�Z�^W��
ƄE�2�
-�Q�c�%�!K�l�Z5��U�d����
��
-l$�Zv҉7Gd�YU�`L��Oz�����ˊ���T���z�&�/�yvq�M��9��̗�Nc£s��G)�f1��4�E�Tx
�W�4p������MHLS�qBh�Qw]*�U =y�x�ۼ��۰ z�
��t9�T��^�����u�p��
H����e#_R���xz#�l�s�O��u�M�I���Y���
-!ƣ��"us�,�l�"
%�~
Y�
�6�����T��sPU�T�TG�
-��M1rq5H��Z:���(����L�ǹ�K�mu=F������fC/G��"�+�љ>�&�a
�

(3fm�w�C6V#񷺭Q� q1�3��趩�bls�Y=]97�h���
�;v���
#���*��Iǒ}NL��Ϙ�H"B����<�~����װpJh*�a1E�C� ծ쑮e^f�����PF��F�Rp1�2 �" �r�|S�X��L�

U6f
Raj��UP�=�iq�+�9G���n��F����1t_µV���������x
&˜�`ʪ�	�sID�<#!��:gq<�t�� �
��T�,r�!�_U�F�-��7|��)�Gd�;ȬZ7����Kw�|��if�	;�� ��X����=j��tV8;�䴑s.������B��t�L�wA]h@�c}	�'1�*|��D
W��_��09��1��)m���c\/����cgs
��8
�S"��A��[@(g����
����.kvC�sҥ�/���9�S'�s!���A��e�E�LF(^� �<��i������
��I�	'
Fݽ9e�����
�N���_?�g�8&4:�vm�[a��[��P���-�_5�_,
�
-endstream
-endobj
-616 0 obj <<
-/Type /Page
-/Contents 617 0 R
-/Resources 615 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 613 0 R
-/Annots [ 592 0 R 614 0 R ]
->> endobj
-592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.253 696.002 511.506 706.906]
-/A << /S /GoTo /D (group__Timeout_ga7e11189e03e9d1452b16e24dae5d6bc3) >>
->> endobj
-614 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-618 0 obj <<
-/D [616 0 R /XYZ 89 770.89 null]
->> endobj
-615 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R /F82 260 0 R /F83 262 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-653 0 obj <<
-/Length 1106      
-/Filter /FlateDecode
->>
-stream
-x��YQw�6}�W�m�B�%Y�ۖ6=���Oiǀ ��vl�-����d0Jh�i�Ƀe��t�{u�d��)"�M��~�w���L��i�b���p7F7��2�RBHp�ˤ|�L��UR'�Ca��Q����������~�C!6A��8Vh4��|&h
��!�#��?˗戳�3t���C<,���M{� C�b-kP�-��A�]X�L��Zx� �K�N��.�8�څ뇊�gl&�Kw���Q�ט���ٰ�I6v��̒����a>�g��ݍ򬪓������2�
x�D��q����jOvTb
)H�aѤ��1���t�W��
q����5+h9��~Xv���l0N�&��<��;!���)�&���$g�K9V,v�~���
9��Ҭ6!'��
������PFq`
-w�LV��ԧS$#��
-qC�n�+|
��A�R^߼�		��.o�V�Z@ ��h�[�b�c�t����>d�I�&Ù䋺Xԃ�"�;5��}"������>�B�=3qC�T���z+?�K���=�./���{lQ53c�|Q�-��=�J�.���P�K
Q�?Yk�.r����l���
��t
��,�8R��d����s,�ɆS�(�����ȭC���G0.�?�~*;�>�)%
kr
-�.Gx�ZaF�a!���G?G��/3�$����$����Ei*�s�eSP�%�<�$;�>J
J�T��-snW
�^���",=�=���!��
��ԅ�S&���@9,[amw���
�8™�T�s�
{Y>X|œ�$|%�Z`�_T-hQq�P�f~�D�j~Z4CY
�;KGgm�=��Z�lEζ<Y)GT
-i$u^
4K� ��&f�Fr�R3�^�w(��X�z��*�ɞ�P�)JLk�#�XJ���~�.�������2�9&�%��5O]_Q,�I��k���d8f�S�G�Cb
�g�;)�1z{����+׸p��$�.����[��$�$Xm�L�S(D�7 O�E�
m�R��)�'�{H1���؞����4�.��Q���
��d�f�ϋۺ.~����ie�)
����i�9�1�+�V{��4�F:<�'v+7G6
߂P,%k��:
/���V{�Ϧ��{;�Ы
�X���'
�

-endstream
-endobj
-652 0 obj <<
-/Type /Page
-/Contents 653 0 R
-/Resources 651 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 613 0 R
-/Annots [ 619 0 R 620 0 R 621 0 R 622 0 R 623 0 R 624 0 R 625 0 R 626 0 R 627 0 R 628 0 R 629 0 R 630 0 R 631 0 R 632 0 R 633 0 R 634 0 R 635 0 R 636 0 R 637 0 R 638 0 R 639 0 R 640 0 R 641 0 R 642 0 R 643 0 R 644 0 R 645 0 R 646 0 R 647 0 R 650 0 R ]
->> endobj
-619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.012 628.97 255.368 639.874]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.908 601.309 351.956 612.212]
-/A << /S /GoTo /D (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) >>
->> endobj
-621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.771 601.309 439.128 612.212]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 561.692 194.796 572.596]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag) >>
->> endobj
-623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.766 561.692 274.247 572.596]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 522.075 194.796 532.979]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag) >>
->> endobj
-625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.288 522.075 323.781 532.979]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 482.458 226.029 493.362]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag) >>
->> endobj
-627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.999 482.458 336.713 493.362]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 442.841 226.029 453.745]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag) >>
->> endobj
-629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 430.886 273.63 441.79]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.906 403.224 249.281 414.128]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag) >>
->> endobj
-631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.251 403.224 326.222 414.128]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 363.607 192.286 374.511]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag) >>
->> endobj
-633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.777 363.607 318.76 374.511]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 323.99 226.606 334.894]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag) >>
->> endobj
-635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.577 323.99 337.868 334.894]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 284.373 226.606 295.277]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag) >>
->> endobj
-637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 272.418 274.207 283.322]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 232.801 286.371 243.705]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag) >>
->> endobj
-639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.342 232.801 457.398 243.705]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 193.184 286.371 204.088]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag) >>
->> endobj
-641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 181.229 333.973 192.133]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.906 153.567 247.598 164.471]
-/A << /S /GoTo /D (interfaceppl__Generator__tag) >>
->> endobj
-643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.568 153.567 322.855 164.471]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 113.95 190.602 124.854]
-/A << /S /GoTo /D (interfaceppl__Generator__tag) >>
->> endobj
-645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.094 113.95 315.393 124.854]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 224.923 85.237]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag) >>
->> endobj
-647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.893 74.333 334.501 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-650 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-654 0 obj <<
-/D [652 0 R /XYZ 89 770.89 null]
->> endobj
-655 0 obj <<
-/D [652 0 R /XYZ 90 721.073 null]
->> endobj
-54 0 obj <<
-/D [652 0 R /XYZ 90 721.073 null]
->> endobj
-656 0 obj <<
-/D [652 0 R /XYZ 90 645.85 null]
->> endobj
-657 0 obj <<
-/D [652 0 R /XYZ 90 645.85 null]
->> endobj
-658 0 obj <<
-/D [652 0 R /XYZ 90 590.79 null]
->> endobj
-659 0 obj <<
-/D [652 0 R /XYZ 90 551.173 null]
->> endobj
-660 0 obj <<
-/D [652 0 R /XYZ 90 511.556 null]
->> endobj
-661 0 obj <<
-/D [652 0 R /XYZ 90 471.939 null]
->> endobj
-662 0 obj <<
-/D [652 0 R /XYZ 90 420.367 null]
->> endobj
-663 0 obj <<
-/D [652 0 R /XYZ 90 392.705 null]
->> endobj
-664 0 obj <<
-/D [652 0 R /XYZ 90 353.088 null]
->> endobj
-665 0 obj <<
-/D [652 0 R /XYZ 90 313.471 null]
->> endobj
-666 0 obj <<
-/D [652 0 R /XYZ 90 261.899 null]
->> endobj
-667 0 obj <<
-/D [652 0 R /XYZ 90 222.282 null]
->> endobj
-668 0 obj <<
-/D [652 0 R /XYZ 90 170.71 null]
->> endobj
-669 0 obj <<
-/D [652 0 R /XYZ 90 143.048 null]
->> endobj
-670 0 obj <<
-/D [652 0 R /XYZ 90 103.431 null]
->> endobj
-651 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-705 0 obj <<
-/Length 852       
-/Filter /FlateDecode
->>
-stream
-x��YMS�0��W����>-��R`�h���aL☴�������q�'$t2˒w���+Y�C�C�jH�4h���;@#�5����E�*��{����h�e�{g����n'm���ֽELF$� ꍬ�+����a`Z�_�C#�)3�;Ա�X��R�f�C�@sy
-�P
X!I��8{�S�v���q4
?�	!-Ȁ=�j��!:���)r,x��R1g�.
�q+y�}�w1I�i/)
KG����+-D�u<��>�C?��(��<Lt�xA���y/
-'����%��	��>R�1[��2N	\��R$Y�3��z�����1b
-��u�n��.
.+F7��^RC!��
-�D
���*XU I�Jр@K��S�� $_�T͈�:=�ߜ�E�DJ6Hk���dT寯���(
����1#�)��(�Y�p�^��5

O(�`yY*�&�6�IV�
S`D��
R�bA��jA4(�A��ZF7
�v$�:��RfX[���壣��lI�H����%��j+�5������a��]God/Y�
-��|�r������Lhh����#!�`o)�T�x�2�q��5+\�����Yܿ�F�	e�x�XmY�9�s�T��4,��Yf�����[���� ){�AɐK:;o��0`"3��W*g��6EE�h����8{r�Γ������L�S��C`�LFG���Q��'ya/��xa0����(�m���+��M���-Dk���©w��/��?m"Z~<Fa^I �z�Ì������̆�)=סe܊ճ�ԷI2~�n�L��ЋF������٤D�{n��8���
y��9IF��� ��
-endstream
-endobj
-704 0 obj <<
-/Type /Page
-/Contents 705 0 R
-/Resources 703 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 613 0 R
-/Annots [ 648 0 R 649 0 R 672 0 R 673 0 R 674 0 R 675 0 R 676 0 R 677 0 R 678 0 R 679 0 R 680 0 R 681 0 R 682 0 R 683 0 R 684 0 R 685 0 R 686 0 R 687 0 R 688 0 R 689 0 R 690 0 R 691 0 R 692 0 R 693 0 R 694 0 R 695 0 R 696 0 R 697 0 R 698 0 R 699 0 R 702 0 R ]
->> endobj
-648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 682.947 224.923 693.851]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag) >>
->> endobj
-649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.415 682.947 384.035 693.851]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 642.891 284.688 653.795]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag) >>
->> endobj
-673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.658 642.891 454.031 653.795]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 602.834 284.688 613.738]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag) >>
->> endobj
-675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 590.879 332.289 601.783]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.906 562.777 255.907 573.681]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag) >>
->> endobj
-677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.877 562.777 339.473 573.681]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 522.721 198.911 533.625]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag) >>
->> endobj
-679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.403 522.721 332.011 533.625]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 482.664 233.232 493.568]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag) >>
->> endobj
-681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.202 482.664 351.119 493.568]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 442.607 233.232 453.511]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag) >>
->> endobj
-683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 430.652 280.833 441.556]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 390.595 292.997 401.499]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag) >>
->> endobj
-685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.967 390.595 470.649 401.499]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 350.539 292.997 361.443]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag) >>
->> endobj
-687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 338.584 340.598 349.488]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 298.527 213.845 309.431]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag) >>
->> endobj
-689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.815 298.527 312.345 309.431]
-/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
->> endobj
-690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 258.47 213.845 269.374]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag) >>
->> endobj
-691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.336 258.47 361.878 269.374]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 218.414 248.166 229.318]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag) >>
->> endobj
-693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.136 218.414 380.986 229.318]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 178.357 248.166 189.261]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag) >>
->> endobj
-695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 166.402 295.767 177.306]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 126.345 307.931 137.249]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag) >>
->> endobj
-697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.901 126.345 500.516 137.249]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 86.288 307.931 97.192]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag) >>
->> endobj
-699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 74.333 355.532 85.237]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-702 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-706 0 obj <<
-/D [704 0 R /XYZ 89 770.89 null]
->> endobj
-707 0 obj <<
-/D [704 0 R /XYZ 90 712.265 null]
->> endobj
-708 0 obj <<
-/D [704 0 R /XYZ 90 672.209 null]
->> endobj
-709 0 obj <<
-/D [704 0 R /XYZ 90 632.152 null]
->> endobj
-710 0 obj <<
-/D [704 0 R /XYZ 90 580.14 null]
->> endobj
-711 0 obj <<
-/D [704 0 R /XYZ 90 552.039 null]
->> endobj
-712 0 obj <<
-/D [704 0 R /XYZ 90 511.982 null]
->> endobj
-713 0 obj <<
-/D [704 0 R /XYZ 90 471.925 null]
->> endobj
-714 0 obj <<
-/D [704 0 R /XYZ 90 419.913 null]
->> endobj
-715 0 obj <<
-/D [704 0 R /XYZ 90 379.857 null]
->> endobj
-716 0 obj <<
-/D [704 0 R /XYZ 90 327.845 null]
->> endobj
-717 0 obj <<
-/D [704 0 R /XYZ 90 287.788 null]
->> endobj
-718 0 obj <<
-/D [704 0 R /XYZ 90 247.732 null]
->> endobj
-719 0 obj <<
-/D [704 0 R /XYZ 90 207.675 null]
->> endobj
-720 0 obj <<
-/D [704 0 R /XYZ 90 155.663 null]
->> endobj
-721 0 obj <<
-/D [704 0 R /XYZ 90 115.606 null]
->> endobj
-703 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F60 172 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-753 0 obj <<
-/Length 903       
-/Filter /FlateDecode
->>
-stream
-x��Y�r�0��+t�9d��,���B�@é0
�UC �Sǁ�߳��&5�ԉ�&3�,[��{����ِq��{<�z�
gDZh6�`g&�@i�:g'���"��?�eqv��
-���8�󫙝w�E$}u>^xOޥ�46g��R`B�L�����S�
�AF!�V>4a��T�ٱ���[��t3�,$7uP�I6��� ����,�\X��,
Ms���<ue�N繫�g�m�C���H�^�+�@�.����Au�;�*¦���^���y�H���lX�:��FE��r��f��W���~�����4��5�D�N��
�q.q.o�U�����e�lްX/k�wCC�k�E Z���GD_P&#�(�5�
H� {ia�9�n6�ϣ_� �7�~A�@C��`hs��E������%��[����GN:{�5Z
��������$��Z�@�t#2����_
�
�&=� L�z؅Đ������&��(��M�Aْ*j��!���Y�&���
�nӇ��Z��N�h��ݚ:�H*?NNj���0�MK�Yn�{���0g��(��Y�?�:
e��P�(&�:��8�'�&q�
�T�5��^B%�/�4`�/	�=��BA[����$���RW��F�r���ʇf�(E��{"���ٖ��(�\C��
Q[��Ӑ
B��
>Ak���*}�1F�0e�Y[����)����Z��G���>�BCddX�A=_�|�B��?r�'�8���E<��
as�A��I��~n�
����~O���?pſ�جx�p����S
�[[��M�
[�^�&b�e
�H-���糇���b8��!$���x]u6�5�ג�H���Y5�є'q����1�o��K��K���gJ5�o�^�\v�z��R"bu��
�Ew�
-endstream
-endobj
-752 0 obj <<
-/Type /Page
-/Contents 753 0 R
-/Resources 751 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 613 0 R
-/Annots [ 700 0 R 701 0 R 722 0 R 723 0 R 724 0 R 725 0 R 726 0 R 727 0 R 728 0 R 729 0 R 730 0 R 731 0 R 732 0 R 733 0 R 734 0 R 735 0 R 736 0 R 737 0 R 738 0 R 739 0 R 740 0 R 741 0 R 742 0 R 743 0 R 744 0 R 745 0 R 746 0 R 747 0 R 770 0 R 750 0 R ]
->> endobj
-700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 683.36 207.23 694.264]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag) >>
->> endobj
-701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [215.2 683.36 299.114 694.264]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 644.127 207.23 655.031]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag) >>
->> endobj
-723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.721 644.127 348.648 655.031]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 604.895 203.912 615.799]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag) >>
->> endobj
-725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.882 604.895 292.479 615.799]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 565.663 203.912 576.567]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag) >>
->> endobj
-727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [235.404 565.663 342.013 576.567]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 526.431 214.612 537.335]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag) >>
->> endobj
-729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.582 526.431 313.879 537.335]
-/A << /S /GoTo /D (group__Datatypes_gaf4f8f4bacd6f148fbbfb9209fb5b2b33) >>
->> endobj
-730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 487.199 214.612 498.103]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag) >>
->> endobj
-731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.104 487.199 363.413 498.103]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 447.967 232.126 458.87]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag) >>
->> endobj
-733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.096 447.967 348.907 458.87]
-/A << /S /GoTo /D (group__Datatypes_ga25f9463d3385bd998e4fabcdce8dec5a) >>
->> endobj
-734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 408.734 232.126 419.638]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag) >>
->> endobj
-735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 396.779 279.727 407.683]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 357.547 230.482 368.451]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag) >>
->> endobj
-737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.452 357.547 345.62 368.451]
-/A << /S /GoTo /D (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f) >>
->> endobj
-738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 318.315 230.482 329.219]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag) >>
->> endobj
-739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 306.36 278.083 317.264]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 267.127 231.966 278.031]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag) >>
->> endobj
-741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.936 267.127 348.587 278.031]
-/A << /S /GoTo /D (group__Datatypes_gac3cf4d5c81ff784729bb5d1c8d48ce23) >>
->> endobj
-742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 227.895 231.966 238.799]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag) >>
->> endobj
-743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 215.94 279.567 226.844]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.094 176.708 434.903 187.612]
-/A << /S /GoTo /D (group__Datatypes_ga9448cd0d782a819c066e27cf3ebc1add) >>
->> endobj
-745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 125.521 322.725 136.424]
-/A << /S /GoTo /D (group__Datatypes_ga261d916137f01c0effdefeb266a73172) >>
->> endobj
-746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 86.288 334.889 97.192]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) >>
->> endobj
-747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.664 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 75.309 157.407 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-750 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-754 0 obj <<
-/D [752 0 R /XYZ 89 770.89 null]
->> endobj
-755 0 obj <<
-/D [752 0 R /XYZ 90 712.265 null]
->> endobj
-756 0 obj <<
-/D [752 0 R /XYZ 90 673.033 null]
->> endobj
-757 0 obj <<
-/D [752 0 R /XYZ 90 633.801 null]
->> endobj
-758 0 obj <<
-/D [752 0 R /XYZ 90 594.569 null]
->> endobj
-759 0 obj <<
-/D [752 0 R /XYZ 90 555.337 null]
->> endobj
-760 0 obj <<
-/D [752 0 R /XYZ 90 516.104 null]
->> endobj
-761 0 obj <<
-/D [752 0 R /XYZ 90 476.872 null]
->> endobj
-762 0 obj <<
-/D [752 0 R /XYZ 90 437.64 null]
->> endobj
-763 0 obj <<
-/D [752 0 R /XYZ 90 386.453 null]
->> endobj
-764 0 obj <<
-/D [752 0 R /XYZ 90 347.221 null]
->> endobj
-765 0 obj <<
-/D [752 0 R /XYZ 90 296.033 null]
->> endobj
-766 0 obj <<
-/D [752 0 R /XYZ 90 256.801 null]
->> endobj
-767 0 obj <<
-/D [752 0 R /XYZ 90 205.614 null]
->> endobj
-768 0 obj <<
-/D [752 0 R /XYZ 90 166.381 null]
->> endobj
-769 0 obj <<
-/D [752 0 R /XYZ 90 115.194 null]
->> endobj
-751 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F60 172 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-811 0 obj <<
-/Length 1191      
-/Filter /FlateDecode
->>
-stream
-x��Y]s�6}�W��L-��ϾQ�ٲ����x
0�.���t��{e� �
bB���� [����9��
-4E]4~��s� ;&3�7AA��`�1�V8Q�x7mL
e��^�s��P<k�^�A�AT�7�e�Ѣq���1t@s�F߳�Hg
�96>5H��f�l�l�f�e&6�(ŔJ
�ep�U�DYƳ(
�R��
��T���]��6u�4ʱa0i�1co��
B��a��b�&�Q��&V�L�e`��u��;�!�.�s����B�h���J
%H�EP�a�Q��h��3�
�8��`�����^o4ϙ��2
btCL�+�<ba�b�a��s
�=�Ŷ@�FMl


l�F5��M�V�=��o�
-G���������p����
-�P�Ɩy
-zv��pnph�r���3^�	J at d�>YP
�{B oY�R �U(��2C�
&�]'&,��i�$&c���L���+�Yy�`�����m7�'��ʪ��
$BYx�$|j5CmJ˪G����{��-�1$����
F�[��jA�I
-���=P�?��cnX�pim�g/��	N
T/�k
-��X}�;�yJ6�nĞ���}3C�"�l"��7ώ��8��91n�Z�z!p��d) �����27�WM��Oy�-�-V��V�Sm����N"��!�~�o��Coк�z�����
w8�?Z݂q��j�ܴ�m����թkO懂�K&�k\8�
���my�>^rة�%~���S���5�Y�%��p���.��D��s��t-e�
-!d����l���I��[@k�K��K���V�a�'�*�s�W+]Z<\�]w��R��ˮ[G�%V�*�b����ut�K1�{��Zfx��v�7���˦�%9f���&*��I(����,����8U�C(%$����)Uը2W���-��_�9B��
�y�bpy�Z��L��*WNk���B�9"�a.W�Q�J?�v������i�d؂#�
?
�
�A�N�M�
*B��
-���u�p3&�h^.8:���֜�����C��ĎE���1��,'�q�%/ڲ��t
L󧗢�O���j&������D�`.�o�A�	�A���줘@?Ū���0܄����qy�o7l����xT�K��o���z
-{�������,L�NO⼚[�I��Y��l?{B�
��
-endstream
-endobj
-810 0 obj <<
-/Type /Page
-/Contents 811 0 R
-/Resources 809 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 613 0 R
-/Annots [ 748 0 R 749 0 R 771 0 R 772 0 R 773 0 R 774 0 R 775 0 R 776 0 R 777 0 R 778 0 R 779 0 R 780 0 R 819 0 R 781 0 R 782 0 R 783 0 R 784 0 R 822 0 R 785 0 R 786 0 R 787 0 R 788 0 R 789 0 R 790 0 R 825 0 R 791 0 R 792 0 R 793 0 R 794 0 R 795 0 R 826 0 R 796 0 R 797 0 R 798 0 R 799 0 R 800 0 R 827 0 R 801 0 R 808 0 R ]
->> endobj
-748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 682.45 334.889 693.354]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) >>
->> endobj
-749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 670.495 382.49 681.399]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.906 641.398 253.705 652.302]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag) >>
->> endobj
-772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.675 641.398 335.069 652.302]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 600.347 196.709 611.251]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag) >>
->> endobj
-774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.201 600.347 327.607 611.251]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 559.295 286.681 570.199]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.651 559.295 458.017 570.199]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 518.244 286.681 529.147]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 506.288 334.282 517.192]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 465.237 320.434 476.141]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) >>
->> endobj
-780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.208 465.237 513.996 476.141]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 454.258 123.654 463.06]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 412.23 320.434 423.134]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) >>
->> endobj
-782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 400.275 368.035 411.179]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 359.223 346.446 370.127]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) >>
->> endobj
-784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.064 359.223 513.996 370.127]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 348.244 183.419 358.172]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 306.216 346.446 317.12]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) >>
->> endobj
-786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.904 294.261 394.047 305.165]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 221.635 251.533 232.539]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 210.054 291.912 220.584]
-/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a81067f9cf8984d1b3febca4488a137e1) >>
->> endobj
-789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.075 210.054 498.983 220.584]
-/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6af8c3e04d66cd611db5efcd92a6c52425) >>
->> endobj
-790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [503.147 210.054 513.996 220.584]
-/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6aa166787e251ef2cbaad9213d8e9d2653) >>
->> endobj
-825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 198.098 264.226 208.629]
-/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6aa166787e251ef2cbaad9213d8e9d2653) >>
->> endobj
-791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.215 198.098 492.808 208.629]
-/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9e4eb4979711bf6699ec8e0f335de476) >>
->> endobj
-792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 186.143 314.597 196.674]
-/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9029c33b6876c560bf78b5b86d0367c0) >>
->> endobj
-793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.87 156.673 251.182 167.577]
-/A << /S /GoTo /D (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) >>
->> endobj
-794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.617 156.673 403.634 167.577]
-/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a132c76cbee67b5bc2ac9e09af9c68c4f) >>
->> endobj
-795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.954 156.673 513.996 167.577]
-/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a1304ca7fa8d3e734d1677709a37d5d28) >>
->> endobj
-826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 145.092 153.542 155.622]
-/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a1304ca7fa8d3e734d1677709a37d5d28) >>
->> endobj
-796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [156.367 145.092 305.029 155.622]
-/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9afdbee5cd06ff135cbf9614b661c9e923) >>
->> endobj
-797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.854 145.092 506.887 155.622]
-/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9ab32d9464a7101eb1893562646a3cdd1a) >>
->> endobj
-798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.041 103.666 273.595 114.57]
-/A << /S /GoTo /D (group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) >>
->> endobj
-799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.371 103.666 453.718 114.57]
-/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a59042baec996bc386154a1825ad56de0) >>
->> endobj
-800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.21 103.666 513.996 114.57]
-/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1aa05a8932097b094ca179e99e2d80b6ae) >>
->> endobj
-827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.085 271.429 102.615]
-/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1aa05a8932097b094ca179e99e2d80b6ae) >>
->> endobj
-801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.418 92.085 452.409 102.615]
-/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a3e5170687052e3962de866e2ab44d8f8) >>
->> endobj
-808 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-812 0 obj <<
-/D [810 0 R /XYZ 89 770.89 null]
->> endobj
-813 0 obj <<
-/D [810 0 R /XYZ 90 712.265 null]
->> endobj
-814 0 obj <<
-/D [810 0 R /XYZ 90 659.259 null]
->> endobj
-815 0 obj <<
-/D [810 0 R /XYZ 90 630.162 null]
->> endobj
-816 0 obj <<
-/D [810 0 R /XYZ 90 589.111 null]
->> endobj
-817 0 obj <<
-/D [810 0 R /XYZ 90 548.059 null]
->> endobj
-818 0 obj <<
-/D [810 0 R /XYZ 90 495.052 null]
->> endobj
-820 0 obj <<
-/D [810 0 R /XYZ 90 442.045 null]
->> endobj
-821 0 obj <<
-/D [810 0 R /XYZ 90 389.039 null]
->> endobj
-823 0 obj <<
-/D [810 0 R /XYZ 90 336.032 null]
->> endobj
-824 0 obj <<
-/D [810 0 R /XYZ 90 241.229 null]
->> endobj
-809 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-876 0 obj <<
-/Length 1961      
-/Filter /FlateDecode
->>
-stream
-x��Z]S�6��W����F��c!t�
���nwv;
��mb��ʼ���#Kvb�	�
��`EHGG�y·dcm�a헣�ӣ�s
krLjj�;����;�0�W�}���Ƹ7
-oS?}���{g~��	��F��z����~8N��>" kD�2�ek����?�@�
#���}1h���s�M��w��ZxW=sW=�M�3[�A�H�Pj��Ӵ���z���6�\�u]��H��'Fy��u��s����ћ�ԛ�m܃-z�:�A�h."D���l���6 =
�^]����t��
I�w���&�3}�LS�<?�_B�6��[�,���6�9����X
����o"�dc|'��F�#Xr�>.����,���`؀Rd�d[�7Q�����I�3
�S�q��
��e��o.'�/�ó� ��ʉ
�Nbpy�W����rzP$������l�-#ʨ���Ft��
�,�S�w�\�Q{�b)������h���x}r5y�B~%�QX��˳��L�Q��^\�'��hxP��7ʆ��|�o�8�� jģЁ9��H����|
�5�G6Q�P2A	��:�O6�������ğq/W<��
��
���BP5��hx
�w�@��Lb����`1��S
96)Ǭ`}��ł~z#��a�U4�c��Cw�1
�V��
P�k!�V��
.e���xt񣰢lnM)�\�j�%T9�s�Jg�1
?
-����6��cݢM'Dq���|�XH����X������R��_�y	��+��r!����Y8��\����W���~ ���KR�mD���п]򃣯d�5�Y��
�d&��A�wւ�n!��%R?m�؈m��JQR"˃x���N-�
�=�D>0� �]w��]�8�Ψ�Z�upF�5G��ջ�<8)ha�;�B����y��e�Γ��eL�
���V�8 �e
�7~֝8�Ei�qb��%�#�-�c��Q�F�we�_V�e<!	��v���|W�Ģ�L�\U<��L�
U�
��_�Q)u�-[��D��w!h�%� 
Iɘ��E��2^'�'�̻S���2�'��j�Q((0yN��t&%#�F�:�y�=*���5�ܪ�묤�]y�)�-���i�}��(�+�m#���a1�	�:pޛ�M�@�w��1$V�4y_lD�U���HE��:��#������`g�
I[F�ٕ.Yvǻ�GRDz]��|т{cq
��3�"�}�'�
-�MRٺL�pp沍���gŐ,�����:LJ­a�0
- 6/�I�h`���;��<�`�f��
#����11D3�~E���\Jd+�
��B�
ٕ�m�-7y�
�6vU�"�<)'I����M�n�W���_x�[_��������]�b�nW1u�>����iq%��;�䝎N&�j<�t9�pOF���;J�:
�q�櫌0Q�
f~��x�|��U�/U�W�Rڻs��.����o�^����ƒvI�
��ح�,�*$�p���YW}�\~zEˮ#8oI�m�	��\z����ԅ�;���ɇ��x���Qn�`]�(T���*(no�*�	J-x��u�W�W?
-���[���r�<��vW)���dd�
-—Ey���)�1X&�k�t
-����z2<�N	
�%<�Q�#�
��фG�ɊM���	R
�RR�DJ.�E�6��$xF�m$*-�J�����x�
-Ŭ��}��l��y����
H���^��n�o�~����v+
�ߚ˝Lo�O��vGk~�aB�OY�o9�o7L8^��C~Z�[Ȁ��Φ��@7�8������\�W�]M��U/on2��$>Pƿ���W�^��w¢(F�c
'��(7��V�~_��
��Mu�C�"ϓ���o��
*m	�k<��-
�Z���y��D
:W�[oT~=S����pU��
E3&�E�����D�q쮘v��j�bC�B
-endstream
-endobj
-875 0 obj <<
-/Type /Page
-/Contents 876 0 R
-/Resources 874 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 896 0 R
-/Annots [ 802 0 R 803 0 R 804 0 R 805 0 R 806 0 R 807 0 R 843 0 R 844 0 R 845 0 R 878 0 R 846 0 R 847 0 R 848 0 R 879 0 R 849 0 R 850 0 R 851 0 R 852 0 R 853 0 R 854 0 R 855 0 R 856 0 R 857 0 R 858 0 R 859 0 R 860 0 R 861 0 R 862 0 R 863 0 R 864 0 R 865 0 R 866 0 R 867 0 R 868 0 R 869 0 R 870 0 R 871 0 R 873 0 R ]
->> endobj
-802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 707.957 308.53 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) >>
->> endobj
-803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 696.719 169.601 706.906]
-/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3cae072091ed81a04a85178bba39494a601) >>
->> endobj
-804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.59 696.719 233.262 706.906]
-/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5c5c70a1d41e6e79718bbeb33df7cad4) >>
->> endobj
-805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.251 696.719 296.923 706.906]
-/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca48a27a450babc28cd9e37b24e4c7f870) >>
->> endobj
-806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.912 696.719 360.584 706.906]
-/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca8cbde0e6dec605c51ef708fb8cd2b52e) >>
->> endobj
-807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 684.42 179.564 694.951]
-/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5637cd5e0441762c2efba8ec4549156a) >>
->> endobj
-843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.246 655.905 343.495 666.809]
-/A << /S /GoTo /D (group__Datatypes_ga6b8429baa2a70746836586aad6905b64) >>
->> endobj
-844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.682 655.905 425.731 666.809]
-/A << /S /GoTo /D (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a8a337487ebb2a4938a04103368bc24dc) >>
->> endobj
-845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [428.428 655.905 513.996 666.809]
-/A << /S /GoTo /D (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a81a7221b987cf71e9577f1d3162fc994) >>
->> endobj
-878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 644.324 177.89 654.854]
-/A << /S /GoTo /D (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a81a7221b987cf71e9577f1d3162fc994) >>
->> endobj
-846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.31 615.808 322.024 626.712]
-/A << /S /GoTo /D (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) >>
->> endobj
-847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.338 615.808 450.122 626.712]
-/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83a60e9236626a09f76d3fe049e03bd6926) >>
->> endobj
-848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.882 615.808 513.996 626.712]
-/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) >>
->> endobj
-879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 604.227 200.565 614.757]
-/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) >>
->> endobj
-849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.554 604.227 346.138 614.757]
-/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab34d1f06ae438f58dd44c6262b3281ce) >>
->> endobj
-850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 533.471 237.386 544.375]
-/A << /S /GoTo /D (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b) >>
->> endobj
-851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.202 533.471 324.558 544.375]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 505.329 215.259 516.233]
-/A << /S /GoTo /D (group__Datatypes_gadc14acd60d7235a72f88850b9a917eca) >>
->> endobj
-853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.075 505.329 302.432 516.233]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 477.188 215 488.092]
-/A << /S /GoTo /D (group__Datatypes_ga7593947fa164900140d09c08b56c6cd1) >>
->> endobj
-855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.816 477.188 302.172 488.092]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 449.046 218.318 459.95]
-/A << /S /GoTo /D (group__Datatypes_ga56026e685fb0fe336a5f346580f84ff0) >>
->> endobj
-857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.178 449.046 365.534 459.95]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 420.904 223.299 431.808]
-/A << /S /GoTo /D (group__Datatypes_ga13f1f84a46d70b91637cb9d6af54af6b) >>
->> endobj
-859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.638 420.904 359.995 431.808]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 392.763 275.881 403.667]
-/A << /S /GoTo /D (group__Datatypes_ga0764a0e607ec4de08a53e6d3b109a714) >>
->> endobj
-861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.697 392.763 434.744 403.667]
-/A << /S /GoTo /D (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) >>
->> endobj
-862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 364.621 276.987 375.525]
-/A << /S /GoTo /D (group__Datatypes_gac37b94ca7dc0c8bb9797e6d91e16492e) >>
->> endobj
-863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.803 364.621 435.85 375.525]
-/A << /S /GoTo /D (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) >>
->> endobj
-864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.704 336.479 221.734 347.383]
-/A << /S /GoTo /D (group__Datatypes_ga763a5fa98155383055703dc08cb3e11a) >>
->> endobj
-865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 254.142 360.544 265.046]
-/A << /S /GoTo /D (group__Datatypes_ga1fd59c6502c8cbb9dbb802e4af34c940) >>
->> endobj
-866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 226 337.311 236.904]
-/A << /S /GoTo /D (group__Datatypes_gab9fc89c0e89d4487a1f69a26849b682a) >>
->> endobj
-867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 197.859 316.27 208.763]
-/A << /S /GoTo /D (group__Datatypes_ga735949470e98393af90b12f534b06cba) >>
->> endobj
-868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 169.717 358.87 180.621]
-/A << /S /GoTo /D (group__Datatypes_gae439fa617415f2153f4793041c41bd9f) >>
->> endobj
-869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 141.575 413.126 152.479]
-/A << /S /GoTo /D (group__Datatypes_gaef15021f65d2810602a9a1bd06fc878d) >>
->> endobj
-870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 102.475 366.063 113.379]
-/A << /S /GoTo /D (group__Datatypes_ga841003bef28b1052aa2b5297a529d4d8) >>
->> endobj
-871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 74.333 358.88 85.237]
-/A << /S /GoTo /D (group__Datatypes_gae311117a92fca76fc66fe3442ff6d09f) >>
->> endobj
-873 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-877 0 obj <<
-/D [875 0 R /XYZ 89 770.89 null]
->> endobj
-880 0 obj <<
-/D [875 0 R /XYZ 90 552.588 null]
->> endobj
-881 0 obj <<
-/D [875 0 R /XYZ 90 552.588 null]
->> endobj
-882 0 obj <<
-/D [875 0 R /XYZ 90 522.712 null]
->> endobj
-883 0 obj <<
-/D [875 0 R /XYZ 90 494.57 null]
->> endobj
-884 0 obj <<
-/D [875 0 R /XYZ 90 466.429 null]
->> endobj
-885 0 obj <<
-/D [875 0 R /XYZ 90 438.287 null]
->> endobj
-886 0 obj <<
-/D [875 0 R /XYZ 90 410.146 null]
->> endobj
-887 0 obj <<
-/D [875 0 R /XYZ 90 382.004 null]
->> endobj
-888 0 obj <<
-/D [875 0 R /XYZ 90 273.259 null]
->> endobj
-889 0 obj <<
-/D [875 0 R /XYZ 90 273.259 null]
->> endobj
-890 0 obj <<
-/D [875 0 R /XYZ 90 243.383 null]
->> endobj
-891 0 obj <<
-/D [875 0 R /XYZ 90 215.241 null]
->> endobj
-892 0 obj <<
-/D [875 0 R /XYZ 90 187.1 null]
->> endobj
-893 0 obj <<
-/D [875 0 R /XYZ 90 158.958 null]
->> endobj
-894 0 obj <<
-/D [875 0 R /XYZ 90 121.584 null]
->> endobj
-895 0 obj <<
-/D [875 0 R /XYZ 90 91.716 null]
->> endobj
-874 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F82 260 0 R /F24 169 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-914 0 obj <<
-/Length 2227      
-/Filter /FlateDecode
->>
-stream
-x��YYs�~���[��@��JR��j
o��W��f�TI��H
�q��Ӹ(��e���<g��� ����~�]]��У�5[Y!�|"׃���d;t���W��DB6�����l4�M���hv��������"?���է?����_-��0�^䢭Ũ�Ԛ^�~�5+��d-p� X�`�����	A�(>�e�-Y�Q:Rۋ�R�2�'�Z��MT�W�]��7|Y
�k�KJ���^�����\�W�V�U�9���q�j
�w�yVVjv ��������R�1j
	E4Ъ�L���d}��uV&���p�	uk���\.<==̟
>��F��d�p3�
ϧ�?O�M;�=�4L2D��4-��@��<�ɼP�/y�j!�\�ŒM��-g��G�҈���aw��

���Wy�Cd0$���WQ�J�i �2.�]����%m2�0
�l`{��K��q0�WB@ѐ��F�,��ث�2��
-6��Q�T���Q�eDZ��v��I����E`�h0d>�g�p�֮�~�/��.���"� H������h�x���{����dWk���^}�<�J�F:
)=A#΋���<Ӷ �좯����
�Iq/�H$Z�{Ug�PG��_�Q��M5����r��m��	F!D�!��u�k���-� �8���
�e9�͈]&�]������ �%��Lu���ۭU��h�����m&�E�E�W��›�F�j`�W=����
V�P��h� ��!�3��x�
⛅���/�<&��q������7� �V��h�S�A�G�C���U����
�{dw�#N�/�lx��d
�w	�ECW����Ki�0/�F�snո���b=#s�r��C
����p�S�&x���vR �<GR��kPV����<K��x
��F���%q���'�q �:��,�AP��<�A`�N�h�=�M%�&>Wm�Ft�
��$
-A��em��>r�k��;jUG
w̚�.=.{(H��b>C.x��⇢0��G�9��(�� �`-g��8��y���	�b��=SZGT$��K�	<
-j~�=��B�u�����}�cC��0�
k����U��';�̺'
���]�L�S��ɉײ��2�r.=��jH2~h�hmyr��tlHD	
-ޡs�	/� b�_�$�n�_�BH�����p��SS�}AHZX�KԄ:p%�CݍHoNМ"ڍ~TOVO��CPtԥ��R$W�H}�
������(��A��J}�qi��o&�t���J��[����X5���^	V0�Ofl�s�4
J\ ��(�A/�2~$E���Tb
u�#�
I�ڑ�4��H� B�R��B`Y'Y��-
�r���5]v]׆d�2�� �J�ۓ�xa���J�IZj��6%���D�S�꒘�^l�]yBY��
��^Y~B[E,h4z�l��l���y�F(�V��U���,:�����8LW�b�)�Eg��:V^f6�D%�.��l;e
�$��s� -x	u]y��sM��Xqy=x3�c�ĽC�ut�
e� k��Lk��՝&�suΉ���]�	�A�g�v~+/��=�
|f���j��dT�
1u�[ ��J޺!�	&�-L�Ծ���/�aP �)~Z`��Oo��	�^�tPEN<�>������x6�}|�F��|�ϛ�9�H�"�6Ӭ��!햌&M4 BHժ$�M�@!G�"K,��o:���(�M\�'|�A�m�Y��@�o�
�#o`�8��~�y8�%a����9�e}� _7�,e'���*�5�ȥ�?��A�M�T����@
z�5x�]�)X ��0�
���4����f6�\fW��|��ٕײ+�G��b��	
-|�b�ފY.y�����!��u�*=��U:w�N��
����xr�����21�
7hI�e�a���d�o�t�w7�&73pU��ǣ��n�cwmD욜��$�o��!���
���g�cp�8<i\�^a���
j�op��~|
B��|'��v�&���Q��x��8}�\��
0�;9�Ӽ�
�*���jⱅ:��Vkmd>x���\	ߧr�ݖ�f�
���:�/9;��ၠ|� ( Ob�|�p��
�0V�[�y��u
���}�}��K^�E\05t�EY�gI<����� AX�p��Йr��_��u%��-��h�$�MU�~��^�k(��(η��?l��v��<vls��$9D^
���Ɓh�
-endstream
-endobj
-913 0 obj <<
-/Type /Page
-/Contents 914 0 R
-/Resources 912 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 896 0 R
-/Annots [ 872 0 R 911 0 R ]
->> endobj
-872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.387 695.671 353.351 706.575]
-/A << /S /GoTo /D (group__Datatypes_ga0aac22e2dc312e8c41418dd8d59701f8) >>
->> endobj
-911 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-915 0 obj <<
-/D [913 0 R /XYZ 89 770.89 null]
->> endobj
-916 0 obj <<
-/D [913 0 R /XYZ 90 712.265 null]
->> endobj
-917 0 obj <<
-/D [913 0 R /XYZ 90 668.739 null]
->> endobj
-918 0 obj <<
-/D [913 0 R /XYZ 90 514.126 null]
->> endobj
-671 0 obj <<
-/D [913 0 R /XYZ 90 489.837 null]
->> endobj
-919 0 obj <<
-/D [913 0 R /XYZ 90 489.837 null]
->> endobj
-920 0 obj <<
-/D [913 0 R /XYZ 90 382.583 null]
->> endobj
-828 0 obj <<
-/D [913 0 R /XYZ 90 358.294 null]
->> endobj
-921 0 obj <<
-/D [913 0 R /XYZ 90 358.294 null]
->> endobj
-829 0 obj <<
-/D [913 0 R /XYZ 107.713 280.033 null]
->> endobj
-830 0 obj <<
-/D [913 0 R /XYZ 107.713 265.423 null]
->> endobj
-831 0 obj <<
-/D [913 0 R /XYZ 107.713 250.812 null]
->> endobj
-832 0 obj <<
-/D [913 0 R /XYZ 107.713 236.202 null]
->> endobj
-833 0 obj <<
-/D [913 0 R /XYZ 107.713 221.592 null]
->> endobj
-834 0 obj <<
-/D [913 0 R /XYZ 90 213.738 null]
->> endobj
-922 0 obj <<
-/D [913 0 R /XYZ 90 209.255 null]
->> endobj
-835 0 obj <<
-/D [913 0 R /XYZ 107.713 130.112 null]
->> endobj
-836 0 obj <<
-/D [913 0 R /XYZ 107.713 115.502 null]
->> endobj
-837 0 obj <<
-/D [913 0 R /XYZ 107.713 100.892 null]
->> endobj
-838 0 obj <<
-/D [913 0 R /XYZ 107.713 86.281 null]
->> endobj
-839 0 obj <<
-/D [913 0 R /XYZ 90 77.486 null]
->> endobj
-912 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F60 172 0 R /F82 260 0 R /F24 169 0 R /F72 194 0 R /F106 568 0 R /F11 610 0 R /F8 611 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-926 0 obj <<
-/Length 1821      
-/Filter /FlateDecode
->>
-stream
-x��X[s�F~�W�b&�wW�Jʛ
c�m\��t�
#`M�Du	���goB`
-��v�O{�:{�\�s�����uۺ�.n|l�(d�Y��b�wC�1x�Y�l�X�C0��]<ɣ|��P��Q��5/�
��б
��e��
�~o��-�dy��i���[3��ha䄁��L��R֕5l���Z-��'H�h%z�$!��ZG� G��ӶoW�P��6/@��
��z��JƷy<���Q���Q�wm0M�c4��aMI
-�C)"�W�y1���pQ�䊘��6��9�yZ���q:�l�\�
�BSF�����t0
-C
-y�s�R��<���ߗu�^���H�|
Z
X���=>ލo���m��;�
���o���]�{�Y$��0��}d�r�b�k�DjY�)G�k�1Wt�-<������;�N�L���?�y
�Q�K��=�>����U��{���f $|��Y��Z�x��E
��?b���D���x�U��ƽ��
�K��s�v<+��O�@�~n�X�<H���J� �k\��"K�[�����sv��ꍆ��E(�
h[�8�A}NB0n$��>
-@��x_}�:x{y�C_%���+���+��-W��,=M���v-}ϓ�
1�t~����~x~�:)�
hqQg�wwO!�q��J��U>=
{���S� �u�yJ�x�3'q*�-v�}(��Vw���C���{�=�6<�EX�2Ԋ��VDқ%
1�LUڞ
��7�_~Ѫ��x�̩�D���%�iI�6���$g!T��}�C���T�f�zœz�2X�ǮhRd���O�F�I
'D�!�R��������3�N&��w�N_�^� ;7B|�)�
�f��N������]�y�<�|
�D3h����O�2a�K_A���1�7y�^��B#1�*C�1�^ES at O�=Z�z7�QZG�4��W�/��lIa��uY�(���T�@�ש��&s�q�;,�ωf$a�yw�"e�f}]��<ՓQ�ͪU��	�΄F �Z�-�C�P�� ;���61�n�c:7c�ܐ��l5
�
��7�3�x9mB���(��vpB��V���
����P#4 Ļ"���U�� 8
�uY�!r���a}ݱ���E>��S��*�u�3��
-
-�ɀ�>
-���%�{J�
�R��hx��|���]�>���!�KA�v����R�.^%��0�*x
gU�
���]!]mƵ8�em��'js�k�Q���*)�>C��*}�������q�@�������k�Em�UfX�p}PuX���������R,AM�t�s-ε7q�T/�M��F��
 ��(F�[<��^������cf� ��;�bU �k`�'�*.�jO��d�����>S�Pn���Hߐ��\�I��s^�2UԲ�x{ϫ���t�*}) C!�9��4�
y�G�D�H�uIT���H]��?�����]�\a
-�]�:��S%G��:+��+т@PU
��5�l:�P! B��0�e�`]E颊���0$
���
��N�_�<`v)�
-�a�g�p\�5ҿ��e��tMc��4��*P���2�.�f��
-M6�ܝ��i]
����Tq45��
C�aeL��i�Kz�� ��0��+��b��Jʧ�( �
�d������ܜO��Ň�n�Ց�����V�����ڿ��*k�q���

�<x+�Z�4�ԓi��"0 ��'H6S ��}�V�Jџ��uPv�a��n
-r��4
e�W�P?��մ�2���<�e�~q1��@0����a߇���sS5�̔�8��D�
�����
��F����Co�����h��9�7.z�c]g�ݏ� ��6
-endstream
-endobj
-925 0 obj <<
-/Type /Page
-/Contents 926 0 R
-/Resources 924 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 896 0 R
-/Annots [ 923 0 R ]
->> endobj
-923 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-927 0 obj <<
-/D [925 0 R /XYZ 89 770.89 null]
->> endobj
-928 0 obj <<
-/D [925 0 R /XYZ 90 721.073 null]
->> endobj
-840 0 obj <<
-/D [925 0 R /XYZ 107.713 645.429 null]
->> endobj
-841 0 obj <<
-/D [925 0 R /XYZ 107.713 629.639 null]
->> endobj
-842 0 obj <<
-/D [925 0 R /XYZ 107.713 613.849 null]
->> endobj
-897 0 obj <<
-/D [925 0 R /XYZ 90 602.107 null]
->> endobj
-929 0 obj <<
-/D [925 0 R /XYZ 90 597.623 null]
->> endobj
-898 0 obj <<
-/D [925 0 R /XYZ 107.713 516.474 null]
->> endobj
-899 0 obj <<
-/D [925 0 R /XYZ 107.713 500.685 null]
->> endobj
-900 0 obj <<
-/D [925 0 R /XYZ 107.713 484.895 null]
->> endobj
-901 0 obj <<
-/D [925 0 R /XYZ 107.713 469.105 null]
->> endobj
-902 0 obj <<
-/D [925 0 R /XYZ 107.713 453.316 null]
->> endobj
-903 0 obj <<
-/D [925 0 R /XYZ 90 442.514 null]
->> endobj
-930 0 obj <<
-/D [925 0 R /XYZ 90 438.031 null]
->> endobj
-904 0 obj <<
-/D [925 0 R /XYZ 107.713 355.941 null]
->> endobj
-905 0 obj <<
-/D [925 0 R /XYZ 107.713 340.151 null]
->> endobj
-906 0 obj <<
-/D [925 0 R /XYZ 90 316.453 null]
->> endobj
-931 0 obj <<
-/D [925 0 R /XYZ 90 311.97 null]
->> endobj
-907 0 obj <<
-/D [925 0 R /XYZ 107.713 230.821 null]
->> endobj
-908 0 obj <<
-/D [925 0 R /XYZ 107.713 203.076 null]
->> endobj
-909 0 obj <<
-/D [925 0 R /XYZ 107.713 103.553 null]
->> endobj
-924 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F106 568 0 R /F11 610 0 R /F8 611 0 R /F10 612 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-935 0 obj <<
-/Length 1243      
-/Filter /FlateDecode
->>
-stream
-xڭXK��F��+t�T5�~�ۛ��8�,>9�-K$,D����h$!�����F��=�}�H�H�����h|�I`�*���<�$�‚T�6
>�\D�'��
P�P��}���ɛ��m�f2�:�����K�&��G�>�`���ܚ�[�h
��
-
F�Hm
-&��=j�
;0�R��[�@��bJ	�vٴ\�Y3f���t�N�2�����*p*f���
��{N#
>%���1�1D2�\4�������`y��fu�(�XFeJ���3��ױg��`�FZ��Y�5�o�P�&i���f@�E���o��ZT�n�b�-w�	I�XZN�l[���0j
T
�h�)�EĐ?��H����l�\d�l`Cn��v�2�!O���5q!P}uZ����Y�)��N�I���O3�1�lc at Z)k��<�$L��K
���UZ!�cQ�a�	0D� �"�1�ͥ�&�
G�ؾ��2K����q
��0��ī4[��
��s�h����R���D%��� q��^䘡��7��4�[
yq(�-�O��*��N�^@(�{
-
`q �K},��e�&"I���F�����)��>7>��[>�O�m�L
��-�Li;8KL�b"Aq��q�aR$�L1ph���w������P��<� (ط ���C�X��g�&��y�[kx7̅����"�8k�?�XP+��To�Gid���4��bڌ�‡�|5k_ZB5<���=����*�
��
�����p�F�B^b�a-�y���",��v��cU8O���a���[���>�T������p���
��Jڃ�(�ϛϸk|Oa�X`
�� cm��8�c���Ǻsp!WW
,NZ�6�.?�� .�x� =�[�틳�
ޚ��:ֶܗ�sUd�>/=M�F\ʞk�={�l~�d��Tn�:E
�X�l�f�֜'�EF�k���V���
_܍gW��V���9���Y��T_�F�X���Cl
�ӓT��D����"�3���.�Q�����n�_�)?�5��O��7)��<b2D�#)�~�xܥ�f����t�i�?x���՚U���c#SO�߮y�:����Ÿ_�߰�8�Zs���
^g�5}��߿��W��>��dQ}�ao[�i��o��M��kj���d�d��Z�\ZL�m[d)��C�%|H�ڥ��������Hc]�
f�+�SYn~���[
C����
�^Xk ��µ��΋���u�

��?�z
-endstream
-endobj
-934 0 obj <<
-/Type /Page
-/Contents 935 0 R
-/Resources 933 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 896 0 R
-/Annots [ 932 0 R ]
->> endobj
-932 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-936 0 obj <<
-/D [934 0 R /XYZ 89 770.89 null]
->> endobj
-937 0 obj <<
-/D [934 0 R /XYZ 90 721.073 null]
->> endobj
-910 0 obj <<
-/D [934 0 R /XYZ 90 704.201 null]
->> endobj
-938 0 obj <<
-/D [934 0 R /XYZ 90 704.201 null]
->> endobj
-939 0 obj <<
-/D [934 0 R /XYZ 90 633.655 null]
->> endobj
-933 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F24 169 0 R /F97 497 0 R /F60 172 0 R /F83 262 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-961 0 obj <<
-/Length 1928      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~��������*R�0�[�!�Y�=���ڴ#L�\In��Ûlي�$ڰ'ݨ�s�>�C�h����ף�WG	JbG׋(���	1<ͣwc99���Ӻv��l��E�6YYL��?�LL��~=��z�qD at 4��%�T�l5z�'����u�KTtk�"N\������ZaD��5�����%	F��VI��VK���4��Kw�	J���qtƌ��KF��^��C	#c�
-�q~�P������Qۙ	�H$���\��_V0}<n���Y��� 9�t 
�B���W��i��t����)�Q��A��{��ӿ�7��鞙�m��d(zg�YY���
K$�A�_���N���Ӧ�q58)6�Ԁr���M:��C�ez,Rp�}|��MWm(��_Ż
��Q�QN��D���Z{I���Yl��A�� ���AV,ݣ!s�����
H�7됡52���
� �D��z;�̊Y��k7~;R0$���
��GD�'a ��t6���\W�G�b(Vq��s�!�8�@�)B��7:O=w�x�:�H
p7 �����v�jn�&��Z�����Wz�AW{�B �t�ՠ�� ai� ��y>��@��� �믝�u�-
��{�q���cv� {��"D�=���K��L �gE�_0UK��7v ����*Ʒӗ;6���R�40��Ĵ�ם)�D��{��0ϙ�)�c�a!�
�S`��9��ݴ�c�d.[;��(Q���t�5G��(��1�i�a�M���7Y>��ɥ�����/G�-��`�W{�p[�׮����t.�?$\��j€����
-��Vc��Ru�u�:�A����;:�}�vFL�(�2~F:�?3
���\
�^�6��G�1���c���#���Ѹ�bW_��*A

-��s�b�����#pX�V�0s�@b�v��>:�7w��_�;�S��A�P��!�� AZ�|�8o�3Y@��_8ըY��
�����-z�6.R$V(�n0D�{�H��|H�	�t�s�
�R�B�)�%��� ;��c0�
��3wM{~�j�
������9$�Zw�Vf�S�هW
-��B���=�L���r#���bDI
�y݇#�N�IT
ɀ��\��J�Ӗ���:F�)��@��e1�x�)ͳy�VKmy�=�6,nBƻ
���  �6)����_�O
��ꍣڃ�<��b޶u�]�~�!�Y�:�&|��`������s��Z��)�șYΘm��˚ra��z��
���e1s/Mw�j�V�?~����u=I(cǝد���r�V՘{������G�I��6�O���zJ*�#
ʓ�"��E�E��9��
������Q�C��0q�����yz�|��L-F=7����]�Z���fK`�w��g�*L�\
Xf=I�%��7zb�?ؒ���`�^T����R�.���B��ź�8�_ܓ������i�Iy �GqL�J��?ڬ SX���5
��5��s���n6�����,h.�j����S�biik�D�d�-�Gג��jz�=Ō������m
������v��=u=t����{PH���Z6Š)�\x��q>�
��;�9/��X���v�s�ʣvk�	�۰PP��1�)k��ڃ�
ݤY
��/t=����)�������a���:�ּ{Zڙu[Eg����;o1E�}�ߗ�0
-�`��{�(�[��F�\���
R�3�ݔ���v�6&B���F;j��7�HB at O<�GR�%r��P��D�����.���r�.u��\�G������{���&��p�'j�\���d6����e�3��(��<�GA[����&-2o�f�����fY�b�f�����,%��u�͊U�a�^�l�p�-0�����?�0����{o?������.J����ED�
-endstream
-endobj
-960 0 obj <<
-/Type /Page
-/Contents 961 0 R
-/Resources 959 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 896 0 R
-/Annots [ 940 0 R 941 0 R 965 0 R 942 0 R 967 0 R 943 0 R 944 0 R 968 0 R 945 0 R 970 0 R 946 0 R 947 0 R 971 0 R 948 0 R 949 0 R 973 0 R 950 0 R 951 0 R 975 0 R 952 0 R 953 0 R 954 0 R 977 0 R 955 0 R 956 0 R 979 0 R 957 0 R 958 0 R ]
->> endobj
-940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.879 523.929 363.032 534.833]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_adbcbb0f82f71091112f2c768d2107bb8) >>
->> endobj
-941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.621 523.929 513.996 534.833]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 511.974 194.603 522.878]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 485.029 513.996 495.933]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a26270ebae88b22836f94cbdd003a022e) >>
->> endobj
-967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 473.074 186.852 483.978]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a26270ebae88b22836f94cbdd003a022e) >>
->> endobj
-943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.07 473.074 401.644 483.978]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.954 473.074 513.996 483.978]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 461.118 282.981 472.022]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 423.214 513.996 434.118]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_afa0c60a0cce5f80bcf4fdd22ba4913a9) >>
->> endobj
-970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 411.259 186.852 422.163]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_afa0c60a0cce5f80bcf4fdd22ba4913a9) >>
->> endobj
-946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [192.101 411.259 403.675 422.163]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.005 411.259 513.996 422.163]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 399.304 278 410.208]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 372.358 370.103 383.262]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a4ce5a35bce2cfe414dd42739b15819c7) >>
->> endobj
-949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.321 372.358 513.996 383.262]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 360.403 194.603 371.307]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 293.777 392.768 304.681]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_ab1e38080e1de577a82f181e1e87cea61) >>
->> endobj
-951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.986 293.777 513.996 304.681]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 281.822 237.761 292.726]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-952 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.184 281.822 392.848 292.726]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 254.876 386.153 265.78]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a2c8e06a14ae0f5878428e7385e98bedf) >>
->> endobj
-954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.371 254.876 513.996 265.78]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 242.921 194.603 253.825]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-955 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 215.976 386.71 226.88]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a27c82492b590d5445541451928a593ac) >>
->> endobj
-956 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.928 215.976 513.996 226.88]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 204.02 237.761 214.924]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.222 204.02 485.808 214.924]
-/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
->> endobj
-958 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-962 0 obj <<
-/D [960 0 R /XYZ 89 770.89 null]
->> endobj
-58 0 obj <<
-/D [960 0 R /XYZ 90 721.073 null]
->> endobj
-408 0 obj <<
-/D [960 0 R /XYZ 90 699.397 null]
->> endobj
-62 0 obj <<
-/D [960 0 R /XYZ 90 699.397 null]
->> endobj
-963 0 obj <<
-/D [960 0 R /XYZ 90 595.769 null]
->> endobj
-964 0 obj <<
-/D [960 0 R /XYZ 90 539.529 null]
->> endobj
-966 0 obj <<
-/D [960 0 R /XYZ 90 501.27 null]
->> endobj
-969 0 obj <<
-/D [960 0 R /XYZ 90 439.455 null]
->> endobj
-972 0 obj <<
-/D [960 0 R /XYZ 90 388.147 null]
->> endobj
-974 0 obj <<
-/D [960 0 R /XYZ 90 309.376 null]
->> endobj
-976 0 obj <<
-/D [960 0 R /XYZ 90 270.665 null]
->> endobj
-978 0 obj <<
-/D [960 0 R /XYZ 90 231.764 null]
->> endobj
-980 0 obj <<
-/D [960 0 R /XYZ 90 164.514 null]
->> endobj
-409 0 obj <<
-/D [960 0 R /XYZ 90 68.474 null]
->> endobj
-959 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1007 0 obj <<
-/Length 1869      
-/Filter /FlateDecode
->>
-stream
-x��ZYo�F~ׯ ЇJ@�ޓ�E��G��M�D}J��VQ�T(�q�}gR�DˊM�I-wgfg�9v��[x����۸wv`O"�S��=���K$|�5�>�?�4~�1?DD��Ȍ��}3�|3~���.ǽ/=��G�z��Л&���7���
FL��W3)�8e�\y�{��#*�~8�B�����
~bE

	Ƹ�^�� � ��Y°<&
C"
*yZ8Ƒ����U��~ĘN�M����v$B"��"����<JT��C���ȗ����]��"��`HiؿNA�y4U��;5�o*W)�h�J�]�u�
	7d��#�Ȏ!���V %p?Jg�e�M�E��n|���et=r3�-�Ⱥ��i) ��
� ��[�?��t��);6��)
- at Y����
-�L9�8�N�*��
-[�
�a�J�Z
5�o��Г@�1o�(� �Y�N��Bͬʯ*�
�7nh�#�MV(��b�ڨR��%���D%�U�g�H��G|ę�,�*
CJEsև� ����
k��
��wf���'�j杌DTȟ,T1��S�˻u�6j����w|/'k7�Mq�W�F7Z��SC�J84�4Dܗ`V�`V95��hm�ԁ�wfД��M�� "��ϳu\��;�����[�b���\9OhRfSI9�b	����P܇�
D k	��WalO."Bp����u�`��@t4�P�Z?�{��&#�!lN3��T��g�
�V�x\j�Gqɨ4�gq�R
;�M2-8�ջ�q�?za��|���N�+�� �Lplc=֬g���}�Fy
}.=��Q2�^��m���
VLK����H�
-�t�D?�Q8?��'4$���8]fI�P�ʶ�	�&XB��,��� 
Zg�7|�ρnU? *:�cM���Ѐ�JB(d��],��"Ie�A��T�%qY~m%}�(. &��i���?*�z~j� 2�@<6$��4aG%
- �)T�N!��z[����T�p�����O��.���d���#0k
L�U��ݩ�\;2G�8G
�lZ�
-��W���
d�
-Ym蔈����)fٶh�.�� �J�݄"
�;����Ƽ������n
n��۩�
4����
-GrW�l�\E�	��3#���p�0":�H3�-�[��Nf���dʂ���"" E�D�E��0�.�ҵ	#���:�y�ih�C ) ���R�.L��*��_w]���85�֋��u�4EG��2���/]6tY�
��m��To�M~�#,Y�-{�	zDh�z���fǓ�6Y׬�rOe��{W�
	��NF(�!"M|^��KQ��ʩ���v��/*����[*#08�U�wUgY�FN�8�6�I�B�غˢ�k�E�ǡ�k\��k�<=9��+*}$x�,�n`�]"K_���dd���,i=.�`W���^�똨[
CFg��(!�zJ���Uy�~�6�<^���G�ן���߻�5K�5;�;�4�o�j��$��Nc��c�
C���|���UC9ս�*��P����Z!0�amo�q��IJZ/bO/�l�M�Э�P,�ͽ���p���T����<K�j�yi��_gwD0]��-�yZw��Nѷ-�6|��uÒ<ʪc�N��[�I�T�tw [...]
�]'̻Ȁ؎��
w

�l>�
�Q�A!AJ���0�ؗs�����6Z��ׇ����n�
�g�n˰��[
� pVq|Jgg4�T���U	1+�?�������8Geuu�,��˳������f�!Vw�ဃ�]�-їdyu�
����h���<nF
-endstream
-endobj
-1006 0 obj <<
-/Type /Page
-/Contents 1007 0 R
-/Resources 1005 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 896 0 R
-/Annots [ 981 0 R 982 0 R 983 0 R 1011 0 R 984 0 R 985 0 R 986 0 R 987 0 R 988 0 R 989 0 R 990 0 R 1014 0 R 991 0 R 992 0 R 993 0 R 994 0 R 995 0 R 996 0 R 997 0 R 998 0 R 999 0 R 1000 0 R 1001 0 R 1002 0 R 1003 0 R 1004 0 R ]
->> endobj
-981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 583.286 324.618 594.19]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a8758040d0309c4f1bce32f105cf4c554) >>
->> endobj
-982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.836 583.286 462.499 594.19]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [476.307 583.286 513.996 594.19]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 571.33 172.909 582.234]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.55 543.165 275.234 554.069]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a6bc95e351716acc4b56829a62464cddb) >>
->> endobj
-985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.678 543.165 414.341 554.069]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.64 543.165 513.996 554.069]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [130.966 531.21 202.448 542.114]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.231 503.045 336.604 513.949]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a80b6aa70e38446636a0523f06353c8f2) >>
->> endobj
-989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.729 503.045 475.392 513.949]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 503.045 513.996 513.949]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 491.463 167.678 501.994]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.33 462.925 284.573 473.829]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a12aac19f5cba4af9f1a177cd7b772242) >>
->> endobj
-992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.797 462.925 424.461 473.829]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.515 462.925 513.996 473.829]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 385.846 275.539 396.75]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a0340ab7363ad499c2d6a0182bc874057) >>
->> endobj
-995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.354 385.846 414.018 396.75]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 359.809 278.856 370.713]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_adc5d20f68f042656187d507cff5ceea7) >>
->> endobj
-997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.716 359.809 477.379 370.713]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 333.771 283.837 344.675]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a23b660d538bf3d3140ab3a4dfe649f61) >>
->> endobj
-999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.177 333.771 471.84 344.675]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-1000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 307.733 289.925 318.637]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_acb2d4b9c84cd7b7b4f2abb568471c424) >>
->> endobj
-1001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.74 307.733 428.404 318.637]
-/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
->> endobj
-1002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 281.695 284.385 292.599]
-/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_ac7eb99bc96d86baf058f856e41b2ddfe) >>
->> endobj
-1003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.201 281.695 396.852 292.599]
-/A << /S /GoTo /D (group__Datatypes_gac3cf4d5c81ff784729bb5d1c8d48ce23) >>
->> endobj
-1004 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1008 0 obj <<
-/D [1006 0 R /XYZ 89 770.89 null]
->> endobj
-66 0 obj <<
-/D [1006 0 R /XYZ 90 721.073 null]
->> endobj
-1009 0 obj <<
-/D [1006 0 R /XYZ 90 629.693 null]
->> endobj
-1010 0 obj <<
-/D [1006 0 R /XYZ 90 600.731 null]
->> endobj
-1012 0 obj <<
-/D [1006 0 R /XYZ 90 560.56 null]
->> endobj
-1013 0 obj <<
-/D [1006 0 R /XYZ 90 520.44 null]
->> endobj
-1015 0 obj <<
-/D [1006 0 R /XYZ 90 480.319 null]
->> endobj
-1016 0 obj <<
-/D [1006 0 R /XYZ 90 400.992 null]
->> endobj
-1017 0 obj <<
-/D [1006 0 R /XYZ 90 376.838 null]
->> endobj
-1018 0 obj <<
-/D [1006 0 R /XYZ 90 349.106 null]
->> endobj
-1019 0 obj <<
-/D [1006 0 R /XYZ 90 323.068 null]
->> endobj
-1020 0 obj <<
-/D [1006 0 R /XYZ 90 297.03 null]
->> endobj
-1021 0 obj <<
-/D [1006 0 R /XYZ 90 255.19 null]
->> endobj
-410 0 obj <<
-/D [1006 0 R /XYZ 90 143.749 null]
->> endobj
-70 0 obj <<
-/D [1006 0 R /XYZ 90 136.981 null]
->> endobj
-1005 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F11 610 0 R /F83 262 0 R /F92 331 0 R /F24 169 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1052 0 obj <<
-/Length 2448      
-/Filter /FlateDecode
->>
-stream
-x��Z[s۶~���[��ƍ �<�I�I�69���v<4	I�H��K
�ןō7Ӳ\+I�3&���,�����_�~�8;b/F��»Xy1�B
�@�[�}�C�K�1������R��˜��,��&Y/�4������*I�y}'W�Z�ȗ�Q����/~=����3�c���F^�;��7�2���Èőw��<N<������a�7F4PM�����d� B�&��m��L��/�"m�5?���K1���#�cC�/
�?����$�k��v&�m��q'wW �^�E�"��{F� 
��	�
ρ@S�iSV�C�Ǻ����a�(2�x!��C�$
��[���n��`4���
@�9�`��檵U�;=@-��Q�
�k���2��&(��I��ۈ�e3�
���D1��'�4���ɖ9�+v�>=���yL\M[����(⑕��j�B_��Œa�'��|A��Tm̡���Λ��)ٶ�tbKF�Q�t]�c�����[i~^�zu' �4���3 5
.�o,@���g��Ium�Ӂ
�2Fq;�1#Y��P8�C�[2  &�&��	��UU�.w�/����	��5jän~9���
!�l�4
-C4
-{|��<�1�j���@U}���,L���h������4&
�����f�D9�\[|�AS�b
�ƿ��0�2��r����a�x�
��pQ(
�9��e��h��uσ�B�@a�z��a*��Q�B8F�}3c�>n�Q�P˹w�����2c'
(���8.���۬� 9�>�ȧ��7�U���� M�
�� �I�!�YM�Ng5*M)�.���LN4S'5�8��D�$
-!q5&�Oa
�N��C(����yDDP�#'c\�t�긜Q	Є�]s*� X����4]p����Q&8���@h�h

-C�F��:���
"�
����#�K����(�� 
��9��Hx�"�Ȩ
1Da��r&����B��	{#��d�U���@�%]��4l��muD���ŧO���P����P�K>j�a_�֞v�تlڗE��ja�J3)uD���ִt�Gִ���+9���I-3t�y~IA
}�'1w��$[�)
�S`�vA��J��ON����	u�߉��{�La8�R��ЃBE}�9l���!6n����������/
��E���|���9QgiM[�x�x��}Y�
�*�s�t=$�ͽ1��C�	u�����Ҹ���4څ�#�i�{]٥3�N��V�1
����
7�p��o�.�:�
�#㐫<)�ZB빌0�I�`�e��0�����$�;�n��j�����
�����
��f���U��_�U
�X2h�Y�U��
\2y���o�ם�߷([���� D�ѯi(y}yU�E�;
��̳��K��`�s`�y3ɘ�4
�vφ�p��P	
��V�P?��FN�Gݖ�,��B�zL�
?dZ��?�3‡!Z�!����	^���#e��z��J�K	��ْ����Ln��A$Fvk٘��g�.;����ڝy��홭�	���X��'��W�K���$�Oc���E��"�
\����.b1��
\�.� \ ��CV&3p�E8�
؇J~���o@��EL��PD�8
�
�ܕ�3�pL�y���7�.�>�W����W0��
�ݷ����
�8�a����=����v��(���8 at 1=e�
4�z��^�z������e@���\Dz�T2ٝ������������wBD�L��" a���@��c�<2$ ��c&��t�T��G�!h� �n
�����غ���H�9��Je����o�u0�`�d�!�H[u�qS��G�>
9���d���
�~f���N 9��2�߲d4��%<#���A���y!�$ߺ;//d�V�^�
��r��7��s�;
-vwY&G�t�s��7B}^6d�Eǁ�X��4��1��^5�X��6�U��ty&
%�Ԛ\)
�kIj�R��}UVwj|y�0�:�gx>_�
{d
-.y�K�
�/�^�B#,���z�"�n�&�a�!�U]�@�c�^���u�
ݭ�}��4���wɍi\�]I�����C�����l
wկ�J�y�kz�J:A�kY�n@'�I��fNӃ�(ϕI��v�(a
�A�}
��f�3ҝT;F�G���62�8Ţ�T���r�F��ba
�`JU?(�VI����>�:럢K�	�f_�BV��Q�&�lU�O�Lu5
-�ҭ|:��D ΢�5��vڗ�d��H�7�Qӫw�B�ʎ�z�/���C`�\��!
-�h"B�U�xn
��b�&k9�+8ݟ��~P
[���m�]
*"Z�=$�F���^J�O����k��r:`Y��U7M�z~~ծkY�QZ�n{�~r",��CŮ����*�i� w���;P%C�Vb ���cꏭ�7h��D�q�jǼ%(���n�a�
-endstream
-endobj
-1051 0 obj <<
-/Type /Page
-/Contents 1052 0 R
-/Resources 1050 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1070 0 R
-/Annots [ 1022 0 R 1023 0 R 1024 0 R 1025 0 R 1026 0 R 1027 0 R 1028 0 R 1029 0 R 1030 0 R 1031 0 R 1032 0 R 1033 0 R 1034 0 R 1035 0 R 1036 0 R 1037 0 R 1038 0 R 1039 0 R 1040 0 R 1041 0 R 1042 0 R 1043 0 R 1044 0 R 1045 0 R 1046 0 R 1047 0 R 1048 0 R 1049 0 R ]
->> endobj
-1022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 641.225 223.166 652.129]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a5fa6bcd4ec3cf844646033688f2fdf0a) >>
->> endobj
-1023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.982 641.225 298.463 652.129]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 607.294 277.402 618.198]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_aaf38dc5a17ef89e16c45f363397afb59) >>
->> endobj
-1025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.218 607.294 352.699 618.198]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 573.364 296.52 584.268]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_afabc584f4f391708d6c0d7c47030471a) >>
->> endobj
-1027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.336 573.364 371.817 584.268]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.682 573.364 489.176 584.268]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 550.392 285.96 561.296]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a39db5035590b4bf7017a43cdcca6a49e) >>
->> endobj
-1030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.775 550.392 361.257 561.296]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 527.42 305.078 538.324]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a1ef606afeb25edded051be3b0c728086) >>
->> endobj
-1032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.893 527.42 380.375 538.324]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.48 527.42 494.974 538.324]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 504.449 230.608 515.352]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_acad04388edea0d80b20c40266a3c3f14) >>
->> endobj
-1035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.423 504.449 331.917 515.352]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 450.053 244.456 460.957]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_abe5af687ddf08c6379bd115d210ac22f) >>
->> endobj
-1037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.271 450.053 345.765 460.957]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 427.081 221.203 437.985]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a001b2a61c18a500a446151a9024de3fe) >>
->> endobj
-1039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.019 427.081 322.512 437.985]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 393.15 252.755 404.054]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a474cce1b8348a126a8496cea7952a1f1) >>
->> endobj
-1041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 370.179 222.319 381.083]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a526a2d8ad27e00b633408a36830dc2ae) >>
->> endobj
-1042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 336.248 223.973 347.152]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_af0b12578ecdb0571ca51ee09789b2fc3) >>
->> endobj
-1043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 270.893 238.369 281.797]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_aa1816497499ee569563a6d97a4ff553a) >>
->> endobj
-1044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.184 270.893 339.678 281.797]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 247.922 241.686 258.826]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a1e3bb22af6b60660fcb8d201b09ec7ed) >>
->> endobj
-1046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.546 247.922 403.039 258.826]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 224.95 246.667 235.854]
-/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a249071ec2d19ecedaaf4e32ca8fc4a8d) >>
->> endobj
-1048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.007 224.95 397.5 235.854]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1049 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1053 0 obj <<
-/D [1051 0 R /XYZ 89 770.89 null]
->> endobj
-1054 0 obj <<
-/D [1051 0 R /XYZ 90 704.286 null]
->> endobj
-1055 0 obj <<
-/D [1051 0 R /XYZ 90 655.571 null]
->> endobj
-1056 0 obj <<
-/D [1051 0 R /XYZ 90 622.282 null]
->> endobj
-1057 0 obj <<
-/D [1051 0 R /XYZ 90 587.898 null]
->> endobj
-1058 0 obj <<
-/D [1051 0 R /XYZ 90 564.926 null]
->> endobj
-1059 0 obj <<
-/D [1051 0 R /XYZ 90 541.955 null]
->> endobj
-1060 0 obj <<
-/D [1051 0 R /XYZ 90 518.983 null]
->> endobj
-1061 0 obj <<
-/D [1051 0 R /XYZ 90 464.398 null]
->> endobj
-1062 0 obj <<
-/D [1051 0 R /XYZ 90 441.615 null]
->> endobj
-1063 0 obj <<
-/D [1051 0 R /XYZ 90 407.685 null]
->> endobj
-1064 0 obj <<
-/D [1051 0 R /XYZ 90 384.713 null]
->> endobj
-1065 0 obj <<
-/D [1051 0 R /XYZ 90 352.508 null]
->> endobj
-1066 0 obj <<
-/D [1051 0 R /XYZ 90 287.142 null]
->> endobj
-1067 0 obj <<
-/D [1051 0 R /XYZ 90 264.151 null]
->> endobj
-1068 0 obj <<
-/D [1051 0 R /XYZ 90 239.484 null]
->> endobj
-1069 0 obj <<
-/D [1051 0 R /XYZ 90 201.605 null]
->> endobj
-411 0 obj <<
-/D [1051 0 R /XYZ 90 72.447 null]
->> endobj
-1050 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1092 0 obj <<
-/Length 2063      
-/Filter /FlateDecode
->>
-stream
-x��YY��6~�_�J
"UE
	N��j�SN�N��>�)-MBV(R&)���o��!Q�DJ*O< t7�������������W!�"4��K/�^�G��z�'LL���@ 0H�}�˛��7�w�������
�&�3��Px����o�K���
F,ޣ��|��{�n�s��)Q�^��&�G�8��2�$Ę":#��f���AAs=���5
q���h&�G<��/�bUme���E
������~�T7r���œ�P\E/e
р�&eQ7#j���� �C��ڬ�Uܔվf�.ؿ�f�
-#2����p���(�����a���[��6Y�p8�}��iF��;�>b~dϧO�6�a
O�"5/�m�4,���I��Y�2�ea�IB�]k`�H~M{v`oFBP��uV$�6��'̷�ɕ��y�?Fd�(�u �[$���B#�C�h��f�ή���d�2�� �BX���<ndjV�U�NG�
����M�إj
�ƽ����+�R��q-�e��9D���΂���i3 -q�M�M ���F��:[kY4;p����y�|J0,��J�`��~Ɓ*������T+�Goui.]rJ��q�Q��0�B�b�=j�Z���SR��\��\Y��gM0fr��Q$H
�$k�l�`�������x�(����R
	�o�<u�j"���|��c멪IM囝�|��u(�s�҉�]�3M�)��k3WE���((
E���`b� NZ�E�+
Q����_�(Jȳ�XV��P�)�
��Rtz3���fn��fnb�� 	~ [...]
��W�O���@���ea�j���83��:�9�ε��\si@߽L��):�[��I��E�1�m�+��I �H�;�b 
�6���i�<Yq(Ǣ+b6��l䟔���à
E�3(y
1����'��<K�6�hb�o#K���n�} A�r��!�����S�'N[�54����ߦ,ҶJ��J3(qB
�<7o��?Cڻ���"����e\���kC�
�ζ9`WO�^���ȥ}	�g���Eb~�̻����^~����5�F&����8#��l�.5��2�ʸ����B'��D~s�~��YA����g��q�5�s��C����>�"�xT�BD'Ÿ�]*s� ���cEA�l֫�y'a����R��;�ی
-�B~&�3�\^�l��y�������c�]�=����{���&�nB;���=fm`��ݳWZ~�)a�`L�kx�ك����T���b�_B��������D��4�
����˟�|>]����V*�dB��zl�(�4_�3R%+
�UF�liM9%vQ�h%�dzXy��|����T[-I��<����-��N
-qI�2K�
-J��Z{���g�`���Y1�*�
� �)
S�E=t��'ǚ=g
#����{�q/�8��A转�*ۨc�g
����큳���+��W�-�{z�����
-T�U`>��Xa����d��Ε��YY�j��$QqМ������DS�����/s��&�s��I���&���+P>'6aԀ��A?-�c�������0��!qb�a������w�?w䞖�VM6֠nt����`>�/۾��Z~�S�� �,���~-p g���2x��N���BF��a�!=
�����i`
�0p.�Ϲ>$*��׹>T�����ë�ׇ}ݧ����]��^�6M_
�"����6��k3�*�7�E!e�޸�������N�IR��׍n��q�zͼ��u�f o�	Ԡ��
P��i,2�)qJ����?����s\���J�R}���[���vw�
�
�p�YѦ�����Uք��0~'
Ќ������F�[�nA����i6w����Z+���}�v���MpZ�Kw՘�s���n��_c��
-endstream
-endobj
-1091 0 obj <<
-/Type /Page
-/Contents 1092 0 R
-/Resources 1090 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1070 0 R
-/Annots [ 1071 0 R 1072 0 R 1073 0 R 1074 0 R 1097 0 R 1075 0 R 1076 0 R 1077 0 R 1099 0 R 1078 0 R 1079 0 R 1080 0 R 1101 0 R 1081 0 R 1082 0 R 1103 0 R 1083 0 R 1084 0 R 1085 0 R 1105 0 R 1086 0 R 1087 0 R 1107 0 R 1088 0 R 1089 0 R ]
->> endobj
-1071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 564.657 320.769 575.561]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a9af8efc183a5a4cd4475146207f92c8a) >>
->> endobj
-1072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.987 564.657 493.669 575.561]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.714 540.136 492.53 551.04]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a38ece4277d5885940d45d6c8465ca19a) >>
->> endobj
-1074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 540.136 513.996 551.04]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 528.181 282.045 539.085]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [306.373 528.181 502.067 539.085]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 492.701 500.882 503.605]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a9c7ea131b285ad7aaefbc1e2cf579512) >>
->> endobj
-1077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.099 492.701 513.996 503.605]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 480.746 282.045 491.65]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.15 480.746 494.844 491.65]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 456.225 328.211 467.129]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_ade6bd909f8bb4bcdaed4dced85c1f5f1) >>
->> endobj
-1080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.429 456.225 513.996 467.129]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 444.643 134.838 455.174]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.705 385.614 352.073 396.518]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a7f1fc328bf8f0d2ec92a6599ce7fe2d3) >>
->> endobj
-1082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [356.488 385.614 513.996 396.518]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 373.658 168.591 384.562]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.033 373.658 285.641 384.562]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.143 349.137 344.895 360.041]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) >>
->> endobj
-1085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [348.748 349.137 513.996 360.041]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 337.556 134.838 348.086]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1086 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.243 312.661 346.554 323.565]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4) >>
->> endobj
-1087 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.507 312.661 513.996 323.565]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 300.706 163.61 311.61]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.07 300.706 369.765 311.61]
-/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
->> endobj
-1089 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1093 0 obj <<
-/D [1091 0 R /XYZ 89 770.89 null]
->> endobj
-74 0 obj <<
-/D [1091 0 R /XYZ 90 721.073 null]
->> endobj
-1094 0 obj <<
-/D [1091 0 R /XYZ 90 630.429 null]
->> endobj
-1095 0 obj <<
-/D [1091 0 R /XYZ 90 579.39 null]
->> endobj
-1096 0 obj <<
-/D [1091 0 R /XYZ 90 555.51 null]
->> endobj
-1098 0 obj <<
-/D [1091 0 R /XYZ 90 508.075 null]
->> endobj
-1100 0 obj <<
-/D [1091 0 R /XYZ 90 471.146 null]
->> endobj
-1102 0 obj <<
-/D [1091 0 R /XYZ 90 400.347 null]
->> endobj
-1104 0 obj <<
-/D [1091 0 R /XYZ 90 364.059 null]
->> endobj
-1106 0 obj <<
-/D [1091 0 R /XYZ 90 327.583 null]
->> endobj
-1108 0 obj <<
-/D [1091 0 R /XYZ 90 264.892 null]
->> endobj
-412 0 obj <<
-/D [1091 0 R /XYZ 90 144.591 null]
->> endobj
-78 0 obj <<
-/D [1091 0 R /XYZ 90 136.92 null]
->> endobj
-1090 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1153 0 obj <<
-/Length 2099      
-/Filter /FlateDecode
->>
-stream
-x��ZIs�6��W�r�*���`r����:�t{*�N�EK��
-���=�_?�"���RO�D�����
-�`���on&�o#
�(i�,����m|�FḪ�xZU��e��ת���OM���6Yͮ���wE��e2W���Z�zF�T�$�d����7�M�q3�sB� 8 fC�"�����q�����X,��nP
p��&��`{v���M���H:��D�!�ʒV-�tTN߮�y��Eӝǭx�6�W�#�c��oX������'�k��v&�m������е�nSK���7'��D
�!�`�
Dд�zޖu�Y��M���\vӤX���
��0�lB�����R�5%�x% )la���ꕕ��n��Q��P3*���`��'h��]r��Pޣ��Q
�'+5����
Œ�1ռ9 �	�B��"<
��k1�f�o�i�h
��S�U�d����k�K�{����
����q3��<S'l�\,����i
�1흛F���(6���#!",vc�!�\1�'
�@PL�%as�_U���4�5<�(b���K���fc���<����
-�WE�#ɬү�&iS���΁c��]�]`�s`X|F�I0K2>�H|
`˺�{��
�@Gr���=�~y@�0��1��J�&�Y,
�u����c�4?��?u(�(�R�F݈�MZ�2Ֆ��߂)�{��P��&i̷�Ȟ̗�M��짥�ғ���I�b%,�#��E
�_�5���>���J]˲ސر��������1@� �2��F�l
2�ϓ��1=�g�45#b�N��U3��ٞ��E��qyϳ�{�M
�Ln+�׾��s�֜E�� �ȶbA���m�
-���$�
->�B� .Ā��+�(�0�¾1�� X���5�F��1��W}�-e��}b
)�\�����:�$�+�
*��4I��\c`��k�]hѴ{a/_���~�{1��v�b܋�
��D#(��л	8�F$b���:�|�+���!�
�,��3D�
~X�+7������l
�]1�x��d�"�᫗��,�򐐮mLӼ�j\�1�@{������Lξ6kcjv V[T����-�m�J3ɧy�i��Q[�H��I��;՟���Q
tJ� X"!!/��Ķ�)s
jol����S�X.��Ӏ�o�3���v��}YM���O�^��
[��IA�?�	����:����R
:B�ωP��M"g��ů�4pԔ�ś�|Do"8��:�ld3n�TW�2*U��!�!+u�0f��D!�GCqbnI�4A���XzE��SXU骢�
��
-�ЦV.@�ҖwՙB+�t4P�q"K�!�=fl�׸���3� Mj��!M����3��o&{`�9 [��6��=�����U�]��u�X�����Yk��2����P�=L�Etr$�7Dɍ
Oۣ���
�𮘥o#�4�狪y���b����ԝ�}Zާ�<��<��,�ܼ�(nU��
!6���>+�VI��\��He�H���*
�.�j��/�g��'£�gI<�gaȨ����1;, �"�%��}U�{��|����I�b�"�'�W��4j�X͠���*ik{Ҽʔ�LZ�u�|�N�Ƒ�,D�-��N�>,��k4xpgQ��>���ee�]Sw;
�����x�B�X�����1�h�₩�n�rm����҅��Q<]wr\y�Q�k��jN��ѐ�����<}�Y�~��Cj[_�"�LꚗZ~���e�#�Y��/6����=#|��Ѩ�q^��ɬ	�
t�
�s��e#
�U�^���9���'
���wu&]�K��%�ͱ{�az��k+}	���D���a� [...]
#�/���� s�V~��S��~�v�(���?\��آ��a�_~���<~H��:Y��c��z��_���E�8�V��lS
x�ኪ7X"k�[���
1�����.�wd")��v�۶����n�jT�B�r�Mn&G�r�� yY�҉������
��(o9L�s�&QD��v��M�
��r�)A�?���u-�
-endstream
-endobj
-1152 0 obj <<
-/Type /Page
-/Contents 1153 0 R
-/Resources 1151 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1070 0 R
-/Annots [ 1109 0 R 1110 0 R 1111 0 R 1112 0 R 1113 0 R 1114 0 R 1115 0 R 1159 0 R 1116 0 R 1117 0 R 1118 0 R 1119 0 R 1120 0 R 1121 0 R 1122 0 R 1123 0 R 1124 0 R 1125 0 R 1126 0 R 1164 0 R 1127 0 R 1128 0 R 1129 0 R 1130 0 R 1131 0 R 1167 0 R 1132 0 R 1133 0 R 1134 0 R 1169 0 R 1135 0 R 1136 0 R 1137 0 R 1138 0 R 1139 0 R 1140 0 R 1141 0 R 1173 0 R 1142 0 R 1143 0 R 1150 0 R ]
->> endobj
-1109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 636.2 261.602 647.104]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_af6cb7e34c1083df796fb12aa463739e6) >>
->> endobj
-1110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.417 636.2 375.334 647.104]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 610.358 334.099 621.261]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_aed43bafe74e2b291d7b980c6ee8f3d5f) >>
->> endobj
-1112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.915 610.358 447.832 621.261]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 584.515 338.473 595.418]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_ae5f214d520a1f232251bee39685b62a2) >>
->> endobj
-1114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.691 584.515 451.608 595.418]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.273 584.515 513.996 595.418]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 572.559 187.959 583.463]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.316 535.757 374.601 546.661]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_af03d1a4f7f355971ac31ec1e4cb7297d) >>
->> endobj
-1117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.627 535.757 489.544 546.661]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 523.802 261.024 534.706]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.675 487 382.518 497.904]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a68de3cffc4bbfa2a79c06c51adb653a8) >>
->> endobj
-1120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.903 487 496.82 497.904]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 475.045 261.024 485.949]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 449.202 269.043 460.106]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_aa8fd21a451fe377a328d750951ce36f3) >>
->> endobj
-1123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.859 449.202 408.788 460.106]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 386.911 313.277 397.815]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a8cba47c10a4d9a84b170b37932dc04e5) >>
->> endobj
-1125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.495 386.911 452.424 397.815]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.126 386.911 513.996 397.815]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1164 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 374.956 149.224 385.86]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 349.113 270.159 360.017]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a8ce02af4c13862f7988ad3e43b5290cf) >>
->> endobj
-1128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.975 349.113 409.904 360.017]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 323.27 266.643 334.174]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a5a6326e465cce738cb09fdd8df1d92ba) >>
->> endobj
-1130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.861 323.27 405.79 334.174]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.492 323.27 513.996 334.174]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 311.688 194.603 322.218]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 285.471 259.041 296.375]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a2c60071e2c7adec51fc7175ddb7a3bff) >>
->> endobj
-1133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.259 285.471 398.188 296.375]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.891 285.471 513.996 296.375]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 273.89 194.603 284.42]
-/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
->> endobj
-1135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 247.673 259.639 258.577]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a56b9fe489466e7376b72bc99b4f99126) >>
->> endobj
-1136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.455 247.673 399.384 258.577]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 174.423 264.61 185.327]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a3ce50d0fcf796935652563144194ccf7) >>
->> endobj
-1138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.426 174.423 378.343 185.327]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 148.58 319.912 159.484]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_ae88c914d522014d2d181278bcfa9222f) >>
->> endobj
-1140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.13 148.58 433.047 159.484]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.749 148.58 513.996 159.484]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 136.998 134.838 147.529]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 74.333 276.804 85.237]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a19d1974dd5b293a48b8f2de6fa3c2c8b) >>
->> endobj
-1143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.62 74.333 416.549 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1150 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1154 0 obj <<
-/D [1152 0 R /XYZ 89 770.89 null]
->> endobj
-1155 0 obj <<
-/D [1152 0 R /XYZ 90 704.286 null]
->> endobj
-1156 0 obj <<
-/D [1152 0 R /XYZ 90 651.264 null]
->> endobj
-1157 0 obj <<
-/D [1152 0 R /XYZ 90 625.61 null]
->> endobj
-1158 0 obj <<
-/D [1152 0 R /XYZ 90 599.767 null]
->> endobj
-1160 0 obj <<
-/D [1152 0 R /XYZ 90 551.01 null]
->> endobj
-1161 0 obj <<
-/D [1152 0 R /XYZ 90 502.706 null]
->> endobj
-1162 0 obj <<
-/D [1152 0 R /XYZ 90 464.455 null]
->> endobj
-1163 0 obj <<
-/D [1152 0 R /XYZ 90 401.974 null]
->> endobj
-1165 0 obj <<
-/D [1152 0 R /XYZ 90 364.365 null]
->> endobj
-1166 0 obj <<
-/D [1152 0 R /XYZ 90 338.522 null]
->> endobj
-1168 0 obj <<
-/D [1152 0 R /XYZ 90 300.724 null]
->> endobj
-1170 0 obj <<
-/D [1152 0 R /XYZ 90 262.926 null]
->> endobj
-1171 0 obj <<
-/D [1152 0 R /XYZ 90 189.486 null]
->> endobj
-1172 0 obj <<
-/D [1152 0 R /XYZ 90 163.832 null]
->> endobj
-1174 0 obj <<
-/D [1152 0 R /XYZ 90 89.397 null]
->> endobj
-1151 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1203 0 obj <<
-/Length 2377      
-/Filter /FlateDecode
->>
-stream
-x��Zm�۸��_a�j1�/�D��wI���^�&�O��P$�"K�$�f��w��ڲ���P
r�)jșyf�j�t=��N~��\]x�Ч��n5
�4�B�}��L?�<<����)�"�/��W�~{�����l��n�uB���>G��������4��_��PL��ԣ
�����?l�rx�[l*`k���F<�(�� B�Fޕi^WjW�!�M�
"pg����p�ȧ��P2BDI�̨���rE4�iH��Q����wr��
�@`n��D)w^�~\p�g��
Vv-�������l�˖i�\�
���|]�e
��Ǫ��C��O����7F
���FB�k
�	cff9x(�3I)����2.�j`��zh��`��y�Y�1��
�?�a( x]z;�F��uz/ss
@�5Xp��2,p��L�������LT=4�&*AC Т��Qw�g���6�%��&2�m�eE����j��QP?��s�g/�ٻ6!K�;+�a��s�g�3�̵��`&�}�7R��hh��G8t,?�%��qxd�"�]0�
�7��4]&���
OJ��X�H����dDZ$n؏�#c���x|
�[OG6�h��3�J�uT�E��V( �`B����U�
!�bq��zH������"J~
M��Q�§���8�a��=�nA�Kˆ J�`4�V���b;$J� �ǁI
�Ieo���h3�>�T��‡�"s
� qD�
�F�e
��ΚT��*.ӝV�
R1��B#�n.��q'[��
���e�W�M�q�![4�*�����
-p1��Q?[W�BU��4�.t�Y�B5/B١|���ʤj]�G2F�%q�B
XO0
w����A���@����[�������
-����k�˲+���貺U�Y��J�M	�f���
��
��wʞ�Aˍ�(����n!�
*�΅v��6��-hA�q�Eġ{\ A�s
��ڞ��V�����J��|;�xH��2��@R�p��y0[�(��~6>����
-�ɲ�������
�	X蘩�����4��}"�L�S���df� h��	}
�
��͡��
	��A3y�4�~/3"`����φM@	}[�M�DucU�pJ{���Vn?7T�5<:S�S
-�Ư���+�q]����?WU��U9p5d};���PI!k-�;�����M��̥N4˃��	�DFR���;��S(�.>ז	ѣ׷i.�r��ۮ�`�"�E�w&�J\��@D���4�̾@ey0���q
-
&a��R�>Yze��d �	H3p
QEQ�Ǝ��ք}�8 ���
�7���K���$�4_x�a��@#`�ڿp�
��y �v��p��QMc�
 
mݮ�B��P�F{P:2Cx�Is�S��Ik;�6��$�,r��&,D��d�R�^װ�qh؀�_�"cn����s�a3z�B�W}����CT����>��޻`�7��h��C����
��2�b$�`�}���ȲX�vKç�J>�_:��(����S:�]<��Q��D8�qp0��0�J���s&�S��sDC�1
��€BoH�8�
�9������@�3p�O�BT��n�Cx�>����D��P�j7�j�W
YB#T��P����JM�>�`\L�w��"��

�C�jT6X�Q�֏2�e�<
�>�U���8�0
i�4�Q�]T��&"D��z��"P���7��3aP�f�����f�f}�C6ɋ���ڿ�m^�<j��۵e�z

�
������F`.N�閑�������ʢ�n�
�
0�)b]�?7¨�(h�ٞU@�).�T��9nK�%#�W��{Z�8GEI8|v\���T
���e�f�\��i�
�a�F�'���ݣ>��0УC�ስM��TH�������>2�O�ʎ�BA�;�0�N��y����#���?�6�
`�Y�G�	tg����J �@B?cF�Q0���lŭ��9ݓ�+烖�� %?�+��
-
-���hU"@ ����I5�������_+������L��\���^���h���}���M�
-�=�ؤ�=o�dq�`����������m�E5"�Z��$�#
�6��<i�p�Xa^�!if[<���e^C���ϲ�r&�J&h�q�B��R��@�����{��
�����ms�[�����N���m|
-�<��6���P����	�
�� ��w�6�؁��-��. at X'n��@}�
��0�Z������
���ݻ[����F�z��ӛ�3��V���:Y���-���]E˽r�,;RK�n�,�� ���i���D���-�>a�����������������8at/�
�o��hNC�
��:t�� ��X

-endstream
-endobj
-1202 0 obj <<
-/Type /Page
-/Contents 1203 0 R
-/Resources 1201 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1070 0 R
-/Annots [ 1144 0 R 1145 0 R 1146 0 R 1147 0 R 1148 0 R 1149 0 R 1175 0 R 1176 0 R 1177 0 R 1178 0 R 1179 0 R 1180 0 R 1212 0 R 1181 0 R 1182 0 R 1183 0 R 1184 0 R 1185 0 R 1186 0 R 1187 0 R 1188 0 R 1189 0 R 1190 0 R 1191 0 R 1192 0 R 1200 0 R ]
->> endobj
-1144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 696.152 280.122 707.056]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a45fb5ebe8a9c33d1e73593b09d8ab877) >>
->> endobj
-1145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [343.982 696.152 479.911 707.056]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 670.548 285.103 681.452]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a3b54824f0f53bf664c3114fb67557115) >>
->> endobj
-1147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.443 670.548 474.372 681.452]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 644.945 291.19 655.849]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_abeb7cdeabf40c32d3aa0c33c0499bf97) >>
->> endobj
-1149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.006 644.945 430.935 655.849]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-1175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 619.341 285.651 630.245]
-/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a86691cc44e4ef41d379ec2477221f0de) >>
->> endobj
-1176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.467 619.341 399.383 630.245]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-1177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.411 310.036 227.586 320.94]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a6d24fa81c885803e34fadd9332287d2e) >>
->> endobj
-1178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.707 310.036 307.303 320.94]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-1179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.856 310.036 456.582 320.94]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [469.942 310.036 513.996 320.94]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 298.454 183.844 308.985]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 261.519 293.581 272.422]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a6871446de8be708c37b2bedbf12c9b76) >>
->> endobj
-1182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.397 261.519 372.993 272.422]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-1183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 224.956 315.678 235.86]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a08a4701b629d734ea0e11231a34514b0) >>
->> endobj
-1184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.494 224.956 395.09 235.86]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-1185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.716 188.394 304.36 199.298]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d) >>
->> endobj
-1186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.786 188.394 383.382 199.298]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-1187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.546 188.394 504.154 199.298]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.709 151.831 313.911 162.735]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a2845e4528b7b42c6c6527daceee21312) >>
->> endobj
-1189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.329 151.831 393.925 162.735]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-1190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.388 151.831 513.996 162.735]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 114.273 234.723 125.177]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a0399dc1a987546af5d0491e72a6a05e4) >>
->> endobj
-1192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.538 114.273 340.146 125.177]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1200 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1204 0 obj <<
-/D [1202 0 R /XYZ 89 770.89 null]
->> endobj
-1205 0 obj <<
-/D [1202 0 R /XYZ 90 713.039 null]
->> endobj
-1206 0 obj <<
-/D [1202 0 R /XYZ 90 685.741 null]
->> endobj
-1207 0 obj <<
-/D [1202 0 R /XYZ 90 660.137 null]
->> endobj
-1208 0 obj <<
-/D [1202 0 R /XYZ 90 634.534 null]
->> endobj
-1209 0 obj <<
-/D [1202 0 R /XYZ 90 593.431 null]
->> endobj
-413 0 obj <<
-/D [1202 0 R /XYZ 90 482.92 null]
->> endobj
-82 0 obj <<
-/D [1202 0 R /XYZ 90 476.087 null]
->> endobj
-1210 0 obj <<
-/D [1202 0 R /XYZ 90 377.702 null]
->> endobj
-1211 0 obj <<
-/D [1202 0 R /XYZ 90 325.04 null]
->> endobj
-1215 0 obj <<
-/D [1202 0 R /XYZ 90 276.711 null]
->> endobj
-1216 0 obj <<
-/D [1202 0 R /XYZ 90 240.601 null]
->> endobj
-1217 0 obj <<
-/D [1202 0 R /XYZ 90 203.586 null]
->> endobj
-1218 0 obj <<
-/D [1202 0 R /XYZ 90 167.477 null]
->> endobj
-1219 0 obj <<
-/D [1202 0 R /XYZ 90 129.465 null]
->> endobj
-1201 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R /F99 1213 0 R /F98 1214 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1249 0 obj <<
-/Length 2193      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~���+5CR�Hu���f1��I��«ȴ-T��t�}ER�l9q�žX����)�l
��{�����c'Da@�v���~�X O+���/��-�ty]�uSEI�,?~��-c�f�4����Z6�f��
�osx��b�?ȵ��D�2W�%\�>��r�����o3�����‰�٧_�����:y�p
�A��S���q��6��]��]��(��D��gJY��Ns>-	���j1�Ƭ�C7@	b���Z%ɲ.A��*�d^'E�OR��3|�fGO�p�j3E'����
Y6�K9�ruC�
�xE���ƞ��:���1HBF4��s�
-|5k��>���Yqb���
-PRk84�fҝi����#�ʌ�j���Vg};ء{,�\��,�x�
C����=
��� �G�pC��
Z$<�V\���2e'2? ��sp):��
ӧ�e�ܫ�F����	��\�9`?�*
�*�v��T<ero���L,�2Sx�=���EB~�� ��� �
��h��Q�Dw���z��=G8���g�InyZ�N�e
��g��\�Pn �7�&��Ȋ��e��KH �_
P0�J(R��(��CQ+tN��Q?Z�&+펀�(�,�av&���\DY�jS���9ً��� ���
����P]ygJ�\ 
�gH� ��b�5� ���;�C"U�-�:i�{�_��R�W�ϕ
�L:����A��Ao�İ}�i�ɮ�*��/�C�&H�	s�}\֍�UGMR+�k<�n����C8��Tf*F�*MI���b���P/�[�=�e�� Z��KbpuA���5,�|�oJYm�Ҁ6�~�td
�"3�΋���qRq�#�O(n��p��‡��暣�ƒ��j�nS= �i�Ty7��m;#n���Le[��e������FBP��
��䒷y�6W?�
\4ћ6�����
0�3�D�gp��X��j�G�R.��k\�Zh=
-�Nл��OFΩ�
�%}�U7��m&�xQ
�C�B�1s��֧���o��G�$ab�>����JF�	i�� �
$�tme���mF�O
� $
+� !
P�{gL����>&��v.{0ea�
�#PQwގFʿ(��4�,P"��Ҵ��o�H��@p��j�wG��*�~'��>l�X��Il&'
y�R�O���� 
-���'dP���AS���pQ
'�r�f�E��������$|~�;�4 0{�o@�ږ=�Աk�R_j(��:��n�<�^�"�"B��,T���2
��OZD������Us#.�
#��m�w �9��v�}~2rֺ:ΦH	ć-����@"ʔԥ�
�3 at a"�P�C{� b�4��&J�.4ROu\%e����g�v���6�n���KY�5#��
�C�
}E�;�0(���C�2�&IT�J��J�m�厵�*��9�
-}_��Zս���.
���}�1p
-B>2��[�Iٞ��"n�1�zɚmR]�^��_�VC�\WE�W��
Ȱ��}ϥZ�T~9vch��Ί<���|���h�Y�=�K��Mux3
<a�M��

�� ��C� :>v<��y@�
������)���6�=ۛ`. ��L�G!!c��4�1�jۑ��1��

1f��|�����^���=1�`
B�D�yXC�̺����萷{L
�����Au���5�WEB�����,�Q��
6t����t
�w�ߒ<Nە�J��a$ؓ9��	Z�C9���ڥ��	��Y�<!�A��X�����&`��Oک�K>�X��hl �FM��
WT��^��Lfw��m�
�.FO�4�
�d7v�1 �6�Ͽ�:��Y�գ���'�H�
�O~�����"
?�g��9�`'�3N�9������$��A��n��A?�O��O�_J���Y�a�T���Ÿ�
���E���V�Ԝ�=X�P�)i�t���~�r�0�;�?QKU�<w���T�΍�_ [...]
��8
������w��Z_�E���6r�[�Qa�S-�UԹ�~�>��(����^����oU��SҙS��Ҧ_-ܯ���n֥�a�D@[��c�4�WWw���
����/���8Z4�������!PW�#[�X}3u�P�1P�o�1�v#v�?�D���m�9o
-0����e��
-endstream
-endobj
-1248 0 obj <<
-/Type /Page
-/Contents 1249 0 R
-/Resources 1247 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1070 0 R
-/Annots [ 1193 0 R 1194 0 R 1195 0 R 1196 0 R 1197 0 R 1198 0 R 1199 0 R 1253 0 R 1220 0 R 1221 0 R 1222 0 R 1223 0 R 1224 0 R 1225 0 R 1226 0 R 1227 0 R 1228 0 R 1229 0 R 1230 0 R 1231 0 R 1232 0 R 1233 0 R 1234 0 R 1235 0 R 1236 0 R 1237 0 R 1238 0 R 1239 0 R 1240 0 R 1241 0 R 1266 0 R 1242 0 R 1246 0 R ]
->> endobj
-1193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 707.957 279.554 718.861]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a5e1c7e98053b2262c5f56c46e2f04f05) >>
->> endobj
-1194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.37 707.957 384.978 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.881 707.957 478.237 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 682.518 252.137 693.422]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a553952be8bff48ab2a4a8b2820efc047) >>
->> endobj
-1197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.355 682.518 356.963 693.422]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.79 682.518 449.147 693.422]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.625 682.518 513.996 693.422]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 670.936 134.838 681.467]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 645.123 297.268 656.027]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) >>
->> endobj
-1221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.083 645.123 402.692 656.027]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.594 645.123 484.075 656.027]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 619.684 245.253 630.588]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a10d11983038c7047547f4a68f8ea2b70) >>
->> endobj
-1224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.069 619.684 350.677 630.588]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.58 619.684 432.061 630.588]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 594.245 225.318 605.149]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_acaca085247f8483085877e21527a9cd6) >>
->> endobj
-1227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.134 594.245 330.742 605.149]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 522.105 242.484 533.008]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_af61686ed9ede21b05016ee29f9de882b) >>
->> endobj
-1229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.299 522.105 347.907 533.008]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 496.665 245.801 507.569]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a4ea3e6a8b8e929e318a5c1c450667d10) >>
->> endobj
-1231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.661 496.665 411.269 507.569]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 471.226 250.782 482.13]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_add70a09fb9b3cb0b8b7ce79d8d9ec14c) >>
->> endobj
-1233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.122 471.226 405.73 482.13]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 445.787 256.869 456.691]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_a29295feb65378f2ba04c202f4b9a1bb3) >>
->> endobj
-1235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.685 445.787 362.293 456.691]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 420.347 251.33 431.251]
-/A << /S /GoTo /D (interfaceppl__Congruence__tag_af39f78c492db753013cbfd0177ffea60) >>
->> endobj
-1237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.146 420.347 330.742 431.251]
-/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
->> endobj
-1238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 111.728 314.741 122.632]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a061420fd93cf031e877897142071c67d) >>
->> endobj
-1239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.557 111.728 481.613 122.632]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 86.288 479.073 97.192]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a60ac68b3806bdf2e8b4805d661c52def) >>
->> endobj
-1241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [482.291 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 228.924 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.328 74.333 443.397 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1246 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1250 0 obj <<
-/D [1248 0 R /XYZ 89 770.89 null]
->> endobj
-1251 0 obj <<
-/D [1248 0 R /XYZ 90 721.073 null]
->> endobj
-1252 0 obj <<
-/D [1248 0 R /XYZ 90 697.669 null]
->> endobj
-1254 0 obj <<
-/D [1248 0 R /XYZ 90 660.275 null]
->> endobj
-1255 0 obj <<
-/D [1248 0 R /XYZ 90 634.835 null]
->> endobj
-1256 0 obj <<
-/D [1248 0 R /XYZ 90 609.396 null]
->> endobj
-1257 0 obj <<
-/D [1248 0 R /XYZ 90 537.067 null]
->> endobj
-1258 0 obj <<
-/D [1248 0 R /XYZ 90 513.511 null]
->> endobj
-1259 0 obj <<
-/D [1248 0 R /XYZ 90 486.377 null]
->> endobj
-1260 0 obj <<
-/D [1248 0 R /XYZ 90 460.938 null]
->> endobj
-1261 0 obj <<
-/D [1248 0 R /XYZ 90 435.499 null]
->> endobj
-1262 0 obj <<
-/D [1248 0 R /XYZ 90 394.597 null]
->> endobj
-414 0 obj <<
-/D [1248 0 R /XYZ 90 284.414 null]
->> endobj
-86 0 obj <<
-/D [1248 0 R /XYZ 90 277.455 null]
->> endobj
-1263 0 obj <<
-/D [1248 0 R /XYZ 90 179.107 null]
->> endobj
-1264 0 obj <<
-/D [1248 0 R /XYZ 90 126.69 null]
->> endobj
-1265 0 obj <<
-/D [1248 0 R /XYZ 90 101.893 null]
->> endobj
-1247 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1293 0 obj <<
-/Length 2170      
-/Filter /FlateDecode
->>
-stream
-x��Y[�۶~�_�I*�DX\Ip��L�K�i�����hh�rB�2Iy���9��&��]��>����;��`��?^_\��p�8�ap�b
D<F"��4x7�t���O
%"q?��g�y}����[]w������*
��@�
Vۋw�� ���X,�[�hp��o/�{��+�qM�@�k!׮��׈D�u��}���|�8�%��f���[�5��1K�����M��j[���U���o�Z���eL}�(�ď�5�����6?���n+�b��MR���Ek�ϔ�-�v�6w9�f*iTz���W� �Y��(�u(ISk��'FHc$1���GH	�
!2����e��"b����b
�?�S*?��YV4�Xc��80�1
 w��._&u�m��3=�*�_�o��Fm�fF�z2�D,�U�=�j���=�^7�

3��Pځ	��S͸C*�,�����n�;��
�C]�`TdP�-�(��
�!;���L9�W�J��F�~�H1O][e��_М�'*Q�<��˩p���6�r�L�(����ɠ<Y
�q���$6k��\5��h�D����q/f����8��*�
�>%y�&���p�w��h%
-{�z5�=
Ѹ]��&s���s�g��zoI� ��#�]Y�Y��Ů��?����,��!�O�h�I�;�P��s��*E�LX4��E��!��m��u�șZ�g����]�*V�p
.�^�<ڗ���q~]�c
-�1��
��k�ޅG�姓̔�J�i����mFSKyj)Fa�"�=��"y� 
�
���&hA<�C����0\����Q��$�2>!_|�uK�~��Y9
-6U���`~�;����Dž	08ǽ��r
��?�s<��}]r&�3b��C��w~m�<N�Ѷ
w��{=Z&�S�b$i�}~�+ah�w�`	�0ų���NPP�|˅V�����5�G<��+K̻/�oT����dҰ�~���瓲_�Ңbc6y��D�,[�J�4ɑ܄���Įo~�Ғ6D�Z�~��������	O�IX���/V�[>�6r.
��&���仙sfL�G��%)�:��%|�@
����`�A�&����f
E(Bd�!j��&�r��R*�^Uٮ���X\b�#Ɲc�s��n�W+m��b�M�r�'��"���G
��R �f��K��jۥE��5�_&#ۯ.��k>Mf

�
�
-ׁ�������,u
U*Iearz�LV+�י���/�)�ω%^g�\��ڱ�w�mz�N�:]�C�Z�HVNL�u
����,����c�af7R����^��.R2�
&
.W{=��@g�ܝ����xk�\�Fz��OUnG[ɺ��rN�{Ph4WWC^ӂ�I
H�C�qt�0칼���Yb�n�+���*9�J�'m�.������ �X
�3����CBF��=H�O�_��m	��0&:���:��	vn!v�1���'��a)�
7�<�m,��2���7j
uy�����
�����1��,�	�Fy��S��ab��&�K��6a
؜�:��e��=�P��]?c!�xP�>�f�w�~��f�e;!��ZI�.5���+L*�KW�U���:"^��/}N��_i�w��=03�y��9���"5��N�g��Ce7%�
��
͆),~܉�����tЃh,���_��wg8۝?"�o���r�S�֟�����7{XN�w��0�/<�d�#I����$t���\��vi��[ �A2Ɂſ��@���pd0�9(�rcWE
��.��E
��j"�����<����c,F��'�X
-%�O�O����S�����0�a;�\c:�\��
�*}�v�Q嗤��)����R��U���
C�4qPu���6��o����%���>��f+�&'8�D{���R��}jH��T�}��}*����
��=$E��t�w�j&��z�g��X�c��x_��E��{����G ����GPg�D5��wS��q���,x^�����-:�FUC<�P#�_�bf2;�f��������}���}�Q�n� ���V�_u����I�O�y��|ҫ����!'ұ�`���[兺���vx��0·�7�B��7M�������ԪؠU�=���g at .[h5���3+�pk�كE�Η�{
-endstream
-endobj
-1292 0 obj <<
-/Type /Page
-/Contents 1293 0 R
-/Resources 1291 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1070 0 R
-/Annots [ 1243 0 R 1244 0 R 1296 0 R 1245 0 R 1267 0 R 1268 0 R 1298 0 R 1269 0 R 1270 0 R 1300 0 R 1271 0 R 1272 0 R 1273 0 R 1274 0 R 1275 0 R 1303 0 R 1276 0 R 1277 0 R 1278 0 R 1279 0 R 1280 0 R 1281 0 R 1282 0 R 1283 0 R 1309 0 R 1290 0 R ]
->> endobj
-1243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.57 685.091 487.693 695.995]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_adc0293455632f1e58de03ee68caa785a) >>
->> endobj
-1244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 685.091 513.996 695.995]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 673.136 270.438 684.04]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.543 673.136 476.612 684.04]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.787 647.33 323.864 658.234]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a18f6401539b34122053f5d76da0c3282) >>
->> endobj
-1268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.361 647.33 513.996 658.234]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 635.748 134.838 646.278]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 573.183 344.25 584.087]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a93c2b042e4c644ba6052c0a0130c74ff) >>
->> endobj
-1270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [347.468 573.183 513.996 584.087]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 561.228 134.838 572.132]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.28 561.228 245.263 572.132]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 535.422 337.635 546.326]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_abd830cdbf47ea1e5f0cb88ba4e3dddd7) >>
->> endobj
-1273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.853 535.422 503.909 546.326]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 509.615 338.193 520.519]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a9427aa22f07ee35e906d05bcd352e1e9) >>
->> endobj
-1275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.411 509.615 513.996 520.519]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 497.66 134.838 508.564]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 497.66 334.368 508.564]
-/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
->> endobj
-1277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 164.593 254.976 175.497]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ab1988eecd5bca9d4ad8dbd128c885b9b) >>
->> endobj
-1278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.792 164.593 362.083 175.497]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 138.787 327.474 149.691]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a2967727ea790f1d517e1529e3f6be79e) >>
->> endobj
-1280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.289 138.787 434.581 149.691]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 112.98 325.222 123.884]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a6b54d1a028c5a0eff158b33ce1a6670f) >>
->> endobj
-1282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.44 112.98 431.731 123.884]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.396 112.98 513.996 123.884]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 101.399 134.838 111.929]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1290 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1294 0 obj <<
-/D [1292 0 R /XYZ 89 770.89 null]
->> endobj
-1295 0 obj <<
-/D [1292 0 R /XYZ 90 700.787 null]
->> endobj
-1297 0 obj <<
-/D [1292 0 R /XYZ 90 662.573 null]
->> endobj
-1299 0 obj <<
-/D [1292 0 R /XYZ 90 588.238 null]
->> endobj
-1301 0 obj <<
-/D [1292 0 R /XYZ 90 550.665 null]
->> endobj
-1302 0 obj <<
-/D [1292 0 R /XYZ 90 524.858 null]
->> endobj
-1304 0 obj <<
-/D [1292 0 R /XYZ 90 460.593 null]
->> endobj
-415 0 obj <<
-/D [1292 0 R /XYZ 90 337.721 null]
->> endobj
-90 0 obj <<
-/D [1292 0 R /XYZ 90 331.046 null]
->> endobj
-1305 0 obj <<
-/D [1292 0 R /XYZ 90 232.615 null]
->> endobj
-1306 0 obj <<
-/D [1292 0 R /XYZ 90 179.648 null]
->> endobj
-1307 0 obj <<
-/D [1292 0 R /XYZ 90 154.03 null]
->> endobj
-1308 0 obj <<
-/D [1292 0 R /XYZ 90 128.223 null]
->> endobj
-1291 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1345 0 obj <<
-/Length 2146      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~ׯ`�e�*
��g��Y�[�8�=�}pR*
	I�P$MB3ѿ�P�D
cI��j_D����_w�����?G�=���؉P�S�y�;v7B����8@�dJ0���f�(�ZV<���㦖b5�|1�R��s)�9����A�E5!�X��	���l�����F�G��z(�x5��v�����B�yh帔�1s>��=�Fv�����@H�|x# ����R��ܾ�|�z��b.+a����C�RD���	���=�'d�-0��վav�RC��=|p�C��
t���
E�
-� ni
1n
�cE!�ϔq���S��3e�2�3;F�����'5c�5�Lzw����	AH�m|�"0��E�q�w�4Kj��:xzr��7VS�[��ws_.�����
-����b�M���^���)��3}	1
-��>�F
���J��˸�y�	}i^T�D.��
P�3#M\MX0\�D��jJ�C����z@�)�pO '�Q��!
|D\�ځV4SBL��C�
��Q�`��u���s^ �a�
 ���Tc%�<�mA�A�\?�G��EaPW�q���p��U��pxn�aͭ�Q�&��
�
��:���-��b`�Q����2�Q
�yԀ/��'"R\��oā�"�%=���@��҄k���P;;B^��t��W#��\�f��}B��NV�5�졬2�Ty��
-0�
-�RlyN�L�5��$r��Yf �(�/g��"A
�+V����
}@L�bb��:�eZ䭵���7�>��0~*�t���l�V� (��C�2�(��`%ѡ*�.���%�J�5h�;�z�U�
/���V��<)7�8V€�|���Y�NS�!���x������CD�\�D�Um�Ђf�aR~�ljQe[%Cq������$D>�/�IN�*��Qv��nIuJbU���Ω�\W;��/��ɸ��w
����#&�%'
-G�0n!zJ��L�JR��!�d�>�<k��毻D���ު�nH�8
���a�=���
.������
�&���q><x�9�m`+����F8��
 � N
1�^Zc�]J��i����
rJŁ��1�ת��SV��m��ʓ<�P�A��c�$�MY�����ig�g�G
i����e�u]D��j��A�����
.�D�|-���X�
��5�z��,��*�>�BR��`��O��gB�b�(�i6������K���p�$^
$^xd0�F`݈
����uPj�}M�
-g�Z�����8E:W6]5�H�gk.SP
Saŷ���\IWe&�I�\�6��Gw�U�sY��
����UX�$����a[ 8��Z��@
_��-7U�?R�@MNq��Wh�n*
T�z�
M ���/���M�?�A���	��u��E�<�u�����C��g6�?��W����8���
�uBuU(�=Y�q��s�N�cs���EK�Q�ܐ� �m���
-�ړN3���ۊ�j�"Իi�����$�eU�5�ݴpdh}T���5�t=| P*��6Y�Z�Q�*��}*�tK��;r
F���4��E�NL��5��X�5�6o��;ȡ��p�9�>/���組�
y˪"#�Ŭ�P���?.`��U�vC�
d�v�� ����2)�Cu3��g6I���vM0����/����w�k5z+�
-��e��0��3��o�)�}��� ����v�Y���
> �}�\��d�k.#dx�B��K]
�a�C
�.f�F���aʿ5�HSA�5�6YV����|s`��
�����_=/�X%�e?7m�;�S�g�N��:P�<zf�)��Mw5x
��,Y��?#�
`E�<��I�l42 ���4o��Q�������v\]�
5�*f��[�~�^��!�.�Ej�ϻ�*��RV����)a(��sv]����4���
h}M�����l����P!
-����i��F�B%�����~��(����a��"���߿gV-��
�k�ݏ0����/�,�M5�]
��<��*=)2ն� +7�%���n�k�~w�ُ���
�I��<k����ww��xs��b`Ie�r�������E��j7�Ԃ\
-d�"���0A�O����Ga�y�{�ܴ/�
w�+�)���K�
c"��
-endstream
-endobj
-1344 0 obj <<
-/Type /Page
-/Contents 1345 0 R
-/Resources 1343 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1369 0 R
-/Annots [ 1284 0 R 1285 0 R 1286 0 R 1348 0 R 1287 0 R 1288 0 R 1289 0 R 1350 0 R 1310 0 R 1311 0 R 1312 0 R 1313 0 R 1314 0 R 1353 0 R 1315 0 R 1316 0 R 1317 0 R 1318 0 R 1319 0 R 1320 0 R 1321 0 R 1357 0 R 1322 0 R 1323 0 R 1324 0 R 1359 0 R 1325 0 R 1326 0 R 1327 0 R 1328 0 R 1329 0 R 1330 0 R 1331 0 R 1363 0 R 1332 0 R 1333 0 R 1334 0 R 1335 0 R 1336 0 R 1337 0 R 1338 0 R 1339 0 R 1340 0 R 1341 0 R 1342 0 R ]
->> endobj
-1284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.102 707.957 360.136 718.861]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a984fd654d7b169e74d13f6207d48fefb) >>
->> endobj
-1285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.948 707.957 467.239 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 707.957 513.996 718.861]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.002 236.685 706.906]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.822 658.016 369.414 668.92]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a56d19de5207d94e358a433995ce9730c) >>
->> endobj
-1288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.946 658.016 477.237 668.92]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 658.016 513.996 668.92]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 646.061 241.666 656.964]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 619.033 262.418 629.937]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a0d28be41ac786db82ce3cb24e2db5543) >>
->> endobj
-1311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.234 619.033 395.537 629.937]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 552.079 306.652 562.983]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ad9b9ef9435b7a3bc8d92435ccf1cc0d7) >>
->> endobj
-1313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.87 552.079 439.173 562.983]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.875 552.079 513.996 562.983]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 540.124 149.224 551.028]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 513.097 263.534 524.001]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a442076de6b59703f82c552f7e70aad72) >>
->> endobj
-1316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.35 513.097 396.653 524.001]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 486.069 327.732 496.973]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a1b4e8ec21c2f4b2b925c4e11474062b9) >>
->> endobj
-1318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.548 486.069 460.851 496.973]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.728 459.042 261.237 469.946]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_aa975ef75ddb5359966ff21eecca491d0) >>
->> endobj
-1320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.675 459.042 394.979 469.946]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.157 459.042 513.996 469.946]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 447.46 189.622 457.991]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 420.06 252.416 430.963]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a27f2fdd3945057760e252740c98573eb) >>
->> endobj
-1323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.634 420.06 384.937 430.963]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.64 420.06 513.996 430.963]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 408.478 168.591 419.008]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-1325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 381.077 253.014 391.981]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ac19488a8f4e64cb797b8402ea44b456d) >>
->> endobj
-1326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.829 381.077 386.133 391.981]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 303.164 257.985 314.068]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_af8ebe9c0ce769746c2d2d01f6fcb4c91) >>
->> endobj
-1328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.8 303.164 365.092 314.068]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 276.137 306.661 287.041]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a06731c2e3b3d14dceffb5b81f1447bc8) >>
->> endobj
-1330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.879 276.137 413.171 287.041]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.873 276.137 513.996 287.041]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 264.555 134.838 275.086]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 197.228 270.179 208.131]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a4316d3e1fd40ef324f4f9ac970481c9f) >>
->> endobj
-1333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.995 197.228 403.298 208.131]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 170.2 273.496 181.104]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a7a018b29b6f334f666391ec729265c25) >>
->> endobj
-1335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.356 170.2 466.66 181.104]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 143.173 278.478 154.077]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a3bd9634d21689bd4b0cbcb476a101e92) >>
->> endobj
-1337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.817 143.173 461.121 154.077]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 116.146 284.565 127.049]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a5e22cd8ea46cdef0e09027e6177fc838) >>
->> endobj
-1339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.38 116.146 417.684 127.049]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 89.118 279.026 100.022]
-/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ac8105464b2dbee48f8646bc2c2f1f2d8) >>
->> endobj
-1341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.841 89.118 386.133 100.022]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-1342 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1346 0 obj <<
-/D [1344 0 R /XYZ 89 770.89 null]
->> endobj
-1347 0 obj <<
-/D [1344 0 R /XYZ 90 721.073 null]
->> endobj
-1349 0 obj <<
-/D [1344 0 R /XYZ 90 674.298 null]
->> endobj
-1351 0 obj <<
-/D [1344 0 R /XYZ 90 634.863 null]
->> endobj
-1352 0 obj <<
-/D [1344 0 R /XYZ 90 567.72 null]
->> endobj
-1354 0 obj <<
-/D [1344 0 R /XYZ 90 528.926 null]
->> endobj
-1355 0 obj <<
-/D [1344 0 R /XYZ 90 501.899 null]
->> endobj
-1356 0 obj <<
-/D [1344 0 R /XYZ 90 474.871 null]
->> endobj
-1358 0 obj <<
-/D [1344 0 R /XYZ 90 435.889 null]
->> endobj
-1360 0 obj <<
-/D [1344 0 R /XYZ 90 396.906 null]
->> endobj
-1361 0 obj <<
-/D [1344 0 R /XYZ 90 318.805 null]
->> endobj
-1362 0 obj <<
-/D [1344 0 R /XYZ 90 291.966 null]
->> endobj
-1364 0 obj <<
-/D [1344 0 R /XYZ 90 212.868 null]
->> endobj
-1365 0 obj <<
-/D [1344 0 R /XYZ 90 187.724 null]
->> endobj
-1366 0 obj <<
-/D [1344 0 R /XYZ 90 159.002 null]
->> endobj
-1367 0 obj <<
-/D [1344 0 R /XYZ 90 131.975 null]
->> endobj
-1368 0 obj <<
-/D [1344 0 R /XYZ 90 104.948 null]
->> endobj
-1343 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1407 0 obj <<
-/Length 2373      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~ׯ`�>D��08tv�*�r�8Y{���Ni9"�a�"e����_����!�pF��%l4�����$��
�~�|=�z
b/BQ@�z�E�
�� �%�ǩ��~���c�@$
-�!=��wׯ�]P�&��'_&na���9
-���L>�����0b�������S���0��[U0�\�T����A�
B
-��c<})�8�d2�S*�_�,�m��V�Y��u��(���G̏����Ӈ��@��8Ȍ�._*Qv|U�����2N����
�Zn*���I��[ٷ�L�����-��ӻ4��8s��\��,�E���{=V&�RL�:�`�!?��s��J�Z}�A/l
�Y0�аy��|�B�
X��b��ȼ��w��o���&����Z沌k�X�,6���2��4_��O�L>�A�#��H��O�����s(�n��rq+�D�3Χ�����V�`qN����
-�G��
v#�\��B��1�xDQ��@b��ЅR4��	�
r�,�Y��Z��

-z�����x
���ڄ��h�d��^��,e#GBw
�
-`����O]�%͗�.�f&����
�`
�"��fBFBy��@8���!�u�A�p)c 2��2�z��l��e_;#�ψ�0�a�۸vAV5�S�yaon��F��#Ez+���	Y?

Xw˺(�gF�wU��s�#_�۩��I��8,B��D䡘oB��F��A�^O�q���K�4�AXuD��ks
����/���I:�
��
-����3�P��#��A�Z�6�e\.^�g[J�s�/F��Ip�zR��i�Mv �
| �\��-1����H
.�<\��� �	0��N
&pw�lP�(g
C��l���R%�{3��e at 3�occ������ș43AG�d۹@�$r�ߘ����}�:�bs����LC[0/����5I̞�jLARI�����Fa�f�9�]7f����a�$���Lކ��ʸ�*��@N�-w�Dܚ�QnǬ*�[^�_vq�
-�~6o�PDG	�k�n�
�~�-'7},� 5 @����(_��m�/��e���-LՓU��
�P�F����sO[,����
C��0���
-��Jh�<�U{�̀a�y���ƃ�FO
�� Bt�P�Q�܍�,���\�: ��6VM��B.FA��
��!�0�c�:F�ܣ1
-qFt!݋�sB�j$9L��n�*�Su�.���Ep^9��� ���\
r�ry�\.�PlH3t�0�
W~\u	N���Fĸ3'D4��?"'B�;���
��]nеU���0j΋�ܨl^bj
��<��;�~g���09��w~�d�=�t�잜�*6ki�BS��H�$Ƕrl�Q`
?��4��Q�H�y�$!it^�=;�/Sg
������e
�����4K���a��ǚt8y�p�Ơ]�)m
:
1��o[���:.��[!�����O�t����љ�F(�9�B��!����T�� \�g��R��C�
s�����Ѽ�ì�E���n��`�J(���D�
�ט� v&r��H�ᅐ��L���H�0M�<l+�7�
�Xwq�&�#��6�
 ��f���10�[���M�Y�0������=(��:�E���
+�C�F�}�ٓ�f�;��p�k8�Fv�d\���
��>(U���D�tj^��y-����wM+��"IW��
 �u�Dv@���E[!>%4� 2�Ȣ
v\� �j at p�5G���)�����߿:�r��
�
�mF�@5p[.�����Hgg�\ǡ��r\�����ٟ����zW�C��*����$����;X�(�@�!ў;��\��]�5����B�K�F�9ꘞ
-u+�N��*'�!��p���+����9���Q��b���u�;�
1�5
-��@��A;����z���T��F
-#�խO�Wi~&�}�5��A=e��$$��ŦP/h�]��e��g�=�>�c���h4U5�Znڰ�=�u��=�zsz!A�/��I`��O�LF�27�2��I3�>_P
j
V�)�h��� *�7L�]�^���W-��Lt�.��H����K��)�e7P�����Vp��fR�X%S���ڑ9� ��u��i��ü��p2�.
�����6�
8��>9m�1������@��©9�ܘ�Y5W
K���J�v٠�ț�ӝv��
����-�~h
��
-(
-);�
�΃@�<ҟN}�`�IR}��[�l��Wo6�{Y��V�
��[���
�� E!���2��>�s�_����[{b2��q���k{���:`���]�5��q�����SДe[l�U
Z'|�MIb�����DN��[�n�����ϯ�nv�J�k�,6���>
����7E�WŔ�����8�l
-endstream
-endobj
-1406 0 obj <<
-/Type /Page
-/Contents 1407 0 R
-/Resources 1405 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1369 0 R
-/Annots [ 1370 0 R 1371 0 R 1372 0 R 1373 0 R 1412 0 R 1374 0 R 1375 0 R 1376 0 R 1377 0 R 1378 0 R 1379 0 R 1380 0 R 1381 0 R 1382 0 R 1383 0 R 1384 0 R 1385 0 R 1386 0 R 1387 0 R 1388 0 R 1389 0 R 1390 0 R 1391 0 R 1392 0 R 1393 0 R 1394 0 R 1421 0 R 1395 0 R 1396 0 R 1397 0 R 1398 0 R 1399 0 R 1404 0 R ]
->> endobj
-1370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.658 444.565 222.207 455.469]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787) >>
->> endobj
-1371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.575 444.565 296.546 455.469]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-1372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.903 444.565 448.629 455.469]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 444.565 513.996 455.469]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-1412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 432.61 220.377 443.514]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-1374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 396.379 286.956 407.283]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_ab93e22d57d1f5d94ae97ba1b9de9e3f9) >>
->> endobj
-1375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.772 396.379 359.742 407.283]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-1376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 360.148 305.646 371.052]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_abfb19498f2647b44344c6a84fdd6cd2d) >>
->> endobj
-1377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.461 360.148 378.432 371.052]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-1378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 323.916 291.499 334.82]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a702543ee828ef523fb5fe5ffdaf25925) >>
->> endobj
-1379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.315 323.916 364.285 334.82]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-1380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.151 323.916 479.133 334.82]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 298.644 300.057 309.548]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a2d4948b195e743f39601a13610fcf94f) >>
->> endobj
-1382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.872 298.644 372.843 309.548]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-1383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.948 298.644 484.931 309.548]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 273.372 228.097 284.275]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_ac21bd81d2f33da4dc915020bf16c801a) >>
->> endobj
-1385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.913 273.372 326.896 284.275]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 212.649 272.929 223.553]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a380ed65a246cd38c5ca3893b40eb4603) >>
->> endobj
-1387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.744 212.649 371.727 223.553]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.63 212.649 464.986 223.553]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 187.377 221.462 198.281]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a8c466c744746ef7249afa54667470cf5) >>
->> endobj
-1390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.278 187.377 320.261 198.281]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 162.104 245.512 173.008]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) >>
->> endobj
-1392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.73 162.104 343.712 173.008]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.539 162.104 435.896 173.008]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.374 162.104 513.996 173.008]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 150.523 134.838 161.053]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 124.877 290.642 135.781]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_aadbcd3b735dae0f714d1134cf8e6b911) >>
->> endobj
-1396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.458 124.877 389.441 135.781]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.343 124.877 470.825 135.781]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 99.604 218.693 110.508]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a414a473844efce3515611fdc6b26e4de) >>
->> endobj
-1399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.508 99.604 317.491 110.508]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1404 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1408 0 obj <<
-/D [1406 0 R /XYZ 89 770.89 null]
->> endobj
-1409 0 obj <<
-/D [1406 0 R /XYZ 90 721.073 null]
->> endobj
-416 0 obj <<
-/D [1406 0 R /XYZ 90 617.052 null]
->> endobj
-94 0 obj <<
-/D [1406 0 R /XYZ 90 609.963 null]
->> endobj
-1410 0 obj <<
-/D [1406 0 R /XYZ 90 511.652 null]
->> endobj
-1411 0 obj <<
-/D [1406 0 R /XYZ 90 459.486 null]
->> endobj
-1413 0 obj <<
-/D [1406 0 R /XYZ 90 411.489 null]
->> endobj
-1414 0 obj <<
-/D [1406 0 R /XYZ 90 375.71 null]
->> endobj
-1415 0 obj <<
-/D [1406 0 R /XYZ 90 339.026 null]
->> endobj
-1416 0 obj <<
-/D [1406 0 R /XYZ 90 313.754 null]
->> endobj
-1417 0 obj <<
-/D [1406 0 R /XYZ 90 288.481 null]
->> endobj
-1418 0 obj <<
-/D [1406 0 R /XYZ 90 227.57 null]
->> endobj
-1419 0 obj <<
-/D [1406 0 R /XYZ 90 202.486 null]
->> endobj
-1420 0 obj <<
-/D [1406 0 R /XYZ 90 177.214 null]
->> endobj
-1422 0 obj <<
-/D [1406 0 R /XYZ 90 139.986 null]
->> endobj
-1423 0 obj <<
-/D [1406 0 R /XYZ 90 114.714 null]
->> endobj
-1405 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F92 331 0 R /F98 1214 0 R /F100 526 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1451 0 obj <<
-/Length 2031      
-/Filter /FlateDecode
->>
-stream
-x��Z�n�F}�W�C% Z�(�6q�4m��}J
-�!WQ�TH�n���7^dʒ
�}1��rvg��̙����������e��E>���a/�><���i���	�x��拟d!��)�Ż�u#7��,�f�5v��W�9xzU��2N�y|+����p*
5DH��)�?�_M^^O>M�{Ĭ/Pz�f��O�0��ÈE�w�'m<N\s����	���_�F0G$`^@"ĨwUlw��o�.f���"i2�J��I�����›S�@#��b��~.�jY��a�^��z��ԂʬY��V0s�2gw����X�´ s
��Ũ�@���
���>WzR�|N�9�5ߨmj�\\F�?�
w�L���
�O��Д#2"DI�f�MZ�9�"Dn���@� �"
�礖�
����f�������S����l��(��-*o�
�ޙ�
�M�'B��L��1b����ܖ�!��DX04�B��?3F��T�$���} (�
 ��c=�l����a��0��e�y���߸��5�b5#x�l0{[f*Y�YI��, [...]
�
S�mw.���5��,[����I����G}_����
=�d�Q
���}�� ����6�hc�{k.�,�X�||�#�N�@	����U ��!����+�(
�S�'/��q��R�0ЍO��6
��נ�9q+��Gq��f\L�͘(�x���p=�
-eu�V�}
��&���`\0G�#D,�!�8�uX�!<�I�m���@+�D�[�^�B<����mm�]�|�<�6Z'-vj����l	y�64�jDU�Tp��rx�:o,UFik�TLo�X�֭�{�
b�
��J�# �Х�w�5j�!@�1�-��6-��f��V�f�r���;���)�\�[V �![��a��*�Z�4�χ�L|�U��(�?�脲X�8��,���S3�SG8�S�A�U�w�H��#��A���d���-&u�8\�p
ٙkQ�ec[�,
±αt�F
,m���*'��
�R@���]gdY #ϲ��Q,�:
#+Cm�r��#��Wn�Y0]����f��[��w��͌��3d{-��"�1A���W-
ָ0���2��H܏�_eE��Rifқ)��6w|;"+@o�Iߡ�3��
�J��r���Ҙj�����+0�I
��䣨ʯe��:n�pW��_ٛ��/7r����٠{�Ű�d�M��h�.�C�-�����U�"�
 �ک�e#��:���=�
m
�i: ��@��U֜L�`�A	��.�[.h�!U:�5���:�����{Gy[�ۡ�5���.�
�5M-�
-��j���Prb)A�|����R�DB�B�BN�� ��5�
-����F��`Qu�

��S�src�a�b?�!uE�:���(��f|=�G�yib�~W���<&������x�[��,��GX��o@\�yQo�΋����
-��Z_��v�L&�
�/n
ʩ~� �	���:�
-1?�_BQ���1_h��:�<�W�%�{�Ag|����=���S=�e�αL�F�#�g0����юT�z��*s��.
�ͥ�"i}�
����8:#ZS��F>
�>n�6�=!��WŌ��M�gi�2�6��=��H��=<�4
ю�w-�M������	iw�X�P�-���A�Xi>J���,�͝�7�jwq�[����s�2E�Pi(
-�־�P���6x���˰�g����
*b��%d/?������zQPF����#G�P5���N�y2�9	܇y�!��X{?�"
#8�����"�j!���"�=X�G������½�ۛ7��͏��:.V�x%���0��QK(��Z�%. |��d�Q�"��m���vx�y'��������]�w[&!W�H��>����[ղX�����>���
�
-�ҕ�Y��vD���-0A�O���蟠��$��ѿ�/݇v��jü%
D��
�0m��
-endstream
-endobj
-1450 0 obj <<
-/Type /Page
-/Contents 1451 0 R
-/Resources 1449 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1369 0 R
-/Annots [ 1400 0 R 1401 0 R 1402 0 R 1403 0 R 1424 0 R 1425 0 R 1426 0 R 1427 0 R 1428 0 R 1429 0 R 1430 0 R 1431 0 R 1432 0 R 1433 0 R 1462 0 R 1434 0 R 1435 0 R 1436 0 R 1464 0 R 1437 0 R 1438 0 R 1439 0 R 1440 0 R 1441 0 R 1467 0 R 1442 0 R 1448 0 R ]
->> endobj
-1400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 686.111 235.858 697.015]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a9a30e394a9c84bb9d2debda31433e6b4) >>
->> endobj
-1401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.674 686.111 334.656 697.015]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 660.304 239.176 671.208]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a90e279d0af3491d3cc793595e3e1bbff) >>
->> endobj
-1403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.035 660.304 398.018 671.208]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 634.497 244.157 645.401]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a87fc73217faaf213d5b5a810272be545) >>
->> endobj
-1425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.496 634.497 392.479 645.401]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 608.69 250.244 619.594]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a08451f3fa991dc14b1b8874bdefd7cf2) >>
->> endobj
-1427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.06 608.69 349.042 619.594]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 582.883 244.705 593.787]
-/A << /S /GoTo /D (interfaceppl__Constraint__tag_a94ca29d276a68f3f75aa62c8ab6109e4) >>
->> endobj
-1429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.52 582.883 317.491 593.787]
-/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
->> endobj
-1430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 272.727 313.058 283.631]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_ab823e62915ff895212640119f062252c) >>
->> endobj
-1431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.873 272.727 478.246 283.631]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 246.92 475.706 257.824]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_acd03b90ea728537b78a669806309a5c0) >>
->> endobj
-1433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [478.924 246.92 513.996 257.824]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 234.965 228.924 245.869]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.886 234.965 442.272 245.869]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.254 198.199 486.009 209.103]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_ae2334b2eefe8cae2ad750dfea1f7cade) >>
->> endobj
-1436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 198.199 513.996 209.103]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1464 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 186.244 268.754 197.148]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.86 186.244 473.245 197.148]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.254 160.436 321.648 171.34]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_a51dfb5223b7487379681d4cc1583917f) >>
->> endobj
-1439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.611 160.436 513.996 171.34]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 86.288 342.567 97.192]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_acb94e9072062c0827a16766cef2c1a5e) >>
->> endobj
-1441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.785 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 134.838 85.237]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.838 74.333 244.137 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1448 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1452 0 obj <<
-/D [1450 0 R /XYZ 89 770.89 null]
->> endobj
-1453 0 obj <<
-/D [1450 0 R /XYZ 90 701.166 null]
->> endobj
-1454 0 obj <<
-/D [1450 0 R /XYZ 90 677.242 null]
->> endobj
-1455 0 obj <<
-/D [1450 0 R /XYZ 90 649.74 null]
->> endobj
-1456 0 obj <<
-/D [1450 0 R /XYZ 90 623.933 null]
->> endobj
-1457 0 obj <<
-/D [1450 0 R /XYZ 90 598.126 null]
->> endobj
-1458 0 obj <<
-/D [1450 0 R /XYZ 90 556.774 null]
->> endobj
-417 0 obj <<
-/D [1450 0 R /XYZ 90 445.855 null]
->> endobj
-98 0 obj <<
-/D [1450 0 R /XYZ 90 439.181 null]
->> endobj
-1459 0 obj <<
-/D [1450 0 R /XYZ 90 340.75 null]
->> endobj
-1460 0 obj <<
-/D [1450 0 R /XYZ 90 287.782 null]
->> endobj
-1461 0 obj <<
-/D [1450 0 R /XYZ 90 262.616 null]
->> endobj
-1463 0 obj <<
-/D [1450 0 R /XYZ 90 213.895 null]
->> endobj
-1465 0 obj <<
-/D [1450 0 R /XYZ 90 175.68 null]
->> endobj
-1466 0 obj <<
-/D [1450 0 R /XYZ 90 101.343 null]
->> endobj
-1449 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1492 0 obj <<
-/Length 2189      
-/Filter /FlateDecode
->>
-stream
-xڽY[o�F~ׯ ���j<7��E����t�l���CR
9��R�BRv���̕�Dɲ���!�̙9�wn�����������{1�x�K/�^�c��y�<��u��ǂ�8�Ij���������{�n������+�=�Ga��ɇ������
F,����������O~�`���U�1/�.U#
#
-�!!���+Q�X8Ks-S!u���io&(E�U~���������o
����lN}<M�%�ʦշwI�B߷��ޙ�I�-:	���
(I�i�V�l�%Yf&5#�S�#�#��f5�=F��v��]�I^�}
��(��
c
�))���s�i^�fXZ�^3�S�O7�b�ZnMnk�~״b�PG��[3��i-�‰r+H���.q��Q�`e�L��

�(�΃�(��y���I��{Fa��� �8�X����զ�cn�:��R�(�~i�A����ш�
.>o�bъ���
Ye�<S�x`���zk����������^w\��\��H��
�މv[��l�"�l�eS5��~�������x�/�K�U�G��iUﲩ�L�$5��5� �
f���:����)$@�|�{T�VO�����lιo<i�p���
�99#F�L>ߗ�� 
s�L$������,m%/�\�O
_G
p���T

-�%3�y%�$/D��<5i�oڼ*Oq��
1����ۈ�ă2�7�m�JIf|i���
/���
���Q�m�&�$D�fE�8��zYy���7�e!l�e�xO�|4���e�y�ԕ��}��uj�d�,vf�4��Nɗ
O�bu�r�FT�4S�>z\ݲ���3�䩗�I*�̢�3�������u߽p}�9�1%i`V�s��ҁ�(�#��eU���Mf��n���pf�zj�9u�ދ#˪(���81���
�3`/g���6

��i.���p,�?Ew���F��
-
\a�;JYB����R�,�C��
q�N��
�Q�L�H��$�\ɢ���nͺ�vv#�2k��G�Xkk�
.Li �2��”��0.�&�p�Ҟ�B�F<�Kx'j�S�.�iJ�ʡ��y
��
-�=g�F����f&퇺���g(�]���Y!�b�%�=,k
�ɋ
-������@�A{FU�7�0<�S�q�qv����۪��$�1�Ims�ʼ\��'Q�� ��YU��Y�K�L
(�a�M���F
��i�U�2��!(�OOm2"p�sHA"� K�ٜL���
�sc��3��vo/��n/�S �8Z6.8��a�j��!:0�F�,�m^d�n�*֛vweD=RK��q`;Y
-;/m1sfM�~�[��~꼚7Yp��x2�.�����I,1
���iX:U�`:V��
-�28��Z=��q%�,c6���r�B�2��#��"f�	l��R�5�lrL�RJ}�1*�
�:��0@>w�~���Cyo�+k���[ޒE��L��W��
2
�u
-`{(
uM'�K��\>�o��ȥ�F��
-�A_�7�O��� ��8�x
Y{|9ڱH���L�I9
��Hb�}��{.Z�Dy�p�I	o
���$�qޟK
��
pl~~�ܵ˚#-̠G'`F{:-]쁡��Q�8!
0G�5`�`3�9R�I�@�"�C��<`��%Zr�2�D�^ϥ�/��Q&k�S
�}�4�B��N_�t���5�7�a����#M�Ɲ�>�9A<t�e�����
g��=<vf����t�^
-=�gg"��P���8�^��5�eC�>)�,q�����2�ƀp�wnj�\��4&�]
g��� d
���{�
i���*UzRj�<�Ear}�o��k�6s�4�%U��:���v�ɢ
�An~�
����|e����������nog��5�J����m�l�T,�
J�f�a��K"KĞJˉ����I6�m����I����ړ���R��J����N�A�����ȖN�]oԙf�'ߋ�s��eZT�k���"����\�������E!e����M�!�c����#L���{���1Wo��{U��N�
��;������?�E�
�p��a���~�7?��/I��&+���a���F�_�~�1��I	^g�\���E��
G��BP����‚W�����&�C��;��Ʈ��k����է��
-�Ո��&�!��5�+�
�K\������1hfv
-endstream
-endobj
-1491 0 obj <<
-/Type /Page
-/Contents 1492 0 R
-/Resources 1490 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1369 0 R
-/Annots [ 1443 0 R 1444 0 R 1445 0 R 1446 0 R 1496 0 R 1447 0 R 1468 0 R 1469 0 R 1470 0 R 1471 0 R 1472 0 R 1501 0 R 1473 0 R 1474 0 R 1475 0 R 1503 0 R 1476 0 R 1477 0 R 1478 0 R 1505 0 R 1479 0 R 1480 0 R 1481 0 R 1482 0 R 1483 0 R 1508 0 R 1489 0 R ]
->> endobj
-1443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 696.05 335.952 706.954]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_a7d4bec3e6101e95b57973dcab5880a51) >>
->> endobj
-1444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [339.169 696.05 500.542 706.954]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 670.244 336.509 681.148]
-/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_ac5344d92361779d92fcb36acf2d406ae) >>
->> endobj
-1446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [339.727 670.244 513.996 681.148]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 658.289 134.838 669.192]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 658.289 332.684 669.192]
-/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
->> endobj
-1468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 325.222 253.293 336.126]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a33e20d1de127c9232d2d1188bee532ef) >>
->> endobj
-1469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.108 325.222 358.716 336.126]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 299.415 321.855 310.319]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a7752ae55e7cd4d014f6498348ef47865) >>
->> endobj
-1471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.073 299.415 426.681 310.319]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1472 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.904 299.415 513.996 310.319]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 287.46 134.838 298.364]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.159 250.695 357.827 261.599]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_ab1316806c765a595ddfa4de5e8d971f6) >>
->> endobj
-1474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.696 250.695 464.304 261.599]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 250.695 513.996 261.599]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 238.74 235.001 249.644]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.838 201.974 366.064 212.878]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_af5253fb7ef85e1875cc453d9a9998459) >>
->> endobj
-1477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.612 201.974 472.219 212.878]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 201.974 513.996 212.878]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 190.019 235.001 200.923]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 164.213 260.735 175.117]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a540cea530eaa9c142b16fbf01f781673) >>
->> endobj
-1480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.55 164.213 392.17 175.117]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.611 102.021 305.072 112.925]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) >>
->> endobj
-1482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.393 102.021 436.013 112.925]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.459 102.021 513.996 112.925]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 90.066 149.224 100.97]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1489 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1493 0 obj <<
-/D [1491 0 R /XYZ 89 770.89 null]
->> endobj
-1494 0 obj <<
-/D [1491 0 R /XYZ 90 711.293 null]
->> endobj
-1495 0 obj <<
-/D [1491 0 R /XYZ 90 685.487 null]
->> endobj
-1497 0 obj <<
-/D [1491 0 R /XYZ 90 621.221 null]
->> endobj
-418 0 obj <<
-/D [1491 0 R /XYZ 90 498.349 null]
->> endobj
-102 0 obj <<
-/D [1491 0 R /XYZ 90 491.674 null]
->> endobj
-1498 0 obj <<
-/D [1491 0 R /XYZ 90 393.243 null]
->> endobj
-1499 0 obj <<
-/D [1491 0 R /XYZ 90 340.276 null]
->> endobj
-1500 0 obj <<
-/D [1491 0 R /XYZ 90 314.658 null]
->> endobj
-1502 0 obj <<
-/D [1491 0 R /XYZ 90 265.938 null]
->> endobj
-1504 0 obj <<
-/D [1491 0 R /XYZ 90 217.67 null]
->> endobj
-1506 0 obj <<
-/D [1491 0 R /XYZ 90 179.456 null]
->> endobj
-1507 0 obj <<
-/D [1491 0 R /XYZ 90 117.076 null]
->> endobj
-1490 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1537 0 obj <<
-/Length 2022      
-/Filter /FlateDecode
->>
-stream
-x��Z[o�6~�����@��"�b;
�֦�ehצOm(6m
�.����;$EY�eǩ��^LI���;7R؛{�{>��bpvα'�i�]�<�=�
�p7�>9"t4&�aQ,/��L����K�Gc��L�rO��}'g�
�h(3�DB
}>�|�r��b�u@`e��R�x�M����؛��
FLDލ��z>e0.�����f�����QopB!V�O�fq���q
�4I��ǚ�r^s��LЂt�}[)�^ʴP�����O8�;�Z�<��6E�Gm^=��Ǎg��"9�Ȕ��'ޘ��F�wR�ʬ����P�U����H �
��Έ�!��>����m�'� �D��!=���!���r�8q�g�
�J��F0�������
1>l3�퐫�,o�J�PG
����0;��>mˏ�pm�+��<�6��N P7���

Cҏα~
�h� �M`�D9���\�
��
�߫*�;���J,BQ� )Q}H��$��5��U- �'?9�3��?5+�q [...]
�=J��^�
��0��fh�������v��y�T^�(
��
�M)V%�[Vh�x�6�!�!`<��u]z��&Z�.�,�:����4��nxo{����]
�X�#*
�]'K���?�W�\���~Dյi�
��� LD�(���Y*�*�H��M�5M�S+맭���a���GuJQ�oJ� d�
-�[��O������/=�8�AxL����ېM����
�(�����_�t/�}YoyCBD��>��������bm�Ml��+��l8�^NdU���(���v��H{�_�R��b��ެ
��:�
�D�$�,J��ڇ/g�
!�j���6��L�mĨ��
0(	w3*5�W}%4����%�����՟`����v���3+��x�(
-h�/(������Gb�,T��q��n&
c�.t7���a#�Au\�����!��z��
	 0�iW�C�d���a($���
��W������
���CH;G�P�哱���t�*u!9������n!t�H&:�.�Yiݷ8��I��<����{d�
���S��׃u�q5I���*-~@ک
�# 2FP�����`dPma�Qm=�]�U�����
;T�.�Vb}m&A��wa�!�z�5(����5���e
O���
D��� ��	"
-y�iD�A�S�H�L��`5mg)(|��~(EPB4�JЃ��4���Fᘁ6CҜ�����R���DL�]5)��H��(�Ah^�"<�-�nܵ���~H�3�nx��n�h��į��/\����_g�2׹�:��.L���Դ?�ph0�1��麑j#��h�����
�q�p��\�B< R�?��OVi���j�n̶d��W
Ÿ�8+�6Af9$f#u�1�w��q�ϡ��Yd:-���i�t��������.�ڞ�օ�]�	��ޓ���g�ीC|ǠC����_��
ڜ;w >���Z>�-7[ݵ#���Y[��
-�][�#>�[?m���;9��di���&l	[�
�t_����nlh#��$�,WSigҚ0�E�~��դ�6�,�6���{}(�[G��)�q�
~��>K��I�M��Q �~���k{�
^��|�e����~�d�����mg�x9j��'�\o��u�w��Kgp+��]�e�Yֽ,M�Z(U<>;�Z�!���$��r^���Q�:�9(�y�|~��,LxB�9��@]ٸ�(�+x?&�S3�}m�t/��^��{��!�_��x�ő
-endstream
-endobj
-1536 0 obj <<
-/Type /Page
-/Contents 1537 0 R
-/Resources 1535 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1369 0 R
-/Annots [ 1484 0 R 1485 0 R 1486 0 R 1487 0 R 1488 0 R 1541 0 R 1509 0 R 1510 0 R 1511 0 R 1543 0 R 1512 0 R 1513 0 R 1514 0 R 1515 0 R 1516 0 R 1517 0 R 1518 0 R 1547 0 R 1519 0 R 1520 0 R 1521 0 R 1522 0 R 1523 0 R 1524 0 R 1525 0 R 1526 0 R 1527 0 R 1528 0 R 1534 0 R ]
->> endobj
-1484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 707.957 261.85 718.861]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a888341fcf1079aaaa4dd7b532662729c) >>
->> endobj
-1485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.666 707.957 393.286 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.785 679.904 260.611 690.808]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aa7260438cfc5fa383c7fb80b127f8315) >>
->> endobj
-1487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.106 679.904 393.726 690.808]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.84 679.904 513.996 690.808]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 667.949 189.622 678.853]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 639.896 250.732 650.8]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_afcc12e4f52a8ff85d16ebfc424447b63) >>
->> endobj
-1510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.95 639.896 381.57 650.8]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.831 639.896 513.996 650.8]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 627.941 168.591 638.845]
-/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
->> endobj
-1512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 599.887 251.33 610.791]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3) >>
->> endobj
-1513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.146 599.887 382.766 610.791]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 517.871 256.301 528.775]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_af5911dc31286d92c979c7ff89c249bc8) >>
->> endobj
-1515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.117 517.871 361.725 528.775]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.454 489.818 304.24 500.722]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a3f5244b219701d5ba5939982a1d11d97) >>
->> endobj
-1517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.404 489.818 410.012 500.722]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.13 489.818 513.996 500.722]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 477.863 134.838 488.767]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 406.806 268.495 417.71]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a3d3687abfb3878a67fca687b8e4ff0b9) >>
->> endobj
-1520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.311 406.806 399.931 417.71]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 378.753 271.813 389.657]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_ae12a1e70aa5010e6617de857f51574a8) >>
->> endobj
-1522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.673 378.753 463.293 389.657]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 350.7 276.794 361.604]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aba231f6ac03d82cbf693a6a29a5c2665) >>
->> endobj
-1524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.134 350.7 457.754 361.604]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 322.647 282.881 333.551]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a067f83ba740e5b6c0c585a5175723a0b) >>
->> endobj
-1526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.697 322.647 414.317 333.551]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-1527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 294.594 277.342 305.498]
-/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aad90ffcd536cd0d48ee183bca02103fc) >>
->> endobj
-1528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.158 294.594 382.766 305.498]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-1534 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1538 0 obj <<
-/D [1536 0 R /XYZ 89 770.89 null]
->> endobj
-1539 0 obj <<
-/D [1536 0 R /XYZ 90 721.073 null]
->> endobj
-1540 0 obj <<
-/D [1536 0 R /XYZ 90 696.246 null]
->> endobj
-1542 0 obj <<
-/D [1536 0 R /XYZ 90 656.238 null]
->> endobj
-1544 0 obj <<
-/D [1536 0 R /XYZ 90 616.23 null]
->> endobj
-1545 0 obj <<
-/D [1536 0 R /XYZ 90 534.025 null]
->> endobj
-1546 0 obj <<
-/D [1536 0 R /XYZ 90 506.161 null]
->> endobj
-1548 0 obj <<
-/D [1536 0 R /XYZ 90 422.96 null]
->> endobj
-1549 0 obj <<
-/D [1536 0 R /XYZ 90 396.79 null]
->> endobj
-1550 0 obj <<
-/D [1536 0 R /XYZ 90 367.042 null]
->> endobj
-1551 0 obj <<
-/D [1536 0 R /XYZ 90 338.989 null]
->> endobj
-1552 0 obj <<
-/D [1536 0 R /XYZ 90 310.936 null]
->> endobj
-1553 0 obj <<
-/D [1536 0 R /XYZ 90 263.553 null]
->> endobj
-419 0 obj <<
-/D [1536 0 R /XYZ 90 147.175 null]
->> endobj
-106 0 obj <<
-/D [1536 0 R /XYZ 90 137.887 null]
->> endobj
-1535 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1593 0 obj <<
-/Length 2609      
-/Filter /FlateDecode
->>
-stream
-x��ZIs�F��W�6`U��
@#sJ���xl���
�
"@
-b	 J���y�a#HBiυhݍ�|om��f�g�\�|{u��dz 
�f��Y�g>����h���b���3�	D��/޽�}����|v�����+����.��l�^}��"���
#�٣���8ep��>^��
-R0��
ʋ!L�a� B4�mX��|A�p^�U��Y��;^�����قr�x�7���m^ǰ����>��(��Ͱ4�,7�8��K=^ۗ"؊���RГ-��
�p�H6��ݪ�����OU�l�4��K�,҃���z�O�w�%�
3�R����>-\��^�oKՕ��j	�S�eϩ�<.���
�/7�4n��i�/���w��)".�@�c&�x�(��)6?
�b�^��r^�I�8,��>e
Rγ1��m,U+�l������Pf� `'
�����&����\`�Kߪ�w�
w�x��k��]% �}6��0�	�ǻ��n�~QΙ��`dȂ1'�� 
�A���	v$s�†����5J�&�N��}/c�ƫlc=�O�|;E�l]!vd\��\�l'M�>G��ܹ1Ԃ��:u�ߙi�FB��dN����S䉲b)��y����No`�#@�T*r�wP�%�g��.H�!����"�?�^4¾�\��?��! +QL��rc�O!�����=тcI��u� J�P�y�
\����1Ԁm1�=��*I��+���cg�qG����IO��m���Z�2�xHn�d��ҍ\�X��3�#y[�#��eR�q����Q�	��F��ѕ���;�
��
-.|�֒X��
���t���Ԅ��Wq��
�z(
E]�-�]��p�23t(G��!�
�|����OB����	�@* �~Z��a�z�0��o\�K`m�����>[Ԥ�"L�4�Ȱ@Vޑ����N
pf\���Q2����&��M�������1,\(d�2���]")��>�9��]��>@�6 �#�@~nљ����
����u���2�.�v��p!-������ٴ��cn�vZ��]�|�
`�{ ��
��oa>8K�]�0@��
Λd��2� �B}�F~u�	�0Wy"�́�6!���;f�5#5^�
�f$�
4#�%>�˘lޘ����Ø���s����Z��L�cM
-�eF�����hzԌ\
-��e�ʺ����ؙ�
-$��;_1֫ba&>%@��s��&��]��*���Hik��?�_�d$�
-��ޜ�6���z�о��3eW�ط��~��\�S�l�υ&8�F�����o��>��r5Ɣ"��~0ѭ�#��Ce
-c
@���c* �ƦGK� Q��M���.
"lj"�	=#r�x��s�r^W�ӱqT7��A�m��ghT�Fǁ�A^nk����ϐ�ʿ���-
�R at 1;�H�ͫ�4��ȳ(�6�����E+��c���rWqVC=h��]�]���J��Z� )�(���&1m���2�׷�a��<J�_��C�BmT
�B*�Z�5�q9��5t,�a_r�
0�!̃�d��Ψt9A�4~���Q'�8�JGA
m���[B�G��q�T�ȑ'Ι!v0p���]��k�k�]�
�����&�0�C�E�B�:G���W�>��
��Ԏ�f�!�[7�<Hr�RF�	��C�S9�
��"*��
-nOΊ�:��hۚ!ƛ�?;��Pz�
-��[�a��w�Q9����`���*ɦ
����2qvG%�)�w�nOʲ縶��v5�V�=�
�N����+���wԟvk���l|�j8
C��#����ʟ��S����E`����
��\�+���:y��M`U�5)3/��d���	`�� ����q��Xg�\��8R_xN�TB��ߵyu�WUa�T�:�+�N�wq-�`��8�]��k�*I�t��0�+���M�����~0���w���Æ".���@u���W��2c\p�/x����6�~k&�0�O�w�AO&���;;��MS��
W+#!h���Ɋ]}�nW�Eo:雖s)I�,J��M���ϱ����ю�
-^c=�O���������X{�Q��b�@
��+���U����+M~�K.��~��HU�q���76Y��x�\>8h9#]4pڶ
�9�@��}�<"���3c$�&�duos�H��6� 9 9b
��&
(�b~����&��B���x`["����.n�0�1�OV22���
�jw}H�1�!|�'�
 2�tb�
S�/����*I��.-.N���;��o������c(.��Aq����}fu�FWم�Ɲ���A�z�`۰0�ٝl���:�@v��
�g���EN{N���%a#�2�Zo��s�� (ڏ(O�f�3�tl+���z
;:���=
-�2���xg!�U;�}��B���ݱzhט�7)���a�v��h7Tߟ��=�L(�� "3G�ukS������
}yf�]�1Oo��_˰д���(�1���9�3���E�
q�6�	�Q�:�������d�A�t
PE�|/x_�ŏ��w�
 g�Vy�o��b�G�kaa�4�_�'�,6����?���>
-endstream
-endobj
-1592 0 obj <<
-/Type /Page
-/Contents 1593 0 R
-/Resources 1591 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1369 0 R
-/Annots [ 1529 0 R 1530 0 R 1531 0 R 1532 0 R 1597 0 R 1533 0 R 1554 0 R 1555 0 R 1556 0 R 1557 0 R 1558 0 R 1559 0 R 1560 0 R 1561 0 R 1562 0 R 1563 0 R 1564 0 R 1565 0 R 1566 0 R 1567 0 R 1568 0 R 1569 0 R 1570 0 R 1571 0 R 1572 0 R 1573 0 R 1574 0 R 1608 0 R 1575 0 R 1576 0 R 1577 0 R 1578 0 R 1579 0 R 1580 0 R 1581 0 R 1582 0 R 1583 0 R 1584 0 R 1585 0 R 1586 0 R 1587 0 R 1588 0 R 1589 0 R 1590 0 R ]
->> endobj
-1529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 636.457 218.374 647.361]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_ace16d45c8fbb00ad5b616aa4344fb798) >>
->> endobj
-1530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.592 636.457 288.879 647.361]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-1531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.227 636.457 436.953 647.361]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.579 636.457 513.996 647.361]
-/A << /S /GoTo /D (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) >>
->> endobj
-1597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 624.502 196.556 635.406]
-/A << /S /GoTo /D (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) >>
->> endobj
-1533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.805 624.502 302.299 635.406]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 565.929 287.046 576.833]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_aafa09f891353748a46868d342cc91cbc) >>
->> endobj
-1555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.862 565.929 358.149 576.833]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-1556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 529.273 320.799 540.177]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a048cb229297e24f6d0f7ab4e4351e2c2) >>
->> endobj
-1557 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.615 529.273 391.902 540.177]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-1558 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 492.618 288.132 503.522]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_ab3fe811bb3a347e553576dadff55339e) >>
->> endobj
-1559 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.948 492.618 359.235 503.522]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-1560 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.658 492.618 472.957 503.522]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1561 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 466.922 296.69 477.826]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a297969dd313ebb370c9419915398aaf2) >>
->> endobj
-1562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.505 466.922 367.792 477.826]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-1563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.898 466.922 478.197 477.826]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 441.225 226.414 452.129]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a278a22338f8428e328daf84dea4f94e7) >>
->> endobj
-1565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.229 441.225 323.529 452.129]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 379.337 271.245 390.241]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a30d13726e3b27f1be7e5eb05a7814bb3) >>
->> endobj
-1567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.061 379.337 368.36 390.241]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.821 379.337 462.177 390.241]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 353.641 219.779 364.545]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_af2fd5edcf647f4bc5b64cf0f4f712a51) >>
->> endobj
-1570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.594 353.641 316.894 364.545]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 327.944 243.828 338.848]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a318f5f2972203c84ea0fdb4b82bbab1c) >>
->> endobj
-1572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.046 327.944 340.345 338.848]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.73 327.944 433.087 338.848]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.565 327.944 513.996 338.848]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 316.363 134.838 326.893]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 290.293 230.05 301.197]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a140a26e6f6dc525c742aca71f598ed3c) >>
->> endobj
-1576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.866 290.293 327.165 301.197]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.626 290.293 409.107 301.197]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 264.596 217.009 275.5]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a74a772b49c2c3190ad8501ffa0337d2f) >>
->> endobj
-1579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.825 264.596 314.124 275.5]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 191.749 234.175 202.653]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a5d89173a47e10f469337343cfb807218) >>
->> endobj
-1581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.99 191.749 331.289 202.653]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 166.053 237.492 176.956]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a6d184edbb85d3c2747bb6097f7de17ad) >>
->> endobj
-1583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.352 166.053 394.651 176.956]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 140.356 242.473 151.26]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a30161047ab7c47dd7a68a852e98ed83e) >>
->> endobj
-1585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.813 140.356 389.112 151.26]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 114.66 248.56 125.564]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_a6a901364857f84dc0f111a29330c33f9) >>
->> endobj
-1587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.376 114.66 345.675 125.564]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 88.963 243.021 99.867]
-/A << /S /GoTo /D (interfaceppl__Generator__tag_ad6d26ca0f256b0d9a45173e7d83ee4cc) >>
->> endobj
-1589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.837 88.963 314.124 99.867]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-1590 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1594 0 obj <<
-/D [1592 0 R /XYZ 89 770.89 null]
->> endobj
-1595 0 obj <<
-/D [1592 0 R /XYZ 90 704.286 null]
->> endobj
-1596 0 obj <<
-/D [1592 0 R /XYZ 90 651.484 null]
->> endobj
-1598 0 obj <<
-/D [1592 0 R /XYZ 90 581.144 null]
->> endobj
-1601 0 obj <<
-/D [1592 0 R /XYZ 90 544.489 null]
->> endobj
-1602 0 obj <<
-/D [1592 0 R /XYZ 90 507.834 null]
->> endobj
-1603 0 obj <<
-/D [1592 0 R /XYZ 90 482.137 null]
->> endobj
-1604 0 obj <<
-/D [1592 0 R /XYZ 90 456.441 null]
->> endobj
-1605 0 obj <<
-/D [1592 0 R /XYZ 90 394.364 null]
->> endobj
-1606 0 obj <<
-/D [1592 0 R /XYZ 90 368.856 null]
->> endobj
-1607 0 obj <<
-/D [1592 0 R /XYZ 90 343.16 null]
->> endobj
-1609 0 obj <<
-/D [1592 0 R /XYZ 90 305.508 null]
->> endobj
-1610 0 obj <<
-/D [1592 0 R /XYZ 90 279.812 null]
->> endobj
-1611 0 obj <<
-/D [1592 0 R /XYZ 90 206.776 null]
->> endobj
-1612 0 obj <<
-/D [1592 0 R /XYZ 90 182.963 null]
->> endobj
-1613 0 obj <<
-/D [1592 0 R /XYZ 90 155.572 null]
->> endobj
-1614 0 obj <<
-/D [1592 0 R /XYZ 90 129.875 null]
->> endobj
-1615 0 obj <<
-/D [1592 0 R /XYZ 90 104.179 null]
->> endobj
-1591 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F103 1599 0 R /F38 1600 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1637 0 obj <<
-/Length 1937      
-/Filter /FlateDecode
->>
-stream
-x��YY�۶~��ڇ�@��U�r�m�I{/�d�SR��E{�ʒ#�3���M�-/�8-��E���|磈�U���n&��#
�(i�,����.
�N#D��`���M>Qe���*T�4e5�P7j=_�E�̳ƍ6�jvE��,`h�,��}����9U�
�i��<��~�j����Ä�M8 ��",֓��� ��WF,�����8e�o&�M�s#*��s�I��
!���7����j�,W)�J%�Ջ*�4YY�����a?Z8 ���x3�x��Q��7)R{��
-ʍ/��^�| k��hq$B!�Nܭ
\�Y2���*gDL�Ty	�?3�3#0��)gTL��X���&� �9L#�B���B�	Z�Vh���	b�����+Q�c�|;���b�VE���}kn������z�U�k/By�yn��
-���0��z:X��3	�
!ʝ��(�Yo������V%)DE�)���iir�0��]y
,B1�ce�_"��K"
-�HRz�P2jK�E� �1œY!u�BQb�
�
9���ٻ��B��^D7%�S�C��F
K_F��H21Tl�sD��Z��
2�7��{_5#1�"qՌ2�B2T�$�h��X��p
]���4�#�{E��(�1h!�C�J��O�mm���5�N:l}��:+�6Uv&�n�`(�:X�vDV��
�	}X���#O2��O����bG��B� t�Nl_|�r��
�ۀ����a��W6���&M
���>��(J�p���U��JD���΂_!
��9xv��G]O�v���+����V��+;y��M=�'a���$�<��3�a]H��U�k3�ĶI�t���Ԯ-C�����ڕ������X�ۼ�	�t/�S��l����:?�%ix�5G��CnSa� ����fy�
�e�Ҭ����a��gOH��Y��
-����üc?N����Ӵ�1���1"H��^�BQ$�����7� A�:�kM��E����6�\�3s$�.��'�Q�f%"���O���"��∅�| ��c��
+�� �4�����XA0�u"3�
�0#��-�g�
I���<ثr9��v�!o7��@_I�#����R�Y�KM-�e��q��t��Y؊���I�"4�F�Ͱ�����I�/X��k~��ML��W���*�������ic�h
suWW��ԝe�bK�p����@[+4*a[�3
�
�3�XbЬ��Ĉ�����j=��$n��rɜ�\5�
Ҟ3A{��|Q�~Y�8��%y�&-i�A����PDa���G��Mt�H�ɟ����Vo-�%i��qSi�rc�}i��gyn�
^���&y�*�꿜��V):��C�`)BM��!�ƕg�ka���{�?-.����-�����5ή�YL�3�od�gA$�鴃{��K���d?��.������l��Hpye�]c>�3�D4,?�I:%���{��`O,e|��
PXӜ.��Plw����m�I�}u0�����I[�x
v���X���0"at�6�_T��������'��
� �j�S;�� ��' [...]
-endstream
-endobj
-1636 0 obj <<
-/Type /Page
-/Contents 1637 0 R
-/Resources 1635 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1655 0 R
-/Annots [ 1616 0 R 1617 0 R 1642 0 R 1618 0 R 1619 0 R 1620 0 R 1644 0 R 1621 0 R 1622 0 R 1623 0 R 1646 0 R 1624 0 R 1625 0 R 1648 0 R 1626 0 R 1627 0 R 1650 0 R 1628 0 R 1629 0 R 1630 0 R 1652 0 R 1631 0 R 1632 0 R 1654 0 R 1633 0 R 1634 0 R ]
->> endobj
-1616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 425.461 335.703 436.365]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_a0632eaac5ec676910e433016619b3e85) >>
->> endobj
-1617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.921 425.461 513.996 436.365]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 413.506 134.838 424.41]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 385.952 522.191 396.856]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_ac23bf247df0b2721e97c8eeb8945adf1) >>
->> endobj
-1619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.412 373.997 313.028 384.901]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.555 373.997 513.996 384.901]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 362.042 168.591 372.946]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 323.529 530.749 334.433]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_af2932a2fa90f54f604e340d0e2eac7ba) >>
->> endobj
-1622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.412 311.574 313.028 322.478]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.058 311.574 513.996 322.478]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 299.993 134.838 310.523]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 272.065 343.145 282.969]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_a1842c4ba3cd1adb1e1bccef3cfcfa57f) >>
->> endobj
-1625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [346.362 272.065 513.996 282.969]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 260.11 168.591 271.014]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 191.05 365.809 201.954]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_a813ac0651ebac0120830cedf1ea58395) >>
->> endobj
-1627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.027 191.05 513.996 201.954]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 179.095 194.603 189.999]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.603 179.095 327.145 189.999]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.595 151.541 359.281 162.445]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_af4cdf3fbe1977a24a90904e02efd791b) >>
->> endobj
-1630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.585 151.541 513.996 162.445]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 139.586 163.61 150.49]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.806 112.032 362.05 122.936]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_af8d741d4315fb12dff45b47979f88808) >>
->> endobj
-1632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.567 112.032 513.996 122.936]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 100.077 194.603 110.981]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.064 100.077 415.692 110.981]
-/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
->> endobj
-1634 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1638 0 obj <<
-/D [1636 0 R /XYZ 89 770.89 null]
->> endobj
-1639 0 obj <<
-/D [1636 0 R /XYZ 90 721.073 null]
->> endobj
-420 0 obj <<
-/D [1636 0 R /XYZ 90 611.746 null]
->> endobj
-110 0 obj <<
-/D [1636 0 R /XYZ 90 603.082 null]
->> endobj
-1640 0 obj <<
-/D [1636 0 R /XYZ 90 499.43 null]
->> endobj
-1641 0 obj <<
-/D [1636 0 R /XYZ 90 441.365 null]
->> endobj
-1643 0 obj <<
-/D [1636 0 R /XYZ 90 402.498 null]
->> endobj
-1645 0 obj <<
-/D [1636 0 R /XYZ 90 340.075 null]
->> endobj
-1647 0 obj <<
-/D [1636 0 R /XYZ 90 288.158 null]
->> endobj
-1649 0 obj <<
-/D [1636 0 R /XYZ 90 206.954 null]
->> endobj
-1651 0 obj <<
-/D [1636 0 R /XYZ 90 167.634 null]
->> endobj
-1653 0 obj <<
-/D [1636 0 R /XYZ 90 128.125 null]
->> endobj
-1635 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1687 0 obj <<
-/Length 2127      
-/Filter /FlateDecode
->>
-stream
-x��Z[�۶~��ڇc5�W]�ڤY���M��<$����^���J�.��wxu��u��ɓ(�9�|3C	{k{W��g��E(��]�z�
!��]꽟
������!"�/���������;�l������G�#�}���K6���c/��<�Xzz����5���~�a�
-FT���X�B:R�D�� @�!�X����l�,��bIiwuRe�&+
�_;��+��R�-)G�GF��"��ǭ�A���HM�vW$J��-+��Y�MV��-̥��*�/�e�F���Ǻ���턹I�|���wl�X�i�@�7
-@�ΤZ���;�yf�,+{�����,�3V2N�e�?�w�$��
۔��j's��ES���Uԭ��H��'���o
�V�����'jCA
��lE��B���+%X-F	_��r//بf�V�>2��'>F��V��ɒ� pϬiD�4�dZ&;��X�j���.���b_|�w�`7d
��ܴ"d+4������\^�
k@���a�pe?P*���/��v����
��E�9�3�.���ؐ�MZ�30�p���q�t t��	��D�#�c$��G��� 
#̹��"�3�Ĵ`Ј�iZ�#��hZ�⽹)��?�,sS"�/����
�(��3��(db8q/��ڐ�k
lj�}+oᙬd=GHv�vS	�$�=�T!��!��)�ˬH�]*�H�"�H�P9n���� �"j��8�H^Ȑ�P��!W�oDLʀy@)���-Q�~�r;szD��~S6�%��qTS�θ����7rs#��9�"��;
�� U
H�b�j�� ��m]g�B�� ���c�����	�>���c��u��z��QY���oW]X酔�TC�&-��EN�Z5�U8�U�0�<�[�a6�8�B⠸��X"h��\c�q���3�^��.�S��*7��q?X�p?�E��AXݏ]���X�v��
<�[T�m6e���4�
���&D����p���3t� |>�I�Q�B0�JaL?R$:R+�G��3)A�3D at O
���d��+�A��9Rgb#
�)wZ�
-�^� �5I�jԐ;�Q���5�խ=̚�
27XW��:�N�ԽɏU+nlm�r�i�����ί'0+s��k̙s�������	�;
-&�7�		\R	p�
r�׉�.�;�i.H���	ԗQ@�I<����Km�q?
��q
RN��]��t�I�h����B�/��/9Ӹ�mŪ[nȩ��b��ʆR��A
|o���r�o�P��}?
��Ϻ���q[v�lO�S�
V��[���z���)���:�M_�w
-1?�����P���b��}�f����s�K]%+�Y]MV<̕
������c�X��'\D���]��� B,r
yھ��
�#`O��E�ᒪ���g fk�TB ϙ�?#�R�|N����b���>γ4vi�C��}ÄPu��/��u�;���h8��zg�i4uRV���e���*�W���V�C�綸Ч�P����Fnd��\ƵL�)��R�6	(�U�2[7�
"tu�K[k�ikݟ�4�}
��ʹ���a6�U�br$���q"Wi����C�
�+4Ƈ�V̹
"��D{�a>Vz5h�Rg��� �W	��:esr��Jl�k��U��t�8
-
�m&\J
7u������{�t��u�ƲH�v���Ξ�qĩ�
K���y��d�>�}+�]5��[0G����_��	��G�Ɍ������a�֟u{6w ���͞��"
 V=d���'�/ţƔp�P7Z�uV����0�D
�*L'T=�\v��ӑ��9["8ME!�N�a�'�7�N�����a��Ŷ��|1<�sLuc �E���|Y)�1b��'
�'��Ԥ�-sȳaZ��f��f���m\7#������(V??�l��������ˏ�\\
�@�S@6r�$�y�D��<�s�&A@��~[?l߱
�7�{Y��N��-;���)��GQ��{�b1�=;f������d/�姸X��}�z�/��Բ���6o
�縀i�p��'�.�vS��10'�ͥ�����8�3{z���!�i��7�u-�5Jʉ�{9Py��C��vSV.-�΍�I���)�E�
-endstream
-endobj
-1686 0 obj <<
-/Type /Page
-/Contents 1687 0 R
-/Resources 1685 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1655 0 R
-/Annots [ 1656 0 R 1657 0 R 1658 0 R 1659 0 R 1660 0 R 1661 0 R 1662 0 R 1694 0 R 1663 0 R 1664 0 R 1665 0 R 1696 0 R 1666 0 R 1667 0 R 1668 0 R 1669 0 R 1670 0 R 1671 0 R 1699 0 R 1672 0 R 1673 0 R 1674 0 R 1675 0 R 1676 0 R 1702 0 R 1677 0 R 1678 0 R 1679 0 R 1704 0 R 1680 0 R 1681 0 R 1684 0 R ]
->> endobj
-1656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 432.214 276.535 443.118]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a303533574d5d5d4d8f58e2d8646baa69) >>
->> endobj
-1657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.351 432.214 405.202 443.118]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 406.818 368.34 417.722]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ac64c8548738734fedbc94f03519b803a) >>
->> endobj
-1659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.558 406.818 496.409 417.722]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 394.863 241.637 405.767]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 358.508 402.661 369.412]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a95c612736a3e7524077dd5c81bf2a105) >>
->> endobj
-1662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [405.879 358.508 513.996 369.412]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 346.553 134.838 357.457]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.137 346.553 310 357.457]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 310.198 411.219 321.102]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ad4d88d3daaa672264c63c83071c2021b) >>
->> endobj
-1665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.437 310.198 513.996 321.102]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 298.242 134.838 309.146]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.944 298.242 302.806 309.146]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 272.846 283.977 283.75]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a9fc89d795c20b4270756269edf1b9604) >>
->> endobj
-1668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.793 272.846 438.656 283.75]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.614 211.783 328.317 222.687]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a121252cea61436e0df74e008b80c13b7) >>
->> endobj
-1670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.641 211.783 482.503 222.687]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 211.783 513.996 222.687]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 199.828 195.719 210.732]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 174.432 285.093 185.336]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a3094a8093769d647b9f477e14d53a3a0) >>
->> endobj
-1673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.909 174.432 439.772 185.336]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 149.036 281.577 159.94]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ae2c6fa9b0155fd9428ff3abcf1a66805) >>
->> endobj
-1675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.794 149.036 435.657 159.94]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [448.917 149.036 513.996 159.94]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 137.081 228.924 147.985]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 111.685 273.975 122.588]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a3671e52fd03a1c456c630b7c5c632df8) >>
->> endobj
-1678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.193 111.685 428.056 122.588]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [441.316 111.685 513.996 122.588]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 99.729 228.924 110.633]
-/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
->> endobj
-1680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 74.333 274.573 85.237]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) >>
->> endobj
-1681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.388 74.333 429.251 85.237]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1684 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1688 0 obj <<
-/D [1686 0 R /XYZ 89 770.89 null]
->> endobj
-1689 0 obj <<
-/D [1686 0 R /XYZ 90 721.073 null]
->> endobj
-421 0 obj <<
-/D [1686 0 R /XYZ 90 604.849 null]
->> endobj
-114 0 obj <<
-/D [1686 0 R /XYZ 90 597.856 null]
->> endobj
-1690 0 obj <<
-/D [1686 0 R /XYZ 90 499.518 null]
->> endobj
-1691 0 obj <<
-/D [1686 0 R /XYZ 90 447.166 null]
->> endobj
-1692 0 obj <<
-/D [1686 0 R /XYZ 90 421.959 null]
->> endobj
-1693 0 obj <<
-/D [1686 0 R /XYZ 90 373.648 null]
->> endobj
-1695 0 obj <<
-/D [1686 0 R /XYZ 90 325.791 null]
->> endobj
-1697 0 obj <<
-/D [1686 0 R /XYZ 90 287.987 null]
->> endobj
-1698 0 obj <<
-/D [1686 0 R /XYZ 90 226.735 null]
->> endobj
-1700 0 obj <<
-/D [1686 0 R /XYZ 90 189.573 null]
->> endobj
-1701 0 obj <<
-/D [1686 0 R /XYZ 90 164.176 null]
->> endobj
-1703 0 obj <<
-/D [1686 0 R /XYZ 90 126.825 null]
->> endobj
-1705 0 obj <<
-/D [1686 0 R /XYZ 90 89.474 null]
->> endobj
-1685 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1732 0 obj <<
-/Length 2426      
-/Filter /FlateDecode
->>
-stream
-xڽZ[��8~�_A�>,��Ւ@�lm�l�N�L�L6�yJ���656�}��{tÀi۝x��,����|�"������?��W{1�9���‹�'�1w�����ٜ`���Z߽����,d��e}�&�ٜ2�_��I*������D�,�#a�32���狷�_/L�=b�cHD^�����2x���QGރ��B�u�}�������z%Q�E�
���#
-MA"Ĭ�l�uр� [b.U��m~�$'���Bf!��3�}X��/��W1���b%�
y٘.C(��.���A�צ�(��^�
e~��0��P�ijM�&i��3�T:��(yk��j-7�h�kY�����'u���͏j�دg��6 at poN��8�F1����lgRd�Q�z�T���$j%�ۦ���/ʼ��I�
-���a�c2P

�����/ͼ��h����vm:�FM#�_f�[��˼�8��5�l���D#[��BăW���j[�J�V�v�������6�,_<���&��ؖ3s��i�f �����Au�3x��4g`� _�XYW��f�Aw�
-�7b#�]��I=
S��3��l�[�-�k� JA��z�#g��Rm��1������~���
�����g3~�ۚ��
��-!����H@!��.�)5��R��T
�f9�qc�X�Z�+F�p2�a�p��1#F�w@% ����E#�v��xe�g���gټ: 0�j��&��<�Z�3Z�K�b�=�5	�SJBD��֪q�4���,��@o�8�3S��mmqځ
����#r
�	�1�#���#�H��I��/0�A��i��i��ݝD�c��������o�.f�
5��l��wU
=���m�:	�C���M�j��^��L� 
Z���6	�Q�!�i�r�N�P��o�Y.f(��9Hn���la�z
��oޚ�а'�ag^���`!�#�SK-��!v�Kq6��Đ���Έ�
B�m	�4�? b���a���
H�4rHJ���5PJWI=	%޷
�g�[=�T�D��HVx2xT‡X���I\�^��\�&�t�U[��|�A�T^=
�
Vy���j��v9��>O��
�CU�X8
FOf�)��pI�CҤy~�m7�x`�ޙ���Q���3�`�(z9s��ˀ)$�C���6�BZ3}T���k�Miʏ���ma��A :��y�.Q$�9؎
GպL��<�|���
�B�8'�|+�(܄b�s7��s� \Bq2��$wb(�L?
U�UK(%���
����,⊹��HW:b���7�M��Q�$od��y�W~ �X���-3��,��S���.�^
+2]
��\
K.&�7E 5��0�ҭ
J�3�d}O]*/s�gr��Yuy�&�����v)Z��j��ܙ�K {1�8Z(�C_��C@	#��p���L��!Z�շ�]ڷ���f�
�N�^-fQ��K�jv�蹖?
	 r�P�q�̴��[�$娜s�
�M�L
_�� "���I /A�M#
-=�CEm �HtemS�
���8
a�^������r�br�iyT��
ys��,sS���|0w�̄�4��?f��r��Z�2
�}�
�鄝�M
�\^	:$���#/��6��'!��,@"�x�_c	�$;�އ���h�(@<���'�6	!�
- 
-@�pEֵ5QP�I%�O+�k��q�
�ܝ
$uwV`�����w[�x�A�ȥ�}:x���z������OM�/
�c�M�d��
�#�R3ݑB�i�����8���A���Z
�(!��%7y!����cU�F������ـ,���ƞ+J �
�j.��x�Τ�b��������Z�}Q~'�+��g�=��׶:�j�	�NO�I�� �3�8�5q.�u9��r3\��q����c��r-��*�]*a
�h�:G#B��"&��O��P�
!!0d���8��
&A�����Nm�=
x��������6a
Ő��ѹ��Ρ{b��HU ��b�p���������G���h�MF�a�p�k��f�`
-�Ipx��y�]� ����݌���T9dJpD��Ϝ��F
8?9E5fo��y�̬ۙl?�V ��լ�J	N��f�T(�3�޶Y�D�$^ౖ
�u޶��7��D��d�ͺ��P\ ݥY�����C
��ofķ�"p�?����,;CW�9u]��6Y�	�i��~�
i�����\S��B
�
��8����	��e���q��|����h���c���&)��d)���
r��Y�SE��;�/�
mA�^i[�;����
>J�Q����\�

��D&��vն���_�K��(-'��w/
�|���]�)]�����!�;}3�9�(�+�Au�~[��^�.�7������}d�d_M
-endstream
-endobj
-1731 0 obj <<
-/Type /Page
-/Contents 1732 0 R
-/Resources 1730 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1655 0 R
-/Annots [ 1682 0 R 1683 0 R 1706 0 R 1707 0 R 1708 0 R 1736 0 R 1709 0 R 1710 0 R 1711 0 R 1712 0 R 1713 0 R 1714 0 R 1715 0 R 1716 0 R 1717 0 R 1718 0 R 1719 0 R 1720 0 R 1721 0 R 1722 0 R 1723 0 R 1729 0 R ]
->> endobj
-1682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 650.466 279.544 661.37]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a4578b5352510727810a7c3be32208aae) >>
->> endobj
-1683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.36 650.466 408.21 661.37]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.711 625.442 350.983 636.346]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a22e81aa8cd862935e9a0abab515cf838) >>
->> endobj
-1707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.405 625.442 480.255 636.346]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 625.442 513.996 636.346]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 613.487 228.904 624.391]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 553.447 291.738 564.351]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_abc859551651eca1bcc3839f62d45dbfe) >>
->> endobj
-1710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.554 553.447 446.416 564.351]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.098 528.422 296.048 539.326]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_af29295940b1ad0b6b48cc44e92f04060) >>
->> endobj
-1712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.133 528.422 513.996 539.326]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.891 491.443 299.822 502.347]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ad00a2a1877537fa49a41013078ee2bb6) >>
->> endobj
-1714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.559 491.443 503.422 502.347]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 466.419 305.526 477.323]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_aa6324c2e330df63ad428eec9182fcc4d) >>
->> endobj
-1716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.744 466.419 459.607 477.323]
-/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
->> endobj
-1717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 441.394 300.585 452.298]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_aaf6f8270e3742973e0df7dcc9132f7ae) >>
->> endobj
-1718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.4 441.394 429.251 452.298]
-/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
->> endobj
-1719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 134.507 241.617 145.411]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a9c2a70f5f90ec3da123f549d6ca9fe4a) >>
->> endobj
-1720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.835 134.507 335.364 145.411]
-/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
->> endobj
-1721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.712 134.507 483.438 145.411]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 122.552 259.649 133.456]
-/A << /S /GoTo /D (group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) >>
->> endobj
-1723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.898 122.552 365.392 133.456]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1729 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1733 0 obj <<
-/D [1731 0 R /XYZ 89 770.89 null]
->> endobj
-1734 0 obj <<
-/D [1731 0 R /XYZ 90 665.325 null]
->> endobj
-1735 0 obj <<
-/D [1731 0 R /XYZ 90 640.49 null]
->> endobj
-1737 0 obj <<
-/D [1731 0 R /XYZ 90 568.305 null]
->> endobj
-1738 0 obj <<
-/D [1731 0 R /XYZ 90 545.165 null]
->> endobj
-1739 0 obj <<
-/D [1731 0 R /XYZ 90 506.49 null]
->> endobj
-1740 0 obj <<
-/D [1731 0 R /XYZ 90 481.466 null]
->> endobj
-1741 0 obj <<
-/D [1731 0 R /XYZ 90 456.442 null]
->> endobj
-1742 0 obj <<
-/D [1731 0 R /XYZ 90 416.049 null]
->> endobj
-454 0 obj <<
-/D [1731 0 R /XYZ 90 306.696 null]
->> endobj
-118 0 obj <<
-/D [1731 0 R /XYZ 90 299.415 null]
->> endobj
-1743 0 obj <<
-/D [1731 0 R /XYZ 90 201.16 null]
->> endobj
-1744 0 obj <<
-/D [1731 0 R /XYZ 90 149.366 null]
->> endobj
-1730 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1777 0 obj <<
-/Length 2288      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�F~ׯ�ۂU�hN
��F>J�c{m��`�X1�P �(�~{�EҢ��R�0
�4���>�
�=���������
����b��!
���/���߯~r� z�I�^|x����gu����ٟgna������ܜ}�
;1L��`����Ӌ6�
�����?gز��,y}��;|B!����
-��f��e.0v���ӊ�rm���P�ݢH��Q��-ޖI�x+3YFu^.��e���͢�;2-u��+x'yMzDrH��
�=�h �Es�_1fj�Hz�€6k�5�@D;�s��q�mN}��9s�	�]�3�2�e5�Ӏ���T���\T��d���y������W��ψ+�n>�c�Y��Y���U-���>���(�~#�'���@���#��C�"l
)q�Uh6焸������a�&���r��Ks���A 
���-`N9���p���>c=#�U�V[��g(� �5�͉W�a9�=�}
�t;!<�o���4�	���

<�NH�����|3�?BQ8��00~���B�}�/�T�̳�֜̍���J��,
��\Z�p�Y*c���(�&i
 e
Q e
6�� S
����p�2/����C�G�[DMAN 0>{�eB�{gMH= 2�R�UǕ��&��[�Z��H�O��6� 
F4�F��UQe�TV�1D�G���J��?cS�J\��`�^p�YT��)��o}T�u��b�F:�
:m�Tz� T��(�����P0�֡���Q�F/8�)*
"�@'
�6L,��$;�Le-�`��C���!���d���lƱ{�Il�����y���@x�<��)E0$Xت�&��7�1�g�5�e��e^Z�S�Y�dk3m�r�i��K�Ԍ�/��Y���Ԃ�Z�7�2�d�v
�?D#�<��!,|#ʛ [...]
&�2��Mp�J�\�(h]�f�.T}�y�&e��N�띰?���,��AHS� 8A�m��	c5��9�O�ޖ���i���ȠG9b�RE��fF�3]�r��0�LdV[Bt���CʅG
��r�x�J���۝Y]����X����"/��q���\g��1��A��<�7@�mT&��d!���a�޴,ɾ� ����+���N����'
-
�I�
R���;58'����#�>���a��t�
��� e�rs�_z$uՄA��ݡ�x��x�^ U~x �tÓ>_����K
FW
�X%ur+�$-��5_�%�d���
�
�#�;i�x�(������	�Y=j~��k����R�a�+w#CE4X���H�FyF.ʦVJ"S�����5��*�
�i�`(;!��E��nf�`!˛��Q��멳<��p��� ^x��]�N�yj�fs�_+��ڲh�R,�g�[��u[W��-��"���,�̊m}�a[���
-��P�4V�䋢��߹��)��Q1<�^�E^kG����L�:ηSmF=�U�����S��V�(����F�A9H|�8?�
OU�2�
��	�՛�蹰0�؁#oJJc�y�����y"X� ���%�����IlGp�H
�r쀌�ީ�`Bx�y51,M��\�7�t(�K3���
�{�K�LW�&Y��}c#^�oé �P�M�)���p88�	(A�
E�)���
-��Z&�"�n�g�6��w8B� �����!A��-
�W xSdMf'��za����y؎����ok�y6ED�o��:�Pu��s�(ͣ�>�8
@��a,�y|,�<��~��se�@�S"H}��}�A+�Eo�H������Q�A]�9�A�	NN���bb`("3(8 B�d
%�v�4�_ղL�zܫ��O(�h���Y���BV��e5|��V	��N�#S(��
!�:��7K�B݆�2��o�Xa���Jŝ�MQF}0��ʸj��Cq�����ŰS588^��A7��0ƭ�|$z�/��!
[Q��^ޫ�Q4!Q��
%p�
b���-�T՛ʗC
'
�,P&����.
v72��T�"F7�U��<�|���ڬ���H��3�?� 0�uk	�zc}��c'�/7�y����
��;��7l

-}[k�$��]3��Ǐ����\�E�z���ˇZ�2���:��_�l����*4ɲ{aCVn�V�eӹ6��ъ����i�� �G؂瑩������58�5Z�4��n3xl��ƕ5 ��e�p�TSE����_��
`
-endstream
-endobj
-1776 0 obj <<
-/Type /Page
-/Contents 1777 0 R
-/Resources 1775 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1655 0 R
-/Annots [ 1724 0 R 1725 0 R 1726 0 R 1727 0 R 1728 0 R 1781 0 R 1745 0 R 1746 0 R 1747 0 R 1783 0 R 1748 0 R 1749 0 R 1750 0 R 1751 0 R 1752 0 R 1753 0 R 1754 0 R 1755 0 R 1756 0 R 1757 0 R 1758 0 R 1788 0 R 1759 0 R 1760 0 R 1761 0 R 1762 0 R 1763 0 R 1764 0 R 1765 0 R 1766 0 R 1767 0 R 1768 0 R 1769 0 R 1770 0 R 1771 0 R 1772 0 R 1773 0 R 1774 0 R ]
->> endobj
-1724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 707.957 310.289 718.861]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a6cb7351e1bb87181f7e6c946db398b5b) >>
->> endobj
-1725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.104 707.957 404.634 718.861]
-/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
->> endobj
-1726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 670.629 334.02 681.533]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_acc700387404f10208584c1a847a6f328) >>
->> endobj
-1727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.237 670.629 427.767 681.533]
-/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
->> endobj
-1728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.115 670.629 513.996 681.533]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 658.674 179.65 669.578]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 621.346 342.577 632.25]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a2a64fe7b9774c990bd9db8aecd2dacea) >>
->> endobj
-1746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.795 621.346 436.325 632.25]
-/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
->> endobj
-1747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.354 621.346 513.996 632.25]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 609.764 179.65 620.294]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 583.021 249.656 593.925]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a9b452ce4baaf1c1644a6eb33658ae48a) >>
->> endobj
-1749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.472 583.021 370.014 593.925]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.361 518.699 295.743 529.603]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a85958538f17770d4ae66bcd179d747a1) >>
->> endobj
-1751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.813 518.699 417.355 529.603]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.64 518.699 513.996 529.603]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 480.375 243.021 491.279]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_adfc86b3b2966514ba2e2292584f68c08) >>
->> endobj
-1754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.837 480.375 363.379 491.279]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 454.006 267.071 464.91]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a99aac01eb1b8adc3667bbd3db68e8d34) >>
->> endobj
-1756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.289 454.006 386.831 464.91]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.216 454.006 479.572 464.91]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1758 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.05 454.006 513.996 464.91]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 442.424 183.844 452.954]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1759 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 415.681 253.293 426.585]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a8b96d560404b7b7ee0ec7ea1aef80280) >>
->> endobj
-1760 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.108 415.681 373.65 426.585]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1761 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.111 415.681 455.592 426.585]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 389.312 240.252 400.216]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_aa8e9420c29d8c75e775c4fd609830769) >>
->> endobj
-1763 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.068 389.312 360.609 400.216]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1764 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 314.031 257.417 324.935]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_afb6f23292760d6d55c57b5722f604897) >>
->> endobj
-1765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [261.233 314.031 377.775 324.935]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1766 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 287.662 260.735 298.566]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a0ca9a6d6894e381babab8f958c194f07) >>
->> endobj
-1767 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [324.595 287.662 441.137 298.566]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 261.293 265.716 272.197]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a3fc151fc10282a5ede395e9b8a5502e2) >>
->> endobj
-1769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.056 261.293 435.597 272.197]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 234.923 271.803 245.827]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_ac5a83c9e42e34b313e12a6cef4470a75) >>
->> endobj
-1771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.619 234.923 392.161 245.827]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 208.554 266.264 219.458]
-/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a190a7c46776178432e89c9525db039ab) >>
->> endobj
-1773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.079 208.554 360.609 219.458]
-/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
->> endobj
-1774 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1778 0 obj <<
-/D [1776 0 R /XYZ 89 770.89 null]
->> endobj
-1779 0 obj <<
-/D [1776 0 R /XYZ 90 721.073 null]
->> endobj
-1780 0 obj <<
-/D [1776 0 R /XYZ 90 686.129 null]
->> endobj
-1782 0 obj <<
-/D [1776 0 R /XYZ 90 637.299 null]
->> endobj
-1784 0 obj <<
-/D [1776 0 R /XYZ 90 598.522 null]
->> endobj
-1785 0 obj <<
-/D [1776 0 R /XYZ 90 534.011 null]
->> endobj
-1786 0 obj <<
-/D [1776 0 R /XYZ 90 495.875 null]
->> endobj
-1787 0 obj <<
-/D [1776 0 R /XYZ 90 469.506 null]
->> endobj
-1789 0 obj <<
-/D [1776 0 R /XYZ 90 431.182 null]
->> endobj
-1790 0 obj <<
-/D [1776 0 R /XYZ 90 404.812 null]
->> endobj
-1791 0 obj <<
-/D [1776 0 R /XYZ 90 329.343 null]
->> endobj
-1792 0 obj <<
-/D [1776 0 R /XYZ 90 304.857 null]
->> endobj
-1793 0 obj <<
-/D [1776 0 R /XYZ 90 276.793 null]
->> endobj
-1794 0 obj <<
-/D [1776 0 R /XYZ 90 250.424 null]
->> endobj
-1795 0 obj <<
-/D [1776 0 R /XYZ 90 224.055 null]
->> endobj
-1796 0 obj <<
-/D [1776 0 R /XYZ 90 181.302 null]
->> endobj
-455 0 obj <<
-/D [1776 0 R /XYZ 90 69.05 null]
->> endobj
-1775 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F103 1599 0 R /F38 1600 0 R /F92 331 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1837 0 obj <<
-/Length 2236      
-/Filter /FlateDecode
->>
-stream
-x��Z[��6~���k1�wJ�b�m�iӢ��b�b�X�G�-Meyf��~��l��d<y�>��(�\��#R8Y%8�n������I�2Ier�L2�(�!!�H�O"r6'������mY鼹��?w͌�S�ݖuu��ٜ
-<}S��Y�
�n��v�*�ER�ө`�߮��|{=�cB@
-���@*M����pR@��	F,K�;h�p��N~��s��Qa����IiBʄ�A�%dL�CA��
e�a8;&C"UQ���	�s>X��od]���2�*��L��9g
�M�B�eY�2�2�E�6���M �[ <ӍŇ,����rnli�S����׳O?��C[^���U�T��˺q��3�m��h�-2�hoQ
�*$)w�����]��HP�)��`%��md.��Ua�!���V�n���|)C2�a�ߝeH�v�G �X2ga�܋��:ou�L�:初����b��[���6oCKo}g��FU������=O ��
V�$����S��K��mv��n�/��� ������=߿�a�1=	��"�z])�W��sa��%\��J��yg��7+=�b���=��f4/�>:�~�
vO e�
�
E���1s�h�Q����>⏔%)�'�E���� ��S�e3c@[ ��X�72�,�
\_d[f�F�a�}���/�����UQV+7O[�ǀ�0�[g�c�:˪�8��@�Ŵ�%�¬�����
��gsF��){R�,�!���[��Z�E'�Ay�� ��hh� Z��ள2Q�R���
\A$",t4^RPIr	�$y�Iv�7e{{����y��g�"��30O{6}q�ȘZ9�s��9�)��]�s3ݴ�sƈ]�K��
�����Dg
�!��p�tN�),�ݸ�)s���pʌ�G at J%FBD�#��@4䡙<�
y�4���R���?�x����t\6��t"bD>-T�*��Tt���1+G`#W(O
�hq|RRO���G�ٕ��$�٬�:F��(�T
-'(V�d#���/껏�U/ǐ(�k�C�F|mR[G����I�vLR>��g��
��Ѩ8KO�
"SD%�<Ʊ
�=r�p�<�)�	�_$�Y��
-5�z���P*.G���
�:e�����u������V6��%&<h�&<�Kx�m�}l�1����k�Uq,'�)$��X'l`�i[�Y1n}O�aV�>�z��T�%�)
2�i9Me�$�\J#�m����q�;]�&���{�
-S���XT�Wg��
��.�0�w�
��l�a0f�a�m��
>��B�d�C$��#��
�qՑ��7�
ڎd �#��If���֓L ��OH�8;3�����v���>��6�,��,���pCvu�>c&��&
-R�J�g2�?�
�������9ȉ,��PT]�I
E�Әi�B��
E���Lǐa�v�3��,֔ŗNeL ���o�X��1�ݯ��>gB��m���
	yd��vD3�c�m�r���]�Y�
"�$��'���	�t��fd��=���}�9�Q��l���"�—&� �8f�.�>ʅ�dJ�O��`- ���s�ḠOg���O�m{�N\�69R��
�O���6O�\�`%����ߣ�V��ۀ;�
��e?�A�1
�@�偒��d���'��S7����"H�GB�^�V_�D�6�(E��!�T3�����,�O��>@
:$*w�Pk�ո_3=�ޖ~�M��
��v���y��Xuݾ�v/-�$�z�;��U���k����Z�[]�s�'���J{B������'��I��]
-��?�E������
���V|�C�P�
��n�?�h�l��>�f$b

�

�"I?��ts��)�r�
c�H��Pf
<
�Gi�m،p���ЅĀ
�!���B�IMė��&�H�#�M�įӔ>�E�����E�7X!Q\�F�� 4�W�
� ��(
����t�x���x���t�Xߕ��1Pr���^�*�*�� �uNT�yS�F�H1M����duPVO-IR���\R���&�F��3�c��P��nW�}�~X�
-	��q
-j���[�x�sF^�v�J��3I4ƃmu�יS���j���hsoҢn��A6xB�G�_t �S��$�~�؟�:�IJ��y�m��}uu�a���j���0�t/+1$z3
�n��cQYA�&7���ׂ���#i���	�$��#�m�0��;��lX�Gt��kZT
-endstream
-endobj
-1836 0 obj <<
-/Type /Page
-/Contents 1837 0 R
-/Resources 1835 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1655 0 R
-/Annots [ 1797 0 R 1798 0 R 1799 0 R 1800 0 R 1801 0 R 1842 0 R 1802 0 R 1803 0 R 1804 0 R 1844 0 R 1805 0 R 1806 0 R 1807 0 R 1846 0 R 1808 0 R 1809 0 R 1810 0 R 1848 0 R 1811 0 R 1812 0 R 1813 0 R 1850 0 R 1814 0 R 1815 0 R 1816 0 R 1852 0 R 1817 0 R 1818 0 R 1819 0 R 1854 0 R 1820 0 R 1821 0 R 1822 0 R 1823 0 R 1824 0 R 1857 0 R 1825 0 R 1826 0 R 1827 0 R 1828 0 R 1834 0 R ]
->> endobj
-1797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 563.049 254.399 573.953]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_aa891671c2b9414353067da44a108ac1d) >>
->> endobj
-1798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.214 563.049 360.928 573.953]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 526.755 322.991 537.659]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a512810c3e349a2f01217c6e426645260) >>
->> endobj
-1800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.209 526.755 428.923 537.659]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.482 526.755 513.996 537.659]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 514.8 149.224 525.704]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.77 478.506 359.65 489.41]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_afc650c1c744fbfc4dbd15293b9827776) >>
->> endobj
-1803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.13 478.506 466.843 489.41]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 478.506 513.996 489.41]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 466.551 236.107 477.455]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 430.257 324.645 441.161]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a7d65378709f5a0c73e711f5528385990) >>
->> endobj
-1806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.862 430.257 430.576 441.161]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.135 430.257 513.996 441.161]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 418.675 134.838 429.206]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 382.008 322.961 392.912]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a9ab7b109b1acae567c915b1db83b5283) >>
->> endobj
-1809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.179 382.008 428.893 392.912]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.452 382.008 513.996 392.912]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 370.053 134.838 380.957]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-1811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.03 333.759 332.792 344.663]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a1c54d4109f395752ea23822cee000d04) >>
->> endobj
-1812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.532 333.759 440.246 344.663]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 333.759 513.996 344.663]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 321.804 182.977 332.708]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-1814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 285.51 346.204 296.414]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_af99b9dc1c16751ce872dab5245c22fdf) >>
->> endobj
-1815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.422 285.51 452.135 296.414]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.695 285.51 513.996 296.414]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 273.555 202.892 284.459]
-/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
->> endobj
-1817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.052 237.261 367.489 248.165]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_abbbdd7f3c4800ef97b642142cd68648d) >>
->> endobj
-1818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.251 237.261 473.965 248.165]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 237.261 513.996 248.165]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 225.306 236.107 236.209]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 199.971 261.841 210.874]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_af232ff2f43109950ac1b0f5d124cf4cc) >>
->> endobj
-1821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.656 199.971 394.382 210.874]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 139.076 306.074 149.98]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6822) >>
->> endobj
-1823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.292 139.076 438.018 149.98]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.615 139.076 513.996 149.98]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 127.121 149.224 138.025]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.417 101.786 281.164 112.69]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a86c148ed14d1a2781e07bea5be7fb434) >>
->> endobj
-1826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.291 101.786 415.017 112.69]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.64 101.786 513.996 112.69]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.151 89.831 213.632 100.735]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1834 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1838 0 obj <<
-/D [1836 0 R /XYZ 89 770.89 null]
->> endobj
-122 0 obj <<
-/D [1836 0 R /XYZ 90 721.073 null]
->> endobj
-1839 0 obj <<
-/D [1836 0 R /XYZ 90 630.246 null]
->> endobj
-1840 0 obj <<
-/D [1836 0 R /XYZ 90 577.985 null]
->> endobj
-1841 0 obj <<
-/D [1836 0 R /XYZ 90 541.88 null]
->> endobj
-1843 0 obj <<
-/D [1836 0 R /XYZ 90 493.631 null]
->> endobj
-1845 0 obj <<
-/D [1836 0 R /XYZ 90 445.835 null]
->> endobj
-1847 0 obj <<
-/D [1836 0 R /XYZ 90 397.133 null]
->> endobj
-1849 0 obj <<
-/D [1836 0 R /XYZ 90 348.884 null]
->> endobj
-1851 0 obj <<
-/D [1836 0 R /XYZ 90 300.635 null]
->> endobj
-1853 0 obj <<
-/D [1836 0 R /XYZ 90 252.386 null]
->> endobj
-1855 0 obj <<
-/D [1836 0 R /XYZ 90 215.096 null]
->> endobj
-1856 0 obj <<
-/D [1836 0 R /XYZ 90 154.012 null]
->> endobj
-1858 0 obj <<
-/D [1836 0 R /XYZ 90 116.911 null]
->> endobj
-1835 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1892 0 obj <<
-/Length 2182      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~�_���j-
� �����r2�����I�8"$��+$5�ɯ���K�.�ƻ[�/"E�F��'�����^������cG �S߹[:;����_�|�x����
��&駯?�|���O���ۻ�?���1�=�g�^}�
;<������yԃRǥ
�����_Wز��,�}��ȇ�D�a�7J=�x3��<�0��Ym+fʕ��=�<)�d~g2,�o����8��q���|%3�o�y-�t������^��"Ϫz�~=F.����J1�_�r9�
���"�Y=�����
$"<ψdw��IL����z}0�#|��Rv�
H2�Us^IJ�jB �\ѹ��7�e����EfF
+��f@��
9%�)����1�7����]�4�D
���)�����W�g�ެ���F�4�h
�3�r�L�;�8?�4��
BN
R�
-J��!
~���̔�H0	ͥȫ���V�P{�S��ii���
	�`�D'��b��Ls���TF���G��x���jM�Pm�Va
Wʆd�~C%��8-����P �ݏ��CX�!h�L��y11�3�P�� f��
)
�� 6�"sS�r
�i����[婵�,���H�$G(G��E��d : w_N]o��u34�1�����Mb�D�M$m�
Wq��ؔ�oY
��S��W�d����
�̮F����͘
)��q��<K��H!��3Gm� ��1�|
t�9����F�v^
��,s
@
$ ���H���o��j
�rW/��Gpe^%�E��`����=�J�yȅ�r!X���W
����|
��V�0)1P
�!��
�f�-T�hD�ks�>�}�G��iK����F�f
-��m��	���`}0�
#���g$Q4�s��V��'A�����
�
N��д�"���T�!����A��`��x�1v��y�@��C��0�����ZP���
��Op����I���g��a�\`���`�Xv ?hW�����l
�<)[8bg��3��ɝY�M�"\إ[X��:�k%k�cn��K��Q(u]��A�֚e~�Ӎ�E�e�(�(�����"cA��nH�-��.�'�I�5��5[;;!Z�_ �:;�[�_1/Y)��oY/�7g���k�|
g����� Үc5�9E����D��V���`�݇;�
-��O�N��>�F�wh܏����\<��D��j�����z��>�@��>
D8F�G�B�*�}�E2؀����e�Kߗe���1|)��G0F4���uV��L�}R�S�޳���(��sж4M�tԡ!�y���c�D�
-���5�$u\$O#��ڍe��@�ٳ���1Gp
��?��A
����4Ϋ-I )��K��廬���65\�>�r�[���:��yQ��\��q_��4���
M� f~z����
	pU
�1<1�(?��|!�@���噪�yw��l��}L
�l��3؀�Dg:U]�0=���4
tOQ�������ٴܘ��> ��x�	�X�VgBf�n*�-ȸ�we���
ܨ;�L�D
��/
���6$I���߰�M�.��
Q����"Wgm6�5�
��B�bk[7�|�;�j�>���m��~��J�GO$�J|/zV�8�G������`�WdL��;�-��G�*�o����WM+�^�T��or���f�?�u�Ht�q���$��6�e��pQ��o��$��CӅpfX:G�+qD���
���}I
��v\~2�N.��Cs!���
���yW�e``&��uD�3�Hod
Ɖ��4�բ�����
V�/�\���M<y*d���]O����a)����9yW��7QVqwM�Q_d`�\=}�#9Ą�;K���4����2�N�:�P���^�N�k�� ��˰���L�NFޖ
�|�I��l����m°o߫�v�Ea����9j����U'���\@
���?�t@��eAd��	ZFmh�SȨة��&�ϙ��B�O0L8��e�^�l����R�ɁXGn�f
���=�meP`��!
fn�
���㭹ymOB�l�	W�� [...]
�Tx{
-endstream
-endobj
-1891 0 obj <<
-/Type /Page
-/Contents 1892 0 R
-/Resources 1890 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1655 0 R
-/Annots [ 1829 0 R 1830 0 R 1831 0 R 1895 0 R 1832 0 R 1833 0 R 1859 0 R 1860 0 R 1861 0 R 1862 0 R 1863 0 R 1864 0 R 1865 0 R 1866 0 R 1867 0 R 1868 0 R 1869 0 R 1901 0 R 1870 0 R 1871 0 R 1872 0 R 1903 0 R 1873 0 R 1874 0 R 1875 0 R 1905 0 R 1876 0 R 1877 0 R 1878 0 R 1907 0 R 1879 0 R 1880 0 R 1881 0 R 1882 0 R 1883 0 R 1884 0 R 1885 0 R 1886 0 R 1887 0 R 1888 0 R 1889 0 R ]
->> endobj
-1829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 707.957 323.788 718.861]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ae7af7908bffe9b331262dcf8fd020b7f) >>
->> endobj
-1830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.006 707.957 455.732 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [467.328 707.957 513.996 718.861]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.376 134.838 706.906]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-1832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 670.227 252.436 681.131]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ae861c5919e346c3966c43edc4cd47276) >>
->> endobj
-1833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.252 670.227 384.978 681.131]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 633.493 266.822 644.397]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ab348eeffa0a61124b880932c35d0188b) >>
->> endobj
-1860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.637 633.493 399.364 644.397]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 607.718 374.128 618.622]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a5f05719adb05b4fc86b33bbcf63884eb) >>
->> endobj
-1862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.346 607.718 506.072 618.622]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.97 545.614 311.817 556.518]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a225478fba412d40b785e2b41809cc90d) >>
->> endobj
-1864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.497 545.614 418.211 556.518]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.64 545.614 513.996 556.518]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [142.151 533.659 239.644 544.563]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 496.925 332.645 507.829]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a84c2e36e2ae01775ce542ebc83739726) >>
->> endobj
-1868 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.863 496.925 438.577 507.829]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [450.173 496.925 513.996 507.829]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 485.343 134.838 495.874]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.318 459.195 345.618 470.099]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_abfe9ef58fb96938e1c26b63e2b4ce0d1) >>
->> endobj
-1871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.646 459.195 452.36 470.099]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [469.942 459.195 513.996 470.099]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 447.24 215.076 458.144]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.616 421.465 373.689 432.369]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a3530a20e5985d6da8acabad37bfe0e93) >>
->> endobj
-1874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.015 421.465 479.729 432.369]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 421.465 513.996 432.369]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 409.51 241.089 420.414]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 383.735 335.175 394.639]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a8172cf537ccecb7826eb21837b8d7e7b) >>
->> endobj
-1877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.393 383.735 441.107 394.639]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.703 383.735 513.996 394.639]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 372.153 134.838 382.684]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-1879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 309.675 269.601 320.579]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) >>
->> endobj
-1880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.417 309.675 402.143 320.579]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 283.9 272.919 294.804]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a46773b226d490e5bbf6f3d587cf29dc4) >>
->> endobj
-1882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.779 283.9 465.505 294.804]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 258.126 277.9 269.029]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a50bcfefbf053e770951fa02c2e2eb112) >>
->> endobj
-1884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.24 258.126 459.966 269.029]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 232.351 283.987 243.255]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ac21bf6dd42b915ff6f157fb73fe396e0) >>
->> endobj
-1886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.803 232.351 416.529 243.255]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 206.576 278.448 217.48]
-/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_af78187771d58e90c174eeba577a471d5) >>
->> endobj
-1888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.264 206.576 384.978 217.48]
-/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
->> endobj
-1889 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1893 0 obj <<
-/D [1891 0 R /XYZ 89 770.89 null]
->> endobj
-1894 0 obj <<
-/D [1891 0 R /XYZ 90 721.073 null]
->> endobj
-1896 0 obj <<
-/D [1891 0 R /XYZ 90 685.462 null]
->> endobj
-1897 0 obj <<
-/D [1891 0 R /XYZ 90 648.728 null]
->> endobj
-1898 0 obj <<
-/D [1891 0 R /XYZ 90 622.954 null]
->> endobj
-1899 0 obj <<
-/D [1891 0 R /XYZ 90 560.66 null]
->> endobj
-1900 0 obj <<
-/D [1891 0 R /XYZ 90 512.16 null]
->> endobj
-1902 0 obj <<
-/D [1891 0 R /XYZ 90 474.43 null]
->> endobj
-1904 0 obj <<
-/D [1891 0 R /XYZ 90 436.7 null]
->> endobj
-1906 0 obj <<
-/D [1891 0 R /XYZ 90 398.97 null]
->> endobj
-1908 0 obj <<
-/D [1891 0 R /XYZ 90 324.722 null]
->> endobj
-1909 0 obj <<
-/D [1891 0 R /XYZ 90 300.83 null]
->> endobj
-1910 0 obj <<
-/D [1891 0 R /XYZ 90 273.361 null]
->> endobj
-1911 0 obj <<
-/D [1891 0 R /XYZ 90 247.586 null]
->> endobj
-1912 0 obj <<
-/D [1891 0 R /XYZ 90 221.811 null]
->> endobj
-1913 0 obj <<
-/D [1891 0 R /XYZ 90 180.498 null]
->> endobj
-456 0 obj <<
-/D [1891 0 R /XYZ 90 69.644 null]
->> endobj
-1890 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F100 526 0 R /F98 1214 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1951 0 obj <<
-/Length 2013      
-/Filter /FlateDecode
->>
-stream
-x��Zko�8��_!t?�
�
�
����)<�����m�"1������_���V�:�Ğ�O�h��<<��^��ZX���;����\l��w�c�o-[��#��[l}��!��W�ep1�
-������R�A.C�q�U��
#�_�ŭP�D�����|�����x���G�>���Ǒ�YQ����b���ˆ������M<�֬��
6CLjrY�3�Z� �sZ�^	���� �����]�a�{n3�����v�> �a�{��d?F
�\�qۨ\*K5p��Z��SL`��^�S�aҬe�
-��d�Z
�W`�&
-E9�za�ΜmB	���������W��t
�Xn�YT%yf�o�B$���*qK$m��)
�\�P[��[�E�u,tK�Ҧ%g�l�n����\nT7��w"�E��:��r<�n�O�G��
-�mT�i(TE�k�
+kx� v`�۠~�
_�q��.��(MeX�B��S�ވ�	��"-˛����rm9<�<f��M�L"��	tW�Y�s"�����l}���>�>9�~�U�ZҿX?�V
�����`z5�\L�=�O�����t
\�>55��ڌ�c��rl�96���03��<6�
���.
�%i��P���4ZUM�A\v n�v�McT�������A%��
-�*jC��
��/��|4�8
>^��G�	T
�uv+�21{�p���ـ�S���`��/Oǧ���&_g����}X�c
�0��e�l9�^ί�����zt1����Kx�ϓ������
J]��4���H�$[��<�tå�,T�V����3x�
�z7��`>�4?�N�?�^D�
��ߪ�<���n���Ê�.��$2f� j��x|5�̓��q0�4:ʮ#���h $���@���ވ�6��ڝ��8��x1 �/���[8J|���>;���]�`���~'
B�!
�Q�ϛAB�[��*/����QY&�,Y�$�9u���r�d>��x����Ӏ�"O�r9^'0�RFgO
��e��]
[�
��ɤ ?�L�a�o2-�N:�jM�F>�Ou6�&��;$S5�fڻ������s���
-�ЧS�K�Ȁ^���u������QEr����ӵM��Gg>ݶ�mD
^��&�A�,��
�=I%�ú�����3��Y?�0��˲k4�C�϶�c@@Z�,�n�1��î���&�<J���
-R�?J�N��iį�%��h�
-��C0x%�C
���#���	/����c����$a���
- ��AW�Ka�2�U2݋'���<<��A��|P���Ju�e?�w���ܺ�]x�w�w+��7�^r�Zt��(b~Õ��0E0r7:*A�@Nn�#�*�7v��
.A6m4e)�,0D��V�d&�@���B�C��=ݰ#�n
�t7"�vX�5��C������B�
�������ֽC���T8�F��{T8I�F-�@�}� ̟�݃4����x�V�4CZ���kNY�OI��(_=��J�l�^�
�,#"���
�L)�(�zUy�,��X2��>,̀"M}�,+J%�O3��^2$���5���,���ذ �
6���N����Ul��U����v��vI'ݷ�P�\/��-\�)I[C5s;��:׮�6>�x>����
(z���y?>l8�� �/��nj�,��t襂1���E%��e*m8�/Y�ʚ'�
0��e�Ͷ٬��8;Bp^��ҩ��<
��ܧUw��>
��ۼ�k�mGya�f�gq����\՝<$K�F)U��tz
.���7b��%�Y�I<���
��������;�S\\��hy��>>������8�^����@�W^��
\ස|#}_n���&��c��:77q�q
f�u����r������(~p^�\�ٺ�\%��%�(���gIL$7ܟ�:/ѓ�jե_{�u3dq-��(⮪V?
ݬ��(�������uv�h�Ӽ��L2�LU���o����1 ��
F��.U-�����CSq4I�u��Bl���?�6;
-endstream
-endobj
-1950 0 obj <<
-/Type /Page
-/Contents 1951 0 R
-/Resources 1949 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1973 0 R
-/Annots [ 1914 0 R 1915 0 R 1916 0 R 1917 0 R 1918 0 R 1919 0 R 1920 0 R 1921 0 R 1962 0 R 1922 0 R 1923 0 R 1924 0 R 1925 0 R 1965 0 R 1926 0 R 1927 0 R 1928 0 R 1929 0 R 1967 0 R 1930 0 R 1931 0 R 1932 0 R 1933 0 R 1969 0 R 1934 0 R 1935 0 R 1936 0 R 1971 0 R 1937 0 R 1938 0 R 1948 0 R ]
->> endobj
-1914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 563.74 348.725 573.668]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_adf86eb3611cbe63b34ef195bc87a7312) >>
->> endobj
-1915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 538.261 344.849 548.188]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a32423400858178cc05f325962afd44e2) >>
->> endobj
-1916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 512.781 340.476 522.709]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8efd1f7de8fb2bbe6e33aff1d4184078) >>
->> endobj
-1917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 487.302 342.677 497.229]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8ca7076566ebe098ff3bc307b4d91899) >>
->> endobj
-1918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 461.822 333.273 471.75]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8f2ab3d77bca7257df14bda9261a1326) >>
->> endobj
-1919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 436.343 428.475 446.27]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_af63454e50c1937573c75495f3cb4c1d2) >>
->> endobj
-1920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 410.863 452.823 420.791]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a9dfe99ee7d8e2b1d7360ab0119bd12eb) >>
->> endobj
-1921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.945 385.384 513.996 395.312]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79) >>
->> endobj
-1962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 374.609 133.174 383.087]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79) >>
->> endobj
-1922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 347.949 514.223 357.877]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ac379f873623c0fec37d988c2c374ffe5) >>
->> endobj
-1923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 285.681 332.953 296.585]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ab95e9f75dd971827c8a9a6b42faeeac7) >>
->> endobj
-1924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.171 285.681 420.086 296.585]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.954 285.681 513.996 296.585]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 273.726 149.224 284.63]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 248.246 235.002 259.15]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_af59141db49e5141da6ac594d43ead2f7) >>
->> endobj
-1927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.22 248.246 322.134 259.15]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.002 248.246 435.359 259.15]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.743 248.246 513.996 259.15]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 236.291 169.159 247.195]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-1930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.937 236.291 311.663 247.195]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.625 199.853 321.906 210.757]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a70c652d969734f6a69841d30a5e9033b) >>
->> endobj
-1932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.24 199.853 410.155 210.757]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.266 199.853 513.996 210.757]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 187.898 168.601 198.802]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.867 151.459 331.706 162.363]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8bda1b8ba9119202c16f88fdb19a535b) >>
->> endobj
-1935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.283 151.459 421.197 162.363]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.266 151.459 513.996 162.363]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 139.878 168.601 150.408]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 114.025 243.041 124.929]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_aa1663bce444a20240c852c9443005cc0) >>
->> endobj
-1938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.857 114.025 356.783 124.929]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1948 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1952 0 obj <<
-/D [1950 0 R /XYZ 89 770.89 null]
->> endobj
-126 0 obj <<
-/D [1950 0 R /XYZ 90 721.073 null]
->> endobj
-1953 0 obj <<
-/D [1950 0 R /XYZ 90 630.213 null]
->> endobj
-1954 0 obj <<
-/D [1950 0 R /XYZ 90 577.736 null]
->> endobj
-1955 0 obj <<
-/D [1950 0 R /XYZ 90 552.446 null]
->> endobj
-1956 0 obj <<
-/D [1950 0 R /XYZ 90 526.966 null]
->> endobj
-1957 0 obj <<
-/D [1950 0 R /XYZ 90 501.487 null]
->> endobj
-1958 0 obj <<
-/D [1950 0 R /XYZ 90 476.007 null]
->> endobj
-1959 0 obj <<
-/D [1950 0 R /XYZ 90 450.528 null]
->> endobj
-1960 0 obj <<
-/D [1950 0 R /XYZ 90 425.048 null]
->> endobj
-1961 0 obj <<
-/D [1950 0 R /XYZ 90 399.569 null]
->> endobj
-1963 0 obj <<
-/D [1950 0 R /XYZ 90 362.134 null]
->> endobj
-1964 0 obj <<
-/D [1950 0 R /XYZ 90 300.654 null]
->> endobj
-1966 0 obj <<
-/D [1950 0 R /XYZ 90 263.408 null]
->> endobj
-1968 0 obj <<
-/D [1950 0 R /XYZ 90 215.467 null]
->> endobj
-1970 0 obj <<
-/D [1950 0 R /XYZ 90 167.074 null]
->> endobj
-1972 0 obj <<
-/D [1950 0 R /XYZ 90 129.186 null]
->> endobj
-1949 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F11 610 0 R /F83 262 0 R /F24 169 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2022 0 obj <<
-/Length 2357      
-/Filter /FlateDecode
->>
-stream
-x��ZIs�F��W��*l��%9�x�'q"��`�X R�� �R�_�������SS<������������w7����}`/B�O}�~�E�
x��w��a ����=懈D>LR��~����O�w���7��
{D�(�����'�%�����B�I
Zz�2�.���_n�wE�" f� B� )js;��0��6�R�rn��U
 
�V��oߏߗ�d�.��*���$[�y���r�G,��EՂ�"��޲�k�e��z�tS�X#˸~^��un�P�9�(�*�#�L�8>����1Kx�[�];d^�|.g��!	oDh����.�:��#*�.�f�Lc
�A��
�[W����~H�Z����bf���?�Ӻ(u[iL7�|�(�,�;$!"D>��,��!
�a�
�6�w�#��38���8���IZ�����C"s��@g�߇�H��q?T'	�(N�m v�<�`�H�|
�j��!����`>$��m�vti繰
���0v���էy
�~ـm�ن�0����.�U}��
>
�?�	���؀
�p�50�@?-%V�Zw����0P�
-��	qY��]����ER�`CQ�,NjEo��`���= w\�C.J[ND�(<
�#����l�z�Q��2Ja�g��fƶ�֍I6��X�O���"�-}��s�U�1s�>ď��]V�u��R�y�
�\
-
-���2&��
epe
+lY,c�e,VJ��b�^l�!�r���!��
b�@��;l�3��,eJa�O2�p��U�w�
�n��-/xO�
�r!(d(���L�-l"���8�! %* ����a�E�L1?}��l��lߒw�{�>r��f��y�1��jz�-D
a�6( q-�൓D#��
X��A��
i���T:�^]
���!��q�-
��>���B�h�D�lT?8���f����Ż�&P�&�h�M�mڛ
*��ʧ 5
�H!�\��f�9�����9����UN��h�
vN�	�����@!�
�<��Ldzu>�
u7
Ņ�Nx�R9	;����4.�;#��?W%�X�>�
	rRi�Z�G�
�Q���a�4y1B��@d��|�����P����<�1W
%��
0��F���Ѩ��bVw�ĺj
�5��.
�:Sn<[\���(���~�C#H�yG�:?D"��tb��*Vu�������E�[.ㄪ���d��vB��i�.m��d$�G�=�9ܙ�Ƌ<���E��.��P�
����Bm,�*�Ĕ���e�V=�:�T����mL6;?��
��ϊr�&PZqy�H%w����ֳ*�U%]Uj@�#��
]��CZV�'����Y
9��&
S<L?
k?��56�cn��UZ>�+��2�]
�����M심�ť��W'�
 k�-.'�R�ƹ,���[��֦���r4I'�ۯ��M�Z���B; �-K�A�E���7&
-4��R�G��u�H�����$l
}��`98YJ��
��t!��,���Y�uu���
326�e��ŋ
��v
󟉵pэ˷h�1X�8�R9y��P�/bM���$q�5��l�ҡ�1��On������5̋b7T�(:��5��I�@�
$�������LE���f�A����]W�ӯ�n�h"��U�W:6!!?�w�FvQ��h�Q��Al*s3#�f*gHt�����e��Igț"%wX�hw�}X\�َ���� ������3�یAld<䢰{�

-�N�d��~+�0��H�$��Y؊��F-��W�l7�j��tA(H�
P�
�.���W���URTۼ���u����<1G�TDH���KWΧ$���9���mZ:����2��9%�LLF
�i�ali���y6F�$�}ovq1��8��e
P�K����܊X���aI�ay�
F�ܓ�9a[������{�3
�M��:�3���q�)
-!>]'�
-�����`=���OD��L󾔫K�u8`	�>�><?	ƶJqAב�p�hS(�i��1I}���c�0y����o�{h�s��
3נ����!��N�(i�֛��|L���&��������|���X���v�|W,����%\�00�j�P��d�e�����G����}v�q����׷���M+���Ir�[���w���#���L���`���0	�K5�u��O;�tܾ]2�_,�.7��F��knE䧊�*���:��|���n�җwq>_�s��[PN9��i��ߪ��j(Ġ��r����D���e�\�%�L�y�Z�j�o
�i��+��p j��>������z�
M
���� a��Aÿ/����|ǡ|ᖒ�I��
-endstream
-endobj
-2021 0 obj <<
-/Type /Page
-/Contents 2022 0 R
-/Resources 2020 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1973 0 R
-/Annots [ 1939 0 R 1940 0 R 1941 0 R 1942 0 R 1943 0 R 1944 0 R 2026 0 R 1945 0 R 1946 0 R 1947 0 R 2028 0 R 1974 0 R 1975 0 R 1976 0 R 2030 0 R 1977 0 R 1978 0 R 1979 0 R 1980 0 R 1981 0 R 1982 0 R 1983 0 R 2033 0 R 1984 0 R 1985 0 R 1986 0 R 1987 0 R 1988 0 R 1989 0 R 1990 0 R 1991 0 R 1992 0 R 2038 0 R 1993 0 R 1994 0 R 1995 0 R 2040 0 R 1996 0 R 1997 0 R 1998 0 R 1999 0 R 2000 0 R 2001 0 R 2043 0 R 2002 0 R 2003 0 R 2004 0 R 2045 0 R 2005 0 R 2006 0 R 2007 0 R 2008 0 R 2019 0 R ]
->> endobj
-1939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 707.957 287.275 718.861]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ad2154705f0854002a4f44f95580df9c7) >>
->> endobj
-1940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.493 707.957 400.419 718.861]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.325 707.957 503.681 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 682.38 372.345 693.284]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a0d5a001977b49f77a4514de614bf3c4c) >>
->> endobj
-1943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.563 682.38 485.49 693.284]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [505.395 682.38 513.996 693.284]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 670.425 195.719 681.329]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 644.849 323.648 655.753]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a4da79f8c645b945d52635733c3f63d7d) >>
->> endobj
-1946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.866 644.849 436.793 655.753]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.698 644.849 513.996 655.753]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 632.893 149.224 643.797]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.958 596.358 311.967 607.262]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) >>
->> endobj
-1975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.635 596.358 426.561 607.262]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.459 596.358 513.996 607.262]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 584.403 149.224 595.307]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.64 558.826 297.22 569.73]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a4b9b7034fd7b17eff672d49a7c85ac2f) >>
->> endobj
-1978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.57 558.826 410.497 569.73]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.64 558.826 513.996 569.73]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [132.846 546.871 227.828 557.775]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.445 510.335 294.901 521.239]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a19ff64e7fd60a4e08c782a4683d62167) >>
->> endobj
-1982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.056 510.335 409.982 521.239]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.977 510.335 513.996 521.239]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 498.38 179.112 509.284]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-1984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 461.845 296.739 472.749]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ab50ac757b6cb922c40504dc69c983568) >>
->> endobj
-1985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [300.555 461.845 410.482 472.749]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 436.268 233.637 447.172]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ac39a1aacb6aa4f54150e2b138d7b36f2) >>
->> endobj
-1987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.452 436.268 347.379 447.172]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-1988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 363.75 238.608 374.654]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a5357e1ed14407abf82149fe878789efd) >>
->> endobj
-1989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.423 363.75 326.338 374.654]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 338.173 361.426 349.077]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a44aa5cc75376dddfb9005dd74b27ff68) >>
->> endobj
-1991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.644 338.173 448.559 349.077]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.464 338.173 513.996 349.077]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 326.218 149.224 337.122]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 300.642 355.748 311.545]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a3659fef24b67be6b668955bc6865e779) >>
->> endobj
-1994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.965 300.642 442.88 311.545]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [462.785 300.642 513.996 311.545]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 288.686 149.224 299.59]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-1996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 252.151 277.91 263.055]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a36c57e3007fcb2340dc415f8431df7aa) >>
->> endobj
-1997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.726 252.151 365.64 263.055]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-1998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.621 252.151 481.604 263.055]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-1999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.745 226.574 281.425 237.478]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4) >>
->> endobj
-2000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.88 226.574 368.794 237.478]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-2001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.126 226.574 513.996 237.478]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 214.993 134.838 225.523]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 189.042 309.013 199.946]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_af349e801a615b2014d36c30fdb56022a) >>
->> endobj
-2003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.231 189.042 396.146 199.946]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-2004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.051 189.042 513.996 199.946]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 177.461 134.838 187.991]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 151.511 312.789 162.414]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a39e443628f6b73203b0f66189b8bc1c6) >>
->> endobj
-2006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.604 151.511 400.519 162.414]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-2007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 89.951 270.727 100.855]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_acdbb5fd3fa1ab9faed26fc5be47cc0d2) >>
->> endobj
-2008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [274.542 89.951 384.469 100.855]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2019 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2023 0 obj <<
-/D [2021 0 R /XYZ 89 770.89 null]
->> endobj
-2024 0 obj <<
-/D [2021 0 R /XYZ 90 721.073 null]
->> endobj
-2025 0 obj <<
-/D [2021 0 R /XYZ 90 697.566 null]
->> endobj
-2027 0 obj <<
-/D [2021 0 R /XYZ 90 660.034 null]
->> endobj
-2029 0 obj <<
-/D [2021 0 R /XYZ 90 611.544 null]
->> endobj
-2031 0 obj <<
-/D [2021 0 R /XYZ 90 574.012 null]
->> endobj
-2032 0 obj <<
-/D [2021 0 R /XYZ 90 525.521 null]
->> endobj
-2034 0 obj <<
-/D [2021 0 R /XYZ 90 477.483 null]
->> endobj
-2035 0 obj <<
-/D [2021 0 R /XYZ 90 451.454 null]
->> endobj
-2036 0 obj <<
-/D [2021 0 R /XYZ 90 378.747 null]
->> endobj
-2037 0 obj <<
-/D [2021 0 R /XYZ 90 353.359 null]
->> endobj
-2039 0 obj <<
-/D [2021 0 R /XYZ 90 315.827 null]
->> endobj
-2041 0 obj <<
-/D [2021 0 R /XYZ 90 267.336 null]
->> endobj
-2042 0 obj <<
-/D [2021 0 R /XYZ 90 241.76 null]
->> endobj
-2044 0 obj <<
-/D [2021 0 R /XYZ 90 204.228 null]
->> endobj
-2046 0 obj <<
-/D [2021 0 R /XYZ 90 166.696 null]
->> endobj
-2047 0 obj <<
-/D [2021 0 R /XYZ 90 104.948 null]
->> endobj
-2020 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2076 0 obj <<
-/Length 2441      
-/Filter /FlateDecode
->>
-stream
-x��Z[sۺ~���[��ƕ ۧ��>�S���v�3M2Z�d��CR���wA $AQ�lKi�/�E���aoX��=��z�����Bb/D�O}�n�ؓ<D‡���i ���V�������:�`��/�希��xp��q>�&�~��gq5,N�WX�r���?Ȍ=��H�dy��
����7#��j����u�ݞ�q���q���!��$���L��&��y�FxJ�ҼV���fU7� ��i�p�-
�D
�.55�3x+���$K��!X�Z&+�E�����"`^ ��\qK)�9�F�",
���ȸК(�J`R}�ʇ\h��	N/Bڢ�rf�(�B�gN�#��7�j>dr��<MR��(��xH��[Rꧢ��u�
�:f$�T�
F8x�
-)�P!,G

�O�XGe<���O�D�V�
��)���
�P~ %ú@�ov�<l���� �B!�T~��8��,�������%�g����I�e?�t�<
�i��
p��1��Zu]�M>��Z���Y�	���x
�
c�2�IFP;z�CO &C;`�N��#����n�Y
	܍kV�$��"��1mۆ��
�[�aG�֪�1-kG�
��cV�}Q7b>� �W�#���?�]�/Ւ��C�Nze挲�n#G���/��
���md���Sm����!X^���,����/#
	A+��P��
� �Ve�L~���0#���|7���
onX��6H�rr$h�ūqm�j��B�ID1;���M�� ls�
lG���T6"N��n5�nps_����]�BO
���g��ԍ�AKZ?<V���1`��ψ�і�J7��v�EQ�l�?�q�
6��m\��&�%KK���E_��Ey��!
+v��1W�?DB���F�Tp+�l1^��
;O2�GmuR���S-�~��Pa�5��6cF	���
����qR�Vj�=��K��kI�����/�F��9
-���5��	��@�x���5��X����/�֮w'
[�z�� `{:7V���}[ʬ϶��Y�}�����*��9��H~�c�������O��]ŏ��	P�w�] �L�G0n+�ɦ Ӭ��>�lVէ{�J��ڰ)i���U��1u�h�1��d�^%��~�g���Á�
-��
�4�j�~�}���S���

��#��p.�4R1�\�<��P�
���9��g*�#�^��uy�a]�E��”�~jЖd�U#��<*�����^����s"|����z��O�����4�,�ٺ��h%��lT(PH�Mhk���..��{��	�*�e
G�T|
�����x p��<y�m-C���9`+S&]ɼ%<Y���+�IT썓�C���D��1�[���XK$��
-TC�*�q�Y��Xd�Q��֧ �*-/��]����-�}}H&*�x0N��
�Y��I�[��
���	�g
S���b���$�x�^���Z�ܷ>���
����{o
R E�1Wg�v�VJ+y��2��8-�'O�"Ͷ���U�(k�Bp+u��A�,�
�>�v�iJ&��
puXv��+`���Q�\�.3��H����CP�A�B	A]*9P'X�&`��h�K6�'��擳���Eei O�$OVG�
�`%aĸq
w� ��ꃎt�
�s��qE"ݴ��V
&�P��D�������4vP9�YU�4'1T
���ﴨ���o �݅i�qKH��(��>zc��PJu̇8f-�Q���<��
-�����M�0.
.�Sz��l�^ְv6����r��5^t��!��:"��
-�W$�(ddW�
��u����6rd��G���d��uϤF�>ĤR ?���U�1�ʁ
�����#	1���K� ���5*�B����3�x�źN��Ufl��tuQ
n&�\B���1��
�*�A��2ߧ\c����S�<�4�ۇqk{�v�Z�������f����K���Ym�R��]=V�w2�α.W�g![�
�P[X��3c����jo>��:?��{{��v����󷷗��ux�"	R�9QE�@�-�X�VU$
�4S�A�Pg�
�[AMJgW�O�G
��A�Rnp����������:u��]���̈́2N5�0/���W���n]�dr��~�f���*MJ�U����@�*�
��fU��*l�Z��z�m�ӯ���3x��G[ �������?��	1��lꤻ�J�ꦵ��ټʯ;*��ˤ,z��/������9݆U�V}G{6��U<%
L�-�}"
:ǜ���U����<nw�:!��"��2b`xz�kˊ2�ZIyQ�aeѰꌹ�mO�f�ߞ�����͒���M��,W==�_�!��I�ܴ���RuR5񥍁�Y^Ww��2j$��������O0e�HI����O��yqz�d�Y�hz��w�
;
-endstream
-endobj
-2075 0 obj <<
-/Type /Page
-/Contents 2076 0 R
-/Resources 2074 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1973 0 R
-/Annots [ 2009 0 R 2010 0 R 2011 0 R 2012 0 R 2013 0 R 2078 0 R 2014 0 R 2015 0 R 2016 0 R 2017 0 R 2018 0 R 2048 0 R 2049 0 R 2050 0 R 2081 0 R 2051 0 R 2052 0 R 2053 0 R 2054 0 R 2055 0 R 2056 0 R 2057 0 R 2058 0 R 2059 0 R 2060 0 R 2061 0 R 2062 0 R 2063 0 R 2064 0 R 2065 0 R 2066 0 R 2067 0 R 2068 0 R 2069 0 R 2070 0 R 2071 0 R 2072 0 R 2073 0 R ]
->> endobj
-2009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 707.957 240.132 718.861]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a43a14864f62b4528d6c87856cba4da34) >>
->> endobj
-2010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.948 707.957 353.875 718.861]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.842 685.806 330.976 696.71]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a3ff750009bec94ab2c9a01139ba22420) >>
->> endobj
-2012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.528 685.806 444.454 696.71]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 685.806 513.996 696.71]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 673.851 174.668 684.755]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.129 673.851 256.61 684.755]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.803 673.851 351.284 684.755]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 651.7 275.101 662.604]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ae5845918fa5037ca4e9bdde4a4a3ecf2) >>
->> endobj
-2017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.318 651.7 388.245 662.604]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.15 651.7 501.45 662.604]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.697 629.317 288.484 640.22]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a894587e76b98f15a8ae120327dc9d532) >>
->> endobj
-2049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.891 629.317 402.818 640.22]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.13 629.317 513.996 640.22]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 617.361 134.838 628.265]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.837 594.978 277.739 605.882]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a2b4edec92d54747f5f1d2904407e744a) >>
->> endobj
-2052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.286 594.978 393.212 605.882]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.089 594.978 489.57 605.882]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 583.022 196.576 593.926]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 528.484 309.441 539.388]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ae7dc964062c194e3ae8eef0a828164ae) >>
->> endobj
-2056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.257 528.484 423.184 539.388]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 506.1 308.336 517.004]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a396b429302ce49ea9915778c317b81d2) >>
->> endobj
-2058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.151 506.1 396.066 517.004]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-2059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 483.717 313.895 494.621]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ad8caceee4f21496294aee9eb9aea4ec1) >>
->> endobj
-2060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.71 483.717 427.637 494.621]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 461.333 328.121 472.237]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a97fad1530ac4a3704d08097aec4bf206) >>
->> endobj
-2062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.937 461.333 441.864 472.237]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 408.554 250.802 419.458]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a7397b715c2ccf3f6fcf2f3900efe10d6) >>
->> endobj
-2064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.618 408.554 364.544 419.458]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 386.17 254.12 397.074]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a3789c297e202c735dbd829cd6cbed989) >>
->> endobj
-2066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.979 386.17 427.906 397.074]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 363.787 259.101 374.69]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a086e697a92a664c83721e0c442d45271) >>
->> endobj
-2068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [312.44 363.787 422.367 374.69]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 341.403 265.188 352.307]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8190bd5fde521e37c585c5c59b65f90d) >>
->> endobj
-2070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.004 341.403 378.93 352.307]
-/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
->> endobj
-2071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 319.019 259.649 329.923]
-/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_aebfd121256089b1415f3bc6989c25bbb) >>
->> endobj
-2072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.464 319.019 347.379 329.923]
-/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
->> endobj
-2073 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2077 0 obj <<
-/D [2075 0 R /XYZ 89 770.89 null]
->> endobj
-2079 0 obj <<
-/D [2075 0 R /XYZ 90 666.088 null]
->> endobj
-2080 0 obj <<
-/D [2075 0 R /XYZ 90 643.704 null]
->> endobj
-2082 0 obj <<
-/D [2075 0 R /XYZ 90 542.683 null]
->> endobj
-2083 0 obj <<
-/D [2075 0 R /XYZ 90 520.488 null]
->> endobj
-2084 0 obj <<
-/D [2075 0 R /XYZ 90 498.104 null]
->> endobj
-2085 0 obj <<
-/D [2075 0 R /XYZ 90 475.72 null]
->> endobj
-2086 0 obj <<
-/D [2075 0 R /XYZ 90 422.753 null]
->> endobj
-2087 0 obj <<
-/D [2075 0 R /XYZ 90 402.252 null]
->> endobj
-2088 0 obj <<
-/D [2075 0 R /XYZ 90 378.174 null]
->> endobj
-2089 0 obj <<
-/D [2075 0 R /XYZ 90 355.79 null]
->> endobj
-2090 0 obj <<
-/D [2075 0 R /XYZ 90 333.406 null]
->> endobj
-2091 0 obj <<
-/D [2075 0 R /XYZ 90 296.248 null]
->> endobj
-2092 0 obj <<
-/D [2075 0 R /XYZ 90 222.548 null]
->> endobj
-2093 0 obj <<
-/D [2075 0 R /XYZ 90 200.256 null]
->> endobj
-2094 0 obj <<
-/D [2075 0 R /XYZ 90 200.256 null]
->> endobj
-2095 0 obj <<
-/D [2075 0 R /XYZ 90 77.486 null]
->> endobj
-2074 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F24 169 0 R /F100 526 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2113 0 obj <<
-/Length 2552      
-/Filter /FlateDecode
->>
-stream
-x��Zmo�F��_!�>T������ᒸp��n�C?$�@K��;�T)*����,����ʖ(9��"�3�;���3$�����C�_�����Ie�~�7���AB¯i��@�����LjD��A��W���������{s���G��7^ ���e��gܟ���1��_ˇ�}N
��_{�2#*�=T�i�c!�g�BD!��pD0ƃ$-�#��`�Z�E�@X�R ��)�(2�4��A�F�Kϖ�o�:CD���T�^O�]>$b�=
�`/��Sl�e��zJ`�	���CB_�	�bq� @�Ys�5��_���?�H��4k "Ѭd�x�g�g���',�5agqp>��vP�'Y�.� ��u��	��ƅkT�݀l���duP0bD#!h�!v��q
Y
V�1lQR똇4�\�e{
-��x�	c:I��U1ڌI�6ːpʐ9K�4N�3�N1K]?�!�n�O���7�x �~.�TG��鯶� XmJ��
}�eH�
�8<(
cwR��>Pn��r
<��Y�<�����g��Q�*y����}�L��
��yլ���;
>��A�p"H�0wC�Q
-�"�m�X�w���ݻ��EB`��<�_$�f�ˍ�h��1$�xJ�W��
W��c@�M<G�dI����0��` ��󾆫MaBy�܏il�d���������9��D|��pq�����\O!���<���!l(����ڒA�w��|[c��y�(*�V���c2y�Ӿ&��;{���n@*���q�l}�p�iWx�3��kH��Ȁ�8*���W�t�<�n:� i��mȡ���e�^'�4�� 
�@4난"�a|�<Y��0\i��.�!�D��s3�+$Tp�z�P

U���Ry:��l��/���g�y��Lt��ɣ�`�Br �£�̣��
��
I�V��<�
|���
��)�.��}��S�<��@Y�%�S@��Z�ӟ��d-B\� ��Es(�Y�h���8'N@�SN*�3�$��6�"�B`XH���G2C�1C������M��Q�
->~0�"
�Ɛ=`5�OSAp�a�
w#@
'ߐ�q	
����e�ZB��u� �1�,u�1�=�����x�%���h�55�3��MA`}��
]Ys��;�U�
u�]��y��:T���I����Ĩ�08g��x?�ю���HR�l	�Qgm�����H@�p�|_J�4g]�p���%�Rl��I���LZD[�0��xL��
�s��l=M��_�_k�-R�a�g˝��e�Ef��k��e�"��K��{(�tY \��O�
-���#5}Y���h
-�W�ztO�q���x���oц,�(���AB�����>�'Z핬-ld�P�2MJ��:"��,���*!&����u<I���r =#QM1T��J<��i�eT��~�
�'DOm
���zp[��~��gp/��t?S�:�#
-فW��~������F�N}R���[wu!2�}�,��[
z�XҪ��$�,6n	�o��n��`�Ś��Y
-Ȣ�O���ڑ�mh�$����)�)�#Ș��_T���Y�'�+lyܻ����M�Y�� �뀬����q��
-T�na�zk�s���vߗP#�%����5�`��b<yL�qZc�%؎��jPr����.����*Y�]W�òj�������3���Q��F\�a�
�21��8d��
���T �ĖNb`f
j�-!�
��穭
-(S��H�K��4\�!���5��{ը��**L[��T�p[:�����I,�ž�&����T
��Y_+Ӡ=�A��~<�
�(��ã�f1����}�mC�!`�B�4�>�&���	��
.Y����l��Y�X4�<a�}GMO2�bl�l���o at 7D�����l���TR���@{@/�=R������_1��S ��5�m��׿l
-88��
-c��>Ј$�X�-�W�$�x�Ó�a`/�E��b
-����
	��6TG�"�iݑ��!O��]�I�#�
I��Np/D��Z�lS��@U����!��Jhr|!��Nt����7n~D�p�N��k�m���y+_#���R�"|�1O���g#n��� ���92��9�/��h}"h&�Q
��Ho�̂� p�k-�ꯄ�FPp�,l��X���NF��-���[�
-l��{z��-�� u����*��!ja�ܵ�/I�h<6���@	�8 at 2l����h=I��t�\}��S��@\d
�o�Y���G�Q(�����&���1��v��
�~�%
�R�|Ƥ�A[@A��F7ÑV��i�E�nh���F�_G@А����[��%qd;\
���+��!Q�-zM����2�B	Î���k�C%]~Y�{#LT���Z���zLu��v���3�7y����q*�QL�����V�7O��޺�W��6J�h^ݽ�o��{
���Ve�埣tS7�-���
��D��B��A·������6���W�xZvkp�i��cQ����~��8s4qN�w�v0p2,���{Vˬ�$)\\���s���[}�
-endstream
-endobj
-2112 0 obj <<
-/Type /Page
-/Contents 2113 0 R
-/Resources 2111 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1973 0 R
-/Annots [ 2097 0 R 2098 0 R 2099 0 R 2121 0 R 2100 0 R 2101 0 R 2102 0 R 2103 0 R 2104 0 R 2105 0 R 2106 0 R 2107 0 R 2108 0 R 2109 0 R 2110 0 R ]
->> endobj
-2097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.372 258.45 294.843 269.354]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a6455bb2686ced2d1a463955f6cbfa542) >>
->> endobj
-2098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [299.109 258.45 433.932 269.354]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 258.45 513.996 269.354]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 246.495 218.487 257.399]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 178.044 275.699 188.948]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a384e3002cf83ca2e73c4290d8629e043) >>
->> endobj
-2101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.514 178.044 414.337 188.948]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 155.233 279.016 166.137]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a4c12656e0256a4db3311855f9e94a36d) >>
->> endobj
-2103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.876 155.233 477.699 166.137]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 132.422 283.997 143.325]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a8f1b879675bf41b40bab41ebe9a97346) >>
->> endobj
-2105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.337 132.422 472.16 143.325]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 109.61 290.084 120.514]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a6b1a2446aa655ae65ce51b8a025c5751) >>
->> endobj
-2107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.9 109.61 428.723 120.514]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 86.799 284.545 97.703]
-/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_ab8a5eaf323d5fb0076b2ce079f9f5fc4) >>
->> endobj
-2109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.361 86.799 397.172 97.703]
-/A << /S /GoTo /D (group__Datatypes_ga25f9463d3385bd998e4fabcdce8dec5a) >>
->> endobj
-2110 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2114 0 obj <<
-/D [2112 0 R /XYZ 89 770.89 null]
->> endobj
-2115 0 obj <<
-/D [2112 0 R /XYZ 90 721.073 null]
->> endobj
-2116 0 obj <<
-/D [2112 0 R /XYZ 90 658.004 null]
->> endobj
-2096 0 obj <<
-/D [2112 0 R /XYZ 90 586.273 null]
->> endobj
-2117 0 obj <<
-/D [2112 0 R /XYZ 90 581.789 null]
->> endobj
-2118 0 obj <<
-/D [2112 0 R /XYZ 90 511.059 null]
->> endobj
-457 0 obj <<
-/D [2112 0 R /XYZ 90 408.384 null]
->> endobj
-130 0 obj <<
-/D [2112 0 R /XYZ 90 399.387 null]
->> endobj
-2119 0 obj <<
-/D [2112 0 R /XYZ 90 301.631 null]
->> endobj
-2120 0 obj <<
-/D [2112 0 R /XYZ 90 274.987 null]
->> endobj
-2122 0 obj <<
-/D [2112 0 R /XYZ 90 192.349 null]
->> endobj
-2123 0 obj <<
-/D [2112 0 R /XYZ 90 171.421 null]
->> endobj
-2124 0 obj <<
-/D [2112 0 R /XYZ 90 146.916 null]
->> endobj
-2125 0 obj <<
-/D [2112 0 R /XYZ 90 124.105 null]
->> endobj
-2126 0 obj <<
-/D [2112 0 R /XYZ 90 101.294 null]
->> endobj
-2111 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R /F60 172 0 R /F83 262 0 R /F11 610 0 R /F24 169 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2154 0 obj <<
-/Length 1719      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ��f" 	
i�3N,g���,�J2Z�eNy($e���]\)K���N�D���]`ؚY�z�y5��
z�
-P�R�_Y�<'@̅��z��	z}�1�����lx69+z���	O'U8��)��aV��*�r�:�W\���̷�,�}��
Ɲ�
�E�<�<ߚ��w�A�[
#;�[9(�
j�3��;�v�V
#�DS<�!>]1�DHm�����Wa���>���"�Wq�I����C��
���A��	�=w��T�Y�W�l*���Wy���jD|�B�|��H���\�h���3���\5�E�#�{G�L���\�
�
�xUޣ�{+�����v
��bQ���Z����_Z����CYܷ=��Ն�ã|�HyV�UmQmhu
�
P���3��"��A��S37�&�29�4��cL�����ȱ}I��4xO)k�z�g�Y��k
F��uѵ�b��,�4`�
-��F�� L�u
x߃�
?1�bE>c���F��jO2>�P�8aǑs�̭Ww�T�B�`���bD�ٖZ��=�
�f�A �@v� �6r��V�
-A�L��ft�W�n�2�m	}B�Ļ�
��"�pq���S3x�g�da
��r$���hG�i�\
�-�
hY�xe>�F.��
��&�7Q��OmhN6^?�vR ������=f�$�L
����K�
-n�����+�#���$/5hm��Aij���.�̓x��|
�UaVm5D���,ٌl+�t��b��a$H��
�Mzt��hp<9�/�''����!t��k�us
������un6��j%�>[dW<,c��=��
�N
�T�R-�7:O-��t�qp9=��

�
�i��ـv���cT^���G�з?�?
���	<'�/���� m�?
��sg`5��-�y�s ��tQU�6]Vr���!���4��<��,T�R^o��E�}Cn@�l���x2:����{
ߘ`�F�~
���
�
G�㝇�O�-N��8����t������`08|
$#���(�O������#&�����#������OHI|!��������}举T�*�������@n��_y�c��d�f_
����n
 ����[�
��b1��|��e<�Dc%�;�f��~ S���B�.�"�(�L�9���(M��J��_dX%4ʃ�4�b���d�L�u��55#�9։h<���@X[0Q��.��hj��
��{&��Ӗ��S\}����$���U�7q�lfn��-����(�
3hDuUn9D���
�yv[�o�u
�e�O��
?�3����uyY�ӆ��
��ڬQX�HЪ�m�f�Me����ζR�ѱ:��w�4�	��� ����
SU�����a��!���@����:��O�*�5��Mp���7� F����54slD�%6kYF\c����۔,I�Ԯ&=t�<H*���Lf$�ɝ�Kq_W���+?�o��>a@�z�t�0oq`A\�Cg	�6�����������<u���^�{d_��r!Q��Q��
����}}��x���=��t5P=��l�g�ysֺ��(y�\�Dt�>���E�7���X^���u��s��)���L뗎,�.U&>�*A��\W������bV�l��yz��˟!�`�vκ����gЙ��d*�o�	r]j�?v����
�lˏ�Gݱ7Lm� ��X�	�L�v
-endstream
-endobj
-2153 0 obj <<
-/Type /Page
-/Contents 2154 0 R
-/Resources 2152 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1973 0 R
-/Annots [ 2127 0 R 2128 0 R 2129 0 R 2130 0 R 2131 0 R 2132 0 R 2133 0 R 2134 0 R 2135 0 R 2167 0 R 2136 0 R 2137 0 R 2138 0 R 2169 0 R 2139 0 R 2140 0 R 2141 0 R 2171 0 R 2142 0 R 2143 0 R 2144 0 R 2173 0 R 2151 0 R ]
->> endobj
-2127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 445.942 337.158 455.869]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab5075367b0d60e3b979b18b4b8b36f55) >>
->> endobj
-2128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 420.794 329.955 430.722]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a83ff647a9f553f233355dcfe08f925ca) >>
->> endobj
-2129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 395.647 486.029 405.575]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a1492c1ef5bc77d977d14267b2344ddf1) >>
->> endobj
-2130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 370.5 499.867 380.427]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a73faac81cdd75868a90e0769e6e810ce) >>
->> endobj
-2131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 345.352 483.827 355.28]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3) >>
->> endobj
-2132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 320.205 499.319 330.132]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab98bad036b29cb094195b1d8e8212c71) >>
->> endobj
-2133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 295.057 476.066 304.985]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aa91485e68401872e9369580d71074838) >>
->> endobj
-2134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 269.91 497.665 279.838]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a7fde6bb756bf47a2801a8de40b1472d5) >>
->> endobj
-2135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 244.763 513.996 254.69]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ad5da07355917717a2b3ea402a2a27cec) >>
->> endobj
-2167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 233.888 156.417 242.466]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ad5da07355917717a2b3ea402a2a27cec) >>
->> endobj
-2136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.496 171.452 330.623 182.356]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_add80dff3a130d086d15874ada6e8d8ae) >>
->> endobj
-2137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.829 171.452 415.426 182.356]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.478 171.452 513.996 182.356]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 159.497 144.243 170.401]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 134.35 314.154 145.254]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) >>
->> endobj
-2140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.372 134.35 397.969 145.254]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.067 134.35 513.996 145.254]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 122.395 134.838 133.299]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 86.288 322.712 97.192]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a00a4b6909bbb8ab2fbf602d8589707b9) >>
->> endobj
-2143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.93 86.288 406.527 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [422.556 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.707 134.838 85.237]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2151 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2155 0 obj <<
-/D [2153 0 R /XYZ 89 770.89 null]
->> endobj
-2156 0 obj <<
-/D [2153 0 R /XYZ 90 721.073 null]
->> endobj
-458 0 obj <<
-/D [2153 0 R /XYZ 90 617.302 null]
->> endobj
-134 0 obj <<
-/D [2153 0 R /XYZ 90 610.116 null]
->> endobj
-2157 0 obj <<
-/D [2153 0 R /XYZ 90 511.834 null]
->> endobj
-2158 0 obj <<
-/D [2153 0 R /XYZ 90 459.855 null]
->> endobj
-2159 0 obj <<
-/D [2153 0 R /XYZ 90 434.896 null]
->> endobj
-2160 0 obj <<
-/D [2153 0 R /XYZ 90 409.749 null]
->> endobj
-2161 0 obj <<
-/D [2153 0 R /XYZ 90 384.602 null]
->> endobj
-2162 0 obj <<
-/D [2153 0 R /XYZ 90 359.454 null]
->> endobj
-2163 0 obj <<
-/D [2153 0 R /XYZ 90 334.307 null]
->> endobj
-2164 0 obj <<
-/D [2153 0 R /XYZ 90 309.159 null]
->> endobj
-2165 0 obj <<
-/D [2153 0 R /XYZ 90 284.012 null]
->> endobj
-2166 0 obj <<
-/D [2153 0 R /XYZ 90 258.865 null]
->> endobj
-2168 0 obj <<
-/D [2153 0 R /XYZ 90 186.342 null]
->> endobj
-2170 0 obj <<
-/D [2153 0 R /XYZ 90 149.428 null]
->> endobj
-2172 0 obj <<
-/D [2153 0 R /XYZ 90 101.82 null]
->> endobj
-2152 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F83 262 0 R /F72 194 0 R /F11 610 0 R /F24 169 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2222 0 obj <<
-/Length 2669      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~�_���j#
 
 �O�o9��gkl�!
+I��Lƿ~/Qǣ���)b 

������
��}�����K�g!
-�nֳϘ"?����;'��7?�܀#�Iվ���͏�o��߮~���xE�'<#�����vW�>�Y�?�0rC>�W�v3������^��
-Q�_%wg
D
<)�0�Pd� B� �UU�ɪ���؉�g�����������](ʹ�;�r+vr
�/Cڝ���7��ʕnӗ�#�ۦ�G�	%ܶH�zl� 7�m��O��/���,HH��
X?����R��k�n�c�Ym�婔s<��.q���F��S߹�`[�7�ڍh]�h�gU]�0H5
\�}�}|tt5rw�z�*�uVE��B߷;�
cWoSo�Ц��H�oN,��J�$݉�J�,�
-1����(
����Z�g&�F/����>T�0{��(�:/���(�rY���RӐ�N�h� N
-��3mc9��J?���^�_�TJ���G*��]����
H0����Z�g>PdD�
2��c�����mzLB���U�ʪ*n�4��rU�+����c*
x�s�FGt�!̛k=��P5�����P����2'��UFU�٠�n r�#"���Ş���{L��Z�0��
7��kd,��ZKLس
C!�
4[��}�K;�3���U��
^�1_�����怌����+c��,IW���վ����9@,�[�:�2a��
�s�9�\�B���Eb������9��R
Uu�*sQ�.`��[��kB���
ֆ�%�S��Tť
1�K�R_es;w�6M��
`�po�,َ!��� ÷#gH=D�ƃַ�~�����[��̽�K]_9�K
Ym�rݩ��}��꒐�'�zo��I,E��VĕHБ-c}|x`y��
��ٴ��lU�zP���$������T��'�������	w�1�'
�''��ݧ���ǮLoԳ�=pA�ˠT�}��S���V��20��M�
Զ�MU��H�  f `��e���]t=��v�li�v��9�X[0����By���Ԋ��s����O��@[Q�]�R�O�B]99�a��-E����6�Cl
�X�"�T� '�ӑ
-��?� O*�� p���p�O�Ҿ�
BtH�������X�&B�c�.��u
@u:@e� T�q�z���Q�r�9h��=E��W�
-*�R����/�D�_��n����zC�磠e�����+z�
^���b�
��d
P��<��.<B�W��k@�d@��=�L�hVf��2�X���7���d.�Z�l�ҁ�����
�-�
꬟�r�D�sφl�@k-3}�݈:���(�Q��7��a���P�L�1ć�;8�c�8��!wCX��

-��
�V�cq =�F
�G {�QMM
���) �D�
�-w:�����>ϏQ�"�;���t�[R�V��i�������hU��.��]G�\�@ZC�/���fWs��2
-��8&[�Q
-�Bnԟ
���D�4��k�=�7���>6d��u�'�!������6���
�Mw9ud:CFq��tK5���w/H��[`��׉��:#��*� �_�T�w4[�)�m�0]Է�9'��1��ڧ�*�\�R>�C�|���:�Խ.ҧ(��Q��l�qA��{1�e��3*�/���iR^��h'vy� z-$V�9�i8���L���8j�
ST��4=�b���
-�S}�N{�^4�uM�
�ȼ>�6'_�6[�

�|��H��
�^0�ޅ��������Dz칰�?��8����sg�L
軵s
�KB�
����Wy�c����o�L]ں���̝Е�My at u.��
M�� qr.��}���^�d�,��r'P-'EJ���WM�'���U\������oGI�J7Iw�r@���>\V�
�2����;Sy#I�osè�H�76ٓ� ��m\
���w6*���tt�|i���s�_Yj��'�,
-���zo�;k��I�rN��W'�i�b_‰�j�]�p��Ի�_m��w`ޅ5t�q�yJ���Y�������W��5U]�wi�=��Z�
���L�A�q�g�@�"qv�yY�/�k�	�;�p+.������f���=DT��V�.IƂ<к�S%;�=_p��ԟv�1��
a2e���P���,v��O���?���tYG]PPJ ����A
M�y��oq$q�S�,�O �}��,b�zVz�i:����c:S���������[��Ϻ�2
�6�,4f���
B]�"H�Q�����*�*U�$��÷���ɮ1�� y��GX��y�ε
�,8cDO^�q

-᝻5�~�y�]�}f�����\P$Ш�
�
�|}A
�*�s��b���~�ם9��tw"�����cާ��'��qUۋ
-E�j�
�Y���{�-�$��#����	
��d��wd.gO5J��ã�{�C�a��56a��
�t����ҽ��c at E���Wa�U?v��G��T\�ڹ�r�
n�-�ջy8� �ꔥ��Qb'Ukn����/��B~���>ޘ__ɗ�ki|z�A����;�e����Cy�w��l	 ���F��
-��Z�?���,�ڕ�SD�X����o����
������vf
�Q�&���e�b�ᢊ�����ZI
-endstream
-endobj
-2221 0 obj <<
-/Type /Page
-/Contents 2222 0 R
-/Resources 2220 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1973 0 R
-/Annots [ 2145 0 R 2146 0 R 2147 0 R 2148 0 R 2149 0 R 2150 0 R 2174 0 R 2175 0 R 2176 0 R 2177 0 R 2178 0 R 2179 0 R 2180 0 R 2181 0 R 2182 0 R 2183 0 R 2184 0 R 2228 0 R 2185 0 R 2186 0 R 2187 0 R 2230 0 R 2188 0 R 2189 0 R 2190 0 R 2191 0 R 2192 0 R 2193 0 R 2194 0 R 2195 0 R 2196 0 R 2197 0 R 2198 0 R 2199 0 R 2200 0 R 2201 0 R 2202 0 R 2203 0 R 2204 0 R 2205 0 R 2237 0 R 2206 0 R 2207 0 R 2208 0 R 2209 0 R 2239 0 R 2210 0 R 2211 0 R 2212 0 R 2241 0 R 2219 0 R ]
->> endobj
-2145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.736 696.218 305.41 707.122]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a51082042eaafc2db84f50f28d3d5b646) >>
->> endobj
-2146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.856 696.218 390.453 707.122]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [420.046 696.218 503.403 707.122]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 684.263 288.151 695.167]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-2149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.977 684.263 473.033 695.167]
-/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
->> endobj
-2150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 672.308 228.656 683.212]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 635.879 239.724 646.783]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a8e179abb162b61259eb3923f067944ad) >>
->> endobj
-2175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.539 635.879 350.148 646.783]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.878 574.612 284.328 585.516]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a1ebc3efbeb7fcf8da5556b365a9a1839) >>
->> endobj
-2177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.916 574.612 394.525 585.516]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.327 574.612 495.683 585.516]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.412 538.963 383.245 549.867]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a7387184a11ae23fd66b730a1ae720215) >>
->> endobj
-2180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [388.367 538.963 494.976 549.867]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 527.008 208.451 537.911]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 501.537 332.644 512.441]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a4f7ccdbb25ecfb4dcd2facbed54f26b7) >>
->> endobj
-2183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.862 501.537 442.471 512.441]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.607 501.537 513.996 512.441]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 489.582 149.224 500.486]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 453.153 336.53 464.057]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a41b5af390cf2af727c18a043bb869ffc) >>
->> endobj
-2186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [339.748 453.153 446.357 464.057]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [463.492 453.153 513.996 464.057]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 441.198 149.224 452.102]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 415.727 307.2 426.631]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a76361c178cf8799f530f17e791e8d0b1) >>
->> endobj
-2189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.418 415.727 417.027 426.631]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.163 415.727 517.519 426.631]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.082 378.302 294.344 389.206]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a68099fb9bb1067212c3e998b00255b24) >>
->> endobj
-2192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.136 378.302 404.745 389.206]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [422.913 378.302 506.27 389.206]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 366.347 220.077 377.251]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-2195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 329.917 310.577 340.821]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a2f230174a1c6cf8b3d0115ab268d02e1) >>
->> endobj
-2196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.393 329.917 421.002 340.821]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 304.447 324.804 315.351]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a66b9c383e8c77d79c0ffbd2f99987a94) >>
->> endobj
-2198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.62 304.447 435.229 315.351]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 278.977 230.319 289.881]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a65ace8cdf5e2fbf6e82c6834d3d29ada) >>
->> endobj
-2200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.135 278.977 340.744 289.881]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 206.751 235.29 217.655]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aca972841d5888907f7dcf13b24134e27) >>
->> endobj
-2202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.106 206.751 319.703 217.655]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 181.281 358.109 192.185]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a6b6bd9554098c88af56947f5a9e02818) >>
->> endobj
-2204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [361.327 181.281 441.924 192.185]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [459.059 181.281 513.996 192.185]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 169.326 149.224 180.23]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.765 169.326 272.122 180.23]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 134.673 364.744 145.577]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a9f81c698a50d6b97d896dca8cda4042c) >>
->> endobj
-2208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.962 134.673 448.559 145.577]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.694 134.673 513.996 145.577]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 122.718 149.224 133.622]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.478 86.288 337.394 97.192]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a2828646f7257660ec4a2a6a06427a715) >>
->> endobj
-2211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.582 86.288 423.179 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.478 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 144.243 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2219 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2223 0 obj <<
-/D [2221 0 R /XYZ 89 770.89 null]
->> endobj
-2224 0 obj <<
-/D [2221 0 R /XYZ 90 711.377 null]
->> endobj
-2225 0 obj <<
-/D [2221 0 R /XYZ 90 651.038 null]
->> endobj
-2226 0 obj <<
-/D [2221 0 R /XYZ 90 554.122 null]
->> endobj
-2227 0 obj <<
-/D [2221 0 R /XYZ 90 516.696 null]
->> endobj
-2229 0 obj <<
-/D [2221 0 R /XYZ 90 468.312 null]
->> endobj
-2231 0 obj <<
-/D [2221 0 R /XYZ 90 430.886 null]
->> endobj
-2232 0 obj <<
-/D [2221 0 R /XYZ 90 393.461 null]
->> endobj
-2233 0 obj <<
-/D [2221 0 R /XYZ 90 345.077 null]
->> endobj
-2234 0 obj <<
-/D [2221 0 R /XYZ 90 319.606 null]
->> endobj
-2235 0 obj <<
-/D [2221 0 R /XYZ 90 294.136 null]
->> endobj
-2236 0 obj <<
-/D [2221 0 R /XYZ 90 221.721 null]
->> endobj
-2238 0 obj <<
-/D [2221 0 R /XYZ 90 149.832 null]
->> endobj
-2240 0 obj <<
-/D [2221 0 R /XYZ 90 101.447 null]
->> endobj
-2220 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F98 1214 0 R /F99 1213 0 R /F100 526 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2271 0 obj <<
-/Length 2345      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�}�W�-R�
�B`��S��n�c��03��)JfE"�$���Ӹ�*ʒly����̋�F�����	�<����/��k���
���bO�!�<-���H8�"�IQ��7���rJ�$X'���V�+���&SI����>~J��i�d��M2�z��ŏ��]{ĎǑ�^����{
x���
���4�x>ep]{w�^`���j�"�'a*���B|�(�
-B!v:w�����ѩ���)h�'�&���W�t�dU�g�1_�+X�u)�>���S�]�����3cia����IR�Q��
�Bd�b1"����wdl\[ev
t�{E��$�")�Q�P�{���W

�fʽ֞*W�e�L3�
�b1��Re��mD�
_0�{e��f�<��Qc�C�̸��!�Z��,L)
-|f�H̚��|�~��&CD-��Ja���21I�>��v��t9Q	�����g+|�f鑽�y�G�E�
�'��P,R�	�̧ �@�? �j(Swy#*ͨ/���`
�wϕ�)�H0A!wq8���*����n�i6����m5�F"�mkoч��� 
�1ڮ?�b��id
g��l^7������%�w��K��0S���hx���V�*Ri��iԼ*��EpL�Ut��?%j[f$4(�K�W�J��ӷX�<1_�\�c�ip���M�F���*c�`n�5/T��֮C�x��6��2�f�?�=
�r�L;y���[Z%zQ�
z5G�� L�I����
-+�i',
�d�(?� 
-��e7�j�u"��&S�'�Se�*�mu���#��D��78���N�x
�m��C3�˜Ӂ��)��2I��d rvM��ytt��Jd�I=B���W����q�L���s�*����2U
�����袣�qZ�o�
�r���%�e^���q�
-Ԧ.-��tP��!���<�#b�&v���e����Y�j���1R-��Į������!h���( �
Lk����x܆


��J��#x��}����6)�A��]�Z>�^Y��v�Ds���5��X�FϜ�W�ҐTe���6k�g��
���vK躙�)Zo�>k635i{=V��w>����q�����"hVX�
C�]��	�=P��u�F�[;H^��)�3�B����� �
I�
��
o��rJ�=2*a`���t���s�����U�z��:����'����vq����[�ّW#��������AҤ�`�ɑ�Z�[5"�QDEx\�$Rv� �Z
�뛏?�	�
-	�(v
-E��-D��+��� �ya��)?#
-�	j�>%5�
sw
�ǔ��e��'��qUG%~��Q��
-IJ
�=`�w�c��P��[��V87�z��W���E��/5�y�k]�zU6��\�=���q�.�V�bC-�)����a��cV:=���)2��w��T�i:_l7���g�=�����
�Nؙ�f1
�0�_72��:���*�T�+-�}�!����}�m���V�	���>O
���+��y�x'�{;\�z;�4u*v�{�~:a��d��h�,-W
�b$�h���
��ED����3���=@\: A����D�ц��ҵ	�T�S�i�SKxk#�B��T��s�T�/>ˆ�7��a��`�#�TmR��C�5�Po�<���.�> L.Y�RE}�r
-�Ǿ��Ţ�R�
}��HM�����ً��Xp��`c��
/#H�ΉD���4�
��oΜ?%k�B��9���v�ື�z�����A��]+%:�i!0S
]�}�d
��
6g[���	@��EhؘzdP�0�9�>�A8��󇩘Ԭ�7<����1>�h� R�Ư
-
��a�����2,
��{ �]'��^�C\i+�r�9,傞�6ߒt���#@h
[��Gh���0�]$$
�&���WLH���A
u{� Hv��
jQ��ϥ]�__��!ຌ�
�����8,4�
-�S�'��k�]��=ǹ�b��Z�:�Z�ٚq��Js�i� H��w�~�E�N�����0�$������V
���)��]X���C�
�{U�r���nkme��I;.�4=h��4��Ҿx�5t[e�}@�g�[�$��w�,Wu�1�L�ʜP�Ө-ع!�$qx| $ tG
4�

�P貙9��C�
� ���~tE}{�e�m�J��
{)�UR�a���A��(�֓сú�l�G�
	M!���]R'����W���� �U�H�@as��Q�⏳��v�m��|�H�Y@�k��
g��eR;^nL�Duĭ��1AA at k����ĉ�0�
�so~�;���
�>���$� ����
-endstream
-endobj
-2270 0 obj <<
-/Type /Page
-/Contents 2271 0 R
-/Resources 2269 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2289 0 R
-/Annots [ 2213 0 R 2214 0 R 2215 0 R 2216 0 R 2217 0 R 2218 0 R 2244 0 R 2245 0 R 2246 0 R 2247 0 R 2248 0 R 2249 0 R 2250 0 R 2251 0 R 2252 0 R 2253 0 R 2278 0 R 2254 0 R 2255 0 R 2256 0 R 2257 0 R 2258 0 R 2259 0 R 2260 0 R 2261 0 R 2262 0 R 2263 0 R 2264 0 R 2265 0 R 2266 0 R 2267 0 R 2268 0 R ]
->> endobj
-2213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 697.086 274.593 707.99]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3) >>
->> endobj
-2214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.408 697.086 359.005 707.99]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.217 697.086 472.2 707.99]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-2216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.953 673.351 279.315 684.255]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a239ff7924a1294205e5057d1048986ac) >>
->> endobj
-2217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.978 673.351 364.575 684.255]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.693 673.351 513.996 684.255]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 604.903 267.409 615.807]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab69f3fd82a3be2e835c16d812f6ef39f) >>
->> endobj
-2245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.225 604.903 377.834 615.807]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 581.168 236.815 592.072]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_adeef8fc42bbbeee0f82d5da5ed6b9fb6) >>
->> endobj
-2247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.63 581.168 347.24 592.072]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 558.342 247.445 569.246]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a0fa81de47c40e47efad3842142159fe5) >>
->> endobj
-2249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.663 558.342 357.272 569.246]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.407 558.342 491.717 569.246]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.775 522.652 296.87 533.556]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a227bae7ca5019a2488065ba188acbc84) >>
->> endobj
-2252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.355 522.652 407.964 533.556]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.681 522.652 513.996 533.556]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 510.697 161.398 521.601]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 454.203 306.124 465.107]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a182da2aa2af850a82ea4b4ab3773a759) >>
->> endobj
-2255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.94 454.203 416.549 465.107]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 430.469 305.018 441.373]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab51c22e30fbf76be062c500f2187b0a9) >>
->> endobj
-2257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.834 430.469 389.431 441.373]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 373.975 247.485 384.879]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) >>
->> endobj
-2259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.3 373.975 357.909 384.879]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 350.241 250.802 361.145]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a4c043227bbacc5af1e44439c140f95fc) >>
->> endobj
-2261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.662 350.241 421.271 361.145]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 326.506 255.783 337.41]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aaa0eabf4e1c5b3bacdbadbc4fceeb6e7) >>
->> endobj
-2263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [309.123 326.506 415.732 337.41]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 302.772 261.87 313.675]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aee2f9e1a5347b0fd66ca5f9aec8009e1) >>
->> endobj
-2265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.686 302.772 372.295 313.675]
-/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
->> endobj
-2266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 279.037 256.331 289.941]
-/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_abe40c32264f8b51a8c0d259d0777afc3) >>
->> endobj
-2267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.147 279.037 340.744 289.941]
-/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
->> endobj
-2268 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2272 0 obj <<
-/D [2270 0 R /XYZ 89 770.89 null]
->> endobj
-2273 0 obj <<
-/D [2270 0 R /XYZ 90 711.811 null]
->> endobj
-2274 0 obj <<
-/D [2270 0 R /XYZ 90 688.077 null]
->> endobj
-2275 0 obj <<
-/D [2270 0 R /XYZ 90 619.439 null]
->> endobj
-2276 0 obj <<
-/D [2270 0 R /XYZ 90 573.067 null]
->> endobj
-2277 0 obj <<
-/D [2270 0 R /XYZ 90 537.377 null]
->> endobj
-2279 0 obj <<
-/D [2270 0 R /XYZ 90 468.74 null]
->> endobj
-2280 0 obj <<
-/D [2270 0 R /XYZ 90 445.194 null]
->> endobj
-2281 0 obj <<
-/D [2270 0 R /XYZ 90 388.512 null]
->> endobj
-2282 0 obj <<
-/D [2270 0 R /XYZ 90 366.661 null]
->> endobj
-2283 0 obj <<
-/D [2270 0 R /XYZ 90 341.231 null]
->> endobj
-2284 0 obj <<
-/D [2270 0 R /XYZ 90 317.497 null]
->> endobj
-2285 0 obj <<
-/D [2270 0 R /XYZ 90 293.762 null]
->> endobj
-2286 0 obj <<
-/D [2270 0 R /XYZ 90 254.949 null]
->> endobj
-2287 0 obj <<
-/D [2270 0 R /XYZ 90 180.945 null]
->> endobj
-2242 0 obj <<
-/D [2270 0 R /XYZ 90 158.569 null]
->> endobj
-2288 0 obj <<
-/D [2270 0 R /XYZ 90 158.569 null]
->> endobj
-2243 0 obj <<
-/D [2270 0 R /XYZ 236.688 77.486 null]
->> endobj
-2269 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2308 0 obj <<
-/Length 2662      
-/Filter /FlateDecode
->>
-stream
-xڵZYo��~�� ��HȨ�w��A�=<�7s8c
dv �-�H-Iyf�}�/�MQZ��TU��_U}�4�V��y�������Q�Ie4��
)� !��2�4�t�y�[�d�H"a�i�����Ż���;����qF�
G��H������g
-���#���3hq�๎���}��R0�B��[XL
#bW�`9�":���$/��*5�n���"B 

#�����(J�]��2��V<X���ՈNEP��It*�bFB�Ք�Iy3U�u��WO�B1
�	�S�Q��էKP�
QKJX|�4F	U��z��f#ZE2>�V��T��e�Ɋ:/�z_5�ƳS�f�#)ih�b��
��NgF)R8g��li��w,��?L!�|, �[�,4"c@$�q��I��M�����o_�H�1�U2���!:�!,�o�lL�v̤''
#NI$�1��h�@e
q+��e>L)���1��Q���}��bSL($	=Ŧ��H����i�nj��;
s�6�
-q{bA�������i�-?�m���Z0 ��h�$8�SZ.��`SI�Z<�U=�IH
-����D��@�!e��"�R1���E�̧d�FӤ]Ӽq�ͽ��MN0-�ʸ���1d0��;X�H0����@�_���338�
��)+�!��
-����)�0J ��t`'�,���O�E�&���By�g �;�p'�8��c��
�"�$%H
�#g�~Te}Pb::���G��H��3U�8��d�@���Dx4‹G��є�y�F /M��bM��B:߀G`lP���7�)���
&<�D!^ut��r�
�=�0� 
�X5%xR��t���� �ˤ���W����O��k����1��.���>m\S�� Ϫm���I�dB�҂P�xРJ�<�&cؑ
`�M,8Gz�PX:\n} �u�A 
,	�
\͂̋���_��@�T]��� �LM��0��P�P����=�c;���d�p�������3=�?�ٔ�gzӋf[wR
.}�;AA"A� v$%l���C=K��C�m���
J�k��O�#��P��	��9�i0E��/šC�
7�Fuڏ�Ժ�hW�h�pؐ�=��t��
[��Q��f���]Fw�r����0�t�ɂ r�q�z�!�P���t������qE�~vg�w��)�Foh�7t}��k�s�ٖ澬�����.ߑ� 2�m͋e�]�I��
��B0�� ��>t��q:�L�� �
��8��"o�t��f�yW��f�*͋l�8�1�]	��;#���НG��0��ewF�=�^עd̾si�;�RŁ�ҁ�G�q��N�_�1�.�u�~Ȭ�]-�
-]�kds䏺a Ds�WP�v�Hu�ǪV����&)�ê�6�]% �{�|	�,�
/�B	kw�(��]Ut�&�y�{�6��)� !�U��	�F��k��5F
-���a��Wo��~x�󛋷���O�׋��^_�t}	Mc{N��s�e��޴��"�$�mcQ6��N�
�#�:i�8}��[,�K��j�T��6�_�/�^���ױ]0xW�]
�˦����s-�M�I��X�����os�L�
	~:��xP.��
�@B�Y��/����� ��;]�XM_�/׿ʊ�J���r3��]�^�&%��Ԇ_g?�Ѿ�Yl�bo��)�O3�outhX�g�H	
'�?���P�a��qs����.%�g�����Eq^����sndIE��!���4Z%pox
�^;��eXdLN��bP)�P��r9v�Oc��4jE\%��&������Ҁ�����
�eUV��
��<�V�r��G��4Ɠo۬uL�
- at XG�������V_�.
{
D"͊����_��v�[:2
!�Ǒd����}�n�L����:�@^
�� ���S�����1p1H�1�Yb���uk�#�ơ�5[xW6�,iӆ��j�Ex<�d���)�yaG�F۬![�
v?������^

��*k�0��ۅ�Wֻ�
��"<5U2�D��fL�.� h����8���-�'aV�N�Wҫ��
O�(2��]���i���
-�mm� ��3JMNiG�0ɫ
xi;f��v'
Hi
�t	�������
����S卩r�9A�n)'�M�Ԁ�ԵEt7��`�I�0c ��-M�m�ا)�t���0��m����h��ζ�
<»�b�N�f��� =B��v}99�
���$��.��_E�
�!NG��� IW���U
b^G��!��g}�#e�w.��9�k�a���B

��
�� *x���b[��}�
s�-��c
�+�v��7�^v=���l��u�
���sF]Jr�^�Ͳ�5cX���X��D�����>NrrwO<�ח�v	b�tc��F:�TY�ytP=5
�y蒜�i�K�U�����:�	�a*��
!��C(�
3�4�I�'���އ�hD��h�
 �y�f���f��-о��sv����\!���(&&������M����/7,��a��țu�]��_�b{����+
|-�zc_~��7i�ڥ+�{�_��꯺uD�mZ�|A���^Uu��	½�VיG�] [...]
-endstream
-endobj
-2307 0 obj <<
-/Type /Page
-/Contents 2308 0 R
-/Resources 2306 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2289 0 R
-/Annots [ 2291 0 R 2292 0 R 2293 0 R 2314 0 R 2294 0 R 2295 0 R 2296 0 R 2297 0 R 2298 0 R 2299 0 R 2300 0 R 2305 0 R ]
->> endobj
-2291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [127.599 215.326 321.938 226.23]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_ad6ece2828d918bbd4cded63665b88e96) >>
->> endobj
-2292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.431 215.326 459.611 226.23]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 215.326 513.996 226.23]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 203.371 184.535 214.275]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.089 203.371 330.815 214.275]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 126.66 274.055 137.564]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_a9526c7cca61983debf9ced54bf89aa7f) >>
->> endobj
-2296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.87 126.66 411.05 137.564]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 100.497 277.372 111.401]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_ad4796bea8c483cdbd25979da0c81007a) >>
->> endobj
-2298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.232 100.497 474.412 111.401]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 74.333 282.354 85.237]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_a1eef951ad8a431e18a3e9d6a9e56594d) >>
->> endobj
-2300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.693 74.333 468.872 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2305 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2309 0 obj <<
-/D [2307 0 R /XYZ 89 770.89 null]
->> endobj
-2310 0 obj <<
-/D [2307 0 R /XYZ 90 721.073 null]
->> endobj
-2311 0 obj <<
-/D [2307 0 R /XYZ 90 646.048 null]
->> endobj
-2290 0 obj <<
-/D [2307 0 R /XYZ 184.963 532.79 null]
->> endobj
-2312 0 obj <<
-/D [2307 0 R /XYZ 90 526.15 null]
->> endobj
-459 0 obj <<
-/D [2307 0 R /XYZ 90 368.058 null]
->> endobj
-138 0 obj <<
-/D [2307 0 R /XYZ 90 361.132 null]
->> endobj
-2313 0 obj <<
-/D [2307 0 R /XYZ 90 261.859 null]
->> endobj
-2315 0 obj <<
-/D [2307 0 R /XYZ 90 141.869 null]
->> endobj
-2316 0 obj <<
-/D [2307 0 R /XYZ 90 117.589 null]
->> endobj
-2317 0 obj <<
-/D [2307 0 R /XYZ 90 89.731 null]
->> endobj
-2306 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R /F60 172 0 R /F83 262 0 R /F11 610 0 R /F24 169 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2331 0 obj <<
-/Length 2413      
-/Filter /FlateDecode
->>
-stream
-x��ZYo9~��h`F"�g�
,�n�g<ٌ��}H�#���J-��eg���>آ�#�ż�/��u�ꫢpr��䧓�_���I�h�S�&W�D�Dr�D
-O���D"J�3�1��v�������jJ�$����|�d��xr^6y���{��W�X�WD��NR6�|���۫��'V��
-$U�؜|���%��9��i���A��S�u����_�@�%
-J��p�(�JB!N��UQ6�Y�陦���#w�
��F�$J)m4['g�.�l��.f�7k�{[7��zJ��U0z�-���CK��XL��ܸǢv�j��$o�U�R�-���i��f����."%Ht2 k�V�g��f
S�y2�i!܌O��`R�q&�?@
�ژ��������ށ>l���ؖ�y�zQ��~�5s>a��j).�e�D�61r߼
��/�:�P>��q��&�n>a�ܨ@+
iE:γ
,��z���1*a4ʐ���x�{Kg���
��s�:/���mW/ ``K}��;1�X�A�P�!F��q�D4GJ���7����y��B~d���F�nD5CB�^tB��p.�E�j��d���RH��q��F���0:0�:�(�Ja[��kե,�ڤ�&o�bm�&U�T/�bg%?�(sĸv��
-O���r}
^�˅!�߯�>�����
�=��M���00�q
n|�l��%B�'�jkR�m��Co��fe2Q��!�P1���e���U��s���ql����)vd)hC)
��b`G��xVyi���������>��ÙW�7�v��tn
�`)cc;����04�L��p�[�� �J��Q�BA���/�
u@�@KKJ(�i;�T�S�"L%G\�ik�C�K$�~	Δ`$�H�֟F\asK�"J�
�EG\�Bm"�9�D�
c�m0
�*�� ������� 
-q�5!"[�m� �n3�
`�V S��� ܂�/��e�7��CA����
-���T+#A!L��6c���������e�qD*��!�픚�9M
�?����Y�W�EQ�Y5�m�
-��q�`	�$� &�E����k��p�2�d
Ҁ�Q���X����x�@(R�?!�"�}�wU4Ʒ�&�
r���W
P&�@2G̪��v��VP��ɥ�k���sn<
��T���q��I�&
�m�h�WE��]i 
��H���PH+�/�
-��>����K����5d��n�cȒ �Y����
k��~�($��+>�%6V<`QH7���]�^{ Z���0ն
��؄&�4����dUS�v��"[[v���=�jt$�� -4T�P�iҦ�)哖ܔ�I
�q��7��?��HQ��x�ـ�4|�V�#p��m�Z��P@��[VD
������lC7JS�!g
�v�
�b�5�
!��U	4����0�n}�-�g��%�)�����P�%��#YԎ�b7�eg� �vͱQc��>�������v��o�.8��Ɯ<���3�Z�i��a�eb�q
-��P at H6��1
?�e��C�������;]��@& ձP�30d>�F�ψ�<]���fzz|�Oy��x�9���"�'

¤O��V��=
�t�c%֐'��]z|1{y��������83}��￾}w6Sړ��հeW1�� ����I��ڭ�;�>+��v��B�E
-�uW471(
��J�C(
"�a{��)�ؒR,�j� �JK�6��E�VHH��Լ�!�/�z<=
��T������B���}�
z#�F���.r�"��:/�?�XU�MK"o��׮�dN@<��t���Ta�q[@�3<����&ϖ^ܛ��K�ԡ;π1xGc'[� �`LT p��؎4�XyP�`
-a̹��bv��#R$R�2\Sly��j���E���V/��z�D�����(%/•� :
�6�T�
�i
-�'m�p���
O
=�������u��v1�h�"�+YF�b�,�
�����	��Ї��FhI(tЍ�{	�D�)��
�{D#�p�(c�!��6�D����� |�mږ�M�tq�n[�U�E�q�o���dgtp���s�H���	9�{�=���Öꀪ��ΐp#W���xի#�g���˛��Ou��b
LJ^)l�'��.۵>��K�Xn���NӰ1�>A��R}�3r e��i����Z|~���I���>��(�GX�?�F��!��ꮨ-~>~K�!kZ�RM�W��E�gv�7~�w������=��0m��Ӝ���@A$�7�����].��z�]������:�~08���Y���}_�
#�U_���th
- O>�m^u��'i�~9���_2QQݝ�4�����/��:/��+���O�P���It�r7�6-%��X���}]��i��Vc���0����{����_��oX�f
�諱�B���
-endstream
-endobj
-2330 0 obj <<
-/Type /Page
-/Contents 2331 0 R
-/Resources 2329 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2289 0 R
-/Annots [ 2301 0 R 2302 0 R 2303 0 R 2304 0 R 2319 0 R 2320 0 R 2321 0 R 2341 0 R 2322 0 R 2323 0 R 2324 0 R 2343 0 R 2328 0 R ]
->> endobj
-2301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 696.002 288.441 706.906]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_af60a51929fc4969d04191e4f524f6031) >>
->> endobj
-2302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.256 696.002 425.436 706.906]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 670.099 282.901 681.003]
-/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_a6c514d39c645b2b47002b597d998f527) >>
->> endobj
-2304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.717 670.099 393.884 681.003]
-/A << /S /GoTo /D (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f) >>
->> endobj
-2319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 125.617 260.24 136.521]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a9fa4831093fbb97122699c344264e792) >>
->> endobj
-2320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.458 125.617 380.767 136.521]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.693 125.617 513.996 136.521]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 113.662 150.214 124.566]
-/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
->> endobj
-2322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 86.288 261.336 97.192]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a242792f5af528730b645b3831b4c6dab) >>
->> endobj
-2323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.554 86.288 381.863 97.192]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [422.789 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 150.214 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
->> endobj
-2328 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2332 0 obj <<
-/D [2330 0 R /XYZ 89 770.89 null]
->> endobj
-2333 0 obj <<
-/D [2330 0 R /XYZ 90 711.269 null]
->> endobj
-2334 0 obj <<
-/D [2330 0 R /XYZ 90 685.366 null]
->> endobj
-2335 0 obj <<
-/D [2330 0 R /XYZ 90 643.897 null]
->> endobj
-2336 0 obj <<
-/D [2330 0 R /XYZ 90 569.405 null]
->> endobj
-2318 0 obj <<
-/D [2330 0 R /XYZ 90 547.029 null]
->> endobj
-2337 0 obj <<
-/D [2330 0 R /XYZ 90 547.029 null]
->> endobj
-2338 0 obj <<
-/D [2330 0 R /XYZ 90 446.903 null]
->> endobj
-460 0 obj <<
-/D [2330 0 R /XYZ 90 276.472 null]
->> endobj
-142 0 obj <<
-/D [2330 0 R /XYZ 90 269.063 null]
->> endobj
-2339 0 obj <<
-/D [2330 0 R /XYZ 90 170.845 null]
->> endobj
-2340 0 obj <<
-/D [2330 0 R /XYZ 90 142.666 null]
->> endobj
-2342 0 obj <<
-/D [2330 0 R /XYZ 90 103.287 null]
->> endobj
-2329 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2371 0 obj <<
-/Length 2340      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�F~ׯ@�%d�9�3 �OY�J)��ZK�<�)DI$�a �����s�(�6�͖�`0����cz��������y{v~`/B��»]y�?B\���{?���۟=&BD"�ы�on_���Q��^ݞ}<#�
-{�|�Qz������[���
F,
-�=)�|���n��}�-+ëf-d^�	_�Fh�p�� B
��I-��r<�s���eD;�0�"rl/���ץ�ff�:�H4��i�.�"��<3OY����jd��"J}G�:t��
-�]���
;'[�l.9pZ>$�����x~)���QF�ܛ���?P�{_y�g
�|Ym��Q˵��;=�DxR������v�����F�kY�yV�e
�!e����^Қ�&0B�
#��b?��݋���Fv�| �
@q���ͧ���`��K�m�O�'�Ά0f��=��(
-��S,*���{��1�X \�`�#�
t��
	k�i@�����VZr����q������26֣��������ؑrʂ��
H?�R�N����3�Y��O����������/Cbj�	qnuy(x(E§=���̔����
\��J��^�'�]N}<Y�`�ͬǢ
�a� ;q�����n��*/S�T�M������a�6�*�pL���QIj;���V�2�a��Z,%�}\&1����A1�u$���a�@ԩ���M�-d��
�2��Ԋ��U�6�V�x� \�z��h8�w����,����ͯ�\��N]��R<�i���lm�ؕ`xY}&W �"�[�	�%Wd��N��|5��:Q�]$��o�3�	 Je��ɂ�dQ*�S���H��D�
�&x�_�'�����$a���
���]-��k׽���w2[�=4��!!x6�O�C"�x(��r�������;&�_kە�z�k��e�a
-�X�u^��k��h���[��XU�Z�P�A;�ep'���eQ���j�ys�$Т�:��|�]���!�~�,m��psg�i�e&�v���3p�
u�Cq�
h(��9����AJ;�e�����
C0��<��HH����¿��0��}JeJ>�+��A�W5�+�}E����]Z��VʐzDy�����=DMx���z�zR
ң��
q�`�%BT��/{<D�Ji��k�� a	B�% �кʊ]}�vW�����.[���z����(����;�$�%�|�*�`���Q�
�d���u�z�� �B4��=�Oc�Qؐ�U��wc^�(�������2
8Nc�Ց���z�ʈ�+]��hvL�Z�o���s�<h������ЯMװ{��jn��� Â�v�0�b�#&����b�x
2
1
v!�6�uS�A#0ϊ�ص
��|1���Z�����N���}T�t�$G�a�,T
-��
��|��
G�>�G�lᨧ� �pz��H��,�gi���"I��]Z|��cm�'$2������x0i
�2�K�5Ym��:难0����2;����K��
��l�������H�&�	�>,m�x�eX:
�@%`�gĐ (�z
�B�Che���)�}�ˀ�(WP��ob
-��@�(X����?��0�R�q�����T-ʤВ?S
�}�|�i���x�ՠ]�jJ�~_v-3YB��&���n�MwV���
�1+���>b�a�X�\����
g:H�|�R�(v
9�;��z�c�=U����7�܂��"z
��gO���م���^�]�g+�&���`��:h����A]��!?k����څn�}W'�gc������Õ�C󍌗��A9h���- at mabV`
�oL-~���x��#آ����XO��3��$ޜ�� >���-
-��F��)�U�T�
Y>P
v��aY;�姄L
T��LF�P�O��$lP���c�bdM�
O���Uc�o�̟6r�;!6V���-%%'�=
-Q�E���y�.�
	q�u���]{ldi�&��O��c��t
O���$�+
aLt��wr�d��PO�������҇QA���y�2��P�V����sn@�d�nt��z��ǭ^���x=s��d�h

1w,����xP�k�|U��&�]��t~�P5�PM��/Sٞd5jFO�V����v���M�NS���U��I�M��IV�q��p�{KI%T��
�K�·~�x���
�I����׹�/�7v��*e��
���f at o��6(
- 5��(�
�zvN?g__�67��:�ֻx-��
��_+Y~�2�E��l����U�@6Z�����=
���
�6���,I�|�C�t%Ȧ�����vk(��ha��>ۏ���h�[�i^6'���
��hh��x��
-endstream
-endobj
-2370 0 obj <<
-/Type /Page
-/Contents 2371 0 R
-/Resources 2369 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2289 0 R
-/Annots [ 2325 0 R 2326 0 R 2327 0 R 2374 0 R 2344 0 R 2345 0 R 2346 0 R 2347 0 R 2348 0 R 2377 0 R 2349 0 R 2350 0 R 2351 0 R 2379 0 R 2352 0 R 2353 0 R 2354 0 R 2381 0 R 2355 0 R 2356 0 R 2357 0 R 2358 0 R 2359 0 R 2360 0 R 2361 0 R 2362 0 R 2363 0 R 2364 0 R 2365 0 R 2368 0 R ]
->> endobj
-2325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 695.23 275.174 706.133]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a97dd1858b35adebeeb6f0d2edeecb693) >>
->> endobj
-2326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.392 695.23 395.701 706.133]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.752 695.23 513.996 706.133]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 683.274 157.975 694.178]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 655.827 229.835 666.731]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a0095864fde9ce398bbcdc67fd7d7f795) >>
->> endobj
-2345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.65 655.827 350.96 666.731]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 617.42 300.628 628.324]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a53680b4913fbc0c8bbf3a3f4097f672d) >>
->> endobj
-2347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.846 617.42 421.155 628.324]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.206 617.42 513.996 628.324]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 605.465 138.04 616.369]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 578.018 236.839 588.921]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a8fd26a28b5329cecc22ad0a6958a9ea8) >>
->> endobj
-2350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.056 578.018 357.366 588.921]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.416 578.018 513.996 588.921]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-2379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 566.062 183.419 576.966]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-2352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.324 527.656 229.237 538.56]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a4a89db919ecd790e62027d3559d8d539) >>
->> endobj
-2353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.455 527.656 349.764 538.56]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.815 527.656 513.996 538.56]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-2381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 515.701 183.419 526.605]
-/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
->> endobj
-2355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 442.308 258.185 453.212]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_ad9ec458d7b2f78d11393475db3e4cfe3) >>
->> endobj
-2356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262 442.308 379.309 453.212]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 417.301 261.502 428.205]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a331092da872154b17ae2e8d675b88145) >>
->> endobj
-2358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.362 417.301 442.671 428.205]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 392.293 266.483 403.197]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a83a66e20c2502b8a2cf7f8a4b9925769) >>
->> endobj
-2360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.823 392.293 437.132 403.197]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 367.286 272.57 378.19]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a74f00bca9deb1df435f5f32e16be9849) >>
->> endobj
-2362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.386 367.286 393.695 378.19]
-/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
->> endobj
-2363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 342.279 267.031 353.183]
-/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a5c88187145d242b27660f9247fe83ded) >>
->> endobj
-2364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.847 342.279 362.144 353.183]
-/A << /S /GoTo /D (group__Datatypes_gaf4f8f4bacd6f148fbbfb9209fb5b2b33) >>
->> endobj
-2365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.557 155.374 500.327 166.278]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-2368 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2372 0 obj <<
-/D [2370 0 R /XYZ 89 770.89 null]
->> endobj
-2373 0 obj <<
-/D [2370 0 R /XYZ 90 712.265 null]
->> endobj
-2375 0 obj <<
-/D [2370 0 R /XYZ 90 672.863 null]
->> endobj
-2376 0 obj <<
-/D [2370 0 R /XYZ 90 634.456 null]
->> endobj
-2378 0 obj <<
-/D [2370 0 R /XYZ 90 595.053 null]
->> endobj
-2380 0 obj <<
-/D [2370 0 R /XYZ 90 545.145 null]
->> endobj
-2382 0 obj <<
-/D [2370 0 R /XYZ 90 457.163 null]
->> endobj
-2383 0 obj <<
-/D [2370 0 R /XYZ 90 434.039 null]
->> endobj
-2384 0 obj <<
-/D [2370 0 R /XYZ 90 407.337 null]
->> endobj
-2385 0 obj <<
-/D [2370 0 R /XYZ 90 382.329 null]
->> endobj
-2386 0 obj <<
-/D [2370 0 R /XYZ 90 357.322 null]
->> endobj
-2387 0 obj <<
-/D [2370 0 R /XYZ 90 316.95 null]
->> endobj
-461 0 obj <<
-/D [2370 0 R /XYZ 90 207.631 null]
->> endobj
-146 0 obj <<
-/D [2370 0 R /XYZ 90 200.337 null]
->> endobj
-2388 0 obj <<
-/D [2370 0 R /XYZ 90 119.71 null]
->> endobj
-2369 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F82 260 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2414 0 obj <<
-/Length 2384      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�H~����e����W��O3�d+s��f����
$3�@��~O߀FHQlMvj�U4�}.��+�`
����__\��p �
i\����K$B�K���Q:_��l�-n��)�Uy�6Yko���Z
\١��.K�9�gUy��ʦ��۬Nڪ�i��|A��)ah�,3s�.[ezIV�!���b���Nj�/>^`�0(P����8Ha�� #&��^O��2�-�_/�y���x(s8�����""b���RC�-
�/(D�Ê�zm�z�'i�Tfs*f�7o;MUz�Ӓ�Оv�Ն�a��4��Y2
�A#
����B1�N����5�=Ea
��!���=R&G2&n�6o�}�m�o
3`I�!W�!F1�
ETH���]^��Hb~@�d47���k%�z����.)Ssq_�S�;xXX쵕��Nq�)��E��i���8���p��j&yb�&�
4R����(B�F4���@�Y����܇��0��t�$b�b���|qX�S-�a�T
1$��#[; ��`{<�RG �g
eYm�U��@/��ͩ�q��)v��sM����}ޔ����b`AϷ$�'��1Zo��Z��&0v��
��Aw��3��ms
�?Q��Nw�CP[��]����p��8�@�L����{;ۘ
f䛭?/����n�,��d9V'[¤���9M�qg2���4o~ߕ˶9b��W��Ś2�"qbTa!C��3�'�ᑁ�Q���Y������
-�k����6qs;�g.(��������?<�<FP/��4�4,Ҭ��������k��S0�,?��T��SR�iҥ
lr��1A�?ż}9u�pI:?���v�M�*;
�fgr��eUۜc[�i��Xe-�&�yQXX+C����.)����Y�d):�0��^"��� ���+[��5/����K3��ثl06*n~�|�e�z.)H�
��a��UH�bq�J�˝e��J|�%�TY
1��	�qB�p�
�:�R�r�d�E�tzr�������=�nW��T��7Ih���N�¸KNT1���~P�*
:�f�+�
\|��*
�H�]]�N�
�@|b� �*���b�9v��h9��1�=�`�h
���J�pɌ�m�,���$�O�`gM����KO��4��x����և�q|D����,e%y��< >�WxR*��g:�
EGc_
[�Q�L �v͗�$��F��xO(�TNp�X�W��
6|8ZgOh�u
�x���o�vW���:��m5X�)3w�����+�Y�25��a��)�^6URH09��0a
P
��bR�S���"<��7q��bK��o��†w�
[A�3P�՜�F7O���q��):��� w��A8
-uZ�G
Z�P�U\GB���"��֫�M�"S�4��Y���ͫ��(G�[ή� ��k���|�<le�W��6�[G����W����9��M�o�t
-�3���6���u���

����Z}�Pڛ�V)V��r�|}��r����
��sSi���Ɛ�b�
-����{C��cٽ9�o
-=ቈP̨ފ`�@�u�D'�K q
�!F��9!���$
 "�
\PFQ���j�$����,$�^"P�L^(���f1����#D�y���$�,;>z{��2�,
-gD �G��5�|#QA�B����e]���׮��W%�ևA}#�惏��2��8�|��6�ECˉ���
ڒ~�-$�$����HZ��G,�������ǵ�g�����X���'�
����6����D\и�
p��f�
�c��u��$�8��8�%е<^��#$
���U
�/�H�g`NNX5�T�����PR��vۡ�$O ��K�_��
-���b�!�-?H~�F8�U�/mLQL�c��P�v&�ۧ@�iM�.MvP��
�nͰ%E� }0S��߳e�r��Ɏb�.Z��
�-��F9��5�
S="�H�C��
-C�26�$��"7�g��6��8���B9����J�q��H��bB�����G"*;e7wծH'� �w#e5i-�DG�63��
���k�x=�(q3^�ƵnZ�[ӴV�]jۜ�~s��w�w��95���:��G%���A�H(�j7"���2X/��߾�����{�>��w��:+�O�\:]W����(
k
��wi���[�i8��ϣ$>^�_�x|��z�?F
��?Fs����#��
�Y!�߾��\\����r�K����9Ow�j��۹3��_��1��-���H�*���0���̵�p��
m*=���r����m�///ow�&+�h	Ǵ���Q�p�"������7:ȥ7N��3u���I��d����~�ځ�7��� ���
�+
-endstream
-endobj
-2413 0 obj <<
-/Type /Page
-/Contents 2414 0 R
-/Resources 2412 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2289 0 R
-/Annots [ 2366 0 R 2367 0 R 2417 0 R 2389 0 R 2390 0 R 2419 0 R 2391 0 R 2420 0 R 2392 0 R 2393 0 R 2422 0 R 2394 0 R 2395 0 R 2396 0 R 2424 0 R 2397 0 R 2398 0 R 2399 0 R 2426 0 R 2400 0 R 2401 0 R 2427 0 R 2402 0 R 2403 0 R 2404 0 R 2429 0 R 2405 0 R 2406 0 R 2431 0 R 2407 0 R 2408 0 R 2433 0 R 2409 0 R 2434 0 R 2410 0 R 2411 0 R ]
->> endobj
-2366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 707.957 374.218 718.861]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_abcb586fdbb2eb01ec10c0eb941f4b7f1) >>
->> endobj
-2367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.436 707.957 513.996 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.002 194.603 706.906]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 673.476 458.332 684.379]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a0746b37f80c4be687b0dc5ded6190002) >>
->> endobj
-2390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [461.549 673.476 513.996 684.379]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 661.52 298.403 672.424]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.308 661.52 513.996 672.424]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 649.565 168.591 660.469]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.278 627.039 381.627 637.943]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a8d39b1769491b0ee262118bfa31bcc67) >>
->> endobj
-2393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.615 627.039 513.996 637.943]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 615.084 192.402 625.988]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.738 615.084 429.869 625.988]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.757 592.557 374.504 603.461]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_add8c6ae913a7e3f0a7e1470a23ba04a3) >>
->> endobj
-2396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.97 592.557 513.996 603.461]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 580.602 185.757 591.506]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.093 580.602 423.224 591.506]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.377 558.076 382.529 568.98]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_adb6f375b8aad58a31f6a60abb7a9b1e2) >>
->> endobj
-2399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.615 558.076 513.996 568.98]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 546.121 252.167 557.025]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 492.95 404.325 503.854]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_ad69ffccc04d33132e31a91296afad78d) >>
->> endobj
-2401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.543 492.95 513.996 503.854]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 480.995 257.148 491.899]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.167 480.995 367.573 491.899]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.545 458.773 397.746 469.676]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a70541b12c8a9b281b3aa4f9c21624b3c) >>
->> endobj
-2404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [401.001 458.773 513.996 469.676]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 446.817 240.541 457.721]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.209 424.291 401.064 435.195]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_abc4dd4b94a80075012b0f30b13339632) >>
->> endobj
-2406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [405.983 424.291 513.996 435.195]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 412.336 245.522 423.24]
-/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
->> endobj
-2407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 389.809 398.267 400.713]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a62836b9156289bd880bf9f32056a4dee) >>
->> endobj
-2408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [401.485 389.809 513.996 400.713]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 377.854 257.148 388.758]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.287 377.854 513.996 388.758]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 365.899 134.838 376.803]
-/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
->> endobj
-2410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [327.557 288.737 500.327 299.641]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-2411 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2415 0 obj <<
-/D [2413 0 R /XYZ 89 770.89 null]
->> endobj
-2416 0 obj <<
-/D [2413 0 R /XYZ 90 721.073 null]
->> endobj
-2418 0 obj <<
-/D [2413 0 R /XYZ 90 688.351 null]
->> endobj
-2421 0 obj <<
-/D [2413 0 R /XYZ 90 641.462 null]
->> endobj
-2423 0 obj <<
-/D [2413 0 R /XYZ 90 606.98 null]
->> endobj
-2425 0 obj <<
-/D [2413 0 R /XYZ 90 572.499 null]
->> endobj
-2428 0 obj <<
-/D [2413 0 R /XYZ 90 473.196 null]
->> endobj
-2430 0 obj <<
-/D [2413 0 R /XYZ 90 438.714 null]
->> endobj
-2432 0 obj <<
-/D [2413 0 R /XYZ 90 404.232 null]
->> endobj
-2435 0 obj <<
-/D [2413 0 R /XYZ 90 332.03 null]
->> endobj
-2436 0 obj <<
-/D [2413 0 R /XYZ 90 275.923 null]
->> endobj
-2437 0 obj <<
-/D [2413 0 R /XYZ 90 253.631 null]
->> endobj
-2438 0 obj <<
-/D [2413 0 R /XYZ 90 253.631 null]
->> endobj
-463 0 obj <<
-/D [2413 0 R /XYZ 90 72.893 null]
->> endobj
-2412 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2467 0 obj <<
-/Length 2175      
-/Filter /FlateDecode
->>
-stream
-x��Z[s��~���%䌸��%}J$;�$u][}r<*L��	в��{�� !
-�hM����b/�����h����OW��
-GIet��
�7HHx�G��RN>\�1�1�֋���z����6zq5�4"�	GďH�h�
����94�aČ�n]�u�)��U�n���`D�}��0M#B��V��+!��(�L	�x�٬	!L".�ð9FCB�����	�s�Z�̈́�q�fe��=�+��`�Y]S$��Y}B��6�ڿ^*(��s*(5HkѢ�gI��ԧY�D���{e9��I����YF JNĹ�Hc٢#-�m\��Õc sy��`Xk�Z��'j��L)��W���g�}�,�[�M2h��U�u�R����r?/< ƍ��j���n�0���8����.��i���0�
��l�_A
I��<-�e��q�"�(���.����<�޻�`��o�Y�Ä
-�p�r�+��<�.�e�C����qm�є$%�
�MVq�̽�^�l
�
�"~��X��y�T��e-�"4������:YL�
�"���nh�g�QVq 2ظ�	����t�'~��e��Ƕ���ˤ�~�W���J�Ô��ا
0��~�2ŜV��)s�v[ֵ�S�	����g�b�F
<��ۛg�^��숆�=�p���U0�
cf{w�Ǒ�>��<�b0E
�$w��8��1�H�n�O�t5�,3 *���ֿ��n�-��w~�����7�qU7�
:t����_8�����G&�$���Aߩ�
����:�8Lm�o���OA
�_����6_ߏ?.���
V?
G�G0AB�G��a�;���Q�*�2�S�
ƺ��A��XW�b}�o��0r�E	�^լ�� �J���0�H��a�v�D���
�� fp|����y�e�uW��}[_�
�Mqv��8�7�p]��}�X�ʘ F�(a�S��]�$��Cm�wU�޷|���B&�]�u*J��*1kҵE�O�|ڹı��0���u���>�v�0���F��G�!���'Azj=��?�F�&.�v�ʡ��P{a�N�jF�^|���2yJ:=̅�	
�T4>
��2��>C�3��X^�?D�C�jH�ե�}څGR'��Mf_�L�.�;�
t���ې$l�l^��Ж�A�j��t�
-X����d�.^��j��7x��E2GC�ũ�`��`�A����8Y��l�Յ��7�����^�k�/>�i輚
-̹M�g�,�&��'[����i��~����Z:�ŐA�!�B��3xbl*+�U2I�Y�.�f�~h�� �Tc�}F��ujo�ڔ�� �B_�^d��ݪ�����{�FBֹ���f��
��;�����yf[H�ؽQ?{n�mC���ϲ�
;� ������W��>9)�K��
)�p;�	���Aij���JH�v
)ƞ��-�(���1���% O�'��
�אc
��'�_���[}X|�������v1��mr���ω�|���L(��2�t�?: �^��t
3��nX_�F)A�՘�҃z�TS��ټo�K"-�ݷ�$U�l�r���dʹ����{�3~�\����"��4�qt!m�s�r�	��6 3��R�Q3"��2)�tU�]&�l�n
:K���Gm|O�4���6�����1�W��=�qA��lg=w| �6
]9�Ukե�|Q�
�!�rB�ݼ8rnK!S6�{���K�f�r�}�� �X�0�Oi��_�i�2{:�A��D��0�N� ��C������R.eNA��y�n�q� 1�\���2J6
�]��\pȯ�tg�@���欨��6}
��W
E��:�Ү��B�qM� x=>�ET�h�~
-v�C'�`�9x���Z,��97�Z՘�B�E	/����eb�w��s ��k;���3���}8�YVaL�
뺤�6.����:L`e�� ��$���2�.�[�Z?CHW�-Z2��@;)�^7��[Q6���@��?A
�D�#D��=��՘�p�j͢�
&k���|�fBg���6���2��Zԧ�<߼��?\����l���I�'go�X㊫���������g�G�gk⟭�K�/�-N�N0ϻ������Q�����j�nM5���MYn~8?��[I�D�|}�f0�����әu^݊I3h\��~��� ֟Ns
-endstream
-endobj
-2466 0 obj <<
-/Type /Page
-/Contents 2467 0 R
-/Resources 2465 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2289 0 R
-/Annots [ 2439 0 R 2440 0 R 2441 0 R 2471 0 R 2442 0 R 2443 0 R 2473 0 R 2444 0 R 2445 0 R 2446 0 R 2475 0 R 2447 0 R 2448 0 R 2449 0 R 2450 0 R 2451 0 R 2452 0 R 2478 0 R 2453 0 R 2454 0 R 2479 0 R 2455 0 R 2456 0 R 2457 0 R 2481 0 R 2458 0 R 2459 0 R 2483 0 R 2460 0 R 2461 0 R 2485 0 R 2462 0 R 2463 0 R 2464 0 R ]
->> endobj
-2439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.035 683.608 476.806 694.512]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-2440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.328 584.215 350.026 595.119]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a7e3f8c5b2e614c5d18783c2ef7b092e1) >>
->> endobj
-2441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.064 584.215 513.996 595.119]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2471 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 572.259 168.591 583.163]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.059 548.718 407.858 559.621]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a98e7f050a579e9deeb71a75758238928) >>
->> endobj
-2443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.628 548.718 513.996 559.621]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 536.762 226.155 547.666]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.136 536.762 470.267 547.666]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 513.22 353.845 524.124]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) >>
->> endobj
-2446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.063 513.22 513.996 524.124]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 501.265 134.838 512.169]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.174 501.265 346.293 512.169]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.093 477.723 346.828 488.627]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_aa82f0fc73b5f98fab74070ee92a100cf) >>
->> endobj
-2449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [350.63 477.723 513.996 488.627]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.933 465.768 336.051 476.672]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 442.226 355.648 453.13]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_aacb1e10c50be6e9dd36e3aed93c7a222) >>
->> endobj
-2452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.865 442.226 513.996 453.13]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 430.645 168.591 441.175]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 374.307 378.312 385.211]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a1785059acd1bf60dcf4cda0044cc94b5) >>
->> endobj
-2454 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.53 374.307 513.996 385.211]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 362.352 219.51 373.256]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2455 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.528 362.352 329.935 373.256]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2456 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 339.622 371.697 350.526]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a64b1a8e66388915a57bfd0b53a2e46c5) >>
->> endobj
-2457 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.915 339.622 513.996 350.526]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 328.041 168.591 338.571]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2458 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 304.125 373.351 315.029]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a35180fb6d38a29d74f5992815fbdf006) >>
->> endobj
-2459 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.569 304.125 513.996 315.029]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 292.543 168.591 303.074]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2460 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.757 268.628 374.504 279.532]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_abe46bba93c5ddcf4cf4cafdb0d74f942) >>
->> endobj
-2461 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.97 268.628 513.996 279.532]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 256.673 219.51 267.577]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2462 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.971 256.673 453.101 267.577]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2463 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.035 178.52 476.806 189.424]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
->> endobj
-2464 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2468 0 obj <<
-/D [2466 0 R /XYZ 89 770.89 null]
->> endobj
-150 0 obj <<
-/D [2466 0 R /XYZ 90 721.073 null]
->> endobj
-2469 0 obj <<
-/D [2466 0 R /XYZ 90 648.273 null]
->> endobj
-2470 0 obj <<
-/D [2466 0 R /XYZ 90 598.992 null]
->> endobj
-2472 0 obj <<
-/D [2466 0 R /XYZ 90 563.847 null]
->> endobj
-2474 0 obj <<
-/D [2466 0 R /XYZ 90 527.897 null]
->> endobj
-2476 0 obj <<
-/D [2466 0 R /XYZ 90 492.4 null]
->> endobj
-2477 0 obj <<
-/D [2466 0 R /XYZ 90 456.903 null]
->> endobj
-2480 0 obj <<
-/D [2466 0 R /XYZ 90 354.299 null]
->> endobj
-2482 0 obj <<
-/D [2466 0 R /XYZ 90 318.802 null]
->> endobj
-2484 0 obj <<
-/D [2466 0 R /XYZ 90 283.305 null]
->> endobj
-2486 0 obj <<
-/D [2466 0 R /XYZ 90 221.813 null]
->> endobj
-2487 0 obj <<
-/D [2466 0 R /XYZ 90 165.478 null]
->> endobj
-2488 0 obj <<
-/D [2466 0 R /XYZ 90 143.101 null]
->> endobj
-2489 0 obj <<
-/D [2466 0 R /XYZ 90 143.101 null]
->> endobj
-2465 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F97 497 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2516 0 obj <<
-/Length 2416      
-/Filter /FlateDecode
->>
-stream
-x��ZK��6�ϯ�m�����]'��ûg�r�SS
#1K�2IY#��4^)Q�
OR�IDw�u
� ������իɘ���} q�D����m� M�c
�V������˶Q�{�
nT�^��b�PY=!"���6�O����U�}:S��W��*u!��0N&��|�����
*�X�8JD0[^��4`Ĥ6��2�(�k�|��v�uWD���g��=��DGAB��5�?U��&�c]����EJ�
�pŌ�o��0!
�3�8l�z��c�L��r�8|��Gyk�
G���KcGL��IXV�tV�Mk�s�ݴ��I��Kh,�T�'&8/������U�.��5:]S{Y�eV(����+kA_=�cģ��gu9��FHH�{ey�ۺ��h2eB�7
0
�	�
�.�
� �y�f.�;5K׍��u������:��i��R�ekی
�]QT�Í}�����~�*��aLgi�W�m���dب�k����,��;̱Bstil�C��Y]�Vve�Ij� X�)��M�E^8���.PݹV�}�嵚��~�~c���돇��vө���v/*4D� E{�z �\BZ;� �Ӻ��~�(F���z"
�VOLĜ1����H��s����}t���͋��Zg)Ufe�e�f'��d�&��.��o�/��1�8u
}ﵖ֩��,�d�{�:�v���@��$�H9t)+�2.ӭ�XC,���O�<K!�A{��qp��U�*��u+:��D0UD��K���&���WdcCB(��j4�%��Nԝ��d��V/�y0>_la�#��1�Z�3�
7f!��~�FI��y�8Bq���w��	�'Zd��>��1�٭��	�K@ C���p�����5λ�} �Br����J�Z�|�1O��\�:���#��rO���G�NU

-�b�ŀ�(b���ba�}G)�z;�� ^��BY�`�
����'�1Q>�+�>a�ON	d��T�<*�.����S�DQ O��F�k
�
�� '��{��b&��OѮ�/�jP�䓨A5���rD&KP,�FdD��1�
m���\G�C=$G�<��R ��"m:IB

*�
���;�4p/XA
�C�F�罛���v�
V�M9H�
�
��a��c����K�@�
����
C�N[�!
��<��*\�_u��0��$�egE�v�4���1l��%)jy��	A��
��
#&	F����w5�7���Yϥ������4?=P)D
�D,y$fj>e��S�s��oL"]Y5���������'��ok���<Ӎ���<#���3$NM2(�`0���`��k(
$�8�!�5��}�i��>��>��Ab���e�d�~�jl��^
����eh}��Z��2-���)W�p0��P��Q
���ɭ'
�Q�.3�j�ɐĀ�� �[!���q�&�������z��1/�*ݺ��ѠjE	c~���!):Wh>��ښ���&�i�K
5����� �;���Q��y�zK?
�Y���]�$�=N;
Ib���
G�3y�\A at l�\WR[�^Ӝ��P�����KE
>\
�*�ψ�xXȌG���7�]�>����i�6��ve�."�:�z���}WCu����#u8xqJ ��C����+ef��'�<�D�B?�vD0�+I�nǴ�7!���Yo��d����`����!p ���_
0�/�'� ǸB���R R)� nds��aP����4�n���}9��3��+P�S��x���Ҭ�ܜ�,;Eo�|�m
�����8���{�G]�>�bD
�y�������yT�I��Ǯ������A͸����T����M�m��t�����G#����@Q"��>
�9<����n�p��z�
#�%����2E��wgx�|��m�&��=n8
-�H�d���5
�K��^

��Y�ޚ2n���޸C��$O
7����$����~�' ?���'���&��2��UйZ@(Ҧ�{X#�Ѽ�����������?�y݌ar4�vqg
���q����aJb��[�X�-ևY�Δ��0;"P���[����_���'�M}�~P��nC��!�yݝӚsoA�4X�>[۪ ʘ�H��R��s�7��5���74�w�Ɖ�FO����Ѱ<A�
��Eո֫
5����T�fo�&]����Z�(�����˭y��)<V�4�E�}�.�
z���I1�8���3�
M���H&@G��VQU��;&����
��ˏi9_�s���jp<��F��p��<^�eW���cݩ3A�r�`���w}k���Å�`��>Ϥ;V�h�Ջ�����Q�
�lB|�1�#���ز�����t
�CA?�
C`p3���#L���
�{�����[��
-b������
-endstream
-endobj
-2515 0 obj <<
-/Type /Page
-/Contents 2516 0 R
-/Resources 2514 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2535 0 R
-/Annots [ 2490 0 R 2491 0 R 2520 0 R 2492 0 R 2493 0 R 2494 0 R 2495 0 R 2496 0 R 2522 0 R 2497 0 R 2498 0 R 2499 0 R 2524 0 R 2500 0 R 2501 0 R 2526 0 R 2502 0 R 2503 0 R 2504 0 R 2528 0 R 2505 0 R 2506 0 R 2529 0 R 2507 0 R 2508 0 R 2531 0 R 2509 0 R 2510 0 R 2532 0 R 2511 0 R 2512 0 R 2534 0 R 2513 0 R ]
->> endobj
-2490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 396.587 355.997 407.491]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a26a124537b8995832b2cb157abc7cf07) >>
->> endobj
-2491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.215 396.587 513.996 407.491]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 384.632 134.838 395.536]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 362.116 313.596 373.02]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a0bf696420bbdc5c2ef0993f61f2273b7) >>
->> endobj
-2493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [316.814 362.116 506.192 373.02]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 327.944 524.463 338.848]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aeb8456ecf06307c108046a8c665154c9) >>
->> endobj
-2495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.412 315.988 317.79 326.892]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.052 315.988 513.996 326.892]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 304.033 134.838 314.937]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 281.517 524.214 292.421]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a024a52502b35029ff2ba102323d8ae5b) >>
->> endobj
-2498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.412 269.562 317.79 280.466]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [329.052 269.562 513.996 280.466]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 257.607 134.838 268.511]
-/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
->> endobj
-2500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.92 235.091 350.434 245.995]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a91f0ccf4325f53430d7347ca73182f52) >>
->> endobj
-2501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.064 235.091 513.996 245.995]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 223.135 134.838 234.039]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.174 223.135 248.581 234.039]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 200.619 352.898 211.523]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aae5f47efa7c023e45aed9be161dce99f) >>
->> endobj
-2504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [356.116 200.619 513.996 211.523]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 188.664 134.838 199.568]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.098 188.664 371.229 199.568]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.595 188.664 513.996 199.568]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 177.083 168.591 187.613]
-/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
->> endobj
-2507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 154.193 356.774 165.097]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a1b2ee4d834f0651a41647ac5b5e0f912) >>
->> endobj
-2508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [359.992 154.193 513.996 165.097]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 142.238 134.838 153.142]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.33 142.238 371.46 153.142]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.597 142.238 513.996 153.142]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 130.282 231.136 141.186]
-/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
->> endobj
-2511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 107.766 363.389 118.67]
-/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_ab595ea1166752d23aba600af43417bd8) >>
->> endobj
-2512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.607 107.766 513.996 118.67]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 95.811 134.838 106.715]
-/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
->> endobj
-2513 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2517 0 obj <<
-/D [2515 0 R /XYZ 89 770.89 null]
->> endobj
-462 0 obj <<
-/D [2515 0 R /XYZ 90 549.118 null]
->> endobj
-154 0 obj <<
-/D [2515 0 R /XYZ 90 539.893 null]
->> endobj
-2518 0 obj <<
-/D [2515 0 R /XYZ 90 458.851 null]
->> endobj
-2519 0 obj <<
-/D [2515 0 R /XYZ 90 411.561 null]
->> endobj
-2521 0 obj <<
-/D [2515 0 R /XYZ 90 342.364 null]
->> endobj
-2523 0 obj <<
-/D [2515 0 R /XYZ 90 295.938 null]
->> endobj
-2525 0 obj <<
-/D [2515 0 R /XYZ 90 249.511 null]
->> endobj
-2527 0 obj <<
-/D [2515 0 R /XYZ 90 215.04 null]
->> endobj
-2530 0 obj <<
-/D [2515 0 R /XYZ 90 168.613 null]
->> endobj
-2533 0 obj <<
-/D [2515 0 R /XYZ 90 122.187 null]
->> endobj
-2514 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F72 194 0 R /F83 262 0 R /F92 331 0 R /F24 169 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2555 0 obj <<
-/Length 2321      
-/Filter /FlateDecode
->>
-stream
-x��YKs����W��J
�������8��U*��
"�$l�pi�O�L^�9�r�	�WO?���d3��?_�}��y�IL����$��P�D0ZM>N�h�����"�� �������`֮�{�����0w^�0�,wW?��
-���P"�hr��v�<�ɇ��]Qd��̫y c0�a�q.	���t�N�I���l�y�jY��:-r˟���}Е�N�@Bq�q���^W at D�i������/
)�_�{��ڽ<i^W�^<3��G]��-k�����y�W%��V�~�˺"V��	
I �;N
e��t�#hfV�.I
+�I�f�p?��I^�ImTaW���:�5�7n.��[�J�M�8.�3���n�3��w3�d+�3�,ݹ�.v�.�x��F*Fb�R�6(���y�^�jz�3{�Vrm����;�w�i���M�'����	7?��j@}S��
-�e��)�o����k7p�޺�o���Ҹ��R�K]-{536ӫ���:�������E6c�L/�Z8���*�z��6ZK��ӵB]��$�ܱm2�t��Z�,�@|Z%;�\퓥��@�f�F��ҕU2�:�t���'F�<�&%�p|U@�&ON[
�e+ ��>fF
3�Vm��MF3�mQ!�U�<�&�Zs�̋QC��

.�t�K��*��`��\��`5ɪ���1�gT� g��K�怿�X:j�����`z���I	�8dI9���J�\�5��-2���(6""�ֱ��i����.ͽ޺H�H��B���! 
�q�vC��!r�@L
Ah�z�@��Lu��
��Z�Q��
z~��}
�����$������Ӝ������;��8����}�Y����(R��
33�����1%4V�=6��c��3no
�\p
���
N�
-�\܎\)"Xg�RB��ʝ�m22��>�g#
-HL/�F�(�Q�_f�Ȧ
�?s��A�����8�b	%�ۦ>����_�[��P��[Ԏ|
v��Y���
�cd����P@��<+
��nR ,網�O�6�`=�=$c��ಳ�ō���#�B�fO�eLBAX�Z2��Ez��ʵ�>��>�+HA�
�_�Jh���t��.Fn1��	�=�L)��A���{��
H�i>&
�q�n�ؕ.��rzڅ"C��"��BcGྨu�ƸYDB8K���
���ٵ����n3�Bd^��!_%9��X���+��-�]�;�.�X��@2�Q�0�4 at m1o;�H�	8m�
�|mbk3�ގp}�s������
R��Y
k?j��L�ӟ�S)��D2�3窿��\Qӿ��"+(�_�����Y��N�l�¤:�K
R!4��#�,,��:
0	�QJK����ºɅL.�Hl���3R'3�k
��Y�:�ۂf
kP��K}
1�#|�N��.{��
-6i&rS�bCc
-G
3߼��Zo���^�ć
S
(XR7"V8��~.�t
�m��q}q��b����$�򰄒|h�7U�nr�p
&T�%��9�!I�.b*·��`ݴq�r�^��� ���En{����ba0fa{Ņm�a%�|i2z�%�!Z��iA)��:M�=�!�G�-y��g�
�e���z�9����m�韆��n0��n_?��L�P�@v��<��if��Pُ�uD3i���و�g�
-P���-�v��W�
-˗.#!�d�[�@���
�
-^��U۟�{]�gZ�
�\�"40��Q��y�j�'��-(L�)���ȑ@4ԬF�A3"�
w��W����Z;�]D� �AS[��3k�z̮_�^3��w̞
�6?��q���R|��
��c
-h�\�o
�~�d�
�<�lz3��a�br6� |���Pu���߂�D���>�țӗ�
qE�+0��C8��ƪa�#I�/e}$��8��^3dd�/c�0:q6��o6`s��b��ފ�0��
aA�AKI�Dⷎz#���EXv5��K��n�z'Ƅ�"5�3
-<spf
ُ��G�7+�h�aD��hY
�z
η�g��J
�}�J./��1�0`�b$T��{]/E�0���
:z�?����A|_7�l�-O���\�z������M+M��
�aJr���ղ:����݀�������
�����o�R��.v��?�7w;1yW ���
��[���%$����9����<<��kmH��!�������W�����gt�&�!���E�N�|�a���@������F��\�/k
��j�q��ۺ�ss�t�T:� ���i�!�A�:M{�+|Ǜ�0����������
-endstream
-endobj
-2554 0 obj <<
-/Type /Page
-/Contents 2555 0 R
-/Resources 2553 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2535 0 R
-/Annots [ 2537 0 R 2538 0 R 2539 0 R 2562 0 R 2540 0 R 2541 0 R 2542 0 R 2564 0 R 2543 0 R 2544 0 R 2545 0 R 2565 0 R 2546 0 R 2547 0 R 2548 0 R 2566 0 R 2552 0 R ]
->> endobj
-2537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.801 231.929 336.353 242.833]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ada9021952b7c7ad4ca6fc4ff082ec9fe) >>
->> endobj
-2538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.864 231.929 415.258 242.833]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.478 231.929 513.996 242.833]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2562 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 219.974 144.243 230.877]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 182.718 323.001 193.622]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abedffb6a2f5b2473d2d2ac9d448c65d9) >>
->> endobj
-2541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.219 182.718 399.613 193.622]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.942 182.718 513.996 193.622]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 170.763 134.838 181.666]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 133.507 395.359 144.411]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) >>
->> endobj
-2544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.577 133.507 471.971 144.411]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.3 133.507 513.996 144.411]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 121.552 211.769 132.456]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 86.288 341.272 97.192]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad6512d0d60c017982bd8031e9b8df336) >>
->> endobj
-2547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.49 86.288 417.884 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.213 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 169.159 85.237]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2552 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2556 0 obj <<
-/D [2554 0 R /XYZ 89 770.89 null]
->> endobj
-2557 0 obj <<
-/D [2554 0 R /XYZ 90 721.073 null]
->> endobj
-2558 0 obj <<
-/D [2554 0 R /XYZ 90 573.946 null]
->> endobj
-2536 0 obj <<
-/D [2554 0 R /XYZ 90 551.476 null]
->> endobj
-2559 0 obj <<
-/D [2554 0 R /XYZ 90 551.476 null]
->> endobj
-464 0 obj <<
-/D [2554 0 R /XYZ 90 391.636 null]
->> endobj
-158 0 obj <<
-/D [2554 0 R /XYZ 90 384.543 null]
->> endobj
-2560 0 obj <<
-/D [2554 0 R /XYZ 90 301.498 null]
->> endobj
-2561 0 obj <<
-/D [2554 0 R /XYZ 90 247.204 null]
->> endobj
-2563 0 obj <<
-/D [2554 0 R /XYZ 90 198.182 null]
->> endobj
-2553 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F60 172 0 R /F97 497 0 R /F24 169 0 R /F72 194 0 R /F83 262 0 R /F92 331 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2605 0 obj <<
-/Length 2124      
-/Filter /FlateDecode
->>
-stream
-x��ZKs�6��W�R�Ƌ�{�xw�&�d'�4�r1%�V���8ί�n $��-�-+IeJ� t7���@�FˈF�
��]�Q42�$<��������	<ͣcEx<�2J�x�[]��p:ޮ�o��~��x��.��d�c:~�)��"�e��l��>��61)�qb&?]}=����h�ܔ1Q:��G~��
���(FGw��:�\@��ޏ�Q/}���hi�&��
��p�*�cN�׷�j^�@I<N]��&,
��
_��]���AK׶pOk�T�d��}Qf�q�p�l�)�=�曲@�/�
��)Z
�`Ś�>m�aBT]���
~���,TA�o��*�bn�-	kW���l?j��e6�I�)�P##Xhbb��Y 5-}9��1�!�4#�֚�v7C�%�ɪ
�^Q��ś$t�)�H͡ˆ����G��+�0��K�ھ}k��N�����sc�{\_^��J�#�Z�~�ʮ/����]�w�ۙ
-G�Hc��\.��eGE.�]�z�?R*��Z��Ā��zXQN���c�VZЄ��-M
����
qX�Yz�֛F��S�DH�F��	����A�]���k��9�
�#�,]7��X� �u�
�?rB��!�i��B��$�p��5U�ú�
��%l �&I�n#,ġ���!�`���	s$��f/
��~�F/]�o�'΃6��m^ m�mj�I���1��� E�p�p銞�A[�p���	[
-�zMr�˒
��Z�A�1N�T����;��hP
Ji	*e%]�6�޵
p\L��BqŝtL���c�Mq
�b��Oq�:��&�8f�m=��W]�cޥ�Mq�� N$����ŢCo�
N����ޘ
�s�1ڧ7C����E��
�[�rb���Ey4;5c9�h"��� H���Q"%����5O�������,��Ն
;��{̀cpM4�
�
r
MD����'Υ ��30������Z'�)W
��"�?w���vVn���6
EΒ�l㑳���2"<|����!�1(�� c�
�^�<
��XI:P(v)��<�|
��a
.�>e�'� (?V� �3�✤���.����[��Z�l�+�N��ᔵq%��Uz�.wg&,[Kх�L��I��ޮ�Ԫ��o�J�4u�u
@(�����
-( �;���n�yQ,
�]
n
����a�``8�_
�	3/*�-Yx�X��@r�ĢM�
L���~����^���y
��嫕���������������r�����v���;�����'Wv�ȭ
<T�0�
�S�m/
�2X�b��y�[S�z��<����
Y,�"��G�
AD-���o���tl��.�	c5��LIł�D7j5�iT����
-P�	���- aC_)��5;S1� B
ȏ��M��΃�&��]���
8�z��&�5w��
�JKB��깨�
-
����
R��۶8�Q�
��X0{�!Pyfs
-8�	QŁ�����J
-���l���
���/z�\fA%�����/Vz.mM0�O��w.{�kx��.������8���
(!x��E��F�r��,�B��^BE�%��C������/s��I��=�mg�M�k�{�a�\�cg��{߉M>G��,��Yt}�4I�>�EoN�>���,z�I�EWU=��
��
<�W
�1t�x~9%������f��8%�Z�}I�	�3��ͱ��dx��=|��6a
Չ�I8=�6M�)=
�I��,�"KYej��Ӝ�C���
;͝5��r,>GR�+b��\��#��\��9t�iN�,:��
���yt�����$#��y�Nl�7y�Z�&�Ϋ<:���k�0
�%�w���?Cj�I�=���r{��\b<)�w�l?ѧ�(���z(��:�Iqw��v
��}'@���2>��\�m��.ۧv�P�	'��c���_��b���{`�Hl|x{U��ݻoZ��o���6]f��(q�9�E���$��^�o��m��O������NI�� [...]
-endstream
-endobj
-2604 0 obj <<
-/Type /Page
-/Contents 2605 0 R
-/Resources 2603 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2535 0 R
-/Annots [ 2549 0 R 2550 0 R 2551 0 R 2607 0 R 2569 0 R 2570 0 R 2571 0 R 2608 0 R 2572 0 R 2573 0 R 2574 0 R 2609 0 R 2575 0 R 2576 0 R 2577 0 R 2611 0 R 2578 0 R 2579 0 R 2580 0 R 2613 0 R 2581 0 R 2582 0 R 2583 0 R 2615 0 R 2584 0 R 2585 0 R 2586 0 R 2587 0 R 2588 0 R 2589 0 R 2616 0 R 2590 0 R 2591 0 R 2592 0 R 2617 0 R 2593 0 R 2594 0 R 2595 0 R 2618 0 R 2596 0 R 2597 0 R 2598 0 R 2619 0 R 2599 0 R 2600 0 R 2601 0 R 2621 0 R 2602 0 R ]
->> endobj
-2549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 685.646 350.517 696.55]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab27e9641bc6946aef6e3254d28c6fab4) >>
->> endobj
-2550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.735 685.646 427.13 696.55]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.458 685.646 513.996 696.55]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-2607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 673.691 169.159 684.595]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-2569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 638.036 347.898 648.94]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a703c5d92387510c5cbf8b0f1da3029b2) >>
->> endobj
-2570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.115 638.036 424.51 648.94]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [448.839 638.036 513.996 648.94]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 626.081 169.159 636.985]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 590.426 357.143 601.33]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9d9b8361c659cadd31afb61152ccf06b) >>
->> endobj
-2573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.361 590.426 433.755 601.33]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.084 590.426 513.996 601.33]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-2609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 578.471 169.159 589.375]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-2575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 542.816 331.559 553.72]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abd393bd3febd678f09a51a0364756787) >>
->> endobj
-2576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [334.777 542.816 408.171 553.72]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.201 542.816 513.996 553.72]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 531.234 134.838 541.765]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.527 465.262 348.464 476.165]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a52e2499c42a9be1e527642cbfb16ff8c) >>
->> endobj
-2579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.701 465.262 425.096 476.165]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.459 465.262 513.996 476.165]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 453.306 149.224 464.21]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 415.659 351.773 426.563]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aebe78c4ede3d49c63765e71cfe93904e) >>
->> endobj
-2582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.991 415.659 428.385 426.563]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.714 415.659 513.996 426.563]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 403.704 134.838 414.608]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 366.056 424.131 376.96]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a819d233e9b1442e06c806dea0523a2f9) >>
->> endobj
-2585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.349 366.056 500.743 376.96]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 354.101 224.501 365.005]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.539 318.446 357.689 329.35]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a304dd0846a62cb4a9f79806ea82cee5d) >>
->> endobj
-2588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.937 318.446 436.332 329.35]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 318.446 513.996 329.35]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 306.491 210.673 317.395]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 270.836 364.903 281.74]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af93c7e3e554a92e8d3eeb4cf4261debd) >>
->> endobj
-2591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.121 270.836 441.516 281.74]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [465.844 270.836 513.996 281.74]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-2617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 258.881 169.159 269.785]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-2593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.965 223.226 362.74 234.13]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abf1bb44cdbf733e9ca39164f9d8e8179) >>
->> endobj
-2594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.415 223.226 439.809 234.13]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 223.226 513.996 234.13]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 211.271 217.298 222.174]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 175.616 371.529 186.52]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8948143df881c58c79da34380f847401) >>
->> endobj
-2597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [374.747 175.616 448.141 186.52]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [472.47 175.616 513.996 186.52]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-2619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 163.66 169.159 174.564]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-2599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 128.005 360.331 138.909]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a1bd806c292d0576b94d3084b21736061) >>
->> endobj
-2600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.549 128.005 436.943 138.909]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [452.973 128.005 513.996 138.909]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 116.424 134.838 126.954]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2602 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2606 0 obj <<
-/D [2604 0 R /XYZ 89 770.89 null]
->> endobj
-2610 0 obj <<
-/D [2604 0 R /XYZ 90 558.476 null]
->> endobj
-2612 0 obj <<
-/D [2604 0 R /XYZ 90 480.733 null]
->> endobj
-2614 0 obj <<
-/D [2604 0 R /XYZ 90 431.319 null]
->> endobj
-2620 0 obj <<
-/D [2604 0 R /XYZ 90 143.665 null]
->> endobj
-2603 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2675 0 obj <<
-/Length 2518      
-/Filter /FlateDecode
->>
-stream
-x��ZK�۸�ϯ�-T��A�$67��.ov
'�T��
-CB�|�"5��_�Ƌ/qF[�q��� �ݍ��n4�g����xy}q�:�3�xH���j��,�
����G/��_��a�|
�$�{��w�?�����]�x}��‡Gx��
E�,).>��g)t�4�(���N*f�p�g.�v����AOS�G�,�}����/e����/�����T
�%U9�ػ�����:�J;"��F�����A��)72����^�}��Zj�
��<��7#E^�}�27�ݜ2����v�
�ߌ��Ҭ�T打[4�u3'��gy���g
P�3ft0�Q���(�,1wk���
-��\���mc^�f4b�d��ܭ�ȅz��k�}s�&n[EyoF
�!F4rC�F��+���� h�����
m���#2�ò�s�ovY�t�,����0���725�%,H�P-�N��-�����Fl��~Y&��k��l��D��w�K����`&���6s
-�?�-&	`���m���rq��E���ހ�M�}_]����ejkG4�
f;��:�o
t�r1P�z�v?A|�"o#n�i�HY�X�T����nc�#e�O��~������jJ�s`ae������Iz����]J|n���f���l쓩�K�b
��˚{5vQ!�4ke����v� LgY�
��m&�v���$S�^��܏=�}��2��h��`�J?_�H�S�/_�}�
̠
�����!l0e�q�0��5��#���5�]�9v� �����w��}������A��[�iEhO+�#D��y�Q`<�@w�x�1������L� �����

 6�CT�DT��=�(��tJ���A���1qj��W
�@���"9
�#��we�Wd
و O���s�T�{�Q�L�ᵚS�J��,Q����޷>:̴�M
=�]�3�C[���Za������
=�1�ڬ�ϰ0L�F��k�A�B��D�
���U�e�
-��a��q����1�(%�Y�U�h�5M�p �^~
"
	J��)�B�w�?��!Š�g�@� �O"��.k6K���\ڃ�^ #�G� "���EXȂ8dt蒧�I_�-�J��Cc<� 
�G&\�.W�r at a�
�I쉭
�e�0L��z�2�	x_ّ�N;�EQ��k��)iK+I������t�m�Z��(�����Y�r�xZ��WV��fZ"e:!=�QLZn�׸W��`�y�s
jq�<4���?�'!p���A���g
�#�����Kg��	���4W
=U�V̺ ���4s1Q\�T86C5|�7��8B��^����
�Zq:B1G�V"6$ʺ	��n��Y�(��q���8�C�Lc�
�����ſC,&ql�W�Eh
��,�p�zO
��Gq
=�v�<vѸ/o/�[�Us:��h|�hܡ-F�8BX��#pD�d���I��[)�n��L�u5���{�#VOqʑ
����Jh��\6��������S�L��al}k*:"�R�"�E���d�`]���0�h�-�MfW/�g]�ru���<xuR�,�U�ښ�l_[l���ey�h���e��C���OΥ�ez&}8/3��87[��ޗI[z�m���W��s	�Ti��)�G�*7�����졩ފD.Ӭ��.�>+F_��'ɲ���G�m B�S�mq*I��`�ِ&���ߦ���P�E�b�

-�ߑ�����qc�Xne���~Y�����H1QU�XOIP�U at 5F�3$rڡ��l��
E���A1�t�A= ��n���#�}k2IXL������Щn�� 
#=R$Q�Dҙ�a�4Y��ƾ�p����B�S��
g���H�C`izta�d�5JG}k)�s9
J�ёI��
ݰK���fD�*G���q��>Yl�i�1�A&rwv�g�P�X���P��
��iv�[�ʼn��"�^f�2e�j�RcH��Xs����˟��MD������ol�qG��-�08���G�� 'R��_�속^F(�ޑL�.P����b���L�z�@�
��R�%�`k);��WB<
-C+�Y���(\���|�.{��'�"ҦC�o�!���Q�%q0��Z6fõǩvf�|1=>�O�������!��������Ie��>9;��i��,Y�\�a���
wm&�պ�DY�Ĥ=�y�("Ǿ�!R
$�������&�>Sз8_���
�����V�qξ{�����0�G��Ol%<�?�)�
��n3vP�&�Y�����G cD�
� _deVd���c.�;Ns
'
�>��y<�ӑ6'�nȳ�|
@��?���O���c�)��(��z���?O�E��N��to"���_�_.0�~�����
�q��f�*X�[n�-��_�A���g���@g!v��4���4�G��E�ދ�}��l�n�r�����Z�����޿�r��I� r��*w]�B��o.��A�R���s��_Ta���	"���l�f�����~]�r��'�!m��Q�p�����UT;�{Bg�OKh����
�
-endstream
-endobj
-2674 0 obj <<
-/Type /Page
-/Contents 2675 0 R
-/Resources 2673 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2535 0 R
-/Annots [ 2630 0 R 2631 0 R 2632 0 R 2678 0 R 2633 0 R 2634 0 R 2635 0 R 2636 0 R 2637 0 R 2638 0 R 2680 0 R 2639 0 R 2640 0 R 2641 0 R 2642 0 R 2643 0 R 2644 0 R 2645 0 R 2646 0 R 2647 0 R 2648 0 R 2649 0 R 2650 0 R 2651 0 R 2652 0 R 2684 0 R 2653 0 R 2654 0 R 2655 0 R 2685 0 R 2656 0 R 2657 0 R 2658 0 R 2687 0 R 2659 0 R 2660 0 R 2661 0 R 2689 0 R 2662 0 R 2663 0 R 2664 0 R 2691 0 R 2665 0 R 2666 0 R 2667 0 R 2693 0 R 2672 0 R ]
->> endobj
-2630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 628.099 337.387 639.003]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a879f2f2b0f967fa73cb59ea8d8b1d255) >>
->> endobj
-2631 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.605 628.099 413.999 639.003]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2632 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.328 628.099 513.996 639.003]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 616.143 134.838 627.047]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2633 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.618 579.203 410.855 590.107]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8b280d026e0c343ec0d3f5521dda6376) >>
->> endobj
-2634 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.183 579.203 488.577 590.107]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 567.248 224.501 578.152]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 532.3 337.387 543.204]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af29cc9becde5f28a37567093174d6855) >>
->> endobj
-2637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [340.605 532.3 413.999 543.204]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.328 532.3 513.996 543.204]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 520.345 134.838 531.249]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.618 483.404 410.855 494.308]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a680aecc71f3b21fa0db03c7d1cbe466b) >>
->> endobj
-2640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.183 483.404 488.577 494.308]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 471.449 224.501 482.353]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 397.68 232.521 408.584]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_adc7cd513e31b7ecdda3a25a967d8a772) >>
->> endobj
-2643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.337 397.68 335.743 408.584]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 334.909 277.352 345.813]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9947be8614cba5c2e8b02771d48fc7d2) >>
->> endobj
-2645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.168 334.909 380.575 345.813]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.017 334.909 479.373 345.813]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 308.927 277.661 319.831]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a50d5c68064e215d3f2cf3ee69896e676) >>
->> endobj
-2648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.477 308.927 380.883 319.831]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.326 308.927 479.682 319.831]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 271.987 307.758 282.891]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab1d03e0aac8dda484b102c536c612a45) >>
->> endobj
-2651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.976 271.987 410.382 282.891]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.748 271.987 513.996 282.891]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-2684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 260.405 134.838 270.936]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-2653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.052 236.043 306.618 246.947]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6c5a2f9b4702c1a0ddfcc9c6eb9b92bd) >>
->> endobj
-2654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.379 236.043 409.786 246.947]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.13 236.043 513.996 246.947]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 224.088 134.838 234.991]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-2656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.437 200.099 269.385 211.002]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a85417db0eb420d402acee4ef0d842efc) >>
->> endobj
-2657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.532 200.099 372.938 211.002]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.126 200.099 513.996 211.002]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 188.143 134.838 199.047]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 162.162 275.081 173.066]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a2dc649f0ee90ea5af999e3c0bae54bcb) >>
->> endobj
-2660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.299 162.162 377.706 173.066]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.072 162.162 513.996 173.066]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 150.207 134.838 161.111]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 124.225 316.057 135.129]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a27fdc62bc2cae150c7d710a8e312a40d) >>
->> endobj
-2663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.274 124.225 418.681 135.129]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.047 124.225 513.996 135.129]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 112.27 169.159 123.174]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 86.288 322.682 97.192]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6d147411700f558d74d8273accfb8e04) >>
->> endobj
-2666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.9 86.288 425.306 97.192]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.673 86.288 513.996 97.192]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 169.159 85.237]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2672 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2676 0 obj <<
-/D [2674 0 R /XYZ 89 770.89 null]
->> endobj
-2677 0 obj <<
-/D [2674 0 R /XYZ 90 643.201 null]
->> endobj
-2679 0 obj <<
-/D [2674 0 R /XYZ 90 547.606 null]
->> endobj
-2681 0 obj <<
-/D [2674 0 R /XYZ 90 412.798 null]
->> endobj
-2682 0 obj <<
-/D [2674 0 R /XYZ 90 350.027 null]
->> endobj
-2683 0 obj <<
-/D [2674 0 R /XYZ 90 324.234 null]
->> endobj
-2686 0 obj <<
-/D [2674 0 R /XYZ 90 215.405 null]
->> endobj
-2688 0 obj <<
-/D [2674 0 R /XYZ 90 177.468 null]
->> endobj
-2690 0 obj <<
-/D [2674 0 R /XYZ 90 139.532 null]
->> endobj
-2692 0 obj <<
-/D [2674 0 R /XYZ 90 101.595 null]
->> endobj
-2673 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F106 568 0 R /F60 172 0 R /F24 169 0 R /F92 331 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2761 0 obj <<
-/Length 2332      
-/Filter /FlateDecode
->>
-stream
-x��[[s�F~���mQU��
d�6�I%���N�����
-K-���
 �ʯ����Him�\~�朾|���t�ؙ;�����W7�|�(T8�3'Ď�C�	��:�\QotM0�n�/�F��r���bD7K�U4]S�?��,f�D�ۏr&u��G�3�����۟�����rE�
-�!ƥ����$W�~��
��`���yЅ�S�K�׫_a[��_ݚ�9�Fp��1�p��1-���+YB�D�F���Bs��ʲT��y�-+�CD(���|b˴=��.��,-��E�N��D�V��j~�uY��\g3��i���ich^�TG���b�=7{����ӹ������
�kUQ�:`�Ǿ��B/45���ӎ�BS|_4�]t�#,�"H�i=
-7��6��=����!=ϼ���_r>]{ �8��c�bn�QP�������X&y�޵��~�
�kL�óm�겓/�i�g��V�P�'�R�B
��~�ժHK��ɳ2��{'�f9�؝�v!b��Y��`�8	�G�!�I]$��u'��\�o�
-�����Hw=�Y��z�y(�<��`�J�����K��$�X��m��ű[ʺ*��5}
c��Z0l����פ!Ύ��l�N�\�@�
�M�G �	>W��:�L <q��WQ��c���sY��lc�
1;�W��uo�})��^fi_-t��,qS<ĥ
�#���sI�	f�x-���d��/�J^�1}�
�~3�M�B0���
���H��:
Џ�#q9�M�rR�J��� ���ˀ�:/eu�0$+��5��� � S�^pPiL��O��0����4NdZ���:����Q�z�i�YMQu_�d!⢡����2	ڦ�N��
��jO3�
�VK�VEļcҏ~s6�
�'��kIY�gE����L5�d���ջ� X]�ސ�t���8�Q1��1/d�Ĭ� �
>莾�<4bG�g���Y�c�
s33�eb�t�g�Mm:
���kV���:BkRv��a{'A� 9>�A�5 at V
�� \�� ��2�M�G�n=~��Ew��
-�JB��uŵ��29SA�c:�eZu�*W�8=���7 ��v��A��!���=fJ���QlD�
�Ur at 5��,�*+���Qph�_S
-�N�B0D�GwQ_�;��V���O�]?�w��`P
���Ul
ki�\�5�q��.J�]�#�I��KC*���Tt�7�is��?�X 7�k[���"�(Y��ITZgjkI�&1�g���4��1�t-W��U��Z�T_> m���d��G�1�Ԃ�^{��#+n�|U
e�D at S�n�IT�|��*B�-wͩ��H�"9f}�e��1a�
�c:C
�E�F
aNӢ���"H
��h�����|�=�8m/�ު}Z&�[F���nT�'f�=���}���UEn�wjK~U�����������<�6
�+��m�YV�_f�����04��MĚ5�E���� �`j��[��_B����W�SD��>_�����
$SR��xT#�/Sl-{dJ3+
!S(�ZE+�B���u2�\zA�G���n*�W��4J�D;��=}��Hy"���+O<�&�8U�<�6!!��sJ���A�����{c�'�x�m-���Z���V+�O�<��cK����7U�Q+�O[���V�˟�V��sK��c�ͳ�AD���}< �?������<v�����1CV��!���e�����
E�7�̭;�s���f��>� &a��w�\VE<������|S���3��ґS����K¶
�f��ڳ�v��G(1�
�D��(���
�����hwB<�0H��f����>�j�g�]w��a�z��Bv��]��9Es�ZVއR~&��M���I�+_�K�q��e��K��t
-eH��M���&�
_�����u1�l��~(�`A�N`�����
�|"Z��`�A.��
-r�D�����MZ}�ͨ�
-U�l	�L��YW��W�I��K�2"�������GE
�U��F����Q5�axg%$��"�-6���C��̒�0��H���3�O8:rg���M$yp�R�VVv�jI>�&���o8S{-_0ز
�ܡ( �2���!~�d�F�q"��X��t|�VG�.6v�T�w�"� �|z�*B��X�=�}�Sv�>}P�	���̱C����^qP���ό�������*����j�S����o긑�/Qڤk���@&p�!AX����WYoƙ����W?���t��=6�ޢ��oon�V�R�s4ɒ��ۼ�ԛn 
8i&>E:�Q}d��o�:!h�c��_�0����
-[�������͏	s���@l�R�ʙ��
-endstream
-endobj
-2760 0 obj <<
-/Type /Page
-/Contents 2761 0 R
-/Resources 2759 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2535 0 R
-/Annots [ 2668 0 R 2669 0 R 2670 0 R 2671 0 R 2698 0 R 2699 0 R 2700 0 R 2701 0 R 2702 0 R 2703 0 R 2704 0 R 2705 0 R 2706 0 R 2707 0 R 2708 0 R 2709 0 R 2710 0 R 2711 0 R 2771 0 R 2712 0 R 2713 0 R 2714 0 R 2773 0 R 2715 0 R 2716 0 R 2717 0 R 2774 0 R 2718 0 R 2719 0 R 2720 0 R 2721 0 R 2722 0 R 2723 0 R 2724 0 R 2725 0 R 2726 0 R 2727 0 R 2728 0 R 2776 0 R 2729 0 R 2730 0 R 2731 0 R 2732 0 R 2733 0 R 2734 0 R 2778 0 R 2735 0 R 2736 0 R 2737 0 R 2738 0 R 2739 0 R 2740 0 R 2741 0 R 2742  [...]
->> endobj
-2668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 685.043 245.263 695.947]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a4b5f126aef2ca062b034f795f6e5cf6d) >>
->> endobj
-2669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [249.079 685.043 348.485 695.947]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 659.14 253.711 670.044]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a357ddb19493a385970c56bf4847a07a1) >>
->> endobj
-2671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.527 659.14 356.933 670.044]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 633.237 254.668 644.141]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab4f7535037080c7f5db32b2e85fdc80d) >>
->> endobj
-2699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.484 633.237 357.89 644.141]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 607.334 299.898 618.238]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9e5f40dfc278c52da81291b30fbe75f7) >>
->> endobj
-2701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.713 607.334 403.12 618.238]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 581.432 303.374 592.336]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a39ee8e60c1d4d6faa40986d8fba28d5d) >>
->> endobj
-2703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.19 581.432 406.596 592.336]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 555.529 251.34 566.433]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a141c3283de2a46f2fcb278dcdca0558f) >>
->> endobj
-2705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.156 555.529 354.562 566.433]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 529.626 249.128 540.53]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ae1e938f0c844231dfe2098ab8fbca67b) >>
->> endobj
-2707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.944 529.626 326.338 540.53]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.78 529.626 425.137 540.53]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 503.723 289.737 514.627]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab32d3b44994fefe43c44e353a47cb4a4) >>
->> endobj
-2710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.954 503.723 392.361 514.627]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.727 503.723 513.996 514.627]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 492.141 134.838 502.672]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 465.865 290.344 476.769]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a7135823ecf68cedd5236d53e2b5541f5) >>
->> endobj
-2713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.562 465.865 392.968 476.769]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.335 465.865 513.996 476.769]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 454.283 134.838 464.814]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 428.007 295.584 438.911]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a93cee014592562084126f06fe47efbba) >>
->> endobj
-2716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [298.802 428.007 398.208 438.911]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.574 428.007 513.996 438.911]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 416.052 134.838 426.956]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.486 416.052 217.968 426.956]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.224 416.052 317.705 426.956]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [413.3 416.052 480.587 426.956]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-2721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.327 381.183 249.243 392.086]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a1dd00b705631c579994677fea3a86d63) >>
->> endobj
-2722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.28 381.183 353.686 392.086]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [371.875 381.183 500.601 392.086]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 369.227 196.576 380.131]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.856 369.227 297.337 380.131]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 332.366 293.93 343.27]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a0e494452cce5a8916f4fe97a1c79e237) >>
->> endobj
-2727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.148 332.366 396.554 343.27]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.92 332.366 513.996 343.27]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 320.41 134.838 331.314]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.51 320.41 218.992 331.314]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.502 320.41 316.983 331.314]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.203 320.41 477.49 331.314]
-/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
->> endobj
-2732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 285.541 293.93 296.445]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aee4d567631589e83063cfb8f80c2bd6f) >>
->> endobj
-2733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.148 285.541 396.554 296.445]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.92 285.541 513.996 296.445]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 273.586 134.838 284.49]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.51 273.586 218.992 284.49]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.502 273.586 316.983 284.49]
-/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
->> endobj
-2737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.536 236.724 292.284 247.628]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5a6342bc4e04c1f228d210e5c363b6d4) >>
->> endobj
-2738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.53 236.724 394.936 247.628]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.37 236.724 503.777 247.628]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 210.821 324.913 221.725]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abcf3ccb8e2e224496d1326e47e15fdc6) >>
->> endobj
-2741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.131 210.821 427.538 221.725]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.923 210.821 513.996 221.725]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 198.866 134.838 209.77]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 172.963 324.924 183.867]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aa309e957fa5f404b296e2e4c30e1697d) >>
->> endobj
-2744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [328.141 172.963 427.548 183.867]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.933 172.963 513.996 183.867]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 161.008 134.838 171.912]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.543 135.105 284.541 146.009]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af777de5ca96f8d1631d3500008bf84f8) >>
->> endobj
-2747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.794 135.105 387.201 146.009]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.649 135.105 496.056 146.009]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 111.195 223.116 122.099]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af98013213e01ca8514b6dbd20116af4d) >>
->> endobj
-2750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.932 111.195 326.339 122.099]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 74.333 317.601 85.237]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a3e07a3e1a6e6c9f281227b4e215a3dc7) >>
->> endobj
-2752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.417 74.333 420.823 85.237]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2758 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2762 0 obj <<
-/D [2760 0 R /XYZ 89 770.89 null]
->> endobj
-2763 0 obj <<
-/D [2760 0 R /XYZ 90 700.763 null]
->> endobj
-2764 0 obj <<
-/D [2760 0 R /XYZ 90 674.407 null]
->> endobj
-2765 0 obj <<
-/D [2760 0 R /XYZ 90 648.504 null]
->> endobj
-2766 0 obj <<
-/D [2760 0 R /XYZ 90 622.602 null]
->> endobj
-2767 0 obj <<
-/D [2760 0 R /XYZ 90 596.699 null]
->> endobj
-2768 0 obj <<
-/D [2760 0 R /XYZ 90 570.796 null]
->> endobj
-2769 0 obj <<
-/D [2760 0 R /XYZ 90 544.893 null]
->> endobj
-2770 0 obj <<
-/D [2760 0 R /XYZ 90 518.99 null]
->> endobj
-2772 0 obj <<
-/D [2760 0 R /XYZ 90 481.132 null]
->> endobj
-2775 0 obj <<
-/D [2760 0 R /XYZ 90 396.45 null]
->> endobj
-2777 0 obj <<
-/D [2760 0 R /XYZ 90 300.808 null]
->> endobj
-2779 0 obj <<
-/D [2760 0 R /XYZ 90 251.991 null]
->> endobj
-2780 0 obj <<
-/D [2760 0 R /XYZ 90 226.089 null]
->> endobj
-2782 0 obj <<
-/D [2760 0 R /XYZ 90 188.231 null]
->> endobj
-2784 0 obj <<
-/D [2760 0 R /XYZ 90 126.462 null]
->> endobj
-2785 0 obj <<
-/D [2760 0 R /XYZ 90 89.6 null]
->> endobj
-2759 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2858 0 obj <<
-/Length 2115      
-/Filter /FlateDecode
->>
-stream
-x��[Ks����W��*
�
3 at r��Vʎ�J�
v�XX"�� 
��ҿ>= 	P�\�k_D������_������?F_?�nn%v|�
*��G�ǎ�>r�:�ƒN><|�0�!�
��߾����oz�Wߍ�}�2"�v���"�9�������{#�{γ
�v8e�r�G�a���f�c��	�X#
#
-��D�a�?Y\D�dJ]<.R��ͭO�&1�<Y���jF4�2�1)���*}�2��1�&a���\F�!��OqbG�*~�ǃ��h�f;�
$����B���rr�(%��j�e�
0��_AZ-� onž��
S�=ϙ�0�f�{J��,����j[�}���-�������f5�KW�efi2+�"X��Fgq23�8 ���.>IYS��I^4h���,�Z��
���|oÌ\�[
-�=�̌j��#�#5N�=�X��fC�S��
��S�'*����l����g�N*�䞙z�	��o�u��qj7v�M�7�r
p�'
��v��
U*a����n��4�w���P��A�"
�t
%�z�<����
� 

�������3����dᛊ�vR��D%8i
����jɢ|�nv'�jd2!�,	ȯ17oA�D��r�����E�n.�\�>Gm�ó�]�VS�����j
�E��8^��YV^d{29�0h�u���)�
-wǥ�j��P�
�E� ���UdMC�[2S��� R���4�@
��:����+114�D�
 ��&����3���B wE�
�����C\����`]���	�$�]
���<��K��9�<0�-��E��2�w��"�K`��6�e�\���|u�B5�L *:�(
����!Jg�<�����}1F�
-��k䏙w�f|O�D5�L���t�L�HlÓ@��&�L
���we�Dҷ8������=�4�f�q����S+��v�m �
"�����6�J�����pѕi��Ɂ� �G
s�
-ٕ��e�����̅��@L0��
 ���Mő?Rsσ�^��v%���J�3'*dyU>^΃���ݾmx�C�Z�խµ�t*�y
4��8�
-h�M��O#�'`
��$��uJV0>��H�
̂<��u�ԧ�>����j�wj��jD�
&L"L��Ӊrfu �������I��6�(�0v�&�TD�vUtܪy>žߵ�L&����p��D�L��}�(���*m���'�@��CJK��:����!��
V[+`�����^�����0~�Pw�e�3���}��J�1�E2���\m�f�li�O�G��ZFJ
�lC���FXN�6�́��x�Yŏ����J�E�ºO�)}�3�	:�Iy�>_A�Ϊq�%��s�I��� �b���&�l/��F*ҚE�yyGD�����Ԯ�7mV-+IF�NZ[��֥�~�4e
���m��]�r�4������5y��i�N���S��w�d�&�(�W7���d��ۻ�$M������� �����n�ѦM�u���!޻da�sˏY����S`�Ǯ`��.m�x
͢U�����ұGe.�
�F�6���(JN�UF�zًtp ~�ȄBJ�Iy��@H���h����(�,?#x$�qQQS�нvJ��k�sx�֓�Ƚ��fK�e�T%�Y�� [...]
-{��
���@��[�*��Im
���u�@ma�Ғ�-�
Q�
�?Y
�
D}�@��D�ˤ�
U����`��!ǢF-Al���@�&����&�8'��E��zl��W��k��j0��<��Î�}��M
����p���x�����WmQ*�{V�����Q�>X:�\1sY��Z��ݵ5&O�/��7��p at MR����.��<��q��l 2�Β�jĴ�B����ٺ�
�EX��kW�>�$I��t[�0$-
�� E��f�M����E�/#W��T����,��7߭��M
-�jrS�7�	�y�MRfH�E�X|�
<v�N��������C�,���~����
-��1�7�r���8/���m�n��yRb����� l����4���U���j]��|C.F�J�ˢ������vZ�y�>6��d)!
-���ڲ�:ͪ�
^�u�y���Vn��
-endstream
-endobj
-2857 0 obj <<
-/Type /Page
-/Contents 2858 0 R
-/Resources 2856 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2535 0 R
-/Annots [ 2753 0 R 2754 0 R 2755 0 R 2756 0 R 2757 0 R 2789 0 R 2790 0 R 2791 0 R 2792 0 R 2793 0 R 2794 0 R 2795 0 R 2796 0 R 2797 0 R 2865 0 R 2798 0 R 2799 0 R 2800 0 R 2866 0 R 2801 0 R 2802 0 R 2803 0 R 2867 0 R 2804 0 R 2805 0 R 2806 0 R 2807 0 R 2808 0 R 2809 0 R 2810 0 R 2811 0 R 2812 0 R 2871 0 R 2813 0 R 2814 0 R 2815 0 R 2873 0 R 2816 0 R 2817 0 R 2818 0 R 2819 0 R 2820 0 R 2821 0 R 2822 0 R 2823 0 R 2824 0 R 2825 0 R 2826 0 R 2827 0 R 2877 0 R 2828 0 R 2829 0 R 2830 0 R 2831  [...]
->> endobj
-2753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 695.923 303.375 706.827]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a01daecb5bf8e498e7d539d7f3ba8496e) >>
->> endobj
-2754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.19 695.923 406.597 706.827]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 632.839 267.39 643.743]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5a9b061c4408ab8d70a1dea91a6ff983) >>
->> endobj
-2756 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.206 632.839 344.6 643.743]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2757 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.042 632.839 455.025 643.743]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-2789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 606.779 274.015 617.683]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a191744753f79b939c8d61efe45778bd8) >>
->> endobj
-2790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.831 606.779 351.225 617.683]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.667 606.779 468.276 617.683]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-2792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 580.719 271.265 591.623]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a2f80d4608b0b75948b50dd862a14df66) >>
->> endobj
-2793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.081 580.719 348.475 591.623]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.917 580.719 493.221 591.623]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.747 554.659 279.532 565.563]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8abb894f6f4a673d549aa9bf7456b638) >>
->> endobj
-2796 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.989 554.659 358.384 565.563]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2797 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.519 554.659 513.996 565.563]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 543.077 129.857 553.608]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.909 516.644 311.644 527.548]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14) >>
->> endobj
-2799 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.263 516.644 390.657 527.548]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.157 516.644 513.996 527.548]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-2866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 505.062 129.857 515.593]
-/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
->> endobj
-2801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.946 480.621 316.307 491.525]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af818756f74f766dfb937e586565db8d6) >>
->> endobj
-2802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.963 480.621 393.357 491.525]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.513 480.621 513.996 491.525]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-2867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 469.04 134.838 479.57]
-/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
->> endobj
-2804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 444.599 298.383 455.502]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad024f037803a208b74cd150eeaa5649d) >>
->> endobj
-2805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [302.199 444.599 375.593 455.502]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2806 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.035 444.599 486.018 455.502]
-/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
->> endobj
-2807 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 418.539 305.009 429.443]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8ffc5459233ed9781c0ca910e88fa1f9) >>
->> endobj
-2808 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.824 418.539 382.219 429.443]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2809 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.661 418.539 499.269 429.443]
-/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
->> endobj
-2810 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 392.479 301.661 403.383]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a0b031bedcfb70f485bab922596bce1c8) >>
->> endobj
-2811 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.879 392.479 378.273 403.383]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2812 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.639 392.479 513.996 403.383]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 380.897 134.838 391.427]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-2813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 354.464 308.286 365.367]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac655ac3a494c4f92bb02d0b9294bdd85) >>
->> endobj
-2814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [311.504 354.464 384.899 365.367]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.265 354.464 513.996 365.367]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 342.882 134.838 353.412]
-/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
->> endobj
-2816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 316.448 285.103 327.352]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af92f3c9d758e2a155a2a6faec4235741) >>
->> endobj
-2817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.919 316.448 362.313 327.352]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [372.774 316.448 472.18 327.352]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 290.388 291.191 301.292]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a784570f6ced5461b4d82cdfefa1cb31b) >>
->> endobj
-2820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [295.006 290.388 368.401 301.292]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.861 290.388 478.268 301.292]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 266.321 278.747 277.225]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a7918c3a73aed2529e1e57b8983264bad) >>
->> endobj
-2823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.563 266.321 355.957 277.225]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.418 266.321 465.824 277.225]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.787 240.261 332.246 251.165]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9fb38e66323fe6cb24b32e32e66dba78) >>
->> endobj
-2826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.742 240.261 409.137 251.165]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.023 240.261 513.996 251.165]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 228.306 134.838 239.21]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 191.287 286.209 202.191]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abc350d1ab1c6e4da0df6bb130364af7b) >>
->> endobj
-2829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.024 191.287 363.419 202.191]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.88 191.287 473.286 202.191]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 165.227 317.202 176.131]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aad69d01217b9ea1043883162d285505c) >>
->> endobj
-2832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [321.018 165.227 394.412 176.131]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 139.167 328.221 150.071]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_adb06752e755290368c9bb00ad14a0984) >>
->> endobj
-2834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.439 139.167 404.833 150.071]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.2 139.167 502.556 150.071]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.351 113.107 333.94 124.011]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8402fc25b68056511cf62f1378666a88) >>
->> endobj
-2837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [339.001 113.107 412.395 124.011]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.64 113.107 513.996 124.011]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2855 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2859 0 obj <<
-/D [2857 0 R /XYZ 89 770.89 null]
->> endobj
-2860 0 obj <<
-/D [2857 0 R /XYZ 90 711.269 null]
->> endobj
-2861 0 obj <<
-/D [2857 0 R /XYZ 90 647.996 null]
->> endobj
-2862 0 obj <<
-/D [2857 0 R /XYZ 90 622.125 null]
->> endobj
-2863 0 obj <<
-/D [2857 0 R /XYZ 90 596.065 null]
->> endobj
-2864 0 obj <<
-/D [2857 0 R /XYZ 90 570.005 null]
->> endobj
-2868 0 obj <<
-/D [2857 0 R /XYZ 90 459.944 null]
->> endobj
-2869 0 obj <<
-/D [2857 0 R /XYZ 90 433.884 null]
->> endobj
-2870 0 obj <<
-/D [2857 0 R /XYZ 90 407.824 null]
->> endobj
-2872 0 obj <<
-/D [2857 0 R /XYZ 90 369.809 null]
->> endobj
-2874 0 obj <<
-/D [2857 0 R /XYZ 90 331.794 null]
->> endobj
-2875 0 obj <<
-/D [2857 0 R /XYZ 90 281.667 null]
->> endobj
-2876 0 obj <<
-/D [2857 0 R /XYZ 90 255.607 null]
->> endobj
-2878 0 obj <<
-/D [2857 0 R /XYZ 90 206.633 null]
->> endobj
-2879 0 obj <<
-/D [2857 0 R /XYZ 90 180.573 null]
->> endobj
-2880 0 obj <<
-/D [2857 0 R /XYZ 90 154.513 null]
->> endobj
-2881 0 obj <<
-/D [2857 0 R /XYZ 90 128.453 null]
->> endobj
-2856 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F92 331 0 R /F60 172 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2938 0 obj <<
-/Length 2799      
-/Filter /FlateDecode
->>
-stream
-x��[K������-d�wv��
�Jّ�i㋤b��HH�&��6�>= @�hHV9�A"t�4��������������x��Ba� #��
מ���		�ۙBT��	�xv<�������6
Ns�gq�H����
-<�)J���_�����:�ƄQv�p&f���?�|����ow��=�T
-���:ܽ}�� N��aČ�>d�
�
~�ޛ���|���
-Y]!
-I�C�q+yGa%Vyq���^��vQ����9m�Y��p���|Ͱ^=�b�c����߄M���.p�ئ��Z��~�3/�G�;�Q��2���y���Os�g#��(I�v���ڻ!�
_��?-~�x<��S��i�>�Qe\T}��=W�0J�%`OR�P�>��
�j��ٓ�(�f���?΅��+�
�d
����t����h.������V��4�/�wܺ!u�)a�!�8�>i�<B�(�]۸p.�΄6���s�fβ���T�c���;���x�O;���P�B�� �PDa��b��Ԙި �h

{ߴ��f 0!#�Nd\`�2o팋ş,0�t\$�e���s�?�����
a0b�7O�<x\|����ud��!��1��}���+�1R�_��1�@┈�.��ҁ�#�AD���q�CJ���<����S�E����
>�ҭ��� �Y��N{:P���S��uX�%�������
-�a��(�8����ǐ�fS�/��$�@Y�'�D��+J�LI)%"���2#�5��k�8Q a�;�����,
-*�����a�s��*\"Euaק�P6��a���R
-���<]�
n�* ��w_vQ[�
F�p�p�6Á}%�c,�֤�r�ԭ��y��.d�p�0ʹB `� �y���t���O��d��
2��QH�BZn�R&Йu���x���뫛�1\p�N�����(E��:P����4���ⵐH
q��
�A^
��J�o1�v��

�����߃�0-�2��=x-"T�:��$��I*����Dx��(^�n�� ���
���
	L[
7	�
<Z�)X5g�	���eǔd���v
-�x���1M�n�0:�u�<˰� O>p�8�x֢Վ?�����dž1�
������&�
-�]�����P���9<�v47��ARL��9�k�8�j��*G�
�� ��n	D;�Å��{�0^���x
��Hh>�������hN�=�� ���
$l�@4FX ��4%}@(�)��
D)!����@�Ta�V5��}؆Θ-�g6�i�[tmk�i �e
-�kfj��?��x�WL�U
����	�����
4��–ET�rj(@�1���hO�k(�h�E���R
-*���������� �g��>�H^��
�
�5����黽Ҋ�E�9ܷ�j���~�e.��o/�q?�����O�^lF�>�}�
�K#qh�2C�/0<y�=���M�}+J

�@\�aܧ�[�g
-#nx
��6
-f���_r��t�`��r�
�J�F��m�8m�+4A��v*�;���Lw�+D�mb	@�eO ��
-�T@ɫ������R9�,Z�F��5���.�K�n�P��M��ˢ,n.�h���,n���f��ۺB�{ M�&��ܜcލ�u��=��z*�6�R���O�a�l[O����B�� �$�_!rD2��hSC ���3Z��h�d��+�
B˚��g��.��J;���
Bˮ-Ah��]
-S��
-1'	�+�6��'���PurI9b�%��<5xq�Vv��B����/�s~��sc�?I{���~�W�DX�*���o�������m	�/c��+��
�f�a����-e�HrA����IC��ǂ�5�ot9�+���&
�� F��w?�N$8�hR���;���^O��}����٥I!

@ǰ�0���
-W[ѕRH`
o����<���~��ʀ�
�sQ��ڳ+?r�|X�La�@� �b@�C��'��.Z�vQÓ�,����b�{
-��=1j'��2B��=Z�-߶۶t��T ,��[�sk����
��]������7����7'�;�YG
?
-�a�!�'��@�M���Nz�����jn���.����0�ܕ��)��(k���|�\J���Wv��δ����p|
�}����r<�.أ
�7�W,���p�"5��~ͧ�55�~
6ϼ�x��e�Z�[��F^6�0 ���ϟɟm�t$�
-�4��O�v���
bk�'�_x��ϔLFQ:����caT��ܗj���N��"g��_|��	Ϟ,���s������
{���p��%8}񥶽
��;�����RK��ز`8����+�
�m8�q)���d��mS�B��Ԩ5攺�֚�ckJ�7����O.�lKi8G���$�u�`-�e��yo�
T%���,�KJ�ֲ|y�Į]m�*���}}�4W������r���xu���]q4�a�b�t�Sa�i: 
����At�����l���=I~�=I��E�9���h��+`Q��
8Y�2
���Ɉ���tz��$.��i�%Af�c�t�
��j&���w�\���S��su��
7z'j[ke�
���m� �����	G��EI��l췋ŷ��N*�ྸ�
-��\�ƫW/�����mζӡ�u�r��L��_�'=IQ ��~^������t1
A�zc�W�u��t���W
��Vbhe�DSDM�%l��������۠U|�Ǝ��J!|y#�.�+��T|��o��
-*^�V�
�������a���0���
g��?
��C
�������
-endstream
-endobj
-2937 0 obj <<
-/Type /Page
-/Contents 2938 0 R
-/Resources 2936 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2955 0 R
-/Annots [ 2839 0 R 2840 0 R 2841 0 R 2842 0 R 2940 0 R 2843 0 R 2844 0 R 2845 0 R 2846 0 R 2847 0 R 2941 0 R 2848 0 R 2849 0 R 2850 0 R 2851 0 R 2852 0 R 2942 0 R 2853 0 R 2854 0 R 2885 0 R 2886 0 R 2887 0 R 2888 0 R 2889 0 R 2890 0 R 2891 0 R 2892 0 R 2893 0 R 2894 0 R 2895 0 R 2896 0 R 2943 0 R 2897 0 R 2898 0 R 2899 0 R 2900 0 R 2901 0 R 2902 0 R 2944 0 R 2903 0 R 2904 0 R 2905 0 R 2945 0 R 2906 0 R 2907 0 R 2908 0 R 2909 0 R 2910 0 R 2946 0 R 2911 0 R 2912 0 R 2913 0 R 2914 0 R 2915  [...]
->> endobj
-2839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.783 707.957 262.173 718.861]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9563155e281915a8bc2eea34ceff9cf0) >>
->> endobj
-2840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.666 707.957 341.06 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2841 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.276 707.957 443.633 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2842 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 707.957 513.996 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.002 210.095 706.906]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2843 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.767 696.002 320.261 706.906]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.592 671.813 273.704 682.717]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) >>
->> endobj
-2845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.006 671.813 351.401 682.717]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.937 671.813 451.294 682.717]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [469.942 671.813 513.996 682.717]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 659.858 215.076 670.762]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.749 659.858 325.242 670.762]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.506 635.67 300.189 646.573]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad015c9afd4968005d43f233359253c5a) >>
->> endobj
-2850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.405 635.67 377.799 646.573]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.142 635.67 477.499 646.573]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 635.67 513.996 646.573]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 623.714 241.089 634.618]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.746 623.714 382.472 634.618]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.342 623.714 494.835 634.618]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.71 599.526 314.115 610.43]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6ffd595f3e1d85275962dde5f8401c7f) >>
->> endobj
-2886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.534 599.526 392.929 610.43]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.98 599.526 495.336 610.43]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 587.571 253.821 598.475]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.693 587.571 398.419 598.475]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [416.503 587.571 513.996 598.475]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.922 551.427 313.211 562.331]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac0e5d09ffe586f8ea5ec782570015c5b) >>
->> endobj
-2892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [318.843 551.427 392.238 562.331]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.767 551.427 495.124 562.331]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.124 539.472 262.12 550.376]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-2895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.641 539.472 422.367 550.376]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.964 539.472 513.996 550.376]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 527.89 134.838 538.42]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 492.369 323.519 503.273]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a381b0e6e2e58df417ff578ed6d715520) >>
->> endobj
-2898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.737 492.369 400.131 503.273]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.497 492.369 497.854 503.273]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.124 480.414 262.12 491.318]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-2901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.641 480.414 422.367 491.318]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.964 480.414 513.996 491.318]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 468.832 134.838 479.363]
-/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
->> endobj
-2903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.376 433.311 345.428 444.215]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a46fc9d1041d5548a5f8f220af2a07028) >>
->> endobj
-2904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.514 433.311 422.908 444.215]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.958 433.311 513.996 444.215]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 421.356 184.093 432.26]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.152 421.356 337.148 432.26]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-2907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.669 421.356 497.395 432.26]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 374.253 357.282 385.157]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6ff56c68b449b94588ea7290d01625d5) >>
->> endobj
-2909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [360.5 374.253 433.894 385.157]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [448.26 374.253 513.996 385.157]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 362.298 184.093 373.202]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.152 362.298 337.148 373.202]
-/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
->> endobj
-2912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.669 362.298 497.395 373.202]
-/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
->> endobj
-2913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 275.676 285.641 286.58]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac06aed22fa4405051df0da9e7bc16138) >>
->> endobj
-2914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.457 275.676 362.851 286.58]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.312 275.676 472.718 286.58]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.181 238.536 351.58 249.439]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_add9c4afcd6f6bd78509219f32d57e348) >>
->> endobj
-2917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.471 238.536 428.865 249.439]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.478 238.536 513.996 249.439]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 226.58 144.243 237.484]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.899 200.399 352.403 211.303]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a90544f38c2980f308cd6e0f9248fdd99) >>
->> endobj
-2920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [356.013 200.399 429.407 211.303]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.478 200.399 513.996 211.303]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2951 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 188.444 144.243 199.348]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.118 162.263 315.801 173.167]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aa48f8ae0f3a2647949417ec2da1c97e4) >>
->> endobj
-2923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.629 162.263 393.023 173.167]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.494 162.263 491.85 173.167]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.424 113.168 347.542 124.072]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741) >>
->> endobj
-2926 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.676 113.168 426.07 124.072]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2927 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [444.478 113.168 513.996 124.072]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2954 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 101.213 144.243 112.116]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2935 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2939 0 obj <<
-/D [2937 0 R /XYZ 89 770.89 null]
->> endobj
-2947 0 obj <<
-/D [2937 0 R /XYZ 90 290.893 null]
->> endobj
-2948 0 obj <<
-/D [2937 0 R /XYZ 90 253.942 null]
->> endobj
-2950 0 obj <<
-/D [2937 0 R /XYZ 90 215.806 null]
->> endobj
-2952 0 obj <<
-/D [2937 0 R /XYZ 90 177.669 null]
->> endobj
-2953 0 obj <<
-/D [2937 0 R /XYZ 90 128.574 null]
->> endobj
-2936 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F38 1600 0 R /F100 526 0 R /F98 1214 0 R /F42 171 0 R /F99 1213 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3008 0 obj <<
-/Length 2575      
-/Filter /FlateDecode
->>
-stream
-x��ZYs�F~ׯ��RU�hN ���bg�u
o��>�.
@$j�# hY���s�$HB&�I�>H�������`g�`�ǫ��n^yؑH��u��
�
�K$\x��
�_���a���t��.�����˷w�U��˻�߯Ta���y��W>a'��
����(u8e�u�_��
-[Up_%��!
r��G"�(�R�o�9��E�նX)S��V��T���خ����M
�y�J�bUA��$��*ɳj,Wu��>(x,���Pl^
���BZ%V�cO����K�z�OZ��#���G
-aV�J��A
��N��ߛW>���u�^f���@E>��~��x �ŋz��譔���M�m�_��KS��a����v�m�y-��N��)��ea
���%�tq�I�a�y3�j�8L>bL��T|~�˃aF�F��q��Voa&-o^I�[�iX��eЍkF�\�4
-��E�x-����IBU�1����˥o�d)�
�.��B�]
��Q��}�Ρ
�c��jJ_� �����,e�G
�<T�!(���<ĩ��ċ��T�kh_��Ɛ�}H��� �&P‘牦������f����+<7t��8
�y���X" ��eG��P&�q�
`���(�[�
�}+"Ө{�S��G�Vƣz[=z#��c�����'Q��#�
�(0�A%&2~�U~DwS^�0�wrԋ�Y^
�>�)?�1�S��q�$���d>Y���N���C�Z�����SUa��A�)_�����]�~�
 �����m��3e�}�*Y 
�nh�߁����ɇu�ek3�
�M ���Β	���
����KD�Q�$kg��:��]c�
-
���xh��]�M ��qL�'�`*��t`�+.��:�j;��k�;
� kF��p����X#t ����`�Xƒ@��f��Y��o~��E3�+�T��L�
�D��Ί�
W�|U�вgu�{�j#��D�_��R�r2$�;���)@���~=?
�E^Ӣ��|WO�aю,���HRvw�۫��������F���`[
-��b��@s��O��(� �a�/
 �y��"@\
�h�|����0r"J�0o�.gB���0F�j.H�MPN�D ��>J E?�V��3p�)���l���$�`��å�)��(
� x o�bк�A��F֍�с��B��ջ2k�~I�)����d�5�:��w 31�0xN&/����U�$�h���U�0z��r1���!�gc��yH���?���a�����]�Su��6���Ꞃnk���0	Q�_ֆI�|O<'~�y}~�Egȕ���r>r���70�K"G%P�79��5�<���S
߄��A2D�0$ە��5����q��_�)hjM��í][����
-��N��A�u��J�����hB�l�jL��6���WU��l���
o�k�k?�%��C�jئ'C�T
nT��@�rF1��������%�Mi��v���
��0/-*�<��I�I����I��z�8�*N��N�kW�i
~�Eq�IQ�̲��	���K�X�;���
$[�<]�gq�y�z��^8�2�R"����bV��x�v2&�����79�P�D�-ٺ:'���.�j��Q
��O�n��[�3�*k��~3x�آ2��
�I
~
�`�:_���*C2� ��f��Y8����{�1
��d
-��l�r�e�m�}4z��A:�3[���l��[e���AYNM�/�%!��
����})FܿL��≠2�A�c��OO	�
�@�����cD+0�
�.
��(����c�+����r��������
�B�
���"�
B��,�ԫ�B�|�1���z�c�����^oF
�Գ��@׎z�i�C��֧�=T}+��s���F�\�R�
p�3>�
�-��
���
2O
8���EǙ��^ f�j���S���[��R�
R�H߄P~GA��`
��3����[m�E��{��y��Zz�
'EbD>5FC��\�im�����z��{�F}����=z�HsĽ�x�ˆ��B�3LÝǿ&���|*Z'�O6]��~��ک��p�
�>UdC9ы9]s��{`mf�>QBN�>�e�m����Na����Nф�����q�����ǼX�5�Y�N\��/�:�N|Lw��m�#�N|C����Ԓp��Ô�vIh�l��#
�^:����Lf���N�Ffx��;�����.{��H��C5���ڝ	j�!����\Q�N�,I�?����y���}Wd21ud�9G��&4�6�pj@�#}�
�
H�h����r�%�+����<��l�
�t��Mw��u4�d�x��>�&�7�w�c���p�A�hp�\r�K���eA�1���NCm|Sܥb3o��:�˹R_1��
-#L<������l�؂��)s~�AX'n	��������|=!�4�l��ۀ����y�
��z�m�k���^�j{[�*.��.�u�9�v�ʳE��q���$+ ��R���B���?������о�>
�BfS��w77�w�*��(��}3�u�<������)L�2n�CAa�ڣM�/�5U
-endstream
-endobj
-3007 0 obj <<
-/Type /Page
-/Contents 3008 0 R
-/Resources 3006 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2955 0 R
-/Annots [ 2928 0 R 2929 0 R 2930 0 R 2931 0 R 2932 0 R 2933 0 R 2934 0 R 3011 0 R 2964 0 R 2965 0 R 2966 0 R 2967 0 R 2968 0 R 2969 0 R 2970 0 R 2971 0 R 2972 0 R 2973 0 R 2974 0 R 2975 0 R 2976 0 R 2977 0 R 2978 0 R 2979 0 R 2980 0 R 3018 0 R 2981 0 R 2982 0 R 2983 0 R 3019 0 R 2984 0 R 2985 0 R 2986 0 R 3020 0 R 2987 0 R 2988 0 R 2989 0 R 3021 0 R 2990 0 R 2991 0 R 2992 0 R 2993 0 R 2994 0 R 2995 0 R 3024 0 R 2996 0 R 2997 0 R 2998 0 R 3005 0 R ]
->> endobj
-2928 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.166 707.957 303.425 718.861]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aabb79ab0a7936b6f14cd20e15cb14fa8) >>
->> endobj
-2929 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.3 707.957 380.695 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2930 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.272 707.957 479.629 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.843 661.365 310.694 672.269]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a81cc2a565346ce8ee12124224ddd8d6c) >>
->> endobj
-2932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.246 661.365 387.641 672.269]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.61 661.365 485.966 672.269]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 661.365 513.996 672.269]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-3011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 649.41 195.719 660.314]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 623.971 301.661 634.875]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad6b383704ed3f314864c52f5b715cbbf) >>
->> endobj
-2965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.879 623.971 378.273 634.875]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.639 623.971 475.996 634.875]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [145.299 612.016 228.656 622.92]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-2968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 539.877 240.282 550.781]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af8a9392f205531631b3a98c332f594b1) >>
->> endobj
-2969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.097 539.877 343.504 550.781]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2970 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 514.438 243.599 525.342]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) >>
->> endobj
-2971 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [307.459 514.438 406.866 525.342]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2972 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 489 248.581 499.904]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6b5c73b1f3f864c8a10c39810b4711ce) >>
->> endobj
-2973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.92 489 401.327 499.904]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2974 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 463.561 254.668 474.465]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a658545ec6169d2843323bfe1ff078e6f) >>
->> endobj
-2975 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.483 463.561 357.89 474.465]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2976 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 438.122 249.128 449.026]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aaffebaba13f6fc73438bdccde0966547) >>
->> endobj
-2977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.944 438.122 326.338 449.026]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2978 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 351.039 339.589 361.943]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad9547cb6430722246dea7f5a70566c06) >>
->> endobj
-2979 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.807 351.039 416.201 361.943]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2980 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.53 351.039 513.996 361.943]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-3018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 339.084 169.159 349.988]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-2981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.868 304.447 349.194 315.351]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a3bc82e8c76e1a47ecc20c85e1003036d) >>
->> endobj
-2982 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.772 304.447 426.166 315.351]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.142 304.447 513.996 315.351]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-3019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 292.492 169.159 303.396]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-2984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.935 257.855 356.401 268.759]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a7573064b44c45d804d398aec02e7a64a) >>
->> endobj
-2985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.046 257.855 435.44 268.759]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 257.855 513.996 268.759]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-3020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 245.9 208.989 256.804]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-2987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 211.262 363.22 222.166]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a0184ad10aeca27f95d249d3a7e061b46) >>
->> endobj
-2988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [366.438 211.262 439.832 222.166]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.161 211.262 513.996 222.166]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-3021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 199.307 169.159 210.211]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-2990 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.184 164.67 267.458 175.574]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6137f367c0c83a73146d84c998d37cb3) >>
->> endobj
-2991 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.352 164.67 370.758 175.574]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2992 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [386.376 164.67 513.996 175.574]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-2993 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 127.276 314.383 138.18]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5e7090393ee5801d9c988db6d2a06a43) >>
->> endobj
-2994 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [317.601 127.276 417.007 138.18]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-2995 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.374 127.276 513.996 138.18]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-3024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 115.321 169.159 126.225]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-2996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 89.882 265.716 100.786]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aea399d3df97c711c758c8bf715e0c763) >>
->> endobj
-2997 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.532 89.882 342.926 100.786]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-2998 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [358.368 89.882 451.668 100.786]
-/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
->> endobj
-3005 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3009 0 obj <<
-/D [3007 0 R /XYZ 89 770.89 null]
->> endobj
-3010 0 obj <<
-/D [3007 0 R /XYZ 90 676.516 null]
->> endobj
-3012 0 obj <<
-/D [3007 0 R /XYZ 90 639.122 null]
->> endobj
-3013 0 obj <<
-/D [3007 0 R /XYZ 90 554.839 null]
->> endobj
-3014 0 obj <<
-/D [3007 0 R /XYZ 90 531.284 null]
->> endobj
-3015 0 obj <<
-/D [3007 0 R /XYZ 90 504.151 null]
->> endobj
-3016 0 obj <<
-/D [3007 0 R /XYZ 90 478.712 null]
->> endobj
-3017 0 obj <<
-/D [3007 0 R /XYZ 90 453.273 null]
->> endobj
-3022 0 obj <<
-/D [3007 0 R /XYZ 90 179.821 null]
->> endobj
-3023 0 obj <<
-/D [3007 0 R /XYZ 90 142.427 null]
->> endobj
-3025 0 obj <<
-/D [3007 0 R /XYZ 90 105.034 null]
->> endobj
-3006 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F99 1213 0 R /F24 169 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3083 0 obj <<
-/Length 2943      
-/Filter /FlateDecode
->>
-stream
-x��\mo���_!ܗJ�����E��ͽ���

�Z���+EZ'q}g��o�jבݤI ��r�!9��3C��d9��N�{qr�$�K��z��rb�$��(
w���iF���2J�t�]�?�q:ݬo���n��tS�����+:��(����"��������
WĤP�L�^����/Nޜ0�N��R��L.�O^����<�DX3y�*]O$�w=y~��	
���(ts�eD�c�1?��8����&/O
kU����-�T�\
�w3�w�X�/�"����n�m_��*��d��2�����a�.6ž<�!�r��v_����{���ĿgO���:-q�8'Z��)�$��Oݟ��_Թ�s�����ͥ�[^�e�;)��3F�(猩)ʊ�n�ΞX��IIp	��w�d�P�c�r����:	9hF�L�N�W)9(�*IIkj;�xʭ!�
-�Tx��#�٤>��

���:?����q���?����F�����ZrI�ɺj�@�G����O
�-s�'�}X4������z}>��W��q���h8
j��(
tC�:�I,� C���}b��/�J}���,��,
�
-�*����"�Z
-T�R��D#��̎S,�$1�Xӏ�X��匫)	$_U�X��F��Ld���)\f���=�
-�ΌԷL���Q.���n���(x|�F	6�'�v�,V�y�_a��<%�b����W���k��r��=,v�\yqs}���X 98��0�R�GF�
-��

�2ߝ��P�m~�����\�W)��n��th����Y�����(�%�D��

-rϾ�Pif��� �x�E��7J��]W��t
 2=u0�/
V���{�7uL3��'\6��k�����x�iY�$�T6����n
-T�|1s"\l��k7����6,�)��e:��/�`��6�ŷ
�v܅��U�X᜼]-n���hxc��L8x�u�Mp��7I	�0�>#l
᰹m�K���ԗm^�0�nJ���?�N�`������o�w��m��b�MX�m~�|��t�u�1/rXX^���^ç�%�)Q������"!�����V�$���`gW<� $�D�8�!��� ~�5Z? �Tt!�������w�E^�Jd�������9���:�%����M4��AR���]Wv�֣��{�G�
kϧV�b��W����A��π����*
�Q�C��*+�V{�.�_4en5*�+��C
���
�Sg�F媎�i�V
�<M���K�t^Q6�q
-��C��F\��U�4�t p
2f,Xv`�I�����雵C�M��x�v*�D�H�v�3;�6
�"��g�b����8/P�%���¤�1�W���.N���8�`��-���6<�i��b��&�
-� ��+�|�1'?��I�-��4wͯ�
D���D |4d
���������<q
��2�
���3{_�}�
��\���b�Q���v� �W$%� W ��d��A�U�XqpE
R��c
��np�8.^�u��ŪA45p[�0pUV��8eb�c�8���!W�>�p�ƒDVDg"�j�g�)� �*&��ʨ
��lb
����C����b��X��B��u��T�;�X�Lb�I�X��@,֎RT[5���
��Ob��K�l
��X�
�������cs`��Q90�)�	�\�ᔂp-�PF�bоG�
-�ءıJajV)jV�EV)"��a�Sй�� 9.i�U��SJ����s��*���U�0

	�{����Z=�t��\�bB��I='X�g�sv�f�J=*�SF�7�Z�f�!�	!�i�p�66��L
����Պ8�� D����p���hJ��
�j
-
J:ծ/���y|3s�+�����zU���|����a�]
�S
(�㇑6:�/oY�P�8���!
-�Ls��c��K�܅��i�����B�p���35��39�����N��E�J阑Qq%T�X��txe�
��i�!��c��������78����fP��|{��m��7�ҹH�	�z�mw�l������H��"ʡH�1�U�,�,
R;�’���I�Nt�:���[��/m'�p/!$��Q'��;
��X�@����;�w���ڧt>4���eP�瘸�=���z>�푞;�������O���G�| B�%ӟ7�n
�K/NF�Og+�[m��i���l������z:��t���;��l�t
�jOg�=�ψ�Չ>W�g�I���VA����0 �ּ��a���|���I����L�<+���)zh���l>R
-��1���P8�O+��:��pG-t����#U�I�;���h�
�n����6���B��#Jt�!���\N��l����_q�q�+�rR�-
���O<�1�)Ծ2����L��
��o [?"6/8�{l�}�d�>��c%;
#�%?"�\�^�r�#8�#�X я��BX1L��
� �2j#,'�
��	��
� �X�N6 V�,��|�(���˛
t��cmO�OSP�
&�gy���(�fu�#�6rߙ6k]nvש�fkh t�m-/�A�m�
T��n"��V`���.1a�d��QĎ��� �~�#e�-8��3bj�ťҢ��i5�9��茢;�6^
k�7�L��&'��	� O�i��iX�t
-/�)A��ޠ4@�䈽A�:L�:_���};X�����8��$��z�BZ������Vqu'�'X]�AEݝ3"l��������G�

E)�
^l,��3���

N��������,^_Z���Z�b��j���@�4�"�+hz)�ӧ������_���f�̛?�V��s���0S*~���y��u8G���/�|!#�8���<��F���>�W�0�
�,
-����,�<;{}���Œ\�����~9�Օ9_:n�\ov1�[ �:�J�/���V��y�1��7'�=s�4��Ƶ{_
g?]��_6��O��Y�
-endstream
-endobj
-3082 0 obj <<
-/Type /Page
-/Contents 3083 0 R
-/Resources 3081 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2955 0 R
-/Annots [ 2999 0 R 3000 0 R 3001 0 R 3002 0 R 3003 0 R 3004 0 R 3031 0 R 3032 0 R 3033 0 R 3034 0 R 3035 0 R 3036 0 R 3037 0 R 3038 0 R 3039 0 R 3040 0 R 3088 0 R 3041 0 R 3042 0 R 3089 0 R 3043 0 R 3044 0 R 3045 0 R 3046 0 R 3091 0 R 3047 0 R 3048 0 R 3049 0 R 3093 0 R 3050 0 R 3051 0 R 3052 0 R 3053 0 R 3054 0 R 3055 0 R 3056 0 R 3057 0 R 3058 0 R 3097 0 R 3059 0 R 3060 0 R 3061 0 R 3062 0 R 3099 0 R 3063 0 R 3064 0 R 3065 0 R 3066 0 R 3101 0 R 3067 0 R 3068 0 R 3069 0 R 3070 0 R 3103  [...]
->> endobj
-2999 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 707.957 269.592 718.861]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a612142029eeee3dd72bb0d37c670d6db) >>
->> endobj
-3000 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.407 707.957 346.802 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3001 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [362.244 707.957 489.864 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
->> endobj
-3002 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 684.534 307.569 695.438]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a841ceef027f12d5c99fc2e739ae340fb) >>
->> endobj
-3003 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.787 684.534 384.181 695.438]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3004 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.547 684.534 500.155 695.438]
-/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
->> endobj
-3031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 649.908 276.814 660.812]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aad3749930a51c38886b1d5a01dbbba92) >>
->> endobj
-3032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.63 649.908 354.024 660.812]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [364.485 649.908 463.892 660.812]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 626.484 301.442 637.388]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a06c7c974043c12bcf349c119e73cc681) >>
->> endobj
-3035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.258 626.484 378.652 637.388]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.113 626.484 488.519 637.388]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.925 603.061 189.72 613.965]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5eeb3bf2e0ec7e6cd38e47b53eb43423) >>
->> endobj
-3038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [193.355 603.061 266.749 613.965]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.866 603.061 365.222 613.965]
-/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
->> endobj
-3040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [422.898 603.061 513.996 613.965]
-/A << /S /GoTo /D (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) >>
->> endobj
-3088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 591.106 209.299 602.009]
-/A << /S /GoTo /D (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) >>
->> endobj
-3041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.248 591.106 425.496 602.009]
-/A << /S /GoTo /D (group__Datatypes_ga6b8429baa2a70746836586aad6905b64) >>
->> endobj
-3042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.819 591.106 513.996 602.009]
-/A << /S /GoTo /D (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) >>
->> endobj
-3089 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 579.15 227.002 590.054]
-/A << /S /GoTo /D (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) >>
->> endobj
-3043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.249 579.15 393.552 590.054]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.632 533.566 372.328 544.47]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a69c0a9ffd5b8910a90a91943a10fe3b6) >>
->> endobj
-3045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.67 533.566 451.065 544.47]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 533.566 513.996 544.47]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 521.61 180.776 532.514]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 476.269 350.826 487.173]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a1e5a2940765710cccea4ef4f1b7f1092) >>
->> endobj
-3048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [354.044 476.269 427.439 487.173]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.823 476.269 513.996 487.173]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 464.314 134.838 475.218]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.88 418.973 316.987 429.877]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b) >>
->> endobj
-3051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [320.577 418.973 393.971 429.877]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [404.026 418.973 503.432 429.877]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.106 384.59 297.836 395.494]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a88c408677f6de73fd80903738268efa3) >>
->> endobj
-3054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.651 384.59 375.046 395.494]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [385.506 384.59 484.913 395.494]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 350.208 418.761 361.112]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a977522267df419dd5f2824ce6c0f7610) >>
->> endobj
-3057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.979 350.208 495.373 361.112]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [504.758 350.208 513.996 361.112]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 338.253 211.769 349.157]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.582 338.253 350.886 349.157]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.887 292.911 400.763 303.815]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a96eaf729b170b6df69bc2d1127f8727c) >>
->> endobj
-3061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [405.36 292.911 478.754 303.815]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.973 292.911 513.996 303.815]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 280.956 206.788 291.86]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.601 280.956 345.905 291.86]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 235.615 365.172 246.519]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a88a7c177ebe33a3d41609609660fd3ee) >>
->> endobj
-3065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.39 235.615 441.784 246.519]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.169 235.615 513.996 246.519]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 223.66 134.838 234.564]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.651 223.66 273.955 234.564]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 189.277 345.795 200.181]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac78c1168665c72eaf8c2457b12700fba) >>
->> endobj
-3069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.013 189.277 422.407 200.181]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [431.792 189.277 513.996 200.181]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 177.322 134.838 188.226]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.651 177.322 273.955 188.226]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.568 142.94 425.899 153.843]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a875b11e85fe96586152f53f498158b1f) >>
->> endobj
-3073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.177 142.94 503.571 153.843]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 130.984 224.501 141.888]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.314 130.984 363.618 141.888]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3080 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3084 0 obj <<
-/D [3082 0 R /XYZ 89 770.89 null]
->> endobj
-3085 0 obj <<
-/D [3082 0 R /XYZ 90 721.073 null]
->> endobj
-3086 0 obj <<
-/D [3082 0 R /XYZ 90 664.555 null]
->> endobj
-3087 0 obj <<
-/D [3082 0 R /XYZ 90 641.132 null]
->> endobj
-3090 0 obj <<
-/D [3082 0 R /XYZ 90 548.213 null]
->> endobj
-3092 0 obj <<
-/D [3082 0 R /XYZ 90 492.643 null]
->> endobj
-3094 0 obj <<
-/D [3082 0 R /XYZ 90 435.346 null]
->> endobj
-3095 0 obj <<
-/D [3082 0 R /XYZ 90 399.69 null]
->> endobj
-3096 0 obj <<
-/D [3082 0 R /XYZ 90 365.308 null]
->> endobj
-3098 0 obj <<
-/D [3082 0 R /XYZ 90 307.559 null]
->> endobj
-3100 0 obj <<
-/D [3082 0 R /XYZ 90 250.262 null]
->> endobj
-3102 0 obj <<
-/D [3082 0 R /XYZ 90 203.924 null]
->> endobj
-3104 0 obj <<
-/D [3082 0 R /XYZ 90 157.587 null]
->> endobj
-3081 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F83 262 0 R /F92 331 0 R /F24 169 0 R /F100 526 0 R /F99 1213 0 R /F103 1599 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3118 0 obj <<
-/Length 2973      
-/Filter /FlateDecode
->>
-stream
-x��[[w۸~���[�sb7�/�w���6�&�K�
J�mv%R!�8�����7Ѳ��9۞��$Apf0��� �����v����Ⅶ��$�����,�3-+xZ��EZ�?\�4��(�ȶ^�������⻳��>�1xEg�}mf��ٻt���f�����m��Lr����ٯgԛB�&��I�i��
�a����*��ޝǔFy��f4���V��
��v��~]��UU׋rW�����:���LF��9��t[��&�i]���}��]7�osF���Ǫ�{�Gu��6�x���ۙB�v6
�����I
;�\/ˢn��1�
�*���>h��v���z���n�ʹ�e�lnov:+[a��\�&�kC��C ��T�^���$1,�i��R6P�/� /$JI��Cx)�%1����_ހUFG�]�7�?���p�ޓ�$�M���@����y�䃯�
�j�
׌�PV�>��K�ޚҎ�v���-c
-b����i1&���HT䂷�'�JA$3���G��
�r~���"/n�Pʛ	�Z�>�~.�&"V0q�&�gZ�&]@(���
��N�d�k�-�07��׫�F:t�#���	xL�A���0�	"x�_i���\@��JK
��Y��k�
Y�-�Qz��Lµ������]*�0ء���@=€c~b��ڻOQo�b�Rh��#4�7�^7e�q&2J�U�P�+�6L0S�P>M��$�.'�@��2�&
�@`����`�8y�����\H�.4���1��O�����9�Y�Q�}�⶘�У��f��_'
�h9���4�@�0�Ø��6�'#�Ǵ
3.
�
��d����Za��Y#s��/'S�)e�2Sỉ�fP�y
e�n�P�egGwvP�F�YO	���UJ�d��t|�>��u��_eKL��"���R�)�sn�
�M�=7|n�՟(��vD�
��|�.֙�"!B�&�@���z�$�@ �|
���1V���7���]
�n���q0�|-�[�8	��ѫ}2�I��⎥[L��b=�%�zq�Q \J
��~����lGw|
Z,߂k˷DǷР��D`���4ߊAy��9V%��-�x*�8�`u�ou�n�u�
�
��h��� ���dD�
�%�pn���{�r�O|��;?�d�*H���Qs�rq���}t��!:�	�d@��8I;�%�#��C����1.;�I����p־1�o��b\	ᇗ�#�u�&P�N��,�O��
�(��
%
�z�7���2�����C��}�/�W�O�o+��+�`���/�<�\����
�{(�F1�A�˟#L�9��}�}��0
<��*�"Z����
��@�mV���&{s�+�(ʷ�X�����U��D�m
��r$��+��7��	�ϑ
�
�%�A��)���+T�P��o�l��Yh�B��Re���*�X������
<�� c����s��']f#5�r�յ�|\�Xz��%h*o�%D [...]
I�+
��6j�7j�Ηy��Mڄ/�ﲢ͝�٥�;[~�t�
)
��?��(m.�Ք@
-��->��L
��m+�q��P?�ſ���q�7Y��C��@��=?�a�͓�C�9օ��K�˃�	�
�k��_O
JM
gO�j"5߃��B�7F�B�;���
R
8�䃂~�@�İ
-���9ĴO5�����"Z�CP#�S銅�iM8����]zq��W��fP)D�
�.���*�l:�,xԽ�K��l���
+��q�-ϧR&����< 4`euM�� jnY�6eݸ�u�������jx����U֊�+�p�Lt��d��1������
�.��sQz	����pV9H�s�X�7[H��:;�@�0D�>�q�p/�<+V���
��dk_1���.�/
���0݃��
-
���Yq�
ք�?�`1 3�q�`���B��$�o4�o2c��Q
yŕ�jc���^
�H`�P��}i5T|9����i�jQ�g*_���5ح0YXa��AA`���
I�f�8ś	�1�_N�7V�%ɓ.���S��:� �~��`���vXv*1�#,
FZ%�JN���1$�@+���M��y��<�`�~��� a_#��(�aCk�~��zg�z�=0�{6a ��8�K��=j�@���Ԯ�Z]f��;��{�cA
�d+'x2v��	ă�
	p[ecVs��N�*W�?
>�`
z�"�5��w�z�a?u�Kw�5|�@>�,���=��Uވ�P7qw��O���g�&��Wy�
�cX��q K]�9
L���2�yS#r��jU�ja�n T�o1�Ҥ�H�����+3���[`�*��-ҡV� 4�2���_ �Xs��
�q-�_�)-�lu�ƪ���2h�\��@"
��WΘdDp�u\�@*$V��\ up
-��
�OrIh�O��@m0C��SN(d�	��R�bh�a*��I�Pl4�ݡÄ���4�q�J�P�;�pa��:8����!����$O�!z!�G��y<yj31���n�K>O�hn�A.���E����#�
#�qРC�wm��2,��Ծ�a��O#���l[�^����z�^O��4����д��� �@ӝq@3-��e?TQ�h��JaU��2�8���N��F7�݅� ����������e��>��;�]N���E��2
��'	G�Q��
����E �	
����"�}(l��J$�}ٿ�/�7����F̾/AX'�
�w��&���0vD��cA����_�2�]�%-nw��r�G�M����O�8�<���D鸾�
������I��v9o�@X���������V�n��
!�5�������Ί[��(2��� �T��v�}SVY(<��[{����m�
-endstream
-endobj
-3117 0 obj <<
-/Type /Page
-/Contents 3118 0 R
-/Resources 3116 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2955 0 R
-/Annots [ 3076 0 R 3077 0 R 3078 0 R 3121 0 R 3079 0 R 3107 0 R 3108 0 R 3109 0 R 3123 0 R 3110 0 R 3111 0 R 3112 0 R 3113 0 R 3125 0 R 3114 0 R 3115 0 R ]
->> endobj
-3076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.629 707.957 406.582 718.861]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab062917f016d95800e29f87c203fd3bb) >>
->> endobj
-3077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [410.921 707.957 484.316 718.861]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [495.954 707.957 513.996 718.861]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 696.002 211.769 706.906]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.582 696.002 350.886 706.906]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [139.386 623.356 373.128 634.259]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5932fd0c6867d83e3a34d5e680225807) >>
->> endobj
-3108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [378.224 623.356 451.619 634.259]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [464.961 623.356 513.996 634.259]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 611.4 180.776 622.304]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.589 611.4 319.892 622.304]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.508 549.713 351.873 560.617]
-/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad4b80df36fc02b4c47ca160420e50182) >>
->> endobj
-3112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [355.091 549.713 428.485 560.617]
-/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
->> endobj
-3113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [437.87 549.713 513.996 560.617]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 537.758 134.838 548.662]
-/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
->> endobj
-3114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [144.651 537.758 273.955 548.662]
-/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
->> endobj
-3115 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3119 0 obj <<
-/D [3117 0 R /XYZ 89 770.89 null]
->> endobj
-3120 0 obj <<
-/D [3117 0 R /XYZ 90 721.073 null]
->> endobj
-3122 0 obj <<
-/D [3117 0 R /XYZ 90 641.803 null]
->> endobj
-3124 0 obj <<
-/D [3117 0 R /XYZ 90 566.434 null]
->> endobj
-3126 0 obj <<
-/D [3117 0 R /XYZ 90 472.136 null]
->> endobj
-3127 0 obj <<
-/D [3117 0 R /XYZ 90 312.393 null]
->> endobj
-2567 0 obj <<
-/D [3117 0 R /XYZ 90 288.708 null]
->> endobj
-3128 0 obj <<
-/D [3117 0 R /XYZ 90 288.708 null]
->> endobj
-2568 0 obj <<
-/D [3117 0 R /XYZ 90 161.079 null]
->> endobj
-3129 0 obj <<
-/D [3117 0 R /XYZ 90 156.596 null]
->> endobj
-2622 0 obj <<
-/D [3117 0 R /XYZ 332.797 77.486 null]
->> endobj
-3116 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R /F92 331 0 R /F100 526 0 R /F99 1213 0 R /F103 1599 0 R /F82 260 0 R /F72 194 0 R /F97 497 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3133 0 obj <<
-/Length 2395      
-/Filter /FlateDecode
->>
-stream
-x��ZK���ϯ�-R���ùym��خMvR9����GRE�d��x����@Q�f��S�=	v�����&h�Hh򷛯�o�54q�i�������HG���y�~bW�[F)��v�o��N��e6�O��l�E���rE'��E�HgY��g���w��w1)�Ę���o����冁
-4aA�"�&����4�C��	%���ѿ�I$p]'�n�qCK�)�M��s��3�c�T'���*/@++q^�J1�S~���f�8�j�N�`�&\�J�M�<��5�(fF�k
QTGr��H��P�G�h5q�E�N���N��iN����jp!����l65��J_g=ҵ ҊQ�kM����f��}�
w"ZPC�8�&%��3�t(�Mp���@g�K�@�����a ����+\5�gJExə�K���Ǘ_�hp+�%��䖡�F��r�L*E"
&n������9��6�*V*����w��uZd�~ժ�s���tgF
-��rN�a�W��z~��G'i����
-��-�6��ەF�
���O�E�f�U�]�2
C�JB��!\g�y=���xkv���`�K]����������Ap��
���~����5�[?�1�}��C�`�!İ�궧p��u>�g���Xhr�r��������!A>�-fA.,��
��%N5��V���:�V�2����|��x7_m����F���"��W���D�#^��o��`ĺ���8���Pѧ�ݙYb 
-�"�S��T+p�����
-?Eb���`��|ꭂ�
*��g{�H	��٧�^�#��~�c(�o�ס�
j1�P
��p#�$����p��*��d�����UN*�P<v�M:/W�Z�Uq�_�k��1+W��ʀ�&@�1��}���(� ��W�m��t�.cFB"T,�
#�H��P�b��b$v
5<!�6V�!��V��8��&Ju�0u�?zV��F$�L�!��6�n舾@G�d/�#����鈂X`N�l^$%8%eä�]CJ��H	�)KRb:��0�
~��&\"
����v��g���m�E���U��� @�C\D+sPs�t�\��\İJ���@�EFU\D�"��"
p����J�S�s
�(Di4���PG��O)0���$����T��^����!so�b�ρ�q,�Pg��*��l��}���/�
�
m�-pGhD�k�o?�wԼ�N��
�;���ݠ��k��i­�s��YJ�݋tB	�
�ԡH>"
��#,�w�o�
-9
4�
�#�a� �i����V�bQ���������C^�]y�B
�If*
��a�c�A
-"_�y���	��>����߲�ci�o�k��x_ ���phE�v���g�o�`3�3�-l�	e��5G̿���{�)���&�D��Da�I�E�Kt�K�;�K *��ǜJ���@&
���<c�� I��7�`�9�	��>f��2j
�������@���(zp�	s<��B���_+Y��Yv��!/��7�P�Q�f/3� 
G�(z�E��
��b�#U!

e�	�.:[l����~���*��^?����v��9��;3��Z(t��iEM���Չ��AԮD�;T���?��T�qhlI,y�I	�n�Q��P���-�6W�_�q
-��ɓ
x�����l��2:y
-w�c��M�
$��#��C�W1h�谳����*�E�Nf�'�|Γ7���u%��� y�
���an[d�!>p��w8b��S�n�8�+Y���E��g�W�M\��
-�B&�:"�xua
b.~
-���y�F��
-x#|� ��!X��
��a]FPI�a
5.�ED��k%Cz( �E�/�p�(>�l���XtS��N
-��b�Ta�p�#m/��9/ �����@
Y�:`�xxඕC_ 3�B?<(���$ oe{���yx8tP ��4C�y�T�Cq
ԸB��U�t\�Un�L���w
-P>�o�mw6.΋
�y)�
B ���;
-K��R����E�!�.{�G$�
�H�s�N�bq��X���,�<y�G�o��A,�"�1G4
e�<^���5�yq�4�
ψ+o� �
��;'�G:�4�yZ"
6��<5'�yZ�
-6��<
����3�Pn���ɸ8O�k͠.�C;��ڝ�!7���8_�]�D���ŵ'���Y�8#ly�Zb��v@���B�M����c���G�1	���_�l���R�2��1͏i	��iE���
�2Bч����]Ve�ar�I���o�
��b�j@]��˻�O��!�dV���7�S��V�
�G��}V��ܤX'U���
y
њW��HN�������e��w�|���h��j�]%
-endstream
-endobj
-3132 0 obj <<
-/Type /Page
-/Contents 3133 0 R
-/Resources 3131 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2955 0 R
-/Annots [ 3130 0 R ]
->> endobj
-3130 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3134 0 obj <<
-/D [3132 0 R /XYZ 89 770.89 null]
->> endobj
-3135 0 obj <<
-/D [3132 0 R /XYZ 90 721.073 null]
->> endobj
-2623 0 obj <<
-/D [3132 0 R /XYZ 90 583.616 null]
->> endobj
-3136 0 obj <<
-/D [3132 0 R /XYZ 90 579.133 null]
->> endobj
-2624 0 obj <<
-/D [3132 0 R /XYZ 332.797 497.966 null]
->> endobj
-3137 0 obj <<
-/D [3132 0 R /XYZ 90 491.326 null]
->> endobj
-2625 0 obj <<
-/D [3132 0 R /XYZ 90 348.365 null]
->> endobj
-3138 0 obj <<
-/D [3132 0 R /XYZ 90 343.882 null]
->> endobj
-2626 0 obj <<
-/D [3132 0 R /XYZ 90 229.205 null]
->> endobj
-3139 0 obj <<
-/D [3132 0 R /XYZ 90 224.721 null]
->> endobj
-2627 0 obj <<
-/D [3132 0 R /XYZ 332.797 145.612 null]
->> endobj
-3140 0 obj <<
-/D [3132 0 R /XYZ 90 138.972 null]
->> endobj
-3131 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F24 169 0 R /F97 497 0 R /F72 194 0 R /F60 172 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3144 0 obj <<
-/Length 2225      
-/Filter /FlateDecode
->>
-stream
-x��Z�r�6}�W�m���
qK�&�ٔ�
���dj2��H���D*��ƅH�,��Tv3�� �n4�����Y�����
^�K�H#-���
"�#k�<M�C�Fマ�P�h�l�Ż�7�w��������W8"�?GRE����G
M���#�U�h?ZE1ep]F���
p[��
-!�'�n��Ɣ�a��(>��u�|���"����b�tw�l���=�U��:����b�f�E�30�sЖ�rD��=ٸo=AG�y�	�6�f����\��	���c��$��
#
s7�#F�I�-�Y8���JWHb
c��W�ZlFcF��a�MJ;EF�p�O?aLS��Zż��٦,�EV���M��ܻ"}H�4��S���S��b0卝��0�(���f�vj�Pn��+x`j��Nl��lW�Jw2�$~�R�c*b�8����v�U2��[-�ܸ�_��$�m�W����$a�0aA}( �
H��c�_Ʒ�����8 �#
&�!Z
�R�:
l
��@	C���9e � �,c3݋`)a�T(����C���'��ơw�ޘ�ȗf�6�G���Ӄ�
	��Ѓ�	.C=
��U�d�a??_2�Z�
J�ȳY�5a�/��8���͈F�f��[�
����9�����%UhCD�ߌ V}r
�u_��4nu���`�#$'�>Ҳ������:4[+��m���Mn����|*uI
(�d7߇

->Fu�2'
	���ƍE�L�t�1��;�R8L48�DI l�o�����k	�`.�@�f�Ѷ��мx(�{��<4�i
�lۤ�˦+�
�x����C��� ɦn�G _
4 ,qMsx�L]�C^�F�]=����
-�Y��H�
��?�`�L�E����'d�r���H�
�
�`�DZd��/R�g��Q��d�x�'nD����C��
��y8 �-Hf���y�SHqҋ`E��B-��(ƈ�^d� Dh(�t�z�zт :T�H'#9|����R#�u?W��H`�?
-|���}�f����Pv
|���҂hc�K��	⃸���1*�>�x���i�<u
-��/<�8"Bw
� ��ҤWx����Yxa<��i�4��mr9n6�J*�|��
����O�1&��
\!_k�{�|f�v{ȧ��/�|�ߤ��q��R��q��.�ͳ�
-�4~�k߅�v1n���|�'�s�N�/Ʃ�m1n�ŸU�?��M=cB=�BvBv���WD

-5q>5�Po��ⓨ	�
ۇ`�&\�PpW9�̎��E�N�E(�djb���S�B�P�#�8�d�??W�� �;��M
	U�5$TƟgvFR�=�H�
=
�Cj,���Eh��V��I�Z/m���(�\��d�"����8;a3�5��AR��L
ڌ8�OHΰ1@ڕ��l�d�3o�`�@��x=NeJ�L�?d,?���	A�;
�؍s1
���	b62,�1߭�E��b�8�-��7��
����J�G5�=$z��8>	
-%^�d9ˁ��W��q�oRw�c[�k�;�	���X�[d��E��$p�W0��p��
&@'e��x*VqR�ݥ�p�8i��5��>�I?i
T����D�f�8�C�����:/ӗ06�b�Z����
�!�;�]-�i���}{J����#b��6�\��6򕨽�������ۛ�7?^޽���z}{{�����������,e�-�ݗ9�Il7c�L3H�;'(]�o/mC�h�����#S 1����^_�אָ��M<22�t�p1��º$4B�Z���v����~���-g2�.�N����
-�y�i�<�W�dY}8���s�+}q����� �f��:���!��@�$ 
��&�̞` ��]5�����1RxG�c'I�
A�!YBfѡ�#�����~��+�ڃ
o
�8�[��yk �
o���r�d�)K
�՝�1
��1婫�4����9���3�
�+�"�F�J�q5�����}�-
f�	��o�Y6�(�I��8-�0�n� ۥ<��ҿ3s_���1W�X���(!C���V��
XA�_��1�6��׺�/�>����E��a�f�1�7n��
( � >ٝIf�s�	�%`��ͅ�\%�l����ˬL������7i��Co÷I���g��Wc��hN(�`�	<�M��u��\O���S-����}~^��_����m�l�&�A�t������s�
-ܩ:h�F��so�/��
-endstream
-endobj
-3143 0 obj <<
-/Type /Page
-/Contents 3144 0 R
-/Resources 3142 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2955 0 R
-/Annots [ 3141 0 R ]
->> endobj
-3141 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3145 0 obj <<
-/D [3143 0 R /XYZ 89 770.89 null]
->> endobj
-2628 0 obj <<
-/D [3143 0 R /XYZ 90 634.961 null]
->> endobj
-3146 0 obj <<
-/D [3143 0 R /XYZ 90 630.478 null]
->> endobj
-2629 0 obj <<
-/D [3143 0 R /XYZ 332.797 549.31 null]
->> endobj
-3147 0 obj <<
-/D [3143 0 R /XYZ 90 542.67 null]
->> endobj
-2694 0 obj <<
-/D [3143 0 R /XYZ 90 387.411 null]
->> endobj
-3148 0 obj <<
-/D [3143 0 R /XYZ 90 382.928 null]
->> endobj
-2695 0 obj <<
-/D [3143 0 R /XYZ 90 231.42 null]
->> endobj
-3149 0 obj <<
-/D [3143 0 R /XYZ 90 226.937 null]
->> endobj
-2696 0 obj <<
-/D [3143 0 R /XYZ 90 77.486 null]
->> endobj
-3142 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R /F82 260 0 R /F24 169 0 R /F97 497 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3153 0 obj <<
-/Length 3100      
-/Filter /FlateDecode
->>
-stream
-x��\ms���_�o�f,
�A���s�sqm�t:��G�(K�D:��� H��@I|�N;�$��bw����}d��� >\|�x���iI��q>�x��FB·���P!*Fc�1
�����F���E8یH0���d�2S��7Qn�ih�އ�0
F�-™*=��������oL�bU
-���t}��<�����o���S������.pf=�̥��|	h�B!{WE�e�,�d4f���"B� ��

�c�Q�]Xwh�J8�܍��
2�S�b
�A�B��
J0
-(w�؄�I��*�iFzQ������L
�,�8+
-���Wq�M6�b��#*���HR�:�1��9/�V���A
-�ťGŘ`���BTu�-��A�L��q��pP
 GIf��K�(�!�%�B8�%ݗ�
{��t
'R"�0��&� [�E8�uk_�d�����o�a��Qe�k���U�B��wba�8��8���I4�(���P�b����z�HCX� 3 
W NX ցt��f1E��v7����|���X�"$�M��O'��8G�y�_Fp3Y���n��v
XkC�L%��$�
m��9��Y6�6���Lޖ��K��gFf���Yfބ�"ޚ
2O&�8z����nǩ�����O��x��������w�7pq�������O7�
�,6��a��7W�p�]�?\_=>\�4��A�ͧ�����_Z-�Q������
�ҷ 
���G�,�N7���,$�ާ�\7�g
	�B5�e%V���� $��m���E}BԘ
$&H��	Q�t*.Z$DA�0#M��5�DB��&!BR/+>�U?ޚ�(]o?�Q��$&B�}�K�`�T�2bI�.#�Լ��XXZ�C�X$�oB���(�P�%!�;�ɇ�1Q]ă����Pj��<L���JB�|��
0	�
:��8'!	��G[{g�ͷI���
7��h���,��pT6�y�h����?~�.g���?|�����.wj���M�5�)�nH��c�a�����I:���7J:
��ӼIG8I��%
��� ��k��0�L��'
-twL��ܱa=�c�^�k4�S�/��cՃf%��e�u�&@
"Lw��H�e��q��5i�QsR�e�⧲�RQM���2�<]��j��NS �"�LE��>��!�d٭�8���1�.Ú�
�X.�ݽ
n3C J
-	��)�r�өT^D^O
-k�	�G]������
Rs}�]z�ח�x�4�B�R��3��c�H	���T�b��־��2������C��Dž���	��A�Ca=�"n ��39��dr��o�n�6w��ޘל����H�&��eʣ8���5���Mr��!Ko�*��]43Յ�2���L�sl
s����5�Z���'�Ӧ򱳾-�Ӆ��N��*S+�%�
1��m��nmˇ�͖LV���(��I^u���\�-�M�������9e�&�LaV/��'��1�~���S�X��� ;� O��a3Y��i7��֝���h�>���9�HP}�1-Ѿ5ݟ4"�K
-���
8N93gWȫg�>ג�X��(mU�@�i�\���3�ۣ[F/޸����q�{
-����7�-i᛻� N��CCi�L���a
N�
C!�UyM�hh�ҏ���
����i��Ü����'�����J�0�`���?�iR���G�r�:#����j��PuP�?]�S�� �T����8��l �	B(/��ST��Z�r��}�!��V.>&���(��=��:�t���ѿ��&_�B��W�fq.��P�$m��b��(��
�Z ����^g#��(^/�>���+w+A�
?�.��!�O�D
-'3R��UE0`2@���	��
����P�[B���-�sh/��0��Li��V�4o�����y&Wƒy�	MV۸20s��8��l��#��9
z���OY������EP�L'i
6��s��c�AX	8�PTN�^�����ZYk��S:c�g����Mx��T2���0ŖY�/̡Z�5^D; �E�ҧ����Y��-
��p�0��ꤗ��i4`,�;P�P�+\�/Ή}�L�v6̴E��ܵ�s��
��l��GY 2���c��|�@k��(5�"����6*��*<.���[�O�s�qzpf~؂���{ꯜw��!��� c�$!���#e��&+
k���B�*�g��.J�
����x;��)�6�.m���&0U �vcN ��N%1k���^�H�Y�J����D��6�����:��|D/Z%h(:Z
E
�Q��ƣ蓿_S�
��(���x�sĦ��]���H!����}
��Ƥ�O�N%yp�I�P���}ኦ
�
|��|�?���Rˤ0&N2) [...]
-�3)��I��4�r��Ĥ��I���*6޾�z�§�:`Q��(dϢ��E!.��i�
^F��Ha�@�.��7$R ����D
-1
+ֶ��$��<�O��R�)$0��㧈��*��NG����7w?A
����N�
�
�� R��>�S<JK�~0�4��Ql�܄F�%%���b��⊶m�v�������&��Y6�K
���Y�vJ��)+�D�K��Hhꕻ��
�I[ t��@����	��y��PK����BYk�DJs04v��On~*�ڢ���EU��i74�B`��� u�TO��T�DYq	\<�\
-�I��̸�*q)<�R��a.�������)呙˗�ۛ�l�d�QΤ���� qsdl��.�W�
u��!Ϗ2D#���IK�~P���?�&������魡��21�.NN0&�4c"jVϘ��z�D�0&��1����֜1��l�c"�aL��	=�1�c"�cR�X�`�(;�?� ���
�����c�{�����W��v��&/a�_
����
|ކ�?��f���I��dޙN�m�m�'2��i,"���Ç0�����:ȯ�z����dPDu�Nj$y��wϻ�m��i�>�@���Y[:ϣ�:�e�\�Y��kET3��4[1X��.ҲI�tD�:}�
f7�ݬ��}
��'��Z��
-endstream
-endobj
-3152 0 obj <<
-/Type /Page
-/Contents 3153 0 R
-/Resources 3151 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3161 0 R
-/Annots [ 3150 0 R ]
->> endobj
-3150 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3154 0 obj <<
-/D [3152 0 R /XYZ 89 770.89 null]
->> endobj
-3155 0 obj <<
-/D [3152 0 R /XYZ 90 721.073 null]
->> endobj
-2697 0 obj <<
-/D [3152 0 R /XYZ 251.842 623.558 null]
->> endobj
-3156 0 obj <<
-/D [3152 0 R /XYZ 90 617.54 null]
->> endobj
-2786 0 obj <<
-/D [3152 0 R /XYZ 456.333 537.808 null]
->> endobj
-3157 0 obj <<
-/D [3152 0 R /XYZ 90 531.168 null]
->> endobj
-3158 0 obj <<
-/D [3152 0 R /XYZ 90 438.683 null]
->> endobj
-2787 0 obj <<
-/D [3152 0 R /XYZ 215.12 300.71 null]
->> endobj
-3159 0 obj <<
-/D [3152 0 R /XYZ 90 294.693 null]
->> endobj
-3160 0 obj <<
-/D [3152 0 R /XYZ 90 201.586 null]
->> endobj
-2788 0 obj <<
-/D [3152 0 R /XYZ 215.12 77.486 null]
->> endobj
-3151 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R /F60 172 0 R /F24 169 0 R /F83 262 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3165 0 obj <<
-/Length 2365      
-/Filter /FlateDecode
->>
-stream
-x��ZK�۸�ϯ�-R�����=m
;����J��uMq$����Iʻ��i $Ep��6��$� Ѝ���u7��E�����yzw�N�� #���O����		w���H�����#a�{����o?L?ٱ��ӻ�w�pD�|���f���_p4��?G1����K��S�����?�p�
-FT�K�S+�iO1B!^�!��O�x�f�xB)��˗Za�ڭ��9�EF�V��zIV*P���Q�
2�>'�bL�(�^�A�B��D
J0�4T#�����X&���&b�A
���;o���
�^�	�gM4��
fyVV��R�2�y��t��>�1����ՀP�*y��	Uiƣ	,d���l��a`Bd�r`��V�����y�s�,�*�q�j��;��"9b
�S�r���&զ�J��������2��1�o��
-�!�����<
�E��l
�_	�ЈKӼg�U$�;So�,��E�Z�깾(�U�l�{&�~���q��v>lq[��Yv�`���H�
-9��.g.l�{E>䕛"`���;3G�#�Q�jg��*�z�
�r0I��N쭴2�����U��i�M�l���q�>.�i�
���	�6
���9/�Wfq����lj��f-/7�;
�'�!&ExҲ�d�|0(�;)8
��u��^� x&�0G�� �����<�5��JP0%���|�F��T��[H� V�R�db�3��e2$
Obq
�V0,�@�����w�>ƀ�Ki�Oree���<�*!�#�
-yӪ��i[V�j�����h�}V�a <��	;�
O(?�����c�S�_�5�v�?�
�H���&
q��c��)�M#;�
����_A���0;w��Ğ+�"���Y�-¥��N4R�FjA����s�b���6٬Jmd�w���_1�I=��cv�����X�8����tc��3QF�b���Sr�
��ګEj�`L��܋��r�Z7� �z�G�
-�MK��������]�g)�qoK('�%gEXQ�
I��$�:@p��Lҵ4A�[�Pq~�o�M���==R��XK�ؓ�B��(`�0 P N̢��cQ�(���w�\�D�cl���d�-j���DT���Z "M���N���a�F^C��`}E��t7�P^Ss�1'P�:�`ﺜ`�	�bgc�����`��p� �<�	�[�CN�jN��;N����T
�Q\_�hA"����(�?�@����)����H�`)�y���@�M԰�@ �jl�k���?
��M�2��q���|�
� ��d7�
-	�4�
-�.2��=
�l��/a ���ZK\�W|W-
���VG��d\�g�4�
a��-����@> fux�f�_�����?�Wp��:&A�ЎR�:.�%g]� #F0F��;w��
M��U�f!7�
�W��M�$-�v��A
5
A��nˋV���f�|���?�Dnw�ҫ  �R�Nj!�;��
J�Ux?�
-p�a?�_���k�TK�����7���.��
�?Y"ϒ!�HÁ��d�3
aHNW1���D��/8b�3��

>��y�<h���ɇj�N��p�M�߬.q1�x4�nC
�`�/�m����,�������N��K
^�^�+%�2�M��K��'�۳4ɪ=��6oM6w����3H@	���1�"�ʧ�X���۶�%1?#�~ՠ�&�4��)cו�ϊ{���6ﲖxzh�Nf>U�wS�"���9)>�
�H�y ��n@�rX
��()3�a	����P
-�f?!
�*��[��fC�k ��?��ƃ]�aA�fc��v m�	�P�w^ �/����LT(q:�u��U�f�`O�?�TS at r@�W3t
��\��kf{�:1*��+G
-(���S��~�����L�g�2[�v�u�=���
*�&MLxD:go/�)L'��
#��>"0T �WE�����t������}q����l"۬�"���;:3�;�l�Cw�t���ξf�s6��Is��mI�ְ=��U�|}��A_[_ϓ,_���F��}���tN/t���O����l>Z5
-2a�d�+���ڂ�3jsNAf�Vq=lAƴ�8\�)En"
-2�3 �b�$W�)ɸDJ��J2�
�XIf��wfI�vc:Z�1����쬊L}����<�UZm��P���"@E٩��L���%�_(1Q����l���Z��/9,�[n�Mv
6t��n�p��Fh�V?��o���8[l�E=�S����8�Տ�U&ş�B�jw�g�x�->�?�;��m"���>%ImR������΅HGo
t`Z�?W������fQ&�����x�M��zٶ	�.^�E��B�q��m���e�q
-endstream
-endobj
-3164 0 obj <<
-/Type /Page
-/Contents 3165 0 R
-/Resources 3163 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3161 0 R
-/Annots [ 3162 0 R ]
->> endobj
-3162 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3166 0 obj <<
-/D [3164 0 R /XYZ 89 770.89 null]
->> endobj
-3167 0 obj <<
-/D [3164 0 R /XYZ 90 721.073 null]
->> endobj
-2882 0 obj <<
-/D [3164 0 R /XYZ 137.91 647.468 null]
->> endobj
-3168 0 obj <<
-/D [3164 0 R /XYZ 90 642.885 null]
->> endobj
-2883 0 obj <<
-/D [3164 0 R /XYZ 90 523.133 null]
->> endobj
-3169 0 obj <<
-/D [3164 0 R /XYZ 90 518.65 null]
->> endobj
-2884 0 obj <<
-/D [3164 0 R /XYZ 90 398.898 null]
->> endobj
-3170 0 obj <<
-/D [3164 0 R /XYZ 90 394.415 null]
->> endobj
-2956 0 obj <<
-/D [3164 0 R /XYZ 510.023 325.203 null]
->> endobj
-3171 0 obj <<
-/D [3164 0 R /XYZ 90 318.563 null]
->> endobj
-3172 0 obj <<
-/D [3164 0 R /XYZ 90 249.989 null]
->> endobj
-2957 0 obj <<
-/D [3164 0 R /XYZ 90 175.761 null]
->> endobj
-3173 0 obj <<
-/D [3164 0 R /XYZ 90 171.278 null]
->> endobj
-3163 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R /F60 172 0 R /F83 262 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3177 0 obj <<
-/Length 2694      
-/Filter /FlateDecode
->>
-stream
-x��\ے۸}���[�*
��%yJ���n�*';y�8#���Di%�
��� H��@J�����s t�!'�'�������
-'Ie���(n���i�|�(D�tF0Ɠ�n��~J�d������)ѓm�xL�x�]~��/�s�>�#{Ɋk����p&&�L?>|����OwB�	q.R:y��}���9|�}�3:�\\�I8e�N~���
.��_!F�־�sҴ1'm�<Q�!�ݴ`
|���Mv�A�ɡ��b䠇�_/f�5��u�F��|F3FĘD�]#��!�!\�X#c�kD�`0†��햗�I��u)��#R"C���aY�iWrn����ezt�V��}�^��M6��e��HD"���
�;��!�9"�
D�#�@j��.͟�}+�q>��z>kh?M����J���7ǭ{��\=/+����{��Ӽ�&�1��n�
��
)�O����z�"E���j�U�%�kG
-E P=�#�!J ��-�h�D��0'�.kN䯛l�
�{�q�ғ�`�݇
�$=�!�la�| ج�`��WF\��X�y
c��Xc=���f�@���;x/0�\Ģ���Zc��ĩ4CQV�g��8�-�pB8

-
I"�3,��6uX��Xf0H���)�P�Z��T��qP�#��A	\�����5�g>0:
�1�G��M��K��K�
-#%�(�C�<��M:U�¡�v
�
l�8+�C�I��s-��34�a�4�ֆ�7��	�*ys��j��v�>
����3*a�2���E�T$O�~
��~������n�g��������<���4�t�OA7qJGt�t3c at bΨ�����۬���*ˏa7��&'*7sw��s �jd��
�[�Ѣ�*.����)TM���l_�	{jF)"�,��Y䇺��t%(���&w�dp�S
r} �Y}J\�,`;4}F��:�&�%����W�ֱKg���E�:�)�)ϊ
/]���OulA����]}JV�u�)S���+a>�]ٶJ��' �P#4%Y/�XA��(&9�,n$�B��K�!g
1���z���c7��LV���L��M�7�d�
-9q�����5'ʐ�Ɠ�\8�T !a�4�:y��5
�V6k�Z{��i8=!������t5܎ș�<h~�l�
���w�����QXb3{�����U
�
�$��d]Ժ���T��c�vMLjt,v=�#����s!F";��!Kai*:��!`=a���>��6}v�U)�>|9�j��8;/��
Dž��(ωvZ�,�+�bi1���B��
V2���7�E��Y�"�e�M�7+��s�qA�U�(s��%��c%�!����Y�#`
(���
"]�y�ty3^w��9�N
��
G�c��c��t2���aLn��+�c��ǚ�-�n6ۼh�n��ζ�4��̡U0�u0��w$g�Z� �qa�=�
f�̘į`��{C�E0�0�M��b:F
V0#зyqt
-fT�Q
�vL��
w
fr��[�L��
™f$h�̸�T�fƌ���a�S2�Q(|�/��)�_�d�~~��q�S5��J�>���R�`{3
^�M��!��e,a�ļ؍�zՌu�fFAr�-Y�T���Ȏ�و���/(�1eI�#+�A�E��$+d�1z'[Uu�F�f�1X57=�,���G�E�y�C�
��j>�b�l�T^U��\�qm��
	f���
-֔�
-䃬
'��Z���1N�T�^�2L���_Y/�?/Kg���Y;&�ϊ�qv}��\S�"]���t�+*f�������烬

�Hgʌ��1�L�W�H�a4=~=�Y����9�.{ߠ�Yu�_.�\�;�/�����5��2���K,��DaŲb�SN.*���}H6�b�5J��g�C5+�!:�cm��g���L��A�vU1#��u�d�
�j�d�s
-�Z��r���&��=��p28�
�Z!j�Šy|�*>	F(�#�	C�z��yΨ�|������z����cp
-�۸�Ljk��~4I[�5��]X����
W)k��ޏ&�]�T�`蓲��.��(k+�V�`�3e��+k�녲�	S
@���2%=e
-
-̦2���5�BS�pr��S��B�'p)�2{{ng)%�� �=io�10��]���Q�S�Jyc���2�g�)�xX�Py���́Ҝ-�Z�
-���-�v��y�3��/���J,ti���Bai)O!߮�eO{Ϛ=�/ �C���}>c�uQ������o�>���5�-�e��\�,�����̙�}c��CVj8Z�y�R�4QW�H�ah�>kh��K	�n��y�@w�i�������4�c{
� k����R�x� +�JmK�e�l\y2�{t�.q��ti�~�:nځ�
��K��v at r8�(�J¡k!�
���Ư��fEm�Z,;��h]���|,���ؿ�
�vL��H�(�apTw,��jq�<h:����@*��e���c�0��q�m
�=��<�b���\Q�tj4�-j
-��;߿�޼u/��|�Z����ӆ�������C���T�IY��-�_��ID�d����G�	¶�FS{;��,+�p7�%ջ��}C�Ӵhzʆ`y<�~��8d�=o7�-��X�;%jm���f�����m
Y�25�j
-a���U� �?F�(E�+��+����6,���8���IJ�f
-endstream
-endobj
-3176 0 obj <<
-/Type /Page
-/Contents 3177 0 R
-/Resources 3175 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3161 0 R
-/Annots [ 3174 0 R ]
->> endobj
-3174 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3178 0 obj <<
-/D [3176 0 R /XYZ 89 770.89 null]
->> endobj
-3179 0 obj <<
-/D [3176 0 R /XYZ 90 720.814 null]
->> endobj
-2958 0 obj <<
-/D [3176 0 R /XYZ 90 649.083 null]
->> endobj
-3180 0 obj <<
-/D [3176 0 R /XYZ 90 644.6 null]
->> endobj
-3183 0 obj <<
-/D [3176 0 R /XYZ 90 560.635 null]
->> endobj
-2959 0 obj <<
-/D [3176 0 R /XYZ 90 476.55 null]
->> endobj
-3184 0 obj <<
-/D [3176 0 R /XYZ 90 472.067 null]
->> endobj
-3185 0 obj <<
-/D [3176 0 R /XYZ 90 388.102 null]
->> endobj
-2960 0 obj <<
-/D [3176 0 R /XYZ 90 304.018 null]
->> endobj
-3186 0 obj <<
-/D [3176 0 R /XYZ 90 299.535 null]
->> endobj
-3187 0 obj <<
-/D [3176 0 R /XYZ 90 204.893 null]
->> endobj
-2961 0 obj <<
-/D [3176 0 R /XYZ 90 81.969 null]
->> endobj
-3188 0 obj <<
-/D [3176 0 R /XYZ 90 77.486 null]
->> endobj
-3175 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F83 262 0 R /F60 172 0 R /F97 497 0 R /F72 194 0 R /F7 3181 0 R /F24 169 0 R /F8 611 0 R /F13 3182 0 R /F11 610 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3192 0 obj <<
-/Length 3095      
-/Filter /FlateDecode
->>
-stream
-x��\I����ϯ`N!��V�K�
EN�V
%��d�Db��� 
p�(�>���l�@�ʕ�
 xK�[��������
��_�=����^|��� #���?�
�)n���k={?�t�����#�����o?޿�����w�����;��8z����vw�?��.r�ѳ��C��
��ٻ���aO�B!M;
-�q�<�(�r�$�y�
K���p؞jC�AD���Nmj�N� �"•������vA���&^g
"���T
�"X�B
J0�`��O����i�E��?��:��Hc~
�F�0O���'�ikxJ��TsD�o�C'�h��Yp���j�qnpLS���<l�.(
���`���#4�E�4�.j��7�D"�=��d�yby~9��Kj�`�%
��H?Y��l!��;�A�J��8��?��P*˶:q��{x�O�cA�<�/��#����m�e4c�pޖ��
�$i
e��}(�5��4�D1�x=�ml�z
�dL"��MV#��>.|p��0��(L�ׁɅ�����R� `�Ƌ���D�x����*���Nz���"�$X
�֎�0+Oi.+�����`D�q�
�X�G�G��رsa�T��
�`.d1����qܳ8?ī�c��lJWҬ
:6�*O
0��T6S�l����
���)�quϤ�#<�.����N\�A��⯞�O
!m�6��(���!���!I�5�L�Qvn��)� #�_��fH#
��Ry�I�J")�L�'��3i�O��4ؖǕB [...]
,2@�,2�s��IX�~2|О�-9et��L�v~�a�Wj��0�4dRXB���L�ne.St�]Ɖ��'���j�o�������C_jq�
9��RQ�(�fH�������������8�a��$�������z�9K�6g��ihǶ|��õ
��0x`�-�\P>��P;O���Ĉ
� �h	���r2�����-�v�u��wI��\�����j��XOJ}l&�Bwp3��fF��f67P(���f���T��)a�ka13�;Z\	�I����U�	��*��� H���K
1�X.;͠
�LO�͠/�p���n�Hʡ���D��I���&w�ރ	�l*�8L�f��� �
-�>�jL&��q�Mރ
*v6��
�]���
.fН�f�D��f·�C�N\��a�
���R�Aw��Bw��K��܇�]���
�N��ss����v����x��qҏ�qm�w�����\�8-��v��}�o�Y�NH:[����+�{B���
�O"�I������Π-��-�1�%�H�A�mؙbH�
�g�i���WS��*��J�:�
x��^��F�
ڞ�Cg���Mc'^ɱ��B�,
�H)�hY(9L3,A�Z ��Ni�q2æm˼:�+Wܷ�c:��D�l�����&�Ǣh
���F���-z
�5\
��.vc�dL�.
ɴA�L}�!�tf_y�v��c��2��d�mXc�枹,9#c_n
���`BA,}\C{��������D��b*�!ኧ�hCB�{=,�!YG���
��M��yeT�J��7��,¡0�%w��A�&
-X�B����ahc- r
��3�rk�� ��C:2،C:4� t0
565�:����t�.�AM�a�~q�e�:�]k��
-�Q�x�P�k���;����>�t m��|��
-=�t08o��]D:�y��9�C\�tH3�`�	���mB�@:���N�}�8��(��>aEouUA�H���q���'��H�`5}� ��c_N�vf�6��M�
-G#�E�c�̰e�2�6�1\q�Z at n�����jgkf�S�� 
��
��):l��q@�pu|S0�4
;O�v�$IantP��h�U��8�a
�e~u�c�澹���E��_sM�
g>�a<���~��U�ВN�9�w$�6C`�Hn���9��豋�T��D&�Њ�e�h�4��T�M�BSϴ�������==>�	\�����&�v����	�+A;��-����?��{(�i��%��s
År�(
�����Z��`��*���^�ԯ��)�
l�	���ߞ�#�si7���v� 9x�b�κ��Z.���,4�v����|���V�l��O%Ͻ{"
-�͔iHHMw
e�$�:���t�4��W)���2�Xr�aq����TS|����O�P��põ�z���]
������V
-V-n�2�0$n�k�GY}YH�>���%'�M���!C>�{�'���n��c��9r�#�R	��
I���L
k��ޚ8{�N�=�c����C���EBΩº�8	hl�W��]�>
E(�A����=�[���yj�R"���5fm
�O>,�|�7pG�����!z�̊_�(
q׳���,1?���ײ�I^D�'�F˲ׄ��i�&���ur�&��cq�&��ѯ��2�]�T	�=�H�>��x��
-�B��8.�]�\�i�)_
�ڐ�3�5�'k͡���V�ti���˜��I���*`-2�y���h^���ѝ�Mt����'��_NU�k��[�q��s��9���T������a���c��!�b �8��|�%k�K�2ٞ��Ҟ��h�;�����?��7 ��8�Z��͊���������f
�%�[6
�.����0%�P��y���;y�o������_��8{�H�[X��?�8��B�y�0�5J���Ŝ[���nma]��D2>��jJ�������]�*-��m�Ժ9
�{����S
�Oh�ߝ�
�7���?V��w��
G�Z��h�Q�����H�
-endstream
-endobj
-3191 0 obj <<
-/Type /Page
-/Contents 3192 0 R
-/Resources 3190 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3161 0 R
-/Annots [ 3189 0 R ]
->> endobj
-3189 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3193 0 obj <<
-/D [3191 0 R /XYZ 89 770.89 null]
->> endobj
-3194 0 obj <<
-/D [3191 0 R /XYZ 90 634.093 null]
->> endobj
-2962 0 obj <<
-/D [3191 0 R /XYZ 90 550.009 null]
->> endobj
-3195 0 obj <<
-/D [3191 0 R /XYZ 90 545.525 null]
->> endobj
-3196 0 obj <<
-/D [3191 0 R /XYZ 90 450.884 null]
->> endobj
-2963 0 obj <<
-/D [3191 0 R /XYZ 90 379.153 null]
->> endobj
-3197 0 obj <<
-/D [3191 0 R /XYZ 90 374.67 null]
->> endobj
-3198 0 obj <<
-/D [3191 0 R /XYZ 90 280.029 null]
->> endobj
-3026 0 obj <<
-/D [3191 0 R /XYZ 90 204.771 null]
->> endobj
-3199 0 obj <<
-/D [3191 0 R /XYZ 90 200.288 null]
->> endobj
-3190 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F72 194 0 R /F60 172 0 R /F83 262 0 R /F8 611 0 R /F13 3182 0 R /F11 610 0 R /F7 3181 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3203 0 obj <<
-/Length 1927      
-/Filter /FlateDecode
->>
-stream
-x��Zˎ�6��+��
d8|?�k�&H�i3Ei(�fƨ-;��`����d�ٞ�ЦE0
R��\^^�s.�4�Jh�b��bt������N..G#
QW�����&g�R:^��L8
�7��l3av��?lӫ�Wt�2�f��t���_�ˬ|&�˟�jl���ū��O#h��"�&����{�����l�|h�H.�.���_F�m�
�#��u6��A)����*v�.C���
]���<��Z{��8ݮ6�����
�Xa _�r4>�&��7���8�_9�0j�N�|;Ϸ�w��o{�)G�����pʏ��g��S�Cms���HS~�R�ɳ	c��=���Q
l1|&c�g=���At�(�b�7��~�U+�m3��D)7�
\`=I�q��=��&�l��Dg�_dy���;��c�T�$A��)��2�TѰ���#)�����P�	/r�z�X⨪_Ģ�!g�kZ�~�c�Ӹ`X��8�K����~���CNmM�>
���L
��Pc����
b�c��C�6�"�f��!�Ty����8UD	g����bVL�3�44X�\aٗ�B��<���� F�^�/}��f��}2��U픢g
~H��E�W���I�Y����|��F_�梲�A
�V
iq.��̻��J	�ym����t[���&+�F��v�
D}�1�	�`)��g��y�Q��~2�Eת���"���u�t(�X�iw6_fy�f��	����	N��qVc���XDt�
&:����=|x$�ie�Oqu��B
��X������訋�CtR�!�(׹��
�l:1㛩�Ǻ���-�
�o(q
7
c;F	� ��	h�������0���4�{���Dh�I���n4G�l�%�cp��B��1�q�<a��I��x�(���)��f�� �s+��t��e��8�I����*!�l�w��5ߵ̯���K�+���qi�m���Ĕ(��x��xU�b>��"�ԑ��Ͽ�&�}�?��%)
ڍP����k|�r�OC+/W���ͪ�A���>,��{��[_��J|�}��\_/4N���KXmZ����:���m�'�P|��jZ�庶���i5��Y
�(��#t�Ϊ���t�-B�/2�b�ݩ�F�pΠK���
���p��%����#P��Sª��0��^� *#��Q$
�w��rτ�zgI"���
�fA
�q���a�fdÉE7B>�F8t� �Ք�b���r�~D�������֧�E!hnˑ�f��U%�,c}Ӑ���j,�XP�շ��ó{9"B���rDK�)9"���h��ݺ�#�*�[�E���E^�<�*F�����t' [...]
-� ��ἃ�͠H��y�4�is�󐐠1�g��}��ӷv�;5�#��
-_aO�9��9�=��sVC}��Ya/���<Ʊ��|�!��^��
-�k��U�-I��H����>���$V��SF�{�4
-�����"�#���g=�\�h7.�Tac�X
���-8� ����#|dzB�Z4��"��VƸ��u��a�d���վpv�*�n6+�I�VD��0G��q([nNU��IH���0S��4�~�
�2 ����h�P_)㎔Q9�{̟L�⮇���Aj�
�^8�%����7o^�γмN�]z��O�M�W-g~+��7�ƕ�?��.����K�d�m���k�x=H�o��gܟI��qT�]c�ߛ�n�������󏻫"˯ȴڢ���yـT��XE،���V���m�qY
}#ub���(#�O�18��
e�<��V��Y�X�p�r)��W���<�ߕ�?
-endstream
-endobj
-3202 0 obj <<
-/Type /Page
-/Contents 3203 0 R
-/Resources 3201 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3161 0 R
-/Annots [ 3200 0 R ]
->> endobj
-3200 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3204 0 obj <<
-/D [3202 0 R /XYZ 89 770.89 null]
->> endobj
-3027 0 obj <<
-/D [3202 0 R /XYZ 245.416 711.11 null]
->> endobj
-3205 0 obj <<
-/D [3202 0 R /XYZ 90 704.59 null]
->> endobj
-3028 0 obj <<
-/D [3202 0 R /XYZ 332.797 625.36 null]
->> endobj
-3206 0 obj <<
-/D [3202 0 R /XYZ 90 618.72 null]
->> endobj
-3029 0 obj <<
-/D [3202 0 R /XYZ 90 461.393 null]
->> endobj
-3207 0 obj <<
-/D [3202 0 R /XYZ 90 456.91 null]
->> endobj
-3030 0 obj <<
-/D [3202 0 R /XYZ 332.797 375.743 null]
->> endobj
-3208 0 obj <<
-/D [3202 0 R /XYZ 90 369.102 null]
->> endobj
-3105 0 obj <<
-/D [3202 0 R /XYZ 90 211.775 null]
->> endobj
-3209 0 obj <<
-/D [3202 0 R /XYZ 90 207.292 null]
->> endobj
-3106 0 obj <<
-/D [3202 0 R /XYZ 90 77.486 null]
->> endobj
-3201 0 obj <<
-/Font << /F70 192 0 R /F83 262 0 R /F60 172 0 R /F82 260 0 R /F24 169 0 R /F97 497 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3213 0 obj <<
-/Length 2589      
-/Filter /FlateDecode
->>
-stream
-xڭZ�s�6�_����3k��)����7���{���!���-�֜-���4�� )Ytdom�KD� �L<YN��?o���y�cOR�*�&w��4�$"%R��|ri1�|�ӄ+Mh�`��}�뇻>�����w7��P�'ԭ�$ѓ����s<ɡ��ILx�'�v�f"��zr{��؋&��/�f�QJ(u$0�0��tF�8����Θ��s�m_�E�"�����S�1��� T�$Na��)����)�1�?�+��i���v��q��Z��L^O����u
�d�0�DP�/\�!NE���ƔM�4_�f��քŽ=��
��'�q�����Ng:2��,Ț~%
N�H�@�cڑ0�k�
�
#��1�n�0���q*�If�'��M��ڕ��ޗ�Y���n�����ک��Ո$�
’^��SGG�I�~%�Q��1[
Ә��Z0�sF����YO�8��s��p�_��ק)�#S�c^a�yL� 1�wV�!	��7��ʦ
��	�����|x��
����KӚMw`�
�����@�G���G�Z�*����NiGqW�i7�U���r���vm�TF����¸"�'�H"�8� �)�&�b��]զYU�|lO��{���sĤ
�,�!=�Y9�D�I�
-��ԧt���̋�"�e�5j�el+)�B�
.����'��f��&�l7�Š�?��0��4����-��:��=UQ[����x�ݔ�4�
�?���8r[�����-�
�f=��ftg)�\��o��~�&�����N�'T�Y�U�~7Sm���

*֋�Q�W�hݟ�� Q��j�I!�`��h,S�E
���u�a�!1
a*�$݇�1� �^=��I �059 �,�-�\��p�4AhQVg�p�4jBz�߀���az�hL�`��+E���[
)`:��&\'�(�o�ax�
�&�|�!M���y#�R���!�,	Y�Y�p����U�zHyhA�)�Ǫޘ���Tz���mp9��B�^��YV+��,"
�Fj
H���Q_�y��Cη[�(�
�Ί���Πy�D����܏['irr��g
�MKp��R�_��Y=�p��3������kYws,��"��
2������4��ÏP�g$Ey �������
�#����G��])�yH<W�!�`��;�@�f�"�q	=->�E!?D�6B�/��i���
�E
ǁ8dh�(�
�]���=�����˖��������ݶU
Y���4�\���pS���Ùs�D�a��E8�����&��)W�vp��,V�:8A�
�mF�/���t�q8
:���Qm���
`�W�u~(�{\ao�+;��
-[�����Z\!���
x?7sO�M���L�����f��\DɯÕ����z�UGqu�q\
:\q�"���K<
|���U��ʧ���t����[�G
���
�u�8�eCqC�č ���\����R^��]��"N�
�JOK�1�7.A�y�ԨU_�:�
y��.���j�b�~�θ�Q�C�ck[!tj��Rp���g�����V����U����5l
�%T�
0\w"I�$*=�%κ9ǫ�:Z�P����8��?�T;f��bgX���,��xB���}�j����6\�An!��l�6~��Z76�UJI��SV�r�c�K��i�E
y�P��7:
_�g�С5|�
-�'e����6����9�.p*�
w ö�	߬iv��w^��ò�
�
����uT��/[W��9D���E�~.wY���s��$�Љ�n��0�*v<����p�

mM��p��E��6z�`D����+j�7�,������C��~w��
��_���k�;O�
q��9�6]��λ�@�=a�< <0�PLՉ�̽�f�A��t�AӉ��Um��Յ#��
~�
�x��o�B�rE!VR� �������MU��߀�Eј���o�~+ހ�&Xa��U)���C��0�K�M�ag0��S�S��Jz�`�����|~@	�(.�����W��1��
˻�$}�"������,x"�����@G����$r�9ǂ�EB��졐����k�m_�v[��ckU,W]�
�]W�����l����n�����̏��� ��T]Z��j���F��j,%B�
�ɴ�}Ԩ�l۽wS
�����(�.�oZ�|���ij
b)���}����N ��ֹk��
��{
-�?�~l/�OFSXW�C�}�_�
�M�~�Sov
�?���zțGd��zQ�r�'�r�ns�����Q���Ǒ}��Cp��hyi
��կ
�TD
7~yP�ͫ�n3(g@�cUw�+��
-��+ƺx�Ǘ��`�9
-�H*��Z�ݝ��h���6x��`��ھ���_>1&�Y�3��E�
�H^�L{�j�H��_���a�J@[����H�88l��n��x�~�'���؞�
���;S��L`��88�혆�����x�>�d%�K?�����ۘ�oSH�������l�@�>;ۇJbwf
���U���_���ol�2�[3[��IȪm�߾};�-!-_��{6�������_ at zڴ�#3g�Rrh���t`�
-endstream
-endobj
-3212 0 obj <<
-/Type /Page
-/Contents 3213 0 R
-/Resources 3211 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3161 0 R
-/Annots [ 3210 0 R ]
->> endobj
-3210 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3214 0 obj <<
-/D [3212 0 R /XYZ 89 770.89 null]
->> endobj
-3215 0 obj <<
-/D [3212 0 R /XYZ 90 721.073 null]
->> endobj
-3216 0 obj <<
-/D [3212 0 R /XYZ 90 622.696 null]
->> endobj
-3211 0 obj <<
-/Font << /F70 192 0 R /F82 260 0 R /F97 497 0 R /F24 169 0 R /F72 194 0 R /F60 172 0 R /F83 262 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3291 0 obj <<
-/Length 1301      
-/Filter /FlateDecode
->>
-stream
-x��Y[��8}�W�Z��I���Fk��Ap Nw��V�VڦV�E���_��V�¶[>A�9�%��M9��k ��#1F_��=�����/�$đW�
8�-�rd�}�k��m at X����� �'�ͷ%$E��� ߂r�l��D"��?];S7�����6 �;c��
*� D����׸������#^Z	>�E��>8�d���@$�B��9�	����P�����&Z��_�����3����b�2-�5�f$?.ĄYL� �2T�j�/��u�3��6HU
б�'�j��>��5�2��f�������92��w�Vk���d����jtU��?5�G�
��c�o��f^�!�L�L��*�.�t5�*s�6�����e*3�\.g���s�F����:���
7xoQ�q�2�V�'��b�{/��L�Y�	����]�!˧ճ{��"�N(�O�$]�2@�H�ԪH�޲�i��bE�P�<�
�z,*����[Xee��V�L���p�) �
-T�*�#��ض��G��3�cz�p�>�>)�}l`K%̖������thjņ���O6,îk�>Y3�̔���Z�󅘻�[l�s���I
�P��.+�Ng�5��$q–[����6������k
:2���"н�o1-uh_����LE�
�:>aU|��H`�3w�ҹ_�Y�6�Q�Հb}��4Pg�	j~�.��7 �E���X*���.w��lQ�-�BƼ	qR�����uo�]�-Yg�����p�q^9�~sJ|���b[��2|}�w'\�ņ0��r8�&ա+��ނ~���	<�e���:\�C����Q"а*����,�; B�(�vP���3����7�Ɩ�ɠ���[e�휵�th��(u��	��j�kG��,;\ʦ2��V͵r���
�S^�Ntf��[����T'}e�̈́���M֬	��V�
��k=�r�NUn��v��5��Qz���Hv堉�%��:d�?�]���=n�ZЉ)X����B�WD�YZHio����\:t���i��H' [...]
���FS`8��nT�ؠ?�t�)�юr� 
�Ev+�������^�S��O��b�g~�lY��g_S��Y���<�]���aR�� 򒄸�̋m��k� ���E��
�7�7�u������X�8
-endstream
-endobj
-3290 0 obj <<
-/Type /Page
-/Contents 3291 0 R
-/Resources 3289 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3294 0 R
-/Annots [ 3217 0 R 3218 0 R 3219 0 R 3220 0 R 3221 0 R 3222 0 R 3223 0 R 3224 0 R 3225 0 R 3226 0 R 3227 0 R 3228 0 R 3229 0 R 3230 0 R 3231 0 R 3232 0 R 3233 0 R 3234 0 R 3235 0 R 3236 0 R 3237 0 R 3238 0 R 3239 0 R 3240 0 R 3241 0 R 3242 0 R 3243 0 R 3244 0 R 3245 0 R 3246 0 R 3247 0 R 3248 0 R 3249 0 R 3250 0 R 3251 0 R 3252 0 R 3253 0 R 3254 0 R 3255 0 R 3256 0 R 3257 0 R 3258 0 R 3259 0 R 3260 0 R 3261 0 R 3262 0 R 3263 0 R 3264 0 R 3265 0 R 3266 0 R 3267 0 R 3268 0 R 3269 0 R 3270  [...]
->> endobj
-3217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.191 671.54 192.146 682.443]
-/A << /S /GoTo /D (page.18) >>
->> endobj
-3218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.577 648.806 166.533 659.71]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.81 637.522 269.765 647.708]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.396 625.52 265.351 635.707]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.253 613.519 274.208 623.706]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.177 601.518 289.132 611.704]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.291 589.516 264.246 599.703]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.886 577.515 254.841 587.702]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.253 565.514 274.208 575.7]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.755 553.512 289.71 563.699]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.898 529.556 187.853 539.742]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.583 517.554 215.539 527.741]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.202 505.553 253.157 515.74]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.89 492.834 213.845 503.738]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.89 480.833 213.845 491.737]
-/A << /S /GoTo /D (page.24) >>
->> endobj
-3232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [166.193 458.099 178.149 469.003]
-/A << /S /GoTo /D (page.27) >>
->> endobj
-3233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.571 446.815 189.526 457.002]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.59 434.814 184.545 445.001]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.59 422.813 184.545 432.999]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.59 410.811 184.545 420.998]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.609 398.81 179.564 408.997]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.773 386.465 279.728 396.995]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 362.508 184.525 373.039]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [148.222 338.895 160.177 349.082]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.116 314.939 159.071 325.126]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.322 302.938 301.277 313.124]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.116 278.981 159.071 289.168]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.935 266.98 265.89 277.166]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.58 254.978 272.535 265.165]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.281 242.977 264.236 253.164]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.264 230.976 295.22 241.162]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [152.655 207.019 164.61 217.206]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.312 195.018 301.267 205.204]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.502 183.016 266.457 193.203]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.377 171.015 265.332 181.202]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.702 159.014 242.657 169.2]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.156 147.012 268.111 157.199]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.966 135.011 198.921 145.198]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.154 122.292 306.109 133.196]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 100.393 140.809 109.24]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.909 86.335 293.865 97.238]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.913 74.333 236.868 85.237]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.711 671.54 451.666 682.443]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [462.954 659.562 474.909 670.466]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.446 647.584 495.401 658.488]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [408.428 635.606 420.383 646.51]
-/A << /S /GoTo /D (page.34) >>
->> endobj
-3263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [460.721 623.628 472.676 634.532]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.435 611.651 389.39 622.554]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.974 599.673 394.929 610.577]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [456.02 587.695 467.975 598.599]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.181 575.717 454.136 586.621]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.874 563.739 450.829 574.643]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 529.444 402.939 540.348]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 505.488 414.555 516.392]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 481.533 414.555 492.437]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 457.577 414.555 468.481]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 433.622 414.555 444.526]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 409.666 414.555 420.57]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 385.711 414.555 396.615]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 349.8 414.555 360.704]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 325.844 414.555 336.748]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 301.889 414.555 312.793]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [402.6 277.933 414.555 288.837]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 253.977 402.939 264.881]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 230.022 402.939 240.926]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 206.066 402.939 216.97]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 182.111 402.939 193.015]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 158.155 402.939 169.059]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 134.2 402.939 145.103]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 110.244 402.939 121.148]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 74.333 402.939 85.237]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3288 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3292 0 obj <<
-/D [3290 0 R /XYZ 89 770.89 null]
->> endobj
-3293 0 obj <<
-/D [3290 0 R /XYZ 90 684.655 null]
->> endobj
-3289 0 obj <<
-/Font << /F82 260 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3366 0 obj <<
-/Length 1309      
-/Filter /FlateDecode
->>
-stream
-x�͚]w�8���ܭ���$��9�t�Ua�����ɡ�*;�؀��~�
�V�J�V{#�?���A�� ����v�Q�&j"��4 �-MT;
��6j�p?	�D
H�S�j
{���BMwk��
R�Yն0
-k�?�0f͟ �Z[x�
--(�c 8��k`�msH�(Iŀ�����P�;�ic����n�tnl
[�1tsH�u���d�4E):��;�ѧF*���R/}����������}]n���pq��c�;�w ���~N���
9��|��m��"�7D;p����n����Eo�;�<�g���7�`c`��c|�_*Z+�6�}dYӻ�K��
˹�c\3`�����������&�m����ƴ�O/~4)
�:�5�y�b�kW�\�
^�fX�����
���9d��$IuB?�
-�~r8@� ��ܡ��
 8� [
I�{�
IJ(v�ÜD#�Gq���gm^S�\�1b[�6S��KV��vɔpq��6G�1��1�o@�^�A���ʺl4��ל�$%��8FiW�Բ�z-������s�:�%U�Cr$�J�C�U�yM��Օ}�
?�*:B�CN-������ �zK�8R�
-(M�-i��L���(��(I�)�GV.�
�h|0�I6���}x��K	���!��/��,K��<b
l�ٷ(mkr@���Ѻl<K��M�KZ�w�� Ԯ ��A�K{�Cvs��>
-PFb
��e�V���l@/m��x���<���T��-{ F�e�XG9�#�[��<�����D���TҏG�������H�
9����8q0O���2�m�J��-[>�Z1���/�
���tv�e��Ӕ�)�asU�_9� �8Kg,�ev�>B� �Q
&�
1X�y�1�d�%��( ����z69|�
�����a�Eq���&˒&9<�
&W [=�E�:`B.�u
V����x
�Y�x\U9t҉���e����
��������Z�l��g���l8�&�NO9{�2�;�P5�܋�����>���Co�]�^8����G�N�,�2N7�
��� �Q9�rF J/��s�翱NH�~-�ꏓ�Ǝ�ms>��҂/� P��<�� U���*��q{���
-eޭk
[��h�
�����0���=���h�2BY��L�Y���ςˍH�T��m��4YPZ�{ʝ�⽌e�/h�Cߋ&�l�ό�=p�7$Pgsi�t��[CQ�Iq>�"V�߿�ko~$�vIl4e���pm��se�_�F��݆"Ԕ厓i�������OM�Q
n�h�hUZ�V�_��
c��ÏXc����
��N�0�
-endstream
-endobj
-3365 0 obj <<
-/Type /Page
-/Contents 3366 0 R
-/Resources 3364 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3294 0 R
-/Annots [ 3295 0 R 3296 0 R 3297 0 R 3298 0 R 3299 0 R 3300 0 R 3301 0 R 3302 0 R 3303 0 R 3304 0 R 3305 0 R 3306 0 R 3307 0 R 3308 0 R 3309 0 R 3310 0 R 3311 0 R 3312 0 R 3313 0 R 3314 0 R 3315 0 R 3316 0 R 3317 0 R 3318 0 R 3319 0 R 3320 0 R 3321 0 R 3322 0 R 3323 0 R 3324 0 R 3325 0 R 3326 0 R 3327 0 R 3328 0 R 3329 0 R 3330 0 R 3331 0 R 3332 0 R 3333 0 R 3334 0 R 3335 0 R 3336 0 R 3337 0 R 3338 0 R 3339 0 R 3340 0 R 3341 0 R 3342 0 R 3343 0 R 3344 0 R 3345 0 R 3346 0 R 3347 0 R 3348  [...]
->> endobj
-3295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 696.002 198.074 706.906]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 672.092 198.074 682.996]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 648.181 198.074 659.085]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 624.271 198.074 635.175]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 600.361 198.074 611.265]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 576.45 198.074 587.354]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 552.54 198.074 563.444]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 528.63 198.074 539.534]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 504.719 198.074 515.623]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 480.809 198.074 491.713]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 456.899 198.074 467.803]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.503 432.988 186.458 443.892]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.503 409.078 186.458 419.982]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 385.168 198.074 396.071]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.023 361.257 196.978 372.161]
-/A << /S /GoTo /D (page.21) >>
->> endobj
-3310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [146.01 337.347 157.965 348.251]
-/A << /S /GoTo /D (page.35) >>
->> endobj
-3311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.048 325.392 222.004 336.296]
-/A << /S /GoTo /D (page.36) >>
->> endobj
-3312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.878 313.437 184.834 324.34]
-/A << /S /GoTo /D (page.36) >>
->> endobj
-3313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.079 301.481 283.034 312.385]
-/A << /S /GoTo /D (page.38) >>
->> endobj
-3314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [211.314 289.526 223.269 300.43]
-/A << /S /GoTo /D (page.38) >>
->> endobj
-3315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.993 277.571 188.948 288.475]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.454 265.616 276.409 276.52]
-/A << /S /GoTo /D (page.41) >>
->> endobj
-3317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.689 253.661 216.644 264.565]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.368 241.706 182.323 252.609]
-/A << /S /GoTo /D (page.44) >>
->> endobj
-3319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [262.77 229.75 274.725 240.654]
-/A << /S /GoTo /D (page.45) >>
->> endobj
-3320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.005 217.795 214.96 228.699]
-/A << /S /GoTo /D (page.46) >>
->> endobj
-3321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.684 205.84 180.639 216.744]
-/A << /S /GoTo /D (page.47) >>
->> endobj
-3322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.56 193.885 297.515 204.789]
-/A << /S /GoTo /D (page.49) >>
->> endobj
-3323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [226.248 181.93 238.203 192.834]
-/A << /S /GoTo /D (page.50) >>
->> endobj
-3324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.927 169.975 203.882 180.878]
-/A << /S /GoTo /D (page.51) >>
->> endobj
-3325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.111 158.019 216.066 168.923]
-/A << /S /GoTo /D (page.53) >>
->> endobj
-3326 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.237 134.109 217.192 145.013]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3327 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.237 110.199 217.192 121.103]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3328 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.237 86.288 217.192 97.192]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3329 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.312 74.333 197.267 85.237]
-/A << /S /GoTo /D (page.55) >>
->> endobj
-3330 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.426 707.957 442.381 718.861]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3331 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [426.69 696.002 438.645 706.906]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.401 672.092 430.356 682.996]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [418.401 648.181 430.356 659.085]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.475 636.226 410.431 647.13]
-/A << /S /GoTo /D (page.59) >>
->> endobj
-3335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [427.108 624.271 439.063 635.175]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.046 612.316 437.001 623.22]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [409.175 600.361 421.131 611.265]
-/A << /S /GoTo /D (page.63) >>
->> endobj
-3338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [367.472 576.45 379.428 587.354]
-/A << /S /GoTo /D (page.64) >>
->> endobj
-3339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 554.597 357.291 563.444]
-/A << /S /GoTo /D (page.66) >>
->> endobj
-3340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.244 540.585 493.199 551.489]
-/A << /S /GoTo /D (page.67) >>
->> endobj
-3341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 516.674 423.153 527.578]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 492.764 423.153 503.668]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 468.854 423.153 479.758]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 444.943 423.153 455.847]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 421.033 423.153 431.937]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 397.123 423.153 408.027]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 373.212 423.153 384.116]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 349.302 423.153 360.206]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 325.392 423.153 336.296]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 301.481 423.153 312.385]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 277.571 423.153 288.475]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 241.706 423.153 252.609]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 217.795 423.153 228.699]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 193.885 423.153 204.789]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 169.975 423.153 180.878]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 146.064 423.153 156.968]
-/A << /S /GoTo /D (page.78) >>
->> endobj
-3357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 122.154 423.153 133.058]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.273 110.199 403.228 121.103]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [506.281 98.244 518.236 109.147]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.134 86.288 512.089 97.192]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [498.46 74.333 510.415 85.237]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3363 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3367 0 obj <<
-/D [3365 0 R /XYZ 89 770.89 null]
->> endobj
-3364 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3418 0 obj <<
-/Length 1117      
-/Filter /FlateDecode
->>
-stream
-x�͙_s�8���)x;3s!a�I�K/ms��w3i�Q@ƚ� B4����Kl��`;N^�,��O��]��jH;��
��;Hs
��D�L5i��5l��vx�������6–�,ƕ7�N�;8�
�:������5?
�~CZ �4dX�X{(���i�5�n�<���ڦ�9W*�4��q���Nu�
~E���1
ٯ%R�"���|��
�6�Q}�R
-?G ݵ���S����.�E��-&�wV�eB�l�DVjb�9����
�p�>��`�F���7�zU^4ˎ�5�� %��<9�6���0G��tE�ѓ[j[1�:&
-뼐
b�zYJ}�<f"��mP�/�a��W3/M�P{
ᘋ�/YDX���Q�vP2�^�y)*�[Ndu&�Ӕ�*sy4�x(v˼B�� kU\�k-�3���X?RѰ��Zy� O�*��c��L�F/%�̘���M ��`�}L���.6B1
��
3��h��2�󏢋I�%VR$��V�K~'�|�HO��
-lZ�VW�mF�f��2&T�o�o}��<P��	�����؞
f��y�Ho�F�9�H�$h7�Y�H��;A�!Mt
�r#Qn-���Bpŋ竕X�R�x��ӭ
�����
�tx���QdO*9�����*͕7ͅ_�e�z!he��| !�g�QG�����WکL�Lʜ	�A�<f�ŭ
�]�
gtM
m��vᐝ�sؾ��o��8���,>��:��~�.A
���WPB
,J,� �t��ɋx�T؏���Ի���d�1Z�2�ղ�
-܌)/`���/S����B�n5�D��a�L��k�@�����<��@v���ud�KYښF�7}�-�ɫ�Zl�D�7�A�aԃǘ	��x��{/������Nآ%�]߶�SԼE��rv}s��SOi���V� ��?���ŪCs]>v ��V�c�渁�c��c��c�n�3Vy�X����%aNC֬p�ũ�a]�u�_���=̪���iT��"�_@�����Y 熱z���kM��ƜC�c�0]�9��)��v||����'����8"�;mr}
��jq�q���栧����A��X
�~?@��O̷˛�����"���
�|�?��
-endstream
-endobj
-3417 0 obj <<
-/Type /Page
-/Contents 3418 0 R
-/Resources 3416 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3294 0 R
-/Annots [ 3362 0 R 3368 0 R 3369 0 R 3370 0 R 3371 0 R 3372 0 R 3373 0 R 3374 0 R 3375 0 R 3376 0 R 3377 0 R 3378 0 R 3379 0 R 3380 0 R 3381 0 R 3382 0 R 3383 0 R 3384 0 R 3385 0 R 3386 0 R 3387 0 R 3388 0 R 3389 0 R 3390 0 R 3391 0 R 3392 0 R 3393 0 R 3394 0 R 3395 0 R 3396 0 R 3397 0 R 3398 0 R 3399 0 R 3400 0 R 3401 0 R 3402 0 R 3403 0 R 3404 0 R 3405 0 R 3406 0 R 3407 0 R 3408 0 R 3409 0 R 3410 0 R 3411 0 R 3412 0 R 3413 0 R 3414 0 R 3415 0 R ]
->> endobj
-3362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.308 707.957 246.263 718.861]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.03 696.002 258.985 706.906]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.6 684.047 285.556 694.951]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.844 672.092 297.8 682.996]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [258.916 660.136 270.871 671.04]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.206 648.181 297.162 659.085]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [150.991 624.988 162.946 635.175]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.45 612.316 309.406 623.22]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.599 589.123 179.554 599.309]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.177 576.45 289.132 587.354]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.994 564.495 281.949 575.399]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [268.34 552.54 280.295 563.444]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [282.168 540.585 294.123 551.489]
-/A << /S /GoTo /D (page.78) >>
->> endobj
-3380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.484 528.63 292.439 539.534]
-/A << /S /GoTo /D (page.79) >>
->> endobj
-3381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.003 516.674 276.958 527.578]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3382 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.713 504.719 175.668 515.623]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3383 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.717 480.809 206.672 491.713]
-/A << /S /GoTo /D (page.80) >>
->> endobj
-3384 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.023 456.899 196.978 467.803]
-/A << /S /GoTo /D (page.22) >>
->> endobj
-3385 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 432.988 198.074 443.892]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3386 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 409.078 198.074 419.982]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3387 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 385.168 198.074 396.071]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 361.257 198.074 372.161]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 337.347 198.074 348.251]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 313.437 198.074 324.34]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.503 289.526 186.458 300.43]
-/A << /S /GoTo /D (page.23) >>
->> endobj
-3392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.165 265.616 276.12 276.52]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.165 241.706 276.12 252.609]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 217.795 198.074 228.699]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.119 193.885 198.074 204.789]
-/A << /S /GoTo /D (page.34) >>
->> endobj
-3396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.717 169.975 206.672 180.878]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-3397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.717 146.064 206.672 156.968]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-3398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.717 122.154 206.672 133.058]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.717 98.244 206.672 109.147]
-/A << /S /GoTo /D (page.77) >>
->> endobj
-3400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [194.717 74.333 206.672 85.237]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-3401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 696.002 423.153 706.906]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.646 672.092 492.601 682.996]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.377 648.181 415.332 659.085]
-/A << /S /GoTo /D (page.25) >>
->> endobj
-3404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [390.984 624.271 402.939 635.175]
-/A << /S /GoTo /D (page.24) >>
->> endobj
-3405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.646 600.361 492.601 611.265]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [480.646 576.45 492.601 587.354]
-/A << /S /GoTo /D (page.19) >>
->> endobj
-3407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.377 552.54 415.332 563.444]
-/A << /S /GoTo /D (page.25) >>
->> endobj
-3408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.452 530.622 395.407 541.526]
-/A << /S /GoTo /D (page.25) >>
->> endobj
-3409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [451.605 518.667 463.56 529.571]
-/A << /S /GoTo /D (page.25) >>
->> endobj
-3410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.6 506.712 406.555 517.616]
-/A << /S /GoTo /D (page.25) >>
->> endobj
-3411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.579 484.794 393.534 495.698]
-/A << /S /GoTo /D (page.21) >>
->> endobj
-3412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.706 473.556 407.661 483.743]
-/A << /S /GoTo /D (page.21) >>
->> endobj
-3413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.213 460.884 387.168 471.788]
-/A << /S /GoTo /D (page.22) >>
->> endobj
-3414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.198 427.011 423.153 437.915]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3415 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [271.299 44.211 348.609 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3419 0 obj <<
-/D [3417 0 R /XYZ 89 770.89 null]
->> endobj
-3416 0 obj <<
-/Font << /F70 192 0 R /F60 172 0 R /F72 194 0 R >>
-/XObject << /Im3 187 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3420 0 obj
-[329.4]
-endobj
-3421 0 obj
-[631 507.9 631 507.9 354.2 569.5 631 323.4 354.2 600.2 323.4 938.5 631 569.5 631 600.2 446.4 452.6 446.4 631]
-endobj
-3422 0 obj
-[611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 351.8 351.8 351.8 935.2 578.7 578.7 935.2 896.3 850.9 870.4 915.7 818.5 786.1 941.7 896.3 442.6 624.1 928.7 753.7 1090.7 896.3 935.2 818.5 935.2 883.3 675.9 870.4 896.3 896.3 1220.4 896.3 896.3 740.7 351.8 611.1 351.8 611.1 351.8 351.8 611.1 675.9 546.3 675.9 546.3 384.3 611.1 675.9 351.8 384.3 643.5 351.8 1000 675.9 611.1 675.9 643.5 481.5 488 481.5 675.9]
-endobj
-3423 0 obj
-[777.8 722.2]
-endobj
-3424 0 obj
-[571 571 856.5 856.5 285.5 314 513.9 513.9 513.9 513.9 513.9 770.7 456.8 513.9 742.3 799.4 513.9 927.8 1042 799.4 285.5 285.5 513.9 856.5 513.9 856.5 799.4 285.5 399.7 399.7 513.9 799.4 285.5 342.6 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 285.5 799.4 485.3 485.3 799.4 770.7 727.9 742.3 785 699.4 670.8 806.5 770.7 371 528.1 799.2 642.3 942 770.7 799.4 699.4 799.4 756.5 571 742.3 770.7 770.7 1056.2 770.7 770.7 628.1 285.5 513.9 285.5 513.9 285.5 2 [...]
-endobj
-3425 0 obj
-[513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 799.4 513.9 799.4 513.9 543.7 770.7 777.7 733.6 847.5 756.3 656.2 804.8 850.1 449.3 566.3 870.4 699.4 992.9 821.6 782.1 656.2 810.6 777.6 627.8 599.6 699.1 599.4 970.5 849 596.5 699.2 399.7 399.7 399.7 1027.8 1027.8 424.4 544.5 440.4 444.9 532.5 477.8 498.8 490.1 592.2 351.7 420.1 535.1 306.7 905.5 620 497.5 515.9 459.2 463.7 478.8 371.1 591.4 499.2]
-endobj
-3426 0 obj
-[539.2 431.6 675.4 571.4 826.4]
-endobj
-3427 0 obj
-[500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 277.8 500 277.8 277.8 500 555.6 444.4 555.6 444.4 305.6 500 555.6 277.8 305.6 527.8 277.8 833.3 555.6 500 555.6 527.8 391.7 394.4 388.9 555.6 527.8]
-endobj
-3428 0 obj
-[500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.3 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520.5 465.6 489.6 477 576.2 344.5 411.8 520.6 298.4 878 600.2 484.7 503.1 446.4 451.2 468.8 361.1 572.5 484.7 715.9]
-endobj
-3430 0 obj
-[500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 832 667 667 667 722 667 667 722 778 389 500 667 611 889 722 722 611 722 667 556 611 722 667 889 667 611 611 333 278 333 570 500 333 500 500 444 500 444 333 500 556 278 278 500 278 778 556 500 500 500 389 389 278 556 444 667 500 444]
-endobj
-3431 0 obj
-[513.9 799.4 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 513.9 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 1027.8 799.4 799.4 1027.8 1027.8 513.9 513.9 1027.8 1027.8 1027.8 799.4 1027.8 1027.8 628.1 628.1 1027.8 1027.8 1027.8 799.4 279.3 1027.8 685.2]
-endobj
-3432 0 obj
-[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410]
-endobj
-3433 0 obj
-[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
-endobj
-3434 0 obj
-[500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389]
-endobj
-3435 0 obj
-[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410 319 230 319 479 0 0 0 228 456 410 8 [...]
-endobj
-3436 0 obj
-[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
-endobj
-3437 0 obj
-[556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444]
-endobj
-3438 0 obj
-[556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1 [...]
-endobj
-3439 0 obj
-[638.9 963 638.9 963 963 963 963 963 963 963 1222.2 638.9 638.9 963 963 963 963 963 963 963 963 963 963 963 963 1222.2 1222.2 963 963 1222.2 1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 1222.2 1222.2 963 365.7 1222.2 833.3 833.3 1092.6 1092.6 0 0 703.7 703.7 833.3 638.9 898.1 898.1 963 963 768.5 989.9 813.3 678.4 961.2 671.3 879.9 746.7 1059.3 709.3 846.3 938.8 854.5 1427.2 1005.7 973 878.4 1008.3 1061.4 762 711.3 774.4 785.2 1222.7 883.7 823.9 884 833.3 8 [...]
-endobj
-3440 0 obj
-[472.2 472.2 472.2 649.3]
-endobj
-3441 0 obj
-[277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8]
-endobj
-3442 0 obj
-[222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500]
-endobj
-3443 0 obj <<
-/Length1 1549
-/Length2 7050
-/Length3 0
-/Length 8075      
-/Filter /FlateDecode
->>
-stream
-xڍ�T�}7N*)HO	i6J�;���6��!�(�%%�]RJ
-�� !���!����������y߳s�����u}������c=
Yk�%T	���� 򚚪   ���XY�0�#�o=��������C
	��1:�	w��:@ ����E�v�#� 
-7�5@��w���X��O$������#�݊ }��;
 �E¬ � M�ꄩhq���`P��R�Kء�1>>www^����������v ](
-�t�Z~AhA������v0�_=�
�
��0
-G���	qu��"�� =U
�6�����_܀?��xA�I�'�W"���`���	q��9�l`�P���/��
�8[�r�8��x����8�>:�$��`����B�h/
-��
#߯4�6+:[�Ý���hѯ�)��P+L�=��
�������ds��������
sq��*��������B� !��#! � �����U 쉀�6�~�1|�p��
��b~��Q7( �t��z������Y��P[�3�?�1j��_2f�H���� ���ϓ)�a�pgG����O��������rrp�7� ?��_ E �0���������1��t��Q���U�
-L��F��������Zp
�� ��oZa�@��[�;�������_���'Rrut�mg����c�8�
=�x`��,�&
�"���j�k�5��0W�����!�%�u���$�
�KC)�<�֏ah+�����405
a���p��Ń��dž�=+�����/�YD�������U��9���ֿv�_H A"!�DJ`$!�7���P�ߜ��:�ј �/��$�5h��|�_�ߢ0?���ׅ���t@ ��3�� �� |���� |rC~��j��� ���/v����_�(�����/pV�H$�oVb��-��}�P����J<ؾ&���J�Νg}Xo/��	?�p��Gq�|%^/+sV�Di��dfߡ%�r��8}�V�T�)x�ä�i�d;u}�=��}B�`��	�a�
��+d�c�(�NBik�
=V��5]���(��
���j�wVgjPы|���n���

�{����E�j�ID�V�u��3�x�J�征�y�n��Qjn��� [...]
� ��p�Y���!5`3�R{n�d
-V<~k������uA��F�
HO%]pY�z2��9���R�op2`�p��_�Z0/\H2#$ƽz�F�l���s~J��k���'ѕ�^�
 �:�K�=R�^K�uP��y�:)[�4���I�d��Ms�ľ����q�&��EV�C'S�4�U���uj���3���T��c��� 
-ZJ�܈��J�ޖඡV����r˽#4�v��;;��d��-����/IIP̮Ձs?��wu���WĈ�3��{D|?#Z6��ޣ���t�787
�1�$/���#�.��e�s�N��D��P�z��O�<��%2Qu��I�f�+A-����^�g��,{KM���U��w�/��Y�|_"樭�x�Q	JE�G�4sW(ڗ��
Z���݆���F͖e:�	�`��5r=Ͳ
Ћ
ƾã[���խ�6̉��.�_�ᣒ��M��=
�g��,i���"��,!
��b����%��G�A��V�4U����H���k�����P~S+d�X��Zr��2퍛�\���[��j��OF����;�ܜ�ݑnB��%��E�U9�!�udw�F[龱�¯�}Ճ���UT�o�o�
���� �p���rܕr�_|�-�Y�(�����y����Kƃ
K����^
-:��h�ھ;[�M�Y�kZ4ǂ����gi�K�������ca:%�5��E_��tn�3�#,7?Ȉ�v�c�B�ؔ�٣��.C�bϊ���� �"�����V��$��&0\���Z�S�z\8��q��`�:��~���~�a at 5ϒ����˯�O�����C�TR�5�5���tjĶ7����O�:�Xh�9��U���Ǯ<3�����ח�����aS&@�i���Ws��V[m��>H�>��OG�oT{{D�+����_��:�㴍���r.�'Q��ou��
-_-'���e�CB�Q�'��c�}�n�G~�^[*��g=�3�tK��f�Z
�>S?�$$ט�k~�&�ڟ<e�F�s�؆FG��J`������
-����mv�����i�wԺ�T8�:DZ�
:B�����,5|����
ȿ�;��q�ӾzD%t�L'�4͝�oN��X:��o�ZK�bCO�x�7y{V*�Y��I��������̆]Y
-�"�Q,?�}~d�oT�\�l��ݚ�H7Fd������В�e����
����&�I���x?�)R\Q��R�������q?w ���z�xҠ�A�S�=K��쁫��#�7�L�{���_7	;iJ�d�8�.b����s��8��ڶ<��So�I�T���@T��x�|G�76��ho���8 
���
4~�	y��x��
�����6�o��Yo�HVx��v����Z7�k��&,~��^!��A��4

K2�y�P�7�R���k���&��b�I�	�A���
o,�7"�rZ�Tw�F�9���
L�CI��o�[	}� �"�"���P��!����g�V�G]�FԷL�^�
~���!�ܚ٩�9�|L����h��֘����E�*\�E��<�e?�
��
*�jK^���#�^
c)�+!��ዌ�"�$Gu�Z�f�W��
�
-MQD�I>�-	��T�9K�ط��j~�9��i��Mv(\9�x��X�� �h^ �pc��i�x'97�.��iB��<�3�7�_�A��d>A�������ї���Z��������#�Z�S�6��+��O���S��{�G
�~sW��Sv�d���b��^����i�
��+�"V�sa:�O
r+	�q�돣Y������[�]�.X�"��@�d"��rЦ_�3���4jɲ��#2y�V�߾�7pƘ�G���x3@�
�v��J�-�xYI׾=���
�w�UU��)�y~8�+��g��\���g�6]!X l�I!�H�XK�Tb��8��
���K��
G ������ib��[_̇y��:�i��|�V�����d�Y�ݧm�ʌf���xܩ
ʌ��C��7.��d��Ih�Ө]��U%J�|����,�� Zݹ�s�Mb]~�''+��k�A����
����a�{Q��.]l�?�P��g�N��@���5�
|��B
-�p�_iAZS#���LTTf�L��ů~=�l�w��8p��
��e"e�1�\��&#!$�<��5
(��N�v\��)IXl�%�
@��r8h�m8��x�&��c�
-�"i
��S��p���<��h7��)}7(�O�\Ag���*#u?n"�� ��ꢉ��xuT>��|{�/
ʣ8J�
� ����!�V��q�Ɵ�.U�U��E��p��9�Cy�V�G�Q�i�p`���b�LeK"�
��2��P,��AE�
�9�xh�vB���S���`_'��-����+��^(
��olv���.T�
�y��'%{U)�#�D;^�]i��nԢ����%�1�Q� ���}�G��� E�Kz�����<ރ�k����#�+2��Ԝ��AY���
!�b�X�i��
-EH[��cG]�%����“��P���m
4��'>Z��8K����|��K�[����\��zqW��(��E �[���6j~O:w����J��N�~I|v
0)��L����5�qf�[�^���>@�`�1ۮ����ϋ�
X�>�ܙ��)
cn�Њ����TI���C_w
l
-˿~�l��9��=�ə��(����};�X28�����$G����e⛃w��
{x���N�����+ÄX�2����XU�A�˭������r�)��-lwOӥ)��y����t6�B���cq�#p�` ihgλ����&H���
v����=ު�)J��
-/4�7E�񝾷[vU/�e�/�T0�.
��v��cLX�B4o��ӳY_7�a7�FR?AW�!�#4ا���\��
�-���m'o���]Zh���V�X
-i�C�����h��E���mA�W�����hn�.|���ƕ��a�E���fe��@
+̩<�g�K�AD���UEX�

-ܗtU<��JL!`�Q�����
h<_�Q]?�GQ2�5,]��ن*'|��담�埸l�F��.�>��n&/���YE)���
�H�A���R��o�Б���R�L�2|�~5� %�|'6�I�q��.��c?�k&I��kių
u��
�Z���|�	
?!��t4��B�
k糑��2� �zN
�\$���,qy��Ho_<���Ev[����ᕥ������n\�sv|��Hh%U�L�/�M��O�� �Rڕ��$��X��@V�(��9qBNWY����V�+�>����O8t=��bq�=�Fyg튙	ZTh�sf��8V�~o���
-o��6���ܠ���T_��R�0���r����q�p���̇��Y�T�'�m��ڗ_w��X���uL����$(<��T7iX��!���]�y�$�����B�a��^1�����
:|J_��17}i	���=ӂ���Io���>/n)�#{���՘f�T�<^��J���d�j�`Α�������Cߦq`��m�KX�%e�4c���
�b���qCy��3/�GzH[h
K�����U����(����djJ���E�e�g�4�[h�0��j`�@����v�6#ǒ��uR�$4a�vN��GMaK^���OE�=��	�?�R*ǴE�Ce}��4!^�4#��0�~[����E��Kam�0{��U���/�
-xob��荟z*$�t�t2,2g����\'��s��Z,��w� H/���W-
�x �/+ö�)�����x >~Ng2���z��؃8��k���QÞʈ�����=�Jۿ9�];�0)�b�u���:����h��SwL��qŃX�'�-�ƥ��o�Q�U��a�
结��{�Fz�m�k�+�$_5IH	�h��U���+=Vz6�&Ϙ|#��DB˳զ�.BY����D'm ��L�|E�5GCd���թ�9�)8<��a�[%Å��'��r��삕�go�S}x��4Hoցo���z�����d^�i�ӆ>�(,W�z�9�#]�ٱ-�D��6 ~T*��,,�9ul���1�������&;��Ƣ���y��1ז�T�>�h:n�� yбq���J �
��4�x򒉓�MЏ�⮹�3�g^p������Z�2\R�g	l]����{_�>�h��-�L���Y���
-|��P���,$F �5��cUh���E(�ؾ ���G�����O�4��
ڊ�+S��k�L���
���ab}���\?n��׶v\N�o�y�r	���
-#g�h$��Ev���VmK
-�5���#�p�ofܖ��4���y�O����V����"�ڄ�%���,<��?uS*R��jw�G*�v<Q��'�B�

��8��CiX��-���+7-'0�
�ͦj
�����-����<���R����c�_�����Z7�Z|Ty�\�Z�<�?�
-���:EG��a����`�н�Z�WA�����K��p!eN
��J�ŷ����&�lW�o#:mf�p�q��څzA$�e�q�Իwȍ5�<�\��:X�d
҄o�7�Y&�=W��Ыڼ'|�}�
-~�s5�1�������5o\X�e��sd�[z�Ե ���T�`���?�ྂX1VV+�MJȽ�
M����}�5RΥ��Y�s���M��My�mDW<i���&Đ���8z^k��
-��<mP��4��(#�噅���ؼ����!������q�t�w�ďF��.�[<Y�0m�6t���3�l;w�~닂�3r�so��+���4h��8����-��zc�҅�"j��c�cau�p�N�c����8���1���-����x�\,vR���/����Ws�"�<-�<���~z�&�����,�q�j6O*WN39/\�~�Ɇڒ�$MJ�.�*�r����y�#��_��f6�pՔ!�"30��C�Ϊ&�f��������3��=��>� V��F�R%	
���|^�t<Z��(��l����<�����[��	��e���������u#4�$�e9��X���D
O��V�k�wC+bۋ�
q�>�
V�#�@��~W�����s�N�*��*J%�{��k�S�j�#��m['�t~��ޥ����RwM�����]��4�p��@B����K�vo(�
���*j��4��ۮ1�����P�*�5L��勫V���H�:s
�*�'�yIm�(򠭠��-w��h [...]
-~M̔*�봿u�C��1-��\�E;a�-t$�R8�b�\�(��ݭ�O$��Y��j��ˬ3��l6'vzX8��Q}ґ/Mc�2�hV�`���B�Ap�|9�:��!����i+.��C�ܹ�iQLzv���-�e˾�o�k�1V s�ۈ���B_��
��
|��C-���ۉ��ylC��Q3:��g�
̾��
 
襂,>�9��x|����5
QV��T�a6���	���
�1�,�����]��,��腝�����͌Щk�&0c�.�9�AM�H� X���F4ھɕ�����5�U5�j�+�4K5�E�܋Q�ba�4%h�. �vx��hHֈn&�_:>��>���&�+�:,���
��ρN��0![�z�[�qL�ǭ��c��sRr]��/�
-e!L�4-䥾͗�sk(b��M���R�����\�m��
��.�[O�M�"���+o�wq\%�u�]�z:�����2�X�
4Y��W
�N�~��d���c�vJ��%�n���`�
�YHu%+��H�N���d*��w���`d�Yx[2�A#�v���k�+v�e^')��~lSl�A ���@4�z���˗�n�y������X����Ֆ�v��V
0�X���(#����>)���jx������´@�K�)ć^����K�鹩S7�*Œ<! ���5���5{�E���>���ָ���X/�ll#34�?I&/r~�
�['�|��#�Բ\b���fr��}�2�>͚��L�q�ϭ*��~[?�~���:���O
U�[��� ���:-?S�CE▵oL�
tHC����l��b����G��&�yl���=G�'��
��Da5)%��
i��.Q�����w
-�W��
�V�3���ޮ!�
���t7o\C-~zko�IDV���I���
����	O����g��Z
3�4w̋���E.�CR*�G
-N�
��S�bcS�Ib�ӫ�G���9�h
-endstream
-endobj
-3444 0 obj <<
-/Type /FontDescriptor
-/FontName /CYTIHN+CMMI10
-/Flags 4
-/FontBBox [-32 -250 1048 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 72
-/XHeight 431
-/CharSet (/e/greater/less/s/triangleleft/triangleright/u/w)
-/FontFile 3443 0 R
->> endobj
-3445 0 obj <<
-/Length1 1422
-/Length2 6267
-/Length3 0
-/Length 7233      
-/Filter /FlateDecode
->>
-stream
-xڍtT�k�/)�")
2t�
]� �)
� C�C��4�H	ҝ�!
�H+!!%)�|������u���޿g���L���-c���)"(n0H
(���,
��y@ >ff=8������ ��
-G"�����

�B��!(��:Tqs ���`!1����D�vD���!�p+�:P���0�!��\�6�(t���@6(;,**��;
(�s�C!�:e
sDW�B
��H(
���W
-6	[�I����Ã��ʃt��d�z�Q�@
�+��
f��q��A�C�
Գ�����"�Q
�p�CaWt��
-�D�*�5�`�?�j
���
��O���%�#~C�P���G� ��0������ �~9B
\��x�;� �D;��
T��B� ���
-u�;�\y\�� ��J��e��
���@���O
����݋��d�H��_�5
ae�
����>��S����"�GgCA"��"|@�3�	����^��	����F#��qB:�� `~pk������\�`~>���o� 
Z��(�%�� �';Z
��#��������A�~�9=E��
-�p�����|yUU���8� ��MV�	����A at 0X
F����?����[����蟄�k$
��}y�p��l�
;��%4�h.Àl�P�$��?����
����,�/��wC�n��l�����w���Me7z-ԑ��@���!��*�ì�n��mUFA��!��AS�,�����*�=aVZp�������
�B���8�(�l譃ڣ_W���� ��D�
�/�^�����"�~m#�����"@-	}�赵�y��;���D�C�h�~@k�
��1���@^�_��DQ ��o�_e�n..�>~������ �A	f��P�`����*�Q	ܽ�S#>��<3|T�„�r�nfƜj��lX�̮]C��4����j-]���	7��7:˸������ �)�F�
�dهb�.�Z�Q�:nKY���2���t�$x��)
-���h�uTe�Q D
vVtPM��zk��T��+��Ͽ�0�H�xŠ*�vF�Qyo�o�����3*P�=hm�)E� ����4X�%��.t�~u���1����{BQ�Zz��6�X��z��� ���
���u�B�N���׾�V.�
��
Ra�j���ߗ�z��w��T:��W �t�`��W�����b�˦+	ֆ�h�0�wH��Xv��MJ�Eu�$|��8ˏL��~r�gE)U��A!{i����Y2`\n2�
.���>Ӝ'r�<���WTT
7S���Á��j�c��AD�ˮ��{i�z��)�Y����8��IV~���u�3�f6�������_�+��V\��Y,��:9S��-Z���X�6k"sW�ً;c�����װ����oO���}�
R�?0t �k�z��&ѣe��|D
��2t�,
$
-��-��i$L���'����t�\b�+"�Qr;����r�@6~�F���h`B1�]�� ��
-�(�j2_�E X6J[�Y��oUVb���~�G�����&��
4���֭��-lyAo�D�ױ/�-
�\/�
�V�
DZ���{KN͂u�>�8��5O��� ���}n�%�a�G���>�m�1e�8X��[�(�#&�bpQ���4��
-m����
+�fV(*�h�~��s�L�=��Q�zn�:�(+���W��16f��Q����cQ�u�Ws���2�N�`�����
���!N}
�E��8���>3���
cwy����q�ɒT/��Ez��f����\��L�K�+o
��5!�¸$��
p�XT睛�����#D�f����
,0ܔ��ۥ�Lh�lF_OzԿʡ�5ED����(j�	)ը�E;>~bt#��e�|�!,gR,П�e��!�2
�ո�T��e���Xĸ�$�mJg:y�Ҝa2�p��Vx�]g<2�A�N���F��
3ϕ��w�
)3�1
-:9�2��v�1^vS�m_
O�V�p�Rg�q?Q�}wv��m5�R�a�|�Z����3�fn����H��ef����E�D_hK(��e߾��������n�ߓ���&� tF?M%�����zn��Ⱦ�ιgHG�ʧ�ug�ё���ܘ�ek�IQ��Һ�.���I6���"AK�q�f?� %U	�
�3��G
�O�u���
A8�)N��s�7�1�!����?�7�T��6\���*l�z�
#�i�F}o�"H�����e˯S4�aS�
hx�P�,
��=5U}y��T�R�G҄x�~�(�qJ��s$
l��\�zT셇L��
-�Ұ�H	�<?
�Js�;&+�
�$��-�>r.c>x�U���sD�bP�=��Pٞ�3�qk:�����n�+N�NfДw'�.DQ�9�
V8�bTƧ��uj*y��-vz��5�|�#auy�I�zs
&~R%S��nZq��m��e%�{�پWX)'�Fr\�L��tt��T�w�DG{�id�:������
6,M6T;�I�,���n�pN��D�>k?"�j&@���2u�!�1A_��#H�Y�M���Z�H���n����B�*� O��O��$�M��	T���������Uh��4�5�d����
-�o8�<?cy�S̺Jʐ-j�`Y�m����R'�nUU��Ρ�ә:3ͽ�}"�M�.NR�٧M@����lW)�l�=ሢ�J���i=,x<<) �B���$M��ө���+Jw�9���KX@�y�Y4i��i#,H}�=��z)��~����g���X�z0蕾>%vk_��)>�w^ƬA�)��}9���Y4~G�	ڔ�S͛��aQ�@��7
^U�Ŭ�P�v5<��q�Ә�- [...]
-�}.�wTq*:�S�Q*c瓻��
2_���&��>�u�*2Ar3����� �ǯ_m����떞[$WN��Qe���D���
��{
aG
-�'��(�)�� q�eO�=�Cܿ/��.�D��QC�h�
��8�U�����[G����W�_���%p[�
�{����E	=�͑�R��W�ף	�'EϠ���mГ��w�iQ�N�.l���
j�<d
$�hO�˜[�I�y��=nT���R�҆1G u{(ׄ��'��
���;j���c�X|����&�~�P h��
W�^��φgh�jh��#�qُ-^�(�Vۘq�K}��IΎ|���V	Tc�m�����b����(�G�bT��h�;R8���:ϓh#��_]�$�Ī�=��Ğ;�0��/��|��gyWc]J���u
�/_�
��W��<��)�Nt��|�{��]J
���/Ŋ�e��=C�PS�v����z�f�����U��[9��dcǬ�;;�/xH
f\����$i��f�UH^O|�����ʍ�y�6Ē�\lK���,�W�����@e=ő ��6���h����1{fʚ�=
����'�B�w�jEN���d�f���<��O�����<��W��y�
X?�'ؒ<�t6[��?
<��� Y�Z��mq��ӹy8ɶ�
-.���{ֵ�=�c'�q�VaDi
V9����1�����쥮f�M��-���Q��hV�Hh}������x����#�U�TxN?H�
-x/΁����3a�?�
-��w��+C�DprJD�U /C��>k���u����g�:�>�c�N^q��hڠ�gh���,H�~�
�oN.�;3&�����j���
y�W'J|:#E�<���P�X�ܤ
�{%>�QE�e�!B6��6�.��t�񃇃~���k����-�����`uv���3��Z'��ܼ$��m���kh��²�]sێE�j̃h�Ô������o���
��K8�=+�u/�>e�n�^��q8�^�ep�����B�oƨO��r����C�+�M��}�ݗ�}V�,�]
�ֽ���1��b}�9��J��X�i<ͺZD�q�z6�g���
��2�A;z��r\��י3�L�AH�ê]I��N���c6
\��sJ
*~
��I��z�@o�c�c at F������<G���*3w�u��ԗ)�\-�^�a��E
�[���(`����O�S���h�� �0����ܒ��I2�Zv�0�z��X�Y�I�~��Q|�Y*����5sh�N̽t>w���
���ӱ6�z��*`�9!�姹��6VD���z��JI���r<��=/O�&����l ug)�	V��OM�<���D�xsH�g�����~m��y����x�6}��Kzs�3��VTK�bN<�x��wfS�1��.���KE�SЪJu¸�Vzv<e�.FN�ج�
wE��H����:[��-	�
-�)ʨ�oX��uݛO��iTS��"WX��o���D��Z?E�+�����l��7�Lē�R���/'I6���Ζ>\�~�W� ��{�w��ɽ�	gq��zG�2�Ԍ^�ܦ�ʡ��
-�[?��X:7[e��˞+�bg���t��X
��Z�nE�G�F�'��0��E�&�O��x7�� 6 at +�i�0�{��ÒMh�/\jj>j�{N�t����#�� �K�>��tb>#R7���x�x,9͘���O&�oϊ*�8��
�qob�S�-V��o��=�[��9tW]W8�|�?o�8k��wN"�H������d6�N8Jٵ{Vݵ�oc�������	H�[�7
!�����lޕ�7R�Q��c��d�Ȥ��_.���V�"Ξ@A�P��@%k�N�+8}.Q�Vצ:G��`���%��'?�ջf��m�?)-2
�'�y�?�X�E
9yZ6�߅��4@����(
���G�q$t�o�-�#jǸ�cz5?�p7�_�?�**}u_.��,wŎ�b}IqŦ���x�̡
6�������ct�b�߻�T�z:�Κn~�I
.�Q�2�h�T��G�}��:���
- ��h�m
��Ih�e��,!I�r��]��#��a\C��tv�J�W��{
3�T�3����I��/�p˼Zj�wQ��^(��
KW�j�
P�y��A?g��8��iE
�}��jQ_|�:;x�g�ވS
�qs1�|�ƥp�a�F�r՝tЗ����1���ҫ���#m�7Y�dw����7�������q>�d;�	�
-6�y�������
�)\�����2����ޕ.��f�k
-rU��K��
�T��:��M��
�
iDX�Y@���N
�ZT�:,�<ש+;�n�o)�|;Q
���Z�m޲�4�������э�)R�b�A�P�D�&F@;"c�1(@���Xc�b���
��|��!2H����]yn+^:����|G�GE&�
��O
�
����y_�nK�1�%4톼m��~Q�
�4��
�
�`)Ħs�ge�?�Y�f�`,%{�ų��U4d��>	���u~��y 9㍪tb���w(z}3�Í�J}��L(�k���&�L��K������I�j���j���sDu��>��Dt�X�v�l��ť	�o��7�@�A<^Z k}4�p�O
���lH�~��M�e]�<��f�H�������r�s
�K�U�{�t$m�S����bx��q%�md���̋�37N(��ql1
���w*��VJ0�y8T�vM&��Řnz��bx,H����h�"���o�q�f#�),����	�yo�ph��JlXҫkv���jqq��_���`
�����`���Y@��'F@1T�5��c��Lb�T��+��!�9Q'��%0����Ѣe�w�d%3��?`��k�fFO�����Ԥ<��Q��<xE�/�Z�~�
�Νn�����v�I
�0 ��#��ud�[�E�������`.�ţ����:� [...]
-��-�]�L�ߒ��e ��hT.~J�٭����VHx�OS;x� ����j�XTw�4y��й��_��Wl;d�c����
D����=u{��u��S.td�ץ3�]uG#]a@�>K�t-�0
{G��v����y\�Y+��co�̤��(��cTi�.��z�[���҄�Aˎ�y�
�ޠ��zc�����߽wۜ��|J���j��ݹ��T��g�#�����=�)�W�4X�O/� �q�{3���1��38�Γ|fΪ_$�O��������>�u�C�1�x�d&;9�/�1i��i0ϴf�%���/�tk���9$���e��؃�����]�K�s*7κ������5��
�M����)��w���_%�S~.<���E:��%�='
-�v�m��eb��k���j�j-u86)e�۠N��g�
�%���#^�'
0a}Q��vC�G^�� �|F����@	�fՑSV��c��
l!Pr_5�-Y?���D��#
���H����㝄���_�^������X�
-|.�����w��<kv0��b`9�	��A;�	��Cf������tV�
霨%҉,�Qض����yY
lH��
���4Z���k
�:zx�8�O��
zK��{����͡r���Gb[۶0�R�[I1���Rz�D?�1�
C�)�]f!��z(LE�����^������u��~�$�L����ozi�4.�D�a�u��^�ɛh�#?캣�RG-��a�p�|�]����/��#J$��;#ᣵ��v`����tw���R��/w���O���
��tnG�j=aVDYr���syy)j
�6J�*
�0>mI�:q��Q�l�$42Zie�wC���L���SFa Fw���C�Y[�2�Z|�k���}:y}���c"�&`~��ft�eQ�i�w�t�̠�Db�.�-^�� B�B3�JqG���5���x_c���t���wR&�:
�O��I.�fe+
����P��
-endstream
-endobj
-3446 0 obj <<
-/Type /FontDescriptor
-/FontName /KJFPML+CMMI7
-/Flags 4
-/FontBBox [-1 -250 1171 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 81
-/XHeight 431
-/CharSet (/s/w)
-/FontFile 3445 0 R
->> endobj
-3447 0 obj <<
-/Length1 1569
-/Length2 7412
-/Length3 0
-/Length 8449      
-/Filter /FlateDecode
->>
-stream
-xڍ�Tn6NJ���8�F�tw
H
�F�����n�N�V$���H�H�7������|��9�s�s_�}��X���d��`E8
���
�ih���@~n ���E����R��]\!p��8ȹ�A�N
�@�i�a U7(���+$�+,��@ѿ
�.b y�;���
P�����,rp'/��
u��G �;�WTT��w8@����  �
�u�
-Ѓ[A���J�&n�@8���xxxp�
]��.��� ��
v����� 4A��?ȸ�Y �v�?z=�
���P�把p�Y�] ��z*� -'0쏳�N�_��r�����_� ��� ++�����l P0 at KQ����`ֿ
APW8*
��@A�(�ߕ� �2: 
-�_�\�\ NWnW�D�_iP]V�Y��

�0�+����!.`+T۽x�L���y�%�@`�6�@X�9�<�A���*���T���l�� PD�_D  v�=��x~���r�6��R��z;�� 6(`_�
����
-r.n`_��4�����
��X! �`[
���(5�揌�
�`Dq� ����d���5
�����|yt5��8� ��&+
�xs���� ^�� @u���4�4�o�� �_��ͨ���������@����_;���+4�(2�l�r�(�B}��?o���?�����������6����� G��/����Ѐ�������?�����9��UB�
��q.^n�_݅�*B<������&�=
�
P
�
w��zrPQ@���Pkg�zV\Q�c��v�{��d0j�������:�	
-@.. /|!P� �����`�߄�p��T ��`w��5fAQ j�
A�Կ5�������Q��GB�B���
���_�W ���( 
�A-�Wנ`Ŀ�
h�oԅ���n�����o������Q�=�V�s�p�'��5��gU2t
\�#��)gF|\#��q}
-��k�z��j%�s�����;4e�ϲ�g~x#k�y	�p=P�j��2v��}2����i��	-�0I�A�K���H�N<)k�>=�G5=�	
�E�ª!���UE�T�{뺈f�����ԏ��
c�6�LÓ5Ә������=*IW?,����
Pu����
-A����� N��b
�U�;��4roK��һ�}�+�Ig5�Gvȣ]3��νY�Խ�{�J�/�r�㥇�~ęN��–)<yG:�
r�=+i��#��_
����"��UT̻ks����ﰠ�U|G�}�Ae
F�B�v)���z�슳>��o0��i��s�D�K��fi
.UL-o��e�ݡ��Ֆ����,��3Y|OM�����x�a&�[���5����T�S���#�O_ֶ��}�j��+��4��}
�d����A4ӥ�4;I�����]k
{����>�`H9H��O��lB���WC���ldZ��qQ
�qTI'���H�f�O������y\G.�9w�t�
8��r�BSH�bHbW�qL�d�b�n�㛮�l��{o
7���K?��|�L�2�_�*S��`�x�*SF�-��瀼܋��y�&��4��qsfj&%��O+�|�?ڇV?�{6��<�&��&D١wҷ4������}z����x'*���� �?(��vz/��
�}?�
2~T���
�l2d�����N��2�gc��!��/��9���VRb����0���N����Y�9]�����䉢�G���wi�Q|�M���w�q�eK|58
=�m}a���i
=�.�f�*X a�����t��P�Qz
���g�H�����[2 F���)%�X�����>%�׫_����y/3[��k�8�X����M�]v
��G&7Ƚ�7q�8�Xi��x\�l��^4���,I�6A2��Gg.���D�5)�%BIt0�l���a�q�i�T҃���4U [...]
-�u;�O^7{�0
��*�9.�����π�dRt�
|8�ӷ��.m�!�EWQ����$�z��o��"#Ӽ5�U�
��,2��Iڀ���hO�����5�=}"|�.��p����3�Xť�m$�]X���!o�Y��
{�\'�+�`�G��ׯU�f0�딞��כ���ک`��}�j^S?�����WA�� F��
���� ��;
`B#�7HؽpskcM!�QsO%E\{����4t�/G��ԟ��qŋx�[�=�B_��c�Ӌv��!�
],�^!�܇��&��Ur��	��
�՚�Y��<қ�z�4���]
0!�֒į�<�j��$��Ed#�F�Y#����Y`��z*#���=��я" %]�O�1�H����q���/�W�2�>l��d���ي���3���..)
9,Kf�I�IEǡ�F���o`pu����G��MU�(���%��b��D������oE�Hn��VYz�bSJ�X�[���d}���Z?%�<|&�& ��ԌPۋ;N\���*P{��2�I~*r�-aNt�;�r�.�)���K) 烵q���i�� 7�u�&�g�+��
�P��EF;�O�O_�h��`�d���s�_�Y�e��]�v?���PY��\�)�K��������<n-�5[�v��O��^�; [...]
-ܶ�|h�N�)��݆eD6}
?#7n�
F�⮉�w��#h˙�?eYP�9/�f����t*)��c	u��ʥ�`�����"@���ȉ��c�V�W��y�Iv輖�@T�Wˍ{g4
d��M�?�5E�[�\�ܼ�~���<x�Z!����XL�@��#�8o�e��[��l"��~��㦤F�:��k���\���x�MVo����Cf�m7jjI&J��D�� �ԙ�r6-y6�ztTѿ�1⫛���ÜJ%�EB�˥cKu���㾏��y�=�ԏ�{��|=%�N	/�Qֲ���8>�˚i���S�r*��
��'FP�
h�6E,��~ �]��o��X3�|�OR��ΰ$�hƯ^D��ߡ;f����[��b
�
=���8bk�5���ɍ�
-�O��f��rT��;|�m�6�L����pS<�Ss9 E<�R~r�K2k<�n�
�=:-��:�r��t�S�|x�+D���}�[�ėGq��i�
i�0'A��u���c��oy]C��H8�n'R��q�u݀���b�HĈ�ÿ���4�Q
-q�|�����Z�
���x�C��
-@"���G�an~`r��N�R�G8uIe�9X�̖�#@
�T�˪����9%��	GϝՂח��T[	�X��@l��/��p���J��c
�m��ѭV��1�FV�sj{���E3[D�����o�yͿ��i'���WΏ$8~���ӡ�95!UȞ
/&]2DCY�Lv����Š��&���(�f��*����~���t�C�m� ���z�֓,ss<����S����bn�ǯUÜGb�x�9�~�}S
b	�+h�ZiU6
�~l�7� y���l�t�ƌ��Z�I]�0�a`���l�������{
�a��U�I�'J��.�]�N�s4�Ȩ�l\KI��S����
�fS�頼Z�G�1X]ùåh�x������!1�
-���^���m�:,uN�JEc�?

U�M
-�d;jl̈�;j-�U�҇�#)���W����r�s���n屔����.��T��Uc����Oޮ��f�OZ{%�6k�k
u��
�;��Z�(ĥo[��/��񎧤Y^X2��wS�pZ���U���0��*i}����a73S�9��u��APm�I
v������'��g$�b9�-�ַ)ٜ}�P痿\	6��l�ʬ�3!)�t�Te���9U�xS��p$��U=�L��+\��-Ʋ�@�B|A��#�h�Y��3p�
���InL�Ȁ�t6,&�<�q����~�sK-�6a^�
V&_ ^)�c��p�U�KH��g������љ���i�&�,#l쐗c���r2�6�x�C� 
�x�'Wfo�(�J
ra.�v��
$���I&Y-3��36�T�c���&��#��cj�I���<I��s0�J�n!SWp|��C!v�z8��
�|�f�
�^��w`��R�j���S�5���_������z at q_�E��5q7]
�,P�AC�Y��j}*�ӻ�'ȴ�<k�"
–]�8��{�סd�(�a��5��_�������:R�)��'�A[u��k$�����1�I]��e]��1�٪�|ٝas�P(�~i�.~Ni��!�TSU��A��e;}���
�1�w"� ���7�
;J��M���iŪ#��Y���N�(�c��1S!?Ԭ���~��kmh+"mf��RmC��x�
��1��/h_X��������dƉj2�0݋�)x8���3�C�p=�� [���������ᘕK
-�א�D�
l}
.zk׶
,���4x|�Rc>��S����w������6���H�0]������]��D�"#i����[����E3�+k���C�U֓������J���y�d

�)TH�Y�$|�����lE�J�
��Dv���6�eq˻�Lƀ
-�M��Z
�Hp��*޵�~����5���f���ګzۃ"G�>>�����Ur	�$A��[*ɾ;��K��;eR4�n6� ����5�ZX
19
���و09vÔ*h2�(�S�%D�-����I[�#^@��2��F��`y���$���& ��H�+�W0疚�&�A��鎛��
���XJDQ7���9.dIe?�tA�0�|Nu$o���)r���Y��A����c��v�~LJf
���&�G�}��i}���
[����Ɗ�o�Lk]$��uj�
�[B�y�
��
��bk��k��z�0��k�j�
��I�d?&px�%_���1TA�^�<�
��8*�L!�</�N�
\��
Y妈
-�� ����>�����
-h�W^R�%θp*���Vi_fA�)*��a�|�y�O�6?�;�HsYJXm�����o����5�)�h�J0A!9�6���p?��1�ȩ����5��߇lG��H5��0
�x
-
yv!ؙ'��l�(����Comd@���
��Tc����h�K�C��б
?��X�⊏�
-��-�6ˏ���d&�0(j5�,K��Wwz�>����f���;�/p�?��x%(�j�}N��������Z�|�s\�/X_�~騲
-
�8�/��\�vP�T��+�ߤױ��P�*����]��&���Spc|ës��ttU���o;C&a�ƭxC1�m9�Jw�2��m�X�@Y�D�b�h����#9���%ЭXBJS��NO}�g�L0P�J#?��d.s��
w��+����^	�&>�Mq{��)~"��%��*YO�zw4ID

�mV)׼e�����f�*��ˮ��
����y���|��oƇۃ���;0u`���E��#��
Fy���j|�bka�r�W#��N�D�S!���{i�W
��pu���7�Z�E_�u��5��Io�����V�����]�C�i$
����[�L'�,�.�aq����·V��ў�f@���H�f��Ao����!�ULT�I
-6
-ŧfM�u��[c�ήw�$�D��F
Gn��Yv�O�E�J�M���%���1������0��DI�ū�������d/Bz��~�� �*k��=��ʋ�':'K�A��l5/
��bE�������NJԽ�� ��*��vdt
4�aU�p�Kmھ]���H[
�0�G��|'�O�
-X�<s�X��t]�
>����zϋGЯ5�K�%?N%�Hi���%6�,�7ΊڕO�D�g�U����Yu�ra���w$\��
�Y�1����R������^��B-��m*��4�
�
uXZ��f�w
oo
-n<�>��u���W�+��?B��ш�`~�*�	%XT_	�m�YH~������F�1�M:�wo�@�w����g�ɒ�[��~�B��yG�>��g��r�c
-�
-�+�'�ˢ#��s,#������.:ҙ$I�im�^z,,R8ET�t��=(�D����w�]���qG�@�ED �ɒ�Tj�l�״:���>��ƈ~255���~�^rs�~��K
sO@ �]�UNjcG�o�Ȫ�
Q��~��Qg˗�;�Hn�߾����!R�{�e�s[�û.�;�E����m5C��K��A�i��
F+�Zp&�}��P�
#1ي�EHE�Ņ����n����������*>k��ғ8�i���d�
-���[��
��=�Yr�^yQd�s4�&Nn�:�%�&Qg-ם��ո���
���&��hX�웱�b�
->��]�W�f�-� ��]�gQ���=����hUF�Op��Ye�;
-T}��(��F�e8�h�hLxo:H}T���W�ܛ��ę���
�O�PZ�<�#�J�gP�D�Nrx�T�=��)�KƬӜ�e�%�ߜӦ���j�Y������Gl�+ҫ��?�q-��<�н�6G���|ne�����nʃ�ɏ���
���DW<L��!��de�
-���2�n�*z�o]��V�?�x�y�?�$�+�0!�*]G���
�=eb����v�D�
qA�?#�-VX����?_k��Vo�>?
��\	k8�V�_^�� �y���'Okm����Z�g����|�e�D#
e�{H�Ye<�rV����q|����gvp�e'˺4�
-� �&��xUH�`+��ٳج�J��o�umt2�C]��U�'�Xi��i�A'G�ޮ�����
-j�yn�a
5�+�>�7�4-Ew|
���)]EZ�e�Q�����.#�L:46�y��!��8��)}U�
V�����dC�a\+c��}�w������
Y��i"d
�H�@_	
�{�m!k����CUY�P�S���BI�۩A���2�t�R�P =���q^f�&�~&�Q�~jf at k��[Lw
X�ͩ2��6�j��r���:u�n�\�,��ϕ�uS]mu��6"Sl��;[����o����9#
ҙ�e/�awS����+�L
!�V�oZ�]6�\��N�މ�ш=�ǚU)-���$�)����p��ʤ}
奩r��J����S���db�}��k�	��O�\������`ǛA��!�"z���)w5�e���&8���>D�����I^�M@��\�n��Hfhwqk/}I�ȳ�y�
fh�>��p>�I<3����V��{�ߝ>��QP�;Z�\��R{
м�.������s����~�L���x�{3����
�O�25��;f,CO��.Z���?;]����m%�c,�:.�Y�
7fu`�kC�
�U�}&-�5�s�p��3����N��%�S�ly-Y�
E��r��׬?z�G��R��>�����7l�9�O�
-�m�\�����+)��y9Y���'R�q����ה:�\�	�{��f�y�t&eeOb�y�W�ߨjlG
��Ά0E�3.�!�3+��Q���?�f#��p��pD
��4vt\�d�@o�yF{\������ڦ @m�� ��h��猊{�u�+�X�z[e,�ꌜ)
��ا̤սI9޸%BY{c�f];�"�v�u�)Rw�{!�7��iX��r�V߈IF�$x\@��^����ᴘ��|㋹W\���;�>�P
-�2���\�w��{ۅ�e���rԢ+n��4Y��CQ�}u�$�F�"~9;Zy����iZ�4����v!$�B�[r��:�G~�ֽM
�E��I;%��?C�A"��D�]�6��&���_���
��-&nf�&
y�r|�)@�H�^�J��<�U�`�r��
�A
�>��=%yl�E
d�W

-I����D����i\
����~ۥ_r,
zSo�q�,��qv�O��
�^��R���ȁ7�0X����S�$'�9����h��=�
�EM���aR�$T+!@;XE��v�n�ݢ��f#�E7�c�F�c���e��!�O��I�b�{��?���vFr�H����#�x�{sd<o�v�9�蝡

��H׫�=O��0���$��9��=�d��J���? W�"�O�|3I�����y^q"�	*
C6De��]�
�Q_ž�g��
a&ҲV�n�i�A��W�Z��@˨�� ������W2v����ǭ�=�	�?g��},��"�W�("2���O��m5��8q��_/��#��MaH�M��b��	Yi�m�T�M�
Œvb���A�M7;G
�KT�%��L�W^`��U)<�X�
y�!
��V2m���λϕ/B9S~�����v��B�"s� ��[K{'�+ʹ^�Y��^G���@5}d�]q:�k����PP?'3�ʇ� �!x`
-endstream
-endobj
-3448 0 obj <<
-/Type /FontDescriptor
-/FontName /RMKTHO+CMMI9
-/Flags 4
-/FontBBox [-29 -250 1075 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 74
-/XHeight 431
-/CharSet (/comma/d/e/l/less/m/r/triangleleft/triangleright/v)
-/FontFile 3447 0 R
->> endobj
-3449 0 obj <<
-/Length1 1511
-/Length2 9163
-/Length3 0
-/Length 10177     
-/Filter /FlateDecode
->>
-stream
-xڍ�T�-�)PZ�!P�B����P4@�P�CqJ�Hq��K)m�"�ݥhq�"�~v�{���V�J�̞�s��='
��
�V�9G���%�V�q��x8����t�{�_n,=���W�4
F<�d���8UG@��
 ����@B\\ n..��
�B ��
-��	Pr�A\��
�<�P[��6/̖, ��� �� I
j	�T�[��Î�`{���%�����"�������	vp�t�ۈ��ܡ[��w�X~��
 2��b ��B]��k;Z#��p��a���\
2\aV8�as���
-@�	�3X�� v�_w q��)�W��BP��`KKG'0�
-�XC�! u9N��
 �Y�ۻ8>���P{��C�'�$5���s��C�.�.P�����<ܲ,�J���C�`�>�
�|�vO��}st�y�eXCaVֿIX�:uaPgW���_!.���l  ��  �
�xX����t���~��z;9:�H@|�֐�,o����B|��
��������
-��O�7��O���p����A{  ���?+�yY9��=��G�����l2���r� xs�r8��� ��"xX��w�.�o�x5����0kG��

.�o
nɂ���a��j�Z� ��#}c.>.ˇ/��� �������U�o���ɹ���3���`����)�"
�B��a8`���s�U!VPW��E�����s�P9��J����SCw᡼=�pt��~l 

��a�,_=<(.���<��o)
�t��=x�|� 0
��zh����=L���i��0G�C
-��/�������  ���� B�]����
 ���| �
=���| ��?�Ù�w���n�����'�_�,]��i�Cv����xZ �%�̤��p�]up�e�$�;����ú~2
��
���5.FKeZ��\2������,��,ͭ�Nc
ƛ�8��_>7f�F֛�����
��H~�zLɡ#��s���
-���C���
\�
�K�Ny�O]%s��������7%�
���
-��-�'H��
T����
O�����3��i�޳a��F��{�\掺��Z(��vi%�'{IJ�z��?��-���D2�]�?�mڣQ$�&�	{�<�3�-��J�V���[���ZV ����Z���zB38�:Qe�Y�#�+��k���s�6k�$�Y��O���'��;�
m޿j�z��q\�&5]��������w�Sڸ�Xem����R���J(��E�g�n	/n��!"ށGR��y\\/_�u �S��e�
E���
�}Y
Ǜ�w�7	��W����tx�Gf�#k�ʜ�*��6{1�IS�R;
T<\.'�)��Q���7}�M�ϫ(߱>U�n
�iw%�˹�W��
×�I���1�U�#�)xn��㼴Tʔ解��a�{�ToԊ�@p��/Z���.�)�(�
�-���H��:�G?���^
h-�qg/Q�a`ʟQ�R�)��g�dZ&����_���Y�?w�g�Kf$��g
Q
is���>���
ݑKQh�\�<�ZF�
X��>�J�m_n\��� �{��j���vj���ɒ(��;��E]wɚYʏ��� K�=����c|��"�U �3�-���O�e���J����n�p1�^$<	)5n5D�_���~<�qß�9�!��	�.��N��d��Ϡ��R�F"�h���t5ߏ���u�A ��^&Ҫ�aOut���l6m0��G [...]
���FQ^=2�{�IJ=y�ڒ��x���߸�i�W�׍�(��B�)���S�
ѷ
�r�%��cU�+�LC���h7o�%��I�� 
-<ӹ�
��j|��2�2�v/K;�|��78L���|�g,j*�9f�pe��nu�1��
-~E
zz�_?��8�H��ZIw�!����d��S��
6��^o.���R�]
_��qw�z-�Ʀd��g���Z��I�Ƚ����%��\�xbK��C+Ƈ6��rF��ը���_0t�
��q-�YVj��
�y����C���
4[/�iU�F+V)
w^����z�D%>�^��rŶf;z]��]
_t�3t�
�%r_Y\�6q,�XT�݊+�~꺕-�/�N"T
�ŜN��,���l�]P�=)
-&U��i�3s�UUf�{]	n���0Ů1�߶(�ت]�Lz���p�A�*n�Dh�ڂV�
:��m�N�z���rҼr�y
��d4�k�;��qKq@볎t��
���B�z�,�R*�
��}>��
�ܥ�t{�
-����ϛ�
�`r�t�H�H�/���
c��:uH����Q,$���}
U��&ǒ���(�~⹦�u��_������A�)����#�
����xR?OY�|��:5,���v�ա��k蝜�c|���R�v%�
-ȣi=�h})J�M=��G��=sP2�샀��-|�����r�ݨ%�5�9�>�<���|T at jf4h��G�}r��U�DG���-(�
-
��
�t7K
����n�s%>�	~g�f�M�yѼ��1��&��!WX� ��x���Ue~{Y
-�f-Y�į�Ve�p��^(�
P��C���'<��26���B�S=c����E�$u�nGh�M�������ܥN�ů��_����m*��g-F�#h�J&'���^�y5A$U����?���
-���.���r\��Ra�^��01�s7�&)U2��L��K����9%Anj2_"T��U�w�q��6+0{~O�7J����k�E���h
�GIJ������-���0n�^�O�0�
"���1��p(�Ȉ> ���3���-2�ۥ�^twzI*�Od� cyr
ey4�X@�$]�K�q�$�8�xs���-���,��}59�-�L�v]
--��Ra6'�<w2|��X�
|��[qD���f��+�?���%q��	F�A��/\9O\��Wg�OĄ���zkF�
�+��<P{��]�&{���Ar
C��[IK �;����
z�g��x#�t&Ͻ^�&:�
�=I�
-}�r>�U�	�|KOk0�.�]w"J�$�_�@~��f<B�
-9kL8�u{<�>@�
{���Ix���J��]Y��=���g7K�-�"�
-�V��	JP]Z
Ej壟H˚���̱]����@�7(�����^�}I�g�
��

�)�ݗ�.�o���W˩���g������w{\�κ��i$Э�p�L��B�y���7�ǹ���B��
Z��өd�
�w���, 
�=K�i~|
�o���N!�Z2�!>��2U�[�媚�j3�|RkR���d�J��5�����u�:C|[>NS��G\L�Ѹ>��C֕��=�{w8�
�:�T�
Su��KM����3��ܵ�ĴV�"�N�/7Y���t��d?
�����u:
GLp�� �
�����M��ɜ(�U���}�Vy����\��ܡ�T��v��k�=s��\�9p�n6rc��M�ۏ�����
޸SP2��A�~�%�����1��*kJ�h�E��١c*����{�IlLZii�oKLN}��u��\$0�e
��d+z������TF��������4�N�y�u��ۙX�f=���Y�D�bV-�U��&3�[�m�
e���l�M�28���D�V��R�Z
,�K�u�dž��&��B2QRʯ�
�&��=�ILw��ڪ���YX��/�]�Z_jx��+�d�lc�����SO>3$��:�9�ٸ\Q0�+5B�%��Y�]
-�8�q
(5KݞԺ Q���l�O�=�4�qbF?^
�ɻt5�h�
��2�];xV�@k���zڵ��E�tjI�RiI���x|2˚2L��S-�|���?Gx�A�\���¯��./d�k&��w�<~G�Q�ҿ�dmRӠ�
]a�p�i?B1���_��!��4������t6Ў����*BR
�C�	,1"I
�l���,dΆ0��u�h�Hs��"e�7����κ�y���
Xb�[�_5�އ��������֥_��#�1�ɘpLτ���>�Ilz�~
-�e��
l"��tF�*����x��L8C$ƙ6����W��t�ȓ���Ou:����E
{����Z)s5@
��!�(���<�J���}�	��Gc���M�^�u����� ��-$܇�cnz
��X���q���5R��kW�f�i:�.`��{�a��6��8�"��z�X&�2Öe�le�.��TQ��~E
-mt����X�-n��f��m�!�z�km��'���a(_<1,L-�(���Q��!qD�����39�e�{1���^�79�V]��D�
�X��b�Ó���C��*f�;�+��l�~�:�İX���y���w׋�*Z"Ih+0&�ܣ���?����^��R��},��:�K�zz��
-
��fX��z
�%Z
��M�]Z��,%��|/�^��/N�+�d�Vu��1�׽��9��o0쬍4���b��U�r��p��;EcvU!���z������l�� ���X�3%O瘤m��RD��Io����W�
Iĕ��?� .��� L��
�i﨏\��|
�G�/|>g>5
3�3��Gq��0obR�Ϻ�[�H�^s�}6��޷�
��.[�| :��2����Q�j�^����ty�S���s�
~��p��e�k���������v�d"���uW��
�
"�e*�p��E=�s���
�
�JN�˝�0:�X���r'��P��Q�WPFH��Kc�h�=��V$�'�^����ߥ"=��t~4��V�,��8*�^s��_PAW�$�c���n_5hqݺ1�w;p�3
h���4���{�-����MJ*�r�YkZW)��g&��qY;*��|7�}�
���k���GP9,�엌��:ۆu���-=�uQ��ā����h���0_)z�{�N�5E��d��d�!
Ե̿}a�������(�!��O*��s���Y+j
�|�@�$g��$����G�$����ǐ��x��=��&��r,Y0^��r1؀~�ݦ7�N=���G�swP��#E����g|*�%�����>�ԭ��d~��Ǹ7F�}�-{)4x��9�ו�z\k�7i��F6w��@!�yT�KC49�U���,?�>0�s�9�0���I�Q�`�3��/������mh�`j
-�l�
�
-8��׮�j�W�Wn��o���Ӎ�:4��u���d.+�7n����b����>����{4N
*#�=��P��� �5E
��9�
_{]Jěܾ735�y�K4y�ٷR�fa
�6��e18�q�L������m��ZT�k�\�H�H����BCI�0�5k
J���=���I{
o�‡��ԩ��m��*��dݽ��8����b�,��NR`1(ME�t?�eB�D�܈[ծ��+���_�
Nc�s��FP���b#�)0��-L|�ù�B�:�AǪ4�-��:kH]�I��v`7���qtFrK	��t#�kc3&�,��Y�Z�:=�[�6��!���s�*I�������HCL�
W~r$Vz�*��l��.De�wy˦��b皎G��ȶﺞ�]]��.�
-�)FH��\@�?�fn�NK�ٱ��ۚ������O��޿^�,���(M�$55<�
)�����|����¶&�EI΍���F
�kQ>{>�^'�
W���x����t<��
[8�q�϶@Ƹ3��8��f��p2S�&O�����(��~�;
��9���{
�X_���~\o1����E���Af[���}�*��gF���r�����������4���N�iZ�u��$��H6��1�
��>���4�.�O�|�n�����������b��6�A
s��e�{�� K4,�|Zy�m�
����j??�i5ƪ�F�����G�Ƚ6K�h�
B���`2���~,/�Tw��"�1MJ����؍P���/�^��AVE._�Zc:�i"�
�Y�oG��kri֨�3y!gKE},�1a/����]��T
��'r
Z��{��X9Of��܍��������Q"KU^ z���Gs�
�F��:�屗�OH�on��D�6Ax���uɄCKa�$�A��66w�(��I�OV��q7Ji�󟈩�)��-wgI�o����G|��|K�܄߅U��Tܑ�+���+�� ?>�	J�[��I�J�I�
�1�_�m3�|8;'n�vΰ���Z�6�`�eP�'�Ȓ
���δO6[:?[�L-���0�瘫Y�����.�X���ŭ������;
��E�CI�I’V����� _,; 2���w�����iʼ��
dS
�����%�LA�ĝ��$��G�e���4�H*��
��{9��Z�ZYu-0"�"Q�6&L>����jk
^מN��4l����Y�H��%��`
z-���;}����]�#
���
���
�e�6q��n��w4�]iT+��H������oNLK���� +�]�+A��듛,��t��X���Y��9ONҶȻ��,����
�Ϧ����B!�cܣ��m�v���Ǧv��-xWJ:���L��_���M"ĸ�02%��p!#��m��I뾙�$�ͨ�N�rh�;|U\
!��GI��CV�"�I�@��ھ'��x�H$��ѺQ�Q⶙a�6�s2_�߾a
����96	d�
-f�Vuh�
��
�P�l���dľb�D�ĝ��������ú�� v�S�:q���5oi�V�g�ː������Z��9�/�-�r��.�-Gsgl�H�4<*��ݙ�JI|(��SFyM�@L��]�H�9'E��N�P�Ļ��&�fӢ:!=�Z��Y�B]RO���L�ȳEU�7B��׷4<EF`踧2�K���]i֑G+�ay�{(�@.�������o��������#9���L\o�L?����1L=�)қz%���z�l�5�o/ FeO��*�{`�w���vFsP/w
���|��ێ*i�2$�DT�M�գ�����|�~�
6�*�۲�P�+�W��A*��p _�!Ô�O���k��
-��l��pN�
J&
���7�|҄�U�Q&5�W[	d|Υ��
-:-dG
�[utΙ�|���|��ƿ��D�+�z)wo<���[�n�uu�ظ�}�/����Q��%N×�N�֭��|
_�X�N�^�W�K_�OL(|�n7��^(�Ifs�B)��~��#� a;�s[�c��'��ʌL.y�z�ʪ
-��~���3��)��F��Iy,��&��"ȷ�g'X
Ej���L���&�Y�=Oq)=abTE�SŒ�bQ7h�ƭ�
�+�W�� ��;/D����4�!:ڥ�_8����q1T�t�
��1������q|�}�m��RO��
�G>��{P$�� 60F���![�~�x�g�+���[L[�
)�U�5J���hoV�\y�z&���R�ͤG�
WzpsN"=�w�ɹ��"���_��Ӂ>�^�
hD��^���汑�t�,j�\�߇�g��V��a���t���:����(�e2�6��g� ��"�8#��{P�I�&I4V�-T�Я:C�|<E�Wna��})������ݤ�
ç
-q�;�Y�6W�[m at ifi80z���K|

M�^�h��
���~�{?k�ؖ뗝̯y(�מr�O�J���u�	��l�wN-n.jzY��[���6�8���=��@�l���LRD'9���yO�
�mg��;������*Dv�C�Y/�k*i�c�	]Q�h�Iߵ�Y���ͺ�F���7+�Gʦ������$���.$xK��{f5)T�5�Kx��ŝ^�.��\)��/Ŷ�(y
������ߒ�
z�ڒȦ
�������F��y�W}c8� A �0+��Y}�@���-.�k�$�U�9�
��*��"�� 
,��jq˚��J~��*{���d��Znj�sv�����:_
�A�u��0�
tK�`�E~4^�Ɖ�G�<���Dj©P&T|z�� �-VW

��ۉls��ᢤC(��k��b�w��4߁�W��y>�@M��r}��w��P�zRqϕ?�B����M�ʻ����8�
l�M�=��o:�u;��rD7����l�j��b�d�iQ�$	��츌4k���\ޗ��i{i��3߳�%?�
-$��
"�"
�X$�<9�6���g_�oA}�Y��������nj�Pk3kVh��#�=��d���j�H�	�R�'�#�D��v�J��XJ��̀L���Q���TH@�eҁ��
����a[j����W~�ӝ��i��j
�d�H�@!��
َ���xV�ycr�f�
����eG�iGLR\�)��/E�өP
�������Ps�'/�y�u��k;��k�(^���S>�6�<1�;�g0������SA����B�R]�!T�>��J
Ir�*)&��D�&ы[��^��
](�O���"7�G�ŀ��I��u��1
�TS{Wѕ#�ܟ�NM��$E�Dԣ�E݉'�u8:�W�!VKf8�@�6z��)��z=gUHQ��M��Yח��-�h^뀤�N�7�Ah*
܅9�:�n��d�,��$������̦�z*���U�Y��d��Be���=���EI'w+�t\��e���
�r
��1��k5�H/�������ˆޠ�$;�6�h��[�B���&��@#��
��Ͼ�a&�N-��b���9&�v-6MD��!s*$R���R��k���YEmd��	q�
%˯�/oN=�^�pd���y������Kv�y[����/�Q3�]v�n�C�Y�8�%LLߖ͉�7�����#<����Yqy�Z���K�����Z�c�W�lx
�:Ł���ѵIrq��+
�G
1
f�
�֮����:f��
�zz�Z�����c���
O�WET�j!� �w
�����I��}�
-�=~�9L*!=��˗K܊������I���]��9v÷9:*Ă��7��m�2	��
�QF��0��w�K��<&�c�p(̻�pw-�f=}������?*��1���x'd7̈}��&�0c+�4+�I�k~�3L"Sm�Ξ�9mu����
Ze��I3Z�Z4}��!�l�7Ef����M��Q�؁ɡ�
-�#�v�e��_A�4C��@uw/��(e�j�m�i��4�m
::땠��:�]���W�/���!D\����m�+*
O�Ѧ��Ǡ��m��LS��K!@¯�Lf|g�>��ns�
�5"3�W�l�{���'+u���fH_�
�
-�������
���b�)��S�):��搷Q%�\s�s;�I�7w�A��
-�	"ą
-l3:�D�]-p��Qj͓�G�h�����;n�~�qoSZ�$&%����?�rKq�[G5D���9�C at Pmi^2n�2�[�g�/,�h�k�����j"�P#)��3��fV}�f�~,�!��+�g��CzKS�g�
j�S���2b�Вl���O	��O(
I����*GCi*W��S��F?�.~ͬ�y�Y
�*`qK+���°��}e��{����'��>弦nH�����p
=�y}E���a�	���l*u��P�.]|���<�H�T��1u'.�
��"��3s�M��Q����2�n��b�~V��KN+OnF�3��1گ���&�%�(��Z�_��麍G�-�Q�� O8���,���"̭���B|z
�
��l�ۋ�|Yx��d���/{��o�
������8�B�}��
��g�\����j��a��j
Lu$w�0\�ᝋ�io�h� �[���|]��'˘��������J	K��Y<������`�be%�	�U�FbZ�.�?�{��a
a�����\�
-O�^��w=Z]s��fq�V
p��Z}�tܳf�ʟ�l
!u�D�:w��ݨw}����wZ)Vg��3ն�V7e�:���R����X�uTS����,�U;�7�Y5�Cc4�Q��/=��rZ�Fu�q5o���OX�SӜ6
��5W
-��+ľx�)'q/~)�
����9�$ڌ&0�� M1-��ml�y��iS��/�� o�
-endstream
-endobj
-3450 0 obj <<
-/Type /FontDescriptor
-/FontName /XCKPWW+CMR10
-/Flags 4
-/FontBBox [-40 -250 1009 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 69
-/XHeight 431
-/CharSet (/a/equal/h/l/r/s/two/v/zero)
-/FontFile 3449 0 R
->> endobj
-3451 0 obj <<
-/Length1 1454
-/Length2 6611
-/Length3 0
-/Length 7588      
-/Filter /FlateDecode
->>
-stream
-xڍwT��?���4*�n�����0�
ƀэt����4R"�"!
R���4
-J�N������s������Ͻ���3ce{�
TG	
e �zF  PT!��0��\�h�9̠H.�vU$�����(��
���K�K� �  P�/GR������p�1�*��	stBan���� ���%���]�H
�QNPW̍�
��AQ>�J�-�B��	y{{
�]=HG
~�7
�0�z@�^P{�/� }�+�70Ab�����1��
FB�

�{`<��P$ s7�X[ r���p��Á�gk ‚���3�W"�w0A����>0�#���4tQh? 
���v�@`��^`�
���p0 at C� ����	sCyz�\~!���du��*��
-Gy��O
��B0]��=Vg8������w����M�s��j���Q��s�� �@ PRJ u@�'�_�M|ܠ��¿Ԙ���n 
h ���!�� {A(�'4��?
������0
-`u����ɎQC
��1�G�� + �x� ���'
��p��Wd��������&�' ����Ң I�!��Y�����Z0��ڀ�dԆ;  �@���/^r���u���}��P �?���!�/��3����8�+��B���G���巕������]a.>�1,�Da6B��
���C�Xb=�=������(0f3��.7�CC�
`(���k��.08� ���� �����av
�yJ<0��m�bV��W��!�_;'". #�`b��1�8�O���P�o^��&�� p@ ��SZ
- d�K�[�U����� !��g�DaI���ߢ��
E"~+�U#�����oa �%�~$�P4B<7��Ȇ?j�8�S��-�6"?ɱf��#�7�|�yFF��S������>�baU��X�#��v[���T×����F�k/�g�h{GK����%�#`�����o�ۆ��
G����A1Չw�&��]��P���z���E�@�i�uH��"��)zV��������L�*�f���G
�/Z�g�"�p:���Dģ������.��qN?�͌{t3~�J��C�S���?��	�lr���� �~{��1*��@/�K�
�ܮ��ZΒB �w�po��M��΃���H6�=�,cY����G�`{y}�iD`K]�L�
%�I'�&�r(��d�NQ�ɘ��V��pty��J�Qݭ��8��;W���+N�>��RX�
��V�4w�:7`���c��5�M~������4r���Hj�箔�j6����@����֟���|4s�u�.�r"����
���|}[ [...]
3ep�wժ���>o��ޒ}��z�?{a�Ud����sݙ⨹)�M �é:`�7�n���s��&v���B���&Ѭ��G�E���Iƾ��x�ҁ1�#�v@��<;Y�J)n


�j5c���HG8�a�e�㱬��J�YT���gIZ��`ɇ��붖r�T�y���/���o5UfA	�

-���
-B�ӣ�	
qY�
/�
�v��שN;"C�N+�I5��!+ 1���q�63%=6�t��v�
-~�e�4�<��rh��"�1�Z�S�d�WY���
5<̖|�*ڮ�v2Y��{W�
���Ք���
�)IQH)_@���^!��Z'�chL!��z�E�J+���h�
���?��,�1�wF]v����j/Cq-���O����\Nm>��
��BF��k� 0JMv�AGྎ����ŌҜ�
õ��9
��yI�DM�������y���I�(��R#y�q%I6Y��
o$~������
l-�)��4��ȃ
��Ek�6(�.�(3�a|�"��WO�e� �����}�2�F����Y��T>��-*��W�����MC����ؚ~p�g��>/to|ϠVh�-��\ VHvl �>��BP�1*�f^���:
�Q"�yժ��0�&����bhݔX4g����ǬZ��k��7�-*�V�[��N���
�
�ޥֵ��	����
��˻�G_�[͒9&�'j�
4�[��ŽU�ߝH$H�
-������v����t
G|
���I����
���I�{�
&���[R�b����s&��p���x/s�w��eK��� w{��i5΃o�7��T ��y�ܺ��N����=���
*�8����\J��\�����>�3za�L�jr����[�wj�^�X�C�hf:b���G%�
�
y�pA=?8�kՒ�����Y=XN�����6x�c����J�����8b���v����T_k�k�@�S����m���+���f��>�;U�"�

����xb�t��ڂ���{�����E�vض���@������1�³�]��
-7���@yg�4u]L�Y�VC�f
�
�x�9|��dt�D$�KK�CI�I��usY�ݴ*��:����v\>�����K�����ؤjg�w�>/}���"ک��,.

��˫j��2Z�����[�(
J�*
�/G�	?��hJʘ/����(�C�W�,
����:�������Ovv6'�_
Hᤛc<ų��WBo]�s&�+W��qՋ�?��_:;��Q@����˔o���h8��h@�A�� )�zѩ��0��ĹmU���3
���X�
����!�t�cBܯ9�6�
�JU�_�^��㤉O���9�?��. Ħ
��ٙ�ե�Z��C��G�0�qw�_�)
��O���;�IWΆP�Ob�ޛ{/�7��_'����|$�"�"R�4�͗��⌽��]��f�)}Dtk�D�K�R��:���
�E^y�dR@�I��O��s*�;j�_!8���EY
���<�]��R��,
#u�d��6z;T��@�b�������Äl*�
#4L�R��%��imi;G���ii�i�W™rF���\�j�\(OK��Se�^�Q�����ͧjv��5�A��"�k����z˚
���ϯ��#����T/v���B�
��"4��𶨾W�~�r+�4~��k����8���+!��h\[~*�~�+͖y֚i�<���J�q�-�+���wp���e�o�[���a����_�B<G^#�nigژi?[���6��c�N�!X�"
*� "Hq�p�%5������G�>FccC _U�4��u��g
-�#�~.U���>�m{
H)�n���� [
�zq]d�#&�3��۴�q�q��� F����aV��ыƽ��o{�:���.���w�4��՚��z�U��{��C�a�6et��^ًJ���JMgh��9^���29�<�����+עʕ�
(+R
EVM^S
<�{����Ύ���
Z�p
m�n��44��0Ba7�B�;�d�V���w�&±��

-�vh7�y���@`����}k���6?�����UR���d��[
2�3��^��.�n�E�r਌��Ž���>ƁC�*O�TE0��.�Z���ͭ["wy|�L�X/��5I��؈8�œ���ܪq������#�۽�em���k�I�����ڙ-{
��o��P����y\�o��-
�`��]�x�4_�F4�����B�U-��€[���x6he`
7z!N�2.���N�ޔ�ȑ��'�'����u�v��`cn"���~	!���m

߭��Ìޥ*�0�n7���[��3��j6�rLto��,,�����[x��,�C�ʿDtf�)�|�k��N
-Q���^3A�G�mF`1��r���C�7�^�DA�֜��s��6R��LtM�M���d��h���?1U�
w!��v��~�
�Ei��8Ϫ��x�8>�>�B#�o�w�R���ɰō'S�{f)�N�Ө��R]�}@�b1�{���6�KܝD+��E?�7�<��&J܎�����jA����x-|2ہk��j ���dŀ�tg���s��ǡ#>�w�X{7�X��?�;�4i�
5�V��
�bE�9����8�V�.3�w�9Q�2
-�������ÿ.I�LH��z��%����1��653�
{�0<je��~���Wh��lY�d�Mr	o��{�OޱsՖT+19in�=X�fm~wd�%(fs�l�}=����,�i�W
-�?���}�_ Mk��ep��&Nf�	��ޫ��1	\��ʣl8,,�=��*z��
xi�!؉gW 5/ܣ�,��w԰C���V�F�do~����e37��ko8���A!u�����\�i>�(T�����U�a�	ϲv�t�w��M�U�zq��f�
����
-J�Ѩݳɰ��u��~49VդP|Cx�HK(O�8�JSK6y����tĐXR��
-�$	m-�:��4���Yx����
k��!�'����Y�N��Y�Ւ�g!���Wzi!��7ðF�[܎>�.Ʊ��[��:�I,_�0F�Ƶ �^��Ś;
-�&ٕ��<g��%�v4*������z���J��L^�Td�|�Smc�j�e���)-����$��G<
��>R�W�
�'�}#�T
$mN�sDc��E��!#%�2L��~�W���U��>Y�ǫ��K��c
-���l}�gu��	&��XxO���N�����%٤8�w��O
}B�g=�O��NS'�[�4��M��>
��
�"�Y���g�Uol��r�I6p����OYŗf
<F�}Y~h�S�|�sLa$�NB3�e1���5��ďVڂ�Y�R��?��>鏐J�J6�U6||߫{|��`Rߥؤ�K�m�h|���ؐ����b���Gl����Ѥ��Ax6Q��@��HZ�u�o����5
Q�=����Z�����o�͸SJ�'=��dW��m	@&S����'�2i�߼`70�+�Z�
Ώ�;�s|(12$�٫�.�
���WL��|j��lx1]����X'��Mc�L�MX/st��NX�:>#6xQia��Vt���5�M����섷�x��*e
�^�
���3��
�
�>�S\��8��+�W�?o���&�����)��x�|��(ҀC
-�Y֔�|o���>����~�5��g�܅���ɚ�!_
0�>��J���	V�I[�}��
��F��u/�I��<�~�xq�#���H^lNԞF|%dž��ý�]�I�Mt���܋��9�Mdr���R��
��n��痌*���:�q�Q�
ϊ�x�
i+�N����:���۶�5Of�CpN�g/���j��Q��
-�NP��������ko��.�(��6IeVӪ�<��&�3��m-R$" !2�`�g,t�u�*DM��4�Ȫkb�����a�-==� �
ɮ��cv|*-��w���B����c��n�]wO��{ɷ�|��eV�����y(aAf�ۺ~����\�"��C�A҄��AƇ*�,�ʄ7$��m�9
� k&��r�
-�+���D��
�?
-�#�ҟRJ/�|���,��ӂ����l��bsq�y�����ڄd�I�^�&��{��l�vAo�-ã�x%h��,�/���	ci>�^����<ڬD�,�=SB�N_Hu
#R�
�}����(�L��>$#�c>�f�c���,�v��s��6z*׽q�cs�4�xZe���?��OT�!8�*`9Q����F��
i��>A[L-$۝\��1�4@���P� �kNH���������8w@����8ICY�z��u�.��sO6ȃ�if���������������6��ܢmWkv��0�������Ў燏�Z
K;-��e�#�a�).q1����5����]��_rg��ddy��lĘ��%�<ѐ
�9�zp����#]2����BO�|�'��r�KGU�Dí:��R��
��O�L@���Ća�4��i>
ܥ�4�]�
-��s-?^�"er"
-7
�\|ȿy�5��`2�|�J��9��g�
� �=>���GT~���D��� �D�>�J��Lp��[�Q�nr��ㆈwH�e�|U�^�$��y�3{^���׼���cé 6s
NjƊ�l獛��b�džHK����l����[��O��k����8�����9G��/vt��աG
�s�k���^���:�BnV@�R]��o��/����${\�t(�?�c�v
�P�c��u�J^�e�u_����-9j
��i�~��00��Y
~&o���Q�l��\N}�s^h%�d�
m���7�a
�W�z5�I؜Ws�Eb�k�dS�4=��T�e�ޝp�1Ӊ���3�F:��cᗯ_/��]mJ�o�r�?��1_�wՋ�D����2�Œ-��SF���Q2V[�<<��[�3�d�GHU��(�N�#V�����SE�3��)���۳5�E�*q���",�
��<�O�t� �TR�
|���w���)���]Ry4f�
�<U
�.V8�\��Df��
���pZk�Ͳ�����_"�`��W�q��
�f�I�ʷ����B
�k����U�O�
"
-�ý݉�P$Un���̛���*q_LM���S1)�q�� �_YU#�/@�Tb��%8���*��֡�
��$��p��.�R������
��Il0�Bg[�'�S�au�
l�
��
'cc��N�tGZ���9�����c����pX�*�����i{-A�}C�(�,B�xa�T���<������[ ��^�(�|���T�t
�O��9��*����2�P�bv+ҷ�TΎ�y�F�`
�5ɷ��0�h��"�J��z�ݯ�>Q~�v3jo����#�����
��h_d��5���vJQ�����5)3�
�l�9=ذ`;��N9�}��c	I�׍�^���Td67��������ҝi��T؛ R�.]n�n��7ۻ~�:�Ө�l��;�I�l�vi�
�Y���7�)^�
��nQҿt
z�0YZp��
����8<�M ���n�el4bn;�:y�
��������P��C
�_�0��J��M��S��kk�
-��H�����Fn��7��SX{�팠[
�����B@�
��k�����3�(F
��F!Kw,;<��#'�q��7̂����p��~X�!y
�{�G�p���L�X��3�J�����j��n�%�2�E�O]%{
�9����=�^M �=5x�P���D���.�����D�x=N�"�
-��~�)i݈Oi�J��Kz^!�JG�y���� �ق
λ��/��])	�F��ƂJ}�%�~�}�h��X<�L�M/i3$��(Ew�gT�8	8l P�<��b��IWX�5���{�����{u��e�x·d�s�˵yY�]Bt+o�넩g����s>�N��~��bd'}�����
��m�ը�uɘ
��,y�h]���Ӥ�m�I1��Z�Y at i׭�\��N�_�E'/i+�ϛ�R�]F�ud/&c�؄@[�[
-��M�
�
;A�c�
M�[>����#2kJ����ݳb��,͊�z*
L�4�����7�� �q[e�l��衒&��s�;���!]<!���;����,z�IeU�!�E@8h�(:�&� �x�se�#���r��
+��Y������>.�� k��o
-endstream
-endobj
-3452 0 obj <<
-/Type /FontDescriptor
-/FontName /OPBINH+CMR6
-/Flags 4
-/FontBBox [-20 -250 1193 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 83
-/XHeight 431
-/CharSet (/b/d/e/l/u/zero)
-/FontFile 3451 0 R
->> endobj
-3453 0 obj <<
-/Length1 1437
-/Length2 6463
-/Length3 0
-/Length 7424      
-/Filter /FlateDecode
->>
-stream
-xڍ�Xj7NI�.i��4�HA����c��m05JPJ8����"��4H����)�������������]���}���w?��n���8���h��(D
,T30���b`�8���
��	�S
��� �(����a�P�+�:���� ��b=�	 DZ"#��`ٿ
�9�:��
4�Qp ��+�pu���( BdeeD~�U�p
E
��np�UE�h��!ཱྀ�J! ����%����A�>bh�������4���1~pg�/�@C(���h���Sm�v���b��+�'G�\`Q�p
�6�LGh�G������B� �I�W�D��`(
�FzAQ��+��	i���� �(�_�PO�U<���:]9�n

-�T1B������Ax���� <!�Jsu�(g54	G�� ~�����aW�
�=V�����@9�����Y��X���_
W*�?:W�/P
-
�Ȃ�po < ����<�
������?���\A�� \�W? ����`�!��6�[@ @g��wE� �d�R�]���&�A ��}�s���3������,����T���IU
 ĉ�� Eť�@D\
(su�w�����o�1�Wo�2�\�@�?!\���0����_�"�wC���@�ho
�î� ����
����_Y�/���~4��������+��
��~�b���F��������?�� ��"�ת�
��
���.ᣉ�;#|an��\��D���hįg(
-���v�k0�����jR�M�U�wI

��k�ĥ��P
���$�A���
��@�
-�{��tAc ��){
r���-�� ��_"���x�����������b0Wk��2W��-�~�� 8
0=��ݾ������J6��!�1�U�
AQ�4�	{JE�*�*+b
s����N�iYC�Py���U��$�!٤�,��!�tt�05r����-��.2vQs��
��;�<��[t�r��������;����f�&WM�^I둟�}}do{�x�/���37��(��~ ����]��%�n�0 d��D!�fA���D����>�,�,6�
��t�7q�i�Lq%�s�آX�O�xvZ��Kd2򁈤[��zo��.��n!��G�h�T̤=_�)��"�Z[?�����&9��j�p��?�Q;~��qI:6\�����!
-�>����
��KZō(%�	�&����.��M(�P ����-�.E�H�UpN�,�k_^����Hd�.�>�����A���[�p��[�����F�'�m�}��"�kJ�O~���8��QJGEC�1ɂ��i��[Y�8��
yt��ť:�<�yY��:H0��$OTJ�&�����Zv����v�.&X�*�8�!n��}��+M���{$5�N�������S��]-�>����H�stߛ�_qlͬn�(�D��~���'wW5ty�6�Zi�k
?E�P�����I����5%�؄�(]����%+I��]оP԰8?jx"�3'
2��a)�j�#U�iL'�^���|#d,
0�?�j��R�4��W�o��{�c
�*Q���;
CT�]��s��g��m�u����^.�(���T�
�Ѵ�$��&����f�
��
���.pr�ƵC��+� \k�
���q�3$��g������Ve�!��@+Ls�z��Mb�F��p�'��d>��&����:&��f�g_>tu���� �X\XH�ѱ�>3;��֚�#@�G+&����c��
қ2�@��,|]��>E&l�Y7�R�������U�Ǿ�cU��B����m�s���	ŀ����-�Q�Ȕ���yc���'
S��S~)���"������
H�@�����J�ի���mi��
���V��喐h��y?e<���/$�~�X�a=.
�	��^T�w)���+�ޫ���=c� ��
D�q�x�"*s�# d8�S����-��q�>q ޫC�P!�{
J?��?���I{�E$[�z� �H��S�@*r���O��H,��n�T��i\^ʋʀP�t;��
{=OB���;	�?*�skޢ֢9�[�Z��lV�qo�Z�a��hkO�z��L��.��e�o��2�E��Z�8���|
I�أ����Ů����场CX��6p���j�@�]���O�'!#�<�x��w��>��HɾyZ��*�
���
�r�� g蝻�h
�G᩸|�T��Y�!vV����"雭V��{����C�NJ+��\�7I���0���ҙ%TOz����E�I�:2T�1㪉����\�m~���o_ȁqX} gG��
-'ɬ{�[��^����g�
zf�B�
7xҲ�t#�lQ	Kw�7�IqA��n��UY���HB�]��S�n������J�U��R�@�F܋Hm��z�k��pM+�m-��'�P5�J3&O��&r:5���O'􅴆����KzUieu
բ�[��ʮ|�%�����8���4
@J�4x̯	0���g�{J�
Nh�[rf�m5��X�0��
���O�.v}w?��Σw�O ���P��W�fG�me���O���v}Guh3�5ƚv���c��=r�:]��b"�|�]�������[dz3�ôV�&z�p$���d�>{�� ���w$�*V3[�)���?,\s�=�����Y:�T��&���_�5кQM���S�^kV��C��E����ʼ<��� 6J[��U�.�3��J/gu��[�#� ;$A��κ7f�8��%���=)l���]9.a-�p��7��܆4��1ְ�h�
$K�����p���prVX���N'�6�e��Ȃķ�3�\/�0wca����z��f���w���RŊ|�^i�5�`&j�Cs
�2��T7�L�1�D
q
>�2X0	
Wxlܿ�>쉷r�Ok��m��Kw���%�6g�Lnw
�=ys�d^n�8T��K��o+%'ke1
-t�#0͜w��#���ڳ�+IZn
�֏�U#|��ȝ
K��ƝG�{�����$.y0%,0u�,�n���踈u�_��靳�g��W��:v6�/ֳ�����5�;����{9����Ʌ���6g��_�����ˡ
��-�
-\��%qL��G�.�Y��a����r�P�R5О�&$�Rq|L<�(�{���8̻2� ��;��'F�7��o������a�5p��r�ICO��i�M-N����"�@���7�����#�T�ZUO�v
޵q���V�\
zEBk�~x�iQ��ts��%�8����!�?�٭?	�	�g.k��!�[7���mCģ,�gҊmI?��m��*
ᨺޯ>
�g�T�s_��cK�>�K
-!Juy�eH���I�y�n3�qj�g�/(r|ePg�Q2v���
A�
~׋KMԏ㇕�
�r�
Α}b���}�df0#Vdh}?����v���]S��L��T�@��2�fu�ƾ�Nl����gM�~	��9�+��V�<
uE'���>A�_�b���8-Q���axQ��/���I�3���č'������}4�A���G���9tq��3�'���x�y���o	e��[�I�p���nJ��N��1��m�g��;2���Q�i�����Mu������'�yV_
ζ�5�
��c`�RT��C
�{��g�S
2i}�&?H�"M;c)���h�?��ssQ���N�w:2�-���L���O����ʈ�D�l���aX�5Ӹ�(UY�j�=5�g�'��~�MQEciK�����*W�w
A��<^���!��ru{�ࢩ��+���Nx]k
6R

-���
�'�$O��&��
x���LU���;�#I�&�<�����GտEEb=	%
B�f��yJ)�
-

[bN���$4�j�/�U��]�� �ShӍ�������/?�ȊEw��BH�I��z����~8���
_/�`~9:X�m��}��>�
���ѳ��ѿ����⡽q
�ƴ����M�@��|st�=E��(�k��#�����k5�4����;�h�z�r
ި�(�(�����=�/T
4C	�̂�<؟��
$B��4H�6�Kΐ؇�a6ok!T/�S�djҗQ.R�Z�h�c��`��<�/���u:
+h�ű��t
��
��⿥�P+-�n*
-�X둰��0<�+K�a��0�c.`��RۈI���}�3����Yڥ�R%��ȗ#���ħ�
��K|T�Ֆ
�������i12��A)��(K��X'�%�����u%�GY��5���wM-}�
cΔ��(�D��,�n�jʤ"߰Uk}
�/?�"�'/�n)�S+��o�^"�J�:�?]j��k��Mgj���� Gw5pl����=B=%��5��*��錘J�l?��i����Ҷgs��,.�/0��k����IvR�S	o
J�?
��=���4&�~Ɯd4dm��f������r�c��.�6!���q"�p�ķ���ґ�w,�޹
P��T����#V�Z{�&%Q�wKw��p<9ݨZQO�
%����w1r>�O;��-g��f6�,m�Q�ba�&4�g����͟C���?+�a6"�2�v��ok�pjM�h�{�UZ�̸}�*z����n�� ���
!�>o�A�:y��𪕷p:��&�jkn�T�w·fJx�3"RܟW�y�/�ݼ��Vc�W�s?�Oj1�l����,�8����
�D��g,�&�GW9�~�g��zr�b��'�C
t��N+׈[3~��`����3#���
k3k�L���!�'�<
-=r]�Rw�2m��F��m��Hl$ާ��tQ4�#&�:R9��E�_Pүع�+q��M�8~:}{���~��4`Ab¯�8�v$.m��9���b��4lnk�Y��u1���Q�����c/���d�
-��m����=^&�M7�{$�I�jxުhI�*�puu��.��7n��:�n�SM�4�i�횇Q�tjV9~�hH���x�Sq>������f�I��H�x�?��
8��=�
�Z#�]�G�l{��c-J`�
q
���~U)rv	����Z���q6���,QR*�x�	A�•‹P
F��dH��ў��ʾS5#Y�?> �T>&k���w�j����.�$$�q��G��	��"��FS�o�
-	�s7޽Y�͗�"|�y��
$�S�(��ƨ��|\'؎��g
��
�ޔ�i��;�*��
��^b�{s��2h���,HS29qc7J�^��u�
�o'�'�*8\�
�����Vڥ|����ڄ��;�������!'���;g�ACU
.�`I(�p	.�i�{*���i4*A�
��^�l{���Э��bԝ�P���4!EG?�d��Q���F���P����2=Erp�o��2���Q1���;�X����!I�ǫ6���?
o���4��D�V�����]C�� g�-��A�Q���Y
1;��I��Ɖ�Nט�@.��Qbfp�ҹ��W	�V��t��P�+��
�u-��
���\�*��|�d�#�%�c����;)���e��F
-\+xq�f�Hx)[;wG�<��B>�L69�ݥ�)�A��<�jj
��ÄX�5��.��-���[!��V���W�ٖdk@�9�i����(��y�:�{m��B
�
�� �¯	۾�g�1W�w�
�j�n�k�c���7�V�HO����-�'�\\�R�j4����K�����5B�{�<!�
�e^����%g^���^:p<|m�S
-�t^C)���/c����*{Y��%3L2�q���NZp�_�r�8�E0�<��A�s�4���f���h2�+圹�
���x
{��
Q�V�a�6�:�m�=��l��G��$
-�氭�A�kux
�����GQ���1�|cc�
CfZ���)
-1mJ�̑�Q�m>arɊ��t�}]�z�T����}mx�����G�b�#�x|�e��	�d���i�!�gK�C�
ս^����K��}=�&�ќw���}
��ɚ�e
-��T��
셲�
w3��KtL�`��ӓe;Ixzs����%���TY�y�
�k�yo	l�$?4Y_�ˉ�����MK4�I2�0�7Pr�گ���v
q=�0�E
C.��P^*ݻ���ۿY[Q�LiDK�r��g%�N[[X�/��&����
R�.	BCr�c��dG�Irw�)��1���~���O	}.V��u׬g�U��L�
M�n��=�ߝI
w�
���W\�b�{@9�
 �o��x�d[=���e7D2p��/
M�Z����wO��Gb\
�Ky�:���*oչ�Q��N-��d�S5���v�5�p��n�`��
ҫY�E"�����4߇�sN;Q�����~�����mK"U�NW�5��~3{(m�����	 "�@�e@�_.��N13�%��n�{;��e�٬���?"/��D#r
)R�����a��� W#<F��0w��*O��љ��:�����|i�v��� )�o&�a��K���`��q@��j~�%7�� o1WbQ��A����-�p�
?}]�
%��;^�w]��=NY
�����,Wb��?
i���b�����q1����:bfOl��������*֕�
�ofMsS�NK����Z��q�VY
��MN�K�~����m��JØ[
|D3F����r&a������Up�h���(��..A�
�2
'��x�(	�*@Q'�e�#��1pn���0�*x;��%w�nL°�em��^�"��\����]�S�����7w��D���䶵8�[���	9ʺ�'�~B� ���)GKkJl��Rè�ٹ����T�}? �\�=~t�>�����T���N�e)�1{ӷ�d�γ^��et
@�X1`�;�[I�Y`uA��8�Tpi���&
���I�p����;jJ�D~(L1�#O|�]��y��N꩜��
�������m��p�q���V��&:w2��mɅA��x)����Ѩ�0�dƔ-����.��x�ؒ��v;��y�*Xva1ecqϩ�:�_
���r���X��k&��F�I�X��*m���^�l=��p*<^�� �]�N7-���3�tͧ�+$5y�e���cg5�t���ئ
�B

-N
�^��a1a���۵� �o�$j//���G�f�X־K�S8.M
r�tz�ޓd>z�[�U���L�t
���%�'<{��!ͯ.�=��N5��=6��
��hy�ُ#zSs�Fu�un�{:
-&̣�3�xƋ/���=gDP�Z�C�Zh��X��ܟf�zs�jO�#��˺�D���E�����7��
�+��ýW>�Q6�p(H2 �G��h�j�qe����k
zk�&V�1��j�1���
?Z�e�-6����G9WX8�6��3SG�@v��`��FX���H�`��ɝ&9����٬�Q"o�’�sz8d��ymU�K�r&q
�����=C�
-endstream
-endobj
-3454 0 obj <<
-/Type /FontDescriptor
-/FontName /UYHLKA+CMR7
-/Flags 4
-/FontBBox [-27 -250 1122 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 79
-/XHeight 431
-/CharSet (/b/d/e/l/u)
-/FontFile 3453 0 R
->> endobj
-3455 0 obj <<
-/Length1 1647
-/Length2 9476
-/Length3 0
-/Length 10553     
-/Filter /FlateDecode
->>
-stream
-xڍ�T�k6,��%C����%�
0��0tI7HK�� 
�ҍ�4���J#��9�=�����}k�z��{_;�{�}�0�p���� �07��O
���/�������fa1�"� j�Y� p7(�E�_v8�x�)�0-�
@��	  ���A"�|| ~>>�� apq�"�j����\ n�,
-0Wo8��
��?G К
 ���
 �
�C��. -0�
�����0�YC!��
-��G \�yy===y��n<0��4;����C� p�
�7]�6��1
l��=��O���	�C 
-'�5�������<��it\!.�5�p�� ��w�������
���9��]��.v [����Ƀ�Bp�.6��`'7؃?�
u[= �(

P��������uE��A�~3��
�ᒕ\l`�������p��í{���VG����g[����o
-6O\�/�!j�!
T���� ���? � ���
�����[�P���+�`�@���<�a���=  �
���o�K� �j� XA�.��DPCl��:�z��=

�������a�l`.N����h.������*���6��ü ��b n~!> �O@ �p���(���?��`�_���Q�����������_3�k]���A�0� ��'�g���?�.�3�;��e���
ew'�?�������
u����0��Ђ=���B�!.������V5�a3�\���D��2�
b�
EX��9@���Cx'�
D���� �A||�c{�5kLJ���S� ���)�\�a6�w�_H �������� ���崁x�1� ^
���@�`
�c���[���Z��֎������we�6��0�
��V�
���B�����K��
��y^��-
->���Ԯ���U$�K��t��!1�_����_�0�����<�	� �@�V�_�l�Ȅ�c	
:���W�Xc/|�YK�:ԅ�]���xro�KM�l�f��]������He��^��˥u.o(�d�o}�[0">$�^��X$�On�b�"�(ڗ��â�6����}�g�҂ԩΒ��]_�
ɥg��W}_��h��-��ja
���)�'�σJgX
-�rf)��t�
�?�f�Χ��&���9����}�~᏿��Y�0�w�b�zJI�rF<:��+�-M�b��m�r��W�d1}

W�27!�7��j�~�KSO���Bh3?�F�O��\[�Djg�!�n��!A�
-8B�u�ʯ��}�uH�]���̊0$���Fy����w�
-��{~+:L|��A�~mKe|Cq�F}���02jl�"TWj�d��,��\�&`ٌA��k�g`>j�~�>S
+�<�(���C�"�4J�Oy��I[|6I��D���$Z�Jt�
Ti�ǵmp�ס�JF���AI˔�/�ψ��ҟ�n'nYX�`
�|C"�k�q�@z�0�r���h��=`y�7RT
B�����ً��������z9ܑ=��F�������TtJ�vZtEϑ��ɼ�zR'��*
-EP�S
��O=ZWƃp"���#6��[�
Os&�dx��
��:7���u�V=��Qz�,�rp]��ީ7���$��
�JY-����_=�&����P0\��/���B`E�Erf*^��.�]����:�Z��2ϳFЁ4��Q�_��31}X�Pg�5��o�-{�M�6n~ӛO)��KC(����-b�ڶ��>��]hpd"{�����R[����eL��i�F�$���G�Y�� ���]�
-�9���-�l��$c믭+�70�/&��
i� G(���` ;r�(���[��BCWH+�:C��偓j����Dy�c���Q���}���
17;�_�G�
��L��8�?߻�� ��v�I��[�Ac�Zn\�Mq��Dˍ$���?��ب�6�:�ލ�.�f�npN[��ӴX�$m
�����x�������֔�^�J��LMy\���W��D��{񺄰��6�+IGC��8��u3�때�%首Ս���q��C�BS
-��
��iA��)j�b�,���<) "30���A����:���Hnk�d�x~nv�m�
���:/�$	U�+�:*�B��.�Y��yL/L��C�j�L̪�Q�T�Y��q���{�7� g�M�>���CE����8�t�����ͳ���[jG�	�is��L������q[��eUͰ��־����8F�U�u�Lh�Bn��T
-׺]0�`]tq�3��v��E�-���H�y]�=���\Z��뵌�����C_(�{�{`M軞����8��D�=!س4��}_
[O*H�r����yH�GT�$gmcr���.K���B�T�����m�:�S\��Q�7�sU��b���ԅ����;}o���}q+��zY�i�ܰ�/T_۷
k�E���/��0ץ��?��Fq)I�����̅�ZT�'޳+P�f�;Eu�5K}*�}{[�XQ�{���D)?l?����4
z��n(J�������+<Ϩƨ�.��	w��%��{�n�ׁ���=�9�=�oh�޹� [...]
YqmL.���o|�������0
-�+tj��Z�hASy��0ᥠlX�[h����aMO6����M1.-}�a��&f�igw�~����6���A�L������l��穂݊\��R��ʩ����cEऍ�����Ƥৗ2�&sҙ��ǽJ߻��Rޣ;C��)G�s5��fg=�9Ď:y���EI��B��D�F
��-�@;���-��Wi"�cc8I'�}�����8g�t�m�	'J�XZ�Y�����s
�}������| r�W/��[�?#��~�����ی����/Wc ����֝|���E��ΞPzΙ�O�JN���&.�n�ꐔRӁm)E�KM
-w�h깖���ֳ�j�yq��!C@���#V`7�(Д����i��_L
���d��`9�����k�-�_j��ZH���X��7��u��f�
9���=��o����d#)f>�e�Hv��
-c�bUt��h�
��EQ���fw�輩�8����϶Xn���J�����g5�F�}�]��#�w��_��%Uٟ����J}��0��;�}�'q:�Ω�5X���Y.�z�/?*�υb��&�.(��j��G+�e�#Q�
3��3�`�Ĩ�����,y���V���(���zNc�+r��Zɉ��:��{�+b]��A�m.�G|gyu�l�S+]*�]�؏�)o�b�*L�a��3�'u��|f��>-�
m�� ����ю�y'��<2c�Q����K{�?
�G�

�VW���c8�:�.%�m?=N�Ls܁�fCG�����(�$P�-X*��Am�
��u�c�����aJM	�����D���e��C�>�e�cX
���XȽu
-?����7����L�mx��G��3�]Ȟtz5�ٔpq���K��
r���:�Z����7�I�i9V��+���u�����%OA�}N�c�5�go
g>�x*6��'�P�k�Wi�`m�V���[ɖ�
-H<%o�<�ܫh�

-<xo�p�RR��9U��G�Q�\�4wW�U�.*���h�xȸ:�GM�?=��~���&�;�����t�
��j��C�u+�C)t�٬���Z���ۢS�J#�o!K��k��C��uR�maWg��O�	uD�U)��˒����;�E�
0��x
��l
���N+�>۾*��R��K�&Q���b�7Q at F��}��5���	,��ly�g �9���^��}k�9�h�c%�����_�QIjp
T*�
S����o�ei����#�&�
�I�h�.
&�^�G�/BƐd�7S2~�f	Õ����*���Q�s�'��U]�WzÀz�*��|s5f�L{�\:�%�~�G���'�Zfzt�`v��V�o_��SZ��uCpXaNm�|I�l]xM,��ҿƍZ�aA�1��N�+���R^�c�z+O������TNu���fTa@̳a~�ev(
'ʛf�m�7h
-���|r5�2j�����t��
Ŝ[ˑ3z|��F�k��R��~g��а
3A�3{ѻ����

�6lbX�u"�`��"�LR�JQ�E#*k�^�����U��	Ht
�JL����F ]^Ic0���cS���$�K��yY
}W�;�����ǯ4��!�0TRC���V�Г}$����f�@��v�}�����DƖ�Ig�����Қ�+��L���)ec��c���q�e^Ho�0
l�d�)�O�։��>~<��ժ�7�
���V�R-B(
.�#f;�CO��ܬ<Z�4��=m����GR��_�v�+;�U���}}�4��۽���f7���
-UƠ�B�J��P飋�t�������'�{�
+o�ڔ�	>y�V:��t�/�Xd���*��i�.�\�>�s�J]"#��XK]�M:���d�G7��؎�l[3�Kpw����h�MN���j$�"��q�	9���s1��O�d7��O�	�4{�׳���!֍�;��L���R�W(7��B���!��_>�*c�����/q���0U
IU%!�r�������JaD����w
�r�A�!�n��÷fbag��j�ҩ�1�<f�����i:����X6a�b}�2F
�����d���y�ɠ�S����-��N��{��:Q�����)1�KJ�A�>�M/qx}/��fu�"k���
O��>K;M��˴��e�JX
��U9���W�
��kl
-^(�ڭ�S}ߍ��VS��?��[a��)�<����<O�+�A8��y7��}��(�
�X�	6���Ȉ�,��I���J�\Dp|}=�~���L�FҸ
��j�.t�q��E���[1Z�
>�q*�_
�')_|K�:��'�'����噚?�ը�9�!!��Dn�n����Om�;�8�)�F��ͫ{9��L>f�{�xE3�r|�):�3�O���[L�֨�����������V������Qx�K̰Q�2T6]
���΅C��a��:A���$�2�|���*5U�5
������MUj���� �T������
�����J�e�T'w��Y�'n��&tk�y�타8��^溲�gs�g�LV�
8hUM�.��!��eD��'�O-t�n�1��K�VP�!	���0	ҳ-
ź�"|+Y����.�n�ͧ^�mB�p��� t��B}pQ��N�@����7i۳"�=�ne�8٥�d�Vo��aE�R��Y�F8���K�G�~QX [...]
b
-o>��
u��Z�ٚ��������Thh����
�����?cA)Y
�
?�a����6:���zy"v~�?���C�����]"m_�iq&Ip��z�R
��b�ʄ���h��B�W���e�T��T��0��">�lIN��L39

ˡ�V��`��Ǡ�N\JA�g��]�##z+�i�
�u4���'��E������V?�g�SEO)P]L����P�4�g�
��Y�0�ݴ�
��ϩ�PL���)M�*eHp
��r�:O>%���U�T�@z{�ͬnW���E�m�W��鰙Uj�흩�"|?>�0���A9r"T�j���B}]�
q�`11/�5������B-J�o��y�9�2Yިs4s��ҁ�͉〸��T����&Vm���t�9%t�	���즏��`�{
�Ǐ�k[�&M��]�FF�t���m�k��ŵJ���q���&_Ȇr(&�2}mA8-�H�JZ�'��Q|��R3�`����4L"1�93{��
�;$f;��eIo�҆�׭|������%��Mc��s�[If󊰒׵���(6���f �)��r��QgH�听��5�C
�F���7�{��/��K��S;�f���#ea,���g�y
-Ƨ�jk+��mt���S������ؑ���j��"�����l���}K����I~��)}s[�V
��
QljTJ�ϱD��Rn��3}#-�0�
3�C��;�*uއʸC 
�%��1
�+ے��``d��Ж=���gr	����%�˕�&�N
��B8�g���;���%��#/�蜌{�™�b��/Dk���&�~�?>�
��:}�d���9H!�J�
���wҬ+��x����j����/�6��)aťu[I1���\�g�	
��́
!�T���o�_Gs�iP�E}':+<�o�h�C��l�<��~�VNL���g��'H?�� I�21D������&��X�m�
�B�u�������b4�'D�"{`�$\/�:
-!��IҬ�N���~*��7���B�A��5u6+��ڡ�S;��KǨ�帡~?���*f��.�'�;�ԋp2Qa&I�n���(�������4d��2�T���+�I9-��/Î��֢�/Ǘ!��
[2�������IO��̉D���7�[U��\1�&�T�GM��qF8�Q4���Kؕ�,��I� #��eH���`ւ�|ot1��Zcx���T�T��<��ʛc�����S;�k�s��/W��b/V�|�p

v��6A�x��٢�Z���ҙ��y#�Y(�#�
%wX�b����G�^�4�M
-�LJt�n�8��u���=�
��mǛ��yy��R�֭�.֍��.�'F>��j]qu�%T��ԣWV������抝e�~�T�L���_΅.�:�f�5�l�4�.��M��~�3�a�=��P��`HŶV��(�d�W���������s��&
-u��4��=�|��1A�s^px��7=�"�����$Vl��,����|#
-
�vdh�g��+b7al19��s��|�"�	�X#��8
�BQw�V��r�i:eF%#!�vxX�ܧ�gGu���l�'[32M4�a�����ٕ��h��
�y�ͽ��y��[K����Y\����$ ��ï�����b�.�5z�5�O�/��nm�U
�'X#!	�i5
(e�X�V�R�II��� 
�s�V{7*�ZL
����#�<D#ŖV��>��v
?�|s��Б�4�p�M?���{7�<���"�Zj�|�t�Vq(��n�tP8���霎�+�4J4#
���Hp쨘�3\������t�fH�mJ��l�ɑ��%��ϔ�
-{� a
&�+��]�|!�}��0��е����m���<�,+;!�������������gٹ�NF��~ 2-�!n�����Tm����7Fb��Ў�'lz�]h�v�lᴏ5��T���f�9�]��n���卵z������˻���3a�l�&Ѓ��l�P")�h51�Y�����SwǠvJU$T�
쿾 �w
-/
	�
-ߧ
�����k_T��
-P�[����E�JyQ� eW!�����?����P��+
��koe�s[j��R�׭���������u��
	/{R�b�f���_�7��C�8o&�_��c�ˁG
���t�)#g�$�*�i��9�0�
*���i@ ��屣����n��v��.i:T��i�e����z_y.J~ʥ��<��},"sO �ʐ�۲) "i"�ޫg�T�!��T? ǵ�h�H��1,��ާ�Iᝓ�y�8��P/4�>�<�����D7{��\&��|Q�h�ו���}x
�["'���?+2 w��U�}�� �,��A�|:c�ap�t�EF�!ڜ�g��*����l�&y�@��C���t���i�_2���g���a��
k�xD'��X��(��x���~H1%�|����#����M1oz���™%�D I=�_t���,xr�'{=��a��z<���6�h���m��ȕaB5(ȩ�f�K��
�0hB�����������=�R��n�	
���JI_�զ���e�o�~Y�0��
-�'EP��&h��V]��O�f�H�wX]ѹ
�r2�iL�2�6��
{�K�t]	��R�,�8����>!O�3���"�N�7�9�r1+�D#G۬u���nǹ�;流����gbT+������b#�5��b��oZ�4l�@�CV(:�}NFz�*g���*�2�	
W�N22��Ԧ'�|@�]~��{��P���1u�x]ќJ21]�9C�i ���u'1���O�1ڤ���q0&��l���)���k]n��_�̫��x��&n��>�)ٴ�e�|~ 
-�t-�H`~��v�d�
�kv
�{Բ`��K����������5�$��\9���<-o�7���V���Ϩ^��Q���t��7���V�zM/�7?�;�R1+�%��8����
���]�
��I����G�+�������ײ[	�N2a'�6�Z��䍸�m�
�J7�N��gD=/opĺ�1=�����8���W�?��I��9�
ta+R�9Bd#� ���&Tx;���v+�.��Q5Ws�r��G!&%��4����	p�$�9~I~
(��u��"�Tv#9c�X/),-��q^NAC>�!HW���8�\�N��2�"���ͬ�Z�:�*[�"�	�u��b2��j��P�f�f��2 YJ�O:��eLU�
-��X�q�L�YC~��j��@��vG<�}�XՒ
lD��yV�0� b�~r���h�%c�.�� i)��H�O��U�s{V�v���J�~\�����?�t6�~Ť�I�N61X�[�ݜ���
9�Y–e�:։����K
2ұǫ�����9�)�T}���b�ڢlE
x�r�6�+9��O�5m^-�k����U�/E� �Umm���`��&:s���C~�5+�ܼ8HE���
У�,��%�<rj�eL���K+V��`���%r(���t�T����N�+�C*��,�Iܦ��������s]j
-��A�e?**aU�I�X�=�կ����{$�S��=N��L8�� "Q��.��
,�dF���	���m2�ñfT�[�5�>�α��+zkΚ�o��y���ōl�d�:
-r*���հ�D��D�����=>[L�^u�x[nw�uM�]��P�R����G
-���ע�H�~�
-O���@�a?nI3J��
�B6%�����_�N���tX�0X���0�

Y���!�v(���c�XDˊ���B~ߐ[ J&�i�
�L�\W�Hu'�����aH<�>2�Im�!�����N����!̃ [�������0Y�n��;�6��	���X����h_F�ǭ���3((���N�M��uF�~I�:z�P-��C�1Q�h���d���L�D#xp8����K�WdyA�T#�t�j
�Җк�d�(~�
����P.d}U�4��\����1H��
-h�0�
Z~s�M��q
c��T��\��}�n�ܯԨ���hr�:N���NU�vP�M�}����`Α�V���J�%�
?n�g��r\��ي��r�߲�^��cn�+
��q���i����Kѱ����7a�G?K�uۣ)*���!�ʂ�X�+��`�F�&�q-8�ݤXi���A�7 ���C��ɬ�S){�u�8��
�� �
 ��k�y5�w��z{�0F��X]u�M�ތy�Zh3	&>�q�G��źx����
[�,E%
���o?.�^}��?;V����1мh<x�ݬ�U�P�L�F�ӝN�'�
g*f��s�,g��*̠�U�ĘWN�
�mpK��n���6�
�I*�V
-i���da��%�?͌�=z��ڋ⿥����rlإh0���R�xq�B�JR@ ����DE��gkZV��]�M���C�iI��Im��
}�o�k3d3
��@?BBq��m)ٝ��`A�q
-B��
�t�U4��g���{�
-��׶�,&F�'y��z����*�
�r��F̂���;�\�/]f��7K�[k$ԑ�񅞖{����
J��
bZP qQ�c�n�Qn��ia�6�5�мdٮTB=b5^�P�
e�ݽ��sǮ2��9�2��-+��g�hڭv�~���ݛ�!��7N̔8})�m��$(��4_g�E]�`�g�`����F:Т�x���D��}�;��:��ka��V*��"�B/�sOj�əa �
�H
�	H������
)�k�ak��@�Q�0��h�Z8�R��Q/9_@�;^��C::`X�k��ٛ�<�~��|Hq��f�q at n�0�kVoGH��
�R,�{��M 
��L��0y�r"�t���1M$�iΕ���>�~D�6��`�}�	XWl-5�Ul��N�VU~��W�/3�yӬ����GjU����$kV�
-endstream
-endobj
-3456 0 obj <<
-/Type /FontDescriptor
-/FontName /HRPHYH+CMR9
-/Flags 4
-/FontBBox [-39 -250 1036 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 74
-/XHeight 431
-/CharSet (/a/bracketleft/d/equal/fi/h/l/m/o/one/parenleft/parenright/r/s/t/v/zero)
-/FontFile 3455 0 R
->> endobj
-3457 0 obj <<
-/Length1 1481
-/Length2 6528
-/Length3 0
-/Length 7532      
-/Filter /FlateDecode
->>
-stream
-xڍxT���6"]�H5 ���{�
C  �7�E�ޛ�t�"
�Jo��#��|������k}��Zɻg���Ϟgv��¨oģ F�ATp� /�$@I��B���/���/H��b
E� �	XL!�H(.�%w��)Qh���� ��b��� A~~���wI�2�
-��4p��E	���upD����`q $$ĸ�\ �P��
!.�  
`� A!(��`�vD�\%�����x�.H^���,7�
�rB�wO�2@��C���`�E��0Bأ��� � �� p$:�����F� =W�/��_ n����
-�+ݟ�_�����@��
-��@� {(
�S��Ey��@8�C"��@O �C~o
PU0  �
��C�ܡ�($/
-�ő�W�1���J
�$��?e�;�>w�?�u�#��~��p��/`W>8������6��� AD�%DEE 7 ��������+���!���
-�GӀ@�!�?$�@�{@�������  
� v(�����f��_kt�ݡ� +~�� ��^�z�F+
���|�
��b>K
]#3S�?���TTDx�x% <�� Q��� �y�u��m�B���?2j�� ��H�O�o"����gl8 ����@�`������o��!�
�����,����{G�
0�o?�_���t��|� �z�@�gC���C� 
�
�p�o�
-���Z�<¼��١HU�7�E�
�����@׀A�}���AG����=z g�݂D��
����U���_#(("
- ��}�
-@�D ~�YC�K
��
G��! 4� �=�Wc� |@$�3���/�o�� ����Eq��y���/?����?�h�+:	��%~��{��S���;��[Rh��
�7D07� I�9�k��Q���Y�YZ�N��A�~|�稍��6��\u(]�,bbƟ���r��ѻ���4�|�J��O����w0��aL,=z��0р���[���U�X��櫍��
�MK�]�
����1���ױ��Ԃ�y5h���]w�
c
��ķ�g�m���|V��e~��>��7]�P��Z�*�����&c�PR?5Eb��$��ȹRYju�K����b�?�
-�Z��<
t����7z�!Dfd�O�lײ����oJ�v�IgVd�c�f
V
��( 8u

7:S���

m���X��P!��������Se`��_^(���\���毤S�4,���u��=�
r�~}�
�0�
?�jz�6�y�`>���
N0o����I|�!r��̔SEU���i��?d�����ڡ&e)/1;�o*DR`L��X{#C�B2\��)1��A���J���2!M2��O�Ən)�œ֮�1���m�`�~�'�g���a���D�M%� m�M��R��
>�Y�W�idK^�(�>�dz��g
���
-uQ����ɠU����}��2ގ�u���nz�7|?�:"�T��g
-+�U4Ƌ�(}6��j��5�w
�7�}#���^
v��j�=t�Q
�K�6.!�Z��U��0�4H���]"�xC��
��Ѿ�`
&�5OY�k���)����y7�g�Z:>�~_���U���B���뉾�Q at t�
�nZ���*��4�DY/��F4�Z�O��
i_
��
-6ߩj.C���PyOR��a�l��oE]�7�}@o���rR���
?�y��5e5�@���Q�6����+�<��⪱ �H�ҥ5��h��
/���~�e?v?Ggw�A]�L��tPedX�a]��F�Z�U�70��Q�N���?6�5$�i��2���
>����gX��
.!��c�<����W� �кj)�vjǩ�7V%-��IT���BiWՊT
����O"���{�����ϖ��$����R)9�2C�d���VK*:
1U|kL͢�0���4TJ�-��1Pv$�&������
�!iw�Kgg�TиԷ�,����"/k
��:��.�B�$0�
�
��k���i��� i�	F,��
-���<�ŏY4��eh�f�+���T�H�+����L���B�g�4ws=��I���Yݮ�r�+�L��'�G*�}d��I��K�$�#��h��:q�� ��Aqdh�
GX=Q%����$
q8~����I��/�OO��"�mȔ
?�I��ef�(���|�7���gS:�Y\���5�J�� �\
�sc
�޸�u%�'C���B~��T�	��Y��t�j��C&'���m�yF����oFg��
!ZCl>2�a�]?=�&��Ư�A6�����KXY���b4^�y$:�\�<��[�
n7b*���J���0�&P9�U�![(�/d��Ue�׎�1�O\��[����EM�
��O�q=�˂ߺ.G]�
��S_��ʉt�B0
Y��ʷ�� ��u_R���W�ί���v˲�϶䦹	1�O�P��
GR���(�.�
���:�#��m�}F�
�w	���m金�,Ӷ:��<g$�	}ȞQ6�'��J�(|\$;Q�
�K
�YW~ζ�US�cb	�|.�bܪM�*2��b�x�,y���c�����٭"0[e�z'-Os#�{A
>�^ ��ȹN���OT�.C�ՖW4=����co���@C�
c�{s��1���EZ�>��6�qd|�u���� ��I�
i-�ϾE at n�3
{��G����)�5-�Y�X��yʨt�%	X�s�99{�Ehxυ��Y���}�Y�-ŀ��m纅n�%�}���1�YR~L���=��V��Q�m��K(b��^�0��z
EUX�O.�r��烻�\�	/�zRT@�>�����ӷ���ꜞr5~�J
�1��T��{�ɤ&@X�Gt���g� P�@��66����}��t�x)F��&�eOkv�w�=�v_��[��P������~wjm�!�/ߧ��9�I�n�0��h�[
}�<$ߖ�U�]ch,��7�*�/GV�Eս_��mRXKi~׎�uԎ�_Xa{#Gu
-����9�C e����
^���.�8��J�Lq�݇!���?��+�M堝w�F��n����wɂo�|��₻L]�7җ��J�
��Og߶dݒ��n]7�RZ
��A�$�fD`� �9��%b��Ǧ5� ��M���ɽ�
-Zx�qF.��jf^vkd�
,o
_4���gm'�l���K8�=�K��|��XN�����㗈gi~�J��?o���:0�Gq�@�`La;�|����?R4R�8����2p�
��)`CN
�;�;ڵ[K�m
x����҅�

8Jd�ro����qBk��+�7P� �5׷��qq�I�">����&G^q
o��c����
�+*�c�>U����}���^�/?p�~�
,33�f�
�����y��%Ma�J���/����^��/�C��|Iru�V�(�Z���y�7
����$��m/�YM�g.��cS��-K�sdQ��
s$��["���$�E�G����1>����]�Źl�Յ�`���;gy:�@?ρ?8�S7mܖB֝���=�D��{x�m�
-��*>�DJ�~j�b<��h��?#�!�7Ӱ]�	��
7����I���,��.=�n�-d��q	ó���dNz.W�'�5��d��*EȔBIJ�N&
�U7��ґ�n���4���
s�[b0y�� ��4ԝ��O�C�f\\O4#��5�+i�7�G;
-�AB%+۝�
�g��G*�-�	N2O�� [�~^�ն$"BE�S�u¹��[k�{
-�w���^�

�<Xz�8!܀��2a�@��������3F���g�m�t��_�X%~~���
a[C�8��� �
5�|ڰ��1ހ���;�)oJ�>�u��d��jj�Cd�W��g����s����o�
�'�P��]~n�i�/��]�[�U�%=��
Ys��.���A�Q%��
Ӥ����e��g��Dli��
]"`
-�NQi{/oq�!&J���'
-&����YA�:��J�$�Ѩp��"m�@���?�Z�i�?��
-$�A�r���̀���h����	����7;s�\) �'���>l.{H�L��`	WF������klź�j�����Ę��#o�����O��e5
|������^��j������Q�Y��2͉sn=�q.��D��\b|<9�V_�"�W�Zi��~����6�b��O%�b����W�
�r&/3���#
*��י�ٙ�Zx���d�T𽚴U	�,M�d��P�y���A��d���h,��R
->��[
��錓�:T'ılN+�%u�w�
>���h=�c�������	v9Y���
�Q���8f㤼v3b|
~�����u>�Ó+t����?k��O]^)��yȾZ��eޯ�����̀!������|f��X�U9���Pe��
-51Eg��;�k�{4_B>����@
��B�4i�;�t�,�:�t�4��EyRJ������5����U�hH;�@�HzT��Ŋң�W�*�s��9���
-9j�ٛ�g5���i!h�
#r��dm�
�PZZ��hԶD�y�{�%R"�Z�j.��r��V��<M�U�jr��Ԫ5�U�6i�#��`O=ǃ�ii���
�q%��e���I��=~��@��4���8��d������v�
+���~M^���6Y���ϙUK?��+ϝ��ȹ���L�7��_dQ�i
���S��9�;/PӚ�w�
ԭ�j���݉z��wdL�8i���/=��{|�0�[YE`F���z�3�� C|
����G�O�Vt��
��M1�� ҝ���γ �3�
��E!���qe:'��$ͨ��y>H'��6_��S|��]bN
ϫ��!%��h�2
-�{�
�r�����ګ�$�	�w��D���<q��������\
�S��hCԎ�Up�-��5^��^��ztv1�?@�
��Z���*�B�`�{��Ji9ϟN�1H���`ڮ����(5�˳}���R`�\�fh+_�*��	o
��&��'-��0~j����	���c���~�7B�z�c9�ו��gހ�yOP�CA"dG��+Ceu\�dEo*��^ы�ԙ C�^͔��l��$���*�\��;����
3�G�Dz���7t���~V+_��K�!*����\_bw�B���.���
-����ֽ֣��f���fi�\�yc_<�:�7���@�J;=�������&PE>K�V*��Q�#��\�
��,$�V�<<b��2S�A+�!��w�eW�&	�|l�qe
-`�
x��ҧ���@+�K���刜�h�S�'�=���3%��v4�� � �N.9���(V�ęy���8��
_CuSR�
�2��cd�7
-�#vTr�*�R�'&�l�ݹ���
sȼ�-��}1e	E��I�돺
�����#�i�,a�CZ��	�y*�B�KE��Hw
/
+��k}�Ҝ�I}��4���3�"0�'�S
�
������gۙ��*=��b�r��c=N�$+'UL��
�crcG{����I)���%
}��T�#T�o���fI��x�&�V�����o�
��HP�����A���;�ؙ�i��@��v�:����z�u��vGPz�r$��
�tE�U^c5�SE�Y�LO�%�N�F��6��a�'4b�M3���D����*� ���(��ƺ����}Z@� ��eO�*��⦥��<��۟��~�� a� ���bJ;�1��]�:�Y���3����,A��I�0�+�G�ϐ�H��"�<iU-�յ�Y�}ǒ;͖����1\�'
�x�,���
ռ����bP�t퓗�zn
V.�|�'�����m;
��è�(=>�d�>������J��+���A{�G�lg5�����n�j
�޷���w�J\�2���J5D��Ҵ��n�y���í�4h�����	%����&J�
/�/
���M��جD�Lak*ɲ#��R� [...]
��K���1��<�Z���X��#��{�l��
��_
-��R� ��#iE;�2#�w|��|Y��T<
p�B����#���
���
6��A
-F����qT�m/l�_������{��\�7�]�԰�������.ރ(�^�3/E��ĕ�k��ּl���l��s_���

��G*��
�D���:���Ǒ�}.���
�F]l���sl��_.ν-g�/��A��I��ꙫA�X����ݫm.���e�.��5��Q��n�S�9 ���ד�t��J 
/���#�{1a�W��*;�ܫS�I2
*9�=�`MP�闗��4&s�M�Q�'3�t��<ջ�:�(̩�����t�J��`�Z�4;;F
��#�+v7��~f�����
n��ƒjL*_���pL�2�5�[���Si��E��Z=\M��; Bo'��nD��-�o;�ݽ�K�f	���D��3LݪG�r6�l9[ve�c޲IjM>�r����3~Z��!<WϠ���i��
�x���/��r>�z��%
-��%aqGl��c)1� ��Mǜ
T�S������a1����t'D��T�q���ܑA��O���Q��{,â]k����59pB
�^sw�D��=(��h��s�/��j�%�e��MH�oP��Twg.���\�k�������v�&ĝ��na���Y�7%�nlU�A�tA$���.����?�:ZO����v���5y�=<����^�������#�G.5k?Z��H���Kvw/վ��O���'�)�c%%_�������-4D
S�؂�Y^<�e��N҂�7‰XG��֖�+o�E��(���*:�˛�d�t_�O7�
��gm��2W�4N\��8���
��;m��������n�I��t9*�6JM�
-|���c#P:5�ը�a��h���񥄏�z9J)ʺ򛿃���=ɵD���i�zKY���F�Ҵ\���>�޼�#i���|�d�D�`�&� v_��K��G\y�{^�1$d�~��6KY����O�v�����VRN�M������H�s�5��4��*��Or�M,&kZ�����}	���ѭ��^T����1i=���c	~(N{j��Ю���ӷ�$j(-J]�k�WC:5]ː�M��6ϧ�j���BA7�+9�\z| � �*G*�3?��0��.�AK�G�`8��XtH_uƍ��[yn��ÑWy�շ6��)�LP��8�J�ľo)��W!���
؏��1�>ߺ�X���FK1*����Z��!�B�������Z���x����cs*:�,G�.2���:�'16��cB(rԸO��3G���
-6�ܒ�P�L���p�oN��=��=PyL_`�7G��4�˞"�`d��� ~)�G
-endstream
-endobj
-3458 0 obj <<
-/Type /FontDescriptor
-/FontName /ZMNSWV+CMSY10
-/Flags 4
-/FontBBox [-29 -960 1116 775]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 40
-/XHeight 431
-/CharSet (/asteriskmath/greaterequal/lessequal/periodcentered)
-/FontFile 3457 0 R
->> endobj
-3459 0 obj <<
-/Length1 1504
-/Length2 7108
-/Length3 0
-/Length 8129      
-/Filter /FlateDecode
->>
-stream
-xڍvP�k�-ґ&z	:(ҥw�����PB�Uz�"*U��D:
-R�. 
D������w���L�>k�g��;��62W��
�hN

) ��Mo� @ ) $I��o������)�-�,�R�_j8G�ԡ8��>��� K�2
-`Y 	����( ԡ�@��F����jh<��#��� �$
 ��ˊ��"��Ї�\�HBE'�;�턀���J!���y(HH��� �H,�qQ� p� 8��� �
�H�f at J~��+�7E;�|�8� �#��(,!�
�c �� S
=��
��Y�� �@����+�;��Fz at Qx��p�
5��8_� ���r��cфx�7�u$8��9��j
��E�Ax�@,��E�_i]�@���H$
��R���:w"�
/�g�n(�����3s�E��!a�Bxz�u��r!@��`.p
 ������=p_'W�_���
��F�/�� ���p&��"��J,��a�������%
�!�p G�
E�Ov
w�s&
��؀�@�>�y�#�
�F���q�=_	���jf���v�&��/.
���#�UR
 +'�w������o����n�ꠜ� �?�����_��kc���`�&H�G�� ȉ���������e�)��/������,�����H�;�/���p���Gv�߮��?���!���m��A	ۡ�r!(\
,
I��XM�/
f��9����ߣ �pG��Fh,��
�����tNn��
-�0��&8a��]W儆�Z>I�
 ��@� ��$!�?���0��oy$�(4� p
8�1���*��b	�X7�\�`I0@uq!��L�o
����`B(ꂁz��� C	
���
A 	,a}������CX�߂#��������('��N��V?l<�Re�_
 ��o�L���	|��w�#���� +�җf��Y��x ���Ѡ�m[���T�<
�F�כ[�=?v�\��`�.�e�"�2|d�I�`Cj#�d9~*�.�\�����l-�
�<9��Ne�Ū�6#����7��mKwc��e�c���8wx�1����M\F��tw���4��BݎJ��0F6&�[ܹ}�]l̏�o��	܄
�=KI�a+F�	̐ �G�

|qo�@H@	��>UDąD�v����ʍJ����O��RVW�r�g�";&3B��N�}��
m��,j��m(҇Yo#X4+y���ʃ<�S���;�Ͽ��A�
$�&NPX��{�}�d~^���md�t��]��,���'=ɜ�|����^���V�_�z���1�
�=��F���%��|r+� �O���>��v�D�Ҫxz�x�bɮz̠���Y�,y�uk��[]�t���'X���+V
-tCMO!��:�J7_58�	�h���ԧ77�p5J��+R�\����௕ld�p~!��Ŗ��u�f��E�zQ�?%�/��K��A>��-w#>�$��O�Q��W����v3��y��rʺ�~7�6
�w��j��7�-��>o�:�t%�*�3��Q�uCx_Nl�_�b��`����b����ȸ���!��R\5n�be�-K���k;d�����R���t���G&�y}�$�Js��~A�U"����iq��h�8dσ��y>x�'{ܣ�/x��Ruαݵ��q!#\����)a2AWcV�
���<ZMF[�J�$}�m�aV�Z������L~�o���d\L�Q<u
,���8�o�
-
=�{Qn�q!
-�ޝ�rb2/�
�JҦ_`� �f~#"��hc��(t�����$�ß�{������m���!!mL;{���@&�U�B�;ѻM\R2��.2�m+w�
?l�d�z�!mE��}�s�
�����{�©�yW�&�#�ɏ��$R%�`�+�J1)=��ͤ��Këj�zN�Ca^�KUYQ�Me�!Ukaܐ�Dۛ�"�a��i�c��v~j����.������(�:O�[d5ls����
d.�~ϧ��գ�t����Y
�榪��ݼ\�����.��>��R�/�VeAs֑�É
{
w�;��!�C��㥶ho{��j$v~I��l~��1����R���b,�0��Hj�k5[��
c��pǫ
<���^'������A����%�N�#���",g�6I�Ͳ�
�F\�O�e#����w0`l��	

_�
����|�򑜣��
�{SQ2���l��X`,�p�3#�	�x��4���
Nʦ�TvЉ���c�9~x�
z=�;�{��yM�Ɖ����P6E�G������`ַ��S5��R2�������ǜ�P�A� d[E*A}!
�=�ZLSz��2�k�'n��
U���-�	'�~�4M&���q�g��$�M��
:��6Jɢ�+��yB����<�����
-�����р�Iz>>�G�	��R]��!0�
E
-�o
_)��R��g��7��S���
T�أl��ޟ3�]��/oJN:�
-������J+����@���" 8zTW

z��6�s!�
G��t�\�*8Ye�9.XZ�M�*��I�e�8>ٟ�����%3�9�|<VH�Nsx�^r���c����\{ϩ�(�3⃺�ٗ&l٣Whk8�����@��f�ʎ�
-}4��.<A/u���I"�ba?\�a���-�Ҏ����g�A4���(�w��T�y���I'C��#�����}K �K
��w�Ʌ����em�Q��7�]�*�����`R[i9���^{=@f��F����:֍
_�5i��A�^quߝ��֌1�"�v�������
^��T�(	��c�O4K�p�*{
�x����Z��6$�%
-�-3j�^��\�k1Dt�b?\���y`�6���#A�}���Ǯ���-����d�u���ȊWϹ��Yy�E�7��t���
n�TT�Hb�x�:�e�޻�Y�!��8Բ6�3 at w�����&E�)��Y��b� o`�y� �N�u�c�
��X�<���+a��N���5�Jw;)8��I�g�z�_�2��
-�
�P������
w�~�Zsb5Ur5;b�6�r[#/�NZMI;M;���P	8���5���bgn�\�]�<&g����/��(q�����f��Z#i+s��D��(�W�ȕi'\�h)���BC"l��={�=�5Ý���k�'ys��i�/��{���*�3khԖ��̻�kE�fwy�
�j�
�Kb=��)b���������u
~�O{h�^���X%�]
�� �XV{�]�[bH�i�O/�ē�;�*�}�놏܏�]ޅԲiM~������w��9�՝��9
-����`������Ԑ��5�Qσɔ�)�^DD�,?��d���T��x[��R��4�k�C�zh���y^K��, Y�gi �P�6�MN�]��
-�B f��R�U"�I�w$ַ� �N)[�^��=x%��ڙ���(�]u

s��pޠ�s`J1��+,��ُ�F�Uz�B�^���*�
=� �>7n}�4���l=�Ѡy7\�5�n�1nu��+����W���z�u��*u���ēF�<

,+�C��"̄�=�W��/�j��l?�M��8`�o+�
�"{�W�R]Ͳ,��"�Z�����-���`�G��^w���m�O%Q�+��oD��t�J*����'	�/�1���M�|�a��
���!�^&�􈳸k��P��N���UBK��yi2�����B�:
�>�k�Ir�J�O�S6_�{�W]}�D��=���xU�,�����f�
tF��u��3[}n�1�ܥX��z�k2m�P
9�ڝ��p���4R �����"��ޣ�qS�2�
-�����U��a��Pu �Sb�Ƃ��"Ӫ����9���3 Q��d�a
��C�9q��g���N���[B������pXpV?���l]W��mϓ�@��7�=��'
��C\ǹi���ڸY�;�Z���U�=9��.j
rf ݰ���GXc]��(��֐��
iJ����'��[�n	VԚ�J>��!9v���e
�Z�j_J+��
Sm����DQ
�������ę6�E(�O�����E�-��Km�e�I��Dc���ɉ���3�l��[�/εt
-��t�)
-��P]N�>���[��1{�+.䔏
�?�ou�U��Vv��Y��>�>#cd
-y%���hҬ�9j<��y����C�|�R>5��tS8���@F������&�뤻v���]ON4#S�߭Ͻp{G��v�	T�S����`��j|��`
����y�ɍQ&�d��2T�Q�ⵥ'�{�e�w�Nl ��_��m�Ku���Ƭ0D�>-;*p���t�q����e�ݭ1���^�܀�q
#�
���rK���!�o���x
-�e����N���+���F�r��[W��Jz����5󍤞��O���ʀ��=i���(�6�au��R�����&ކ�\GF��h-yٷ��l(����~�;R�
�-�Vg���Py��H
�Z��j�G)�S�(vtF�\�i
���|q﷧�<�Z��j���ޞR��4k�l�o'%�̡��
��Z�٨]޷�C�ᙰ���"��e%��"���۹�����p��4�s��
�9rܭ$C�|��
-1��8��I���%���|MY|s�[��EX��K�S�q�)X�.�C3w�����%ΐ" ���7|��,�����1_��	 :[�
ROh[�u�z
-ↆ�t*��4��y

��
-/�=�Jl�[I@��rz�M�9
��G;��+�}���~�t
9+��g�Šo��օ�5��ګ6
 w˨���8�ږO��'�Ѫ<ⴾ��b%��ޫ=o�2Ke��Y��1�=^dpY�!�<�?�m�>�m�]�G�vۇf탲���4�䡗��n\�?0�Zp6 m8MQ�OW�/�Թ��jd�_��Bz/�K���s�?B*���
�P��?L�E�+
-/>��ƆA�cY��hD��

-
�
-�$�uZ[�
��,lOYy��.
�
���}v_R%W���������~�ʰ����/�?]L��yu˗�X����#�<�6����<y�*{���B=N�hٶ���
���%��ahɌ�}nB9�/}��ؤ;���)p���Ͳ
�f���ZD��q�@
�x�t�1�c�1C��L� .��]��|<���
d���|Ȫ�Z�R��yj%>�AV��9�&e/����%��;�ݹ��y�4��sO��a�d��V��u2��$
����R|2
�k[T�M����I���&
-O�`��GĜ^���
�f�3�W{<)Z?G�X
�$�+m�W4F?�d�b��5-`٢�i�Y��X�h�2�1$=w�ìȵo�e�m�\_�wYyl�D��^�"M��ۖ>︕�-
���H��O���aHև4�!7dp�;�9�
-_�p#���m��O`T�q�#�[c�
�K�o�
�
m_}S�DN,�ᝎ>��~���)�v��;��$R�3��9u��*@W����k�*��YٴضT��9�.H೉~���P�1i7kf+BV��'��G��AxF�Tr.�C )XtM"q2�	��4⭁���7Ђ�$!�s5�UEf��r��Su��f{S����z@��
�b<!@��v��
-��:g�f5.!y����8�yä�q�.�9�nf� k�3��aE02;�iT`v|�-p/
x��^V�J��������$(�]%�L�����s���o��?1
��\az��>���P$
��_b�P���ܾn��?dx J6j�f�
-������C�
wW����
-9�j�
䠭�S
�=z��(Ph�)�=
�枋�ѭ�����Y��g�^��s��M���B�p�Y��nk�ǽ��7���2����Ҁ�۫[v���U/�p��Z&7�^�n�
�ݲD��o�-TS
�o�@��=$��[�	��j�R �%���U A��p�Y�}

�V�Wm̫~W�drմ���&�$�$��K�B]���l_P�o��k��鏔(bbH�S��L���v���}ae�.a#~]�%�g�d����b3��%k,)�nm�Ei�'�
P�*[0�w+��}����"�t���i�Oő��y��8n�g��R�?w�]V��bB�Y
;dž�E�O6�F�}�}�=�NJ~�
�j6��jn��J��nn�~�1����0�@�(2�W=^:�A���%�&��+K� ��J�>Ed��H����6f��S��u���tN/_
����W��92�������b���U��z�5�r��V%>��u�K�CM_��V�
�ֿ^��j}��ɥ��l}�/=�8Z4{{�3�������d�V�b�V���7�
-��m�4j�6;{w��|�S+���%�(6� ��i�M���5��͋̍��%[���e�Z���<��
�sKy&f�l���RD���$�fa�}m'9����0Xns��#>��⬞�G�zL�ͽ9�BI5���l�<'�ʅ���#�O�t�!N5�~I�<�a�	+Zq�0�vwԸ%��{��Ňs�R<�;�}�ݥ��D�[Ϭ�~��`giع��V���"<���"�����L�8p�9�-ڥ����6��v<�j
c�\�[�u�ݧ�`=�$#W����Q*n��m�kU��
؅�=|���:6ȱ���$���%��
-ʥ\g����n|�S?!v�$��5�ƻ�!�hYV0s��6I�垑!���#�Ē�*5
-
{'E�]6�D�*�4�U��U3�5/��i�3�7܆�!C`�U�E)0��g�:�wۅ2���	2�mL��ܹ ��G����J�5��3�}��Aj
{x�To.�
g
��-�d���F��#-����C������/0��%H39�OW��ukה9�^F���n��#�>o�
�/��tK�
�uo�Vm�gn2��(�q��-��j�)|���߃�p��
��on)��^f��Z�~�әk���S`�奫1���nB���ﴽ*^�
}q3>�l�0e�q
o�(S���
����y�Ѡ�
�4w��{
���Q��8K�l�
�;�
�-R
�2��T�� �j���,t�#R�5$}��Ht�/��v�$B�E�َ�}���@
hn�so�r��)j��c�="Y�h't� �v�5�3F�H"�ޠbɏc��
t���sŃ�N�~a���S ��I������d'EQ���CeI�a�r�d���-��G���>���V���Э��/�-م4�.���1/��uu�jU��w��
��-�<�
���%���o5\�YKBh��f^�*g�jB��%��@ZU�����55sj�
 �
-��|�XF��ߕ�+�����n�:���B*"���
��8������B�����c��U��&l̒�B?�^���o�¶	�N>�~p���4�$�
1����}��Σf�����4��*��&���e��z���h�!�a)��X��8��,�:�
�:o_`�n�t^��`�467T�����p4R�5�b��-:F�=������LUλ0)����
��6��
e!��5�xn��)��rA�s�<G�2D��b�cm��Y�9�r��wJ��4�OS��Ri=

��
+���j��ZH��-��³wh	�H���]T
ؘ��ƺS�VUYD+(�^��y�UWG���P��/���hԨxw�D�?Q��E�5��
-{ź3��AX���� ���=RMоI��ɪ��g�x	3�1�ѴB��}!���F� ��N�.�V�D��,@��h\F�A��vXȳ�� �Ig� ]H!έ}��B���6*�=���΃���\$��‡����#����{�{\P
��`����q�|��H���
-���k�R�I�<�`�
�c��]�E�c8�5b~PO��D��)��C邎/���%ė�]X{=���_������6���[S
��Qt1&��9���Ĕ<���V����܍Y��F�m�
�*+>�*�+Wꭘ����(Z7�Ԯ�c@�?r㏌�����Tg�
nt��
���r����!Ŗ�N
vH���M3jk�R�3��Y\�b/\YJg]An]��
�� ���fU
�o39�W]��'�$�Y���^ǂ��:�]�Z� 7z�f}����[#J�������oy�Qe}M����ժ�v�l�
|�y�*u8� ��Rhh0}=� �B�>
-endstream
-endobj
-3460 0 obj <<
-/Type /FontDescriptor
-/FontName /VYEUCT+CMSY6
-/Flags 4
-/FontBBox [-4 -948 1329 786]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 52
-/XHeight 431
-/CharSet (/asteriskmath/dagger/daggerdbl/paragraph/prime/section)
-/FontFile 3459 0 R
->> endobj
-3461 0 obj <<
-/Length1 1394
-/Length2 5926
-/Length3 0
-/Length 6875      
-/Filter /FlateDecode
->>
-stream
-xڍtT�k�.�(���0
-�!
҂�0�30
��HH�H��Rҍ�� ��%��?�����w�Z�Y�������^vV-]^K�TG����r�F� ~~A>~~"vv=�
����]�t�!���+@	��6y0
-
���T]� A HD
$*�����w )���,�| U
�L�.�p�@¬mP�6�8!\ �Ç�~�d
�H
��Q6PtG�
�����(����A�
Ł@777>��3i-�� �C� t��P�+��
0@� �����
�gs�c�EX���H( m��A�pgt�
����tU� ��P��`�? � ����_ٿ
-�࿓���
����V0{(@SQ��z  �-���|�+f�@��9�(�
 �����9����a�� �AOYn)�pp��Q�D��'CB!�{ �l��p�{�u���-�~��tq>�Ü\�*���MD�ج�(�0�C!1 �	 u�� ���p��v�~��|�
� +4��
-��#�r�B(�
���;�}"� �0
-`�������6C�����G��&�h� ��~�y{���%n��O���5tU4�x� ��OV���	x
-�  �CTL ���2����[����.��OE���������-8��
��
4h.C��Pߔ_��~����;����_U�_���
)����vs���n���� 4�]PhY�#���w��ա�0������hy�����	��
��Üa�PK-
-b�H���
�j!�a��8�,~���U�CU��
�킢E��
-p����E `$�Aď&���0�
���%��7�@>8�N�1� �H�_kEs 舄���D�*
qA"���� t߿ϿU��C!D��ȣ`ۊ��27����Ŧ�8��pa��+/5�t�'�疥w�R���


�f��;t7m�
�KV�Aa(t.�
��~�8n��2["譇DS"���㵙n?7�1��h0�3D�Mp��Z�U����m���;k2*F&�i+ʈ�m�kdJK�4Iu�Sy:t��=�m����X6�M띝����L<z����Hi(%
��*kv_B7
u|�j�3���w��Iqw�
-
B9�
*�@��l�
t��"F�>X8fR��PU}�p� G��OO�W���zI�`,p�(����Q�ߴ�t�T�:?��:�
6bˊ��>�ӷ��)�3g�t�|KC�2ra�5-α^6��E�������Z����,4:����
�

-�;rw�
�&ҕ��1�e��/��
2p?��PX7YT7�TV?
-�ky��\��r̞7��V�B�업��g��Z��
�}E�T���?czm�9�r��@�Z-��}$� �$.ʷ�+kѤ�U�5���_��X�����!-�E�,0߭��!\iX��^�f6�d4M�[}��g����0�������<ϭ�ׄ���?4�_P�&���S�����
��f�0~���aU�'=���U�z�q#]��AA_[9?zds�	�r�A����] 8j�G��d����b�"T��
Nos)�<?u'1�J�`�=� d��+��Ūx]�*�F�Vs��)ŏ�{�%+:r�]U� U֋�->x�g�*9^�Տ�N��t0�v/-�U5]��y0_�6���~���E����
����
�P8ou��ឦ��-�lBVX���ˠ_��	��r��k
	'�X�{N�
-��63]^/`�n�	5{���{ΜPT�� ʝ��p{g,��+�{&��J���V��i�^f͙��2�
8��}�$�3"�f��}4fʻ�����!�&�f��!|Gw�.�!8��Z��{i7������l����E�1B)�
��$7}���rƤ�?����O�E
m���Yyz
IG>�e ����d
7��VE #��z�ɚ_��D�

��
����>�f%�Rɒ����� }E�#L��#	�1��OIN*\x�,Z��'��6���_z��5����
-?��
�K�K�T����x��O�8�� �|Li'���%�:�O �ei�B�9�ݛO?9���}�%J����.��N69g</U���8���0�#�͈%��Q���r[
~��������.��%�^vX��	�^^]�A�.}��
|aQ�ۥt��Wf��0i��M�����ѕ�y����4,�t�cK���?��"������q�Ԏ�[�w�1��O-(�
8R
 �A�i}�
-��H����9��e�+ҩ�y<n�9Q_�|眜z)@����1�|��z3i���
�y7��:.��f%����4A�fGs���C����I[m
\{��Md�n4B���U;�%����+q��*CBS��T�W�
�>-5n�5�P�ڨ���0:�[-E��RH�h
�c����
��S����=e����W���(_$
�f�d�O�t�
�ދd�g����n��<�(�1a��l8�+{l��k|���W
bǖ�CQ�ǕĿ/�r���®��,�{k����"�
-�����'��
��s>Fg�>���p��$Z�ot�U��e‰qꕩ��¼<

�T�ߙ��Y�0�}}c�蛷#�S70Fc��fi(K�sp
� ������~��`d�lq�I���DP��{�L�׳B��i�wK(�uՏ
-��,�N[y�'n������Gf��ߑ�����҄�H�tm�p�n���RD�?Tq�~z���l'�~)t�i�0�kq��)<D =ܴ���YR��0��v1Nq��oʒe#��D�u���>=��ϛH'��
I%
��`�Vإ�sӓ�]��\Z����=�4����'��>�_�0%�x}��6k�<�
���]`7�R
͎!��L�����}
{�H�1-%��އ���hQ��e7�A���9�����{�r
-����9���S
�R�'j疴}.��!8���/���%	t�_�
��07T��,�#h��|��H��
ȐQ<�*\bg�����
�$h%�3n�i�S]'�w��[�
8u&�}��Jn��.{�x��17+̕����J%e����L��Mv��Uőri9���m�&�4{�ŭ�2|^�ӕi��P����d�by�ȸ�����Y�
�2��ºmH���[���;>�E��T@�v�FIq�cP����'�w�d��
-
,��,�3�r����_n
�齅�W
s;�իq$��	���ذ@]��J����'f��c�V��<�\���~/�S�/X
�U�����$�V�a��e�lwk�Z�|~�~g�]�
�
���:O�W���$R���vzP�S޽����x~��︐ˉ�Z$U�-�������a�9~��@ڼ�B��Z�,�4�
�Vg����4�F`�`(w���é��"�C�қ�4�&a2\	����	�b
�9_����צAw�:w�dr�_�=#�)1�	�����r
�lP�oWG�1���_�G
�}��E���
�.�����ߠW5J���cK�������^�Q}b�c�|
u	�����~���FD�� ��"�+�
"��x�Mj���"�r$��u�$
R$��ܶ5�j��q[(
����I;LF{o��A �{:9���]�3�������Q$s�܄/;�qt�#�ر�4�?/��쌚�4Z%a��!M�
u�A3�<������;�[�J7h���
PǠ�p�Q��L�p
�q�B�肳
^!5��Bx<|*��<���*�󈰖�f��M�Iiv"��0i�ݘ\�,s��
c�&1Ɇ�5�ƀ����@eC
�5s�D�O��w!���LMOƖ*��6�]K-Qi�����DR�"}��ͩž_z����|sg�_��o�g��]
;�[����֎�k��t^F�T��TGZo�y�G;���C)QM���S
	h

�lX�I0���Q�t~�^��f>f�?y�Jⰹh�i����(eL�G����
�~�4J�;F"�&�~}�}�
և/���6m��y	% רz'^y��qޣ�ʩj���w�_q��^�_�U�
Wh:���ߐ��n�w}{��G޳-c�9�oS� �W~���q��D	�i9�[�`}�a�.����b"t�JYr�S~Yz�
��(������^{g;�^��av<ʚd��e�W�7�G���J4�
�R�J8qg�
�
��0q�5��
_F�� tF����� }���fI*�6�w��ի��b�
��a�a
.��.��V�(}��p�1��][�h%�)��;t�Cqzg
t��@8�pdShh�mo�H��^�T�fF͔��k�}|� �R [...]
-f�Q�D8�}��G&�h�y+>p�_X:Q
��lE��
��O���4` '=hi;�I���%���$����fS
����n����]~[NL�h���ܟgÎ�	5T�[7�xw���1����2Զ�ð��=$G3�ҭ��Oj�m��y�� ���)o-��)L�3�I�
99�<sB�iE�<�1l����#c:�P߇c�ƚ�#&�AoD#c��~��.d� �4���U�Mc��O�5r�T�#��⍻��i҃j��ƛ��kȫt��>k��e�'	��d���o��v�j"�6Vy#y��_���!]�/
�u�E��)�V���>��F�_��7N2�yb��	�
3��n]��A�
-�t
���!v�Qw�t~�
-7��h���{�
rߵ���9T�
5I�w)�}Iz t�	��B��'/r�cW	�$���.�6`!�-Hʗ
-O�z��/�N_�Y�s聫3	3
�PRa$�����#h��_��O�^�r��C�VnlaW���l�O�͔��Z��O�~��a��ge�jX//&�� ��L��t;��"�m�_�BZ@��=����.����]�\���Yi?�#���Q������p2�l�
�(�~��=�ƿ���,
Ucm���I�,j7��
��M%/9~Q�B�y֦��λs0�����D�l���aا��/�I�O
-?�@�Tg��xh���Dc��s�G�
�*Ee�Z��2
�2���>�i)K�����	ǟ�O�o��&5ws׻
�y�p����ST1ʵH�O}�ͦf�ܭ��d���-�����
o$
���+�(ʨ3���b�}��ִiF�4�GV��I.F��cR�#����Df�
�?�T3'׮2���F�����ǜ�g�
-�z~�%��ׇ�����"��]6/-���ɻ�N�#�,�˦��Ȼ�4����h;ƺ�r����bLEE���<N��B����s�1�IɄ��D�U(�
3ߘ�U~�
.%�jSM2�5U��T��q�ʝ�����?K8�Ҟ;�3�
�ou�/��j�j�\�b�+*5-g5&5�\%Er�=��ёf�m��W�{J��d�oX�
Y�F^�0yF6���C�#�$�u
-����=�4������Q'��\�z�Sg��+/���
� �,
m��<��l/Op�\����]��� f�v߯Au��'C{�_��
�	:�`8���d�4v�sy��^����.Y���!{STt��{��-Du
k��.s�h��M2댁���M��*�kF�
fY���և
�	4�.�a��ow�����2��+
I��
UU��aIRI�6 ��'G���m*+�lך�V��7�˝��S�О��
��@�L�w��`mv�~�>%~����q瀳�N�Q
-<f���ʼs>,���h
�'��Z�w%�Ϝ�l�f����D�����̲l�}۰ך��]��CЙ(`yЮw��<
�2�Kq�
�Q������3���^�A
7��Cr�+hFQl��"�j�]R���+�Ťh ��h�r`ps������T�OTXFb�
-��&�U��f+�H�������%��I'r�=&��Yl��
��}^啅ѣ�*����h�m�Β�*Zw��	Ξ���*Y}f_�����T,�F(
���ZbPk�W�h��'A�a�`_����?��x)Hn|TUU5���lݰ
�N.浕X��}�*��.)�n��b֡�Z�?�3
� �R��R�
xK���@0����wj^��M^2
Ę����x3ₔ����sFƜ��L�v�q�3=��̽\˱�r�3�|�x{C���A����!��f�
[,��P��H�^8��Qc$eŗ|�M�p�V�{)�����[B�w�<dqZ�m���
+���
k�^��Y�=Q�2��d
G�x��z��ƴ��n
���p{R��Q�� �a�[7�����N�^����QK�)kUi.�E����ލ��8��J��|�
��Jb&��c���-�k���<�
4Y��c�;�u@'�%Dx#�=�X�K�QG^eFG>��7R�{"���$�]OR�mN�I��u�$2g��w��El��A|�����
���3��n��ʯ��
T��O
�'���#8�^�G��.w�Ͻ7�-ɴ�k��z<��Q������{�vB/ֱ&�?�:=1_�j���](����
-\��{�ϻ݁]��j*m2�Kt1�JO�����<)�R���'O$�LR �7���y����n���J�B-F��.�,?Ta��Lz��R	�V���V;r��_S7�4�\�2��G�{�/
~�7fzHcR%S����H3����I
ev
-���a��f2�mw�f� 
+�U���e 3%�;@<B���Lcc;���4RDE��J�z]�{��hЖ^��X��lQջA�tR��J�B0o?�?;�
X�
-endstream
-endobj
-3462 0 obj <<
-/Type /FontDescriptor
-/FontName /NSJEOL+CMSY7
-/Flags 4
-/FontBBox [-15 -951 1251 782]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 49
-/XHeight 431
-/CharSet (/prime)
-/FontFile 3461 0 R
->> endobj
-3463 0 obj <<
-/Length1 1463
-/Length2 6796
-/Length3 0
-/Length 7790      
-/Filter /FlateDecode
->>
-stream
-xڍuX�m�>
N�	at��n�AR�6ƈ
�� �HIH�"
"%-
"��� !�H�ߌ�}��������
�v_篮���
������F!�"� 1�����
PLL$&&��@`�a` �
�A��
-�������8L�����@}ow��$P\FA\VAL
(!&&�w"
-� �� �@#P��a <(O4�ō��� ����
-�*�y��	4c]`
���;�
A����h����z*�������

-
W�"�. at 3���A�?	o�=`��� <@
�7n�r����0 pG@`H
��	�����@s=C��'
�;��w�0��� �A��j���g#�W1Ayx���$
�p���
AX?�0���L�cP�z��v�%��9��f
-�������X
�p�IQ�g�)k!�(��ܟ&
���_��ͺ!Q���?
g�����S�����i�I�A�cp(-&/##%�ya~џ�-�=a���?a
��@O�'�G�p��~ ��
�E{�3��@\
E@�@'
���;�9�^�.��ډ�'���דN^P������WTS��L�J�7����Q~�@I1����4P\\N(++
�g�
����&`ğ͉���
����wx���#
�?� �s�-N�0 ���o/&-�}���
������]�7�������������0����''eo,�F(�9���j
�me#����Q=,g5$
'qq)���o
��F���&,�巐��
-�
wf�� ~�qpUbb�ù�{�`p�+Ù�s����$�e�`4�ÉL��@q�M�0�_����(,���
tF�?�U\B
(
-��8ڸ�L�o
����$P����`O���ŀ��+r�	�co4��_2�m����W
�� �M� ���u���5j,�"�GH?�ǥ���Jcyg�����Lz�߅V^�2�}=1
�"�}<�gߙ�!S�1O�wY}G�`�d�c����c�Yq���RMoP޵#��{`=}
%�%�V�Z|юY���z K�82Y�����7	l8�?bm쩒h�v�-�,�.IGꭉL'��vIك

���z�$w

��e*�i���9�����S��0x��҇�2R8��zD�~ �v���o~��3������ݤ�A��b�>;�/
v��[0��F#޺[ I;]�����H�Y�.�4 eT�Ժ�$�lŚ�үAIFQ���~�ٯ��լM
�U�
-)Wx>P9�����}��W{@BYC�p��6�"�������-x&��]�k�0�5�[Э}���ԙV1�J�^
����n�)�?秸����9v��$"�`i$�y�}�8C��3wM�!f��Ҋδ��6�'�G�J��}\s�&5}���
m]�T����ӶA�0C�2���}+ap7���R�H��/�ݳW#��7�y����)Q4�

}x�H9r�|�j���^Bx��e(qw��K���=�_�$�6�>A]j�aq��0�Sd�n���4;�������x�p��^%�mQ�J�����t��i
�.�a�?�`���\�
�
"E������R'�;Y�O&�ڤyf罃|Z�ܵw�'��ʣ��&�&�L�M�����*����.܃�Q9=Qe��
W����g_h��.���M�M�㽔��;v�Lm
�����>��6�-Kv��p$��0�x�@,�KZq���b�K���e2;t����G�t\@i���(s����tF�Cٱh�Y�7u�6zөX���wDaJg^Y;�����h?z�ԅ������뿄)�Z���P
�d�IM
-�������%�

�N��fQ�2�y������?05	�d��C���_SL�dr�~�t��G���b�X�
I�����IӢ��Cg��'R
�?���Y	*d����x���ތ;�
I!u0�.���L%A{vL�&
{k-V:�}�4���k�|�¾#��]�B1DvJ׮_�qp�n`�
L�O��? �W at S��Gٚ��H�ri�oa<�8D7�
<�R�eX�o^�����ɠ����s��m�Zt�s(��38����;+���J��m�>r̞�'�+-k(N����nh��`2Ag
-��ĖH���m2�c�C�
4[�6
�m�n>�o���JCy
-Ҩ��
8M�(=h��#�%P�an�t8�!���4dʹ�_ɿ��1q��6�8`�\��HQj%��q���7ϳr/uM 
%�l��
=���#�!Է�Nz�5����f�4�n�����b���pL�l[o�x����#�g�����xHw\q�C��6�;�1�v쟿X�ZPW�܈u���U����pyY0��gr�g���cv3|�+��6�s?�*���Q��
WD�
M�I��J�0������3O�
8m{�C��Lo�����si��^�/�j>y6#�[����.�Y\��8��G`-1����Bm�)�=Y�����L�
�#���"#M	�	ֳ�bf�T�K���Q��DjN�e�"���^N^K������{c�m8ض<DMgo9���u�$l���Rt��a{u��K�
�人>�͘�uD��~H��Si��k2�?fR75g���J�f'jm�?���
�����dP�}gv
�j�+��\�r�	�lNA�8��̈
�K߮2x��|��9�s=
K�G���+��
n���ɮ�˫6;ľ����%]�z,���ۮpEw�G
��8A�� �
��-��o'����~�����
d�}�
-�&�-�y}�&�A�P�}��"��Ҹ��Qu
�2��%qmnZ/���J���n�
-W
-�1WX�ۥ�@Å�
:g%[���
�t"X�n4ߡ)�uWy�._��Ǐ���
z�|ӢXW����A�hؖ9�̺��_�/K}�{\��*K��������W/�9Y�Z8��MXI�|�D�u�g�_
-�w�
gɌ
�_&R�1a�p/f���d��c�apQ��7���
s�	�����O�<nw�]�g���}۟�ĉ
V�i�5������%K���+���a�
��	Fi0�E���o�J��xH��{�7B�{�����^��A��E=X+���i�j-F��"�
�?k�L;{��
���n�i���-a蒲��0���
�b*{��(Ke�'sh
|�V��:Ft�δip{�
U��5_T2	�}H�mMBn��4ܬ�#C�p_���"^y��ce at hőKfQٵ�
�e�J���,!����8�+o^L��â���2��Ӫl�N?ʿ��J�d��$�ɯ��h~�za��\^u9	�JΧ��Њrsg�:�P>��F�6�f�P������㪇��4
�����q���i��y�|����;�p'�u�A��Xc/~h
L,Hyska�TO�(,CL���16���ׄ���tk� ��C�걻?�*+�� �
gYT��2&ԛ�G荸�
-䘳�Yw�:^�
ý�5���cU���*ZOA2+�.�I
$*
Q\v|�t˝N������U�=gõ���٨���O����S|�imGwDf�
^y^bqZ��2��?��ĊJx����)��
Oo�hN9�5:�,Z�u���/qY0��~w(X���qrh�E)yFe�
<�@x�4��8]'�� [x29BP�΀�Ǘ黻�
'FY1�kMEr����̢����:.3��)����I4�D���*�C/F#u;�r���$Z�����*��a4@�٪5����Fn��o����c]�W�xx��H۹�Ų�G�X��e�'Ɖ�	%6
-3�BK���b���@�1}00+�s�n\� 7�х@x�\V��KÁd��سRq��i'u�\��.�
(��u/����B�{�`}�!�a`
5e��g���e
,bo~p|�<���EJ�}y�M��V��1bI��_ZHn-O���1VƧ|G
�i�yz<S�yw��҇
,f~Q&n�ۚ
-������F���M%S�R�
p�>�
-ֱ�ς/#_�>6��,jYl)}�9SV���G�s�WM�������(��f�����	����z�S�˪6���ό7�&M
�,�����3X�{��
-�Ca��d��4�'
��N�x����>����m�i:��_���y��
,��
�g&T������LHg5�N�5��X�����@��؍F����'�*��3�dfk+J������8}���.,�� �?�h=.[H�I�
7�4W벜O��ߧ�Ԝ����ai�n��e�
���ٕE�I�qf� �� DSDS�Y����)pk�,]��ޯ�%�I��W���_�v��RpF�[
-�*NP&��\��DG[�۝�dK�Ѳ�a�B�^�ب߸�8���k�O��B����P1��
�
-�����(�c�[FHV�"�(���c
������̈́Q`�j�Mѽ�Ϛמ�

�%��p�қ�]p'�U�%\��rs���g��H-�}i�G��GQݥ���x;�MmEȾ��7݂�������)�\�-��(:7K.�1m:}[��q*7�1�|��.�o}�_�����4kZ
d�gB�?�l
����w������Aq�Jƕ�������d����WA��{��'\D��uxGNE3��0C�B�
Z>3��}�=M-��]n��=$���ˬi�g{j

-
-s
-��\��
-P���
Sn�</HK�

������{������/J�(��;f��Cw-s���31�.�1��`�x,s�FG����ȋC{���c���̵d�l�H|twM���|5�{�Di���a���G�v��7"*��|
s��z�:�5�O��Q��`6Q�y���<�VZG��)��(�L�J��
�`b���{^�ԞV/.,Y� 4�W��_�k��_�m1GU�GK����
�g�
�&$���5
-���pZ<K�׏1bݸ��S��I{�A�F�e�&�W�@���6E~TN�g�� �
�֜��u�k—�S�^�������~��dVE��C��j���9g��kϘ�W�';NQ���V�����T�^4<��]5""�\�	������ ��c�k�#�
�2�1=l�%�� ��s8JN�j�/ņ�nH���Ӏ2'�t�
W�.�%|#�������[���#�o	�m�6���=񫆣�0��o^5]��(��O
&:�2��a��"{�Z�敏�1��'�
�����V������,E�
&�����X��/�r���p�g�Vn�z����C&H��;
���#��FR��{�=t���
�$q�Ӆ"Y�lS��F]��^w
s�G_��.�I�1�v�/
��B��x��hg����9�d����$�������f*٧��A�
e 	�Up|����dpebh+�n�OR�^@pR51͛��GV#���kx'����� !��<����@J�B.4k#���L%�����݇�rn%i�_
�=���
~=*E�j 1��q�z<��M��^�u'�X�d�pq�
-�q�QVv,�
-��EvK�4|�?�2�� ���_QKv��P��C�N?,x}�X�C\��9� L�n�&?���ڮ��)��+����
�4�� �
����j�I�7����
��y_[c#�> "fr�����K
-�Wc��D
N���fL1[M!����c�y_�&F�wW��+��5��T�l+^/l���}�
i�`ً��F��^iO�/V8�@�����g��
�ݙo���n��
+s?�ۣ���W��-?|{��/����D��f�p����i��&�
���_��k���l'.l���Ƴ�|
�a|0�;���oo���Y��a���w��4�'z���2de����
��n��nr��������RxLDŽE�����g��K�L?>����P�
s����y;�a�l�0��]!������\�
6��ʹ�c�r��5�wb�l�"��0J�s���?x�Ŋ�o�
��V�������[�zT�*��}��b�.ɢk���������v�:Yu���Eϰ�[�BW�?�PJE0}I��687
/�q��pG��,~�7�<�d����Z�^c)	^�UՈ�m���چ�Wg}��&�K��V�]
TvKZ���)�B�r�lN�ܟ�Zr]���)D_�{`���>��%�
N鯑��
�/��׬{H1&��i��N
��Eo����i��p��	��*E��ϘI�"��*�
��J/�4���y�Vp���akup{��x#�S�v
� ���,�`��'�x��2�ևo^F����
��h�Y�L����*��0X�I4�_��B�	֣�k�����r��U�+�!YI��T��������m1��/��\
�+���I%���aX���k���k�^�3
-)Ӈ���
�
�3H�&����A�q�����l��}H��&��;���6~����Ʊ�y��a'����
�g��j̔��wRȔ�vDr�����5d�:4~~��S-�����#�X����V<z���jk�o�h�:��L�$#^��/�
j�8.\�%�U����<���&�H7��/�&hW�ҵ����]����5b�u��
-r���
'�9�(�(n��_��R��x}U��ጽ'��Pe���ni�dؼJ���D�N-͸�Dj��u�hE;����&U�
�@|sf��X�	;� _I
����Б��
�������B�
_Ǯ�Z�}�E��b��x5+}�����x�d��%�YC�iP�
E ^�N����`���h�>�=z�^�mKV�y�[0s�%�J�Q��8�� `my���r��
�� 
G��B
Y��6C�_��vʩcDONX-x��.u�
o�_��
��4�	�m�7�J����S�!
��D!C��1_o�j�
-�B�1�`Pu
���fw3�`�lV��v����I-�Ur�⑲����_68��Ig��>a��IN+ܶ���y�����늘|��d�$`�}@0z��Pm���|:bz{�wә|�&|$LQ;�R�zmu��^D��e�
��PυwuCц�h�[+�m%ƫ}��Bߓ��U�7
�w� ��3�@�E��A��ث��|7��4��V-<7Nk>S'��J0���QGa�r9�>z,V�uޓz�T��,[��_�I6`9�H
r��&B��<NPXHP
tW9��
��N��㱢
E�s���r�\.|x=�f
���
�=t�e��F�w��C�3�Βx4Hv
��[P)�����)���/d����孤��2mT��f��Δ+��T��`����k��j��F�E���'�	5���|�7���cjac��!x,�;�8e��Z�?
�Φ_�*�h�����K��d\�cxN}P�Δ&��ԛ��9a#�no��V����W�I�3��o\k/����k�
��nmgOm��%2_X���Ũ@tE�>EJ�%2�xI�#��!4�n�|��J���c"�$�5�ы	ڬ�p�{�
K�~�\�c���{�
��W�jRS���9H�����ܷ�9�s}�x�g�%Z�#��B�#�u��.�
Z����)Ց��)�
-�ݘ� �k%�b��
���%���_I?��0h!OV���[���U�݂��6��w)��)��NM؉�i9~?Ts�$�kg�>�?{��a�槮9��|]�TU��x��rE-̐:H@���i7�û)�V�ճ)��W��Y�8��R�
-�z��6�j�[}�8䫓6|��ܨO���7�8A�@���E
��
��t�i[�o�0�2�okE��)���5u�ɽ#���Imަyz��!�v�5*:
-@
���/C3 at L�#&M[��Q��HZ/���"B��hkw�<���7�a$}p��� SZ�
-endstream
-endobj
-3464 0 obj <<
-/Type /FontDescriptor
-/FontName /DFVRAV+CMSY8
-/Flags 4
-/FontBBox [-30 -955 1185 779]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 46
-/XHeight 431
-/CharSet (/dagger/daggerdbl/paragraph/section)
-/FontFile 3463 0 R
->> endobj
-3465 0 obj <<
-/Length1 1463
-/Length2 6668
-/Length3 0
-/Length 7659      
-/Filter /FlateDecode
->>
-stream
-xڍtT��6-�HI�h���;$dlc��D��$��KB�$D at ZD��������������}g�l{�;����T@�p�h �AaY�����
@XXLPXX����
��A��$�����/U��bj@
�O�x� "b IY)Yaa�����ߎ�,@
��:8M­�@����.l����@�"22R��������;�"�"@P��_)��]0������� �
-�@9+��xC1. ��?	
����I�f.P�o����  , �� p46��� �� Sm=�!���ہ��n "�"����3�+!ܑ@�/�
p��  C
=A�� ��:ah6
��€�X�_���  ��zh
-�Ġ�P�O�B?�`oY
VE��C�4���Ԡ({�B�'�Gx���
��p��O`O��9
��	�V�ゅH��9C0 	aII	a � ���Lo拄�2����
��$�	Ku�`H��@/ ����oÿO$"" 0�8B��p��d����g��QP��0V{" ៟��a�F�a��q�5_!MUu#��~3�Ǧ����
�� d$�""� )))@���s������OFm� �������G|V�6��
X-C |������0�%��� �B�o�����%��nH��e��e�?�@w(���Vʞ�Z�#���oWK��Uև�����m�� ��
w�J\@D\PX�7Ek@} `#(��[H�[�C�h��%,�_6�ցܰ�
-�gV�R���:
� ��>Q	I ���cE&*!���)��K� !A8�
`9�(��c�X�P�v
-.?��pl=!
�s���D�
�
��;��QI��v��=ѿ���D��9~�����_O��LD��
��=j=�Qf�X"�[h�����L����]K�
�Pq W�>3�*
��t��ɰ����!�)Z�
��%�]���Ӄ��V0��yD�Y��N�1
��
�
o��Nj0�.���Ղ�v��=�M�;��;{
-�rV�&^�5;�f�ږ"�
-e��i�m>r�
�=Vi�a8�]��M�����7�����t��%+én��g
&�1�$<�iB��H|W-M��`(t��w��=��{�*�O̳��@5��0�]�g=,*CR0��C��ք�5Qϫ��,�+�g���|3^C���_u~�6XuA��h����7ȕ����6��੮ �ȣy'���ً�sB��Jo�V磅�b�ݺĶ����=�Z,MQRzE/�SX��\����
t��
A����ܔ���5���_�!�L���ȀP�F��6n��|n`x��wž�:����fn�IodYɼl�{�+6�w������S�����Q�[�5ӗU2��PS(nM�~��\)�mEtr<]�d�ᷙn���@S��es�
�}�^�9�
zn�L~�
-��I!�Cօ���t�Y�:�������Y���ʑx��d�?��{ �
�c�~�퀑�Ư
-s~yq����۱όC��
����x5�F��;>�H�̮7e�M�)q(��I�Pd�
�q
��[��e>�	�
�c�J��
]g��,I��㼕�?�K�w	T
(��l�z�pS�U͍��+Ou�k��[��
-n��F��5��m���;G�<a�{5G�q��>WVY���"�/��W�I�!#����86�Z�����J���B�TD0f��
�pv�i�.̊92��)@�֖
)���W����H:v_I��
�>߽V��`x�;�f�uG���{B3�-�Iꚏ�<��;u:�i�� �[�/��7�xI�)<v=�f�Jz�#���q�Ʈ�w��-�LcWr�36
�T_���u
-��j���+Zv`^#���uhC����J��L/��E�3JAA�+�����\0��['f��DR݄3*l�s8gw�eB�����D
46WcQ|�̦�r�������끷�L�
���W�K�o�/H����k�Z,7�݁1d�&�
v����I�Uc-
߸g|����+猱ٙ��5C~uHt�y�ā�I���
-��?�S���X
-�t������m-�������|�����l��&	��a�Ͷt�|*���.MF�z[��Ť�����U�w}��2e������S�c$��H�����{
}p:���jo�t�M8��{�8*}�EwT�
<i�w�������7�{l�Ŏ�t,;ٍ��Z���
x}b܂���:�F��2��Z��]x��v��%{s�1���qSm���@��2Z:��"�N��6�=ka~�ʏ.�������qb9_MH���F��|�I�[�/�	H��{��=\�YRj���Y/��Ko�
��zC���7�hy�h
���x�M�ȴ_�e={"��;f[�?7�Յx&f�ڹ�j&������Z��I�ja˷���A��9�w�!�g$
�z�5֌���j�칅6���7�H�J��V)l������6�b��*ԜTE���ˢv#��'��:%�iaZ���2ε}
H钩?��`j푒��fG��O\�����Ά^���j�@�>e��Ñ�b���g��W��:����O*��$*J���Wyod��S}�Q]-uؒ����W��Y
�I�0_g��]�ij��i��i� M*�>�����Ԣ��c�z~��CW䞌U����;݊@<'�=*;�I����Od�(�N�^'���8wڻ����H86͂`���量?�93�����dPr��v4�|Z˒�
֚d� -�БK�Q�`Aߡiѿ��"z���#`/A+HRQn9*�q��J��vD,����W

iL
�B���{?F�
�P張���������x
�|3�t������	�5��χ"�4��O�d��v%ל�]��~����BU�]F��R�k}�����h}��r���7�T�W
-A�����z����]ڬ�e����4N
J1�mR�o#�Mg�����`��)������r�p7��t]����Б{�ӷ�&���/0�Q���-���w�ɴ
ܤ�H��)�ߺ�.+���>;�ߧ
Lo�:( ;	.��
ǐڌ��
-��xG{�z?������.�U8�>*餶�yf>���D#��#do���~��|��X��Z���}ϧ5k	KQ,�\�-��A{lAW����>�
-
����w��#���٩�%�~����dJ<[j&[^��_e�%A�~���̲�£����Lz��(�
���_N�����kl��WL��ҋΜ��%q
b!� ^U[*x8|�V[�D�����
-ܱm����G�K0����~�}�(���I�;���V��u:��-��C
 T;o|-�NH׆�<��`��Yvc_7�Xֿp?����*Q��q�cy��n��:�
�ԩ?�SfX�c��U!P"#v�怂WT��s�4��945p>A��Ŏ6��

-3:�X|���|�����x�ε�l�82n�6'91�����V��G9��7���,
�j�q���#�|�<��C��bp?7���?�XdάU�苻S@:uj�i�v7I{��m[b
r>9:�R������z�����")
-���^Xg'�)�7��a�fvQ�w~F��@�6�c����O�6�&�bGi�1!�`���f���F��n+^�/
��b��7ʃ��-��
X1
.�45�V��pI��C��.��A4�f&�6�G��4+�	ٖ
�]�i������\��u'���
-��
�Ր��;�q^�en�=:0�=�T�� "�zj���Ӌ�*2�J�T9�f��{G���>7ƞ1!
�h�uҤ��,���>}��%�$�<롟�%��kՠ([��`������f�]kQ6�
w�����O;�(�7X�(Y.1�L��Qhƪ���%���1k��+x��oP�;�y��Я�vӘ/�˕�{���ϾI̓��GAAќ�b^��Nq.
G�&�
]T��
�v��R��� f
�bА¢�G�7@ˎu��A=
Eig�����!�qt5�ׂ�'t�d�
-e�:zv뢻ٍr^��06��/�(��@��C�ꣷ'�M�@�?�-����k���4Q9E
�\���x#wY#|`m�"�_�,�Bl�3nZ��L?��ND����P�hΰ��;η�J�o�
D��
?d��fc�@�Qu��V��_'��N�&�RйmL�Z?
d�](

����7�{�KH�օ��z䈒Oߟ
ih�L=��fy�N��4����Q�!
b�Չg����
�F�@���J�����,$��`,��SR���E�8!y`7lN�[	VW����N�d|��#^5���&��Ԛ|��JC�R�O�T<:�����J9f��;:�c�ƿrS��!����Ep��^v����8�/aTu
dzm��؃�C�ήy��7t��
�Gp>��l��(|I��^/�y�OG�I��ߧ��2HHppQ%�r��e�*��I)�WA��b�N�ʞ�آ�%�I�y�Y������62�#�6
_�G��,�&_PQ�r.��|�il�(��e4��l��ϙ&�E�|F枿~�'������Uu�=����pt�R��嬎���huu�/�b<�^&7���

�x?Wp�-v�̹�rO����̓�����
�������E���S%f�cS��X��R\�z3$L��)�`ҟ8y����zA�'��%.O�і����l�e~�
�.Y�����ե��is���hT����U��ͧ�a�b�;�K [...]
-�\��[Y�,9_:ٙ3��L��l,�� ��v�O3�f�_��O��</������G��؁[�_/�2ⲟ��|���|-�)����
J��
����b,�It��֙˔����凗n~�be��1�
-���+'m	��>K&���_�Vy��@�-�}OӲ��eN�l����!i�G��
���W�T�,\_|Gs5
$�dԖ�$=(��P����n�x��r�X���������
m��{/��H�&=�$];�q
��n����{g�FC7k�AyL�m��Ma��~���@����SzW5If�/�b�;�/�5Ġ����b�U��ٞ���=�c��K�7�>�L��v¦
-�1�
�����Ŗ�Uc���J�����i���4%�u�fyݏ�Y�_2��q4�m�-�)cUrƦDu���xw���ro.�6�����7G�LWi+D�^j!��\!*uބI(}���VH8+|/O%q�
-��
>3�`��튑��7\�͌�8��=y��jq}:_���@��q�<rn���UښGw�Ck�
�6�$R���J��(K��<>0�(xI�m��u����������l_�tI
OfS��؇x�W�=��-�
�w^��w����
ߕ����u
doY�9�c�B�ey͔(m�P�z�m�k����j�n��/~��ҫ��1�z�;�B��kv�l[YȬz=��T��A�*���\�ᙃ���b�s�.58]>)˔�Cƕ3p�R,���N���{����
�2�����
�kk51׏
��%���D�!�x���k��>�Q�����:k$�^�
-�c3�������:
�(#�$��./hࠈ���i\A�����N;���6ל�������>`�O���6�/�o��
e3��q����f~*�z��0⡜V{�'�4�h�E�M�q�E��{e��^$l+"5*��&q��ǧ�t	���p�}��
��|���ܷ�0���^�Ac����b���
QRd���,�8��ڑ茞��%N?� _R���L������Y� N��!�yj�ȣ{�WC�
-N���&�>h�Xj�
����k-��2��!N#e-�}��f
A�}�Z�H1�P�"����[�$T	�|'�v+�mQ
�e��:�Q�_1� ��<�ɝ�	��&�z��=�7�cR��]+"+V��tN��Q�<�z���tgȗq���#��j�b[���j�f᎕\�_��E����֘�
��=�4��8��P�]Ɏe�O<��?Q3�/��c��3��NdI5�1�T�-
7+öF����z#����qD�WTL��mWaC��e�#ܣ��-d�y�Y�dP)��^px��
e�nT����}W45��Y2N����ӉaG}zz���p�i��
�#��
��wMHH.�0'׎�a=kϐ�AW�UL*�����֙�΅������(R��,�e���ۻ�����Pvb�퀽�
��_��A�k<��[�
-��?��=l��Dgλ�[��9$�*O��3F>f%��SPe�����:4ŧ��3�S/��/��ў'���>��s���P�P"sp;��knFܝ@�x��fX
��'.nS�1���h�C3*�C�S���7[� ���z�.�\1(�Q"E-bHg���g

)$�/%�|;&���l�'mL�YŃ"(�^�%��e"��N��\�ŵ�M�[3����*�M�I��
v?S=HDqR�����,��wV��=k�
�s�M&Lө �+:HU���	ne
�r� /�M�Ry\|�w�x��6FS���k�;Oe鏧<����0.��s3�϶�
�ʔ
W�J���]?��6k�
-Ώ>�-Y��C�
-��^j�؃_�r��zk����7�+
�w���;�4k��h�[w������oy�&ë&?���vgK�\�[l�y-2�K�uG��C�����ݲ��r<e�x&<f�{"�Z�]�]�y%Bm
�쾨�h�u�+3��DUQ�OMf7�
Sz�ڢ.�>m��`p6��č<&'@�@hZ��iw���qll���8��[P"f��`���i����GH��n�('�=oG=����g�y�1��'{D��k/��
�@o-���yv�>7�m��t��=sH�٘�n0�
Gx�X���,I�{�O��_q���At3
�Q辬?sd�)��'�

����Y;H
���H����|��J��im&��~3�T�Yr՝����Vm��5f����*�X��Z���
-eUt�/�Z햌R>��\us�|��J
�\6�&0�T]��q��skx=m
�n]�{���*���# �ᶄB����`/O3��������(&�m����K��I޷-�(�Zȓ���+���
�w�J��D������έӞ���z���/��w?	���tJ�%(	��X�82z�Y�Ŧ\u���9F5\�in
���3T�l���[#���
-���Ay����糇��B1�
-�be��"�CyB���l�~��Y���ɧM�y�����o}�p��:����f�lG)ؼtо�F�*��%����~y�S�W�JExH�Rـ2��`��
��ť�J"��e
�,��
?X�4ÁR�k�B�</5�APg���0+^&�>Qv
+n
��(�����Z*b����l�n{��>�,�v�����>��$�,�t�O(2:�:�Ԙ\�8�L4��̲z�k
C/��� B�����&E4�x
-\N�f��S�|�g�x
���r��
�
ȩș:��k1�Z��q��>$&f�x�'��	��zp�\�&��!#
��~Z��*�oXh(�5�� ����
� vIYp�Ș���r������/P�(�#$
��ne�:җ3<��ug��&ѭxyڡ�?3��
-endstream
-endobj
-3466 0 obj <<
-/Type /FontDescriptor
-/FontName /GCEPBM+CMSY9
-/Flags 4
-/FontBBox [-29 -958 1146 777]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 43
-/XHeight 431
-/CharSet (/asteriskmath/element/lessequal/plusminus)
-/FontFile 3465 0 R
->> endobj
-3467 0 obj <<
-/Length1 1342
-/Length2 2576
-/Length3 0
-/Length 3453      
-/Filter /FlateDecode
->>
-stream
-xڍS	8�{���%��-�>cߗ�gM��1�2Ø�f��ز�f�\[�n�!$eK�%�ʖ\k��%��R�v��y���y���������
�}v�ʆ�;��R e
��8٠� �G"�0'D�a2� �A�R���0��8��3�A�@*�d��
-�R�B�k!� ����ҵ �/� ��K*d�d��4��I����G@/�45Օ��C�N��(�
"�>��82�Hœ@��K	9
"Ѵ???8·��=�� ?D
@H�	�*e��ܠ�� NDc=�H���pt`;�$<Ha�S�Hط�ր-
�����J�Fs 
���F�j!e-��S}h8
-�D�<Hd��Z�!H	�Q�@
�Ae��|q$2Ν
X{:��86�
~
<�D�p����Z��fS
-����R l�}&$:�g�����7��G	�ay�(�U&
q�B:�-L60l�/�'�
-JS
���OD�^�Ģ�kAԪ��!8�F�
l`0�d��8_��L08��_-
-Hxp=I�_��n�c�fϟN��#��C�����I��T
-��|m�c�Cֶ������@�2(���:UQU4ه�_�����k^;
i�u�hA���$���A�wCrk#�z�!*[�  ���O 1H<�����`-�i�����?_�e��kq�u��q>$2k
a�$�����klHL�F- 
{3
)���#1�$�`G���u��A�N��kJ�S	�˃ƨ8:
ǂ!�
-A���bo�_'��S�;�1�`��J���D �W]�@8�Y�\�g���
Z�#�?�uA�}I�kGz�DV.�6��S
kC��5|���=2j����}��ΗY���>�����:�{��QQ���`PZ��hoY%����RP����)�5=nUS��B!x�~����7g�)�K���؋�I3��w�n?���y����#�����3��0��Ȩذ���� �A��DI�䗴��h�pC_��&�P��۷|4��̷z�&��ĭ�ځN��:S���r�s��ar�G]��Kk&
�2_|�
;=�ޛ�"�3̒��!�C��z*�;�eU{x����J,��i)k;��=���[�o��3���H�w�1��=-�0���P���e at i�^�7

��+�cuL[�U,{�b�ڛ=$��5���
�+a�\j��(돘��S�\�:o���2Vt�lU���'�����e�-O�#!���mC��?qエ�.�ȻL�:I�s?
f�9�������FTȵ���X1��s��{��W���`�
-'���C\��G��]wj6mȞ�ŒTR�~�ӂ/
վ�p�m[�R�sCIjn�L'��NJɢy\�����UN�9�*b��Ɂ����py�w�v�\�_����o��౗[g��7��O
-�h{��<hV�-�9���vDԍ��B ͡V��l�N����#���^�s!�c����u����#\4O�-
�s��@p*�� ��
O䊜rx�;1T��1���z1�^��tz����=�)���m��U��=�x��.�uQ
�P*]9�I�X�);���,%����ѻ�9
r��T�{<�:��'�
�X�]��r�`��'X�0�!u�Pw7�@����̤�{����'�"s,H�ɽ�yW.�X�\�lm��{Ѐ�m̤�{=Z�80�y|_�� �ū7�͢�aj}1^>�yfE���
;�S4S�C��;���ԭ������xnm�Gw�~ܪ=�[��W�3^�|H�l���Yw�I
M�$���Ǧ��Ԛv
�j�u<��}����ys����s���\S�3��u)�u�`Q���B�%�C�*]���
�g��)�Y6(�&V��~��N
�PĈ{�|Tp�;?AZ�\I�D����{L���$P[71b
-��t�l��Y
< ��'`�T�Of�=
�`�v�v��o�`�9���
�4(@j����L��÷�k{��f�x?sa���yà��z�
v���q1�|\��k=I{+zꏞ@���=�qF�9�v&�|tݹ[�P�M����Y�1;ս="�+���Y���#�R��g3q����""7�po�MM�wN���[��$��χ����~�3�:=޾8�_�_��`ctŠ�0$�=$q�`(Q�@>�^�e�� ����:�-�	r��h%HلS��R������Y������ԕ���BS'r]{Q-�C��A�C1�;Ϫ~8p]�Og������3;F��d3BR�Yz�y�e������?*�[#g���	Ψ
-\ʈ��-q�V./S�ԳԄ�X��8A��%�MV�$ueU�ױc�
�ٹ}��B�:�NY��4�Vi��_�"	��n5B��a���')����0>a�s KT��KksW�+��F�yUE�t��zU8/�CRw��7Us�
���x�Z�s�;���Mo�5������1�1t���D��Rr�?
�x���<v�o��r@��q�W��()\	��
Uqpyͪ��u��H6-湠�
ǃK�����*���~�_h"X.}�i��T��DZ��J˭ &*R1����MK2�^5X�
�H�`�ޅ���=# �ӷ^�����M��W���ax��0W搢�h��-f�J�r��,-�5��|�wj��D�3��)����C�`���sf����i���۝�����E)�H��
�6rzs`e�Z�g��3އa�ӺNO��k�/y��8ڞ�78}�VA|��\�T��X��9�{6R�w�(�
��5��.�[�M�oQu������FˇϞ��'�������u6���
<RU��t��[��I�̺?[��
�y>���n����<�G��\��;4]U��

-k�K�v��WJ4轺�3�wtA�;"J�;IS���>i���珆oR����
-��9_����R������/�'_�o����ۢaB���s�\�˸)�����z��zt���
�A���[�

�'��8n�OA�
)@��Q��FW�is�K<�7=�_v�"
(MG|�j�g���i���hUxٳ���m��"��9��]�ɱ�B%�R�k�J��,�H�=%��!�ڈ]Ē�E���h
�{�xd[|GRh��,�֕��i�zU��
�3_K�5�.^Cl�x-���sf���n�fe�a��?��4�%�J�yY 0f�
�A����>��B�}L��0��R^��v	{��eA)wK|�e������
	lk

�����Jgn�s���1i�qn|؜,��qs�F�3�bP������M{�����N�_-�h\��U��
-,c�{_R;��͕R��Zٞ���MR
��+�]hwq
.�݂�roȬr�F[
-r?6��C��ײ��c��x x\ms�*Vh�
|���s�؉(����A[�fB����pH�27�S5�m�?z�[V��D�-f���Ӎm]Mr����P�~��ܳ�]V&���Z���N��E'�
-endstream
-endobj
-3468 0 obj <<
-/Type /FontDescriptor
-/FontName /CDCNLO+MSBM10
-/Flags 4
-/FontBBox [-55 -420 2343 920]
-/Ascent 464
-/CapHeight 689
-/Descent 0
-/ItalicAngle 0
-/StemV 40
-/XHeight 463
-/CharSet (/Q/R)
-/FontFile 3467 0 R
->> endobj
-3469 0 obj <<
-/Length1 1612
-/Length2 16995
-/Length3 0
-/Length 17832     
-/Filter /FlateDecode
->>
-stream
-xڬ�c�f[�%�v%*�Ҷ�Ҷm|i�f�m�v�m۶�W���=���������+"֌1c��7�9EZ~#����#-#
@�����A��Z�Vh��kd�#%��;��X
�;� �@#����`���#�غٛ��:(�T)��i���O���z��t03���}qZ��Z�
�B�_oT��@���% (+�..#
-��Q������ 9'K3C���!��H	0��X��`hcmd�Oit��
 � [����m at WC��?.�-�������;��`b�o����6 3kCK'�����K����o��_�_09GC{3[G�߬rB"����T���f� 㿑F6�N����/�_���������O. �����R��o�`��f��pr0�6�O4 {�����%���/�_���u����mm-���m�o���`�� �4��cd�����on3k8�E������v#'���s��� �f��/	}#kK7���^���oJ ����t�}"�7H��"���������o����y���"N��2�V�?.��� �玱Է���[�Y��6��@U�����w���
~k���0�1����A��h$g�hh
-0ַ�۩���F@{K3k�_E�m&�������L�
-��i=����F���_���N/#�&+-C�_�����j��f����(E���-���qx��=��L�� ��	9�����a�ϵ�����+@�o�
���?��\i�akC�fE�Q����x�/�?nC'{����{���?��:�
-4�[Y�1�h����X��=8.����>d[\�T��[e����Y��^
D�0����pj��/Au0܍aIޕ����"���C� kg�>��)��z��q5/���Ơr�3.��S��?��ls�D�K��F�h��m�\����{M��Y���#y����@�
d�>.uV4,�O}L���	�nz���������.;?��+���Z"��
	���= �C���̱HSg�}��
K�1�F
-s}	E)'{n& �W�
��������h�[�40�&�l�Q<�%���,{֍�݋��v����nڈ�
�Ν�"-�|�WA�a\
D�|a
�J��o��ט��@��
E��%㢵�[�]Y1���1�x��R4���@OOV;_v-x# }�~p	�F| �
dzC05%�"%��O{�OO��.�@@
�$%��,�i���K�
� �j���.f1��>�w�&.�R�
��R�yK�z���On �I"D�{5�ѯ
R�
щ ��y����u~=����1�e�(��~�3�ޢa�}�d�
�ܾ�?�ހ��O����kh����������T0 �F,�zRx�Zʏt��E��4�_J� ��M����q)Lq�+P��	�y�e2�}d
���
��Dq�{��+y���m�k�e���gk�J�������
���w�������]���r[���n*d)Vū-��w:�����Vh
51Geheg|��.�J�o�W�܁�j���Д7�#�~�K��Ҿ2�e?:
?��v
��k�����
�t�"�zoRSbR�����,�g��d��
-� �%ڃ�,��J��ꦤN��
w,���Mݒ�X�J��F!
����6� Wzv�#r��m������n��7&�޴KIM��s�Ӕ�'1�k� d/����&�Q4݅�Ǥ*�`W�Q4;�I��-�٭0��"&e�����C���:#!���ǾPnl�Q.ܶS�1�����@Eլ]^� :�����S\�h��%�+���;?�',Zš�0'���`gk��
?�����P��_�p�L���D��)o
�D��3�E/�0;HE]z�:�M~iFQ���.�r��6��ӂ��W���Y�>�ȳ��
a��� ��/2�z^����5�3�NՑC���]�
އ�R�2�
-�I�`m�Ӳ��8�h@��A���f*�$cag\gV��5<u�S-�on���(@���^�y.X�3�
�M@�$c�4�����<DK�̛Vl�J_O�XSҨJ��! {��Uhs, )�Ra�D��d�I�g ����q��ȠW���p���ǀH0�I���Qf>�Ӗ�HOk�W��� i��[!n4�0�
2�\�;�i��%pv��I�8@|��4
���:o

��A�*G�=�ï�=f!�jƧ^q�KTU ��8BE1�+�b�c��eE$؝�=�n��ͭQ���>r��5j;��T��Œ��7�϶�.O�C
M"
�N����� G��r��x�ޠ��뜝��D���o��Q�6��
�
�#�K�s�nF?D2V#�a5t.qT
�!54�/�HM^f�6 �K4����"�܉��ّ��x���Z�&�L kp���80Y�%������ފ�7�@��c�7����a�dF
����UV�P]�t�����Yo���$+շ���J�-�UI�����@��1���@�:�d�c(R=6M�ӑ}���%�i{�/�HWJ�_�#�w�{��J�rn��� �̒�̯s*z�ѷ�J10���D������<x�&�M&
�e�h�tR.�A�M���e)Yby�]C�A�DI�,����K�(�C��eh��
��&.����]�O:� �n
�����R��4Q$���+��
���
�b��r��e
-��5�-Ͳ"��W
�J��5f8���;]{M�M��e�RBrX����;��
�5��Ӟ�?��Z_!�O�k�le1;z^	�چH�@7r�"~i��;���������{��\"�L�	7#��-tm�}	�l�E�H�X�΂(/�L�ݚn��J�-9��B��v��e
-�����5�J�%f��:*z�����<�oj�S�h���x.����������� ��`
o��4u����3
\Ay[��PT����n#�&�H�
\�ڥ7�̔�J�g��Oo�����o}�v;���h,P��z^�q�o�m��I ��.��
-�
�
-����"<aK����
_J�:�
W�}��tO�==VD����HE$�u�1ߔsz���l�ׇ�C�V�H�
z43
-]-˓W|jR'81�ťW
-6�� D�T�ꝋC�gJ�D2y$�
-w��'\@��G�Wg���o:X-�fV�p���vO���E��ԙI�u�
��Ɨ�15���<hٗt��������L�L���ghSҴ
L�W�
�=�r��3�.�变zK��h�:K�mG
-;���"]��H�
-�p	H\��
M��]���|�T�&�۔�
��Y�b�ӣ��b�����\���T턇�=�*���F��"ӟ��>�
���j
�����&��/n��#��=?q��
�$�!������F݂ �E���XW?�i̵�{��H��'70��+�'^�a���d�bk�Z�� hO뵹��
����\�?��mYM$�9>hi�V�L�U���?�I����R
}� ��
U׸�<��e^��HR��Jf at Io���
�K��ѿ]�	�
*T���4��'�A�7߃�<����;�SRR�5�β,���\�.K�1�VQ6_J �;�0*v=�7$%P;�*Ӛ?��'$;�(P� �U\�O4�Z��jd[�<aE�~+퓖-z��*e=���q�r�.l� D�}%{��(_�Jl�o�؇�e�j�$of�*�
]�����xP1���
b]x�#�WȂ'*p*�&�(�����K��`85$��(9��6P��Y��Ek�PG�;E��Cv���>�dd<�׻,m~yc#/�c3ߏ@Ԟ�&��Ӥk]�P����TX;ώ�ب�-F�mI�
-��m�R�@
A
0�}Ť�e:@r�K�g��Rs��I�э�iţ�
����c�\�o��q�x������1
A���0�W6�;6��!���G�Z(��nc�+�:�j��Xɔ�Ș
u�rБ9u)��Kb�&��{�Ч/�Mk?�|�֜F�"�y�eX��R�>��
-S�FIyC�-�>h��<[u�q2�hOUD��f�>��4t�R�?j:���sw��%G�J�
�ɘorH��[[����0��+A�-��y�@�o��~��S�)W��L
���p2�m:O�V at oVk�!}}��c���5��>R+��|k�Lu)
�1�&i��f��Gcے4��(�y�
%
-qv���C��Tj�F��%��
|��WɈ�<ܯ(��ɫU�<.�̩�������},�˯�i��.$^�Zy�J�

-����
�@*�8�6y
�}�De����ȸó�TQ
���
.�K���ť��&N��O������҆��O�
ӣ���@ڝ���<)(|x"^�TJ�'v�S3�UIZ%F6&�r�� �ge'�b�Ԁ��kB<*�����{v���{�7ܼ1�����Sn�P�`#�"^��
����PB����֐�ܟPW|�օ�*
տQHk�p������D
Te[�* n��֣~����RbY�I:�Q���
'�@�/"�%GP�0�p��vo0C�II(^�H!�sA��U�sUH�ۄ �^��
�e��6���ܤ�]�
9�	U�9�%rԑ&�",�7�j?�
-qN��V
߂���i�,+Q�ܒ<��
d�p�U��pꀌ������z�4��n
l������Ao+_3}��k��@�Q��b��d���q�n�(˓WΝ�
�����?z���hq�k"$�8�J����
O��0�ͧ��s
Z�nI�M[�?��p,Ѯ�>8s��=ҼiW�봍ڻŶ�ϛ����H(H���X��4B?1x3S�'�H�y;P���[�;��"�+Qz
�kc-(����A7����ȺϨ�5ޫ�:^��b�]FX6�%�1Ί����
T�I��h]z�Oz��;���y< 
-qBX.�5�JM�e��������&��e��_
Q�
��A����7;�a6�׃R���A��=]b4�+c��G��^,L1j�[�iq�'�*�ﺺ^���xVp�B~:�s`����l�4K�]� 
��t������[�&��%�7x
���h���?;��P/���&z��U%�saI`+-148���IQ�l���@��͘�NbR��5���"9	X�S���a��s�&d�^CӪ���fj�H�P58kqy]�E}sc�LM(K2<*��J0�����m:ؑ����JZ	]�����m�ȥ�{�NC�t��
���o��W	�KU�V
��0lۻ�5�SfRrK[hC��d��J���O|E�"e
�C[�(+�+#��S����%�� �' �y�:%�v�x}�.J"u��
f��A�C�C��2I�d4���8��;Y����0�:B>����?dQz)�	Q��ƒ4�p����w�����[�_1�H=���� [...]
5v�K�cJx��\dYQJf�^� ���9~�
5�*WX
�K����������s��9Hmh�+��_,��gs<?�k�
H�f�[�s�'��#z�,���ыk�]H�"ˤ�"!���f�h�~���r�n
�J
h�L�`���7T6ojIA���X��
5�j�i���F�ȟ×�S�a.�=V�q�V�5g[c�5����4f1R���ezw�G��%t;ˆ���� u6E�ۤVT�b�5�萎�bf�����1�zV6�N�7?�m൒�Xl�X�%��>�ݶ
�[��($4#�nk����|�V�}��+�E����4���D�K���O��w6��r��F�r7/3Y�eUC��)A�Z�
�#�OP9�(7�YcE
�x��j�$�����)��Kk�xر��
B;M
 �*����������o�������\ �
P�?;I������e��1,�L�2W)�x�-�D�xx#_�!�v%bU9[V}���I���:�pcBF��R�1��0o���%�R��H�a$v��$���P
�ـ�_�8YQK�1_�+�LAy�I��6�ї	�m�`0�j�.�pZ߱�5���5V�.�bb��2�i��G���� ��*T�K����h��K!?��e�Y�W	�bn���mQZ��;�
-�zx/l���<��3v�
e��d�?]lG��x��=�<�������U!%�
^��g��^�����q�)�@�^c}�������E���}3s�
C�
�����|d�wb�J�
-B�\3R�y�p
�m��X���+�U�]�V�{ݯ�z+�I��]ݛ>����F��ϖ���]�W�jX��
���S�,.���:0m&��J��,k���
*�ь��ҩCC}NB�Ah3��`��pj��O�!��1[[��}�/���^��Q5�i5��}P7{&����w
�)�}��%[���<\ ��h�#�(�����f�B,`l�o�� T{*��ت�Kﭟڗ��i9YW�U�k$���@~
�:\X
U�*Q�Ќ����QX�ר��;���Gvy�;�

e�0�vё�_���۔��dL9z�a��.���V�1����Go��]�x�$�,�,�#��Η�Q���xbLkA��=]�l9s?�c
7�MC�R�F�x�$����&#
-�Ji���5Wn0��)GXY,���^�i�
-f'_QK8*�E�8�" �(K%�0��4��g�dMo��u?=��P�C��C���W�)�=���Yb������|�9?�]����O�{ ��OV�;�+m�H������'B�P��x�J
(�����R��8TL�8��"�J��C
�P��N*�E`2��.d�Z"U�b -��z_�q���&�!��C���,�yp�l�82��/��$��EL��:eG�>S7�!c=��kG��A?�M�����p��ݳ2q�^)
3���{gc\�?~�������{�226V�`�#`P+�tL��~.W����čzDz�
�
j���!��3V��$Nj4���j��ѳ� J+�2Q&d$W�
��
^Zi_�vv�J�U������.�d݇o8�	�l�̟
R�1��
-�
����J���@�e,�HЩaϺ��:f
��~=<d��&���fߩϜy~���.Y$�#2�h���_�����3H,�[��)b���y	�2�n�����0��ӡ�I�ɐ�_��M�(�'����QQ6,� @P]}	����n���=�h�jB�5	��m��|��B]moƓ�/Lor�l *Bp+u~�"��\6�{d�z�
\IZI�.ш��.��t��T�j�]��x���^�eqØ�0Y�LˏLi��N�*�M�K�
��Q~R���neʰ͂�$H7
�
-ٷ�x�I¡���&��pr9%�`T�h[O-J#Ǜ?��/�~����
����_�u':|�l)hHˤ�`���zj%d�u��c���'��
<1�ę�Z����R�q׷qL��
K3+%?p�mv��>���IU�u��[
��ЛI}��jä�	�G������8f�����^7���t�y����Z�tS��;X��ѥC/i�C�������
�P%��ۦ4����,a�3�̪2P$3���:(b�N��n�br+��Qh�� J'�x����5o
�'��q��Jg`�M0�]pv}þv���(i��қK_��=
��q��:p��Ot�q�hR;��2�ep�M-���
M�`X?�"r��Ϯ��� &�P#:s�=�
-o��nS����:�~��������
�,�2��E� 1�����/VRlo�-�I�M!X�do5�:B�
� 9i��"(����'��D��(�
�1�p&Am|�0g�h����>���x5����
B3
��A�d[��W㤣Uq�L�q��Z�v"�K�-/�$u�eߊ�����s;�
8�
-B��屧(�Blvy��b]�ch���x���"K,Op,�q�<�T�MH|�O!��!+��O
�v�ioL�Z#�M�H7�
3�w��Xkl+F��Az‘=��ʳk>���OD�s���
�ЕRh���Wٞ���~���H�
��C9s�/�&��+��=���膇2�ɲ�aB-lÞu�-�U�6	9���.)@�3;*e���g�[�W��K��mQW��`�
1
���7��+&����}
��'���6��>
��o�+L�k�V�<����o� �z at d�>���(��*�C��y-�m{�}�YǨ{0p,� �'<¼�MW��O�v��
I���/)#%)����$��2�+�`�Y�{��*^�tCF��i� �5X����H���a���
�_�Ѭ]KDp
-<�b�M�9�
zb�N�P���L�!TH�M�Z4�(I�1��R�80���7n=�
Gc�g���]��W
�-��=7��y]��?��S
=��vF��"umJ��)��jDG*��VoY�K5��
��6�յ���U����/��S�L��Yj�@�b��a2��
��
-�kr?��cV
�u�Y�iL���>�����
��{�q�v�|l�M얓PS����,���7�2	wk#�̡ޑ�E���9�VT�8�/Q
�����i����-��
���Wu|��7_q8�9$����ʱ �X���F�v����W7���c�SJ_��>V���SreO	T��u��ı����3���;u���m�݃��!�nr�|���0}�>�A h
�*+���0_���:�ERI�N���O��_��?�IկC#Ş�<�Z �,��mC�_L�2L~]�	?4�)B٘L�������CK5�Xܪ����5�g�c#nV�(~�]cu���Z�v
�D(@��;
Ob�q%X�@O� r�qd�$�
$Rb���
�G�t��I}�? ��C��@,ig
QAu�T�3
�'�b4��׫zS �o&1�hz��"����n��ﭰg
�Χ�=�|���X���v�z1�5�	ĥ���~ ��;�vWsx����t
�n���׋1�[h��	������d�u=AY;;�� �[Y{.I[������|E6���t*�x�i)��Ǝ�^K��g�t���MH�Gkv�=d�m%=����$
jH�W,[�����
r�{s�`�;�
�if (�{7�h�Dt�i&��O�I��q-�U
QL���.�Ht��y^��#%%��'�pJ�8oj�f������[/[�^'���
�����.R��@���`���A/�/�'��xg��i
�NAz44�"|%�tN]/���Sᣑb�b�Sѱ��ѦɄ�l�h
^]��m����#���5��n�M)u?�ί}0�FW�Tu+[A���]t�R��V�
��A�{��*��@��Ã�69,�����͗}h��=��"i�RLNYlwB~������>��^�?x+��'�\��G

E�%�0�h�lB���:�<^e}���
_x-�,蕖9�����n��&�C��Nۗ]�5��vj�S��Q>�k�a��\H=�b���8Eb����4��I'
>{C�aH=A���[�=��D�3���I�ii}�Ye̩��b�lG�	�b�ho�����r���;��K<f/�ݩ���t���?��6Ml��M�Z�z��6`�^?�H�}4�rP/ ���-

�O��������-�
�'A���&�}�qC�j����P&��
^�Zj�,y��6��deHAZ�cnf�N�kե�2&�
a
��L�<ش�P)]@T]�w�W�iE��jI"9 hA�Ƞ|.����x��+��2_j����p���\q���M��"�$d��P`e�i�q��n��$�}�L�V��L!J���M8�'*��)�c2�Im�n����3��/R��߾K��S{�u��J.b�=����2sih��	`�
ɬ��x{B7���L���l��5p%@2����q=X��5q����)��GϗW>�eV�Q�~3x�B
�,%76�xW
�AkҰ��p�c�h[�6��~$�d�
�
]�"����p��v%����Pߙ��AJ���A�л�Q��}���C�lJ�Ǎ�38&9�#�l~�����|F�(�>oAj�4h�"�>���H��-+.]ז��
'G��e
U8j�n+��GjB�P�?�a��&l!�fFj B+r(}����ڤ�ܯ�A_s}�/�*����)��:����,*��������[kwԬ�x6. ����W,
�D���6�ǫBA�aQ�D0X��,��t� �?�T�0��C<v=[]!�b�!N�v�\���M�Tl0��8X]g�y���H��e���*���Ԏ܁�������
�W�E"���cf'��69%䷮?Y�蜷�?`/�C2�e�}H�lR%��p	
N�Ulq	J�
-[jxD䬫��7/s
"���}�S�>���/����}C`�NSX4~���MPl>�s�䯾mcR�3D��u�]��*W�%^F{9����|K�H��U�
-�f��� w����A]�b\�y�F�l~����^
��Ԟ6+,�bA�D�_�[d
���Lm�S��C���C]+U���Ͼ<w/2����5 at AA �Z�B<U���M�S>ҟ��V����ܑ�=�]��
�ĭ���ϕ��x[S��
D
��qx}�I�"�f+��FT�@S*|%_�۷E�w��ٴ��Dz�:K��Ao#qhns�<
>�ft0_����
r0ً=�OPx���`��!��AH��o�e/}��4�F�>0ddN|TR��Q�̲�
{����z��OE	�����*�b�ֲ���&�T�ȹ�X�n�i�S6.Ж��cd�M�
Z'¿�0�I�i��,ž��k���Nf��<��
+�������\m�4�
���5�=��i�\ٙ�<®#	��NDe�U8%�
4��������-}�$��n1ڽ
�ES����B���}
﹄�Rh�dH\xG���D�&~�N!�cq��%I��@��
Զ#	y *�c
F��
zI�d�
<��G6n�Z�0���j���%g��$�Y��{�D����4��=>N�=�8m�W0A�t����K1���;�o2EB'/)4�o�y	�6�m�`�GO7��5R�iL��j�
D��}'�
���aXG��Im)D>�]�g��L�J
�\�
@�4��}/�r�&?��XTqR`[�(h4f�*��HsW'u7F�����F�~��V��*�mA�=��cz@�7
���5��<*r��	Pk)�x6,e����nv��Z��$	���+�%y!=:��� +^�8�G�����i������5�'L���d�qT��Cfe���"�_s~�q��}k�}���pѬ��#��s��@Ƕ醇�AP��y�F�SZ��#&sJi�.�Ng7�pCp
-�|�ӎ �}M6EV�_T)���6�T>�d��)�3��"�;[CF̥��7���1p�|�AA��J���!H
2��1s%}���
�h���3i�
��C�Z�
|4��8S���ޞ�����b������+s����1R���6O#>�щ�����=�
-m])Ƿ߃�
-3�,}�
�9��N4.0[�\�.}��b���G�au^�� :H9���&�#ݥ

-�F�&w��G"����H�;��{��,#�@L���O�X-����fl�IV|�\n�
��8�ZΔ�-9o���6��XBԑ`��X�ޠ/;���)�>��!�8L-���2�D��{�/2TNg�K�$$}�/$��	df���$��r�錖��^�]I �����2��4��?d\�KQ�_/-���u��>��V�
-�A���% ��7�.�i���@+S@��^��rD�9!��
�f�ȹ3墛��u��$��v9dI��ܧ��3q
����rX�z�Q<7E�8�]��pRcYm�,��4�Ŭ߿!7�v�_ً��+7�O�18T�<>qٓk~-ot\OR
=e��ۇvW��!)8H����cϴ�*�3
���N�qxO�/)�P�n�1��aJ��^��Gy2�����-���ڦ~CZ��w
-Fu!eX�'a��!����0*
�������Z�K�wuׄ{j�얕�]g�ڦ��ҍe&���c��-T���mL
�>��d� �n����
�>�`O�
A�V橃\*ҷ|K���-�FI[a���n��v����W����E�y��(
5��O�/f)�s�Np�U��'�3�S���� �@�4{(��
皉E�7���>������Ma��&�(^C�:*g�E��y����D�T"������Öm��fu�h�M@��5��,��
��酵+�:#_�ۮE�ҼBF�Q�;�NIj8+���82�-����:!B�&�&��D
���;3�{b�
=�
-����;R�;��]�hW��\�~���j���Jo��~��@]Rn��x��
,P>A��b�l�g��6�[��z�G�`����ʛf�+�G�7Z�������u�2H�������O�^/R at HiK�S�Rp���i\Nk�
d�ø���>�\�3�򴗩d`I�W#
Ur���&려��HKSfMj�
�U�斏I����O�OP�3tr"S�
r����h6u�ە-������R{P�l&I��.��sƀ1b=�O�Ջ���d��#	X*���������2\� Ƿ�F�V{���[~K��E4��/ъѐo�4��
��bQa�ŧ*��7�H�~�
�y%j8A�X��>���k

����M<3D+�;�*x[OM�]�.�N7�Ҟ����|�Qg�
-#=e��;Ik����k����� ���4�MqUFVe�+
f
ag�/l��_��(�tr??�<&ܓ {Evgu{��߰	�..��>g6�	�)�������<${��7Ӱ�z�]"�����}zp�;Q�J0�)��Kn�n걠
��V?��-ɣ�4�2Z��DA�0����X��R4��	��r˭B@�-��楠5ʒ���A�ST�t��ց�;����qT�AY3��E�
����",
�����
bY��I�!���[}N~	�t����C���%U(ŵ+�����b��b`:%���O\/��^P^L�}T��Xo�gY����`�	������u��!�*%��v�qo%�	�v�n}��5�� N�����E�
Á�2����栅���5(�70|������v���L���X�ɐ�ew
"ٕF=rH
f�/ 9Lm�� w��������l���½?
bH�mm-(�#�JI{C�ۼ��\uy'��]��P����"�1�ں��}-�i��X� ?�+����b
R�||��Uݜ����-��;��V��2�M\�0�4�#��T�O��0�\_G}�����n���%��Ӡ�3m��@�!�2�,�l��R�$�1��]��V���l�# ���@�F|��L�E}�(S
-�z�i��S�&mB�Lp��9��9�l\s�Y�e��;���t/���WfY
S#�Q����y�̥A
-��
>A�­��߼扅������]�nA�ޫ��s�����v�=�ҵI`�ư�$�N��Θ��67ƕ�^�����KQo)��	���o����
"x��;��O�,�$�e��3�J��"1��;���	�؅���܅
-o4�({cu=�'��U�PP3���\V6�.�,[�[Q�?ݗ��M2��M0%�-�M��e��@:{,:����3M���~y�Lj�IwWt~҇9V+�
����W6��	me*��	�-���ʛW"H&�v#�h�*�:��&Y��!!�H^P�(���\[�TD	qw�BQ́�xc�*r�V�p�0��I��C����1,¤3��w�p��]��Sd0I�0�=�P{\������$�}�h��R�_)$q�!cd��nh�ڮ�qP
�"������8Z\�hVG��,{�i2EηN:eqw�)4�y�i��?��
��^�Ӆ�v��G>k���w&��j.�[���Mm,�}�W�Y�����z����v�`��$AV/ŧ��)]
o֎{H�J�	.�궊`��E�V����F"��7����}��֛U����X
0�SloXy�)���W���/�y�v��/y����PkȬ
z_9��o̱s��t��ofyb
-?�6����r�Z^�ѵ)Ӫ:Cep�u���c<�t�75������i�G�H��{���܂��7�0�
�	;��g���̣��'��&��8��Đ;�[n��1�:���Q
山�Q��6G�M!6���@Ji����d�٢Mi(э'���r����m?ȔIO��C�9��RW����U�������V�̵���̜��“�y��D����e
V���esV���v
$
�س �3~�U�
t�:�P��V.P��I�
m
1��	t�s��"���K�;|[V��X�K16�o����u0��{wR/Η��j����> r��󶜙��k�F����Q�7
��έY��>��L����b^b���QHW�)�p��&Ҟy��� ;�%�;�P`C��s�F����
����
hڢ��].����nG���+�!�Ғ‰EZ���ɩ�9x%k��U�"�h.K���H;'�`8FW�&��Z�C��E
�lԥK�9|�[&��u3'�ӯ�?��o��Bh؊f(�i�|� [...]
�Q'~TP[����_��oĶc\�ƅ��f�>��,���v}��J󏤎Jy����ke�󢆊Z����["��!�'���/n�?3�9@�צ��2?*r&k<���
6�4��]
�lo`��.�9l�T �����pD�
�טY�dd��*�y�G����.$
�Bg3*�d�V�_3�!2}^�T/gx_����o�3�8:i�
�ص�BB9�6���?�B~U�$�Ѯ��L�3
���4P�u�?3=r!�W���!ON��U|^W�RS��P��؁�
-T٬K]j�
�gwrR���ƛ����^19����G���
�uk�
��}N�HG�M
���
-x봡�Ɵ��o��B�E4�!LڌtQ�|�z�����<Ҏ99��
-��D*n�SZM�^��
 ���|::��/���K���?
-��E�W��oJᒝ!�K�aK��;~z����#+�A�v��r�C��X$�/|�ǖ
f��N($�R�/id��R
ͥ�;����:0/�.x�Q��M} �� �,Zq/�m�2���l��$����R��0
��i�נ|�
��2��J#5*�RI�yc�d����i!��q��c�{���'��Ć�2��E8(�w�І�X����҈�QS���
���p�ހ�9;�o���N�rv��=���i

-�R��vCK&
�J#U�t�ڒitT<&i�,�隰a�'����O
-�
���'�� ���fz1��
��
Zn
:b�������W�⒀4�Z�u��
�)W��
J��{�kf6��I���/
zdr����Q:ٵD�ڲ�]ev�(�
���T����?ӇӺ�O�6����W����I��N�L�Q�v;�M��j�I�aӡ2��p at 9�4��t8��(���^R�yfĩ���ZQ
�G��
-�F:�u=c󰪏��Ei�'
�@�P{
~��N|j��|9�d>�&F
�79��h/�ȵ�OOR�&�%�*e���C�=T�����Y����+�Ӝ��P�c���N�*�_�i^�Ó��@!m��CJ@�tfߟH^t���j����J/d�����h|M�K$��+�J���W�%!���f4�,\��1
&��}p&W��e��K�#nYa��JR5�B�����W�6��>����|��)��y
���/X���pm��δt[�[����l���}NM���_�T`s۾���\��
/�g[���ֶ��{��UB��܍&��l���kB[�s�U]wL̂�W7M�z�J�O4{��t38��G& ?.��	�.�nI��Q�^x<�
-"��P�]#!�D��@�_�v�c{�S�
-�!}{j���Xz�
���~�l���r�n�&~�d��*���r�<ga!��|	��4l�*�Bpb{z�`˩=S1�
�����
v��5�W>��Q���CZ^����TP���.m����O7��
9�Y$pA�v;��9U�i�;���j16��)4�:A��Q"�x#w/�Q �j>���<��3*�N���{�����'����I�c/o����A�.G���
���(��~��+�M[H�K��y��
�G)�	jq�;�
z
tk2}�=��������U(
��+|�����!�k��� *�#CnT�7�_R�h�OXy=���X
-�(	��*�?0ëN��E_B�M<E
�Go˃��
�*��z���Z�r0�٦��0��lz��c
2g��]��w2YU�_�32���S���3�2ܺ_ nB��U3�p�]H�A���>�u���+~!Y ��N��>�8`��BR=XF�+�j.�º��i��h���}n�I��LIH��9��~�
-��4�Coz�Sdj�����(��g�|�,q�6ecu��D�3���ڌ�?T?5�V���s��m�pB��;F?(\��$d�DBJ*��r������r���֯һ�K"W���yku)�hY"۵�[�ҟ`?�{��<�0�G�Y�>��s���V�$sp��}|����Bbo�����V��_rg��x�7�,�ۦ2m�!F����k7�ʗ�DC�ޕ�̹�q�DZ���
�Br�]+��+Xrx���sׂ���*B��'5�r�欢�ϖ\!��.��?�QsG���������Y�=��tT!r���
-|�n��z��)
@��3^b�Y��)��P�S��g�aP5�^Co��n������5�����M��s�dȣB�q�泯#*ғ��/�:g(�WQJ	�t��������o�IOw�u�c��9*�J
"k*I�5L�G^H��YU(GX)+�U�k��w���6��hiaJ�vL��k�A�Φ,r���FxG��	�",'
�\m�^����e at U7Q�9��QmO�g��w&V��i����5�H���*���������h
��O�X���G"��z����_��X�fz�tY�זK��Rf�Z��1J0�㫼�B���ZX'���Q�����v�A����؞q�	9��d�m
x�9��Z2�`��f��9�p�6�@xr�n��?5+F$E
D5@�H����;O�����2P�H���e,�"S�o~,���@>��y���
�g�����J SML
@9���I��e�Gʩ5����"
Y,�RB���os�\W�@]�������ã)	w>��U,�O��
,Y
��Nx��Y0�{ⓈQX��U���_
m�Ų��u*��'DJ���CɝR>$"~cB��g�z�O�������^[9kb'ⱒ����,��I��0A��Et�s��&V3ȯ_\�x�M�_b��=b@�]R毽H�F���v�x9�	�y���dD�NM���uj�
�li�~��cW8ؗ�v��^,
��T�&��b�Ϳeʈ�oK�?�#
�q���Ľe�"z��~*K��]�j�Ы�Ph'ך"�I����'p$=t,e�D틺��	}���g�)����n�k�^̓��#��#;�7��x�<$�h3�\�����D��"Œ��$�(84I�M׷�MC��Ёe|{�6=lX�)J�p���6����.4뿝e�7+O�N�=� ��+���K���
��<����5����[������� ?^��a���WT��9
�k8Am�f��
��M�� ����_v�K�'�Y����r>�G��]
����WI���u�m;KPD�	�@s>mp
-endstream
-endobj
-3470 0 obj <<
-/Type /FontDescriptor
-/FontName /NQXOMN+NimbusMonL-Regu
-/Flags 4
-/FontBBox [-12 -237 650 811]
-/Ascent 625
-/CapHeight 557
-/Descent -147
-/ItalicAngle 0
-/StemV 41
-/XHeight 426
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/X/Y/Z/a/ampersand/b/bracketleft/bracketright/c/colon/comma/d/e/equal/exclam/f/five/g/greater/h/hyphen/i/j/k/l/less/m/n/numbersign/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteleft/quoteright/r/s/semicolon/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3469 0 R
->> endobj
-3471 0 obj <<
-/Length1 1630
-/Length2 8179
-/Length3 0
-/Length 9013      
-/Filter /FlateDecode
->>
-stream
-xڭTeX��%����Ρ���AA``�!f IIQ���I������>�w������u��1s�Ϻ׺W��yh�t��VN�`'(
���%Ѐ8Z��ԝ�j@
�������30Ⱥ�-�'��
,0[��  �[XX� ����
-�����u
Y����e������	��@���`'gG0�H���p[0�� �jj+k(�5��`(�������
-���00
������ r�ZA~��x䒆, 0g0�~
;����`WG
��
�� 6�P��
�N ��f���G��ӟ��]�
=
�G2-'
r�8��Y����nk��y�N֏�VN ��-��
i
Q�
-����sY�V�����c�G2gWȟ2�`�Ϳ*`��m,\�
�0�#�#�����O���������O���� ����
��<�9A���6(:��eQ�Z;����[�9�s����ay,���	��	�[�sj8�S��o*s��D�H��?"��Oܿk�?.���>��Z���A���q�zd ���@
���q�p�~k\���+�����o��h������;�
�x
�4��Q 7�_fL�l���l��3�cׇZ�]
 P������7L������/
��{��r�)�SFA]Cل�߽�<�
7���
�wCu'�
~���8�x�@
^A�� @�����d�C���������������߿N�������~o�.�j��l�4��An�������M���g����`�ܴH4�.%=^M��7,�����i_�sq�^A����7)�V���o�B8�GD�<�m;��Ta]� r`���ϥ�c������"ȶ
�iV���c�}0���d"�e��:��cVt�B9������ş�=ϟ�����(�6���
�:{�1~�✩g�����r�Or��h4Q
b��m�����i
�
��]�cUT;��)�N§�8��q�t�7�t߻@���v$
���o�zॺ�D<������
-
,#]�\G_i�.m��
-�\"щ�J��UacsRHY
-O��I��DӴv[2���ǒ�;�?{%W��:–Lс�zo�����G������t	��
�S5���X'���wo����Oi�s����
�#F ^,���,�/�Ҽ��(���l�U�xrM>���~�8<�@0mxz�����kx�a`B
AS�~�b���E���>RcG�dݓ�%"�v���5��z�H̟M\l���ƫ��LƤԌ̒z�iou:(,�'
�TP��]r�kXQZ��8�ƀ�_��
-7�1�XO����vz�D�����Կo�Hm0�ih��ç- l9�ŏ5�q ,LҾ�l�uP[~.BN�k�噁�YΚ
K��9"0`��ڍ`����O�w 
�TG��-���N�ѻ,�Z_a��J�5�ƹ��8�/���k<t1h�b�Tָ������Yư��z�"���b|ʆ�K�aZ
-�ޭ�j�6H�<�@/�^�o����OL��Y�7�1�
-#
��Q�,���B
��+��6�}�N�Jrg�j|��b��p�V�6��JP%�]�3��cI���Xg��U�ї_ ,��HkMO{Tt6QE��K柱�O/��K�?�
��,���X�	�hM
��Y��(�m�M��u�
���4����
-Y�3k?�N�f�AR��'���p�l����b�YE[�]�#)i�>�t%$Dnva�#YQ)~��R�ݨ�\�����jkl_�����e��o
�|�w�LssEd�/HB
{T�7��%n򳶡c��*�R��F��
X�\yƣ����ٓ0~�):�
؈K���r��Y"�Z���u�Q N��s]s�4�U2�
�A��~�p�ժ'���q� ���7(�)����1i�ЇF�.F+�
}&l�q���{O�
�F"B���K��sn���fn�3]�!�#G��j)q��'��@
-L�����т�Bj��]�'n�%34�_
S=��F?6��[c���4L��\��)֋n�<� �Q]ZP"&�
�)�/7�v�
 ;N�����E2.��0�ٸ;+3�тȪڀ[?
�
غ�X��d���>C�	xK�1�8f����Km~y跿�WN)L䢏zݙg �%�]�����?���Y2c�nL,؅{�h��
����Su�O�"*� �yU��U#M ��4�}��Q�`J��H�\���8~�W� �E��
SgD��⃄�UT:���3�
[2�n/���
-H���MԹ3o��2��pB���Ũ���H��/t����g֑geծ�K"f��&�������
3��c��G�%i�����ޱ6�J'����th��{�{�Nfe��0�(�P����z�k=�uw&�7Q�0��Չ�T���>�G��#z�h�e�P�6^���b�J
�	����W#ShRB��E6� 0��o�.c�_�ݨVQ�W�\R�<����"�vr�Riv%s
-JiwC&5����wd��~,�ް������Έ��mQV��N{��i����f�@T�VT��!�\��/���JޘX����Di�n�C�.4;��3ԍ�`��,��St��>-W4p���
-_��Dt
4m��

�S�<�����M�T�,�;���g't�p�0�E�nj��H[�&�V �������h&���Js�N|�Z��b�۠����-{
-�d��J��g˥��܆57H���y
v7Q^LuW��_�R��tHV1o����'om����ʗ�z)V>1�Lb�W�FV(�� C���5e*��iL�� `��ӹt��{��H��{�畼sC1��f"\
�ѽ�w�ݻ�$T�؃�R5��	�ﺍ�.��%=Xa�Ph)7�\nen�@��k6]U�xD��uv��O�l����*/D�v�Dh��5��!��'���
��,C-7�����A^
���ن$pk��U:�$6��CB/�ƿ�
�_��f���}� r,�b%0�G!c2b�L
�wBD9\���!�����"o�)6����@o�XXb���C�Ap3��Q�
��l-z�{�
�ƍ�ucC&�I�J&���)̍U�p��7b�r7Z��(���TH�#)q��d�>Xt��Y0��ނ�<R'���a�W���;�ӂ��
Nn`z|��5�Û5r~b�ہ�M
��!�i��R9�
�l>�;n1
+��)��"�{�>V��誗�>��9��*u����7Z�Ɯ�&ꙋ��ģY��N澽`^�L:n�ɽ������JszV���D=ԋT1:�Z�o�	m��7h_�L�`������;p���tY
-3��I�:[k�|���R�0וl��������b��y��R(!Y����P+���zp_Ȍ�<�&xO�ڸ��').�_ �ӌH�% �U�FU����Կl�8�I���� /���(��^��
����^�~��GH�p�y6�:�0T���6���'��ņ��ŰS�U4�o��|$jNm���<�c;�[�	
)
���[�
�J���
��ai�%#ñ�Ȝ��X
&
c��K0���lH'�ψ��3�e��S‚pl��<�
�C�[
<��S_lH(~zع�=9o��uGl�E-s��j��L�<�~槎�j�k�Y�������O�����{$�ϳ�
=u$���.^,��8vj��+hE���z
�3
��o��$��	г�6�g^R�4b���|\�7{B>��
˔��Q|9�4�1�A��S��HY^󶛣�/�%���v�q�6o�NJ^p
-���~j��P2�&%>

������P�P��҂����SC�UN���Ţw7��B�y���*hDt�
-
,�Q�&��\ �V��4����IF?3�^�K�7���[����4=�^�TmQ�]���$�P��Q[|�ܫ�A�w�#*����P_5�?��V^�i.q�O�U3�V��S�+N�L�
-.��u�P݈u��B���W�,�'������gV)�>z���^�$��'��p�HΠ�
`6pN�N_�u�
-%~Փ>�%�O�AT����I/�L�ᤇ���V*�-�������S�ƾ
O�pÐ��K�ۧ~�k���~��
J��B32#��vLB����ˉ~>�<U�$�� ��hFC�ћ�ςEG������o�C�%-��t,$���UϕR:��]��R� ��G��ի�& l��6�<�X�f"p��/"��b4�WO
���[Ό
�7&d�.j���/��z��7� 5P
-�,~��}�g�J�;�7Aj��'
��tmʽ���:���h�O�j
0���e�LR�3�-��D��{Ӱ�)�+,��JzA$�
&����QҖyt9�^?����$m&`cg�q��z�$�O�O�E
-�
��Vvm��
���|���B'�/���E'*��%ʿR�i�aq���XdV��#zՠ0n�b7��1Y��R���l_bahf%�
����mџ��h�b��o��@�����9�KM�>΀9��\烅�<�A�7���NKp�Lqv8
���NKw����a��ή �܋�8Xz'l���j�'��f�Kt<�D�y
bJӏ�~�s�FN�L����-K%�'Lj�
-�-�6�(�s�C��2��˨g���|J}�փݖ�e9M`�w�r+/�!x�c�R��zT
�x#A���4=�i�
\�d�������\COcjZR��ޠ�o�c~��m�>���
�� ��B}
ݧż�� 	'*Kڱ8+$eM�tS���sHM�N2r�S�:٢ഞ�ho.
}bl���\�h��i�އ��Q��������ox$���/�tjH����i�(��n�TN�o�Q]ZΙ�s�#e���C��P�ϙ̶T��S�Xt7٨p�#��"D��I^�+\̨�i~�r��E`"��a?[$T	�)�h&�x'�Eб~�"߾��Z
vK��]�<%���IVN��ش� 9��_\��qȲ83�H�-�i�G%�U�u�e�kD�鼾�?
S�����̖�a/��e�b��i����Ɋ!��m��A
�ҭ`w��<㽽�bf*��Э�,��ł"k�Z�`�d��eM
-���Oy��Gjz]���),ۊ٘J����:z/�>OO]�ڋ�tSy��=
�K~�`Hx>�=E;0IuV
�
�W^���|�
-g���
-)ֽu+�ٯʼ�}��Ke�ײ�,�S?f�Գt�;1��4�"�ߝ�/&$��B�V�C�����ig�Ɗ��
/�3b�@{)ˉ�
���o����k����j�/���*��G
-�M�f��7/8�vQ���)��$�W�:�5�@�{���G
��a�7�1)�1U?Md,>}X�5IoPA}����u9����B{5�,�h��� �D�TC�k���s���1dW
ò������P��[��͖�5�q�YZ�L��@�C���&�Z�!��I��.1M�1�}۳�A�tl�kd
|4�+��Ƚ��;�
kq��
J†
t<�:� 7��b����󣱨A
�k�Dž��V�6�����d��eu�s�l�+���S��?��
�G|��9�V���.2*[
a�L�{�4F<��
6>*?^�c+�v���e6��6��
�d@!���W���
�ج,��B�3��:�lh�����C5W��@���k��
������%�ߦ��d���
�ek�ճ�3��qD�cdZ�R jςoD�
-S~��m�?�DqY�?F5�S.�%��R�X���}�{��D%)����@�,f|�
��Q�Ud���+K�
u��x��F���A�U>�����H��K2>���j�<o�Lۀ���
�EJ�z��s�F���!��w.<�蜻>�{�����'����=�[�+��v�o/
`�����k��D��g����.�r�\��A�J{�
9��x�=fA�=�M��_����vPs�&n6��f��=��A�_�V��tu*Xa1�4�s�^�GaG�w�i\j���*HKᩏ���}�p6��9
֊�no�R�n+j��gxo��.D
-v1EE��������67��3
��/6��Fi�vT
�|/������"qO��(Wv���
���~:��|/��$l����	#˅�u�Y$^g�r�
�դ�^Q��}��'�������]j���^���{�_���iD4m0��9�
Ţ�U�ȟ�P���~1�J�{�oە���|�ބ
�l���n��S���%�
-� Y��޺�t`�Y�q����������
-Z~���	0���ɘ�y.ه��J+�[.
���L���9���>o�	v�"���7�
:v�0�Б}CGi܅�ѭ:�h&�@tԛ�v-�i�1^������>�>M5�n�����1
-"2
���>q�r�;�
x3^��V)�u*-���V�a������!�-���ű�� s�\wv6�5�{���
�>!o���� ᴃ3�d�{w�!�ǻ,�
���<���k�u�z��w�ϔ�a�rQl� �z���7\
H�Y~<\��9�G��y82���j���#����W.�&�"���흖xc�lj��V"*�o}x���$�v܎=�b����W'A�7}�Boٍ�ɦI�"g�Q�=�,	" V�M�d�UA���&���dS1v=����-�E��
�x0��
�y���>M�����˹:�	?+N'�U��y�]�2�C?�
�Ƽ�G��
������Q�?�1dž��T�r�Έ'�s3&��-.&J��b:cb�o:�(�N�|s:7��<��q�
7iJtN��F�9"PPUn�n��ۏ�@m��a��:<�
--%2N��e�u�R2*��ݖ�`;�:�y�⺢��Ӓt��޲
ȃ/_�x:�`��ň�?�R��핕�&���D�\
���n�
|�_��A'�Yc�dީ�$�ի���KJ�0#aTu�No��ZP
Q�
ُ�I
�h�{�PeF�nOת�jEw\��n��N�
{��
-G
-�Rbk*�^>{�U  �6i�I���W��}���[��?���lA����+A�*�%L�
ږ�!�Z�����PIe��/Uݸ�t�a~tds���L?�/��kA#�zw^�b at f2�<��ˉ���m�y�!��C�Վċ���cZi�3��o�֩�܄~�
-ϷcQ:����y�������:aQ�z���P�
aP/S�
-
-a���ֵ-G���M��ԏ��8
a;2×\��}]�X�y��N
-���ڏ;Wφ#ځ�
-b
���-��#m
���S��~c;G�'q]����'c�	=�D��t	q��#���\�h�i������;%
-�F
�N��Z&�b��@�$�S�3
E�k���3���ó9���t�7I���cp�5�<�D�
l<:�?�
A�θ�b��ro�
F�1 �/�{<G��
����f'v
�a�g�2��O��S�,W	���C0[�ڠ�����֩y4�V[�Q��H���_Ec�
-��@��
�$S�x� �S�E&;A��,o�ڗ��5W(����ܹ)�j#����E����bßf�6�R�9n�ZE�,�8��K�Z�iڍ˯4��J_��>��yT��K+l��G�
�ۭg��b�\g��,�R���WPi��@�+�
�.�c�$}AF�&�ܬ�
�xh�A��|�.y�Li���=��*��Q ؞
-���g�B�P6��d�Qf~9*���7��O�{c0�C�5���|2:\Ҧ�1�F1kP��gkΩi
a�,�d�VL�'Wi`�r��#ד/uj9'A���hV����ҵ�O���.�ş���e�}fc�?���!�����F-�Up^���Ӕ�U��m�V�ISăڑ�i]
��[c,]�t��>*� o��<��0PW�g�
nl�ױp�����U��Γ��8l$,��
�<m�;���̉�'�e(+����9�c�����	��&��m�}|5��kI��sdQ�N�����ĜlS��!��ᵰT'}EG��
-c�*��8x�
O�L�n1���D9?�pB��P���4o�yR| n.����6lk����x?�0>zPR0�6�q��S��|eV��*u$"�2��1q������>�@�S��$��;�M��(���HE�T��9��}�/j}��%��G��ۡ1{>��7�S]�5-?;���hC�����T��^4wb���&M��O���xM�L��dc�&�����8ړ/L�*}���?B�+�ù���הCYţN�K�����m����w'�k��6$��j��8�<om
���%�8}Ӽ|;6F"ʼn��,
���=6e����"�
Դ��KjC���R�
�`�`v��3����ЋJ�|9�q`&r�n�/#��1�n
;�����<�I�}5[��
o��*۞�g5�����f 58C6��q*]�&��ǫ��ʤ-�����S賠�Η�H��N�-pAO�5�>��Iѻ��F���4�R_�b��L�c�Dh�8l\z��'����&��˳�T|���0�7���
%$ [...]
-��VG��ؙ�| ���
�F1y��}���%���!�ͨ��̆
�f���v����d������-a�Ԋ��-�4��_��_AŨ��2����UR�
#�
��_7wQU�1%p
�`��ʎ�3:��{l({q�#�!s�#�]�8�l "{� �
]���.G�� ��Eo�_I�t�m�&��9-�S�ף�z�ў`:0ܗA	�u[@_$k�09��PT X69�ҧku����<�G$.�S�
a�ȁ����Zޥ�g�u��1��-`������>�"��[
͘v2$V^�	��H�!D+u���>��4�r�O�O����g�)*��Y�b��흡�>���Zg���"J	z�gD�����eL���� ���j�& �B�.��KVm��a��
�~��oߣ��
��'��ҋm��#��N��'�����m'|3�t}gY1TC�a7D�XT`a0jb.��9+���|�RV��r���L6��&I)T�J��r�mV߰<d��[
·U>rP�7�Jq�*а�=�_�;>Z�O�:㋪���a�p ��/

>k
-endstream
-endobj
-3472 0 obj <<
-/Type /FontDescriptor
-/FontName /BFMNIZ+NimbusMonL-ReguObli
-/Flags 4
-/FontBBox [-61 -237 774 811]
-/Ascent 625
-/CapHeight 557
-/Descent -147
-/ItalicAngle -12
-/StemV 43
-/XHeight 426
-/CharSet (/a/b/c/colon/d/e/f/g/h/hyphen/i/l/m/n/o/p/period/plus/quoteright/r/s/t/u/underscore/v/w/x/y/z/zero)
-/FontFile 3471 0 R
->> endobj
-3473 0 obj <<
-/Length1 1625
-/Length2 12194
-/Length3 0
-/Length 13033     
-/Filter /FlateDecode
->>
-stream
-xڭxeT\m�%n�%	4��
�[ ��5�X�����	��www�!�7��Y��_3�G�u��zv�]��YMA"�� d
6���
��0� dAV���J�2
�`Kc��1����DA!b4p ��E

�< 5�1@h`a0sss#Q D�6�v S3 ���


�Y�� 
]���~�
dj
�|pZ�m��������@��`�D��5�d% ��* 	�5��� �hh	2Ȁ����@�	�`����J���쿼c	�
 �6@#��5���毋
`���ۿ?@� S;k��
8� k#KG���&��؁�#��}�`�`{{#;���=�����x:�8��mzw�&��`#ǿ%��{�y�:���@���
� c������{�w0;�?4
�A֦�ŀ
`45�3��ۿüc����	�?�7���t��6����� r�Z�|Abfy�i���d���wX��M� f�ٍ
m������A�g�杄�1���`
4Ab�;��P�����N����G����O����x�����w���5�z�-����� ����E���u��
-d������@5࿸���w����{C��M�Ea���/#�^
�4�9�L
,߻��]坉�%����?
0031��O�
dda�����r��1�ތ��*rt��n�'R�}
�]m����Z������GX�pg`f�0�2q���.7'����
��:7p�� ���fb��������ο��Y�������������������]�^���������.@#��Y�o�yrZ�Cn����VO3�@�MQ�r~�O%��;9d��L��g��	��fיC���o�;C]-�:��9��d4ݹ+���t;~��E()Gj�g�2k0�
L�;c
-����p�'ZY���h|Ȝr}��omP���j�p��� 0���(���n����;/`��	�2�)x
p�I�
\��k�^a�8���#�Z�
��*̞nxV��>�0y�,�	�iʫ N	<���X��4��*4����h�6���D������Y�vL<�?;R at u�gq+x
-��J���i��ʡo���q�w�T��I8��
�⦢��7cŠ�£L������t�Ŝc�Epa���[�Q����C���f�ۄ&�eq����I�'�g%r�'#�;���91+S�Jߢ�#@��O�?)�3wh���ӎ�J���C������6�O�
�y��0w�N�V��~(k5�j�+�R֨q�j��ڍ�����"�O�%�a�����͍*Ӱ��_p���E�W
JݱV���,����@�H{�3�]���,k��ݕO:mﳆ4�&���X���c@����ښ��Q�^g��:�IOXb�[��lm�[I.|�1��*�V=����I�)��~M59��U� ������- at .�T��Me[��K^Nf�b���n٥�9�C��Ū��bN9c��ѵ�2��sjʺ�m�%x���+m����} �����2�ȟ�����69����\�
����8w�χ�	W��}%9��WҤ!���)F��`:�܋����
f�g�����%�,1���1�v5v�-"%�1�6 [...]

F�`��L��}
��Wg��^IP���m�L`�W@��Z;�"d~�4��S�iO�!���Q�o��1��SS���h��.C�'U�b1�eVȩٱq�m&���J�gW�x;yf���[
��%ֵ�w�j�G�����`d�8#�	�_7�}�#o�/��
�p���Yk��H�'O��J=�����Ȗ����U�v{��������UX��G��$+��R��禔���WWR����a\����pP���m
3a�;�-�f��'�R��H��`��N��S��u��%�˻u?vX�T����2�,О�}_�pr
-%�V�e�[,�q]�9n=pBN
�"� �<[�C����F�/�y�(�p�U����S-7����W�v�|'�H��h�r�D
��X;il at k�
�������H"�Z^�9pD[�xPj~��Y#�)�"��FT��C:l/�

�uؚ�Z���/?kY)?,�Fa��Һ?�!�tP(�:F�ٰbu?U#��-Z���7ѨBǾ519��ya�;����&Õ����c�0��Z[��>n�
"!ڰ+'7�8��
��>��B��	��+�`��F{!>l��2r�6�E
-�S�� .�E�
&4	+�>j6��F$QA�9-����:?���xˡ!�b+�Yql�Dq�dr3�"���,#X�~N	E:��r0	�v�f!�pH]�������A��������7�<ݷ�d�/!�D�o�j>Vq}�Õ-���irʌk��4��=��Uϛ�
{��X����U�kAJ��st]�,�Z����s��B2�ON���
ԥ��F���ѭoeR(A��0 ���}7���a��
�
-���R���lT�Nx�W�-�\��ݡܬ�J�b�t�
�d|N$���oF��E�
�IQ$Lihh~�M�hz���-�w�"��]F��1f�,q�#��j�A(�Uyŵ� �8�%b����/e�.�w
������n�yztE�m�&AFJJ��y����5���}
��r�4�
�+�Y�a�S��:�
�cJ��5�E�ĢQ�
�6��N|5�~_���
^���
��gV:TL�����b|���_���
}~���/8�y(2�@�n��_As}ldhjG*�L�Ċ��CAT��F��t^�>�B�`����5��2/
4<����>h�m�ˣy����D�1u���W΄_���?��v�d���&N0�� �����\�vgBE��۪-zC3�X�k�Luk�kJ\�����
-�����u<wx��rw���/��X�1Q�X��=�VB=4�:۶LS!0
42bi"��N
M!�`������x+:¶���U&
-jz�q���
5,^{��3�(��Ž
��iS-z�I>4�[M���#^�-Yœ�}���A��|J at u����30R�ŝj;Z�~^%
�|��4��W�~"6�a��rkL?�o~'�k��L��zI�l�F�%�A=�7���R�dd����TlF����r��-\������;��g���S�
�r_&
r�ڮ/6�P�
<$�'>�
��t�����p	�>5�x��ɳ ~�R8Ⱦ���!9��EZ~� #�x��~�|#ua!!s!j�@J���5m��u���q#%�\���#�jʀ��!��_?�ڍ�zs��9�JhW���T�
����k0:q)œ���c��&5�m2v�"f����pBU[NV|V6�
-T
�8"��E�
�<S�������+���F�W�h
���?Jz�-:V�m���I
�+|RL5kK���>{��/bV
����G
�X����=��t�M���;�6�>�5�
%^��et���V��6���"�Y���t�lB�'!�\�M�K�j�G��=q��Z�t��
N�%!�.���7
`����r~ypi�o.�l"M��9q���LK@�s�*�'6��
-��!A�|H4��B1mu���fɊ��j�6����W*�C��mܰ��w5AZs ��&ă��U�
���ׁ��B�-1
�9.�GA�&���q�z�@�T��
%��@һ!�|�+,j@ӧ�i��
j#�~�%6�<J�
"�� �f�[���S}��4y�Q�� m�d�����#z�� �nu��QM�L3f«��
��f�� ��w|���]�7�E�lqc*�wxȴQ�K��
�4��`_�f��Ah�K�n�
$�g.��n�G�d!
�6�
��]�
Sb���K|Ԡ�~�o1�-XFD{vv[7�H1B��/"|+~����I|)�;���3[���eԵ�{�
�����%ɇ��!>
�1p�q�m��ݠ��E�N}�n��n��W�R��]���ih�
d��˶�
�vT�r��K5e}jT��w��x8J��f��6۰�~qп,�
R���}/dy>9���
�ɢ��ln�D$���Ņ�s���,g<@��ަ|�� F��f�1K���TOE�QݤS��D��h{�
�뼙21�84\/�s
|��hASu�](��|���	MA��K�&ʼ]�\>�U��Dʧ����g
m�h�fA�>J�4&�<�KU;cy��8�՛ѕo9���P%B�E�:�q�&��{,�;�+�� �6)���4x ��\U�,��l�X �r�PT�&2�Zg��3�lN$���H����Nz�u��U0��p�٧�V�&�v�>�2r�қ;��$�q.������M��ӆ����m��]��x�xS��� [...]
��p���#D�1=0PBһ�!@�m��zV����׬ -����F�B;��f�Y�� ��:�A[�2=���las�-�Y_��h/i�A$˰Ӄ�4�)
��mU�ĞX?���i�vq~��$�u�
-�K�)z�����p�yA�8`4�[�>z�����㟩0ΒW
�+��&�M��֖_�y�̚$��������*�?�V (��V��!��⤠�b
��?�	| ��s���	�Y�(//���ttc�(;d�N���>-%$b�I�����S�uc�ϯ/a��
R��_)��_�:��)$�����I�o/�i���]{�Ȁ�����
-�A��T��+.�
���
�Y��$�1Y�躨���V��J�װ/\ML2�j�4���Z\�ϬV�9�c�  \Q}���^�>v1���f9���"8�3
Z'}d˅��*Ɠ����i$i�>�U
�����U�F\�3����1�>�	^O�
y[�$2ܐ33�)(|�ͤ8���Ȇ�s�`|��G��O����������yo�������D�s=S���7J�4��l����i�(�
�w
�Ϟ�"��
e�?����
-�d��S�k
Ҽ �N��AYh�~Ip�SD��Ǩ\j��zĒ��
&0��f�x'-�1�
w����E��p`������_\,�?T�ʍ���k����d�	ȷb�'2�Yp
� "j�94"S�%��_<7�(M��] C�(�������Zߓr��p
n���.e�0�f������������t���6X��Ҏi���7
��VG'�^��`
-�,��^���REw1�4��`fS�jo'a�����]����6��?R�j0h�
-z�A݋+4
-Yԉ~�񺦯�� �"ڠ��D]�*L��s�ww�K �?%�ꯗ��d��5�������Ώo[]��E�����2 .`��$c�>�����8�A����FIUp�h��h߉6D��:,��3AO|v
�n_7ߑ<J;һW�q��x� �q#ۦ��$f�2eT���NW�O�r�W�I� lvc������
��s�9R��F����ުS��w��r�$��pv
�	�����u/�M����@�!���'���:v_�d���7n�2
���2I,KJ��4
9
-
JQ�]Be�;���a����	��H���
sȥ���da�bUnU�E��R0���Z�����X*�#����,d��[��t�K�m�N�	���2�^b
-�(K�NH�ߞ�%X(�=�����՞�3p�0���)	 �w�؄�B�zV_[U��#e-��\q7��
-`���]��ʘ��������Q�
�� �$P�2md�oU=�͋P}�UYyy�'	Ή#�U�/-��>3�.�����n�F
��Oy��w轙�׼�)Nz%Ύ
�DCyM�]ߎ<��0˿��H���pz~L���
�TɸE� b�Q���������k������a��+�0U^��;嘥�)�wd�thⱗJg/G�_8�9b*�*��A�^����Ȇof
-��9n�0a�@�mu`
5TO����j Rhb���i�"�n�d�2)�'ea��8JS�c���-|�G�O�Zv��	��Hk�v�ߛX�`Uʔ1V�G��
e
�G?=\�HkE'���;Ae.���0��3$�
�
��!�����&��67`{R�mӹb��|UhTJ���
�-��j����y7�#cyB���c`z7�44}
�k�G�S	FA��Rp�e7ܯ
��ʒ��˼���9
+B�4
yc�g�e��m��E^�
8��.�f���
-�p��*V�
/�*d��\\��h9�G��~̌�*
 >�L�
(�,e� 9����ғя���{���jj5vC��Y������u��|rdk�
�h��
-�L��LRm,m%��UJ����=u�:g[���[�/d
=�8�z�HRv�
�6��~=Z�O̹�L�
-=�XL��j\kN!�]g������c.�/�C��F�&/O�Y�}5*��"V�T���*��	��u �',��
{�[�����h9��\/��I
�=e .�4�4��������0��@V���H�n(?��3Z[�
���z6u��5y
-ƛаٜG�X<L=}�7�m�Dwp ڗ��8��'3��'����_�)�
-��gyY�
�꾥��� =�P�%Mo8��)��a3z��Z�L}%`����M���W�Gʽ����~օ*חk
@n
V�-�Y�P'�P^�%�j��p~]�?�]<�� N�r��i�7�ϥ
����mʨ�j����n�>5	vs��U�b8�N��a�[X���=E��ы��S��B����&QK�
K4ȶJ
�ϥ���K"Yߛ����Җޣ�$?�ge�j��d��U�Fr�6i7u
-�?Fw�\鳬i?.	OS-):Hj
�U��KI�O��
�(�-���{��wBw�
�
��b
(8,�)��ړ�v�������[���t��B����l
�Zj����[=X�_7���8t��\7/��"�J�%%�D�O|iD��4k at R�u�$#�/�G��o��c����>�G䖚�(�1q���d�:�R�{�PP�>S�):�1U�(9�"0���Z��v�Q(�e�wi�g�!�6�%e�ח
���j�����J8S��
���9#��\�	ʬ�(��n{���my�*������h���(����[kX3�D��QK%:�a���)wK�H��
�ί�
���F�ߴWO��%O��4�N_�n�Z�!'k�:�U�
���8.x������Q�zB�>X��k�
��V�6�G;E��!V��͉�
Y���oA$��]?U	X�1#���
ϏX}�^�4w�
��
e��!�U�����F�d���?���*��9�iQl�k.������p�i~r&�^{6�P����
-�H�@���n��y�jp*�`uU6K6&�&_�0t�>��й݇$
	HLD/����3�����g�LjI�c1&M.�������]�[[
��?�(�%��:�|��H�<��bZ�����P��C9Ho��Jט����=~��[`�ZM
/��u�5D���Q��<��QTA}3��Lr[���I���$���7=�ń3�k���'	BE��A����g��"���T����@�����4�E'�)9��霄67��$�������6SA:��t��E�ق�K9�+j�H���IL<�@Uق����Ž�¯܇�r�.�P&!�+����*�M�M��
O��-?��
'zRc"�R��X�0Ț�I�n��K� �Q�֐�v)#��GC�����bc���w�}�i?��B>��6�Z)n�-L�i�Ri�w�)qK�$8e�; ��yG���Г����,��~9����$�q/�1��7�?��
W�Bm�>�.�x�q�1_��Ȓ�F����T��x$����
܄c��F��[�bֵ��1��Ǧ����N`d�Q*���x&�K~��QX6ҋy�=}h��8M��کis�``�)!A/�q!gg���t�BӶ>V
O���S����b#��w?���f[c4����.N�v�D���i��<R�^DJ��O@a�W�}����R�����P�����QQ��Б�B�3w�D
-�=J��,�{���;'\����y��'zH"L�F�,��,
-����E�p�%��]����%�
�~C|�vذ�Mz�:|6�O����Ϻz���m{��N�B�es���$�
N(�N1�{FW���4�� �DF��r�$�F��숿���\�q����+%�
-i��A
-
$=�-�2iA��i��S��|c^�K
Mz���b[�IPEGWJ��3rkQ�aS��F�
�\���5N+҄��e(�|��"J]��p%J�
�w|���^t���*�<�
�פ;G��K�*돁�[�pn� �o��8���
-~�-�����
X{2��uT�l%�";�<
~
��wm��?�5��_w5�����2��$��i�U.U�uI�ꙗs�$����ƒ�jǢ���\3��fO�p�Tx2:�,��t������}�=ֻ�6%�0���nHF��s��w���~_Q;my�kww����s�٤��!���a��GQuc�����D���
�����2܃
�U��G�69^�}X"�@�gR
-�z�
����")�3��e�R
���)E
$���
-.�%6����i���4R|����KY��E��Gf،,��v+ἒ�t~+�9<�a[��P.��u�\����P�y%0�4�2�8�����

h��P
%`l��1��֌�ZZ-��1""@����~?��^a:�N��E��C.���d�Ąk[��[X�Ԅ�
���V�,��M���H�K�`�0�Ѫ��e?f��o

u���e��յR�,�
i�N�PՐ<��'���U<�
�xD��O��lH$uJn�,�g����!Ȣdq�/����"7��4ۑ��rU5E�<�
-\˼�A�n���������C�V�C�N܌�yv�<�/���oU��
--臹����k���>��V���b@���*ݞ�8�X���׹� �qJ	i&�v�15�P�MIf:dAE�O]�5�Jq��&�^
��F�A}��Df߭�,?X�5�>R =�H��*�*�˙Re���X6&�_]T��ie��J��n�z at jM㇟�K�AJ���t%�
�Y>��`I�����D4�dH
-=yyS��E��v��ǃ��;e'a3�y���\�*�a�.���U�7_��ɣ��`�C\�J����<��
hj"wʓ��X������R�@#[�
��f
�b�ं}`9g+�v�
n��[��$��:Bp����;A2��5�<�#�*q������e�)v�
-bx�Yd�$��J�ݧ�9�-��!f��BsN=Ȣ[����P���$�':�?�����0�
Y�	%��915s���}�u�|,�|�yHΉ��}�N���Y�m	9��׀P&�Ӏ���ʥ{���˖��1�[*�P� BA�{�!s�D
�kɕW�ޢ���'UNq
-�E��p
=�������3!�z4�>�^�

G���M'�
���_QY�
��bg���66že���h�2R�
[�V����Ybfv���%��G�`,��L�AА\p��ˌ|��r`���D��?4����uIk�3BJ
7ck
���S���re �U)	�`�D���ީD����e����g�{B>�ͳ�8YLx��+�Az�§���̍��\^����)�����.�p��t��n��h2t���pCsC�z;�,�	�C�g�s�I3���,�n�
ux�h�ؤ�D��B�
���Ͻ��[ւ�����&E62���ْ^���
-�R�b%h)uƴ ��%E��5�����t����_�_����&s�슀i��5[�ġ��I8�
߲�`�8%|����ݧWӴ�YqD�O����M�(�h�<��e�y�-�sѤ�f�g��r�����ʧ2h�L�^T��cr�Z�Cˌ�\��/����h`9�+M?

���}�
�N�B6���#�2o
����*;�D�,�����d�.y�4�og~�fB˾�
F
c℉�m/
�1�
E�Q?�- �B�.��~�['s&q{M�%0��oYd�
���Z��ms�3/WS���	T�ך�3ʒ�s{�Yv/���3@��A\�+y�L�;QW��J�:��:��t�S�$�Z�q�;?m��m�=fҒ��ł
-�P�м���X.��Ԫ�dq@
cz�?w����ZFc����Ӭ��Q��g�� �!�~��K6�'�$�������HNQ�V�ׅ�*j+�c7�
�#u�����"�I�M̃�D�ZEXCq���
$d�X����E�
?�k
-��%A{�@�
-f[*���	�z2�i�	��I-�g
deD:��:���<��R������M"Ʌ����A��@8�q�/��@.\�T*q��U'h���|�A��ְ��9b�	~��B�7���돰�ma��yE�����r��ɽ1�
R�,��C�b��#��
-Xe�H#������R�@6�~k]x"���}��։9�M�#M3���E,�?�q7�5h^�r�>�>.���SR�)�Lum��-�q�?���]�&j��E%�
��?�Cƛv�
��
-��u^i�:q�����K>�1
}�X3�+�� �p}��%��W�
'
�Y�j�tY�������P�<�����f�l~k[�"q���鴠�����_
-�3��C��L�B���v|f�	��&d*K��e��R|�
-��h�:(Щ��o^�ک+�8RR��G�N���_�!81�7�~�����_2
Y����w�y}�6
��}�
�݄< &
oK����{��Z�|]p��8��ࣲ��� �Zv��P��
-
-Q�O�Py��ں�p�%AEwЙ�C�`��e�	���9
-�&����Ds�R��6��"��J~��Y�h��++�X�,��A�	:������s~��@h��L�9�_1	%W�&���RyӸa��U
���I�Xf�;�s��C��EJ�]=���$&.{W�mZ�՛�!��t�lҾex���qq^k������R���,��V%��X
-t�Ĵ�Pn��v�9lamp~��:�����:q$�p *y$�� ̟�ȡ
�
�O�
t%����+ϊ�հ݁N�c_�譵Ѭ
-�%�0l��8�
t����
h���'�p�
�Ѻs�W8(�a�oFI
�:;9H�B�˿QJ4�y��qW#��3b�$w�Obt����8?�&n�����u�A\���2��
M�#m�M�3����ɵ�2��-����
�e=�`-���T-U�7ڻ=��"�]���)���_F>_��=i�#A��?-W�
i}���
<���j���e���L /�d��b�j��S����+���R}̋$�z��谚¦
Z��/Ē�L#�u� �d[��L��i��ns��Q�z
�o�\$u�!��&�\�y_ )TQ�"Ꝏ���g���)��r��)��.��Z��~s�*j�b~C�ī�X�/�Bb��o�j��O �$!=�q"��丳z�ђ�[�x��
��غ���\�pS�et]�@�-/���H��%�G��VDY��X.LBd��
��+A�
ڸ��C8Dk�Oա�/�&��4cD2䩲6
�����r�Eƴ%
�&/~@/��ڢn� [...]
-BX·�w���)�uZ��F3O3w��w���hB�.�+h�F0̀u|������$=�<�vH
�=v�!
.SUJmΊ��Ԫ>
���6��
�V?g�j�נ�Q�N����։�͓�
�x���
�D'�0y���
/�pyU?���:��d�0�pq���P�;��s�����
��zq��2�i9>M�upT��WC7���;����S
-{���s��c�CYs�KM���i�	?�T�����~�t*�ɨ�A~�m�bv\���)G�.��+Jq����(iYV�-�[��!�ۇ�
|KѼ/�&
-���D��y;{~��t߷i�ҿ0��©>��J�LF7FB�Ky`
>T�u��'��8�=*d���]=���>'�&�c:d����FԎ��D���U �� �B.N.o�)�Pڛ��9�(*�����Y�ga}�$��X����6��J����IV�� �<n%���
�D.�(|'�s���cm����4�,?}9��e?�\�)��qqP��GM��
�A�0���v��
-�qE��J�:���A�bfZk֣罩4q��WP�
w��ڳ�a	���!��ǡ^���(2[�����\�7�x
2f�'���U���9ҷϢޥ'���R
Mͺ7�_��bNV�
�
���i��FR2G<�T�Axw�ioE��+}�����.��o��}�_W4�;�xӈ.��aW��!	G�O��o�>�7�Z �4��
Yy�.�;�$ˣ�P5��l�%�7���2V��C�x��J:�Ѻ e�gZv뉐?$�'S�V���J���<��Q�`hc���߂����j
����Q�����֖
R^E���80k'S�I�PC,H� #��]+��k�E�zU�vm��c꨻7
㋧�j�֏�{o��cM�gMi�J���@
F#Yh���,�n
'O�
 z�iL��.=�O�����I�B���g�|�ը}�]T\G�{?�}�a
57ހc���Fu5�Zp��gg#v�W:Mbd�d����ҎZ�	
�rЇg���
�#��ͩ,R�!�H(eA$�H
��l�ɠ
-endstream
-endobj
-3474 0 obj <<
-/Type /FontDescriptor
-/FontName /GXYNUO+NimbusSanL-BoldCond
-/Flags 4
-/FontBBox [-139 -307 822 975]
-/Ascent 722
-/CapHeight 722
-/Descent -217
-/ItalicAngle 0
-/StemV 114
-/XHeight 532
-/CharSet (/A/B/C/D/E/F/G/H/I/L/M/N/O/P/R/S/T/U/V/W/Y/a/b/c/colon/comma/d/e/eight/f/fi/five/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/period/q/quotedblright/quoteright/r/s/seven/six/t/three/two/u/v/w/x/y/z/zero)
-/FontFile 3473 0 R
->> endobj
-3475 0 obj <<
-/Length1 1641
-/Length2 7390
-/Length3 0
-/Length 8232      
-/Filter /FlateDecode
->>
-stream
-xڭveX�k�.�V�	E�;��k��!
N��E�Kqww
-�-Z�E
���C����}��ϟ����>s��3���N�L���%c�d	Qprt�r�4���p]���s'�������x���e]! 7���
�
"0�X� `  (**��
�ur�v��غ�^��spp�m������	��8X
< 0'g���#��8P��B �P ��e���`S�xP�8B\��r��A� 5(�����\�� �c��߭���d�  �
C� ^`��o��
qu���� (
`�
-rt{�7' �
s��]�����OAήN�
��#���
v�:�
�j�)�U��-��wn8�8Y?zZ9����{�yD�@PG8�
���;�%`�;�@ޏ�ɜ]��p�C
m����
-��Z� p�#�#�����O��
��
�������5@���57��1'��1�
�����(;Z;��٭ܝ��y@\�\��a,d���XA��x4��
S��g*s��D�H��?"��N�j�_^�����OjwL��8 -�㦁� �w
����]���ʁ���`���߄��� �WɿY���E-�h�
�(��_V(\��҂��m� �����x��u�<���b\@^�`z�P���o�� �V�,�Q�?��(����p����o��yp��v� �o*u'�~s=����
-���DE �@~���������:���0����
�����d�yG�����u9Z=�ܿ
�a�������c��:��~�
��2��K�Hw�%�
�3��"�:�4��V;}H�X����	�n
���=��|���t{����!r�G���ޓ�d��0��k
����h���5��B�����:f�wh4���]1�/�=���.������oI:k
�Xw//X�G�>���lQqd��d��'��'�y[��5���x��^żn'��༮��k>�[)m%-��}�ߥRe��y����	L�.��CI���R��
-�S��>�TW!g��L�<��\�ʯ�1a^�4Zpn�M`e��L���*����sg$��(�6OԒ�M���j�6�@���l٠TN�3��W/uUt��2�6>��@�2������K����Х
�OXV��s���6֢�|���
fl�
�`�&���e��d+�*�皞��4,V�t�W����aΑ/�����e�A���|���jozj&ު^��
J<~�'Y���3���녎���n������,�jTY*BGg]D�]�'h1�*��Q"3���]�H��Ŝ��)q�e�
Y\�-�2K��d
�u�F�V맫���u����H�Ϣ8���6����~� ��8)~^`J���nD��J�Z����z
�ܭM}
�4�Qe���R̚S�����ҩ]��">{������a��
߬��UGM���!��P��Pޟ�F�!3u�
�7��� YJ�H�z\
�X-YLǦ%��
���
�
t,7Gڹ�y~
JL�$�Lz����
���v�]��
A{��Y�e��=G{p�&��uٟ�\*<����&7��|�@��Z�7���R�ܟ����m��زB�o�"�|x�Ӂ'3�s��/��pf}O���`�
-�)��f�%
�طk
�W?�T�`�)v i�(��ύ1f�S9H{���t�_�E&fȽ�x��ZM;~��4��Z+}É���
�"g�Q��P5�V
dȒK�3����C�z�H(4ޝmP�J �)�jzƳ[�S���ݴȅ�&�=X��͎�Mҹp@<2Y\��\��fw	9F�e�@�X7��99E��c˱��;��-e��$mehD�-�=c�&�
Ɩ���(�ŝ!�m��o����Vs�-}��
g�
-2"�}���C1�=ςG��}�
�g��љY����X
�^�1GEN��5��!6�d�d����y�=c��^��lf�D�X��*Ztv����<�B�⽠'�5g��wS
-+
)tϐ��>ao6�*
-�)<E�M��Z��Q`;jd�/��Ȋ4��N�'Gƃ4
�)[�dn�;�T;	��_v\��'ُ�
~H�z/���ޛYzdu*�<�
-P�(6�<Ύ�
���k
P�᣾��-�v��]�T1g͢#�Z
s�(v}>�1�+�q��p k:+�{�^C׼^�dV
-7������-���
H��^�Зy���Ss�g}툊�I�<5��q�4�H��
�	�7�b|9�)�-|���>I��q����W��^[;S?�/��Ψ�*"N��7-Y��VĈ�z	�]t�*E�yE�g
ѝ�f��p��Q�=��fӹ�[Ɔ�яZd $ f�����Ol/f'5�q���	��|��O�L*�E7N�y�@)���Iv v�
n�u'z
Q��%�[�?���8�5�F����zO���hH��6����݊�|����y(�[b�q���ke��ko��8�#N�
�GM��0
Ѡ?'�`�)�[�i���؊x
-�.K��C����Lz1��7�É\���B
ƒ	f8M�)-�_��T�!ƒ~ǁ.m']o
C��ѥM�ɬ%��<�@��mW� iߔ��H�o��s�=�>
�<�A���9)��ͮ�b@�Ea���LI�.r��p�� �
|����7��B��F�
-��=|���&`����R�H�M!���{
�o�[{��O�L��YkY���B�l"����6..�9&]���t'�
���Q
���)o�lł���f�M3
��J#���
����$︞���Im�)Y��gI]@R��ZԈ
IU܌�b��~b�����S���i�J8�/|�ĵ�/q��8��{�c%v���9;K� 
�&a��d:�@a$؇w�tb�Z�}���D�?�]�}�y����u/&�>
�0�b
-'��$
�٢^�m^���*�����]�:�pS[
-��H=��#��Z�������\<�fݦ���.)�\�a�5Ij����:k9gK�㱞�����&���w(�d�
�N��*��
Ql�Gҥ�H��61��?4�x�tRة �Y��%��m
����Rq�}x ���9]�bl]Ͼ��
�����c������7����Ε��A�F�7�@^�cڗ���v(9�
Zn�9��l�,Ң,B'ڣW�-W�}v��
qR��y��)�%���_�Up1љ�, ��c��l9���!�M��7���|��E튵^�D��r���eύ���L-J�_�Q8���"�)?�i̷��'��NHM9��γ
�G�a���_>�S����!z��3P
)B]-��#��3jd���.�a�4�,�x=�7�c��2u)�� �� �X,?N�=��~؎i0��\}2�	l�&��*��D>"�Vx?d�3��9��>��v�����ۖ�$��c�3;D��Qe���������v�u~�a��)T?T>��X^�D�Ω���.:L�ڔ�J&�ؽ���
��d�ۖ�S�[�����6�ma��}mI��LC�

s�~XC��ghl3$�Rf�0�䜸"I[T��.�3i��Aec��Ut�G0ZV� ��䫾c�(�+�*�X
[�g��H�A�&f��J:RN\�s�9��D�U�K�r1�Qlak�<.�9
F�AU�8F:I���12 i@��	�N!�"�G�������y+�HE�˜���3W��78׻�A	�>*8��S�,�aeJ�'�m�i����rx�
f�OG���hJ��%$'�€�7Q�w
s��/���ˣ�(��|�+�6z��3"x�
�4����$M�6\+�A�/~V�\����{���5�c�;�B] [...]
-d�WOhz��D�
*3G'�QF^���
�'���f7{�NJkh�V�~#q]�T�A�Mu�UJ��^����_
-c�'E
-k��"�
�=��Z�2��J�k�3�����錅�
�Yr��<�FVCy�^�CW1�ufq����DB�^�
m�Py��Z��	�,�K�9ؽ>��:`5(Z��L��
�Th�5�'ĀQ�`�a�&6v�ﷆ��Ė��K�}��O�(����d��K�-y�L�3(�i@�}[�V����#���o]1��u�
�* �"nz�|�O""$���<�ۉ�r^-�N-a��0��b�0y�n�gU
-��8
-�j��^��;�?@)�dV{f%1:t�xU�QbW��>���ߜ
�عʜ.{�� X�0�A����U��
-;�ʤ�+�m� �����|�"�9���Rj�R6]YuX�O�������K�
Q"����
lG�I����z�{�r���!X\-��]CÓ��}&Œ“,N"��r�-�K(�@9�ˌ�=��NT��~�EZ�
-�}�0f��>�C
?׫]�h�T�ȳh
�5�޳)~�����Ƌn^>aZ
���jͷ���E_��Q%�
-�Q���N��i"2<*�5�Z
-_���
-�#�F�|)����,�����K�
Ze��@�-���B��|�ے̍�Bo���ϱ<���W0͎
-�
Ǫ�
5eZX�M�h�x�ZFh�+S}�Gu��B͎�n�w��֛���?�ج�w+��b	
@�H*Ӥ�����n��B�F��Ǽ��"*����i&ω8G������"|�o�>�#��`�	�|��fcY����`
��L
�Q\�ϼ�b��+�)R�Z��"i�&ߙ���Y�3b
-
�

<ܽ}�{Er�N��-g����ŝ���
�T��-DО�������l	����2�A�v3���@�Օe���J�L�N���ZPl
-�01�*�����^�0$}�K�
�637�kTa{����uf�}�5q�G|"���E���^'��}xTRL�OrH,̇${����i�	����
�� 鑨�:$�6�R[�i�|(�U{�.�uJ�+S�۾@���ՠ�D�l��J��d���)U�4�!�����f�K�"�7�߱nCG5�ޗ�������a��(��JRN���g,"6H��R�ʘi��@�d�tq����}��Ԙ1��x��<=��[@21���b�X j��U
-���� 3a��3C�<Z��D�3��LM��`nƗ~��8�����Ms
Ӌ��m$ϖn��~��5�����E%��
G�V|l
J=�n?�����UP+��g�O~�O��
g)H���7�}B,V�QK��!��~]m�M)f�U�s-#���O#�e�ӗ�x�1=EǠ%��9=;+�mų�&O�sn<4�Ն7w�E�
�k]b�-���1l�(�\�1���gO�6YLo�U
3�<l];�Ƅ3ٚ.�i
6}B)��n�z�fM���M���2���H1)C�;�p�b�E�
8����>��L��	ѡ��*����e��\9���ގ���c�iv��H�A��������%�z�OW�w2�a>S�3�p��}/��8i�XoZB{z
��M�z�
'K�2��T�B'`��Sk �X+6���e�~%
��֋�r�^6�HK�L�o��
-hSya�4&#Q�a�Q��P4b��c*k�U%Mb��4�|�q�7:�#8��껬�ɝ��
`k`�
| r���7J��9�Ƃ�SH�
���mS�L`Q��"HT�\�
-���۽���KN��I�O"�	�G���!�T8k+,�/b�0AٰD
�E6�����P>��X�i�O�:$���w��� �~���5�b�;��^�Ѡ!3Գx�8^6a��=;c�v�
�9��gߗ��/݉+y�YA������c�N�I�(^���Uջ
L���
Z�
���l|]�
wT�oc�5��b;�2;��g:�L�Q����yE�_%�ہ�\��saw�e���y5U�c$,r���X���H�7���ڈf|�ⶂ��}�qӃ�����e�w��~�&�E�e��q�����s��v�n\�V����M���<�丈�y��U�[H�����C��OS�vm���?z�\��
-�kdA^'Vw�Ȋ�o׬P��-��g6�%Y�
�љ
G���߹A
��Q����*G?vqR�
f�~���β�s���u��ҧM?u���0+/�
�e��y�����/�B'��
�]=�թ|5��0}a�"[�j�yF38�#
.wY7A?
��D��&}z��8��(�C<��
KdZn2��
���]�������� ��rW���$�Ǔ��]�@tK��LW�)��J&#*�ʗ9-(X>�6�$�b:��s��π�/[�u�/�N�
-�Zx`w�#�}Ĺ�"��y]-�\$Ψ
	{�M�օ�r@)��
��,���iv!�~����,\��y[,�wY�T�H��-F�u�}�f�ϗ��LH��y��8cQ��:����9v��Suk���
-
J�H(|�\N�d 	z�E�^�:����m�T$���
�u�:��w�
�@�U��~�"7""2/^���"&��tV򃑨"��:������A�������w�k�(8���������@.�AQDz�-mT���*�!E�ď���2oU�8�<��
-}{���86T�ʆ��t�͛_V1��f�'ճ
�>���
�����{6tb��S�.�Uw	��T�$<�nv��
u`����7V�l%�[�ʣ�װ���Y�����a-vfHS ���K���J����X��N���'� �Ϡ*��N�y ��ذ�7
�U �&h^�+�dc� �.�y�|� 3|>`4��N��=OŊ7��88G�r�o(�kU��Y)
,w�0����x[�l�.���Jf�;�;�o��ަ�é��,Uk��\�s�����ϊ/S+~�/���Y�7�)�;����y/����_ߒ�
�M��(>kޤ�yH.Ǩ���ٗ�|��
���wτ�%�1���d�����Y���?u�@�7�,���*7a�
D��ϰG���#���Bz�u�|c~��F�e}1	;�����P�_e��_-�
�~8)��ni�
H1��}�I��&�#�^P磌�E�k^��%2���6w^P8\F���a�ޒ�?yX YZ{�^uh&m�q\@0���"G-DN�Ԟ[������Н�"&<9����6],=
��^�it� [...]
-�yh���$�X����~3`9��q"4
��s�ïE��;C�
�Dݢ�϶����ld

E�N���Y���ݳ8������l2-ǵ�f�'��9G �ʕ�
�,�,
��'Ÿ[��ת���ѧ9�B�
'��@	��l<@
�Ť_��<H�j�%`'ʵ15���;^���߹���X����54Ͼ��yx�I�lŤ����	��x�����t��
f��b�����,��h
-�[>�H�RO�8T�P�d<"�st��9�{�2�uL��ԉ
G5^�L�:QE�!��V@B�^���O[�k��iv!�/eJ�ҟ�-�
�r�#$���W���N>_~-d��Xa����_t�z]l�����
-�}�D�����P�l��f�,�Ks�מ
e�K�@������9�7^RB4��QQ^�,b�ʚC�
Gs`�Q��-��A�b�rY����MV_��Ş:�l�7��<=�h8�g�1w�B|�ݏ��}qN�"r.�g���
�:�d;�v$��GBy8�>}���mv����4�8�e���I at z{�6��)��c���7��Veܒ�Q��?*��
��e����[>���u[Y�H
p^��E�
-�@h)�~�Tn�	�fZ�%��
-�h�&�\~�]$^�B����E�gB{����O�DW�ܘT������)�E�cB#zz ��Z�l3��k����Ǜ��\�Rū;�r܅�'�o
-j����rEƺ���0g?
��\B��2{۰�m��C��BzE�E�'�o���W�M.�9֬�=W���h�U
��~*�
���o���+J`w���
�T,P�"�A}9WE���Tv��<%��L˹P�N��X�gD=N��:AF�����֙�N�\_W5%��5E����D��
-endstream
-endobj
-3476 0 obj <<
-/Type /FontDescriptor
-/FontName /WGKKCA+NimbusSanL-BoldCondItal
-/Flags 4
-/FontBBox [-143 -298 913 989]
-/Ascent 722
-/CapHeight 722
-/Descent -217
-/ItalicAngle -9
-/StemV 120
-/XHeight 532
-/CharSet (/a/b/bracketleft/bracketright/c/comma/d/e/f/fi/g/h/i/l/m/n/o/p/r/s/t/u/v/w/x/y/z)
-/FontFile 3475 0 R
->> endobj
-3477 0 obj <<
-/Length1 1166
-/Length2 6307
-/Length3 0
-/Length 7078      
-/Filter /FlateDecode
->>
-stream
-x�uWw8�۾�	B�u��轓轷`
&�0F'Ѣ�(5��m�ޣ�ޣ%D'����w�}�>�>�Ƿ����_y׻��Ƨ�
�V0K�s�#���$P�:X��h[8�phAl\� �.#�a�����C,P����ױu�Z�<  7H$$��}����� 4�P�@������

�� qDh�:9�C!VZ�+

qX�w��U�0'O8��`���gacc��Xz�� � .PG �~���9��t����o��w������{\ �-�$���dm��8]�9
!.��F�
�da�����L
-�������nv�0wG������V�d��ĥ�uv�(��o�=��7fA �A< a �
�x�m�~���t��Ar��-
�|��`N k
{�/�r���v�p� pW����%�}���
��� K���1���
�X��W�@��
 c'�
 ���kez�V0G{Ͽ��,
  .EmCMC����(�}JnA> ���S�3
-���3㿴�K�?P

���	�;���5
 ��8�:�5��r�M �6f�{~5
-� ����	�t����Կ���X�������U���p��
@�[{
��[8@�=��
�
ԇ����'�"��

-�v����LP��P�����.�l��=�h�\��o2�������-l�qq�?�?(���?J�;�aVPG�6�ޕp��i�+
~/�t��_{k�}���;7
���j�(��r��6��)�{v�JLJe��Ή֡FaW@ŗu*��.�1`+Qj����
K%%�n',�̉ML�M!�r��RLM��y��I�.�"��Y�n���Eg���C���0�74F�[��XT�E�J
�oM�?�
-�WW��)�5��"z����Z3vɤd�W�{NR�Ll>5�%���d�
\Dš%�a��H�P+ϕm��T
j���L�͟\�x�+}���X��h��	((F��U
D��8T)S�]�c�}�B�
Ҏ�;�e��—�
-22�)\U�_��-\�
�
�4�¬ژF��6�u]��M;�/��|w��hQ^]DA�ТhR�������j�}�_�Jx���JX:G�ʜ���46=�n;�fsD����
�ɮQt��=C���D@��Ӵ̜u��bF�q��X6�&�A�A�Yoo9��ʽ�}y�,��_q����̘���3��g/3���Z�=��^Ƒ��k��"L��eҷ
-��A_�Tx�cj-��:L{9���N�Ԓ
�/32
?�I
%�,��o�T�㍀}�~cLh^���
kXD�$2�L�ԍ���\��+��ڠ�
2��k�k幃D��~����T
��NE;6�m���$�Be�e�8�����ɤ�����l�	�gv�{�J	��=�����HS��
����i+���Eݔ
�	[
�8���vm�1��,��"aox�sL>M�]�<P')��m���@�O'��G.�{zU�{	�ǽ�<���ߌ���N�
ںU[,�o���x� y�Q��q��f$��d���`���|]J,��$m���Y>��K�9k)CL�����:qL���H�(C�xG, ��ip�8��00��gV5HJ�2z~�@�k�dN]ʎ�!�H� .0ru��K��8��ح���{�Ite����rH���pz~�������H��l���1��
\����i�h<Ͼ����yu쑟��(���Ǯ�
N77��y�Ӄ��Hަ�g���"s�%.�������3���NGY�
S~o�^�q]Sx5��~�'[�=�(V�T�<8o�G�dJ

-Sw|��g +c�|����:<�h
����{/����"}M!M͜E̚/�dƈ*ב���I��r
�
��l:MՃk�O�=�������
��RO��@���:B��o7�!�
΃�\�l��ͫs�*#6���l��$3�o5�G)�%^��I<��B�j�
��ߐ���Y��ɓ=�hT��GK����R&R����s��=��N�&ޮ
�p֙�*_�X�5H��>�o
x���
jГG����P0x����*�"`'z�%������	��iH	!�]�+0�A`�D�:,A?�	��tvDb.Q�����e�/�����@�'��g�i$��	&�Z�m�l�x�R�yO�?�*���"`�
k� �7h�jT���a�]�+!�9���XCM~U%uH+%<�=ԃ},�����ԁm�	~)K��
=��uW��A:�
Ѱ�B���
g��IT
����k
�8hWC̿�E�O�Pd|b�:�I4�N�]/��
�gr~����(���b�:ά�5�a�2����$��3di�%G��ֳΔY�	�+{��ZN���*�e�^�i����Q�/�8r�ȣ3�
��)��ڶ�'�͘8����lc�z@�<�}%��S4�*#��
��ZRް|�� �\9@F���%��	!J̿���

}�ݶ�_���j”�
Î�4㈰ ��X�C�^�(�� DT�9P�
/��9��"۲��Z��b|q� Qm
��e镻qJ,7�zf�0��V��g�Yw��ZX��{�tޟa��8|<���U�氽/�D��:�n��ޛa�|��vC���N�9��@�I6�g�6�tJ�sa��nV�]�z�*�L.g85ԏHRJ�4m:�h�i�����
��Sr÷���&��a7sk�XU�
�� g���<�����t��F#Hҹ���Vb!�67�
���ճ��-��̒�,t��)��uo(Q�#�
-��a�,�œ�v�&���1�
:I����i���C
�՟?R���)�O�C-NӊD�\�4�%nc�ʂ^
Ԭ��Z>
	���
-�-����H놹�ˌ�`���u�3���
-t��s�/���t�G/���)z����WRGWߑ���!w�ŧ�z���G�na
-m���ÌNc����l�B"��lu����R��c������bR�r?a����m<�K�?�oy*�y����S�Q��q~��b��7��*��6��m*�_.=���X�T����ĉ�c��v�������Oƚ�n&χ��*����Fk���:��q <�IȎ�'�Cg(K���1�Z>%e��}Fh.pH4X�K�u��9���c�����B�0�a�Nmr���(��F^�`�j�Z���l�q�|핿$o(>��r�.@�`Ɨ���s���{o�bT�S+��1|X�EG)d��y���
��јtj�!AC���]�~��9������G
��XewM5� W6��.T�[b�ޤ�K�
s��iB���q�D�9gL�v����6\E��3p�|���v,R�|	�����G����ֵ�~J�%
�I�
-.Y%4<Q����9�H	;Vn�s\`UP�9+�����X�L?nL]g�m��I�������/I�NI_�<VƯ�Hʷ��ʬ
J�hg���(}����,��-�g�EIf��I̭O���;Z��[�5�ax�A{]];�]���S|�{�"z�A��M
�~�T�E�4����
�����`�\O��2�ѷ�(T�"%%�l�Wl����U܃�1{�1�;;Q%�8o$���j�B��W�������< 2���������:�d�l��+M�ʰ����ܱ�NcI���O�Jq���4�����0��R4Ck��9Y�G����ܹ1%>=���?�5<�!C��D�t<2��٤ӂM&�������o7鍼zt鼳%� Y
m��t=xwZ	m�O�×���>��v�P���e-*|�k�b"W�\*���컁�|�18�*�|kNٜ�V;�n�益6?�}�B�@�x��p͆ܩ�:�&����8�]A����Y�+6�U�E���8@�‘����$(��J���=bZ0ԝH��W� [...]
-F�)k��I��勭{�&�L�O�2���\ħ��+���N�pOg"��靆��𫒄�P
-�P�c�
�d�<^��1�0
HRI\��M�M�
-<�D{8�5?��/�
2
3WCu.���	��XI���?�M^�Ԭ�i��[jZG�1h�rHd��V3|�lHd4�|��b�@!h਒t"�viۺ�J%˥D�U�pP��ޟ7dN��N�9T�0��+�ʍ�m��i�]�� �5W

-�
i��|�����i�^A��=_iA(ؕ���d��dLRBUlu`�y_����w-�D*�ZL�	
�W�2@`xn�Q_㜠.�SN7
�ܻ��c�
���8C�dѧ�;l�E�7�<J�/����
h$
���8��jSJX�x�ήz1�j�nb_��Ő���׼��b-���>߲�T�
�����}���<:]��V
-T�I���$d
J;���\3w�'��j2�����<ҿ����"-���D���o��V��*��D�V�R�„hb��n�"�x��ᬅ:���`?�am�F��5R�9�m[M| �>��3�����.�����h��XZ;�I���o
0У?���
=�Yg1��k�F�
-U�_.�m��Тv�Z� 
-���\e�p��N�0z�����Z������ɺr��c��[�2�n�սF�(��
5�)�*T���yD���ڈKz����(7M���'C�յˊ���\��T�[i�`ʛ�
-��;����9�R+�s�98-��Mo'�`�
&SU�1��=6�nԄ�]L�QB�RV��/���GH@�r��3{�ص�)�B�VY�v����).� h֋/d<R��L4v����
t]Y�ƞ�� R�奄SVÊ��/zy�


t΄�3R��SlKM�WB��b�D�hm^�|��_s\�&Afm�#�4��7�P�m�i�]0w���eZ��%���u?�(��
י�xcK}]Gz���0d�V��d`VJ�Z�f�w����nġ%���7����g&�$��9��^s/��
�
"�M֕��sm4��mi�dǬ�L�;�M�
��Һr�*���ͯ���JO�I�
-��N����H����Åؕ��R����bh�������8I�u��?қ؜�U��Vv�=����糏n��VPmE������?a���
�L�����W���;_=��CzG�j�l�P��lV��Q�SC$�Qxj��?�_}[�6�o#���t|8ŏ��;��ĒQ�t]��=�O�������P�P��W�Ԥ��\��/hR�4�RL.�v-ӥ
ɀ���>5�+M�}p�D�'nM����3�|�\��>�n:q1Zׯ$�
zwϽd���XY
��LZ��'��+�:+J`��'��gƘ,���\�����}��瀝�+���f
�",�­)@\������m��icݮNU�س��F[Ycz��}L4o�4�\v6���$
^�Q:8��|�����j��Zu���4����:"W�
��%�ڟ޾�J=�e5Y��ף���!A�XrV��'�
%�IPR81�}rl�5�b�CJ
�����x$`uN�]\|��H���s�]8��F��"��l��.�Q-Mt��ya4G�:�֚�(�c�@1�g��G���
Z#�t��y'x�����~��Y�?DD��$�(���D����dv�����꒶�X��r]
��~Tn۞�8d>�W
����Ҳ�����H{"4ƾ����bF�ў�Ŝ5�
��VVܗWڙ���n�R��t�k�)��]
�����"l��x��kcHSM����I�	�:mUH3,y43�e���p�����
$��d����	��t�|��$�Bym��s��U���]��[.:�>u�[Ed�k��7!k�MT��qV���!
���Y�|Tas��=5v(o�*
-��,7&��G���*
��q[��W�Q����0Xce���g�>R�'��ԉ���l������P�F���I��7�>�~M�p�咛�����Ai=dU�H����+9�
��ݛF�ui�O�O�
sVg�ku��~y���r�
-��d��M>���M����y�.��V#<%�Ω!M+Fޚm^���<@|&���N7�Zn�ޠmV,	�	
z�{7�E�5�P��8
V
�q�Q�d�+5��k>�	'�
�
�b,
zod����
�rC����J�V�KB��a���'ɳ\�a%�_N�7J8�XSfR����3U{Et���
$�j���:l��e��zh �������.����N�q!O�AA�T��k�`��*����{�O�Qz�&�*j��𖒜R5���^;����+�C��˂�y#L��K��N��T�q.�毵�Y�}֡
��'%}�{T�6�25�m�d,x���Ik��)l	u"]�c�n��އ^B�,�
#�7��b��XBU�-.��L


�^����-T���/
->\��m��C>xON�{f�R'�
&��b��X�<Q�E9�@RD{�}]�z���5�yr&�����̪�"r���ܦR(	�8��'{���}�n4���,���uZ;�!��[WG���Y���{h�zF^�2E0�N��ԡ<|�Fb�d���9�����f����H�A�k;м�ܒ�n����
�67�zT�j!�XZ/
;���]
e�Q>rN�
��胩�o͓N��s��s
Fϱ�:����ޛ~gn�w5ؚ��8�4舌D�Ҩ/߆�Q|V��"
Z��p����y���3\tH��}`�@�=U�}ԈO������[q���'����e�}kqC
�Y��-69�@[y�q�(1�x�"#vVB$,3q~YP�~��ꜩVPr����d�!#��)|�A�`3Zx�����r
F{�<>뫕`r�lg�2�@1���]��ג��Jy�h�@Hv8�MxG��h�C`
���
^O
-��G�P����M��r� D�
���5"�qA^k˳�ʴ)遀�����6�^�}PN��Q-:��-�ry͜#�������4�A�<Lß��Tk͇w�՟���K�ݳ��Id	����&���T�q��I�%� ��c���1?�DY��B�w�����M
4�$n�#�
$�d��b�3�H#�	ݲ�(6j"�`�)�L��?�J-�<�����l�1�qx�)���.���-����2+I/m�!W�
RF˪�Q)��uor)����yr�?�`�

-endstream
-endobj
-3478 0 obj <<
-/Type /FontDescriptor
-/FontName /ISLYQY+NimbusSanL-Regu
-/Flags 4
-/FontBBox [-174 -285 1001 953]
-/Ascent 712
-/CapHeight 712
-/Descent -213
-/ItalicAngle 0
-/StemV 85
-/XHeight 523
-/CharSet (/A/B/C/E/H/I/J/L/M/P/R/T/U/Z/a/b/c/comma/d/e/eight/f/g/h/i/l/m/n/o/one/parenleft/parenright/period/quoteright/r/s/t/two/u/v/y/zero)
-/FontFile 3477 0 R
->> endobj
-3479 0 obj <<
-/Length1 1626
-/Length2 16076
-/Length3 0
-/Length 16928     
-/Filter /FlateDecode
->>
-stream
-xڬ�eT���&���Ӹ���;���F�����]�;���N�����{f�Y���3���k=�W�Uw5
������P�	�����.P9Zx�i:9�:	(�� �@��z
$)W��;�	,m��� �@K ''�C@@ � ����
-��u��h�1011����������tـ�?<�NΎ@����ׁZ@ ���9 Rj�T� �r�: 9 �j� P��p Y�A�@��`��
-p�� �t[��i͍�o.	7�9��h	��:�cb8]
Ann� 7���9���
ܝ  �����? �ꭝ����鯇�_��d�Nn�n�� gw�ߪ�Ҳ���nk��Om7�_3���������?-���7�_��9�pz��S���9;�����7��+�_0<�@`��B�
pژ�Z9 ����������W����{sgg�E;���a ��
�Y�88�ִt�[�Fb�gW��N ��<����������3
A�[9�
| V at k$6U'��%��w,������@�
��-���#�?9��
�������e=

T�
�.��o
��1���2�C����
-1w9�����
��h%�
��Ӧ�n�w$`�������[	r�y��A ks�����^ltu ��y��H,
���aӶYڃ�!���& ��?����_��T$�u�����_����]���/��ъ�����I#)��
�����`��������e��?��W"���U��]A� ÿ}�s������/��?�Ȁ-���Y-ws���M�_�̖
��	�����������@�7�i}��R(�.3'˽�`tJ�p��z4ܹ�Y��8�Ω/03jO���>��eF��g����P���{?�]_:�ğ�a�s�����(�ͤ5�^���%�]^vݣ�)
M��W8ҙn.W��g� *�� 
�'g� ˌ�/��0Z �J�Ҧ�>?�
�������
3�A�2�H;�Hu�1s}h�|�}��s���p6P\�bM�j��V���f
�ab��g�_��{�wTI�
1��t|*���?]h�s�i
^&�hN̦��}�I��ou��
?~B��c�ak�U����Amӏ
}�BS��͝8�+�ɓ6[�h���*j�}
�y8��������v�
�n�L�Z�<^��{Ճ`�.023_P�P`×�f��X&t!���PR2ø~B힅 ���'ʒםA����
;D$���
-N��N����W����PB��ߐ$Ke��L����R���G�?2"��N�Γ�6�< C~��v�9����m�|�}m�XFf�eF��� �\��n5�
-VZ�ɦv�O��HNɈZ�;q����N��+in�ű=�7!�?�@q�����A
�=�}��ڗ�$��32xIL�
��A�\&��&ۉ�s���>��
�B�v�O�V�DB�5�
-�fF
.:i�p/O�������yn���(���)��%���'�w����V����]k>9�ɽ6�������X[�p�w��l�_'
���5Zo��8Y���'�h��p[��/�Ql��Y4cx1y	����vy�'�
��'2���_Vry%���16�>oQ�w�Ijm����;W�R<J	��r=Ah!�!f@:��sC>�W�r��4A���}�$�3��-��Ob1��6��`��ȰuW��8rB��_
���=�z���X'Q?ll������S���ic�e
�m�L��8�\��
pn
��9_ZN�Z����|bڻ)i6���|����K���[%i��נ2�Э>�@fXT�s
��p�)b��@���.�[ /טVåP��'hQt��D\�r[��N��S^X�2�z`��,�$�ܣ��m1�$�4?
g
4��Rddz��+���ǘ�����8N�y��g���^֩�
ix|��7ެ�'�h�guj�ʭ�!�x���P��g�V+�70.#�)���-w�N;�'�u��U%@���ˍ�%iԇ#{��
-��#����֤��MX��G�*��hѶ~�z�f۩���V�E7��z�W���ת+�%4�l����z�������5広¼����:lĿ�l��|���b��|��	N�	��;�J���>�}j��N�F�q@&V
�8�b��.�E�u�p���
-��9�z���g����
-���lP��v0=J��OX�U��n���n��F��E�\��7aH �N���tF�E��2��o�
_
_k�}V��\���	f���
�ʣۊb�>ڃ��{��q��] �ʞt�]��:�d��a�#*z� n���y�T��ĵ]�g]�
-T�i:x���R
-^
�"w2��I�'���Z
TWB�g Zݗ�˴:�<��S5b�bSiQc\�Dk�8Ɯ�oqG�ɏ�٢�����i�6qnE^��j#���ƞ�8њ�}r
+�z
���
��T�؏') �ZD���7����]�G�
|O~�O�n���^7Z���|A�%?�Ȥ�S�la���
5{SɆ{Wq��s�gw�R�F����=X�o����c@
�S����G'M2�S��x/��a��
^�î5�p�(v���Jޥ�"
3�={V��&��J�d�0]0��q
q���"�@�,98S�D\��!n6b}P]����k���z�u<.�oB�`{e
�t/���ed�|�	-�����
�-�r��[���}7��%FBѳ����jr��g���U�7e�Ap�M\M�uzz����#>�%�
�@ܮVwd�����I5�|jG7����r�vku�Ӫx
V���.:������)�ANġ���w�*��H�<U{Y���q��Y¾�
�n?���4��H��z�/��a��8{]�4�?�<J�v°s�
�F�L�s�!�"�-�O��&�l���L�g
���Yp#��Qߍ�~ơ;��(,X���p�����B{�L�
-�JQ��&EIS�)�;w�gT���
Z�Y"�&���������Z�pI�?d,-W{V�".� 4�5��
8e
A[��{�mڳ�B�ɋ+C[���nI��a��1�V܄�H�l5"�y��44U-���
z�OͶ����l�O�j�U��6/x
zuwҏU_�о+�jW���_�R�$C�˾$⭁���w��`
����h�\�w�;� �
-:'vu�c�8�oy��)�[X{�b��>���
���[z� Z���-�4�nU������wM
I鰩}̊
�e�P
j�T���"JnLY!;�q>��.A�\ω:�_.��R�V�A��un�nԴ.�f ou|z�FD&�.�$p��$�bW�M�P�
}}���T-�O߇�̠��+�i���*��	^�
�A�2t�U>F�R�q�˘������_6���U�c�_ܗ��tr�
lŷe'W�
J�Q�y�v

��+^p �T1������
ǽ�TM�	��(��/.P*)�%k>���
���^}�knu���N{��
	kl���j���|��+ۢi�)�@��g��gP�;�ʓ�/a
1Vk
�O�$�hy�ߞ^R�Z���`'�
b�����R<��}�U��� �H�Ʒk/|"��g���9�~c䘜�����
�S{魴�
�~Ɓ#�����m��f�)��s��*BfP�{��g~\&�
��wꐈ���m��T8$Ty
�@�H30��*8�̋nO
ѵlb�3L=�h�2�T�03��[�P]C�.�θ�[�r�]PK
�ݱEij;�4�v�Vtp��T��98B�r��J�̨�Nt`���ߓ%�ަ�Û��/W�>E<W"%��捹8�}���J
5�����n�L���T at m����*9���p}D��sD��8�>
�^#��^Vo�I9�@��
�p���%�ۆ�ZC
Bz������AQM���dW|Ja히���Kc����}y
痣�9�	��j���v��ͪP�OW ���[�Q�j�.&��|�����:n�JhA1��p\I��I
�N1��1��L�{�h�N5�D-#��b�?eW ���m�,��O{Zp{V����Z
�#�Fv�g�o�6(�T0�����S�cX��i��ShQ�����,�!�U?�w�0���g?
�H���9�:xJvQV8��Z��e
�eo#i��O}.�e��y��=���L�
J�I�Ի
ZE�,2�F��TR#[L&UJ�ة�+ec�cO{ڝrB����2�2�-:j���̗̃��UFk��6��<�S�3W�eO����G�uv������WTn�� }=����p��.��++
K��-c��Λc9�YF�1���l'��#]F>�KC��?��N+R:�%D�o���l(޽���^Oں$���k�fG8;ܣ^J��
-��8��G#�����$�\+�;0ޚ�����S`#�;O2$
A�œi�׊{\i����*U�3r_�ŏ��Krv��
MZ��Xn�^� � %d�%��K]��M�i�]��|՜�t�d.�Kn�r��Cb�5��7£���f
�]���+�l�vNIp�g��{:�ޠ�A1������ta�!��DA��g]���
Յ6E�Q�q��]vX�0Bϭ��s=�,u�W���w�g�XQ�ۃ���[�ARf��dKi�8 �k�
0������B�ޗ�3� 1�V�i���&�G�K�Ӵ;�-�|�>JL�mbi����3ݦ�2G0c
͊rT� y�2(S�y�
�3f�����t<No�II������N���<E\B*{�{���n�";
|���>+�7Dچzp�(�(�-�+�$N�
���̠���B�D�-"R�cQ{0�ٖgؽ��!\�̾iv�&cw#dNZS��K�g�晪�j",.�g�(�R��e>QV#a������}�u2�.:�Y۲�Z�D5:π�w֯�"(:X�Й�e���:��ZV`Q�=	��6Iq�Lg�� ���
<����s�Cz�Z��
-񜙉3H��(
��2�
+c\B�h	!~��2��t�dAq�
��k�)
�y|���
\��'�#�W���X��ߥ_���-�0�	�
L
��!mܺ��
�q�}}
-�#-d��Z�s_3���C9t_A�>������0ja?���Vl��/-�5��[y��0q|h������G�DD�G��H�	^�,�%ˏ,��_��[�3��x꣚���K�w�ԇ
u��E76��i���5��)���ͨ�۷�.v�,�2\qo�H��
}�_����g�&T.5�-�t
-��-�L�({���4c~�Ȍ�G�.��*q�J���w	�tM-�,�r�gʻ
�
|�ٗd+
��ʠR�n�(Sr�����$1	\�#�)�?+޻]�;9�r ��� =h6��3�sBd���n�3���㟋�
��P.!�

7�r
����A��
��=�֟a���u�[G���8eXIU�t���x{��.�.)]�'�u�t�

��p��z�Vv��~݌��Ud���
���
�LJ�D
2a��YL��~�����X�*�E�͕����|��!�',s�%M!%O��`���if:�!0��Nǧ��ワ��w���(a����$yN�@�����%YT��&=f�+I�lOz�<j
OÏ5�<�f�P��
-��=�q-��}�ޏ�Qe�
��Ev�SC�� �*�-}Ɵ�s�$ ��CI��#�8(�	��B
�ئ�1�>�&NmdٻƱռQHQ*�����^�=�BL�0�Nߡ�Tl�Ι���
��\�E�Cm�
-Qr��$�A뷢ߗ����يN�\y�"F�#��l�Q.	#
'��56�!�-��1WZ
ک��KY(#�h�O;��6����uA'_�<h��Y�L����g��D��<�,�+�aj��h�
�2Fp`��SEH��J'�{d&-"��j��K�g�M�VU4������9�ob�	Xx�
����0wNɅϖ(�
�Py��R��v�c -��+U&I��1�[2�G(l!�b@�u���n�ȡh&^�huM.�<������Mk����e�M�v{.�p�\N�R����i=�tqZ¥ ��(�����??��V]���k����҆��IsƾLX@
-� #ۧ�?�B�%����
�Qϼ
!���R`�[���-GOG������2p�"�=�wi���ϗϤ%7� 	r\�������
��7���;�KJ30� �p ����-?�q�ü���[��W"���C�E�W0>�t�8�j�_`��ۡTl��~dN|f�9FP���<h���we<X����[W�a��D�x���`�|3���=,س�����/��y�z��a�7��ՈVr��7D� P���`՟
-��YC�A��Bn
- 9��n
Y�߸���
�G������v�a�/pe�D
h$�
.�Q������
�9m��w�w�����hR��
����&S��� *�n2J%��5�@v1{|���.J]j�����
�/�yƞ����=鋖_/�>�W�p�t*��rw��8�W&_X��PY4�BG~)���2�z���9(��=1�o�c�¾qz�ڑ�j�~@}#����	~q;�L���.JQ�
�j�f�*
-����8�&	+�t�
�p����\ϸ"�9�p�r[1OtO��PRr~q�-����]� '�5_�M�N궃v��B���
����!M�t3��Ff���/�
ה���R�QHZF|�!�!� ������ey*��yNX����v��4I"u2��ʑ����=�(\��<�H{�R{��ԨÉ)�e�p��
���ÝS	:���*��-�UH ;)���ȯ
�/�(.���	�eb�9.����Ml�	�K
*��}8=hKS
��牙��p4�1X�,Uxƃ�v��x��/�*�Y?R���4FvNa�tD�A�8��>�����$Ȯ�R�7�{P�Gc�i+����d�%������3p�Wؼ��z����T�-Cy��J+��� �
-����~}�1[_��;��
��9q�DԪ��KwԴ:���M��!~����b��Y�G�KҮ�3;�Wã�6�T	�K~b�Ń���J��z���;9�!�[
-~X|���y��H����I�B���z at QD�`nWJ�@��J�{���{���%ޞ��2֢6^��'u`��+��8v��|�M�_~�S-����
�sc�r��.�~/�C�����{UE}�� "�J�
'޴�G�>���� �r�����V��Y/ȳnCxrC7�%/��u�
���uʦ�;1s�����\#
�Op��_���~�‚<^g}^�{�XvC\w�F:{��4���E�
T�$��DFϰ�TW,��-�r[���qt��~Q�&<�.�B�I����s[fr
�?�� Ӭ®�N�o�
���H}}B%����~
d�

iگ��M�4�3�(�E��@䮐���+�Q�л
m/
j%�ݒ�k���HVQ%}�Ό�p���Tjj�sK���!��\�w�\@�eR�˄:��&^������-
��{�߷dbT����
[Z��"�J�}�P$A���e�Ҁu���
-�� �Y�x��uL��|ƛ����r8iF�To�

$�R��e1q�X�ʨm����'���[d�
{b��p�az�U(��(&QR�B
�|!�d���˴�LX�5�4�qU�8
����w /�2
n��
F��+��<y�7��! 6���U\��/3Re�
-Q�(6������y��T3��ވ��~J�t�W�I��+��q`����FY���-��3��H���F�-�0�b
'
^Y�rf���<$v>���F�y?
<�}L��,��,S
� B���F0�i+,Aчu��e���#�'�%�7csP��<�
b�
1Md��F�
a����
�>�E��_�V�b���I�ጇ�{t��{b�����Nk�T�xQ.��kV�m���� ̂(��V6�0�4��)lt�zL"��]�D�2�貙S�)�m �U���ݍ:�w��'�m��9�wn�Yot���m ^�>�IQ̈́��b
�
<��� �h�>Bj���?7��i�	�������X
�]H6n߱��8B�m�r*�4�ɩ����
��@U�6i������8�>822`�ps�
��c.�V���7U�&��j�v������Z�qr���TT���x���ٹ�h��h%
R6z?��<�쫠�B�0K�z�|�)�4\� |�'=�a7(�c��ͦNI���0뵆^�Gn�	�+���6�
s83d���+�!惘�FFcK��& �T��'���;N�������9�x,��ժ����@2i�v�E����\���Gy٧7�
�/yڹ4

V$������U��yq"!��J�=k}��$3�!�5m5��W�4�
S�eܡ�
p?8�b�$�}	�����Az�H��A��%�F�o�64�r
�<��1�r�>�|�z6��|�MG��+7�мKV]��J0]
L��U�F�61tq(��H�gA�hdžO\���qg�(q��a�{	�V�:9��
`���k�Eȡ
-����y�.�v�|�-���0����a�H�uI~w��@e���\%٦N������ ���] /Y
O�n/��
-F('�
X(�0B��߸6��
�&k�؁fuiY�)l����>Y���wu���/�x�W�X�>Ƹ�L��(b]�����QD2K���	!1i�Q���ROۙF���n�MR�/F�S�㛡m�
-�v�w���;�
#�j��$���7E=6�bf�
��ij6]^j[L�;Q�
fL��|?���Rnql�%
-5��e9�Ink�hZj<z�φ�/����u�u;-���|�!�*l��Av�dJ�M"]����|V�_�C:�����?��l�7F������P��(v^t�1
;���k+��T)g�/�+�j�+(F����?�"��\Y��`I$q(%��GR�Шm�
�ߟ�
��h�C��US�MJ�
-�3��r��F��5�
q[�]�9��v܄�H����q���-�d^�&�ŏ۔o�"H�n36'�+���ʓ�M�������b��De+�(Uke�P<����t���T�BԈu�N��+vb�hK�y|ԑBEE
�ƣ_�&[�0ݎ;��
f
E5q,s�9���k��G�%�
O*q��('Fĥ�
��$/L_gl�Ok��
��.��/EBx���N�=ܵ�g�ʘ��hC��X!_iQΪ�"�]ͮz��l��
̻
���*�4
��SV(qT[� �EK%g�x^�
-�s�'�j*�ߪx^"��vsx
@��)
0�����L{|��E�s���tPl)~��5��o�~�q��!;�ƔTΟ�
���|S�ݮU�
ab�(�J�Z�1�)�ƅl��L�@ƈ�c���D�%[ڪVF�~Zzf�V��M���R��iT��}D�m����K�,�t���̀�
y�,�O�Ѝ����5���g���h4�d�G`I3s�[4�c
<�D/��:�zͼ~ߟ5���,E='�L���sYM���NiIuT��{��F�Z��'��G8��ǧkC��ST�)p'��
-L�y�Ӌβž[�.�a�oW0�D�Gp�
-�&Э��h�\��f���m��x��]is�ܰuZ�F�(zF���gm�y6��V2��b�����R <�j�(l�>%3�9@&O�Q��\�ҼI]��6�pp뾌U�N�j��?����
�I��
�P at z��c%�]o�]CA��T㮮ɗ���g�s�}�t^�^�
G�lC��,�@A�ƨ
�W_�{E��؎�q��|
؁xβ\F�0����K��P���6 ���vke�� H��*����
�\�H���A�)|� )9]�#q�ϣK��#���'t��78�Wdz.�ٟ

(���L	��ud���}$�W�l���?ϻ#ձ˱	
�2��C&�yBL,�/��rR�܊Q{�WKبd*��@�B��ze􋫈0�6�C�Ԋ���A�;4q��d������0��a�h�CL60�^
KM���
���h-C`
-���f
�f�@��	���tY,F?�j6U
�T�
���-y����1�f�>��!�$����z� ��;�^ʹ�p��	Z��&�
-LJa"5��}]��
��Us�F�*?���PΜj�>.p�G����n�Ja4e�2#x֏�Qb��nh�p��i�����g��]���mB!d
��C�[x$�Mi)N�j��W3�]?&�q���t5L�1�Am��
SS�B
d!�,��(��2��U�~ш�.�TL���Х5!8�d�
:�M�4���
�P�k{&��0)�,�n�������:>
=�=���/�8��!�>4HuXa!��u��X=�W���G���
�}=��9~�
G8��'rN(�N
-�ᾘ��t�	(���q�3c��o��}H��*�%ݱ��'���
�?۳;������Z����"�dп�W_#�WF,��f~(S�앂фNd��͢\A�/����?3\��X�]��o
�5��q�ReMT��n
W[��
ϲ�=R�<����Y>u����A(o�\=��+��Hx���C'�/�Y#��? �%����&�[p:441k�
��
���cC����Ba
–:��s�m�w/���{<X+o6C�}<�Qmy�a����SF%WD�a*����~�3~���p�Y�#����������R9���q��e��s��E�<��F����
�H*뗘��p'r��Wf;0�'��h�
$�D�I:�k�
T<k|,��l~�O1P[u�E����ybz���
�V��5k��zȽ�
�R	
9qI��*Ác�q�c���m�����
&�� ��m
�J�.�si���2Ʒi�h<�����px���\J����G�|w"�z
�ߒd�a�͸yąܭ�%h�
X���c�vE�#��Š-�;
jzG��|�Z�u�>��O��M����
-������T>
��Z
�//&��T;H�>�1:6!J��$(�o�ި�k��	�x�wEL�����K�b�+_�l��5U�ڄ���N�#�a��ӎ��
��5 at W&(dK�s"����	>>�b
觠@ܠ��:B��<Ycf�
����a�8V�۲zì�8�]�=���j�Ÿ���Ҽ���N&�`
Z`��oox	m1�	pG����x뷏Trg�t@8��^$X���ѻ��\��8��ۛ8�VY�ȋī=�>��S���ٜ2�;y
�gFF�+�b1atVB��V{�Xiu�����$Q��H�D+���wj6��~6�˷�)�dZ9���W����S��M_9���P��)͟m��=���K
t&^���{LV%�͌0�P�Oo�sn�"�2���(�L�ٷJ5�~�`n{�2������h��

-����>�y�9�7E��mz���MW}G
-�_H7�)�i�#��ս׾&�ǿ;a|��W6�$]s�1Sg�!}{|ѽj��8#Z�K=��!�
i��O����
�T��<�X�߫+� ���:��]0��?������b��Rp�ᭊ��OH�E�LB�鬸H
Ӳm���A:�¬
�R�
֡^n�g��0�8�o�PS�#�RA��8�;��( ��H����D!�/��o]b�o/E���h\m)����0�2b4�ε��Ϥm��eI�j����更-O��
-y�%�2��^�Q�v�xd��Y������J-]����5�)e��5T�Έ�������N	�I����S<c�r 
�- E�yN�4�
�W)-��NpfD��m��V��\Á�S��xY��7�vn7�8�xR�O�g�5D���:hЧ�#���+C�Np
�R��
'��t����6ȼ��Y�u�rL��Dq�����5��w%(@_
-4���1
��
]�**m�B_�
�7�(�G��Y
-9���G�2w����
l���D���\�+V
|�|#d�j�SAVdqLf�͜y)i��U��'�!�\�
���y6I|u�/��ڛ+�TsRj�敌����3���ZBjA�!�y!�1�
������C�ZK%���r)���2z˘wJ������&}O�f|�=W.F
��'/m�����Y���0#d�w�џ�L0|���ԯE��0���/m��æ� ��T�;-g�w8	�b�6�|��$gnD���:�
	�=u�	�u���E��]w���NG�����ј4
ci0*��#���-������0��hI���#
��˲���
 ��|@�W��OٟDVnQ`4�M}������3��O�`�Oa
-��_-(:�|?�{,*G��F��En�C2��\�]�pz�I�����Xe����7�ZB^)
��m
��
�.-e�ed"��U�P#y
�ɒ��n�D�}��sޥH'He
��ώo�M�?#���7�u`�'ԟ��
>F
����!ʆm�0�.���$\���}����+��%񕛙����z�N�II�*AJX����b%a�?u�
{:�m����n��]|2^v�Gc�
�@<y��G
�)��	�L�K�O.�0���&|7��gm�Zu�炶0�����N��ZNΜ�k?��N�6� �P",Y(��\}WR��ш��3kB�ˆyn��)�>���
-��>�b��Q��$M �5���pEO8P�C-���$��G
1'�4�a$#4^�?�$Y�
�(6f�X����Ma��ʁ_ﻖ9>U��4s�a-
R�p(��@�瞴�4u]f2>��
�Y���9O{{��|n�R�}yS��a�,~�q�t'/]Q�b`2����v�K3:� cl_˧�{�tI	�3��jS
�xm=�v��;L� �ڜ�L�z
�d���l�;���x�Ya1
-����%�K!q4�r��T�󾗥<�W;Aݮ���t1�›��
���z��2F�����8�4�CLw��9�cP�q�l��2
<�u��h=�y�����W-�յ�e�`5�|(�Z*���l�uFT�#�
�bL�ڰ�ߏ)o��|J�x�ؖp��x�S�V7�#ǥ���'ȝPS�|����@�mo�G���"f��l���p�+�)��.���s�貒G�\��0�8ke'76G��~����`�38+d���a�Q��J*;�Bu��t����j2hLG�F�z��+���le�(h��k�g�H~��$�EAצ�8"F���"��K���;��JP����7�Y���n�ER
�O�+��,�ּ*"�]5�g}���'#6�_�O�q�e((]t)K
-/���N��5F��l:�ڮ}F5�=��HC�Bu�!����Wᩩ2+�ȏBQ^GGNH�B�C��n��[����a
pb ��r���
-��0'��:�~��
<>��u������c�}�qvP*������ �]�{��装��9��7(:U֩��X_`I���&�m��[�
��z��yh�J������!��j�\��0d�����R3N�a�A�r �z
-�ߗs�ޠ]Z�0��S�(kl�z�x3�g�C��|����j�8E�	$Ss��3Ž/M�8�}�/T�����7n��JiK����W��g�I�仺dHb+9�j�(�
i}HT�]�O�Z�W��.�����ǩl)GST���:�nwu��u�F���P����p�Г�J(��T��c
^: ��GM�+�P�IrF,���F|�_�P��I�����
KY������/�V�f��|�/yN�1���w���
��Wf7z��	][b�)�����}5W$睶��q (X�#��>�Y]�[

a�
'���B�0hz���a��vwo猏�^R�~r���M="LaQ��1���vI��nF
">Sש��炢9���0�:+S
Uhj�>��K�Ib���$G=���(���sx+�.�Pe��mvu�9�����~���Q^	���6��#�����g5T����x�8
'�QW�g��umX9�J
�Wݙ��ht-��#E�#��T��Rr�D^�[���l��W˷
n1�	-M|W�E�nGtg��1خ|��s��mp��GlAɼ��tDa{" &��mI���%oE���2r�.Cb'=�
�_~�~ʏ-
��
�,��\�3Im%�z�D��bX�
��*P$��uw2�.`�)�?��r�/Vt���8�,˰��A�5N��m^�HG�
ߘ���� �޴Т���>�}�
�Fʃ�
)=��x�R��H`��!ϙ��H�������-��75j�/>�ʆ�]�5>0�~����g�����iF��>�\��ӭ:v�
I���:B�T��!�=0�/WŠ�3 Y_�
a���_^bLD [...]
-1��ں7�

�qX�؈{7=��Qd�Q��O릃������9��ښ� CeA^st
D
bRTSU�"L�H��߃D
-��O/��_�j/�Ұ���.o�����{gK@�lU	{��L��鱤� 6 G&�`i���=��
����d(�0'!&����
d��3ܴ �:�-���Et��
-�o��n� �X����G#�B5�7���N9�D_"Xi�Hk]1�<�;����4�үi
��/?�K�m�&��`+�ч$��##�h�

��`��)4
l^"��+�0�Z��Li�G������Y�.� /i� >��|w\K��Z��g��ى�.;�'֩��=l_�
�N?(BW��`�ÿ�
؎��
S`'{G��+O���I��C��su�G���+&� ���G���M�ɈA��zF����v��:�
BZ��cHi���L�����WP�Z�v�а?i�B?�s�o�s������7���Îߋ�
-�ޥ�D�w���8�Z����ّ�?���V��qS.���R�U���=�]����6����-�T�V��9�]D���_�
�I��`YWT�̌���q�
�5I|S�R�8_o��V���P�"�&tFoن���6-��cY4��.��(�
�?�>���ʠQ"Q��6/��a/���0r��2"}�?@v7hkL�`Ub����o^��5�ۡ�a%)k 5���pDs��e���F�'���L��{fѿ
�����`�!a$
r
���ѡ�;i�T
4�|���[_B��٤���
-I���jZ��c��=�
��5�Ī���&�2���ީz��M�ׅId�C��&����*���Tqܾ��3�	��J�!��Μ�%>W��l��$�*.��
�������
H�]�_�8��t��׿�UQR�G�rh�&�0j�s�F��b%���/͊�~*
o�Y���JiZo��u��J��]�)�"};�_\R��
�kQ���::
�i0f.�����b�=�Js�!f�dq�.˚�J���Z�]Fя�+e�RW�0��<zJ߮�aN��u���T�)䊛�o�J�K*���"�Q���\?.�n
��B\f�%����0��)��QՒJ6��r�P
N'\-��4'�}��Mt��L��,�XC�#�
V
-�L^���T6���
�Tuh�4�G��5q;Z����
�m-�O����5�����o;��+`��ݭ�9nm�">"�/�Cw[1��N�̗��z��4�eG�1����`��b-Bs�����pwB�c�{���'-:/@���j/U�B6��
�KU��
-0�<�5�~L&�M��H��*
� ,�^`��`���R���o%�CDxP
-�ڞ�h&3ST��/�d6�I�4X���e
TWMh.tḅ_Ȍ��M�8Nz�QT[$K���|3�sA���$��햌F��E��ǭ���2���%�֨r�e ,����q���+�6�^�Lk΂�>	���P��SR�'��3��}0�������3�b�nH
�$��P���lW�7[�!
�&�� f�yצe����'����[_
NS��2n��?FP:"
�vo�\9fy�|�Mq�Ct�~�P����J�7	$ګ�
J-�r�6�!׶�ߎ��f$
xu�ʶ��� ��YM
Ye�MǡV.�OΟ���S�uK��0=�*�E~}I87YRϞ*�gNwˤsz@�-p�7�N��#�L�t#y�V�-�3x���v+J`���0��W�
���T�t
eԶ����!�Kr{����	ܭˬ;�-�f�߷1T��H�a�V?
�ju綦�%��6�%x+�b�'�*�4W\�}/7�!�Ï���
�
2��ä��hݓbFT�
U �1'/�K;4�����vT+�ؒ�|��ʤo�Ϩet�5CLݿ���f	.�o���oB�
�T�qO�Qriq
Bv#����
-=fII���E��%>-�&�m���_��1��+��b��}!9ʶy�8�jtc�l���x��

*Ag��~+l[����z��-k�t�1q�Q
z哺[^.C�9������yTz������~�`���;�ݑ�G*���=����������%��3�6�2%w-jD�>
�&"���)�Y�@
���A���A�tŘ
H���!�A���"Zzʝ�!*�
	dBjc_s[4]�e� g���qJ�����h��P�+��4�^e�05���o߬
�HA�K�x^�gjx���
�{�-y񹞍ɗ��Q�BKQ` T8�1 ��Z��Đ�aBĆ����"�����eB�7�s^+(����3�Gq����Ta�
����L��K��(���^n�tD�rmaX�:�x��dyԆ̿�>�j�L^Ą���>�X�JL�J������@3ѯ�Zƥ����^6
�y�4�n�t
�����:C�ȴ'+�U��o����YȐ:��ChFǵK1ë[��W?�pv��{҉B�e
-δ< 
#���a.�:%���o�+���A�rr�
�T-�@�8x�
-��x�Ɣm���0�H7���h����c(�@��� ���"�9���k�b��KǼY�����{~��D}Ń�1�=�%����
D) �
-endstream
-endobj
-3480 0 obj <<
-/Type /FontDescriptor
-/FontName /MBKJVL+NimbusRomNo9L-Medi
-/Flags 4
-/FontBBox [-168 -341 1000 960]
-/Ascent 690
-/CapHeight 690
-/Descent -209
-/ItalicAngle 0
-/StemV 140
-/XHeight 461
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/a/b/c/comma/d/e/eight/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/r/s/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3479 0 R
->> endobj
-3481 0 obj <<
-/Length1 1642
-/Length2 10160
-/Length3 0
-/Length 11011     
-/Filter /FlateDecode
->>
-stream
-xڭweT��-��	w� �]��C�t�$�	������	�!���}�9�ν�gf~t���]������Z/=����5�(�ع9��j 'K7�&�I
"�®
-�)�,
/?=��+���e,`@a�
� ��� ����0��gOW��

���������/�_. K�"/�P�-����t�8;����v���6 G @������<�I^M ]_�Pw�tYT at V@0�
���
�q XA�֠�Z�r�pIB �3�
-��:�����N (�� �l]-���;�A  �����_��m ��
-y�pz�^��!P���
�dU���G�0;
�_��� �y�X������
�

-� �� ��W.K �uv��|��B��
-��
7(l��
-� �@[
WkG �B�������O���������h��^�Q:�p`p�䴂���18��E�
�������?1w�������0�aa
;z��6�j�KJ �Oe��=��$�_�E�������z�����S˹9:�Y8�
�?�
�e�X�/���kٸ9��7 ��'��	���_����
�EKA
��
��$��E
vn~��AP9��Z
���X8�\��v
�5�����ݾqq��m�r ���?  ���x����9u�U��Y��M�����D��=�����IOb������ 
 ov��R�yy� BB !>��Oֿy��uV����< F\
\\܀����u2�7Y����҂Y��_��?
�Vn��/b��^�����=�V��+�`�Ԍ4X5iN���Q�7n����:��|�JH�_�u�r���q�Ϲ��m%���o$��]��?yo|h����W�޲�r�c��֋�>�UYC2������4��B1���v|��O��ODw��k�RC܎WGP]p�!a����wh�����{��5;�^Ă�7�:�i�zQg��|�����R�c� x���L,�� [...]
Ss�(Sp�
�U��O�]�<!jG�=\���՟gl\�?]K�H�$TC~�3h�RxK�V_n<Ӥ��jO�Q%jF�?��Q���
x߼�L�q�,
-	!�Xm�a�Qr2�v�$1n���6�I�0��ޗh	�@U+,m�?bRN�A@����g�o'�em�L�7?�&� ���#��
|}z�;�k�#�$�W=���q�*��2�o�IzUK:,�������]zT�l�
V��&���J�ӷk��`ߗχd'��l��H����S�1>c� �/����g+�x��i����G��'o(�-bJ��f����
4�L�cR�0�g�E�$esj���+0���H����߿)�M���J���V}Q�o�B�ٽZHB=�ys����6<� O�y����
�3��=���<=MI��И�8�b1МP�iA����b�r;����n���i2M}�n�5=�χ"c�
�;Gq(��[�6��#[@0d
�M�*_�?��(܆x������4"f��?�ܾ
���nJ�|�-C�]|�ų)����4�</���'S�m���^1eT�&�Ӑq y����^6�+B��%�N��g�����Q'�|.:���(b�ǥl_�F��3Y� [...]
-cɾ;��گsI*p�0nX� ��9�6u�K��N� �[��
-9�����r�U
-e��g6x��4�
�ͭ����mnM|T(
[�!�e�M�˷Fn�a�v9Ǫ�^���RG��ZT���Y2z^+�%8_�ſt����\�F�
�������>�9��n��*cq��DFp�|�_���:��Nl�Ѿ�6����2�(8�t@&���`̯���j!����{��Hא�2�Ca�x
-�mv�2Ҭ�,7MM��u�/��}�Z{xF��0������MfF||��ۜ��w׍�6�
�t���O�[}���F���`\��3oDq�T�72��X��m�2�K�ޞb6"N�&��|�����,�9{{L}'-CM��`Udn��O����n�������Þ]U���宥�(gہ�G�([x�G���Z��uj-�8M�
-y�CܟzR3�n�c
�P�
i�,a�&1L�Fi�Ғ6�	��Kĵ�yR�FK2iu;%��
�nז�|R?�,(�a+W3��=š��>>q�Dcc��d"�K!zgԁ�K)K(p
o���"J���f5(�4�
S&�l���A�S�����F#f�gu>VY���Y�0���N���
u1��G��'�$��Ea_,��r��,*�!�?ÌF{���9�>�xW����
 ��i��/�p5��'���)sux4С%�&��u��M]G2�¡8G
�4C+k%-z�9�Dv
�l<s1��?���:}-vL�<�;�P�����$��[� �ù,�N��=�����w�sS�r��r�1欙���.��R�|��{"���j�q$��,sa��)>����+�4�(85�NL���<�����e�
��1��i1`Q
��O)Y��
�t���r6��d��"Ta��7��[L�M�J�p���ޖF]�� S.�OVW��4�G�]x�q(F�2Ԁ��L�"�
J�xb�$
-������Ew�P�k�-f�
-=G����C��Ko�ߡ�Z�n�%VX�񚡭
���\�+{ÊoOz�5��ֿ��4

C�3}:[�P.>��E;�5w_��	�P$f0�1�ү�1õh�!���BY�I�
S�7��~��ɚ�E��
�#-G�ח��'�|\�
��!�I��ؙT�Z� Bۋ��"I�����du[t�c�t�:���=�+B
��ޚ�`���I_eZl���#d_Ɠ������n��[�8�.Cr =��v9���;~W�0�v(�3�6_�����ԔM0�
�,��Y���W����H�F��71T,�:ߝ��ս�g�	�\@�ʶ�3uq'�|�yCw�^$�
-
�Q*sٸ*P
x;yHO��DKD�/�1
-x�j��x��e0qbe�73�|�,4��l����Y�"��l[/�U�!eRAҺ�4=��Z�����痣/mſwؾ��~����W�㼨�>�ܣ⦍����;[և %�f���-�LX�6	���ع��?�w���c.f;8__}�Ҽ!V�TR�
GB�Biv�"��C6�?�9�7�lU��L���rt*z��^�֯Pp��{0[e&X���M�,���-����TZ	�G��
0oq�n�g��F�<�nr�|N8�*���̲)۔��CY��b�ig���$[�.�
�cȬ������
-��y5C/˰�u�z3�Ou�6u;G~-����)̏I�6����D�y��Q�/
(�r���匨PD�.:dX�;wC� �K��Ւ"��a~�
Ƴ���nW��G�vY��Ը�����MX����Xˆa��V��`�
-�'
1��1�୍�e���
-i��9;}e�� #p����lhK
i܏��r�'%��,�Ԡ�%o�o�2���Í�	�
:

Dr�z\�ݞ#��R�W_&d�緇�o���������Q]O[t����|�?ِ퓰o�'K! �Z�=~H�9�b|>Q�L��jU�h}�J'KU���u�9�ql*�cU�0�
�9���-4��N�ki&5	��}`H��҃+���y�H�s���L��y���0p�ٚ-�9	DŽ����0=�H���X߉r
|�9��~�3o�ZI��q�ւ���Cs/�/Ӓ������):�E.����BQ�vzsx���;�����
�3��G�OP���M��&�t�p��3�PO���(�d������5�&Q�?�c
z����<<��=�Q(3�A��=��o�۟~�M}l}ny��iM�f����}�^�ᾨlѤML6�z�q
=1�kNZ'�^(X�gfd��p��V�:�
*�^),�\
�z�T#�V]�`K��z��js���|/y��୉���\4b��YM�3��è�Qjlaު�6ݦ[��e�
T�Sɩ:�[/{J8f��Ex~KroB����k�:n�������.v��c�
-�i���k|�q�u�W{#F*��4>�NZ1�!ț�^1XSs֍s��?EFfA9�h�����|`ۢKj%��C^�6�����m��O'B%i3�4g��i�u�tM����o[��m�
PݣzC/i�C��-��q~+ebV�2-�HWi�ig
-=$J�e��T��1�?CT�p�������ߚ�W�]X*�Eql��'���)v?�X���K�Ѳ�nr���6��/桽'.sԺ�`_fW���]oom�`�b_��'x�l*��i��΋�v%��'���nl:G,F7jY�mQ誟;�\��5g�ND1������&a?j�x�8��c �lr�n�[��,	L#���y����q��Z�&斲o-�@.A\���8
-���{����H�ǫ��^|�U��q��y��2:
���T�
-�x����Q�����l
v�g��X�
Ev&Y�����6��)�q�1R
/.��w�"��e��<��N}.�[Y�m�
�U9
k��U�f��w���}c��=$�/;p&C
>�܈�{Q���[�K{,6
�
�����4�p0VL�"b���[�e8ЪL6|��r�҂ގ2|j�خ�8P-��ު���lK�����Tk�Ѷ���ڒ�
3�xw
�>��������*`�ga]f3�r�w��]oc�o����C(���u�޶qlz��8���v�����
-���}�ݿL��p����Ƥ���a�Q���
zl��K���%bV��ѝ�6]ke���6Yh�v�����(�Ebe��[��;T�b�ze����	~�Q��w�#DZ�ݣ�wv����W`�KV��3�IR�
-$4�.8�$9oE>5lr�G�$|k�<�L�'��'�u�P��
��T��ϴBɖ#=�W
�#Ue��4��8�xp����r~u�\�����ӿ�>�n-:�>p�����˂�1���:?R�]+���n���(x��M��X
-�qF�a�i�he�6l��.��kX�U���Ek�]@��,/�;�<���b	��↡�b�wʟ>�%�}�7�=�h4�X|��L@Ā�	�S�����Q�e��#������^���ZT��a��Cy�~S���Q�$\۞sG�{�mn���tgx9 y�{K����H>"�\������L��^,l��2
��y�|�L�TV��/�TMՠ�2$��v4���4S��c>WY}M� \��c��$��nnK#����
��v��ϏT�����qcr�
c[��I;��ӕ�gb��5B�F\*Zݾ|	t0�}O5"��U�r�.D>���L�V*B*����W�-�-�Z���;1�[K�+���!��aF�H����b�m�W)�?���.'�
�
����:�~ܟ�I
��6�VAl[�G	I�
-���TSo�i���|4,g���i�I^
-�:u�fֆaC��p<\
�Q�
��J��|5��7�q\�I������p�ԋo��f]ȗ	zZ��E��p�r�%K
-;G¬�"�(��.�am4��d���@���MyE~�}
}�g��� ZebD��)�
��m
�ݚ}�|����U�N_>��8��.� �v�I:mڥh�p�f���7�
�~
v����s{�KCL����w�����L��
�q,�5n��&<Uw����xU
�K
-��0i7
~�����iQ�
�
j
-��q4<�
k��s5���I=��UXB
�����E�
-t%�O�
�z�����o�nx_߲�Í."R�[���ų�8�7C�=9�rҿ?F������x�RcC<�bXI��J����t�+l�߸:Np�Z��bJ�K�an�i�0$��Ku��Q-9�m(A�z��
��jL�a�A
�F��J`��ټ�U:%ξ��
WM�
����
-?aI���Q*I1'�@����П5<C�>�'��e���_�uK�Ԟ��q�X����
����D�YO����-�bmQ�r���-is
w��+zLn��?/��>���f�y�7�t֞'+�m�
I���FI���H�)�5��wR��
�
ًv�4�o~��(2��V�Z�7K욌
p�g�W(�^���5����N�u9�&���!z����y�.[�G�6za��<Z;�"�
��VT�P�0��.�}��Xn]VКh�g��?�I���WIͮP/�!��F�[h���,騷)�˭+��V��U��� �!���e&�N���f
�O�9��
=���sVE�b��xR�M`���I}tVbh�тn�� ���%�)*��va�g�*�k��9��'���
�k
��`>/ꀕ?����N�q�P�5+S#�+�gX?�v��K�y.��=q�7\Q�t�[rs^&o���mz�5��+.���y�&��#=�'�[7�~~nϦn�[#޷�dn�	�bDBE!Us���C���6Q�4�H=|;ن�vꏾ��N$4Ƀ���;�yx�2�]��ɻ@X3��V>n�P���Rc�;̓�:�
>�(w�\i�<-Ud���wR4:dbd:�$Y]G�q�g�P&\�'_yGLHg�?

+�
-v
-#�(��G,���;%��i�����o�@
�h���L<j���v=^f�t�p���X�8���&r;Zb�G���0�Y��QF���)Bt
��e��?�8�
-�`�Z��C���s�,00��W:X	$=L����R�-��s�-�K�|(8�Y�,ޣ�ԭ���ǒx�H�~�G�ߣ�c�0Xϴ�eҟ
�F��%�ԕ
-.
T���pBI�I�O ��*&�C}��O��=K�'�B�=�����W�f	��� �(A�Lu�Nn[��n�Pm��J3���-n�z�ֈ�_zFV> �#��k�
7��$��s"Y��q��k�������I�-�Xk�D[-L�6���*��&
:��D�G2N����H�]�07闘G���"�@uY�Ƥ��Z����؂��&�v��T�q��G���_�,6�#Y{C���쎔��?���H�Q��yn��K��V�/lF+3
\r|��W�i
--����J
��#l��|�>
1��e2�<X��F�O�ɘ������X#��+'kRx��'3*�hq�|�˩�{�a�61�1Wofn�����4�zGCL��sYޡ��]ۓm������
w-�1��y9���y7�>��?ԅQ���*��
��W�Q7���lG�3����o$t_ǵ%r^�|˫V��8�]'a��27���jFK��;�*8�04��hS��
-!;
"Ҭ1���"����W:������U��#��|;n�(Z
���ܢ���x��F��� �I�Έx�(#%u�l�0Q���
�
���F���f?���8��-����|7��
r橯��>,p���K~IHro�
-��%���A��8��#Q�9�YK��2�>��*�95��k�_����\��ɪwk�]�In��Wq2�
�����P�Z����7�o��9n^�У(u����*E��BU0j�>�%;������ub~O�x�2��Y��j�WT��?k��/�,�������x?���R���ao;�Oї���9�X�^E��2ʻ�qۘ����0?�uE��[�9�!BY���*��&^��?vP�3 ���T�ߞ�;u�
��d{�p�
-@���Ҙ�d	�&	'�n��S�{ނ��&�<�����N볋H�R�l_��Q]؍=.K��~F `,��e4�~;��n�zy�iRҡJ�
�C�(uc��4&�Z���1��-jd�#R�l
Oϓ�o���P4�1Eue���4d2���̜�5j���Rx��u����X8�J�zFSF ���-싖�ʹ�T-*�mjÂ��XQ�������E?�
C�ͧ�Q��1�72R�
�>��E��k��G���R�Z�G�ԯף�q�����t�
<�����9�LY�
a�������jP<3�ھd�'�쮈� �?9�@I�_��D�*,yk7V��2�7q�b6��H�W~)�k����L��y؄z
.

����\���nǏ
��y9(_M��Kz�4~Vh���"GC�@�'+���T�
�ΑmBoP����f1�mM�F��X_�3�O[l�P	�_o䖈�/.KlL�P��$����o��.Q�=`�����~�Ũ�����.��sFlgZ�w;&��]>�)�
S�	2i���j���675L����
|H8}f[r�UI\��62���t_fP�TПpb�ߴ�NYA��]�6�����'��bL|�*
��>wDp>
-5z&F:{��B�O�ɧ�1(�~T����{�p�w+��4w���^�
���'��?��e`�fʈ�V�
�L}���mpOE�[a!"g�c`����yZ٬�eD�l��'��!�E�BJ!d����yO�
-��T��6A1,M
-�;�{1
��[m�Ⱦ� SvCRh��
J���
�*�0�{�o�ζ�-�&�
,�F
\
��o�_;xN�;c���GM�Xz�u���L/k�@ﲧ�yBa�̒=�hq������간<���3q��E�g��1��~k��ld9�
r��D[
-v���0
e�r����=rV������.p".c�ϥ��*'r��ہ��s	�a���M�V���nih_1��U�����6����}��Z�ߞ���)�~\X��s'׬�S�G�K�Kx��ߩQ"�Ķ������9�x.˧J�3U��A7����
�T�u
-8���y'�>
$�9-�xNi�]�:[�q>8�l6��Yj��v+C�Oj��AD�S���C�4�0��~�}�k΃e������7:"�M�0)�E�
j����
�5nV�H+ga��4�
���
L@��>�[㎯o���!A�VZ�h���Q#��m���O�iy�^����f��R��wՈ��ӆ��N4y�U��5��⽃����]��
-�~�
B��0\*��(��?�;^�Rm�+-?V�B�����[�?d�M�+�����Ax��������:?G>S��p�Wr)^�i�F�!���%1\*K�eF?�:�tc�s at n�8yu���p^�Mm
o��*;��/�Q�Sy70U���	
�p!��
-�Ȇ�S{{ H�	�@�v�E�YF����;J�a��Hrdj[�h
���)��&.SƩ6݉n?X�E
����tʅ�n�kmРY�l��jsS�5��������<����	O�G�V���%6^�
���؉��1U9}�tSĻ
J;�5ن�'j���

�y.��L��l;�]��n�p"��y�%�G��	n�c?�'�2ϗAd���#�o�������c���+�{�j��u�m>E!���g
h�$�O60��6�|%^b�ۣ��aM3ؑ��
-���%!%.�T���s�v���������]/bp����Sm���!&"ɕ��
-·�j�Ф��0cɼ����0
��U�4�K�y�Zt4�V��L��[����� ��cF�
�[R�e��4�
�	y�0�?S}[�|��
2Ќ�}��HGp����T�aS+��ô��X��Ce#F>��A�[��`��E�d#�Zi��:v�M7vt�9U�A�߫�hpg Ĭ(Vuq��V)���Ձ�(3��!]�@cP�'��wD�Nj�?�?��z��
�n]BQ��h��E�%��J"39�B
R݉
��g"��
h���>��s�1r�qY�9i���}oL,�B��Y)iF�aݷw
�2��TT^�n���-L?'6\v�&�z�>�8�`	�B�)�x�FH#G|�
W|�'�0��3��OyG�G2Q�͸�����t�h�$�# |h�[r��q}��������q��xJc=�CI�[���B�D-�+6�t����[���Vƀ�m�;waЙ��JG�
��W�
-X�e	�B#5��[��-���}ӅAk��R�Ѽlى�����܋uV��%p�ǧ7x
-
ehh'3��m*ɳݲ�7$�"���EB���-�Z,_�T�E�����|0v��:��d��,��]�C��׎p[�Y2��0ߎ�D�����/�B�0R^�n�wv�.�M��U�0�c"6�	�U68�wD�ǹA�0;����O���]�i�ʪ6ĉ�ռ�
N#��
$�
��W���j��-��x�Ͱ�eO{���Ud��G�Q 8��hC�$3�^tF�5�l��$��aoB�4{e�X�����L��>vC4]���	F�8�K8��;�Y
�}R��^`'�qj�
�;�"�5c�<�\
�_�?)G]�[���
%`�
��g�XC�88�Osll�Q��������7*O�MUt�m
-��I�����N���ș�[v
���^��n?�xNJ���/M4�F��	+Cp�f�֤�y)S
��~B�͔sa�_�������H�~k�
M"w(A{u�`�_���z�!�z̀0Z0�j̮a��Maf~q��۱9&��?R�]�-
5@�@_���W/?\6�5���,>}���3�.�ء�_Qv��b4��C�m�<kP�K*�n
G���-���;j���S��[b�%b�ah2�E�9�V�{_� zч
���C��	M��t�j�e��-��[���5�5`1�9C�g�A�)�N�Q-�s�C�}���i)�6�
-1��o�V�M�sI4�e<�
��P[%c˭w�e��Z惢Z��
���L�b����P�B���@��5�k�N4N^���"�5��
a�lF2=^�C�u�fs��F�6&L�Q�[cq��u�.�u�h�j�Rp��ej�-���^8U�%�y��u%&�x�
�r��U�Z
O
��W at +T�=���o�-�?��J
-endstream
-endobj
-3482 0 obj <<
-/Type /FontDescriptor
-/FontName /UTIMSX+NimbusRomNo9L-MediItal
-/Flags 4
-/FontBBox [-200 -324 996 964]
-/Ascent 688
-/CapHeight 688
-/Descent -209
-/ItalicAngle -15
-/StemV 120
-/XHeight 462
-/CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/a/eight/four/n/one/six/three/two/underscore/y)
-/FontFile 3481 0 R
->> endobj
-3483 0 obj <<
-/Length1 1630
-/Length2 19992
-/Length3 0
-/Length 20838     
-/Filter /FlateDecode
->>
-stream
-xڬ�ctfm�&Wl�۶mT�<���m۶m۶mW�S�����c��?���cM]׼'��2����!@��Ɖ�����P�����Q��ZΖS�V	`�L�W�
-MF&� 0p2��1pp��	E F�LL������d�¶v��fN��J���4���Dž���?,#
�Mm��qX��Yl��B�_* �Nf Bs+ �������8!���*�8��``E��lhenD(cn�qP��:Z�[ 4��16��5G��X�����v #�a 7#��?&B;�������BsGBS��3p�%4�1�r6����z�d�`������/�����������߬
-"b�������܎�̈́�&=�m���i�_��0�N�6��N 7�r��
�
����
f�`��2�
�mL��B��������/�_���}�/���Y��+��_^��s'G��	
4#�ߜFNs���@���+�6&���
��;������Q��3��00���r'4�@���:�MIH��2���
����B�������������
--�le%g`�w�}c�
¿w�P��Cce����1�6�r�?E�Wou����?�I:�
����_j���4w3w+�;��X��ٿ�6� +s�_n�5VBZF��bS137������ 6�����t��~z-	5IE5��́�����EpRq��[���F���
-��	ٺz�2�q�2q0�}
�db���I�/ ���e
�
���훁�_����?%��#jcdk���(;��ݶ����l�����
��]����� � F�k˶F܁�iN�9Ó"��{A���JT
-�}�m{|RCw9+�?j������ܗ��>���F{ѭ�{��y��I(��~v�S�����]�Gz�,��i�1�
�M**�@�Mw0;@����%q��E%}���6J��A�DlB�-8���p��|pldx�����:;��� �;�(��]����
�ͅݱr)�E�)A���}ٙ��)z�1���[��A`�0F��:$&��0���`\xFEJ��sY�b�m����+�2c�3�
�1bY<���u�
I�B at bp1C+8�XB��1MQS-�w�����L�>B��w�<qO�(J���7>$o7P�J�@]օ�0�9(m�k��=����E0�E��7�2�h�}
l��Ft��)����5���M�]H5���d�oX!H[֍\��9d^I�-=���SEY����gN���� ��5%���J�����r�Y��.>�
k�i~E�j�V�d�
%g��'r�e>߰���t�W�K
�
v
��_�
�E�~ң7e�:��ր�'��Њ��eR��.j
c���#�1��C�
D�$��u3��.�'�����K�RlnN�A��g�so�g0��\��]C���
D�Fr�Y���Q5�z20��_�b�N�[�������L��-@�L=�[ڋ��Jܘ�Bc�G��H&K�����/�T/ȭ�Q
���-���)_�YH����QQ�A�P���<��
�X	S/0{_Q �8Wn�����9^�6��U��ņ�Q���
�e/R��>fÔ�ς��R�� ��{o�/OԆ�
-
xLN'�L&H���H�8�~�,g5XkQ��R~!�7UWJ�����f����̘�tS�gja���f[�?`K䓹V��|�ʯ�d�Oo���1r%�G�_w(Q(��z��v��A����F5:�p��G�8|1u��O��2��8*L�i�J����߶�S	UL���l�����o1o��MxS��8���h����e�AA��,pif��W#�gkY�Y�R��
�	g�ꌇ

�`
qs0B
�
�e3�MU
N�^�Q��j�A�<���Ol��r[3��Х��:���Ш�L�E|	�FNp���H'�	�Lf�㿼p�"NTB�s{�F���R�auD��ϦZ�=C��K^܉wm�
��
��K����)
SN�)�
�!���'l�
�x�
�s.���X�=
V��*��R�����.����'�{r�
�ew
-�%�\ߝ�ٟ}��;�2ټ.o�.�6X>�,�������}��s��f%c�u��Zk
B�����_�ԩ-���R�"@���0R
.���f
ḇ1�Z=f�0�����b6}��~e�o�WM�;�q%����`�`��¥-�ƙ�Ѕ�؏q����!��{��a�g� ��X���~�Ј5�n�s��k��Sˆ�G�ּ8�2�
-{��j��b���n�c�8�-��Ϩdp}��Aӄ;����OԪ=�T��E\N���Ϥ	bg��{�j����{1 �F�Wh�j
�v7p��
-i߳Y��*����1«

��zRh"��c�]>��KՅ*��7b���’&0���7c���qw�to��)�.KZc�hNI2@�.��Sg���y��ĩA
-�E��ih�(����)��Cן|���Co���	�W|u=*��ƾVrq���.�_�\
DME�
ۄ~f�rX�'ox��=4�LS�򛐂N��+ݨ�o�
-	���)�1F��9b��
���������݇��!�ӣ⺴#���NPêl���y���x7��ވ���������LI�4XXI�&��}!�tQ^ڪU
i0a$%oS9�X�����-v���`������Ƅ�!���Sq�I5>�
e��ѥ�,ڟ��Rw�].aD���Y��ƸS���-xd�@ǩ���Ö���ګ~2��s3��
��b����KO�j%u}��Qnr �BK8X2��- Ý����ד�ic�͑(��-5l��P�2i�
ا'�B���kC>��4<J
@���O��U��ZHqUS*4@™d�U�|�3�[e�ٔ�a�1��)�l�_j�
��� ����I_��$��"�`��麙b�^ӈ7�]m
-I�/tK2�׋q���/ߴXe�ݺƏ��i�ED�j�jrƳLt	���_
W
�����&h�*��
K�:��aB��qF�z4Lf��S��kM�*-�!I�/�
5x�p�?(,��}q�D�T�����
�/LY��Ci�l�p
����
����D��~c���$�;֡�+�}�
-c�*4�R{�)M#0���k����y
ļ�Q��u-��eh؋��C6�3��}P߉�#�|�m4d�6\�h�S=�݃`X���c%c�ˇ
ȠX[�����w�N����r��H��KE�+ò�"���*�;�U��o���j��l�YF-��}9��
�`G���
T�je-	��R��MK��!n�2�c�
�
Q[Z�Ů&:��k�z�FS����e~��v#�$`�,"~Ė��[J����g&�yA�8��6���Q:��Z\v��V,���� �%�:l�F�A��[��:q���S/j�M�i�_����
y�֭�P�O��l�
6��IZ?�P��O
�P��f�
-�?�JioϿ�W�Ic�~�l���վ2��C�xT/�j'�$���
�u-4�:1A�{Ls�[��?�3���~�	�A���{���R����
-=���� �ʰ�l��az�UA���jC��ђ�<''�1
5��0��"vS�ʣ�Xu���$t!��OJ�
-h��z�t��P3
@o�F��n.�i����4]
}������N'�^>���;o�:�����3��9�%1��rV*Y�O���+$��, ����P
��]�����rrO*
�z��'��r{���fɸ;�"�l��I��&�zhcn.��j�M�b�!f�<�Cn�sr�gB�
ҽ�/ĺ�U�F��F�� ����r�
7(wkN�g�̽x�\�)�o ����P
9Iر�dR�f:��
/nP���I��\����!� ��w�Ww�s��L�;衲C��Ȫ� �C�֚�f�^���9�=d)�zu���דC<FZH�e��
^�um�����A�I��
��t:b~�i^ߏKK�7[+2�Q'����ـ����$#7+��[�Br	@�{ˠ�w�%�����7[�IF/s�
Q��"����aE�b�U]��=�������G\��+�o�
lb��H��$��"3��2�m :��� gA�|WHf���\F�Ÿy(��/?F�9�l h7	 ���Q����%�n��
Ҧΐlg_<�P�nb�R��ؒ�w98�qX)�"9�L����e�H�'�h�8lh3�O���D����GB�����a�/�Мs���L�HυA��ry������PLʮqf��D#�H��=1{��
�l?�Ϛ L�s�?�_2~�r�h��8w��$���m{�+?n=�,:�'�zߚ�ؗ�˲X�^�����H|�
:� u|�6f��6�s}����]U�O�7 [...]
��Y�m
�XkT\¢�[� ����u�ʚ��k-�h����a�{a�I�L�&B�8��L��W�,H_�ɹ���˩w�>�=�1"�}<,�'��s�����m8�(zQ�f������PS�5�2ȇ�8�妳�O�28@����
K*��~�k�bL[�5�a7ݬl�E0ڣ��M��hv:*��4r恙�-.\�R��(9�)�D��V��g�� �w9O}����/ȕp��AN��J�����"�^�@�:�&r��
YO
�#"�$f ���>nR x��0�_{����?�\U2��	��pF��AL�=~~�8������FՐ�Z�g��G'�Xo:;HA���L�[�z���ƱO�&�����s�L�Uۯ��#Qy��<���ߤ��/�j����r2��umTb�Hź⊔��A��
OS�w����	��eiI5<//�y2������9���]`�	��n31$%��'V/�f�NW�E<�.�^�]��Hɇ��Яxr�pVKw��ڋ�4,$�<���CǤH��O
%�~�����b�S_���
U�u$-���"��`;g�aѪ��y �fUyf�,Wy�k|U�#�
-�.��2�U�=��q���#rn��UQ!v♟��
I��|B�N��$�{��D{c5��3��F�L �qC\\���b��TDWU7�E�F�O�Q�T�-�,�mͷ�����+�~-�˲��b�ME�9N5B��u�+�~I��N�r)+�b]�,#��q��	��
�i���֎����'6
O��y���q�������dd����|ޠ�����F�A��Q_"/�Yސ�I�.?�k����7]��Z�_5�j'/'O

Q��pn�j�Z:���2�m�T���
-���u�o�5��H
4�i�qu,.p7h��U��ՂR���6�QJ��BI�&��^�O�X��;��=Qkr���ׄ�0[kV&�4S�y��S��J���8ِ:�q�-��U/n71O�]ƨ��{+�DH�`tK��0"�)0q�y�9
�y��PB継�k�
@�T�M/

���oS{�]���}
L�
עc	�[K{R
-V���-�g��)��O�оr9ԂY��gyW�� )�?��A�)�,�1`6�29o�V
-�x�v��z�m�H�P�h<SxD��}���n�pk���
#з��V�J=P��ő�{����,]�I#�Q����j�K,p[����cD�=*j�{a�̡X͊�m����
է���Q��KN�ɢMA��_o
O
��8 /N��V�͵
V�*�:�3�yy��Y5�����vΌ��^&����}'4
���ݖ���b�D�-�O��}j�
�>ݪ0�
���J��k��o�|�v��,���N�z)���YR=1�����6��s��q��&��T�9�
렍����^����Α?��Ε�b|QQF��0�G����-z痼�;
-�A��@����Z������K�:pd��]��o��gl�&�L
-���w�
�Hcs�ڥR�$�?���B���#�kq6��~
ICm��@3��$�-�N��R��ק^��e7y嘄�*1` ��)Ž��B����XX�N�U����r���VigY�Rn����~OE\i�oBJ��*m�:"vD�8:Z���&�������'A���^�w���Z��[��f��V$����
'�_
-���5�I^� �h��uݽ��C���dpͰ+^�,0��oe�������͎�E�6��1�����������)�V�ƫ�<�]l�av�8����k�5ZWik
)
C<��"���-���R����zA�#�M�"
�E}�u3�Z2 �ʍ֌ZWգu�L��y��
-�<}��KD�05vN��Ն\��7����D���s�R�Ky��>G�;\��
=s���!�-�R�s^፮T���Tʘ�)A>��G��2#^�-���[��o��U�j�-���4X�?O8 at G�[�27U��	��/�z��-І��Fnr
���{�~�~��H\�kP�sg��
@kԋs17�*�\_٧�
-<ěn�_~Ԝ,=;4}[��	�
�-H^�f�Pk2�Ԇ��%,K���jXp��=v���ɦwۘ�3�Mt����w
��s[�
-�3^�}�ŝfF���=$o*����=��+�Z�����k�~��E>�7�O��}�^x�M�RŜI���3K��2�Wk,>B�6��*����?��N���&H^�5��Z�zi�mbW�Pfan����͒b�hnL���


b�������
��5T��c>*)ۆ����)c�V7י������;-���D)(��]L��pH���e�a��$��,c�<��m�j�XQ ��$@	�4)oy�2����$�t�V(��(�E
я���@;L���I8��=@�8䐜�`_�OP�%�"0IL
t���VKUA
-j5�
�eXnF�&7@�,�L6ǯFe���W��%�}pLʕH��'h�
-�`X����&�K���gh1D���e"������42�s,۝P�w�['��mQ�:;{S"H�b����
P��\����
$=^�5�J��B���|��
-���
蚚�i�đ���`e��Әʿu77ٲ�/4<{g
���K����M1��Q3^��3��`�
�b�yr��Q��nӦ���~?�

h�;P޺ꝟ�+��>��"e:�y�",EӢ��~�����Ͽ��ƙX5�V�0��C�d%'O��A������^d���"���:�a}�x��`��aC��z)G������[�4�̠�T4��" �67뀡B��N֡Y����xd
�����-}O��
�"�Q
̂��+Wn�i�	. �t
[�>[��&�0�@Ɂ��3pb�]Y	�^q�L�u^z�a~J-$Sz3�B��zB���d�R�}E��#}AY�Pey�R!��s�,�E��X^�*ߢ�u����d
-�b����d/-Z�Z�ר�qK��Ģ�~�aah �P>7р/��n�]~�@�'e�_Tj�ܸJB�{��²�b�I8�:��0�PR�Ƈ�X�Z�)Eg�%�p�R!mi&,�`���
B�[���~�I
�$� ��ƛyЃh��k�����bM1���Ĭ�U��٠d&������i�s@�[�ĕu����{�\��c�t������}'�Sa}؊���k����3Vc���
�ա���̋��22�K��2 u�� 
�!2A�9�w[����|
6"�v��,�I�%7!`3¨%l��V�G���'fr��aZ�j�����=�5�i�H�9�ߛ����}֭<5�iY�k��ܹG���<w��>1D�B��7b���T2��������Q��I
�C옯oP'q���zd��z<e������R
����f�����
�NIŕ;O ��cޓJ�q�0ytBp�C̴-�~GH5�H�+��w��ʶ���i(z���|_�R���݋<@���a�F_ш����#��w������0���]��|/ ESJ^'j��L����Vp?�B/�����ҍ������0Hi."��$�<W��׫�؝Z�6$�)��{|&�P��|+�Ad�S�#.�R�K��U~�t�
�s��&�@�1�ɯ
��2̯ �7/��
�y���'�(4��x��x� 7��ŜHXO�ֱQ�o�g���B��K=y
Y
-6W7
-��뢐��.��,^T�,��%�bH��ð�'a�@
s/Gˤ��\B1'�C�#���I+�
-��i�[Al
�������A2� �5ϕ�}U:��tY�|�
-��!�^�X����M��'K���p����d��
�kR�]^3~����O�s�?���ō�z,c��tK�
�-0�s;�7�
W�V
��	�GM}Y���
�CK��0����Ou}�ڝn�^e�c-}X#%�Ɛv��h��Q�q B�r"�\ca�����wDVt�Q{� �T�G˔R��S��d^�2$@�g:��HOvmoΥ� �z��%�y�
�D#�G�D!o}
cO5��?Ob~�v.XBc��!TM3���]��(�'_�/h����aE#(��,M5"n��E<t���m|�v��kO���
��8�}
p���O;�ا�U�%
���ɳ���vm`����>�AMa������Z[�����
-|�m&`���ڸŢ��sZ�ȯ���
�<����**5�g�h��F c�k��2�T�aѫ#��|�J�ۋ����'F���o�}�C�[�����n�O�r�+	`~z�_��m�X
C�l_]q�zC�B���P�=nw���&�����oH��S��tT92.a�����0A
�R��O�ޮ���r$�(��gQ��=�6��/�
���g���7X_��"���y\p̛��:��
զ�ͣ4{!��`U��L����U����HЍ��d�Y����=�9	*)|��Y/6ȶ�;q�.�Q�~2�%T5�=�Z�t�E	D�B��Y6!���P�w�=v�;��oGdp�s2��<;����
��k�Ӣ����VQ
0m��[�Y���|�}]K쒑���+�X=	�c
�>vD�nIF��!�\46���D^T�����"�v���O�SO�#���!�y��SS�z_�<�h'Q�.{�n�J_��۵]yƋ�b<�������ɍ�O"i�!��t��������?�/�΃�S�l;4+�F�5�����ܩ]�cpUGr�&_'���$m?uӽ�f�~�Xk��Cq����\���yJ�0H�k�b�
��
 8�&�-����d[��$̢���ap�(F3�8!��}‰���%T��h�� �Znې��4���~9[�����/
��-��<�4�	m��EA�#-s��4tj��y=�U,.Z�;~y�{M�e=&n�M��H�2ֈk�/8w�Nz0��Ui���An�,
�cx�Z����Qĸk$�=���<����sP
!��•ä�0��c�s��ĺ����0!f��r�Z��M^���(�<#���!@^C�%����H5���}L����z|�̟��$6 [...]
-���oB�<�XX�t=¬t���F�w��Lc��f�g����!T߈�`��I�p���h�L��2�E
�16�xξji�
~%|��G�X�6t��qĉ���S
6�(��2s~��ۏaNvY�H��F�Q	]lxj�,.��
43gav
-"�`J����wMPF����	�,
-P�1a���{@d�|j8�P�T�
�>��3�|ǏNt
8v=C;;����i,�h�V���"<����մ�4iT
-)����)6燋�/�ۑ���@�څ�GP�)�Z������������4��_@^�ֳ��\]ȉH+{Q&Uo
��4�@r�^
�&����6��c����1�/f'���o��/ O���V�]U�s�E��oK��
��v�k86 ��F9
N7--RHޣ��5�I7�qV)	6}���m������	��9�Y���
��&niY=�yTC��~B*L�Zd<_�<��S�چ�Y,�>�k 5P�f�w
0:[�̄�����E�ln̦�>w,�b"�S|���#
WP���a�
(�e�m1uK�X�,޳��3+Q��U} ���z9��4QQ�w� �J�j�q�nj����6�M+��_|m2{h��J��w���Fb�x���a;^a�A�?sF5<�di�D�87����x�-�P=�s^ 6��Q>���R��5�/6�ez�܎A�@#k�*b��zd�I��"|V	V�W��.�!	�GL��%�8�b `1͆��b
-L��w� )�d�v�4�1/�%�V���OP��VP7�3�c����0q7z��o*
П�f
-v�K_�F6��=,>��Xͭ�r����V��>��|h�@��[�I~p���+�Ʀ�i����qE�;�����E��PD��T���9a�!��kA��ٕ*�1�6�/#3�nF�x�>�1I!��:,���
8�vS�]K���h��>���Y����2v�Ϻ�)#$���8������'��6(o!���o�����7��������B,�	%6 �
ʦ@�Wn~��M�q���UW��7��
n�7]��V ��UO�=�w�^p�yf�x���wX�}w!�lľk��E>��ɛ�g��������8��te��u��M�ޜ�`�1�Q#J/:�}�rʬ�!��p#��ґe
-����c���蟟D�lj�jp:���k��ݬB=���9O9]�E��4R�*D�Az��?�=�:��{�#䘤?�C��9����`n_���m����r�[�֠&Lۥ�^4iB,f$����i
yh
^m�u�i^ߓ~��B��V�
-�pX��0
m>� ��N���]e�2�hƜ �.�v��3��ӫA���ɱH���"���L�v�;M{���b]A+��Yԥ��ہv;���6��Uꛑ�O�$d�&�
�/�d9T3�������ʟ
���գ����l���ls�-�d�/H�&�`��Z�r�m]�lꎿ�\�����AջΑ��5����{����3~������'%��?�}�eh��C��5VC��ڔ���YP�����?�~n�F��������GңU�׭;�d�����B?Z�pU~�Y��f�������B�
3��gG	E�m��
Ć�\rT,¥F Ǭ�R�?�E�c��0��b�v
B����P�ǻ���^���K��<5U����4������.`���������e�K�&-BG=��%ݯ�<��~s
�Jؓd�!�
����_�[;��
�p�:MpQ6
-�
�3��7C͓��u��
<r*Ņۂ?�\
�������C6�
�!�4�/
�'�Ms�`(���{�q<���;���\C
oϜƪ�>N�ϊ�uOM�
ESyU���i��4�-<G�|j�_�z#B�c��<1�I@�V2�a	�b �D"�#�K�-�x鰐�d�x�(
-���쵼�3�n�Y���_j�&����Ҏ��|���4�AVW��������L��DSi�sW��>ܻw6�]�F#�M��9��9)ߡ��׏�0�Ԗ�
۹:X�]HL(��
!ַ�N^��,j(�5	K��%��6)X_��no�[�qCkh�V2)��P���!^�q�N�D���|��%/+�U���.�mK��0��_C�E�h���?��ܞ�e�K
�b��æ%iC�S$�L���w�9u<&��L�?I�',��(`K�Jg�=����׏C�.˄G����Z�:���̰����}
éq��c/���6�����0��
����%�N�m��[ ��,���ԑ>-��犛�@���F�����!�>�gv'# ���*
I�a7 K��N�н�Wn�W@;������vc
��g�$��("
Ps����� +�b(�
��k�N+,�jyi7D�t4"=_Z��Wo �֍
X�'�}���f?ds��ρ��߬Ւ��>+v�˩	[Y�m�γ?�iڅ�8ɗFJ	�
���ˈ�DU)T--���c���Ä֐ҋ� ^\
�	���׉_
|��j<�p
k�����<������#�$z҆j$�[}p��yA� 
U�h�����:k��?

l"V>^�D�
�
O�[�Mݸ����(o�d�T-���>ug'��
M�u€�O��ЎY�G�Θ�r� ׶h���2p�[�1��/��F{~E�3�]�ȝ�qFzC�������}a� [...]
e��"2���#s�����[��"
{0�������cj�+I,
D44�ixG�+@(�X���Hˮ��P�'�4X��}h��T(�����6sR�Y��bNu��}a���
����`#�~\�[�֯/!=}��F�T�4��Ѭ)'��
���wP��#Lj��B��"p>P�+��}3z��AL:���j
#�K
�0����O��
-���7#>���
y��a�>����G��[W�
-�a�Q��^�\�cv�à'`|������J�|�,4�^O�P�D�Q���1!�NΊW.MI}!�8%�7"�}�l�!)���
-8����:�
�*����4Tg]��K-7��Ǧܺ�g.8|���G�&t
��;6��ez��F1��_�f��m�`.A�8D?b;��,��'}�<�4u4�a���S=^��(�1������&����������eLx��c�=6���S�.t��u�uC�2
$�B/�ߋ.
A$Q�����z,�5�0
�K���\\�
\X�ܙ���r��
�S��tuy��]J?�q�n��⨒

��F��obz����M�4�Ze�#if7��M�Q9K�
O���^�53�`���yts�M�AA�9
-��,�‘P:v���q$[�:R�&N�h�]S��Q������~k���9U��3S[H}qwrʂ��Jn��d>z�
m��K
EA��y��j�cl�y>���q���,�c�7�3�s�Ү��ؐ�m�Eg�DW�h�#�"�,��@i�<�ϴ
��G9\k}J<����������ǙI�
%i-[��Fv�
����g�������R����{-�(f��^*�@���*�3�uSl��s�$J(���F<y�&,�6���`k-2�7=�,��0�r(C�	�
J���ayn=f��������8f�
����=�q��
-;��o�����%e
/+
3�F+݇�d�B��Z
�^r�ƈ�5�Γ|RC7�cs>�Y���}��
@���ԱXL=�
z�����/ 
b�*Q`n1m��Iݎ���3�\~BL���{�C1BFIF
J���,�I at W9��>����ΟR�N
g�f�I�
<�Q®͝�?�y%p��%���#�i���a�7�c�N*�ʆ�
-r�����e����`�9r��t�
���q�mj��r�Fd܂U�:��~=���2[2f�_�LG�
��RN��d��/s����ջ�Д��Tp�wy��l����7�եp�ГMn܆�e<�f{�s	���ϟ�\>˨���|�7�6
�%�^��CY:�gfz��P<�=v���i��8Ds�\��s��"c&k㟼�K�YJw}txiJ�eg�^�̞)�v��q�J�4
G�tR�9��4�٢S�8(W����<)â�Br,򨕜QO )�.2;>3��ূ�!.-e�����~�YY

�^c���뽌��^�JO %�\��hA;��~�"Y����U���mt�@
-{�R���
�0���e�����C+�]7�y;����U�[�2���Mb`�+Lv��E4˚�0��T-.�o`�va٭��[|���I��!ye����t�(�j�p���������9)�|�D��*u~y1(��ry�
S?%�r�i�ZID��h�U�)7
���^�q����\v{�Ȥ��r2��U�Z��s"�	�
���~����
-���k[�
�
��
�_V
��6<;�J#�Z��F,0��VOGMaU�`7���M��(˯:2i#����>��z��`��
�;��.�* �t{
ڔ��c)YfC��c�	��e�s���,[�S"�^�PD�\�0.I�������?�2�ƒ�{�سa�
��d���<��a-�s� � �D�	|� ���=���iŋ�^��3~l��[���
�"��5Ι�)�nM�Ǡ�\�W;�4+Z�U����
�el�����o
(23\��/��j 
-a%� Pʆ�Ϙ��_���3�:�x��Зj_
-A]�q.�oQ�o
�DTG�'��;�t#-
�m�A��f��@
�{��Do ~�� �= �aA1$'��;�V_��QA��}�@H�&4���h��hI&m];�;����}F�hy|�*+���P�T��@����@����n
�šm��4Ni�$-|�9/�s�Z_{��"fP5 z��
��s�JNd"�E�u�Z��	�Ty�W�0��
�$��d� B��.v�k��YukI�����^�>����`V�WMϠ
�*,[���o���P�
cg�n�h
�2�'	Z�yU�	K���t��N,��pa
-*f����G]Kr�74�w!�_X�U'�G���K�Ͱ��Q�s���
���^���3@Г-A�:�pR0�r�\������'[,h�"�H�)66�Y3�`}p��ᣊ��X��ݠ��d�ji�����"�&��� ��
�T`%�{`����3�G
���)���
-��k��
-��
�b���^��%�
ޓ_Xsr
�F����
��Yu�nj�����K�6���"���C���nݟ��@��
-�
�ڮ
:���qkl�������
n¬lY���
l!� `w�o,��ݣ+Z��B��0X�3@�,�PcxV��4E'4j���3�K��^v�5��UL��CLN����$���`Eܣ������0 ��pWLlg7��=�P4iZw� NPQ�z
��Ԫ[5�7���֚
�����P�I�a��	�bn-
M6�Y�M���kQ'�_\k'd.�A��u�w�tl�/.��|���!<���Gԃv��~$�wY���ˉ�Ӗ?�ҕ��??zګi$4�dZ����݂%<��d���`��3�vļ������h��������y��?�.$W^��ˆ{Ч�V��ͩ��n��3�t��� @��:]��Y9�K���sլ��V���'���B�7�<��HA�*�
�<��
Ke����60N�K=�����MU�ȕ�����kT&n�ٝ�N
�4Qdԧ
���P��� �A%����5�(�]��k#� ��Puh]Lw��¼^۞���#��QSY��	��<�+� [...]
-Q2�
-`����CO(y���c>:�DN�I�lfM<�-�<8�-�+.ޯ�h��|6Ʉ9t1���g��1�ayĮ� R��Er�i#qGM��q� M�41�z�Q�U&�P�XvWA�rV��������!|<�*%F��8}2�;����)�	ډ�@��z�C�iԃO}�"j�[5�׳����:��/�R!
-��L���bS�
�!�����X�GP����f0s�4��{M�^S���	�#��͖2g5�^Z*6���c<�~���{�QPm�c��cnů�&�#�?ԍ�<�B�g�ߥ�p;V|!8q���ǹ-���
-ㅤ���"u��u4L��"�q�k���D�]B�[�
�l��A�
6��G�F�9�ÓC�
-J�7�W�?�Kt���ĚL��1SNū���Fn~A>S�b��
�q��J]
B�/lk�+&��d΍�8��)���IE�4>��suB�d����4
��M�`)���9�� `��J
-����Þ����|�}1�iS�Yl>��]� "��i��;|��a�5�۬���J�gT�	A:�i'r gw�_C�a
ְ
�l� a��n�w ,J�U)������ZR��!�;� N��~s���5��H��%}��y��/
-)HЉ�����M�����S�+���"�	���,�x.OL�����*ү �v
b0T�t�n'a
-��KJH��|%,��eaХ$���׶m�$�j��]�����%�����z�x���/nr�Y�ܺ�#knS�ty���{.���Kwp��и��F���&(�
�R��+t��P|-c3sg^�����c�+��u��hS����7�
��$���x?X��=f�XP�3X�=�4"!��!����ŭ{��-�(VOO�^�r��1~X��4V�5�֑���ET�D����m�L���EG?C���
-
{�r�k
U�`�j�-�"�.�l��ڤܑ6�Gx<yڬ��V�I>z\)�V2%�[Q�d]px���
-���u+|"�!a׶�YL�m�~
��%�T`&Y�Z�5Q�م�%�^�B.L�����I	���������a�3�	��ݟ�	^�`K����
��z�#Ce
��
`��
"};DJr�-?9M�Q�:ց�
��=�?��;u=9fzT濩==���~���",�'
W�eL�9���i��ɻ�5��?��/��nN��ma9��M��4���
=�PI����$��ELy�
�c����:�9�B$"q�!X
����h�I�TL[	DM}���ω1H��&���'_
-X#�	�^���k���8�L����a}龘C*�f��sjI����~=3��+�U�=@�>�4��W~���InY	0�I��*�:�w�A6��~��ֶ
=8��蹵zM�ke���.B��d�{�lo��8������2��7A�=���TP�s\��{��X��I����{#������em�W�}nW3�����ff�l(	�����L&�;M
`�1]s�pRC���D����m|�U�б�W~r^����3���5P�Ve�P�t!�-(2�[2��13�}��iBo�V��	Jv4F Ee�
{�l��U�R&�X�!R
�B5#�GUP��+L�|��s5����?_����zE$m!��H*�7롮gƩ�Œ��,�hT2R�
��4oB��H�ak�?��=p
-3�����
�wɱ
��O��M����������IÇ��΃J�tE���㮗˖�ao�rf��Ϗ#ۻ
+F��������ն^腲�

-�8zUR4�$ɇ-^qm�*�K�@4q���M1L�t_:
-�^W�~����ɏ?眯�$���ߠ�h:
�O��ޜE���W#�'5\k/�������
�Sg��Ë~�_�q��b��V�K
-ƢӅzC 
��B���p&�
L��
�c�/�5	W�3f�xs[L
\��\0n��u�:!d��8
zi8̢��9�^�H!�s�z U�r2��}�q�k�F*��>�&�B�L��Hۀ�=�_CQ6��m����eTcP�.�x�M�"}d��6��#�D�k,���K\�����ݕܵ
º?Yb at w�*ݥ
ȘLe
��K7��ryM��\^�j���&v/c��(�L���;
��A-Ia�\�v���Jw�X����#�~G��К`M|7�^�w(��QR8�63�6Hq��B���F�8֞��]70��΁Z~����zH��:=�U����U�r��D��uC8w[�#[>Qwy�f,0c�
�^`"�g���_��dX��
�J�Դ%실Y
�U����(�EE�۵m?�a���
�#K1NᎹ�Y�8c��Jc����jW��l,ma"�\� bDl.�y
���s�D�ϻM�tea�͛��j'W���hOd�B#��>��|�J+��Y?�y�<�t��4�*�S���1�D�
�ON�t���S%�7Y��I��C��T��񔛠])mV3j�X�r-��F�R!���)"�K�S����m���GQ�z�[�$�	�n|:����*�
�s�-
-�
-���
�}g7$︦��kF<F��e���+H�[6d�/�%�
-Ή���
���^<�&�G}"��81��L2�]�
-3�+DU�gz���8���r�j4�l������bA�E2�o�ո�ǎ��o3�݉�
��
;�Dԙ�ƭE���qȭ��p�/R�q�%���ubf_({pdy�����hb-�fF��3��<ͣO#��+��<��
�<em8g�]p��s�����Q,���o������'��
�)���
-��K���Z�4VT���B�N	ם�lm���\��H(�%�.*R�����κn
��*[T%��H􉶡���@-�9�V�yL�o���kh��pm��
k��A��1+?ϖ�'��ΝY(^�oϕ�i/A��/h
�o��n�U
-��@���\h�1lnڐ�T�d2��1i����;?/�n�I� c(�ZZ-H����H?+z5��å���&ۇ����#�Ӛռ~k����3��,s���e��}o�
����;��AX�b>��|'��b�͇{_��v�.�kϙ9ů��g�,
"
K����Z�/򵔱��d
c� ��b�tJ��k��vꪌmb�&���'_�n�`
�$0DFtñJ�Y�6ˎ���>�}`���G����@uI�˃r
-P4��~���
-U���7!@b�<Z�-��?�#�Zx U��K'~`EA���J���Bu��z?�
�2�<fKS�U���"d����:<�,��0ۘ
!G'1����>�V�5M&Z�~*�\�N��U,�ږ�����l�o�t�^�.��~̘�2�iW]�4P-d� �C4=�5�S���7�u�^7\�R�3S�M
DZ%��H�j��mG��Z^z�֤#�ڎ''������B�!���Q�K)�M��p�L&�V��MA�`������z�Sdӌ�2�6��9��;�	[ä�@�E���"w�F
&-�+�:Oi~y�R��3�~)�3l
J�^��x
�,K]����R3"*����Db�v+9��?2�pă#�7�$y�J�Z���`g
�E��ߩ22#&.`v��_eT�v`J-��]|�p@��r������m��Ţof�
�n?%A書զ�|Ƒ
0=����^k��nPG+��q9�_���9�?LD�����O1��qw�A��Za����
-ʴV��`���!ky�[�0��k\=�(�]Ζ�0k���8��Ӣ���
xP���9�%�&0$3,O&�ߠ���bd2�߄��|�k�o)�1��@�w\��/��kୀ����o Ҿ��u�N�W.�����i�oE�HO�nk>c0�Y�u�2���Ď�����,��U/�a�4jO}���d�8ܠ8d�2c��Ϧ�_
)�+�U
���C�M��'V�H����l��+�c3_)|0|a9}�zᦤ��
Pj�/Ma
 �����
B�?1k�Wb�|�Q�Q����W��ɺ��2w�
;]a�|����7Ϗ�*;�st&�
����
�γ�%<`
���ΨVy����P��J���Jr���d��v�ޤ_�h.C��ܣ0
6tGG�9Ǡ-쟸W��$y5a�c+e��C�B�s��	��ҍ�ՀQ�f��X�.�c�*�RF��N�^Xk���;

6�Ig����U�e���ځ�&g�R��l�Fl��'��z�+�O�f��
]�
+�x�4�~��
Ȧ����J9[w�g��ljc�Y��Wǐ��l
�asa9�
-���SM��T<"ꗵ�
 O�
�4P�j���cAH�C'p�/��0.��β,��+e�\(<��M:�Aub�>HwA%\���g<l�q墂v�Mݰ��^�8�ɐ�W�i��6�@���Ba|
�p�5��a�&N�kFu*��}P����Ws��}382���$�A��b�������^�;֜�6�d���B�
^]a�D��N�[����]7
bMvv��]$k���
O��>m��c_X2T����=�-u�LP.����h�8]�%I at m^
��p�~�(oE��e����*�O�H�|���\
��,X�މ�MǛ�����V‚x���y���f��j��Rү�0�.k��g����_��Tf~�<����:ow�ʑ��8��4��JO��x �O:�2��K�
��P�A���q�g<� !pь��N$�
�!#�Z�>������mpH22�K�*��7B��0�����=m �*��/"���;;/�@-v	�rV�j���xA�����rs��<\e��G��ܒ~#Y'
-����

�g؍/]�!��V

k��ه�Dv�'�<N�3���g��l���E���r��!��I�U�	��k�Rx�N����PġF|�Un�w�`��ؘ�*a��~%�7�f��⯙Od
���5�o�,b�=7F���`�:��=�
��z&*Iïhu�����&
�l
��j4X�:*`����oh�;0���s�z
�1hn��u
#�T�		�d'[o�q�J�����˓77!�b�i>ed���+r
-����T��yt��Yρ_A����*0U��h����v�����5Z�
����>v��?�侷r<�}:[x1Ȁ|ҍR(�_�::EB�
%�y��o�P��t��Y���
ga+�
�R
�XOp����z
l��1I�=�b�B���C�xUN
��S}2���P:=��*��d�x
���#�0��.Q��U#(6�E�����b�Q��7`��x{baIV��@I�x�3�עL�,j�IGVB� A���ڍ
J���66����@d	bg_=�y�>uUB���� �x�Q3���0<g�b������"2;��pH5���v�Qy�N�-�M�D2[s�P����i)?��b8���4O�O�]���,-��2x#r��S�(@�
)Q���R�J�
-endstream
-endobj
-3484 0 obj <<
-/Type /FontDescriptor
-/FontName /ZHVIQV+NimbusRomNo9L-Regu
-/Flags 4
-/FontBBox [-168 -281 1000 924]
-/Ascent 678
-/CapHeight 651
-/Descent -216
-/ItalicAngle 0
-/StemV 85
-/XHeight 450
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/at/b/braceleft/braceright/bracketleft/bracketright/bullet/c/colon/comma/copyright/d/e/eight/emdash/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/quotedbl/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3483 0 R
->> endobj
-3485 0 obj <<
-/Length1 1647
-/Length2 15562
-/Length3 0
-/Length 16423     
-/Filter /FlateDecode
->>
-stream
-xڭ�cx�_�&
�v*�m۶S�m���
�6;��v:N:�x��<s��u�w�̜UW�u�u������_������)P���������hmo���h���#Ϡ
-�t�q3���8�((�\�&n֎�&n@^��
 4��Xxxx�( b�N�.֖Vn j
U-::�����`���_OWkK ��
@;G'{���_��kG5 �fXX�bJ�:2�R j)E
����ewS;k3�����H�pt��{0st0���4Wƿ\"� ��������
��Dp��[����
�vX��8��=7G�������?	��[8�+!'ǿ;��bɔ
]�\�\��� �*�K�;O7+�b�Z���w�;���Sҿ��4Q7kW����X�@����������ɜ\���������f@pZ����]]������t��N��V��������
����`��
-��`�ca����olKk8��E������o����`
@�
�?=C�7	sG;o�9��I���oH ���ʌ�}"�7H��"����o��W���K��z��+�������������
4&��� �g�ؙ� �8�f�W{k;����ݭ�w������!�`�W!F���]%������nfV 
����/���9�����W���_'f����[Y��:��ǿ!�����n���IBTBMI���0m��Y�oW��{;�3������Z�C%*���e`��0�r1����#+���O����Z�����
�����������\�	3G��H�����o��/�?�����_��5
�V��] �
h���h�f����ր]06-�74�>�Tެ^�=�α?03j�����>��e����{����H��x| ˎ�?
x]D�OF3�
u�����8�ɰ
1�B+��fI~B��Y�xZEհ�
�p�����&���{��R�YFS"fJ
ZC��e��'���c��w��G�t���|&�i�$�ܼ�]
��>!_=���=}ѳ>�ɂ
H3
�}^X�����Cg�E3\�׭Z�}n�
��� ����\~��
d	f�oQ���
��	�v�d5�{=��
����$��ٲ/e�~�j�h�[��InP�n���=�����
-��H)�[u�
+��'�o�l.u��J����}b��t�����0l�vah>��g�O�.��ujL�獛ߙ˪m��~��7YqĮb��/���Ԁ���czngi��.nz�*�ӋS���9^�	v���O+����p|��[W���
�O��h�{���,{g�>�4�n��n�]
]P����"0�U��M��VA
0
�\#]��+Lj-
��k��d߅���I���"�!�
�
���,�IF�"�_Ko��c?Q 
>&��"��:c�뫗I��w�^�*�'��Ӱ[$�LWo�n���d�� h�zy�������UFI� �_�h�
-��<x`K��UJ#3�7�h�jk�:ڱ)����My33�
-�Bܱ��%wvH�T��E�t���-
b�^ĭ�x
-���ߗx`�
�{�xx+�a뉬��ݦ�����}�r޵��Ǫ��X
\`��f�ķ-�]��"gC)g����E�P�B��V-_
cj@�&V$�W��y.����(��G?��z�����a��XG5Z_쯲
d�(�:DB�H��׫CYw�i�
���z�3<��?�j]�DŽ1�O�ͅv�f@�fI(�h�`
�ġ�?n��
N:��
-�V�����rm�8�AIs�e��4rc���	�f*�M/�+e�h�c_�!il��!�وJ��*!o�
�J<L��dGk�3��?z� ��x��6�}�nh��	�$�
?-�&89WU�O?V
��%lx�� ��0�	��7�y�(�k>�>’Ɖ$�̘>q�� ��-�&��m2A#��YCbY�������s�L?��T�dh���C��ᔈS
5(p���0/f���)6��-��g�PS�uk ?(z��R�,��5��S�%n?���/H���^��qZ�_=#�켆>P�ji[L)�iǗDž	��Y2��
��ؚT�τ������>.���
-��kǻ�#�Щ+�S��-x��QGiߦ�h�o���)��Ag����9�F����l
}a�Ir��Rz	\ͯrlL
Y���oKn��8���U`��ZH�q��>_��<l��/�*~��M��|�z�	�C.|`o*�eR���Gg�מBA��ѸX>�s'�3�L
��WL�-�rf/�)��{�u���uh��ͪ
����L
y��Yh���Fΰqa��s�2��*���y�)[	��1�W�2�����-����3zg��H�ls(9��_���@��/����$��.�����b\{��Q��  m'�H"�
K�+=)�E
�k?(�ݤáȞ��T��P����g��G�/���<�&
-��u�Y���{@�c����g������q�k�F;n���UBȍ�c�C ����a���ny�� �J��
-�K@[�q&����XI#��߄mG}Z� ����Vz��;u@���m��P���HeC�I�&�S0zE1sH
�`��\��lhE��P������3�*�kĈɔ���&?S9��$c;��a3O^P�-4V��)�s��
"�lH;�+�k9�

լ\��l⚷�W at U;��)�s�*��ig$�+R&�����B�+c�/0�>���F�e�O�lJ׭��>��Q}o1�e�h�:Q@�_�Y��k�?Ƅ쾹h:b���
��
-�F�	�Hsؖ�x�I���:'a�|�BM-<HN��0gc���qG�݈*��T�._�"�G
OKL�S �_៥�9lpYR�/��~I�D��e�Ǣ�|Li"��	�NtQ�d:�O�7����L�< et4��M*�۵/��
��^ n�
�c�xd�]�
�\�Qxec�
�A�<�ܢ�J�!!HbtP�DA��LAU"���,����/�C�3��i��|����.���
�nw�k��4����T�y��/�w�U����
,V>�R�������n�
�����}����j����ɛgx�5n�� �+!�8���ڢ,L/=�n�`%���u������;ۮj_�x]t<t����K�# ��G��K�j�����
-��
`FA��+�
=����^h���$4�ZP4�\�5��T�aՐ
-�����������f��"�$�q�ܜ��q� y�v���i��j޸>-�O�L��~* n�N���`�ūY%�%��?*�>����H
9�u���
���=7BK�,�E�����|G�"�}|gs,,�Q�9pWպE�J�.�M�e�:F=��p
�lE��gq*�=j�8p�Sk��SQ,Ŋ�I�׫#?�I=G���$�Ҍ�ø�
-��[ׄ_t��~���:���ȍ�o���~��Z��`ύ��	���y?� ��
i�5YjH������[@�k����J�K�K ����
��,�X/��Ӎ�n��Ѡ[,���3�Ia���{��V�0�6s��z�z4B)^��SP���3�a�[J���>�W�Ŭ��G���4Z'�Lh��(o�R_
�=ƿ+_(K�
�A߈M��V^��6�Y~��}�~{����ud�/���ulϫ��D�`''�d��׺�܁c����{���HyѤm�ؕ^Ab���X �A����;XC}\(x��������3
� �+W��˹�σ�f����#��FCxV��P���W�{�]l�5.���
-�_�����,�OO&wq��]4��b�L3�)0
3����{�)�X��.F_"N��`B׋k��(A)�!��)֧��ס�R"�U��,M]�N7�Z�q���σǦ���̧�$x,��Hï>f��-}h����E�����-&9"Dm��(�p��<�÷���Zl����v�:�}�a��Z�<�	�1f�YDk" ���K95�py��(hEh��"}&􀏞�|5��ǩ�@Vx ���q���%���:�}��'L��\�y�B �_S1Ь��f���|��K�)$%S�#�s�����YZ
I���?%�
��㮓4�&D�Q�4���^}�c�N>`��9�XÖ�%�������k�ii�oD-�
-z�80��|��ϑ��'�[\�w
R˗��%�j:���)
<�?�.G����G��Q'��(K�

������l�S[v�O��g�f{�����,�MS�]��r��w6��`�X �E��
M�i$C}q��`��f��w
�K��b���

��R��B��]����!�=W�]�v��4��[��8���x�~�H�Q�7D7���63�2�ߕm�7B��[E�'[*v?��Ǝ���5^��M���^:�U�$���e�w��
�Zw;֌��!����@o��Rl�|��&��.9��B��\���V��wxq�Zq�(�8�sc�n;
3ݤGW�Ѧsɢw�z���S����LG�+�|wd�?+�@
�H9X�
�"̒v.1��Q�Hh��.%��9Y6���xa�o�^���uM��X�4�FTʢ<;/M�T�,?����LA$�\��ظ��;�E�H���D#�8}ޚA�	(od���I�0e�W�]��Z?��
S^ٗ�_nOx�c�

-
�
-<Y	eԻp
=�Ѱ�w�+����>�+Dr�y��K�1ǂm�'�eKEiJۖy�*�Gk�!˘�oSH"�)kP�l �F�KtC������q
�`��-�&"|8R�;
�D�����׭V��ڂf�F	hk��
��Tŧ��W�K�ᦙ�0��9ؔ����;
�?Lym��μ�rO��^u�н룃�R���k�b����Aw��L�`�^�E�r	��Z��;�B�â�}������7u���Urv�R�Ip�mlw[C��o�y��d�O��׻<��I��#6
]�Xr�s�Ȧ<�0u���1t�
R�#�,
�
}��V7R�r�j��G�UBR-0�y��3Nf|�6M�|~M����c�����Dzn&�!N��Ƥe�B:����S}<�txEyO�*���J&�@	g�Z�>�J�a����OjO|ND��d��E%�
��B
�HV������
-�3�6�
�E at Ey��mn<�FZ�t�3^Ұx%?M��n
FjFf̕�p�
-tk�9�*�������a1�ɣ7��b�J�����a$WP>E>�Y�͆�?����܌`\ǔ7ĞK��E��`�hcj�)@�j�8sףyƴ���15�
(�4N���別-�r��$J�
�kC���e�'��������oUR��!#ں��p���E0���4!`'(�&a���	9����̶�)"I ��>�
��g�L�:�Uq-@�:Ņ��y��!f����qG�kS3�H��w���p�vH+����2lx
�ȼ�V�
-��Ɲht��ǓO�
��m��2�P�vA�`
lXx?1
Ɩ�����
���N^�,�64V��ך[P�*2'�Td���a��CM�4d�ګ�)j�.�7��g
-�j
v��
{����-�}� 3�������E�6�!6��\�U��D�wߝnb�5	������T��yu��_
#iM�Ց�<��
I���
��LP�$����N�Khj�
��I�Im��)�����Wi<h8ʶ��#��D��A
`~[�f�e�%�y�8@?vE���QF��&+
-���5�
��9�� �X�=�=̳���7J�?������\-�`�)K/$���`]�˭m��� Ew�k__yc�Ӟ8��I=�zjd������v���
-��Y���Sh����CH��1�Kk�Bcn�p�=붴�=1կa����>h+0
-]Y_Z
����H??��V;����}g!�m2�I޸��c�=�-�
R���?���|L8�G�c9�",Z�/Bps�8zD�P�Fn�g!����!��=`�%*.���&�e
-�=�@j�%|cԔDz
-�=0�� `�(C��6�&/�ޟפ��*ފ_��QL����#�}��G�&$¥bM���}�ᄉ<A�LZ�N3*G���zB�J
����� ���h#ʶ��n��
sC<}wDL�q���:�G���
^��_:S�:g����.�Icѽ۝r+���`�n��G��#��Úp�q菍#g�
�
�Vr9��g�{5�7�v�}�����
-���Y�
��1�/:�Y���̤��FtHi�6����
vɱ
���~9/C�Ҙᝠ�!9�ٻ�[�Nߓ����E�>0>�_YV��h
��L�����
-$����0���bn�V���r��������

�24GN�9�(c
Au?4o�E��w�~�<#��U‹{������
�v��~��u�,��(��
���v�����
�$Pq��V��G�Ӹ�"�8ܶ�{#�(���Pn�
R$������c4�X�M����xƮ��D�J�g�}K��:#��UF�(�8�|�}]
�J�雓"/T�CC#{$�7�Ӆ�ň�Q`�z��i�>�
Ծc�� �lN�E����c�Ź�[��1gi%?<|b�Hl�e�X�� 
�B_�!�jw�-ùQ��,N�K-�VqO_	XEU�8DB�ý��C���N5
-��zT��i\JS�Fc�Š%���tqh	�mz�i�
���=�����(�\���D��/	5�
c�Sq�/��0o����
fⲛ���ϣrT
��?,
ǫ쏓�}M�
��r�8���L�,�^;��fT���h�~Z"���]����|!�J���Ȇ���f���t�Y���9a��Eqgp�r]���w��Ш�
�T�j�Zk)`����$N�
��_ob��F���ٸ%�y���nW�������«�T��AG�0��?�8ű>\K��;�(޻�g
mT���>����#
z���{L�'�v��
J���#�\��T�ʇΦy���-�jk[
P�	H"8_�(������C޶wR�Gs& ��f�0"22�T��Ȫq��V$T���lk��n�i�����&�X�X���y�����
�q ��ڴ���Ǽ��γ��i}�d�/�Wb����u�������U��8���ޙ�i�+7�v�W$�|����l��D�af"�
�Y",')X�?J�
��jl2�lO�r,�j@=�.���[�חg����42��� [...]
-7�-q�G����[1�@L���;�gX�j��׼c���z*
�K�{E+�D�6Ӗ�C,/2U�/����"��oH���W�Z
� ��9H.�F��cx��˳����}GI8'Di =:HxL�~��&�b�^�
-Ez,DZ4F�f?����7�<��^=0>2�5��n>���h�C�e��hY��1�Ǣ�[�ʴ�́���а����]s��j��V��̊�����9F��R�D���n�#�A�{��&��-�'�����wlK�<�pV����^��_�x+I�-e�f��
-�VV�,��͊D�
�`�r
/G"$\]�в�ɯ���w�5�L��5��X�~z-�A
��rZWJ��P�<�d@B/�f�>�e�.I��r6bs���(��%`.ޑ�?�c����z��ʢ�dx�_�=�/i����Ԅհ�-��1Q,���o
-�;l�N�{F,�4	�j�+�.%B5'�嬂�
8

dl�"�ͷ3H�?:���5"�**a{��=�4�|�"-��k(�"���a�"\��UҐ�`�"�2?����P_�b���&:��Z�jI
A��IT&�V6�-g]@���Q��Hz��~tlQ��{
-��B����*�$|���%�3��B�ʗʁE��.�y
h����-����쭈tk
d����Z����Fk��e���=|
�U�6;�r��5�G�����,��Aǩ�w�j���B^3B5aN��z�qV�
U��!�)�cw�=E�/X�^�AWPvn�a�(l
�,�
�
MM{[AtW��qS��r�@��:��
YҖ�]b�d��O����oo��C>���j
�o蛂��*��xxA�
��Z‚[��r�)vvqn�N�Ϋ��铤/�..�bfv�sׅ��O���\R�/��	�r+��+?�L��8�l��*�w�X
Վ����կ�œ4|;��&T���Y�dx*�Bt��- at P�=d-j�q��HV����)���Gk]D�N
E$���i���;����O���vgc
%u���ϛ
E()��z�#��(��p��
-7�y4}|��bC bw�,NX�Zi'ZR���o��G��-�a0HГ �}Q��͂�k]'=�E��� �a
���'dq��
��PC�#��
9M7��:.��yh
V�!d缠�C���m�GN��2��t�S���J�0S����(v�e�v[mD,���
���ݡ|/g�T��O��(��?z�'s�'��.O�����:�d��5T5.�dn@���y�<�Գj-����
/�r��.B*
w��b�����O%�����]
�sk&E��U���4z���h̽T���8��	IC��i�5[L
�B%�n��S��{[8���Y'�a��/ѯ�Q��>ĂB
���'�����HfdN4�pw�]i\v�%l�0H�(��L�{_Pͯ��S�0W�^��S֌��L$wd�]Z��s��Q4��5,�*��/�-�$Y^&WK>�����ݨ&`���
3ܲ&j�
�	me���^�T*aM��n��a��?ApB��p�~�Y����^ L2m$|L�*
-|
L=�:�s
�KdU�w\��M�,�]��K� ��|��
�y�\��D��Oy6���j���d��g��G
!�7
-���8��t�>�hn�]��R�|�FchibI�U��A�m�
-�6TlG�@L�i��#�(x�>嚲A�.a���X�! C+[5C���gl�_���Lw
-��w.��?�䭇�
�W�h���PD�!��ڥC]+`�ѧ�c~E����������"w:���U��o���5�o�7,G���xpVR���%�D,F4(6�~)�p�a⡷{c��H0){�5�߯C4_��B����[
��cI6��4TK|e���jq�}��h�X@>`�
���`�H`"j䠘�H�mc�=I��n�8u�1�m�0�Yi�G=��G�uo)+�-��
FU�
-��?$4Oo��ą�v�yU�����W����UT�b�r�u�����ԥZ�j{q?��7����0^j�$�.��)�3h�Ơ簎�Z�E|S1��iҹp�'gYF�}:��n�%���u��25LG���[i1l�J�9�8�d��e������=���`�½醶�¡l���̹���6��Jԛ}r&�	��3�����\�b�{������('�Pxs��X�yf�3�;uOe-�{b}l�\�%�_
��
�����
�T����-���
h����p��іkÀŨ�h.X�܇��qiWj#H��(A��E���+��Y=�5��{
�dų���kğ��0�XDnG��	�t	��b�:/c&�4�%���\�9vɭ*c��*�c�������&� \��<���I����+�����zQ
Z�̌d4?�E���;���x���Z�PO�X86��Q
���x ��
؃}5�&%��J!1�9��[I/�.����:��Wh�~X��^�S�Q���h�3�$��7E������!���1e
�����2�:�n� a
-?ⓇgT�j��@dߞ�c� ��Hǩ���
�]��V�
{p���2��P���M-�
֠�r:v(LV��b=[�=9`J�H@)�@$�e�7�&T"��w7h
-���i�B$�z"�0OaG���Q%X<��0���S\
��
�Q�q�
'�����;f
?kh
�
Q���Kh���xRa(��Ƣ$��,.u3�����v\m��W'&�v�/�Q�aoq����
-���	�}���
-��@�I�
*���o�9�\���6

��':�8
-a�kv�u�"�A-�==1Q��XR�2O�4�ѩ�44&�&s�3Y�
��'J0b��Ά&�\�DJ٘S�5JO�x��_	�t#ꮝ��[wQ>
���R��ϩ��{G�!GY�⚞m� d)pL��s=g?MT�C��쨨Z�P���l��腗VLc�E�-n^1����:;��YƎ@Q�� f6|�<G<��
-&?#��sZw�Z�Y�AJ�r|���9���M���k���`�a��
?��#�FӪ�������m��m��e�^�r���w�"����f�~x�>��1��
&
��P�ȾI���1R,_��=���9���m���Nx�=���d�C���
}�­/��i�N�(Џ&��}���^S�S�έ���r� �c ���;����'
�	gM��#�m�Y�Ks}�@��K���g�%�jF}Q��"E�<D-w��#m�h!�{Gՙ���'7��BVLq�2���ߌ�

�7���-�6*(�CX� ��'&3kbK�����	h�
h�������mn�t�>�dO���a���ó� ��Qd�>,�
-w�T��MT��1b,�ߌ�5����=Q�0:�\ЁuF��A5D�%
���W��LՑ�[jG���(\��i��.������

��Rx�{|p�j�?=�"VG���^?���-^�����סX{�5m?� j:��~6�7ZH,�+�t�,h^�R�WT��^v
{�0H�K����%eOY#���+$��9ZP�aBb��VSDz��TԬl`W�*�O0�UB^=�do�=�����z�z�?[٪�<�>�Dt|c�r]���=�
���uY��e5v��|��ŗ��e=���+о�'���9{!ϮyS��t��B'�N�+K����i�H�D�{EY�l��:|�x)4gZ�0����Q�x�a��ai~4�d�wq� l&��AG
������Y�����e�xߌ���
�m%�a�����漻A�P�J���W��_�J�ؒ�׸�!-aD/�8Q��
-���L
�9�fU�:9/�1�
�;�U� ��/�6o�m�f�VΖ�T>�a(������r�n�Ȱ
��y�]�wq?���@��
���k|N��I1
�P׼ͅ�h%��>���+=�HÚ*�kh�5zqF�!����
�FmQң�Po���O��Y��Q~v[q��2C���`t�3�c������nR��>��%y�,
���<v
�o$ĩ�0Q�#�q���y�H�p
��^�M���S�Suf
���pS�(�q��EbƐt�?��T��X���V�Lw|�q�zg��uT��
��:����ő�Et[��������M�[.�f9�
�-�+'P�m�G��{���|�����%��I>#y˗;L1r1�f�B�'n&�}wsV$l�E��UӚ�H5s;��H4�c�jIi�|
����]g��n&�	-�V2�����|�]�u��Km�ؙ[��HT$#�G9*���a�
N�g�Q;��i]J®
�p���

-
�P�lw�|͸c!�
M��t��e�Ji�u�
���U�Q܁�]�1�� ��[��,/^QWs
��x��	��Qy}�/\��s4q:�'��x�f�!���~
D���0[g�B�{�r
-^?7���7X�^�
���
X�d+��ՇØ��\T����
/'l]Z�����@ۙ�+ͺ�˲��\>?���Vիa�f�s�
I��	�
�	(�ܔ�+E
-��8��+&
��T6~��h�&�������	
-܌����Iu��9~V�����a7�E��i,�z�0K�
|Pc�^���z:�C�(�	2���L��R�|?q��
-�1��,���>�c�@DZ�g3\�����mb�n
�:c��ٚ�OJV��y���((�0�#".�8�����W
�m��SW���x=Ib�bP?@����qd>�yi��5<
-���.�����X�ؗ�K~RZ�$v���s���?		���>�
-��`N 
����9�&���ǡ�(B��!�ŗ��]=SK�I�<�P�PO��N?Y0�ۮ�d����2z�Q�z����Z��
S�����"�x"q
N���[hݬ���
W�0���n���
u��'��)��m���
�4Zi�
��H��V�o�Sx�Ϗ�gN��[�����a�̌rA)�VBی]���|�ڹ�@m~+�
"�Wk��fL�ǡ��xӽ�ֶ�xH]�+�B4�'KK�k���!�҇�!<J���6��S���@��a�)~�[��T�Uox$Uԕ��%�^�sr���nn��8�1t��De2�vpKI>?�:�k�
�������]�L1���A�n
X}��A�HŰ%�^%�
�a�p����1ߌ�!�.�
�	1
��
�	\��s++9���ׯ�~��g=���
��MiI at X+����	��d*�4D�I�5���G,{�������{
�WN��I�٦�`���֟Y�3����
{UT.�}�	υ��35�
�wg%�to�P3 
�Ŋ���]&�����W4�r3 at G�2^'�g��k��}
����@�>]9�܏l��@$�J�ᳬ�<��	�Y�-���Κ�3w9�hR�H+ j�vP##5"�;�Z_4�[Ͽ���Փ���%���c�ui�b�
Q�ә�T4)S��V4 ���
1��a�����E[ƺ�Ε��V
ᧄ� �F߲_��f��L�O�=1
�=q�����
#�O>�w�\S�X��x�{
'&
-���'I�se�W��\J�p�L�do�Od
�� ����}�U����\��5�J���ّ�}���|ݴ� vrc��.�
\�X�����@[�p=6k���.�/f$1z�F������7YJ�&������M �M�>��+��
a���Y_�8�u��b��4���VR����[Z!^�� ��0�
��:����	y�[����L��F 	�u�=D����SpC�a������9���Y�V�����xƯ@�F!���n	��V*�d/��X0����)���D}�*ƣ8z"\��s"u����$���v��D�TG��v��l>9_���������J{
߸��.x/yn:g�m��p:i��6	�8�,��a��������"�������Y����ڻ+"<ze��E��6�o�^���
x���W���\���
ஏ�)�	�:�vwx��
9�_b����7p�u���N{
	n�V�п9�
7z~qb�md��[@7Erp�C����a�c� [...]
-�$Sj�E���4e��fc�^��
h'��|�e�D�Z��bg�=�OWN:� {�5
��
-�E���X
�מ��R��ǰ��Y�VR���G�p�}�S$�3�<��KљB9��b ^�%
��T���?*�<5��"�!ʗ	]�-34�A>�z�XZ��E��\w_%�F����'xx�m�S&ˋ#������U4�H���peZ�H��"K�Y$�g
?]�
-��*���@���
-eR��H�Ft��7
���g0��g�!�GKD�T�u�F/,��҅�J#�0V~i�X��z��=�An�5
�mN.��!
�;&�{���̆��
o�C������
Q�n!7$��;:�,}Pރ��p�-7
�ǚ�@�@_�H�i��e�`=���wm�.��I��~g
-^
-
���k�%����A�Y]�����ӂ��(�H�'t8[���1

o�9�Ljm�V�6�Nd�X�8=�m��=��ᔨg\U!z8��VNpm:p����G���OBS�=\_�Td>��?�
��ڝ���[m�eh� +��Y�-�g��ûiU
��_B�����C̐�n1j�^�w?��41�3N�R��^�{8+�PH�s�*M<�n?w.��~ѓTIP�)D���1�2�> p
.
� �4ipԔ�kj�G�Ȋ�
`O�ז�7p�4mf�'T�߱2�`=:IkB���GA��m}#'�zk�7R"�@Yޏ��	�&�;�~���
����l���u���p�&��R+Ip&oV��
�3J*�
s�%�wU��oY'��LH�(���v��L0(�
z/�Cr9���+��������qZ�Z���ŧ.t�GV��T@����HQ�q"�,c�����m��bCvm/�W塟�5�nN�L�����hh��	�p2W�㯹?�Y���No�lϪ�O��6�v�ᮛ�Ԓ��v�=�ۃhp���je1ؼj�~,
}D�*q
F��+�:ꏩ*U�G":����Bv�r�`�� �35�xZr`�}^8Jq�ڌ�@������ �V��xZ�.q�5Φj�*Rf��ɪ��'O��T�c
$�2��

%����r0׽�)<�2���Z��]� ��ὲA�u�Y���U��\E�obX�U���sS>+�z
�-M'��M�}���b��C�YH��},�)$1n ��+LF���\�Ki*�Z�6�����uu/W}��
�k��{|"�Ǚ[�̃I:NV%ϐ��Wo�v��[J���Y{7�V
��ɻ<�ø
�^�75i]����َ{pA��3�s���<�
-���N����P��:�ˏ�*�!�&���N�5a�
I“�Bn��.���j찚��OT@�˧
-��f��[Z"j_�R���}�Zx��}/�����N#�P(��o�/;x�;[��u�c
VS�J����n

s���a�N�qm0›V��x�����q��ȫ
8���C
;�$<���mc&}R~�`Ղ���d-�@(a94hɪ=7�
�J���h��ݚW��>���Ym��f��ˌ
p��
�ϕ�yW�;�a"�Fh�㞲a$�ɶ
�|��p�>k{e�
f��	@(��f�"��e
-�*�4Urg]�瀑YtJZm����3�ٶ�U��e�
n��p	�c*��Md����+���h)��w��b!:5{�Z�y?��W��FD��ޅ?��rH^Tߨ�ٕx��X��'���G�ґEWb��+^z*FC$��ӂ{o�L����Ї�ƅ�oH�
!5�n��P~�w�'1^
�`
<�����KN�!U�ް*`�L���9��&ȦkE�~�N�=�@�G)��&�
	�l�K�
/�b�F?!zލ���W��{PXפeJ��S�׏����FX
�灊'Q�l�,�;}o/�Mϼ���"��/�$Q�z�L>��
\**@g��ۘG
-خ�sks����
�ɅЏ�����ů46754��}Ī���
���(��P5��
-�� ѽ�p�L�snF�m�,`�����8�ʁN
��e面>�6��]�c|:�En���@���F�g�
�̈́��&�f��
$�,fT0���t��
Qb��2�Q���2��#�W���4Cx��S��c��H��6aw�y���L�+
��<<mr����C���%��H#}-l1!�K���)[ّ�Q=��W~/�m1p0��mn�T23C��ҍP|#����*hb9S��7��X�x�����Os$
����u����K0�Lȓ,x����(
,�S�0
�N�/)���}K����H)��9�� ���3����O{M��
1�-�"����p�l�^
Ά_�i�s������߭:4�ЉN宗����6�ի��m^���ؤ�GSia�>�
�G[֐�3Y 	�����3�Q�>�"����5p�R�Bi��̽�F;�B�wV�

~Z%U�����RK�N��J��#&ҕ�6:�K^��|�N6�E��S�<D�K�
Uo(��2yD� +�FB��}�*ř\Yl�?�LbdW��۸���7�ߌ�B�^M
�(꼄�qg<�:.Rx����GT.G)V
jv��I��֭��0_���b;��7���Z&�X�.��b3��G����Z<��K�r�կZ8.��É�����6��
��db at E�ߧ�.u]5C�pf�
B�)�w^�Dž����qc*��
�

���L�|��2LbLJ۶��:bC+���x�������
0>~
���n-�!�
-pG��۹Ҝ��7�����ͬ�M�9������o'��f^�a�sw�z[�L�I}[⥦/o��tƛQ�Sٹ����`���۔G��x�Т�|K�w���
�n�Ŷ7{9?i��X���{�7�����O���K�k,��p�Fp����`�DS�ɶ���ӻ�
��k?�&_	
C�^
9�}U�b8�;�j��
�-"3R��4�'�>���ܫS3���v��4k�X[�LG�qk�u����P�cuO-���G�\�E=���1�%#��G����1���z<%#��sT�^�Hc$��\I��c\��γ��ߪ4w/����D��@�y!�fK����5���:F�
-endstream
-endobj
-3486 0 obj <<
-/Type /FontDescriptor
-/FontName /EBESOF+NimbusRomNo9L-ReguItal
-/Flags 4
-/FontBBox [-169 -270 1010 924]
-/Ascent 669
-/CapHeight 669
-/Descent -193
-/ItalicAngle -15
-/StemV 78
-/XHeight 441
-/CharSet (/A/B/C/D/E/F/G/H/I/L/M/N/O/P/R/S/T/U/W/Z/a/b/bracketleft/bracketright/c/colon/comma/d/e/f/fi/fl/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteleft/quoteright/r/s/semicolon/seven/slash/t/three/u/underscore/v/w/x/y/z/zero)
-/FontFile 3485 0 R
->> endobj
-3429 0 obj <<
-/Type /Encoding
-/Differences [2/fi/fl 33/exclam/quotedbl/numbersign 37/percent/ampersand/quoteright/parenleft/parenright 43/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon/less/equal/greater 64/at/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft 93/bracketright 95/underscore/quoteleft/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/braceleft 125/braceright 147/quotedblleft/quotedblright/bullet/endash/emdash 169/copyright]
->> endobj
-610 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /CYTIHN+CMMI10
-/FontDescriptor 3444 0 R
-/FirstChar 46
-/LastChar 119
-/Widths 3428 0 R
->> endobj
-612 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /KJFPML+CMMI7
-/FontDescriptor 3446 0 R
-/FirstChar 115
-/LastChar 119
-/Widths 3426 0 R
->> endobj
-1213 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /RMKTHO+CMMI9
-/FontDescriptor 3448 0 R
-/FirstChar 46
-/LastChar 118
-/Widths 3425 0 R
->> endobj
-611 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /XCKPWW+CMR10
-/FontDescriptor 3450 0 R
-/FirstChar 48
-/LastChar 118
-/Widths 3427 0 R
->> endobj
-1600 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /OPBINH+CMR6
-/FontDescriptor 3452 0 R
-/FirstChar 48
-/LastChar 117
-/Widths 3422 0 R
->> endobj
-3181 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UYHLKA+CMR7
-/FontDescriptor 3454 0 R
-/FirstChar 98
-/LastChar 117
-/Widths 3421 0 R
->> endobj
-1214 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /HRPHYH+CMR9
-/FontDescriptor 3456 0 R
-/FirstChar 12
-/LastChar 118
-/Widths 3424 0 R
->> endobj
-169 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ZMNSWV+CMSY10
-/FontDescriptor 3458 0 R
-/FirstChar 1
-/LastChar 21
-/Widths 3441 0 R
->> endobj
-171 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /VYEUCT+CMSY6
-/FontDescriptor 3460 0 R
-/FirstChar 3
-/LastChar 123
-/Widths 3439 0 R
->> endobj
-3182 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /NSJEOL+CMSY7
-/FontDescriptor 3462 0 R
-/FirstChar 48
-/LastChar 48
-/Widths 3420 0 R
->> endobj
-170 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /DFVRAV+CMSY8
-/FontDescriptor 3464 0 R
-/FirstChar 120
-/LastChar 123
-/Widths 3440 0 R
->> endobj
-526 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /GCEPBM+CMSY9
-/FontDescriptor 3466 0 R
-/FirstChar 3
-/LastChar 50
-/Widths 3431 0 R
->> endobj
-1599 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /CDCNLO+MSBM10
-/FontDescriptor 3468 0 R
-/FirstChar 81
-/LastChar 82
-/Widths 3423 0 R
->> endobj
-194 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /NQXOMN+NimbusMonL-Regu
-/FontDescriptor 3470 0 R
-/FirstChar 33
-/LastChar 122
-/Widths 3436 0 R
-/Encoding 3429 0 R
->> endobj
-331 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /BFMNIZ+NimbusMonL-ReguObli
-/FontDescriptor 3472 0 R
-/FirstChar 39
-/LastChar 122
-/Widths 3433 0 R
-/Encoding 3429 0 R
->> endobj
-260 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /GXYNUO+NimbusSanL-BoldCond
-/FontDescriptor 3474 0 R
-/FirstChar 2
-/LastChar 148
-/Widths 3435 0 R
-/Encoding 3429 0 R
->> endobj
-497 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /WGKKCA+NimbusSanL-BoldCondItal
-/FontDescriptor 3476 0 R
-/FirstChar 2
-/LastChar 122
-/Widths 3432 0 R
-/Encoding 3429 0 R
->> endobj
-168 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ISLYQY+NimbusSanL-Regu
-/FontDescriptor 3478 0 R
-/FirstChar 39
-/LastChar 121
-/Widths 3442 0 R
-/Encoding 3429 0 R
->> endobj
-192 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /MBKJVL+NimbusRomNo9L-Medi
-/FontDescriptor 3480 0 R
-/FirstChar 2
-/LastChar 122
-/Widths 3437 0 R
-/Encoding 3429 0 R
->> endobj
-568 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UTIMSX+NimbusRomNo9L-MediItal
-/FontDescriptor 3482 0 R
-/FirstChar 49
-/LastChar 121
-/Widths 3430 0 R
-/Encoding 3429 0 R
->> endobj
-172 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ZHVIQV+NimbusRomNo9L-Regu
-/FontDescriptor 3484 0 R
-/FirstChar 2
-/LastChar 169
-/Widths 3438 0 R
-/Encoding 3429 0 R
->> endobj
-262 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /EBESOF+NimbusRomNo9L-ReguItal
-/FontDescriptor 3486 0 R
-/FirstChar 2
-/LastChar 122
-/Widths 3434 0 R
-/Encoding 3429 0 R
->> endobj
-173 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3487 0 R
-/Kids [162 0 R 177 0 R 189 0 R 202 0 R 247 0 R 251 0 R]
->> endobj
-263 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3487 0 R
-/Kids [258 0 R 268 0 R 274 0 R 281 0 R 288 0 R 295 0 R]
->> endobj
-305 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3487 0 R
-/Kids [301 0 R 308 0 R 316 0 R 324 0 R 337 0 R 343 0 R]
->> endobj
-351 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3487 0 R
-/Kids [348 0 R 354 0 R 359 0 R 368 0 R 405 0 R 448 0 R]
->> endobj
-490 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3487 0 R
-/Kids [473 0 R 493 0 R 511 0 R 534 0 R 555 0 R 582 0 R]
->> endobj
-613 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3487 0 R
-/Kids [595 0 R 616 0 R 652 0 R 704 0 R 752 0 R 810 0 R]
->> endobj
-896 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3488 0 R
-/Kids [875 0 R 913 0 R 925 0 R 934 0 R 960 0 R 1006 0 R]
->> endobj
-1070 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3488 0 R
-/Kids [1051 0 R 1091 0 R 1152 0 R 1202 0 R 1248 0 R 1292 0 R]
->> endobj
-1369 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3488 0 R
-/Kids [1344 0 R 1406 0 R 1450 0 R 1491 0 R 1536 0 R 1592 0 R]
->> endobj
-1655 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3488 0 R
-/Kids [1636 0 R 1686 0 R 1731 0 R 1776 0 R 1836 0 R 1891 0 R]
->> endobj
-1973 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3488 0 R
-/Kids [1950 0 R 2021 0 R 2075 0 R 2112 0 R 2153 0 R 2221 0 R]
->> endobj
-2289 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3488 0 R
-/Kids [2270 0 R 2307 0 R 2330 0 R 2370 0 R 2413 0 R 2466 0 R]
->> endobj
-2535 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3489 0 R
-/Kids [2515 0 R 2554 0 R 2604 0 R 2674 0 R 2760 0 R 2857 0 R]
->> endobj
-2955 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3489 0 R
-/Kids [2937 0 R 3007 0 R 3082 0 R 3117 0 R 3132 0 R 3143 0 R]
->> endobj
-3161 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3489 0 R
-/Kids [3152 0 R 3164 0 R 3176 0 R 3191 0 R 3202 0 R 3212 0 R]
->> endobj
-3294 0 obj <<
-/Type /Pages
-/Count 3
-/Parent 3489 0 R
-/Kids [3290 0 R 3365 0 R 3417 0 R]
->> endobj
-3487 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 3490 0 R
-/Kids [173 0 R 263 0 R 305 0 R 351 0 R 490 0 R 613 0 R]
->> endobj
-3488 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 3490 0 R
-/Kids [896 0 R 1070 0 R 1369 0 R 1655 0 R 1973 0 R 2289 0 R]
->> endobj
-3489 0 obj <<
-/Type /Pages
-/Count 21
-/Parent 3490 0 R
-/Kids [2535 0 R 2955 0 R 3161 0 R 3294 0 R]
->> endobj
-3490 0 obj <<
-/Type /Pages
-/Count 93
-/Kids [3487 0 R 3488 0 R 3489 0 R]
->> endobj
-3491 0 obj <<
-/Type /Outlines
-/First 3 0 R
-/Last 59 0 R
-/Count 7
->> endobj
-159 0 obj <<
-/Title 160 0 R
-/A 157 0 R
-/Parent 59 0 R
-/Prev 155 0 R
->> endobj
-155 0 obj <<
-/Title 156 0 R
-/A 153 0 R
-/Parent 59 0 R
-/Prev 151 0 R
-/Next 159 0 R
->> endobj
-151 0 obj <<
-/Title 152 0 R
-/A 149 0 R
-/Parent 59 0 R
-/Prev 147 0 R
-/Next 155 0 R
->> endobj
-147 0 obj <<
-/Title 148 0 R
-/A 145 0 R
-/Parent 59 0 R
-/Prev 143 0 R
-/Next 151 0 R
->> endobj
-143 0 obj <<
-/Title 144 0 R
-/A 141 0 R
-/Parent 59 0 R
-/Prev 139 0 R
-/Next 147 0 R
->> endobj
-139 0 obj <<
-/Title 140 0 R
-/A 137 0 R
-/Parent 59 0 R
-/Prev 135 0 R
-/Next 143 0 R
->> endobj
-135 0 obj <<
-/Title 136 0 R
-/A 133 0 R
-/Parent 59 0 R
-/Prev 131 0 R
-/Next 139 0 R
->> endobj
-131 0 obj <<
-/Title 132 0 R
-/A 129 0 R
-/Parent 59 0 R
-/Prev 127 0 R
-/Next 135 0 R
->> endobj
-127 0 obj <<
-/Title 128 0 R
-/A 125 0 R
-/Parent 59 0 R
-/Prev 123 0 R
-/Next 131 0 R
->> endobj
-123 0 obj <<
-/Title 124 0 R
-/A 121 0 R
-/Parent 59 0 R
-/Prev 119 0 R
-/Next 127 0 R
->> endobj
-119 0 obj <<
-/Title 120 0 R
-/A 117 0 R
-/Parent 59 0 R
-/Prev 115 0 R
-/Next 123 0 R
->> endobj
-115 0 obj <<
-/Title 116 0 R
-/A 113 0 R
-/Parent 59 0 R
-/Prev 111 0 R
-/Next 119 0 R
->> endobj
-111 0 obj <<
-/Title 112 0 R
-/A 109 0 R
-/Parent 59 0 R
-/Prev 107 0 R
-/Next 115 0 R
->> endobj
-107 0 obj <<
-/Title 108 0 R
-/A 105 0 R
-/Parent 59 0 R
-/Prev 103 0 R
-/Next 111 0 R
->> endobj
-103 0 obj <<
-/Title 104 0 R
-/A 101 0 R
-/Parent 59 0 R
-/Prev 99 0 R
-/Next 107 0 R
->> endobj
-99 0 obj <<
-/Title 100 0 R
-/A 97 0 R
-/Parent 59 0 R
-/Prev 95 0 R
-/Next 103 0 R
->> endobj
-95 0 obj <<
-/Title 96 0 R
-/A 93 0 R
-/Parent 59 0 R
-/Prev 91 0 R
-/Next 99 0 R
->> endobj
-91 0 obj <<
-/Title 92 0 R
-/A 89 0 R
-/Parent 59 0 R
-/Prev 87 0 R
-/Next 95 0 R
->> endobj
-87 0 obj <<
-/Title 88 0 R
-/A 85 0 R
-/Parent 59 0 R
-/Prev 83 0 R
-/Next 91 0 R
->> endobj
-83 0 obj <<
-/Title 84 0 R
-/A 81 0 R
-/Parent 59 0 R
-/Prev 79 0 R
-/Next 87 0 R
->> endobj
-79 0 obj <<
-/Title 80 0 R
-/A 77 0 R
-/Parent 59 0 R
-/Prev 75 0 R
-/Next 83 0 R
->> endobj
-75 0 obj <<
-/Title 76 0 R
-/A 73 0 R
-/Parent 59 0 R
-/Prev 71 0 R
-/Next 79 0 R
->> endobj
-71 0 obj <<
-/Title 72 0 R
-/A 69 0 R
-/Parent 59 0 R
-/Prev 67 0 R
-/Next 75 0 R
->> endobj
-67 0 obj <<
-/Title 68 0 R
-/A 65 0 R
-/Parent 59 0 R
-/Prev 63 0 R
-/Next 71 0 R
->> endobj
-63 0 obj <<
-/Title 64 0 R
-/A 61 0 R
-/Parent 59 0 R
-/Next 67 0 R
->> endobj
-59 0 obj <<
-/Title 60 0 R
-/A 57 0 R
-/Parent 3491 0 R
-/Prev 31 0 R
-/First 63 0 R
-/Last 159 0 R
-/Count -25
->> endobj
-55 0 obj <<
-/Title 56 0 R
-/A 53 0 R
-/Parent 31 0 R
-/Prev 51 0 R
->> endobj
-51 0 obj <<
-/Title 52 0 R
-/A 49 0 R
-/Parent 31 0 R
-/Prev 47 0 R
-/Next 55 0 R
->> endobj
-47 0 obj <<
-/Title 48 0 R
-/A 45 0 R
-/Parent 31 0 R
-/Prev 43 0 R
-/Next 51 0 R
->> endobj
-43 0 obj <<
-/Title 44 0 R
-/A 41 0 R
-/Parent 31 0 R
-/Prev 39 0 R
-/Next 47 0 R
->> endobj
-39 0 obj <<
-/Title 40 0 R
-/A 37 0 R
-/Parent 31 0 R
-/Prev 35 0 R
-/Next 43 0 R
->> endobj
-35 0 obj <<
-/Title 36 0 R
-/A 33 0 R
-/Parent 31 0 R
-/Next 39 0 R
->> endobj
-31 0 obj <<
-/Title 32 0 R
-/A 29 0 R
-/Parent 3491 0 R
-/Prev 23 0 R
-/Next 59 0 R
-/First 35 0 R
-/Last 55 0 R
-/Count -6
->> endobj
-27 0 obj <<
-/Title 28 0 R
-/A 25 0 R
-/Parent 23 0 R
->> endobj
-23 0 obj <<
-/Title 24 0 R
-/A 21 0 R
-/Parent 3491 0 R
-/Prev 15 0 R
-/Next 31 0 R
-/First 27 0 R
-/Last 27 0 R
-/Count -1
->> endobj
-19 0 obj <<
-/Title 20 0 R
-/A 17 0 R
-/Parent 15 0 R
->> endobj
-15 0 obj <<
-/Title 16 0 R
-/A 13 0 R
-/Parent 3491 0 R
-/Prev 11 0 R
-/Next 23 0 R
-/First 19 0 R
-/Last 19 0 R
-/Count -1
->> endobj
-11 0 obj <<
-/Title 12 0 R
-/A 9 0 R
-/Parent 3491 0 R
-/Prev 7 0 R
-/Next 15 0 R
->> endobj
-7 0 obj <<
-/Title 8 0 R
-/A 5 0 R
-/Parent 3491 0 R
-/Prev 3 0 R
-/Next 11 0 R
->> endobj
-3 0 obj <<
-/Title 4 0 R
-/A 1 0 R
-/Parent 3491 0 R
-/Next 7 0 R
->> endobj
-3492 0 obj <<
-/Names [(Doc-Start) 167 0 R (GFDL) 340 0 R (GFDL_GFDL) 199 0 R (GPL) 270 0 R (GPL_GPL) 200 0 R (group__Datatypes) 655 0 R]
-/Limits [(Doc-Start) (group__Datatypes)]
->> endobj
-3493 0 obj <<
-/Names [(group__Datatypes_ga0764a0e607ec4de08a53e6d3b109a714) 886 0 R (group__Datatypes_ga0aac22e2dc312e8c41418dd8d59701f8) 916 0 R (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) 755 0 R (group__Datatypes_ga13f1f84a46d70b91637cb9d6af54af6b) 885 0 R (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) 671 0 R (group__Datatypes_ga1fd59c6502c8cbb9dbb802e4af34c940) 889 0 R]
-/Limits [(group__Datatypes_ga0764a0e607ec4de08a53e6d3b109a714) (group__Datatypes_ga1fd59c6502c8cbb9dbb802e4af34c940)]
->> endobj
-3494 0 obj <<
-/Names [(group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) 661 0 R (group__Datatypes_ga25f9463d3385bd998e4fabcdce8dec5a) 761 0 R (group__Datatypes_ga261d916137f01c0effdefeb266a73172) 768 0 R (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) 818 0 R (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) 769 0 R (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) 657 0 R]
-/Limits [(group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec)]
->> endobj
-3495 0 obj <<
-/Names [(group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) 711 0 R (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) 669 0 R (group__Datatypes_ga43246761a1030d751e756845a246bf68) 762 0 R (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) 663 0 R (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) 906 0 R (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) 713 0 R]
-/Limits [(group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5)]
->> endobj
-3496 0 obj <<
-/Names [(group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) 766 0 R (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) 897 0 R (group__Datatypes_ga56026e685fb0fe336a5f346580f84ff0) 884 0 R (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) 720 0 R (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) 821 0 R (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) 666 0 R]
-/Limits [(group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6)]
->> endobj
-3497 0 obj <<
-/Names [(group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) 839 0 R (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) 714 0 R (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) 712 0 R (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) 707 0 R (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) 710 0 R (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f) 763 0 R]
-/Limits [(group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f)]
->> endobj
-3498 0 obj <<
-/Names [(group__Datatypes_ga6b8429baa2a70746836586aad6905b64) 903 0 R (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) 820 0 R (group__Datatypes_ga735949470e98393af90b12f534b06cba) 891 0 R (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) 813 0 R (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) 757 0 R (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) 670 0 R]
-/Limits [(group__Datatypes_ga6b8429baa2a70746836586aad6905b64) (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551)]
->> endobj
-3499 0 obj <<
-/Names [(group__Datatypes_ga7593947fa164900140d09c08b56c6cd1) 883 0 R (group__Datatypes_ga763a5fa98155383055703dc08cb3e11a) 910 0 R (group__Datatypes_ga82657533544652eb3ec1334a72da137e) 817 0 R (group__Datatypes_ga841003bef28b1052aa2b5297a529d4d8) 894 0 R (group__Datatypes_ga84f27605574583d674403f6d71a73a24) 664 0 R (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) 667 0 R]
-/Limits [(group__Datatypes_ga7593947fa164900140d09c08b56c6cd1) (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f)]
->> endobj
-3500 0 obj <<
-/Names [(group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) 764 0 R (group__Datatypes_ga9448cd0d782a819c066e27cf3ebc1add) 767 0 R (group__Datatypes_ga97b246f11809448c53f089779c0019a1) 814 0 R (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) 719 0 R (group__Datatypes_gab9fc89c0e89d4487a1f69a26849b682a) 890 0 R (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) 815 0 R]
-/Limits [(group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56)]
->> endobj
-3501 0 obj <<
-/Names [(group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) 668 0 R (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) 718 0 R (group__Datatypes_gac37b94ca7dc0c8bb9797e6d91e16492e) 887 0 R (group__Datatypes_gac3cf4d5c81ff784729bb5d1c8d48ce23) 765 0 R (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) 708 0 R (group__Datatypes_gac9397590f57ede293eed34366aec11dd) 758 0 R]
-/Limits [(group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) (group__Datatypes_gac9397590f57ede293eed34366aec11dd)]
->> endobj
-3502 0 obj <<
-/Names [(group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) 760 0 R (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) 665 0 R (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) 709 0 R (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) 816 0 R (group__Datatypes_gadc14acd60d7235a72f88850b9a917eca) 882 0 R (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) 660 0 R]
-/Limits [(group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b)]
->> endobj
-3503 0 obj <<
-/Names [(group__Datatypes_gae311117a92fca76fc66fe3442ff6d09f) 895 0 R (group__Datatypes_gae439fa617415f2153f4793041c41bd9f) 892 0 R (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) 658 0 R (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) 828 0 R (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) 715 0 R (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b) 881 0 R]
-/Limits [(group__Datatypes_gae311117a92fca76fc66fe3442ff6d09f) (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b)]
->> endobj
-3504 0 obj <<
-/Names [(group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) 756 0 R (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) 662 0 R (group__Datatypes_gaef15021f65d2810602a9a1bd06fc878d) 893 0 R (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) 716 0 R (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) 721 0 R (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) 659 0 R]
-/Limits [(group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4)]
->> endobj
-3505 0 obj <<
-/Names [(group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) 823 0 R (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) 834 0 R (group__Datatypes_gaf4f8f4bacd6f148fbbfb9209fb5b2b33) 759 0 R (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) 717 0 R (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83a60e9236626a09f76d3fe049e03bd6926) 907 0 R (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab34d1f06ae438f58dd44c6262b3281ce) 909 0 R]
-/Limits [(group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab34d1f06ae438f58dd44c6262b3281ce)]
->> endobj
-3506 0 obj <<
-/Names [(group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) 908 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca48a27a450babc28cd9e37b24e4c7f870) 900 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5637cd5e0441762c2efba8ec4549156a) 902 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5c5c70a1d41e6e79718bbeb33df7cad4) 899 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca8cbde0e6dec605c51ef708fb8cd2b52e) 901 0 R (gro [...]
-/Limits [(group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) (group__Datatypes_gga4b10979f4464f0574331e442e9025d3cae072091ed81a04a85178bba39494a601)]
->> endobj
-3507 0 obj <<
-/Names [(group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a3e5170687052e3962de866e2ab44d8f8) 842 0 R (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a59042baec996bc386154a1825ad56de0) 840 0 R (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1aa05a8932097b094ca179e99e2d80b6ae) 841 0 R (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a81a7221b987cf71e9577f1d3162fc994) 905 0 R (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a8a337487ebb2a4938a04103368bc24dc) 904 0 R (gro [...]
-/Limits [(group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a3e5170687052e3962de866e2ab44d8f8) (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a81067f9cf8984d1b3febca4488a137e1)]
->> endobj
-3508 0 obj <<
-/Names [(group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9029c33b6876c560bf78b5b86d0367c0) 833 0 R (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9e4eb4979711bf6699ec8e0f335de476) 832 0 R (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6aa166787e251ef2cbaad9213d8e9d2653) 831 0 R (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6af8c3e04d66cd611db5efcd92a6c52425) 830 0 R (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a1304ca7fa8d3e734d1677709a37d5d28) 836 0 R (gro [...]
-/Limits [(group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9029c33b6876c560bf78b5b86d0367c0) (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a132c76cbee67b5bc2ac9e09af9c68c4f)]
->> endobj
-3509 0 obj <<
-/Names [(group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9ab32d9464a7101eb1893562646a3cdd1a) 838 0 R (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9afdbee5cd06ff135cbf9614b661c9e923) 837 0 R (group__Error) 558 0 R (group__Error_ga0c0ab09a97e49f85f42c966e14cfdee6) 565 0 R (group__Error_gad6765993c08a2ae2f0ef377f822f4d33) 579 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106) 575 0 R]
-/Limits [(group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9ab32d9464a7101eb1893562646a3cdd1a) (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106)]
->> endobj
-3510 0 obj <<
-/Names [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) 573 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a093ae02f8ceebbc40321d1eaf186f726) 569 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a24fd14db2a8ae42b3abcae3288e46edf) 577 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a6aa28e72200f879cbb83a36b60644fb2) 571 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a7dae659f72f654afae1c5c6f331192a3) 574 0 R (group__Error_gga0c0ab09 [...]
-/Limits [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8bf236a519f7da9efd5f874a17d9689d)]
->> endobj
-3511 0 obj <<
-/Names [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) 570 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6ab42a97917f263e8305d561f52cbd9c57) 576 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6abd22c4eaabb49bcb6c654a25e402c64a) 572 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6af29a62bdfcf44dbeec14afb409035438) 567 0 R (group__Init) 476 0 R (group__Init_ga234d52733263ece8ac36c980a80292c9) 489 0 R]
-/Limits [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) (group__Init_ga234d52733263ece8ac36c980a80292c9)]
->> endobj
-3512 0 obj <<
-/Names [(group__Init_ga4af2931282f6a5f1b3444fb8e833d6a1) 483 0 R (group__Init_ga635128363efd9f4c8c63e21702f40183) 485 0 R (group__Init_ga7c98bac1ccfac398657571409a3fcd9c) 481 0 R (group__Init_gaf090a4178ad2e0dc0ea185961e13b3f1) 478 0 R (group__Init_gafdb2c887a3a2d1daf54a764d0d7f7f76) 487 0 R (group__PPL__C__interface) 453 0 R]
-/Limits [(group__Init_ga4af2931282f6a5f1b3444fb8e833d6a1) (group__PPL__C__interface)]
->> endobj
-3513 0 obj <<
-/Names [(group__Timeout) 598 0 R (group__Timeout_ga3ebabd1a7396005fadcd08efb53c1f58) 600 0 R (group__Timeout_ga7e11189e03e9d1452b16e24dae5d6bc3) 601 0 R (group__Timeout_ga93f815a338ce597c6ae3e7b2018d962d) 607 0 R (group__Timeout_gaf0d33c5ec6461b246420cebe2d6866ed) 604 0 R (group__Version) 514 0 R]
-/Limits [(group__Timeout) (group__Version)]
->> endobj
-3514 0 obj <<
-/Names [(group__Version_ga63fef7041da34ac5bb372a2535d99377) 531 0 R (group__Version_ga676f27ad949159a3b79577f78870f60f) 524 0 R (group__Version_ga79bd3696a302bb721ef8168fa5d650fb) 529 0 R (group__Version_ga7a529f51bfebdd4b3e69c866dced9bc1) 519 0 R (group__Version_ga8458e58a5e857de11c35ce3076a70ab8) 517 0 R (group__Version_gaa50f472bf6d1869a2fc1500d2fdf8213) 523 0 R]
-/Limits [(group__Version_ga63fef7041da34ac5bb372a2535d99377) (group__Version_gaa50f472bf6d1869a2fc1500d2fdf8213)]
->> endobj
-3515 0 obj <<
-/Names [(group__Version_gab51f10ea37de5299e9bc840afa206d4e) 522 0 R (group__Version_gabadfeba0a415d210cdd6d7309365e800) 518 0 R (group__Version_gabdf8f4e9416010573d48e21cf0584762) 521 0 R (group__Version_gac6abee034f6ac000f15d1206fdeb8316) 525 0 R (group__Version_gae19dfe022c51c874d905e2a7c81c18f1) 516 0 R (index) 261 0 R]
-/Limits [(group__Version_gab51f10ea37de5299e9bc840afa206d4e) (index)]
->> endobj
-3516 0 obj <<
-/Names [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) 408 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a26270ebae88b22836f94cbdd003a022e) 966 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a27c82492b590d5445541451928a593ac) 978 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a2c8e06a14ae0f5878428e7385e98bedf) 976 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a [...]
-/Limits [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_ab1e38080e1de577a82f181e1e87cea61)]
->> endobj
-3517 0 obj <<
-/Names [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_adbcbb0f82f71091112f2c768d2107bb8) 964 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_afa0c60a0cce5f80bcf4fdd22ba4913a9) 969 0 R (interfaceppl__Artificial__Parameter__tag) 409 0 R (interfaceppl__Artificial__Parameter__tag_a0340ab7363ad499c2d6a0182bc874057) 1016 0 R (interfaceppl__Artificial__Parameter__tag_a12aac19f5cba4af9f1a177cd7b772242) 1015 0 R (interfaceppl__Artificial__Parameter_ [...]
-/Limits [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_adbcbb0f82f71091112f2c768d2107bb8) (interfaceppl__Artificial__Parameter__tag_a23b660d538bf3d3140ab3a4dfe649f61)]
->> endobj
-3518 0 obj <<
-/Names [(interfaceppl__Artificial__Parameter__tag_a6bc95e351716acc4b56829a62464cddb) 1012 0 R (interfaceppl__Artificial__Parameter__tag_a80b6aa70e38446636a0523f06353c8f2) 1013 0 R (interfaceppl__Artificial__Parameter__tag_a8758040d0309c4f1bce32f105cf4c554) 1010 0 R (interfaceppl__Artificial__Parameter__tag_ac7eb99bc96d86baf058f856e41b2ddfe) 1020 0 R (interfaceppl__Artificial__Parameter__tag_acb2d4b9c84cd7b7b4f2abb568471c424) 1019 0 R (interfaceppl__Artificial__Parameter__tag_adc5d20f68f0 [...]
-/Limits [(interfaceppl__Artificial__Parameter__tag_a6bc95e351716acc4b56829a62464cddb) (interfaceppl__Artificial__Parameter__tag_adc5d20f68f042656187d507cff5ceea7)]
->> endobj
-3519 0 obj <<
-/Names [(interfaceppl__Coefficient__tag) 410 0 R (interfaceppl__Coefficient__tag_a001b2a61c18a500a446151a9024de3fe) 1062 0 R (interfaceppl__Coefficient__tag_a1e3bb22af6b60660fcb8d201b09ec7ed) 1067 0 R (interfaceppl__Coefficient__tag_a1ef606afeb25edded051be3b0c728086) 1059 0 R (interfaceppl__Coefficient__tag_a249071ec2d19ecedaaf4e32ca8fc4a8d) 1068 0 R (interfaceppl__Coefficient__tag_a39db5035590b4bf7017a43cdcca6a49e) 1058 0 R]
-/Limits [(interfaceppl__Coefficient__tag) (interfaceppl__Coefficient__tag_a39db5035590b4bf7017a43cdcca6a49e)]
->> endobj
-3520 0 obj <<
-/Names [(interfaceppl__Coefficient__tag_a474cce1b8348a126a8496cea7952a1f1) 1063 0 R (interfaceppl__Coefficient__tag_a526a2d8ad27e00b633408a36830dc2ae) 1064 0 R (interfaceppl__Coefficient__tag_a5fa6bcd4ec3cf844646033688f2fdf0a) 1055 0 R (interfaceppl__Coefficient__tag_aa1816497499ee569563a6d97a4ff553a) 1066 0 R (interfaceppl__Coefficient__tag_aaf38dc5a17ef89e16c45f363397afb59) 1056 0 R (interfaceppl__Coefficient__tag_abe5af687ddf08c6379bd115d210ac22f) 1061 0 R]
-/Limits [(interfaceppl__Coefficient__tag_a474cce1b8348a126a8496cea7952a1f1) (interfaceppl__Coefficient__tag_abe5af687ddf08c6379bd115d210ac22f)]
->> endobj
-3521 0 obj <<
-/Names [(interfaceppl__Coefficient__tag_acad04388edea0d80b20c40266a3c3f14) 1060 0 R (interfaceppl__Coefficient__tag_af0b12578ecdb0571ca51ee09789b2fc3) 1065 0 R (interfaceppl__Coefficient__tag_afabc584f4f391708d6c0d7c47030471a) 1057 0 R (interfaceppl__Congruence__System__const__iterator__tag) 411 0 R (interfaceppl__Congruence__System__const__iterator__tag_a38ece4277d5885940d45d6c8465ca19a) 1096 0 R (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4)  [...]
-/Limits [(interfaceppl__Coefficient__tag_acad04388edea0d80b20c40266a3c3f14) (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4)]
->> endobj
-3522 0 obj <<
-/Names [(interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) 1104 0 R (interfaceppl__Congruence__System__const__iterator__tag_a7f1fc328bf8f0d2ec92a6599ce7fe2d3) 1102 0 R (interfaceppl__Congruence__System__const__iterator__tag_a9af8efc183a5a4cd4475146207f92c8a) 1095 0 R (interfaceppl__Congruence__System__const__iterator__tag_a9c7ea131b285ad7aaefbc1e2cf579512) 1098 0 R (interfaceppl__Congruence__System__const__iterator__tag_ade6bd909f8bb4bcdaed4dced85c [...]
-/Limits [(interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) (interfaceppl__Congruence__System__tag)]
->> endobj
-3523 0 obj <<
-/Names [(interfaceppl__Congruence__System__tag_a19d1974dd5b293a48b8f2de6fa3c2c8b) 1174 0 R (interfaceppl__Congruence__System__tag_a2c60071e2c7adec51fc7175ddb7a3bff) 1168 0 R (interfaceppl__Congruence__System__tag_a3b54824f0f53bf664c3114fb67557115) 1206 0 R (interfaceppl__Congruence__System__tag_a3ce50d0fcf796935652563144194ccf7) 1171 0 R (interfaceppl__Congruence__System__tag_a45fb5ebe8a9c33d1e73593b09d8ab877) 1205 0 R (interfaceppl__Congruence__System__tag_a56b9fe489466e7376b72bc99b4f99 [...]
-/Limits [(interfaceppl__Congruence__System__tag_a19d1974dd5b293a48b8f2de6fa3c2c8b) (interfaceppl__Congruence__System__tag_a56b9fe489466e7376b72bc99b4f99126)]
->> endobj
-3524 0 obj <<
-/Names [(interfaceppl__Congruence__System__tag_a5a6326e465cce738cb09fdd8df1d92ba) 1166 0 R (interfaceppl__Congruence__System__tag_a68de3cffc4bbfa2a79c06c51adb653a8) 1161 0 R (interfaceppl__Congruence__System__tag_a86691cc44e4ef41d379ec2477221f0de) 1208 0 R (interfaceppl__Congruence__System__tag_a8cba47c10a4d9a84b170b37932dc04e5) 1163 0 R (interfaceppl__Congruence__System__tag_a8ce02af4c13862f7988ad3e43b5290cf) 1165 0 R (interfaceppl__Congruence__System__tag_aa8fd21a451fe377a328d750951ce3 [...]
-/Limits [(interfaceppl__Congruence__System__tag_a5a6326e465cce738cb09fdd8df1d92ba) (interfaceppl__Congruence__System__tag_aa8fd21a451fe377a328d750951ce36f3)]
->> endobj
-3525 0 obj <<
-/Names [(interfaceppl__Congruence__System__tag_abeb7cdeabf40c32d3aa0c33c0499bf97) 1207 0 R (interfaceppl__Congruence__System__tag_ae5f214d520a1f232251bee39685b62a2) 1158 0 R (interfaceppl__Congruence__System__tag_ae88c914d522014d2d181278bcfa9222f) 1172 0 R (interfaceppl__Congruence__System__tag_aed43bafe74e2b291d7b980c6ee8f3d5f) 1157 0 R (interfaceppl__Congruence__System__tag_af03d1a4f7f355971ac31ec1e4cb7297d) 1160 0 R (interfaceppl__Congruence__System__tag_af6cb7e34c1083df796fb12aa46373 [...]
-/Limits [(interfaceppl__Congruence__System__tag_abeb7cdeabf40c32d3aa0c33c0499bf97) (interfaceppl__Congruence__System__tag_af6cb7e34c1083df796fb12aa463739e6)]
->> endobj
-3526 0 obj <<
-/Names [(interfaceppl__Congruence__tag) 413 0 R (interfaceppl__Congruence__tag_a0399dc1a987546af5d0491e72a6a05e4) 1219 0 R (interfaceppl__Congruence__tag_a08a4701b629d734ea0e11231a34514b0) 1216 0 R (interfaceppl__Congruence__tag_a10d11983038c7047547f4a68f8ea2b70) 1255 0 R (interfaceppl__Congruence__tag_a2845e4528b7b42c6c6527daceee21312) 1218 0 R (interfaceppl__Congruence__tag_a29295feb65378f2ba04c202f4b9a1bb3) 1260 0 R]
-/Limits [(interfaceppl__Congruence__tag) (interfaceppl__Congruence__tag_a29295feb65378f2ba04c202f4b9a1bb3)]
->> endobj
-3527 0 obj <<
-/Names [(interfaceppl__Congruence__tag_a4ea3e6a8b8e929e318a5c1c450667d10) 1258 0 R (interfaceppl__Congruence__tag_a553952be8bff48ab2a4a8b2820efc047) 1252 0 R (interfaceppl__Congruence__tag_a5e1c7e98053b2262c5f56c46e2f04f05) 1251 0 R (interfaceppl__Congruence__tag_a6871446de8be708c37b2bedbf12c9b76) 1215 0 R (interfaceppl__Congruence__tag_a6d24fa81c885803e34fadd9332287d2e) 1211 0 R (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d) 1217 0 R]
-/Limits [(interfaceppl__Congruence__tag_a4ea3e6a8b8e929e318a5c1c450667d10) (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d)]
->> endobj
-3528 0 obj <<
-/Names [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) 1254 0 R (interfaceppl__Congruence__tag_acaca085247f8483085877e21527a9cd6) 1256 0 R (interfaceppl__Congruence__tag_add70a09fb9b3cb0b8b7ce79d8d9ec14c) 1259 0 R (interfaceppl__Congruence__tag_af39f78c492db753013cbfd0177ffea60) 1261 0 R (interfaceppl__Congruence__tag_af61686ed9ede21b05016ee29f9de882b) 1257 0 R (interfaceppl__Constraint__System__const__iterator__tag) 414 0 R]
-/Limits [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) (interfaceppl__Constraint__System__const__iterator__tag)]
->> endobj
-3529 0 obj <<
-/Names [(interfaceppl__Constraint__System__const__iterator__tag_a061420fd93cf031e877897142071c67d) 1264 0 R (interfaceppl__Constraint__System__const__iterator__tag_a18f6401539b34122053f5d76da0c3282) 1297 0 R (interfaceppl__Constraint__System__const__iterator__tag_a60ac68b3806bdf2e8b4805d661c52def) 1265 0 R (interfaceppl__Constraint__System__const__iterator__tag_a93c2b042e4c644ba6052c0a0130c74ff) 1299 0 R (interfaceppl__Constraint__System__const__iterator__tag_a9427aa22f07ee35e906d05bcd35 [...]
-/Limits [(interfaceppl__Constraint__System__const__iterator__tag_a061420fd93cf031e877897142071c67d) (interfaceppl__Constraint__System__const__iterator__tag_abd830cdbf47ea1e5f0cb88ba4e3dddd7)]
->> endobj
-3530 0 obj <<
-/Names [(interfaceppl__Constraint__System__const__iterator__tag_adc0293455632f1e58de03ee68caa785a) 1295 0 R (interfaceppl__Constraint__System__tag) 415 0 R (interfaceppl__Constraint__System__tag_a06731c2e3b3d14dceffb5b81f1447bc8) 1362 0 R (interfaceppl__Constraint__System__tag_a0d28be41ac786db82ce3cb24e2db5543) 1351 0 R (interfaceppl__Constraint__System__tag_a1b4e8ec21c2f4b2b925c4e11474062b9) 1355 0 R (interfaceppl__Constraint__System__tag_a27f2fdd3945057760e252740c98573eb) 1358 0 R]
-/Limits [(interfaceppl__Constraint__System__const__iterator__tag_adc0293455632f1e58de03ee68caa785a) (interfaceppl__Constraint__System__tag_a27f2fdd3945057760e252740c98573eb)]
->> endobj
-3531 0 obj <<
-/Names [(interfaceppl__Constraint__System__tag_a2967727ea790f1d517e1529e3f6be79e) 1307 0 R (interfaceppl__Constraint__System__tag_a3bd9634d21689bd4b0cbcb476a101e92) 1366 0 R (interfaceppl__Constraint__System__tag_a4316d3e1fd40ef324f4f9ac970481c9f) 1364 0 R (interfaceppl__Constraint__System__tag_a442076de6b59703f82c552f7e70aad72) 1354 0 R (interfaceppl__Constraint__System__tag_a56d19de5207d94e358a433995ce9730c) 1349 0 R (interfaceppl__Constraint__System__tag_a5e22cd8ea46cdef0e09027e6177fc [...]
-/Limits [(interfaceppl__Constraint__System__tag_a2967727ea790f1d517e1529e3f6be79e) (interfaceppl__Constraint__System__tag_a5e22cd8ea46cdef0e09027e6177fc838)]
->> endobj
-3532 0 obj <<
-/Names [(interfaceppl__Constraint__System__tag_a6b54d1a028c5a0eff158b33ce1a6670f) 1308 0 R (interfaceppl__Constraint__System__tag_a7a018b29b6f334f666391ec729265c25) 1365 0 R (interfaceppl__Constraint__System__tag_a984fd654d7b169e74d13f6207d48fefb) 1347 0 R (interfaceppl__Constraint__System__tag_aa975ef75ddb5359966ff21eecca491d0) 1356 0 R (interfaceppl__Constraint__System__tag_ab1988eecd5bca9d4ad8dbd128c885b9b) 1306 0 R (interfaceppl__Constraint__System__tag_ac19488a8f4e64cb797b8402ea44b4 [...]
-/Limits [(interfaceppl__Constraint__System__tag_a6b54d1a028c5a0eff158b33ce1a6670f) (interfaceppl__Constraint__System__tag_ac19488a8f4e64cb797b8402ea44b456d)]
->> endobj
-3533 0 obj <<
-/Names [(interfaceppl__Constraint__System__tag_ac8105464b2dbee48f8646bc2c2f1f2d8) 1368 0 R (interfaceppl__Constraint__System__tag_ad9b9ef9435b7a3bc8d92435ccf1cc0d7) 1352 0 R (interfaceppl__Constraint__System__tag_af8ebe9c0ce769746c2d2d01f6fcb4c91) 1361 0 R (interfaceppl__Constraint__tag) 416 0 R (interfaceppl__Constraint__tag_a08451f3fa991dc14b1b8874bdefd7cf2) 1456 0 R (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787) 1411 0 R]
-/Limits [(interfaceppl__Constraint__System__tag_ac8105464b2dbee48f8646bc2c2f1f2d8) (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787)]
->> endobj
-3534 0 obj <<
-/Names [(interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) 1420 0 R (interfaceppl__Constraint__tag_a2d4948b195e743f39601a13610fcf94f) 1416 0 R (interfaceppl__Constraint__tag_a380ed65a246cd38c5ca3893b40eb4603) 1418 0 R (interfaceppl__Constraint__tag_a414a473844efce3515611fdc6b26e4de) 1423 0 R (interfaceppl__Constraint__tag_a702543ee828ef523fb5fe5ffdaf25925) 1415 0 R (interfaceppl__Constraint__tag_a87fc73217faaf213d5b5a810272be545) 1455 0 R]
-/Limits [(interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) (interfaceppl__Constraint__tag_a87fc73217faaf213d5b5a810272be545)]
->> endobj
-3535 0 obj <<
-/Names [(interfaceppl__Constraint__tag_a8c466c744746ef7249afa54667470cf5) 1419 0 R (interfaceppl__Constraint__tag_a90e279d0af3491d3cc793595e3e1bbff) 1454 0 R (interfaceppl__Constraint__tag_a94ca29d276a68f3f75aa62c8ab6109e4) 1457 0 R (interfaceppl__Constraint__tag_a9a30e394a9c84bb9d2debda31433e6b4) 1453 0 R (interfaceppl__Constraint__tag_aadbcd3b735dae0f714d1134cf8e6b911) 1422 0 R (interfaceppl__Constraint__tag_ab93e22d57d1f5d94ae97ba1b9de9e3f9) 1413 0 R]
-/Limits [(interfaceppl__Constraint__tag_a8c466c744746ef7249afa54667470cf5) (interfaceppl__Constraint__tag_ab93e22d57d1f5d94ae97ba1b9de9e3f9)]
->> endobj
-3536 0 obj <<
-/Names [(interfaceppl__Constraint__tag_abfb19498f2647b44344c6a84fdd6cd2d) 1414 0 R (interfaceppl__Constraint__tag_ac21bd81d2f33da4dc915020bf16c801a) 1417 0 R (interfaceppl__Generator__System__const__iterator__tag) 417 0 R (interfaceppl__Generator__System__const__iterator__tag_a51dfb5223b7487379681d4cc1583917f) 1465 0 R (interfaceppl__Generator__System__const__iterator__tag_a7d4bec3e6101e95b57973dcab5880a51) 1494 0 R (interfaceppl__Generator__System__const__iterator__tag_ab823e62915ff8952 [...]
-/Limits [(interfaceppl__Constraint__tag_abfb19498f2647b44344c6a84fdd6cd2d) (interfaceppl__Generator__System__const__iterator__tag_ab823e62915ff895212640119f062252c)]
->> endobj
-3537 0 obj <<
-/Names [(interfaceppl__Generator__System__const__iterator__tag_ac5344d92361779d92fcb36acf2d406ae) 1495 0 R (interfaceppl__Generator__System__const__iterator__tag_acb94e9072062c0827a16766cef2c1a5e) 1466 0 R (interfaceppl__Generator__System__const__iterator__tag_acd03b90ea728537b78a669806309a5c0) 1461 0 R (interfaceppl__Generator__System__const__iterator__tag_ae2334b2eefe8cae2ad750dfea1f7cade) 1463 0 R (interfaceppl__Generator__System__tag) 418 0 R (interfaceppl__Generator__System__tag_a06 [...]
-/Limits [(interfaceppl__Generator__System__const__iterator__tag_ac5344d92361779d92fcb36acf2d406ae) (interfaceppl__Generator__System__tag_a067f83ba740e5b6c0c585a5175723a0b)]
->> endobj
-3538 0 obj <<
-/Names [(interfaceppl__Generator__System__tag_a33e20d1de127c9232d2d1188bee532ef) 1499 0 R (interfaceppl__Generator__System__tag_a3d3687abfb3878a67fca687b8e4ff0b9) 1548 0 R (interfaceppl__Generator__System__tag_a3f5244b219701d5ba5939982a1d11d97) 1546 0 R (interfaceppl__Generator__System__tag_a540cea530eaa9c142b16fbf01f781673) 1506 0 R (interfaceppl__Generator__System__tag_a7752ae55e7cd4d014f6498348ef47865) 1500 0 R (interfaceppl__Generator__System__tag_a888341fcf1079aaaa4dd7b532662729c) 1 [...]
-/Limits [(interfaceppl__Generator__System__tag_a33e20d1de127c9232d2d1188bee532ef) (interfaceppl__Generator__System__tag_a888341fcf1079aaaa4dd7b532662729c)]
->> endobj
-3539 0 obj <<
-/Names [(interfaceppl__Generator__System__tag_aa7260438cfc5fa383c7fb80b127f8315) 1540 0 R (interfaceppl__Generator__System__tag_aad90ffcd536cd0d48ee183bca02103fc) 1552 0 R (interfaceppl__Generator__System__tag_ab1316806c765a595ddfa4de5e8d971f6) 1502 0 R (interfaceppl__Generator__System__tag_aba231f6ac03d82cbf693a6a29a5c2665) 1550 0 R (interfaceppl__Generator__System__tag_ae12a1e70aa5010e6617de857f51574a8) 1549 0 R (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3) 1 [...]
-/Limits [(interfaceppl__Generator__System__tag_aa7260438cfc5fa383c7fb80b127f8315) (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3)]
->> endobj
-3540 0 obj <<
-/Names [(interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) 1507 0 R (interfaceppl__Generator__System__tag_af5253fb7ef85e1875cc453d9a9998459) 1504 0 R (interfaceppl__Generator__System__tag_af5911dc31286d92c979c7ff89c249bc8) 1545 0 R (interfaceppl__Generator__System__tag_afcc12e4f52a8ff85d16ebfc424447b63) 1542 0 R (interfaceppl__Generator__tag) 419 0 R (interfaceppl__Generator__tag_a048cb229297e24f6d0f7ab4e4351e2c2) 1601 0 R]
-/Limits [(interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) (interfaceppl__Generator__tag_a048cb229297e24f6d0f7ab4e4351e2c2)]
->> endobj
-3541 0 obj <<
-/Names [(interfaceppl__Generator__tag_a140a26e6f6dc525c742aca71f598ed3c) 1609 0 R (interfaceppl__Generator__tag_a278a22338f8428e328daf84dea4f94e7) 1604 0 R (interfaceppl__Generator__tag_a297969dd313ebb370c9419915398aaf2) 1603 0 R (interfaceppl__Generator__tag_a30161047ab7c47dd7a68a852e98ed83e) 1613 0 R (interfaceppl__Generator__tag_a30d13726e3b27f1be7e5eb05a7814bb3) 1605 0 R (interfaceppl__Generator__tag_a318f5f2972203c84ea0fdb4b82bbab1c) 1607 0 R]
-/Limits [(interfaceppl__Generator__tag_a140a26e6f6dc525c742aca71f598ed3c) (interfaceppl__Generator__tag_a318f5f2972203c84ea0fdb4b82bbab1c)]
->> endobj
-3542 0 obj <<
-/Names [(interfaceppl__Generator__tag_a5d89173a47e10f469337343cfb807218) 1611 0 R (interfaceppl__Generator__tag_a6a901364857f84dc0f111a29330c33f9) 1614 0 R (interfaceppl__Generator__tag_a6d184edbb85d3c2747bb6097f7de17ad) 1612 0 R (interfaceppl__Generator__tag_a74a772b49c2c3190ad8501ffa0337d2f) 1610 0 R (interfaceppl__Generator__tag_aafa09f891353748a46868d342cc91cbc) 1598 0 R (interfaceppl__Generator__tag_ab3fe811bb3a347e553576dadff55339e) 1602 0 R]
-/Limits [(interfaceppl__Generator__tag_a5d89173a47e10f469337343cfb807218) (interfaceppl__Generator__tag_ab3fe811bb3a347e553576dadff55339e)]
->> endobj
-3543 0 obj <<
-/Names [(interfaceppl__Generator__tag_ace16d45c8fbb00ad5b616aa4344fb798) 1596 0 R (interfaceppl__Generator__tag_ad6d26ca0f256b0d9a45173e7d83ee4cc) 1615 0 R (interfaceppl__Generator__tag_af2fd5edcf647f4bc5b64cf0f4f712a51) 1606 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag) 420 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_a0632eaac5ec676910e433016619b3e85) 1641 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_a1842c4ba3cd1adb1e1bccef3c [...]
-/Limits [(interfaceppl__Generator__tag_ace16d45c8fbb00ad5b616aa4344fb798) (interfaceppl__Grid__Generator__System__const__iterator__tag_a1842c4ba3cd1adb1e1bccef3cfcfa57f)]
->> endobj
-3544 0 obj <<
-/Names [(interfaceppl__Grid__Generator__System__const__iterator__tag_a813ac0651ebac0120830cedf1ea58395) 1649 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_ac23bf247df0b2721e97c8eeb8945adf1) 1643 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_af2932a2fa90f54f604e340d0e2eac7ba) 1645 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_af4cdf3fbe1977a24a90904e02efd791b) 1651 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_af8 [...]
-/Limits [(interfaceppl__Grid__Generator__System__const__iterator__tag_a813ac0651ebac0120830cedf1ea58395) (interfaceppl__Grid__Generator__System__tag)]
->> endobj
-3545 0 obj <<
-/Names [(interfaceppl__Grid__Generator__System__tag_a121252cea61436e0df74e008b80c13b7) 1698 0 R (interfaceppl__Grid__Generator__System__tag_a22e81aa8cd862935e9a0abab515cf838) 1735 0 R (interfaceppl__Grid__Generator__System__tag_a303533574d5d5d4d8f58e2d8646baa69) 1691 0 R (interfaceppl__Grid__Generator__System__tag_a3094a8093769d647b9f477e14d53a3a0) 1700 0 R (interfaceppl__Grid__Generator__System__tag_a3671e52fd03a1c456c630b7c5c632df8) 1703 0 R (interfaceppl__Grid__Generator__System__tag_ [...]
-/Limits [(interfaceppl__Grid__Generator__System__tag_a121252cea61436e0df74e008b80c13b7) (interfaceppl__Grid__Generator__System__tag_a4578b5352510727810a7c3be32208aae)]
->> endobj
-3546 0 obj <<
-/Names [(interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) 1705 0 R (interfaceppl__Grid__Generator__System__tag_a95c612736a3e7524077dd5c81bf2a105) 1693 0 R (interfaceppl__Grid__Generator__System__tag_a9fc89d795c20b4270756269edf1b9604) 1697 0 R (interfaceppl__Grid__Generator__System__tag_aa6324c2e330df63ad428eec9182fcc4d) 1740 0 R (interfaceppl__Grid__Generator__System__tag_aaf6f8270e3742973e0df7dcc9132f7ae) 1741 0 R (interfaceppl__Grid__Generator__System__tag_ [...]
-/Limits [(interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) (interfaceppl__Grid__Generator__System__tag_abc859551651eca1bcc3839f62d45dbfe)]
->> endobj
-3547 0 obj <<
-/Names [(interfaceppl__Grid__Generator__System__tag_ac64c8548738734fedbc94f03519b803a) 1692 0 R (interfaceppl__Grid__Generator__System__tag_ad00a2a1877537fa49a41013078ee2bb6) 1739 0 R (interfaceppl__Grid__Generator__System__tag_ad4d88d3daaa672264c63c83071c2021b) 1695 0 R (interfaceppl__Grid__Generator__System__tag_ae2c6fa9b0155fd9428ff3abcf1a66805) 1701 0 R (interfaceppl__Grid__Generator__System__tag_af29295940b1ad0b6b48cc44e92f04060) 1738 0 R (interfaceppl__Grid__Generator__tag) 454 0 R]
-/Limits [(interfaceppl__Grid__Generator__System__tag_ac64c8548738734fedbc94f03519b803a) (interfaceppl__Grid__Generator__tag)]
->> endobj
-3548 0 obj <<
-/Names [(interfaceppl__Grid__Generator__tag_a0ca9a6d6894e381babab8f958c194f07) 1792 0 R (interfaceppl__Grid__Generator__tag_a190a7c46776178432e89c9525db039ab) 1795 0 R (interfaceppl__Grid__Generator__tag_a2a64fe7b9774c990bd9db8aecd2dacea) 1782 0 R (interfaceppl__Grid__Generator__tag_a3fc151fc10282a5ede395e9b8a5502e2) 1793 0 R (interfaceppl__Grid__Generator__tag_a6cb7351e1bb87181f7e6c946db398b5b) 1779 0 R (interfaceppl__Grid__Generator__tag_a85958538f17770d4ae66bcd179d747a1) 1785 0 R]
-/Limits [(interfaceppl__Grid__Generator__tag_a0ca9a6d6894e381babab8f958c194f07) (interfaceppl__Grid__Generator__tag_a85958538f17770d4ae66bcd179d747a1)]
->> endobj
-3549 0 obj <<
-/Names [(interfaceppl__Grid__Generator__tag_a8b96d560404b7b7ee0ec7ea1aef80280) 1789 0 R (interfaceppl__Grid__Generator__tag_a99aac01eb1b8adc3667bbd3db68e8d34) 1787 0 R (interfaceppl__Grid__Generator__tag_a9b452ce4baaf1c1644a6eb33658ae48a) 1784 0 R (interfaceppl__Grid__Generator__tag_a9c2a70f5f90ec3da123f549d6ca9fe4a) 1744 0 R (interfaceppl__Grid__Generator__tag_aa8e9420c29d8c75e775c4fd609830769) 1790 0 R (interfaceppl__Grid__Generator__tag_ac5a83c9e42e34b313e12a6cef4470a75) 1794 0 R]
-/Limits [(interfaceppl__Grid__Generator__tag_a8b96d560404b7b7ee0ec7ea1aef80280) (interfaceppl__Grid__Generator__tag_ac5a83c9e42e34b313e12a6cef4470a75)]
->> endobj
-3550 0 obj <<
-/Names [(interfaceppl__Grid__Generator__tag_acc700387404f10208584c1a847a6f328) 1780 0 R (interfaceppl__Grid__Generator__tag_adfc86b3b2966514ba2e2292584f68c08) 1786 0 R (interfaceppl__Grid__Generator__tag_afb6f23292760d6d55c57b5722f604897) 1791 0 R (interfaceppl__Linear__Expression__tag) 455 0 R (interfaceppl__Linear__Expression__tag_a1c54d4109f395752ea23822cee000d04) 1849 0 R (interfaceppl__Linear__Expression__tag_a225478fba412d40b785e2b41809cc90d) 1899 0 R]
-/Limits [(interfaceppl__Grid__Generator__tag_acc700387404f10208584c1a847a6f328) (interfaceppl__Linear__Expression__tag_a225478fba412d40b785e2b41809cc90d)]
->> endobj
-3551 0 obj <<
-/Names [(interfaceppl__Linear__Expression__tag_a3530a20e5985d6da8acabad37bfe0e93) 1904 0 R (interfaceppl__Linear__Expression__tag_a46773b226d490e5bbf6f3d587cf29dc4) 1909 0 R (interfaceppl__Linear__Expression__tag_a50bcfefbf053e770951fa02c2e2eb112) 1910 0 R (interfaceppl__Linear__Expression__tag_a512810c3e349a2f01217c6e426645260) 1841 0 R (interfaceppl__Linear__Expression__tag_a5f05719adb05b4fc86b33bbcf63884eb) 1898 0 R (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6 [...]
-/Limits [(interfaceppl__Linear__Expression__tag_a3530a20e5985d6da8acabad37bfe0e93) (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6822)]
->> endobj
-3552 0 obj <<
-/Names [(interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) 1908 0 R (interfaceppl__Linear__Expression__tag_a7d65378709f5a0c73e711f5528385990) 1845 0 R (interfaceppl__Linear__Expression__tag_a8172cf537ccecb7826eb21837b8d7e7b) 1906 0 R (interfaceppl__Linear__Expression__tag_a84c2e36e2ae01775ce542ebc83739726) 1900 0 R (interfaceppl__Linear__Expression__tag_a86c148ed14d1a2781e07bea5be7fb434) 1858 0 R (interfaceppl__Linear__Expression__tag_a9ab7b109b1acae567c915b1db83b5 [...]
-/Limits [(interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) (interfaceppl__Linear__Expression__tag_a9ab7b109b1acae567c915b1db83b5283)]
->> endobj
-3553 0 obj <<
-/Names [(interfaceppl__Linear__Expression__tag_aa891671c2b9414353067da44a108ac1d) 1840 0 R (interfaceppl__Linear__Expression__tag_ab348eeffa0a61124b880932c35d0188b) 1897 0 R (interfaceppl__Linear__Expression__tag_abbbdd7f3c4800ef97b642142cd68648d) 1853 0 R (interfaceppl__Linear__Expression__tag_abfe9ef58fb96938e1c26b63e2b4ce0d1) 1902 0 R (interfaceppl__Linear__Expression__tag_ac21bf6dd42b915ff6f157fb73fe396e0) 1911 0 R (interfaceppl__Linear__Expression__tag_ae7af7908bffe9b331262dcf8fd020 [...]
-/Limits [(interfaceppl__Linear__Expression__tag_aa891671c2b9414353067da44a108ac1d) (interfaceppl__Linear__Expression__tag_ae7af7908bffe9b331262dcf8fd020b7f)]
->> endobj
-3554 0 obj <<
-/Names [(interfaceppl__Linear__Expression__tag_ae861c5919e346c3966c43edc4cd47276) 1896 0 R (interfaceppl__Linear__Expression__tag_af232ff2f43109950ac1b0f5d124cf4cc) 1855 0 R (interfaceppl__Linear__Expression__tag_af78187771d58e90c174eeba577a471d5) 1912 0 R (interfaceppl__Linear__Expression__tag_af99b9dc1c16751ce872dab5245c22fdf) 1851 0 R (interfaceppl__Linear__Expression__tag_afc650c1c744fbfc4dbd15293b9827776) 1843 0 R (interfaceppl__MIP__Problem__tag) 456 0 R]
-/Limits [(interfaceppl__Linear__Expression__tag_ae861c5919e346c3966c43edc4cd47276) (interfaceppl__MIP__Problem__tag)]
->> endobj
-3555 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_a086e697a92a664c83721e0c442d45271) 2088 0 R (interfaceppl__MIP__Problem__tag_a0d5a001977b49f77a4514de614bf3c4c) 2025 0 R (interfaceppl__MIP__Problem__tag_a19ff64e7fd60a4e08c782a4683d62167) 2032 0 R (interfaceppl__MIP__Problem__tag_a2b4edec92d54747f5f1d2904407e744a) 2096 0 R (interfaceppl__MIP__Problem__tag_a32423400858178cc05f325962afd44e2) 1955 0 R (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79) 1961 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_a086e697a92a664c83721e0c442d45271) (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79)]
->> endobj
-3556 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_a3659fef24b67be6b668955bc6865e779) 2039 0 R (interfaceppl__MIP__Problem__tag_a36c57e3007fcb2340dc415f8431df7aa) 2041 0 R (interfaceppl__MIP__Problem__tag_a3789c297e202c735dbd829cd6cbed989) 2087 0 R (interfaceppl__MIP__Problem__tag_a396b429302ce49ea9915778c317b81d2) 2083 0 R (interfaceppl__MIP__Problem__tag_a39e443628f6b73203b0f66189b8bc1c6) 2046 0 R (interfaceppl__MIP__Problem__tag_a3ff750009bec94ab2c9a01139ba22420) 2095 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_a3659fef24b67be6b668955bc6865e779) (interfaceppl__MIP__Problem__tag_a3ff750009bec94ab2c9a01139ba22420)]
->> endobj
-3557 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_a43a14864f62b4528d6c87856cba4da34) 2093 0 R (interfaceppl__MIP__Problem__tag_a44aa5cc75376dddfb9005dd74b27ff68) 2037 0 R (interfaceppl__MIP__Problem__tag_a4b9b7034fd7b17eff672d49a7c85ac2f) 2031 0 R (interfaceppl__MIP__Problem__tag_a4da79f8c645b945d52635733c3f63d7d) 2027 0 R (interfaceppl__MIP__Problem__tag_a5357e1ed14407abf82149fe878789efd) 2036 0 R (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4) 2042 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_a43a14864f62b4528d6c87856cba4da34) (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4)]
->> endobj
-3558 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) 2029 0 R (interfaceppl__MIP__Problem__tag_a70c652d969734f6a69841d30a5e9033b) 1968 0 R (interfaceppl__MIP__Problem__tag_a7397b715c2ccf3f6fcf2f3900efe10d6) 2086 0 R (interfaceppl__MIP__Problem__tag_a8190bd5fde521e37c585c5c59b65f90d) 2089 0 R (interfaceppl__MIP__Problem__tag_a894587e76b98f15a8ae120327dc9d532) 2080 0 R (interfaceppl__MIP__Problem__tag_a8bda1b8ba9119202c16f88fdb19a535b) 1970 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) (interfaceppl__MIP__Problem__tag_a8bda1b8ba9119202c16f88fdb19a535b)]
->> endobj
-3559 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_a8ca7076566ebe098ff3bc307b4d91899) 1957 0 R (interfaceppl__MIP__Problem__tag_a8efd1f7de8fb2bbe6e33aff1d4184078) 1956 0 R (interfaceppl__MIP__Problem__tag_a8f2ab3d77bca7257df14bda9261a1326) 1958 0 R (interfaceppl__MIP__Problem__tag_a97fad1530ac4a3704d08097aec4bf206) 2085 0 R (interfaceppl__MIP__Problem__tag_a9dfe99ee7d8e2b1d7360ab0119bd12eb) 1960 0 R (interfaceppl__MIP__Problem__tag_aa1663bce444a20240c852c9443005cc0) 1972 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_a8ca7076566ebe098ff3bc307b4d91899) (interfaceppl__MIP__Problem__tag_aa1663bce444a20240c852c9443005cc0)]
->> endobj
-3560 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_ab50ac757b6cb922c40504dc69c983568) 2034 0 R (interfaceppl__MIP__Problem__tag_ab95e9f75dd971827c8a9a6b42faeeac7) 1964 0 R (interfaceppl__MIP__Problem__tag_ac379f873623c0fec37d988c2c374ffe5) 1963 0 R (interfaceppl__MIP__Problem__tag_ac39a1aacb6aa4f54150e2b138d7b36f2) 2035 0 R (interfaceppl__MIP__Problem__tag_acdbb5fd3fa1ab9faed26fc5be47cc0d2) 2047 0 R (interfaceppl__MIP__Problem__tag_ad2154705f0854002a4f44f95580df9c7) 2024 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_ab50ac757b6cb922c40504dc69c983568) (interfaceppl__MIP__Problem__tag_ad2154705f0854002a4f44f95580df9c7)]
->> endobj
-3561 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_ad8caceee4f21496294aee9eb9aea4ec1) 2084 0 R (interfaceppl__MIP__Problem__tag_adf86eb3611cbe63b34ef195bc87a7312) 1954 0 R (interfaceppl__MIP__Problem__tag_ae5845918fa5037ca4e9bdde4a4a3ecf2) 2079 0 R (interfaceppl__MIP__Problem__tag_ae7dc964062c194e3ae8eef0a828164ae) 2082 0 R (interfaceppl__MIP__Problem__tag_aebfd121256089b1415f3bc6989c25bbb) 2090 0 R (interfaceppl__MIP__Problem__tag_af349e801a615b2014d36c30fdb56022a) 2044 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_ad8caceee4f21496294aee9eb9aea4ec1) (interfaceppl__MIP__Problem__tag_af349e801a615b2014d36c30fdb56022a)]
->> endobj
-3562 0 obj <<
-/Names [(interfaceppl__MIP__Problem__tag_af59141db49e5141da6ac594d43ead2f7) 1966 0 R (interfaceppl__MIP__Problem__tag_af63454e50c1937573c75495f3cb4c1d2) 1959 0 R (interfaceppl__PIP__Decision__Node__tag) 457 0 R (interfaceppl__PIP__Decision__Node__tag_a384e3002cf83ca2e73c4290d8629e043) 2122 0 R (interfaceppl__PIP__Decision__Node__tag_a4c12656e0256a4db3311855f9e94a36d) 2123 0 R (interfaceppl__PIP__Decision__Node__tag_a6455bb2686ced2d1a463955f6cbfa542) 2120 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_af59141db49e5141da6ac594d43ead2f7) (interfaceppl__PIP__Decision__Node__tag_a6455bb2686ced2d1a463955f6cbfa542)]
->> endobj
-3563 0 obj <<
-/Names [(interfaceppl__PIP__Decision__Node__tag_a6b1a2446aa655ae65ce51b8a025c5751) 2125 0 R (interfaceppl__PIP__Decision__Node__tag_a8f1b879675bf41b40bab41ebe9a97346) 2124 0 R (interfaceppl__PIP__Decision__Node__tag_ab8a5eaf323d5fb0076b2ce079f9f5fc4) 2126 0 R (interfaceppl__PIP__Problem__tag) 458 0 R (interfaceppl__PIP__Problem__tag_a00a4b6909bbb8ab2fbf602d8589707b9) 2172 0 R (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3) 2273 0 R]
-/Limits [(interfaceppl__PIP__Decision__Node__tag_a6b1a2446aa655ae65ce51b8a025c5751) (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3)]
->> endobj
-3564 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) 2281 0 R (interfaceppl__PIP__Problem__tag_a0fa81de47c40e47efad3842142159fe5) 2276 0 R (interfaceppl__PIP__Problem__tag_a1492c1ef5bc77d977d14267b2344ddf1) 2160 0 R (interfaceppl__PIP__Problem__tag_a182da2aa2af850a82ea4b4ab3773a759) 2279 0 R (interfaceppl__PIP__Problem__tag_a1ebc3efbeb7fcf8da5556b365a9a1839) 2242 0 R (interfaceppl__PIP__Problem__tag_a227bae7ca5019a2488065ba188acbc84) 2277 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) (interfaceppl__PIP__Problem__tag_a227bae7ca5019a2488065ba188acbc84)]
->> endobj
-3565 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_a239ff7924a1294205e5057d1048986ac) 2274 0 R (interfaceppl__PIP__Problem__tag_a2828646f7257660ec4a2a6a06427a715) 2240 0 R (interfaceppl__PIP__Problem__tag_a2f230174a1c6cf8b3d0115ab268d02e1) 2233 0 R (interfaceppl__PIP__Problem__tag_a41b5af390cf2af727c18a043bb869ffc) 2229 0 R (interfaceppl__PIP__Problem__tag_a4c043227bbacc5af1e44439c140f95fc) 2282 0 R (interfaceppl__PIP__Problem__tag_a4f7ccdbb25ecfb4dcd2facbed54f26b7) 2227 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_a239ff7924a1294205e5057d1048986ac) (interfaceppl__PIP__Problem__tag_a4f7ccdbb25ecfb4dcd2facbed54f26b7)]
->> endobj
-3566 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_a51082042eaafc2db84f50f28d3d5b646) 2224 0 R (interfaceppl__PIP__Problem__tag_a65ace8cdf5e2fbf6e82c6834d3d29ada) 2235 0 R (interfaceppl__PIP__Problem__tag_a66b9c383e8c77d79c0ffbd2f99987a94) 2234 0 R (interfaceppl__PIP__Problem__tag_a68099fb9bb1067212c3e998b00255b24) 2232 0 R (interfaceppl__PIP__Problem__tag_a6b6bd9554098c88af56947f5a9e02818) 2243 0 R (interfaceppl__PIP__Problem__tag_a7387184a11ae23fd66b730a1ae720215) 2226 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_a51082042eaafc2db84f50f28d3d5b646) (interfaceppl__PIP__Problem__tag_a7387184a11ae23fd66b730a1ae720215)]
->> endobj
-3567 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_a73faac81cdd75868a90e0769e6e810ce) 2161 0 R (interfaceppl__PIP__Problem__tag_a76361c178cf8799f530f17e791e8d0b1) 2231 0 R (interfaceppl__PIP__Problem__tag_a7fde6bb756bf47a2801a8de40b1472d5) 2165 0 R (interfaceppl__PIP__Problem__tag_a83ff647a9f553f233355dcfe08f925ca) 2159 0 R (interfaceppl__PIP__Problem__tag_a8e179abb162b61259eb3923f067944ad) 2225 0 R (interfaceppl__PIP__Problem__tag_a9f81c698a50d6b97d896dca8cda4042c) 2238 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_a73faac81cdd75868a90e0769e6e810ce) (interfaceppl__PIP__Problem__tag_a9f81c698a50d6b97d896dca8cda4042c)]
->> endobj
-3568 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_aa91485e68401872e9369580d71074838) 2164 0 R (interfaceppl__PIP__Problem__tag_aaa0eabf4e1c5b3bacdbadbc4fceeb6e7) 2283 0 R (interfaceppl__PIP__Problem__tag_ab5075367b0d60e3b979b18b4b8b36f55) 2158 0 R (interfaceppl__PIP__Problem__tag_ab51c22e30fbf76be062c500f2187b0a9) 2280 0 R (interfaceppl__PIP__Problem__tag_ab69f3fd82a3be2e835c16d812f6ef39f) 2275 0 R (interfaceppl__PIP__Problem__tag_ab98bad036b29cb094195b1d8e8212c71) 2163 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_aa91485e68401872e9369580d71074838) (interfaceppl__PIP__Problem__tag_ab98bad036b29cb094195b1d8e8212c71)]
->> endobj
-3569 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_abe40c32264f8b51a8c0d259d0777afc3) 2285 0 R (interfaceppl__PIP__Problem__tag_aca972841d5888907f7dcf13b24134e27) 2236 0 R (interfaceppl__PIP__Problem__tag_ad5da07355917717a2b3ea402a2a27cec) 2166 0 R (interfaceppl__PIP__Problem__tag_add80dff3a130d086d15874ada6e8d8ae) 2168 0 R (interfaceppl__PIP__Problem__tag_adeef8fc42bbbeee0f82d5da5ed6b9fb6) 2290 0 R (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3) 2162 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_abe40c32264f8b51a8c0d259d0777afc3) (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3)]
->> endobj
-3570 0 obj <<
-/Names [(interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) 2170 0 R (interfaceppl__PIP__Problem__tag_aee2f9e1a5347b0fd66ca5f9aec8009e1) 2284 0 R (interfaceppl__PIP__Solution__Node__tag) 459 0 R (interfaceppl__PIP__Solution__Node__tag_a1eef951ad8a431e18a3e9d6a9e56594d) 2317 0 R (interfaceppl__PIP__Solution__Node__tag_a6c514d39c645b2b47002b597d998f527) 2334 0 R (interfaceppl__PIP__Solution__Node__tag_a9526c7cca61983debf9ced54bf89aa7f) 2315 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) (interfaceppl__PIP__Solution__Node__tag_a9526c7cca61983debf9ced54bf89aa7f)]
->> endobj
-3571 0 obj <<
-/Names [(interfaceppl__PIP__Solution__Node__tag_ad4796bea8c483cdbd25979da0c81007a) 2316 0 R (interfaceppl__PIP__Solution__Node__tag_ad6ece2828d918bbd4cded63665b88e96) 2318 0 R (interfaceppl__PIP__Solution__Node__tag_af60a51929fc4969d04191e4f524f6031) 2333 0 R (interfaceppl__PIP__Tree__Node__tag) 460 0 R (interfaceppl__PIP__Tree__Node__tag_a0095864fde9ce398bbcdc67fd7d7f795) 2375 0 R (interfaceppl__PIP__Tree__Node__tag_a242792f5af528730b645b3831b4c6dab) 2342 0 R]
-/Limits [(interfaceppl__PIP__Solution__Node__tag_ad4796bea8c483cdbd25979da0c81007a) (interfaceppl__PIP__Tree__Node__tag_a242792f5af528730b645b3831b4c6dab)]
->> endobj
-3572 0 obj <<
-/Names [(interfaceppl__PIP__Tree__Node__tag_a331092da872154b17ae2e8d675b88145) 2383 0 R (interfaceppl__PIP__Tree__Node__tag_a4a89db919ecd790e62027d3559d8d539) 2380 0 R (interfaceppl__PIP__Tree__Node__tag_a53680b4913fbc0c8bbf3a3f4097f672d) 2376 0 R (interfaceppl__PIP__Tree__Node__tag_a5c88187145d242b27660f9247fe83ded) 2386 0 R (interfaceppl__PIP__Tree__Node__tag_a74f00bca9deb1df435f5f32e16be9849) 2385 0 R (interfaceppl__PIP__Tree__Node__tag_a83a66e20c2502b8a2cf7f8a4b9925769) 2384 0 R]
-/Limits [(interfaceppl__PIP__Tree__Node__tag_a331092da872154b17ae2e8d675b88145) (interfaceppl__PIP__Tree__Node__tag_a83a66e20c2502b8a2cf7f8a4b9925769)]
->> endobj
-3573 0 obj <<
-/Names [(interfaceppl__PIP__Tree__Node__tag_a8fd26a28b5329cecc22ad0a6958a9ea8) 2378 0 R (interfaceppl__PIP__Tree__Node__tag_a97dd1858b35adebeeb6f0d2edeecb693) 2373 0 R (interfaceppl__PIP__Tree__Node__tag_a9fa4831093fbb97122699c344264e792) 2340 0 R (interfaceppl__PIP__Tree__Node__tag_ad9ec458d7b2f78d11393475db3e4cfe3) 2382 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) 461 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a0746b37f80c4 [...]
-/Limits [(interfaceppl__PIP__Tree__Node__tag_a8fd26a28b5329cecc22ad0a6958a9ea8) (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a0746b37f80c4be687b0dc5ded6190002)]
->> endobj
-3574 0 obj <<
-/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a62836b9156289bd880bf9f32056a4dee) 2432 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a70541b12c8a9b281b3aa4f9c21624b3c) 2428 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a8d39b1769491b0ee262118bfa31bcc67) 2421 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_abc4dd4b94a80075012b0f30b13339632) 2430 0 R (interfaceppl__Pointset_ [...]
-/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a62836b9156289bd880bf9f32056a4dee) (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_ad69ffccc04d33132e31a91296afad78d)]
->> endobj
-3575 0 obj <<
-/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_adb6f375b8aad58a31f6a60abb7a9b1e2) 2425 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_add8c6ae913a7e3f0a7e1470a23ba04a3) 2423 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) 463 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a1785059acd1bf60dcf4cda0044cc94b5) 2488 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a35180fb6 [...]
-/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_adb6f375b8aad58a31f6a60abb7a9b1e2) (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a64b1a8e66388915a57bfd0b53a2e46c5)]
->> endobj
-3576 0 obj <<
-/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) 2474 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a7e3f8c5b2e614c5d18783c2ef7b092e1) 2470 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a98e7f050a579e9deeb71a75758238928) 2472 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_aa82f0fc73b5f98fab74070ee92a100cf) 2476 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__it [...]
-/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_abe46bba93c5ddcf4cf4cafdb0d74f942)]
->> endobj
-3577 0 obj <<
-/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag) 462 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a024a52502b35029ff2ba102323d8ae5b) 2523 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a0bf696420bbdc5c2ef0993f61f2273b7) 2536 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a1b2ee4d834f0651a41647ac5b5e0f912) 2530 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a26a124537b8995832b2cb157abc7cf07) 2519 0 R (interfaceppl__Pointset__Powe [...]
-/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag) (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a91f0ccf4325f53430d7347ca73182f52)]
->> endobj
-3578 0 obj <<
-/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aae5f47efa7c023e45aed9be161dce99f) 2527 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_ab595ea1166752d23aba600af43417bd8) 2533 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aeb8456ecf06307c108046a8c665154c9) 2521 0 R (interfaceppl__Polyhedron__tag) 464 0 R (interfaceppl__Polyhedron__tag_a0184ad10aeca27f95d249d3a7e061b46) 3030 0 R (interfaceppl__Polyhedron__tag_a01daecb5bf8e498e7d539d7f3ba8496e) 2860 0 R]
-/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aae5f47efa7c023e45aed9be161dce99f) (interfaceppl__Polyhedron__tag_a01daecb5bf8e498e7d539d7f3ba8496e)]
->> endobj
-3579 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a06c7c974043c12bcf349c119e73cc681) 3087 0 R (interfaceppl__Polyhedron__tag_a0b031bedcfb70f485bab922596bce1c8) 2870 0 R (interfaceppl__Polyhedron__tag_a0e494452cce5a8916f4fe97a1c79e237) 2787 0 R (interfaceppl__Polyhedron__tag_a141c3283de2a46f2fcb278dcdca0558f) 2768 0 R (interfaceppl__Polyhedron__tag_a191744753f79b939c8d61efe45778bd8) 2862 0 R (interfaceppl__Polyhedron__tag_a1bd806c292d0576b94d3084b21736061) 2620 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a06c7c974043c12bcf349c119e73cc681) (interfaceppl__Polyhedron__tag_a1bd806c292d0576b94d3084b21736061)]
->> endobj
-3580 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a1dd00b705631c579994677fea3a86d63) 2775 0 R (interfaceppl__Polyhedron__tag_a1e5a2940765710cccea4ef4f1b7f1092) 3092 0 R (interfaceppl__Polyhedron__tag_a27fdc62bc2cae150c7d710a8e312a40d) 2690 0 R (interfaceppl__Polyhedron__tag_a2dc649f0ee90ea5af999e3c0bae54bcb) 2688 0 R (interfaceppl__Polyhedron__tag_a2f80d4608b0b75948b50dd862a14df66) 2863 0 R (interfaceppl__Polyhedron__tag_a304dd0846a62cb4a9f79806ea82cee5d) 2626 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a1dd00b705631c579994677fea3a86d63) (interfaceppl__Polyhedron__tag_a304dd0846a62cb4a9f79806ea82cee5d)]
->> endobj
-3581 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a357ddb19493a385970c56bf4847a07a1) 2764 0 R (interfaceppl__Polyhedron__tag_a381b0e6e2e58df417ff578ed6d715520) 2961 0 R (interfaceppl__Polyhedron__tag_a39ee8e60c1d4d6faa40986d8fba28d5d) 2767 0 R (interfaceppl__Polyhedron__tag_a3bc82e8c76e1a47ecc20c85e1003036d) 3028 0 R (interfaceppl__Polyhedron__tag_a3e07a3e1a6e6c9f281227b4e215a3dc7) 2785 0 R (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741) 2953 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a357ddb19493a385970c56bf4847a07a1) (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741)]
->> endobj
-3582 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) 2567 0 R (interfaceppl__Polyhedron__tag_a46fc9d1041d5548a5f8f220af2a07028) 2962 0 R (interfaceppl__Polyhedron__tag_a4b5f126aef2ca062b034f795f6e5cf6d) 2763 0 R (interfaceppl__Polyhedron__tag_a50d5c68064e215d3f2cf3ee69896e676) 2683 0 R (interfaceppl__Polyhedron__tag_a52e2499c42a9be1e527642cbfb16ff8c) 2612 0 R (interfaceppl__Polyhedron__tag_a5932fd0c6867d83e3a34d5e680225807) 3122 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) (interfaceppl__Polyhedron__tag_a5932fd0c6867d83e3a34d5e680225807)]
->> endobj
-3583 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a5a6342bc4e04c1f228d210e5c363b6d4) 2779 0 R (interfaceppl__Polyhedron__tag_a5a9b061c4408ab8d70a1dea91a6ff983) 2861 0 R (interfaceppl__Polyhedron__tag_a5e7090393ee5801d9c988db6d2a06a43) 3023 0 R (interfaceppl__Polyhedron__tag_a5eeb3bf2e0ec7e6cd38e47b53eb43423) 3106 0 R (interfaceppl__Polyhedron__tag_a612142029eeee3dd72bb0d37c670d6db) 3085 0 R (interfaceppl__Polyhedron__tag_a6137f367c0c83a73146d84c998d37cb3) 3022 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a5a6342bc4e04c1f228d210e5c363b6d4) (interfaceppl__Polyhedron__tag_a6137f367c0c83a73146d84c998d37cb3)]
->> endobj
-3584 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a658545ec6169d2843323bfe1ff078e6f) 3016 0 R (interfaceppl__Polyhedron__tag_a680aecc71f3b21fa0db03c7d1cbe466b) 2695 0 R (interfaceppl__Polyhedron__tag_a69c0a9ffd5b8910a90a91943a10fe3b6) 3090 0 R (interfaceppl__Polyhedron__tag_a6b5c73b1f3f864c8a10c39810b4711ce) 3015 0 R (interfaceppl__Polyhedron__tag_a6c5a2f9b4702c1a0ddfcc9c6eb9b92bd) 2697 0 R (interfaceppl__Polyhedron__tag_a6d147411700f558d74d8273accfb8e04) 2692 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a658545ec6169d2843323bfe1ff078e6f) (interfaceppl__Polyhedron__tag_a6d147411700f558d74d8273accfb8e04)]
->> endobj
-3585 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a6ff56c68b449b94588ea7290d01625d5) 2963 0 R (interfaceppl__Polyhedron__tag_a6ffd595f3e1d85275962dde5f8401c7f) 2959 0 R (interfaceppl__Polyhedron__tag_a703c5d92387510c5cbf8b0f1da3029b2) 2623 0 R (interfaceppl__Polyhedron__tag_a7135823ecf68cedd5236d53e2b5541f5) 2772 0 R (interfaceppl__Polyhedron__tag_a7573064b44c45d804d398aec02e7a64a) 3029 0 R (interfaceppl__Polyhedron__tag_a784570f6ced5461b4d82cdfefa1cb31b) 2884 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a6ff56c68b449b94588ea7290d01625d5) (interfaceppl__Polyhedron__tag_a784570f6ced5461b4d82cdfefa1cb31b)]
->> endobj
-3586 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a7918c3a73aed2529e1e57b8983264bad) 2875 0 R (interfaceppl__Polyhedron__tag_a819d233e9b1442e06c806dea0523a2f9) 2625 0 R (interfaceppl__Polyhedron__tag_a81cc2a565346ce8ee12124224ddd8d6c) 3010 0 R (interfaceppl__Polyhedron__tag_a8402fc25b68056511cf62f1378666a88) 2881 0 R (interfaceppl__Polyhedron__tag_a841ceef027f12d5c99fc2e739ae340fb) 3105 0 R (interfaceppl__Polyhedron__tag_a85417db0eb420d402acee4ef0d842efc) 2686 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a7918c3a73aed2529e1e57b8983264bad) (interfaceppl__Polyhedron__tag_a85417db0eb420d402acee4ef0d842efc)]
->> endobj
-3587 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a875b11e85fe96586152f53f498158b1f) 3104 0 R (interfaceppl__Polyhedron__tag_a879f2f2b0f967fa73cb59ea8d8b1d255) 2677 0 R (interfaceppl__Polyhedron__tag_a88a7c177ebe33a3d41609609660fd3ee) 3100 0 R (interfaceppl__Polyhedron__tag_a88c408677f6de73fd80903738268efa3) 3095 0 R (interfaceppl__Polyhedron__tag_a8948143df881c58c79da34380f847401) 2629 0 R (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14) 2882 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a875b11e85fe96586152f53f498158b1f) (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14)]
->> endobj
-3588 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) 2957 0 R (interfaceppl__Polyhedron__tag_a8abb894f6f4a673d549aa9bf7456b638) 2864 0 R (interfaceppl__Polyhedron__tag_a8b280d026e0c343ec0d3f5521dda6376) 2694 0 R (interfaceppl__Polyhedron__tag_a8ffc5459233ed9781c0ca910e88fa1f9) 2869 0 R (interfaceppl__Polyhedron__tag_a90544f38c2980f308cd6e0f9248fdd99) 2950 0 R (interfaceppl__Polyhedron__tag_a93cee014592562084126f06fe47efbba) 2786 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) (interfaceppl__Polyhedron__tag_a93cee014592562084126f06fe47efbba)]
->> endobj
-3589 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a9563155e281915a8bc2eea34ceff9cf0) 2956 0 R (interfaceppl__Polyhedron__tag_a96eaf729b170b6df69bc2d1127f8727c) 3098 0 R (interfaceppl__Polyhedron__tag_a977522267df419dd5f2824ce6c0f7610) 3096 0 R (interfaceppl__Polyhedron__tag_a9947be8614cba5c2e8b02771d48fc7d2) 2682 0 R (interfaceppl__Polyhedron__tag_a9d9b8361c659cadd31afb61152ccf06b) 2624 0 R (interfaceppl__Polyhedron__tag_a9e5f40dfc278c52da81291b30fbe75f7) 2766 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a9563155e281915a8bc2eea34ceff9cf0) (interfaceppl__Polyhedron__tag_a9e5f40dfc278c52da81291b30fbe75f7)]
->> endobj
-3590 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_a9fb38e66323fe6cb24b32e32e66dba78) 2876 0 R (interfaceppl__Polyhedron__tag_aa309e957fa5f404b296e2e4c30e1697d) 2782 0 R (interfaceppl__Polyhedron__tag_aa48f8ae0f3a2647949417ec2da1c97e4) 2952 0 R (interfaceppl__Polyhedron__tag_aabb79ab0a7936b6f14cd20e15cb14fa8) 3026 0 R (interfaceppl__Polyhedron__tag_aad3749930a51c38886b1d5a01dbbba92) 3086 0 R (interfaceppl__Polyhedron__tag_aad69d01217b9ea1043883162d285505c) 2879 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a9fb38e66323fe6cb24b32e32e66dba78) (interfaceppl__Polyhedron__tag_aad69d01217b9ea1043883162d285505c)]
->> endobj
-3591 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_aaffebaba13f6fc73438bdccde0966547) 3017 0 R (interfaceppl__Polyhedron__tag_ab062917f016d95800e29f87c203fd3bb) 3120 0 R (interfaceppl__Polyhedron__tag_ab1d03e0aac8dda484b102c536c612a45) 2696 0 R (interfaceppl__Polyhedron__tag_ab27e9641bc6946aef6e3254d28c6fab4) 2622 0 R (interfaceppl__Polyhedron__tag_ab32d3b44994fefe43c44e353a47cb4a4) 2770 0 R (interfaceppl__Polyhedron__tag_ab4f7535037080c7f5db32b2e85fdc80d) 2765 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_aaffebaba13f6fc73438bdccde0966547) (interfaceppl__Polyhedron__tag_ab4f7535037080c7f5db32b2e85fdc80d)]
->> endobj
-3592 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_abc350d1ab1c6e4da0df6bb130364af7b) 2878 0 R (interfaceppl__Polyhedron__tag_abcf3ccb8e2e224496d1326e47e15fdc6) 2780 0 R (interfaceppl__Polyhedron__tag_abd393bd3febd678f09a51a0364756787) 2610 0 R (interfaceppl__Polyhedron__tag_abedffb6a2f5b2473d2d2ac9d448c65d9) 2563 0 R (interfaceppl__Polyhedron__tag_abf1bb44cdbf733e9ca39164f9d8e8179) 2628 0 R (interfaceppl__Polyhedron__tag_ac06aed22fa4405051df0da9e7bc16138) 2947 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_abc350d1ab1c6e4da0df6bb130364af7b) (interfaceppl__Polyhedron__tag_ac06aed22fa4405051df0da9e7bc16138)]
->> endobj
-3593 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_ac0e5d09ffe586f8ea5ec782570015c5b) 2960 0 R (interfaceppl__Polyhedron__tag_ac655ac3a494c4f92bb02d0b9294bdd85) 2872 0 R (interfaceppl__Polyhedron__tag_ac78c1168665c72eaf8c2457b12700fba) 3102 0 R (interfaceppl__Polyhedron__tag_ad015c9afd4968005d43f233359253c5a) 2958 0 R (interfaceppl__Polyhedron__tag_ad024f037803a208b74cd150eeaa5649d) 2868 0 R (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b) 3094 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_ac0e5d09ffe586f8ea5ec782570015c5b) (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b)]
->> endobj
-3594 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) 3014 0 R (interfaceppl__Polyhedron__tag_ad4b80df36fc02b4c47ca160420e50182) 3124 0 R (interfaceppl__Polyhedron__tag_ad6512d0d60c017982bd8031e9b8df336) 2568 0 R (interfaceppl__Polyhedron__tag_ad6b383704ed3f314864c52f5b715cbbf) 3012 0 R (interfaceppl__Polyhedron__tag_ad9547cb6430722246dea7f5a70566c06) 3027 0 R (interfaceppl__Polyhedron__tag_ada9021952b7c7ad4ca6fc4ff082ec9fe) 2561 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) (interfaceppl__Polyhedron__tag_ada9021952b7c7ad4ca6fc4ff082ec9fe)]
->> endobj
-3595 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_adb06752e755290368c9bb00ad14a0984) 2880 0 R (interfaceppl__Polyhedron__tag_adc7cd513e31b7ecdda3a25a967d8a772) 2681 0 R (interfaceppl__Polyhedron__tag_add9c4afcd6f6bd78509219f32d57e348) 2948 0 R (interfaceppl__Polyhedron__tag_ae1e938f0c844231dfe2098ab8fbca67b) 2769 0 R (interfaceppl__Polyhedron__tag_aea399d3df97c711c758c8bf715e0c763) 3025 0 R (interfaceppl__Polyhedron__tag_aebe78c4ede3d49c63765e71cfe93904e) 2614 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_adb06752e755290368c9bb00ad14a0984) (interfaceppl__Polyhedron__tag_aebe78c4ede3d49c63765e71cfe93904e)]
->> endobj
-3596 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_aee4d567631589e83063cfb8f80c2bd6f) 2777 0 R (interfaceppl__Polyhedron__tag_af29cc9becde5f28a37567093174d6855) 2679 0 R (interfaceppl__Polyhedron__tag_af777de5ca96f8d1631d3500008bf84f8) 2788 0 R (interfaceppl__Polyhedron__tag_af818756f74f766dfb937e586565db8d6) 2883 0 R (interfaceppl__Polyhedron__tag_af8a9392f205531631b3a98c332f594b1) 3013 0 R (interfaceppl__Polyhedron__tag_af92f3c9d758e2a155a2a6faec4235741) 2874 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_aee4d567631589e83063cfb8f80c2bd6f) (interfaceppl__Polyhedron__tag_af92f3c9d758e2a155a2a6faec4235741)]
->> endobj
-3597 0 obj <<
-/Names [(interfaceppl__Polyhedron__tag_af93c7e3e554a92e8d3eeb4cf4261debd) 2627 0 R (interfaceppl__Polyhedron__tag_af98013213e01ca8514b6dbd20116af4d) 2784 0 R (page.1) 166 0 R (page.10) 326 0 R (page.11) 339 0 R (page.12) 345 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_af93c7e3e554a92e8d3eeb4cf4261debd) (page.12)]
->> endobj
-3598 0 obj <<
-/Names [(page.13) 350 0 R (page.14) 356 0 R (page.15) 361 0 R (page.16) 370 0 R (page.17) 407 0 R (page.18) 450 0 R]
-/Limits [(page.13) (page.18)]
->> endobj
-3599 0 obj <<
-/Names [(page.19) 475 0 R (page.2) 179 0 R (page.20) 495 0 R (page.21) 513 0 R (page.22) 536 0 R (page.23) 557 0 R]
-/Limits [(page.19) (page.23)]
->> endobj
-3600 0 obj <<
-/Names [(page.24) 584 0 R (page.25) 597 0 R (page.26) 618 0 R (page.27) 654 0 R (page.28) 706 0 R (page.29) 754 0 R]
-/Limits [(page.24) (page.29)]
->> endobj
-3601 0 obj <<
-/Names [(page.3) 191 0 R (page.30) 812 0 R (page.31) 877 0 R (page.32) 915 0 R (page.33) 927 0 R (page.34) 936 0 R]
-/Limits [(page.3) (page.34)]
->> endobj
-3602 0 obj <<
-/Names [(page.35) 962 0 R (page.36) 1008 0 R (page.37) 1053 0 R (page.38) 1093 0 R (page.39) 1154 0 R (page.4) 204 0 R]
-/Limits [(page.35) (page.4)]
->> endobj
-3603 0 obj <<
-/Names [(page.40) 1204 0 R (page.41) 1250 0 R (page.42) 1294 0 R (page.43) 1346 0 R (page.44) 1408 0 R (page.45) 1452 0 R]
-/Limits [(page.40) (page.45)]
->> endobj
-3604 0 obj <<
-/Names [(page.46) 1493 0 R (page.47) 1538 0 R (page.48) 1594 0 R (page.49) 1638 0 R (page.5) 290 0 R (page.50) 1688 0 R]
-/Limits [(page.46) (page.50)]
->> endobj
-3605 0 obj <<
-/Names [(page.51) 1733 0 R (page.52) 1778 0 R (page.53) 1838 0 R (page.54) 1893 0 R (page.55) 1952 0 R (page.56) 2023 0 R]
-/Limits [(page.51) (page.56)]
->> endobj
-3606 0 obj <<
-/Names [(page.57) 2077 0 R (page.58) 2114 0 R (page.59) 2155 0 R (page.6) 297 0 R (page.60) 2223 0 R (page.61) 2272 0 R]
-/Limits [(page.57) (page.61)]
->> endobj
-3607 0 obj <<
-/Names [(page.62) 2309 0 R (page.63) 2332 0 R (page.64) 2372 0 R (page.65) 2415 0 R (page.66) 2468 0 R (page.67) 2517 0 R]
-/Limits [(page.62) (page.67)]
->> endobj
-3608 0 obj <<
-/Names [(page.68) 2556 0 R (page.69) 2606 0 R (page.7) 303 0 R (page.70) 2676 0 R (page.71) 2762 0 R (page.72) 2859 0 R]
-/Limits [(page.68) (page.72)]
->> endobj
-3609 0 obj <<
-/Names [(page.73) 2939 0 R (page.74) 3009 0 R (page.75) 3084 0 R (page.76) 3119 0 R (page.77) 3134 0 R (page.78) 3145 0 R]
-/Limits [(page.73) (page.78)]
->> endobj
-3610 0 obj <<
-/Names [(page.79) 3154 0 R (page.8) 310 0 R (page.80) 3166 0 R (page.81) 3178 0 R (page.82) 3193 0 R (page.83) 3204 0 R]
-/Limits [(page.79) (page.83)]
->> endobj
-3611 0 obj <<
-/Names [(page.84) 3214 0 R (page.85) 3292 0 R (page.86) 3367 0 R (page.87) 3419 0 R (page.9) 318 0 R (page.i) 249 0 R]
-/Limits [(page.84) (page.i)]
->> endobj
-3612 0 obj <<
-/Names [(page.ii) 253 0 R (paragraph.6.2.2.1) 482 0 R (paragraph.6.2.2.2) 484 0 R (paragraph.6.2.2.3) 486 0 R (paragraph.6.2.2.4) 488 0 R (paragraph.6.2.2.5) 496 0 R]
-/Limits [(page.ii) (paragraph.6.2.2.5)]
->> endobj
-3613 0 obj <<
-/Names [(paragraph.6.3.2.1) 530 0 R (paragraph.6.3.3.1) 538 0 R (paragraph.6.4.2.1) 566 0 R (paragraph.6.4.3.1) 586 0 R (paragraph.6.5.2.1) 605 0 R (paragraph.6.5.2.2) 608 0 R]
-/Limits [(paragraph.6.3.2.1) (paragraph.6.5.2.2)]
->> endobj
-3614 0 obj <<
-/Names [(paragraph.6.6.2.1) 919 0 R (paragraph.6.6.3.1) 921 0 R (paragraph.6.6.3.2) 922 0 R (paragraph.6.6.3.3) 928 0 R (paragraph.6.6.3.4) 929 0 R (paragraph.6.6.3.5) 930 0 R]
-/Limits [(paragraph.6.6.2.1) (paragraph.6.6.3.5)]
->> endobj
-3615 0 obj <<
-/Names [(paragraph.6.6.3.6) 931 0 R (paragraph.6.6.4.1) 938 0 R (paragraph.7.17.2.1) 2094 0 R (paragraph.7.17.2.2) 2115 0 R (paragraph.7.17.2.3) 2117 0 R (paragraph.7.19.2.1) 2288 0 R]
-/Limits [(paragraph.6.6.3.6) (paragraph.7.19.2.1)]
->> endobj
-3616 0 obj <<
-/Names [(paragraph.7.19.2.2) 2310 0 R (paragraph.7.19.2.3) 2312 0 R (paragraph.7.20.2.1) 2337 0 R (paragraph.7.22.2.1) 2438 0 R (paragraph.7.23.2.1) 2489 0 R (paragraph.7.24.2.1) 2559 0 R]
-/Limits [(paragraph.7.19.2.2) (paragraph.7.24.2.1)]
->> endobj
-3617 0 obj <<
-/Names [(paragraph.7.25.2.1) 3128 0 R (paragraph.7.25.2.10) 3147 0 R (paragraph.7.25.2.11) 3148 0 R (paragraph.7.25.2.12) 3149 0 R (paragraph.7.25.2.13) 3155 0 R (paragraph.7.25.2.14) 3156 0 R]
-/Limits [(paragraph.7.25.2.1) (paragraph.7.25.2.14)]
->> endobj
-3618 0 obj <<
-/Names [(paragraph.7.25.2.15) 3157 0 R (paragraph.7.25.2.16) 3159 0 R (paragraph.7.25.2.17) 3167 0 R (paragraph.7.25.2.18) 3168 0 R (paragraph.7.25.2.19) 3169 0 R (paragraph.7.25.2.2) 3129 0 R]
-/Limits [(paragraph.7.25.2.15) (paragraph.7.25.2.2)]
->> endobj
-3619 0 obj <<
-/Names [(paragraph.7.25.2.20) 3170 0 R (paragraph.7.25.2.21) 3171 0 R (paragraph.7.25.2.22) 3173 0 R (paragraph.7.25.2.23) 3180 0 R (paragraph.7.25.2.24) 3184 0 R (paragraph.7.25.2.25) 3186 0 R]
-/Limits [(paragraph.7.25.2.20) (paragraph.7.25.2.25)]
->> endobj
-3620 0 obj <<
-/Names [(paragraph.7.25.2.26) 3188 0 R (paragraph.7.25.2.27) 3195 0 R (paragraph.7.25.2.28) 3197 0 R (paragraph.7.25.2.29) 3199 0 R (paragraph.7.25.2.3) 3135 0 R (paragraph.7.25.2.30) 3205 0 R]
-/Limits [(paragraph.7.25.2.26) (paragraph.7.25.2.30)]
->> endobj
-3621 0 obj <<
-/Names [(paragraph.7.25.2.31) 3206 0 R (paragraph.7.25.2.32) 3207 0 R (paragraph.7.25.2.33) 3208 0 R (paragraph.7.25.2.34) 3209 0 R (paragraph.7.25.2.35) 3215 0 R (paragraph.7.25.2.4) 3136 0 R]
-/Limits [(paragraph.7.25.2.31) (paragraph.7.25.2.4)]
->> endobj
-3622 0 obj <<
-/Names [(paragraph.7.25.2.5) 3137 0 R (paragraph.7.25.2.6) 3138 0 R (paragraph.7.25.2.7) 3139 0 R (paragraph.7.25.2.8) 3140 0 R (paragraph.7.25.2.9) 3146 0 R (section*.1) 271 0 R]
-/Limits [(paragraph.7.25.2.5) (section*.1)]
->> endobj
-3623 0 obj <<
-/Names [(section*.10) 298 0 R (section*.11) 304 0 R (section*.12) 311 0 R (section*.13) 312 0 R (section*.14) 313 0 R (section*.15) 319 0 R]
-/Limits [(section*.10) (section*.15)]
->> endobj
-3624 0 obj <<
-/Names [(section*.16) 320 0 R (section*.17) 321 0 R (section*.18) 327 0 R (section*.19) 328 0 R (section*.2) 276 0 R (section*.20) 329 0 R]
-/Limits [(section*.16) (section*.20)]
->> endobj
-3625 0 obj <<
-/Names [(section*.21) 330 0 R (section*.22) 371 0 R (section*.23) 477 0 R (section*.24) 515 0 R (section*.25) 520 0 R (section*.26) 559 0 R]
-/Limits [(section*.21) (section*.26)]
->> endobj
-3626 0 obj <<
-/Names [(section*.27) 562 0 R (section*.28) 599 0 R (section*.29) 656 0 R (section*.3) 277 0 R (section*.30) 824 0 R (section*.31) 880 0 R]
-/Limits [(section*.27) (section*.31)]
->> endobj
-3627 0 obj <<
-/Names [(section*.32) 888 0 R (section*.33) 963 0 R (section*.34) 1009 0 R (section*.35) 1054 0 R (section*.36) 1094 0 R (section*.37) 1155 0 R]
-/Limits [(section*.32) (section*.37)]
->> endobj
-3628 0 obj <<
-/Names [(section*.38) 1210 0 R (section*.39) 1263 0 R (section*.4) 278 0 R (section*.40) 1305 0 R (section*.41) 1410 0 R (section*.42) 1459 0 R]
-/Limits [(section*.38) (section*.42)]
->> endobj
-3629 0 obj <<
-/Names [(section*.43) 1498 0 R (section*.44) 1595 0 R (section*.45) 1640 0 R (section*.46) 1690 0 R (section*.47) 1743 0 R (section*.48) 1839 0 R]
-/Limits [(section*.43) (section*.48)]
->> endobj
-3630 0 obj <<
-/Names [(section*.49) 1953 0 R (section*.5) 283 0 R (section*.50) 2119 0 R (section*.51) 2157 0 R (section*.52) 2313 0 R (section*.53) 2339 0 R]
-/Limits [(section*.49) (section*.53)]
->> endobj
-3631 0 obj <<
-/Names [(section*.54) 2388 0 R (section*.55) 2469 0 R (section*.56) 2518 0 R (section*.57) 2560 0 R (section*.58) 3293 0 R (section*.6) 284 0 R]
-/Limits [(section*.54) (section*.6)]
->> endobj
-3632 0 obj <<
-/Names [(section*.7) 285 0 R (section*.8) 291 0 R (section*.9) 292 0 R (section.1) 2 0 R (section.2) 6 0 R (section.3) 10 0 R]
-/Limits [(section*.7) (section.3)]
->> endobj
-3633 0 obj <<
-/Names [(section.4) 14 0 R (section.5) 22 0 R (section.6) 30 0 R (section.7) 58 0 R (subsection.4.1) 18 0 R (subsection.5.1) 26 0 R]
-/Limits [(section.4) (subsection.5.1)]
->> endobj
-3634 0 obj <<
-/Names [(subsection.6.1) 34 0 R (subsection.6.2) 38 0 R (subsection.6.3) 42 0 R (subsection.6.4) 46 0 R (subsection.6.5) 50 0 R (subsection.6.6) 54 0 R]
-/Limits [(subsection.6.1) (subsection.6.6)]
->> endobj
-3635 0 obj <<
-/Names [(subsection.7.1) 62 0 R (subsection.7.10) 98 0 R (subsection.7.11) 102 0 R (subsection.7.12) 106 0 R (subsection.7.13) 110 0 R (subsection.7.14) 114 0 R]
-/Limits [(subsection.7.1) (subsection.7.14)]
->> endobj
-3636 0 obj <<
-/Names [(subsection.7.15) 118 0 R (subsection.7.16) 122 0 R (subsection.7.17) 126 0 R (subsection.7.18) 130 0 R (subsection.7.19) 134 0 R (subsection.7.2) 66 0 R]
-/Limits [(subsection.7.15) (subsection.7.2)]
->> endobj
-3637 0 obj <<
-/Names [(subsection.7.20) 138 0 R (subsection.7.21) 142 0 R (subsection.7.22) 146 0 R (subsection.7.23) 150 0 R (subsection.7.24) 154 0 R (subsection.7.25) 158 0 R]
-/Limits [(subsection.7.20) (subsection.7.25)]
->> endobj
-3638 0 obj <<
-/Names [(subsection.7.3) 70 0 R (subsection.7.4) 74 0 R (subsection.7.5) 78 0 R (subsection.7.6) 82 0 R (subsection.7.7) 86 0 R (subsection.7.8) 90 0 R]
-/Limits [(subsection.7.3) (subsection.7.8)]
->> endobj
-3639 0 obj <<
-/Names [(subsection.7.9) 94 0 R (subsubsection.6.2.1) 479 0 R (subsubsection.6.2.2) 480 0 R (subsubsection.6.3.1) 527 0 R (subsubsection.6.3.2) 528 0 R (subsubsection.6.3.3) 537 0 R]
-/Limits [(subsection.7.9) (subsubsection.6.3.3)]
->> endobj
-3640 0 obj <<
-/Names [(subsubsection.6.4.1) 563 0 R (subsubsection.6.4.2) 564 0 R (subsubsection.6.4.3) 585 0 R (subsubsection.6.5.1) 602 0 R (subsubsection.6.5.2) 603 0 R (subsubsection.6.6.1) 917 0 R]
-/Limits [(subsubsection.6.4.1) (subsubsection.6.6.1)]
->> endobj
-3641 0 obj <<
-/Names [(subsubsection.6.6.2) 918 0 R (subsubsection.6.6.3) 920 0 R (subsubsection.6.6.4) 937 0 R (subsubsection.7.1.1) 980 0 R (subsubsection.7.10.1) 1497 0 R (subsubsection.7.11.1) 1553 0 R]
-/Limits [(subsubsection.6.6.2) (subsubsection.7.11.1)]
->> endobj
-3642 0 obj <<
-/Names [(subsubsection.7.12.1) 1639 0 R (subsubsection.7.13.1) 1689 0 R (subsubsection.7.14.1) 1742 0 R (subsubsection.7.15.1) 1796 0 R (subsubsection.7.16.1) 1913 0 R (subsubsection.7.17.1) 2091 0 R]
-/Limits [(subsubsection.7.12.1) (subsubsection.7.17.1)]
->> endobj
-3643 0 obj <<
-/Names [(subsubsection.7.17.2) 2092 0 R (subsubsection.7.18.1) 2156 0 R (subsubsection.7.19.1) 2286 0 R (subsubsection.7.19.2) 2287 0 R (subsubsection.7.2.1) 1021 0 R (subsubsection.7.20.1) 2335 0 R]
-/Limits [(subsubsection.7.17.2) (subsubsection.7.20.1)]
->> endobj
-3644 0 obj <<
-/Names [(subsubsection.7.20.2) 2336 0 R (subsubsection.7.21.1) 2387 0 R (subsubsection.7.22.1) 2435 0 R (subsubsection.7.22.2) 2436 0 R (subsubsection.7.23.1) 2486 0 R (subsubsection.7.23.2) 2487 0 R]
-/Limits [(subsubsection.7.20.2) (subsubsection.7.23.2)]
->> endobj
-3645 0 obj <<
-/Names [(subsubsection.7.24.1) 2557 0 R (subsubsection.7.24.2) 2558 0 R (subsubsection.7.25.1) 3126 0 R (subsubsection.7.25.2) 3127 0 R (subsubsection.7.3.1) 1069 0 R (subsubsection.7.4.1) 1108 0 R]
-/Limits [(subsubsection.7.24.1) (subsubsection.7.4.1)]
->> endobj
-3646 0 obj <<
-/Names [(subsubsection.7.5.1) 1209 0 R (subsubsection.7.6.1) 1262 0 R (subsubsection.7.7.1) 1304 0 R (subsubsection.7.8.1) 1409 0 R (subsubsection.7.9.1) 1458 0 R (table.1) 606 0 R]
-/Limits [(subsubsection.7.5.1) (table.1)]
->> endobj
-3647 0 obj <<
-/Names [(table.10) 3172 0 R (table.11) 3179 0 R (table.12) 3183 0 R (table.13) 3185 0 R (table.14) 3187 0 R (table.15) 3194 0 R]
-/Limits [(table.10) (table.15)]
->> endobj
-3648 0 obj <<
-/Names [(table.16) 3196 0 R (table.17) 3198 0 R (table.18) 3216 0 R (table.2) 609 0 R (table.3) 939 0 R (table.4) 2116 0 R]
-/Limits [(table.16) (table.4)]
->> endobj
-3649 0 obj <<
-/Names [(table.5) 2118 0 R (table.6) 2311 0 R (table.7) 2338 0 R (table.8) 3158 0 R (table.9) 3160 0 R]
-/Limits [(table.5) (table.9)]
->> endobj
-3650 0 obj <<
-/Kids [3492 0 R 3493 0 R 3494 0 R 3495 0 R 3496 0 R 3497 0 R]
-/Limits [(Doc-Start) (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f)]
->> endobj
-3651 0 obj <<
-/Kids [3498 0 R 3499 0 R 3500 0 R 3501 0 R 3502 0 R 3503 0 R]
-/Limits [(group__Datatypes_ga6b8429baa2a70746836586aad6905b64) (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b)]
->> endobj
-3652 0 obj <<
-/Kids [3504 0 R 3505 0 R 3506 0 R 3507 0 R 3508 0 R 3509 0 R]
-/Limits [(group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106)]
->> endobj
-3653 0 obj <<
-/Kids [3510 0 R 3511 0 R 3512 0 R 3513 0 R 3514 0 R 3515 0 R]
-/Limits [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) (index)]
->> endobj
-3654 0 obj <<
-/Kids [3516 0 R 3517 0 R 3518 0 R 3519 0 R 3520 0 R 3521 0 R]
-/Limits [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4)]
->> endobj
-3655 0 obj <<
-/Kids [3522 0 R 3523 0 R 3524 0 R 3525 0 R 3526 0 R 3527 0 R]
-/Limits [(interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d)]
->> endobj
-3656 0 obj <<
-/Kids [3528 0 R 3529 0 R 3530 0 R 3531 0 R 3532 0 R 3533 0 R]
-/Limits [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787)]
->> endobj
-3657 0 obj <<
-/Kids [3534 0 R 3535 0 R 3536 0 R 3537 0 R 3538 0 R 3539 0 R]
-/Limits [(interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3)]
->> endobj
-3658 0 obj <<
-/Kids [3540 0 R 3541 0 R 3542 0 R 3543 0 R 3544 0 R 3545 0 R]
-/Limits [(interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) (interfaceppl__Grid__Generator__System__tag_a4578b5352510727810a7c3be32208aae)]
->> endobj
-3659 0 obj <<
-/Kids [3546 0 R 3547 0 R 3548 0 R 3549 0 R 3550 0 R 3551 0 R]
-/Limits [(interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6822)]
->> endobj
-3660 0 obj <<
-/Kids [3552 0 R 3553 0 R 3554 0 R 3555 0 R 3556 0 R 3557 0 R]
-/Limits [(interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4)]
->> endobj
-3661 0 obj <<
-/Kids [3558 0 R 3559 0 R 3560 0 R 3561 0 R 3562 0 R 3563 0 R]
-/Limits [(interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3)]
->> endobj
-3662 0 obj <<
-/Kids [3564 0 R 3565 0 R 3566 0 R 3567 0 R 3568 0 R 3569 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3)]
->> endobj
-3663 0 obj <<
-/Kids [3570 0 R 3571 0 R 3572 0 R 3573 0 R 3574 0 R 3575 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a64b1a8e66388915a57bfd0b53a2e46c5)]
->> endobj
-3664 0 obj <<
-/Kids [3576 0 R 3577 0 R 3578 0 R 3579 0 R 3580 0 R 3581 0 R]
-/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741)]
->> endobj
-3665 0 obj <<
-/Kids [3582 0 R 3583 0 R 3584 0 R 3585 0 R 3586 0 R 3587 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14)]
->> endobj
-3666 0 obj <<
-/Kids [3588 0 R 3589 0 R 3590 0 R 3591 0 R 3592 0 R 3593 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b)]
->> endobj
-3667 0 obj <<
-/Kids [3594 0 R 3595 0 R 3596 0 R 3597 0 R 3598 0 R 3599 0 R]
-/Limits [(interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) (page.23)]
->> endobj
-3668 0 obj <<
-/Kids [3600 0 R 3601 0 R 3602 0 R 3603 0 R 3604 0 R 3605 0 R]
-/Limits [(page.24) (page.56)]
->> endobj
-3669 0 obj <<
-/Kids [3606 0 R 3607 0 R 3608 0 R 3609 0 R 3610 0 R 3611 0 R]
-/Limits [(page.57) (page.i)]
->> endobj
-3670 0 obj <<
-/Kids [3612 0 R 3613 0 R 3614 0 R 3615 0 R 3616 0 R 3617 0 R]
-/Limits [(page.ii) (paragraph.7.25.2.14)]
->> endobj
-3671 0 obj <<
-/Kids [3618 0 R 3619 0 R 3620 0 R 3621 0 R 3622 0 R 3623 0 R]
-/Limits [(paragraph.7.25.2.15) (section*.15)]
->> endobj
-3672 0 obj <<
-/Kids [3624 0 R 3625 0 R 3626 0 R 3627 0 R 3628 0 R 3629 0 R]
-/Limits [(section*.16) (section*.48)]
->> endobj
-3673 0 obj <<
-/Kids [3630 0 R 3631 0 R 3632 0 R 3633 0 R 3634 0 R 3635 0 R]
-/Limits [(section*.49) (subsection.7.14)]
->> endobj
-3674 0 obj <<
-/Kids [3636 0 R 3637 0 R 3638 0 R 3639 0 R 3640 0 R 3641 0 R]
-/Limits [(subsection.7.15) (subsubsection.7.11.1)]
->> endobj
-3675 0 obj <<
-/Kids [3642 0 R 3643 0 R 3644 0 R 3645 0 R 3646 0 R 3647 0 R]
-/Limits [(subsubsection.7.12.1) (table.15)]
->> endobj
-3676 0 obj <<
-/Kids [3648 0 R 3649 0 R]
-/Limits [(table.16) (table.9)]
->> endobj
-3677 0 obj <<
-/Kids [3650 0 R 3651 0 R 3652 0 R 3653 0 R 3654 0 R 3655 0 R]
-/Limits [(Doc-Start) (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d)]
->> endobj
-3678 0 obj <<
-/Kids [3656 0 R 3657 0 R 3658 0 R 3659 0 R 3660 0 R 3661 0 R]
-/Limits [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3)]
->> endobj
-3679 0 obj <<
-/Kids [3662 0 R 3663 0 R 3664 0 R 3665 0 R 3666 0 R 3667 0 R]
-/Limits [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) (page.23)]
->> endobj
-3680 0 obj <<
-/Kids [3668 0 R 3669 0 R 3670 0 R 3671 0 R 3672 0 R 3673 0 R]
-/Limits [(page.24) (subsection.7.14)]
->> endobj
-3681 0 obj <<
-/Kids [3674 0 R 3675 0 R 3676 0 R]
-/Limits [(subsection.7.15) (table.9)]
->> endobj
-3682 0 obj <<
-/Kids [3677 0 R 3678 0 R 3679 0 R 3680 0 R 3681 0 R]
-/Limits [(Doc-Start) (table.9)]
->> endobj
-3683 0 obj <<
-/Dests 3682 0 R
->> endobj
-3684 0 obj <<
-/Type /Catalog
-/Pages 3490 0 R
-/Outlines 3491 0 R
-/Names 3683 0 R
-/PageMode/UseOutlines/PageLabels<</Nums[0<</S/D>>4<</S/r>>6<</S/D>>]>>
-/OpenAction 161 0 R
->> endobj
-3685 0 obj <<
-/Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords()
-/CreationDate (D:20120628125824+02'00')
-/ModDate (D:20120628125824+02'00')
-/Trapped /False
-/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0)
->> endobj
-xref
-0 3686
-0000000000 65535 f 
-0000000015 00000 n 
-0000037959 00000 n 
-0000967654 00000 n 
-0000000060 00000 n 
-0000000134 00000 n 
-0000042765 00000 n 
-0000967569 00000 n 
-0000000179 00000 n 
-0000000344 00000 n 
-0000077831 00000 n 
-0000967482 00000 n 
-0000000389 00000 n 
-0000000575 00000 n 
-0000097424 00000 n 
-0000967356 00000 n 
-0000000621 00000 n 
-0000000711 00000 n 
-0000097480 00000 n 
-0000967295 00000 n 
-0000000762 00000 n 
-0000000824 00000 n 
-0000104743 00000 n 
-0000967169 00000 n 
-0000000870 00000 n 
-0000000955 00000 n 
-0000104799 00000 n 
-0000967108 00000 n 
-0000001006 00000 n 
-0000001086 00000 n 
-0000111183 00000 n 
-0000966982 00000 n 
-0000001132 00000 n 
-0000001262 00000 n 
-0000111296 00000 n 
-0000966908 00000 n 
-0000001313 00000 n 
-0000001446 00000 n 
-0000114873 00000 n 
-0000966821 00000 n 
-0000001497 00000 n 
-0000001728 00000 n 
-0000121620 00000 n 
-0000966734 00000 n 
-0000001779 00000 n 
-0000001889 00000 n 
-0000130439 00000 n 
-0000966647 00000 n 
-0000001940 00000 n 
-0000002040 00000 n 
-0000137404 00000 n 
-0000966560 00000 n 
-0000002091 00000 n 
-0000002201 00000 n 
-0000147494 00000 n 
-0000966486 00000 n 
-0000002252 00000 n 
-0000002367 00000 n 
-0000204949 00000 n 
-0000966371 00000 n 
-0000002413 00000 n 
-0000002538 00000 n 
-0000205062 00000 n 
-0000966297 00000 n 
-0000002589 00000 n 
-0000003000 00000 n 
-0000213447 00000 n 
-0000966210 00000 n 
-0000003051 00000 n 
-0000003333 00000 n 
-0000214207 00000 n 
-0000966123 00000 n 
-0000003384 00000 n 
-0000003618 00000 n 
-0000231867 00000 n 
-0000966036 00000 n 
-0000003669 00000 n 
-0000004017 00000 n 
-0000232511 00000 n 
-0000965949 00000 n 
-0000004068 00000 n 
-0000004335 00000 n 
-0000253197 00000 n 
-0000965862 00000 n 
-0000004386 00000 n 
-0000004615 00000 n 
-0000263942 00000 n 
-0000965775 00000 n 
-0000004666 00000 n 
-0000005014 00000 n 
-0000272728 00000 n 
-0000965688 00000 n 
-0000005065 00000 n 
-0000005332 00000 n 
-0000295781 00000 n 
-0000965601 00000 n 
-0000005383 00000 n 
-0000005612 00000 n 
-0000305182 00000 n 
-0000965512 00000 n 
-0000005664 00000 n 
-0000006008 00000 n 
-0000314136 00000 n 
-0000965421 00000 n 
-0000006061 00000 n 
-0000006324 00000 n 
-0000323934 00000 n 
-0000965329 00000 n 
-0000006377 00000 n 
-0000006602 00000 n 
-0000345270 00000 n 
-0000965237 00000 n 
-0000006655 00000 n 
-0000007027 00000 n 
-0000355241 00000 n 
-0000965145 00000 n 
-0000007080 00000 n 
-0000007371 00000 n 
-0000364012 00000 n 
-0000965053 00000 n 
-0000007424 00000 n 
-0000007677 00000 n 
-0000387081 00000 n 
-0000964961 00000 n 
-0000007730 00000 n 
-0000007998 00000 n 
-0000409017 00000 n 
-0000964869 00000 n 
-0000008051 00000 n 
-0000008289 00000 n 
-0000442949 00000 n 
-0000964777 00000 n 
-0000008342 00000 n 
-0000008613 00000 n 
-0000450563 00000 n 
-0000964685 00000 n 
-0000008666 00000 n 
-0000008904 00000 n 
-0000482269 00000 n 
-0000964593 00000 n 
-0000008957 00000 n 
-0000009228 00000 n 
-0000488613 00000 n 
-0000964501 00000 n 
-0000009281 00000 n 
-0000009532 00000 n 
-0000498610 00000 n 
-0000964409 00000 n 
-0000009585 00000 n 
-0000010005 00000 n 
-0000520045 00000 n 
-0000964317 00000 n 
-0000010058 00000 n 
-0000010445 00000 n 
-0000530781 00000 n 
-0000964225 00000 n 
-0000010498 00000 n 
-0000010837 00000 n 
-0000537852 00000 n 
-0000964147 00000 n 
-0000010890 00000 n 
-0000011120 00000 n 
-0000012518 00000 n 
-0000012637 00000 n 
-0000015975 00000 n 
-0000011172 00000 n 
-0000015862 00000 n 
-0000015918 00000 n 
-0000960825 00000 n 
-0000959247 00000 n 
-0000959680 00000 n 
-0000959391 00000 n 
-0000961356 00000 n 
-0000961712 00000 n 
-0000015631 00000 n 
-0000015815 00000 n 
-0000016402 00000 n 
-0000016227 00000 n 
-0000016127 00000 n 
-0000016346 00000 n 
-0000023443 00000 n 
-0000023609 00000 n 
-0000023761 00000 n 
-0000023927 00000 n 
-0000024225 00000 n 
-0000018264 00000 n 
-0000024405 00000 n 
-0000020467 00000 n 
-0000024625 00000 n 
-0000018077 00000 n 
-0000016443 00000 n 
-0000024569 00000 n 
-0000960999 00000 n 
-0000024077 00000 n 
-0000960115 00000 n 
-0000020236 00000 n 
-0000020420 00000 n 
-0000023212 00000 n 
-0000023396 00000 n 
-0000077944 00000 n 
-0000042877 00000 n 
-0000025039 00000 n 
-0000024864 00000 n 
-0000024764 00000 n 
-0000024983 00000 n 
-0000026942 00000 n 
-0000027093 00000 n 
-0000027244 00000 n 
-0000027395 00000 n 
-0000027546 00000 n 
-0000027703 00000 n 
-0000027853 00000 n 
-0000028010 00000 n 
-0000028161 00000 n 
-0000028318 00000 n 
-0000028475 00000 n 
-0000028631 00000 n 
-0000028788 00000 n 
-0000028945 00000 n 
-0000029102 00000 n 
-0000029252 00000 n 
-0000029407 00000 n 
-0000029564 00000 n 
-0000029721 00000 n 
-0000029877 00000 n 
-0000030034 00000 n 
-0000030190 00000 n 
-0000030347 00000 n 
-0000030503 00000 n 
-0000030660 00000 n 
-0000030818 00000 n 
-0000030976 00000 n 
-0000031134 00000 n 
-0000031292 00000 n 
-0000031450 00000 n 
-0000031608 00000 n 
-0000031764 00000 n 
-0000031920 00000 n 
-0000032078 00000 n 
-0000032236 00000 n 
-0000032394 00000 n 
-0000032552 00000 n 
-0000032710 00000 n 
-0000032868 00000 n 
-0000033026 00000 n 
-0000033183 00000 n 
-0000033403 00000 n 
-0000026483 00000 n 
-0000025080 00000 n 
-0000033347 00000 n 
-0000033804 00000 n 
-0000033629 00000 n 
-0000033529 00000 n 
-0000033748 00000 n 
-0000041892 00000 n 
-0000042076 00000 n 
-0000037795 00000 n 
-0000038071 00000 n 
-0000037656 00000 n 
-0000033845 00000 n 
-0000960467 00000 n 
-0000038014 00000 n 
-0000961532 00000 n 
-0000961830 00000 n 
-0000042261 00000 n 
-0000042442 00000 n 
-0000042603 00000 n 
-0000042991 00000 n 
-0000041721 00000 n 
-0000038236 00000 n 
-0000042820 00000 n 
-0000042934 00000 n 
-0000046502 00000 n 
-0000046837 00000 n 
-0000046363 00000 n 
-0000043143 00000 n 
-0000046666 00000 n 
-0000046723 00000 n 
-0000046780 00000 n 
-0000050375 00000 n 
-0000050708 00000 n 
-0000050236 00000 n 
-0000046976 00000 n 
-0000050537 00000 n 
-0000050594 00000 n 
-0000050651 00000 n 
-0000054082 00000 n 
-0000054416 00000 n 
-0000053943 00000 n 
-0000050847 00000 n 
-0000054246 00000 n 
-0000054302 00000 n 
-0000054359 00000 n 
-0000058262 00000 n 
-0000058537 00000 n 
-0000058123 00000 n 
-0000054555 00000 n 
-0000058424 00000 n 
-0000058480 00000 n 
-0000061980 00000 n 
-0000062257 00000 n 
-0000061841 00000 n 
-0000058676 00000 n 
-0000062144 00000 n 
-0000062200 00000 n 
-0000961948 00000 n 
-0000065797 00000 n 
-0000066186 00000 n 
-0000065658 00000 n 
-0000062396 00000 n 
-0000065959 00000 n 
-0000066015 00000 n 
-0000066072 00000 n 
-0000066129 00000 n 
-0000069974 00000 n 
-0000070365 00000 n 
-0000069835 00000 n 
-0000066325 00000 n 
-0000070138 00000 n 
-0000070194 00000 n 
-0000070251 00000 n 
-0000070308 00000 n 
-0000073543 00000 n 
-0000073989 00000 n 
-0000073404 00000 n 
-0000070504 00000 n 
-0000073705 00000 n 
-0000073761 00000 n 
-0000073818 00000 n 
-0000073875 00000 n 
-0000073932 00000 n 
-0000960289 00000 n 
-0000077064 00000 n 
-0000077240 00000 n 
-0000077416 00000 n 
-0000077611 00000 n 
-0000078001 00000 n 
-0000076901 00000 n 
-0000074141 00000 n 
-0000077775 00000 n 
-0000077887 00000 n 
-0000082072 00000 n 
-0000082290 00000 n 
-0000081933 00000 n 
-0000078153 00000 n 
-0000082234 00000 n 
-0000086246 00000 n 
-0000086466 00000 n 
-0000086107 00000 n 
-0000082416 00000 n 
-0000086410 00000 n 
-0000962066 00000 n 
-0000089889 00000 n 
-0000090107 00000 n 
-0000089750 00000 n 
-0000086592 00000 n 
-0000090051 00000 n 
-0000093570 00000 n 
-0000093790 00000 n 
-0000093431 00000 n 
-0000090233 00000 n 
-0000093734 00000 n 
-0000096661 00000 n 
-0000096837 00000 n 
-0000096994 00000 n 
-0000099109 00000 n 
-0000097149 00000 n 
-0000097536 00000 n 
-0000096498 00000 n 
-0000093916 00000 n 
-0000097311 00000 n 
-0000097367 00000 n 
-0000099266 00000 n 
-0000099423 00000 n 
-0000099580 00000 n 
-0000099736 00000 n 
-0000099946 00000 n 
-0000100103 00000 n 
-0000100286 00000 n 
-0000100443 00000 n 
-0000100616 00000 n 
-0000100772 00000 n 
-0000100968 00000 n 
-0000101124 00000 n 
-0000101303 00000 n 
-0000101460 00000 n 
-0000101632 00000 n 
-0000101789 00000 n 
-0000101986 00000 n 
-0000102143 00000 n 
-0000102322 00000 n 
-0000102479 00000 n 
-0000102651 00000 n 
-0000102808 00000 n 
-0000103004 00000 n 
-0000103162 00000 n 
-0000103341 00000 n 
-0000103495 00000 n 
-0000103666 00000 n 
-0000103824 00000 n 
-0000104026 00000 n 
-0000104184 00000 n 
-0000104367 00000 n 
-0000104523 00000 n 
-0000104855 00000 n 
-0000098714 00000 n 
-0000097675 00000 n 
-0000104687 00000 n 
-0000205005 00000 n 
-0000205630 00000 n 
-0000214149 00000 n 
-0000223976 00000 n 
-0000232453 00000 n 
-0000253140 00000 n 
-0000263884 00000 n 
-0000272670 00000 n 
-0000295723 00000 n 
-0000305124 00000 n 
-0000314078 00000 n 
-0000323876 00000 n 
-0000345212 00000 n 
-0000355183 00000 n 
-0000106426 00000 n 
-0000106603 00000 n 
-0000106761 00000 n 
-0000106941 00000 n 
-0000107099 00000 n 
-0000107273 00000 n 
-0000107430 00000 n 
-0000107611 00000 n 
-0000107768 00000 n 
-0000107940 00000 n 
-0000108098 00000 n 
-0000108279 00000 n 
-0000108437 00000 n 
-0000108614 00000 n 
-0000108772 00000 n 
-0000108983 00000 n 
-0000109372 00000 n 
-0000109530 00000 n 
-0000109735 00000 n 
-0000110125 00000 n 
-0000110283 00000 n 
-0000110478 00000 n 
-0000110636 00000 n 
-0000110807 00000 n 
-0000110965 00000 n 
-0000111352 00000 n 
-0000106079 00000 n 
-0000104994 00000 n 
-0000111127 00000 n 
-0000109178 00000 n 
-0000109930 00000 n 
-0000111239 00000 n 
-0000363954 00000 n 
-0000375772 00000 n 
-0000399971 00000 n 
-0000442891 00000 n 
-0000450505 00000 n 
-0000482211 00000 n 
-0000488555 00000 n 
-0000498552 00000 n 
-0000530723 00000 n 
-0000510045 00000 n 
-0000537794 00000 n 
-0000113462 00000 n 
-0000113651 00000 n 
-0000113840 00000 n 
-0000114029 00000 n 
-0000114218 00000 n 
-0000114407 00000 n 
-0000114596 00000 n 
-0000115675 00000 n 
-0000113275 00000 n 
-0000111491 00000 n 
-0000114760 00000 n 
-0000114816 00000 n 
-0000114929 00000 n 
-0000114986 00000 n 
-0000115043 00000 n 
-0000115099 00000 n 
-0000115156 00000 n 
-0000115212 00000 n 
-0000115268 00000 n 
-0000115324 00000 n 
-0000115381 00000 n 
-0000115438 00000 n 
-0000115495 00000 n 
-0000115557 00000 n 
-0000115614 00000 n 
-0000962184 00000 n 
-0000116912 00000 n 
-0000117187 00000 n 
-0000116773 00000 n 
-0000115853 00000 n 
-0000117074 00000 n 
-0000117130 00000 n 
-0000960644 00000 n 
-0000119232 00000 n 
-0000119424 00000 n 
-0000119616 00000 n 
-0000119807 00000 n 
-0000119999 00000 n 
-0000120191 00000 n 
-0000120383 00000 n 
-0000120575 00000 n 
-0000120767 00000 n 
-0000120959 00000 n 
-0000121151 00000 n 
-0000121343 00000 n 
-0000122530 00000 n 
-0000119005 00000 n 
-0000117352 00000 n 
-0000121507 00000 n 
-0000121563 00000 n 
-0000121676 00000 n 
-0000121733 00000 n 
-0000121790 00000 n 
-0000121847 00000 n 
-0000121904 00000 n 
-0000121961 00000 n 
-0000122018 00000 n 
-0000122075 00000 n 
-0000122132 00000 n 
-0000122189 00000 n 
-0000122246 00000 n 
-0000959826 00000 n 
-0000122302 00000 n 
-0000122359 00000 n 
-0000122416 00000 n 
-0000122473 00000 n 
-0000124010 00000 n 
-0000123735 00000 n 
-0000124124 00000 n 
-0000123596 00000 n 
-0000122722 00000 n 
-0000123897 00000 n 
-0000123953 00000 n 
-0000124067 00000 n 
-0000126691 00000 n 
-0000126880 00000 n 
-0000127103 00000 n 
-0000127327 00000 n 
-0000127773 00000 n 
-0000127997 00000 n 
-0000128220 00000 n 
-0000128444 00000 n 
-0000128667 00000 n 
-0000128889 00000 n 
-0000129112 00000 n 
-0000129335 00000 n 
-0000129782 00000 n 
-0000129972 00000 n 
-0000130162 00000 n 
-0000131454 00000 n 
-0000126424 00000 n 
-0000124289 00000 n 
-0000130326 00000 n 
-0000130382 00000 n 
-0000130495 00000 n 
-0000127551 00000 n 
-0000129559 00000 n 
-0000130552 00000 n 
-0000130609 00000 n 
-0000130666 00000 n 
-0000130723 00000 n 
-0000130780 00000 n 
-0000130837 00000 n 
-0000961175 00000 n 
-0000130899 00000 n 
-0000130960 00000 n 
-0000131022 00000 n 
-0000131083 00000 n 
-0000131145 00000 n 
-0000131207 00000 n 
-0000131269 00000 n 
-0000131331 00000 n 
-0000131393 00000 n 
-0000133217 00000 n 
-0000133335 00000 n 
-0000132999 00000 n 
-0000133449 00000 n 
-0000132860 00000 n 
-0000131646 00000 n 
-0000133161 00000 n 
-0000133278 00000 n 
-0000133392 00000 n 
-0000136167 00000 n 
-0000136359 00000 n 
-0000136551 00000 n 
-0000136743 00000 n 
-0000136935 00000 n 
-0000139691 00000 n 
-0000137127 00000 n 
-0000138092 00000 n 
-0000135988 00000 n 
-0000133628 00000 n 
-0000137291 00000 n 
-0000137347 00000 n 
-0000137460 00000 n 
-0000137517 00000 n 
-0000137574 00000 n 
-0000137631 00000 n 
-0000137688 00000 n 
-0000137745 00000 n 
-0000137802 00000 n 
-0000137859 00000 n 
-0000137916 00000 n 
-0000137978 00000 n 
-0000138035 00000 n 
-0000958229 00000 n 
-0000958667 00000 n 
-0000958375 00000 n 
-0000962302 00000 n 
-0000139883 00000 n 
-0000140101 00000 n 
-0000139544 00000 n 
-0000138308 00000 n 
-0000140045 00000 n 
-0000141811 00000 n 
-0000142004 00000 n 
-0000142198 00000 n 
-0000142392 00000 n 
-0000142564 00000 n 
-0000142758 00000 n 
-0000142930 00000 n 
-0000143124 00000 n 
-0000143303 00000 n 
-0000143497 00000 n 
-0000143676 00000 n 
-0000143868 00000 n 
-0000144040 00000 n 
-0000144234 00000 n 
-0000144405 00000 n 
-0000144598 00000 n 
-0000144776 00000 n 
-0000144969 00000 n 
-0000145148 00000 n 
-0000145342 00000 n 
-0000145538 00000 n 
-0000145732 00000 n 
-0000145928 00000 n 
-0000146122 00000 n 
-0000146293 00000 n 
-0000146487 00000 n 
-0000146656 00000 n 
-0000146849 00000 n 
-0000147025 00000 n 
-0000149878 00000 n 
-0000150056 00000 n 
-0000147217 00000 n 
-0000148401 00000 n 
-0000141440 00000 n 
-0000140253 00000 n 
-0000147381 00000 n 
-0000147437 00000 n 
-0000147550 00000 n 
-0000147606 00000 n 
-0000147662 00000 n 
-0000147718 00000 n 
-0000147775 00000 n 
-0000147832 00000 n 
-0000147889 00000 n 
-0000147946 00000 n 
-0000148003 00000 n 
-0000148060 00000 n 
-0000148117 00000 n 
-0000148174 00000 n 
-0000148231 00000 n 
-0000148287 00000 n 
-0000148344 00000 n 
-0000189730 00000 n 
-0000150250 00000 n 
-0000150445 00000 n 
-0000150639 00000 n 
-0000150834 00000 n 
-0000151028 00000 n 
-0000151200 00000 n 
-0000151394 00000 n 
-0000151565 00000 n 
-0000151759 00000 n 
-0000151938 00000 n 
-0000152132 00000 n 
-0000152311 00000 n 
-0000152505 00000 n 
-0000152701 00000 n 
-0000152895 00000 n 
-0000153091 00000 n 
-0000153285 00000 n 
-0000153461 00000 n 
-0000153655 00000 n 
-0000153830 00000 n 
-0000154023 00000 n 
-0000154207 00000 n 
-0000154401 00000 n 
-0000154585 00000 n 
-0000154779 00000 n 
-0000154980 00000 n 
-0000155174 00000 n 
-0000155373 00000 n 
-0000158144 00000 n 
-0000158315 00000 n 
-0000155565 00000 n 
-0000156637 00000 n 
-0000149499 00000 n 
-0000148566 00000 n 
-0000155727 00000 n 
-0000155783 00000 n 
-0000155840 00000 n 
-0000155897 00000 n 
-0000155954 00000 n 
-0000156010 00000 n 
-0000156067 00000 n 
-0000156124 00000 n 
-0000156181 00000 n 
-0000156238 00000 n 
-0000156295 00000 n 
-0000156352 00000 n 
-0000156409 00000 n 
-0000156466 00000 n 
-0000156523 00000 n 
-0000156580 00000 n 
-0000158506 00000 n 
-0000158678 00000 n 
-0000158872 00000 n 
-0000159045 00000 n 
-0000159239 00000 n 
-0000159412 00000 n 
-0000159606 00000 n 
-0000159782 00000 n 
-0000159976 00000 n 
-0000160152 00000 n 
-0000160346 00000 n 
-0000160525 00000 n 
-0000160718 00000 n 
-0000160898 00000 n 
-0000161092 00000 n 
-0000161272 00000 n 
-0000161465 00000 n 
-0000161645 00000 n 
-0000161838 00000 n 
-0000162020 00000 n 
-0000162214 00000 n 
-0000162396 00000 n 
-0000162589 00000 n 
-0000162783 00000 n 
-0000162977 00000 n 
-0000163184 00000 n 
-0000166508 00000 n 
-0000166716 00000 n 
-0000163567 00000 n 
-0000164641 00000 n 
-0000157773 00000 n 
-0000156789 00000 n 
-0000163731 00000 n 
-0000163787 00000 n 
-0000163844 00000 n 
-0000163901 00000 n 
-0000163958 00000 n 
-0000164015 00000 n 
-0000164072 00000 n 
-0000164129 00000 n 
-0000164186 00000 n 
-0000164242 00000 n 
-0000164299 00000 n 
-0000164356 00000 n 
-0000164413 00000 n 
-0000164470 00000 n 
-0000164527 00000 n 
-0000164584 00000 n 
-0000163376 00000 n 
-0000166909 00000 n 
-0000167081 00000 n 
-0000167275 00000 n 
-0000167446 00000 n 
-0000167640 00000 n 
-0000167834 00000 n 
-0000168028 00000 n 
-0000168222 00000 n 
-0000168416 00000 n 
-0000168620 00000 n 
-0000169006 00000 n 
-0000169209 00000 n 
-0000169403 00000 n 
-0000169614 00000 n 
-0000170001 00000 n 
-0000170211 00000 n 
-0000170405 00000 n 
-0000170599 00000 n 
-0000170826 00000 n 
-0000171054 00000 n 
-0000171509 00000 n 
-0000171737 00000 n 
-0000171964 00000 n 
-0000172157 00000 n 
-0000172385 00000 n 
-0000172840 00000 n 
-0000173068 00000 n 
-0000173296 00000 n 
-0000173489 00000 n 
-0000173716 00000 n 
-0000174168 00000 n 
-0000177825 00000 n 
-0000178018 00000 n 
-0000178245 00000 n 
-0000178472 00000 n 
-0000178700 00000 n 
-0000178928 00000 n 
-0000174395 00000 n 
-0000175183 00000 n 
-0000166065 00000 n 
-0000164793 00000 n 
-0000174557 00000 n 
-0000174613 00000 n 
-0000174670 00000 n 
-0000174727 00000 n 
-0000174784 00000 n 
-0000174841 00000 n 
-0000174898 00000 n 
-0000168814 00000 n 
-0000174955 00000 n 
-0000175012 00000 n 
-0000169808 00000 n 
-0000175069 00000 n 
-0000175126 00000 n 
-0000171282 00000 n 
-0000172613 00000 n 
-0000173942 00000 n 
-0000189901 00000 n 
-0000190015 00000 n 
-0000190077 00000 n 
-0000190139 00000 n 
-0000190201 00000 n 
-0000190263 00000 n 
-0000190325 00000 n 
-0000190439 00000 n 
-0000190501 00000 n 
-0000190563 00000 n 
-0000190625 00000 n 
-0000190686 00000 n 
-0000193264 00000 n 
-0000193326 00000 n 
-0000193388 00000 n 
-0000179154 00000 n 
-0000179348 00000 n 
-0000179576 00000 n 
-0000180030 00000 n 
-0000180223 00000 n 
-0000180451 00000 n 
-0000180906 00000 n 
-0000181134 00000 n 
-0000181328 00000 n 
-0000181522 00000 n 
-0000181716 00000 n 
-0000181910 00000 n 
-0000182100 00000 n 
-0000182294 00000 n 
-0000182487 00000 n 
-0000182680 00000 n 
-0000182874 00000 n 
-0000183068 00000 n 
-0000183262 00000 n 
-0000183456 00000 n 
-0000183650 00000 n 
-0000183843 00000 n 
-0000184037 00000 n 
-0000184231 00000 n 
-0000184421 00000 n 
-0000184614 00000 n 
-0000184807 00000 n 
-0000185001 00000 n 
-0000185195 00000 n 
-0000189147 00000 n 
-0000185386 00000 n 
-0000186514 00000 n 
-0000177390 00000 n 
-0000175348 00000 n 
-0000185550 00000 n 
-0000179804 00000 n 
-0000180679 00000 n 
-0000185606 00000 n 
-0000185663 00000 n 
-0000185720 00000 n 
-0000185777 00000 n 
-0000185833 00000 n 
-0000185890 00000 n 
-0000185947 00000 n 
-0000186004 00000 n 
-0000186061 00000 n 
-0000186118 00000 n 
-0000186175 00000 n 
-0000186232 00000 n 
-0000186289 00000 n 
-0000186344 00000 n 
-0000186401 00000 n 
-0000186458 00000 n 
-0000962420 00000 n 
-0000193450 00000 n 
-0000193564 00000 n 
-0000193626 00000 n 
-0000193688 00000 n 
-0000193750 00000 n 
-0000193812 00000 n 
-0000193874 00000 n 
-0000193988 00000 n 
-0000194050 00000 n 
-0000194112 00000 n 
-0000194225 00000 n 
-0000194287 00000 n 
-0000194349 00000 n 
-0000196340 00000 n 
-0000189341 00000 n 
-0000190742 00000 n 
-0000189000 00000 n 
-0000186692 00000 n 
-0000189503 00000 n 
-0000189559 00000 n 
-0000189616 00000 n 
-0000189673 00000 n 
-0000189787 00000 n 
-0000189844 00000 n 
-0000189958 00000 n 
-0000190382 00000 n 
-0000192987 00000 n 
-0000194411 00000 n 
-0000192848 00000 n 
-0000190946 00000 n 
-0000193151 00000 n 
-0000193207 00000 n 
-0000193507 00000 n 
-0000193931 00000 n 
-0000194169 00000 n 
-0000196065 00000 n 
-0000196511 00000 n 
-0000195926 00000 n 
-0000194602 00000 n 
-0000196227 00000 n 
-0000196283 00000 n 
-0000196397 00000 n 
-0000196454 00000 n 
-0000199053 00000 n 
-0000199297 00000 n 
-0000199685 00000 n 
-0000200173 00000 n 
-0000200366 00000 n 
-0000200754 00000 n 
-0000201242 00000 n 
-0000201436 00000 n 
-0000201820 00000 n 
-0000202064 00000 n 
-0000202452 00000 n 
-0000202696 00000 n 
-0000203084 00000 n 
-0000203278 00000 n 
-0000203521 00000 n 
-0000203908 00000 n 
-0000204150 00000 n 
-0000204536 00000 n 
-0000204729 00000 n 
-0000205686 00000 n 
-0000198698 00000 n 
-0000196689 00000 n 
-0000204893 00000 n 
-0000205118 00000 n 
-0000205175 00000 n 
-0000199491 00000 n 
-0000205232 00000 n 
-0000199929 00000 n 
-0000200560 00000 n 
-0000205288 00000 n 
-0000200998 00000 n 
-0000201630 00000 n 
-0000205345 00000 n 
-0000202258 00000 n 
-0000205402 00000 n 
-0000202890 00000 n 
-0000205459 00000 n 
-0000203714 00000 n 
-0000205516 00000 n 
-0000204343 00000 n 
-0000205573 00000 n 
-0000208177 00000 n 
-0000208393 00000 n 
-0000208586 00000 n 
-0000208972 00000 n 
-0000209188 00000 n 
-0000209382 00000 n 
-0000209575 00000 n 
-0000209768 00000 n 
-0000209985 00000 n 
-0000210179 00000 n 
-0000210567 00000 n 
-0000210783 00000 n 
-0000210977 00000 n 
-0000211171 00000 n 
-0000211387 00000 n 
-0000211580 00000 n 
-0000211797 00000 n 
-0000211991 00000 n 
-0000212208 00000 n 
-0000212401 00000 n 
-0000212619 00000 n 
-0000212813 00000 n 
-0000213031 00000 n 
-0000213226 00000 n 
-0000214264 00000 n 
-0000207828 00000 n 
-0000205877 00000 n 
-0000213389 00000 n 
-0000213504 00000 n 
-0000213563 00000 n 
-0000208779 00000 n 
-0000213622 00000 n 
-0000213680 00000 n 
-0000210373 00000 n 
-0000213738 00000 n 
-0000213797 00000 n 
-0000213856 00000 n 
-0000213915 00000 n 
-0000213974 00000 n 
-0000214033 00000 n 
-0000214091 00000 n 
-0000217373 00000 n 
-0000217581 00000 n 
-0000217776 00000 n 
-0000217984 00000 n 
-0000218179 00000 n 
-0000218386 00000 n 
-0000218581 00000 n 
-0000218776 00000 n 
-0000218983 00000 n 
-0000219178 00000 n 
-0000219385 00000 n 
-0000219579 00000 n 
-0000219772 00000 n 
-0000219980 00000 n 
-0000220175 00000 n 
-0000220383 00000 n 
-0000220578 00000 n 
-0000220786 00000 n 
-0000220981 00000 n 
-0000221188 00000 n 
-0000221396 00000 n 
-0000221604 00000 n 
-0000221812 00000 n 
-0000222007 00000 n 
-0000222215 00000 n 
-0000222410 00000 n 
-0000222617 00000 n 
-0000222809 00000 n 
-0000224033 00000 n 
-0000216986 00000 n 
-0000214456 00000 n 
-0000222974 00000 n 
-0000223032 00000 n 
-0000223091 00000 n 
-0000223150 00000 n 
-0000223209 00000 n 
-0000223268 00000 n 
-0000223327 00000 n 
-0000223386 00000 n 
-0000223445 00000 n 
-0000223504 00000 n 
-0000223563 00000 n 
-0000223622 00000 n 
-0000223681 00000 n 
-0000223740 00000 n 
-0000223799 00000 n 
-0000223858 00000 n 
-0000223917 00000 n 
-0000962539 00000 n 
-0000226717 00000 n 
-0000226949 00000 n 
-0000227144 00000 n 
-0000227374 00000 n 
-0000227763 00000 n 
-0000227958 00000 n 
-0000228190 00000 n 
-0000228579 00000 n 
-0000228772 00000 n 
-0000229004 00000 n 
-0000229394 00000 n 
-0000229626 00000 n 
-0000230016 00000 n 
-0000230211 00000 n 
-0000230443 00000 n 
-0000230833 00000 n 
-0000231065 00000 n 
-0000231453 00000 n 
-0000231646 00000 n 
-0000232567 00000 n 
-0000226357 00000 n 
-0000224212 00000 n 
-0000231809 00000 n 
-0000231924 00000 n 
-0000231983 00000 n 
-0000232041 00000 n 
-0000227568 00000 n 
-0000232099 00000 n 
-0000228385 00000 n 
-0000232158 00000 n 
-0000229199 00000 n 
-0000232217 00000 n 
-0000229821 00000 n 
-0000232276 00000 n 
-0000230638 00000 n 
-0000232335 00000 n 
-0000231260 00000 n 
-0000232394 00000 n 
-0000235444 00000 n 
-0000235657 00000 n 
-0000235850 00000 n 
-0000236065 00000 n 
-0000236260 00000 n 
-0000236475 00000 n 
-0000236670 00000 n 
-0000237060 00000 n 
-0000237275 00000 n 
-0000237470 00000 n 
-0000237665 00000 n 
-0000237876 00000 n 
-0000238066 00000 n 
-0000238261 00000 n 
-0000238476 00000 n 
-0000238671 00000 n 
-0000238886 00000 n 
-0000239081 00000 n 
-0000239470 00000 n 
-0000239685 00000 n 
-0000239880 00000 n 
-0000240094 00000 n 
-0000240287 00000 n 
-0000240676 00000 n 
-0000240891 00000 n 
-0000241086 00000 n 
-0000241474 00000 n 
-0000241689 00000 n 
-0000241884 00000 n 
-0000242098 00000 n 
-0000242293 00000 n 
-0000242507 00000 n 
-0000242700 00000 n 
-0000243089 00000 n 
-0000243302 00000 n 
-0000247606 00000 n 
-0000247821 00000 n 
-0000248016 00000 n 
-0000248231 00000 n 
-0000248426 00000 n 
-0000248640 00000 n 
-0000243494 00000 n 
-0000244599 00000 n 
-0000234940 00000 n 
-0000232759 00000 n 
-0000243659 00000 n 
-0000243717 00000 n 
-0000243776 00000 n 
-0000243835 00000 n 
-0000243893 00000 n 
-0000236865 00000 n 
-0000243952 00000 n 
-0000244010 00000 n 
-0000244069 00000 n 
-0000244128 00000 n 
-0000239276 00000 n 
-0000244187 00000 n 
-0000244246 00000 n 
-0000240481 00000 n 
-0000244305 00000 n 
-0000241281 00000 n 
-0000244364 00000 n 
-0000244423 00000 n 
-0000244482 00000 n 
-0000242894 00000 n 
-0000244541 00000 n 
-0000248835 00000 n 
-0000249050 00000 n 
-0000249245 00000 n 
-0000249451 00000 n 
-0000249645 00000 n 
-0000249839 00000 n 
-0000250228 00000 n 
-0000250435 00000 n 
-0000250630 00000 n 
-0000250836 00000 n 
-0000251029 00000 n 
-0000251235 00000 n 
-0000251430 00000 n 
-0000251625 00000 n 
-0000251832 00000 n 
-0000252027 00000 n 
-0000252222 00000 n 
-0000252429 00000 n 
-0000256593 00000 n 
-0000256800 00000 n 
-0000256994 00000 n 
-0000257189 00000 n 
-0000257396 00000 n 
-0000257591 00000 n 
-0000257785 00000 n 
-0000252624 00000 n 
-0000253666 00000 n 
-0000247237 00000 n 
-0000244778 00000 n 
-0000252787 00000 n 
-0000252845 00000 n 
-0000252904 00000 n 
-0000252963 00000 n 
-0000253022 00000 n 
-0000253081 00000 n 
-0000253254 00000 n 
-0000253313 00000 n 
-0000250033 00000 n 
-0000958521 00000 n 
-0000959102 00000 n 
-0000253371 00000 n 
-0000253430 00000 n 
-0000253489 00000 n 
-0000253548 00000 n 
-0000253607 00000 n 
-0000258175 00000 n 
-0000258382 00000 n 
-0000258577 00000 n 
-0000258772 00000 n 
-0000258979 00000 n 
-0000259174 00000 n 
-0000259368 00000 n 
-0000259575 00000 n 
-0000259770 00000 n 
-0000259977 00000 n 
-0000260172 00000 n 
-0000260379 00000 n 
-0000260574 00000 n 
-0000260780 00000 n 
-0000260973 00000 n 
-0000261180 00000 n 
-0000261375 00000 n 
-0000261581 00000 n 
-0000261776 00000 n 
-0000262008 00000 n 
-0000262203 00000 n 
-0000262433 00000 n 
-0000262819 00000 n 
-0000266988 00000 n 
-0000267219 00000 n 
-0000267608 00000 n 
-0000263012 00000 n 
-0000264175 00000 n 
-0000256161 00000 n 
-0000253886 00000 n 
-0000263177 00000 n 
-0000263235 00000 n 
-0000263294 00000 n 
-0000257980 00000 n 
-0000263353 00000 n 
-0000263412 00000 n 
-0000263471 00000 n 
-0000263530 00000 n 
-0000263589 00000 n 
-0000263648 00000 n 
-0000263707 00000 n 
-0000263766 00000 n 
-0000263825 00000 n 
-0000263999 00000 n 
-0000264058 00000 n 
-0000264116 00000 n 
-0000262626 00000 n 
-0000267802 00000 n 
-0000268033 00000 n 
-0000268422 00000 n 
-0000268653 00000 n 
-0000269043 00000 n 
-0000269237 00000 n 
-0000269469 00000 n 
-0000269664 00000 n 
-0000269896 00000 n 
-0000270285 00000 n 
-0000270479 00000 n 
-0000270694 00000 n 
-0000270889 00000 n 
-0000271104 00000 n 
-0000271299 00000 n 
-0000271513 00000 n 
-0000271706 00000 n 
-0000275980 00000 n 
-0000276195 00000 n 
-0000276390 00000 n 
-0000276780 00000 n 
-0000276994 00000 n 
-0000277188 00000 n 
-0000272095 00000 n 
-0000273020 00000 n 
-0000266619 00000 n 
-0000264367 00000 n 
-0000272258 00000 n 
-0000272316 00000 n 
-0000267414 00000 n 
-0000272375 00000 n 
-0000268227 00000 n 
-0000272434 00000 n 
-0000268848 00000 n 
-0000272493 00000 n 
-0000272552 00000 n 
-0000270091 00000 n 
-0000272611 00000 n 
-0000272785 00000 n 
-0000272844 00000 n 
-0000272903 00000 n 
-0000272961 00000 n 
-0000271900 00000 n 
-0000277577 00000 n 
-0000277792 00000 n 
-0000277987 00000 n 
-0000278202 00000 n 
-0000278396 00000 n 
-0000278786 00000 n 
-0000279001 00000 n 
-0000279195 00000 n 
-0000279410 00000 n 
-0000279605 00000 n 
-0000279820 00000 n 
-0000280015 00000 n 
-0000280404 00000 n 
-0000280618 00000 n 
-0000280812 00000 n 
-0000281200 00000 n 
-0000281415 00000 n 
-0000281610 00000 n 
-0000281825 00000 n 
-0000282018 00000 n 
-0000282233 00000 n 
-0000282428 00000 n 
-0000282818 00000 n 
-0000283033 00000 n 
-0000283228 00000 n 
-0000283441 00000 n 
-0000283633 00000 n 
-0000283848 00000 n 
-0000284043 00000 n 
-0000284258 00000 n 
-0000284452 00000 n 
-0000284666 00000 n 
-0000284860 00000 n 
-0000286026 00000 n 
-0000275440 00000 n 
-0000273212 00000 n 
-0000285025 00000 n 
-0000285083 00000 n 
-0000276585 00000 n 
-0000285142 00000 n 
-0000277382 00000 n 
-0000285201 00000 n 
-0000285260 00000 n 
-0000278591 00000 n 
-0000285318 00000 n 
-0000285377 00000 n 
-0000285436 00000 n 
-0000280210 00000 n 
-0000285495 00000 n 
-0000281005 00000 n 
-0000285554 00000 n 
-0000285613 00000 n 
-0000285672 00000 n 
-0000282623 00000 n 
-0000285731 00000 n 
-0000285790 00000 n 
-0000285849 00000 n 
-0000285908 00000 n 
-0000285967 00000 n 
-0000962664 00000 n 
-0000289079 00000 n 
-0000289286 00000 n 
-0000289481 00000 n 
-0000289676 00000 n 
-0000290065 00000 n 
-0000290272 00000 n 
-0000290467 00000 n 
-0000290674 00000 n 
-0000290869 00000 n 
-0000291075 00000 n 
-0000291269 00000 n 
-0000291463 00000 n 
-0000291670 00000 n 
-0000291865 00000 n 
-0000292060 00000 n 
-0000292267 00000 n 
-0000292462 00000 n 
-0000292669 00000 n 
-0000292864 00000 n 
-0000293058 00000 n 
-0000293265 00000 n 
-0000293460 00000 n 
-0000293667 00000 n 
-0000293861 00000 n 
-0000294056 00000 n 
-0000294446 00000 n 
-0000294653 00000 n 
-0000294848 00000 n 
-0000295043 00000 n 
-0000295249 00000 n 
-0000299255 00000 n 
-0000299462 00000 n 
-0000299657 00000 n 
-0000299864 00000 n 
-0000295443 00000 n 
-0000296544 00000 n 
-0000288647 00000 n 
-0000286192 00000 n 
-0000295606 00000 n 
-0000295664 00000 n 
-0000295838 00000 n 
-0000295897 00000 n 
-0000289871 00000 n 
-0000295956 00000 n 
-0000296015 00000 n 
-0000296073 00000 n 
-0000296132 00000 n 
-0000296191 00000 n 
-0000296250 00000 n 
-0000296308 00000 n 
-0000296367 00000 n 
-0000294251 00000 n 
-0000296426 00000 n 
-0000296485 00000 n 
-0000300059 00000 n 
-0000300266 00000 n 
-0000300461 00000 n 
-0000300667 00000 n 
-0000300860 00000 n 
-0000301067 00000 n 
-0000301261 00000 n 
-0000301492 00000 n 
-0000301687 00000 n 
-0000301917 00000 n 
-0000302306 00000 n 
-0000302501 00000 n 
-0000302732 00000 n 
-0000303122 00000 n 
-0000303316 00000 n 
-0000303546 00000 n 
-0000303740 00000 n 
-0000303969 00000 n 
-0000304355 00000 n 
-0000308432 00000 n 
-0000308662 00000 n 
-0000308856 00000 n 
-0000309087 00000 n 
-0000309477 00000 n 
-0000304548 00000 n 
-0000305591 00000 n 
-0000298877 00000 n 
-0000296764 00000 n 
-0000304713 00000 n 
-0000304771 00000 n 
-0000304830 00000 n 
-0000304889 00000 n 
-0000304947 00000 n 
-0000305006 00000 n 
-0000305065 00000 n 
-0000305239 00000 n 
-0000305297 00000 n 
-0000305356 00000 n 
-0000302111 00000 n 
-0000305415 00000 n 
-0000302927 00000 n 
-0000305474 00000 n 
-0000305532 00000 n 
-0000304162 00000 n 
-0000309672 00000 n 
-0000309886 00000 n 
-0000310081 00000 n 
-0000310295 00000 n 
-0000310490 00000 n 
-0000310879 00000 n 
-0000311093 00000 n 
-0000311288 00000 n 
-0000311677 00000 n 
-0000311891 00000 n 
-0000312086 00000 n 
-0000312476 00000 n 
-0000312690 00000 n 
-0000312883 00000 n 
-0000313097 00000 n 
-0000313292 00000 n 
-0000317298 00000 n 
-0000317511 00000 n 
-0000317706 00000 n 
-0000317920 00000 n 
-0000318115 00000 n 
-0000313680 00000 n 
-0000314606 00000 n 
-0000308054 00000 n 
-0000305783 00000 n 
-0000313843 00000 n 
-0000313901 00000 n 
-0000313960 00000 n 
-0000309282 00000 n 
-0000314019 00000 n 
-0000314194 00000 n 
-0000314253 00000 n 
-0000314312 00000 n 
-0000310685 00000 n 
-0000314371 00000 n 
-0000311483 00000 n 
-0000314430 00000 n 
-0000312281 00000 n 
-0000314488 00000 n 
-0000314547 00000 n 
-0000313487 00000 n 
-0000318504 00000 n 
-0000318716 00000 n 
-0000318907 00000 n 
-0000319295 00000 n 
-0000319508 00000 n 
-0000319703 00000 n 
-0000319917 00000 n 
-0000320112 00000 n 
-0000320325 00000 n 
-0000320520 00000 n 
-0000320909 00000 n 
-0000321122 00000 n 
-0000321316 00000 n 
-0000321530 00000 n 
-0000321725 00000 n 
-0000321937 00000 n 
-0000322130 00000 n 
-0000322344 00000 n 
-0000322539 00000 n 
-0000322753 00000 n 
-0000327406 00000 n 
-0000327612 00000 n 
-0000327807 00000 n 
-0000328002 00000 n 
-0000328392 00000 n 
-0000322948 00000 n 
-0000323992 00000 n 
-0000316902 00000 n 
-0000314798 00000 n 
-0000323113 00000 n 
-0000323171 00000 n 
-0000323230 00000 n 
-0000318309 00000 n 
-0000323289 00000 n 
-0000319100 00000 n 
-0000323348 00000 n 
-0000323406 00000 n 
-0000323465 00000 n 
-0000320714 00000 n 
-0000323524 00000 n 
-0000323582 00000 n 
-0000323640 00000 n 
-0000323699 00000 n 
-0000323758 00000 n 
-0000323817 00000 n 
-0000328587 00000 n 
-0000328793 00000 n 
-0000328988 00000 n 
-0000329194 00000 n 
-0000329389 00000 n 
-0000329595 00000 n 
-0000329790 00000 n 
-0000329985 00000 n 
-0000330190 00000 n 
-0000330385 00000 n 
-0000330580 00000 n 
-0000330786 00000 n 
-0000330981 00000 n 
-0000331187 00000 n 
-0000331381 00000 n 
-0000331576 00000 n 
-0000331782 00000 n 
-0000331977 00000 n 
-0000332183 00000 n 
-0000332378 00000 n 
-0000332572 00000 n 
-0000332962 00000 n 
-0000333167 00000 n 
-0000333362 00000 n 
-0000333557 00000 n 
-0000333761 00000 n 
-0000333954 00000 n 
-0000334160 00000 n 
-0000334354 00000 n 
-0000334560 00000 n 
-0000334755 00000 n 
-0000334960 00000 n 
-0000335154 00000 n 
-0000335358 00000 n 
-0000335552 00000 n 
-0000335756 00000 n 
-0000335949 00000 n 
-0000337172 00000 n 
-0000326875 00000 n 
-0000324184 00000 n 
-0000336112 00000 n 
-0000336170 00000 n 
-0000336229 00000 n 
-0000328197 00000 n 
-0000336288 00000 n 
-0000959969 00000 n 
-0000958812 00000 n 
-0000336347 00000 n 
-0000336406 00000 n 
-0000336465 00000 n 
-0000336524 00000 n 
-0000336583 00000 n 
-0000336642 00000 n 
-0000336701 00000 n 
-0000332767 00000 n 
-0000336759 00000 n 
-0000336818 00000 n 
-0000336877 00000 n 
-0000336936 00000 n 
-0000336995 00000 n 
-0000337054 00000 n 
-0000337113 00000 n 
-0000339768 00000 n 
-0000340005 00000 n 
-0000340394 00000 n 
-0000340631 00000 n 
-0000340826 00000 n 
-0000341216 00000 n 
-0000341453 00000 n 
-0000341648 00000 n 
-0000342038 00000 n 
-0000342275 00000 n 
-0000342664 00000 n 
-0000342900 00000 n 
-0000343289 00000 n 
-0000343484 00000 n 
-0000343721 00000 n 
-0000344109 00000 n 
-0000344345 00000 n 
-0000344735 00000 n 
-0000344930 00000 n 
-0000345799 00000 n 
-0000339399 00000 n 
-0000337380 00000 n 
-0000345095 00000 n 
-0000345153 00000 n 
-0000345328 00000 n 
-0000345386 00000 n 
-0000340200 00000 n 
-0000345445 00000 n 
-0000341021 00000 n 
-0000345504 00000 n 
-0000341843 00000 n 
-0000345563 00000 n 
-0000342470 00000 n 
-0000345622 00000 n 
-0000343094 00000 n 
-0000345681 00000 n 
-0000343916 00000 n 
-0000345740 00000 n 
-0000344540 00000 n 
-0000962789 00000 n 
-0000348623 00000 n 
-0000348843 00000 n 
-0000349038 00000 n 
-0000349257 00000 n 
-0000349452 00000 n 
-0000349647 00000 n 
-0000349867 00000 n 
-0000350257 00000 n 
-0000350448 00000 n 
-0000350668 00000 n 
-0000351058 00000 n 
-0000351253 00000 n 
-0000351472 00000 n 
-0000351666 00000 n 
-0000351886 00000 n 
-0000352081 00000 n 
-0000352471 00000 n 
-0000352691 00000 n 
-0000352886 00000 n 
-0000353105 00000 n 
-0000353299 00000 n 
-0000353688 00000 n 
-0000353908 00000 n 
-0000354103 00000 n 
-0000354492 00000 n 
-0000354710 00000 n 
-0000358980 00000 n 
-0000359199 00000 n 
-0000354903 00000 n 
-0000355947 00000 n 
-0000348200 00000 n 
-0000345991 00000 n 
-0000355066 00000 n 
-0000355124 00000 n 
-0000355299 00000 n 
-0000355358 00000 n 
-0000355417 00000 n 
-0000355476 00000 n 
-0000350062 00000 n 
-0000355535 00000 n 
-0000350863 00000 n 
-0000355594 00000 n 
-0000355653 00000 n 
-0000352276 00000 n 
-0000355712 00000 n 
-0000355771 00000 n 
-0000353493 00000 n 
-0000355830 00000 n 
-0000354298 00000 n 
-0000355889 00000 n 
-0000359391 00000 n 
-0000359611 00000 n 
-0000359806 00000 n 
-0000360196 00000 n 
-0000360416 00000 n 
-0000360611 00000 n 
-0000360831 00000 n 
-0000361026 00000 n 
-0000361246 00000 n 
-0000361441 00000 n 
-0000361661 00000 n 
-0000361856 00000 n 
-0000362076 00000 n 
-0000362269 00000 n 
-0000362481 00000 n 
-0000362676 00000 n 
-0000362871 00000 n 
-0000363066 00000 n 
-0000367226 00000 n 
-0000367438 00000 n 
-0000367633 00000 n 
-0000367844 00000 n 
-0000368039 00000 n 
-0000363261 00000 n 
-0000364187 00000 n 
-0000358647 00000 n 
-0000356139 00000 n 
-0000363426 00000 n 
-0000363484 00000 n 
-0000363543 00000 n 
-0000360001 00000 n 
-0000363601 00000 n 
-0000363660 00000 n 
-0000363719 00000 n 
-0000363777 00000 n 
-0000363836 00000 n 
-0000363895 00000 n 
-0000364070 00000 n 
-0000364128 00000 n 
-0000368428 00000 n 
-0000368639 00000 n 
-0000368833 00000 n 
-0000369221 00000 n 
-0000369433 00000 n 
-0000369628 00000 n 
-0000369840 00000 n 
-0000370035 00000 n 
-0000370229 00000 n 
-0000370441 00000 n 
-0000370636 00000 n 
-0000370847 00000 n 
-0000371041 00000 n 
-0000371235 00000 n 
-0000371623 00000 n 
-0000371835 00000 n 
-0000372029 00000 n 
-0000372224 00000 n 
-0000372436 00000 n 
-0000372631 00000 n 
-0000372843 00000 n 
-0000373038 00000 n 
-0000373250 00000 n 
-0000373445 00000 n 
-0000373657 00000 n 
-0000373852 00000 n 
-0000374064 00000 n 
-0000374259 00000 n 
-0000374471 00000 n 
-0000374666 00000 n 
-0000375828 00000 n 
-0000366749 00000 n 
-0000364379 00000 n 
-0000374829 00000 n 
-0000374887 00000 n 
-0000374946 00000 n 
-0000368234 00000 n 
-0000375005 00000 n 
-0000369027 00000 n 
-0000375064 00000 n 
-0000375123 00000 n 
-0000375182 00000 n 
-0000375241 00000 n 
-0000371428 00000 n 
-0000375300 00000 n 
-0000375359 00000 n 
-0000375418 00000 n 
-0000375477 00000 n 
-0000375536 00000 n 
-0000375595 00000 n 
-0000375654 00000 n 
-0000375713 00000 n 
-0000378858 00000 n 
-0000379073 00000 n 
-0000379268 00000 n 
-0000379483 00000 n 
-0000379678 00000 n 
-0000380066 00000 n 
-0000380278 00000 n 
-0000380471 00000 n 
-0000380860 00000 n 
-0000381075 00000 n 
-0000381270 00000 n 
-0000381660 00000 n 
-0000381875 00000 n 
-0000382070 00000 n 
-0000382460 00000 n 
-0000382674 00000 n 
-0000382869 00000 n 
-0000383259 00000 n 
-0000383473 00000 n 
-0000383667 00000 n 
-0000384056 00000 n 
-0000384271 00000 n 
-0000384466 00000 n 
-0000384856 00000 n 
-0000385071 00000 n 
-0000385266 00000 n 
-0000385480 00000 n 
-0000385674 00000 n 
-0000386063 00000 n 
-0000386277 00000 n 
-0000386471 00000 n 
-0000386664 00000 n 
-0000390806 00000 n 
-0000391021 00000 n 
-0000391216 00000 n 
-0000391606 00000 n 
-0000391821 00000 n 
-0000386858 00000 n 
-0000387846 00000 n 
-0000378354 00000 n 
-0000376036 00000 n 
-0000387023 00000 n 
-0000387139 00000 n 
-0000387198 00000 n 
-0000387257 00000 n 
-0000379873 00000 n 
-0000387315 00000 n 
-0000380665 00000 n 
-0000387374 00000 n 
-0000381465 00000 n 
-0000387433 00000 n 
-0000382265 00000 n 
-0000387492 00000 n 
-0000383064 00000 n 
-0000387551 00000 n 
-0000383861 00000 n 
-0000387610 00000 n 
-0000384661 00000 n 
-0000387669 00000 n 
-0000387728 00000 n 
-0000385868 00000 n 
-0000387787 00000 n 
-0000392016 00000 n 
-0000392231 00000 n 
-0000392426 00000 n 
-0000392641 00000 n 
-0000392836 00000 n 
-0000393050 00000 n 
-0000393245 00000 n 
-0000393439 00000 n 
-0000393634 00000 n 
-0000393849 00000 n 
-0000394044 00000 n 
-0000394434 00000 n 
-0000394649 00000 n 
-0000394843 00000 n 
-0000395232 00000 n 
-0000395447 00000 n 
-0000395642 00000 n 
-0000396031 00000 n 
-0000396246 00000 n 
-0000396441 00000 n 
-0000396831 00000 n 
-0000397046 00000 n 
-0000397241 00000 n 
-0000397454 00000 n 
-0000397647 00000 n 
-0000397860 00000 n 
-0000398054 00000 n 
-0000398269 00000 n 
-0000398464 00000 n 
-0000398678 00000 n 
-0000398872 00000 n 
-0000400028 00000 n 
-0000390302 00000 n 
-0000388038 00000 n 
-0000399035 00000 n 
-0000399093 00000 n 
-0000391411 00000 n 
-0000399152 00000 n 
-0000399211 00000 n 
-0000399270 00000 n 
-0000399329 00000 n 
-0000399387 00000 n 
-0000394239 00000 n 
-0000399445 00000 n 
-0000395038 00000 n 
-0000399503 00000 n 
-0000395837 00000 n 
-0000399560 00000 n 
-0000396636 00000 n 
-0000399618 00000 n 
-0000399677 00000 n 
-0000399735 00000 n 
-0000399794 00000 n 
-0000399853 00000 n 
-0000399912 00000 n 
-0000402744 00000 n 
-0000402952 00000 n 
-0000403161 00000 n 
-0000403370 00000 n 
-0000403579 00000 n 
-0000403787 00000 n 
-0000403995 00000 n 
-0000404204 00000 n 
-0000404622 00000 n 
-0000404831 00000 n 
-0000405040 00000 n 
-0000405235 00000 n 
-0000405624 00000 n 
-0000405832 00000 n 
-0000406025 00000 n 
-0000406219 00000 n 
-0000406608 00000 n 
-0000406803 00000 n 
-0000407012 00000 n 
-0000407206 00000 n 
-0000407596 00000 n 
-0000407805 00000 n 
-0000408000 00000 n 
-0000408390 00000 n 
-0000408599 00000 n 
-0000413203 00000 n 
-0000413412 00000 n 
-0000413607 00000 n 
-0000413802 00000 n 
-0000414010 00000 n 
-0000414203 00000 n 
-0000414592 00000 n 
-0000414801 00000 n 
-0000414996 00000 n 
-0000408794 00000 n 
-0000409960 00000 n 
-0000402330 00000 n 
-0000400235 00000 n 
-0000408959 00000 n 
-0000409075 00000 n 
-0000409134 00000 n 
-0000409193 00000 n 
-0000409252 00000 n 
-0000409311 00000 n 
-0000409370 00000 n 
-0000409429 00000 n 
-0000409488 00000 n 
-0000409547 00000 n 
-0000404413 00000 n 
-0000409606 00000 n 
-0000409665 00000 n 
-0000405430 00000 n 
-0000409724 00000 n 
-0000406413 00000 n 
-0000409783 00000 n 
-0000407401 00000 n 
-0000409842 00000 n 
-0000408195 00000 n 
-0000409901 00000 n 
-0000962914 00000 n 
-0000415386 00000 n 
-0000415595 00000 n 
-0000415790 00000 n 
-0000416180 00000 n 
-0000416386 00000 n 
-0000416579 00000 n 
-0000416772 00000 n 
-0000416967 00000 n 
-0000417176 00000 n 
-0000417371 00000 n 
-0000417760 00000 n 
-0000417969 00000 n 
-0000418164 00000 n 
-0000418373 00000 n 
-0000418568 00000 n 
-0000418776 00000 n 
-0000418970 00000 n 
-0000419179 00000 n 
-0000419374 00000 n 
-0000419764 00000 n 
-0000419973 00000 n 
-0000420167 00000 n 
-0000420556 00000 n 
-0000420764 00000 n 
-0000420958 00000 n 
-0000421153 00000 n 
-0000421362 00000 n 
-0000421556 00000 n 
-0000421946 00000 n 
-0000422155 00000 n 
-0000422350 00000 n 
-0000422740 00000 n 
-0000422949 00000 n 
-0000423144 00000 n 
-0000423352 00000 n 
-0000427876 00000 n 
-0000428085 00000 n 
-0000428280 00000 n 
-0000428488 00000 n 
-0000428682 00000 n 
-0000429071 00000 n 
-0000429265 00000 n 
-0000429460 00000 n 
-0000429667 00000 n 
-0000429860 00000 n 
-0000423546 00000 n 
-0000424710 00000 n 
-0000412591 00000 n 
-0000410152 00000 n 
-0000423709 00000 n 
-0000423767 00000 n 
-0000423826 00000 n 
-0000414397 00000 n 
-0000423885 00000 n 
-0000415191 00000 n 
-0000423944 00000 n 
-0000415985 00000 n 
-0000424003 00000 n 
-0000424062 00000 n 
-0000417566 00000 n 
-0000424121 00000 n 
-0000424180 00000 n 
-0000424239 00000 n 
-0000424298 00000 n 
-0000419569 00000 n 
-0000424357 00000 n 
-0000420362 00000 n 
-0000424416 00000 n 
-0000424475 00000 n 
-0000421751 00000 n 
-0000424533 00000 n 
-0000422545 00000 n 
-0000424592 00000 n 
-0000424651 00000 n 
-0000430051 00000 n 
-0000430259 00000 n 
-0000430453 00000 n 
-0000430841 00000 n 
-0000431050 00000 n 
-0000431245 00000 n 
-0000431439 00000 n 
-0000431634 00000 n 
-0000431843 00000 n 
-0000432038 00000 n 
-0000432245 00000 n 
-0000432438 00000 n 
-0000432647 00000 n 
-0000432841 00000 n 
-0000433050 00000 n 
-0000433245 00000 n 
-0000433454 00000 n 
-0000433649 00000 n 
-0000433856 00000 n 
-0000434050 00000 n 
-0000434258 00000 n 
-0000434451 00000 n 
-0000434660 00000 n 
-0000434854 00000 n 
-0000435063 00000 n 
-0000435258 00000 n 
-0000436422 00000 n 
-0000427399 00000 n 
-0000424876 00000 n 
-0000435423 00000 n 
-0000428876 00000 n 
-0000435481 00000 n 
-0000435540 00000 n 
-0000430646 00000 n 
-0000435599 00000 n 
-0000435658 00000 n 
-0000435717 00000 n 
-0000435776 00000 n 
-0000435834 00000 n 
-0000435893 00000 n 
-0000435952 00000 n 
-0000436011 00000 n 
-0000436069 00000 n 
-0000436128 00000 n 
-0000436187 00000 n 
-0000436246 00000 n 
-0000436305 00000 n 
-0000436364 00000 n 
-0000442714 00000 n 
-0000439532 00000 n 
-0000439747 00000 n 
-0000439941 00000 n 
-0000440329 00000 n 
-0000440545 00000 n 
-0000440740 00000 n 
-0000440956 00000 n 
-0000441151 00000 n 
-0000441367 00000 n 
-0000441561 00000 n 
-0000441776 00000 n 
-0000441968 00000 n 
-0000442182 00000 n 
-0000442375 00000 n 
-0000443420 00000 n 
-0000439262 00000 n 
-0000436628 00000 n 
-0000442538 00000 n 
-0000442596 00000 n 
-0000442655 00000 n 
-0000442773 00000 n 
-0000442832 00000 n 
-0000443007 00000 n 
-0000443066 00000 n 
-0000440135 00000 n 
-0000443125 00000 n 
-0000443184 00000 n 
-0000443243 00000 n 
-0000443302 00000 n 
-0000443361 00000 n 
-0000445768 00000 n 
-0000445977 00000 n 
-0000446186 00000 n 
-0000446395 00000 n 
-0000446602 00000 n 
-0000446810 00000 n 
-0000447019 00000 n 
-0000447228 00000 n 
-0000447436 00000 n 
-0000447853 00000 n 
-0000448062 00000 n 
-0000448257 00000 n 
-0000448647 00000 n 
-0000448855 00000 n 
-0000449049 00000 n 
-0000449438 00000 n 
-0000449645 00000 n 
-0000449837 00000 n 
-0000454924 00000 n 
-0000455132 00000 n 
-0000455327 00000 n 
-0000455522 00000 n 
-0000455717 00000 n 
-0000455912 00000 n 
-0000450223 00000 n 
-0000451387 00000 n 
-0000445426 00000 n 
-0000443625 00000 n 
-0000450388 00000 n 
-0000450446 00000 n 
-0000450621 00000 n 
-0000450680 00000 n 
-0000450739 00000 n 
-0000450798 00000 n 
-0000450857 00000 n 
-0000450916 00000 n 
-0000450975 00000 n 
-0000451034 00000 n 
-0000451093 00000 n 
-0000451152 00000 n 
-0000447644 00000 n 
-0000451211 00000 n 
-0000448452 00000 n 
-0000451270 00000 n 
-0000449243 00000 n 
-0000451329 00000 n 
-0000450030 00000 n 
-0000456107 00000 n 
-0000456316 00000 n 
-0000456511 00000 n 
-0000456720 00000 n 
-0000456915 00000 n 
-0000457110 00000 n 
-0000457319 00000 n 
-0000457514 00000 n 
-0000457709 00000 n 
-0000457918 00000 n 
-0000458113 00000 n 
-0000458503 00000 n 
-0000458711 00000 n 
-0000458906 00000 n 
-0000459296 00000 n 
-0000459503 00000 n 
-0000459698 00000 n 
-0000459893 00000 n 
-0000460102 00000 n 
-0000460297 00000 n 
-0000460491 00000 n 
-0000460686 00000 n 
-0000460895 00000 n 
-0000461090 00000 n 
-0000461299 00000 n 
-0000461493 00000 n 
-0000461702 00000 n 
-0000461897 00000 n 
-0000462105 00000 n 
-0000462300 00000 n 
-0000462509 00000 n 
-0000462704 00000 n 
-0000463093 00000 n 
-0000463287 00000 n 
-0000463496 00000 n 
-0000463691 00000 n 
-0000464081 00000 n 
-0000464288 00000 n 
-0000464481 00000 n 
-0000468913 00000 n 
-0000469121 00000 n 
-0000469315 00000 n 
-0000469507 00000 n 
-0000469716 00000 n 
-0000469911 00000 n 
-0000464867 00000 n 
-0000465855 00000 n 
-0000454330 00000 n 
-0000451579 00000 n 
-0000465030 00000 n 
-0000465088 00000 n 
-0000465147 00000 n 
-0000465206 00000 n 
-0000465265 00000 n 
-0000458308 00000 n 
-0000465324 00000 n 
-0000459101 00000 n 
-0000465383 00000 n 
-0000465442 00000 n 
-0000465501 00000 n 
-0000465560 00000 n 
-0000465619 00000 n 
-0000465678 00000 n 
-0000462899 00000 n 
-0000465737 00000 n 
-0000463886 00000 n 
-0000465796 00000 n 
-0000464674 00000 n 
-0000476174 00000 n 
-0000476292 00000 n 
-0000470106 00000 n 
-0000470315 00000 n 
-0000470510 00000 n 
-0000470719 00000 n 
-0000470912 00000 n 
-0000471121 00000 n 
-0000471316 00000 n 
-0000471511 00000 n 
-0000471719 00000 n 
-0000471914 00000 n 
-0000472304 00000 n 
-0000472513 00000 n 
-0000472707 00000 n 
-0000472916 00000 n 
-0000473111 00000 n 
-0000473320 00000 n 
-0000473513 00000 n 
-0000473722 00000 n 
-0000473917 00000 n 
-0000474125 00000 n 
-0000474319 00000 n 
-0000474527 00000 n 
-0000474722 00000 n 
-0000474931 00000 n 
-0000475126 00000 n 
-0000476355 00000 n 
-0000468490 00000 n 
-0000466063 00000 n 
-0000475291 00000 n 
-0000475349 00000 n 
-0000475408 00000 n 
-0000475467 00000 n 
-0000475526 00000 n 
-0000475585 00000 n 
-0000472109 00000 n 
-0000475644 00000 n 
-0000475702 00000 n 
-0000475761 00000 n 
-0000475820 00000 n 
-0000475879 00000 n 
-0000475938 00000 n 
-0000475997 00000 n 
-0000476056 00000 n 
-0000476115 00000 n 
-0000476233 00000 n 
-0000963039 00000 n 
-0000482090 00000 n 
-0000479534 00000 n 
-0000479749 00000 n 
-0000479943 00000 n 
-0000480331 00000 n 
-0000480526 00000 n 
-0000480741 00000 n 
-0000480933 00000 n 
-0000481149 00000 n 
-0000481344 00000 n 
-0000481558 00000 n 
-0000485514 00000 n 
-0000485730 00000 n 
-0000485925 00000 n 
-0000486141 00000 n 
-0000481751 00000 n 
-0000482562 00000 n 
-0000479291 00000 n 
-0000476547 00000 n 
-0000481914 00000 n 
-0000481972 00000 n 
-0000482031 00000 n 
-0000482153 00000 n 
-0000482327 00000 n 
-0000480137 00000 n 
-0000482386 00000 n 
-0000482445 00000 n 
-0000482504 00000 n 
-0000488378 00000 n 
-0000486336 00000 n 
-0000486547 00000 n 
-0000486742 00000 n 
-0000487131 00000 n 
-0000487341 00000 n 
-0000487534 00000 n 
-0000491880 00000 n 
-0000492091 00000 n 
-0000492285 00000 n 
-0000487919 00000 n 
-0000488848 00000 n 
-0000485262 00000 n 
-0000482767 00000 n 
-0000488084 00000 n 
-0000488142 00000 n 
-0000488201 00000 n 
-0000488260 00000 n 
-0000488319 00000 n 
-0000488437 00000 n 
-0000488496 00000 n 
-0000488671 00000 n 
-0000488730 00000 n 
-0000486937 00000 n 
-0000488789 00000 n 
-0000487727 00000 n 
-0000492673 00000 n 
-0000492885 00000 n 
-0000493078 00000 n 
-0000493289 00000 n 
-0000493483 00000 n 
-0000493870 00000 n 
-0000494082 00000 n 
-0000494277 00000 n 
-0000494666 00000 n 
-0000494877 00000 n 
-0000495071 00000 n 
-0000495459 00000 n 
-0000495671 00000 n 
-0000495862 00000 n 
-0000496074 00000 n 
-0000496269 00000 n 
-0000496481 00000 n 
-0000496676 00000 n 
-0000496886 00000 n 
-0000497080 00000 n 
-0000497292 00000 n 
-0000497487 00000 n 
-0000501830 00000 n 
-0000502077 00000 n 
-0000497683 00000 n 
-0000498726 00000 n 
-0000491475 00000 n 
-0000489053 00000 n 
-0000497846 00000 n 
-0000497904 00000 n 
-0000492479 00000 n 
-0000497963 00000 n 
-0000498022 00000 n 
-0000493677 00000 n 
-0000498081 00000 n 
-0000494472 00000 n 
-0000498140 00000 n 
-0000495265 00000 n 
-0000498199 00000 n 
-0000498258 00000 n 
-0000498317 00000 n 
-0000498376 00000 n 
-0000498435 00000 n 
-0000498494 00000 n 
-0000498668 00000 n 
-0000502467 00000 n 
-0000502714 00000 n 
-0000503103 00000 n 
-0000503492 00000 n 
-0000503739 00000 n 
-0000504129 00000 n 
-0000504324 00000 n 
-0000504571 00000 n 
-0000504960 00000 n 
-0000505155 00000 n 
-0000505401 00000 n 
-0000505790 00000 n 
-0000506036 00000 n 
-0000506425 00000 n 
-0000506620 00000 n 
-0000506867 00000 n 
-0000507257 00000 n 
-0000507504 00000 n 
-0000507893 00000 n 
-0000508140 00000 n 
-0000508530 00000 n 
-0000508920 00000 n 
-0000509116 00000 n 
-0000510102 00000 n 
-0000501371 00000 n 
-0000498905 00000 n 
-0000509281 00000 n 
-0000509339 00000 n 
-0000502272 00000 n 
-0000509398 00000 n 
-0000502909 00000 n 
-0000503297 00000 n 
-0000509457 00000 n 
-0000503934 00000 n 
-0000509516 00000 n 
-0000504765 00000 n 
-0000509574 00000 n 
-0000505595 00000 n 
-0000506230 00000 n 
-0000509633 00000 n 
-0000507062 00000 n 
-0000509692 00000 n 
-0000507699 00000 n 
-0000509751 00000 n 
-0000508335 00000 n 
-0000508725 00000 n 
-0000509810 00000 n 
-0000509868 00000 n 
-0000509927 00000 n 
-0000509986 00000 n 
-0000512992 00000 n 
-0000513188 00000 n 
-0000513428 00000 n 
-0000513818 00000 n 
-0000514058 00000 n 
-0000514448 00000 n 
-0000514643 00000 n 
-0000514882 00000 n 
-0000515271 00000 n 
-0000515466 00000 n 
-0000515706 00000 n 
-0000515900 00000 n 
-0000516095 00000 n 
-0000516334 00000 n 
-0000516723 00000 n 
-0000516963 00000 n 
-0000517351 00000 n 
-0000517546 00000 n 
-0000517786 00000 n 
-0000518176 00000 n 
-0000518416 00000 n 
-0000518806 00000 n 
-0000519046 00000 n 
-0000519434 00000 n 
-0000519629 00000 n 
-0000519824 00000 n 
-0000520868 00000 n 
-0000512551 00000 n 
-0000510294 00000 n 
-0000519987 00000 n 
-0000520103 00000 n 
-0000520162 00000 n 
-0000513623 00000 n 
-0000520221 00000 n 
-0000514253 00000 n 
-0000520280 00000 n 
-0000515076 00000 n 
-0000520339 00000 n 
-0000520396 00000 n 
-0000516528 00000 n 
-0000517157 00000 n 
-0000520455 00000 n 
-0000517981 00000 n 
-0000520514 00000 n 
-0000518611 00000 n 
-0000520573 00000 n 
-0000519240 00000 n 
-0000520632 00000 n 
-0000520691 00000 n 
-0000520750 00000 n 
-0000520809 00000 n 
-0000523990 00000 n 
-0000524220 00000 n 
-0000524610 00000 n 
-0000524839 00000 n 
-0000525033 00000 n 
-0000525263 00000 n 
-0000525457 00000 n 
-0000525847 00000 n 
-0000526077 00000 n 
-0000526271 00000 n 
-0000526661 00000 n 
-0000526890 00000 n 
-0000527280 00000 n 
-0000527475 00000 n 
-0000527705 00000 n 
-0000528095 00000 n 
-0000528290 00000 n 
-0000528680 00000 n 
-0000528910 00000 n 
-0000529300 00000 n 
-0000529493 00000 n 
-0000529883 00000 n 
-0000530112 00000 n 
-0000530500 00000 n 
-0000531310 00000 n 
-0000523558 00000 n 
-0000521060 00000 n 
-0000530665 00000 n 
-0000530839 00000 n 
-0000530898 00000 n 
-0000524415 00000 n 
-0000530957 00000 n 
-0000525652 00000 n 
-0000531016 00000 n 
-0000526466 00000 n 
-0000531075 00000 n 
-0000527085 00000 n 
-0000531134 00000 n 
-0000527900 00000 n 
-0000528485 00000 n 
-0000531192 00000 n 
-0000529105 00000 n 
-0000529688 00000 n 
-0000531251 00000 n 
-0000530306 00000 n 
-0000963164 00000 n 
-0000537676 00000 n 
-0000534180 00000 n 
-0000534387 00000 n 
-0000534582 00000 n 
-0000534972 00000 n 
-0000535179 00000 n 
-0000535374 00000 n 
-0000535764 00000 n 
-0000535971 00000 n 
-0000536166 00000 n 
-0000536554 00000 n 
-0000536759 00000 n 
-0000536951 00000 n 
-0000541052 00000 n 
-0000541258 00000 n 
-0000541451 00000 n 
-0000537337 00000 n 
-0000538087 00000 n 
-0000533892 00000 n 
-0000531489 00000 n 
-0000537500 00000 n 
-0000537558 00000 n 
-0000537617 00000 n 
-0000537735 00000 n 
-0000537910 00000 n 
-0000537969 00000 n 
-0000534777 00000 n 
-0000538028 00000 n 
-0000535569 00000 n 
-0000536359 00000 n 
-0000537144 00000 n 
-0000653024 00000 n 
-0000653142 00000 n 
-0000541840 00000 n 
-0000542046 00000 n 
-0000542239 00000 n 
-0000542628 00000 n 
-0000542834 00000 n 
-0000543028 00000 n 
-0000543417 00000 n 
-0000543623 00000 n 
-0000543817 00000 n 
-0000544206 00000 n 
-0000544413 00000 n 
-0000544608 00000 n 
-0000544997 00000 n 
-0000545204 00000 n 
-0000545399 00000 n 
-0000545789 00000 n 
-0000545995 00000 n 
-0000546189 00000 n 
-0000546384 00000 n 
-0000546590 00000 n 
-0000546784 00000 n 
-0000547173 00000 n 
-0000547379 00000 n 
-0000547573 00000 n 
-0000547962 00000 n 
-0000548167 00000 n 
-0000548361 00000 n 
-0000548750 00000 n 
-0000548956 00000 n 
-0000549150 00000 n 
-0000549537 00000 n 
-0000549744 00000 n 
-0000549939 00000 n 
-0000550329 00000 n 
-0000550788 00000 n 
-0000540485 00000 n 
-0000538279 00000 n 
-0000550494 00000 n 
-0000541645 00000 n 
-0000542433 00000 n 
-0000543222 00000 n 
-0000550552 00000 n 
-0000544011 00000 n 
-0000550611 00000 n 
-0000544803 00000 n 
-0000550670 00000 n 
-0000545594 00000 n 
-0000546978 00000 n 
-0000547767 00000 n 
-0000548555 00000 n 
-0000549343 00000 n 
-0000550729 00000 n 
-0000550134 00000 n 
-0000653260 00000 n 
-0000656461 00000 n 
-0000656579 00000 n 
-0000656702 00000 n 
-0000656820 00000 n 
-0000656938 00000 n 
-0000659899 00000 n 
-0000660017 00000 n 
-0000554112 00000 n 
-0000554319 00000 n 
-0000554514 00000 n 
-0000554904 00000 n 
-0000555111 00000 n 
-0000555306 00000 n 
-0000555501 00000 n 
-0000555706 00000 n 
-0000555899 00000 n 
-0000556287 00000 n 
-0000556494 00000 n 
-0000556689 00000 n 
-0000556884 00000 n 
-0000557090 00000 n 
-0000557284 00000 n 
-0000557491 00000 n 
-0000557686 00000 n 
-0000557881 00000 n 
-0000558088 00000 n 
-0000558283 00000 n 
-0000558478 00000 n 
-0000558685 00000 n 
-0000558880 00000 n 
-0000559270 00000 n 
-0000559477 00000 n 
-0000559672 00000 n 
-0000560061 00000 n 
-0000560268 00000 n 
-0000560463 00000 n 
-0000560853 00000 n 
-0000561060 00000 n 
-0000561255 00000 n 
-0000561645 00000 n 
-0000561852 00000 n 
-0000562047 00000 n 
-0000562436 00000 n 
-0000562641 00000 n 
-0000562832 00000 n 
-0000567302 00000 n 
-0000567509 00000 n 
-0000567704 00000 n 
-0000567910 00000 n 
-0000563218 00000 n 
-0000563970 00000 n 
-0000553554 00000 n 
-0000550954 00000 n 
-0000563381 00000 n 
-0000563439 00000 n 
-0000554709 00000 n 
-0000563498 00000 n 
-0000556092 00000 n 
-0000563557 00000 n 
-0000563616 00000 n 
-0000563675 00000 n 
-0000559075 00000 n 
-0000559866 00000 n 
-0000563734 00000 n 
-0000560658 00000 n 
-0000563793 00000 n 
-0000561450 00000 n 
-0000563852 00000 n 
-0000562242 00000 n 
-0000563911 00000 n 
-0000563025 00000 n 
-0000660138 00000 n 
-0000660256 00000 n 
-0000660373 00000 n 
-0000664205 00000 n 
-0000568104 00000 n 
-0000568311 00000 n 
-0000568505 00000 n 
-0000568712 00000 n 
-0000568906 00000 n 
-0000569113 00000 n 
-0000569307 00000 n 
-0000569513 00000 n 
-0000569708 00000 n 
-0000569914 00000 n 
-0000570108 00000 n 
-0000570301 00000 n 
-0000570508 00000 n 
-0000570703 00000 n 
-0000571093 00000 n 
-0000571300 00000 n 
-0000571495 00000 n 
-0000571885 00000 n 
-0000572092 00000 n 
-0000572287 00000 n 
-0000572677 00000 n 
-0000572872 00000 n 
-0000573067 00000 n 
-0000573260 00000 n 
-0000573467 00000 n 
-0000573661 00000 n 
-0000573856 00000 n 
-0000574051 00000 n 
-0000574246 00000 n 
-0000574451 00000 n 
-0000574645 00000 n 
-0000575032 00000 n 
-0000575225 00000 n 
-0000575419 00000 n 
-0000575612 00000 n 
-0000575818 00000 n 
-0000576013 00000 n 
-0000576401 00000 n 
-0000576594 00000 n 
-0000576788 00000 n 
-0000576995 00000 n 
-0000577189 00000 n 
-0000577383 00000 n 
-0000577590 00000 n 
-0000577785 00000 n 
-0000578174 00000 n 
-0000578381 00000 n 
-0000578576 00000 n 
-0000578966 00000 n 
-0000579173 00000 n 
-0000579368 00000 n 
-0000579563 00000 n 
-0000579770 00000 n 
-0000579965 00000 n 
-0000580170 00000 n 
-0000584581 00000 n 
-0000584788 00000 n 
-0000584982 00000 n 
-0000585188 00000 n 
-0000585381 00000 n 
-0000580363 00000 n 
-0000581525 00000 n 
-0000566564 00000 n 
-0000564150 00000 n 
-0000580528 00000 n 
-0000580586 00000 n 
-0000580645 00000 n 
-0000580704 00000 n 
-0000580763 00000 n 
-0000580822 00000 n 
-0000580881 00000 n 
-0000580940 00000 n 
-0000580999 00000 n 
-0000570898 00000 n 
-0000581057 00000 n 
-0000571690 00000 n 
-0000572482 00000 n 
-0000581116 00000 n 
-0000574838 00000 n 
-0000581174 00000 n 
-0000576207 00000 n 
-0000581233 00000 n 
-0000581292 00000 n 
-0000577980 00000 n 
-0000581351 00000 n 
-0000578771 00000 n 
-0000581410 00000 n 
-0000581469 00000 n 
-0000664327 00000 n 
-0000664509 00000 n 
-0000664689 00000 n 
-0000585576 00000 n 
-0000585783 00000 n 
-0000585978 00000 n 
-0000586173 00000 n 
-0000586380 00000 n 
-0000586575 00000 n 
-0000586770 00000 n 
-0000586977 00000 n 
-0000587172 00000 n 
-0000587562 00000 n 
-0000587769 00000 n 
-0000587964 00000 n 
-0000588354 00000 n 
-0000588561 00000 n 
-0000588756 00000 n 
-0000589144 00000 n 
-0000589351 00000 n 
-0000589546 00000 n 
-0000589741 00000 n 
-0000589948 00000 n 
-0000590143 00000 n 
-0000590338 00000 n 
-0000590545 00000 n 
-0000590740 00000 n 
-0000591130 00000 n 
-0000591337 00000 n 
-0000591532 00000 n 
-0000591922 00000 n 
-0000592129 00000 n 
-0000592324 00000 n 
-0000592518 00000 n 
-0000592725 00000 n 
-0000592920 00000 n 
-0000593115 00000 n 
-0000593322 00000 n 
-0000593517 00000 n 
-0000593712 00000 n 
-0000593919 00000 n 
-0000594114 00000 n 
-0000594503 00000 n 
-0000594710 00000 n 
-0000594905 00000 n 
-0000595099 00000 n 
-0000595306 00000 n 
-0000595501 00000 n 
-0000595708 00000 n 
-0000595903 00000 n 
-0000596096 00000 n 
-0000596302 00000 n 
-0000596497 00000 n 
-0000601668 00000 n 
-0000601875 00000 n 
-0000602069 00000 n 
-0000602264 00000 n 
-0000602654 00000 n 
-0000602849 00000 n 
-0000603056 00000 n 
-0000603251 00000 n 
-0000603446 00000 n 
-0000603836 00000 n 
-0000604031 00000 n 
-0000604237 00000 n 
-0000604431 00000 n 
-0000604625 00000 n 
-0000605014 00000 n 
-0000605209 00000 n 
-0000596691 00000 n 
-0000597856 00000 n 
-0000583888 00000 n 
-0000581691 00000 n 
-0000596854 00000 n 
-0000596912 00000 n 
-0000596971 00000 n 
-0000597030 00000 n 
-0000597089 00000 n 
-0000597148 00000 n 
-0000587367 00000 n 
-0000588159 00000 n 
-0000588951 00000 n 
-0000597207 00000 n 
-0000597266 00000 n 
-0000597325 00000 n 
-0000590935 00000 n 
-0000597384 00000 n 
-0000591727 00000 n 
-0000597443 00000 n 
-0000597502 00000 n 
-0000597561 00000 n 
-0000594309 00000 n 
-0000597620 00000 n 
-0000597679 00000 n 
-0000597738 00000 n 
-0000597797 00000 n 
-0000667800 00000 n 
-0000667922 00000 n 
-0000668039 00000 n 
-0000605404 00000 n 
-0000605609 00000 n 
-0000605803 00000 n 
-0000605996 00000 n 
-0000606191 00000 n 
-0000606386 00000 n 
-0000606581 00000 n 
-0000606788 00000 n 
-0000606983 00000 n 
-0000607178 00000 n 
-0000607372 00000 n 
-0000607567 00000 n 
-0000607955 00000 n 
-0000608162 00000 n 
-0000608357 00000 n 
-0000608552 00000 n 
-0000608746 00000 n 
-0000608941 00000 n 
-0000609331 00000 n 
-0000609538 00000 n 
-0000609733 00000 n 
-0000610122 00000 n 
-0000610316 00000 n 
-0000610510 00000 n 
-0000610717 00000 n 
-0000610910 00000 n 
-0000611299 00000 n 
-0000611494 00000 n 
-0000611689 00000 n 
-0000611895 00000 n 
-0000612089 00000 n 
-0000612283 00000 n 
-0000612489 00000 n 
-0000612684 00000 n 
-0000613073 00000 n 
-0000613280 00000 n 
-0000613475 00000 n 
-0000613865 00000 n 
-0000614072 00000 n 
-0000614267 00000 n 
-0000614461 00000 n 
-0000614668 00000 n 
-0000614862 00000 n 
-0000619225 00000 n 
-0000619432 00000 n 
-0000619625 00000 n 
-0000619820 00000 n 
-0000620027 00000 n 
-0000620222 00000 n 
-0000620416 00000 n 
-0000615252 00000 n 
-0000615770 00000 n 
-0000600903 00000 n 
-0000598022 00000 n 
-0000615417 00000 n 
-0000602459 00000 n 
-0000603641 00000 n 
-0000604819 00000 n 
-0000607762 00000 n 
-0000609136 00000 n 
-0000609928 00000 n 
-0000611104 00000 n 
-0000615475 00000 n 
-0000615534 00000 n 
-0000612879 00000 n 
-0000615593 00000 n 
-0000613670 00000 n 
-0000615652 00000 n 
-0000615711 00000 n 
-0000615057 00000 n 
-0000963289 00000 n 
-0000668157 00000 n 
-0000668339 00000 n 
-0000671825 00000 n 
-0000672000 00000 n 
-0000672176 00000 n 
-0000672353 00000 n 
-0000676301 00000 n 
-0000676478 00000 n 
-0000620805 00000 n 
-0000621012 00000 n 
-0000621207 00000 n 
-0000621402 00000 n 
-0000621596 00000 n 
-0000621803 00000 n 
-0000621998 00000 n 
-0000622205 00000 n 
-0000622400 00000 n 
-0000622603 00000 n 
-0000622793 00000 n 
-0000623000 00000 n 
-0000623194 00000 n 
-0000623401 00000 n 
-0000623596 00000 n 
-0000623803 00000 n 
-0000623998 00000 n 
-0000624387 00000 n 
-0000624594 00000 n 
-0000624789 00000 n 
-0000625179 00000 n 
-0000625386 00000 n 
-0000625580 00000 n 
-0000625968 00000 n 
-0000626174 00000 n 
-0000626369 00000 n 
-0000626759 00000 n 
-0000626965 00000 n 
-0000627159 00000 n 
-0000627353 00000 n 
-0000627559 00000 n 
-0000627753 00000 n 
-0000628142 00000 n 
-0000628348 00000 n 
-0000628542 00000 n 
-0000633427 00000 n 
-0000633634 00000 n 
-0000633829 00000 n 
-0000634024 00000 n 
-0000634231 00000 n 
-0000634426 00000 n 
-0000628736 00000 n 
-0000629547 00000 n 
-0000618649 00000 n 
-0000615992 00000 n 
-0000628899 00000 n 
-0000628957 00000 n 
-0000620611 00000 n 
-0000629016 00000 n 
-0000629075 00000 n 
-0000629134 00000 n 
-0000629193 00000 n 
-0000629252 00000 n 
-0000629311 00000 n 
-0000624192 00000 n 
-0000624984 00000 n 
-0000625775 00000 n 
-0000626564 00000 n 
-0000629370 00000 n 
-0000629429 00000 n 
-0000627947 00000 n 
-0000629488 00000 n 
-0000676654 00000 n 
-0000679366 00000 n 
-0000679487 00000 n 
-0000679608 00000 n 
-0000679725 00000 n 
-0000634621 00000 n 
-0000634828 00000 n 
-0000635022 00000 n 
-0000635217 00000 n 
-0000635424 00000 n 
-0000635619 00000 n 
-0000635814 00000 n 
-0000636020 00000 n 
-0000636215 00000 n 
-0000636410 00000 n 
-0000636800 00000 n 
-0000636995 00000 n 
-0000637384 00000 n 
-0000637578 00000 n 
-0000637784 00000 n 
-0000637977 00000 n 
-0000638365 00000 n 
-0000638572 00000 n 
-0000638767 00000 n 
-0000639157 00000 n 
-0000639363 00000 n 
-0000639558 00000 n 
-0000639753 00000 n 
-0000639959 00000 n 
-0000640153 00000 n 
-0000640347 00000 n 
-0000640554 00000 n 
-0000640749 00000 n 
-0000641139 00000 n 
-0000641334 00000 n 
-0000641541 00000 n 
-0000641735 00000 n 
-0000642124 00000 n 
-0000642318 00000 n 
-0000642525 00000 n 
-0000642719 00000 n 
-0000643108 00000 n 
-0000643302 00000 n 
-0000643509 00000 n 
-0000643704 00000 n 
-0000644094 00000 n 
-0000644289 00000 n 
-0000644495 00000 n 
-0000644689 00000 n 
-0000644884 00000 n 
-0000649552 00000 n 
-0000649759 00000 n 
-0000649954 00000 n 
-0000650344 00000 n 
-0000645079 00000 n 
-0000646009 00000 n 
-0000632752 00000 n 
-0000629727 00000 n 
-0000645244 00000 n 
-0000645302 00000 n 
-0000645361 00000 n 
-0000645420 00000 n 
-0000636605 00000 n 
-0000637190 00000 n 
-0000645479 00000 n 
-0000638171 00000 n 
-0000645538 00000 n 
-0000638962 00000 n 
-0000645597 00000 n 
-0000645656 00000 n 
-0000645714 00000 n 
-0000640944 00000 n 
-0000645773 00000 n 
-0000641930 00000 n 
-0000645832 00000 n 
-0000642914 00000 n 
-0000645891 00000 n 
-0000643899 00000 n 
-0000645950 00000 n 
-0000679848 00000 n 
-0000679966 00000 n 
-0000650539 00000 n 
-0000650746 00000 n 
-0000650941 00000 n 
-0000651329 00000 n 
-0000651522 00000 n 
-0000651729 00000 n 
-0000651924 00000 n 
-0000652313 00000 n 
-0000652508 00000 n 
-0000653323 00000 n 
-0000649273 00000 n 
-0000646218 00000 n 
-0000652671 00000 n 
-0000652729 00000 n 
-0000650149 00000 n 
-0000652788 00000 n 
-0000651136 00000 n 
-0000652847 00000 n 
-0000652118 00000 n 
-0000652906 00000 n 
-0000652965 00000 n 
-0000653083 00000 n 
-0000653201 00000 n 
-0000656179 00000 n 
-0000657061 00000 n 
-0000656035 00000 n 
-0000653558 00000 n 
-0000656344 00000 n 
-0000656402 00000 n 
-0000656520 00000 n 
-0000656643 00000 n 
-0000656761 00000 n 
-0000656879 00000 n 
-0000657002 00000 n 
-0000659678 00000 n 
-0000660431 00000 n 
-0000659534 00000 n 
-0000657227 00000 n 
-0000659841 00000 n 
-0000659958 00000 n 
-0000660080 00000 n 
-0000660197 00000 n 
-0000660314 00000 n 
-0000663923 00000 n 
-0000664751 00000 n 
-0000663779 00000 n 
-0000660597 00000 n 
-0000664088 00000 n 
-0000664146 00000 n 
-0000664269 00000 n 
-0000664391 00000 n 
-0000664450 00000 n 
-0000664571 00000 n 
-0000664630 00000 n 
-0000963414 00000 n 
-0000667520 00000 n 
-0000668457 00000 n 
-0000667376 00000 n 
-0000664930 00000 n 
-0000667683 00000 n 
-0000667741 00000 n 
-0000667863 00000 n 
-0000667981 00000 n 
-0000668098 00000 n 
-0000668221 00000 n 
-0000668280 00000 n 
-0000668398 00000 n 
-0000671543 00000 n 
-0000672469 00000 n 
-0000671399 00000 n 
-0000668623 00000 n 
-0000671708 00000 n 
-0000671766 00000 n 
-0000671884 00000 n 
-0000958957 00000 n 
-0000959535 00000 n 
-0000671941 00000 n 
-0000672058 00000 n 
-0000672117 00000 n 
-0000672235 00000 n 
-0000672294 00000 n 
-0000672411 00000 n 
-0000676021 00000 n 
-0000676772 00000 n 
-0000675877 00000 n 
-0000672700 00000 n 
-0000676184 00000 n 
-0000676242 00000 n 
-0000676360 00000 n 
-0000676419 00000 n 
-0000676537 00000 n 
-0000676595 00000 n 
-0000676713 00000 n 
-0000679143 00000 n 
-0000680024 00000 n 
-0000678999 00000 n 
-0000676990 00000 n 
-0000679308 00000 n 
-0000679429 00000 n 
-0000679550 00000 n 
-0000679667 00000 n 
-0000679789 00000 n 
-0000679907 00000 n 
-0000683018 00000 n 
-0000683357 00000 n 
-0000682874 00000 n 
-0000680203 00000 n 
-0000683181 00000 n 
-0000683239 00000 n 
-0000683298 00000 n 
-0000685702 00000 n 
-0000685852 00000 n 
-0000686002 00000 n 
-0000686152 00000 n 
-0000686302 00000 n 
-0000686453 00000 n 
-0000686604 00000 n 
-0000686755 00000 n 
-0000686906 00000 n 
-0000687055 00000 n 
-0000687205 00000 n 
-0000687356 00000 n 
-0000687507 00000 n 
-0000687657 00000 n 
-0000687807 00000 n 
-0000687957 00000 n 
-0000688108 00000 n 
-0000688259 00000 n 
-0000688409 00000 n 
-0000688559 00000 n 
-0000688709 00000 n 
-0000688859 00000 n 
-0000689010 00000 n 
-0000689160 00000 n 
-0000689311 00000 n 
-0000689462 00000 n 
-0000689613 00000 n 
-0000689764 00000 n 
-0000689913 00000 n 
-0000690063 00000 n 
-0000690214 00000 n 
-0000690364 00000 n 
-0000690514 00000 n 
-0000690665 00000 n 
-0000690816 00000 n 
-0000690967 00000 n 
-0000691116 00000 n 
-0000691267 00000 n 
-0000691418 00000 n 
-0000691569 00000 n 
-0000691719 00000 n 
-0000691868 00000 n 
-0000692017 00000 n 
-0000692167 00000 n 
-0000692318 00000 n 
-0000692469 00000 n 
-0000692619 00000 n 
-0000692770 00000 n 
-0000692920 00000 n 
-0000693071 00000 n 
-0000693221 00000 n 
-0000693372 00000 n 
-0000693523 00000 n 
-0000693674 00000 n 
-0000693823 00000 n 
-0000693972 00000 n 
-0000694121 00000 n 
-0000694270 00000 n 
-0000694418 00000 n 
-0000694567 00000 n 
-0000694714 00000 n 
-0000694863 00000 n 
-0000695012 00000 n 
-0000695161 00000 n 
-0000695312 00000 n 
-0000695463 00000 n 
-0000695613 00000 n 
-0000695764 00000 n 
-0000695915 00000 n 
-0000696064 00000 n 
-0000696215 00000 n 
-0000696364 00000 n 
-0000696646 00000 n 
-0000684919 00000 n 
-0000683536 00000 n 
-0000696529 00000 n 
-0000696587 00000 n 
-0000963539 00000 n 
-0000698911 00000 n 
-0000699062 00000 n 
-0000699213 00000 n 
-0000699364 00000 n 
-0000699515 00000 n 
-0000699666 00000 n 
-0000699816 00000 n 
-0000699966 00000 n 
-0000700116 00000 n 
-0000700267 00000 n 
-0000700418 00000 n 
-0000700569 00000 n 
-0000700720 00000 n 
-0000700871 00000 n 
-0000701022 00000 n 
-0000701173 00000 n 
-0000701323 00000 n 
-0000701474 00000 n 
-0000701624 00000 n 
-0000701775 00000 n 
-0000701925 00000 n 
-0000702076 00000 n 
-0000702226 00000 n 
-0000702377 00000 n 
-0000702528 00000 n 
-0000702677 00000 n 
-0000702827 00000 n 
-0000702977 00000 n 
-0000703127 00000 n 
-0000703277 00000 n 
-0000703428 00000 n 
-0000703579 00000 n 
-0000703730 00000 n 
-0000703881 00000 n 
-0000704030 00000 n 
-0000704179 00000 n 
-0000704330 00000 n 
-0000704480 00000 n 
-0000704631 00000 n 
-0000704782 00000 n 
-0000704932 00000 n 
-0000705083 00000 n 
-0000705233 00000 n 
-0000705384 00000 n 
-0000705534 00000 n 
-0000705685 00000 n 
-0000705836 00000 n 
-0000705987 00000 n 
-0000706138 00000 n 
-0000706289 00000 n 
-0000706440 00000 n 
-0000706591 00000 n 
-0000706742 00000 n 
-0000706893 00000 n 
-0000707044 00000 n 
-0000707195 00000 n 
-0000707346 00000 n 
-0000707497 00000 n 
-0000707648 00000 n 
-0000707799 00000 n 
-0000707950 00000 n 
-0000708101 00000 n 
-0000708252 00000 n 
-0000708403 00000 n 
-0000708554 00000 n 
-0000708704 00000 n 
-0000708853 00000 n 
-0000711124 00000 n 
-0000709001 00000 n 
-0000709222 00000 n 
-0000698164 00000 n 
-0000696773 00000 n 
-0000709164 00000 n 
-0000711275 00000 n 
-0000711425 00000 n 
-0000711574 00000 n 
-0000711723 00000 n 
-0000711873 00000 n 
-0000712024 00000 n 
-0000712175 00000 n 
-0000712324 00000 n 
-0000712475 00000 n 
-0000712625 00000 n 
-0000712776 00000 n 
-0000712925 00000 n 
-0000713076 00000 n 
-0000713226 00000 n 
-0000713377 00000 n 
-0000713528 00000 n 
-0000713679 00000 n 
-0000713830 00000 n 
-0000713981 00000 n 
-0000714132 00000 n 
-0000714283 00000 n 
-0000714434 00000 n 
-0000714585 00000 n 
-0000714735 00000 n 
-0000714885 00000 n 
-0000715034 00000 n 
-0000715184 00000 n 
-0000715335 00000 n 
-0000715486 00000 n 
-0000715637 00000 n 
-0000715788 00000 n 
-0000715939 00000 n 
-0000716089 00000 n 
-0000716238 00000 n 
-0000716389 00000 n 
-0000716540 00000 n 
-0000716691 00000 n 
-0000716842 00000 n 
-0000716993 00000 n 
-0000717143 00000 n 
-0000717293 00000 n 
-0000717444 00000 n 
-0000717594 00000 n 
-0000717743 00000 n 
-0000717894 00000 n 
-0000718045 00000 n 
-0000718196 00000 n 
-0000718347 00000 n 
-0000718570 00000 n 
-0000710548 00000 n 
-0000709349 00000 n 
-0000718512 00000 n 
-0000718697 00000 n 
-0000718723 00000 n 
-0000718851 00000 n 
-0000719290 00000 n 
-0000719322 00000 n 
-0000719952 00000 n 
-0000720408 00000 n 
-0000720458 00000 n 
-0000720859 00000 n 
-0000957711 00000 n 
-0000721285 00000 n 
-0000721597 00000 n 
-0000721919 00000 n 
-0000722395 00000 n 
-0000722751 00000 n 
-0000723227 00000 n 
-0000723789 00000 n 
-0000724169 00000 n 
-0000724647 00000 n 
-0000725290 00000 n 
-0000725988 00000 n 
-0000726032 00000 n 
-0000726169 00000 n 
-0000726522 00000 n 
-0000734718 00000 n 
-0000734988 00000 n 
-0000742342 00000 n 
-0000742566 00000 n 
-0000751136 00000 n 
-0000751407 00000 n 
-0000761705 00000 n 
-0000761951 00000 n 
-0000769660 00000 n 
-0000769893 00000 n 
-0000777438 00000 n 
-0000777666 00000 n 
-0000788340 00000 n 
-0000788629 00000 n 
-0000796282 00000 n 
-0000796555 00000 n 
-0000804805 00000 n 
-0000805079 00000 n 
-0000812075 00000 n 
-0000812302 00000 n 
-0000820213 00000 n 
-0000820469 00000 n 
-0000828249 00000 n 
-0000828511 00000 n 
-0000832085 00000 n 
-0000832306 00000 n 
-0000850260 00000 n 
-0000850799 00000 n 
-0000859933 00000 n 
-0000860265 00000 n 
-0000873420 00000 n 
-0000873884 00000 n 
-0000882237 00000 n 
-0000882556 00000 n 
-0000889755 00000 n 
-0000890115 00000 n 
-0000907165 00000 n 
-0000907615 00000 n 
-0000918748 00000 n 
-0000919081 00000 n 
-0000940041 00000 n 
-0000940669 00000 n 
-0000957214 00000 n 
-0000963637 00000 n 
-0000963757 00000 n 
-0000963882 00000 n 
-0000963990 00000 n 
-0000964072 00000 n 
-0000967726 00000 n 
-0000967914 00000 n 
-0000968437 00000 n 
-0000968960 00000 n 
-0000969483 00000 n 
-0000970006 00000 n 
-0000970529 00000 n 
-0000971052 00000 n 
-0000971575 00000 n 
-0000972098 00000 n 
-0000972621 00000 n 
-0000973144 00000 n 
-0000973667 00000 n 
-0000974190 00000 n 
-0000974815 00000 n 
-0000975610 00000 n 
-0000976405 00000 n 
-0000977200 00000 n 
-0000977838 00000 n 
-0000978601 00000 n 
-0000979224 00000 n 
-0000979663 00000 n 
-0000980030 00000 n 
-0000980537 00000 n 
-0000980956 00000 n 
-0000981811 00000 n 
-0000982568 00000 n 
-0000983281 00000 n 
-0000983845 00000 n 
-0000984478 00000 n 
-0000985172 00000 n 
-0000985894 00000 n 
-0000986583 00000 n 
-0000987272 00000 n 
-0000987961 00000 n 
-0000988517 00000 n 
-0000989142 00000 n 
-0000989748 00000 n 
-0000990573 00000 n 
-0000991261 00000 n 
-0000991950 00000 n 
-0000992639 00000 n 
-0000993261 00000 n 
-0000993886 00000 n 
-0000994511 00000 n 
-0000995221 00000 n 
-0000995952 00000 n 
-0000996633 00000 n 
-0000997314 00000 n 
-0000997936 00000 n 
-0000998553 00000 n 
-0000999170 00000 n 
-0000999876 00000 n 
-0001000638 00000 n 
-0001001367 00000 n 
-0001002096 00000 n 
-0001002740 00000 n 
-0001003405 00000 n 
-0001004070 00000 n 
-0001004712 00000 n 
-0001005401 00000 n 
-0001006090 00000 n 
-0001006779 00000 n 
-0001007387 00000 n 
-0001008028 00000 n 
-0001008669 00000 n 
-0001009310 00000 n 
-0001009951 00000 n 
-0001010592 00000 n 
-0001011233 00000 n 
-0001011874 00000 n 
-0001012515 00000 n 
-0001013149 00000 n 
-0001013790 00000 n 
-0001014431 00000 n 
-0001015072 00000 n 
-0001015713 00000 n 
-0001016354 00000 n 
-0001016995 00000 n 
-0001017636 00000 n 
-0001018282 00000 n 
-0001018947 00000 n 
-0001019682 00000 n 
-0001020627 00000 n 
-0001021502 00000 n 
-0001022391 00000 n 
-0001023131 00000 n 
-0001023813 00000 n 
-0001024438 00000 n 
-0001025063 00000 n 
-0001025688 00000 n 
-0001026313 00000 n 
-0001026938 00000 n 
-0001027563 00000 n 
-0001028188 00000 n 
-0001028813 00000 n 
-0001029438 00000 n 
-0001030063 00000 n 
-0001030688 00000 n 
-0001031313 00000 n 
-0001031938 00000 n 
-0001032563 00000 n 
-0001033188 00000 n 
-0001033813 00000 n 
-0001034438 00000 n 
-0001035063 00000 n 
-0001035403 00000 n 
-0001035574 00000 n 
-0001035744 00000 n 
-0001035915 00000 n 
-0001036084 00000 n 
-0001036257 00000 n 
-0001036434 00000 n 
-0001036609 00000 n 
-0001036786 00000 n 
-0001036961 00000 n 
-0001037138 00000 n 
-0001037313 00000 n 
-0001037490 00000 n 
-0001037665 00000 n 
-0001037837 00000 n 
-0001038068 00000 n 
-0001038319 00000 n 
-0001038570 00000 n 
-0001038830 00000 n 
-0001039095 00000 n 
-0001039366 00000 n 
-0001039637 00000 n 
-0001039910 00000 n 
-0001040182 00000 n 
-0001040453 00000 n 
-0001040701 00000 n 
-0001040904 00000 n 
-0001041106 00000 n 
-0001041309 00000 n 
-0001041511 00000 n 
-0001041718 00000 n 
-0001041925 00000 n 
-0001042134 00000 n 
-0001042341 00000 n 
-0001042547 00000 n 
-0001042733 00000 n 
-0001042929 00000 n 
-0001043150 00000 n 
-0001043381 00000 n 
-0001043613 00000 n 
-0001043848 00000 n 
-0001044069 00000 n 
-0001044325 00000 n 
-0001044592 00000 n 
-0001044864 00000 n 
-0001045145 00000 n 
-0001045425 00000 n 
-0001045706 00000 n 
-0001045984 00000 n 
-0001046232 00000 n 
-0001046417 00000 n 
-0001046596 00000 n 
-0001046754 00000 n 
-0001046916 00000 n 
-0001047120 00000 n 
-0001047354 00000 n 
-0001047542 00000 n 
-0001047799 00000 n 
-0001048052 00000 n 
-0001048280 00000 n 
-0001048515 00000 n 
-0001048763 00000 n 
-0001049012 00000 n 
-0001049250 00000 n 
-0001049482 00000 n 
-0001049714 00000 n 
-0001049977 00000 n 
-0001050238 00000 n 
-0001050466 00000 n 
-0001050694 00000 n 
-0001050866 00000 n 
-0001050982 00000 n 
-0001051097 00000 n 
-0001051225 00000 n 
-0001051357 00000 n 
-0001051481 00000 n 
-0001051609 00000 n 
-0001051746 00000 n 
-0001051876 00000 n 
-0001051957 00000 n 
-0001052131 00000 n 
-0001052361 00000 n 
-0001052535 00000 n 
-0001052659 00000 n 
-0001052756 00000 n 
-0001052865 00000 n 
-0001052905 00000 n 
-0001053086 00000 n 
-trailer
-<< /Size 3686
-/Root 3684 0 R
-/Info 3685 0 R
-/ID [<56EA3E090956F1821568D6344691D06A> <56EA3E090956F1821568D6344691D06A>] >>
-startxref
-1053413
-%%EOF
diff --git a/doc/ppl-user-c-interface-1.0.ps.gz b/doc/ppl-user-c-interface-1.0.ps.gz
deleted file mode 100644
index 698f3ca..0000000
Binary files a/doc/ppl-user-c-interface-1.0.ps.gz and /dev/null differ
diff --git a/doc/ppl-user-c-interface-1.1pre8-html.tar.gz b/doc/ppl-user-c-interface-1.1pre8-html.tar.gz
new file mode 100644
index 0000000..6c2ab24
Binary files /dev/null and b/doc/ppl-user-c-interface-1.1pre8-html.tar.gz differ
diff --git a/doc/ppl-user-c-interface-1.1pre8.pdf b/doc/ppl-user-c-interface-1.1pre8.pdf
new file mode 100644
index 0000000..f257c67
--- /dev/null
+++ b/doc/ppl-user-c-interface-1.1pre8.pdf
@@ -0,0 +1,26574 @@
+%PDF-1.4
+%����
+1 0 obj
+<< /S /GoTo /D (section.1) >>
+endobj
+4 0 obj
+(\376\377\000M\000a\000i\000n\000\040\000P\000a\000g\000e)
+endobj
+5 0 obj
+<< /S /GoTo /D (section.2) >>
+endobj
+8 0 obj
+(\376\377\000G\000N\000U\000\040\000G\000e\000n\000e\000r\000a\000l\000\040\000P\000u\000b\000l\000i\000c\000\040\000L\000i\000c\000e\000n\000s\000e)
+endobj
+9 0 obj
+<< /S /GoTo /D (section.3) >>
+endobj
+12 0 obj
+(\376\377\000G\000N\000U\000\040\000F\000r\000e\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000L\000i\000c\000e\000n\000s\000e)
+endobj
+13 0 obj
+<< /S /GoTo /D (section.4) >>
+endobj
+16 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+17 0 obj
+<< /S /GoTo /D (subsection.4.1) >>
+endobj
+20 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000s)
+endobj
+21 0 obj
+<< /S /GoTo /D (section.5) >>
+endobj
+24 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
+endobj
+25 0 obj
+<< /S /GoTo /D (subsection.5.1) >>
+endobj
+28 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000L\000i\000s\000t)
+endobj
+29 0 obj
+<< /S /GoTo /D (section.6) >>
+endobj
+32 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+33 0 obj
+<< /S /GoTo /D (subsection.6.1) >>
+endobj
+36 0 obj
+(\376\377\000C\000\040\000L\000a\000n\000g\000u\000a\000g\000e\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e)
+endobj
+37 0 obj
+<< /S /GoTo /D (subsection.6.2) >>
+endobj
+40 0 obj
+(\376\377\000L\000i\000b\000r\000a\000r\000y\000\040\000I\000n\000i\000t\000i\000a\000l\000i\000z\000a\000t\000i\000o\000n\000\040\000a\000n\000d\000\040\000F\000i\000n\000a\000l\000i\000z\000a\000t\000i\000o\000n)
+endobj
+41 0 obj
+<< /S /GoTo /D (subsection.6.3) >>
+endobj
+44 0 obj
+(\376\377\000V\000e\000r\000s\000i\000o\000n\000\040\000C\000h\000e\000c\000k\000i\000n\000g)
+endobj
+45 0 obj
+<< /S /GoTo /D (subsection.6.4) >>
+endobj
+48 0 obj
+(\376\377\000E\000r\000r\000o\000r\000\040\000H\000a\000n\000d\000l\000i\000n\000g)
+endobj
+49 0 obj
+<< /S /GoTo /D (subsection.6.5) >>
+endobj
+52 0 obj
+(\376\377\000T\000i\000m\000e\000o\000u\000t\000\040\000H\000a\000n\000d\000l\000i\000n\000g)
+endobj
+53 0 obj
+<< /S /GoTo /D (subsection.6.6) >>
+endobj
+56 0 obj
+(\376\377\000L\000i\000b\000r\000a\000r\000y\000\040\000D\000a\000t\000a\000t\000y\000p\000e\000s)
+endobj
+57 0 obj
+<< /S /GoTo /D (section.7) >>
+endobj
+60 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+61 0 obj
+<< /S /GoTo /D (subsection.7.1) >>
+endobj
+64 0 obj
+(\376\377\000p\000p\000l\000\137\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000S\000e\000q\000u\000e\000n\000c\000e\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+65 0 obj
+<< /S /GoTo /D (subsection.7.2) >>
+endobj
+68 0 obj
+(\376\377\000p\000p\000l\000\137\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+69 0 obj
+<< /S /GoTo /D (subsection.7.3) >>
+endobj
+72 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000e\000f\000f\000i\000c\000i\000e\000n\000t\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+73 0 obj
+<< /S /GoTo /D (subsection.7.4) >>
+endobj
+76 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+77 0 obj
+<< /S /GoTo /D (subsection.7.5) >>
+endobj
+80 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+81 0 obj
+<< /S /GoTo /D (subsection.7.6) >>
+endobj
+84 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+85 0 obj
+<< /S /GoTo /D (subsection.7.7) >>
+endobj
+88 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+89 0 obj
+<< /S /GoTo /D (subsection.7.8) >>
+endobj
+92 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+93 0 obj
+<< /S /GoTo /D (subsection.7.9) >>
+endobj
+96 0 obj
+(\376\377\000p\000p\000l\000\137\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+97 0 obj
+<< /S /GoTo /D (subsection.7.10) >>
+endobj
+100 0 obj
+(\376\377\000p\000p\000l\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+101 0 obj
+<< /S /GoTo /D (subsection.7.11) >>
+endobj
+104 0 obj
+(\376\377\000p\000p\000l\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+105 0 obj
+<< /S /GoTo /D (subsection.7.12) >>
+endobj
+108 0 obj
+(\376\377\000p\000p\000l\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+109 0 obj
+<< /S /GoTo /D (subsection.7.13) >>
+endobj
+112 0 obj
+(\376\377\000p\000p\000l\000\137\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+113 0 obj
+<< /S /GoTo /D (subsection.7.14) >>
+endobj
+116 0 obj
+(\376\377\000p\000p\000l\000\137\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+117 0 obj
+<< /S /GoTo /D (subsection.7.15) >>
+endobj
+120 0 obj
+(\376\377\000p\000p\000l\000\137\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+121 0 obj
+<< /S /GoTo /D (subsection.7.16) >>
+endobj
+124 0 obj
+(\376\377\000p\000p\000l\000\137\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+125 0 obj
+<< /S /GoTo /D (subsection.7.17) >>
+endobj
+128 0 obj
+(\376\377\000p\000p\000l\000\137\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+129 0 obj
+<< /S /GoTo /D (subsection.7.18) >>
+endobj
+132 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000D\000e\000c\000i\000s\000i\000o\000n\000\137\000N\000o\000d\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+133 0 obj
+<< /S /GoTo /D (subsection.7.19) >>
+endobj
+136 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+137 0 obj
+<< /S /GoTo /D (subsection.7.20) >>
+endobj
+140 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+141 0 obj
+<< /S /GoTo /D (subsection.7.21) >>
+endobj
+144 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+145 0 obj
+<< /S /GoTo /D (subsection.7.22) >>
+endobj
+148 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000c\000o\000n\000s\000t\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+149 0 obj
+<< /S /GoTo /D (subsection.7.23) >>
+endobj
+152 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000i\000t\000e\000r\000a\000t\000o\000r\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+153 0 obj
+<< /S /GoTo /D (subsection.7.24) >>
+endobj
+156 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+157 0 obj
+<< /S /GoTo /D (subsection.7.25) >>
+endobj
+160 0 obj
+(\376\377\000p\000p\000l\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000t\000a\000g\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+161 0 obj
+<< /S /GoTo /D (table.18) >>
+endobj
+164 0 obj
+(\376\377\000I\000n\000d\000e\000x)
+endobj
+165 0 obj
+<< /S /GoTo /D [166 0 R  /Fit ] >>
+endobj
+169 0 obj <<
+/Length 1269      
+/Filter /FlateDecode
+>>
+stream
+x��WIs�6��W��)5c�X.�%��:g\K�i
Ql�� G��"�J�6��xxx���Fe����O�8 �
a1��$(��?O0b8Mc�2\���M/8�iHpѝ�
��hg5�}=?9��Y at RD	���2 Y�8�XNe<�?���JN"�f��$ơP��a#v2�îޮ䣚8v���mA��p;�0�
��8CPN2g��닶܈�ݴZ��.�B������Շ^��
|�n݊�@nDm��]]�SK
g(Oi� {�a̜�q"Br�h
+p"	�is�qԥꫮu��������h�Ĥ�ň'�ٹ���ԝ3�Z���ѳFb��,&����I#Ƽ��1�(c(e98�Y}��2���**��[�?Uu=��&gt��<���(��1�e+=ȯb�R�ʺ
#3�c��˟Ɖ%(��f�˫��bDh>$�y�P�RB!]
%��i��ѫ
R|�[<���z1�����������#�ߘ�ͳ��j5I�>��u0�v�
Ӏ��i�C�栙���/�6��@���Ea�έLo�<|2���n�^���2�µP��:i�Y�;��W�� �<�����	qM��~�t�;s T#�+y�!�n�z�E%[]��p%{)T��
��wYhwd�Ms��>���
s������n'Z��t��+�z��L�L�]/�F���P�#
������9,	;8�Hl�&���KN�Nu���9���3��b���^+��17�`bh�9����o̜Z��1�}�ͥ�Z}
ζ��M��ۀ�y�j���Uݙ�>9���� [...]
�&	��'��M��g�ﮝ�W���s9~�&�karQ	���W
�𛲗m���9��>��������U�4�Zں��"���7{N��
!�
(��*�_����U�S�/&�N�
+endstream
+endobj
+166 0 obj <<
+/Type /Page
+/Contents 169 0 R
+/Resources 168 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 177 0 R
+>> endobj
+167 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/ppl_logo.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 178 0 R
+/BBox [0 0 640 829]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 179 0 R
+>>>>
+/Length 2688
+/Filter /FlateDecode
+>>
+stream
+x�m�K�#�
D�ZEm�4	�
{�(�#�sD��'�*�>��j�V��L��ǑS9���������9����qӸל�i�Қǟ�>�u��V���)�2k�%[�׍�jk
e���<F��bȣ��u��5�ID���q�^��%�R��ˬ���|�T�4��yԮ������hYϔc�ԭ��V�»�>�������������J�k�>�si���3�4���Hݏ��{�l��V����^.&ϩ�<&;�����u��I
@����Z�KD�P���\�i����s|��R4�h}�9��艥����b\K��؆��j�ik�L���=�̸�"ؼZI��(	���%s6W���+�y�1�H')�ql�
��g���y�Qs�_7������/�;ji�y�'x���k%_�J>8{w@�wv�NQȁ�l�=("JY�s����Iy
ǹ�k�S���+���}hk�>"���Rd�'n$�4��
�įGh
�Y�ϲ����Ȭbeh&f������3(0Ϝw�9��Б ��‘�^@�A}� �T�4D�߶V�?5�$��[e��!�f�b[�l��E�4����Y4�9p��	���n<���
��9;�D4%�q�+^�kK��%��9�5��|?ĝS�Ī��@.�"�A���T�5&�%^�n59:�/H��(%�~����a	Z=�d�I��fJ+�^+�︌�B2X����#ѥ�S�����0V[-NS� �(b&�C��*�s�

��*d�K
��5ɫ�6�؄KC�hz�4��)�
�y� DF^Akz�\3W��m9�`����@�l:�MYe��B�:x6+b� h�6$sܨ��W�Z�^,����Ddx&hI���
��$�a"q���
�:��RSH�2<Z<�H�r{v%��.W次�8��?�BJ6
b�H4
,Fߎ� �Ԛ�������2��B�Z�	�.Ŋ�>@��񸵊��d�J�
�S����Q��ufG�.-�+���]��ҢxR�ِNV1�0	K��r�ہ�
��.�Q�<��͙N��*7b�_<��6���G"Cd�t�6 D�x�RkT����`; F'���́�����Gy����.C��EK�+��
(�eC�K8T�2�Q)� [...]
���B[�}��T�<��W��Z�.q[C�T"WCNҵ�e;WCk��KC�CV �E���*!��h�n�o�v������"?�1˪���롋q� vZ��K�	��.����_�6=:�+Ң�y�����
���K�4zx��
�L�ť���IoOCE
;Q6M�`]�����TD��s��E��a�,|ʙd9�Iङ��CK-���{|�׎�Aг�=GD�~W�#�J�6l=��W#,�8�$���9G�=UT�����o	���2+�S�2��Q{��u���QnU=�Qc����0Wv�b�0�����J
�QK
Ց7�4<�U��
�Sz
�j}��RdJ-��U"�
Yl���U-��q"N)����I�+�F�ۜ+����Ӽ
��M�תoÂ���l6����Q�j�q�'���}BR�
PKǧ��ѓ�%2V����,^��
j�b�K����L�N͙
�q����MW��.�P��W$������
+D���5G�\����84I���$�h<u�k�L59�0%Q��)�FX�C��ӻ�
�����
���a:׊]G'�u
��Z��B�^LE��e����Z7D�C���c�I��
U��]��iQ8s�2��*'��X�"���h6b�B��k���L2(:����I�1�s�˹�����{�uo:�k�%�.�k[��x�R�����u�
�<�����-�o�ͻ�m���

�	x���}�H�e�.��XD
�8r�D��\�%#
����k�6
%o؁zW>
 ><�ϸ�x�G���/�#�"pb:�h]�F��7��>��KHݗT��r�kwت �ӠD���Ւy��K���կ���,�G��C�Ss|��<g��uo?�������K@�
��	4�ͺ'��)�$&O:3
��.��[�G�¸���E�;{
��*����Kw�-K���T@�O���+LH�㛃��ӊwĪfgh*�� Mj�TV���F1�k
I
�?5ڮ����åےT�ѻP.d�wѩ/��"\G�
���
��G"�
�u��+��t�bg��[����pS�jeg)s_�螢bM��R
-εQo��
}� ���������@1n�M͢
���6"�-lW�Z7U���
;���mD+�|G�F��Z��@
����Q�5����(g�`R���X�6T�����.��|��6���ч��
�?��3
o���3��� m�B ��MY:c�q�P}E'�-2���
+@!S#����s����I���U$ZJZ$��\!X��P8���+�x^�|�f�:��d|?@__��h���^�a9��n]چ�*5s|Y��E���v_�#^��[�/�s͢O��
�?v�s`\�ؿ��^X{��~Ej�aW�K/Tz�
����Z���\��j�
|��>�?��a��x(~?�B�
<q����
T��5F#��
�s�B�
+����[���N��o�ِW]r�a'tܯ�_�|�"�8w�VۥDD�#��n���f���?�
�
+endstream
+endobj
+178 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100336+01'00')
+/ModDate (D:20111106100336+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+179 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+170 0 obj <<
+/D [166 0 R /XYZ 89 770.89 null]
+>> endobj
+171 0 obj <<
+/D [166 0 R /XYZ 90 721.073 null]
+>> endobj
+168 0 obj <<
+/Font << /F58 172 0 R /F24 173 0 R /F41 174 0 R /F42 175 0 R /F60 176 0 R >>
+/XObject << /Im1 167 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+182 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+181 0 obj <<
+/Type /Page
+/Contents 182 0 R
+/Resources 180 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 177 0 R
+>> endobj
+183 0 obj <<
+/D [181 0 R /XYZ 89 770.89 null]
+>> endobj
+180 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+194 0 obj <<
+/Length 1555      
+/Filter /FlateDecode
+>>
+stream
+xڝWK��6
��W�Vif-�z+�Ի�n�:׏v2I�LۚȒ#���/@����NҞH  �@�[���Eop2#���	����Yd3
��~ ����t�����Ѣ���a3�3��02�}��Wf����`�GƓ���˜��=�5tM�*�m���]y�83��l�k���3��s�9��/�8�3��ʕ����ɶH�D�b>[ᷴ��Ev�,�7��3�G}0
��O��L�v�9^>�G�D�����k�Û�`e9�<nkQl�ܟ������b�մw]�ǽ(�����*[	�lv�&S��fR��a�e��k}�I����uf:��e�̴:�TT�������.8��อ��k\pC��T��
+|�Hnd����9AbI�
����:�<Ӽ�i��1Q��X�J�(

��������K��WB\K�[�>i�
H�$KEQ�\���U}�s�!:���� ?�"O��#���p\�Y��X�r�����

"⛡g����RD�/g�r�<ah�JQ��L	��3�&B
�W�̧��];���Bs\X
�
��,�e�HQi������}UM��D���̅2S ���`q����j��Jn���K
aWGS�V߃<�u�*���T*v��9ZH��X��q
1�r����KM��E��-D���bz��jq3fYh(�3�^�ӥu�#P�]��B�1$pI	
7Ҍ��f�)H�A)�G�J��&�x�>T��xB��Aa��Q��F��P籖G�É(D���B?E,��"�Xp3���
�%X��#���Jl� 
�~(U`�jt.@
:]�S�9��x�mČzP��&
�BZ�k�(����>��'�K�O��q`ra����逑ҁ*tx�*
G

)�@���Z ���p���q4N��~y;�)H��F�������	Nj�@8��bĤ4aW
�&�ĠPC��,�i�R��Zl���"�jZ�5^���\����Z
d����q�Ɋ
YQ
��Ro�e)�ŵ𨒂
�yF �LU�x�>�J�7?�fw���CE܎'��'%P�x?^<��s��8�ɐ�)�9�Y3��d����l�q>���\(��.}>�?
yznh�wz�\l���vS	��i�,��k��1�4���9ah��ŐXE�Ф����iCB��+@`��R"�ª��RR(0IV������F�D�aV+��,�$'��smP�7�Ye�"����j8�Y.� 좭�q\������=�Ϸ\_{�T6J�>�H7q��	�ߊu[��I�!�́�Q��,T��|x��[uq��A'͎�~S��s��
+��}�֬���ϫ���9�.����o���sp�ۑ���cU����>���\Ӧ

��c4��H��
�ف����n��{�َ�=_�t璩w*�`�w��%���S+��
�d�vx?�;)��;
�Y`ǡ��Bt�n�Փ'��'���l��M��6��SEZ֢�^��!)�I�t�f��JD�a黠k.^
�Զn�س8{-�gi�8s�,�z�f֩a[��u\}�!
���J;�!�Gio篤ݽL�����
+endstream
+endobj
+193 0 obj <<
+/Type /Page
+/Contents 194 0 R
+/Resources 192 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 177 0 R
+/Annots [ 184 0 R 185 0 R 186 0 R 187 0 R 197 0 R 188 0 R 190 0 R ]
+>> endobj
+189 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/bugseng_logo.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 199 0 R
+/BBox [0 0 640 166]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 200 0 R
+>>>>
+/Length 1662
+/Filter /FlateDecode
+>>
+stream
+x�}W[�
7
��S�	��8F�
�c6���)R"��Y��Z��J$U��ʩ\Y��Ϗ�o��ۿ��|��r)�j5�hu�9��]^�<r9��m)S�M�:)��v��� j��a+%�z}
$�$�/�*i^�jjS.*s&,t���R�<+h�:��wݱ��)�Z��
i%�z-�{�
Q݆��V,�Y���W���I_���'�ԫq�"��
��'
�*���b.i��\O�>���%�h�&�Ȥ�~˄@�D���N���$�_�&a#��e�Uj�|[Q�^o��2o���îi!cZ�ף����
i����s4eW

E����݆��
�<+Z
I��P꽇�8Y�Ɨ��3����4�W)�����/r�]w��<�ʶ�q�<��~�t��
�_u)�V��Y�U�����
+����/ 8� &���Ua���j��Je��+%
+��̉�)i�U
�
�S���F_@��rG�T���HE�
nw�6[.�:�o��@r�������ЊCAT���F_�n�n��)|�d�Q��
H�i��?
�h=�8�8΍=U��UPC%Ӎ�.
��(R�ae*77=�󱁉�S�^�
+��3��j_
��
�Z�|>j�$�3�#a���>�׹2D���'N)�
�+ }��"��{�7��Aw�a���mŏ�
+FVCg��
�ԭ����)_����'�\G�^����\��1B��g��n�\ڠ�NY�
:��Yq�&�Fa�-��� B��S��f���7�G	#S���
٬7��E�� 9�D��M
+G
+�20��Ci�e�+������D�����ô b�~#����z�'�\.���F�է��]xv���i�@ I�8a�=�z[PjVkn��w|0S��t�h�m�ل֩�H�F��@0#����5�jN�1�-�R�F;p1jվ(�֙EHG´��i
�;i�`
 {��&4X��s[4�I�
d�!
޴r/^�a��@��Ƕ�?Zr�W��U��PǗ}2
��di8�ÍU���Q{?��b:���H��l�D��
�0ձ�vxk�ڱ�ʜ�

ו��^Y�"Ƃ۸���8�z��Hح�(;�����_۲h��a
�
+�e���f���hX�R�iqV`z��!��9s���}���g�z^���A�.a?�S�*To
+�W�h@�+V�C�`�x�k��a�<��]a�M�:r�#�`[�{���T�|�W��$̽�g����+�xآ%��
-$�*^*��w��+�M��M1����Q���o*Z6�P)�P�n�+T�`����jV�
+	�
+�,r ��U��W
O�qj�T�M�J�p/������5쐯�kC����u�%��u_(�@�3~Gvig\��W�A�^���j;+t,q�pLM{9i�I�s$��!w�tꡎ�+�!�HB�$���� ������d�_
d7e"�yξ��W��w$����+N�n�� 8�uXl���W(��DY6�~٭����Ȧ�<6��IJGfQ%?4�
�
��L+Bt���{1m�8�MS&L��r9=56*�Q�*�RȾ�{O�C=��P���Yb���
���h��k
9K,k�8�n#�f:Vl07�:��+��i�v,��~"[
�k�� :)��
z��U����3���b��X��?k���1�G���f��σo��?Q��B
+endstream
+endobj
+199 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100335+01'00')
+/ModDate (D:20111106100335+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+200 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+191 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/ppl_logo_no_ppl.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 201 0 R
+/BBox [0 0 640 640]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 202 0 R
+>>>>
+/Length 2432
+/Filter /FlateDecode
+>>
+stream
+x�m�]�$7���y��%R����
+��C��s���ʬ��6
�Z��"#�d�u�Tά������ۿ����_G>K>{���gM^ο�8�s��(�czʥ����z���-U[�%�b�
9'cYSu��ó�T�*�^���δ��i��O/<��Y�J�8�|�6�i�G����T�2
�Q��R�RNk
]ΙϞ=��ǟ\�ۡ�Z��~��(�����YZ�<k�-����5k��Z��Q����~]7���Z
F���~��f��|����B5n��1�Sֈ�g
�
k+���㨥���h}�Sd�R�6{��X7S0�>��zʤ�@�����X�k���bq��x����e��2�ݒ9O�~&3y�-�qN�\Vy�V6����׍��}�p��
FX��k�0H
m֖F�uM@��办®�M쒑Rqp,�񶖕���y���W�2��
����:9FLs9o���n�	��S(v�A'{��� �\w|Q���҆�<i=ML�ZR�%��
+�&�
/81���L�n������``^I���*��g
��l���q��Ǘ�_� ������Q�Ov��vT�p���в8>���
d��o�ўAC�+���
b�8�$=��Zs����	~�4��ɓd�7^�ۣ�� X�~�����>�v��Я*�6[�h�b��h�G2o '
L4��dV2��?�i=�kq���@�7Ye�i���
�|G`ped�m��ڵ��\*'3�	
+�V/#�0�ۜ��!0�x/uA�N��ㄵ�"3 H�W�
v"젰aC"`� 6����{	�T�g��H]~!
b��S'����Z���>���]<ˀ����'
?��M��������
q�K�ؓc<1�c�3����x�h�H/r�ђ�'�
��(
���4��-0Y�~�BJ�1L��	�
^,t�����

"��bQ�N�b�3J"�� ����B	���
�����6\�h,�0pRٖ��Ѡ= Pz=�%�B�Mޑ�>ؙ�/1��
#��@ңvR��`r+pB���{Qo`
	@���_轁D^��j�J��H���(�B�3qy_�
�����G��K�cG� ��-TlFq�4T�G08��2�
�,E�
⃝VTD�
JY��&x;w+d�H\��)SU�t�����_!ԙ�q��P��h�[z
I��f�Q�M�sTQ؜���"�Ch&,�ɮ� ������M�k���C[�}���<��N�Ӑ7�}���C<;�d��./�F\KXS�>�"�
+}W,T&w�>8�[�����
+wx�_R�O;��{U�⑨���A��Wn�_N����#b��,���n~v�7�hI�W�{�Zw�LV1'�HI(6�;�C���
JBCFU$�=z����Ԝ�� ��8 ��{S�b�wH�g�Uk"�n�)[dA4ohw�@M�z�|��Z?��v#�քD�v��V�S"�Ed��
�5���:ND
,��	��{�!���}����?>'��+�S�2����mj� ��A�U=�Zf�wH�x�d��y�J����H#��� �Ҙ�
y�NP�'
b���#�U�
�\_j���D�[���</������r뤈J�o���jQ�e
+��3��˵O�yK�b���C���C�a��!쩨.6%g�'���Ս��@�/��4qS�@
bgS}w�}-���Cw#B�ZD�k�B�,&%U4�һbܴ������!'QE��n���	�� )�rO��1
h���m@��P�&�q��S��J��Yn��PxV��S;uc��D���z�S�_b
���-�]���8,�@GC�U���$�
zٲ�4w����L�@ԁ���SQ�H&�0�tJZ�*6�?�R���A��e� �!�0nI��-���R��ʵ� ĞƮ'*اq��n/���u�!m� 
����ss
 =��-
+ z�`�k�,�~�D�x�mC�`M�`�+_���x?�d�։U�uh�g}P�d�v-���q����:(��ڕ/�Ƿ�'��_�D�Q�fBc��/�fMj%�i���	%�8���U`�ԏ�a�l� 0v��s��DRn��h|�n�r��6pd�q�e�c�h�v0��Af�
���� ��jw-:��v��{�Њ$�&H��

�|��|�zL�w�zW|ׄ����_�N+��H�z)x_�{h ��\1Dz^ �Kc��!�aw�w�h
�(��.����
m��HA3À%�br�\�g�(���N�m��Ppn��
�88}�B?
+��?��"�`�����tu8��5���w\�S��i��h�R;�%{��.�L�
�
����3Lp	�rp
3Z[���&=K٣�E'h�>��o��4�	���^4�ѵlP���m�
�p#�י)ח�,�����M��ڮ5unT��7���*�G�F�Xjf%�A�H�K�;�4�ьw��
�JV��q��
<��d��������S2
�
+endstream
+endobj
+201 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100336+01'00')
+/ModDate (D:20111106100336+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+202 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+184 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [385.063 648.798 490.947 659.702]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
+>> endobj
+185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 626.945 322.585 635.792]
+/A << /S /GoTo /D (GFDL_GFDL) >>
+>> endobj
+186 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [231.464 595.308 337.877 606.212]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
+>> endobj
+187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [440.112 583.353 513.996 594.257]
+/A << /S /GoTo /D (GPL_GPL) >>
+>> endobj
+197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 573.455 169.87 582.302]
+/A << /S /GoTo /D (GPL_GPL) >>
+>> endobj
+188 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [204.862 457.687 398.138 467.585]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
+>> endobj
+190 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+195 0 obj <<
+/D [193 0 R /XYZ 89 770.89 null]
+>> endobj
+192 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im2 189 0 R /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+207 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+206 0 obj <<
+/Type /Page
+/Contents 207 0 R
+/Resources 205 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 177 0 R
+>> endobj
+208 0 obj <<
+/D [206 0 R /XYZ 89 770.89 null]
+>> endobj
+205 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+253 0 obj <<
+/Length 1349      
+/Filter /FlateDecode
+>>
+stream
+x��MW�6�����YD�[Vw-0�)�t�醙�c|&�Avf���ʶ
�	A8p�
Xő-_�G�
���������=	$��^zz�J���7�����Ά�g�A���G1���ũ(o�
;7
dڠ���
���;�_�71�=�
��Ess��3o����( ���I�I�L�YZ-��5����z���3����?
����
��.�~8U�v�Sx "Yy�
1���
K+��
[+Gg�K#G*V:�Y���Y4.�O���ӆ��
�
�m
��p�4�}�]�J����bn��Y����2
0!G����L3k�8���M�@"�X�GG��G�g��$^�
�d��f1d�մ�4�@���[��R>��F�kFb)�z&%�˃������4u
{��س���=�Ҭ�*������Pj at l��bX�m��
�Qং�d]�^v��x���o+�L��bJ?�ޤx�
��ٗ)cK�$�С���FY΢kKIO�����Y�vd�N>��W�E�O!�+�ޱڿR�oQ<m�!��I��1r�)���Nt	����
+�[���%�ę5���]��h��E��x 軞s�̙1_5�
�f5��^���w�9�M��0�]����0���a�]s}=����
�xlVٍ֑2?��\�<f4P7
��h��i6�L[�%z���U�N��I]*�wz0�a������ljWܥ
O8���)�ۦ�By�;�!5<����b旈��ZR1��ű#8^��K��.cbp�fj�"�Ap�Z����*ak�m��N	�S᫩��!޹h���XF�f:�����"%y�h����`��-���)�<a��T�e
���%�Rg
!h�0��|Y���

}�-�R츧k�󹥓h�ឬ!�N+*�;B����u�`��!#�}�O��5�g��
�Ϋ
b��h���
	枝 ^#t�*ԣß�Z��+�R�r:ĝ���9=��:���
�-�S�Pz�*
�(�
�5�
+��%���A��X�7�H6�l$
,voif���
X�d��6��d+�p�mF
,Ň
��&X$��p�Y��~b�����A������}�wv{�&�(�E^0p��n��o�0y��9�Z~�����}����k9(�U3O���l��
��d�x��{W	
/}�"a
(W�i�%�?�K�͒N���ĵ��(�������
+����6��������kz��ϩҿt����0^T�_ ���/N��
�ɻs���k�*)�~�?s����HR`�˪��*ˮ�ۻXLSO�8�/Ak�,�
U}/�*�y��/Ql�ŧFP�V�D�s\Q3�o:@$���Wԏ��UG۰w<'�Ab���?a���
+endstream
+endobj
+252 0 obj <<
+/Type /Page
+/Contents 253 0 R
+/Resources 251 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 177 0 R
+/Annots [ 209 0 R 210 0 R 211 0 R 212 0 R 213 0 R 214 0 R 215 0 R 216 0 R 217 0 R 218 0 R 219 0 R 220 0 R 221 0 R 222 0 R 223 0 R 224 0 R 225 0 R 226 0 R 227 0 R 228 0 R 229 0 R 230 0 R 231 0 R 232 0 R 233 0 R 234 0 R 235 0 R 236 0 R 237 0 R 238 0 R 239 0 R 240 0 R 241 0 R 242 0 R 243 0 R 244 0 R 245 0 R 246 0 R 247 0 R 248 0 R 249 0 R 250 0 R ]
+>> endobj
+209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 686.174 151.499 697.053]
+/A << /S /GoTo /D (section.1) >>
+>> endobj
+210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 666.159 229.087 675.135]
+/A << /S /GoTo /D (section.2) >>
+>> endobj
+211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 644.241 252.131 653.217]
+/A << /S /GoTo /D (section.3) >>
+>> endobj
+212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 622.323 165.446 631.299]
+/A << /S /GoTo /D (section.4) >>
+>> endobj
+213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 610.388 173.686 619.235]
+/A << /S /GoTo /D (subsection.4.1) >>
+>> endobj
+214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 588.45 155.484 597.426]
+/A << /S /GoTo /D (section.5) >>
+>> endobj
+215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 576.515 178.398 585.362]
+/A << /S /GoTo /D (subsection.5.1) >>
+>> endobj
+216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 554.577 206.393 563.553]
+/A << /S /GoTo /D (section.6) >>
+>> endobj
+217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 540.585 225.023 551.489]
+/A << /S /GoTo /D (subsection.6.1) >>
+>> endobj
+218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 528.629 289.071 539.533]
+/A << /S /GoTo /D (subsection.6.2) >>
+>> endobj
+219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 516.674 209.93 527.578]
+/A << /S /GoTo /D (subsection.6.3) >>
+>> endobj
+220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 504.719 199.409 515.623]
+/A << /S /GoTo /D (subsection.6.4) >>
+>> endobj
+221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 492.764 211.803 503.668]
+/A << /S /GoTo /D (subsection.6.5) >>
+>> endobj
+222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 480.809 211.025 491.713]
+/A << /S /GoTo /D (subsection.6.6) >>
+>> endobj
+223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 460.928 196.43 469.905]
+/A << /S /GoTo /D (section.7) >>
+>> endobj
+224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 446.936 438.46 457.84]
+/A << /S /GoTo /D (subsection.7.1) >>
+>> endobj
+225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 434.981 335.537 445.885]
+/A << /S /GoTo /D (subsection.7.2) >>
+>> endobj
+226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 423.025 298.367 433.929]
+/A << /S /GoTo /D (subsection.7.3) >>
+>> endobj
+227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 411.07 396.568 421.974]
+/A << /S /GoTo /D (subsection.7.4) >>
+>> endobj
+228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 399.115 336.803 410.019]
+/A << /S /GoTo /D (subsection.7.5) >>
+>> endobj
+229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 387.16 302.482 398.064]
+/A << /S /GoTo /D (subsection.7.6) >>
+>> endobj
+230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 375.205 389.942 386.109]
+/A << /S /GoTo /D (subsection.7.7) >>
+>> endobj
+231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 363.25 330.177 374.154]
+/A << /S /GoTo /D (subsection.7.8) >>
+>> endobj
+232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 351.294 295.856 362.198]
+/A << /S /GoTo /D (subsection.7.9) >>
+>> endobj
+233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 339.339 388.259 350.243]
+/A << /S /GoTo /D (subsection.7.10) >>
+>> endobj
+234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 327.384 328.494 338.288]
+/A << /S /GoTo /D (subsection.7.11) >>
+>> endobj
+235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 315.429 294.173 326.333]
+/A << /S /GoTo /D (subsection.7.12) >>
+>> endobj
+236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 303.474 411.501 314.378]
+/A << /S /GoTo /D (subsection.7.13) >>
+>> endobj
+237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 291.519 351.736 302.423]
+/A << /S /GoTo /D (subsection.7.14) >>
+>> endobj
+238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 279.563 317.415 290.467]
+/A << /S /GoTo /D (subsection.7.15) >>
+>> endobj
+239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 267.608 329.6 278.512]
+/A << /S /GoTo /D (subsection.7.16) >>
+>> endobj
+240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 255.653 310.8 266.557]
+/A << /S /GoTo /D (subsection.7.17) >>
+>> endobj
+241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 243.698 335.697 254.602]
+/A << /S /GoTo /D (subsection.7.18) >>
+>> endobj
+242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 231.743 307.483 242.647]
+/A << /S /GoTo /D (subsection.7.19) >>
+>> endobj
+243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 219.788 334.053 230.692]
+/A << /S /GoTo /D (subsection.7.20) >>
+>> endobj
+244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 207.832 318.183 218.736]
+/A << /S /GoTo /D (subsection.7.21) >>
+>> endobj
+245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 195.877 450.017 206.781]
+/A << /S /GoTo /D (subsection.7.22) >>
+>> endobj
+246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 183.922 424.004 194.826]
+/A << /S /GoTo /D (subsection.7.23) >>
+>> endobj
+247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 171.967 390.252 182.871]
+/A << /S /GoTo /D (subsection.7.24) >>
+>> endobj
+248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 160.012 300.28 170.916]
+/A << /S /GoTo /D (subsection.7.25) >>
+>> endobj
+249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 127.654 120.226 138.027]
+/A << /S /GoTo /D (table.18) >>
+>> endobj
+250 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+254 0 obj <<
+/D [252 0 R /XYZ 89 770.89 null]
+>> endobj
+251 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+257 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+256 0 obj <<
+/Type /Page
+/Contents 257 0 R
+/Resources 255 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 177 0 R
+>> endobj
+258 0 obj <<
+/D [256 0 R /XYZ 89 770.89 null]
+>> endobj
+255 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+264 0 obj <<
+/Length 3730      
+/Filter /FlateDecode
+>>
+stream
+xڵk�۶����I��E��i��u2�Ǝk_�%�xp$1�@������_�K���.���bߐ�:���7���~����_�^��������U�^���~��:�l��_�Ѕ�ѫM���l~��v��9�%� |�����G��U���^��v�G?��� �v�{*�V��t^E��g�z��?�|!�����B�hD����Q�^�=�������Fk�I���6[���O�N�l��m�z��y��e	Kjݞ
����J]붨l�S֘����PՌ�5�=N>U�W������o�8^7���g
+ۚ�@�	��~�_js���i�lsw����1����ղ���8�M�u]�����阀� ��X����
1���f�Y
쪲4��ːB~2308�75����$���#iI�Ei���r)��#N�
^)��m�����OE3� ��ݞ��I����i��u��?oQ�U�NފV��n��|sE"ن~�P#ǎ�چI�&4=�Ǯ:_���
�jz&�[C��C ?���z���5��$_7��+��𳰻��ē�aj_�p0�
�\	�C�y�Tg39lᩒ�t���� Zx����[�:�a�3��4FS��' ;��^'��hi���� K����p��&`��U����j�e�h���7�I-�%�	a_�]��V-c:U!�%�e����y�N�?(d�΢���ϡH�Љ�|�F�yY�����k{S	u'�{�۷'�������RXe�eqS��(
{K*l�j��=��
Ai��,<�o
3 3�8kY�ī����!T���߉&��
�H/U��B�����/����u]9b/5�
%��Ѱ�c1����TL���s�*��uq<�
����$�`�
I!I d��YɒfWYԐcW��v�1!T�
+�\����[��ۓ�g����>�/���؂s<��/� q�.8Pt�*���ܩ���F�o�l�Gp���-�%��B�,dj��a>h#L���.<��(��^l0@���0E�.�MB#�����'B�}�%���'�.�x
;<dW-������u�|�0pBs�"�Nĥи1�ƨ�H�*��R��B�R��$*l�+kx�L������j��;��%I���j�q@����$�� z4��Kˆ��I i�
�Qsa;�au�g�fY���c�U�Yb#Sĩ	
�e,�h� X9
�Z�6��v��Rt9�4���Ӹ���vg�)%OsWvF�q��ċ�Y�2����S�Ō�8��|��������O?�tG����\��ox�
ư,���l�'g��i�Y�T�s�
��1r�Y<&?
@��A���Ό�cG��sә���y
CH8$��ƚ�؁����"=k�M�_����5���̩@�e
ЇV��j�i�m��Puu�}�+
c�M�F����`���0�}�-�
fb��4�i ;������)
+
U�g�
+�CM
�_�1ܕ7��k״
d
+Sjx���M����
T[QT�x)�BV*�aG�.����.z��9S
Q^�L���z	r�bϠ!�Ʒ��ť+�D(�.���
��
 FM[w��9
+.�3�q�r��
+�|4�
]���P͂>3�q�Spj&��&9 ��X��*�0�E�^�$M���Qfȅ(�42'9
�'m�-�P�K�3.�z �#5ܼ ��
+E��Eȼ>&�&պ�mΊ����;���2eX��*�ؿ�����'e�7�&�	�L
�c�{9'`��UJs�e�.WP�y���t��*5jF�0
��V�c�
��+�ky��M���c��X~��>7�����i���ECa�t�o�˩���E��`���{o��X_��e�`ꚽ
��<5?>���� T7��/�"ڂ,
UP�"}����XN�N+	�.C��7W$gk-�)�9�g�Fa.=��@��VD1����W�޾�+���K
f��
)�mA����T�
+�k~H�A�^G�3����c�uS�5�3�

���74!
+�x�O�w�
/p�z'LbVb��ץ�
����(� �΍�1g��d�1�Hld���$�
+
��ˎ��z
/|�`G��8����a�㔡��L�����Y��~h�^rdȍS��I��c��7Lu��g�8CD����@��F[�����2j���8�
]��
�Y�����V#3ΒW��ɥX��)FSy�>\HH��<��`����.�ɱ����.��򀅑�� ��hT%�3�� ;����}<
+߼<�,���x3�"����j�R7JMxY���
h�r�p������
�pa09�Ca:���`���[��Tqz���q�G l%�*'׫��<��t�|Н�~UK~|��,g�Et��g�pz
��Fgۢ���E��l��;�\8�ݲO�7ʟ

+�2P`�Y4���Zd�j*5�L���仆���4p
D<kΩd��X��
�Q��n������E[7�!��R�>=�>
�y��n/34z를�m1[TA0�r�4"�����8sD ��ܩٶ�YP�m���q�[I��kWW2�͆��~s��˷/�~����K�O��^"�yc���?^� g��
�|����c�w�(�q
5�i6E���v��h�N/{k��+��r�p.��ݥ��P��G�EWX0�����hx!�;6#����y,B	 #�r% �=��{�uo�_�߮4�þw�
��K~����l<l��G2�?~��?��,���0�[B���
�B瀣�h�/��;T�n�wP��k4��31#
�Fq�wCϦ*6f�QASOܒ��V`�<
]c��yN �5��_t����u)Ӆ��J��ע�����k�s�%C�@
�����-(�ap��
+������:>a��)oD ��72}����GC�
�%T�
@��l\}.\fE�mR�S�(o]e#n؁,��r/˲�g�O��v�r3?��
+�/�Y�aKI����6*
+�mX(��di}r�
IF�%CV��
J�,���/c�Ofμ7��7���Ɓز�H�F��!��֙I�(]`h��R�8����P�Ֆ�4��R�w܌�צ���ʶ�p����;B0{�!��4jM�|�m���Qa
�&��hk͒bA�����:V
q��j~8�p�	� B���
������ߐ�팫T�k6$�1^�����\U�/7��])�����Eޡr�hY�2y�O�Jgڟ�(>�����}�m��f�X1���@\	"::�qF�BAsȋ��1�i�X�U*
�� ��6����'��џ�b�	� �܋�^�#��Gp��(��
M�Y�EeP�%�AK���~p�XAXT�}���ǥ
��o:����ƻ�ZT����l
+�
�O)x���7�4s�r_�^�c�R�{˗��)��?���,��&�����w�r
+��re
+��xA�X�A����c[>�]��u,�h��-�'ce�E�2���
ă�,N�ɒK��x��P9$�E|T9��S���}S�^;�d��&��Ź�* �Hu0j�N
+�i�?��bzi�>����D`y�`�(�b����e�3~|���G����+�����B�N����,����
.���Ho��q`߭����&ȣ�
��m/_<yr�
�%��~�=|����[a*��o����su2�1-KB'5�{�
� MC��i�}(�'Wg��W�1�s�vy-�
+endstream
+endobj
+263 0 obj <<
+/Type /Page
+/Contents 264 0 R
+/Resources 262 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 268 0 R
+/Annots [ 261 0 R ]
+>> endobj
+261 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2 0 obj <<
+/D [263 0 R /XYZ 90 721.073 null]
+>> endobj
+266 0 obj <<
+/D [263 0 R /XYZ 90 697.183 null]
+>> endobj
+262 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F24 173 0 R /F85 267 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+274 0 obj <<
+/Length 3406      
+/Filter /FlateDecode
+>>
+stream
+xڍZ[sܶ~��طhglY�K�S�69i�$g�̙�sF+qw9�ĭ.u�� @J+�i�D�$����9l��۫��nߤ�&w�$H6��M�m�(w�j��7'�����&L2����w�?����ۮ~|���ʇ&o����M�M�\���������s�<�<�N�&
+B�֛���\y,��K����S�7�����$á,�7��9��ԩCW4�"�M}:��/gS<4�/_f���M2_���	7Hc���~
�����R�TJ�Dk�@����9��|
��w$�Q��^
T:����R5'Y��g� :�bfb����m%ۃa&�C-w]�I#��Qt�"y������$ʡw�7�8�
��S��Z�V
[�ǼZ^e��pc]Qq'̷,ƞ+�
*�U��3�e����+�~(ꚉG
F����/
#xb92}
�����~mUtܱVe1H����y�N��,�.�Aou9e���,����J�В@�^PFӛ���w�d10A�P�������؏��3��djA
������kd��
��yڶBcK`s�
�Y���Eg`-�G�����Z�f~|�E��`���z�_����f�0HSO�p$z/j0.X154�<��4�8��;؋�
�3�>�3��j�NO��*�F�C1�C�61���|�o�W�,ź
kW�VR
:?�E[7|w��sFY�>��[�ea�Q�7����Bk���^bur/w�R5�&�Z(1��tR"���(Z�
L��%�ʂ
콵�,(�'4�0�ҬTQ{/�D� C}��^60��<m�V�n,\��`&L���C�F�<AD^���zC�֛n�z#쉝ǣ���2�lc[���ю_�H[�rA,j
9PG�,z��
�� &[��1F�����
�V�&�]�/y8�P�9�B��l�zd\R�[P^sE{�5�%��:�Eʮ�r�P���N:���
��VM\|��Fn2�G� ��������
?|͈� v� 7�\6�ȃ� �B�&ADmo�l���)�p&�;���y6�=q���^����ǶdHE:�9�%��!ew^����l��O("
+#BIl,:��{�u���^�S�N�7�JP�������٦J4���t�>���]��<s�i_u�K<`<��+�
���~�$���w����T��b,����pq⦹o&�E~� <`����` ���3�
+�� @�� �i��q��C�M�8�X"D��M�ld�p�=���I�-U�>��s�R�
�UW���]q+zK0��4�w��8
�w���}��$-��\A�Q��|{��篹P���,�{��y����R7��H:�U����`)q]"��r@��K���K����E���(,��lPf�3�
��@�O�V�1.?��,B�	�$��99#{|��=�.1sފVtEM���n
@.K��CHo{�=��
�!������zi=d�
r��4��)��ZGF�b
w�6|���8PW��
[��Ko:��
�~�AL#�nӰqL��][��lN�Y�;��pz}{������_ە3��d8+�y���v�5�l�)}�	�u�D%��
�Ĭw�ֆ��`
+�Ъ#22>�kV-1��ӂ����e���@!5�sL��D+L$��uM�DT/ۨ
hm4t��7QQ�6�4=��F=
Y�d�X��
0m��سv}�{Xۊ��Z�㡳��T�mK�#UAA�p/H�*�J��&���
?��
JB3kO5�
+�*- 
+	 #@ �@~�����y�Z	�Z���|
:sg�6��L>F�|���j.���k�dHP��LP���O��p�|��Y��G�
���Y�X����U=�'��|�"f&-�}>{|c�A�.�3��
+W���Y����l�B$��۞Ϩ@���
�r �=ü�t�S�4;'P:�p��=!$v��lӦ�sq��� Nu��:���v���S^�g
�X�bݶ�0�9���V�.�a�(�VyX��(f�$��1~����.��/ �AUr_}��0VԽ���p�%�����O�kQL�����Q���/�4�
���{��� �ˑ��(��ځ���]�r�k�A��ʧ�N�R�g��e�D�H��Rk6@��!r�|;�
	�P�NQ"eb&�(<��4�:�#�7
�Z�t���c����~����@+���x�(���`;]ID|��±��G�H�	T�hh3��b0�lčx#���3�
+f5|�
�⎧'��ŠU��M�on�@+�?b��۝�+�y8:	�qٮ��@�RU\��@�-
+�ܤ�>�_/��ݴ
�
���D(󝤿�(f{F�a�K���KL�
_,p�_u�Y�؜S0~�j����E+�Gah/w�T=BC� ��Q
Yw���$cW��
h̖�G�I�-s��Sy�i�R%��Qcc�q4	m�e6,J�^��_uB��p5��0[�-�2Lm 2��0
� z]�!RJ��!�����R�d-�kH�{�Z.K��|�9��x�n�qa�}ɂ���U�U��9>�=���ןX��^�m�PffŤFw�d/u0/�]��
>'���]��8Y
��!�#B
+�,�D)��.rMK{:
+��A��,
+���p]�X��iF��B�T�=���V�\���PC��-e*f��鋆{�^�Dg_Ό�i��~����z���}�py&�\p
@�#^�J���Q/�(�K�
+�"tĊ`��/�@<��4\s��A.
L,>9ΑKǓgH��L0Y��\��IN:�_�`�3`�Չ IGV
+���ٵ�6�

(o�A��1�
:B����$>h>���~��5�i1���
҈
�[�Y.�`$]K[��I�J0��'
+��
+p+؃�I�v����0z a�����2�[!h��A?]�x��l����O���
`/AlU��Dɤ��h8
�
h%�¶�ܱ'&�}E5V'��D�L����)!���B޾��|��lbCrP.��Q.�7`���� nj8�J��#	�g�kۥ
�i�@�)mo^NǤWT棬7_���D����r�@����
e�qس���Z+��"���=�K0�,:����^U��k\f:3�%�ja�oh1�2<;cE�̰��$�Z��ޜX�)���2ę�E� ��׹�
T��l��?|��l�=�|
�&2όI8���s8{1��B|w�
v��B;Ѓ"�������Ė���
���1Ii
�6
��!B���yu��Խ����#�#�}no��x$�/��=\��
Q
�o�OؚO!���R����і��?�$�����2�n��?X���\�O�@7�˺ьa��&���������L
�o-	���i���I/���
+w
��`cq�ry��E�_��Q]���
�c���
}���0���
�?�.�d�#7��ō�n<�=�%�Y]ާN����� �����՜�ںKE�
�	�

+endstream
+endobj
+273 0 obj <<
+/Type /Page
+/Contents 274 0 R
+/Resources 272 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 268 0 R
+/Annots [ 259 0 R 260 0 R 269 0 R 270 0 R 271 0 R ]
+>> endobj
+259 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [197.068 637.862 240.904 648.766]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/software/libtool/)>>
+>> endobj
+260 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [103.669 602.619 231.19 612.9]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.dwheeler.com/program-library/)>>
+>> endobj
+269 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [361.468 560.462 387.371 571.365]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/software/glpk/)>>
+>> endobj
+270 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [297.062 464.4 388.718 475.304]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://fsf.org/)>>
+>> endobj
+271 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6 0 obj <<
+/D [273 0 R /XYZ 90 534.558 null]
+>> endobj
+275 0 obj <<
+/D [273 0 R /XYZ 90 502.537 null]
+>> endobj
+204 0 obj <<
+/D [273 0 R /XYZ 90 502.537 null]
+>> endobj
+276 0 obj <<
+/D [273 0 R /XYZ 90 397.689 null]
+>> endobj
+272 0 obj <<
+/Font << /F70 196 0 R /F72 198 0 R /F60 176 0 R /F85 267 0 R /F84 265 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+280 0 obj <<
+/Length 3142      
+/Filter /FlateDecode
+>>
+stream
+xڍɖ�6��_�[��u�\�Es�؎�3�f�s�s�HHB�-\��|���T3
_�@(j�R����߼����͋�S���0�<
7{����8�Y���
o�����~�U�֝*y�y<�&��{���0ɲ]�E��?�r����ϛ ��7���i�ɫ��~�7����h�m�hS�م|���Ϳo�9��5�A�
&r�u��W�"��i]4O����Y�'-��
��8<���:������{tk�~Е�u0o�0��Is�Mc~�:܆>�!�|�z
���Z�M-�]S���#�����}
�ӎM��
�)�m{�L1����>X�����t6D��Mm�s����৳��x��yU���Vy��A
J�M o:
丛4>+|��� �m�{s�u���lV_�'��4ġLر��ʼ���
�a 0�lD�|_۩
$��
�pnz�Y����;��
+�0�K��g�3�d?
�AՃQ%1VY�{������)S�ȧH�&
�A��
A�
C�i!���נyK�\� 
׾���}!��N��w
��d�z3���U�7a
��;)�R�-�
�o�@$��u���0&LF�'��J�Y�M�
#�����$��P�B`�D2p*���NU<A��w8/�k�l8��u(��%�A�m]��1��)�� S�ٟ��|u3� �k��'�+���fM
:��A�D>�g���i+8�
�8 ��~�hƕ��'v���ص�=�7U;��B���"�%�-�f'���,m�
y��'ӟe������Oc
+>J��0��
��v;^�� :1��mK�-�F�<E5b�$| �"V�+rHv�@��G�K3��šj;�Ց� }����Xp���i�!��+=�+�����3��8�UM���vR�!����oq��NꦾG6-�JH��PD���
+�HHN�e߀�tv�E_L}���Z��]�
S������
�8��������݆߳�
b���D�m����?
�%e�ˏ�y������
�}����$YX�;�
�6�mw���-F��{���߿]`��;�y�;��a�Ȏzʀ ���;�_Jt� -��M?�q�zT�안�3���TEI��G+K"��
+��|���4Ϊ`[���'�)f���r/���@
	�9B
��̚�+y�} �P�|�וAU�Xݬ��J�_�U]gY ����&"��f��E|U���0��=�d���񂏌b���� FN(�>#c:*h�-�^�(
+��4 at N�<wiF|b�"w�~R9g���F��9ӆJ]�N�y^��عo�y�[�����
�Z��}އ V����"�L�g�N����p��V
<;v�C�����
+���,�k��N�Ș+�ó{)=��:R���l� �����-i"�X��PM�&�.r�X3�J��f��Y��D)|�&N%T0u��@�
C��Z3���4{"�H
p�T
�`��x��٥�W�1m+�uJ��(�������E���\�s7Ν�*�U�9!�9O�X����D��#���=�
�ӝ��m�+����E��Q�� �$
+9+��W��:��$��	���ƒy/�J�'莡���f�B�#�PI����
v�o��
8
̾W4��DpN
]<�X��A�1�pq�hw���&�%S�m�oq���|:�4QIԲ5�̶�U-��9�K>�!��r
%�x�����}Y�y�����
kK�BC�'�,;�B��$trE���y9T�D��d,J֒1<�ŏ}5�,u3�fWi
���<�H�9�M)!r��L�)�(wWɈ=�M�mj9�@�M����M�!%��J�O�,�oCP�;�ow�1�� ��d���D��$?�R�c&�`�̨[��UV\NeP$ s�͈��'c�P:�#_D�o���t�E�>
߮)�n��AG����
�<��Vb]3���N͹�Ѓ���5��ʽ�
�	�Ǫe� fH����j�+A�ʭ;{|�O����mv
G�\�V�R]�z�lQEPc^�\�e��DI�d���K6��cVy�vN�Y�f�
JFԬ��2B/�1S[��لv�v��5w7�8����!xN���G��ܑ/оy:cl��#&:cB�̡�ޚ�@B�-M�'�Xg/ó�bn�T���Dj�D�]. [...]
+]��9!�ɾ
Ĝ{�����ʎ.r
�pA�
 J	pg�)R9�^�n��h��@�y�
KGI�g_�A�GƽS�A�{mi1u�{���&�������A�*E��i��/"��Y`P6��ǻę���AWː�"�(X��O�
����
�
�E� 
+�)v3𑁴
��CQ����0
+������z@��<d�`�-���.j  �,8���AKU2�Ό��w�g;���M.[��	�����@�Z���� �ZH�W��t��c����`�
�tO=`�^uC���[�I]��;ȋ���R��đ�5ହ:�P���E�S��
"
+nQ�o*��	 ]hNP��b:{��� ��C�
��EeN��$eÈl|�A�zK��򭂒Z��p +F��Q����t2+V ��>��-Q���ƈ��}�^fL]TU56w�j����U	��N>��m-M�I'w��~�
y��
:�ɭ���[�%��wYHB
�y��+ ��P_�
+������A6{޻��VQ���g����sSjA#��s
�(����SW�`zL��P� ���  �UF��iU�U��ZJ9'�����):Ǫm�qq� ����f��N�W��k �� ٻ$6;�+z3�-Lm��ĉ��8)D
ݱ
�����˪TB���W�7�T|Qj�M��ǩ˫���
߲�K���핦jK)��Z{�̭e�ҭqÇ���Ȯ1�Lض�k2%��a�%.��Wk��� �0縳�ܽ���~W�'��qE�D�����$r��G����_A�ݧQ&�W�K�1�_�~�����JZ��xv�J �
+Z��-�����
m���� �6�𛡚I��Aky+?��Ǝ��������m���Dd����Nj��Y�i
����b:��[?	�Y��O�L%%��侵��ay��6IB�5`����A
+�����A�xWE��
c�w��Q�L}
+endstream
+endobj
+279 0 obj <<
+/Type /Page
+/Contents 280 0 R
+/Resources 278 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 268 0 R
+/Annots [ 277 0 R ]
+>> endobj
+277 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+281 0 obj <<
+/D [279 0 R /XYZ 90 550.374 null]
+>> endobj
+282 0 obj <<
+/D [279 0 R /XYZ 90 525.951 null]
+>> endobj
+283 0 obj <<
+/D [279 0 R /XYZ 90 201.906 null]
+>> endobj
+278 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+287 0 obj <<
+/Length 3183      
+/Filter /FlateDecode
+>>
+stream
+xڕZK��6�ϯ�-TUF&>��)q⬓Yǻ���V�EBb�L�����Ei8.�2@��ք��*\�|���͋WY��mv�JW���.\e�n���+W����_V:�n�]
+k���7�?���c7?��|��`(\E�<�d�UQ���g�*���*���v�@��U�4|�ջ�ބ��'��Mɞmݵ�i��J�߮o�ҁm�n��d
����:J��
2�6�:
+`bȜ�?u�W�s�8�m^y&�w߇I�a
���S	�۔�Z%�Or�n05
� oJ����h� �H�i����풄�7���V)`ԙ¾CUp��L��9�0��fL���#oC��>�lq��K��b
�}%��e�`���8���:@A�.<�����L)�����

s�u��~/�!	y�����b�vі�[��w��L���E{�N-s�ʹo�I��{OBл �H�l��8Pv��v�
�F���
9f2�
Z ~��B[��kkn�6`~*�V�G[^/n�)�r8����4h
��%���
�
G���V���%�V�x�d8��N�f�<q���Wl�qqX��tV��mi�WkgZ�Cڦ�F�=NsEo��M|.�޷$A���u��y1Xt�Ov��m��t�w�PCt�~
 ���@xi�T���B�s��4��Y'	����q��}����l���֪�n���C�Vn�
�R��B�	��
+�p��V�0�u荴��}^;�.n�yo��΂��A�`���I ���Ut1�1O��Ɓ'�
W��,C��{j)
�Da)C�Ku���+�I��l�
�8˂k�I�;A[�|���~BiP
+
\�f���ʯȝk


W.�0;`hC�\�gpXQ*���<�)�~3��\�p ���;�8eM�-�WN���&�m���Na2����^�K}6�Q=;	R:
�qȜo�Y���`
�m�
��e����h{T����G�NЄ���#�AG��m
2gB�9O��S�
\����$���D8��ܼ���
��$�#4�"�T$��!H�A��a2�ć�$��<�ij��7�2X$y��QDQ���+ؘ�v$���Ց�
+���{�͂=4zr�7xE>-���N;�m�-���>w�k/_�3)�s˸}�@���=��V����^���as�.��Tvn� G��3��m<��p�l�P�
�')��YAjo�*�
S[��>��|{n���7�
3�� A
+ڲ�	�`��@�
+��)�S%`[w�0
�/t8�^��D��d`jL*��Eۡ
isj�V�e�����83�Ԃ"9�B>ho3��̔RZ�'� '��F��|��
}����0;$;0%+�3ad�'��v����x@�U=y8L{�����lme����Q��.EI��;-�ߩ���C"88n�3�| ��Ѝ/b�C*0l���3�`Q1za��"k��Z��)�⠘
PΒڡ�9l�ϼKt$'&d�Ğ!U��vDDO��τ��0��`^Ο�g՗�?�Q��(�u�S#��C��2�ѳuBk�#<������̀X�
��
+���Ĵ��+�Z"�
s¥5�dN��ҳ�T�8�a
^��'���P#c0��3>V9}c�dɠ<�
+ꆙp�.?��
�O%�Ӽ�
��\�Ie�I?�F�̌(���� ���Qx��W:aU����(�?b�i�0E��
����n���-��W5�"L2�I������t�t~�_�G��.�e�Q
3淔��
�V��ɲX�'�E��G���'���!��vD�f>Hi
�l�ԉ�3~N��[)X�0�Q,-ghl+���,���Q��5'����s����X�	���
+C�L
��s�r�$g�1+�s\�c�X/��*L��74a�T���(q��@SΧ�'�ʏ�$��I�3�y
d
+���L4�����A=���t� � H��X�\X*v+�##�
���l��Z��	�Q���Jh{ڛS^
H��	���lF	0���t,ę�,�Ór��2(�����N/lhI��gң
ĭ�/ȟ�Ch�����	3]��=�
L���p+Y�7=C��v�%�p��-�ޗ�X%��
S�t��<Ȳ�}1ր����	'~�0\�*�xT=>a,��W�	s���T�t�
y�'���r��x	��/��%��;Aޓa@'
+��9�9_���^������)[~D����TBpo_F�7<� ]��ߙ#i
����گxiͽ��޾�DU|š�/�����a�U�E�_��oZƱO�Q2/5b�����7�-���d���d˙(���!�{0�|��GC �S�V�߂L�M��^��z���N�t���
+}�j��0VT�8wda���HV��i�
Q>�L�q�Q$k��
��_���[W �f�&
�]�vd�Ȏ�@T!
��~�h�K�0�E��x��P���;�@�X�7�S�pCo�� ��`�7�75WF�/Xn'�~2�$�j��:�~��j	�\�cu2�z~i/Z͌ �T\Z at MV<܉��<�ѓ�ܴ�����q
+��\�
+�P�<'ť�"�PR�@��`_��E�b�$h���I(f�'�,��:)3��7FNQ��b�vxF&ٔ
22���Ke7� �/љ/��
����r[?љ�
+�L�~Cz�2��iRL��
�R�츳��v�� ��9�
+�i̓|�����U�
+�T��"�}�B�"Ⱥ�Km_�+� ��ޥ
#��H��l���Q�ܯz����WU>�%�!� �~2�q
���t~��AA��^��tt~B�D�
+K��b�~K�)�
�	G4_DJ�"Ҥ6 ��wj*�)yY{ �`�0����Z*�3K�ÛҎ�̸x�,V9y�H�T.:[���K����?xn��� ��Y!Fr'�0(P�ɋ���IJ�7O��낁��L �|�U
J��!p��*��\)ĉ�v�A��Y8N�ӟZV&L
;
W�	w İ��ձ�쀌����{ؤ�:����&ON<�G���df�����^��A�6��_�?��q�Iv��	���(�
��4�����Z�~l�ٙ�-�=3����nv�ޢsE���ozY�~��N����˛�e���/U at B�zv�0�Gތ>��o��7Qכ-���@
x�3F��w�0]�W�?5?�.ޤ�����i���x���4�
<؟F���,ۄi��Ne�����>O�ds���?�b
+endstream
+endobj
+286 0 obj <<
+/Type /Page
+/Contents 287 0 R
+/Resources 285 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 268 0 R
+/Annots [ 284 0 R ]
+>> endobj
+284 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+288 0 obj <<
+/D [286 0 R /XYZ 90 495.818 null]
+>> endobj
+289 0 obj <<
+/D [286 0 R /XYZ 90 266.607 null]
+>> endobj
+290 0 obj <<
+/D [286 0 R /XYZ 90 116.859 null]
+>> endobj
+285 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+294 0 obj <<
+/Length 3018      
+/Filter /FlateDecode
+>>
+stream
+xڭZY���~�_���U���~r�X%GV)�u�R�@`�D j�ﯧ{�be%�
1���t7���yu����?&�&�e�o�6��I�l�x+7
{�G����/�P���_�]�uUp�MU��WxI�0u���?�����󍇣܍�[G�$�������?m�]���G=�	� �z���7���򖞷�<���n�/v���Fі�{4�����\G�3T͐���F��|�/��b�|߫�P�Ѽ�z�s�G:"ﺼ�rjޔ<v��~�|��jql���\�f��ss�3�w]^�ꉥ`�
(Ϣ�I��u�
��X
GniB�����姝�&��~���{������8�_�9�1�^�
X����U��
�o�'C<;*/�����ה������m��k��O�#���Ϭ�M��jf��Jn�_���W�
k�PQ�s��*\As��O̕w�4oܝ����4
'
+�Mo�x	o��.|�%v
|��k�����mY}t]_�����tD��!��E� UX��b�\@�ca8�wP�'��Y2��Xa��'*Ä��v��s���jhj���Z��hխ
w�ᓐV���^F[>�./�̬~>t��gT�+�XvbQ��г;
1�
ܺ4��&2���/O�!��'.N<�R��/z
��h�Zjk�[n��L_=�
G��jMYi.}7��Ƌwa�j�f��Gߏ�>�E.��F
�wo���.s��2��j	:U
|�Z��90 at vƯ��y�j/ޫA�Ė��8A���R�j��?�9��5Wp-�t��@��iҔi�lB;u3��ک9��^�h��vaکU��L#J�F�W4���tt�4��z�C%=Nwa��uyT	�&�d��|���
U�	\M��@�sO�>_�N�X��o&X�1��鳩-O�O1^!���{4!w���d�
��3l����I6us��q��#,1v�^:��h)m�8y�Sr~<
�Zɐa�ީ�yof�����6������d!�"�綿{��z�����c��gn6�8��HRw#u̙��Ќgt
+.R����S�^�D�N�����|_��j�%�9%k-p�Bh'�]D�
��c�7����c�LRQf�Kb�*�Y��8���G�Pj��a
ӕ5�9�
���y
�Ri�N��O�A�`rx��0L^�r
+�hv�0:��p����!��%"bʨ��!
��nm�x�b�KK���έT��o}ĻA�<�l�{
vg�	�
�9b��_4t�
���{�������r8�l�q}51�PN��'�B)^�Ϝ�
������>jc�	R@)�f`�f\z�U3�A�����&�В��ϵ�Y����4̬��Qk��]���cl�Q��H&��E�J��IW,�Nj+R�*�v��e��q�˖{��P�G/3�h��8�"ā]�O��q���
+o�QVL�9G��ᕭAx��h��&s���E�\﹪sqV�x��g�K��1��z3
l]"�s
=�ѲY#++��������<]U�n�h�`���_y;
S�9M>\�UW���� ��H!|I�(�F�
�ht�Q�$XB���3�N6`
@�^2S5Om�<�ނz�����ΥN2��I/;�>���#o��z

���<M[_N�e�t��~h��`�:�6]%��⛓*�
%��;� �A�@���O~8L̠���a�����kdC�[+w����	�J���q�.V
�ܸp��JH���N�
�Uh]Qp L%e�ys�D��B��ឃ���� d�ل��l����M:i��!��#9�5d�NL��
�]�?�Oёh ؓE�릨/
Mi��&>WTV,{��9PV�K��(�L�Hzq�eT��7�^��]#����v���BA@�I�(`zq���,��%⯗%޶�ݲ�#L��? :q�!���6����S�`�3g
��hE������^��{��
+��A�a
�L���l�/�!?�Bшt���?m�	1Z�z�$�� ���\���ޥ0W�Ύdqdz���T^2֦�m�p��P��z/�
j��s���4c��1�����޲�j@��Zt�.P�W����^#~�V��b�@�Q�Yd$�V�hW��W���
	.;��
�
b�|��\{�05O�"�l�۸9�0u=��I�x�q8!2o%��1��
�̨g��3�1r�a���p
:�\��ky�$?���ޘ������=!���ՠk��ĕiA�o���G�`�8��A�	��7*�?��SG��JxF�
�S���a�
�zS�🪄����?V�xM%(힩<��:����j ��U �r�� 'Or6��2�B��A婁��c�$w���C�����䛝<���c,��g�ެ;��Մ�HP�T�Y��i��~@?���?�^�o��'_]&_.�"��R���ڞj,�7��O�Y+�� �9��H
�"5�Ds�̘��S�p��vCg�i�Z�׮\_ e���#��Ԇ�����<ĮP����Dy�> ��;>�
<F����q���w0h����V��f4��݋\�N��w�Jt��z������b-��}ۘ�y�~�V�f�B_���?lL70��/���d��Ob��hI�|Q%2M�kx�5_��M�R��.hG�Z�z|���� xS��y��k?~��G�V�͒g�}�$
�������Uf
+fh�a!�a!1�;Z��|ˤ"���.���Q��2ɮ�d
+gwH��cX]�3ѤF4TbV���弆�#��{4�g-�5u����mX5!Ȣ�{]�5=��1�i�
xܢң���H�N�A*��}�ʷ^��#�����T�#���#��2��+�}����t���?#��.�o�3��B���[�B��L�)���ݻ7b��8�
�
��zZp�_`g6s���ys1� _ 6�[꼝w�TJ���z�{��V&��ƴ�A���'���p�	���p��ŋ��Ы氃R<M���I�scϬ�PPܪ9C]
ؙ���#@���7\�?#]u���Ӷ
4
����S��[
a��
�
�;6�
+endstream
+endobj
+293 0 obj <<
+/Type /Page
+/Contents 294 0 R
+/Resources 292 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 268 0 R
+/Annots [ 291 0 R ]
+>> endobj
+291 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+295 0 obj <<
+/D [293 0 R /XYZ 89 770.89 null]
+>> endobj
+296 0 obj <<
+/D [293 0 R /XYZ 90 628.972 null]
+>> endobj
+297 0 obj <<
+/D [293 0 R /XYZ 90 299.073 null]
+>> endobj
+292 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+301 0 obj <<
+/Length 3489      
+/Filter /FlateDecode
+>>
+stream
+xڍɖ���_�[���9ܗ���7����}ȳ}�H��
E�9��ק6��
�"�B(����]�����ǻ7_�
+�<�w��]
+�
z��}~����]��AT�0��o���
?���W�w��E0�"��E��/w��� �
��*wτt٥q�n���_w��$�w��;��<H�rWDQE��_�8����/Y�_�,:<$Q�;�4�:D�^��
��p���'l��zhz��t���I�m��U��n���"P&�h�>�j�
�����"l)|����a܈�D���j<D��I�!�W{�7te����XPe�����Wp�����Gu��n���i�/� o�q��:�

3����a
kn��Qi=�p�^��8�O�W���
�V?й��3���#_��cHpxȊd��C�3�����a�ƈL����>����pŽ�='���W�@�e�U7X�s;��$L�8���8�I���w'ɒ8f�M�[6GP��P,DV��_����V��#Í
Y�GԄ{�
�����=P����g{p�aXE#�xmP��J#

�x�
+��p�#+	BP�����
+�b�tnGA��qza���#0��:���ަ �e��4ܟH|�k�V���[��n�S��~���>�qQm?)��՝A�f�WO����dy�����P�l�k%*t��2����g��ٿ�a�7+J���q�Z��*��D�z: �Ʀc�P�hQ�[���]h��!`�C�.��)��b(pe*�[�B^�g�1
���ga at zc����Z-��گ���r�m������ɓ��4"V
YA��V�^x�Fȉu��I	n�σ��8	�*��>J�WŦ��+��U��}UZ��l�Z������?L��y��zsi�IDGV+iƩ|/������,��ג6��R��AȖ���,@уQ�39�|
�>�ב�l��Q�G-ӳ��
�"C
�'݃��x�:��ղ����nh�<|�s�X+f�a�~ސ(�էA;`v�"_�"F����}�������3�"iQW0�0
�,�SօB�菺��Vn��wڱ�1�^̤/���=�j|9���P�2��R�2���z��?�g��U���
��
��n�E������B%L~6ty�{?�\O L@L��nE�q
+��Ht�d'�`�f�X��B
�^UpGm}���V��V��l�L�jY�h�Г|2A L���6����|
(���͆�!hq\f�:����]��^7��C'4��xy3+,dM,!v�ٓ����8
�;�ӌ�{� ���
צ�
0^FI��Ѝ
�ٚg�u�&��9�U���I���������&�\�5�l�1t��~=Ld�C�0����X��9<ɜ���b���
8?�7q�$����]���D��b��U�e����W��;%��!�Z�"���
K����l\Ԙ�1��/p�А"m
}�'�
I�~=�KZ�/׶F���"Ɛ�r����

�d�}
�;e��wI)����斒fBfR����
'b��F$�WP��b�j]j��uim����y�+	UO30)�3�+
2r�డ��a4�!�JA��Gw�
���
3�d,�
�PŅ�^ED�=�A�
�lF���EI(*�)D�3Ek;_��S�.="��cݒ�C����l��!
��I���v�
����^6Iޞ
� �0�
+*ͩō��;������b]�עs3�[�#��wk�
*�w=0���B�i#8�oK��bC�G� ��{�\ [O���S|:
1%%=�u������OoQ�م[,�+��ٲs��]��p��
�:2w8��#p2j�<i
N�-	����2��s�2�����Y^�K����
�fla&t(�ڰ:%�{���7�"
	$8��%鉗Ɂ�xd�IV�ĵ@�ef��I �S��&[
���Ƣ 
��~��v���8�7��%�/O���qS/�I]Z�H1�� �h+|zq_��ȉ8C|�G�@��3�ǫI)�}Ե��jg�ڌ?���lţ��(��l�&�w2[��6B[����KX�y�_�ɖ��w�w1�p��{)	
�2���]'�8�A�D
%�}rh��nvK�Q
�<_�G���3��L��)�0t�
!W�sE	b��8N��3�#�h�ۧ�
��`��L��N#�1p;���Ͷ�z�T�8؊��7���j	\
R&����񪧹�^|�]��⠬"��c	ڀ��D���p+�qI1=j��jK>S_�.�0��4�x�HA:�z)%H
+qV�	A�dZUb��@,jDb�F�j��B��,�jp�Wշ�

x�W��+/Iy�3�h=!	�r�xHT+��"J��
qB
 u���=ɘ� a�
 ���Y�	M*k2ʨ��h,���
�T��X�R�7"�7�8�
9��>r�\�%g��#h�K�,���7���Q��>��%"��D0�L�
��M�����Q�6�y�s��~2�f�_�⁕  ʻ[Yػ�J[�(l����/ִ����l
S*�<
�-�J3�9����RS�ĊC�~m��;.��.l��w�s��`��`+���{Kɻ%��r�^A�$h?�{���e7�%[��
+/��g^H`�#��;w��W��% Ƚ},�_�'�\.%g.��7���9d�w�&a���ү(�G��
+3��tw�6XP`�͛�
J�ƆڍIASR��Zm
��ĭ1�nƳ�s��?�C�Bs�?Ν��'�ϳ�i��άj�r�}[�%HR�8،�e1ގ65z��ŋ�M�q�	9s�o5�!��#��}��=^���O����Eh��p�y%�Wz��Õt�*��^lI�[���ѝ�����/6��>�^Nt*��H�e��0��k���W���G_��P.upo�RSު����#� �z/�\�i���+�%�ؓ�qz�3FĢ�}��Ǖ���U�AJ��*�q5�E,�
��� iO;�|s���2��S gL� +>c`�
Gs ��"Ki� -���
��^|V�Q zqD�����P�@�#V��ɫ��5�\^6�����&K
��[t������M��j�
���&��_-?2۠-��*��{-y
zz�e�A�h!'�P�����hbq6�nX�

��-�U�a|�$���]�I`k���<���\�%�q�
�Gޟ����Y�� O�V��Ѿ�{����L�/
�����_ށ%��=��/h����ʂ.
�o�������/��0JG\���77A�V��UI�
+%I�1�'�X���FW#���N�������
+���ؤ�z��� >y�Z���Q
E���5�&�E�U����P�QQ�4�i����w�d���-�
���B���)�")�Len�����,�����V^�T�4+����J�_a$������^�����4V5�p�u�%���� IӖ�|����Ŀ���ޫ4������<M׿�ys���C[��������<�s�=g��o�^F�������
+endstream
+endobj
+300 0 obj <<
+/Type /Page
+/Contents 301 0 R
+/Resources 299 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 268 0 R
+/Annots [ 298 0 R ]
+>> endobj
+298 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+302 0 obj <<
+/D [300 0 R /XYZ 89 770.89 null]
+>> endobj
+303 0 obj <<
+/D [300 0 R /XYZ 90 130.877 null]
+>> endobj
+299 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+307 0 obj <<
+/Length 3087      
+/Filter /FlateDecode
+>>
+stream
+xڭ]�۶��~��J��h�E*yr��u�d�ƙN����N�P�LR�^}�
$HѮ�r
`�߻:�yܨ��?��{�}�6�x�Kw����^m
+���
��Q��Os�����v��ɻ�C�*
�u�mz
���eTl}���_��}�K�*�I��<.�Mu����
 ��F�پ�<�y��
����ܩ��ݒ�$���������޵M���^�4zئ*����H��dy`��u2~׵��9�$�:{6��y��&y�;��]c
}x����7�/F�N���͏�<2�lZ�4�b7 ��K���

�����z�R���:��QY��^q�FU�l����3#�T�e�(�Q{\,O��	���7`i���EYt6�����!���c�ip*c�f�hOC���y���cׂ��
E�7�h|�.��A��yiB�K�8����*bB���:��r�2����h=
W
,�:7
(
��e��~���1��	Q�6ͣ'A��u5p���Qe����ez�3��� �$
�ۃ;>3����D�1�1���I��m��+c� �R�J6��A�9/ �m���v��(�]��P��f�UL+�
b|
n�����H�E��U'
��
��W8�x��4<xt���\.]{���`����i`���Uk��
����4�<žb�
LZ�R��F�t=�
+�
�˾G�[��e*���4���x���gC��[�0dh�N��
+� ��
�g���:�_/�$���Ywj��z��o0��_Ċ���z���
�zq8 �o�q�2��n�0�=�R,��d��b��P�X�%�|L�|���>W�
B��+�W�qg0 ����L3��m�R�0���<��1R�y�
+
A"�P
P���f�� ��·���ͯ��\�9`'d
�Q�=i��~.J��w���
�w��,-�̢/�<�'ĝ��xUû
u���cG�"͵H1�����G�R�+
����w
j��Ok�h�
��2��d���I ,
'7{��'��
��q�B_.����
+݂'R��{��K����{j��
����k$����*/!�Y��=x������$
�x@��tr���/���
��"3Rς�(�\"�\7Ç85�|�R�$��x#yh��?p��T��o�W�l/��^	�ͳ�ތ�
+
T��g(憿9���a�o'W�~��n������д���]��Ɯ���
A;zh9�m����9�?�V�u���3�<ze�ګ=$q�G�5�s�!������@�1;s�$oZ�
+�'��'ne�q зg�#��Cbe��t,ĵ�Npc��Ϲ
��8գ$j�
��hA8u��sC�S�/E0%��
ĉS�
YZN�
��q4�Ψ֡ݔ´���ө��m�������T!��$�y�� �� ��1W�*3y��W5\����˰ܯf�xLץ@伽rf��L��b%)
+Ϝ�6pjo'�>QH�&������ :�3���yF��f9���s��T�{UH�ô��)uTS>
+>�m�%��b��cX�UŔ��R'8��
$���Q��㵛��ᘓX�
E	�k.�k��gk��x�
����%��r:QX�Y��� >*��G(�x�J֋EXe�7�H03�dߔ̧��,D�B|��r��'+<�1����B�ࣝ��A�܃X)�%	N� 	N��[��b*) @!2 at H 2�L���9N��+��W�6/���1��$$ Ʃ'�!?n�+e�+�؛�7��E�M�",�4L� ���=��,�ˮUZ���n#�D
�.�  N�Z��>I��O�T�e֘�շ-��,�C��.T���Pb����#�l&Y[6fa/G���s^B�X�
�ٰU`q��)���<�������{Q�E���ͤ4+�פ4/��R�6��J-�r2�&��9!���4��4)& j���<[Z��U&��ڐ�i:q��#P�E��P�u'�P�VS�%�l����U������X�-�:��N�m�ҌD�����%
}"A]�,�_��������LH/<��;AX{ [...]
 �B
ƾP��ԌR��(V'j=6U}=��~ʼ����|M.� �I���{�{xr��������խ�i�$	V���o�ŷ�
�0a��y䨶�i $7�5�#�d5/���z,�vR���/")��P+��SKDns"��
W1Euյ6�1o�"����:�j��Tk���*���(Ng�l�
�!&K�9��P��
��~/���ۦ1�	m�,�E�
R��~:�"�(%��R�%v��lc{]��	2
|�ogb������Z͑W%�)n�5O?���"]�˶��� a�9A&����2T�>�߿(Ö��;���t·���NI�9���Í�T ��//��mgC�)��~dr	S���^�搧�LWq��V?�{�,�N6z�f�bģx����TU(jJ�*���Oi�����~f̊e�_�"�mG\!����cX���[�nw����;�!�_�p鶘E�O���5	��-,���2p�[��"U��q9�J1!����0�u�1����d���:�v֟$��^�
12�fj�Y�w�VJ~����3�O��<GY���.��4��s��ް��EVʿ7�"���}��~��-�"�a�<^ͣ��� ر���Ko�?m�'��h���b
:m�����c�q�l�����Ə���;�d'{
������0\�}�����[��*Є��n�\��%~���>���M|L��
��y��$��R�5`�'�DUR }��i�o��7�l [...]
+endstream
+endobj
+306 0 obj <<
+/Type /Page
+/Contents 307 0 R
+/Resources 305 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 310 0 R
+/Annots [ 304 0 R ]
+>> endobj
+304 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+308 0 obj <<
+/D [306 0 R /XYZ 89 770.89 null]
+>> endobj
+309 0 obj <<
+/D [306 0 R /XYZ 90 225.816 null]
+>> endobj
+305 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+314 0 obj <<
+/Length 3181      
+/Filter /FlateDecode
+>>
+stream
+xڝZI������-�{��Kn��6��q2�C������Pd��_�� �ǎs"P(l���)�=����wy�{�U�C����ᴫ�]�V�,��q�CP�z�v���!�r�Cķ�����
>��ݗw��"
+wO�E���w?��@�v
��ܽ�y��	|�݇�܅�I��D�!�xχ}z8�NM����q��	�Yp��)�yj���sw�3L���e���B��I8e��Fkjݍ̞��i���5^�����a��>�������Ǚ�$�pw���oX�ϴT������`�4�gn�u�!7�&�[�����}VE���������HyԺ��$��W�4HV�x��nj/[���	xR�B>76�=Y���4�֜.ܙd�Jh2E#�;ޣ@�R�a
�YZg8�`T�=����:Qx �q�����A1��SL�e¬�[V 踌�7u��'�ոc\��ݠ�O�i6J{'�

:ߨ}?���oI�
bWf���!Ie��a@��$���X�(��
{(Y
VtV���@K�YL��~`�f߼
�Ɇs'{p�z'�׉酐���?
�ʚ����6m��Muz
�g����$�y�,�͠[�x">_�/�?|dξ��a ���ط���"#��b �O����'
�G7�Y�p�������8
��f
�9At�r��E��#�,rCbk>b�uߌz
_���Ծ�,�T䛔Q�MO
�e�a���gQ�"
�"B봏�FU�k.H�����]4��C<��q�f
���j
a�sdP�6���wF��x�0

M��Q�QcFf3�	�_��b&Pdns�!F+h
�,d<
���
E:I�p�x�A>iu�����/d_�y�"�����a�����'f�
M�b��xI�W>V��3����kI�<������f�
"�2j�cpcS�ljA��a"�
�_�/�Q��Zk�	��G0�KU7�,��A��⚐V�&!�*�te��&{�O�H�
�{<Y��S�9ō�W{���S��-߃҂�n������
+yK�n "�g�X�"�#מ%W�H�ը�Ǽ[&E����w�]^�	��ϣ�wS�uS�uSx,=>����V3
��k�j�
P��??�F���6�h�p���A��L���;�ݮ8�l����c
'�fByE%<�
+
��D7�A�]�Ǜt��� 
��4�-wȻ�t� =z���J>%�p�
�^��D��-Ye
�4n���)���r�[�ޑ��
E�
��7��L,���nL���R��ڧ�49�b�[���ŧc�gn�ok���
+_��i��6O�� c�8���/��z"(��ƆE�l�i�C���5�4�#�ӎ�[s�/
�������YKR����� ��p!sVs��>���
��3�c/�Rt���Z�Su��a�7�BzZG�咼��������#��)5�!�og›�%\�DZɘЃ-�X,�D�l
+
o���
�>���ex͟V����ϰ�6��
+O�#�;��e�
%�e$m����IOk���k�}�a��O(i�Sq�����"����, L:�`%Yp���y��ا���
)}�Jb�������.y�)�K�
+m�69��]��B?�a<��ձ$��m�Ul���W6=��d
+|
Be���;I�<�%�Z�p�z
�"CO �Z��<
�j7�� hC�]b}���RYb%�qW'�$e��ؕG��JU2	9.@��3�76$�@�
x �s��d|<��B���,NH�?� �y_�ʜ���y 7�6�HN��37P�U(��q6l!g����$�(N�ilI& �����n�$`�$._8r�Qf��G���8�2BjW���v�����N�U
+h��Ԋ���:4Pȿ�[��Jμ���Jy�R��O��8=�8�{��IP(�~��S��(�1��-C
<p��
��32�h��U��E6d��"�_)����ůĥ-���{�MbJ)�Y���E����r$/���n�������C�x�Q���aPD9������*p
�K`ain�+�Z��C���F�c�c`Lj>�<Qt
>�"Q�XU9���hS#�7�)���ظ��U�Z��UqO�ҳ��&�_��Y�ı�fZ�.�Z�NjtjW6��
TL��ir3��Wl���kr��G�_Ip�G�k���pV]�*2�$�L&�t����5�$�<�&靘�
+���a`A,�I�Q$z
+#�cI ��!kE�#�,ֽn^Yy�'����� 2;.�UR��+���v���*/.�8��P�v�D�I`�%�D��-$3K̀�<`
0�%7���X�x�$�4�o%�,��$D�%��E��D��%ϣ֬�
���
Њ̤�+�Gm����RbH��f
�
ᬹ����I�S� S����������eR
+��{��@@��cP�[`m�/�ȴ��O�ּ�
�d	ܰc�Ib���9
�
+
.�u��k`}&���Vb�ͅ^"G�Ԅ�T�.��)
P@���9��E�R=.m)wquV�{U
+��peq���~��l:�w���jn� ��
0R��
6]ZH宔
7�і�@_�U�*��#��rI`b)����82�֤��%S�(�
�tٵ�(�oH^~Y����e,9+%gT��LT�q�m��Ǚ�&e�o�_�@J �
�V�w��X������R�������
���6n<Τ+����3�l�ȣ$1~��(

�%���C
H؈�������,Kƞg�C��ma)g��gǴ S�M:
_ta��6���h���˥
�TNn
�|z]��Cָm6'�/���jv�������� k;gw������o�uvޒ
�z��$�\d�(����
Lw��g?�;I�G�I��R9��<��6��i��dΡC���
�
��$5����R�^e�ؑl�!�ׄA�!}\ϗ L��
�����O�*ú��E
�8�_�`�ML�CV�?3>AFEӠߦA;G�ߝ��=,�,w��/
ڿo䇪HJL�2�����}��o%8P�Ӭ�d�
��'|eM�_�^e4S�l�G,������ �J'a�Ak+�᣻�_�O0��*=�ea���L��_�~����?
��o3�erQ
�<�s��� w1h�g�;��_x�
+endstream
+endobj
+313 0 obj <<
+/Type /Page
+/Contents 314 0 R
+/Resources 312 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 310 0 R
+/Annots [ 311 0 R ]
+>> endobj
+311 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+315 0 obj <<
+/D [313 0 R /XYZ 89 770.89 null]
+>> endobj
+316 0 obj <<
+/D [313 0 R /XYZ 90 646.255 null]
+>> endobj
+317 0 obj <<
+/D [313 0 R /XYZ 90 530.071 null]
+>> endobj
+318 0 obj <<
+/D [313 0 R /XYZ 90 308.971 null]
+>> endobj
+312 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+322 0 obj <<
+/Length 3432      
+/Filter /FlateDecode
+>>
+stream
+xڥZI�����_���*��F,�9���8J$�*e�  9%,�0�>_/��īr�
1�ݳtO�3t6獳�����޼��M�OB/�|<mg����o~�z�����~����(�MK���ɤ��Ɋ�+Љ� �&�_?~���ǧ/O.�r6�L}�G�&��~���� �q�~o������o�����'g���~���w]�d�{�;�핷Sި�9��v�a��2=���E��s�m�~@W����öhe\�
+��/�ind^̖eEיqªH���XCj�ޚA�C��,��3
������Ǖn�]!T�!с���09
��o��-�kS�>�����f���F�G��N�B�F�$`&	O��d4,m۴>�͙���"&���+ʓ����y�#���x�*
G��E��Ҽ^�تSp؞x�	�t��mo��L[��3%��H�
�?_�CW�S"S+T>UZׅ.�5ug:�#M������R|L[T��=1�L"�
�Q�Z��
����o,�[
u�QFh��uE#��:��론��Uf����'}���<���J�i�Е7t�
�j,�����H��[?ڟu�ry|�8���(��Pړ��p{���)
�T�@)G��.��x ���q2�`�~nb�p�'k�V]����z|���v�P��m
���l.��<����nC�d�+�+
+�O�x��X�DF(ݻ-%��en�O�Qk��Mm�LS5�BL�M2Gq�QwB*+�I-gt�s��ay�1|�*�ɮ�����(M�p% ��6�O�&ߏ+D��
d�w'r�I7�vCJz�O퇱��P���Г��z��
&L*����P�Х3j�-����Wձ�w��GE{�����5=��V�K
ok�]6���d��s�u�"�jq��%�ŏ�ED3wȤu.��V�@im�@��!
���
+i�R3� v�E'
�G!aB�H
b���G[H������i�Ķ6�JP�K	[
q�
!�Ҩ���tB6�$X;0Ƨ�o2�L�Ys�-�IN�:t��c��ľ��99`s��Ə���\<����&B6M�"��%{s���;�Y
h�9�� �0C�<2��Th��ܭ�yL;;�ڿ�WM�kɚF�fR qL@�a���T�N���I�b��И^�yS診Q���r�
��`�)��pغf3��	`!���ߏI�.�T�Ki�
���
�.�*2a/R���6LHEsC^H�V,$%�-S��&�C��N��`F2�֚�������)z2	U�P=��b�ԏ֌"�E�M�(A����&TUz�5Vm4bg%�{
p���$} ��."�Ls���e�HS[����Ԓ�J(�W��:p��3x$Z,��SHC� D T��j޷F�$�~�v�I�0C�����}���"M��*�L�
�|S�
M���9cC�x-�ai�:
�����g^"ϦN�Ph�� ��4� [...]
[��)uY*>V\�����EIp
Z�|����7�w�o�TWT�4A't�
W��щE���T�ey��3ԥx_oh ��
��m>��s�=Om9Z��4S~�,�qF�,G)r��
'�E�X�M[�R9N����P|>�Oa��њ��|�lIo|���Vn�Ei�8�=��ԏ��`~S]Q��n\y��D�̋�uA��zR�U�T'YK0�c�9���іI��Ys����4��g��8Sb�j>�'g�
�>�=�y�
7�����
���j��i����C������c�H���۶(���~��rky��[��eE�����	�Sj8�$(pQ�e��/�^���
��7��4��v?���m�	Z���4
+��t{�"s��B�B�Xr!�Ɨ`����[��!
+I������h�^��\ih������ن���NwsfiM
�Vt�i��Rc�k%�;�w�u�����k����N:]g���Ӻh��T�$�~���!��P>ҕ�r
+���+̢��T캶@�e��^�
+� �fT�,�'��	�o�=��	9r�谦tŗ��� ���А|�y�f�(>�߲$�L۷D��	`Q�n��]qzl�y$�4%1ķh�n������<ֆq`dJʲ�z��k���Rr�X� Ap�-�']���D8�) ��)��dBɘ"�ݬ���0 x�6_K'z�h����R�T;Zb�eɥ\4�W�
�~LJe��d�jڙ[��K�,����8��ΠYk[�Z�(	�{C��2����{�zB_uD$ *�~f��5[�lɉ��$���鴋�Յ�Uq��:�#���œ`�p������nCc΢|8��s8�T���/��,
�
���A{�����e9�%*�MS�t�_�_2s�x4R�/6��
�e��7�"�
)Y�;�f1���Tb����
�TC�bА��%#��m1�
:��`<BS�H��
9m���.D���@��K�hYZ+���%B�kz��GT���"t��,-��� �1ŗ˜��y���Π;�D��doW�zr�X��u�Gpm�஽&��B,�7{kq�i$W-|H��=a���5���fqڄO��ў�vѽ\e��+{�P��r
t[H�����$�m������Y��rIb�U���,;��r����ܶ����\^�.���p
|�W�$��W��Yb�z��5�R7�9�����0�%R
;WX�2L0N2���˻�@[y��� V���Q֌|��Qt!����[b��UB[%!��zE-4ty0S�j,����D��6��
z^x�AB�j�u�	�Iy;��
��W�rb�ӊ
q�Ӑ���\��3k��&��V�\)/P��/�
+�Z�y+%>�e��k$_E�-kv��nYS�ߦ$(ߍ�^� �
�{��V)��w7�I�� U����i�:�����y.
4��f��N�Βq
�ʳ `F�F��ף�r+�
+��wt�6r�j#��6b*�������m uJ$����՗"�j��7z~7
5A�
�}����U_ �;֌Y���O�����Ɔ�����Y�|���A!��]��Y=Z�����Y�
�tJX��zc��ع��i�s�w�����G��{�0d�(�ȏ��BA�?�~r����Q�迗RhxzV�;
+@'�����Ҷ�?_eՃ�]1,�ݻp1]���\
+˫0�yc[?п��ٶ�$؇q�<����Oo�
�3\�y��(��Q�wB׎=Y��@
_�8$��ߴ����C�J
������G�6#�@�yW���48���[�x�Tz
+endstream
+endobj
+321 0 obj <<
+/Type /Page
+/Contents 322 0 R
+/Resources 320 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 310 0 R
+/Annots [ 319 0 R ]
+>> endobj
+319 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+323 0 obj <<
+/D [321 0 R /XYZ 89 770.89 null]
+>> endobj
+324 0 obj <<
+/D [321 0 R /XYZ 90 392.327 null]
+>> endobj
+325 0 obj <<
+/D [321 0 R /XYZ 90 264.394 null]
+>> endobj
+326 0 obj <<
+/D [321 0 R /XYZ 90 160.456 null]
+>> endobj
+320 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+330 0 obj <<
+/Length 2822      
+/Filter /FlateDecode
+>>
+stream
+xڝ]��F�}~�o���p���'Fq��Qx's�< ��	��d��o}������SW�WWWUWS��{�i���������z#udv/��FZ��Tˆ٦���k�ߢz�=T��
B�
/�7�B��y��w:������
{���ߴ��?�4�

{Ĵ�

Ƽ��t�uM��M�uU�y�i����)a�m>����b��2��R
�M�de��`5��2�ىܲ*߫xϓM��L/ʆQ�!M��'cc����Ӫ��}ܯӊ���
+O� i�Vq���q�g	�Q�=��F��{�eIZ��=�Y��Y
�ǟ
$���S��M¥Y�H���bs�U�]���Z$�V ğ ]���֟��j6��;pD�`��.`ɕ�j�ANj��&�<
��O�%q��
mD��.Kv��
�#Ypg㢹�6�� �s`"A q�ED$���V�)��:�`|L�� ���-K��j�n�&ݧ��}0�I�
��H�+<���u��
+�CZ��4��{lve��7�e9c hJ
%an��+w�eu�˛�����%?>��:2z�� �g��df6
Sn��0�(L0/E���E�mZ�/��jZ�1r��y>.��)1݁���U Z�}K��o��t��<*�����Y���Iy��Ye�;q���7�ٌky����
���S��]bT�A�s����\�sg
+䝦V[
����j
�7
UH��-t��P&Y���<���ِ#�k�4�SU\4�}�Rd��W�
0�9�ѳxP���8��|��W7�y�Ƴ�"`2H0f,���g�����w��z��Eބy
E��\�����3�c���}�
E����[�V�Q^��9c��W?�0ry-�}ay
�ȟ?����-�#�?/f/oU$w>��.0�/���,� �������	�!X���jf.#WD�0�_��y�����}Zqʣ;�����`Z��q��
�0dWX
+E]�n�Z>��&��?�"�
f>�U-�/|h���QR��~�m�
�_�`�
�џ��U ���:��9X/�=�yN~�fn �U�\���Lh�
s }�v�Q?��!
������V.�ejbb!���w>6�ͅ�)�8�E;����J�e]����-9E�et���_
�o�#��w�|��	n�^�+-�E1�\�l������7�*���skY�-]?`x!�xh�b�ʛ-�m������6��u�g���7l��f�����V󙤕
�i)1a�c��T��!
K'n��)�XȦ�A
��)4�|��Ϸ�����:?5� �3�V3�3s[w ��/����^��)�3��E
ͿzoB�>R�Ή;�
+��E��を�G�Ǚ/�`�4NH��Д���>y�Ȟʎ��]؞���3��J����i��B���ցvBX�$Y�'.
}^���!0��;�c�w��p�џ���#Y ��= �'&�j���9JR�E�[N����قr֑�	���3�
+i�P��&'̣Nj2��g�`/��*�K��,:�5)� Wp��s��h�;
���&�
;ݔ�ar�`ty���lE�iS
��pNK�b~/�K2�R\Q!��"��Y>�����
��ڐ�S
��ں�H�.�Qt(�8���x,Zu����/J�n����m	ǭ"L�`��4�u֑:��]z��[�6L�F����q������/��2�6�N�NڏW$�� 
/��VD��s)tE�ӥ@S����O�YE0^3F:
d���
^
���d�`sB��H��D0�4BIs�UI���p� ߸� 
���*AA�Tcm��k��
'�ڍ�f�z�9��ÁzO �Bd�c��C�Kg�+��(ɡgbA
u@���3�Ek!�.�cs�_��d���L���@2	�d2��زB�ʢ�4c�G��‰�4�T�ʱ�ӺfJ,2��ƈQq]���v6�k�w�?�E�^v�m�x�^��ҝm�
��v^�m��?}�N�j�cnȠ���N����~�����T�4y��u��N1�P
2
+џ<�v)=  �
��K���PW���<��\V�N���f�0��2t�y>���D��V�m�m҉�1���
+5h�̶��k̲FNb�szRHH�Q�b�)�U��C�e]g�\hGrr�ϵ�ћ��r®Y0�17S�}D��]�^��P�e���ز���Qg�2"/��Cb��Cb��w�B�Y���m��P��*[�
�tsz�ܴ� q�.�cqzHi$}�Թ�����{�lh4��{�P��&&��N��q�
$�g	�T�7���M
|+ S����?�x�Q鈞�5Q�^�'��6q%�(m�����X$7�'>��t��G.Ϧ�w�N}�?���/Er' �H%���;ѐ;���>�j]�~�8�uj��uͪw�1�]�Q?_�p54L�Ӹn������6zɸ�<+��Hj�̊�CY����J����HW��I\
�-��_~��K���
��,A��G#�C����G���4�!4�����@R�_5O�x/�<��
L |�����D����L
�c񃥚C����9.�&JbO1�o[����PS�Ѱ�_���k}xawk���v�x�K�6T�0��_J
���Z#���]����؅���⋿7{����=����������
p�Y�M�vQ�=�k{9���Գcܖ4�<��QjslU����_��K.��y��U
>���C�+LSq+������hwl
T{��5���_����uZ������zv
U��V����/O�� ��I�@��0%
+endstream
+endobj
+329 0 obj <<
+/Type /Page
+/Contents 330 0 R
+/Resources 328 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 310 0 R
+/Annots [ 327 0 R ]
+>> endobj
+327 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+331 0 obj <<
+/D [329 0 R /XYZ 89 770.89 null]
+>> endobj
+332 0 obj <<
+/D [329 0 R /XYZ 90 587.178 null]
+>> endobj
+333 0 obj <<
+/D [329 0 R /XYZ 90 447.102 null]
+>> endobj
+334 0 obj <<
+/D [329 0 R /XYZ 90 295.071 null]
+>> endobj
+335 0 obj <<
+/D [329 0 R /XYZ 90 182.701 null]
+>> endobj
+328 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F84 265 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+343 0 obj <<
+/Length 2683      
+/Filter /FlateDecode
+>>
+stream
+xڥYmo�6��_!엵�X������M��e�\���8Z�m!��Jr\����
eɧls8���
��ڱV�c}9���]\ǎ��i�E�li���
F�[X�G�x�����35���������*�mdو&W%�n�L�5�G��\w���׳��ٟg.��X.��qbe���8�ȿZ����L+�|����?�
��K�{V�G�ﺮ
����u��u^�'�㌶�ZUbC
C\Vxl�j��E%?Q��v��DI�J.�����)yC_Q..TE�Z��
������)Ib�w�B2s��YmX"�<���
Y�J�y�͋<�v�u-�9.2�k���|P�v��VO��+W_�9dsX�WY����!>
��AMb�hZ���j��˜k�|�F!�lmg���x�
;�l�x����<9�Zmͅ����Z�y�W3g�]-���|���	���f����:ӻoL�>>N�f�~2K7kef�Wy*V����esh�c`��W���
��7�7�o��Е����s�Ȳ��Mg7��o�L~x~|�����C��(�����-/�^e
r!���.��q��W����U��d�j'�����{���E����>��'iy�{��aϩ��3S$}�L�g�w��n����~o�ʝ���EA�=��<Z��Q7�O<
+�/ %�$���Ew�XP#/�f6��o�k5��ў:
O�䈬����؀�����YS�U�7)y��آ�csWn�J���c�PMn��a�ul7�G
%k
����xc��K�D�<'�
^�.���
}��;n
��!UL����NEޝO�������f݈���
4[�'r�_�n8:Z�
�ć�Yj��/�S����NҴ�FA��{�3H��M`
��ܠ�Wk�:�?�P�'��I
;Jۉ)����Wldߕ�"Y5����;H��ϼ�3����+M/��o�gW�
���ciR8��
L`�7����h9�Q��A�y

N�D�X���c���c@���d�(�b�E�f]��se�U��0CoC�Y���a����л<'�����kb�}ML���#}�ˁ�d<�q����ј���b[墑ķ%��1��sx��H��u-�
�!
+�i8��U�N��4�����&?�C��p�g�ކ���	p�C<�RV ��<p{}�$������u<Xb`Yg{��#���;��q�r(f��y��k����
(A?��4Ǯ^�
�mA� Z+�P���F#	 D�L
�a
cF�l��AbW/�b�_��F7�"ԇ4����Z)@S߉FfY8,D��8
+G<���竲�6j r���ۀ����B�( �5�n�%.S�#}#	���D]�JK8��ţ���Jm�
��:�%H�+��$ݴ�b("��n�
�����k9d�mM�����Z?B:\�B��N⛐�n�q\�(�}X��!k�l��\H�(g��S�����j0�[�
� 
!)"m
p;/3UmUW���k��x��UK��!�:�
��	��#&�,v(��e=7�)����n^���$r��+�(�$�8�nāx �׹�z���ll.F��D����`5 ���R ��9���Ax�

K'�,�T�y	;��v�ǐ�h�0K���w�+*
�#"I����Zp�U��
���%l
@�O�Ab����h�����n�XЈ�B#s�M��:�z�
��-
�E!�
Bb����[��a������P�ڮ��a�=)V��^7��G���N���og�
`��3��r�"O�� �0tk�'v
��똂�G��:}R�(zK2��b;�98�)l�_06���Q�NaL%t���
+��{�p�I��&��]X�9��^�j�w��ܔ� ~4�_C��R��d��|i �u�T��KU7��_�,��A��
"2��i:��ի���}�JA�}�08�X����rs8m�ȷ9ځ}�E�ٳ�V�
6>X�.��E��M�l�X�:�k�B�傑k|jR
�꠳B8yx��~������@���;H5w4�
R
��F�fG� ����X�B�)є�j�J�0I��Sn�ܕ�^�q
W�?H����F����eɇ�܏6�!V"t
`� MBΑ�ij�	ADL����]Ŝ�X��e�֔
t��lwm��Kl����-�ƞ3�5�B��,��I��k
ˆ
�|y�DH�I��M� xYe9Xց��A�*{��� Z>I,�D�m�N"c!q�Bt� !5�:x�- Hy�t��O�@����}WO
�v`x��t�jc�ց)Cm6D�MC�4�:�����C��4�=s��
[�!�:
l�����n����	�
Cw#��0���
|��܋0��is`���Ӣd�fAm�@�`쬐��
4��ٚ�6Rh@%�ƋD8$1�'
%����^t�Q�1���ռ.0ljYcP
֍>�Bzb� �΋�86j�ʂC5�� �ʛ�F�d���uo
'o�� 	; !�����"�$d�kbf��J�R���vK,����G>2�м��2Ӫ6�J��yOG�<;������/���i�'�sW ��;$xx���g�U
r�N�x�[��<�}��W
੍���dθ�������:��
%�	@��Vp�+.����qr
�N䚹���\�����;���q��!k
�'�GǍu��
4�pq��\��g�� Ȉ�~
+endstream
+endobj
+342 0 obj <<
+/Type /Page
+/Contents 343 0 R
+/Resources 341 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 310 0 R
+/Annots [ 337 0 R 338 0 R 339 0 R 340 0 R ]
+>> endobj
+337 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [314.956 584.602 472.963 593.709]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
+>> endobj
+338 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [152.087 383.427 321.452 393.708]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
+>> endobj
+339 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [225.562 329.315 508.501 340.219]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/philosophy/why-not-lgpl.html)>>
+>> endobj
+340 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+344 0 obj <<
+/D [342 0 R /XYZ 89 770.89 null]
+>> endobj
+10 0 obj <<
+/D [342 0 R /XYZ 90 315.138 null]
+>> endobj
+345 0 obj <<
+/D [342 0 R /XYZ 90 283.117 null]
+>> endobj
+203 0 obj <<
+/D [342 0 R /XYZ 90 283.117 null]
+>> endobj
+341 0 obj <<
+/Font << /F70 196 0 R /F72 198 0 R /F60 176 0 R /F93 336 0 R /F84 265 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+349 0 obj <<
+/Length 3702      
+/Filter /FlateDecode
+>>
+stream
+xڍɖ���_��K���5�):�Y�vfƝ�Jb��"�3܆�۝�Om !5��E
+�P�
rW+w��՛�ի��J�i�ǫ�q���$L�Q
�|�����_�߯�x���&�����?��q������C�����6٭����_�U��W�6Hw�GB�V���\�_��ʵ�_n���k�k�s
��	v�sR�u~�x���/
j�so8=�>��{A*j�6]�;�l�;N8��`T�
U�_@���	}s

7��N_onB/u:S�eL⪻���Q�'���q
?6���ɛl�t=l<G
ESKā�.�ڮy�T���Ԍe��4�
����� 
3���yQ?0h8ɔ^UBWʛ�7jX:M�#���7~��At��� {3
�{B�鞰C@���eQ^.Mj^ZB��W�"�d�f�A���)�N
+��I���} Z<J�4ݗ�#w����`y�{�\Ps�o?
����;��<D���IפSb!T��P���o]�JF��
�ءi� c8��* �4 �`�f@�p�>�(=�͊V��3`�����1w֎]ۜ] ~�~��
��N����u�����
��$����Լ���x����ۏ�������������Ϸ��>�3���AbY�`稶-
-#d�;	b�|� ]~��`x�� J��<#��b����p��
pKf0.�?�Am�2�ih�*ۂ@fM�yꊇ���95%Y<��^=��#�\E p0�Z�����(��k!�=']骞a(�RD�+�w?f'��I��|�U�ٰ���o�d�����)SC�U��t���y`3hq��ن�|���cGV�vbZ L�|C�2���
+Ep������%�yȈ.j`D�� ���~'�~}-���f�G�t
9#�A1�x��o/��eO�
+P�V�_�I����JW-xd�p	v.����=�.w���ڈ{�À�pJ��
IbL�
��f\#���i��.G��2��f^C���t�#����on�TM^
�x��|υ�b�q�Z6c
*!��cѡN-
��(�~2�Fp�y�������v���K��f��'8�/��#��'p�s at 0`��X�#M
�H�*�HNc�}���!1Kl/`t��7Yu�ݶ�,�4���GuAs�p|"�u�����wpC�6dʨ
����A
���!�#<�Z
7��~Ճ>�y8�<�bg}�Q�U��}��m�J�W񧆰)Hۂ�-~�^�z8�
;`�� ���-��Zh�1h�lg��V�9��&�.Y9�,��/Р0sɹ��b~ƪ�v�V@�	\=-�&g����=�>q

�8�.̲D��
��D1

�OY" (aDX-��7r��&t$�ɘ�=�y�rj�
�x���,�E��<�%�=�ۄpk Ɔ�آ����0��0�)ݔ��?��5�}
��{�P�9��������(���E
 1s):=i�)2\9�3�}���d�&	��u�0}X�f���x^dK�_��=�X�p�4�X�AR<b�A$t�Hdh�"�@>�\����q��~���:�7Boƛ�hZ����_8S9�	�q �wY1�SQ6}�l�Ar ��L`۔iL`����%$���1;��a}[oB��>�,I���5w)�
+ ��t7�
3�$"�
�I��͡J�_P��
�J	��y�36NIw��&�
^�=��N�BQ
?2�M4�~h
*@!H�
��MS,��^!� ZQ\�=��<Ϡ��pD�푡J��\�pL�q��(4��I��
u�l
�r���HBH��k_�B��K���p��J�&�����F� ��
����R
l9���	�Y��_�5�Z�v�6�N!��x���g���`�s��^����0�H/-�2�\�'=�$�R�Q7��݄{��v
�oW��@�	0V)h�ʉ9�せ��{�t$���|!c�~5\�?��1�+ ?P���vf% �}��/S�� yA.�����0���`r��h�9L��������Ks�7e����v&
�����{��0K1

E^�������y=�V��.���;@���
+�|M�r��aH���
�0��!����kS��ő�\� �e:��.J
�� d�7�V�:��TG���\
i����p�eDŽ�XUJ�a��
�:�8}�vϏ1�������%o1(����b�A��q�3e���32�B6���fR\X�1������a��L=���CN�	#̔�g����$f�c�
&゚X��C:/�}	` ��'o
�E����R2��rA?2����	O���$ �!.Uj�gְ�\��$a챊�B��27fy��з	2
m�5k�D���`����(o��v4ƥaL���)�!�y�?S�$��0X�H�z���6M���
=<1�T�yٞ���e���wl2���� ����ˬ
�t;F��
eR=�\-�m�q��k �0�	���>}�\h����꾌-Eq������
�ȌA<��<���AS�-��f
8P󥈆e<Q��I�>� ��@	��A���/
�"��R�֏=m�C,�ؕx#v/���&�@��m ���*<���xz��M=?�k? ţ
�@B�褪f4�#S�1�cJ��-�Wc��w�'b�A�S�����V�׋u���������ƶ������]�y�0
�B�`uV�$�=%�������-7��6�R�2K���n���������`�!�
@��x���f�
B-v����� :?�Ⱦ��?��'|f.�n���H*� B��T!��
W���x	���w�O�5?^s�b���+���J��s��}`��|�`O �Ɗ^& v�Y����{G��S�����ў�_��؋�1�QN��G�s��[)]����)��<��ݷ[�x2t�
Z
���6�]�P��x��җh������ƀc
ijr�iĶ'
/�M�)��

g���e�™|���x*�A'�L����!Sv���7E�Ӕ��Q
+�R���%������"���ߔ�9�d\�0�%�$4�d��M��$ `������"ԲX��p��+GX�;*�
 �SA��{V�/
+cl8����;�1 �k�R`}������Gc��5���*`�L����u�uy�JW[������E5��g�-x�|;���uX^��o��,'���P� ��$��Po!ؤ�����} |�O���F��
/�Qu^u���7?�F@��ׁ��
���ۯ��9�Y���d�9n"��wz�
��s:��r1 $�&.�%
ѹp �-
�����
¬��5�$qg�a

 �V�!qPQ��d�e�R�.
�����M	�Ӡr��"��5� N�?�04�)���8��״-
+������5Lܣ�
~䱇H���X��: h#hs2g��g�?Ms�Д2�X�Z����B�#
��6�bx_�j�o<i6:^�Ly�qi��TA�e��^">��Ag~Y#�w\����*`��s�ȇ��v����&~�g�`fM
�m��?Ӿ^�[�K��6
�9xu[�w
��� ������Z�M�`�:�v.�Xj��7����Gn���?	��w
�㗥L@��ug��'y��6rU�?�C���@fv�A��_h-l�3|���7��o�=
��.1�;
C�ͫW��ҭ�m�Tg�sq�$ٺ�g�N.�jL����>R
wq��V($
+endstream
+endobj
+348 0 obj <<
+/Type /Page
+/Contents 349 0 R
+/Resources 347 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 310 0 R
+/Annots [ 346 0 R ]
+>> endobj
+346 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+350 0 obj <<
+/D [348 0 R /XYZ 89 770.89 null]
+>> endobj
+347 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+354 0 obj <<
+/Length 3615      
+/Filter /FlateDecode
+>>
+stream
+xڝْ�6�}�B5/+UY2oR~��8�lb;�Iv�I
 �����g��/� �NR[�*��э�AouZy�on^��<�z��n������{�4���z���u���������x�l�l�5�^����S]ij}_�nq<��x퇛�����Ӎ{z+���wi��/7���
+ ��v�>[=�e!�W��n~����&��������
+�Ͳu{�y�����u.�N�.x�l��l�5

Ft�����&���$^?�>]�}~晪e�ۗ�ǚ�*]�4r����׺(sb������ua�v@� =[8�>����l����l;�<��~�b�M�t}�ɼ��qX�}�[�|���Z��,��
0��*}�}s�� [J ��y8ki=��7���<>�V�wͽ�Vuk1� �n��F_T��(
�������c��ׇ�
+r���(�w;#��RV+4�r]�Z�a�t�����%�9}��W�
.��
��"�UӨ����e�W���e@�����e�@��<B at m:>�K
h��Q�tkёa�bJ��Y��*{���e�˖�H�� 
�`ZPf�sr E5������n�Ro�� ��'=<2��G�R��Lf� "T-J�ax�$'^��z�"��`m��i��hy���D �a�[�_/6��!�q�,g�Q
7�
p5WV��Ap�E\�}�\��	��ҳ@�Y!EV3Q<��~�S�|�Zg%��>�Q9�np�*�ȗGZ7���T
�ݤ	3�n�"�(.��_��ǫ��w?���޽�p����,MR?l|�L��"iS�� EW��G��k�R�[� �t�
+�Q�x��C@��E�/`K� X�Rn�rs�[�KUU�jd�6�d���]�}.Y���*'�%|� �`�t�.ġ�)O玑���̗M�jnT�����`�@�
�n	��N
� `k��s�%�
�z1k:6
4}��b�8�U�
 ��㇤K�&�-�8��1_����%hO
+���)Cn@�Bk4J8�H#+��i��T.�Aη��Q�} �}"k�� ���\��S��o���#n�9�����Ey���kL%��U��J�Ӏ��}�|�y,#�q\åL�-f>PZw
�֫���f0�8�O�
+x���[K&\��6�@V
�����a��c (��j
$@H6"��^~V�Iq�����wG��}�mn�x�RW��kӟ�b
�ˁ��<�&lQd
�V즪Z��GSوnjIE@��K�z!0	�1E47~�+��d�J[
?�v���t
�h9]8�
���ԁ�]賙y|r�k #SI�~�쐽�?u�8�h��[����o���?��� �B�<h��ڳt��&"�3�>�!��H�fpH�G���)��/�#�h�v9ڴ
k#�
�2˚�E����ʝb�����5�|�{&ƛn,�l�6���@T����
R'���F�K6W���=?#�oR��]+{�p��X9��Ze�ᜋ�cЯ�y
D��c<&�Z9�L�6k��u^iՐ�T�
�*��C�����8x�)s�`tB�
v*o0��?Cf�B�� 8�d9�d��
laoF�W*�8��]Ķ4����rk�)� �Q0ӯ
�
H�&_&����e8��A]� 
�����q�-�\
+�Xk9��%�
ư��@�G�u!T8����[0*d@�I����=�$Т�G �c�����9�o�	(` 5��p��Bd���bbCВ�e

D�z���֕"6�C��� Mr�D%Q�<�zO�6���IZ�M�{�'��q��B~y1P� Wb/J�Z����r����!�-
�y
�c�:�CL֕��&9lw���Ck��QG
�t|
����1�	!�$�
+#�EY� *=琁���2xB'2s" �>l�W���0 ][H�b�q� ��c|	��a�l�t�qF���
N
�
$��
��~t<q����w�=��*�}���q����L�e�y�$�Ğj���2$k.��ш��5�����]LmU����ޒ5��<��u�gk�}
��-��?*���Fꤿ|�a`���s#	����T�]է^���H��r��
�N�]�
�c�q�F�f����cQ��)���u��
�m�Y
\��*6�n� z�&�wyZBl4���<���0K�d����s^(�e,R5�������2��(���n����ֺ���և��
u��t���ɷ�']�L6@���}˗`���MU
:	�RmˋPR
�����2�X�Ů	���6Յj
+N)A��t&7U�]�H}���i<�U��3	��-L`c�t�p��h=����e
�nnǡ7Y�8��I$x
[M�!��:����_�j�M��C6���7���5&<zm�B�b�N_9�J���S�5b#k�N��c�.O�d��ǩ�}f�5�5X�
?���n,30����]���q�j �<�"Ǚ���,��W�R�o�Z~g6�\
+�2rԮĝ0 �q%�F6�f�#Ě�RG�G�Ќax[;�� O� h�����s #�}
+p�yW	�
�6R+�]-"X���d�ީ���iEU���
z����h/><��~�%`��� �hh���c<��V	"F�4
ŷ�����\�|h����ȆD���D^�{�$Q>FQGN[i�N������/�ϴr��jͳ)O�X��z��0���t�S���?ĉ�"NXp�c$h���6�˞=f���H$Ց޽�{s�����wo��j���Q��K~�#푭DO+�4�C?���8�> �k�#��AF��
��v�rTd�D�L�P�Rh0;e���Ԭ�l^mmY[|�h	5Z
mǥ1!�3rb�	�'�l5��0��ZN!�#�W���bI�e�$����Xe�Sh4��r�~t2�x\~�#{\�z����u/r���'�ӽ&�A��/=4�Z�g5{�BӶS}u|֨_e'�rWۈ�e����hh��8 7f��As'�Aߥ�}`� X��.
+�����W�A<��)���=
��݂���.
���
#��by��B����Su�
eX�ޒp���a)��̒�������R��8.čǽP� 1�G
	��dxؑ0�=�#���
e+�Ną
��
'HE�S�G��Xq�q�8H�}2�W�����nd�i
���+
��:
��4��i�� ��,:V���K��Y�X�@fc�I�"�
6(�
C����p���R_�F�2
&�
t��sLSBTKI
�f�j��`[-~���3��YTKٶ�3�Q���
[�F����
��ע|_R΋�d��������U(�ؔ9
`��00"h�Ql(�)�K�
- ��Kg
�
g��O5!�X�`��0�d�sy���A]����D� Ml7�E���l}f?3p0�8zhƒ�I�w�!T�{o
��3	��b��-���%yy��R��c����j�p��4�_���~ݕ��)�h��+Jw1�;�4���|� �=���+��Ր�
��=�En�Gt�
�Mhx�����A3�q�^?iK+�qe[G��c��h�d��s�]_<~�O��O;��g�1�9Mw^�۹G����y? ^���r��<��]��k��O7���S8b�m�����^����(���
+endstream
+endobj
+353 0 obj <<
+/Type /Page
+/Contents 354 0 R
+/Resources 352 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 356 0 R
+/Annots [ 351 0 R ]
+>> endobj
+351 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+355 0 obj <<
+/D [353 0 R /XYZ 89 770.89 null]
+>> endobj
+352 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+360 0 obj <<
+/Length 3081      
+/Filter /FlateDecode
+>>
+stream
+xڭ˒۸�>_��%T��&�wr��ػ����IR��=P"4bL�2I�Q�>�	R��Z�D��4�~���q�~��������[en�x��[e�*	37��W�~u�p����U����0���߿{x���
q7/
n>����V>���$]m7���
+ �^yn����DtX�*�o�����g�۬�~�f^�J|��}^��ٞ��׷�
+�߼�˫�;͎�e�q�ؖ��<��O��i���
�S����2j��*r>떻�>��b�BԿ�~�hXڧ��TW��
�F�{��t�i���6C]v$^ou
�̢�w��O��ոQ�Dl���M�0΀ĔL��Rфjv�<Ĝ
M8��r�$4$�}��*��/n�� �U�=�zFQ�3x7C
O����(�E�ۦ(Qʺ���׾�;��ʦ~� <�+sF�3���8
DZ�H�n�<gQbpZId�>���-+��Z9at�
׾���qߋ������4��/l*
�oP�W6䇾!���#�|�_y�ɏǶ�
Ś��v �����iy h}ˠ���6��<;���W�������A, 4=k�҂�\Fws�lb���%hޕ��\%��U��N�F�Lc�<
t�"����$u�]O�'�l	`�} N�f������N�<�cIV��g3�U�2��C���a
H�̭�?�6'ZE�S�����!����٣`�<V?ce&\�q�
o��@R�l,�ˁ[ݾ!,����.NB�����������E\/����T1é���g�x��uIR�� ܝ�\m��
�$C ��ס^v�����{�5���������7���2��:�
rR�1+�FU-z»��IY_�PB�+fl��`����|Ņ%���K������+�Q�]�E���Rv"{a~}��7ؖWK�gn,�T�,qlt|��I�u���`ԓ�Au�����D-�4'.��<��
i�!�%(:BDm����2AH�
F;=+mh�>�	�4J:oQ��[s��tV�(frErp���`E��xD�w��<}�q6+���$���]�Ơ<�v��-
v�=���b�	��x���
0��
:a&.
������Ԛ�ǃ�0r�9
�e��Èy!e�*b�nI��%1
c\�h�� :0��Eʈ
;���S�[{-H7�!3�."��ݶ-7��[67�jVt�24f���
[��9rظ����{}5��y���^hԺ��F�i?" �s���7�������<�Z��
+f~7���'�{v2�Hȇ
����-�F at NFa���o�;�:�Fo��69)^�
,��=���e��a�?�����ظ���
S3)!}3�؝�@e}ei�,�1Q�
�ܙ���—8���,�������~�k�I�
�3#78VU2a�_a5�X�I�Y��O�|)U
'N���|�tz �e��/#A
E
�)���(m�I��a�6&���=���ȴ'�M�
�hXM��5�-����t��P¬V��٘"�B���}-���U���|�����
m���o��˕�)�;/�K�:��3��z���c͡8�
�v�=aJ3ד;H��fa���l
@��Hn{����x�
7O�n�
�WJ�p�����Ƹ7�r�>A�6��
f���b������voC�I�M݃�Bkw�I*8Ղ���g�(\1
+�R�F����+Л+
+�z��8eyb��4�� ά����ۣl��vD�X�tL^�ҔLGب'�ل5�
	�L��������t�
ٜ�p�1����Ulx0�h���$!uWcR���bS:{}���x�o�6t՘���JS
(�lېY�Ʋ
�{�. ������]�far<�`Iz#������X�R��C�[��j��%����ݵ�t,��5�Bq���%À� Tk/�k��=��K���۷2B����o�1�H+(��,X�\��)k��&�]*U��ޛ��j����
+���B��/%��@��n[���CLA��q l*�&�O��~&v	v��g�,�@
+Qێ{C���]
n����T,���`ߴ�͏G]\1��1&�֧S^A��㾈R(@�M]��y��
9+;��4��9�(mE 0��@+Cr,�`E�L��
�H�(�w���c(��Ԇ��
�i�0�+ky� /�
��f62��XL$�
����KE���TK1��jCôEôX�}dR
A�8
j��f at sky��@ ].奓R^&��5Ϥ
�rI�m)_*�AZ��at#�>�:���dx�5'=�C�D�E���Q!�f������6�3�:51mjn��
.� ���ea��q/1:�q��g{
+
	Ƹ��Y�	��µ���p^l���_s�T5@ ��Rw`�bIC��������lC��r�h�e��0��R	�M��4ƈ�3ϞȦ��p~�]LyZ��,���<��²����u�����23\t*�V5�&�E���8ڄB�P�A�V|M�B%����H��̻��.F2Ň�#����^|'�k��t���ݗd�gUw��Uw<��4DZKR� �%p��lP�m)c@����%O꒧P�1%
h躰edaغa��z��?l@E�'�\!�O���R��uu��j}!-�`a�ˇ�E�"�"SF�Ǝ���[�Cj%�Dc꜖i7����߷��q/��<�
�+��?F�lf�8U!V����b0ȧpE��	Ј�r�Q�:/���B�g;{FR��
x�%B��� .s�Y�lR�du���m~7�E]���D�5d�)IƇR�-I���
��4ll{�)�R��P{�W;�Q
)
ǡ
� �Ӗ$1ek�=�S��	t;H#�S��;��f&��
+�~:�]���!��;Mރ'��
u�Y�K�th�嘮�3����������?�&n�яE�n<��D�nҌ��W�`u��d�t�0��8���(v�$H)�H=�*�Y���l�Ç7�x.o��{��_�W5D�;�e�S��!�3�ۼ>��������p )�|	����
>[��$e�n�)�����g�6��N׏��~�cM6�$����7�)^�5���)

�� �^
+endstream
+endobj
+359 0 obj <<
+/Type /Page
+/Contents 360 0 R
+/Resources 358 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 356 0 R
+/Annots [ 357 0 R ]
+>> endobj
+357 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+361 0 obj <<
+/D [359 0 R /XYZ 89 770.89 null]
+>> endobj
+358 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+365 0 obj <<
+/Length 3120      
+/Filter /FlateDecode
+>>
+stream
+xڥ�r�8��P�2T�X���{��N�3�����ښ�%R6|(9^��v� H��T�E�F��/4䮎+w����ū����6Y�ǫ�a���$�6Q
�b������u��}���n�NYR��u��y/چ@�žl$��n9^��s�������k�+�ֈ6I������
+ ��r7A��
R�
+� �������n<g��6�G�nOja�ɇ��v��+��C���MA��aW	y*���
��d���W��mڞ�vO�OBR�ڽ�
�ڏ���^�0�s��BJNl	s���T��W��R��`�W��,�h���#Q�m�E�D]�_E
���e�O�D}�x^�m'K�'�
x^��3և���_�����<��p3ds�H�t������6��s�7�~����{�
+t��󇛻�Q��(��
oLtc�Α/7q�m�MIP:8hX8��?�����H��ʪ̥�

M���p��G�\&(z}8_F.J�V�P��~��rO���,ߵ(v�6R'���:�BH�
$���s�h�() ��ZO(=l�f_
EID43j� ��3`��5c�z۬C� =�;q���
O!��6+�)OӶ D�8k�a
sb�U?��� e�
��z5�x)X�y�r��h�|�(�ni��l�kT��
[;E��
���?���1:.l��R�ޕ`�Ƒ 6n���a@�u
+]�`��r_�
��-�"w�D�
�g�zM��m�\F>�|�96T�8�����@˲�T{c VU/��m@,yE݅#B�9��Q�!�BgWҷ+�U�W� �G�FO��>R4NJ��.������s�*�)U�+׍�{�-i�-�2�N��
���VcZ���:C���B
p��CN;PG¶��:���(�G
+���I^>p�|��
LK�%�
��:�I>E<��E"�v?[�$U
�=s%��9G�O���/Iba�$
?��V�W��{��G�P��a~N�8��mƎ��/M��}lg��VV�W�	q�K�4C��u"�2�>X���s^r�ſُ!X�n��ڬ�t�r�b
&y>;�/��G�|��3W5%k0�=�ǹ�UR-�4�c
�;�����FR;�x�J`D�-�� �M��S��� ��{����c�u Z&� 	`)�Yg9��˜�`�XP�������OA¬#�n�$����
��J›��׺
��J��叄��v18[)��(�E
z��e^Y�_r.ged����R�~
��I�fLA���g���&߿�y����{ J�o���2	9��c9�D�	��۪2����3%-01��:6�<�4:�r���44	�4z:Ǵ�h8����^�G
Ŏ�%���$�P�q�@g�m�&I3̅�h?��� ��
�H���>:��œ.�L��j�WSI�7�h�Z'����Y
��<8�yp&\Ud1D������`���?5&bdB$:jp.��5O�A�
�|)�"����l�|�1*�GЄ�
XN�,
�[��q?����w�����>���]�
3][3%
zR8=�OYۑ�H'8�)	[�S�T����C�� ���OO�C#�
�~C2�0�Ր.
���кū�*�ڪÉ��rZL��F�w����g�J��u�Gu�ȗ:܅�����
�h�:)sg�HQ���i
�����'�_�{����kt�|
����i������������_��!���Vw���te��s�#>hX�zm�5K T�
0�z��\�CcG �%$�y�K�+�Y�!�5�`��Y}�;-�
�m���V_����
M��up��9c��)��q	M��h=��
+�D9T¥J�\E�/���Ҡ��$���#���@�t�	z��Ч��<E��&
f'
+#��K5�(�ᤖ���2
���VQLIBSj2.�ˢ
6?��!�r
��S4�چ�$���EW�X����O�����Q���*���T6f�����<�D>�򤼡���Tޜj��Z�	��V�;�X�@�L�?���_�?V|�7�t]�sųN��.ݘ�.a�ֲ�F�T��KF��Ƴ�ȵ�ž�>�=^g
�xc��:m׉�
<A��� :��"�e2c�:}��e$cȗw����%�t�e�4�]��$
ԍ���‰�
+�e�Rh1R�}C0ucA�)�
:h�� X��mI��H�f������h�|K�#8��eu�a-���I-�}8��1Cd�콟��$�
� �֢����m���mĞ��(��VfrI�|�UK,��B�GT��f�� j��h��B_��x��j��e��
]n��G�͞�<����
���V/��o����w������=�/'��l�A�ty#M�	]�KW5�.����
+���0��@����:b��9*��
zK8�\��JC�Y�
�~�EN��Lҵz��.�6��+~`�����
A'��p�O��G�]*KF�]��t:��S�q�} �0��Y�8,^H�"�ؿ�
,VcU}�Nx�
+���}]�T�ta�����
����ZE{�֌�v����*���ͣz'K�Sɉ���:$?�&��l�F�^E9h�X���]f�Ak�I�%c݋�Q͙�����6�5!V9~|
5��#�X��
�
��k�.�A�h7P��|ڮj���g�/j��]��Q^��9(���Bk���
��Y��
�y�D
c���*ԕl�U U�+�8CF%�ѓs��&b�9�X؏8Wdz���>�35�|��@���o
q�,U.j�g*��')�|=��O����t��]����XS�
]�7������S�w�
 ��$�
���^L
}���M�*���^��~��&�˜�Ԫi��j,��&�T�)�D]%f�Y��Cġ��`�����9�㳇D�2���~
r�S�Fj�d��3>��0��8@�y4ņ��}fJ^�Ql�t6p�������B��.��M�������x�%A��*	�
���L�����o��.��A������Z��J>��u>��D�7f�(�gJ�m<��e�{~(K�+m��J�~����ې&o�4�!�����{�j7
e�
7{��Fh�='�ƍ==����n�y��K����
-���6q�k���^��K�?�jPOd���:X]�p�}�
�K�s
+endstream
+endobj
+364 0 obj <<
+/Type /Page
+/Contents 365 0 R
+/Resources 363 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 356 0 R
+/Annots [ 362 0 R ]
+>> endobj
+362 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+366 0 obj <<
+/D [364 0 R /XYZ 89 770.89 null]
+>> endobj
+363 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+374 0 obj <<
+/Length 2504      
+/Filter /FlateDecode
+>>
+stream
+xڕYYs�F~ׯ`�e���}d�
G���e�I�*��$�68
���~��!�S�2g�g��=_����aa-�\������ElƁ,6�El-B/6� f��a�?6�,� 2�8�MD}��qs��Y#��ns�ו
,ka�~�
������H����2�8Z�hQ��
~�����W�Д`j�m���:[ڶeT���	m�H�8p��j����KXp^���B���l!F�m�l��FɊ���iִu�]:�ѵ�%�O��?W��P��QK�7��Ա�eI3�k�4��IǺB�s���){V�]���\k-n�+c���l�2�Z������,}U��3���j^���*���'�p�x�
���
�S�,c�
+�+�yq����x��U����L�~��|�������vI��r�hU]deB
+��8W]͌:;<�
S�i������72�VK�7N
+�F��Ϣo�B��m�d����S���jVT���."R^^��"���
[��Gƾ�
+E�98�� �� G:
��|Fd�l ���*1Æ��nL��TLϫ���D�6��y�S�\�"��ѧ	 ���-cߑ�>��8�YR����a�$�=4� �L�˸�����%|��u�^�\���=�nޮ��z}���c��7�o�ڡq_+ƺڷ'<I�y��
+b �W�����G<�SKJ�����P>d
��Kv5 ��M՞9

@x��ij�>@�a��t�
r at fV(U��ļw-�Xs8��M�I05ؒ_0ڊ�&+�<�yBQF�1������d�
�3��ʵ
�f�a ���DS��$��2��B$i��ʓ��� v��BX������u�H­��
+�֟?z�/�~� �� 6�H�{j�㏷����<��YՇ[��s�����5�M;M�"�N���uC��q��%7���	�N���=N��~�*yC�
�<t����Y%eWl!"�V��qh���� d7G��~�,G5z]��(��`�]G����4���}���8"��1I_
a���_	���G�(
�� ~�
+�0�� 2Aձ
�7wL�<�#����bB�i\�	�f-�Id�L�9�8�Q��x��Y� �\�����w<�L�w�6j%Xc&m�*g��H6��~�|�
+Nh�cS��4��}

l�n��e� ��Gc�&��1'a'夣C�
;2�WQ|a�[D>۟Gf
�~m�$@��#���}3F�����t�������#�#wԚВ�kqA�Z�%�?េk����@�B��kg�9u4�����h���y���fd�~h�l��L$�r�q0�470ٓҚ'g�;����[�
+68�	i*E�,:��v���
�U�b�,y�0;����n�`0鶀r�J�*�n�
uk�w����m�Q��%jjL���\Ϛ�A ��#T�����>l
:\��
�B�v�8�>�
+ at YI��O���{�
+
�jڬ�exL��Qx.a�jA���:��+/r���S�
+,Ə
'������W��������ջ;�w�N���6��3�
1��{���z_�`R�/��x(w���
�s��c� ��'-��Њ���f�7�D�{
b�x��O)�&� �.H��_5t��6�9o�/HJ1_ ��������<1�b��2�{�����/^X��W�sR��@��V;�v?�W��U�޼������Ջ(q��Jv��h�)���Bџ�a���N�l����	�
F:g���
+�9s��鏐oz���A�>��L�`�J��>#,�  y  L;�
't%�u�eh�CݹA7-��{�(��1Ov�%H�v�kL�4G;�kf�Y9[�8�����DZM���cOs���
I*gC�R�V���ۻ�@�f�y�[K����d�|��j����დ��ͦV�Ij9q U0��UX3����pZ[uš$
��JK���Tt�)��]Ul�A�ۧX.ٱnyb���!Ql�#�г��{5wF�z�Z��Kc&�Q_@�.k'e�����9�����p]�g,

�<�$d�4���f�Y�3�}�ǜ�	l���P�
+-(��4p�͋��
+|�R^Q�\%
�|��&`�b�IԨ1^�<WhO�`�����f;�T�h{nE|�=Ą=��#����B�H�yz����7�Tu"6|��Kf<�DQ�`�����Lz�N�C�����
��bolc+8�9 �]V�A!��
���.��w�Ö���fĒ�Z�'��L{$����oU��V�;э�n�(rt 䁯`-/�����
]B��Ty-�xIy蒃�_A�V�:�T|���烏o���([�aG�z�/} *
Y�C��������:ɳ�j���� (=�E#
7
Îg����#p��q��o
��^h�1���/�����
���{�p�*������y7��/*��nD1�,��X+
<��W>|x��7�F'b'�O����/G�OK$s���|}l_�c�"����in`{�AN��ݡQ�����,\6��i�޻��E՟����*|	�� �]']
+endstream
+endobj
+373 0 obj <<
+/Type /Page
+/Contents 374 0 R
+/Resources 372 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 356 0 R
+/Annots [ 367 0 R 368 0 R 369 0 R 371 0 R ]
+>> endobj
+367 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [258.676 600.977 428.041 611.881]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/copyleft/)>>
+>> endobj
+368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 100.311 513.996 109.287]
+/A << /S /GoTo /D (subsection.6.1) >>
+>> endobj
+369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.6.2) >>
+>> endobj
+371 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+375 0 obj <<
+/D [373 0 R /XYZ 89 770.89 null]
+>> endobj
+376 0 obj <<
+/D [373 0 R /XYZ 90 486.093 null]
+>> endobj
+14 0 obj <<
+/D [373 0 R /XYZ 90 201.124 null]
+>> endobj
+18 0 obj <<
+/D [373 0 R /XYZ 90 167.167 null]
+>> endobj
+372 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R /F84 265 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+411 0 obj <<
+/Length 961       
+/Filter /FlateDecode
+>>
+stream
+x��X]s�8}�W�maf-����+M7��n���v<˄�������W )��,���B�{ιGft( '��i0~#��T�
�"�ra���"�шp�ZfMc���\~�>M��)D46���8ng�7��:�fl�q' ���O���{� M�[TF��.�y�W�
����H1b��C�-�#�P(US�j�J�˺�YL�p��>	�ň��!�n����ψ`���RN•�Y�e�|ٓŰ��`^)B��������6cY��F?.k�
�8$� ng��ԍ��:ә�Y˦7	A!���@��a{91�K�
R&H[���3D!Eɭ�L��^#I����c��w�[6�%���ߏ{V6z/�����Và�.�;���#�}�yU6�ۻF�M��ݦ6>t�����ZK�0F
�\��_K}eG���
;��&W�Z�1^�G���
q2�w�^��P�����l9�tXTVIlv.�7���,7i��4s�^��Ί=
m��Z�Ecvn���Թ�j����;6Ck���o����K��jg�
l�)1a������9���_�ti��A,��8��Vraa�Z�|7M?b6(;.��P���7�����	�[@��C�Wr&P�d at Is��dӄ���hn����$I��1��OSf�=���
���cAC��'	�dȚF� ��!��X��?۔�
�ى���
c
ϣ}M)?���	2��R%�sS{1@����iaNY,>
/UΟilq|cPO�8���=
X��<�t�	7q����A`L�c%]C�
ZLc���
�!O�qz�O��ə���YV������s
�S�4R�q
:1>d�Ɵ;>"��D��5Y0�k%�
�hDM�s)
gK�3�?�3*ف�SEr�E��z�b<����
�������q
���݅/L����6�U֖���ל#
� ^5#�u� ±�׮�
w��nb|ZQ�ze���[};Կ
+endstream
+endobj
+410 0 obj <<
+/Type /Page
+/Contents 411 0 R
+/Resources 409 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 356 0 R
+/Annots [ 370 0 R 377 0 R 378 0 R 379 0 R 380 0 R 381 0 R 382 0 R 383 0 R 384 0 R 385 0 R 386 0 R 387 0 R 388 0 R 389 0 R 390 0 R 391 0 R 392 0 R 393 0 R 394 0 R 395 0 R 396 0 R 397 0 R 398 0 R 399 0 R 400 0 R 401 0 R 402 0 R 403 0 R 404 0 R 405 0 R 406 0 R 407 0 R 408 0 R ]
+>> endobj
+370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 710.114 513.996 718.971]
+/A << /S /GoTo /D (subsection.6.3) >>
+>> endobj
+377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 688.073 513.996 697.049]
+/A << /S /GoTo /D (subsection.6.4) >>
+>> endobj
+378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 666.152 513.996 675.128]
+/A << /S /GoTo /D (subsection.6.5) >>
+>> endobj
+379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 644.35 513.996 653.207]
+/A << /S /GoTo /D (subsection.6.6) >>
+>> endobj
+380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 526.815 340.256 537.694]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) >>
+>> endobj
+381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 516.763 513.996 525.739]
+/A << /S /GoTo /D (subsection.7.1) >>
+>> endobj
+382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 492.939 230.688 503.818]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag) >>
+>> endobj
+383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 482.887 513.996 491.863]
+/A << /S /GoTo /D (subsection.7.2) >>
+>> endobj
+384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 459.063 188.187 469.942]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag) >>
+>> endobj
+385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 449.01 513.996 457.987]
+/A << /S /GoTo /D (subsection.7.3) >>
+>> endobj
+386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 425.186 293.88 436.065]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag) >>
+>> endobj
+387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 415.134 513.996 424.11]
+/A << /S /GoTo /D (subsection.7.4) >>
+>> endobj
+388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 391.31 229.144 402.189]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag) >>
+>> endobj
+389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 381.258 513.996 390.234]
+/A << /S /GoTo /D (subsection.7.5) >>
+>> endobj
+390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 357.434 193.727 368.313]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag) >>
+>> endobj
+391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 347.381 513.996 356.358]
+/A << /S /GoTo /D (subsection.7.6) >>
+>> endobj
+392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 323.557 288.351 334.436]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag) >>
+>> endobj
+393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 313.624 513.996 322.481]
+/A << /S /GoTo /D (subsection.7.7) >>
+>> endobj
+394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 289.681 223.614 300.56]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag) >>
+>> endobj
+395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 279.748 513.996 288.605]
+/A << /S /GoTo /D (subsection.7.8) >>
+>> endobj
+396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 255.805 188.197 266.684]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag) >>
+>> endobj
+397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 245.872 513.996 254.728]
+/A << /S /GoTo /D (subsection.7.9) >>
+>> endobj
+398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 221.928 286.677 232.807]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag) >>
+>> endobj
+399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 211.876 513.996 220.852]
+/A << /S /GoTo /D (subsection.7.10) >>
+>> endobj
+400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 188.052 221.941 198.931]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag) >>
+>> endobj
+401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 178 513.996 186.976]
+/A << /S /GoTo /D (subsection.7.11) >>
+>> endobj
+402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 154.175 186.524 165.055]
+/A << /S /GoTo /D (interfaceppl__Generator__tag) >>
+>> endobj
+403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 144.243 513.996 153.099]
+/A << /S /GoTo /D (subsection.7.12) >>
+>> endobj
+404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 120.299 312.141 131.178]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag) >>
+>> endobj
+405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 110.247 513.996 119.223]
+/A << /S /GoTo /D (subsection.7.13) >>
+>> endobj
+406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 86.423 247.405 97.302]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag) >>
+>> endobj
+407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 76.371 513.996 85.347]
+/A << /S /GoTo /D (subsection.7.14) >>
+>> endobj
+408 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+412 0 obj <<
+/D [410 0 R /XYZ 89 770.89 null]
+>> endobj
+22 0 obj <<
+/D [410 0 R /XYZ 90 627.618 null]
+>> endobj
+26 0 obj <<
+/D [410 0 R /XYZ 90 595.459 null]
+>> endobj
+409 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+454 0 obj <<
+/Length 1007      
+/Filter /FlateDecode
+>>
+stream
+x��W[w�6~�W��B�mY�c�lN�,K����8Xo�&�l6������es }�F����]��	���۠���P��\��)��H�X����d�e��B�l��W�{�����̵n���)����D�Ѭ��
�?"JB%ы]4C�����-�]�o��j���y�YF#’%�Ɯk��tx[���V�J����:ڨF,"*�P��8v�A�׹^m
S��댗Ũ���
�r���^cl�-�:�
ڜ	�m��c��w���L�av�B������
+��z� ?/�vj͹�޲y
4<�qx6П��þ�]>N��rp�����֎�
+��ـ��
��^���A�7P3o�I=J-��ZyV��Bm�g��(DZ:+��r��ߑڅ�w*�Ja�ϊغ�n
}a��:�G;!���B���
��]\��S\�E�еF������>��ee1
�z��o}ǒ؇
:��2�*\ 8
y1q�Mh�'�:Y��j������v���H.����?�n�9��(
42����ޛycʧ��l�fņ7#l�fDÛi-o�����{�G�
���0'�ʐ(��,��i��gI�8g���Y2��1��{��=�_��UZ��G��Er���Pe�,͛%���h���\CAD�7M�ݿ���#/���n�Cxl�����CF\	n��6WPm$&�W��[8Z�¯�̖S�?���
-g��S���Ȁ��5@�	ŕWM�W~��v�b�L�ù���
�p�ӑ�2�� 6
&�� ��dp�W�ԋ��Y��?Vi�ڄyְ����|�=/y��p��ܺd�0n9��H��M-��&[���j�Kˍ�QBbek�g>eI���f�N6{�@�n����յA_{�Ж�eATJ[�JJ���섺������t�����%�c��)-������1�f���c���Zx^i	s��R|���p�YA�ݔ�|�w!��:~�������r��ń ���ޜ$�
+��]q=++�d
��y�#�_�E
+endstream
+endobj
+453 0 obj <<
+/Type /Page
+/Contents 454 0 R
+/Resources 452 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 356 0 R
+/Annots [ 427 0 R 428 0 R 429 0 R 430 0 R 431 0 R 432 0 R 433 0 R 434 0 R 435 0 R 436 0 R 437 0 R 438 0 R 439 0 R 440 0 R 441 0 R 442 0 R 456 0 R 443 0 R 444 0 R 445 0 R 457 0 R 446 0 R 447 0 R 448 0 R 449 0 R 450 0 R 451 0 R ]
+>> endobj
+427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 211.988 718.971]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag) >>
+>> endobj
+428 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.7.15) >>
+>> endobj
+429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 674.219 222.897 685.098]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag) >>
+>> endobj
+430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 664.166 513.996 673.143]
+/A << /S /GoTo /D (subsection.7.16) >>
+>> endobj
+431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 640.346 202.952 651.225]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag) >>
+>> endobj
+432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 630.293 513.996 639.27]
+/A << /S /GoTo /D (subsection.7.17) >>
+>> endobj
+433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 606.473 226.384 617.352]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag) >>
+>> endobj
+434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 596.42 513.996 605.397]
+/A << /S /GoTo /D (subsection.7.18) >>
+>> endobj
+435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 572.6 199.635 583.479]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag) >>
+>> endobj
+436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 562.547 513.996 571.524]
+/A << /S /GoTo /D (subsection.7.19) >>
+>> endobj
+437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 538.727 225.846 549.606]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag) >>
+>> endobj
+438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 528.674 513.996 537.651]
+/A << /S /GoTo /D (subsection.7.20) >>
+>> endobj
+439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 504.854 209.408 515.733]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag) >>
+>> endobj
+440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 494.801 513.996 503.778]
+/A << /S /GoTo /D (subsection.7.21) >>
+>> endobj
+441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 470.981 350.557 481.86]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) >>
+>> endobj
+442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.759 459.025 513.996 469.905]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 447.07 192.243 457.949]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 448.973 513.996 457.949]
+/A << /S /GoTo /D (subsection.7.22) >>
+>> endobj
+444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 425.152 323.439 436.032]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) >>
+>> endobj
+445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.411 413.197 513.996 424.076]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 401.242 138.375 412.121]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 403.145 513.996 412.121]
+/A << /S /GoTo /D (subsection.7.23) >>
+>> endobj
+447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 379.324 285.821 390.203]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 369.272 513.996 378.248]
+/A << /S /GoTo /D (subsection.7.24) >>
+>> endobj
+449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 345.451 191.146 356.33]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag) >>
+>> endobj
+450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 335.399 513.996 344.375]
+/A << /S /GoTo /D (subsection.7.25) >>
+>> endobj
+451 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+455 0 obj <<
+/D [453 0 R /XYZ 89 770.89 null]
+>> endobj
+30 0 obj <<
+/D [453 0 R /XYZ 90 318.801 null]
+>> endobj
+458 0 obj <<
+/D [453 0 R /XYZ 90 286.645 null]
+>> endobj
+34 0 obj <<
+/D [453 0 R /XYZ 90 286.645 null]
+>> endobj
+452 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+479 0 obj <<
+/Length 1707      
+/Filter /FlateDecode
+>>
+stream
+x��Y�r�6��+�+5SBx �]G�I��N�H2Z�dN(R�#
��{A |Iq�XΤ

A�}��sI�l
켜�~9���D(T8�k'�N�G�
�[9�]���#c�urU���ԣ
��YR%q��WI��8[��<�����.��/_M^\N>O��Ѳ8
+Bg������L�r0bQ��4���O\S�b���1�\
���!(�Z+���FL�нm4�7�!0��?�@#�s!v<�#�GZ��Ζj�r������~"��B؀"ʘ���|����`K�UfZ9����7
T
v�t�X��x
����˔b7OV0&_Q1�N*
+_��	�:
�'T��zQ�:�k�g�2��ƽ�<����bJ�k�UX�[�/�]4����ub�[�m]Vzte�,�4�+;�΋)
\i���lJ�����Q,��R�8=B,>`L�'��|
+�M'�O�x]Y��<�(e�(�:[%�fٲ8;{��!���8�wzP�p]�C�YT����G4�^�*+
-�2:qi#`���r�2+f�+_5ì�^AD ����db��0-��dÏ�T!�*/�b?0������<���؉1"%�g���uuR�>q���L�q�빹��d�A����9�� ?R5[�Y�W
��Q�fw�hA�
+�(^�I�"]����c�G��Ziz�`� 	J�6;���z*�gm+[X�ۓ���\�Uڝ-(.봙*���@�?*�}Wp�G>JO�Ի���"��]1�B�\D
;<�U�����D��"�푿Q�
��c���h������T�B�����jW� 5�[p�W5#4��?72M�3d�3 L=�ف�gqf�h���
Z�p�
.��޴\{����|YoeV}�L��s�c!�:l���P���a��"���� @Q�X��c�!
鬶�F�6���Zu`��υ
��W�g��w�N��)��+'8�6�n�XK�
i�6�(���-mV"����>vE� S
+L��˪.����8��
fWxq~��������^��,���|�������� Ep�
�'�J���łl��Bƫ�QՖ��@
	8Vä�C���A�L#���{��&��*��2k:z6�
+�ڄ��\
4
O������u���e��\�

%�1�&ՠ�

+D���Q����
+m�H�H��G���S
 
+R�׍��`H.��QS�od��<��mhqg�����ѽq�;Q��X�����
�R̈́����E\{��j�V+@ܸ��-V�uk�*�Ā1zU��
 R�9,6���n�G�N`&��J�3+Dq���w���n�&����]{+-��@��%��2��c���d?4�����v
xQ[����5^: 8$�1q�!�^��@���2
��B)Ɛ�l(Ծ
�J�!GJ1"#����v����9�Z���z���9]�
IasN�
"���{��mԵ�� ��ds�`>�KY�� �m�w{����
kX���l5�8̛
cő�v���� ;�>vbז�a{m���5��P�����~�jr�Ns�N~ E-��?.C�
���M
o����_7��4S�JY��޳���Ym�v��pR�k@�P�8�B��
��O�
���h�6�|$�������6�]՛Rf�̷�G�{8�K��=Ͷw4T��b�׭�9&Hj���
�� �͊����>h&f�[������-�
+endstream
+endobj
+478 0 obj <<
+/Type /Page
+/Contents 479 0 R
+/Resources 477 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 495 0 R
+/Annots [ 470 0 R 471 0 R 472 0 R 473 0 R 474 0 R 475 0 R 476 0 R ]
+>> endobj
+470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 661.375 181.496 672.279]
+/A << /S /GoTo /D (group__Init_ga7c98bac1ccfac398657571409a3fcd9c) >>
+>> endobj
+471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 634.343 175.957 645.247]
+/A << /S /GoTo /D (group__Init_ga4af2931282f6a5f1b3444fb8e833d6a1) >>
+>> endobj
+472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 607.311 237.396 618.215]
+/A << /S /GoTo /D (group__Init_ga635128363efd9f4c8c63e21702f40183) >>
+>> endobj
+473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 580.279 254.542 591.183]
+/A << /S /GoTo /D (group__Init_gafdb2c887a3a2d1daf54a764d0d7f7f76) >>
+>> endobj
+474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 553.247 224.654 564.151]
+/A << /S /GoTo /D (group__Init_gaf090a4178ad2e0dc0ea185961e13b3f1) >>
+>> endobj
+475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 526.215 240.703 537.119]
+/A << /S /GoTo /D (group__Init_ga234d52733263ece8ac36c980a80292c9) >>
+>> endobj
+476 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+480 0 obj <<
+/D [478 0 R /XYZ 89 770.89 null]
+>> endobj
+481 0 obj <<
+/D [478 0 R /XYZ 90 721.073 null]
+>> endobj
+38 0 obj <<
+/D [478 0 R /XYZ 90 721.073 null]
+>> endobj
+482 0 obj <<
+/D [478 0 R /XYZ 90 679.937 null]
+>> endobj
+483 0 obj <<
+/D [478 0 R /XYZ 90 570.075 null]
+>> endobj
+484 0 obj <<
+/D [478 0 R /XYZ 90 498.84 null]
+>> endobj
+485 0 obj <<
+/D [478 0 R /XYZ 90 432.464 null]
+>> endobj
+486 0 obj <<
+/D [478 0 R /XYZ 90 408.03 null]
+>> endobj
+487 0 obj <<
+/D [478 0 R /XYZ 90 408.03 null]
+>> endobj
+488 0 obj <<
+/D [478 0 R /XYZ 90 316.73 null]
+>> endobj
+489 0 obj <<
+/D [478 0 R /XYZ 90 312.247 null]
+>> endobj
+490 0 obj <<
+/D [478 0 R /XYZ 90 222.919 null]
+>> endobj
+491 0 obj <<
+/D [478 0 R /XYZ 90 218.436 null]
+>> endobj
+492 0 obj <<
+/D [478 0 R /XYZ 267.991 151.281 null]
+>> endobj
+493 0 obj <<
+/D [478 0 R /XYZ 90 144.641 null]
+>> endobj
+494 0 obj <<
+/D [478 0 R /XYZ 484.685 77.486 null]
+>> endobj
+477 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F24 173 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+499 0 obj <<
+/Length 842       
+/Filter /FlateDecode
+>>
+stream
+xڭUY��0~ϯ��D\۱��7�E˱��HH�P�u������}�G�v�H���{f���<&h�z�XEˋ� ��d��H�q��i��Ō,~�ޢT�*	FN����������E�W�]Da� ���r���o?ڀ�-"8U9�w�*�Y
+�=��>G$@!�	��� ,�'�(Ŕz3��EB	!qi�E�X
���� ���٧D=��a���CT��pv��ݙ�R`���	��)?�Y6Mѕ�)Τ�H�����Xe�(��벅о�߉ ��
��-wFo,��D���
jA�
����b����n,/䜣	�+�a�0%����]
���[�s�V,��ҝn�ط ֭�uP����u�_�{�j��%4�H�^n}2;J&��$ۣ&��:�,��֭Ҹ[���0^��춾�-*���sA&����j����gbs�s��z�����mkgU��9q��}��v 8����{79Ωx�\H�
|�����D���VȈI
+�vP
\P'�U'��]ߘ��X���{��\�S�K�c���;���� ���C�M����.6QSם��ӑX�TF[Z
���ݽցͦ�4��[�@�6uU�i����೬�n ?t�}��<; �c��t1Ij�g9�d�oM
���"����df�3,�{y��=!4�vs�v��MP,/������.���
GH��4wc9'0�t �/�O�����/̮/va���E�.(tm
T_��OB�a�}(L?L!˱�
*b�L�
&2\����E` �PV�ï1�w���
��X�c;n���l���w�6;
�}8~'�,�D��|��U݄\J��ݓ���<�
+endstream
+endobj
+498 0 obj <<
+/Type /Page
+/Contents 499 0 R
+/Resources 497 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 495 0 R
+/Annots [ 496 0 R ]
+>> endobj
+496 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+500 0 obj <<
+/D [498 0 R /XYZ 89 770.89 null]
+>> endobj
+501 0 obj <<
+/D [498 0 R /XYZ 90 721.073 null]
+>> endobj
+497 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F60 176 0 R /F72 198 0 R /F24 173 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+517 0 obj <<
+/Length 1577      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~�����@��*�{k�dH״]�um�6�h�%W�3��~�I�-'Y�+�`�����|$��8�
+p�����`�(ƁB*�Qp~(
�\!��4�0��c<|?�f��2ͳQH
��֓�iv5
+�b<�d������|�e@@>��'P,��|���0�*��)�m'�N���l�� {hQa���@%AJZ#�GB6�r�sD��c��b
1�x
��u�"-8)G1�n��dR!y�����h�J!�$H`Hy)�O�� �?M�G�i��K�\q�)<��
��޽�xxzv��ͺ�z�XZ�mA'E ]�
:JQ�i�$�o�=w�ZV��Uӟ�Y��Y�\]�Q��un
��R�:
��6+2$ٮ��8y���i+�{�8�U�'��f��X�~~�[J��99~�h���Sp�sJN�o�?���#�17ik'�C����y;�a�(5
�*q���[F���i��t	��@TZ�wu�
�p����2o�94�O�d�����tRj�q�M=�<�"h�vS���\g�,�d:�� \�r���yU�ݻͯ�L!
��qDb�=Zf�
+TݵoI����X�.n��η_8s�s>b�oFq:��w�S]-��\�OdewM���OO�Ә_�c�
+=��m|
��m������Z�'?l�n�PsKϖ�m�{s���m&$F�)��˜�����oz����/��08��C��EZ��ܭE0Y�
\��WA�I�������p:k�(�+�'�=]��m��U�Z�ΦL�&h�I3��HA�Evxu�I���!GA ŏy(R�΂���}�$A|��q$���T� ,S:�S���rR��j����U��
'���|���I�BY%Y��w"t.��̹=K*=�5K�ER|��~��3�%��ojL��M	�Vن�i�:���D��
�%�i��4Ķy�j�o���3M�
�[�;)��
+O]�Y�g1�3������ٺ�a�ྺa�����B �~@e��B�D���x��u��lT'4���b��
&�bNX��ő����2�Y^|�[N�kg]�Ѥ,sH��5/͙5�%�ڞ�������2
+���.[�s(
+].4��Y�f_G���
F4vy �,��yR���Q�[-mف��E��l�>�pX�О����b��L�r㼺v z�v��}G�6��5R�l�38+�ourLP,X���

�D�f �Qk�D�
+")��	�n��G(
G��u�p�Hߪ
+pE]�a�-$+b����5,Q6��w�D����4���6	7
�ݥc�ܷ�[s���Y�_C��b��c���j�˻ЫL�"�*����L:��~�|f�EW0�D���z��%4FRɎ� #�)؝�=lr-
f�K�AWA6����5^��-u�r�φ�������`]�n'f����c$�\��5N�k^'��2��o�M�ti��d��(u��
�?�'I����&][�j�7�T��L�e;�����6�{��&
+���]W�������qL����l?���\օ�y^Ӟf�d7<�^s.���Y�@��!*�v�j߾�?���s
��?� Ve

+endstream
+endobj
+516 0 obj <<
+/Type /Page
+/Contents 517 0 R
+/Resources 515 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 495 0 R
+/Annots [ 503 0 R 504 0 R 505 0 R 506 0 R 507 0 R 508 0 R 509 0 R 510 0 R 511 0 R 512 0 R 513 0 R 514 0 R ]
+>> endobj
+503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 659.273 213.038 670.177]
+/A << /S /GoTo /D (group__Version_ga79bd3696a302bb721ef8168fa5d650fb) >>
+>> endobj
+504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 630.596 251.782 640.523]
+/A << /S /GoTo /D (group__Version_gae19dfe022c51c874d905e2a7c81c18f1) >>
+>> endobj
+505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 600.942 251.225 610.87]
+/A << /S /GoTo /D (group__Version_ga8458e58a5e857de11c35ce3076a70ab8) >>
+>> endobj
+506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 571.289 264.505 581.217]
+/A << /S /GoTo /D (group__Version_gabadfeba0a415d210cdd6d7309365e800) >>
+>> endobj
+507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.731 541.635 244.032 551.563]
+/A << /S /GoTo /D (group__Version_ga7a529f51bfebdd4b3e69c866dced9bc1) >>
+>> endobj
+508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 455.765 204.032 466.669]
+/A << /S /GoTo /D (group__Version_gabdf8f4e9416010573d48e21cf0584762) >>
+>> endobj
+509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 426.112 204.589 437.016]
+/A << /S /GoTo /D (group__Version_gab51f10ea37de5299e9bc840afa206d4e) >>
+>> endobj
+510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 396.458 212.639 407.362]
+/A << /S /GoTo /D (group__Version_gaa50f472bf6d1869a2fc1500d2fdf8213) >>
+>> endobj
+511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 366.805 197.387 377.709]
+/A << /S /GoTo /D (group__Version_ga676f27ad949159a3b79577f78870f60f) >>
+>> endobj
+512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 337.152 175.808 348.056]
+/A << /S /GoTo /D (group__Version_gac6abee034f6ac000f15d1206fdeb8316) >>
+>> endobj
+513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 307.498 173.736 318.402]
+/A << /S /GoTo /D (group__Version_ga63fef7041da34ac5bb372a2535d99377) >>
+>> endobj
+514 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+518 0 obj <<
+/D [516 0 R /XYZ 89 770.89 null]
+>> endobj
+519 0 obj <<
+/D [516 0 R /XYZ 90 721.073 null]
+>> endobj
+42 0 obj <<
+/D [516 0 R /XYZ 90 721.073 null]
+>> endobj
+520 0 obj <<
+/D [516 0 R /XYZ 90 679.146 null]
+>> endobj
+521 0 obj <<
+/D [516 0 R /XYZ 90 647.758 null]
+>> endobj
+522 0 obj <<
+/D [516 0 R /XYZ 90 618.105 null]
+>> endobj
+523 0 obj <<
+/D [516 0 R /XYZ 90 588.451 null]
+>> endobj
+524 0 obj <<
+/D [516 0 R /XYZ 90 558.798 null]
+>> endobj
+525 0 obj <<
+/D [516 0 R /XYZ 90 475.638 null]
+>> endobj
+526 0 obj <<
+/D [516 0 R /XYZ 90 475.638 null]
+>> endobj
+527 0 obj <<
+/D [516 0 R /XYZ 90 444.251 null]
+>> endobj
+528 0 obj <<
+/D [516 0 R /XYZ 90 414.597 null]
+>> endobj
+529 0 obj <<
+/D [516 0 R /XYZ 90 384.944 null]
+>> endobj
+530 0 obj <<
+/D [516 0 R /XYZ 90 355.29 null]
+>> endobj
+532 0 obj <<
+/D [516 0 R /XYZ 90 276.447 null]
+>> endobj
+533 0 obj <<
+/D [516 0 R /XYZ 90 217.206 null]
+>> endobj
+534 0 obj <<
+/D [516 0 R /XYZ 90 194.434 null]
+>> endobj
+535 0 obj <<
+/D [516 0 R /XYZ 90 194.434 null]
+>> endobj
+515 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F24 173 0 R /F101 531 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+540 0 obj <<
+/Length 795       
+/Filter /FlateDecode
+>>
+stream
+xڍTIS�0��W�V{��K�z,KJ)
��88�	
��
��ϒ�8�0=x����-Aߣo�hr��XK&�t�4A*�XH��G71c���
q�c�%9�ѯ�����z�E'��)� "�z{�U��UtsG�=���\���)�P�8�Kt
��H�B09<X��F)��#��c�����M�׍IR����)׫��c
 ?��e�gz���6�w׶��YRA0
�\��ReX�z������d�yR2$7+����KI�LȸlL@���
+; �����
��զO����� k�a��F���ǂ�'A��99��I��h5e���ں�:�,H�7��3��p��b#�
jH� �
��L�B�õ
����vo��P���J���fD
LNm���C剫�
O��c��`XAS����r �Ό�]+)�[�$T�����	Hk3o��
�b֬{O��`�#�y��lڇGoth����t�z_��eQ>z�f
B��ͫ�$�bma�W/~y(���&6�ć.U�XA-B�>H��G��z��^�|���{O���|�0����
p�?��}M���20*[����Vmc���E�%�	�V|k�l�GOA��h��9�
� �
�۳&��p���
3��v��	N�J1'
�N��	��ي����ܥ�/�9t�V���[k8 ��M��0�g��?�Y��E��
�2wQ֟��_�Q;��0�b���0�&�3�@��ʇk������
+e�9<nS��=a����������dm���l�?@;c�0��+�{
�V�
�|��F� 
+endstream
+endobj
+539 0 obj <<
+/Type /Page
+/Contents 540 0 R
+/Resources 538 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 495 0 R
+/Annots [ 537 0 R ]
+>> endobj
+537 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+541 0 obj <<
+/D [539 0 R /XYZ 89 770.89 null]
+>> endobj
+542 0 obj <<
+/D [539 0 R /XYZ 90 721.073 null]
+>> endobj
+536 0 obj <<
+/D [539 0 R /XYZ 90 704.201 null]
+>> endobj
+543 0 obj <<
+/D [539 0 R /XYZ 90 704.201 null]
+>> endobj
+538 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F24 173 0 R /F98 502 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+561 0 obj <<
+/Length 2059      
+/Filter /FlateDecode
+>>
+stream
+x��Y[w�F~���[�$��[�}c
�!�a�0I���pڢ
� �iIv����T_$$��Ξ}�Z})�����Z����֛�/..�}l�(�g-�[�"׃�����!�? ��X�>	z����{oY����?���{=j�]|1^\|�  
[D
s�XQr��Wl�`�{
#;
�G�)�
j�sk�����0��
ʇ�2p,BP躴R^	9������^K��q�J�
 l
��l'Ԓ�i��	���4o�1��k�	!m� �P�yT��D��:k}
��.O���K��� 7W;$λ�v)w-��XFيw�m�� �
������ݻ��x>�͗����zy;��������b$�
)��O�h9���p;�.����l �Jh_k}o����q�d	�^��x�f��L!
5���|�x{;^L���������g��ؾ��~1��ζ�:]��ϧÛ��&-������)�6�����r�����b2�~
��_ލ����Fۡ�-&�c��k%ex�P���\�����Q�T �u"��+�<G彃�o�H��!���1My�I��p=�d�;nM�2��-��#�>��}�F�}�[�̴�C@�)��=Gk �@J6E$4�tm��j����ˤ���p�F�4ǀ��]�Ч���+9�{.�i�2b{�!��:al�]-��'��l@������*_���`�a�ơ�0<Cc�H�;�-�;yMHl��i;('� �n�1Y���z�2A�:���4<���X�ݓ6'���y������� ���kB�B0{�m�ڮ[DL30���J=�F{
[�up�4 �lG
粴ȫ]�S��
�e5,EV�Xa(�.�%�Ӡ��^|h(���V���]������,���`��k���P�G���7��ƽ��Y�������>0$��H�/P�l_��&u��3
`�
(�{�a&�f��\iU���� a���/�2��ahp_H�dO���d[���$Oz�d���=�
v�5�e��g%`'���~�03��j�%��oX�C����mK��� $]c�m���9�V��yXi�xHi+Gq�w��PH>�	�or�1.6uȴ�B۸b6�k�A/k4�!�Z���D7�5.a����YY��ʤO\��*KXl�f�fN�\,�%[��'l=�t?o�
+b�
5ي�Xl{ZG�ª���xT�9��r�Q��ە^Сqnޕ�r_�~��f`'�h�#�q��E��y��AP�D?�
���<� ���h�t�8�y���ڡ��A�B,'�P�
+�3i���Ål12ҏf-�J!�Y�dj�_aeɮ,�b{{�j:0�AA
+0i��9�RB�l%φD6�@ץ�.1.88��Z�ҺhH��uۧ#���u�l�n��@��|��6�L<}�w�^^-EL��*հ���G
�x���J�bԖ୹0;Yn��p�v��(��_�:Q
�築���B�^~�j�1>
�����,z-�۪�Jχ
+����#N�ї��0'w��@2]E=p
J�v�Gq�8b&
|�a�=]U�X��G ʌD���Te�a���13�m�N����!͎�L����b����"�g��Gj��Mg���y��mS�r�\0DFY'_V1[�Y�X
@�mvs= Ռ�"��{�
�C�k&W=��~�;�}�1��DB_���n���ap�����;��;�FA�!;e3�bBbB���w�b����rM�H9%X�Q��O
J��
pj������e:(��Bu��!vuc "q�n
+��9��}j9h�\Dq��ҭ��
�v�L?��p��z�iwYC��*,!U���d�7JRV�OC܌E�F���c,>�A���
�M����p��M��&�`T�۳I[�cfYV •.x��2ߚ�%�C�M��w?r�o7��s���-�O�@�>�_�	_}��<(�p����
0h�w�w&��ㆥ뒭��D��"��L} #�b�,Uw���"���u�!� v��Zb��=�.����V5��B����$t��5vS�]^ޕ��u
:�À��J������.����H�Ʉ�l@����D�������)&�OՎ�X-V���$��Q���G�os,y�
+endstream
+endobj
+560 0 obj <<
+/Type /Page
+/Contents 561 0 R
+/Resources 559 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 495 0 R
+/Annots [ 544 0 R 545 0 R 546 0 R 547 0 R 565 0 R 548 0 R 549 0 R 550 0 R 551 0 R 552 0 R 553 0 R 554 0 R 555 0 R 566 0 R 556 0 R 557 0 R 558 0 R ]
+>> endobj
+544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 660.945 228.51 671.849]
+/A << /S /GoTo /D (group__Error_ga0c0ab09a97e49f85f42c966e14cfdee6) >>
+>> endobj
+545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 649.708 264.246 659.894]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6af29a62bdfcf44dbeec14afb409035438) >>
+>> endobj
+546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.637 649.708 431.896 659.894]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a093ae02f8ceebbc40321d1eaf186f726) >>
+>> endobj
+547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.287 649.708 513.996 659.894]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) >>
+>> endobj
+565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 637.752 180.66 647.939]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) >>
+>> endobj
+548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.648 637.752 324.021 647.939]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a6aa28e72200f879cbb83a36b60644fb2) >>
+>> endobj
+549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 625.797 259.802 635.984]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6abd22c4eaabb49bcb6c654a25e402c64a) >>
+>> endobj
+550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.653 625.797 356.319 635.984]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) >>
+>> endobj
+551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.17 625.797 511.506 635.984]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a7dae659f72f654afae1c5c6f331192a3) >>
+>> endobj
+552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 613.842 348.35 624.029]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106) >>
+>> endobj
+553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 601.887 279.747 612.074]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6ab42a97917f263e8305d561f52cbd9c57) >>
+>> endobj
+554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.185 601.887 413.47 612.074]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a24fd14db2a8ae42b3abcae3288e46edf) >>
+>> endobj
+555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.907 601.887 513.996 612.074]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8bf236a519f7da9efd5f874a17d9689d) >>
+>> endobj
+566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 589.588 154.099 600.118]
+/A << /S /GoTo /D (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8bf236a519f7da9efd5f874a17d9689d) >>
+>> endobj
+556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 519.418 216.893 530.322]
+/A << /S /GoTo /D (group__Error_gad6765993c08a2ae2f0ef377f822f4d33) >>
+>> endobj
+557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.766 519.418 372.738 530.322]
+/A << /S /GoTo /D (group__Error_ga0c0ab09a97e49f85f42c966e14cfdee6) >>
+>> endobj
+558 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+562 0 obj <<
+/D [560 0 R /XYZ 89 770.89 null]
+>> endobj
+563 0 obj <<
+/D [560 0 R /XYZ 90 721.073 null]
+>> endobj
+46 0 obj <<
+/D [560 0 R /XYZ 90 721.073 null]
+>> endobj
+564 0 obj <<
+/D [560 0 R /XYZ 90 679.937 null]
+>> endobj
+567 0 obj <<
+/D [560 0 R /XYZ 90 538.409 null]
+>> endobj
+568 0 obj <<
+/D [560 0 R /XYZ 90 491.228 null]
+>> endobj
+569 0 obj <<
+/D [560 0 R /XYZ 90 434.363 null]
+>> endobj
+570 0 obj <<
+/D [560 0 R /XYZ 90 410.074 null]
+>> endobj
+571 0 obj <<
+/D [560 0 R /XYZ 90 410.074 null]
+>> endobj
+572 0 obj <<
+/D [560 0 R /XYZ 107.713 328.501 null]
+>> endobj
+574 0 obj <<
+/D [560 0 R /XYZ 107.713 300.61 null]
+>> endobj
+575 0 obj <<
+/D [560 0 R /XYZ 107.713 284.675 null]
+>> endobj
+576 0 obj <<
+/D [560 0 R /XYZ 107.713 268.74 null]
+>> endobj
+577 0 obj <<
+/D [560 0 R /XYZ 107.713 240.849 null]
+>> endobj
+578 0 obj <<
+/D [560 0 R /XYZ 107.713 201.003 null]
+>> endobj
+579 0 obj <<
+/D [560 0 R /XYZ 107.713 173.113 null]
+>> endobj
+580 0 obj <<
+/D [560 0 R /XYZ 107.713 145.222 null]
+>> endobj
+581 0 obj <<
+/D [560 0 R /XYZ 107.713 117.332 null]
+>> endobj
+582 0 obj <<
+/D [560 0 R /XYZ 107.713 89.441 null]
+>> endobj
+559 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F24 173 0 R /F93 336 0 R /F107 573 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+588 0 obj <<
+/Length 1139      
+/Filter /FlateDecode
+>>
+stream
+xڭVIs�8����m�UX-ɖdϑ�P�
a��P)�Vw�h/�2!�~��m�Eq�$����'�`�����v��8�P�)�� ÁH2�8���SH���� �)"!K��������7w����ۊ���gH�A^�>}�A�wFq�O��
+�z
�W���w�]"X�|�$!���Ǐ7�ww�w7�o�/�޺3*�\�y`$�%b�`{P눲$̏���ٳ��}'+w!�VU�U��t��C�����+�R֎ ��iMp(���AjG�^6G�Uo�"�2�AcιR��K	hԪ��ќhxl�e��Q�1�_��z�m����9�p�t�h�e�+O:��]8�Ap�
�>Xo��
+
.ֹ�.+�
^hg��c�K^�،`�
��=�q�1!8,ջ]�xR?�m��SUȕQf�kS�4�8���J�U�
%(^GCʮ�:ץu���&*�_ZҼq�VLH�$�L#"^g9&�m�/���$A���R򋉠��M3ag`
a��3��3?���glr�bA��Q����Q�uk�Bh���S�R�g��@K�YG���3fx
%		��i6ea)����U1@�q�?c
;������0bT���p�
�#i�b6a!T�A�C�`3�Bf
�Pg�d
bIF9���+?�

�
-�ٝ��
���DCG�B�yW���M`�

+1cOa^'��9�Q��yz~��QBarRC�q+tm��x직v��nMq
+b���Zlz��lO5�C�@�L#|<>��y�0G���Z8�P&���CcJ�iH^��)�=1�G��vr+f ��AB�b�N�/�]��eᄤ;ke��

�¬`������5e�� �l�p7t�Mo���+y����u�e�,�d�:�U������
����]Y�
	�U˲�ή������,�1�ng�d5��ّmb��
NS	O<cs�� �� ;	=Mq.��
[g�EC
�o�N顃�C����g�)�u�͟�L0�e�K�
�L���r�����'l��8xӀ����E'�;��9�s�Z�L3i6�w��YqE��F֐ý��6�
��{�0�����G֮��70�ڱ���?Z۩��i$�u��O��������ۙ�Y��	lZ�o6�þW�
�M�zN�БO�!�j:�l@^��� 
+endstream
+endobj
+587 0 obj <<
+/Type /Page
+/Contents 588 0 R
+/Resources 586 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 495 0 R
+/Annots [ 585 0 R ]
+>> endobj
+585 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+589 0 obj <<
+/D [587 0 R /XYZ 89 770.89 null]
+>> endobj
+583 0 obj <<
+/D [587 0 R /XYZ 107.713 711.11 null]
+>> endobj
+590 0 obj <<
+/D [587 0 R /XYZ 90 670.473 null]
+>> endobj
+584 0 obj <<
+/D [587 0 R /XYZ 90 648.096 null]
+>> endobj
+591 0 obj <<
+/D [587 0 R /XYZ 90 648.096 null]
+>> endobj
+586 0 obj <<
+/Font << /F70 196 0 R /F107 573 0 R /F60 176 0 R /F84 265 0 R /F24 173 0 R /F98 502 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+601 0 obj <<
+/Length 2282      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�8��W�vU��C�c��0۝��l�6�ڪ���bӶjl�-ɝ���
�ԃ����eO�! �@�zk�z?^�m~q�:�^L��|���
��� ~-�ϓ���QJ'�)�&�N�j:�N��d�m���3�D�O���:���j~��{�1�N�0���ϿRo	�<JD
y�z������x��
j5��K
����
c$��׊�O�z6:��5���ތ�D������-�4�J��}^���c�E
8	i�­]�5��5Ӭ�d�S����м����T�me���S~��
�2]gji|�(բ2{@�Hz���.��so�|��Q���Jê�(;�:}�VR�����FS�7y�ڗ[���߇�հ��p��
R30���SSN'���LeU�l��]~Ȭ�|��4erB�}��1k6�!l��Q�Gx�+n"O��q�
+:�m=*�z^R�Vt�d���v*l[�a_��	��g���4K�*]���
3���H�jy{����z�P;���󜋤��	�r�ס���q�G�k'��b����
�'3
+5Ap�b�+�l�z��$��8�z�J��"�k�G��`�r�,S��1�Jh�L9tk��{��mp��Z��|q�A�&������
Ӥ���^Ch�$%T
+ϗ��� B<��Q��Nݖ�P,d%����4"4�����
"@
�+��<"ә/�6��B��AH�&
I�"�����of9�x�Y���O,D�Xg	F�?
��7H{��
����qތ�8`����Z�Ô���Hv�>��M�Q�8���>1$�P
�i���V�=B�
�r�
`
'de7dE��� ���^��O
+��'
+���<t��1��'�aw���Б���
+h�g�Ҽ)sp)�Gi&$�ʬ���bc&%��Ĵ~�n���bq(��q]Peh�Ci��)� �3Ӣ�R���at]�D˵����U����$4�t��A�C(�O
�SW}�\|p_hS�K'3����+�G]O�8G�8���N%6�s�q�N�!��(&>c#��ق`н����B��A�WT�
+T�d_�\��zԘ��"����T� �[K�{�ڈ�M��+[u�t&��\��L�`	f�k9�$��
���4���Bv�uW����� ����@F-Tu(,�c�@�"_��0��0
j����v~�������տ^^}�_�7�'�\�z1�ރ��=8�9��ʈ6;�	���R�<M {�A����V��j��;Հ���^4�2;V5�h
+�� 4K������~h(��(Yc
:W�� �	@8~k�� ]١F
Q�� 

MN�s@:dE��Hw��9B�^d ���D�9�s0{Į�oJM׽�Z�!a�����
nAȀP>q�H!Q���C��a-t#At4|%��Ȩ9z#c(�m;�(Y@��?��ۋ��^��Q�N�]���<"!��B�	����������xs�����?��z7�����H� �E�S{4�3$b���"�,�0
G�
�,��y_��Ar���|���C
���&j����;��6�r	���+�
N�Zmw[��OhnX� �EOD��Z��� �g57�'BF�ġ��`�i?3H�~	4a0��<M�����׼��&)#��_�`t��B�6I
���B�<�
mNNޜ�tX-���!��&d�}���z�XC
P�^�՟���2O�:
]�MH����4�_Tu���8
���/G�+�N?>�B���Z7��Ɇp��9��'Fϩ�G[[F�ں=V��"<�2�w�f�>�����%��v�OI�Z�6�(
D�K��DD�:r;a��1{�vc�O�
c��|�1	�m�2��iP�i֊vbSk�UjU�8���B���m[�9�_�h/|
z�v�0�� =�#,`�{�=�[��(Ǣ���
���5R��Bqe�GO�#��`����DH��"�x�
Z������,�-ֵ��Ut���;Kqn�`�e�e���J�F"z];-�p�-�k��
+{c*:�: 
4��бKH:�j�c__���
�oB@�߄��lT/��`�^�p�[v�U�ʼn^i�	�����⤋��
�K��c�hQg�6���8� �f��<�$������k܌-3��T�_��n~�M�C
A�g?�,+ʦ�a��
��Ƙ^��{5�ͫG�0=F�6�!�Dm֬��w��w�u��5�
{�vq49���vy�`�w��d���)d�����j`�/ ���pFw�_�
-��z'�W98���� jË
+endstream
+endobj
+600 0 obj <<
+/Type /Page
+/Contents 601 0 R
+/Resources 599 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 618 0 R
+/Annots [ 592 0 R 593 0 R 594 0 R 595 0 R 596 0 R 598 0 R ]
+>> endobj
+592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 660.943 193.122 671.847]
+/A << /S /GoTo /D (group__Timeout_gaf0d33c5ec6461b246420cebe2d6866ed) >>
+>> endobj
+593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 633.048 200.863 643.952]
+/A << /S /GoTo /D (group__Timeout_ga3ebabd1a7396005fadcd08efb53c1f58) >>
+>> endobj
+594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 605.152 250.127 616.056]
+/A << /S /GoTo /D (group__Timeout_ga93f815a338ce597c6ae3e7b2018d962d) >>
+>> endobj
+595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 577.257 257.868 588.161]
+/A << /S /GoTo /D (group__Timeout_ga7e11189e03e9d1452b16e24dae5d6bc3) >>
+>> endobj
+596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.829 307.959 482.396 318.863]
+/A << /S /GoTo /D (group__Timeout_ga3ebabd1a7396005fadcd08efb53c1f58) >>
+>> endobj
+598 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+602 0 obj <<
+/D [600 0 R /XYZ 89 770.89 null]
+>> endobj
+603 0 obj <<
+/D [600 0 R /XYZ 90 721.073 null]
+>> endobj
+50 0 obj <<
+/D [600 0 R /XYZ 90 721.073 null]
+>> endobj
+604 0 obj <<
+/D [600 0 R /XYZ 90 679.937 null]
+>> endobj
+605 0 obj <<
+/D [600 0 R /XYZ 90 650.307 null]
+>> endobj
+606 0 obj <<
+/D [600 0 R /XYZ 90 594.517 null]
+>> endobj
+607 0 obj <<
+/D [600 0 R /XYZ 90 549.062 null]
+>> endobj
+608 0 obj <<
+/D [600 0 R /XYZ 90 492.195 null]
+>> endobj
+609 0 obj <<
+/D [600 0 R /XYZ 90 469.819 null]
+>> endobj
+610 0 obj <<
+/D [600 0 R /XYZ 90 469.819 null]
+>> endobj
+611 0 obj <<
+/D [600 0 R /XYZ 90 411.227 null]
+>> endobj
+612 0 obj <<
+/D [600 0 R /XYZ 486.978 311.112 null]
+>> endobj
+613 0 obj <<
+/D [600 0 R /XYZ 90 304.472 null]
+>> endobj
+614 0 obj <<
+/D [600 0 R /XYZ 90 184.042 null]
+>> endobj
+599 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F98 502 0 R /F72 198 0 R /F11 615 0 R /F8 616 0 R /F24 173 0 R /F10 617 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+622 0 obj <<
+/Length 1159      
+/Filter /FlateDecode
+>>
+stream
+xڕVKo�6��W{�
�
)�z�֦���l�6Z`�h�����KI���wȡl9I��A�p�y3�v
���~^ϮM���,bo��2�%QFx
����������)aY
B�{�p���_?����z�u��z
�9IR/�g�>S� ���0K���T{Q�Zy���gt�J���ch3o
i����V�H
�ѱ���y��x��~����v�^>ܣԅnpƒl#�E���C_J}P���}�j�|`#���~�E���̨d/;�
T_�C���T�ΐ���^j=�{Y\�|.X���H�9zf�Z�:�,�
Эkը�W�;S�Dpށ������U�N���Y��*�)�I�\��x?{�� $At��~_=[���<;?����ǜn,��lg		�s��W)	�!�b�h"�����ro��X�
+��^^���)Ih9N	
�]�
+jBM޹ ��6/e��,��m�&7U��xa��*��[\7�)��eHb�A_�5 9'i���72C'��~�@�7�clD'�+�fy?�
+!��x�0��YVb�b
%�~Y�
�6����T��sPU�T�TG�
+��M1rq5H��Z:���(����L�Ǚ�K�mu=z������FC/[�Ny�Wj��>�FX���	��9�i
��c���
�!+��[��x� q��=��趩�`bc�Y=]93H`ýt�;v��̈́��jW��F�c�>'&c��MF��1����s
��͹→YJh��f1IH"� ծ쑮e^
+�q�[�JXH�Fr#{�
F��X
�]Ιo��p/4��P�1�r�s-/����!�M�k^I�
i@�+
�=H��9w<=b辄�V�v|�����r26�eN`0eUrθ��17�HD�O��8�k:�u�M��
+`�R9��W���x
.�ON��Bܢ8"�� �ji�([�/��~h���Iw�I$O	1WDŽt�
�#���N���'���
T8��L.��LEވ�Z�Թ<֗ �'$�_��������3�
�:��$	�ᔶ���c\/����egu
з8+
�Sb�%a��CI
��ιs\�H��r'�� v�ti�
�sFk���I�Üs���G� �6Sf�d˄?���)��E�
��<b
_N!��o���,"qzzwʾ��x}�v�����~���IBh|��ښ��8T��Ţ3�-�_�_�X��
+endstream
+endobj
+621 0 obj <<
+/Type /Page
+/Contents 622 0 R
+/Resources 620 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 618 0 R
+/Annots [ 597 0 R 619 0 R ]
+>> endobj
+597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.253 696.002 511.506 706.906]
+/A << /S /GoTo /D (group__Timeout_ga7e11189e03e9d1452b16e24dae5d6bc3) >>
+>> endobj
+619 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+623 0 obj <<
+/D [621 0 R /XYZ 89 770.89 null]
+>> endobj
+620 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R /F84 265 0 R /F85 267 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+658 0 obj <<
+/Length 1110      
+/Filter /FlateDecode
+>>
+stream
+x��YQw�6}�W�m�B�%Y�ۖ6=���OiǀB����&[���	�`�P�i�������ݫ�O�� ��t~�wz�1Ak�$��"MP�5jctH,�.%�W�L�ǰ�	^%uR?�
+�e:
+X
~���w�;�&�����:7�	��w��H+����,��]w���`&l�^<H��X
��P�t;Ȱ�
��P
��w)�A�e
G\����"���ʅ{���P�W����ذ�$�Bi�Im|�z�
�i:r�Q�Uu��v��"^��/b��%<����Q툎J�#!2,�?1&�ڢ�� �jׯG��g��
+ZN��
�3E1
�әɪ4���VH+hJ �$�� ��
u)NJ��/�}]N���4�M�I0)C*�d���+T�Q
��]*��i6����?�D����*�P����`B��K�UEXk
�N	�v��)�<fM3�~�
B��i2��A>��y=��g�z�&^�OD����������莙�&wW*�Yx���΍�Vb�E����=6����T�(Ӗ���o�pU���Ns(̥�^���V94�@n6Jar�d��o}�P
����Y�e�C�ڍ9�*Zw�Er?���u(���� ���g�Oe�ا>��cMNa��G
�f���Y*�:ʇ�Q�#It�f&)��-JS��͗MA����l� 1(XSq~��Ϲ]u�[����`�d�8Z	B��;V�
��L���rX�����a5�a�3��T�v��7%0��9eJ�J��R��\�����l.�0���h�>0�w����;8�N��hE�6<[)GT
+a$u^�5K̠C�M̲��@�$fB���Q䇱ґz��*�ɞ�P�)RLk��XЕ��g��
�]b
�����e^sL�KJ!+"����XГ��/����p̢�
 ,�
+ ��:��"wR�c,��f���W�p�.WI6�'��[��mHI��2�X��P��o@��d�f�n�>�}iS�OVw�b
+߰��b{JB�k�l�� �FM�7{
�Z�aI���������'��&x�ϞN�U�8�D.5[����4��ps���T�
�4�
B���a
���0A��~���Ϧ���{;�Ы
�X�������
+endstream
+endobj
+657 0 obj <<
+/Type /Page
+/Contents 658 0 R
+/Resources 656 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 618 0 R
+/Annots [ 624 0 R 625 0 R 626 0 R 627 0 R 628 0 R 629 0 R 630 0 R 631 0 R 632 0 R 633 0 R 634 0 R 635 0 R 636 0 R 637 0 R 638 0 R 639 0 R 640 0 R 641 0 R 642 0 R 643 0 R 644 0 R 645 0 R 646 0 R 647 0 R 648 0 R 649 0 R 650 0 R 651 0 R 652 0 R 655 0 R ]
+>> endobj
+624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.012 628.97 255.368 639.874]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.908 601.309 351.956 612.212]
+/A << /S /GoTo /D (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) >>
+>> endobj
+626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.771 601.309 439.128 612.212]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 561.692 194.796 572.596]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag) >>
+>> endobj
+628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.766 561.692 274.247 572.596]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 522.075 194.796 532.979]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag) >>
+>> endobj
+630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.288 522.075 323.781 532.979]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 482.458 226.029 493.362]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag) >>
+>> endobj
+632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.999 482.458 336.713 493.362]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 442.841 226.029 453.745]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag) >>
+>> endobj
+634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 430.886 273.63 441.79]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.906 403.224 249.281 414.128]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag) >>
+>> endobj
+636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.251 403.224 326.222 414.128]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 363.607 192.286 374.511]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag) >>
+>> endobj
+638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.777 363.607 318.76 374.511]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 323.99 226.606 334.894]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag) >>
+>> endobj
+640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.577 323.99 337.868 334.894]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 284.373 226.606 295.277]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag) >>
+>> endobj
+642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 272.418 274.207 283.322]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 232.801 286.371 243.705]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag) >>
+>> endobj
+644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.342 232.801 457.398 243.705]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 193.184 286.371 204.088]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag) >>
+>> endobj
+646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 181.229 333.973 192.133]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.906 153.567 247.598 164.471]
+/A << /S /GoTo /D (interfaceppl__Generator__tag) >>
+>> endobj
+648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.568 153.567 322.855 164.471]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 113.95 190.602 124.854]
+/A << /S /GoTo /D (interfaceppl__Generator__tag) >>
+>> endobj
+650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.094 113.95 315.393 124.854]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 224.923 85.237]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag) >>
+>> endobj
+652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.893 74.333 334.501 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+655 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+659 0 obj <<
+/D [657 0 R /XYZ 89 770.89 null]
+>> endobj
+660 0 obj <<
+/D [657 0 R /XYZ 90 721.073 null]
+>> endobj
+54 0 obj <<
+/D [657 0 R /XYZ 90 721.073 null]
+>> endobj
+661 0 obj <<
+/D [657 0 R /XYZ 90 645.85 null]
+>> endobj
+662 0 obj <<
+/D [657 0 R /XYZ 90 645.85 null]
+>> endobj
+663 0 obj <<
+/D [657 0 R /XYZ 90 590.79 null]
+>> endobj
+664 0 obj <<
+/D [657 0 R /XYZ 90 551.173 null]
+>> endobj
+665 0 obj <<
+/D [657 0 R /XYZ 90 511.556 null]
+>> endobj
+666 0 obj <<
+/D [657 0 R /XYZ 90 471.939 null]
+>> endobj
+667 0 obj <<
+/D [657 0 R /XYZ 90 420.367 null]
+>> endobj
+668 0 obj <<
+/D [657 0 R /XYZ 90 392.705 null]
+>> endobj
+669 0 obj <<
+/D [657 0 R /XYZ 90 353.088 null]
+>> endobj
+670 0 obj <<
+/D [657 0 R /XYZ 90 313.471 null]
+>> endobj
+671 0 obj <<
+/D [657 0 R /XYZ 90 261.899 null]
+>> endobj
+672 0 obj <<
+/D [657 0 R /XYZ 90 222.282 null]
+>> endobj
+673 0 obj <<
+/D [657 0 R /XYZ 90 170.71 null]
+>> endobj
+674 0 obj <<
+/D [657 0 R /XYZ 90 143.048 null]
+>> endobj
+675 0 obj <<
+/D [657 0 R /XYZ 90 103.431 null]
+>> endobj
+656 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+710 0 obj <<
+/Length 856       
+/Filter /FlateDecode
+>>
+stream
+x��YKS�0��W�������c)0P
+�IO�0&qLZb�i�_�pܦ��	��IJ�]��ϫ�0
+F�և��>�i�.uQw�4F�k��룋U�U�1WѮ�z��N����N:f�w�{��!�H./@*�YW�M�1���B���F�Sf�w�c}�paJ����R�4����+$	Br;����Է
*pk

�ďmBH
2�f��n�E�Rp9Ea��5]R*�Ѕ#0n%c���)&I<�%�c��qP���(�6Z	h!r���������D�u�a�����
�3��{Q8�t�(/�K� ��,��T����XjI6�_왳�z�����1b�,.��$�]r.kF7��^R!���&Eo�*@� ����R)���|9R5�ux��9
��DJ6G�5�Ew�U��+��^��{�R�lڬ,�s�
�y�J�����?��,�`�A��$��
S`D��
R�ł4_łhP&�2`��n"D��"�ub�J�amD^8�gG�-�)I�Y��ڒ�Rl��X��*����E{�x�/�D��c�Ԓ�yk���甐ۖp�{���PC
�\���H����$S��3�a���yF��q
��%��b�Z�zȼ�ıڶLs�r�y�K�J�K�|���o`��V=6p)Hʞ{lP�����-
���P�+����L��>1�12ʞ�9F��0;�0qpAK��%�0�T�&�� [...]
]]%g(�&��}�}3
&~@/�I�'a)��
g�Q�
C�9�c�<�
п׳�E
+endstream
+endobj
+709 0 obj <<
+/Type /Page
+/Contents 710 0 R
+/Resources 708 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 618 0 R
+/Annots [ 653 0 R 654 0 R 677 0 R 678 0 R 679 0 R 680 0 R 681 0 R 682 0 R 683 0 R 684 0 R 685 0 R 686 0 R 687 0 R 688 0 R 689 0 R 690 0 R 691 0 R 692 0 R 693 0 R 694 0 R 695 0 R 696 0 R 697 0 R 698 0 R 699 0 R 700 0 R 701 0 R 702 0 R 703 0 R 704 0 R 707 0 R ]
+>> endobj
+653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 682.947 224.923 693.851]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag) >>
+>> endobj
+654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.415 682.947 384.035 693.851]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 642.891 284.688 653.795]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag) >>
+>> endobj
+678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.658 642.891 454.031 653.795]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 602.834 284.688 613.738]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag) >>
+>> endobj
+680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 590.879 332.289 601.783]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.906 562.777 255.907 573.681]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag) >>
+>> endobj
+682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.877 562.777 339.473 573.681]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 522.721 198.911 533.625]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag) >>
+>> endobj
+684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.403 522.721 332.011 533.625]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 482.664 233.232 493.568]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag) >>
+>> endobj
+686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.202 482.664 351.119 493.568]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 442.607 233.232 453.511]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag) >>
+>> endobj
+688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 430.652 280.833 441.556]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 390.595 292.997 401.499]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag) >>
+>> endobj
+690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.967 390.595 470.649 401.499]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+691 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 350.539 292.997 361.443]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag) >>
+>> endobj
+692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 338.584 340.598 349.488]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 298.527 213.845 309.431]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag) >>
+>> endobj
+694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.815 298.527 312.345 309.431]
+/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
+>> endobj
+695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 258.47 213.845 269.374]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag) >>
+>> endobj
+696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.336 258.47 361.878 269.374]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 218.414 248.166 229.318]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag) >>
+>> endobj
+698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.136 218.414 380.986 229.318]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 178.357 248.166 189.261]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag) >>
+>> endobj
+700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 166.402 295.767 177.306]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 126.345 307.931 137.249]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag) >>
+>> endobj
+702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.901 126.345 500.516 137.249]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 86.288 307.931 97.192]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag) >>
+>> endobj
+704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 74.333 355.532 85.237]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+707 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+711 0 obj <<
+/D [709 0 R /XYZ 89 770.89 null]
+>> endobj
+712 0 obj <<
+/D [709 0 R /XYZ 90 712.265 null]
+>> endobj
+713 0 obj <<
+/D [709 0 R /XYZ 90 672.209 null]
+>> endobj
+714 0 obj <<
+/D [709 0 R /XYZ 90 632.152 null]
+>> endobj
+715 0 obj <<
+/D [709 0 R /XYZ 90 580.14 null]
+>> endobj
+716 0 obj <<
+/D [709 0 R /XYZ 90 552.039 null]
+>> endobj
+717 0 obj <<
+/D [709 0 R /XYZ 90 511.982 null]
+>> endobj
+718 0 obj <<
+/D [709 0 R /XYZ 90 471.925 null]
+>> endobj
+719 0 obj <<
+/D [709 0 R /XYZ 90 419.913 null]
+>> endobj
+720 0 obj <<
+/D [709 0 R /XYZ 90 379.857 null]
+>> endobj
+721 0 obj <<
+/D [709 0 R /XYZ 90 327.845 null]
+>> endobj
+722 0 obj <<
+/D [709 0 R /XYZ 90 287.788 null]
+>> endobj
+723 0 obj <<
+/D [709 0 R /XYZ 90 247.732 null]
+>> endobj
+724 0 obj <<
+/D [709 0 R /XYZ 90 207.675 null]
+>> endobj
+725 0 obj <<
+/D [709 0 R /XYZ 90 155.663 null]
+>> endobj
+726 0 obj <<
+/D [709 0 R /XYZ 90 115.606 null]
+>> endobj
+708 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F60 176 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+758 0 obj <<
+/Length 910       
+/Filter /FlateDecode
+>>
+stream
+x��YMs�6��W�V� >�[S7
�N�����xhV�J�LQ���wIP��ԑ)1���f ����qA��1�����(<7��k���Ŝ�(���]�t�����lr�'��^_(
�$ER|Z�e�/Q�2q���E��(�
���
�\
+�e�,�x��55�`
dl������r�΃���j���V1Kn�t�l�� ����Er�r޽E6�.�E��4�/
_ͮ�vi��k#��z���#������[!ԽA좯��kw�'_�*-��J
�q
�`!�1͊+�g],��/O���<����e����h�"	
�x�8��j��@d�z�g6�Yl�
����V���a�1<���&J���:�)m�W ��f7�O<���a����q4
��~	��`
����_;���D\`gѿ?��I��胿A˨'U�;w�*�v�$���^gh�nEF
����ݐ�҃��t��C�@���M'.�,'��q� 
ʎT�0ݒ

ő�B�����1��>�ձ<bD��vg��&��<���ǫ� 7
��a���UVK:œ�eȿ�8bdK
?D��%/&��H'	��C&y2s���������-��`�<�d҂��$��8:
+�!�sG���w���\4Җ
��\6>��D)ڄ=�t ���Ⱦ�����
D
�	�%E�3
	���=^�	Z��U�[��1B΀�����|���d���_
z7����_}ܧUh����Dd@������:4��3_��g�|�J�u�i67=�a��M-]�SO�p�_&�U2���\�% ./�*|#.rg��<���s����a���щ�rc
+i{��~_�����x��cH���1�lh{��d{���ey��ɜgI�Ƀ�Q�s��k��ۀ���T���V��\��3�N2"cs�/-�y{
+endstream
+endobj
+757 0 obj <<
+/Type /Page
+/Contents 758 0 R
+/Resources 756 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 618 0 R
+/Annots [ 705 0 R 706 0 R 727 0 R 728 0 R 729 0 R 730 0 R 731 0 R 732 0 R 733 0 R 734 0 R 735 0 R 736 0 R 737 0 R 738 0 R 739 0 R 740 0 R 741 0 R 742 0 R 743 0 R 744 0 R 745 0 R 746 0 R 747 0 R 748 0 R 749 0 R 750 0 R 751 0 R 752 0 R 775 0 R 755 0 R ]
+>> endobj
+705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.36 207.23 694.264]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag) >>
+>> endobj
+706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [215.2 683.36 299.114 694.264]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 644.127 207.23 655.031]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag) >>
+>> endobj
+728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.721 644.127 348.648 655.031]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 604.895 203.912 615.799]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag) >>
+>> endobj
+730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.882 604.895 292.479 615.799]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 565.663 203.912 576.567]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag) >>
+>> endobj
+732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [235.404 565.663 342.013 576.567]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 526.431 214.612 537.335]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag) >>
+>> endobj
+734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.582 526.431 313.879 537.335]
+/A << /S /GoTo /D (group__Datatypes_gaf4f8f4bacd6f148fbbfb9209fb5b2b33) >>
+>> endobj
+735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 487.199 214.612 498.103]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag) >>
+>> endobj
+736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.104 487.199 363.413 498.103]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 447.967 232.126 458.87]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag) >>
+>> endobj
+738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.096 447.967 348.907 458.87]
+/A << /S /GoTo /D (group__Datatypes_ga25f9463d3385bd998e4fabcdce8dec5a) >>
+>> endobj
+739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 408.734 232.126 419.638]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag) >>
+>> endobj
+740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 396.779 279.727 407.683]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 357.547 230.482 368.451]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag) >>
+>> endobj
+742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.452 357.547 345.62 368.451]
+/A << /S /GoTo /D (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f) >>
+>> endobj
+743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 318.315 230.482 329.219]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag) >>
+>> endobj
+744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 306.36 278.083 317.264]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 267.127 231.966 278.031]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag) >>
+>> endobj
+746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.936 267.127 348.587 278.031]
+/A << /S /GoTo /D (group__Datatypes_gac3cf4d5c81ff784729bb5d1c8d48ce23) >>
+>> endobj
+747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 227.895 231.966 238.799]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag) >>
+>> endobj
+748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 215.94 279.567 226.844]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.094 176.708 434.903 187.612]
+/A << /S /GoTo /D (group__Datatypes_ga9448cd0d782a819c066e27cf3ebc1add) >>
+>> endobj
+750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 125.521 322.725 136.424]
+/A << /S /GoTo /D (group__Datatypes_ga261d916137f01c0effdefeb266a73172) >>
+>> endobj
+751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 86.288 334.889 97.192]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) >>
+>> endobj
+752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.664 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 75.309 157.407 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+755 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+759 0 obj <<
+/D [757 0 R /XYZ 89 770.89 null]
+>> endobj
+760 0 obj <<
+/D [757 0 R /XYZ 90 712.265 null]
+>> endobj
+761 0 obj <<
+/D [757 0 R /XYZ 90 673.033 null]
+>> endobj
+762 0 obj <<
+/D [757 0 R /XYZ 90 633.801 null]
+>> endobj
+763 0 obj <<
+/D [757 0 R /XYZ 90 594.569 null]
+>> endobj
+764 0 obj <<
+/D [757 0 R /XYZ 90 555.337 null]
+>> endobj
+765 0 obj <<
+/D [757 0 R /XYZ 90 516.104 null]
+>> endobj
+766 0 obj <<
+/D [757 0 R /XYZ 90 476.872 null]
+>> endobj
+767 0 obj <<
+/D [757 0 R /XYZ 90 437.64 null]
+>> endobj
+768 0 obj <<
+/D [757 0 R /XYZ 90 386.453 null]
+>> endobj
+769 0 obj <<
+/D [757 0 R /XYZ 90 347.221 null]
+>> endobj
+770 0 obj <<
+/D [757 0 R /XYZ 90 296.033 null]
+>> endobj
+771 0 obj <<
+/D [757 0 R /XYZ 90 256.801 null]
+>> endobj
+772 0 obj <<
+/D [757 0 R /XYZ 90 205.614 null]
+>> endobj
+773 0 obj <<
+/D [757 0 R /XYZ 90 166.381 null]
+>> endobj
+774 0 obj <<
+/D [757 0 R /XYZ 90 115.194 null]
+>> endobj
+756 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F60 176 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+816 0 obj <<
+/Length 1195      
+/Filter /FlateDecode
+>>
+stream
+x��Y]s�6}�W���L-��ϾQ�ٲ����x
�.���t��{e� �
bB���� [����9��
+ce�`���h��Xq�kQK�'���p�i��X�V־�f9��
�z۽��u��x����}��#�9�D�����/XC�#�:��쥅bP�\6>5p��f�
Sq �eh��;�M"D��-��5�tjbuϢ�'!DE���湵�D�RdT�	C�I��JͽAʵnb��K>�9�*M֣4M�6���
� �
V	rMSZ].�A+Ig7��,�}��j��
P�!�ш�8Z��
��4N�4��c��f����sj쬌‚(ِ��
+���Ȱ�f��,�
�|w�-�
9���Y�hv�Ʋ�k�.�ۿ�(�_��� �U�x�p��I
=���1
d[��gw�zg���.7�O=�國�� DF�������.�^�
+ ^q����w���v�����s��8��fr�`��c��f�q��~��p��P��$�*��"w�e�U�<�m�
�
(=�
u
+ޢP 
��@�,g�w�o���')��g�@m��J��iå�=��
�&8
8P����)��b����)�|�{���k�UDM1�h��vݢ�숯�c���E����
L��.x	�
�/3�y��h�8|�om��$����`�Vv��F��;A��
���e���}/�x�a�������V�d�Sm�7�OW�N]{2?]2I]��Ie`/^������N��.�k��
+]
�A��j��n�*W�]
��l��s��t-e��2c���A��N�$��-���%���
c+�

剢J��a�J��^��|�T���Ցa��ʲX�A�s

�R��
���Vf���
��沩kI����Ƴ�F
u¥��<�~�E���8��b�Rb@��_�0�a�R5��s���ܒ��%���Y�a�W.�g�
��h�RqE���
d�#ra�r�
����i�z����,�l8������@��f���Ϊ ��\g7c���)g1ۚ����5�}h �[ȵ�h�s0����4�q�%/ڲ��t
N󧗢�O����jœ_4�TsO~
�u8��7��߄��`�}BvB5�L���t��|
+r
_����~Cw�������]�.k6o�S�o�h/�F�v�m#���z��"N��"�\d{���:W��
+endstream
+endobj
+815 0 obj <<
+/Type /Page
+/Contents 816 0 R
+/Resources 814 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 618 0 R
+/Annots [ 753 0 R 754 0 R 776 0 R 777 0 R 778 0 R 779 0 R 780 0 R 781 0 R 782 0 R 783 0 R 784 0 R 785 0 R 824 0 R 786 0 R 787 0 R 788 0 R 789 0 R 827 0 R 790 0 R 791 0 R 792 0 R 793 0 R 794 0 R 795 0 R 830 0 R 796 0 R 797 0 R 798 0 R 799 0 R 800 0 R 831 0 R 801 0 R 802 0 R 803 0 R 804 0 R 805 0 R 832 0 R 806 0 R 813 0 R ]
+>> endobj
+753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 682.45 334.889 693.354]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) >>
+>> endobj
+754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 670.495 382.49 681.399]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.906 641.398 253.705 652.302]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag) >>
+>> endobj
+777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.675 641.398 335.069 652.302]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 600.347 196.709 611.251]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag) >>
+>> endobj
+779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.201 600.347 327.607 611.251]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 559.295 286.681 570.199]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.651 559.295 458.017 570.199]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 518.244 286.681 529.147]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 506.288 334.282 517.192]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 465.237 320.434 476.141]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) >>
+>> endobj
+785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.208 465.237 513.996 476.141]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 454.258 123.654 463.06]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 412.23 320.434 423.134]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) >>
+>> endobj
+787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 400.275 368.035 411.179]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 359.223 346.446 370.127]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) >>
+>> endobj
+789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.064 359.223 513.996 370.127]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 348.244 183.419 358.172]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 306.216 346.446 317.12]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) >>
+>> endobj
+791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.904 294.261 394.047 305.165]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 221.635 251.533 232.539]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 210.054 291.912 220.584]
+/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a81067f9cf8984d1b3febca4488a137e1) >>
+>> endobj
+794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.075 210.054 498.983 220.584]
+/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6af8c3e04d66cd611db5efcd92a6c52425) >>
+>> endobj
+795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [503.147 210.054 513.996 220.584]
+/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6aa166787e251ef2cbaad9213d8e9d2653) >>
+>> endobj
+830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 198.098 264.226 208.629]
+/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6aa166787e251ef2cbaad9213d8e9d2653) >>
+>> endobj
+796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.215 198.098 492.808 208.629]
+/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9e4eb4979711bf6699ec8e0f335de476) >>
+>> endobj
+797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 186.143 314.597 196.674]
+/A << /S /GoTo /D (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9029c33b6876c560bf78b5b86d0367c0) >>
+>> endobj
+798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.87 156.673 251.182 167.577]
+/A << /S /GoTo /D (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) >>
+>> endobj
+799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.617 156.673 403.634 167.577]
+/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a132c76cbee67b5bc2ac9e09af9c68c4f) >>
+>> endobj
+800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.954 156.673 513.996 167.577]
+/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a1304ca7fa8d3e734d1677709a37d5d28) >>
+>> endobj
+831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 145.092 153.542 155.622]
+/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a1304ca7fa8d3e734d1677709a37d5d28) >>
+>> endobj
+801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [156.367 145.092 305.029 155.622]
+/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9afdbee5cd06ff135cbf9614b661c9e923) >>
+>> endobj
+802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.854 145.092 506.887 155.622]
+/A << /S /GoTo /D (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9ab32d9464a7101eb1893562646a3cdd1a) >>
+>> endobj
+803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.041 103.666 273.595 114.57]
+/A << /S /GoTo /D (group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) >>
+>> endobj
+804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.371 103.666 453.718 114.57]
+/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a59042baec996bc386154a1825ad56de0) >>
+>> endobj
+805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [457.21 103.666 513.996 114.57]
+/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1aa05a8932097b094ca179e99e2d80b6ae) >>
+>> endobj
+832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 92.085 271.429 102.615]
+/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1aa05a8932097b094ca179e99e2d80b6ae) >>
+>> endobj
+806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.418 92.085 452.409 102.615]
+/A << /S /GoTo /D (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a3e5170687052e3962de866e2ab44d8f8) >>
+>> endobj
+813 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+817 0 obj <<
+/D [815 0 R /XYZ 89 770.89 null]
+>> endobj
+818 0 obj <<
+/D [815 0 R /XYZ 90 712.265 null]
+>> endobj
+819 0 obj <<
+/D [815 0 R /XYZ 90 659.259 null]
+>> endobj
+820 0 obj <<
+/D [815 0 R /XYZ 90 630.162 null]
+>> endobj
+821 0 obj <<
+/D [815 0 R /XYZ 90 589.111 null]
+>> endobj
+822 0 obj <<
+/D [815 0 R /XYZ 90 548.059 null]
+>> endobj
+823 0 obj <<
+/D [815 0 R /XYZ 90 495.052 null]
+>> endobj
+825 0 obj <<
+/D [815 0 R /XYZ 90 442.045 null]
+>> endobj
+826 0 obj <<
+/D [815 0 R /XYZ 90 389.039 null]
+>> endobj
+828 0 obj <<
+/D [815 0 R /XYZ 90 336.032 null]
+>> endobj
+829 0 obj <<
+/D [815 0 R /XYZ 90 241.229 null]
+>> endobj
+814 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+881 0 obj <<
+/Length 1963      
+/Filter /FlateDecode
+>>
+stream
+x��Z]S�6��W����F��c!t�
���nwv;
��mb��ʼ���#Kvb�	�
��`EHGG�y·dcm�a헣�ӣ�s
krLjj�;����;�0�W�}���Ƹ7
+oS?}���{g~��	��F��z����~8N��>" kD�2�ek����?�@�
#���}1h���s�M��w��ZxW=sW=�M�3[�A�H�Pj��Ӵ���z���6�\�u]��H��'Fy��u��s����ћ�ԛ�m܃-z�:�A�h."D���l���6 =
�^]����t��
I�w���&�3}�LS�<?�_B�6��[�,����sLS/��66-)�c�0
+D2���N>o%��G(���}\Heg�YT[������),���o�%
)v͓�g<�
+��+[�=<��S�\N�_.�g�ZM�=���6�/�FË���H��������[F�Q�#������YܧFᄍ��>T�R��o����������j�
l��J���
+�7�g�s���Q!�RϽ�O&����o�
�!��߄q�-4A�
+�G���K� lÃ"ݢR��u4��
�D=C�%Hg�l?�@ӧ�����ƽ \�(k
0�
6��
+A�tO��1t��8�$�K���;Ցc�r�
+�']@
P,�7"z�\E�<��9lgӑmU��5�2i�M��R/\�G?
++��֔r�E�_B�#<��tf���`Y8��hc�0�-�t"@����'��t�~
�� �Z�
+�/%m�嚗����=.��.���������0hp����=��$���F�?
��%?8�J�Z�+�UJ݁�Jf�<zg-H���Y"���0��ؖ[��p%!�<��y� ���r�a��#L��n
��u��ܕ���:�EXg�[s��_�{Z���b@����-�k+���^��<)	Q[��0�n�o� Y�ay�g݉3[��j� ��]�<B
�b;6I~uld~W��e��\ƳA�����`�0*
+�w��I,�˴�U��~�D]�P���0J�u�R7�߲JM�
}��MP�
ґ����Y�(�uBz�ͼ;U
�,3��}B��V����T+IgR2BiT��g�У�MѮ�Qcȭ��J*ܕG��قk��v�W
A>��r�6�h�8C�p���ۤ
+�x[
Cb�O����Ft_u�/�Tt��S:��N�lka
vvȐ���`d�]�B�ew�Ky$5A�����-�7���=�*Bܧ~�`�$���	wa.�xL!�{0{V
�ҙH
�#q|(�
� `��䋖�;��i���i�{�0➼�C43�W4K
ͥ4A�Ҋ�QJ+�ȑ]��v�r���0hcW�*��˓r�T᫼��4�f�|Eq���w0��u[z~�����*��vS�듁N\}�W����O���d2�ƣO��
�dԪݾ���p�a��� �`�g��'ˇ(^��RE�x�,��+0gK?�rOJ���!�5q���l,i�$��Q+�݊�2�B"	gP>��u�׷���W��:��4��f�pJ0Υw=
�L]h��̝|��w/0��&
��BE�����������Ԃi_7ze|���1
+*����!+W���nw��|�NF氬 |YP��YٟB��e2�vO��
�
�'������aX�#%<�-�-.MxD�����L`P�P Ű] %%H��b[�j��HA�gT�F�b��D�KKQ(��P���g͖����Ѐ��x�������;^y^o��A�������d:lw��
&���u����v�%�?�%��
_�lZ�t��S���|�������N8^���&��O� e�
?�� *~��u�z� ��-
+c$>X�p�/��r�ie�W�E
�Q�8:2��y��|||��gPm#Hz_c��lY����P�Ы8�%rй*�|��
���&Ȅ����o(�1�,Z��m�,'��cwŴ���~Z��m�
+endstream
+endobj
+880 0 obj <<
+/Type /Page
+/Contents 881 0 R
+/Resources 879 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 901 0 R
+/Annots [ 807 0 R 808 0 R 809 0 R 810 0 R 811 0 R 812 0 R 848 0 R 849 0 R 850 0 R 883 0 R 851 0 R 852 0 R 853 0 R 884 0 R 854 0 R 855 0 R 856 0 R 857 0 R 858 0 R 859 0 R 860 0 R 861 0 R 862 0 R 863 0 R 864 0 R 865 0 R 866 0 R 867 0 R 868 0 R 869 0 R 870 0 R 871 0 R 872 0 R 873 0 R 874 0 R 875 0 R 876 0 R 878 0 R ]
+>> endobj
+807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 707.957 308.53 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) >>
+>> endobj
+808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 696.719 169.601 706.906]
+/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3cae072091ed81a04a85178bba39494a601) >>
+>> endobj
+809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.59 696.719 233.262 706.906]
+/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5c5c70a1d41e6e79718bbeb33df7cad4) >>
+>> endobj
+810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.251 696.719 296.923 706.906]
+/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca48a27a450babc28cd9e37b24e4c7f870) >>
+>> endobj
+811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.912 696.719 360.584 706.906]
+/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca8cbde0e6dec605c51ef708fb8cd2b52e) >>
+>> endobj
+812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.42 179.564 694.951]
+/A << /S /GoTo /D (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5637cd5e0441762c2efba8ec4549156a) >>
+>> endobj
+848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.246 655.905 343.495 666.809]
+/A << /S /GoTo /D (group__Datatypes_ga6b8429baa2a70746836586aad6905b64) >>
+>> endobj
+849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.682 655.905 425.731 666.809]
+/A << /S /GoTo /D (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a8a337487ebb2a4938a04103368bc24dc) >>
+>> endobj
+850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [428.428 655.905 513.996 666.809]
+/A << /S /GoTo /D (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a81a7221b987cf71e9577f1d3162fc994) >>
+>> endobj
+883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 644.324 177.89 654.854]
+/A << /S /GoTo /D (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a81a7221b987cf71e9577f1d3162fc994) >>
+>> endobj
+851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.31 615.808 322.024 626.712]
+/A << /S /GoTo /D (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) >>
+>> endobj
+852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.338 615.808 450.122 626.712]
+/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83a60e9236626a09f76d3fe049e03bd6926) >>
+>> endobj
+853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.882 615.808 513.996 626.712]
+/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) >>
+>> endobj
+884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 604.227 200.565 614.757]
+/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) >>
+>> endobj
+854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.554 604.227 346.138 614.757]
+/A << /S /GoTo /D (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab34d1f06ae438f58dd44c6262b3281ce) >>
+>> endobj
+855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 533.471 237.386 544.375]
+/A << /S /GoTo /D (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b) >>
+>> endobj
+856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.202 533.471 324.558 544.375]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 505.329 215.259 516.233]
+/A << /S /GoTo /D (group__Datatypes_gadc14acd60d7235a72f88850b9a917eca) >>
+>> endobj
+858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.075 505.329 302.432 516.233]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 477.188 215 488.092]
+/A << /S /GoTo /D (group__Datatypes_ga7593947fa164900140d09c08b56c6cd1) >>
+>> endobj
+860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.816 477.188 302.172 488.092]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 449.046 218.318 459.95]
+/A << /S /GoTo /D (group__Datatypes_ga56026e685fb0fe336a5f346580f84ff0) >>
+>> endobj
+862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.178 449.046 365.534 459.95]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 420.904 223.299 431.808]
+/A << /S /GoTo /D (group__Datatypes_ga13f1f84a46d70b91637cb9d6af54af6b) >>
+>> endobj
+864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.638 420.904 359.995 431.808]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 392.763 275.881 403.667]
+/A << /S /GoTo /D (group__Datatypes_ga0764a0e607ec4de08a53e6d3b109a714) >>
+>> endobj
+866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.697 392.763 434.744 403.667]
+/A << /S /GoTo /D (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) >>
+>> endobj
+867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 364.621 276.987 375.525]
+/A << /S /GoTo /D (group__Datatypes_gac37b94ca7dc0c8bb9797e6d91e16492e) >>
+>> endobj
+868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.803 364.621 435.85 375.525]
+/A << /S /GoTo /D (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) >>
+>> endobj
+869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.704 336.479 221.734 347.383]
+/A << /S /GoTo /D (group__Datatypes_ga763a5fa98155383055703dc08cb3e11a) >>
+>> endobj
+870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 254.142 360.544 265.046]
+/A << /S /GoTo /D (group__Datatypes_ga1fd59c6502c8cbb9dbb802e4af34c940) >>
+>> endobj
+871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 226 337.311 236.904]
+/A << /S /GoTo /D (group__Datatypes_gab9fc89c0e89d4487a1f69a26849b682a) >>
+>> endobj
+872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 197.859 316.27 208.763]
+/A << /S /GoTo /D (group__Datatypes_ga735949470e98393af90b12f534b06cba) >>
+>> endobj
+873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 169.717 358.87 180.621]
+/A << /S /GoTo /D (group__Datatypes_gae439fa617415f2153f4793041c41bd9f) >>
+>> endobj
+874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 141.575 413.126 152.479]
+/A << /S /GoTo /D (group__Datatypes_gaef15021f65d2810602a9a1bd06fc878d) >>
+>> endobj
+875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 102.475 366.063 113.379]
+/A << /S /GoTo /D (group__Datatypes_ga841003bef28b1052aa2b5297a529d4d8) >>
+>> endobj
+876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 74.333 358.88 85.237]
+/A << /S /GoTo /D (group__Datatypes_gae311117a92fca76fc66fe3442ff6d09f) >>
+>> endobj
+878 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+882 0 obj <<
+/D [880 0 R /XYZ 89 770.89 null]
+>> endobj
+885 0 obj <<
+/D [880 0 R /XYZ 90 552.588 null]
+>> endobj
+886 0 obj <<
+/D [880 0 R /XYZ 90 552.588 null]
+>> endobj
+887 0 obj <<
+/D [880 0 R /XYZ 90 522.712 null]
+>> endobj
+888 0 obj <<
+/D [880 0 R /XYZ 90 494.57 null]
+>> endobj
+889 0 obj <<
+/D [880 0 R /XYZ 90 466.429 null]
+>> endobj
+890 0 obj <<
+/D [880 0 R /XYZ 90 438.287 null]
+>> endobj
+891 0 obj <<
+/D [880 0 R /XYZ 90 410.146 null]
+>> endobj
+892 0 obj <<
+/D [880 0 R /XYZ 90 382.004 null]
+>> endobj
+893 0 obj <<
+/D [880 0 R /XYZ 90 273.259 null]
+>> endobj
+894 0 obj <<
+/D [880 0 R /XYZ 90 273.259 null]
+>> endobj
+895 0 obj <<
+/D [880 0 R /XYZ 90 243.383 null]
+>> endobj
+896 0 obj <<
+/D [880 0 R /XYZ 90 215.241 null]
+>> endobj
+897 0 obj <<
+/D [880 0 R /XYZ 90 187.1 null]
+>> endobj
+898 0 obj <<
+/D [880 0 R /XYZ 90 158.958 null]
+>> endobj
+899 0 obj <<
+/D [880 0 R /XYZ 90 121.584 null]
+>> endobj
+900 0 obj <<
+/D [880 0 R /XYZ 90 91.716 null]
+>> endobj
+879 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F84 265 0 R /F24 173 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+919 0 obj <<
+/Length 2230      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�~���[��@�J%��z5�w��W��f�TI��H
�q��Ӹ(��e���<g��� ����~�]]��У�5[Y!�|"׃���d;t�����DB6�����l4�M���hv��������"?���է?����_,��0�^䢭Ũ�Ԛ^�~�5+��d-p� X�`�����	A�(>�e�-Y�Q:Rۋ�R�2�'�Z��MT�W�]��7|Y
�k�KJ���^�����\�W�V�U�9���q�j
�w�yVVjv ��������R�1j
	E4Ъ�L���d}��uV&���p�	uk���\.<==̟
>��F��d�p3�
ϧ�?M�M;�=�4L2D��4-��@��<�ɼP�/y�j!�\�ŒM��-g��G�҈���aw��

���Wy�Cd0$���WQ�J�i �2.�]����%m2�0
�l`{��K��q0�WB@ѐ��F�,��ث�2��
+6��Q�T���Q�eDZ��v��I����E`�h0d>�g�p�֮�~�/��.���"� H������h�x���{����dWk���^}�<�J�F:
)=A#΋���<Ӷ �좯����
�Iq/�H$Z�{Ug�PG��_�Q��M5����r��m��	F!D�!��u�k���-� �8���
�e9�͈]&�]������ �%��Lu���ۭU��h�����m&�E�E�W��›�F�j`�W=����
V�P��h� ��!�3��x�
⛅���/�<&��q������7� �V��h�S�A�G�C���U����
�{dw�#N�/�lx��d
�w	�ECW����Ki�0/�F�snո���b=#s�r��C
����p�S�&x���vR �<GR��kPV����<K��x
��F���%q���'�q �:��,�AP��<�A`�N�h�=�M%�&>Wm�Ft�
��$
+A��msJ��\⚺�3ƎZՑLJ�
�f�K��

+{$��ϐ

~���(
¦�QeN�0
+�Ń,$H9X˙�'Τb^�.g����wϔ�I� �R~�����Ghjƾ�y]���Ĺ!�s��ؐ!/
�ǚ,r|�C����Ɏ�����~?c+���jr�lp�L�aD��K�>�� ���-Z�@���<
� Q��w�
e��!���W+I����u��25ܮ���T|�D���5�\��Pw#қ4��v�Փ�4:��
u���I�U3R� ��d�*
+��l�Ġ����Y�Ke|3��$%�Wjֈ��:<�hŲ�݅��J��1�2cC�[��P���E
z����#)
��X��D)8\H2Վԧ)�DG�R�Tr �:�2�laH�4l���6$C��P��qT�ޞ|�
,tUL�R3�հ))5''r�HU�Ĕ�P��b���
+<不����r(bA��CeKteK���7Bq����P��T�e���D�a��SMY/:�\ձ�2��%*�u�hUf�)�&A��
��h�K���Sk*�Ɗ�����
�$�
򭣳�(�� Y��UdZ������4Y��sNE�N��<���[y����l�3[��WC�&�"^������ ��W��uqM�0�naʧ������
��L��[Ť3�t�_�sPEM��>������x6�}|�F��|����9�H�"�6�Ҭ��!��V�&K4�AD՚$�M�@
G�K,���:���(�MX�'\�A�m�_Y��@�O�	�#o`�8��~�y8�%a����9.e}�@�����x�]D�
�<"��3轉�B��hA��(�;
�^��!`z��Fu7��F���
+��z�/��Zv���]]�>A��\��[1��
/��B�?4d����;����H���ڹ��bwּ/�"���\&�z��/I���6
�?�+�w͕����F���f�����xt6����쭍�]�ӵB�d�
�0�����or��,{
���
�+LQ{�CM�
�
���C衐���Q�m��PQ>J[=o
�ϓ
X��}'�q��u�_e��SM<�P�ҟj���ǐ㾂'a��TN��r�����[��9brC�7<�� ��C(�����
�C�� ƪq�>Q������n��sɋ��륆�(k�+�g��#�$�@9
�7q�ZSn����K#�W���]�M����߮����5���

6�~��k�;��Qq��4"�G��˪j

+endstream
+endobj
+918 0 obj <<
+/Type /Page
+/Contents 919 0 R
+/Resources 917 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 901 0 R
+/Annots [ 877 0 R 916 0 R ]
+>> endobj
+877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.387 695.671 353.351 706.575]
+/A << /S /GoTo /D (group__Datatypes_ga0aac22e2dc312e8c41418dd8d59701f8) >>
+>> endobj
+916 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+920 0 obj <<
+/D [918 0 R /XYZ 89 770.89 null]
+>> endobj
+921 0 obj <<
+/D [918 0 R /XYZ 90 712.265 null]
+>> endobj
+922 0 obj <<
+/D [918 0 R /XYZ 90 668.739 null]
+>> endobj
+923 0 obj <<
+/D [918 0 R /XYZ 90 514.126 null]
+>> endobj
+676 0 obj <<
+/D [918 0 R /XYZ 90 489.837 null]
+>> endobj
+924 0 obj <<
+/D [918 0 R /XYZ 90 489.837 null]
+>> endobj
+925 0 obj <<
+/D [918 0 R /XYZ 90 382.583 null]
+>> endobj
+833 0 obj <<
+/D [918 0 R /XYZ 90 358.294 null]
+>> endobj
+926 0 obj <<
+/D [918 0 R /XYZ 90 358.294 null]
+>> endobj
+834 0 obj <<
+/D [918 0 R /XYZ 107.713 280.033 null]
+>> endobj
+835 0 obj <<
+/D [918 0 R /XYZ 107.713 265.423 null]
+>> endobj
+836 0 obj <<
+/D [918 0 R /XYZ 107.713 250.812 null]
+>> endobj
+837 0 obj <<
+/D [918 0 R /XYZ 107.713 236.202 null]
+>> endobj
+838 0 obj <<
+/D [918 0 R /XYZ 107.713 221.592 null]
+>> endobj
+839 0 obj <<
+/D [918 0 R /XYZ 90 213.738 null]
+>> endobj
+927 0 obj <<
+/D [918 0 R /XYZ 90 209.255 null]
+>> endobj
+840 0 obj <<
+/D [918 0 R /XYZ 107.713 130.112 null]
+>> endobj
+841 0 obj <<
+/D [918 0 R /XYZ 107.713 115.502 null]
+>> endobj
+842 0 obj <<
+/D [918 0 R /XYZ 107.713 100.892 null]
+>> endobj
+843 0 obj <<
+/D [918 0 R /XYZ 107.713 86.281 null]
+>> endobj
+844 0 obj <<
+/D [918 0 R /XYZ 90 77.486 null]
+>> endobj
+917 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F60 176 0 R /F84 265 0 R /F24 173 0 R /F72 198 0 R /F107 573 0 R /F11 615 0 R /F8 616 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+931 0 obj <<
+/Length 1821      
+/Filter /FlateDecode
+>>
+stream
+x��X[s�F~�W�b&�wW�J�
c�m\��t�
#`M�Dt	���goB`
+��v�O{�:{�\�s�����uۺ�.n|l�(d�Y��b�wC�1x�Ym�X�C0��]<ɣ|��P��Q��5/�
��б
��y��
�����Q�<��4i}���l�0r���H��r����~ma�F��X���{�$!��ZG� G��ӶoW�P��6/@��
��z��JƷy<���Q���Q�wm0M�c4��aMI
-�C)"�W�y1���pQ�䊘��6��9�yZ��/q:�l�\�
�BSF�����t0
+C
+y�s�R��<���:X/n�;i$@>�����
�Ʒ�������
\������������=�+`D�k�>2n9b�z��g"��┣�
���+:��V��rpy�
u�t��G�輎�(�%�۞g�Q���*�����ig3�]�,NK��I�Q�"�P
���i&���D�ʪt�g�^Z��e���M;�����d�d?�],O
d�D]�} �����N����G~h�9;@\�F�qp��� ��~
��qY���>'�7v�J��+���w�����W:��W����x�r�K�ғ��)��k�җ�<��#O���LO瀯s�����q�~w�"���\����ðw�н>� �[�������r�b�bg���q�hu���������3M�T��*C�	kE$�Y���TŠ��/1�|���7��*1��Ȝ�M�k�Z�
�$�i�O�mBe0M �)DP�yJ�i��W<��)�z�&E��J�Tk�qB�
r,s�Ϝ�7a/�?a�d��|w����s�!ėQ���i���|���
�����σ���I0�"�_O@�T!+F�td�;�S{�G�u�.4�/22��U4�t(Уe�w
��ApTjAs�o�{�Ji
��=\��b�/�����z�):f2%
�Â��hf�w	!2�jV�%��S=%٬ZeJ���L�_�����"l1��D`qQ
��xoC��E;�s31��
ɋ�V����{�;S`�G��&�뜁��j�'T�jU*Zʰ�8�)
+% ��@B�+b(K[EkpR��P\W5"W����
�h�Z�S
>�+��X�=�;�ۨ�`�
����=^1��@̰�Yɏ��-�'�i�Uꃮ���j�th|[-���U��#���qV�A�)���f\��Zֶ(y�6'����j��(������'�음!�
G
�qX`���
ؽ&^��^a�U�U�L���w��,��4K�<��\{�K�B��il� �،r`���=��o�]P�;>fvp�#a/V%
��x��r���
M&�\<�3�
�ʹa��
���Di<�*SE-�����z��Iשҗ0����Jc
�g�IT��>Y��l@%N
�ԥ��c8�]�u������#��0Ur䚬�<�-�U�q�[�Ȧ# d
+�^F�U�.�h���
+C‘}��9�z�D���f��q�0��yfǥZ#��kZ�I�4f�Hs٩e���,��Ro�˪�d�<���,��Ր�
++.KGSs���1
V�$ښ�(���Z	�����2K+����|ʋR�`LVy*;8
���4.^|��fY
�}l
�i�ox�:���*���f�����#��"ޫ�N#H=��6��.��z�d3P<�Gi��	{Xeg0A\�;":*�r�4��_,C�"�Wӆ�$t�}%/�r���ŤZ�w����2w�}�(b��M�H2S:�6	4d�o�{>5^������S�Ѥ�KsPo\�Ǻ� �����
+endstream
+endobj
+930 0 obj <<
+/Type /Page
+/Contents 931 0 R
+/Resources 929 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 901 0 R
+/Annots [ 928 0 R ]
+>> endobj
+928 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+932 0 obj <<
+/D [930 0 R /XYZ 89 770.89 null]
+>> endobj
+933 0 obj <<
+/D [930 0 R /XYZ 90 721.073 null]
+>> endobj
+845 0 obj <<
+/D [930 0 R /XYZ 107.713 645.429 null]
+>> endobj
+846 0 obj <<
+/D [930 0 R /XYZ 107.713 629.639 null]
+>> endobj
+847 0 obj <<
+/D [930 0 R /XYZ 107.713 613.849 null]
+>> endobj
+902 0 obj <<
+/D [930 0 R /XYZ 90 602.107 null]
+>> endobj
+934 0 obj <<
+/D [930 0 R /XYZ 90 597.623 null]
+>> endobj
+903 0 obj <<
+/D [930 0 R /XYZ 107.713 516.474 null]
+>> endobj
+904 0 obj <<
+/D [930 0 R /XYZ 107.713 500.685 null]
+>> endobj
+905 0 obj <<
+/D [930 0 R /XYZ 107.713 484.895 null]
+>> endobj
+906 0 obj <<
+/D [930 0 R /XYZ 107.713 469.105 null]
+>> endobj
+907 0 obj <<
+/D [930 0 R /XYZ 107.713 453.316 null]
+>> endobj
+908 0 obj <<
+/D [930 0 R /XYZ 90 442.514 null]
+>> endobj
+935 0 obj <<
+/D [930 0 R /XYZ 90 438.031 null]
+>> endobj
+909 0 obj <<
+/D [930 0 R /XYZ 107.713 355.941 null]
+>> endobj
+910 0 obj <<
+/D [930 0 R /XYZ 107.713 340.151 null]
+>> endobj
+911 0 obj <<
+/D [930 0 R /XYZ 90 316.453 null]
+>> endobj
+936 0 obj <<
+/D [930 0 R /XYZ 90 311.97 null]
+>> endobj
+912 0 obj <<
+/D [930 0 R /XYZ 107.713 230.821 null]
+>> endobj
+913 0 obj <<
+/D [930 0 R /XYZ 107.713 203.076 null]
+>> endobj
+914 0 obj <<
+/D [930 0 R /XYZ 107.713 103.553 null]
+>> endobj
+929 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F107 573 0 R /F11 615 0 R /F8 616 0 R /F10 617 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+940 0 obj <<
+/Length 1245      
+/Filter /FlateDecode
+>>
+stream
+xڭXK��F��+t�T5�~�ۛ��8�,>9�-K$,D����h$!�����F��=�}�H�H�����h|�I`�*���<�$�‚T�6
>�\D�'��
P�P��}���ɛ��m�f2�:�����K�&��G�>�`���ܚ�[�h
��
+
F�Hm
+&��=jÌ80�R��[�@��bJ	�vٴ\�Y3f���t�N�2�����*p*f���
��{N#
>%��߱�!����_�p��g��[om6�cGQ��2(�Pꜷp�����=C��7Ҫv�2Ш9h}
�5I����H6:-:�}�ւ���t[�l��[�HH�Ҋp�g��O��Q[��E����"bȋ�f����]�].�t6�!��T�p�͐��N㚂���:- at H���,ݔOC��B������R6�1 ��5ˋt
Q�E��N�c�*-�yͱ�°ō�Z YQ��P��Rs͆#kl_�j��C��`���VF~p�U�-N��f�9l4H[�f���q��v��pJ����}/r��Zɛhe�-��8��ܧI{�d|�H/ ��=�8�>��ղ��$�|_��[^�A����K����-���sʶ?U�����p��
�%&`1��8։ڸ���0)�uZ�84���;|��?�z�(FA�o �[�[�b���I,��iW��խ5��Ba~ÌA�T��� [...]
+\Q��?�rWd�
�!b4q�� 9��U���-��:�'��F��i\�&e#�њGL�{$e����4Ќ?����� m��Wt�Z��cw\}ld���5^��~����6GZkn��(f�}��߿��W��>��dQ}�ao[�i��o��M��kj���d�d��Z�\ZL�m[d)P
#�n �xs	Ҵv�?���u����V`m��Oe��i<��[l1a���/{a������:/چ '�UCp��B�{�
+endstream
+endobj
+939 0 obj <<
+/Type /Page
+/Contents 940 0 R
+/Resources 938 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 901 0 R
+/Annots [ 937 0 R ]
+>> endobj
+937 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+941 0 obj <<
+/D [939 0 R /XYZ 89 770.89 null]
+>> endobj
+942 0 obj <<
+/D [939 0 R /XYZ 90 721.073 null]
+>> endobj
+915 0 obj <<
+/D [939 0 R /XYZ 90 704.201 null]
+>> endobj
+943 0 obj <<
+/D [939 0 R /XYZ 90 704.201 null]
+>> endobj
+944 0 obj <<
+/D [939 0 R /XYZ 90 633.655 null]
+>> endobj
+938 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F24 173 0 R /F98 502 0 R /F60 176 0 R /F85 267 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+966 0 obj <<
+/Length 1930      
+/Filter /FlateDecode
+>>
+stream
+x��YIo�F��W�P�g�
Ӣ@Z7��n➒Be��L�"����7%J�,�l���ۿ���h����ף�WG	JbG׋(���	1<ͣwc99���Ӻv��l��E�6YYL��?�LL��~=��z�qD�4��#%�T�l5z�'����u�KTtk�"N\������RaD��5/����!	F��VH��VJ���4��Sw�	J���qtƌ��SF��^��C	#c�
+�q~LQ������R[΄q$jia.
�����M�
c:��>$G�$�T�ҕ�jB�8�ҕntuȟ��	�?�S�e�V��b�{8K	��h(pz��,��-��x�`k�]��9m�
S3��b���uX7�D��A�ȱH����^�7]��x:�&����H�_O
߭��!i1w7�M13�����q6Ȋ�{4��\�.�<�j��:Dh��x���T k"QL��_f�,�̵[	�])�`G�~�C
�ϓ� ��t6���\W覇�b(VqX��3�a
+�1 /S4	�����<m�ܹ�Uk�#~�]���V6���I�p�k
l�o��\��]�y
+)�ͨ��R	�H��ϧ?HU��w��#����ear�^l\���!�^���}O����;�³��
���G���Ri�Y�	���˝�^M�hS�4d��M�^wX������N�sf(D
+�XAtX;E��6{���q%�X�@��Ekǚ
%������户� ��8�6lcȠD��AG��M���}pi��{�˥��V}�䫽P���k��
|�C8���_��y5a�����
+ej+1`
I�:ںe
� |U��

�}�vF��(�2~F8�?3
���\
^�:��G�1���c���#��ԥq+Ů��2�U�84]�<E����#p�h�a���� �}t���e����O�!�C�+Z���i�
��E���Xs�p�QS���;/��+z*�6�S$V(�n0x�[�,� ���I@&��q�� 9 ����X���`9��>c��=0�:�pW�g෮fρ��x���!�����3
�zkd^)�?
Q
+R�D2�	o��r
�I%-��u
H�;$�y$Ź��i�h�����:F�)��@UᲘp<����<m��6�|�=�67!��
��/&�X۠hn2O��=!x
���jB��)x]�v���J��,��r?�ٚ�	F�M��
��ϹNk=G��#g��1;,�(�U�� J���_���G��b�^�餕��J�be���z�PPƮ;q^�`�	�FU���$? �/'�n���m����$�
T�G6�'OEf7���Ts&x��
�L�٣���/�a�V2�um��|��L-F=7���]kZ���aK`�w��gV&�?�l����
�M��l���������W����B�.������ź?�_��f����i�Iy �GqL�J�?�T�)����?�����9Q�F7����L�,h.벆��I�'�6����.f���8[��n$U{�6,�{��[_+M��:����

+�����-z�z�>E��q� �Ѓ�l��Pι�)~�8�Ps����<�"�	՝���#�Gmk�	��P(}�”��l�Aۅn�,{���U�����n�~ܰ�p
�ּ{Z���3{�bb̝��&�>��K]uP����(�[��F�\���
B�3�ݔ�/��mL���v��aoL���x�k����1J$�Nu�A��3���/��]~I��&]�У��ZW_���~M�M�ɩ�
��s�G �֕V&� ����ouh���G���=ڊM($��X�i������e��%����v���okc�2��d�\��A�@0�\`%����?�0� �Y�{o?������.Jp����`�F�
+endstream
+endobj
+965 0 obj <<
+/Type /Page
+/Contents 966 0 R
+/Resources 964 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 901 0 R
+/Annots [ 945 0 R 946 0 R 970 0 R 947 0 R 972 0 R 948 0 R 949 0 R 973 0 R 950 0 R 975 0 R 951 0 R 952 0 R 976 0 R 953 0 R 954 0 R 978 0 R 955 0 R 956 0 R 980 0 R 957 0 R 958 0 R 959 0 R 982 0 R 960 0 R 961 0 R 984 0 R 962 0 R 963 0 R ]
+>> endobj
+945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.879 523.929 363.032 534.833]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_adbcbb0f82f71091112f2c768d2107bb8) >>
+>> endobj
+946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.621 523.929 513.996 534.833]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 511.974 194.603 522.878]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 485.029 513.996 495.933]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a26270ebae88b22836f94cbdd003a022e) >>
+>> endobj
+972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 473.074 186.852 483.978]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a26270ebae88b22836f94cbdd003a022e) >>
+>> endobj
+948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.07 473.074 401.644 483.978]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.954 473.074 513.996 483.978]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 461.118 282.981 472.022]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 423.214 513.996 434.118]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_afa0c60a0cce5f80bcf4fdd22ba4913a9) >>
+>> endobj
+975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 411.259 186.852 422.163]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_afa0c60a0cce5f80bcf4fdd22ba4913a9) >>
+>> endobj
+951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [192.101 411.259 403.675 422.163]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.005 411.259 513.996 422.163]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 399.304 278 410.208]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 372.358 370.103 383.262]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a4ce5a35bce2cfe414dd42739b15819c7) >>
+>> endobj
+954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.321 372.358 513.996 383.262]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 360.403 194.603 371.307]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 293.777 392.768 304.681]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_ab1e38080e1de577a82f181e1e87cea61) >>
+>> endobj
+956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.986 293.777 513.996 304.681]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 281.822 237.761 292.726]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.184 281.822 392.848 292.726]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 254.876 386.153 265.78]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a2c8e06a14ae0f5878428e7385e98bedf) >>
+>> endobj
+959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.371 254.876 513.996 265.78]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 242.921 194.603 253.825]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 215.976 386.71 226.88]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a27c82492b590d5445541451928a593ac) >>
+>> endobj
+961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.928 215.976 513.996 226.88]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 204.02 237.761 214.924]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+962 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.222 204.02 485.808 214.924]
+/A << /S /GoTo /D (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) >>
+>> endobj
+963 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+967 0 obj <<
+/D [965 0 R /XYZ 89 770.89 null]
+>> endobj
+58 0 obj <<
+/D [965 0 R /XYZ 90 721.073 null]
+>> endobj
+413 0 obj <<
+/D [965 0 R /XYZ 90 699.397 null]
+>> endobj
+62 0 obj <<
+/D [965 0 R /XYZ 90 699.397 null]
+>> endobj
+968 0 obj <<
+/D [965 0 R /XYZ 90 595.769 null]
+>> endobj
+969 0 obj <<
+/D [965 0 R /XYZ 90 539.529 null]
+>> endobj
+971 0 obj <<
+/D [965 0 R /XYZ 90 501.27 null]
+>> endobj
+974 0 obj <<
+/D [965 0 R /XYZ 90 439.455 null]
+>> endobj
+977 0 obj <<
+/D [965 0 R /XYZ 90 388.147 null]
+>> endobj
+979 0 obj <<
+/D [965 0 R /XYZ 90 309.376 null]
+>> endobj
+981 0 obj <<
+/D [965 0 R /XYZ 90 270.665 null]
+>> endobj
+983 0 obj <<
+/D [965 0 R /XYZ 90 231.764 null]
+>> endobj
+985 0 obj <<
+/D [965 0 R /XYZ 90 164.514 null]
+>> endobj
+414 0 obj <<
+/D [965 0 R /XYZ 90 68.474 null]
+>> endobj
+964 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1012 0 obj <<
+/Length 1871      
+/Filter /FlateDecode
+>>
+stream
+x��ZYo�F~ׯ ЇJ@�ޓ�E��G��M��}J��VQ�E9���A��hY�� }1������7��{
{�~��\ؓH���n��^�%>��y��}�y�1?DD��Ȍ��}ss����68�|��=b�
��4|���
��0b2�I��)���{?�k��(Q�_��	r�$���d�+B��hL0��<_��AA
��ayH�D��tp&�#!i������2��1��Q�G�I� D
x7E�
Q>��(Q�*��S�#_�^�Sv	[��h
�1���2	��Tٟ��
��B�0��l|r�7�6&ܐ
S��#{3
+���\�����(�ٗ�&��q���yVؗ��k7�h�Œ�n�HK@�
��ȧ���)N���Lٙ���L�P �r����V��g�	 ��t�T�Lh�A/d�kW��j��~������ycFQ��wj�jfU~Q�瀾qK���o�RYe�˨���ZU:u/i�>&*���
�  EZ�=�#δe!P�R*ڳ>��o��nXöX8��3�4>y�0��zDD���B���8UQ19��
�^�P��4
��{9Y��n�C��.�Q���
PL
i+��D�q_�Y��Y�4D�g���R{Zޚ9@S�>7��# X�@8p�?���)�wfa	�a��3�8�`�r�Ц� ��j
+ �\���w5�x[1� ���75*��؎\D��^��Ey�`��@t0�P�Z?�{��&#�!lN3��T
�g��V�x\j�qɨ4�gq�R
;�m2
8�ջ�q<<za��tw���N�+�� �L�lc=6�g���}�FE
}�<��Q2�^��]���
�L+����H�
+�t�H?�Q8?��'4$���8]fI�P��6�	�&{XB��,��� 
Zg�7|�ρnU?"*:�cM���Ђ�JB(d��_,��"Ie�A��T�%q�Y�m%}�(. &��q���?*�z~j� 2�@<6$n��aG%
+ Ҏ)T�N!�i�)O�nJxXᎪ��\h�P���X�q�l�0� ̺ӳDU�{w,�@>׎�&Α��F�
f�S
���zw�h��.tJDIP�X��lSvЁ
�
F�~%�nB��r�Xc^\^�����Q���n��7�dvVk+
�ma�.
%G{ό8�C�È�
#�䶈o��;�u�}
�}(
ڊz"�� �
+E�E���h��J�6�$F�Ϛ0�J歡��� R  ��
��]�D�U6
���FAqjJ���y�4EG��2���/]6tY�
��M�VTo�K~�#,Y�
{�	z
Dh�
z���zǓ�&ɿk�rV�'�2}��-QQڎ
G#���6>�@���{j�4�P]�@����
��
��l+񻇪�,�"'D
��$G!Tl�e�ѵʢ����7���
}
�����><l�YW��>����yp4��ň�a�t
Q��Ϳ
_/�uL�-�1#�3^w�q=�3UF�]?S�i���������d��.n���웝�]d۷�L�ab��\�1���I
��_�X1[��j����@��v|(��v�t--�Ҳ�7�8D�$%����Y6�$m��z(������}���f����y�%;5�<�4o����
"���ˎ�<�;�l'��ږR���qŁ
e�1e�tL	��-�a�I	��!k߂���P�BE�w}��Ž�n��d��c�8'��
�M��7�����)X�
��o,�������1�r����w�Z�N.�e at lKn
��[�`6ɀ�
pT'ssځ���ʾ���U�.6��}���U�vCg�?�tS�M]/������3Pe�
+u�F#H7x�^U0�{����c���P
�a�J�e��<9��Y@
^�i���u�9��f�
+�IVԗ�0����v
�
mp7
+endstream
+endobj
+1011 0 obj <<
+/Type /Page
+/Contents 1012 0 R
+/Resources 1010 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 901 0 R
+/Annots [ 986 0 R 987 0 R 988 0 R 1016 0 R 989 0 R 990 0 R 991 0 R 992 0 R 993 0 R 994 0 R 995 0 R 1019 0 R 996 0 R 997 0 R 998 0 R 999 0 R 1000 0 R 1001 0 R 1002 0 R 1003 0 R 1004 0 R 1005 0 R 1006 0 R 1007 0 R 1008 0 R 1009 0 R ]
+>> endobj
+986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 583.286 324.618 594.19]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a8758040d0309c4f1bce32f105cf4c554) >>
+>> endobj
+987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.836 583.286 462.499 594.19]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.307 583.286 513.996 594.19]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 571.33 172.909 582.234]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.55 543.165 275.234 554.069]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a6bc95e351716acc4b56829a62464cddb) >>
+>> endobj
+990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.678 543.165 414.341 554.069]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.64 543.165 513.996 554.069]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [130.966 531.21 202.448 542.114]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.231 503.045 336.604 513.949]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a80b6aa70e38446636a0523f06353c8f2) >>
+>> endobj
+994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.729 503.045 475.392 513.949]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 503.045 513.996 513.949]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 491.463 167.678 501.994]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.33 462.925 284.573 473.829]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a12aac19f5cba4af9f1a177cd7b772242) >>
+>> endobj
+997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.797 462.925 424.461 473.829]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.515 462.925 513.996 473.829]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 385.846 275.539 396.75]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a0340ab7363ad499c2d6a0182bc874057) >>
+>> endobj
+1000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.354 385.846 414.018 396.75]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+1001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 359.809 278.856 370.713]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_adc5d20f68f042656187d507cff5ceea7) >>
+>> endobj
+1002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.716 359.809 477.379 370.713]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+1003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 333.771 283.837 344.675]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_a23b660d538bf3d3140ab3a4dfe649f61) >>
+>> endobj
+1004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.177 333.771 471.84 344.675]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+1005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 307.733 289.925 318.637]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_acb2d4b9c84cd7b7b4f2abb568471c424) >>
+>> endobj
+1006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.74 307.733 428.404 318.637]
+/A << /S /GoTo /D (group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) >>
+>> endobj
+1007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 281.695 284.385 292.599]
+/A << /S /GoTo /D (interfaceppl__Artificial__Parameter__tag_ac7eb99bc96d86baf058f856e41b2ddfe) >>
+>> endobj
+1008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.201 281.695 396.852 292.599]
+/A << /S /GoTo /D (group__Datatypes_gac3cf4d5c81ff784729bb5d1c8d48ce23) >>
+>> endobj
+1009 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1013 0 obj <<
+/D [1011 0 R /XYZ 89 770.89 null]
+>> endobj
+66 0 obj <<
+/D [1011 0 R /XYZ 90 721.073 null]
+>> endobj
+1014 0 obj <<
+/D [1011 0 R /XYZ 90 629.693 null]
+>> endobj
+1015 0 obj <<
+/D [1011 0 R /XYZ 90 600.731 null]
+>> endobj
+1017 0 obj <<
+/D [1011 0 R /XYZ 90 560.56 null]
+>> endobj
+1018 0 obj <<
+/D [1011 0 R /XYZ 90 520.44 null]
+>> endobj
+1020 0 obj <<
+/D [1011 0 R /XYZ 90 480.319 null]
+>> endobj
+1021 0 obj <<
+/D [1011 0 R /XYZ 90 400.992 null]
+>> endobj
+1022 0 obj <<
+/D [1011 0 R /XYZ 90 376.838 null]
+>> endobj
+1023 0 obj <<
+/D [1011 0 R /XYZ 90 349.106 null]
+>> endobj
+1024 0 obj <<
+/D [1011 0 R /XYZ 90 323.068 null]
+>> endobj
+1025 0 obj <<
+/D [1011 0 R /XYZ 90 297.03 null]
+>> endobj
+1026 0 obj <<
+/D [1011 0 R /XYZ 90 255.19 null]
+>> endobj
+415 0 obj <<
+/D [1011 0 R /XYZ 90 143.749 null]
+>> endobj
+70 0 obj <<
+/D [1011 0 R /XYZ 90 136.981 null]
+>> endobj
+1010 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F11 615 0 R /F85 267 0 R /F93 336 0 R /F24 173 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1057 0 obj <<
+/Length 2452      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s۶~���[��ƍ �<�I�I�69���v<4	I�H��K
�ןō7Ӳ\+I�3&���,�����_�~�8;b/F��»Xy1�B
�@�[�}�C�K�1������R��˜��,��&Y/�4������*I�y}'W�Z�ȗ�Q����/~=����3�c���F^�;��7�2���Èőw��<N<������a�7F4PM�����d� B�&��m��L��/�"m�5?���K1���#�cC�/
�?����$�k��v&�m��q'wW �^�E�"��{F� 
��	�
ρ@S�iSV�C�Ǻ����a�(2�x!��C�$
��[���n��`4���
@�9�`��檵U�;=@-��Q�
�k���2��&(��I��ۈ�e3�

j�D1��'�4���ɖ9�#������/�i��iK"8�E<��z^-X�K at W�X2L�D=��  ӗ�m�9�����y�1�?%�V�Nl�(5����|L���q+��+P��$��]y{c�����y~��23����b6�X�(b'@3f$+
+'btK �D��Q�5!x�����n���۠�2���a`�Fm���/G�x!����FBa�Fa�O�7�5��S
��R]��o���齺
�/��5����c� ؗ�
�(��k+�/3h
+Q�#7��7X��Z&1]�0T�6��a��.� �#4��������y�T(
X��;LV?�VLj �of,�Ǎ� @"�
j9�n6U��^f���e�4
Dž��|��$��'�t��ƴ��
��I��
��:)>3�:����F�)e�%66��Éf��\���(�D!$�Ƥ�)�#���w%�PV7��*s�d�K�.Z
�3*a ���+``N% �s�
T\p��
� �� 
���C�a����p ��7C�7�C����U�x�
picT��#3p E=
����9�q 	@��#�(�:]T��V6�T�:ao�r�l�*�9�ȳ��2��m�����@�ܹ���:
+X�{
*w�G�<�k����[�
B�����V-l_i&���u�ݚ�}�Ț6ٺ x%���2�e��9�/	#�b�O�$�2�d�7���c
+l�.U����)�7��1��a�;q�{/�)
Q�zPh���?�-�ҁ:��m�8�886��?�At��w[�o~��:'�,�i+����/뼁T�tN���䳹7&�\~H;�����]�Z��U����F��s�=
r�+�tcf�I��J4�Cq?1T����w���E at U���vd
r�'ES�#@h=��>	���p|Ɠr�^V�d��-w]�3w��y���#��l����<�K�j�K�?k�j���K&���V�����e���P
��3�5
%�/�ʶ���t��|R��yv"�w���x��"o&s����n��0
V� *��U�
+
+�ݔ�ȩ���߁E�!�AȁQ�I�z�L

�tF�0D
?d��W�:���a��\�^o�T�yc)Ar2[r�S����4:����b-���,�e���t�]�3/:�=��6�Q�_"C��x�JpI>���ilU��\����pw�E
�"Fp����E
�
d�a��d.#�a��P��5^�
Y��)^�ǣ���q&��8u����ܧ�j����
+F~�ߣ��V�=[���;�|>"=��^7Y�Ν�E4<��
(������VT��W�6��
(b�1��H/�J&�S�}>�A�q�p
�N���iPR �۹� Ȱp,�GB��~b�$�A�n�j4�b6�
�ѭ�`��6
[��u
�0���Q�L������L�L2di��:n�A� 9�H��#G�S���OU�aC����	 GW\&�[�������g���:���:/d��[w�公�*�����^C�ba�f�}.rG��.���N�bN[��@��ˆ���8�K��64��ի�
��f��*u�.Ϥ�d�Z�+�cs-I�Wꏝ����N
�/��T��
��k�c�L�%|ɒ�A���KWh���q\o�P����$:�2İ��Ht��+}~���������o_�Ɯ T�.�1�+;�+	�[\�Q�?:�m�N��u_�4�u�@�WI'�v-��
�d="�u��iz��2i��n�!��9ȸ�C
#�
{F��jLj��r���F��X4���R.Ѩ�V,�A
A��e�*�uU��GQg�St)?����kYȪw8��$��J�I���F�T��O�ޕ�Y4�vW��N�r#�
�X ��f4jz�NPH_ٱW��%;��@q
�Kv<DA
MD������uR��d-�wG������a+�ߓ�M��AED뱇A@m�Z�{)�^�?z������m�����,a�4����W�����'�!¢��:d�ʪ���ҞFr
��U6�0l����<&���
+����M�
�v�{Q�2�����cm
+endstream
+endobj
+1056 0 obj <<
+/Type /Page
+/Contents 1057 0 R
+/Resources 1055 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1075 0 R
+/Annots [ 1027 0 R 1028 0 R 1029 0 R 1030 0 R 1031 0 R 1032 0 R 1033 0 R 1034 0 R 1035 0 R 1036 0 R 1037 0 R 1038 0 R 1039 0 R 1040 0 R 1041 0 R 1042 0 R 1043 0 R 1044 0 R 1045 0 R 1046 0 R 1047 0 R 1048 0 R 1049 0 R 1050 0 R 1051 0 R 1052 0 R 1053 0 R 1054 0 R ]
+>> endobj
+1027 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 641.225 223.166 652.129]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a5fa6bcd4ec3cf844646033688f2fdf0a) >>
+>> endobj
+1028 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.982 641.225 298.463 652.129]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 607.294 277.402 618.198]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_aaf38dc5a17ef89e16c45f363397afb59) >>
+>> endobj
+1030 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.218 607.294 352.699 618.198]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 573.364 296.52 584.268]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_afabc584f4f391708d6c0d7c47030471a) >>
+>> endobj
+1032 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.336 573.364 371.817 584.268]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.682 573.364 489.176 584.268]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1034 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 550.392 285.96 561.296]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a39db5035590b4bf7017a43cdcca6a49e) >>
+>> endobj
+1035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.775 550.392 361.257 561.296]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 527.42 305.078 538.324]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a1ef606afeb25edded051be3b0c728086) >>
+>> endobj
+1037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.893 527.42 380.375 538.324]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.48 527.42 494.974 538.324]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 504.449 230.608 515.352]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_acad04388edea0d80b20c40266a3c3f14) >>
+>> endobj
+1040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.423 504.449 331.917 515.352]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 450.053 244.456 460.957]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_abe5af687ddf08c6379bd115d210ac22f) >>
+>> endobj
+1042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.271 450.053 345.765 460.957]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 427.081 221.203 437.985]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a001b2a61c18a500a446151a9024de3fe) >>
+>> endobj
+1044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.019 427.081 322.512 437.985]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 393.15 252.755 404.054]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a474cce1b8348a126a8496cea7952a1f1) >>
+>> endobj
+1046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 370.179 222.319 381.083]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a526a2d8ad27e00b633408a36830dc2ae) >>
+>> endobj
+1047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 336.248 223.973 347.152]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_af0b12578ecdb0571ca51ee09789b2fc3) >>
+>> endobj
+1048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 270.893 238.369 281.797]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_aa1816497499ee569563a6d97a4ff553a) >>
+>> endobj
+1049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.184 270.893 339.678 281.797]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 247.922 241.686 258.826]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a1e3bb22af6b60660fcb8d201b09ec7ed) >>
+>> endobj
+1051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.546 247.922 403.039 258.826]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 224.95 246.667 235.854]
+/A << /S /GoTo /D (interfaceppl__Coefficient__tag_a249071ec2d19ecedaaf4e32ca8fc4a8d) >>
+>> endobj
+1053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.007 224.95 397.5 235.854]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1054 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1058 0 obj <<
+/D [1056 0 R /XYZ 89 770.89 null]
+>> endobj
+1059 0 obj <<
+/D [1056 0 R /XYZ 90 704.286 null]
+>> endobj
+1060 0 obj <<
+/D [1056 0 R /XYZ 90 655.571 null]
+>> endobj
+1061 0 obj <<
+/D [1056 0 R /XYZ 90 622.282 null]
+>> endobj
+1062 0 obj <<
+/D [1056 0 R /XYZ 90 587.898 null]
+>> endobj
+1063 0 obj <<
+/D [1056 0 R /XYZ 90 564.926 null]
+>> endobj
+1064 0 obj <<
+/D [1056 0 R /XYZ 90 541.955 null]
+>> endobj
+1065 0 obj <<
+/D [1056 0 R /XYZ 90 518.983 null]
+>> endobj
+1066 0 obj <<
+/D [1056 0 R /XYZ 90 464.398 null]
+>> endobj
+1067 0 obj <<
+/D [1056 0 R /XYZ 90 441.615 null]
+>> endobj
+1068 0 obj <<
+/D [1056 0 R /XYZ 90 407.685 null]
+>> endobj
+1069 0 obj <<
+/D [1056 0 R /XYZ 90 384.713 null]
+>> endobj
+1070 0 obj <<
+/D [1056 0 R /XYZ 90 352.508 null]
+>> endobj
+1071 0 obj <<
+/D [1056 0 R /XYZ 90 287.142 null]
+>> endobj
+1072 0 obj <<
+/D [1056 0 R /XYZ 90 264.151 null]
+>> endobj
+1073 0 obj <<
+/D [1056 0 R /XYZ 90 239.484 null]
+>> endobj
+1074 0 obj <<
+/D [1056 0 R /XYZ 90 201.605 null]
+>> endobj
+416 0 obj <<
+/D [1056 0 R /XYZ 90 72.447 null]
+>> endobj
+1055 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1097 0 obj <<
+/Length 2065      
+/Filter /FlateDecode
+>>
+stream
+x��YY��~�_��,UY�$8I�*�#���vv��]��%!
��%�����E�u�Gv������� V�q�����u���!
��2�q�����Ä���JD���/~~;�v�^�ݼ��|�!Єb�
� ]�|���1���2x0���
�E����7ؙ��U?�a���X�-�OB�	���O6�����X�!
ǧ�aHȨ�gD3a
��Կ��U�Ue�Ft�	L��;�r���cӪ��^
+s#y��	DC1ЛVeӎ�
)"�JjC���y�꤭�C�
\0��f��b2��&�h���(��7%��L`���;��6Uw�8�}
��iF��;�
1
[��ēǍj@�������r[�m��>a���.A^��gU�g���n
0�
��=;p0#
+)�|��i�͔�	����^�=��#�"�;��-�ŽJ2U��y��Pv��7�Xg7[�[2B
f�g)���T��*����[�K��k�
��j�R��I��T�~&�{)+׸V�O���
��@�΂��HČ ��8��ަ ��{+��M��ʵ*�=8�T��y�� %��#�b0$�0@�yٺ��}��w��
�.J5�b��Q��2���b�=z�^���sR��\i,
+Q̙G�G����`E8�%� ���
�"�00�zLĈJ�2XT*"+�m^d�U
@Ԕ�ُ�Zb�<U7�|���5���Cc�!Yy��fY=e at 6Mc�����((�d���`b� A:�E�+�P�$�����(Jȓ�X���X�)�
��Vtz3��H�C;7`~;�gb���b��$�o��'�
SK�ƈ'�
�)�'
"���A�8�`e���o��an-�����I�gZm
�[�
�/�l3䝷�×����q�Νzzwҿ��2�	޶:�-�9��*U��/1v��&��� �B����$�z1x�W�O���	@�s�煅���v�̬9�`?��L�U��:�O��ec�0XO1	޲�M�Lo,Œ��(�$X9�N�]���s(� �J֜w�Ӑ%��r,�"f3U�V�AI�e�8�Q�<����r<��y�tiD�|�)�X��G�wc�	�.�o�s'~��6%x�5[Ks�
�m�2�����R/�!/
+�f��
��ۤ(
�?���B%���%�6D1؁P�l[ v�T^j_��t�2�\���L�O�ywVw�ګ�`V�:��Ә�dL�?!g_�-Cե'wP�:τ�!�ݱ�r<��
���iVH��iy��9��ZSx�
w��0\��[�=�jU��L���Kg.;�
0�XQ�9��m���
pa� )G�;�ی
+�"q!�3�\]�l�2�����{1ȮP�
G�U�=���R?���b�^�.�7��Y�/-��T��7G0��5<��
�
��Lj��g�0 �C��P���D�xn�?�O���?8�||�ީv[�ԓI�>�����/�~��(�l�L��PO�m���KD���8�
�a����HK��:���y$���wW�?��m����
G�����3g��n�SRA@악
����
-���S`Þ3��഻�@��v�Tm�� �j�:��c�'
��	��݁��/�[���+�{zͧ���
+t�S`?��8a��2�d��εJ�YU�j��4�qОT�����DS�����/{��'�s��I���%���+�>��.a4���a?-?`���


��a��!q�r�a�%��怠w�?��U�VO61�n�.��O�
|0_�}�J���#���{AdYEe��:�@�F
u7d4�^�O����BF��a* ������k`
�(�.%.�>$:�׹>Բxx���Ut��þ�sׇ����z�q�f��\�����w\����k3�*�7�!Ee�޸�rp��\�'�$��i쿛F?���}�f��
+����@�l'Ѐ6/Dq�g�S
+{�CV�嗟��
��))W�d�|�~�F�iT��� ���JJ��g��iS�MGr�M���������o��yc��g{�a;"�
�m������]5�\��Z�v78��$����׍y	?׆���F�O���
+endstream
+endobj
+1096 0 obj <<
+/Type /Page
+/Contents 1097 0 R
+/Resources 1095 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1075 0 R
+/Annots [ 1076 0 R 1077 0 R 1078 0 R 1079 0 R 1102 0 R 1080 0 R 1081 0 R 1082 0 R 1104 0 R 1083 0 R 1084 0 R 1085 0 R 1106 0 R 1086 0 R 1087 0 R 1108 0 R 1088 0 R 1089 0 R 1090 0 R 1110 0 R 1091 0 R 1092 0 R 1112 0 R 1093 0 R 1094 0 R ]
+>> endobj
+1076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 564.657 320.769 575.561]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a9af8efc183a5a4cd4475146207f92c8a) >>
+>> endobj
+1077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.987 564.657 493.669 575.561]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.714 540.136 492.53 551.04]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a38ece4277d5885940d45d6c8465ca19a) >>
+>> endobj
+1079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 540.136 513.996 551.04]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 528.181 282.045 539.085]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [306.373 528.181 502.067 539.085]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 492.701 500.882 503.605]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a9c7ea131b285ad7aaefbc1e2cf579512) >>
+>> endobj
+1082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.099 492.701 513.996 503.605]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 480.746 282.045 491.65]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.15 480.746 494.844 491.65]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 456.225 328.211 467.129]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_ade6bd909f8bb4bcdaed4dced85c1f5f1) >>
+>> endobj
+1085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.429 456.225 513.996 467.129]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 444.643 134.838 455.174]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.705 385.614 352.073 396.518]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a7f1fc328bf8f0d2ec92a6599ce7fe2d3) >>
+>> endobj
+1087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.488 385.614 513.996 396.518]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 373.658 168.591 384.562]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.033 373.658 285.641 384.562]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.143 349.137 344.895 360.041]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) >>
+>> endobj
+1090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [348.748 349.137 513.996 360.041]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 337.556 134.838 348.086]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.243 312.661 346.554 323.565]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4) >>
+>> endobj
+1092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.507 312.661 513.996 323.565]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 300.706 163.61 311.61]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.07 300.706 369.765 311.61]
+/A << /S /GoTo /D (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) >>
+>> endobj
+1094 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1098 0 obj <<
+/D [1096 0 R /XYZ 89 770.89 null]
+>> endobj
+74 0 obj <<
+/D [1096 0 R /XYZ 90 721.073 null]
+>> endobj
+1099 0 obj <<
+/D [1096 0 R /XYZ 90 630.429 null]
+>> endobj
+1100 0 obj <<
+/D [1096 0 R /XYZ 90 579.39 null]
+>> endobj
+1101 0 obj <<
+/D [1096 0 R /XYZ 90 555.51 null]
+>> endobj
+1103 0 obj <<
+/D [1096 0 R /XYZ 90 508.075 null]
+>> endobj
+1105 0 obj <<
+/D [1096 0 R /XYZ 90 471.146 null]
+>> endobj
+1107 0 obj <<
+/D [1096 0 R /XYZ 90 400.347 null]
+>> endobj
+1109 0 obj <<
+/D [1096 0 R /XYZ 90 364.059 null]
+>> endobj
+1111 0 obj <<
+/D [1096 0 R /XYZ 90 327.583 null]
+>> endobj
+1113 0 obj <<
+/D [1096 0 R /XYZ 90 264.892 null]
+>> endobj
+417 0 obj <<
+/D [1096 0 R /XYZ 90 144.591 null]
+>> endobj
+78 0 obj <<
+/D [1096 0 R /XYZ 90 136.92 null]
+>> endobj
+1095 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1158 0 obj <<
+/Length 2101      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�6��W�r�*���`r����:�t{*�N�EK��
+���=�_?�"���RO�D�����
+�`���on&�o#
�(i�,����m|�FḪ�xZU��e��ת���OM���6Yͮ���wE��e2W���Z�zF�T�$�d����7�M�q3�sB� 8 fC�"�����q�����X,��nP
p��&��`{v���M���H>��D�!�ʒV-�tTN߮�y��Eӝǭx�6�W�#�c��oX������'�k��v&�m������е�nSK���7'��D
�!�`�
Dд�zޖu�Y��M���\vӤX���
��0�lB�����R�5%�x% )la���ꕕ��n��Q��P3*���`��'h��]r��оة��!|�R�L��Q,�S͛�"�0/�z
 � ���
+�i�f�f��1�<U^�O���v�4Ϲ���N[�i
��1s�+�3u�v�Ţ��h�����޹iDP�x�b3h�8"�b7
��#q�T\6��Uuy�H�[��O�"��0��h6�� ��(�q1-��zU4`<��*��h�6�-1M�
86��E�e�8��g��$�3 ��� ��˼�=�A/p�q$7�9�0�c����
s� ��8`"����0QX��?i;�M�Sq��S��h�b.�kԍxڤ�*SmY��-�»�)
�om�0�|+���|I����~Z�)=�
-��(�P��p>K�X�Q��Y�+	쓘.�$е,�
�
��
a���	3 �@.��`n��!C�<I��P
��z�OS3" ��d�Z5cy���
+XD/�mG!��<{�W�4�`��by�;z:�h�Y4����l+t{|A�F�0*�O�N��(��B
h����(�k�
���N^��m4�#=}e���R�'ƐB�(��@�@)_�3LB�BΡ28�@�t��5�y��؅M����o�W���lG/����`j@4�r.	���S�aD"�1(����|
�(�@��B-<C��P�չr�
Y;JQ�ɶ��3��I�.�z9[˲+	���4͛��� ���]=O�����k�6�fb�5AUY,L�ݶ�4�|���f�M��{��}�d.@�S�əJ�@�T
+�U!�R
+Olk
�2Ǡf����?�:ŏ�"]>
(�v�<#H9PJ`g�w��T	��t�e��ɰ�˝t����o(���m�*u�p�#��%?9�$q6(Z��KGM�NP�)�G�&�o��C�F6�&�Au)�R�/�
�R�	c�YH2z4'�H���x���W�*>�U��*ڮ�;�@
m�`��+myW�)�rKGEL'���c��z�+��<�
+Ф�N�$��8��f�G���Տiә�#���Xe��]w�U������-�9�:�݃��}QD'G"�qC$�ܸ�=����Y�6BLoz��J�'؛/��^�N�اE�}���K�c���͂1��͋��V��b�O���Bl�4� ���x_�T&������R�1����B~��z"<z~��#~��������("^B���Qu��ʗ�Z�*�)2~�{�zOs�֌��
�
߭���'ͫL��Ǥ5q_G����4)`
��B4���]����x�F�w���jO^V���5uW��
+� ɏ�G(t�u��{�o�f��k��F-�6�[:-]����u'Ǖw
պy���l.
+
��܏��g�����9���e.�Τ�y������\�>bP퐥�H�bË!ɉ�3�g�
�j�5���j���@ɑ8G�\6€�_���oޞi
}|�|Wgҕ�4;^R�
�'������w�`9Z�G䘯���g�CgY���㑌�6�\�v5I�4�<n��1
+c�m9�պ��y��ì|�@綃iy[�0��R}��2��a��);�7��+`W��I�����-�o
~����㇤X�����7���G
+���oZ��o�:�6Ł
��z�%�HU+�)����r���G�Z�k��ޱI�Q�)tݷm�����zըb��别�L�t��+����
kuqr?�9�>Q^�r
��#L��v#��h;���,xS�06��/�
+endstream
+endobj
+1157 0 obj <<
+/Type /Page
+/Contents 1158 0 R
+/Resources 1156 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1075 0 R
+/Annots [ 1114 0 R 1115 0 R 1116 0 R 1117 0 R 1118 0 R 1119 0 R 1120 0 R 1164 0 R 1121 0 R 1122 0 R 1123 0 R 1124 0 R 1125 0 R 1126 0 R 1127 0 R 1128 0 R 1129 0 R 1130 0 R 1131 0 R 1169 0 R 1132 0 R 1133 0 R 1134 0 R 1135 0 R 1136 0 R 1172 0 R 1137 0 R 1138 0 R 1139 0 R 1174 0 R 1140 0 R 1141 0 R 1142 0 R 1143 0 R 1144 0 R 1145 0 R 1146 0 R 1178 0 R 1147 0 R 1148 0 R 1155 0 R ]
+>> endobj
+1114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 636.2 261.602 647.104]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_af6cb7e34c1083df796fb12aa463739e6) >>
+>> endobj
+1115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.417 636.2 375.334 647.104]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 610.358 334.099 621.261]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_aed43bafe74e2b291d7b980c6ee8f3d5f) >>
+>> endobj
+1117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.915 610.358 447.832 621.261]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 584.515 338.473 595.418]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_ae5f214d520a1f232251bee39685b62a2) >>
+>> endobj
+1119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.691 584.515 451.608 595.418]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.273 584.515 513.996 595.418]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 572.559 187.959 583.463]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.316 535.757 374.601 546.661]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_af03d1a4f7f355971ac31ec1e4cb7297d) >>
+>> endobj
+1122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.627 535.757 489.544 546.661]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 523.802 261.024 534.706]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.675 487 382.518 497.904]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a68de3cffc4bbfa2a79c06c51adb653a8) >>
+>> endobj
+1125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.903 487 496.82 497.904]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 475.045 261.024 485.949]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 449.202 269.043 460.106]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_aa8fd21a451fe377a328d750951ce36f3) >>
+>> endobj
+1128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.859 449.202 408.788 460.106]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 386.911 313.277 397.815]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a8cba47c10a4d9a84b170b37932dc04e5) >>
+>> endobj
+1130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.495 386.911 452.424 397.815]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.126 386.911 513.996 397.815]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 374.956 149.224 385.86]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 349.113 270.159 360.017]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a8ce02af4c13862f7988ad3e43b5290cf) >>
+>> endobj
+1133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.975 349.113 409.904 360.017]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 323.27 266.643 334.174]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a5a6326e465cce738cb09fdd8df1d92ba) >>
+>> endobj
+1135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.861 323.27 405.79 334.174]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.492 323.27 513.996 334.174]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 311.688 194.603 322.218]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 285.471 259.041 296.375]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a2c60071e2c7adec51fc7175ddb7a3bff) >>
+>> endobj
+1138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.259 285.471 398.188 296.375]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.891 285.471 513.996 296.375]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 273.89 194.603 284.42]
+/A << /S /GoTo /D (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) >>
+>> endobj
+1140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 247.673 259.639 258.577]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a56b9fe489466e7376b72bc99b4f99126) >>
+>> endobj
+1141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.455 247.673 399.384 258.577]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 174.423 264.61 185.327]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a3ce50d0fcf796935652563144194ccf7) >>
+>> endobj
+1143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.426 174.423 378.343 185.327]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 148.58 319.912 159.484]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_ae88c914d522014d2d181278bcfa9222f) >>
+>> endobj
+1145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.13 148.58 433.047 159.484]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.749 148.58 513.996 159.484]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 136.998 134.838 147.529]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 74.333 276.804 85.237]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a19d1974dd5b293a48b8f2de6fa3c2c8b) >>
+>> endobj
+1148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.62 74.333 416.549 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1155 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1159 0 obj <<
+/D [1157 0 R /XYZ 89 770.89 null]
+>> endobj
+1160 0 obj <<
+/D [1157 0 R /XYZ 90 704.286 null]
+>> endobj
+1161 0 obj <<
+/D [1157 0 R /XYZ 90 651.264 null]
+>> endobj
+1162 0 obj <<
+/D [1157 0 R /XYZ 90 625.61 null]
+>> endobj
+1163 0 obj <<
+/D [1157 0 R /XYZ 90 599.767 null]
+>> endobj
+1165 0 obj <<
+/D [1157 0 R /XYZ 90 551.01 null]
+>> endobj
+1166 0 obj <<
+/D [1157 0 R /XYZ 90 502.706 null]
+>> endobj
+1167 0 obj <<
+/D [1157 0 R /XYZ 90 464.455 null]
+>> endobj
+1168 0 obj <<
+/D [1157 0 R /XYZ 90 401.974 null]
+>> endobj
+1170 0 obj <<
+/D [1157 0 R /XYZ 90 364.365 null]
+>> endobj
+1171 0 obj <<
+/D [1157 0 R /XYZ 90 338.522 null]
+>> endobj
+1173 0 obj <<
+/D [1157 0 R /XYZ 90 300.724 null]
+>> endobj
+1175 0 obj <<
+/D [1157 0 R /XYZ 90 262.926 null]
+>> endobj
+1176 0 obj <<
+/D [1157 0 R /XYZ 90 189.486 null]
+>> endobj
+1177 0 obj <<
+/D [1157 0 R /XYZ 90 163.832 null]
+>> endobj
+1179 0 obj <<
+/D [1157 0 R /XYZ 90 89.397 null]
+>> endobj
+1156 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1208 0 obj <<
+/Length 2381      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo����_!�*�z_�e�+p�ą��4M�O�A`ȕL�"������}��J�"�:�
��rvg晙g�Ɠ�O�y�����U�'�Ln��OB
!��t�q�����_',��D�dF_���훷��7�_/<�b�(��d}��w<Ia��	F,��3i=��5�|���v[ٽ��I1�������ېD��Ȼ*+�Zo��*b�ɔ#wn���
O\�J�	M9"#B��팺I�m3"�QDè���IZ%.���q�@�>
$��O�
+��ǹ�x
+��am�j�
��L�O7�|����F�`�,V�V�Z|x��ޕ�_�����ycՠ|�7a$Yg�O3;�Ӏ�H��$���/��ˤ,�
.��=~�M�AoM��s2����unD��4w�ެ�{U�[ ¦ł�F �a�o�gB��
o1�3q�D�$wq5
+��C�
 ��c�l���/�?5����</���ܨԎ��Y��<}��ޔ�	U9�9IwY2#bzgf��V3NU���V�}��G��Gt�	z
��3��}��u�e�t��
��A�?��i�q�hDNH������F#>
_���ӱK:�*C�o�VE7Y���
+8���{0�T a#B�X�7�E
�P�1�
BS^�鏡�L8"
+Y���z2�h!p�����0"�
�
�e5�bZ��DI��i`�;`��l�/�
C;�u�2��"
�	Dfs�F�Ug�ɚT¯:���Q�R1���ʻ�I<}ܨζ./�E�E��e�y�a�U ���ek�\��p4�_�Օ���>K��Sn����Pv��>��*�;�
���]I
�;֓L'</��;p0�U^�(���v�C�S��k��v���J��
�,��nYBm6*��R��z�9�/g]T at 9�N�35hq����Stw���"���B��A[�� r��"�P���H��X�� &®粽��<�eED�� d��vd�"��y���H�/�ijp��Qzm�l}
?߫%<SU����[�g
+^��1S?5
��/Y���TٙЧ�3���.
�>"+D�|��0�ڑ'
+d�C�qBr$КS��U����]��i�:#|?�a %�mٴ	�.n��ۄS���t�j������ёb�Rn�a4�Ҭ��&MYծ�\�٪�id�Ր���cjB%��5�@�z7��8�P&�,v�jH$�I�����˧P�Mr�-�r@�o�B���ͷM���e1B�@�\�*qn��!�"�`@~���!��x:7'8t���̖Z 
��+K�  ��H@ژ��.�f4�!��P0�%w
(��
2
�|6�����l�C1�p���Z��4
[�s f��zD�D�
Ȧ5ʎ
��v�7���{�2�?�
ۡ;x�+{o����7����4u<r��&,B��
f#�Z�A�0pd���_obkp��$��w �rz�A��C���΃cd�e��6���`׷�do��c����:A�c�
:*�Htƶ{?-�PU� ��Q�zv�t4?Q ���֛��~0G�8�T����t[��5k�`�Ϲ�O���P
���=�K

+�!#b73xI)6-�S"���~���>��
‹N���(��zCm����v��^=�(���kB	2��^(���xD�q1%�
��4x�qJ�x
p
ݺi��`U�y�<���A�ӊ������(�I�Ā�(;d�=�j죚
G5��PMe�QMe`Q=�fҢ�M�T�'�ˈ/����\2�R��
4�3�^�=j�9ص��AwJ��^�J-��g+�����H��
+Ig��xe�qٴ_N
0*(b}�?7¨(�NڞU@�!6����1vK�9#+�Ճ?�z
#�$?=n��xB�r]����l�\��1�
�"�Î
���~��N�<ځ�C:��
u�Í@�k
��CR��������}fWnd
+z�
�1uZe���t��~�>�
9L΀}�'0���Ϟ�~'@	��
N��D<���r�����O�ۮ�OZ���|���,(���U5� 	8&��O���$@����B�3!�%*��U��%���5�
��^�~�w>I]���C�M[j1�K�
 �)�8M^�y�!�{�?�]�_t#ҮUom���Q�ʦ,��׍�������3��^
4}mA���/�*�U�N9���X
+�("ܝ�^�'����k�h޶�a��i�|��� (v��&��ȳS��f�"�"�?��z5���< �ܛ��;n��z�&�K֋���y/�
�B�(
+�֘`��ȝ����{w�T����Xm�{z����ZU�g�δ��E׻�h���UUOj	"�JI
 ��}P�Y�_:�ua�e{�8
+d�G�f�����vU�b��r��4�����8�l�D���C�u�� ��ZR
+endstream
+endobj
+1207 0 obj <<
+/Type /Page
+/Contents 1208 0 R
+/Resources 1206 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1075 0 R
+/Annots [ 1149 0 R 1150 0 R 1151 0 R 1152 0 R 1153 0 R 1154 0 R 1180 0 R 1181 0 R 1182 0 R 1183 0 R 1184 0 R 1185 0 R 1217 0 R 1186 0 R 1187 0 R 1188 0 R 1189 0 R 1190 0 R 1191 0 R 1192 0 R 1193 0 R 1194 0 R 1195 0 R 1196 0 R 1197 0 R 1205 0 R ]
+>> endobj
+1149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 696.152 280.122 707.056]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a45fb5ebe8a9c33d1e73593b09d8ab877) >>
+>> endobj
+1150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.982 696.152 479.911 707.056]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 670.548 285.103 681.452]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a3b54824f0f53bf664c3114fb67557115) >>
+>> endobj
+1152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.443 670.548 474.372 681.452]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 644.945 291.19 655.849]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_abeb7cdeabf40c32d3aa0c33c0499bf97) >>
+>> endobj
+1154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.006 644.945 430.935 655.849]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+1180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 619.341 285.651 630.245]
+/A << /S /GoTo /D (interfaceppl__Congruence__System__tag_a86691cc44e4ef41d379ec2477221f0de) >>
+>> endobj
+1181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.467 619.341 399.383 630.245]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+1182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.411 310.036 227.586 320.94]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a6d24fa81c885803e34fadd9332287d2e) >>
+>> endobj
+1183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.707 310.036 307.303 320.94]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+1184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.856 310.036 456.582 320.94]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [469.942 310.036 513.996 320.94]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 298.454 183.844 308.985]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 261.519 293.581 272.422]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a6871446de8be708c37b2bedbf12c9b76) >>
+>> endobj
+1187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.397 261.519 372.993 272.422]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+1188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 224.956 315.678 235.86]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a08a4701b629d734ea0e11231a34514b0) >>
+>> endobj
+1189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.494 224.956 395.09 235.86]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+1190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.716 188.394 304.36 199.298]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d) >>
+>> endobj
+1191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.786 188.394 383.382 199.298]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+1192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.546 188.394 504.154 199.298]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.709 151.831 313.911 162.735]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a2845e4528b7b42c6c6527daceee21312) >>
+>> endobj
+1194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.329 151.831 393.925 162.735]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+1195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.388 151.831 513.996 162.735]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 114.273 234.723 125.177]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a0399dc1a987546af5d0491e72a6a05e4) >>
+>> endobj
+1197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.538 114.273 340.146 125.177]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1205 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1209 0 obj <<
+/D [1207 0 R /XYZ 89 770.89 null]
+>> endobj
+1210 0 obj <<
+/D [1207 0 R /XYZ 90 713.039 null]
+>> endobj
+1211 0 obj <<
+/D [1207 0 R /XYZ 90 685.741 null]
+>> endobj
+1212 0 obj <<
+/D [1207 0 R /XYZ 90 660.137 null]
+>> endobj
+1213 0 obj <<
+/D [1207 0 R /XYZ 90 634.534 null]
+>> endobj
+1214 0 obj <<
+/D [1207 0 R /XYZ 90 593.431 null]
+>> endobj
+418 0 obj <<
+/D [1207 0 R /XYZ 90 482.92 null]
+>> endobj
+82 0 obj <<
+/D [1207 0 R /XYZ 90 476.087 null]
+>> endobj
+1215 0 obj <<
+/D [1207 0 R /XYZ 90 377.702 null]
+>> endobj
+1216 0 obj <<
+/D [1207 0 R /XYZ 90 325.04 null]
+>> endobj
+1220 0 obj <<
+/D [1207 0 R /XYZ 90 276.711 null]
+>> endobj
+1221 0 obj <<
+/D [1207 0 R /XYZ 90 240.601 null]
+>> endobj
+1222 0 obj <<
+/D [1207 0 R /XYZ 90 203.586 null]
+>> endobj
+1223 0 obj <<
+/D [1207 0 R /XYZ 90 167.477 null]
+>> endobj
+1224 0 obj <<
+/D [1207 0 R /XYZ 90 129.465 null]
+>> endobj
+1206 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R /F100 1218 0 R /F99 1219 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1254 0 obj <<
+/Length 2196      
+/Filter /FlateDecode
+>>
+stream
+x��Z�o�6��B�}8��E�W
p�6�m���n���-|�L�B��
I���P$%˖'�[��ar�3��<8����οg_�ήn8vB4pn�N�
�r>�
���`�ݲL��E^7U�����纑�2Vo�I#��)�em�
ʰ�6�W�(���\�jN�+s��P
��/����6#�
�͟!.�8�}�;+x����
+��9>��:g��a#
+�)�����	A�h�~��u��4�ӂ�� �y�Sm̪>t� F
��U�,�D\��L�uR��$Ռ�1�Giv�w�6St�/�^Y��e�#*W7��Q�PDpi}`��{��Q(�
��$dDs�-�#`V�Y
����΂x����V��Zá)4��ۙ��H�
0���د��hu&з�
��b=�E����R�'�0�	�?���H;
�|7q@�ˡE�hŅ\�)S��q"�P�9� ���(�0}
+\�ʽZoT�}�@�z_������Ґ1���
���G�L��x]��E#Xf
+���<߳Hȏ �
 �3
���p���>���.�
C���'x��wA�[�־d��谳^y
+[�Pn �כ&��Ȋ��e��K �_�P0�J(R��(��CQ+tN��Q?Z��+펀�(�,�av&���\DY�jS���9ً��R'���
�����]yg
+�\ 
�g� ��b�5� ���;�C U�-�:i�{�_��R�W��+=$�Jt&`Y�1����b�a� �T�]U&W_���M���"��6�=����VX�x��HS�7�p����T<$.��Y��H��Eż���^r��{�5�PI� a���P/kXF�Jߔ��F�m����<�Ef��Im���(G$�Pܰg����k��
n~��M� Ч�S�ݜb�팸IrS3�mƖ5:��G0��7eH�&���˶���mࢉ޴y��]?�� �>J1~�͖˲RE���a\j����-�^-����D'���Oz�)�
�%}�U7��m&�xQ
��C�B�1r��֧���o��G�$ab�>����JF�	a�� �
$�tne����-F��<� H<>V�+AB����>%Q}*L⭭\�`��|&G���
��P��	ixY�D6T�i/�ߨ�&���*4UL�.
�T�IJw}�&���[�LL⨥z�DS�$\#�OȠ�=
�
���I�:N���ʋF��#N6#���N�dҀ��=��k����RǮ�K}�!���#�aLJh�p{�|�A��z�P
��T�?i�^���"�Wō�$r<�|O��ށ��D�:U����Y��8�"%�d��~�(SJP�N���(o�B
ڎF���i��M���k���J�f� �2X��AUm���v?���+F�}�=N��"Z'��^ס0(���C�2�&HT�
+��J�m�Ŏ��*��9�
+u_��Zս���.
���s�1p
+B>2��[�Iٞ��"n�1�zɚmR]�^��_�VC�\WE����
����}ͥJ�T~9��$��*+�D����r+�Dd�f��.��6���0�|��7�i;l�� ��C��;>�
� �o�u
�1|YH
��la
i{{� �����($d�\wS��
�YS��c�].0��y0�L|!�e���ڎ��2'����ŀ�c�M4��F���6-<~�k�OV���	.ք_�	���X
�

D�w�����ӱ+�u(K�8mW�+Ɔ�`O>�ܯ&h��ҹ�m���
=�@�1�'#�3(�<�
!����8,P�I'5{�G%+?�u�ۨ�]�=㊪����������m�#�����v�:�Hv}G�k������M���

e��?�D*�����'�O|�x+�!_���e�4���s$(�_�Iڧ���~��v��>U)Q��g͇������?S9.O�{]�L�9YM{��!�S�
�Fɉ��K`�ש?QK��<w������sc� �`��	���&z�!�s��m�L@~�ӡ�v�=��!��P �`C�����q����;}s�/�|�F����(1����UT_D?�m��{r�����oU�
/+)���s�Q���ձw�ͺ�5,[U�����6M����]��Bn��";��d�8�4����Ȫ���Ȧ+V�L5�j���
� &��n��}���h^\��<�M�������
+endstream
+endobj
+1253 0 obj <<
+/Type /Page
+/Contents 1254 0 R
+/Resources 1252 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1075 0 R
+/Annots [ 1198 0 R 1199 0 R 1200 0 R 1201 0 R 1202 0 R 1203 0 R 1204 0 R 1258 0 R 1225 0 R 1226 0 R 1227 0 R 1228 0 R 1229 0 R 1230 0 R 1231 0 R 1232 0 R 1233 0 R 1234 0 R 1235 0 R 1236 0 R 1237 0 R 1238 0 R 1239 0 R 1240 0 R 1241 0 R 1242 0 R 1243 0 R 1244 0 R 1245 0 R 1246 0 R 1271 0 R 1247 0 R 1251 0 R ]
+>> endobj
+1198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 707.957 279.554 718.861]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a5e1c7e98053b2262c5f56c46e2f04f05) >>
+>> endobj
+1199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.37 707.957 384.978 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.881 707.957 478.237 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 682.518 252.137 693.422]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a553952be8bff48ab2a4a8b2820efc047) >>
+>> endobj
+1202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.355 682.518 356.963 693.422]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.79 682.518 449.147 693.422]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.625 682.518 513.996 693.422]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 670.936 134.838 681.467]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 645.123 297.268 656.027]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) >>
+>> endobj
+1226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.083 645.123 402.692 656.027]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.594 645.123 484.075 656.027]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 619.684 245.253 630.588]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a10d11983038c7047547f4a68f8ea2b70) >>
+>> endobj
+1229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.069 619.684 350.677 630.588]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.58 619.684 432.061 630.588]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 594.245 225.318 605.149]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_acaca085247f8483085877e21527a9cd6) >>
+>> endobj
+1232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.134 594.245 330.742 605.149]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 522.105 242.484 533.008]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_af61686ed9ede21b05016ee29f9de882b) >>
+>> endobj
+1234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.299 522.105 347.907 533.008]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 496.665 245.801 507.569]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a4ea3e6a8b8e929e318a5c1c450667d10) >>
+>> endobj
+1236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.661 496.665 411.269 507.569]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 471.226 250.782 482.13]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_add70a09fb9b3cb0b8b7ce79d8d9ec14c) >>
+>> endobj
+1238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.122 471.226 405.73 482.13]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 445.787 256.869 456.691]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_a29295feb65378f2ba04c202f4b9a1bb3) >>
+>> endobj
+1240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.685 445.787 362.293 456.691]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 420.347 251.33 431.251]
+/A << /S /GoTo /D (interfaceppl__Congruence__tag_af39f78c492db753013cbfd0177ffea60) >>
+>> endobj
+1242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.146 420.347 330.742 431.251]
+/A << /S /GoTo /D (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) >>
+>> endobj
+1243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 111.728 314.741 122.632]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a061420fd93cf031e877897142071c67d) >>
+>> endobj
+1244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.557 111.728 481.613 122.632]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 86.288 479.073 97.192]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a60ac68b3806bdf2e8b4805d661c52def) >>
+>> endobj
+1246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [482.291 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 228.924 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.328 74.333 443.397 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1251 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1255 0 obj <<
+/D [1253 0 R /XYZ 89 770.89 null]
+>> endobj
+1256 0 obj <<
+/D [1253 0 R /XYZ 90 721.073 null]
+>> endobj
+1257 0 obj <<
+/D [1253 0 R /XYZ 90 697.669 null]
+>> endobj
+1259 0 obj <<
+/D [1253 0 R /XYZ 90 660.275 null]
+>> endobj
+1260 0 obj <<
+/D [1253 0 R /XYZ 90 634.835 null]
+>> endobj
+1261 0 obj <<
+/D [1253 0 R /XYZ 90 609.396 null]
+>> endobj
+1262 0 obj <<
+/D [1253 0 R /XYZ 90 537.067 null]
+>> endobj
+1263 0 obj <<
+/D [1253 0 R /XYZ 90 513.511 null]
+>> endobj
+1264 0 obj <<
+/D [1253 0 R /XYZ 90 486.377 null]
+>> endobj
+1265 0 obj <<
+/D [1253 0 R /XYZ 90 460.938 null]
+>> endobj
+1266 0 obj <<
+/D [1253 0 R /XYZ 90 435.499 null]
+>> endobj
+1267 0 obj <<
+/D [1253 0 R /XYZ 90 394.597 null]
+>> endobj
+419 0 obj <<
+/D [1253 0 R /XYZ 90 284.414 null]
+>> endobj
+86 0 obj <<
+/D [1253 0 R /XYZ 90 277.455 null]
+>> endobj
+1268 0 obj <<
+/D [1253 0 R /XYZ 90 179.107 null]
+>> endobj
+1269 0 obj <<
+/D [1253 0 R /XYZ 90 126.69 null]
+>> endobj
+1270 0 obj <<
+/D [1253 0 R /XYZ 90 101.893 null]
+>> endobj
+1252 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1298 0 obj <<
+/Length 2173      
+/Filter /FlateDecode
+>>
+stream
+x��Yێ۶}�W=���Û$jZhs)����$ӧ�0���%G�3�~}7o�Yc{&��O�Hjs�\{qm{{?�~��]<��(��w��"�<B~ _��f��⏫�=D� ~ҥO�����˫תn��j�~F�
+{���Px�v���P�����w�m=N<s����3l]?�k���p��Qx
	A�G~�gyZ/���y�
l��Eݘ���Ղ��)+S�\Ǯ�6%��L�ݭy+�jT�#6�;B'n�I֘FCDX��|
�"<�������q�����g
<������ܺ�T
�e������/oI�K�Q�Gơ8M����!����9��
!%�'��^~�`σ>��!�w.����R��f�c<ϊ�+
U
�W��n��嫸��M�z��_�����m���J��JM���պ*�'[��P���>��
��RϮ@<f`�o�S͸C��yZ7��=n�Buj,=���J`TdP�-�(�	
�!Y����
Ыl��a"E�A�视����T�hN�(`H��T8	�DrM9a&B��f�dP
�,�|�q���$�k��\6��h�D����q'f��� �X��(
�?�y�ƚ��w��h%
z�z9�=
Ѩ]��:���
�箷zoH� ��%�]Y�Y�1Ŷ�4?%��M���M��Y4�8�-����Ϲ�k��;&,
��������n�OU���\�g��{ߘ.^�)܂
��0����{p+k�_W���`t�#0������sၼl��$3��R����C��� �B��hj)�O-�(Z$�Ř$������
c"��|H�
+=
+�k���<�0�dBD'�ˀo�n� w��N�� +G�f�j�w�fGP�2V��0�7_S�c���q�g�Z8���K��A��a��ί�ރ�)��v��Vv:�Gk�����T��[�`�_�JZ��
X9L��c3�ԁ _r����l|Ϳ��>~f�y�)�l���Lh�Q�]Y�|��
��JTl�&�Ҝ0�gkSi�&1����Z����oSZ�†�Y
؏��S�4�6�	a �a�ܞ4�ĊrK��F�}K�����#g0�v���Q��%)�:��%\�@
��R�`��
"C'������
+Q��lC�<�M��*1�T�W�Tٮ���X\b�#ƭcW
��v�W+m��"Q�l�Γ]bw�
+��#�no�5�k=J�%	Q [��ҠF��/��W���՟:���T���|���vU�ec�ڎ*�˲�9=|�I��:�V���9%�1�k��k�W;�V�M���T�
UUkqb���d_����b�ɀe-\^vl0��F�R��:؋�܅BJ&�A��e�W�5t������(�7���od�A:�T�v����</�y��
+���r�kJp0�	q�8�n
�=Wװ�0+�?G�wŕajj���%���	V`��`�@b�{
�3��;r�Ɛ/����
�
�'ЯQm���c�sK�s���a�b�
S
+�0y��)
b�q/����
�0�.�|%�P7��

0cX��0Z;�_�E�!����? /�}jU?Ll�҇I�R��&l��V���lp<�'
+����3v�e��3�7���6Na���r�����˲�cI	�^�¸r����[�}'��*�#�e��;���1�D���́�V��u���6����uJ<�
*�)!��L�h6La�N
��
�g�D#((݅��|{��ݹ#����/�9�8`��}/
��}���A�pw*	��ēK�9�1N.OBg����U�mWf^��$�
X�3!�a
DI�� G��^�2/�0vY�@qn�~_� ^j�&�w���ȣ���
1�"DD���P"�����]�<ֹ�	��Z`�cǒkL'�k��CR�.��;�����"��^jP��l��V�c��&��
2��$��mSX��5�ק��l����h���>������>�r�y{�J�}*8��jrAQ���t�wɪ'��z�g��X�"��x_����{����� ����{Pg��!Օ�w]���/��{Z�����-;�ZUC<�PC�_��� E#��0���_����5.6�x#���AB�{-��Ue��q���E��|P�&���	"�J
+�
l��N��1����=�#z��U��fwyq�n��e�AI�=���g@/Z&hu��t�3+�p�sڃ���
+�W
+endstream
+endobj
+1297 0 obj <<
+/Type /Page
+/Contents 1298 0 R
+/Resources 1296 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1075 0 R
+/Annots [ 1248 0 R 1249 0 R 1301 0 R 1250 0 R 1272 0 R 1273 0 R 1303 0 R 1274 0 R 1275 0 R 1305 0 R 1276 0 R 1277 0 R 1278 0 R 1279 0 R 1280 0 R 1308 0 R 1281 0 R 1282 0 R 1283 0 R 1284 0 R 1285 0 R 1286 0 R 1287 0 R 1288 0 R 1314 0 R 1295 0 R ]
+>> endobj
+1248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.57 685.091 487.693 695.995]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_adc0293455632f1e58de03ee68caa785a) >>
+>> endobj
+1249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 685.091 513.996 695.995]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 673.136 270.438 684.04]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.543 673.136 476.612 684.04]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.787 647.33 323.864 658.234]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a18f6401539b34122053f5d76da0c3282) >>
+>> endobj
+1273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.361 647.33 513.996 658.234]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 635.748 134.838 646.278]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 573.183 344.25 584.087]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a93c2b042e4c644ba6052c0a0130c74ff) >>
+>> endobj
+1275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [347.468 573.183 513.996 584.087]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 561.228 134.838 572.132]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.28 561.228 245.263 572.132]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 535.422 337.635 546.326]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_abd830cdbf47ea1e5f0cb88ba4e3dddd7) >>
+>> endobj
+1278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.853 535.422 503.909 546.326]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 509.615 338.193 520.519]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__const__iterator__tag_a9427aa22f07ee35e906d05bcd352e1e9) >>
+>> endobj
+1280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.411 509.615 513.996 520.519]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 497.66 134.838 508.564]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 497.66 334.368 508.564]
+/A << /S /GoTo /D (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) >>
+>> endobj
+1282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 164.593 254.976 175.497]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ab1988eecd5bca9d4ad8dbd128c885b9b) >>
+>> endobj
+1283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.792 164.593 362.083 175.497]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 138.787 327.474 149.691]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a2967727ea790f1d517e1529e3f6be79e) >>
+>> endobj
+1285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.289 138.787 434.581 149.691]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 112.98 325.222 123.884]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a6b54d1a028c5a0eff158b33ce1a6670f) >>
+>> endobj
+1287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.44 112.98 431.731 123.884]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.396 112.98 513.996 123.884]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 101.399 134.838 111.929]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1295 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1299 0 obj <<
+/D [1297 0 R /XYZ 89 770.89 null]
+>> endobj
+1300 0 obj <<
+/D [1297 0 R /XYZ 90 700.787 null]
+>> endobj
+1302 0 obj <<
+/D [1297 0 R /XYZ 90 662.573 null]
+>> endobj
+1304 0 obj <<
+/D [1297 0 R /XYZ 90 588.238 null]
+>> endobj
+1306 0 obj <<
+/D [1297 0 R /XYZ 90 550.665 null]
+>> endobj
+1307 0 obj <<
+/D [1297 0 R /XYZ 90 524.858 null]
+>> endobj
+1309 0 obj <<
+/D [1297 0 R /XYZ 90 460.593 null]
+>> endobj
+420 0 obj <<
+/D [1297 0 R /XYZ 90 337.721 null]
+>> endobj
+90 0 obj <<
+/D [1297 0 R /XYZ 90 331.046 null]
+>> endobj
+1310 0 obj <<
+/D [1297 0 R /XYZ 90 232.615 null]
+>> endobj
+1311 0 obj <<
+/D [1297 0 R /XYZ 90 179.648 null]
+>> endobj
+1312 0 obj <<
+/D [1297 0 R /XYZ 90 154.03 null]
+>> endobj
+1313 0 obj <<
+/D [1297 0 R /XYZ 90 128.223 null]
+>> endobj
+1296 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1350 0 obj <<
+/Length 2148      
+/Filter /FlateDecode
+>>
+stream
+x��ZY��6~ׯ`�e�*
��g��Y�[�8�=�}pR*
	I�P$MB3ѿ�P�D
cI��j_D����_w�����?G�=���؉P�S�y�;v7B����8@�dJ0���f�(�ZV<���㦖b5�|1�R��s)�9����A�E5!�X��	���l�����F�G��z(�x5��v�����B�yh帔�1s>��=�Fv�����@H�|x# ����R��ܾ�|�z��b.+a����C�RD���	���=�'d�-0��վav�RC��=|p�C��
t���
E�
+� ni
1n
�cE!�ϔq���S��3e�2�3;F�����'5c�5�Lzw����������E$`0��<���i�� '�
su��� +o��ַjm��\rs5�����E��g�\�(b�ٽ ��1R\�g�bx�}�5���s�Jїq��$�Ҽ��\
+}��?gF����`,������F�$я����S�� N0
���C:���V��
h�,��$0(������t� � RÜ@�ǡ��Jjy$������~؏�ً ��
����jͫ\
��
��
5š[;1�hM�
|�0
	t5!b[���8���!0�eأ^�_xOD&��M߈)E�Kz���'��'��	�D�u���}w���o���a�F��3�L��+���ౝ�^k��CYe8�,�$�M`�����f�>k��I�rͳ�@�Qt_��E��W�L	���� ����u
˴�[kqo
+}�Wa.�T$�|���֭�� Pv�
�\dpQ@�
�J�CUV]Ba5Kҕ�k�lwd��Q��;^&`M�@�yRnJq����4|I�:7���C.�{�����LJ���(l�l56�"�r���5ä�$b��*�ʶJ��8+j=C5I�|F_P�� UPͣ�
+ݒ�>�Ī����S?��v�i	^��q
L/�."4nK
GL�KN�
a�B���>7���C
�*}Jy�h7��_w���6��U�iݐ�q4 �_1��{n��\Jc9Ks�L,����|x�|s��V.c�͍prQ@��<6b,ҽ���&2�G����7=9䔊�@c*�U�����Z/�'+xޡ�
)4ǴI꛲ �!3}����h�:�<o���Z꺈����
�|]��=\��<�ZJ����9��k��n�Y
}U�-�}���r�5�J#�^/�τ*ňQz�l���;�������I�$H���`���;�
+-c����,�N��E��+�C�q�t�l��jN-����\��:�ŠoGI�����L@� ��mB����VI2P7i7��DI
+��[�ö@0p.E����X	[n���^�>���`U�О�T:�&�7.�9�@���_j1_��n�4����Ɖ�6y��
+�-�3���dA�l�⛯��?
�q&xu�=���P�{��v}� ����%���,� �!}F� ��$�'�f|���>�V3D�w�:�QuI�˪�k��i��
+� �.���k|�z� �T8�m�8���
U4j}�T���w�<�D˱in��j��4�kf��k^m&�nKw�CC�(�s�}^����k	=�U�DFL�YY)��+�\��陼��Ȭ���@F��e�eR���fF
�l�"E�`x
��_蹷���j�V�<��6�a>�Wg�o�S���s�[��
(��r���9|@

��1�ȸ�\F��������<�Ì�f]�
��:c
Ô!j�����
j�m
����ͯ����!�M9�jg�S5\U�
z^��J��~n�v-vԧ�6�>$���t�y���S�ݛ�j�:N�Y�^�F�1>8���yJ����hd$@,��
h�.H��2I�����4��j2	T��)
�
+��ν�
�Cx]f��ޟw�U
����M��S �P�����/D"iԃ�;���0R_����0j{ρ�Bl
�/��7�>�J���M����GQ ����t�E�6��άZ��;�/�|!�a*&o{�_�Y��j
+j���y��UzRd.�m��YV"T�6�8����
+��سUSA;b���K)�o��
�
���������@m5m�e�VE�n��E��~Ijm�a�|�Z���?�0�$h�D���i_4��W�yS�3����$���
+endstream
+endobj
+1349 0 obj <<
+/Type /Page
+/Contents 1350 0 R
+/Resources 1348 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1374 0 R
+/Annots [ 1289 0 R 1290 0 R 1291 0 R 1353 0 R 1292 0 R 1293 0 R 1294 0 R 1355 0 R 1315 0 R 1316 0 R 1317 0 R 1318 0 R 1319 0 R 1358 0 R 1320 0 R 1321 0 R 1322 0 R 1323 0 R 1324 0 R 1325 0 R 1326 0 R 1362 0 R 1327 0 R 1328 0 R 1329 0 R 1364 0 R 1330 0 R 1331 0 R 1332 0 R 1333 0 R 1334 0 R 1335 0 R 1336 0 R 1368 0 R 1337 0 R 1338 0 R 1339 0 R 1340 0 R 1341 0 R 1342 0 R 1343 0 R 1344 0 R 1345 0 R 1346 0 R 1347 0 R ]
+>> endobj
+1289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.102 707.957 360.136 718.861]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a984fd654d7b169e74d13f6207d48fefb) >>
+>> endobj
+1290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.948 707.957 467.239 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 707.957 513.996 718.861]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.002 236.685 706.906]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.822 658.016 369.414 668.92]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a56d19de5207d94e358a433995ce9730c) >>
+>> endobj
+1293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.946 658.016 477.237 668.92]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 658.016 513.996 668.92]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 646.061 241.666 656.964]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 619.033 262.418 629.937]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a0d28be41ac786db82ce3cb24e2db5543) >>
+>> endobj
+1316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.234 619.033 395.537 629.937]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 552.079 306.652 562.983]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ad9b9ef9435b7a3bc8d92435ccf1cc0d7) >>
+>> endobj
+1318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.87 552.079 439.173 562.983]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.875 552.079 513.996 562.983]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 540.124 149.224 551.028]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 513.097 263.534 524.001]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a442076de6b59703f82c552f7e70aad72) >>
+>> endobj
+1321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.35 513.097 396.653 524.001]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 486.069 327.732 496.973]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a1b4e8ec21c2f4b2b925c4e11474062b9) >>
+>> endobj
+1323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.548 486.069 460.851 496.973]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.728 459.042 261.237 469.946]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_aa975ef75ddb5359966ff21eecca491d0) >>
+>> endobj
+1325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.675 459.042 394.979 469.946]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.157 459.042 513.996 469.946]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 447.46 189.622 457.991]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 420.06 252.416 430.963]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a27f2fdd3945057760e252740c98573eb) >>
+>> endobj
+1328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.634 420.06 384.937 430.963]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.64 420.06 513.996 430.963]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 408.478 168.591 419.008]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+1330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 381.077 253.014 391.981]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ac19488a8f4e64cb797b8402ea44b456d) >>
+>> endobj
+1331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.829 381.077 386.133 391.981]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 303.164 257.985 314.068]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_af8ebe9c0ce769746c2d2d01f6fcb4c91) >>
+>> endobj
+1333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.8 303.164 365.092 314.068]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 276.137 306.661 287.041]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a06731c2e3b3d14dceffb5b81f1447bc8) >>
+>> endobj
+1335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.879 276.137 413.171 287.041]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.873 276.137 513.996 287.041]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 264.555 134.838 275.086]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 197.228 270.179 208.131]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a4316d3e1fd40ef324f4f9ac970481c9f) >>
+>> endobj
+1338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.995 197.228 403.298 208.131]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 170.2 273.496 181.104]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a7a018b29b6f334f666391ec729265c25) >>
+>> endobj
+1340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.356 170.2 466.66 181.104]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 143.173 278.478 154.077]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a3bd9634d21689bd4b0cbcb476a101e92) >>
+>> endobj
+1342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.817 143.173 461.121 154.077]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 116.146 284.565 127.049]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_a5e22cd8ea46cdef0e09027e6177fc838) >>
+>> endobj
+1344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.38 116.146 417.684 127.049]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 89.118 279.026 100.022]
+/A << /S /GoTo /D (interfaceppl__Constraint__System__tag_ac8105464b2dbee48f8646bc2c2f1f2d8) >>
+>> endobj
+1346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.841 89.118 386.133 100.022]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+1347 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1351 0 obj <<
+/D [1349 0 R /XYZ 89 770.89 null]
+>> endobj
+1352 0 obj <<
+/D [1349 0 R /XYZ 90 721.073 null]
+>> endobj
+1354 0 obj <<
+/D [1349 0 R /XYZ 90 674.298 null]
+>> endobj
+1356 0 obj <<
+/D [1349 0 R /XYZ 90 634.863 null]
+>> endobj
+1357 0 obj <<
+/D [1349 0 R /XYZ 90 567.72 null]
+>> endobj
+1359 0 obj <<
+/D [1349 0 R /XYZ 90 528.926 null]
+>> endobj
+1360 0 obj <<
+/D [1349 0 R /XYZ 90 501.899 null]
+>> endobj
+1361 0 obj <<
+/D [1349 0 R /XYZ 90 474.871 null]
+>> endobj
+1363 0 obj <<
+/D [1349 0 R /XYZ 90 435.889 null]
+>> endobj
+1365 0 obj <<
+/D [1349 0 R /XYZ 90 396.906 null]
+>> endobj
+1366 0 obj <<
+/D [1349 0 R /XYZ 90 318.805 null]
+>> endobj
+1367 0 obj <<
+/D [1349 0 R /XYZ 90 291.966 null]
+>> endobj
+1369 0 obj <<
+/D [1349 0 R /XYZ 90 212.868 null]
+>> endobj
+1370 0 obj <<
+/D [1349 0 R /XYZ 90 187.724 null]
+>> endobj
+1371 0 obj <<
+/D [1349 0 R /XYZ 90 159.002 null]
+>> endobj
+1372 0 obj <<
+/D [1349 0 R /XYZ 90 131.975 null]
+>> endobj
+1373 0 obj <<
+/D [1349 0 R /XYZ 90 104.948 null]
+>> endobj
+1348 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1412 0 obj <<
+/Length 2377      
+/Filter /FlateDecode
+>>
+stream
+x��ZY��6~ׯ`�>D��08tv�*�r�8Y{���Ni9"�a�"e����_����!�pF��%l4�����$��
�~�|=�z
b/BQ@�z�E�
�� �%�ǩ��~���c�@$
+�!=��wׯ�]P�&��'_&na���9
+���L>�����0b�������S���0��[U0�\�T�����1���	�x�R�q��d6�T��jY��:-r�^���렻Q�ͩ��y�3��[Y���q���]�T����(͏%
�e���_=T��TH[
d�Է�o��T?~�g[3§wi"q�
+�e��Y6�3ʧ�z�L*� ��wL�0C~9�ꕕ|���^�<ֳ`��a�����8��$�r��y
k��7\ߦ��M�����eײ�`Yl��ef�i�6C�0��|ރ�G�3���[�(��Y�
P��f���VƉ,g�Oѭ��í-�4�*͛�����F� s?�#c���c���
�&h:�X�hY
���5���B�
�)lo�:��ӵ	�7�������\�=Y�
F���<2r/�&h�i�
��K�/�]"�LX���
+�*6
�:"+D@�̈́.�
��C�pL��C 똃 �R� daez��{��˾vF8�?a��u�"�q킬jX��?�����͍,�G ��Vn5�%�#�~8��uQVό��*]�G��S�� �qX� ���C1߄���rm�佞��@{3��i����1��<(K�i�_��i��D@�P at ll�����8�-�
ه�
*����i.�r��?�R���|1��L�3ԓ2�mN�hn����

+?K�CI�n�����å̎�	�� (�`w�ŋrƀa 0
��f
,U»7��^4c�66�Xw	�Avc�L����K��\ u9��o�\]X��L�R�����F��-��Zu��$fOU5��������b�0h����ˮ�T[�ΰR�B�U&o��be\J_a�p '�;\"n��(�cV��-/�/�8sK?�7J����5J
7
�c�㖓�>�l� ^c�T�p�/t�6���ʲX����ɪQ�_�B�N#��Qȹ��-q�X腡uoLwy�`�
+��F
�Uf�0ż�ux@�Ak��`e u�P�Q�܍�,���\�: ��6VM��B.FA��
��!�0�c�:F�ܣ1
+qFt!݋�sB�j$9L��n�*�Su�.���Ep^9��� ���\
r�ry�\.�PlH3t�0�
W~\u	N���Fo�sBD#���#r"$�C��a���][E�{
+��缸ύ���%�����#[Q����w枍
�#p�p8 at x���OكM������b��6-4���Arl+��F
���Or�{�μt���:/Ԟ�ޗ�3jag~E�2
�����]�%�Y�0|�cM:��}8VcP����6
���ַ-He
�@���GD�y�p���i����|#�!�����ǁ�JH��b�ʳAL)X��!l��G`���h^�aV���� h7�s�u����r"D��kLJ�;9DP$t��B�Id&k�h�\��z
��ś|g��8K���sh�A��?o���������&��N�Z��P�
�JK
�"O\
Վ�e#�>���M�՝�k8�5�u#�g2�d��i�U�*`�q"h:5����_�S㻦�s��������:D
"; ��ࢭ��g�SdQ;.�j�A5 ���#����twD���_�l9JD
�i��6#Q��-���v�P}��3�	��Ps
q9��b�@��O�t�e�+�!�i�{��t�H�_�
,@�^ ��h�
�B�T����T�g!��%|��

uLO���r��K��ΐ�b�A����m�Z�
�S��Fn�Me��p�
|����z�{�
GD�q=���e��T#��z��V��'�4?�>��ˠ�2�}J��bS��ŮZԲ���3�
L��1v{B4���m�
7mX˞ʺ_ɞL�9����Q�$0��?_&�{���S���ŤT�/(5+͔t�����J�? ���.{/M���F&�wLS�
p��]٥k������H�k+8�l3�_����FC�ȜS�����4�LAo�a^�a8�A�^�neyo�F��{��6��
GCD�W��S��
nL�֬���%��g%W�lЂI�͌��N;q�@�]	ΖU?4�_@����T�A�y
�O��L0�$
�����o6�؁�7�, at X+n��@�}Dp��B\�"
6��E�_����[{b2��q���k{���:`���]�5��q�����SДe[lCſ-�P�h
�A6e���g�ş&�����*�]�[���WW7�u%�5Z�}�jC�ǂ�团t���J������d
+endstream
+endobj
+1411 0 obj <<
+/Type /Page
+/Contents 1412 0 R
+/Resources 1410 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1374 0 R
+/Annots [ 1375 0 R 1376 0 R 1377 0 R 1378 0 R 1417 0 R 1379 0 R 1380 0 R 1381 0 R 1382 0 R 1383 0 R 1384 0 R 1385 0 R 1386 0 R 1387 0 R 1388 0 R 1389 0 R 1390 0 R 1391 0 R 1392 0 R 1393 0 R 1394 0 R 1395 0 R 1396 0 R 1397 0 R 1398 0 R 1399 0 R 1426 0 R 1400 0 R 1401 0 R 1402 0 R 1403 0 R 1404 0 R 1409 0 R ]
+>> endobj
+1375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.658 444.565 222.207 455.469]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787) >>
+>> endobj
+1376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.575 444.565 296.546 455.469]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+1377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.903 444.565 448.629 455.469]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 444.565 513.996 455.469]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+1417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 432.61 220.377 443.514]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+1379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 396.379 286.956 407.283]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_ab93e22d57d1f5d94ae97ba1b9de9e3f9) >>
+>> endobj
+1380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.772 396.379 359.742 407.283]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+1381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 360.148 305.646 371.052]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_abfb19498f2647b44344c6a84fdd6cd2d) >>
+>> endobj
+1382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.461 360.148 378.432 371.052]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+1383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 323.916 291.499 334.82]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a702543ee828ef523fb5fe5ffdaf25925) >>
+>> endobj
+1384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.315 323.916 364.285 334.82]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+1385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.151 323.916 479.133 334.82]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 298.644 300.057 309.548]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a2d4948b195e743f39601a13610fcf94f) >>
+>> endobj
+1387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.872 298.644 372.843 309.548]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+1388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.948 298.644 484.931 309.548]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 273.372 228.097 284.275]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_ac21bd81d2f33da4dc915020bf16c801a) >>
+>> endobj
+1390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.913 273.372 326.896 284.275]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 212.649 272.929 223.553]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a380ed65a246cd38c5ca3893b40eb4603) >>
+>> endobj
+1392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.744 212.649 371.727 223.553]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.63 212.649 464.986 223.553]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 187.377 221.462 198.281]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a8c466c744746ef7249afa54667470cf5) >>
+>> endobj
+1395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.278 187.377 320.261 198.281]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 162.104 245.512 173.008]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) >>
+>> endobj
+1397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.73 162.104 343.712 173.008]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.539 162.104 435.896 173.008]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.374 162.104 513.996 173.008]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1426 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 150.523 134.838 161.053]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 124.877 290.642 135.781]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_aadbcd3b735dae0f714d1134cf8e6b911) >>
+>> endobj
+1401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.458 124.877 389.441 135.781]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.343 124.877 470.825 135.781]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 99.604 218.693 110.508]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a414a473844efce3515611fdc6b26e4de) >>
+>> endobj
+1404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.508 99.604 317.491 110.508]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1409 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1413 0 obj <<
+/D [1411 0 R /XYZ 89 770.89 null]
+>> endobj
+1414 0 obj <<
+/D [1411 0 R /XYZ 90 721.073 null]
+>> endobj
+421 0 obj <<
+/D [1411 0 R /XYZ 90 617.052 null]
+>> endobj
+94 0 obj <<
+/D [1411 0 R /XYZ 90 609.963 null]
+>> endobj
+1415 0 obj <<
+/D [1411 0 R /XYZ 90 511.652 null]
+>> endobj
+1416 0 obj <<
+/D [1411 0 R /XYZ 90 459.486 null]
+>> endobj
+1418 0 obj <<
+/D [1411 0 R /XYZ 90 411.489 null]
+>> endobj
+1419 0 obj <<
+/D [1411 0 R /XYZ 90 375.71 null]
+>> endobj
+1420 0 obj <<
+/D [1411 0 R /XYZ 90 339.026 null]
+>> endobj
+1421 0 obj <<
+/D [1411 0 R /XYZ 90 313.754 null]
+>> endobj
+1422 0 obj <<
+/D [1411 0 R /XYZ 90 288.481 null]
+>> endobj
+1423 0 obj <<
+/D [1411 0 R /XYZ 90 227.57 null]
+>> endobj
+1424 0 obj <<
+/D [1411 0 R /XYZ 90 202.486 null]
+>> endobj
+1425 0 obj <<
+/D [1411 0 R /XYZ 90 177.214 null]
+>> endobj
+1427 0 obj <<
+/D [1411 0 R /XYZ 90 139.986 null]
+>> endobj
+1428 0 obj <<
+/D [1411 0 R /XYZ 90 114.714 null]
+>> endobj
+1410 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F93 336 0 R /F99 1219 0 R /F101 531 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1456 0 obj <<
+/Length 2034      
+/Filter /FlateDecode
+>>
+stream
+x��Zms�D��_�>`�ԗ{�I�ahä(m��2F�ζYr%9�����9r�|���i�v���g������O��'�{!
+}�{�K/Ğ�!><%���D��c<�n��O*WeT����V�E\�U�Hk7ZG�ٜ
+<��ah��>�UKU�H0U�
"$����ٟׯ&/�'�&��=b�H^����{	
��0ba�ݚI�S��{7�}��*�׻���̓� B�zW�vW_����bwz���:���i��@C\xsJ�a%}�T
>���X-�k7��+WNϷf�^P�5-�f.~��,��V���
|P�d������"��������ZOJ�ω7}C���Mc��ː���q��i��a��6�bDF�(�͌�N�]="�QDe�LC���<(� �P��yNjy�Q]^�~i�Oy<�_A�7
+|���Y��s��E��ͳ��;�������|"���k#V���ma
��>@�ɡY�"D F��1U��$^G�H�@�� P�
�Yd���$@
�Id/�(ˊxn�F�J�(�����g���"�y��I�]����>����3&��ޕy#�&���O}�Á�Gt�� �i d�"c�s�w�Q��"�m�O�O��<��&}xd��'�� I���tv'��b��?쭽T*�#��]�Y��:�%�?�V6"� ���F���@��DOVD����a��O��6��נ�9q+��Gq�,g\L�͘(���OCO��
D�6��+��<�M !�3��`
�q�����43a��T�e�5��M��1��z=
���V��uAv��m�X�h
�ة�Z��%h`�5��~�P� �B���4Q�37yc�3J[�@��bzk�ʤjM��d��6�[�k�
؇.E�îUʟ�9m���I�6Cܵ���&�����۽_�2�It� 7$c�2��W'V��f��Б����T 
����Pk%������!p�`& ��V`�7����nI|$$��JIȗm1i�����c��܈�ԕ�m<�t �8��!�#u����ﮫ�X�9֥
>�H3X׸�ȲB#β��Q ,�tFV��|�,+�>1
�\G39]ِ��f��[��w�4͌��3d{#��"�5A농ۯZ
Z
+lpac�ť��H܏�_�y��egқ)��6w|;"K"�[j�wh��{�������\D� <A�4��5�÷*s�
+�R�f/�h��kQ7�|
�m����_���p/7j�
ڳA�p�a��6���&�]
�V9��}U��\G�=4@�uS��FT�L�?��{

<�<��t@�� *"���>�
+2�����]��\ЁC�t~k��1�uR��A����򶄷C9kx��a]�6h�I�x�h��W;��u=P��K	*��"�KK	>M
�?

+9�� 77�*@�w
+
+
�E�IfT>���������
�}��C��4�up�Qƙ��f��n���P�#�}���g{7^�д��Y�Q
����߀����/�CK�3n)�~�|5sۉ�3�DrT���l
(��1�&@���c�(���~	EE蟣?�|a@���$^��8���Q�O�'����O��&�w�e�0�[q=�a�u ��v��k���#�u���o.mI���x�%��њ�L��i��(P�q�a�	^x��8��DY�D-Sh!��ݣ
 �t
!���H��(}�"�D�@�Z��!�
K�E��5�+�Gq#�6�2{gB�
��]�e�U��LE�J�)T����y.��<p
^��r��2l�Y��sl5�nw����`[i��u=
)(c��T�!G�P5���N�y2�9	܇y�!��X{?�"!
#8�����"�jARv�?�� ��P��`��K$�`�����k{󣽼���.Z��=
�nT
+
+!��G~�r ߬-�n����j�y�m��!.�ީV������)ϻm���e���>����[U*_������>�����t6ES�9
nL�5
�����������HI͌��y�|�.�6�{Q�at���/nf��
+endstream
+endobj
+1455 0 obj <<
+/Type /Page
+/Contents 1456 0 R
+/Resources 1454 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1374 0 R
+/Annots [ 1405 0 R 1406 0 R 1407 0 R 1408 0 R 1429 0 R 1430 0 R 1431 0 R 1432 0 R 1433 0 R 1434 0 R 1435 0 R 1436 0 R 1437 0 R 1438 0 R 1467 0 R 1439 0 R 1440 0 R 1441 0 R 1469 0 R 1442 0 R 1443 0 R 1444 0 R 1445 0 R 1446 0 R 1472 0 R 1447 0 R 1453 0 R ]
+>> endobj
+1405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 686.111 235.858 697.015]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a9a30e394a9c84bb9d2debda31433e6b4) >>
+>> endobj
+1406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.674 686.111 334.656 697.015]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 660.304 239.176 671.208]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a90e279d0af3491d3cc793595e3e1bbff) >>
+>> endobj
+1408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.035 660.304 398.018 671.208]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 634.497 244.157 645.401]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a87fc73217faaf213d5b5a810272be545) >>
+>> endobj
+1430 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.496 634.497 392.479 645.401]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 608.69 250.244 619.594]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a08451f3fa991dc14b1b8874bdefd7cf2) >>
+>> endobj
+1432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.06 608.69 349.042 619.594]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1433 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 582.883 244.705 593.787]
+/A << /S /GoTo /D (interfaceppl__Constraint__tag_a94ca29d276a68f3f75aa62c8ab6109e4) >>
+>> endobj
+1434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.52 582.883 317.491 593.787]
+/A << /S /GoTo /D (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) >>
+>> endobj
+1435 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 272.727 313.058 283.631]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_ab823e62915ff895212640119f062252c) >>
+>> endobj
+1436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.873 272.727 478.246 283.631]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 246.92 475.706 257.824]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_acd03b90ea728537b78a669806309a5c0) >>
+>> endobj
+1438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [478.924 246.92 513.996 257.824]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 234.965 228.924 245.869]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.886 234.965 442.272 245.869]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.254 198.199 486.009 209.103]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_ae2334b2eefe8cae2ad750dfea1f7cade) >>
+>> endobj
+1441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 198.199 513.996 209.103]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 186.244 268.754 197.148]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.86 186.244 473.245 197.148]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.254 160.436 321.648 171.34]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_a51dfb5223b7487379681d4cc1583917f) >>
+>> endobj
+1444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.611 160.436 513.996 171.34]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 86.288 342.567 97.192]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_acb94e9072062c0827a16766cef2c1a5e) >>
+>> endobj
+1446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.785 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 134.838 85.237]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.838 74.333 244.137 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1453 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1457 0 obj <<
+/D [1455 0 R /XYZ 89 770.89 null]
+>> endobj
+1458 0 obj <<
+/D [1455 0 R /XYZ 90 701.166 null]
+>> endobj
+1459 0 obj <<
+/D [1455 0 R /XYZ 90 677.242 null]
+>> endobj
+1460 0 obj <<
+/D [1455 0 R /XYZ 90 649.74 null]
+>> endobj
+1461 0 obj <<
+/D [1455 0 R /XYZ 90 623.933 null]
+>> endobj
+1462 0 obj <<
+/D [1455 0 R /XYZ 90 598.126 null]
+>> endobj
+1463 0 obj <<
+/D [1455 0 R /XYZ 90 556.774 null]
+>> endobj
+422 0 obj <<
+/D [1455 0 R /XYZ 90 445.855 null]
+>> endobj
+98 0 obj <<
+/D [1455 0 R /XYZ 90 439.181 null]
+>> endobj
+1464 0 obj <<
+/D [1455 0 R /XYZ 90 340.75 null]
+>> endobj
+1465 0 obj <<
+/D [1455 0 R /XYZ 90 287.782 null]
+>> endobj
+1466 0 obj <<
+/D [1455 0 R /XYZ 90 262.616 null]
+>> endobj
+1468 0 obj <<
+/D [1455 0 R /XYZ 90 213.895 null]
+>> endobj
+1470 0 obj <<
+/D [1455 0 R /XYZ 90 175.68 null]
+>> endobj
+1471 0 obj <<
+/D [1455 0 R /XYZ 90 101.343 null]
+>> endobj
+1454 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1497 0 obj <<
+/Length 2189      
+/Filter /FlateDecode
+>>
+stream
+xڽY[o�F~ׯ ���j<7��E����t�l���CR�8��R$CRv���̕�Dɲ����9sf��������z�����&�^����ʋ���ܥއ)f��� B$`�z���������|7��v�yB�����0�ɇ�����=�X
y꣍�)�k�>�F���R-�T
�T�p�(
CB!Z�W���p*V�Z,����&f���P�V�u��o��#�"b�y��6+ֳ9��4їeY4�
�%E�
=nKs�3�&�6�$�g�r�$�I[�F�����ԌhO����j�zL{�B��)�ؓ��	��3BQ
��9�8�S>R�fy�>�Ӭh�ci�zm��N}@b<��|�ZnMnk�~״b�PG��Z�4+���'ʭ |�>>��Y�Gł�A2��Ndpx���8��8���TV&�j��E��O�T�pb͞��WU	��|uO��Q<��
�!���1��?\|�&���3-��=��\y���`����!��7��%ߟ���ݹh#
��)����.� [...]
+�%3�y%�$�E
+���5�:�ڬ,Nq��
1���迫Dc�A���j[,�$�|e���
/���
���Q�m�&�$D�fE�8��zY9T��AoY�zY��'_���Ʋ��Vu)�x��f�Z$�,�Yk���Nɗ
O�bu�r�FT�2S�>z\ݲ
ڙ���+I�d)�̢�3�������u߽p}�9�1%i`V�s��ҁ�(�#����r+��(�

��e��.��u�
l/,r�r�GVe��3�O
p>bLsq=�g�^�"I!�m8<-��\܁m�X|��1J�*J����w�������<Y�
9ℝJ/��%�:�
( 3I̹�E	�Yݚuo��F�e֎������;\�� 
e|��)�	a0\�Mf�t�=��0�.�}'V�N�6�>�]�Ӕ��C���<�	�
+
z�>���e�MM�uA���P����#�BŎK�{X�8ޓ1tQ�3b�ʃ2����o�}nx
+�|����`!ӧ�e+��I zc
&��
K�r#6�D�gt"gT�6gQ.!25���v)}�7Z��M��
�1�A�|zj����C
+q�Y���d�
�� �KߞQ��{{�}�SN��|�h�H��(�
+�jݜ�Ct`*��Y��,O
��Ul�vweD=RK��q`;Y
+;/m1sfM�~�[��~꼚7Yp��x2�.�����I,1
���iX:U�`:V��
+�28��Z?��q%�,c6��A�I.Z��ۑ�	c���6�w���79&�U)�>���I�J
Ah �;o?�t񡼷ᅰ5sd�-o�"�:�6�թa�L�a���
rC]Ӊ蒻>���.�1���W�2�K����)|;����
�!k�/G;i�Y��>)�C�
�@���y~��E��(�
�7)��M�g���pL��c#���]�
ia=:3���i�b<ZY
u��s�Z�
6c�#�d+!bA<d����\�%�(S�JT��\�P�r�eҦ=����H��)h��K�NW��&�&I�~>��o܉�CzP��
�hO�qq&m�#�cg��)Mg�гyv* b�
������]�_6T�<K��:[/sh
�~�����Mc�ѵp6��
+B��ھ�`�vm�R�'-���,�M���mP{m��f���r�4"E�|s�n�#Y�C2�����a�ޕ��L�֖���i��������A�?U�#�-�*Y�E�A���7l�<rI�b��Si91|��
:��f�J�.?Q@�T}nή=���*�z���^�8���{���!�l�t~��F�i�}�Xv��r�QQ,�q�޽\$�R�>��
�����;�(����ݽ�<D~����`�IR��?V/�
���͆y�J։���y'P���֐�P�(���c����o������KR���ڼ}s�y���ײ�kL�kR�י9/}��;�D�ZDc* ��^X �=��������t��
z�ڶ�����]7�X�e9�C��a�p�����ҶȲ
nT�����m�hU
+endstream
+endobj
+1496 0 obj <<
+/Type /Page
+/Contents 1497 0 R
+/Resources 1495 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1374 0 R
+/Annots [ 1448 0 R 1449 0 R 1450 0 R 1451 0 R 1501 0 R 1452 0 R 1473 0 R 1474 0 R 1475 0 R 1476 0 R 1477 0 R 1506 0 R 1478 0 R 1479 0 R 1480 0 R 1508 0 R 1481 0 R 1482 0 R 1483 0 R 1510 0 R 1484 0 R 1485 0 R 1486 0 R 1487 0 R 1488 0 R 1513 0 R 1494 0 R ]
+>> endobj
+1448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 696.05 335.952 706.954]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_a7d4bec3e6101e95b57973dcab5880a51) >>
+>> endobj
+1449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [339.169 696.05 500.542 706.954]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 670.244 336.509 681.148]
+/A << /S /GoTo /D (interfaceppl__Generator__System__const__iterator__tag_ac5344d92361779d92fcb36acf2d406ae) >>
+>> endobj
+1451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [339.727 670.244 513.996 681.148]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 658.289 134.838 669.192]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 658.289 332.684 669.192]
+/A << /S /GoTo /D (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) >>
+>> endobj
+1473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 325.222 253.293 336.126]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a33e20d1de127c9232d2d1188bee532ef) >>
+>> endobj
+1474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.108 325.222 358.716 336.126]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 299.415 321.855 310.319]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a7752ae55e7cd4d014f6498348ef47865) >>
+>> endobj
+1476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.073 299.415 426.681 310.319]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.904 299.415 513.996 310.319]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 287.46 134.838 298.364]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.159 250.695 357.827 261.599]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_ab1316806c765a595ddfa4de5e8d971f6) >>
+>> endobj
+1479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.696 250.695 464.304 261.599]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 250.695 513.996 261.599]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 238.74 235.001 249.644]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.838 201.974 366.064 212.878]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_af5253fb7ef85e1875cc453d9a9998459) >>
+>> endobj
+1482 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.612 201.974 472.219 212.878]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 201.974 513.996 212.878]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 190.019 235.001 200.923]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 164.213 260.735 175.117]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a540cea530eaa9c142b16fbf01f781673) >>
+>> endobj
+1485 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.55 164.213 392.17 175.117]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.611 102.021 305.072 112.925]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) >>
+>> endobj
+1487 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.393 102.021 436.013 112.925]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.459 102.021 513.996 112.925]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 90.066 149.224 100.97]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1494 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1498 0 obj <<
+/D [1496 0 R /XYZ 89 770.89 null]
+>> endobj
+1499 0 obj <<
+/D [1496 0 R /XYZ 90 711.293 null]
+>> endobj
+1500 0 obj <<
+/D [1496 0 R /XYZ 90 685.487 null]
+>> endobj
+1502 0 obj <<
+/D [1496 0 R /XYZ 90 621.221 null]
+>> endobj
+423 0 obj <<
+/D [1496 0 R /XYZ 90 498.349 null]
+>> endobj
+102 0 obj <<
+/D [1496 0 R /XYZ 90 491.674 null]
+>> endobj
+1503 0 obj <<
+/D [1496 0 R /XYZ 90 393.243 null]
+>> endobj
+1504 0 obj <<
+/D [1496 0 R /XYZ 90 340.276 null]
+>> endobj
+1505 0 obj <<
+/D [1496 0 R /XYZ 90 314.658 null]
+>> endobj
+1507 0 obj <<
+/D [1496 0 R /XYZ 90 265.938 null]
+>> endobj
+1509 0 obj <<
+/D [1496 0 R /XYZ 90 217.67 null]
+>> endobj
+1511 0 obj <<
+/D [1496 0 R /XYZ 90 179.456 null]
+>> endobj
+1512 0 obj <<
+/D [1496 0 R /XYZ 90 117.076 null]
+>> endobj
+1495 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1542 0 obj <<
+/Length 2029      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�~��z
�
�^DQl�m�Yl�ݳ�>m�@�i[�u�D'Ϳ�eɖ
�vZ}�,�rf��o��ތ��]]

H$#7�@�@�������@�N�c<.�����*�Eu���dJ9
�͵��L��j��	��*��H,�8�_n�}w3�mD`f
7G"f���/8��������;(
B��>��?�͢qw�Qw���D�S�gJ��ܿ|�r�&�u��,�Z6��`E��~|���nUV��]qf�Ϙ��Y��z_�
���A
���_��c
Ġr�)EQH�)���V�Jo��v�Hܥ,�T����@y5	a�	�cp�{�0^]K֑O0A!�aj+zY�1�5�0&~詓�O���f�
4���o��/�?�	��z����V�%�3ǎ秄	�#sE�����Ȯ�'d�u՝]�2�w���. 07��Ց5Fd�S�8&�b�A���'0u�}�b.է�������u�.��t1 %�8j���!$ň�-����7�
 �'���3͗��3�몁��z��0���bg�>8���Zu@20 ?
	.����e���\ �D
�[�|W�{9�iGAK1
^��� r��-?���q؅�Jc�;:
kt"V�D �|�
����,���]:
l�O�0d�`%�V��ޡH��=i3�Z�ݯEQej�
+n(�ȱ��
͜nAڍ����*�|/%�͓4+�*S��:-r����>��$7�h���
s��؅�b	?0�tKn�<�.U�J�&��Wk��.2�K��GJ
+�i$�Q���
w�$���͛�	����b�v>���nB�xc��l��T�oU���DD�F�!�D6u��&����J����Q����N��v�ۨ?�`����Q�"�:[���s���jV��{�9�Ϩ�6m�ࠒ�����b�
���R+]{"�1R���<�H�]�v�|<�S�Q
�&���)�|ؕ������<
/^! �x�!�=
�8�AxN���ڢߐ͊��d� �Yƶ�o O�ަ�|��!"O�O�6�bg����sm��
I$��(��]�W3U�I�8����\�(	�\��[n�Տ
'x�\Ǒ�2cZܖ���˗3���!ߛE׃m�k�]���Q?``P,�G�z^l�JhF'6K�I%e��?�m�������4��)����^Pd17����m�P�J%٫��"`��w��	_
;i
��&9.V�� /L��s&^���LR?1�UR
"����.b���b
��f�/�B�
�A�V̦�o��/�te
+q��W;[�������*�]�Yi۷x��i2�<G˞�t����Sd��ź礞���|���48�#(��	�d02��0٩�^���j�5J��ԝ.�UbCm&A�FOa�U���5(����5	�[��ҺH�/��="�����?	"
+�
F��w��%AdN�Bq2�ڶs@�ۂ�8��
(!ʍ���!�5����Fᔁ5#Ҟ�����J'��fL�]=���j~�$sĠ
+�o&1
?�m7���E?�݁Y�7<\��6^�h{��T�7���g�o�*
wܧsՇ�%������¡|�`�U�m#�E2A�v�M����;���p�\�C��(Ѩ�wԟ�M�e��^m�=
���a<?.��M�E�l�n7����Z}ޏsh2C�NK�OtZ��nW*��qLW�:�\׳Ӧ�u30	<xr��L���w
6�N�ąhϡ�s$��ꡕR�qp��џ;�z��%����u2㥋��=�~P
������Q��N�
����u!
�<��.�����f��HB:#9CB����Y\-uva� �#�T��C��z���L!�H /�����,!BR &�7�@
������w�Ƿ��.ɗ�d���U���ZU�5QQ���|��'-
ߛt���&
8��Tl�������ӝ����#k��M��-g��.?����,��hV
l;o_�8~Kg
YQ�� �c
���osȋ������
��Ԏ�����/6��f,x]�3�_�����u
+endstream
+endobj
+1541 0 obj <<
+/Type /Page
+/Contents 1542 0 R
+/Resources 1540 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1374 0 R
+/Annots [ 1489 0 R 1490 0 R 1491 0 R 1492 0 R 1493 0 R 1546 0 R 1514 0 R 1515 0 R 1516 0 R 1548 0 R 1517 0 R 1518 0 R 1519 0 R 1520 0 R 1521 0 R 1522 0 R 1523 0 R 1552 0 R 1524 0 R 1525 0 R 1526 0 R 1527 0 R 1528 0 R 1529 0 R 1530 0 R 1531 0 R 1532 0 R 1533 0 R 1539 0 R ]
+>> endobj
+1489 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 707.957 261.85 718.861]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a888341fcf1079aaaa4dd7b532662729c) >>
+>> endobj
+1490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.666 707.957 393.286 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1491 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.785 679.904 260.611 690.808]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aa7260438cfc5fa383c7fb80b127f8315) >>
+>> endobj
+1492 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.106 679.904 393.726 690.808]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1493 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.84 679.904 513.996 690.808]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 667.949 189.622 678.853]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 639.896 250.732 650.8]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_afcc12e4f52a8ff85d16ebfc424447b63) >>
+>> endobj
+1515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.95 639.896 381.57 650.8]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.831 639.896 513.996 650.8]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 627.941 168.591 638.845]
+/A << /S /GoTo /D (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) >>
+>> endobj
+1517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 599.887 251.33 610.791]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3) >>
+>> endobj
+1518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.146 599.887 382.766 610.791]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 517.871 256.301 528.775]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_af5911dc31286d92c979c7ff89c249bc8) >>
+>> endobj
+1520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.117 517.871 361.725 528.775]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.454 489.818 304.24 500.722]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a3f5244b219701d5ba5939982a1d11d97) >>
+>> endobj
+1522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.404 489.818 410.012 500.722]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.13 489.818 513.996 500.722]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 477.863 134.838 488.767]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 406.806 268.495 417.71]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a3d3687abfb3878a67fca687b8e4ff0b9) >>
+>> endobj
+1525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.311 406.806 399.931 417.71]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 378.753 271.813 389.657]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_ae12a1e70aa5010e6617de857f51574a8) >>
+>> endobj
+1527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.673 378.753 463.293 389.657]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 350.7 276.794 361.604]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aba231f6ac03d82cbf693a6a29a5c2665) >>
+>> endobj
+1529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.134 350.7 457.754 361.604]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 322.647 282.881 333.551]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_a067f83ba740e5b6c0c585a5175723a0b) >>
+>> endobj
+1531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.697 322.647 414.317 333.551]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+1532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 294.594 277.342 305.498]
+/A << /S /GoTo /D (interfaceppl__Generator__System__tag_aad90ffcd536cd0d48ee183bca02103fc) >>
+>> endobj
+1533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.158 294.594 382.766 305.498]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+1539 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1543 0 obj <<
+/D [1541 0 R /XYZ 89 770.89 null]
+>> endobj
+1544 0 obj <<
+/D [1541 0 R /XYZ 90 721.073 null]
+>> endobj
+1545 0 obj <<
+/D [1541 0 R /XYZ 90 696.246 null]
+>> endobj
+1547 0 obj <<
+/D [1541 0 R /XYZ 90 656.238 null]
+>> endobj
+1549 0 obj <<
+/D [1541 0 R /XYZ 90 616.23 null]
+>> endobj
+1550 0 obj <<
+/D [1541 0 R /XYZ 90 534.025 null]
+>> endobj
+1551 0 obj <<
+/D [1541 0 R /XYZ 90 506.161 null]
+>> endobj
+1553 0 obj <<
+/D [1541 0 R /XYZ 90 422.96 null]
+>> endobj
+1554 0 obj <<
+/D [1541 0 R /XYZ 90 396.79 null]
+>> endobj
+1555 0 obj <<
+/D [1541 0 R /XYZ 90 367.042 null]
+>> endobj
+1556 0 obj <<
+/D [1541 0 R /XYZ 90 338.989 null]
+>> endobj
+1557 0 obj <<
+/D [1541 0 R /XYZ 90 310.936 null]
+>> endobj
+1558 0 obj <<
+/D [1541 0 R /XYZ 90 263.553 null]
+>> endobj
+424 0 obj <<
+/D [1541 0 R /XYZ 90 147.175 null]
+>> endobj
+106 0 obj <<
+/D [1541 0 R /XYZ 90 137.887 null]
+>> endobj
+1540 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1598 0 obj <<
+/Length 2612      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�F��W�6`U��
[�xI)��
[S98)D4)T�% (������� 	Y�=�	t7�򽵁g���r�����k�Bzԛݮg!��<D����'��?o�1/@$�`�������Woo?�gW�n���"�ψ^�"?��ҫO�Y
��a��`��&�3N\���W��†��+��b
��0B!��b�"�/(
�׻lU'yV)z�ׯ�.gx��
1
�
��.~��vp�S�G�
��܌J3�r�0�(�xm_�`+�{sKAO��#�3 �E,�$a��ܭ꼬~��TU�&KEf^e�
�v�1>	C܅��{��J��[2��p1vx��-UWn�?�	$�NQl���S�y\�"2QF×��R��R�4˗��z�U3�)".�@�c&�x�(
��Sl~8��T�~%�|�d"*��>� )�ـ��VHU�J�������L���Y TC��vx����R��[���/r��J��U@�gC.�� 3pg���]`tn�~QΙ�0�
+d���
u ��m�;�9yOaC����'ze'Z�!뾗1�Y�U�B���F�&�NѶ [�F��
�e'�#�Iӳ��|�0wn
�`�G��N���wfڪ���)��+,�y��X���b���y��� |*��9�;����3�q���T�
�{
Пa/
a�G���Tz���(&�p��1�����z��wÞh�1�$]�:p�
�y
�ϼ]���R���j���Ϟ�f������ae�ϱ���8�";t~ғ�m[#���!

+ 2i=�`�t#W6�!���Hޖ���c�Ե��~�5�5a���2�R�u~t�uT�߹�$VE�2�8�(#ݠ�+5!��U܈�w�V����Ŷ
�
+{23t(G��!�
�|����OB����	�@* �~:p�3¤��{ar�_Q�K`m�����>[Ԥ�"L�4�Ȱ@Vޑ����̸<}/2�d8+/�M��
+v�C��ͥcX4�PȂe3�5�`�H���F�
p��D�b � �A ?�����I���jy��źI�Z�C�	k;�i���a� �ŒL�l��x�17�;��z��G>n!�L�=��ڃ�}�[؅��g�2
�*!��&�A��? �H_��_�h�<��A�M�@B[��k�
�Ԛ��{�f$�
4#�%>�˘lޘ����Ø���sַ���
͙�ǚ
�<ˌ	 ��S��Q3r)ԯ�
+�2Ocg+�Pb�|�X��9D���� �"�m�⚐�w�6�
�"������U^|9�� ?l|��D��O�գ���=M�)�
+���5�����fC~.���#��g���!���n��s��*WSaL)�8��
+:��>T��0�� ���88�� ����hI"J�	��C�MM@�|Bψ�XlE-�
�󺪞�����d
�m�8j<C��6:��r[���8&��V���uoi�����F�o^�q
E��I�ѷͽ\/Z�M
��V���zY
��uZw��x+�J��Z� )�(���
Lb��{�e��om��_y���
8�ąڨ�-�T��lk�
�r�k�X�þ� `�C��O���1�Q�r¾i�މ��N�q4N(
my��c Ol=�=�M��2D���b���˹���ޕ�л)�{�lR�>�]�L
+a.D�s
{
Њq5�����I��m�
�
�u�˃$7*eD����9�>	 
G ��ʾꀂۓ�"���2ڶf��������ޠBm����CT&��hT!j���x2�J�����ypO��8��#�����;F��'e�s\��h��G+�
�u���Hȕ�ܿ�;�O���BRW6�i5
����m���Q�O��)��c�"�z���k߉n���TI�<}X�gM��K=%m+`��'��>x\�Q�
��
B*b�5��$H%���]�W�zU�I%�C�R�Dz�Bi�)��duT�TIr���Y]��o|-
}�P
�~G>l(Dy��<m��H�ィ�xᓭ�N�I�[3٨��*��m=�X��)vvJ���$*v%([T+� ����&+v���]
��oZ�]�$��(a�7��??���K2G;Z�*x��|>�O�6�:�wc�
F�oNt���Bu�.��ZOT��7�4��/mx ����F��Qz���d���1r���t��i�rP�ȗ ����L�0�ό����ս�U F۔S�� P�uR|�x�؋��n"�B��W
�۶�m�,��:�&a�cv��dd��=�����Dc�C��aO�#<@dp���=�_&q��U�,�]Z\2��pwԓߚ������P\�Ƀ��%0m���&� ���
�S����A�z�`۰0�ٝl��u^��ĹD�6�⋜���
#�������k�fω�h?�<���Έӱ�䷽���9Љ~/�Q������;
���!���+�0�T=��C��ܸ�I��e���-`�E����
T��g�f

+[ڗ*�nm����=x�/o�l��6��t�k��3��?��2�Q�>���~��A�mc̾(E Qe*���v�45,�&kڥ=�M�F��u]�x}}�� x6h�����.�}���Js�u|�ɂSapO����^
+endstream
+endobj
+1597 0 obj <<
+/Type /Page
+/Contents 1598 0 R
+/Resources 1596 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1374 0 R
+/Annots [ 1534 0 R 1535 0 R 1536 0 R 1537 0 R 1602 0 R 1538 0 R 1559 0 R 1560 0 R 1561 0 R 1562 0 R 1563 0 R 1564 0 R 1565 0 R 1566 0 R 1567 0 R 1568 0 R 1569 0 R 1570 0 R 1571 0 R 1572 0 R 1573 0 R 1574 0 R 1575 0 R 1576 0 R 1577 0 R 1578 0 R 1579 0 R 1613 0 R 1580 0 R 1581 0 R 1582 0 R 1583 0 R 1584 0 R 1585 0 R 1586 0 R 1587 0 R 1588 0 R 1589 0 R 1590 0 R 1591 0 R 1592 0 R 1593 0 R 1594 0 R 1595 0 R ]
+>> endobj
+1534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 636.457 218.374 647.361]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_ace16d45c8fbb00ad5b616aa4344fb798) >>
+>> endobj
+1535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.592 636.457 288.879 647.361]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+1536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.227 636.457 436.953 647.361]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.579 636.457 513.996 647.361]
+/A << /S /GoTo /D (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) >>
+>> endobj
+1602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 624.502 196.556 635.406]
+/A << /S /GoTo /D (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) >>
+>> endobj
+1538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.805 624.502 302.299 635.406]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 565.929 287.046 576.833]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_aafa09f891353748a46868d342cc91cbc) >>
+>> endobj
+1560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.862 565.929 358.149 576.833]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+1561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 529.273 320.799 540.177]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a048cb229297e24f6d0f7ab4e4351e2c2) >>
+>> endobj
+1562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.615 529.273 391.902 540.177]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+1563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 492.618 288.132 503.522]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_ab3fe811bb3a347e553576dadff55339e) >>
+>> endobj
+1564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.948 492.618 359.235 503.522]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+1565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.658 492.618 472.957 503.522]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1566 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 466.922 296.69 477.826]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a297969dd313ebb370c9419915398aaf2) >>
+>> endobj
+1567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.505 466.922 367.792 477.826]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+1568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.898 466.922 478.197 477.826]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 441.225 226.414 452.129]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a278a22338f8428e328daf84dea4f94e7) >>
+>> endobj
+1570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.229 441.225 323.529 452.129]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 379.337 271.245 390.241]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a30d13726e3b27f1be7e5eb05a7814bb3) >>
+>> endobj
+1572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.061 379.337 368.36 390.241]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.821 379.337 462.177 390.241]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 353.641 219.779 364.545]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_af2fd5edcf647f4bc5b64cf0f4f712a51) >>
+>> endobj
+1575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.594 353.641 316.894 364.545]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 327.944 243.828 338.848]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a318f5f2972203c84ea0fdb4b82bbab1c) >>
+>> endobj
+1577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.046 327.944 340.345 338.848]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.73 327.944 433.087 338.848]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.565 327.944 513.996 338.848]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 316.363 134.838 326.893]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 290.293 230.05 301.197]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a140a26e6f6dc525c742aca71f598ed3c) >>
+>> endobj
+1581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.866 290.293 327.165 301.197]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.626 290.293 409.107 301.197]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 264.596 217.009 275.5]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a74a772b49c2c3190ad8501ffa0337d2f) >>
+>> endobj
+1584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.825 264.596 314.124 275.5]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 191.749 234.175 202.653]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a5d89173a47e10f469337343cfb807218) >>
+>> endobj
+1586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.99 191.749 331.289 202.653]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 166.053 237.492 176.956]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a6d184edbb85d3c2747bb6097f7de17ad) >>
+>> endobj
+1588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.352 166.053 394.651 176.956]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 140.356 242.473 151.26]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a30161047ab7c47dd7a68a852e98ed83e) >>
+>> endobj
+1590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.813 140.356 389.112 151.26]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 114.66 248.56 125.564]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_a6a901364857f84dc0f111a29330c33f9) >>
+>> endobj
+1592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.376 114.66 345.675 125.564]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 88.963 243.021 99.867]
+/A << /S /GoTo /D (interfaceppl__Generator__tag_ad6d26ca0f256b0d9a45173e7d83ee4cc) >>
+>> endobj
+1594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.837 88.963 314.124 99.867]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+1595 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1599 0 obj <<
+/D [1597 0 R /XYZ 89 770.89 null]
+>> endobj
+1600 0 obj <<
+/D [1597 0 R /XYZ 90 704.286 null]
+>> endobj
+1601 0 obj <<
+/D [1597 0 R /XYZ 90 651.484 null]
+>> endobj
+1603 0 obj <<
+/D [1597 0 R /XYZ 90 581.144 null]
+>> endobj
+1606 0 obj <<
+/D [1597 0 R /XYZ 90 544.489 null]
+>> endobj
+1607 0 obj <<
+/D [1597 0 R /XYZ 90 507.834 null]
+>> endobj
+1608 0 obj <<
+/D [1597 0 R /XYZ 90 482.137 null]
+>> endobj
+1609 0 obj <<
+/D [1597 0 R /XYZ 90 456.441 null]
+>> endobj
+1610 0 obj <<
+/D [1597 0 R /XYZ 90 394.364 null]
+>> endobj
+1611 0 obj <<
+/D [1597 0 R /XYZ 90 368.856 null]
+>> endobj
+1612 0 obj <<
+/D [1597 0 R /XYZ 90 343.16 null]
+>> endobj
+1614 0 obj <<
+/D [1597 0 R /XYZ 90 305.508 null]
+>> endobj
+1615 0 obj <<
+/D [1597 0 R /XYZ 90 279.812 null]
+>> endobj
+1616 0 obj <<
+/D [1597 0 R /XYZ 90 206.776 null]
+>> endobj
+1617 0 obj <<
+/D [1597 0 R /XYZ 90 182.963 null]
+>> endobj
+1618 0 obj <<
+/D [1597 0 R /XYZ 90 155.572 null]
+>> endobj
+1619 0 obj <<
+/D [1597 0 R /XYZ 90 129.875 null]
+>> endobj
+1620 0 obj <<
+/D [1597 0 R /XYZ 90 104.179 null]
+>> endobj
+1596 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F104 1604 0 R /F38 1605 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1642 0 obj <<
+/Length 1941      
+/Filter /FlateDecode
+>>
+stream
+x��YY�۶~��ڇ�@��U�r�m�I{/�d�SR��E{�ʒ#�3���M�-/�8-��E���|磈�U���n&��#
�(i�,����.
�N#D��`���M>Qe���*T�4e5�P7j=_�E�̳ƍ6�jvE��,`h�,��}����9U�
�i��<��~�j����Ä�M8 ��",֓��� ��WF,�����8e�o&�M�s#*��s�I��
!���7����j�,W)�J%�Ջ*�4YY�����a?Z8 ���x3�x��Q��7)R{��
-ʍ/��^�| k��hq$B!�Nܭ
\�Y2���*gDL�Ty	�?3�3#0��)gTL��X���&���9L#�B���B�	Z�Vh���	b�����+Q�c�|;���b�VE���}kn������z�U�k/By�yn��
+���0��z:X��3	�
!ʝ��(�Yo������V%)DE�)���iir�0��]y
,B1�ce�_"��K"
+�HRz�P2jK�E� �1œY!u�BQb�
�
9���ٻ��B��^D7%�S�C��F
K_F��H21Tl�sD��Z��
2�7��{_5#1�"qՌ2�B2T�$�h��X��p
]���4�#�{E��(�1h!�C�J��O�mm���5�N:l}��:+�6Uv&�n�`(�:X�vDV��
�	}X���#O2��O����bG��B� t�Nl_|�r��
�ۀ����a��W6���&M
���>��(J�p���U��JD���΂_!
��9xv��G]O�v���+����V��+;y��M=�'a���$�<��3�a]H��U�k3�ĶI�t���Ԯ-C�����ڕ������X�ۼ�	�'����g4M6��Q,I����9���K^
�MM��NP  f_�a��/h�=J��{{�ж�=!�fg��+x:�s
��8n��O�j� �jLj��t�j�"�w��M�Y	��a\��hB 
/��oN���J���#it�,=��6+��l|r8h,fq�G,��A
�nXA�����_
��
+�q��q�8�闀}h��<��Hbo���^�ˑ�&�
y����J�
�@\ܕZ�B_jzhi-㖎맮�sg��V�mG'�K���5o��pM�D��Hb~��\�
�nb:׿�t�Wi}��(���N�G[����Z<��,�v[B�;.w����X�Q	�j�a`�X�I�:�f�/&F���(�OW��\&1p; ��K�T�Q_���	�c��"��b���.ɳ4i9H�(�v�"
+{��t
�8��n��F�N�ԟD��zkqp/I+����Hۍ�+�K
/�>�s{e���6�sW�U��\%�J�9,
bKj�-
�4�<s_
���`��iqa5�o�n��O���qv��b
+Θy#�?
"aO�
���^"�'�)�v)
�>��(e�G��3(���ۇ�!&�a��L�)�t�.�;�{b)�lg�š�tɷ��c����\�m�NB遲�����OڒP��
ޘu�r�
0�	�������Ƞ�Mu|$?9X_�8V��Y6�'>)��r�K�߻~�)a%�������t�BN1^`
`�㳃Sr~v(
�sh�{+��?��?3�d�Z��c��j��&�L���� �S�N�h�b�Aﱢx�-�C�c�;�&:�#|¼6�W)�8k���H�KH��t{!�!��Dn��I!�i�L���s� �
��9���91f�I����L�E`(m�i�u�{�B�Pv����8b�
n�	�?<P���_�ŏ�Xm������_��}|�8������ӫ���=�#�l*%uR"�z�<������'�Kwg��|�c�m�l�^_�߮jU�Т\�O�r!
���~�_��+sV��ڜ%"��c.0AaH}� �&aE���_���E7p�r͂g%,Fw��N�
+endstream
+endobj
+1641 0 obj <<
+/Type /Page
+/Contents 1642 0 R
+/Resources 1640 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1660 0 R
+/Annots [ 1621 0 R 1622 0 R 1647 0 R 1623 0 R 1624 0 R 1625 0 R 1649 0 R 1626 0 R 1627 0 R 1628 0 R 1651 0 R 1629 0 R 1630 0 R 1653 0 R 1631 0 R 1632 0 R 1655 0 R 1633 0 R 1634 0 R 1635 0 R 1657 0 R 1636 0 R 1637 0 R 1659 0 R 1638 0 R 1639 0 R ]
+>> endobj
+1621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 425.461 335.703 436.365]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_a0632eaac5ec676910e433016619b3e85) >>
+>> endobj
+1622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.921 425.461 513.996 436.365]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 413.506 134.838 424.41]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 385.952 522.191 396.856]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_ac23bf247df0b2721e97c8eeb8945adf1) >>
+>> endobj
+1624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.412 373.997 313.028 384.901]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.555 373.997 513.996 384.901]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 362.042 168.591 372.946]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 323.529 530.749 334.433]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_af2932a2fa90f54f604e340d0e2eac7ba) >>
+>> endobj
+1627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.412 311.574 313.028 322.478]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.058 311.574 513.996 322.478]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 299.993 134.838 310.523]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 272.065 343.145 282.969]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_a1842c4ba3cd1adb1e1bccef3cfcfa57f) >>
+>> endobj
+1630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [346.362 272.065 513.996 282.969]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 260.11 168.591 271.014]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 191.05 365.809 201.954]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_a813ac0651ebac0120830cedf1ea58395) >>
+>> endobj
+1632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.027 191.05 513.996 201.954]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 179.095 194.603 189.999]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.603 179.095 327.145 189.999]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.595 151.541 359.281 162.445]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_af4cdf3fbe1977a24a90904e02efd791b) >>
+>> endobj
+1635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.585 151.541 513.996 162.445]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 139.586 163.61 150.49]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.806 112.032 362.05 122.936]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__const__iterator__tag_af8d741d4315fb12dff45b47979f88808) >>
+>> endobj
+1637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.567 112.032 513.996 122.936]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 100.077 194.603 110.981]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.064 100.077 415.692 110.981]
+/A << /S /GoTo /D (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) >>
+>> endobj
+1639 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1643 0 obj <<
+/D [1641 0 R /XYZ 89 770.89 null]
+>> endobj
+1644 0 obj <<
+/D [1641 0 R /XYZ 90 721.073 null]
+>> endobj
+425 0 obj <<
+/D [1641 0 R /XYZ 90 611.746 null]
+>> endobj
+110 0 obj <<
+/D [1641 0 R /XYZ 90 603.082 null]
+>> endobj
+1645 0 obj <<
+/D [1641 0 R /XYZ 90 499.43 null]
+>> endobj
+1646 0 obj <<
+/D [1641 0 R /XYZ 90 441.365 null]
+>> endobj
+1648 0 obj <<
+/D [1641 0 R /XYZ 90 402.498 null]
+>> endobj
+1650 0 obj <<
+/D [1641 0 R /XYZ 90 340.075 null]
+>> endobj
+1652 0 obj <<
+/D [1641 0 R /XYZ 90 288.158 null]
+>> endobj
+1654 0 obj <<
+/D [1641 0 R /XYZ 90 206.954 null]
+>> endobj
+1656 0 obj <<
+/D [1641 0 R /XYZ 90 167.634 null]
+>> endobj
+1658 0 obj <<
+/D [1641 0 R /XYZ 90 128.125 null]
+>> endobj
+1640 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1692 0 obj <<
+/Length 2127      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~��ڇ���ë.�E�6i�%m�Y�CR��*K�$�`�}ŋ.�=N��n�LI��!�}�9�2��
��f�]�.^؋P�S߻��"�<B‡��{?x���
�CD"^j������o�ߩg��g�<�
��
�^����
{)���ÈE���v�x�2�ͽw��fظ���~�c!9F"D{ �Y,	�x�R6q��t��4��:��m��E�
��ߟ)���#�#m�z���V�`D�y\��q�+e�ܿ-+��Y�MV��%�����̼����a�׏u#75j��&�)7c�I��yc
��v ��v f$��/���3�fY��mU.���g���q�,��Q�'��Mߦ4��;�ˍ,�Zw-o��nFEB�=�
�}�h�� 'oV=Q

+�`�Eo��QHB
�+���R��d��ջ���e
լԬ�#mn����Pj��=Y2
 ����p2-���}��j���.���b^|h���jH
���X���rA���a��4��0�
g!`X 
�����a��K��n�U�����eb��t��Z��=�j��v���
7����'
^�'B�D$�� C"
�
X��
 
#�yk�E~���†F�L��
	�F�:�M	���g��|
��ОXDyt��G!Á�x��ZT_��֠�˷���Jp��.�j*ß��'�*2:����~�I�K��	Q��)
+"�-����ZD�C�L�H#{!C~�B�7���_$�����0�Rh"�[����~�V���
��l���qRS��qeEi
n��FV��@`�
F�<d�#R1�J��]���W��u��
��# @�6]��"?W�"H�'����V��ֆ:o�jD���l�vՅ�^H[Ղ�ӢI���IS�f4+�G
�Vg��=�&BGQH
������{>o1F�8Q�
�V|���ԱP��Ͷy��m�rQ�~V�cJ?T��M�ss���fS���M�j�@a�Z/B�z��!��2������A�?(R�b�f�&�� E� �Ra�h<�2�,0cA��0��K�me0H�Z�l3�����֧������:�R�r�\6*QS��mk�����5��%�E�&`�Z�Ǫ�[sC�b��l#�|���	�
+�\ �
s���H�o�H��(@���@&$LpI%��z�
�ͭ.��4
+�a���@�e�������lw&D���8�P�A��څ�IBNJ����х ,
/ň�����bm[4���Pu���jeC+�{��M 2X.��M�?�ϳ0�x֍�x�M٭�2w,�@9�?Z���č�)���դ/O������k at 5�3R-nӹρi�i�<_�*�[������a����Ͽ��K���>A"�w�ܞT��)
�i�v" r`{��
�%�N�%UU�� L����$@�3�F
���
���ł��}�gi��h� �O�Be�	ܺ���ߨ
��	�&������wZ�FC'eek[�;�2�J�Rb�<dyn����
+�]��l�F�_�e\��Rm.�i��R[՛!3u��!BW��4��[��\����hfW�VWó�	�<W]�ɑ��Ɖ\���r	.$��v3�F4�<�k��y��X�]���J�uK��^%�����.���۫T'�q:��LPJ
7u�������L:�޺ccY$yY���}gO�8�T兩	�Ψ��x�G
���ͮ��-lG����_������dF���Kx|���a�ԟ�=�;���f�_l��
����'�/ţƔpz�nZW�Y��R��€2y\�0�p��r���LG4��l����;a�ў��\:	�w�/�������ٜS�
��(�Ϟ��J���
�<Y�=q�'�&Ŷ�!φiY�����
�����q݌�*�!�9Q������f�>���C�/?�sqy��� ���@�{�HD�?O��a�I��a��>���7�{Y�����-;��7S�E�J��A�O#;�������n��??��z�������O-��o�(?��H
�
�
+���HȎ��
�b"u
������n�?���=�#��.��k������n]�b��r���^T���>�n�ʥFps��Q�7�/)�G�
+endstream
+endobj
+1691 0 obj <<
+/Type /Page
+/Contents 1692 0 R
+/Resources 1690 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1660 0 R
+/Annots [ 1661 0 R 1662 0 R 1663 0 R 1664 0 R 1665 0 R 1666 0 R 1667 0 R 1699 0 R 1668 0 R 1669 0 R 1670 0 R 1701 0 R 1671 0 R 1672 0 R 1673 0 R 1674 0 R 1675 0 R 1676 0 R 1704 0 R 1677 0 R 1678 0 R 1679 0 R 1680 0 R 1681 0 R 1707 0 R 1682 0 R 1683 0 R 1684 0 R 1709 0 R 1685 0 R 1686 0 R 1689 0 R ]
+>> endobj
+1661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 432.214 276.535 443.118]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a303533574d5d5d4d8f58e2d8646baa69) >>
+>> endobj
+1662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.351 432.214 405.202 443.118]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 406.818 368.34 417.722]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ac64c8548738734fedbc94f03519b803a) >>
+>> endobj
+1664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.558 406.818 496.409 417.722]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 394.863 241.637 405.767]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 358.508 402.661 369.412]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a95c612736a3e7524077dd5c81bf2a105) >>
+>> endobj
+1667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.879 358.508 513.996 369.412]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 346.553 134.838 357.457]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.137 346.553 310 357.457]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 310.198 411.219 321.102]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ad4d88d3daaa672264c63c83071c2021b) >>
+>> endobj
+1670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.437 310.198 513.996 321.102]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 298.242 134.838 309.146]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.944 298.242 302.806 309.146]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 272.846 283.977 283.75]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a9fc89d795c20b4270756269edf1b9604) >>
+>> endobj
+1673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.793 272.846 438.656 283.75]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.614 211.783 328.317 222.687]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a121252cea61436e0df74e008b80c13b7) >>
+>> endobj
+1675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.641 211.783 482.503 222.687]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 211.783 513.996 222.687]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 199.828 195.719 210.732]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1677 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 174.432 285.093 185.336]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a3094a8093769d647b9f477e14d53a3a0) >>
+>> endobj
+1678 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.909 174.432 439.772 185.336]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1679 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 149.036 281.577 159.94]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ae2c6fa9b0155fd9428ff3abcf1a66805) >>
+>> endobj
+1680 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.794 149.036 435.657 159.94]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [448.917 149.036 513.996 159.94]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 137.081 228.924 147.985]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 111.685 273.975 122.588]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a3671e52fd03a1c456c630b7c5c632df8) >>
+>> endobj
+1683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.193 111.685 428.056 122.588]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [441.316 111.685 513.996 122.588]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 99.729 228.924 110.633]
+/A << /S /GoTo /D (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) >>
+>> endobj
+1685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 74.333 274.573 85.237]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) >>
+>> endobj
+1686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.388 74.333 429.251 85.237]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1689 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1693 0 obj <<
+/D [1691 0 R /XYZ 89 770.89 null]
+>> endobj
+1694 0 obj <<
+/D [1691 0 R /XYZ 90 721.073 null]
+>> endobj
+426 0 obj <<
+/D [1691 0 R /XYZ 90 604.849 null]
+>> endobj
+114 0 obj <<
+/D [1691 0 R /XYZ 90 597.856 null]
+>> endobj
+1695 0 obj <<
+/D [1691 0 R /XYZ 90 499.518 null]
+>> endobj
+1696 0 obj <<
+/D [1691 0 R /XYZ 90 447.166 null]
+>> endobj
+1697 0 obj <<
+/D [1691 0 R /XYZ 90 421.959 null]
+>> endobj
+1698 0 obj <<
+/D [1691 0 R /XYZ 90 373.648 null]
+>> endobj
+1700 0 obj <<
+/D [1691 0 R /XYZ 90 325.791 null]
+>> endobj
+1702 0 obj <<
+/D [1691 0 R /XYZ 90 287.987 null]
+>> endobj
+1703 0 obj <<
+/D [1691 0 R /XYZ 90 226.735 null]
+>> endobj
+1705 0 obj <<
+/D [1691 0 R /XYZ 90 189.573 null]
+>> endobj
+1706 0 obj <<
+/D [1691 0 R /XYZ 90 164.176 null]
+>> endobj
+1708 0 obj <<
+/D [1691 0 R /XYZ 90 126.825 null]
+>> endobj
+1710 0 obj <<
+/D [1691 0 R /XYZ 90 89.474 null]
+>> endobj
+1690 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1737 0 obj <<
+/Length 2431      
+/Filter /FlateDecode
+>>
+stream
+xڽZ[��8~�_A�>,��Ւ@�lm�l�N�L�L6�yJ���656�}��{tÀi۝x��,����|�"������?��W{1�9���‹�'�1w�����ٜ`���Z߽����,d��e}�&�ٜ2�_��I*������D�,�#a�32���狷�_/L�=b�cHD^�����2x���QGރ��B�u�}�������z%�"X	�JH��� bV�A�ۺh at H�-1��l�6�W����a!����>�Aw�J�˫8���b%�
y٘.C(��.���A�צ�(��^�
e~��0��P�ijM�&i��3�T:��(yk��j-7�h�kY�����'u���͏j�دg��6 at poN��8�F1����lgRd�Q�z�T���$j%�ۦ���/ʼ��I�
+���a�c2P

�����/ͼ��h����vm:�FM#�_f�[��˼�8��5�l���D#[��BăW���j[�J�V�v�������6�,_<���&��ؖ3s��i�f �����Au�3x��4g`� _�XYW��f�Aw�
+�7b#�]��I=
S��3��l�[�-�k� JA��z�#g��Rm��1������~���
�����g3~�ۚ��
��-!����H@!��.�)5��R��T
�f9�qc�X�Z�+F�p2�a�p��1#F�w@% ����E#�v��xe�g���gټ: 0�j��&��<�Z�3Z�K�b�=�5	�SJBD��֪q�4���,��@o�8�3S��mmqځ
����#r
�	�1�#���#�H��I��/0�A��i��i��ݝD�c��������o�.f�
5��l��wU
=���m�:	�C���M�j��^��L� 
Z���6	�Q�!�i�r�N�P��o�Y.f(��9Hn���la�z
��oޚ�а'�ag^���`!�#�SK-��!v�Kq6��Đ���Έ�
B�m	�4�? b���a���
H�4rHJ���5PJWI=	%޷
�g�[=�T�D��HVx2xT‡X���I\�^��\�&�t�U[��|�A�T^=
�
Vy���j��v9��>O��
�CU�X8
FOf�)��pI�CҤy~�m7�x`�ޙ���Q���3�`�(z9s��ˀ)$�C���6�BZ3}T���k�Miʏ���ma��A :��y�.Q$�9؎
GպL��<�|���
�B�8'�|+�(܄b�s7��s� \Bq2��$wb(�L?
U�UK(%���C8�ρY�s!��t�n��od��kͣ�I��&��J�� f�Ji�[f��Y������]*�Vd�P/��\L>o�@j�aj#�[��g�����T^�>��
�%-����*pM���Y��R�
�)�t��3�@�b�q� P���ț��FV�HY�n7C�v�oW��oo!f	�@;Ν.�Z̢?�����T�s- 䰡
+0 ��i_u��I�Q9��9H�P���3D<U
�/g� ^���Fz����@���ڦ|=@կq�X��]W�����L���,M;(�
�V%0,�Y榄!I�`�6�	ix�� �����>e8���X�	;�����H�oA�ȋt�ͤ�IH�'
��;����X2�ν�al </
+�:B��	�MB��ȀPx,\�umMT|RIe�����Z�r\ #w�Iݝ�?7r�������xP!r�j�^��ަj�l��S���B��h��!ٮG�ȅ��Lw��zZ0~��9�+��y�$0���2J��w	�M^Ȥ�{�XղQ���d`-m6 ��湱�#�*��K�5^�3�X�}u<�5�.�V`_��Is��t�}O)嵭���~��SxR�3���2�jM�K�c]N����
���j
�1�����\���h�JÀ)Z��ш"���e��1�BH
�m�5����I���/���S�}O
�(1�:����MXC1�cbt���s螘�6R�!�X \8=��>o&k�Q��+Zd�Q����_0��Zz��,��a
ޫAu^i�EF�0�>0�b7���s�-Uٟ
Q��3'��Q�ONQ��}x��v&3+�OF��jm5k��R�ӵþ�6
+�̪�m/Q0�x�%��C���.)v?Q�'Yf���"HwiV�|FG��6B�������E@m�p5������jN]���M�fmvDs�B �G{��f2��G�ǧ+�/;8E��~١�Ap@
D �0ߢ�1�8�"��ߘ�ks�I��6Y���(�
��F��T��N�
�G[��Wږ�N9@�"���#���y��?=���Bm;�U��G�Wm[�py�e��l��r��� ��\����Ly���irѸ�9��:���B ��T�����E���zxoJ،݇6�S7
+endstream
+endobj
+1736 0 obj <<
+/Type /Page
+/Contents 1737 0 R
+/Resources 1735 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1660 0 R
+/Annots [ 1687 0 R 1688 0 R 1711 0 R 1712 0 R 1713 0 R 1741 0 R 1714 0 R 1715 0 R 1716 0 R 1717 0 R 1718 0 R 1719 0 R 1720 0 R 1721 0 R 1722 0 R 1723 0 R 1724 0 R 1725 0 R 1726 0 R 1727 0 R 1728 0 R 1734 0 R ]
+>> endobj
+1687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 650.466 279.544 661.37]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a4578b5352510727810a7c3be32208aae) >>
+>> endobj
+1688 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.36 650.466 408.21 661.37]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.711 625.442 350.983 636.346]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_a22e81aa8cd862935e9a0abab515cf838) >>
+>> endobj
+1712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.405 625.442 480.255 636.346]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 625.442 513.996 636.346]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 613.487 228.904 624.391]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 553.447 291.738 564.351]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_abc859551651eca1bcc3839f62d45dbfe) >>
+>> endobj
+1715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.554 553.447 446.416 564.351]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.098 528.422 296.048 539.326]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_af29295940b1ad0b6b48cc44e92f04060) >>
+>> endobj
+1717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.133 528.422 513.996 539.326]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.891 491.443 299.822 502.347]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_ad00a2a1877537fa49a41013078ee2bb6) >>
+>> endobj
+1719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.559 491.443 503.422 502.347]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 466.419 305.526 477.323]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_aa6324c2e330df63ad428eec9182fcc4d) >>
+>> endobj
+1721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.744 466.419 459.607 477.323]
+/A << /S /GoTo /D (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) >>
+>> endobj
+1722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 441.394 300.585 452.298]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__System__tag_aaf6f8270e3742973e0df7dcc9132f7ae) >>
+>> endobj
+1723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.4 441.394 429.251 452.298]
+/A << /S /GoTo /D (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) >>
+>> endobj
+1724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 134.507 241.617 145.411]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a9c2a70f5f90ec3da123f549d6ca9fe4a) >>
+>> endobj
+1725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.835 134.507 335.364 145.411]
+/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
+>> endobj
+1726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.712 134.507 483.438 145.411]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 122.552 259.649 133.456]
+/A << /S /GoTo /D (group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) >>
+>> endobj
+1728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.898 122.552 365.392 133.456]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1734 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1738 0 obj <<
+/D [1736 0 R /XYZ 89 770.89 null]
+>> endobj
+1739 0 obj <<
+/D [1736 0 R /XYZ 90 665.325 null]
+>> endobj
+1740 0 obj <<
+/D [1736 0 R /XYZ 90 640.49 null]
+>> endobj
+1742 0 obj <<
+/D [1736 0 R /XYZ 90 568.305 null]
+>> endobj
+1743 0 obj <<
+/D [1736 0 R /XYZ 90 545.165 null]
+>> endobj
+1744 0 obj <<
+/D [1736 0 R /XYZ 90 506.49 null]
+>> endobj
+1745 0 obj <<
+/D [1736 0 R /XYZ 90 481.466 null]
+>> endobj
+1746 0 obj <<
+/D [1736 0 R /XYZ 90 456.442 null]
+>> endobj
+1747 0 obj <<
+/D [1736 0 R /XYZ 90 416.049 null]
+>> endobj
+459 0 obj <<
+/D [1736 0 R /XYZ 90 306.696 null]
+>> endobj
+118 0 obj <<
+/D [1736 0 R /XYZ 90 299.415 null]
+>> endobj
+1748 0 obj <<
+/D [1736 0 R /XYZ 90 201.16 null]
+>> endobj
+1749 0 obj <<
+/D [1736 0 R /XYZ 90 149.366 null]
+>> endobj
+1735 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1782 0 obj <<
+/Length 2291      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�F~ׯ�ۂU�hN
��F>J�c{m��`�X1�P �(�~{�EҢ��R�0
�4���>�
�=���������
����b��!
���/���߯~r� z�I�^|x����gu����ٟgna������ܜ}�
;1L��`����Ӌ6�
�����?gز��,y}��;|B!����
+��f��e.0v���ӊ�rm���P�ݢH��Q��-ޖI�x+3YFu^.��e���͢�;2-u��+x'yMzDrH��
�=�h �Es�_1fj�Hz�€6k�5�@D;�p��q�mN}��9s�	�]�3�2�e5�Ӏ���T���\T��d���y������W��ψ+�n>�c�Y��Y���U-��`�c�2��o$�dְ�(�}}
�0`(��Y�͢�� � μ�
+����2��272��DY�Z�Wyi�r <���X�B��)u�
�P�g�g�J�j�R�LE��Ʊ9�2,��Dz��n'��g��ա�8�B�����ƒ'�		��U�oFs�G(
+�5Ə99�XHw�/
��j
�yV՚��Q3�>B�����!��K�6Ke�>��$���#
+���uzb`j��Q� �\�Ž� �|9"�p��)�	�g���L�s�	�D�zcBj�긲3ք�{�T�v����F�È���
�*�̀�ʪ<�(���UTU�:�gl�R���,#@�
�3��\>�0�������\
��H�aA��P�J�
�j�E���X�J ��:�:��"J��';E�C���C؆��[x�d'����
l
��t�8�?�y�
�~��8vo�4�m��ײu<ϝg{9��
[u�$��&�C#����ƽ����K�v�<��lm��\n6-"wI������2��Q�Z�^���TF��ю�a<��<��oDy�͖5d[�a5	ȫ�\��v�<NV�#�޶�3��qB��H�D��M�,�*.�
rLV�:V�Dz�}cD
3������)^�\es���P�ѡ��	�R锋b
���L؅��:/נ¤�z�)�q���<����
7i�'��
#a���5'�I��2;?�� �
�(G�T*��Qr��ht��\�T��C����oK�ӗ�uH��#�Tn�Q�B�~z�3�����˞�_]�E�8�Д��
1�"&��;�ߡ�G�������$��
�!�}",ܛ�%ٷ�$�~p"wE����	��^�Da�6��C��b?w��d8c|���T6 c2�
���a9��l Qn��K����0hT�;�X��
����nx�狂~����芃��Nn�������K�$�l|`��{��!x�{'M���P?<7A:�G�ϕ}tmvUQ�T�:�{�nd��K0���(�H�E��JId��Y]��&}[%��0m
e'�t����ͬ,dy;J�|c=u�'�
N
��
���k�	6O��l�`�k%W[[�C����bw���n�b[��eu`Y���
�E�Y���?lk��] [...]
+o������D�Z/lR�6���"�YB�}�m�7Ϧ���mpZ���xn�y?�g���>��1/�������z��
�|J�oY��
�"he���� �]��8
!*�!��>>(;��	U\�VLl
E�@d@蕬�$ծ��Z�IQ�{�#�`�	M�r5
�{_�jT����2�*���ipdJEX!d[gW�f�S��0R���M�!
ttY��Ӷ�!ʨ&�\W�6z(1"�::�v����
1� �rƸ��D���v3�c+j��kB�{58�&$�wԣn�C,�2�e��zS�rh��C�����|¥���FF1�
+T��f�j���G����_��6r�P��'&�n-�_o�o6{����9�r ֑��yG����C�bkcŠ��y�P[?�3�
sye�m��w/j	���_�l��~��m��Zg|��$��
�����r���,��VğUmM����eL�n�xy~~�]��[��qNC��6��Vo�Y�M^6M�L5V4P�X��U�
c
+endstream
+endobj
+1781 0 obj <<
+/Type /Page
+/Contents 1782 0 R
+/Resources 1780 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1660 0 R
+/Annots [ 1729 0 R 1730 0 R 1731 0 R 1732 0 R 1733 0 R 1786 0 R 1750 0 R 1751 0 R 1752 0 R 1788 0 R 1753 0 R 1754 0 R 1755 0 R 1756 0 R 1757 0 R 1758 0 R 1759 0 R 1760 0 R 1761 0 R 1762 0 R 1763 0 R 1793 0 R 1764 0 R 1765 0 R 1766 0 R 1767 0 R 1768 0 R 1769 0 R 1770 0 R 1771 0 R 1772 0 R 1773 0 R 1774 0 R 1775 0 R 1776 0 R 1777 0 R 1778 0 R 1779 0 R ]
+>> endobj
+1729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 707.957 310.289 718.861]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a6cb7351e1bb87181f7e6c946db398b5b) >>
+>> endobj
+1730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.104 707.957 404.634 718.861]
+/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
+>> endobj
+1731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 670.629 334.02 681.533]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_acc700387404f10208584c1a847a6f328) >>
+>> endobj
+1732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.237 670.629 427.767 681.533]
+/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
+>> endobj
+1733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.115 670.629 513.996 681.533]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 658.674 179.65 669.578]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 621.346 342.577 632.25]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a2a64fe7b9774c990bd9db8aecd2dacea) >>
+>> endobj
+1751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.795 621.346 436.325 632.25]
+/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
+>> endobj
+1752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.354 621.346 513.996 632.25]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 609.764 179.65 620.294]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 583.021 249.656 593.925]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a9b452ce4baaf1c1644a6eb33658ae48a) >>
+>> endobj
+1754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.472 583.021 370.014 593.925]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.361 518.699 295.743 529.603]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a85958538f17770d4ae66bcd179d747a1) >>
+>> endobj
+1756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.813 518.699 417.355 529.603]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.64 518.699 513.996 529.603]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 480.375 243.021 491.279]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_adfc86b3b2966514ba2e2292584f68c08) >>
+>> endobj
+1759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.837 480.375 363.379 491.279]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 454.006 267.071 464.91]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a99aac01eb1b8adc3667bbd3db68e8d34) >>
+>> endobj
+1761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.289 454.006 386.831 464.91]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.216 454.006 479.572 464.91]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.05 454.006 513.996 464.91]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 442.424 183.844 452.954]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 415.681 253.293 426.585]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a8b96d560404b7b7ee0ec7ea1aef80280) >>
+>> endobj
+1765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.108 415.681 373.65 426.585]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.111 415.681 455.592 426.585]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 389.312 240.252 400.216]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_aa8e9420c29d8c75e775c4fd609830769) >>
+>> endobj
+1768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.068 389.312 360.609 400.216]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 314.031 257.417 324.935]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_afb6f23292760d6d55c57b5722f604897) >>
+>> endobj
+1770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.233 314.031 377.775 324.935]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 287.662 260.735 298.566]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a0ca9a6d6894e381babab8f958c194f07) >>
+>> endobj
+1772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [324.595 287.662 441.137 298.566]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 261.293 265.716 272.197]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a3fc151fc10282a5ede395e9b8a5502e2) >>
+>> endobj
+1774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.056 261.293 435.597 272.197]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 234.923 271.803 245.827]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_ac5a83c9e42e34b313e12a6cef4470a75) >>
+>> endobj
+1776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.619 234.923 392.161 245.827]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 208.554 266.264 219.458]
+/A << /S /GoTo /D (interfaceppl__Grid__Generator__tag_a190a7c46776178432e89c9525db039ab) >>
+>> endobj
+1778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.079 208.554 360.609 219.458]
+/A << /S /GoTo /D (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) >>
+>> endobj
+1779 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1783 0 obj <<
+/D [1781 0 R /XYZ 89 770.89 null]
+>> endobj
+1784 0 obj <<
+/D [1781 0 R /XYZ 90 721.073 null]
+>> endobj
+1785 0 obj <<
+/D [1781 0 R /XYZ 90 686.129 null]
+>> endobj
+1787 0 obj <<
+/D [1781 0 R /XYZ 90 637.299 null]
+>> endobj
+1789 0 obj <<
+/D [1781 0 R /XYZ 90 598.522 null]
+>> endobj
+1790 0 obj <<
+/D [1781 0 R /XYZ 90 534.011 null]
+>> endobj
+1791 0 obj <<
+/D [1781 0 R /XYZ 90 495.875 null]
+>> endobj
+1792 0 obj <<
+/D [1781 0 R /XYZ 90 469.506 null]
+>> endobj
+1794 0 obj <<
+/D [1781 0 R /XYZ 90 431.182 null]
+>> endobj
+1795 0 obj <<
+/D [1781 0 R /XYZ 90 404.812 null]
+>> endobj
+1796 0 obj <<
+/D [1781 0 R /XYZ 90 329.343 null]
+>> endobj
+1797 0 obj <<
+/D [1781 0 R /XYZ 90 304.857 null]
+>> endobj
+1798 0 obj <<
+/D [1781 0 R /XYZ 90 276.793 null]
+>> endobj
+1799 0 obj <<
+/D [1781 0 R /XYZ 90 250.424 null]
+>> endobj
+1800 0 obj <<
+/D [1781 0 R /XYZ 90 224.055 null]
+>> endobj
+1801 0 obj <<
+/D [1781 0 R /XYZ 90 181.302 null]
+>> endobj
+460 0 obj <<
+/D [1781 0 R /XYZ 90 69.05 null]
+>> endobj
+1780 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F104 1604 0 R /F38 1605 0 R /F93 336 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1842 0 obj <<
+/Length 2237      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~���k1�wJ�b�m�iӢ��b�b�X�-T���<��_��7]l��Ğ�l�DQy.�w�)
�"
}7��vr�Z�(A��2�]F	�O��p�E�
+9�������{��:����}=#�To�yU�5�j6�Oߔ����B��wz�ݸ�t���x*����'��N���Gĭ*����f��7
e��}�K����D�2��/�N�W #*L�\�:1�A�4�����s(aq��;
'��aHĪhdi�1œ�w�YWa�κ�!%����a�Y�kS�c�U֦
�|�_�Igjj B�@� �tm�a
~�y-���[�y�#�7��,�ӏ�z�Ж��k,w�U}���]�pƷm=#b�e���@�[ò
+I��j��E�˴	�u#
������̥�*
0DZܭu���G���
���,3@����>QƢ9�K�^|���љ3���(G쌇�
�S�x67�	-���i�e�n�惮�<�`*2X��`G�_C L�
/a���-��޾p�ܶ*7�l�|�J����$
X���u�T
^�����
�p݆+�ʓ�
`V4�,����c?<��֛Ѽ`����Q6D�=mh���sԢ�W����@c���� ,��"��=�-�Lt 
���
+/���
�0���iiY���Z�%�m��לal���}�}Ufy�r�4�{
8
� �u6<Ʈ3/{���t\L�y�.�i��o�!�|=�3���uޓ
`i�Ex̯J�ދ
N��VÃx2��f h��g�;	�Y�(�b){�q�� �t4^RPIr	�$� �$9�ǼYߵF�_��u�3BI���=��8BdL�
�s��9�1��]�s3�5�sƈ��K�������"���E�y0�8�?�)�m8e��Pv���
v�)3*
)�	�=��@�
DC
��9�-����T
+�0�'
�ёu��˺ڜND��g���
+R%����В1f�l�
+Ő�t�8>)�����o�����"3�C%6먎��=
+:���	��|��5������kU�1$
+�f�Z�@�P�_���ѫ'i�$h;&)
L�3���,�h����u�1��
	|
�X�
9M8~
���/��,�\��vS=w�cLs5�����)h�d֯�,8Ư�5�Ű��.mƒ�hƒ����6���F
�������[����D^3�$]�

3m�0+����f��3���K�X"
�!�.�i*%��R�o�8&_�c��R����ݳV�R=�Zezu���a��*
3lp��aP��2
ƌ1
�-�ບ���QȒ�{�dP<v$[�A2�:�u�$��#�H=}��$��$����1��Ld�zw�
g'���2����
F){,
�>\Đ]��Ϙɨ�Ɂ�Tm%�3����W�v�}�w���
�D�sS(�.��$m
E�Әi�B��
E���Lǐa	�v�3��Y�γ/�ʘ@
'��,�$

c�-�_#�}΄&��0��=��
	�f��z�$��4xs�����DI�'d7Nz٭��n�岛�i�{��
n��s|�%����E0�/MvE�q̜]�}�

����3�Z@��1��쏘	/g���O�ms�N\�69b��
�O����e.w�N����Q@�Z�m�� ����2i?�A�1
�@�6�%�I%-����n�A���U�菄2]�F_�D�6�(E��!ޔ3��i�g����p�
��m�B5�ׄ�
iֹ�}��n�����|p
.=V
A���K�0�c^���]6��(<�?��˅N�:C�O��"���R1c_O����W���NG��|�qO��=
�����r9D�ݰ��h�l��>�f$b

�

�"I?��ts��)�r�
c�H��Pf
<
�Gq�۰���
�9�C�ٹ)�����/��M>��%F؛�¯Ә>�E�����E�7X!Q\�F�� 4�W�
� ��(
����t�x���x�//:p��� Ip�(9C���^�*�*�� �uNTi��F�H1M�+>���� //-Ib���\R���&�F��3�c��P��nW�}�~X�
+	��q
+j���[�x�sFZ�v�J��3I�������3!���?��.�)����E]w� ��
���Y�
���=
+�&��Nl�@D�"غi���[mu�B�jsI����8�z�=��T�碼��MjR,
+?��

�G�`50��KD)jG���ax�wٰܼ�U��~+��l\;
+endstream
+endobj
+1841 0 obj <<
+/Type /Page
+/Contents 1842 0 R
+/Resources 1840 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1660 0 R
+/Annots [ 1802 0 R 1803 0 R 1804 0 R 1805 0 R 1806 0 R 1847 0 R 1807 0 R 1808 0 R 1809 0 R 1849 0 R 1810 0 R 1811 0 R 1812 0 R 1851 0 R 1813 0 R 1814 0 R 1815 0 R 1853 0 R 1816 0 R 1817 0 R 1818 0 R 1855 0 R 1819 0 R 1820 0 R 1821 0 R 1857 0 R 1822 0 R 1823 0 R 1824 0 R 1859 0 R 1825 0 R 1826 0 R 1827 0 R 1828 0 R 1829 0 R 1862 0 R 1830 0 R 1831 0 R 1832 0 R 1833 0 R 1839 0 R ]
+>> endobj
+1802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 563.049 254.399 573.953]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_aa891671c2b9414353067da44a108ac1d) >>
+>> endobj
+1803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.214 563.049 360.928 573.953]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 526.755 322.991 537.659]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a512810c3e349a2f01217c6e426645260) >>
+>> endobj
+1805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.209 526.755 428.923 537.659]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.482 526.755 513.996 537.659]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 514.8 149.224 525.704]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.77 478.506 359.65 489.41]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_afc650c1c744fbfc4dbd15293b9827776) >>
+>> endobj
+1808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.13 478.506 466.843 489.41]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 478.506 513.996 489.41]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 466.551 236.107 477.455]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 430.257 324.645 441.161]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a7d65378709f5a0c73e711f5528385990) >>
+>> endobj
+1811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.862 430.257 430.576 441.161]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.135 430.257 513.996 441.161]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 418.675 134.838 429.206]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 382.008 322.961 392.912]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a9ab7b109b1acae567c915b1db83b5283) >>
+>> endobj
+1814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.179 382.008 428.893 392.912]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.452 382.008 513.996 392.912]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 370.053 134.838 380.957]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+1816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.03 333.759 332.792 344.663]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a1c54d4109f395752ea23822cee000d04) >>
+>> endobj
+1817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.532 333.759 440.246 344.663]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 333.759 513.996 344.663]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 321.804 182.977 332.708]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+1819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 285.51 346.204 296.414]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_af99b9dc1c16751ce872dab5245c22fdf) >>
+>> endobj
+1820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.422 285.51 452.135 296.414]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [473.695 285.51 513.996 296.414]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 273.555 202.892 284.459]
+/A << /S /GoTo /D (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) >>
+>> endobj
+1822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.052 237.261 367.489 248.165]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_abbbdd7f3c4800ef97b642142cd68648d) >>
+>> endobj
+1823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.251 237.261 473.965 248.165]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 237.261 513.996 248.165]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 225.306 236.107 236.209]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 199.971 261.841 210.874]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_af232ff2f43109950ac1b0f5d124cf4cc) >>
+>> endobj
+1826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.656 199.971 394.382 210.874]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 139.076 306.074 149.98]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6822) >>
+>> endobj
+1828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.292 139.076 438.018 149.98]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.615 139.076 513.996 149.98]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 127.121 149.224 138.025]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.417 101.786 281.164 112.69]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a86c148ed14d1a2781e07bea5be7fb434) >>
+>> endobj
+1831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.291 101.786 415.017 112.69]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.64 101.786 513.996 112.69]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.151 89.831 213.632 100.735]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1839 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1843 0 obj <<
+/D [1841 0 R /XYZ 89 770.89 null]
+>> endobj
+122 0 obj <<
+/D [1841 0 R /XYZ 90 721.073 null]
+>> endobj
+1844 0 obj <<
+/D [1841 0 R /XYZ 90 630.246 null]
+>> endobj
+1845 0 obj <<
+/D [1841 0 R /XYZ 90 577.985 null]
+>> endobj
+1846 0 obj <<
+/D [1841 0 R /XYZ 90 541.88 null]
+>> endobj
+1848 0 obj <<
+/D [1841 0 R /XYZ 90 493.631 null]
+>> endobj
+1850 0 obj <<
+/D [1841 0 R /XYZ 90 445.835 null]
+>> endobj
+1852 0 obj <<
+/D [1841 0 R /XYZ 90 397.133 null]
+>> endobj
+1854 0 obj <<
+/D [1841 0 R /XYZ 90 348.884 null]
+>> endobj
+1856 0 obj <<
+/D [1841 0 R /XYZ 90 300.635 null]
+>> endobj
+1858 0 obj <<
+/D [1841 0 R /XYZ 90 252.386 null]
+>> endobj
+1860 0 obj <<
+/D [1841 0 R /XYZ 90 215.096 null]
+>> endobj
+1861 0 obj <<
+/D [1841 0 R /XYZ 90 154.012 null]
+>> endobj
+1863 0 obj <<
+/D [1841 0 R /XYZ 90 116.911 null]
+>> endobj
+1840 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1897 0 obj <<
+/Length 2184      
+/Filter /FlateDecode
+>>
+stream
+x��ZY��6~�_���j-
� �����r2�����T
�X�
3���m <%�4�ݪ})h4��>Al�-l�����;�-��K]k����-��¿��<q����-�z�&駯?�<����zw�v~��
�W�"f���g-�Ͽc+��?Z1�YOzPlٔ�5�>���׬�>Kn�%B8ra'b��RG/�L�>�
�'aR֏3����=�<ɲhq&��o�d�,�0Ma�I�t-�VŢ�y�M\��
;x/uMy�&E9B�
#�W�y��j��S��R��tʤ�i}x�v=k�cD��u�$���Es���
�#\��R��
H2�yv��4
e1Մ@���s{'Xo���Y��ČVʣ̀r#rJ�S�'k�c$o^i��te�����S�' �)�#����`7�Y5�#|�x
h4� g��ȱ���'.����8?�4��+BN
R�
+J�k�!
~�e�'JKě�撥EX��J�D��˩��47C�Ո��W��
+���VCa�"s�J�X���G��8���jM�Pi�~ʆd�~C%,�'a�E2
�� �z?j7�~
��U2)�W��Ġ�HC�# ��n0X�0,c�X?	�M&��(��?���Eז��a�ɘ�券��˜
D�
��LR�n��37�rUEf H���A�Y����u��*}�ⰵ�"�����X�%���d��dv��0"�Ew�Wcz�
|T�����$z
"���{Ι#��k �٘G.�:�
�����P�
����#$�
�	�D_$��/�c~��s9�����#�2���E��`�.��=�J�8Ȇ�r%X���W
���{�|
��V�0)1P
u!��=�]�,U�hD��Ks�ޯ�>
���,�{�����Q���ؕ���`$�#���g$A�(S��V��'A�����
�
N��д�"����!����Q��`��x�1v��y�@��C��0�����ZP������5��F+
0�)

3�N�k��<4��0��6����ȱ��C�׮
&[���:,yR��q����g6���Y�M��_�K��0u��B�5���� M�F�Ե��i[k���%���y�哔�쓾2���y����!I��n�p�O������ڑ�	�B��
+�ׁ�i� h���y�Jy��~�zy�9n�^#�[p8�Vng�_4{�v
���)�]��5� N���F ��>�Q,P�N|�t�!4r�C�~�X|��b<^�
+�&i�


�n�}"�(i}<�p������U����4d�WQ=���
K�Wy��1|-��G0F4���uV�{!�>)���
�b��6���
��LS#
uh�w�j?�8u��<ǻbl���
��yDWϻ���AH��ev1ְ:���c����Q:�c�Ptw��y�%� ePyi��|�dUy��*�b�ٕ�ߢL���0]d9�<�%^��咦�G��h�0s�����H�+� ����(��Dw#
��
+]���Vg�����[�
j�1�1���`6��e.������p�=E�_
C_�eR���\w�p0��s!`TcM�WF�_�	�妩�� c#ޕ�
+3{p��XO0�5�"l�0l���E�r��R6
�2W�/D5����T�����	�*��uc��u�U
�����
я5]	r�i�dX��E��b�����o}j
��)�8�œ�� ]�
�7���i%�W%���\�w����o�/�{
�q��=�|��x
�&l�q��)J����t%
�� �N��J
Qp�.��8��m_G�
�����
��Є�\@��`zT��
�+Â2�3��:"�� �7���H�M���b��Yy�d��bv��ϧ
�<g�������E�������ɜ�+����Zq�&�(��H
`�T=}
9Ą�;+���4����<�N�:�P���^�N�k�� ��˰���L�NFΖ
�tY�Cx�{�Lj�6aد߫�v�Ea����V)j����UG���l@
���=�t at Zl�@dw�	�
Fmh�RȨة��&�ϙ��B�O0L8��e�^�l��n���z����
��:���{.d�ʠ��bP�h
j���{s�>	��u���v��k!�)���jR�Ѵ�Ϗ
+�2�p
�
���k��x�$�C��?�-��
+q��
b��>lS��w���
�-�x�
t�9G�;�nA�y��W�0i��mE�Cz�
+endstream
+endobj
+1896 0 obj <<
+/Type /Page
+/Contents 1897 0 R
+/Resources 1895 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1660 0 R
+/Annots [ 1834 0 R 1835 0 R 1836 0 R 1900 0 R 1837 0 R 1838 0 R 1864 0 R 1865 0 R 1866 0 R 1867 0 R 1868 0 R 1869 0 R 1870 0 R 1871 0 R 1872 0 R 1873 0 R 1874 0 R 1906 0 R 1875 0 R 1876 0 R 1877 0 R 1908 0 R 1878 0 R 1879 0 R 1880 0 R 1910 0 R 1881 0 R 1882 0 R 1883 0 R 1912 0 R 1884 0 R 1885 0 R 1886 0 R 1887 0 R 1888 0 R 1889 0 R 1890 0 R 1891 0 R 1892 0 R 1893 0 R 1894 0 R ]
+>> endobj
+1834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 707.957 323.788 718.861]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ae7af7908bffe9b331262dcf8fd020b7f) >>
+>> endobj
+1835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.006 707.957 455.732 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [467.328 707.957 513.996 718.861]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.376 134.838 706.906]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+1837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 670.227 252.436 681.131]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ae861c5919e346c3966c43edc4cd47276) >>
+>> endobj
+1838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.252 670.227 384.978 681.131]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 633.493 266.822 644.397]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ab348eeffa0a61124b880932c35d0188b) >>
+>> endobj
+1865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.637 633.493 399.364 644.397]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 607.718 374.128 618.622]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a5f05719adb05b4fc86b33bbcf63884eb) >>
+>> endobj
+1867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.346 607.718 506.072 618.622]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.97 545.614 311.817 556.518]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a225478fba412d40b785e2b41809cc90d) >>
+>> endobj
+1869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.497 545.614 418.211 556.518]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.64 545.614 513.996 556.518]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [142.151 533.659 239.644 544.563]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 496.925 332.645 507.829]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a84c2e36e2ae01775ce542ebc83739726) >>
+>> endobj
+1873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.863 496.925 438.577 507.829]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [450.173 496.925 513.996 507.829]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 485.343 134.838 495.874]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.318 459.195 345.618 470.099]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_abfe9ef58fb96938e1c26b63e2b4ce0d1) >>
+>> endobj
+1876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.646 459.195 452.36 470.099]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [469.942 459.195 513.996 470.099]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 447.24 215.076 458.144]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.616 421.465 373.689 432.369]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a3530a20e5985d6da8acabad37bfe0e93) >>
+>> endobj
+1879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.015 421.465 479.729 432.369]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 421.465 513.996 432.369]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 409.51 241.089 420.414]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 383.735 335.175 394.639]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a8172cf537ccecb7826eb21837b8d7e7b) >>
+>> endobj
+1882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.393 383.735 441.107 394.639]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.703 383.735 513.996 394.639]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 372.153 134.838 382.684]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+1884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 309.675 269.601 320.579]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) >>
+>> endobj
+1885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.417 309.675 402.143 320.579]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 283.9 272.919 294.804]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a46773b226d490e5bbf6f3d587cf29dc4) >>
+>> endobj
+1887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.779 283.9 465.505 294.804]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 258.126 277.9 269.029]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_a50bcfefbf053e770951fa02c2e2eb112) >>
+>> endobj
+1889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.24 258.126 459.966 269.029]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 232.351 283.987 243.255]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_ac21bf6dd42b915ff6f157fb73fe396e0) >>
+>> endobj
+1891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.803 232.351 416.529 243.255]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 206.576 278.448 217.48]
+/A << /S /GoTo /D (interfaceppl__Linear__Expression__tag_af78187771d58e90c174eeba577a471d5) >>
+>> endobj
+1893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.264 206.576 384.978 217.48]
+/A << /S /GoTo /D (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) >>
+>> endobj
+1894 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1898 0 obj <<
+/D [1896 0 R /XYZ 89 770.89 null]
+>> endobj
+1899 0 obj <<
+/D [1896 0 R /XYZ 90 721.073 null]
+>> endobj
+1901 0 obj <<
+/D [1896 0 R /XYZ 90 685.462 null]
+>> endobj
+1902 0 obj <<
+/D [1896 0 R /XYZ 90 648.728 null]
+>> endobj
+1903 0 obj <<
+/D [1896 0 R /XYZ 90 622.954 null]
+>> endobj
+1904 0 obj <<
+/D [1896 0 R /XYZ 90 560.66 null]
+>> endobj
+1905 0 obj <<
+/D [1896 0 R /XYZ 90 512.16 null]
+>> endobj
+1907 0 obj <<
+/D [1896 0 R /XYZ 90 474.43 null]
+>> endobj
+1909 0 obj <<
+/D [1896 0 R /XYZ 90 436.7 null]
+>> endobj
+1911 0 obj <<
+/D [1896 0 R /XYZ 90 398.97 null]
+>> endobj
+1913 0 obj <<
+/D [1896 0 R /XYZ 90 324.722 null]
+>> endobj
+1914 0 obj <<
+/D [1896 0 R /XYZ 90 300.83 null]
+>> endobj
+1915 0 obj <<
+/D [1896 0 R /XYZ 90 273.361 null]
+>> endobj
+1916 0 obj <<
+/D [1896 0 R /XYZ 90 247.586 null]
+>> endobj
+1917 0 obj <<
+/D [1896 0 R /XYZ 90 221.811 null]
+>> endobj
+1918 0 obj <<
+/D [1896 0 R /XYZ 90 180.498 null]
+>> endobj
+461 0 obj <<
+/D [1896 0 R /XYZ 90 69.644 null]
+>> endobj
+1895 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F101 531 0 R /F99 1219 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1956 0 obj <<
+/Length 2013      
+/Filter /FlateDecode
+>>
+stream
+x��Zko�8��_!t?�
�
�
����)<�����m�"1������_���V�:�Ğ�O�h��<<��^��ZX���;����\l��w�c�o-[��#��[l}��!��W�ep1�
+������R�A.C�q�U��
#�_�ŭP�D�����|�����x���G�>���Ǒ�YQ����b���ˆ������M<�֬��
6CLjrY�3϶A>紞	��5��!�A6w�7
������f@
�����}@��(���~�:���Q�T
�j��a��ۧ�����ا�äY�~�e�����M� r`��
�9ۄ
��
R1��
�
�?�D��f�.ܮ��J�����.H�UaU(�H���-S��ȡ���$���X�0�MKΐ
�`��
}�dT7�ʉ�;Ƣ@w
�y
9�S7��ƣEp��6* � F��Z,�J�޳�
��6�_0Ǘye$\݅U]��

S�r�c*�Q<AAW�ey3���!6�R�-�����1�ɗI��<��0�vN�0�1�B�q[_(���C�O��TK�
��k�@���:�W����ߣ�dz\LO����SS�9�͸<ny0.�V��ȱ	������0�m�Յwi�-I����w�Ѫj�
��5�)��4x�>
*��?�$;*l��
�zz|>�f����,�xy6
�&PuHP�٭���37��ޞ
X��j]�? s<�xy:>=,.7�:�E�X���b�uXX�`˾�r2��_Oσ����b<_��''����	��P�i`&�U�DI�0HEyV�K�Y��0U�%f��8��x(�����x:�u��{I�2(��n��뻺��+��<��XȘ�������x6Ƨ�����d(��l�S����S �:z#��0�j9
qr5�b at p_��p����}v>
���~����[!�N<��C(�`�7����XGU^��u���LY*��I�s*ꦇ����|&����9Ч�E��
+r� N`���Ξ���D����ÓI��D�a�o2-�N:�jM�F�G�l,MV�w�PL��hu��#O�sK�AI��)�%�wd@/��x�,�:�5{T��'���tm��љ϶-rQ��pĺIkP2
&u��fER������:�r�Ljz��8.
r���
��������7
��O�3��]a�Ljy�bc��&�ԝĕӈ_�K$}S�=T�
+��
J�B
���#�˧6*����c����$a���
+ ��AW�Ka�eR{�t/JtmEyxh�A�->�P⃧�����:�[7�
����n�~��%��E�)�"�7\��S#w�G%�
������J�|�ÂK�M��]��i{�d&�@����),y�aG���<@�n�H�a�#����g�C����gB�=^����[�'�ݧ��m�m�G� ��x
9�f�&�'�y� �C���x�V�|�,�|#�9e�?%�O�|��K�V:hf;�����2� bo��qڐ~˔"���Q�*/���B�R؇�P���eE�\���Lg�J�ġ�W�F���b!���bÂ8{��m�*:�*��!���y�T����v��vI'ݷ�P�\/��-\�)Iۇj�v
Cu�]1!l|�Q>����
x�
8������4<_��nj�Y����Kcb)*��J���T�p`_n�+k�d2���I
6�f��f��=@����~�R8 ��O���}~U	�y-�&�iێ�¸�U��Mn�r�QTw�,M���=���p�4���/!��L�
�sx;�?k�Gn��NMpqYߣ]�qr��\/���q<�F��=_y��.p���]��}��"k^���������y�-��Bl���Ej��?���i�y}xrf�:s�d�����lb:���$'����D���	~��ү=uѺ�T����j�����zQ�l��<}���Ǯ������@8��k�$��Tş��>�1��8�Q��a���R�b��~�?4G��Y�9,��_
�u<�
+endstream
+endobj
+1955 0 obj <<
+/Type /Page
+/Contents 1956 0 R
+/Resources 1954 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1978 0 R
+/Annots [ 1919 0 R 1920 0 R 1921 0 R 1922 0 R 1923 0 R 1924 0 R 1925 0 R 1926 0 R 1967 0 R 1927 0 R 1928 0 R 1929 0 R 1930 0 R 1970 0 R 1931 0 R 1932 0 R 1933 0 R 1934 0 R 1972 0 R 1935 0 R 1936 0 R 1937 0 R 1938 0 R 1974 0 R 1939 0 R 1940 0 R 1941 0 R 1976 0 R 1942 0 R 1943 0 R 1953 0 R ]
+>> endobj
+1919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 563.74 348.725 573.668]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_adf86eb3611cbe63b34ef195bc87a7312) >>
+>> endobj
+1920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 538.261 344.849 548.188]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a32423400858178cc05f325962afd44e2) >>
+>> endobj
+1921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 512.781 340.476 522.709]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8efd1f7de8fb2bbe6e33aff1d4184078) >>
+>> endobj
+1922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 487.302 342.677 497.229]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8ca7076566ebe098ff3bc307b4d91899) >>
+>> endobj
+1923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 461.822 333.273 471.75]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8f2ab3d77bca7257df14bda9261a1326) >>
+>> endobj
+1924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 436.343 428.475 446.27]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_af63454e50c1937573c75495f3cb4c1d2) >>
+>> endobj
+1925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 410.863 452.823 420.791]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a9dfe99ee7d8e2b1d7360ab0119bd12eb) >>
+>> endobj
+1926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.945 385.384 513.996 395.312]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79) >>
+>> endobj
+1967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 374.609 133.174 383.087]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79) >>
+>> endobj
+1927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 347.949 514.223 357.877]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ac379f873623c0fec37d988c2c374ffe5) >>
+>> endobj
+1928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 285.681 332.953 296.585]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ab95e9f75dd971827c8a9a6b42faeeac7) >>
+>> endobj
+1929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.171 285.681 420.086 296.585]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+1930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.954 285.681 513.996 296.585]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 273.726 149.224 284.63]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 248.246 235.002 259.15]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_af59141db49e5141da6ac594d43ead2f7) >>
+>> endobj
+1932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.22 248.246 322.134 259.15]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+1933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.002 248.246 435.359 259.15]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.743 248.246 513.996 259.15]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 236.291 169.159 247.195]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+1935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.937 236.291 311.663 247.195]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.625 199.853 321.906 210.757]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a70c652d969734f6a69841d30a5e9033b) >>
+>> endobj
+1937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.24 199.853 410.155 210.757]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+1938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.266 199.853 513.996 210.757]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 187.898 168.601 198.802]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.867 151.459 331.706 162.363]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8bda1b8ba9119202c16f88fdb19a535b) >>
+>> endobj
+1940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.283 151.459 421.197 162.363]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+1941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.266 151.459 513.996 162.363]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 139.878 168.601 150.408]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 114.025 243.041 124.929]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_aa1663bce444a20240c852c9443005cc0) >>
+>> endobj
+1943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.857 114.025 356.783 124.929]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1953 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1957 0 obj <<
+/D [1955 0 R /XYZ 89 770.89 null]
+>> endobj
+126 0 obj <<
+/D [1955 0 R /XYZ 90 721.073 null]
+>> endobj
+1958 0 obj <<
+/D [1955 0 R /XYZ 90 630.213 null]
+>> endobj
+1959 0 obj <<
+/D [1955 0 R /XYZ 90 577.736 null]
+>> endobj
+1960 0 obj <<
+/D [1955 0 R /XYZ 90 552.446 null]
+>> endobj
+1961 0 obj <<
+/D [1955 0 R /XYZ 90 526.966 null]
+>> endobj
+1962 0 obj <<
+/D [1955 0 R /XYZ 90 501.487 null]
+>> endobj
+1963 0 obj <<
+/D [1955 0 R /XYZ 90 476.007 null]
+>> endobj
+1964 0 obj <<
+/D [1955 0 R /XYZ 90 450.528 null]
+>> endobj
+1965 0 obj <<
+/D [1955 0 R /XYZ 90 425.048 null]
+>> endobj
+1966 0 obj <<
+/D [1955 0 R /XYZ 90 399.569 null]
+>> endobj
+1968 0 obj <<
+/D [1955 0 R /XYZ 90 362.134 null]
+>> endobj
+1969 0 obj <<
+/D [1955 0 R /XYZ 90 300.654 null]
+>> endobj
+1971 0 obj <<
+/D [1955 0 R /XYZ 90 263.408 null]
+>> endobj
+1973 0 obj <<
+/D [1955 0 R /XYZ 90 215.467 null]
+>> endobj
+1975 0 obj <<
+/D [1955 0 R /XYZ 90 167.074 null]
+>> endobj
+1977 0 obj <<
+/D [1955 0 R /XYZ 90 129.186 null]
+>> endobj
+1954 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F11 615 0 R /F85 267 0 R /F24 173 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2027 0 obj <<
+/Length 2359      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�F��W��*l��%9�x�'q"��`�X R�� �R�_�������SS< h����������w7����}`/B�O}�~�E�
x��O��a ����=懈D>
R��~����O�w���7��
{D�(�����'�%�����B�IuZz�2�.���_n�wE�" F� B� )jq;��0��6�R�rn��Uu 
�V��oߏߗ�d�.��*���$[�y���r�G,��IՄ�"��޴�k�e��z�tS5Y#˸~^��yn�P�9�(�*�#�Lv�8>����>K�
����

+/�Q>��F̏��7"
�����Y�V�xPz��u�1� YLw��+U�HS?�z����c13K���i]��^iLߦ�tQTY>wHBD�|FY��C�#�"�m
v�G��fp �0��r���b6��鐈�

7�Y���9R� D��ID�8�p�
+p�� #��Zg}�*�q<�	�s�
]�q.��8:�]~,t�i^�_6`[a��+
t� +�KeU�#��O��pDf�'6�GC8\y

���OK����
+ph��tT���f@\���gn8A>o@�T.�P���bћ?p �� ��
�;��!�-'�}���l�v�q^��C��⁌R�鱙������$�ۀQ���'Pׇb��;}��s�U�1r�>ď��]V�u��R�y�
�\
+
+���2&��
epe
3lY,c�e,VJ��b�^l�!�r���!��
b�@��;l�3��,eJa�O2�p��U�O�
�n��-/xO�
�r!(d(���L�-l"���8�! %* ����a�E�L1?}��l��lߔw�{�n��g	3D�<��lk5=�"�0w����W��I��WU��
+��]݅4X�o*�XϮB/��ĸl��]]R�b!E4h"Q6�
ˁ�i�\����]{�({���&�6�Mv�vl�S7 5
�H!�\��f�9�����9����UN��h�
vN�	�����@!�
�<��Ldzu>�
u7
Ņ�Nx�R9	;����4.�;#��?W%�X�>�
	rRi�Z�G�
�Q���a�4y1B��@d��|����f�6���!�ؤ1W
%�`���R�c�Q5JŬno�uus �
�0<��L��lqmRB_���g���� %�
=����P\"҉�b�X��2�+�G<^��n�L���:�M��	������n��t��[�>ܙ�Ƌ<���E��.��P�
����Bm,�*�Ĕ���e�V=��T����mL6+?��
��ϊr�&PZqy�H%w�>�t��֣*�U%]Uj7�g��ue�.��!-�
���~
�2�!����cꃇ�c�G:�Ʀx�M�Jˇxe�\ƿ�#2�U���}�U��tS@��d�dm ���D[�^8��4��V���)og�
M҉��k��yS;��%�;�� }K�R{��al,卉��Ǧ�*w}S$��y���C����B�
�,%�؅�s����Ez}۬Һ:�I�H�����2{��ŎA�	�����Z��F��[4��o�B����p���1�&��G�8�
][6p����\��'7Om��`���E��r���_�Z�x���}�YW�b���^\3� �EH�]���+���G�4�n��*�+
�����;�
#
��Ef��⨉C� 6���N3�3$�A��p���3�M��;
,�
���>L��lG�}�~A~��g��mƠ
62�?rQؽ�Q	
�x�x��`�s�O$�A�{�,l�	�d�H֫E6�~5�]� $��ՆM�LH|���r�*)�m^gW͋�X��v�[
�����W*"��h���+�S�����G�6�?��~YQ����I&&��4�0����y�<�C�>�7��Rb
W�2�
�%PI�TnE,J�ٰ$�wJܰ�{#_��Μ���y����۽���&~M��K��8������A�uU�Ys�
I�r�'"�x�y_�ե�:
��v��c6�O���R\�u�,
1�
+n��xLR�#!��*L^��=.���
Z�������5h�@f��D�l�!Jڷ��7�I� ;��\��XÕ�oY_�պ�.���z���+�fV��5�,�����>���������b� N—�������i��]>I�x�����b�||�wם�<@"Rl�q�&�z��ν�ӎ1
�o���W��Ӎ`�Q;����GQ ��:�|𺦏:��|����y�/��|����߷��r&5�PO�Ui��P�Ae��|myM�:
�˖�$�@�
%�Lz�Z��=��l�i��+{ix��C]�������P��Ѵpa;8�,4
��(���
�n)�o=���
+endstream
+endobj
+2026 0 obj <<
+/Type /Page
+/Contents 2027 0 R
+/Resources 2025 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1978 0 R
+/Annots [ 1944 0 R 1945 0 R 1946 0 R 1947 0 R 1948 0 R 1949 0 R 2031 0 R 1950 0 R 1951 0 R 1952 0 R 2033 0 R 1979 0 R 1980 0 R 1981 0 R 2035 0 R 1982 0 R 1983 0 R 1984 0 R 1985 0 R 1986 0 R 1987 0 R 1988 0 R 2038 0 R 1989 0 R 1990 0 R 1991 0 R 1992 0 R 1993 0 R 1994 0 R 1995 0 R 1996 0 R 1997 0 R 2043 0 R 1998 0 R 1999 0 R 2000 0 R 2045 0 R 2001 0 R 2002 0 R 2003 0 R 2004 0 R 2005 0 R 2006 0 R 2048 0 R 2007 0 R 2008 0 R 2009 0 R 2050 0 R 2010 0 R 2011 0 R 2012 0 R 2013 0 R 2024 0 R ]
+>> endobj
+1944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 707.957 287.275 718.861]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ad2154705f0854002a4f44f95580df9c7) >>
+>> endobj
+1945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.493 707.957 400.419 718.861]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.325 707.957 503.681 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 682.38 372.345 693.284]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a0d5a001977b49f77a4514de614bf3c4c) >>
+>> endobj
+1948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.563 682.38 485.49 693.284]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [505.395 682.38 513.996 693.284]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2031 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 670.425 195.719 681.329]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 644.849 323.648 655.753]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a4da79f8c645b945d52635733c3f63d7d) >>
+>> endobj
+1951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.866 644.849 436.793 655.753]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.698 644.849 513.996 655.753]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2033 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 632.893 149.224 643.797]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.958 596.358 311.967 607.262]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) >>
+>> endobj
+1980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.635 596.358 426.561 607.262]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.459 596.358 513.996 607.262]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 584.403 149.224 595.307]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.64 558.826 297.22 569.73]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a4b9b7034fd7b17eff672d49a7c85ac2f) >>
+>> endobj
+1983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.57 558.826 410.497 569.73]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.64 558.826 513.996 569.73]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [132.846 546.871 227.828 557.775]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+1986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.445 510.335 294.901 521.239]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a19ff64e7fd60a4e08c782a4683d62167) >>
+>> endobj
+1987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.056 510.335 409.982 521.239]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.977 510.335 513.996 521.239]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 498.38 179.112 509.284]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+1989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 461.845 296.739 472.749]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ab50ac757b6cb922c40504dc69c983568) >>
+>> endobj
+1990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [300.555 461.845 410.482 472.749]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 436.268 233.637 447.172]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ac39a1aacb6aa4f54150e2b138d7b36f2) >>
+>> endobj
+1992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.452 436.268 347.379 447.172]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+1993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 363.75 238.608 374.654]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a5357e1ed14407abf82149fe878789efd) >>
+>> endobj
+1994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.423 363.75 326.338 374.654]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+1995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 338.173 361.426 349.077]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a44aa5cc75376dddfb9005dd74b27ff68) >>
+>> endobj
+1996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.644 338.173 448.559 349.077]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+1997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.464 338.173 513.996 349.077]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 326.218 149.224 337.122]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+1998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 300.642 355.748 311.545]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a3659fef24b67be6b668955bc6865e779) >>
+>> endobj
+1999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.965 300.642 442.88 311.545]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [462.785 300.642 513.996 311.545]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 288.686 149.224 299.59]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 252.151 277.91 263.055]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a36c57e3007fcb2340dc415f8431df7aa) >>
+>> endobj
+2002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.726 252.151 365.64 263.055]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.621 252.151 481.604 263.055]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.745 226.574 281.425 237.478]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4) >>
+>> endobj
+2005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.88 226.574 368.794 237.478]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.126 226.574 513.996 237.478]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 214.993 134.838 225.523]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 189.042 309.013 199.946]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_af349e801a615b2014d36c30fdb56022a) >>
+>> endobj
+2008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.231 189.042 396.146 199.946]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.051 189.042 513.996 199.946]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 177.461 134.838 187.991]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2010 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 151.511 312.789 162.414]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a39e443628f6b73203b0f66189b8bc1c6) >>
+>> endobj
+2011 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.604 151.511 400.519 162.414]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 89.951 270.727 100.855]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_acdbb5fd3fa1ab9faed26fc5be47cc0d2) >>
+>> endobj
+2013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [274.542 89.951 384.469 100.855]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2024 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2028 0 obj <<
+/D [2026 0 R /XYZ 89 770.89 null]
+>> endobj
+2029 0 obj <<
+/D [2026 0 R /XYZ 90 721.073 null]
+>> endobj
+2030 0 obj <<
+/D [2026 0 R /XYZ 90 697.566 null]
+>> endobj
+2032 0 obj <<
+/D [2026 0 R /XYZ 90 660.034 null]
+>> endobj
+2034 0 obj <<
+/D [2026 0 R /XYZ 90 611.544 null]
+>> endobj
+2036 0 obj <<
+/D [2026 0 R /XYZ 90 574.012 null]
+>> endobj
+2037 0 obj <<
+/D [2026 0 R /XYZ 90 525.521 null]
+>> endobj
+2039 0 obj <<
+/D [2026 0 R /XYZ 90 477.483 null]
+>> endobj
+2040 0 obj <<
+/D [2026 0 R /XYZ 90 451.454 null]
+>> endobj
+2041 0 obj <<
+/D [2026 0 R /XYZ 90 378.747 null]
+>> endobj
+2042 0 obj <<
+/D [2026 0 R /XYZ 90 353.359 null]
+>> endobj
+2044 0 obj <<
+/D [2026 0 R /XYZ 90 315.827 null]
+>> endobj
+2046 0 obj <<
+/D [2026 0 R /XYZ 90 267.336 null]
+>> endobj
+2047 0 obj <<
+/D [2026 0 R /XYZ 90 241.76 null]
+>> endobj
+2049 0 obj <<
+/D [2026 0 R /XYZ 90 204.228 null]
+>> endobj
+2051 0 obj <<
+/D [2026 0 R /XYZ 90 166.696 null]
+>> endobj
+2052 0 obj <<
+/D [2026 0 R /XYZ 90 104.948 null]
+>> endobj
+2025 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2081 0 obj <<
+/Length 2445      
+/Filter /FlateDecode
+>>
+stream
+x��Z[sۺ~���[��ƕ ۧ��>�S���v�3M2Z�e��CR���wA $AѲlKi�/�E�b/��Ń� ~=zwst|&� Da@���� ��C$x�
>
%"r4&��j���?��\�#����"^N�h>S���i�w�46�W�]\
����/�
}��������#��1�	$�`�<��f���F,T��ՠ�S�����#lY�m���H��D��3����}6�4 S����f&�[�����Fh#p�-
FD
�.5=�3�Qr�i��G��#�LV@�x����\KK)
+8�	EXZi��ɸ0�(�I`Rs��G\��	��B֢��<��*J����ID���P�GL�r��Ij1���(
~KJ�T�Q�.�'[ǂ �D�J���ט��
;b����:*�Iv��xZ&浶��n�‹,ݰ
�{22��}���El��x�@)�B���q
�Y�������K�i�?cL�I������r�fq�+�	�|��>�u1n-�`k3�?�z�Nh�h����BL7��[ez
�� ����
z1��W�
	
�~%�pә��Q��ݤ�MR��kBO�
���0}|FyK7Lq$im:@
3��4�Q����1
����
QV��ȓt��T,���(�-,����4�F��#�_�)8~)����N�f�YEzC�QXY
3�_F�V�%�x�7 ���d���
�Œ�	�z��f�5�@x�q��j;�A[��A� ,^�k�Tk
��L"�ف�M��m���
��-x6�
-&.Rو8!*���������m
zb��7P3�U�nD
F���Ru
��K�8F��
aW�1���
<���fa����ﰸ��㲬�/YZ�$�2}9G��2�,��Zp�\/�QA����Rí̳�d�9t�dӏ��0�
r�Z��i��H� K�Ƭ@d�=4bw��	�N�4�=��ˠ�kI�����/�F��9R��n-�w�?��
�7}
F`1/�b�
��˃���IÖ����4؎�	����{[ʬ��m/���$I'��u��s<E���'6o��	!!���	����` 
l��@����`�6,��MA��ʷ>
+�l��=�X�f�vlZn~s5��\]=�X��9��WI<s_�y<�+qr��B ���X��o�n��ApJ
0�C�SpDC���e�F:&��'1��C�p�!
+��b�Ɵ��j]
X�p1<���O
ڒl��ad����춗�վt�B����[���i`��� ����,[�=t�4���
+
+)ۣ�k��l����
�zB�Y�����h���!0&\:
�ט'��e�u�9,eʤ��W���Nr���
+`;�dz�8���
�#`�w����*�!ʕ�Jx�DnKY,����J����:-�]�7���Ź_4�z�Lu�qo7��{t�>$Qo�7 at 8�ޗ;$�,L���b�$��z�:��b����a��
+v�|�_�;c�J�4�]��؅_)���6��V*㴌�<�"�4��1趏�z�D�گ
a[���� Zd��@������d�؁��NRx�;�
�˝�sg�
}5����nR
!*�����e�lV阆�d�z��m>9��(YT��*x*�y��8��k
#���p3Rx�}Ut�3����[��+*��M��0ᖪ�$�א������b �frWUy��I
ï��;+j;��$��va[w���.Fh����g(�R�!�Y�n���,Oⴂ3��mj�w/�
+g�)�6m6]/kX{��c�k\3k�S�z�6����Q��l�=�U��tU�F�t�(@횔d��uϤF��ǤR� ����U�1�
ɡ
�����#	1�
槰�HA��ukTl��|s')f�f�n�2�{T����p3Q��"
��a7
\P��M��Sn��e{�)�l
|H���øv�`[Z�Zk�c�q��f���ĺ}V��X��ն
��+��o�ؔ+	���G�
�R[X��(��u��ƴW�]���\߼��x=��������wn��d�"	R�9�E
%�j�ƨn�j��*��k�i�`X��(�Yb���AP��9N�i����\��)��>|�����p���QOXF�1Bh�T
A����ݼ��
t�&����43$�WiR����s�UbY�Dt,z"6Gͺ\]U���z�m�3��&׫g�h=��7����ٯL�1�fQ']�*e��b�g�:��0�-���i`p�����Z�tVZ�
�ذ�T�)��=���PuP�=�5��(� [...]
+endstream
+endobj
+2080 0 obj <<
+/Type /Page
+/Contents 2081 0 R
+/Resources 2079 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1978 0 R
+/Annots [ 2014 0 R 2015 0 R 2016 0 R 2017 0 R 2018 0 R 2083 0 R 2019 0 R 2020 0 R 2021 0 R 2022 0 R 2023 0 R 2053 0 R 2054 0 R 2055 0 R 2086 0 R 2056 0 R 2057 0 R 2058 0 R 2059 0 R 2060 0 R 2061 0 R 2062 0 R 2063 0 R 2064 0 R 2065 0 R 2066 0 R 2067 0 R 2068 0 R 2069 0 R 2070 0 R 2071 0 R 2072 0 R 2073 0 R 2074 0 R 2075 0 R 2076 0 R 2077 0 R 2078 0 R ]
+>> endobj
+2014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 707.957 240.132 718.861]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a43a14864f62b4528d6c87856cba4da34) >>
+>> endobj
+2015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.948 707.957 353.875 718.861]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.842 685.806 330.976 696.71]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a3ff750009bec94ab2c9a01139ba22420) >>
+>> endobj
+2017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.528 685.806 444.454 696.71]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 685.806 513.996 696.71]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 673.851 174.668 684.755]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.129 673.851 256.61 684.755]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.803 673.851 351.284 684.755]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 651.7 275.101 662.604]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ae5845918fa5037ca4e9bdde4a4a3ecf2) >>
+>> endobj
+2022 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.318 651.7 388.245 662.604]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.15 651.7 501.45 662.604]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.697 629.317 288.484 640.22]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a894587e76b98f15a8ae120327dc9d532) >>
+>> endobj
+2054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.891 629.317 402.818 640.22]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.13 629.317 513.996 640.22]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 617.361 134.838 628.265]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.837 594.978 277.739 605.882]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a2b4edec92d54747f5f1d2904407e744a) >>
+>> endobj
+2057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.286 594.978 393.212 605.882]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.089 594.978 489.57 605.882]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 583.022 196.576 593.926]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 528.484 309.441 539.388]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ae7dc964062c194e3ae8eef0a828164ae) >>
+>> endobj
+2061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.257 528.484 423.184 539.388]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 506.1 308.336 517.004]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a396b429302ce49ea9915778c317b81d2) >>
+>> endobj
+2063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.151 506.1 396.066 517.004]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 483.717 313.895 494.621]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_ad8caceee4f21496294aee9eb9aea4ec1) >>
+>> endobj
+2065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.71 483.717 427.637 494.621]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 461.333 328.121 472.237]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a97fad1530ac4a3704d08097aec4bf206) >>
+>> endobj
+2067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.937 461.333 441.864 472.237]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 408.554 250.802 419.458]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a7397b715c2ccf3f6fcf2f3900efe10d6) >>
+>> endobj
+2069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.618 408.554 364.544 419.458]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 386.17 254.12 397.074]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a3789c297e202c735dbd829cd6cbed989) >>
+>> endobj
+2071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.979 386.17 427.906 397.074]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 363.787 259.101 374.69]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a086e697a92a664c83721e0c442d45271) >>
+>> endobj
+2073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [312.44 363.787 422.367 374.69]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 341.403 265.188 352.307]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_a8190bd5fde521e37c585c5c59b65f90d) >>
+>> endobj
+2075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.004 341.403 378.93 352.307]
+/A << /S /GoTo /D (group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) >>
+>> endobj
+2076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 319.019 259.649 329.923]
+/A << /S /GoTo /D (interfaceppl__MIP__Problem__tag_aebfd121256089b1415f3bc6989c25bbb) >>
+>> endobj
+2077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.464 319.019 347.379 329.923]
+/A << /S /GoTo /D (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) >>
+>> endobj
+2078 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2082 0 obj <<
+/D [2080 0 R /XYZ 89 770.89 null]
+>> endobj
+2084 0 obj <<
+/D [2080 0 R /XYZ 90 666.088 null]
+>> endobj
+2085 0 obj <<
+/D [2080 0 R /XYZ 90 643.704 null]
+>> endobj
+2087 0 obj <<
+/D [2080 0 R /XYZ 90 542.683 null]
+>> endobj
+2088 0 obj <<
+/D [2080 0 R /XYZ 90 520.488 null]
+>> endobj
+2089 0 obj <<
+/D [2080 0 R /XYZ 90 498.104 null]
+>> endobj
+2090 0 obj <<
+/D [2080 0 R /XYZ 90 475.72 null]
+>> endobj
+2091 0 obj <<
+/D [2080 0 R /XYZ 90 422.753 null]
+>> endobj
+2092 0 obj <<
+/D [2080 0 R /XYZ 90 402.252 null]
+>> endobj
+2093 0 obj <<
+/D [2080 0 R /XYZ 90 378.174 null]
+>> endobj
+2094 0 obj <<
+/D [2080 0 R /XYZ 90 355.79 null]
+>> endobj
+2095 0 obj <<
+/D [2080 0 R /XYZ 90 333.406 null]
+>> endobj
+2096 0 obj <<
+/D [2080 0 R /XYZ 90 296.248 null]
+>> endobj
+2097 0 obj <<
+/D [2080 0 R /XYZ 90 222.548 null]
+>> endobj
+2098 0 obj <<
+/D [2080 0 R /XYZ 90 200.256 null]
+>> endobj
+2099 0 obj <<
+/D [2080 0 R /XYZ 90 200.256 null]
+>> endobj
+2100 0 obj <<
+/D [2080 0 R /XYZ 90 77.486 null]
+>> endobj
+2079 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F24 173 0 R /F101 531 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2118 0 obj <<
+/Length 2555      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo�F��_!�>T������ᒸp��n�C?$�@K��;�T)*����,����ʖ(9��"�3�;���3$�����C�_�����Ie�~�7���AB¯i��@�����LjD��A��W���������{s���G��7^ ���e��gܟ���1��_ˇ�}N
��_{�2#*�=T�i�c!�g�BD!��pD0ƃ$-�#��`�Z�E�@X�R ��)�(2�4��A�F�Kϖ�o�:CD���T�^O�]>$b�=
�`/��Sl�e��zJ`�	���CB_�	�bq� @�Ys�5��_���?�H��4k "Ѭd�x�g�g���',�5agqp>��vP�'Y�.� ��u��	��ƅ
&��
Ȗ�
�LVW#F4��G`�bW�q�Q��a�%��yH��X���*�g�0��$N��\%�͘tH�`�
	�
��dO��=������3�R���(m|�1� ���Hu4����j
	P�զ���7_��� k�����1v'>��6�.��c�����NZ�wyQ�\u�����l
��<� j
�'�Qͺ!o)�����#�$
' �T
s7�|��2.��F��/q��iؽ��^$����E�m���hH��/C҈�$�~�)�qEx>��DAx��s�N���*=	x:�k��� �������vK�I:?
�ߟ� ��:L�w

�7:������2
+lͳ\/†�,�Э-�|7�aϷ56��׉��lJ�>&��.1�k�X����~�4�rz
'��w0
'�v��9�
<��$�Ό
����.�x�H7˃ �3
���߆
��]_F�u2O��2�@D�.ȩ!��ɓ�=
�]�q���H$�*<7sH�BBG�W
���Qe
-�'��˖I���8}����p�DG|�<��+$)<��<���!�ˑ�Pj%0�ϣ��G�o��K��":��W�=��s^
�E]B?�(�<�٪H��"�u	�_D1瀢�ծ�v�
~�s2��;夂?�9!Arq:i*�<!�e���}>{$3T3$@(�������
%����*�Ah
�V�4�ƺp7T�p�
�7��1�a�]f`�%D�KP7��R�n���Sy��
L�'[�=�]S�9���֧��ѕ5W�z͞��;�
����u0�
�ɓ�
	ÉQ]ap�h��
~��
]As)�������0�:/]C��"��i���iκ"����Kj���U3�& N�	왴���aV/Z�TY��8��z$�T����^[���,ϖ;�=���.�צ?f˔E���0��P��@�
+�(�SGj��j?��r����O��3���JC�ߢ
Y�Q����3
u
}rO2$��+Y[�Ȋ��e��(wuD�!Yv�/�UBL�SO��x����� *zF.��b�8!�x��e���(�� �"j�O�
��":d�G���4�|��^���$~��u�G�����P���V���(���|�����BdZ��%0X�5
+����U��oI:Yl�^�@E�z9���5��?��E�Q�j�
�#O�мI��-�S�S(�G
(�1u�����M�*O,4�W��wYׁ%*����A^�Yus/�|��&4��N�֨� ��+�/�F�K
+�
��kl�>���x�,���~K�
W3ՠ�Gݗ]싓�U����#�e� -W��gXY=��+��4>�lp?db��qȀ��I X�-��,��8�|[B� }�S[P� �����3i({���}�oy�^5*:(��
+��(8��*+:ܖx�y0r˥��ĽI,a�4��8d���4hO�d�o�e�&J'���Y
$���e_i�Px���&
�O���� '�j���AV�jy1�5p-��#O�g�Qӓ̳1[�s��
Q��?}3[�~=�� �#�
�
u�� �o���W�-���u�t��6��/���a�4"�:v�,�U<I6^���~�
e�u����8vCB �
���cZw$��uȓ�{�t��bGҦ����-���4�!,PD�,��y)���
_�s�]ws�����Q�\�S"�b[��z�ʗ��ȶ��T/��n̓/q�و۰�:$@�)}΄��t��
c&Z���c��@c0��5��9 
{�Z
��+a��/
��*#ਓQ�Kfa���۽��&}
�l�!@�.-o���|ȀZ�6w-�K������9P�=�
�DvA<�;8ZO�d<�,W�"�T>8���n�����xd�bb|<���7įnL�����r���k�µ�)��1i}�B�����p���hZdѴ�.�#����4���q��}I
َWG�h���eH�Fjˀ�FӁ/#��L�P°c?|��PI�_����U�2���yy�
S]��]���
�mō@�h+�n�Jd�n��AW���ӻ����;����&�Wwo����^��w�UYy��(��Mh�m�9G��A X屶�B��Aև���n�m��S���l��*u��ǢX}}���x�h�
�� [...]
+endstream
+endobj
+2117 0 obj <<
+/Type /Page
+/Contents 2118 0 R
+/Resources 2116 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1978 0 R
+/Annots [ 2102 0 R 2103 0 R 2104 0 R 2126 0 R 2105 0 R 2106 0 R 2107 0 R 2108 0 R 2109 0 R 2110 0 R 2111 0 R 2112 0 R 2113 0 R 2114 0 R 2115 0 R ]
+>> endobj
+2102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.372 258.45 294.843 269.354]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a6455bb2686ced2d1a463955f6cbfa542) >>
+>> endobj
+2103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [299.109 258.45 433.932 269.354]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 258.45 513.996 269.354]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 246.495 218.487 257.399]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 178.044 275.699 188.948]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a384e3002cf83ca2e73c4290d8629e043) >>
+>> endobj
+2106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.514 178.044 414.337 188.948]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 155.233 279.016 166.137]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a4c12656e0256a4db3311855f9e94a36d) >>
+>> endobj
+2108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.876 155.233 477.699 166.137]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 132.422 283.997 143.325]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a8f1b879675bf41b40bab41ebe9a97346) >>
+>> endobj
+2110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.337 132.422 472.16 143.325]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 109.61 290.084 120.514]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_a6b1a2446aa655ae65ce51b8a025c5751) >>
+>> endobj
+2112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.9 109.61 428.723 120.514]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 86.799 284.545 97.703]
+/A << /S /GoTo /D (interfaceppl__PIP__Decision__Node__tag_ab8a5eaf323d5fb0076b2ce079f9f5fc4) >>
+>> endobj
+2114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.361 86.799 397.172 97.703]
+/A << /S /GoTo /D (group__Datatypes_ga25f9463d3385bd998e4fabcdce8dec5a) >>
+>> endobj
+2115 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2119 0 obj <<
+/D [2117 0 R /XYZ 89 770.89 null]
+>> endobj
+2120 0 obj <<
+/D [2117 0 R /XYZ 90 721.073 null]
+>> endobj
+2121 0 obj <<
+/D [2117 0 R /XYZ 90 658.004 null]
+>> endobj
+2101 0 obj <<
+/D [2117 0 R /XYZ 90 586.273 null]
+>> endobj
+2122 0 obj <<
+/D [2117 0 R /XYZ 90 581.789 null]
+>> endobj
+2123 0 obj <<
+/D [2117 0 R /XYZ 90 511.059 null]
+>> endobj
+462 0 obj <<
+/D [2117 0 R /XYZ 90 408.384 null]
+>> endobj
+130 0 obj <<
+/D [2117 0 R /XYZ 90 399.387 null]
+>> endobj
+2124 0 obj <<
+/D [2117 0 R /XYZ 90 301.631 null]
+>> endobj
+2125 0 obj <<
+/D [2117 0 R /XYZ 90 274.987 null]
+>> endobj
+2127 0 obj <<
+/D [2117 0 R /XYZ 90 192.349 null]
+>> endobj
+2128 0 obj <<
+/D [2117 0 R /XYZ 90 171.421 null]
+>> endobj
+2129 0 obj <<
+/D [2117 0 R /XYZ 90 146.916 null]
+>> endobj
+2130 0 obj <<
+/D [2117 0 R /XYZ 90 124.105 null]
+>> endobj
+2131 0 obj <<
+/D [2117 0 R /XYZ 90 101.294 null]
+>> endobj
+2116 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R /F60 176 0 R /F85 267 0 R /F11 615 0 R /F24 173 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2159 0 obj <<
+/Length 1718      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~ׯ��f" 	
i�3N,g���,�J2Z�eNy($e���]\)K���N�D���]`ؚY�z�y5��
z�
+P�R�_Y�<'@̅��z��	z}�1�����lx69+z���	O'U8��)��aV��*�r�:�W\���̷�,�}��
Ɲ�
�E�<�<ߚ��w�A�[
#;�[9(�
j�3��;�v�V
#�DS<�!��b!���m���8�(F}x+�E<��<��	{�nl���l'P�{>���y�
�H5��TL����B5 9Ո�4.�,���/��+����5��gHY3�j΋�GX�&���J=c�p==f�GY�V�Q)�pY
��bQ���Z����_Z����CYܷ=��Ն�ã|�HyV�UmQmhu
�
P���3��"��A��S37�&�29�4��cL�����ȱ}I��4xO)k�z�g�Y��k
F��uѵ�b��,�4`�
+��F�� L�u
x߃�
?1�bE>c���F��jO2>�P�8aǑs�̭Ww�T�B�`���bD�ٖZ��=�
�f�A �@v� �6r��V�
+A�L��ft�W�n�2�m	}B�Ļ�
��"�pq���S3x�g�da
��r$���hG�i�\
�-�
hY�xe>�F.��
��&�7Q��OmhN6^?�vR ������=f�$�L
����K�
+n�����+�#���$/5hm��Aij���.�̓x��|
�UaVm5D���,ٌl+�t��b��a$H��
�Mzt��hp<9�/�''����!t��k��ys
������un6��j%�>[dW<,c��=��
�N
�T�R-�7:O-��t�qp9=��

�
�i��ـv���cT^���G�з?�?
���	<'�/���� m�?
��sg`5��-�y�s ��tQU�6]Vr���!���4��<��,T�R^o��E�}Cn@�l���x2:����{
ߘ`�F�~
���
�
G�㝇�O�-N��8����t������`08|
$#���(�O������#&�����#������OHI|!��������}举T�*�������@n��_y�c��d�f_
����n
 ����[�
��b1��|��e<�Dc%�;�f��~ S���B�.�"�(�L�9���(M��J��_dX%4ʃ�4�bm��wW&�:w�������.�x�b���2��`�x	\D1��4�=���L%�-�ߧ��j'�I��1��o�0���6�[��
vS ��z̠�U����3���mW���5|L��>UF3�4�(*z���e�N�#7��k�F!`-#A��1��6�e���#D8�J�F�����]��'�:�hN
JsLUIFD��"�힇<�񊒚� hl<I�����6��CWc`L��Ń=�S���̱q�جeqa��c�oS�$�R���Х� �W_3���&wZ/�}]��o���D̾�O��X 

�|�]�üŁq��%��ԓ���"*�/�{���n#{YL�}�"ʅD�^D�:2���������!�+�p���@�8
+��"����Y�����sq�a�8�f����by�C��"p �뜛�M��eZ�td�w�6	��^|]U�{{��Yɳ���}&.�p���A��B��Rk�Ag*�p����&�u�A
������ãrD�-?�u��0���
cy/�#.
+endstream
+endobj
+2158 0 obj <<
+/Type /Page
+/Contents 2159 0 R
+/Resources 2157 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1978 0 R
+/Annots [ 2132 0 R 2133 0 R 2134 0 R 2135 0 R 2136 0 R 2137 0 R 2138 0 R 2139 0 R 2140 0 R 2172 0 R 2141 0 R 2142 0 R 2143 0 R 2174 0 R 2144 0 R 2145 0 R 2146 0 R 2176 0 R 2147 0 R 2148 0 R 2149 0 R 2178 0 R 2156 0 R ]
+>> endobj
+2132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 445.942 337.158 455.869]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab5075367b0d60e3b979b18b4b8b36f55) >>
+>> endobj
+2133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 420.794 329.955 430.722]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a83ff647a9f553f233355dcfe08f925ca) >>
+>> endobj
+2134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 395.647 486.029 405.575]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a1492c1ef5bc77d977d14267b2344ddf1) >>
+>> endobj
+2135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 370.5 499.867 380.427]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a73faac81cdd75868a90e0769e6e810ce) >>
+>> endobj
+2136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 345.352 483.827 355.28]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3) >>
+>> endobj
+2137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 320.205 499.319 330.132]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab98bad036b29cb094195b1d8e8212c71) >>
+>> endobj
+2138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 295.057 476.066 304.985]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aa91485e68401872e9369580d71074838) >>
+>> endobj
+2139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 269.91 497.665 279.838]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a7fde6bb756bf47a2801a8de40b1472d5) >>
+>> endobj
+2140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 244.763 513.996 254.69]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ad5da07355917717a2b3ea402a2a27cec) >>
+>> endobj
+2172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 233.888 156.417 242.466]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ad5da07355917717a2b3ea402a2a27cec) >>
+>> endobj
+2141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.496 171.452 330.623 182.356]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_add80dff3a130d086d15874ada6e8d8ae) >>
+>> endobj
+2142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.829 171.452 415.426 182.356]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.478 171.452 513.996 182.356]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 159.497 144.243 170.401]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 134.35 314.154 145.254]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) >>
+>> endobj
+2145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.372 134.35 397.969 145.254]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.067 134.35 513.996 145.254]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 122.395 134.838 133.299]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 86.288 322.712 97.192]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a00a4b6909bbb8ab2fbf602d8589707b9) >>
+>> endobj
+2148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.93 86.288 406.527 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.556 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.707 134.838 85.237]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2156 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2160 0 obj <<
+/D [2158 0 R /XYZ 89 770.89 null]
+>> endobj
+2161 0 obj <<
+/D [2158 0 R /XYZ 90 721.073 null]
+>> endobj
+463 0 obj <<
+/D [2158 0 R /XYZ 90 617.302 null]
+>> endobj
+134 0 obj <<
+/D [2158 0 R /XYZ 90 610.116 null]
+>> endobj
+2162 0 obj <<
+/D [2158 0 R /XYZ 90 511.834 null]
+>> endobj
+2163 0 obj <<
+/D [2158 0 R /XYZ 90 459.855 null]
+>> endobj
+2164 0 obj <<
+/D [2158 0 R /XYZ 90 434.896 null]
+>> endobj
+2165 0 obj <<
+/D [2158 0 R /XYZ 90 409.749 null]
+>> endobj
+2166 0 obj <<
+/D [2158 0 R /XYZ 90 384.602 null]
+>> endobj
+2167 0 obj <<
+/D [2158 0 R /XYZ 90 359.454 null]
+>> endobj
+2168 0 obj <<
+/D [2158 0 R /XYZ 90 334.307 null]
+>> endobj
+2169 0 obj <<
+/D [2158 0 R /XYZ 90 309.159 null]
+>> endobj
+2170 0 obj <<
+/D [2158 0 R /XYZ 90 284.012 null]
+>> endobj
+2171 0 obj <<
+/D [2158 0 R /XYZ 90 258.865 null]
+>> endobj
+2173 0 obj <<
+/D [2158 0 R /XYZ 90 186.342 null]
+>> endobj
+2175 0 obj <<
+/D [2158 0 R /XYZ 90 149.428 null]
+>> endobj
+2177 0 obj <<
+/D [2158 0 R /XYZ 90 101.82 null]
+>> endobj
+2157 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F85 267 0 R /F72 198 0 R /F11 615 0 R /F24 173 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2227 0 obj <<
+/Length 2672      
+/Filter /FlateDecode
+>>
+stream
+x��ZY��6~�_���j#
 
 �O�o9��gkl�!
+I��Lƿ~/Qǣ���)b 

������
��}�����K�g!
+�nֳϘ"?����;'��7?�܀#�Iվ���͏�o��߮~���xE�'<#�����vW�>�Y�?�0rC>�W�v3������^��
+Q�_%�g
D
<)�0�Pd� B� �UU�ɪ���؉�g�����������](ʹ�;�r+vr
�/C�;�o[�+ݦ/
G.'�M��
"J�m�T��("nh� ��v�_ݓY��"
+��~_��=�~�������I��T�S)7�x~W
\�:E��21��s��DoJ�Ѻ�w�*Ϫ��a�j8���
����j���`U�묊2��ow�=Ʈަ�ڡM��E�ߜX

�I�Y��YT?bl��Q��\��L��^4;�}�ja�*JkQ�u^V
3Q��hY�'��!;5��8�|A�
+'g��r5\�~
����詔 ;%�T���([%�;�,`���h�|�Ȉ0dr�F��ߧ��J��G)�,t�UU��wi��媈WBY�T:�纍6��"C�7
�zN3�2 j6�q/2;��/��eN|G���L�A_� �&�Fİ+�"{V�w�1�Jk5�}���F��
�!ܚk	
+{8ó`(d��f
��rih0�����mu�-4�+�Հ6�ۜ�����yeLs�%�J��|�ڗ�~�@�~k[�V�"����r�2��
t��5�H��0s�>�
�Tʳ�Θe�"J��r�sb
swm�ޝ7��2
7�vʴ������#Fs�^�l�a�.ަI\�l<�m�%�1�p�|� d�v�
��hظ��65���?���}�t��Wy��"tI�!�M]�;5��O�[]���DV����P���vފ�	:�e��L/`���3��r���V�����r�}���_�$]?
�8�9��!<������ݰ�O 'e�]�ިgv{�.�A����ӧ.=���e`m)�@<�m���&
7 (�� � ����ʴՏ1��z�7����
�����;��`4E{K��l��+�#���(piG;��]����ʥp�<��rr��l�[�2��om���<�0�E��:N>N$�#�

C�T`�A��
�s�T�R�}g;��.@�1fv����M����]��+�:��t��������Æ�>s�@�{�?˯�T�Y�+
+0_։¿
+S�q���0��GAK��1H7%V�;��Pe�
�
x;�I=0�X!y��]x�:�:��4
��ɀƷ{���Ѭ�ҍe���!�on+��\��d�r�o3U���[
+�Y?e��g���
�ց�Zf�
J�u�Qޣ��o���,
���q�"��c��wp���q�6�%�� ��B��Ǭ�X
H�Q��
aTS��E>��C
+�3���v˝N$��$���C�_�$�����
(�ArI!T[�&�mFXCd���w�U�o�h>�v
~p9�i
)�DR���]͉��t(�V�ti\G)x
�Q
0�_(�ҜƯ��L��cN�ؐA����̬�`v[�OJ��&�t
 �2�#6��ԑ�
�Ib�-��޽!)F�Y�%�^'֣딸*���@�%SQ��l%���Y�tQߎ�d��4�k�
��|r�J��������'�R��H���XFD1복ӎ�ݢ��t�a�cϨ,�@
��Iy
o������i�|�Xy洦��"$2y�~���rLQ����
��!��+hO�i:�{�$�5zhD: ���ڜ|��l�r4��Y�G^ m�ˋXz��z6�W �˾BhJ��¦�������]��25�/��a4�/	Qh
������U^���.�})�.S��.#&)s't��iS
P�Ki*G�x8@��K|��E_j&�2!K�܉T���I��o��U���k-g�i%�����QҺ�M�]�� в:�����«Lc����T�HRF����0�=���M�$3-DyG.��
+�%
�:_ځsD��^��W��`�3
��+�ޛ���fd��S���In���ؗp⢚vF1
�?�.�W����
�wa
]mE\~��>�zV���<��e��U�yNU��]o�t�Vy,�g0�w~
��#оH@��|^�����a��N�܊��"Ox�*�Y=:y�g���K�� ���E�r�
�?����p�B�L�{0T�kA'��l��Smb��+]�Q��fg2yC|�'��[
I\�T:
� x�/4����^k��<�2������/���+�>��>�����{��,
��e���P׻Rm���F�$��
+�J!It����m�d�k
�<@�w�gm��sm�+
���f
�Bx�nͨv
ƪA�f_��v�?�8�C�4�<!/__�G�����4�X&k���ugN��6]ŝHi�D�.b���ii�
�}\���BѮ�2G;k�����nK6�j�H��~z���9�j�
���S
�������
��b�7�G
ƁM>u� ]f�&>u�t�PQ�F��F�0FՏݲ���1ׯv��
k�[�x�v@�p
N>@�:ei0
+hh'Ukn����/��B~���>ޘ__ɗ�ki|z�A����;�e����Cy�w��l	 A�(��i�쭰����G�ğe�@���
�F�o����z�߀jn�*��mg�kB�]^6i2��
��ǁ\|
+endstream
+endobj
+2226 0 obj <<
+/Type /Page
+/Contents 2227 0 R
+/Resources 2225 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1978 0 R
+/Annots [ 2150 0 R 2151 0 R 2152 0 R 2153 0 R 2154 0 R 2155 0 R 2179 0 R 2180 0 R 2181 0 R 2182 0 R 2183 0 R 2184 0 R 2185 0 R 2186 0 R 2187 0 R 2188 0 R 2189 0 R 2233 0 R 2190 0 R 2191 0 R 2192 0 R 2235 0 R 2193 0 R 2194 0 R 2195 0 R 2196 0 R 2197 0 R 2198 0 R 2199 0 R 2200 0 R 2201 0 R 2202 0 R 2203 0 R 2204 0 R 2205 0 R 2206 0 R 2207 0 R 2208 0 R 2209 0 R 2210 0 R 2242 0 R 2211 0 R 2212 0 R 2213 0 R 2214 0 R 2244 0 R 2215 0 R 2216 0 R 2217 0 R 2246 0 R 2224 0 R ]
+>> endobj
+2150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.736 696.218 305.41 707.122]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a51082042eaafc2db84f50f28d3d5b646) >>
+>> endobj
+2151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.856 696.218 390.453 707.122]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [420.046 696.218 503.403 707.122]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 684.263 288.151 695.167]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+2154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.977 684.263 473.033 695.167]
+/A << /S /GoTo /D (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) >>
+>> endobj
+2155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 672.308 228.656 683.212]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 635.879 239.724 646.783]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a8e179abb162b61259eb3923f067944ad) >>
+>> endobj
+2180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.539 635.879 350.148 646.783]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.878 574.612 284.328 585.516]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a1ebc3efbeb7fcf8da5556b365a9a1839) >>
+>> endobj
+2182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.916 574.612 394.525 585.516]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.327 574.612 495.683 585.516]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.412 538.963 383.245 549.867]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a7387184a11ae23fd66b730a1ae720215) >>
+>> endobj
+2185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [388.367 538.963 494.976 549.867]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 527.008 208.451 537.911]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 501.537 332.644 512.441]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a4f7ccdbb25ecfb4dcd2facbed54f26b7) >>
+>> endobj
+2188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.862 501.537 442.471 512.441]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.607 501.537 513.996 512.441]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 489.582 149.224 500.486]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 453.153 336.53 464.057]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a41b5af390cf2af727c18a043bb869ffc) >>
+>> endobj
+2191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [339.748 453.153 446.357 464.057]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [463.492 453.153 513.996 464.057]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 441.198 149.224 452.102]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 415.727 307.2 426.631]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a76361c178cf8799f530f17e791e8d0b1) >>
+>> endobj
+2194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.418 415.727 417.027 426.631]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.163 415.727 517.519 426.631]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.082 378.302 294.344 389.206]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a68099fb9bb1067212c3e998b00255b24) >>
+>> endobj
+2197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.136 378.302 404.745 389.206]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.913 378.302 506.27 389.206]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 366.347 220.077 377.251]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 329.917 310.577 340.821]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a2f230174a1c6cf8b3d0115ab268d02e1) >>
+>> endobj
+2201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.393 329.917 421.002 340.821]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 304.447 324.804 315.351]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a66b9c383e8c77d79c0ffbd2f99987a94) >>
+>> endobj
+2203 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.62 304.447 435.229 315.351]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2204 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 278.977 230.319 289.881]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a65ace8cdf5e2fbf6e82c6834d3d29ada) >>
+>> endobj
+2205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.135 278.977 340.744 289.881]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 206.751 235.29 217.655]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aca972841d5888907f7dcf13b24134e27) >>
+>> endobj
+2207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.106 206.751 319.703 217.655]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 181.281 358.109 192.185]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a6b6bd9554098c88af56947f5a9e02818) >>
+>> endobj
+2209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [361.327 181.281 441.924 192.185]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [459.059 181.281 513.996 192.185]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 169.326 149.224 180.23]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.765 169.326 272.122 180.23]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 134.673 364.744 145.577]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a9f81c698a50d6b97d896dca8cda4042c) >>
+>> endobj
+2213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.962 134.673 448.559 145.577]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.694 134.673 513.996 145.577]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 122.718 149.224 133.622]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.478 86.288 337.394 97.192]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a2828646f7257660ec4a2a6a06427a715) >>
+>> endobj
+2216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.582 86.288 423.179 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.478 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 144.243 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2224 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2228 0 obj <<
+/D [2226 0 R /XYZ 89 770.89 null]
+>> endobj
+2229 0 obj <<
+/D [2226 0 R /XYZ 90 711.377 null]
+>> endobj
+2230 0 obj <<
+/D [2226 0 R /XYZ 90 651.038 null]
+>> endobj
+2231 0 obj <<
+/D [2226 0 R /XYZ 90 554.122 null]
+>> endobj
+2232 0 obj <<
+/D [2226 0 R /XYZ 90 516.696 null]
+>> endobj
+2234 0 obj <<
+/D [2226 0 R /XYZ 90 468.312 null]
+>> endobj
+2236 0 obj <<
+/D [2226 0 R /XYZ 90 430.886 null]
+>> endobj
+2237 0 obj <<
+/D [2226 0 R /XYZ 90 393.461 null]
+>> endobj
+2238 0 obj <<
+/D [2226 0 R /XYZ 90 345.077 null]
+>> endobj
+2239 0 obj <<
+/D [2226 0 R /XYZ 90 319.606 null]
+>> endobj
+2240 0 obj <<
+/D [2226 0 R /XYZ 90 294.136 null]
+>> endobj
+2241 0 obj <<
+/D [2226 0 R /XYZ 90 221.721 null]
+>> endobj
+2243 0 obj <<
+/D [2226 0 R /XYZ 90 149.832 null]
+>> endobj
+2245 0 obj <<
+/D [2226 0 R /XYZ 90 101.447 null]
+>> endobj
+2225 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F99 1219 0 R /F100 1218 0 R /F101 531 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2276 0 obj <<
+/Length 2348      
+/Filter /FlateDecode
+>>
+stream
+x��Zmo���_�o����(R���R�w�mR����Pd�jK:I�n��;|�
e9��Z�X`e)$g8�p���[y����_�/f�{!
+x�K/Ğ�C�x[x�'�pzE0Ɠ�X�oon���I��N6�:ZM�(Ǔ��N�e'��S�Lt�$ӟ0�l�����.~���킀|�#�#!�xs��+���'#J�n��|����.~��V��SOErO�T_M��Q�)A����%ue4�����B��|m����H7IV�yf^�y�l�r�sc
+5��u��
+�QAA=-�H
���R"&IӦ�GƁQ�lZ,F��0D�w�m�Xev
�{E��dH=�(���
����}����4��g�re]�I7��oa�-�8Ϫ����퐪����1w�
�xyX-����V��bЇ8�
�X�R��F�
�1���"��1M��Z&Q���[9eb�L}<Y� ��r4�>9Q�f`�M�Y�G����
}��r��
jB}�H#$~(�O! �3��1~ ��pL�卨�R_D%��8*zwH��@�9
+���qu,T���`��P�L�1��@��-h�1�0�8l;{
��G
4W�Xh���o�m�M#[X땠d����]���/ټ�v_ZM�!�"d\D�s����WQ�V
+J�Bͫ"�Y���WEg�L�SRo�L���E�(�*�ӧļ��
֧Ot�W�c��a
�2��i�Zɮ��2
��y�E�n����!��̓�̷��O�v�����x���[Z%jQ�
zG�� L�I��ۅ
++�i',
�d�(?� 
+��e?�*��"�y&S�'��ڼUuTo�>�
ah'�D���$
u���`0��,>�B_�t���B�-�d�K�HCή��3���akX��8ɱ!4�}�~�ڨ�NǾ����y^��W%c��Y�u��1��8��i�%�@
�M��X6QVN"Y����
#.^��Ԧ���U}�l(���؁����a�E��v�j�/�<��A�AT��5p:���
a2ͱ0���w�iCqZ�
�ې#�����_��}��u�o��4C��M�g�~v��
�f_����Dq��45��X�FϜ�WI� Y��z^4ڼwRn��Y�g �-����3�S��&.k�3�i{=V��w>����q�����"hWX�
C�]��	�=P��U�F�[;H^��)�3�B����� �
I���=o��rJ�=2*a`�nP��`�9�����Q�z��*����'�����q����[�ޑW#���ݺ���AҤ�`�͑U�ȷ��8�"*�� $���3� ���hw]�|��L�a($ �L�) [...]
���ʣ'F����e 
O������� q��Zv�W>$u��ux�ު�L��Z��3X1���O�����,[
+ޖ6�5f�!S�P�*�R[
�oxD����7�
��E�@璥.U48 ��~�)_,���~�|GZh�#*w#�؋��Xp��`c��
/#H�ލD���4�4��oά?%k�B��Y���v���YD�*�wy_h��k�DŁ�;-fʁ����/�l�����n�����%.�XS=�ak���'@�9d
+� 
�Ի��a*&
�s�S,���
�)D{�ґ_
+��b�����"�	�s��/ ����0؋s�+]%t at .z��lГ}c��[�~Q�rD �ưcJB��\���"!��`7�8ү�� ��]�&�:� H��3Ԥn#J[��4���9
6\�1`qa�����a��T`G]gXSho�vC�\�ꊉ��2��8j at gj�Y��+��G�- ���n�E�N�9�OE��X�guh��fR����.����!�����f�wSk+Su&m�9��A�=ؤ-V��Ã���*���>[��6���9��n��Vu`����
�8��������A � �
y}P�{pL�B��f�ƣA6���{{�����c����*��wtR�?���Ô���Q�m&��qg���LQ&R-&4�
�'wIsVn&�/����

�Nmō���屮�?�f�����K"]g���e��a��I�$���I5Q��9�m���
�'&B_u�����MG�av�aއ
�����/:��
+endstream
+endobj
+2275 0 obj <<
+/Type /Page
+/Contents 2276 0 R
+/Resources 2274 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2294 0 R
+/Annots [ 2218 0 R 2219 0 R 2220 0 R 2221 0 R 2222 0 R 2223 0 R 2249 0 R 2250 0 R 2251 0 R 2252 0 R 2253 0 R 2254 0 R 2255 0 R 2256 0 R 2257 0 R 2258 0 R 2283 0 R 2259 0 R 2260 0 R 2261 0 R 2262 0 R 2263 0 R 2264 0 R 2265 0 R 2266 0 R 2267 0 R 2268 0 R 2269 0 R 2270 0 R 2271 0 R 2272 0 R 2273 0 R ]
+>> endobj
+2218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 697.086 274.593 707.99]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3) >>
+>> endobj
+2219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.408 697.086 359.005 707.99]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.217 697.086 472.2 707.99]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.953 673.351 279.315 684.255]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a239ff7924a1294205e5057d1048986ac) >>
+>> endobj
+2222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.978 673.351 364.575 684.255]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.693 673.351 513.996 684.255]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 604.903 267.409 615.807]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab69f3fd82a3be2e835c16d812f6ef39f) >>
+>> endobj
+2250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.225 604.903 377.834 615.807]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 581.168 236.815 592.072]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_adeef8fc42bbbeee0f82d5da5ed6b9fb6) >>
+>> endobj
+2252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.63 581.168 347.24 592.072]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 558.342 247.445 569.246]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a0fa81de47c40e47efad3842142159fe5) >>
+>> endobj
+2254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.663 558.342 357.272 569.246]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.407 558.342 491.717 569.246]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.775 522.652 296.87 533.556]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a227bae7ca5019a2488065ba188acbc84) >>
+>> endobj
+2257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.355 522.652 407.964 533.556]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.681 522.652 513.996 533.556]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 510.697 161.398 521.601]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 454.203 306.124 465.107]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a182da2aa2af850a82ea4b4ab3773a759) >>
+>> endobj
+2260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.94 454.203 416.549 465.107]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 430.469 305.018 441.373]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_ab51c22e30fbf76be062c500f2187b0a9) >>
+>> endobj
+2262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.834 430.469 389.431 441.373]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 373.975 247.485 384.879]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) >>
+>> endobj
+2264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.3 373.975 357.909 384.879]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 350.241 250.802 361.145]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_a4c043227bbacc5af1e44439c140f95fc) >>
+>> endobj
+2266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.662 350.241 421.271 361.145]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 326.506 255.783 337.41]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aaa0eabf4e1c5b3bacdbadbc4fceeb6e7) >>
+>> endobj
+2268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [309.123 326.506 415.732 337.41]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 302.772 261.87 313.675]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_aee2f9e1a5347b0fd66ca5f9aec8009e1) >>
+>> endobj
+2270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.686 302.772 372.295 313.675]
+/A << /S /GoTo /D (group__Datatypes_gac9397590f57ede293eed34366aec11dd) >>
+>> endobj
+2271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 279.037 256.331 289.941]
+/A << /S /GoTo /D (interfaceppl__PIP__Problem__tag_abe40c32264f8b51a8c0d259d0777afc3) >>
+>> endobj
+2272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.147 279.037 340.744 289.941]
+/A << /S /GoTo /D (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) >>
+>> endobj
+2273 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2277 0 obj <<
+/D [2275 0 R /XYZ 89 770.89 null]
+>> endobj
+2278 0 obj <<
+/D [2275 0 R /XYZ 90 711.811 null]
+>> endobj
+2279 0 obj <<
+/D [2275 0 R /XYZ 90 688.077 null]
+>> endobj
+2280 0 obj <<
+/D [2275 0 R /XYZ 90 619.439 null]
+>> endobj
+2281 0 obj <<
+/D [2275 0 R /XYZ 90 573.067 null]
+>> endobj
+2282 0 obj <<
+/D [2275 0 R /XYZ 90 537.377 null]
+>> endobj
+2284 0 obj <<
+/D [2275 0 R /XYZ 90 468.74 null]
+>> endobj
+2285 0 obj <<
+/D [2275 0 R /XYZ 90 445.194 null]
+>> endobj
+2286 0 obj <<
+/D [2275 0 R /XYZ 90 388.512 null]
+>> endobj
+2287 0 obj <<
+/D [2275 0 R /XYZ 90 366.661 null]
+>> endobj
+2288 0 obj <<
+/D [2275 0 R /XYZ 90 341.231 null]
+>> endobj
+2289 0 obj <<
+/D [2275 0 R /XYZ 90 317.497 null]
+>> endobj
+2290 0 obj <<
+/D [2275 0 R /XYZ 90 293.762 null]
+>> endobj
+2291 0 obj <<
+/D [2275 0 R /XYZ 90 254.949 null]
+>> endobj
+2292 0 obj <<
+/D [2275 0 R /XYZ 90 180.945 null]
+>> endobj
+2247 0 obj <<
+/D [2275 0 R /XYZ 90 158.569 null]
+>> endobj
+2293 0 obj <<
+/D [2275 0 R /XYZ 90 158.569 null]
+>> endobj
+2248 0 obj <<
+/D [2275 0 R /XYZ 236.688 77.486 null]
+>> endobj
+2274 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2313 0 obj <<
+/Length 2663      
+/Filter /FlateDecode
+>>
+stream
+xڵZYo��~�� ��HȨ�w��A�=<�7s8c
dv �-�H-Iyf�}�/�MQZ��TU��_U}�4�V��y�������Q�Ie4��
)� !��2�4�t�y�[�d�H"a�i�����Ż���;����qF�
G��H������g
-���#���3hq�๎���}��R0�B��[X�
#bW�`9�":���$/��*5�n���"B 

#�����(J�]��2��V<X���ՈNEP��It*�bFB�Ք�Iy3U�u��WO�B1
�	�S�Q��էKP�
QKJX|�4F	U��z��f#ZE2>�V��T��e�Ɋ:/�z_5�ƳS�f�#)ih�b��
��NgF)R8g��li��w,��?L!�|, �[�,4"c@$�q��I��nR��ݬ|�jD�����
�ѩha�|�fc�c&=�#8aqJ"�$�	�D��(c�[I�/�aJ�$5�Y�m�2D����bB!I�)6�$Fv�M�tS۵��a0���T��3��.�(mO�S���&[~6�����
`@�1��
�Ipl���\�#�����
�xH�z:���f����@�(C �8E6�b��/��6�u�Oɤ��I��y1���{3��`Z��q���c�`�w�>��`ďɋ��^��g,&fp�;��mSV0C`�)�?L��S�a�@
���N�Y\M)�h�fMpK���@��wH$�*N�q� Q� N78EIJ�:* G����*���tt �1*�8/��g�
q,�ɖ�ʹ���h��F�)��ƍ2@^��/�Ś
�t�?��*ؠ ��o0<S�-�
�L6x�B
����!
%�0
��{a%@��jJ�>���
F_�P�I��3��{yg�.���
�1�5b�3].]�}ڸ���*�U�
+B����������A�Vy
+M��#�d�Xp�2�ʡ�t��� T�ԃ@X6V;����i���S�ĩ�������dcaX!�ڡ 1/V�{��v�!�����
Me+���Agz2(г)���Ͷ�$\�"w��D��HJ
�X�%g�Q�z��Q�
+��H
��;�~����G�kߡ�o��s(�`
�R�_�C�2=n����)
"�u'Ѯ��
"�!�{���l?��
+q��S͂Z�H��2�*
+�/�
���#` ��s?�A��<��C�+�@e��8O��<-������3S����
Do����׶�&�-�}Y���s�]�#_dۚ�L��W��k;B3�`JoA܅}�v'��tƙ0�A�7;HCq$��E���z��
󮸅�4U���q�c��BwF,�3��;#�_an?��� {�ciQ2f߹4b��D���A�@�#n�8T\'Яo�X�B�u�~Ȭ�]-�
+]�kds䏺a Ds�WP�v�Hu�ǪV����&)�ê�6�]% �{�|	�,�
/�B	kw�(��]Ut�&�y�{�6��)� !�U��	�F��k��5F
+���a��Wo��~x�󛋷���O�׋��^_�t}	Mc{N��s�e��޴��"�$�mcQ6��N�
�#�:i�8}��[,�K��j�T��6�_�/�^���ױ]0xW�]
�˦����s-�M�I��X�����os�L�
	~:��xP.��
�@B�Y��/����� ��;]�XM_�/׿ʊ�J���r3��]�^�&%��Ԇ_g?�Ѿ�Yl�bo��)�O3�outhX�g�H	
'�?���P�a��qs����.%�g�����Eq^����sndIE��!���4Z%pox
�^;��eXdLN��bP)�P��r9v�Oc��4jE\%��&������Ҁ�����
�eUV��
��<�V�r��G��4Ɠo۬uL�
+ at XG�������V_�.
{
D"͊����_��v�[:2
!�Ǒd����}�n�L����:�@^
�� ���S�����1p1H�1�Yb���uk�#�ơ�5[xW6�,iӆ��j�Ex<�d���)�yaG�F۬![�
v?������^

��*k�0��ۅ�Wֻ�
��"<5U2�D��fL�.� h����8���-�'aV�N�Wҫ��
O�(2��]���i���
+�mm� ACF��)�f#y�/mǬ����#�a�.�5}�1�:�~�����1U0'(�-�d�i�0㝺���
��!�f
`_��I���4����W8�-ӕ�\V��vs�Gx7��B�ש�l�<��G�uޮ/'G��_Y�����2��(�c�!$��H`�P$"�*~�>��A��0:�1���oy�
��e��5��w
<l4xT�����y!�D��\l+��cu� ��}}�#�v%�n����ˮ���-�����27un��
AIN��ϺY��f

Qu 
�
�s�2#����IN��G����.A
#��n�
�Hg�*K7����0]��?
a���2_�X���!2L��y!d�%�cF�3i�D�����; M�H�
��1o=�l�|��}����{�7�+$�oc ��D����޻��s\���E�� �7y�N��K��
XlM���
�1���Wo��/��&-V�t�z/���uV�U���M��/����+��n�>A8O��pu�yT�=�����=Jo�	R����i�?����VuV��m��Gz7Y)�e[ڊdSz��иI�;��A����$
+endstream
+endobj
+2312 0 obj <<
+/Type /Page
+/Contents 2313 0 R
+/Resources 2311 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2294 0 R
+/Annots [ 2296 0 R 2297 0 R 2298 0 R 2319 0 R 2299 0 R 2300 0 R 2301 0 R 2302 0 R 2303 0 R 2304 0 R 2305 0 R 2310 0 R ]
+>> endobj
+2296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [127.599 215.326 321.938 226.23]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_ad6ece2828d918bbd4cded63665b88e96) >>
+>> endobj
+2297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.431 215.326 459.611 226.23]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 215.326 513.996 226.23]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 203.371 184.535 214.275]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.089 203.371 330.815 214.275]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 126.66 274.055 137.564]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_a9526c7cca61983debf9ced54bf89aa7f) >>
+>> endobj
+2301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.87 126.66 411.05 137.564]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 100.497 277.372 111.401]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_ad4796bea8c483cdbd25979da0c81007a) >>
+>> endobj
+2303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.232 100.497 474.412 111.401]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 74.333 282.354 85.237]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_a1eef951ad8a431e18a3e9d6a9e56594d) >>
+>> endobj
+2305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.693 74.333 468.872 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2310 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2314 0 obj <<
+/D [2312 0 R /XYZ 89 770.89 null]
+>> endobj
+2315 0 obj <<
+/D [2312 0 R /XYZ 90 721.073 null]
+>> endobj
+2316 0 obj <<
+/D [2312 0 R /XYZ 90 646.048 null]
+>> endobj
+2295 0 obj <<
+/D [2312 0 R /XYZ 184.963 532.79 null]
+>> endobj
+2317 0 obj <<
+/D [2312 0 R /XYZ 90 526.15 null]
+>> endobj
+464 0 obj <<
+/D [2312 0 R /XYZ 90 368.058 null]
+>> endobj
+138 0 obj <<
+/D [2312 0 R /XYZ 90 361.132 null]
+>> endobj
+2318 0 obj <<
+/D [2312 0 R /XYZ 90 261.859 null]
+>> endobj
+2320 0 obj <<
+/D [2312 0 R /XYZ 90 141.869 null]
+>> endobj
+2321 0 obj <<
+/D [2312 0 R /XYZ 90 117.589 null]
+>> endobj
+2322 0 obj <<
+/D [2312 0 R /XYZ 90 89.731 null]
+>> endobj
+2311 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R /F60 176 0 R /F85 267 0 R /F11 615 0 R /F24 173 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2336 0 obj <<
+/Length 2416      
+/Filter /FlateDecode
+>>
+stream
+x��ZYo9~��h`F"�w����M<�'�q<�I t���X��t��̿���[�|Ļ��EV�V}UN���t����ӳ'iIer�J4NR����L>NRD�tF0Ɠ�n=�~~5M���5�����2�7��tF���M^��E�
/�U����Ӊd��W?���:�zB`8!��@�J����q���?'1��;;h�p��N>��v�� �H�D�@��Lj�mJ"�	��*ʦ6�8=�l0�rD��a�܈�\�$��f����e�������fM�to��]O	��
+Fﶅі{h)���)��X��ZMY:ɛ}U�To�,�~*֬]��Ed��Nd�����L�a�0E�'3P����D�&%g���I�ko�K;�J�
��v�o�m�'�E1_�7�1Q3��^���b[�M�n#��������
�y�(դ��'��h�#��@�y��e��_��@�3F"��F�\9o at xo��W����w�R�e�!ݷ�*�
L`��q'&�!�bJ!�(��~�3͑J������l�<oz!?2��p#�L7��!�B/� �_ҋ8	O�E�j��d���R(M��|I�|	Qat`.V
C5�L�J¶�תKY�I�M�d��FM��^T��J~�S1P�q�^M����;���ڗ
Cʿ_m}0��;�{*��j+�a`�
.�����<�K��O,�֤��b���`���d�.CCޡbrg�U˺3J�
�R���
�GıS�RL�bG&AJ��v;Rodz��K��`�ץ��e���
μ�������s�`OK�q��DŽ�e��C�BQU"(����
+Z�
~q8e�"@:���ҝ�#LS��/�4�

2m�{ș��T�gJ0J�H�֟F\as��E�L؋��v��Ds0�x��`0�eU��
."�!�c����b�5!"[�m� �n3�
`�V S��� ܂����e�7��CA����
+���T+#A!L��6c���������e�qD*��!�픚�9����G�,�+�(󬚿��sR�8F�a)� &�E����k��p�2�d
Ҁ��p�
���������"��."�'�WEc|���$�CN�����D��`C�Y��ۮ�bX�
+�23��~�w�}΍ǃ����; >nr;�֤C�-����Ⱦ�+
��
	݂;
JiE��Y�W�gq�Tv	5 o�U
+2r�b7��1dI��,H��̿���uGw?V��uq��Q�+
�(��Y�X�= -�x�j[AMlB`��Ə���)`;�E���?;���W5:����@�*]��4i���IKnJȤ���8���qÃ�\��xH��<^n6`,
�����x��!8$�=�Qn9�->�m�FR"
9cȶs�C���
�J��U�ր�
p�3m�=��-M��4%�
p()�vɢv|˸�,;;!�k��c_�9>,e_���~?u���`6�������L�HA�]&�� �p
Dʆq:f�g���xȲ3q�4cy��vH��:�x�̧٨�q���
��L�ǧ�'ώ'��*@i(x�� ,����꿾��$G86��$�_СK��/�o//�y9?����o�/��׷��fJ{�ּ��*�  \9)�!W���z��gE��nvP�H���&��0PR
B��ۻ�MQǖ$m�l���X
*-m�C��[!����}�
xY����P�x�Bth��
J
�e�	7���v�k���y�W�9Ǫ�nZyKt�v
&s��
���ǰ�
+ێ��ၶ����7y������^r6��y��;;يA��`��3��v��Ŧ�`�Ɯ[Z�c�
!���e�Jly��j*�Ā�C�
+�S��a
U=S"d}O{k$ɋp� $��!�&����c����I�>\����ǓGO.�#l;��y]a�]L1��C|�J�Q�5���n�o�DB#��!�Z)
:�F���n"��\ԅ˿=��K�@�1ېײ�2�&m����) �m��e}�5]���w�i���/m%ٙ

�<%�
=�"zxB��
k������:�j&=�3$���զ�2^��������f6{(ĥ�X����K�~���]��ϽR+���1Y�i6&��'����<#P�I+�̟�w���c��,%�����c���{����m���
+������'��A
���Hj�r�e�(�?����
�����7�WJ�c�
Ӗ] >�9��DB�{#����?��"+���u>��N �~����������l����1B^�A*8e$DS�x�!os��?I{�ˉ�N���d�x�4�OO��뼼F
w�
:w?9�
+P���m��l��P��rc1oW�u�ԧR�Vk�����0ISjG
���v�qz�aɛ-����
����
+endstream
+endobj
+2335 0 obj <<
+/Type /Page
+/Contents 2336 0 R
+/Resources 2334 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2294 0 R
+/Annots [ 2306 0 R 2307 0 R 2308 0 R 2309 0 R 2324 0 R 2325 0 R 2326 0 R 2346 0 R 2327 0 R 2328 0 R 2329 0 R 2348 0 R 2333 0 R ]
+>> endobj
+2306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 696.002 288.441 706.906]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_af60a51929fc4969d04191e4f524f6031) >>
+>> endobj
+2307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.256 696.002 425.436 706.906]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 670.099 282.901 681.003]
+/A << /S /GoTo /D (interfaceppl__PIP__Solution__Node__tag_a6c514d39c645b2b47002b597d998f527) >>
+>> endobj
+2309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.717 670.099 393.884 681.003]
+/A << /S /GoTo /D (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f) >>
+>> endobj
+2324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 125.617 260.24 136.521]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a9fa4831093fbb97122699c344264e792) >>
+>> endobj
+2325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.458 125.617 380.767 136.521]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.693 125.617 513.996 136.521]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 113.662 150.214 124.566]
+/A << /S /GoTo /D (group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) >>
+>> endobj
+2327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 86.288 261.336 97.192]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a242792f5af528730b645b3831b4c6dab) >>
+>> endobj
+2328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.554 86.288 381.863 97.192]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.789 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 150.214 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga43246761a1030d751e756845a246bf68) >>
+>> endobj
+2333 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2337 0 obj <<
+/D [2335 0 R /XYZ 89 770.89 null]
+>> endobj
+2338 0 obj <<
+/D [2335 0 R /XYZ 90 711.269 null]
+>> endobj
+2339 0 obj <<
+/D [2335 0 R /XYZ 90 685.366 null]
+>> endobj
+2340 0 obj <<
+/D [2335 0 R /XYZ 90 643.897 null]
+>> endobj
+2341 0 obj <<
+/D [2335 0 R /XYZ 90 569.405 null]
+>> endobj
+2323 0 obj <<
+/D [2335 0 R /XYZ 90 547.029 null]
+>> endobj
+2342 0 obj <<
+/D [2335 0 R /XYZ 90 547.029 null]
+>> endobj
+2343 0 obj <<
+/D [2335 0 R /XYZ 90 446.903 null]
+>> endobj
+465 0 obj <<
+/D [2335 0 R /XYZ 90 276.472 null]
+>> endobj
+142 0 obj <<
+/D [2335 0 R /XYZ 90 269.063 null]
+>> endobj
+2344 0 obj <<
+/D [2335 0 R /XYZ 90 170.845 null]
+>> endobj
+2345 0 obj <<
+/D [2335 0 R /XYZ 90 142.666 null]
+>> endobj
+2347 0 obj <<
+/D [2335 0 R /XYZ 90 103.287 null]
+>> endobj
+2334 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2376 0 obj <<
+/Length 2341      
+/Filter /FlateDecode
+>>
+stream
+x��ZYs�F~ׯ@�%d�9�3 �OY�J)��ZK�<�)DI$�a �����s�(�6�͖�`0�c��cz��������y{v~`/B��»]y�?B\���{?���۟=&BD"�ы�on_���Q��^ݞ}<#�
+{�|�Qz������[���
F,
+�=)�|���n��}��(ë-�^�	_�Fh�p�� B�
��I-��r<�s%��e�:�0�"rb/���ץ�ff�:�H4��i�.�"��<3OY����j�Y@���Q
�,�
+�{Y<ya�dKs��%Iˇ��9|��9��_��ag��9�f�����Jy�+���c�/��2j���}�'�O�b;�����N����7 �|-��"Ϫ���B5��>��9�KZ��F��c��"��/.ŴC��o��
" 2PE�b~~�e:`x~	�m����I������so�}���)(OzD[�=|�G, �|0�P:�F`GB�Zy�o�E�5����bke�E\*tũ�ei��������fm�st�6v���`"eҏ委� ���`���
a�8�Өg>F;�B���ː��{B�۵<<�"��
x��zWf�N��q.E^%ur/��.�>��U��fV�cQ�`����8�q�
s@�An��n���\��&�I�L
ӏ�bmD�͵���S�pT�ڎ$i����j��çVK)u�I
8���xX� �:bp�Ȉg ꖩ��M�-d��
�2���
e�<m�����
A��	�գ�0GܕS�Or�<C���_+��Y�5ui�nJ�d�
�N���bW��e��\��o�&|�\���;Y���<.�D�v��ۿY�X& (��'
n�E���O%
+�#A�cEzp� �a�E�HG������1W?3H�o�[�
�׮{SI%?�d��{h
�CB�l�:�D
�P<k�t�����
�?vL8�ֶ+���7�p��(#����ܗ��C� ':��`�����ء؃v���N���ˢ 37'6Դ��Vi�U�up
��";CP��am��psg�i�e&�v���3p�
u�CI�
h(��9����AJ;�e�����
C0��<��HH����¿��0��}JeJ>�+��A�W5�+�}E����e�gj
�eH=�<D�po�
��
<DMj=D=)�Q�	D�8o0�!����=
*��~���v�[f��	�� 
+[h]eŮ>���b|�r�-TQ[=�u�AU
���|q��N�ϋf>v�o�����C2d}�t��au N!�P�מҧ�� lH��^�1/a���X	�ED�
����H�]^�~e�蕮Du�;�v��7����|
4����s�Lx�צk�=�z57���� ����:_	�1��WGBf��P<����u�:
S�A#0ϊ�ص
��|1���Z��(���N���}T�t�$G�a�,T
+��
��|��
G�>�G�lᨷ�#:@���͑nY0���`��E�̗������`OHdDu���!�`0�<(�e����k�ڀ�פk��\�N����G
+0/��s nȳ1"��O�"՚�'
l������a�4(�%�>#�A�߅�k���"�?8B+ӷL�H��;_$D�Zuы�����0P!
+80�a���P��^�:N�:`���E�Z�'`�����o7
��O>���WM���ˮe&K����[�m���*Nj�9���;�#�
��R�*��'�8�AB盕�D���Aށ]ԃ
+��R����x�Tm1XG�P�z�K1ߞ](��@�e�إ}p�zn�j�F��c�6���<
�u�
�ֺi��]�V��wu{6j8�(z:\�<4��x		
m�!ش�-L
� �����>>�'
>�-:	a;
+���9<���N�͉{O �cH�0R��6"_O��Ҥ���@u�i�[;��SB&��@&�b(�Qt1(�P���b�'Ԇ�a�Cz���[��\�N��U}9`KIɉt�Bb���{
�e�#!N��S>Xs�
a
�$��iX� 1F���xL�&Q\�c�
<��+x'K݄z�T-0�u��_�>�4q)��,���i�?��;���Mֻ�F�AY��
x�j��ټ�׃0wHN���`�#接�6�2
��$_U���k��6�� T�!T����T�'Y�2�'j�^��uV�A���d�)���*K�$�&��$�ƸPi��=��_R	�=g����� 
�`}�`��%�u��K��
8�J��2b-�Л��ÀM�HM:J��F�i?g__�67��:�ֻx-�*=�տV��^eH�����
*s߫��lVʹ�����=����6*���I��ÖC�ǡ��.~8?�ۭ�^��)X�`l?wƢ-q���yٜf��8h����
��
+endstream
+endobj
+2375 0 obj <<
+/Type /Page
+/Contents 2376 0 R
+/Resources 2374 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2294 0 R
+/Annots [ 2330 0 R 2331 0 R 2332 0 R 2379 0 R 2349 0 R 2350 0 R 2351 0 R 2352 0 R 2353 0 R 2382 0 R 2354 0 R 2355 0 R 2356 0 R 2384 0 R 2357 0 R 2358 0 R 2359 0 R 2386 0 R 2360 0 R 2361 0 R 2362 0 R 2363 0 R 2364 0 R 2365 0 R 2366 0 R 2367 0 R 2368 0 R 2369 0 R 2370 0 R 2373 0 R ]
+>> endobj
+2330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 695.23 275.174 706.133]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a97dd1858b35adebeeb6f0d2edeecb693) >>
+>> endobj
+2331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.392 695.23 395.701 706.133]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.752 695.23 513.996 706.133]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.274 157.975 694.178]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 655.827 229.835 666.731]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a0095864fde9ce398bbcdc67fd7d7f795) >>
+>> endobj
+2350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.65 655.827 350.96 666.731]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 617.42 300.628 628.324]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a53680b4913fbc0c8bbf3a3f4097f672d) >>
+>> endobj
+2352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.846 617.42 421.155 628.324]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.206 617.42 513.996 628.324]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 605.465 138.04 616.369]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 578.018 236.839 588.921]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a8fd26a28b5329cecc22ad0a6958a9ea8) >>
+>> endobj
+2355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.056 578.018 357.366 588.921]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.416 578.018 513.996 588.921]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+2384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 566.062 183.419 576.966]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+2357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.324 527.656 229.237 538.56]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a4a89db919ecd790e62027d3559d8d539) >>
+>> endobj
+2358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.455 527.656 349.764 538.56]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.815 527.656 513.996 538.56]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+2386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 515.701 183.419 526.605]
+/A << /S /GoTo /D (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) >>
+>> endobj
+2360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 442.308 258.185 453.212]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_ad9ec458d7b2f78d11393475db3e4cfe3) >>
+>> endobj
+2361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262 442.308 379.309 453.212]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 417.301 261.502 428.205]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a331092da872154b17ae2e8d675b88145) >>
+>> endobj
+2363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.362 417.301 442.671 428.205]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 392.293 266.483 403.197]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a83a66e20c2502b8a2cf7f8a4b9925769) >>
+>> endobj
+2365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.823 392.293 437.132 403.197]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 367.286 272.57 378.19]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a74f00bca9deb1df435f5f32e16be9849) >>
+>> endobj
+2367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.386 367.286 393.695 378.19]
+/A << /S /GoTo /D (group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) >>
+>> endobj
+2368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 342.279 267.031 353.183]
+/A << /S /GoTo /D (interfaceppl__PIP__Tree__Node__tag_a5c88187145d242b27660f9247fe83ded) >>
+>> endobj
+2369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.847 342.279 362.144 353.183]
+/A << /S /GoTo /D (group__Datatypes_gaf4f8f4bacd6f148fbbfb9209fb5b2b33) >>
+>> endobj
+2370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.557 155.374 500.327 166.278]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+2373 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2377 0 obj <<
+/D [2375 0 R /XYZ 89 770.89 null]
+>> endobj
+2378 0 obj <<
+/D [2375 0 R /XYZ 90 712.265 null]
+>> endobj
+2380 0 obj <<
+/D [2375 0 R /XYZ 90 672.863 null]
+>> endobj
+2381 0 obj <<
+/D [2375 0 R /XYZ 90 634.456 null]
+>> endobj
+2383 0 obj <<
+/D [2375 0 R /XYZ 90 595.053 null]
+>> endobj
+2385 0 obj <<
+/D [2375 0 R /XYZ 90 545.145 null]
+>> endobj
+2387 0 obj <<
+/D [2375 0 R /XYZ 90 457.163 null]
+>> endobj
+2388 0 obj <<
+/D [2375 0 R /XYZ 90 434.039 null]
+>> endobj
+2389 0 obj <<
+/D [2375 0 R /XYZ 90 407.337 null]
+>> endobj
+2390 0 obj <<
+/D [2375 0 R /XYZ 90 382.329 null]
+>> endobj
+2391 0 obj <<
+/D [2375 0 R /XYZ 90 357.322 null]
+>> endobj
+2392 0 obj <<
+/D [2375 0 R /XYZ 90 316.95 null]
+>> endobj
+466 0 obj <<
+/D [2375 0 R /XYZ 90 207.631 null]
+>> endobj
+146 0 obj <<
+/D [2375 0 R /XYZ 90 200.337 null]
+>> endobj
+2393 0 obj <<
+/D [2375 0 R /XYZ 90 119.71 null]
+>> endobj
+2374 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F84 265 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2419 0 obj <<
+/Length 2386      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s�6~�����L�J٧�iv��l6��>�/-Q2[�TH*���
�H���V��
�X$�\�+��U���_|}q�:��B*�qt�������n��$���`�'�Mq�vJ��˶�Zw3%xr��z��
�w٢�9�ʛyU6�M�fu�V�M���3*��M	C�t���w�23K�R	��$��?^�p}�� �8"�A����?�h�?F1%�{3i
q�෈~���v��]��]�	IP
+B!V��(������L�@t7���W��wfQVKe6�br��Te:-9
�igHQo�� I{(�%3�D�XF3�R	a��;����ה��)���X
a���29R��9���I�i�����c���b�$�
ET(���m^,
����n	�ho�cط�Z�H��[R.��}
O�}��a��V~
7��. �,�dMc%Ul�c�J ���vR �a��A���ф"!�	aD��	ěe]��
+�}:s:OG�I�(V_���uH15X&NՠsF����A4- �㩖B8a?k(�j�h���z�� o^�#��N��՟kJ�J+�yS�'Z��=ߒX,O�C��G���!M`��9���<�ge���~��h���wA�
�wM��ʦ��>l�D2�@ӌ�����{{�
v䛍?/W߄�n�
��d9�'[¤���9M�qk3��Nj��}[���a^#�k�0JĉQ��
1��`
��O�G�c@��ΟgW����+���b����@���pN�
��>
��D�s��^8�i�X,�"k����z��N����R��Oi�/�.5������������A�%��\{��������Ě��-��U�r�MU.:_��*�h�7�ϋ��Z§�l�iQ<v>gq��M�@�3�b$�>g�:{�jݾ��^��xn���{��
��>�y���*
+�i�=f�!c
+1)�Pi|��\d��x�'UGL�pdx�i�*<+�ΠT��"�|Q!�8��6U��u4�����������&�
=_�I8Cwɉ.:��*c�Ag��
�E���_T�c�D������'�
J��&Z(6�c��v���[3߳
+��f������
+��ߦ�R
8
+A��v��t�J۰�	Ls(�׽<yhC�
�G��Tg)+ɓ��x���“R�?=�0Q�(:8J��ظ�Bgy�m�%�gl�=���9�
dc�_5�2���Hhe�=����\���o����m��3&M�?�
+j��Sf�q�/0+W,Q�|i��Y��Lt;���f�XH!�䬃�Èq at -�W�i�k��H��X_0��gޚ-���Mg�
޽r at d�ݑ�����6�yJ� 
��U^�
X	p��x��Ч�́�&Z`a`�\�u$���h!��i���4/2�IS	wͼ�7m^��

PE9b�qv=
7]S���K�)`+7�􅵅h�:*�g�J�O��Ѽ�o�Bs���S�i��jӿ!|]�Yi�Р��J��wYu��y��^ͷ�ק{*y��R�N1�5�q�o
��Hr
Q(���B^.U��м)
�'"A�Q��>��2�߉�PW@�<�C��1�SB��Q&(@B�9����l���I�Q�YHB�D��^h���f1q
+��	"�<|�Qw�
�=d	q�3"���c�J!aȑ� g����؀�)ۧ�k��뫒A�CĠ�������2� ��0�|��.��]ˑP��]I?�G"�!n��F��
`}��8���a�n�bN�]lf�Ҡ�	�OA
��}m
��
Q��"��=�[1�9�x?��I
q
��-pjK�k�jOG�
�8�U�6_Б�3�&����n�� `��[���.��Cm7H� �3�V���

9���CnZ~��Z�pګ`_ZI�$�1a%��	��)PjZ��K�
�&<��G;�C���>�)���ټ}9��dG3�-����iG�
l��C������F�%
t���G{���^��z�J�t&���R�Ye�8�b$L1�J�AUǁ�U����j[,F� �w#e5j-�DG�6���

w�� l�z�I�4v�6�kӴַ�i���Ԯ9��*�(�Y�(��2�s���u6��N(w��
 �`�݈��V��`��.�~�&~n> �����ܹ竬�>=��t]�|.����u��ߥE�2Ll���L�G�<^�_�|�E�L~���U'~��?>��G��;�BɁ߾��^\ٟ��r�MW���s����d��S!&N}��%Tc^+;�7ݑ��m�L���`�_3ߊ�����.���l���5ܵ [...]
+����P�8I�_Fv�X��zh�������\`��^k����1I��,�sm
��n��͚E�*8�����1h�
+endstream
+endobj
+2418 0 obj <<
+/Type /Page
+/Contents 2419 0 R
+/Resources 2417 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2294 0 R
+/Annots [ 2371 0 R 2372 0 R 2422 0 R 2394 0 R 2395 0 R 2424 0 R 2396 0 R 2425 0 R 2397 0 R 2398 0 R 2427 0 R 2399 0 R 2400 0 R 2401 0 R 2429 0 R 2402 0 R 2403 0 R 2404 0 R 2431 0 R 2405 0 R 2406 0 R 2432 0 R 2407 0 R 2408 0 R 2409 0 R 2434 0 R 2410 0 R 2411 0 R 2436 0 R 2412 0 R 2413 0 R 2438 0 R 2414 0 R 2439 0 R 2415 0 R 2416 0 R ]
+>> endobj
+2371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 707.957 374.218 718.861]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_abcb586fdbb2eb01ec10c0eb941f4b7f1) >>
+>> endobj
+2372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.436 707.957 513.996 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.002 194.603 706.906]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 673.476 458.332 684.379]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a0746b37f80c4be687b0dc5ded6190002) >>
+>> endobj
+2395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [461.549 673.476 513.996 684.379]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 661.52 298.403 672.424]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.308 661.52 513.996 672.424]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 649.565 168.591 660.469]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.278 627.039 381.627 637.943]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a8d39b1769491b0ee262118bfa31bcc67) >>
+>> endobj
+2398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.615 627.039 513.996 637.943]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2427 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 615.084 192.402 625.988]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.738 615.084 429.869 625.988]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.757 592.557 374.504 603.461]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_add8c6ae913a7e3f0a7e1470a23ba04a3) >>
+>> endobj
+2401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.97 592.557 513.996 603.461]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2429 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 580.602 185.757 591.506]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.093 580.602 423.224 591.506]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.377 558.076 382.529 568.98]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_adb6f375b8aad58a31f6a60abb7a9b1e2) >>
+>> endobj
+2404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.615 558.076 513.996 568.98]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 546.121 252.167 557.025]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 492.95 404.325 503.854]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_ad69ffccc04d33132e31a91296afad78d) >>
+>> endobj
+2406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.543 492.95 513.996 503.854]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2432 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 480.995 257.148 491.899]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.167 480.995 367.573 491.899]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.545 458.773 397.746 469.676]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a70541b12c8a9b281b3aa4f9c21624b3c) >>
+>> endobj
+2409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.001 458.773 513.996 469.676]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2434 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 446.817 240.541 457.721]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.209 424.291 401.064 435.195]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_abc4dd4b94a80075012b0f30b13339632) >>
+>> endobj
+2411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.983 424.291 513.996 435.195]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 412.336 245.522 423.24]
+/A << /S /GoTo /D (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) >>
+>> endobj
+2412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 389.809 398.267 400.713]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a62836b9156289bd880bf9f32056a4dee) >>
+>> endobj
+2413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [401.485 389.809 513.996 400.713]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 377.854 257.148 388.758]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.287 377.854 513.996 388.758]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 365.899 134.838 376.803]
+/A << /S /GoTo /D (group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) >>
+>> endobj
+2415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [327.557 288.737 500.327 299.641]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+2416 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2420 0 obj <<
+/D [2418 0 R /XYZ 89 770.89 null]
+>> endobj
+2421 0 obj <<
+/D [2418 0 R /XYZ 90 721.073 null]
+>> endobj
+2423 0 obj <<
+/D [2418 0 R /XYZ 90 688.351 null]
+>> endobj
+2426 0 obj <<
+/D [2418 0 R /XYZ 90 641.462 null]
+>> endobj
+2428 0 obj <<
+/D [2418 0 R /XYZ 90 606.98 null]
+>> endobj
+2430 0 obj <<
+/D [2418 0 R /XYZ 90 572.499 null]
+>> endobj
+2433 0 obj <<
+/D [2418 0 R /XYZ 90 473.196 null]
+>> endobj
+2435 0 obj <<
+/D [2418 0 R /XYZ 90 438.714 null]
+>> endobj
+2437 0 obj <<
+/D [2418 0 R /XYZ 90 404.232 null]
+>> endobj
+2440 0 obj <<
+/D [2418 0 R /XYZ 90 332.03 null]
+>> endobj
+2441 0 obj <<
+/D [2418 0 R /XYZ 90 275.923 null]
+>> endobj
+2442 0 obj <<
+/D [2418 0 R /XYZ 90 253.631 null]
+>> endobj
+2443 0 obj <<
+/D [2418 0 R /XYZ 90 253.631 null]
+>> endobj
+468 0 obj <<
+/D [2418 0 R /XYZ 90 72.893 null]
+>> endobj
+2417 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2472 0 obj <<
+/Length 2178      
+/Filter /FlateDecode
+>>
+stream
+x��Z[s��~���%䌸�;vӧD�3NR׵�'ǣ��BC4ZV}�^  DA�ɴ
>X��\�s�]
-#
�<��jt�2ƑFZR]-"���k$$�ͣ�c)'�~��T�h	�\���^_�x}��~��}��#��
�h�
����94�aĴ�n]�u�)��U�n���`D�}��0�#B��V��+!��Q6���x�Y
B�D\�n
��9
	��,M8F����o&���4+
S��
k�;��"�t��BƷfk�z��T"��I��T#�D����%Y��:͊� *�
�W��3��8�z��Qr"εB
+�
ii�I�oWf����IVf�a�Xk�2����dJ��ʀ�E23���Y�7�5�X�*�:)�m|J��
��O|5Qx|�1L&�8���a��fe�g�}L�/�4[�WЂ�/o���ſ��0._�yeVV�e�۟G�{�l��M0+x�Pan_.�u唞g�e�lq�#��r#N�
�8�2��d��f��f���f��������KS1����Иl�C���k��h�
�"���nh�g���� d,�q�۝���O�*K�4Y��NlcG����~�W���J
�)
�O8`P��Ze1sZ͌S��ko-S'�{���i
+q�TSoo��z��#��#ΐּ
+��c�l��8ҊV}6iyD��V���Y'��n@DŽ�t�ڥ�ye�Q�:�[��OK�}���Q�������Uܼ2�Х���e�P�³��
�ȓ��}�/D"��>�S�0��1�c��q����^l�������w���a��q$�z$ �
��3�J
%��+#;��`�k��x���^����]
F�(���5�w=@�����÷5
B��=l|�]0dd�B<�.�

_k�~t^f�f���d���BkS��$�8�M1�_W!y�?E��2&��!J�u9e��	�Xɻ*O�[��X~!����:%rl��5�ڢӧ0�v.ql}>L�z"��`]�a��]9
�ད��;���p0�����$H�B���G����$E����
�)Q
�f��P�(�B�Ћ��ʔ�)��0>4'xtR
��4,�ʬk�
��<�cy����� �jT��?�i
I���7i�}��1! ��Z�|2�Yz�oC��ɳy�wC[�ͪIn��*`٢����]�Z���{o��$���!����	0E[0⠏Kkajl�?�uu�8�k�ପ��:�ŋO at fZ:�&�snS�*˯�g�fk?�"9�9�o�����{BK�\�2H6�\���|pO�Me��J&I1
�E��,���k�⸱�>#��:��	{mJum�U�/y�
2X�n��PŁGսX!!��}�C3H[
��
�]T`R?�-�`�ި�=���!a��gY�
A1 ������W��>9)�K��
)�p;��8����
�+!�B�QHp3�
�؄l�F�4����/�x:48����l���
�@?��?A���'�����[Szb��0��ɡFJ?����ݥ�P�X�Ӆ���z�WJ�1�ؓw�a}e�qVc�K���J.��}^)!��'��eK��_&S�EЕp�e
�㜁���47�4x��E��sik���N��t��a��9jF$
6_�2IWթѥ)f�t��Y
+��=j�{"�A�/�)T셗�ټ:��9�
R�g;빓9�i��ٯZ�.u�K,�0 �*'T�͋#�2e}pn�W����n&)���
+R~��5����-��u�*��A�`�MD�m
�
r�8�=\�,� ��)��6�Wm2�� ڞ�?}]F)ºþ+u�
�U����ڜ5�Ҧ����j�h�W�A���Q�� �i��A���
�O��z�
,n^�t�
kt�͠V���nQ��U��kMC�{ǿ> Ri����Нt���{��7
�*4�)�waU����Eѳ�u^�	���
�\���
ZF�%t�V�g銸E�@��h'���fr+ʆ^7�Ƚ~`�'�#���~{��c5&4��Z��2�ɚ�0ߴ��Y(0$�
��f�=$�բ>
�����o������d�]�4՞���c�+�6��Q���!�!��5� �����?[W�X_� �n�FY�"ȟ`�w�� �<�Q�����k�v͑T�:n�r�����ݲ0����!���P��f��Ni�yu3&͠q�B����kaPe
+endstream
+endobj
+2471 0 obj <<
+/Type /Page
+/Contents 2472 0 R
+/Resources 2470 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2294 0 R
+/Annots [ 2444 0 R 2445 0 R 2446 0 R 2476 0 R 2447 0 R 2448 0 R 2478 0 R 2449 0 R 2450 0 R 2451 0 R 2480 0 R 2452 0 R 2453 0 R 2454 0 R 2455 0 R 2456 0 R 2457 0 R 2483 0 R 2458 0 R 2459 0 R 2484 0 R 2460 0 R 2461 0 R 2462 0 R 2486 0 R 2463 0 R 2464 0 R 2488 0 R 2465 0 R 2466 0 R 2490 0 R 2467 0 R 2468 0 R 2469 0 R ]
+>> endobj
+2444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.035 683.608 476.806 694.512]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+2445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.328 584.215 350.026 595.119]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a7e3f8c5b2e614c5d18783c2ef7b092e1) >>
+>> endobj
+2446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.064 584.215 513.996 595.119]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 572.259 168.591 583.163]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.059 548.718 407.858 559.621]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a98e7f050a579e9deeb71a75758238928) >>
+>> endobj
+2448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.628 548.718 513.996 559.621]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 536.762 226.155 547.666]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.136 536.762 470.267 547.666]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 513.22 353.845 524.124]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) >>
+>> endobj
+2451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.063 513.22 513.996 524.124]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 501.265 134.838 512.169]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.174 501.265 346.293 512.169]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.093 477.723 346.828 488.627]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_aa82f0fc73b5f98fab74070ee92a100cf) >>
+>> endobj
+2454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [350.63 477.723 513.996 488.627]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.933 465.768 336.051 476.672]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 442.226 355.648 453.13]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_aacb1e10c50be6e9dd36e3aed93c7a222) >>
+>> endobj
+2457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.865 442.226 513.996 453.13]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2483 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 430.645 168.591 441.175]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 374.307 378.312 385.211]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a1785059acd1bf60dcf4cda0044cc94b5) >>
+>> endobj
+2459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.53 374.307 513.996 385.211]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2484 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 362.352 219.51 373.256]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.528 362.352 329.935 373.256]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 339.622 371.697 350.526]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a64b1a8e66388915a57bfd0b53a2e46c5) >>
+>> endobj
+2462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.915 339.622 513.996 350.526]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2486 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 328.041 168.591 338.571]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 304.125 373.351 315.029]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a35180fb6d38a29d74f5992815fbdf006) >>
+>> endobj
+2464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.569 304.125 513.996 315.029]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2488 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 292.543 168.591 303.074]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.757 268.628 374.504 279.532]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_abe46bba93c5ddcf4cf4cafdb0d74f942) >>
+>> endobj
+2466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.97 268.628 513.996 279.532]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2490 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 256.673 219.51 267.577]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.971 256.673 453.101 267.577]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.035 178.52 476.806 189.424]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag) >>
+>> endobj
+2469 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2473 0 obj <<
+/D [2471 0 R /XYZ 89 770.89 null]
+>> endobj
+150 0 obj <<
+/D [2471 0 R /XYZ 90 721.073 null]
+>> endobj
+2474 0 obj <<
+/D [2471 0 R /XYZ 90 648.273 null]
+>> endobj
+2475 0 obj <<
+/D [2471 0 R /XYZ 90 598.992 null]
+>> endobj
+2477 0 obj <<
+/D [2471 0 R /XYZ 90 563.847 null]
+>> endobj
+2479 0 obj <<
+/D [2471 0 R /XYZ 90 527.897 null]
+>> endobj
+2481 0 obj <<
+/D [2471 0 R /XYZ 90 492.4 null]
+>> endobj
+2482 0 obj <<
+/D [2471 0 R /XYZ 90 456.903 null]
+>> endobj
+2485 0 obj <<
+/D [2471 0 R /XYZ 90 354.299 null]
+>> endobj
+2487 0 obj <<
+/D [2471 0 R /XYZ 90 318.802 null]
+>> endobj
+2489 0 obj <<
+/D [2471 0 R /XYZ 90 283.305 null]
+>> endobj
+2491 0 obj <<
+/D [2471 0 R /XYZ 90 221.813 null]
+>> endobj
+2492 0 obj <<
+/D [2471 0 R /XYZ 90 165.478 null]
+>> endobj
+2493 0 obj <<
+/D [2471 0 R /XYZ 90 143.101 null]
+>> endobj
+2494 0 obj <<
+/D [2471 0 R /XYZ 90 143.101 null]
+>> endobj
+2470 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F98 502 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2521 0 obj <<
+/Length 2420      
+/Filter /FlateDecode
+>>
+stream
+x��ZK��6�ϯ�m�����]'��ûg�r�SS
#1K�2IY#��4^)Q�
OR�IDw�u
� ������իɘ���} q�D����m� M�c
�V������˶Q�{�
nT�^��b�PY=!"���6�O����U�}:S��W��*u!��0N&��|�����
*�X�8JD0[^��4`Ĥ6��2�(�k�|��v�uWD���g��z6
�0���0$#k��VM�Ǻz����`L���~�aB8Xf&q�.��|�ǂ���O9C
>�����]��Gftߥ�#�f�$,�r:�ʦ��9�n�V�$��%4	f�֓
��s�Q�zתYm�����,�2+�}�V�����
�1�Q����
ZA#$$񽲼�m]�Z4�2!Û��SnssI��g3᝚��Fه�M�
+���v
�ڴ�p�Ҳ�m���(�	���>��\��
?p���0���ͫҶU��N2l���u��ko�S�
�X�9�4��Qw[����V+�2�
+�T ,��\ڦ�"/
ZV`��\����Z�Z{?T���VA���CMm;��TZil�"`��=M=h.!���L �i]je?K#�q�_�
+	��y�'&bΘ�vƌ�KP$Hҹ݈c
+�
�
$5m^��:K�2+�,4;�&�t0��v��~��x���Ʃ�X�{���N�fi'���	�

]B
P$ADʡKY� ��p�n�
�b��}Z�Y
+!
�#�
���+��jUi%�[��q8�$��"��\JDe7�
ļ"�B��UV�1/A�w��5%t�z!̃��b
�
����v�iպ�)��1
�
���0Jڨ��#��cp\��,L��8�";�u���A�n}�
L�\b�%��~�l�qޅ���;T�&W����ˍyr���aϸ�
���{z�W>�u���P�,$F�,E
��;J����)��v�ʪ��04X�668����1^q��	��xpJ +ħR?�Q�t�ߧ��$��yJ���4
+\���̈�8�ݓ��H39&~B�v
}U��p%�D
��'�P��#2Y�b�4"#�h��Y^h�
M�:
+
�!9��l�	
i�IjhP1�����4��{�
+b�
B5b>��L�+�
+l�A��� ���
�
f�^��赏
6�7�w�
a`��oT�"X���턹xh�&9�(;+Ҷ��q���a�-IQ�;U�MҤ�GH�1I�0Z��M→��y�7�z.�\�,`|�^��鉀J!��$b�#1S�)۬���;�~c:�ʪ�����m�4
h>�d~[�l��n4�&G�Y���!qj��@�׸m��<؜XC;&/��kH`
��y� ��EZ�%���9�O�w��#�yiY�d��_���g��2��bZ_�����C�L�!cw�U=
�h�"��G52R'��0�Gٺ̠�A'C
+�@n��K��9���W��C�3�5�ǼT�t��F��%��IN�FXh���\��x�kk��#b|�`��/5Ԩ�ڪF\<C���G]s��],�4 at fe��vE����8�p$���J{
!��qs��s]Im��zULs��C�F��kz.q�py|��>#R�a!3
��_�ߨv]���������ڕ-�����=3��]
��
H�d���a�)���VF�
��������$�
+�������$��
�F�ބ`�C at g����O�
+�5��������q��`<�8
�
+]�:KH�\���	��S�A)z&n�,���6��0F����@�Oa��&N�K���rs�
�����q�1��>�����fDH
���mP
u�G�
�q|��²>
8�_�Q�'��
�>�_�~ZT�5�fzo�Qa�ڏ�6�}��t�J�C�(�B�E��#�0h���C�q�m����v����3�8	�ޝ�������|���A�(�#��
fLJ��t�.��z-t�7g�~xkʸ�f'{��R�@<y�@&��>�
:�?�͟ ��G�O�
�Z�>������WA�ja�H��k�a�@G��/ڋګ�O�J$v���u3���$�ŝ1�KDwǩz�Ɔa(��no�c��Xf�:S�c<��@��o��v~ў�l7���@5c�M
E;�8�}twNkν5�`��lm�(c
+[ �Ke^�mހ�������޵'�=��J�G��
�6<nU�>X�V08��Z�Sh̛�a�t��R�kI�X
+�W��.���Vn��X��DE�ź̫r��&Ő�(;��$s4.#� 
��[E	TQb����Gw�c/?��|��U�W�����U�m¹��x��]=�W�o�u���U����X?+�������
�G�Nm"#�6-m�zquu��7�����DC��>���wQ�;[VuWC�Ҝ�#0��c�bn�`��_`�I�Pӣo^�]��wK|S�b�~�
�+y
+endstream
+endobj
+2520 0 obj <<
+/Type /Page
+/Contents 2521 0 R
+/Resources 2519 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2540 0 R
+/Annots [ 2495 0 R 2496 0 R 2525 0 R 2497 0 R 2498 0 R 2499 0 R 2500 0 R 2501 0 R 2527 0 R 2502 0 R 2503 0 R 2504 0 R 2529 0 R 2505 0 R 2506 0 R 2531 0 R 2507 0 R 2508 0 R 2509 0 R 2533 0 R 2510 0 R 2511 0 R 2534 0 R 2512 0 R 2513 0 R 2536 0 R 2514 0 R 2515 0 R 2537 0 R 2516 0 R 2517 0 R 2539 0 R 2518 0 R ]
+>> endobj
+2495 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 396.587 355.997 407.491]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a26a124537b8995832b2cb157abc7cf07) >>
+>> endobj
+2496 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.215 396.587 513.996 407.491]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 384.632 134.838 395.536]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2497 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 362.116 313.596 373.02]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a0bf696420bbdc5c2ef0993f61f2273b7) >>
+>> endobj
+2498 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [316.814 362.116 506.192 373.02]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2499 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 327.944 524.463 338.848]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aeb8456ecf06307c108046a8c665154c9) >>
+>> endobj
+2500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.412 315.988 317.79 326.892]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.052 315.988 513.996 326.892]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 304.033 134.838 314.937]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 281.517 524.214 292.421]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a024a52502b35029ff2ba102323d8ae5b) >>
+>> endobj
+2503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.412 269.562 317.79 280.466]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [329.052 269.562 513.996 280.466]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 257.607 134.838 268.511]
+/A << /S /GoTo /D (group__Datatypes_ga82657533544652eb3ec1334a72da137e) >>
+>> endobj
+2505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.92 235.091 350.434 245.995]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a91f0ccf4325f53430d7347ca73182f52) >>
+>> endobj
+2506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.064 235.091 513.996 245.995]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 223.135 134.838 234.039]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.174 223.135 248.581 234.039]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 200.619 352.898 211.523]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aae5f47efa7c023e45aed9be161dce99f) >>
+>> endobj
+2509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.116 200.619 513.996 211.523]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 188.664 134.838 199.568]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.098 188.664 371.229 199.568]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.595 188.664 513.996 199.568]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 177.083 168.591 187.613]
+/A << /S /GoTo /D (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) >>
+>> endobj
+2512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 154.193 356.774 165.097]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a1b2ee4d834f0651a41647ac5b5e0f912) >>
+>> endobj
+2513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [359.992 154.193 513.996 165.097]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 142.238 134.838 153.142]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.33 142.238 371.46 153.142]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.597 142.238 513.996 153.142]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 130.282 231.136 141.186]
+/A << /S /GoTo /D (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) >>
+>> endobj
+2516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 107.766 363.389 118.67]
+/A << /S /GoTo /D (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_ab595ea1166752d23aba600af43417bd8) >>
+>> endobj
+2517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.607 107.766 513.996 118.67]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 95.811 134.838 106.715]
+/A << /S /GoTo /D (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) >>
+>> endobj
+2518 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2522 0 obj <<
+/D [2520 0 R /XYZ 89 770.89 null]
+>> endobj
+467 0 obj <<
+/D [2520 0 R /XYZ 90 549.118 null]
+>> endobj
+154 0 obj <<
+/D [2520 0 R /XYZ 90 539.893 null]
+>> endobj
+2523 0 obj <<
+/D [2520 0 R /XYZ 90 458.851 null]
+>> endobj
+2524 0 obj <<
+/D [2520 0 R /XYZ 90 411.561 null]
+>> endobj
+2526 0 obj <<
+/D [2520 0 R /XYZ 90 342.364 null]
+>> endobj
+2528 0 obj <<
+/D [2520 0 R /XYZ 90 295.938 null]
+>> endobj
+2530 0 obj <<
+/D [2520 0 R /XYZ 90 249.511 null]
+>> endobj
+2532 0 obj <<
+/D [2520 0 R /XYZ 90 215.04 null]
+>> endobj
+2535 0 obj <<
+/D [2520 0 R /XYZ 90 168.613 null]
+>> endobj
+2538 0 obj <<
+/D [2520 0 R /XYZ 90 122.187 null]
+>> endobj
+2519 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F72 198 0 R /F85 267 0 R /F93 336 0 R /F24 173 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2560 0 obj <<
+/Length 2326      
+/Filter /FlateDecode
+>>
+stream
+x��YKs����W��J
�������8��U*��
"�$l�pi�O�L^�9�r�	�WO?���d3��?_�}��y�IL����$��P�D0ZM>N�h�����"�� �������`֮�{�����0w^�0�,wW?��
+���P"�hr��v�<�ɇ��]Qd��̫y c�
0�a�q.	���t�N�I���l�y�jY��:-r˟���}Е�N�@Bq�q���^W at D�i������/
)�_�{��ڽ<i^W�^<3��G]��-k�����y�W%��V�~�˺"V��	
I �;N
e��t�#hfV�.I
+�I�f�p?��I^�ImTaW���:�5�7n.��[�J�M�8.�3���n�3��w3�d+�3�,ݹ�.v�.�x��F*Fb�R�6(���y�^�jz�3{�Vrm����;�w�i���M�'����	7?��j@}S��
+�e��)�o����k7p�޺�o���Ҹ��R�K]-{536ӫ���:�������E6c�L/�Z8���*�z��6ZK��ӵB]��$�ܱm2�t��Z�,�@|Z%;�\퓥��@�f�F��ҕU2�:�t���'F�<�&%�p|U@�&ON[
�e+ ��>fF
3�Vm��MF3�mQ!�U�<�&�Zs�̋QC��

.�t�K��*��`��\��`5ɪ���1�gT� g��K�怿�X:j�����`z���I	�8dI9���J�\�5��-2���(6""�ֱ��i����.ͽ޺H�H��B���! 
�q�vC��!r�@L
Ah�z�@��Lu��
��Z�Q��
z~��}
�����$������Ӝ������;��8����}�Y����(R��
33�����1%4V�=6��c��3no
�\p
���
N�
+�\܎\)"Xg�RB��ʝ�m22��>�g#
+HL/�F�(�Q�_f�Ȧ
�?s��A�����8�b	%�ۦ>����_�[��P��[Ԏ<pݒ��H�u�	��
2������yV�O�60�@X�me���m �z�{
H��
���a[�h	�1"+D�j�T_�$���%�Z�w71�m�k7},
D}:W��r�$���
�G	��g]��$b���{��$R6�{���a�����
�|L6%��ݪ�+]��-�
��
E� �E���Ǝ�}Q�>�q
���p
�P!��;
��k7�qg��f�ȼԫC�Jr�۱$D

SWTQ[h�4w�]±F)\�dʣ�	`
z%h��b�*vP��p��R���(�fp�
��F�&����e���u�<�~������?�R-+�.d�g�U�ǹ����EVPb��ǝݹ�$^! �B�$V�Iu<�
+8�Bh8G�YX,�	,t`2���VO��u�

�\���du�g�NfP�:X���u&��֠͗�<bPG�2�l�]�z�l�L�ņ��f�y���h!W���0�*P��nD�p�5"�
+\��������l���ѭI��a	%��o�*���
M�zK�%�s�C&�.]�T�aS��i�����'�Ar����(�E�{��`����
�&V�J	��d�
+K�C�
��KӂRqu��{�C2�X[�l����@�����s�)
Du�$�?
��q�`4��ݾ~>�'�ʡB
��󔾇>���fBe?���=|ͤE';g#�=+@�"����Y�^-+,_���$��n�_ѣ/3
+x�Vm�u�i�{�sL�� ���F9��c�� S���0�o�L�
#G�P��͈�7ܕV^qkSk�8vaH��MmEjϬ��1�~�nx=@���1{FHt���|b��r�J�-�.�.�)�s}�q�����{
�����W�����$�HS�C�黎
F��0��: oN_Cx�I����:
�w��
�$!���d�"��~{̐�5��-f����`S �� �͉.���{+F�L�3�M�-%a��:�
�x�E`��
�/�^�d��E�ʋ�`�(����I,d?�_�9ެ
�E@����eqL�-8�n��b+u���"H(E��`�€��P
R�It�A�T�W��/��e������/�|���e:�<���sU��W(jD�.
P4�4��6�)�I:
W��$r�?wNB.^�s�sPB�ۿ¿AOHYr��}���
N�����]�Zrs�7o	ڎ��8�b�~�$౿��%���^k�C�o�W�N������f�?��5�I濭(�?u����y_���lZ�o)�
�6"���~]��
K��˶�����<
6��7��4|��aHhиO���
+���9L��G(24�?�	
+endstream
+endobj
+2559 0 obj <<
+/Type /Page
+/Contents 2560 0 R
+/Resources 2558 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2540 0 R
+/Annots [ 2542 0 R 2543 0 R 2544 0 R 2567 0 R 2545 0 R 2546 0 R 2547 0 R 2569 0 R 2548 0 R 2549 0 R 2550 0 R 2570 0 R 2551 0 R 2552 0 R 2553 0 R 2571 0 R 2557 0 R ]
+>> endobj
+2542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.801 231.929 336.353 242.833]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ada9021952b7c7ad4ca6fc4ff082ec9fe) >>
+>> endobj
+2543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.864 231.929 415.258 242.833]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.478 231.929 513.996 242.833]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 219.974 144.243 230.877]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 182.718 323.001 193.622]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abedffb6a2f5b2473d2d2ac9d448c65d9) >>
+>> endobj
+2546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.219 182.718 399.613 193.622]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.942 182.718 513.996 193.622]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 170.763 134.838 181.666]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 133.507 395.359 144.411]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) >>
+>> endobj
+2549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.577 133.507 471.971 144.411]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.3 133.507 513.996 144.411]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 121.552 211.769 132.456]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 86.288 341.272 97.192]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad6512d0d60c017982bd8031e9b8df336) >>
+>> endobj
+2552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.49 86.288 417.884 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.213 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 169.159 85.237]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2557 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2561 0 obj <<
+/D [2559 0 R /XYZ 89 770.89 null]
+>> endobj
+2562 0 obj <<
+/D [2559 0 R /XYZ 90 721.073 null]
+>> endobj
+2563 0 obj <<
+/D [2559 0 R /XYZ 90 573.946 null]
+>> endobj
+2541 0 obj <<
+/D [2559 0 R /XYZ 90 551.476 null]
+>> endobj
+2564 0 obj <<
+/D [2559 0 R /XYZ 90 551.476 null]
+>> endobj
+469 0 obj <<
+/D [2559 0 R /XYZ 90 391.636 null]
+>> endobj
+158 0 obj <<
+/D [2559 0 R /XYZ 90 384.543 null]
+>> endobj
+2565 0 obj <<
+/D [2559 0 R /XYZ 90 301.498 null]
+>> endobj
+2566 0 obj <<
+/D [2559 0 R /XYZ 90 247.204 null]
+>> endobj
+2568 0 obj <<
+/D [2559 0 R /XYZ 90 198.182 null]
+>> endobj
+2558 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F60 176 0 R /F98 502 0 R /F24 173 0 R /F72 198 0 R /F85 267 0 R /F93 336 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2610 0 obj <<
+/Length 2128      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�6��W�R�Ƌ�{�xw�&�d'�4�r1%�V���8ί�n $��-�-+IeJ�t7���@�FˈF�
��]�Q42�$<��������	<ͣcEx<�2J�x�__��p:ޭ�o�y>az��^��r2�1
�ݖY�Hg�{�![d�O��ML�x���OW_��u5�e�@17eL��f�ч�h4��#J��ѝ�$P�����G�K�-�6:�4h�HԆIJ8Tc�1�����z^�@I<N]��&,
��
_��}���AK׶pO�T�d��(3߸[�r��e�æ�mY��o�d���F�b�|����0!�.�v���We� �7��:�b�򖄵��{�y�O�gi��q�hʹ ����ظ�z�EMK_��n�bH5͈��f��͐j	a��B�WT�x�&	]r�8%Rs�0"b�^���1÷�����ѷ�w�lf��=8������W
9�fh���:���ˇKw�ޭng*
�#��s9�4��
�
T`wI��H�p&kBVh���aE9�V�F��[iA [...]
ڰ��]_�~��f�
���u���
+rXG�a�# 'Q�����/�
NRA'J]S9�[����
�
¤"��m��8��~:���9a�
� ��A��w��e~�<q
�Ql�h�
hScNnΏ9.��(���KW�
��l\N��R�k��^�䠜՚��q"�z
m�h�!8�&�F���PJKpP)+�*�����e��b���
(c�Pn� 
�l���
�K~~�c�Y5�1
7l�Q
�ե8�]���
�� �DB�J�[,:����$�k��y��N:F��fH��_��ҢX-�C���c~�yQ
�N�X.��Dw�2�"�}6J$������)�b�b��߻�e����c�Q}�p
�������C���h��r�Ĺ���|F��=�1V��=�C8"�B���n����]^�l�Q�,�ɶ
9
��-#��w�]
���2��!����o����b���W |�B?i��ˮO�I+ ���U!�
�8'�pt�φ�4�kU-a�ٗ�OBW'��p�ں��*�]��3����BK&����oWpjU��7g�P�:|�� ������
+( �;���n�yQ,
�]
n
����a�``8�_
�	sUTv[ ��
�V9��$�E��6�5<����W��(���
�
+�[�׮�s��?��
+c�w�����ʇ��;��v�	o�`�φ&~�\9�A"�r�P}�`vhOi��t�`�_ �
��)naL�c�y�
v�cXn,d�����r
�X[U��Ύӱa7�$&��xF0%M
^,���L�	PaV��*@�&>���
}�4nD��L�D�- ?
�rC4�';&�����Uy�ٯ�	]�}�Q�%�M`�\TM��Âh�fd���m[���f,�=�(�<��9
䄨��U�Q��\%
`T_� CI�[O��vQ.�����E��+=��&�'��J�;�=�
<�k������8���
(!x��E��F�r��,�B��^BE�%��C������/s��I��=�mg�M�k�{�a�\�cg��{߉M>G��,��Yt}�4I�>�EoN�>���,z�I�EWU=��
��
<�W
�1t�x~9%������f��8%�Z�}I�	�3��ͱ��dx��=|��6a
Չ�I8=�6M�)=
�I��,�"KYej��Ӝ�C���
;͝5��r,>GR�+b��\��#��\��9t�iN�,:��
���yt�����$#��y�Nl�7y�Z�&�Ϋ<:���k�0
�%�w���?Cj�I�=���r{��\b<)�w�l?ѧ�(���z(��:�Iqw��v
����N� ?�e|��\�m��>�S;@(F��ڄ�ű_��/hQ	1Jh�=�T$6>�������7���7�vy�.��S`���
��"��6��W��t{��� [...]
+endstream
+endobj
+2609 0 obj <<
+/Type /Page
+/Contents 2610 0 R
+/Resources 2608 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2540 0 R
+/Annots [ 2554 0 R 2555 0 R 2556 0 R 2612 0 R 2574 0 R 2575 0 R 2576 0 R 2613 0 R 2577 0 R 2578 0 R 2579 0 R 2614 0 R 2580 0 R 2581 0 R 2582 0 R 2616 0 R 2583 0 R 2584 0 R 2585 0 R 2618 0 R 2586 0 R 2587 0 R 2588 0 R 2620 0 R 2589 0 R 2590 0 R 2591 0 R 2592 0 R 2593 0 R 2594 0 R 2621 0 R 2595 0 R 2596 0 R 2597 0 R 2622 0 R 2598 0 R 2599 0 R 2600 0 R 2623 0 R 2601 0 R 2602 0 R 2603 0 R 2624 0 R 2604 0 R 2605 0 R 2606 0 R 2626 0 R 2607 0 R ]
+>> endobj
+2554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 685.646 350.517 696.55]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab27e9641bc6946aef6e3254d28c6fab4) >>
+>> endobj
+2555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [353.735 685.646 427.13 696.55]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.458 685.646 513.996 696.55]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+2612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 673.691 169.159 684.595]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+2574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 638.036 347.898 648.94]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a703c5d92387510c5cbf8b0f1da3029b2) >>
+>> endobj
+2575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.115 638.036 424.51 648.94]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [448.839 638.036 513.996 648.94]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 626.081 169.159 636.985]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 590.426 357.143 601.33]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9d9b8361c659cadd31afb61152ccf06b) >>
+>> endobj
+2578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.361 590.426 433.755 601.33]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.084 590.426 513.996 601.33]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+2614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 578.471 169.159 589.375]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+2580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 542.816 331.559 553.72]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abd393bd3febd678f09a51a0364756787) >>
+>> endobj
+2581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [334.777 542.816 408.171 553.72]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.201 542.816 513.996 553.72]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 531.234 134.838 541.765]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.527 465.262 348.464 476.165]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a52e2499c42a9be1e527642cbfb16ff8c) >>
+>> endobj
+2584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.701 465.262 425.096 476.165]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.459 465.262 513.996 476.165]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 453.306 149.224 464.21]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 415.659 351.773 426.563]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aebe78c4ede3d49c63765e71cfe93904e) >>
+>> endobj
+2587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.991 415.659 428.385 426.563]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.714 415.659 513.996 426.563]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 403.704 134.838 414.608]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 366.056 424.131 376.96]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a819d233e9b1442e06c806dea0523a2f9) >>
+>> endobj
+2590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.349 366.056 500.743 376.96]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 354.101 224.501 365.005]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.539 318.446 357.689 329.35]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a304dd0846a62cb4a9f79806ea82cee5d) >>
+>> endobj
+2593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.937 318.446 436.332 329.35]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 318.446 513.996 329.35]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 306.491 210.673 317.395]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2595 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 270.836 364.903 281.74]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af93c7e3e554a92e8d3eeb4cf4261debd) >>
+>> endobj
+2596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.121 270.836 441.516 281.74]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [465.844 270.836 513.996 281.74]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+2622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 258.881 169.159 269.785]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+2598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.965 223.226 362.74 234.13]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abf1bb44cdbf733e9ca39164f9d8e8179) >>
+>> endobj
+2599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.415 223.226 439.809 234.13]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 223.226 513.996 234.13]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 211.271 217.298 222.174]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 175.616 371.529 186.52]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8948143df881c58c79da34380f847401) >>
+>> endobj
+2602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [374.747 175.616 448.141 186.52]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [472.47 175.616 513.996 186.52]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+2624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 163.66 169.159 174.564]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+2604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 128.005 360.331 138.909]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a1bd806c292d0576b94d3084b21736061) >>
+>> endobj
+2605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.549 128.005 436.943 138.909]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [452.973 128.005 513.996 138.909]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 116.424 134.838 126.954]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2607 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2611 0 obj <<
+/D [2609 0 R /XYZ 89 770.89 null]
+>> endobj
+2615 0 obj <<
+/D [2609 0 R /XYZ 90 558.476 null]
+>> endobj
+2617 0 obj <<
+/D [2609 0 R /XYZ 90 480.733 null]
+>> endobj
+2619 0 obj <<
+/D [2609 0 R /XYZ 90 431.319 null]
+>> endobj
+2625 0 obj <<
+/D [2609 0 R /XYZ 90 143.665 null]
+>> endobj
+2608 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2680 0 obj <<
+/Length 2520      
+/Filter /FlateDecode
+>>
+stream
+x��ZK�۸�ϯ�-T��@�$67��.ov
'�T���CB�|�$5��_�Ƌ�3�ؚ���E$A<����h
+��3<{s�����u�g�����L�Y��<���^��^�4�� �z��w�?�����]�x}���+<#f<Ga4K�����Y
+�?�0�E4�ӝ��>\�ه��]�(�B0C$�g!!���K�d�l�
? ^���zIU��ne='�k���=�iej�7��=;�F���<d�
x���K
��Y����g�7s�U�a[��X��p}ӻ�J3W[�7N�5w7s��]����x� U�F��p�5���6K��Z�#�B��k1�:۶fY5���6+��ieD.���	�&
qLݶ���5އ��u�Zeǯ��X*����ն��v�/���H�tl�e���-��Y�t�,����0���725�%LH�@M�
���O�����&��e���L�i��M�K��"�*�q���9�L앁l�$�}
+
+�
w����2��ͷq��7��4[��
X��u�5�NO���L�d]�֬a������������T.FjZo��'�Oy�m�[i�n�,�
X�T����nc�Ce�O�����TMZD5d�9����O�k�z��j�fe��?w�ƍf���l훩�K�b
����{�vQ!��6�.Y!��0�eU.�v�Y�w�Զ&��R��$��I&�Į���ҕ~�j�v��!^�����80#
Q#�'J�h���c�
�k��G���5�]w ;~P��
�
�Ļwö��x��Wг�l���l�!���
��7
h�;C""��v�y�zS- `�ib8#|�M��{"�Y�
n�Goz%�AF ^��֘8�P�+
+m�R^]��ڑ�л2Oۑ+2�lD��YcZb�T�{�P�L��S�L��,Q�����u>̰�

<�]Ӳ'����j��#���.6
T�(첂?��0Ug��T�f�� B��0�=2�7�rˠxEÊ���߹c�Q*n�g�fTmqk�ij���"Q�0$(=��
�u��
J�@+
*����>&O"��.k7K���\ڃ�-�#�GX?�pO�EXȂdl쒧�I_�-�J��cc<� � {�B�.W�r at a*
�i��[$~ˊ�0��;�D&�I��#?�v*�b��5&�SҖV�|]7�i��T�4�{A��Ff�ܒT����E���6�)�	�y�"�q�,��S��+��y�ɝ��46������™���O���c^�1����'�_B8�N!%�Ks��S�
Š[��27�\LWw*
���̛�n
+�>
��Q��ňP�P�8=��#T'��e�؊����z�E��
';�cd�g���X�G,�
b1�"�E�.�����r1�
+Ǫ��`L	���	�S6���Cy�X=�h�n��1E
�����=��qT�B���:GdA�J6m�KZ��J� ��|en]@Q�[?�W;b��O9҃b�޾�Si�MS��V>��􏻟S�~*��2�ַ���Yw�Pd16,x��n7?La nI��v��ً���s��NwL
-�T��*S[Sžm�mv��,�

���lwq��#��s72=
���\�8���d�weҕ�p�l`�UeA�\�/U�����R�������
���Ɖ\�Y!K]
}V��8�5N�e{������G�����T���Ö�1M�9�m5U�a��N�BPғ�����qc�=�������� /U}I�b���&💠
)��j��gH�&0k��*��/9g��H�i(�~� �����b�X���$a������e�N�蜈�ّ"�:'��D
��*��7vE��ծ�_
+�I%�2r"���iхU蒵�(=9�����{G&ͫ>kpt�.��ҚS��
Q��)�d�m��8�P �ى��B1`E-�X�/sL�R���~�''��N�pz��Ȕ �AtJ�!��c��F&*.�πl���������6�w�n�ܲ��|Nr"e���n��"A��~�d�t���D��&c�
e2� 
+p�F���-QG[��y|��QZ)�T�<OD����+u9��>� �.
Z#a.~�r-��}
�ek6\{��`Ga�Y��#�d�.?�7�,A8��t/9�QF�T�J����O�e���e
,��q�f^��M��NL�s�鐧�!z����'�A|�0
�[?J at n��3}��u���H6�O��=�s����$�
!;�|b'�i����ΐ��6}G�ׯa�u�O� z�F~(�p�| �EVfE�/�>���4�p�q�38��sA߇0
��9�nC���
rW��|>=�Ϗ 
d�w��w���
+��y:�(_w⟧Y������r�&aH���~��؆˷�?{U�d�t
�o�O���
jH��>똁Q@�[Tkw�U���ln�G���r�����۲��J��]Y�������޿�����R�VqU�}�� ��e���
s}��\ft�ܩ�U\�C�žh�i����7�u#�5J������!�����WQ��}���B����F� ��
+endstream
+endobj
+2679 0 obj <<
+/Type /Page
+/Contents 2680 0 R
+/Resources 2678 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2540 0 R
+/Annots [ 2635 0 R 2636 0 R 2637 0 R 2683 0 R 2638 0 R 2639 0 R 2640 0 R 2641 0 R 2642 0 R 2643 0 R 2685 0 R 2644 0 R 2645 0 R 2646 0 R 2647 0 R 2648 0 R 2649 0 R 2650 0 R 2651 0 R 2652 0 R 2653 0 R 2654 0 R 2655 0 R 2656 0 R 2657 0 R 2689 0 R 2658 0 R 2659 0 R 2660 0 R 2690 0 R 2661 0 R 2662 0 R 2663 0 R 2692 0 R 2664 0 R 2665 0 R 2666 0 R 2694 0 R 2667 0 R 2668 0 R 2669 0 R 2696 0 R 2670 0 R 2671 0 R 2672 0 R 2698 0 R 2677 0 R ]
+>> endobj
+2635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 628.099 337.387 639.003]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a879f2f2b0f967fa73cb59ea8d8b1d255) >>
+>> endobj
+2636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.605 628.099 413.999 639.003]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.328 628.099 513.996 639.003]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 616.143 134.838 627.047]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.618 579.203 410.855 590.107]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8b280d026e0c343ec0d3f5521dda6376) >>
+>> endobj
+2639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.183 579.203 488.577 590.107]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 567.248 224.501 578.152]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 532.3 337.387 543.204]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af29cc9becde5f28a37567093174d6855) >>
+>> endobj
+2642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [340.605 532.3 413.999 543.204]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.328 532.3 513.996 543.204]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 520.345 134.838 531.249]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.618 483.404 410.855 494.308]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a680aecc71f3b21fa0db03c7d1cbe466b) >>
+>> endobj
+2645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.183 483.404 488.577 494.308]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 471.449 224.501 482.353]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 397.68 232.521 408.584]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_adc7cd513e31b7ecdda3a25a967d8a772) >>
+>> endobj
+2648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.337 397.68 335.743 408.584]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 334.909 277.352 345.813]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9947be8614cba5c2e8b02771d48fc7d2) >>
+>> endobj
+2650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.168 334.909 380.575 345.813]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.017 334.909 479.373 345.813]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 308.927 277.661 319.831]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a50d5c68064e215d3f2cf3ee69896e676) >>
+>> endobj
+2653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.477 308.927 380.883 319.831]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.326 308.927 479.682 319.831]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 271.987 307.758 282.891]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab1d03e0aac8dda484b102c536c612a45) >>
+>> endobj
+2656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.976 271.987 410.382 282.891]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.748 271.987 513.996 282.891]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2689 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 260.405 134.838 270.936]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.052 236.043 306.618 246.947]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6c5a2f9b4702c1a0ddfcc9c6eb9b92bd) >>
+>> endobj
+2659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.379 236.043 409.786 246.947]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.13 236.043 513.996 246.947]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2690 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 224.088 134.838 234.991]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+2661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.437 200.099 269.385 211.002]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a85417db0eb420d402acee4ef0d842efc) >>
+>> endobj
+2662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.532 200.099 372.938 211.002]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.126 200.099 513.996 211.002]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2692 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 188.143 134.838 199.047]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 162.162 275.081 173.066]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a2dc649f0ee90ea5af999e3c0bae54bcb) >>
+>> endobj
+2665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.299 162.162 377.706 173.066]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.072 162.162 513.996 173.066]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 150.207 134.838 161.111]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 124.225 316.057 135.129]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a27fdc62bc2cae150c7d710a8e312a40d) >>
+>> endobj
+2668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.274 124.225 418.681 135.129]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.047 124.225 513.996 135.129]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2696 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 112.27 169.159 123.174]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 86.288 322.682 97.192]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6d147411700f558d74d8273accfb8e04) >>
+>> endobj
+2671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.9 86.288 425.306 97.192]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.673 86.288 513.996 97.192]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 169.159 85.237]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2677 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2681 0 obj <<
+/D [2679 0 R /XYZ 89 770.89 null]
+>> endobj
+2682 0 obj <<
+/D [2679 0 R /XYZ 90 643.201 null]
+>> endobj
+2684 0 obj <<
+/D [2679 0 R /XYZ 90 547.606 null]
+>> endobj
+2686 0 obj <<
+/D [2679 0 R /XYZ 90 412.798 null]
+>> endobj
+2687 0 obj <<
+/D [2679 0 R /XYZ 90 350.027 null]
+>> endobj
+2688 0 obj <<
+/D [2679 0 R /XYZ 90 324.234 null]
+>> endobj
+2691 0 obj <<
+/D [2679 0 R /XYZ 90 215.405 null]
+>> endobj
+2693 0 obj <<
+/D [2679 0 R /XYZ 90 177.468 null]
+>> endobj
+2695 0 obj <<
+/D [2679 0 R /XYZ 90 139.532 null]
+>> endobj
+2697 0 obj <<
+/D [2679 0 R /XYZ 90 101.595 null]
+>> endobj
+2678 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F107 573 0 R /F60 176 0 R /F24 173 0 R /F93 336 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2766 0 obj <<
+/Length 2334      
+/Filter /FlateDecode
+>>
+stream
+x��[�r�6}�W�m���N2�6�t*I����<t�T�I��K��m���b�6S����vʥ�x/�s {S{?\�����]��E�J�v�E�
x��������k�1��b>�0����˙��y6����
+���ժ��#e?��2yTf�g����۟�����rE��#֥@A�ҫO�co
�?y�(�
L����u��z��+�J�{5�	�Bm$׵!
#
+�!�[��ʤVH�~\����_U�.�ͻ�mX��ݛ���˳�)D��&Ol͎�r
fq6��f��_�Ϋ�T˪V���'��&Y�&���д\�l
+^�
?LҸN���<S����ѵ.�w
2���^D��l	������P� �����j�Q �\d��酛wrPׂ"殡
"!��)�j�%�ӵ �%Y�50ʩC�G�A��`����TC��rז��
�ט1d�g�\�f���%��Ϻ�[�B)��@M�xhk�QՋ2�lH��R�UR'�.N��j��?
�C���I[�`�8	�{�!�I�%q�M#���[�o�
+w�
$�T�{��
���p=�%���0�LY2�¿�\����%!�9�f��,��J5Eq�o�S������n8 ܐ�<;��E6r}A'\3�B
�D8�'�\d�k_0���E=\�IV
M#cLU9,�7���^�bν
���+w�g]�0m��
�M��T�C�`��%u$�O�Q<�/��y^�H*yQ
+Ķ�v���&��;�`
������&�eꡟ @�r'ըT�zC�A*�4��s^��$Pa��D�׀��H=����e at e0Q�>	S�h���<�$UY�hˢ��Z����E�mg=D5m�c�E��m��e�I�6+�t
+��DQD�(�8W�@ުI۪H��8�"��g0fI΀~=A����pR��0��u��Lp׸~�
k���n�z�d*.��?��t�ؕ������7W�F
���1su�d�>L��2ue�3��4-�#���5+y`P
�5)���S U�
� � ����Q�\�
IxĦ�Y�
>$��}��
+�J"��tō��r5�A�c:JTV�۪�0;���7 ,��yG�F�S��+��=fsmA��(\�ӕ��b��2U�u^�Ϡ��`���`�Aw�@�;��F���'�n�Ý�0�Gr�z�8�Fi�zM{@��}��q�<��^Ri�"m{M*���q�ֹ�X$b�N,�ƍ-c�a��4����(��3��dv�f�3��������t���um�F��} �2��ᇜ
���Tl+��f�9v���M�E�7�'���D�,`O� d�rל�}�4^�(�c�E�mi���<ff�}�覑G�3�(�>Zi!?��.-
�gX ���b�ާe��U��;�ǕM����z��쳴
�:r�ȿ�[�ھ��͛���)�M�.
�
���l����?�Gq���a����k��f��F4�i;@��ؚ��%t��_�:Ev���EP�M���\O at 2-ŏ�Gݓ�2ŕ�C��F�#d
+EԨh-S�>�"�N��ޥ'F{d�t[�0{5
+9@�tH�#Qܼ�K�p
)Od�<�{�`ۤ�d���&$ByNi"`X�
��Ǝ�
���	����b�J �wF��u�Zy
+ ����Z���j
���J�h?�jR�Z���Z�O�-U�ޏ�iO���)��x���0K�����B��t��
y�

�eϛ
�/_(�|��ܲ�0wx����H��OӃI����U]&�Z�p:�7T<
<R�-
9D,_�t/l�>Ym��{� h� |~��!��J����z�(o }n��OB���B�6�Z���M�Q=�3�/[Tw?X(����|�fL1
�������	��l�<?a�o�/�%��^
+32�䏥;P:�<$�'N�fc�k'�-_�����u��l��~(�`A�V`E�i��
�"�v��ڃ���
�YRe�v0
L�ݤ5����.Pm�V0����D5�o�$�KI�b���N{\}tm��2����H������%��6 ��JH��Y\8l�����c��+�L�#{��$2:��ȝ
�7C0Ƀ��Tj�p�{�H��ɩ��3sъE	�����
�BB/����Z�Y<�*���0ɆwK}��a�V*=�n[D`
�]@�YE��|����-�=�g�?�� �=v�����+�>��7����8�.��<q�;u�pR�M7r`�%�V�5��� 8�H)J�:����
9[�?���g}Z�nF at sj�5Ԭ��oon��JeS4�ӧ\�
��W��5`e5�i�0A��c�M�
M�A�����t-�6�͋͟.��ǔy�̡3��)�:��
+endstream
+endobj
+2765 0 obj <<
+/Type /Page
+/Contents 2766 0 R
+/Resources 2764 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2540 0 R
+/Annots [ 2673 0 R 2674 0 R 2675 0 R 2676 0 R 2703 0 R 2704 0 R 2705 0 R 2706 0 R 2707 0 R 2708 0 R 2709 0 R 2710 0 R 2711 0 R 2712 0 R 2713 0 R 2714 0 R 2715 0 R 2716 0 R 2776 0 R 2717 0 R 2718 0 R 2719 0 R 2778 0 R 2720 0 R 2721 0 R 2722 0 R 2779 0 R 2723 0 R 2724 0 R 2725 0 R 2726 0 R 2727 0 R 2728 0 R 2729 0 R 2730 0 R 2731 0 R 2732 0 R 2733 0 R 2781 0 R 2734 0 R 2735 0 R 2736 0 R 2737 0 R 2738 0 R 2739 0 R 2783 0 R 2740 0 R 2741 0 R 2742 0 R 2743 0 R 2744 0 R 2745 0 R 2746 0 R 2747  [...]
+>> endobj
+2673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 685.043 245.263 695.947]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a4b5f126aef2ca062b034f795f6e5cf6d) >>
+>> endobj
+2674 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [249.079 685.043 348.485 695.947]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2675 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 659.14 253.711 670.044]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a357ddb19493a385970c56bf4847a07a1) >>
+>> endobj
+2676 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.527 659.14 356.933 670.044]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 633.237 254.668 644.141]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab4f7535037080c7f5db32b2e85fdc80d) >>
+>> endobj
+2704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.484 633.237 357.89 644.141]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 607.334 299.898 618.238]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9e5f40dfc278c52da81291b30fbe75f7) >>
+>> endobj
+2706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.713 607.334 403.12 618.238]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 581.432 303.374 592.336]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a39ee8e60c1d4d6faa40986d8fba28d5d) >>
+>> endobj
+2708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.19 581.432 406.596 592.336]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 555.529 251.34 566.433]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a141c3283de2a46f2fcb278dcdca0558f) >>
+>> endobj
+2710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.156 555.529 354.562 566.433]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 529.626 249.128 540.53]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ae1e938f0c844231dfe2098ab8fbca67b) >>
+>> endobj
+2712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.944 529.626 326.338 540.53]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.78 529.626 425.137 540.53]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 503.723 289.737 514.627]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab32d3b44994fefe43c44e353a47cb4a4) >>
+>> endobj
+2715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.954 503.723 392.361 514.627]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.727 503.723 513.996 514.627]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 492.141 134.838 502.672]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 465.865 290.344 476.769]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a7135823ecf68cedd5236d53e2b5541f5) >>
+>> endobj
+2718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.562 465.865 392.968 476.769]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.335 465.865 513.996 476.769]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 454.283 134.838 464.814]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 428.007 295.584 438.911]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a93cee014592562084126f06fe47efbba) >>
+>> endobj
+2721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [298.802 428.007 398.208 438.911]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.574 428.007 513.996 438.911]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 416.052 134.838 426.956]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.486 416.052 217.968 426.956]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.224 416.052 317.705 426.956]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [413.3 416.052 480.587 426.956]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+2726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.327 381.183 249.243 392.086]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a1dd00b705631c579994677fea3a86d63) >>
+>> endobj
+2727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.28 381.183 353.686 392.086]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [371.875 381.183 500.601 392.086]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 369.227 196.576 380.131]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.856 369.227 297.337 380.131]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 332.366 293.93 343.27]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a0e494452cce5a8916f4fe97a1c79e237) >>
+>> endobj
+2732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.148 332.366 396.554 343.27]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.92 332.366 513.996 343.27]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 320.41 134.838 331.314]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.51 320.41 218.992 331.314]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.502 320.41 316.983 331.314]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2736 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.203 320.41 477.49 331.314]
+/A << /S /GoTo /D (group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) >>
+>> endobj
+2737 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 285.541 293.93 296.445]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aee4d567631589e83063cfb8f80c2bd6f) >>
+>> endobj
+2738 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.148 285.541 396.554 296.445]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2739 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.92 285.541 513.996 296.445]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 273.586 134.838 284.49]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2740 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.51 273.586 218.992 284.49]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2741 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.502 273.586 316.983 284.49]
+/A << /S /GoTo /D (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) >>
+>> endobj
+2742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.536 236.724 292.284 247.628]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5a6342bc4e04c1f228d210e5c363b6d4) >>
+>> endobj
+2743 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.53 236.724 394.936 247.628]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2744 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.37 236.724 503.777 247.628]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 210.821 324.913 221.725]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abcf3ccb8e2e224496d1326e47e15fdc6) >>
+>> endobj
+2746 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.131 210.821 427.538 221.725]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2747 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.923 210.821 513.996 221.725]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 198.866 134.838 209.77]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 172.963 324.924 183.867]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aa309e957fa5f404b296e2e4c30e1697d) >>
+>> endobj
+2749 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [328.141 172.963 427.548 183.867]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2750 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.933 172.963 513.996 183.867]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 161.008 134.838 171.912]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.543 135.105 284.541 146.009]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af777de5ca96f8d1631d3500008bf84f8) >>
+>> endobj
+2752 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [287.794 135.105 387.201 146.009]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2753 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.649 135.105 496.056 146.009]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 111.195 223.116 122.099]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af98013213e01ca8514b6dbd20116af4d) >>
+>> endobj
+2755 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.932 111.195 326.339 122.099]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2756 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 74.333 317.601 85.237]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a3e07a3e1a6e6c9f281227b4e215a3dc7) >>
+>> endobj
+2757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.417 74.333 420.823 85.237]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2763 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2767 0 obj <<
+/D [2765 0 R /XYZ 89 770.89 null]
+>> endobj
+2768 0 obj <<
+/D [2765 0 R /XYZ 90 700.763 null]
+>> endobj
+2769 0 obj <<
+/D [2765 0 R /XYZ 90 674.407 null]
+>> endobj
+2770 0 obj <<
+/D [2765 0 R /XYZ 90 648.504 null]
+>> endobj
+2771 0 obj <<
+/D [2765 0 R /XYZ 90 622.602 null]
+>> endobj
+2772 0 obj <<
+/D [2765 0 R /XYZ 90 596.699 null]
+>> endobj
+2773 0 obj <<
+/D [2765 0 R /XYZ 90 570.796 null]
+>> endobj
+2774 0 obj <<
+/D [2765 0 R /XYZ 90 544.893 null]
+>> endobj
+2775 0 obj <<
+/D [2765 0 R /XYZ 90 518.99 null]
+>> endobj
+2777 0 obj <<
+/D [2765 0 R /XYZ 90 481.132 null]
+>> endobj
+2780 0 obj <<
+/D [2765 0 R /XYZ 90 396.45 null]
+>> endobj
+2782 0 obj <<
+/D [2765 0 R /XYZ 90 300.808 null]
+>> endobj
+2784 0 obj <<
+/D [2765 0 R /XYZ 90 251.991 null]
+>> endobj
+2785 0 obj <<
+/D [2765 0 R /XYZ 90 226.089 null]
+>> endobj
+2787 0 obj <<
+/D [2765 0 R /XYZ 90 188.231 null]
+>> endobj
+2789 0 obj <<
+/D [2765 0 R /XYZ 90 126.462 null]
+>> endobj
+2790 0 obj <<
+/D [2765 0 R /XYZ 90 89.6 null]
+>> endobj
+2764 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2863 0 obj <<
+/Length 2117      
+/Filter /FlateDecode
+>>
+stream
+x��[Ks����W��*
�
3 at r��Vʎ�J�
v�XX"�� 
��ҿ>= 	P�\�k_D������_������?F_?�nn%v|�
*��G�ǎ�>r��pލ%�|x��a�C�0I�}��O���p��}�0�eD�+�3�E�s�ѻ�Y���
���9�z�����ڹ�k�-+���5�u<`Mp��Qx�� B
#�ɢ"�'S��q�(vnn}�7�q�ɒ��W3�I�!�I9$0���s��Ǐ�6^T+��Uh
��W��v��'y<�	7I���A
L
/՟pQNn��QR�!]��#�����R
+��V�+x�0E��)�3n����m�r�M]��U��J���j��
�XN���.Y�V�"K�Y��zf6:���a5�=v�Iʚ�<��A��N��k�
+3���
3p�n)��33�!�|��8�Hc�Z�
�O��ë)�S�'*����l����g�N*�䞙z�s��7�&��(���&��9�8~��y����*��
+
+��c`��c��
w���P��A�"
�t
%�z�<����
�`�0�ςz�
�ϐ��˓9�o*V�I͇
��yX�Z,��,��I�;�U#�	qǥ\`I�@~��y
*%�����./�Ms���9j[
�]�b����
�_�V[�-�m���
�̲�� ۓɡ�A��_
���*�
�ƫBB7�Ab �@�'W�5
�o�L��c|H��B�c�1���Xd��F�d���x-/�@�w��#r��D�^�
���6�"p��'q�"n�u��΃&@�Hvqh�K�.A
������?�:�<�}
+�|L/�=Fڰ��su�v�u�i
+��3����4@<6�W� (�
"�\j���A*®�?f�9~��!H<e��3��b��)3Y"�i
Oq��H�2yD �ߕɣI��L^6�����8�=G����O����]��z���"Hۼ*Q��#�EW��"&�P1̭+dWƗ�S^��O0��
Px1�8�/��6G�H�=z�NH`ڕ$^�+}̜���U�x9"�w���k�V�
+�Fө��5���+�I|>4U�>�$��q�C�@�c�)Y��0�C}70
�<Z��qR���>J�s�Uߩ�����6�0�0�"�O'ʙH�
�bT�o�W'
��,����=�@R��u�q���{~�^^0Q�$s��m���L��}�(���*m���'�@��CJK��:����!��
VX�V�t-��/���
'j��qB��c�i���s��&,�Ǥ�ī�s���)���C<%mVj)y|�
��>a99�D 7�ΣM��
w3헕
�P�u��S�g�(t��V}�0�ޝU�
dK\�稓�
��A��4��&�l/��F*ҚE�yyGD�����Ԯ���6���$�x
+'��F���P�I�2�ކ�6���
+`�4ɣ"z��F`M^��dZ�S*!������
�&��A"J�Սm#0Y%���#N�p��zCU
:���ԍ4ڴ	^����}<D{�,
pn�1��Q����+X y�K�"ڄ�p
���1\:��̅����ц a�
������[/{1‚���PH	<)��I��< �|�]���3�g@�
5%�k��am���1��n=I�܋�m�\�qU����B�����J.�b��md�T�d��\�*_�ZT�Nj[0@��(j
sǕ��nql���\��eE�)��X�� �`��%�\&���r���#�@�
9�0j	b��	�kr���il��sb�n�Q$��v�|%k@��v�n�J���>��'
��Q���
�
�B���T_���-J�
vϪs�:9��K��+f.k�W
2�����)���f��P�ԡ�C��D .�eye��B6 �@gIT�	bZe!����ٺ�
�EX��kW�>�8N��d[�0�-
�� E��f�M����E�/#W��T����,��7�m��M�jrS�7�	�y�MRfH�E�X<
�_.��S�������|���m����j磂aeL�
��_&�;����x[�[eo���¬�('��Y��_c�>,������-�S���}�}�D�1��"������p�D�dsl���RB$X��1���M�UY���
�H��l7��
+endstream
+endobj
+2862 0 obj <<
+/Type /Page
+/Contents 2863 0 R
+/Resources 2861 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2540 0 R
+/Annots [ 2758 0 R 2759 0 R 2760 0 R 2761 0 R 2762 0 R 2794 0 R 2795 0 R 2796 0 R 2797 0 R 2798 0 R 2799 0 R 2800 0 R 2801 0 R 2802 0 R 2870 0 R 2803 0 R 2804 0 R 2805 0 R 2871 0 R 2806 0 R 2807 0 R 2808 0 R 2872 0 R 2809 0 R 2810 0 R 2811 0 R 2812 0 R 2813 0 R 2814 0 R 2815 0 R 2816 0 R 2817 0 R 2876 0 R 2818 0 R 2819 0 R 2820 0 R 2878 0 R 2821 0 R 2822 0 R 2823 0 R 2824 0 R 2825 0 R 2826 0 R 2827 0 R 2828 0 R 2829 0 R 2830 0 R 2831 0 R 2832 0 R 2882 0 R 2833 0 R 2834 0 R 2835 0 R 2836  [...]
+>> endobj
+2758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 695.923 303.375 706.827]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a01daecb5bf8e498e7d539d7f3ba8496e) >>
+>> endobj
+2759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.19 695.923 406.597 706.827]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 632.839 267.39 643.743]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5a9b061c4408ab8d70a1dea91a6ff983) >>
+>> endobj
+2761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.206 632.839 344.6 643.743]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.042 632.839 455.025 643.743]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 606.779 274.015 617.683]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a191744753f79b939c8d61efe45778bd8) >>
+>> endobj
+2795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.831 606.779 351.225 617.683]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.667 606.779 468.276 617.683]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+2797 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 580.719 271.265 591.623]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a2f80d4608b0b75948b50dd862a14df66) >>
+>> endobj
+2798 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.081 580.719 348.475 591.623]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2799 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.917 580.719 493.221 591.623]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.747 554.659 279.532 565.563]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8abb894f6f4a673d549aa9bf7456b638) >>
+>> endobj
+2801 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.989 554.659 358.384 565.563]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2802 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.519 554.659 513.996 565.563]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 543.077 129.857 553.608]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2803 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.909 516.644 311.644 527.548]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14) >>
+>> endobj
+2804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.263 516.644 390.657 527.548]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2805 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.157 516.644 513.996 527.548]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+2871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 505.062 129.857 515.593]
+/A << /S /GoTo /D (group__Datatypes_ga84f27605574583d674403f6d71a73a24) >>
+>> endobj
+2806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.946 480.621 316.307 491.525]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af818756f74f766dfb937e586565db8d6) >>
+>> endobj
+2807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.963 480.621 393.357 491.525]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.513 480.621 513.996 491.525]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+2872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 469.04 134.838 479.57]
+/A << /S /GoTo /D (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) >>
+>> endobj
+2809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 444.599 298.383 455.502]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad024f037803a208b74cd150eeaa5649d) >>
+>> endobj
+2810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [302.199 444.599 375.593 455.502]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.035 444.599 486.018 455.502]
+/A << /S /GoTo /D (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) >>
+>> endobj
+2812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 418.539 305.009 429.443]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8ffc5459233ed9781c0ca910e88fa1f9) >>
+>> endobj
+2813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.824 418.539 382.219 429.443]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.661 418.539 499.269 429.443]
+/A << /S /GoTo /D (group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) >>
+>> endobj
+2815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 392.479 301.661 403.383]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a0b031bedcfb70f485bab922596bce1c8) >>
+>> endobj
+2816 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.879 392.479 378.273 403.383]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.639 392.479 513.996 403.383]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 380.897 134.838 391.427]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+2818 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 354.464 308.286 365.367]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac655ac3a494c4f92bb02d0b9294bdd85) >>
+>> endobj
+2819 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [311.504 354.464 384.899 365.367]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.265 354.464 513.996 365.367]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 342.882 134.838 353.412]
+/A << /S /GoTo /D (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) >>
+>> endobj
+2821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 316.448 285.103 327.352]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af92f3c9d758e2a155a2a6faec4235741) >>
+>> endobj
+2822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.919 316.448 362.313 327.352]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [372.774 316.448 472.18 327.352]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 290.388 291.191 301.292]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a784570f6ced5461b4d82cdfefa1cb31b) >>
+>> endobj
+2825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [295.006 290.388 368.401 301.292]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.861 290.388 478.268 301.292]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 266.321 278.747 277.225]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a7918c3a73aed2529e1e57b8983264bad) >>
+>> endobj
+2828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.563 266.321 355.957 277.225]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.418 266.321 465.824 277.225]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.787 240.261 332.246 251.165]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9fb38e66323fe6cb24b32e32e66dba78) >>
+>> endobj
+2831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.742 240.261 409.137 251.165]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.023 240.261 513.996 251.165]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 228.306 134.838 239.21]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 191.287 286.209 202.191]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_abc350d1ab1c6e4da0df6bb130364af7b) >>
+>> endobj
+2834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.024 191.287 363.419 202.191]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.88 191.287 473.286 202.191]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 165.227 317.202 176.131]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aad69d01217b9ea1043883162d285505c) >>
+>> endobj
+2837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [321.018 165.227 394.412 176.131]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 139.167 328.221 150.071]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_adb06752e755290368c9bb00ad14a0984) >>
+>> endobj
+2839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.439 139.167 404.833 150.071]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.2 139.167 502.556 150.071]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.351 113.107 333.94 124.011]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8402fc25b68056511cf62f1378666a88) >>
+>> endobj
+2842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [339.001 113.107 412.395 124.011]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2843 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.64 113.107 513.996 124.011]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2860 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2864 0 obj <<
+/D [2862 0 R /XYZ 89 770.89 null]
+>> endobj
+2865 0 obj <<
+/D [2862 0 R /XYZ 90 711.269 null]
+>> endobj
+2866 0 obj <<
+/D [2862 0 R /XYZ 90 647.996 null]
+>> endobj
+2867 0 obj <<
+/D [2862 0 R /XYZ 90 622.125 null]
+>> endobj
+2868 0 obj <<
+/D [2862 0 R /XYZ 90 596.065 null]
+>> endobj
+2869 0 obj <<
+/D [2862 0 R /XYZ 90 570.005 null]
+>> endobj
+2873 0 obj <<
+/D [2862 0 R /XYZ 90 459.944 null]
+>> endobj
+2874 0 obj <<
+/D [2862 0 R /XYZ 90 433.884 null]
+>> endobj
+2875 0 obj <<
+/D [2862 0 R /XYZ 90 407.824 null]
+>> endobj
+2877 0 obj <<
+/D [2862 0 R /XYZ 90 369.809 null]
+>> endobj
+2879 0 obj <<
+/D [2862 0 R /XYZ 90 331.794 null]
+>> endobj
+2880 0 obj <<
+/D [2862 0 R /XYZ 90 281.667 null]
+>> endobj
+2881 0 obj <<
+/D [2862 0 R /XYZ 90 255.607 null]
+>> endobj
+2883 0 obj <<
+/D [2862 0 R /XYZ 90 206.633 null]
+>> endobj
+2884 0 obj <<
+/D [2862 0 R /XYZ 90 180.573 null]
+>> endobj
+2885 0 obj <<
+/D [2862 0 R /XYZ 90 154.513 null]
+>> endobj
+2886 0 obj <<
+/D [2862 0 R /XYZ 90 128.453 null]
+>> endobj
+2861 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F93 336 0 R /F60 176 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2943 0 obj <<
+/Length 2802      
+/Filter /FlateDecode
+>>
+stream
+x��[K������-d�wvޏ�
�Jٱ�
k���b��eB4������
@ċ�d�
$b�A�L����

l
���/�w�
2���q

(n���W��)D���`�g��n���Y�{y����Y�,�p3��ϾO���W���x
c�8E83���
������;S�q*R:X��޼�A�0bF�A��S������ﰟ=�\��\!
+I�C�q+yKa%Vyy[��^���I�O��
7~V�8̿X�_3�7\ϩ��Ř&�b�7qS*'�
�)�)2�� j��ꙗt�#���$�Z/�։<�ن�9dz�Vi��{;0ЈK
܃	�Ά?n�8<.��p8ƙS��i�.�Qe�U}�ƕ=W�8��%F`OR�P�>���j��œ�(�f���B���I�N���yh��]�Pz4��V��+�.��4���wxrC�1R”C�r�C0�&�&>B����m\8rgbW`�9S3gY?Ŵ1������8r'���6\�b�<T�P#&�$QX�}�B�G5�7*�;Z��7-0�
FȈ�����[;�b�
��
�i�������n:�2=%Q
��8��S��
xl|8bp
�?xo
��w˾���">FJ<�K7F
H�q_�AV9�uD1�(�P �rH���Ps�g��?��[p	��ޠ��6r�|B��
!�'����?e(^�u^���
�m�5L�
�3�
�`�bj��5��
(�	$�sE)��(�D��T$���s�� 
+ �q�2r3#`���,
+*��~bo1����.������\(_�0Ps�R
+���<]�
n�* �xp1쬶n9�
��
�
��\���FX�>���R�Z��i6�����i� �0���>�]L��?���/�(�OF!u
i�	K�
@gf��O�%�3��nR�p�i�:qk��I"�@
�<�i�5\i�k!��E
�A^
��J�o9�v��

�����߃�0-�
+��=x-"T�:��$��I*����Hx�>+^�n�� ���
���
	L[
7	�
<Z�1X5g�	���eǔd���v
+�x���1M�n�89�u�e�Q�����
�x�k<k�j��]���cØކ�VjF[�x��.ih��'����

Q;��� )����
�5a
N��n��k@k�8ȫø[��-'��p����:�W�/a����H$4��������
+�9Qd������v��e�a�O
Ҕ�!���l���@� 7Lv#!�r��������S�ٶ�{fS/���wѶ��
+ RZ%a�fi���\��e�Lw�f��Ҩ̽�/-�H(E�T����e�0�*�3PEz���O�{r]E���.�N&S�P1�ķ~�'-Ŕ/��;A>�
�9F���]�l��A��N��V� )�ܠ�!��WC~��e繴"��PG�����w"?�i���l�%2�1�D~`��
!����
xac6��(-4$qe�����o
��)���ul��(؁�3�~�m�~�m��
t��M.�+u�_잲��)��4��n�һ���t���A�}�,� 0���
+`�[�
+�#yU7�

�����kݨ���&G�ݥq��
�ҸiptY���y�
]^���Ui�
st[[��s����12��s̻Q����hTj���fq����I:�(��/D���.��
	�����u�Z���)fꬖu�Z�:Y-�Êx�Բ&����
*��Njad�Բ+R�F�Z j�r�$���B�EJ[
�
)���92T�`R��I5����N��N�ZH�_R����4ڮ_���LݫW����_����Կ�~}�
�=�no;I�})æ�_q�5�0���p�em��D�
>��R��2�}�ˁ`)g��q\�1*g��it$�9�I�ڐ,�݁}��z~:�b?��f�g�0x  �6�@bX�+\m�WJ!�-��C�?k�̊����U@�=�梼�ڳ�0qK?,]�C�]��K1�yXԱ���V�-Vۤ��i�Q�m��>�I٦������a`��}˷m�-�##��զ�Қ}3=2
�p�Ƣ��Ĥ@����Ef��,��I�d���"L�E�_��uH���9� iӅzM��`�v~����E�~
EY[�`Z�JQ��T�ER4�w�R-%������agڥY�V8��Ѿ�PxDcT5�rO#�Q��� ���z�W���J��S���A���|8������-trC/J��}��O�϶l:N�B(�Gp;q�zu����ϳ�/����gJ&�(
B�Qm�0*�� �K5{��b'�
f [...]
'
+�"e��
���m�RCHU���ƜR�5�Z��lU	r�y�����%�m)
��*\�l8����
+Y����.��x�ֲ���n-˷�wN����6�2����}��^���ԟ�z��6I��)=���dD�<���M���t ���{��
+��L��V"�$�)�$نJ�� |�l�N֢�� ��[*���e,�aX���lS�go��Rk��dv:I7� ;�Vq��O;7��I~:&~���ˀle��AQ�Z/vΨ��o�vq
�X�.ޝp4�a�)��~�X~��
��K��(��l�������c�lN����K�
������?�O{�� ��B_������x6
A�p���H�Y�y����;(��f�1�b�������)�~xX�6�s�J���q�Y)�����e�e�
˯�]RQ�B����H)ii50��wab?�#.��������{|���8R�_1��
+endstream
+endobj
+2942 0 obj <<
+/Type /Page
+/Contents 2943 0 R
+/Resources 2941 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2960 0 R
+/Annots [ 2844 0 R 2845 0 R 2846 0 R 2847 0 R 2945 0 R 2848 0 R 2849 0 R 2850 0 R 2851 0 R 2852 0 R 2946 0 R 2853 0 R 2854 0 R 2855 0 R 2856 0 R 2857 0 R 2947 0 R 2858 0 R 2859 0 R 2890 0 R 2891 0 R 2892 0 R 2893 0 R 2894 0 R 2895 0 R 2896 0 R 2897 0 R 2898 0 R 2899 0 R 2900 0 R 2901 0 R 2948 0 R 2902 0 R 2903 0 R 2904 0 R 2905 0 R 2906 0 R 2907 0 R 2949 0 R 2908 0 R 2909 0 R 2910 0 R 2950 0 R 2911 0 R 2912 0 R 2913 0 R 2914 0 R 2915 0 R 2951 0 R 2916 0 R 2917 0 R 2918 0 R 2919 0 R 2920  [...]
+>> endobj
+2844 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.783 707.957 262.173 718.861]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a9563155e281915a8bc2eea34ceff9cf0) >>
+>> endobj
+2845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.666 707.957 341.06 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2846 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.276 707.957 443.633 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2847 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 707.957 513.996 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.002 210.095 706.906]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.767 696.002 320.261 706.906]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.592 671.813 273.704 682.717]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) >>
+>> endobj
+2850 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.006 671.813 351.401 682.717]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.937 671.813 451.294 682.717]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [469.942 671.813 513.996 682.717]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 659.858 215.076 670.762]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.749 659.858 325.242 670.762]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.506 635.67 300.189 646.573]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad015c9afd4968005d43f233359253c5a) >>
+>> endobj
+2855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.405 635.67 377.799 646.573]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.142 635.67 477.499 646.573]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 635.67 513.996 646.573]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 623.714 241.089 634.618]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.746 623.714 382.472 634.618]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.342 623.714 494.835 634.618]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.71 599.526 314.115 610.43]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6ffd595f3e1d85275962dde5f8401c7f) >>
+>> endobj
+2891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.534 599.526 392.929 610.43]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.98 599.526 495.336 610.43]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 587.571 253.821 598.475]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.693 587.571 398.419 598.475]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [416.503 587.571 513.996 598.475]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.922 551.427 313.211 562.331]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac0e5d09ffe586f8ea5ec782570015c5b) >>
+>> endobj
+2897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [318.843 551.427 392.238 562.331]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.767 551.427 495.124 562.331]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.124 539.472 262.12 550.376]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+2900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.641 539.472 422.367 550.376]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.964 539.472 513.996 550.376]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 527.89 134.838 538.42]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 492.369 323.519 503.273]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a381b0e6e2e58df417ff578ed6d715520) >>
+>> endobj
+2903 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.737 492.369 400.131 503.273]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2904 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.497 492.369 497.854 503.273]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2905 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.124 480.414 262.12 491.318]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+2906 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.641 480.414 422.367 491.318]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.964 480.414 513.996 491.318]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 468.832 134.838 479.363]
+/A << /S /GoTo /D (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) >>
+>> endobj
+2908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.376 433.311 345.428 444.215]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a46fc9d1041d5548a5f8f220af2a07028) >>
+>> endobj
+2909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.514 433.311 422.908 444.215]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.958 433.311 513.996 444.215]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 421.356 184.093 432.26]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.152 421.356 337.148 432.26]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+2912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.669 421.356 497.395 432.26]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 374.253 357.282 385.157]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6ff56c68b449b94588ea7290d01625d5) >>
+>> endobj
+2914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [360.5 374.253 433.894 385.157]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [448.26 374.253 513.996 385.157]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 362.298 184.093 373.202]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.152 362.298 337.148 373.202]
+/A << /S /GoTo /D (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) >>
+>> endobj
+2917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.669 362.298 497.395 373.202]
+/A << /S /GoTo /D (group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) >>
+>> endobj
+2918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 275.676 285.641 286.58]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac06aed22fa4405051df0da9e7bc16138) >>
+>> endobj
+2919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.457 275.676 362.851 286.58]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.312 275.676 472.718 286.58]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.181 238.536 351.58 249.439]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_add9c4afcd6f6bd78509219f32d57e348) >>
+>> endobj
+2922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.471 238.536 428.865 249.439]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.478 238.536 513.996 249.439]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 226.58 144.243 237.484]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.899 200.399 352.403 211.303]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a90544f38c2980f308cd6e0f9248fdd99) >>
+>> endobj
+2925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [356.013 200.399 429.407 211.303]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.478 200.399 513.996 211.303]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 188.444 144.243 199.348]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.118 162.263 315.801 173.167]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aa48f8ae0f3a2647949417ec2da1c97e4) >>
+>> endobj
+2928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.629 162.263 393.023 173.167]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.494 162.263 491.85 173.167]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.424 113.168 347.542 124.072]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741) >>
+>> endobj
+2931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.676 113.168 426.07 124.072]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2932 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [444.478 113.168 513.996 124.072]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 101.213 144.243 112.116]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2940 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2944 0 obj <<
+/D [2942 0 R /XYZ 89 770.89 null]
+>> endobj
+2952 0 obj <<
+/D [2942 0 R /XYZ 90 290.893 null]
+>> endobj
+2953 0 obj <<
+/D [2942 0 R /XYZ 90 253.942 null]
+>> endobj
+2955 0 obj <<
+/D [2942 0 R /XYZ 90 215.806 null]
+>> endobj
+2957 0 obj <<
+/D [2942 0 R /XYZ 90 177.669 null]
+>> endobj
+2958 0 obj <<
+/D [2942 0 R /XYZ 90 128.574 null]
+>> endobj
+2941 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F38 1605 0 R /F101 531 0 R /F99 1219 0 R /F42 175 0 R /F100 1218 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3013 0 obj <<
+/Length 2580      
+/Filter /FlateDecode
+>>
+stream
+x��ZKs�F��W�T�9�7��6��u�q��R{�],�H�� �e��o�O�$dR�T�A"0����|_wOc��v�����wW7�\��ȗT:w���
��HH���
�_���a�Cė�I�������ۻ����˻�߯<�1�r='L�>|�N�?91�s
�K��)�߭���_Wت��*ɾJ��HB�D�Q�#�B�ts>,Ƌ$�m�R�\[�~�/P!E�]�˷��8*�l�Ū*�0^EIgU�g�X���
|P�Xh=%�ؼ8�����J���"�
+W��D��OZ��!.=g	��0֩�?b�:�E�������'��/%�f戸
Q�1+��X��$^ԛX]�E�R�A~o��
x�%�4�ڸ�9Che.�ֶKn��"(�$ؚ��]�0
+�^2Nw��>0w�U
��G�i
���y0��i|3�4����-���͛W>뙃����
����(C�$�KAY^�
��X�0�6I�7�vTcI�@�FL61�b@�B��eWh��#� B>ճ�8;�6��
�)}-�,�g���K
5�Q�Py@�贔�!N��&^�O���XG�R��A�`�ǤD�EA4�\W4/,k
�nq�p�/Z��u�W���p�W����%�Zz�	e`v�� ���%^˱�oEdv{�v�8%�M�xT��Kϡ�����6:JT��ؠG>�Lg�A��L �*��n*l
�O��1<+����P��<2�~ʗ2��qX��s$��#
�z:*1�b�V�1��z�Q�gu�d*ب�If�ۮJ?���zBI��9w���
j�,��u7���@�.����<������+�{�TgɄ}�0~
���>"�����Rq
�s�x�B�qn'
:�hWl�0�c�
���	�-���3
x�Ċ
l���������>ȚQ�<��&{0�
 �;� [...]
W�|U��f��L���FT��4/��%>�Hr2$�;���)@���~=�@
�En�FUG�����(�
Y��_ ��
���Z��]�W�߼4�S�G� ��R �3/
4���Hg�2�^�� ���H
+� qq
s�u�%n�#�ȉ4
 �ܡ]΄�~a��\������@
�>J E_�,R�8�l�>����4�n�p��C@�l.
+�1H
 ���]�Dl3�F�hG�D!��]�5R�$���T"쳾ͧ6�
�L
2
����`om�*L�U�K�g�*���
u�\��zt������
b��u5L"�9�
�e=uP��h,*��t[ǝO�I�b�>���s�s�g�ѷ��\�p��ϟ
/�#G��a�{�$rT����s_^s���)Q^���M�9�$C�	�I���߭3�G
�sd}{MAS�b
n�
l�۷�z)��;��[@�֝
+�VcS���	�����
o�J�~�h�e0O>������:`���R���'C��ܨv��`,�b��y�)l2+%
�K���,�����90
a^ZTy�TS�m�+��	NU�Y�X�P�i
q�6Eq�IQ�����	�7�(��6
V�au;(��y��1��2��r��$�p�e�	|q�?%��
+5&µ�1�%U����؀b':����9���w�V�
���~�r�ܚ�1HU[�-�����Yݨw��k�3��
+UtT��	X��~f}`7�o��Yd�x(S)�f�����j�=C�h;���;4
�ٝY
+�e�:Ȟ!��n*QdY855�dW�(�kT>3�R��w�:�≮2�I�c��OO	�
�@�����cD+0�
���lT�|~�1�P�OK9usk~�HSm^!��)ZB��
+�ywM�z�VW
��|�1��w�z~�NM=5FC�ތ�kM���
�
Ӹ�(
�OG���V��+�P���|��"�
g|�=H[��;X�	�)1d��p�'��3�{�
+ �`�0O姂�7�2��
R���I�������\�'g^/�$�^�ԵI�'��t9N>�Ĉ|j��|��4���*�
��=u;���zO�׏{��{O�|�M9�
gX�;�Mʹ�T�N�?!ٔ&E�dSک��tS�c�j��������r�ͬ��!Jȩ�G�
+�M;e/�fN��v�&�lu�{�O���e���b
��gQ:q"˻P��=�1]�=�45F���>�������K��nP��M����, {���
�^�2���R��
+��]�����ʺ
+���"m?��G��mw&��̖{�sDD�:M�$M���#�EN�{�Y�����9��
��Ь��|�î1�\
��r�/8�SD�*�_�
(�\������8h;�Ч��o:����1$����a7��@���O���q���}ɑ/	�EnW��0F��������b3���:�ӹ�>c��F��.����a��6ܼN��C�:qK���6�%�]�o
,�7�v��7�wo̅���&�ֻ`m��V��U�ӊ�Uq�7uB���� ��3��_�Z�ew^6�E{
+������9Tg��v��T_Uh_w�#�NgS��w77�w�*��(��}W�uv]������;L�2n�DAc�cڣ��/��!�
+endstream
+endobj
+3012 0 obj <<
+/Type /Page
+/Contents 3013 0 R
+/Resources 3011 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2960 0 R
+/Annots [ 2933 0 R 2934 0 R 2935 0 R 2936 0 R 2937 0 R 2938 0 R 2939 0 R 3016 0 R 2969 0 R 2970 0 R 2971 0 R 2972 0 R 2973 0 R 2974 0 R 2975 0 R 2976 0 R 2977 0 R 2978 0 R 2979 0 R 2980 0 R 2981 0 R 2982 0 R 2983 0 R 2984 0 R 2985 0 R 3023 0 R 2986 0 R 2987 0 R 2988 0 R 3024 0 R 2989 0 R 2990 0 R 2991 0 R 3025 0 R 2992 0 R 2993 0 R 2994 0 R 3026 0 R 2995 0 R 2996 0 R 2997 0 R 2998 0 R 2999 0 R 3000 0 R 3029 0 R 3001 0 R 3002 0 R 3003 0 R 3010 0 R ]
+>> endobj
+2933 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.166 707.957 303.425 718.861]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aabb79ab0a7936b6f14cd20e15cb14fa8) >>
+>> endobj
+2934 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.3 707.957 380.695 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2935 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.272 707.957 479.629 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2936 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.843 661.365 310.694 672.269]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a81cc2a565346ce8ee12124224ddd8d6c) >>
+>> endobj
+2937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.246 661.365 387.641 672.269]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.61 661.365 485.966 672.269]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 661.365 513.996 672.269]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+3016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 649.41 195.719 660.314]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 623.971 301.661 634.875]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad6b383704ed3f314864c52f5b715cbbf) >>
+>> endobj
+2970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.879 623.971 378.273 634.875]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.639 623.971 475.996 634.875]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [145.299 612.016 228.656 622.92]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+2973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 539.877 240.282 550.781]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_af8a9392f205531631b3a98c332f594b1) >>
+>> endobj
+2974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.097 539.877 343.504 550.781]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 514.438 243.599 525.342]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) >>
+>> endobj
+2976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [307.459 514.438 406.866 525.342]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 489 248.581 499.904]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6b5c73b1f3f864c8a10c39810b4711ce) >>
+>> endobj
+2978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.92 489 401.327 499.904]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 463.561 254.668 474.465]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a658545ec6169d2843323bfe1ff078e6f) >>
+>> endobj
+2980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.483 463.561 357.89 474.465]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 438.122 249.128 449.026]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aaffebaba13f6fc73438bdccde0966547) >>
+>> endobj
+2982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.944 438.122 326.338 449.026]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 351.039 339.589 361.943]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad9547cb6430722246dea7f5a70566c06) >>
+>> endobj
+2984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.807 351.039 416.201 361.943]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [440.53 351.039 513.996 361.943]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+3023 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 339.084 169.159 349.988]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+2986 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.868 304.447 349.194 315.351]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a3bc82e8c76e1a47ecc20c85e1003036d) >>
+>> endobj
+2987 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.772 304.447 426.166 315.351]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.142 304.447 513.996 315.351]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+3024 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 292.492 169.159 303.396]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+2989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.935 257.855 356.401 268.759]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a7573064b44c45d804d398aec02e7a64a) >>
+>> endobj
+2990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.046 257.855 435.44 268.759]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 257.855 513.996 268.759]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+3025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 245.9 208.989 256.804]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+2992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 211.262 363.22 222.166]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a0184ad10aeca27f95d249d3a7e061b46) >>
+>> endobj
+2993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [366.438 211.262 439.832 222.166]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+2994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.161 211.262 513.996 222.166]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+3026 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 199.307 169.159 210.211]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+2995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.184 164.67 267.458 175.574]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a6137f367c0c83a73146d84c998d37cb3) >>
+>> endobj
+2996 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.352 164.67 370.758 175.574]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+2997 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [386.376 164.67 513.996 175.574]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+2998 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 127.276 314.383 138.18]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5e7090393ee5801d9c988db6d2a06a43) >>
+>> endobj
+2999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [317.601 127.276 417.007 138.18]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.374 127.276 513.996 138.18]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+3029 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 115.321 169.159 126.225]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+3001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 89.882 265.716 100.786]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aea399d3df97c711c758c8bf715e0c763) >>
+>> endobj
+3002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.532 89.882 342.926 100.786]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3003 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [358.368 89.882 451.668 100.786]
+/A << /S /GoTo /D (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) >>
+>> endobj
+3010 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3014 0 obj <<
+/D [3012 0 R /XYZ 89 770.89 null]
+>> endobj
+3015 0 obj <<
+/D [3012 0 R /XYZ 90 676.516 null]
+>> endobj
+3017 0 obj <<
+/D [3012 0 R /XYZ 90 639.122 null]
+>> endobj
+3018 0 obj <<
+/D [3012 0 R /XYZ 90 554.839 null]
+>> endobj
+3019 0 obj <<
+/D [3012 0 R /XYZ 90 531.284 null]
+>> endobj
+3020 0 obj <<
+/D [3012 0 R /XYZ 90 504.151 null]
+>> endobj
+3021 0 obj <<
+/D [3012 0 R /XYZ 90 478.712 null]
+>> endobj
+3022 0 obj <<
+/D [3012 0 R /XYZ 90 453.273 null]
+>> endobj
+3027 0 obj <<
+/D [3012 0 R /XYZ 90 179.821 null]
+>> endobj
+3028 0 obj <<
+/D [3012 0 R /XYZ 90 142.427 null]
+>> endobj
+3030 0 obj <<
+/D [3012 0 R /XYZ 90 105.034 null]
+>> endobj
+3011 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F100 1218 0 R /F24 173 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3088 0 obj <<
+/Length 2947      
+/Filter /FlateDecode
+>>
+stream
+x��\mo����_!ܗJ at L�;w�~i��]�W4��(�$0d����)E�c���3��7/E:�71��r�;;;��3�K��|DF?
�<>8z���I�bjt|>2d�
+�Hw���q�099����z�<y3ad�Z�^d�̈́��*?)���!�d�:/����,s�o�����r[D��TN>
�r���OD #꺔I�Gg��?��
���=���.G�q��
�;��x�I}�>
+J�D�)�	�n$s���F�%
k����̽Tom
�
�3�w:��̳<�L��f�n_�@$�l��\ka}�_��U�-N~
+������e������'���+-GT����D	::�,I�v���l�u�:u�V�[w�:w�
?�[+E��|B��P9FY�ު���Ω	N!q��}����'��P�X}y��ND�&i*B'님
$IKI��j[�xȌN4�Tx��=쑚�=n�3
���2�e���~�i��i���F�����Y2�0���򁬏 �Q��Y��2�Z��a�p
�'W���t�]�����p����^8h�ln�:
����ȼ�_����A-
�wX�L��ට�,fZL�4��H#2�fXT�D
�aM=�a��&�@$�D<�ؾ&��F�Č���u\�!z{b
���
ho�J���Fg���t�eQ�xO���Ore�-.�|��6n�YL���=p��_L�k��2��>�wv!mY~uy�ru�π

b}оP�H#�
�����g���3^g'���䬸�9�뉒�T������z�m�����X_�}��?LOq�����B�
+�-�t��	�[��Vh�#����9ƙ��+&jF�^����%�X	"1�\S볭��*Gc�f+���r��C�Y�~�Y
+/[Щ�}q�X-g/

�ڱv�,��u�y1��.��ፊ�����o��8�	�P�vs�3�4�[��TH�K]�� �[��ݹ{v�)������k�k����E>��,��9;C��l�]���gL,+�
+M���S�����@P[�n
���4�`��Fz��%��-agf<� �D�8f�>��c~��J= ��!���o�M���b��0
�Ᾰ8)V�;~'"†�CzA�N� D

:ᷗT8����:��рJ�=�X]χF�dk�W��� Ǥ�g�Ek޵*�Q�]�@'D��-��]�_X��(4X[���+
��O�O^��
��:\4�(Z�����
+�.��iI�l�1L��Wv��q)�3��`�
�
ȘR��=k��7f��Mߌ�o*!�
�o��
��Xj'aUf�X����9�t����%.P2�
L:N(�n6�Z���lM�wU[o�-����K�\�OW������\8��Y�)�uBo �����֐(��T�7 at Cڂ����b9=]f!8��	�C��o��=����"���np�v�։�{!���[A��B#)i��
��#
E��L���W!%Z<vP\����\+�\��E�C ��� �L+�u
ǖ��w#nmȥ�`��ڱD��9�^c}ƻB�B���
+��X kN� V3ޘj�
�r(�X�ū6�*Qժ���!��fj�O<��e
b�v���ز�(ĦU<e��+/��a��`1�o��މ��
́AK{��,��ڻr>�S�)�k
�����w7Ba
;�XV�u�*y�*Q��*y �P�r:7�
 ���J�q��,����l�Jh�d�
D=C���ӠZ�����
�BH�8�����s�v��`�Z
��V�כ�����!��!���p�Zl�����!
�
q�b��Zl�;�T�DS��ؠ�&����S�������/3���ٸ^..E6

Υ*����恟Z@�
?
\�}��Ɗ���l�'Da��o
>p�”�I�����Zi!�3-�v�
+�<���<=|�ֈ� �x��v��
+fB���N�W��0���
�*�9�:�!k�<-\�S���n� 5[̷�No}-�_��FBV(�qn���f�$�\���L���j�[xe�d����&I[�j^�4hEw��,5�e��t�f
�|
�h��N��	��X,��ng`��yJ�K�:Clu�������k~�������P�]��
'x��{�W�x4� ��3����t�(^|rR"vx:SB�	�j"�N�nOg�=�NO�E�ә��3-O�9Og���IWy:����pF���w�:�=�MZֆ��yWĆY��
C
kM�S�u\$T�'��R�p���Z����N�C��/8g�R�y����0�:Á?�j��g�
5�-�_$���de'��ж;"uwDځWpG$�#R?�Z	��H�*q�Wʋ3�0"
g�|�����g6�����]� ���C����Z�t�O����=v�@�nD�#�w �؊�j�<}���Jvh�H�H��4s�zy�{pL�|#�3A�aE��"`��;���D�FX��6��:��6��`E �R8QX������L��ϯ6��&���(�� `�7��z� ��U�#�6�ߙ�k��6���f�I
 T�F�K+�
k-����D�PY��DT��T�;��@�Sb{�� [...]
+
$K
���݄����=uݵ�U;�O^�3�N�Y�gҧ��?�jK܎�w�x�V�jt��م��Գxp�x���Ń� E��
�Ųx���CE��Y�r����u��ڿ���eƇ��F�-
�H at 4�� =����@K߼��]����:��W�yV�1�����l󇉔����Os��Y*�

~��
+!�Yo2��
�
�z��O$� ��������Ԁ�u��X�����j���yr�>k����4M�*��� ��j2�9���I�E��sIh�
Z�: �����ծ���/8z}�GY�dT?u�_=���
+endstream
+endobj
+3087 0 obj <<
+/Type /Page
+/Contents 3088 0 R
+/Resources 3086 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2960 0 R
+/Annots [ 3004 0 R 3005 0 R 3006 0 R 3007 0 R 3008 0 R 3009 0 R 3036 0 R 3037 0 R 3038 0 R 3039 0 R 3040 0 R 3041 0 R 3042 0 R 3043 0 R 3044 0 R 3045 0 R 3093 0 R 3046 0 R 3047 0 R 3094 0 R 3048 0 R 3049 0 R 3050 0 R 3051 0 R 3096 0 R 3052 0 R 3053 0 R 3054 0 R 3098 0 R 3055 0 R 3056 0 R 3057 0 R 3058 0 R 3059 0 R 3060 0 R 3061 0 R 3062 0 R 3063 0 R 3102 0 R 3064 0 R 3065 0 R 3066 0 R 3067 0 R 3104 0 R 3068 0 R 3069 0 R 3070 0 R 3071 0 R 3106 0 R 3072 0 R 3073 0 R 3074 0 R 3075 0 R 3108  [...]
+>> endobj
+3004 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 707.957 269.592 718.861]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a612142029eeee3dd72bb0d37c670d6db) >>
+>> endobj
+3005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.407 707.957 346.802 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3006 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [362.244 707.957 489.864 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) >>
+>> endobj
+3007 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 684.534 307.569 695.438]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a841ceef027f12d5c99fc2e739ae340fb) >>
+>> endobj
+3008 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.787 684.534 384.181 695.438]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.547 684.534 500.155 695.438]
+/A << /S /GoTo /D (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) >>
+>> endobj
+3036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 649.908 276.814 660.812]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_aad3749930a51c38886b1d5a01dbbba92) >>
+>> endobj
+3037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.63 649.908 354.024 660.812]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [364.485 649.908 463.892 660.812]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 626.484 301.442 637.388]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a06c7c974043c12bcf349c119e73cc681) >>
+>> endobj
+3040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.258 626.484 378.652 637.388]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.113 626.484 488.519 637.388]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.925 603.061 189.72 613.965]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5eeb3bf2e0ec7e6cd38e47b53eb43423) >>
+>> endobj
+3043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.355 603.061 266.749 613.965]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.866 603.061 365.222 613.965]
+/A << /S /GoTo /D (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) >>
+>> endobj
+3045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [422.898 603.061 513.996 613.965]
+/A << /S /GoTo /D (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) >>
+>> endobj
+3093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 591.106 209.299 602.009]
+/A << /S /GoTo /D (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) >>
+>> endobj
+3046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.248 591.106 425.496 602.009]
+/A << /S /GoTo /D (group__Datatypes_ga6b8429baa2a70746836586aad6905b64) >>
+>> endobj
+3047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.819 591.106 513.996 602.009]
+/A << /S /GoTo /D (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) >>
+>> endobj
+3094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 579.15 227.002 590.054]
+/A << /S /GoTo /D (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) >>
+>> endobj
+3048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.249 579.15 393.552 590.054]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.632 533.566 372.328 544.47]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a69c0a9ffd5b8910a90a91943a10fe3b6) >>
+>> endobj
+3050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.67 533.566 451.065 544.47]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 533.566 513.996 544.47]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 521.61 180.776 532.514]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 476.269 350.826 487.173]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a1e5a2940765710cccea4ef4f1b7f1092) >>
+>> endobj
+3053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [354.044 476.269 427.439 487.173]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.823 476.269 513.996 487.173]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 464.314 134.838 475.218]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.88 418.973 316.987 429.877]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b) >>
+>> endobj
+3056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [320.577 418.973 393.971 429.877]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [404.026 418.973 503.432 429.877]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.106 384.59 297.836 395.494]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a88c408677f6de73fd80903738268efa3) >>
+>> endobj
+3059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.651 384.59 375.046 395.494]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [385.506 384.59 484.913 395.494]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 350.208 418.761 361.112]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a977522267df419dd5f2824ce6c0f7610) >>
+>> endobj
+3062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.979 350.208 495.373 361.112]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [504.758 350.208 513.996 361.112]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 338.253 211.769 349.157]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.582 338.253 350.886 349.157]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.887 292.911 400.763 303.815]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a96eaf729b170b6df69bc2d1127f8727c) >>
+>> endobj
+3066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [405.36 292.911 478.754 303.815]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.973 292.911 513.996 303.815]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 280.956 206.788 291.86]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3068 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.601 280.956 345.905 291.86]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3069 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 235.615 365.172 246.519]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a88a7c177ebe33a3d41609609660fd3ee) >>
+>> endobj
+3070 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [368.39 235.615 441.784 246.519]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3071 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.169 235.615 513.996 246.519]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 223.66 134.838 234.564]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3072 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.651 223.66 273.955 234.564]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 189.277 345.795 200.181]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ac78c1168665c72eaf8c2457b12700fba) >>
+>> endobj
+3074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.013 189.277 422.407 200.181]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [431.792 189.277 513.996 200.181]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 177.322 134.838 188.226]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.651 177.322 273.955 188.226]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.568 142.94 425.899 153.843]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a875b11e85fe96586152f53f498158b1f) >>
+>> endobj
+3078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.177 142.94 503.571 153.843]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 130.984 224.501 141.888]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.314 130.984 363.618 141.888]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3085 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3089 0 obj <<
+/D [3087 0 R /XYZ 89 770.89 null]
+>> endobj
+3090 0 obj <<
+/D [3087 0 R /XYZ 90 721.073 null]
+>> endobj
+3091 0 obj <<
+/D [3087 0 R /XYZ 90 664.555 null]
+>> endobj
+3092 0 obj <<
+/D [3087 0 R /XYZ 90 641.132 null]
+>> endobj
+3095 0 obj <<
+/D [3087 0 R /XYZ 90 548.213 null]
+>> endobj
+3097 0 obj <<
+/D [3087 0 R /XYZ 90 492.643 null]
+>> endobj
+3099 0 obj <<
+/D [3087 0 R /XYZ 90 435.346 null]
+>> endobj
+3100 0 obj <<
+/D [3087 0 R /XYZ 90 399.69 null]
+>> endobj
+3101 0 obj <<
+/D [3087 0 R /XYZ 90 365.308 null]
+>> endobj
+3103 0 obj <<
+/D [3087 0 R /XYZ 90 307.559 null]
+>> endobj
+3105 0 obj <<
+/D [3087 0 R /XYZ 90 250.262 null]
+>> endobj
+3107 0 obj <<
+/D [3087 0 R /XYZ 90 203.924 null]
+>> endobj
+3109 0 obj <<
+/D [3087 0 R /XYZ 90 157.587 null]
+>> endobj
+3086 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F85 267 0 R /F93 336 0 R /F24 173 0 R /F101 531 0 R /F100 1218 0 R /F104 1604 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3123 0 obj <<
+/Length 2980      
+/Filter /FlateDecode
+>>
+stream
+x��[[w۸~���[�s"7�/�w���6�&�K�
Z�mv%R!�8�����7Q���9۞��$Apf0��� �����v���������$�����,�3-+xZ��EZ�?\�4��(�ȶ^�����.�⻳.�>�1xEg�}mf��ٻt���f����
l��Lr����ٯgԛB�&��I�i��
�a����*���-bJ��h|3S�z�����h�]_�.׏w٪*����Xe��ur�͙�>7sU�\�M
Һ�o������j���FYQ�U
*��4�{u��6�x���ۙB
;�Hef
�G��!W˲���*xL�ǹ��j���]��*�^�}��l3-tY?�ۛ�������
.{�ȵ!T�!��S*\��TK��4[p)(
��&/$JI�l�!<���H���/o�*���.��w�\�QY8����Q�Ħ
�G�c�I�����v��W
��m��k�x(+w�}�O�ޚҎ�v���-c
+b����i1&���HT䂷�'�JA$3���G��
�x�WY��n(�̈́t�zO	_���L
�����I��'&Gv�S4Y��Zg�&�
����*��
��n�p� 
fDP��'L`���W�8�i5�RC�`����^��ۖ�(=�b&�Z|Q`���}*�0ء���@=€c~b��ڻOQo�b�Rh��#4�7�^7e�q&2��U�P�+*t��f�
˧)A���*��(8T�NՄ�

�p
��('��Xw/�d�_�B�IŜ��l)��>!�s�Y1��
,n
*=d��֣�N�"�rd��k��6�a��q
om\OF��kj\�rX&�
��u���[T}9�6�H);��JeN�6�b��(wㆂ-�vtpg��Ę��`]�^��O6�PL�)��*[���U��t�+��^J�"�έ��������B����iGt��)����:�uB$D���u�"�
�=XO��(D��av��cv�|�/*���@�v�����29����

��%t�x�AL�X��$a:.�#\���G���aL�ꗍ~���tǹ��r.���Kt�

+�K6�Os��wk�c�U�
粊�2�V�9W7��^�@�`�m-���J	��MF�j�.��t#?�'8q,�~�>����h�	� �>�%��0��$a#�%��Ct,:ɀN�q�v�K�=��C����.;�I����p־��o��d]	ᇗ�#�u�&P�N��,�O��
�(���
%
�{�7���3�wr������ʗ���Wط
���
�oP�
��W��@>h���F�%�(�u�@��3%��>s �Ϡ���^���zY�[D�C<� `U{��s��jw
��don�%���7.�@��fUn ��k�Kp�Iy�ʷ@΁��
tõtI�C�8{b�����FT�,�[+oz�G�o�T�㫠�?V%��H1��P���X{����`�I��HM�\fum1�K,?��4���"�
U��,�e��&
�H|�P�����A�:
դU��������ɱ�w�BS�

/Vy��Ώ��:k
��p�/FV�tN
��Y
+0ن$ܕZ�w�6j�7j�Ηy��Mڄ/
͝�9��?[��t�
)
��=
+�*m.�Ք@
+��->��L
��m+�q�rQ?��>٣<�*
4n�������{\ò�'C?�,js�
qk��=�TLh���_���j��Pjb8{��P���
�1Z���	�`�����%D�
�$�U��t�!�}��D�D�*���JW,�O#h¹pw��‹sE�b�7�J!�e���˿��̦#h����˻���V��@Z!����l��J���X���@Ѐ��5m��eF4ڔu���u�V��w�T�c�>��Vd^�v�Cf���M�YC�m_]{���e��w�K/��B�
�*�u����f
�y�Ύ�9%
Ѣ�p�#܋*ϊU� G�7��W
xxqʗ�ri����ІM_k���~���j���ϸf�Շ~�In��������>���<����5���aB���$0�S(����*��PiQ�4c5�(�3���G��V�,�2�vp�� �S���$c3n��̈́��0��+’�I�sʼn���)TB
V����`���vXz*1�#�
FZ%�J [...]
+�/+�� ��ds<�<cYe�F���ժ��„�@� �b>�I�����M��+Vf
��I��|U6ٞmҡV� 4�2���_ �Xs��
�q-�_�)-�lu�ƪ����2h�\��@"�q�+gL2"��:.` +���.��>8�b�k�'��$4�'Qi�6���� '��fpX)R14�0P�$z�
+(6����aBuYqݸy
+�x�۝t�0߃�����}h�E�)84ɓp�^H�o��
O�܌AL��n����&��c�K~!rQ�+,�ȥ��e
4�P�]ۅ�
���@� �o<f���ӈ�q3ۖ�W�p�ô�
��Sx�;
��+�4�6=@3�tg� �L
hn�U*��RXU����G9��I��膻��ww����߱
V=�va����)�=
�h�[��U�$��=J
�����?
+`1��_
��%���4C)��/���e��7��܈��%��-@ޢ�O��qx k
(�����_�2�]�%-n��[���p���Yg՟�q
y>�w���q}�=Zu3�p[e
���f���1����3;c=�@b�����~w~~}[g�-Yz$T��c�^�ڵB�˾)�,
K�팝��Jq6
+endstream
+endobj
+3122 0 obj <<
+/Type /Page
+/Contents 3123 0 R
+/Resources 3121 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2960 0 R
+/Annots [ 3081 0 R 3082 0 R 3083 0 R 3126 0 R 3084 0 R 3112 0 R 3113 0 R 3114 0 R 3128 0 R 3115 0 R 3116 0 R 3117 0 R 3118 0 R 3130 0 R 3119 0 R 3120 0 R ]
+>> endobj
+3081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.629 707.957 406.582 718.861]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ab062917f016d95800e29f87c203fd3bb) >>
+>> endobj
+3082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [410.921 707.957 484.316 718.861]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [495.954 707.957 513.996 718.861]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 696.002 211.769 706.906]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.582 696.002 350.886 706.906]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [139.386 623.356 373.128 634.259]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_a5932fd0c6867d83e3a34d5e680225807) >>
+>> endobj
+3113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [378.224 623.356 451.619 634.259]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [464.961 623.356 513.996 634.259]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 611.4 180.776 622.304]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.589 611.4 319.892 622.304]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.508 549.713 351.873 560.617]
+/A << /S /GoTo /D (interfaceppl__Polyhedron__tag_ad4b80df36fc02b4c47ca160420e50182) >>
+>> endobj
+3117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [355.091 549.713 428.485 560.617]
+/A << /S /GoTo /D (group__Datatypes_ga97b246f11809448c53f089779c0019a1) >>
+>> endobj
+3118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [437.87 549.713 513.996 560.617]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 537.758 134.838 548.662]
+/A << /S /GoTo /D (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) >>
+>> endobj
+3119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [144.651 537.758 273.955 548.662]
+/A << /S /GoTo /D (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) >>
+>> endobj
+3120 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3124 0 obj <<
+/D [3122 0 R /XYZ 89 770.89 null]
+>> endobj
+3125 0 obj <<
+/D [3122 0 R /XYZ 90 721.073 null]
+>> endobj
+3127 0 obj <<
+/D [3122 0 R /XYZ 90 641.803 null]
+>> endobj
+3129 0 obj <<
+/D [3122 0 R /XYZ 90 566.434 null]
+>> endobj
+3131 0 obj <<
+/D [3122 0 R /XYZ 90 472.136 null]
+>> endobj
+3132 0 obj <<
+/D [3122 0 R /XYZ 90 312.393 null]
+>> endobj
+2572 0 obj <<
+/D [3122 0 R /XYZ 90 288.708 null]
+>> endobj
+3133 0 obj <<
+/D [3122 0 R /XYZ 90 288.708 null]
+>> endobj
+2573 0 obj <<
+/D [3122 0 R /XYZ 90 161.079 null]
+>> endobj
+3134 0 obj <<
+/D [3122 0 R /XYZ 90 156.596 null]
+>> endobj
+2627 0 obj <<
+/D [3122 0 R /XYZ 332.797 77.486 null]
+>> endobj
+3121 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R /F93 336 0 R /F101 531 0 R /F100 1218 0 R /F104 1604 0 R /F84 265 0 R /F72 198 0 R /F98 502 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3138 0 obj <<
+/Length 2398      
+/Filter /FlateDecode
+>>
+stream
+x��Zے�}���[�*���浝�c�6�I�a��ŕ8�*%S�����xE��:N��� x9
���t�4Y$4���W�7w��8�4���C�hb�#J��<y?1���-��Nv��ǷSN'���2�Sf'���!]Lo�����CV<��,��3{��=Yjb�����7����r���� ����ls��M���}B�p6y�7m�
�ɻ����z
+�a�X�쌅1�X3‰(���`��8�S��R�)����e�8�j�N�`�&\dJ�M�<��I3��C��
D+	�|D��s,B|;

�[:��95�
F�bc���$NFV�lj&O3D_g=�Zi�(�Zi�Ix����"E�;��7��	F�����=��&8��TQ4���%n ������A��3�X��T�����M���˗_�Xp+�%��䖡�ƒf�>��T�D
n��Pf�pO윂hnc+
�ы��{��:=d�~ժ�s���lgF�Lr�9aԆG�:���=F=:I��<W��o9u�}߮�d��
�\�i�^��uXf�}��й}�Y==���pi�lv�%2���%���ŏ���pi�.���~�m�ѭ��3�"ÙC@��!İ�궇t�
��|^d���Xhr�r��������!����
K> õ�e�Sͺ(zb��j��U��`R�ɡzx���n��d�~U=	KԳ"�@Z\^�^4�^�x
����Yl�J�7��ѡ�W��3��@�E�V�T��g��c>;�!
+���|��g�U?+x�q�p�r]�V�, at I0�>=�z.Loy�=�M�:�
w�,�c�'�N�m�M���fW��&��
ħ�rRI�ⱓn�y��ղ�����&]�r�.�
8�a@���H��X��
rĸDi�ԾZ�h�_��xuY�@��P1�9E"FA��P�b�g);�^�h���7=�J��
Yi�Tg��S�ѫ�
5"�ej
l6�H���}A��^(G�
�#B
������>6xQ�H�
�w�(�%
&�HY��%�yR7m�7�q �?�M�;Оi:��1>藳үE�
�"Z�X� @�EL�R�Uk4�k�*�b-��Q01��"��y�� �k�ƎWR���Θ�TG!�H�	U��:j,�J���+�N�K�
T'���{�N`�:"���ňϡ�qf
��vg��웳Q�1�f�y��ws�
Z�҈�k�o?�wԼ��N��
�;���A1���0
ӄ[��0
��`���Hx�C+�|d:�kGX<���rh�9
<���}���>�.X�Em��W�W��k��.Oy�u
��	-h'��x��\�)�q)�|	�	�&p���_��v��!�ɿ��y)�L�/������7��ɿ���P�� ��q�
��k��cg;��&�S6)�M
+��������H��H�pwN� U�
�9�~�.�L
_�yƐ.� o
`�9���S�2q03j
P�Bv@��&�7p:�
\j�
���k ����"kp>ˮ�vȋa�
+9
+��e�.@�Q>�
B`�c����AU(�G�bB�����m7���f��Oa��Qe
+�D�P�
UƝTe-:�ʴ"�&�E����ڌ� 
kWP�����G��3U�E��Ϥ
+3y�J	�n�Q�`H���-�6G�_�i
+��ɋ
���
	��v7et��z�b%��9( ���Gl�J
W1h�谳����*�%�NF�'�x΋7���u���R �x�
�~�an{Ȟ#|�H�hĎ����~q�W��U�
V�|[d�W�M\��
+�B&�:"�xua
b.�
+���y�F�j��UHdc��*0��
U �e3P�1�(PD����C,B����#F�1�Ds#c�4�/�)@_�� å
+�K�i{�4�� I�����!KTg�Oܶ�b�
d�Q�
eq
���lھ8�~ �%�Pq�7�P���� $
]5�AW�5^�Ͱ<�A�G�c����yѝ����Bq^JP���������$dc #�Űg�N�q �� hE���:=ʌ�6�"ld�`q��||�
��	�9��(C���u��)΋s�'�)^�xF\�x�|do��ߟq�z��CS��%�a#*�SsR��%�`�.��@yx
�<�	�f�8O���󴡼���<�Cq�m�Iq
rc��'����u��� ����l�� Kg�-���X�
}����x?���.��/䘄�l��}V�e�ԤL�~L�cZR-n�_�)���S��]�Y�c2E�8y�Uh�����?����IԵ[,�ݗww���}�/ȬL	"�o
^��[�l�>
+�+�J@�&�*8��]5���y5k0� �S +��h�������H���b4?��<�_&
+endstream
+endobj
+3137 0 obj <<
+/Type /Page
+/Contents 3138 0 R
+/Resources 3136 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2960 0 R
+/Annots [ 3135 0 R ]
+>> endobj
+3135 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3139 0 obj <<
+/D [3137 0 R /XYZ 89 770.89 null]
+>> endobj
+3140 0 obj <<
+/D [3137 0 R /XYZ 90 721.073 null]
+>> endobj
+2628 0 obj <<
+/D [3137 0 R /XYZ 90 583.616 null]
+>> endobj
+3141 0 obj <<
+/D [3137 0 R /XYZ 90 579.133 null]
+>> endobj
+2629 0 obj <<
+/D [3137 0 R /XYZ 332.797 497.966 null]
+>> endobj
+3142 0 obj <<
+/D [3137 0 R /XYZ 90 491.326 null]
+>> endobj
+2630 0 obj <<
+/D [3137 0 R /XYZ 90 348.365 null]
+>> endobj
+3143 0 obj <<
+/D [3137 0 R /XYZ 90 343.882 null]
+>> endobj
+2631 0 obj <<
+/D [3137 0 R /XYZ 90 229.205 null]
+>> endobj
+3144 0 obj <<
+/D [3137 0 R /XYZ 90 224.721 null]
+>> endobj
+2632 0 obj <<
+/D [3137 0 R /XYZ 332.797 145.612 null]
+>> endobj
+3145 0 obj <<
+/D [3137 0 R /XYZ 90 138.972 null]
+>> endobj
+3136 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F24 173 0 R /F98 502 0 R /F72 198 0 R /F60 176 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3149 0 obj <<
+/Length 2228      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6}�W�m���
qK�&�ٔ�
���dj2��H���D*��ƅH�,��Tv3�� �n4�����Y�����
^�K�H#-���
"�#k�<M�C�Fマ�P�h�l�Ż�7�w��������W8"�?GRE����G
M���#�U�h?ZE1ep]F���
p[��
+!�'�n��Ɣ�a��(>��u�|���"����b�tw�l���=�U��:����b�f�E�30�sЖ�rD��=ٸo=AG�y�	�6�f����\��	���qL�B��јa�c��a��0)�E6
���]�
+I�a,B��T��h�(>l�Ii��(
����'�i��Z���<۔E��J�b�)ӕ{W�i�f�t��}z�S
F�����
���TV�l�N-�m�}L
�܉M6��j]�N���O�Sj=rLE�������J�~u�e]�w��d�M�
+
]"�$
F ,�d��ј`l������z��s��D�0D@�#� C*]ǃ��@�(A`(��3�
!��e�b�{,%,�
+___t����8����L�F��p��{zИ!!Tz�X �e�ǃ���,�7���K�\
�C�y6+�&
�e3"�q��(�,�}볁q��0�>�ۡ
C���
+m����ĪO�#�`��Kב�JXm0��s�έ��7��ա��Z��l;Mlr�o
x��S�H"�@1&��>�P�1��9�H���5n|(�eR�ӏAF�I���a�1�$J!`�~�],�&_K@s!
 �6�������C����桩N��pg�&�]6]y]Hě�ݍ
��I6u?�Z�a�k���e�
��5z��i-�|~W��jg='Ej�؍���d:-�M�t>!�+u�G"�X��Ӱ&�"�����<CE ވ�'�#8�<��p#2�D=H00�
��y8 �-Hf���y�SHqҋ`E��B-��(ƈ�^d� Dh(�t�z�zт :T�H'#9|����R#�u?W��H`�?
+|���}�f����Pv
|���҂hc�K��	⃸���1*�>�x���i�<u
+��/<�8"Bw
� ��ҤWx����Yxa<��i�4��mr9n6�J*�|��
����O�1&��
\!_k�{�|f�v{ȧ��/�|�ߤ��q��R��q��.�ͳ�
+�4~�k߅�v1n���|�'�s�N�/Ʃ�m1n�ŸU�?��M=cB=�BvBv���WD

+5q>5�Po��ⓨ	�
ۇ`�&\�PpW9�̎��E�N�E(�djb���S�B�P�#�8�d�??W�� �;��M
	U�5$TƟgvFR�=�H�
=
�Cj,���Eh��V��I�Z/m���(�\��d�"����8;a3�5��AR��L
ڌ8�OHΰ1@ڕ��l�d�3o�`�@��x=NeJ�L�?d,?���	A�;
�؍s1
���	b62,�1߭�E��b�8�-��7��
����J�G5�=$z��8>	
+%^�d9ˁ��W��q�oRw�c[�k�;�	���X�[d��E��$p�W0��p��
&@'e��x*VqR�ݥ�p�8i��5��>�I?i
T����D�f�8�C�����:/ӗ06�b�Z����
�!�;�]-�i���}{J����#b��6�\��6򕨽�������ۛ�7?^޽���z}{{�����������,e�-�ݗ9�Il7c�L3H�;'(]�o/mC�h�����#S 1����^_�אָ��M<22�t�p1��º$4B�Z���v����~���-g2�.�N����
+�y�i�<�W�dY}8���s�+}q����� �f��:���!��@�$ 
��&�̞` ��]5�����1RxG�c'I�
A�!YBfѡ�#�����~��+�ڃ
o
�8�[��yk �
o���r�d�)K
�՝�1
��1婫�4����9���3�
�+�"�F�J�q5�����}�-
f�	��o�Y6�(�I��8-�0�n� ۥ<��ҿ3s_���1W�X���(!C���V��
XA�_��1�6��׺�/�>����E��a�f�1�7n��
( � >Y������X���\��U�Ͷ�̿��ʴx0^^�?�w��q>�6|�d��~�5�K�愂 �.Re@�P��۴�[7���)�{`��������U��r���W���M������ ��Rڿ���u�[�KU�-����-��)v
+endstream
+endobj
+3148 0 obj <<
+/Type /Page
+/Contents 3149 0 R
+/Resources 3147 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2960 0 R
+/Annots [ 3146 0 R ]
+>> endobj
+3146 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3150 0 obj <<
+/D [3148 0 R /XYZ 89 770.89 null]
+>> endobj
+2633 0 obj <<
+/D [3148 0 R /XYZ 90 634.961 null]
+>> endobj
+3151 0 obj <<
+/D [3148 0 R /XYZ 90 630.478 null]
+>> endobj
+2634 0 obj <<
+/D [3148 0 R /XYZ 332.797 549.31 null]
+>> endobj
+3152 0 obj <<
+/D [3148 0 R /XYZ 90 542.67 null]
+>> endobj
+2699 0 obj <<
+/D [3148 0 R /XYZ 90 387.411 null]
+>> endobj
+3153 0 obj <<
+/D [3148 0 R /XYZ 90 382.928 null]
+>> endobj
+2700 0 obj <<
+/D [3148 0 R /XYZ 90 231.42 null]
+>> endobj
+3154 0 obj <<
+/D [3148 0 R /XYZ 90 226.937 null]
+>> endobj
+2701 0 obj <<
+/D [3148 0 R /XYZ 90 77.486 null]
+>> endobj
+3147 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R /F84 265 0 R /F24 173 0 R /F98 502 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3158 0 obj <<
+/Length 3103      
+/Filter /FlateDecode
+>>
+stream
+x��\ms���_�o�f,
�A���s�sqm�t:��G�(K�D:��� H��@I|�N;�D�������>���e�.��x������r�8h<P\#!��l�e��1�__WOw#�����"�mF$��S2y���Û(	7��4�?��y��	���L
�
��������
*��"R�`����

����FL����z�)��j�p�
�i�A7sk.�-��B"do
+���̞e���
3cءVDh2
�a}L7�t�
�� ��@	G���0�#B��d
+��C5(V(`��A	F��p5I�^�
#�H/�9C�:rߖ��#S���c%Cw��*���fR���X`�De
�$���>�S��
}��*-6��R�_\zD�i ����BTe�5��A�^���m�b�h ��L
Z
� 
+x�}I��~I�%�c�~���DJ�@�1����lb��׭���"����_�a��Q��k6��U��B��Wba�8��8�y�I4����P�b���z�H�[� � 
W N� �A����
|���n:
���nu	�IHv�hk�N̅�8G���/#x�,GT
7�C������=��$�^m��9��Y6�6o���Lޖ��G��gJf��i�ifv�to��7�u
��Www���p�����<]�����������yxz���O��/6}=�

�o�
�)�����z|��I��!7��n?��~i���~D�w���{�~HwA�0�O��Y��n���YH����7�g
	�B5�e%V�����%��6��
��> j�$y���I:-��}��D�q" rՋ`!�����kMD����(�L�!̺�D�A�n�Կ."�T���XhZ#C�X�o@���(�P�% �+�1Q������Pj��<
���J@�|a��h

���M�W[�dͯI&��
��h���(���U6��	q��j��?\�����>�x�pi�;UӬ�&���d$�1�0�`;�~��<�����@5o�N�!uA��d �q4�7��G
�]n4wtXO�X������8�X� Y@ʪeYr]�	�]�I�iY�k\�tM�aԜԺD���(��PTdn��L6O�����v����@�p�+�Q�O$aH1Y6�*�?cL�˰�|J2�w��^��& %
��
Wʑ�,���P*�
"�%�5��꣦� CT�}��!����.=ـkKq<�N
+�J�S�<��"%�R��6�ݭ}S�!drg*��7F�ܷ�
�+i%X}�
��|E\G~�Gr&�����o�n�6O��>�ל����H�&��e£8�7��5��)�
r��!K��\��.������o�u&�96����l�I���f�5���i���Q�����N'�L����q���@�j�p�[���w�$��.�-��p�g��o6�o�p�,�0�<1uN��	'�E�%��l�ɦ(̬_w <� ��!VA<4�'�N$��8�u�L�ab��d�uG�^
	շպ4�	���%ڗ����Ô��?6΁S��Y� �*�Y�ϵ$eVs-�D[�.�D�*W�����ы�/($tp
yF�y9�M at zKZ��'t'ǻCC��
�"LI74��<��9�D��z��N�
e�Vi�e��(�9+m��O�' {�R�0�`���?�iR���G���:�����l���uP�?]z��aD!�~;�qH�� ��P^���B-�z!�H���C`Y�\|L ;/QX�{D�u^�2?ӣ�}M���Bs���4ݹ
ZB�So
�#�(@��@����L?�2�`F�z�	��V�K	����ǀХ��`�!��Ɍ���DU
�
��|�i�C+�~,���p
�
�[b/&�6�d�V�nO�B�y?��g�Jx0��N��6�4�
6�;�o>
����gc��z��S֣�鴹p�mө��i����1� ��y(
*'b/��I�c�,���)��r�3]���&<�
f2��
V�bӬ���P-�O��
��E�ԧq��4�
+![���>;UI/So�X^w����#V�L7Ήu�
�V6̰E��<��s��
�����W�2}C��R/� 5,��HQQ*�=E
m��6*��*<&���K�O�s�qjpf~X����{�
w��8!��� c�$!���#e��&+k���\�*�g[z%����,��k�mʥM�K��#�	�FU ȣݘ�8D�CI�Zp'�=R�DV�T�("Q?����‘]Ǡ����E�� EGjA��c4���x}��5e�`�G�L�ǣ�����^XT��>"� b��-��b
+<A:���1&�B�{��+�V�z���8���-~&ű��IaL�dR$��X���[����o¤�0)�)�B��q|{�I!�I!^&�T�RϤq�I���L
+�3)��I��4�r(�Ĥ��I���*6־�z�§�:`Q��(dϢ��E!.��i�
^Ff[�I�0@�
+N'��)���A"���k��wꝞ<ͧST�^�����)"��H���_@�4��]O�U��g��
�
�� R��>�S<JK�~0�$��Ql�܄F�)%���d���m[2��ۢG���^�X�l��:��ճ(���S�+�R,���*w)�9(��@����C�#�$p�E�GB-��R�
+e�=)����0w=��TT�EC��
TA���� ���F ��#P=��R�e�%@pU��r)�$�R�q)pW�Rxƥ��ü�
<#S�qF��[f&_�_o>%�}��)G9����"��#cK\u�mqe�Q���|/C4�Z�A����UY��i�|]�@w�:�5��L̹����<͘�ZƄ�3&�d��1�5�	�cL�u)�~Ƅ5gL���vcLD?��8�1�g2&�4bLķbLj
+
�e���
���aqS�s{,v�Sww����^n'��n�������������m���H�a�8~�D�If����2�f"#��-0�Ed
+�x������_��_/�Y߫M4G2(��^$��߽{޽l��M��ar�ٜ�e���ܳ��M����u�
�Vx6�M�Y����"M�M[��ӗy�����5��a1�����9G��
+endstream
+endobj
+3157 0 obj <<
+/Type /Page
+/Contents 3158 0 R
+/Resources 3156 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3166 0 R
+/Annots [ 3155 0 R ]
+>> endobj
+3155 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3159 0 obj <<
+/D [3157 0 R /XYZ 89 770.89 null]
+>> endobj
+3160 0 obj <<
+/D [3157 0 R /XYZ 90 721.073 null]
+>> endobj
+2702 0 obj <<
+/D [3157 0 R /XYZ 251.842 623.558 null]
+>> endobj
+3161 0 obj <<
+/D [3157 0 R /XYZ 90 617.54 null]
+>> endobj
+2791 0 obj <<
+/D [3157 0 R /XYZ 456.333 537.808 null]
+>> endobj
+3162 0 obj <<
+/D [3157 0 R /XYZ 90 531.168 null]
+>> endobj
+3163 0 obj <<
+/D [3157 0 R /XYZ 90 438.683 null]
+>> endobj
+2792 0 obj <<
+/D [3157 0 R /XYZ 215.12 300.71 null]
+>> endobj
+3164 0 obj <<
+/D [3157 0 R /XYZ 90 294.693 null]
+>> endobj
+3165 0 obj <<
+/D [3157 0 R /XYZ 90 201.586 null]
+>> endobj
+2793 0 obj <<
+/D [3157 0 R /XYZ 215.12 77.486 null]
+>> endobj
+3156 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R /F60 176 0 R /F24 173 0 R /F85 267 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3170 0 obj <<
+/Length 2370      
+/Filter /FlateDecode
+>>
+stream
+x��ZK�۸�ϯ�-R�����=m
;����J��uMq$����Iʻ��i $Ep��6��$� Ѝ���u7��E�����yzw�N�� #���O����		w���H�����#a�{����o?L?ٱ��ӻ�w�pD�|���f���_p4��?G1����K��S�����?�p�
+FT�K�S+�yO1B!^�!��O�x�f�xB)��˗Za�ڭ��9�EF�V��zIV*P���Q�
2�>'�bL�(�^�A�B��D
J0�4T#�����X&���&b�A
���;o���
�^�	�gM4��
fyVV��R�2�y��tб�,���_
� ����P%�f<��BF��ֿ&DV+�KjehOʛ�>�2����� ܿ�]�'�#�A>�(����gRm���
+<���:/�*
S1�f-���p
{�H���Ӡ^��Ɛ��@��4�
q6ZE"�3�v�"�]��u���2^%�f�g�������[i����9�e�0�xJ�$����	�qf�B���W�C^�)V����A�3s�:�
5���qvk�����,�����J+�>/��<]%Y���$�f�j
W�㲞��1~=�0j��ϯ��~e�I��y���o�r�rS����bR�G!-�J��s�⽓��`n \w!��p	�g"	s��� �_��s\#�o�Sb*��j4J%@
��T
+`�H �Hf v;�[^&C��$�/a����|_z��c
8��v��D WQ�ډ�C\1����0­�7�z��e�����X��g� M��� � �C���3���>�:��u^h���P�tO�l��->V��"��!�1�sڐl���� 
+�s�M칂,�-�o� q���"\j��D#h4���x�>�.���i�ͪ��@{W�<�c�ԣ�>v`g
?��ˎ���H7��
0�`*v>z=`(0%��ج�Z�n  ��(˽ظ,7�u�;��7|䨀ڴ�*8)�x^���}�����r?XrV�E 5�ܐ�	H��$�L`�t� ]KD���'�F�D����� UЛ��T
�=�+���, ��,��=���=la}��elA�8��)J٢V�0[HD5�Nl�"҄���t�Z@F h�5�����W�NAwcN �15'�sU��	���	�ޛ .v6�����	�~' �c� �:�/��������	N�1����$����i��������R�H_����
���לO
+��D
K
+��f��Z����X�D(�

�{�7� @Hv��pA���"��� �+�Ј1y���5��{�w��pO�hu�'LAf�Ux�Nc�f��ҏΨ
�aV��Nh��|`�K.��~�Z�c�	�(u��"\r֥	0"`c4��sg����<_�irc�pyռ�4H�ro�+
�Q�dA趼�`�<<o��l�C�N$��v)�
+ R(Ez�xr�cj>ذ�$ ]���� �c���+�vK��z�
+|=,�r�B=�'K�Y2�i80��
x�!L��*�t|1�h��G�Cp&����G�a8/����1�Pm����N�iq��%.���m�C��e��Q�}�%q������IRz�C�ˀ�w�k{�dX&�	�~��o��y{�&Y�ܡ�����.�R{	(!��~:fbT�Y����|�6�$�g$ܯT��d�f[#e���YqO\�
��]�O-��̧��n�X���29'�'�
	0�?�
�P�"W�Q %�`�?,�?��J!��'��_B%�}
��lHw
�@��X�x��;"(�lL���7a
+��
@�����
+%N"�����l�����j
+H��j����\�K�z�l�V@'F�~�H%Q�y��=�oq�ױ��
�lWf������t��C�����	�H����>��vvaD\3�G�J ������.q��5�/ .9
]�m at d�UR�U�}�Og��~g��z�.�� ?�����v�&�=Ib�t�M#)���":�ʐ�/�8��@b��y��4���h���W>����>w�	������G�� �AA&����s�Ђ][�q&Cm�)���*n��-�Dv���L)r�P��� {%�bOI�%R�\V��o��J2��3K2���ђ�~��WdgUd�Ud�汬�jS}���_r(�N�whg"��6.i�
+@��R�
v��`3�~p�ӊE�a��rXo�[��+�(Ŵ�������Ǐ�����>��xQ���A)�4�8�g���I���ݿ��&^�k���{�������N<��$�Y�
��n�ow.L:��M� }�������͢L��嫗1��l��m>5|�ʋ���6n��܎��
�fr�
+endstream
+endobj
+3169 0 obj <<
+/Type /Page
+/Contents 3170 0 R
+/Resources 3168 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3166 0 R
+/Annots [ 3167 0 R ]
+>> endobj
+3167 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3171 0 obj <<
+/D [3169 0 R /XYZ 89 770.89 null]
+>> endobj
+3172 0 obj <<
+/D [3169 0 R /XYZ 90 721.073 null]
+>> endobj
+2887 0 obj <<
+/D [3169 0 R /XYZ 137.91 647.468 null]
+>> endobj
+3173 0 obj <<
+/D [3169 0 R /XYZ 90 642.885 null]
+>> endobj
+2888 0 obj <<
+/D [3169 0 R /XYZ 90 523.133 null]
+>> endobj
+3174 0 obj <<
+/D [3169 0 R /XYZ 90 518.65 null]
+>> endobj
+2889 0 obj <<
+/D [3169 0 R /XYZ 90 398.898 null]
+>> endobj
+3175 0 obj <<
+/D [3169 0 R /XYZ 90 394.415 null]
+>> endobj
+2961 0 obj <<
+/D [3169 0 R /XYZ 510.023 325.203 null]
+>> endobj
+3176 0 obj <<
+/D [3169 0 R /XYZ 90 318.563 null]
+>> endobj
+3177 0 obj <<
+/D [3169 0 R /XYZ 90 249.989 null]
+>> endobj
+2962 0 obj <<
+/D [3169 0 R /XYZ 90 175.761 null]
+>> endobj
+3178 0 obj <<
+/D [3169 0 R /XYZ 90 171.278 null]
+>> endobj
+3168 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R /F60 176 0 R /F85 267 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3182 0 obj <<
+/Length 2696      
+/Filter /FlateDecode
+>>
+stream
+x��\ے�}���[���K�l씝M��
?���4#���Dɺ�z��i$EH %��ڛʓnlt���}�
������/w��*�d$���Kbp��AB§Y�a��	�������1ţ��u��vc�G���0��'T��w�!ݽL�S���%ͯI��+™i2�����7w��'ĹH��y}��#Nf���	F���s~�:���*���w���z��[�R�I�ڜ�A�D�
wӂy��t7]�$��.Fz8��b6X#�_�l$:�g0cD�I��H`�6\M���eL�2F�F�#l���vq�
��X��N<"%2T�.���6��|XL��r_|��f���n���t� ��8=h�9ñ���v�j�� =��H�*�Z!ŴK���8�Ah=����T�R\N�V�7��{��X>/J��ߦ/��1�Y�M:&b��v���˒
%)�ǧ�ay8
�H�y�>�vAcI��ڑB T�#��HkH���b�4�8�2̉�ˊ�q���}ܼtdA3؝C��sI� [...]
�"�M�e �
R�E�~�(T���*�C��e
+�� qP�Ca���9f�4�g�F��8������x�R0�ҳ�HI5�gŐ:O�r=
�T�Pk;���q���!�$
�깆z�BP'C�� �2\�	
N W��ϖ�4�
���M�N���X2)��FlLP�H<
+�1Ⱦ��y�d���e�Nw�����w
{�9�0�����z
+��S:��c�̈́�9�~
+N��nҜW��4;��`
+��(���%�΁��n�"Z� ��X�Ev�j
+U�G�-:��'D�
��P�.
+�?CF�پ*�.]A	J5;��]�
�T�\���yZ��#
�M��?/E�	g�6}>��u��Y?A�dѤJ�|L�@��|Ǜ����ͧ<�� �c�஁>%-κݘ��M���0�Įl[%�X��_������
� D�I���7I!����3�W�P
+	J=FQ�Q���3Y���"U
7aߨ��i,�ȵ��V�(CBkO�b�S����R����K�x�[٬�r������nȚF�%g��p;N g
��1��3�k����'
KDa�M�b�P1
r\��꧗u^�
+?S9��!|G�5
#�e���\�ct����	��lk�,���� :��� ���cD�
C[�٢c�����z����qv^��9�
�YQ�ʹ�<GX0W��Ң����&��d08+�o��3�`E��0+�.oV2V
���2�l�S��>/K���JZ}�s
p��
F�P
k�R8
D�
���f

�ہ9�}N
��
G����c��t2���aLn��+�c��NJ�-ެכ,o�n��ζ�i6�I�}�`�=>�`n+�H�t��A0�¶{�̸'�1�,�Q��!d��v�`Fa/�.��t�8�`F�o��h̨2�8��J�;n��0����<O=,�3�
HР�q�w�8͌sU3ú�d�	�P��_2+R �b�L��%3��V�L
+�O*M���K5���px6"��f
�����|7��U3֢��շd�U5�";N g�fDC�_P4cʒJGV@���I��"C�N
���n�f�,�c�j�{
X2�
��
��v�6\�X;\4�|Ō	���Ź
�Zw�;�:O�G�)��{Y;N0豵
D/c�"��5�,�e�u���^�}^>�
�:
+���vL��c���

����E�
3���7T̺�������{Y;@�ΔD1cЙ)�(f�
�$�{�z��)�Qs].v4�A/��!�\&<����_F�lckz�eҋ��XF�Še�H�(�\TT!���lŎ!j��/��D�j�+Ct���
���3�v��$N1���bF|)��L��5��� ��f0��:��=��pR8�
�Z!j7���0V|�P�GV�ru��~ΨἯ�ƫ��z����	cp
+����Ljk��~4I�5Q�]X����
W*k�4ޏ&k�]�P�`蓲��Ν4(k+oW�`�3e��+k�녲�A�l:)S�S����+S
+N�I�*4G�q
+8�=q*�x�A.)��綖R"
+�Yѓ�#�_���)ȼ�:U��76�P{,�]�2��U�7]��
x!��2����);��i������~ɞ7�V:��`�K#��'
+HKy
+�v��({�{�쉨���F
�
+>���^�y	N4�#��\�"��H���s9� �=N0g:�Y�^�Y��h��;H1�D]U�"}������]�/���I�/g��E�5�&�}�>�`�Y�-��
O���J��	�ള-�ųq��\��A�Ĺӥ����i�s8>`.Ulk������l��*	���\{�2�c��Ǜ��r�h��u���sFc�����1�#Q��j��	Pޱ�(��9
���#�=��(�u���%�P���ť�u���򄊑�[�qE�өѰ��)$.�|���{�ֽ��f�cu��O�ϫ���O�t�����$��4;NW'���'ݝ
�
 -m�o4��Ԍ~LӢw�WR���]�;��1݉���������q�O�9zެ/���wKT��K���fW>��Z2?i*"U4�IIˬA��0Q��W���?����߭Y��
�q�� 3�W
+endstream
+endobj
+3181 0 obj <<
+/Type /Page
+/Contents 3182 0 R
+/Resources 3180 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3166 0 R
+/Annots [ 3179 0 R ]
+>> endobj
+3179 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3183 0 obj <<
+/D [3181 0 R /XYZ 89 770.89 null]
+>> endobj
+3184 0 obj <<
+/D [3181 0 R /XYZ 90 720.814 null]
+>> endobj
+2963 0 obj <<
+/D [3181 0 R /XYZ 90 649.083 null]
+>> endobj
+3185 0 obj <<
+/D [3181 0 R /XYZ 90 644.6 null]
+>> endobj
+3188 0 obj <<
+/D [3181 0 R /XYZ 90 560.635 null]
+>> endobj
+2964 0 obj <<
+/D [3181 0 R /XYZ 90 476.55 null]
+>> endobj
+3189 0 obj <<
+/D [3181 0 R /XYZ 90 472.067 null]
+>> endobj
+3190 0 obj <<
+/D [3181 0 R /XYZ 90 388.102 null]
+>> endobj
+2965 0 obj <<
+/D [3181 0 R /XYZ 90 304.018 null]
+>> endobj
+3191 0 obj <<
+/D [3181 0 R /XYZ 90 299.535 null]
+>> endobj
+3192 0 obj <<
+/D [3181 0 R /XYZ 90 204.893 null]
+>> endobj
+2966 0 obj <<
+/D [3181 0 R /XYZ 90 81.969 null]
+>> endobj
+3193 0 obj <<
+/D [3181 0 R /XYZ 90 77.486 null]
+>> endobj
+3180 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F85 267 0 R /F60 176 0 R /F98 502 0 R /F72 198 0 R /F7 3186 0 R /F24 173 0 R /F8 616 0 R /F13 3187 0 R /F11 615 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3197 0 obj <<
+/Length 3098      
+/Filter /FlateDecode
+>>
+stream
+x��\I����ϯ`N!��V�K�
EN�V
%��d�Db��� 
p�(�>���l�@�ʕ�
 xK�[��������
��_�=����^|��� #���?�
�)n���k={?�t�����#�����o?޿�����w�����;��8z����vw�?��.r�ѳ��C��
��ٻ���aO�B!�;
+�q�<�(�r�$�y�
K���p؞jC�AD���Nmj�N� �"•������vA���&^g
"���T
�"X�B
J0�`��O����i�E��?��:��Hc~
�F�0O���'�ikxJ��TsD�o�C'�h��Yp���j�qnpLS���<l�.(
���`���#�B�AuQn�	0'i�1_'�8����!�]RC�,a at FG���e
��
�
W*��)��yP�rPY�Չ�����}�����~��<�����uo�/�РC�󶔕��&I�({x��C1�q�!$�)���lc��%c)fo��/�qძ$��Ea�8�͸L.d>V�����6�Y�E�ar�c��Px~�X_|'=��ke,YkG�G���4�l~�Dq0"k��q�x�	���#�M�ع�x*~A�z
0�2���sr�8�Y����1��6�+i�
s���f*�)m��LU�F��M�⸺g���vBL��d'.ǂ OU
�W�է��6����Id����zƐ$�W�
+�(
;�	�\�Z��/ʉl3��
mn���$
r%�|&��f�� ,�F�i�-�+���!I
��̞�$����Y,߸�����80�%30^F/¼q�ށ�e���pd\� �g���_�@>�RY���j�v���_B1�.�z�%��
+
5Y�0�bЯ,:��$�����
+�]�甃�D��h]��s�a����c�,�6�2s�.����nG
���Il�,��8�Yi��,� �2|FB1Eڙ�SxA�$Ɗ�L��S勼�|�P�ݕ�
7�ѝ���
��v���S=��d���m�\�<����²����D�rfHO� Lʤ��%АiG�
��-�6�6~,M���2W�ɺ�
E�Y}ܖW`����SUW� j��9��$�^?>h�Җ�2:�O&Q;?Ѱ�+5�OAZS॑��L�ne.St�]Ɖ��'���j�o�������C_jq�
9��RQ�(�fH�������������8�a��$�������z�9K�6g��ihǶ|��õ
��0x`�-�\P>��P;O���Ĉ
� �h	���r2�����-�v�u��wI��\���С��j��XOJ}l&�Bwp3��fF��f67P(���f���T��)a�ka13�;Z\	�I����U�	��*��̠G�.�.5��b=��D4�r3=]6��é'{��")���A'
;g��9z&��P�0A���b� X"(��0�a0�0���6y6��U� g|46v5�26�d�Aw~��Q�9��f8q
tLJAwBJ��q�
�J.�kLr�vn�{p;���e΢�����%n�I?nǵ9��p�O�;p��D�<;�Ѣ��gA;!�l�z����	
�^{�?�
&�~�bg�;��H6���̖
l#M���ag�!!�/�q�mfW\M!.�l{[(q�3�	^z:)2Xh{"o
�
��7��x%�v
+��,D#�t�e�H�0Ͱ�j�:�i��
��-�J�lt�<\q�Z@��X�k��5��Z��_
��1��):l��q��pu|S`�؍}�1��0$�	2�M�@�ә}�EڽB�G�
ZГy��a��{�䌌}�1��
+\�	��q
�����Ҿ���І�L�i3ڐ���@
nH���jp�1s%`^վ��
Enb�p(�|��=A�r�����3�a��X
��B(�L���Z�C:�����
6��/ 

C�M��������
�
tP�tر_ܣD��`�ڣ��{�8�� �%����)�a��#��#
@�A:,7�B�#

Λ=y�q
�`�W 
�
�:؅mB�q����*��Sc�(N�.�k�OXћ@
EUP%�~�c��`e�I�1�1XM�0 at -��׃���Y�
qy����v�)3lٶ̯
t
Wܷ��m�#m=��ٚ��T�&@e�(Ǯ:F���-z
�1\
�
#M����!�FR�� 
�:�n�,8Nf؂m�_
���o. �c���W�
DS(Ǚs���`D,��Sa�
����*�[�aa*:z�C@(U�7��,�b|��!Z� 
a;s���3�}���D��{O�u�#w3py�ɷ�'��p��J�N� v��/�G1���
�uڴ�y	a�\�p��#
+Cc�&����,X��Jh��W4�k�t�'D�sB9�d�����\�
.��]2H�����.���
.|�
ͱ�bgo8�.nE��>['�S�sm3eRӝG�1�����9]5M��U
+E���
-�\hX
l)n%Ք�����&� �p�^l{�|�eGi~�{0���A��
(
�����Q�E_R��i0t��jS�fy�P���
�	���0�%q����T¾rG���<Ú)'��&�޲g��ح�k�Pu�v��s*���5N��U��&!�F����C�|P>��`s��<7q���0�{�Y����������&�t|�
:���4�B���|���),K��n{��s�E�I�Ѳ�5��sڲ���|���	��X���@Fyak��G'��|�E)U�sO!R*��+%�h�����76���FW0�p�|ʗCF�6��a�-��Zs�0�}�U</�@Z��2�:p���
+X��k^l�--+���y{t�Ej
(n��	2>—S����}�;�����jNl�.�)��h���rX�}�X����*��8_e��Z�L�g>�����������w�
�*>N���yq��)/�x�c�?�Y�n	��
ê�i!��?j*�~���w��
�D��s��-��N�q�h�d��¥�q�ۅ�ra�k�>G%�i�9�&gy��D��Ѷ��hf��]\M�ÿ�!�pW�KKwÑlr��x<��ŋ��Oy�>��~wZj4�
+\M��Xm���r,Ij���
G]C���J�
+endstream
+endobj
+3196 0 obj <<
+/Type /Page
+/Contents 3197 0 R
+/Resources 3195 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3166 0 R
+/Annots [ 3194 0 R ]
+>> endobj
+3194 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3198 0 obj <<
+/D [3196 0 R /XYZ 89 770.89 null]
+>> endobj
+3199 0 obj <<
+/D [3196 0 R /XYZ 90 634.093 null]
+>> endobj
+2967 0 obj <<
+/D [3196 0 R /XYZ 90 550.009 null]
+>> endobj
+3200 0 obj <<
+/D [3196 0 R /XYZ 90 545.525 null]
+>> endobj
+3201 0 obj <<
+/D [3196 0 R /XYZ 90 450.884 null]
+>> endobj
+2968 0 obj <<
+/D [3196 0 R /XYZ 90 379.153 null]
+>> endobj
+3202 0 obj <<
+/D [3196 0 R /XYZ 90 374.67 null]
+>> endobj
+3203 0 obj <<
+/D [3196 0 R /XYZ 90 280.029 null]
+>> endobj
+3031 0 obj <<
+/D [3196 0 R /XYZ 90 204.771 null]
+>> endobj
+3204 0 obj <<
+/D [3196 0 R /XYZ 90 200.288 null]
+>> endobj
+3195 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F72 198 0 R /F60 176 0 R /F85 267 0 R /F8 616 0 R /F13 3187 0 R /F11 615 0 R /F7 3186 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3208 0 obj <<
+/Length 1932      
+/Filter /FlateDecode
+>>
+stream
+x��Z[o�6~����l�axo}[��h�ݚamQ����eW����(Y�"۹[[y u������}�!�."==9�>�4��*������HǖH��Y�n�	��F)
�׋�o&��W���t�O������br�%
��6i~�LS�gz���Yy��B���|8{9��l�y�`����D�h�
��@�n��(�DW�K�(��"z;�cD��ٱ�1˜7�X���{J�4��W��ku���ee�2Y��Y5���-��f�;SO���{|c�|	@��P�ș��Τ�����''�Fu�V‰��o����t�M1i��&R�N�!?qb��y�{�mS��X���Txk�t����X[�0�!�
����i�1D�A-#����Dp�o�A|�
.��aXO�	�8���
di��l��Dg���Y���
B
J�փ@
*�F	��^�t��=��/� �ĔĒ��k_��?�m at m����!��/���K����/�X �.V.#V�ƒ�*+6w���S[ 1�Ý
+�����uc�d�5��#
�^z���d��>��S��N�:�T)D�q�l�Y19L��`�s�e_^<�ͺ�˖��<G���2_�NQ͢�d�ڋ�)E���Y�a^�H�~%�f��W�|��F_�ᢲ�
A
�V
iq�/�y��� �
	��*�ym����dS��Y�}�A@[����hb�X���<U��?�Yh7�k��|��yv��)

++�;ڝ͗iV�ٮgB
�(qxF���@t\�՘�':�a��N)$ d�
HtJ��S\ކ�P� ��(�l ���4�#:jCĻ]��v��\�Ў<�N��z��no�+�`��kJl�
�؎Q�E0 �`����#;�~�C�܏�
;Nv�
%;A*�$EXr;��X6��18!�|�1!�qf
a��I��x� ���)��z�� �s+��t��e��0��.���5�03߹��|�2��;�/��4n�ƥ}��)ϽR
��_	���"�U�w��
f
�H0RG��.�&y�*�R83C4R8��v穹�>���6��
+V6^�feU�VO����]X��;��G���]%>��>]�F��'=��V��U��v�� �l��.$g+���v��-��iR
�SZ(���]&�jj�9�o
+���B&Yl�[U�Ȁ�	t	�
=�=��=n�]	��?T�@�O	#o�G�(C ;=��
�_��Q$
����rDŽ�zkIc9�f;$�p`ǁ�[���!�5'� ����a�@
TS1S ��#��rD�S����/G�:.G

+A}S�|��wW����uMC~B��������o��ćwwrD��۵G�$����`q(GDS~��V�
U��2.(���
-��r��1���&�;�݁}f�x$�@|0�I��O)q��
f�l�9�! �OwtPGw.��w�;&� v��X�C;�V��j7 at j(mC�C����� �q���ۻ�
�4꾜G�s���9		�;����3�\'����ܩ���Q�
+s|ϙ�s�Y��9{�3
+�+�Κ{��8�1�e����
�������T�_Y
�%	��
I�T#�9݇��A�D�
+U~J+}G�FaB� vpx�"Cv$3p��+m��*L���>ܾg�����~��L�N�T��P�`�C�2�1�vt
2�E�5t�~�+���B�?�fE7i׊�u� �2e����1n�fu7������M��.��
H�<c@�>�2�ʸ%eT��
s'����!�2�`��X
���P��tTΛ7�|�o^%��6�Hۧ�&
���3i��D�qe��I�M*-����,Ӽ<��u����ӄt�6M����ս�F��5f3��fv+�r�Y?>=���(��L�m� �k��
��2�H�*Ok톛�����{�sIQ(~*���f(���������Ս�K���d4g����%
+endstream
+endobj
+3207 0 obj <<
+/Type /Page
+/Contents 3208 0 R
+/Resources 3206 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3166 0 R
+/Annots [ 3205 0 R ]
+>> endobj
+3205 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3209 0 obj <<
+/D [3207 0 R /XYZ 89 770.89 null]
+>> endobj
+3032 0 obj <<
+/D [3207 0 R /XYZ 245.416 711.11 null]
+>> endobj
+3210 0 obj <<
+/D [3207 0 R /XYZ 90 704.59 null]
+>> endobj
+3033 0 obj <<
+/D [3207 0 R /XYZ 332.797 625.36 null]
+>> endobj
+3211 0 obj <<
+/D [3207 0 R /XYZ 90 618.72 null]
+>> endobj
+3034 0 obj <<
+/D [3207 0 R /XYZ 90 461.393 null]
+>> endobj
+3212 0 obj <<
+/D [3207 0 R /XYZ 90 456.91 null]
+>> endobj
+3035 0 obj <<
+/D [3207 0 R /XYZ 332.797 375.743 null]
+>> endobj
+3213 0 obj <<
+/D [3207 0 R /XYZ 90 369.102 null]
+>> endobj
+3110 0 obj <<
+/D [3207 0 R /XYZ 90 211.775 null]
+>> endobj
+3214 0 obj <<
+/D [3207 0 R /XYZ 90 207.292 null]
+>> endobj
+3111 0 obj <<
+/D [3207 0 R /XYZ 90 77.486 null]
+>> endobj
+3206 0 obj <<
+/Font << /F70 196 0 R /F85 267 0 R /F60 176 0 R /F84 265 0 R /F24 173 0 R /F98 502 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3218 0 obj <<
+/Length 2593      
+/Filter /FlateDecode
+>>
+stream
+xڭZ_��6�O����31#��{js�M�^��ݛ>l2;�ŵ5gK�$�v�� )Y��Nm�ŢD �t<YN��?o���y�cOR�*�&w��4�$"%R�[>����~��i•&4U0�~}�뇻>��b��w7��P�'�͗$ѓ����s<���O���TO���D0������7�%&Lb^0-��P�$H`
a����q
e;�1A��:۾�*EbM-	
���c$�i/�kA�JI��dMS,K��S,c��W:I�N������Q�~Y���R
U�C�&�0���&��~���q��(rH</6�l
+���5#d�&,��7��G�D�=�`Ō�D%�ئ�s:ӑy�d�@��(YpJD�Z
ӎ��^��n�,Ѝ)w������SAH2>��n��ծ�M��l���w�DD�Ƈ��NEޮF$�\��}��8:"O*�+y�����Zx�ƔmւIG�3
+[vo�z�ƙ�8샄����
�>Mi
��S
�
+��c
+H�i��j
I�v��EU6툔L�U�PEv��;��3���/Mk6݆a�����@�G���G�Z�*����NiGqW�n7�U���r���vm�TF����¸"�'�H"�8s�� �)�&�b¯�]զYU�|lM��{���sĤ
�,�!=�Y9�D�N�
+��ԧt���̋�"�e�5j�el))�B�
.�
��X?�6�5�g��.��Q���P��N$�n�w��7���j���D��������~mWƑ��xP�� w��}{�����R��<�����M�-��7~5�
O�j�h�ڽ7Sm����
l*֋�Q�gco��ll$J�WM9")����ej=��a
��>̡9$f#L%���P7�
�٫��3	`�&�%�$�
��&�"��lcZΛFMH���?�=L����t~��>��z�!L'2Մ���x�4
�2�#���<���0ocD^�241D��%!�;
Y N���]e������y�����ZNI����S�/��U��e��1�*�B ��i�ƀt�]
5�e�G
<�|�5�ݑ�����
��N|�}�}�u�&'G�~��ݴ�-.��5���W�:�Kn�)8�u'��/b8n�!�~3�?p
+Ky:�u~FAR����:{�ΐ<r��
~�>�x����s5B	f
8#_�kf; b
�����Y2��@�c#��R	ƻ��1 ^�p
�C��BH� ��	�ܣ��v}sw�r��~�s���0<��֢�!��V��K7
vaJ

�t8r8̞��s�f���<��N��Ŋ]'H�a��������.b8�!C�ג4�Ͷ
��7�>�J�
W�5��
fq��\���=-��V�q��9�����UT�
&�V�R\]3��
+"������KPK��������8��

�� � w��%
�����*�B�Saς\:�AO�M�#^B��0�8h
"hY�A�Cܐ� q#H;;E;W�!f`��gh�̶������k
��ĉK�N�"5j՗����B���
x~�����_�3�iT�����V�_\
+�3�X�?��������?�t
�C�e	վ�
�H�&�JOe��n��jD��V#�g��%N���#�NƆ����@�=Ko�����d����)s�
j�C�[��"����*����.�R@Ҿ���գ�q��ҽz�u�G
�Ԫ�N�W񙄀"th
_�B�I��2�
%A�r��CN�
�J ��dض<�5�nc]���
�}X���#u�v�z̗��j�
��^�ݢu��]V��\`*�-t���<!t����O����:\�BG[S��*
�mQ����O��6���ͅ7
6�������Q�;�ø�wq�O���5�`�8<�
y�.�h�][ ̞�`

�g(���t��X3pł��t�AӉ��Um��Յ=�{
�{�m<��]�n��+)
 _����cp�禪G�o@͢hL_p�'J�o��	��[���
��ΡѡV�%��$�3�_��)�{%����r��h>?�Q����O��f��S���k��XM�D�	Ic\����JR��u�vUOy���cA�"!�C�P��|���ն/p;��L�*���
�]W�����l���~�l�����ع� ������q�l/�����>XJ� =�&�iW��Q�ٶ�����
��Qd]$�(��>������R0��{:/�Ν��߭sמ�1>��`-.~��د��������L��N="�n������.k���7��
+���0��]O%�����
NC�ݣ/-�#�\��T	���:�ٳ_
��N��N�W��fP΀O�U�i��(��Fخ���_��]�(�%i���j�vg�>@������Zn�A�k{�'S_|�Ę
G���D�{�"y�G0�խ
#	��OQ��0����
(�&��sض��
����
���b{r3�7��L�2�u�
�p
`i�44�Ǐ���;��%+!?]����������B��-����e�� 2���>�PBaGh�f
h������~�?��\e {������j��o��wKH͗d��ë���$|���
�6u�(���"�
���Fb�
+endstream
+endobj
+3217 0 obj <<
+/Type /Page
+/Contents 3218 0 R
+/Resources 3216 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3166 0 R
+/Annots [ 3215 0 R ]
+>> endobj
+3215 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3219 0 obj <<
+/D [3217 0 R /XYZ 89 770.89 null]
+>> endobj
+3220 0 obj <<
+/D [3217 0 R /XYZ 90 721.073 null]
+>> endobj
+162 0 obj <<
+/D [3217 0 R /XYZ 90 622.696 null]
+>> endobj
+3216 0 obj <<
+/Font << /F70 196 0 R /F84 265 0 R /F98 502 0 R /F24 173 0 R /F72 198 0 R /F60 176 0 R /F85 267 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3295 0 obj <<
+/Length 1304      
+/Filter /FlateDecode
+>>
+stream
+x��Y[��8}�W�Z��I��o�F�
�tw�l�h�mj]ę���.ڊ ^�v�#�9��#_�)�^
d�y$E��W�'���*rP�QF
y�Z��[!G&�׺�O��������2�Z|KFr�,��"T�gۍ&�@�p��ڙ��/���A�������\AF�W�����
k��xE|
� A}p����%�H��L;sD"
����������>&z�Z_��5��3�A
+��A�m[6�X}M7�b�,�nl��Q5���;��Q��*�쑇j�V�����ֈP�K��o��U�
��i��w��d~2�G��fv4��?5�G�
��c�oIR:/��y&ws
�qאtt�*s��Ǒ���e*3�\.g���s�F����:���
S����A���Ii���K�?�r�qB'��tWe��i��^'C
+�Z'��'A�/B U�H+R���m�Cb�"O(y
`�?�4�
�����l���O-�x�_�]8ы��b�y��
<
2�#���g�����}�uRd{�ĶF�-1r۰�#Ӂ�V�:>ٰ
�����d̀2S�\�jk�b�o�%�>(�'y�����8�l:�I\
�<��8�	[n�fML����{�wmAGfwY:ח�-棭
��k
�=��"V
���*>td&�י�]��/֬g�Ш�j@�>uJ*�����G��� ¢����c� ��?��v���r}���~!cބ8)�OS��Aݛ�oׅlK�^��0p<?�r�W���
�2/���Z
+����빾8�"��.6��VQ���7�]}G��{�dN�9/3�.��r
�׵?���U���%e�(�Ģ|�A�[��z���'N��[�'���oo�mf�r���9lj��=0'��F��X;��
f��R6�iT��h��;�䨟� v�3����|� ot�W��L����a͚���*�#:x�o�\�S�����]!�E��p�^9�?�]=h"o�.���ʇ��72=�ǭX
:1����Ph�ӥ���
�[�ݘ�C�.��{#���D�����m�}#
n�ߢ��m���бHp;��
+|�
+��A��\�wtq;��ei��Hr^
�m�2s^U9n��Tf��
�6���?��Ӥ�l�-=9e�$��s���h��4$��J~�
�̒�7 �t/`�mk ��[e� �h
+
k躩r�'�}b���
�D^Vv+�������^�S��O��b�炌��n�}ݸw��d����<n��L�,��2�D��Z*7����
@����;�on
L/��s��,j��g��_���
+endstream
+endobj
+3294 0 obj <<
+/Type /Page
+/Contents 3295 0 R
+/Resources 3293 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3298 0 R
+/Annots [ 3221 0 R 3222 0 R 3223 0 R 3224 0 R 3225 0 R 3226 0 R 3227 0 R 3228 0 R 3229 0 R 3230 0 R 3231 0 R 3232 0 R 3233 0 R 3234 0 R 3235 0 R 3236 0 R 3237 0 R 3238 0 R 3239 0 R 3240 0 R 3241 0 R 3242 0 R 3243 0 R 3244 0 R 3245 0 R 3246 0 R 3247 0 R 3248 0 R 3249 0 R 3250 0 R 3251 0 R 3252 0 R 3253 0 R 3254 0 R 3255 0 R 3256 0 R 3257 0 R 3258 0 R 3259 0 R 3260 0 R 3261 0 R 3262 0 R 3263 0 R 3264 0 R 3265 0 R 3266 0 R 3267 0 R 3268 0 R 3269 0 R 3270 0 R 3271 0 R 3272 0 R 3273 0 R 3274  [...]
+>> endobj
+3221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.191 671.54 192.146 682.443]
+/A << /S /GoTo /D (page.18) >>
+>> endobj
+3222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.577 648.806 166.533 659.71]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.81 637.522 269.765 647.708]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.396 625.52 265.351 635.707]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.253 613.519 274.208 623.706]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.177 601.518 289.132 611.704]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.291 589.516 264.246 599.703]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.886 577.515 254.841 587.702]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.253 565.514 274.208 575.7]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.755 553.512 289.71 563.699]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.898 529.556 187.853 539.742]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.583 517.554 215.539 527.741]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.202 505.553 253.157 515.74]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.89 492.834 213.845 503.738]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.89 480.833 213.845 491.737]
+/A << /S /GoTo /D (page.24) >>
+>> endobj
+3236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.193 458.099 178.149 469.003]
+/A << /S /GoTo /D (page.27) >>
+>> endobj
+3237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.571 446.815 189.526 457.002]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.59 434.814 184.545 445.001]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.59 422.813 184.545 432.999]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.59 410.811 184.545 420.998]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.609 398.81 179.564 408.997]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.773 386.465 279.728 396.995]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.57 362.508 184.525 373.039]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [148.222 338.895 160.177 349.082]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.116 314.939 159.071 325.126]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.322 302.938 301.277 313.124]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.116 278.981 159.071 289.168]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.935 266.98 265.89 277.166]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.58 254.978 272.535 265.165]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.281 242.977 264.236 253.164]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.264 230.976 295.22 241.162]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [152.655 207.019 164.61 217.206]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.312 195.018 301.267 205.204]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.502 183.016 266.457 193.203]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.377 171.015 265.332 181.202]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.702 159.014 242.657 169.2]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.156 147.012 268.111 157.199]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.966 135.011 198.921 145.198]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.154 122.292 306.109 133.196]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 100.393 140.809 109.24]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.909 86.335 293.865 97.238]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.913 74.333 236.868 85.237]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.711 671.54 451.666 682.443]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [462.954 659.562 474.909 670.466]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.446 647.584 495.401 658.488]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [408.428 635.606 420.383 646.51]
+/A << /S /GoTo /D (page.34) >>
+>> endobj
+3267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [460.721 623.628 472.676 634.532]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.435 611.651 389.39 622.554]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.974 599.673 394.929 610.577]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [456.02 587.695 467.975 598.599]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.181 575.717 454.136 586.621]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.874 563.739 450.829 574.643]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 529.444 402.939 540.348]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 505.488 414.555 516.392]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 481.533 414.555 492.437]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 457.577 414.555 468.481]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 433.622 414.555 444.526]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 409.666 414.555 420.57]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 385.711 414.555 396.615]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 349.8 414.555 360.704]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 325.844 414.555 336.748]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 301.889 414.555 312.793]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [402.6 277.933 414.555 288.837]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 253.977 402.939 264.881]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 230.022 402.939 240.926]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 206.066 402.939 216.97]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 182.111 402.939 193.015]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 158.155 402.939 169.059]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 134.2 402.939 145.103]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 110.244 402.939 121.148]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 74.333 402.939 85.237]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3292 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3296 0 obj <<
+/D [3294 0 R /XYZ 89 770.89 null]
+>> endobj
+3297 0 obj <<
+/D [3294 0 R /XYZ 90 684.655 null]
+>> endobj
+3293 0 obj <<
+/Font << /F84 265 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3370 0 obj <<
+/Length 1313      
+/Filter /FlateDecode
+>>
+stream
+x��Zmw�8�����9+
o���L�Y輜Μ
���Ë
���� jժDj�_�y�����\ ��p��n|�WU��E�y��8U�yҫ1w��`����t��@���Vs�3��7��xh����
+�j�(j�� ܘ6� /��X�)�dQ�ǐs7�:��CxA(��>�6����,y�lu��{�ȶ̡W�hwQ�ڴ��(e�~pG|��j�
+h���Ϟf8���^�&�{���������
E܁��R�
�d�2yG�8�o�"☽3�Hbu�:v��

�p�ɩB���
V>�g��ط� s`[�k~�_�[+&74�}�Qӻ�$_���^��k^S�����������2
��?g
BR����� �T
/�
+�ú��k؞i
/A�fX�����
�@�=d�� ML� �K
+�)
�d@``0���C��; �(�Cd���?�&��s
�0%q�����YBP{Q��"lf~/I��
���(ps���
������4�1p��VY��'�T�}J3
m��0�Vc�S�V�ɀ/͈Pq�!
5Fa�dˀ'WҼ�����Z(�€
+�@e�S��H0~�
@n�z͑��P at exlA3`VGr?��O��kFp��|X�v`��&�]Hm�y��7��ù�a����GYP6�,���<�
t�ٷ(mc2�TW�u�d�M�K�x�]��V�P���D�V�v3Ul9Q��
TJE���Z6��6���GA��d�kx
+�=�#�2X�Ą�����|�������d���@G�A�A�t�d$c�
Vp�1nγ#"�L�$�I0f��N�vB��g�$�Q��N�]z>M�P6W���3
!��tf�Ŵ��‡�	x	�U����<��i�q.���MϿc8i�u�
f�(.��ɲ�IgУ�I5����b�h
0�j������d
���X���:�D��@�����ӵ���Qu�5���la���)�an(���LO���r<w��z�
+�K}�>����?ۮd/����DTQ�dS4˫��e��sx� �&�����_�����X'd�������e}�P�j�OEle��WZ�* Ԯ*�,7@�"��oy��� E^%֭k
e�W�b��C�@PU���~^�\�Y4\����
+�
צx�g��F
+�몤�)
�Pԗ�JyS\~�����My���d��@ŕ���� �4��M7)&������?��Iy�
(�|�^��#�]74zO�[m�b�/�-m��2�|3���]�y���]'�,��quu7��8��$��Ӗ���ڱr��%daK�ƨ���u����2"
+endstream
+endobj
+3369 0 obj <<
+/Type /Page
+/Contents 3370 0 R
+/Resources 3368 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3298 0 R
+/Annots [ 3299 0 R 3300 0 R 3301 0 R 3302 0 R 3303 0 R 3304 0 R 3305 0 R 3306 0 R 3307 0 R 3308 0 R 3309 0 R 3310 0 R 3311 0 R 3312 0 R 3313 0 R 3314 0 R 3315 0 R 3316 0 R 3317 0 R 3318 0 R 3319 0 R 3320 0 R 3321 0 R 3322 0 R 3323 0 R 3324 0 R 3325 0 R 3326 0 R 3327 0 R 3328 0 R 3329 0 R 3330 0 R 3331 0 R 3332 0 R 3333 0 R 3334 0 R 3335 0 R 3336 0 R 3337 0 R 3338 0 R 3339 0 R 3340 0 R 3341 0 R 3342 0 R 3343 0 R 3344 0 R 3345 0 R 3346 0 R 3347 0 R 3348 0 R 3349 0 R 3350 0 R 3351 0 R 3352  [...]
+>> endobj
+3299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 696.002 198.074 706.906]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 672.092 198.074 682.996]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 648.181 198.074 659.085]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 624.271 198.074 635.175]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 600.361 198.074 611.265]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 576.45 198.074 587.354]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 552.54 198.074 563.444]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 528.63 198.074 539.534]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 504.719 198.074 515.623]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 480.809 198.074 491.713]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 456.899 198.074 467.803]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.503 432.988 186.458 443.892]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.503 409.078 186.458 419.982]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 385.168 198.074 396.071]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.023 361.257 196.978 372.161]
+/A << /S /GoTo /D (page.21) >>
+>> endobj
+3314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [146.01 337.347 157.965 348.251]
+/A << /S /GoTo /D (page.35) >>
+>> endobj
+3315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.048 325.392 222.004 336.296]
+/A << /S /GoTo /D (page.36) >>
+>> endobj
+3316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.878 313.437 184.834 324.34]
+/A << /S /GoTo /D (page.36) >>
+>> endobj
+3317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.079 301.481 283.034 312.385]
+/A << /S /GoTo /D (page.38) >>
+>> endobj
+3318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [211.314 289.526 223.269 300.43]
+/A << /S /GoTo /D (page.38) >>
+>> endobj
+3319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.993 277.571 188.948 288.475]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.454 265.616 276.409 276.52]
+/A << /S /GoTo /D (page.41) >>
+>> endobj
+3321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.689 253.661 216.644 264.565]
+/A << /S /GoTo /D (page.42) >>
+>> endobj
+3322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.368 241.706 182.323 252.609]
+/A << /S /GoTo /D (page.44) >>
+>> endobj
+3323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [262.77 229.75 274.725 240.654]
+/A << /S /GoTo /D (page.45) >>
+>> endobj
+3324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.005 217.795 214.96 228.699]
+/A << /S /GoTo /D (page.46) >>
+>> endobj
+3325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.684 205.84 180.639 216.744]
+/A << /S /GoTo /D (page.47) >>
+>> endobj
+3326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.56 193.885 297.515 204.789]
+/A << /S /GoTo /D (page.49) >>
+>> endobj
+3327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [226.248 181.93 238.203 192.834]
+/A << /S /GoTo /D (page.50) >>
+>> endobj
+3328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.927 169.975 203.882 180.878]
+/A << /S /GoTo /D (page.51) >>
+>> endobj
+3329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.111 158.019 216.066 168.923]
+/A << /S /GoTo /D (page.53) >>
+>> endobj
+3330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.237 134.109 217.192 145.013]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.237 110.199 217.192 121.103]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.237 86.288 217.192 97.192]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.312 74.333 197.267 85.237]
+/A << /S /GoTo /D (page.55) >>
+>> endobj
+3334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.426 707.957 442.381 718.861]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [426.69 696.002 438.645 706.906]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.401 672.092 430.356 682.996]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [418.401 648.181 430.356 659.085]
+/A << /S /GoTo /D (page.61) >>
+>> endobj
+3338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [398.475 636.226 410.431 647.13]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [427.108 624.271 439.063 635.175]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.046 612.316 437.001 623.22]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [409.175 600.361 421.131 611.265]
+/A << /S /GoTo /D (page.63) >>
+>> endobj
+3342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [367.472 576.45 379.428 587.354]
+/A << /S /GoTo /D (page.64) >>
+>> endobj
+3343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 554.597 357.291 563.444]
+/A << /S /GoTo /D (page.66) >>
+>> endobj
+3344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.244 540.585 493.199 551.489]
+/A << /S /GoTo /D (page.67) >>
+>> endobj
+3345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 516.674 423.153 527.578]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 492.764 423.153 503.668]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 468.854 423.153 479.758]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 444.943 423.153 455.847]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 421.033 423.153 431.937]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 397.123 423.153 408.027]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 373.212 423.153 384.116]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 349.302 423.153 360.206]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 325.392 423.153 336.296]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 301.481 423.153 312.385]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 277.571 423.153 288.475]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 241.706 423.153 252.609]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 217.795 423.153 228.699]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 193.885 423.153 204.789]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 169.975 423.153 180.878]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 146.064 423.153 156.968]
+/A << /S /GoTo /D (page.78) >>
+>> endobj
+3361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 122.154 423.153 133.058]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.273 110.199 403.228 121.103]
+/A << /S /GoTo /D (page.68) >>
+>> endobj
+3363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [506.281 98.244 518.236 109.147]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.134 86.288 512.089 97.192]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [498.46 74.333 510.415 85.237]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3367 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3371 0 obj <<
+/D [3369 0 R /XYZ 89 770.89 null]
+>> endobj
+3368 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3422 0 obj <<
+/Length 1120      
+/Filter /FlateDecode
+>>
+stream
+x�͙�s�8���W�vf�B$0��c�4�^��_�f����5A�h�����۩��v>^�,��O��]��jH;��
��;Hs
��D�L5i��5l��vx�������6–�,ƕ7�N�;8�
�:������5?
�~CZ �4dX�X{(���i�5�n�2Y��ڦ�9W*�4�h>c�L�G��i�"d
+�����b�a
u}>�n�L
Ǩ�_)��#����v�d��p��"`��{��2!d�j"k5���F�Rϖy8n�y�L0I#���l�*/�eG��E��UQ��e�`�U��ur�"���
���
�u��1M�,�>�
3��D�U��(���0i��&\���p�ųʗ,�
+�R�?�(I;(�伌��
'�>��i�d��<�e<�e�	��M��..���v�:6�T4�9�V�;*������!�Ţ�K�'3��b�inXry콫�ͅPL��0�L�1�S�}�Qt1	��J���Њ{��$���*�@���nu��v�k�.cB���f1��Gh�5�����"�<�
�`f�nj�6h$:!�CbR���9+
�~�"�:���!Sn$ʭE7�\�x�|��>@��x���
y����^
0�~ٓJN�"�%�Js�Ms�uY�^�ZYj!@�
b�B���x'˕v*�2S�2gv�7�L���ý��
��ɣmt��"
�7�"�
n�l���/��܇��������	�
�������2�9���}�,�_#�c��|���.=Yl�V�
y�,�7c�
�b�x���=/���[M7�-{X?ӫ��=���?+$/�-����hY��R���Q�M�g+{l�j���5��M�tzo��c��x|XὗTO�h}T�&l�ξo� [...]
c���	~ך��i����ݑAƏg23��ߎ���0c"4�$^1ޓ9;��n�N�|C��Z\@g\�(�9�iln#lb6V�����|����f3��8��-�4g,N���Cz
+endstream
+endobj
+3421 0 obj <<
+/Type /Page
+/Contents 3422 0 R
+/Resources 3420 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3298 0 R
+/Annots [ 3366 0 R 3372 0 R 3373 0 R 3374 0 R 3375 0 R 3376 0 R 3377 0 R 3378 0 R 3379 0 R 3380 0 R 3381 0 R 3382 0 R 3383 0 R 3384 0 R 3385 0 R 3386 0 R 3387 0 R 3388 0 R 3389 0 R 3390 0 R 3391 0 R 3392 0 R 3393 0 R 3394 0 R 3395 0 R 3396 0 R 3397 0 R 3398 0 R 3399 0 R 3400 0 R 3401 0 R 3402 0 R 3403 0 R 3404 0 R 3405 0 R 3406 0 R 3407 0 R 3408 0 R 3409 0 R 3410 0 R 3411 0 R 3412 0 R 3413 0 R 3414 0 R 3415 0 R 3416 0 R 3417 0 R 3418 0 R 3419 0 R ]
+>> endobj
+3366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.308 707.957 246.263 718.861]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.03 696.002 258.985 706.906]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.6 684.047 285.556 694.951]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.844 672.092 297.8 682.996]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [258.916 660.136 270.871 671.04]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.206 648.181 297.162 659.085]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [150.991 624.988 162.946 635.175]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.45 612.316 309.406 623.22]
+/A << /S /GoTo /D (page.81) >>
+>> endobj
+3379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.599 589.123 179.554 599.309]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.177 576.45 289.132 587.354]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.994 564.495 281.949 575.399]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [268.34 552.54 280.295 563.444]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [282.168 540.585 294.123 551.489]
+/A << /S /GoTo /D (page.78) >>
+>> endobj
+3384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.484 528.63 292.439 539.534]
+/A << /S /GoTo /D (page.79) >>
+>> endobj
+3385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.003 516.674 276.958 527.578]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.713 504.719 175.668 515.623]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.717 480.809 206.672 491.713]
+/A << /S /GoTo /D (page.80) >>
+>> endobj
+3388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.023 456.899 196.978 467.803]
+/A << /S /GoTo /D (page.22) >>
+>> endobj
+3389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 432.988 198.074 443.892]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 409.078 198.074 419.982]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 385.168 198.074 396.071]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 361.257 198.074 372.161]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 337.347 198.074 348.251]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 313.437 198.074 324.34]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.503 289.526 186.458 300.43]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.165 265.616 276.12 276.52]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.165 241.706 276.12 252.609]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 217.795 198.074 228.699]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.119 193.885 198.074 204.789]
+/A << /S /GoTo /D (page.34) >>
+>> endobj
+3400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.717 169.975 206.672 180.878]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+3401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.717 146.064 206.672 156.968]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+3402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.717 122.154 206.672 133.058]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.717 98.244 206.672 109.147]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+3404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [194.717 74.333 206.672 85.237]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+3405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 696.002 423.153 706.906]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.646 672.092 492.601 682.996]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.377 648.181 415.332 659.085]
+/A << /S /GoTo /D (page.25) >>
+>> endobj
+3408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [390.984 624.271 402.939 635.175]
+/A << /S /GoTo /D (page.24) >>
+>> endobj
+3409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.646 600.361 492.601 611.265]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [480.646 576.45 492.601 587.354]
+/A << /S /GoTo /D (page.19) >>
+>> endobj
+3411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.377 552.54 415.332 563.444]
+/A << /S /GoTo /D (page.25) >>
+>> endobj
+3412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.452 530.622 395.407 541.526]
+/A << /S /GoTo /D (page.25) >>
+>> endobj
+3413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [451.605 518.667 463.56 529.571]
+/A << /S /GoTo /D (page.25) >>
+>> endobj
+3414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.6 506.712 406.555 517.616]
+/A << /S /GoTo /D (page.25) >>
+>> endobj
+3415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.579 484.794 393.534 495.698]
+/A << /S /GoTo /D (page.21) >>
+>> endobj
+3416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.706 473.556 407.661 483.743]
+/A << /S /GoTo /D (page.21) >>
+>> endobj
+3417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.213 460.884 387.168 471.788]
+/A << /S /GoTo /D (page.22) >>
+>> endobj
+3418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.198 427.011 423.153 437.915]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3419 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [283.691 44.211 361.001 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3423 0 obj <<
+/D [3421 0 R /XYZ 89 770.89 null]
+>> endobj
+3420 0 obj <<
+/Font << /F70 196 0 R /F60 176 0 R /F72 198 0 R >>
+/XObject << /Im3 191 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3424 0 obj
+[329.4]
+endobj
+3425 0 obj
+[631 507.9 631 507.9 354.2 569.5 631 323.4 354.2 600.2 323.4 938.5 631 569.5 631 600.2 446.4 452.6 446.4 631]
+endobj
+3426 0 obj
+[611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 611.1 351.8 351.8 351.8 935.2 578.7 578.7 935.2 896.3 850.9 870.4 915.7 818.5 786.1 941.7 896.3 442.6 624.1 928.7 753.7 1090.7 896.3 935.2 818.5 935.2 883.3 675.9 870.4 896.3 896.3 1220.4 896.3 896.3 740.7 351.8 611.1 351.8 611.1 351.8 351.8 611.1 675.9 546.3 675.9 546.3 384.3 611.1 675.9 351.8 384.3 643.5 351.8 1000 675.9 611.1 675.9 643.5 481.5 488 481.5 675.9]
+endobj
+3427 0 obj
+[777.8 722.2]
+endobj
+3428 0 obj
+[571 571 856.5 856.5 285.5 314 513.9 513.9 513.9 513.9 513.9 770.7 456.8 513.9 742.3 799.4 513.9 927.8 1042 799.4 285.5 285.5 513.9 856.5 513.9 856.5 799.4 285.5 399.7 399.7 513.9 799.4 285.5 342.6 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 285.5 799.4 485.3 485.3 799.4 770.7 727.9 742.3 785 699.4 670.8 806.5 770.7 371 528.1 799.2 642.3 942 770.7 799.4 699.4 799.4 756.5 571 742.3 770.7 770.7 1056.2 770.7 770.7 628.1 285.5 513.9 285.5 513.9 285.5 2 [...]
+endobj
+3429 0 obj
+[513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 799.4 513.9 799.4 513.9 543.7 770.7 777.7 733.6 847.5 756.3 656.2 804.8 850.1 449.3 566.3 870.4 699.4 992.9 821.6 782.1 656.2 810.6 777.6 627.8 599.6 699.1 599.4 970.5 849 596.5 699.2 399.7 399.7 399.7 1027.8 1027.8 424.4 544.5 440.4 444.9 532.5 477.8 498.8 490.1 592.2 351.7 420.1 535.1 306.7 905.5 620 497.5 515.9 459.2 463.7 478.8 371.1 591.4 499.2]
+endobj
+3430 0 obj
+[539.2 431.6 675.4 571.4 826.4]
+endobj
+3431 0 obj
+[500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 277.8 500 277.8 277.8 500 555.6 444.4 555.6 444.4 305.6 500 555.6 277.8 305.6 527.8 277.8 833.3 555.6 500 555.6 527.8 391.7 394.4 388.9 555.6 527.8]
+endobj
+3432 0 obj
+[500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.3 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520.5 465.6 489.6 477 576.2 344.5 411.8 520.6 298.4 878 600.2 484.7 503.1 446.4 451.2 468.8 361.1 572.5 484.7 715.9]
+endobj
+3434 0 obj
+[500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 832 667 667 667 722 667 667 722 778 389 500 667 611 889 722 722 611 722 667 556 611 722 667 889 667 611 611 333 278 333 570 500 333 500 500 444 500 444 333 500 556 278 278 500 278 778 556 500 500 500 389 389 278 556 444 667 500 444]
+endobj
+3435 0 obj
+[513.9 799.4 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 513.9 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 1027.8 799.4 799.4 1027.8 1027.8 513.9 513.9 1027.8 1027.8 1027.8 799.4 1027.8 1027.8 628.1 628.1 1027.8 1027.8 1027.8 799.4 279.3 1027.8 685.2]
+endobj
+3436 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410]
+endobj
+3437 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+3438 0 obj
+[500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389]
+endobj
+3439 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410 319 230 319 479 0 0 0 228 456 410 8 [...]
+endobj
+3440 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+3441 0 obj
+[556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444]
+endobj
+3442 0 obj
+[556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1 [...]
+endobj
+3443 0 obj
+[638.9 963 638.9 963 963 963 963 963 963 963 1222.2 638.9 638.9 963 963 963 963 963 963 963 963 963 963 963 963 1222.2 1222.2 963 963 1222.2 1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 1222.2 1222.2 963 365.7 1222.2 833.3 833.3 1092.6 1092.6 0 0 703.7 703.7 833.3 638.9 898.1 898.1 963 963 768.5 989.9 813.3 678.4 961.2 671.3 879.9 746.7 1059.3 709.3 846.3 938.8 854.5 1427.2 1005.7 973 878.4 1008.3 1061.4 762 711.3 774.4 785.2 1222.7 883.7 823.9 884 833.3 8 [...]
+endobj
+3444 0 obj
+[472.2 472.2 472.2 649.3]
+endobj
+3445 0 obj
+[277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8]
+endobj
+3446 0 obj
+[222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500]
+endobj
+3447 0 obj <<
+/Length1 1549
+/Length2 7050
+/Length3 0
+/Length 8075      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T�}7N*)HO	i6J�;���6��!�(�%%�]RJ
+�� !���!����������y߳s�����u}������c=
Yk�%T	���� 򚚪   ���XY�0�#�o=��������C
	��1:�	w��:@ ����E�v�#� 
+7�5@��w���X��O$������#�݊ }��;
 �E¬ � M�ꄩhq���`P��R�Kء�1>>www^����������v ](
+�t�Z~AhA������v0�_=�
�
��0
+G���	qu��"�� =U
�6�����_܀?��xA�I�'�W"���`���	q��9�l`�P���/��
�8[�r�8��x����8�>:�$��`����B�h/
+��
#߯4�6+:[�Ý���hѯ�)��P+L�=��
�������ds��������
sq��*��������B� !��#! � �����U 쉀�6�~�1|�p��
��b~��Q7( �t��z������Y��P[�3�?�1j��_2f�H���� ���ϓ)�a�pgG����O��������rrp�7� ?��_ E �0���������1��t��Q���U�
+L��F��������Zp
�� ��oZa�@��[�;�������_���'Rrut�mg����c�8�
=�x`��,�&
�"���j�k�5��0W�����!�%�u���$�
�KC)�<�֏ah+�����405
a���p��Ń��dž�=+�����/�YD�������U��9���ֿv�_H A"!�DJ`$!�7���P�ߜ��:�ј �/��$�5h��|�_�ߢ0?���ׅ���t@ ��3�� �� |���� |rC~��j��� ���/v����_�(�����/pV�H$�oVb��-��}�P����J<ؾ&���J�Νg}Xo/��	?�p��Gq�|%^/+sV�Di��dfߡ%�r��8}�V�T�)x�ä�i�d;u}�=��}B�`��	�a�
��+d�c�(�NBik�
=V��5]���(��
���j�wVgjPы|���n���

�{����E�j�ID�V�u��3�x�J�征�y�n��Qjn��� [...]
� ��p�Y���!5`3�R{n�d
+V<~k������uA��F�
HO%]pY�z2��9���R�op2`�p��_�Z0/\H2#$ƽz�F�l���s~J��k���'ѕ�^�
 �:�K�=R�^K�uP��y�:)[�4���I�d��Ms�ľ����q�&��EV�C'S�4�U���uj���3���T��c��� 
+ZJ�܈��J�ޖඡV����r˽#4�v��;;��d��-����/IIP̮Ձs?��wu���WĈ�3��{D|?#Z6��ޣ���t�787
�1�$/���#�.��e�s�N��D��P�z��O�<��%2Qu��I�f�+A-����^�g��,{KM���U��w�/��Y�|_"樭�x�Q	JE�G�4sW(ڗ��
Z���݆���F͖e:�	�`��5r=Ͳ
Ћ
ƾã[���խ�6̉��.�_�ᣒ��M��=
�g��,i���"��,!
��b����%��G�A��V�4U����H���k�����P~S+d�X��Zr��2퍛�\���[��j��OF����;�ܜ�ݑnB��%��E�U9�!�udw�F[龱�¯�}Ճ���UT�o�o�
���� �p���rܕr�_|�-�Y�(�����y����Kƃ
K����^
+:��h�ھ;[�M�Y�kZ4ǂ����gi�K�������ca:%�5��E_��tn�3�#,7?Ȉ�v�c�B�ؔ�٣��.C�bϊ���� �"�����V��$��&0\���Z�S�z\8��q��`�:��~���~�a at 5ϒ����˯�O�����C�TR�5�5���tjĶ7����O�:�Xh�9��U���Ǯ<3�����ח�����aS&@�i���Ws��V[m��>H�>��OG�oT{{D�+����_��:�㴍���r.�'Q��ou��
+_-'���e�CB�Q�'��c�}�n�G~�^[*��g=�3�tK��f�Z
�>S?�$$ט�k~�&�ڟ<e�F�s�؆FG��J`������
+����mv�����i�wԺ�T8�:DZ�
:B�����,5|����
ȿ�;��q�ӾzD%t�L'�4͝�oN��X:��o�ZK�bCO�x�7y{V*�Y��I��������̆]Y
+�"�Q,?�}~d�oT�\�l��ݚ�H7Fd������В�e����
����&�I���x?�)R\Q��R�������q?w ���z�xҠ�A�S�=K��쁫��#�7�L�{���_7	;iJ�d�8�.b����s��8��ڶ<��So�I�T���@T��x�|G�76��ho���8 
���
4~�	y��x��
�����6�o��Yo�HVx��v����Z7�k��&,~��^!��A��4

K2�y�P�7�R���k���&��b�I�	�A���
o,�7"�rZ�Tw�F�9���
L�CI��o�[	}� �"�"���P��!����g�V�G]�FԷL�^�
~���!�ܚ٩�9�|L����h��֘����E�*\�E��<�e?�
��
*�jK^���#�^
c)�+!��ዌ�"�$Gu�Z�f�W��
�
+MQD�I>�-	��T�9K�ط��j~�9��i��Mv(\9�x��X�� �h^ �pc��i�x'97�.��iB��<�3�7�_�A��d>A�������ї���Z��������#�Z�S�6��+��O���S��{�G
�~sW��Sv�d���b��^����i�
��+�"V�sa:�O
r+	�q�돣Y������[�]�.X�"��@�d"��rЦ_�3���4jɲ��#2y�V�߾�7pƘ�G���x3@�
�v��J�-�xYI׾=���
�w�UU��)�y~8�+��g��\���g�6]!X l�I!�H�XK�Tb��8��
���K��
G ������ib��[_̇y��:�i��|�V�����d�Y�ݧm�ʌf���xܩ
ʌ��C��7.��d��Ih�Ө]��U%J�|����,�� Zݹ�s�Mb]~�''+��k�A����
����a�{Q��.]l�?�P��g�N��@���5�
|��B
+�p�_iAZS#���LTTf�L��ů~=�l�w��8p��
��e"e�1�\��&#!$�<��5
(��N�v\��)IXl�%�
@��r8h�m8��x�&��c�
+�"i
��S��p���<��h7��)}7(�O�\Ag���*#u?n"�� ��ꢉ��xuT>��|{�/
ʣ8J�
� ����!�V��q�Ɵ�.U�U��E��p��9�Cy�V�G�Q�i�p`���b�LeK"�
��2��P,��AE�
�9�xh�vB���S���`_'��-����+��^(
��olv���.T�
�y��'%{U)�#�D;^�]i��nԢ����%�1�Q� ���}�G��� E�Kz�����<ރ�k����#�+2��Ԝ��AY���
!�b�X�i��
+EH[��cG]�%����“��P���m
4��'>Z��8K����|��K�[����\��zqW��(��E �[���6j~O:w����J��N�~I|v
0)��L����5�qf�[�^���>@�`�1ۮ����ϋ�
X�>�ܙ��)
cn�Њ����TI���C_w
l
+˿~�l��9��=�ə��(����};�X28�����$G����e⛃w��
{x���N�����+ÄX�2����XU�A�˭������r�)��-lwOӥ)��y����t6�B���cq�#p�` ihgλ����&H���
v����=ު�)J��
+/4�7E�񝾷[vU/�e�/�T0�.
��v��cLX�B4o��ӳY_7�a7�FR?AW�!�#4ا���\��
�-���m'o���]Zh���V�X
+i�C�����h��E���mA�W�����hn�.|���ƕ��a�E���fe��@
+̩<�g�K�AD���UEX�

+ܗtU<��JL!`�Q�����
h<_�Q]?�GQ2�5,]��ن*'|��담�埸l�F��.�>��n&/���YE)���
�H�A���R��o�Б���R�L�2|�~5� %�|'6�I�q��.��c?�k&I��kių
u��
�Z���|�	
?!��t4��B�
k糑��2� �zN
�\$���,qy��Ho_<���Ev[����ᕥ������n\�sv|��Hh%U�L�/�M��O�� �Rڕ��$��X��@V�(��9qBNWY����V�+�>����O8t=��bq�=�Fyg튙	ZTh�sf��8V�~o���
+o��6���ܠ���T_��R�0���r����q�p���̇��Y�T�'�m��ڗ_w��X���uL����$(<��T7iX��!���]�y�$�����B�a��^1�����
:|J_��17}i	���=ӂ���Io���>/n)�#{���՘f�T�<^��J���d�j�`Α�������Cߦq`��m�KX�%e�4c���
�b���qCy��3/�GzH[h
K�����U����(����djJ���E�e�g�4�[h�0��j`�@����v�6#ǒ��uR�$4a�vN��GMaK^���OE�=��	�?�R*ǴE�Ce}��4!^�4#��0�~[����E��Kam�0{��U���/�
+xob��荟z*$�t�t2,2g����\'��s��Z,��w� H/���W-
�x �/+ö�)�����x >~Ng2���z��؃8��k���QÞʈ�����=�Jۿ9�];�0)�b�u���:����h��SwL��qŃX�'�-�ƥ��o�Q�U��a�
结��{�Fz�m�k�+�$_5IH	�h��U���+=Vz6�&Ϙ|#��DB˳զ�.BY����D'm ��L�|E�5GCd���թ�9�)8<��a�[%Å��'��r��삕�go�S}x��4Hoցo���z�����d^�i�ӆ>�(,W�z�9�#]�ٱ-�D��6 ~T*��,,�9ul���1�������&;��Ƣ���y��1ז�T�>�h:n�� yбq���J �
��4�x򒉓�MЏ�⮹�3�g^p������Z�2\R�g	l]����{_�>�h��-�L���Y���
+|��P���,$F �5��cUh���E(�ؾ ���G�����O�4��
ڊ�+S��k�L���
���ab}���\?n��׶v\N�o�y�r	���
+#g�h$��Ev���VmK
+�5���#�p�ofܖ��4���y�O����V����"�ڄ�%���,<��?uS*R��jw�G*�v<Q��'�B�

��8��CiX��-���+7-'0�
�ͦj
�����-����<���R����c�_�����Z7�Z|Ty�\�Z�<�?�
+���:EG��a����`�н�Z�WA�����K��p!eN
��J�ŷ����&�lW�o#:mf�p�q��څzA$�e�q�Իwȍ5�<�\��:X�d
҄o�7�Y&�=W��Ыڼ'|�}�
+~�s5�1�������5o\X�e��sd�[z�Ե ���T�`���?�ྂX1VV+�MJȽ�
M����}�5RΥ��Y�s���M��My�mDW<i���&Đ���8z^k��
+��<mP��4��(#�噅���ؼ����!������q�t�w�ďF��.�[<Y�0m�6t���3�l;w�~닂�3r�so��+���4h��8����-��zc�҅�"j��c�cau�p�N�c����8���1���-����x�\,vR���/����Ws�"�<-�<���~z�&�����,�q�j6O*WN39/\�~�Ɇڒ�$MJ�.�*�r����y�#��_��f6�pՔ!�"30��C�Ϊ&�f��������3��=��>� V��F�R%	
���|^�t<Z��(��l����<�����[��	��e���������u#4�$�e9��X���D
O��V�k�wC+bۋ�
q�>�
V�#�@��~W�����s�N�*��*J%�{��k�S�j�#��m['�t~��ޥ����RwM�����]��4�p��@B����K�vo(�
���*j��4��ۮ1�����P�*�5L��勫V���H�:s
�*�'�yIm�(򠭠��-w��h [...]
+~M̔*�봿u�C��1-��\�E;a�-t$�R8�b�\�(��ݭ�O$��Y��j��ˬ3��l6'vzX8��Q}ґ/Mc�2�hV�`���B�Ap�|9�:��!����i+.��C�ܹ�iQLzv���-�e˾�o�k�1V s�ۈ���B_��
��
|��C-���ۉ��ylC��Q3:��g�
̾��
 
襂,>�9��x|����5
QV��T�a6���	���
�1�,�����]��,��腝�����͌Щk�&0c�.�9�AM�H� X���F4ھɕ�����5�U5�j�+�4K5�E�܋Q�ba�4%h�. �vx��hHֈn&�_:>��>���&�+�:,���
��ρN��0![�z�[�qL�ǭ��c��sRr]��/�
+e!L�4-䥾͗�sk(b��M���R�����\�m��
��.�[O�M�"���+o�wq\%�u�]�z:�����2�X�
4Y��W
�N�~��d���c�vJ��%�n���`�
�YHu%+��H�N���d*��w���`d�Yx[2�A#�v���k�+v�e^')��~lSl�A ���@4�z���˗�n�y������X����Ֆ�v��V
0�X���(#����>)���jx������´@�K�)ć^����K�鹩S7�*Œ<! ���5���5{�E���>���ָ���X/�ll#34�?I&/r~�
�['�|��#�Բ\b���fr��}�2�>͚��L�q�ϭ*��~[?�~���:���O
U�[��� ���:-?S�CE▵oL�
tHC����l��b����G��&�yl���=G�'��
��Da5)%��
i��.Q�����w
+�W��
�V�3���ޮ!�
���t7o\C-~zko�IDV���I���
����	O����g��Z
3�4w̋���E.�CR*�G
+N�
��S�bcS�Ib�ӫ�G���9�h
+endstream
+endobj
+3448 0 obj <<
+/Type /FontDescriptor
+/FontName /CYTIHN+CMMI10
+/Flags 4
+/FontBBox [-32 -250 1048 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 72
+/XHeight 431
+/CharSet (/e/greater/less/s/triangleleft/triangleright/u/w)
+/FontFile 3447 0 R
+>> endobj
+3449 0 obj <<
+/Length1 1422
+/Length2 6267
+/Length3 0
+/Length 7233      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�k�/)�")
2t�
]� �)
� C�C��4�H	ҝ�!
�H+!!%)�|������u���޿g���L���-c���)"(n0H
(���,
��y@ >ff=8������ ��
+G"�����

�B��!(��:Tqs ���`!1����D�vD���!�p+�:P���0�!��\�6�(t���@6(;,**��;
(�s�C!�:e
sDW�B
��H(
���W
+6	[�I����Ã��ʃt��d�z�Q�@
�+��
f��q��A�C�
Գ�����"�Q
�p�CaWt��
+�D�*�5�`�?�j
���
��O���%�#~C�P���G� ��0������ �~9B
\��x�;� �D;��
T��B� ���
+u�;�\y\�� ��J��e��
���@���O
����݋��d�H��_�5
ae�
����>��S����"�GgCA"��"|@�3�	����^��	����F#��qB:�� `~pk������\�`~>���o� 
Z��(�%�� �';Z
��#��������A�~�9=E��
+�p�����|yUU���8� ��MV�	����A at 0X
F����?����[����蟄�k$
��}y�p��l�
;��%4�h.Àl�P�$��?����
����,�/��wC�n��l�����w���Me7z-ԑ��@���!��*�ì�n��mUFA��!��AS�,�����*�=aVZp�������
�B���8�(�l譃ڣ_W���� ��D�
�/�^�����"�~m#�����"@-	}�赵�y��;���D�C�h�~@k�
��1���@^�_��DQ ��o�_e�n..�>~������ �A	f��P�`����*�Q	ܽ�S#>��<3|T�„�r�nfƜj��lX�̮]C��4����j-]���	7��7:˸������ �)�F�
�dهb�.�Z�Q�:nKY���2���t�$x��)
+���h�uTe�Q D
vVtPM��zk��T��+��Ͽ�0�H�xŠ*�vF�Qyo�o�����3*P�=hm�)E� ����4X�%��.t�~u���1����{BQ�Zz��6�X��z��� ���
���u�B�N���׾�V.�
��
Ra�j���ߗ�z��w��T:��W �t�`��W�����b�˦+	ֆ�h�0�wH��Xv��MJ�Eu�$|��8ˏL��~r�gE)U��A!{i����Y2`\n2�
.���>Ӝ'r�<���WTT
7S���Á��j�c��AD�ˮ��{i�z��)�Y����8��IV~���u�3�f6�������_�+��V\��Y,��:9S��-Z���X�6k"sW�ً;c�����װ����oO���}�
R�?0t �k�z��&ѣe��|D
��2t�,
$
+��-��i$L���'����t�\b�+"�Qr;����r�@6~�F���h`B1�]�� ��
+�(�j2_�E X6J[�Y��oUVb���~�G�����&��
4���֭��-lyAo�D�ױ/�-
�\/�
�V�
DZ���{KN͂u�>�8��5O��� ���}n�%�a�G���>�m�1e�8X��[�(�#&�bpQ���4��
+m����
+�fV(*�h�~��s�L�=��Q�zn�:�(+���W��16f��Q����cQ�u�Ws���2�N�`�����
���!N}
�E��8���>3���
cwy����q�ɒT/��Ez��f����\��L�K�+o
��5!�¸$��
p�XT睛�����#D�f����
,0ܔ��ۥ�Lh�lF_OzԿʡ�5ED����(j�	)ը�E;>~bt#��e�|�!,gR,П�e��!�2
�ո�T��e���Xĸ�$�mJg:y�Ҝa2�p��Vx�]g<2�A�N���F��
3ϕ��w�
)3�1
+:9�2��v�1^vS�m_
O�V�p�Rg�q?Q�}wv��m5�R�a�|�Z����3�fn����H��ef����E�D_hK(��e߾��������n�ߓ���&� tF?M%�����zn��Ⱦ�ιgHG�ʧ�ug�ё���ܘ�ek�IQ��Һ�.���I6���"AK�q�f?� %U	�
�3��G
�O�u���
A8�)N��s�7�1�!����?�7�T��6\���*l�z�
#�i�F}o�"H�����e˯S4�aS�
hx�P�,
��=5U}y��T�R�G҄x�~�(�qJ��s$
l��\�zT셇L��
+�Ұ�H	�<?
�Js�;&+�
�$��-�>r.c>x�U���sD�bP�=��Pٞ�3�qk:�����n�+N�NfДw'�.DQ�9�
V8�bTƧ��uj*y��-vz��5�|�#auy�I�zs
&~R%S��nZq��m��e%�{�پWX)'�Fr\�L��tt��T�w�DG{�id�:������
6,M6T;�I�,���n�pN��D�>k?"�j&@���2u�!�1A_��#H�Y�M���Z�H���n����B�*� O��O��$�M��	T���������Uh��4�5�d����
-�o8�<?cy�S̺Jʐ-j�`Y�m����R'�nUU��Ρ�ә:3ͽ�}"�M�.NR�٧M@����lW)�l�=ሢ�J���i=,x<<) �B���$M��ө���+Jw�9���KX@�y�Y4i��i#,H}�=��z)��~����g���X�z0蕾>%vk_��)>�w^ƬA�)��}9���Y4~G�	ڔ�S͛��aQ�@��7
^U�Ŭ�P�v5<��q�Ә�- [...]
+�}.�wTq*:�S�Q*c瓻��
2_���&��>�u�*2Ar3����� �ǯ_m����떞[$WN��Qe���D���
��{
aG
+�'��(�)�� q�eO�=�Cܿ/��.�D��QC�h�
��8�U�����[G����W�_���%p[�
�{����E	=�͑�R��W�ף	�'EϠ���mГ��w�iQ�N�.l���
j�<d
$�hO�˜[�I�y��=nT���R�҆1G u{(ׄ��'��
���;j���c�X|����&�~�P h��
W�^��φgh�jh��#�qُ-^�(�Vۘq�K}��IΎ|���V	Tc�m�����b����(�G�bT��h�;R8���:ϓh#��_]�$�Ī�=��Ğ;�0��/��|��gyWc]J���u
�/_�
��W��<��)�Nt��|�{��]J
���/Ŋ�e��=C�PS�v����z�f�����U��[9��dcǬ�;;�/xH
f\����$i��f�UH^O|�����ʍ�y�6Ē�\lK���,�W�����@e=ő ��6���h����1{fʚ�=
����'�B�w�jEN���d�f���<��O�����<��W��y�
X?�'ؒ<�t6[��?
<��� Y�Z��mq��ӹy8ɶ�
+.���{ֵ�=�c'�q�VaDi
V9����1�����쥮f�M��-���Q��hV�Hh}������x����#�U�TxN?H�
+x/΁����3a�?�
+��w��+C�DprJD�U /C��>k���u����g�:�>�c�N^q��hڠ�gh���,H�~�
�oN.�;3&�����j���
y�W'J|:#E�<���P�X�ܤ
�{%>�QE�e�!B6��6�.��t�񃇃~���k����-�����`uv���3��Z'��ܼ$��m���kh��²�]sێE�j̃h�Ô������o���
��K8�=+�u/�>e�n�^��q8�^�ep�����B�oƨO��r����C�+�M��}�ݗ�}V�,�]
�ֽ���1��b}�9��J��X�i<ͺZD�q�z6�g���
��2�A;z��r\��י3�L�AH�ê]I��N���c6
\��sJ
*~
��I��z�@o�c�c at F������<G���*3w�u��ԗ)�\-�^�a��E
�[���(`����O�S���h�� �0����ܒ��I2�Zv�0�z��X�Y�I�~��Q|�Y*����5sh�N̽t>w���
���ӱ6�z��*`�9!�姹��6VD���z��JI���r<��=/O�&����l ug)�	V��OM�<���D�xsH�g�����~m��y����x�6}��Kzs�3��VTK�bN<�x��wfS�1��.���KE�SЪJu¸�Vzv<e�.FN�ج�
wE��H����:[��-	�
+�)ʨ�oX��uݛO��iTS��"WX��o���D��Z?E�+�����l��7�Lē�R���/'I6���Ζ>\�~�W� ��{�w��ɽ�	gq��zG�2�Ԍ^�ܦ�ʡ��
+�[?��X:7[e��˞+�bg���t��X
��Z�nE�G�F�'��0��E�&�O��x7�� 6 at +�i�0�{��ÒMh�/\jj>j�{N�t����#�� �K�>��tb>#R7���x�x,9͘���O&�oϊ*�8��
�qob�S�-V��o��=�[��9tW]W8�|�?o�8k��wN"�H������d6�N8Jٵ{Vݵ�oc�������	H�[�7
!�����lޕ�7R�Q��c��d�Ȥ��_.���V�"Ξ@A�P��@%k�N�+8}.Q�Vצ:G��`���%��'?�ջf��m�?)-2
�'�y�?�X�E
9yZ6�߅��4@����(
���G�q$t�o�-�#jǸ�cz5?�p7�_�?�**}u_.��,wŎ�b}IqŦ���x�̡
6�������ct�b�߻�T�z:�Κn~�I
.�Q�2�h�T��G�}��:���
+ ��h�m
��Ih�e��,!I�r��]��#��a\C��tv�J�W��{
3�T�3����I��/�p˼Zj�wQ��^(��
KW�j�
P�y��A?g��8��iE
�}��jQ_|�:;x�g�ވS
�qs1�|�ƥp�a�F�r՝tЗ����1���ҫ���#m�7Y�dw����7�������q>�d;�	�
+6�y�������
�)\�����2����ޕ.��f�k
+rU��K��
�T��:��M��
�
iDX�Y@���N
�ZT�:,�<ש+;�n�o)�|;Q
���Z�m޲�4�������э�)R�b�A�P�D�&F@;"c�1(@���Xc�b���
��|��!2H����]yn+^:����|G�GE&�
��O
�
����y_�nK�1�%4톼m��~Q�
�4��
�
�`)Ħs�ge�?�Y�f�`,%{�ų��U4d��>	���u~��y 9㍪tb���w(z}3�Í�J}��L(�k���&�L��K������I�j���j���sDu��>��Dt�X�v�l��ť	�o��7�@�A<^Z k}4�p�O
���lH�~��M�e]�<��f�H�������r�s
�K�U�{�t$m�S����bx��q%�md���̋�37N(��ql1
���w*��VJ0�y8T�vM&��Řnz��bx,H����h�"���o�q�f#�),����	�yo�ph��JlXҫkv���jqq��_���`
�����`���Y@��'F@1T�5��c��Lb�T��+��!�9Q'��%0����Ѣe�w�d%3��?`��k�fFO�����Ԥ<��Q��<xE�/�Z�~�
�Νn�����v�I
�0 ��#��ud�[�E�������`.�ţ����:� [...]
+��-�]�L�ߒ��e ��hT.~J�٭����VHx�OS;x� ����j�XTw�4y��й��_��Wl;d�c����
D����=u{��u��S.td�ץ3�]uG#]a@�>K�t-�0
{G��v����y\�Y+��co�̤��(��cTi�.��z�[���҄�Aˎ�y�
�ޠ��zc�����߽wۜ��|J���j��ݹ��T��g�#�����=�)�W�4X�O/� �q�{3���1��38�Γ|fΪ_$�O��������>�u�C�1�x�d&;9�/�1i��i0ϴf�%���/�tk���9$���e��؃�����]�K�s*7κ������5��
�M����)��w���_%�S~.<���E:��%�='
+�v�m��eb��k���j�j-u86)e�۠N��g�
�%���#^�'
0a}Q��vC�G^�� �|F����@	�fՑSV��c��
l!Pr_5�-Y?���D��#
���H����㝄���_�^������X�
+|.�����w��<kv0��b`9�	��A;�	��Cf������tV�
霨%҉,�Qض����yY
lH��
���4Z���k
�:zx�8�O��
zK��{����͡r���Gb[۶0�R�[I1���Rz�D?�1�
C�)�]f!��z(LE�����^������u��~�$�L����ozi�4.�D�a�u��^�ɛh�#?캣�RG-��a�p�|�]����/��#J$��;#ᣵ��v`����tw���R��/w���O���
��tnG�j=aVDYr���syy)j
�6J�*
�0>mI�:q��Q�l�$42Zie�wC���L���SFa Fw���C�Y[�2�Z|�k���}:y}���c"�&`~��ft�eQ�i�w�t�̠�Db�.�-^�� B�B3�JqG���5���x_c���t���wR&�:
�O��I.�fe+
����P��
+endstream
+endobj
+3450 0 obj <<
+/Type /FontDescriptor
+/FontName /KJFPML+CMMI7
+/Flags 4
+/FontBBox [-1 -250 1171 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 81
+/XHeight 431
+/CharSet (/s/w)
+/FontFile 3449 0 R
+>> endobj
+3451 0 obj <<
+/Length1 1569
+/Length2 7412
+/Length3 0
+/Length 8449      
+/Filter /FlateDecode
+>>
+stream
+xڍ�Tn6NJ���8�F�tw
H
�F�����n�N�V$���H�H�7������|��9�s�s_�}��X���d��`E8
���
�ih���@~n ���E����R��]\!p��8ȹ�A�N
�@�i�a U7(���+$�+,��@ѿ
�.b y�;���
P�����,rp'/��
u��G �;�WTT��w8@����  �
�u�
+Ѓ[A���J�&n�@8���xxxp�
]��.��� ��
v����� 4A��?ȸ�Y �v�?z=�
���P�把p�Y�] ��z*� -'0쏳�N�_��r�����_� ��� ++�����l P0 at KQ����`ֿ
APW8*
��@A�(�ߕ� �2: 
+�_�\�\ NWnW�D�_iP]V�Y��

�0�+����!.`+T۽x�L���y�%�@`�6�@X�9�<�A���*���T���l�� PD�_D  v�=��x~���r�6��R��z;�� 6(`_�
����
+r.n`_��4�����
��X! �`[
���(5�揌�
�`Dq� ����d���5
�����|yt5��8� ��&+
�xs���� ^�� @u���4�4�o�� �_��ͨ���������@����_;���+4�(2�l�r�(�B}��?o���?�����������6����� G��/����Ѐ�������?�����9��UB�
��q.^n�_݅�*B<������&�=
�
P
�
w��zrPQ@���Pkg�zV\Q�c��v�{��d0j�������:�	
+@.. /|!P� �����`�߄�p��T ��`w��5fAQ j�
A�Կ5�������Q��GB�B���
���_�W ���( 
�A-�Wנ`Ŀ�
h�oԅ���n�����o������Q�=�V�s�p�'��5��gU2t
\�#��)gF|\#��q}
+��k�z��j%�s�����;4e�ϲ�g~x#k�y	�p=P�j��2v��}2����i��	-�0I�A�K���H�N<)k�>=�G5=�	
�E�ª!���UE�T�{뺈f�����ԏ��
c�6�LÓ5Ә������=*IW?,����
Pu����
+A����� N��b
�U�;��4roK��һ�}�+�Ig5�Gvȣ]3��νY�Խ�{�J�/�r�㥇�~ęN��–)<yG:�
r�=+i��#��_
����"��UT̻ks����ﰠ�U|G�}�Ae
F�B�v)���z�슳>��o0��i��s�D�K��fi
.UL-o��e�ݡ��Ֆ����,��3Y|OM�����x�a&�[���5����T�S���#�O_ֶ��}�j��+��4��}
�d����A4ӥ�4;I�����]k
{����>�`H9H��O��lB���WC���ldZ��qQ
�qTI'���H�f�O������y\G.�9w�t�
8��r�BSH�bHbW�qL�d�b�n�㛮�l��{o
7���K?��|�L�2�_�*S��`�x�*SF�-��瀼܋��y�&��4��qsfj&%��O+�|�?ڇV?�{6��<�&��&D١wҷ4������}z����x'*���� �?(��vz/��
�}?�
2~T���
�l2d�����N��2�gc��!��/��9���VRb����0���N����Y�9]�����䉢�G���wi�Q|�M���w�q�eK|58
=�m}a���i
=�.�f�*X a�����t��P�Qz
���g�H�����[2 F���)%�X�����>%�׫_����y/3[��k�8�X����M�]v
��G&7Ƚ�7q�8�Xi��x\�l��^4���,I�6A2��Gg.���D�5)�%BIt0�l���a�q�i�T҃���4U [...]
+�u;�O^7{�0
��*�9.�����π�dRt�
|8�ӷ��.m�!�EWQ����$�z��o��"#Ӽ5�U�
��,2��Iڀ���hO�����5�=}"|�.��p����3�Xť�m$�]X���!o�Y��
{�\'�+�`�G��ׯU�f0�딞��כ���ک`��}�j^S?�����WA�� F��
���� ��;
`B#�7HؽpskcM!�QsO%E\{����4t�/G��ԟ��qŋx�[�=�B_��c�Ӌv��!�
],�^!�܇��&��Ur��	��
�՚�Y��<қ�z�4���]
0!�֒į�<�j��$��Ed#�F�Y#����Y`��z*#���=��я" %]�O�1�H����q���/�W�2�>l��d���ي���3���..)
9,Kf�I�IEǡ�F���o`pu����G��MU�(���%��b��D������oE�Hn��VYz�bSJ�X�[���d}���Z?%�<|&�& ��ԌPۋ;N\���*P{��2�I~*r�-aNt�;�r�.�)���K) 烵q���i�� 7�u�&�g�+��
�P��EF;�O�O_�h��`�d���s�_�Y�e��]�v?���PY��\�)�K��������<n-�5[�v��O��^�; [...]
+ܶ�|h�N�)��݆eD6}
?#7n�
F�⮉�w��#h˙�?eYP�9/�f����t*)��c	u��ʥ�`�����"@���ȉ��c�V�W��y�Iv輖�@T�Wˍ{g4
d��M�?�5E�[�\�ܼ�~���<x�Z!����XL�@��#�8o�e��[��l"��~��㦤F�:��k���\���x�MVo����Cf�m7jjI&J��D�� �ԙ�r6-y6�ztTѿ�1⫛���ÜJ%�EB�˥cKu���㾏��y�=�ԏ�{��|=%�N	/�Qֲ���8>�˚i���S�r*��
��'FP�
h�6E,��~ �]��o��X3�|�OR��ΰ$�hƯ^D��ߡ;f����[��b
�
=���8bk�5���ɍ�
+�O��f��rT��;|�m�6�L����pS<�Ss9 E<�R~r�K2k<�n�
�=:-��:�r��t�S�|x�+D���}�[�ėGq��i�
i�0'A��u���c��oy]C��H8�n'R��q�u݀���b�HĈ�ÿ���4�Q
+q�|�����Z�
���x�C��
+@"���G�an~`r��N�R�G8uIe�9X�̖�#@
�T�˪����9%��	GϝՂח��T[	�X��@l��/��p���J��c
�m��ѭV��1�FV�sj{���E3[D�����o�yͿ��i'���WΏ$8~���ӡ�95!UȞ
/&]2DCY�Lv����Š��&���(�f��*����~���t�C�m� ���z�֓,ss<����S����bn�ǯUÜGb�x�9�~�}S
b	�+h�ZiU6
�~l�7� y���l�t�ƌ��Z�I]�0�a`���l�������{
�a��U�I�'J��.�]�N�s4�Ȩ�l\KI��S����
�fS�頼Z�G�1X]ùåh�x������!1�
+���^���m�:,uN�JEc�?

U�M
+�d;jl̈�;j-�U�҇�#)���W����r�s���n屔����.��T��Uc����Oޮ��f�OZ{%�6k�k
u��
�;��Z�(ĥo[��/��񎧤Y^X2��wS�pZ���U���0��*i}����a73S�9��u��APm�I
v������'��g$�b9�-�ַ)ٜ}�P痿\	6��l�ʬ�3!)�t�Te���9U�xS��p$��U=�L��+\��-Ʋ�@�B|A��#�h�Y��3p�
���InL�Ȁ�t6,&�<�q����~�sK-�6a^�
V&_ ^)�c��p�U�KH��g������љ���i�&�,#l쐗c���r2�6�x�C� 
�x�'Wfo�(�J
ra.�v��
$���I&Y-3��36�T�c���&��#��cj�I���<I��s0�J�n!SWp|��C!v�z8��
�|�f�
�^��w`��R�j���S�5���_������z at q_�E��5q7]
�,P�AC�Y��j}*�ӻ�'ȴ�<k�"
–]�8��{�סd�(�a��5��_�������:R�)��'�A[u��k$�����1�I]��e]��1�٪�|ٝas�P(�~i�.~Ni��!�TSU��A��e;}���
�1�w"� ���7�
;J��M���iŪ#��Y���N�(�c��1S!?Ԭ���~��kmh+"mf��RmC��x�
��1��/h_X��������dƉj2�0݋�)x8���3�C�p=�� [���������ᘕK
+�א�D�
l}
.zk׶
,���4x|�Rc>��S����w������6���H�0]������]��D�"#i����[����E3�+k���C�U֓������J���y�d

�)TH�Y�$|�����lE�J�
��Dv���6�eq˻�Lƀ
+�M��Z
�Hp��*޵�~����5���f���ګzۃ"G�>>�����Ur	�$A��[*ɾ;��K��;eR4�n6� ����5�ZX
19
���و09vÔ*h2�(�S�%D�-����I[�#^@��2��F��`y���$���& ��H�+�W0疚�&�A��鎛��
���XJDQ7���9.dIe?�tA�0�|Nu$o���)r���Y��A����c��v�~LJf
���&�G�}��i}���
[����Ɗ�o�Lk]$��uj�
�[B�y�
��
��bk��k��z�0��k�j�
��I�d?&px�%_���1TA�^�<�
��8*�L!�</�N�
\��
Y妈
+�� ����>�����
+h�W^R�%θp*���Vi_fA�)*��a�|�y�O�6?�;�HsYJXm�����o����5�)�h�J0A!9�6���p?��1�ȩ����5��߇lG��H5��0
�x
+
yv!ؙ'��l�(����Comd@���
��Tc����h�K�C��б
?��X�⊏�
+��-�6ˏ���d&�0(j5�,K��Wwz�>����f���;�/p�?��x%(�j�}N��������Z�|�s\�/X_�~騲
+
�8�/��\�vP�T��+�ߤױ��P�*����]��&���Spc|ës��ttU���o;C&a�ƭxC1�m9�Jw�2��m�X�@Y�D�b�h����#9���%ЭXBJS��NO}�g�L0P�J#?��d.s��
w��+����^	�&>�Mq{��)~"��%��*YO�zw4ID

�mV)׼e�����f�*��ˮ��
����y���|��oƇۃ���;0u`���E��#��
Fy���j|�bka�r�W#��N�D�S!���{i�W
��pu���7�Z�E_�u��5��Io�����V�����]�C�i$
����[�L'�,�.�aq����·V��ў�f@���H�f��Ao����!�ULT�I
+6
+ŧfM�u��[c�ήw�$�D��F
Gn��Yv�O�E�J�M���%���1������0��DI�ū�������d/Bz��~�� �*k��=��ʋ�':'K�A��l5/
��bE�������NJԽ�� ��*��vdt
4�aU�p�Kmھ]���H[
�0�G��|'�O�
+X�<s�X��t]�
>����zϋGЯ5�K�%?N%�Hi���%6�,�7ΊڕO�D�g�U����Yu�ra���w$\��
�Y�1����R������^��B-��m*��4�
�
uXZ��f�w
oo
+n<�>��u���W�+��?B��ш�`~�*�	%XT_	�m�YH~������F�1�M:�wo�@�w����g�ɒ�[��~�B��yG�>��g��r�c
+�
+�+�'�ˢ#��s,#������.:ҙ$I�im�^z,,R8ET�t��=(�D����w�]���qG�@�ED �ɒ�Tj�l�״:���>��ƈ~255���~�^rs�~��K
sO@ �]�UNjcG�o�Ȫ�
Q��~��Qg˗�;�Hn�߾����!R�{�e�s[�û.�;�E����m5C��K��A�i��
F+�Zp&�}��P�
#1ي�EHE�Ņ����n����������*>k��ғ8�i���d�
-���[��
��=�Yr�^yQd�s4�&Nn�:�%�&Qg-ם��ո���
���&��hX�웱�b�
+>��]�W�f�-� ��]�gQ���=����hUF�Op��Ye�;
+T}��(��F�e8�h�hLxo:H}T���W�ܛ��ę���
�O�PZ�<�#�J�gP�D�Nrx�T�=��)�KƬӜ�e�%�ߜӦ���j�Y������Gl�+ҫ��?�q-��<�н�6G���|ne�����nʃ�ɏ���
���DW<L��!��de�
+���2�n�*z�o]��V�?�x�y�?�$�+�0!�*]G���
�=eb����v�D�
qA�?#�-VX����?_k��Vo�>?
��\	k8�V�_^�� �y���'Okm����Z�g����|�e�D#
e�{H�Ye<�rV����q|����gvp�e'˺4�
+� �&��xUH�`+��ٳج�J��o�umt2�C]��U�'�Xi��i�A'G�ޮ�����
+j�yn�a
5�+�>�7�4-Ew|
���)]EZ�e�Q�����.#�L:46�y��!��8��)}U�
V�����dC�a\+c��}�w������
Y��i"d
�H�@_	
�{�m!k����CUY�P�S���BI�۩A���2�t�R�P =���q^f�&�~&�Q�~jf at k��[Lw
X�ͩ2��6�j��r���:u�n�\�,��ϕ�uS]mu��6"Sl��;[����o����9#
ҙ�e/�awS����+�L
!�V�oZ�]6�\��N�މ�ш=�ǚU)-���$�)����p��ʤ}
奩r��J����S���db�}��k�	��O�\������`ǛA��!�"z���)w5�e���&8���>D�����I^�M@��\�n��Hfhwqk/}I�ȳ�y�
fh�>��p>�I<3����V��{�ߝ>��QP�;Z�\��R{
м�.������s����~�L���x�{3����
�O�25��;f,CO��.Z���?;]����m%�c,�:.�Y�
7fu`�kC�
�U�}&-�5�s�p��3����N��%�S�ly-Y�
E��r��׬?z�G��R��>�����7l�9�O�
+�m�\�����+)��y9Y���'R�q����ה:�\�	�{��f�y�t&eeOb�y�W�ߨjlG
��Ά0E�3.�!�3+��Q���?�f#��p��pD
��4vt\�d�@o�yF{\������ڦ @m�� ��h��猊{�u�+�X�z[e,�ꌜ)
��ا̤սI9޸%BY{c�f];�"�v�u�)Rw�{!�7��iX��r�V߈IF�$x\@��^����ᴘ��|㋹W\���;�>�P
+�2���\�w��{ۅ�e���rԢ+n��4Y��CQ�}u�$�F�"~9;Zy����iZ�4����v!$�B�[r��:�G~�ֽM
�E��I;%��?C�A"��D�]�6��&���_���
��-&nf�&
y�r|�)@�H�^�J��<�U�`�r��
�A
�>��=%yl�E
d�W

-I����D����i\
����~ۥ_r,
zSo�q�,��qv�O��
�^��R���ȁ7�0X����S�$'�9����h��=�
�EM���aR�$T+!@;XE��v�n�ݢ��f#�E7�c�F�c���e��!�O��I�b�{��?���vFr�H����#�x�{sd<o�v�9�蝡

��H׫�=O��0���$��9��=�d��J���? W�"�O�|3I�����y^q"�	*
C6De��]�
�Q_ž�g��
a&ҲV�n�i�A��W�Z��@˨�� ������W2v����ǭ�=�	�?g��},��"�W�("2���O��m5��8q��_/��#��MaH�M��b��	Yi�m�T�M�
Œvb���A�M7;G
�KT�%��L�W^`��U)<�X�
y�!
��V2m���λϕ/B9S~�����v��B�"s� ��[K{'�+ʹ^�Y��^G���@5}d�]q:�k����PP?'3�ʇ� �!x`
+endstream
+endobj
+3452 0 obj <<
+/Type /FontDescriptor
+/FontName /RMKTHO+CMMI9
+/Flags 4
+/FontBBox [-29 -250 1075 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 74
+/XHeight 431
+/CharSet (/comma/d/e/l/less/m/r/triangleleft/triangleright/v)
+/FontFile 3451 0 R
+>> endobj
+3453 0 obj <<
+/Length1 1511
+/Length2 9163
+/Length3 0
+/Length 10177     
+/Filter /FlateDecode
+>>
+stream
+xڍ�T�-�)PZ�!P�B����P4@�P�CqJ�Hq��K)m�"�ݥhq�"�~v�{���V�J�̞�s��='
��
�V�9G���%�V�q��x8����t�{�_n,=���W�4
F<�d���8UG@��
 ����@B\\ n..��
�B ��
+��	Pr�A\��
�<�P[��6/̖, ��� �� I
j	�T�[��Î�`{���%�����"�������	vp�t�ۈ��ܡ[��w�X~��
 2��b ��B]��k;Z#��p��a���\
2\aV8�as���
+@�	�3X�� v�_w q��)�W��BP��`KKG'0�
+�XC�! u9N��
 �Y�ۻ8>���P{��C�'�$5���s��C�.�.P�����<ܲ,�J���C�`�>�
�|�vO��}st�y�eXCaVֿIX�:uaPgW���_!.���l  ��  �
�xX����t���~��z;9:�H@|�֐�,o����B|��
��������
+��O�7��O���p����A{  ���?+�yY9��=��G�����l2���r� xs�r8��� ��"xX��w�.�o�x5����0kG��

.�o
nɂ���a��j�Z� ��#}c.>.ˇ/��� �������U�o���ɹ���3���`����)�"
�B��a8`���s�U!VPW��E�����s�P9��J����SCw᡼=�pt��~l 

��a�,_=<(.���<��o)
�t��=x�|� 0
��zh����=L���i��0G�C
+��/�������  ���� B�]����
 ���| �
=���| ��?�Ù�w���n�����'�_�,]��i�Cv����xZ �%�̤��p�]up�e�$�;����ú~2
��
���5.FKeZ��\2������,��,ͭ�Nc
ƛ�8��_>7f�F֛�����
��H~�zLɡ#��s���
+���C���
\�
�K�Ny�O]%s��������7%�
���
+��-�'H��
T����
O�����3��i�޳a��F��{�\掺��Z(��vi%�'{IJ�z��?��-���D2�]�?�mڣQ$�&�	{�<�3�-��J�V���[���ZV ����Z���zB38�:Qe�Y�#�+��k���s�6k�$�Y��O���'��;�
m޿j�z��q\�&5]��������w�Sڸ�Xem����R���J(��E�g�n	/n��!"ށGR��y\\/_�u �S��e�
E���
�}Y
Ǜ�w�7	��W����tx�Gf�#k�ʜ�*��6{1�IS�R;
T<\.'�)��Q���7}�M�ϫ(߱>U�n
�iw%�˹�W��
×�I���1�U�#�)xn��㼴Tʔ解��a�{�ToԊ�@p��/Z���.�)�(�
�-���H��:�G?���^
h-�qg/Q�a`ʟQ�R�)��g�dZ&����_���Y�?w�g�Kf$��g
Q
is���>���
ݑKQh�\�<�ZF�
X��>�J�m_n\��� �{��j���vj���ɒ(��;��E]wɚYʏ��� K�=����c|��"�U �3�-���O�e���J����n�p1�^$<	)5n5D�_���~<�qß�9�!��	�.��N��d��Ϡ��R�F"�h���t5ߏ���u�A ��^&Ҫ�aOut���l6m0��G [...]
���FQ^=2�{�IJ=y�ڒ��x���߸�i�W�׍�(��B�)���S�
ѷ
�r�%��cU�+�LC���h7o�%��I�� 
+<ӹ�
��j|��2�2�v/K;�|��78L���|�g,j*�9f�pe��nu�1��
+~E
zz�_?��8�H��ZIw�!����d��S��
6��^o.���R�]
_��qw�z-�Ʀd��g���Z��I�Ƚ����%��\�xbK��C+Ƈ6��rF��ը���_0t�
��q-�YVj��
�y����C���
4[/�iU�F+V)
w^����z�D%>�^��rŶf;z]��]
_t�3t�
�%r_Y\�6q,�XT�݊+�~꺕-�/�N"T
�ŜN��,���l�]P�=)
+&U��i�3s�UUf�{]	n���0Ů1�߶(�ت]�Lz���p�A�*n�Dh�ڂV�
:��m�N�z���rҼr�y
��d4�k�;��qKq@볎t��
���B�z�,�R*�
��}>��
�ܥ�t{�
+����ϛ�
�`r�t�H�H�/���
c��:uH����Q,$���}
U��&ǒ���(�~⹦�u��_������A�)����#�
����xR?OY�|��:5,���v�ա��k蝜�c|���R�v%�
+ȣi=�h})J�M=��G��=sP2�샀��-|�����r�ݨ%�5�9�>�<���|T at jf4h��G�}r��U�DG���-(�
+
��
�t7K
����n�s%>�	~g�f�M�yѼ��1��&��!WX� ��x���Ue~{Y
+�f-Y�į�Ve�p��^(�
P��C���'<��26���B�S=c����E�$u�nGh�M�������ܥN�ů��_����m*��g-F�#h�J&'���^�y5A$U����?���
+���.���r\��Ra�^��01�s7�&)U2��L��K����9%Anj2_"T��U�w�q��6+0{~O�7J����k�E���h
�GIJ������-���0n�^�O�0�
"���1��p(�Ȉ> ���3���-2�ۥ�^twzI*�Od� cyr
ey4�X@�$]�K�q�$�8�xs���-���,��}59�-�L�v]
+-��Ra6'�<w2|��X�
|��[qD���f��+�?���%q��	F�A��/\9O\��Wg�OĄ���zkF�
�+��<P{��]�&{���Ar
C��[IK �;����
z�g��x#�t&Ͻ^�&:�
�=I�
+}�r>�U�	�|KOk0�.�]w"J�$�_�@~��f<B�
+9kL8�u{<�>@�
{���Ix���J��]Y��=���g7K�-�"�
+�V��	JP]Z
Ej壟H˚���̱]����@�7(�����^�}I�g�
��

�)�ݗ�.�o���W˩���g������w{\�κ��i$Э�p�L��B�y���7�ǹ���B��
Z��өd�
�w���, 
�=K�i~|
�o���N!�Z2�!>��2U�[�媚�j3�|RkR���d�J��5�����u�:C|[>NS��G\L�Ѹ>��C֕��=�{w8�
�:�T�
Su��KM����3��ܵ�ĴV�"�N�/7Y���t��d?
�����u:
GLp�� �
�����M��ɜ(�U���}�Vy����\��ܡ�T��v��k�=s��\�9p�n6rc��M�ۏ�����
޸SP2��A�~�%�����1��*kJ�h�E��١c*����{�IlLZii�oKLN}��u��\$0�e
��d+z������TF��������4�N�y�u��ۙX�f=���Y�D�bV-�U��&3�[�m�
e���l�M�28���D�V��R�Z
,�K�u�dž��&��B2QRʯ�
�&��=�ILw��ڪ���YX��/�]�Z_jx��+�d�lc�����SO>3$��:�9�ٸ\Q0�+5B�%��Y�]
+�8�q
(5KݞԺ Q���l�O�=�4�qbF?^
�ɻt5�h�
��2�];xV�@k���zڵ��E�tjI�RiI���x|2˚2L��S-�|���?Gx�A�\���¯��./d�k&��w�<~G�Q�ҿ�dmRӠ�
]a�p�i?B1���_��!��4������t6Ў����*BR
�C�	,1"I
�l���,dΆ0��u�h�Hs��"e�7����κ�y���
Xb�[�_5�އ��������֥_��#�1�ɘpLτ���>�Ilz�~
+�e��
l"��tF�*����x��L8C$ƙ6����W��t�ȓ���Ou:����E
{����Z)s5@
��!�(���<�J���}�	��Gc���M�^�u����� ��-$܇�cnz
��X���q���5R��kW�f�i:�.`��{�a��6��8�"��z�X&�2Öe�le�.��TQ��~E
+mt����X�-n��f��m�!�z�km��'���a(_<1,L-�(���Q��!qD�����39�e�{1���^�79�V]��D�
�X��b�Ó���C��*f�;�+��l�~�:�İX���y���w׋�*Z"Ih+0&�ܣ���?����^��R��},��:�K�zz��
+
��fX��z
�%Z
��M�]Z��,%��|/�^��/N�+�d�Vu��1�׽��9��o0쬍4���b��U�r��p��;EcvU!���z������l�� ���X�3%O瘤m��RD��Io����W�
Iĕ��?� .��� L��
�i﨏\��|
�G�/|>g>5
3�3��Gq��0obR�Ϻ�[�H�^s�}6��޷�
��.[�| :��2����Q�j�^����ty�S���s�
~��p��e�k���������v�d"���uW��
�
"�e*�p��E=�s���
�
�JN�˝�0:�X���r'��P��Q�WPFH��Kc�h�=��V$�'�^����ߥ"=��t~4��V�,��8*�^s��_PAW�$�c���n_5hqݺ1�w;p�3
h���4���{�+����MJ*�r�YkZW)��g&��qY;*��|7�}�
���k���GP9,�엌��:ۆu���-=�uQ��ā����h���0_)z�{�N�5E��d��d�!
Ե̿}a�������(�!��O*��s���Y+j
�|�@�$g��$����G�$����ǐ��x��=��&��r,Y0^��r1؀~�ݦ7�N=���G�swP��#E����g|*�%�����>�ԭ��d~��Ǹ7F�}�-{)4x��9�ו�z\k�7i��F6w��@!�yT�KC49�U���,?�>0�s�9�0���I�Q�`�3��/������mh�`j
+�l�
�
+8��׮�j�W�Wn��o���Ӎ�:4��u���d.+�7n����b����>����{4N
*#�=��P��� �5E
��9�
_{]Jěܾ735�y�K4y�ٷR�fa
�6��e18�q�L������m��ZT�k�\�H�H����BCI�0�5k
J���=���I{
o�‡��ԩ��m��*��dݽ��8����b�,��NR`1(ME�t?�eB�D�܈[ծ��+���_�
Nc�s��FP���b#�)0��-L|�ù�B�:�AǪ4�-��:kH]�I��v`7���qtFrK	��t#�kc3&�,��Y�Z�:=�[�6��!���s�*I�������HCL�
W~r$Vz�*��l��.De�wy˦��b皎G��ȶﺞ�]]��.�
+�)FH��\@�?�fn�NK�ٱ��ۚ������O��޿^�,���(M�$55<�
)�����|����¶&�EI΍���F
�kQ>{>�^'�
W���x����t<��
[8�q�϶@Ƹ3��8��f��p2S�&O�����(��~�;
��9���{
�X_���~\o1����E���Af[���}�*��gF���r�����������4���N�iZ�u��$��H6��1�
��>���4�.�O�|�n�����������b��6�A
s��e�{�� K4,�|Zy�m�
����j??�i5ƪ�F�����G�Ƚ6K�h�
B���`2���~,/�Tw��"�1MJ����؍P���/�^��AVE._�Zc:�i"�
�Y�oG��kri֨�3y!gKE},�1a/����]��T
��'r
Z��{��X9Of��܍��������Q"KU^ z���Gs�
�F��:�屗�OH�on��D�6Ax���uɄCKa�$�A��66w�(��I�OV��q7Ji�󟈩�)��-wgI�o����G|��|K�܄߅U��Tܑ�+���+�� ?>�	J�[��I�J�I�
�1�_�m3�|8;'n�vΰ���Z�6�`�eP�'�Ȓ
���δO6[:?[�L-���0�瘫Y�����.�X���ŭ������;
��E�CI�I’V����� _,; 2���w�����iʼ��
dS
�����%�LA�ĝ��$��G�e���4�H*��
��{9��Z�ZYu-0"�"Q�6&L>����jk
^מN��4l����Y�H��%��`
z-���;}����]�#
���
���
�e�6q��n��w4�]iT+��H������oNLK���� +�]�+A��듛,��t��X���Y��9ONҶȻ��,����
�Ϧ����B!�cܣ��m�v���Ǧv��-xWJ:���L��_���M"ĸ�02%��p!#��m��I뾙�$�ͨ�N�rh�;|U\
!��GI��CV�"�I�@��ھ'��x�H$��ѺQ�Q⶙a�6�s2_�߾a
����96	d�
+f�Vuh�
��
�P�l���dľb�D�ĝ��������ú�� v�S�:q���5oi�V�g�ː������Z��9�/�-�r��.�-Gsgl�H�4<*��ݙ�JI|(��SFyM�@L��]�H�9'E��N�P�Ļ��&�fӢ:!=�Z��Y�B]RO���L�ȳEU�7B��׷4<EF`踧2�K���]i֑G+�ay�{(�@.�������o��������#9���L\o�L?����1L=�)қz%���z�l�5�o/ FeO��*�{`�w���vFsP/w
���|��ێ*i�2$�DT�M�գ�����|�~�
6�*�۲�P�+�W��A*��p _�!Ô�O���k��
+��l��pN�
J&
���7�|҄�U�Q&5�W[	d|Υ��
+:-dG
�[utΙ�|���|��ƿ��D�+�z)wo<���[�n�uu�ظ�}�/����Q��%N×�N�֭��|
_�X�N�^�W�K_�OL(|�n7��^(�Ifs�B)��~��#� a;�s[�c��'��ʌL.y�z�ʪ
+��~���3��)��F��Iy,��&��"ȷ�g'X
Ej���L���&�Y�=Oq)=abTE�SŒ�bQ7h�ƭ�
�+�W�� ��;/D����4�!:ڥ�_8����q1T�t�
��1������q|�}�m��RO��
�G>��{P$�� 60F���![�~�x�g�+���[L[�
)�U�5J���hoV�\y�z&���R�ͤG�
WzpsN"=�w�ɹ��"���_��Ӂ>�^�
hD��^���汑�t�,j�\�߇�g��V��a���t���:����(�e2�6��g� ��"�8#��{P�I�&I4V�-T�Я:C�|<E�Wna��})������ݤ�
ç
+q�;�Y�6W�[m at ifi80z���K|

M�^�h��
���~�{?k�ؖ뗝̯y(�מr�O�J���u�	��l�wN-n.jzY��[���6�8���=��@�l���LRD'9���yO�
�mg��;������*Dv�C�Y/�k*i�c�	]Q�h�Iߵ�Y���ͺ�F���7+�Gʦ������$���.$xK��{f5)T�5�Kx��ŝ^�.��\)��/Ŷ�(y
������ߒ�
z�ڒȦ
�������F��y�W}c8� A �0+��Y}�@���-.�k�$�U�9�
��*��"�� 
,��jq˚��J~��*{���d��Znj�sv�����:_
�A�u��0�
tK�`�E~4^�Ɖ�G�<���Dj©P&T|z�� �-VW

��ۉls��ᢤC(��k��b�w��4߁�W��y>�@M��r}��w��P�zRqϕ?�B����M�ʻ����8�
l�M�=��o:�u;��rD7����l�j��b�d�iQ�$	��츌4k���\ޗ��i{i��3߳�%?�
+$��
"�"
�X$�<9�6���g_�oA}�Y��������nj�Pk3kVh��#�=��d���j�H�	�R�'�#�D��v�J��XJ��̀L���Q���TH@�eҁ��
����a[j����W~�ӝ��i��j
�d�H�@!��
َ���xV�ycr�f�
����eG�iGLR\�)��/E�өP
�������Ps�'/�y�u��k;��k�(^���S>�6�<1�;�g0������SA����B�R]�!T�>��J
Ir�*)&��D�&ы[��^��
](�O���"7�G�ŀ��I��u��1
�TS{Wѕ#�ܟ�NM��$E�Dԣ�E݉'�u8:�W�!VKf8�@�6z��)��z=gUHQ��M��Yח��-�h^뀤�N�7�Ah*
܅9�:�n��d�,��$������̦�z*���U�Y��d��Be���=���EI'w+�t\��e���
�r
��1��k5�H/�������ˆޠ�$;�6�h��[�B���&��@#��
��Ͼ�a&�N-��b���9&�v-6MD��!s*$R���R��k���YEmd��	q�
%˯�/oN=�^�pd���y������Kv�y[����/�Q3�]v�n�C�Y�8�%LLߖ͉�7�����#<����Yqy�Z���K�����Z�c�W�lx
�:Ł���ѵIrq��+
�G
1
f�
�֮����:f��
�zz�Z�����c���
O�WET�j!� �w
�����I��}�
+�=~�9L*!=��˗K܊������I���]��9v÷9:*Ă��7��m�2	��
�QF��0��w�K��<&�c�p(̻�pw-�f=}������?*��1���x'd7̈}��&�0c+�4+�I�k~�3L"Sm�Ξ�9mu����
Ze��I3Z�Z4}��!�l�7Ef����M��Q�؁ɡ�
+�#�v�e��_A�4C��@uw/��(e�j�m�i��4�m
::땠��:�]���W�/���!D\����m�+*
O�Ѧ��Ǡ��m��LS��K!@¯�Lf|g�>��ns�
�5"3�W�l�{���'+u���fH_�
�
+�������
���b�)��S�):��搷Q%�\s�s;�I�7w�A��
-�	"ą
-l3:�D�]-p��Qj͓�G�h�����;n�~�qoSZ�$&%����?�rKq�[G5D���9�C at Pmi^2n�2�[�g�/,�h�k�����j"�P#)��3��fV}�f�~,�!��+�g��CzKS�g�
j�S���2b�Вl���O	��O(
I����*GCi*W��S��F?�.~ͬ�y�Y
�*`qK+���°��}e��{����'��>弦nH�����p
=�y}E���a�	���l*u��P�.]|���<�H�T��1u'.�
��"��3s�M��Q����2�n��b�~V��KN+OnF�3��1گ���&�%�(��Z�_��麍G�-�Q�� O8���,���"̭���B|z
�
��l�ۋ�|Yx��d���/{��o�
������8�B�}��
��g�\����j��a��j
Lu$w�0\�ᝋ�io�h� �[���|]��'˘��������J	K��Y<������`�be%�	�U�FbZ�.�?�{��a
a�����\�
+O�^��w=Z]s��fq�V
p��Z}�tܳf�ʟ�l
!u�D�:w��ݨw}����wZ)Vg��3ն�V7e�:���R����X�uTS����,�U;�7�Y5�Cc4�Q��/=��rZ�Fu�q5o���OX�SӜ6
��5W
+��+ľx�)'q/~)�
����9�$ڌ&0�� M1-��ml�y��iS��/�� o�
+endstream
+endobj
+3454 0 obj <<
+/Type /FontDescriptor
+/FontName /XCKPWW+CMR10
+/Flags 4
+/FontBBox [-40 -250 1009 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 69
+/XHeight 431
+/CharSet (/a/equal/h/l/r/s/two/v/zero)
+/FontFile 3453 0 R
+>> endobj
+3455 0 obj <<
+/Length1 1454
+/Length2 6611
+/Length3 0
+/Length 7588      
+/Filter /FlateDecode
+>>
+stream
+xڍwT��?���4*�n�����0�
ƀэt����4R"�"!
R���4
+J�N������s������Ͻ���3ce{�
TG	
e �zF  PT!��0��\�h�9̠H.�vU$�����(��
���K�K� �  P�/GR������p�1�*��	stBan���� ���%���]�H
�QNPW̍�
��AQ>�J�-�B��	y{{
�]=HG
~�7
�0�z@�^P{�/� }�+�70Ab�����1��
FB�

�{`<��P$ s7�X[ r���p��Á�gk ‚���3�W"�w0A����>0�#���4tQh? 
���v�@`��^`�
���p0 at C� ����	sCyz�\~!���du��*��
+Gy��O
��B0]��=Vg8������w����M�s��j���Q��s�� �@ PRJ u@�'�_�M|ܠ��¿Ԙ���n 
h ���!�� {A(�'4��?
������0
+`u����ɎQC
��1�G�� + �x� ���'
��p��Wd��������&�' ����Ң I�!��Y�����Z0��ڀ�dԆ;  �@���/^r���u���}��P �?���!�/��3����8�+��B���G���巕������]a.>�1,�Da6B��
���C�Xb=�=������(0f3��.7�CC�
`(���k��.08� ���� �����av
�yJ<0��m�bV��W��!�_;'". #�`b��1�8�O���P�o^��&�� p@ ��SZ
+ d�K�[�U����� !��g�DaI���ߢ��
E"~+�U#�����oa �%�~$�P4B<7��Ȇ?j�8�S��-�6"?ɱf��#�7�|�yFF��S������>�baU��X�#��v[���T×����F�k/�g�h{GK����%�#`�����o�ۆ��
G����A1Չw�&��]��P���z���E�@�i�uH��"��)zV��������L�*�f���G
�/Z�g�"�p:���Dģ������.��qN?�͌{t3~�J��C�S���?��	�lr���� �~{��1*��@/�K�
�ܮ��ZΒB �w�po��M��΃���H6�=�,cY����G�`{y}�iD`K]�L�
%�I'�&�r(��d�NQ�ɘ��V��pty��J�Qݭ��8��;W���+N�>��RX�
��V�4w�:7`���c��5�M~������4r���Hj�箔�j6����@����֟���|4s�u�.�r"����
���|}[ [...]
3ep�wժ���>o��ޒ}��z�?{a�Ud����sݙ⨹)�M �é:`�7�n���s��&v���B���&Ѭ��G�E���Iƾ��x�ҁ1�#�v@��<;Y�J)n


�j5c���HG8�a�e�㱬��J�YT���gIZ��`ɇ��붖r�T�y���/���o5UfA	�

+���
+B�ӣ�	
qY�
/�
�v��שN;"C�N+�I5��!+ 1���q�63%=6�t��v�
+~�e�4�<��rh��"�1�Z�S�d�WY���
5<̖|�*ڮ�v2Y��{W�
���Ք���
�)IQH)_@���^!��Z'�chL!��z�E�J+���h�
���?��,�1�wF]v����j/Cq-���O����\Nm>��
��BF��k� 0JMv�AGྎ����ŌҜ�
õ��9
��yI�DM�������y���I�(��R#y�q%I6Y��
o$~������
l-�)��4��ȃ
��Ek�6(�.�(3�a|�"��WO�e� �����}�2�F����Y��T>��-*��W�����MC����ؚ~p�g��>/to|ϠVh�-��\ VHvl �>��BP�1*�f^���:
�Q"�yժ��0�&����bhݔX4g����ǬZ��k��7�-*�V�[��N���
�
�ޥֵ��	����
��˻�G_�[͒9&�'j�
4�[��ŽU�ߝH$H�
+������v����t
G|
���I����
���I�{�
&���[R�b����s&��p���x/s�w��eK��� w{��i5΃o�7��T ��y�ܺ��N����=���
*�8����\J��\�����>�3za�L�jr����[�wj�^�X�C�hf:b���G%�
�
y�pA=?8�kՒ�����Y=XN�����6x�c����J�����8b���v����T_k�k�@�S����m���+���f��>�;U�"�

����xb�t��ڂ���{�����E�vض���@������1�³�]��
+7���@yg�4u]L�Y�VC�f
�
�x�9|��dt�D$�KK�CI�I��usY�ݴ*��:����v\>�����K�����ؤjg�w�>/}���"ک��,.

��˫j��2Z�����[�(
J�*
�/G�	?��hJʘ/����(�C�W�,
����:�������Ovv6'�_
Hᤛc<ų��WBo]�s&�+W��qՋ�?��_:;��Q@����˔o���h8��h@�A�� )�zѩ��0��ĹmU���3
���X�
����!�t�cBܯ9�6�
�JU�_�^��㤉O���9�?��. Ħ
��ٙ�ե�Z��C��G�0�qw�_�)
��O���;�IWΆP�Ob�ޛ{/�7��_'����|$�"�"R�4�͗��⌽��]��f�)}Dtk�D�K�R��:���
�E^y�dR@�I��O��s*�;j�_!8���EY
���<�]��R��,
#u�d��6z;T��@�b�������Äl*�
#4L�R��%��imi;G���ii�i�W™rF���\�j�\(OK��Se�^�Q�����ͧjv��5�A��"�k����z˚
���ϯ��#����T/v���B�
��"4��𶨾W�~�r+�4~��k����8���+!��h\[~*�~�+͖y֚i�<���J�q�-�+���wp���e�o�[���a����_�B<G^#�nigژi?[���6��c�N�!X�"
*� "Hq�p�%5������G�>FccC _U�4��u��g
+�#�~.U���>�m{
H)�n���� [
�zq]d�#&�3��۴�q�q��� F����aV��ыƽ��o{�:���.���w�4��՚��z�U��{��C�a�6et��^ًJ���JMgh��9^���29�<�����+עʕ�
(+R
EVM^S
<�{����Ύ���
Z�p
m�n��44��0Ba7�B�;�d�V���w�&±��

+�vh7�y���@`����}k���6?�����UR���d��[
2�3��^��.�n�E�r਌��Ž���>ƁC�*O�TE0��.�Z���ͭ["wy|�L�X/��5I��؈8�œ���ܪq������#�۽�em���k�I�����ڙ-{
��o��P����y\�o��-
�`��]�x�4_�F4�����B�U-��€[���x6he`
7z!N�2.���N�ޔ�ȑ��'�'����u�v��`cn"���~	!���m

߭��Ìޥ*�0�n7���[��3��j6�rLto��,,�����[x��,�C�ʿDtf�)�|�k��N
+Q���^3A�G�mF`1��r���C�7�^�DA�֜��s��6R��LtM�M���d��h���?1U�
w!��v��~�
�Ei��8Ϫ��x�8>�>�B#�o�w�R���ɰō'S�{f)�N�Ө��R]�}@�b1�{���6�KܝD+��E?�7�<��&J܎�����jA����x-|2ہk��j ���dŀ�tg���s��ǡ#>�w�X{7�X��?�;�4i�
5�V��
�bE�9����8�V�.3�w�9Q�2
+�������ÿ.I�LH��z��%����1��653�
{�0<je��~���Wh��lY�d�Mr	o��{�OޱsՖT+19in�=X�fm~wd�%(fs�l�}=����,�i�W
+�?���}�_ Mk��ep��&Nf�	��ޫ��1	\��ʣl8,,�=��*z��
xi�!؉gW 5/ܣ�,��w԰C���V�F�do~����e37��ko8���A!u�����\�i>�(T�����U�a�	ϲv�t�w��M�U�zq��f�
����
+J�Ѩݳɰ��u��~49VդP|Cx�HK(O�8�JSK6y����tĐXR��
+�$	m-�:��4���Yx����
k��!�'����Y�N��Y�Ւ�g!���Wzi!��7ðF�[܎>�.Ʊ��[��:�I,_�0F�Ƶ �^��Ś;
+�&ٕ��<g��%�v4*������z���J��L^�Td�|�Smc�j�e���)-����$��G<
��>R�W�
�'�}#�T
$mN�sDc��E��!#%�2L��~�W���U��>Y�ǫ��K��c
+���l}�gu��	&��XxO���N�����%٤8�w��O
}B�g=�O��NS'�[�4��M��>
��
�"�Y���g�Uol��r�I6p����OYŗf
<F�}Y~h�S�|�sLa$�NB3�e1���5��ďVڂ�Y�R��?��>鏐J�J6�U6||߫{|��`Rߥؤ�K�m�h|���ؐ����b���Gl����Ѥ��Ax6Q��@��HZ�u�o����5
Q�=����Z�����o�͸SJ�'=��dW��m	@&S����'�2i�߼`70�+�Z�
Ώ�;�s|(12$�٫�.�
���WL��|j��lx1]����X'��Mc�L�MX/st��NX�:>#6xQia��Vt���5�M����섷�x��*e
�^�
���3��
�
�>�S\��8��+�W�?o���&�����)��x�|��(ҀC
+�Y֔�|o���>����~�5��g�܅���ɚ�!_
0�>��J���	V�I[�}��
��F��u/�I��<�~�xq�#���H^lNԞF|%dž��ý�]�I�Mt���܋��9�Mdr���R��
��n��痌*���:�q�Q�
ϊ�x�
i+�N����:���۶�5Of�CpN�g/���j��Q��
+�NP��������ko��.�(��6IeVӪ�<��&�3��m-R$" !2�`�g,t�u�*DM��4�Ȫkb�����a�-==� �
ɮ��cv|*-��w���B����c��n�]wO��{ɷ�|��eV�����y(aAf�ۺ~����\�"��C�A҄��AƇ*�,�ʄ7$��m�9
� k&��r�
+�+���D��
�?
+�#�ҟRJ/�|���,��ӂ����l��bsq�y�����ڄd�I�^�&��{��l�vAo�-ã�x%h��,�/���	ci>�^����<ڬD�,�=SB�N_Hu
#R�
�}����(�L��>$#�c>�f�c���,�v��s��6z*׽q�cs�4�xZe���?��OT�!8�*`9Q����F��
i��>A[L-$۝\��1�4@���P� �kNH���������8w@����8ICY�z��u�.��sO6ȃ�if���������������6��ܢmWkv��0�������Ў燏�Z
K;-��e�#�a�).q1����5����]��_rg��ddy��lĘ��%�<ѐ
�9�zp����#]2����BO�|�'��r�KGU�Dí:��R��
��O�L@���Ća�4��i>
ܥ�4�]�
+��s-?^�"er"
+7
�\|ȿy�5��`2�|�J��9��g�
� �=>���GT~���D��� �D�>�J��Lp��[�Q�nr��ㆈwH�e�|U�^�$��y�3{^���׼���cé 6s
NjƊ�l獛��b�džHK����l����[��O��k����8�����9G��/vt��աG
�s�k���^���:�BnV@�R]��o��/����${\�t(�?�c�v
�P�c��u�J^�e�u_����-9j
��i�~��00��Y
~&o���Q�l��\N}�s^h%�d�
m���7�a
�W�z5�I؜Ws�Eb�k�dS�4=��T�e�ޝp�1Ӊ���3�F:��cᗯ_/��]mJ�o�r�?��1_�wՋ�D����2�Œ-��SF���Q2V[�<<��[�3�d�GHU��(�N�#V�����SE�3��)���۳5�E�*q���",�
��<�O�t� �TR�
|���w���)���]Ry4f�
�<U
�.V8�\��Df��
���pZk�Ͳ�����_"�`��W�q��
�f�I�ʷ����B
�k����U�O�
"
+�ý݉�P$Un���̛���*q_LM���S1)�q�� �_YU#�/@�Tb��%8���*��֡�
��$��p��.�R������
��Il0�Bg[�'�S�au�
l�
��
'cc��N�tGZ���9�����c����pX�*�����i{-A�}C�(�,B�xa�T���<������[ ��^�(�|���T�t
�O��9��*����2�P�bv+ҷ�TΎ�y�F�`
�5ɷ��0�h��"�J��z�ݯ�>Q~�v3jo����#�����
��h_d��5���vJQ�����5)3�
�l�9=ذ`;��N9�}��c	I�׍�^���Td67��������ҝi��T؛ R�.]n�n��7ۻ~�:�Ө�l��;�I�l�vi�
�Y���7�)^�
��nQҿt
z�0YZp��
����8<�M ���n�el4bn;�:y�
��������P��C
�_�0��J��M��S��kk�
+��H�����Fn��7��SX{�팠[
�����B@�
��k�����3�(F
��F!Kw,;<��#'�q��7̂����p��~X�!y
�{�G�p���L�X��3�J�����j��n�%�2�E�O]%{
�9����=�^M �=5x�P���D���.�����D�x=N�"�
+��~�)i݈Oi�J��Kz^!�JG�y���� �ق
λ��/��])	�F��ƂJ}�%�~�}�h��X<�L�M/i3$��(Ew�gT�8	8l P�<��b��IWX�5���{�����{u��e�x·d�s�˵yY�]Bt+o�넩g����s>�N��~��bd'}�����
��m�ը�uɘ
��,y�h]���Ӥ�m�I1��Z�Y at i׭�\��N�_�E'/i+�ϛ�R�]F�ud/&c�؄@[�[
+��M�
�
;A�c�
M�[>����#2kJ����ݳb��,͊�z*
L�4�����7�� �q[e�l��衒&��s�;���!]<!���;����,z�IeU�!�E@8h�(:�&� �x�se�#���r��
+��Y������>.�� k��o
+endstream
+endobj
+3456 0 obj <<
+/Type /FontDescriptor
+/FontName /OPBINH+CMR6
+/Flags 4
+/FontBBox [-20 -250 1193 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 83
+/XHeight 431
+/CharSet (/b/d/e/l/u/zero)
+/FontFile 3455 0 R
+>> endobj
+3457 0 obj <<
+/Length1 1437
+/Length2 6463
+/Length3 0
+/Length 7424      
+/Filter /FlateDecode
+>>
+stream
+xڍ�Xj7NI�.i��4�HA����c��m05JPJ8����"��4H����)�������������]���}���w?��n���8���h��(D
,T30���b`�8���
��	�S
��� �(����a�P�+�:���� ��b=�	 DZ"#��`ٿ
�9�:��
4�Qp ��+�pu���( BdeeD~�U�p
E
��np�UE�h��!ཱྀ�J! ����%����A�>bh�������4���1~pg�/�@C(���h���Sm�v���b��+�'G�\`Q�p
�6�LGh�G������B� �I�W�D��`(
�FzAQ��+��	i���� �(�_�PO�U<���:]9�n

+�T1B������Ax���� <!�Jsu�(g54	G�� ~�����aW�
�=V�����@9�����Y��X���_
W*�?:W�/P
+
�Ȃ�po < ����<�
������?���\A�� \�W? ����`�!��6�[@ @g��wE� �d�R�]���&�A ��}�s���3������,����T���IU
 ĉ�� Eť�@D\
(su�w�����o�1�Wo�2�\�@�?!\���0����_�"�wC���@�ho
�î� ����
����_Y�/���~4��������+��
��~�b���F��������?�� ��"�ת�
��
���.ᣉ�;#|an��\��D���hįg(
+���v�k0�����jR�M�U�wI

��k�ĥ��P
���$�A���
��@�
+�{��tAc ��){
r���-�� ��_"���x�����������b0Wk��2W��-�~�� 8
0=��ݾ������J6��!�1�U�
AQ�4�	{JE�*�*+b
s����N�iYC�Py���U��$�!٤�,��!�tt�05r����-��.2vQs��
��;�<��[t�r��������;����f�&WM�^I둟�}}do{�x�/���37��(��~ ����]��%�n�0 d��D!�fA���D����>�,�,6�
��t�7q�i�Lq%�s�آX�O�xvZ��Kd2򁈤[��zo��.��n!��G�h�T̤=_�)��"�Z[?�����&9��j�p��?�Q;~��qI:6\�����!
+�>����
��KZō(%�	�&����.��M(�P ����-�.E�H�UpN�,�k_^����Hd�.�>�����A���[�p��[�����F�'�m�}��"�kJ�O~���8��QJGEC�1ɂ��i��[Y�8��
yt��ť:�<�yY��:H0��$OTJ�&�����Zv����v�.&X�*�8�!n��}��+M���{$5�N�������S��]-�>����H�stߛ�_qlͬn�(�D��~���'wW5ty�6�Zi�k
?E�P�����I����5%�؄�(]����%+I��]оP԰8?jx"�3'
2��a)�j�#U�iL'�^���|#d,
0�?�j��R�4��W�o��{�c
�*Q���;
CT�]��s��g��m�u����^.�(���T�
�Ѵ�$��&����f�
��
���.pr�ƵC��+� \k�
���q�3$��g������Ve�!��@+Ls�z��Mb�F��p�'��d>��&����:&��f�g_>tu���� �X\XH�ѱ�>3;��֚�#@�G+&����c��
қ2�@��,|]��>E&l�Y7�R�������U�Ǿ�cU��B����m�s���	ŀ����-�Q�Ȕ���yc���'
S��S~)���"������
H�@�����J�ի���mi��
���V��喐h��y?e<���/$�~�X�a=.
�	��^T�w)���+�ޫ���=c� ��
D�q�x�"*s�# d8�S����-��q�>q ޫC�P!�{
J?��?���I{�E$[�z� �H��S�@*r���O��H,��n�T��i\^ʋʀP�t;��
{=OB���;	�?*�skޢ֢9�[�Z��lV�qo�Z�a��hkO�z��L��.��e�o��2�E��Z�8���|
I�أ����Ů����场CX��6p���j�@�]���O�'!#�<�x��w��>��HɾyZ��*�
���
�r�� g蝻�h
�G᩸|�T��Y�!vV����"雭V��{����C�NJ+��\�7I���0���ҙ%TOz����E�I�:2T�1㪉����\�m~���o_ȁqX} gG��
+'ɬ{�[��^����g�
zf�B�
7xҲ�t#�lQ	Kw�7�IqA��n��UY���HB�]��S�n������J�U��R�@�F܋Hm��z�k��pM+�m-��'�P5�J3&O��&r:5���O'􅴆����KzUieu
բ�[��ʮ|�%�����8���4
@J�4x̯	0���g�{J�
Nh�[rf�m5��X�0��
���O�.v}w?��Σw�O ���P��W�fG�me���O���v}Guh3�5ƚv���c��=r�:]��b"�|�]�������[dz3�ôV�&z�p$���d�>{�� ���w$�*V3[�)���?,\s�=�����Y:�T��&���_�5кQM���S�^kV��C��E����ʼ<��� 6J[��U�.�3��J/gu��[�#� ;$A��κ7f�8��%���=)l���]9.a-�p��7��܆4��1ְ�h�
$K�����p���prVX���N'�6�e��Ȃķ�3�\/�0wca����z��f���w���RŊ|�^i�5�`&j�Cs
�2��T7�L�1�D
q
>�2X0	
Wxlܿ�>쉷r�Ok��m��Kw���%�6g�Lnw
�=ys�d^n�8T��K��o+%'ke1
+t�#0͜w��#���ڳ�+IZn
�֏�U#|��ȝ
K��ƝG�{�����$.y0%,0u�,�n���踈u�_��靳�g��W��:v6�/ֳ�����5�;����{9����Ʌ���6g��_�����ˡ
��-�
+\��%qL��G�.�Y��a����r�P�R5О�&$�Rq|L<�(�{���8̻2� ��;��'F�7��o������a�5p��r�ICO��i�M-N����"�@���7�����#�T�ZUO�v
޵q���V�\
zEBk�~x�iQ��ts��%�8����!�?�٭?	�	�g.k��!�[7���mCģ,�gҊmI?��m��*
ᨺޯ>
�g�T�s_��cK�>�K
+!Juy�eH���I�y�n3�qj�g�/(r|ePg�Q2v���
A�
~׋KMԏ㇕�
�r�
Α}b���}�df0#Vdh}?����v���]S��L��T�@��2�fu�ƾ�Nl����gM�~	��9�+��V�<
uE'���>A�_�b���8-Q���axQ��/���I�3���č'������}4�A���G���9tq��3�'���x�y���o	e��[�I�p���nJ��N��1��m�g��;2���Q�i�����Mu������'�yV_
ζ�5�
��c`�RT��C
�{��g�S
2i}�&?H�"M;c)���h�?��ssQ���N�w:2�-���L���O����ʈ�D�l���aX�5Ӹ�(UY�j�=5�g�'��~�MQEciK�����*W�w
A��<^���!��ru{�ࢩ��+���Nx]k
6R

+���
�'�$O��&��
x���LU���;�#I�&�<�����GտEEb=	%
B�f��yJ)�
+

[bN���$4�j�/�U��]�� �ShӍ�������/?�ȊEw��BH�I��z����~8���
_/�`~9:X�m��}��>�
���ѳ��ѿ����⡽q
�ƴ����M�@��|st�=E��(�k��#�����k5�4����;�h�z�r
ި�(�(�����=�/T
4C	�̂�<؟��
$B��4H�6�Kΐ؇�a6ok!T/�S�djҗQ.R�Z�h�c��`��<�/���u:
+h�ű��t
��
��⿥�P+-�n*
+�X둰��0<�+K�a��0�c.`��RۈI���}�3����Yڥ�R%��ȗ#���ħ�
��K|T�Ֆ
�������i12��A)��(K��X'�%�����u%�GY��5���wM-}�
cΔ��(�D��,�n�jʤ"߰Uk}
�/?�"�'/�n)�S+��o�^"�J�:�?]j��k��Mgj���� Gw5pl����=B=%��5��*��錘J�l?��i����Ҷgs��,.�/0��k����IvR�S	o
J�?
��=���4&�~Ɯd4dm��f������r�c��.�6!���q"�p�ķ���ґ�w,�޹
P��T����#V�Z{�&%Q�wKw��p<9ݨZQO�
%����w1r>�O;��-g��f6�,m�Q�ba�&4�g����͟C���?+�a6"�2�v��ok�pjM�h�{�UZ�̸}�*z����n�� ���
!�>o�A�:y��𪕷p:��&�jkn�T�w·fJx�3"RܟW�y�/�ݼ��Vc�W�s?�Oj1�l����,�8����
�D��g,�&�GW9�~�g��zr�b��'�C
t��N+׈[3~��`����3#���
k3k�L���!�'�<
+=r]�Rw�2m��F��m��Hl$ާ��tQ4�#&�:R9��E�_Pүع�+q��M�8~:}{���~��4`Ab¯�8�v$.m��9���b��4lnk�Y��u1���Q�����c/���d�
+��m����=^&�M7�{$�I�jxުhI�*�puu��.��7n��:�n�SM�4�i�횇Q�tjV9~�hH���x�Sq>������f�I��H�x�?��
8��=�
�Z#�]�G�l{��c-J`�
q
���~U)rv	����Z���q6���,QR*�x�	A�•‹P
F��dH��ў��ʾS5#Y�?> �T>&k���w�j����.�$$�q��G��	��"��FS�o�
+	�s7޽Y�͗�"|�y��
$�S�(��ƨ��|\'؎��g
��
�ޔ�i��;�*��
��^b�{s��2h���,HS29qc7J�^��u�
�o'�'�*8\�
�����Vڥ|����ڄ��;�������!'���;g�ACU
.�`I(�p	.�i�{*���i4*A�
��^�l{���Э��bԝ�P���4!EG?�d��Q���F���P����2=Erp�o��2���Q1���;�X����!I�ǫ6���?
o���4��D�V�����]C�� g�-��A�Q���Y
1;��I��Ɖ�Nט�@.��Qbfp�ҹ��W	�V��t��P�+��
�u-��
���\�*��|�d�#�%�c����;)���e��F
-\+xq�f�Hx)[;wG�<��B>�L69�ݥ�)�A��<�jj
��ÄX�5��.��-���[!��V���W�ٖdk@�9�i����(��y�:�{m��B
�
�� �¯	۾�g�1W�w�
�j�n�k�c���7�V�HO����-�'�\\�R�j4����K�����5B�{�<!�
�e^����%g^���^:p<|m�S
+�t^C)���/c����*{Y��%3L2�q���NZp�_�r�8�E0�<��A�s�4���f���h2�+圹�
���x
{��
Q�V�a�6�:�m�=��l��G��$
+�氭�A�kux
�����GQ���1�|cc�
CfZ���)
+1mJ�̑�Q�m>arɊ��t�}]�z�T����}mx�����G�b�#�x|�e��	�d���i�!�gK�C�
ս^����K��}=�&�ќw���}
��ɚ�e
+��T��
셲�
w3��KtL�`��ӓe;Ixzs����%���TY�y�
�k�yo	l�$?4Y_�ˉ�����MK4�I2�0�7Pr�گ���v
q=�0�E
C.��P^*ݻ���ۿY[Q�LiDK�r��g%�N[[X�/��&����
R�.	BCr�c��dG�Irw�)��1���~���O	}.V��u׬g�U��L�
M�n��=�ߝI
w�
���W\�b�{@9�
 �o��x�d[=���e7D2p��/
M�Z����wO��Gb\
�Ky�:���*oչ�Q��N-��d�S5���v�5�p��n�`��
ҫY�E"�����4߇�sN;Q�����~�����mK"U�NW�5��~3{(m�����	 "�@�e@�_.��N13�%��n�{;��e�٬���?"/��D#r
)R�����a��� W#<F��0w��*O��љ��:�����|i�v��� )�o&�a��K���`��q@��j~�%7�� o1WbQ��A����-�p�
?}]�
%��;^�w]��=NY
�����,Wb��?
i���b�����q1����:bfOl��������*֕�
�ofMsS�NK����Z��q�VY
��MN�K�~����m��JØ[
|D3F����r&a������Up�h���(��..A�
�2
'��x�(	�*@Q'�e�#��1pn���0�*x;��%w�nL°�em��^�"��\����]�S�����7w��D���䶵8�[���	9ʺ�'�~B� ���)GKkJl��Rè�ٹ����T�}? �\�=~t�>�����T���N�e)�1{ӷ�d�γ^��et
@�X1`�;�[I�Y`uA��8�Tpi���&
���I�p����;jJ�D~(L1�#O|�]��y��N꩜��
�������m��p�q���V��&:w2��mɅA��x)����Ѩ�0�dƔ-����.��x�ؒ��v;��y�*Xva1ecqϩ�:�_
���r���X��k&��F�I�X��*m���^�l=��p*<^�� �]�N7-���3�tͧ�+$5y�e���cg5�t���ئ
�B

+N
�^��a1a���۵� �o�$j//���G�f�X־K�S8.M
r�tz�ޓd>z�[�U���L�t
���%�'<{��!ͯ.�=��N5��=6��
��hy�ُ#zSs�Fu�un�{:
+&̣�3�xƋ/���=gDP�Z�C�Zh��X��ܟf�zs�jO�#��˺�D���E�����7��
�+��ýW>�Q6�p(H2 �G��h�j�qe����k
zk�&V�1��j�1���
?Z�e�-6����G9WX8�6��3SG�@v��`��FX���H�`��ɝ&9����٬�Q"o�’�sz8d��ymU�K�r&q
�����=C�
+endstream
+endobj
+3458 0 obj <<
+/Type /FontDescriptor
+/FontName /UYHLKA+CMR7
+/Flags 4
+/FontBBox [-27 -250 1122 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 79
+/XHeight 431
+/CharSet (/b/d/e/l/u)
+/FontFile 3457 0 R
+>> endobj
+3459 0 obj <<
+/Length1 1647
+/Length2 9476
+/Length3 0
+/Length 10553     
+/Filter /FlateDecode
+>>
+stream
+xڍ�T�k6,��%C����%�
0��0tI7HK�� 
�ҍ�4���J#��9�=�����}k�z��{_;�{�}�0�p���� �07��O
���/�������fa1�"� j�Y� p7(�E�_v8�x�)�0-�
@��	  ���A"�|| ~>>�� apq�"�j����\ n�,
+0Wo8��
��?G К
 ���
 �
�C��. -0�
�����0�YC!��
+��G \�yy===y��n<0��4;����C� p�
�7]�6��1
l��=��O���	�C 
+'�5�������<��it\!.�5�p�� ��w�������
���9��]��.v [����Ƀ�Bp�.6��`'7؃?�
u[= �(

P��������uE��A�~3��
�ᒕ\l`�������p��í{���VG����g[����o
+6O\�/�!j�!
T���� ���? � ���
�����[�P���+�`�@���<�a���=  �
���o�K� �j� XA�.��DPCl��:�z��=

�������a�l`.N����h.������*���6��ü ��b n~!> �O@ �p���(���?��`�_���Q�����������_3�k]���A�0� ��'�g���?�.�3�;��e���
ew'�?�������
u����0��Ђ=���B�!.������V5�a3�\���D��2�
b�
EX��9@���Cx'�
D���� �A||�c{�5kLJ���S� ���)�\�a6�w�_H �������� ���崁x�1� ^
���@�`
�c���[���Z��֎������we�6��0�
��V�
���B�����K��
��y^��-
+>���Ԯ���U$�K��t��!1�_����_�0�����<�	� �@�V�_�l�Ȅ�c	
:���W�Xc/|�YK�:ԅ�]���xro�KM�l�f��]������He��^��˥u.o(�d�o}�[0">$�^��X$�On�b�"�(ڗ��â�6����}�g�҂ԩΒ��]_�
ɥg��W}_��h��-��ja
���)�'�σJgX
+�rf)��t�
�?�f�Χ��&���9����}�~᏿��Y�0�w�b�zJI�rF<:��+�-M�b��m�r��W�d1}

W�27!�7��j�~�KSO���Bh3?�F�O��\[�Djg�!�n��!A�
+8B�u�ʯ��}�uH�]���̊0$���Fy����w�
+��{~+:L|��A�~mKe|Cq�F}���02jl�"TWj�d��,��\�&`ٌA��k�g`>j�~�>S
+�<�(���C�"�4J�Oy��I[|6I��D���$Z�Jt�
Ti�ǵmp�ס�JF���AI˔�/�ψ��ҟ�n'nYX�`
�|C"�k�q�@z�0�r���h��=`y�7RT
B�����ً��������z9ܑ=��F�������TtJ�vZtEϑ��ɼ�zR'��*
+EP�S
��O=ZWƃp"���#6��[�
Os&�dx��
��:7���u�V=��Qz�,�rp]��ީ7���$��
�JY-����_=�&����P0\��/���B`E�Erf*^��.�]����:�Z��2ϳFЁ4��Q�_��31}X�Pg�5��o�-{�M�6n~ӛO)��KC(����-b�ڶ��>��]hpd"{�����R[����eL��i�F�$���G�Y�� ���]�
+�9���-�l��$c믭+�70�/&��
i� G(���` ;r�(���[��BCWH+�:C��偓j����Dy�c���Q���}���
17;�_�G�
��L��8�?߻�� ��v�I��[�Ac�Zn\�Mq��Dˍ$���?��ب�6�:�ލ�.�f�npN[��ӴX�$m
�����x�������֔�^�J��LMy\���W��D��{񺄰��6�+IGC��8��u3�때�%首Ս���q��C�BS
+��
��iA��)j�b�,���<) "30���A����:���Hnk�d�x~nv�m�
���:/�$	U�+�:*�B��.�Y��yL/L��C�j�L̪�Q�T�Y��q���{�7� g�M�>���CE����8�t�����ͳ���[jG�	�is��L������q[��eUͰ��־����8F�U�u�Lh�Bn��T
-׺]0�`]tq�3��v��E�-���H�y]�=���\Z��뵌�����C_(�{�{`M軞����8��D�=!س4��}_
[O*H�r����yH�GT�$gmcr���.K���B�T�����m�:�S\��Q�7�sU��b���ԅ����;}o���}q+��zY�i�ܰ�/T_۷
k�E���/��0ץ��?��Fq)I�����̅�ZT�'޳+P�f�;Eu�5K}*�}{[�XQ�{���D)?l?����4
z��n(J�������+<Ϩƨ�.��	w��%��{�n�ׁ���=�9�=�oh�޹� [...]
YqmL.���o|�������0
+�+tj��Z�hASy��0ᥠlX�[h����aMO6����M1.-}�a��&f�igw�~����6���A�L������l��穂݊\��R��ʩ����cEऍ�����Ƥৗ2�&sҙ��ǽJ߻��Rޣ;C��)G�s5��fg=�9Ď:y���EI��B��D�F
��-�@;���-��Wi"�cc8I'�}�����8g�t�m�	'J�XZ�Y�����s
�}������| r�W/��[�?#��~�����ی����/Wc ����֝|���E��ΞPzΙ�O�JN���&.�n�ꐔRӁm)E�KM
+w�h깖���ֳ�j�yq��!C@���#V`7�(Д����i��_L
���d��`9�����k�-�_j��ZH���X��7��u��f�
9���=��o����d#)f>�e�Hv��
+c�bUt��h�
��EQ���fw�輩�8����϶Xn���J�����g5�F�}�]��#�w��_��%Uٟ����J}��0��;�}�'q:�Ω�5X���Y.�z�/?*�υb��&�.(��j��G+�e�#Q�
3��3�`�Ĩ�����,y���V���(���zNc�+r��Zɉ��:��{�+b]��A�m.�G|gyu�l�S+]*�]�؏�)o�b�*L�a��3�'u��|f��>-�
m�� ����ю�y'��<2c�Q����K{�?
�G�

�VW���c8�:�.%�m?=N�Ls܁�fCG�����(�$P�-X*��Am�
��u�c�����aJM	�����D���e��C�>�e�cX
���XȽu
+?����7����L�mx��G��3�]Ȟtz5�ٔpq���K��
r���:�Z����7�I�i9V��+���u�����%OA�}N�c�5�go
g>�x*6��'�P�k�Wi�`m�V���[ɖ�
+H<%o�<�ܫh�

+<xo�p�RR��9U��G�Q�\�4wW�U�.*���h�xȸ:�GM�?=��~���&�;�����t�
��j��C�u+�C)t�٬���Z���ۢS�J#�o!K��k��C��uR�maWg��O�	uD�U)��˒����;�E�
0��x
��l
���N+�>۾*��R��K�&Q���b�7Q at F��}��5���	,��ly�g �9���^��}k�9�h�c%�����_�QIjp
T*�
S����o�ei����#�&�
�I�h�.
&�^�G�/BƐd�7S2~�f	Õ����*���Q�s�'��U]�WzÀz�*��|s5f�L{�\:�%�~�G���'�Zfzt�`v��V�o_��SZ��uCpXaNm�|I�l]xM,��ҿƍZ�aA�1��N�+���R^�c�z+O������TNu���fTa@̳a~�ev(
'ʛf�m�7h
+���|r5�2j�����t��
Ŝ[ˑ3z|��F�k��R��~g��а
3A�3{ѻ����

�6lbX�u"�`��"�LR�JQ�E#*k�^�����U��	Ht
�JL����F ]^Ic0���cS���$�K��yY
}W�;�����ǯ4��!�0TRC���V�Г}$����f�@��v�}�����DƖ�Ig�����Қ�+��L���)ec��c���q�e^Ho�0
l�d�)�O�։��>~<��ժ�7�
���V�R-B(
.�#f;�CO��ܬ<Z�4��=m����GR��_�v�+;�U���}}�4��۽���f7���
+UƠ�B�J��P飋�t�������'�{�
+o�ڔ�	>y�V:��t�/�Xd���*��i�.�\�>�s�J]"#��XK]�M:���d�G7��؎�l[3�Kpw����h�MN���j$�"��q�	9���s1��O�d7��O�	�4{�׳���!֍�;��L���R�W(7��B���!��_>�*c�����/q���0U
IU%!�r�������JaD����w
�r�A�!�n��÷fbag��j�ҩ�1�<f�����i:����X6a�b}�2F
�����d���y�ɠ�S����-��N��{��:Q�����)1�KJ�A�>�M/qx}/��fu�"k���
O��>K;M��˴��e�JX
��U9���W�
��kl
+^(�ڭ�S}ߍ��VS��?��[a��)�<����<O�+�A8��y7��}��(�
�X�	6���Ȉ�,��I���J�\Dp|}=�~���L�FҸ
��j�.t�q��E���[1Z�
>�q*�_
�')_|K�:��'�'����噚?�ը�9�!!��Dn�n����Om�;�8�)�F��ͫ{9��L>f�{�xE3�r|�):�3�O���[L�֨�����������V������Qx�K̰Q�2T6]
���΅C��a��:A���$�2�|���*5U�5
������MUj���� �T������
�����J�e�T'w��Y�'n��&tk�y�타8��^溲�gs�g�LV�
8hUM�.��!��eD��'�O-t�n�1��K�VP�!	���0	ҳ-
ź�"|+Y����.�n�ͧ^�mB�p��� t��B}pQ��N�@����7i۳"�=�ne�8٥�d�Vo��aE�R��Y�F8���K�G�~QX [...]
b
+o>��
u��Z�ٚ��������Thh����
�����?cA)Y
�
?�a����6:���zy"v~�?���C�����]"m_�iq&Ip��z�R
��b�ʄ���h��B�W���e�T��T��0��">�lIN��L39

ˡ�V��`��Ǡ�N\JA�g��]�##z+�i�
�u4���'��E������V?�g�SEO)P]L����P�4�g�
��Y�0�ݴ�
��ϩ�PL���)M�*eHp
��r�:O>%���U�T�@z{�ͬnW���E�m�W��鰙Uj�흩�"|?>�0���A9r"T�j���B}]�
q�`11/�5������B-J�o��y�9�2Yިs4s��ҁ�͉〸��T����&Vm���t�9%t�	���즏��`�{
�Ǐ�k[�&M��]�FF�t���m�k��ŵJ���q���&_Ȇr(&�2}mA8-�H�JZ�'��Q|��R3�`����4L"1�93{��
�;$f;��eIo�҆�׭|������%��Mc��s�[If󊰒׵���(6���f �)��r��QgH�听��5�C
�F���7�{��/��K��S;�f���#ea,���g�y
+Ƨ�jk+��mt���S������ؑ���j��"�����l���}K����I~��)}s[�V
��
QljTJ�ϱD��Rn��3}#-�0�
3�C��;�*uއʸC 
�%��1
�+ے��``d��Ж=���gr	����%�˕�&�N
��B8�g���;���%��#/�蜌{�™�b��/Dk���&�~�?>�
��:}�d���9H!�J�
���wҬ+��x����j����/�6��)aťu[I1���\�g�	
��́
!�T���o�_Gs�iP�E}':+<�o�h�C��l�<��~�VNL���g��'H?�� I�21D������&��X�m�
�B�u�������b4�'D�"{`�$\/�:
+!��IҬ�N���~*��7���B�A��5u6+��ڡ�S;��KǨ�帡~?���*f��.�'�;�ԋp2Qa&I�n���(�������4d��2�T���+�I9-��/Î��֢�/Ǘ!��
[2�������IO��̉D���7�[U��\1�&�T�GM��qF8�Q4���Kؕ�,��I� #��eH���`ւ�|ot1��Zcx���T�T��<��ʛc�����S;�k�s��/W��b/V�|�p

v��6A�x��٢�Z���ҙ��y#�Y(�#�
%wX�b����G�^�4�M
+�LJt�n�8��u���=�
��mǛ��yy��R�֭�.֍��.�'F>��j]qu�%T��ԣWV������抝e�~�T�L���_΅.�:�f�5�l�4�.��M��~�3�a�=��P��`HŶV��(�d�W���������s��&
+u��4��=�|��1A�s^px��7=�"�����$Vl��,����|#
+
�vdh�g��+b7al19��s��|�"�	�X#��8
�BQw�V��r�i:eF%#!�vxX�ܧ�gGu���l�'[32M4�a�����ٕ��h��
�y�ͽ��y��[K����Y\����$ ��ï�����b�.�5z�5�O�/��nm�U
�'X#!	�i5
(e�X�V�R�II��� 
�s�V{7*�ZL
����#�<D#ŖV��>��v
?�|s��Б�4�p�M?���{7�<���"�Zj�|�t�Vq(��n�tP8���霎�+�4J4#
���Hp쨘�3\������t�fH�mJ��l�ɑ��%��ϔ�
+{� a
&�+��]�|!�}��0��е����m���<�,+;!�������������gٹ�NF��~ 2-�!n�����Tm����7Fb��Ў�'lz�]h�v�lᴏ5��T���f�9�]��n���卵z������˻���3a�l�&Ѓ��l�P")�h51�Y�����SwǠvJU$T�
쿾 �w
+/
	�
+ߧ
�����k_T��
+P�[����E�JyQ� eW!�����?����P��+
��koe�s[j��R�׭���������u��
	/{R�b�f���_�7��C�8o&�_��c�ˁG
���t�)#g�$�*�i��9�0�
*���i@ ��屣����n��v��.i:T��i�e����z_y.J~ʥ��<��},"sO �ʐ�۲) "i"�ޫg�T�!��T? ǵ�h�H��1,��ާ�Iᝓ�y�8��P/4�>�<�����D7{��\&��|Q�h�ו���}x
�["'���?+2 w��U�}�� �,��A�|:c�ap�t�EF�!ڜ�g��*����l�&y�@��C���t���i�_2���g���a��
k�xD'��X��(��x���~H1%�|����#����M1oz���™%�D I=�_t���,xr�'{=��a��z<���6�h���m��ȕaB5(ȩ�f�K��
�0hB�����������=�R��n�	
���JI_�զ���e�o�~Y�0��
+�'EP��&h��V]��O�f�H�wX]ѹ
�r2�iL�2�6��
{�K�t]	��R�,�8����>!O�3���"�N�7�9�r1+�D#G۬u���nǹ�;流����gbT+������b#�5��b��oZ�4l�@�CV(:�}NFz�*g���*�2�	
W�N22��Ԧ'�|@�]~��{��P���1u�x]ќJ21]�9C�i ���u'1���O�1ڤ���q0&��l���)���k]n��_�̫��x��&n��>�)ٴ�e�|~ 
+�t-�H`~��v�d�
�kv
�{Բ`��K����������5�$��\9���<-o�7���V���Ϩ^��Q���t��7���V�zM/�7?�;�R1+�%��8����
���]�
��I����G�+�������ײ[	�N2a'�6�Z��䍸�m�
�J7�N��gD=/opĺ�1=�����8���W�?��I��9�
ta+R�9Bd#� ���&Tx;���v+�.��Q5Ws�r��G!&%��4����	p�$�9~I~
(��u��"�Tv#9c�X/),-��q^NAC>�!HW���8�\�N��2�"���ͬ�Z�:�*[�"�	�u��b2��j��P�f�f��2 YJ�O:��eLU�
+��X�q�L�YC~��j��@��vG<�}�XՒ
lD��yV�0� b�~r���h�%c�.�� i)��H�O��U�s{V�v���J�~\�����?�t6�~Ť�I�N61X�[�ݜ���
9�Y–e�:։����K
2ұǫ�����9�)�T}���b�ڢlE
x�r�6�+9��O�5m^-�k����U�/E� �Umm���`��&:s���C~�5+�ܼ8HE���
У�,��%�<rj�eL���K+V��`���%r(���t�T����N�+�C*��,�Iܦ��������s]j
+��A�e?**aU�I�X�=�կ����{$�S��=N��L8�� "Q��.��
,�dF���	���m2�ñfT�[�5�>�α��+zkΚ�o��y���ōl�d�:
+r*���հ�D��D�����=>[L�^u�x[nw�uM�]��P�R����G
+���ע�H�~�
+O���@�a?nI3J��
�B6%�����_�N���tX�0X���0�

Y���!�v(���c�XDˊ���B~ߐ[ J&�i�
�L�\W�Hu'�����aH<�>2�Im�!�����N����!̃ [�������0Y�n��;�6��	���X����h_F�ǭ���3((���N�M��uF�~I�:z�P-��C�1Q�h���d���L�D#xp8����K�WdyA�T#�t�j
�Җк�d�(~�
����P.d}U�4��\����1H��
+h�0�
Z~s�M��q
c��T��\��}�n�ܯԨ���hr�:N���NU�vP�M�}����`Α�V���J�%�
?n�g��r\��ي��r�߲�^��cn�+
��q���i����Kѱ����7a�G?K�uۣ)*���!�ʂ�X�+��`�F�&�q-8�ݤXi���A�7 ���C��ɬ�S){�u�8��
�� �
 ��k�y5�w��z{�0F��X]u�M�ތy�Zh3	&>�q�G��źx����
[�,E%
���o?.�^}��?;V����1мh<x�ݬ�U�P�L�F�ӝN�'�
g*f��s�,g��*̠�U�ĘWN�
�mpK��n���6�
�I*�V
+i���da��%�?͌�=z��ڋ⿥����rlإh0���R�xq�B�JR@ ����DE��gkZV��]�M���C�iI��Im��
}�o�k3d3
��@?BBq��m)ٝ��`A�q
+B��
�t�U4��g���{�
+��׶�,&F�'y��z����*�
�r��F̂���;�\�/]f��7K�[k$ԑ�񅞖{����
J��
bZP qQ�c�n�Qn��ia�6�5�мdٮTB=b5^�P�
e�ݽ��sǮ2��9�2��-+��g�hڭv�~���ݛ�!��7N̔8})�m��$(��4_g�E]�`�g�`����F:Т�x���D��}�;��:��ka��V*��"�B/�sOj�əa �
�H
�	H������
)�k�ak��@�Q�0��h�Z8�R��Q/9_@�;^��C::`X�k��ٛ�<�~��|Hq��f�q at n�0�kVoGH��
�R,�{��M 
��L��0y�r"�t���1M$�iΕ���>�~D�6��`�}�	XWl-5�Ul��N�VU~��W�/3�yӬ����GjU����$kV�
+endstream
+endobj
+3460 0 obj <<
+/Type /FontDescriptor
+/FontName /HRPHYH+CMR9
+/Flags 4
+/FontBBox [-39 -250 1036 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 74
+/XHeight 431
+/CharSet (/a/bracketleft/d/equal/fi/h/l/m/o/one/parenleft/parenright/r/s/t/v/zero)
+/FontFile 3459 0 R
+>> endobj
+3461 0 obj <<
+/Length1 1481
+/Length2 6528
+/Length3 0
+/Length 7532      
+/Filter /FlateDecode
+>>
+stream
+xڍxT���6"]�H5 ���{�
C  �7�E�ޛ�t�"
�Jo��#��|������k}��Zɻg���Ϟgv��¨oģ F�ATp� /�$@I��B���/���/H��b
E� �	XL!�H(.�%w��)Qh���� ��b��� A~~���wI�2�
+��4p��E	���upD����`q $$ĸ�\ �P��
!.�  
`� A!(��`�vD�\%�����x�.H^���,7�
�rB�wO�2@��C���`�E��0Bأ��� � �� p$:�����F� =W�/��_ n����
+�+ݟ�_�����@��
+��@� {(
�S��Ey��@8�C"��@O �C~o
PU0  �
��C�ܡ�($/
+�ő�W�1���J
�$��?e�;�>w�?�u�#��~��p��/`W>8������6��� AD�%DEE 7 ��������+���!���
+�GӀ@�!�?$�@�{@�������  
� v(�����f��_kt�ݡ� +~�� ��^�z�F+
���|�
��b>K
]#3S�?���TTDx�x% <�� Q��� �y�u��m�B���?2j�� ��H�O�o"����gl8 ����@�`������o��!�
�����,����{G�
0�o?�_���t��|� �z�@�gC���C� 
�
�p�o�
+���Z�<¼��١HU�7�E�
�����@׀A�}���AG����=z g�݂D��
����U���_#(("
+ ��}�
+@�D ~�YC�K
��
G��! 4� �=�Wc� |@$�3���/�o�� ����Eq��y���/?����?�h�+:	��%~��{��S���;��[Rh��
�7D07� I�9�k��Q���Y�YZ�N��A�~|�稍��6��\u(]�,bbƟ���r��ѻ���4�|�J��O����w0��aL,=z��0р���[���U�X��櫍��
�MK�]�
����1���ױ��Ԃ�y5h���]w�
c
��ķ�g�m���|V��e~��>��7]�P��Z�*�����&c�PR?5Eb��$��ȹRYju�K����b�?�
+�Z��<
t����7z�!Dfd�O�lײ����oJ�v�IgVd�c�f
V
��( 8u

7:S���

m���X��P!��������Se`��_^(���\���毤S�4,���u��=�
r�~}�
�0�
?�jz�6�y�`>���
N0o����I|�!r��̔SEU���i��?d�����ڡ&e)/1;�o*DR`L��X{#C�B2\��)1��A���J���2!M2��O�Ən)�œ֮�1���m�`�~�'�g���a���D�M%� m�M��R��
>�Y�W�idK^�(�>�dz��g
���
+uQ����ɠU����}��2ގ�u���nz�7|?�:"�T��g
++�U4Ƌ�(}6��j��5�w
�7�}#���^
v��j�=t�Q
�K�6.!�Z��U��0�4H���]"�xC��
��Ѿ�`
&�5OY�k���)����y7�g�Z:>�~_���U���B���뉾�Q at t�
�nZ���*��4�DY/��F4�Z�O��
i_
��
+6ߩj.C���PyOR��a�l��oE]�7�}@o���rR���
?�y��5e5�@���Q�6����+�<��⪱ �H�ҥ5��h��
/���~�e?v?Ggw�A]�L��tPedX�a]��F�Z�U�70��Q�N���?6�5$�i��2���
>����gX��
.!��c�<����W� �кj)�vjǩ�7V%-��IT���BiWՊT
����O"���{�����ϖ��$����R)9�2C�d���VK*:
1U|kL͢�0���4TJ�-��1Pv$�&������
�!iw�Kgg�TиԷ�,����"/k
��:��.�B�$0�
�
��k���i��� i�	F,��
+���<�ŏY4��eh�f�+���T�H�+����L���B�g�4ws=��I���Yݮ�r�+�L��'�G*�}d��I��K�$�#��h��:q�� ��Aqdh�
GX=Q%����$
q8~����I��/�OO��"�mȔ
?�I��ef�(���|�7���gS:�Y\���5�J�� �\
�sc
�޸�u%�'C���B~��T�	��Y��t�j��C&'���m�yF����oFg��
!ZCl>2�a�]?=�&��Ư�A6�����KXY���b4^�y$:�\�<��[�
n7b*���J���0�&P9�U�![(�/d��Ue�׎�1�O\��[����EM�
��O�q=�˂ߺ.G]�
��S_��ʉt�B0
Y��ʷ�� ��u_R���W�ί���v˲�϶䦹	1�O�P��
GR���(�.�
���:�#��m�}F�
�w	���m金�,Ӷ:��<g$�	}ȞQ6�'��J�(|\$;Q�
�K
�YW~ζ�US�cb	�|.�bܪM�*2��b�x�,y���c�����٭"0[e�z'-Os#�{A
>�^ ��ȹN���OT�.C�ՖW4=����co���@C�
c�{s��1���EZ�>��6�qd|�u���� ��I�
i-�ϾE at n�3
{��G����)�5-�Y�X��yʨt�%	X�s�99{�Ehxυ��Y���}�Y�-ŀ��m纅n�%�}���1�YR~L���=��V��Q�m��K(b��^�0��z
EUX�O.�r��烻�\�	/�zRT@�>�����ӷ���ꜞr5~�J
�1��T��{�ɤ&@X�Gt���g� P�@��66����}��t�x)F��&�eOkv�w�=�v_��[��P������~wjm�!�/ߧ��9�I�n�0��h�[
}�<$ߖ�U�]ch,��7�*�/GV�Eս_��mRXKi~׎�uԎ�_Xa{#Gu
+����9�C e����
^���.�8��J�Lq�݇!���?��+�M堝w�F��n����wɂo�|��₻L]�7җ��J�
��Og߶dݒ��n]7�RZ
��A�$�fD`� �9��%b��Ǧ5� ��M���ɽ�
+Zx�qF.��jf^vkd�
,o
_4���gm'�l���K8�=�K��|��XN�����㗈gi~�J��?o���:0�Gq�@�`La;�|����?R4R�8����2p�
��)`CN
�;�;ڵ[K�m
x����҅�

8Jd�ro����qBk��+�7P� �5׷��qq�I�">����&G^q
o��c����
�+*�c�>U����}���^�/?p�~�
,33�f�
�����y��%Ma�J���/����^��/�C��|Iru�V�(�Z���y�7
����$��m/�YM�g.��cS��-K�sdQ��
s$��["���$�E�G����1>����]�Źl�Յ�`���;gy:�@?ρ?8�S7mܖB֝���=�D��{x�m�
-��*>�DJ�~j�b<��h��?#�!�7Ӱ]�	��
7����I���,��.=�n�-d��q	ó���dNz.W�'�5��d��*EȔBIJ�N&
�U7��ґ�n���4���
s�[b0y�� ��4ԝ��O�C�f\\O4#��5�+i�7�G;
+�AB%+۝�
�g��G*�-�	N2O�� [�~^�ն$"BE�S�u¹��[k�{
+�w���^�

�<Xz�8!܀��2a�@��������3F���g�m�t��_�X%~~���
a[C�8��� �
5�|ڰ��1ހ���;�)oJ�>�u��d��jj�Cd�W��g����s����o�
�'�P��]~n�i�/��]�[�U�%=��
Ys��.���A�Q%��
Ӥ����e��g��Dli��
]"`
+�NQi{/oq�!&J���'
+&����YA�:��J�$�Ѩp��"m�@���?�Z�i�?��
+$�A�r���̀���h����	����7;s�\) �'���>l.{H�L��`	WF������klź�j�����Ę��#o�����O��e5
|������^��j������Q�Y��2͉sn=�q.��D��\b|<9�V_�"�W�Zi��~����6�b��O%�b����W�
�r&/3���#
*��י�ٙ�Zx���d�T𽚴U	�,M�d��P�y���A��d���h,��R
+>��[
��錓�:T'ılN+�%u�w�
>���h=�c�������	v9Y���
�Q���8f㤼v3b|
~�����u>�Ó+t����?k��O]^)��yȾZ��eޯ�����̀!������|f��X�U9���Pe��
+51Eg��;�k�{4_B>����@
��B�4i�;�t�,�:�t�4��EyRJ������5����U�hH;�@�HzT��Ŋң�W�*�s��9���
+9j�ٛ�g5���i!h�
#r��dm�
�PZZ��hԶD�y�{�%R"�Z�j.��r��V��<M�U�jr��Ԫ5�U�6i�#��`O=ǃ�ii���
�q%��e���I��=~��@��4���8��d������v�
+���~M^���6Y���ϙUK?��+ϝ��ȹ���L�7��_dQ�i
���S��9�;/PӚ�w�
ԭ�j���݉z��wdL�8i���/=��{|�0�[YE`F���z�3�� C|
����G�O�Vt��
��M1�� ҝ���γ �3�
��E!���qe:'��$ͨ��y>H'��6_��S|��]bN
ϫ��!%��h�2
+�{�
�r�����ګ�$�	�w��D���<q��������\
�S��hCԎ�Up�-��5^��^��ztv1�?@�
��Z���*�B�`�{��Ji9ϟN�1H���`ڮ����(5�˳}���R`�\�fh+_�*��	o
��&��'-��0~j����	���c���~�7B�z�c9�ו��gހ�yOP�CA"dG��+Ceu\�dEo*��^ы�ԙ C�^͔��l��$���*�\��;����
3�G�Dz���7t���~V+_��K�!*����\_bw�B���.���
+����ֽ֣��f���fi�\�yc_<�:�7���@�J;=�������&PE>K�V*��Q�#��\�
��,$�V�<<b��2S�A+�!��w�eW�&	�|l�qe
+`�
x��ҧ���@+�K���刜�h�S�'�=���3%��v4�� � �N.9���(V�ęy���8��
_CuSR�
�2��cd�7
+�#vTr�*�R�'&�l�ݹ���
sȼ�-��}1e	E��I�돺
�����#�i�,a�CZ��	�y*�B�KE��Hw
/
+��k}�Ҝ�I}��4���3�"0�'�S
�
������gۙ��*=��b�r��c=N�$+'UL��
�crcG{����I)���%
}��T�#T�o���fI��x�&�V�����o�
��HP�����A���;�ؙ�i��@��v�:����z�u��vGPz�r$��
�tE�U^c5�SE�Y�LO�%�N�F��6��a�'4b�M3���D����*� ���(��ƺ����}Z@� ��eO�*��⦥��<��۟��~�� a� ���bJ;�1��]�:�Y���3����,A��I�0�+�G�ϐ�H��"�<iU-�յ�Y�}ǒ;͖����1\�'
�x�,���
ռ����bP�t퓗�zn
V.�|�'�����m;
��è�(=>�d�>������J��+���A{�G�lg5�����n�j
�޷���w�J\�2���J5D��Ҵ��n�y���í�4h�����	%����&J�
/�/
���M��جD�Lak*ɲ#��R� [...]
��K���1��<�Z���X��#��{�l��
��_
+��R� ��#iE;�2#�w|��|Y��T<
p�B����#���
���
6��A
+F����qT�m/l�_������{��\�7�]�԰�������.ރ(�^�3/E��ĕ�k��ּl���l��s_���

��G*��
�D���:���Ǒ�}.���
�F]l���sl��_.ν-g�/��A��I��ꙫA�X����ݫm.���e�.��5��Q��n�S�9 ���ד�t��J 
/���#�{1a�W��*;�ܫS�I2
*9�=�`MP�闗��4&s�M�Q�'3�t��<ջ�:�(̩�����t�J��`�Z�4;;F
��#�+v7��~f�����
n��ƒjL*_���pL�2�5�[���Si��E��Z=\M��; Bo'��nD��-�o;�ݽ�K�f	���D��3LݪG�r6�l9[ve�c޲IjM>�r����3~Z��!<WϠ���i��
�x���/��r>�z��%
+��%aqGl��c)1� ��Mǜ
T�S������a1����t'D��T�q���ܑA��O���Q��{,â]k����59pB
�^sw�D��=(��h��s�/��j�%�e��MH�oP��Twg.���\�k�������v�&ĝ��na���Y�7%�nlU�A�tA$���.����?�:ZO����v���5y�=<����^�������#�G.5k?Z��H���Kvw/վ��O���'�)�c%%_�������-4D
S�؂�Y^<�e��N҂�7‰XG��֖�+o�E��(���*:�˛�d�t_�O7�
��gm��2W�4N\��8���
��;m��������n�I��t9*�6JM�
+|���c#P:5�ը�a��h���񥄏�z9J)ʺ򛿃���=ɵD���i�zKY���F�Ҵ\���>�޼�#i���|�d�D�`�&� v_��K��G\y�{^�1$d�~��6KY����O�v�����VRN�M������H�s�5��4��*��Or�M,&kZ�����}	���ѭ��^T����1i=���c	~(N{j��Ю���ӷ�$j(-J]�k�WC:5]ː�M��6ϧ�j���BA7�+9�\z| � �*G*�3?��0��.�AK�G�`8��XtH_uƍ��[yn��ÑWy�շ6��)�LP��8�J�ľo)��W!���
؏��1�>ߺ�X���FK1*����Z��!�B�������Z���x����cs*:�,G�.2���:�'16��cB(rԸO��3G���
+6�ܒ�P�L���p�oN��=��=PyL_`�7G��4�˞"�`d��� ~)�G
+endstream
+endobj
+3462 0 obj <<
+/Type /FontDescriptor
+/FontName /ZMNSWV+CMSY10
+/Flags 4
+/FontBBox [-29 -960 1116 775]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 40
+/XHeight 431
+/CharSet (/asteriskmath/greaterequal/lessequal/periodcentered)
+/FontFile 3461 0 R
+>> endobj
+3463 0 obj <<
+/Length1 1504
+/Length2 7108
+/Length3 0
+/Length 8129      
+/Filter /FlateDecode
+>>
+stream
+xڍvP�k�-ґ&z	:(ҥw�����PB�Uz�"*U��D:
+R�. 
D������w���L�>k�g��;��62W��
�hN

) ��Mo� @ ) $I��o������)�-�,�R�_j8G�ԡ8��>��� K�2
+`Y 	����( ԡ�@��F����jh<��#��� �$
 ��ˊ��"��Ї�\�HBE'�;�턀���J!���y(HH��� �H,�qQ� p� 8��� �
�H�f at J~��+�7E;�|�8� �#��(,!�
�c �� S
=��
��Y�� �@����+�;��Fz at Qx��p�
5��8_� ���r��cфx�7�u$8��9��j
��E�Ax�@,��E�_i]�@���H$
��R���:w"�
/�g�n(�����3s�E��!a�Bxz�u��r!@��`.p
 ������=p_'W�_���
��F�/�� ���p&��"��J,��a�������%
�!�p G�
E�Ov
w�s&
��؀�@�>�y�#�
�F���q�=_	���jf���v�&��/.
���#�UR
 +'�w������o����n�ꠜ� �?�����_��kc���`�&H�G�� ȉ���������e�)��/������,�����H�;�/���p���Gv�߮��?���!���m��A	ۡ�r!(\
,
I��XM�/
f��9����ߣ �pG��Fh,��
�����tNn��
+�0��&8a��]W儆�Z>I�
 ��@� ��$!�?���0��oy$�(4� p
8�1���*��b	�X7�\�`I0@uq!��L�o
����`B(ꂁz��� C	
���
A 	,a}������CX�߂#��������('��N��V?l<�Re�_
 ��o�L���	|��w�#���� +�җf��Y��x ���Ѡ�m[���T�<
�F�כ[�=?v�\��`�.�e�"�2|d�I�`Cj#�d9~*�.�\�����l-�
�<9��Ne�Ū�6#����7��mKwc��e�c���8wx�1����M\F��tw���4��BݎJ��0F6&�[ܹ}�]l̏�o��	܄
�=KI�a+F�	̐ �G�

|qo�@H@	��>UDąD�v����ʍJ����O��RVW�r�g�";&3B��N�}��
m��,j��m(҇Yo#X4+y���ʃ<�S���;�Ͽ��A�
$�&NPX��{�}�d~^���md�t��]��,���'=ɜ�|����^���V�_�z���1�
�=��F���%��|r+� �O���>��v�D�Ҫxz�x�bɮz̠���Y�,y�uk��[]�t���'X���+V
+tCMO!��:�J7_58�	�h���ԧ77�p5J��+R�\����௕ld�p~!��Ŗ��u�f��E�zQ�?%�/��K��A>��-w#>�$��O�Q��W����v3��y��rʺ�~7�6
�w��j��7�-��>o�:�t%�*�3��Q�uCx_Nl�_�b��`����b����ȸ���!��R\5n�be�-K���k;d�����R���t���G&�y}�$�Js��~A�U"����iq��h�8dσ��y>x�'{ܣ�/x��Ruαݵ��q!#\����)a2AWcV�
���<ZMF[�J�$}�m�aV�Z������L~�o���d\L�Q<u
,���8�o�
+
=�{Qn�q!
+�ޝ�rb2/�
�JҦ_`� �f~#"��hc��(t�����$�ß�{������m���!!mL;{���@&�U�B�;ѻM\R2��.2�m+w�
?l�d�z�!mE��}�s�
�����{�©�yW�&�#�ɏ��$R%�`�+�J1)=��ͤ��Këj�zN�Ca^�KUYQ�Me�!Ukaܐ�Dۛ�"�a��i�c��v~j����.������(�:O�[d5ls����
d.�~ϧ��գ�t����Y
�榪��ݼ\�����.��>��R�/�VeAs֑�É
{
w�;��!�C��㥶ho{��j$v~I��l~��1����R���b,�0��Hj�k5[��
c��pǫ
<���^'������A����%�N�#���",g�6I�Ͳ�
�F\�O�e#����w0`l��	

_�
����|�򑜣��
�{SQ2���l��X`,�p�3#�	�x��4���
Nʦ�TvЉ���c�9~x�
z=�;�{��yM�Ɖ����P6E�G������`ַ��S5��R2�������ǜ�P�A� d[E*A}!
�=�ZLSz��2�k�'n��
U���-�	'�~�4M&���q�g��$�M��
:��6Jɢ�+��yB����<�����
+�����р�Iz>>�G�	��R]��!0�
E
+�o
_)��R��g��7��S���
T�أl��ޟ3�]��/oJN:�
+������J+����@���" 8zTW

z��6�s!�
G��t�\�*8Ye�9.XZ�M�*��I�e�8>ٟ�����%3�9�|<VH�Nsx�^r���c����\{ϩ�(�3⃺�ٗ&l٣Whk8�����@��f�ʎ�
+}4��.<A/u���I"�ba?\�a���-�Ҏ����g�A4���(�w��T�y���I'C��#�����}K �K
��w�Ʌ����em�Q��7�]�*�����`R[i9���^{=@f��F����:֍
_�5i��A�^quߝ��֌1�"�v�������
^��T�(	��c�O4K�p�*{
�x����Z��6$�%
+�-3j�^��\�k1Dt�b?\���y`�6���#A�}���Ǯ���-����d�u���ȊWϹ��Yy�E�7��t���
n�TT�Hb�x�:�e�޻�Y�!��8Բ6�3 at w�����&E�)��Y��b� o`�y� �N�u�c�
��X�<���+a��N���5�Jw;)8��I�g�z�_�2��
+�
�P������
w�~�Zsb5Ur5;b�6�r[#/�NZMI;M;���P	8���5���bgn�\�]�<&g����/��(q�����f��Z#i+s��D��(�W�ȕi'\�h)���BC"l��={�=�5Ý���k�'ys��i�/��{���*�3khԖ��̻�kE�fwy�
�j�
�Kb=��)b���������u
~�O{h�^���X%�]
�� �XV{�]�[bH�i�O/�ē�;�*�}�놏܏�]ޅԲiM~������w��9�՝��9
+����`������Ԑ��5�Qσɔ�)�^DD�,?��d���T��x[��R��4�k�C�zh���y^K��, Y�gi �P�6�MN�]��
+�B f��R�U"�I�w$ַ� �N)[�^��=x%��ڙ���(�]u

s��pޠ�s`J1��+,��ُ�F�Uz�B�^���*�
=� �>7n}�4���l=�Ѡy7\�5�n�1nu��+����W���z�u��*u���ēF�<

,+�C��"̄�=�W��/�j��l?�M��8`�o+�
�"{�W�R]Ͳ,��"�Z�����-���`�G��^w���m�O%Q�+��oD��t�J*����'	�/�1���M�|�a��
���!�^&�􈳸k��P��N���UBK��yi2�����B�:
�>�k�Ir�J�O�S6_�{�W]}�D��=���xU�,�����f�
tF��u��3[}n�1�ܥX��z�k2m�P
9�ڝ��p���4R �����"��ޣ�qS�2�
+�����U��a��Pu �Sb�Ƃ��"Ӫ����9���3 Q��d�a
��C�9q��g���N���[B������pXpV?���l]W��mϓ�@��7�=��'
��C\ǹi���ڸY�;�Z���U�=9��.j
rf ݰ���GXc]��(��֐��
iJ����'��[�n	VԚ�J>��!9v���e
�Z�j_J+��
Sm����DQ
�������ę6�E(�O�����E�-��Km�e�I��Dc���ɉ���3�l��[�/εt
+��t�)
+��P]N�>���[��1{�+.䔏
�?�ou�U��Vv��Y��>�>#cd
+y%���hҬ�9j<��y����C�|�R>5��tS8���@F������&�뤻v���]ON4#S�߭Ͻp{G��v�	T�S����`��j|��`
����y�ɍQ&�d��2T�Q�ⵥ'�{�e�w�Nl ��_��m�Ku���Ƭ0D�>-;*p���t�q����e�ݭ1���^�܀�q
#�
���rK���!�o���x
+�e����N���+���F�r��[W��Jz����5󍤞��O���ʀ��=i���(�6�au��R�����&ކ�\GF��h-yٷ��l(����~�;R�
�-�Vg���Py��H
�Z��j�G)�S�(vtF�\�i
���|q﷧�<�Z��j���ޞR��4k�l�o'%�̡��
��Z�٨]޷�C�ᙰ���"��e%��"���۹�����p��4�s��
�9rܭ$C�|��
+1��8��I���%���|MY|s�[��EX��K�S�q�)X�.�C3w�����%ΐ" ���7|��,�����1_��	 :[�
ROh[�u�z
+ↆ�t*��4��y

��
+/�=�Jl�[I@��rz�M�9
��G;��+�}���~�t
9+��g�Šo��օ�5��ګ6
 w˨���8�ږO��'�Ѫ<ⴾ��b%��ޫ=o�2Ke��Y��1�=^dpY�!�<�?�m�>�m�]�G�vۇf탲���4�䡗��n\�?0�Zp6 m8MQ�OW�/�Թ��jd�_��Bz/�K���s�?B*���
�P��?L�E�+
+/>��ƆA�cY��hD��

+
�
+�$�uZ[�
��,lOYy��.
�
���}v_R%W���������~�ʰ����/�?]L��yu˗�X����#�<�6����<y�*{���B=N�hٶ���
���%��ahɌ�}nB9�/}��ؤ;���)p���Ͳ
�f���ZD��q�@
�x�t�1�c�1C��L� .��]��|<���
d���|Ȫ�Z�R��yj%>�AV��9�&e/����%��;�ݹ��y�4��sO��a�d��V��u2��$
����R|2
�k[T�M����I���&
+O�`��GĜ^���
�f�3�W{<)Z?G�X
�$�+m�W4F?�d�b��5-`٢�i�Y��X�h�2�1$=w�ìȵo�e�m�\_�wYyl�D��^�"M��ۖ>︕�-
���H��O���aHև4�!7dp�;�9�
+_�p#���m��O`T�q�#�[c�
�K�o�
�
m_}S�DN,�ᝎ>��~���)�v��;��$R�3��9u��*@W����k�*��YٴضT��9�.H೉~���P�1i7kf+BV��'��G��AxF�Tr.�C )XtM"q2�	��4⭁���7Ђ�$!�s5�UEf��r��Su��f{S����z@��
�b<!@��v��
+��:g�f5.!y����8�yä�q�.�9�nf� k�3��aE02;�iT`v|�-p/
x��^V�J��������$(�]%�L�����s���o��?1
��\az��>���P$
��_b�P���ܾn��?dx J6j�f�
+������C�
wW����
+9�j�
䠭�S
�=z��(Ph�)�=
�枋�ѭ�����Y��g�^��s��M���B�p�Y��nk�ǽ��7���2����Ҁ�۫[v���U/�p��Z&7�^�n�
�ݲD��o�-TS
�o�@��=$��[�	��j�R �%���U A��p�Y�}

�V�Wm̫~W�drմ���&�$�$��K�B]���l_P�o��k��鏔(bbH�S��L���v���}ae�.a#~]�%�g�d����b3��%k,)�nm�Ei�'�
P�*[0�w+��}����"�t���i�Oő��y��8n�g��R�?w�]V��bB�Y
;dž�E�O6�F�}�}�=�NJ~�
�j6��jn��J��nn�~�1����0�@�(2�W=^:�A���%�&��+K� ��J�>Ed��H����6f��S��u���tN/_
����W��92�������b���U��z�5�r��V%>��u�K�CM_��V�
�ֿ^��j}��ɥ��l}�/=�8Z4{{�3�������d�V�b�V���7�
+��m�4j�6;{w��|�S+���%�(6� ��i�M���5��͋̍��%[���e�Z���<��
�sKy&f�l���RD���$�fa�}m'9����0Xns��#>��⬞�G�zL�ͽ9�BI5���l�<'�ʅ���#�O�t�!N5�~I�<�a�	+Zq�0�vwԸ%��{��Ňs�R<�;�}�ݥ��D�[Ϭ�~��`giع��V���"<���"�����L�8p�9�-ڥ����6��v<�j
c�\�[�u�ݧ�`=�$#W����Q*n��m�kU��
؅�=|���:6ȱ���$���%��
+ʥ\g����n|�S?!v�$��5�ƻ�!�hYV0s��6I�垑!���#�Ē�*5
+
{'E�]6�D�*�4�U��U3�5/��i�3�7܆�!C`�U�E)0��g�:�wۅ2���	2�mL��ܹ ��G����J�5��3�}��Aj
{x�To.�
g
��-�d���F��#-����C������/0��%H39�OW��ukה9�^F���n��#�>o�
�/��tK�
�uo�Vm�gn2��(�q��-��j�)|���߃�p��
��on)��^f��Z�~�әk���S`�奫1���nB���ﴽ*^�
}q3>�l�0e�q
o�(S���
����y�Ѡ�
�4w��{
���Q��8K�l�
�;�
�-R
�2��T�� �j���,t�#R�5$}��Ht�/��v�$B�E�َ�}���@
hn�so�r��)j��c�="Y�h't� �v�5�3F�H"�ޠbɏc��
t���sŃ�N�~a���S ��I������d'EQ���CeI�a�r�d���-��G���>���V���Э��/�-م4�.���1/��uu�jU��w��
��-�<�
���%���o5\�YKBh��f^�*g�jB��%��@ZU�����55sj�
 �
+��|�XF��ߕ�+�����n�:���B*"���
��8������B�����c��U��&l̒�B?�^���o�¶	�N>�~p���4�$�
1����}��Σf�����4��*��&���e��z���h�!�a)��X��8��,�:�
�:o_`�n�t^��`�467T�����p4R�5�b��-:F�=������LUλ0)����
��6��
e!��5�xn��)��rA�s�<G�2D��b�cm��Y�9�r��wJ��4�OS��Ri=

��
+���j��ZH��-��³wh	�H���]T
ؘ��ƺS�VUYD+(�^��y�UWG���P��/���hԨxw�D�?Q��E�5��
+{ź3��AX���� ���=RMоI��ɪ��g�x	3�1�ѴB��}!���F� ��N�.�V�D��,@��h\F�A��vXȳ�� �Ig� ]H!έ}��B���6*�=���΃���\$��‡����#����{�{\P
��`����q�|��H���
+���k�R�I�<�`�
�c��]�E�c8�5b~PO��D��)��C邎/���%ė�]X{=���_������6���[S
��Qt1&��9���Ĕ<���V����܍Y��F�m�
�*+>�*�+Wꭘ����(Z7�Ԯ�c@�?r㏌�����Tg�
nt��
���r����!Ŗ�N
vH���M3jk�R�3��Y\�b/\YJg]An]��
�� ���fU
�o39�W]��'�$�Y���^ǂ��:�]�Z� 7z�f}����[#J�������oy�Qe}M����ժ�v�l�
|�y�*u8� ��Rhh0}=� �B�>
+endstream
+endobj
+3464 0 obj <<
+/Type /FontDescriptor
+/FontName /VYEUCT+CMSY6
+/Flags 4
+/FontBBox [-4 -948 1329 786]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 52
+/XHeight 431
+/CharSet (/asteriskmath/dagger/daggerdbl/paragraph/prime/section)
+/FontFile 3463 0 R
+>> endobj
+3465 0 obj <<
+/Length1 1394
+/Length2 5926
+/Length3 0
+/Length 6875      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�k�.�(���0
-�!
҂�0�30
��HH�H��Rҍ�� ��%��?�����w�Z�Y�������^vV-]^K�TG����r�F� ~~A>~~"vv=�
����]�t�!���+@	��6y0
+
���T]� A HD
$*�����w )���,�| U
�L�.�p�@¬mP�6�8!\ �Ç�~�d
�H
��Q6PtG�
�����(����A�
Ł@777>��3i-�� �C� t��P�+��
0@� �����
�gs�c�EX���H( m��A�pgt�
����tU� ��P��`�? � ����_ٿ
+�࿓���
����V0{(@SQ��z  �-���|�+f�@��9�(�
 �����9����a�� �AOYn)�pp��Q�D��'CB!�{ �l��p�{�u���-�~��tq>�Ü\�*���MD�ج�(�0�C!1 �	 u�� ���p��v�~��|�
� +4��
+��#�r�B(�
���;�}"� �0
+`�������6C�����G��&�h� ��~�y{���%n��O���5tU4�x� ��OV���	x
+�  �CTL ���2����[����.��OE���������-8��
��
4h.C��Pߔ_��~����;����_U�_���
)����vs���n���� 4�]PhY�#���w��ա�0������hy�����	��
��Üa�PK-
+b�H���
�j!�a��8�,~���U�CU��
�킢E��
+p����E `$�Aď&���0�
���%��7�@>8�N�1� �H�_kEs 舄���D�*
qA"���� t߿ϿU��C!D��ȣ`ۊ��27����Ŧ�8��pa��+/5�t�'�疥w�R���


�f��;t7m�
�KV�Aa(t.�
��~�8n��2["譇DS"���㵙n?7�1��h0�3D�Mp��Z�U����m���;k2*F&�i+ʈ�m�kdJK�4Iu�Sy:t��=�m����X6�M띝����L<z����Hi(%
��*kv_B7
u|�j�3���w��Iqw�
+
B9�
*�@��l�
t��"F�>X8fR��PU}�p� G��OO�W���zI�`,p�(����Q�ߴ�t�T�:?��:�
6bˊ��>�ӷ��)�3g�t�|KC�2ra�5-α^6��E�������Z����,4:����
�

+�;rw�
�&ҕ��1�e��/��
2p?��PX7YT7�TV?
+�ky��\��r̞7��V�B�업��g��Z��
�}E�T���?czm�9�r��@�Z-��}$� �$.ʷ�+kѤ�U�5���_��X�����!-�E�,0߭��!\iX��^�f6�d4M�[}��g����0�������<ϭ�ׄ���?4�_P�&���S�����
��f�0~���aU�'=���U�z�q#]��AA_[9?zds�	�r�A����] 8j�G��d����b�"T��
Nos)�<?u'1�J�`�=� d��+��Ūx]�*�F�Vs��)ŏ�{�%+:r�]U� U֋�->x�g�*9^�Տ�N��t0�v/-�U5]��y0_�6���~���E����
����
�P8ou��ឦ��-�lBVX���ˠ_��	��r��k
	'�X�{N�
+��63]^/`�n�	5{���{ΜPT�� ʝ��p{g,��+�{&��J���V��i�^f͙��2�
8��}�$�3"�f��}4fʻ�����!�&�f��!|Gw�.�!8��Z��{i7������l����E�1B)�
��$7}���rƤ�?����O�E
m���Yyz
IG>�e ����d
7��VE #��z�ɚ_��D�

��
����>�f%�Rɒ����� }E�#L��#	�1��OIN*\x�,Z��'��6���_z��5����
+?��
�K�K�T����x��O�8�� �|Li'���%�:�O �ei�B�9�ݛO?9���}�%J����.��N69g</U���8���0�#�͈%��Q���r[
~��������.��%�^vX��	�^^]�A�.}��
|aQ�ۥt��Wf��0i��M�����ѕ�y����4,�t�cK���?��"������q�Ԏ�[�w�1��O-(�
8R
 �A�i}�
+��H����9��e�+ҩ�y<n�9Q_�|眜z)@����1�|��z3i���
�y7��:.��f%����4A�fGs���C����I[m
\{��Md�n4B���U;�%����+q��*CBS��T�W�
�>-5n�5�P�ڨ���0:�[-E��RH�h
�c����
��S����=e����W���(_$
�f�d�O�t�
�ދd�g����n��<�(�1a��l8�+{l��k|���W
bǖ�CQ�ǕĿ/�r���®��,�{k����"�
+�����'��
��s>Fg�>���p��$Z�ot�U��e‰qꕩ��¼<

�T�ߙ��Y�0�}}c�蛷#�S70Fc��fi(K�sp
� ������~��`d�lq�I���DP��{�L�׳B��i�wK(�uՏ
+��,�N[y�'n������Gf��ߑ�����҄�H�tm�p�n���RD�?Tq�~z���l'�~)t�i�0�kq��)<D =ܴ���YR��0��v1Nq��oʒe#��D�u���>=��ϛH'��
I%
��`�Vإ�sӓ�]��\Z����=�4����'��>�_�0%�x}��6k�<�
���]`7�R
͎!��L�����}
{�H�1-%��އ���hQ��e7�A���9�����{�r
+����9���S
�R�'j疴}.��!8���/���%	t�_�
��07T��,�#h��|��H��
ȐQ<�*\bg�����
�$h%�3n�i�S]'�w��[�
8u&�}��Jn��.{�x��17+̕����J%e����L��Mv��Uőri9���m�&�4{�ŭ�2|^�ӕi��P����d�by�ȸ�����Y�
�2��ºmH���[���;>�E��T@�v�FIq�cP����'�w�d��
+
,��,�3�r����_n
�齅�W
s;�իq$��	���ذ@]��J����'f��c�V��<�\���~/�S�/X
�U�����$�V�a��e�lwk�Z�|~�~g�]�
�
���:O�W���$R���vzP�S޽����x~��︐ˉ�Z$U�-�������a�9~��@ڼ�B��Z�,�4�
�Vg����4�F`�`(w���é��"�C�қ�4�&a2\	����	�b
�9_����צAw�:w�dr�_�=#�)1�	�����r
�lP�oWG�1���_�G
�}��E���
�.�����ߠW5J���cK�������^�Q}b�c�|
u	�����~���FD�� ��"�+�
"��x�Mj���"�r$��u�$
R$��ܶ5�j��q[(
����I;LF{o��A �{:9���]�3�������Q$s�܄/;�qt�#�ر�4�?/��쌚�4Z%a��!M�
u�A3�<������;�[�J7h���
PǠ�p�Q��L�p
�q�B�肳
^!5��Bx<|*��<���*�󈰖�f��M�Iiv"��0i�ݘ\�,s��
c�&1Ɇ�5�ƀ����@eC
�5s�D�O��w!���LMOƖ*��6�]K-Qi�����DR�"}��ͩž_z����|sg�_��o�g��]
;�[����֎�k��t^F�T��TGZo�y�G;���C)QM���S
	h

�lX�I0���Q�t~�^��f>f�?y�Jⰹh�i����(eL�G����
�~�4J�;F"�&�~}�}�
և/���6m��y	% רz'^y��qޣ�ʩj���w�_q��^�_�U�
Wh:���ߐ��n�w}{��G޳-c�9�oS� �W~���q��D	�i9�[�`}�a�.����b"t�JYr�S~Yz�
��(������^{g;�^��av<ʚd��e�W�7�G���J4�
�R�J8qg�
�
��0q�5��
_F�� tF����� }���fI*�6�w��ի��b�
��a�a
.��.��V�(}��p�1��][�h%�)��;t�Cqzg
t��@8�pdShh�mo�H��^�T�fF͔��k�}|� �R [...]
+f�Q�D8�}��G&�h�y+>p�_X:Q
��lE��
��O���4` '=hi;�I���%���$����fS
����n����]~[NL�h���ܟgÎ�	5T�[7�xw���1����2Զ�ð��=$G3�ҭ��Oj�m��y�� ���)o-��)L�3�I�
99�<sB�iE�<�1l����#c:�P߇c�ƚ�#&�AoD#c��~��.d� �4���U�Mc��O�5r�T�#��⍻��i҃j��ƛ��kȫt��>k��e�'	��d���o��v�j"�6Vy#y��_���!]�/
�u�E��)�V���>��F�_��7N2�yb��	�
3��n]��A�
+�t
���!v�Qw�t~�
+7��h���{�
rߵ���9T�
5I�w)�}Iz t�	��B��'/r�cW	�$���.�6`!�-Hʗ
+O�z��/�N_�Y�s聫3	3
�PRa$�����#h��_��O�^�r��C�VnlaW���l�O�͔��Z��O�~��a��ge�jX//&�� ��L��t;��"�m�_�BZ@��=����.����]�\���Yi?�#���Q������p2�l�
�(�~��=�ƿ���,
Ucm���I�,j7��
��M%/9~Q�B�y֦��λs0�����D�l���aا��/�I�O
+?�@�Tg��xh���Dc��s�G�
�*Ee�Z��2
�2���>�i)K�����	ǟ�O�o��&5ws׻
�y�p����ST1ʵH�O}�ͦf�ܭ��d���-�����
o$
���+�(ʨ3���b�}��ִiF�4�GV��I.F��cR�#����Df�
�?�T3'׮2���F�����ǜ�g�
+�z~�%��ׇ�����"��]6/-���ɻ�N�#�,�˦��Ȼ�4����h;ƺ�r����bLEE���<N��B����s�1�IɄ��D�U(�
3ߘ�U~�
.%�jSM2�5U��T��q�ʝ�����?K8�Ҟ;�3�
�ou�/��j�j�\�b�+*5-g5&5�\%Er�=��ёf�m��W�{J��d�oX�
Y�F^�0yF6���C�#�$�u
+����=�4������Q'��\�z�Sg��+/���
� �,
m��<��l/Op�\����]��� f�v߯Au��'C{�_��
�	:�`8���d�4v�sy��^����.Y���!{STt��{��-Du
k��.s�h��M2댁���M��*�kF�
fY���և
�	4�.�a��ow�����2��+
I��
UU��aIRI�6 ��'G���m*+�lך�V��7�˝��S�О��
��@�L�w��`mv�~�>%~����q瀳�N�Q
+<f���ʼs>,���h
�'��Z�w%�Ϝ�l�f����D�����̲l�}۰ך��]��CЙ(`yЮw��<
�2�Kq�
�Q������3���^�A
7��Cr�+hFQl��"�j�]R���+�Ťh ��h�r`ps������T�OTXFb�
+��&�U��f+�H�������%��I'r�=&��Yl��
��}^啅ѣ�*����h�m�Β�*Zw��	Ξ���*Y}f_�����T,�F(
���ZbPk�W�h��'A�a�`_����?��x)Hn|TUU5���lݰ
�N.浕X��}�*��.)�n��b֡�Z�?�3
� �R��R�
xK���@0����wj^��M^2
Ę����x3ₔ����sFƜ��L�v�q�3=��̽\˱�r�3�|�x{C���A����!��f�
[,��P��H�^8��Qc$eŗ|�M�p�V�{)�����[B�w�<dqZ�m���
+���
k�^��Y�=Q�2��d
G�x��z��ƴ��n
���p{R��Q�� �a�[7�����N�^����QK�)kUi.�E����ލ��8��J��|�
��Jb&��c���-�k���<�
4Y��c�;�u@'�%Dx#�=�X�K�QG^eFG>��7R�{"���$�]OR�mN�I��u�$2g��w��El��A|�����
���3��n��ʯ��
T��O
�'���#8�^�G��.w�Ͻ7�-ɴ�k��z<��Q������{�vB/ֱ&�?�:=1_�j���](����
+\��{�ϻ݁]��j*m2�Kt1�JO�����<)�R���'O$�LR �7���y����n���J�B-F��.�,?Ta��Lz��R	�V���V;r��_S7�4�\�2��G�{�/
~�7fzHcR%S����H3����I
ev
+���a��f2�mw�f� 
+�U���e 3%�;@<B���Lcc;���4RDE��J�z]�{��hЖ^��X��lQջA�tR��J�B0o?�?;�
X�
+endstream
+endobj
+3466 0 obj <<
+/Type /FontDescriptor
+/FontName /NSJEOL+CMSY7
+/Flags 4
+/FontBBox [-15 -951 1251 782]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 49
+/XHeight 431
+/CharSet (/prime)
+/FontFile 3465 0 R
+>> endobj
+3467 0 obj <<
+/Length1 1463
+/Length2 6796
+/Length3 0
+/Length 7790      
+/Filter /FlateDecode
+>>
+stream
+xڍuX�m�>
N�	at��n�AR�6ƈ
�� �HIH�"
"%-
"��� !�H�ߌ�}��������
�v_篮���
������F!�"� 1�����
PLL$&&��@`�a` �
�A��
+�������8L�����@}ow��$P\FA\VAL
(!&&�w"
+� �� �@#P��a <(O4�ō��� ����
+�*�y��	4c]`
���;�
A����h����z*�������

+
W�"�. at 3���A�?	o�=`��� <@
�7n�r����0 pG@`H
��	�����@s=C��'
�;��w�0��� �A��j���g#�W1Ayx���$
�p���
AX?�0���L�cP�z��v�%��9��f
+�������X
�p�IQ�g�)k!�(��ܟ&
���_��ͺ!Q���?
g�����S�����i�I�A�cp(-&/##%�ya~џ�-�=a���?a
��@O�'�G�p��~ ��
�E{�3��@\
E@�@'
���;�9�^�.��ډ�'���דN^P������WTS��L�J�7����Q~�@I1����4P\\N(++
�g�
����&`ğ͉���
����wx���#
�?� �s�-N�0 ���o/&-�}���
������]�7�������������0����''eo,�F(�9���j
�me#����Q=,g5$
'qq)���o
��F���&,�巐��
+�
wf�� ~�qpUbb�ù�{�`p�+Ù�s����$�e�`4�ÉL��@q�M�0�_����(,���
tF�?�U\B
(
+��8ڸ�L�o
����$P����`O���ŀ��+r�	�co4��_2�m����W
�� �M� ���u���5j,�"�GH?�ǥ���Jcyg�����Lz�߅V^�2�}=1
�"�}<�gߙ�!S�1O�wY}G�`�d�c����c�Yq���RMoP޵#��{`=}
%�%�V�Z|юY���z K�82Y�����7	l8�?bm쩒h�v�-�,�.IGꭉL'��vIك

���z�$w

��e*�i���9�����S��0x��҇�2R8��zD�~ �v���o~��3������ݤ�A��b�>;�/
v��[0��F#޺[ I;]�����H�Y�.�4 eT�Ժ�$�lŚ�үAIFQ���~�ٯ��լM
�U�
+)Wx>P9�����}��W{@BYC�p��6�"�������-x&��]�k�0�5�[Э}���ԙV1�J�^
����n�)�?秸����9v��$"�`i$�y�}�8C��3wM�!f��Ҋδ��6�'�G�J��}\s�&5}���
m]�T����ӶA�0C�2���}+ap7���R�H��/�ݳW#��7�y����)Q4�

}x�H9r�|�j���^Bx��e(qw��K���=�_�$�6�>A]j�aq��0�Sd�n���4;�������x�p��^%�mQ�J�����t��i
�.�a�?�`���\�
�
"E������R'�;Y�O&�ڤyf罃|Z�ܵw�'��ʣ��&�&�L�M�����*����.܃�Q9=Qe��
W����g_h��.���M�M�㽔��;v�Lm
�����>��6�-Kv��p$��0�x�@,�KZq���b�K���e2;t����G�t\@i���(s����tF�Cٱh�Y�7u�6zөX���wDaJg^Y;�����h?z�ԅ������뿄)�Z���P
�d�IM
+�������%�

�N��fQ�2�y������?05	�d��C���_SL�dr�~�t��G���b�X�
I�����IӢ��Cg��'R
�?���Y	*d����x���ތ;�
I!u0�.���L%A{vL�&
{k-V:�}�4���k�|�¾#��]�B1DvJ׮_�qp�n`�
L�O��? �W at S��Gٚ��H�ri�oa<�8D7�
<�R�eX�o^�����ɠ����s��m�Zt�s(��38����;+���J��m�>r̞�'�+-k(N����nh��`2Ag
+��ĖH���m2�c�C�
4[�6
�m�n>�o���JCy
+Ҩ��
8M�(=h��#�%P�an�t8�!���4dʹ�_ɿ��1q��6�8`�\��HQj%��q���7ϳr/uM 
%�l��
=���#�!Է�Nz�5����f�4�n�����b���pL�l[o�x����#�g�����xHw\q�C��6�;�1�v쟿X�ZPW�܈u���U����pyY0��gr�g���cv3|�+��6�s?�*���Q��
WD�
M�I��J�0������3O�
8m{�C��Lo�����si��^�/�j>y6#�[����.�Y\��8��G`-1����Bm�)�=Y�����L�
�#���"#M	�	ֳ�bf�T�K���Q��DjN�e�"���^N^K������{c�m8ض<DMgo9���u�$l���Rt��a{u��K�
�人>�͘�uD��~H��Si��k2�?fR75g���J�f'jm�?���
�����dP�}gv
�j�+��\�r�	�lNA�8��̈
�K߮2x��|��9�s=
K�G���+��
n���ɮ�˫6;ľ����%]�z,���ۮpEw�G
��8A�� �
��-��o'����~�����
d�}�
+�&�-�y}�&�A�P�}��"��Ҹ��Qu
�2��%qmnZ/���J���n�
+W
+�1WX�ۥ�@Å�
:g%[���
�t"X�n4ߡ)�uWy�._��Ǐ���
z�|ӢXW����A�hؖ9�̺��_�/K}�{\��*K��������W/�9Y�Z8��MXI�|�D�u�g�_
+�w�
gɌ
�_&R�1a�p/f���d��c�apQ��7���
s�	�����O�<nw�]�g���}۟�ĉ
V�i�5������%K���+���a�
��	Fi0�E���o�J��xH��{�7B�{�����^��A��E=X+���i�j-F��"�
�?k�L;{��
���n�i���-a蒲��0���
�b*{��(Ke�'sh
|�V��:Ft�δip{�
U��5_T2	�}H�mMBn��4ܬ�#C�p_���"^y��ce at hőKfQٵ�
�e�J���,!����8�+o^L��â���2��Ӫl�N?ʿ��J�d��$�ɯ��h~�za��\^u9	�JΧ��Њrsg�:�P>��F�6�f�P������㪇��4
�����q���i��y�|����;�p'�u�A��Xc/~h
L,Hyska�TO�(,CL���16���ׄ���tk� ��C�걻?�*+�� �
gYT��2&ԛ�G荸�
+䘳�Yw�:^�
ý�5���cU���*ZOA2+�.�I
$*
Q\v|�t˝N������U�=gõ���٨���O����S|�imGwDf�
^y^bqZ��2��?��ĊJx����)��
Oo�hN9�5:�,Z�u���/qY0��~w(X���qrh�E)yFe�
<�@x�4��8]'�� [x29BP�΀�Ǘ黻�
'FY1�kMEr����̢����:.3��)����I4�D���*�C/F#u;�r���$Z�����*��a4@�٪5����Fn��o����c]�W�xx��H۹�Ų�G�X��e�'Ɖ�	%6
+3�BK���b���@�1}00+�s�n\� 7�х@x�\V��KÁd��سRq��i'u�\��.�
(��u/����B�{�`}�!�a`
5e��g���e
,bo~p|�<���EJ�}y�M��V��1bI��_ZHn-O���1VƧ|G
�i�yz<S�yw��҇
,f~Q&n�ۚ
+������F���M%S�R�
p�>�
+ֱ�ς/#_�>6��,jYl)}�9SV���G�s�WM�������(��f�����	����z�S�˪6���ό7�&M
�,�����3X�{��
+�Ca��d��4�'
��N�x����>����m�i:��_���y��
,��
�g&T������LHg5�N�5��X�����@��؍F����'�*��3�dfk+J������8}���.,�� �?�h=.[H�I�
7�4W벜O��ߧ�Ԝ����ai�n��e�
���ٕE�I�qf� �� DSDS�Y����)pk�,]��ޯ�%�I��W���_�v��RpF�[
+�*NP&��\��DG[�۝�dK�Ѳ�a�B�^�ب߸�8���k�O��B����P1��
�
+�����(�c�[FHV�"�(���c
������̈́Q`�j�Mѽ�Ϛמ�

�%��p�қ�]p'�U�%\��rs���g��H-�}i�G��GQݥ���x;�MmEȾ��7݂�������)�\�-��(:7K.�1m:}[��q*7�1�|��.�o}�_�����4kZ
d�gB�?�l
����w������Aq�Jƕ�������d����WA��{��'\D��uxGNE3��0C�B�
Z>3��}�=M-��]n��=$���ˬi�g{j

+
+s
+��\��
+P���
Sn�</HK�

������{������/J�(��;f��Cw-s���31�.�1��`�x,s�FG����ȋC{���c���̵d�l�H|twM���|5�{�Di���a���G�v��7"*��|
s��z�:�5�O��Q��`6Q�y���<�VZG��)��(�L�J��
�`b���{^�ԞV/.,Y� 4�W��_�k��_�m1GU�GK����
�g�
�&$���5
+���pZ<K�׏1bݸ��S��I{�A�F�e�&�W�@���6E~TN�g�� �
�֜��u�k—�S�^�������~��dVE��C��j���9g��kϘ�W�';NQ���V�����T�^4<��]5""�\�	������ ��c�k�#�
�2�1=l�%�� ��s8JN�j�/ņ�nH���Ӏ2'�t�
W�.�%|#�������[���#�o	�m�6���=񫆣�0��o^5]��(��O
&:�2��a��"{�Z�敏�1��'�
�����V������,E�
&�����X��/�r���p�g�Vn�z����C&H��;
���#��FR��{�=t���
�$q�Ӆ"Y�lS��F]��^w
s�G_��.�I�1�v�/
��B��x��hg����9�d����$�������f*٧��A�
e 	�Up|����dpebh+�n�OR�^@pR51͛��GV#���kx'����� !��<����@J�B.4k#���L%�����݇�rn%i�_
�=���
~=*E�j 1��q�z<��M��^�u'�X�d�pq�
+�q�QVv,�
+��EvK�4|�?�2�� ���_QKv��P��C�N?,x}�X�C\��9� L�n�&?���ڮ��)��+����
�4�� �
����j�I�7����
��y_[c#�> "fr�����K
+�Wc��D
N���fL1[M!����c�y_�&F�wW��+��5��T�l+^/l���}�
i�`ً��F��^iO�/V8�@�����g��
�ݙo���n��
+s?�ۣ���W��-?|{��/����D��f�p����i��&�
���_��k���l'.l���Ƴ�|
�a|0�;���oo���Y��a���w��4�'z���2de����
��n��nr��������RxLDŽE�����g��K�L?>����P�
s����y;�a�l�0��]!������\�
6��ʹ�c�r��5�wb�l�"��0J�s���?x�Ŋ�o�
��V�������[�zT�*��}��b�.ɢk���������v�:Yu���Eϰ�[�BW�?�PJE0}I��687
/�q��pG��,~�7�<�d����Z�^c)	^�UՈ�m���چ�Wg}��&�K��V�]
TvKZ���)�B�r�lN�ܟ�Zr]���)D_�{`���>��%�
N鯑��
�/��׬{H1&��i��N
��Eo����i��p��	��*E��ϘI�"��*�
��J/�4���y�Vp���akup{��x#�S�v
� ���,�`��'�x��2�ևo^F����
��h�Y�L����*��0X�I4�_��B�	֣�k�����r��U�+�!YI��T��������m1��/��\
�+���I%���aX���k���k�^�3
+)Ӈ���
�
�3H�&����A�q�����l��}H��&��;���6~����Ʊ�y��a'����
�g��j̔��wRȔ�vDr�����5d�:4~~��S-�����#�X����V<z���jk�o�h�:��L�$#^��/�
j�8.\�%�U����<���&�H7��/�&hW�ҵ����]����5b�u��
+r���
'�9�(�(n��_��R��x}U��ጽ'��Pe���ni�dؼJ���D�N-͸�Dj��u�hE;����&U�
�@|sf��X�	;� _I
����Б��
�������B�
_Ǯ�Z�}�E��b��x5+}�����x�d��%�YC�iP�
E ^�N����`���h�>�=z�^�mKV�y�[0s�%�J�Q��8�� `my���r��
�� 
G��B
Y��6C�_��vʩcDONX-x��.u�
o�_��
��4�	�m�7�J����S�!
��D!C��1_o�j�
+�B�1�`Pu
���fw3�`�lV��v����I-�Ur�⑲����_68��Ig��>a��IN+ܶ���y�����늘|��d�$`�}@0z��Pm���|:bz{�wә|�&|$LQ;�R�zmu��^D��e�
��PυwuCц�h�[+�m%ƫ}��Bߓ��U�7
�w� ��3�@�E��A��ث��|7��4��V-<7Nk>S'��J0���QGa�r9�>z,V�uޓz�T��,[��_�I6`9�H
r��&B��<NPXHP
tW9��
��N��㱢
E�s���r�\.|x=�f
���
�=t�e��F�w��C�3�Βx4Hv
��[P)�����)���/d����孤��2mT��f��Δ+��T��`����k��j��F�E���'�	5���|�7���cjac��!x,�;�8e��Z�?
�Φ_�*�h�����K��d\�cxN}P�Δ&��ԛ��9a#�no��V����W�I�3��o\k/����k�
��nmgOm��%2_X���Ũ@tE�>EJ�%2�xI�#��!4�n�|��J���c"�$�5�ы	ڬ�p�{�
K�~�\�c���{�
��W�jRS���9H�����ܷ�9�s}�x�g�%Z�#��B�#�u��.�
Z����)Ց��)�
+�ݘ� �k%�b��
���%���_I?��0h!OV���[���U�݂��6��w)��)��NM؉�i9~?Ts�$�kg�>�?{��a�槮9��|]�TU��x��rE-̐:H@���i7�û)�V�ճ)��W��Y�8��R�
+�z��6�j�[}�8䫓6|��ܨO���7�8A�@���E
��
��t�i[�o�0�2�okE��)���5u�ɽ#���Imަyz��!�v�5*:
+@
���/C3 at L�#&M[��Q��HZ/���"B��hkw�<���7�a$}p��� SZ�
+endstream
+endobj
+3468 0 obj <<
+/Type /FontDescriptor
+/FontName /DFVRAV+CMSY8
+/Flags 4
+/FontBBox [-30 -955 1185 779]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 46
+/XHeight 431
+/CharSet (/dagger/daggerdbl/paragraph/section)
+/FontFile 3467 0 R
+>> endobj
+3469 0 obj <<
+/Length1 1463
+/Length2 6668
+/Length3 0
+/Length 7659      
+/Filter /FlateDecode
+>>
+stream
+xڍtT��6-�HI�h���;$dlc��D��$��KB�$D at ZD��������������}g�l{�;����T@�p�h �AaY�����
@XXLPXX����
��A��$�����/U��bj@
�O�x� "b IY)Yaa�����ߎ�,@
��:8M­�@����.l����@�"22R��������;�"�"@P��_)��]0������� �
-�@9+��xC1. ��?	
����I�f.P�o����  , �� p46��� �� Sm=�!���ہ��n "�"����3�+!ܑ@�/�
p��  C
=A�� ��:ah6
��€�X�_���  ��zh
+�Ġ�P�O�B?�`oY
VE��C�4���Ԡ({�B�'�Gx���
��p��O`O��9
��	�V�ゅH��9C0 	aII	a � ���Lo拄�2����
��$�	Ku�`H��@/ ����oÿO$"" 0�8B��p��d����g��QP��0V{" ៟��a�F�a��q�5_!MUu#��~3�Ǧ����
�� d$�""� )))@���s������OFm� �������G|V�6��
X-C |������0�%��� �B�o�����%��nH��e��e�?�@w(���Vʞ�Z�#���oWK��Uև�����m�� ��
w�J\@D\PX�7Ek@} `#(��[H�[�C�h��%,�_6�ցܰ�
+�gV�R���:
� ��>Q	I ���cE&*!���)��K� !A8�
`9�(��c�X�P�v
+.?��pl=!
�s���D�
�
��;��QI��v��=ѿ���D��9~�����_O��LD��
��=j=�Qf�X"�[h�����L����]K�
�Pq W�>3�*
��t��ɰ����!�)Z�
��%�]���Ӄ��V0��yD�Y��N�1
��
�
o��Nj0�.���Ղ�v��=�M�;��;{
+�rV�&^�5;�f�ږ"�
+e��i�m>r�
�=Vi�a8�]��M�����7�����t��%+én��g
&�1�$<�iB��H|W-M��`(t��w��=��{�*�O̳��@5��0�]�g=,*CR0��C��ք�5Qϫ��,�+�g���|3^C���_u~�6XuA��h����7ȕ����6��੮ �ȣy'���ً�sB��Jo�V磅�b�ݺĶ����=�Z,MQRzE/�SX��\����
t��
A����ܔ���5���_�!�L���ȀP�F��6n��|n`x��wž�:����fn�IodYɼl�{�+6�w������S�����Q�[�5ӗU2��PS(nM�~��\)�mEtr<]�d�ᷙn���@S��es�
�}�^�9�
zn�L~�
+��I!�Cօ���t�Y�:�������Y���ʑx��d�?��{ �
�c�~�퀑�Ư
+s~yq����۱όC��
����x5�F��;>�H�̮7e�M�)q(��I�Pd�
�q
��[��e>�	�
�c�J��
]g��,I��㼕�?�K�w	T
(��l�z�pS�U͍��+Ou�k��[��
+n��F��5��m���;G�<a�{5G�q��>WVY���"�/��W�I�!#����86�Z�����J���B�TD0f��
�pv�i�.̊92��)@�֖
)���W����H:v_I��
�>߽V��`x�;�f�uG���{B3�-�Iꚏ�<��;u:�i�� �[�/��7�xI�)<v=�f�Jz�#���q�Ʈ�w��-�LcWr�36
�T_���u
+��j���+Zv`^#���uhC����J��L/��E�3JAA�+�����\0��['f��DR݄3*l�s8gw�eB�����D
46WcQ|�̦�r�������끷�L�
���W�K�o�/H����k�Z,7�݁1d�&�
v����I�Uc-
߸g|����+猱ٙ��5C~uHt�y�ā�I���
+��?�S���X
+�t������m-�������|�����l��&	��a�Ͷt�|*���.MF�z[��Ť�����U�w}��2e������S�c$��H�����{
}p:���jo�t�M8��{�8*}�EwT�
<i�w�������7�{l�Ŏ�t,;ٍ��Z���
x}b܂���:�F��2��Z��]x��v��%{s�1���qSm���@��2Z:��"�N��6�=ka~�ʏ.�������qb9_MH���F��|�I�[�/�	H��{��=\�YRj���Y/��Ko�
��zC���7�hy�h
���x�M�ȴ_�e={"��;f[�?7�Յx&f�ڹ�j&������Z��I�ja˷���A��9�w�!�g$
�z�5֌���j�칅6���7�H�J��V)l������6�b��*ԜTE���ˢv#��'��:%�iaZ���2ε}
H钩?��`j푒��fG��O\�����Ά^���j�@�>e��Ñ�b���g��W��:����O*��$*J���Wyod��S}�Q]-uؒ����W��Y
�I�0_g��]�ij��i��i� M*�>�����Ԣ��c�z~��CW䞌U����;݊@<'�=*;�I����Od�(�N�^'���8wڻ����H86͂`���量?�93�����dPr��v4�|Z˒�
֚d� -�БK�Q�`Aߡiѿ��"z���#`/A+HRQn9*�q��J��vD,����W

iL
�B���{?F�
�P張���������x
�|3�t������	�5��χ"�4��O�d��v%ל�]��~����BU�]F��R�k}�����h}��r���7�T�W
+A�����z����]ڬ�e����4N
J1�mR�o#�Mg�����`��)������r�p7��t]����Б{�ӷ�&���/0�Q���-���w�ɴ
ܤ�H��)�ߺ�.+���>;�ߧ
Lo�:( ;	.��
ǐڌ��
+��xG{�z?������.�U8�>*餶�yf>���D#��#do���~��|��X��Z���}ϧ5k	KQ,�\�-��A{lAW����>�
+
����w��#���٩�%�~����dJ<[j&[^��_e�%A�~���̲�£����Lz��(�
���_N�����kl��WL��ҋΜ��%q
b!� ^U[*x8|�V[�D�����
+ܱm����G�K0����~�}�(���I�;���V��u:��-��C
 T;o|-�NH׆�<��`��Yvc_7�Xֿp?����*Q��q�cy��n��:�
�ԩ?�SfX�c��U!P"#v�怂WT��s�4��945p>A��Ŏ6��

+3:�X|���|�����x�ε�l�82n�6'91�����V��G9��7���,
�j�q���#�|�<��C��bp?7���?�XdάU�苻S@:uj�i�v7I{��m[b
r>9:�R������z�����")
+���^Xg'�)�7��a�fvQ�w~F��@�6�c����O�6�&�bGi�1!�`���f���F��n+^�/
��b��7ʃ��-��
X1
.�45�V��pI��C��.��A4�f&�6�G��4+�	ٖ
�]�i������\��u'���
+��
�Ր��;�q^�en�=:0�=�T�� "�zj���Ӌ�*2�J�T9�f��{G���>7ƞ1!
�h�uҤ��,���>}��%�$�<롟�%��kՠ([��`������f�]kQ6�
w�����O;�(�7X�(Y.1�L��Qhƪ���%���1k��+x��oP�;�y��Я�vӘ/�˕�{���ϾI̓��GAAќ�b^��Nq.
G�&�
]T��
�v��R��� f
�bА¢�G�7@ˎu��A=
Eig�����!�qt5�ׂ�'t�d�
+e�:zv뢻ٍr^��06��/�(��@��C�ꣷ'�M�@�?�-����k���4Q9E
�\���x#wY#|`m�"�_�,�Bl�3nZ��L?��ND����P�hΰ��;η�J�o�
D��
?d��fc�@�Qu��V��_'��N�&�RйmL�Z?
d�](

����7�{�KH�օ��z䈒Oߟ
ih�L=��fy�N��4����Q�!
b�Չg����
�F�@���J�����,$��`,��SR���E�8!y`7lN�[	VW����N�d|��#^5���&��Ԛ|��JC�R�O�T<:�����J9f��;:�c�ƿrS��!����Ep��^v����8�/aTu
dzm��؃�C�ήy��7t��
�Gp>��l��(|I��^/�y�OG�I��ߧ��2HHppQ%�r��e�*��I)�WA��b�N�ʞ�آ�%�I�y�Y������62�#�6
_�G��,�&_PQ�r.��|�il�(��e4��l��ϙ&�E�|F枿~�'������Uu�=����pt�R��嬎���huu�/�b<�^&7���

�x?Wp�-v�̹�rO����̓�����
�������E���S%f�cS��X��R\�z3$L��)�`ҟ8y����zA�'��%.O�і����l�e~�
�.Y�����ե��is���hT����U��ͧ�a�b�;�K [...]
+�\��[Y�,9_:ٙ3��L��l,�� ��v�O3�f�_��O��</������G��؁[�_/�2ⲟ��|���|-�)����
J��
����b,�It��֙˔����凗n~�be��1�
+���+'m	��>K&���_�Vy��@�-�}OӲ��eN�l����!i�G��
���W�T�,\_|Gs5
$�dԖ�$=(��P����n�x��r�X���������
m��{/��H�&=�$];�q
��n����{g�FC7k�AyL�m��Ma��~���@����SzW5If�/�b�;�/�5Ġ����b�U��ٞ���=�c��K�7�>�L��v¦
+�1�
�����Ŗ�Uc���J�����i���4%�u�fyݏ�Y�_2��q4�m�-�)cUrƦDu���xw���ro.�6�����7G�LWi+D�^j!��\!*uބI(}���VH8+|/O%q�
+��
>3�`��튑��7\�͌�8��=y��jq}:_���@��q�<rn���UښGw�Ck�
�6�$R���J��(K��<>0�(xI�m��u����������l_�tI
OfS��؇x�W�=��-�
�w^��w����
ߕ����u
doY�9�c�B�ey͔(m�P�z�m�k����j�n��/~��ҫ��1�z�;�B��kv�l[YȬz=��T��A�*���\�ᙃ���b�s�.58]>)˔�Cƕ3p�R,���N���{����
�2�����
�kk51׏
��%���D�!�x���k��>�Q�����:k$�^�
+�c3�������:
�(#�$��./hࠈ���i\A�����N;���6ל�������>`�O���6�/�o��
e3��q����f~*�z��0⡜V{�'�4�h�E�M�q�E��{e��^$l+"5*��&q��ǧ�t	���p�}��
��|���ܷ�0���^�Ac����b���
QRd���,�8��ڑ茞��%N?� _R���L������Y� N��!�yj�ȣ{�WC�
+N���&�>h�Xj�
����k-��2��!N#e-�}��f
A�}�Z�H1�P�"����[�$T	�|'�v+�mQ
�e��:�Q�_1� ��<�ɝ�	��&�z��=�7�cR��]+"+V��tN��Q�<�z���tgȗq���#��j�b[���j�f᎕\�_��E����֘�
��=�4��8��P�]Ɏe�O<��?Q3�/��c��3��NdI5�1�T�-
7+öF����z#����qD�WTL��mWaC��e�#ܣ��-d�y�Y�dP)��^px��
e�nT����}W45��Y2N����ӉaG}zz���p�i��
�#��
��wMHH.�0'׎�a=kϐ�AW�UL*�����֙�΅������(R��,�e���ۻ�����Pvb�퀽�
��_��A�k<��[�
+��?��=l��Dgλ�[��9$�*O��3F>f%��SPe�����:4ŧ��3�S/��/��ў'���>��s���P�P"sp;��knFܝ@�x��fX
��'.nS�1���h�C3*�C�S���7[� ���z�.�\1(�Q"E-bHg���g

)$�/%�|;&���l�'mL�YŃ"(�^�%��e"��N��\�ŵ�M�[3����*�M�I��
v?S=HDqR�����,��wV��=k�
�s�M&Lө �+:HU���	ne
�r� /�M�Ry\|�w�x��6FS���k�;Oe鏧<����0.��s3�϶�
�ʔ
W�J���]?��6k�
+Ώ>�-Y��C�
+��^j�؃_�r��zk����7�+
�w���;�4k��h�[w������oy�&ë&?���vgK�\�[l�y-2�K�uG��C�����ݲ��r<e�x&<f�{"�Z�]�]�y%Bm
�쾨�h�u�+3��DUQ�OMf7�
Sz�ڢ.�>m��`p6��č<&'@�@hZ��iw���qll���8��[P"f��`���i����GH��n�('�=oG=����g�y�1��'{D��k/��
�@o-���yv�>7�m��t��=sH�٘�n0�
Gx�X���,I�{�O��_q���At3
�Q辬?sd�)��'�

����Y;H
���H����|��J��im&��~3�T�Yr՝����Vm��5f����*�X��Z���
+eUt�/�Z햌R>��\us�|��J
�\6�&0�T]��q��skx=m
�n]�{���*���# �ᶄB����`/O3��������(&�m����K��I޷-�(�Zȓ���+���
�w�J��D������έӞ���z���/��w?	���tJ�%(	��X�82z�Y�Ŧ\u���9F5\�in
���3T�l���[#���
+���Ay����糇��B1�
+�be��"�CyB���l�~��Y���ɧM�y�����o}�p��:����f�lG)ؼtо�F�*��%����~y�S�W�JExH�Rـ2��`��
��ť�J"��e
�,��
?X�4ÁR�k�B�</5�APg���0+^&�>Qv
+n
��(�����Z*b����l�n{��>�,�v�����>��$�,�t�O(2:�:�Ԙ\�8�L4��̲z�k
C/��� B�����&E4�x
+\N�f��S�|�g�x
���r��
�
ȩș:��k1�Z��q��>$&f�x�'��	��zp�\�&��!#
��~Z��*�oXh(�5�� ����
� vIYp�Ș���r������/P�(�#$
��ne�:җ3<��ug��&ѭxyڡ�?3��
+endstream
+endobj
+3470 0 obj <<
+/Type /FontDescriptor
+/FontName /GCEPBM+CMSY9
+/Flags 4
+/FontBBox [-29 -958 1146 777]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 43
+/XHeight 431
+/CharSet (/asteriskmath/element/lessequal/plusminus)
+/FontFile 3469 0 R
+>> endobj
+3471 0 obj <<
+/Length1 1342
+/Length2 2576
+/Length3 0
+/Length 3453      
+/Filter /FlateDecode
+>>
+stream
+xڍS	8�{���%��-�>cߗ�gM��1�2Ø�f��ز�f�\[�n�!$eK�%�ʖ\k��%��R�v��y���y���������
�}v�ʆ�;��R e
��8٠� �G"�0'D�a2� �A�R���0��8��3�A�@*�d��
+�R�B�k!� ����ҵ �/� ��K*d�d��4��I����G@/�45Օ��C�N��(�
"�>��82�Hœ@��K	9
"Ѵ???8·��=�� ?D
@H�	�*e��ܠ�� NDc=�H���pt`;�$<Ha�S�Hط�ր-
�����J�Fs 
���F�j!e-��S}h8
+�D�<Hd��Z�!H	�Q�@
�Ae��|q$2Ν
X{:��86�
~
<�D�p����Z��fS
+����R l�}&$:�g�����7��G	�ay�(�U&
q�B:�-L60l�/�'�
+JS
���OD�^�Ģ�kAԪ��!8�F�
l`0�d��8_��L08��_-
+Hxp=I�_��n�c�fϟN��#��C�����I��T
+��|m�c�Cֶ������@�2(���:UQU4ه�_�����k^;
i�u�hA���$���A�wCrk#�z�!*[�  ���O 1H<�����`-�i�����?_�e��kq�u��q>$2k
a�$�����klHL�F- 
{3
)���#1�$�`G���u��A�N��kJ�S	�˃ƨ8:
ǂ!�
+A���bo�_'��S�;�1�`��J���D �W]�@8�Y�\�g���
Z�#�?�uA�}I�kGz�DV.�6��S
kC��5|���=2j����}��ΗY���>�����:�{��QQ���`PZ��hoY%����RP����)�5=nUS��B!x�~����7g�)�K���؋�I3��w�n?���y����#�����3��0��Ȩذ���� �A��DI�䗴��h�pC_��&�P��۷|4��̷z�&��ĭ�ځN��:S���r�s��ar�G]��Kk&
�2_|�
;=�ޛ�"�3̒��!�C��z*�;�eU{x����J,��i)k;��=���[�o��3���H�w�1��=-�0���P���e at i�^�7

��+�cuL[�U,{�b�ڛ=$��5���
�+a�\j��(돘��S�\�:o���2Vt�lU���'�����e�-O�#!���mC��?qエ�.�ȻL�:I�s?
f�9�������FTȵ���X1��s��{��W���`�
+'���C\��G��]wj6mȞ�ŒTR�~�ӂ/
վ�p�m[�R�sCIjn�L'��NJɢy\�����UN�9�*b��Ɂ����py�w�v�\�_����o��౗[g��7��O
+�h{��<hV�-�9���vDԍ��B ͡V��l�N����#���^�s!�c����u����#\4O�-
�s��@p*�� ��
O䊜rx�;1T��1���z1�^��tz����=�)���m��U��=�x��.�uQ
�P*]9�I�X�);���,%����ѻ�9
r��T�{<�:��'�
�X�]��r�`��'X�0�!u�Pw7�@����̤�{����'�"s,H�ɽ�yW.�X�\�lm��{Ѐ�m̤�{=Z�80�y|_�� �ū7�͢�aj}1^>�yfE���
;�S4S�C��;���ԭ������xnm�Gw�~ܪ=�[��W�3^�|H�l���Yw�I
M�$���Ǧ��Ԛv
�j�u<��}����ys����s���\S�3��u)�u�`Q���B�%�C�*]���
�g��)�Y6(�&V��~��N
�PĈ{�|Tp�;?AZ�\I�D����{L���$P[71b
+��t�l��Y
< ��'`�T�Of�=
�`�v�v��o�`�9���
�4(@j����L��÷�k{��f�x?sa���yà��z�
v���q1�|\��k=I{+zꏞ@���=�qF�9�v&�|tݹ[�P�M����Y�1;ս="�+���Y���#�R��g3q����""7�po�MM�wN���[��$��χ����~�3�:=޾8�_�_��`ctŠ�0$�=$q�`(Q�@>�^�e�� ����:�-�	r��h%HلS��R������Y������ԕ���BS'r]{Q-�C��A�C1�;Ϫ~8p]�Og������3;F��d3BR�Yz�y�e������?*�[#g���	Ψ
+\ʈ��-q�V./S�ԳԄ�X��8A��%�MV�$ueU�ױc�
�ٹ}��B�:�NY��4�Vi��_�"	��n5B��a���')����0>a�s KT��KksW�+��F�yUE�t��zU8/�CRw��7Us�
���x�Z�s�;���Mo�5������1�1t���D��Rr�?
�x���<v�o��r@��q�W��()\	��
Uqpyͪ��u��H6-湠�
ǃK�����*���~�_h"X.}�i��T��DZ��J˭ &*R1����MK2�^5X�
�H�`�ޅ���=# �ӷ^�����M��W���ax��0W搢�h��-f�J�r��,-�5��|�wj��D�3��)����C�`���sf����i���۝�����E)�H��
�6rzs`e�Z�g��3އa�ӺNO��k�/y��8ڞ�78}�VA|��\�T��X��9�{6R�w�(�
��5��.�[�M�oQu������FˇϞ��'�������u6���
<RU��t��[��I�̺?[��
�y>���n����<�G��\��;4]U��

-k�K�v��WJ4轺�3�wtA�;"J�;IS���>i���珆oR����
+��9_����R������/�'_�o����ۢaB���s�\�˸)�����z��zt���
�A���[�

�'��8n�OA�
)@��Q��FW�is�K<�7=�_v�"
(MG|�j�g���i���hUxٳ���m��"��9��]�ɱ�B%�R�k�J��,�H�=%��!�ڈ]Ē�E���h
�{�xd[|GRh��,�֕��i�zU��
�3_K�5�.^Cl�x-���sf���n�fe�a��?��4�%�J�yY 0f�
�A����>��B�}L��0��R^��v	{��eA)wK|�e������
	lk

�����Jgn�s���1i�qn|؜,��qs�F�3�bP������M{�����N�_-�h\��U��
+,c�{_R;��͕R��Zٞ���MR
��+�]hwq
.�݂�roȬr�F[
+r?6��C��ײ��c��x x\ms�*Vh�
|���s�؉(����A[�fB����pH�27�S5�m�?z�[V��D�-f���Ӎm]Mr����P�~��ܳ�]V&���Z���N��E'�
+endstream
+endobj
+3472 0 obj <<
+/Type /FontDescriptor
+/FontName /CDCNLO+MSBM10
+/Flags 4
+/FontBBox [-55 -420 2343 920]
+/Ascent 464
+/CapHeight 689
+/Descent 0
+/ItalicAngle 0
+/StemV 40
+/XHeight 463
+/CharSet (/Q/R)
+/FontFile 3471 0 R
+>> endobj
+3473 0 obj <<
+/Length1 1612
+/Length2 16995
+/Length3 0
+/Length 17832     
+/Filter /FlateDecode
+>>
+stream
+xڬ�c�f[�%�v%*�Ҷ�Ҷm|i�f�m�v�m۶�W���=���������+"֌1c��7�9EZ~#����#-#
@�����A��Z�Vh��kd�#%��;��X
�;� �@#����`���#�غٛ��:(�T)��i���O���z��t03���}qZ��Z�
�B�_oT��@���% (+�..#
+��Q������ 9'K3C���!��H	0��X��`hcmd�Oit��
 � [����m at WC��?.�-�������;��`b�o����6 3kCK'�����K����o��_�_09GC{3[G�߬rB"����T���f� 㿑F6�N����/�_���������O. �����R��o�`��f��pr0�6�O4 {�����%���/�_���u����mm-���m�o���`�� �4��cd�����on3k8�E������v#'���s��� �f��/	}#kK7���^���oJ ����t�}"�7H��"���������o����y���"N��2�V�?.��� �玱Է���[�Y��6��@U�����w���
~k���0�1����A��h$g�hh
+0ַ�۩���F@{K3k�_E�m&�������L�
-��i=����F���_���N/#�&+-C�_�����j��f����(E���-���qx��=��L�� ��	9�����a�ϵ�����+@�o�
���?��\i�akC�fE�Q����x�/�?nC'{����{���?��:�
+4�[Y�1�h����X��=8.����>d[\�T��[e����Y��^
D�0����pj��/Au0܍aIޕ����"���C� kg�>��)��z��q5/���Ơr�3.��S��?��ls�D�K��F�h��m�\����{M��Y���#y����@�
d�>.uV4,�O}L���	�nz���������.;?��+���Z"��
	���= �C���̱HSg�}��
K�1�F
+s}	E)'{n& �W�
��������h�[�40�&�l�Q<�%���,{֍�݋��v����nڈ�
�Ν�"-�|�WA�a\
D�|a
�J��o��ט��@��
E��%㢵�[�]Y1���1�x��R4���@OOV;_v-x# }�~p	�F| �
dzC05%�"%��O{�OO��.�@@
�$%��,�i���K�
� �j���.f1��>�w�&.�R�
��R�yK�z���On �I"D�{5�ѯ
R�
щ ��y����u~=����1�e�(��~�3�ޢa�}�d�
�ܾ�?�ހ��O����kh����������T0 �F,�zRx�Zʏt��E��4�_J� ��M����q)Lq�+P��	�y�e2�}d
���
��Dq�{��+y���m�k�e���gk�J�������
���w�������]���r[���n*d)Vū-��w:�����Vh
51Geheg|��.�J�o�W�܁�j���Д7�#�~�K��Ҿ2�e?:
?��v
��k�����
�t�"�zoRSbR�����,�g��d��
+� �%ڃ�,��J��ꦤN��
w,���Mݒ�X�J��F!
����6� Wzv�#r��m������n��7&�޴KIM��s�Ӕ�'1�k� d/����&�Q4݅�Ǥ*�`W�Q4;�I��-�٭0��"&e�����C���:#!���ǾPnl�Q.ܶS�1�����@Eլ]^� :�����S\�h��%�+���;?�',Zš�0'���`gk��
?�����P��_�p�L���D��)o
�D��3�E/�0;HE]z�:�M~iFQ���.�r��6��ӂ��W���Y�>�ȳ��
a��� ��/2�z^����5�3�NՑC���]�
އ�R�2�
+�I�`m�Ӳ��8�h@��A���f*�$cag\gV��5<u�S-�on���(@���^�y.X�3�
�M@�$c�4�����<DK�̛Vl�J_O�XSҨJ��! {��Uhs, )�Ra�D��d�I�g ����q��ȠW���p���ǀH0�I���Qf>�Ӗ�HOk�W��� i��[!n4�0�
2�\�;�i��%pv��I�8@|��4
���:o

��A�*G�=�ï�=f!�jƧ^q�KTU ��8BE1�+�b�c��eE$؝�=�n��ͭQ���>r��5j;��T��Œ��7�϶�.O�C
M"
�N����� G��r��x�ޠ��뜝��D���o��Q�6��
�
�#�K�s�nF?D2V#�a5t.qT
�!54�/�HM^f�6 �K4����"�܉��ّ��x���Z�&�L kp���80Y�%������ފ�7�@��c�7����a�dF
����UV�P]�t�����Yo���$+շ���J�-�UI�����@��1���@�:�d�c(R=6M�ӑ}���%�i{�/�HWJ�_�#�w�{��J�rn��� �̒�̯s*z�ѷ�J10���D������<x�&�M&
�e�h�tR.�A�M���e)Yby�]C�A�DI�,����K�(�C��eh��
��&.����]�O:� �n
�����R��4Q$���+��
���
�b��r��e
+��5�-Ͳ"��W
�J��5f8���;]{M�M��e�RBrX����;��
�5��Ӟ�?��Z_!�O�k�le1;z^	�چH�@7r�"~i��;���������{��\"�L�	7#��-tm�}	�l�E�H�X�΂(/�L�ݚn��J�-9��B��v��e
+�����5�J�%f��:*z�����<�oj�S�h���x.����������� ��`
o��4u����3
\Ay[��PT����n#�&�H�
\�ڥ7�̔�J�g��Oo�����o}�v;���h,P��z^�q�o�m��I ��.��
+�
�
+����"<aK����
_J�:�
W�}��tO�==VD����HE$�u�1ߔsz���l�ׇ�C�V�H�
z43
+]-˓W|jR'81�ťW
+6�� D�T�ꝋC�gJ�D2y$�
+w��'\@��G�Wg���o:X-�fV�p���vO���E��ԙI�u�
��Ɨ�15���<hٗt��������L�L���ghSҴ
L�W�
�=�r��3�.�变zK��h�:K�mG
+;���"]��H�
+�p	H\��
M��]���|�T�&�۔�
��Y�b�ӣ��b�����\���T턇�=�*���F��"ӟ��>�
���j
�����&��/n��#��=?q��
�$�!������F݂ �E���XW?�i̵�{��H��'70��+�'^�a���d�bk�Z�� hO뵹��
����\�?��mYM$�9>hi�V�L�U���?�I����R
}� ��
U׸�<��e^��HR��Jf at Io���
�K��ѿ]�	�
*T���4��'�A�7߃�<����;�SRR�5�β,���\�.K�1�VQ6_J �;�0*v=�7$%P;�*Ӛ?��'$;�(P� �U\�O4�Z��jd[�<aE�~+퓖-z��*e=���q�r�.l� D�}%{��(_�Jl�o�؇�e�j�$of�*�
]�����xP1���
b]x�#�WȂ'*p*�&�(�����K��`85$��(9��6P��Y��Ek�PG�;E��Cv���>�dd<�׻,m~yc#/�c3ߏ@Ԟ�&��Ӥk]�P����TX;ώ�ب�-F�mI�
+��m�R�@
A
0�}Ť�e:@r�K�g��Rs��I�э�iţ�
����c�\�o��q�x������1
A���0�W6�;6��!���G�Z(��nc�+�:�j��Xɔ�Ș
u�rБ9u)��Kb�&��{�Ч/�Mk?�|�֜F�"�y�eX��R�>��
+S�FIyC�-�>h��<[u�q2�hOUD��f�>��4t�R�?j:���sw��%G�J�
�ɘorH��[[����0��+A�-��y�@�o��~��S�)W��L
���p2�m:O�V at oVk�!}}��c���5��>R+��|k�Lu)
�1�&i��f��Gcے4��(�y�
%
+qv���C��Tj�F��%��
|��WɈ�<ܯ(��ɫU�<.�̩�������},�˯�i��.$^�Zy�J�

+����
�@*�8�6y
�}�De����ȸó�TQ
���
.�K���ť��&N��O������҆��O�
ӣ���@ڝ���<)(|x"^�TJ�'v�S3�UIZ%F6&�r�� �ge'�b�Ԁ��kB<*�����{v���{�7ܼ1�����Sn�P�`#�"^��
����PB����֐�ܟPW|�օ�*
տQHk�p������D
Te[�* n��֣~����RbY�I:�Q���
'�@�/"�%GP�0�p��vo0C�II(^�H!�sA��U�sUH�ۄ �^��
�e��6���ܤ�]�
9�	U�9�%rԑ&�",�7�j?�
+qN��V
߂���i�,+Q�ܒ<��
d�p�U��pꀌ������z�4��n
l������Ao+_3}��k��@�Q��b��d���q�n�(˓WΝ�
�����?z���hq�k"$�8�J����
O��0�ͧ��s
Z�nI�M[�?��p,Ѯ�>8s��=ҼiW�봍ڻŶ�ϛ����H(H���X��4B?1x3S�'�H�y;P���[�;��"�+Qz
�kc-(����A7����ȺϨ�5ޫ�:^��b�]FX6�%�1Ί����
T�I��h]z�Oz��;���y< 
+qBX.�5�JM�e��������&��e��_
Q�
��A����7;�a6�׃R���A��=]b4�+c��G��^,L1j�[�iq�'�*�ﺺ^���xVp�B~:�s`����l�4K�]� 
��t������[�&��%�7x
���h���?;��P/���&z��U%�saI`+-148���IQ�l���@��͘�NbR��5���"9	X�S���a��s�&d�^CӪ���fj�H�P58kqy]�E}sc�LM(K2<*��J0�����m:ؑ����JZ	]�����m�ȥ�{�NC�t��
���o��W	�KU�V
��0lۻ�5�SfRrK[hC��d��J���O|E�"e
�C[�(+�+#��S����%�� �' �y�:%�v�x}�.J"u��
f��A�C�C��2I�d4���8��;Y����0�:B>����?dQz)�	Q��ƒ4�p����w�����[�_1�H=���� [...]
5v�K�cJx��\dYQJf�^� ���9~�
5�*WX
�K����������s��9Hmh�+��_,��gs<?�k�
H�f�[�s�'��#z�,���ыk�]H�"ˤ�"!���f�h�~���r�n
�J
h�L�`���7T6ojIA���X��
5�j�i���F�ȟ×�S�a.�=V�q�V�5g[c�5����4f1R���ezw�G��%t;ˆ���� u6E�ۤVT�b�5�萎�bf�����1�zV6�N�7?�m൒�Xl�X�%��>�ݶ
�[��($4#�nk����|�V�}��+�E����4���D�K���O��w6��r��F�r7/3Y�eUC��)A�Z�
�#�OP9�(7�YcE
�x��j�$�����)��Kk�xر��
B;M
 �*����������o�������\ �
P�?;I������e��1,�L�2W)�x�-�D�xx#_�!�v%bU9[V}���I���:�pcBF��R�1��0o���%�R��H�a$v��$���P
�ـ�_�8YQK�1_�+�LAy�I��6�ї	�m�`0�j�.�pZ߱�5���5V�.�bb��2�i��G���� ��*T�K����h��K!?��e�Y�W	�bn���mQZ��;�
+�zx/l���<��3v�
e��d�?]lG��x��=�<�������U!%�
^��g��^�����q�)�@�^c}�������E���}3s�
C�
�����|d�wb�J�
+B�\3R�y�p
�m��X���+�U�]�V�{ݯ�z+�I��]ݛ>����F��ϖ���]�W�jX��
���S�,.���:0m&��J��,k���
*�ь��ҩCC}NB�Ah3��`��pj��O�!��1[[��}�/���^��Q5�i5��}P7{&����w
�)�}��%[���<\ ��h�#�(�����f�B,`l�o�� T{*��ت�Kﭟڗ��i9YW�U�k$���@~
�:\X
U�*Q�Ќ����QX�ר��;���Gvy�;�

e�0�vё�_���۔��dL9z�a��.���V�1����Go��]�x�$�,�,�#��Η�Q���xbLkA��=]�l9s?�c
7�MC�R�F�x�$����&#
+�Ji���5Wn0��)GXY,���^�i�
+f'_QK8*�E�8�" �(K%�0��4��g�dMo��u?=��P�C��C���W�)�=���Yb������|�9?�]����O�{ ��OV�;�+m�H������'B�P��x�J
(�����R��8TL�8��"�J��C
�P��N*�E`2��.d�Z"U�b -��z_�q���&�!��C���,�yp�l�82��/��$��EL��:eG�>S7�!c=��kG��A?�M�����p��ݳ2q�^)
3���{gc\�?~�������{�226V�`�#`P+�tL��~.W����čzDz�
�
j���!��3V��$Nj4���j��ѳ� J+�2Q&d$W�
��
^Zi_�vv�J�U������.�d݇o8�	�l�̟
R�1��
+�
����J���@�e,�HЩaϺ��:f
��~=<d��&���fߩϜy~���.Y$�#2�h���_�����3H,�[��)b���y	�2�n�����0��ӡ�I�ɐ�_��M�(�'����QQ6,� @P]}	����n���=�h�jB�5	��m��|��B]moƓ�/Lor�l *Bp+u~�"��\6�{d�z�
\IZI�.ш��.��t��T�j�]��x���^�eqØ�0Y�LˏLi��N�*�M�K�
��Q~R���neʰ͂�$H7
�
+ٷ�x�I¡���&��pr9%�`T�h[O-J#Ǜ?��/�~����
����_�u':|�l)hHˤ�`���zj%d�u��c���'��
<1�ę�Z����R�q׷qL��
K3+%?p�mv��>���IU�u��[
��ЛI}��jä�	�G������8f�����^7���t�y����Z�tS��;X��ѥC/i�C�������
�P%��ۦ4����,a�3�̪2P$3���:(b�N��n�br+��Qh�� J'�x����5o
�'��q��Jg`�M0�]pv}þv���(i��қK_��=
��q��:p��Ot�q�hR;��2�ep�M-���
M�`X?�"r��Ϯ��� &�P#:s�=�
+o��nS����:�~��������
�,�2��E� 1�����/VRlo�-�I�M!X�do5�:B�
� 9i��"(����'��D��(�
�1�p&Am|�0g�h����>���x5����
B3
��A�d[��W㤣Uq�L�q��Z�v"�K�-/�$u�eߊ�����s;�
8�
+B��屧(�Blvy��b]�ch���x���"K,Op,�q�<�T�MH|�O!��!+��O
�v�ioL�Z#�M�H7�
3�w��Xkl+F��Az‘=��ʳk>���OD�s���
�ЕRh���Wٞ���~���H�
��C9s�/�&��+��=���膇2�ɲ�aB-lÞu�-�U�6	9���.)@�3;*e���g�[�W��K��mQW��`�
1
���7��+&����}
��'���6��>
��o�+L�k�V�<����o� �z at d�>���(��*�C��y-�m{�}�YǨ{0p,� �'<¼�MW��O�v��
I���/)#%)����$��2�+�`�Y�{��*^�tCF��i� �5X����H���a���
�_�Ѭ]KDp
+<�b�M�9�
zb�N�P���L�!TH�M�Z4�(I�1��R�80���7n=�
Gc�g���]��W
�-��=7��y]��?��S
=��vF��"umJ��)��jDG*��VoY�K5��
��6�յ���U����/��S�L��Yj�@�b��a2��
��
+�kr?��cV
�u�Y�iL���>�����
��{�q�v�|l�M얓PS����,���7�2	wk#�̡ޑ�E���9�VT�8�/Q
�����i����-��
���Wu|��7_q8�9$����ʱ �X���F�v����W7���c�SJ_��>V���SreO	T��u��ı����3���;u���m�݃��!�nr�|���0}�>�A h
�*+���0_���:�ERI�N���O��_��?�IկC#Ş�<�Z �,��mC�_L�2L~]�	?4�)B٘L�������CK5�Xܪ����5�g�c#nV�(~�]cu���Z�v
�D(@��;
Ob�q%X�@O� r�qd�$�
$Rb���
�G�t��I}�? ��C��@,ig
QAu�T�3
�'�b4��׫zS �o&1�hz��"����n��ﭰg
�Χ�=�|���X���v�z1�5�	ĥ���~ ��;�vWsx����t
�n���׋1�[h��	������d�u=AY;;�� �[Y{.I[������|E6���t*�x�i)��Ǝ�^K��g�t���MH�Gkv�=d�m%=����$
jH�W,[�����
r�{s�`�;�
�if (�{7�h�Dt�i&��O�I��q-�U
QL���.�Ht��y^��#%%��'�pJ�8oj�f������[/[�^'���
�����.R��@���`���A/�/�'��xg��i
�NAz44�"|%�tN]/���Sᣑb�b�Sѱ��ѦɄ�l�h
^]��m����#���5��n�M)u?�ί}0�FW�Tu+[A���]t�R��V�
��A�{��*��@��Ã�69,�����͗}h��=��"i�RLNYlwB~������>��^�?x+��'�\��G

E�%�0�h�lB���:�<^e}���
_x-�,蕖9�����n��&�C��Nۗ]�5��vj�S��Q>�k�a��\H=�b���8Eb����4��I'
>{C�aH=A���[�=��D�3���I�ii}�Ye̩��b�lG�	�b�ho�����r���;��K<f/�ݩ���t���?��6Ml��M�Z�z��6`�^?�H�}4�rP/ ���-

�O��������-�
�'A���&�}�qC�j����P&��
^�Zj�,y��6��deHAZ�cnf�N�kե�2&�
a
��L�<ش�P)]@T]�w�W�iE��jI"9 hA�Ƞ|.����x��+��2_j����p���\q���M��"�$d��P`e�i�q��n��$�}�L�V��L!J���M8�'*��)�c2�Im�n����3��/R��߾K��S{�u��J.b�=����2sih��	`�
ɬ��x{B7���L���l��5p%@2����q=X��5q����)��GϗW>�eV�Q�~3x�B
�,%76�xW
�AkҰ��p�c�h[�6��~$�d�
�
]�"����p��v%����Pߙ��AJ���A�л�Q��}���C�lJ�Ǎ�38&9�#�l~�����|F�(�>oAj�4h�"�>���H��-+.]ז��
'G��e
U8j�n+��GjB�P�?�a��&l!�fFj B+r(}����ڤ�ܯ�A_s}�/�*����)��:����,*��������[kwԬ�x6. ����W,
�D���6�ǫBA�aQ�D0X��,��t� �?�T�0��C<v=[]!�b�!N�v�\���M�Tl0��8X]g�y���H��e���*���Ԏ܁�������
�W�E"���cf'��69%䷮?Y�蜷�?`/�C2�e�}H�lR%��p	
N�Ulq	J�
+[jxD䬫��7/s
"���}�S�>���/����}C`�NSX4~���MPl>�s�䯾mcR�3D��u�]��*W�%^F{9����|K�H��U�
+�f��� w����A]�b\�y�F�l~����^
��Ԟ6+,�bA�D�_�[d
���Lm�S��C���C]+U���Ͼ<w/2����5 at AA �Z�B<U���M�S>ҟ��V����ܑ�=�]��
�ĭ���ϕ��x[S��
D
��qx}�I�"�f+��FT�@S*|%_�۷E�w��ٴ��Dz�:K��Ao#qhns�<
>�ft0_����
r0ً=�OPx���`��!��AH��o�e/}��4�F�>0ddN|TR��Q�̲�
{����z��OE	�����*�b�ֲ���&�T�ȹ�X�n�i�S6.Ж��cd�M�
Z'¿�0�I�i��,ž��k���Nf��<��
+�������\m�4�
���5�=��i�\ٙ�<®#	��NDe�U8%�
4��������-}�$��n1ڽ
�ES����B���}
﹄�Rh�dH\xG���D�&~�N!�cq��%I��@��
Զ#	y *�c
F��
zI�d�
<��G6n�Z�0���j���%g��$�Y��{�D����4��=>N�=�8m�W0A�t����K1���;�o2EB'/)4�o�y	�6�m�`�GO7��5R�iL��j�
D��}'�
���aXG��Im)D>�]�g��L�J
�\�
@�4��}/�r�&?��XTqR`[�(h4f�*��HsW'u7F�����F�~��V��*�mA�=��cz@�7
���5��<*r��	Pk)�x6,e����nv��Z��$	���+�%y!=:��� +^�8�G�����i������5�'L���d�qT��Cfe���"�_s~�q��}k�}���pѬ��#��s��@Ƕ醇�AP��y�F�SZ��#&sJi�.�Ng7�pCp
+�|�ӎ �}M6EV�_T)���6�T>�d��)�3��"�;[CF̥��7���1p�|�AA��J���!H
2��1s%}���
�h���3i�
��C�Z�
|4��8S���ޞ�����b������+s����1R���6O#>�щ�����=�
+m])Ƿ߃�
+3�,}�
�9��N4.0[�\�.}��b���G�au^�� :H9���&�#ݥ

+�F�&w��G"����H�;��{��,#�@L���O�X-����fl�IV|�\n�
��8�ZΔ�-9o���6��XBԑ`��X�ޠ/;���)�>��!�8L-���2�D��{�/2TNg�K�$$}�/$��	df���$��r�錖��^�]I �����2��4��?d\�KQ�_/-���u��>��V�
+�A���% ��7�.�i���@+S@��^��rD�9!��
�f�ȹ3墛��u��$��v9dI��ܧ��3q
����rX�z�Q<7E�8�]��pRcYm�,��4�Ŭ߿!7�v�_ً��+7�O�18T�<>qٓk~-ot\OR
=e��ۇvW��!)8H����cϴ�*�3
���N�qxO�/)�P�n�1��aJ��^��Gy2�����-���ڦ~CZ��w
+Fu!eX�'a��!����0*
�������Z�K�wuׄ{j�얕�]g�ڦ��ҍe&���c��-T���mL
�>��d� �n����
�>�`O�
A�V橃\*ҷ|K���-�FI[a���n��v����W����E�y��(
5��O�/f)�s�Np�U��'�3�S���� �@�4{(��
皉E�7���>������Ma��&�(^C�:*g�E��y����D�T"������Öm��fu�h�M@��5��,��
��酵+�:#_�ۮE�ҼBF�Q�;�NIj8+���82�-����:!B�&�&��D
���;3�{b�
=�
+����;R�;��]�hW��\�~���j���Jo��~��@]Rn��x��
,P>A��b�l�g��6�[��z�G�`����ʛf�+�G�7Z�������u�2H�������O�^/R at HiK�S�Rp���i\Nk�
d�ø���>�\�3�򴗩d`I�W#
Ur���&려��HKSfMj�
�U�斏I����O�OP�3tr"S�
r����h6u�ە-������R{P�l&I��.��sƀ1b=�O�Ջ���d��#	X*���������2\� Ƿ�F�V{���[~K��E4��/ъѐo�4��
��bQa�ŧ*��7�H�~�
�y%j8A�X��>���k

����M<3D+�;�*x[OM�]�.�N7�Ҟ����|�Qg�
+#=e��;Ik����k����� ���4�MqUFVe�+
f
ag�/l��_��(�tr??�<&ܓ {Evgu{��߰	�..��>g6�	�)�������<${��7Ӱ�z�]"�����}zp�;Q�J0�)��Kn�n걠
��V?��-ɣ�4�2Z��DA�0����X��R4��	��r˭B@�-��楠5ʒ���A�ST�t��ց�;����qT�AY3��E�
����",
�����
bY��I�!���[}N~	�t����C���%U(ŵ+�����b��b`:%���O\/��^P^L�}T��Xo�gY����`�	������u��!�*%��v�qo%�	�v�n}��5�� N�����E�
Á�2����栅���5(�70|������v���L���X�ɐ�ew
"ٕF=rH
f�/ 9Lm�� w��������l���½?
bH�mm-(�#�JI{C�ۼ��\uy'��]��P����"�1�ں��}-�i��X� ?�+����b
R�||��Uݜ����-��;��V��2�M\�0�4�#��T�O��0�\_G}�����n���%��Ӡ�3m��@�!�2�,�l��R�$�1��]��V���l�# ���@�F|��L�E}�(S
+�z�i��S�&mB�Lp��9��9�l\s�Y�e��;���t/���WfY
S#�Q����y�̥A
+��
>A�­��߼扅������]�nA�ޫ��s�����v�=�ҵI`�ư�$�N��Θ��67ƕ�^�����KQo)��	���o����
"x��;��O�,�$�e��3�J��"1��;���	�؅���܅
+o4�({cu=�'��U�PP3���\V6�.�,[�[Q�?ݗ��M2��M0%�-�M��e��@:{,:����3M���~y�Lj�IwWt~҇9V+�
����W6��	me*��	�-���ʛW"H&�v#�h�*�:��&Y��!!�H^P�(���\[�TD	qw�BQ́�xc�*r�V�p�0��I��C����1,¤3��w�p��]��Sd0I�0�=�P{\������$�}�h��R�_)$q�!cd��nh�ڮ�qP
�"������8Z\�hVG��,{�i2EηN:eqw�)4�y�i��?��
��^�Ӆ�v��G>k���w&��j.�[���Mm,�}�W�Y�����z����v�`��$AV/ŧ��)]
o֎{H�J�	.�궊`��E�V����F"��7����}��֛U����X
0�SloXy�)���W���/�y�v��/y����PkȬ
z_9��o̱s��t��ofyb
+?�6����r�Z^�ѵ)Ӫ:Cep�u���c<�t�75������i�G�H��{���܂��7�0�
�	;��g���̣��'��&��8��Đ;�[n��1�:���Q
山�Q��6G�M!6���@Ji����d�٢Mi(э'���r����m?ȔIO��C�9��RW����U�������V�̵���̜��“�y��D����e
V���esV���v
$
�س �3~�U�
t�:�P��V.P��I�
m
1��	t�s��"���K�;|[V��X�K16�o����u0��{wR/Η��j����> r��󶜙��k�F����Q�7
��έY��>��L����b^b���QHW�)�p��&Ҟy��� ;�%�;�P`C��s�F����
����
hڢ��].����nG���+�!�Ғ‰EZ���ɩ�9x%k��U�"�h.K���H;'�`8FW�&��Z�C��E
�lԥK�9|�[&��u3'�ӯ�?��o��Bh؊f(�i�|� [...]
�Q'~TP[����_��oĶc\�ƅ��f�>��,���v}��J󏤎Jy����ke�󢆊Z����["��!�'���/n�?3�9@�צ��2?*r&k<���
6�4��]
�lo`��.�9l�T �����pD�
�טY�dd��*�y�G����.$
�Bg3*�d�V�_3�!2}^�T/gx_����o�3�8:i�
�ص�BB9�6���?�B~U�$�Ѯ��L�3
���4P�u�?3=r!�W���!ON��U|^W�RS��P��؁�
+T٬K]j�
�gwrR���ƛ����^19����G���
�uk�
��}N�HG�M
���
+x봡�Ɵ��o��B�E4�!LڌtQ�|�z�����<Ҏ99��
+��D*n�SZM�^��
 ���|::��/���K���?
+��E�W��oJᒝ!�K�aK��;~z����#+�A�v��r�C��X$�/|�ǖ
f��N($�R�/id��R
ͥ�;����:0/�.x�Q��M} �� �,Zq/�m�2���l��$����R��0
��i�נ|�
��2��J#5*�RI�yc�d����i!��q��c�{���'��Ć�2��E8(�w�І�X����҈�QS���
���p�ހ�9;�o���N�rv��=���i

+�R��vCK&
�J#U�t�ڒitT<&i�,�隰a�'����O
+�
���'�� ���fz1��
��
Zn
:b�������W�⒀4�Z�u��
�)W��
J��{�kf6��I���/
zdr����Q:ٵD�ڲ�]ev�(�
���T����?ӇӺ�O�6����W����I��N�L�Q�v;�M��j�I�aӡ2��p at 9�4��t8��(���^R�yfĩ���ZQ
�G��
-�F:�u=c󰪏��Ei�'
�@�P{
~��N|j��|9�d>�&F
�79��h/�ȵ�OOR�&�%�*e���C�=T�����Y����+�Ӝ��P�c���N�*�_�i^�Ó��@!m��CJ@�tfߟH^t���j����J/d�����h|M�K$��+�J���W�%!���f4�,\��1
&��}p&W��e��K�#nYa��JR5�B�����W�6��>����|��)��y
���/X���pm��δt[�[����l���}NM���_�T`s۾���\��
/�g[���ֶ��{��UB��܍&��l���kB[�s�U]wL̂�W7M�z�J�O4{��t38��G& ?.��	�.�nI��Q�^x<�
+"��P�]#!�D��@�_�v�c{�S�
+�!}{j���Xz�
���~�l���r�n�&~�d��*���r�<ga!��|	��4l�*�Bpb{z�`˩=S1�
�����
v��5�W>��Q���CZ^����TP���.m����O7��
9�Y$pA�v;��9U�i�;���j16��)4�:A��Q"�x#w/�Q �j>���<��3*�N���{�����'����I�c/o����A�.G���
���(��~��+�M[H�K��y��
�G)�	jq�;�
z
tk2}�=��������U(
��+|�����!�k��� *�#CnT�7�_R�h�OXy=���X
+�(	��*�?0ëN��E_B�M<E
�Go˃��
�*��z���Z�r0�٦��0��lz��c
2g��]��w2YU�_�32���S���3�2ܺ_ nB��U3�p�]H�A���>�u���+~!Y ��N��>�8`��BR=XF�+�j.�º��i��h���}n�I��LIH��9��~�
+��4�Coz�Sdj�����(��g�|�,q�6ecu��D�3���ڌ�?T?5�V���s��m�pB��;F?(\��$d�DBJ*��r������r���֯һ�K"W���yku)�hY"۵�[�ҟ`?�{��<�0�G�Y�>��s���V�$sp��}|����Bbo�����V��_rg��x�7�,�ۦ2m�!F����k7�ʗ�DC�ޕ�̹�q�DZ���
�Br�]+��+Xrx���sׂ���*B��'5�r�欢�ϖ\!��.��?�QsG���������Y�=��tT!r���
+|�n��z��)
@��3^b�Y��)��P�S��g�aP5�^Co��n������5�����M��s�dȣB�q�泯#*ғ��/�:g(�WQJ	�t��������o�IOw�u�c��9*�J
"k*I�5L�G^H��YU(GX)+�U�k��w���6��hiaJ�vL��k�A�Φ,r���FxG��	�",'
�\m�^����e at U7Q�9��QmO�g��w&V��i����5�H���*���������h
��O�X���G"��z����_��X�fz�tY�זK��Rf�Z��1J0�㫼�B���ZX'���Q�����v�A����؞q�	9��d�m
x�9��Z2�`��f��9�p�6�@xr�n��?5+F$E
D5@�H����;O�����2P�H���e,�"S�o~,���@>��y���
�g�����J SML
@9���I��e�Gʩ5����"
Y,�RB���os�\W�@]�������ã)	w>��U,�O��
,Y
��Nx��Y0�{ⓈQX��U���_
m�Ų��u*��'DJ���CɝR>$"~cB��g�z�O�������^[9kb'ⱒ����,��I��0A��Et�s��&V3ȯ_\�x�M�_b��=b@�]R毽H�F���v�x9�	�y���dD�NM���uj�
�li�~��cW8ؗ�v��^,
��T�&��b�Ϳeʈ�oK�?�#
�q���Ľe�"z��~*K��]�j�Ы�Ph'ך"�I����'p$=t,e�D틺��	}���g�)����n�k�^̓��#��#;�7��x�<$�h3�\�����D��"Œ��$�(84I�M׷�MC��Ёe|{�6=lX�)J�p���6����.4뿝e�7+O�N�=� ��+���K���
��<����5����[������� ?^��a���WT��9
�k8Am�f��
��M�� ����_v�K�'�Y����r>�G��]
����WI���u�m;KPD�	�@s>mp
+endstream
+endobj
+3474 0 obj <<
+/Type /FontDescriptor
+/FontName /NQXOMN+NimbusMonL-Regu
+/Flags 4
+/FontBBox [-12 -237 650 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle 0
+/StemV 41
+/XHeight 426
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/X/Y/Z/a/ampersand/b/bracketleft/bracketright/c/colon/comma/d/e/equal/exclam/f/five/g/greater/h/hyphen/i/j/k/l/less/m/n/numbersign/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteleft/quoteright/r/s/semicolon/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3473 0 R
+>> endobj
+3475 0 obj <<
+/Length1 1630
+/Length2 8179
+/Length3 0
+/Length 9013      
+/Filter /FlateDecode
+>>
+stream
+xڭTeX��%����Ρ���AA``�!f IIQ���I������>�w������u��1s�Ϻ׺W��yh�t��VN�`'(
���%Ѐ8Z��ԝ�j@
�������30Ⱥ�-�'��
,0[��  �[XX� ����
+�����u
Y����e������	��@���`'gG0�H���p[0�� �jj+k(�5��`(�������
+���00
������ r�ZA~��x䒆, 0g0�~
;����`WG
��
�� 6�P��
�N ��f���G��ӟ��]�
=
�G2-'
r�8��Y����nk��y�N֏�VN ��-��
i
Q�
+����sY�V�����c�G2gWȟ2�`�Ϳ*`��m,\�
�0�#�#�����O���������O���� ����
��<�9A���6(:��eQ�Z;����[�9�s����ay,���	��	�[�sj8�S��o*s��D�H��?"��Oܿk�?.���>��Z���A���q�zd ���@
���q�p�~k\���+�����o��h������;�
�x
�4��Q 7�_fL�l���l��3�cׇZ�]
 P������7L������/
��{��r�)�SFA]Cل�߽�<�
7���
�wCu'�
~���8�x�@
^A�� @�����d�C���������������߿N�������~o�.�j��l�4��An�������M���g����`�ܴH4�.%=^M��7,�����i_�sq�^A����7)�V���o�B8�GD�<�m;��Ta]� r`���ϥ�c������"ȶ
�iV���c�}0���d"�e��:��cVt�B9������ş�=ϟ�����(�6���
�:{�1~�✩g�����r�Or��h4Q
b��m�����i
�
��]�cUT;��)�N§�8��q�t�7�t߻@���v$
���o�zॺ�D<������
+
,#]�\G_i�.m��
+�\"щ�J��UacsRHY
+O��I��DӴv[2���ǒ�;�?{%W��:–Lс�zo�����G������t	��
�S5���X'���wo����Oi�s����
�#F ^,���,�/�Ҽ��(���l�U�xrM>���~�8<�@0mxz�����kx�a`B
AS�~�b���E���>RcG�dݓ�%"�v���5��z�H̟M\l���ƫ��LƤԌ̒z�iou:(,�'
�TP��]r�kXQZ��8�ƀ�_��
+7�1�XO����vz�D�����Կo�Hm0�ih��ç- l9�ŏ5�q ,LҾ�l�uP[~.BN�k�噁�YΚ
K��9"0`��ڍ`����O�w 
�TG��-���N�ѻ,�Z_a��J�5�ƹ��8�/���k<t1h�b�Tָ������Yư��z�"���b|ʆ�K�aZ
+�ޭ�j�6H�<�@/�^�o����OL��Y�7�1�
+#
��Q�,���B
��+��6�}�N�Jrg�j|��b��p�V�6��JP%�]�3��cI���Xg��U�ї_ ,��HkMO{Tt6QE��K柱�O/��K�?�
��,���X�	�hM
��Y��(�m�M��u�
���4����
+Y�3k?�N�f�AR��'���p�l����b�YE[�]�#)i�>�t%$Dnva�#YQ)~��R�ݨ�\�����jkl_�����e��o
�|�w�LssEd�/HB
{T�7��%n򳶡c��*�R��F��
X�\yƣ����ٓ0~�):�
؈K���r��Y"�Z���u�Q N��s]s�4�U2�
�A��~�p�ժ'���q� ���7(�)����1i�ЇF�.F+�
}&l�q���{O�
�F"B���K��sn���fn�3]�!�#G��j)q��'��@
+L�����т�Bj��]�'n�%34�_
S=��F?6��[c���4L��\��)֋n�<� �Q]ZP"&�
�)�/7�v�
 ;N�����E2.��0�ٸ;+3�тȪڀ[?
�
غ�X��d���>C�	xK�1�8f����Km~y跿�WN)L䢏zݙg �%�]�����?���Y2c�nL,؅{�h��
����Su�O�"*� �yU��U#M ��4�}��Q�`J��H�\���8~�W� �E��
SgD��⃄�UT:���3�
[2�n/���
+H���MԹ3o��2��pB���Ũ���H��/t����g֑geծ�K"f��&�������
3��c��G�%i�����ޱ6�J'����th��{�{�Nfe��0�(�P����z�k=�uw&�7Q�0��Չ�T���>�G��#z�h�e�P�6^���b�J
�	����W#ShRB��E6� 0��o�.c�_�ݨVQ�W�\R�<����"�vr�Riv%s
+JiwC&5����wd��~,�ް������Έ��mQV��N{��i����f�@T�VT��!�\��/���JޘX����Di�n�C�.4;��3ԍ�`��,��St��>-W4p���
+_��Dt
4m��

�S�<�����M�T�,�;���g't�p�0�E�nj��H[�&�V �������h&���Js�N|�Z��b�۠����-{
+�d��J��g˥��܆57H���y
v7Q^LuW��_�R��tHV1o����'om����ʗ�z)V>1�Lb�W�FV(�� C���5e*��iL�� `��ӹt��{��H��{�畼sC1��f"\
�ѽ�w�ݻ�$T�؃�R5��	�ﺍ�.��%=Xa�Ph)7�\nen�@��k6]U�xD��uv��O�l����*/D�v�Dh��5��!��'���
��,C-7�����A^
���ن$pk��U:�$6��CB/�ƿ�
�_��f���}� r,�b%0�G!c2b�L
�wBD9\���!�����"o�)6����@o�XXb���C�Ap3��Q�
��l-z�{�
�ƍ�ucC&�I�J&���)̍U�p��7b�r7Z��(���TH�#)q��d�>Xt��Y0��ނ�<R'���a�W���;�ӂ��
Nn`z|��5�Û5r~b�ہ�M
��!�i��R9�
�l>�;n1
+��)��"�{�>V��誗�>��9��*u����7Z�Ɯ�&ꙋ��ģY��N澽`^�L:n�ɽ������JszV���D=ԋT1:�Z�o�	m��7h_�L�`������;p���tY
+3��I�:[k�|���R�0וl��������b��y��R(!Y����P+���zp_Ȍ�<�&xO�ڸ��').�_ �ӌH�% �U�FU����Կl�8�I���� /���(��^��
����^�~��GH�p�y6�:�0T���6���'��ņ��ŰS�U4�o��|$jNm���<�c;�[�	
)
���[�
�J���
��ai�%#ñ�Ȝ��X
&
c��K0���lH'�ψ��3�e��S‚pl��<�
�C�[
<��S_lH(~zع�=9o��uGl�E-s��j��L�<�~槎�j�k�Y�������O�����{$�ϳ�
=u$���.^,��8vj��+hE���z
�3
��o��$��	г�6�g^R�4b���|\�7{B>��
˔��Q|9�4�1�A��S��HY^󶛣�/�%���v�q�6o�NJ^p
+���~j��P2�&%>

������P�P��҂����SC�UN���Ţw7��B�y���*hDt�
+
,�Q�&��\ �V��4����IF?3�^�K�7���[����4=�^�TmQ�]���$�P��Q[|�ܫ�A�w�#*����P_5�?��V^�i.q�O�U3�V��S�+N�L�
+.��u�P݈u��B���W�,�'������gV)�>z���^�$��'��p�HΠ�
`6pN�N_�u�
+%~Փ>�%�O�AT����I/�L�ᤇ���V*�-�������S�ƾ
O�pÐ��K�ۧ~�k���~��
J��B32#��vLB����ˉ~>�<U�$�� ��hFC�ћ�ςEG������o�C�%-��t,$���UϕR:��]��R� ��G��ի�& l��6�<�X�f"p��/"��b4�WO
���[Ό
�7&d�.j���/��z��7� 5P
+�,~��}�g�J�;�7Aj��'
��tmʽ���:���h�O�j
0���e�LR�3�-��D��{Ӱ�)�+,��JzA$�
&����QҖyt9�^?����$m&`cg�q��z�$�O�O�E
+�
��Vvm��
���|���B'�/���E'*��%ʿR�i�aq���XdV��#zՠ0n�b7��1Y��R���l_bahf%�
����mџ��h�b��o��@�����9�KM�>΀9��\烅�<�A�7���NKp�Lqv8
���NKw����a��ή �܋�8Xz'l���j�'��f�Kt<�D�y
bJӏ�~�s�FN�L����-K%�'Lj�
+�-�6�(�s�C��2��˨g���|J}�փݖ�e9M`�w�r+/�!x�c�R��zT
�x#A���4=�i�
\�d�������\COcjZR��ޠ�o�c~��m�>���
�� ��B}
ݧż�� 	'*Kڱ8+$eM�tS���sHM�N2r�S�:٢ഞ�ho.
}bl���\�h��i�އ��Q��������ox$���/�tjH����i�(��n�TN�o�Q]ZΙ�s�#e���C��P�ϙ̶T��S�Xt7٨p�#��"D��I^�+\̨�i~�r��E`"��a?[$T	�)�h&�x'�Eб~�"߾��Z
vK��]�<%���IVN��ش� 9��_\��qȲ83�H�-�i�G%�U�u�e�kD�鼾�?
S�����̖�a/��e�b��i����Ɋ!��m��A
�ҭ`w��<㽽�bf*��Э�,��ł"k�Z�`�d��eM
+���Oy��Gjz]���),ۊ٘J����:z/�>OO]�ڋ�tSy��=
�K~�`Hx>�=E;0IuV
�
�W^���|�
+g���
+)ֽu+�ٯʼ�}��Ke�ײ�,�S?f�Գt�;1��4�"�ߝ�/&$��B�V�C�����ig�Ɗ��
/�3b�@{)ˉ�
���o����k����j�/���*��G
+�M�f��7/8�vQ���)��$�W�:�5�@�{���G
��a�7�1)�1U?Md,>}X�5IoPA}����u9����B{5�,�h��� �D�TC�k���s���1dW
ò������P��[��͖�5�q�YZ�L��@�C���&�Z�!��I��.1M�1�}۳�A�tl�kd
|4�+��Ƚ��;�
kq��
J†
t<�:� 7��b����󣱨A
�k�Dž��V�6�����d��eu�s�l�+���S��?��
�G|��9�V���.2*[
a�L�{�4F<��
6>*?^�c+�v���e6��6��
�d@!���W���
�ج,��B�3��:�lh�����C5W��@���k��
������%�ߦ��d���
�ek�ճ�3��qD�cdZ�R jςoD�
+S~��m�?�DqY�?F5�S.�%��R�X���}�{��D%)����@�,f|�
��Q�Ud���+K�
u��x��F���A�U>�����H��K2>���j�<o�Lۀ���
�EJ�z��s�F���!��w.<�蜻>�{�����'����=�[�+��v�o/
`�����k��D��g����.�r�\��A�J{�
9��x�=fA�=�M��_����vPs�&n6��f��=��A�_�V��tu*Xa1�4�s�^�GaG�w�i\j���*HKᩏ���}�p6��9
֊�no�R�n+j��gxo��.D
+v1EE��������67��3
��/6��Fi�vT
�|/������"qO��(Wv���
���~:��|/��$l����	#˅�u�Y$^g�r�
�դ�^Q��}��'�������]j���^���{�_���iD4m0��9�
Ţ�U�ȟ�P���~1�J�{�oە���|�ބ
�l���n��S���%�
+� Y��޺�t`�Y�q����������
+Z~���	0���ɘ�y.ه��J+�[.
���L���9���>o�	v�"���7�
:v�0�Б}CGi܅�ѭ:�h&�@tԛ�v-�i�1^������>�>M5�n�����1
+"2
���>q�r�;�
x3^��V)�u*-���V�a������!�-���ű�� s�\wv6�5�{���
�>!o���� ᴃ3�d�{w�!�ǻ,�
���<���k�u�z��w�ϔ�a�rQl� �z���7\
H�Y~<\��9�G��y82���j���#����W.�&�"���흖xc�lj��V"*�o}x���$�v܎=�b����W'A�7}�Boٍ�ɦI�"g�Q�=�,	" V�M�d�UA���&���dS1v=����-�E��
�x0��
�y���>M�����˹:�	?+N'�U��y�]�2�C?�
�Ƽ�G��
������Q�?�1dž��T�r�Έ'�s3&��-.&J��b:cb�o:�(�N�|s:7��<��q�
7iJtN��F�9"PPUn�n��ۏ�@m��a��:<�
+-%2N��e�u�R2*��ݖ�`;�:�y�⺢��Ӓt��޲
ȃ/_�x:�`��ň�?�R��핕�&���D�\
���n�
|�_��A'�Yc�dީ�$�ի���KJ�0#aTu�No��ZP
Q�
ُ�I
�h�{�PeF�nOת�jEw\��n��N�
{��
-G
+�Rbk*�^>{�U  �6i�I���W��}���[��?���lA����+A�*�%L�
ږ�!�Z�����PIe��/Uݸ�t�a~tds���L?�/��kA#�zw^�b at f2�<��ˉ���m�y�!��C�Վċ���cZi�3��o�֩�܄~�
+ϷcQ:����y�������:aQ�z���P�
aP/S�
+
+a���ֵ-G���M��ԏ��8
a;2×\��}]�X�y��N
+���ڏ;Wφ#ځ�
+b
���-��#m
���S��~c;G�'q]����'c�	=�D��t	q��#���\�h�i������;%
+�F
�N��Z&�b��@�$�S�3
E�k���3���ó9���t�7I���cp�5�<�D�
l<:�?�
A�θ�b��ro�
F�1 �/�{<G��
����f'v
�a�g�2��O��S�,W	���C0[�ڠ�����֩y4�V[�Q��H���_Ec�
+��@��
�$S�x� �S�E&;A��,o�ڗ��5W(����ܹ)�j#����E����bßf�6�R�9n�ZE�,�8��K�Z�iڍ˯4��J_��>��yT��K+l��G�
�ۭg��b�\g��,�R���WPi��@�+�
�.�c�$}AF�&�ܬ�
�xh�A��|�.y�Li���=��*��Q ؞
+���g�B�P6��d�Qf~9*���7��O�{c0�C�5���|2:\Ҧ�1�F1kP��gkΩi
a�,�d�VL�'Wi`�r��#ד/uj9'A���hV����ҵ�O���.�ş���e�}fc�?���!�����F-�Up^���Ӕ�U��m�V�ISăڑ�i]
��[c,]�t��>*� o��<��0PW�g�
nl�ױp�����U��Γ��8l$,��
�<m�;���̉�'�e(+����9�c�����	��&��m�}|5��kI��sdQ�N�����ĜlS��!��ᵰT'}EG��
+c�*��8x�
O�L�n1���D9?�pB��P���4o�yR| n.����6lk����x?�0>zPR0�6�q��S��|eV��*u$"�2��1q������>�@�S��$��;�M��(���HE�T��9��}�/j}��%��G��ۡ1{>��7�S]�5-?;���hC�����T��^4wb���&M��O���xM�L��dc�&�����8ړ/L�*}���?B�+�ù���הCYţN�K�����m����w'�k��6$��j��8�<om
���%�8}Ӽ|;6F"ʼn��,
���=6e����"�
Դ��KjC���R�
�`�`v��3����ЋJ�|9�q`&r�n�/#��1�n
;�����<�I�}5[��
o��*۞�g5�����f 58C6��q*]�&��ǫ��ʤ-�����S賠�Η�H��N�-pAO�5�>��Iѻ��F���4�R_�b��L�c�Dh�8l\z��'����&��˳�T|���0�7���
%$ [...]
+��VG��ؙ�| ���
�F1y��}���%���!�ͨ��̆
�f���v����d������-a�Ԋ��-�4��_��_AŨ��2����UR�
#�
��_7wQU�1%p
�`��ʎ�3:��{l({q�#�!s�#�]�8�l "{� �
]���.G�� ��Eo�_I�t�m�&��9-�S�ף�z�ў`:0ܗA	�u[@_$k�09��PT X69�ҧku����<�G$.�S�
a�ȁ����Zޥ�g�u��1��-`������>�"��[
͘v2$V^�	��H�!D+u���>��4�r�O�O����g�)*��Y�b��흡�>���Zg���"J	z�gD�����eL���� ���j�& �B�.��KVm��a��
�~��oߣ��
��'��ҋm��#��N��'�����m'|3�t}gY1TC�a7D�XT`a0jb.��9+���|�RV��r���L6��&I)T�J��r�mV߰<d��[
·U>rP�7�Jq�*а�=�_�;>Z�O�:㋪���a�p ��/

>k
+endstream
+endobj
+3476 0 obj <<
+/Type /FontDescriptor
+/FontName /BFMNIZ+NimbusMonL-ReguObli
+/Flags 4
+/FontBBox [-61 -237 774 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle -12
+/StemV 43
+/XHeight 426
+/CharSet (/a/b/c/colon/d/e/f/g/h/hyphen/i/l/m/n/o/p/period/plus/quoteright/r/s/t/u/underscore/v/w/x/y/z/zero)
+/FontFile 3475 0 R
+>> endobj
+3477 0 obj <<
+/Length1 1625
+/Length2 12128
+/Length3 0
+/Length 12969     
+/Filter /FlateDecode
+>>
+stream
+xڭveT�]�%��!h����www
+�B
+w���]��Kp���܇��t��o��L����{����#������� l2J���
,�̼ +;gUc{9���(��
�p QP�:��V {1c0��	4�M�� 


$
+�(������
�VWѤ����/�_��� �7��,����@[��
�
�N��|Q�-� s+[ @TQI[ZA@-������mJ.&�V� 9+S��3�`r��� 0}���ojΌ�\�� c�����������8 �쬜�߿V� 
'c{�{
� �������_�vs�?�
�@�
v��;���l�d� �GU���N��1�olg�w 2�4���M���
[�;�@w��X&@��������{�w2'�d�8[�[��z���������N����:��'���������۠��S��hkΈ���
��
���
���Hۛ� ,�����8��
+t��@�g��]�����`4GbR ��C��ߺ��?������4�������
�����=�;��������� �k� ޷�3@�w� �.������[�vV�
�ͽw��K�_�Ǥ�����xo
+3#�V�V�@3%+��%�����Z���ߕ8�Z�߻�OA
,�����YZ����-?ǿ ����7���G7������&��[��Tz����û����<��?yDD@� /6
 3��}��pq��7!��a����1���
���73�?��������F��d�whT���f�s���������{{�y��Y�����݁�H��A�|_�S3��5�9?��t�zX�;�ԫ��W���R�6x*���36L�z�
9������|���N�������c�R�s��2���
kFy��ʭ��p2k�n�+�?�}�lgsB8���'s���&�u@�5M����@o���)8:�L8����1�}	ۻCH�
�H�g��t�9�a�t]o�
+���){u
؆�XA�Pe��t���Z�� �����P���P�j�ě���uKB��J;�l ��&e�@�^^�*��?������DxPn��ƌ�$�v�
� ��ǚE���Q@��7�I��l:��4���wiK�oH��)iUQ�Q.Փ�ri���l�͂(S�M��o��A�G!T��>�4�����I
r��|q��n"�j�VAo�-KrN�X��M�W9��� Rz7���3�]m�,p%��b�F�j����n��C?V���L�^� ���G��p9g̬D#}

C��Ē���}��{����Er!�Rk��,�O;#.���h���
kM�vjŬ�%NW�G�+�q�rT�
+&
�q=������Hco��a�aF�
*�y�T����,]e

��
�[�De���j����"7���k2
���O�]�[���5�?�S��b��Ҕ��U
?S��T�Q�b����^�s;�3�!��b����*a��<��W�T
p|mp����^���
{�d
ڶ
��X���EY��'�8H�����15����B���'����p.����+{
+ñ��q�3eڄ���
#\Z(�T�Ḛ�<����~"���d�$G�t�e\4�C�C�I�X�b
��F}/���Y˩sa
y��_Jv�@g��!��T�;!��-���<&
�;`��

�
Z�:�[�M�ڐa�w7�9@\�Z�����2%
D��������x������
��x#� �)[P����GG��ش�'<�lZ
(
�Va�!=��CT���$��ty���_7���Q����9HrCwp�Nmt*2p4�
#��
A\���BF��uf��N'|�]g��+
�<�
.��<-���̞c���[�y�c�����CD�?f at b�
�r�r�SKZщ��Օ�'�B�gw�&r!aFN*�H}��f
x7����i�4�Rb*�m�ӆ$�t*�����^�O�]��
�������Ȁ(��"&I�U?9��6�J\�[o��S�ǫ(*@"�v�p�ͯ+�1�KP*ʥ�G
"���L��:S��Յ�i$����������7'Yl@{�!!������b4�d=��(��F"$��W̲�
c	�r36��!��ʁ���:b�D3�yb�g���t �
����Ey�Tcش1
ʅ��)f.�x�w&���Hz�vx��-4��q�fײ�&�3?
2\���8Z^~|�I��5+`�����M�!$D�T�Ҧ9W� ��_9�(<ar!c��
��h/$G��7��G�o
=�����`	a@>"\�g@��J��N��|T
+����݁�ِ�Ә���"B ���
��\,W_. ?�*
+�dƖ)�����p��9)'C�pQo�}N�k��@��(����_�2���n�;�fF����F�l��U�g�ܹJ ���섦.k�_�kX�|���7�Lw�=�|6�T�o�}�e̒���%�}7�+$���tH�!Z�-`tN��v6�*q+@�q1Dނz���ۊ��U�ݑ�"
tD젡y&�{���d3u�����f�L�����H=�S21��Q+���7���4�����'��T��I
���	O�a�����93�?e`|���V}Q��=�W\G¨�zb l�r��Gω�=
�!�%�Ƌ��@���i��TPU�㠠�\�þդ{��]C���[`u)G6�yf�@���c\���$�D,v�ɪ8���X
�?����2�[`���F���t�YrVJ��S��̘�h~���Qq���_�Ĕ�%&������8>��.�T��H������������u��:s�7�
�T
%뇾��D�Ș��`���O���Z's5��M�Ozo��y���RA�
+;
R�
�[8�X��B�B���Њ�;U�\IUylJ�k��M�d��^�/�s��q�l}(	YLKv�D;NW׉<�a$�*�Л|;-�� �b6�������h>�vwl'Y,�C`*3hg}���;?�9�A��
��t 
�UuEl
Ŵ[�8�����\=�Y�F$�͵rE�~��r���)q�Ҍ; �����R��@�+E�ݑ*cI��%�b�����l�
+��n�ډ��_TOD�X�;+�i���E|�.��?H�K���Z�w&Jt��G�D��p��!�K>2^:�����9B��C�X��Hqe��;8�:�<u���~�dBRr���T�q�8���r�	e��[�ChRo#�Ƽ���ɹ�[�W虙��#
M�� P�N�0�2�Cjz����AN<A�
;��F��FR�R��7)ɇf�YG�/
����i�*Ԭ]ihT3�<����u�F9����[[��Q��P�{R
]�:=�uP�_B�I��
m\��:�ܷ��Qt*����d"I5
y9�9��W(Pu�����)\<�P���x
7���,<t������x5AM������u���t5��K3׭/+��E��oA������VK�9fp��J��J�T�B�����Y��R�/YAW;Ԛhc���*�%��04D�.<r�čA����)�y�r��ח0
�{�LW���W6���U�q�ƙ�=�7�v�֊��"�؛k�c��$���Q�P+̼�� [...]
˔x�	�i�)^��E�5�s��$�?�r��B�un[����
z���§��\)�� �&5�NON�������h���ԭ�\Нv�*�*q{�PU�M��Cl0w����<�KY��
�f�ϜCJBvOt���Hw;,s<�v�.W�Rê���w /�'��W¹�4V
���M{���p 
	a\^��+Y��|�iȹȰDz�1��XJ�fg�ꂏZ�嘺d�R<�;k��g=���Y$ᑆ�>۠�&��c�b���0��4E:��:�(�N���p�PW���ixg1Ѳ��
Ghf�!R��F4�׼
�5��R8ϵ[q�oyӎ�Pe©%���ͩ��Y�v�V���G?;�I{m�g��dk��lWǿb��ǖm}�A��N]4{��ϋ��������r5ti`:��)ր�?}��7��$��$��,��+��yr,��GbJ���9����>cX`'"Sȑ;Ƚ�/��/]���3�z+����՛�{�t�O��`�r�v���d����o��i�hT	��r�5���C� [...]
+˘�?Y��ܯVFbl����]+(���BCs�>��q�=����W$Ze�?�2m������q�o������
��Ѝ+&A7�>6.�s4U#�F0r�0ˉHjn��<Lh�rxf�*�3�#

��•4vh�f
`���z�aV
+��/C��"��3G�݉����}���\GS�0Q5��vQ}>��5��]/�N��pO��B>L�(9���ᆝ[R�@xo���!U�F7�^ ����C���݈L|*��)
4�(x�P��ή�Ĉ�%6Z���r�Q�?���6�M}��q���t����GE�ۻb��S���vH7����~��%�<i'���
���4^T����|j�(�FIJ��,f��V�D7-�	�
O����ˮ+���^���
Fw[��EU
+�cc# ��4ej'_�{A�vl�dq��2DD�up��"����禘�4���d��u~Q?Cu=��n�N"-���m�#h�:+=|nɟj��L�o���;�
�:1혐�r��,�vucv�	��(��L�#\=��x�[d����X�����넶6<'L*��t@>NI�j �)��.}��N�Z̪E�
��#s����=�q(�
Xe��w��WYX�.�z���㒌�#����:���Ď�
�=�+X',c�"6�n2���I	��(K�Y�[H���TE��֌���aڨ��0��V�s��g�	��
�]��c�{�]/l��������;��x�v�3�ez�tu��(���-�&���x{}]
� �.���h�ZC�C��5�cy��r�՝�H��I��ߵw��:[HYe~����I�Og[����0�T���6o�1�L
+ۙ'W�������
G��i8.��ܝ�MK�0���d��N����ȧ�q�fe�fSkW1����l
E��AOo�cc�V�$�0X�P_�f8������>�&B��)�2[$�K�vE�lR���<.��r���x݀A�9X����P��\8L���N���=�
�< |j��a�rV���x�=��܉@��`I5��d�Z{#>���&gx�l�U�mt�/
Cح�p#�5%%�'I�I�Q̚�6�A��Pw���{Hϯ����O��"w��٥�|�i���e�n.
.��-"=2�>q�瘕_�ܥGKG��}>��A��F�fڦi��hX����	Yo
��f�;C�
^<�4IW҇��K;a�m�]���x�����#Iu�Z�*�K�,nR������ v��A�pKX.NZz�a(�X\G
���y��^�ؤ�}��De��)��F���&$��@i!v�r��M`�ש����h��>�$.��F�^���F>��o�`L2��p� ��lmq/s��R",�?�M��4+�X>Lg|ʦ�^�@����氧U<ݫ��+WŦ��Ln�2q�T�U4
�{��Y+���u?f����36 q�����0Z
�Cm{x�~����.+k�S�:{��oG����df��B���#���G�	��0��#�j<�^��V]êY����<���P�(V��
%h?����/8� *�H;�!�S�9�����~�g�����20c7ō
X�H����
SWz.|�Nbk?Vd�
k�Y�<�w?�R����:�.-M}so͙���#N�
(����O�O#A�1�҇
�D��Aݨ-�?��Qn�e��`�3,&�|-�=��;Ymb���%�'"��C����
!��/V� �j{�5_u����=�D$�� �S�Gh�����MG����(�<�k�"x��¾
++n�
�
���~2��MU1С���&'�N"A�<�P�z��ގ�}�U���Z��JL7��y����P0
���w ���@�h�u9	�UO�6�OXi�
+�j��j��_�E���XC]�d�#�v��(;Rf7]�"B�B��|��myg��@�Rdb!{T���,[��: ����+u!����~�ٲR'�S�AK�ّ ����Bp�C�t�	���50<לh|�O&13'x=ޒUuՎ�����-{f
�遹���p��Ѫ��5fˋ
x����1������A�����Y3%0"�8�.C,�0���J<����\Wo϶��>-��D6�Y�6�L��[�Z$p�y��k��	:xzŪĈu]�qYd�jY,�s�eZ[�/-
?�62����2���~�
ݥ$b~��-�
�
��9�Ln�
~p4T�E��a_��m]��N�pt�l�{T=yl�f}>z�*�y���	e�غ�ez��,+���:
��tթ���k�8�L8Z�bq�Co�m�|�Ђ���1���"��v|�u�٫>�t�>Ԭ��
`��e\C4Vѧ�`��ࠊ
n��O	�_�W�"�
�]J��//Y�g��5��-
Uqf|L����F�<2	+�C(��n�*e�
�LW#b1���
X��Fī�
z�k�3��n\SK'��c)��hP��ʼ?�����8�F�-N릳vz�,u:��im��W��z9Y�����︄�	��U��LjN0.J�
8��_�����(L9;)*���-oNU�:��vdB>Gj,�|��)h+΂��pOt�8j�E����k@�A��G
!������7�'{�����v�M��n�R�~k��;U
�
� ���
H���s������
+�^���"�?�w�\,�5C3�EkkF�9
+�Y��D�����	��:�I�d!���%���f��@Ժ�	fʔ��V3�Ԓ�[��a|�n��o���0>F3.���-�V��� ��1����٫�i�������!��Wf�t���2�=�u
|(����Qp6�Ǚ���D��c�[�����R;WN+X��t	�H���e
�������}7N�$�T�k�4dz��K'����~�U�.
e-�Z�(����%ux���|�
W�Yp9�)�a&d�R��M�$3WHv9�wUi�Z-������PT�֓��R���(R��=�<
~�?���D��Ŭ�t���(�-��d�/=>�;
���U
��m�O��eT�1ȴ	Nw؛^�����OC���.��Rs�پ<y���l�~Z1��@G�4�6&'Ĭx�,¡��e
+���
�]�+��(��#FVy�?Ơ�x�(�n��8I
�	����� ��U�p��?����v�Y�����1�h�K���RǍƞ"�tp�"��
���2�L���2924�NaNP����x'��bv�)l���}"��;�}�n�2�}w�:��Ɩ�:����N&����4
��Y.�
� C]vB� x�3j�u&�;���4{�-����f�AjCa5^%�TLP��t��Pf2
+S��V%^��ɫ'}z+�-qG��rE�s��z!I,0k
�0�k#��pʠt��n���C�M��ɋͦP����5!�B�)��D��Tq$��k���#�����Z��=o)
�Z�<P��\L�ܯ�!���m�qg}��r��P=w���FU�w
��ّ_�bGvP
�y���׶�YO-&�{.G3R�H���%�Bp"/��;b&rPʘ�����dx{ީ[�/
R�1���	��Ԫ�ٯk�{pڬ��rKD4�����n�P��
�!�FY�X�[0g#g\�µ
�(ث�+r���M�Q
�Q�%*�<E
+�?���)�Ili�㳹����'Z'o�Ę�2������m\
8@�
y�Y�Ֆ~R��"��b/��ֻ����r%n����ȭA�\�mEۇP�����!��ˠK�����?���v���l��Ċ�j��G�
b?PW�"s8�����G�Ӣ��ӝ�k\h��3�+���E�'�0�_!^�}Ȱ	� @|�AIC	�8�J|�IJ|K$C��;�Q(8�C�Q����y��&�,#Oœ]��xF�(L�4c�6�����_A=I=����~s6Y�i�t
߃�u
m8K
4!~5Z����/�A�k�z�Fq���`��r�	$�"s��C]Lb(��H��o
o��f�
d�M��G���~C�� ��ῖ��E�QL�C=ـ��ڀ�F3
vmpKA���M7�J����
�q�Qh$f9&��� ��|��U��
vB�d��x���V3'_y�Qmv9�,I���R��
��	G�ZK!�M��O��J
x�ͧ��Y�������tD��������q�lj$��M�"��U�C^U�2� cZ��
+��gge�n�����c�o
��ԟ��=]sf��������:H�$2D���/�s�ԑ_��lU9���>��ƹe�*�"P,)�U�!��o7�b�U�O���
<����t��'��>)�.0}w�l0X�7WbA
ķ6�a���SӜ6��j7�@jДn�L���.,�5KՍ.	Q�@�I�GΗ��؁q�s%>
r�j����o��L���R�Jr�#SĺXc
75:�;�K������q���^�'r��x�?d����

��z�J����\/<6��~���Fd{�q�z�ܳ5fK
���o�/2���x�,�K;��oK���4Թ�=y��
g
�ϰ�q @��B�q
�T����ҳJ�Q�k^�Q�zi&"}�sT��$"k��獌fQ�
+���ce-��L<�{]�n�yA/���,!�@��/7�P��|�xN��8ej]�O�6����?���D��UƩ58�����<�9�Z��Du+]Z�
A>���IT%CW�}�
+���ϪM*�~n����H��%Ч
 G��
[��@
U|��ia�S�#�ɽ�[�0l�+"�Ϊ�
'y
{\#���4�ԇ3T���J�[;��}
�������a;Vz�/mҎ<F����m�?`�/�Be�`��4���
�'��bH�{����8O�A�b]�:FZ[�&� "cćZ}3��
��<�
C�D�'
`��Dдt?�iD���a�cy��M�
'�Ր��uG�ҕ�Y�O����t��V
�6
&��?6<��*o�1Ra?(�~Qj�m���1�G�X��Or�FL�bt\0e��åO
d�F
)����Ƚi�E>��O�0�t�)�S�'upr�m����D�`�l��pezyP���\	p�n�
&U�[�o�
�^��t
})�qK���Tണ��V)�?���xWʢ��+�
ď
����Ld<y4��}Pb�o�G��B�hU���ڲ��u�xk[|4�g1*/-E�P0��b1MnS�����
��}h��|��C��^Z�����)�2�<2m���ҔO?ܖI�ۥE�a 	+B�.�iע�P�
���]z�<�x{h~#�<�b�
s��y����
l&Z�0��x�������9��a{p�K�����+���2�٬*
Z?�Ebl��1'���u�1�=�����#�� �.򭙬zOМ��U��ӓ�+j�wv�&G��2��7&CQ�%�o�Ҭ�q�F����յkW 3h^���,���o\͹�Á&D�''��q��)y�
��4�����p��E�h�h>Td��4~�������
�i��O�-%���.���V��ɽ���li��$��[b�P��
+889�^�cm�0'ʌ��Ih�
_�ht� A���iF�Ձ����d'ЖۆJVl�f���.M�c�p�!뫈>P�ć��&��Jјn��T*�!�\մ,��A%�E�ɷR�5w贤Y=#�ᗩ}Q!���\� 
�����L��̹�=��?�	��U�r�W����,����[VK`
��:��W���9�ێ�ڞ�H���B�s(Α��/���ұ9a7�l�B�n0�8��ɟq
+����E��M�����֊�2�H�9��
;��o0�  W.�Z,4�0�N@/;׫�q�Ґ�b�Ig4i
+���;�8:�pQ�2�	K̐OO��D����9]�qo>:�R���n���
+?4���GY4�Q�
��p�:��]5�"�F��=8 ��H���X��e^͘�"�j�u,����'����8�aA_
��z�Ԃ��9h����Yҗ��,-[���;jEH.�s��$��ƒn�D�j�x�. �r���ij�\��M���օ�p]�Wyb�n\���0՞*]�bQ������E-�<oK��gMf�e�`}�S��
�!�s?��C:؇�x��F��ҍY at Y�k����;��e��,�>����8�VyL	ڱۥ�! ��}�i[�?�����q ��Q�x	��0.} |�����1��T���ʹ	��U&�Іk
��fZ

(�(~I>��)!
>\xÿ�v������MV�ԇ��}��Ug����=�
��bg�^e�z����E
����)��)��[+��Yi�/5(�-
"��^�S��g�I oNT��l�`���y���4z��� lL�oӌ(
I
l����ؚ���}e������o��񘐲��0cچ�
}
�~�QW��c>?~�*�f��ߚNoII�%�3�q�K�RR�ܵ�4�}ҍU��ۗ�)D�M��*P�W>\����#2S5�v��K�
{F�
N�x�dG��#9�J��&�7��-bj�׏�\�?rԗ�f�[�]�`"�\���H��$��Q�ﳪlWjs\q�@�nR��^�@�<��V䂛�%82]S77�g������n�q����OQ
+?'�
{�,p�m��^Y���Q�):B],I��G�Kz������q`�/)A��
D

E�_C$S��d: �G�j����:Z���m��wyE�@�5Qĸѓ�J[2��UcHϨR�ƚKh�
�'2QQ�2y"�V#BE��T�N:D녽�
誱�j�.$S~�4&���/�7�.M3�
+��@�䎵�.ž��J
|i��e�*��@�vxw�"��5(
ƄTl�9�~���Y�R}���C��
k�eL
0��|B�b�XR��

���6�00*�b�}u
 ���'��6m�o�L�i�'�Cޔ�F�J�W͛�k�w�G��t�
�0O�,(f�Tm[�tzߙa��qVH�;5
�����W��
�ݡ�~��E�*`��i�]
�kh�f	_C����˗�M
K}2����+�`�ş�ܟ�y�&�]������Y��Q�^�7�Q�Y�ЫP�
�.�
Yo�
v�˶Pԗ��V\O�d��u���j���t��z��.�A�Z�e
Tq�ٟ/9��aM~�&�fN��-�����6�
Ѩ4��m2;D���l�k龵�]XA;|�����O�m�.��3��&ԶfTxY潲9k��~/
^�b�&
Q4�o�V����h�?���k�B�.���.4
���%	�^�R�'#$Yr�1��z3"�B��2-G���8�\��|�)q	9U��I�P�8V��~��i���h��Ź�ϦZ@(m�?�P'��}v2�
�Y�}��"c����Ah���E�1�!R��gb�7�&W٩]
+��p�-&�	�5�r�Jo������M.K����F����S.�)�Ӄ9�a���U�Z�J���3���{Տ���[��	y����b-D��T���c[('����5·�,
H�/'h�=�my���62
(j/��}�h[0ԋ�b�dp��V9�,�慂�~b��a2o��Q(�V6	���h<
��x��a� 
��D��`�ԕk\
�&2���'� ����mG�t���zҔ)@j�ٛ�'�w���=
+jc
�ػ��$рo��yLP�����Е�M#��1T��u�Bq��g���_q.�5Y"��Y�u8
�bsp��s/ڿ�g)>��l�B�@�qL2:�z�+홀�\k\u
j���12u�C2�$I�-CȈ��$�ӗ�ۥ�
ʧ���0��<�nv3����[
v����Y�

I���?_�!z�4֦������!��H��ˑ)���ddV�a\:�O�iyا�O��
�A(@A���a�ڵj��ܕTl�?�H����)���Aˢ��E��B��z����ʐ��	�8���,Q�
#�B�Gq
�E���y
’���A�F!
��=�h�_F�>�q.���-o��/�B�d;���ئp��

�/u
�ݦ�Cߣ����|JR��r
�4��_�H��T�JI���
���ә���m��fy��V#���.��Z
���E��#�9���7>�	�.�j��9� �P33��H�����$��|�d�/�?sK^Rr�֣�iF�x��E����>�����
+endstream
+endobj
+3478 0 obj <<
+/Type /FontDescriptor
+/FontName /TOEHMW+NimbusSanL-BoldCond
+/Flags 4
+/FontBBox [-139 -307 822 975]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle 0
+/StemV 114
+/XHeight 532
+/CharSet (/A/B/C/D/E/F/G/H/I/L/M/N/O/P/R/S/T/U/V/W/Y/a/b/c/comma/d/e/eight/f/fi/five/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/period/q/quotedblright/quoteright/r/s/seven/six/t/three/two/u/v/w/x/y/z/zero)
+/FontFile 3477 0 R
+>> endobj
+3479 0 obj <<
+/Length1 1641
+/Length2 7390
+/Length3 0
+/Length 8232      
+/Filter /FlateDecode
+>>
+stream
+xڭveX�k�.�V�	E�;��k��!
N��E�Kqww
+�-Z�E
���C����}��ϟ����>s��3���N�L���%c�d	Qprt�r�4���p]���s'�������x���e]! 7���
�
"0�X� `  (**��
�ur�v��غ�^��spp�m������	��8X
< 0'g���#��8P��B �P ��e���`S�xP�8B\��r��A� 5(�����\�� �c��߭���d�  �
C� ^`��o��
qu���� (
`�
+rt{�7' �
s��]�����OAήN�
��#���
v�:�
�j�)�U��-��wn8�8Y?zZ9����{�yD�@PG8�
���;�%`�;�@ޏ�ɜ]��p�C
m����
+��Z� p�#�#�����O��
��
�������5@���57��1'��1�
�����(;Z;��٭ܝ��y@\�\��a,d���XA��x4��
S��g*s��D�H��?"��N�j�_^�����OjwL��8 -�㦁� �w
����]���ʁ���`���߄��� �WɿY���E-�h�
�(��_V(\��҂��m� �����x��u�<���b\@^�`z�P���o�� �V�,�Q�?��(����p����o��yp��v� �o*u'�~s=����
+���DE �@~���������:���0����
�����d�yG�����u9Z=�ܿ
�a�������c��:��~�
��2��K�Hw�%�
�3��"�:�4��V;}H�X����	�n
���=��|���t{����!r�G���ޓ�d��0��k
����h���5��B�����:f�wh4���]1�/�=���.������oI:k
�Xw//X�G�>���lQqd��d��'��'�y[��5���x��^żn'��༮��k>�[)m%-��}�ߥRe��y����	L�.��CI���R��
+�S��>�TW!g��L�<��\�ʯ�1a^�4Zpn�M`e��L���*����sg$��(�6OԒ�M���j�6�@���l٠TN�3��W/uUt��2�6>��@�2������K����Х
�OXV��s���6֢�|���
fl�
�`�&���e��d+�*�皞��4,V�t�W����aΑ/�����e�A���|���jozj&ު^��
J<~�'Y���3���녎���n������,�jTY*BGg]D�]�'h1�*��Q"3���]�H��Ŝ��)q�e�
Y\�-�2K��d
�u�F�V맫���u����H�Ϣ8���6����~� ��8)~^`J���nD��J�Z����z
�ܭM}
�4�Qe���R̚S�����ҩ]��">{������a��
߬��UGM���!��P��Pޟ�F�!3u�
�7��� YJ�H�z\
�X-YLǦ%��
���
�
t,7Gڹ�y~
JL�$�Lz����
���v�]��
A{��Y�e��=G{p�&��uٟ�\*<����&7��|�@��Z�7���R�ܟ����m��زB�o�"�|x�Ӂ'3�s��/��pf}O���`�
+�)��f�%
�طk
�W?�T�`�)v i�(��ύ1f�S9H{���t�_�E&fȽ�x��ZM;~��4��Z+}É���
�"g�Q��P5�V
dȒK�3����C�z�H(4ޝmP�J �)�jzƳ[�S���ݴȅ�&�=X��͎�Mҹp@<2Y\��\��fw	9F�e�@�X7��99E��c˱��;��-e��$mehD�-�=c�&�
Ɩ���(�ŝ!�m��o����Vs�-}��
g�
+2"�}���C1�=ςG��}�
�g��љY����X
�^�1GEN��5��!6�d�d����y�=c��^��lf�D�X��*Ztv����<�B�⽠'�5g��wS
++
)tϐ��>ao6�*
+�)<E�M��Z��Q`;jd�/��Ȋ4��N�'Gƃ4
�)[�dn�;�T;	��_v\��'ُ�
~H�z/���ޛYzdu*�<�
+P�(6�<Ύ�
���k
P�᣾��-�v��]�T1g͢#�Z
s�(v}>�1�+�q��p k:+�{�^C׼^�dV
+7������-���
H��^�Зy���Ss�g}툊�I�<5��q�4�H��
�	�7�b|9�)�-|���>I��q����W��^[;S?�/��Ψ�*"N��7-Y��VĈ�z	�]t�*E�yE�g
ѝ�f��p��Q�=��fӹ�[Ɔ�яZd $ f�����Ol/f'5�q���	��|��O�L*�E7N�y�@)���Iv v�
n�u'z
Q��%�[�?���8�5�F����zO���hH��6����݊�|����y(�[b�q���ke��ko��8�#N�
�GM��0
Ѡ?'�`�)�[�i���؊x
+�.K��C����Lz1��7�É\���B
ƒ	f8M�)-�_��T�!ƒ~ǁ.m']o
C��ѥM�ɬ%��<�@��mW� iߔ��H�o��s�=�>
�<�A���9)��ͮ�b@�Ea���LI�.r��p�� �
|����7��B��F�
+��=|���&`����R�H�M!���{
�o�[{��O�L��YkY���B�l"����6..�9&]���t'�
���Q
���)o�lł���f�M3
��J#���
����$︞���Im�)Y��gI]@R��ZԈ
IU܌�b��~b�����S���i�J8�/|�ĵ�/q��8��{�c%v���9;K� 
�&a��d:�@a$؇w�tb�Z�}���D�?�]�}�y����u/&�>
�0�b
+'��$
�٢^�m^���*�����]�:�pS[
+��H=��#��Z�������\<�fݦ���.)�\�a�5Ij����:k9gK�㱞�����&���w(�d�
�N��*��
Ql�Gҥ�H��61��?4�x�tRة �Y��%��m
����Rq�}x ���9]�bl]Ͼ��
�����c������7����Ε��A�F�7�@^�cڗ���v(9�
Zn�9��l�,Ң,B'ڣW�-W�}v��
qR��y��)�%���_�Up1љ�, ��c��l9���!�M��7���|��E튵^�D��r���eύ���L-J�_�Q8���"�)?�i̷��'��NHM9��γ
�G�a���_>�S����!z��3P
)B]-��#��3jd���.�a�4�,�x=�7�c��2u)�� �� �X,?N�=��~؎i0��\}2�	l�&��*��D>"�Vx?d�3��9��>��v�����ۖ�$��c�3;D��Qe���������v�u~�a��)T?T>��X^�D�Ω���.:L�ڔ�J&�ؽ���
��d�ۖ�S�[�����6�ma��}mI��LC�

s�~XC��ghl3$�Rf�0�䜸"I[T��.�3i��Aec��Ut�G0ZV� ��䫾c�(�+�*�X
[�g��H�A�&f��J:RN\�s�9��D�U�K�r1�Qlak�<.�9
F�AU�8F:I���12 i@��	�N!�"�G�������y+�HE�˜���3W��78׻�A	�>*8��S�,�aeJ�'�m�i����rx�
f�OG���hJ��%$'�€�7Q�w
s��/���ˣ�(��|�+�6z��3"x�
�4����$M�6\+�A�/~V�\����{���5�c�;�B] [...]
+d�WOhz��D�
*3G'�QF^���
�'���f7{�NJkh�V�~#q]�T�A�Mu�UJ��^����_
+c�'E
+k��"�
�=��Z�2��J�k�3�����錅�
�Yr��<�FVCy�^�CW1�ufq����DB�^�
m�Py��Z��	�,�K�9ؽ>��:`5(Z��L��
�Th�5�'ĀQ�`�a�&6v�ﷆ��Ė��K�}��O�(����d��K�-y�L�3(�i@�}[�V����#���o]1��u�
�* �"nz�|�O""$���<�ۉ�r^-�N-a��0��b�0y�n�gU
+��8
+�j��^��;�?@)�dV{f%1:t�xU�QbW��>���ߜ
�عʜ.{�� X�0�A����U��
+;�ʤ�+�m� �����|�"�9���Rj�R6]YuX�O�������K�
Q"����
lG�I����z�{�r���!X\-��]CÓ��}&Œ“,N"��r�-�K(�@9�ˌ�=��NT��~�EZ�
+�}�0f��>�C
?׫]�h�T�ȳh
�5�޳)~�����Ƌn^>aZ
���jͷ���E_��Q%�
+�Q���N��i"2<*�5�Z
+_���
+�#�F�|)����,�����K�
Ze��@�-���B��|�ے̍�Bo���ϱ<���W0͎
+�
Ǫ�
5eZX�M�h�x�ZFh�+S}�Gu��B͎�n�w��֛���?�ج�w+��b	
@�H*Ӥ�����n��B�F��Ǽ��"*����i&ω8G������"|�o�>�#��`�	�|��fcY����`
��L
�Q\�ϼ�b��+�)R�Z��"i�&ߙ���Y�3b
+
�

<ܽ}�{Er�N��-g����ŝ���
�T��-DО�������l	����2�A�v3���@�Օe���J�L�N���ZPl
+�01�*�����^�0$}�K�
�637�kTa{����uf�}�5q�G|"���E���^'��}xTRL�OrH,̇${����i�	����
�� 鑨�:$�6�R[�i�|(�U{�.�uJ�+S�۾@���ՠ�D�l��J��d���)U�4�!�����f�K�"�7�߱nCG5�ޗ�������a��(��JRN���g,"6H��R�ʘi��@�d�tq����}��Ԙ1��x��<=��[@21���b�X j��U
+���� 3a��3C�<Z��D�3��LM��`nƗ~��8�����Ms
Ӌ��m$ϖn��~��5�����E%��
G�V|l
J=�n?�����UP+��g�O~�O��
g)H���7�}B,V�QK��!��~]m�M)f�U�s-#���O#�e�ӗ�x�1=EǠ%��9=;+�mų�&O�sn<4�Ն7w�E�
�k]b�-���1l�(�\�1���gO�6YLo�U
3�<l];�Ƅ3ٚ.�i
6}B)��n�z�fM���M���2���H1)C�;�p�b�E�
8����>��L��	ѡ��*����e��\9���ގ���c�iv��H�A��������%�z�OW�w2�a>S�3�p��}/��8i�XoZB{z
��M�z�
'K�2��T�B'`��Sk �X+6���e�~%
��֋�r�^6�HK�L�o��
-hSya�4&#Q�a�Q��P4b��c*k�U%Mb��4�|�q�7:�#8��껬�ɝ��
`k`�
| r���7J��9�Ƃ�SH�
���mS�L`Q��"HT�\�
+���۽���KN��I�O"�	�G���!�T8k+,�/b�0AٰD
�E6�����P>��X�i�O�:$���w��� �~���5�b�;��^�Ѡ!3Գx�8^6a��=;c�v�
�9��gߗ��/݉+y�YA������c�N�I�(^���Uջ
L���
Z�
���l|]�
wT�oc�5��b;�2;��g:�L�Q����yE�_%�ہ�\��saw�e���y5U�c$,r���X���H�7���ڈf|�ⶂ��}�qӃ�����e�w��~�&�E�e��q�����s��v�n\�V����M���<�丈�y��U�[H�����C��OS�vm���?z�\��
+�kdA^'Vw�Ȋ�o׬P��-��g6�%Y�
�љ
G���߹A
��Q����*G?vqR�
f�~���β�s���u��ҧM?u���0+/�
�e��y�����/�B'��
�]=�թ|5��0}a�"[�j�yF38�#
.wY7A?
��D��&}z��8��(�C<��
KdZn2��
���]�������� ��rW���$�Ǔ��]�@tK��LW�)��J&#*�ʗ9-(X>�6�$�b:��s��π�/[�u�/�N�
+�Zx`w�#�}Ĺ�"��y]-�\$Ψ
	{�M�օ�r@)��
��,���iv!�~����,\��y[,�wY�T�H��-F�u�}�f�ϗ��LH��y��8cQ��:����9v��Suk���
+
J�H(|�\N�d 	z�E�^�:����m�T$���
�u�:��w�
�@�U��~�"7""2/^���"&��tV򃑨"��:������A�������w�k�(8���������@.�AQDz�-mT���*�!E�ď���2oU�8�<��
+}{���86T�ʆ��t�͛_V1��f�'ճ
�>���
�����{6tb��S�.�Uw	��T�$<�nv��
u`����7V�l%�[�ʣ�װ���Y�����a-vfHS ���K���J����X��N���'� �Ϡ*��N�y ��ذ�7
�U �&h^�+�dc� �.�y�|� 3|>`4��N��=OŊ7��88G�r�o(�kU��Y)
,w�0����x[�l�.���Jf�;�;�o��ަ�é��,Uk��\�s�����ϊ/S+~�/���Y�7�)�;����y/����_ߒ�
�M��(>kޤ�yH.Ǩ���ٗ�|��
���wτ�%�1���d�����Y���?u�@�7�,���*7a�
D��ϰG���#���Bz�u�|c~��F�e}1	;�����P�_e��_-�
�~8)��ni�
H1��}�I��&�#�^P磌�E�k^��%2���6w^P8\F���a�ޒ�?yX YZ{�^uh&m�q\@0���"G-DN�Ԟ[������Н�"&<9����6],=
��^�it� [...]
+�yh���$�X����~3`9��q"4
��s�ïE��;C�
�Dݢ�϶����ld

E�N���Y���ݳ8������l2-ǵ�f�'��9G �ʕ�
�,�,
��'Ÿ[��ת���ѧ9�B�
'��@	��l<@
�Ť_��<H�j�%`'ʵ15���;^���߹���X����54Ͼ��yx�I�lŤ����	��x�����t��
f��b�����,��h
+�[>�H�RO�8T�P�d<"�st��9�{�2�uL��ԉ
G5^�L�:QE�!��V@B�^���O[�k��iv!�/eJ�ҟ�-�
�r�#$���W���N>_~-d��Xa����_t�z]l�����
+�}�D�����P�l��f�,�Ks�מ
e�K�@������9�7^RB4��QQ^�,b�ʚC�
Gs`�Q��-��A�b�rY����MV_��Ş:�l�7��<=�h8�g�1w�B|�ݏ��}qN�"r.�g���
�:�d;�v$��GBy8�>}���mv����4�8�e���I at z{�6��)��c���7��Veܒ�Q��?*��
��e����[>���u[Y�H
p^��E�
+�@h)�~�Tn�	�fZ�%��
+�h�&�\~�]$^�B����E�gB{����O�DW�ܘT������)�E�cB#zz ��Z�l3��k����Ǜ��\�Rū;�r܅�'�o
+j����rEƺ���0g?
��\B��2{۰�m��C��BzE�E�'�o���W�M.�9֬�=W���h�U
��~*�
���o���+J`w���
�T,P�"�A}9WE���Tv��<%��L˹P�N��X�gD=N��:AF�����֙�N�\_W5%��5E����D��
+endstream
+endobj
+3480 0 obj <<
+/Type /FontDescriptor
+/FontName /WGKKCA+NimbusSanL-BoldCondItal
+/Flags 4
+/FontBBox [-143 -298 913 989]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle -9
+/StemV 120
+/XHeight 532
+/CharSet (/a/b/bracketleft/bracketright/c/comma/d/e/f/fi/g/h/i/l/m/n/o/p/r/s/t/u/v/w/x/y/z)
+/FontFile 3479 0 R
+>> endobj
+3481 0 obj <<
+/Length1 1166
+/Length2 6616
+/Length3 0
+/Length 7380      
+/Filter /FlateDecode
+>>
+stream
+x�uSu\�ۺFIAR$d莡k�����a��Q���T�鐐Q@�K���w�}�>���?����]o<�YLtZ�\2v�"��r�4��6�H]k�:����q���(�?�;B�
l��"��֨;^��
���
��
 ��	�ּ�"�� ZnPg�@
�����;J
a��
��t�]\`P���pw�#� �w��gU�
���
+q@X�u
�888�F���� ��<	���w
0
���]
+%0
�v״��X-{k;(��� V�E�����|�q#��`�]�
+p;9���H�ߚ�C���wCy��S7'8����=n��Hv�.<�p��;XE��� ܿ1������]`/[��%��]���߰5�
�`o
C��C��w?\_���rs?���Ŀ�p�@�
��C����w0����3k��
`����
�����2��P;
��w���3������������%+��K� p��9�.�� �?3�K��t�ղ��o���T��# ��s��_#y�ݐw���ac6����@���` ���1��s���_-�o�5�?k(��`����
�;=� u�oE`�n�n�
�y���
4����'�
+����C`��	�T�z��([�?���v�C�	���\@A�?8=��
�D���n���
+p[�
��\i�f�/�7m���v'�tw���=�A0�
l�;?��q�
i�������6��+�v�N+�����~��S)�@�HJ��ְ�d�)�3�{a�T
+1žN������$����#(w��%4��pX'y{)�)��l�y�+�ӕ�3Iʍ�!��i.L66]5�����W>�ܜe%�
+��T���Ú
��u

+O�S�l��dQ5�k�9'�l'����}(�?
����;��2.���rhW����Y�òq�3��ku�}�")��3>�x������-U�L^_�$� ��'.�նM�'}�Oiv��:����������O�c�yt� i�۾�
�Y�ǟ�̇�{��t�}�:�Vk�M��Q��B4��Sѵ��OR�kp�)��o�"��wT�g%���Ȧ��ݷ8�`���*?�����RH�^ж̚{��4��m�P�F,t�r�>�z��f3���н�oa	�;
�����R3���0�횹�I�^ꔄ0�q�όR/�Ȃ�޶��f����E��/�(+mͬE]\G�.�l��+��
�D�D��c�@+�N���U%��/+7Lf�{ه
@�e����� S;� ��R=�)�y��@7`�M�Y�p�?w�
w���ߧ�.f����uc�8�	����(ԇ-��>�����&�{l D�m�" ���6�|T
.C��P2q��U��[toCf'b-B�d�oTƽK� [...]
�"��A=�쎃��	�����Z<��R�؅q#=���yMi'j�C�����{��<�ı�X����Ͼ�p]9<c	�
E�Z�*I���:��%�Z
_.r�����.E���,Z,��`ڻ�}�M���?в
����`���L�3̎���]�=�0�ﭔDv�7��[���
Յe�-��(�w�.�9��);�~κlI�+�-IT�i[��m%Ng$r����p��ʞ8�Y,`��L.��j������/14�����[ǭ=g&�3�*���z
��bB�|ʢ�ixp
ɿ
` ��Q-���Q\Uވ�6�\��/��~��v
^�|
��|�i�d�X��U�A
0� �Έ�u�-)F�<e�♇�b�
jG[|_��q@ ?��r{��̏ӽK�k5��FU�l�H3?N�B���嵋��ߗ����V�`�����,a|~n�ş�{:�䯢���b��~[os�l���j��
_m�Ǡ��
� ~V
�'��m��(�wq��3��y��d�l�6
E�ټ��"�44����˜I~
+s����|�nz��$K*�fV:�]�
�x)����Od����`pF�H��3�Z1�N8}��T�(��ٚ־NW��6�+4�
���/|��� 1N�����B�53m,��k���h�
�W�^Њ�W�R39~�D���-��t7���_h�۵�2���o�?2m��4ͦѪQ%C��8�$>����<!�p�ݩg6~Ђ�|��������A&({�m&
���F�!g�-�9��䑑���B��di��
P��]��1R\gB�7�!{��e�!�bI�$�+�x�*��jƕ���|�IS�E�?�	��*ܛ���#���.z:
q	��
+�q��2`��	
RI�V~��݌����~1�j�V�I��#���d�f`���I9�ΒR9*��OT܆h���Ÿ���}{H1��ˌG���e�1�]Q�$���G~q�pH�K<���:7�zr"�4�5���xHu�̾T�R��
+m�:�<���Ad)�z��D�Dw15��Uٕ|�MG|!
+#5 at V���
T'@
���AN���Jn�՜?��F�,遗5^��}�'	L�ɠ
+_�A�e��������
������-�r���n�Wާ��Jy)~??~L�K����Ni���x�V��p��V�[��L : �E���6�Z�-��^�{#V����?`h��ZU�#
�U�;²&�û\�ޑ��$B�`�T�
1�)�a���Q2��ϝ�X88�]0��G���Ѧ��a��^;nh�.�D��Ooq�}���x��S8�$
$W�$���6�(;��E���y=�
��Y9�5��ݯs����>4�.U�T��߶X:cuo����6
���C7�[6Z|��O*�m����J0irHǘ�`|�K],�:
585Y�%���+կ���05�m���4���-#;}�� X�J�arK�VY1�Dd��xF�"?Sr�
�³��{��Y�m���N����� ��}.r�>V�XO����Y{���1QV��|�%���j�4.�z�툦��T�ּf=O��\�~�Iē����	��mlNS���%1�<r]I1{�"���$/ڥC�S��x:ݑBt���3?>r� [...]
+@�ਬ���j�6�\��(��	Ƒ�R�w�H�=�jE��̘E�.��5�q��oV�Z��TϹ\�c	�
�z1
�JT+ǝ�ϟ~|z#�8v�p
!�ذ�9���V����v�v
�V0!%!�x8��_��gZ�%c�^g�e���{��֗���g�KY�%���9�Ϊ�`*W���8g�o>&�\lxS���Ŋ#��O4�m~��aMΛ�����iI���0��O�4Pq�r��^�p�<6$"�8lVx��#M��h�
�Zf�
T�
S��\ˆ^D�r������nB7ե%��L���:��}��DgN���˦���<R�p\_Z�d�`��Opթ�O�r-s��#nIM��U�Hwt�|#D�S�E]c`�m�j
+���=�17�H�\
ѱ��,u"#�Gp�ҾG/C(�]��
L��>%M���#{u�dg���C���48��5�QM�s1{��c��"��p��h
�gz���#u�q�3�L��3E�x���>����b�%=z?c�E���0>
w�R흍vd�t�;��:ö���`�����[��mJ��f"M�T��5Mȧ�5#�s��1��>ۄ���
+@�C�I����+e4s��E�fnם�N�s4:��C�6��� &g�G��y�|*X�u����Iiu[吋�L8v�f��
�ʤն������t7�1�
�]A�(��í�[�a8�R/��p�wo�]���~���+<�s��G�:
��
gNbQo"46�WL�6�y�~n&�Ēu_"�
��e5��i>�%=��ϖx���

#�Jq��-67�L���)
ե���h�E"�Y�[&F����M�|Bn�������������\�$��iCJ�?��K�S�10+0�>I�ڇ9�ܨ���E}�G1�!*Σ��Ҝ�ob^{T�>�n
y_�
+*A �r�H��|�6�\�)ؙ��9��7�w#����nI0dz�8OW����P�;e&�A��E�
؈�osl�`��C�5����0�G����+O�z���GCw̢����+>����<�YLT�gi�]
��3��:�꺒34m��fx��?���ԃ�ZiJ�P��'�Wdn̕�_+^-�:���2��Y�S�{Ѷ�x8�CJ�½�.S2��{�󲑝'��\�2�g���r�R��0˧-'ۓy�+
+�W
yq��
Y{.¸��/0/ǷX!|C~��Ic �S)Y���� ��A��S�\�
*�Y�@�B�S��������m��|d��<+���6F��q�?�,��NJ
+�D�H�S��L���yU�ݥw�\��exIΚ]|8���-s#
����8<���ڸ�-��J�MՈRՉy��T�J�a�_��WIH��9:���NS�@u�I:8Vj	�'��^�}�^4�F'��ˡ��&s�h���*�K9r
վ��7�cWd�s�8��c�8A4(����g��fND�4�ޫT��oM�p�Ve�t�}j
�.��XnIJ��owKߗd��.�7�t�J�;x?�g�X�l±�.�h�ǷGg0�Z�=v�|�Wq��f
�h'|��_I�\�uhآ��n�N��lD���c����C>V��n�	
�Yi���D���_����ջ��M�������XM��2���Y���2���J&me$���W#ܨo�J1f6��9ܯ�pޕ:P�&�^W���(��:���>GN>���r���R
�*�aM��rxqQ�-��
�Խ@޶<tLQ��<�����f0�fV+�`���S�Q�º

�A��g@�k�B�p�6Ӕ����
���(���^W����z��վ	����͊l-I�G��ꐃ�=�l_�
�A�
o��Z��l)::��T]G�s��+7��nt~���"��`�XĨz�7��Cz��P
�
�F�Ơ��
�F#�?���˦2$ץ��1[N�� ��&���y�/��7��l�H
��,��B
��:�R1J5]}g�w�{�s3��+��?�	�0��	y�%]����+N�(���V\

�EX_a]�b�b��F%{}�����soa�!

&<z�9������#c��Ի&j�hN
n���mi*��.�
��!�t7�N��J�z�eU��5��Vt��}�M@��<�J;�C�0�C��T��ã�X[+i�T�G�"
+�Q!��M�����^�7^�X�1���&g�����
v�����|����}��s���VuƊݻ\��
��Œ�ek�R��f����t;���w�d�.̜=J�vˆ՘:'T��Y�;v]�-��u���l�'��^�7t���9�<��:��E��>Q�(#4
+�X��v���g��	�
Ǭ} �G���^m��km��(�.�>����MvsW�7��26��ŝ�jw�*�
h��$�������{ss
�v~1~��Ai�ü}�4���*���3�T"�|7���q#HEj��U�y�%D�2 I���I,��M9Kz�F�f���<%�.�18���$�����ڤ�nP[�r��F�,IN��k}�RB+e[�5�>93J��F/�m��a&�]d����m�>$d�9�����|:�qh��qZh����h�E�P7ey#n���rHa�M�x�OK����ρh`	��J����7C��76�0��޲8�3��{i:نd����1c���v9ʄ�����1m�
/o8��&�ޫ6��'wC��t�B��v��F�����Q�k����W?��f�#r�-�L�ER�
�*�Z�n�w�D���g���ɘ�nŽ'�&,O ����J���vC3B.������J>����#�����t0Of1z��Y [...]
+����C�w��{�
�*$�16��#��D�{�&�^Ϟ�ފ��ӊ뺵�5�b��H���t����w�O��z6�<A\Fx[��
��WP��U���%R���_9��@��&4"Ɠ#soSW�<��M�r���g���a�Loof=Zёv�NX=���0�
9jA,�iO�N
p��C�
+pb�!�܉�n𯅋6MF��`G���m+��Y���>�djӊ,Ut�F�V�ם),�G��
+LۧO'�?72��)��6�T�
�v�|�8�s��d��������D�����V���a1!N
��喵A�ݣQ�xTR�\۟����'26B�A��{FzՉ"��SW�x6
�����Y�1,#��=�	�Z6n��~%��R��G�$c��AR
$b�eh�\�.�.c�b����g
�
��VxC���%5X�~6��674�UٝVm�����31�P#ϱ��C���@hi2���1"J�G�ܯ'��)]>�
�0Tc3X��dυ���_�{{�ѭr
��k��u� ��i�嫰��2�
��=�v-��5�s����S���z��ݻ���]7*:�+����rx�U��wcA�lmcd��j6�ZD>RX;�YʓT�e�0���
��y
��)P����V�[2����$���p<�@d�@#�C+R�sǭ-���du���H��H�׿�F�5
�
�E��m˿G�R��s>�L��^�F�i�N��(#Za�����L���j�<~�r;
��K�c��z���q�m%o�
+endstream
+endobj
+3482 0 obj <<
+/Type /FontDescriptor
+/FontName /LQFJJH+NimbusSanL-Regu
+/Flags 4
+/FontBBox [-174 -285 1001 953]
+/Ascent 712
+/CapHeight 712
+/Descent -213
+/ItalicAngle 0
+/StemV 85
+/XHeight 523
+/CharSet (/A/B/C/E/H/I/L/M/P/R/T/U/Z/a/b/c/comma/d/e/eight/f/four/g/h/i/l/m/n/o/one/p/parenleft/parenright/period/quoteright/r/s/t/three/two/u/v/y/zero)
+/FontFile 3481 0 R
+>> endobj
+3483 0 obj <<
+/Length1 1626
+/Length2 16076
+/Length3 0
+/Length 16928     
+/Filter /FlateDecode
+>>
+stream
+xڬ�eT���&���Ӹ���;���F�����]�;���N�����{f�Y���3���k=�W�Uw5
������P�	�����.P9Zx�i:9�:	(�� �@��z
$)W��;�	,m��� �@K ''�C@@ � ����
+��u��h�1011����������tـ�?<�NΎ@����ׁZ@ ���9 Rj�T� �r�: 9 �j� P��p Y�A�@��`��
+p�� �t[��i͍�o.	7�9��h	��:�cb8]
Ann� 7���9���
ܝ  �����? �ꭝ����鯇�_��d�Nn�n�� gw�ߪ�Ҳ���nk��Om7�_3���������?-���7�_��9�pz��S���9;�����7��+�_0<�@`��B�
pژ�Z9 ����������W����{sgg�E;���a ��
�Y�88�ִt�[�Fb�gW��N ��<����������3
A�[9�
| V at k$6U'��%��w,������@�
��-���#�?9��
�������e=

T�
�.��o
��1���2�C����
+1w9�����
��h%�
��Ӧ�n�w$`�������[	r�y��A ks�����^ltu ��y��H,
���aӶYڃ�!���& ��?����_��T$�u�����_����]���/��ъ�����I#)��
�����`��������e��?��W"���U��]A� ÿ}�s������/��?�Ȁ-���Y-ws���M�_�̖
��	�����������@�7�i}��R(�.3'˽�`tJ�p��z4ܹ�Y��8�Ω/03jO���>��eF��g����P���{?�]_:�ğ�a�s�����(�ͤ5�^���%�]^vݣ�)
M��W8ҙn.W��g� *�� 
�'g� ˌ�/��0Z �J�Ҧ�>?�
�������
3�A�2�H;�Hu�1s}h�|�}��s���p6P\�bM�j��V���f
�ab��g�_��{�wTI�
1��t|*���?]h�s�i
^&�hN̦��}�I��ou��
?~B��c�ak�U����Amӏ
}�BS��͝8�+�ɓ6[�h���*j�}
�y8��������v�
�n�L�Z�<^��{Ճ`�.023_P�P`×�f��X&t!���PR2ø~B힅 ���'ʒםA����
;D$���
+N��N����W����PB��ߐ$Ke��L����R���G�?2"��N�Γ�6�< C~��v�9����m�|�}m�XFf�eF��� �\��n5�
+VZ�ɦv�O��HNɈZ�;q����N��+in�ű=�7!�?�@q�����A
�=�}��ڗ�$��32xIL�
��A�\&��&ۉ�s���>��
�B�v�O�V�DB�5�
+�fF
.:i�p/O�������yn���(���)��%���'�w����V����]k>9�ɽ6�������X[�p�w��l�_'
���5Zo��8Y���'�h��p[��/�Ql��Y4cx1y	����vy�'�
��'2���_Vry%���16�>oQ�w�Ijm����;W�R<J	��r=Ah!�!f@:��sC>�W�r��4A���}�$�3��-��Ob1��6��`��ȰuW��8rB��_
���=�z���X'Q?ll������S���ic�e
�m�L��8�\��
pn
��9_ZN�Z����|bڻ)i6���|����K���[%i��נ2�Э>�@fXT�s
��p�)b��@���.�[ /טVåP��'hQt��D\�r[��N��S^X�2�z`��,�$�ܣ��m1�$�4?
g
4��Rddz��+���ǘ�����8N�y��g���^֩�
ix|��7ެ�'�h�guj�ʭ�!�x���P��g�V+�70.#�)���-w�N;�'�u��U%@���ˍ�%iԇ#{��
+��#����֤��MX��G�*��hѶ~�z�f۩���V�E7��z�W���ת+�%4�l����z�������5広¼����:lĿ�l��|���b��|��	N�	��;�J���>�}j��N�F�q@&V
�8�b��.�E�u�p���
+��9�z���g����
-���lP��v0=J��OX�U��n���n��F��E�\��7aH �N���tF�E��2��o�
_
_k�}V��\���	f���
�ʣۊb�>ڃ��{��q��] �ʞt�]��:�d��a�#*z� n���y�T��ĵ]�g]�
+T�i:x���R
+^
�"w2��I�'���Z
TWB�g Zݗ�˴:�<��S5b�bSiQc\�Dk�8Ɯ�oqG�ɏ�٢�����i�6qnE^��j#���ƞ�8њ�}r
+�z
���
��T�؏') �ZD���7����]�G�
|O~�O�n���^7Z���|A�%?�Ȥ�S�la���
5{SɆ{Wq��s�gw�R�F����=X�o����c@
�S����G'M2�S��x/��a��
^�î5�p�(v���Jޥ�"
3�={V��&��J�d�0]0��q
q���"�@�,98S�D\��!n6b}P]����k���z�u<.�oB�`{e
�t/���ed�|�	-�����
�-�r��[���}7��%FBѳ����jr��g���U�7e�Ap�M\M�uzz����#>�%�
�@ܮVwd�����I5�|jG7����r�vku�Ӫx
V���.:������)�ANġ���w�*��H�<U{Y���q��Y¾�
�n?���4��H��z�/��a��8{]�4�?�<J�v°s�
�F�L�s�!�"�-�O��&�l���L�g
���Yp#��Qߍ�~ơ;��(,X���p�����B{�L�
+�JQ��&EIS�)�;w�gT���
Z�Y"�&���������Z�pI�?d,-W{V�".� 4�5��
8e
A[��{�mڳ�B�ɋ+C[���nI��a��1�V܄�H�l5"�y��44U-���
z�OͶ����l�O�j�U��6/x
zuwҏU_�о+�jW���_�R�$C�˾$⭁���w��`
����h�\�w�;� �
+:'vu�c�8�oy��)�[X{�b��>���
���[z� Z���-�4�nU������wM
I鰩}̊
�e�P
j�T���"JnLY!;�q>��.A�\ω:�_.��R�V�A��un�nԴ.�f ou|z�FD&�.�$p��$�bW�M�P�
}}���T-�O߇�̠��+�i���*��	^�
�A�2t�U>F�R�q�˘������_6���U�c�_ܗ��tr�
lŷe'W�
J�Q�y�v

��+^p �T1������
ǽ�TM�	��(��/.P*)�%k>���
���^}�knu���N{��
	kl���j���|��+ۢi�)�@��g��gP�;�ʓ�/a
1Vk
�O�$�hy�ߞ^R�Z���`'�
b�����R<��}�U��� �H�Ʒk/|"��g���9�~c䘜�����
�S{魴�
�~Ɓ#�����m��f�)��s��*BfP�{��g~\&�
��wꐈ���m��T8$Ty
�@�H30��*8�̋nO
ѵlb�3L=�h�2�T�03��[�P]C�.�θ�[�r�]PK
�ݱEij;�4�v�Vtp��T��98B�r��J�̨�Nt`���ߓ%�ަ�Û��/W�>E<W"%��捹8�}���J
5�����n�L���T at m����*9���p}D��sD��8�>
�^#��^Vo�I9�@��
�p���%�ۆ�ZC
Bz������AQM���dW|Ja히���Kc����}y
痣�9�	��j���v��ͪP�OW ���[�Q�j�.&��|�����:n�JhA1��p\I��I
�N1��1��L�{�h�N5�D-#��b�?eW ���m�,��O{Zp{V����Z
�#�Fv�g�o�6(�T0�����S�cX��i��ShQ�����,�!�U?�w�0���g?
�H���9�:xJvQV8��Z��e
�eo#i��O}.�e��y��=���L�
J�I�Ի
ZE�,2�F��TR#[L&UJ�ة�+ec�cO{ڝrB����2�2�-:j���̗̃��UFk��6��<�S�3W�eO����G�uv������WTn�� }=����p��.��++
K��-c��Λc9�YF�1���l'��#]F>�KC��?��N+R:�%D�o���l(޽���^Oں$���k�fG8;ܣ^J��
+��8��G#�����$�\+�;0ޚ�����S`#�;O2$
A�œi�׊{\i����*U�3r_�ŏ��Krv��
MZ��Xn�^� � %d�%��K]��M�i�]��|՜�t�d.�Kn�r��Cb�5��7£���f
�]���+�l�vNIp�g��{:�ޠ�A1������ta�!��DA��g]���
Յ6E�Q�q��]vX�0Bϭ��s=�,u�W���w�g�XQ�ۃ���[�ARf��dKi�8 �k�
0������B�ޗ�3� 1�V�i���&�G�K�Ӵ;�-�|�>JL�mbi����3ݦ�2G0c
͊rT� y�2(S�y�
�3f�����t<No�II������N���<E\B*{�{���n�";
|���>+�7Dچzp�(�(�-�+�$N�
���̠���B�D�-"R�cQ{0�ٖgؽ��!\�̾iv�&cw#dNZS��K�g�晪�j",.�g�(�R��e>QV#a������}�u2�.:�Y۲�Z�D5:π�w֯�"(:X�Й�e���:��ZV`Q�=	��6Iq�Lg�� ���
<����s�Cz�Z��
-񜙉3H��(
��2�
+c\B�h	!~��2��t�dAq�
��k�)
�y|���
\��'�#�W���X��ߥ_���-�0�	�
L
��!mܺ��
�q�}}
+�#-d��Z�s_3���C9t_A�>������0ja?���Vl��/-�5��[y��0q|h������G�DD�G��H�	^�,�%ˏ,��_��[�3��x꣚���K�w�ԇ
u��E76��i���5��)���ͨ�۷�.v�,�2\qo�H��
}�_����g�&T.5�-�t
+��-�L�({���4c~�Ȍ�G�.��*q�J���w	�tM-�,�r�gʻ
�
|�ٗd+
��ʠR�n�(Sr�����$1	\�#�)�?+޻]�;9�r ��� =h6��3�sBd���n�3���㟋�
��P.!�

7�r
����A��
��=�֟a���u�[G���8eXIU�t���x{��.�.)]�'�u�t�

��p��z�Vv��~݌��Ud���
���
�LJ�D
2a��YL��~�����X�*�E�͕����|��!�',s�%M!%O��`���if:�!0��Nǧ��ワ��w���(a����$yN�@�����%YT��&=f�+I�lOz�<j
OÏ5�<�f�P��
+��=�q-��}�ޏ�Qe�
��Ev�SC�� �*�-}Ɵ�s�$ ��CI��#�8(�	��B
�ئ�1�>�&NmdٻƱռQHQ*�����^�=�BL�0�Nߡ�Tl�Ι���
��\�E�Cm�
+Qr��$�A뷢ߗ����يN�\y�"F�#��l�Q.	#
'��56�!�-��1WZ
ک��KY(#�h�O;��6����uA'_�<h��Y�L����g��D��<�,�+�aj��h�
�2Fp`��SEH��J'�{d&-"��j��K�g�M�VU4������9�ob�	Xx�
����0wNɅϖ(�
�Py��R��v�c -��+U&I��1�[2�G(l!�b@�u���n�ȡh&^�huM.�<������Mk����e�M�v{.�p�\N�R����i=�tqZ¥ ��(�����??��V]���k����҆��IsƾLX@
+� #ۧ�?�B�%����
�Qϼ
!���R`�[���-GOG������2p�"�=�wi���ϗϤ%7� 	r\�������
��7���;�KJ30� �p ����-?�q�ü���[��W"���C�E�W0>�t�8�j�_`��ۡTl��~dN|f�9FP���<h���we<X����[W�a��D�x���`�|3���=,س�����/��y�z��a�7��ՈVr��7D� P���`՟
+��YC�A��Bn
+ 9��n
Y�߸���
�G������v�a�/pe�D
h$�
.�Q������
�9m��w�w�����hR��
����&S��� *�n2J%��5�@v1{|���.J]j�����
�/�yƞ����=鋖_/�>�W�p�t*��rw��8�W&_X��PY4�BG~)���2�z���9(��=1�o�c�¾qz�ڑ�j�~@}#����	~q;�L���.JQ�
�j�f�*
+����8�&	+�t�
�p����\ϸ"�9�p�r[1OtO��PRr~q�-����]� '�5_�M�N궃v��B���
����!M�t3��Ff���/�
ה���R�QHZF|�!�!� ������ey*��yNX����v��4I"u2��ʑ����=�(\��<�H{�R{��ԨÉ)�e�p��
���ÝS	:���*��-�UH ;)���ȯ
�/�(.���	�eb�9.����Ml�	�K
*��}8=hKS
��牙��p4�1X�,Uxƃ�v��x��/�*�Y?R���4FvNa�tD�A�8��>�����$Ȯ�R�7�{P�Gc�i+����d�%������3p�Wؼ��z����T�-Cy��J+��� �
+����~}�1[_��;��
��9q�DԪ��KwԴ:���M��!~����b��Y�G�KҮ�3;�Wã�6�T	�K~b�Ń���J��z���;9�!�[
+~X|���y��H����I�B���z at QD�`nWJ�@��J�{���{���%ޞ��2֢6^��'u`��+��8v��|�M�_~�S-����
�sc�r��.�~/�C�����{UE}�� "�J�
'޴�G�>���� �r�����V��Y/ȳnCxrC7�%/��u�
���uʦ�;1s�����\#
�Op��_���~�‚<^g}^�{�XvC\w�F:{��4���E�
T�$��DFϰ�TW,��-�r[���qt��~Q�&<�.�B�I����s[fr
�?�� Ӭ®�N�o�
���H}}B%����~
d�

iگ��M�4�3�(�E��@䮐���+�Q�л
m/
j%�ݒ�k���HVQ%}�Ό�p���Tjj�sK���!��\�w�\@�eR�˄:��&^������-
��{�߷dbT����
[Z��"�J�}�P$A���e�Ҁu���
+�� �Y�x��uL��|ƛ����r8iF�To�

$�R��e1q�X�ʨm����'���[d�
{b��p�az�U(��(&QR�B
�|!�d���˴�LX�5�4�qU�8
����w /�2
n��
F��+��<y�7��! 6���U\��/3Re�
+Q�(6������y��T3��ވ��~J�t�W�I��+��q`����FY���-��3��H���F�-�0�b
'
^Y�rf���<$v>���F�y?
<�}L��,��,S
� B���F0�i+,Aчu��e���#�'�%�7csP��<�
b�
1Md��F�
a����
�>�E��_�V�b���I�ጇ�{t��{b�����Nk�T�xQ.��kV�m���� ̂(��V6�0�4��)lt�zL"��]�D�2�貙S�)�m �U���ݍ:�w��'�m��9�wn�Yot���m ^�>�IQ̈́��b
�
<��� �h�>Bj���?7��i�	�������X
�]H6n߱��8B�m�r*�4�ɩ����
��@U�6i������8�>822`�ps�
��c.�V���7U�&��j�v������Z�qr���TT���x���ٹ�h��h%
R6z?��<�쫠�B�0K�z�|�)�4\� |�'=�a7(�c��ͦNI���0뵆^�Gn�	�+���6�
s83d���+�!惘�FFcK��& �T��'���;N�������9�x,��ժ����@2i�v�E����\���Gy٧7�
�/yڹ4

V$������U��yq"!��J�=k}��$3�!�5m5��W�4�
S�eܡ�
p?8�b�$�}	�����Az�H��A��%�F�o�64�r
�<��1�r�>�|�z6��|�MG��+7�мKV]��J0]
L��U�F�61tq(��H�gA�hdžO\���qg�(q��a�{	�V�:9��
`���k�Eȡ
+����y�.�v�|�-���0����a�H�uI~w��@e���\%٦N������ ���] /Y
O�n/��
+F('�
X(�0B��߸6��
�&k�؁fuiY�)l����>Y���wu���/�x�W�X�>Ƹ�L��(b]�����QD2K���	!1i�Q���ROۙF���n�MR�/F�S�㛡m�
+�v�w���;�
#�j��$���7E=6�bf�
��ij6]^j[L�;Q�
fL��|?���Rnql�%
+5��e9�Ink�hZj<z�φ�/����u�u;-���|�!�*l��Av�dJ�M"]����|V�_�C:�����?��l�7F������P��(v^t�1
;���k+��T)g�/�+�j�+(F����?�"��\Y��`I$q(%��GR�Шm�
�ߟ�
��h�C��US�MJ�
+�3��r��F��5�
q[�]�9��v܄�H����q���-�d^�&�ŏ۔o�"H�n36'�+���ʓ�M�������b��De+�(Uke�P<����t���T�BԈu�N��+vb�hK�y|ԑBEE
�ƣ_�&[�0ݎ;��
f
E5q,s�9���k��G�%�
O*q��('Fĥ�
��$/L_gl�Ok��
��.��/EBx���N�=ܵ�g�ʘ��hC��X!_iQΪ�"�]ͮz��l��
̻
���*�4
��SV(qT[� �EK%g�x^�
+�s�'�j*�ߪx^"��vsx
@��)
0�����L{|��E�s���tPl)~��5��o�~�q��!;�ƔTΟ�
���|S�ݮU�
ab�(�J�Z�1�)�ƅl��L�@ƈ�c���D�%[ڪVF�~Zzf�V��M���R��iT��}D�m����K�,�t���̀�
y�,�O�Ѝ����5���g���h4�d�G`I3s�[4�c
<�D/��:�zͼ~ߟ5���,E='�L���sYM���NiIuT��{��F�Z��'��G8��ǧkC��ST�)p'��
+L�y�Ӌβž[�.�a�oW0�D�Gp�
+�&Э��h�\��f���m��x��]is�ܰuZ�F�(zF���gm�y6��V2��b�����R <�j�(l�>%3�9@&O�Q��\�ҼI]��6�pp뾌U�N�j��?����
�I��
�P at z��c%�]o�]CA��T㮮ɗ���g�s�}�t^�^�
G�lC��,�@A�ƨ
�W_�{E��؎�q��|
؁xβ\F�0����K��P���6 ���vke�� H��*����
�\�H���A�)|� )9]�#q�ϣK��#���'t��78�Wdz.�ٟ

(���L	��ud���}$�W�l���?ϻ#ձ˱	
�2��C&�yBL,�/��rR�܊Q{�WKبd*��@�B��ze􋫈0�6�C�Ԋ���A�;4q��d������0��a�h�CL60�^
KM���
���h-C`
+���f
�f�@��	���tY,F?�j6U
�T�
���-y����1�f�>��!�$����z� ��;�^ʹ�p��	Z��&�
+LJa"5��}]��
��Us�F�*?���PΜj�>.p�G����n�Ja4e�2#x֏�Qb��nh�p��i�����g��]���mB!d
��C�[x$�Mi)N�j��W3�]?&�q���t5L�1�Am��
SS�B
d!�,��(��2��U�~ш�.�TL���Х5!8�d�
:�M�4���
�P�k{&��0)�,�n�������:>
=�=���/�8��!�>4HuXa!��u��X=�W���G���
�}=��9~�
G8��'rN(�N
+�ᾘ��t�	(���q�3c��o��}H��*�%ݱ��'���
�?۳;������Z����"�dп�W_#�WF,��f~(S�앂фNd��͢\A�/����?3\��X�]��o
�5��q�ReMT��n
W[��
ϲ�=R�<����Y>u����A(o�\=��+��Hx���C'�/�Y#��? �%����&�[p:441k�
��
���cC����Ba
–:��s�m�w/���{<X+o6C�}<�Qmy�a����SF%WD�a*����~�3~���p�Y�#����������R9���q��e��s��E�<��F����
�H*뗘��p'r��Wf;0�'��h�
$�D�I:�k�
T<k|,��l~�O1P[u�E����ybz���
�V��5k��zȽ�
�R	
9qI��*Ác�q�c���m�����
&�� ��m
�J�.�si���2Ʒi�h<�����px���\J����G�|w"�z
�ߒd�a�͸yąܭ�%h�
X���c�vE�#��Š-�;
jzG��|�Z�u�>��O��M����
+������T>
��Z
�//&��T;H�>�1:6!J��$(�o�ި�k��	�x�wEL�����K�b�+_�l��5U�ڄ���N�#�a��ӎ��
��5 at W&(dK�s"����	>>�b
觠@ܠ��:B��<Ycf�
����a�8V�۲zì�8�]�=���j�Ÿ���Ҽ���N&�`
Z`��oox	m1�	pG����x뷏Trg�t@8��^$X���ѻ��\��8��ۛ8�VY�ȋī=�>��S���ٜ2�;y
�gFF�+�b1atVB��V{�Xiu�����$Q��H�D+���wj6��~6�˷�)�dZ9���W����S��M_9���P��)͟m��=���K
t&^���{LV%�͌0�P�Oo�sn�"�2���(�L�ٷJ5�~�`n{�2������h��

+����>�y�9�7E��mz���MW}G
+�_H7�)�i�#��ս׾&�ǿ;a|��W6�$]s�1Sg�!}{|ѽj��8#Z�K=��!�
i��O����
�T��<�X�߫+� ���:��]0��?������b��Rp�ᭊ��OH�E�LB�鬸H
Ӳm���A:�¬
�R�
֡^n�g��0�8�o�PS�#�RA��8�;��( ��H����D!�/��o]b�o/E���h\m)����0�2b4�ε��Ϥm��eI�j����更-O��
+y�%�2��^�Q�v�xd��Y������J-]����5�)e��5T�Έ�������N	�I����S<c�r 
�- E�yN�4�
�W)-��NpfD��m��V��\Á�S��xY��7�vn7�8�xR�O�g�5D���:hЧ�#���+C�Np
�R��
'��t����6ȼ��Y�u�rL��Dq�����5��w%(@_
+4���1
��
]�**m�B_�
�7�(�G��Y
+9���G�2w����
l���D���\�+V
|�|#d�j�SAVdqLf�͜y)i��U��'�!�\�
���y6I|u�/��ڛ+�TsRj�敌����3���ZBjA�!�y!�1�
������C�ZK%���r)���2z˘wJ������&}O�f|�=W.F
��'/m�����Y���0#d�w�џ�L0|���ԯE��0���/m��æ� ��T�;-g�w8	�b�6�|��$gnD���:�
	�=u�	�u���E��]w���NG�����ј4
ci0*��#���-������0��hI���#
��˲���
 ��|@�W��OٟDVnQ`4�M}������3��O�`�Oa
+��_-(:�|?�{,*G��F��En�C2��\�]�pz�I�����Xe����7�ZB^)
��m
��
�.-e�ed"��U�P#y
�ɒ��n�D�}��sޥH'He
��ώo�M�?#���7�u`�'ԟ��
>F
����!ʆm�0�.���$\���}����+��%񕛙����z�N�II�*AJX����b%a�?u�
{:�m����n��]|2^v�Gc�
�@<y��G
�)��	�L�K�O.�0���&|7��gm�Zu�炶0�����N��ZNΜ�k?��N�6� �P",Y(��\}WR��ш��3kB�ˆyn��)�>���
+��>�b��Q��$M �5���pEO8P�C-���$��G
1'�4�a$#4^�?�$Y�
�(6f�X����Ma��ʁ_ﻖ9>U��4s�a-
R�p(��@�瞴�4u]f2>��
�Y���9O{{��|n�R�}yS��a�,~�q�t'/]Q�b`2����v�K3:� cl_˧�{�tI	�3��jS
�xm=�v��;L� �ڜ�L�z
�d���l�;���x�Ya1
+����%�K!q4�r��T�󾗥<�W;Aݮ���t1�›��
���z��2F�����8�4�CLw��9�cP�q�l��2
<�u��h=�y�����W-�յ�e�`5�|(�Z*���l�uFT�#�
�bL�ڰ�ߏ)o��|J�x�ؖp��x�S�V7�#ǥ���'ȝPS�|����@�mo�G���"f��l���p�+�)��.���s�貒G�\��0�8ke'76G��~����`�38+d���a�Q��J*;�Bu��t����j2hLG�F�z��+���le�(h��k�g�H~��$�EAצ�8"F���"��K���;��JP����7�Y���n�ER
�O�+��,�ּ*"�]5�g}���'#6�_�O�q�e((]t)K
+/���N��5F��l:�ڮ}F5�=��HC�Bu�!����Wᩩ2+�ȏBQ^GGNH�B�C��n��[����a
pb ��r���
+��0'��:�~��
<>��u������c�}�qvP*������ �]�{��装��9��7(:U֩��X_`I���&�m��[�
��z��yh�J������!��j�\��0d�����R3N�a�A�r �z
+�ߗs�ޠ]Z�0��S�(kl�z�x3�g�C��|����j�8E�	$Ss��3Ž/M�8�}�/T�����7n��JiK����W��g�I�仺dHb+9�j�(�
i}HT�]�O�Z�W��.�����ǩl)GST���:�nwu��u�F���P����p�Г�J(��T��c
^: ��GM�+�P�IrF,���F|�_�P��I�����
KY������/�V�f��|�/yN�1���w���
��Wf7z��	][b�)�����}5W$睶��q (X�#��>�Y]�[

a�
'���B�0hz���a��vwo猏�^R�~r���M="LaQ��1���vI��nF
">Sש��炢9���0�:+S
Uhj�>��K�Ib���$G=���(���sx+�.�Pe��mvu�9�����~���Q^	���6��#�����g5T����x�8
'�QW�g��umX9�J
�Wݙ��ht-��#E�#��T��Rr�D^�[���l��W˷
n1�	-M|W�E�nGtg��1خ|��s��mp��GlAɼ��tDa{" &��mI���%oE���2r�.Cb'=�
�_~�~ʏ-
��
�,��\�3Im%�z�D��bX�
��*P$��uw2�.`�)�?��r�/Vt���8�,˰��A�5N��m^�HG�
ߘ���� �޴Т���>�}�
�Fʃ�
)=��x�R��H`��!ϙ��H�������-��75j�/>�ʆ�]�5>0�~����g�����iF��>�\��ӭ:v�
I���:B�T��!�=0�/WŠ�3 Y_�
a���_^bLD [...]
+1��ں7�

�qX�؈{7=��Qd�Q��O릃������9��ښ� CeA^st
D
bRTSU�"L�H��߃D
+��O/��_�j/�Ұ���.o�����{gK@�lU	{��L��鱤� 6 G&�`i���=��
����d(�0'!&����
d��3ܴ �:�-���Et��
+�o��n� �X����G#�B5�7���N9�D_"Xi�Hk]1�<�;����4�үi
��/?�K�m�&��`+�ч$��##�h�

��`��)4
l^"��+�0�Z��Li�G������Y�.� /i� >��|w\K��Z��g��ى�.;�'֩��=l_�
�N?(BW��`�ÿ�
؎��
S`'{G��+O���I��C��su�G���+&� ���G���M�ɈA��zF����v��:�
BZ��cHi���L�����WP�Z�v�а?i�B?�s�o�s������7���Îߋ�
+�ޥ�D�w���8�Z����ّ�?���V��qS.���R�U���=�]����6����-�T�V��9�]D���_�
�I��`YWT�̌���q�
�5I|S�R�8_o��V���P�"�&tFoن���6-��cY4��.��(�
�?�>���ʠQ"Q��6/��a/���0r��2"}�?@v7hkL�`Ub����o^��5�ۡ�a%)k 5���pDs��e���F�'���L��{fѿ
�����`�!a$
r
���ѡ�;i�T
4�|���[_B��٤���
+I���jZ��c��=�
��5�Ī���&�2���ީz��M�ׅId�C��&����*���Tqܾ��3�	��J�!��Μ�%>W��l��$�*.��
�������
H�]�_�8��t��׿�UQR�G�rh�&�0j�s�F��b%���/͊�~*
o�Y���JiZo��u��J��]�)�"};�_\R��
�kQ���::
�i0f.�����b�=�Js�!f�dq�.˚�J���Z�]Fя�+e�RW�0��<zJ߮�aN��u���T�)䊛�o�J�K*���"�Q���\?.�n
��B\f�%����0��)��QՒJ6��r�P
N'\-��4'�}��Mt��L��,�XC�#�
V
+�L^���T6���
�Tuh�4�G��5q;Z����
�m-�O����5�����o;��+`��ݭ�9nm�">"�/�Cw[1��N�̗��z��4�eG�1����`��b-Bs�����pwB�c�{���'-:/@���j/U�B6��
�KU��
+0�<�5�~L&�M��H��*
� ,�^`��`���R���o%�CDxP
+�ڞ�h&3ST��/�d6�I�4X���e
TWMh.tḅ_Ȍ��M�8Nz�QT[$K���|3�sA���$��햌F��E��ǭ���2���%�֨r�e ,����q���+�6�^�Lk΂�>	���P��SR�'��3��}0�������3�b�nH
�$��P���lW�7[�!
�&�� f�yצe����'����[_
NS��2n��?FP:"
�vo�\9fy�|�Mq�Ct�~�P����J�7	$ګ�
J-�r�6�!׶�ߎ��f$
xu�ʶ��� ��YM
Ye�MǡV.�OΟ���S�uK��0=�*�E~}I87YRϞ*�gNwˤsz@�-p�7�N��#�L�t#y�V�-�3x���v+J`���0��W�
���T�t
eԶ����!�Kr{����	ܭˬ;�-�f�߷1T��H�a�V?
�ju綦�%��6�%x+�b�'�*�4W\�}/7�!�Ï���
�
2��ä��hݓbFT�
U �1'/�K;4�����vT+�ؒ�|��ʤo�Ϩet�5CLݿ���f	.�o���oB�
�T�qO�Qriq
Bv#����
+=fII���E��%>-�&�m���_��1��+��b��}!9ʶy�8�jtc�l���x��

*Ag��~+l[����z��-k�t�1q�Q
z哺[^.C�9������yTz������~�`���;�ݑ�G*���=����������%��3�6�2%w-jD�>
�&"���)�Y�@
���A���A�tŘ
H���!�A���"Zzʝ�!*�
	dBjc_s[4]�e� g���qJ�����h��P�+��4�^e�05���o߬
�HA�K�x^�gjx���
�{�-y񹞍ɗ��Q�BKQ` T8�1 ��Z��Đ�aBĆ����"�����eB�7�s^+(����3�Gq����Ta�
����L��K��(���^n�tD�rmaX�:�x��dyԆ̿�>�j�L^Ą���>�X�JL�J������@3ѯ�Zƥ����^6
�y�4�n�t
�����:C�ȴ'+�U��o����YȐ:��ChFǵK1ë[��W?�pv��{҉B�e
-δ< 
#���a.�:%���o�+���A�rr�
�T-�@�8x�
+��x�Ɣm���0�H7���h����c(�@��� ���"�9���k�b��KǼY�����{~��D}Ń�1�=�%����
D) �
+endstream
+endobj
+3484 0 obj <<
+/Type /FontDescriptor
+/FontName /MBKJVL+NimbusRomNo9L-Medi
+/Flags 4
+/FontBBox [-168 -341 1000 960]
+/Ascent 690
+/CapHeight 690
+/Descent -209
+/ItalicAngle 0
+/StemV 140
+/XHeight 461
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/a/b/c/comma/d/e/eight/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/r/s/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3483 0 R
+>> endobj
+3485 0 obj <<
+/Length1 1642
+/Length2 10160
+/Length3 0
+/Length 11011     
+/Filter /FlateDecode
+>>
+stream
+xڭweT��-��	w� �]��C�t�$�	������	�!���}�9�ν�gf~t���]������Z/=����5�(�ع9��j 'K7�&�I
"�®
+�)�,
/?=��+���e,`@a�
� ��� ����0��gOW��

���������/�_. K�"/�P�-����t�8;����v���6 G @������<�I^M ]_�Pw�tYT at V@0�
���
�q XA�֠�Z�r�pIB �3�
+��:�����N (�� �l]-���;�A  �����_��m ��
+y�pz�^��!P���
�dU���G�0;
�_��� �y�X������
�

+� �� ��W.K �uv��|��B��
+��
7(l��
+� �@[
WkG �B�������O���������h��^�Q:�p`p�䴂���18��E�
�������?1w�������0�aa
;z��6�j�KJ �Oe��=��$�_�E�������z�����S˹9:�Y8�
�?�
�e�X�/���kٸ9��7 ��'��	���_����
�EKA
��
��$��E
vn~��AP9��Z
���X8�\��v
�5�����ݾqq��m�r ���?  ���x����9u�U��Y��M�����D��=�����IOb������ 
 ov��R�yy� BB !>��Oֿy��uV����< F\
\\܀����u2�7Y����҂Y��_��?
�Vn��/b��^�����=�V��+�`�Ԍ4X5iN���Q�7n����:��|�JH�_�u�r���q�Ϲ��m%���o$��]��?yo|h����W�޲�r�c��֋�>�UYC2������4��B1���v|��O��ODw��k�RC܎WGP]p�!a����wh�����{��5;�^Ă�7�:�i�zQg��|�����R�c� x���L,�� [...]
Ss�(Sp�
�U��O�]�<!jG�=\���՟gl\�?]K�H�$TC~�3h�RxK�V_n<Ӥ��jO�Q%jF�?��Q���
x߼�L�q�,
+	!�Xm�a�Qr2�v�$1n���6�I�0��ޗh	�@U+,m�?bRN�A@����g�o'�em�L�7?�&� ���#��
|}z�;�k�#�$�W=���q�*��2�o�IzUK:,�������]zT�l�
V��&���J�ӷk��`ߗχd'��l��H����S�1>c� �/����g+�x��i����G��'o(�-bJ��f����
4�L�cR�0�g�E�$esj���+0���H����߿)�M���J���V}Q�o�B�ٽZHB=�ys����6<� O�y����
�3��=���<=MI��И�8�b1МP�iA����b�r;����n���i2M}�n�5=�χ"c�
�;Gq(��[�6��#[@0d
�M�*_�?��(܆x������4"f��?�ܾ
���nJ�|�-C�]|�ų)����4�</���'S�m���^1eT�&�Ӑq y����^6�+B��%�N��g�����Q'�|.:���(b�ǥl_�F��3Y� [...]
+cɾ;��گsI*p�0nX� ��9�6u�K��N� �[��
+9�����r�U
+e��g6x��4�
�ͭ����mnM|T(
[�!�e�M�˷Fn�a�v9Ǫ�^���RG��ZT���Y2z^+�%8_�ſt����\�F�
�������>�9��n��*cq��DFp�|�_���:��Nl�Ѿ�6����2�(8�t@&���`̯���j!����{��Hא�2�Ca�x
+�mv�2Ҭ�,7MM��u�/��}�Z{xF��0������MfF||��ۜ��w׍�6�
�t���O�[}���F���`\��3oDq�T�72��X��m�2�K�ޞb6"N�&��|�����,�9{{L}'-CM��`Udn��O����n�������Þ]U���宥�(gہ�G�([x�G���Z��uj-�8M�
+y�CܟzR3�n�c
�P�
i�,a�&1L�Fi�Ғ6�	��Kĵ�yR�FK2iu;%��
�nז�|R?�,(�a+W3��=š��>>q�Dcc��d"�K!zgԁ�K)K(p
o���"J���f5(�4�
S&�l���A�S�����F#f�gu>VY���Y�0���N���
u1��G��'�$��Ea_,��r��,*�!�?ÌF{���9�>�xW����
 ��i��/�p5��'���)sux4С%�&��u��M]G2�¡8G
�4C+k%-z�9�Dv
�l<s1��?���:}-vL�<�;�P�����$��[� �ù,�N��=�����w�sS�r��r�1欙���.��R�|��{"���j�q$��,sa��)>����+�4�(85�NL���<�����e�
��1��i1`Q
��O)Y��
�t���r6��d��"Ta��7��[L�M�J�p���ޖF]�� S.�OVW��4�G�]x�q(F�2Ԁ��L�"�
J�xb�$
+������Ew�P�k�-f�
+=G����C��Ko�ߡ�Z�n�%VX�񚡭
���\�+{ÊoOz�5��ֿ��4

C�3}:[�P.>��E;�5w_��	�P$f0�1�ү�1õh�!���BY�I�
S�7��~��ɚ�E��
�#-G�ח��'�|\�
��!�I��ؙT�Z� Bۋ��"I�����du[t�c�t�:���=�+B
��ޚ�`���I_eZl���#d_Ɠ������n��[�8�.Cr =��v9���;~W�0�v(�3�6_�����ԔM0�
�,��Y���W����H�F��71T,�:ߝ��ս�g�	�\@�ʶ�3uq'�|�yCw�^$�
+
�Q*sٸ*P
x;yHO��DKD�/�1
+x�j��x��e0qbe�73�|�,4��l����Y�"��l[/�U�!eRAҺ�4=��Z�����痣/mſwؾ��~����W�㼨�>�ܣ⦍����;[և %�f���-�LX�6	���ع��?�w���c.f;8__}�Ҽ!V�TR�
GB�Biv�"��C6�?�9�7�lU��L���rt*z��^�֯Pp��{0[e&X���M�,���-����TZ	�G��
0oq�n�g��F�<�nr�|N8�*���̲)۔��CY��b�ig���$[�.�
�cȬ������
+��y5C/˰�u�z3�Ou�6u;G~-����)̏I�6����D�y��Q�/
(�r���匨PD�.:dX�;wC� �K��Ւ"��a~�
Ƴ���nW��G�vY��Ը�����MX����Xˆa��V��`�
+�'
1��1�୍�e���
+i��9;}e�� #p����lhK
i܏��r�'%��,�Ԡ�%o�o�2���Í�	�
:

Dr�z\�ݞ#��R�W_&d�緇�o���������Q]O[t����|�?ِ퓰o�'K! �Z�=~H�9�b|>Q�L��jU�h}�J'KU���u�9�ql*�cU�0�
�9���-4��N�ki&5	��}`H��҃+���y�H�s���L��y���0p�ٚ-�9	DŽ����0=�H���X߉r
|�9��~�3o�ZI��q�ւ���Cs/�/Ӓ������):�E.����BQ�vzsx���;�����
�3��G�OP���M��&�t�p��3�PO���(�d������5�&Q�?�c
z����<<��=�Q(3�A��=��o�۟~�M}l}ny��iM�f����}�^�ᾨlѤML6�z�q
=1�kNZ'�^(X�gfd��p��V�:�
*�^),�\
�z�T#�V]�`K��z��js���|/y��୉���\4b��YM�3��è�Qjlaު�6ݦ[��e�
T�Sɩ:�[/{J8f��Ex~KroB����k�:n�������.v��c�
+�i���k|�q�u�W{#F*��4>�NZ1�!ț�^1XSs֍s��?EFfA9�h�����|`ۢKj%��C^�6�����m��O'B%i3�4g��i�u�tM����o[��m�
PݣzC/i�C��-��q~+ebV�2-�HWi�ig
+=$J�e��T��1�?CT�p�������ߚ�W�]X*�Eql��'���)v?�X���K�Ѳ�nr���6��/桽'.sԺ�`_fW���]oom�`�b_��'x�l*��i��΋�v%��'���nl:G,F7jY�mQ誟;�\��5g�ND1������&a?j�x�8��c �lr�n�[��,	L#���y����q��Z�&斲o-�@.A\���8
+���{����H�ǫ��^|�U��q��y��2:
���T�
+�x����Q�����l
v�g��X�
Ev&Y�����6��)�q�1R
/.��w�"��e��<��N}.�[Y�m�
�U9
k��U�f��w���}c��=$�/;p&C
>�܈�{Q���[�K{,6
�
�����4�p0VL�"b���[�e8ЪL6|��r�҂ގ2|j�خ�8P-��ު���lK�����Tk�Ѷ���ڒ�
3�xw
�>��������*`�ga]f3�r�w��]oc�o����C(���u�޶qlz��8���v�����
+���}�ݿL��p����Ƥ���a�Q���
zl��K���%bV��ѝ�6]ke���6Yh�v�����(�Ebe��[��;T�b�ze����	~�Q��w�#DZ�ݣ�wv����W`�KV��3�IR�
+$4�.8�$9oE>5lr�G�$|k�<�L�'��'�u�P��
��T��ϴBɖ#=�W
�#Ue��4��8�xp����r~u�\�����ӿ�>�n-:�>p�����˂�1���:?R�]+���n���(x��M��X
+�qF�a�i�he�6l��.��kX�U���Ek�]@��,/�;�<���b	��↡�b�wʟ>�%�}�7�=�h4�X|��L@Ā�	�S�����Q�e��#������^���ZT��a��Cy�~S���Q�$\۞sG�{�mn���tgx9 y�{K����H>"�\������L��^,l��2
��y�|�L�TV��/�TMՠ�2$��v4���4S��c>WY}M� \��c��$��nnK#����
��v��ϏT�����qcr�
c[��I;��ӕ�gb��5B�F\*Zݾ|	t0�}O5"��U�r�.D>���L�V*B*����W�-�-�Z���;1�[K�+���!��aF�H����b�m�W)�?���.'�
�
����:�~ܟ�I
��6�VAl[�G	I�
+���TSo�i���|4,g���i�I^
+�:u�fֆaC��p<\
�Q�
��J��|5��7�q\�I������p�ԋo��f]ȗ	zZ��E��p�r�%K
+;G¬�"�(��.�am4��d���@���MyE~�}
}�g��� ZebD��)�
��m
�ݚ}�|����U�N_>��8��.� �v�I:mڥh�p�f���7�
�~
v����s{�KCL����w�����L��
�q,�5n��&<Uw����xU
�K
+��0i7
~�����iQ�
�
j
+��q4<�
k��s5���I=��UXB
�����E�
+t%�O�
�z�����o�nx_߲�Í."R�[���ų�8�7C�=9�rҿ?F������x�RcC<�bXI��J����t�+l�߸:Np�Z��bJ�K�an�i�0$��Ku��Q-9�m(A�z��
��jL�a�A
�F��J`��ټ�U:%ξ��
WM�
����
+?aI���Q*I1'�@����П5<C�>�'��e���_�uK�Ԟ��q�X����
����D�YO����-�bmQ�r���-is
w��+zLn��?/��>���f�y�7�t֞'+�m�
I���FI���H�)�5��wR��
�
ًv�4�o~��(2��V�Z�7K욌
p�g�W(�^���5����N�u9�&���!z����y�.[�G�6za��<Z;�"�
��VT�P�0��.�}��Xn]VКh�g��?�I���WIͮP/�!��F�[h���,騷)�˭+��V��U��� �!���e&�N���f
�O�9��
=���sVE�b��xR�M`���I}tVbh�тn�� ���%�)*��va�g�*�k��9��'���
�k
��`>/ꀕ?����N�q�P�5+S#�+�gX?�v��K�y.��=q�7\Q�t�[rs^&o���mz�5��+.���y�&��#=�'�[7�~~nϦn�[#޷�dn�	�bDBE!Us���C���6Q�4�H=|;ن�vꏾ��N$4Ƀ���;�yx�2�]��ɻ@X3��V>n�P���Rc�;̓�:�
>�(w�\i�<-Ud���wR4:dbd:�$Y]G�q�g�P&\�'_yGLHg�?

+�
+v
+#�(��G,���;%��i�����o�@
�h���L<j���v=^f�t�p���X�8���&r;Zb�G���0�Y��QF���)Bt
��e��?�8�
+�`�Z��C���s�,00��W:X	$=L����R�-��s�-�K�|(8�Y�,ޣ�ԭ���ǒx�H�~�G�ߣ�c�0Xϴ�eҟ
�F��%�ԕ
+.
T���pBI�I�O ��*&�C}��O��=K�'�B�=�����W�f	��� �(A�Lu�Nn[��n�Pm��J3���-n�z�ֈ�_zFV> �#��k�
7��$��s"Y��q��k�������I�-�Xk�D[-L�6���*��&
:��D�G2N����H�]�07闘G���"�@uY�Ƥ��Z����؂��&�v��T�q��G���_�,6�#Y{C���쎔��?���H�Q��yn��K��V�/lF+3
\r|��W�i
+-����J
��#l��|�>
1��e2�<X��F�O�ɘ������X#��+'kRx��'3*�hq�|�˩�{�a�61�1Wofn�����4�zGCL��sYޡ��]ۓm������
w-�1��y9���y7�>��?ԅQ���*��
��W�Q7���lG�3����o$t_ǵ%r^�|˫V��8�]'a��27���jFK��;�*8�04��hS��
+!;
"Ҭ1���"����W:������U��#��|;n�(Z
���ܢ���x��F��� �I�Έx�(#%u�l�0Q���
�
���F���f?���8��-����|7��
r橯��>,p���K~IHro�
+��%���A��8��#Q�9�YK��2�>��*�95��k�_����\��ɪwk�]�In��Wq2�
�����P�Z����7�o��9n^�У(u����*E��BU0j�>�%;������ub~O�x�2��Y��j�WT��?k��/�,�������x?���R���ao;�Oї���9�X�^E��2ʻ�qۘ����0?�uE��[�9�!BY���*��&^��?vP�3 ���T�ߞ�;u�
��d{�p�
+@���Ҙ�d	�&	'�n��S�{ނ��&�<�����N볋H�R�l_��Q]؍=.K��~F `,��e4�~;��n�zy�iRҡJ�
�C�(uc��4&�Z���1��-jd�#R�l
Oϓ�o���P4�1Eue���4d2���̜�5j���Rx��u����X8�J�zFSF ���-싖�ʹ�T-*�mjÂ��XQ�������E?�
C�ͧ�Q��1�72R�
�>��E��k��G���R�Z�G�ԯף�q�����t�
<�����9�LY�
a�������jP<3�ھd�'�쮈� �?9�@I�_��D�*,yk7V��2�7q�b6��H�W~)�k����L��y؄z
.

����\���nǏ
��y9(_M��Kz�4~Vh���"GC�@�'+���T�
�ΑmBoP����f1�mM�F��X_�3�O[l�P	�_o䖈�/.KlL�P��$����o��.Q�=`�����~�Ũ�����.��sFlgZ�w;&��]>�)�
S�	2i���j���675L����
|H8}f[r�UI\��62���t_fP�TПpb�ߴ�NYA��]�6�����'��bL|�*
��>wDp>
+5z&F:{��B�O�ɧ�1(�~T����{�p�w+��4w���^�
���'��?��e`�fʈ�V�
�L}���mpOE�[a!"g�c`����yZ٬�eD�l��'��!�E�BJ!d����yO�
+��T��6A1,M
+�;�{1
��[m�Ⱦ� SvCRh��
J���
�*�0�{�o�ζ�-�&�
,�F
\
��o�_;xN�;c���GM�Xz�u���L/k�@ﲧ�yBa�̒=�hq������간<���3q��E�g��1��~k��ld9�
r��D[
+v���0
e�r����=rV������.p".c�ϥ��*'r��ہ��s	�a���M�V���nih_1��U�����6����}��Z�ߞ���)�~\X��s'׬�S�G�K�Kx��ߩQ"�Ķ������9�x.˧J�3U��A7����
�T�u
+8���y'�>
$�9-�xNi�]�:[�q>8�l6��Yj��v+C�Oj��AD�S���C�4�0��~�}�k΃e������7:"�M�0)�E�
j����
�5nV�H+ga��4�
���
L@��>�[㎯o���!A�VZ�h���Q#��m���O�iy�^����f��R��wՈ��ӆ��N4y�U��5��⽃����]��
+�~�
B��0\*��(��?�;^�Rm�+-?V�B�����[�?d�M�+�����Ax��������:?G>S��p�Wr)^�i�F�!���%1\*K�eF?�:�tc�s at n�8yu���p^�Mm
o��*;��/�Q�Sy70U���	
�p!��
+�Ȇ�S{{ H�	�@�v�E�YF����;J�a��Hrdj[�h
���)��&.SƩ6݉n?X�E
����tʅ�n�kmРY�l��jsS�5��������<����	O�G�V���%6^�
���؉��1U9}�tSĻ
J;�5ن�'j���

�y.��L��l;�]��n�p"��y�%�G��	n�c?�'�2ϗAd���#�o�������c���+�{�j��u�m>E!���g
h�$�O60��6�|%^b�ۣ��aM3ؑ��
+���%!%.�T���s�v���������]/bp����Sm���!&"ɕ��
+·�j�Ф��0cɼ����0
��U�4�K�y�Zt4�V��L��[����� ��cF�
�[R�e��4�
�	y�0�?S}[�|��
2Ќ�}��HGp����T�aS+��ô��X��Ce#F>��A�[��`��E�d#�Zi��:v�M7vt�9U�A�߫�hpg Ĭ(Vuq��V)���Ձ�(3��!]�@cP�'��wD�Nj�?�?��z��
�n]BQ��h��E�%��J"39�B
R݉
��g"��
h���>��s�1r�qY�9i���}oL,�B��Y)iF�aݷw
�2��TT^�n���-L?'6\v�&�z�>�8�`	�B�)�x�FH#G|�
W|�'�0��3��OyG�G2Q�͸�����t�h�$�# |h�[r��q}��������q��xJc=�CI�[���B�D-�+6�t����[���Vƀ�m�;waЙ��JG�
��W�
+X�e	�B#5��[��-���}ӅAk��R�Ѽlى�����܋uV��%p�ǧ7x
+
ehh'3��m*ɳݲ�7$�"���EB���-�Z,_�T�E�����|0v��:��d��,��]�C��׎p[�Y2��0ߎ�D�����/�B�0R^�n�wv�.�M��U�0�c"6�	�U68�wD�ǹA�0;����O���]�i�ʪ6ĉ�ռ�
N#��
$�
��W���j��-��x�Ͱ�eO{���Ud��G�Q 8��hC�$3�^tF�5�l��$��aoB�4{e�X�����L��>vC4]���	F�8�K8��;�Y
�}R��^`'�qj�
�;�"�5c�<�\
�_�?)G]�[���
%`�
��g�XC�88�Osll�Q��������7*O�MUt�m
+��I�����N���ș�[v
���^��n?�xNJ���/M4�F��	+Cp�f�֤�y)S
��~B�͔sa�_�������H�~k�
M"w(A{u�`�_���z�!�z̀0Z0�j̮a��Maf~q��۱9&��?R�]�-
5@�@_���W/?\6�5���,>}���3�.�ء�_Qv��b4��C�m�<kP�K*�n
G���-���;j���S��[b�%b�ah2�E�9�V�{_� zч
���C��	M��t�j�e��-��[���5�5`1�9C�g�A�)�N�Q-�s�C�}���i)�6�
+1��o�V�M�sI4�e<�
��P[%c˭w�e��Z惢Z��
���L�b����P�B���@��5�k�N4N^���"�5��
a�lF2=^�C�u�fs��F�6&L�Q�[cq��u�.�u�h�j�Rp��ej�-���^8U�%�y��u%&�x�
�r��U�Z
O
��W at +T�=���o�-�?��J
+endstream
+endobj
+3486 0 obj <<
+/Type /FontDescriptor
+/FontName /UTIMSX+NimbusRomNo9L-MediItal
+/Flags 4
+/FontBBox [-200 -324 996 964]
+/Ascent 688
+/CapHeight 688
+/Descent -209
+/ItalicAngle -15
+/StemV 120
+/XHeight 462
+/CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/a/eight/four/n/one/six/three/two/underscore/y)
+/FontFile 3485 0 R
+>> endobj
+3487 0 obj <<
+/Length1 1630
+/Length2 19992
+/Length3 0
+/Length 20838     
+/Filter /FlateDecode
+>>
+stream
+xڬ�ctfm�&Wl�۶mT�<���m۶m۶mW�S�����c��?���cM]׼'��2����!@��Ɖ�����P�����Q��ZΖS�V	`�L�W�
+MF&� 0p2��1pp��	E F�LL������d�¶v��fN��J���4���Dž���?,#
�Mm��qX��Yl��B�_* �Nf Bs+ �������8!���*�8��``E��lhenD(cn�qP��:Z�[ 4��16��5G��X�����v #�a 7#��?&B;�������BsGBS��3p�%4�1�r6����z�d�`������/�����������߬
+"b�������܎�̈́�&=�m���i�_��0�N�6��N 7�r��
�
����
f�`��2�
�mL��B��������/�_���}�/���Y��+��_^��s'G��	
4#�ߜFNs���@���+�6&���
��;������Q��3��00���r'4�@���:�MIH��2���
����B�������������
+-�le%g`�w�}c�
¿w�P��Cce����1�6�r�?E�Wou����?�I:�
����_j���4w3w+�;��X��ٿ�6� +s�_n�5VBZF��bS137������ 6�����t��~z-	5IE5��́�����EpRq��[���F���
+��	ٺz�2�q�2q0�}
�db���I�/ ���e
�
���훁�_����?%��#jcdk���(;��ݶ����l�����
��]����� � F�k˶F܁�iN�9Ó"��{A���JT
+�}�m{|RCw9+�?j������ܗ��>���F{ѭ�{��y��I(��~v�S�����]�Gz�,��i�1�
�M**�@�Mw0;@����%q��E%}���6J��A�DlB�-8���p��|pldx�����:;��� �;�(��]����
�ͅݱr)�E�)A���}ٙ��)z�1���[��A`�0F��:$&��0���`\xFEJ��sY�b�m����+�2c�3�
�1bY<���u�
I�B at bp1C+8�XB��1MQS-�w�����L�>B��w�<qO�(J���7>$o7P�J�@]օ�0�9(m�k��=����E0�E��7�2�h�}
l��Ft��)����5���M�]H5���d�oX!H[֍\��9d^I�-=���SEY����gN���� ��5%���J�����r�Y��.>�
k�i~E�j�V�d�
%g��'r�e>߰���t�W�K
�
v
��_�
�E�~ң7e�:��ր�'��Њ��eR��.j
c���#�1��C�
D�$��u3��.�'�����K�RlnN�A��g�so�g0��\��]C���
D�Fr�Y���Q5�z20��_�b�N�[�������L��-@�L=�[ڋ��Jܘ�Bc�G��H&K�����/�T/ȭ�Q
���-���)_�YH����QQ�A�P���<��
�X	S/0{_Q �8Wn�����9^�6��U��ņ�Q���
�e/R��>fÔ�ς��R�� ��{o�/OԆ�
+
xLN'�L&H���H�8�~�,g5XkQ��R~!�7UWJ�����f����̘�tS�gja���f[�?`K䓹V��|�ʯ�d�Oo���1r%�G�_w(Q(��z��v��A����F5:�p��G�8|1u��O��2��8*L�i�J����߶�S	UL���l�����o1o��MxS��8���h����e�AA��,pif��W#�gkY�Y�R��
�	g�ꌇ

�`
qs0B
�
�e3�MU
N�^�Q��j�A�<���Ol��r[3��Х��:���Ш�L�E|	�FNp���H'�	�Lf�㿼p�"NTB�s{�F���R�auD��ϦZ�=C��K^܉wm�
��
��K����)
SN�)�
�!���'l�
�x�
�s.���X�=
V��*��R�����.����'�{r�
�ew
+�%�\ߝ�ٟ}��;�2ټ.o�.�6X>�,�������}��s��f%c�u��Zk
B�����_�ԩ-���R�"@���0R
.���f
ḇ1�Z=f�0�����b6}��~e�o�WM�;�q%����`�`��¥-�ƙ�Ѕ�؏q����!��{��a�g� ��X���~�Ј5�n�s��k��Sˆ�G�ּ8�2�
+{��j��b���n�c�8�-��Ϩdp}��Aӄ;����OԪ=�T��E\N���Ϥ	bg��{�j����{1 �F�Wh�j
�v7p��
+i߳Y��*����1«

��zRh"��c�]>��KՅ*��7b���’&0���7c���qw�to��)�.KZc�hNI2@�.��Sg���y��ĩA
+�E��ih�(����)��Cן|���Co���	�W|u=*��ƾVrq���.�_�\
DME�
ۄ~f�rX�'ox��=4�LS�򛐂N��+ݨ�o�
+	���)�1F��9b��
���������݇��!�ӣ⺴#���NPêl���y���x7��ވ���������LI�4XXI�&��}!�tQ^ڪU
i0a$%oS9�X�����-v���`������Ƅ�!���Sq�I5>�
e��ѥ�,ڟ��Rw�].aD���Y��ƸS���-xd�@ǩ���Ö���ګ~2��s3��
��b����KO�j%u}��Qnr �BK8X2��- Ý����ד�ic�͑(��-5l��P�2i�
ا'�B���kC>��4<J
@���O��U��ZHqUS*4@™d�U�|�3�[e�ٔ�a�1��)�l�_j�
��� ����I_��$��"�`��麙b�^ӈ7�]m
+I�/tK2�׋q���/ߴXe�ݺƏ��i�ED�j�jrƳLt	���_
W
�����&h�*��
K�:��aB��qF�z4Lf��S��kM�*-�!I�/�
5x�p�?(,��}q�D�T�����
�/LY��Ci�l�p
����
����D��~c���$�;֡�+�}�
+c�*4�R{�)M#0���k����y
ļ�Q��u-��eh؋��C6�3��}P߉�#�|�m4d�6\�h�S=�݃`X���c%c�ˇ
ȠX[�����w�N����r��H��KE�+ò�"���*�;�U��o���j��l�YF-��}9��
�`G���
T�je-	��R��MK��!n�2�c�
�
Q[Z�Ů&:��k�z�FS����e~��v#�$`�,"~Ė��[J����g&�yA�8��6���Q:��Z\v��V,���� �%�:l�F�A��[��:q���S/j�M�i�_����
y�֭�P�O��l�
6��IZ?�P��O
�P��f�
+�?�JioϿ�W�Ic�~�l���վ2��C�xT/�j'�$���
�u-4�:1A�{Ls�[��?�3���~�	�A���{���R����
+=���� �ʰ�l��az�UA���jC��ђ�<''�1
5��0��"vS�ʣ�Xu���$t!��OJ�
+h��z�t��P3
@o�F��n.�i����4]
}������N'�^>���;o�:�����3��9�%1��rV*Y�O���+$��, ����P
��]�����rrO*
�z��'��r{���fɸ;�"�l��I��&�zhcn.��j�M�b�!f�<�Cn�sr�gB�
ҽ�/ĺ�U�F��F�� ����r�
7(wkN�g�̽x�\�)�o ����P
9Iر�dR�f:��
/nP���I��\����!� ��w�Ww�s��L�;衲C��Ȫ� �C�֚�f�^���9�=d)�zu���דC<FZH�e��
^�um�����A�I��
��t:b~�i^ߏKK�7[+2�Q'����ـ����$#7+��[�Br	@�{ˠ�w�%�����7[�IF/s�
Q��"����aE�b�U]��=�������G\��+�o�
lb��H��$��"3��2�m :��� gA�|WHf���\F�Ÿy(��/?F�9�l h7	 ���Q����%�n��
Ҧΐlg_<�P�nb�R��ؒ�w98�qX)�"9�L����e�H�'�h�8lh3�O���D����GB�����a�/�Мs���L�HυA��ry������PLʮqf��D#�H��=1{��
�l?�Ϛ L�s�?�_2~�r�h��8w��$���m{�+?n=�,:�'�zߚ�ؗ�˲X�^�����H|�
:� u|�6f��6�s}����]U�O�7 [...]
��Y�m
�XkT\¢�[� ����u�ʚ��k-�h����a�{a�I�L�&B�8��L��W�,H_�ɹ���˩w�>�=�1"�}<,�'��s�����m8�(zQ�f������PS�5�2ȇ�8�妳�O�28@����
K*��~�k�bL[�5�a7ݬl�E0ڣ��M��hv:*��4r恙�-.\�R��(9�)�D��V��g�� �w9O}����/ȕp��AN��J�����"�^�@�:�&r��
YO
�#"�$f ���>nR x��0�_{����?�\U2��	��pF��AL�=~~�8������FՐ�Z�g��G'�Xo:;HA���L�[�z���ƱO�&�����s�L�Uۯ��#Qy��<���ߤ��/�j����r2��umTb�Hź⊔��A��
OS�w����	��eiI5<//�y2������9���]`�	��n31$%��'V/�f�NW�E<�.�^�]��Hɇ��Яxr�pVKw��ڋ�4,$�<���CǤH��O
%�~�����b�S_���
U�u$-���"��`;g�aѪ��y �fUyf�,Wy�k|U�#�
+�.��2�U�=��q���#rn��UQ!v♟��
I��|B�N��$�{��D{c5��3��F�L �qC\\���b��TDWU7�E�F�O�Q�T�-�,�mͷ�����+�~-�˲��b�ME�9N5B��u�+�~I��N�r)+�b]�,#��q��	��
�i���֎����'6
O��y���q�������dd����|ޠ�����F�A��Q_"/�Yސ�I�.?�k����7]��Z�_5�j'/'O

Q��pn�j�Z:���2�m�T���
+���u�o�5��H
4�i�qu,.p7h��U��ՂR���6�QJ��BI�&��^�O�X��;��=Qkr���ׄ�0[kV&�4S�y��S��J���8ِ:�q�-��U/n71O�]ƨ��{+�DH�`tK��0"�)0q�y�9
�y��PB継�k�
@�T�M/

���oS{�]���}
L�
עc	�[K{R
+V���-�g��)��O�оr9ԂY��gyW�� )�?��A�)�,�1`6�29o�V
+�x�v��z�m�H�P�h<SxD��}���n�pk���
#з��V�J=P��ő�{����,]�I#�Q����j�K,p[����cD�=*j�{a�̡X͊�m����
է���Q��KN�ɢMA��_o
O
��8 /N��V�͵
V�*�:�3�yy��Y5�����vΌ��^&����}'4
���ݖ���b�D�-�O��}j�
�>ݪ0�
���J��k��o�|�v��,���N�z)���YR=1�����6��s��q��&��T�9�
렍����^����Α?��Ε�b|QQF��0�G����-z痼�;
+�A��@����Z������K�:pd��]��o��gl�&�L
+���w�
�Hcs�ڥR�$�?���B���#�kq6��~
ICm��@3��$�-�N��R��ק^��e7y嘄�*1` ��)Ž��B����XX�N�U����r���VigY�Rn����~OE\i�oBJ��*m�:"vD�8:Z���&�������'A���^�w���Z��[��f��V$����
'�_
+���5�I^� �h��uݽ��C���dpͰ+^�,0��oe�������͎�E�6��1�����������)�V�ƫ�<�]l�av�8����k�5ZWik
)
C<��"���-���R����zA�#�M�"
�E}�u3�Z2 �ʍ֌ZWգu�L��y��
+�<}��KD�05vN��Ն\��7����D���s�R�Ky��>G�;\��
=s���!�-�R�s^፮T���Tʘ�)A>��G��2#^�-���[��o��U�j�-���4X�?O8 at G�[�27U��	��/�z��-І��Fnr
���{�~�~��H\�kP�sg��
@kԋs17�*�\_٧�
+<ěn�_~Ԝ,=;4}[��	�
�-H^�f�Pk2�Ԇ��%,K���jXp��=v���ɦwۘ�3�Mt����w
��s[�
+�3^�}�ŝfF���=$o*����=��+�Z�����k�~��E>�7�O��}�^x�M�RŜI���3K��2�Wk,>B�6��*����?��N���&H^�5��Z�zi�mbW�Pfan����͒b�hnL���


b�������
��5T��c>*)ۆ����)c�V7י������;-���D)(��]L��pH���e�a��$��,c�<��m�j�XQ ��$@	�4)oy�2����$�t�V(��(�E
я���@;L���I8��=@�8䐜�`_�OP�%�"0IL
t���VKUA
+j5�
�eXnF�&7@�,�L6ǯFe���W��%�}pLʕH��'h�
+�`X����&�K���gh1D���e"������42�s,۝P�w�['��mQ�:;{S"H�b����
P��\����
$=^�5�J��B���|��
+���
蚚�i�đ���`e��Әʿu77ٲ�/4<{g
���K����M1��Q3^��3��`�
�b�yr��Q��nӦ���~?�

h�;P޺ꝟ�+��>��"e:�y�",EӢ��~�����Ͽ��ƙX5�V�0��C�d%'O��A������^d���"���:�a}�x��`��aC��z)G������[�4�̠�T4��" �67뀡B��N֡Y����xd
�����-}O��
�"�Q
̂��+Wn�i�	. �t
[�>[��&�0�@Ɂ��3pb�]Y	�^q�L�u^z�a~J-$Sz3�B��zB���d�R�}E��#}AY�Pey�R!��s�,�E��X^�*ߢ�u����d
+�b����d/-Z�Z�ר�qK��Ģ�~�aah �P>7р/��n�]~�@�'e�_Tj�ܸJB�{��²�b�I8�:��0�PR�Ƈ�X�Z�)Eg�%�p�R!mi&,�`���
B�[���~�I
�$� ��ƛyЃh��k�����bM1���Ĭ�U��٠d&������i�s@�[�ĕu����{�\��c�t������}'�Sa}؊���k����3Vc���
�ա���̋��22�K��2 u�� 
�!2A�9�w[����|
6"�v��,�I�%7!`3¨%l��V�G���'fr��aZ�j�����=�5�i�H�9�ߛ����}֭<5�iY�k��ܹG���<w��>1D�B��7b���T2��������Q��I
�C옯oP'q���zd��z<e������R
����f�����
�NIŕ;O ��cޓJ�q�0ytBp�C̴-�~GH5�H�+��w��ʶ���i(z���|_�R���݋<@���a�F_ш����#��w������0���]��|/ ESJ^'j��L����Vp?�B/�����ҍ������0Hi."��$�<W��׫�؝Z�6$�)��{|&�P��|+�Ad�S�#.�R�K��U~�t�
�s��&�@�1�ɯ
��2̯ �7/��
�y���'�(4��x��x� 7��ŜHXO�ֱQ�o�g���B��K=y
Y
+6W7
+��뢐��.��,^T�,��%�bH��ð�'a�@
s/Gˤ��\B1'�C�#���I+�
+��i�[Al
�������A2� �5ϕ�}U:��tY�|�
+��!�^�X����M��'K���p����d��
�kR�]^3~����O�s�?���ō�z,c��tK�
�-0�s;�7�
W�V
��	�GM}Y���
�CK��0����Ou}�ڝn�^e�c-}X#%�Ɛv��h��Q�q B�r"�\ca�����wDVt�Q{� �T�G˔R��S��d^�2$@�g:��HOvmoΥ� �z��%�y�
�D#�G�D!o}
cO5��?Ob~�v.XBc��!TM3���]��(�'_�/h����aE#(��,M5"n��E<t���m|�v��kO���
��8�}
p���O;�ا�U�%
���ɳ���vm`����>�AMa������Z[�����
+|�m&`���ڸŢ��sZ�ȯ���
�<����**5�g�h��F c�k��2�T�aѫ#��|�J�ۋ����'F���o�}�C�[�����n�O�r�+	`~z�_��m�X
C�l_]q�zC�B���P�=nw���&�����oH��S��tT92.a�����0A
�R��O�ޮ���r$�(��gQ��=�6��/�
���g���7X_��"���y\p̛��:��
զ�ͣ4{!��`U��L����U����HЍ��d�Y����=�9	*)|��Y/6ȶ�;q�.�Q�~2�%T5�=�Z�t�E	D�B��Y6!���P�w�=v�;��oGdp�s2��<;����
��k�Ӣ����VQ
0m��[�Y���|�}]K쒑���+�X=	�c
�>vD�nIF��!�\46���D^T�����"�v���O�SO�#���!�y��SS�z_�<�h'Q�.{�n�J_��۵]yƋ�b<�������ɍ�O"i�!��t��������?�/�΃�S�l;4+�F�5�����ܩ]�cpUGr�&_'���$m?uӽ�f�~�Xk��Cq����\���yJ�0H�k�b�
��
 8�&�-����d[��$̢���ap�(F3�8!��}‰���%T��h�� �Znې��4���~9[�����/
��-��<�4�	m��EA�#-s��4tj��y=�U,.Z�;~y�{M�e=&n�M��H�2ֈk�/8w�Nz0��Ui���An�,
�cx�Z����Qĸk$�=���<����sP
!��•ä�0��c�s��ĺ����0!f��r�Z��M^���(�<#���!@^C�%����H5���}L����z|�̟��$6 [...]
+���oB�<�XX�t=¬t���F�w��Lc��f�g����!T߈�`��I�p���h�L��2�E
�16�xξji�
~%|��G�X�6t��qĉ���S
6�(��2s~��ۏaNvY�H��F�Q	]lxj�,.��
43gav
+"�`J����wMPF����	�,
+P�1a���{@d�|j8�P�T�
�>��3�|ǏNt
8v=C;;����i,�h�V���"<����մ�4iT
+)����)6燋�/�ۑ���@�څ�GP�)�Z������������4��_@^�ֳ��\]ȉH+{Q&Uo
��4�@r�^
�&����6��c����1�/f'���o��/ O���V�]U�s�E��oK��
��v�k86 ��F9
N7--RHޣ��5�I7�qV)	6}���m������	��9�Y���
��&niY=�yTC��~B*L�Zd<_�<��S�چ�Y,�>�k 5P�f�w
0:[�̄�����E�ln̦�>w,�b"�S|���#
WP���a�
(�e�m1uK�X�,޳��3+Q��U} ���z9��4QQ�w� �J�j�q�nj����6�M+��_|m2{h��J��w���Fb�x���a;^a�A�?sF5<�di�D�87����x�-�P=�s^ 6��Q>���R��5�/6�ez�܎A�@#k�*b��zd�I��"|V	V�W��.�!	�GL��%�8�b `1͆��b
+L��w� )�d�v�4�1/�%�V���OP��VP7�3�c����0q7z��o*
П�f
+v�K_�F6��=,>��Xͭ�r����V��>��|h�@��[�I~p���+�Ʀ�i����qE�;�����E��PD��T���9a�!��kA��ٕ*�1�6�/#3�nF�x�>�1I!��:,���
8�vS�]K���h��>���Y����2v�Ϻ�)#$���8������'��6(o!���o�����7��������B,�	%6 �
ʦ@�Wn~��M�q���UW��7��
n�7]��V ��UO�=�w�^p�yf�x���wX�}w!�lľk��E>��ɛ�g��������8��te��u��M�ޜ�`�1�Q#J/:�}�rʬ�!��p#��ґe
+����c���蟟D�lj�jp:���k��ݬB=���9O9]�E��4R�*D�Az��?�=�:��{�#䘤?�C��9����`n_���m����r�[�֠&Lۥ�^4iB,f$����i
yh
^m�u�i^ߓ~��B��V�
+�pX��0
m>� ��N���]e�2�hƜ �.�v��3��ӫA���ɱH���"���L�v�;M{���b]A+��Yԥ��ہv;���6��Uꛑ�O�$d�&�
�/�d9T3�������ʟ
���գ����l���ls�-�d�/H�&�`��Z�r�m]�lꎿ�\�����AջΑ��5����{����3~������'%��?�}�eh��C��5VC��ڔ���YP�����?�~n�F��������GңU�׭;�d�����B?Z�pU~�Y��f�������B�
3��gG	E�m��
Ć�\rT,¥F Ǭ�R�?�E�c��0��b�v
B����P�ǻ���^���K��<5U����4������.`���������e�K�&-BG=��%ݯ�<��~s
�Jؓd�!�
����_�[;��
�p�:MpQ6
+�
�3��7C͓��u��
<r*Ņۂ?�\
�������C6�
�!�4�/
�'�Ms�`(���{�q<���;���\C
oϜƪ�>N�ϊ�uOM�
ESyU���i��4�-<G�|j�_�z#B�c��<1�I@�V2�a	�b �D"�#�K�-�x鰐�d�x�(
+���쵼�3�n�Y���_j�&����Ҏ��|���4�AVW��������L��DSi�sW��>ܻw6�]�F#�M��9��9)ߡ��׏�0�Ԗ�
۹:X�]HL(��
!ַ�N^��,j(�5	K��%��6)X_��no�[�qCkh�V2)��P���!^�q�N�D���|��%/+�U���.�mK��0��_C�E�h���?��ܞ�e�K
�b��æ%iC�S$�L���w�9u<&��L�?I�',��(`K�Jg�=����׏C�.˄G����Z�:���̰����}
éq��c/���6�����0��
����%�N�m��[ ��,���ԑ>-��犛�@���F�����!�>�gv'# ���*
I�a7 K��N�н�Wn�W@;������vc
��g�$��("
Ps����� +�b(�
��k�N+,�jyi7D�t4"=_Z��Wo �֍
X�'�}���f?ds��ρ��߬Ւ��>+v�˩	[Y�m�γ?�iڅ�8ɗFJ	�
���ˈ�DU)T--���c���Ä֐ҋ� ^\
�	���׉_
|��j<�p
k�����<������#�$z҆j$�[}p��yA� 
U�h�����:k��?

l"V>^�D�
�
O�[�Mݸ����(o�d�T-���>ug'��
M�u€�O��ЎY�G�Θ�r� ׶h���2p�[�1��/��F{~E�3�]�ȝ�qFzC�������}a� [...]
e��"2���#s�����[��"
{0�������cj�+I,
D44�ixG�+@(�X���Hˮ��P�'�4X��}h��T(�����6sR�Y��bNu��}a���
����`#�~\�[�֯/!=}��F�T�4��Ѭ)'��
���wP��#Lj��B��"p>P�+��}3z��AL:���j
#�K
�0����O��
+���7#>���
y��a�>����G��[W�
+�a�Q��^�\�cv�à'`|������J�|�,4�^O�P�D�Q���1!�NΊW.MI}!�8%�7"�}�l�!)���
+8����:�
�*����4Tg]��K-7��Ǧܺ�g.8|���G�&t
��;6��ez��F1��_�f��m�`.A�8D?b;��,��'}�<�4u4�a���S=^��(�1������&����������eLx��c�=6���S�.t��u�uC�2
$�B/�ߋ.
A$Q�����z,�5�0
�K���\\�
\X�ܙ���r��
�S��tuy��]J?�q�n��⨒

��F��obz����M�4�Ze�#if7��M�Q9K�
O���^�53�`���yts�M�AA�9
+��,�‘P:v���q$[�:R�&N�h�]S��Q������~k���9U��3S[H}qwrʂ��Jn��d>z�
m��K
EA��y��j�cl�y>���q���,�c�7�3�s�Ү��ؐ�m�Eg�DW�h�#�"�,��@i�<�ϴ
��G9\k}J<����������ǙI�
%i-[��Fv�
����g�������R����{-�(f��^*�@���*�3�uSl��s�$J(���F<y�&,�6���`k-2�7=�,��0�r(C�	�
J���ayn=f��������8f�
����=�q��
+;��o�����%e
/+
3�F+݇�d�B��Z
�^r�ƈ�5�Γ|RC7�cs>�Y���}��
@���ԱXL=�
z�����/ 
b�*Q`n1m��Iݎ���3�\~BL���{�C1BFIF
J���,�I at W9��>����ΟR�N
g�f�I�
<�Q®͝�?�y%p��%���#�i���a�7�c�N*�ʆ�
+r�����e����`�9r��t�
���q�mj��r�Fd܂U�:��~=���2[2f�_�LG�
��RN��d��/s����ջ�Д��Tp�wy��l����7�եp�ГMn܆�e<�f{�s	���ϟ�\>˨���|�7�6
�%�^��CY:�gfz��P<�=v���i��8Ds�\��s��"c&k㟼�K�YJw}txiJ�eg�^�̞)�v��q�J�4
G�tR�9��4�٢S�8(W����<)â�Br,򨕜QO )�.2;>3��ূ�!.-e�����~�YY

�^c���뽌��^�JO %�\��hA;��~�"Y����U���mt�@
+{�R���
�0���e�����C+�]7�y;����U�[�2���Mb`�+Lv��E4˚�0��T-.�o`�va٭��[|���I��!ye����t�(�j�p���������9)�|�D��*u~y1(��ry�
S?%�r�i�ZID��h�U�)7
���^�q����\v{�Ȥ��r2��U�Z��s"�	�
���~����
+���k[�
�
��
�_V
��6<;�J#�Z��F,0��VOGMaU�`7���M��(˯:2i#����>��z��`��
�;��.�* �t{
ڔ��c)YfC��c�	��e�s���,[�S"�^�PD�\�0.I�������?�2�ƒ�{�سa�
��d���<��a-�s� � �D�	|� ���=���iŋ�^��3~l��[���
�"��5Ι�)�nM�Ǡ�\�W;�4+Z�U����
�el�����o
(23\��/��j 
+a%� Pʆ�Ϙ��_���3�:�x��Зj_
+A]�q.�oQ�o
�DTG�'��;�t#-
�m�A��f��@
�{��Do ~�� �= �aA1$'��;�V_��QA��}�@H�&4���h��hI&m];�;����}F�hy|�*+���P�T��@����@����n
�šm��4Ni�$-|�9/�s�Z_{��"fP5 z��
��s�JNd"�E�u�Z��	�Ty�W�0��
�$��d� B��.v�k��YukI�����^�>����`V�WMϠ
�*,[���o���P�
cg�n�h
�2�'	Z�yU�	K���t��N,��pa
+*f����G]Kr�74�w!�_X�U'�G���K�Ͱ��Q�s���
���^���3@Г-A�:�pR0�r�\������'[,h�"�H�)66�Y3�`}p��ᣊ��X��ݠ��d�ji�����"�&��� ��
�T`%�{`����3�G
���)���
+��k��
+��
�b���^��%�
ޓ_Xsr
�F����
��Yu�nj�����K�6���"���C���nݟ��@��
-�
�ڮ
:���qkl�������
n¬lY���
l!� `w�o,��ݣ+Z��B��0X�3@�,�PcxV��4E'4j���3�K��^v�5��UL��CLN����$���`Eܣ������0 ��pWLlg7��=�P4iZw� NPQ�z
��Ԫ[5�7���֚
�����P�I�a��	�bn-
M6�Y�M���kQ'�_\k'd.�A��u�w�tl�/.��|���!<���Gԃv��~$�wY���ˉ�Ӗ?�ҕ��??zګi$4�dZ����݂%<��d���`��3�vļ������h��������y��?�.$W^��ˆ{Ч�V��ͩ��n��3�t��� @��:]��Y9�K���sլ��V���'���B�7�<��HA�*�
�<��
Ke����60N�K=�����MU�ȕ�����kT&n�ٝ�N
�4Qdԧ
���P��� �A%����5�(�]��k#� ��Puh]Lw��¼^۞���#��QSY��	��<�+� [...]
+Q2�
+`����CO(y���c>:�DN�I�lfM<�-�<8�-�+.ޯ�h��|6Ʉ9t1���g��1�ayĮ� R��Er�i#qGM��q� M�41�z�Q�U&�P�XvWA�rV��������!|<�*%F��8}2�;����)�	ډ�@��z�C�iԃO}�"j�[5�׳����:��/�R!
+��L���bS�
�!�����X�GP����f0s�4��{M�^S���	�#��͖2g5�^Z*6���c<�~���{�QPm�c��cnů�&�#�?ԍ�<�B�g�ߥ�p;V|!8q���ǹ-���
+ㅤ���"u��u4L��"�q�k���D�]B�[�
�l��A�
6��G�F�9�ÓC�
+J�7�W�?�Kt���ĚL��1SNū���Fn~A>S�b��
�q��J]
B�/lk�+&��d΍�8��)���IE�4>��suB�d����4
��M�`)���9�� `��J
+����Þ����|�}1�iS�Yl>��]� "��i��;|��a�5�۬���J�gT�	A:�i'r gw�_C�a
ְ
�l� a��n�w ,J�U)������ZR��!�;� N��~s���5��H��%}��y��/
+)HЉ�����M�����S�+���"�	���,�x.OL�����*ү �v
b0T�t�n'a
+��KJH��|%,��eaХ$���׶m�$�j��]�����%�����z�x���/nr�Y�ܺ�#knS�ty���{.���Kwp��и��F���&(�
�R��+t��P|-c3sg^�����c�+��u��hS����7�
��$���x?X��=f�XP�3X�=�4"!��!����ŭ{��-�(VOO�^�r��1~X��4V�5�֑���ET�D����m�L���EG?C���
+
{�r�k
U�`�j�-�"�.�l��ڤܑ6�Gx<yڬ��V�I>z\)�V2%�[Q�d]px���
+���u+|"�!a׶�YL�m�~
��%�T`&Y�Z�5Q�م�%�^�B.L�����I	���������a�3�	��ݟ�	^�`K����
��z�#Ce
��
`��
"};DJr�-?9M�Q�:ց�
��=�?��;u=9fzT濩==���~���",�'
W�eL�9���i��ɻ�5��?��/��nN��ma9��M��4���
=�PI����$��ELy�
�c����:�9�B$"q�!X
����h�I�TL[	DM}���ω1H��&���'_
+X#�	�^���k���8�L����a}龘C*�f��sjI����~=3��+�U�=@�>�4��W~���InY	0�I��*�:�w�A6��~��ֶ
=8��蹵zM�ke���.B��d�{�lo��8������2��7A�=���TP�s\��{��X��I����{#������em�W�}nW3�����ff�l(	�����L&�;M
`�1]s�pRC���D����m|�U�б�W~r^����3���5P�Ve�P�t!�-(2�[2��13�}��iBo�V��	Jv4F Ee�
{�l��U�R&�X�!R
�B5#�GUP��+L�|��s5����?_����zE$m!��H*�7롮gƩ�Œ��,�hT2R�
��4oB��H�ak�?��=p
+3�����
�wɱ
��O��M����������IÇ��΃J�tE���㮗˖�ao�rf��Ϗ#ۻ
+F��������ն^腲�

+�8zUR4�$ɇ-^qm�*�K�@4q���M1L�t_:
+�^W�~����ɏ?眯�$���ߠ�h:
�O��ޜE���W#�'5\k/�������
�Sg��Ë~�_�q��b��V�K
+ƢӅzC 
��B���p&�
L��
�c�/�5	W�3f�xs[L
\��\0n��u�:!d��8
zi8̢��9�^�H!�s�z U�r2��}�q�k�F*��>�&�B�L��Hۀ�=�_CQ6��m����eTcP�.�x�M�"}d��6��#�D�k,���K\�����ݕܵ
º?Yb at w�*ݥ
ȘLe
��K7��ryM��\^�j���&v/c��(�L���;
��A-Ia�\�v���Jw�X����#�~G��К`M|7�^�w(��QR8�63�6Hq��B���F�8֞��]70��΁Z~����zH��:=�U����U�r��D��uC8w[�#[>Qwy�f,0c�
�^`"�g���_��dX��
�J�Դ%실Y
�U����(�EE�۵m?�a���
�#K1NᎹ�Y�8c��Jc����jW��l,ma"�\� bDl.�y
���s�D�ϻM�tea�͛��j'W���hOd�B#��>��|�J+��Y?�y�<�t��4�*�S���1�D�
�ON�t���S%�7Y��I��C��T��񔛠])mV3j�X�r-��F�R!���)"�K�S����m���GQ�z�[�$�	�n|:����*�
�s�-
+�
+���
�}g7$︦��kF<F��e���+H�[6d�/�%�
+Ή���
���^<�&�G}"��81��L2�]�
+3�+DU�gz���8���r�j4�l������bA�E2�o�ո�ǎ��o3�݉�
��
;�Dԙ�ƭE���qȭ��p�/R�q�%���ubf_({pdy�����hb-�fF��3��<ͣO#��+��<��
�<em8g�]p��s�����Q,���o������'��
�)���
+��K���Z�4VT���B�N	ם�lm���\��H(�%�.*R�����κn
��*[T%��H􉶡���@-�9�V�yL�o���kh��pm��
k��A��1+?ϖ�'��ΝY(^�oϕ�i/A��/h
�o��n�U
+��@���\h�1lnڐ�T�d2��1i����;?/�n�I� c(�ZZ-H����H?+z5��å���&ۇ����#�Ӛռ~k����3��,s���e��}o�
����;��AX�b>��|'��b�͇{_��v�.�kϙ9ů��g�,
"
K����Z�/򵔱��d
c� ��b�tJ��k��vꪌmb�&���'_�n�`
�$0DFtñJ�Y�6ˎ���>�}`���G����@uI�˃r
-P4��~���
+U���7!@b�<Z�-��?�#�Zx U��K'~`EA���J���Bu��z?�
�2�<fKS�U���"d����:<�,��0ۘ
!G'1����>�V�5M&Z�~*�\�N��U,�ږ�����l�o�t�^�.��~̘�2�iW]�4P-d� �C4=�5�S���7�u�^7\�R�3S�M
DZ%��H�j��mG��Z^z�֤#�ڎ''������B�!���Q�K)�M��p�L&�V��MA�`������z�Sdӌ�2�6��9��;�	[ä�@�E���"w�F
&-�+�:Oi~y�R��3�~)�3l
J�^��x
�,K]����R3"*����Db�v+9��?2�pă#�7�$y�J�Z���`g
�E��ߩ22#&.`v��_eT�v`J-��]|�p@��r������m��Ţof�
�n?%A書զ�|Ƒ
0=����^k��nPG+��q9�_���9�?LD�����O1��qw�A��Za����
+ʴV��`���!ky�[�0��k\=�(�]Ζ�0k���8��Ӣ���
xP���9�%�&0$3,O&�ߠ���bd2�߄��|�k�o)�1��@�w\��/��kୀ����o Ҿ��u�N�W.�����i�oE�HO�nk>c0�Y�u�2���Ď�����,��U/�a�4jO}���d�8ܠ8d�2c��Ϧ�_
)�+�U
���C�M��'V�H����l��+�c3_)|0|a9}�zᦤ��
Pj�/Ma
 �����
B�?1k�Wb�|�Q�Q����W��ɺ��2w�
;]a�|����7Ϗ�*;�st&�
����
�γ�%<`
���ΨVy����P��J���Jr���d��v�ޤ_�h.C��ܣ0
6tGG�9Ǡ-쟸W��$y5a�c+e��C�B�s��	��ҍ�ՀQ�f��X�.�c�*�RF��N�^Xk���;

6�Ig����U�e���ځ�&g�R��l�Fl��'��z�+�O�f��
]�
+�x�4�~��
Ȧ����J9[w�g��ljc�Y��Wǐ��l
�asa9�
+���SM��T<"ꗵ�
 O�
�4P�j���cAH�C'p�/��0.��β,��+e�\(<��M:�Aub�>HwA%\���g<l�q墂v�Mݰ��^�8�ɐ�W�i��6�@���Ba|
�p�5��a�&N�kFu*��}P����Ws��}382���$�A��b�������^�;֜�6�d���B�
^]a�D��N�[����]7
bMvv��]$k���
O��>m��c_X2T����=�-u�LP.����h�8]�%I at m^
��p�~�(oE��e����*�O�H�|���\
��,X�މ�MǛ�����V‚x���y���f��j��Rү�0�.k��g����_��Tf~�<����:ow�ʑ��8��4��JO��x �O:�2��K�
��P�A���q�g<� !pь��N$�
�!#�Z�>������mpH22�K�*��7B��0�����=m �*��/"���;;/�@-v	�rV�j���xA�����rs��<\e��G��ܒ~#Y'
+����

�g؍/]�!��V

k��ه�Dv�'�<N�3���g��l���E���r��!��I�U�	��k�Rx�N����PġF|�Un�w�`��ؘ�*a��~%�7�f��⯙Od
���5�o�,b�=7F���`�:��=�
��z&*Iïhu�����&
�l
��j4X�:*`����oh�;0���s�z
�1hn��u
#�T�		�d'[o�q�J�����˓77!�b�i>ed���+r
+����T��yt��Yρ_A����*0U��h����v�����5Z�
����>v��?�侷r<�}:[x1Ȁ|ҍR(�_�::EB�
%�y��o�P��t��Y���
ga+�
�R
�XOp����z
l��1I�=�b�B���C�xUN
��S}2���P:=��*��d�x
���#�0��.Q��U#(6�E�����b�Q��7`��x{baIV��@I�x�3�עL�,j�IGVB� A���ڍ
J���66����@d	bg_=�y�>uUB���� �x�Q3���0<g�b������"2;��pH5���v�Qy�N�-�M�D2[s�P����i)?��b8���4O�O�]���,-��2x#r��S�(@�
)Q���R�J�
+endstream
+endobj
+3488 0 obj <<
+/Type /FontDescriptor
+/FontName /ZHVIQV+NimbusRomNo9L-Regu
+/Flags 4
+/FontBBox [-168 -281 1000 924]
+/Ascent 678
+/CapHeight 651
+/Descent -216
+/ItalicAngle 0
+/StemV 85
+/XHeight 450
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/at/b/braceleft/braceright/bracketleft/bracketright/bullet/c/colon/comma/copyright/d/e/eight/emdash/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/quotedbl/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3487 0 R
+>> endobj
+3489 0 obj <<
+/Length1 1647
+/Length2 15562
+/Length3 0
+/Length 16423     
+/Filter /FlateDecode
+>>
+stream
+xڭ�cx�_�&
�v*�m۶S�m���
�6;��v:N:�x��<s��u�w�̜UW�u�u������_������)P���������hmo���h���#Ϡ
+�t�q3���8�((�\�&n֎�&n@^��
 4��Xxxx�( b�N�.֖Vn j
U-::�����`���_OWkK ��
@;G'{���_��kG5 �fXX�bJ�:2�R j)E
����ewS;k3�����H�pt��{0st0���4Wƿ\"� ��������
��Dp��[����
�vX��8��=7G�������?	��[8�+!'ǿ;��bɔ
]�\�\��� �*�K�;O7+�b�Z���w�;���Sҿ��4Q7kW����X�@����������ɜ\���������f@pZ����]]������t��N��V��������
����`��
+��`�ca����olKk8��E������o����`
@�
�?=C�7	sG;o�9��I���oH ���ʌ�}"�7H��"����o��W���K��z��+�������������
4&��� �g�ؙ� �8�f�W{k;����ݭ�w������!�`�W!F���]%������nfV 
����/���9�����W���_'f����[Y��:��ǿ!�����n���IBTBMI���0m��Y�oW��{;�3������Z�C%*���e`��0�r1����#+���O����Z�����
�����������\�	3G��H�����o��/�?�����_��5
�V��] �
h���h�f����ր]06-�74�>�Tެ^�=�α?03j�����>��e����{����H��x| ˎ�?
x]D�OF3�
u�����8�ɰ
1�B+��fI~B��Y�xZEհ�
�p�����&���{��R�YFS"fJ
ZC��e��'���c��w��G�t���|&�i�$�ܼ�]
��>!_=���=}ѳ>�ɂ
H3
�}^X�����Cg�E3\�׭Z�}n�
��� ����\~��
d	f�oQ���
��	�v�d5�{=��
����$��ٲ/e�~�j�h�[��InP�n���=�����
+��H)�[u�
+��'�o�l.u��J����}b��t�����0l�vah>��g�O�.��ujL�獛ߙ˪m��~��7YqĮb��/���Ԁ���czngi��.nz�*�ӋS���9^�	v���O+����p|��[W���
�O��h�{���,{g�>�4�n��n�]
]P����"0�U��M��VA
0
�\#]��+Lj-
��k��d߅���I���"�!�
�
���,�IF�"�_Ko��c?Q 
>&��"��:c�뫗I��w�^�*�'��Ӱ[$�LWo�n���d�� h�zy�������UFI� �_�h�
+��<x`K��UJ#3�7�h�jk�:ڱ)����My33�
+�Bܱ��%wvH�T��E�t���-
b�^ĭ�x
+���ߗx`�
�{�xx+�a뉬��ݦ�����}�r޵��Ǫ��X
\`��f�ķ-�]��"gC)g����E�P�B��V-_
cj@�&V$�W��y.����(��G?��z�����a��XG5Z_쯲
d�(�:DB�H��׫CYw�i�
���z�3<��?�j]�DŽ1�O�ͅv�f@�fI(�h�`
�ġ�?n��
N:��
+�V�����rm�8�AIs�e��4rc���	�f*�M/�+e�h�c_�!il��!�وJ��*!o�
�J<L��dGk�3��?z� ��x��6�}�nh��	�$�
?-�&89WU�O?V
��%lx�� ��0�	��7�y�(�k>�>’Ɖ$�̘>q�� ��-�&��m2A#��YCbY�������s�L?��T�dh���C��ᔈS
5(p���0/f���)6��-��g�PS�uk ?(z��R�,��5��S�%n?���/H���^��qZ�_=#�켆>P�ji[L)�iǗDž	��Y2��
��ؚT�τ������>.���
+��kǻ�#�Щ+�S��-x��QGiߦ�h�o���)��Ag����9�F����l
}a�Ir��Rz	\ͯrlL
Y���oKn��8���U`��ZH�q��>_��<l��/�*~��M��|�z�	�C.|`o*�eR���Gg�מBA��ѸX>�s'�3�L
��WL�-�rf/�)��{�u���uh��ͪ
����L
y��Yh���Fΰqa��s�2��*���y�)[	��1�W�2�����-����3zg��H�ls(9��_���@��/����$��.�����b\{��Q��  m'�H"�
K�+=)�E
�k?(�ݤáȞ��T��P����g��G�/���<�&
+��u�Y���{@�c����g������q�k�F;n���UBȍ�c�C ����a���ny�� �J��
+�K@[�q&����XI#��߄mG}Z� ����Vz��;u@���m��P���HeC�I�&�S0zE1sH
�`��\��lhE��P������3�*�kĈɔ���&?S9��$c;��a3O^P�-4V��)�s��
"�lH;�+�k9�

լ\��l⚷�W at U;��)�s�*��ig$�+R&�����B�+c�/0�>���F�e�O�lJ׭��>��Q}o1�e�h�:Q@�_�Y��k�?Ƅ쾹h:b���
��
+�F�	�Hsؖ�x�I���:'a�|�BM-<HN��0gc���qG�݈*��T�._�"�G
OKL�S �_៥�9lpYR�/��~I�D��e�Ǣ�|Li"��	�NtQ�d:�O�7����L�< et4��M*�۵/��
��^ n�
�c�xd�]�
�\�Qxec�
�A�<�ܢ�J�!!HbtP�DA��LAU"���,����/�C�3��i��|����.���
�nw�k��4����T�y��/�w�U����
,V>�R�������n�
�����}����j����ɛgx�5n�� �+!�8���ڢ,L/=�n�`%���u������;ۮj_�x]t<t����K�# ��G��K�j�����
+��
`FA��+�
=����^h���$4�ZP4�\�5��T�aՐ
+�����������f��"�$�q�ܜ��q� y�v���i��j޸>-�O�L��~* n�N���`�ūY%�%��?*�>����H
9�u���
���=7BK�,�E�����|G�"�}|gs,,�Q�9pWպE�J�.�M�e�:F=��p
�lE��gq*�=j�8p�Sk��SQ,Ŋ�I�׫#?�I=G���$�Ҍ�ø�
+��[ׄ_t��~���:���ȍ�o���~��Z��`ύ��	���y?� ��
i�5YjH������[@�k����J�K�K ����
��,�X/��Ӎ�n��Ѡ[,���3�Ia���{��V�0�6s��z�z4B)^��SP���3�a�[J���>�W�Ŭ��G���4Z'�Lh��(o�R_
�=ƿ+_(K�
�A߈M��V^��6�Y~��}�~{����ud�/���ulϫ��D�`''�d��׺�܁c����{���HyѤm�ؕ^Ab���X �A����;XC}\(x��������3
� �+W��˹�σ�f����#��FCxV��P���W�{�]l�5.���
+�_�����,�OO&wq��]4��b�L3�)0
3����{�)�X��.F_"N��`B׋k��(A)�!��)֧��ס�R"�U��,M]�N7�Z�q���σǦ���̧�$x,��Hï>f��-}h����E�����-&9"Dm��(�p��<�÷���Zl����v�:�}�a��Z�<�	�1f�YDk" ���K95�py��(hEh��"}&􀏞�|5��ǩ�@Vx ���q���%���:�}��'L��\�y�B �_S1Ь��f���|��K�)$%S�#�s�����YZ
I���?%�
��㮓4�&D�Q�4���^}�c�N>`��9�XÖ�%�������k�ii�oD-�
+z�80��|��ϑ��'�[\�w
R˗��%�j:���)
<�?�.G����G��Q'��(K�

������l�S[v�O��g�f{�����,�MS�]��r��w6��`�X �E��
M�i$C}q��`��f��w
�K��b���

��R��B��]����!�=W�]�v��4��[��8���x�~�H�Q�7D7���63�2�ߕm�7B��[E�'[*v?��Ǝ���5^��M���^:�U�$���e�w��
�Zw;֌��!����@o��Rl�|��&��.9��B��\���V��wxq�Zq�(�8�sc�n;
3ݤGW�Ѧsɢw�z���S����LG�+�|wd�?+�@
�H9X�
�"̒v.1��Q�Hh��.%��9Y6���xa�o�^���uM��X�4�FTʢ<;/M�T�,?����LA$�\��ظ��;�E�H���D#�8}ޚA�	(od���I�0e�W�]��Z?��
S^ٗ�_nOx�c�

+
�
+<Y	eԻp
=�Ѱ�w�+����>�+Dr�y��K�1ǂm�'�eKEiJۖy�*�Gk�!˘�oSH"�)kP�l �F�KtC������q
�`��-�&"|8R�;
�D�����׭V��ڂf�F	hk��
��Tŧ��W�K�ᦙ�0��9ؔ����;
�?Lym��μ�rO��^u�н룃�R���k�b����Aw��L�`�^�E�r	��Z��;�B�â�}������7u���Urv�R�Ip�mlw[C��o�y��d�O��׻<��I��#6
]�Xr�s�Ȧ<�0u���1t�
R�#�,
�
}��V7R�r�j��G�UBR-0�y��3Nf|�6M�|~M����c�����Dzn&�!N��Ƥe�B:����S}<�txEyO�*���J&�@	g�Z�>�J�a����OjO|ND��d��E%�
��B
�HV������
+�3�6�
�E at Ey��mn<�FZ�t�3^Ұx%?M��n
FjFf̕�p�
+tk�9�*�������a1�ɣ7��b�J�����a$WP>E>�Y�͆�?����܌`\ǔ7ĞK��E��`�hcj�)@�j�8sףyƴ���15�
(�4N���別-�r��$J�
�kC���e�'��������oUR��!#ں��p���E0���4!`'(�&a���	9����̶�)"I ��>�
��g�L�:�Uq-@�:Ņ��y��!f����qG�kS3�H��w���p�vH+����2lx
�ȼ�V�
+��Ɲht��ǓO�
��m��2�P�vA�`
lXx?1
Ɩ�����
���N^�,�64V��ך[P�*2'�Td���a��CM�4d�ګ�)j�.�7��g
+�j
v��
{����-�}� 3�������E�6�!6��\�U��D�wߝnb�5	������T��yu��_
#iM�Ց�<��
I���
��LP�$����N�Khj�
��I�Im��)�����Wi<h8ʶ��#��D��A
`~[�f�e�%�y�8@?vE���QF��&+
+���5�
��9�� �X�=�=̳���7J�?������\-�`�)K/$���`]�˭m��� Ew�k__yc�Ӟ8��I=�zjd������v���
+��Y���Sh����CH��1�Kk�Bcn�p�=붴�=1կa����>h+0
+]Y_Z
����H??��V;����}g!�m2�I޸��c�=�-�
R���?���|L8�G�c9�",Z�/Bps�8zD�P�Fn�g!����!��=`�%*.���&�e
+�=�@j�%|cԔDz
+�=0�� `�(C��6�&/�ޟפ��*ފ_��QL����#�}��G�&$¥bM���}�ᄉ<A�LZ�N3*G���zB�J
����� ���h#ʶ��n��
sC<}wDL�q���:�G���
^��_:S�:g����.�Icѽ۝r+���`�n��G��#��Úp�q菍#g�
�
�Vr9��g�{5�7�v�}�����
+���Y�
��1�/:�Y���̤��FtHi�6����
vɱ
���~9/C�Ҙᝠ�!9�ٻ�[�Nߓ����E�>0>�_YV��h
��L�����
+$����0���bn�V���r��������

�24GN�9�(c
Au?4o�E��w�~�<#��U‹{������
�v��~��u�,��(��
���v�����
�$Pq��V��G�Ӹ�"�8ܶ�{#�(���Pn�
R$������c4�X�M����xƮ��D�J�g�}K��:#��UF�(�8�|�}]
�J�雓"/T�CC#{$�7�Ӆ�ň�Q`�z��i�>�
Ծc�� �lN�E����c�Ź�[��1gi%?<|b�Hl�e�X�� 
�B_�!�jw�-ùQ��,N�K-�VqO_	XEU�8DB�ý��C���N5
+��zT��i\JS�Fc�Š%���tqh	�mz�i�
���=�����(�\���D��/	5�
c�Sq�/��0o����
fⲛ���ϣrT
��?,
ǫ쏓�}M�
��r�8���L�,�^;��fT���h�~Z"���]����|!�J���Ȇ���f���t�Y���9a��Eqgp�r]���w��Ш�
�T�j�Zk)`����$N�
��_ob��F���ٸ%�y���nW�������«�T��AG�0��?�8ű>\K��;�(޻�g
mT���>����#
z���{L�'�v��
J���#�\��T�ʇΦy���-�jk[
P�	H"8_�(������C޶wR�Gs& ��f�0"22�T��Ȫq��V$T���lk��n�i�����&�X�X���y�����
�q ��ڴ���Ǽ��γ��i}�d�/�Wb����u�������U��8���ޙ�i�+7�v�W$�|����l��D�af"�
�Y",')X�?J�
��jl2�lO�r,�j@=�.���[�חg����42��� [...]
+7�-q�G����[1�@L���;�gX�j��׼c���z*
�K�{E+�D�6Ӗ�C,/2U�/����"��oH���W�Z
� ��9H.�F��cx��˳����}GI8'Di =:HxL�~��&�b�^�
+Ez,DZ4F�f?����7�<��^=0>2�5��n>���h�C�e��hY��1�Ǣ�[�ʴ�́���а����]s��j��V��̊�����9F��R�D���n�#�A�{��&��-�'�����wlK�<�pV����^��_�x+I�-e�f��
+�VV�,��͊D�
�`�r
/G"$\]�в�ɯ���w�5�L��5��X�~z-�A
��rZWJ��P�<�d@B/�f�>�e�.I��r6bs���(��%`.ޑ�?�c����z��ʢ�dx�_�=�/i����Ԅհ�-��1Q,���o
+�;l�N�{F,�4	�j�+�.%B5'�嬂�
8

dl�"�ͷ3H�?:���5"�**a{��=�4�|�"-��k(�"���a�"\��UҐ�`�"�2?����P_�b���&:��Z�jI
A��IT&�V6�-g]@���Q��Hz��~tlQ��{
+��B����*�$|���%�3��B�ʗʁE��.�y
h����-����쭈tk
d����Z����Fk��e���=|
�U�6;�r��5�G�����,��Aǩ�w�j���B^3B5aN��z�qV�
U��!�)�cw�=E�/X�^�AWPvn�a�(l
�,�
�
MM{[AtW��qS��r�@��:��
YҖ�]b�d��O����oo��C>���j
�o蛂��*��xxA�
��Z‚[��r�)vvqn�N�Ϋ��铤/�..�bfv�sׅ��O���\R�/��	�r+��+?�L��8�l��*�w�X
Վ����կ�œ4|;��&T���Y�dx*�Bt��- at P�=d-j�q��HV����)���Gk]D�N
E$���i���;����O���vgc
%u���ϛ
E()��z�#��(��p��
+7�y4}|��bC bw�,NX�Zi'ZR���o��G��-�a0HГ �}Q��͂�k]'=�E��� �a
���'dq��
��PC�#��
9M7��:.��yh
V�!d缠�C���m�GN��2��t�S���J�0S����(v�e�v[mD,���
���ݡ|/g�T��O��(��?z�'s�'��.O�����:�d��5T5.�dn@���y�<�Գj-����
/�r��.B*
w��b�����O%�����]
�sk&E��U���4z���h̽T���8��	IC��i�5[L
�B%�n��S��{[8���Y'�a��/ѯ�Q��>ĂB
���'�����HfdN4�pw�]i\v�%l�0H�(��L�{_Pͯ��S�0W�^��S֌��L$wd�]Z��s��Q4��5,�*��/�-�$Y^&WK>�����ݨ&`���
3ܲ&j�
�	me���^�T*aM��n��a��?ApB��p�~�Y����^ L2m$|L�*
+|
L=�:�s
�KdU�w\��M�,�]��K� ��|��
�y�\��D��Oy6���j���d��g��G
!�7
+���8��t�>�hn�]��R�|�FchibI�U��A�m�
+�6TlG�@L�i��#�(x�>嚲A�.a���X�! C+[5C���gl�_���Lw
+��w.��?�䭇�
�W�h���PD�!��ڥC]+`�ѧ�c~E����������"w:���U��o���5�o�7,G���xpVR���%�D,F4(6�~)�p�a⡷{c��H0){�5�߯C4_��B����[
��cI6��4TK|e���jq�}��h�X@>`�
���`�H`"j䠘�H�mc�=I��n�8u�1�m�0�Yi�G=��G�uo)+�-��
FU�
+��?$4Oo��ą�v�yU�����W����UT�b�r�u�����ԥZ�j{q?��7����0^j�$�.��)�3h�Ơ簎�Z�E|S1��iҹp�'gYF�}:��n�%���u��25LG���[i1l�J�9�8�d��e������=���`�½醶�¡l���̹���6��Jԛ}r&�	��3�����\�b�{������('�Pxs��X�yf�3�;uOe-�{b}l�\�%�_
��
�����
�T����-���
h����p��іkÀŨ�h.X�܇��qiWj#H��(A��E���+��Y=�5��{
�dų���kğ��0�XDnG��	�t	��b�:/c&�4�%���\�9vɭ*c��*�c�������&� \��<���I����+�����zQ
Z�̌d4?�E���;���x���Z�PO�X86��Q
���x ��
؃}5�&%��J!1�9��[I/�.����:��Wh�~X��^�S�Q���h�3�$��7E������!���1e
�����2�:�n� a
+?ⓇgT�j��@dߞ�c� ��Hǩ���
�]��V�
{p���2��P���M-�
֠�r:v(LV��b=[�=9`J�H@)�@$�e�7�&T"��w7h
+���i�B$�z"�0OaG���Q%X<��0���S\
��
�Q�q�
'�����;f
?kh
�
Q���Kh���xRa(��Ƣ$��,.u3�����v\m��W'&�v�/�Q�aoq����
-���	�}���
+��@�I�
*���o�9�\���6

��':�8
+a�kv�u�"�A-�==1Q��XR�2O�4�ѩ�44&�&s�3Y�
��'J0b��Ά&�\�DJ٘S�5JO�x��_	�t#ꮝ��[wQ>
���R��ϩ��{G�!GY�⚞m� d)pL��s=g?MT�C��쨨Z�P���l��腗VLc�E�-n^1����:;��YƎ@Q�� f6|�<G<��
+&?#��sZw�Z�Y�AJ�r|���9���M���k���`�a��
?��#�FӪ�������m��m��e�^�r���w�"����f�~x�>��1��
&
��P�ȾI���1R,_��=���9���m���Nx�=���d�C���
}�­/��i�N�(Џ&��}���^S�S�έ���r� �c ���;����'
�	gM��#�m�Y�Ks}�@��K���g�%�jF}Q��"E�<D-w��#m�h!�{Gՙ���'7��BVLq�2���ߌ�

�7���-�6*(�CX� ��'&3kbK�����	h�
h�������mn�t�>�dO���a���ó� ��Qd�>,�
+w�T��MT��1b,�ߌ�5����=Q�0:�\ЁuF��A5D�%
���W��LՑ�[jG���(\��i��.������

��Rx�{|p�j�?=�"VG���^?���-^�����סX{�5m?� j:��~6�7ZH,�+�t�,h^�R�WT��^v
{�0H�K����%eOY#���+$��9ZP�aBb��VSDz��TԬl`W�*�O0�UB^=�do�=�����z�z�?[٪�<�>�Dt|c�r]���=�
���uY��e5v��|��ŗ��e=���+о�'���9{!ϮyS��t��B'�N�+K����i�H�D�{EY�l��:|�x)4gZ�0����Q�x�a��ai~4�d�wq� l&��AG
������Y�����e�xߌ���
�m%�a�����漻A�P�J���W��_�J�ؒ�׸�!-aD/�8Q��
+���L
�9�fU�:9/�1�
�;�U� ��/�6o�m�f�VΖ�T>�a(������r�n�Ȱ
��y�]�wq?���@��
���k|N��I1
�P׼ͅ�h%��>���+=�HÚ*�kh�5zqF�!����
�FmQң�Po���O��Y��Q~v[q��2C���`t�3�c������nR��>��%y�,
���<v
�o$ĩ�0Q�#�q���y�H�p
��^�M���S�Suf
���pS�(�q��EbƐt�?��T��X���V�Lw|�q�zg��uT��
��:����ő�Et[��������M�[.�f9�
�-�+'P�m�G��{���|�����%��I>#y˗;L1r1�f�B�'n&�}wsV$l�E��UӚ�H5s;��H4�c�jIi�|
����]g��n&�	-�V2�����|�]�u��Km�ؙ[��HT$#�G9*���a�
N�g�Q;��i]J®
�p���

+
�P�lw�|͸c!�
M��t��e�Ji�u�
���U�Q܁�]�1�� ��[��,/^QWs
��x��	��Qy}�/\��s4q:�'��x�f�!���~
D���0[g�B�{�r
+^?7���7X�^�
���
X�d+��ՇØ��\T����
/'l]Z�����@ۙ�+ͺ�˲��\>?���Vիa�f�s�
I��	�
�	(�ܔ�+E
+��8��+&
��T6~��h�&�������	
+܌����Iu��9~V�����a7�E��i,�z�0K�
|Pc�^���z:�C�(�	2���L��R�|?q��
+�1��,���>�c�@DZ�g3\�����mb�n
�:c��ٚ�OJV��y���((�0�#".�8�����W
�m��SW���x=Ib�bP?@����qd>�yi��5<
+���.�����X�ؗ�K~RZ�$v���s���?		���>�
+��`N 
����9�&���ǡ�(B��!�ŗ��]=SK�I�<�P�PO��N?Y0�ۮ�d����2z�Q�z����Z��
S�����"�x"q
N���[hݬ���
W�0���n���
u��'��)��m���
�4Zi�
��H��V�o�Sx�Ϗ�gN��[�����a�̌rA)�VBی]���|�ڹ�@m~+�
"�Wk��fL�ǡ��xӽ�ֶ�xH]�+�B4�'KK�k���!�҇�!<J���6��S���@��a�)~�[��T�Uox$Uԕ��%�^�sr���nn��8�1t��De2�vpKI>?�:�k�
�������]�L1���A�n
X}��A�HŰ%�^%�
�a�p����1ߌ�!�.�
�	1
��
�	\��s++9���ׯ�~��g=���
��MiI at X+����	��d*�4D�I�5���G,{�������{
�WN��I�٦�`���֟Y�3����
{UT.�}�	υ��35�
�wg%�to�P3 
�Ŋ���]&�����W4�r3 at G�2^'�g��k��}
����@�>]9�܏l��@$�J�ᳬ�<��	�Y�-���Κ�3w9�hR�H+ j�vP##5"�;�Z_4�[Ͽ���Փ���%���c�ui�b�
Q�ә�T4)S��V4 ���
1��a�����E[ƺ�Ε��V
ᧄ� �F߲_��f��L�O�=1
�=q�����
#�O>�w�\S�X��x�{
'&
+���'I�se�W��\J�p�L�do�Od
�� ����}�U����\��5�J���ّ�}���|ݴ� vrc��.�
\�X�����@[�p=6k���.�/f$1z�F������7YJ�&������M �M�>��+��
a���Y_�8�u��b��4���VR����[Z!^�� ��0�
��:����	y�[����L��F 	�u�=D����SpC�a������9���Y�V�����xƯ@�F!���n	��V*�d/��X0����)���D}�*ƣ8z"\��s"u����$���v��D�TG��v��l>9_���������J{
߸��.x/yn:g�m��p:i��6	�8�,��a��������"�������Y����ڻ+"<ze��E��6�o�^���
x���W���\���
ஏ�)�	�:�vwx��
9�_b����7p�u���N{
	n�V�п9�
7z~qb�md��[@7Erp�C����a�c� [...]
+�$Sj�E���4e��fc�^��
h'��|�e�D�Z��bg�=�OWN:� {�5
��
+�E���X
�מ��R��ǰ��Y�VR���G�p�}�S$�3�<��KљB9��b ^�%
��T���?*�<5��"�!ʗ	]�-34�A>�z�XZ��E��\w_%�F����'xx�m�S&ˋ#������U4�H���peZ�H��"K�Y$�g
?]�
+��*���@���
+eR��H�Ft��7
���g0��g�!�GKD�T�u�F/,��҅�J#�0V~i�X��z��=�An�5
�mN.��!
�;&�{���̆��
o�C������
Q�n!7$��;:�,}Pރ��p�-7
�ǚ�@�@_�H�i��e�`=���wm�.��I��~g
+^
+
���k�%����A�Y]�����ӂ��(�H�'t8[���1

o�9�Ljm�V�6�Nd�X�8=�m��=��ᔨg\U!z8��VNpm:p����G���OBS�=\_�Td>��?�
��ڝ���[m�eh� +��Y�-�g��ûiU
��_B�����C̐�n1j�^�w?��41�3N�R��^�{8+�PH�s�*M<�n?w.��~ѓTIP�)D���1�2�> p
.
� �4ipԔ�kj�G�Ȋ�
`O�ז�7p�4mf�'T�߱2�`=:IkB���GA��m}#'�zk�7R"�@Yޏ��	�&�;�~���
����l���u���p�&��R+Ip&oV��
�3J*�
s�%�wU��oY'��LH�(���v��L0(�
z/�Cr9���+��������qZ�Z���ŧ.t�GV��T@����HQ�q"�,c�����m��bCvm/�W塟�5�nN�L�����hh��	�p2W�㯹?�Y���No�lϪ�O��6�v�ᮛ�Ԓ��v�=�ۃhp���je1ؼj�~,
}D�*q
F��+�:ꏩ*U�G":����Bv�r�`�� �35�xZr`�}^8Jq�ڌ�@������ �V��xZ�.q�5Φj�*Rf��ɪ��'O��T�c
$�2��

%����r0׽�)<�2���Z��]� ��ὲA�u�Y���U��\E�obX�U���sS>+�z
�-M'��M�}���b��C�YH��},�)$1n ��+LF���\�Ki*�Z�6�����uu/W}��
�k��{|"�Ǚ[�̃I:NV%ϐ��Wo�v��[J���Y{7�V
��ɻ<�ø
�^�75i]����َ{pA��3�s���<�
+���N����P��:�ˏ�*�!�&���N�5a�
I“�Bn��.���j찚��OT@�˧
+��f��[Z"j_�R���}�Zx��}/�����N#�P(��o�/;x�;[��u�c
VS�J����n

s���a�N�qm0›V��x�����q��ȫ
8���C
;�$<���mc&}R~�`Ղ���d-�@(a94hɪ=7�
�J���h��ݚW��>���Ym��f��ˌ
p��
�ϕ�yW�;�a"�Fh�㞲a$�ɶ
�|��p�>k{e�
f��	@(��f�"��e
+�*�4Urg]�瀑YtJZm����3�ٶ�U��e�
n��p	�c*��Md����+���h)��w��b!:5{�Z�y?��W��FD��ޅ?��rH^Tߨ�ٕx��X��'���G�ґEWb��+^z*FC$��ӂ{o�L����Ї�ƅ�oH�
!5�n��P~�w�'1^
�`
<�����KN�!U�ް*`�L���9��&ȦkE�~�N�=�@�G)��&�
	�l�K�
/�b�F?!zލ���W��{PXפeJ��S�׏����FX
�灊'Q�l�,�;}o/�Mϼ���"��/�$Q�z�L>��
\**@g��ۘG
+خ�sks����
�ɅЏ�����ů46754��}Ī���
���(��P5��
+�� ѽ�p�L�snF�m�,`�����8�ʁN
��e面>�6��]�c|:�En���@���F�g�
�̈́��&�f��
$�,fT0���t��
Qb��2�Q���2��#�W���4Cx��S��c��H��6aw�y���L�+
��<<mr����C���%��H#}-l1!�K���)[ّ�Q=��W~/�m1p0��mn�T23C��ҍP|#����*hb9S��7��X�x�����Os$
����u����K0�Lȓ,x����(
,�S�0
�N�/)���}K����H)��9�� ���3����O{M��
1�-�"����p�l�^
Ά_�i�s������߭:4�ЉN宗����6�ի��m^���ؤ�GSia�>�
�G[֐�3Y 	�����3�Q�>�"����5p�R�Bi��̽�F;�B�wV�

~Z%U�����RK�N��J��#&ҕ�6:�K^��|�N6�E��S�<D�K�
Uo(��2yD� +�FB��}�*ř\Yl�?�LbdW��۸���7�ߌ�B�^M
�(꼄�qg<�:.Rx����GT.G)V
jv��I��֭��0_���b;��7���Z&�X�.��b3��G����Z<��K�r�կZ8.��É�����6��
��db at E�ߧ�.u]5C�pf�
B�)�w^�Dž����qc*��
�

���L�|��2LbLJ۶��:bC+���x�������
0>~
���n-�!�
+pG��۹Ҝ��7�����ͬ�M�9������o'��f^�a�sw�z[�L�I}[⥦/o��tƛQ�Sٹ����`���۔G��x�Т�|K�w���
�n�Ŷ7{9?i��X���{�7�����O���K�k,��p�Fp����`�DS�ɶ���ӻ�
��k?�&_	
C�^
9�}U�b8�;�j��
�-"3R��4�'�>���ܫS3���v��4k�X[�LG�qk�u����P�cuO-���G�\�E=���1�%#��G����1���z<%#��sT�^�Hc$��\I��c\��γ��ߪ4w/����D��@�y!�fK����5���:F�
+endstream
+endobj
+3490 0 obj <<
+/Type /FontDescriptor
+/FontName /EBESOF+NimbusRomNo9L-ReguItal
+/Flags 4
+/FontBBox [-169 -270 1010 924]
+/Ascent 669
+/CapHeight 669
+/Descent -193
+/ItalicAngle -15
+/StemV 78
+/XHeight 441
+/CharSet (/A/B/C/D/E/F/G/H/I/L/M/N/O/P/R/S/T/U/W/Z/a/b/bracketleft/bracketright/c/colon/comma/d/e/f/fi/fl/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteleft/quoteright/r/s/semicolon/seven/slash/t/three/u/underscore/v/w/x/y/z/zero)
+/FontFile 3489 0 R
+>> endobj
+3433 0 obj <<
+/Type /Encoding
+/Differences [2/fi/fl 33/exclam/quotedbl/numbersign 37/percent/ampersand/quoteright/parenleft/parenright 43/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon/less/equal/greater 64/at/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft 93/bracketright 95/underscore/quoteleft/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/braceleft 125/braceright 147/quotedblleft/quotedblright/bullet/endash/emdash 169/copyright]
+>> endobj
+615 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /CYTIHN+CMMI10
+/FontDescriptor 3448 0 R
+/FirstChar 46
+/LastChar 119
+/Widths 3432 0 R
+>> endobj
+617 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /KJFPML+CMMI7
+/FontDescriptor 3450 0 R
+/FirstChar 115
+/LastChar 119
+/Widths 3430 0 R
+>> endobj
+1218 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /RMKTHO+CMMI9
+/FontDescriptor 3452 0 R
+/FirstChar 46
+/LastChar 118
+/Widths 3429 0 R
+>> endobj
+616 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /XCKPWW+CMR10
+/FontDescriptor 3454 0 R
+/FirstChar 48
+/LastChar 118
+/Widths 3431 0 R
+>> endobj
+1605 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /OPBINH+CMR6
+/FontDescriptor 3456 0 R
+/FirstChar 48
+/LastChar 117
+/Widths 3426 0 R
+>> endobj
+3186 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UYHLKA+CMR7
+/FontDescriptor 3458 0 R
+/FirstChar 98
+/LastChar 117
+/Widths 3425 0 R
+>> endobj
+1219 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /HRPHYH+CMR9
+/FontDescriptor 3460 0 R
+/FirstChar 12
+/LastChar 118
+/Widths 3428 0 R
+>> endobj
+173 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /ZMNSWV+CMSY10
+/FontDescriptor 3462 0 R
+/FirstChar 1
+/LastChar 21
+/Widths 3445 0 R
+>> endobj
+175 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /VYEUCT+CMSY6
+/FontDescriptor 3464 0 R
+/FirstChar 3
+/LastChar 123
+/Widths 3443 0 R
+>> endobj
+3187 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /NSJEOL+CMSY7
+/FontDescriptor 3466 0 R
+/FirstChar 48
+/LastChar 48
+/Widths 3424 0 R
+>> endobj
+174 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /DFVRAV+CMSY8
+/FontDescriptor 3468 0 R
+/FirstChar 120
+/LastChar 123
+/Widths 3444 0 R
+>> endobj
+531 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /GCEPBM+CMSY9
+/FontDescriptor 3470 0 R
+/FirstChar 3
+/LastChar 50
+/Widths 3435 0 R
+>> endobj
+1604 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /CDCNLO+MSBM10
+/FontDescriptor 3472 0 R
+/FirstChar 81
+/LastChar 82
+/Widths 3427 0 R
+>> endobj
+198 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /NQXOMN+NimbusMonL-Regu
+/FontDescriptor 3474 0 R
+/FirstChar 33
+/LastChar 122
+/Widths 3440 0 R
+/Encoding 3433 0 R
+>> endobj
+336 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /BFMNIZ+NimbusMonL-ReguObli
+/FontDescriptor 3476 0 R
+/FirstChar 39
+/LastChar 122
+/Widths 3437 0 R
+/Encoding 3433 0 R
+>> endobj
+265 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /TOEHMW+NimbusSanL-BoldCond
+/FontDescriptor 3478 0 R
+/FirstChar 2
+/LastChar 148
+/Widths 3439 0 R
+/Encoding 3433 0 R
+>> endobj
+502 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /WGKKCA+NimbusSanL-BoldCondItal
+/FontDescriptor 3480 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 3436 0 R
+/Encoding 3433 0 R
+>> endobj
+172 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /LQFJJH+NimbusSanL-Regu
+/FontDescriptor 3482 0 R
+/FirstChar 39
+/LastChar 121
+/Widths 3446 0 R
+/Encoding 3433 0 R
+>> endobj
+196 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /MBKJVL+NimbusRomNo9L-Medi
+/FontDescriptor 3484 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 3441 0 R
+/Encoding 3433 0 R
+>> endobj
+573 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UTIMSX+NimbusRomNo9L-MediItal
+/FontDescriptor 3486 0 R
+/FirstChar 49
+/LastChar 121
+/Widths 3434 0 R
+/Encoding 3433 0 R
+>> endobj
+176 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /ZHVIQV+NimbusRomNo9L-Regu
+/FontDescriptor 3488 0 R
+/FirstChar 2
+/LastChar 169
+/Widths 3442 0 R
+/Encoding 3433 0 R
+>> endobj
+267 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /EBESOF+NimbusRomNo9L-ReguItal
+/FontDescriptor 3490 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 3438 0 R
+/Encoding 3433 0 R
+>> endobj
+177 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3491 0 R
+/Kids [166 0 R 181 0 R 193 0 R 206 0 R 252 0 R 256 0 R]
+>> endobj
+268 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3491 0 R
+/Kids [263 0 R 273 0 R 279 0 R 286 0 R 293 0 R 300 0 R]
+>> endobj
+310 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3491 0 R
+/Kids [306 0 R 313 0 R 321 0 R 329 0 R 342 0 R 348 0 R]
+>> endobj
+356 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3491 0 R
+/Kids [353 0 R 359 0 R 364 0 R 373 0 R 410 0 R 453 0 R]
+>> endobj
+495 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3491 0 R
+/Kids [478 0 R 498 0 R 516 0 R 539 0 R 560 0 R 587 0 R]
+>> endobj
+618 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3491 0 R
+/Kids [600 0 R 621 0 R 657 0 R 709 0 R 757 0 R 815 0 R]
+>> endobj
+901 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3492 0 R
+/Kids [880 0 R 918 0 R 930 0 R 939 0 R 965 0 R 1011 0 R]
+>> endobj
+1075 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3492 0 R
+/Kids [1056 0 R 1096 0 R 1157 0 R 1207 0 R 1253 0 R 1297 0 R]
+>> endobj
+1374 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3492 0 R
+/Kids [1349 0 R 1411 0 R 1455 0 R 1496 0 R 1541 0 R 1597 0 R]
+>> endobj
+1660 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3492 0 R
+/Kids [1641 0 R 1691 0 R 1736 0 R 1781 0 R 1841 0 R 1896 0 R]
+>> endobj
+1978 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3492 0 R
+/Kids [1955 0 R 2026 0 R 2080 0 R 2117 0 R 2158 0 R 2226 0 R]
+>> endobj
+2294 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3492 0 R
+/Kids [2275 0 R 2312 0 R 2335 0 R 2375 0 R 2418 0 R 2471 0 R]
+>> endobj
+2540 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3493 0 R
+/Kids [2520 0 R 2559 0 R 2609 0 R 2679 0 R 2765 0 R 2862 0 R]
+>> endobj
+2960 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3493 0 R
+/Kids [2942 0 R 3012 0 R 3087 0 R 3122 0 R 3137 0 R 3148 0 R]
+>> endobj
+3166 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3493 0 R
+/Kids [3157 0 R 3169 0 R 3181 0 R 3196 0 R 3207 0 R 3217 0 R]
+>> endobj
+3298 0 obj <<
+/Type /Pages
+/Count 3
+/Parent 3493 0 R
+/Kids [3294 0 R 3369 0 R 3421 0 R]
+>> endobj
+3491 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 3494 0 R
+/Kids [177 0 R 268 0 R 310 0 R 356 0 R 495 0 R 618 0 R]
+>> endobj
+3492 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 3494 0 R
+/Kids [901 0 R 1075 0 R 1374 0 R 1660 0 R 1978 0 R 2294 0 R]
+>> endobj
+3493 0 obj <<
+/Type /Pages
+/Count 21
+/Parent 3494 0 R
+/Kids [2540 0 R 2960 0 R 3166 0 R 3298 0 R]
+>> endobj
+3494 0 obj <<
+/Type /Pages
+/Count 93
+/Kids [3491 0 R 3492 0 R 3493 0 R]
+>> endobj
+3495 0 obj <<
+/Type /Outlines
+/First 3 0 R
+/Last 163 0 R
+/Count 8
+>> endobj
+163 0 obj <<
+/Title 164 0 R
+/A 161 0 R
+/Parent 3495 0 R
+/Prev 59 0 R
+>> endobj
+159 0 obj <<
+/Title 160 0 R
+/A 157 0 R
+/Parent 59 0 R
+/Prev 155 0 R
+>> endobj
+155 0 obj <<
+/Title 156 0 R
+/A 153 0 R
+/Parent 59 0 R
+/Prev 151 0 R
+/Next 159 0 R
+>> endobj
+151 0 obj <<
+/Title 152 0 R
+/A 149 0 R
+/Parent 59 0 R
+/Prev 147 0 R
+/Next 155 0 R
+>> endobj
+147 0 obj <<
+/Title 148 0 R
+/A 145 0 R
+/Parent 59 0 R
+/Prev 143 0 R
+/Next 151 0 R
+>> endobj
+143 0 obj <<
+/Title 144 0 R
+/A 141 0 R
+/Parent 59 0 R
+/Prev 139 0 R
+/Next 147 0 R
+>> endobj
+139 0 obj <<
+/Title 140 0 R
+/A 137 0 R
+/Parent 59 0 R
+/Prev 135 0 R
+/Next 143 0 R
+>> endobj
+135 0 obj <<
+/Title 136 0 R
+/A 133 0 R
+/Parent 59 0 R
+/Prev 131 0 R
+/Next 139 0 R
+>> endobj
+131 0 obj <<
+/Title 132 0 R
+/A 129 0 R
+/Parent 59 0 R
+/Prev 127 0 R
+/Next 135 0 R
+>> endobj
+127 0 obj <<
+/Title 128 0 R
+/A 125 0 R
+/Parent 59 0 R
+/Prev 123 0 R
+/Next 131 0 R
+>> endobj
+123 0 obj <<
+/Title 124 0 R
+/A 121 0 R
+/Parent 59 0 R
+/Prev 119 0 R
+/Next 127 0 R
+>> endobj
+119 0 obj <<
+/Title 120 0 R
+/A 117 0 R
+/Parent 59 0 R
+/Prev 115 0 R
+/Next 123 0 R
+>> endobj
+115 0 obj <<
+/Title 116 0 R
+/A 113 0 R
+/Parent 59 0 R
+/Prev 111 0 R
+/Next 119 0 R
+>> endobj
+111 0 obj <<
+/Title 112 0 R
+/A 109 0 R
+/Parent 59 0 R
+/Prev 107 0 R
+/Next 115 0 R
+>> endobj
+107 0 obj <<
+/Title 108 0 R
+/A 105 0 R
+/Parent 59 0 R
+/Prev 103 0 R
+/Next 111 0 R
+>> endobj
+103 0 obj <<
+/Title 104 0 R
+/A 101 0 R
+/Parent 59 0 R
+/Prev 99 0 R
+/Next 107 0 R
+>> endobj
+99 0 obj <<
+/Title 100 0 R
+/A 97 0 R
+/Parent 59 0 R
+/Prev 95 0 R
+/Next 103 0 R
+>> endobj
+95 0 obj <<
+/Title 96 0 R
+/A 93 0 R
+/Parent 59 0 R
+/Prev 91 0 R
+/Next 99 0 R
+>> endobj
+91 0 obj <<
+/Title 92 0 R
+/A 89 0 R
+/Parent 59 0 R
+/Prev 87 0 R
+/Next 95 0 R
+>> endobj
+87 0 obj <<
+/Title 88 0 R
+/A 85 0 R
+/Parent 59 0 R
+/Prev 83 0 R
+/Next 91 0 R
+>> endobj
+83 0 obj <<
+/Title 84 0 R
+/A 81 0 R
+/Parent 59 0 R
+/Prev 79 0 R
+/Next 87 0 R
+>> endobj
+79 0 obj <<
+/Title 80 0 R
+/A 77 0 R
+/Parent 59 0 R
+/Prev 75 0 R
+/Next 83 0 R
+>> endobj
+75 0 obj <<
+/Title 76 0 R
+/A 73 0 R
+/Parent 59 0 R
+/Prev 71 0 R
+/Next 79 0 R
+>> endobj
+71 0 obj <<
+/Title 72 0 R
+/A 69 0 R
+/Parent 59 0 R
+/Prev 67 0 R
+/Next 75 0 R
+>> endobj
+67 0 obj <<
+/Title 68 0 R
+/A 65 0 R
+/Parent 59 0 R
+/Prev 63 0 R
+/Next 71 0 R
+>> endobj
+63 0 obj <<
+/Title 64 0 R
+/A 61 0 R
+/Parent 59 0 R
+/Next 67 0 R
+>> endobj
+59 0 obj <<
+/Title 60 0 R
+/A 57 0 R
+/Parent 3495 0 R
+/Prev 31 0 R
+/Next 163 0 R
+/First 63 0 R
+/Last 159 0 R
+/Count -25
+>> endobj
+55 0 obj <<
+/Title 56 0 R
+/A 53 0 R
+/Parent 31 0 R
+/Prev 51 0 R
+>> endobj
+51 0 obj <<
+/Title 52 0 R
+/A 49 0 R
+/Parent 31 0 R
+/Prev 47 0 R
+/Next 55 0 R
+>> endobj
+47 0 obj <<
+/Title 48 0 R
+/A 45 0 R
+/Parent 31 0 R
+/Prev 43 0 R
+/Next 51 0 R
+>> endobj
+43 0 obj <<
+/Title 44 0 R
+/A 41 0 R
+/Parent 31 0 R
+/Prev 39 0 R
+/Next 47 0 R
+>> endobj
+39 0 obj <<
+/Title 40 0 R
+/A 37 0 R
+/Parent 31 0 R
+/Prev 35 0 R
+/Next 43 0 R
+>> endobj
+35 0 obj <<
+/Title 36 0 R
+/A 33 0 R
+/Parent 31 0 R
+/Next 39 0 R
+>> endobj
+31 0 obj <<
+/Title 32 0 R
+/A 29 0 R
+/Parent 3495 0 R
+/Prev 23 0 R
+/Next 59 0 R
+/First 35 0 R
+/Last 55 0 R
+/Count -6
+>> endobj
+27 0 obj <<
+/Title 28 0 R
+/A 25 0 R
+/Parent 23 0 R
+>> endobj
+23 0 obj <<
+/Title 24 0 R
+/A 21 0 R
+/Parent 3495 0 R
+/Prev 15 0 R
+/Next 31 0 R
+/First 27 0 R
+/Last 27 0 R
+/Count -1
+>> endobj
+19 0 obj <<
+/Title 20 0 R
+/A 17 0 R
+/Parent 15 0 R
+>> endobj
+15 0 obj <<
+/Title 16 0 R
+/A 13 0 R
+/Parent 3495 0 R
+/Prev 11 0 R
+/Next 23 0 R
+/First 19 0 R
+/Last 19 0 R
+/Count -1
+>> endobj
+11 0 obj <<
+/Title 12 0 R
+/A 9 0 R
+/Parent 3495 0 R
+/Prev 7 0 R
+/Next 15 0 R
+>> endobj
+7 0 obj <<
+/Title 8 0 R
+/A 5 0 R
+/Parent 3495 0 R
+/Prev 3 0 R
+/Next 11 0 R
+>> endobj
+3 0 obj <<
+/Title 4 0 R
+/A 1 0 R
+/Parent 3495 0 R
+/Next 7 0 R
+>> endobj
+3496 0 obj <<
+/Names [(Doc-Start) 171 0 R (GFDL) 345 0 R (GFDL_GFDL) 203 0 R (GPL) 275 0 R (GPL_GPL) 204 0 R (group__Datatypes) 660 0 R]
+/Limits [(Doc-Start) (group__Datatypes)]
+>> endobj
+3497 0 obj <<
+/Names [(group__Datatypes_ga0764a0e607ec4de08a53e6d3b109a714) 891 0 R (group__Datatypes_ga0aac22e2dc312e8c41418dd8d59701f8) 921 0 R (group__Datatypes_ga12c368fa0bdd20b907d9ab8e92e999d2) 760 0 R (group__Datatypes_ga13f1f84a46d70b91637cb9d6af54af6b) 890 0 R (group__Datatypes_ga1822baf29ede5879f1c6ed77f0ca5984) 676 0 R (group__Datatypes_ga1fd59c6502c8cbb9dbb802e4af34c940) 894 0 R]
+/Limits [(group__Datatypes_ga0764a0e607ec4de08a53e6d3b109a714) (group__Datatypes_ga1fd59c6502c8cbb9dbb802e4af34c940)]
+>> endobj
+3498 0 obj <<
+/Names [(group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) 666 0 R (group__Datatypes_ga25f9463d3385bd998e4fabcdce8dec5a) 766 0 R (group__Datatypes_ga261d916137f01c0effdefeb266a73172) 773 0 R (group__Datatypes_ga2f2a1aa8fbda2e53218cecba593f7427) 823 0 R (group__Datatypes_ga2fdde49c81e0fd5d54dba2cb056847b3) 774 0 R (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec) 662 0 R]
+/Limits [(group__Datatypes_ga25f4b655851f0f561cdddf94f667e833) (group__Datatypes_ga32ce20a24d131c3ec8274b907176bfec)]
+>> endobj
+3499 0 obj <<
+/Names [(group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) 716 0 R (group__Datatypes_ga429b479c97f57c41763a019c2dc5bf10) 674 0 R (group__Datatypes_ga43246761a1030d751e756845a246bf68) 767 0 R (group__Datatypes_ga4384ab8e17fe9415f5146ece650cf9c3) 668 0 R (group__Datatypes_ga4813a2ed52eb4aeac03bde07be0ddd83) 911 0 R (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5) 718 0 R]
+/Limits [(group__Datatypes_ga3b2653e715f41511257a84f35be7fba9) (group__Datatypes_ga4aa820c3f87b201ce364e854aa37dba5)]
+>> endobj
+3500 0 obj <<
+/Names [(group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) 771 0 R (group__Datatypes_ga4b10979f4464f0574331e442e9025d3c) 902 0 R (group__Datatypes_ga56026e685fb0fe336a5f346580f84ff0) 889 0 R (group__Datatypes_ga56e2574a7d2f006333151867599e8fa3) 725 0 R (group__Datatypes_ga576b0ae433a83ef58a3c174a86623582) 826 0 R (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6) 671 0 R]
+/Limits [(group__Datatypes_ga4af3a60e2d8ec27d56cf4a555cc1748e) (group__Datatypes_ga5a7338130cf6d33d28dd40ed560a24d6)]
+>> endobj
+3501 0 obj <<
+/Names [(group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) 844 0 R (group__Datatypes_ga5e128d772c07f54f135cac19e9a6ffbe) 719 0 R (group__Datatypes_ga5e59406ab43e2f1851ea2e066137b4bd) 717 0 R (group__Datatypes_ga6069aff3ad06a502f746df4adec1c16c) 712 0 R (group__Datatypes_ga64dda1bda497aab131fc204ed9e55894) 715 0 R (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f) 768 0 R]
+/Limits [(group__Datatypes_ga5b805182b79b6fb873d0624f7dfd2ee1) (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f)]
+>> endobj
+3502 0 obj <<
+/Names [(group__Datatypes_ga6b8429baa2a70746836586aad6905b64) 908 0 R (group__Datatypes_ga6d1de7e82c3d57a0a6229187078537d7) 825 0 R (group__Datatypes_ga735949470e98393af90b12f534b06cba) 896 0 R (group__Datatypes_ga7364448b56d85cb45c512ca35678952a) 818 0 R (group__Datatypes_ga73918c511d88c3fd8ad4de602c4d20df) 762 0 R (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551) 675 0 R]
+/Limits [(group__Datatypes_ga6b8429baa2a70746836586aad6905b64) (group__Datatypes_ga747bcaa4d01a8065758096b1ff0eb551)]
+>> endobj
+3503 0 obj <<
+/Names [(group__Datatypes_ga7593947fa164900140d09c08b56c6cd1) 888 0 R (group__Datatypes_ga763a5fa98155383055703dc08cb3e11a) 915 0 R (group__Datatypes_ga82657533544652eb3ec1334a72da137e) 822 0 R (group__Datatypes_ga841003bef28b1052aa2b5297a529d4d8) 899 0 R (group__Datatypes_ga84f27605574583d674403f6d71a73a24) 669 0 R (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f) 672 0 R]
+/Limits [(group__Datatypes_ga7593947fa164900140d09c08b56c6cd1) (group__Datatypes_ga88e874dbd26b94133467d81b006f0c3f)]
+>> endobj
+3504 0 obj <<
+/Names [(group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) 769 0 R (group__Datatypes_ga9448cd0d782a819c066e27cf3ebc1add) 772 0 R (group__Datatypes_ga97b246f11809448c53f089779c0019a1) 819 0 R (group__Datatypes_gab49861123b31a74dddcdffb4b8fd110a) 724 0 R (group__Datatypes_gab9fc89c0e89d4487a1f69a26849b682a) 895 0 R (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56) 820 0 R]
+/Limits [(group__Datatypes_ga934e8eb1ed3d9f688ffafe0f82ad02f6) (group__Datatypes_gabc52e1474c4b78458b4c13ddbfdc8e56)]
+>> endobj
+3505 0 obj <<
+/Names [(group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) 673 0 R (group__Datatypes_gac0d389ac714f0d4d3e6950fd692e7443) 723 0 R (group__Datatypes_gac37b94ca7dc0c8bb9797e6d91e16492e) 892 0 R (group__Datatypes_gac3cf4d5c81ff784729bb5d1c8d48ce23) 770 0 R (group__Datatypes_gac803b1dab9dd0072acb6fdda204efd26) 713 0 R (group__Datatypes_gac9397590f57ede293eed34366aec11dd) 763 0 R]
+/Limits [(group__Datatypes_gabf20fcbeb06790546a112b72eb0811f8) (group__Datatypes_gac9397590f57ede293eed34366aec11dd)]
+>> endobj
+3506 0 obj <<
+/Names [(group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) 765 0 R (group__Datatypes_gad55dee4843ce4694afab11a60f16ef40) 670 0 R (group__Datatypes_gad8582d9f10213d638e87de8f0aa91a01) 714 0 R (group__Datatypes_gadb1edf876e8c62fb7d2630a9280224f1) 821 0 R (group__Datatypes_gadc14acd60d7235a72f88850b9a917eca) 887 0 R (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b) 665 0 R]
+/Limits [(group__Datatypes_gaceb51fb97c11d86059188525d87ceaaf) (group__Datatypes_gadc58d1f680927df3786f41bdb47fa26b)]
+>> endobj
+3507 0 obj <<
+/Names [(group__Datatypes_gae311117a92fca76fc66fe3442ff6d09f) 900 0 R (group__Datatypes_gae439fa617415f2153f4793041c41bd9f) 897 0 R (group__Datatypes_gae50df8ccfc72a20b58ab7854ad2ccba9) 663 0 R (group__Datatypes_gae5679e4f41db32b7b91dfc81574fc1d6) 833 0 R (group__Datatypes_gae8610cd48952cf1dc71b525235f6f583) 720 0 R (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b) 886 0 R]
+/Limits [(group__Datatypes_gae311117a92fca76fc66fe3442ff6d09f) (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b)]
+>> endobj
+3508 0 obj <<
+/Names [(group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) 761 0 R (group__Datatypes_gaedee0800f6e695c36ace737095ccef5b) 667 0 R (group__Datatypes_gaef15021f65d2810602a9a1bd06fc878d) 898 0 R (group__Datatypes_gaefc9900fe07bfdee6310e4705ea0bfec) 721 0 R (group__Datatypes_gaf02dc1cffb4d3d79720ebafbe872be03) 726 0 R (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4) 664 0 R]
+/Limits [(group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) (group__Datatypes_gaf1c4903edb1a626a36a7220038f963c4)]
+>> endobj
+3509 0 obj <<
+/Names [(group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) 828 0 R (group__Datatypes_gaf449476be1ec42bab45fb86e7478bdf9) 839 0 R (group__Datatypes_gaf4f8f4bacd6f148fbbfb9209fb5b2b33) 764 0 R (group__Datatypes_gaf78df97484e374abe5d4e0f8973a622d) 722 0 R (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83a60e9236626a09f76d3fe049e03bd6926) 912 0 R (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab34d1f06ae438f58dd44c6262b3281ce) 914 0 R]
+/Limits [(group__Datatypes_gaf2faa73b338e8563f6c022739e5ecc6f) (group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab34d1f06ae438f58dd44c6262b3281ce)]
+>> endobj
+3510 0 obj <<
+/Names [(group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) 913 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca48a27a450babc28cd9e37b24e4c7f870) 905 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5637cd5e0441762c2efba8ec4549156a) 907 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca5c5c70a1d41e6e79718bbeb33df7cad4) 904 0 R (group__Datatypes_gga4b10979f4464f0574331e442e9025d3ca8cbde0e6dec605c51ef708fb8cd2b52e) 906 0 R (gro [...]
+/Limits [(group__Datatypes_gga4813a2ed52eb4aeac03bde07be0ddd83ab602a0c001878a0debc775c4bee33777) (group__Datatypes_gga4b10979f4464f0574331e442e9025d3cae072091ed81a04a85178bba39494a601)]
+>> endobj
+3511 0 obj <<
+/Names [(group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a3e5170687052e3962de866e2ab44d8f8) 847 0 R (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a59042baec996bc386154a1825ad56de0) 845 0 R (group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1aa05a8932097b094ca179e99e2d80b6ae) 846 0 R (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a81a7221b987cf71e9577f1d3162fc994) 910 0 R (group__Datatypes_gga6b8429baa2a70746836586aad6905b64a8a337487ebb2a4938a04103368bc24dc) 909 0 R (gro [...]
+/Limits [(group__Datatypes_gga5b805182b79b6fb873d0624f7dfd2ee1a3e5170687052e3962de866e2ab44d8f8) (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a81067f9cf8984d1b3febca4488a137e1)]
+>> endobj
+3512 0 obj <<
+/Names [(group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9029c33b6876c560bf78b5b86d0367c0) 838 0 R (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9e4eb4979711bf6699ec8e0f335de476) 837 0 R (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6aa166787e251ef2cbaad9213d8e9d2653) 836 0 R (group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6af8c3e04d66cd611db5efcd92a6c52425) 835 0 R (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a1304ca7fa8d3e734d1677709a37d5d28) 841 0 R (gro [...]
+/Limits [(group__Datatypes_ggae5679e4f41db32b7b91dfc81574fc1d6a9029c33b6876c560bf78b5b86d0367c0) (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9a132c76cbee67b5bc2ac9e09af9c68c4f)]
+>> endobj
+3513 0 obj <<
+/Names [(group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9ab32d9464a7101eb1893562646a3cdd1a) 843 0 R (group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9afdbee5cd06ff135cbf9614b661c9e923) 842 0 R (group__Error) 563 0 R (group__Error_ga0c0ab09a97e49f85f42c966e14cfdee6) 570 0 R (group__Error_gad6765993c08a2ae2f0ef377f822f4d33) 584 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106) 580 0 R]
+/Limits [(group__Datatypes_ggaf449476be1ec42bab45fb86e7478bdf9ab32d9464a7101eb1893562646a3cdd1a) (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106)]
+>> endobj
+3514 0 obj <<
+/Names [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) 578 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a093ae02f8ceebbc40321d1eaf186f726) 574 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a24fd14db2a8ae42b3abcae3288e46edf) 582 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a6aa28e72200f879cbb83a36b60644fb2) 576 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a7dae659f72f654afae1c5c6f331192a3) 579 0 R (group__Error_gga0c0ab09 [...]
+/Limits [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8bf236a519f7da9efd5f874a17d9689d)]
+>> endobj
+3515 0 obj <<
+/Names [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) 575 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6ab42a97917f263e8305d561f52cbd9c57) 581 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6abd22c4eaabb49bcb6c654a25e402c64a) 577 0 R (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6af29a62bdfcf44dbeec14afb409035438) 572 0 R (group__Init) 481 0 R (group__Init_ga234d52733263ece8ac36c980a80292c9) 494 0 R]
+/Limits [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a8c65fedb9893ebb49394a3cff2f19a49) (group__Init_ga234d52733263ece8ac36c980a80292c9)]
+>> endobj
+3516 0 obj <<
+/Names [(group__Init_ga4af2931282f6a5f1b3444fb8e833d6a1) 488 0 R (group__Init_ga635128363efd9f4c8c63e21702f40183) 490 0 R (group__Init_ga7c98bac1ccfac398657571409a3fcd9c) 486 0 R (group__Init_gaf090a4178ad2e0dc0ea185961e13b3f1) 483 0 R (group__Init_gafdb2c887a3a2d1daf54a764d0d7f7f76) 492 0 R (group__PPL__C__interface) 458 0 R]
+/Limits [(group__Init_ga4af2931282f6a5f1b3444fb8e833d6a1) (group__PPL__C__interface)]
+>> endobj
+3517 0 obj <<
+/Names [(group__Timeout) 603 0 R (group__Timeout_ga3ebabd1a7396005fadcd08efb53c1f58) 605 0 R (group__Timeout_ga7e11189e03e9d1452b16e24dae5d6bc3) 606 0 R (group__Timeout_ga93f815a338ce597c6ae3e7b2018d962d) 612 0 R (group__Timeout_gaf0d33c5ec6461b246420cebe2d6866ed) 609 0 R (group__Version) 519 0 R]
+/Limits [(group__Timeout) (group__Version)]
+>> endobj
+3518 0 obj <<
+/Names [(group__Version_ga63fef7041da34ac5bb372a2535d99377) 536 0 R (group__Version_ga676f27ad949159a3b79577f78870f60f) 529 0 R (group__Version_ga79bd3696a302bb721ef8168fa5d650fb) 534 0 R (group__Version_ga7a529f51bfebdd4b3e69c866dced9bc1) 524 0 R (group__Version_ga8458e58a5e857de11c35ce3076a70ab8) 522 0 R (group__Version_gaa50f472bf6d1869a2fc1500d2fdf8213) 528 0 R]
+/Limits [(group__Version_ga63fef7041da34ac5bb372a2535d99377) (group__Version_gaa50f472bf6d1869a2fc1500d2fdf8213)]
+>> endobj
+3519 0 obj <<
+/Names [(group__Version_gab51f10ea37de5299e9bc840afa206d4e) 527 0 R (group__Version_gabadfeba0a415d210cdd6d7309365e800) 523 0 R (group__Version_gabdf8f4e9416010573d48e21cf0584762) 526 0 R (group__Version_gac6abee034f6ac000f15d1206fdeb8316) 530 0 R (group__Version_gae19dfe022c51c874d905e2a7c81c18f1) 521 0 R (index) 266 0 R]
+/Limits [(group__Version_gab51f10ea37de5299e9bc840afa206d4e) (index)]
+>> endobj
+3520 0 obj <<
+/Names [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) 413 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a26270ebae88b22836f94cbdd003a022e) 971 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a27c82492b590d5445541451928a593ac) 983 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a2c8e06a14ae0f5878428e7385e98bedf) 981 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_a [...]
+/Limits [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_ab1e38080e1de577a82f181e1e87cea61)]
+>> endobj
+3521 0 obj <<
+/Names [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_adbcbb0f82f71091112f2c768d2107bb8) 969 0 R (interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_afa0c60a0cce5f80bcf4fdd22ba4913a9) 974 0 R (interfaceppl__Artificial__Parameter__tag) 414 0 R (interfaceppl__Artificial__Parameter__tag_a0340ab7363ad499c2d6a0182bc874057) 1021 0 R (interfaceppl__Artificial__Parameter__tag_a12aac19f5cba4af9f1a177cd7b772242) 1020 0 R (interfaceppl__Artificial__Parameter_ [...]
+/Limits [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag_adbcbb0f82f71091112f2c768d2107bb8) (interfaceppl__Artificial__Parameter__tag_a23b660d538bf3d3140ab3a4dfe649f61)]
+>> endobj
+3522 0 obj <<
+/Names [(interfaceppl__Artificial__Parameter__tag_a6bc95e351716acc4b56829a62464cddb) 1017 0 R (interfaceppl__Artificial__Parameter__tag_a80b6aa70e38446636a0523f06353c8f2) 1018 0 R (interfaceppl__Artificial__Parameter__tag_a8758040d0309c4f1bce32f105cf4c554) 1015 0 R (interfaceppl__Artificial__Parameter__tag_ac7eb99bc96d86baf058f856e41b2ddfe) 1025 0 R (interfaceppl__Artificial__Parameter__tag_acb2d4b9c84cd7b7b4f2abb568471c424) 1024 0 R (interfaceppl__Artificial__Parameter__tag_adc5d20f68f0 [...]
+/Limits [(interfaceppl__Artificial__Parameter__tag_a6bc95e351716acc4b56829a62464cddb) (interfaceppl__Artificial__Parameter__tag_adc5d20f68f042656187d507cff5ceea7)]
+>> endobj
+3523 0 obj <<
+/Names [(interfaceppl__Coefficient__tag) 415 0 R (interfaceppl__Coefficient__tag_a001b2a61c18a500a446151a9024de3fe) 1067 0 R (interfaceppl__Coefficient__tag_a1e3bb22af6b60660fcb8d201b09ec7ed) 1072 0 R (interfaceppl__Coefficient__tag_a1ef606afeb25edded051be3b0c728086) 1064 0 R (interfaceppl__Coefficient__tag_a249071ec2d19ecedaaf4e32ca8fc4a8d) 1073 0 R (interfaceppl__Coefficient__tag_a39db5035590b4bf7017a43cdcca6a49e) 1063 0 R]
+/Limits [(interfaceppl__Coefficient__tag) (interfaceppl__Coefficient__tag_a39db5035590b4bf7017a43cdcca6a49e)]
+>> endobj
+3524 0 obj <<
+/Names [(interfaceppl__Coefficient__tag_a474cce1b8348a126a8496cea7952a1f1) 1068 0 R (interfaceppl__Coefficient__tag_a526a2d8ad27e00b633408a36830dc2ae) 1069 0 R (interfaceppl__Coefficient__tag_a5fa6bcd4ec3cf844646033688f2fdf0a) 1060 0 R (interfaceppl__Coefficient__tag_aa1816497499ee569563a6d97a4ff553a) 1071 0 R (interfaceppl__Coefficient__tag_aaf38dc5a17ef89e16c45f363397afb59) 1061 0 R (interfaceppl__Coefficient__tag_abe5af687ddf08c6379bd115d210ac22f) 1066 0 R]
+/Limits [(interfaceppl__Coefficient__tag_a474cce1b8348a126a8496cea7952a1f1) (interfaceppl__Coefficient__tag_abe5af687ddf08c6379bd115d210ac22f)]
+>> endobj
+3525 0 obj <<
+/Names [(interfaceppl__Coefficient__tag_acad04388edea0d80b20c40266a3c3f14) 1065 0 R (interfaceppl__Coefficient__tag_af0b12578ecdb0571ca51ee09789b2fc3) 1070 0 R (interfaceppl__Coefficient__tag_afabc584f4f391708d6c0d7c47030471a) 1062 0 R (interfaceppl__Congruence__System__const__iterator__tag) 416 0 R (interfaceppl__Congruence__System__const__iterator__tag_a38ece4277d5885940d45d6c8465ca19a) 1101 0 R (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4)  [...]
+/Limits [(interfaceppl__Coefficient__tag_acad04388edea0d80b20c40266a3c3f14) (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4)]
+>> endobj
+3526 0 obj <<
+/Names [(interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) 1109 0 R (interfaceppl__Congruence__System__const__iterator__tag_a7f1fc328bf8f0d2ec92a6599ce7fe2d3) 1107 0 R (interfaceppl__Congruence__System__const__iterator__tag_a9af8efc183a5a4cd4475146207f92c8a) 1100 0 R (interfaceppl__Congruence__System__const__iterator__tag_a9c7ea131b285ad7aaefbc1e2cf579512) 1103 0 R (interfaceppl__Congruence__System__const__iterator__tag_ade6bd909f8bb4bcdaed4dced85c [...]
+/Limits [(interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) (interfaceppl__Congruence__System__tag)]
+>> endobj
+3527 0 obj <<
+/Names [(interfaceppl__Congruence__System__tag_a19d1974dd5b293a48b8f2de6fa3c2c8b) 1179 0 R (interfaceppl__Congruence__System__tag_a2c60071e2c7adec51fc7175ddb7a3bff) 1173 0 R (interfaceppl__Congruence__System__tag_a3b54824f0f53bf664c3114fb67557115) 1211 0 R (interfaceppl__Congruence__System__tag_a3ce50d0fcf796935652563144194ccf7) 1176 0 R (interfaceppl__Congruence__System__tag_a45fb5ebe8a9c33d1e73593b09d8ab877) 1210 0 R (interfaceppl__Congruence__System__tag_a56b9fe489466e7376b72bc99b4f99 [...]
+/Limits [(interfaceppl__Congruence__System__tag_a19d1974dd5b293a48b8f2de6fa3c2c8b) (interfaceppl__Congruence__System__tag_a56b9fe489466e7376b72bc99b4f99126)]
+>> endobj
+3528 0 obj <<
+/Names [(interfaceppl__Congruence__System__tag_a5a6326e465cce738cb09fdd8df1d92ba) 1171 0 R (interfaceppl__Congruence__System__tag_a68de3cffc4bbfa2a79c06c51adb653a8) 1166 0 R (interfaceppl__Congruence__System__tag_a86691cc44e4ef41d379ec2477221f0de) 1213 0 R (interfaceppl__Congruence__System__tag_a8cba47c10a4d9a84b170b37932dc04e5) 1168 0 R (interfaceppl__Congruence__System__tag_a8ce02af4c13862f7988ad3e43b5290cf) 1170 0 R (interfaceppl__Congruence__System__tag_aa8fd21a451fe377a328d750951ce3 [...]
+/Limits [(interfaceppl__Congruence__System__tag_a5a6326e465cce738cb09fdd8df1d92ba) (interfaceppl__Congruence__System__tag_aa8fd21a451fe377a328d750951ce36f3)]
+>> endobj
+3529 0 obj <<
+/Names [(interfaceppl__Congruence__System__tag_abeb7cdeabf40c32d3aa0c33c0499bf97) 1212 0 R (interfaceppl__Congruence__System__tag_ae5f214d520a1f232251bee39685b62a2) 1163 0 R (interfaceppl__Congruence__System__tag_ae88c914d522014d2d181278bcfa9222f) 1177 0 R (interfaceppl__Congruence__System__tag_aed43bafe74e2b291d7b980c6ee8f3d5f) 1162 0 R (interfaceppl__Congruence__System__tag_af03d1a4f7f355971ac31ec1e4cb7297d) 1165 0 R (interfaceppl__Congruence__System__tag_af6cb7e34c1083df796fb12aa46373 [...]
+/Limits [(interfaceppl__Congruence__System__tag_abeb7cdeabf40c32d3aa0c33c0499bf97) (interfaceppl__Congruence__System__tag_af6cb7e34c1083df796fb12aa463739e6)]
+>> endobj
+3530 0 obj <<
+/Names [(interfaceppl__Congruence__tag) 418 0 R (interfaceppl__Congruence__tag_a0399dc1a987546af5d0491e72a6a05e4) 1224 0 R (interfaceppl__Congruence__tag_a08a4701b629d734ea0e11231a34514b0) 1221 0 R (interfaceppl__Congruence__tag_a10d11983038c7047547f4a68f8ea2b70) 1260 0 R (interfaceppl__Congruence__tag_a2845e4528b7b42c6c6527daceee21312) 1223 0 R (interfaceppl__Congruence__tag_a29295feb65378f2ba04c202f4b9a1bb3) 1265 0 R]
+/Limits [(interfaceppl__Congruence__tag) (interfaceppl__Congruence__tag_a29295feb65378f2ba04c202f4b9a1bb3)]
+>> endobj
+3531 0 obj <<
+/Names [(interfaceppl__Congruence__tag_a4ea3e6a8b8e929e318a5c1c450667d10) 1263 0 R (interfaceppl__Congruence__tag_a553952be8bff48ab2a4a8b2820efc047) 1257 0 R (interfaceppl__Congruence__tag_a5e1c7e98053b2262c5f56c46e2f04f05) 1256 0 R (interfaceppl__Congruence__tag_a6871446de8be708c37b2bedbf12c9b76) 1220 0 R (interfaceppl__Congruence__tag_a6d24fa81c885803e34fadd9332287d2e) 1216 0 R (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d) 1222 0 R]
+/Limits [(interfaceppl__Congruence__tag_a4ea3e6a8b8e929e318a5c1c450667d10) (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d)]
+>> endobj
+3532 0 obj <<
+/Names [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) 1259 0 R (interfaceppl__Congruence__tag_acaca085247f8483085877e21527a9cd6) 1261 0 R (interfaceppl__Congruence__tag_add70a09fb9b3cb0b8b7ce79d8d9ec14c) 1264 0 R (interfaceppl__Congruence__tag_af39f78c492db753013cbfd0177ffea60) 1266 0 R (interfaceppl__Congruence__tag_af61686ed9ede21b05016ee29f9de882b) 1262 0 R (interfaceppl__Constraint__System__const__iterator__tag) 419 0 R]
+/Limits [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) (interfaceppl__Constraint__System__const__iterator__tag)]
+>> endobj
+3533 0 obj <<
+/Names [(interfaceppl__Constraint__System__const__iterator__tag_a061420fd93cf031e877897142071c67d) 1269 0 R (interfaceppl__Constraint__System__const__iterator__tag_a18f6401539b34122053f5d76da0c3282) 1302 0 R (interfaceppl__Constraint__System__const__iterator__tag_a60ac68b3806bdf2e8b4805d661c52def) 1270 0 R (interfaceppl__Constraint__System__const__iterator__tag_a93c2b042e4c644ba6052c0a0130c74ff) 1304 0 R (interfaceppl__Constraint__System__const__iterator__tag_a9427aa22f07ee35e906d05bcd35 [...]
+/Limits [(interfaceppl__Constraint__System__const__iterator__tag_a061420fd93cf031e877897142071c67d) (interfaceppl__Constraint__System__const__iterator__tag_abd830cdbf47ea1e5f0cb88ba4e3dddd7)]
+>> endobj
+3534 0 obj <<
+/Names [(interfaceppl__Constraint__System__const__iterator__tag_adc0293455632f1e58de03ee68caa785a) 1300 0 R (interfaceppl__Constraint__System__tag) 420 0 R (interfaceppl__Constraint__System__tag_a06731c2e3b3d14dceffb5b81f1447bc8) 1367 0 R (interfaceppl__Constraint__System__tag_a0d28be41ac786db82ce3cb24e2db5543) 1356 0 R (interfaceppl__Constraint__System__tag_a1b4e8ec21c2f4b2b925c4e11474062b9) 1360 0 R (interfaceppl__Constraint__System__tag_a27f2fdd3945057760e252740c98573eb) 1363 0 R]
+/Limits [(interfaceppl__Constraint__System__const__iterator__tag_adc0293455632f1e58de03ee68caa785a) (interfaceppl__Constraint__System__tag_a27f2fdd3945057760e252740c98573eb)]
+>> endobj
+3535 0 obj <<
+/Names [(interfaceppl__Constraint__System__tag_a2967727ea790f1d517e1529e3f6be79e) 1312 0 R (interfaceppl__Constraint__System__tag_a3bd9634d21689bd4b0cbcb476a101e92) 1371 0 R (interfaceppl__Constraint__System__tag_a4316d3e1fd40ef324f4f9ac970481c9f) 1369 0 R (interfaceppl__Constraint__System__tag_a442076de6b59703f82c552f7e70aad72) 1359 0 R (interfaceppl__Constraint__System__tag_a56d19de5207d94e358a433995ce9730c) 1354 0 R (interfaceppl__Constraint__System__tag_a5e22cd8ea46cdef0e09027e6177fc [...]
+/Limits [(interfaceppl__Constraint__System__tag_a2967727ea790f1d517e1529e3f6be79e) (interfaceppl__Constraint__System__tag_a5e22cd8ea46cdef0e09027e6177fc838)]
+>> endobj
+3536 0 obj <<
+/Names [(interfaceppl__Constraint__System__tag_a6b54d1a028c5a0eff158b33ce1a6670f) 1313 0 R (interfaceppl__Constraint__System__tag_a7a018b29b6f334f666391ec729265c25) 1370 0 R (interfaceppl__Constraint__System__tag_a984fd654d7b169e74d13f6207d48fefb) 1352 0 R (interfaceppl__Constraint__System__tag_aa975ef75ddb5359966ff21eecca491d0) 1361 0 R (interfaceppl__Constraint__System__tag_ab1988eecd5bca9d4ad8dbd128c885b9b) 1311 0 R (interfaceppl__Constraint__System__tag_ac19488a8f4e64cb797b8402ea44b4 [...]
+/Limits [(interfaceppl__Constraint__System__tag_a6b54d1a028c5a0eff158b33ce1a6670f) (interfaceppl__Constraint__System__tag_ac19488a8f4e64cb797b8402ea44b456d)]
+>> endobj
+3537 0 obj <<
+/Names [(interfaceppl__Constraint__System__tag_ac8105464b2dbee48f8646bc2c2f1f2d8) 1373 0 R (interfaceppl__Constraint__System__tag_ad9b9ef9435b7a3bc8d92435ccf1cc0d7) 1357 0 R (interfaceppl__Constraint__System__tag_af8ebe9c0ce769746c2d2d01f6fcb4c91) 1366 0 R (interfaceppl__Constraint__tag) 421 0 R (interfaceppl__Constraint__tag_a08451f3fa991dc14b1b8874bdefd7cf2) 1461 0 R (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787) 1416 0 R]
+/Limits [(interfaceppl__Constraint__System__tag_ac8105464b2dbee48f8646bc2c2f1f2d8) (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787)]
+>> endobj
+3538 0 obj <<
+/Names [(interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) 1425 0 R (interfaceppl__Constraint__tag_a2d4948b195e743f39601a13610fcf94f) 1421 0 R (interfaceppl__Constraint__tag_a380ed65a246cd38c5ca3893b40eb4603) 1423 0 R (interfaceppl__Constraint__tag_a414a473844efce3515611fdc6b26e4de) 1428 0 R (interfaceppl__Constraint__tag_a702543ee828ef523fb5fe5ffdaf25925) 1420 0 R (interfaceppl__Constraint__tag_a87fc73217faaf213d5b5a810272be545) 1460 0 R]
+/Limits [(interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) (interfaceppl__Constraint__tag_a87fc73217faaf213d5b5a810272be545)]
+>> endobj
+3539 0 obj <<
+/Names [(interfaceppl__Constraint__tag_a8c466c744746ef7249afa54667470cf5) 1424 0 R (interfaceppl__Constraint__tag_a90e279d0af3491d3cc793595e3e1bbff) 1459 0 R (interfaceppl__Constraint__tag_a94ca29d276a68f3f75aa62c8ab6109e4) 1462 0 R (interfaceppl__Constraint__tag_a9a30e394a9c84bb9d2debda31433e6b4) 1458 0 R (interfaceppl__Constraint__tag_aadbcd3b735dae0f714d1134cf8e6b911) 1427 0 R (interfaceppl__Constraint__tag_ab93e22d57d1f5d94ae97ba1b9de9e3f9) 1418 0 R]
+/Limits [(interfaceppl__Constraint__tag_a8c466c744746ef7249afa54667470cf5) (interfaceppl__Constraint__tag_ab93e22d57d1f5d94ae97ba1b9de9e3f9)]
+>> endobj
+3540 0 obj <<
+/Names [(interfaceppl__Constraint__tag_abfb19498f2647b44344c6a84fdd6cd2d) 1419 0 R (interfaceppl__Constraint__tag_ac21bd81d2f33da4dc915020bf16c801a) 1422 0 R (interfaceppl__Generator__System__const__iterator__tag) 422 0 R (interfaceppl__Generator__System__const__iterator__tag_a51dfb5223b7487379681d4cc1583917f) 1470 0 R (interfaceppl__Generator__System__const__iterator__tag_a7d4bec3e6101e95b57973dcab5880a51) 1499 0 R (interfaceppl__Generator__System__const__iterator__tag_ab823e62915ff8952 [...]
+/Limits [(interfaceppl__Constraint__tag_abfb19498f2647b44344c6a84fdd6cd2d) (interfaceppl__Generator__System__const__iterator__tag_ab823e62915ff895212640119f062252c)]
+>> endobj
+3541 0 obj <<
+/Names [(interfaceppl__Generator__System__const__iterator__tag_ac5344d92361779d92fcb36acf2d406ae) 1500 0 R (interfaceppl__Generator__System__const__iterator__tag_acb94e9072062c0827a16766cef2c1a5e) 1471 0 R (interfaceppl__Generator__System__const__iterator__tag_acd03b90ea728537b78a669806309a5c0) 1466 0 R (interfaceppl__Generator__System__const__iterator__tag_ae2334b2eefe8cae2ad750dfea1f7cade) 1468 0 R (interfaceppl__Generator__System__tag) 423 0 R (interfaceppl__Generator__System__tag_a06 [...]
+/Limits [(interfaceppl__Generator__System__const__iterator__tag_ac5344d92361779d92fcb36acf2d406ae) (interfaceppl__Generator__System__tag_a067f83ba740e5b6c0c585a5175723a0b)]
+>> endobj
+3542 0 obj <<
+/Names [(interfaceppl__Generator__System__tag_a33e20d1de127c9232d2d1188bee532ef) 1504 0 R (interfaceppl__Generator__System__tag_a3d3687abfb3878a67fca687b8e4ff0b9) 1553 0 R (interfaceppl__Generator__System__tag_a3f5244b219701d5ba5939982a1d11d97) 1551 0 R (interfaceppl__Generator__System__tag_a540cea530eaa9c142b16fbf01f781673) 1511 0 R (interfaceppl__Generator__System__tag_a7752ae55e7cd4d014f6498348ef47865) 1505 0 R (interfaceppl__Generator__System__tag_a888341fcf1079aaaa4dd7b532662729c) 1 [...]
+/Limits [(interfaceppl__Generator__System__tag_a33e20d1de127c9232d2d1188bee532ef) (interfaceppl__Generator__System__tag_a888341fcf1079aaaa4dd7b532662729c)]
+>> endobj
+3543 0 obj <<
+/Names [(interfaceppl__Generator__System__tag_aa7260438cfc5fa383c7fb80b127f8315) 1545 0 R (interfaceppl__Generator__System__tag_aad90ffcd536cd0d48ee183bca02103fc) 1557 0 R (interfaceppl__Generator__System__tag_ab1316806c765a595ddfa4de5e8d971f6) 1507 0 R (interfaceppl__Generator__System__tag_aba231f6ac03d82cbf693a6a29a5c2665) 1555 0 R (interfaceppl__Generator__System__tag_ae12a1e70aa5010e6617de857f51574a8) 1554 0 R (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3) 1 [...]
+/Limits [(interfaceppl__Generator__System__tag_aa7260438cfc5fa383c7fb80b127f8315) (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3)]
+>> endobj
+3544 0 obj <<
+/Names [(interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) 1512 0 R (interfaceppl__Generator__System__tag_af5253fb7ef85e1875cc453d9a9998459) 1509 0 R (interfaceppl__Generator__System__tag_af5911dc31286d92c979c7ff89c249bc8) 1550 0 R (interfaceppl__Generator__System__tag_afcc12e4f52a8ff85d16ebfc424447b63) 1547 0 R (interfaceppl__Generator__tag) 424 0 R (interfaceppl__Generator__tag_a048cb229297e24f6d0f7ab4e4351e2c2) 1606 0 R]
+/Limits [(interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) (interfaceppl__Generator__tag_a048cb229297e24f6d0f7ab4e4351e2c2)]
+>> endobj
+3545 0 obj <<
+/Names [(interfaceppl__Generator__tag_a140a26e6f6dc525c742aca71f598ed3c) 1614 0 R (interfaceppl__Generator__tag_a278a22338f8428e328daf84dea4f94e7) 1609 0 R (interfaceppl__Generator__tag_a297969dd313ebb370c9419915398aaf2) 1608 0 R (interfaceppl__Generator__tag_a30161047ab7c47dd7a68a852e98ed83e) 1618 0 R (interfaceppl__Generator__tag_a30d13726e3b27f1be7e5eb05a7814bb3) 1610 0 R (interfaceppl__Generator__tag_a318f5f2972203c84ea0fdb4b82bbab1c) 1612 0 R]
+/Limits [(interfaceppl__Generator__tag_a140a26e6f6dc525c742aca71f598ed3c) (interfaceppl__Generator__tag_a318f5f2972203c84ea0fdb4b82bbab1c)]
+>> endobj
+3546 0 obj <<
+/Names [(interfaceppl__Generator__tag_a5d89173a47e10f469337343cfb807218) 1616 0 R (interfaceppl__Generator__tag_a6a901364857f84dc0f111a29330c33f9) 1619 0 R (interfaceppl__Generator__tag_a6d184edbb85d3c2747bb6097f7de17ad) 1617 0 R (interfaceppl__Generator__tag_a74a772b49c2c3190ad8501ffa0337d2f) 1615 0 R (interfaceppl__Generator__tag_aafa09f891353748a46868d342cc91cbc) 1603 0 R (interfaceppl__Generator__tag_ab3fe811bb3a347e553576dadff55339e) 1607 0 R]
+/Limits [(interfaceppl__Generator__tag_a5d89173a47e10f469337343cfb807218) (interfaceppl__Generator__tag_ab3fe811bb3a347e553576dadff55339e)]
+>> endobj
+3547 0 obj <<
+/Names [(interfaceppl__Generator__tag_ace16d45c8fbb00ad5b616aa4344fb798) 1601 0 R (interfaceppl__Generator__tag_ad6d26ca0f256b0d9a45173e7d83ee4cc) 1620 0 R (interfaceppl__Generator__tag_af2fd5edcf647f4bc5b64cf0f4f712a51) 1611 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag) 425 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_a0632eaac5ec676910e433016619b3e85) 1646 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_a1842c4ba3cd1adb1e1bccef3c [...]
+/Limits [(interfaceppl__Generator__tag_ace16d45c8fbb00ad5b616aa4344fb798) (interfaceppl__Grid__Generator__System__const__iterator__tag_a1842c4ba3cd1adb1e1bccef3cfcfa57f)]
+>> endobj
+3548 0 obj <<
+/Names [(interfaceppl__Grid__Generator__System__const__iterator__tag_a813ac0651ebac0120830cedf1ea58395) 1654 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_ac23bf247df0b2721e97c8eeb8945adf1) 1648 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_af2932a2fa90f54f604e340d0e2eac7ba) 1650 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_af4cdf3fbe1977a24a90904e02efd791b) 1656 0 R (interfaceppl__Grid__Generator__System__const__iterator__tag_af8 [...]
+/Limits [(interfaceppl__Grid__Generator__System__const__iterator__tag_a813ac0651ebac0120830cedf1ea58395) (interfaceppl__Grid__Generator__System__tag)]
+>> endobj
+3549 0 obj <<
+/Names [(interfaceppl__Grid__Generator__System__tag_a121252cea61436e0df74e008b80c13b7) 1703 0 R (interfaceppl__Grid__Generator__System__tag_a22e81aa8cd862935e9a0abab515cf838) 1740 0 R (interfaceppl__Grid__Generator__System__tag_a303533574d5d5d4d8f58e2d8646baa69) 1696 0 R (interfaceppl__Grid__Generator__System__tag_a3094a8093769d647b9f477e14d53a3a0) 1705 0 R (interfaceppl__Grid__Generator__System__tag_a3671e52fd03a1c456c630b7c5c632df8) 1708 0 R (interfaceppl__Grid__Generator__System__tag_ [...]
+/Limits [(interfaceppl__Grid__Generator__System__tag_a121252cea61436e0df74e008b80c13b7) (interfaceppl__Grid__Generator__System__tag_a4578b5352510727810a7c3be32208aae)]
+>> endobj
+3550 0 obj <<
+/Names [(interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) 1710 0 R (interfaceppl__Grid__Generator__System__tag_a95c612736a3e7524077dd5c81bf2a105) 1698 0 R (interfaceppl__Grid__Generator__System__tag_a9fc89d795c20b4270756269edf1b9604) 1702 0 R (interfaceppl__Grid__Generator__System__tag_aa6324c2e330df63ad428eec9182fcc4d) 1745 0 R (interfaceppl__Grid__Generator__System__tag_aaf6f8270e3742973e0df7dcc9132f7ae) 1746 0 R (interfaceppl__Grid__Generator__System__tag_ [...]
+/Limits [(interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) (interfaceppl__Grid__Generator__System__tag_abc859551651eca1bcc3839f62d45dbfe)]
+>> endobj
+3551 0 obj <<
+/Names [(interfaceppl__Grid__Generator__System__tag_ac64c8548738734fedbc94f03519b803a) 1697 0 R (interfaceppl__Grid__Generator__System__tag_ad00a2a1877537fa49a41013078ee2bb6) 1744 0 R (interfaceppl__Grid__Generator__System__tag_ad4d88d3daaa672264c63c83071c2021b) 1700 0 R (interfaceppl__Grid__Generator__System__tag_ae2c6fa9b0155fd9428ff3abcf1a66805) 1706 0 R (interfaceppl__Grid__Generator__System__tag_af29295940b1ad0b6b48cc44e92f04060) 1743 0 R (interfaceppl__Grid__Generator__tag) 459 0 R]
+/Limits [(interfaceppl__Grid__Generator__System__tag_ac64c8548738734fedbc94f03519b803a) (interfaceppl__Grid__Generator__tag)]
+>> endobj
+3552 0 obj <<
+/Names [(interfaceppl__Grid__Generator__tag_a0ca9a6d6894e381babab8f958c194f07) 1797 0 R (interfaceppl__Grid__Generator__tag_a190a7c46776178432e89c9525db039ab) 1800 0 R (interfaceppl__Grid__Generator__tag_a2a64fe7b9774c990bd9db8aecd2dacea) 1787 0 R (interfaceppl__Grid__Generator__tag_a3fc151fc10282a5ede395e9b8a5502e2) 1798 0 R (interfaceppl__Grid__Generator__tag_a6cb7351e1bb87181f7e6c946db398b5b) 1784 0 R (interfaceppl__Grid__Generator__tag_a85958538f17770d4ae66bcd179d747a1) 1790 0 R]
+/Limits [(interfaceppl__Grid__Generator__tag_a0ca9a6d6894e381babab8f958c194f07) (interfaceppl__Grid__Generator__tag_a85958538f17770d4ae66bcd179d747a1)]
+>> endobj
+3553 0 obj <<
+/Names [(interfaceppl__Grid__Generator__tag_a8b96d560404b7b7ee0ec7ea1aef80280) 1794 0 R (interfaceppl__Grid__Generator__tag_a99aac01eb1b8adc3667bbd3db68e8d34) 1792 0 R (interfaceppl__Grid__Generator__tag_a9b452ce4baaf1c1644a6eb33658ae48a) 1789 0 R (interfaceppl__Grid__Generator__tag_a9c2a70f5f90ec3da123f549d6ca9fe4a) 1749 0 R (interfaceppl__Grid__Generator__tag_aa8e9420c29d8c75e775c4fd609830769) 1795 0 R (interfaceppl__Grid__Generator__tag_ac5a83c9e42e34b313e12a6cef4470a75) 1799 0 R]
+/Limits [(interfaceppl__Grid__Generator__tag_a8b96d560404b7b7ee0ec7ea1aef80280) (interfaceppl__Grid__Generator__tag_ac5a83c9e42e34b313e12a6cef4470a75)]
+>> endobj
+3554 0 obj <<
+/Names [(interfaceppl__Grid__Generator__tag_acc700387404f10208584c1a847a6f328) 1785 0 R (interfaceppl__Grid__Generator__tag_adfc86b3b2966514ba2e2292584f68c08) 1791 0 R (interfaceppl__Grid__Generator__tag_afb6f23292760d6d55c57b5722f604897) 1796 0 R (interfaceppl__Linear__Expression__tag) 460 0 R (interfaceppl__Linear__Expression__tag_a1c54d4109f395752ea23822cee000d04) 1854 0 R (interfaceppl__Linear__Expression__tag_a225478fba412d40b785e2b41809cc90d) 1904 0 R]
+/Limits [(interfaceppl__Grid__Generator__tag_acc700387404f10208584c1a847a6f328) (interfaceppl__Linear__Expression__tag_a225478fba412d40b785e2b41809cc90d)]
+>> endobj
+3555 0 obj <<
+/Names [(interfaceppl__Linear__Expression__tag_a3530a20e5985d6da8acabad37bfe0e93) 1909 0 R (interfaceppl__Linear__Expression__tag_a46773b226d490e5bbf6f3d587cf29dc4) 1914 0 R (interfaceppl__Linear__Expression__tag_a50bcfefbf053e770951fa02c2e2eb112) 1915 0 R (interfaceppl__Linear__Expression__tag_a512810c3e349a2f01217c6e426645260) 1846 0 R (interfaceppl__Linear__Expression__tag_a5f05719adb05b4fc86b33bbcf63884eb) 1903 0 R (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6 [...]
+/Limits [(interfaceppl__Linear__Expression__tag_a3530a20e5985d6da8acabad37bfe0e93) (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6822)]
+>> endobj
+3556 0 obj <<
+/Names [(interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) 1913 0 R (interfaceppl__Linear__Expression__tag_a7d65378709f5a0c73e711f5528385990) 1850 0 R (interfaceppl__Linear__Expression__tag_a8172cf537ccecb7826eb21837b8d7e7b) 1911 0 R (interfaceppl__Linear__Expression__tag_a84c2e36e2ae01775ce542ebc83739726) 1905 0 R (interfaceppl__Linear__Expression__tag_a86c148ed14d1a2781e07bea5be7fb434) 1863 0 R (interfaceppl__Linear__Expression__tag_a9ab7b109b1acae567c915b1db83b5 [...]
+/Limits [(interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) (interfaceppl__Linear__Expression__tag_a9ab7b109b1acae567c915b1db83b5283)]
+>> endobj
+3557 0 obj <<
+/Names [(interfaceppl__Linear__Expression__tag_aa891671c2b9414353067da44a108ac1d) 1845 0 R (interfaceppl__Linear__Expression__tag_ab348eeffa0a61124b880932c35d0188b) 1902 0 R (interfaceppl__Linear__Expression__tag_abbbdd7f3c4800ef97b642142cd68648d) 1858 0 R (interfaceppl__Linear__Expression__tag_abfe9ef58fb96938e1c26b63e2b4ce0d1) 1907 0 R (interfaceppl__Linear__Expression__tag_ac21bf6dd42b915ff6f157fb73fe396e0) 1916 0 R (interfaceppl__Linear__Expression__tag_ae7af7908bffe9b331262dcf8fd020 [...]
+/Limits [(interfaceppl__Linear__Expression__tag_aa891671c2b9414353067da44a108ac1d) (interfaceppl__Linear__Expression__tag_ae7af7908bffe9b331262dcf8fd020b7f)]
+>> endobj
+3558 0 obj <<
+/Names [(interfaceppl__Linear__Expression__tag_ae861c5919e346c3966c43edc4cd47276) 1901 0 R (interfaceppl__Linear__Expression__tag_af232ff2f43109950ac1b0f5d124cf4cc) 1860 0 R (interfaceppl__Linear__Expression__tag_af78187771d58e90c174eeba577a471d5) 1917 0 R (interfaceppl__Linear__Expression__tag_af99b9dc1c16751ce872dab5245c22fdf) 1856 0 R (interfaceppl__Linear__Expression__tag_afc650c1c744fbfc4dbd15293b9827776) 1848 0 R (interfaceppl__MIP__Problem__tag) 461 0 R]
+/Limits [(interfaceppl__Linear__Expression__tag_ae861c5919e346c3966c43edc4cd47276) (interfaceppl__MIP__Problem__tag)]
+>> endobj
+3559 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_a086e697a92a664c83721e0c442d45271) 2093 0 R (interfaceppl__MIP__Problem__tag_a0d5a001977b49f77a4514de614bf3c4c) 2030 0 R (interfaceppl__MIP__Problem__tag_a19ff64e7fd60a4e08c782a4683d62167) 2037 0 R (interfaceppl__MIP__Problem__tag_a2b4edec92d54747f5f1d2904407e744a) 2101 0 R (interfaceppl__MIP__Problem__tag_a32423400858178cc05f325962afd44e2) 1960 0 R (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79) 1966 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_a086e697a92a664c83721e0c442d45271) (interfaceppl__MIP__Problem__tag_a34e5d32c224ab8293ff78c85d86e5f79)]
+>> endobj
+3560 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_a3659fef24b67be6b668955bc6865e779) 2044 0 R (interfaceppl__MIP__Problem__tag_a36c57e3007fcb2340dc415f8431df7aa) 2046 0 R (interfaceppl__MIP__Problem__tag_a3789c297e202c735dbd829cd6cbed989) 2092 0 R (interfaceppl__MIP__Problem__tag_a396b429302ce49ea9915778c317b81d2) 2088 0 R (interfaceppl__MIP__Problem__tag_a39e443628f6b73203b0f66189b8bc1c6) 2051 0 R (interfaceppl__MIP__Problem__tag_a3ff750009bec94ab2c9a01139ba22420) 2100 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_a3659fef24b67be6b668955bc6865e779) (interfaceppl__MIP__Problem__tag_a3ff750009bec94ab2c9a01139ba22420)]
+>> endobj
+3561 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_a43a14864f62b4528d6c87856cba4da34) 2098 0 R (interfaceppl__MIP__Problem__tag_a44aa5cc75376dddfb9005dd74b27ff68) 2042 0 R (interfaceppl__MIP__Problem__tag_a4b9b7034fd7b17eff672d49a7c85ac2f) 2036 0 R (interfaceppl__MIP__Problem__tag_a4da79f8c645b945d52635733c3f63d7d) 2032 0 R (interfaceppl__MIP__Problem__tag_a5357e1ed14407abf82149fe878789efd) 2041 0 R (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4) 2047 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_a43a14864f62b4528d6c87856cba4da34) (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4)]
+>> endobj
+3562 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) 2034 0 R (interfaceppl__MIP__Problem__tag_a70c652d969734f6a69841d30a5e9033b) 1973 0 R (interfaceppl__MIP__Problem__tag_a7397b715c2ccf3f6fcf2f3900efe10d6) 2091 0 R (interfaceppl__MIP__Problem__tag_a8190bd5fde521e37c585c5c59b65f90d) 2094 0 R (interfaceppl__MIP__Problem__tag_a894587e76b98f15a8ae120327dc9d532) 2085 0 R (interfaceppl__MIP__Problem__tag_a8bda1b8ba9119202c16f88fdb19a535b) 1975 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) (interfaceppl__MIP__Problem__tag_a8bda1b8ba9119202c16f88fdb19a535b)]
+>> endobj
+3563 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_a8ca7076566ebe098ff3bc307b4d91899) 1962 0 R (interfaceppl__MIP__Problem__tag_a8efd1f7de8fb2bbe6e33aff1d4184078) 1961 0 R (interfaceppl__MIP__Problem__tag_a8f2ab3d77bca7257df14bda9261a1326) 1963 0 R (interfaceppl__MIP__Problem__tag_a97fad1530ac4a3704d08097aec4bf206) 2090 0 R (interfaceppl__MIP__Problem__tag_a9dfe99ee7d8e2b1d7360ab0119bd12eb) 1965 0 R (interfaceppl__MIP__Problem__tag_aa1663bce444a20240c852c9443005cc0) 1977 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_a8ca7076566ebe098ff3bc307b4d91899) (interfaceppl__MIP__Problem__tag_aa1663bce444a20240c852c9443005cc0)]
+>> endobj
+3564 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_ab50ac757b6cb922c40504dc69c983568) 2039 0 R (interfaceppl__MIP__Problem__tag_ab95e9f75dd971827c8a9a6b42faeeac7) 1969 0 R (interfaceppl__MIP__Problem__tag_ac379f873623c0fec37d988c2c374ffe5) 1968 0 R (interfaceppl__MIP__Problem__tag_ac39a1aacb6aa4f54150e2b138d7b36f2) 2040 0 R (interfaceppl__MIP__Problem__tag_acdbb5fd3fa1ab9faed26fc5be47cc0d2) 2052 0 R (interfaceppl__MIP__Problem__tag_ad2154705f0854002a4f44f95580df9c7) 2029 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_ab50ac757b6cb922c40504dc69c983568) (interfaceppl__MIP__Problem__tag_ad2154705f0854002a4f44f95580df9c7)]
+>> endobj
+3565 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_ad8caceee4f21496294aee9eb9aea4ec1) 2089 0 R (interfaceppl__MIP__Problem__tag_adf86eb3611cbe63b34ef195bc87a7312) 1959 0 R (interfaceppl__MIP__Problem__tag_ae5845918fa5037ca4e9bdde4a4a3ecf2) 2084 0 R (interfaceppl__MIP__Problem__tag_ae7dc964062c194e3ae8eef0a828164ae) 2087 0 R (interfaceppl__MIP__Problem__tag_aebfd121256089b1415f3bc6989c25bbb) 2095 0 R (interfaceppl__MIP__Problem__tag_af349e801a615b2014d36c30fdb56022a) 2049 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_ad8caceee4f21496294aee9eb9aea4ec1) (interfaceppl__MIP__Problem__tag_af349e801a615b2014d36c30fdb56022a)]
+>> endobj
+3566 0 obj <<
+/Names [(interfaceppl__MIP__Problem__tag_af59141db49e5141da6ac594d43ead2f7) 1971 0 R (interfaceppl__MIP__Problem__tag_af63454e50c1937573c75495f3cb4c1d2) 1964 0 R (interfaceppl__PIP__Decision__Node__tag) 462 0 R (interfaceppl__PIP__Decision__Node__tag_a384e3002cf83ca2e73c4290d8629e043) 2127 0 R (interfaceppl__PIP__Decision__Node__tag_a4c12656e0256a4db3311855f9e94a36d) 2128 0 R (interfaceppl__PIP__Decision__Node__tag_a6455bb2686ced2d1a463955f6cbfa542) 2125 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_af59141db49e5141da6ac594d43ead2f7) (interfaceppl__PIP__Decision__Node__tag_a6455bb2686ced2d1a463955f6cbfa542)]
+>> endobj
+3567 0 obj <<
+/Names [(interfaceppl__PIP__Decision__Node__tag_a6b1a2446aa655ae65ce51b8a025c5751) 2130 0 R (interfaceppl__PIP__Decision__Node__tag_a8f1b879675bf41b40bab41ebe9a97346) 2129 0 R (interfaceppl__PIP__Decision__Node__tag_ab8a5eaf323d5fb0076b2ce079f9f5fc4) 2131 0 R (interfaceppl__PIP__Problem__tag) 463 0 R (interfaceppl__PIP__Problem__tag_a00a4b6909bbb8ab2fbf602d8589707b9) 2177 0 R (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3) 2278 0 R]
+/Limits [(interfaceppl__PIP__Decision__Node__tag_a6b1a2446aa655ae65ce51b8a025c5751) (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3)]
+>> endobj
+3568 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) 2286 0 R (interfaceppl__PIP__Problem__tag_a0fa81de47c40e47efad3842142159fe5) 2281 0 R (interfaceppl__PIP__Problem__tag_a1492c1ef5bc77d977d14267b2344ddf1) 2165 0 R (interfaceppl__PIP__Problem__tag_a182da2aa2af850a82ea4b4ab3773a759) 2284 0 R (interfaceppl__PIP__Problem__tag_a1ebc3efbeb7fcf8da5556b365a9a1839) 2247 0 R (interfaceppl__PIP__Problem__tag_a227bae7ca5019a2488065ba188acbc84) 2282 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) (interfaceppl__PIP__Problem__tag_a227bae7ca5019a2488065ba188acbc84)]
+>> endobj
+3569 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_a239ff7924a1294205e5057d1048986ac) 2279 0 R (interfaceppl__PIP__Problem__tag_a2828646f7257660ec4a2a6a06427a715) 2245 0 R (interfaceppl__PIP__Problem__tag_a2f230174a1c6cf8b3d0115ab268d02e1) 2238 0 R (interfaceppl__PIP__Problem__tag_a41b5af390cf2af727c18a043bb869ffc) 2234 0 R (interfaceppl__PIP__Problem__tag_a4c043227bbacc5af1e44439c140f95fc) 2287 0 R (interfaceppl__PIP__Problem__tag_a4f7ccdbb25ecfb4dcd2facbed54f26b7) 2232 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_a239ff7924a1294205e5057d1048986ac) (interfaceppl__PIP__Problem__tag_a4f7ccdbb25ecfb4dcd2facbed54f26b7)]
+>> endobj
+3570 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_a51082042eaafc2db84f50f28d3d5b646) 2229 0 R (interfaceppl__PIP__Problem__tag_a65ace8cdf5e2fbf6e82c6834d3d29ada) 2240 0 R (interfaceppl__PIP__Problem__tag_a66b9c383e8c77d79c0ffbd2f99987a94) 2239 0 R (interfaceppl__PIP__Problem__tag_a68099fb9bb1067212c3e998b00255b24) 2237 0 R (interfaceppl__PIP__Problem__tag_a6b6bd9554098c88af56947f5a9e02818) 2248 0 R (interfaceppl__PIP__Problem__tag_a7387184a11ae23fd66b730a1ae720215) 2231 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_a51082042eaafc2db84f50f28d3d5b646) (interfaceppl__PIP__Problem__tag_a7387184a11ae23fd66b730a1ae720215)]
+>> endobj
+3571 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_a73faac81cdd75868a90e0769e6e810ce) 2166 0 R (interfaceppl__PIP__Problem__tag_a76361c178cf8799f530f17e791e8d0b1) 2236 0 R (interfaceppl__PIP__Problem__tag_a7fde6bb756bf47a2801a8de40b1472d5) 2170 0 R (interfaceppl__PIP__Problem__tag_a83ff647a9f553f233355dcfe08f925ca) 2164 0 R (interfaceppl__PIP__Problem__tag_a8e179abb162b61259eb3923f067944ad) 2230 0 R (interfaceppl__PIP__Problem__tag_a9f81c698a50d6b97d896dca8cda4042c) 2243 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_a73faac81cdd75868a90e0769e6e810ce) (interfaceppl__PIP__Problem__tag_a9f81c698a50d6b97d896dca8cda4042c)]
+>> endobj
+3572 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_aa91485e68401872e9369580d71074838) 2169 0 R (interfaceppl__PIP__Problem__tag_aaa0eabf4e1c5b3bacdbadbc4fceeb6e7) 2288 0 R (interfaceppl__PIP__Problem__tag_ab5075367b0d60e3b979b18b4b8b36f55) 2163 0 R (interfaceppl__PIP__Problem__tag_ab51c22e30fbf76be062c500f2187b0a9) 2285 0 R (interfaceppl__PIP__Problem__tag_ab69f3fd82a3be2e835c16d812f6ef39f) 2280 0 R (interfaceppl__PIP__Problem__tag_ab98bad036b29cb094195b1d8e8212c71) 2168 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_aa91485e68401872e9369580d71074838) (interfaceppl__PIP__Problem__tag_ab98bad036b29cb094195b1d8e8212c71)]
+>> endobj
+3573 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_abe40c32264f8b51a8c0d259d0777afc3) 2290 0 R (interfaceppl__PIP__Problem__tag_aca972841d5888907f7dcf13b24134e27) 2241 0 R (interfaceppl__PIP__Problem__tag_ad5da07355917717a2b3ea402a2a27cec) 2171 0 R (interfaceppl__PIP__Problem__tag_add80dff3a130d086d15874ada6e8d8ae) 2173 0 R (interfaceppl__PIP__Problem__tag_adeef8fc42bbbeee0f82d5da5ed6b9fb6) 2295 0 R (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3) 2167 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_abe40c32264f8b51a8c0d259d0777afc3) (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3)]
+>> endobj
+3574 0 obj <<
+/Names [(interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) 2175 0 R (interfaceppl__PIP__Problem__tag_aee2f9e1a5347b0fd66ca5f9aec8009e1) 2289 0 R (interfaceppl__PIP__Solution__Node__tag) 464 0 R (interfaceppl__PIP__Solution__Node__tag_a1eef951ad8a431e18a3e9d6a9e56594d) 2322 0 R (interfaceppl__PIP__Solution__Node__tag_a6c514d39c645b2b47002b597d998f527) 2339 0 R (interfaceppl__PIP__Solution__Node__tag_a9526c7cca61983debf9ced54bf89aa7f) 2320 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) (interfaceppl__PIP__Solution__Node__tag_a9526c7cca61983debf9ced54bf89aa7f)]
+>> endobj
+3575 0 obj <<
+/Names [(interfaceppl__PIP__Solution__Node__tag_ad4796bea8c483cdbd25979da0c81007a) 2321 0 R (interfaceppl__PIP__Solution__Node__tag_ad6ece2828d918bbd4cded63665b88e96) 2323 0 R (interfaceppl__PIP__Solution__Node__tag_af60a51929fc4969d04191e4f524f6031) 2338 0 R (interfaceppl__PIP__Tree__Node__tag) 465 0 R (interfaceppl__PIP__Tree__Node__tag_a0095864fde9ce398bbcdc67fd7d7f795) 2380 0 R (interfaceppl__PIP__Tree__Node__tag_a242792f5af528730b645b3831b4c6dab) 2347 0 R]
+/Limits [(interfaceppl__PIP__Solution__Node__tag_ad4796bea8c483cdbd25979da0c81007a) (interfaceppl__PIP__Tree__Node__tag_a242792f5af528730b645b3831b4c6dab)]
+>> endobj
+3576 0 obj <<
+/Names [(interfaceppl__PIP__Tree__Node__tag_a331092da872154b17ae2e8d675b88145) 2388 0 R (interfaceppl__PIP__Tree__Node__tag_a4a89db919ecd790e62027d3559d8d539) 2385 0 R (interfaceppl__PIP__Tree__Node__tag_a53680b4913fbc0c8bbf3a3f4097f672d) 2381 0 R (interfaceppl__PIP__Tree__Node__tag_a5c88187145d242b27660f9247fe83ded) 2391 0 R (interfaceppl__PIP__Tree__Node__tag_a74f00bca9deb1df435f5f32e16be9849) 2390 0 R (interfaceppl__PIP__Tree__Node__tag_a83a66e20c2502b8a2cf7f8a4b9925769) 2389 0 R]
+/Limits [(interfaceppl__PIP__Tree__Node__tag_a331092da872154b17ae2e8d675b88145) (interfaceppl__PIP__Tree__Node__tag_a83a66e20c2502b8a2cf7f8a4b9925769)]
+>> endobj
+3577 0 obj <<
+/Names [(interfaceppl__PIP__Tree__Node__tag_a8fd26a28b5329cecc22ad0a6958a9ea8) 2383 0 R (interfaceppl__PIP__Tree__Node__tag_a97dd1858b35adebeeb6f0d2edeecb693) 2378 0 R (interfaceppl__PIP__Tree__Node__tag_a9fa4831093fbb97122699c344264e792) 2345 0 R (interfaceppl__PIP__Tree__Node__tag_ad9ec458d7b2f78d11393475db3e4cfe3) 2387 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag) 466 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a0746b37f80c4 [...]
+/Limits [(interfaceppl__PIP__Tree__Node__tag_a8fd26a28b5329cecc22ad0a6958a9ea8) (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a0746b37f80c4be687b0dc5ded6190002)]
+>> endobj
+3578 0 obj <<
+/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a62836b9156289bd880bf9f32056a4dee) 2437 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a70541b12c8a9b281b3aa4f9c21624b3c) 2433 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a8d39b1769491b0ee262118bfa31bcc67) 2426 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_abc4dd4b94a80075012b0f30b13339632) 2435 0 R (interfaceppl__Pointset_ [...]
+/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_a62836b9156289bd880bf9f32056a4dee) (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_ad69ffccc04d33132e31a91296afad78d)]
+>> endobj
+3579 0 obj <<
+/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_adb6f375b8aad58a31f6a60abb7a9b1e2) 2430 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_add8c6ae913a7e3f0a7e1470a23ba04a3) 2428 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag) 468 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a1785059acd1bf60dcf4cda0044cc94b5) 2493 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a35180fb6 [...]
+/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__const__iterator__tag_adb6f375b8aad58a31f6a60abb7a9b1e2) (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a64b1a8e66388915a57bfd0b53a2e46c5)]
+>> endobj
+3580 0 obj <<
+/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) 2479 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a7e3f8c5b2e614c5d18783c2ef7b092e1) 2475 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a98e7f050a579e9deeb71a75758238928) 2477 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_aa82f0fc73b5f98fab74070ee92a100cf) 2481 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__it [...]
+/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_abe46bba93c5ddcf4cf4cafdb0d74f942)]
+>> endobj
+3581 0 obj <<
+/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag) 467 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a024a52502b35029ff2ba102323d8ae5b) 2528 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a0bf696420bbdc5c2ef0993f61f2273b7) 2541 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a1b2ee4d834f0651a41647ac5b5e0f912) 2535 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a26a124537b8995832b2cb157abc7cf07) 2524 0 R (interfaceppl__Pointset__Powe [...]
+/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag) (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_a91f0ccf4325f53430d7347ca73182f52)]
+>> endobj
+3582 0 obj <<
+/Names [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aae5f47efa7c023e45aed9be161dce99f) 2532 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_ab595ea1166752d23aba600af43417bd8) 2538 0 R (interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aeb8456ecf06307c108046a8c665154c9) 2526 0 R (interfaceppl__Polyhedron__tag) 469 0 R (interfaceppl__Polyhedron__tag_a0184ad10aeca27f95d249d3a7e061b46) 3035 0 R (interfaceppl__Polyhedron__tag_a01daecb5bf8e498e7d539d7f3ba8496e) 2865 0 R]
+/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__tag_aae5f47efa7c023e45aed9be161dce99f) (interfaceppl__Polyhedron__tag_a01daecb5bf8e498e7d539d7f3ba8496e)]
+>> endobj
+3583 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a06c7c974043c12bcf349c119e73cc681) 3092 0 R (interfaceppl__Polyhedron__tag_a0b031bedcfb70f485bab922596bce1c8) 2875 0 R (interfaceppl__Polyhedron__tag_a0e494452cce5a8916f4fe97a1c79e237) 2792 0 R (interfaceppl__Polyhedron__tag_a141c3283de2a46f2fcb278dcdca0558f) 2773 0 R (interfaceppl__Polyhedron__tag_a191744753f79b939c8d61efe45778bd8) 2867 0 R (interfaceppl__Polyhedron__tag_a1bd806c292d0576b94d3084b21736061) 2625 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a06c7c974043c12bcf349c119e73cc681) (interfaceppl__Polyhedron__tag_a1bd806c292d0576b94d3084b21736061)]
+>> endobj
+3584 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a1dd00b705631c579994677fea3a86d63) 2780 0 R (interfaceppl__Polyhedron__tag_a1e5a2940765710cccea4ef4f1b7f1092) 3097 0 R (interfaceppl__Polyhedron__tag_a27fdc62bc2cae150c7d710a8e312a40d) 2695 0 R (interfaceppl__Polyhedron__tag_a2dc649f0ee90ea5af999e3c0bae54bcb) 2693 0 R (interfaceppl__Polyhedron__tag_a2f80d4608b0b75948b50dd862a14df66) 2868 0 R (interfaceppl__Polyhedron__tag_a304dd0846a62cb4a9f79806ea82cee5d) 2631 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a1dd00b705631c579994677fea3a86d63) (interfaceppl__Polyhedron__tag_a304dd0846a62cb4a9f79806ea82cee5d)]
+>> endobj
+3585 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a357ddb19493a385970c56bf4847a07a1) 2769 0 R (interfaceppl__Polyhedron__tag_a381b0e6e2e58df417ff578ed6d715520) 2966 0 R (interfaceppl__Polyhedron__tag_a39ee8e60c1d4d6faa40986d8fba28d5d) 2772 0 R (interfaceppl__Polyhedron__tag_a3bc82e8c76e1a47ecc20c85e1003036d) 3033 0 R (interfaceppl__Polyhedron__tag_a3e07a3e1a6e6c9f281227b4e215a3dc7) 2790 0 R (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741) 2958 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a357ddb19493a385970c56bf4847a07a1) (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741)]
+>> endobj
+3586 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) 2572 0 R (interfaceppl__Polyhedron__tag_a46fc9d1041d5548a5f8f220af2a07028) 2967 0 R (interfaceppl__Polyhedron__tag_a4b5f126aef2ca062b034f795f6e5cf6d) 2768 0 R (interfaceppl__Polyhedron__tag_a50d5c68064e215d3f2cf3ee69896e676) 2688 0 R (interfaceppl__Polyhedron__tag_a52e2499c42a9be1e527642cbfb16ff8c) 2617 0 R (interfaceppl__Polyhedron__tag_a5932fd0c6867d83e3a34d5e680225807) 3127 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) (interfaceppl__Polyhedron__tag_a5932fd0c6867d83e3a34d5e680225807)]
+>> endobj
+3587 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a5a6342bc4e04c1f228d210e5c363b6d4) 2784 0 R (interfaceppl__Polyhedron__tag_a5a9b061c4408ab8d70a1dea91a6ff983) 2866 0 R (interfaceppl__Polyhedron__tag_a5e7090393ee5801d9c988db6d2a06a43) 3028 0 R (interfaceppl__Polyhedron__tag_a5eeb3bf2e0ec7e6cd38e47b53eb43423) 3111 0 R (interfaceppl__Polyhedron__tag_a612142029eeee3dd72bb0d37c670d6db) 3090 0 R (interfaceppl__Polyhedron__tag_a6137f367c0c83a73146d84c998d37cb3) 3027 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a5a6342bc4e04c1f228d210e5c363b6d4) (interfaceppl__Polyhedron__tag_a6137f367c0c83a73146d84c998d37cb3)]
+>> endobj
+3588 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a658545ec6169d2843323bfe1ff078e6f) 3021 0 R (interfaceppl__Polyhedron__tag_a680aecc71f3b21fa0db03c7d1cbe466b) 2700 0 R (interfaceppl__Polyhedron__tag_a69c0a9ffd5b8910a90a91943a10fe3b6) 3095 0 R (interfaceppl__Polyhedron__tag_a6b5c73b1f3f864c8a10c39810b4711ce) 3020 0 R (interfaceppl__Polyhedron__tag_a6c5a2f9b4702c1a0ddfcc9c6eb9b92bd) 2702 0 R (interfaceppl__Polyhedron__tag_a6d147411700f558d74d8273accfb8e04) 2697 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a658545ec6169d2843323bfe1ff078e6f) (interfaceppl__Polyhedron__tag_a6d147411700f558d74d8273accfb8e04)]
+>> endobj
+3589 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a6ff56c68b449b94588ea7290d01625d5) 2968 0 R (interfaceppl__Polyhedron__tag_a6ffd595f3e1d85275962dde5f8401c7f) 2964 0 R (interfaceppl__Polyhedron__tag_a703c5d92387510c5cbf8b0f1da3029b2) 2628 0 R (interfaceppl__Polyhedron__tag_a7135823ecf68cedd5236d53e2b5541f5) 2777 0 R (interfaceppl__Polyhedron__tag_a7573064b44c45d804d398aec02e7a64a) 3034 0 R (interfaceppl__Polyhedron__tag_a784570f6ced5461b4d82cdfefa1cb31b) 2889 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a6ff56c68b449b94588ea7290d01625d5) (interfaceppl__Polyhedron__tag_a784570f6ced5461b4d82cdfefa1cb31b)]
+>> endobj
+3590 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a7918c3a73aed2529e1e57b8983264bad) 2880 0 R (interfaceppl__Polyhedron__tag_a819d233e9b1442e06c806dea0523a2f9) 2630 0 R (interfaceppl__Polyhedron__tag_a81cc2a565346ce8ee12124224ddd8d6c) 3015 0 R (interfaceppl__Polyhedron__tag_a8402fc25b68056511cf62f1378666a88) 2886 0 R (interfaceppl__Polyhedron__tag_a841ceef027f12d5c99fc2e739ae340fb) 3110 0 R (interfaceppl__Polyhedron__tag_a85417db0eb420d402acee4ef0d842efc) 2691 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a7918c3a73aed2529e1e57b8983264bad) (interfaceppl__Polyhedron__tag_a85417db0eb420d402acee4ef0d842efc)]
+>> endobj
+3591 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a875b11e85fe96586152f53f498158b1f) 3109 0 R (interfaceppl__Polyhedron__tag_a879f2f2b0f967fa73cb59ea8d8b1d255) 2682 0 R (interfaceppl__Polyhedron__tag_a88a7c177ebe33a3d41609609660fd3ee) 3105 0 R (interfaceppl__Polyhedron__tag_a88c408677f6de73fd80903738268efa3) 3100 0 R (interfaceppl__Polyhedron__tag_a8948143df881c58c79da34380f847401) 2634 0 R (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14) 2887 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a875b11e85fe96586152f53f498158b1f) (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14)]
+>> endobj
+3592 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) 2962 0 R (interfaceppl__Polyhedron__tag_a8abb894f6f4a673d549aa9bf7456b638) 2869 0 R (interfaceppl__Polyhedron__tag_a8b280d026e0c343ec0d3f5521dda6376) 2699 0 R (interfaceppl__Polyhedron__tag_a8ffc5459233ed9781c0ca910e88fa1f9) 2874 0 R (interfaceppl__Polyhedron__tag_a90544f38c2980f308cd6e0f9248fdd99) 2955 0 R (interfaceppl__Polyhedron__tag_a93cee014592562084126f06fe47efbba) 2791 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) (interfaceppl__Polyhedron__tag_a93cee014592562084126f06fe47efbba)]
+>> endobj
+3593 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a9563155e281915a8bc2eea34ceff9cf0) 2961 0 R (interfaceppl__Polyhedron__tag_a96eaf729b170b6df69bc2d1127f8727c) 3103 0 R (interfaceppl__Polyhedron__tag_a977522267df419dd5f2824ce6c0f7610) 3101 0 R (interfaceppl__Polyhedron__tag_a9947be8614cba5c2e8b02771d48fc7d2) 2687 0 R (interfaceppl__Polyhedron__tag_a9d9b8361c659cadd31afb61152ccf06b) 2629 0 R (interfaceppl__Polyhedron__tag_a9e5f40dfc278c52da81291b30fbe75f7) 2771 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a9563155e281915a8bc2eea34ceff9cf0) (interfaceppl__Polyhedron__tag_a9e5f40dfc278c52da81291b30fbe75f7)]
+>> endobj
+3594 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_a9fb38e66323fe6cb24b32e32e66dba78) 2881 0 R (interfaceppl__Polyhedron__tag_aa309e957fa5f404b296e2e4c30e1697d) 2787 0 R (interfaceppl__Polyhedron__tag_aa48f8ae0f3a2647949417ec2da1c97e4) 2957 0 R (interfaceppl__Polyhedron__tag_aabb79ab0a7936b6f14cd20e15cb14fa8) 3031 0 R (interfaceppl__Polyhedron__tag_aad3749930a51c38886b1d5a01dbbba92) 3091 0 R (interfaceppl__Polyhedron__tag_aad69d01217b9ea1043883162d285505c) 2884 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a9fb38e66323fe6cb24b32e32e66dba78) (interfaceppl__Polyhedron__tag_aad69d01217b9ea1043883162d285505c)]
+>> endobj
+3595 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_aaffebaba13f6fc73438bdccde0966547) 3022 0 R (interfaceppl__Polyhedron__tag_ab062917f016d95800e29f87c203fd3bb) 3125 0 R (interfaceppl__Polyhedron__tag_ab1d03e0aac8dda484b102c536c612a45) 2701 0 R (interfaceppl__Polyhedron__tag_ab27e9641bc6946aef6e3254d28c6fab4) 2627 0 R (interfaceppl__Polyhedron__tag_ab32d3b44994fefe43c44e353a47cb4a4) 2775 0 R (interfaceppl__Polyhedron__tag_ab4f7535037080c7f5db32b2e85fdc80d) 2770 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_aaffebaba13f6fc73438bdccde0966547) (interfaceppl__Polyhedron__tag_ab4f7535037080c7f5db32b2e85fdc80d)]
+>> endobj
+3596 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_abc350d1ab1c6e4da0df6bb130364af7b) 2883 0 R (interfaceppl__Polyhedron__tag_abcf3ccb8e2e224496d1326e47e15fdc6) 2785 0 R (interfaceppl__Polyhedron__tag_abd393bd3febd678f09a51a0364756787) 2615 0 R (interfaceppl__Polyhedron__tag_abedffb6a2f5b2473d2d2ac9d448c65d9) 2568 0 R (interfaceppl__Polyhedron__tag_abf1bb44cdbf733e9ca39164f9d8e8179) 2633 0 R (interfaceppl__Polyhedron__tag_ac06aed22fa4405051df0da9e7bc16138) 2952 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_abc350d1ab1c6e4da0df6bb130364af7b) (interfaceppl__Polyhedron__tag_ac06aed22fa4405051df0da9e7bc16138)]
+>> endobj
+3597 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_ac0e5d09ffe586f8ea5ec782570015c5b) 2965 0 R (interfaceppl__Polyhedron__tag_ac655ac3a494c4f92bb02d0b9294bdd85) 2877 0 R (interfaceppl__Polyhedron__tag_ac78c1168665c72eaf8c2457b12700fba) 3107 0 R (interfaceppl__Polyhedron__tag_ad015c9afd4968005d43f233359253c5a) 2963 0 R (interfaceppl__Polyhedron__tag_ad024f037803a208b74cd150eeaa5649d) 2873 0 R (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b) 3099 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_ac0e5d09ffe586f8ea5ec782570015c5b) (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b)]
+>> endobj
+3598 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) 3019 0 R (interfaceppl__Polyhedron__tag_ad4b80df36fc02b4c47ca160420e50182) 3129 0 R (interfaceppl__Polyhedron__tag_ad6512d0d60c017982bd8031e9b8df336) 2573 0 R (interfaceppl__Polyhedron__tag_ad6b383704ed3f314864c52f5b715cbbf) 3017 0 R (interfaceppl__Polyhedron__tag_ad9547cb6430722246dea7f5a70566c06) 3032 0 R (interfaceppl__Polyhedron__tag_ada9021952b7c7ad4ca6fc4ff082ec9fe) 2566 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) (interfaceppl__Polyhedron__tag_ada9021952b7c7ad4ca6fc4ff082ec9fe)]
+>> endobj
+3599 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_adb06752e755290368c9bb00ad14a0984) 2885 0 R (interfaceppl__Polyhedron__tag_adc7cd513e31b7ecdda3a25a967d8a772) 2686 0 R (interfaceppl__Polyhedron__tag_add9c4afcd6f6bd78509219f32d57e348) 2953 0 R (interfaceppl__Polyhedron__tag_ae1e938f0c844231dfe2098ab8fbca67b) 2774 0 R (interfaceppl__Polyhedron__tag_aea399d3df97c711c758c8bf715e0c763) 3030 0 R (interfaceppl__Polyhedron__tag_aebe78c4ede3d49c63765e71cfe93904e) 2619 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_adb06752e755290368c9bb00ad14a0984) (interfaceppl__Polyhedron__tag_aebe78c4ede3d49c63765e71cfe93904e)]
+>> endobj
+3600 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_aee4d567631589e83063cfb8f80c2bd6f) 2782 0 R (interfaceppl__Polyhedron__tag_af29cc9becde5f28a37567093174d6855) 2684 0 R (interfaceppl__Polyhedron__tag_af777de5ca96f8d1631d3500008bf84f8) 2793 0 R (interfaceppl__Polyhedron__tag_af818756f74f766dfb937e586565db8d6) 2888 0 R (interfaceppl__Polyhedron__tag_af8a9392f205531631b3a98c332f594b1) 3018 0 R (interfaceppl__Polyhedron__tag_af92f3c9d758e2a155a2a6faec4235741) 2879 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_aee4d567631589e83063cfb8f80c2bd6f) (interfaceppl__Polyhedron__tag_af92f3c9d758e2a155a2a6faec4235741)]
+>> endobj
+3601 0 obj <<
+/Names [(interfaceppl__Polyhedron__tag_af93c7e3e554a92e8d3eeb4cf4261debd) 2632 0 R (interfaceppl__Polyhedron__tag_af98013213e01ca8514b6dbd20116af4d) 2789 0 R (page.1) 170 0 R (page.10) 331 0 R (page.11) 344 0 R (page.12) 350 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_af93c7e3e554a92e8d3eeb4cf4261debd) (page.12)]
+>> endobj
+3602 0 obj <<
+/Names [(page.13) 355 0 R (page.14) 361 0 R (page.15) 366 0 R (page.16) 375 0 R (page.17) 412 0 R (page.18) 455 0 R]
+/Limits [(page.13) (page.18)]
+>> endobj
+3603 0 obj <<
+/Names [(page.19) 480 0 R (page.2) 183 0 R (page.20) 500 0 R (page.21) 518 0 R (page.22) 541 0 R (page.23) 562 0 R]
+/Limits [(page.19) (page.23)]
+>> endobj
+3604 0 obj <<
+/Names [(page.24) 589 0 R (page.25) 602 0 R (page.26) 623 0 R (page.27) 659 0 R (page.28) 711 0 R (page.29) 759 0 R]
+/Limits [(page.24) (page.29)]
+>> endobj
+3605 0 obj <<
+/Names [(page.3) 195 0 R (page.30) 817 0 R (page.31) 882 0 R (page.32) 920 0 R (page.33) 932 0 R (page.34) 941 0 R]
+/Limits [(page.3) (page.34)]
+>> endobj
+3606 0 obj <<
+/Names [(page.35) 967 0 R (page.36) 1013 0 R (page.37) 1058 0 R (page.38) 1098 0 R (page.39) 1159 0 R (page.4) 208 0 R]
+/Limits [(page.35) (page.4)]
+>> endobj
+3607 0 obj <<
+/Names [(page.40) 1209 0 R (page.41) 1255 0 R (page.42) 1299 0 R (page.43) 1351 0 R (page.44) 1413 0 R (page.45) 1457 0 R]
+/Limits [(page.40) (page.45)]
+>> endobj
+3608 0 obj <<
+/Names [(page.46) 1498 0 R (page.47) 1543 0 R (page.48) 1599 0 R (page.49) 1643 0 R (page.5) 295 0 R (page.50) 1693 0 R]
+/Limits [(page.46) (page.50)]
+>> endobj
+3609 0 obj <<
+/Names [(page.51) 1738 0 R (page.52) 1783 0 R (page.53) 1843 0 R (page.54) 1898 0 R (page.55) 1957 0 R (page.56) 2028 0 R]
+/Limits [(page.51) (page.56)]
+>> endobj
+3610 0 obj <<
+/Names [(page.57) 2082 0 R (page.58) 2119 0 R (page.59) 2160 0 R (page.6) 302 0 R (page.60) 2228 0 R (page.61) 2277 0 R]
+/Limits [(page.57) (page.61)]
+>> endobj
+3611 0 obj <<
+/Names [(page.62) 2314 0 R (page.63) 2337 0 R (page.64) 2377 0 R (page.65) 2420 0 R (page.66) 2473 0 R (page.67) 2522 0 R]
+/Limits [(page.62) (page.67)]
+>> endobj
+3612 0 obj <<
+/Names [(page.68) 2561 0 R (page.69) 2611 0 R (page.7) 308 0 R (page.70) 2681 0 R (page.71) 2767 0 R (page.72) 2864 0 R]
+/Limits [(page.68) (page.72)]
+>> endobj
+3613 0 obj <<
+/Names [(page.73) 2944 0 R (page.74) 3014 0 R (page.75) 3089 0 R (page.76) 3124 0 R (page.77) 3139 0 R (page.78) 3150 0 R]
+/Limits [(page.73) (page.78)]
+>> endobj
+3614 0 obj <<
+/Names [(page.79) 3159 0 R (page.8) 315 0 R (page.80) 3171 0 R (page.81) 3183 0 R (page.82) 3198 0 R (page.83) 3209 0 R]
+/Limits [(page.79) (page.83)]
+>> endobj
+3615 0 obj <<
+/Names [(page.84) 3219 0 R (page.85) 3296 0 R (page.86) 3371 0 R (page.87) 3423 0 R (page.9) 323 0 R (page.i) 254 0 R]
+/Limits [(page.84) (page.i)]
+>> endobj
+3616 0 obj <<
+/Names [(page.ii) 258 0 R (paragraph.6.2.2.1) 487 0 R (paragraph.6.2.2.2) 489 0 R (paragraph.6.2.2.3) 491 0 R (paragraph.6.2.2.4) 493 0 R (paragraph.6.2.2.5) 501 0 R]
+/Limits [(page.ii) (paragraph.6.2.2.5)]
+>> endobj
+3617 0 obj <<
+/Names [(paragraph.6.3.2.1) 535 0 R (paragraph.6.3.3.1) 543 0 R (paragraph.6.4.2.1) 571 0 R (paragraph.6.4.3.1) 591 0 R (paragraph.6.5.2.1) 610 0 R (paragraph.6.5.2.2) 613 0 R]
+/Limits [(paragraph.6.3.2.1) (paragraph.6.5.2.2)]
+>> endobj
+3618 0 obj <<
+/Names [(paragraph.6.6.2.1) 924 0 R (paragraph.6.6.3.1) 926 0 R (paragraph.6.6.3.2) 927 0 R (paragraph.6.6.3.3) 933 0 R (paragraph.6.6.3.4) 934 0 R (paragraph.6.6.3.5) 935 0 R]
+/Limits [(paragraph.6.6.2.1) (paragraph.6.6.3.5)]
+>> endobj
+3619 0 obj <<
+/Names [(paragraph.6.6.3.6) 936 0 R (paragraph.6.6.4.1) 943 0 R (paragraph.7.17.2.1) 2099 0 R (paragraph.7.17.2.2) 2120 0 R (paragraph.7.17.2.3) 2122 0 R (paragraph.7.19.2.1) 2293 0 R]
+/Limits [(paragraph.6.6.3.6) (paragraph.7.19.2.1)]
+>> endobj
+3620 0 obj <<
+/Names [(paragraph.7.19.2.2) 2315 0 R (paragraph.7.19.2.3) 2317 0 R (paragraph.7.20.2.1) 2342 0 R (paragraph.7.22.2.1) 2443 0 R (paragraph.7.23.2.1) 2494 0 R (paragraph.7.24.2.1) 2564 0 R]
+/Limits [(paragraph.7.19.2.2) (paragraph.7.24.2.1)]
+>> endobj
+3621 0 obj <<
+/Names [(paragraph.7.25.2.1) 3133 0 R (paragraph.7.25.2.10) 3152 0 R (paragraph.7.25.2.11) 3153 0 R (paragraph.7.25.2.12) 3154 0 R (paragraph.7.25.2.13) 3160 0 R (paragraph.7.25.2.14) 3161 0 R]
+/Limits [(paragraph.7.25.2.1) (paragraph.7.25.2.14)]
+>> endobj
+3622 0 obj <<
+/Names [(paragraph.7.25.2.15) 3162 0 R (paragraph.7.25.2.16) 3164 0 R (paragraph.7.25.2.17) 3172 0 R (paragraph.7.25.2.18) 3173 0 R (paragraph.7.25.2.19) 3174 0 R (paragraph.7.25.2.2) 3134 0 R]
+/Limits [(paragraph.7.25.2.15) (paragraph.7.25.2.2)]
+>> endobj
+3623 0 obj <<
+/Names [(paragraph.7.25.2.20) 3175 0 R (paragraph.7.25.2.21) 3176 0 R (paragraph.7.25.2.22) 3178 0 R (paragraph.7.25.2.23) 3185 0 R (paragraph.7.25.2.24) 3189 0 R (paragraph.7.25.2.25) 3191 0 R]
+/Limits [(paragraph.7.25.2.20) (paragraph.7.25.2.25)]
+>> endobj
+3624 0 obj <<
+/Names [(paragraph.7.25.2.26) 3193 0 R (paragraph.7.25.2.27) 3200 0 R (paragraph.7.25.2.28) 3202 0 R (paragraph.7.25.2.29) 3204 0 R (paragraph.7.25.2.3) 3140 0 R (paragraph.7.25.2.30) 3210 0 R]
+/Limits [(paragraph.7.25.2.26) (paragraph.7.25.2.30)]
+>> endobj
+3625 0 obj <<
+/Names [(paragraph.7.25.2.31) 3211 0 R (paragraph.7.25.2.32) 3212 0 R (paragraph.7.25.2.33) 3213 0 R (paragraph.7.25.2.34) 3214 0 R (paragraph.7.25.2.35) 3220 0 R (paragraph.7.25.2.4) 3141 0 R]
+/Limits [(paragraph.7.25.2.31) (paragraph.7.25.2.4)]
+>> endobj
+3626 0 obj <<
+/Names [(paragraph.7.25.2.5) 3142 0 R (paragraph.7.25.2.6) 3143 0 R (paragraph.7.25.2.7) 3144 0 R (paragraph.7.25.2.8) 3145 0 R (paragraph.7.25.2.9) 3151 0 R (section*.1) 276 0 R]
+/Limits [(paragraph.7.25.2.5) (section*.1)]
+>> endobj
+3627 0 obj <<
+/Names [(section*.10) 303 0 R (section*.11) 309 0 R (section*.12) 316 0 R (section*.13) 317 0 R (section*.14) 318 0 R (section*.15) 324 0 R]
+/Limits [(section*.10) (section*.15)]
+>> endobj
+3628 0 obj <<
+/Names [(section*.16) 325 0 R (section*.17) 326 0 R (section*.18) 332 0 R (section*.19) 333 0 R (section*.2) 281 0 R (section*.20) 334 0 R]
+/Limits [(section*.16) (section*.20)]
+>> endobj
+3629 0 obj <<
+/Names [(section*.21) 335 0 R (section*.22) 376 0 R (section*.23) 482 0 R (section*.24) 520 0 R (section*.25) 525 0 R (section*.26) 564 0 R]
+/Limits [(section*.21) (section*.26)]
+>> endobj
+3630 0 obj <<
+/Names [(section*.27) 567 0 R (section*.28) 604 0 R (section*.29) 661 0 R (section*.3) 282 0 R (section*.30) 829 0 R (section*.31) 885 0 R]
+/Limits [(section*.27) (section*.31)]
+>> endobj
+3631 0 obj <<
+/Names [(section*.32) 893 0 R (section*.33) 968 0 R (section*.34) 1014 0 R (section*.35) 1059 0 R (section*.36) 1099 0 R (section*.37) 1160 0 R]
+/Limits [(section*.32) (section*.37)]
+>> endobj
+3632 0 obj <<
+/Names [(section*.38) 1215 0 R (section*.39) 1268 0 R (section*.4) 283 0 R (section*.40) 1310 0 R (section*.41) 1415 0 R (section*.42) 1464 0 R]
+/Limits [(section*.38) (section*.42)]
+>> endobj
+3633 0 obj <<
+/Names [(section*.43) 1503 0 R (section*.44) 1600 0 R (section*.45) 1645 0 R (section*.46) 1695 0 R (section*.47) 1748 0 R (section*.48) 1844 0 R]
+/Limits [(section*.43) (section*.48)]
+>> endobj
+3634 0 obj <<
+/Names [(section*.49) 1958 0 R (section*.5) 288 0 R (section*.50) 2124 0 R (section*.51) 2162 0 R (section*.52) 2318 0 R (section*.53) 2344 0 R]
+/Limits [(section*.49) (section*.53)]
+>> endobj
+3635 0 obj <<
+/Names [(section*.54) 2393 0 R (section*.55) 2474 0 R (section*.56) 2523 0 R (section*.57) 2565 0 R (section*.58) 3297 0 R (section*.6) 289 0 R]
+/Limits [(section*.54) (section*.6)]
+>> endobj
+3636 0 obj <<
+/Names [(section*.7) 290 0 R (section*.8) 296 0 R (section*.9) 297 0 R (section.1) 2 0 R (section.2) 6 0 R (section.3) 10 0 R]
+/Limits [(section*.7) (section.3)]
+>> endobj
+3637 0 obj <<
+/Names [(section.4) 14 0 R (section.5) 22 0 R (section.6) 30 0 R (section.7) 58 0 R (subsection.4.1) 18 0 R (subsection.5.1) 26 0 R]
+/Limits [(section.4) (subsection.5.1)]
+>> endobj
+3638 0 obj <<
+/Names [(subsection.6.1) 34 0 R (subsection.6.2) 38 0 R (subsection.6.3) 42 0 R (subsection.6.4) 46 0 R (subsection.6.5) 50 0 R (subsection.6.6) 54 0 R]
+/Limits [(subsection.6.1) (subsection.6.6)]
+>> endobj
+3639 0 obj <<
+/Names [(subsection.7.1) 62 0 R (subsection.7.10) 98 0 R (subsection.7.11) 102 0 R (subsection.7.12) 106 0 R (subsection.7.13) 110 0 R (subsection.7.14) 114 0 R]
+/Limits [(subsection.7.1) (subsection.7.14)]
+>> endobj
+3640 0 obj <<
+/Names [(subsection.7.15) 118 0 R (subsection.7.16) 122 0 R (subsection.7.17) 126 0 R (subsection.7.18) 130 0 R (subsection.7.19) 134 0 R (subsection.7.2) 66 0 R]
+/Limits [(subsection.7.15) (subsection.7.2)]
+>> endobj
+3641 0 obj <<
+/Names [(subsection.7.20) 138 0 R (subsection.7.21) 142 0 R (subsection.7.22) 146 0 R (subsection.7.23) 150 0 R (subsection.7.24) 154 0 R (subsection.7.25) 158 0 R]
+/Limits [(subsection.7.20) (subsection.7.25)]
+>> endobj
+3642 0 obj <<
+/Names [(subsection.7.3) 70 0 R (subsection.7.4) 74 0 R (subsection.7.5) 78 0 R (subsection.7.6) 82 0 R (subsection.7.7) 86 0 R (subsection.7.8) 90 0 R]
+/Limits [(subsection.7.3) (subsection.7.8)]
+>> endobj
+3643 0 obj <<
+/Names [(subsection.7.9) 94 0 R (subsubsection.6.2.1) 484 0 R (subsubsection.6.2.2) 485 0 R (subsubsection.6.3.1) 532 0 R (subsubsection.6.3.2) 533 0 R (subsubsection.6.3.3) 542 0 R]
+/Limits [(subsection.7.9) (subsubsection.6.3.3)]
+>> endobj
+3644 0 obj <<
+/Names [(subsubsection.6.4.1) 568 0 R (subsubsection.6.4.2) 569 0 R (subsubsection.6.4.3) 590 0 R (subsubsection.6.5.1) 607 0 R (subsubsection.6.5.2) 608 0 R (subsubsection.6.6.1) 922 0 R]
+/Limits [(subsubsection.6.4.1) (subsubsection.6.6.1)]
+>> endobj
+3645 0 obj <<
+/Names [(subsubsection.6.6.2) 923 0 R (subsubsection.6.6.3) 925 0 R (subsubsection.6.6.4) 942 0 R (subsubsection.7.1.1) 985 0 R (subsubsection.7.10.1) 1502 0 R (subsubsection.7.11.1) 1558 0 R]
+/Limits [(subsubsection.6.6.2) (subsubsection.7.11.1)]
+>> endobj
+3646 0 obj <<
+/Names [(subsubsection.7.12.1) 1644 0 R (subsubsection.7.13.1) 1694 0 R (subsubsection.7.14.1) 1747 0 R (subsubsection.7.15.1) 1801 0 R (subsubsection.7.16.1) 1918 0 R (subsubsection.7.17.1) 2096 0 R]
+/Limits [(subsubsection.7.12.1) (subsubsection.7.17.1)]
+>> endobj
+3647 0 obj <<
+/Names [(subsubsection.7.17.2) 2097 0 R (subsubsection.7.18.1) 2161 0 R (subsubsection.7.19.1) 2291 0 R (subsubsection.7.19.2) 2292 0 R (subsubsection.7.2.1) 1026 0 R (subsubsection.7.20.1) 2340 0 R]
+/Limits [(subsubsection.7.17.2) (subsubsection.7.20.1)]
+>> endobj
+3648 0 obj <<
+/Names [(subsubsection.7.20.2) 2341 0 R (subsubsection.7.21.1) 2392 0 R (subsubsection.7.22.1) 2440 0 R (subsubsection.7.22.2) 2441 0 R (subsubsection.7.23.1) 2491 0 R (subsubsection.7.23.2) 2492 0 R]
+/Limits [(subsubsection.7.20.2) (subsubsection.7.23.2)]
+>> endobj
+3649 0 obj <<
+/Names [(subsubsection.7.24.1) 2562 0 R (subsubsection.7.24.2) 2563 0 R (subsubsection.7.25.1) 3131 0 R (subsubsection.7.25.2) 3132 0 R (subsubsection.7.3.1) 1074 0 R (subsubsection.7.4.1) 1113 0 R]
+/Limits [(subsubsection.7.24.1) (subsubsection.7.4.1)]
+>> endobj
+3650 0 obj <<
+/Names [(subsubsection.7.5.1) 1214 0 R (subsubsection.7.6.1) 1267 0 R (subsubsection.7.7.1) 1309 0 R (subsubsection.7.8.1) 1414 0 R (subsubsection.7.9.1) 1463 0 R (table.1) 611 0 R]
+/Limits [(subsubsection.7.5.1) (table.1)]
+>> endobj
+3651 0 obj <<
+/Names [(table.10) 3177 0 R (table.11) 3184 0 R (table.12) 3188 0 R (table.13) 3190 0 R (table.14) 3192 0 R (table.15) 3199 0 R]
+/Limits [(table.10) (table.15)]
+>> endobj
+3652 0 obj <<
+/Names [(table.16) 3201 0 R (table.17) 3203 0 R (table.18) 162 0 R (table.2) 614 0 R (table.3) 944 0 R (table.4) 2121 0 R]
+/Limits [(table.16) (table.4)]
+>> endobj
+3653 0 obj <<
+/Names [(table.5) 2123 0 R (table.6) 2316 0 R (table.7) 2343 0 R (table.8) 3163 0 R (table.9) 3165 0 R]
+/Limits [(table.5) (table.9)]
+>> endobj
+3654 0 obj <<
+/Kids [3496 0 R 3497 0 R 3498 0 R 3499 0 R 3500 0 R 3501 0 R]
+/Limits [(Doc-Start) (group__Datatypes_ga68fae2777effe5d0ed0e3dcec1310e1f)]
+>> endobj
+3655 0 obj <<
+/Kids [3502 0 R 3503 0 R 3504 0 R 3505 0 R 3506 0 R 3507 0 R]
+/Limits [(group__Datatypes_ga6b8429baa2a70746836586aad6905b64) (group__Datatypes_gae8e2db00ec6575b865057ffd3195327b)]
+>> endobj
+3656 0 obj <<
+/Kids [3508 0 R 3509 0 R 3510 0 R 3511 0 R 3512 0 R 3513 0 R]
+/Limits [(group__Datatypes_gaec4f5c405067bcd0483d84591bc7c48e) (group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a03b444004b1031ddb1a51289b9d83106)]
+>> endobj
+3657 0 obj <<
+/Kids [3514 0 R 3515 0 R 3516 0 R 3517 0 R 3518 0 R 3519 0 R]
+/Limits [(group__Error_gga0c0ab09a97e49f85f42c966e14cfdee6a0860beb1b1c54c9f774b532d92404992) (index)]
+>> endobj
+3658 0 obj <<
+/Kids [3520 0 R 3521 0 R 3522 0 R 3523 0 R 3524 0 R 3525 0 R]
+/Limits [(interfaceppl__Artificial__Parameter__Sequence__const__iterator__tag) (interfaceppl__Congruence__System__const__iterator__tag_a74f9a28eb09ee718502409ab43b657d4)]
+>> endobj
+3659 0 obj <<
+/Kids [3526 0 R 3527 0 R 3528 0 R 3529 0 R 3530 0 R 3531 0 R]
+/Limits [(interfaceppl__Congruence__System__const__iterator__tag_a7ac19545b812b9ed2261c4224a6b9e9a) (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d)]
+>> endobj
+3660 0 obj <<
+/Kids [3532 0 R 3533 0 R 3534 0 R 3535 0 R 3536 0 R 3537 0 R]
+/Limits [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) (interfaceppl__Constraint__tag_a0ed54f6ac264a58059f51c7fe33ab787)]
+>> endobj
+3661 0 obj <<
+/Kids [3538 0 R 3539 0 R 3540 0 R 3541 0 R 3542 0 R 3543 0 R]
+/Limits [(interfaceppl__Constraint__tag_a1c416a6d6a359f2f9e9d33af7dc32ea8) (interfaceppl__Generator__System__tag_ae9bc39a46753f158644428f3c01e73a3)]
+>> endobj
+3662 0 obj <<
+/Kids [3544 0 R 3545 0 R 3546 0 R 3547 0 R 3548 0 R 3549 0 R]
+/Limits [(interfaceppl__Generator__System__tag_aeeec098f7c1e5939b144f3d42a2c65fc) (interfaceppl__Grid__Generator__System__tag_a4578b5352510727810a7c3be32208aae)]
+>> endobj
+3663 0 obj <<
+/Kids [3550 0 R 3551 0 R 3552 0 R 3553 0 R 3554 0 R 3555 0 R]
+/Limits [(interfaceppl__Grid__Generator__System__tag_a68cdbff6e2262bae3295484dbee9ee42) (interfaceppl__Linear__Expression__tag_a643dad56c4e24b32e2c4951aee7a6822)]
+>> endobj
+3664 0 obj <<
+/Kids [3556 0 R 3557 0 R 3558 0 R 3559 0 R 3560 0 R 3561 0 R]
+/Limits [(interfaceppl__Linear__Expression__tag_a690fbcd5ef7202e646b30d92bdadcc29) (interfaceppl__MIP__Problem__tag_a5e359194d7a21e72a49aee51dbac25c4)]
+>> endobj
+3665 0 obj <<
+/Kids [3562 0 R 3563 0 R 3564 0 R 3565 0 R 3566 0 R 3567 0 R]
+/Limits [(interfaceppl__MIP__Problem__tag_a6a8d9c1c40c886054ef76aac268f33b0) (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3)]
+>> endobj
+3666 0 obj <<
+/Kids [3568 0 R 3569 0 R 3570 0 R 3571 0 R 3572 0 R 3573 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) (interfaceppl__PIP__Problem__tag_ae4b7a344b75c9fc8646539a69ee55cb3)]
+>> endobj
+3667 0 obj <<
+/Kids [3574 0 R 3575 0 R 3576 0 R 3577 0 R 3578 0 R 3579 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_aeb57397366e3cabbdac796f793cacc8b) (interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a64b1a8e66388915a57bfd0b53a2e46c5)]
+>> endobj
+3668 0 obj <<
+/Kids [3580 0 R 3581 0 R 3582 0 R 3583 0 R 3584 0 R 3585 0 R]
+/Limits [(interfaceppl__Pointset__Powerset__C__Polyhedron__iterator__tag_a79d1cb9751d21f7b364c4c41c4715737) (interfaceppl__Polyhedron__tag_a402bb86dfedf35933c2a29cc07210741)]
+>> endobj
+3669 0 obj <<
+/Kids [3586 0 R 3587 0 R 3588 0 R 3589 0 R 3590 0 R 3591 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a418a9f96c3df4cf69bc399cd807eddeb) (interfaceppl__Polyhedron__tag_a89c2384471ee03156c7b414dceee8f14)]
+>> endobj
+3670 0 obj <<
+/Kids [3592 0 R 3593 0 R 3594 0 R 3595 0 R 3596 0 R 3597 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_a8a9e2cf693ca3e9c464efb04071b8572) (interfaceppl__Polyhedron__tag_ad184bea5f8f38b87293d639d57ee340b)]
+>> endobj
+3671 0 obj <<
+/Kids [3598 0 R 3599 0 R 3600 0 R 3601 0 R 3602 0 R 3603 0 R]
+/Limits [(interfaceppl__Polyhedron__tag_ad20b13c4f378bdc5aa64c3e833a62cba) (page.23)]
+>> endobj
+3672 0 obj <<
+/Kids [3604 0 R 3605 0 R 3606 0 R 3607 0 R 3608 0 R 3609 0 R]
+/Limits [(page.24) (page.56)]
+>> endobj
+3673 0 obj <<
+/Kids [3610 0 R 3611 0 R 3612 0 R 3613 0 R 3614 0 R 3615 0 R]
+/Limits [(page.57) (page.i)]
+>> endobj
+3674 0 obj <<
+/Kids [3616 0 R 3617 0 R 3618 0 R 3619 0 R 3620 0 R 3621 0 R]
+/Limits [(page.ii) (paragraph.7.25.2.14)]
+>> endobj
+3675 0 obj <<
+/Kids [3622 0 R 3623 0 R 3624 0 R 3625 0 R 3626 0 R 3627 0 R]
+/Limits [(paragraph.7.25.2.15) (section*.15)]
+>> endobj
+3676 0 obj <<
+/Kids [3628 0 R 3629 0 R 3630 0 R 3631 0 R 3632 0 R 3633 0 R]
+/Limits [(section*.16) (section*.48)]
+>> endobj
+3677 0 obj <<
+/Kids [3634 0 R 3635 0 R 3636 0 R 3637 0 R 3638 0 R 3639 0 R]
+/Limits [(section*.49) (subsection.7.14)]
+>> endobj
+3678 0 obj <<
+/Kids [3640 0 R 3641 0 R 3642 0 R 3643 0 R 3644 0 R 3645 0 R]
+/Limits [(subsection.7.15) (subsubsection.7.11.1)]
+>> endobj
+3679 0 obj <<
+/Kids [3646 0 R 3647 0 R 3648 0 R 3649 0 R 3650 0 R 3651 0 R]
+/Limits [(subsubsection.7.12.1) (table.15)]
+>> endobj
+3680 0 obj <<
+/Kids [3652 0 R 3653 0 R]
+/Limits [(table.16) (table.9)]
+>> endobj
+3681 0 obj <<
+/Kids [3654 0 R 3655 0 R 3656 0 R 3657 0 R 3658 0 R 3659 0 R]
+/Limits [(Doc-Start) (interfaceppl__Congruence__tag_ab67c8dacaa1610fe5ea9efe67263477d)]
+>> endobj
+3682 0 obj <<
+/Kids [3660 0 R 3661 0 R 3662 0 R 3663 0 R 3664 0 R 3665 0 R]
+/Limits [(interfaceppl__Congruence__tag_ab76a7c2b32bbc5472f87b3fae17f5a0d) (interfaceppl__PIP__Problem__tag_a0a539cf36d2797f1c1cb24a5f3ae13e3)]
+>> endobj
+3683 0 obj <<
+/Kids [3666 0 R 3667 0 R 3668 0 R 3669 0 R 3670 0 R 3671 0 R]
+/Limits [(interfaceppl__PIP__Problem__tag_a0e81a3be2c1e438646f752885e8e2671) (page.23)]
+>> endobj
+3684 0 obj <<
+/Kids [3672 0 R 3673 0 R 3674 0 R 3675 0 R 3676 0 R 3677 0 R]
+/Limits [(page.24) (subsection.7.14)]
+>> endobj
+3685 0 obj <<
+/Kids [3678 0 R 3679 0 R 3680 0 R]
+/Limits [(subsection.7.15) (table.9)]
+>> endobj
+3686 0 obj <<
+/Kids [3681 0 R 3682 0 R 3683 0 R 3684 0 R 3685 0 R]
+/Limits [(Doc-Start) (table.9)]
+>> endobj
+3687 0 obj <<
+/Dests 3686 0 R
+>> endobj
+3688 0 obj <<
+/Type /Catalog
+/Pages 3494 0 R
+/Outlines 3495 0 R
+/Names 3687 0 R
+/PageMode/UseOutlines/PageLabels<</Nums[0<</S/D>>4<</S/r>>6<</S/D>>]>>
+/OpenAction 165 0 R
+>> endobj
+3689 0 obj <<
+/Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords()
+/CreationDate (D:20130404152443+02'00')
+/ModDate (D:20130404152443+02'00')
+/Trapped /False
+/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0)
+>> endobj
+xref
+0 3690
+0000000000 65535 f 
+0000000015 00000 n 
+0000038249 00000 n 
+0000968562 00000 n 
+0000000060 00000 n 
+0000000134 00000 n 
+0000043057 00000 n 
+0000968477 00000 n 
+0000000179 00000 n 
+0000000344 00000 n 
+0000078148 00000 n 
+0000968390 00000 n 
+0000000389 00000 n 
+0000000575 00000 n 
+0000097759 00000 n 
+0000968264 00000 n 
+0000000621 00000 n 
+0000000711 00000 n 
+0000097815 00000 n 
+0000968203 00000 n 
+0000000762 00000 n 
+0000000824 00000 n 
+0000105081 00000 n 
+0000968077 00000 n 
+0000000870 00000 n 
+0000000955 00000 n 
+0000105137 00000 n 
+0000968016 00000 n 
+0000001006 00000 n 
+0000001086 00000 n 
+0000111524 00000 n 
+0000967890 00000 n 
+0000001132 00000 n 
+0000001262 00000 n 
+0000111637 00000 n 
+0000967816 00000 n 
+0000001313 00000 n 
+0000001446 00000 n 
+0000115218 00000 n 
+0000967729 00000 n 
+0000001497 00000 n 
+0000001728 00000 n 
+0000121973 00000 n 
+0000967642 00000 n 
+0000001779 00000 n 
+0000001889 00000 n 
+0000130799 00000 n 
+0000967555 00000 n 
+0000001940 00000 n 
+0000002040 00000 n 
+0000137773 00000 n 
+0000967468 00000 n 
+0000002091 00000 n 
+0000002201 00000 n 
+0000147871 00000 n 
+0000967394 00000 n 
+0000002252 00000 n 
+0000002367 00000 n 
+0000205350 00000 n 
+0000967265 00000 n 
+0000002413 00000 n 
+0000002538 00000 n 
+0000205463 00000 n 
+0000967191 00000 n 
+0000002589 00000 n 
+0000003000 00000 n 
+0000213860 00000 n 
+0000967104 00000 n 
+0000003051 00000 n 
+0000003333 00000 n 
+0000214620 00000 n 
+0000967017 00000 n 
+0000003384 00000 n 
+0000003618 00000 n 
+0000232286 00000 n 
+0000966930 00000 n 
+0000003669 00000 n 
+0000004017 00000 n 
+0000232930 00000 n 
+0000966843 00000 n 
+0000004068 00000 n 
+0000004335 00000 n 
+0000253622 00000 n 
+0000966756 00000 n 
+0000004386 00000 n 
+0000004615 00000 n 
+0000264371 00000 n 
+0000966669 00000 n 
+0000004666 00000 n 
+0000005014 00000 n 
+0000273160 00000 n 
+0000966582 00000 n 
+0000005065 00000 n 
+0000005332 00000 n 
+0000296219 00000 n 
+0000966495 00000 n 
+0000005383 00000 n 
+0000005612 00000 n 
+0000305623 00000 n 
+0000966406 00000 n 
+0000005664 00000 n 
+0000006008 00000 n 
+0000314577 00000 n 
+0000966315 00000 n 
+0000006061 00000 n 
+0000006324 00000 n 
+0000324382 00000 n 
+0000966223 00000 n 
+0000006377 00000 n 
+0000006602 00000 n 
+0000345725 00000 n 
+0000966131 00000 n 
+0000006655 00000 n 
+0000007027 00000 n 
+0000355696 00000 n 
+0000966039 00000 n 
+0000007080 00000 n 
+0000007371 00000 n 
+0000364472 00000 n 
+0000965947 00000 n 
+0000007424 00000 n 
+0000007677 00000 n 
+0000387545 00000 n 
+0000965855 00000 n 
+0000007730 00000 n 
+0000007998 00000 n 
+0000409483 00000 n 
+0000965763 00000 n 
+0000008051 00000 n 
+0000008289 00000 n 
+0000443424 00000 n 
+0000965671 00000 n 
+0000008342 00000 n 
+0000008613 00000 n 
+0000451037 00000 n 
+0000965579 00000 n 
+0000008666 00000 n 
+0000008904 00000 n 
+0000482751 00000 n 
+0000965487 00000 n 
+0000008957 00000 n 
+0000009228 00000 n 
+0000489098 00000 n 
+0000965395 00000 n 
+0000009281 00000 n 
+0000009532 00000 n 
+0000499096 00000 n 
+0000965303 00000 n 
+0000009585 00000 n 
+0000010005 00000 n 
+0000520536 00000 n 
+0000965211 00000 n 
+0000010058 00000 n 
+0000010445 00000 n 
+0000531276 00000 n 
+0000965119 00000 n 
+0000010498 00000 n 
+0000010837 00000 n 
+0000538352 00000 n 
+0000965041 00000 n 
+0000010890 00000 n 
+0000011120 00000 n 
+0000683860 00000 n 
+0000964962 00000 n 
+0000011166 00000 n 
+0000011219 00000 n 
+0000012621 00000 n 
+0000012740 00000 n 
+0000016078 00000 n 
+0000011271 00000 n 
+0000015965 00000 n 
+0000016021 00000 n 
+0000961639 00000 n 
+0000960061 00000 n 
+0000960494 00000 n 
+0000960205 00000 n 
+0000962170 00000 n 
+0000962526 00000 n 
+0000015734 00000 n 
+0000015918 00000 n 
+0000016505 00000 n 
+0000016330 00000 n 
+0000016230 00000 n 
+0000016449 00000 n 
+0000023548 00000 n 
+0000023714 00000 n 
+0000023866 00000 n 
+0000024032 00000 n 
+0000024330 00000 n 
+0000018369 00000 n 
+0000024510 00000 n 
+0000020572 00000 n 
+0000024730 00000 n 
+0000018182 00000 n 
+0000016546 00000 n 
+0000024674 00000 n 
+0000961813 00000 n 
+0000024182 00000 n 
+0000960929 00000 n 
+0000020341 00000 n 
+0000020525 00000 n 
+0000023317 00000 n 
+0000023501 00000 n 
+0000078261 00000 n 
+0000043169 00000 n 
+0000025144 00000 n 
+0000024969 00000 n 
+0000024869 00000 n 
+0000025088 00000 n 
+0000027082 00000 n 
+0000027233 00000 n 
+0000027384 00000 n 
+0000027535 00000 n 
+0000027686 00000 n 
+0000027843 00000 n 
+0000027993 00000 n 
+0000028150 00000 n 
+0000028301 00000 n 
+0000028458 00000 n 
+0000028615 00000 n 
+0000028771 00000 n 
+0000028928 00000 n 
+0000029085 00000 n 
+0000029242 00000 n 
+0000029392 00000 n 
+0000029547 00000 n 
+0000029704 00000 n 
+0000029861 00000 n 
+0000030017 00000 n 
+0000030174 00000 n 
+0000030330 00000 n 
+0000030487 00000 n 
+0000030643 00000 n 
+0000030800 00000 n 
+0000030958 00000 n 
+0000031116 00000 n 
+0000031274 00000 n 
+0000031432 00000 n 
+0000031590 00000 n 
+0000031748 00000 n 
+0000031904 00000 n 
+0000032060 00000 n 
+0000032218 00000 n 
+0000032376 00000 n 
+0000032534 00000 n 
+0000032692 00000 n 
+0000032850 00000 n 
+0000033008 00000 n 
+0000033166 00000 n 
+0000033323 00000 n 
+0000033473 00000 n 
+0000033693 00000 n 
+0000026615 00000 n 
+0000025185 00000 n 
+0000033637 00000 n 
+0000034094 00000 n 
+0000033919 00000 n 
+0000033819 00000 n 
+0000034038 00000 n 
+0000042184 00000 n 
+0000042368 00000 n 
+0000038085 00000 n 
+0000038361 00000 n 
+0000037946 00000 n 
+0000034135 00000 n 
+0000961281 00000 n 
+0000038304 00000 n 
+0000962346 00000 n 
+0000962644 00000 n 
+0000042553 00000 n 
+0000042734 00000 n 
+0000042895 00000 n 
+0000043283 00000 n 
+0000042013 00000 n 
+0000038526 00000 n 
+0000043112 00000 n 
+0000043226 00000 n 
+0000046797 00000 n 
+0000047132 00000 n 
+0000046658 00000 n 
+0000043435 00000 n 
+0000046961 00000 n 
+0000047018 00000 n 
+0000047075 00000 n 
+0000050674 00000 n 
+0000051007 00000 n 
+0000050535 00000 n 
+0000047271 00000 n 
+0000050836 00000 n 
+0000050893 00000 n 
+0000050950 00000 n 
+0000054384 00000 n 
+0000054718 00000 n 
+0000054245 00000 n 
+0000051146 00000 n 
+0000054548 00000 n 
+0000054604 00000 n 
+0000054661 00000 n 
+0000058566 00000 n 
+0000058841 00000 n 
+0000058427 00000 n 
+0000054857 00000 n 
+0000058728 00000 n 
+0000058784 00000 n 
+0000062287 00000 n 
+0000062564 00000 n 
+0000062148 00000 n 
+0000058980 00000 n 
+0000062451 00000 n 
+0000062507 00000 n 
+0000962762 00000 n 
+0000066104 00000 n 
+0000066493 00000 n 
+0000065965 00000 n 
+0000062703 00000 n 
+0000066266 00000 n 
+0000066322 00000 n 
+0000066379 00000 n 
+0000066436 00000 n 
+0000070284 00000 n 
+0000070675 00000 n 
+0000070145 00000 n 
+0000066632 00000 n 
+0000070448 00000 n 
+0000070504 00000 n 
+0000070561 00000 n 
+0000070618 00000 n 
+0000073856 00000 n 
+0000074302 00000 n 
+0000073717 00000 n 
+0000070814 00000 n 
+0000074018 00000 n 
+0000074074 00000 n 
+0000074131 00000 n 
+0000074188 00000 n 
+0000074245 00000 n 
+0000961103 00000 n 
+0000077381 00000 n 
+0000077557 00000 n 
+0000077733 00000 n 
+0000077928 00000 n 
+0000078318 00000 n 
+0000077218 00000 n 
+0000074454 00000 n 
+0000078092 00000 n 
+0000078204 00000 n 
+0000082392 00000 n 
+0000082610 00000 n 
+0000082253 00000 n 
+0000078470 00000 n 
+0000082554 00000 n 
+0000086571 00000 n 
+0000086791 00000 n 
+0000086432 00000 n 
+0000082736 00000 n 
+0000086735 00000 n 
+0000962880 00000 n 
+0000090218 00000 n 
+0000090436 00000 n 
+0000090079 00000 n 
+0000086917 00000 n 
+0000090380 00000 n 
+0000093902 00000 n 
+0000094122 00000 n 
+0000093763 00000 n 
+0000090562 00000 n 
+0000094066 00000 n 
+0000096996 00000 n 
+0000097172 00000 n 
+0000097329 00000 n 
+0000099447 00000 n 
+0000097484 00000 n 
+0000097871 00000 n 
+0000096833 00000 n 
+0000094248 00000 n 
+0000097646 00000 n 
+0000097702 00000 n 
+0000099604 00000 n 
+0000099761 00000 n 
+0000099918 00000 n 
+0000100074 00000 n 
+0000100284 00000 n 
+0000100441 00000 n 
+0000100624 00000 n 
+0000100781 00000 n 
+0000100954 00000 n 
+0000101110 00000 n 
+0000101306 00000 n 
+0000101462 00000 n 
+0000101641 00000 n 
+0000101798 00000 n 
+0000101970 00000 n 
+0000102127 00000 n 
+0000102324 00000 n 
+0000102481 00000 n 
+0000102660 00000 n 
+0000102817 00000 n 
+0000102989 00000 n 
+0000103146 00000 n 
+0000103342 00000 n 
+0000103500 00000 n 
+0000103679 00000 n 
+0000103833 00000 n 
+0000104004 00000 n 
+0000104162 00000 n 
+0000104364 00000 n 
+0000104522 00000 n 
+0000104705 00000 n 
+0000104861 00000 n 
+0000105193 00000 n 
+0000099052 00000 n 
+0000098010 00000 n 
+0000105025 00000 n 
+0000205406 00000 n 
+0000206031 00000 n 
+0000214562 00000 n 
+0000224393 00000 n 
+0000232872 00000 n 
+0000253565 00000 n 
+0000264313 00000 n 
+0000273102 00000 n 
+0000296161 00000 n 
+0000305565 00000 n 
+0000314519 00000 n 
+0000324324 00000 n 
+0000345667 00000 n 
+0000355638 00000 n 
+0000106767 00000 n 
+0000106944 00000 n 
+0000107102 00000 n 
+0000107282 00000 n 
+0000107440 00000 n 
+0000107614 00000 n 
+0000107771 00000 n 
+0000107952 00000 n 
+0000108109 00000 n 
+0000108281 00000 n 
+0000108439 00000 n 
+0000108620 00000 n 
+0000108778 00000 n 
+0000108955 00000 n 
+0000109113 00000 n 
+0000109324 00000 n 
+0000109713 00000 n 
+0000109871 00000 n 
+0000110076 00000 n 
+0000110466 00000 n 
+0000110624 00000 n 
+0000110819 00000 n 
+0000110977 00000 n 
+0000111148 00000 n 
+0000111306 00000 n 
+0000111693 00000 n 
+0000106420 00000 n 
+0000105332 00000 n 
+0000111468 00000 n 
+0000109519 00000 n 
+0000110271 00000 n 
+0000111580 00000 n 
+0000364414 00000 n 
+0000376235 00000 n 
+0000400437 00000 n 
+0000443366 00000 n 
+0000450979 00000 n 
+0000482693 00000 n 
+0000489040 00000 n 
+0000499038 00000 n 
+0000531218 00000 n 
+0000510533 00000 n 
+0000538294 00000 n 
+0000113807 00000 n 
+0000113996 00000 n 
+0000114185 00000 n 
+0000114374 00000 n 
+0000114563 00000 n 
+0000114752 00000 n 
+0000114941 00000 n 
+0000116020 00000 n 
+0000113620 00000 n 
+0000111832 00000 n 
+0000115105 00000 n 
+0000115161 00000 n 
+0000115274 00000 n 
+0000115331 00000 n 
+0000115388 00000 n 
+0000115444 00000 n 
+0000115501 00000 n 
+0000115557 00000 n 
+0000115613 00000 n 
+0000115669 00000 n 
+0000115726 00000 n 
+0000115783 00000 n 
+0000115840 00000 n 
+0000115902 00000 n 
+0000115959 00000 n 
+0000962998 00000 n 
+0000117260 00000 n 
+0000117535 00000 n 
+0000117121 00000 n 
+0000116198 00000 n 
+0000117422 00000 n 
+0000117478 00000 n 
+0000961458 00000 n 
+0000119585 00000 n 
+0000119777 00000 n 
+0000119969 00000 n 
+0000120160 00000 n 
+0000120352 00000 n 
+0000120544 00000 n 
+0000120736 00000 n 
+0000120928 00000 n 
+0000121120 00000 n 
+0000121312 00000 n 
+0000121504 00000 n 
+0000121696 00000 n 
+0000122883 00000 n 
+0000119358 00000 n 
+0000117700 00000 n 
+0000121860 00000 n 
+0000121916 00000 n 
+0000122029 00000 n 
+0000122086 00000 n 
+0000122143 00000 n 
+0000122200 00000 n 
+0000122257 00000 n 
+0000122314 00000 n 
+0000122371 00000 n 
+0000122428 00000 n 
+0000122485 00000 n 
+0000122542 00000 n 
+0000122599 00000 n 
+0000960640 00000 n 
+0000122655 00000 n 
+0000122712 00000 n 
+0000122769 00000 n 
+0000122826 00000 n 
+0000124365 00000 n 
+0000124090 00000 n 
+0000124479 00000 n 
+0000123951 00000 n 
+0000123075 00000 n 
+0000124252 00000 n 
+0000124308 00000 n 
+0000124422 00000 n 
+0000127051 00000 n 
+0000127240 00000 n 
+0000127463 00000 n 
+0000127687 00000 n 
+0000128133 00000 n 
+0000128357 00000 n 
+0000128580 00000 n 
+0000128804 00000 n 
+0000129027 00000 n 
+0000129249 00000 n 
+0000129472 00000 n 
+0000129695 00000 n 
+0000130142 00000 n 
+0000130332 00000 n 
+0000130522 00000 n 
+0000131814 00000 n 
+0000126784 00000 n 
+0000124644 00000 n 
+0000130686 00000 n 
+0000130742 00000 n 
+0000130855 00000 n 
+0000127911 00000 n 
+0000129919 00000 n 
+0000130912 00000 n 
+0000130969 00000 n 
+0000131026 00000 n 
+0000131083 00000 n 
+0000131140 00000 n 
+0000131197 00000 n 
+0000961989 00000 n 
+0000131259 00000 n 
+0000131320 00000 n 
+0000131382 00000 n 
+0000131443 00000 n 
+0000131505 00000 n 
+0000131567 00000 n 
+0000131629 00000 n 
+0000131691 00000 n 
+0000131753 00000 n 
+0000133583 00000 n 
+0000133701 00000 n 
+0000133365 00000 n 
+0000133815 00000 n 
+0000133226 00000 n 
+0000132006 00000 n 
+0000133527 00000 n 
+0000133644 00000 n 
+0000133758 00000 n 
+0000136536 00000 n 
+0000136728 00000 n 
+0000136920 00000 n 
+0000137112 00000 n 
+0000137304 00000 n 
+0000140064 00000 n 
+0000137496 00000 n 
+0000138461 00000 n 
+0000136357 00000 n 
+0000133994 00000 n 
+0000137660 00000 n 
+0000137716 00000 n 
+0000137829 00000 n 
+0000137886 00000 n 
+0000137943 00000 n 
+0000138000 00000 n 
+0000138057 00000 n 
+0000138114 00000 n 
+0000138171 00000 n 
+0000138228 00000 n 
+0000138285 00000 n 
+0000138347 00000 n 
+0000138404 00000 n 
+0000959043 00000 n 
+0000959481 00000 n 
+0000959189 00000 n 
+0000963116 00000 n 
+0000140256 00000 n 
+0000140474 00000 n 
+0000139917 00000 n 
+0000138677 00000 n 
+0000140418 00000 n 
+0000142188 00000 n 
+0000142381 00000 n 
+0000142575 00000 n 
+0000142769 00000 n 
+0000142941 00000 n 
+0000143135 00000 n 
+0000143307 00000 n 
+0000143501 00000 n 
+0000143680 00000 n 
+0000143874 00000 n 
+0000144053 00000 n 
+0000144245 00000 n 
+0000144417 00000 n 
+0000144611 00000 n 
+0000144782 00000 n 
+0000144975 00000 n 
+0000145153 00000 n 
+0000145346 00000 n 
+0000145525 00000 n 
+0000145719 00000 n 
+0000145915 00000 n 
+0000146109 00000 n 
+0000146305 00000 n 
+0000146499 00000 n 
+0000146670 00000 n 
+0000146864 00000 n 
+0000147033 00000 n 
+0000147226 00000 n 
+0000147402 00000 n 
+0000150259 00000 n 
+0000150437 00000 n 
+0000147594 00000 n 
+0000148778 00000 n 
+0000141817 00000 n 
+0000140626 00000 n 
+0000147758 00000 n 
+0000147814 00000 n 
+0000147927 00000 n 
+0000147983 00000 n 
+0000148039 00000 n 
+0000148095 00000 n 
+0000148152 00000 n 
+0000148209 00000 n 
+0000148266 00000 n 
+0000148323 00000 n 
+0000148380 00000 n 
+0000148437 00000 n 
+0000148494 00000 n 
+0000148551 00000 n 
+0000148608 00000 n 
+0000148664 00000 n 
+0000148721 00000 n 
+0000190127 00000 n 
+0000150631 00000 n 
+0000150826 00000 n 
+0000151020 00000 n 
+0000151215 00000 n 
+0000151409 00000 n 
+0000151581 00000 n 
+0000151775 00000 n 
+0000151946 00000 n 
+0000152140 00000 n 
+0000152319 00000 n 
+0000152513 00000 n 
+0000152692 00000 n 
+0000152886 00000 n 
+0000153082 00000 n 
+0000153276 00000 n 
+0000153472 00000 n 
+0000153666 00000 n 
+0000153842 00000 n 
+0000154036 00000 n 
+0000154211 00000 n 
+0000154404 00000 n 
+0000154588 00000 n 
+0000154782 00000 n 
+0000154966 00000 n 
+0000155160 00000 n 
+0000155361 00000 n 
+0000155555 00000 n 
+0000155754 00000 n 
+0000158532 00000 n 
+0000158703 00000 n 
+0000155946 00000 n 
+0000157018 00000 n 
+0000149880 00000 n 
+0000148943 00000 n 
+0000156108 00000 n 
+0000156164 00000 n 
+0000156221 00000 n 
+0000156278 00000 n 
+0000156335 00000 n 
+0000156391 00000 n 
+0000156448 00000 n 
+0000156505 00000 n 
+0000156562 00000 n 
+0000156619 00000 n 
+0000156676 00000 n 
+0000156733 00000 n 
+0000156790 00000 n 
+0000156847 00000 n 
+0000156904 00000 n 
+0000156961 00000 n 
+0000158894 00000 n 
+0000159066 00000 n 
+0000159260 00000 n 
+0000159433 00000 n 
+0000159627 00000 n 
+0000159800 00000 n 
+0000159994 00000 n 
+0000160170 00000 n 
+0000160364 00000 n 
+0000160540 00000 n 
+0000160734 00000 n 
+0000160913 00000 n 
+0000161106 00000 n 
+0000161286 00000 n 
+0000161480 00000 n 
+0000161660 00000 n 
+0000161853 00000 n 
+0000162033 00000 n 
+0000162226 00000 n 
+0000162408 00000 n 
+0000162602 00000 n 
+0000162784 00000 n 
+0000162977 00000 n 
+0000163171 00000 n 
+0000163365 00000 n 
+0000163572 00000 n 
+0000166900 00000 n 
+0000167108 00000 n 
+0000163955 00000 n 
+0000165029 00000 n 
+0000158161 00000 n 
+0000157170 00000 n 
+0000164119 00000 n 
+0000164175 00000 n 
+0000164232 00000 n 
+0000164289 00000 n 
+0000164346 00000 n 
+0000164403 00000 n 
+0000164460 00000 n 
+0000164517 00000 n 
+0000164574 00000 n 
+0000164630 00000 n 
+0000164687 00000 n 
+0000164744 00000 n 
+0000164801 00000 n 
+0000164858 00000 n 
+0000164915 00000 n 
+0000164972 00000 n 
+0000163764 00000 n 
+0000167301 00000 n 
+0000167473 00000 n 
+0000167667 00000 n 
+0000167838 00000 n 
+0000168032 00000 n 
+0000168226 00000 n 
+0000168420 00000 n 
+0000168614 00000 n 
+0000168808 00000 n 
+0000169012 00000 n 
+0000169398 00000 n 
+0000169601 00000 n 
+0000169795 00000 n 
+0000170006 00000 n 
+0000170393 00000 n 
+0000170603 00000 n 
+0000170797 00000 n 
+0000170991 00000 n 
+0000171218 00000 n 
+0000171446 00000 n 
+0000171901 00000 n 
+0000172129 00000 n 
+0000172356 00000 n 
+0000172549 00000 n 
+0000172777 00000 n 
+0000173232 00000 n 
+0000173460 00000 n 
+0000173688 00000 n 
+0000173881 00000 n 
+0000174108 00000 n 
+0000174560 00000 n 
+0000178219 00000 n 
+0000178412 00000 n 
+0000178639 00000 n 
+0000178866 00000 n 
+0000179094 00000 n 
+0000179322 00000 n 
+0000174787 00000 n 
+0000175575 00000 n 
+0000166457 00000 n 
+0000165181 00000 n 
+0000174949 00000 n 
+0000175005 00000 n 
+0000175062 00000 n 
+0000175119 00000 n 
+0000175176 00000 n 
+0000175233 00000 n 
+0000175290 00000 n 
+0000169206 00000 n 
+0000175347 00000 n 
+0000175404 00000 n 
+0000170200 00000 n 
+0000175461 00000 n 
+0000175518 00000 n 
+0000171674 00000 n 
+0000173005 00000 n 
+0000174334 00000 n 
+0000190298 00000 n 
+0000190412 00000 n 
+0000190474 00000 n 
+0000190536 00000 n 
+0000190598 00000 n 
+0000190660 00000 n 
+0000190722 00000 n 
+0000190836 00000 n 
+0000190898 00000 n 
+0000190960 00000 n 
+0000191022 00000 n 
+0000191083 00000 n 
+0000193661 00000 n 
+0000193723 00000 n 
+0000193785 00000 n 
+0000179548 00000 n 
+0000179742 00000 n 
+0000179970 00000 n 
+0000180424 00000 n 
+0000180617 00000 n 
+0000180845 00000 n 
+0000181300 00000 n 
+0000181528 00000 n 
+0000181722 00000 n 
+0000181916 00000 n 
+0000182110 00000 n 
+0000182304 00000 n 
+0000182494 00000 n 
+0000182688 00000 n 
+0000182881 00000 n 
+0000183074 00000 n 
+0000183268 00000 n 
+0000183462 00000 n 
+0000183656 00000 n 
+0000183850 00000 n 
+0000184044 00000 n 
+0000184237 00000 n 
+0000184431 00000 n 
+0000184625 00000 n 
+0000184815 00000 n 
+0000185008 00000 n 
+0000185201 00000 n 
+0000185395 00000 n 
+0000185589 00000 n 
+0000189544 00000 n 
+0000185780 00000 n 
+0000186908 00000 n 
+0000177784 00000 n 
+0000175740 00000 n 
+0000185944 00000 n 
+0000180198 00000 n 
+0000181073 00000 n 
+0000186000 00000 n 
+0000186057 00000 n 
+0000186114 00000 n 
+0000186171 00000 n 
+0000186227 00000 n 
+0000186284 00000 n 
+0000186341 00000 n 
+0000186398 00000 n 
+0000186455 00000 n 
+0000186512 00000 n 
+0000186569 00000 n 
+0000186626 00000 n 
+0000186683 00000 n 
+0000186738 00000 n 
+0000186795 00000 n 
+0000186852 00000 n 
+0000963234 00000 n 
+0000193847 00000 n 
+0000193961 00000 n 
+0000194023 00000 n 
+0000194085 00000 n 
+0000194147 00000 n 
+0000194209 00000 n 
+0000194271 00000 n 
+0000194385 00000 n 
+0000194447 00000 n 
+0000194509 00000 n 
+0000194622 00000 n 
+0000194684 00000 n 
+0000194746 00000 n 
+0000196739 00000 n 
+0000189738 00000 n 
+0000191139 00000 n 
+0000189397 00000 n 
+0000187086 00000 n 
+0000189900 00000 n 
+0000189956 00000 n 
+0000190013 00000 n 
+0000190070 00000 n 
+0000190184 00000 n 
+0000190241 00000 n 
+0000190355 00000 n 
+0000190779 00000 n 
+0000193384 00000 n 
+0000194808 00000 n 
+0000193245 00000 n 
+0000191343 00000 n 
+0000193548 00000 n 
+0000193604 00000 n 
+0000193904 00000 n 
+0000194328 00000 n 
+0000194566 00000 n 
+0000196464 00000 n 
+0000196910 00000 n 
+0000196325 00000 n 
+0000194999 00000 n 
+0000196626 00000 n 
+0000196682 00000 n 
+0000196796 00000 n 
+0000196853 00000 n 
+0000199454 00000 n 
+0000199698 00000 n 
+0000200086 00000 n 
+0000200574 00000 n 
+0000200767 00000 n 
+0000201155 00000 n 
+0000201643 00000 n 
+0000201837 00000 n 
+0000202221 00000 n 
+0000202465 00000 n 
+0000202853 00000 n 
+0000203097 00000 n 
+0000203485 00000 n 
+0000203679 00000 n 
+0000203922 00000 n 
+0000204309 00000 n 
+0000204551 00000 n 
+0000204937 00000 n 
+0000205130 00000 n 
+0000206087 00000 n 
+0000199099 00000 n 
+0000197088 00000 n 
+0000205294 00000 n 
+0000205519 00000 n 
+0000205576 00000 n 
+0000199892 00000 n 
+0000205633 00000 n 
+0000200330 00000 n 
+0000200961 00000 n 
+0000205689 00000 n 
+0000201399 00000 n 
+0000202031 00000 n 
+0000205746 00000 n 
+0000202659 00000 n 
+0000205803 00000 n 
+0000203291 00000 n 
+0000205860 00000 n 
+0000204115 00000 n 
+0000205917 00000 n 
+0000204744 00000 n 
+0000205974 00000 n 
+0000208585 00000 n 
+0000208801 00000 n 
+0000208994 00000 n 
+0000209380 00000 n 
+0000209596 00000 n 
+0000209790 00000 n 
+0000209983 00000 n 
+0000210176 00000 n 
+0000210393 00000 n 
+0000210587 00000 n 
+0000210975 00000 n 
+0000211191 00000 n 
+0000211385 00000 n 
+0000211579 00000 n 
+0000211795 00000 n 
+0000211989 00000 n 
+0000212207 00000 n 
+0000212402 00000 n 
+0000212620 00000 n 
+0000212814 00000 n 
+0000213032 00000 n 
+0000213226 00000 n 
+0000213444 00000 n 
+0000213639 00000 n 
+0000214677 00000 n 
+0000208231 00000 n 
+0000206278 00000 n 
+0000213802 00000 n 
+0000213917 00000 n 
+0000213976 00000 n 
+0000209187 00000 n 
+0000214035 00000 n 
+0000214093 00000 n 
+0000210781 00000 n 
+0000214151 00000 n 
+0000214210 00000 n 
+0000214269 00000 n 
+0000214328 00000 n 
+0000214387 00000 n 
+0000214446 00000 n 
+0000214504 00000 n 
+0000217790 00000 n 
+0000217998 00000 n 
+0000218193 00000 n 
+0000218401 00000 n 
+0000218596 00000 n 
+0000218803 00000 n 
+0000218998 00000 n 
+0000219193 00000 n 
+0000219400 00000 n 
+0000219595 00000 n 
+0000219802 00000 n 
+0000219996 00000 n 
+0000220189 00000 n 
+0000220397 00000 n 
+0000220592 00000 n 
+0000220800 00000 n 
+0000220995 00000 n 
+0000221203 00000 n 
+0000221398 00000 n 
+0000221605 00000 n 
+0000221813 00000 n 
+0000222021 00000 n 
+0000222229 00000 n 
+0000222424 00000 n 
+0000222632 00000 n 
+0000222827 00000 n 
+0000223034 00000 n 
+0000223226 00000 n 
+0000224450 00000 n 
+0000217403 00000 n 
+0000214869 00000 n 
+0000223391 00000 n 
+0000223449 00000 n 
+0000223508 00000 n 
+0000223567 00000 n 
+0000223626 00000 n 
+0000223685 00000 n 
+0000223744 00000 n 
+0000223803 00000 n 
+0000223862 00000 n 
+0000223921 00000 n 
+0000223980 00000 n 
+0000224039 00000 n 
+0000224098 00000 n 
+0000224157 00000 n 
+0000224216 00000 n 
+0000224275 00000 n 
+0000224334 00000 n 
+0000963353 00000 n 
+0000227136 00000 n 
+0000227368 00000 n 
+0000227563 00000 n 
+0000227793 00000 n 
+0000228182 00000 n 
+0000228377 00000 n 
+0000228609 00000 n 
+0000228998 00000 n 
+0000229191 00000 n 
+0000229423 00000 n 
+0000229813 00000 n 
+0000230045 00000 n 
+0000230435 00000 n 
+0000230630 00000 n 
+0000230862 00000 n 
+0000231252 00000 n 
+0000231484 00000 n 
+0000231872 00000 n 
+0000232065 00000 n 
+0000232986 00000 n 
+0000226776 00000 n 
+0000224629 00000 n 
+0000232228 00000 n 
+0000232343 00000 n 
+0000232402 00000 n 
+0000232460 00000 n 
+0000227987 00000 n 
+0000232518 00000 n 
+0000228804 00000 n 
+0000232577 00000 n 
+0000229618 00000 n 
+0000232636 00000 n 
+0000230240 00000 n 
+0000232695 00000 n 
+0000231057 00000 n 
+0000232754 00000 n 
+0000231679 00000 n 
+0000232813 00000 n 
+0000235865 00000 n 
+0000236078 00000 n 
+0000236271 00000 n 
+0000236486 00000 n 
+0000236681 00000 n 
+0000236896 00000 n 
+0000237091 00000 n 
+0000237481 00000 n 
+0000237696 00000 n 
+0000237891 00000 n 
+0000238086 00000 n 
+0000238297 00000 n 
+0000238487 00000 n 
+0000238682 00000 n 
+0000238897 00000 n 
+0000239092 00000 n 
+0000239307 00000 n 
+0000239502 00000 n 
+0000239891 00000 n 
+0000240106 00000 n 
+0000240301 00000 n 
+0000240515 00000 n 
+0000240708 00000 n 
+0000241097 00000 n 
+0000241312 00000 n 
+0000241507 00000 n 
+0000241895 00000 n 
+0000242110 00000 n 
+0000242305 00000 n 
+0000242519 00000 n 
+0000242714 00000 n 
+0000242928 00000 n 
+0000243121 00000 n 
+0000243510 00000 n 
+0000243723 00000 n 
+0000248031 00000 n 
+0000248246 00000 n 
+0000248441 00000 n 
+0000248656 00000 n 
+0000248851 00000 n 
+0000249065 00000 n 
+0000243915 00000 n 
+0000245020 00000 n 
+0000235361 00000 n 
+0000233178 00000 n 
+0000244080 00000 n 
+0000244138 00000 n 
+0000244197 00000 n 
+0000244256 00000 n 
+0000244314 00000 n 
+0000237286 00000 n 
+0000244373 00000 n 
+0000244431 00000 n 
+0000244490 00000 n 
+0000244549 00000 n 
+0000239697 00000 n 
+0000244608 00000 n 
+0000244667 00000 n 
+0000240902 00000 n 
+0000244726 00000 n 
+0000241702 00000 n 
+0000244785 00000 n 
+0000244844 00000 n 
+0000244903 00000 n 
+0000243315 00000 n 
+0000244962 00000 n 
+0000249260 00000 n 
+0000249475 00000 n 
+0000249670 00000 n 
+0000249876 00000 n 
+0000250070 00000 n 
+0000250264 00000 n 
+0000250653 00000 n 
+0000250860 00000 n 
+0000251055 00000 n 
+0000251261 00000 n 
+0000251454 00000 n 
+0000251660 00000 n 
+0000251855 00000 n 
+0000252050 00000 n 
+0000252257 00000 n 
+0000252452 00000 n 
+0000252647 00000 n 
+0000252854 00000 n 
+0000257022 00000 n 
+0000257229 00000 n 
+0000257423 00000 n 
+0000257618 00000 n 
+0000257825 00000 n 
+0000258020 00000 n 
+0000258214 00000 n 
+0000253049 00000 n 
+0000254091 00000 n 
+0000247662 00000 n 
+0000245199 00000 n 
+0000253212 00000 n 
+0000253270 00000 n 
+0000253329 00000 n 
+0000253388 00000 n 
+0000253447 00000 n 
+0000253506 00000 n 
+0000253679 00000 n 
+0000253738 00000 n 
+0000250458 00000 n 
+0000959335 00000 n 
+0000959916 00000 n 
+0000253796 00000 n 
+0000253855 00000 n 
+0000253914 00000 n 
+0000253973 00000 n 
+0000254032 00000 n 
+0000258604 00000 n 
+0000258811 00000 n 
+0000259006 00000 n 
+0000259201 00000 n 
+0000259408 00000 n 
+0000259603 00000 n 
+0000259797 00000 n 
+0000260004 00000 n 
+0000260199 00000 n 
+0000260406 00000 n 
+0000260601 00000 n 
+0000260808 00000 n 
+0000261003 00000 n 
+0000261209 00000 n 
+0000261402 00000 n 
+0000261609 00000 n 
+0000261804 00000 n 
+0000262010 00000 n 
+0000262205 00000 n 
+0000262437 00000 n 
+0000262632 00000 n 
+0000262862 00000 n 
+0000263248 00000 n 
+0000267420 00000 n 
+0000267651 00000 n 
+0000268040 00000 n 
+0000263441 00000 n 
+0000264604 00000 n 
+0000256590 00000 n 
+0000254312 00000 n 
+0000263606 00000 n 
+0000263664 00000 n 
+0000263723 00000 n 
+0000258409 00000 n 
+0000263782 00000 n 
+0000263841 00000 n 
+0000263900 00000 n 
+0000263959 00000 n 
+0000264018 00000 n 
+0000264077 00000 n 
+0000264136 00000 n 
+0000264195 00000 n 
+0000264254 00000 n 
+0000264428 00000 n 
+0000264487 00000 n 
+0000264545 00000 n 
+0000263055 00000 n 
+0000268234 00000 n 
+0000268465 00000 n 
+0000268854 00000 n 
+0000269085 00000 n 
+0000269475 00000 n 
+0000269669 00000 n 
+0000269901 00000 n 
+0000270096 00000 n 
+0000270328 00000 n 
+0000270717 00000 n 
+0000270911 00000 n 
+0000271126 00000 n 
+0000271321 00000 n 
+0000271536 00000 n 
+0000271731 00000 n 
+0000271945 00000 n 
+0000272138 00000 n 
+0000276414 00000 n 
+0000276629 00000 n 
+0000276824 00000 n 
+0000277214 00000 n 
+0000277428 00000 n 
+0000277622 00000 n 
+0000272527 00000 n 
+0000273452 00000 n 
+0000267051 00000 n 
+0000264796 00000 n 
+0000272690 00000 n 
+0000272748 00000 n 
+0000267846 00000 n 
+0000272807 00000 n 
+0000268659 00000 n 
+0000272866 00000 n 
+0000269280 00000 n 
+0000272925 00000 n 
+0000272984 00000 n 
+0000270523 00000 n 
+0000273043 00000 n 
+0000273217 00000 n 
+0000273276 00000 n 
+0000273335 00000 n 
+0000273393 00000 n 
+0000272332 00000 n 
+0000278011 00000 n 
+0000278226 00000 n 
+0000278421 00000 n 
+0000278636 00000 n 
+0000278830 00000 n 
+0000279220 00000 n 
+0000279435 00000 n 
+0000279629 00000 n 
+0000279844 00000 n 
+0000280039 00000 n 
+0000280254 00000 n 
+0000280449 00000 n 
+0000280838 00000 n 
+0000281052 00000 n 
+0000281246 00000 n 
+0000281634 00000 n 
+0000281849 00000 n 
+0000282044 00000 n 
+0000282259 00000 n 
+0000282452 00000 n 
+0000282667 00000 n 
+0000282862 00000 n 
+0000283252 00000 n 
+0000283467 00000 n 
+0000283662 00000 n 
+0000283875 00000 n 
+0000284067 00000 n 
+0000284282 00000 n 
+0000284477 00000 n 
+0000284692 00000 n 
+0000284886 00000 n 
+0000285100 00000 n 
+0000285294 00000 n 
+0000286460 00000 n 
+0000275874 00000 n 
+0000273644 00000 n 
+0000285459 00000 n 
+0000285517 00000 n 
+0000277019 00000 n 
+0000285576 00000 n 
+0000277816 00000 n 
+0000285635 00000 n 
+0000285694 00000 n 
+0000279025 00000 n 
+0000285752 00000 n 
+0000285811 00000 n 
+0000285870 00000 n 
+0000280644 00000 n 
+0000285929 00000 n 
+0000281439 00000 n 
+0000285988 00000 n 
+0000286047 00000 n 
+0000286106 00000 n 
+0000283057 00000 n 
+0000286165 00000 n 
+0000286224 00000 n 
+0000286283 00000 n 
+0000286342 00000 n 
+0000286401 00000 n 
+0000963478 00000 n 
+0000289517 00000 n 
+0000289724 00000 n 
+0000289919 00000 n 
+0000290114 00000 n 
+0000290503 00000 n 
+0000290710 00000 n 
+0000290905 00000 n 
+0000291112 00000 n 
+0000291307 00000 n 
+0000291513 00000 n 
+0000291707 00000 n 
+0000291901 00000 n 
+0000292108 00000 n 
+0000292303 00000 n 
+0000292498 00000 n 
+0000292705 00000 n 
+0000292900 00000 n 
+0000293107 00000 n 
+0000293302 00000 n 
+0000293496 00000 n 
+0000293703 00000 n 
+0000293898 00000 n 
+0000294105 00000 n 
+0000294299 00000 n 
+0000294494 00000 n 
+0000294884 00000 n 
+0000295091 00000 n 
+0000295286 00000 n 
+0000295481 00000 n 
+0000295687 00000 n 
+0000299696 00000 n 
+0000299903 00000 n 
+0000300098 00000 n 
+0000300305 00000 n 
+0000295881 00000 n 
+0000296982 00000 n 
+0000289085 00000 n 
+0000286626 00000 n 
+0000296044 00000 n 
+0000296102 00000 n 
+0000296276 00000 n 
+0000296335 00000 n 
+0000290309 00000 n 
+0000296394 00000 n 
+0000296453 00000 n 
+0000296511 00000 n 
+0000296570 00000 n 
+0000296629 00000 n 
+0000296688 00000 n 
+0000296746 00000 n 
+0000296805 00000 n 
+0000294689 00000 n 
+0000296864 00000 n 
+0000296923 00000 n 
+0000300500 00000 n 
+0000300707 00000 n 
+0000300902 00000 n 
+0000301108 00000 n 
+0000301301 00000 n 
+0000301508 00000 n 
+0000301702 00000 n 
+0000301933 00000 n 
+0000302128 00000 n 
+0000302358 00000 n 
+0000302747 00000 n 
+0000302942 00000 n 
+0000303173 00000 n 
+0000303563 00000 n 
+0000303757 00000 n 
+0000303987 00000 n 
+0000304181 00000 n 
+0000304410 00000 n 
+0000304796 00000 n 
+0000308873 00000 n 
+0000309103 00000 n 
+0000309297 00000 n 
+0000309528 00000 n 
+0000309918 00000 n 
+0000304989 00000 n 
+0000306032 00000 n 
+0000299318 00000 n 
+0000297202 00000 n 
+0000305154 00000 n 
+0000305212 00000 n 
+0000305271 00000 n 
+0000305330 00000 n 
+0000305388 00000 n 
+0000305447 00000 n 
+0000305506 00000 n 
+0000305680 00000 n 
+0000305738 00000 n 
+0000305797 00000 n 
+0000302552 00000 n 
+0000305856 00000 n 
+0000303368 00000 n 
+0000305915 00000 n 
+0000305973 00000 n 
+0000304603 00000 n 
+0000310113 00000 n 
+0000310327 00000 n 
+0000310522 00000 n 
+0000310736 00000 n 
+0000310931 00000 n 
+0000311320 00000 n 
+0000311534 00000 n 
+0000311729 00000 n 
+0000312118 00000 n 
+0000312332 00000 n 
+0000312527 00000 n 
+0000312917 00000 n 
+0000313131 00000 n 
+0000313324 00000 n 
+0000313538 00000 n 
+0000313733 00000 n 
+0000317746 00000 n 
+0000317959 00000 n 
+0000318154 00000 n 
+0000318368 00000 n 
+0000318563 00000 n 
+0000314121 00000 n 
+0000315047 00000 n 
+0000308495 00000 n 
+0000306224 00000 n 
+0000314284 00000 n 
+0000314342 00000 n 
+0000314401 00000 n 
+0000309723 00000 n 
+0000314460 00000 n 
+0000314635 00000 n 
+0000314694 00000 n 
+0000314753 00000 n 
+0000311126 00000 n 
+0000314812 00000 n 
+0000311924 00000 n 
+0000314871 00000 n 
+0000312722 00000 n 
+0000314929 00000 n 
+0000314988 00000 n 
+0000313928 00000 n 
+0000318952 00000 n 
+0000319164 00000 n 
+0000319355 00000 n 
+0000319743 00000 n 
+0000319956 00000 n 
+0000320151 00000 n 
+0000320365 00000 n 
+0000320560 00000 n 
+0000320773 00000 n 
+0000320968 00000 n 
+0000321357 00000 n 
+0000321570 00000 n 
+0000321764 00000 n 
+0000321978 00000 n 
+0000322173 00000 n 
+0000322385 00000 n 
+0000322578 00000 n 
+0000322792 00000 n 
+0000322987 00000 n 
+0000323201 00000 n 
+0000327857 00000 n 
+0000328063 00000 n 
+0000328258 00000 n 
+0000328453 00000 n 
+0000328843 00000 n 
+0000323396 00000 n 
+0000324440 00000 n 
+0000317350 00000 n 
+0000315239 00000 n 
+0000323561 00000 n 
+0000323619 00000 n 
+0000323678 00000 n 
+0000318757 00000 n 
+0000323737 00000 n 
+0000319548 00000 n 
+0000323796 00000 n 
+0000323854 00000 n 
+0000323913 00000 n 
+0000321162 00000 n 
+0000323972 00000 n 
+0000324030 00000 n 
+0000324088 00000 n 
+0000324147 00000 n 
+0000324206 00000 n 
+0000324265 00000 n 
+0000329038 00000 n 
+0000329244 00000 n 
+0000329439 00000 n 
+0000329645 00000 n 
+0000329840 00000 n 
+0000330046 00000 n 
+0000330241 00000 n 
+0000330436 00000 n 
+0000330641 00000 n 
+0000330836 00000 n 
+0000331031 00000 n 
+0000331237 00000 n 
+0000331432 00000 n 
+0000331638 00000 n 
+0000331832 00000 n 
+0000332027 00000 n 
+0000332233 00000 n 
+0000332428 00000 n 
+0000332634 00000 n 
+0000332829 00000 n 
+0000333023 00000 n 
+0000333413 00000 n 
+0000333618 00000 n 
+0000333813 00000 n 
+0000334008 00000 n 
+0000334212 00000 n 
+0000334405 00000 n 
+0000334611 00000 n 
+0000334805 00000 n 
+0000335011 00000 n 
+0000335206 00000 n 
+0000335411 00000 n 
+0000335605 00000 n 
+0000335809 00000 n 
+0000336003 00000 n 
+0000336207 00000 n 
+0000336400 00000 n 
+0000337623 00000 n 
+0000327326 00000 n 
+0000324632 00000 n 
+0000336563 00000 n 
+0000336621 00000 n 
+0000336680 00000 n 
+0000328648 00000 n 
+0000336739 00000 n 
+0000960783 00000 n 
+0000959626 00000 n 
+0000336798 00000 n 
+0000336857 00000 n 
+0000336916 00000 n 
+0000336975 00000 n 
+0000337034 00000 n 
+0000337093 00000 n 
+0000337152 00000 n 
+0000333218 00000 n 
+0000337210 00000 n 
+0000337269 00000 n 
+0000337328 00000 n 
+0000337387 00000 n 
+0000337446 00000 n 
+0000337505 00000 n 
+0000337564 00000 n 
+0000340223 00000 n 
+0000340460 00000 n 
+0000340849 00000 n 
+0000341086 00000 n 
+0000341281 00000 n 
+0000341671 00000 n 
+0000341908 00000 n 
+0000342103 00000 n 
+0000342493 00000 n 
+0000342730 00000 n 
+0000343119 00000 n 
+0000343355 00000 n 
+0000343744 00000 n 
+0000343939 00000 n 
+0000344176 00000 n 
+0000344564 00000 n 
+0000344800 00000 n 
+0000345190 00000 n 
+0000345385 00000 n 
+0000346254 00000 n 
+0000339854 00000 n 
+0000337831 00000 n 
+0000345550 00000 n 
+0000345608 00000 n 
+0000345783 00000 n 
+0000345841 00000 n 
+0000340655 00000 n 
+0000345900 00000 n 
+0000341476 00000 n 
+0000345959 00000 n 
+0000342298 00000 n 
+0000346018 00000 n 
+0000342925 00000 n 
+0000346077 00000 n 
+0000343549 00000 n 
+0000346136 00000 n 
+0000344371 00000 n 
+0000346195 00000 n 
+0000344995 00000 n 
+0000963603 00000 n 
+0000349078 00000 n 
+0000349298 00000 n 
+0000349493 00000 n 
+0000349712 00000 n 
+0000349907 00000 n 
+0000350102 00000 n 
+0000350322 00000 n 
+0000350712 00000 n 
+0000350903 00000 n 
+0000351123 00000 n 
+0000351513 00000 n 
+0000351708 00000 n 
+0000351927 00000 n 
+0000352121 00000 n 
+0000352341 00000 n 
+0000352536 00000 n 
+0000352926 00000 n 
+0000353146 00000 n 
+0000353341 00000 n 
+0000353560 00000 n 
+0000353754 00000 n 
+0000354143 00000 n 
+0000354363 00000 n 
+0000354558 00000 n 
+0000354947 00000 n 
+0000355165 00000 n 
+0000359440 00000 n 
+0000359659 00000 n 
+0000355358 00000 n 
+0000356402 00000 n 
+0000348655 00000 n 
+0000346446 00000 n 
+0000355521 00000 n 
+0000355579 00000 n 
+0000355754 00000 n 
+0000355813 00000 n 
+0000355872 00000 n 
+0000355931 00000 n 
+0000350517 00000 n 
+0000355990 00000 n 
+0000351318 00000 n 
+0000356049 00000 n 
+0000356108 00000 n 
+0000352731 00000 n 
+0000356167 00000 n 
+0000356226 00000 n 
+0000353948 00000 n 
+0000356285 00000 n 
+0000354753 00000 n 
+0000356344 00000 n 
+0000359851 00000 n 
+0000360071 00000 n 
+0000360266 00000 n 
+0000360656 00000 n 
+0000360876 00000 n 
+0000361071 00000 n 
+0000361291 00000 n 
+0000361486 00000 n 
+0000361706 00000 n 
+0000361901 00000 n 
+0000362121 00000 n 
+0000362316 00000 n 
+0000362536 00000 n 
+0000362729 00000 n 
+0000362941 00000 n 
+0000363136 00000 n 
+0000363331 00000 n 
+0000363526 00000 n 
+0000367689 00000 n 
+0000367901 00000 n 
+0000368096 00000 n 
+0000368307 00000 n 
+0000368502 00000 n 
+0000363721 00000 n 
+0000364647 00000 n 
+0000359107 00000 n 
+0000356594 00000 n 
+0000363886 00000 n 
+0000363944 00000 n 
+0000364003 00000 n 
+0000360461 00000 n 
+0000364061 00000 n 
+0000364120 00000 n 
+0000364179 00000 n 
+0000364237 00000 n 
+0000364296 00000 n 
+0000364355 00000 n 
+0000364530 00000 n 
+0000364588 00000 n 
+0000368891 00000 n 
+0000369102 00000 n 
+0000369296 00000 n 
+0000369684 00000 n 
+0000369896 00000 n 
+0000370091 00000 n 
+0000370303 00000 n 
+0000370498 00000 n 
+0000370692 00000 n 
+0000370904 00000 n 
+0000371099 00000 n 
+0000371310 00000 n 
+0000371504 00000 n 
+0000371698 00000 n 
+0000372086 00000 n 
+0000372298 00000 n 
+0000372492 00000 n 
+0000372687 00000 n 
+0000372899 00000 n 
+0000373094 00000 n 
+0000373306 00000 n 
+0000373501 00000 n 
+0000373713 00000 n 
+0000373908 00000 n 
+0000374120 00000 n 
+0000374315 00000 n 
+0000374527 00000 n 
+0000374722 00000 n 
+0000374934 00000 n 
+0000375129 00000 n 
+0000376291 00000 n 
+0000367212 00000 n 
+0000364839 00000 n 
+0000375292 00000 n 
+0000375350 00000 n 
+0000375409 00000 n 
+0000368697 00000 n 
+0000375468 00000 n 
+0000369490 00000 n 
+0000375527 00000 n 
+0000375586 00000 n 
+0000375645 00000 n 
+0000375704 00000 n 
+0000371891 00000 n 
+0000375763 00000 n 
+0000375822 00000 n 
+0000375881 00000 n 
+0000375940 00000 n 
+0000375999 00000 n 
+0000376058 00000 n 
+0000376117 00000 n 
+0000376176 00000 n 
+0000379322 00000 n 
+0000379537 00000 n 
+0000379732 00000 n 
+0000379947 00000 n 
+0000380142 00000 n 
+0000380530 00000 n 
+0000380742 00000 n 
+0000380935 00000 n 
+0000381324 00000 n 
+0000381539 00000 n 
+0000381734 00000 n 
+0000382124 00000 n 
+0000382339 00000 n 
+0000382534 00000 n 
+0000382924 00000 n 
+0000383138 00000 n 
+0000383333 00000 n 
+0000383723 00000 n 
+0000383937 00000 n 
+0000384131 00000 n 
+0000384520 00000 n 
+0000384735 00000 n 
+0000384930 00000 n 
+0000385320 00000 n 
+0000385535 00000 n 
+0000385730 00000 n 
+0000385944 00000 n 
+0000386138 00000 n 
+0000386527 00000 n 
+0000386741 00000 n 
+0000386935 00000 n 
+0000387128 00000 n 
+0000391272 00000 n 
+0000391487 00000 n 
+0000391682 00000 n 
+0000392072 00000 n 
+0000392287 00000 n 
+0000387322 00000 n 
+0000388310 00000 n 
+0000378818 00000 n 
+0000376499 00000 n 
+0000387487 00000 n 
+0000387603 00000 n 
+0000387662 00000 n 
+0000387721 00000 n 
+0000380337 00000 n 
+0000387779 00000 n 
+0000381129 00000 n 
+0000387838 00000 n 
+0000381929 00000 n 
+0000387897 00000 n 
+0000382729 00000 n 
+0000387956 00000 n 
+0000383528 00000 n 
+0000388015 00000 n 
+0000384325 00000 n 
+0000388074 00000 n 
+0000385125 00000 n 
+0000388133 00000 n 
+0000388192 00000 n 
+0000386332 00000 n 
+0000388251 00000 n 
+0000392482 00000 n 
+0000392697 00000 n 
+0000392892 00000 n 
+0000393107 00000 n 
+0000393302 00000 n 
+0000393516 00000 n 
+0000393711 00000 n 
+0000393905 00000 n 
+0000394100 00000 n 
+0000394315 00000 n 
+0000394510 00000 n 
+0000394900 00000 n 
+0000395115 00000 n 
+0000395309 00000 n 
+0000395698 00000 n 
+0000395913 00000 n 
+0000396108 00000 n 
+0000396497 00000 n 
+0000396712 00000 n 
+0000396907 00000 n 
+0000397297 00000 n 
+0000397512 00000 n 
+0000397707 00000 n 
+0000397920 00000 n 
+0000398113 00000 n 
+0000398326 00000 n 
+0000398520 00000 n 
+0000398735 00000 n 
+0000398930 00000 n 
+0000399144 00000 n 
+0000399338 00000 n 
+0000400494 00000 n 
+0000390768 00000 n 
+0000388502 00000 n 
+0000399501 00000 n 
+0000399559 00000 n 
+0000391877 00000 n 
+0000399618 00000 n 
+0000399677 00000 n 
+0000399736 00000 n 
+0000399795 00000 n 
+0000399853 00000 n 
+0000394705 00000 n 
+0000399911 00000 n 
+0000395504 00000 n 
+0000399969 00000 n 
+0000396303 00000 n 
+0000400026 00000 n 
+0000397102 00000 n 
+0000400084 00000 n 
+0000400143 00000 n 
+0000400201 00000 n 
+0000400260 00000 n 
+0000400319 00000 n 
+0000400378 00000 n 
+0000403210 00000 n 
+0000403418 00000 n 
+0000403627 00000 n 
+0000403836 00000 n 
+0000404045 00000 n 
+0000404253 00000 n 
+0000404461 00000 n 
+0000404670 00000 n 
+0000405088 00000 n 
+0000405297 00000 n 
+0000405506 00000 n 
+0000405701 00000 n 
+0000406090 00000 n 
+0000406298 00000 n 
+0000406491 00000 n 
+0000406685 00000 n 
+0000407074 00000 n 
+0000407269 00000 n 
+0000407478 00000 n 
+0000407672 00000 n 
+0000408062 00000 n 
+0000408271 00000 n 
+0000408466 00000 n 
+0000408856 00000 n 
+0000409065 00000 n 
+0000413671 00000 n 
+0000413880 00000 n 
+0000414075 00000 n 
+0000414270 00000 n 
+0000414478 00000 n 
+0000414671 00000 n 
+0000415060 00000 n 
+0000415269 00000 n 
+0000415464 00000 n 
+0000409260 00000 n 
+0000410426 00000 n 
+0000402796 00000 n 
+0000400701 00000 n 
+0000409425 00000 n 
+0000409541 00000 n 
+0000409600 00000 n 
+0000409659 00000 n 
+0000409718 00000 n 
+0000409777 00000 n 
+0000409836 00000 n 
+0000409895 00000 n 
+0000409954 00000 n 
+0000410013 00000 n 
+0000404879 00000 n 
+0000410072 00000 n 
+0000410131 00000 n 
+0000405896 00000 n 
+0000410190 00000 n 
+0000406879 00000 n 
+0000410249 00000 n 
+0000407867 00000 n 
+0000410308 00000 n 
+0000408661 00000 n 
+0000410367 00000 n 
+0000963728 00000 n 
+0000415854 00000 n 
+0000416063 00000 n 
+0000416258 00000 n 
+0000416648 00000 n 
+0000416854 00000 n 
+0000417047 00000 n 
+0000417240 00000 n 
+0000417435 00000 n 
+0000417644 00000 n 
+0000417839 00000 n 
+0000418228 00000 n 
+0000418437 00000 n 
+0000418632 00000 n 
+0000418841 00000 n 
+0000419036 00000 n 
+0000419244 00000 n 
+0000419438 00000 n 
+0000419647 00000 n 
+0000419842 00000 n 
+0000420232 00000 n 
+0000420441 00000 n 
+0000420635 00000 n 
+0000421024 00000 n 
+0000421232 00000 n 
+0000421426 00000 n 
+0000421621 00000 n 
+0000421830 00000 n 
+0000422024 00000 n 
+0000422414 00000 n 
+0000422623 00000 n 
+0000422818 00000 n 
+0000423208 00000 n 
+0000423417 00000 n 
+0000423612 00000 n 
+0000423820 00000 n 
+0000428348 00000 n 
+0000428557 00000 n 
+0000428752 00000 n 
+0000428960 00000 n 
+0000429154 00000 n 
+0000429543 00000 n 
+0000429737 00000 n 
+0000429932 00000 n 
+0000430139 00000 n 
+0000430332 00000 n 
+0000424014 00000 n 
+0000425178 00000 n 
+0000413059 00000 n 
+0000410618 00000 n 
+0000424177 00000 n 
+0000424235 00000 n 
+0000424294 00000 n 
+0000414865 00000 n 
+0000424353 00000 n 
+0000415659 00000 n 
+0000424412 00000 n 
+0000416453 00000 n 
+0000424471 00000 n 
+0000424530 00000 n 
+0000418034 00000 n 
+0000424589 00000 n 
+0000424648 00000 n 
+0000424707 00000 n 
+0000424766 00000 n 
+0000420037 00000 n 
+0000424825 00000 n 
+0000420830 00000 n 
+0000424884 00000 n 
+0000424943 00000 n 
+0000422219 00000 n 
+0000425001 00000 n 
+0000423013 00000 n 
+0000425060 00000 n 
+0000425119 00000 n 
+0000430523 00000 n 
+0000430731 00000 n 
+0000430925 00000 n 
+0000431313 00000 n 
+0000431522 00000 n 
+0000431717 00000 n 
+0000431911 00000 n 
+0000432106 00000 n 
+0000432315 00000 n 
+0000432510 00000 n 
+0000432717 00000 n 
+0000432910 00000 n 
+0000433119 00000 n 
+0000433313 00000 n 
+0000433522 00000 n 
+0000433717 00000 n 
+0000433926 00000 n 
+0000434121 00000 n 
+0000434328 00000 n 
+0000434522 00000 n 
+0000434730 00000 n 
+0000434923 00000 n 
+0000435132 00000 n 
+0000435326 00000 n 
+0000435535 00000 n 
+0000435730 00000 n 
+0000436894 00000 n 
+0000427871 00000 n 
+0000425344 00000 n 
+0000435895 00000 n 
+0000429348 00000 n 
+0000435953 00000 n 
+0000436012 00000 n 
+0000431118 00000 n 
+0000436071 00000 n 
+0000436130 00000 n 
+0000436189 00000 n 
+0000436248 00000 n 
+0000436306 00000 n 
+0000436365 00000 n 
+0000436424 00000 n 
+0000436483 00000 n 
+0000436541 00000 n 
+0000436600 00000 n 
+0000436659 00000 n 
+0000436718 00000 n 
+0000436777 00000 n 
+0000436836 00000 n 
+0000443189 00000 n 
+0000440007 00000 n 
+0000440222 00000 n 
+0000440416 00000 n 
+0000440804 00000 n 
+0000441020 00000 n 
+0000441215 00000 n 
+0000441431 00000 n 
+0000441626 00000 n 
+0000441842 00000 n 
+0000442036 00000 n 
+0000442251 00000 n 
+0000442443 00000 n 
+0000442657 00000 n 
+0000442850 00000 n 
+0000443895 00000 n 
+0000439737 00000 n 
+0000437100 00000 n 
+0000443013 00000 n 
+0000443071 00000 n 
+0000443130 00000 n 
+0000443248 00000 n 
+0000443307 00000 n 
+0000443482 00000 n 
+0000443541 00000 n 
+0000440610 00000 n 
+0000443600 00000 n 
+0000443659 00000 n 
+0000443718 00000 n 
+0000443777 00000 n 
+0000443836 00000 n 
+0000446242 00000 n 
+0000446451 00000 n 
+0000446660 00000 n 
+0000446869 00000 n 
+0000447076 00000 n 
+0000447284 00000 n 
+0000447493 00000 n 
+0000447702 00000 n 
+0000447910 00000 n 
+0000448327 00000 n 
+0000448536 00000 n 
+0000448731 00000 n 
+0000449121 00000 n 
+0000449329 00000 n 
+0000449523 00000 n 
+0000449912 00000 n 
+0000450119 00000 n 
+0000450311 00000 n 
+0000455401 00000 n 
+0000455609 00000 n 
+0000455804 00000 n 
+0000455999 00000 n 
+0000456194 00000 n 
+0000456389 00000 n 
+0000450697 00000 n 
+0000451861 00000 n 
+0000445900 00000 n 
+0000444100 00000 n 
+0000450862 00000 n 
+0000450920 00000 n 
+0000451095 00000 n 
+0000451154 00000 n 
+0000451213 00000 n 
+0000451272 00000 n 
+0000451331 00000 n 
+0000451390 00000 n 
+0000451449 00000 n 
+0000451508 00000 n 
+0000451567 00000 n 
+0000451626 00000 n 
+0000448118 00000 n 
+0000451685 00000 n 
+0000448926 00000 n 
+0000451744 00000 n 
+0000449717 00000 n 
+0000451803 00000 n 
+0000450504 00000 n 
+0000456584 00000 n 
+0000456793 00000 n 
+0000456988 00000 n 
+0000457197 00000 n 
+0000457392 00000 n 
+0000457587 00000 n 
+0000457796 00000 n 
+0000457991 00000 n 
+0000458186 00000 n 
+0000458395 00000 n 
+0000458590 00000 n 
+0000458980 00000 n 
+0000459188 00000 n 
+0000459383 00000 n 
+0000459773 00000 n 
+0000459980 00000 n 
+0000460175 00000 n 
+0000460370 00000 n 
+0000460579 00000 n 
+0000460774 00000 n 
+0000460968 00000 n 
+0000461163 00000 n 
+0000461372 00000 n 
+0000461567 00000 n 
+0000461776 00000 n 
+0000461970 00000 n 
+0000462179 00000 n 
+0000462374 00000 n 
+0000462582 00000 n 
+0000462777 00000 n 
+0000462986 00000 n 
+0000463181 00000 n 
+0000463570 00000 n 
+0000463764 00000 n 
+0000463973 00000 n 
+0000464168 00000 n 
+0000464558 00000 n 
+0000464765 00000 n 
+0000464958 00000 n 
+0000469394 00000 n 
+0000469602 00000 n 
+0000469796 00000 n 
+0000469988 00000 n 
+0000470197 00000 n 
+0000470392 00000 n 
+0000465344 00000 n 
+0000466332 00000 n 
+0000454807 00000 n 
+0000452053 00000 n 
+0000465507 00000 n 
+0000465565 00000 n 
+0000465624 00000 n 
+0000465683 00000 n 
+0000465742 00000 n 
+0000458785 00000 n 
+0000465801 00000 n 
+0000459578 00000 n 
+0000465860 00000 n 
+0000465919 00000 n 
+0000465978 00000 n 
+0000466037 00000 n 
+0000466096 00000 n 
+0000466155 00000 n 
+0000463376 00000 n 
+0000466214 00000 n 
+0000464363 00000 n 
+0000466273 00000 n 
+0000465151 00000 n 
+0000476655 00000 n 
+0000476773 00000 n 
+0000470587 00000 n 
+0000470796 00000 n 
+0000470991 00000 n 
+0000471200 00000 n 
+0000471393 00000 n 
+0000471602 00000 n 
+0000471797 00000 n 
+0000471992 00000 n 
+0000472200 00000 n 
+0000472395 00000 n 
+0000472785 00000 n 
+0000472994 00000 n 
+0000473188 00000 n 
+0000473397 00000 n 
+0000473592 00000 n 
+0000473801 00000 n 
+0000473994 00000 n 
+0000474203 00000 n 
+0000474398 00000 n 
+0000474606 00000 n 
+0000474800 00000 n 
+0000475008 00000 n 
+0000475203 00000 n 
+0000475412 00000 n 
+0000475607 00000 n 
+0000476836 00000 n 
+0000468971 00000 n 
+0000466541 00000 n 
+0000475772 00000 n 
+0000475830 00000 n 
+0000475889 00000 n 
+0000475948 00000 n 
+0000476007 00000 n 
+0000476066 00000 n 
+0000472590 00000 n 
+0000476125 00000 n 
+0000476183 00000 n 
+0000476242 00000 n 
+0000476301 00000 n 
+0000476360 00000 n 
+0000476419 00000 n 
+0000476478 00000 n 
+0000476537 00000 n 
+0000476596 00000 n 
+0000476714 00000 n 
+0000963853 00000 n 
+0000482572 00000 n 
+0000480016 00000 n 
+0000480231 00000 n 
+0000480425 00000 n 
+0000480813 00000 n 
+0000481008 00000 n 
+0000481223 00000 n 
+0000481415 00000 n 
+0000481631 00000 n 
+0000481826 00000 n 
+0000482040 00000 n 
+0000485999 00000 n 
+0000486215 00000 n 
+0000486410 00000 n 
+0000486626 00000 n 
+0000482233 00000 n 
+0000483044 00000 n 
+0000479773 00000 n 
+0000477028 00000 n 
+0000482396 00000 n 
+0000482454 00000 n 
+0000482513 00000 n 
+0000482635 00000 n 
+0000482809 00000 n 
+0000480619 00000 n 
+0000482868 00000 n 
+0000482927 00000 n 
+0000482986 00000 n 
+0000488863 00000 n 
+0000486821 00000 n 
+0000487032 00000 n 
+0000487227 00000 n 
+0000487616 00000 n 
+0000487826 00000 n 
+0000488019 00000 n 
+0000492366 00000 n 
+0000492577 00000 n 
+0000492771 00000 n 
+0000488404 00000 n 
+0000489333 00000 n 
+0000485747 00000 n 
+0000483249 00000 n 
+0000488569 00000 n 
+0000488627 00000 n 
+0000488686 00000 n 
+0000488745 00000 n 
+0000488804 00000 n 
+0000488922 00000 n 
+0000488981 00000 n 
+0000489156 00000 n 
+0000489215 00000 n 
+0000487422 00000 n 
+0000489274 00000 n 
+0000488212 00000 n 
+0000493159 00000 n 
+0000493371 00000 n 
+0000493564 00000 n 
+0000493775 00000 n 
+0000493969 00000 n 
+0000494356 00000 n 
+0000494568 00000 n 
+0000494763 00000 n 
+0000495152 00000 n 
+0000495363 00000 n 
+0000495557 00000 n 
+0000495945 00000 n 
+0000496157 00000 n 
+0000496348 00000 n 
+0000496560 00000 n 
+0000496755 00000 n 
+0000496967 00000 n 
+0000497162 00000 n 
+0000497372 00000 n 
+0000497566 00000 n 
+0000497778 00000 n 
+0000497973 00000 n 
+0000502318 00000 n 
+0000502565 00000 n 
+0000498169 00000 n 
+0000499212 00000 n 
+0000491961 00000 n 
+0000489538 00000 n 
+0000498332 00000 n 
+0000498390 00000 n 
+0000492965 00000 n 
+0000498449 00000 n 
+0000498508 00000 n 
+0000494163 00000 n 
+0000498567 00000 n 
+0000494958 00000 n 
+0000498626 00000 n 
+0000495751 00000 n 
+0000498685 00000 n 
+0000498744 00000 n 
+0000498803 00000 n 
+0000498862 00000 n 
+0000498921 00000 n 
+0000498980 00000 n 
+0000499154 00000 n 
+0000502955 00000 n 
+0000503202 00000 n 
+0000503591 00000 n 
+0000503980 00000 n 
+0000504227 00000 n 
+0000504617 00000 n 
+0000504812 00000 n 
+0000505059 00000 n 
+0000505448 00000 n 
+0000505643 00000 n 
+0000505889 00000 n 
+0000506278 00000 n 
+0000506524 00000 n 
+0000506913 00000 n 
+0000507108 00000 n 
+0000507355 00000 n 
+0000507745 00000 n 
+0000507992 00000 n 
+0000508381 00000 n 
+0000508628 00000 n 
+0000509018 00000 n 
+0000509408 00000 n 
+0000509604 00000 n 
+0000510590 00000 n 
+0000501859 00000 n 
+0000499391 00000 n 
+0000509769 00000 n 
+0000509827 00000 n 
+0000502760 00000 n 
+0000509886 00000 n 
+0000503397 00000 n 
+0000503785 00000 n 
+0000509945 00000 n 
+0000504422 00000 n 
+0000510004 00000 n 
+0000505253 00000 n 
+0000510062 00000 n 
+0000506083 00000 n 
+0000506718 00000 n 
+0000510121 00000 n 
+0000507550 00000 n 
+0000510180 00000 n 
+0000508187 00000 n 
+0000510239 00000 n 
+0000508823 00000 n 
+0000509213 00000 n 
+0000510298 00000 n 
+0000510356 00000 n 
+0000510415 00000 n 
+0000510474 00000 n 
+0000513483 00000 n 
+0000513679 00000 n 
+0000513919 00000 n 
+0000514309 00000 n 
+0000514549 00000 n 
+0000514939 00000 n 
+0000515134 00000 n 
+0000515373 00000 n 
+0000515762 00000 n 
+0000515957 00000 n 
+0000516197 00000 n 
+0000516391 00000 n 
+0000516586 00000 n 
+0000516825 00000 n 
+0000517214 00000 n 
+0000517454 00000 n 
+0000517842 00000 n 
+0000518037 00000 n 
+0000518277 00000 n 
+0000518667 00000 n 
+0000518907 00000 n 
+0000519297 00000 n 
+0000519537 00000 n 
+0000519925 00000 n 
+0000520120 00000 n 
+0000520315 00000 n 
+0000521359 00000 n 
+0000513042 00000 n 
+0000510782 00000 n 
+0000520478 00000 n 
+0000520594 00000 n 
+0000520653 00000 n 
+0000514114 00000 n 
+0000520712 00000 n 
+0000514744 00000 n 
+0000520771 00000 n 
+0000515567 00000 n 
+0000520830 00000 n 
+0000520887 00000 n 
+0000517019 00000 n 
+0000517648 00000 n 
+0000520946 00000 n 
+0000518472 00000 n 
+0000521005 00000 n 
+0000519102 00000 n 
+0000521064 00000 n 
+0000519731 00000 n 
+0000521123 00000 n 
+0000521182 00000 n 
+0000521241 00000 n 
+0000521300 00000 n 
+0000524485 00000 n 
+0000524715 00000 n 
+0000525105 00000 n 
+0000525334 00000 n 
+0000525528 00000 n 
+0000525758 00000 n 
+0000525952 00000 n 
+0000526342 00000 n 
+0000526572 00000 n 
+0000526766 00000 n 
+0000527156 00000 n 
+0000527385 00000 n 
+0000527775 00000 n 
+0000527970 00000 n 
+0000528200 00000 n 
+0000528590 00000 n 
+0000528785 00000 n 
+0000529175 00000 n 
+0000529405 00000 n 
+0000529795 00000 n 
+0000529988 00000 n 
+0000530378 00000 n 
+0000530607 00000 n 
+0000530995 00000 n 
+0000531805 00000 n 
+0000524053 00000 n 
+0000521551 00000 n 
+0000531160 00000 n 
+0000531334 00000 n 
+0000531393 00000 n 
+0000524910 00000 n 
+0000531452 00000 n 
+0000526147 00000 n 
+0000531511 00000 n 
+0000526961 00000 n 
+0000531570 00000 n 
+0000527580 00000 n 
+0000531629 00000 n 
+0000528395 00000 n 
+0000528980 00000 n 
+0000531687 00000 n 
+0000529600 00000 n 
+0000530183 00000 n 
+0000531746 00000 n 
+0000530801 00000 n 
+0000963978 00000 n 
+0000538176 00000 n 
+0000534680 00000 n 
+0000534887 00000 n 
+0000535082 00000 n 
+0000535472 00000 n 
+0000535679 00000 n 
+0000535874 00000 n 
+0000536264 00000 n 
+0000536471 00000 n 
+0000536666 00000 n 
+0000537054 00000 n 
+0000537259 00000 n 
+0000537451 00000 n 
+0000541556 00000 n 
+0000541762 00000 n 
+0000541955 00000 n 
+0000537837 00000 n 
+0000538587 00000 n 
+0000534392 00000 n 
+0000531984 00000 n 
+0000538000 00000 n 
+0000538058 00000 n 
+0000538117 00000 n 
+0000538235 00000 n 
+0000538410 00000 n 
+0000538469 00000 n 
+0000535277 00000 n 
+0000538528 00000 n 
+0000536069 00000 n 
+0000536859 00000 n 
+0000537644 00000 n 
+0000653556 00000 n 
+0000653674 00000 n 
+0000542344 00000 n 
+0000542550 00000 n 
+0000542743 00000 n 
+0000543132 00000 n 
+0000543338 00000 n 
+0000543532 00000 n 
+0000543921 00000 n 
+0000544127 00000 n 
+0000544321 00000 n 
+0000544710 00000 n 
+0000544917 00000 n 
+0000545112 00000 n 
+0000545501 00000 n 
+0000545708 00000 n 
+0000545903 00000 n 
+0000546293 00000 n 
+0000546499 00000 n 
+0000546693 00000 n 
+0000546888 00000 n 
+0000547094 00000 n 
+0000547288 00000 n 
+0000547677 00000 n 
+0000547883 00000 n 
+0000548077 00000 n 
+0000548466 00000 n 
+0000548671 00000 n 
+0000548865 00000 n 
+0000549254 00000 n 
+0000549460 00000 n 
+0000549654 00000 n 
+0000550041 00000 n 
+0000550248 00000 n 
+0000550443 00000 n 
+0000550833 00000 n 
+0000551292 00000 n 
+0000540989 00000 n 
+0000538779 00000 n 
+0000550998 00000 n 
+0000542149 00000 n 
+0000542937 00000 n 
+0000543726 00000 n 
+0000551056 00000 n 
+0000544515 00000 n 
+0000551115 00000 n 
+0000545307 00000 n 
+0000551174 00000 n 
+0000546098 00000 n 
+0000547482 00000 n 
+0000548271 00000 n 
+0000549059 00000 n 
+0000549847 00000 n 
+0000551233 00000 n 
+0000550638 00000 n 
+0000653792 00000 n 
+0000656997 00000 n 
+0000657115 00000 n 
+0000657238 00000 n 
+0000657356 00000 n 
+0000657474 00000 n 
+0000660438 00000 n 
+0000660556 00000 n 
+0000554618 00000 n 
+0000554825 00000 n 
+0000555020 00000 n 
+0000555410 00000 n 
+0000555617 00000 n 
+0000555812 00000 n 
+0000556007 00000 n 
+0000556212 00000 n 
+0000556405 00000 n 
+0000556793 00000 n 
+0000557000 00000 n 
+0000557195 00000 n 
+0000557390 00000 n 
+0000557596 00000 n 
+0000557790 00000 n 
+0000557997 00000 n 
+0000558192 00000 n 
+0000558387 00000 n 
+0000558594 00000 n 
+0000558789 00000 n 
+0000558984 00000 n 
+0000559191 00000 n 
+0000559386 00000 n 
+0000559776 00000 n 
+0000559983 00000 n 
+0000560178 00000 n 
+0000560567 00000 n 
+0000560774 00000 n 
+0000560969 00000 n 
+0000561359 00000 n 
+0000561566 00000 n 
+0000561761 00000 n 
+0000562151 00000 n 
+0000562358 00000 n 
+0000562553 00000 n 
+0000562942 00000 n 
+0000563147 00000 n 
+0000563338 00000 n 
+0000567810 00000 n 
+0000568017 00000 n 
+0000568212 00000 n 
+0000568418 00000 n 
+0000563724 00000 n 
+0000564476 00000 n 
+0000554060 00000 n 
+0000551458 00000 n 
+0000563887 00000 n 
+0000563945 00000 n 
+0000555215 00000 n 
+0000564004 00000 n 
+0000556598 00000 n 
+0000564063 00000 n 
+0000564122 00000 n 
+0000564181 00000 n 
+0000559581 00000 n 
+0000560372 00000 n 
+0000564240 00000 n 
+0000561164 00000 n 
+0000564299 00000 n 
+0000561956 00000 n 
+0000564358 00000 n 
+0000562748 00000 n 
+0000564417 00000 n 
+0000563531 00000 n 
+0000660677 00000 n 
+0000660795 00000 n 
+0000660912 00000 n 
+0000664747 00000 n 
+0000568612 00000 n 
+0000568819 00000 n 
+0000569013 00000 n 
+0000569220 00000 n 
+0000569414 00000 n 
+0000569621 00000 n 
+0000569815 00000 n 
+0000570021 00000 n 
+0000570216 00000 n 
+0000570422 00000 n 
+0000570616 00000 n 
+0000570809 00000 n 
+0000571016 00000 n 
+0000571211 00000 n 
+0000571601 00000 n 
+0000571808 00000 n 
+0000572003 00000 n 
+0000572393 00000 n 
+0000572600 00000 n 
+0000572795 00000 n 
+0000573185 00000 n 
+0000573380 00000 n 
+0000573575 00000 n 
+0000573768 00000 n 
+0000573975 00000 n 
+0000574169 00000 n 
+0000574364 00000 n 
+0000574559 00000 n 
+0000574754 00000 n 
+0000574959 00000 n 
+0000575153 00000 n 
+0000575540 00000 n 
+0000575733 00000 n 
+0000575927 00000 n 
+0000576120 00000 n 
+0000576326 00000 n 
+0000576521 00000 n 
+0000576909 00000 n 
+0000577102 00000 n 
+0000577296 00000 n 
+0000577503 00000 n 
+0000577697 00000 n 
+0000577891 00000 n 
+0000578098 00000 n 
+0000578293 00000 n 
+0000578682 00000 n 
+0000578889 00000 n 
+0000579084 00000 n 
+0000579474 00000 n 
+0000579681 00000 n 
+0000579876 00000 n 
+0000580071 00000 n 
+0000580278 00000 n 
+0000580473 00000 n 
+0000580678 00000 n 
+0000585091 00000 n 
+0000585298 00000 n 
+0000585492 00000 n 
+0000585698 00000 n 
+0000585891 00000 n 
+0000580871 00000 n 
+0000582033 00000 n 
+0000567072 00000 n 
+0000564656 00000 n 
+0000581036 00000 n 
+0000581094 00000 n 
+0000581153 00000 n 
+0000581212 00000 n 
+0000581271 00000 n 
+0000581330 00000 n 
+0000581389 00000 n 
+0000581448 00000 n 
+0000581507 00000 n 
+0000571406 00000 n 
+0000581565 00000 n 
+0000572198 00000 n 
+0000572990 00000 n 
+0000581624 00000 n 
+0000575346 00000 n 
+0000581682 00000 n 
+0000576715 00000 n 
+0000581741 00000 n 
+0000581800 00000 n 
+0000578488 00000 n 
+0000581859 00000 n 
+0000579279 00000 n 
+0000581918 00000 n 
+0000581977 00000 n 
+0000664869 00000 n 
+0000665051 00000 n 
+0000665231 00000 n 
+0000586086 00000 n 
+0000586293 00000 n 
+0000586488 00000 n 
+0000586683 00000 n 
+0000586890 00000 n 
+0000587085 00000 n 
+0000587280 00000 n 
+0000587487 00000 n 
+0000587682 00000 n 
+0000588072 00000 n 
+0000588279 00000 n 
+0000588474 00000 n 
+0000588864 00000 n 
+0000589071 00000 n 
+0000589266 00000 n 
+0000589654 00000 n 
+0000589861 00000 n 
+0000590056 00000 n 
+0000590251 00000 n 
+0000590458 00000 n 
+0000590653 00000 n 
+0000590848 00000 n 
+0000591055 00000 n 
+0000591250 00000 n 
+0000591640 00000 n 
+0000591847 00000 n 
+0000592042 00000 n 
+0000592432 00000 n 
+0000592639 00000 n 
+0000592834 00000 n 
+0000593028 00000 n 
+0000593235 00000 n 
+0000593430 00000 n 
+0000593625 00000 n 
+0000593832 00000 n 
+0000594027 00000 n 
+0000594222 00000 n 
+0000594429 00000 n 
+0000594624 00000 n 
+0000595013 00000 n 
+0000595220 00000 n 
+0000595415 00000 n 
+0000595609 00000 n 
+0000595816 00000 n 
+0000596011 00000 n 
+0000596218 00000 n 
+0000596413 00000 n 
+0000596606 00000 n 
+0000596812 00000 n 
+0000597007 00000 n 
+0000602181 00000 n 
+0000602388 00000 n 
+0000602582 00000 n 
+0000602777 00000 n 
+0000603167 00000 n 
+0000603362 00000 n 
+0000603569 00000 n 
+0000603764 00000 n 
+0000603959 00000 n 
+0000604349 00000 n 
+0000604544 00000 n 
+0000604750 00000 n 
+0000604944 00000 n 
+0000605138 00000 n 
+0000605527 00000 n 
+0000605722 00000 n 
+0000597201 00000 n 
+0000598366 00000 n 
+0000584398 00000 n 
+0000582199 00000 n 
+0000597364 00000 n 
+0000597422 00000 n 
+0000597481 00000 n 
+0000597540 00000 n 
+0000597599 00000 n 
+0000597658 00000 n 
+0000587877 00000 n 
+0000588669 00000 n 
+0000589461 00000 n 
+0000597717 00000 n 
+0000597776 00000 n 
+0000597835 00000 n 
+0000591445 00000 n 
+0000597894 00000 n 
+0000592237 00000 n 
+0000597953 00000 n 
+0000598012 00000 n 
+0000598071 00000 n 
+0000594819 00000 n 
+0000598130 00000 n 
+0000598189 00000 n 
+0000598248 00000 n 
+0000598307 00000 n 
+0000668348 00000 n 
+0000668470 00000 n 
+0000668587 00000 n 
+0000605917 00000 n 
+0000606122 00000 n 
+0000606316 00000 n 
+0000606509 00000 n 
+0000606704 00000 n 
+0000606899 00000 n 
+0000607094 00000 n 
+0000607301 00000 n 
+0000607496 00000 n 
+0000607691 00000 n 
+0000607885 00000 n 
+0000608080 00000 n 
+0000608468 00000 n 
+0000608675 00000 n 
+0000608870 00000 n 
+0000609065 00000 n 
+0000609259 00000 n 
+0000609454 00000 n 
+0000609844 00000 n 
+0000610051 00000 n 
+0000610246 00000 n 
+0000610635 00000 n 
+0000610829 00000 n 
+0000611023 00000 n 
+0000611230 00000 n 
+0000611423 00000 n 
+0000611812 00000 n 
+0000612007 00000 n 
+0000612202 00000 n 
+0000612408 00000 n 
+0000612602 00000 n 
+0000612796 00000 n 
+0000613002 00000 n 
+0000613197 00000 n 
+0000613586 00000 n 
+0000613793 00000 n 
+0000613988 00000 n 
+0000614378 00000 n 
+0000614585 00000 n 
+0000614780 00000 n 
+0000614974 00000 n 
+0000615181 00000 n 
+0000615375 00000 n 
+0000619744 00000 n 
+0000619951 00000 n 
+0000620144 00000 n 
+0000620339 00000 n 
+0000620546 00000 n 
+0000620741 00000 n 
+0000620935 00000 n 
+0000615765 00000 n 
+0000616283 00000 n 
+0000601416 00000 n 
+0000598532 00000 n 
+0000615930 00000 n 
+0000602972 00000 n 
+0000604154 00000 n 
+0000605332 00000 n 
+0000608275 00000 n 
+0000609649 00000 n 
+0000610441 00000 n 
+0000611617 00000 n 
+0000615988 00000 n 
+0000616047 00000 n 
+0000613392 00000 n 
+0000616106 00000 n 
+0000614183 00000 n 
+0000616165 00000 n 
+0000616224 00000 n 
+0000615570 00000 n 
+0000964103 00000 n 
+0000668705 00000 n 
+0000668887 00000 n 
+0000672375 00000 n 
+0000672550 00000 n 
+0000672726 00000 n 
+0000672903 00000 n 
+0000676854 00000 n 
+0000677031 00000 n 
+0000621324 00000 n 
+0000621531 00000 n 
+0000621726 00000 n 
+0000621921 00000 n 
+0000622115 00000 n 
+0000622322 00000 n 
+0000622517 00000 n 
+0000622724 00000 n 
+0000622919 00000 n 
+0000623122 00000 n 
+0000623312 00000 n 
+0000623519 00000 n 
+0000623713 00000 n 
+0000623920 00000 n 
+0000624115 00000 n 
+0000624322 00000 n 
+0000624517 00000 n 
+0000624906 00000 n 
+0000625113 00000 n 
+0000625308 00000 n 
+0000625698 00000 n 
+0000625905 00000 n 
+0000626099 00000 n 
+0000626487 00000 n 
+0000626693 00000 n 
+0000626888 00000 n 
+0000627278 00000 n 
+0000627484 00000 n 
+0000627678 00000 n 
+0000627872 00000 n 
+0000628078 00000 n 
+0000628272 00000 n 
+0000628661 00000 n 
+0000628867 00000 n 
+0000629061 00000 n 
+0000633951 00000 n 
+0000634158 00000 n 
+0000634353 00000 n 
+0000634548 00000 n 
+0000634755 00000 n 
+0000634950 00000 n 
+0000629255 00000 n 
+0000630066 00000 n 
+0000619168 00000 n 
+0000616506 00000 n 
+0000629418 00000 n 
+0000629476 00000 n 
+0000621130 00000 n 
+0000629535 00000 n 
+0000629594 00000 n 
+0000629653 00000 n 
+0000629712 00000 n 
+0000629771 00000 n 
+0000629830 00000 n 
+0000624711 00000 n 
+0000625503 00000 n 
+0000626294 00000 n 
+0000627083 00000 n 
+0000629889 00000 n 
+0000629948 00000 n 
+0000628466 00000 n 
+0000630007 00000 n 
+0000677207 00000 n 
+0000679924 00000 n 
+0000680045 00000 n 
+0000680166 00000 n 
+0000680283 00000 n 
+0000635145 00000 n 
+0000635352 00000 n 
+0000635546 00000 n 
+0000635741 00000 n 
+0000635948 00000 n 
+0000636143 00000 n 
+0000636338 00000 n 
+0000636544 00000 n 
+0000636739 00000 n 
+0000636934 00000 n 
+0000637324 00000 n 
+0000637519 00000 n 
+0000637908 00000 n 
+0000638102 00000 n 
+0000638308 00000 n 
+0000638501 00000 n 
+0000638889 00000 n 
+0000639096 00000 n 
+0000639291 00000 n 
+0000639681 00000 n 
+0000639887 00000 n 
+0000640082 00000 n 
+0000640277 00000 n 
+0000640483 00000 n 
+0000640677 00000 n 
+0000640871 00000 n 
+0000641078 00000 n 
+0000641273 00000 n 
+0000641663 00000 n 
+0000641858 00000 n 
+0000642065 00000 n 
+0000642259 00000 n 
+0000642648 00000 n 
+0000642842 00000 n 
+0000643049 00000 n 
+0000643243 00000 n 
+0000643632 00000 n 
+0000643826 00000 n 
+0000644033 00000 n 
+0000644228 00000 n 
+0000644618 00000 n 
+0000644813 00000 n 
+0000645019 00000 n 
+0000645213 00000 n 
+0000645408 00000 n 
+0000650084 00000 n 
+0000650291 00000 n 
+0000650486 00000 n 
+0000650876 00000 n 
+0000645603 00000 n 
+0000646533 00000 n 
+0000633276 00000 n 
+0000630247 00000 n 
+0000645768 00000 n 
+0000645826 00000 n 
+0000645885 00000 n 
+0000645944 00000 n 
+0000637129 00000 n 
+0000637714 00000 n 
+0000646003 00000 n 
+0000638695 00000 n 
+0000646062 00000 n 
+0000639486 00000 n 
+0000646121 00000 n 
+0000646180 00000 n 
+0000646238 00000 n 
+0000641468 00000 n 
+0000646297 00000 n 
+0000642454 00000 n 
+0000646356 00000 n 
+0000643438 00000 n 
+0000646415 00000 n 
+0000644423 00000 n 
+0000646474 00000 n 
+0000680406 00000 n 
+0000680524 00000 n 
+0000651071 00000 n 
+0000651278 00000 n 
+0000651473 00000 n 
+0000651861 00000 n 
+0000652054 00000 n 
+0000652261 00000 n 
+0000652456 00000 n 
+0000652845 00000 n 
+0000653040 00000 n 
+0000653855 00000 n 
+0000649805 00000 n 
+0000646743 00000 n 
+0000653203 00000 n 
+0000653261 00000 n 
+0000650681 00000 n 
+0000653320 00000 n 
+0000651668 00000 n 
+0000653379 00000 n 
+0000652650 00000 n 
+0000653438 00000 n 
+0000653497 00000 n 
+0000653615 00000 n 
+0000653733 00000 n 
+0000656715 00000 n 
+0000657597 00000 n 
+0000656571 00000 n 
+0000654091 00000 n 
+0000656880 00000 n 
+0000656938 00000 n 
+0000657056 00000 n 
+0000657179 00000 n 
+0000657297 00000 n 
+0000657415 00000 n 
+0000657538 00000 n 
+0000660217 00000 n 
+0000660970 00000 n 
+0000660073 00000 n 
+0000657763 00000 n 
+0000660380 00000 n 
+0000660497 00000 n 
+0000660619 00000 n 
+0000660736 00000 n 
+0000660853 00000 n 
+0000664465 00000 n 
+0000665293 00000 n 
+0000664321 00000 n 
+0000661136 00000 n 
+0000664630 00000 n 
+0000664688 00000 n 
+0000664811 00000 n 
+0000664933 00000 n 
+0000664992 00000 n 
+0000665113 00000 n 
+0000665172 00000 n 
+0000964228 00000 n 
+0000668068 00000 n 
+0000669005 00000 n 
+0000667924 00000 n 
+0000665472 00000 n 
+0000668231 00000 n 
+0000668289 00000 n 
+0000668411 00000 n 
+0000668529 00000 n 
+0000668646 00000 n 
+0000668769 00000 n 
+0000668828 00000 n 
+0000668946 00000 n 
+0000672093 00000 n 
+0000673019 00000 n 
+0000671949 00000 n 
+0000669171 00000 n 
+0000672258 00000 n 
+0000672316 00000 n 
+0000672434 00000 n 
+0000959771 00000 n 
+0000960349 00000 n 
+0000672491 00000 n 
+0000672608 00000 n 
+0000672667 00000 n 
+0000672785 00000 n 
+0000672844 00000 n 
+0000672961 00000 n 
+0000676574 00000 n 
+0000677325 00000 n 
+0000676430 00000 n 
+0000673250 00000 n 
+0000676737 00000 n 
+0000676795 00000 n 
+0000676913 00000 n 
+0000676972 00000 n 
+0000677090 00000 n 
+0000677148 00000 n 
+0000677266 00000 n 
+0000679701 00000 n 
+0000680582 00000 n 
+0000679557 00000 n 
+0000677543 00000 n 
+0000679866 00000 n 
+0000679987 00000 n 
+0000680108 00000 n 
+0000680225 00000 n 
+0000680347 00000 n 
+0000680465 00000 n 
+0000683580 00000 n 
+0000683918 00000 n 
+0000683436 00000 n 
+0000680761 00000 n 
+0000683743 00000 n 
+0000683801 00000 n 
+0000686266 00000 n 
+0000686416 00000 n 
+0000686566 00000 n 
+0000686716 00000 n 
+0000686866 00000 n 
+0000687017 00000 n 
+0000687168 00000 n 
+0000687319 00000 n 
+0000687470 00000 n 
+0000687619 00000 n 
+0000687769 00000 n 
+0000687920 00000 n 
+0000688071 00000 n 
+0000688221 00000 n 
+0000688371 00000 n 
+0000688521 00000 n 
+0000688672 00000 n 
+0000688823 00000 n 
+0000688973 00000 n 
+0000689123 00000 n 
+0000689273 00000 n 
+0000689423 00000 n 
+0000689574 00000 n 
+0000689724 00000 n 
+0000689875 00000 n 
+0000690026 00000 n 
+0000690177 00000 n 
+0000690328 00000 n 
+0000690477 00000 n 
+0000690627 00000 n 
+0000690778 00000 n 
+0000690928 00000 n 
+0000691078 00000 n 
+0000691229 00000 n 
+0000691380 00000 n 
+0000691531 00000 n 
+0000691680 00000 n 
+0000691831 00000 n 
+0000691982 00000 n 
+0000692133 00000 n 
+0000692283 00000 n 
+0000692432 00000 n 
+0000692581 00000 n 
+0000692731 00000 n 
+0000692882 00000 n 
+0000693033 00000 n 
+0000693183 00000 n 
+0000693334 00000 n 
+0000693484 00000 n 
+0000693635 00000 n 
+0000693785 00000 n 
+0000693936 00000 n 
+0000694087 00000 n 
+0000694238 00000 n 
+0000694387 00000 n 
+0000694536 00000 n 
+0000694685 00000 n 
+0000694834 00000 n 
+0000694982 00000 n 
+0000695131 00000 n 
+0000695278 00000 n 
+0000695427 00000 n 
+0000695576 00000 n 
+0000695725 00000 n 
+0000695876 00000 n 
+0000696027 00000 n 
+0000696177 00000 n 
+0000696328 00000 n 
+0000696479 00000 n 
+0000696628 00000 n 
+0000696779 00000 n 
+0000696928 00000 n 
+0000697210 00000 n 
+0000685483 00000 n 
+0000684097 00000 n 
+0000697093 00000 n 
+0000697151 00000 n 
+0000964353 00000 n 
+0000699479 00000 n 
+0000699630 00000 n 
+0000699781 00000 n 
+0000699932 00000 n 
+0000700083 00000 n 
+0000700234 00000 n 
+0000700384 00000 n 
+0000700534 00000 n 
+0000700684 00000 n 
+0000700835 00000 n 
+0000700986 00000 n 
+0000701137 00000 n 
+0000701288 00000 n 
+0000701439 00000 n 
+0000701590 00000 n 
+0000701741 00000 n 
+0000701891 00000 n 
+0000702042 00000 n 
+0000702192 00000 n 
+0000702343 00000 n 
+0000702493 00000 n 
+0000702644 00000 n 
+0000702794 00000 n 
+0000702945 00000 n 
+0000703096 00000 n 
+0000703245 00000 n 
+0000703395 00000 n 
+0000703545 00000 n 
+0000703695 00000 n 
+0000703845 00000 n 
+0000703996 00000 n 
+0000704147 00000 n 
+0000704298 00000 n 
+0000704449 00000 n 
+0000704598 00000 n 
+0000704747 00000 n 
+0000704898 00000 n 
+0000705048 00000 n 
+0000705199 00000 n 
+0000705350 00000 n 
+0000705500 00000 n 
+0000705651 00000 n 
+0000705801 00000 n 
+0000705952 00000 n 
+0000706102 00000 n 
+0000706253 00000 n 
+0000706404 00000 n 
+0000706555 00000 n 
+0000706706 00000 n 
+0000706857 00000 n 
+0000707008 00000 n 
+0000707159 00000 n 
+0000707310 00000 n 
+0000707461 00000 n 
+0000707612 00000 n 
+0000707763 00000 n 
+0000707914 00000 n 
+0000708065 00000 n 
+0000708216 00000 n 
+0000708367 00000 n 
+0000708518 00000 n 
+0000708669 00000 n 
+0000708820 00000 n 
+0000708971 00000 n 
+0000709122 00000 n 
+0000709272 00000 n 
+0000709421 00000 n 
+0000711695 00000 n 
+0000709569 00000 n 
+0000709790 00000 n 
+0000698732 00000 n 
+0000697337 00000 n 
+0000709732 00000 n 
+0000711846 00000 n 
+0000711996 00000 n 
+0000712145 00000 n 
+0000712294 00000 n 
+0000712444 00000 n 
+0000712595 00000 n 
+0000712746 00000 n 
+0000712895 00000 n 
+0000713046 00000 n 
+0000713196 00000 n 
+0000713347 00000 n 
+0000713496 00000 n 
+0000713647 00000 n 
+0000713797 00000 n 
+0000713948 00000 n 
+0000714099 00000 n 
+0000714250 00000 n 
+0000714401 00000 n 
+0000714552 00000 n 
+0000714703 00000 n 
+0000714854 00000 n 
+0000715005 00000 n 
+0000715156 00000 n 
+0000715306 00000 n 
+0000715456 00000 n 
+0000715605 00000 n 
+0000715755 00000 n 
+0000715906 00000 n 
+0000716057 00000 n 
+0000716208 00000 n 
+0000716359 00000 n 
+0000716510 00000 n 
+0000716660 00000 n 
+0000716809 00000 n 
+0000716960 00000 n 
+0000717111 00000 n 
+0000717262 00000 n 
+0000717413 00000 n 
+0000717564 00000 n 
+0000717714 00000 n 
+0000717864 00000 n 
+0000718015 00000 n 
+0000718165 00000 n 
+0000718314 00000 n 
+0000718465 00000 n 
+0000718616 00000 n 
+0000718767 00000 n 
+0000718918 00000 n 
+0000719141 00000 n 
+0000711119 00000 n 
+0000709917 00000 n 
+0000719083 00000 n 
+0000719268 00000 n 
+0000719294 00000 n 
+0000719422 00000 n 
+0000719861 00000 n 
+0000719893 00000 n 
+0000720523 00000 n 
+0000720979 00000 n 
+0000721029 00000 n 
+0000721430 00000 n 
+0000958525 00000 n 
+0000721856 00000 n 
+0000722168 00000 n 
+0000722490 00000 n 
+0000722966 00000 n 
+0000723322 00000 n 
+0000723798 00000 n 
+0000724360 00000 n 
+0000724740 00000 n 
+0000725218 00000 n 
+0000725861 00000 n 
+0000726559 00000 n 
+0000726603 00000 n 
+0000726740 00000 n 
+0000727093 00000 n 
+0000735289 00000 n 
+0000735559 00000 n 
+0000742913 00000 n 
+0000743137 00000 n 
+0000751707 00000 n 
+0000751978 00000 n 
+0000762276 00000 n 
+0000762522 00000 n 
+0000770231 00000 n 
+0000770464 00000 n 
+0000778009 00000 n 
+0000778237 00000 n 
+0000788911 00000 n 
+0000789200 00000 n 
+0000796853 00000 n 
+0000797126 00000 n 
+0000805376 00000 n 
+0000805650 00000 n 
+0000812646 00000 n 
+0000812873 00000 n 
+0000820784 00000 n 
+0000821040 00000 n 
+0000828820 00000 n 
+0000829082 00000 n 
+0000832656 00000 n 
+0000832877 00000 n 
+0000850831 00000 n 
+0000851370 00000 n 
+0000860504 00000 n 
+0000860836 00000 n 
+0000873927 00000 n 
+0000874385 00000 n 
+0000882738 00000 n 
+0000883057 00000 n 
+0000890558 00000 n 
+0000890929 00000 n 
+0000907979 00000 n 
+0000908429 00000 n 
+0000919562 00000 n 
+0000919895 00000 n 
+0000940855 00000 n 
+0000941483 00000 n 
+0000958028 00000 n 
+0000964451 00000 n 
+0000964571 00000 n 
+0000964696 00000 n 
+0000964804 00000 n 
+0000964886 00000 n 
+0000968634 00000 n 
+0000968822 00000 n 
+0000969345 00000 n 
+0000969868 00000 n 
+0000970391 00000 n 
+0000970914 00000 n 
+0000971437 00000 n 
+0000971960 00000 n 
+0000972483 00000 n 
+0000973006 00000 n 
+0000973529 00000 n 
+0000974052 00000 n 
+0000974575 00000 n 
+0000975098 00000 n 
+0000975723 00000 n 
+0000976518 00000 n 
+0000977313 00000 n 
+0000978108 00000 n 
+0000978746 00000 n 
+0000979509 00000 n 
+0000980132 00000 n 
+0000980571 00000 n 
+0000980938 00000 n 
+0000981445 00000 n 
+0000981864 00000 n 
+0000982719 00000 n 
+0000983476 00000 n 
+0000984189 00000 n 
+0000984753 00000 n 
+0000985386 00000 n 
+0000986080 00000 n 
+0000986802 00000 n 
+0000987491 00000 n 
+0000988180 00000 n 
+0000988869 00000 n 
+0000989425 00000 n 
+0000990050 00000 n 
+0000990656 00000 n 
+0000991481 00000 n 
+0000992169 00000 n 
+0000992858 00000 n 
+0000993547 00000 n 
+0000994169 00000 n 
+0000994794 00000 n 
+0000995419 00000 n 
+0000996129 00000 n 
+0000996860 00000 n 
+0000997541 00000 n 
+0000998222 00000 n 
+0000998844 00000 n 
+0000999461 00000 n 
+0001000078 00000 n 
+0001000784 00000 n 
+0001001546 00000 n 
+0001002275 00000 n 
+0001003004 00000 n 
+0001003648 00000 n 
+0001004313 00000 n 
+0001004978 00000 n 
+0001005620 00000 n 
+0001006309 00000 n 
+0001006998 00000 n 
+0001007687 00000 n 
+0001008295 00000 n 
+0001008936 00000 n 
+0001009577 00000 n 
+0001010218 00000 n 
+0001010859 00000 n 
+0001011500 00000 n 
+0001012141 00000 n 
+0001012782 00000 n 
+0001013423 00000 n 
+0001014057 00000 n 
+0001014698 00000 n 
+0001015339 00000 n 
+0001015980 00000 n 
+0001016621 00000 n 
+0001017262 00000 n 
+0001017903 00000 n 
+0001018544 00000 n 
+0001019190 00000 n 
+0001019855 00000 n 
+0001020590 00000 n 
+0001021535 00000 n 
+0001022410 00000 n 
+0001023299 00000 n 
+0001024039 00000 n 
+0001024721 00000 n 
+0001025346 00000 n 
+0001025971 00000 n 
+0001026596 00000 n 
+0001027221 00000 n 
+0001027846 00000 n 
+0001028471 00000 n 
+0001029096 00000 n 
+0001029721 00000 n 
+0001030346 00000 n 
+0001030971 00000 n 
+0001031596 00000 n 
+0001032221 00000 n 
+0001032846 00000 n 
+0001033471 00000 n 
+0001034096 00000 n 
+0001034721 00000 n 
+0001035346 00000 n 
+0001035971 00000 n 
+0001036311 00000 n 
+0001036482 00000 n 
+0001036652 00000 n 
+0001036823 00000 n 
+0001036992 00000 n 
+0001037165 00000 n 
+0001037342 00000 n 
+0001037517 00000 n 
+0001037694 00000 n 
+0001037869 00000 n 
+0001038046 00000 n 
+0001038221 00000 n 
+0001038398 00000 n 
+0001038573 00000 n 
+0001038745 00000 n 
+0001038976 00000 n 
+0001039227 00000 n 
+0001039478 00000 n 
+0001039738 00000 n 
+0001040003 00000 n 
+0001040274 00000 n 
+0001040545 00000 n 
+0001040818 00000 n 
+0001041090 00000 n 
+0001041361 00000 n 
+0001041609 00000 n 
+0001041812 00000 n 
+0001042014 00000 n 
+0001042217 00000 n 
+0001042419 00000 n 
+0001042626 00000 n 
+0001042833 00000 n 
+0001043042 00000 n 
+0001043249 00000 n 
+0001043455 00000 n 
+0001043641 00000 n 
+0001043837 00000 n 
+0001044058 00000 n 
+0001044289 00000 n 
+0001044521 00000 n 
+0001044756 00000 n 
+0001044977 00000 n 
+0001045233 00000 n 
+0001045500 00000 n 
+0001045772 00000 n 
+0001046053 00000 n 
+0001046333 00000 n 
+0001046614 00000 n 
+0001046892 00000 n 
+0001047140 00000 n 
+0001047325 00000 n 
+0001047503 00000 n 
+0001047661 00000 n 
+0001047823 00000 n 
+0001048027 00000 n 
+0001048261 00000 n 
+0001048449 00000 n 
+0001048706 00000 n 
+0001048959 00000 n 
+0001049187 00000 n 
+0001049422 00000 n 
+0001049670 00000 n 
+0001049919 00000 n 
+0001050157 00000 n 
+0001050389 00000 n 
+0001050621 00000 n 
+0001050884 00000 n 
+0001051145 00000 n 
+0001051373 00000 n 
+0001051601 00000 n 
+0001051773 00000 n 
+0001051889 00000 n 
+0001052004 00000 n 
+0001052132 00000 n 
+0001052264 00000 n 
+0001052388 00000 n 
+0001052516 00000 n 
+0001052653 00000 n 
+0001052783 00000 n 
+0001052864 00000 n 
+0001053038 00000 n 
+0001053268 00000 n 
+0001053442 00000 n 
+0001053566 00000 n 
+0001053663 00000 n 
+0001053772 00000 n 
+0001053812 00000 n 
+0001053993 00000 n 
+trailer
+<< /Size 3690
+/Root 3688 0 R
+/Info 3689 0 R
+/ID [<48E3645D20355A433CCFABD7147957F1> <48E3645D20355A433CCFABD7147957F1>] >>
+startxref
+1054320
+%%EOF
diff --git a/doc/ppl-user-c-interface-1.1pre8.ps.gz b/doc/ppl-user-c-interface-1.1pre8.ps.gz
new file mode 100644
index 0000000..f07845a
Binary files /dev/null and b/doc/ppl-user-c-interface-1.1pre8.ps.gz differ
diff --git a/doc/ppl-user-java-interface-1.0-html.tar.gz b/doc/ppl-user-java-interface-1.0-html.tar.gz
deleted file mode 100644
index 3b91dec..0000000
Binary files a/doc/ppl-user-java-interface-1.0-html.tar.gz and /dev/null differ
diff --git a/doc/ppl-user-java-interface-1.0.pdf b/doc/ppl-user-java-interface-1.0.pdf
deleted file mode 100644
index 206d2c7..0000000
--- a/doc/ppl-user-java-interface-1.0.pdf
+++ /dev/null
@@ -1,26019 +0,0 @@
-%PDF-1.4
-%����
-1 0 obj
-<< /S /GoTo /D (section.1) >>
-endobj
-4 0 obj
-(\376\377\000M\000a\000i\000n\000\040\000P\000a\000g\000e)
-endobj
-5 0 obj
-<< /S /GoTo /D (section.2) >>
-endobj
-8 0 obj
-(\376\377\000G\000N\000U\000\040\000G\000e\000n\000e\000r\000a\000l\000\040\000P\000u\000b\000l\000i\000c\000\040\000L\000i\000c\000e\000n\000s\000e)
-endobj
-9 0 obj
-<< /S /GoTo /D (section.3) >>
-endobj
-12 0 obj
-(\376\377\000G\000N\000U\000\040\000F\000r\000e\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000L\000i\000c\000e\000n\000s\000e)
-endobj
-13 0 obj
-<< /S /GoTo /D (section.4) >>
-endobj
-16 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000\040\000I\000n\000d\000e\000x)
-endobj
-17 0 obj
-<< /S /GoTo /D (subsection.4.1) >>
-endobj
-20 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000s)
-endobj
-21 0 obj
-<< /S /GoTo /D (section.5) >>
-endobj
-24 0 obj
-(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000I\000n\000d\000e\000x)
-endobj
-25 0 obj
-<< /S /GoTo /D (subsection.5.1) >>
-endobj
-28 0 obj
-(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000L\000i\000s\000t)
-endobj
-29 0 obj
-<< /S /GoTo /D (section.6) >>
-endobj
-32 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
-endobj
-33 0 obj
-<< /S /GoTo /D (subsection.6.1) >>
-endobj
-36 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000H\000i\000e\000r\000a\000r\000c\000h\000y)
-endobj
-37 0 obj
-<< /S /GoTo /D (section.7) >>
-endobj
-40 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
-endobj
-41 0 obj
-<< /S /GoTo /D (subsection.7.1) >>
-endobj
-44 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000L\000i\000s\000t)
-endobj
-45 0 obj
-<< /S /GoTo /D (section.8) >>
-endobj
-48 0 obj
-(\376\377\000M\000o\000d\000u\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-49 0 obj
-<< /S /GoTo /D (subsection.8.1) >>
-endobj
-52 0 obj
-(\376\377\000J\000a\000v\000a\000\040\000L\000a\000n\000g\000u\000a\000g\000e\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e)
-endobj
-53 0 obj
-<< /S /GoTo /D (section.9) >>
-endobj
-56 0 obj
-(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-57 0 obj
-<< /S /GoTo /D (subsection.9.1) >>
-endobj
-60 0 obj
-(\376\377\000P\000a\000c\000k\000a\000g\000e\000\040\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y)
-endobj
-61 0 obj
-<< /S /GoTo /D (section.10) >>
-endobj
-64 0 obj
-(\376\377\000C\000l\000a\000s\000s\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
-endobj
-65 0 obj
-<< /S /GoTo /D (subsection.10.1) >>
-endobj
-68 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-69 0 obj
-<< /S /GoTo /D (subsection.10.2) >>
-endobj
-72 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000S\000e\000q\000u\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-73 0 obj
-<< /S /GoTo /D (subsection.10.3) >>
-endobj
-76 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000o\000u\000n\000d\000e\000d\000\137\000I\000n\000t\000e\000g\000e\000r\000\137\000T\000y\000p\000e\000\137\000O\000v\000e\000r\000f\000l\000o\000w\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-77 0 obj
-<< /S /GoTo /D (subsection.10.4) >>
-endobj
-80 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000o\000u\000n\000d\000e\000d\000\137\000I\000n\000t\000e\000g\000e\000r\000\137\000T\000y\000p\000e\000\137\000R\000e\000p\000r\000e\000s\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-81 0 obj
-<< /S /GoTo /D (subsection.10.5) >>
-endobj
-84 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000o\000u\000n\000d\000e\000d\000\137\000I\000n\000t\000e\000g\000e\000r\000\137\000T\000y\000p\000e\000\137\000W\000i\000d\000t\000h\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-85 0 obj
-<< /S /GoTo /D (subsection.10.6) >>
-endobj
-88 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000y\000\137\000R\000e\000f\000e\000r\000e\000n\000c\000e\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-89 0 obj
-<< /S /GoTo /D (subsection.10.7) >>
-endobj
-92 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-93 0 obj
-<< /S /GoTo /D (subsection.10.8) >>
-endobj
-96 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000e\000f\000f\000i\000c\000i\000e\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-97 0 obj
-<< /S /GoTo /D (subsection.10.9) >>
-endobj
-100 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000m\000p\000l\000e\000x\000i\000t\000y\000\137\000C\000l\000a\000s\000s\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-101 0 obj
-<< /S /GoTo /D (subsection.10.10) >>
-endobj
-104 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-105 0 obj
-<< /S /GoTo /D (subsection.10.11) >>
-endobj
-108 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-109 0 obj
-<< /S /GoTo /D (subsection.10.12) >>
-endobj
-112 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-113 0 obj
-<< /S /GoTo /D (subsection.10.13) >>
-endobj
-116 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-117 0 obj
-<< /S /GoTo /D (subsection.10.14) >>
-endobj
-120 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000N\000a\000m\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-121 0 obj
-<< /S /GoTo /D (subsection.10.15) >>
-endobj
-124 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000V\000a\000l\000u\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-125 0 obj
-<< /S /GoTo /D (subsection.10.16) >>
-endobj
-128 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000D\000e\000g\000e\000n\000e\000r\000a\000t\000e\000\137\000E\000l\000e\000m\000e\000n\000t\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-129 0 obj
-<< /S /GoTo /D (subsection.10.17) >>
-endobj
-132 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000D\000o\000m\000a\000i\000n\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-133 0 obj
-<< /S /GoTo /D (subsection.10.18) >>
-endobj
-136 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-137 0 obj
-<< /S /GoTo /D (subsection.10.19) >>
-endobj
-140 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-141 0 obj
-<< /S /GoTo /D (subsection.10.20) >>
-endobj
-144 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000T\000y\000p\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-145 0 obj
-<< /S /GoTo /D (subsection.10.21) >>
-endobj
-148 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-149 0 obj
-<< /S /GoTo /D (subsection.10.22) >>
-endobj
-152 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-153 0 obj
-<< /S /GoTo /D (subsection.10.23) >>
-endobj
-156 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000T\000y\000p\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-157 0 obj
-<< /S /GoTo /D (subsection.10.24) >>
-endobj
-160 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000I\000n\000v\000a\000l\000i\000d\000\137\000A\000r\000g\000u\000m\000e\000n\000t\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-161 0 obj
-<< /S /GoTo /D (subsection.10.25) >>
-endobj
-164 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000I\000O\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-165 0 obj
-<< /S /GoTo /D (subsection.10.26) >>
-endobj
-168 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000e\000n\000g\000t\000h\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-169 0 obj
-<< /S /GoTo /D (subsection.10.27) >>
-endobj
-172 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-173 0 obj
-<< /S /GoTo /D (subsection.10.28) >>
-endobj
-176 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000C\000o\000e\000f\000f\000i\000c\000i\000e\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-177 0 obj
-<< /S /GoTo /D (subsection.10.29) >>
-endobj
-180 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000D\000i\000f\000f\000e\000r\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-181 0 obj
-<< /S /GoTo /D (subsection.10.30) >>
-endobj
-184 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000S\000u\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-185 0 obj
-<< /S /GoTo /D (subsection.10.31) >>
-endobj
-188 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000T\000i\000m\000e\000s\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-189 0 obj
-<< /S /GoTo /D (subsection.10.32) >>
-endobj
-192 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000U\000n\000a\000r\000y\000\137\000M\000i\000n\000u\000s\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-193 0 obj
-<< /S /GoTo /D (subsection.10.33) >>
-endobj
-196 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-197 0 obj
-<< /S /GoTo /D (subsection.10.34) >>
-endobj
-200 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000o\000g\000i\000c\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-201 0 obj
-<< /S /GoTo /D (subsection.10.35) >>
-endobj
-204 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-205 0 obj
-<< /S /GoTo /D (subsection.10.36) >>
-endobj
-208 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000S\000t\000a\000t\000u\000s\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-209 0 obj
-<< /S /GoTo /D (subsection.10.37) >>
-endobj
-212 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000O\000p\000t\000i\000m\000i\000z\000a\000t\000i\000o\000n\000\137\000M\000o\000d\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-213 0 obj
-<< /S /GoTo /D (subsection.10.38) >>
-endobj
-216 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000O\000v\000e\000r\000f\000l\000o\000w\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-217 0 obj
-<< /S /GoTo /D (subsection.10.39) >>
-endobj
-220 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000a\000i\000r\000<\000\040\000K\000,\000\040\000V\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-221 0 obj
-<< /S /GoTo /D (subsection.10.40) >>
-endobj
-224 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-225 0 obj
-<< /S /GoTo /D (subsection.10.41) >>
-endobj
-228 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000a\000r\000t\000i\000a\000l\000\137\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-229 0 obj
-<< /S /GoTo /D (subsection.10.42) >>
-endobj
-232 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000D\000e\000c\000i\000s\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-233 0 obj
-<< /S /GoTo /D (subsection.10.43) >>
-endobj
-236 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-237 0 obj
-<< /S /GoTo /D (subsection.10.44) >>
-endobj
-240 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000N\000a\000m\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-241 0 obj
-<< /S /GoTo /D (subsection.10.45) >>
-endobj
-244 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000V\000a\000l\000u\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-245 0 obj
-<< /S /GoTo /D (subsection.10.46) >>
-endobj
-248 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000S\000t\000a\000t\000u\000s\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-249 0 obj
-<< /S /GoTo /D (subsection.10.47) >>
-endobj
-252 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-253 0 obj
-<< /S /GoTo /D (subsection.10.48) >>
-endobj
-256 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-257 0 obj
-<< /S /GoTo /D (subsection.10.49) >>
-endobj
-260 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-261 0 obj
-<< /S /GoTo /D (subsection.10.50) >>
-endobj
-264 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000I\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-265 0 obj
-<< /S /GoTo /D (subsection.10.51) >>
-endobj
-268 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000l\000y\000\137\000C\000o\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-269 0 obj
-<< /S /GoTo /D (subsection.10.52) >>
-endobj
-272 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000l\000y\000\137\000G\000e\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-273 0 obj
-<< /S /GoTo /D (subsection.10.53) >>
-endobj
-276 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-277 0 obj
-<< /S /GoTo /D (subsection.10.54) >>
-endobj
-280 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000R\000e\000l\000a\000t\000i\000o\000n\000\137\000S\000y\000m\000b\000o\000l\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-281 0 obj
-<< /S /GoTo /D (subsection.10.55) >>
-endobj
-284 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000T\000i\000m\000e\000o\000u\000t\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-285 0 obj
-<< /S /GoTo /D (subsection.10.56) >>
-endobj
-288 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-289 0 obj
-<< /S /GoTo /D (subsection.10.57) >>
-endobj
-292 0 obj
-(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000V\000a\000r\000i\000a\000b\000l\000e\000s\000\137\000S\000e\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
-endobj
-293 0 obj
-<< /S /GoTo /D [294 0 R  /Fit ] >>
-endobj
-297 0 obj <<
-/Length 1270      
-/Filter /FlateDecode
->>
-stream
-x��WIs�6��W��)5c�X.�%�kO�q-���9 at 4D�墂P
9��$*�۴��gD���}�[I�
pp}���I�$��!L� f
�Es��F
�ilU�k{���'7
	.����o{m�F�g���+�$E��8�-�刃��Qƃ�S�>�-�$�i�Ob

-
6b+�8���R>�	�c'~[���7��[��0I�
A9ɜ��	5�����n���\���޴Z���BZK,Gq|h豗�{C�w��Dk�Emn�\���9��Q��<�A�h�
��1s��1���`p"	�jslK�W]�0	� '{+@`��O�3���%�b�;w�L���a�6b��cr��$�c��f
)�J`A����t�� GxX���
rϟ��
AL�3:D|ELs����
�W�p�ke]�9������O�%(�����Y�m!Ĉ�|���q$�2H��$���n}M���/0��Ʈ�/g����'e(f���p��[��y<[�& I�H�º�ж�3cp �&�^1�o�	0�_Vl�N�w$�jEa��LW�<|6���n�^<�Ҕ0�•P��8i�^�:��W�� �<��T��	q寽~�p�{s T#�y�!�n�z�E%[]yZ8����Xz��]�
�6���'�O�w���!��~��ۉ��<]��ʑ6c@/#;3"��a����v�l���

�? �yx��0����=Fb�5�px�֝��t�UW*�8�s��_�`f�јo����J8s̍����j���C|���3��O�<�}�ͥ�J}
N7��M��ۀ� [...]
-�ļ�0�n�a��|3�ȿLg2�͠MP����1C9���4��W�xS�h�V+e�$����f7�����c;����cxpc7�����&	��'�g&֏���w�NЫz�����w��
^	��J�%|f����h�˶DE�
�w��c�5�S
���+�%�?L |������#�{�A�
ʺC����)x����
!O�
-endstream
-endobj
-294 0 obj <<
-/Type /Page
-/Contents 297 0 R
-/Resources 296 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
->> endobj
-295 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/ppl_logo.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 306 0 R
-/BBox [0 0 640 829]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 307 0 R
->>>>
-/Length 2688
-/Filter /FlateDecode
->>
-stream
-x�m�K�#�
D�ZEm�4	�
{�(�#�sD��'�*�>��j�V��L��ǑS9���������9����qӸל�i�Қǟ�>�u��V���)�2k�%[�׍�jk
e���<F��bȣ��u��5�ID���q�^��%�R��ˬ���|�T�4��yԮ������hYϔc�ԭ��V�»�>�������������J�k�>�si���3�4���Hݏ��{�l��V����^.&ϩ�<&;�����u��I
@����Z�KD�P���\�i����s|��R4�h}�9��艥����b\K��؆��j�ik�L���=�̸�"ؼZI��(	���%s6W���+�y�1�H')�ql�
��g���y�Qs�_7������/�;ji�y�'x���k%_�J>8{w@�wv�NQȁ�l�=("JY�s����Iy
ǹ�k�S���+���}hk�>"���Rd�'n$�4��
�įGh
�Y�ϲ����Ȭbeh&f������3(0Ϝw�9��Б ��‘�^@�A}� �T�4D�߶V�?5�$��[e��!�f�b[�l��E�4����Y4�9p��	���n<���
��9;�D4%�q�+^�kK��%��9�5��|?ĝS�Ī��@.�"�A���T�5&�%^�n59:�/H��(%�~����a	Z=�d�I��fJ+�^+�︌�B2X����#ѥ�S�����0V[-NS� �(b&�C��*�s�

��*d�K
��5ɫ�6�؄KC�hz�4��)�
�y� DF^Akz�\3W��m9�`����@�l:�MYe��B�:x6+b� h�6$sܨ��W�Z�^,����Ddx&hI���
��$�a"q���
�:��RSH�2<Z<�H�r{v%��.W次�8��?�BJ6
b�H4
,Fߎ� �Ԛ�������2��B�Z�	�.Ŋ�>@��񸵊��d�J�
�S����Q��ufG�.-�+���]��ҢxR�ِNV1�0	K��r�ہ�
��.�Q�<��͙N��*7b�_<��6���G"Cd�t�6 D�x�RkT����`; F'���́�����Gy����.C��EK�+��
(�eC�K8T�2�Q)� [...]
���B[�}��T�<��W��Z�.q[C�T"WCNҵ�e;WCk��KC�CV �E���*!��h�n�o�v������"?�1˪���롋q� vZ��K�	��.����_�6=:�+Ң�y�����
���K�4zx��
�L�ť���IoOCE
;Q6M�`]�����TD��s��E��a�,|ʙd9�Iङ��CK-���{|�׎�Aг�=GD�~W�#�J�6l=��W#,�8�$���9G�=UT�����o	���2+�S�2��Q{��u���QnU=�Qc����0Wv�b�0�����J
�QK
Ց7�4<�U��
�Sz
�j}��RdJ-��U"�
Yl���U-��q"N)����I�+�F�ۜ+����Ӽ
��M�תoÂ���l6����Q�j�q�'���}BR�
PKǧ��ѓ�%2V����,^��
j�b�K����L�N͙
�q����MW��.�P��W$������
-D���5G�\����84I���$�h<u�k�L59�0%Q��)�FX�C��ӻ�
�����
���a:׊]G'�u
��Z��B�^LE��e����Z7D�C���c�I��
U��]��iQ8s�2��*'��X�"���h6b�B��k���L2(:����I�1�s�˹�����{�uo:�k�%�.�k[��x�R�����u�
�<�����-�o�ͻ�m���

�	x���}�H�e�.��XD
�8r�D��\�%#
����k�6
%o؁zW>
 ><�ϸ�x�G���/�#�"pb:�h]�F��7��>��KHݗT��r�kwت �ӠD���Ւy��K���կ���,�G��C�Ss|��<g��uo?�������K@�
��	4�ͺ'��)�$&O:3
��.��[�G�¸���E�;{
��*����Kw�-K���T@�O���+LH�㛃��ӊwĪfgh*�� Mj�TV���F1�k
I
�?5ڮ����åےT�ѻP.d�wѩ/��"\G�
���
��G"�
�u��+��t�bg��[����pS�jeg)s_�螢bM��R
-εQo��
}� ���������@1n�M͢
���6"�-lW�Z7U���
;���mD+�|G�F��Z��@
����Q�5����(g�`R���X�6T�����.��|��6���ч��
�?��3
o���3��� m�B ��MY:c�q�P}E'�-2���
-@!S#����s����I���U$ZJZ$��\!X��P8���+�x^�|�f�:��d|?@__��h���^�a9��n]چ�*5s|Y��E���v_�#^��[�/�s͢O��
�?v�s`\�ؿ��^X{��~Ej�aW�K/Tz�
����Z���\��j�
|��>�?��a��x(~?�B�
<q����
T��5F#��
�s�B�
-����[���N��o�ِW]r�a'tܯ�_�|�"�8w�VۥDD�#��n���f���?�
�
-endstream
-endobj
-306 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100336+01'00')
-/ModDate (D:20111106100336+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-307 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-298 0 obj <<
-/D [294 0 R /XYZ 89 770.89 null]
->> endobj
-299 0 obj <<
-/D [294 0 R /XYZ 90 721.073 null]
->> endobj
-296 0 obj <<
-/Font << /F58 300 0 R /F24 301 0 R /F41 302 0 R /F42 303 0 R /F60 304 0 R >>
-/XObject << /Im1 295 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-310 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-309 0 obj <<
-/Type /Page
-/Contents 310 0 R
-/Resources 308 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
->> endobj
-311 0 obj <<
-/D [309 0 R /XYZ 89 770.89 null]
->> endobj
-308 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-322 0 obj <<
-/Length 1558      
-/Filter /FlateDecode
->>
-stream
-xڝWK��6
��W�Vif-���J/�n�������L��,Ӷ&��Hr���
�-{���'� � >>�����й�wz��b7Eh��V��.�����ZY�m��:��;�;
�1�[1����V��|�ʬ��[������v�/<sk�����.öK4Ź�99�+�g�s�m�������%�_��8�r)����m�)�*ѫX����-��C��+'l7k@�qOQ\�A�S�9Ӿ�v�ʋ����u��|o�f���[:�هM-�����3ב
-�\ϷYMkWez��B�_�:�����f+��8<��j�7;)��\����e�Tϧ`&�1zv�\�]Od���:+
��A���*)��	�1��Lu��0�o����UV7��g#I-)V��"zW���3���X?m��������@\Z�\�ɸ�� �}%�R���F�K@��Y*�Z��,��t8綬꣜��D82���L�<i��������a�g�s�ӥ^��"r0��o��~�X���
-_Q�r�<aj�Js��M	��=�%Bl�WT��OY����!я�Q��
"�-Y��
-�3�����G���,��]���.Q�s'b�D�?N���6���Ԥc��&鷗6����v��u
���U�V���@�T9�(��X��a9������KM��	�E��T-D��tr�<�FqS�f�h�f*�^�3�uY#0�_��\�1pI���k���b�n5��C+��J���J�@kh<��o��%7�o��Ƞ�ר��IF�CB�J�k�� R,�8�&�Njb��l`�,��K �.����ZUX�����G|j>a�������� \<T��T�,յT�{�E��P>�t�`-�y��V( ��{
�`�3U�
h¤���p4�P*��������?\�0|
N㫵_܎Gw����l�� !�� !�>
�
��‚�T&`l˽4,UTj���9QK�}�����h&���_�����9�

?i��Ag0�
矜X�����-�R��,���
�RP��>� ���/�g�P
�����
8tb���x4��*�G���l�'�D
h�`���2{>�[�Z<YL'gC�|̤�I��2���g O�
��٧&k�;񸩤y�4I���W�w��`Qdo��DE�Q�Tf�
�hAB��3�@��6��Ʋ��Rq�@$��MEZx�F�E�����yYlHOݽ�֠yo���̈́�ӫ�pv�\��űvC�Q���4��{h�o���f
�l��}�Va"���	8��趬������Q�{,҂�lp�[uq���&Q�}�)���dtǮuk�f���U[Czߜ�.���
�
��sp
�� ���ĺ̓��X��ruH�����W���#�7
sCϷ�/\���{��Bp?P*mZ	�J��v�z[¯��o:)u�O������~��L��V��_�q����̏ ;���
�'
�5V�i�
��C���M�[�vN5kQ������̇�8$�?��˚���ѿ�끝�|���*|���c7D�����[�"��ܬ�r��Z�5�c�ހq��0���g<�����~���e����;
-endstream
-endobj
-321 0 obj <<
-/Type /Page
-/Contents 322 0 R
-/Resources 320 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 312 0 R 313 0 R 314 0 R 315 0 R 325 0 R 316 0 R 318 0 R ]
->> endobj
-317 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/bugseng_logo.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 327 0 R
-/BBox [0 0 640 166]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 328 0 R
->>>>
-/Length 1662
-/Filter /FlateDecode
->>
-stream
-x�}W[�
7
��S�	��8F�
�c6���)R"��Y��Z��J$U��ʩ\Y��Ϗ�o��ۿ��|��r)�j5�hu�9��]^�<r9��m)S�M�:)��v��� j��a+%�z}
$�$�/�*i^�jjS.*s&,t���R�<+h�:��wݱ��)�Z��
i%�z-�{�
Q݆��V,�Y���W���I_���'�ԫq�"��
��'
�*���b.i��\O�>���%�h�&�Ȥ�~˄@�D���N���$�_�&a#��e�Uj�|[Q�^o��2o���îi!cZ�ף����
i����s4eW

E����݆��
�<+Z
I��P꽇�8Y�Ɨ��3����4�W)�����/r�]w��<�ʶ�q�<��~�t��
�_u)�V��Y�U�����
-����/ 8� &���Ua���j��Je��+%
-��̉�)i�U
�
�S���F_@��rG�T���HE�
nw�6[.�:�o��@r�������ЊCAT���F_�n�n��)|�d�Q��
H�i��?
�h=�8�8΍=U��UPC%Ӎ�.
��(R�ae*77=�󱁉�S�^�
-��3��j_
��
�Z�|>j�$�3�#a���>�׹2D���'N)�
�+ }��"��{�7��Aw�a���mŏ�
-FVCg��
�ԭ����)_����'�\G�^����\��1B��g��n�\ڠ�NY�
:��Yq�&�Fa�-��� B��S��f���7�G	#S���
٬7��E�� 9�D��M
-G
-�20��Ci�e�+������D�����ô b�~#����z�'�\.���F�է��]xv���i�@ I�8a�=�z[PjVkn��w|0S��t�h�m�ل֩�H�F��@0#����5�jN�1�-�R�F;p1jվ(�֙EHG´��i
�;i�`
 {��&4X��s[4�I�
d�!
޴r/^�a��@��Ƕ�?Zr�W��U��PǗ}2
��di8�ÍU���Q{?��b:���H��l�D��
�0ձ�vxk�ڱ�ʜ�

ו��^Y�"Ƃ۸���8�z��Hح�(;�����_۲h��a
�
-�e���f���hX�R�iqV`z��!��9s���}���g�z^���A�.a?�S�*To
-�W�h@�+V�C�`�x�k��a�<��]a�M�:r�#�`[�{���T�|�W��$̽�g����+�xآ%��
-$�*^*��w��+�M��M1����Q���o*Z6�P)�P�n�+T�`����jV�
-	�
-�,r ��U��W
O�qj�T�M�J�p/������5쐯�kC����u�%��u_(�@�3~Gvig\��W�A�^���j;+t,q�pLM{9i�I�s$��!w�tꡎ�+�!�HB�$���� ������d�_
d7e"�yξ��W��w$����+N�n�� 8�uXl���W(��DY6�~٭����Ȧ�<6��IJGfQ%?4�
�
��L+Bt���{1m�8�MS&L��r9=56*�Q�*�RȾ�{O�C=��P���Yb���
���h��k
9K,k�8�n#�f:Vl07�:��+��i�v,��~"[
�k�� :)��
z��U����3���b��X��?k���1�G���f��σo��?Q��B
-endstream
-endobj
-327 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100335+01'00')
-/ModDate (D:20111106100335+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-328 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-319 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (/home/roberto/ppl-1.0/ppl-1.0/doc/ppl_logo_no_ppl.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 329 0 R
-/BBox [0 0 640 640]
-/Resources <<
-/ProcSet [ /PDF ]
-/ExtGState <<
-/R7 330 0 R
->>>>
-/Length 2432
-/Filter /FlateDecode
->>
-stream
-x�m�]�$7���y��%R����
-��C��s���ʬ��6
�Z��"#�d�u�Tά������ۿ����_G>K>{���gM^ο�8�s��(�czʥ����z���-U[�%�b�
9'cYSu��ó�T�*�^���δ��i��O/<��Y�J�8�|�6�i�G����T�2
�Q��R�RNk
]ΙϞ=��ǟ\�ۡ�Z��~��(�����YZ�<k�-����5k��Z��Q����~]7���Z
F���~��f��|����B5n��1�Sֈ�g
�
k+���㨥���h}�Sd�R�6{��X7S0�>��zʤ�@�����X�k���bq��x����e��2�ݒ9O�~&3y�-�qN�\Vy�V6����׍��}�p��
FX��k�0H
m֖F�uM@��办®�M쒑Rqp,�񶖕���y���W�2��
����:9FLs9o���n�	��S(v�A'{��� �\w|Q���҆�<i=ML�ZR�%��
-�&�
/81���L�n������``^I���*��g
��l���q��Ǘ�_� ������Q�Ov��vT�p���в8>���
d��o�ўAC�+���
b�8�$=��Zs����	~�4��ɓd�7^�ۣ�� X�~�����>�v��Я*�6[�h�b��h�G2o '
L4��dV2��?�i=�kq���@�7Ye�i���
�|G`ped�m��ڵ��\*'3�	
-�V/#�0�ۜ��!0�x/uA�N��ㄵ�"3 H�W�
v"젰aC"`� 6����{	�T�g��H]~!
b��S'����Z���>���]<ˀ����'
?��M��������
q�K�ؓc<1�c�3����x�h�H/r�ђ�'�
��(
���4��-0Y�~�BJ�1L��	�
^,t�����

"��bQ�N�b�3J"�� ����B	���
�����6\�h,�0pRٖ��Ѡ= Pz=�%�B�Mޑ�>ؙ�/1��
#��@ңvR��`r+pB���{Qo`
	@���_轁D^��j�J��H���(�B�3qy_�
�����G��K�cG� ��-TlFq�4T�G08��2�
�,E�
⃝VTD�
JY��&x;w+d�H\��)SU�t�����_!ԙ�q��P��h�[z
I��f�Q�M�sTQ؜���"�Ch&,�ɮ� ������M�k���C[�}���<��N�Ӑ7�}���C<;�d��./�F\KXS�>�"�
-}W,T&w�>8�[�����
-wx�_R�O;��{U�⑨���A��Wn�_N����#b��,���n~v�7�hI�W�{�Zw�LV1'�HI(6�;�C���
JBCFU$�=z����Ԝ�� ��8 ��{S�b�wH�g�Uk"�n�)[dA4ohw�@M�z�|��Z?��v#�քD�v��V�S"�Ed��
�5���:ND
,��	��{�!���}����?>'��+�S�2����mj� ��A�U=�Zf�wH�x�d��y�J����H#��� �Ҙ�
y�NP�'
b���#�U�
�\_j���D�[���</������r뤈J�o���jQ�e
-��3��˵O�yK�b���C���C�a��!쩨.6%g�'���Ս��@�/��4qS�@
bgS}w�}-���Cw#B�ZD�k�B�,&%U4�һbܴ������!'QE��n���	�� )�rO��1
h���m@��P�&�q��S��J��Yn��PxV��S;uc��D���z�S�_b
���-�]���8,�@GC�U���$�
zٲ�4w����L�@ԁ���SQ�H&�0�tJZ�*6�?�R���A��e� �!�0nI��-���R��ʵ� ĞƮ'*اq��n/���u�!m� 
����ss
 =��-
- z�`�k�,�~�D�x�mC�`M�`�+_���x?�d�։U�uh�g}P�d�v-���q����:(��ڕ/�Ƿ�'��_�D�Q�fBc��/�fMj%�i���	%�8���U`�ԏ�a�l� 0v��s��DRn��h|�n�r��6pd�q�e�c�h�v0��Af�
���� ��jw-:��v��{�Њ$�&H��

�|��|�zL�w�zW|ׄ����_�N+��H�z)x_�{h ��\1Dz^ �Kc��!�aw�w�h
�(��.����
m��HA3À%�br�\�g�(���N�m��Ppn��
�88}�B?
-��?��"�`�����tu8��5���w\�S��i��h�R;�%{��.�L�
�
����3Lp	�rp
3Z[���&=K٣�E'h�>��o��4�	���^4�ѵlP���m�
�p#�י)ח�,�����M��ڮ5unT��7���*�G�F�Xjf%�A�H�K�;�4�ьw��
�JV��q��
<��d��������S2
�
-endstream
-endobj
-329 0 obj
-<<
-/Producer (GPL Ghostscript 8.71)
-/CreationDate (D:20111106100336+01'00')
-/ModDate (D:20111106100336+01'00')
-/Creator (cairo 1.8.10 \(http://cairographics.org\))
->>
-endobj
-330 0 obj
-<<
-/Type /ExtGState
-/OPM 1
->>
-endobj
-312 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [385.063 648.798 490.947 659.702]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
->> endobj
-313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.426 626.945 322.585 635.792]
-/A << /S /GoTo /D (GFDL_GFDL) >>
->> endobj
-314 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [231.464 595.308 337.877 606.212]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
->> endobj
-315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [440.112 583.353 513.996 594.257]
-/A << /S /GoTo /D (GPL_GPL) >>
->> endobj
-325 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 573.455 169.87 582.302]
-/A << /S /GoTo /D (GPL_GPL) >>
->> endobj
-316 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [204.862 457.687 398.138 467.585]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
->> endobj
-318 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-323 0 obj <<
-/D [321 0 R /XYZ 89 770.89 null]
->> endobj
-320 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im2 317 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-335 0 obj <<
-/Length 19        
-/Filter /FlateDecode
->>
-stream
-x�3PHW0Pp�2�A c(�
-endstream
-endobj
-334 0 obj <<
-/Type /Page
-/Contents 335 0 R
-/Resources 333 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
->> endobj
-336 0 obj <<
-/D [334 0 R /XYZ 89 770.89 null]
->> endobj
-333 0 obj <<
-/ProcSet [ /PDF ]
->> endobj
-385 0 obj <<
-/Length 1459      
-/Filter /FlateDecode
->>
-stream
-x��Z�R�H}�W�m��ޗ���J؆� ��I���U,�Hr��~Z��N���hK}��s���
����[�;��#,�J��չ�$�8�.e���umu�:W���� �"��,~
-��a�u߂�
X����\Xݰu�X=���.���Q��^�.�U���$.&
�#�Ѕ�H
e*���hi-�Wf/��a �����ʏ�ӆ  ��DNQ`_8�~_Uݕ��.��FW����3VPe���si�XE*����� �ϧAWE���6@
-��
-�s�𼹣ā�V��� �B͘�q��,E��>e�vIMf�
*c'QO=�s�]���K�R96�\[��
��6D.��IW+� �������u���?D�f@��
r�j�X����
��?�C���j����֙�ѽ�6�:��>g�4H��ء�4^�Y%���OS�8�[�9�(>e�@'Ѥ{�P{�����ϥz���F��-T��T_���7t�E�%3�l9���3��S�����A��� j��'�Q��j�/f*�-���B%����v�.�^C��B����z�F�Ftc��Dk]�k���&��$�a<ߩ^�{��F����O��iH������ܹV?
�Xݼ,� �5z1]��K��
 ���T:�n���
��x/խJT��R���$��Y��BF[A�����@h�
�͜
" m$��a`��.z^�|sX}���`���;��7�D#�q�����Q�F
-e#��1*�-�K5LT:�~6A�*I�
<���n;�
젗�
I�E
�
�L����q�
A8��$�ϴ�=�(_�M[�F�d����R.��\��_0	XN�KM$�a�r;
-�	 4�57�z߻��k/7JN�b�,�m5
�&L��m���ĭ�����뉒
lL�4"#
�t�dco���y��r^A�$樟4��)�;W��� ��]��L��lJ~��
j�%~�$�	#�_;�l0s6p#6
�_`!�L�2
3�Yϗ��"�8�1Ξk�
��?���#� ��]`d��7?_˔w8P�d�6�ұxY�5_~An7u|z�I'��CW
%F��$��&
��g�Y�`W�a��ݜ�
�u�M�h���sz�j�ļ�F��z�j
��WT�@s�&��q�
|��
�y�1�
�M�����|�ps��}[<��z��
��TR'Q��T��
4�w��~����D�8�^L��!2��N��'g?��Cc�L��S����˓-'�e~n�bD&�i)?ǖo
-���	�_%G7@,6A�m�QF��"��Lw�r9¦���L�J�Euϐp���˽�*M_\���N���ϩJ~s�4U�ɏF�=�/�����ё�
t;Ԑ���J�
�8�Y����HM�

-��z��.ˆ���݌���I��3��A��
����uH'� ҍaq�ַ=k�)�.c�&O��.���������êa�$��A�5y������
-endstream
-endobj
-384 0 obj <<
-/Type /Page
-/Contents 385 0 R
-/Resources 383 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 337 0 R 338 0 R 339 0 R 340 0 R 341 0 R 342 0 R 343 0 R 344 0 R 345 0 R 346 0 R 347 0 R 348 0 R 349 0 R 350 0 R 351 0 R 352 0 R 353 0 R 354 0 R 355 0 R 356 0 R 357 0 R 358 0 R 359 0 R 360 0 R 361 0 R 362 0 R 363 0 R 364 0 R 365 0 R 366 0 R 367 0 R 368 0 R 369 0 R 370 0 R 371 0 R 372 0 R 373 0 R 374 0 R 375 0 R 376 0 R 377 0 R 378 0 R 379 0 R 380 0 R 382 0 R ]
->> endobj
-337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 685.699 151.499 696.578]
-/A << /S /GoTo /D (section.1) >>
->> endobj
-338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 665.21 229.087 674.186]
-/A << /S /GoTo /D (section.2) >>
->> endobj
-339 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 642.818 252.131 651.794]
-/A << /S /GoTo /D (section.3) >>
->> endobj
-340 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 620.426 165.446 629.402]
-/A << /S /GoTo /D (section.4) >>
->> endobj
-341 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 608.395 173.686 617.242]
-/A << /S /GoTo /D (subsection.4.1) >>
->> endobj
-342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 584.08 180.928 594.959]
-/A << /S /GoTo /D (section.5) >>
->> endobj
-343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 571.896 202.726 582.8]
-/A << /S /GoTo /D (subsection.5.1) >>
->> endobj
-344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 551.541 155.484 560.517]
-/A << /S /GoTo /D (section.6) >>
->> endobj
-345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 537.454 202.677 548.358]
-/A << /S /GoTo /D (subsection.6.1) >>
->> endobj
-346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 517.099 155.484 526.075]
-/A << /S /GoTo /D (section.7) >>
->> endobj
-347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 504.949 178.398 513.915]
-/A << /S /GoTo /D (subsection.7.1) >>
->> endobj
-348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 482.656 206.393 491.633]
-/A << /S /GoTo /D (section.8) >>
->> endobj
-349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 468.569 235.633 479.473]
-/A << /S /GoTo /D (subsection.8.1) >>
->> endobj
-350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 446.311 221.874 457.19]
-/A << /S /GoTo /D (section.9) >>
->> endobj
-351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 434.127 275.613 445.031]
-/A << /S /GoTo /D (subsection.9.1) >>
->> endobj
-352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 413.772 196.43 422.748]
-/A << /S /GoTo /D (section.10) >>
->> endobj
-353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 399.684 390.062 410.588]
-/A << /S /GoTo /D (subsection.10.1) >>
->> endobj
-354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 387.634 433.22 398.538]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 375.584 446.97 386.488]
-/A << /S /GoTo /D (subsection.10.3) >>
->> endobj
-356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 363.534 469.504 374.438]
-/A << /S /GoTo /D (subsection.10.4) >>
->> endobj
-357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 351.484 434.247 362.388]
-/A << /S /GoTo /D (subsection.10.5) >>
->> endobj
-358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 339.434 392.419 350.338]
-/A << /S /GoTo /D (subsection.10.6) >>
->> endobj
-359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 327.384 366.431 338.288]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 315.334 352.892 326.238]
-/A << /S /GoTo /D (subsection.10.8) >>
->> endobj
-361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 303.284 384.553 314.188]
-/A << /S /GoTo /D (subsection.10.9) >>
->> endobj
-362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 291.234 357.007 302.138]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 279.184 391.328 290.088]
-/A << /S /GoTo /D (subsection.10.11) >>
->> endobj
-364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 267.134 350.381 278.038]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 255.084 384.702 265.988]
-/A << /S /GoTo /D (subsection.10.13) >>
->> endobj
-366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 243.034 415.517 253.938]
-/A << /S /GoTo /D (subsection.10.14) >>
->> endobj
-367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 230.984 414.411 241.888]
-/A << /S /GoTo /D (subsection.10.15) >>
->> endobj
-368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 218.934 394.476 229.838]
-/A << /S /GoTo /D (subsection.10.16) >>
->> endobj
-369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 206.884 412.349 217.788]
-/A << /S /GoTo /D (subsection.10.17) >>
->> endobj
-370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 194.834 348.698 205.738]
-/A << /S /GoTo /D (subsection.10.18) >>
->> endobj
-371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 182.784 383.019 193.688]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 170.734 375.567 181.638]
-/A << /S /GoTo /D (subsection.10.20) >>
->> endobj
-373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 158.684 371.94 169.587]
-/A << /S /GoTo /D (subsection.10.21) >>
->> endobj
-374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 146.633 406.261 157.537]
-/A << /S /GoTo /D (subsection.10.22) >>
->> endobj
-375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 134.583 398.81 145.487]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 122.533 427.024 133.437]
-/A << /S /GoTo /D (subsection.10.24) >>
->> endobj
-377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 110.483 319.378 121.387]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 98.433 408.473 109.337]
-/A << /S /GoTo /D (subsection.10.26) >>
->> endobj
-379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 86.383 384.125 97.287]
-/A << /S /GoTo /D (subsection.10.27) >>
->> endobj
-380 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 74.333 433.13 85.237]
-/A << /S /GoTo /D (subsection.10.28) >>
->> endobj
-382 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-386 0 obj <<
-/D [384 0 R /XYZ 89 770.89 null]
->> endobj
-383 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-419 0 obj <<
-/Length 1136      
-/Filter /FlateDecode
->>
-stream
-x�͙Ks�6�������`�Ad:=ԏ�
�Q-%'ÁeX�������K��Y�	@��[,v�$`0
`�v��d�w$` ����@�@P	�����0M�ϓ��� ��CM�������d\�
'�/d�`���q0���apm�O���o�My at 1�m�`7��q3��\t�㫓C�Ii �SA`
d0�S&W�]����k��,�2��G���4-�2���wF��iY$�M�Yx��.�:bka?S�y{y�����fp9dB� 2
*e� �`H���:�m�K2��"p#��"w����<���j	�!ڈp����s�
o
�A@��Ž%gi��@�D"C���0�F#�P�L��2���G֪��
�D]��Y:M�)kĩ��,�;�h���>����x��LiW�#�PN���������ɸRU�	�>�>�,�k!��>�C8���q����:����Z;�
-�.�O
�]P�F���|���u����v�B�s%�(�Q��RS��;�:iE at 1b!{�[{˚���7������'lak�����?c�,��IZ��i��a(_X�!�`Ŀ
;
-���
-�O�q���-l�&޸�|��
�JU�
-���N���6���E��l�8�Ӵ�;����D���RV���
�6+��2������~YT�̒.�U�+m�s�:�И��,�=�e[�r�ҳ���%#�_�5����
-��u���I�‘u\f��?��x'��
9vDn��֞�T�������N2�L�j�++
1�M�c�|�� �G�*��VX�c�jTUw(,�z��=;2'�b{봘\�Ly�H����a
�"�՛!� sd�콥Ď^>��/^~p�/��'����̜�)��3���v�@���rQm�����+��E at m���Q�3��_p����y2֕�w8�?��l���8�s��� L6v_@$nW������c�8'�Ai�=�Z{���
R���(3;H�?mnr���ht�^����k-&T�s���Bͺ�
+'n"���}�k�K�X�-�*��q�lHt_��˽� ���z�X;cݯu��ג�]}F�!H�i�غ���7{{W��\30-�G˴�/�
����(/MǑ�3o�4X_�ZX
-endstream
-endobj
-418 0 obj <<
-/Type /Page
-/Contents 419 0 R
-/Resources 417 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 305 0 R
-/Annots [ 381 0 R 388 0 R 389 0 R 390 0 R 391 0 R 392 0 R 393 0 R 394 0 R 395 0 R 396 0 R 397 0 R 398 0 R 399 0 R 400 0 R 401 0 R 402 0 R 403 0 R 404 0 R 405 0 R 406 0 R 407 0 R 408 0 R 409 0 R 410 0 R 411 0 R 412 0 R 413 0 R 414 0 R 415 0 R 416 0 R ]
->> endobj
-381 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 707.957 431.447 718.861]
-/A << /S /GoTo /D (subsection.10.29) >>
->> endobj
-388 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 696.002 407.377 706.906]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-389 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 684.047 413.663 694.951]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-390 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 672.092 444.448 682.996]
-/A << /S /GoTo /D (subsection.10.32) >>
->> endobj
-391 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 660.136 422.301 671.04]
-/A << /S /GoTo /D (subsection.10.33) >>
->> endobj
-392 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 648.181 403.492 659.085]
-/A << /S /GoTo /D (subsection.10.34) >>
->> endobj
-393 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 636.226 365.325 647.13]
-/A << /S /GoTo /D (subsection.10.35) >>
->> endobj
-394 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 624.271 396.877 635.175]
-/A << /S /GoTo /D (subsection.10.36) >>
->> endobj
-395 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 612.316 391.886 623.22]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-396 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 600.361 417.48 611.265]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 588.405 364.614 599.309]
-/A << /S /GoTo /D (subsection.10.39) >>
->> endobj
-398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 576.45 414.411 587.354]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-399 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 564.495 375.138 575.399]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-400 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 552.54 390.222 563.444]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-401 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 540.585 362.008 551.489]
-/A << /S /GoTo /D (subsection.10.43) >>
->> endobj
-402 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 528.63 473.638 539.534]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-403 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 516.674 472.533 527.578]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-404 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 504.719 393.559 515.623]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-405 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 492.764 388.578 503.668]
-/A << /S /GoTo /D (subsection.10.47) >>
->> endobj
-406 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 480.809 372.708 491.713]
-/A << /S /GoTo /D (subsection.10.48) >>
->> endobj
-407 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 468.854 444.777 479.758]
-/A << /S /GoTo /D (subsection.10.49) >>
->> endobj
-408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 456.899 479.077 467.803]
-/A << /S /GoTo /D (subsection.10.50) >>
->> endobj
-409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 444.943 387.472 455.847]
-/A << /S /GoTo /D (subsection.10.51) >>
->> endobj
-410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 432.988 387.462 443.892]
-/A << /S /GoTo /D (subsection.10.52) >>
->> endobj
-411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 421.033 354.805 431.937]
-/A << /S /GoTo /D (subsection.10.53) >>
->> endobj
-412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 409.078 380.827 419.982]
-/A << /S /GoTo /D (subsection.10.54) >>
->> endobj
-413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 397.123 387.661 408.027]
-/A << /S /GoTo /D (subsection.10.55) >>
->> endobj
-414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 385.168 342.063 396.071]
-/A << /S /GoTo /D (subsection.10.56) >>
->> endobj
-415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.948 373.212 363.651 384.116]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-416 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-420 0 obj <<
-/D [418 0 R /XYZ 89 770.89 null]
->> endobj
-417 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-425 0 obj <<
-/Length 2993      
-/Filter /FlateDecode
->>
-stream
-xڵZ[�۶~�_��R=+,��8nR���f7����ѡDH˘"e^�����`��޸I���e 
���`�ru\��wW��n���*I����a��U�'"����:�z�����%�ެ]�G��������B�	���0x����W.�ɕK�"�W����_�*���WRxI�z0D���<��۫^IfM
-`?�h�\_x~�,����zN]){VU
�*�Iבs\ob�p�o�m8��\mT$/����5l�n��)�n⼩��{��);�wuZ?�ܾ:����.?�uFy{O�iI#y���`��UMs�=��t���q���*�.lq��0�:G-�/
v/�L�B��U]W$+�\WxǏyf�O" ���m�_sB;ew�u�O
��5m��ۼ*y�;�}U�}�6���͝����o�8�_�xs��uÃվM�UiO���v/� P�('?m&7b�
}�pm��<g��_EW��7o^Q�`����
�b����.u�
�:�`]e��#M�P���8
-�
�]$�k"����
0��
.���ɀ��q,���l6U��S?�G�dRsX;�-pr^s��`H[|��9�W��j�7*�D�Z��w�]S딖
�Ŭ�x\$E�z� ��Q��]�|�3�k״FF`���^2��wh�
-}�j��6g�o;��<\�<N��T{&�,)�\I�\	=Oz��r�����5]8��*6@�~����x�p�Ȓ���sj�[��
|�^Wf s�����z������4�
��s�6��i�P��M���1�g��g���q�n� `�9��z�z*��-���6�/��>7E�_�� Q��� �'�Ä�a�FŮ�I)�ˬ��#�l
���:�-0�R�Z#1�ajܴԪ�-�V3
�h�pCB�Pp"l��J��}��|���u�5zzR?33ds��]��
/6�08��S*�R��i�uo,e�$^bw/�;�K��
0 X��Zg
�yKSya�L�V(�=:S7LF�s�
��.�<d��4�%����L%���#lq¶o̿+
qn���D��b�����9m�@a��ey��
-& ���
r��EF���d��ʼn2�a�����R\��q�8^���nX������qpT����If�H8�����2���6����c���fa��Қ'
��n��ӻ��yyD�$.���(��u
��Q�6�R���?
�䟨y.�D&���̖1�燻!j��]ZP|VG3oS6����J���M�0�Xu�L��	��5!��8A��*7#�#Ʊ�G��4��S��ڢ�r�Rp��i�19/�s�x�5�L
D^�Ҵ��Ysۘ�Y4(�#��ok��r4Ϫ^�|
-c6��$��@x�9����V���'�"�67X�L��6��}�e�l�\Ox���!A�	\b61hd�ez�h�E�f���~NY��
��	�-j��Q~�z at PO����D��9�4Ӥ�F�5o at 8�����բ( �G��$��8��HJ��^�|�*/�O4J��	�k1� �}�ih�,j.a��'|��`]E& �H�DYr�B��vv�>�ǥT8R��p�lC,�fyܩ�s�!Q��Ƕ/��_��-��`��؝�Ps��&�7~|_uE��,Q�T����E�z='�SɕiYa��%��>G�nC}F������x�%MƟ��[cFmy	?z՛�1�!��$�
:�+���q�8��(X��H�h�
�=�DL�m�ݯ @Ϟ��d�q��������
o���?�ГK�]�"qI���3�nr
d�蹮&
��t��
x <�Lb`��<�*���;^euK��z��/'
O�%_��R����߆��D���$ �p�
�^���_?M�"�~)0U��e�-KD�1�}�����zT1���(��2*����ܶiݒ݃�u�Y�H�4%��^ �e��i��6�z��r��z�t�l&>�R�
�
�C��U&�XK�)�{"J�A�X��g�����	0��`Ԅ��~O=��U�6���$&����2AڙL`hǛ~
�$y��>���������{�P�
7�,�P�&դ^&ݾ^F���ZSC���./��4�%m^./�r��%(؞��Ӹ䷚�!<7潎3���˪��F�t��΅^�u$B�=YVY5��b�S��K_/��D4 F� ��ht���=!e�|�[��\>̧i��yڦ1�s�D��pp�k5uХs=�y��s/l0��]�u��8?�TdMH5�}W�
��E�\	�5����{��-
-W��
z��hJ��ہ��@_`�䚰b0DGə��RhЛ��� 	��A׺�/N�m��t��Ou� �x�Clx��K
��J
�u�~�\��}&l(�	WE��� l��,Қ�{A�
��Ӕr�0D��Kq��S
-<�[���ϊ���|����
U����E�o�|Q�{�z<�l���������Yq�V��)�
-�ZFkia�
�g��N�(֛4����(پ�>�	?�_S���(�
��Dh�0Xr*&�(+2����ٖ5��X�l���Upݿ���/?^��Ay
5��������s��@����w�'cȱ7�ּ�l=��}Y���y�	9��a�����|��?����w�͒��ʋ���֋|3���Bn܎^T
x�����b���^�������`�Zܽ�|W����lb$
��ɟ��s��
��`���˶
���`{k�����.�/M�_�j}6u��'��:ɞF)��S����}C���ۻ5X�5Mޞ��~2gv��
��
���i����d��z���!&LE8���v#�}���! y�"������NJu<3���qY�|�?��?�����0�3�Y�X��9a~ �A�<�p���a�[m�O���~e[������Cf�z{�o��W77�����(��"�0�aq	������K |+�@���
��Õ�T7����ͤ]�7/O��E:���?ً��
-endstream
-endobj
-424 0 obj <<
-/Type /Page
-/Contents 425 0 R
-/Resources 423 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 430 0 R
-/Annots [ 421 0 R 422 0 R ]
->> endobj
-421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.204 337.718 537.142 347.999]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
->> endobj
-422 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2 0 obj <<
-/D [424 0 R /XYZ 90 721.073 null]
->> endobj
-427 0 obj <<
-/D [424 0 R /XYZ 90 697.183 null]
->> endobj
-429 0 obj <<
-/D [424 0 R /XYZ 90 583.798 null]
->> endobj
-423 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-436 0 obj <<
-/Length 3176      
-/Filter /FlateDecode
->>
-stream
-xڍɒ���>_����!{�ɖ%�YV�q\)��l�Ȁ �2b�>ok���H�
^o�߾4'X�����O�7w�U�(�"����nQ
�~��h���E�?��-�,��"�34�����>�µ�W�7_nBX
-!O}�/6Ǜ��-L�[~\�G�t\$Q
�z���7�P�e.Ea��I�/T�a��E)]n�->�� ��6�U\�^�
�ںn�Q�=V��v�J��+�e�zg���.N�����d����6emw��+7=�����ī
O��Zoe;>~|�߽�#��8	�fD����̈́�~NR�mecq
+��U��~g��HSުk}�
��1�ߒ?Hr-��~-
��)�a���%h�Ԯ��A2OH?MG���VaQ�a-VQ
�(�����(�ޕ�( =E,b�9u�+�<ؔh
��6�.{͓���d<�	޵��Q1_8�Bx}��`��d��[��c��mgňr�S�Ɛ�r?Ɋ��6m�isj�-!G���|���K
-2��w��Ɋ������Ǫ?0dN�F3����LՊ���Q�	+��+����Rv�-��C��l��#"��é����$�ۅhk]U�k-玃.�J��u��u��f�d�\�n�ȿ�r�7�Q�
ޢ�١�xG恋@�ƍ���%�"��Q1st�h2
�X��"�̫�`6�;5gDcL���
�˲뵩�E�߯���}da�<�jM�ʽǃ�s�$�$��p.̣��I���ʞ�M{\W��k�S[�zە<�ۋ�+�[{
-

̾7����Fw%�]��Wu���*{4Y>��m��
2��o)j�[)���f�°�;��fC
1+� I48�3 � |g
��1|��03d�P
�)��e��
-�%S`�i@^
@�S���+��	���?��n`W�}�ˁi��� H�1`��X�j������&
F at J �/I
�1�嵏�
R	
EX^�0�� ]	�q�
_�!s� �sJscƂ����f(�o���&&
��
�̩�˨��YU�g�X��LJR��:FC�O�շp�ݟy�?�e������l#�C��[�����۝Z 0��JI�U=a�Z��������V!t�� M��am�J�ݞ��Y��������B
��o\����K{�xP�A���0�Xִc024�eȢ�!�x��u��Ey�M�F
$.�xi޸���;�b�5o:�\�֒	�( �%�����"
���G)�.~�@���P��q�
�^A�+���Ad�U�{��7p�(��Pܪy�qX/d�
�C.j��9����H�E,.��e�
:�Q�1��oT���ЈGA�FU+?�
�mI{Z��w��A*^�z/%�ٓ��`����G<Wv2��oh��P!�m����������~sQE � ͭ�}zqw�3;���wߒ��
�1���Fwn9o�\�P�C�
�
)
��I�&NHثT���5���
&A�^��
W��="�{c-�e��f��CN�<�,4
�f�E,����\sҦ}�6����J#1"��B��#��G2��
Z���{�
شM3Űf���ȼ�)I7��[���N��݃\�`��
�
-)�t�� ���7pt��
�?��e(��G|- ǖJc�.�&  K $�v�����x���G�PQ�-���[>�~�
��o<�̹
�, �6������
��i�9ч�+ 0����,���0�E�ݟ��U�Q� O�3V=LB5���J�f�+aE6
��`9�V���<~	ds�C��Z �[#U.emN�0��b%�ȏ�.�o��1��[v
!q��Jp�L	��PY� f!�z�����)��K�0�@��<��e ������(HyX���*�Qy8�<,�p��+~�����T��p�<�j���l�6�g�Z��O[��Q�k]��"���*��Z�,i�=@E��aۿ!�����HEjǃs��.S1�vC{5��΍���_���.x��O�f3�
s
��ؐ`�N
g	%
$H�Q�gX>u�G�7��_�x�z�r<�����J�gˆ�i
���$�u�d�b:��8�3?�v*I�4��
�$S�MD��(����
V5

 [...]
qf����$DB�g��@�5��v�
�\:'��D��#q1.�c��/�_���n���_pJ���Fx�<ENJY���.iz݃�h��{'���
-u�iȝ!�A�67�)yB\�Y{<hI��Ƿ {^H�����%IH��.@'|B��������}��Qv��o* ��r+Ah�My�]"K���˹uZ|:��-&��p�/��L&lw
���f|} �����2K�Q<�0
��D�<�8[H�	���.߾�pM
�VK��\c`�����\�O�D*h@��`�̩�G?X���~}�DvS�/G�fVN�R:�6�
-
f���^�:�
�T��8Wd����d^pO��6���^�!�0��xo��d�Y�Eг}�<UD�S��`g
�Q;Su8kF�l �F�����_b�.�
�
���b���h 6�����9���v
Į�)�$٤���p %��kJ$�����G�Ny�I��zָ�6PFwT�&��
-k��e?�����V�ѽ(
8A$����)��(�ն�
�0�n��~�#� �V6p0,q�@vC�.L0��/C�Q
Ƙ��
M�^���c�eg��
� Y��j{{���J�qjPҺ�6"<V�������V�;�%
 �@��v0�c�(��<���<��9ƿ��,�U���Qp&�O
��/7��JE��´h�����c���d��[M�>d~��ހ�{���j�c�;8P�P�}���#����70��P
��~���)
9����02I�����_B]
-�tt��
�F7{�o!�w��R~���c����}-��<����?�7\
-endstream
-endobj
-435 0 obj <<
-/Type /Page
-/Contents 436 0 R
-/Resources 434 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 430 0 R
-/Annots [ 432 0 R 433 0 R ]
->> endobj
-432 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [297.062 434.776 388.718 445.68]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://fsf.org/)>>
->> endobj
-433 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-6 0 obj <<
-/D [435 0 R /XYZ 90 506.992 null]
->> endobj
-438 0 obj <<
-/D [435 0 R /XYZ 90 472.913 null]
->> endobj
-332 0 obj <<
-/D [435 0 R /XYZ 90 472.913 null]
->> endobj
-439 0 obj <<
-/D [435 0 R /XYZ 90 368.11 null]
->> endobj
-434 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R /F11 387 0 R /F24 301 0 R /F8 437 0 R /F81 426 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-443 0 obj <<
-/Length 3155      
-/Filter /FlateDecode
->>
-stream
-xڍ�v�8��Э��l��(Js�t�y�d�����DB�$�����6�����b�P��J�E�xw��ǛW�d�b��m����؅�l�[���߂xy�a��ӯ2еnTɓ/��49�?�\׭��v�������7oo����p1�t�myu���� ��E�Jv��3m��8�o�x���M�S���2�VQ�D>�
-/�%A��q|ZZāj���
k]𬳼\�z����}�w.��9	L�v�,y�m��5*[��a�q�
>ck�c��yKk��2
-G*�
-o ������4�7¡�Y���d��g�m�
*U�–w}�^�U̓�򷵫�]�
O���C_��5��� S�:���K͐gӝ�ߌ���B����3�q�)��G
�
[�
�����I>��a/pk���P��
�tS��M}~��/�ɐ
yޓ��(��k�65��+��k�v ��ր�0��E�JD���`nFQn��'CD�	�tntnZM ��I�r��w��5h\�	����)��f!o
�
7i>|R�vVN>�Y�:�
-�e�<uF6l�
N
 ����X �NfOT���
((X(��c �n�8Lb��r� a��V-�Tc�ɶ߃�֝
�U��.�@@3'3P?v�|J�O�&@4��!h at qa(=-F�7��4o�0�hHõoF8�
r/���p#�=�-î���	�� ~�2Hɖl	�8�=��0}ρv?�g�d��Y���kF������4�Ee���L2p*I��FU<A��;/�k�l8�mM�*��&���c$tx�4B@���Tp��
K�Wێ@�E����"�
��v�A�$���zQi��y���=p����͸R���1���7g뎡[��I��%`���S���APwR�6+G�e�ٴ'�d�LW,
�XS�Q}�����`<Gh�n����#� ����h��
-���F
��\��J=!�d��
��}���q�2�:7Fw�!�H���6+Gp�#�z�t��^)=�+�^m
f׺e%g�gK%���^R�!�������=/pR���4kW��
-�H7�P�
	ɱ^:�
h��E{{F_ ��{
�z-��.��䲖\��;Xq
3�p�����
�c�h�\�1��$�U�vy���蒶��Oox���Oo��?z`|����
�<@�WkQ�p��,�h$����&خ�Dw^�įq�H�3&� \;�
8��$:�z H�NrԦM�g%���,�k���1U�ѲE+�@��������4�U��R!�ϲS���^x
�-�8$�	9B
���l�D
jI�%T-jueP!V���Z���*���,�yI|aQ$�(`�D_5d�I8e����8�yV2�
>ҋm"JV
B��o%�QAk��z��(�W�91�l|����
ɵ"w�vT��
q
��l��*u�:��y%jc3|�mp\B����h /<
�O(9"����"�L��c'�D�p��Y'�
�!`����P�NPr���"�,q]����^J�F���iOl� h�i�֘�D�1��PM�&�.r�qf �+�
b�fB

 f1n��u�8
T�P�t`�u
�O�5К��L�aF��K�ZxS��3����y%��6_6�nh�@�E�n��G�-��{5���F����U��#Ҝ�d~�C�{ Z���w_O��N���}��]Wx�w�'I�)��(2�N�IsV��W��9��$��	���R��{)UJ8=Aw
�
.�^��N��J��/�
�I�6�t0��1K���<�x��8#� c������2�MPK�
����"%��xjj����j
- �m
�Z��sR��gC���:J��.w��s6A4'ۀ��p{����R�И���+�N�P�2
-�\n3u^�U&��*K6s������f�:O�۫4
D���V|i<g�@�)�оq�͘�R�r{�L�E�v�e_�.Q��-*��CJ斕|�uY~߆��awP/�Cc
A,)dɄ��D���0S�c&�`�̨[0�UV\Nm�H@�&��)�O��;�Գ�PD�oϵW��"H���L�#�t�͠��?���6z,,ÝĚ�맜PD͹�Н���5��ɽ�
�	�Ǫi� fH��|7�
W���w���0
��mn�4/el�\�
^�-�j��3�d����@�-��bw�%Qa�*��I�uo:��dD�**��!#T�g��3�9Z��U���݈ӄzBb��9��nO�
U�|A���S�	��[��O=&�/
*
$��є�xD߁u�2<	-N��L�|N�H$��N��5;Հ�u��Pť��Ë��DM�}�q8���E�wb���$�h
:r�.�sR�
�d_b�=��z�dG��'���pA�
 J	p��)R9�^�N[� M�@c?�N�#�$�����c˽S�A�{mi)u�[���&���l��T)�
'�ș��"Һ��r�]��N �و��t5
IC�"��ڱ�#t5p�"���1�$�*K�SI����
��8�M
[�(�?�v�:P
-�
ka.�
�����pb�<�� ���Ig��9uf��S���n��n�`��,MG2׊��`yF5�M��t����]U����َz�N�j
-����-�dC��;ȋ���2����Pk�Ysu�R���E�S��"
-nQ�o*[jk�@�`�P��b<{7�� ��C�m1DeN��$c�H\|�A�ZK����Z�C� V���

�
(�K%`�dV�4 (U}��Q;�j���	7���
η��͏��r�ʺ����>��J
I��\���4�ub[�qU�@?����7
-�[��߷�KR������~��+ ��P_E�
-�e����A.{�
-͢$���r�O�ԂF���BQ`��1E�l(O0=&�g(�X �`��S  �*�v��U���\-e����G�E�
�cu�踁�uy�hd[�C'�+��5 �N��]��������
��8���)p�K�Y�d+�K��V)�6Ὸ��{���rE�xv
Q��W�?-��)�Tu�z�(�m�h��[���<����p���k�
��vϏa��?u���^��#D��
-B��@5
βU�����G�ʎ�	�������z�SW�M���bleYL;�1-��xu_%�7d2���� ��M�
-endstream
-endobj
-442 0 obj <<
-/Type /Page
-/Contents 443 0 R
-/Resources 441 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 430 0 R
-/Annots [ 440 0 R ]
->> endobj
-440 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-444 0 obj <<
-/D [442 0 R /XYZ 90 526.464 null]
->> endobj
-445 0 obj <<
-/D [442 0 R /XYZ 90 502.04 null]
->> endobj
-446 0 obj <<
-/D [442 0 R /XYZ 90 177.996 null]
->> endobj
-441 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-450 0 obj <<
-/Length 3245      
-/Filter /FlateDecode
->>
-stream
-xڕɖ�6��_�����2	p�&'lj3N<�g�g���9P$$!��{��6pQ���� �B�v�N�`��ͷ�7�ަ�j��'*Y�W�`�F�m���X���6������n��C�7��|����w8w���͟7!L�����t�ʫ��~V�\[�߭
hQ�����\����&�R�\S��0�3���Ԧ�^nnU����N����~B
kg�ϛ0^��M]>�L�pk��P��a`s�Eg�y؄ m?1��vg�w�c�?�?���s⒵��#mu)M�##��[��>���w
\)k�V�d���L{D�
)ڥ�#a������
�j
d�mj���粍
-֟7
-xfK�:Lm0�7��?�6|��5}��'�)FJ���6
-���
���f~,�l����CZi:@;8
��^���Qr��dMe�M����Z�d�T�y�� ��J�D��!��'d�ikS
-�[
���Gי�&���ps�mj�-����
T��br�1T���bZ�G}�i:�)f�
­E�q_ͭ��ڍg0�H��i��Q]}��UQkVEE��d�-� A�
9����6E������'���8��%]����w����E����3�\Ύ�J��em�
�M�����{b�ޓ��i��8v�
�
)+*��`��q3��Hš
ȅ���{+��hIܰ,�yJ��m��)�r����dj��rI�l�:@�m*
�)����ib/�K����D]a%���\���b���i9O��VMa��W{'RG"m��=�
������
x.��6�A�
�^���h��mg�ۢ�����B
M�e�
H��:�ECn^�1]Ɵ"
O��M
�3A��`���{{h���Xs�Zy{���@p�4�[�!;�������x��ck�Fwj���r1{��Z�06�5J����+���mPkY$A�YLxf,�����x��`�D�,f0t.YK=%13|3Q�i�~�r�P��f�(H��k
�Ewޜ�/�t~4�� *
r���R��@�~G�\�[��bIT�A���� �e��	���SZR�qA<�%� z"wvʞ�k
�
p�uVٜ���
�d����,F#�O��tL�
�9��h%g�
�۞jV,�� m͟�mQl:K�Y;A���<A���E�e��N��p-NShJ��
-�y�n�=#A�{�NY"�HBKL�x�z+Ӥ��wq0Q�����Ja�V�!y}���`gpF8�8���$΁}���99z�d2>n����\vl��{|�#��կ�@|�/��/m��qH
-�
����m�c�$��:��$�pY�$��`�b|I`��$v��%w�j�;���bΪ��f�J��a�"�0�u��	Ny�\�K ���ZT�5�	H˞��d�&�
�+
�� L�$��{osS��€}�|_(,L$S�c������H��T}��[�������Q�As��%�L(T�V~���$�?
S�u
��b��;���RȦ:��
T����ĉ
�DlGn	w�@�U-Y8,{��ɾ.me�����Q�[�E8��k�~���*N	��S�| 7}w�;�Ķ�P at X�% 8cXά�셱��3֬�{��T�_�IQ����+��E,_x��P(����
S���m'=�j�F��]�Q��!����z
����	ײo���j��)N
��z�
!�Gn9�[Y�o�g��+��qKT4�����0&̵ �srGs�P��ڇ
X��7
-�݄ȃ
�1(zF��
�1|Bf�Iy���V��
-���r�y;^�c����~�I�I3#���
!�5���+�t��l8V�e
Lg�i�i�$���"Y�YB�%]Քa����ݔu��Y��%�~����Cz�xR
#淔��
;�)��3�%�:bm`�>s"��[��x��XF�H ��|��:��!#p�0�L�"q������&�Z� �8��,��sjlK��OQ�Iӣ��k
D#��k㈔�Ñf
-��rCЗ�:�^5��K�LsV �_���^�9�UX��o�`��R�wp���^]�O�M,\�3q2y��`b���F)�2Qizrh۟$�R�c ��� N|e<�T
J�$����wB_�p�^�
-)�R�'���`�Yy$�$J'+
-H�syOE�$
Q��$[�� �t�
�fg{����
z*�	��1k�
�����qB�b1a"+�'z�����I%b%*���g�;ۋ䒬�Ѓ���7�h%��3C�p�8�enۼ� ?�s�W�
�U��J�7P1����	b)���
-09�
L)O'�P��}B5]�����i�h�]P�K
-0�7�y��0�
g��|�NJ{um�.k�h�u)��	Ӓ�h����پ��ox*A�X�<~oN$q������[+
��;{��
D�kƾ��>Ct��_��GB��
�O�Q<-5���躰{0��T~1WTt��HzBk(�=_�a��)�ɹn��oAU&s}+�=�Mb'.�[K
-�>�YP�c_RA��؁�5@�8S���&�A)f��2%�i�C�s�c.t~}���]%Y��5Y�(��Bڍ�l @p�
hXu�'��}��I,�/�
o�2kg�ܘ����
��Z��lǒ;�����\!�`I��<�׳�H����DG�����Y=V�.�gs}�j�����J��鋘{�
8{R�V\�=.!�▙B.��3e�iL�����N>�
�L�E���p�`$�	SI��̶�:)3�#
/K�X�
�����)���K�-a�d�_#3_x�*Ba]^f�z"3E�	�����e,�iL��$
�ڄ܉�B�sB�3r���U� ��y௔v�9�_5��ux��:�(��n�V�c��<��0BF���^�?�G�s_�����U��xI<�4���`�y
B���M{ I�zC��_	G�JŊ�P�Y�,��G�Jɾ���G�E�x("
b�X�SC�N���'�1V1s3sF���R	�h:o
-�W�b�
-y�ޭB9R�T��ؼozǹ�X�A���v��x.�����N
-��d��c� %��'xx�u�@�'�#�pՂ%s�)0�
� ���Q$j�*�����l��m��?`�	J�i�hrڧI�G ��Uz�]�Ft���vD����l��ޡ��&#�H���{��8�Ɛ�Y}곓,����0��
�mQ���(�s�m��>1�<w�w�*�����yQ�+�������u���zu�O�ԧ-<p�Z�9M�A��Cٻj��7ֳ��n���tV�C
-endstream
-endobj
-449 0 obj <<
-/Type /Page
-/Contents 450 0 R
-/Resources 448 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 430 0 R
-/Annots [ 447 0 R ]
->> endobj
-447 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-451 0 obj <<
-/D [449 0 R /XYZ 90 475.892 null]
->> endobj
-452 0 obj <<
-/D [449 0 R /XYZ 90 250.667 null]
->> endobj
-453 0 obj <<
-/D [449 0 R /XYZ 90 104.904 null]
->> endobj
-448 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-457 0 obj <<
-/Length 2897      
-/Filter /FlateDecode
->>
-stream
-xڭZK�۸�ϯ�-�*�L�����ɺ�x]Nٛ�����H�)R&)����kt|
����2�G�?��o���n�����|�'*�|����&��m����|��흊}���_���5w�]vuUr�MU���dY�y��o^����͗� [������i�)O7�7{�_o�m�g��t�D*�o�y��z�dy� ���q�0���
p��;�P
Us��p,۪��
�:E��F��m{W�`sw�ݩ���V��W��R���=7�FHe�vB{����I�C�
-K*��s}%uA�;H��1�5�`�Xs�l��G��{�o����U3��mV�2�i�k�^7�������@[]W4�Uve%a�0��t�N�չ�� ;��gZ�<��"��Mp��nɌ�dMR�b��k]qںe�m�d��س�����+5b�<�m�y�Nlꜻ�z�1�>����Ey�U���HFG��ݿ��#�j����3
*Ū���q����{-��/�s�
�#΍���s���Hk|~R��6��P
�~^"�`wX4��Q���]y/�j���*�&�ʼ_�}�����߷���6:D�_�
H�I=��$�!��U�M��e�mXUh����I�(e-��g&��

M���W�!^�L����ID+
Ri/�-�]�/�pV��w��{T�#�;��(v跇:K	�
ܺ4{�-BD2�l���g����ξV&��Ƌ�b�4�ط�:i=XZ=_
[��h;2Z�af�M�l�0�Y󭟤,�'��9�ǻ����8��>X�&Ƥ�\z9L�0�:�NU�\�]��lyxB���{ѯ�G*��"J��5gGEeE����;�q�`����e߱�a���a�Od'2�N-���٩;VLKc��Ҙ���_a#I8F�*��S�%���̖PmB%?ζQ��}yt	�&l�T�r�
�袠�H5QAUϔN�T�>�u��
&
��Xp*���L�
k��Ȯģ-�3�%cn������{
^����4�e��A�G�e�
T9�h=��6K��g��
�m�eȪܬT	ߛ��Lf���v�0Cٞ�L�^�xn���<��}Ϛ�N�-�bRGQ
��~h��ɹ��xVA��"e�!�WrLAf�A�?��2�*�]-+���N*<{�Z��5�FI֤���6'�o�q [...]
-��I�%~G��Ӓa'܅�jx�[�z7�����x���l0�㺢D̬��@7pX��s�����4

�٢_.��
����z�)WB�DV�KVP���kR�4��	vE�N�,5��q�V-˽Q-)6
-�U��Д}՟k�@���4̪���kfy˩�GZ1��ǃtd�gO���|{]q(
_$ꪀn��e�2u��-S��P�	G��p�>�XD8�+T�/
ӝ
V����
�1	b\a
f��o-��[
!��O�P�'����sU��"ɦ�b�K�ұ��3
�R"͕p��ѲX#3+���SK'K߉Bd����8Ѡ�����rئ�}�b�t���h�����B(��.��].ģ�IF
S{�'��g37�N` ��/YV�����q�D1�q��.u�
����c��������7ZA=���2M[_N�e�u��~h��`�:&›�������I�
]6B_y� �E�B���Oq8L
-̠	���~����	�5� խ�v����	�J���q`;�Vn\���II�o]�*�м��B�ɕ��晉Pm�*����љ� d��D���Ʊ׻�t��i�Cr�J0kȀ��	
�2�/�J�?�b*�@�'��WMY_���?�(~QY���rvC�!+,�ʣ\2i\"�ť�Q���{r�&*/Ng��j�
�G7FӋ3��r����o��n��3B���? :��Ch.��a�x�j�%�p��C6�hw���~a���=Z�
-��E�U
h��J��=_��p����-/��_��"Գfi�
���
���}*s%��HG���N{��4����t)4wR������s���4���1㧾{�~Ǝjb Tsk1
7A�c\A����
-�'�<�	4
-����9�#�T�JV���\N։
N�$���h������ΏP�,N�W�LX�Dzjޣ��B�rBb>�j_R�,>b�q�s�����c�L�tw���eLA	�������:�s���Ã%Pk{B�w���&)�+�Ѿ��5U2���h�O���u	��KcM
]B9��͕+�S�P�`��i��K��.!��<�]���3�@F�]'7}�����+��r��v��٘�m��&7�@�S��c���~��h�[A����J���0>X�yo��x��݄�HQ��ʳ#:��ý��0~(�C��0{m�
�\J}u�|��� �Z���E�v�I�=kE0[drOWR�V�&�xn��P�|� ך�t�V�%x��E��,>]|�R��2�3�5G���Ƚ���s%�b( �w�
��y�yp�t�;�y�Ӌr�-�����
-��E����i�Nٲ�������x�_�T۾m��e�~����R�9:�p��na O_f/�d��O�6hɕ���&��'�{��eS���x�
&���=����S�}�`>�y@�u���~�5;Q�T���5�~�N�y
-�_��t�߈�>l�{����I�V�7�
_��{5}�`ү�]W���h.�s=@�ݷ�`�M����^k�������
-���,��
-C���a8�����r�us�"�?F���4�
-�\W{ŏM�%�3����W�zd�m�(�<��
�~���pL�f�N��W�p�6��࿬D��
-endstream
-endobj
-456 0 obj <<
-/Type /Page
-/Contents 457 0 R
-/Resources 455 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 430 0 R
-/Annots [ 454 0 R ]
->> endobj
-454 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-458 0 obj <<
-/D [456 0 R /XYZ 89 770.89 null]
->> endobj
-459 0 obj <<
-/D [456 0 R /XYZ 90 613.875 null]
->> endobj
-460 0 obj <<
-/D [456 0 R /XYZ 90 263.466 null]
->> endobj
-455 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-464 0 obj <<
-/Length 3509      
-/Filter /FlateDecode
->>
-stream
-xڥɒ��>_�[��=�Kn�c�����
R�	��G�2Az<����p�R��6�F�w0�=���w�?޽�*v�̢l�xޕ�.O�c��S��e�
~{�fg�1,3XC�/~�����¹�/�~�
a*؅�<=�Ů����[����.8�e�{&��.�b�ow?���.N����(
�c�<
�a�
�E)��.������5H��CT��/���?a�����b�tus���M=��q���h����a�E�?�KW#OV}-��f��H٩�!
�-�P)f*�C3��s���Y��3�6��(p�<����:��d���Q�)�c����ƺ'�/��O�4T�xx��r�xipoy�W�N�, �
�����q�Y׼�����J��� E �����z�C��l���%\��4g�D���K?�t�N*�W3�w0�À�
��T�Hu�����a�̩���5�����^�9;���R�
�)�a���ʚ�2�M�D8mv�q�z4�:i��� [...]
�
��@���<����KQq��$l
�# �CՀ��F�ϸy"��G
��#x%
-YQ�X����IX����t2Ҭ#��{�T��50g�C:�4�}B-�L1wƘ�/���
�T��#Í
X�g�,f���;{�v�����ɺT���w��5VY�`�{;��
�7=�� m
1�K�U1|�4�g��0�Hȡ5Zr���h�i� ߊUv�Ϥ�U�6#ģ���z1����|�ચnTh
�T���5h�3��
y�?G|b�C(
�:V
�|���A�v��Au����0�݈���T����z:����e��K@�!��ta�8C���D�[-�_���(2%r�9�d���m���
H�g,ݙi�4����o��D��yӪS+:zv�$xl�>��
}����󋋇FۀI��.���Q�ә�'2�Ɉ��DFk�W���Ƽ~P��6�
$A��f\��By�*/d�kIK��Z�FF$�����e�����5�kp���
9ϗ�|Ҳ<�# �P":��x�
8��go(]%\���
����'?u��b�R��Tan�X9��.w���a4x/�Jd�/w�N�����9�{�
�	͊9aS�E���ک�B�\e!�O
džP����bF}���iP�KCŞdԋ�ڈ�t�+/1�^���џJEE?�����E�,��D�6tv��a���0���r�Q{\a [...]
���$�i�#�Q0�؆#�42��6�>M��!qZ��:e�6�]W5 �q3��@�ҷB�6
7�7��B�D�a��Diʌ ��`ˉ]f
ݳ�.�u�:���.���1�r�Fy�l��n[x'f��U�Wk(��M'��N�L��rjB�xs���z�(Ȇ�~:���9�ϴ�58���8ȱ`�[Wb�AA��3|"�����E��
6�_EIpR���a�p�av�TS�<�2(6�<D�:�R(^Q��K�("���j2����L�#�8��QA��Ǘ[S����"Œ�z���	�
M�eE}��Ze�r�;�E�*�YR�LȌj�ޚ\H"Il%�K�
�H�*���
�<ĵ�
~�PՈ
�p��.q��Q����#B����*
�����
/,Hұ��v>�J�y�!��<�L�
�a+�
%���"PT�S�J�r���Adž#z��{!�
�����88�~�r�]�=x
c�g�r�&=��
����4W� �}\>��,�R���	.��;����v��!��x�(��bG �m��Z
(��0f��	�6R!��T/}MBI��*]C^n [...]
-���Z�	�Y��@��[�S��
�=���.�P�
���c������J���;��(M&�l�tb[k1L�+��ldl�I�[Ft�:J���D��-
a��n�3�kb���#!�s�
�2�*���W7:r�ΐ������&���IWj2+�*������։'�tU��ٰMn虜��n��
�~���.���-�t�<0{�r

-W��˻�
����W Q at 6�=e���x"���gQr}�avK��
�,�X��o���W�D��)�0
�
�P�qC	b�d�8O�&l0�B��h?4O�Ha�kY
YNC�1�����o�sBUJ�-�?P�a_�9p-HY�I-���
�f|�#wi�㒓��L��9i��t�J��t�%$%��t��b���E��;P��k�G'�.��I!��9!�uL�rC
p�%J�H��tJ���$/�
��Mu
�'^x�
�*JR��\$zO(�>�F���J�ǃ�-S\�H�ndD k�2�*H�g@+2G�l�j���2hl(���'u�~%5�KV�ċ��].N�;���w
	�n��E l��=�-�dl�Mu���<:�O�h���3�>A£��v��ߡ�m�V�s��|Ri���F&V
- (�12�g��Y��&C�'�i��ۜlX�4�y
�W�r�Bǹ�R����V��9έ��m���
湍`��`���{K�;%Z𲸮�B��
ڽ�R���fǖ����K~��X��@2�|g��l�w&	@��}d����xer(K)[_�d|�!�{��b����
���	RA���n�<e
-B�u��CiP��O�9�gJI�Z�
�!ݛ�w���|��a
��oYi���Z��a|]�}շf�Jǒk�J�I����VL���8ZZ��__���
<�p3x�sA����3ijp$�w�ﹾ��t{)�c��
ѭ!�����[wbe!ץ��N�y�
}
I�
�F����j������r�S�
��SG|�aķ�@_G��q�<��
�q,=�V��\q;�	�trm��ׯ���jsO����Q�zy��U�+�����>���۷����g�t|r5sM{����w�*B�C�c

��=�G칂�����,h��!)�F��
�Շ3��㤜��C =�X�a�'�2���3�؀&wF��-0�h���S���
-/Z��[�)�L��^Z~��V2{K�orW����׾�+piPF�d
rfի8�О�&6g�r!D�D�$l{�dA �+p0��8������J,�
��iPW��f,�Ozq`�O���G���锷0ɏiI�\�:�y
Ѥ?�I�F ��_���z 6�{ z3A�AVv,���&�R?�����x�/�2�{����zO2_x
��_X��w������Yu&�}x
89Á4_[��V>���
�r�[(Aґ���2����{w���S�X�v5/��c��v����|������C�ȭ
-endstream
-endobj
-463 0 obj <<
-/Type /Page
-/Contents 464 0 R
-/Resources 462 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 430 0 R
-/Annots [ 461 0 R ]
->> endobj
-461 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-465 0 obj <<
-/D [463 0 R /XYZ 89 770.89 null]
->> endobj
-466 0 obj <<
-/D [463 0 R /XYZ 90 106.966 null]
->> endobj
-462 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-470 0 obj <<
-/Length 3134      
-/Filter /FlateDecode
->>
-stream
-xڭɒ���_�[�*���(٧I9q�]�x\�����Z(S�
R�t�>o%@�3�����}a���U�����
���NW��~�oW��}���������1�׏y�&_}��
lg�iy���Ժ���\c���d�+wI����7����CW�����6�n՜~�9]
 ��*���ꅐΫ2/�]}��4~����Y��2~����M̀�u2����a�ɮ�*y��-�]״׃�t��tC���p�K�^�e;
���v�^cƀ�“��:�m�W�i�\x��
���4O�`�����U�AV#
��}U1�_o�&�pp��;	�/֟�0 I����W^�;
%�m�(kr
�����ٛ3�^��R6�r6rړl��I�
�@$z�J�%
E/�K�4O��9l�ۊ:�� ���8�o��!ٸ��#�~�?�w�.�>��an�M��"�š�ȅ�$���yَl�M�["��� �z��e�_'�!{�䵿� O��[���[4
�4�e��
�If�ňd��/���_P�x
_T��h� [...]
�_&?�U�6�	D��D��
+������8�0�e=cy��4��k�<�G#~�� ��%�ɭlˤ�~4<a��
!5@ IA����
d�D<�h̀�*K���veL&
0/�id��?l�^ B����zgZ����}d̀F�@��_�������H�E��5'
N�
��*
B�1
�
r;F/��
���
V*�O#����]?�����{�=�6R;�� 
-|J]%p��2Z=�D�z=v�
`�4Ϙn��p೉��{�0f�.��
-� ��
�g��������U�x�8�N}
|q
u��e��!�Ž=Kd����9n��!P7@ў�)�Д`�m7e�[��n�=�S�Ws�+�]F�Z���ָ3� �G��F��
+���5Nx�3O�u�T'`���GH7�g��SjF���`�Q��N�J̭;`+�8�Q�
�nSn�sI
-����dF����o���4��TrU�O;ɯ�N�Ta���
�g?�"�Jb�
۸��4g�*�1�܎$4U҆p�2F׏@���l�h'��8z'I��
0�ܬ�W������F��z�w7�L�+�#S� ����r�����0�
� 	5*����{R�D���-�.
Qj,�J�S*�Xݳ�[dF��0ɤ�@(���!L�ONj���pU���J�I��_���l�\����Uxo&IE*A��3�?sCo�^�{������
�$����n
-�������_��޸�ΜoA-9�~r�r
�ҝ��s������2�*��6��=�p�F�5�s�!E���Z �7K�-}h¼A|�V!
 C�<��<$�PY�c �
w��}L3i�`�G���=8�ɂp��sG�ӈ/E0������|�#�5�(�Ψԡݔ����˩��}�1艟`�d���b��<M� �n\��S��*3�x*:�W3^�p3
��e�ݟ�B�K}�i{�.�����b!'�Ϝe6p�`�[/$_������ :�3���y&Ѝ�r��S�Ǽ���Z�
�v�m)uLC>
-N��
%�]c�����KP�,
��� }�;H��ݣZǫw@��x��
,�
E�o�շ�޳5�j�<56��%�K2�t�bW��Т?��{*�JN
~%��"����:� �̽�
�|�5d-��K �[
�p����,�7�t �d�}"�
�8	��(	Ρh{��b+9 @!2@� 0>dB	���9N֡�C����K��x�K�
��ݐ �͕��R{
p�ؼ(��R�E�ƀ�	�	��8�>o�^���:��{�6�H����`(֊J�$E)}��򬐸�_��X+�)?�Y�C�%

�,1��4ĉ���S�s�<L���B��g�>T��
��`����@���B�=��EyH�fR���KRZ,�I۴��g���Y�M&�sFJ��{id3idRM �4M��--+�*�J�6�j��G�����s�e>T��

-�j�]"J�`y课
��-�.p��n��ђ:��K33'�
—|�Q�$�`\�u����W�,��=`
y@���u���r�zt,�EA-W?���6���/J��C���⮵�3z��}TR,f�G��
�����AG��>�*D<�O�YP�0�8�!$�X1k�q{&�:��YL�F%
lh,g
_�d��i��3L]2�N�s%���!� �!�ş�
��u�E�^��<Y%��p
�ú�%(��2��,#��|�RbS�Ҹ	]�"��3]�sA醊��2��|��3���/#�G��I�90ñ�
�����}"D�G���<�e]&o?�hЃ3ޛ����82�R2Y ��%D�S[�L9� 9(r�"{w at M.s�'K��A�bI�e�̯m�Q&/�o �0Uje�xSf��.v�X���H�&w2/,k�8�b
��T*��O���������
�_N��V�4O�
K�E��7����<"
�e�8*�4
�䦱�>QJ���o�o��m+��!J)J
-��)�Z�(r#�go��)�k����ycAܘ]��0�;o!�)�
-���)��Y/�t�?�YB�p 'q
��dFG���%,�oÚ���Ŵ�����<���x�*��K�Z,ڦ�z�d<H��31��L�mZ���Vs�U���Ú��Gr��
d[Ͽ� a�9A!��p�.V�>�m`����XL��\����]����v
�
�)�|k
����nS,�Hp	!�,�fZ�!�Lg���[~�i�'z��� ��F_�3i1�Q<�����X����N?J�$ݩ��gƜ���e�q�WH*h%�TE �f��H��0������!�]�t_�"T�/y|
\o��b�o����d��\����b'�\Q֛
-�T�޿ǃo��y��ޙ��j��kp�-����Z�w�k�������uoR�����{k�d�󗕎�����G��v{ ?�%z�i
/��y�t}
,T
��]b6��&�f�w�˞{o�
�I_�� ��U�m��\���2�4��0�1-�F���\���A&�__�����
-endstream
-endobj
-469 0 obj <<
-/Type /Page
-/Contents 470 0 R
-/Resources 468 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 473 0 R
-/Annots [ 467 0 R ]
->> endobj
-467 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-471 0 obj <<
-/D [469 0 R /XYZ 89 770.89 null]
->> endobj
-472 0 obj <<
-/D [469 0 R /XYZ 90 201.906 null]
->> endobj
-468 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-477 0 obj <<
-/Length 3135      
-/Filter /FlateDecode
->>
-stream
-xڝZI������-�{�� E2���q
��ty
��B�"5\�n����8v&'�B(�Z�x�7��������E��v�>�o
��*�Y����;l~�����mԾ�%�
�������p���w	
ś��绢��统~�7 ��w�*7��t�d��o�yw���8���z'I�K^��5z�]��O�2��
Ov����6�`��>��c�sG��$�^��M��? G”cߝ�0=r��.���ۧ��N]s0�6��W@(s{��*z�&�5��I��ն/�u�;���T
o��U��q�ϕǑ>���&,$����^F�.�ˋB��FP���-v�4c��"�L���U&�̝|�йnO�6 
N�Y4�z�茐ae�5
�EY��-
��
g�E��u2�O
7Nz���/xy�����4�a�9�X�:�28X�_w
l�uc��
rBl�	�%�����U�=�9+2�;Eʣ1�Ht�8p���+l\�C��
��5S�m���f��C��'��㋘C�ʬ4�b��̝�R���&��A��u�m�V7�s��,�
���d{w�.��}��x�e�o8�Jwq^�)�
��4zS��2���2��������Q��;�Yh���Vo��Z���/�d0W����Ne��o 	�A�H�3V*�+J��
j�5�Uhl8��@�,�eb׳��o��d���5�� I��<H7�����g4ּ�޴�mݯ�ӥ�.�i
������	-ݺ�
���@t�ɜ]
`ד�qp�Ӽ���i^(��d�Fi���O�P������61��n��
�OP�ʋ�5�B��!�ސ���c۷�Y—r��Q�$A��L�o;`�5�_ w BNl���6�N�w0�[�9#i�T��:��g�v�'��4M���ix��G�y$ѹ;0(@{����=#��g<k
G'C�K���bf���_�����m�<�h��l���{��rFю�V�
7��'�������tU���
�:�Ud�=��c��;f�
l�jU����C��rg��
k�� �
��g���-��676v�϶f��<&����e�X�

�7�젵���`y���_���R�	Z��ׄ$x��$�E��!]��k��Ɂ��8p��mOD�s� ��qq�b���1p��/�
-8�f��xn�����6"�g���E�G�=WWo���BK

N��"������1'^�	�f��'E�r�r�p[f��
���a��+�2-
�l`zuw�4V���.�8����9B�γ
O�Ch~�+A� [...]
-
e�D'�A�݀'�t4�� 
���w
wȻ$�s��B����C�+�
�n �+ؖ���%R���Ú���|K`���
�l�� *�h;ľ��t�t�2�,~�ʔ�P�)*�%�}:M�
jf�<�}:��z�f\E.4'�W��{̒�P�{�C�ql�|�-,'2�bl���_t���P&�D�
t���
-�i�O�\9��	�l����Y�*啖�� !Xp&sV��m�G2���=
C'r):��BXm���'}��a�75BzZF�圼����=��v��)agB�ˉ@����&f
W��ql2&t�\,�U��J�/���
�ށ��exɟU���sȰT�V�'ّ�Άb�p҂Y�%�2PkI`�̸���е��戚8��/��,Rȟ^��IgP�$
>8�8��s���.�BJ�.R����l��u"�2�tN[�M�&'5��<4
�}
��ٍ9S��6�� �}��3��;��c*U�2o�9}�9Ӛ��8���j1NH���e�GBu�vNy��4C����Re��L9M����-M�$8��tﴁ&�b�����s>76$���-x ��p�цxN7�Ƕ��I�
-�4�
��}�h{fB'�����G�8<s-�Ѩ��a��T�R����$�(U�J�cs2��o%��+��5�|�p���:�@}�q(e�Ԯ��4�<��+3��W)�1h2+��PO!�jn!/Wr�%�G"��碆����������8��Y����Q�D��}�l���&,G���I��:#�`�0ِ}O�F�
0M���~%-]Q
G���κ$����yؘ�Z�
�[
-�

l����OW ��(o>��
0
J(G��0
��a)G�]�׹o
ZQ?H�0H
�
cR�I�8D�1�X�D�`U����75�}c��j`���[n��Պ��C�k���U�}|��%U��K
+������at
��"�ڗ�
4�x�j�L����2�\n�C�>�H�Re��;
�Y���ȠH*����P�˧kj_�M�;2�#
RC�
�Xܱ��1$#B����$�_v����#�,���r��W��V��ګ���l�lWIَ󮼺.ەR����$��C��Eay��5�h�Ln!��c�h�
������0��@J
-͒�v��
��(��P�h��h���y�=+$Cn�$��4w�����[J
�^-��C8..~���4;
2)U��QJ�E����I)�j�9
A�A��ksx��a�u�aI>
Pjܰ���r��v���k�э�EJ�5�>�VRT+1��B/�tj€�T�>��)
P@���9��E�R=.])W�u֐{Q
-��puq{�����:��h��n
��
0R��
6}ZH完
7��-�W }�WyW)�

-��9�I���+d_���mȺ�KO���3�3�e��Jy}��
L��/kT��L%g���\���?�v��1�0ѫ������ }��E�ݭD�*�1~g)��,(<g�;�����w{�[&����D<�|�ȣ&1~��(�
�%���E
H؈��������"����C��K]a)g��g�4?@���<>���9}>�-��w�����W*G?�
�|z]��Cָ�¯�˰OwE����2�b�W�'���(�IQ�4�i����g���a��{�w?
t����B��,$e��[������s�;��Z�F�%�}��0��T񈗦�F�5�E �7�N�_|:�����[^
�3F��G��O�W��I�8B�N�LN�x���׏������6Y�'�.�'n������r�fr����
�^��
-endstream
-endobj
-476 0 obj <<
-/Type /Page
-/Contents 477 0 R
-/Resources 475 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 473 0 R
-/Annots [ 474 0 R ]
->> endobj
-474 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-478 0 obj <<
-/D [476 0 R /XYZ 89 770.89 null]
->> endobj
-479 0 obj <<
-/D [476 0 R /XYZ 90 616.675 null]
->> endobj
-480 0 obj <<
-/D [476 0 R /XYZ 90 500.492 null]
->> endobj
-481 0 obj <<
-/D [476 0 R /XYZ 90 279.391 null]
->> endobj
-475 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-485 0 obj <<
-/Length 3359      
-/Filter /FlateDecode
->>
-stream
-xڝɲ۸���B���l=�ss��Y�ĞT��s�HHB��
�yQ�>���
_��\D��h���!w���w����6�w�!OT��|���.��C�@�����k�޻�~��n�-j�|
��)���)u�k�dY�y����
�����C K���ILJ4ە��/���
-�v�!̳�!5�H��w�
���/w���2A��|ڿ�Ȼu#6B���}�{��������a<ju�s����u��+�Ʊ����*��L{�o�au}�.Ӏf��w-�
�YDڊ��Es�/����vm%�B�S7�R���8
,�q�<�l?�����3=C�n�F�W�8l�0uq�e֩�<�hI
]+C�߲�"��>�=�y�z'��;	ҥ�� ����x`l+m��Em�~=����0�V.�ϗ-�Q�~�]I��$�d���k���N����)�<B�u�IY]T�����}o&��.�
�������f8<�S��Q��/~��p�,�^3�f��;}PY<����{�~���&ب�#b�q����
-k��|G��Wk���
-�?���ĽN�t�H�.��as<�L۵y��X��sQ̊��DtA���
��ra�*J����
�?�
-�dZ��)�V�B�
z��
�<�
������h�n G�D\
-�2�5x�X;�!��_X�r<����]O�1:��ާ�P���4W�{:�>e�����~���O�h� Rc�K������
;@�rɳC�y���{�"=J��/ŀO��F�)w��9q
��A�DT7�?w�lI4�y�8[=����[�c;X��pE�\�Xy�w{��=�n7�g�g�x��l��L��Q���ݖr%�c]9��5b��GΚ��4���`�͑� �X�=���|R��ix���p��`�NU ؃N� �M
ߣ��^� V�jS
��C�b����)�yۏ�$�ؔd�6j샞��

�`���H��
�A3h ��
l��9��FN�'��y���A�b�N����Z���� K
o[��r�
��-�EK���A�(؄
���D�����b0e˂�Y
�9%% ��
p�� �4�[
�s�3vº����0!l�/Ų綐�l�S1�Κ��m�dH
�.�dy�8OX
-��Dݮ2�#�A��f‡��W�o4���S��DN�:t��c�h!���̙�E4~rxq�p�0�.r`ؤ�� ��) �5ys�c�daq�����B
-��! .NWn����Ǣwӝ��aӤ�p�4��ZH( ư��5�i���7�[�sb
3p����tQڲ
+�P��#���
[��&z=Vr)(y�
��b�����|0<�4t��ЄU*�	 :�$G�
z!Z

��
�j_�D�MTG\�e�f��B
-A at r���dx6	Q�D<lo�YI�U��(�\
-������a��7n�Qac�FSrV<|�� \�(`�> ��anf�dY2
i
���4�}8�����Q�
�	-�~[7���yD �I0�����5�'��hߝ��̠� �N�0�t1兛�54��+��z��M��%}\��
6�܆��|hL�g�>�*�:C+���	^L��=
y!�O�L"����-�Mg
���DJD��k']S���M:�O��
֧K'�97��

%�A�����1S�[)�N�k�RD�)�� X{B��.4\�А.@�\4瘼�);�8aQ�
ҕx�6G��E�l+b䫈�o
��;��+�.���˺[�)*Y�e�[�8R:T���s4��Q�~Ѕ;lSXS˲x�ت$�n�1�l���H��h��� B5��Ma�v߲k�p�F=�{��v(�f�Ҋ�R
��[>c[���ҀAh�[�u���Ni�2��hm�q���_�'��E��+���ɢ*�%+E��� ���a|>/Oa�QCk.!���]8�	���2::�2�]�mwB5��0AgO �Ms��J����R$�f�O8.
���]ٚI���9�1 �'�D}tפ��������yE�r���3��8
d�	�,t�Ҳ�>�

�f���
-|��!�E�u�۠�ӂ�ʼO��ZV�h���$� ����j]u��(�ۻ�-���x�E�6���]os\�8��2N��.ue^h�x�h)�:
�7ځ��ŝ����tx�m���v#�4���d{p��L90�
�c�����@�g�s̐�4�U
9����5W9�rC�Q��߼4�mq���fY����n���|�
�����F
P��f��
�߃��OB�7�XE�����IF�?���!�����%
�F��s0U��ٓвm���uoe{r�V2��V��'�I	Z�{Xn�
��TE�e���n���-�*���<����}�-2����E�	��
�1-����էi�*�J�����
���
�\�a��`rP׺
x�`���F]ԜcfR��"{���$¹Kp
I�%sL�dp�Ͷ�\m�!�/�⺶�-R�B:r�@��\��W�
�aJJy���'N;+7��%��oS�;�>:
-��Z}��?`���LF��b�����رH~GT��~&��K��ܕ�J�7��>�W�W�
��q<�8�
�lL�x�'|@>����mH�O�E�O��PG����%r1K���$^8h����<+�"x���3):�����e���ģ�{�jsϳ��l}q�͝�3����ݰd1�L7��-!�@�(|r
>@ys�d�m'��Agz�͖Ͼ0 �h�NF{t�\��.�b�=�CE�t}tV4���"B���>~�GDfzX�H|�3����b=�N
�ST\�<��
�

�&b��&�
-�'�2w�
"�#�l�&�J,J-�Z�h�I�:$��=a���ӆ��i��t�ЙN;X���.��o�A��U
!ږ���x�q�xN���W�`���q�Jb\��I{�
/��hi�L�]b�����D8��O�i.8:
�W�B��W.��X���5�+��yH)5���iQ%�1r�`��0�(�@tz.�/
��,��G X�#�'�li���g2�h��)
5���S
p\o���.&b-��A�W4TL����H�i�J%w�aQ
h
� d��ߎ��#�j,%V*�W�Ȍ+8
N���X�n���ڔ�kB�2�j�+U.����¨�Ue��O��أ�5$_���wv��~�B���I�!U�o�o��OMr��0���D�!�Y)e��7>,n�򟟢=��Yߣi�HGKA�`�U*����^�ց	����
*������|~ݹ����%��}�����!~�
��
���| ������iz���=9�Kq�� 2���c�}��$QNx �o�f� Ma,�4�&
-��}�������x�?�I

-endstream
-endobj
-484 0 obj <<
-/Type /Page
-/Contents 485 0 R
-/Resources 483 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 473 0 R
-/Annots [ 482 0 R ]
->> endobj
-482 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-486 0 obj <<
-/D [484 0 R /XYZ 89 770.89 null]
->> endobj
-487 0 obj <<
-/D [484 0 R /XYZ 90 362.542 null]
->> endobj
-488 0 obj <<
-/D [484 0 R /XYZ 90 228.734 null]
->> endobj
-489 0 obj <<
-/D [484 0 R /XYZ 90 118.921 null]
->> endobj
-483 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-493 0 obj <<
-/Length 2909      
-/Filter /FlateDecode
->>
-stream
-xڝMs�H�_���<?>
ػ'b��7���Lj�
0�15<�'���+���H�̞Z-��j}u#���@
<�܅7_�mu0
M-����T
���ȴ`���h������&#mj���V��]��n���
H�@#~sdO����������ȘN�b�q0�
�Ap���V�ꪢi#M�=�(>
����9�L%)���	�V4��C�d2�"
&�.��4;���O����6)�����_LMS�=�CB��,���H����wUՓJ.�j�."D��u�^IOvž��

mj�t�kUƦR��c�w��r�@�'e�y}�fiL�E'y�ỮEI�(G�4ɢ:)iMkSX>�ŧS����!�� k�|g�
����Z�hZ�j>����9�Ȳ=�.|��5��Ǫ�
+�E��pq��Rʄ$��%��P$ m�PcgA��,��cc
�dC@�$[�����R���|�1��eO�����CMU�1U�G��9�Ex.7HnH$c _n8����EM(���F��VWST
b��A�� dX!�ê}&.
d��R8 p�>�E�1��Ųf��H.�Z�m]��kJ]`{Ա���=�����Ǥ���ؖ�6iYw�If�ʀ%�SY��A�8�	��
�{?�X��?�g����ʰ䢫90'�D�6����e��n)ۄ�s���?F� [...]
}�S~��h����*FAY�
�d�SƗ�����(�?���b~�t���>
�6]��kMW� GMY�h�����
_iv��

�Y���y��Y���_�1�K]��
CwNk�X��^/�ٗ>�;w
�cX��yNu|����e�Q�a+/�+<Ƌ0K:��
/y��[>Є������

C�?�s�zZο�	�M�!o�=7 <X�ٛ�4{0�D��	3���a/�W
-�/^��ڄ��b}��=������[�����
)'�_־d
-S
D�<��]��-g��
L��MH�r����I!���ʆ&���"���|��e�i ����G 8w��G"���^��y"l�d�
��6
����_�wD�P�
u 
=��^�A�
-
E��8~�8����Z��Xe��北�i�����c��\�^W�Q�v8�g79�tSo`1�\��;
�g��ցP"8A�yr;Rf� $�0=.[,��tg`d��U������2�];�O�����Q����7~�hW�EzL�^��ʶH�m�����a��-j��,j�6�G���y1'ʝ�@Q��!
+ŭO��w��Q�8ڱUg�⁙{��+=Z�_Tn�&v���bYv ���ؗ��Vsn�{J3��%Kl�|v_��Iz\�vL
-ǫ�
軕�9��\
Wk��P)
�{CU�����T
�썿w���y̱�ݙ��@�Z(

��}`���V�uI�i�@�Ӿ�$�
�4~b�
^-�M5Goy)Z6G��u�z \&�USm�
9E�E�(�4�V�a����Y��'`���f�Ҙ��p��̝K��w�gb �Yf��w&Q�u"��p��K�[
�
-���x�Gϟ�]Q�Ei��
-F��{�[lDaF�=�TN��%b1�t�ĥP�\[Q 抐·�? �k���³xGX��4�
-�4�H®�Ȳ�<+E�X�R�3���E.�M���O���B��
���+��:���,=�I_�
�Xv#`��4R��?����
꟨�U˷+
-^���v�#�d�K�͒5����G >���OVf����}
Xߓ����qݾnYĢ	��$H_'�I�;(�{�T�(w��O���C�r�E4����
��{��u�(����"��ewsN�L�rHC\�E��{�St,*��
>��QE�
�ä�D񸭊�\'}YK�I���n��G�P1�Iy��,�B\U�9�����@
-�iF�"?Q�y�TQ"湎T�����|<]���me>����=������ן��Os�8��d}.�_�,o�$�

W<wM�_fP��
t$
�O��ܧ#�2�ǐ�:m ��&���Ł�B�M�C"���ە-���DS�[fˤ%s]�6����%*�  Bw��A�Ԉhy"��
��
":|D6
UdȚ"�0Kk�Ă�ۤ�*5��&�[�`r0۩��t�1�,̃�/y��Dˉui�[�
I��Г=�(>��UkFDZ�)G����2ec����X��G�M�N���y��D�?�2�b#
k�Yv��o�<�M���1���۰
-��`���
P��
�Q]�!H$#��Q�4�
-�b���V��Մ�������e_�
Y`�`���J�&�hI�oi�6����F��0Ry6T�u���k�A�D��9
��8;�@ѝ����Pd���_?��NuV��Zա8g����CſDɒ��;�`'㪿&=V�ҼG\OE�7}2�L:�vW��r \'�
[�ׯ���;Kٺ�w�޵��Ȝ��~@�U5���

��a�W�h
�����\���hj�����XnJi��8���M3l�d�9��)
y{�R�*)�>9̟��
�E��^�6R񹌙r�$a��Q~oN��iկ�0K��ꡮO���u{~���mW�7ąٶG��I��=M8���7�������
-endstream
-endobj
-492 0 obj <<
-/Type /Page
-/Contents 493 0 R
-/Resources 491 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 473 0 R
-/Annots [ 490 0 R ]
->> endobj
-490 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-494 0 obj <<
-/D [492 0 R /XYZ 89 770.89 null]
->> endobj
-495 0 obj <<
-/D [492 0 R /XYZ 90 551.105 null]
->> endobj
-496 0 obj <<
-/D [492 0 R /XYZ 90 410.822 null]
->> endobj
-497 0 obj <<
-/D [492 0 R /XYZ 90 258.583 null]
->> endobj
-498 0 obj <<
-/D [492 0 R /XYZ 90 146.006 null]
->> endobj
-491 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-505 0 obj <<
-/Length 2466      
-/Filter /FlateDecode
->>
-stream
-xڵY_o�8�0�e�q-�O�٧t���\���
�
��(�Q���N���G���d<�]
*��(�"��Y:����rzvq=���M"9Ӆ�x�8H�0����:�#z��w�D\WC���/:ۮU٤M�Kb��*k�
y~8b��������3kz��5Bw
;�����3�'�s�$vvf��	�m�<����cuO[�>H�A�(@����8I����]�6��
��R��v��ZΊ�M��U�~WS�L��!-�LP3�r� 2�+fj��Vi�߸�kU�h
0��h<
-]?vF�s�0!�?�;ʗ+���z���G��=7�y4q��j8��V�t۬teN�Ԏ�*�ԑ
��dG�����B�=f.*���z���J���^o��Ғ�J���ٶQ�6_���^�y�أ���y��m9W���5�Z���n�6�*U��y�Ί<#��]���.�W�O֫S��uk�'��5�k��*�9����j@��>+���$O�@W���g�z��b3�9 ��D��?p���
��e����^Vz���i���f�c��Zl��
�"4��7�_ԙ�}a���qr7��
!`g�Wu�V���UήJ�f�
G��
?�
-
L.ono�_ڣ�#���]==q���uc��<No><�N�����p�t�B�Jt
�����1-�7}yq�*�sդyQ�Ł�i�/6�k�_�Z�<+�)@�c|� ���H��zZ�ry8O+��#�!ox�R7
9�R�g�G/���q�|�Y��ټ����v�ܺ�Z^�Q}qd0ЇA=�fёn(hc0�O�O�ZS�L�s"�Nf�ɞ�]�
;�4<-Ӑi��:W� @2�*T�T�D�EJ^d�n0ʑ\Ñ��Q�n$�
�$IG�D�"�M��y�'����>hD�&� x
-Ѕ�7�B�m�L�Ԁ#Ú���JEޝO���n��ڕY7i��V���'z�_�"

<I�'��iH1����Q��TT
a�5з=��@�9����Os��7H�c��`gz���P�\>��>O�n���{����ý���	�X�;�<J}��8?���j�M�;U�6����G�N	��
-�QZÔ�
ݺ��������͈0�hðY
��~�!� 0����a�5
�u-&@w��Z�r}�=���q���.�n�)6U�6��m(���[gpx at l�2b���7�����{�2�aG��T02�>��-��!�hG�{�ޚ�I�	p��������$!��9ࠔ���74����%�:�Ө
��H0vk�.(����oR���|���	z1��Pɨ\x8�S�@-UC[#�
-��:�
j�7Č|ю#�Ԯ^Xb�-5lѵ���C�f�u������E+6
(�Fဿ�����ey$- ��hH��c&��HsT ̃�0��`g�[02'�.�-����2ڀ�\�z4�1(�͟CA�3�-�,��$�UTC���3I�
-E(��_
'��S��+���9Q?�0
\`!�]/�-俹�8Ab�,��q$}�
�@��rJ	>a��5rm
�t[Ab�J I��6X
0����6�����L��3�PK�X�-P ���

�	��cM��Y
(">��"1)�)u�� 5~d��b��C�6�`�:�� �:7��l���&�#�&B]�>��yE^��H����+:���o[&٠f	�b)c�t�GH��qxH��lKO����,}%����M��
y���bv��B$� ��~yp3�}�QyY7*���{�V簛& �/
�J<OVuc��(TJ�CH� ���%��
����Y兮�f��ح�#��Q���Y?�7�
-7	��x;�\�plpF,
�~I�����
��w�q��&<{!B���R�Ok��\����g
-
a��_���g�u�I��Q�N#�Ru���ġ|��ɋ�w�\���9��F<ݱ��RrSf����~
��–nO��w�/lI{]h]1�R�M+���$�j��AE�<?MzW�zUվ}Rl�j탇�Cwං=-LA�
v�V�
��g��%ڮYto�sv�X�.���r��
�}c�"
���B���>P~�R������
-p��x5�|y{�S�z=)G �[H5wLe$
��#�Y�($��%�R�,�)�2f�BW���i��,S0`KOm��b[����1�d2~��#�֘��	�%?��~�9��U�P,����92w��^��"bL�nZ�ۊG��-�=�H��B��:ە�X���x!{?h�DC�
�
K�
ȂDN:�xE�},�8�=%:��IH
�o���WU��g���y�ˣ��Ԡ�|Rx�J��h3u
Yw=���&2o/ d<���}�SD$�1\���S����=r���/&@{w�
���ᖈO)��/��H &���to'�z����!�6�N4b+{K�=�[�ͧ�*@ڋ8��˓$9�.���.�ӷ��0y<v�Hعd���Ϗ߷\�;�5}�	7������9�cS��_�6�Df\ܬ}�
gr������
-endstream
-endobj
-504 0 obj <<
-/Type /Page
-/Contents 505 0 R
-/Resources 503 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 473 0 R
-/Annots [ 499 0 R 500 0 R 501 0 R 502 0 R ]
->> endobj
-499 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [314.956 539.084 472.963 548.191]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
->> endobj
-500 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [152.087 327.058 321.452 337.339]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
->> endobj
-501 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [225.562 272.945 508.501 283.849]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/philosophy/why-not-lgpl.html)>>
->> endobj
-502 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-506 0 obj <<
-/D [504 0 R /XYZ 89 770.89 null]
->> endobj
-10 0 obj <<
-/D [504 0 R /XYZ 90 257.148 null]
->> endobj
-508 0 obj <<
-/D [504 0 R /XYZ 90 224.905 null]
->> endobj
-331 0 obj <<
-/D [504 0 R /XYZ 90 224.905 null]
->> endobj
-503 0 obj <<
-/Font << /F70 324 0 R /F90 507 0 R /F72 326 0 R /F60 304 0 R /F81 426 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-512 0 obj <<
-/Length 3540      
-/Filter /FlateDecode
->>
-stream
-xڍ�v۸��_��R��
-o"��'�S'�
k�ݳ�	Ylx
/�_߹��d��
�`xZ���o�o>��"Y%�-��E�.�0Y�#�e�_
�_�������K"�D�w?~پ��}ı��ۋo

�
��W�f�����.2 Z�� �,�	�\�~ �b�x�
��Jt��[y
���ly��k�vE�
t���Q
}^z�����k�>鞑�Vgy��}�
-�A�5�n�^Aw�:χ��<R�2m��ꉛi]uy��&Sou� hg&�K�u���~��
0��������|�Re8k�:�#k�XۭF�x�!#oyHQ�����st�i�8�#�8_sb �=C.Ӻ�S

��/�q�M�WjUu��T�@8d�����gභv4c�u�k�d~���z�C't��t��N�"��
-��9�VS�u�!D
�*e�C>���a�;w=��u��N���/?1䣮t�
-�<�X���E�����
�)�A�5&�2��s��.�Hf�YD�A�VW�{�V����� �x���9���w���>�z�l�a�CL�o�f�@�Y�wqz���Q�jPEw�����q�Y�%p}�	�c���:��2ɏ'!�
R�`�(�;8�k���U%��C=�A�\e�y:�a&2�<#
GK
b)�)�RV��A %�9���u$DmР�$@o��a|O�?�v�l~ P�eޓ����%�X*�H�*11B
�FH�r(���,���P;pt2�3����LD��C��5�o7���Ӟ;��{�<D���A��1*��g�UV2��Uo�vu���FUp�A @�K4Z��++�M�F��L_m���Cm�ڦ>�@�V]�)ʭXw���=x�*eU?s�g����<<�߽�y{w�����|�����w_�w?~yd��
���G� ��C�qT����
�
1X�x���ry�����:ak���
v5�N�Wy%�+���1�)TJ7
��Be��=c����@*�quA��SG�� ?U 쌲�pq��� ��q�J�G�Җ
���MJ
a����@��jTo:��v������Ev=w�g�AЏ' L5�W��Z
�ftF�3T�
��t7�͆��*�>bZ L�
@�\.7� ��;�0�"
�w���<d"(t�n�7{o��b�1>�{�E�1��2Z;#�!?̻
|�x!�#.#x�V�������N� ��g���i�#��%��l�R���$���ʈ{���lħ�
"F��	[4�^
���$�/Kw9F���6���.����{4S���!Ţ�#��祖��`�7.Q�f�A%�Z�m�[ԩ9S
-��w�h ��@�\O��)����H��0��g��9��� 
nq�K��{
=���B���1�>���%�0:K����nS����o|ţ:'�9o�r!rl��@;˫S��a

�,�W��1�=X��5$d�U��f�WO�z��;oP�#��Q�����}���m�qh
�JDNaS&����ޚ�p�۷���1* H��[b��ЄcИ��`%�Ls4M�]�b�����ĐsG���
�U
lu���l�
�t��f�E;��ё��f��,Kt\�2���"f�A�)K%�h����7w���S��M�HƓ1�;����T229b�P��Y�/ $����'K@{"�	�VO�
��yu>��a�)�a�S�	�{�+
$����-�p%r�G����
Q
0�-Ƌ<@b�Rt
-�)\|�+^l�آ�����$�R��������O����3'ڲ�DG!L��0�$�#F�DB_�D���S
-�̅��l
��'������x-�&�I��%�Y�A�q�3S�P\ �y��#�9�E���IG$��6u����;�,�IBb��r֧�H.�e�J���I�庻K�R�@L���;f�QD�9ܓ4�}��;���;�h��k�N��O4�<�{h���%����6�)��CcP
-Arg
l�b)
�rA�Њ�쉟�ye����ڹ�3Tɒ"�sœ�XƢd�@�'M�4�β-
�4"V"
!e��}aLDr!��/	Ɗ�Q:c(9Rs��3�(�‹��4��^��-��"�5�B��ۚ[3׎���)���[���d_�p.9@ҋ����%�I���"ը��Q�4����C7!ƾ|g�
�m��+ƶ'��4&�Ĝ �q��Fu
D:�A�a��1A���ȁ�g�
����(z�;���U�׳)s�&@^��w~h�0
��1�k �{
-�)�}�a e���\�Yn0f���ɂ4�0p��8`o�f)��ݬ�+�ם��'�x�]���j�s�$����:�V�^��/�j<
i��v	6
�k�00i�Ęzqqd?U*`�N*����G�R��u�U��E��#��\�N��4RK�
p�ڲaB1V�J%˰����F�V���X�0��������o1(��bS菝'SJ�g�����	���!�����"��)0�;v�Q4Q��`>�4�0�L)~fo�H(f�#�
&�[��C�0ġ�/
 1��0/�\�\J�_&�{�6��P>a�i?��0D=åJ-��ւ�˴�#,�
V�_)�[���,���6A��C�
�b���6���}] �M�p�
ƸԌi1�1%:�>O�'
-�$�
�T_� ��F�)�ߣ�#�M����8�]�,{�&�
l��i�許��pK��P��X]��*�l��{�)\𙡘;
� ���'ͅ�	
�Y����P�J9
��밈�ăs�9+��48�R-l�5_�hX�u�4/�c�r�����t����AN+���y�4��H*�+�F�s	=M�a���K� �1��3Tx�����z~d�~ �G�!���d�Z��
L��Tu���ie�D<�՘g��]gƉ�x���ts�c��헳>��w�$b��F�������]�y�0
�B�`�UZ
$�=&��s���hikR)@����l7�W��PD��
�!�
@��x����&�
B-r
?~�g0?H���0�/������h�/�%�o��筥�
 �
-H�k��q�Wj�]���Ip��m�����
 �xLۜ븉�������a �x�0��2�S�°
N?�;�p֟�-
 ��$��Ǿ��3B/%������<|�(�˟�}0%ӌ�>=|\1�œ��������5h�)�z�j4�3o��Dkl<��F7
��Ժ"�����$�ٺ�����{0�ꮫ��a�
-g�U�Y��7���dm�'$<
��u��	z����R���i2s%Y�q��K�ŋ	|�oʈ�H2�� Ēd�'2�o�`�e ��lH�̝l�jY,dl8�|ѕ#,�
��˩��ݙ�����E�*��?�7#kb��	�?�ۅ�r�8�i�nӠ�#�7we�����D��]O͟��U|w�6k
͢Vm��pύO֭ʟ�
Ͻ;�[�������X ��gy��6��
M�.���XҼDj-��|
O�w�K�r�8��~
����͛�����
-�k:;
���3s��/k����?Y����/ ʈ�
-endstream
-endobj
-511 0 obj <<
-/Type /Page
-/Contents 512 0 R
-/Resources 510 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 473 0 R
-/Annots [ 509 0 R ]
->> endobj
-509 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-513 0 obj <<
-/D [511 0 R /XYZ 89 770.89 null]
->> endobj
-510 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-517 0 obj <<
-/Length 3567      
-/Filter /FlateDecode
->>
-stream
-xڍZI����ϯ�K��4v��I�e�c-��N;
�
"
-�&���jil�>��������.�Y=���wW�����~���huwX�U
�a�Y��m�on��Y����7�nm��^Wiw2e��yU
-��<5eC��k����o�>_�8�Y�rF��w��t���U�+g��w�GF:���o����+g�n4g�u��+��
��}������-t�a����\��d��y�����P�L��\�ek2��W�'�k-�v {I�mc����s�5n��H��E����c^>
�/����+���t�o �>
Eƶ��[�"{F���@�����l�pMн�
���)iM�'��k�y#�� ���.��B�%9�MR
,/�t�^�(��M��7�K�{
7��ɧfJ:S
-|<�P҂�1;�jɜ��c���:��RR��"˖��b d�B7A��éq el
�d�P�G�ײ���|����NU���:�%�B9d
&e��U�a��Vaۄ��b����\��dbB�=�{5������	N�]��d���<���S�^��Ƥ��\[2[�'Q����_�B���

-?er4�����2o��`�0��(2{<V�.�����@�ec�g�^r��E��G����V�Y9��Zd7��
7,qFcc��
Y~�cbG�릀�}�xs�1)��������N�|o8��6x]Rf�L�B��w�us�&~w
/�ym��]H�8�&��
-_ �Fe�cHl�v���e��<�����j���5l3�l��
YJV�M���9E
?�������p77���6;�+���(S� @[�ph����ɲ�W$�Q� ��<
��.U'���,?\f����ڸ`$
-�I/�V���,���F0;��H���U=��ʺl��2C�
W�E��l9c�"��2-���礆����:o�"�O�nP&O�W���0��z��t
6mB�k�Ξ
��'5�"��R_�Q�
-��c�f*@������Z

�<��e���{]W=���E��9`��uF�q=W�*բ�Kd�A�*����� �9�o ��F�2�-� �*DD����&t�CBd�hh����4����K#��;�-N�F ���f��i��
-T��7��
����j��@A� ��
U�ry�Br�稺�fE��/<2���o������[����o�}'ۣ��l��q)GS�@\do�w1��Lr0�I`\[[�z�F%�`qV &�����ܙw'������GXiu­���
-E�t����"��;C�B}�Ŷw�uNвUb4����e�������
-�ĀF�岙��A1���0��$�[Ɩ��q���Ap*��b5R���Ӡ6�9�R���qB(
-@����ٗM}#��#�52_����DO2Deh��4�#(4�!
��reO�B�	
,(�A}��v~ =���=
�{_Kf@:�
 �I�%"@��&i:)��Z�����v����R]JG�A�`H4;������Z��>���0�X���|��o�q �O>#`6q�N�
-����{)K&Z���S���?"�
kέ �0g��H@�6:��^zD��L
,°�~{|:g�13��z�H�Q��PSV��Q�cw�gu�B�U�Y(�]�q3)��C�:��j���K�r�0�5œ�ǧ&�������%�tef���h�]`5Ck+��^�_�Y�<����#�:��υ]����	��aS�}'�?��������?Ol������
ub�
4�Mcz����l������P#�NZGx�,/�6h�n��&xu�du�
���ClS�;��Y�)��K����L�7�Xl�(�PR�/],�!
ՓXu'0�f̿ �mb�m�g�qk�
�^+����Ð�ν��iL�4Yb��d�;/A�N
<���U$�B���z����2���^HRyS#0����*D���6+�
-
1�dC?X�J�O�S	>;�@K�yO�{���P� �Q��W�
HJS.�Ft�*���ѱ��B��Ag����˥2I�V*iW��P6�C
��@^]U
n:�VU
����m���#�|��#�?&vUF�J�;���`���$\�m���i���%_��
;�m*%l.��n
Tg�v$T6��ck_���ƚs��>ko��
�0*$h]�@T8//�
��$��Z������G�3����Ţ⨆���>�4bv��!&tm���rg�6z��60`@U�x�
�鹴��9Dmɡ+���ڢ*2g�c!�q̩τ��lT����z�Yl-Pj�<� �@4�����X#��bǠ��y��O�6y�٪��<
��Yu�]�_�~��q!���w	�9V]���ܵ3։N�(��4z
|^4�I_.Y4��Ё
iܲ�jL��L����ŧm��
W桳��5��yٙ
�W�r�͢$�o�j�G���bU'����}g\�h���>e����|Ŋ�߬�	q�"xT;�TjB�ځ`R;���+���!-\���r\.�
�{�IzDt��W
.��7
�a+
_�4<䙄�
%��>�pw
0+�d����ʻ��,v5�.�!����v\��=^p#5��MiZ��V�������e�=:���FpLijـ�(�t�\uǹ–1wq����F���L
eQ%�REai�T�7
u��:�Tª��J���i"?$}a(�<�U��3���mL�`�toh�P3�DJZ�
g��VJo��ah_&�����z*5��V�,^�g��g�=a��æ���q_�Y=�]���5gynE�צ-=��
�L'�LֱԗgYv�������Ӭ�QTP�7�ȶ�c��ft-�y$]�x������s�
nItJBL/�Ɗ
[}��kr�D�]��Jv�?�:B ԕ|Tٔ�9��_Dr����֢߀lkw�
`�	�����J�9c`��O�䚶�B���Z{r��w��򢩡O�m���o�QM4_)=������\
�0_Z���′<�?Y{�� �\O�U�HU#���6���|�K*�`�t�h�j=�e#�*/�

[�KU�A��|��'�K�߷c��gڹ�z���T��У��z�4���M�tۨa;kh	՜��rΆJЖ��m>� <|I�zwD��@�#o߿�}s��˻���~��nH��sĒ�/2
Y{`;���9/���*�O�,����;
0���`�j'�mG6LѴ	5"�]1�z3.�E�����ݼ����}�)�8Ʈ�`".�3q����/�~hC-F�F>�Q��+�pY�$���\���Ldu�A]�G�H��FW��q<ǂ4�zZOCE��{R��@
�OϚH��D�_��Hnu����
��1Mc�u�9k�Ug�-mE.6����l�M
��Y���܉l��e{������	+����?a�?_E�}����WA�
�?��
>|�Q?h�
��~��;hK�D�<�gL�~��z�ߗ�Iٿ�(>�d�֡
�j��Y�������?ݼ��n�=,�̶=�x���{hL��EQ9��L�8�:�k�
lZ�
(_����~�'�[Շ���"�*��|�l
7�=��y�nT��ۓ�z]�N����Y:�3
-endstream
-endobj
-516 0 obj <<
-/Type /Page
-/Contents 517 0 R
-/Resources 515 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 519 0 R
-/Annots [ 514 0 R ]
->> endobj
-514 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-518 0 obj <<
-/D [516 0 R /XYZ 89 770.89 null]
->> endobj
-515 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-523 0 obj <<
-/Length 3026      
-/Filter /FlateDecode
->>
-stream
-x��ْ���}���/!�L,�#o�V�%K�R�N*e�$��D$@��f���k��S�V�e9��stO�Xw�_���~���y�����b?^����H�̉b��ߖ^�����"�S��bXD�������qW/�>_y�r
���$]lOW���.
- �Y�N���":-B?������oW�\ŵ��W���	�t�x��y|�����fل��	����{I���N��$�6j��x�K�m���� Z��(�+/Z�{�}t#7/
�T%����r[!��G��w �ݥ�1U^"�v�:����
-ݴ�ܶ�`WW's���#w���V���Vû���5�0�"�7��q���	s�V>\^W]�Ç�ʆi�����
��9Tݱ����'6ykU��2�y_��R�7�9˪`z|
-ق?��ڨm����5��d�~/��ZGQ������e�1�)�AGzx��&?�ȼ

�F~�x,,DX�b =;nr��Z�u�|�6�:Ȋ�UO
/=��h{?r�{M pà��O�Agd)�5��˜4�ž~�`O~���T���UxF�0�
-�ƠHc�,���R�MK���OU-`�!����ֺ�J��j�@�7��
��攃>��]o.��Sm��
�.�G���y+������d* �*�f@�
Γ7C�π�ګ��
<����h�9�
�� �ixaF���G��\���g�)�
s�#b "��P�捅��Cvk�#OH�W�
�cpj�T(zN��{�eՎL�4
��٥9�f
M��
-�]yTMc��
��
-E�x�HF�'��$j�̙M�>w�V��s�ċ
6�%�!�k�V�m�姃�ed�aF%�!Z���,�1��"̧�����'8˩�|׉���u���4+1x���"�rU��<��rt�mu^�'wzhETU���
>��Q���0��&�xy�!/��L��'p=���
�|�+0(�
@L���c�\���f�Sw���ʷd�8k+^�2 @%ng�@�\F5S�lb���E�Y9��%��u�=v��� ��I(�#��t��Z�~b���| N�v�0V#�����l-l !T����d
-[A�q Y|��O�\�����C�džȐ�,�3{�z�g�ċN7<z�� ���L�ZЗ� ;#,O(A5UYtB�QG&�
�K��k
��Y
7�/X>&�`=I~2�djIj�
�����6m�@�>��*t!� �9 �
-��8�l���{
H�(�腝�3��*q���mN���R�
�./x����760�;��a?]*�b����
d���&�C��_-���>q���������a���W� L%)
���@�˒R��g�Rv\cZ��3�pf�>�
)���ȋ��AO�KQ��:��
��!�JNI����1#(��xȖT^��˴�
�鬬�
-���v
"��
&�DM=X �D0�H�$ް�]
-�ԔP�ŠA�/u���ih:*s��� �GY�;�GY,tr�q�
���eDq��M�2Q4��e�l��� �Nط$���O)��K|+9G4�j ��V��"�ā�Vު�(x
�, ��������B5�Zo$,��
-lU�anڬeh|��7i; 90����vo.��.
/� 1�
�R�����GW���xCȬ�J�I�1S� "]�vw�,1+
L2Bo�\ 99��=|����]�i
-�6z)>�
,Ǎ3n-����Ë�e ��?�2v.�Q�e�DJH_��*N�� �./
�3�
F���.	
��ۅ_�Q.�
���K��^�:��}P�I"�!@np>Bj]Ȇ%��U���q��B��v�i�8YV'�W�=�d$��b�HsB���|�6�$]t�3���)di�`�q�m;�]�,ۨ
5^xg�x�=y�9u�Q>���&k���̳�Y9�������Nզ������/dP��9�7!�q�`b� �RD]��Tr>�=50�k�4{]�B�$����d�,:=Er;2 ��
�^n�]�C
f�WJf8��C���s�`�
�\���B�����-^
q�
.UN��
bm���z��%��V3���o*Q�b�S
V��+��

-������,O
���LięU� 9x{����N�K���u-C)w��2Q��q7��	����W,o�Ӧ7d�*��c!���
��`~QՑ�D�FCe����S�|�����f�6t at w���:*j���2�z��|̮_�d��
�
tב��63P��K
-�9Ts}W�cYJ�;M��r����s����
-u��VB+	��꿨%�PQH���m?���e'�����H��k{%~�+AZ�޶�da�7�����Bo,ع~(��0�WԿ�y3`�;��,L��J�(!	mr���1�'PqA��\�O� ɄO�M/�����dRZ ��mó���ɮ���>�-u
qy�{A�W5���*
n����s�����We�׏����X�E�m�OD5+�f
-^�hHΚ�����������|�&����8 HwF����K9�/�#���$#�����W`>�QsL5V�,�2�P��*�y����A*�-*��JSg6���$bА|��V=�Gm��q��7��Q3/�����K���6��l+j"�T
C
��k�X7�
���̼�ĀL��
ቮ6��լ�7~T���g�s�ȯ�S�F_�b��ߩ
CƟ���
�@v�0�L�'�ڕ!�Y1aU������N@6��k^�?� �V
��Xj�P�}~:s��K�a.��wN\���1�e�7C*����M���k>|�5��
���l�S[�dIU6��
+

Wޯ�U����O�*}&�
'����cJlQ��
V�<(�[3�Ԋq0��O��K����c-
�"��>_���%�OH{LH�F 7�O�ⶂ͆�ְ�z����P�dI�R�J#@��P��҇oy�&G-e
��t^�������*筀~��gw���e��WI�p��<�
W��}ĝR"]f�S�����
H�����=���f��U�-8�q4�$��i�Τ����{ÏC�������%�
-endstream
-endobj
-522 0 obj <<
-/Type /Page
-/Contents 523 0 R
-/Resources 521 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 519 0 R
-/Annots [ 520 0 R ]
->> endobj
-520 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-524 0 obj <<
-/D [522 0 R /XYZ 89 770.89 null]
->> endobj
-521 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-528 0 obj <<
-/Length 3403      
-/Filter /FlateDecode
->>
-stream
-xڥ�r�8��P�2TU����=eb'�Lbgcg��f�@���

-A���nti:����@��h4�����a�ޞ�|��M⮲M���~���Uf�(�^���	�~�:oo>S�M��R�,�w�l��mC��bW6�c7�
/Z�y�������k�+�ֈ6I���g���
- �[�� KW
-�^�~ �juw��3�f7���y�#n���<�i��E�N�?b#p� HN�S.e~(	��	8��߷���u��9��^�0���w�dr��S�M�6���'Ь���׉
$ �W�@q��M1�k�0K���h�� � ��.@Y�,a��9�}yʓ�������XR�l
-[F�H%dO-��%���@��
iB�B��˂�����;	
-�Y_Di��6�#�ՔO��8X���a�ф+��Y@��ccO�E�-� ]�ƖI�ΕLv�C���2��ص��ȸ]�7�-IjrE�'�4O3�K>.mW���!�Y/��5��'y�����}Phm�Ϋ�̋G�fW
E)y�>���-�w���n�D�ȼ.�&����s�Je\�
dū�Ȑ�-�
і����Nw�^� �%	��OR��
 ��XT
-J
0�x4���9Шrn ۖǼ�3l�[I�q��
jZfC9
�� :��?��y�v���8<=U�N�+OU�c�K��F[�h��E_:�S%v�'ȩ�j!������g���`Ȱ+?�#W�9S���
;��d�!��^a��3���vh
-�ۏ=�@
5�N�!b��XJ
���/	
�ԩ��g����<� lϮ�E��E�A��R):^4h��!h��H�P����:�Rʲ�c�>U<�o�I�ֈ��y�T�v�؟�P`s���0��	�'�o?�|}s}�C�����n��B�D!�G]ߍ�
-�L��
-� J
�� �A�G�+��f�(�p��*s�v�CSh<>\@��EC �LP��p��\�(�.
�
-P~��rG9M��NH�|k93���Fm�1��
�@��8u�h��� �Ȧ��� 6��
EKh�Hs��TU��"��zݠ���z�w�b1C�S�����b��B"�i��h#�`c
y ̉�V���(Q�\N
�^M0^*��
- S��4�S�[�+ �'M_������]e�t��@��6�b��g��
6��q+���o�ԥ�=¥��*5h��]F��L"{г� ����V�H~>d�js	�3D�3��/��,�I�7b�P��T1�[������!�
�P����$��c[A��FO��>bp��f��$�brdJ�:��uc�
{K`K��
�#���g:��VcZ:~/l�{\b��ԑ�m`�ο�.J�q���+n���2�
�%��~	;C#�j�O/Rw
J[���)I��%D�\	&yʑ�#h5�K�X�(IÏb��3,�{��G�P�Os
�q
�ی
��_�e��(�RC��$���(��i�z
�D��#�`�_���y)�,�;�~
�:t���bեS�Sc0���q|Ɇ <*�3t���)Y����k\%�I;֠����^�~Am$�c<�ǬF$��
 \5J8���h��s�=�Z� �eB�h:Q*���r
V��1;�0�
-�7��
&�a
-f
AuC�$�Ƹ���oh4Vތ����]��E�����]
�V�''
-a���eY�WV���Y`�qA��T�����SP�9��l26����W��oo����'�LB}��l��%5��PU�|U��p�|��1O_Q�a�H�ё���$���Ih����9�F�1�.�'��x��aG��m���;�(Tr
�x'Й`��	B�
s�A0ڏEof?�n��)�a+����0�
8���ZE��T���:� ��ɨ<8{�g&�t
��	WY
Q�6s�A9Xl��O�	������o�Fj�mP��!_
-���!���a�V�G��zMHO  ��v-
�[D�u��t�����>���]L�8|��M��'������
I��t����^q��T�	�ޫj��{ ~O裏퇺^b��o�!�q؉jH��Jah���|�Cm��Dnz9-&�n�؇p�0��Zɾ���R��X������
�h�:)sg�HQ���i
�����'�_�}����+t�|
����ӎ�˫�W�ss�C��~�����sO��5��ɏ�K�����]
 �B\�A'�[�Fಀ;�,!9�{^�uXy������4����i9ePn�

�����ߜ>��D�jP7 ����0&T��HL�Kh�5D�FW�%ʡ".UU�
��{����9�/M
�
m�cO �C���>-eG�)Rm6i0;QQv _*��@�/�W�V�<�t 6�[D1%	M�ɸl8.�v����ۆ4�u��V�|l^����^]�b�CGS?M���nF?���t�c��i��
-CO�,�ʓ���Sys��Jj�'�.Z�#��� Fb~6�X�����ua��:
-�S�\򦻄�[˲mR���"O�"��
{r�P�x�5 at c���٣
@��� :��"�e2c�:}��e$cȗ���^�hi� �x�$
g�c<	uc�u������ByY��Z��g�L�XD�
-��H%��1ڒڹ��
��?�-�ם��f�u���
��\���ٝ<�,�}8��1Cd�콟��$�
� �֢����m���mĎ��(��VfrI�|�U�K,��B.٥��	�Ps`�E�}�z�oz�]
�̻��Ω��G�͞�<����
���Vϸ��l�)���ӫ����^�m�p�"��ibL�O
]���w��ͥT�u������ƾ��O�'�pAo	��K�Sih<�q֏����I��aC���E�F� v�
��4z!� 7��I]����Ke�(�˒�N�}�8���
��#
"���
�\��Ԗ��XU��^����uq߼^"6]�<�� ����%�)�V�^�5���ᇊ�*a���R�Tr��!�Q6�Lf�7�Z&`s�D�f��tRp�X�bw�Bs�=��(�M}�E�U�G����3����*���k�0�M�:���Z�7{����˅�9עe�b�~� ��B�5�ďG���,��
-�B���}h�?�����*�*�z�!����9�V1œP,�G��2�k�i�뙚X��X sp��7�8�?�*�
�3�I�U����'BR�{�O:f	ɮ�s�|�)ǎ.ݏ����R���Z�y��&�����{W�ɒ �w��$k��A����=5����:��gys�]�
-������_(>��BgB��<o� m���Lv��m\�#ǽ�Ro���e�[���|�{/�`�>
)�}��˗�� ��ّ'6��m=I6n���u��u�`N��b��c�E��&�}-<���3w�zI�+
���D�����e
g2���0Z�
-endstream
-endobj
-527 0 obj <<
-/Type /Page
-/Contents 528 0 R
-/Resources 526 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 519 0 R
-/Annots [ 525 0 R ]
->> endobj
-525 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-529 0 obj <<
-/D [527 0 R /XYZ 89 770.89 null]
->> endobj
-526 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-534 0 obj <<
-/Length 2577      
-/Filter /FlateDecode
->>
-stream
-xڕYYs�8~��P�e��1���}�$J���dce��f�&!��Tx��߾�+t6[�2�n���n|݀��ae�^_����~Z�،'X����Z�^l��՟�
��޽]�Ad�q ������ns��G��fw������y�o��*=]����ʀ�ve�n
�
i�i�9.|���ſ/��*�\�6m�׬����I��r|����}C�M^�Lx�
a�k�v|���0i������X�vc��H��J[���db{TLxY��I�-�󆩛���BeL��I?�.�������/��C����4�%zZU��7y�V�������K��$�߁mƾ�;���Amض��m���jTͦbJ�6�ح]�@����4{�6X�}:�6�≻�!w�cR�2�(�$m;�3��ct�9���\_�6���n{w�۾��I��$��k�T
,��)A
C�(��)iu^À�u�h�04NU��B`4�C���l�� '��
|T�k�2�V�d�"0G�=�����s�ÒfL��l���u�įyFQ�=/ [...]
-d�@2k�I��,���)���tmu��"��:�>����x��� 
-G�i���x<�	Z��72��� Y{�9
-�sR�����NJ��ק�U��AD����0YDUS�	���\qd��������H� i�l�j7�9�@���T?��r#>lxhoƌ�M���
�Dm��ȼ�(H<J ��
p�;�iu:yR�?<�r|mK��O�O7,�����=��{�%��f+�������� ��������ڷ�x
�Z�Є� 
�Q
$�<�yh�L-)�
5t8�!9'oȴ0~���T����w��J��k��_��D�2�V�)k�A�{�r�{v'е��	�J[�
Z"��Oy���!/#��y�B��2A��Й�M�چ`�پ� �A��j�R�ZH�P(Y.�2DU�
ۣJ�z(�IX����u�H��+��V/X�|^�ֿ�8rFAe� E��c۞��~||4egV��0�P��ZDrm3�M;Mw�ʕ놦�y�c�I�o�L

$`8��_ �8�
�?�
F8U�9䐯;jJۋ����<�����T8!�_u� �9�4�˲
��qI˭dɇ.iG���iD�� [...]
-�;b�H�/&Dn��yh�Y��D��%���
�v�G&Ϙ5sb̩z.Z�#�@G[gi�^sLä��_�tp����
���x���d�ry�݇'�I��h��)Do��0�b��.q��W���kD6�?M��~a�r 
����������|�	�?=V�pN
1��D^�҄��L�z�"/����L��Y���h�41��v�&83!���A-��	��M��вmN3�d(o�H`�Ak(n���Ek�<Q��I/�6?V���J�_G �N,K�}]��*� 1[��L��
e��K4h̪-�<B&le7φ��]�&��z�z=���+����z�L	l��v�~ ��p�c5�
-��I�����D+ e%i�?]��	*&��v�C����u��M��"pL࡛\�t�|��/���8E��b�H9�m�ln>���Oy��ͻ�p���1
��en�g
-���{���j_�`P�S�/ܔ�
�k�ֹ�pĶ\�x�QK읳���<A$
-�c�`£r|J�5+�4 
�~�Ё
�t���;HJQ_ �_��G@�݇����^�
�D�q�K�?B�⁥�|[~Mj�������e:�U]��Ջ�Vv���z�x�oI�Y�u�
-p�)t38�W�a
=r�3ݛ��O����Ђ=.�/G_�
����AA���H�q
g^� k[�m�_��H
9�ӆ��	��p�n
Z�AwnX����<G�չHR�$k��%�i���%3��TK�CR���8���~�!ڻ����T�M������V�i���n�%T��b9�W�G��⣃�?�-FVo�Yd9q I0��IX
����l8
��:a�bI�Ŋ%Op�k*��y�BbZ�
�=���X�ر�xb��Q'�fGơgU��j.��� ��%������6]�βb���P8�#Ȝp[�W,l�r<=$�d4�A���szI
���ӹ e�7
��I
ʨ$

|�q���R��U���+��P
0_��� �\R
-���@��!��<UL%=���J4�7��;Lأ/��z�%*�{ΐ�WɘHy�JU'��z�d��Dy
F��>x�|ʥ��t5Կl���ޑ�ϖƶgµב��sL7ry�g�]�u���[0
V�ߦ6���\�

�gpM�Bӏ闚/��e��(�61�
!\oO��e�qW1���	�8t#z��|`zz�ѳ
�R��oY
���_R
�� �P��{�}*�O����Or.�%e��֑��Td���?��3�B
����<t�F�����ar�V`�{�u��>΀xz��^�/��X�
-endstream
-endobj
-533 0 obj <<
-/Type /Page
-/Contents 534 0 R
-/Resources 532 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 519 0 R
-/Annots [ 530 0 R 531 0 R ]
->> endobj
-530 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [258.676 536.149 428.041 547.053]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/copyleft/)>>
->> endobj
-531 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-535 0 obj <<
-/D [533 0 R /XYZ 89 770.89 null]
->> endobj
-536 0 obj <<
-/D [533 0 R /XYZ 90 417.177 null]
->> endobj
-14 0 obj <<
-/D [533 0 R /XYZ 90 112.061 null]
->> endobj
-18 0 obj <<
-/D [533 0 R /XYZ 90 77.486 null]
->> endobj
-532 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R /F81 426 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-560 0 obj <<
-/Length 1100      
-/Filter /FlateDecode
->>
-stream
-xڽW�r�6}�W��L�J��Ng_�8N��j��d8�I��f�����eɉ(y���={�X`D�3w���`3����`t.��Ч�3�9!v$����Թq9"ސ`���t����2�p8a3	6�ED����xp7 0�
�H�$�|���/  
�Y�9�2������ o!l��!�B��$��:�ѹ�v��#��v�[��7��I�~���&Uݎ���#M�A�zy�������I>)b�uy�^�p�=��w��e<�`��ҳx��ã�[B?�87Cr黔n�آ��#����a��D�eOX���3U��%�
 �Ty���{�?��e�VX��<�}i���9��e���i�;�X
I�hG�:Qv�TU��uR�;��m&�绌uGe��j��(Mnu�W[�;�sȐaӞ��†}uu��/�d-��'D��i�r�ܥ�%ʡ!
7��
�f�$�����FZ�k�l�}�(��D?�0��
4^t�I��I
�
[O�T�^�F��"]y�p�r�(v�vK^�����T�jki����V��d�zy� ����E�:��1�$q]5�Рt����0 ̥r��� �A��]������̀	s #��%hp�
-:cOrwU����(
PYa�=�8�ҥ�G�I� ��U��T�
T�[?տR2�ٓ8����
�e\�TK����
����!)�>�z���%��j

z�b�
#Pǘ�-�}G|ϬR,��ew1�� ЃqR�Y{�@}���e�h8i��cR�����v�C_��+�'E>�{je�2��#��9��WU���"���}W���}���I�>��Kqõ<f�us��痂i{���џ�/�pI/{����r
-�6�^�V�Y����5����pZd���L�t���q��=w��d���<�"	��y���6���]�%a����M�uo�gS�䮿��R�O�vw�|�G�g,��%��

�$A�	�
�\�N
m�_�n���t=	B�v�Ģ��W���rW�
A��m���YJ��H�wV�~��0�5
���
��C�n�����DJڬ�
7v���]Ɯ�r�q��?�"�
-endstream
-endobj
-559 0 obj <<
-/Type /Page
-/Contents 560 0 R
-/Resources 558 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 519 0 R
-/Annots [ 537 0 R 538 0 R 539 0 R 540 0 R 541 0 R 542 0 R 543 0 R 544 0 R 545 0 R 546 0 R 547 0 R 548 0 R 549 0 R 550 0 R 551 0 R 552 0 R 553 0 R 554 0 R 555 0 R 557 0 R ]
->> endobj
-537 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 663.025 513.996 671.881]
-/A << /S /GoTo /D (subsection.8.1) >>
->> endobj
-538 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 542.354 216.421 553.233]
-/A << /S /GoTo /D (namespaceparma__polyhedra__library) >>
->> endobj
-539 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 532.302 513.996 541.278]
-/A << /S /GoTo /D (subsection.9.1) >>
->> endobj
-540 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 413.773 513.996 422.63]
-/A << /S /GoTo /D (subsection.10.1) >>
->> endobj
-541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 391.303 513.996 400.279]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 368.952 513.996 377.928]
-/A << /S /GoTo /D (subsection.10.3) >>
->> endobj
-543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 346.601 513.996 355.578]
-/A << /S /GoTo /D (subsection.10.4) >>
->> endobj
-544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 324.251 513.996 333.227]
-/A << /S /GoTo /D (subsection.10.5) >>
->> endobj
-545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 301.9 513.996 310.876]
-/A << /S /GoTo /D (subsection.10.6) >>
->> endobj
-546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 279.549 513.996 288.525]
-/A << /S /GoTo /D (subsection.10.8) >>
->> endobj
-547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 257.199 513.996 266.175]
-/A << /S /GoTo /D (subsection.10.9) >>
->> endobj
-548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 234.848 513.996 243.824]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 212.497 513.996 221.473]
-/A << /S /GoTo /D (subsection.10.11) >>
->> endobj
-550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 190.146 513.996 199.123]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 167.796 513.996 176.772]
-/A << /S /GoTo /D (subsection.10.13) >>
->> endobj
-552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 145.445 513.996 154.421]
-/A << /S /GoTo /D (subsection.10.14) >>
->> endobj
-553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 123.094 513.996 132.071]
-/A << /S /GoTo /D (subsection.10.15) >>
->> endobj
-554 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 100.744 513.996 109.72]
-/A << /S /GoTo /D (subsection.10.16) >>
->> endobj
-555 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.17) >>
->> endobj
-557 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-561 0 obj <<
-/D [559 0 R /XYZ 89 770.89 null]
->> endobj
-22 0 obj <<
-/D [559 0 R /XYZ 90 644.359 null]
->> endobj
-26 0 obj <<
-/D [559 0 R /XYZ 90 609.059 null]
->> endobj
-30 0 obj <<
-/D [559 0 R /XYZ 90 513.756 null]
->> endobj
-34 0 obj <<
-/D [559 0 R /XYZ 90 481.21 null]
->> endobj
-558 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-595 0 obj <<
-/Length 975       
-/Filter /FlateDecode
->>
-stream
-xڵX�o�6�_��Q�L)~��0`k� ����ۗ��v�Y�+�m��~'�Nϣm@~��#y���
�����k���5����|-
�
-�
�;¢����UD�Q�������݌G��w6��z
��g�~Iu�O2��
�H��&�7�2_��s��`
e��_h
e:�5c���")�$^�G�P&�<�/��)�@��m�TE٠lᕳ5����
EB�^�	>z�S)�2��Ӳ��C4(È��
Z���ugJ�D��C|���2p���X�{��"J"�)~����Dp�ȷ�I��ϲ
�V�ͫ����.���
�pE��Э��Zrޥ���g�c|V��A
����KBv��4�I-zѠ�˥S>i�^���v�[b��Ma���$�pp�D�„����N4o��Զ�|�:$��
щ�V�T�4��0'�0��if���p�x�?�8_��ʅ��V���V�N�2M��0� B"�L��T��ɑ)%���Er�Y�/���&p�\b=��$ǣ*��aD��u��h�,�'�-
_�>@c4vwFo�:jKL�aQ�[Z T���M]O����m�~8d����俷K�Zf�C�Y��נ�%�O;�!
����?�G�-�<�k�f�>�{x���j_��y�`���lpt쇲J�y|��'�0�X�Q�
������iT��6[���ȫ�s
���d��e|�o�Gh�9�I
��b2_9�1%N�n�؀i�@si˪�oܙӸ!zw]߾�+N5^����(4���5��
-Lk�L�
7��=kB�2
��2�ɮ��z?6�
b�F�Q��"��b#����Ѷ9p8
�����,�.I�RI>[%����
Ch���dM����/��d�~_'�*���� k���\"��tF�^�|Fv�V���5}W'X�J��~N��U���߿_͖x�"{�-�����f���
��(�z�9����W�����b�
-endstream
-endobj
-594 0 obj <<
-/Type /Page
-/Contents 595 0 R
-/Resources 593 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 519 0 R
-/Annots [ 556 0 R 563 0 R 564 0 R 565 0 R 566 0 R 567 0 R 568 0 R 569 0 R 570 0 R 571 0 R 572 0 R 573 0 R 574 0 R 575 0 R 576 0 R 577 0 R 578 0 R 579 0 R 580 0 R 581 0 R 582 0 R 583 0 R 584 0 R 585 0 R 586 0 R 587 0 R 588 0 R 589 0 R 590 0 R 592 0 R ]
->> endobj
-556 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 709.994 513.996 718.971]
-/A << /S /GoTo /D (subsection.10.18) >>
->> endobj
-563 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 687.437 513.996 696.413]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-564 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 665 513.996 673.856]
-/A << /S /GoTo /D (subsection.10.20) >>
->> endobj
-565 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 642.442 513.996 651.299]
-/A << /S /GoTo /D (subsection.10.21) >>
->> endobj
-566 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 619.766 513.996 628.742]
-/A << /S /GoTo /D (subsection.10.22) >>
->> endobj
-567 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 597.208 513.996 606.185]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 574.771 513.996 583.627]
-/A << /S /GoTo /D (subsection.10.24) >>
->> endobj
-569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 552.214 513.996 561.07]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 529.537 513.996 538.513]
-/A << /S /GoTo /D (subsection.10.26) >>
->> endobj
-571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 506.98 513.996 515.956]
-/A << /S /GoTo /D (subsection.10.27) >>
->> endobj
-572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 484.542 513.996 493.399]
-/A << /S /GoTo /D (subsection.10.28) >>
->> endobj
-573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 461.865 513.996 470.841]
-/A << /S /GoTo /D (subsection.10.29) >>
->> endobj
-574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 439.308 513.996 448.284]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 416.751 513.996 425.727]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 394.194 513.996 403.17]
-/A << /S /GoTo /D (subsection.10.32) >>
->> endobj
-577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 371.636 513.996 380.613]
-/A << /S /GoTo /D (subsection.10.33) >>
->> endobj
-578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 349.079 513.996 358.056]
-/A << /S /GoTo /D (subsection.10.34) >>
->> endobj
-579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 326.522 513.996 335.498]
-/A << /S /GoTo /D (subsection.10.35) >>
->> endobj
-580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 303.965 513.996 312.941]
-/A << /S /GoTo /D (subsection.10.36) >>
->> endobj
-581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 281.408 513.996 290.384]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 258.85 513.996 267.827]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 236.293 513.996 245.27]
-/A << /S /GoTo /D (subsection.10.39) >>
->> endobj
-584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 213.736 513.996 222.712]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 191.179 513.996 200.155]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 168.622 513.996 177.598]
-/A << /S /GoTo /D (subsection.10.43) >>
->> endobj
-587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 146.065 513.996 155.041]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 123.507 513.996 132.484]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 100.95 513.996 109.926]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 78.512 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.48) >>
->> endobj
-592 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-596 0 obj <<
-/D [594 0 R /XYZ 89 770.89 null]
->> endobj
-593 0 obj <<
-/Font << /F70 324 0 R /F11 387 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-631 0 obj <<
-/Length 1202      
-/Filter /FlateDecode
->>
-stream
-x��X[o�F~��� �� ì�J��M�lڦ��>dW㱍��������=KV��
�3�~�wlL
l\�>
{�K�
��K]c816�-�����x4�է6/�(��:
�W���ư	C�q�To%����
{O=Dl��A�3¤��
c �1�/��İ)�gl<����F��羦�x�ٮ�	A�(�A��<��39�?�Fy�/-�Mtw}��aTDY����e��R3�6��_���>�<�L�nv
�~��"�;�~��E�I6�&����F��4�(6�(-
Y���"�|�yE�hH�E<3K[T�)&g�s����ץ̃2�[��LP�w
"�e��/@����*�o˧�f��Ι���	�ݳ��"�q�
~j������ܕ�=�?,�Q��g�c��`XY
%2[����PΏ% ��]�w(�,(� ��Q��� #
a
-~6�7���,[dS��=و:ղz\�x�J<�Z��*�
��c+�#�a�z5�Y���Gy$
��
F2��
-K��{�����	s��ld{\��M�R�p��Y�WY��ފ2_��~[��+
��X-���|R�� �͟/Q9S�Q
ɉZ�e�Q�oŇ7��]�>��>�e�
cFA
e_���w�j��#̤�)x��	��z��O
��rKze��mH�:=���M���-����%(�\�(��
;�w��}�_��|�Pc�rh
-V-n�˹��|��!sН)?�gT
-�Y`Q�|� 鷼3R��y
:4� J�8r`���{9��K2-7A�����q��y�A	�q�G������u���jkq.�m׵���%�}"U
��0��ϖ�Ɂ�����/j�v�����
�̡7��+[������
�I+�P��r�+�o�y,H�(�*J�(�q`X�,�o�q�-��;�8
�����v�д
�-ٴ�2��4��[�++t.���Ʀ�n�M�:�bs�{8 �4�Πuww�m�?~�
F��x�w0�J�WH__�YG-R�/�h��+
Qk�
�&;���{
�R�)�z
R_w�
�"���\��
9�_U�
�Vq�	*3�+�
�6H��`*���ư�H2�ɂ����҅
6�aC�:���
-n�@'Ȫ�i>H]����
��Z���=��Ouk�����`0ZLϦ(̒�x}�sh�D���Q ��
�@LjXD�J����0�7��?�Ԏ	�ޱ������:a��
b����4��
-endstream
-endobj
-630 0 obj <<
-/Type /Page
-/Contents 631 0 R
-/Resources 629 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 633 0 R
-/Annots [ 591 0 R 597 0 R 598 0 R 599 0 R 600 0 R 601 0 R 602 0 R 603 0 R 604 0 R 605 0 R 606 0 R 607 0 R 608 0 R 609 0 R 610 0 R 611 0 R 612 0 R 613 0 R 614 0 R 615 0 R 616 0 R 617 0 R 618 0 R 619 0 R 620 0 R 621 0 R 622 0 R 623 0 R 624 0 R 625 0 R 628 0 R ]
->> endobj
-591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 709.994 513.996 718.971]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 687.923 513.996 696.899]
-/A << /S /GoTo /D (subsection.10.47) >>
->> endobj
-598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 665.852 513.996 674.828]
-/A << /S /GoTo /D (subsection.10.49) >>
->> endobj
-599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 643.9 513.996 652.757]
-/A << /S /GoTo /D (subsection.10.50) >>
->> endobj
-600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 621.71 513.996 630.686]
-/A << /S /GoTo /D (subsection.10.51) >>
->> endobj
-601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 599.639 513.996 608.615]
-/A << /S /GoTo /D (subsection.10.52) >>
->> endobj
-602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 577.567 513.996 586.544]
-/A << /S /GoTo /D (subsection.10.53) >>
->> endobj
-603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 555.496 513.996 564.472]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 533.425 513.996 542.401]
-/A << /S /GoTo /D (subsection.10.54) >>
->> endobj
-605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 511.354 513.996 520.33]
-/A << /S /GoTo /D (subsection.10.55) >>
->> endobj
-606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 489.283 513.996 498.259]
-/A << /S /GoTo /D (subsection.10.56) >>
->> endobj
-607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 467.211 513.996 476.188]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 348.701 306.642 359.58]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter) >>
->> endobj
-609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 350.723 513.996 359.58]
-/A << /S /GoTo /D (subsection.10.1) >>
->> endobj
-610 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 326.63 351.473 337.509]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
->> endobj
-611 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 316.577 513.996 325.554]
-/A << /S /GoTo /D (subsection.10.2) >>
->> endobj
-612 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 292.603 362.293 303.482]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) >>
->> endobj
-613 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 282.551 513.996 291.527]
-/A << /S /GoTo /D (subsection.10.3) >>
->> endobj
-614 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 258.577 387.767 269.456]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) >>
->> endobj
-615 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 248.525 513.996 257.501]
-/A << /S /GoTo /D (subsection.10.4) >>
->> endobj
-616 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 224.551 350.149 235.43]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) >>
->> endobj
-617 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 214.498 513.996 223.475]
-/A << /S /GoTo /D (subsection.10.5) >>
->> endobj
-618 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 190.524 304.357 201.403]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) >>
->> endobj
-619 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 180.472 513.996 189.448]
-/A << /S /GoTo /D (subsection.10.6) >>
->> endobj
-620 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 156.498 279.275 167.377]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-621 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 146.446 513.996 155.422]
-/A << /S /GoTo /D (subsection.10.7) >>
->> endobj
-622 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 122.472 264.142 133.351]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 112.419 513.996 121.395]
-/A << /S /GoTo /D (subsection.10.8) >>
->> endobj
-624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 88.445 295.145 99.324]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
->> endobj
-625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 78.393 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.9) >>
->> endobj
-628 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-632 0 obj <<
-/D [630 0 R /XYZ 89 770.89 null]
->> endobj
-38 0 obj <<
-/D [630 0 R /XYZ 90 449.924 null]
->> endobj
-42 0 obj <<
-/D [630 0 R /XYZ 90 417.629 null]
->> endobj
-629 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-684 0 obj <<
-/Length 1066      
-/Filter /FlateDecode
->>
-stream
-x��X[s�6~�W�-�L1�Y���M��lBڗ�#�p<56�e[��+[2�@�i���t��s�  {�Lz�_
<�c���x8Գl&�������:�����TQ��'���c9�Nz/=$� @j�m9.𗽧��%�@�x.��Z����c�
�G�����@����a�rp�RG[�tɧ�$Z?�yʧQ8Ky�6
hX�I
���}Q
��<JA_��l[��`��
�(�O���ݾ{B��Ǟ��A솀�ؤl}�-�e���r��(S˫q��E��@s!{74�u–�)�{�L��Q��5DM�
j��mF%BvA���z�[��Fq.�yj"�H���D��)_�\��{�=��\�5�}
��`��"�̮6�kqzM-�E�#.����������B�&��ȲP�V�U��f����퍟R֕I
#{��l�fP؍D,R���P�[�f ��Oa<�q������2>�\�Ź-V0f2Vܳ灛d)�v:L�E���_��0��g���ڰ���\�g:��+�v-�
8�6���>�iO)�?�a�צm�o�������(Ɋ
-�x��mؔR��s������Aͬ5�;�gPx9`ӡ�z�!�M����ow@D q�A����|z��r۞�n2l�K�k��'�v|/�NQ� }�I�q'�`��̑y��K�?N����b�P�^�
�w�t�(H��re��Td��E&l��%���6�#�J}�s��6�R	?�@����*b_i��.A�wdw"��[���'�&�Z
Q%q������ow�.��<�U7A���
-�8w��#�8\��aЦ׉X|��a�v�8Pe���Q���ʻtv�ux�K>	�bY�_
v��
L�>
��H
���W��
� r
\M�
W��
M���$�ٖ]_��oVOL���
�VO�-'i-�Y��;5�����3��;
��Q,{�E<�&����lnuD~�q��E�
��
5[v�[;!
J:��>�|
E]{��6H?�og��������s��~

fE�����Y�w�;���.�ڷLRQ�I\�2�X
F����
,-
-endstream
-endobj
-683 0 obj <<
-/Type /Page
-/Contents 684 0 R
-/Resources 682 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 633 0 R
-/Annots [ 626 0 R 627 0 R 643 0 R 644 0 R 645 0 R 646 0 R 647 0 R 648 0 R 649 0 R 650 0 R 651 0 R 652 0 R 653 0 R 654 0 R 655 0 R 656 0 R 657 0 R 658 0 R 659 0 R 660 0 R 661 0 R 662 0 R 663 0 R 664 0 R 665 0 R 666 0 R 667 0 R 668 0 R 669 0 R 670 0 R 671 0 R 672 0 R 673 0 R 674 0 R 675 0 R 676 0 R 677 0 R 678 0 R 681 0 R ]
->> endobj
-626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 269.681 718.971]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.10) >>
->> endobj
-643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 673.667 305.098 684.546]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 663.614 513.996 672.591]
-/A << /S /GoTo /D (subsection.10.11) >>
->> endobj
-645 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 639.242 264.152 650.121]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-646 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 629.19 513.996 638.166]
-/A << /S /GoTo /D (subsection.10.12) >>
->> endobj
-647 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 604.817 299.569 615.696]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-648 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 594.765 513.996 603.741]
-/A << /S /GoTo /D (subsection.10.13) >>
->> endobj
-649 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 570.392 331.36 581.271]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
->> endobj
-650 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 560.34 513.996 569.316]
-/A << /S /GoTo /D (subsection.10.14) >>
->> endobj
-651 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 535.968 330.453 546.847]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
->> endobj
-652 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 525.915 513.996 534.892]
-/A << /S /GoTo /D (subsection.10.15) >>
->> endobj
-653 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 501.543 306.742 512.422]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
->> endobj
-654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 491.49 513.996 500.467]
-/A << /S /GoTo /D (subsection.10.16) >>
->> endobj
-655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 467.118 329.277 477.997]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
->> endobj
-656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 457.066 513.996 466.042]
-/A << /S /GoTo /D (subsection.10.17) >>
->> endobj
-657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 432.693 262.478 443.572]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 422.641 513.996 431.617]
-/A << /S /GoTo /D (subsection.10.18) >>
->> endobj
-659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 398.268 297.895 409.147]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-660 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 388.216 513.996 397.192]
-/A << /S /GoTo /D (subsection.10.19) >>
->> endobj
-661 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 363.844 288.311 374.723]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
->> endobj
-662 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 353.911 513.996 362.768]
-/A << /S /GoTo /D (subsection.10.20) >>
->> endobj
-663 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 329.419 287.942 340.298]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-664 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 319.486 513.996 328.343]
-/A << /S /GoTo /D (subsection.10.21) >>
->> endobj
-665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 294.994 323.359 305.873]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
->> endobj
-666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 284.942 513.996 293.918]
-/A << /S /GoTo /D (subsection.10.22) >>
->> endobj
-667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 260.569 313.775 271.448]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
->> endobj
-668 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 250.517 513.996 259.493]
-/A << /S /GoTo /D (subsection.10.23) >>
->> endobj
-669 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 226.144 344.37 237.024]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-670 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 216.212 513.996 225.068]
-/A << /S /GoTo /D (subsection.10.24) >>
->> endobj
-671 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 191.72 229.841 202.599]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO) >>
->> endobj
-672 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 181.787 513.996 190.644]
-/A << /S /GoTo /D (subsection.10.25) >>
->> endobj
-673 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 157.295 325.96 168.174]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 147.243 513.996 156.219]
-/A << /S /GoTo /D (subsection.10.26) >>
->> endobj
-675 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 122.87 298.851 133.749]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-676 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 112.818 513.996 121.794]
-/A << /S /GoTo /D (subsection.10.27) >>
->> endobj
-677 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 88.445 349.76 99.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
->> endobj
-678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 78.512 513.996 87.369]
-/A << /S /GoTo /D (subsection.10.28) >>
->> endobj
-681 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-685 0 obj <<
-/D [683 0 R /XYZ 89 770.89 null]
->> endobj
-682 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-748 0 obj <<
-/Length 1227      
-/Filter /FlateDecode
->>
-stream
-x��X[s�8~���0�V$�$���L�Ivrk�7/i�!Xf��\���~�8�I�<���O߹HP
4��=�k6:8fP��M1�f�fC�Y6 T|͵k�d��P��yn�1��y���٩f!@�	]�0F���h6�1BbjH*$�M4/
]��\
�j��D���b�¦xF���T�=~V�@��w��Z 1Sc��Q
7�]g�F�|��N�dn�`0���0�n�
�\d��<��4qC��r �x�Rc��,`[�6
؄�f�\�2�N��R_>�{�/����w�Y<W˭��]�1��֤c�v����f�a乨\�qt
�\H��������?��Ø�A� ��^�E�݆�K�
y/��7��x)D�i��R_�߹�2�
�$<p����@=���L'�P�2[�,to�9��0B��e):��_q��*к
o�&�
-��ݣ���
e��
-&�/����p�Uug^*�*��F�LQZap?  "��%'�� �'� 3�t.N��T�$�+
L���'W��$)x�i�A%���cJ��q
&A'5�,�	f
s�08��[
�
�*
R �e�(
/��t�����B�g�>H�<�$��>�@"�j�5����8�UgL�"�H1�ZQ"Gb���S":A���E!-��)cyG�V�h�G٥�)A6�"�:��5��Es����`�v���Zc
�i7gH�6(�X�6�:~�)>L��&Ԣ����.E��|X�M9[�z��pgt�?ܫ�2~�s%���
-oy|��(�^Ѧb�ܦj嗉Wl;�u
-��D��s��\�rb�+�����
�b�,��0��^�F��
�
��(��
�����u��ΆDO�j��2%K���h�N����
ᖶ�ҩ�{6<�qQ,rc^d����yA�b���)�

V��Oi"w&���x�|���TRkI�%�����&�˵�%��
&�G�}�
yB�9��z5�
LD��zdB��{��6����k5¦�\�B�K�$�fdUv���0�Դ�`���b��9􆴾��b��9Q��D�w�T��s�r�V���bD���IP�_f�̯C���_s��3��.ܤl*Wuʼ�j��`u���z.[p���i��Y�G�������-�ş7e��$ ��kMh�u� ����7 N3��]1�g
�\O7�� ��O��cD��Zb����LT'��
�bO����	��+
-endstream
-endobj
-747 0 obj <<
-/Type /Page
-/Contents 748 0 R
-/Resources 746 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 633 0 R
-/Annots [ 679 0 R 680 0 R 705 0 R 706 0 R 707 0 R 708 0 R 709 0 R 710 0 R 711 0 R 712 0 R 713 0 R 714 0 R 715 0 R 716 0 R 717 0 R 718 0 R 719 0 R 720 0 R 721 0 R 722 0 R 723 0 R 724 0 R 725 0 R 726 0 R 727 0 R 728 0 R 729 0 R 730 0 R 731 0 R 732 0 R 733 0 R 734 0 R 735 0 R 736 0 R 737 0 R 738 0 R 739 0 R 740 0 R 741 0 R 742 0 R 745 0 R ]
->> endobj
-679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 347.907 718.971]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
->> endobj
-680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 698.039 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.29) >>
->> endobj
-705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 673.561 323.21 684.44]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
->> endobj
-706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 663.509 513.996 672.485]
-/A << /S /GoTo /D (subsection.10.30) >>
->> endobj
-707 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 639.031 329.665 649.91]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
->> endobj
-708 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 628.978 513.996 637.954]
-/A << /S /GoTo /D (subsection.10.31) >>
->> endobj
-709 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 604.5 363.06 615.379]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
->> endobj
-710 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 594.448 513.996 603.424]
-/A << /S /GoTo /D (subsection.10.32) >>
->> endobj
-711 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 569.969 339.997 580.849]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
->> endobj
-712 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 559.917 513.996 568.893]
-/A << /S /GoTo /D (subsection.10.33) >>
->> endobj
-713 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 535.439 319.315 546.318]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception) >>
->> endobj
-714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 525.387 513.996 534.363]
-/A << /S /GoTo /D (subsection.10.34) >>
->> endobj
-715 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 500.908 278.907 511.788]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-716 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 490.856 513.996 499.832]
-/A << /S /GoTo /D (subsection.10.35) >>
->> endobj
-717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 466.378 310.458 477.257]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
->> endobj
-718 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.624 455.165 286.309 465.302]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-719 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 456.326 513.996 465.302]
-/A << /S /GoTo /D (subsection.10.36) >>
->> endobj
-720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 431.847 304.002 442.727]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
->> endobj
-721 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 421.795 513.996 430.771]
-/A << /S /GoTo /D (subsection.10.37) >>
->> endobj
-722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 397.317 334.607 408.196]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception) >>
->> endobj
-723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 387.265 513.996 396.241]
-/A << /S /GoTo /D (subsection.10.38) >>
->> endobj
-724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 362.786 276.78 373.666]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) >>
->> endobj
-725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 352.734 513.996 361.71]
-/A << /S /GoTo /D (subsection.10.39) >>
->> endobj
-726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 328.256 334.139 339.135]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
->> endobj
-727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 318.204 513.996 327.18]
-/A << /S /GoTo /D (subsection.10.40) >>
->> endobj
-728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 293.725 290.622 304.604]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
->> endobj
-729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 283.673 513.996 292.649]
-/A << /S /GoTo /D (subsection.10.41) >>
->> endobj
-730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 259.195 302.338 270.074]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
->> endobj
-731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 249.143 513.996 258.119]
-/A << /S /GoTo /D (subsection.10.42) >>
->> endobj
-732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 224.664 275.589 235.543]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 214.612 513.996 223.588]
-/A << /S /GoTo /D (subsection.10.43) >>
->> endobj
-734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 190.134 393.715 201.013]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
->> endobj
-735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 180.082 513.996 189.058]
-/A << /S /GoTo /D (subsection.10.44) >>
->> endobj
-736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 155.603 392.809 166.482]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
->> endobj
-737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 145.551 513.996 154.527]
-/A << /S /GoTo /D (subsection.10.45) >>
->> endobj
-738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 121.073 307.14 131.952]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
->> endobj
-739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [223.624 109.86 282.991 119.997]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 111.021 513.996 119.997]
-/A << /S /GoTo /D (subsection.10.46) >>
->> endobj
-741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 86.542 301.8 97.421]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
->> endobj
-742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 76.49 513.996 85.466]
-/A << /S /GoTo /D (subsection.10.47) >>
->> endobj
-745 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-749 0 obj <<
-/D [747 0 R /XYZ 89 770.89 null]
->> endobj
-746 0 obj <<
-/Font << /F70 324 0 R /F11 387 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-798 0 obj <<
-/Length 1380      
-/Filter /FlateDecode
->>
-stream
-x��XIs�6��W��@ ��Ngg����jsH2��e&\.�����I�$�v�8mO$����[>Ys
YoF/ƣ��Y��D$��V�,$^����h�|
[~{8�`�
=|2~u2>s�W�ѷ�)da�?�hl����gd�`��B���ֵ\TX��[�?FH����깖{��X�Sߢ{+��.�dQ��K>��$Ϧ5��E�wzt:;4�k�6瓓jƥF��/	��I*��
���.�b�V]�g{�@�zi��k����Z�V���VA`S�3�n(�>m';�}\w؝�m�ۉ�p0��y-���)���bC�
-���}�:���~�i�
�m��
�
��fmU�G
.��!�Ҝ5�z�pHh��U�Ͳ�KW
-|zAɆ�d �Kc�C�':�|99|�x�d�݉�� ��Qo�#S�^s^�t<��WS嬷&�ʦ��x;�8
-�ئ�����dX���^T�0�i�d�<��� 9vpNA�]����MYÇ��
-��6''�0�W��HI�7}d2��
��ݠ�虜/�i� ���Y/n�k�`�J���p?��ij�W];yu���
)��Y-�g������K]�X��oY���KP���㿜�ج��4�?���/e�:�
^��4]��f��A6� ���s{��fr��{{�e#�=�j��I�7� ��n����!V�#����P��� �1f�AD�uI
�Z���'���q1B�~Wͺ\���U�����5~��T����j4��k����X��**޲r�1��s�P��Q	��b}���\�s�<4�{�
-.��
��
�����A�b�(	�	�ib.�Яl>
����P��CĊ��(6�-Q@ �Bm7��ӷ�s���3�b`�F��+}e"��2��bL��	���P4�
N�۾
�|y^��'�H��
ؤ���
p�D���r;�

�N��H���
��ZZ!m�7^π-�ܕF4�a�x��Ջ��Z2���&���#{���2'y
���(Z׏����vmH�%��Li7�M�M��tE�������E͛�����	a�O�
��[�>۳Y{�H�>8a(�4?�GִK��
^��u�og� /���
�U-�`(��=2b/��Y��Cpwq
ya�/�:8�����OKV,r.x��r��ZI
��.eU�����;]�* �����6s�^0"
%�}�76ܓ�ߠI"L)����r���G�o��@�Z�
�ܵ@y�5��(*a20Jo��L��+Q�u�W�i�*�$ɣiP6�~&�A�;Vv�E��F]��l
{H�7z�5!�|u��\����wq-Jz.$�41�tٶ�_��
*��K�b7�֛)�P���
�
���&]a��p���s�

-endstream
-endobj
-797 0 obj <<
-/Type /Page
-/Contents 798 0 R
-/Resources 796 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 633 0 R
-/Annots [ 743 0 R 744 0 R 768 0 R 769 0 R 770 0 R 771 0 R 772 0 R 773 0 R 774 0 R 775 0 R 776 0 R 777 0 R 778 0 R 779 0 R 780 0 R 781 0 R 782 0 R 783 0 R 784 0 R 785 0 R 786 0 R 787 0 R 788 0 R 789 0 R 790 0 R 791 0 R 792 0 R 793 0 R 795 0 R ]
->> endobj
-743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 708.092 285.362 718.971]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 698.159 513.996 707.016]
-/A << /S /GoTo /D (subsection.10.48) >>
->> endobj
-768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 674.166 361.775 685.045]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-769 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.162 662.21 242.215 673.09]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-770 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 664.113 513.996 673.09]
-/A << /S /GoTo /D (subsection.10.49) >>
->> endobj
-771 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 640.24 400.5 651.119]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.57 628.285 426.123 639.164]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-773 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 630.307 513.996 639.164]
-/A << /S /GoTo /D (subsection.10.50) >>
->> endobj
-774 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 606.314 300.486 617.193]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-775 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 596.262 513.996 605.238]
-/A << /S /GoTo /D (subsection.10.51) >>
->> endobj
-776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 572.388 300.485 583.267]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
->> endobj
-777 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 562.336 513.996 571.312]
-/A << /S /GoTo /D (subsection.10.52) >>
->> endobj
-778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 538.462 267.101 549.341]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 528.41 513.996 537.386]
-/A << /S /GoTo /D (subsection.10.53) >>
->> endobj
-780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 504.536 291.28 515.415]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 494.484 513.996 503.46]
-/A << /S /GoTo /D (subsection.10.54) >>
->> endobj
-782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 470.61 301.611 481.489]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
->> endobj
-783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 460.558 513.996 469.534]
-/A << /S /GoTo /D (subsection.10.55) >>
->> endobj
-784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 436.684 254.379 447.563]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 426.632 513.996 435.608]
-/A << /S /GoTo /D (subsection.10.56) >>
->> endobj
-786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [103.177 402.758 276.515 413.637]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-787 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.041 392.706 513.996 401.682]
-/A << /S /GoTo /D (subsection.10.57) >>
->> endobj
-788 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.038 273.946 252.29 284.85]
-/A << /S /GoTo /D (namespaceparma__polyhedra__library) >>
->> endobj
-789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 203.645 365.215 214.549]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
->> endobj
-790 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 175.538 379.523 186.442]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) >>
->> endobj
-791 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 147.431 402.058 158.335]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) >>
->> endobj
-792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 119.324 366.8 130.228]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) >>
->> endobj
-793 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.217 324.415 102.121]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) >>
->> endobj
-795 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-799 0 obj <<
-/D [797 0 R /XYZ 89 770.89 null]
->> endobj
-46 0 obj <<
-/D [797 0 R /XYZ 90 375.87 null]
->> endobj
-800 0 obj <<
-/D [797 0 R /XYZ 90 343.666 null]
->> endobj
-50 0 obj <<
-/D [797 0 R /XYZ 90 343.666 null]
->> endobj
-801 0 obj <<
-/D [797 0 R /XYZ 90 291.048 null]
->> endobj
-802 0 obj <<
-/D [797 0 R /XYZ 90 222.66 null]
->> endobj
-796 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-842 0 obj <<
-/Length 1203      
-/Filter /FlateDecode
->>
-stream
-x��YKw�8��W�
�Sc	�ó�$i��4�4�l�
��B��#DR�׏��8�4�I�B��w��������} ��=�
ߘ�`����ni\��
�! �g�Ld9�yoA�FC��9*�%X�M
��
��m�'��Z_�g����n �H`@)³�Ј���W`,��lw��;.�f���Pڂm��m�!���6�R�k��p��q5�
q��J=��D��Y���X!��hUf�[�$(��Adm��i����p
����-�����1B��?�z:��
c=����PB7���A��p#�nIر|�,�����鸨�},�W�^�=���h
��6~f��,�*]dʅ�p))���~�/R�9w7;��FDoz�8��lv����r]Q�wdz%��f�^�yE	J;c����e�I
-5�^���/y�[!�&��d�t��Uݱa��WPRf�LhFP�Y��.����p��|������LV�{f��c^
4�P9�YZk��Ј'�c��!4QV����=_V�y�I��֘���j>"�&���Y�A�!-�;
��
��υ	8�-4Ac���ԣ?����Y�N)It�=�+��ž85
i�Au��r�P�|)$+X�t��Y�'835�? �[�g����^�
T�y�i����Gʓ
-������
����:PQR�,ܮ?y1�K�i�D��a�4FY��@���=����7 �J��1e8��~�
-����1m"ٳj3%D���m����i���3H�)���m���Pű��
�9���˴�V
�vJA��,wC�&n6[�`���8�����<�8���
�!���ϛ�V'�FM,70��;�	

D��P�1e�*�
s����,)?6\�����S�.��9��E�dO��oqf�M����
���s�q�@���O*Mee�
�1p	���Լ;�r_��R��J�"IU�SMM?uģ��(.����i��s��'U*��֛�r�����}2-K5�*�2�˨J�~洱�=K�
;pܗ�%�#ߞn�N�Ɓ����od��$����K���j�K���Δ�QQ�l������v����6�ݯm
]��%�L����G�y���=
'�|�=��R��c4Z�I��2�g����>��6e|^�)�&s�7��yz@��


��n ��#��
���C51��q\�=ٜ��
J)1Z
-endstream
-endobj
-841 0 obj <<
-/Type /Page
-/Contents 842 0 R
-/Resources 840 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 633 0 R
-/Annots [ 794 0 R 813 0 R 814 0 R 815 0 R 816 0 R 817 0 R 818 0 R 819 0 R 820 0 R 821 0 R 822 0 R 823 0 R 824 0 R 825 0 R 826 0 R 827 0 R 828 0 R 829 0 R 830 0 R 831 0 R 832 0 R 833 0 R 834 0 R 835 0 R 836 0 R 839 0 R ]
->> endobj
-794 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 707.957 284.887 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 679.922 317.106 690.826]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
->> endobj
-814 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 651.887 289.002 662.79]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-815 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 623.851 323.323 634.755]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-816 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 595.816 282.377 606.72]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 567.781 316.698 578.685]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-818 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 539.745 348.07 550.649]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
->> endobj
-819 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 511.71 346.964 522.614]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
->> endobj
-820 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 483.675 327.029 494.579]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
->> endobj
-821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 455.639 344.344 466.543]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
->> endobj
-822 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 427.604 286.8 438.508]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 399.569 298.427 410.473]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 371.534 376.772 382.438]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.55 356.843 232.722 366.748]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 343.498 411.073 354.402]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.94 328.808 389.318 338.713]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-828 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 315.463 280.693 326.367]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-829 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 287.428 315.014 298.332]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-830 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 259.392 308.121 270.296]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
->> endobj
-831 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 231.357 303.936 242.261]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-832 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 203.322 338.257 214.226]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
->> endobj
-833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 175.287 331.363 186.191]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
->> endobj
-834 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 147.251 359.019 158.155]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 119.216 251.374 130.12]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO) >>
->> endobj
-836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.181 340.469 102.085]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-839 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-843 0 obj <<
-/D [841 0 R /XYZ 89 770.89 null]
->> endobj
-840 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-870 0 obj <<
-/Length 1257      
-/Filter /FlateDecode
->>
-stream
-x��Y�n�6}�W�m%��)�^�lR����,Z�
��x)�^��˛d�Iq-��'ICr8<䜙���P��G��Iop���}:�d��@q-_�
�5S�Thi_&7��x��;t�^<�O.�'c�ֻ���
�C��u�S¤��(3*�Q�n����ł&}�ʸ�gHS��IήIpt���0t�<Ch�ɫa�S�@
c�粁�CҮG��@]"��`�ś<#(��)Ad�9���E)F$���$8ϣ,m̱�
\yP񨝎��Pw,��
[�%��M�s�\�x�*�@3]UL�7f�[}�Vk� �y��E����g `�8
 B>e�2�
�9'�e�Y"��x��>����a,?F
�9&8
�@N^��`q�Z S���\<�u�
����gFn\&�������9�ɚh��F	�[Ci)�mV�E-�~�E����O)m
�QZ��i�5
�
T�
j���f��H���'6�$bU�eP�;a��������e�B�Q+�e`(��+$�a" "�AyP�"	e������Ht.
��!���(��nh�R*2��aIT�i!|����{6���B6ذn
�@CI��w2ۃ
�u
<�`\��xVi
�/�̵��E��Ԍ�/��f
�j����Cv��n0�iσ��:Z�͹<f3|<w�����
O|X����W 3c�����
p%MX�Er�Ak�Y""L����;�-��M�W��/��^	�C��q��X��7�AC�l����![@��h�n�ɒKf{óW(._y�f)��v/�)���v��Q�~'���_��2�c
u�`���7�1w^�aѩjL"UD(��u-EޥP�\�<P�/QX׹	N��_�΢�Ct8j=1�!��$
-����h�\�E�$�y��b1	���X$��=���%�P9*5�K���V��
-��E%��s�]�g��Ȟ�dv,W
�*W>15R);��#�Q�R7�N�<���qPYŁ��˩4/đ���:��W��M2��sdj�؀*�:��iT���9NWC��̫r��~'&m�5E�E���N�E�\�5S���j���Ӵ��w���Bd��u�����3�ru��
�� ��u!o�}��)\'��1�ʶ��T_������kz���l�hU�6Ye4�/7�
�+n%MܡtQ��fbd΢W��~�1���vu�6DiY���&I�[�

�{%]�T�W[+��W��[��6��S�aU�����`Z.r�.t^^��`�ՁcTc��dW�5&�-^��?oϢ�
-endstream
-endobj
-869 0 obj <<
-/Type /Page
-/Contents 870 0 R
-/Resources 868 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 633 0 R
-/Annots [ 837 0 R 838 0 R 844 0 R 845 0 R 846 0 R 847 0 R 848 0 R 849 0 R 850 0 R 851 0 R 852 0 R 853 0 R 854 0 R 855 0 R 856 0 R 857 0 R 858 0 R 859 0 R 860 0 R 861 0 R 862 0 R 863 0 R 864 0 R 865 0 R 866 0 R 867 0 R ]
->> endobj
-837 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 707.957 316.12 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-838 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 679.922 365.126 690.826]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
->> endobj
-844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 651.887 363.442 662.79]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
->> endobj
-845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 623.851 339.373 634.755]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
->> endobj
-846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 595.816 345.659 606.72]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
->> endobj
-847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 567.781 376.443 578.685]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
->> endobj
-848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 539.745 354.296 550.649]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
->> endobj
-849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 511.71 335.488 522.614]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception) >>
->> endobj
-850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 483.675 297.321 494.579]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 455.639 329.43 466.543]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
->> endobj
-852 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 440.949 271.403 450.854]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-853 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 427.604 324.439 438.508]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
->> endobj
-854 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 399.569 349.475 410.473]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception) >>
->> endobj
-855 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 371.534 296.609 382.438]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) >>
->> endobj
-856 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 343.498 346.406 354.402]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
->> endobj
-857 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 315.463 307.134 326.367]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
->> endobj
-858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 287.428 294.003 298.332]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 259.392 406.192 270.296]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
->> endobj
-860 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 231.357 405.086 242.261]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
->> endobj
-861 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 203.322 326.113 214.226]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
->> endobj
-862 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 188.631 269.412 198.536]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 175.287 319.467 186.191]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-864 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 147.251 313.381 158.155]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-865 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 119.216 319.657 130.12]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
->> endobj
-866 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 91.181 274.058 102.085]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-867 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-871 0 obj <<
-/D [869 0 R /XYZ 89 770.89 null]
->> endobj
-868 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-895 0 obj <<
-/Length 1352      
-/Filter /FlateDecode
->>
-stream
-x��XKS9��W�
��BҼ���*؂��� )�l
3�<�fl���kl�CL0^�ɣ~|���j�
���:���#�$(	i��n�;��� ��ȹj'n��}�r^Mؐ��a9�漨Y��L%8�m��z���^�E@<v��(v�y��vF0}�`�%��>�
�z�̜��?-l,È�U>��1yd'!�mf������8^�4�#���0��"�(C�yV��q��7v:�G�u�wk<�pI�f"gfXf�[>fx�s=���~���t2Q&��!�o�+�3-j.n\3қR�ڪ>e.��K� =��b<ec��'+)|���8�%ȋIG�r %:+�\�g�t�� ��)��[�4�_���$jw̍�c�������	GH
I��$B�{�(

-⨡�%ŒY$!�H��A�2nRf.!m�'���[�O}
-
V�g�#��s�@��	
/�~F�5\���=G��{јj}݌U�x���%!�̥(�f�559��q�:�b(Ś?$�bl���>�&uz�1
�,�MT��#
'%�*�_�6���΂, ^
���b E�O�8%������RYqjTޘ����FO(3���
-=K�F����4
��rZ�����V�����|���gr�
��+%^
�癑��}�[6Km*�
�Q
��>���p�4��w�>�Z�U_���zQ{I��C���ҾtG��c��W7���d�,s0V�pa���1YN�pz����O��j���
�����N
-�5��p;��|8�V���ٴN���%��T�O2.K���|Z�A�m�cP�Eg�!˲�`�ѤL�S�L��� &ݒ��$��/x��<ߜ�C���
;LP�R�GB�
���.����]�-\VU���h����[�����m��YZp&l��;g��ܿ�W5ϷU}ha+�r��#WՂ�[�qˑ�"�-��$�;�(�d�޾6�t���.U=������f-��%��n�6��ʺ�秓
S+
��%$���k0���{�����\HI�eS���<�b�GM�u��ɺ�z��
����ռ�
��B�1-F�x4Z�

�=�m3�[iX�Ԣ��i�<,s���#!J�?�>�m�)A6�lZيy`R�Hi6�
M�-3a�m���>7��S׃��L�d�*���m��5p�QE{~ޅi�l
I��.���16+����������Pvo�M�����(��شa������3��ԣ��ݫ+.��1m��S���0M���	�e@���@�%�IU�y�ط���M��'q��W��t[ד?���1\��hX�Oc�X
E�Įm���ۚ&sucG��h�0AaH-x��}
#L���/��՟v���?�=簄�,Z�? 
��
-endstream
-endobj
-894 0 obj <<
-/Type /Page
-/Contents 895 0 R
-/Resources 893 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 899 0 R
-/Annots [ 872 0 R 873 0 R 874 0 R 875 0 R 876 0 R 877 0 R 878 0 R 879 0 R 880 0 R 881 0 R 882 0 R 883 0 R 884 0 R 885 0 R 886 0 R 887 0 R 888 0 R 889 0 R 892 0 R ]
->> endobj
-872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 535.87 218.955 545.798]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter) >>
->> endobj
-873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 521.904 262.113 532.808]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
->> endobj
-874 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 493.931 276.42 504.835]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) >>
->> endobj
-875 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 465.957 298.955 476.861]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) >>
->> endobj
-876 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 437.984 263.698 448.888]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) >>
->> endobj
-877 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 410.011 221.312 420.915]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) >>
->> endobj
-878 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 384.095 181.785 392.942]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-879 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 354.065 214.004 364.969]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
->> endobj
-880 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 326.092 185.9 336.996]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 298.118 220.22 309.022]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-882 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 272.203 179.274 281.049]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-883 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 242.172 213.595 253.076]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 215.175 244.968 225.103]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
->> endobj
-885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 187.202 243.862 197.13]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
->> endobj
-886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 158.253 223.927 169.157]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
->> endobj
-887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 130.28 241.242 141.183]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
->> endobj
-888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 102.306 183.698 113.21]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 74.333 195.324 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-892 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-896 0 obj <<
-/D [894 0 R /XYZ 89 770.89 null]
->> endobj
-897 0 obj <<
-/D [894 0 R /XYZ 90 721.073 null]
->> endobj
-54 0 obj <<
-/D [894 0 R /XYZ 90 668.808 null]
->> endobj
-562 0 obj <<
-/D [894 0 R /XYZ 90 634.014 null]
->> endobj
-58 0 obj <<
-/D [894 0 R /XYZ 90 634.014 null]
->> endobj
-898 0 obj <<
-/D [894 0 R /XYZ 90 553.842 null]
->> endobj
-893 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-929 0 obj <<
-/Length 1221      
-/Filter /FlateDecode
->>
-stream
-x��Y[w�F~ׯ�pN�$n}K
'G�
���;��a�7V�Ŷ��;{	9M��"��e`gg��fvvi�����_W��i������Z�4o��
o�v�ۮ�q�N���i.tҳ������%�6:_�>�,��4K�wL���|t�i	��iȜ�� ~ʵ�=�g�-G���2��)L�m���7Ͳ��gY�eI;^c�A:��Q�BzJ�(˶R
g�‰j�˜!�
6��
:m�pR3G��)�i���q�a۶��lmlMM
)lnl��tҮ���FU�>pL�T�������`f���?�����4	��W|�<@�5�1Qt��P�͑�RB��6
�0|�m�C/���O8f���
 [8g��-��_!�"����B���S4׍��a�HH��. �l��@��M��-<bF�A��=�,��H���?�W���p�F���(D�]pץ1�t���i`�ۊ�'4*��ß��Çk�ȹ�_��Ώuv�ɸ��纻jb�s2�� vNK��}�;�_e�&�>�g��w}N@�������{�d������\VG|Q�2 ���i�ゅ�1�0����U�V�8���VmDZ­PK�H�ҔjXP�z��^��,����|�O�T)��͠�.Rv��%p}�yf�*QPd–IE��P�x�)���
q$6%�*�[�	��-� Y��AN�bxF�G�
BvL �qZ�>��$S��Z��yS5��� 
��
"O�zM\k\�"�oeH���
-����*�
�1��8`�e��IU��K
V���I��ސ���H�
�,����H^t\}(�r^���7(���H#֢�C���G�eAD��
���|ߘ5t�zAS��%KR�NQP��#ikU	)}K �q֜a�k(����|.J
-�׎�<6�ۼ`2���E��9H�
-Z��-���HVmq��U����q����C&\��=?��c9�
2��,�<�wW�;|�i-*_;n�hvϷ����_AP��ȟ�%M�}����!�$�q����{NR

FSy�|T�9��pmӳ��^}�u�y��;��#d"��l�q�->6}�`2ϧ�k
-�v�Ơo�S(.R <�
��/.R|>ΚA�
�bq!�"��#)�����R���Gx�T�*\�ďm�/����]�P ���D<g��x
-z��a�t�����5��q! ���>ꎱ�/��m�V��4!��g���L�ZM��
?�%n�:sA�.
a���i��
-endstream
-endobj
-928 0 obj <<
-/Type /Page
-/Contents 929 0 R
-/Resources 927 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 899 0 R
-/Annots [ 890 0 R 891 0 R 900 0 R 901 0 R 902 0 R 903 0 R 904 0 R 905 0 R 906 0 R 907 0 R 908 0 R 909 0 R 910 0 R 911 0 R 912 0 R 913 0 R 914 0 R 915 0 R 916 0 R 917 0 R 918 0 R 919 0 R 920 0 R 921 0 R 922 0 R 923 0 R 926 0 R ]
->> endobj
-890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 694.851 273.669 705.755]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.55 680.075 232.722 689.98]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 666.645 307.97 677.549]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-901 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.94 651.87 389.318 661.775]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-902 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 640.497 177.591 649.344]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-903 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 610.235 211.912 621.139]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-904 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 582.029 205.018 592.933]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
->> endobj
-905 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 554.8 200.833 564.728]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-906 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 525.619 235.154 536.523]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
->> endobj
-907 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 497.413 228.261 508.317]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
->> endobj
-908 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 469.208 255.917 480.112]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-909 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 443.06 148.271 451.907]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO) >>
->> endobj
-910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 412.797 237.366 423.701]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-911 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 384.592 213.018 395.496]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-912 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 356.387 262.023 367.291]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
->> endobj
-913 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 328.181 260.34 339.085]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
->> endobj
-914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 299.976 236.27 310.88]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
->> endobj
-915 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 271.771 242.556 282.675]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
->> endobj
-916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 243.565 273.341 254.469]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
->> endobj
-917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 215.36 251.194 226.264]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
->> endobj
-918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 187.155 232.385 198.058]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception) >>
->> endobj
-919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 159.925 194.218 169.853]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 131.72 226.328 141.648]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
->> endobj
-921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 115.968 271.403 125.873]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 102.539 221.336 113.442]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
->> endobj
-923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 74.333 246.373 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception) >>
->> endobj
-926 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-930 0 obj <<
-/D [928 0 R /XYZ 89 770.89 null]
->> endobj
-927 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-954 0 obj <<
-/Length 1507      
-/Filter /FlateDecode
->>
-stream
-x��Y[o�6~���[%�fH�>
��)ڴ��x{I
-C�iG�,�����~�7ْ�^![�(SԹ|<�#�1�V�^�~���.Cl�(h`M�V��Ћ����uk쌩��yRU��L�5+�����������a�f�r:�4" ��QY�zt�[
�~ca�Ƒ�Y.Z[
ua̭��#����̈Z�x�LBc�#+$�,}�%ea�6s�0�P�j,
��-�w��g5�8w<�.�xW!��zv
"3�
���E�hx�(�;Y�cc;�p�
-�Ҙ\�%B��!��d\�:�/��� Qx�JǯjE���̂��ʙ�N��E~dV�ֱ�?�0
�>
-"�+�J�Fح@]�q��
��s�n���J
I�0�����|��&e��g
���fs��ݏ��Z��J�O���s��Y�R�sP����9O[��W˦He�� �Ph�Y��.���Qb�����c�IR
�
��jWd�"K�c�z2�`i&���/��@��Ԍ�BH��ǽ� 
40e��᪹�6����Lx9��z���8��ʁ5�y���� ��a{%��iN�(NS+�ɺM��z)lV4��d��,j^�3�D�!�g�a|,ZBF�D��8p�zfh
��y�{b6�6F�������H�sH�SYU(;>��%������US=6��1*�:-�"L��w����O�V����Lu�Is��6K�?%mO
׷9cC��3A w;�=�k�'C\j��S�*g��̘��h�wK�,E�֛��SՊj����b�kx�U�`
-��
�U�M����n=���]w`��̧-5%)�E�֖ɏ<���v�4�;9�iP:u��Pl�d\\�~�
���x�,��0��+]��q
������ٰ�u5�a�@���l|�����:����k
-h����NEA[�!�
�b��[cW�x�.E.�!�Lj �	 .X�d��9��*��qd� � ���0��gO&o�ÛDX�u���We�R���Z=�*��C���y��喰����*�B��'Y�R����U��3Q���jqۼPo:�5BP��ʵ�#��Q�1�.͛�I�̜��Ye.����� �^@5İs��o ��2
D�W�b'$OH�>��ҏ��66��$�!\B�"����ևt��m'Ru
;ʉ�0������
R��;r��b�H
��b�I���s���8�wN �r�$ ޽Ø��
slS�إ��䓨k�ġ^[��>��k�t�+8+R���?�+M��4s���^�~��s���NQ�fj�<7��>tԜ�XA��|�v��=U'�a?�ِ�K8
�Ϊ��Z{�u�QĐ��(ȲSB`��w� ���۹���(J�G�"?�zEM��?�M�U$�o
���ϊ�g��Ѥ�.)�^�n����d��pT�4ȹa&䔟-�t%��֓(������旳�y��X�BPD�1��!�p@̷m3b]��&ג���P��	
-�H5x��'�
�
�T�8|�/͇z���ڵ.Jؓ��)� 
8�
-endstream
-endobj
-953 0 obj <<
-/Type /Page
-/Contents 954 0 R
-/Resources 952 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 899 0 R
-/Annots [ 924 0 R 925 0 R 931 0 R 932 0 R 933 0 R 934 0 R 935 0 R 936 0 R 937 0 R 938 0 R 939 0 R 940 0 R 941 0 R 942 0 R 943 0 R 944 0 R 945 0 R 946 0 R 947 0 R 948 0 R 951 0 R ]
->> endobj
-924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 695.658 193.507 705.844]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) >>
->> endobj
-925 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 666.915 243.304 677.819]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
->> endobj
-931 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 639.865 204.031 649.793]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
->> endobj
-932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 611.839 219.115 621.767]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
->> endobj
-933 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 583.813 190.901 593.741]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-934 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 555.787 303.089 565.715]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
->> endobj
-935 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 527.762 301.983 537.689]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
->> endobj
-936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 499.736 223.01 509.663]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
->> endobj
-937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 484.074 269.412 493.979]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-938 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 471.71 217.471 481.638]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
->> endobj
-939 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 443.684 201.601 453.612]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-940 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 414.682 216.365 425.586]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 386.656 216.355 397.56]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
->> endobj
-942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [138.538 358.63 210.278 369.534]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 330.605 216.554 341.508]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
->> endobj
-944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 304.636 170.956 313.483]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [135.768 275.529 192.544 285.457]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.333 197.097 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_a1ed95ba05855767fd9fd6bf04f9e9167) >>
->> endobj
-947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.913 74.333 278.162 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-948 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.065 74.333 334.082 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-951 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-955 0 obj <<
-/D [953 0 R /XYZ 89 770.89 null]
->> endobj
-956 0 obj <<
-/D [953 0 R /XYZ 90 246.146 null]
->> endobj
-62 0 obj <<
-/D [953 0 R /XYZ 90 176.027 null]
->> endobj
-634 0 obj <<
-/D [953 0 R /XYZ 90 143.976 null]
->> endobj
-66 0 obj <<
-/D [953 0 R /XYZ 90 143.976 null]
->> endobj
-957 0 obj <<
-/D [953 0 R /XYZ 90 93.392 null]
->> endobj
-958 0 obj <<
-/D [953 0 R /XYZ 90 93.392 null]
->> endobj
-952 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F60 304 0 R /F11 387 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-973 0 obj <<
-/Length 1967      
-/Filter /FlateDecode
->>
-stream
-x��YIs�6��W�Vij��LO��N�$uc��d<��L�(\�����fYV
�3=xb{��6�u6���:{~1;>
]'"Q���ʉ\'�"��8�L,>_�qx �8�g_�������s�6{u1�:���:��$�:�}��:	L�q\�#���M��1��s>�c�V���5�
��b�����	)%�"��4K�Œ��<.�oդ�\���8Ùm\-�?�s��
-��������
��,-dl6�s�o�粮���^$�3�,�<-��ΉV���4*w�	<�,)'��(�'���!Td�1�������]w�V�w�
-�2,=x��R*
�>j6~r}���Z+���$>a,DI>Ȧ�
-c��Z
���@�cǧ �(� Bp
��:�qט[J|�M؈s�z�c��W
��Q
Y4�i����4C��k��E0;�
-4$<|�U��A�T���b��v�Ti�1��Qz\���2i���\��y�I��*��F&V�����]�z
-�D��R^�2 at D	�'u�%~�	�r��ǁ����=RnjʼG��0_�~4�t�h*8	��%gDp��K �-���M�f)L�W���m3
��`B�x���'�����O>y�����}h��\}��f�ǕTY�W㷎/�P���
-
/*�+*���D� J1-
���9ߟ�&&\Q��"�}kF�W(`T�pke���D ܮ�61���3@�.�:�]&R��@��Gq��P�ӫ[�\�m#U��I`�5��>O�H<��
h?�
���BK�=0C.
���� '�ab�
`���Pܦ����ṇ9F-�gSIsoQ&��cU't�����\��[�"I��Э�����*����BV��U��z+��3�]#W��S�n���@��d�o��8k�8��H
-
-e�? ���K�H�{R��e�m���6�dY������6��
A>��¯l�Icl�BeY68RV:�!U��
#UG���k[�Xvz��M'g��.Ϫr��|"����n�ˆ�t\E��(�#�|6`����bC�r
Т�
d��1>P�R�����[�t+�F`���Ɖ�@���_Cz��0D
z�]q*tg����ߕ���F
�R������ 
�������ػh�mȬ�wV�}p�E� ��%kw����g�iQe,	)LD$`&�C��wSK��M:��{6��0o\���NĢC/�#��Wmf�ƫR��r4aI�Ö����
��n�G �
�D |�4��7C�{��W˃����P�����Unӷd���[���
�O�dt8t�O�2U�&E�8N�B���������2�e���A�j�p&_��,Ñ-g�85����]�u#��O�vs���E��"�Y6�/��i�tu�>� �
��l
�/�.�\����
��.�dqm�7
�g��,dwIG��1�=r;����d#�
�d�?��)F��!_L��0{_��8aXa��#��]��Ly
���oY�#z��9���ʼn/��M
߮F,P�#P����l�e��t~{-�jy�2B��I�3W��yc�Y���ˌ�|�VO`� ݃�.O!$MΞ�'��Q1��l��q�1��!0GOB�sN<���˯��h}�
�0� �54��^��4{x-�^�'���o?0�
�=���]���B��;iR,�O�b��ܴ��
	�9+'�� ��}/;�������1B�b��f�]C�
����
-;^�e�mn����ap�!�Zr��=m��Ӷ�߅5��B�%~�h��D;)��co]�H@��Ǜ���?dF����irGz4wL�U0B�{�j=��"�?���y��!Ӌñ^�g����;/K���n	�-�
u���R����%:����[
�
-�g��Ŧ�7f�k��z�
h�g-��TAa,�..Z�!��V��>:w�d��K
Z�N��f������W���>;>^��Z�.�
������z��i�o��'����/%
-endstream
-endobj
-972 0 obj <<
-/Type /Page
-/Contents 973 0 R
-/Resources 971 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 899 0 R
-/Annots [ 949 0 R 950 0 R 959 0 R 960 0 R 961 0 R 962 0 R 963 0 R 964 0 R 965 0 R 966 0 R 967 0 R 968 0 R 969 0 R 970 0 R ]
->> endobj
-949 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 694.722 191.16 705.626]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-950 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 694.722 263.777 705.626]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_ae44414ac09129205a7f718517caca304) >>
->> endobj
-959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 666.633 159.927 677.164]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-960 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 666.633 212.779 677.164]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_acac3d9fa21c9924c62f2221831d7b873) >>
->> endobj
-961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 637.798 215.13 648.701]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_ac04b78a2c208b111ea763b7bbc01e20a) >>
->> endobj
-962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 609.335 201.302 620.239]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_ac1ce31354ecf79ca6c6c819059ec7de6) >>
->> endobj
-963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [104.984 536.799 188.171 547.703]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter) >>
->> endobj
-964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.661 536.799 496.91 547.703]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [467.979 524.843 513.996 535.747]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.296 475.055 396.428 485.959]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.864 401.03 513.996 411.934]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 210.153 240.255 221.057]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence_a47b1b172706010e446aa8055c982a857) >>
->> endobj
-969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 119.992 304.164 130.896]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
->> endobj
-970 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-974 0 obj <<
-/D [972 0 R /XYZ 89 770.89 null]
->> endobj
-975 0 obj <<
-/D [972 0 R /XYZ 90 712.265 null]
->> endobj
-976 0 obj <<
-/D [972 0 R /XYZ 90 683.803 null]
->> endobj
-977 0 obj <<
-/D [972 0 R /XYZ 90 655.341 null]
->> endobj
-978 0 obj <<
-/D [972 0 R /XYZ 90 626.878 null]
->> endobj
-979 0 obj <<
-/D [972 0 R /XYZ 90 580.219 null]
->> endobj
-635 0 obj <<
-/D [972 0 R /XYZ 90 318.106 null]
->> endobj
-70 0 obj <<
-/D [972 0 R /XYZ 90 311.152 null]
->> endobj
-980 0 obj <<
-/D [972 0 R /XYZ 90 229.431 null]
->> endobj
-981 0 obj <<
-/D [972 0 R /XYZ 90 229.431 null]
->> endobj
-982 0 obj <<
-/D [972 0 R /XYZ 90 181.037 null]
->> endobj
-636 0 obj <<
-/D [972 0 R /XYZ 90 69.233 null]
->> endobj
-971 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F60 304 0 R /F90 507 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-993 0 obj <<
-/Length 1203      
-/Filter /FlateDecode
->>
-stream
-x��X�R�F}�W�-RU��eކb)�	���L�d�m+#�F����綺[Xlc@��$O�nI���
Kؙ9�9��z;!vb4pS'�N�c$�M�k�`�<�`��UR,��j����H�Y:*���
��v��|"'�3Y
^����
�o=�]Y|Ř-������~�^�չ���#�+��|!qi�}
����
��!��@a���oؙ����ȹ�oZ8�2�͜���=l�Ĉ
-�T?��8��Xj}�-!ϻ��
-pw���_#Đ�†�3�Dp-b�W��):��8��bQނ�y��Ƚ����"FqL�!q$¸E�.&���	8#�&pg�� `-��#U�� s��(��G����ܿmڅ��B#h/t뎁
t
�dQ7��g+}� ��eh/mݧ
1
[�
MGRa;r$�G�{�.
}���+� �M
-IQ���AA*������6��njg�8��c���*ґ2��d����H�8��7�εѯ��GϪ�3���Þs�
�����'�����糋g�
p#�D��R
u|�QL
n?7SΦ�N��_���B���Vi>3aK�ד���U��븢�3j�)�}�ӗ�{�G��{?��j.����l��*SG�qUZ���d�"�Y�pd*iC�1{OVI���
-U�'�q���t��V�Ou�B"!
-�5=dlt&��z!�*���GS
R�m�d#�w*މ9��\Ie��r�(��e�iO��S1��VX
zJ A^�)SL��o�ُp#��B���O
?u������[>�#�M��v����@��)F�7�s�V�[�o�N��n1�J��@�
-�B��Dwm$�}.W�,7�[�~b�ߥ���tyzqt؁
]�e:�mpFi��OD#��Pީ�t�������Օv����8�B;�)�oҎ.�v��߬
�01��b��vt�n����c���hG
�*�T��%���06�r�ߗ�ݣ��0��X|I�t���1.���*7kYV�[�6/d�]��ࣞ�#xU���2�Q�`���?���m���n@�7 at qť��q��m�<;;ы�MQ�ON�|�Nf�F5��i-�cstY�����˗$_'�D�͛O�TA�	�|v.�mn��wǮ~S�b�{��>�K5�yU�>���3��B?I���a�p@���Ų�v��Bk���6���Im� �700�?���\���`�h���%���3��[@�
-endstream
-endobj
-992 0 obj <<
-/Type /Page
-/Contents 993 0 R
-/Resources 991 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 899 0 R
-/Annots [ 983 0 R 984 0 R 985 0 R 986 0 R 987 0 R 988 0 R 990 0 R ]
->> endobj
-983 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 629.763 210.547 639.69]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a1834eabb1a60cd21454609bb6af2b70c) >>
->> endobj
-984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 601.907 233.222 611.835]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a20f960ad44478ccbccc6ba807c88ec88) >>
->> endobj
-985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 375.06 166.812 383.907]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation_a5989bf59e335673996e366dbea747064) >>
->> endobj
-986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 146.051 147.454 155.979]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a0940a9ce95b204cbc7b0ba075e3802be) >>
->> endobj
-987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 118.196 152.436 128.124]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a26d3ec66128ed1a32ecf5905b0beae28) >>
->> endobj
-988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 90.341 152.436 100.269]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a6a6f001254ef8c3b3eddb432ca6e9dbe) >>
->> endobj
-990 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-994 0 obj <<
-/D [992 0 R /XYZ 89 770.89 null]
->> endobj
-74 0 obj <<
-/D [992 0 R /XYZ 90 721.073 null]
->> endobj
-995 0 obj <<
-/D [992 0 R /XYZ 90 647.76 null]
->> endobj
-996 0 obj <<
-/D [992 0 R /XYZ 90 647.76 null]
->> endobj
-997 0 obj <<
-/D [992 0 R /XYZ 90 618.171 null]
->> endobj
-998 0 obj <<
-/D [992 0 R /XYZ 90 572.775 null]
->> endobj
-637 0 obj <<
-/D [992 0 R /XYZ 90 479.449 null]
->> endobj
-78 0 obj <<
-/D [992 0 R /XYZ 90 472.787 null]
->> endobj
-999 0 obj <<
-/D [992 0 R /XYZ 90 391.977 null]
->> endobj
-1000 0 obj <<
-/D [992 0 R /XYZ 90 391.977 null]
->> endobj
-1001 0 obj <<
-/D [992 0 R /XYZ 90 344.847 null]
->> endobj
-638 0 obj <<
-/D [992 0 R /XYZ 90 251.521 null]
->> endobj
-82 0 obj <<
-/D [992 0 R /XYZ 90 244.859 null]
->> endobj
-1002 0 obj <<
-/D [992 0 R /XYZ 90 164.049 null]
->> endobj
-1003 0 obj <<
-/D [992 0 R /XYZ 90 164.049 null]
->> endobj
-1004 0 obj <<
-/D [992 0 R /XYZ 90 134.46 null]
->> endobj
-1005 0 obj <<
-/D [992 0 R /XYZ 90 108.33 null]
->> endobj
-991 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1014 0 obj <<
-/Length 1229      
-/Filter /FlateDecode
->>
-stream
-xڽWMs�6��W�V�@ 	��t:S;q�i��6;=8
EA2S�T�G��
��IY�]W͉ >v
v�ZY�z;9�&�
����r+ZZ!��"��oa��
v>G�,���
����?Fo>F7jl�&�|��1����'������wF^X�z����̺��1�-<�ć����K�1 >Qʴ���{�ja\��X�.��>��nf�ߙ<�N/j���!����r�+��8
.e؞�u��1D�Z�>�`v���r�����	�C�q	X�e
��\�U�_���N�|t�	
�
-Dh
����N�]e��c��
m~Ҽ�a�J����n�ق�G��7��;i�,��Y˼�5 ݵ,��wi�N��ڴ�
���^�\�q��_�ź[);[YV8���i�2]�0��|5ڼE̹������w�l�<�|��,rl�ng=Q�K�PlS��C�a2F�1vA���s��)n�r
?NӉ�-�
-19�
-
b��A�a>\����M�9���;�(����B�����X%�?����2�x�Ù�ζ{@ �g�
p��A\˥#lY�<������"_ ��b�l��p�N���3 AX7�'m�gqU��ޅw(�]��ȃ����m�5u�����$�u���M&U���n�x���m��E�F�8����-��`{��ᱎ]5s�Y�&f��z���M�(ͨ���w��#|0���vv��aW��0
��8�"�zf�>k$
� �� <k�lQu,�w���b}2:^�J|�I��0HC0
4���!�#��F����eh ��r�M�`�.ڱ=
��T�~��틸l��Y&�.�w@͈H"�'���s�JZ
�q
����_���uS��εj6��w2k`���]�!/�cP��9�1�pv��!�C!��n��OZ��`i�$��"i �GTI�U�@4OU
���B
-	�u�ZH��8�W��)�w����n-t�<�Xx
-(�T5#W�G�
���!	9����0�c�u�*��*U�ҧ^Qua��[_� �e�w��4�"k��ӑ�����O��B(�X�ߜ_!�1���a[vkڎ��ڳ^`������7�=H9
-��/���g;g,
WW�M��0�t��8_5񪝨^*�RkB�v�Y��'�1��q�ę���ײ�Jlu� ���΍���l��~���g>
m!�i��wu�y5�ΛU%�J@�
��b!���ۋ޺(e��ε�G���<�,
-endstream
-endobj
-1013 0 obj <<
-/Type /Page
-/Contents 1014 0 R
-/Resources 1012 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 899 0 R
-/Annots [ 989 0 R 1006 0 R 1007 0 R 1008 0 R 1011 0 R ]
->> endobj
-989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 708.933 152.436 718.861]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a239f39386ac001c6c20a50505e8bb671) >>
->> endobj
-1006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 392.787 172.889 403.691]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ac0b40b5fd7fce9c2e70001fe21b04ecd) >>
->> endobj
-1007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.915 349.204 146.976 360.108]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_a8be0080275e869b6858313f3ce58879e) >>
->> endobj
-1008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [122.488 305.621 136.655 316.525]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ad3af2e55a3f9bb1410625b2f98a371e1) >>
->> endobj
-1011 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1015 0 obj <<
-/D [1013 0 R /XYZ 89 770.89 null]
->> endobj
-1016 0 obj <<
-/D [1013 0 R /XYZ 90 721.073 null]
->> endobj
-1017 0 obj <<
-/D [1013 0 R /XYZ 90 655.996 null]
->> endobj
-639 0 obj <<
-/D [1013 0 R /XYZ 90 541.566 null]
->> endobj
-86 0 obj <<
-/D [1013 0 R /XYZ 90 525.161 null]
->> endobj
-1019 0 obj <<
-/D [1013 0 R /XYZ 90 419.625 null]
->> endobj
-1020 0 obj <<
-/D [1013 0 R /XYZ 90 419.625 null]
->> endobj
-1021 0 obj <<
-/D [1013 0 R /XYZ 90 374.308 null]
->> endobj
-1022 0 obj <<
-/D [1013 0 R /XYZ 90 330.725 null]
->> endobj
-1023 0 obj <<
-/D [1013 0 R /XYZ 90 251.933 null]
->> endobj
-640 0 obj <<
-/D [1013 0 R /XYZ 90 139.23 null]
->> endobj
-90 0 obj <<
-/D [1013 0 R /XYZ 90 122.825 null]
->> endobj
-1012 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F81 426 0 R /F22 1018 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1046 0 obj <<
-/Length 1729      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ�[��@�G
�$�����}J2��(N(R!)�����A
�
���t�/"�{}��]�z�G�������UL�����˅�R/S""�7�>���x<a�R-�����r�T�FN�b��f;��OΦƜ�vm����.�Vʶ5Ïj��2DC�&~��_.ߌ^^���E=f�$N�l5��zs�~�Q��w�7����,����#��Ot�c�1���j����Z �i^ȼ�+�gQ7fp���Ъ���z�ew܏���ӈ�IR�	*�c��ۈ��L����^toډ�׫�{Q��;m)���8�_�8^�=f�0	;4L�&�X��f6�����<�ߪ�L5f�jSe]QW��
9
	��0	
�
0�\6s�@�k6YW7�A`�
^(�r��[�P F��r�̹8�m���8�G�'0
p߃��
XG>SA˺ʭ�<�{���L���T#;5}Y����!�_�j�٠-#�%�`��`�(DD9�c������;{�G��_[�Zv��>��y�-��'��v,Y�H� ��67[�$H�:�
�	�� �'�E��[a����F! "�
�B����@V��=B�NX�,�}"	%,Bei�!���;�vV�֥��E����e�Vv��o�# -�	xB�H8D���1��{b�r��<7Q��˘�$/���^l�N��j�����rpٚ�5�
��L�dQ�v 5N}���[P��`�!'�=ly��:�.����N��j2�)<�=h� ja�}QPS1��#�bTɮs�_��V�+]G���Q�6Tr�}T���r���4� �U[o� s�+Y�1�~�?��n��PJ�1	io�nY
*9�zC?sB�����
-W�6�v��m%Ǿ�X����-扏�Ja��j
̛E�ZJ
b/�l�w
"�h�F\z���D$�L��J���I�Ĉj�9�;���92K�)�z]�녲� ������ U���8D�,����F�5ho�7��&ʐ��N����|�V�V�b�C7�г1�-�^��H*�ѷU�S�nBD`��^��qS F���3��N6��]b0.�w
	��:IV��3p���[wK�!�
C�x[���a��b��2�7�t�M3	b;����Ѓ�>��^!{�K���>�n����u�.�p�bz��k5]��M3���ō� 2i����2�/��$��٥)�c!���[��X
�4!B�#1&f����t���T��N_ɢ���.
��fd���}S���;:���Ag�ڹ��"��E��Ky���`���9�,�xn�\/�t���L)�7�q}X4��`?�&;
n�ny0y�M�HJ~���dƝQ��k͊��+m 
+m;�������fȣ
c�w]M�hW�,�]�gV��'j���P����n
i[��դ�닖����/]���{w���q>��8���(i,�"s��ʺ���4�h:(��" �ꏦ�?��!t��1�A�#-������q:7� �掾)���]szU���P�
�
0y�c�*n���	T0�H�>Q�w��ߪnY����
-!���W�� "i
�f��ǐ\�]:{}����x�]a�o��MV�F�v��S�-'�u��j~�S�"�VVO�X�����~
-��E��=��W��	���
ʿ��
ײ���ONf��UUN�zu3�v/�1�s���"���zL�$�2���8�
ʠ���x����8���c7��#8���
�V�y
-endstream
-endobj
-1045 0 obj <<
-/Type /Page
-/Contents 1046 0 R
-/Resources 1044 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1053 0 R
-/Group 1010 0 R
-/Annots [ 1024 0 R 1025 0 R 1026 0 R 1027 0 R 1028 0 R 1029 0 R 1030 0 R 1031 0 R 1032 0 R 1033 0 R 1034 0 R 1035 0 R 1036 0 R 1037 0 R 1038 0 R 1039 0 R 1040 0 R 1043 0 R ]
->> endobj
-1009 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1C__Polyhedron__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1054 0 R
-/BBox [0 0 210 192]
-/Group 1010 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1055 0 R>>
->>
-/Length 386
-/Filter /FlateDecode
->>
-stream
-x��SMO�0
��W�4���I$��$�4�P�ô��B����nVV�#�Z;��{�^�L��5*�	���gE �q�%��5�o���f�>��P#�!\3Ȍ{ ����
-j�P{���Ȣ�=�f,1���
� �0
3vm�?mU�1F�����
�AM�V�Ӵ[5�@DJ�$֩�V���hS���2�44��S%
-C��Fvb�,
��|ĚIpU�ֹ0�(��$٤E;S�v�S�nj+0
wݏ�ed���5‰s4��P��:���tv�6��Gr��d䊕=�^�	��L�Ih����n��j�
���D����r�����w��h�&YE��.
N���{����}�(��GE�E�gM�~ŧà*g�
?U7�
.1 ^
-endstream
-endobj
-1054 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1055 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /RKBZCE+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1056 0 R]
-/ToUnicode 1057 0 R
->>
-endobj
-1056 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /RKBZCE+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1058 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 722 667 556]]
->>
-endobj
-1057 0 obj
-<<
-/Length 1059 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j� �O1��aI�~u!���C?h�0:n�ƈqy�����
-	��wD�����.A�
G�a뼉8���z�:/d�鴊�zPA�����C��(���
N)ΰy2c� ��h0:��ץ�O�-�
�'(EӀA��{Q�U
o[�s��m.���9��,yKz48�1*EQ�y4P�<������z��U��2O/�Sِ*�Q�v�U�=g�u 
,��٪K�
y�3���#K����gi�ZgX�^�T!˒�;�,yg|"��;"�c=�Ҙ��]׷s�骩�K�����ưT��
�G��
-endstream
-endobj
-1058 0 obj
-<<
-/Type /FontDescriptor
-/FontName /RKBZCE+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1060 0 R
->>
-endobj
-1059 0 obj
-299
-endobj
-1060 0 obj
-<<
-/Length 1061 0 R
-/Filter /FlateDecode
-/Length1 1744
->>
-stream
-x�UUml�U>��m�Ѳ�]��J׭�K�~����u�]�b+��
-�hG�nd��H4�BLԄH�����0��#���g~�р�f@�H��s߮�m��9���� �@P��LF�`߽G �hݱ+q`�O]
��! �o����#�/����hs�� ?GD��A�"��;S��}�(C�;��h�G}��dtf��M�?A}
�
 ��t8���Wy� U�]d\<C���i�s��TIK� �
��s
-6�N�0�W�r�V/؜���ߐ�
88m{�
z���O�f�̱�S�.�(u!��Lap�Y��M
�� �!�l.
z5W1᰷�ZI
��M�
���B
-8�ޭ�
���3�-��p�[��LS�\sY�Zs˺�fy�c�x���I�?���TӍy���`^]�.�ɗ�%%z���*~�SQ�U��: 
(ܘ�*�
��7!�V"�
�
�����|M{w���j���=��_�cD+��г�R��>t��}�h]e���?,4�AU��5��
-_����m��z��쌩�賈ԓ>��r��A=���l
+ҷ����A�KW�Ŭv��
QO�
���=��
;;6��҅7^�_ �
���drkt��"�EyZ��`֧ìPg�i3�FU�FE���;����4������
ť|���5�
����U>��,D
�dx"7ї�'�|�+r���-
-U���
��n�5��E�/k��#Z�fb��j�J�ހ��"F?��� �wJ�ä�64n
-�_
��{-�;]�爙�[6�x���o
Y �lo����܃[2|� �w1�B(�Ly�Crﰣ�a�OX��[��x��x�q�w`�3�:�־���M�P|05�559
I�_z?��5ƮKgr�
���P��x<߉��N�5��?m5���^
���f�vo�ݐ�������#G�j'W��5
�%��seQ/����V�u��`lj�
"45S�K�����[��-�nWG�L
�K��#F�oW#OFm;&��K���o���؄x]�G$
�(�#�0�VQ�\�F�^����ZB���7����>��r���~�rۦ���b���5�'���Io���M�MM}C�&[[ i
pYnq/�ݸ�Վ���z!�l~��c�����i��N���V(�A����l�
�h́\�C,JP�ס �C
<dv�����϶6?�J�����k~�Ώ����%Y	�������%�C�_�Yn�/�؟���0@��������sC'�K�A����< ->�
,8J��a�
���J��0{��ϒ�G����8�A�P�U@8�^�8�g2�p�}${��AR�E���>DC%=oT.����r�
-endstream
-endobj
-1061 0 obj
-1339
-endobj
-1010 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 416.071 184.651 426.975]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_ae6b00d1beeeae893cca2817406d0039a) >>
->> endobj
-1025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.633 416.071 304.022 426.975]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
->> endobj
-1026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 392.523 184.651 403.426]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_ad4fd0a018fd96e10fddd740337f60ebd) >>
->> endobj
-1027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.467 392.523 248.023 403.426]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-1028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 367.344 184.651 378.248]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_aba7be77030b5b01a9e1049ce41bbfa77) >>
->> endobj
-1029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.467 367.344 248.023 378.248]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-1030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.836 367.344 333.302 378.248]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
->> endobj
-1031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 343.796 184.651 354.7]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a5431caa9e7f5c824e9a6ac2e6d69fd87) >>
->> endobj
-1032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.467 343.796 266.294 354.7]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-1033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 320.248 184.651 331.152]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a0a28bc5d3066a6ffe552a90aa688fe46) >>
->> endobj
-1034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.467 320.248 272.919 331.152]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-1035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 297.073 189.015 307.603]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a4980562fb3e164d31f6a0ce66b638ce3) >>
->> endobj
-1036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 162.512 184.651 173.416]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a6eb50dda90cfae549d191f5124f2562d) >>
->> endobj
-1037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 137.333 184.651 148.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a922faaab6e2cb023231b56b049bca0f4) >>
->> endobj
-1038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.222 137.333 347.688 148.237]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
->> endobj
-1039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 113.785 184.651 124.689]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a848091b71fff6f0085950e64b6479e4a) >>
->> endobj
-1040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.467 113.785 264.61 124.689]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-1043 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1047 0 obj <<
-/D [1045 0 R /XYZ 89 770.89 null]
->> endobj
-1048 0 obj <<
-/D [1045 0 R /XYZ 90 456.258 null]
->> endobj
-1049 0 obj <<
-/D [1045 0 R /XYZ 90 407.609 null]
->> endobj
-1050 0 obj <<
-/D [1045 0 R /XYZ 90 311.786 null]
->> endobj
-1052 0 obj <<
-/D [1045 0 R /XYZ 90 177.394 null]
->> endobj
-1044 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F90 507 0 R /F96 1051 0 R /F72 326 0 R >>
-/XObject << /Im4 1009 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1076 0 obj <<
-/Length 2129      
-/Filter /FlateDecode
->>
-stream
-x�Ś[s�����+xJP�զot��R��gR3�q����Raܖ�E�4^���4ЈF�F;���F�}n}�ק�<g�x��g?<̮�
�	P��yxv�,@܇OO�g����
�K�&Uwo�y�����^?��{�}�ax�9��ϑ�N��}��s���G�C4��K5h�0B�����5�S��I~�$��a��a\�^)7Ӝ�
�yn��p��
sW��{�c�%*L����|�X�S5Q��v*_=f��iE�NW��Ji1��Q�ץ�|�wV�{�Zf�a���,
�}���z`�_��đ�ϴ�� �ag�)"���x�/(gn�Q������*���Y+�~�r�'A���J�����J�l� �T�aY�1�)q� =�QjN�:���qY�6���ƃ2P
P��=(�zS�13�S�r����/���
V#�
5�iA�8c��

-xP
{�bPe�0�T��Du� �u��U��N�,D��,gA)�eݗP �#�]���M��Oj��sH_�ߧQgiq&A����\=D�^���χku���8�����H�� �!~���3��7D��]�
ӽ�`�h&X��Y���*a�6�E����]_\�j�	���
oq��I��0_�¼���LϢ���p|k�ױ,[`&��.8P�I��\z���
*���ׁ��;1^�r�-�b�4m�A�p�ng��sDE�@cj3�%��o����J�F��w+��B��)��O�/��#i���U��]̬{c�O
-��B5x
��Z�l_]D��6L�9�ܵ�S�O��!��#om d|٢J�<���P��90"}��0N��ު"���I���҃U�=�5�f2u�%�:� .��V�d�q<��3K������-�
y��ƕHD��2k���S���,�oU���s�V�w�V�F�
O�I
���y^���TȠm+�6R�$��� �bϒ9�n�!��-L�@=��'�c
B %�O>w�ͩ	V��X@}DD`[��S�v�P*
4D�~bKR�aI�d���`�w�,]7%t$
-�������!�>F ��Z�T�a�V��x at j 9z�w~�Mi;�m��
�j}A� 	}  �
�}�<
6͑�����M������W��b���M�!��O���ۃ[�eG�u� �Q}�
kO
�
-����i�,
�#i���bD+�ݧ����H�v=� 
As�M�4-q@�(Wa���g����/��m�գ����<@'O0=v�@g��(�Y����j�����Bc�W:�]'H��2X0jA���$%>�ٟ�Z���E��@����~<$�����e�吜’�#,�,e�=��A	�~��/i�K�`�"�<=��A7�L��,n
�&���k\
V7	���V�`̱�VQ5��b`� c��?

Y���al�	��ClO���nD-��+��r|ղ�
 �	C���E�6}6�h��UU-���ls�u��^xv���q�!�"v����Y�/a��
{,���3�
{,
.g��4�aI�A`E��ָ:R�qZ��E�����<�Έ�`=D����d���h�g[Å����!�ZG�Z
;�^���oc�0Q͵
-
������u�R� ��&.�^��H����d#���^��
� 
�[�Cl
�0l/O�!-���"
M��`�R?
CSX�`Ȳ�r
MaI���\��u�Wi�^�P��1y�� �$T�x
���&iJ�c�qtC
�z<��>�E,P at i�C\�Egړ�'��������
��H�Y�B�:���A�B}��D]��h

���M`��ۖ@������ݻ��4
d��0���qA�
t��c�y���y
�.�
�y�;��>�ٌ꼙?������p� }��$�L�H�}���k:
-��T���A�q���

��r�WpcGO�l��
��ֵ�
� A��_�t&2M��'_�

�I��{]=4s���Թ�@�Q��-���R|X*����Cf�ڱ_.�/>��}�7�'6��c�����!-U������]���s��&���toB��b^3�{#l�V�|AAν2��ծ��z��Y�u]�t��l�r�������P������q��b�۷��&
��)�8���ꋡ�������
-endstream
-endobj
-1075 0 obj <<
-/Type /Page
-/Contents 1076 0 R
-/Resources 1074 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1053 0 R
-/Annots [ 1041 0 R 1042 0 R 1068 0 R 1069 0 R 1070 0 R 1071 0 R 1072 0 R 1073 0 R ]
->> endobj
-1041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 707.957 306.942 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_af495c3499ed2742d6b68bc6bc99224d7) >>
->> endobj
-1042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.757 707.957 370.313 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-1068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [124.15 614.445 183.706 625.349]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-1069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.935 602.49 340.357 613.394]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_ad51277b918f8fc2a6892b1a987f8f746) >>
->> endobj
-1070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [344.172 602.49 403.729 613.394]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-1071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.189 602.49 473.746 613.394]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-1072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 529.941 191.678 540.471]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a2cd3747157a618a88e2c95bc45451f12) >>
->> endobj
-1073 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1077 0 obj <<
-/D [1075 0 R /XYZ 89 770.89 null]
->> endobj
-1078 0 obj <<
-/D [1075 0 R /XYZ 90 645.973 null]
->> endobj
-1079 0 obj <<
-/D [1075 0 R /XYZ 90 549.224 null]
->> endobj
-1080 0 obj <<
-/D [1075 0 R /XYZ 90 549.224 null]
->> endobj
-1081 0 obj <<
-/D [1075 0 R /XYZ 90 499.216 null]
->> endobj
-1082 0 obj <<
-/D [1075 0 R /XYZ 90 440.557 null]
->> endobj
-1062 0 obj <<
-/D [1075 0 R /XYZ 90 417.882 null]
->> endobj
-1083 0 obj <<
-/D [1075 0 R /XYZ 90 417.882 null]
->> endobj
-1063 0 obj <<
-/D [1075 0 R /XYZ 90 348.754 null]
->> endobj
-1085 0 obj <<
-/D [1075 0 R /XYZ 90 344.271 null]
->> endobj
-1064 0 obj <<
-/D [1075 0 R /XYZ 240.245 274.96 null]
->> endobj
-1086 0 obj <<
-/D [1075 0 R /XYZ 90 268.32 null]
->> endobj
-1065 0 obj <<
-/D [1075 0 R /XYZ 332.797 213.12 null]
->> endobj
-1087 0 obj <<
-/D [1075 0 R /XYZ 90 206.48 null]
->> endobj
-1066 0 obj <<
-/D [1075 0 R /XYZ 338.775 151.281 null]
->> endobj
-1088 0 obj <<
-/D [1075 0 R /XYZ 90 144.641 null]
->> endobj
-1067 0 obj <<
-/D [1075 0 R /XYZ 461.214 77.486 null]
->> endobj
-1074 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F81 426 0 R /F11 387 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1102 0 obj <<
-/Length 2502      
-/Filter /FlateDecode
->>
-stream
-x��ZY��6~�_����,7�dk�b;N�뤼��횢4��	%�����m\IQ#%��v�q��F_�,��r�����K��
e���z�d8Q<CB¯��CJ0ғ)����^�7��|�3�u~S�:�&
-��ye1��¬�ɔ
-�>/���/ߙ��'D�f=7 at M(�R�&��__�|}����48!��@J'��ՇO8��ׯ�X��{��*���L�_��
-��`D�]�G8�&�c�iO�E�{�Ci��Hb�v2�=&E��Z��Ñ��DO�䄐�ks�{����N1�}��z��N&R�%��!�]D &UYO��Fӎ
-&D��zT�!�/#HF���ϥ:���
�D0�3	|
�_���yS�7���Y�
Y�٠	���[�I�E8�J�O�1q��
���J0eN� b"N�v=��m��?�fBEzb�?b
�S��E]����3~��'q�j��x� ��=S��
�'4�Zh?A�
��C�eɔ($!zݟ��=�b�e�W����E3<�&���m�2�mw‰FN@����
�g`�)e�4D���N��
��Y� 
���ܭ�M��E5߁�M�^u���^�]��k����A�tVU��-y���
%a�i��S�
$��H3~�Q
��2�%FB
؟|_�!�HѾG�o�ـ
äD��K�d�$�}if�n};�6� �K��4"J��BqP,ׇ|98�1?�*h�÷X������y�LA��i������ᑤ2e|�Lʸ��o�N( V\E�

-	F2�X�`
F�K���g�be�\�K/�l"�" ,,�˺�w#�
EW-�^+`sW��+� b$~�{�
"i*'�Qш�����(
6��E|�?{w4�M5�"�cq�4�Μ$ŬM��A��O�V`���ؚ1�k$u��E^n��L`
!��tE�!";�H�&<�2(� ﹧#��׹��
���9�D���>l�S�
Q��=�#��~o���D���p��'2�J�I��E�
@��Kz�I]���z(��mQ�)��T�Lk�ZO8N��eq{�S=a*]�*�f�
-6�]^��Kk��
�#� ��]RA���PC�qD�א�G?�p����뻺rEh�
�1t�P�Kr8>�]�t�-�������y��@�7+M,P��A�
��G=
R�fTq�0��'�
Z4~ݭ�i�����O�
�o��ɠ��<͋�[��9��,�f��H�WH����Y�'�$���	�I�&�u�5�H��se{<���wf�HR�5����ގxH:.��h).!P騾���|�pf�Q^�����;�������e������a�uUO������%�R�?�?�s�
��s�
��S�� 
�z
���bm�
�Ž�. ����� 2m�0`G�RfR�Ӡ2l
���6OF����?C��M�G;�^�|8e
-|��~d|����	�2��`t4-�2��*��XP݈�P�������.��ۍ���X� �M���!
���`<F�" `
?
.�ƃ�vH)��~�pF���Y�?��	���rd�$ޏ���V�]�Ǖ�N��n����Ȝ�3m�>%�v7������y
�� �M���_���<��Yu=�F���6#RX���Ul���$dlSoMG�}3s�1�ۨ���~
h	*h?����/)	ZE���!I�w�PM��ژ�y���K;�m�SۦD����(�"�:y��-��Gndq������ ])�ώ���gʠ�cΖ|�
-
�xf
�)�� Z�y^������
�B-�>
-��
��uڵ�V��v�3�d\�ct��\�����b�ٌ^-@��Ǽ�^�N&�2��(v ���ԧH۽
3
��lB�6@�vN߻3ia�n���H'�aI�OE��f̘$�$"��X����k��U
*�|_�<Fb��1�G�UY��X/�+{\���
(ę>����_�D���ܸ�����E��B���b���.a|�@�83����%�>u
),B�����PZ��ʮ#�5�f��gބ`{e�.���G��}����������b�RS�K��gǞ����[��;�۷o��/k����i�ߢ�X��f Pi;s+��=���qx������<
�O}><�Н}< &��R
L���i
-�3���I$�
�r�Ev�ש��t�_�rg�f�C6��܏�Ce�e
YA.9��l�i[�R���n�+�-�_ў�N�+�/���X��j�B����oy�l�
�N��J�(�*�wS���n������E=��jì{k��*E��C�
�R�X�h���i����l\��[I����ڊswp ��v��K�-^w�{�&_/w�2|hݻ^��%��ǿ����D�4(��|��겖��f�����/�\����$���GW���^z����w�wM������n	�X���%���߬��0h�UU�}"�\9{�X#�|L��4*��2(&JQ�Ew��7�O_�X���g���^U
-endstream
-endobj
-1101 0 obj <<
-/Type /Page
-/Contents 1102 0 R
-/Resources 1100 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1053 0 R
-/Annots [ 1091 0 R 1108 0 R 1092 0 R 1093 0 R 1094 0 R 1095 0 R 1099 0 R ]
->> endobj
-1091 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 525.942 201.372 538.341]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 512.438 201.372 524.433]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 174.577 159.927 185.107]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a22380e8edd12a8121b5af6a60eb05da2) >>
->> endobj
-1093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 146.478 159.927 157.381]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a27e2ee6c6e6f960cc523a3366249f5f9) >>
->> endobj
-1094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 118.752 159.927 129.656]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb12fac766004b358c5) >>
->> endobj
-1095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.026 159.927 101.93]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a1ef0c686ebed5c06b004a0799f3b1599) >>
->> endobj
-1099 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1103 0 obj <<
-/D [1101 0 R /XYZ 89 770.89 null]
->> endobj
-1104 0 obj <<
-/D [1101 0 R /XYZ 90 721.073 null]
->> endobj
-1105 0 obj <<
-/D [1101 0 R /XYZ 90 654.651 null]
->> endobj
-1089 0 obj <<
-/D [1101 0 R /XYZ 90 632.275 null]
->> endobj
-1106 0 obj <<
-/D [1101 0 R /XYZ 90 632.275 null]
->> endobj
-1107 0 obj <<
-/D [1101 0 R /XYZ 90 549.698 null]
->> endobj
-1090 0 obj <<
-/D [1101 0 R /XYZ 90 503.497 null]
->> endobj
-1109 0 obj <<
-/D [1101 0 R /XYZ 90 499.014 null]
->> endobj
-641 0 obj <<
-/D [1101 0 R /XYZ 90 280.727 null]
->> endobj
-94 0 obj <<
-/D [1101 0 R /XYZ 90 273.864 null]
->> endobj
-1110 0 obj <<
-/D [1101 0 R /XYZ 90 193.112 null]
->> endobj
-1111 0 obj <<
-/D [1101 0 R /XYZ 90 193.112 null]
->> endobj
-1112 0 obj <<
-/D [1101 0 R /XYZ 90 163.652 null]
->> endobj
-1113 0 obj <<
-/D [1101 0 R /XYZ 90 135.927 null]
->> endobj
-1100 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F99 1084 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R /F11 387 0 R /F90 507 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1123 0 obj <<
-/Length 1763      
-/Filter /FlateDecode
->>
-stream
-xڽX�r�6}�W�f*�$ҧı3N}k�N�q2
��d����D�Ņ�
m'N�H��bqv����p��f�j28:��#���L����
-�=x�9�C�>N�:�

Lң�W����ɍz78�
>��1�9�'Zn?bg�o
���/����R��9���v�k�D��\8>!���J�^|3]��/���
��1�xx�������i˴�L��(��c;�k�q&"�A�\2ףӀ:l�s�v(E�K�1q�p]��WU�̊�6�K����.�+�G� �Ɗ��I
��|�Y�#�̾G
Ƕ�
���G	~`
�M���� V��2�|���� �N�U�v�����|���\�K�
-�8K{�$�E��@�wq�KJ'�qh(
'��U�8KK9"|��y?�
Y�����[�Iss&�������M�{�
���8��Muў���!@�2
-<d}�Q���
����&��\N }Z��J�� &]�1\3V�x�?xE�>��­�{
U�0Ł�N��yAL+��)������󚀀�H�a��w����	U:ͪt&g��#6�]��ј`��,�8�3�ײ��x�+���0��E����}iӷvT�">���j�IF
-
F�C]��J
!#��ޠ̄�4��BmM[��5^��T�rD�w���u��ab>�W+�R�FvvV�EUn8Q���I��07c���q���-�ˢP��[�_Z�y��#
��<,�����RB��dJ�
�[�:�̓c�f�&~i2�3�:��e��r�,��#f�&�Va�
w�
�.�z2�}��>���"��Y�}�!�]�#�m꯲dD�p}'g�����{��)Ơ���O�i��!�G
"�˛"�<��L��k� ��ާ �o��f��/�%Y�
�P�6C�M��S��{�.�����n$sXXmW�
���r�0g2��������.��"N��N�@��n!��#��f��I)�'�ړ�p�-N�Fru���\�Y@�ߖ�̧���^�O��~o���6�4�� �﵋

-��lY%p%�մ�E=-�B��t�-#���q*4>��
-���O�}��*�]�|:"�3 ��ЯԐ�`�SK�B��̞
�1����1��x�N�S
�Ⱥ`L��Lޗ����R�<�W<dSS<�L��N��iW�!�N����
,l�8ü�H��e	�����nH�=�6QS뤡�N6d��5��6>Q��
T�0,:ZB���<K�8�)Oqw"_t�V#݁^�&z���lC����v1J�1Ϭu�Q�!EA�]�r�#J�"�����rA��Ӧ��R+��?��(���+)��U.}���
��j���8$ p��8tl���I
-'�ji
�A����e�~Y��U%����u
-y���7��&cY<Z����/KPWSe�*��N�
Z	{�/�����Wg/��=���>?��l�WK
:�rج]��H�J�(�QXX� C�i��k��
xP{:C8��J�C�{����3����O��U��
ڬ9����6/8p�Q�$��`M�]x�ՠ��v�6'�
��Ղ���7=�|�	��Uܚ�Ӕnl�L|���{���c�Ζ�y�����1�o
֝��5��+��ҭ�v��7��v�#� ��pa?T?��n}�
�����*�m/�Ӫ�:k��Iy��U��!���̲�.������1в��H7�9��r���hZ-@�,��n�7�}�&kz�2˛]s�g7�i��@���
-endstream
-endobj
-1122 0 obj <<
-/Type /Page
-/Contents 1123 0 R
-/Resources 1121 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1053 0 R
-/Annots [ 1096 0 R 1097 0 R 1098 0 R 1115 0 R 1116 0 R 1117 0 R 1118 0 R 1119 0 R 1120 0 R ]
->> endobj
-1096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 708.331 159.927 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_afd68df98e748af269b3588ca5504bb1d) >>
->> endobj
-1097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [163.743 708.331 209.76 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.759 680.062 174.861 690.966]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) >>
->> endobj
-1115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [158.861 652.166 215.488 663.07]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_aebff23eb304cef5bcd9ac11ee5d7c7ed) >>
->> endobj
-1116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.883 582.736 193.271 593.267]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a2b3404ee14fc16f5592bb10a1a4bdd7e) >>
->> endobj
-1117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [154.225 493.251 200.241 504.155]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 176.454 250.936 186.382]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class_a5c1b244e9422e1c29c71844a9f896aee) >>
->> endobj
-1119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 147.941 227.703 157.868]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class_a00d82d93d2d0113f1ea5b615decb2849) >>
->> endobj
-1120 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1124 0 obj <<
-/D [1122 0 R /XYZ 89 770.89 null]
->> endobj
-1125 0 obj <<
-/D [1122 0 R /XYZ 90 721.073 null]
->> endobj
-1126 0 obj <<
-/D [1122 0 R /XYZ 90 697.321 null]
->> endobj
-1127 0 obj <<
-/D [1122 0 R /XYZ 90 669.426 null]
->> endobj
-1128 0 obj <<
-/D [1122 0 R /XYZ 90 601.272 null]
->> endobj
-1129 0 obj <<
-/D [1122 0 R /XYZ 90 601.272 null]
->> endobj
-1130 0 obj <<
-/D [1122 0 R /XYZ 90 554.168 null]
->> endobj
-1131 0 obj <<
-/D [1122 0 R /XYZ 90 467.721 null]
->> endobj
-1114 0 obj <<
-/D [1122 0 R /XYZ 90 445.345 null]
->> endobj
-1132 0 obj <<
-/D [1122 0 R /XYZ 90 445.345 null]
->> endobj
-1133 0 obj <<
-/D [1122 0 R /XYZ 90 384.621 null]
->> endobj
-642 0 obj <<
-/D [1122 0 R /XYZ 90 283.569 null]
->> endobj
-98 0 obj <<
-/D [1122 0 R /XYZ 90 276.582 null]
->> endobj
-1134 0 obj <<
-/D [1122 0 R /XYZ 90 194.781 null]
->> endobj
-1135 0 obj <<
-/D [1122 0 R /XYZ 90 194.781 null]
->> endobj
-1136 0 obj <<
-/D [1122 0 R /XYZ 90 164.533 null]
->> endobj
-1137 0 obj <<
-/D [1122 0 R /XYZ 90 117.765 null]
->> endobj
-1121 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F81 426 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1157 0 obj <<
-/Length 1909      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ�[�i�  2�>��1I�7v�����`�)�����wq�"%�Gq�$�\�.v�� �-<��q5:{-��HP�]�x�d!.������
O��_�e_/���V���:M�e\ޏ%��y�/ʕ�gj<�
��i\Uv�QݨrLB߾%��g|��������ۈ�.�#V6G2�f�������;#�ޝ!ʼ�2�M���_#�݆��!����[�ּ��2��q��}tS�vQ�&Nc��2������B媌k5w�E�|�^iZ�)��|a}Ƙ���m��G
-X�M�@ԩ��R�'�4�`��"[�jL��#�﯍]��xL��]K��G�r���y��ۏ8���F
�K�ó�!\ 
�F���x([���u �#��b��� X�[<m˧X"�?�|
-k�x_�E�x��c�7PL����J��
�M��&4@��‚!Mr;��ZYh�
�\1��(#��b5e�dfu����*���*�ipW=%w(��x�p�/ʅs��4[km ��c�|�{�������RU���<���
Dž
�r^�o!�t���C\2��aӐz!�Th0Kk��룪We^md�Y�~g�	;|B��s��HCC:4ߒ74�������B���IC�ݖ�`�χ����l�_�$�
~N���t�

�PR�PHX�G��@����NP�ꦾ����u��w���r�J
�+��Y7֖P�:��
*
m�i�ض�!-���<��J��&/���bs#��F���)�����Fߟ�v=+�tU���b���
�h�i���l
-}�
SC��Ojh�̂
0�3k�j�~�-���e]��noQ��Y�\�W���8v�4"ۦ6��UM�Z�y�v]��?U�
v at D�.���.짺�.zT?��V�#m
=������qBB
@`�G��]�ڒE�f!�6��A��~����{�'�V��=�s�,�d��';�30�1�fPž�͈���^�:N���/U5+�e�Y
7��:G�/�M�r�E��Wp��͚9�@����O6RQWZ�t��66�M�1
��;V
-Q ڨ�i1m��
�!dăκ��/���J�TS�!���̒厌u���p�-���@�#!�&����DQ�P�l��Iض�N��FY����<
��1������x1���!�1�JD���_ ���
�_ęU���6�p��3΄����I�a%l��.�@Hl�*}��``R�h���

�nU�$R���Q� 7}���Z:j�6�<�Tnf�\ǩ~��s�Z�3�l����h<���簞~	H�]�M
u/�S�B�8�7��T�SޞR�I<M� pC0I�����|�ZG4d'X�X�q���?[{O��bb���'�LHG��=+�a��
�HUfz%}=fl�B钛�u��Rs��UP4 �}�+r�A����!`��:
��4!�!D��C���6��
-�Q.��	�BY���ܠ#Z�Օ���ܳ���Ӥ����UzmgHL��@�
�SU y��c*@t��c*�<���� ��`~Q�B�n�Su����5u��f�=��z�ct������
�ʔDr�P�Y/+�y$N��W�w�z
ز,�jG	}=D�q�4� ��H��o��7)�OuB��?!�6�'�?Ѽ�a�C�ON!��?���s��
Ð��Ita80�[O����V���m(�L�歪����S��:6�4��
{���e��,�$�MqhC���]���ދ��b/
�[}�sc⯹���R�/c
���!�W��n��QKY��M�9.APd�ϥjli���׬��ʴ[JC}����u�|~v6]-��/Ьȶ���XB�m��&��(Us�eO�@O�@�1=�	���x`�o�HI
Ewm^6�go3�,�'���py
-endstream
-endobj
-1156 0 obj <<
-/Type /Page
-/Contents 1157 0 R
-/Resources 1155 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1053 0 R
-/Annots [ 1138 0 R 1139 0 R 1140 0 R 1141 0 R 1142 0 R 1143 0 R 1144 0 R 1145 0 R 1146 0 R 1147 0 R 1148 0 R 1149 0 R 1150 0 R 1151 0 R 1152 0 R 1154 0 R ]
->> endobj
-1138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 564.412 164.042 575.316]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_adf1055ffa2127b453280f5491cb15ffb) >>
->> endobj
-1139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.858 564.412 245.107 575.316]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.991 564.412 337.241 575.316]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [352.125 564.412 398.142 575.316]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 535.286 191.16 546.19]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 535.286 252.31 546.19]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a90cc7704ce2f0ee6c205bfa3877a7671) >>
->> endobj
-1144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 506.16 191.16 517.064]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 506.16 257.849 517.064]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a3c4dfe2a773355c5842dbe133a7c974e) >>
->> endobj
-1146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 477.407 159.927 487.938]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 477.407 196.739 487.938]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a894f888629036722adcbc81268cab48a) >>
->> endobj
-1148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 447.907 215.13 458.811]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_af6656a7b76ac03bbfccba848d6a42dc2) >>
->> endobj
-1149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 418.781 201.302 429.685]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_af0873d79c213b1552008ea16229b58e5) >>
->> endobj
-1150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 348.142 159.927 356.989]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 348.142 180.131 356.989]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a6f45bd1aa87e7b459ee0d93a65ff05db) >>
->> endobj
-1152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 254.696 227.951 265.6]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-1154 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1158 0 obj <<
-/D [1156 0 R /XYZ 89 770.89 null]
->> endobj
-686 0 obj <<
-/D [1156 0 R /XYZ 90 674.158 null]
->> endobj
-102 0 obj <<
-/D [1156 0 R /XYZ 90 666.788 null]
->> endobj
-1159 0 obj <<
-/D [1156 0 R /XYZ 90 584.022 null]
->> endobj
-1160 0 obj <<
-/D [1156 0 R /XYZ 90 584.022 null]
->> endobj
-1163 0 obj <<
-/D [1156 0 R /XYZ 90 552.753 null]
->> endobj
-1164 0 obj <<
-/D [1156 0 R /XYZ 90 524.035 null]
->> endobj
-1165 0 obj <<
-/D [1156 0 R /XYZ 90 494.909 null]
->> endobj
-1166 0 obj <<
-/D [1156 0 R /XYZ 90 465.782 null]
->> endobj
-1167 0 obj <<
-/D [1156 0 R /XYZ 90 436.656 null]
->> endobj
-1168 0 obj <<
-/D [1156 0 R /XYZ 90 365.694 null]
->> endobj
-1169 0 obj <<
-/D [1156 0 R /XYZ 90 365.694 null]
->> endobj
-1170 0 obj <<
-/D [1156 0 R /XYZ 90 315.89 null]
->> endobj
-687 0 obj <<
-/D [1156 0 R /XYZ 90 126.942 null]
->> endobj
-106 0 obj <<
-/D [1156 0 R /XYZ 90 119.572 null]
->> endobj
-1155 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F108 1161 0 R /F101 1162 0 R /F90 507 0 R /F8 437 0 R /F1 1171 0 R /F10 1172 0 R /F13 1173 0 R /F7 1174 0 R /F11 387 0 R /F24 301 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1195 0 obj <<
-/Length 1377      
-/Filter /FlateDecode
->>
-stream
-x��X[s�8~ϯ���3D���}*�0���m�	���(����
�����];����
��Ɏt���9�92�V��O��&G�>�BzԳfK+Ė{����s>�^Z�
	=��ޞ��fv�fv)����&�'����9�+�&�>`k�_Z�0��ՠ�r)�6�.'M����+, [�A�ho����i;SJ�������&���+���oڣs��_�!�LD������rk�������z7��'E�*�����E6��(��{�1����Z��\	`x.���#
��s*�Q�֎2þ겉�|�L��ܡ�n�tQ�Q�[�m�ݭ46�/��!�Bd[M;H
 �#
>�N
��/��
]�e����{xT��8I�M�y
/Dݔ�=jI�]eյX��$�E�G�~*
��b��J�u$}�� 
��o�" !A���P��I�G
q�I��s�#N��=���z�0>�W��
S�u�nQ<P�-����!�NE.�z"�H�3%�=u���U at jNE��F��q���d����Q)�yԀ9V�v1�(�����Bw�4����f��.iHUm��o�
�'�3;A�n7/�J*1@����[hwMP�ͮ�lHw�����C
]mq�6��(�&z
ȁ�(��Ǣ ��C�x臕�Euʱ,���*ZciZ�x���=�4O�8�<đ���X��9<�1�I�\'�sM(ՎnVc.r۬'��/�D��w�;�rE�C�A��#�3��K�m:�a 
�#lQ��aS�!��Z,�{֧��!֧�a
��&�2�����6:Q�6�������t/�
-Q�q�m�&T/t��I."�m�s�I��[��{	h���z�2uR��Hz�n�������U����D*ȓ�q!R�2�
��
#�H���l����I����\��Iݸ����v�9��=^%��k�Z+u�Zǒz=L�'R�Z5�sҞ2V����E��~����#IŲ�ZG��J�A+rOӉ�\W���#�`G�A�}�ꐸ>�>�����j�X��]�������=$琀(w�T䣤�ҢQ�?%�ݟ��H��*��$�����7�_����EO��x҇�x�?^unߠ�[��M���T䰋ێҰ��	�VD���Dw{g4��߇�%g���
�E>�
�R�_�ő%�AK�7߻
��d=
-���&ۛ������Ø�>U����v�yq�"c�i�n�M���֠����z(��et 7�f�����+�yٿ��<�WM�2_H]�kzl^�]��7�s۸��(oZ���5����'H�ҟX/E[��|�v���~N[��.��u�yzt4oV�.+��p����{���}�ȊR�G�3�s�� $�δ
-endstream
-endobj
-1194 0 obj <<
-/Type /Page
-/Contents 1195 0 R
-/Resources 1193 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1053 0 R
-/Annots [ 1153 0 R 1175 0 R 1176 0 R 1177 0 R 1178 0 R 1179 0 R 1180 0 R 1181 0 R 1182 0 R 1183 0 R 1184 0 R 1185 0 R 1186 0 R 1187 0 R 1188 0 R 1189 0 R 1190 0 R 1191 0 R 1192 0 R ]
->> endobj
-1153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.15 198.363 696.054]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System_ae287421ae1ceab78c861efb2803c1edb) >>
->> endobj
-1175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 657.059 215.13 667.963]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System_a559e1395399115eb381a421c8916eb1d) >>
->> endobj
-1176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 628.968 201.302 639.872]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System_a6efa775d8084cb3611b1b6b512dc2827) >>
->> endobj
-1177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.91 539.493 266.363 550.397]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-1178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [110.861 527.538 160.993 538.442]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-1179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 370.199 157.417 381.102]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a2531a33c20c3cb27ea7fcf0a04339c2e) >>
->> endobj
-1180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.232 370.199 238.482 381.102]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.135 370.199 327.876 381.102]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-1182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [365.454 370.199 442.704 381.102]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 342.107 191.16 353.011]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 342.107 252.31 353.011]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a9fb052eb3479e107bde4cfd95599c787) >>
->> endobj
-1185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 314.016 191.16 324.92]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 314.016 257.849 324.92]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a5b54a0e76432b52a2259a02f31fc0b83) >>
->> endobj
-1187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 285.925 185.651 296.829]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-1188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [186.149 285.925 205.855 296.829]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a19ca194f097ddf860d1ad80961a5eda2) >>
->> endobj
-1189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 257.834 215.13 268.737]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_abd74986494a6e574bb0499b3b7109379) >>
->> endobj
-1190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 229.742 201.302 240.646]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a6062c78f7cefbc808b99f35b72fcda8a) >>
->> endobj
-1191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 140.268 221.326 151.172]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-1192 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1196 0 obj <<
-/D [1194 0 R /XYZ 89 770.89 null]
->> endobj
-1197 0 obj <<
-/D [1194 0 R /XYZ 90 704.242 null]
->> endobj
-1198 0 obj <<
-/D [1194 0 R /XYZ 90 704.242 null]
->> endobj
-1199 0 obj <<
-/D [1194 0 R /XYZ 90 674.417 null]
->> endobj
-1200 0 obj <<
-/D [1194 0 R /XYZ 90 646.325 null]
->> endobj
-1201 0 obj <<
-/D [1194 0 R /XYZ 90 600.455 null]
->> endobj
-688 0 obj <<
-/D [1194 0 R /XYZ 90 477.149 null]
->> endobj
-110 0 obj <<
-/D [1194 0 R /XYZ 90 470.427 null]
->> endobj
-1202 0 obj <<
-/D [1194 0 R /XYZ 90 389.29 null]
->> endobj
-1203 0 obj <<
-/D [1194 0 R /XYZ 90 389.29 null]
->> endobj
-1204 0 obj <<
-/D [1194 0 R /XYZ 90 359.465 null]
->> endobj
-1205 0 obj <<
-/D [1194 0 R /XYZ 90 331.374 null]
->> endobj
-1206 0 obj <<
-/D [1194 0 R /XYZ 90 303.282 null]
->> endobj
-1207 0 obj <<
-/D [1194 0 R /XYZ 90 275.191 null]
->> endobj
-1208 0 obj <<
-/D [1194 0 R /XYZ 90 247.1 null]
->> endobj
-1209 0 obj <<
-/D [1194 0 R /XYZ 90 201.229 null]
->> endobj
-1193 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1220 0 obj <<
-/Length 1332      
-/Filter /FlateDecode
->>
-stream
-x��X[S�6~ϯ���3��Œm޶�0�e'�v�q
%x�KV�����ز;�t�Ɗ9����;G����������љ�� �
-�vn��� q�f֝M0"����
U�/���A�Tx��S�'��6:ɳ�Ta���7OE)SgL9�O��(��ZΥr�o�,�p"���s��^�>ݎ~�@��8�|+JGw߰5�חF,��F(�\��X7��G�k�ش�D�6��Aj,�<�R��a�~5ϕ^�q�8Z�t����BfR����;U����
�$�C��g
��+�4�Ǎ��Er�o� �y�A~������
���0�
:�?k�E�����
��
�8���F
s��lO`�A�@N
#!������U@�@�1�m�r��1@*9��:���S�!��觰�����vƾ���M�
`�p� `���Dz�ꯪ�P5�gK�M7+62}Lqs昺�3?��+:����^�Z�})�>
C�P�m
M�)�J�Hc���T*�>���.��v�U�3��}�ݯm
�w������e�1��=p|j� G�MX(��r��Ω��URv�VEe���1J�օX�ɬ���e�.˧�����N�E��bPA�y�Ȁ�jZ�Y�ݒ�M�j��;|��.�8��U��=�x-�Je.jT��7
���K���D�R�X�G�'m�'@::�_# AL��(o�����$�����������{R��6/��7�J� S�����̘�
y�m�өi{թ,�8iR��T���
�g"��̋�V�5mPo���;�~�Qٮ����?,��?� �2y�P3��3ԏގ��_�7�
#��e`��@`q!7�j
���P���f�'msm��w��?��ġCX��f1��Y�1(�@
2�1(� ��ņ�of���
��k��#��a��Q��
��C];Ta*�m�g
�@,�� H��/�Y3ܧ
F�*}�4��C{�WZ����b�K�O�V4X����K�׌�;'ŏ%4�i
ժ��ˆ8��8��r�S�+�犱�*��M�Jdm�!}��[]�
�����ҵ̪�tg��4�vk�}��x���S�u�m�;��@�
B����7�� hZ��9����ox���O���0�$oäyQ�Pú2tނ�b�7+��ù]
B�-��Oq(��C?řOp
T���z���L&���[�͛�a���E+xQ��
�D�?
-���]�Ye���UI_�T��)���җ�i�����2���ϡ�����O��,��GG�j����t;��͞�� f�*Di�����/�D&Y��9���8��(
-ϣ�Dw���ll_
]��:�!&��5�M�
-endstream
-endobj
-1219 0 obj <<
-/Type /Page
-/Contents 1220 0 R
-/Resources 1218 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1230 0 R
-/Annots [ 1210 0 R 1211 0 R 1212 0 R 1213 0 R 1214 0 R 1215 0 R 1217 0 R ]
->> endobj
-1210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 567.007 191.737 577.911]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System_ace9427756858d751136f1e72309b9be0) >>
->> endobj
-1211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 538.582 215.13 549.486]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System_a67b38d56d0f11bda997b393e7b5d7c5f) >>
->> endobj
-1212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 510.157 201.302 521.061]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System_a172718f103bd4533e3971e8e69f9f60c) >>
->> endobj
-1213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.363 420.065 257.19 430.969]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-1214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 410.167 132.51 419.014]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-1215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 251.593 155.753 260.44]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name_a3d873e83cf77a02b55c7d6d6d245ed23) >>
->> endobj
-1217 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1221 0 obj <<
-/D [1219 0 R /XYZ 89 770.89 null]
->> endobj
-689 0 obj <<
-/D [1219 0 R /XYZ 90 674.859 null]
->> endobj
-114 0 obj <<
-/D [1219 0 R /XYZ 90 667.928 null]
->> endobj
-1222 0 obj <<
-/D [1219 0 R /XYZ 90 586.266 null]
->> endobj
-1223 0 obj <<
-/D [1219 0 R /XYZ 90 586.266 null]
->> endobj
-1224 0 obj <<
-/D [1219 0 R /XYZ 90 556.107 null]
->> endobj
-1225 0 obj <<
-/D [1219 0 R /XYZ 90 527.682 null]
->> endobj
-1226 0 obj <<
-/D [1219 0 R /XYZ 90 481.102 null]
->> endobj
-690 0 obj <<
-/D [1219 0 R /XYZ 90 357.388 null]
->> endobj
-118 0 obj <<
-/D [1219 0 R /XYZ 90 350.457 null]
->> endobj
-1227 0 obj <<
-/D [1219 0 R /XYZ 90 268.794 null]
->> endobj
-1228 0 obj <<
-/D [1219 0 R /XYZ 90 268.794 null]
->> endobj
-1229 0 obj <<
-/D [1219 0 R /XYZ 90 220.48 null]
->> endobj
-691 0 obj <<
-/D [1219 0 R /XYZ 90 126.346 null]
->> endobj
-122 0 obj <<
-/D [1219 0 R /XYZ 90 119.415 null]
->> endobj
-1218 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1239 0 obj <<
-/Length 1261      
-/Filter /FlateDecode
->>
-stream
-x��X[s�8~���ma�V$���-�I�I�xc��L��`,�l��\����6��M�������ۇ$�,���>x��3
+rLj*�Bq�bb&��ʝ���7�B�MDŽM�����s�����^�G��VH��!�V��w�
+s�P0�
[y�ŊAu�Fʤ�gK(Q&��#��d!�����i���֧�VO�"
gajY��
-�ߓ3s�Pb"C�؍�Nk�_)e;{�M�Rw{�S��
cu|;��ϧ�u��ě��swz����۫|¦�
 LC� �A�>1�N$�I����ư��K���0�e݉y�J���N���_1�S�h��4L���cx�~�$�v�C�
t�q\�~9
�s��]T�ރY,�|�[��!O�R��o8�s�xnn.���9�B�������g�#���N��ua���jD�'���'�y����8�y���"L��<��g�ؐ��y
�"�{�2ՏJ.sw�fu�j4nlIau��Ƙ*iRdi$���y�W&
-u�
頕�4O�2�h�ޮ�bJ�<)�� �͗�K���/*���,�����E�0�a�Fi��wӫ�$
a�=�>2Y��ӱ����g�R�
����>|.���c�
-p�\בI�M�M_�e�?�{�Lp(S
� 
����V��
�oa &��h�5lz\�y�G?�Pȟc�Ц:���Y�C.��f2
�Rtd�� r,d0�(�tL6H�
/���37��`��й�T��$�/���v��2L�2�Ӆ�
.��I�z̟�E�
��`�WP���~�\+�~�
}vo'��$�y���<Đ�o��'D�3ѻ
rxX�-��hh'_�A���̶J�(�̎�
�+�5^��a��ɣ���:ҥp*��D�BV�=�$�c�oH���	馱&{�X���<�`�
��2h��'�ul#
4p
�@'�9֎�_˒��
D~����i-�C�����yS>�Ǧ$+�ׅ�ei��7�2��g<��ge�~�M�N��+��n\�S���h��$rqCz�����|DXV�.�dиu�3��?������������r��+�I�E�׾rlm4,(��y��&�E���v5��'�XW�)ۈ냼�F`�,|9�AԎ�`�h�v�6
��FW#�dY�K�p���bQ�,�C�r�m߻�����#ý�M�x�	'������Wm����K�"E;&8�i�<=��b���dV.s�,Q ��$�7�-
2�4{ۤ��L�&0W��v��
�)�$
-endstream
-endobj
-1238 0 obj <<
-/Type /Page
-/Contents 1239 0 R
-/Resources 1237 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1230 0 R
-/Annots [ 1216 0 R 1231 0 R 1232 0 R 1233 0 R 1234 0 R 1235 0 R 1236 0 R ]
->> endobj
-1216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 686.901 276.41 696.829]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value_ac1791e52b930ea1fc3863866a26b1a81) >>
->> endobj
-1231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 660.271 277.516 670.198]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value_ad6243026e52cac8f2b4ef458ff4b760f) >>
->> endobj
-1232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.485 645.306 300.167 655.211]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 633.64 214.413 643.568]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value_a7483a53d677492ed42b591525243d243) >>
->> endobj
-1234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 412.122 165.158 420.968]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element_a9ff8417659bb4800d825f91fa8685aaf) >>
->> endobj
-1235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 187.465 219.384 198.369]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception_a18ac064d1fafb42b385e6b942df648f0) >>
->> endobj
-1236 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1240 0 obj <<
-/D [1238 0 R /XYZ 89 770.89 null]
->> endobj
-1241 0 obj <<
-/D [1238 0 R /XYZ 90 704.286 null]
->> endobj
-1242 0 obj <<
-/D [1238 0 R /XYZ 90 704.286 null]
->> endobj
-1243 0 obj <<
-/D [1238 0 R /XYZ 90 675.921 null]
->> endobj
-1244 0 obj <<
-/D [1238 0 R /XYZ 90 649.291 null]
->> endobj
-1245 0 obj <<
-/D [1238 0 R /XYZ 90 605.671 null]
->> endobj
-692 0 obj <<
-/D [1238 0 R /XYZ 90 517.246 null]
->> endobj
-126 0 obj <<
-/D [1238 0 R /XYZ 90 508.684 null]
->> endobj
-1246 0 obj <<
-/D [1238 0 R /XYZ 90 428.426 null]
->> endobj
-1247 0 obj <<
-/D [1238 0 R /XYZ 90 428.426 null]
->> endobj
-1248 0 obj <<
-/D [1238 0 R /XYZ 90 383.071 null]
->> endobj
-693 0 obj <<
-/D [1238 0 R /XYZ 90 294.646 null]
->> endobj
-130 0 obj <<
-/D [1238 0 R /XYZ 90 286.085 null]
->> endobj
-1249 0 obj <<
-/D [1238 0 R /XYZ 90 205.826 null]
->> endobj
-1250 0 obj <<
-/D [1238 0 R /XYZ 90 205.826 null]
->> endobj
-1251 0 obj <<
-/D [1238 0 R /XYZ 90 162.198 null]
->> endobj
-694 0 obj <<
-/D [1238 0 R /XYZ 90 72.046 null]
->> endobj
-1237 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1278 0 obj <<
-/Length 1589      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�F~ׯ�0�v���M�LRg&��'���ɴ(�����썛ɮ�v:
�V�{n߹������~��-�8�B�Է.WV�-��mi]�#8s�1�wQ��nv���.Y��&�-�����Fo�,)�*/�9e�~���R-?%��pH`'Y� %�������ٛ�ٗQ�Ek�x`����5��������7�ikyԅύu1�}��Q&��C��2F�R��
�B��| '��8���E,�L܉����b+C>dO1G�>
{
-k�{��3�{�g]�hP�K@��vRH���3��7sB�9��
�K>�(ؤY�B-�Hr��vy�Uji<'���HZ���Y*�p�����,����-�Ic�Çd{�h���Y\�yVv�Q���sP�"���R�;++��Oog�՜�k�F��tl�����U�~�3
�dD�ZH�{t
-�Cq�%��T�"�QY�i�
�m!�C�����I�k6q�>�@��Qq����H�@9�>uL�7|�S��:q(28.Ĉ�C>O�<�3H<

�DC
-�%��.-ծ� 1�M����c�S��*��
�i�&�G���C_�|�V��
���
�"��)հ%) �ъF�N��=��V����G��^,Se
}0�!B
^�^�,�����ky.�"��z�<Q���r��=+:l &"�Z�r��U�,M TI�E��	M���EU
2��$����g
(Q���Tyg�	P���DC��
ac�3�TE�� ��v
-�FW�Z�5���?	^�

�
u�r����
�@M��I���I��_
-��v�j��0��[�Z2�h���:�/h�T
�� ��
���
�&�����t�#Z�S��i�:��§���:7��N���\�#�e���?
p6��x�.��
-g��™����_�q��/E�$��w�؀�(�#z�O����>ANh�3��I��RBs�:)�"�U}S���j!(�֞�l���?�n]{�*���<���Ks���)���7�\�o�
-��Ҩ[$��a5v���^�
"/�" �
9
u^��I�A�ܘJz#o{#��8Ԩj������;���i|�u����d��l��( �	������|�!�#3NJC��"
�.�N
aC>26��K�T��
7��2�=g�H�����
l��=�h���C4W�Ƃ�eT��X]
zPC���.�U"�
�.����!�qa�������.�%b!��j��1:�E��	9
����k���M�޴}[#�1�f�U��Ls=�����E�� )1��������L�O�	懯6�mPO)����b�w�<?��A

Q�g��B·��
bN�������8ٍ_��>����@�<�����@�U?� ���Kc�����}$�_EU�I�<���h�7�ӥ�`G�~�G�?9���Q�7�'kj�S4�Z��89��}��
���/ˬ~�I��I��uo{WU�����~]&�����+6�9���{eZ�mn\.��$
�D&A�3�E�>5����|���Zk��
�ﶮ�:L�������
-endstream
-endobj
-1277 0 obj <<
-/Type /Page
-/Contents 1278 0 R
-/Resources 1276 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1230 0 R
-/Annots [ 1252 0 R 1253 0 R 1254 0 R 1255 0 R 1256 0 R 1257 0 R 1258 0 R 1259 0 R 1260 0 R 1261 0 R 1262 0 R 1263 0 R 1264 0 R 1265 0 R 1266 0 R 1267 0 R 1268 0 R 1269 0 R 1270 0 R 1271 0 R 1272 0 R 1273 0 R 1274 0 R 1275 0 R ]
->> endobj
-1252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 629.164 180.391 640.068]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
->> endobj
-1253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.889 629.164 200.037 640.068]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) >>
->> endobj
-1254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 601.706 191.16 612.61]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 601.706 263.777 612.61]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a6c93053ad6b6bbcaa9aee01b646bba06) >>
->> endobj
-1256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 574.621 159.927 585.151]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 574.621 189.845 585.151]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a3c40a54218985599831d143c5bb5972f) >>
->> endobj
-1258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 546.789 215.13 557.693]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a67b795731a54c5c3b470d44e10806ac5) >>
->> endobj
-1259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 519.331 201.302 530.235]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ae1acaaf59811107a0571b1f65a41b012) >>
->> endobj
-1260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 450.162 179.254 461.065]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1261 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 450.162 235.981 461.065]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ad2b2c058d1c2dfc8c14144caa50ee91d) >>
->> endobj
-1262 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.797 450.162 317.046 461.065]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1263 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.949 450.162 372.966 461.065]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1264 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 422.703 179.254 433.607]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1265 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 422.703 196.689 433.607]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ab67f80234f60baee3584e955d4fa3f0a) >>
->> endobj
-1266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.504 422.703 277.754 433.607]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 395.245 179.254 406.149]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 395.245 202.228 406.149]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ac3e1a9737e2b459e439904f9817f4289) >>
->> endobj
-1269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.044 395.245 283.293 406.149]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [293.196 395.245 339.213 406.149]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 367.787 179.254 378.691]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.752 367.787 194.467 378.691]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a8fb4edb895a850c5ddf8646b31d92a07) >>
->> endobj
-1273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [198.283 367.787 275.532 378.691]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 279.09 219.642 289.994]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1275 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1279 0 obj <<
-/D [1277 0 R /XYZ 89 770.89 null]
->> endobj
-134 0 obj <<
-/D [1277 0 R /XYZ 90 721.073 null]
->> endobj
-1280 0 obj <<
-/D [1277 0 R /XYZ 90 647.939 null]
->> endobj
-1281 0 obj <<
-/D [1277 0 R /XYZ 90 647.939 null]
->> endobj
-1282 0 obj <<
-/D [1277 0 R /XYZ 90 618.747 null]
->> endobj
-1283 0 obj <<
-/D [1277 0 R /XYZ 90 563.83 null]
->> endobj
-1284 0 obj <<
-/D [1277 0 R /XYZ 90 536.372 null]
->> endobj
-1285 0 obj <<
-/D [1277 0 R /XYZ 90 468.852 null]
->> endobj
-1286 0 obj <<
-/D [1277 0 R /XYZ 90 340.008 null]
->> endobj
-1287 0 obj <<
-/D [1277 0 R /XYZ 90 182.529 null]
->> endobj
-1288 0 obj <<
-/D [1277 0 R /XYZ 90 160.153 null]
->> endobj
-1289 0 obj <<
-/D [1277 0 R /XYZ 90 160.153 null]
->> endobj
-1290 0 obj <<
-/D [1277 0 R /XYZ 90 88.567 null]
->> endobj
-1276 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1300 0 obj <<
-/Length 1991      
-/Filter /FlateDecode
->>
-stream
-x��ZK��F��Wp�T��g�c'��9m\.VBZ	��l~}z�1�]	W\���`����u�p�
p�r�����E����2�Y!�HH�5n�
O>޼�T�h	7ٳ�����������f���%
��~�B�֣ۏ8����FL��]�8e�
->�~a�
-F�
��˖8BúW��X��2�=:�Z#"D�\XM��5�Xߤ-���i��(��<
)6��6�I�@X� �����{�K�d
_����q�_�=�7E��6�M
��Ȓ�lP+��Ӷ��qDd�g�l�-�ARyV���ل���t2����1��N����y����i`$�R�?q��~o	�A�%9q4}�V�\Zɤ�P*�
$>�H)�TS�B�ɔ`���"*��
N��t�ؼ��8��,/z;�Z���utK��v���C�^+)�J�6
ZCC�pߤM��2~���y�����a�]Yk�Ur�G�d��)�h�+��h��1�m(ƿa�;��)�v�X
埮������v���@\�0b!��;���DT+`s�Q�SFC$������$5j�
6R{m��*j$x��m�^�ju)۪�6SJ��Cɸ��+��>.�3�([���$�gE�#O
ת�#ok�tX/@��~]��0%��:s�-�H��%
�>^�d1�����2-�
-�ɐ��y	�
-��2`�
�ʊw[f�ɻ��
���}�Ζ�P���vQ�TGq�$�+"�ѺZ�Ǜ<��i�.�,O�I�o}�	c�c�L�{��f�#)���
��������.�y�� B>�(���x�~�
����x�BD�g0ʨ�^��o�I�'H�a6�䩿{?�o�$5ED�Q�f�Y
T%r_|Ϛs��t�����Y��
�e�@
vH�2�.�
��;���N
2(�]�:�'�����/{��;T1��\a�yy
-��n�C�@T�M3�@��IB��o78`(U����"m�i�
t�o�����@!f��ʪ�h�yf��Y��
��{�x��i:l�}�̓
 �
�<�; ��!?"�O�0N>jҗV%.���z̠�������{
 
-A�`F}y�	�H��F}}j���o�
����W>����S}
-
Ч&��,�%:7�Ũ�xQ�E�/ Ӓ/�⦇$߆�K�׼"�ZB�CZY�o��3�׳��7���"9LX��"O���ܠ�=�
L����[�@�C���}��q�WV�/bWМ�0�4���˔
ds��y?�ϓ����W�Jf�jB���I�9�E
-s>�
���W]5��]�G��>�vT)Ǥ�O�	Ԡ+��`"��+�U������[G�M�N�ҟ'�J/	�$ze	@�/Ů�0!`���d�� o��!ٵ!�v��w��]���bז�g��g����1���dA>�3�w����S|���\ �0�F
�
-Wu��
7�f�5P`d�՞ZT���s������@܏e�
-��ݙg�Vs��V�2k�tY�2����y@P��1�L%ڍm�
-��T���"���Gj�(�#r	p��e4i9������{0p��y�
	���
AOX*<�ۆD�r�ZY\<��א�C�O�j&���3��.���
��� ����ö��e{���

���p
�q:���\
-5�u��s�u%�ы/+[��X
-�c� a�^q��݁R�dV��6^�Ů3z�Kg�I��t]
�J�
-(��/] ���'�Vݔ�'pբuh<�@�BXL+#>�QW�?ċh�rp<��|gƖg�)P�3u�KVs�Óx�)
z|o �ho� �o�{�7L�0�w�c���=pDB[��sd�
��^l
ۋ�=��ի5
~�@�^��M�+Е `GQ%�"�6���ݻ7���&~�3o�t���n᫴��Eݙ;��6ο1��<�6Jw�jR��(�m
����2P�zJS��-�qd�i�O�/��b����n��)w�f���
�7CS���@M+�b�$��kK=��Chw�
-endstream
-endobj
-1299 0 obj <<
-/Type /Page
-/Contents 1300 0 R
-/Resources 1298 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1230 0 R
-/Annots [ 1295 0 R 1297 0 R ]
->> endobj
-1295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.495 190.054 102.399]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System_ab8be81becce1bc803566f5b19e366799) >>
->> endobj
-1297 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1301 0 obj <<
-/D [1299 0 R /XYZ 89 770.89 null]
->> endobj
-1292 0 obj <<
-/D [1299 0 R /XYZ 90 688.794 null]
->> endobj
-1302 0 obj <<
-/D [1299 0 R /XYZ 90 684.311 null]
->> endobj
-1303 0 obj <<
-/D [1299 0 R /XYZ 90 613.45 null]
->> endobj
-1293 0 obj <<
-/D [1299 0 R /XYZ 90 578.78 null]
->> endobj
-1304 0 obj <<
-/D [1299 0 R /XYZ 90 574.297 null]
->> endobj
-1305 0 obj <<
-/D [1299 0 R /XYZ 90 501.434 null]
->> endobj
-1294 0 obj <<
-/D [1299 0 R /XYZ 90 466.764 null]
->> endobj
-1306 0 obj <<
-/D [1299 0 R /XYZ 90 462.281 null]
->> endobj
-1307 0 obj <<
-/D [1299 0 R /XYZ 90 389.418 null]
->> endobj
-1291 0 obj <<
-/D [1299 0 R /XYZ 90 354.748 null]
->> endobj
-1308 0 obj <<
-/D [1299 0 R /XYZ 90 350.265 null]
->> endobj
-1309 0 obj <<
-/D [1299 0 R /XYZ 90 289.357 null]
->> endobj
-695 0 obj <<
-/D [1299 0 R /XYZ 90 199.995 null]
->> endobj
-138 0 obj <<
-/D [1299 0 R /XYZ 90 192.914 null]
->> endobj
-1310 0 obj <<
-/D [1299 0 R /XYZ 90 110.874 null]
->> endobj
-1311 0 obj <<
-/D [1299 0 R /XYZ 90 110.874 null]
->> endobj
-1298 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F81 426 0 R /F99 1084 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1328 0 obj <<
-/Length 1365      
-/Filter /FlateDecode
->>
-stream
-x��X�r�6}�W��L�=onb{�:�k�
;��(Hfʋ�q��] %�fٕ<}�� ��]�9 �13�q��m�\��Q�Q�N��"׃���`�(��cl�#�E�y�.�؄G�4�/,���GU�GC�w�ŜY}�b�<�3պcS�-�,��OB
�7
b}
^�·��=��A��g���ؘ��k#;
�g�)3
j�35�{�p�
^��[��`9v`�� B�g���Ҹ
f<�]�2��Ģ���"��xq_�$�5�F>k���q�OT�I2���|}V��#v1�H�?�
\� ����"ϡF��{[��cU��R��rkiR5�䦪�D�&y�x
��[�o��z�,�����
-H�
��		�=�I��SR�^]��$ԝPǵ���"���(��IAUtz�0�Q*ko�1��1�k!F���CB'��&��|��oS��a[�$D���O���T.�[�d.��� �
:�Ѽp�D`QV,k��ϙ��R�#��<@�F����Y����j�0�d�S�4*�=Ɇ.KƹW ֓}�RM��F+LI��m��W��3A
�&�ò:����`]�/� A��D��d׺M��	xr�E
ݜP�-%4��EYs��C,�n*
ex���q�u�,�jȅ�L-|��g���$\sϔ�
��diZ��~n��c��]���i���O��G�"�b�
0�*v�*�1f;P(t��m�q=��]
,A�}"e#7�[�����@<,�P��_a ��`
*�ݴO1d�	�b�B��k_ɺ�̅�+ҾK�Q@��%z�^��r�f3Tu�[�)���	xc\n'�JVw��]�m�7K�
@��˯����I���U 
c!^u��
��ݠ�o#��ڠl�BQ
-7W_ηZ9D�ֹ`&J[E�_&�J��$���׆��ڭ�����+���rO���W_��요�C6v�p��}���ۇ��?Jk�
�+�Ztv4�"�i%
-0=�V��<L_�Uǰ���cC�x2��s�V�(0<����reCI|l�I�)��i��g§�t��/�Q�����z�C�}��}f٘5n]�y,��
M�q�Y6/�
r����X���ĉ���C�G�?眕�:�O��Ixۇ�4`�|Cӂ�Cs�2z�o;0Ú�!}ÁyW��9@�o
���\�C��$
����H��罍��ߏyP��>�~L߇y(�&�-��#�w����F5�W�I~���Y
͚�W�~i*�5n>�U2���95	�
嵾�N��
�L2AX�Lᬍ�{��V����[��;J���!��&�����q=+Y>Cq�mf}9x{D�m�Y���I��� '�R�C�b�<���A���b"4Y�Xm�?�����*��O�dyk�/�9$�
-endstream
-endobj
-1327 0 obj <<
-/Type /Page
-/Contents 1328 0 R
-/Resources 1326 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1230 0 R
-/Annots [ 1296 0 R 1312 0 R 1313 0 R 1314 0 R 1315 0 R 1316 0 R 1317 0 R 1318 0 R 1319 0 R 1320 0 R 1321 0 R 1322 0 R 1323 0 R 1325 0 R ]
->> endobj
-1296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 707.957 215.13 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System_a62ca7c2995414638d139847539631598) >>
->> endobj
-1312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 679.542 201.302 690.446]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System_a379e7fec2e73df8beb7904b85d7645df) >>
->> endobj
-1313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.27 589.469 256.414 600.373]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-1314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 577.514 130.826 588.418]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1315 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 421.035 138.588 429.612]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type_a3b9f75c49b0c6f00923b8f7d827ca9ad) >>
->> endobj
-1316 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 392.72 136.934 401.467]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type_aa8aee01f50041535fba84ef399e5ee81) >>
->> endobj
-1317 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 364.205 145.233 373.052]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type_a2c6506f69be68e287d31aa3db68d664b) >>
->> endobj
-1318 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 131.163 203.633 142.067]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
->> endobj
-1319 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.131 131.163 223.279 142.067]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a58e50b5ebd0b0f5b4d5e44690a939e34) >>
->> endobj
-1320 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 102.748 191.16 113.652]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1321 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 102.748 263.777 113.652]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_ab557b1ec4f75e98b5b4155b932d7a6af) >>
->> endobj
-1322 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 74.707 159.927 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1323 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 74.707 189.845 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a147ad6db2e9d13bee7450666cad83d7d) >>
->> endobj
-1325 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1329 0 obj <<
-/D [1327 0 R /XYZ 89 770.89 null]
->> endobj
-1330 0 obj <<
-/D [1327 0 R /XYZ 90 721.073 null]
->> endobj
-1331 0 obj <<
-/D [1327 0 R /XYZ 90 697.062 null]
->> endobj
-1332 0 obj <<
-/D [1327 0 R /XYZ 90 650.504 null]
->> endobj
-696 0 obj <<
-/D [1327 0 R /XYZ 90 526.802 null]
->> endobj
-142 0 obj <<
-/D [1327 0 R /XYZ 90 519.877 null]
->> endobj
-1333 0 obj <<
-/D [1327 0 R /XYZ 90 438.231 null]
->> endobj
-1334 0 obj <<
-/D [1327 0 R /XYZ 90 438.231 null]
->> endobj
-1335 0 obj <<
-/D [1327 0 R /XYZ 90 408.082 null]
->> endobj
-1336 0 obj <<
-/D [1327 0 R /XYZ 90 379.667 null]
->> endobj
-1337 0 obj <<
-/D [1327 0 R /XYZ 90 333.109 null]
->> endobj
-697 0 obj <<
-/D [1327 0 R /XYZ 90 238.987 null]
->> endobj
-146 0 obj <<
-/D [1327 0 R /XYZ 90 232.062 null]
->> endobj
-1338 0 obj <<
-/D [1327 0 R /XYZ 90 150.416 null]
->> endobj
-1339 0 obj <<
-/D [1327 0 R /XYZ 90 150.416 null]
->> endobj
-1340 0 obj <<
-/D [1327 0 R /XYZ 90 120.267 null]
->> endobj
-1326 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1358 0 obj <<
-/Length 1940      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�F~ׯ�h�Z�]ҧ4�3I�4��'����i%�ʥ��g��HB�����d�b��/�Y����ޛ�/׃�K���
��/�!�5�n|N����<(D� 6�__��������~6��
�= �{��/�T�x>����~~�a�B�}3��
�
�3�j�� [Q�W#�����E#4DXy�DH)��-��%p]��H�J��1��%)ʐ
H�����~��qV�G�e�%��n�&���M�5�(�G�݄��|�
���b�-,���7��k���bd�X�}~4�1
�ֈP
-��J��ɻ	��ET$C*��Z���tUd�bjWkeS��f��#'��d5_���_���8���v�(���(伔�s��b�fY�>��<*����
g�h�4᲼�� SK#��|����	V��=@�@�*�z���(/y��6��!T<������bd'MKiI�7b����J�3i��?��ҟU~���&_��r�k��
Vr|J�xT[+�
�K���{U��M������v%رGW��Y��w�|'K�=슲����,�s�-$��B�byc����ֱ2j��E
-��;u�[�D ��A�HFj�A�x*�A����Dn;��U?��c:N Y����{�ɕ�����"Lh��%
-h�zϷ��H2^-�
2ֆ��ϓfz	�c1��L[cE2D��+��X��APd0g���@`1���`���q%3�W���q�,��oZ����p�xXR|ن����
[%�A�-(j��d�6���˪m��	5٭յ[Ƴ(ϟ
�vE���vK��<��Y��� �.���
-�4�7��gw�� ��
F���QT�}PHYe7#�ڈ�dlt��ռ�dNv:<��e��1��m�y/��u���{K��{�p`�y�9RZ�R
cz̒]� �eֳ`9�5�QӜ����e��`r�<Ɠl�P"�{a�0�1l��%�tÑ�
�#m�M)w�^����b�$�|4�*�

-��C�%o�$?
�&�
-.���hi�!Q���AM��+
�bz�%�
�R���L��_ mb}HZG�M��R�n!VVu�9�B�#�kenʌ����K3h��������xV�:��[�P� I{�����r���/������j�J��|�p��$��ܜ?����SӄJ
B�	���.�l��d	\I���� i~�~+["Y�=4�TG`
�c!/�L�
g?�E2�/2(�B�,ۚv��BqP���$��a�֒1�ԟ-�إ8D�9J^?f%�� 'i���t�N�&�����{��f��ĺ2H!
ԍ1�5 �F���4K��b*O��E��e4�Q�_

�	��y"�8�o�
C�Y�6{��
D�b��(�O��i${1M r2#��8L�
���^L� �žab�
��bp6�H���G
-�4� ��.�1X�d肅C��1q��B`խ� ��zR��3K��r��D��R�����
p!�"
�����='C�N�\] G��ܪ֨����_�Lv@
�<ȃ���Q(� eߘ�@�  {�u�4
�!0�`,��<
��`
q.��G��>��@OK�g�
G�-�gKrS�
���Vup�O��B��[kw��RX�����
E��������|9� t���G�"A\�A"��=�7HD��?�pы�@7v�8�xE�@���e�X�@��#��y'��
zX���
��'��p�+@88��=;Nz�@$���=R6��il4M�Tֿ�Vb"�6�qo
V{��o��{��5���	V�0 5�2�W´@��vBk�O�ޗ7�!�6�G{*�>ZLW��.|��#yBL��]��G
g?
��?D�U���ΰr\�����̇��\�ջ�R��jM
�5U�Z��z,������4�S4N���,%���P

��,�>�)��97��/�1� 
-endstream
-endobj
-1357 0 obj <<
-/Type /Page
-/Contents 1358 0 R
-/Resources 1356 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1230 0 R
-/Annots [ 1324 0 R 1342 0 R 1343 0 R 1344 0 R 1345 0 R 1346 0 R 1347 0 R 1348 0 R 1349 0 R 1350 0 R 1351 0 R 1352 0 R 1353 0 R 1354 0 R 1355 0 R ]
->> endobj
-1324 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 695.006 215.13 705.91]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_afb38d7eabfa00c8d068e8cdd4820d46c) >>
->> endobj
-1342 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 667.11 201.302 678.014]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a7440d17db8648a633c9b77c512bf8f9b) >>
->> endobj
-1343 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 597.307 202.497 608.211]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-1344 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 597.307 240.962 608.211]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a61e7f56c96825c1dbd9b1753ead625b7) >>
->> endobj
-1345 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.778 597.307 322.028 608.211]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1346 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 569.411 202.497 580.315]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-1347 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 569.411 244.818 580.315]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a45537abba3ff2661633cb4033fe15e0b) >>
->> endobj
-1348 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [248.633 569.411 325.883 580.315]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1349 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [335.786 569.411 381.803 580.315]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1350 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 541.516 202.497 552.42]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-1351 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [202.995 541.516 246.502 552.42]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a8b88040458f91e980a158487b14a359e) >>
->> endobj
-1352 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [250.317 541.516 327.567 552.42]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1353 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.47 541.516 383.487 552.42]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.82 452.404 242.885 463.308]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-1355 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1359 0 obj <<
-/D [1357 0 R /XYZ 89 770.89 null]
->> endobj
-1360 0 obj <<
-/D [1357 0 R /XYZ 90 712.265 null]
->> endobj
-1361 0 obj <<
-/D [1357 0 R /XYZ 90 684.37 null]
->> endobj
-1362 0 obj <<
-/D [1357 0 R /XYZ 90 616.216 null]
->> endobj
-1363 0 obj <<
-/D [1357 0 R /XYZ 90 513.321 null]
->> endobj
-1364 0 obj <<
-/D [1357 0 R /XYZ 90 373.385 null]
->> endobj
-1365 0 obj <<
-/D [1357 0 R /XYZ 90 351.008 null]
->> endobj
-1366 0 obj <<
-/D [1357 0 R /XYZ 90 351.008 null]
->> endobj
-1367 0 obj <<
-/D [1357 0 R /XYZ 90 280.332 null]
->> endobj
-1368 0 obj <<
-/D [1357 0 R /XYZ 90 245.662 null]
->> endobj
-1369 0 obj <<
-/D [1357 0 R /XYZ 90 241.179 null]
->> endobj
-1370 0 obj <<
-/D [1357 0 R /XYZ 90 168.316 null]
->> endobj
-1371 0 obj <<
-/D [1357 0 R /XYZ 90 135.813 null]
->> endobj
-1372 0 obj <<
-/D [1357 0 R /XYZ 90 131.33 null]
->> endobj
-1356 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F90 507 0 R /F60 304 0 R /F81 426 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1383 0 obj <<
-/Length 1753      
-/Filter /FlateDecode
->>
-stream
-x��Y[s�F~ׯ�0S��²�77v2N��k�ONƃ�J&�J������@H�l���^��|��5vv�O~����؉P����;v�!
���s��(��c��2��V���A���n�ޗq��	��e:�{/sY�uQ�]?V�̼)��}����,��\�
	]�'қFT0�gޗ����_Va�+8��d��/ؙ��F,
-��zS����s�\O~�`�P�D���zX7C�q3�ƾ#C!�������"��A�F�R00
�Sq�z
�p�AG�k�D$�� ��\�MP���XO�-R}���Q��RJgޑb�C;�!�#
r#�I��:��L����s�(�d�\���>$���$U�a��%c>"�8�e��4�#DY�ɛ���(w��]ҹ�:�
�"([�'3��'9D�.�!����,
t8X�E �%��x�H"�Q�E2�
�� -
-D�o�э��#��&�o
9�
Ց�2���d?�MgwkD
��1�(���
R�Q���
-�3&�� �{���w�����8�9E!�Ro�7
�G/�fv�"
-P�F1"�5��F����C��oi�)���s
ÉP�";Z0���I�M�e��/���ՒS�!>w@�#̗��;Bd#�~H�

N�c���2�diֱy,Th�jU�P�zY��@ƙ��K�?�w���en妵]�R�N&R
ן����J������� a�F�
G?wྂL��\�+�c܎ȗ
\�(
ǘ�cz�L�-7�9q{^>c�>�'m�)�8r�>?p{+Y�$���
/�9̌�@Vo�"-��:�I��ӯ�
|�<�U�9a|���X���e�5��F�ri��
�JM�|Ӄ$�@rY��	Cc�gJy���1��@�5�(v�)E���X��R���:�`p�;�
G&�
-@"�B�
�
C<��ٱ���P-��������F�OaM��?�9P���
(KA�Vlr;P�GT�FB�aA_w{���
�a	kO�����C<6k���}
����Ρ��o�E�u����F��O����{0o�&��O2���l�[��~�e~ۆ
-�ٞ64�(6%W{�����`
7�o�I0;C0)�u�P(y
--��6�L���Ҳ�|��u*�x��+0X��Y3#,��lU?
�
-r�� ��B���A⭝��,��DO��@y]�
-!��
��~TI������5�zե�Mȴ�v.dq݂=�]Y����Y�A{�̣��Ž|B
HD���p���$���4��08|�
�Eo�+�ߖ����S0͟�G
2$ �
uN�p���L�q�ԥt&��L;�vw��AS� 0#�NU|u���2��Z	�rxa����Ö�
6j���<Z�A��K�ժ5^�
-�pS$�^�F q3����=�w��e�!�6۲��V������� ��)�fs4Ɏ�c8F�pH8�‰�Ir
�
���
�
-� �F
A ���Ȯ�u������s�e�l
�v��=j_L
Ok9�j,�k�t��?�3~��������s�o3TexW�6����������������`����n$�}'�z&9;���ͽB�"7�
-�@<
-�����h����|���:^؍�E��HH�?*Y��N�ֵOq�nh��X���U;oҼ
�-��2~��4�_'��ic=	�Ii�}
�z����~� v�@I�

d�o�ڙ��l�a�`'jp����m���
�!���]�?6�'s�
-�����_F}
-i
-endstream
-endobj
-1382 0 obj <<
-/Type /Page
-/Contents 1383 0 R
-/Resources 1381 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1396 0 R
-/Annots [ 1373 0 R 1374 0 R 1375 0 R 1376 0 R 1377 0 R 1378 0 R 1379 0 R 1380 0 R ]
->> endobj
-1373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 427.743 213.297 438.647]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System_afb407c2937347e7381fed31b31a46e98) >>
->> endobj
-1374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 400.451 215.13 411.355]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System_a8f448359523682c0623804af48cc2dff) >>
->> endobj
-1375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 373.159 201.302 384.063]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System_a4c7c1b1005912277576320fd650d1e89) >>
->> endobj
-1376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.907 284.62 278.294 295.524]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
->> endobj
-1377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.526 273.641 190.592 283.569]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
->> endobj
-1378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 120.158 138.588 128.736]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type_a02ca1ef23d4c2b965198ea42d9d683a4) >>
->> endobj
-1379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.966 176.236 101.713]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type_a1a63d52277531ad7883e6679a90fdc67) >>
->> endobj
-1380 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1384 0 obj <<
-/D [1382 0 R /XYZ 89 770.89 null]
->> endobj
-1385 0 obj <<
-/D [1382 0 R /XYZ 90 718.682 null]
->> endobj
-1341 0 obj <<
-/D [1382 0 R /XYZ 90 684.012 null]
->> endobj
-1386 0 obj <<
-/D [1382 0 R /XYZ 90 679.529 null]
->> endobj
-1387 0 obj <<
-/D [1382 0 R /XYZ 90 618.621 null]
->> endobj
-698 0 obj <<
-/D [1382 0 R /XYZ 90 534.527 null]
->> endobj
-150 0 obj <<
-/D [1382 0 R /XYZ 90 526.992 null]
->> endobj
-1388 0 obj <<
-/D [1382 0 R /XYZ 90 446.435 null]
->> endobj
-1389 0 obj <<
-/D [1382 0 R /XYZ 90 446.435 null]
->> endobj
-1390 0 obj <<
-/D [1382 0 R /XYZ 90 417.409 null]
->> endobj
-1391 0 obj <<
-/D [1382 0 R /XYZ 90 390.117 null]
->> endobj
-1392 0 obj <<
-/D [1382 0 R /XYZ 90 345.537 null]
->> endobj
-699 0 obj <<
-/D [1382 0 R /XYZ 90 224.885 null]
->> endobj
-154 0 obj <<
-/D [1382 0 R /XYZ 90 217.35 null]
->> endobj
-1393 0 obj <<
-/D [1382 0 R /XYZ 90 136.793 null]
->> endobj
-1394 0 obj <<
-/D [1382 0 R /XYZ 90 136.793 null]
->> endobj
-1395 0 obj <<
-/D [1382 0 R /XYZ 90 107.767 null]
->> endobj
-1381 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F90 507 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1402 0 obj <<
-/Length 1469      
-/Filter /FlateDecode
->>
-stream
-xڽXKs�6��W�Vr���$���$�8m
������,��(�����w� EH��$lN�@`��~��^����&	R��4��A����H��k\��G���KD�.��go�L_��^�w�����W8 ��@�
���'
,`�U�Kepo�N<��j��;S0�B/��&ɞa� B�2D�1���U��ZDcJ%���U�i�ui
lUL.⾫8S�O��靂���*_��*U�5���l
6
-�p�U���򽫋�|�Re��f붻}��v���ʮ�#�ì��)���Z�ڛ��U눊�>/�v�#ƴPO<?#�$�'�H���#��?u=�����e��lI
j?��"��/Z[f�y	2ف|�BP
�q��qDd�Kw)�d�*;�
1�Q1�	~
-5
	��EH��>B�,&�ߛu>ܩEuD?ŐG���)�)��"��2��
�X�貌���k@;�(���D�&aA|��V: K�C�
j"�� ��H��u�6�>�X�Y]��{u%��T9W�
-wL����o'ו�<��m-�<�g^F�u�V9d�H�=�u�76t���ހ�E>�N�V�U��Ŷ�[���<�UW���cEksT-]��we|�{6{�sj�
�
X���:F�a�<b����cn��r
-���	���M��k�$��3�9f)��Ŕ��cv���'�����؟�f��`�s�@�r*�kL�A��@ˢz�;����f��?ho�	�
-<|z �9�F
�����upj��;(ϡ�Jc���/�?����')KXj\���잣3{�a�3�U������
-��ϊ�7�ԕ�;x�)PEc��r�+eur��nS�[UUj1�eZ�ͬ�K5+T�<qxl8F��B�
�l0��ϥh�f�0��?4y�7>��q�}e�ͦ����>�5���(�_��%}�#�AG���<����X8���e�Ӷ�E�E?�ܠ���뮉����@�)��)ȌO
E�Ln�8�QX$��k���6�z���{��+��H���A
�a
�qJ|c�^:4�Dc.e��&iړ!$J�Dqw9�5ݘ��2�=�Hۃ������8�3���>����x
-9t�1?�]�)�Wvڅ1 yA}�4��&C�G�D�
����g<�DL�F��"׌X	'�)�q<��TgD��5�
�Yb��!�R�JKuuzJ]�:L"#�Q�M
Rс�ɣ?)I
��I
�?3�l ��hJJ���x
�B�~>�Hh?|0��.|ז�?��4��7���Q�j��{����;���
BH(;����EyI�߈��Ab�$Լ�����ۘ\�X�|
�v�� o�hrq��I`�ԑ��cɝ�?�޽��.^�?���_Y��fKw�lTe ���ևZU�E��~��۬��/o;�Vu���F�ƀ��J�֕;O�
��]H!�]A�5���dr�]� A4�����.Cc�1i�v�X�+�~
��ʌ.����S�
-endstream
-endobj
-1401 0 obj <<
-/Type /Page
-/Contents 1402 0 R
-/Resources 1400 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1396 0 R
-/Annots [ 1397 0 R 1398 0 R 1399 0 R ]
->> endobj
-1397 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 526.993 234.059 537.897]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception_aefc6c6941cd663b4715cc71e446d4fa0) >>
->> endobj
-1398 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.928 298.891 238.512 309.795]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO_aedad05516ed695dabfa4fed118d41145) >>
->> endobj
-1399 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1403 0 obj <<
-/D [1401 0 R /XYZ 89 770.89 null]
->> endobj
-1404 0 obj <<
-/D [1401 0 R /XYZ 90 721.073 null]
->> endobj
-700 0 obj <<
-/D [1401 0 R /XYZ 90 633.415 null]
->> endobj
-158 0 obj <<
-/D [1401 0 R /XYZ 90 626.815 null]
->> endobj
-1405 0 obj <<
-/D [1401 0 R /XYZ 90 545.987 null]
->> endobj
-1406 0 obj <<
-/D [1401 0 R /XYZ 90 545.987 null]
->> endobj
-1407 0 obj <<
-/D [1401 0 R /XYZ 90 500.524 null]
->> endobj
-701 0 obj <<
-/D [1401 0 R /XYZ 90 405.313 null]
->> endobj
-162 0 obj <<
-/D [1401 0 R /XYZ 90 398.713 null]
->> endobj
-1408 0 obj <<
-/D [1401 0 R /XYZ 90 317.8 null]
->> endobj
-1409 0 obj <<
-/D [1401 0 R /XYZ 90 258.741 null]
->> endobj
-1410 0 obj <<
-/D [1401 0 R /XYZ 90 201.874 null]
->> endobj
-1411 0 obj <<
-/D [1401 0 R /XYZ 90 179.497 null]
->> endobj
-1412 0 obj <<
-/D [1401 0 R /XYZ 90 179.497 null]
->> endobj
-1400 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1419 0 obj <<
-/Length 1393      
-/Filter /FlateDecode
->>
-stream
-x��XK��6��W�+,��$ȮM&=I��i2]%9>ؖ=n18g2���� ~�3C{�Bqu��t����������k��%�
-�v�%ؓQ�������'Q�c�oS�I��"{�S
�N��L��!��G�T����Z$�
=��>W�j]�AH9�_fiY���Tv���*L����������넀j�#N�d��7�O_����
F,��{�h�E��3�>N~��ڪ��(7C�m�I��8AG�$
%�3�&����t�*�#�K�ׁ�;
~uͷ�p���g-�m
���@D���@
�sRa5A	���۴�mI�9E1�	u�.+�
|�UDP�|�
��p"J���q{�
8�b��͸��|��wE�h_�fu��U��p�{�n�y�8�<æ�0"
U�Kt��#D8VX 
�I�p��ʫ���"|=O����)���i����x`������@}��	��%:���;o:���?�%�(�	!9bq��[
0�c�
��S����
�
I�xa�_��Ԥ�4�'�E({��A�5��V[[Ԣf)��
/
=�0kjY�	͍�e�N��߫� �T
O�	$���б%:�2�8�FB(�#��%?P(�L�G$�ȼ
��R�8(��?
-�i��>ag���:�"W���F�FHd����'K|\�ˁBx"]�>�j���E�0�1��0b�0�Q�
-�6�vu�

,�S�0/�0��!F�|�韏
�Z�@��{�{��i��R��i�l���f �e�eE@���r?�zѳ��"8�C��J~���W}
-9tEo~E��ߌആ_����.=��\؈�
�(>�h
6D�
$@bD�A�g�X
�M�;:�je1�
���y\{w�?��3e
-c�x�Pa�?�7M�E$8""�(�#��z��6�C{�7��u��A��� �ƙ�m�
Ch� m��.�R��4��@n�E�lRe��41u3[��4}U���Sȡ<۩���^
'��՗	7����Ξ�j3Sڍ_��S��iғ#���¥Wu�>�	����]S
R�q�;M`	䄂p�Ǡ��,�(����$x�/��J��Ua.���B
�}hy��)^�*]g6���W�����9���f�zA��?���

0������	�(�r�7�$��b�1�oX����Cɗ�c�Ϡ�I8A)��\��,�E�$v�{�㾖Mk������d�
-�N��]z
���Fs�`�t��[2����y�o�H�3��|�KW��7y��Ҧas7�{���~����|�fAK�ߌ}J�m�CK`�!9U�Fg�^3���Hӎ��T	�v��U�����l�*!-�
�� 
���DX��ߖg6�n�c`rc�5�k{L��q
��+�8&RR��;��뉫7�* &���oV�])
-endstream
-endobj
-1418 0 obj <<
-/Type /Page
-/Contents 1419 0 R
-/Resources 1417 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1396 0 R
-/Annots [ 1413 0 R 1416 0 R ]
->> endobj
-1413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 311.251 215.509 322.155]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception_a84966c712051f47e1dcee5490d5ca670) >>
->> endobj
-1416 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1420 0 obj <<
-/D [1418 0 R /XYZ 89 770.89 null]
->> endobj
-1421 0 obj <<
-/D [1418 0 R /XYZ 90 720.814 null]
->> endobj
-702 0 obj <<
-/D [1418 0 R /XYZ 90 464.139 null]
->> endobj
-166 0 obj <<
-/D [1418 0 R /XYZ 90 446.783 null]
->> endobj
-1422 0 obj <<
-/D [1418 0 R /XYZ 90 338.85 null]
->> endobj
-1423 0 obj <<
-/D [1418 0 R /XYZ 90 338.85 null]
->> endobj
-1424 0 obj <<
-/D [1418 0 R /XYZ 90 256.817 null]
->> endobj
-703 0 obj <<
-/D [1418 0 R /XYZ 90 140.524 null]
->> endobj
-170 0 obj <<
-/D [1418 0 R /XYZ 90 123.168 null]
->> endobj
-1417 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1445 0 obj <<
-/Length 1113      
-/Filter /FlateDecode
->>
-stream
-x��X�r�6��+�+��Hf����uR7VVNFQ�)
-H�U��|���cy�݈ 	\�s��ؼ1ޏ�ᵇ� �rs43lzn����|�\nݙ�	8L��~�������Q3�F�w��'l�f>C�o����
�Sx}gb���W=(5]��31�?
����B!͚��\��Y(�eؚ�"R"m:�\5��P�/�d9�S%�I<QB-m�,tgR����
%�"γw5�n
�O ��"�C������S��n`�3����v���پަ��5�+�Q���q�Otk
�����&;�x^C�C5�=+�C����G�N�j��U���؋v�u‘
k(A~@�_)e[s�NU�n��a>
��ç�iъ*�ؾ��n��N<�Vkb	6��>5}��]��R�]
-��i�r�eY)���T�[�ӛ��L
^�+;<@��@)�q�
�\�A
'� �M�"
���c�!���60ni: GKڷ ��f�NJ%��#�4��ķf9�g�>��U:���
�����
�T�AΠA�t�FJ�q*����!�3�2�i�l����/�B�.��i�yX_�"�;ϊ䞇-S�LI�ŸU�A�ao
�UEt��YuP���)����H��uL(�|r2	b�\�)t��
��%TL��,w���
&9�pi�E��Ų�yS���~Ӗ6��Sd��8���g����:#��	�ڵKg�qzE��xZ��˓պb�d�LEY�iӍ�R�L$M�ᩣ
��)w&Ap�{E�t��O�����7F]�[�f�r
y�P�
��)����/��I�'Rd�9���?R嗤x�+�9Po:�T%O��x��Jy���%�'��!��g��n�d� J{��
#.���C3�(`�’�$��4�d&�C�H��P���t�p��h�6�ʮ��
�X�����ٳ��MR��,�A>��l�zp�<�{�6|����?�QX��(8ݍBw �+�ݝ
-��
�UԐ���[��5�dyx�owB��ڟ�d{/��Q;�V��Ot���R�b3f��}Y�U@�M\��O��N��v
ew�i���#�M�P�
0��6/�Ż�pRE��#��nP�&{
�+��/��\ɮv7�|�Tz�
���!
-endstream
-endobj
-1444 0 obj <<
-/Type /Page
-/Contents 1445 0 R
-/Resources 1443 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1396 0 R
-/Group 1415 0 R
-/Annots [ 1425 0 R 1426 0 R 1427 0 R 1428 0 R 1429 0 R 1430 0 R 1431 0 R 1432 0 R 1433 0 R 1434 0 R 1435 0 R 1436 0 R 1437 0 R 1438 0 R 1439 0 R 1440 0 R 1441 0 R 1442 0 R ]
->> endobj
-1414 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1457 0 R
-/BBox [0 0 408 386]
-/Group 1415 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1458 0 R>>
->>
-/Length 1091
-/Filter /FlateDecode
->>
-stream
-x��XKk$G
����?0ڒTOX�`��
�
�����7�L �C�~>UW�{
If��1f��.��K��ҟ�&��;��v��}�w��?&v���{s�����O���ߓw���mz��y��nb�~pM�;���w�Y�(�N��f�C��N�0����8;a��[�M���MJn�S�Zk��=ZoBq\���7;����?L��z�yV��̻��Yծa.G�cg
i,�yg�/�N�=���v�|<U~��+񟆲��p&1
��h���a�nb���혂���[^��ٟ�w��{�<�lW�&{{��
:X;�J
s뇂]s��c���n�����B�d!�tK�o���y��
W�����z��]�����#��"����T��:�#���j�Z-�<RN-w�R�8 h80�P��
��~Nr%�щG���>Y �q��@!�	��>�I�QD�
-
�n�@�������M�
S�$�� b.�ر
(Ț��6]$N�n.
�@

-f
VGTL
`��*���o�
-���2 6<�s�G����Zqw{5�B�H4īl���1���%�%a�B�@|I�
_���&��ؠ�Ȯ�X�J� ��I�H%���+$b�2۾5%�p�
`�
|���R�Ej ;�1���B�i�xDyY �r^1�$�l�� ^}KH��}c���ը)�bMPW,��5�( ��F|��b� ����k+c�� 'b5/<�l�
�5q5�'���ڪ'
-^�{.v
-R���B�� �T(

-��jc�_6�%
���ny���h�T��p��
���0�c���Ԉ�L�hK���zDͩO�%�9�V�
Q�EI�U�+m*a�ũ�ET �UkB�`m��T6T]��|םp�u���x.���C�.���
���r�M�QX�B�
�T)׼i�8֖�G;�!����uێYGd(��,m�Ҏ!Z��ӴcK��	�N�i�8*�����i5�ގ��]>�$�6E:t2�QB��dc����B��^
�v��s�Ct]�;�>ןv�a��],i3L���Q�&0
-U��0���,�m��
~(��}����<� ap
-���$���j��.cN��$��L?N� c���
-endstream
-endobj
-1457 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1458 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /GHWCWK+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1459 0 R]
-/ToUnicode 1460 0 R
->>
-endobj
-1459 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /GHWCWK+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1461 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 652 500 278 722 495 667 556 611 722 833 667]]
->>
-endobj
-1460 0 obj
-<<
-/Length 1462 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0��<���!�����¡?j� {�"cr��k<�T*H�c�؛�����H���.�3X�i�n^���:�D�Bja�_5v.I����
��5SR�"���U����C"�H߼&?ث�}�/�u�9�C#�EdI�M&,�ҹ�n$�F��A�ul��#�G�hIM�f�)�RRg�iDm��$d�?���ި���rʳ�ʚHy��
�����J:Bc�@
-�UN��GP*A=� )�4�{�H9�L���
��$��A"_��%�;���`��>c�|L�W�O�|�	>��D��}�Wq/�W��J֐��YK�+��J����&�>9��}�8�qZ�9,�'�Mns��E��_
-endstream
-endobj
-1461 0 obj
-<<
-/Type /FontDescriptor
-/FontName /GHWCWK+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1463 0 R
->>
-endobj
-1462 0 obj
-357
-endobj
-1463 0 obj
-<<
-/Length 1464 0 R
-/Filter /FlateDecode
-/Length1 2880
->>
-stream
-x�}V{lS�?����Ib�k�w
ǎ� 1�~�$�8��`�Ć8��<!%
-���JJ)t�&U�&����J���QVФ	m��CbjW��C�i���~�:*M�uι߹�����}�{%�$�:ˆ}`�o�:�~HHR
vgw�������<?MH��C}���~r��=�06To0
���.
�ؽ�P{	I�=7>5�G��j@�}d�o�4}������ǙQB� [ 
-�@D�Ik1iMQ�����U��X��5��
���ERI!F�(�E�A�EZ]�Zo
n���T�����~}(T�ƾl�y�ȁ�A�6����SS�=�8
:Kb7�:�����P�

Z�E|r9k<�t
uZ���ý��*���r���$��V���u'�d�V���.\c]WYU�
-��C-5n��͍��b�>�b
D��֜��d�J��i��Vۥ�7��h�5�Ce�P���M+��RAk���Tt�7�
-l)}����0��jQ�F8� 2&x���'��
��1P���+�lp6�E�rqC|b����PYak����8<��҅���n�B�>vq"*��b��o�:
q

c7��� ֥�X���Gq��
��>0;�
-5�7���������󁉋��&�.J|�_���`�+���;}�J?C���<�.�~=U�:z��FqO^F�637%�W�ǘf����V�1;�R�alj~	]:�q��Xї��ᰥ�rcg��y�}!�s� ��^��v˾ڐ3��I!��
<b*�
�
�Ae�C;��,�*
�0Gҿ�59��Dˮ
A��VY�����odK�<eg[�<eL����	<o��4�K�f����~�V��z����=�o��q�K�Hď��x�ה�9z��&�&ݛ޺mjrk���C��˵���f���0��x�i�����w���ɵ���JM0?^k�#�{�

�n�B.��a���-�
~���^y��(ᮽG�y\���
���C8P�Y*n�I0iF��j81ӎ�x���us���l6o����r��F�cz��t�����]�?M)��~��
������ }�n|���o��vj1- ��Ou��N!="-|��������
�z��%�B�ŋ\� ��6·\���SD
	a�M��h.���O��{��������Өb�XS.���O
|�>W�Ym�)H�j�;"�Hia�Y������X��7�<u�Z��\N��y����\a�ڛf6�*ݞ��1�n��W�k���i���AG�h��V0����hhT�\
��ʺW/����@�`{�ÿK�'�%��†��+�}�pc��ʸJ�\5�Jn�la����������uV�W���U�)~
-
W�x̛�Ҋ�B�I�s�A��I��;ppt��橞��
��
�?x�\\_j���9ޑt�Y+���KvA�-������5Φ�0���3�:ecB����<)�A'��ȝ�q�mr���x|Ki'�8���_x������y������'_8~rGz
8Zd
�xK��>��cK+���&�˹0�\��9j��YA��z���KU��E���etKeВv��
�;{�FiOGK���B˦4[�Noqk��B����ՙ%�ư�n9:�䞱���Sb_�F�ې�v]y�
-�g[�*��̋c�E
��vP��妅��Z�^o���6nE�z��fgY�KOI/�R��\
�b�d�y�Z&��w�a5����l{;x6�ߣ��u
-��o��l�g��wm��N!��Ç��H[[�����5d5�>��Yrnӫ��
���(X|
��(ۏ�� �)2�<5��\�>7(=���x��ș"'1�	T^�DI��F�?v���b�I,�?\2����k���W���y"I�w46�@�MC�i�K:���Q$߅lT.�#q�4��w�;���j��W\����ז�o��JU��� ɲ
�_IWI���o�X�R�Z���g�(+#n� ~��4���MЅ�3���
��#6�L��s~j 
XC򻳤
|Z��gbg'�J<�'t'�MV��^/ ���b/w�[��I9|��71> �!E�8�/�
ϊS�3?V��)Q�JȨp�S�Y

Ը{�q/U�
0�	�r#��=�?�w^�|�6$O=&�IK &���j
-endstream
-endobj
-1464 0 obj
-2130
-endobj
-1415 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 301.132 191.16 312.036]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 301.132 210.258 312.036]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_a0c6bf4c112511ed41878554ca3c02977) >>
->> endobj
-1427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.074 301.132 291.323 312.036]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 274.783 191.16 285.686]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 274.783 225.192 285.686]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_aa4c34f9b1017a3b44afaa423b832722a) >>
->> endobj
-1430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.007 274.783 306.257 285.686]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 248.433 191.16 259.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 248.433 215.239 259.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_a2cbe4b9477e2eed6411787d14c306af5) >>
->> endobj
-1433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [219.055 248.433 265.072 259.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 222.084 191.16 232.988]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 222.084 245.675 232.988]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_aedb7a64c3a6bdff1793482110849e5d9) >>
->> endobj
-1436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.384 195.735 224.634 206.639]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.132 195.735 248.703 206.639]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_ac622b43c176dfe1b92260b841192b305) >>
->> endobj
-1438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 169.385 215.13 180.289]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_a3a962a357f4260b224518672b80ccdc6) >>
->> endobj
-1439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 143.036 201.302 153.94]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_af6431ecb966a6e38dc55e7f4274b31db) >>
->> endobj
-1440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.383 117.061 205.147 127.591]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_ab9e90a38fb859d1dbe667efec83743d0) >>
->> endobj
-1441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.383 90.338 313.052 101.242]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_ad7fba193bb811d3dd21903c3fb5e2428) >>
->> endobj
-1442 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1446 0 obj <<
-/D [1444 0 R /XYZ 89 770.89 null]
->> endobj
-1447 0 obj <<
-/D [1444 0 R /XYZ 90 319.352 null]
->> endobj
-1448 0 obj <<
-/D [1444 0 R /XYZ 90 319.352 null]
->> endobj
-1449 0 obj <<
-/D [1444 0 R /XYZ 90 291.269 null]
->> endobj
-1450 0 obj <<
-/D [1444 0 R /XYZ 90 264.92 null]
->> endobj
-1451 0 obj <<
-/D [1444 0 R /XYZ 90 238.571 null]
->> endobj
-1452 0 obj <<
-/D [1444 0 R /XYZ 90 212.221 null]
->> endobj
-1453 0 obj <<
-/D [1444 0 R /XYZ 90 185.872 null]
->> endobj
-1454 0 obj <<
-/D [1444 0 R /XYZ 90 159.523 null]
->> endobj
-1455 0 obj <<
-/D [1444 0 R /XYZ 90 133.174 null]
->> endobj
-1456 0 obj <<
-/D [1444 0 R /XYZ 90 106.824 null]
->> endobj
-1443 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F90 507 0 R /F101 1162 0 R /F72 326 0 R >>
-/XObject << /Im5 1414 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1484 0 obj <<
-/Length 1272      
-/Filter /FlateDecode
->>
-stream
-xڽX[s�8~���maf-��m�N��L6q�%�xd,�t1������A���u7�}Bҹ�9;
;�ƃ�e��E�
-g<w"�~���_3��%�������JN�y��T�BN�dZ���
��n�L�b��Ǻ�H課L�l�>W���8QY�
)���T��Yޫ�2��XyC!(s���2�
|�
؈
bl�(�x5x���l_;�(t���S��y�9��=�����a�
I�YB!;_D����I�f`+
�Wɺ�����ѥ�v�3D"j$�5��:8f�<�]�����շH�Xinep4�n>���:l�p�٫��,b
GcJ
�ba�u�q�<�;{91�Z��C�-T��SE҈ߚ
���X���5DZs�ʼ�z��$���E�2+y���mH��
�·�_
!ĕE"���x��~B����Q���6�˸H�Q 
�s�u�v(�Sx��&٦�
-mW�o$�u�A���x�����T l�s[��2���w�~�v���P�*d��T�4���FX���OI�0[uFR��m'�g!�,@�����)���� ���WY���Z���Ahv0�5���6"�=�x�W�

f.�!?�Z
�0��V�P{6�Y��%e�` �kh�P?ŐB?z�֔�~C��0t�=��?bH�
_ɐ@�(mC:��R�F����1��B��A�h�,��y�{���1���m;�q��}�mKZ at v��(ʯ��*�J�.�ў�E!W
����]�$�6��OH�>!Gc�
-"Q'� 5��'���Us�n��V¹�!�}�@sa�h�::%P��O�p��Bf�$6��U��*��r��5C�G}�d~�e
@B{��h�8�n?me�U9��F�Y"b�Az
?BpP��h�j
�%�wP������AG�lQx
�S��l��U�)����;��5Ceˇ�%dq�2�[�1*6GZ��Iiޣ� (�Ð�(lf��y:�LJ�:zr^�ܗ�$�^U�"+�b��M��6_��KW��6�[�h�o����6f����*@z#
�y�^5��!N�uR��ae/X,�. b�䮨[F^��Ϙ�UU$�z{S�_g)�?wӷ�'{�!
���Q���VAQ ߥg~�����
�i=~�x������,��'Z�s#��F.����R�\��Ms�T��7�s�Vޭ�62�����U�
��*Gސ���`�������Q��@��'!tU�e�eU�ߌF���@q�:D��r ,Hsw;������d���$�����sL��	�� 0	jG�ݺg�`��[�7;
-endstream
-endobj
-1483 0 obj <<
-/Type /Page
-/Contents 1484 0 R
-/Resources 1482 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1396 0 R
-/Group 1472 0 R
-/Annots [ 1465 0 R 1466 0 R 1487 0 R 1467 0 R 1468 0 R 1469 0 R 1470 0 R 1473 0 R 1474 0 R 1475 0 R 1476 0 R 1477 0 R 1478 0 R 1479 0 R 1480 0 R 1481 0 R ]
->> endobj
-1471 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Coefficient__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1494 0 R
-/BBox [0 0 232 192]
-/Group 1472 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1495 0 R>>
->>
-/Length 416
-/Filter /FlateDecode
->>
-stream
-x��T�J1��+�6��$�$���u�C顶V�V�
�}g�d�nA=�,�3�y�&�y�]����4�����<�g�,�?���?�
-��W5�j��"�`&�`
�q��ǹ
����*��Flal�)懻YK�f�}&jg��b�1�q��WQ�=w�а�:
�VM�
6���k5�@DJ�Ķ��V
��kS8���]M��H����H,�E�<���X
	.+٪$�*j@�9q�Ҽ�siH[���l��QH	��:#-�!J�ۖ&J��cd� S �S�
h�[�Y����8�9N��vc�ň�|
��?�vЏ� ���q�
-'
�U9�~#"�L��*"�
'ßS9u��b@�9x�
u��bCh�G�,��8���	>��k
-,��{F�׏
[�JO_z�W�;�GYQ�?U��
�"&

-endstream
-endobj
-1494 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1495 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /TLTMMM+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1496 0 R]
-/ToUnicode 1497 0 R
->>
-endobj
-1496 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /TLTMMM+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1498 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 652 500 278]]
->>
-endobj
-1497 0 obj
-<<
-/Length 1499 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mn�0���b��"	!U�ET��=N���
Yp�?+�j	��o��7���<7fX(}w�ly!=�x�nN2�|
L"rR�\"��
;��>�]����)�*J?�8/n�ݓ�z~H�(}s��`������jo����f�,�kR��q/�}�F�4$���aY�>�/�s�Ly`�+�I�l;ɮ3WN�̯�*�W��Q�����^��΅p�ó���@y�� 
���

5�-R	��G�r��=�:�ԃ
-��<�w�@9�t��D�Hh�
-T�W���� �+"m�t�E��"�_Y��^n��^�}���bx>az����f'�e�����H
-endstream
-endobj
-1498 0 obj
-<<
-/Type /FontDescriptor
-/FontName /TLTMMM+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1500 0 R
->>
-endobj
-1499 0 obj
-325
-endobj
-1500 0 obj
-<<
-/Length 1501 0 R
-/Filter /FlateDecode
-/Length1 2248
->>
-stream
-x�UVil��y<t���^.��6Q�Msy(�,�IY)ZdmI�)і�$Ncّ�:R��Ċs8? HP�z$-
-�E��Fb�(
-js m�Fnaǀ]�	���d�$�1��}3�ͼ�
 E�

<'��e��)*H�������1�h���jn:;���Gw���
�H�{�iI�5��\���O�/���'�Nf
&L�g��
-I~��ds�M�
А r6����F�Q���5��U��Ӻ@��
�ʠ�ʉB@�Z��a��x��l����w,�V�Mg�_�I&{"��_��ÙמY���n����[Z�,�q�l,l2+a6��W 9��
-�ꪗ;���(؅���r��E�7��4fKX�av����aq7�ҙ��%�����ƹϵ�=ԩKEG+�:x�{�1��v���
O�Y]����R�N_Ueq�[<�o�3F��%�
��.L>=Bc
-��B�B�k�p:��;{��
��dƉQC{b�W��FQl��;��[q��I,n�e������b�xP�q��1��
쓞�Yo0�����H�n���p��:��g=[�y�*���&Jd�Z���)`}�4�Z=�����K&c�Cìz��o]^���x�Z>,�(c!�u�R��ׯ�� Y~f.��f	�FN�_�?���g�72{*���݆�?
{���[xdPo�I�2)*O�9a�4��E�v�—z��T�`��X
-烞lR��mH����{��J�n��X�P
Pg�XɃ�X�J��c��lr���PZ��Ԍ#m���Ⅷ��*��0����̓�����ud�t��6<vD峊��M~�C5y�9�
-��G�VNCn�g���}80w��̂��H:
������kz���+��\��|����������;gMf7(8�/�R�����xcvV��
�N9k��=8j��᳖zt6w��|��g�a�F�������/�1ދ7
:krh�CNΫl��
�d}�

-dK'{dl��1'uP+#�Us�O⛿_ۖ��fǡ��x*��NP�AO",����v9w���	�@��&�»���{�_i
-��C_�����O��
�1Z������kDkPD�ϲO?;�N��e��;ׯ���5y�������v�JN�"e�
-¡�j���ݨ�xV�{]M����??�����UL&bO��@�-�RWk/�-�]�G��t���a��(���K��-��\���KCU�hE�N]Ef��j<��oe�Vӄ)sd�܅��$7i��
>������ܰ�V"��owzN�TL�N*ػ����H�<��(���~Q-DA}��ER��Ѝ���J*
��|ih%
*
F�1kG���]��Ԯ��X�]��4jԘ���������>Z��s����'��B�x93�z~�h
�;�N
�[��_?��	���	�*�H���,�^�+!��t���,������K1cDz���Ɗ��x)��
���9:먌>��;
��ʚ/���P(���B!e�P|��k���tފ���G�f/��m�J�EUm&-`GMo���k���
3h�����m�_wƯ��t��U$ÎM�5_H�q��_?�����?�U�_�(k� �F�CT�k.�$�	�@�7�*�����GhL*�^�qZ�Q��?��]�]4�Ckʶ�����{
�
��#I&`
�~Dޚ��\sY�\���
-��Zڣ�7���z�S?*{(QU�{0OP�L�K�I(�� �O�o
-endstream
-endobj
-1501 0 obj
-1705
-endobj
-1472 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1465 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.08 665.14 257.33 676.044]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1466 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 665.14 513.996 676.044]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
->> endobj
-1487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 653.185 173.446 664.089]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
->> endobj
-1467 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.957 653.185 302.212 664.089]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
->> endobj
-1468 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.723 653.185 405.225 664.089]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
->> endobj
-1469 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.735 653.185 532.307 664.089]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
->> endobj
-1470 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 641.23 226.577 652.134]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
->> endobj
-1473 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 234.886 240.166 245.789]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ae2a6394e34e787c14484f3d411e022ff) >>
->> endobj
-1474 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.981 234.886 289.998 245.789]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1475 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 203.242 159.927 214.146]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1476 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 203.242 199.867 214.146]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ad6ca74b77c4e7c632ddfdc6ab8f3567a) >>
->> endobj
-1477 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 171.598 240.166 182.502]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
->> endobj
-1478 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.664 171.598 264.235 182.502]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a1109f21e2d8d35f3dae8ddc8074dd7cc) >>
->> endobj
-1479 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 95.042 159.927 103.889]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 95.042 182.632 103.889]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a733941c541eb74a6c925db946b39e46e) >>
->> endobj
-1481 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1485 0 obj <<
-/D [1483 0 R /XYZ 89 770.89 null]
->> endobj
-1486 0 obj <<
-/D [1483 0 R /XYZ 90 721.073 null]
->> endobj
-704 0 obj <<
-/D [1483 0 R /XYZ 90 587.289 null]
->> endobj
-174 0 obj <<
-/D [1483 0 R /XYZ 90 578.346 null]
->> endobj
-1488 0 obj <<
-/D [1483 0 R /XYZ 90 255.754 null]
->> endobj
-1489 0 obj <<
-/D [1483 0 R /XYZ 90 255.754 null]
->> endobj
-1490 0 obj <<
-/D [1483 0 R /XYZ 90 222.376 null]
->> endobj
-1491 0 obj <<
-/D [1483 0 R /XYZ 90 190.732 null]
->> endobj
-1492 0 obj <<
-/D [1483 0 R /XYZ 90 113.853 null]
->> endobj
-1493 0 obj <<
-/D [1483 0 R /XYZ 90 113.853 null]
->> endobj
-1482 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im6 1471 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1520 0 obj <<
-/Length 1228      
-/Filter /FlateDecode
->>
-stream
-x��XI��6��Wp�y/�� s��%�;3�N�s�燱l3���˿Oi��qҝ�%'��j���S	��
����0�
/�(��fN���
��m���=�~
];���>lҳg�}
]|
ݩo��Q�{��'����@8�w�;S��v0b�p
����Q�Թ������(WC���	�e!�c��`�; �����$�Sw@���2.�U��6�V1��ۮbg@=pa$���
��$�Qa��%���*dY*Yzn�R�_'ie^gE�4��<�\�\��_0�q"�
-i A	��ie��4˧y�^ª�j4�r��Z$��F�
>�tٗ��dU��1U-��i��yL���R���]���c�Ǟ1�
����~����E���l��o���AMFFF'�:�ΐs�b1��3Q�mb
���b����>"�h�1�EФ]�`-��Y
�"46���%�����b�~�!�^�*�)�)�]�i2)T:�����>2��1$`��W2$�Q�]C6��U�F��_E9c
"l+
-��l�}Y�,����lI��V�>
)x(w#��}�]����Y���']v��(�����l!�����$��r��u��!�L��M��ao��y��n5o?!XM��-s�
�LE�;�f	��=��vbx�
��
bw���
�j�ҵ������o��e��&���r"
3�\g�b�r��[�n��A
�3ch1��
a�.�۬hh�c;�+uW�>O?���$�
! � ���2�@]P
�#�-D�d���%��Q>�&�>W";*\5�2�(��:yT9��KvK�^�ge����e

ږ��,�x�j��
�l�G
-8燤^�Gެ�����C� �!��ԏ�i���j� ��e2=�x/�����E�
>�׌�r3��A܃5fП5���.ޔ N��'^��d{cȋd������u

A��ٿ|��Z��EMI�u�-�X���Y=DA�9�
-��0f}
y_UE2Q��J��׉D�(�6'�۴RQ�>D��$�	�H��$�'��P�÷�7BX��߅�r at O��G�����������nM1	j[���@k��ִiBA�`#P���
-�~���w��J� ��|4���mִbQ6_Gs��*�d1�7������O.�}K6��l
�nCb�d���@�&6�ȹ�5�W�l<�U���
B@���EU��
���
��9���n)l6�~�5w�e^X?�
&����N��fv_�
-endstream
-endobj
-1519 0 obj <<
-/Type /Page
-/Contents 1520 0 R
-/Resources 1518 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1396 0 R
-/Group 1503 0 R
-/Annots [ 1504 0 R 1505 0 R 1506 0 R 1507 0 R 1508 0 R 1509 0 R 1510 0 R 1511 0 R 1512 0 R 1513 0 R 1514 0 R 1515 0 R 1516 0 R 1517 0 R ]
->> endobj
-1502 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Difference__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1531 0 R
-/BBox [0 0 230 192]
-/Group 1503 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1532 0 R>>
->>
-/Length 416
-/Filter /FlateDecode
->>
-stream
-x��TMK1��W��tf�l�

-"
����/�V�
���l��v
�QdٝI��d�we 'o��j����M�s��d������|*�[~_�l�V���=d�
Pt��k;xQ5U���X�8�(v�YK���}G4H�"�Ì�2^?mU�1F��2�l��B�W�M��iڍ�]!"%C�TY+�I�H�)�ͻ
,
�R�
-C��Ffb�,
-�yL~��IpY�V�p��L���d���"m���\
϶�
��p��
Ҽ
��x�uQrl
"
�
�"���^7�+�

�d���.d25Ee�
��=Y�w����M'n�p��ѓ=�7rȄ�!��q1�i+���(��)�
���+n,��

7XF�q�˂�&�.�^c�a	��3��~T���5}�$:��wUq�?U��
%�
-endstream
-endobj
-1531 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1532 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /AQGUWR+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1533 0 R]
-/ToUnicode 1534 0 R
->>
-endobj
-1533 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /AQGUWR+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1535 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 495 500]]
->>
-endobj
-1534 0 obj
-<<
-/Length 1536 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0E�|�,�Ev�KBHU�aчJ�`��b,C�}�/J�Z����xf�^���v�~P5Od:�=���+����M�$ݩi��W}�4��y��������3���g�<�姄��w��w�J��K������l'ʒ�$�&
�ڸ��gJ�y[�wӼ
�����1��WR���5�}c��YX%&�2a���R��uk|
!<ˎYIF:����4hio@h+
A
-t�)g��	Ԁ����h�i�z�$d"��'2DB�/G����.��v ԗ#�X�3m�����]l�ڽ���[x�Nݽc�&�k�Tg����W�~�>��
-endstream
-endobj
-1535 0 obj
-<<
-/Type /FontDescriptor
-/FontName /AQGUWR+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1537 0 R
->>
-endobj
-1536 0 obj
-324
-endobj
-1537 0 obj
-<<
-/Length 1538 0 R
-/Filter /FlateDecode
-/Length1 2120
->>
-stream
-x�UUilSG�YI�	6���8�q
����#�8�M��؅$@��C�-G(�*P%TP���CE�P��@-��T�ڔ�R�R�	*���{v8l��ξ���]@ H�j`P��/2<��?����ؖ�60��Nk��H׿�IAGk�(-�>f
-��I�F�6n.A�i�c$/�
�� 4��|��}�̓x�	 �v�g��6 ��FAA1�����,zKӊ
�[<�F���Y�s�mLò 
2 �z�s
gT��zC��h
n���TĢ[���T�]
�ԅC���-��v
i��'g�;�9ٜ���d� � ٠�(8<
Y��K�圗♇U�����]��
-�ɫ��*NK�M�U��ey�&�P<�2�:�VUV^�
-��2�4V�q��
~�j���g��m9�))��*uf��f/.�o�թ�i��E >"^�i2�t��<�:���p8`��k8��׊�vE�� 
?%�t,�Er�DL��
�� ��)ʫw6����B}�0mcɬ`��i���8<���	N���Ń�&���*��b5�'�
����]��$�hk�,6����.�[?��phx�
�}�ZX�țo
�ԑ@����e�~�B
ѣr?���>�Z�d�1n�[L
�{((�һ$��Q!pw�݂�Y��隙_��e���Mjsv���QH��ɖ��3\�Vx����9�k*[�
�^Oi$(��FſK�5�F9W;�
R�F�ȳ���GHG9a�c6�,R�d��8�Y��n>�{��Ǯ�����m���z��^׳x���՞"��/I�Ix�Q�S �"��.ټ�I��z��
ձ�����ۺc��uᰏz^��7��=CG�����e�K;�n
Y?<q�$t=
�:

-Q��1���7娡}�Y3��G��_<k��=�ͯG{+����+!�Ň��|����p���. at T����B�~�z�
r�K%Ed�,��+(�-�����_���Yo�^�f~Q�ŽP�����h�6{ō�[R&Վ�;����!}N�o�(w?���]�.|B�Z��qꉌR��~4��)�A!�=Z���ڳ��W
w�/_F
���N.��
-�h�ܦc���T1j^�h���1��V��穵6/o��v�)����B�ٿi���Oq^N�$��v^Òp \h������*Q�v"�)��$Н�0��|~�o!�c�����w�Tlp0v��� ���z`��r~S�\g7 �8�����.�b�����$�7��{���
���&9�։exIu�e�U>t�Np��
��&a2�~6�ɮM
ف		�V;�;^.�:��;�}��>\�X�|���ޑ�;O�Hd���P�NP��D���S<N�q�r�w��L�f9oI_I]�&�R!��*
h�M�S���O�3��e���Mg�|]�bJ�c�Qܑ�\�c��	�t�X����$1&�U���ͧ��U����fv�X�i�� �^��=��p
��iNk`��Ik5�~4��A��q�}z��'h�1�J�I��[�
t��I?|$�60z��������%i�ʕ4�S����WQE�W�����٘�,t�&ʚ�rZ2�TP�t-��
-endstream
-endobj
-1538 0 obj
-1591
-endobj
-1503 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 284.961 238.482 295.865]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_af36458b7b549f4494a2554972244867b) >>
->> endobj
-1505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.298 284.961 319.547 295.865]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [330.008 284.961 407.258 295.865]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 255.246 191.16 266.15]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 255.246 252.31 266.15]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) >>
->> endobj
-1509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 225.531 191.16 236.435]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 225.531 257.849 236.435]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_aaaeb914f871ccb4e97fc4fd513364b94) >>
->> endobj
-1511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 195.816 238.482 206.72]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
->> endobj
-1512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.98 195.816 262.551 206.72]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2a702d0e6013ee746e60e4b3c53abfb9) >>
->> endobj
-1513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 121.736 191.16 132.64]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 121.736 205.277 132.64]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_aa575e8597c316031b6de799f6b5e55bf) >>
->> endobj
-1515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.021 191.16 102.925]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 92.021 205.825 102.925]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2e6d73507de036e41aa8e1cfc717835e) >>
->> endobj
-1517 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1521 0 obj <<
-/D [1519 0 R /XYZ 89 770.89 null]
->> endobj
-1522 0 obj <<
-/D [1519 0 R /XYZ 90 721.073 null]
->> endobj
-750 0 obj <<
-/D [1519 0 R /XYZ 90 631.186 null]
->> endobj
-178 0 obj <<
-/D [1519 0 R /XYZ 90 623.449 null]
->> endobj
-1523 0 obj <<
-/D [1519 0 R /XYZ 90 304.865 null]
->> endobj
-1524 0 obj <<
-/D [1519 0 R /XYZ 90 304.865 null]
->> endobj
-1525 0 obj <<
-/D [1519 0 R /XYZ 90 273.415 null]
->> endobj
-1526 0 obj <<
-/D [1519 0 R /XYZ 90 243.7 null]
->> endobj
-1527 0 obj <<
-/D [1519 0 R /XYZ 90 213.985 null]
->> endobj
-1528 0 obj <<
-/D [1519 0 R /XYZ 90 141.639 null]
->> endobj
-1529 0 obj <<
-/D [1519 0 R /XYZ 90 141.639 null]
->> endobj
-1530 0 obj <<
-/D [1519 0 R /XYZ 90 110.19 null]
->> endobj
-1518 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im7 1502 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1557 0 obj <<
-/Length 1225      
-/Filter /FlateDecode
->>
-stream
-xڽX[s�8~���maf-��۶iv�mg�I�)�xd[�i�������l�K���BH��s>
������{��{�� ;IA�s?u$v_".�m�<�#��>��
�'j����\Or5��Q��`}�R�����E���Ee��n�x}ʱ�!VEa��z��t����a����z��x���#`v���� t�I��+v&0}�=2t��E��S�ع���õSQn��Q����� BZ�D���B�*��l�!��<Z��Ke`�bp)6A�N��(ࡕx?���I4�(w�_뫙˦�Y>y��K\�g��#�-�2�� 
u4d�e��RU&VSӬTΣ���J��_f:չ*+o��<K���Ǚ��)Jgv�
�4���p�@>
�8���_(�۫
�
 �H�:M.�pBߔG��h����*�@�95���L ��y��`��
-Q�"��4c��A�hMJm�@G(��H��� ����j��O1Dԗg�OaL��o��������=�
��L��@l���r�0�8�r�|DX'
-�����!p��uY
)l(k+q}
�����ҹΣR�T1��,WI����:›��o�j�	�h
B
-J�0(
��	��=	h�j�����'WI�\d�Cl�l�7����R5#aY�F7��-��6��u2ҹ
_.ӱ!�b�����t� Oѕ�4��&�
!0�c
��T�q=�+jW�>�
P}?I�
-
!p	�.¯��#APG!g���(����Ϙl�M���P�(���>
-8���i�[/͗q�X�����%�~m��(n0�2��.�2�m�t�O
-GB�f�j�<�|G?!P($@�P(�S���*J��r8�E4чR�5Ѿ��2O��3z��(��i,82̠�j#R5#��S�8��AN r8�j��A�G�����?�y��ŠK KvN�9����U
~
g�o�{����O�<�C��>
 7����_�s���>+�!�{�_e�G#3�,��O(�V�2/��
-'�G�=�x�����	�K�������
X�5��a��yP腯 ���]P����{��A��R߶��\v�Ovp�yS���JgK5�^��ΧՕ�i��+t��ǹ[3�g�.U���h�T�E{�&�b��ȹ�
'Y?����?�W
-ݰ���o�q^��w��h9��h��Y�����A��h{���O���#Ja2�����U5�sL�9�
xu�Iк�_������RZ^�
-endstream
-endobj
-1556 0 obj <<
-/Type /Page
-/Contents 1557 0 R
-/Resources 1555 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1568 0 R
-/Group 1540 0 R
-/Annots [ 1541 0 R 1542 0 R 1543 0 R 1544 0 R 1545 0 R 1546 0 R 1547 0 R 1548 0 R 1549 0 R 1550 0 R 1551 0 R 1552 0 R 1553 0 R 1554 0 R ]
->> endobj
-1539 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Sum__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1569 0 R
-/BBox [0 0 210 192]
-/Group 1540 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1570 0 R>>
->>
-/Length 409
-/Filter /FlateDecode
->>
-stream
-x��TMK�0��W�hv�I�$�j�ò�/�]����w�M��
�Q��3ɼy�I
yS�r<L��j��
�U�w���a���wW��P�<^�b	�֊n����d�=�w#�c{xV5W���X��rQ�>�f,1���
���0
3vi�?oU�1F��ei�� ����f�
-+�nڭZ\ "%Cb�TY+�Iƈ�)|YwX���!Uu#+1C

�iJ~ƚIpU��9p�Q��g��-ߋ���oS[�q���m��܄��q�]�Ƌ�s-%��Y8�d��r�A
u3�"�*9c*�`�N.ۓ
-ǂ r�"�QV��#WD��~�
-2�_˂�cYp�Y���M�M�'��Y6�tO�V{4|�2��Ý�6�w��C
+���Q��cE>�\��D��u�a�M�su�>�6�
-endstream
-endobj
-1569 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1570 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /LOMWZP+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1571 0 R]
-/ToUnicode 1572 0 R
->>
-endobj
-1571 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /LOMWZP+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1573 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 667 556]]
->>
-endobj
-1572 0 obj
-<<
-/Length 1574 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mn�0���b��"����tâ?*��
�b,Cܾ��J�Z�����8��/�
�?�$^���<Ow+�:�:)�A.��_���bgn�y����%şN����YM
?ED�[�v�W�}_l5wc~xd�PU)��q��ykG�؛��r���{g���Z
S�Y�JrR<�V�m���2q���w��X�zl]/o���
'I�T�ROG:@KA4�=�=�-P��N9���N���:P���S�p��2���!�H	M��
�+�]�� ԗB}E����5t��cZ�n��"~B�l͏Wd&����

,��
-endstream
-endobj
-1573 0 obj
-<<
-/Type /FontDescriptor
-/FontName /LOMWZP+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1575 0 R
->>
-endobj
-1574 0 obj
-316
-endobj
-1575 0 obj
-<<
-/Length 1576 0 R
-/Filter /FlateDecode
-/Length1 2072
->>
-stream
-x�UUWlSg����$ƫ�񌳍�G�"v����&qBHp3pȄB	��R��*	P�}��*u�B�
-Z�E�[_�A%$(��!��\���	���q�=�;��K�G�%����$�衅��ݺet��/_�xGZJ"��'�?
��6�dH>�
d#m���*T�g��A:4:�&�f?�g��
OM�
�~�t6�
B�<a
�S�&�B�r�
��St~1��6��3j�2�FI
-!Z�vr6�Z%5�sJ�T��lN����Fv�

W����=5��o�Vk�C�'|�}��ą����It�6�
T�6s���`P��l.5Z5��a��sUB���4NisV@�H�qK��
-
K�$�ۺ)A��,|�<ݸ�\QRZ.	ԆR�ʝ����:�j.]�`�x��ZsFJrR�*�D���1[
-����y��dy��� ���1��x&�Za�T+��i�

��j�L
?Ѧ-�*�+�D�S��<C

f�$�6
�_y�����S���5�q
��ʛ�����z~
�\�u���C�މ��'z �D$j��z���l1
�����*�Fѥ����ڗu��m���'�g&����ڶV�6�֛�s?�
�86�
g����9)�Qb�'���f�TQ3\�r��'b�w0��A�)�P�BnoVJ�"5S��U�*_<2��Y�M�D>Bb8�-����.�b+8V�[�
L�%-]qY�~�/:�ߵ�x=�!W
�
`�*�A�I��b..��юV#ѱ��:~��C�`������5mKQ���
����w,5�
�瀞n�rP���3�g*�y�L"i����;�h_�a�/P�ߤounݳwh�q�&�Şgxծ�����6H�Mn���;�v=h���1t]j��x ��_|D�׆�c����
�YSr����6������������°m X�t��;�aw5\[1k at Xj�H�Օy����ѡ}IXD:�N�D�2Lbw;rc5��V��m�����V��
(�U�0����s�;`�������� Z�����ױ]}
>_|
� [...]
F�b�%AB�w�v<�K*Le"�
#�od��|>���K�S��'��p��%ݒ?�o_,��[��i��$D
�W
xI��M�hA��Fr���#��;�W*�<L
4�O���4�F9.=ޭ�s/ٷľ�� ��#���3B�4J:��K�R�
�Y1�b)ތ�=\�#�/�����.�������t<�o���
-endstream
-endobj
-1576 0 obj
-1562
-endobj
-1540 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1541 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 284.959 214.413 295.863]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a6d0d4f5a1f45dd0c5ccb2abe003bb041) >>
->> endobj
-1542 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.228 284.959 295.478 295.863]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1543 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.939 284.959 383.188 295.863]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1544 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 255.244 191.16 266.148]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1545 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 255.244 252.31 266.148]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a75fb2490197b55a1474aff4ce0022598) >>
->> endobj
-1546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 225.53 191.16 236.433]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 225.53 257.849 236.433]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_acd2297a09c09cc44bf66eaafb90e0d7c) >>
->> endobj
-1548 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 195.815 214.413 206.719]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
->> endobj
-1549 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.911 195.815 238.482 206.719]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a1af748b5b83815f826301969cee51712) >>
->> endobj
-1550 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 121.735 191.16 132.639]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1551 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 121.735 205.277 132.639]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a04d7bcdd3d8cd086fa28922403cbeb6e) >>
->> endobj
-1552 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.02 191.16 102.924]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1553 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 92.02 205.825 102.924]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_aaf17ce2383d125a60b8283addae73c7c) >>
->> endobj
-1554 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1558 0 obj <<
-/D [1556 0 R /XYZ 89 770.89 null]
->> endobj
-1559 0 obj <<
-/D [1556 0 R /XYZ 90 721.073 null]
->> endobj
-751 0 obj <<
-/D [1556 0 R /XYZ 90 631.186 null]
->> endobj
-182 0 obj <<
-/D [1556 0 R /XYZ 90 623.449 null]
->> endobj
-1560 0 obj <<
-/D [1556 0 R /XYZ 90 304.863 null]
->> endobj
-1561 0 obj <<
-/D [1556 0 R /XYZ 90 304.863 null]
->> endobj
-1562 0 obj <<
-/D [1556 0 R /XYZ 90 273.414 null]
->> endobj
-1563 0 obj <<
-/D [1556 0 R /XYZ 90 243.699 null]
->> endobj
-1564 0 obj <<
-/D [1556 0 R /XYZ 90 213.984 null]
->> endobj
-1565 0 obj <<
-/D [1556 0 R /XYZ 90 141.639 null]
->> endobj
-1566 0 obj <<
-/D [1556 0 R /XYZ 90 141.639 null]
->> endobj
-1567 0 obj <<
-/D [1556 0 R /XYZ 90 110.19 null]
->> endobj
-1555 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im8 1539 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1601 0 obj <<
-/Length 1204      
-/Filter /FlateDecode
->>
-stream
-x��XKs�6��W�Vr��� �ȭq��$ul�'�(Hfʇ‡
��. �"iIv:jf:�K�]|��bAl�-l�:y=���|l�(�g�WV�-�
��mi��
;���DB�ѓ���O�ϯ���|�uB���^ϑXq6����%
_X�0�
Ԥ�r)�gj]O>Lp�
-F�KQ>Z�2r�D����F��3%c����$KgJi oU\&�:)r�11;��[�֔�����8���c�j2-+��
o�%Mr�Z���M)�
-lUHAj��<��.���D^G�/5�*ZE�]Ri)N���ը}Y�\�Q��(W�Ef�
-�,M
�r�!��z��4� X�C.
��=h'?Qʇ�n�
p}�6{{������Зȡؾ��"�j��"�
-9�穱�`�o�3�m�2����
��-���

-(�x�w!e�����9B�.5$}��C��x'����
ǰOA���ɢ��؏��m�����
�������l�}j�A�q�;�q�\D؈�y��J'�I� ^���ۢy,%1��ֹ;�7e�l�z���s��N˗��q>A�ˬ���a�sm�<�eRG�o��I�.�l��*�o!u���X��A?����i���'�%O��6E��JҾB���Z�&�e�Ѭkf�Yh�)��}�,�jKӞ��śQ�֞*���M�X��Nd
Qj���cY!��;
���2�\���i7�u��Ձ���<�����p�B�d

�T�?�U�����Q�D�T�RpN�=��
- �Uid "S⢶�n�tY��nb�E���"���PI�M�N�Ta��Vg�>��礱N���?/O<ڥ$������e�>����/ps�� �/P��1�uS��#e�=��#�383�:C�܀��j�դ�a�8	ͤ�P��K�hy�2�u�q;�6~��~:x�@�f�穚E?�wrA8E!��$#���?]��� �8>
��ab~�8�\|h�-��
�w(���jyY�8*j��\}��2Y����B�\sV��g����(m��}ef���������Eo��#
�����i�jo�=�63�v�T���V�j��5yu�$k���1:D���.�u��D��������J�f0����(r8�۸}�M�:]6����b�29�ؾ&��V��v����D[鮌�����l�h֕��(.��%c�ؗ���ݭ*+�� ��L�ky��_�h��
-endstream
-endobj
-1600 0 obj <<
-/Type /Page
-/Contents 1601 0 R
-/Resources 1599 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1568 0 R
-/Group 1578 0 R
-/Annots [ 1579 0 R 1580 0 R 1581 0 R 1582 0 R 1583 0 R 1584 0 R 1585 0 R 1586 0 R 1587 0 R 1588 0 R 1589 0 R 1590 0 R 1591 0 R 1592 0 R 1593 0 R 1594 0 R 1595 0 R 1598 0 R ]
->> endobj
-1577 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Times__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1613 0 R
-/BBox [0 0 214 192]
-/Group 1578 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1614 0 R>>
->>
-/Length 408
-/Filter /FlateDecode
->>
-stream
-x��TMK1��W��tf�l�

-"
����/�V�
���l��v
�Qd��K�͛��we ����&8��	��<�-Lۏ<��קB���fs@��R�p�d
�!+�|
 ���E�T��6b
��M�{��E��l��wB�8#��Ê]�O[u��swY�'6 at c�ݫɦ�
-y7�Fͮ��!�u��`�1m
-g�.KAS>UR�0��nd%fʢP����Y�El�eA�9�4o�\*�V���qo���E	��u!�?�(5^b��(�6�E�L����P�7�+��"���������dȓ7j +	pԙ�
��q=�7q�	��CH;��𧍒O����D�
N�r������ڣ��Yt��Pp��A�5��������ǎF����D���p����Su�� �C
�
-endstream
-endobj
-1613 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1614 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /GLFYYR+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1615 0 R]
-/ToUnicode 1616 0 R
->>
-endobj
-1615 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /GLFYYR+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1617 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 611]]
->>
-endobj
-1616 0 obj
-<<
-/Length 1618 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mn�0��>�,�E&�4B��
���� {�"c���5~(�j	��o��3��R?׶�)y��jx&�[�yo^1u|��^�ſZ'�`n�i桶feI�G��/�{�c����7����J��K�����lgJEU�f�{i�k;0%Ѽ�u��y��_��☲�WR��ɵ�}k�,�4��JV%��z������.Cx���*R�(Ah(��AE�€��6:����Agh��T�:PR�ͧA�]8R� )G>�"�D}92H�wBv��w ��"���:��p��}>��}M|q&�4z��w�F����
�|��
-endstream
-endobj
-1617 0 obj
-<<
-/Type /FontDescriptor
-/FontName /GLFYYR+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1619 0 R
->>
-endobj
-1618 0 obj
-313
-endobj
-1619 0 obj
-<<
-/Length 1620 0 R
-/Filter /FlateDecode
-/Length1 1892
->>
-stream
-x�UUilW�y>�`�ص�&��8�E��G�E.�
8qb� 	&N�
-�p�Y��TAڟUQ��VU
��j� �҃V�J	E
T*���['@W��v�o���f� R����D��'� ��d�m�
��~���'[$6�����' �J�ycdP}�A=A�=62��ࢲ������� �KH@zd$�g
��HH_A1# ��͂�r Qo��Z��JkqP:�f�yM���y�aِ� f�(xE�I0�m�<���6�D���vxñ�}њ�u�`]C8����s��3m�#���山��q
-N��9f&�|pd@�Qt�Bu����N�Uc�
6�:���Va��h�Uߌ����L�|U��}s�&�P��2Ǿ�QUV^�
-�#�-�^��Ys�t3��I�u�k͎�����EJ�:+��p�J�7�hu��` ���Z�i1��(�mTj5�.3ֆ�ွީ�ֲMz̴���|����c�*�O��Ľ��_i
X[�Ѣ�&ws{X\)6%�m))�[�Jo��\-]Z�)���D��%S�@%X<�.~a��J�hO̡D��@G����yͯ���
���k
�
�,{��w�g0u&0ruddSt�c!�8+�(�a>��ߌ	�aZБ"*x�=
~
*D
���Y����Z�Y�U�q��^ܪ6�X��$Ox��
���E�/p����k�B��ֲu]!��+���ج�wi^�N��ku�� �j�� ���2��(L8f���
&t��f�ma����CGFZvd
-�!t`�jM��&g���-3�η������kC��,���ٔ����=n�7���KV�X۽o��78�9��i�9_�U�
;p�3���7��n�#�:B?�p�8�>��9

-Q��O����P2��j��9��D���&�^�k��C�=�c�+Z��/ۛ!"���郇?��[��5^�5����b�p{�
-K�3����*���N�&{��mx9ۦ�O���|]w��U�FeD|�m��n/)�#�n� $
�

��W�~��J��>�{N�:�:�<���Ҍ�y4��Rl�h��h�&z�X�w{��z��'ׯ���U�c�~ݠ
�T�2L�S�+�:Fa�S5���2L��W����
�m��G�݊ŠX�R
�5�껡���W��Ժ�`��n��
�96���2�NrI��uPM)�t�|Xܺ�1�d'��Dg��E?Ls���%}o�V%�<6&�B"�/�|BͿ��r
��)J*���ր��J�4�:b�
�H#��'���ͨ|�4�{
��+~^�_�
-U�Y���B,Z���Э����x�����#�+aE�%)� ���Ȋ�I��
h��`�w���$�lu�<�`�A����M��$V�'W�g��
y���
$?e���a�/)C#	�+�y��:�P����Q���������vQ�L���M�'C��
-endstream
-endobj
-1620 0 obj
-1429
-endobj
-1578 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.163 220.699 306.067]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a84e0592d7a7e218f4c4c782f882f18cc) >>
->> endobj
-1580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.514 295.163 270.531 306.067]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.434 295.163 315.622 306.067]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-1582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 267.756 220.699 278.66]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_ac3d22627243890fd03c69a0550485a68) >>
->> endobj
-1583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.514 267.756 270.531 278.66]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [280.434 267.756 357.684 278.66]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 240.349 220.699 251.253]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a8bddb181c1be9d2553b18871ab85e84f) >>
->> endobj
-1586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.514 240.349 301.764 251.253]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [310.013 240.349 356.03 251.253]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 213.316 159.927 223.846]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 213.316 204.221 223.846]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a2a5cc6cf6acdd7c5695af1ef807c40b2) >>
->> endobj
-1590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 185.535 191.16 196.439]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 185.535 263.777 196.439]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_aa37c50d4e586466d66070a61595399ec) >>
->> endobj
-1592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 158.128 220.699 169.032]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
->> endobj
-1593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [221.197 158.128 244.768 169.032]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_aca857d6f0e8cef1c2a2b077cd6a513ef) >>
->> endobj
-1594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.09 159.927 99.937]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.425 91.09 182.632 99.937]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_abef3573de0c962f79637f379b089b0ad) >>
->> endobj
-1598 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1602 0 obj <<
-/D [1600 0 R /XYZ 89 770.89 null]
->> endobj
-1603 0 obj <<
-/D [1600 0 R /XYZ 90 721.073 null]
->> endobj
-752 0 obj <<
-/D [1600 0 R /XYZ 90 635.369 null]
->> endobj
-186 0 obj <<
-/D [1600 0 R /XYZ 90 628.012 null]
->> endobj
-1604 0 obj <<
-/D [1600 0 R /XYZ 90 313.912 null]
->> endobj
-1605 0 obj <<
-/D [1600 0 R /XYZ 90 313.912 null]
->> endobj
-1606 0 obj <<
-/D [1600 0 R /XYZ 90 284.771 null]
->> endobj
-1607 0 obj <<
-/D [1600 0 R /XYZ 90 257.364 null]
->> endobj
-1608 0 obj <<
-/D [1600 0 R /XYZ 90 229.957 null]
->> endobj
-1609 0 obj <<
-/D [1600 0 R /XYZ 90 202.551 null]
->> endobj
-1610 0 obj <<
-/D [1600 0 R /XYZ 90 175.144 null]
->> endobj
-1611 0 obj <<
-/D [1600 0 R /XYZ 90 107.782 null]
->> endobj
-1612 0 obj <<
-/D [1600 0 R /XYZ 90 107.782 null]
->> endobj
-1599 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im9 1577 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1634 0 obj <<
-/Length 1228      
-/Filter /FlateDecode
->>
-stream
-x��W[w�8~������.A޶ۦ'��l�>�=>�]
.�\�}	ـ/�n��'f曙��D}
����璠G
�d�"��a��
�9�`�\�B�u\���Ȟ�ռ��Y:+��ٕ��Wi��r��i]�4t�f���s��i^o\�	���śvy�����z���#��ur9�0}Q� j<X�(Y��4�Ǘ��B�7���8\3�i�׈���n�A7HJ��IJ1�&�/�	m|�yc�\�n�~
�;O 
�PM�/��T�T8
D�/���y�P�~�,c8��h����N��!��vY,̵���<��mp٬�ˈ���6Mظ��h<h.�	�A��&!\f�S�_[
�U������&)�u5Dg��<��H�AX벘�I�,>���ٖ̓�{��B-\&�/��$Uy��mLS��Lϋ�^�����qQ�ڴ-�dWǏ.[��R�q�Ze�deQdY����K��,Sg=�5%� G���c9��\8�Jm���Cc1>�gh�H�m�r�)4�a��R* S !8��8ի
�Pn�Uwg��s����h[m@;.����}��@2��M�3X3.��
ٹ^�<����w��1��	ɗAߑ��sN��71ι�)d�!t����a�·�
�-�
�����J
c���$�B�ZHN�������0��M�.4ʮ�_M>}V����*�*�
-��%��e���1a��Y��;�zvRH =��
	D�'�&�Z���������]������bE	z_@�:
-ۣ��g�y
k6ɽI�	�}�e�zY���$�Z�fZ�`}^�I����p��n���?-�f����i����Y�����
	��Q�]�f󍕾�hgߔU��>nWF���m�
��
��햤X���C�:�����
�ӓ���] +���t��T!)d���E��t�Qt���X�&M����|�xg|�y�G6�	
ԤN ��2�e@�mA�OM��"bo��N9
-z���h���S���N7�r�)�/*�2;��^Ue:k
� ��@T�����H�8 |��
-~����B=q�מ
�9��� w#A~�� ���+������U�/�x�n��+U.��*��*s�p���:��mY?4%���y�b]���8�瓲
a��{+�6Gu��
x�g���Z��dzz	ܾ�	�<�������(c;���r{z��+��{zA(f�k�	B�d�0�[&�p�����
-endstream
-endobj
-1633 0 obj <<
-/Type /Page
-/Contents 1634 0 R
-/Resources 1632 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1568 0 R
-/Group 1622 0 R
-/Annots [ 1596 0 R 1597 0 R 1623 0 R 1624 0 R 1625 0 R 1626 0 R 1627 0 R 1628 0 R 1629 0 R 1630 0 R 1631 0 R ]
->> endobj
-1621 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1644 0 R
-/BBox [0 0 242 192]
-/Group 1622 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1645 0 R>>
->>
-/Length 418
-/Filter /FlateDecode
->>
-stream
-x��TMK1��W��t&�$���u��x�~������wf�l�-~
E�ݙ佼�l
yS�����
�vw��ٮ`�z/�
�|(�K~_���F�+B�V�
6P�`0
d���YU�T�.��q��?\�!8b6�z!�O��a�~��v*�R��25
\��A�Q�e�
r7�Rݟ!"eKMn���fk%�
��}!�mBnd�˜��L*��Jy����U�yNV�	��%Y�NΥ!��>�ޖE����u"Z�C�� є"J��Cf� [(CR�
h�[����!�usuC~w�N���O8��
�$.'��$^�C�(��C�o
�n"���H{�`���*���Q�h��&��q������#t:���Q�
�Y���Ч!h�fp����맊�/5C�I���;@�}c�T]�O�a(

-endstream
-endobj
-1644 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1645 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /STYAVR+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1646 0 R]
-/ToUnicode 1647 0 R
->>
-endobj
-1646 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /STYAVR+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1648 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 833 556]]
->>
-endobj
-1647 0 obj
-<<
-/Length 1649 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mn�0��>�,�E&	!U�ET��=$H�X�,�}�J�Z�����8�T/��g�>ܨj���v<�w��Z��FȄt���_
��O��i�2�(���O/N�[h��ǖ�E�N��͕vߗ[���
����$͝?o����}�����ާ�E|-�)	,q%5j�l��5�ʢ��*���*�OO����5.�K
�y\J
%� -��4(
�u�#��r��p�t�v5�
ԂR�my�݅%
���'cDB�𗢂��
���� ��l���n%��Yh�ֽ���[x�Nݝ�c
&�k�To���h׬���=�i
-endstream
-endobj
-1648 0 obj
-<<
-/Type /FontDescriptor
-/FontName /STYAVR+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1650 0 R
->>
-endobj
-1649 0 obj
-322
-endobj
-1650 0 obj
-<<
-/Length 1651 0 R
-/Filter /FlateDecode
-/Length1 2052
->>
-stream
-x�UUiLTW>�΂8#�:[�a�aP�7�"*æ���
:��#�Ce�h늂b�4&Mw�4mj�tK�jM�i�?FM��&��M��j�D���M��Ծ���y�l�9�>bD�Beĩ��'�O�>
��Bڽ�{[�u�O?�}'��f�#��o��~2
��\Z��x���o�������-FTs�>�k{b[��a.��	~:|F�x;�F�@�d�r�=ʍ�"֩
��F����'\���)�2�l�l��
�Ŭw��I�
��*{�>��_?�;�mGG���P��2���jl9�oב�>���l_�ʖ~8���;����%2�%��	X`Օ'�ϻ %���g^�#G�b���4���_����:��|]��qM�a�������ٮ�sJJu�hfGm��m���Z������#�l�)��)�:}V���.*V����b�0�
-�U��$�i�"9��&{l,�D�n��}�k�+��u���N5�y
-
;�;-�Uh����R]�S��.��4F���$���Y3B�κE����UΌ�%q7��!ԉt�����
�x�8:w��ɂ�ceqe�m/��26���ۿk��:��Z�ȳG�
<4�&������Y
��U�
U��L��hD� x�͜p���H`d�(�O�_�4���k���2-3[ʚj������8��{R��69�Ӕ8%qb�`˄�9.�4�;X�_����Y�2�6�c!�~M��8��\٬��F�0�j�)D�v�
�4�&
;6��.�uΔ�]�tD2^o�ݳ��vc�E��\,2᲻�ݕ]�׎0~��,Pȵ��+�xf���3������}^طI��
���9��׶����
��D������džw
Y�ҕG��V���j��rX?<>k݀��;
������JWWҿ9pN�5�,�5���Y
��o��0��Ouؚ� ��v�j�`W^�5F"�
u^/��y-��-v�#W�!�m� M��/�mz����w�ciɒ�p���iD�
Ae3�0k��
�a��
з�vA-g�ǣ����
`K��ղ;��8%�k�1�g&G^�ä�m�9���
n��ց�����Ef`��y���z]B�N�6�%���f2T

�PC5[���,��v��*P�*hXS���:�tʥ3�PC���K���E�Sr&��
jVD�#����T�4?Obل�
#'�,���C'���k��Y��Ž�P��`'�#�Э
O�k$�;4���a�!��뾏�|u0��FO�a���&���
`b:c��ܟ$�u���%�P�`C��[�d���,?�Q�af��{I���@�B���H�R"![=��9�nS��Zt�
};�Rq��$�g:��^Adf�=VU�E3έ>y�5��17hn
3oL�u|�I)���f��@��@5���Ԭ��٦�ݽ1���ƿ�(/$?�
VOU� U���]�N�N������� +癕V`��NP3�IX9�Gj��:ȃc>���,0�
d���|�q�x7֧�Ԍ�w�!��
xj��־�

�h:���=��V�����N[�5W�Ա�'��?�ⳉ
-endstream
-endobj
-1651 0 obj
-1544
-endobj
-1622 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 707.957 191.16 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 707.957 226.706 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a0e3334c609b7d72493ee150349098048) >>
->> endobj
-1623 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 229.686 251.483 240.589]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0b2d532ef24c4ccd4a4a04907d03f2af) >>
->> endobj
-1624 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [255.299 229.686 332.549 240.589]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1625 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 199.114 191.16 210.018]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1626 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 199.114 231.1 210.018]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0e57cbf0841e9af58ac2a52e89865a86) >>
->> endobj
-1627 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 168.542 251.483 179.446]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
->> endobj
-1628 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.981 168.542 275.553 179.446]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_adb175a61cbcdf46716687740a28e92db) >>
->> endobj
-1629 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.449 191.16 103.353]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1630 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.658 92.449 206.194 103.353]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a48032da1e7c874083e027a065499bd5b) >>
->> endobj
-1631 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1635 0 obj <<
-/D [1633 0 R /XYZ 89 770.89 null]
->> endobj
-1636 0 obj <<
-/D [1633 0 R /XYZ 90 721.073 null]
->> endobj
-1637 0 obj <<
-/D [1633 0 R /XYZ 90 675.413 null]
->> endobj
-753 0 obj <<
-/D [1633 0 R /XYZ 90 578.649 null]
->> endobj
-190 0 obj <<
-/D [1633 0 R /XYZ 90 570.376 null]
->> endobj
-1638 0 obj <<
-/D [1633 0 R /XYZ 90 250.017 null]
->> endobj
-1639 0 obj <<
-/D [1633 0 R /XYZ 90 250.017 null]
->> endobj
-1640 0 obj <<
-/D [1633 0 R /XYZ 90 217.712 null]
->> endobj
-1641 0 obj <<
-/D [1633 0 R /XYZ 90 187.14 null]
->> endobj
-1642 0 obj <<
-/D [1633 0 R /XYZ 90 112.781 null]
->> endobj
-1643 0 obj <<
-/D [1633 0 R /XYZ 90 112.781 null]
->> endobj
-1632 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F81 426 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im10 1621 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1663 0 obj <<
-/Length 1237      
-/Filter /FlateDecode
->>
-stream
-x��XIw�6��W�V� 
�%�&���کk+�8y~�L)R�(/��C,IIN�(}=0�|3Ca's�����t49��8��3�ub�~�x ��ε˩�ez� B$�H���������
MG�F��C4=Ga䤋���������ő�
-
�2X
�j��U0���6�Q,"�A�h
p��xc�1vߋ:�
1�ƔF�k��|Y�U��"&�A�T쌩��k��;�
���w3���b��[�&z)�R$R���ǥ�<G�_���(�����J�
Q�
�S��+�K�de�
��G&J!�Z��P�jaI�eV�G�����>��1-ě�'
 �E� ��ȸ�3����z���g�֛��ě�e"�n��r�B_�b����h�^ U!n1�q��Jf
��`2�e"�v^
�;����?�]
�(l��fRG�r�/8��aY
!�ӝ��
�)�pB�
B>�=e�/��g�ɨ�}��"��
��
��@����&�����A�3�#�Q������<�y�[��w���p!�(S�
�ٚ{���l�d�:/�!�
�u�7J�wc�Iy'd^'���y��d1 �J�H<�t7:�����'�b�p
��71xp��	�7 at h
L=�lՕ%3��о� ��*��[I㍨�U�Q
-񎴧.�*�y��{.3!��x]�M�\�4uﶞA^�`O=ӊ��h|�L��9{XuU�؜o3u�K~�d�au"0,�D)�
Hc�#���Bn�W��_;��d,��J�M�����Z>�}
��
C`6B	��@�����IO/E�ޣg�H"�ᰡ�i�/��~W�$Q�K�Dn��ؽ��ޗ�^�r�{���%=uj��(��㖠_���<���
���Y�^�ӗ��^/�EU�_��nz';�
�оy��(#�L���3m
tt�����{�|��˹��#�&���͑S��*
b�$����l�<�|;G��o͑U�u���[�
FIþGR6 �v
�q�(`���
c �1K��N�D���k`4_�~{RV�\��Fc����7N�i���X�+��k:�(��G��;�~�x
ى�0�f�����|̎|�p���*���0�@!�p�[��juqq�7�]�������If
������T����J��<�]���\'��6�Q�)���<��ؽ6�ڔZK�l���=b�4�C�]]/�L&�u�;C)�ȭ���!���m-^TR�|�Å��[���43S
-endstream
-endobj
-1662 0 obj <<
-/Type /Page
-/Contents 1663 0 R
-/Resources 1661 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1568 0 R
-/Group 1653 0 R
-/Annots [ 1654 0 R 1655 0 R 1656 0 R 1657 0 R 1658 0 R 1659 0 R 1660 0 R ]
->> endobj
-1652 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Variable__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 1671 0 R
-/BBox [0 0 220 192]
-/Group 1653 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 1672 0 R>>
->>
-/Length 417
-/Filter /FlateDecode
->>
-stream
-x��T�j�0
��+�q�؎m9�`�ö����i;F;Xw��OJ�M`�q���ْ߳�ޕ��
�6BA%�qO��9�`�B�}���
>�-��j���"�;`&�� �q���
^T��+��F,a
Y���L�,	� �;2���Z���iި�c���!S��z��,45�X ��٪�"RmHbY�
-0�1m
.�]*�
���u!
��(+���d�K����D��L֦�dE�5'`S/�����<���϶M
��p��	i�Q]y�eQrl<��
dR� ����Į���S��tH�����{ݜL;�DzI�&��O�_ �]9���:� ��C�9N�?m�t�܂b@�����@Uױ�;Z����(:Nw(8m���C	kx��Q���"V�\zM�4�����YV�7���{���&
-endstream
-endobj
-1671 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-1672 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /TFQXBQ+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 1673 0 R]
-/ToUnicode 1674 0 R
->>
-endobj
-1673 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /TFQXBQ+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 1675 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 667]]
->>
-endobj
-1674 0 obj
-<<
-/Length 1676 0 R
-/Filter /FlateDecode
->>
-stream
-x�]�Mn�0��>�,�E&�4B��
���� {H�������5~(�j	��o��3��R?�f𔼻I5��v<O7��:�FȌ��F��֊$��e�<֦�DYR��ٻ�vOz��AQ��4��\i�ui��ܬ�ᑍ�TTi��q/�}mG�$�����}��E|.�)�,q%5i�m�ص�ʢLê��ê�O�Rغ^}�.��������E:J�ZʡiP��AGh�@
-�SΠ3�GP
*@
()��Ӡ�.
)cP)G>�"�D}92H�wBv��w ����uhm�:��|�͹0��(�L�i
����Nvu�����
-endstream
-endobj
-1675 0 obj
-<<
-/Type /FontDescriptor
-/FontName /TFQXBQ+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 1677 0 R
->>
-endobj
-1676 0 obj
-313
-endobj
-1677 0 obj
-<<
-/Length 1678 0 R
-/Filter /FlateDecode
-/Length1 1892
->>
-stream
-x�UUilW�y>r�$v��A�G
�"��r'qȁ'v�	����)�@��JJ���*U%
-�Ϫ�R/��J�j�P���
T�Z qHP���;o� ]�
3;o��@
-����8
���N����=�

����I�������@]E:o��!�'H��G&v�R�I>Mrdx�/P���$GGb��q��䰁��3
-���,((�}�Eo�2���3lv���5��7�`��`֋�Wt���f-��j�Ity=n�7X9
߳o V�N](T�	��n���9<y�M��>
�06��3N�	�(1�̄Yn �
�7�.�@��>y�5)��F��fU�\�j�PM~��XiZ���,TEzڷ�ir
�K�r�
ի+�T�@4k��ʋ;>jn����i��`d�ٱ,K����T���Mgi��]sQ�V�-
�  h�SLKh�@Ao�TkPt���D��z�F��Y�6���V�
-:�H�<�3�b��O&~Z��Mc��ꎕ�7���#�J�)91mKYQ��޺Nz
�\�����J�$�$B�.q��*��au��\�$���
J�?
2](�C�5?�
�vL�1:>95�
-5:�Y�̱7�g0u&8rqddsl�c!�8-�(���$�wƄo0-�H��
��w��,���g�iV|�u�i�/iU�s�,C�C�'�IXZ��"������m�p~���]a��+����٬�wyA�N��suR� �j�e ���"�('L8f���&t����m�kݣ�������H���;MΆ�
[g��m���0��kc��l��>ř	9����=n�7��3V�X۽���78�9����9_�U��
�<Ձ�ң�M��F7��n
��\�k�]�`�
�������Pҿ�rԐ�|�
���Ul/޵�����항ɗ��0�uw�����k/�5��%��r����p}�

-�K�#����*)�=��M���mx�ۦ�w���b}w��U�FiD}�m~i���浣�݄?@H:/p|
������c�W�Ƿp�r�9�)ǩ�i�z���`+H���'���ء#��|�;5�C�>�|5�/�3V����N��a��2\�T1j�
�Ѵ
�0��^�'�w�mi
���*Ū�b��qW��{e���e�t����yc$)��ڴC���"�e
�t�rRXl(栈���'�?��GĝbCrܘ���
J���J�y`L$h�D�_&�BͿ���~^IUQS��B�m
h體A]�#�^��$�1���ӖޛY��i�9��?V���>�)��)�IL�E_4+nKס[��ӝ��{
�����(+/�"
B@�FV��C�
n@>#�IN٤���h�����wg����4���[�v&�g�S��
���QF2�6L�3��H���i
-��q��J�mtF���E9z/@?�,�,�-$�
-�� �P��
-endstream
-endobj
-1678 0 obj
-1430
-endobj
-1653 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1654 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 297.659 229.336 308.563]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable_a820ba8207751c8764ab6a51eb1183a7c) >>
->> endobj
-1655 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.152 297.659 268.34 308.563]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-1656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 270.82 149.098 281.724]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-1657 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.596 270.82 189.038 281.724]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable_ad6f7c3aef257204c507d0a85539aa987) >>
->> endobj
-1658 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 243.982 229.336 254.886]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
->> endobj
-1659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.834 243.982 253.406 254.886]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable_a5bb6231ba1b0357cce472468fc4733f2) >>
->> endobj
-1660 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1664 0 obj <<
-/D [1662 0 R /XYZ 89 770.89 null]
->> endobj
-1665 0 obj <<
-/D [1662 0 R /XYZ 90 721.073 null]
->> endobj
-754 0 obj <<
-/D [1662 0 R /XYZ 90 637.644 null]
->> endobj
-194 0 obj <<
-/D [1662 0 R /XYZ 90 629.405 null]
->> endobj
-1666 0 obj <<
-/D [1662 0 R /XYZ 90 316.124 null]
->> endobj
-1667 0 obj <<
-/D [1662 0 R /XYZ 90 316.124 null]
->> endobj
-1668 0 obj <<
-/D [1662 0 R /XYZ 90 287.551 null]
->> endobj
-1669 0 obj <<
-/D [1662 0 R /XYZ 90 260.713 null]
->> endobj
-1670 0 obj <<
-/D [1662 0 R /XYZ 90 216.791 null]
->> endobj
-755 0 obj <<
-/D [1662 0 R /XYZ 90 127.534 null]
->> endobj
-198 0 obj <<
-/D [1662 0 R /XYZ 90 119.295 null]
->> endobj
-1661 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im11 1652 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1704 0 obj <<
-/Length 1713      
-/Filter /FlateDecode
->>
-stream
-x��YIw�6��W��P��[��yYܨ��K����Ć�RN�_��F-�丵���Xf���f bo�a��藫��y������k/�^<I�������c�1��\�<[��z!
-ɳ��I.�A�}t�r�Me@��U�Ɣa�iŻ�4߉k�?�&�^��ga��ի��ѧ��G� 
ʼn�ף�b���W
��&�g=��&4�g�]�~a�
F���zX���!���t5
b�*s��&���g �n����/ۦ��
����y�
��$L<��Xl��@)ۛ�T�s��#����o�y�gϥle��K.�jߝ�0P��3|�˲�<;� �K���|�D�rE��%���t��*�[0	!>2
� ���8L5C
-��oL���L�Da0|&�\����CpX%5+X�)V�4��<�B�~,�ڀ2���y��|��/�i�f$F��ͮ�S���j��; ��
�k�6��
���h��(~���׭4J ��g�����/�IJᳲ*{��^��O+!�`ӳ�mz�V��������N�(�oJ�ԩCPʘQ�s�/�֢[���E�h��}��G�
�X��|U���چ�˨�]���&�?�ܾ
Hٙ���T�����>`L+�Ӯ�����X8��
nj/~��
�T���Q97��m�",�02���1�
-K��
Wm�@"�P�Vl$ ޅ`�
��ޝb0"��c�N�MC�����`��� b���!"z�G�!��4ّA��E�N1�3.�@R
|Rg�#��n�ޡ���
^�_4�X�}���BC�
-.5뾩l�����K������YY�6L�T�t�&{;�
"�+�[j���m�NU ɃġMr��Y��5����2ί��h��z������M��� ,�@l��.?�]��;��fC�%�<YQ�uGr��.Ӈ(��Uމ~%7xY�`�^Yv�RX�
Dѯ�9���s����ɹ]k����~��ʠ%�S ��P?
���{���z���=�c�����ָ,9��e�����4���b�~ޝ
rn�
T���f K^U{��8
��B�*�ݰԯJ#X�Q�+tf"�(=�J�
�N��GMfJm��.�]�������.C}O�S,�pK(fo1��i�N�[�d�6K};�
7�̵|�{
p]��k�
��J
�����N
��֛���s�=\E�wyYfŪ^��5]�W[����ÑJ�l�;�!ԾK��v�m��@���oI at R��#U�����N�ڕ� FR7�

�
1�+2�j��Ψӧ��;��cLCD�Z<�I#��.�+����UV����l�ٺ�0	��-���b����rw�f$��|�,]����
+((d�

�����d)�HӶ�������?]�\R�
���
 ��Bl��q|kЬS�5�@��9A�����
�=G�
��_

oZmY
7V���f/��������X(C�^Z1�w���c�i���}ڄ�,oJ��᧟���g����A�Eq�,���6Sw
�!kh�3tq�0��!"�b~�o}�@D(������4ٻX�Nߘƫ�{IS��f��s��|���V՝U�|0�w.P���J?��ܜf	�
��q�\
-W�=?z��Z,ݒ�$)�O��,�~����l5��7Gy{G�m&�1������~1��P�z�!Z#���?�0�$��
����D�q���g-�d�s�r-�m
-endstream
-endobj
-1703 0 obj <<
-/Type /Page
-/Contents 1704 0 R
-/Resources 1702 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1568 0 R
-/Annots [ 1679 0 R 1680 0 R 1681 0 R 1682 0 R 1683 0 R 1684 0 R 1685 0 R 1686 0 R 1687 0 R 1688 0 R 1689 0 R 1690 0 R 1691 0 R 1692 0 R 1693 0 R 1694 0 R 1695 0 R 1696 0 R 1701 0 R ]
->> endobj
-1679 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.385 210.527 696.289]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception_a655c21143c2eb90c64487e6e4dcd140c) >>
->> endobj
-1680 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 389.253 264.491 400.157]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
->> endobj
-1681 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.672 375.815 345.558 385.72]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-1682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 363.723 242.354 374.627]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a259d72e4c1cc8fbf723b463475882c9e) >>
->> endobj
-1683 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 338.194 208.312 349.098]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-1684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.81 338.194 315.797 349.098]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a8eb4ecbc8176c3018d1d742f5abb8115) >>
->> endobj
-1685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 312.664 229.362 323.568]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-1686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.861 312.664 275.021 323.568]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a10856aafcb2ba1f52e5158a96950d32c) >>
->> endobj
-1687 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 287.135 228.785 298.039]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1688 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.283 287.135 305.586 298.039]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a163804d4b5d0f7361974963ef22f98ee) >>
->> endobj
-1689 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 261.605 234.334 272.509]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
->> endobj
-1690 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.832 261.605 314.313 272.509]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_abc1363206f93e6778c1e9d136f24c01b) >>
->> endobj
-1691 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.384 236.075 226.314 246.979]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_aed0b5ff233c2092ec5414bcf36747dd5) >>
->> endobj
-1692 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.384 210.546 212.486 221.45]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a4b15258348ad1f31d1857eca9dd9bc68) >>
->> endobj
-1693 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 185.016 268.376 195.92]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_af95bf704d29d8b91d248d1d437ad703a) >>
->> endobj
-1694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 159.86 201.946 170.391]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a4155cebeafe8bc5e3d7d863e1a24abcb) >>
->> endobj
-1695 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 98.43 192.89 108.961]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_ae1928da791c8514b7e82e2d750ebdad8) >>
->> endobj
-1696 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 74.333 316.306 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a77b86c1af3be2ba98179fe26fc5560de) >>
->> endobj
-1701 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1705 0 obj <<
-/D [1703 0 R /XYZ 89 770.89 null]
->> endobj
-1706 0 obj <<
-/D [1703 0 R /XYZ 90 704.286 null]
->> endobj
-1707 0 obj <<
-/D [1703 0 R /XYZ 90 704.286 null]
->> endobj
-1708 0 obj <<
-/D [1703 0 R /XYZ 90 659.094 null]
->> endobj
-756 0 obj <<
-/D [1703 0 R /XYZ 90 535.049 null]
->> endobj
-202 0 obj <<
-/D [1703 0 R /XYZ 90 528.16 null]
->> endobj
-1709 0 obj <<
-/D [1703 0 R /XYZ 90 429.791 null]
->> endobj
-1710 0 obj <<
-/D [1703 0 R /XYZ 90 404.238 null]
->> endobj
-1711 0 obj <<
-/D [1703 0 R /XYZ 90 378.897 null]
->> endobj
-1712 0 obj <<
-/D [1703 0 R /XYZ 90 353.368 null]
->> endobj
-1713 0 obj <<
-/D [1703 0 R /XYZ 90 327.838 null]
->> endobj
-1714 0 obj <<
-/D [1703 0 R /XYZ 90 304.035 null]
->> endobj
-1715 0 obj <<
-/D [1703 0 R /XYZ 90 276.779 null]
->> endobj
-1716 0 obj <<
-/D [1703 0 R /XYZ 90 251.249 null]
->> endobj
-1717 0 obj <<
-/D [1703 0 R /XYZ 90 225.72 null]
->> endobj
-1718 0 obj <<
-/D [1703 0 R /XYZ 90 200.19 null]
->> endobj
-1719 0 obj <<
-/D [1703 0 R /XYZ 90 174.66 null]
->> endobj
-1702 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1759 0 obj <<
-/Length 2151      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~����J35L�ɾmݤ�l����/i�CK�̭D�$����{p!ER$%����'ހ�|߹����|溜�.��J�
Q(���^�{���
x�{_&�M�{�Q 

-�d�^����ͧ�[�����ş>�
��9��7[_|��������#�W�h�1B��n/~��*ݫQ- ^ �	�U��Gn%�c��?��B+q��7%>’Uڮm��0�!U�TM1�|�^�O�M<S�v��UZ$YZ��8����Ws��|p������ݍ���S�'��J��$��i��S�2˛Z�7dָZ������%��һ�K���Fo��@3*.�)ᓝ���M	��]{
`�tH~6=ʹ��̢$-�FK�GF���>�u��|�
-��:�O�<�ay��V�}2�h�u����V�����%	�aE(��K»`���ׇ�PFs����[�O���6��շcw�30�ʬ@yP���(C��Y�Y�����̟,�,-��q� `��o`
3Х�cP�|;�
�;{�AVI{�e�G�W�=��t�Aѐ")j�fLr�emg}\0&
�@����9�E��E�ֽ�=k۞�_��m �z���Q
"}[AڷAA
�'/	*���M�@JQv�p#
�b�‹,=�I��<z��&WE1 |anvSع�Z�*��ԇ�e�
�*ޓ��C��o�צL��߱�a�����
��MDh�g�� �a��N�AFa�(`��˜����m���
-�6^�#�a�|�L�:[o�e�.;z�f��^�*��
� �.r�0d��Kt���Vr�e+��F�Q}�I}�#�!�x���~P3m�8�&��ܓ�!���|��
��LH��D�`���Y�:��W�it[���,��.�V-�/��n���.��~>c1_��X���t�!�j��
w�籟T��X�@=];#î�6���Ff8 at -t'm̳D
F�zV�v}��K�����vȹ
%�䛈]��ڈ�\��"{�T"��s��ypKk����
9�ԩ=�zTN��5v13�=�B)�)� I�Q$$m�֮H�)�
1�[/ �S�
0G�hhK�4�
�p�di㗣3�Hgc3�
0����76�+��R?c�!�{���*��tj-�q�	��h ��R�Zrd-���62���ic�}+P�H���Þ���ڿ}�/T\$@kQ=��V�gUn�BT�:r5C�VE[bp�{��%.�H� ���eq<��4�_�セ�g_���JQe�: [...]
-΍J	�ӆ��q���ρS��8t0%�XgG"��&�lU��rx�3��,-m����.}�y�V�ʋ�����<h���SQr�D�f�݋�R���Ϝ�M%�I��
e>��w?���$�-Rn��������EEֱ-����nB�����&�����T1�=#uU
¿@�f���`
�)'�&��)ݜ
d�AP;�]��)�'"\��/FKܮ�`��	J�eU��5ܭ9�5�:��
��͏��ڿmb��BGQ�
��F/��X��!�WYE_�d}<�H��;pZ��MV�Bw�'�����X
- ��2�^r�
7�O0��聑
-@̬�BO(E3S8>"�x��9�TJLݑ
-�TP�
-�@��3ax��#�V�)��O�z3�=L�p&��_�3
;���:
�9�2���Y�4Nv���G��m!��h����JQg(�}�)�r߁��A�7V���8L!�Q�>Lm����g��
���$���D�:�;\Z�/kh
{֕v��j adH��ڳ}�"W/S���g�RqQ�R�r��JM���̪��8�ulp}��G�Z�8�<#��WU��h��UR\�}:��m[���U�5īC���4^%���^��X� I��a5:2�xh~���8KI����X�q/�ޭ��c���.A��^��j�*4A��7�
�,dՠf^wU�qs��޼�5�6�o>��r/]�w)į
�5V����P�?��O
�t[�T��a�E�
 "Ն�t�և��2;�?��K���5�V���,7�_]�o��J�h��
!�;C2������_�,���k����/~��9
-endstream
-endobj
-1758 0 obj <<
-/Type /Page
-/Contents 1759 0 R
-/Resources 1757 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1568 0 R
-/Annots [ 1697 0 R 1698 0 R 1699 0 R 1700 0 R 1722 0 R 1723 0 R 1724 0 R 1725 0 R 1726 0 R 1727 0 R 1728 0 R 1729 0 R 1730 0 R 1731 0 R 1732 0 R 1733 0 R 1734 0 R 1762 0 R 1735 0 R 1736 0 R 1737 0 R 1738 0 R 1739 0 R 1740 0 R 1741 0 R 1742 0 R 1743 0 R 1744 0 R 1745 0 R 1746 0 R 1747 0 R 1748 0 R 1749 0 R 1750 0 R 1751 0 R 1752 0 R 1753 0 R 1754 0 R 1755 0 R 1756 0 R ]
->> endobj
-1697 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 696.767 310.627 707.671]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_afbd6f23017c162cd460d4b0ac42ae4c8) >>
->> endobj
-1698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [314.443 696.767 371.219 707.671]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-1699 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 672.768 232.192 683.298]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a68cd1f4ad51eff8dcc8634ae7990b3e8) >>
->> endobj
-1700 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.008 672.768 279.514 683.298]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-1722 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 648.022 236.068 658.925]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a81aa24851effbe4fade96c65e7c575d4) >>
->> endobj
-1723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.883 648.022 317.71 658.925]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-1724 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 623.649 263.893 634.553]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a9971c2e55bbf3477c321cb1fed28c430) >>
->> endobj
-1725 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.709 623.649 344.958 634.553]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 599.276 267.071 610.18]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a6cace6b1265203d0fff22021fd2a56a2) >>
->> endobj
-1727 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.886 599.276 353.685 610.18]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
->> endobj
-1728 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 535.344 239.036 545.874]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a0a9d6f3a0eb496081b86efbb0ea0a011) >>
->> endobj
-1729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 510.971 239.325 521.501]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
->> endobj
-1730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.823 510.971 262.697 521.501]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_af933208cb9b9013073316c1107b3649d) >>
->> endobj
-1731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.663 486.225 288.644 497.129]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a535529376fbabac6dde098be2c0bc9d8) >>
->> endobj
-1732 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.021 486.225 335.844 497.129]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1733 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.306 486.225 457.323 497.129]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1734 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [484.029 486.225 513.996 497.129]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 474.643 146.454 485.173]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1735 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 438.938 193.358 449.842]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1736 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [193.856 438.938 252.296 449.842]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a8c602e835a5fe866cd3d0838c42ac9e3) >>
->> endobj
-1737 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 414.565 193.358 425.469]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-1738 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [193.856 414.565 264.491 425.469]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a3659575ce6ee121e2a2df2c347796fce) >>
->> endobj
-1739 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 390.192 230.289 401.096]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_af44c1d2698cf0080c2e7cdc4fc2b9634) >>
->> endobj
-1740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.105 390.192 280.122 401.096]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1741 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [303.315 390.192 349.332 401.096]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-1742 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 325.655 256.859 336.559]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
->> endobj
-1743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.357 325.655 349.541 336.559]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1dc4d783858f3eff8674c04502f4432f) >>
->> endobj
-1744 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [353.356 325.655 459.786 336.559]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
->> endobj
-1745 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 299.29 262.618 310.194]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_ae65e48247a4f2477e8c00f5088190bfc) >>
->> endobj
-1746 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.433 299.29 371.757 310.194]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
->> endobj
-1747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 229.768 172.361 240.672]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a36ac8f2a9f570db98e652d333541ae5c) >>
->> endobj
-1748 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 200.948 172.361 211.852]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a8e5ebed0862d7349443d391cb8aa9ab3) >>
->> endobj
-1749 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.607 200.948 294.434 211.852]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-1750 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.048 200.948 385.297 211.852]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.344 200.948 486.143 211.852]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
->> endobj
-1752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 149.214 172.361 160.118]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a42d572a34bcfa6f75a730215898de8c3) >>
->> endobj
-1753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.176 149.214 234.626 160.118]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-1754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 120.767 177.83 131.297]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a029ae33c5a3d2e301e08d77744d6b739) >>
->> endobj
-1755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 91.947 191.678 102.477]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a76aa40d264daa4af312ae293615ba3d6) >>
->> endobj
-1756 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1760 0 obj <<
-/D [1758 0 R /XYZ 89 770.89 null]
->> endobj
-1761 0 obj <<
-/D [1758 0 R /XYZ 90 614.774 null]
->> endobj
-1764 0 obj <<
-/D [1758 0 R /XYZ 90 340.965 null]
->> endobj
-1765 0 obj <<
-/D [1758 0 R /XYZ 90 314.788 null]
->> endobj
-1766 0 obj <<
-/D [1758 0 R /XYZ 90 249.14 null]
->> endobj
-1767 0 obj <<
-/D [1758 0 R /XYZ 90 166.936 null]
->> endobj
-1768 0 obj <<
-/D [1758 0 R /XYZ 90 138.115 null]
->> endobj
-1769 0 obj <<
-/D [1758 0 R /XYZ 90 109.295 null]
->> endobj
-1757 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F90 507 0 R /F60 304 0 R /F40 1763 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1790 0 obj <<
-/Length 2594      
-/Filter /FlateDecode
->>
-stream
-xڵZK��8����iG���$�Ξf��J6���T�,Ӷ&���$��~��EYv:ӞJ��' ���j�
����۫��w��2tnWN�OXBo�|tg^0�
ι�K�mz�����Z��]�/�~�E�e������3�բP��\�}Q�MC�?�J�iUf
-�y��A0�|�������� ��#H��E��m�>~����: F;���K~
����Wܜ�3`��b1:�L:د�Y�.�6�ʴ e�)7��[���{�]���m��ӌ`h.}���@aL��Tm�
ŗ���|�<-�ׯ��
�(�J|����մ���l�� �
��^�Jkh	���u�n�y���]���!{�#"J��)gsd���5��l�%��n�F2�Sl�UVKe:)-�
���|(%��ı�PJ$�K9�B��n
�����4��?�`I`�٩,�Ĺ��x�5�}͗��u
���Š�����'){��y l[�
-	.�*�R�E��o?�U�#k+sO�.��?m�(<�?��x�T���դb�}֭J��+팅�L݈�Z{����>-�֐LK�ϲ*�M[��
-;��YU�t
-М8l��Ê$p��B
(_
�cf�w�嗲����V��W�u��z�nqj��i�6T�
-���4�3
���V۳��U�`��vW�Y��Y�a����c��m1,éUZ4�%#��;2?c1��9�K܌!�ˬ=�R�b�3�!��\�
P�����;m-w���j�4cp�h� �6�_��N��9����F�L�}���;��~�J8�|�HD�#{��D2�
�i�l��]U��Y!lh�qJ��Y� 
ڴ ����bO�aO#�p�F9
�Q;���[�;JZ�k��
Q�

�
 'Z
"��6��8 2�Me&��cCs�I�e����|Q��Ve�2�߫ �}�>X�/ZCceV&��	8n�����7��D�O�E�$���d��

�*b8�U�ߪ:5����/
-:0O�A��5'(#
-KkI
��ϯ�%Iܳ���vR�.���i��8�LN�Qg`
M���mKD
hUӭ�v�C��t��Cq��tjv}SEA�n��Ġ; ,όS!��Y\N_�KgU�C�v�
�Yʮ�}6�
S>
?�z���`D��F�>l�l2A�
�A�F!����Q[��:��?�<
�i����F"��jp��}�]z qK����]՘h��V4[�}c� 1o�E
�d�v�o�.�šo3���e�(�������*QU<r�mTIc(0e��������
p&��zp�3�;Nߢ�
m-q�}]�^!���J���6��
-J0�!�=��
-X�$(2�5�
�A���?pfz� �o�6���H�˧�stΆ�μ"~Dj�@]
7
9)�*cF���$]@��F���>�ޤ� u���k�e����
<�)�d_D��RA�D�x (�?W.J��I_0
��"f� )�y��k?�u��K.Xi��K�0���z6�]m�X`O�C���U��'�X�C���RCմ
I�<!/!D|杓��
-��f�EE����$�	
D
�4	p^Zc�y�xد��H/��p�`��,���X}>W�C�����M���Ų�
-0��(�¤N�~X����26����R&������tUo���d�ʌnLc
-�`�� ���`€qOt���RF��kO#��� c�,a;����R)��@��]F��8ḩEӢx��nXC��:��}fei9@��κP�΀����%I�ˍD�I�h
-���{��ע<K�87~XC�~t�e-dSok�/E�9�#����;G�;��m��)�
�
�	�Y[�pZU��Jay�C(x#K��'� �Ǚ2+�&�P���Q��	��G��حa��@�,����f�,N�K�_�������!vK{��y�=S;���:�#\R/���;}�x��
4����c>���A�c��o at R�
�I
tDj嬬+�0���p�
11� ީr�n�^�P}A��OX�G�~�0q��wQ�1���X�iE���1�H���ǽ���S��m�	��!
�Q�4"��
�^C�p�Բ9Q�Xx
��~;�#w��z
����N%Z�d�X�� I
�b���
-H�m^�S�B���I��bK>��­�_�ز�xd�u�]�e���b�B�?Sl]@*��H� �b+��SŖda2�gU,Đ��E/�l���CӪ���޽�f��܃(�����������$1� �}��
�L���=��=~�� 3
�o�E�@��]����	 3U�Ѩ��Ǻ�~M�
��ݤ3	�&��A��ɂA�:!h&��!��[��+��ԟ���#���a��x���?X�7��f	>�y��j��
G���s�o�u�ʶ�����^z�#�1�ćH
��q�>NۍQ�SIp�Hz��s�.� NJ �)b�
�q�rs�o�l�c0��K��>]�ß*�+|u���6��e���׏��?�G�CQ$�wy]�P�7:��k�������H�гi������~�@�Dzj{�P��T:�^����{
(ap�

@�}��������E���
�z��h��l=�ewr������>
-endstream
-endobj
-1789 0 obj <<
-/Type /Page
-/Contents 1790 0 R
-/Resources 1788 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1799 0 R
-/Annots [ 1782 0 R 1783 0 R 1784 0 R 1785 0 R 1786 0 R 1787 0 R ]
->> endobj
-1782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.411 532.354 342.66 543.258]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-1783 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [264.006 439.013 322.456 449.917]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-1784 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.912 409.434 329.362 420.338]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-1785 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 182.408 201.372 196.355]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-1786 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 182.408 432.413 196.355]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
->> endobj
-1787 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1791 0 obj <<
-/D [1789 0 R /XYZ 89 770.89 null]
->> endobj
-1792 0 obj <<
-/D [1789 0 R /XYZ 90 704.286 null]
->> endobj
-1793 0 obj <<
-/D [1789 0 R /XYZ 90 704.286 null]
->> endobj
-1794 0 obj <<
-/D [1789 0 R /XYZ 90 371.949 null]
->> endobj
-1780 0 obj <<
-/D [1789 0 R /XYZ 90 349.573 null]
->> endobj
-1795 0 obj <<
-/D [1789 0 R /XYZ 90 349.573 null]
->> endobj
-1796 0 obj <<
-/D [1789 0 R /XYZ 90 261.402 null]
->> endobj
-1797 0 obj <<
-/D [1789 0 R /XYZ 90 207.713 null]
->> endobj
-1781 0 obj <<
-/D [1789 0 R /XYZ 90 171.556 null]
->> endobj
-1798 0 obj <<
-/D [1789 0 R /XYZ 90 167.073 null]
->> endobj
-1788 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F99 1084 0 R /F72 326 0 R /F8 437 0 R /F82 428 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1809 0 obj <<
-/Length 2740      
-/Filter /FlateDecode
->>
-stream
-x��[ݓ۶���o�f*� ڧ�q:v�ĵ�}I27<��c+��g���� EP��
N��H�����ⷻ<������/�7��S8�HK*�ۇD�Dq����U��L��/�o&SD����ӿ�����n?���׷7���	q�
��d���������#��䳝�M8ep�$o�q��(�Qa~��0%S�0�"
i�y?�|���6o�zNȬ�r�Q��?�����p�@1/�L���
h~U��G:�Z"��KTa6AZ�Y�m:�6�
rb�5u�^[��C�"���+ŐC�$R"MU(��c>_P��@y�U�n�wm��Os"f���jw�<eK?���M��ڬ\!X��ߊw6�>���F�I7��A$"W(�
�
Ǵ���i�
A"��FJ���
-)��
X6'��ubL�f Fo�˪l�:+�֛ޗ�ͷ�l�1��1��^�)�7��΍����O����v�R�qAcZWl�κAJ���K �A�
-��?h���d^��1m^C9z�� �s*|���\��S
�bio/��!
&6Eg0B#�y
�aq
�/Œ���V��$��N�i�
-�����������42�f(
yx[�$�"��\L�<�)�@$UN��[�OF�G��	S�4~��->O��I|��}0 }q	�!p%c��I��pD*y"u�<[fެמćI��(�8�XC<���]^��ǻ�u=�bV�w���wh�(�(�,�`�`Xt���8������:)
�{�XW���=�x�@��"&{ �1�
q�R7;��P\���~�
#��T��o���,�����X`�O�]�7p<A�����
�5�zث��2��Ƨi=UH��(d�����jEA)���C&�z �Я=�K�l�q��St�a��r�!��6���z��l�
���-l��2R�,�>���<���)��#�vqbZ��D��a�`T�8a�611?�ٌ��?��H����/~Z[K�JQ�>��~��䓼|��@�U���[�K�u�~�}��
���
&�8S���#0 x�����
����N,O�.m��ݭ�<3%�	a�Ǭ��1h$�|9�ӛ�3�5z 8�TӨ�*�/ [...]
-C�f�)� ���x%��;��L��*V��)���~�b8�A�)�bBF�iu����S

����{�6�6��1_�S�9��4w�mp�~S��(<�� �
}����� Cm"	�x_����j�ɷhi�6y������B:;B�
0��=D���y��̈́��	̎!�= k+���B����NT��E�l�*�F���S]ݛ�ڈ�
� qI!Iǥ�AQtTO����`y�vip"+D�~xb��?ݫ�}j��
�(���j�
�^�h\�cyщ�f()|�����
-`����;Z ��Ѳ�X�����b0P��4��>[e�DY=S
I=Z}�@�>on�|@\xs�
-�T�;+'�̙BqX�V^���9JW�ʅ�m����ǎ����
Ї�!
@M)�!��H�
<R‡_��f����
RG:b
�K�P�N(s���G��]�6�hFѹڬ������h~�u�u�^@%��̎JЎ@���s��ig�XދNѦ�,bi�:0xF
-{���LL�X�J)&����Y_>{�;薎��C�juRu�r�o6��1��<�6�L���k��TDDM��M�R�;��v��K�����qEe��$\ŭ
G\~W���+�L��`�'XlPf��`(��姿�PqA^>?��+��IĻ����>�	ġg{N��2{n�Lw(³�

��@�v�h��(
)��U9f��9��
�`}n��b�9��@����+h�[(�3Y�$zpZ1!vf��˂Bfd�>����ݓ��j���lNNُ-�P7P��uO�r��Ț[�f��dQ�y�Qݟ�bW��P��|�(X�E
I�-�Q�\�E�|uBz�C����l�+2̋=�s��N�PH�܅8�	�������XY�=����؟�S.C
q�k�����Jb��@�)	�p�K(�D�>�Vk�E��k�|W1O�Fap�т�8𣢰� ��
�
:�B�
�c5�&�
O���_s
Gq]dU���y;�MKʪOh���/AvL� \B�\a��^�[R{t��D��u3��S(99�'
 �a���?褢W�{�مz�Q���Mc�<̷�N��o>
tW�F�>e�T���k�b��u��^^�P<8'��&�Cl\@~�M�N-���GE_��M-Ln���Z
(�I-|s���5�{7�#*�K>F�,��4�q
`�6�6�Oz?��S�
-K�L�WmM��V�ѲjݏeU��peJy�޸��f^*;��;rP���n�lŨ|��>?�x�{��B�-.\E�hwל����k�B��&4BS(��ĦP
�)�?�)C�
-�8�)A��)�|��,�Q���u�{i��΋>-'��J��8�I�踻l{�t[�d
-'_�:�r$�^�TR�$=��k5Ov��u�}�j`-;�/�/B�"�'��8�,ȅ��v�{�?x�f˒o+ �#� z�
��tð�JI
�iX*������,�tO�e��9[��o ��fCz���&��0;�ee��7F�Z���h��r_%}����~}��W�wW�.A���D�m���������5ZV�}s۽� ��}��е���2��m6����~���[
-endstream
-endobj
-1808 0 obj <<
-/Type /Page
-/Contents 1809 0 R
-/Resources 1807 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1799 0 R
-/Annots [ 1800 0 R 1801 0 R 1802 0 R 1813 0 R 1803 0 R 1804 0 R 1805 0 R 1821 0 R 1806 0 R ]
->> endobj
-1800 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 604.759 201.372 618.706]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-1801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 604.759 432.413 618.706]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
->> endobj
-1802 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 593.954 201.372 606.353]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 580.45 201.372 592.445]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 330.564 201.372 344.512]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-1804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.238 318.609 379.76 330.942]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
->> endobj
-1805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 178.562 201.372 190.961]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 165.058 201.372 177.053]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1806 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1810 0 obj <<
-/D [1808 0 R /XYZ 89 770.89 null]
->> endobj
-1811 0 obj <<
-/D [1808 0 R /XYZ 90 720.814 null]
->> endobj
-1812 0 obj <<
-/D [1808 0 R /XYZ 90 630.064 null]
->> endobj
-1814 0 obj <<
-/D [1808 0 R /XYZ 90 554.522 null]
->> endobj
-1720 0 obj <<
-/D [1808 0 R /XYZ 90 529.989 null]
->> endobj
-1815 0 obj <<
-/D [1808 0 R /XYZ 90 529.989 null]
->> endobj
-1721 0 obj <<
-/D [1808 0 R /XYZ 227.842 472.817 null]
->> endobj
-1816 0 obj <<
-/D [1808 0 R /XYZ 90 466.177 null]
->> endobj
-1817 0 obj <<
-/D [1808 0 R /XYZ 90 409.558 null]
->> endobj
-1818 0 obj <<
-/D [1808 0 R /XYZ 90 355.869 null]
->> endobj
-1770 0 obj <<
-/D [1808 0 R /XYZ 184.963 279.664 null]
->> endobj
-1819 0 obj <<
-/D [1808 0 R /XYZ 90 273.024 null]
->> endobj
-1820 0 obj <<
-/D [1808 0 R /XYZ 90 202.318 null]
->> endobj
-1771 0 obj <<
-/D [1808 0 R /XYZ 90 153.82 null]
->> endobj
-1822 0 obj <<
-/D [1808 0 R /XYZ 90 149.337 null]
->> endobj
-1807 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F8 437 0 R /F99 1084 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1830 0 obj <<
-/Length 2680      
-/Filter /FlateDecode
->>
-stream
-xڽ[Ks�8��W�T��� ���f����d�)3�%��D9����� EP���'R �����M'�	N~����իI�h�3�%�w�Ɖ��
~͓/)���ɔ`��ǼZ�7����W�͢����y"q�~y���c5!*]�.�r2��o�z�o?�;�
�rf�
�L�BN��~������pB� I�̖W_���
��' �V�7��2��u�|���
-���WD����pBE:'Ta�IRX�S��>3�u�*�N�
�;,<�`Gx�!A�A靂��	:d4MD�N2E'5�ʐ&=���O�n�Pt�#
-J�4*��E���@�Sc,�1�@��$�ּ�ޕ�ӧ|Q�o^W&���Ҕ���/�p6��)!H��g�ؼ��H1�`c�� nG�
-b�#��a9ud��X#p��6��Մ��[i-K�;�����
����bBҲ�燈�XC<

��#⪐`��b������Y
8����R?{ƫ*������c>3�v^����0������.��A!�H$��Mz_��6��.�C^6w�ߴLp����-� ��1�b=�	o���δωӈe��t`)R�GM1�<�p-uت���PSVʼ.����J�&���b����["(��"I& ��A�R��n%ޕ�Bfϊ�7!$�En�;�S�p��E��}U�LU�<Ʉ��Bh�8�Bh��H,�-�J�D�P�Q>����
�FCrA
j՜�b4��t�<�,p��n\
-<��z��������
P�:9���n�^�H"b_i3p&Q�襆)�,%3���2���z> (����qBp�ܦ�8k����
JV
��U_�H
���gm>[�Y�r7��l�W�!���,�@�S�A�`�#()5�� �A	���>
��P
AA����o5�����y*RGC1P�E,�-va�����Vv"�X`
-g�f��=@1�v�����D
le�Yl��{l�69��a����!2c
!ʹ���[Q*�X�S��K����?S E �f�Kh
W�A7�X
��>��v��?���@U!���J+
x�d
�V����dt� �!
������֦
�Vq&ǐ�q�T�2�n�cf�7vY+�QL� fq�b�w�rV��N��q�e� ������~��^�B�CuSg9��<�
u�eHjy2��0R�t���Ϧ�imj
j����9,w�l�^
��#m�l�����c�$Om`�y at mtt��!�	>j�
���l �!�Ȉ��CqT��3�bI_���E�mD5�����0[��h�ũ�2��G"�4 n� ~��lj!���
�fa��<��-xr���)ry�&2(;�����H*�# �ٶ��@��q۹�h
T
:�*90��]�����
-Һ�4p��,�`	JP�(�����!|
��`=�'�)�RP��1�`X!������|4�Da9��#��DX�[���T�{):㪩&�8��ڵT#������jZ�-����i�4C��3f٧!	�h	��� �'So�=0���`;��J!̂��jc�d�d�[!�0-��y8|�t��ݑ�V����ra��x�̀���'SFQ3�k���.���vk�އқ�u^o�Ənb�֚}�EB��� �b�.
-oE�`H	@������Yq�����7��P�ӲKfg�j!�V�g��nm�x:#���
��� Ζ��z��,��={Il���@l�n�c�&_����� 脤�C�L‹p,��L9�iQ΋DLi�pv�`��g���v>n�S��5��^�>���,�I� �3�� ���\���#d
��զ��&��aW��,�[랒%�;���,A�4���$�
d��ށ
t�
X(��e�h�#$�������I
�>y#4C�P�D腶��pm{�� ��5̙� ��
XD�
��@�z�
��q1�'���d�誝=�lJS�5����2���Xpy�kC�Dr�W�/;g$�����nݽ(��@CJ���h�,:������4W��v�_�z�� Y�ϣ:7���JC�U'�� |�X�M�M�zJ�St�7��r��ŤU��at �I�s�t�����y�
�I�>S>p�'�$��l=ρ�f��փ��
��?,b׉8�q�)H���Il��v�AӜu�M [...]
��y'P-����CÌ[�3O
���g�e��V�CG*�mZ$�n𯏶��U�4v
��p1��#a�#u!���s��)��#4I�3��� �p='alƺ��5�G;5��恭�W+�'.�8@�PG$�u�t�D����o��ᜩ��b��w��y/����
29���݊p��|���M�;*�Hry�����z*Ǯ!�hZ�&ss������
�����3}/����=/����
w��͊9���>�~g���1�ol�����>��1 �N´���1߻L�A��q���eQ�h�;��{��V��xg
��o^��c���}�0�}���T���Ǐ����v;�~�C^�o����ҝmڿ��}m��M�H�L藼���9l_��_�����O@Ӆۛ ��9�J���1l�*�h�
����^�n�צ�G��r���n����ް�����2��-����iP�[o�^6���ze)�{�{�
6�«wK��s6����
-endstream
-endobj
-1829 0 obj <<
-/Type /Page
-/Contents 1830 0 R
-/Resources 1828 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1799 0 R
-/Annots [ 1823 0 R 1833 0 R 1824 0 R 1836 0 R 1825 0 R 1839 0 R 1826 0 R 1827 0 R ]
->> endobj
-1823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 694.926 201.372 707.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1833 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 681.422 201.372 693.417]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 582.91 201.372 595.308]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1836 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 569.406 201.372 581.401]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 458.939 201.372 471.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 445.434 201.372 457.429]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [122.971 246.623 210.761 275.937]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
->> endobj
-1827 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1831 0 obj <<
-/D [1829 0 R /XYZ 89 770.89 null]
->> endobj
-1832 0 obj <<
-/D [1829 0 R /XYZ 90 718.682 null]
->> endobj
-1772 0 obj <<
-/D [1829 0 R /XYZ 90 672.057 null]
->> endobj
-1834 0 obj <<
-/D [1829 0 R /XYZ 90 667.574 null]
->> endobj
-1835 0 obj <<
-/D [1829 0 R /XYZ 90 606.666 null]
->> endobj
-1773 0 obj <<
-/D [1829 0 R /XYZ 90 560.041 null]
->> endobj
-1837 0 obj <<
-/D [1829 0 R /XYZ 90 555.557 null]
->> endobj
-1838 0 obj <<
-/D [1829 0 R /XYZ 90 482.695 null]
->> endobj
-1774 0 obj <<
-/D [1829 0 R /XYZ 90 436.069 null]
->> endobj
-1840 0 obj <<
-/D [1829 0 R /XYZ 90 431.586 null]
->> endobj
-1775 0 obj <<
-/D [1829 0 R /XYZ 90 335.784 null]
->> endobj
-1841 0 obj <<
-/D [1829 0 R /XYZ 90 331.301 null]
->> endobj
-1776 0 obj <<
-/D [1829 0 R /XYZ 90 225.701 null]
->> endobj
-1842 0 obj <<
-/D [1829 0 R /XYZ 90 221.218 null]
->> endobj
-1843 0 obj <<
-/D [1829 0 R /XYZ 90 151.365 null]
->> endobj
-1828 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F10 1172 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1855 0 obj <<
-/Length 2158      
-/Filter /FlateDecode
->>
-stream
-x��ZIs�F��W��*h���f���<^4�|�S*�)dH@@;�_?��XH�����@��[��u�8ZF8�����ً��
2���f
)n���k
}�=���uĤF�Hx�����w7�n�������<���
�t4[�}�Gs��:ˆ
}u���
�����?g8���"*��^�����a�#E�Xxu.���uV�Sh r��_�.0P
K$�:���
Z���eB0L$5E�
�4�(C�����D�ZK��O8��d/�L�E'`��r$|h�E[�"�rI���e>�x�%Ye�ۗ唩�r�N��6v���6m��d��ŷ�Ca��Cn�1�^���}1��j���;d��(6R�퍛���R1��OcJ�$[X�(�n���4�W�g������$��B$�J5sR�&��|y�Pdy�G h��
--S��<�hU�8�g���ܭ³��+6�
-���O]Pc�	��;Q]�yZ&5���b�l�EY����࠘
-<ɋ�qo#�E��G0��|Fu
�+�3*�<K�q����UÍw*�1�4&�w!$_��v0G\l��K7Ν58 #�̇�\'ÞB�D�DR at R���h�5th��b��m�
�Ք�ɟ��ܷ��H�QV�"��Q��W�]�@��ɟS)&����Py��(.`p�tu�*�DL������5Z�5M���ޣ��C����\��[�1�z�
�6C�
���  f؋�� E��!�7e^u@`�ls��@Bx����1�u@����9�� ?�^�#��
-�Y�{
�	��j�!p��������L�x�
�8&�
#N�<-�m��<��� sA����>\��:��ۋ��r(�����fL�J�s at Ci�;� ���!5�B�t�
,���+
��u����4��3(������]t8�A$z�
-y��G���W�ֽ�M���-�M`=J���uZ�
c�з;�S�
A�з;:��v����4y�	�	C�ЄpM��xR�&^ԑ�
 �ٖ�N�ِ�㊿�g����~��͍��Qi|��cseO Ȉg-���Q�~͡�i����#Zߴ��O;����֊
8��H����=��H���)ѓ���m
�ɔ��[Y�����[��/t[�JO2�"7T�Ha��0�|;>a
���4���ÇM~Wl�y:�R�@=�
��E����[�ϑ�(��L!
��e
��<\t�L)��
�b)��W�,�+�&N(��t|�B�@��
��[�$
-A�$
G	a�鰏B@�
2	y��j0)a,�z84HV��
�C
	*"�w_!�taKt��͙ ���Y@ ���)�����=bc�-Wl B�,�v���|O&�[]!�9��!�[4�<
-��:��}
�R��|����o-�υ��\xk�Po�TE��K�_� ��i�f.S _(�(��(��JKĎ�(���&TgAb4R I
Ë�3�hĥ �8ݣ��޴*V��}c�o]C�JvSB��&~H!w��8+��B7R4��w���q 6fL�ؒ8&CdH��G��a�=��;���Gb�O����Gf\��
��|��t
!�R �y1s�}[H�h��Ǎf��
-�'�G�x�DgQ�
P/���g�O�e��J�T��.
-}& ���ϔ��O������*��o!Ga�$D ��NP��a
(G�Z��d��0�d ��B���H��V��ҁ@QYr�1V���(�SS&��Ƃ%qK�����P{Zty�
�
x-%E�6io�k��M��.r�b��?>��s\���(w��I�)��vUT�O]Ŧ��2/��	!��a}����|�u9�C���C
Ж���l��}Y�evgn�t?�s����5Ǒ��k�-��~�xy}���ŭ3��{�=��
=�v�]>Q�͈��c��O��86��3$�z�Pd�, ���W�?�;�8���
�󄄈��Y![Ȉ�/�i�d+��"�i5+�!���
�Z�s-�)}�.!]);�or�
��;�
���R�=l����p���E�ۉ�A^�ش���J
xțE�ѿ�z��۽��y���M�
/�:-��­�UZ�`�B�6�7�����?V[r@��g4�ȹN�HyS�����g���M0��-뼯뇟^���,�4_"Ȃa�^V
-6�ۏ[��.�`G��͵#1�x�
�T�
-endstream
-endobj
-1854 0 obj <<
-/Type /Page
-/Contents 1855 0 R
-/Resources 1853 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1799 0 R
-/Annots [ 1844 0 R 1858 0 R 1845 0 R 1846 0 R 1847 0 R 1848 0 R 1849 0 R 1850 0 R 1851 0 R 1852 0 R ]
->> endobj
-1844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 694.926 201.372 707.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1858 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 681.422 201.372 693.417]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [95.231 581.361 201.372 595.308]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
->> endobj
-1846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [95.231 481.3 201.372 495.247]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
->> endobj
-1847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [95.231 356.05 201.372 369.998]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
->> endobj
-1848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.841 230.354 249.291 240.282]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-1849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 175.179 251.513 185.107]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status_a417470c5917175d267ea3ec71df18027) >>
->> endobj
-1850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 147.113 253.715 157.041]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status_af2bdcebf7178739216e2dc7f5c421c9c) >>
->> endobj
-1851 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.841 75.309 249.291 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
->> endobj
-1852 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1856 0 obj <<
-/D [1854 0 R /XYZ 89 770.89 null]
->> endobj
-1857 0 obj <<
-/D [1854 0 R /XYZ 90 718.682 null]
->> endobj
-1777 0 obj <<
-/D [1854 0 R /XYZ 90 672.057 null]
->> endobj
-1859 0 obj <<
-/D [1854 0 R /XYZ 90 667.574 null]
->> endobj
-1860 0 obj <<
-/D [1854 0 R /XYZ 90 606.666 null]
->> endobj
-1778 0 obj <<
-/D [1854 0 R /XYZ 90 571.996 null]
->> endobj
-1861 0 obj <<
-/D [1854 0 R /XYZ 90 567.513 null]
->> endobj
-1862 0 obj <<
-/D [1854 0 R /XYZ 90 506.605 null]
->> endobj
-1779 0 obj <<
-/D [1854 0 R /XYZ 90 459.98 null]
->> endobj
-1863 0 obj <<
-/D [1854 0 R /XYZ 90 455.497 null]
->> endobj
-1864 0 obj <<
-/D [1854 0 R /XYZ 90 381.355 null]
->> endobj
-757 0 obj <<
-/D [1854 0 R /XYZ 90 281.085 null]
->> endobj
-206 0 obj <<
-/D [1854 0 R /XYZ 90 274.379 null]
->> endobj
-1865 0 obj <<
-/D [1854 0 R /XYZ 90 193.282 null]
->> endobj
-1866 0 obj <<
-/D [1854 0 R /XYZ 90 193.282 null]
->> endobj
-1867 0 obj <<
-/D [1854 0 R /XYZ 90 163.482 null]
->> endobj
-1868 0 obj <<
-/D [1854 0 R /XYZ 90 117.665 null]
->> endobj
-1853 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F10 1172 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1876 0 obj <<
-/Length 1264      
-/Filter /FlateDecode
->>
-stream
-x��X�R�F}�W�-RU<�E��V*Ud�-`Y���C�-�,F�%���~}znƲq�S��X��L��>�%ao�a������Q���1���k/�^�(��n�]�#�C�1��,��?܈����b"3�$�G狶(�oY[������`H#�V]iFŵ�ᾨr�
rN�(
�\�
/���G
�%������Ma��
)�����
)��ܻ�:�������1�\�XT�:�JQ�������7EcFb��> ����LTBf��ڍ�.�N�l��u@#���ff�3�t.��h
^��(d�R�p��)��������x4
�z2���w
�#
(��lA4R���
��O���d
�;����-ǻy
$�Q
㐡���;X������c 1�#T�b̆
⛢��Oq��0݉
-cʢ�S����A
�Ky�jk�8
�(�J����
�$��A������>��V�CJ�Q�;F�ƣ�i
-(
S��j�z��
�VE��1�O�Z��@͋�`�o[YL�]+�
�-h���\�
-��˙=��+��p|v�������'�=z����5uP�(
-�HP��M{Q����
$��
��9R��$���
K��f�\
$�@4�,�jے)��U;!И����2;A�<d�#B��� �	��Hw�߉`����		��j���	@\��x7�x
-�`}@�R*!��ܔ`���͔�ɚﯹXXV C�γ�y�
-Sc�Gڥ]K�ig��֖�*�;�㲯�c�(e-��F��r"�uUn���R}���P4~��ߍ`D�z��&���ފ�[��]�BM��J�˧V��j����	�o�%�j��˳�
&vQ=�X*

������t�~}s�5n�Y��y])��u����s@���Xf��(ᨍy�q浰��w�i֚�&uWM]�i�o����U�.�<����2fg�/}^�#��K�U�h~S���E�o�]���_o~���~V�ֳw�Z1���B���,Y�� �܊��4|z�%(IC����{U'R�!�Kξ)҅
-�H̵��b���n�}X�Z?5���t��:1��_�c
-Ǟ�B�^�w�j^��E)_��h��
NV��g�gլ�fv�1Ȏ�֤���o��?Q��Hϲ������X�5K� ����!;¥�����F��
-]AO��=ě�]��ۛt�FT3���l����$A8&n�R��Z�8�
-&K�l�qǥ>��1uɃ�߂F`�$T�X
�?�F;�w\23y���fgo
-endstream
-endobj
-1875 0 obj <<
-/Type /Page
-/Contents 1876 0 R
-/Resources 1874 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1799 0 R
-/Annots [ 1869 0 R 1870 0 R 1873 0 R ]
->> endobj
-1869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 552.822 187.833 561.668]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode_aed6d879ab6fa6e6dea28b6841058c848) >>
->> endobj
-1870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 295.358 224.515 306.262]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception_a3c4ed48495c48bc67b46023bb0b62828) >>
->> endobj
-1873 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1877 0 obj <<
-/D [1875 0 R /XYZ 89 770.89 null]
->> endobj
-758 0 obj <<
-/D [1875 0 R /XYZ 90 670.469 null]
->> endobj
-210 0 obj <<
-/D [1875 0 R /XYZ 90 660.794 null]
->> endobj
-1878 0 obj <<
-/D [1875 0 R /XYZ 90 572.218 null]
->> endobj
-1879 0 obj <<
-/D [1875 0 R /XYZ 90 572.218 null]
->> endobj
-1880 0 obj <<
-/D [1875 0 R /XYZ 90 514.575 null]
->> endobj
-759 0 obj <<
-/D [1875 0 R /XYZ 90 415.063 null]
->> endobj
-214 0 obj <<
-/D [1875 0 R /XYZ 90 405.388 null]
->> endobj
-1881 0 obj <<
-/D [1875 0 R /XYZ 90 316.812 null]
->> endobj
-1882 0 obj <<
-/D [1875 0 R /XYZ 90 316.812 null]
->> endobj
-1883 0 obj <<
-/D [1875 0 R /XYZ 90 260.895 null]
->> endobj
-760 0 obj <<
-/D [1875 0 R /XYZ 90 130.077 null]
->> endobj
-218 0 obj <<
-/D [1875 0 R /XYZ 90 120.402 null]
->> endobj
-1874 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F22 1018 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1899 0 obj <<
-/Length 1404      
-/Filter /FlateDecode
->>
-stream
-x��XK��8��Wp[8X���noM^덝\���C�#p�f��
`�d����������[�-ag�`������$�N���|���	�� �2�`�����8�I���_��/��gjl�r>�6"0�
b�sFN�
}���
�_9�8rn�Okǧ
ޅ3�=�
-F���zY`9 F"� �n^�y�)�ܷb�Ҵ'�2m�5�n}������ �,r`"
-j��L)��u>�9��k۩�+��{=L9vW���n���Ϙcx�=�"�D )�$����p��{�l%h�k��iT��"ml{i�6v�5�I;P|܉a &��ペ�DZ��SQ��Gh�Z�{�u�Uc#
�g1��D9+"ޘ`P��h�����Ne�Q�5D.z}�,��P�$�}��=�ݤ؊�^�WRf?(���ԷR�f�s+"-��6��"�����2Rdg�;oM�U�v-�&Ѭ�e%��zD؏�(�L��RV�WYVEQ)�y��ObZ�g}w�BG�C�`�`���E_�����r�bΩ��Vi}�����6�\'?�V�`�;~�g|(��Q؅�6��a �#T�Řu�MUx��w�"�?�O1XϏ�"�B�2ޗ_�
���#��
�שG}��\А����`	C���L=F�a>l��gG��h��R
�7{t����nh�KH�W�T
Gy���(�{�hoG��E ht��X�n\��ߕ����6�>"��~`��-n�/����������
�ww^�M��?{a�
S*
���B![�:J
��p��[uA@	�
�]4��gù��-��U��d	�!��V��N�a��z6�p�YzO�h���੐�p� `��
$v�=
�6�M<���NE�=�?f�1@��#�N �yB֝�?�����q�l�Mb~� ���WH�Dz�
֎F����q�W,�6���N�@ɡ�>ҳ!�G�9�˳2�����&���a8)��c��
+��Fg�tg��rI���Ҟ:�F�����-c��e�A8�A��~?����I	��SH��4������zhK��JT�>�Tj'�B"�ږY'��k7zL�{���Z�F�-�sh��JZ
����h;A�6
ؐ��H5&��!U���z�Uf�+xSe֤9��
��
BWo���{I��&TS�@��eƌ���R5m�R��t�V�ƴRȸ�`�ݥ@���2i$m�'Y}KQ7�Wx���Џ6��
s �<�
{ü7�����78�b�T��`;�v\\����vˍa��nA}����R6Q�a�o��/����j���
�r�MV��˲r�o�R����7eh��&�6)������;	Ҝ"�HHE{e`T��4}�b�Ӵ���n�ͳ���vU�r��j����&�!�i�vWzkp����ε>r�C{�
Xo�~
-endstream
-endobj
-1898 0 obj <<
-/Type /Page
-/Contents 1899 0 R
-/Resources 1897 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1799 0 R
-/Annots [ 1871 0 R 1872 0 R 1884 0 R 1885 0 R 1886 0 R 1887 0 R 1888 0 R 1889 0 R 1890 0 R 1891 0 R 1892 0 R 1893 0 R 1896 0 R ]
->> endobj
-1871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.594 685.195 156.032 696.099]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a0f022d23c55748a9e437e1625149bf5a) >>
->> endobj
-1872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [123.594 657.166 167.091 668.07]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a35e4df2723c110fbdadbcde7fe9cfae0) >>
->> endobj
-1884 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 388.611 263.464 399.515]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a65283b563ec02a47928cc176c738f78b) >>
->> endobj
-1885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 364.633 257.925 375.537]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a4e5e7fc32bfd0ae986d63ec82db62f6a) >>
->> endobj
-1886 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.068 301.876 247.464 312.78]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a0c349132b447b3e6a5234a23257f417d) >>
->> endobj
-1887 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.068 276.28 248.022 286.81]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a6b7d95f94c10fe3747eff2a3e05f9d32) >>
->> endobj
-1888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.068 250.31 256.072 260.84]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ac555ee6fa79c8a4d49f8ce2a14ca1cf6) >>
->> endobj
-1889 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.068 224.34 240.819 234.87]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8876ac784666f054f546f48404cb27a) >>
->> endobj
-1890 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.906 197.997 233.078 208.901]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ab6bcd066e77a3dde5c6127ac6dfabfa7) >>
->> endobj
-1891 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [201.906 172.027 231.006 182.931]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ae763a3d0db8c57898dff5ba199ea87e5) >>
->> endobj
-1892 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 109.269 287.823 120.173]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a805ae2717e65749d104d71978ed97fa4) >>
->> endobj
-1893 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 74.333 304.969 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a8ac14db1f77aaa2e88fb7148633f7e) >>
->> endobj
-1896 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1900 0 obj <<
-/D [1898 0 R /XYZ 89 770.89 null]
->> endobj
-1901 0 obj <<
-/D [1898 0 R /XYZ 90 704.256 null]
->> endobj
-1902 0 obj <<
-/D [1898 0 R /XYZ 90 704.256 null]
->> endobj
-1903 0 obj <<
-/D [1898 0 R /XYZ 90 674.492 null]
->> endobj
-1904 0 obj <<
-/D [1898 0 R /XYZ 90 628.753 null]
->> endobj
-431 0 obj <<
-/D [1898 0 R /XYZ 90 517.479 null]
->> endobj
-222 0 obj <<
-/D [1898 0 R /XYZ 90 510.796 null]
->> endobj
-1905 0 obj <<
-/D [1898 0 R /XYZ 90 429.672 null]
->> endobj
-1906 0 obj <<
-/D [1898 0 R /XYZ 90 316.988 null]
->> endobj
-1907 0 obj <<
-/D [1898 0 R /XYZ 90 291.207 null]
->> endobj
-1908 0 obj <<
-/D [1898 0 R /XYZ 90 265.237 null]
->> endobj
-1909 0 obj <<
-/D [1898 0 R /XYZ 90 239.267 null]
->> endobj
-1910 0 obj <<
-/D [1898 0 R /XYZ 90 213.297 null]
->> endobj
-1897 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1926 0 obj <<
-/Length 2286      
-/Filter /FlateDecode
->>
-stream
-x��ZIs�6��W�VjZ�X.��i�I�θ�{J2
��,N(R!A�����͒"ל�z���V|�=@ػ�����7�W���4�n6^��(H�k�}�	F^,	��ߧ�.��W��V����WuZ?."����
�^P�ws��9Kʱ��H��4߉��$�E���2&	�C��t���כ�/��
1�p�^����	{k�~�aĒ�{Гv^@�/��^`+��5�^
����QhF� B��
ʭ0���L�^ܯ�r��w�gW��Ԯʥ���:VbS�
�vb^�2O���T�Ui��̈́���[�Uᘿ�
-�FZR�€xK�
�ذ��R>Z�}Xr�Z#�Tf6.���ܿ_�s$�2����*���@O�k�lZ��k��b|BH���9�?2�%� @[W{'d[�S���,Yӕ֊�t'$���RJv��1ð���"k
�՜�W
-z
^��{}��i�6B�>G��ZF	�V5����yzn�~��{&G��d!�	pI#��py��!߉��2o�r]��w† f��%)a�ʂ�r�5�e�Ț�d��v�CuFɪݾ�� ��U#��B���Um�v���K�1+���������0;�H� ��
�
��g�Z�a��AX�
i���ܼTNV
�gϘݳ�dڢ�۽�g �V�a�c���
�>
m� p������>>����,�'u�6^�l�b��:� =˺���'l�s�(W
��g2� 7�Ȓ� cF��̿���4��&����e1�6�]���'�}�=gUQ�Lv���ė���j�kӖ�0���2��aꏨ��[�, ĸ�{Z���݁G�O���e��Tջh�]�^Y-Ԯh��#�yZ' #�'�M9�����8��S
�@��j�ڊ1�B@ѳ �7E��F	Mf!1��	yc_(���E�U�*9�F9J��Xa�ӄ�1+�
F���`a�x2
A|���et%��O�	Cq��`'�45�����.�`O�4�}�~���Q��)����[��`���� <�@c?��_;�)V^��\���te��t�yh�:�$B!����V�c�Pl��m��4�����*�7}���
-�,�Ԗ��aXR�݅��]���L�3�v�:� ��^�.�S�6u�3�
���(�kW�d��;1���@r�|�bt�b!�X0D19�b��C
�(f/�1N��υ1�$�,�#���B1�9��F�:f�L��<,�^#L�,La�#ƴ<c G��O��<=n
��xp��̡��/ű�,���9Q��P��=f��A1hi��
�A�a+J�R��U��~�rkZ�9h�x��R|� ���, Boga�)��A�S�A�m�--�`,�e��8�%�:�`]B����4��V00��v��)���0������[�q�D�EB��
-��U����^�+�Ų��{�,�f̅��
N�q��~SwQ}�
�^�qNaHorN�


l a�������:h

-
N)��F���zP��lyL��,��|���ω
-�[�U��
-c
X�Ƭ� ��I4

��0�,L��*-KWv@N=��1�?���,L *��G7�f稺��jΗ�
>\�g�6?��j����ו���|�# ��%d�;W�CG�2e>4
MXfhB�){��b+I�
>���~��/ 4S�Ջ"ѥ�0�`^�괔�f�a�ʦ���"�����	���߫��y��n{�-Y�񕺄i��u�
X���J��� U��� pt_�r��]cFL�
�n�VU�ٴ��
m���"�
���
���� � 1p���0����"���0�Q��ڊ@�~n���<�ħɄ�3K|guVT�O�6
�rVr
���YXPw'|��!dĄ��Ϣ��p�	���
|�R�P`%d�\��c�M�>@7�(!�H
%N�'R<e]�9��38�1t�
_���|{?��~ⲷ�E�
-bW�
��Wi���n�!7gU�ߨ��ݡl�ͧ{��
�Zd��j������E� �0 񦕕�W��>�.iW�~+�T�ܪ����"�*��7���`)��Q�JG$ߜ��'�_V�P/ҷ�#�(��,3k���
-!��rmh^�M��=�Ǭ�/AB8�K���v!J"H͏[H��x��
]�M��b�U�iy�vwD����F'�����w*ѱR����{�Qjd%�� �*mI
N/��F�Ϟk�nꛞ{' ~W�l���xy��0/�;����/VI|H���kgn����$Ѓ��9&(��n���y &QD��a[�������y�T`���9�d��
-endstream
-endobj
-1925 0 obj <<
-/Type /Page
-/Contents 1926 0 R
-/Resources 1924 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1938 0 R
-/Annots [ 1894 0 R 1895 0 R 1916 0 R 1917 0 R 1918 0 R 1919 0 R 1920 0 R 1921 0 R 1922 0 R 1937 0 R 1923 0 R ]
->> endobj
-1894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [188.068 696.939 268.086 707.843]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a08c3b1c1c4e916f10c85114ac888c040) >>
->> endobj
-1895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 670.919 291.13 681.823]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_af46aeb04c5a5a83a60ddf1a280c8b648) >>
->> endobj
-1916 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 608.306 243.549 618.836]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_afb7d3612f1ec7e7432a4168ea245f0f9) >>
->> endobj
-1917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 584.278 251.29 594.808]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) >>
->> endobj
-1918 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 557.883 300.554 568.787]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a5223af806da56cfe9a7c6ed71b4a0604) >>
->> endobj
-1919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.062 534.229 308.295 544.759]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) >>
->> endobj
-1920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [227.82 257.788 335.356 268.692]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
->> endobj
-1921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 246.455 210.548 256.353]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a65283b563ec02a47928cc176c738f78b) >>
->> endobj
-1922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [458.893 86.288 513.996 97.192]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a8ac14db1f77aaa2e88fb7148633f7e) >>
->> endobj
-1937 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 74.333 155.753 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a8ac14db1f77aaa2e88fb7148633f7e) >>
->> endobj
-1923 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1927 0 obj <<
-/D [1925 0 R /XYZ 89 770.89 null]
->> endobj
-1928 0 obj <<
-/D [1925 0 R /XYZ 90 712.265 null]
->> endobj
-1929 0 obj <<
-/D [1925 0 R /XYZ 90 599.23 null]
->> endobj
-1930 0 obj <<
-/D [1925 0 R /XYZ 90 549.181 null]
->> endobj
-1931 0 obj <<
-/D [1925 0 R /XYZ 90 507.388 null]
->> endobj
-1932 0 obj <<
-/D [1925 0 R /XYZ 90 450.203 null]
->> endobj
-1911 0 obj <<
-/D [1925 0 R /XYZ 90 427.773 null]
->> endobj
-1933 0 obj <<
-/D [1925 0 R /XYZ 90 427.773 null]
->> endobj
-1912 0 obj <<
-/D [1925 0 R /XYZ 169.73 346.691 null]
->> endobj
-1934 0 obj <<
-/D [1925 0 R /XYZ 90 340.051 null]
->> endobj
-1913 0 obj <<
-/D [1925 0 R /XYZ 215.131 248.986 null]
->> endobj
-1935 0 obj <<
-/D [1925 0 R /XYZ 90 242.969 null]
->> endobj
-1914 0 obj <<
-/D [1925 0 R /XYZ 90 163.236 null]
->> endobj
-1936 0 obj <<
-/D [1925 0 R /XYZ 90 158.753 null]
->> endobj
-1915 0 obj <<
-/D [1925 0 R /XYZ 267.991 77.486 null]
->> endobj
-1924 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1951 0 obj <<
-/Length 3135      
-/Filter /FlateDecode
->>
-stream
-x��[[s�~���[��#
����!m�����Ǚ��I�C˴�F"
�����~
�P��l��>xH�b�X���Rf��[|u��ˋ�_Fl��zqy�H�"RIj<�,>.�X�|��B�8��K��o?|�������ˋ_/8�؂��� ����ǟ���_/X �x�`�JH\w���`N��n����H1�έ�
-c�p�挱eݤM�Y������e����P�2��'��O���/�c���-b3�d�)�E��I����B�@��S��ܭ8_>n��jj��\�3{$.��w�u�V�u�|\�p�'���H<�sh"|Fy��_I�<m
-�� �g~5JO�oG����)��X
�U2�
J���m��S*}g�QEA�+��ۉ)�
-��f��&B��Y�x�,�M^����
�	(k)e �X�1>	C��9u#(��l
B���=�?�����z��am��Z���ؾ�!kj��e���͗��7U�&�����7��^V�o��n�y�"o�t����¶����	�Y>ú)�(���M�:^n������׶��Pl�`<m�Z�q�u]�M�{��E���:��cS����h��;����b�����5�w�i�ڍ��m�ǽp�;�ӂv���<Ϭy��й�R��֜i��8�9
�Ę,a�vc�˼p;Q
��YU��Ė\ZK�F��}VA�}+1=4��6xtMM7�(��[7�>
�b=L9<�$}H| H�$f �	4
-��g�`��H��l0b�,����'&1|�"E���L(��
��ě�D8y���9,�8$O����ç���C��9&| �
��6ym������bI�ۄ�� �K����qoG�$��pb>0����I0.+4g;�g6����7�%��
0ψM���4�>N�5���XP'혹����S��(<J.�; ��eF�E�6�ug�
H+�zLL��);�﾿����M̭x+َ{c%��vfn�
5
lg
{�ѣ�
�p�*8�
=mwBo����� ��v�݆��� H�^n��
a
���&�/$��MF�QK�5��p�f �\�5���rR�<tT��.0�b� 
��rhzi�Rc+�QU�

�7S`��0�E��Y�eE��i]7-�3�dE�ϋ��!������|�7��.�����I
lZ(�� 3I�>�h��M<��k��&A=��=�+/�T��'L,B\c���
#;!Q�
���u%�
���h�g��.̠
-!�B��r���j"�J�p6���,v |����d�Cc�ҡl
>��@�X���l�lSO ,S�)�]K
���c΂Z��
�)��W6�S�AJ�-���e}r�);�*�]�&r���(����,��;׹GpnF�]�/LֲƑ�I��B�(
�kΊ�<�m��_=�ǽ���Ƶ9�,��:]���Ty��ߕp���q �'�!
-‚#��dx|OF
%��
b���ikq,,|�"�os��
-x�\Dpb�Y��Ƴ�mC�M�⦶=u	���v at j�t���7[;(�-�1������P}�����m�ݸ�̣��#S�7M�7�UY���f�
�?��
N�4�:�/���N()��9��������H��-�{Q�'�a��antv� l����Hw׮�<��ýaX�@>2~�:�
����Q�[��A��<�$��t%XTwf��H���	�S=���y�1�)va]��K�],�)�p\W���7�����ͪ\�k�OԾ�6�8�qG
/��W_����
|��/΀_Ig����٦�K�?`-�
��o�u7��	B������ z|ț����O���[��"�Dt�F��z����*#�b�
���@y�-e
�Oɍ��[���}�4��9�)>�H?��7&)~|T�Ӄ����v�ŏp�d��.�i�
%���;!g�

_����d�B΢
-1|�P�rD̢���W�l���f̠1|
��pC��w^��N|��s�����%�7}?p&��v�Ɉ��=�u�>"��á�^,l��X�i�<K
�0z�B�c�&B4IB�f'~��m�f"ᑴ�]�9gf	S���fz��$�t�*gJ[���-w7�_9әN-���\�=��wb�t7~K_�$3_^�e�;���w�'��
'��Aĺͣ����EH���\J���˵�"h*�l����=Ό+�2[=��3�gڜ���G�+w��

f�F
��/�lq/�����2�{p'���A-�/"��t���C`�
��4a ����>r� ׋dlm�P����S�a�׏�S��z2F�����`� C����Lqg�W���:,��_s��"%�l
-[�c�&��ܡ6
-�ͣm�w~��
�#�h=�D�P|�B1���!G˙<
�7�_�‘<�r��k��K��q�}��:}�5*�IxH8
Z��#N�;�>;!n|
G��*�;^nd�k�˩��^��ˑ���҈�ꈹ���)�
�N��M?�PƑ���T����V�@9ЧK
-�K4�2����,�2��(�% *���`
W���
�?UM{����4O�˶>�I�s���|�����|���g��ʧ�b�~Κ��b�<�g$���;�D�1��N����9E^�(MH�0�Oz���tˡ"�W�F�O�n�/�6�wӱ�����|��t�o">�<9�C'��P|��e�.
_�[��69�������/6���
.f�.�b�g�~�'#��rIZGf>bg�W )��/8��]w�
��/�
|��@ώx
W>H��M3`L`+��*[�z�5fF���a��
���
-��bR������
-D���w��
G���i���.
-��rF��
-p:1���*��!��9�h�%TT�q�rzSP�D��
-�|\��6��h�N���&�hs�M��ԣ�z ���U�}f���K�?�d��+�>>���'��"��􋰵g�����Xp3|�W(�x\����l�q
o�����%���֐��������D����J?.67_�OP���۴�;�wn�;J�
溦���*D�e��K�CK	)��W���C
L����̱
��_��~cӭ�XZtE�����۷ׇ�:+�
��
�9���0�+��?=�:���W��� �9Q�
-endstream
-endobj
-1950 0 obj <<
-/Type /Page
-/Contents 1951 0 R
-/Resources 1949 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1938 0 R
-/Annots [ 1942 0 R 1943 0 R 1944 0 R 1957 0 R 1945 0 R 1946 0 R 1959 0 R 1947 0 R 1962 0 R 1948 0 R ]
->> endobj
-1942 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.473 656.27 424.869 667.174]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a805ae2717e65749d104d71978ed97fa4) >>
->> endobj
-1943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [325.99 395.191 429.602 406.095]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
->> endobj
-1944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [476.138 383.236 513.996 394.14]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) >>
->> endobj
-1957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 372.128 150.772 381.801]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) >>
->> endobj
-1945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.511 273.576 363.123 284.48]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
->> endobj
-1946 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [470.161 261.621 513.996 272.525]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) >>
->> endobj
-1959 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [89.004 250.512 228.481 260.186]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) >>
->> endobj
-1947 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 132.868 201.372 145.266]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1962 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 119.363 201.372 131.358]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-1948 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1952 0 obj <<
-/D [1950 0 R /XYZ 89 770.89 null]
->> endobj
-1953 0 obj <<
-/D [1950 0 R /XYZ 90 721.073 null]
->> endobj
-1939 0 obj <<
-/D [1950 0 R /XYZ 484.685 647.468 null]
->> endobj
-1954 0 obj <<
-/D [1950 0 R /XYZ 90 640.828 null]
->> endobj
-1940 0 obj <<
-/D [1950 0 R /XYZ 376.044 549.763 null]
->> endobj
-1955 0 obj <<
-/D [1950 0 R /XYZ 90 543.746 null]
->> endobj
-1956 0 obj <<
-/D [1950 0 R /XYZ 90 474.549 null]
->> endobj
-1941 0 obj <<
-/D [1950 0 R /XYZ 155.355 374.434 null]
->> endobj
-1958 0 obj <<
-/D [1950 0 R /XYZ 90 368.641 null]
->> endobj
-1960 0 obj <<
-/D [1950 0 R /XYZ 90 234.622 null]
->> endobj
-1961 0 obj <<
-/D [1950 0 R /XYZ 90 156.624 null]
->> endobj
-1949 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F72 326 0 R /F60 304 0 R /F99 1084 0 R /F24 301 0 R /F82 428 0 R /F11 387 0 R /F8 437 0 R /F10 1172 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-1973 0 obj <<
-/Length 2050      
-/Filter /FlateDecode
->>
-stream
-x��YK��6�ϯ`�dU�@� sK�uj�I�8�ڃ���(H�Ç̇�ʯO�E�Y;v�=�eЄ��F��`p�
p���wwW��9r��4
�6A��䈥�^���D
�1������);�n�}�V�h�!ZF���(�uѫ������Rt�%_ʍl#���.$0���aGܽ������+Z�X-�YPTW�����_�y<�EU���2����+�4��2M��
3#�cf9�8	8�Q�ؓ����hr���y:���y��DZ�{�Sp�8K¯zU�f迲��N�z���p�
#J����jm�����hzӉp
-
-���^F�Z���T��^v�LW�P�p�z%
1t�	�
-�aݸ���SE�P���Qj����9J�>?A9c��,���JCm-8������J�DDq�N5��yPei��.�Z˽��~֎�1�]SI7�q2v~ ��h���
mY'n/�M�V^#U��,�\.�i����+�ǵ�F! ��`t���vl�o��:��j{Y�
Y�i���d b����u�h�M]��ܜ����_;1p*�`:�zw�zY}m�LsW%��tS�/���C|&'1��H������OS��ک��`���`�F�I� �v�[���N �+�iP	� fl-����T/;m�X
-���H��șNPC)��̴�[9�
-ۍ��;�NP
hv��b$x�͍7i���t�ke�kʵ�4��f1��d&'0�N�2",|��D�B8gB����q���N�
t&�.�S�2�1���R.$��e�
FEN
�)��V���N�
��Vj1�������~00�:&ݏ���h���s��dm�a�m������ZF�
'󝶅l;�3'1�v��\�"��G��|
�d
->�l���4q�T��,/�*Vq,^�¹���u0�cv����iʲ1�����R~3����(�3P�!�j�kJ�|ѫ���Ԗ05x9��[��4N����
-��qx[�Q�N4�7���r��6��&Y�0x�B����X�}��@R�
�Y�Q�1w|h0"BB{���)�(M��"�Mc6�o���Bk�eѧ'��m����c����Q�sdXM4�4T4* ����v����"�$
C*7\4Aq�|��E��vm���͏�^>l���ݸj�*d����P�P�ԐyUߍb�6������_Vodѣ��x�S ,�R��*�%���IV+�9��f�T�|
R��@ Zw�[�����9oOBئ �M�r^#��2�(M
(��M��	�
�&�i���^�����
]�����|SCn���f`+�N1
�v�sXXt��?d���Q���8��X�ƈ�FS��Ի������M�
׋##W�c��Ʀ{�0M��R�y��Foΰ`��~�� B�J���P��
Z5
�2�e�Dwo`s_4����ۗ�Z~'�1"��۴
���%x:^�Bo;*��J�zu�\�i;_�E�(zF[��Wȴb��T���y���hݪ�
-_���F���<ELg�Ou�	��
���{U��s��m�U5�v�(�g�����}�����'��#r�2��{B��'�t���
9/�������3�I�
���t8�e..�(�6d����[ ����  (�?�GO�K�V�/	�r;9f�rj��
Qȱ2�B_&���w��p�puI���c�%g�$A��'.e�̴�}?�C��|�	;��\s�Z�G�]
]�_�
2�19��Z����3��l}Z���b�F���{�|�S�U���3�
Uz�>�]Ѫ��.�ė�{!�s�z~��g��:k�,����Mk�=`��	��P��������i�
5r�Ƿ�d����T�9ǯ���Y�M�Я��y|� 
�1"�`�so�2��:�fԺ�h���8g Pr�9=}�O)�4~꣼�݂��
B��w!����c
\ -�b��afnE�
��-��{�n�K������+b,t���

���#3I�
�">�������S?^��'Y�m����7�׫a��z�
-{��c������̎OMU�J�\�d-��
ߛ�a�Ҕz���B�b�95+����ot�7U
<k�'���
ά�
-endstream
-endobj
-1972 0 obj <<
-/Type /Page
-/Contents 1973 0 R
-/Resources 1971 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1938 0 R
-/Annots [ 1963 0 R 1964 0 R 1965 0 R 1966 0 R 1967 0 R 1968 0 R 1969 0 R 1970 0 R ]
->> endobj
-1963 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 383.449 182.174 393.98]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a940d4cc630004e148b25a81010b12d61) >>
->> endobj
-1964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 355.397 184.485 366.301]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_ab8e3183f9373557491bf9d9cee30548d) >>
->> endobj
-1965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.383 327.719 263.817 338.623]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_aa348a444933ae006cd061eb2a01af5b7) >>
->> endobj
-1966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.555 300.04 236.709 310.944]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a52e000efba75d51e7891f8e9da8e4e1b) >>
->> endobj
-1967 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.555 272.362 183.578 283.266]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a054857677ca99c51342e420e9d5bad9f) >>
->> endobj
-1968 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 245.057 177.83 255.587]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a0861934c38d4b7e0432b6ba71a40df2d) >>
->> endobj
-1969 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 175.568 191.678 186.098]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a661ab4cd615864ae392638259f9c58da) >>
->> endobj
-1970 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1974 0 obj <<
-/D [1972 0 R /XYZ 89 770.89 null]
->> endobj
-761 0 obj <<
-/D [1972 0 R /XYZ 90 507.253 null]
->> endobj
-226 0 obj <<
-/D [1972 0 R /XYZ 90 500.316 null]
->> endobj
-1975 0 obj <<
-/D [1972 0 R /XYZ 90 401.961 null]
->> endobj
-1976 0 obj <<
-/D [1972 0 R /XYZ 90 401.961 null]
->> endobj
-1977 0 obj <<
-/D [1972 0 R /XYZ 90 372.549 null]
->> endobj
-1978 0 obj <<
-/D [1972 0 R /XYZ 90 317.192 null]
->> endobj
-1979 0 obj <<
-/D [1972 0 R /XYZ 90 261.835 null]
->> endobj
-1980 0 obj <<
-/D [1972 0 R /XYZ 90 194.08 null]
->> endobj
-1981 0 obj <<
-/D [1972 0 R /XYZ 90 194.08 null]
->> endobj
-1982 0 obj <<
-/D [1972 0 R /XYZ 90 147.206 null]
->> endobj
-1971 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-1992 0 obj <<
-/Length 1665      
-/Filter /FlateDecode
->>
-stream
-x��XKs�6��W�Vr&�� @"�6N:N��M�S��P$��H�����w�H����t�	�}ﷻ��&����_f��W	$���`�$�X".�i|E
}���H�.������|;{��M^�&�'^���
%i��M>|��
-�_1�w��.�)��"x?�c��(Q����	���`� B��� M	�8�V����)�i��P.��*��e�<�T�dfK�;���4F,�=��8%��,�EU*s
n�z��ځ�	�,R*<f
�d*[s�*N)A�ĆR"���U�oժ
�.�R�Y��6�^�:s��}$x�n"�z���ɳ�T Fb89�@�HD�DO �s���#��F��<a(���\�n���2E
��ǹƘ &*/�U��r�1��T�W���D7���Xjpp���N5��4�@�]����'~S�=�#J!��|
Bq
f��.����+���*���1c
��ԅ'�KG��[C�eG{x���H�g�I���}�
�����
ʕ��1-�J[
��r�ҔS���5�̶�NÝj��V	��./
-�{B
�.�}�̊B��޺�ݾU6+X�]�@�

�#���׆�R!ؖIx
$�����R1� ��#��	̟r'��LZw:�k#j���
-bqI�XI��:��U�\\
}��.��d��v�gfX-�kkRdC�წ�.��>��@/�r�8���r�0Dď*Ng��N�*���	��<�9F���c�$;�@
sD��
���.��w.��z���
Bi�?b�=�c%PJZ${'�D����W߀_
~Z��`�C�t��3��Dp�n�LO>HѤMQ|�Cq��n�%�
P�
ȑ��
-jQ.�(��t�Q�\f�7mrM�bπٷ㽷WY5����Gv#XM��O1��y�H����̻��բ���^�e��=�psU�:k�F��
쳮���J���LuôP�{�
-�b���}p~���O}�r���k�y�Ye��{L-�S�����#�z8} 8	ƈ��C
�P0�M��EG"@6B
����CN@[=�9�SXS���O���fD
-�+���G
-��/ťZ�{?�
�:��YX3
�
�Z�*��=,ߩu�@;�ʥzd���I�f���NsPz�(-���B�,�Uq8&fS+�y���W%4 y����X�٦�v�|61=���5��n�<�V�k��s�>iSBB
���B+&��G>C�I��4G�k���tW;Ȃ�
-�����oL=�i���l�����7���ȗ֛c��~T݁{[�"(�� U���=�u�7N�w���|1�I��y��r��y9<����8�뎳� ٞ�	G]S��g��@��a���?U���4ݎ�A�r����YƵ��#	�ۊo�sMNW�*�Q��O=,:Y��
���F8!�'�a�j����q�����:Ց+{U��� F E�a�b֭f���K�d����W$�_����7�A������]�AGZ�#z��0
-��>��
c�"�Q\�
r1�E�B�q� �2��-��鑠AU�-%�@gG��e��=vs��.^w�6;o�rs�6������^�?E����Yy�ѥs�}
ط�@�9 �q�^y�����j��Ĵ�]���6u�Ms���bq��U�AK���l8^N��ڂC�;���l�L̢�����p�
-endstream
-endobj
-1991 0 obj <<
-/Type /Page
-/Contents 1992 0 R
-/Resources 1990 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1938 0 R
-/Group 1986 0 R
-/Annots [ 1987 0 R 1988 0 R 1989 0 R ]
->> endobj
-1985 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1PIP__Decision__Node__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 2000 0 R
-/BBox [0 0 210 192]
-/Group 1986 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 2001 0 R>>
->>
-/Length 416
-/Filter /FlateDecode
->>
-stream
-x��T�j�0
��)�q�؎m>Ơ�ö����c��u�����n�ֱ���?I��|(� 9�M��j��
-��]ȵ��h������
?�„�75�j��"�{`$�`q
��@��^U�+��F��\rS�.�f,q6K�;���A,9�ؕq��UQ�=w���
�N��V�۴k5�ADJ�D֩�V��iS8�X
-���!Uu#��S�%��
�5�ࢀ-sࢢ8��e�f�D�&�Y���V�x�e��:5�%ar���0�M�Ha8/�;�C&;T�t닇l
���d���9,?��m��l�7��	'G��F�p����t2�_�^kd��H�E������)�P�\���1���95˂����CZ��0{bE��N
N��;�{���<��(g�jGҥ��=�z��AT��y�X=�o'$�
-endstream
-endobj
-2000 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-2001 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /WJGSON+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 2002 0 R]
-/ToUnicode 2003 0 R
->>
-endobj
-2002 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /WJGSON+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 2004 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 278 722 500 500 556 722 611]]
->>
-endobj
-2003 0 obj
-<<
-/Length 2005 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0��<�
�C&�4B��
���� �:E*�2����x�T�%�>�g��uzi�3,���I���
�r<O7'�z�&9�A.��_��MRon�y�1zJ���/΋[i����"Jߜb7�+�.-�ڛ�?<�Y(K�k_��Ȕ�Q^�u�m'>W˔hIN�g�Iv��rRe~�Ti�ꄍ���9l��ߝ
Dž?�e���:
-�Z*�)P�Ԡ#�H'�=��t���@%� 	�>��p��A� ���	�+PS�|P�)�CM�|E$�+�p��������}v��[x0a^ۤ��7e'����
�j�1
-endstream
-endobj
-2004 0 obj
-<<
-/Type /FontDescriptor
-/FontName /WJGSON+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 2006 0 R
->>
-endobj
-2005 0 obj
-319
-endobj
-2006 0 obj
-<<
-/Length 2007 0 R
-/Filter /FlateDecode
-/Length1 2064
->>
-stream
-x�UUYlSW�{
;�Mb�Y 8v
'Ά����9ds�į��8qb�B�I(���(�V�TU�(����S?�R��P�(� �~�s���'ݹ˛{f���{@  ʁBa��?
�<� ��4�;x`�
�r\�
 ]

�����9��	Ϝ<�~J%�Ľ)0�o��L� �(���~?@�yܟ�}�"L�R���߄6� � ] 	� �ʠ�4�
mT!l'C����UK�P�1S9M�DHЫ8�����1#K�ΐit��鰛���`���A��J������L4�\8:y�IxF?
]
��{�h
1s"��
1��U��*
gsi՜ńþ5ֵ���٘!�Uۜe$Q��U�n����:K���i���֗��6�ˊ�K�>w[�`}���^W#�ʦ��3-
~�޼!Y��#����̖�B�ۺ�
�R��� �FQ�>��9�hUF
u+�lzR���Te�k�
Z�[X��]%���`0��
F��̈́��
uQ��h��s3k�u�<���FU��xsM
ۅ�Ȱ���"|�2�+��/��
�<�Tkp�ʥ�S6[�GS��~hQu9-f�S���
��

ON�j��wK3M�}��3�$n�3���h��a�Fy^�P���yV�g�43�G��F8	K���o#NM�v<��IONU�l�o��>CK3�u
2}��&
-��D
 ��U^8�
-W�tUvy�ϗ�P���##�B�W��.fy*�}b����j`@�A�G\\"F
�Nj`#:%�I������͎���֏'k���L��m��k-��;zg	�X_�ʥ1�;�|� ����$HEOUF��#�^%A�WY}V����s��P�q����X�/�f��M�k!I‹pgWh��'����~v���.��q����/������Q�N�Q�zb��9�Z�i����o�p`���HI�}��^�!YOv��>�aG��J�`�]� �+�z=��Չbm%�k���Y1^�����
��J��x��n��/4�W54T�SI��p�.������Pί��|�j�PhGqױ�j8�����XI;I>���ǯ����
]��n��<~⤈��y���^�c>1.3��n1:�#Wn��4�G�|\�gdrzO�(�r�����L���N��� �n"�	9�H�>�|�HX8Fs�@:�H�l�9ܮ*����n�>�&�J�9oS�����K���
	j]�ֺ�����Ҍ
-��]���e�
��?ўz�������؂ʾb[y�@����B�GF
-�X���F�n����%�#*:3,
k$�"��KWp��<���O[D��>֭AK��i)=�t�
km3"a�a�q�C
� e
;Y�E"(!aM.jȠH��bL�~
H�4������-JPa�[
:�6iS��+ޕT�7�K
2�������r�`�>�I�m
��C)y(� 
һ/�.K�.��=zz
�h.8q��%PCs#�qo�{PM^��x
)xV��vҋЉ� ���#CԽ���q(>��?�0���e
�!}�Gm���_��
���a^3q�~L/�K8����
����?\�FO�b��Ǩ���_>b��5��
-endstream
-endobj
-2007 0 obj
-1552
-endobj
-1986 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-1987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.351 186.869 206.184 197.399]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-1988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [206.682 186.869 252.948 197.399]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) >>
->> endobj
-1989 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-1993 0 obj <<
-/D [1991 0 R /XYZ 89 770.89 null]
->> endobj
-1994 0 obj <<
-/D [1991 0 R /XYZ 90 721.073 null]
->> endobj
-1983 0 obj <<
-/D [1991 0 R /XYZ 90 704.201 null]
->> endobj
-1995 0 obj <<
-/D [1991 0 R /XYZ 90 704.201 null]
->> endobj
-1984 0 obj <<
-/D [1991 0 R /XYZ 312.673 635.074 null]
->> endobj
-1996 0 obj <<
-/D [1991 0 R /XYZ 90 630.491 null]
->> endobj
-762 0 obj <<
-/D [1991 0 R /XYZ 90 526.263 null]
->> endobj
-230 0 obj <<
-/D [1991 0 R /XYZ 90 517.193 null]
->> endobj
-1997 0 obj <<
-/D [1991 0 R /XYZ 90 204.693 null]
->> endobj
-1998 0 obj <<
-/D [1991 0 R /XYZ 90 204.693 null]
->> endobj
-1999 0 obj <<
-/D [1991 0 R /XYZ 90 159.815 null]
->> endobj
-763 0 obj <<
-/D [1991 0 R /XYZ 90 72.703 null]
->> endobj
-1990 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F82 428 0 R /F90 507 0 R >>
-/XObject << /Im12 1985 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2040 0 obj <<
-/Length 1805      
-/Filter /FlateDecode
->>
-stream
-x��ZIw�6��W�V񥆱\�S��y��v{I��(
-�و��8Q}@�6i9�d�	�
��03[K
[/&O/&�'
��Ե.V�-�	w�in���
f���4
-�|���2
-Wɬ�ʵ��):}y��6��l%R��r<}���J��B��E
���?u���������Մ�@�"J �<ߊ����ؚC�+
#���Qj9����:��9�z-Q.��O��'!(����#!#+�-
�.ra8ٍ��.����40;qA2B{" �6!S���)���{��B�2ޛ^��>�k�����<�!\�zBH�p ��Mo�����x#ʖ6R8���w��G�ScQ1 �
�7E�S9ETF���$Vu/�Z��%�R5*�%4I�l�*���2��”0��Q��.E�Ԛ�c���M�n���k���ѴEh�
-��Q�==�i��Ҋ
X�鬕�'M�I�U=PF�!.P�h(�L
��R~���v��j?{1��q�jg�]��^˵�
�r��<I����S��\�%rS��A>��z�$��5R���$Zi
C�nl�O7��E7
E>q���u���Z{���(���|]�Ã�ՎQ��A��IrUṨ��)$߫=+cU�Pi�y%�e��S�P�q�B�%���7�����=c�ź
-�=>��E�O��Z�����q��nP}рiP�P5�YT'6��k�0��k�����n�.J!�P�
���JD�0譴m(m��ʛ���i�E6�ӥ�sU9[ L��
L
��eR
�L	�$0�~6BTyO
-QםIjm�򞾳�/�����/ 5�ǻ��|*M���.Z�6�A�{i	�k	��u��|�,֦��6y/���I�!�����<jm�
J�/aUD������U�R�cȅ(SS�n�
^�P�K�6ڤ�Rt�^���ݽ�gg/�l~�Ǻ���j@��fQ.� ��@��P�8�m�~K8pPܲFia�
q��
,��SIӇ�j�o+�8�Տ ��B��
Q1�����6m}{rÓQ��0㤊�pdp( ,�_�@Y�
�
r�,E
Β�֮y��je�
���E@�G�>UNӇ1eqwpyd�u��5#>`L�.��FX@���B��,��mkq`���
��+t���[�́�~�o��0��$���Ɨ���w)�6�C�9�䨾

-�����'�>����
Z[8NQg7]�����a�
�+Cɇ{P����6?ldw^��.�Uq���&-(�Å�R38/Ө���e�ΐ�9~fuT�m�H@s��:���H
q�
Vu�ku@�XL�����"��c�z����u^G�0i^��E��u-
p�Wɿ��$kj1vQb�q��V��ߴoW�֝6�=y��mg��ܨ<����G���l?�fy���5�^m&�4�J�D��T��Az	v�Tw�,�#$S�@�e��i�T֨}t��:���Q��H�a"3������ɶ�kI !ҵ<b��UV��
����1��ӳ�80́B��Q�ec?��ЏU��`?O*�<M���@uȐ
���U�E��
�	�f2#ݴ�[n.��+Q�/��\�P���dG&�m��!2�����@�ro�޺�9���j(&���{�`�d�gze�1��y����w�7�/p�Q������
t��c������޾��~�F^ER-�RY:�xe�&Z���s��d�=���'��ie�u�ZRJ/7��Z��mq�]��u~�L�$:ݒ���v&Ⲯ�_��g�"�%���n:{
��u�@�6T�
-r"�1���c0�.5��W�0��������+�_��z��N6_}�`9�
-endstream
-endobj
-2039 0 obj <<
-/Type /Page
-/Contents 2040 0 R
-/Resources 2038 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1938 0 R
-/Annots [ 2008 0 R 2009 0 R 2010 0 R 2011 0 R 2012 0 R 2013 0 R 2014 0 R 2015 0 R 2016 0 R 2017 0 R 2018 0 R 2019 0 R 2020 0 R 2021 0 R 2022 0 R 2023 0 R 2024 0 R 2025 0 R 2026 0 R 2027 0 R 2028 0 R 2029 0 R 2030 0 R 2031 0 R 2032 0 R 2037 0 R ]
->> endobj
-2008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 611.38 169.043 622.284]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ad7ae9489e4e3449bfedbafd36d929f55) >>
->> endobj
-2009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 583.755 169.043 594.659]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ae7dc52a107e3c90f03801ac327d35589) >>
->> endobj
-2010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [213.546 583.755 291.373 594.659]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2011 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [305.151 583.755 361.927 594.659]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-2012 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 556.129 169.043 567.033]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a77791a65ff33495b86466f4a672cd531) >>
->> endobj
-2013 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.859 556.129 227.991 567.033]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-2014 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 528.878 177.83 539.408]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ab75311edf7727278b2c6621e4cf08986) >>
->> endobj
-2015 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 465.27 264.491 476.174]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a4c79cc34280a10e3ca9d2a2fdb8f52fa) >>
->> endobj
-2016 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [292.672 451.915 343.567 461.821]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-2017 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 439.907 242.354 450.811]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ad67204128201f54bc7e543a16e67e951) >>
->> endobj
-2018 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 414.544 339.738 425.448]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ae2e189679413b6058b03b13fc1b8dcfd) >>
->> endobj
-2019 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 389.181 208.312 400.085]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-2020 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.81 389.181 328.111 400.085]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ac9e60b83b647eaf62c173ecf3539c536) >>
->> endobj
-2021 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 363.818 294.926 374.722]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a28b832ea15d4a33b33f51554b5f54a43) >>
->> endobj
-2022 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 338.455 265.597 349.359]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a6adb9a394696d907389f2fabc3d7f643) >>
->> endobj
-2023 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 313.092 195.042 323.996]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-2024 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.54 313.092 275.967 323.996]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a89335d3e61d877bf25e41e562bf2fb34) >>
->> endobj
-2025 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 287.729 229.362 298.633]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2026 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.861 287.729 275.021 298.633]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_aa86001c9fa5a81f40582bac023132a68) >>
->> endobj
-2027 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.384 262.366 226.314 273.27]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a84f5ab2a93289e1436a1ea7ef58fb460) >>
->> endobj
-2028 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.384 237.003 212.486 247.907]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a8959e3a2e2612143cb56991236663058) >>
->> endobj
-2029 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 211.64 268.376 222.544]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a01868d21a17d9549b711240123d5b81c) >>
->> endobj
-2030 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 186.277 282.603 197.181]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a373a253b31500ca4f15cf2b22e3b9eea) >>
->> endobj
-2031 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 161.287 201.946 171.818]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_aed3b733dc78567027867440a5774e70b) >>
->> endobj
-2032 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 89.357 192.89 99.887]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a5bc4c5bb38b21a01517358b417867797) >>
->> endobj
-2037 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2041 0 obj <<
-/D [2039 0 R /XYZ 89 770.89 null]
->> endobj
-234 0 obj <<
-/D [2039 0 R /XYZ 90 721.073 null]
->> endobj
-2042 0 obj <<
-/D [2039 0 R /XYZ 90 630.239 null]
->> endobj
-2043 0 obj <<
-/D [2039 0 R /XYZ 90 573.254 null]
->> endobj
-2044 0 obj <<
-/D [2039 0 R /XYZ 90 545.629 null]
->> endobj
-2045 0 obj <<
-/D [2039 0 R /XYZ 90 480.213 null]
->> endobj
-2046 0 obj <<
-/D [2039 0 R /XYZ 90 455.039 null]
->> endobj
-2047 0 obj <<
-/D [2039 0 R /XYZ 90 429.676 null]
->> endobj
-2048 0 obj <<
-/D [2039 0 R /XYZ 90 404.313 null]
->> endobj
-2049 0 obj <<
-/D [2039 0 R /XYZ 90 378.95 null]
->> endobj
-2050 0 obj <<
-/D [2039 0 R /XYZ 90 353.587 null]
->> endobj
-2051 0 obj <<
-/D [2039 0 R /XYZ 90 328.224 null]
->> endobj
-2052 0 obj <<
-/D [2039 0 R /XYZ 90 302.861 null]
->> endobj
-2053 0 obj <<
-/D [2039 0 R /XYZ 90 279.224 null]
->> endobj
-2054 0 obj <<
-/D [2039 0 R /XYZ 90 252.135 null]
->> endobj
-2055 0 obj <<
-/D [2039 0 R /XYZ 90 226.772 null]
->> endobj
-2056 0 obj <<
-/D [2039 0 R /XYZ 90 201.409 null]
->> endobj
-2057 0 obj <<
-/D [2039 0 R /XYZ 90 176.046 null]
->> endobj
-2038 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2081 0 obj <<
-/Length 1977      
-/Filter /FlateDecode
->>
-stream
-x��YIw�6��W�V굂 pONi�%M
'V{I��(
-��J�BPN�_� \E�r��bBX�}�`L��E��N~��LNjE$�oM/��Z�χ_
�����ӷ�㇄E>,R�/?�M_�M/p������	�!j1��#Ah%��_����%NZ�դ��r�+����	5�жH~[$��Ê�1˜�
�:�Zf}
{��Y\�#���#��b4�
�6�v�.�|��Xq?��8+^,fr'b�H�"�i��Y�-fb=��Y��
��*ϖ��M��]��q!�]��M\�k	�Xg��;9
�¥}/�9�]f�'a��K�X,$�����[S�nTA�� Fc���4������	�x�A&Pw�Gc'��҈n6j��~d�n�R������>s��m�����|%�z$�zS��gc��S�$�B-ҵHʼЪ���Qc�3�Z�
}TҔ�V�(E�à}�ٻ���1$JcP��]�rh��iw��CB�&�Y�*$ݪfm�
��2�Q�8^E
ź]zq�>�&���on�աֵ����/{b*n��
���y�
�����E)��<]��P��v�xX,A��5�U�^ͮ��aH����#�k3~����{l��^ VY�iV��8_
\���s�-箅ԟ$��t�ђ+0�=D���%�`$ݱ��w	���~��M���ō,��C��G�VtɃ.�E����!��{���2�
Y_�`�d�����f[��۪���W���)m)f�p��������
��?@�y��D�
fT*g��c��G���k/�D���� �:0]�eC�]�C��VмJ#+�
�`@�r��I�ըQU��.ʸ�ʞ��E�|���A��aS���_!����Y��*m:r<�bv�/��:��P*�����'Qn���dǠ/���:��'5֟��+�
�Ie)��7f����\	|���_9���'Cc_p|B#���;���>nEq�M �l���R����j��J&��:}��CrꇊJ���
��J���f�*
-W��y}��G0�E�^BƯ
�f���Z� ���éʀ�c�6����$?��93�?���%,p:/�7k�]+
���R3o5���l\F\V��2#�@��G���#^<�#�N�ߞ��0/;� |�'䝑�d%
��
`���C��g+�{(!~����~2B����74��\ɒ�")����
+P�n�n��ܩ���9>q�(*�P���_� !y��U
�W
-ɮ�r�xe0+FN`
�oU#���q�K^��?L�o���֫�)�aP�^+�=�Vyzȯ\��$Z��W���U��+!�"���
��
�-�&O{Qǟʊ�4�}o�R�U9Lo	S�u3�Mj���f��y��K�B��
(hڗ����Z�*��)��#֟MK$���E�UJ3�zQ[Lӡ��r{��ЭK�͸9B�I�mq�R
-t�.�g]��f����#ƞ�SQ�Y�ʼϻ[��	ix̙4��v�ۑ>�ʫ\��N�~7S�^ӑ	�3�Q5'.u+.�lİ�B�%
1�v�ŎM���v-t-�dU���[��r�2B[
13�<7A���1SW��g�^�q%�8�3BQ�_Z
-�K�
�m��,�m�m��1�
-���c�#f����+7+�NR�k;�ʘ���
G��4���^]k��y���"L�h48>��,;�Vu��g++`�J�B(
�g=�t�
��k�?���4
��ʭm]£z�%���!JO:���������B�xu�_ܼ6`5�Ժ�yC��̜�!u�u^����6:zia8�⛹����� �K��-}N�
�_��B7 ^����
BeA��`���5�c�f�X�rج�n
���
����$
-0�Ś;丑[
��>�����t�m�z��=��l������ťz�U��)��F�g���3��Q��hȊƃCJ�J%](d�Ur���w}�ߑȼs�4]'We�y6�̷K)�%I��`�8m�b�+�pFy4�\ǘ-�>��
Q�(
-endstream
-endobj
-2080 0 obj <<
-/Type /Page
-/Contents 2081 0 R
-/Resources 2079 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 1938 0 R
-/Annots [ 2033 0 R 2034 0 R 2035 0 R 2036 0 R 2061 0 R 2062 0 R 2063 0 R 2064 0 R 2065 0 R 2066 0 R 2067 0 R 2068 0 R 2069 0 R 2070 0 R 2071 0 R 2072 0 R 2073 0 R 2074 0 R 2088 0 R 2075 0 R 2076 0 R 2077 0 R 2078 0 R ]
->> endobj
-2033 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 707.957 316.306 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a777f48d40962e0a1f7ddcd691bde154d) >>
->> endobj
-2034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 673.205 322.941 684.109]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_aaacb839f41a9e7355e1e1e5cc9ad0894) >>
->> endobj
-2035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.757 673.205 383.533 684.109]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-2036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 647.537 293.621 658.441]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_adbae3f77deab71eb8d31dc8e551bdeed) >>
->> endobj
-2061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 622.243 232.192 632.773]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a925ebc675d3deed289aed0d97dafa81c) >>
->> endobj
-2062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.008 622.243 279.514 632.773]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-2063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 598.076 236.068 608.98]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a29bc2f9d0a2c4c96011fe36312a53e2d) >>
->> endobj
-2064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.883 598.076 317.71 608.98]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 536.522 239.036 547.052]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a5c952c2540fc4ea96e8aaa1109d6ea0c) >>
->> endobj
-2066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 512.729 236.008 523.26]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
->> endobj
-2067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.506 512.729 259.38 523.26]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ac41bfa66bbd6a2c52616ea5d4a6270a0) >>
->> endobj
-2068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 488.936 217.368 499.467]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-2069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.866 488.936 251.968 499.467]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a92ced4994293ff25212f86d55421a48a) >>
->> endobj
-2070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 462.895 217.368 473.799]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-2071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [217.866 462.895 300.127 473.799]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a7a934327db411e24b7c2a073983d2a3e) >>
->> endobj
-2072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 389.129 288.54 400.033]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
->> endobj
-2073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [288.441 389.129 436.524 400.033]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a42e9887cb1bd2e0914862d448881d047) >>
->> endobj
-2074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [439.742 389.129 513.996 400.033]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
->> endobj
-2088 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 377.547 201.079 388.078]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
->> endobj
-2075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 351.506 318.518 362.41]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ab3b703e4e468da3a5f49ad28905527e9) >>
->> endobj
-2076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [322.333 351.506 485.779 362.41]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
->> endobj
-2077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 284.356 191.678 294.886]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a9117ebcf4233e25be986d6b67ca78f1d) >>
->> endobj
-2078 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2082 0 obj <<
-/D [2080 0 R /XYZ 89 770.89 null]
->> endobj
-2083 0 obj <<
-/D [2080 0 R /XYZ 90 688.414 null]
->> endobj
-2084 0 obj <<
-/D [2080 0 R /XYZ 90 662.746 null]
->> endobj
-2085 0 obj <<
-/D [2080 0 R /XYZ 90 503.771 null]
->> endobj
-2086 0 obj <<
-/D [2080 0 R /XYZ 90 478.103 null]
->> endobj
-2087 0 obj <<
-/D [2080 0 R /XYZ 90 416.104 null]
->> endobj
-2089 0 obj <<
-/D [2080 0 R /XYZ 90 366.714 null]
->> endobj
-2090 0 obj <<
-/D [2080 0 R /XYZ 90 302.918 null]
->> endobj
-2091 0 obj <<
-/D [2080 0 R /XYZ 90 302.918 null]
->> endobj
-2092 0 obj <<
-/D [2080 0 R /XYZ 90 255.899 null]
->> endobj
-2079 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2102 0 obj <<
-/Length 3012      
-/Filter /FlateDecode
->>
-stream
-xڵ]�۸�}��Zy�E}枚Ks�뵳��OI&#۴�Yr$9{�__� %Q�ݤ���"AA|���c?_�x{��U
�(�8
�
�2
-�i�}�.��H��ZFQ���T}<�����w���l�����Q(n^�|��6��m�O��8�Ÿ����>h;���zI�a�o>����o�>_I`(
-$1���v��w�`�_�H���,�)Hb�:xs�ϫ��=�'g��� �RHI�zǙ]�M{�*��-��íF�g��xN6Y�:
Ә�T5�v�6���Q��@=�i"�<q�)�@_\K��=�ڦ�i6I~A�m�Q�4�6�x��
t����,�.a�8
�%}� R��u
-�ܞ�6U
�f�cn\�o�w0��k�2��t�ښ���K���#i�/�!��f�d��f�{e�Z�n�(���u|�nk�U�	�	dd��B%Y `��,��R*S�y5P
�M������Pg* ����W��a���U��a9Y^�o��+W�62
-���m���
L

�;� �8
�29�/����4��JQ��žuGk7H�ܱ�
[m�H�v�t���zg�m�93�O��{1���,N����]*����J�i#�/p�=
����>�
A���42ͮ�'�
U
]�����*Mh���'Cp\�tZ�V=���h4�4�R[�1��
-�w����\[A�N Ј��)i�wFOߟ�S�9^�����]E��w���
���6��6.���"'�!�����'���U

����cW�o͎�O��N��2�/O���k��
-4���ƒ�z,�pG3��U%&vΝ��b�~�~��N=5�)��̡1٢�\��
-��/1Fe at hK�-����y�f�O�/"��de��zL�/���"�L���8�;���{�Sj�fO�K3>�!�1$�̿��U���KK�
4����@��]�ń2�J荾����p}�D�1�
-���&�e���'��S
<!*V���3�&G�Q	�J��@wk��(����q���Q�'{ýi�<h�
�&�
-Dd
�`��
{it��VE)[7�G�Mk=&)�@��
V�5��d�}��Od�_��1y$mX$�H����N&��*D��9�e��H�{���
@]H���7
-�YhB^ٲ�

-���<)Cj�芡���)r��;
h,ҩ�Y�ĆY��2JTĮ!L�v�{���}�z�Z[�mg��
��q�ޤiد�`����1o�.zE���h��v�����AAZtw�&�
2�3S�̀��B�o:OsZ�4R��CU�k��R��\p��)�J!���>��o��V�4�L�J�5*i&YI�Q��@-���#��Za�=C��*;ǘ�����7<9�5�K�A�K�{��
���Q��$*�;����-�
-/4јU ��5jsc!����
s��PEg|v�)x�f�9��8�y�^q[o&�,c'wU©Ԙ�"pV�ؾ>m-�Ь׺Y�z���
��,}�B���#k���?��f،ԭ&��3XTY�̒q�ۮ3[�Kn��p�Li����j��e�2�QF�_�ƀT����K$r>놀\J%e��<&���ieh4�Z
�+!շ��|��0���a�']5��\9�9 4�;|�%9�w�s�
��%�j�
)�!ص`���m��q�W�6�M;`� ����O��v�s[a��e$����R	�("d�BD�8��
!>R�x,�$Ucy%]�
̮%��8Y��p�
-64���{�x���,%���EL�Vɂ#����_r� �ۀb(J���*�¹
B�}lZk�y-�C7]�?E��#l��5��s��һ�����
�j̔�W8����v��#�:v����
��X����O�1VB
���
�;��4
���&r4�
$Wi��<���5�xʗ��0O�!�X�O����KL��l޵Ә.b���X�b}���ӕs�
C�zD�%�0��"��/��\����%��.@�T��Z�$UA؈=;=�Z1�S��@��
ҹ�$�s[��g�w�-0cgמΗ���K rLݧ�
-��t�w���P���
a�0WQ��7�K����uu����to��#_5�f/=�n�)6�w��sLuc�WM���'=i� �r1uWV��#f�ߛ)�;���Վjo`
T����ԥ�_�������4~l-g.v�b!]]h�	D�/?YR��`�/���K�_����K���|om\
����jB�_&
�%�*�4����y�ԃB,ʢ
����[��bP
#�4W
[;2�א��Ǒ��a�8JD�.����uZ��'�&����0�"������w��vY�>=�C��,��
e	ɨ|��,��l0�º�aCzY�(eR�r��`c�
H�P����^)[��� ���1[}g��z[�"��1�TT�{�@R�{�g�8R�W%�������8���@�hИ.Ѡ���ӹ4�zw�����S6h+��6�t���q)$VV�d�K��`�jؼ4{ݹ��-�\�VJS���;SP��̳���ih�|X�)��b�W�������t������
D�yF{[脒a(3G[�r��-2�������M�����
�W�=� �{
���7�R���lbL�������_���Qı��L�2S��﷙Xy����R��U2F�QOQ��X�T�-�U����ϥ<.*�)��ȅ_�dP�Ĺ��[��c�]��p7G
e�}g����]����Q��9�M:=��~������
i� [...]
- up��_�������^5�<Q׸șj6)":b{��Fk����O�k���*�Ľ�r?��
��a8?�l{9��9
-���49�!�u��^��e�V� <U�����&��
��3
y$1�B�y���
x�����-��t���P_
-endstream
-endobj
-2101 0 obj <<
-/Type /Page
-/Contents 2102 0 R
-/Resources 2100 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2107 0 R
-/Annots [ 2098 0 R 2099 0 R ]
->> endobj
-2098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.07 311.919 328.202 322.822]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-2099 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2103 0 obj <<
-/D [2101 0 R /XYZ 89 770.89 null]
->> endobj
-2104 0 obj <<
-/D [2101 0 R /XYZ 90 286.389 null]
->> endobj
-2058 0 obj <<
-/D [2101 0 R /XYZ 90 264.013 null]
->> endobj
-2105 0 obj <<
-/D [2101 0 R /XYZ 90 264.013 null]
->> endobj
-2106 0 obj <<
-/D [2101 0 R /XYZ 90 163.887 null]
->> endobj
-2100 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F81 426 0 R /F99 1084 0 R /F72 326 0 R /F8 437 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2115 0 obj <<
-/Length 2785      
-/Filter /FlateDecode
->>
-stream
-xڽ[Ys�~���[��
-�D�i7;����f���e2�%ZfE�<$�Y��4
�HY�8)�� 	v7�>�n�8�D8��Տ�Wo~V8�HK*��H�Hq����u�)�����/�	"Z�G��_�����߮?�wWo���\x�#�H%�jw��3�����#����8ep�F��y��(�Qa���LHO�D#�y�C	N�����:����
��08
K$�:*����p=�ߚ&,����)v�.�&H
1 K�J�$�w=��9��,{"e�Kf�,7����r��r��+x��}Vl����e��"ޗ7����7�LsX{6��a��Wt8�qD��� ;\�7�5�,��}�_P-K*p�ߙQ�����S�$i�k��\�m�
���D�0oٺQ��b
X00�~�K���
�Uv̲����~$X��
�
-Pe�PA���B	�aX�(�M�D�Y��"�ǽ��.a����XK�(��%X��r�
zS"4">��ࣂQ�݊u( 1$XJ��.���u9b��Y�����b�~�ߖi�X&��B�}x�aD�&�Y��	š�B|(�!�o*�f�	�D�8�dР@�
�܄ı���R
o��ƹ��
%�E%��2��~%�f�i�!B�e������v#d�4o�Ī��4n�
-��ھ�^h�e��n���cV�	
f�Zy@��]���J���n�S84�M;�)/�y�}>潖̗3-ͼ`���1߂��9u���P�oݒ��]��ݪ��cV�2w��s�U;˕�� ɒ($��1L
!s��L��gn����S��,��ڽj��ؼ D�J�Lz��Ff���C7
-w_9�q��Au׻��(A\���)-���
Lt*-��
Y�Pfu��K�W��<.�&�=�@�`%��}/̼�5��f�(M���$�����W�#���Ч��#�9@�)s4����|��&�?��sB��<�D���P:��s�X2w�@��4�ڜ5��n����2w�,�z༰&4~	-)v���{Ve��M�	��_}�������n���[o�|ҭk6��=�F����7=�
�y���6
-��!���iv��Y�7��
���� -*D�v xd����p�/!�!*i8͍�ѡ�q�74.�


�#�`�Յ��l\�
-W�-M�y؃�)>`��ٴr4�<�
�00�t
���
R!
�b1@G��)�Nr�0kt
�
-�	���1d�I���Xs
-�
�[�;-Ff�3���`
-I^�05�t��ϹP��� !���0����H>v�$0W�
Eٙb\
L ��Ru���\�U����
.�ˡ'�C �~���T�s��bI�q�	���pN�9[1X�G#�<�a�X������.�a_�AibP��M@�p�F"h�L������[���cMM���ay��
wm����d�z_�0IMB
�B�#pp� rk��2�)��� X!^�`�ϩkr@'R��UY�{�WKf�hk�L�:�JE�j�B�TGJ�Ѝ��3�!��^.n�zj�L�D\(O��R���P�k�A��xtهi�L�\ۄ�jo�
�3�t�����?*�7A�d���}�I��&1�O��{����x�
e�;���
v)�q(�����*
�$�mҷ��n�{ls����
-m����~D|��C�
N�*�D���=i&�"|F��3<H(�
�qI�U�
��8V�n/��E��^_"��@�oLϴm�v��aġ>٢���kz�6�N��
-�����h��D�C�{��һڊ�~�h�kܲ� e"�a�Ю 2ҕ�����s�fg�]�i� ���9����P��T��W�C
Lu�=x
�{x�5�nݛ��=�����
�	��E�ͩ�ӼX�=#�m*������@��	x�W�{��L��@��u29��y��y��>;y,ڂb�>�R�ǜM��.����b�J��D�M�+isp�����Y��9��@�3|�f�$�"Q���u[�;�Ài�T
$t<A�Q�["#i�J��Y�{?�J�ͪ��
���A��S�
c�
s��
H0O�ۗAE�-�V	O�n�Y��"5��
�L�,�u��дX�H��>?�M���Q��p4^s,�]�C͹
�X��0�n���傩xcw=n�ֿs[2؞y����9�1������M
���FxlC�c��mE�����m��n��mQ��WQ���e
��U�9�ҟ�ώ�
%�k�m[��a�^z�ʓ���X���n�,m�$ �b�"�7�c[7qW���a��C%�V�i [...]
-���Y=�7�i��=1�،�GqV�DL)C��7z�q��4��ס�`:��q{���8�����V,�%�v=p��j�[9> `|��0��JԃU杁U����*�Q�e��4�*\Ɖ�-ֲw3�*J̵8V���^�^Ӟc{�nV�s	ͱM��$0E��S����)�l�� L�=���}�|��y�c�O{ ֑[�eG��;��b�;W�]�ixx�Ç�����{�>-6���w|gJ�w&����*+��"���kZ�G�
\pۣe�������,�
�
��H�����`�]�U���~�˛7���*+6h��
��c�����u��ݡAx�����J�����믮
-endstream
-endobj
-2114 0 obj <<
-/Type /Page
-/Contents 2115 0 R
-/Resources 2113 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2107 0 R
-/Annots [ 2108 0 R 2109 0 R 2110 0 R 2125 0 R 2111 0 R 2128 0 R 2112 0 R ]
->> endobj
-2108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 693.377 201.372 707.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-2109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [304.891 693.377 432.413 707.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a4c79cc34280a10e3ca9d2a2fdb8f52fa) >>
->> endobj
-2110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 225.157 201.372 237.555]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 211.652 201.372 223.647]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 113.141 201.372 125.539]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 99.636 201.372 111.631]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2112 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2116 0 obj <<
-/D [2114 0 R /XYZ 89 770.89 null]
->> endobj
-2117 0 obj <<
-/D [2114 0 R /XYZ 90 718.682 null]
->> endobj
-2059 0 obj <<
-/D [2114 0 R /XYZ 90 684.012 null]
->> endobj
-2118 0 obj <<
-/D [2114 0 R /XYZ 90 679.529 null]
->> endobj
-2119 0 obj <<
-/D [2114 0 R /XYZ 90 581.535 null]
->> endobj
-2060 0 obj <<
-/D [2114 0 R /XYZ 90 559.158 null]
->> endobj
-2120 0 obj <<
-/D [2114 0 R /XYZ 90 559.158 null]
->> endobj
-2093 0 obj <<
-/D [2114 0 R /XYZ 227.842 501.986 null]
->> endobj
-2121 0 obj <<
-/D [2114 0 R /XYZ 90 495.346 null]
->> endobj
-2122 0 obj <<
-/D [2114 0 R /XYZ 90 414.817 null]
->> endobj
-2094 0 obj <<
-/D [2114 0 R /XYZ 184.963 314.304 null]
->> endobj
-2123 0 obj <<
-/D [2114 0 R /XYZ 90 307.664 null]
->> endobj
-2124 0 obj <<
-/D [2114 0 R /XYZ 90 248.913 null]
->> endobj
-2095 0 obj <<
-/D [2114 0 R /XYZ 90 202.288 null]
->> endobj
-2126 0 obj <<
-/D [2114 0 R /XYZ 90 197.804 null]
->> endobj
-2127 0 obj <<
-/D [2114 0 R /XYZ 90 136.897 null]
->> endobj
-2096 0 obj <<
-/D [2114 0 R /XYZ 90 81.969 null]
->> endobj
-2129 0 obj <<
-/D [2114 0 R /XYZ 90 77.486 null]
->> endobj
-2113 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F8 437 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2138 0 obj <<
-/Length 1643      
-/Filter /FlateDecode
->>
-stream
-x��X�r�6}�W�-�L ��S�KFi+��N�d4�
�l)R!)���wq!-Ȳ#�|h�ްgg�.�e�����f����'����%�ro2��(A��ݥ��'EQ0$c�V�t�*��+yY��<����6�G��x:���E.��òh�m>
�i�.e#���Cʰ\��ft&�R-��$�>O�o�������� Z���!{����7�]���U��ލ�h�E4�k�>��v7&[����6D!b��"m�k����EY�2-̍�}|�Ĉ�)5g���PR��I��>2J	�$r�A�B|�
�9|�c�G���u���0�o�����1��
!�	�b������ �+h? E�8 j D�c�
�
_1��0!T����f��	�L�!�zN�
,̤�Wr�gm2a�@�gͭyZ�դ��t��!�� +z���Dc� 
QB�o��͍-߇�, ��>J"�g�YWE�N�y�S�C�!���X��.�
E��͍�iqi�/r��UseDQPV��
���X�������
RnR��'�$pW�rlz�ax�
�zxޤ��.��@@����!]
Q�x������l� �)�
-��b/a	�bF��A�D�e~?e��!1�g�����-u�_���ff�ߖB��&[f�����i�D@����C���?��J�hV,�,2W���+klfh6>E0Jޫ|�pr��|����T'��)
���C�������`�"��0�(��Q��w�)Q�f����d�~�����
UF	+�D	c���@���e���R��.inW���MV���(Q�kjҚ�,g�,`m��h^V-�VgyZ��n���B�JiUw^��-�e��e�MG/�\�t8��sHqEHV�+����ːalu����4�ؿV҇��Ę�e� ? M�W�
	a\7iQ���~DH���=!��@8�#z�Ř�צA_�AM��OaLC���KN)��{A��B��E���N11�{b��`� �!��&B����� 

j��~@�nӳ�>to��a"�ͱo�YP��
X�ӂ�i����F�J��o�$?����&���t���/�̨�V�Vm �=�0�0��\k
-e3������
���F>T|����E<!ȑY�ja����O���Û��������o;-�Y���e
�=
$:���-��������0�7�@�m�[�s]���=Gk��T�ƣϧ�����w0�rp�]��ߨ����	�>ڌ�	±����X�?�M�应e�d=������[��^����=�Z���U���9�a�����xr��l�:ND���q5��Iu��m
w�?������qžu� m
w �U�{�n���~u����;�?Q����b�zV�uv�[�0�
-v�--��x��?=��O�[��ʲ�[���R2^ۺX��0+l!T/d�Lm���pu�H�}��5� v
8
3�p�=���x��
�n��~�.-�ta?
�j�k��>�T��E {oK��i�n���,ŜgTuW���d��9�-���z��s�p���갗�[���Y�<8�X/jY,Ь\�ϊ���@�wǎ
ߗee��
-x�L��
-~z�	��6x��@zL��/6��e��}p0Z��Q	k���*$	�
-endstream
-endobj
-2137 0 obj <<
-/Type /Page
-/Contents 2138 0 R
-/Resources 2136 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2107 0 R
-/Annots [ 2130 0 R 2131 0 R 2132 0 R 2135 0 R ]
->> endobj
-2130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 348.344 216.625 358.272]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_a1676341382601ab9c96f035983f372d5) >>
->> endobj
-2131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 320.412 230.463 330.34]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_ab5cadae2d9d1e506769cafc7dd19c5b5) >>
->> endobj
-2132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 92.105 248.734 102.033]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_ac2b60fec8498b08d7f22b2264d3948d4) >>
->> endobj
-2135 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2139 0 obj <<
-/D [2137 0 R /XYZ 89 770.89 null]
->> endobj
-2097 0 obj <<
-/D [2137 0 R /XYZ 90 632.878 null]
->> endobj
-2140 0 obj <<
-/D [2137 0 R /XYZ 90 628.394 null]
->> endobj
-764 0 obj <<
-/D [2137 0 R /XYZ 90 453.889 null]
->> endobj
-238 0 obj <<
-/D [2137 0 R /XYZ 90 447.266 null]
->> endobj
-2141 0 obj <<
-/D [2137 0 R /XYZ 90 366.38 null]
->> endobj
-2142 0 obj <<
-/D [2137 0 R /XYZ 90 366.38 null]
->> endobj
-2143 0 obj <<
-/D [2137 0 R /XYZ 90 336.714 null]
->> endobj
-2144 0 obj <<
-/D [2137 0 R /XYZ 90 291.181 null]
->> endobj
-765 0 obj <<
-/D [2137 0 R /XYZ 90 197.65 null]
->> endobj
-242 0 obj <<
-/D [2137 0 R /XYZ 90 191.027 null]
->> endobj
-2145 0 obj <<
-/D [2137 0 R /XYZ 90 110.141 null]
->> endobj
-2146 0 obj <<
-/D [2137 0 R /XYZ 90 110.141 null]
->> endobj
-2136 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-2157 0 obj <<
-/Length 1234      
-/Filter /FlateDecode
->>
-stream
-x��X[w�6~�W�m��$���MH[B(8��${8p�
�K���
]
�4iH�dKB��o��Ƃ�%"��%h�����w����	r-������{�������&9{z5
z�`"�Z����Ea� ������,i�|'h�_�����Ȳg�&�_[D�Bv]rv]�����!�RL�r�1[�n��vc|�B7
����u��I0���?�g�ި7	�v7�'�
C
x�X�ưc1�a�kVYVp��l��
�ngj�f��+5\��y�s1��P��J�s��E����
����ԞP���`�^
��C�X<
��
�X������b���xC��[�
��]���o�p����&~��[BX.��3�,���Րr���2��;סB+�%�&��h�~d<��e�������r�!� P/��F����?�$��)��j�dq�Ԑaf
o�C:Lw�30u@�<KK	%���P؜�2�b>����b�G�2�җ�A =y�Q�����l��4��#
I�����S
MZ�Y�)U�+�u��IS�FF�Y��
��MC�*ҶyZ%:	��歀���y��%a��q&y����c���
�J�;&Ŏ�?S��2
MG*�驊y:�E�C�~3(�;�g(�@a�\��?���d�kG,{��ʹ��
�&�a���#����{������M�m��u�9ʐ�C�x�6֐X��q������Z�Q�3xg�ݴGw9(N�k?��Ƣ��}��8^8&6�^�$ٳ;�z'�����w
L"Rj5
� Q�B�����0��x��Y��:��gU9˒���b�)u��u���>mdw��{�
�
	�g�#M�Uv�`p�,��N
X	�}J���Ƕ
�������zx��N�_��
t|����:
\�V#����Ui�X�
-E�諰{�a8�0�����6E���
s�k�u-�
�P��h�,۱��2�a�n
�ojG�B��������Y0�c���s� fs��}�E�/�8R1��5�߶��w�l����X������-a�"�0��M���� ۗ]���^�X���.�=z⤟��,�ö�u|")�����] ��yφE�6�T��h�^��Y�
�tY�K��~
-�
�C3=u]���;-L�aZ՗�[b-��Q�'0O��C�^�U���&�_ğ&�?c��#��\>9���O����@��](
��{7:�d��#Ja2�Z|��7{9C
-endstream
-endobj
-2156 0 obj <<
-/Type /Page
-/Contents 2157 0 R
-/Resources 2155 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2107 0 R
-/Annots [ 2133 0 R 2134 0 R 2147 0 R 2148 0 R 2149 0 R 2150 0 R 2151 0 R 2154 0 R ]
->> endobj
-2133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 708.933 264.226 718.861]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a7d97a0adb78a51c7089586f7ee4cb6bd) >>
->> endobj
-2134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 668.908 240.973 678.836]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abc9126a51dec07227e4919899e44589b) >>
->> endobj
-2147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 628.883 262.572 638.81]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a46e366594cc5fa0e10c75a1b6c17df09) >>
->> endobj
-2148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 588.857 306.836 598.785]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abd8921ad9d2cc32e7ee32de63704c1c8) >>
->> endobj
-2149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.841 370.733 245.973 380.661]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-2150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 293.433 248.196 303.361]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status_a89f381f0a22cc6f22b445a4c1691db77) >>
->> endobj
-2151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.841 199.505 245.973 209.433]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
->> endobj
-2154 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2158 0 obj <<
-/D [2156 0 R /XYZ 89 770.89 null]
->> endobj
-2159 0 obj <<
-/D [2156 0 R /XYZ 90 721.073 null]
->> endobj
-2160 0 obj <<
-/D [2156 0 R /XYZ 90 691.256 null]
->> endobj
-2161 0 obj <<
-/D [2156 0 R /XYZ 90 651.231 null]
->> endobj
-2162 0 obj <<
-/D [2156 0 R /XYZ 90 611.206 null]
->> endobj
-2163 0 obj <<
-/D [2156 0 R /XYZ 90 539.975 null]
->> endobj
-766 0 obj <<
-/D [2156 0 R /XYZ 90 431.63 null]
->> endobj
-246 0 obj <<
-/D [2156 0 R /XYZ 90 417.449 null]
->> endobj
-2164 0 obj <<
-/D [2156 0 R /XYZ 90 317.516 null]
->> endobj
-2165 0 obj <<
-/D [2156 0 R /XYZ 90 317.516 null]
->> endobj
-2166 0 obj <<
-/D [2156 0 R /XYZ 90 244.551 null]
->> endobj
-767 0 obj <<
-/D [2156 0 R /XYZ 90 136.206 null]
->> endobj
-250 0 obj <<
-/D [2156 0 R /XYZ 90 122.025 null]
->> endobj
-2155 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-2175 0 obj <<
-/Length 1543      
-/Filter /FlateDecode
->>
-stream
-xڵXKs�6��W�V�  �Wnm�I�u�\���� �-E9e7���ߒ�Ө'A$����[�h���������B�S
-֑‘�b
����1�(�ɜ`���l�ۇ]��^�L~[w&7��ct���v��,6	��ַ��V:�S��_�|�����~B���$�RĂ$_�f��o3f�x32Zng���h��E�JFOn�6�h
-�e�q��
��1"B!
���^��Ν֦U�oL���;���r�~ܕ���U�
�1a�
�XDq$�ΐ ��m��[�����͗����-I��;@�aƈ2;�?o�/��f��n�=�
ݓq��?ׇ�D�e�?P��;m����ZZ���pGn'
e���C�9�k��
��>�q8��H(��b
fX
f�ܸ��`�����
������1'>��̷�6����n����b'~�
�� ��B���]��}�7�
-9�%I#	^����NGD2���{�F�S����u��;���cpD��88�=߭G?z����=W�!
zV�9Tp0�3����D�T�fN�އ���*K��9F�����/�G֧1�NBޛ�HE�<e)����"�XG`�@a/u��^��~��KS<��(�2�(�P�)���
[��u�q�U
�Km�~"
�d}(4 at 9���ny���'���5�����lV>�����MYs2��t��&��L�������)��JE��0?G�)�Z����0L��%�|	
{N�
$���)I��F����e�֑#60�=�^��	)5���[G6V� ���*E,cÍ�
 <F
O�ȘD��
�q��C#\�i�0�-ُ
�N A3�e�
R�S�h<$M�G-��u�i���M2,��˃I�q�\)��puԦ��
-1� �+�'*CW
���ױ
XA�ٕBy�dR!�S 'ўU!�sp�:R!��H2�pt�a��G'���
\�<����
{*�2��*�7��uЉ�.ieÃف���l�dn��
�tY�;�������
8�!�A�%4���,���j���ӷ�%�u ǡ� %�y=��T���W�J�@6���ܪ0ۦ5;�:�~�
�3����$_����"VN��
#-͑�bh�b��!Uݓ;]T?�v�nG��y�K~���glَ�KF�]�hgH$��F
]
԰1t\�Fˮ�}Jdz��ѕ6yݐ���#�]��rgO�='K娑l{�d	U�{�IS���m
��qJk�Ӥ�]�ݠ�V<;��OK6a�-�.3U��T����3�@c@	uK�<�F1�<H�
lOaLS6��Y��2���1�����Ј��z�#;�
a|�S)S#�k
�*�k
��u
�q�8��
Q~�9d��l�?�P��]�
��W��x�Q�@�?\�X��������~N�����
�M����2�vl��/���槄�8�Ç�:�e�����A�
-�̡�?���
���u�o3'�:뉄(j
�辮^\]�
6{]m�hhrV��B��n�TKw۝	8�
-
n
%�&���	�6�
�Z�؜��Z��ĵ��V�_���_
-endstream
-endobj
-2174 0 obj <<
-/Type /Page
-/Contents 2175 0 R
-/Resources 2173 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2107 0 R
-/Group 2153 0 R
-/Annots [ 2167 0 R 2168 0 R 2169 0 R 2172 0 R ]
->> endobj
-2152 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1PIP__Solution__Node__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 2183 0 R
-/BBox [0 0 210 192]
-/Group 2153 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 2184 0 R>>
->>
-/Length 414
-/Filter /FlateDecode
->>
-stream
-x��TMk�0
��W�ĕb;�a�P���;�
�~���
��'%v����
GH%YOO�͇2
���D��&د���<�
����
?��ϗB�����3@��T�p�d
� 3n��x��«*��B�m��-7���n���z�

�c�0cW���VE
c��]��
�Xhwj���Bަ]��
"R2$�N���d�X��ɹ��RД�O�(
��9�2/��s�
�L��B�̉��r ݜ8�4k'��q�4����u�����x��ə>� 7Q��7�:L_��t
Rz��S*��?�:l>寮m�7l(6���&GY�G���~�8��%�5�����"�	��(��J$m�H���D�/=ˆ����CZ�ѰzE���
N��;�{���<��(w�jGҥ��=���/�AV��9~�
�7B
-endstream
-endobj
-2183 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-2184 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /BOBEUM+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 2185 0 R]
-/ToUnicode 2186 0 R
->>
-endobj
-2185 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /BOBEUM+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 2187 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 278 667 556 278 556 722 611]]
->>
-endobj
-2186 0 obj
-<<
-/Length 2188 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0��~�=��L i$�T��Qi �%E*�2����x�T�%�>�g��:��ϵJ�ݤ^��v<O7��:�FȌ�H��֊ě�u^x�M?����Ë��V�=��ADɛ��s��ץ�Ts���G6
���Hs�˽���
��`����ò��o��j���GR��ٶ�]k�,�ԏ��ޏJ����,����w��r闧�)�e��t���rhT*z�Z�H�
Q�
:C{��ԁr�E�ųp��A=΂
2
��'��8����ḋ�ḋ���H�W��R��m׻��{���9߶�`B��N
��o�Nvs���j�5
-endstream
-endobj
-2187 0 obj
-<<
-/Type /FontDescriptor
-/FontName /BOBEUM+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 2189 0 R
->>
-endobj
-2188 0 obj
-321
-endobj
-2189 0 obj
-<<
-/Length 2190 0 R
-/Filter /FlateDecode
-/Length1 2084
->>
-stream
-x�UUYPSg>���-b�6CH�!7
�IBXC ��a���P+֢�*:S;u*��/�v�t�P:�ЩSڗN����hG+�q��}��MϽ�w�?��=�Y�sν@  j��i0����; ��P�>4R�����P&

��q��
ϏQf
�@�)��<��B������M�����A �4� ?	NO��H"�
} �]� �L+�ke� ���d��LW�h3��b�B3@
-� j��1f�R!�����b��1۬��S
:<
�����:]~�/�A{��3�ا��h�������2U��� �y�2c�+Ѫ!�#VKM���T�A�+N��m�D*P�
�[����$��X ����%�d�K^���+3T�WT�|����*������U at w&�
�ڐ�����,�5��Xbb�m.엤IJ�� �80�-�K�R��TkcV������S��;ڲ�}F%{+�i�d��;Z�bM�#*�6��C�'�m	�,��~��i�*i�^�-�s7�ɨ����^_�1�أ��:cDZN Rj�Թz���
�1/�LX�
JT]+�!ͦި
I��9:>1s$���6�w�ӌ��o�͓�yO�H�78��"�Bz���c��\
 ϽS�
��@2��+��3��99ѽ\П��!�d�l��5K%���-n�:�G�l�8�hK��K\�:V�\]Am�ϧw��v�Ș��w�"��)��d��\��3sU@�^�RcvFJ��юZ%�r	�uJ�#$��7���=~�H�d� [...]
-��&gd���m�5ߎ���[��J�?l�}��ι��?�#�7�.�����y�‡�Ճd}%�VTS��0_�֬������ɞ�>R>��/Թ�u
T�7��H��]�.��҅��Y���3&�%B����2�P�e;�#�R�J��3�d�B*��
-��"����6}��W�;}�
	��=-]6����Tc�>G���\O�ݕ���Ogҟ
|��X��e/4m-S
�e�.�ޢ��V�rl��8��=�_�?�zQ���x�rϭ�V���*̎6_����A���������/�-K?�L������*+�ce�l�<#=5?�����{)S.lH(2�3��ga}������V���u�uT�vc�m�����N�1.�.�o�z�"�I|gr�b��Ύ���d��}��_P?�c�
����c�Z%y�����V�S�v�
'� ™"�n!� ���<S�bH!���C9������B�41�dH	~A�8Ai �Β�m%���$��rZ:�7��o�"xș��޶_����"���DX��T���E��ؿZ!z�&�x��k�b��*$
�8���
!�w�EV@�g���eNN��`�=��nB��R^�'h��
��c���	v>���{�y���%F���g�
5#.�����uE8�"���� [...]
-endstream
-endobj
-2190 0 obj
-1575
-endobj
-2153 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-2167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.351 436.739 217.601 447.643]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.099 436.739 292.877 447.643]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node_ab532119425bcb15a8c6063d19f071c3c) >>
->> endobj
-2169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [296.693 436.739 331.881 447.643]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2172 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2176 0 obj <<
-/D [2174 0 R /XYZ 89 770.89 null]
->> endobj
-2177 0 obj <<
-/D [2174 0 R /XYZ 90 455.733 null]
->> endobj
-2178 0 obj <<
-/D [2174 0 R /XYZ 90 408.544 null]
->> endobj
-2179 0 obj <<
-/D [2174 0 R /XYZ 90 353.734 null]
->> endobj
-2180 0 obj <<
-/D [2174 0 R /XYZ 90 329.301 null]
->> endobj
-2181 0 obj <<
-/D [2174 0 R /XYZ 90 329.301 null]
->> endobj
-2182 0 obj <<
-/D [2174 0 R /XYZ 90 241.13 null]
->> endobj
-803 0 obj <<
-/D [2174 0 R /XYZ 90 134.794 null]
->> endobj
-254 0 obj <<
-/D [2174 0 R /XYZ 90 121.651 null]
->> endobj
-2173 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F90 507 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im13 2152 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2211 0 obj <<
-/Length 1419      
-/Filter /FlateDecode
->>
-stream
-x��XYo�8~����J@͐���}�6M����ާ�0h�q��p)�A��/�Rb7[���`��ȹ���
����f��|rr�b/Gy&���˱��9�	�[{W~��^�d��	
ҫ�>~���0��o�����	�O�#�<Ei����g�a���(�3�No*�8�`,���	�%�B"��<�n�-�V<���k�6����M-�d�d�ۺ�~�ג-
-��L~�����<��/9_|����V��0
A1�	SDh��(A9U�}�`��i��
�s��
�
'�%���ީ�QH�T
o�S�k�c�����q✠$��u.�e���X�����%�f~�U�V�U�#���Q�M�%��}
�tpֻ�R����"��- ��v�RAn�.��^�2��.:%�6�H��X�h쩱��5�~�fY�e�Y+����y9�}�m'�0�X{k
���UJX=7����~G�`��4r��ފ��2�P�G��
�Av���jm&�
5H)�D��@��S�(M��������D�\�SO�et
˞��
�R�c�$�|�������Լ�u]pV
G���_e	 #;-Q� 0++�l���	���n�=yNj�� ٗ|�����@�|*Z36`���7�
sTDk	�r[�W-�a�֪ ��7&���Z�}#֞2�

-WuKb�n� ����[���Q�/�xゾ��G�8�4X� �~mT(�F0���7]1���|���6j�FT{	vr[7�9�S=V?�RE
���SթkhQ�,�l�Ba%X����7�h������Z��-lKZ2�ڑ�aF��Z���"H���8 Z��$�<��/�T_\j���z1�_;�j����T&p�>�fvB U�.TYǾ1�����w�d�j��M������Ơl��
���ɦW�|n�5ٱ(�t�N�0k��Q�l���_W���p�sc�����Ѐ�@�u����A���5��56S�A}B�ѝ#�\Cw�J$
����~��
!���0SW4�6yj�h������A0�v�[&
-G�7+)��z��g�(�
W���{�g|��o�)E}��$�I{�,;�0�ݨI�ɒ5v�*X��Ʀ8lS�أJ�!	Q���,�v�W�n�
dp�	�o%՚��V�K(�����)��d]���]G�g��*nk��Ne��F��ʕLL�5��
�����u��<�`
A��{ �lT���B��rw�5�����bH����'�=�W��U:#
u�ǯ=�;z�k��A�Ni���L�4�O)�����Ƚ��o&@o�#�ޒ�Rp��2
-c��ƕ
��wfra-�e3�;Vm:����7�?��A�*����Z�=�:�*e��]KH�N㶨�q�Q�K��[�2T��ҡK��m�}~r��6�����Ijw8M����3���W5U:����3��5
-endstream
-endobj
-2210 0 obj <<
-/Type /Page
-/Contents 2211 0 R
-/Resources 2209 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2107 0 R
-/Group 2171 0 R
-/Annots [ 2191 0 R 2192 0 R 2193 0 R 2194 0 R 2195 0 R 2196 0 R 2197 0 R 2198 0 R 2199 0 R 2200 0 R 2201 0 R 2202 0 R 2203 0 R 2204 0 R 2205 0 R 2206 0 R 2208 0 R ]
->> endobj
-2170 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1PIP__Tree__Node__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 2222 0 R
-/BBox [0 0 376 170]
-/Group 2171 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 2223 0 R>>
->>
-/Length 545
-/Filter /FlateDecode
->>
-stream
-x��UMk
1
��W��#Y����B(zh;�C�a�ͦ����п_iƞ���
²#Y���}o�_
G ��`(^��|1�yy��5�÷���V
�
•|��
�E�Bx���>{��d�	>���2h�/���ʡ8}�4��d�%d���ɞb�,��
-a5�bK))�)�,|��0>��퀃���5�o�*�ZW���ʬ��|-�ľ��s
\�Hi)�r{
~��@�m��IE�iA��z3^g1��I�k��q3�p[cKX��!�
MT�x����>�Ґ�>
\�v��]\�;
-t:�P�0�1�4x�+~"t�;�QG
�ҫ�,	�.��,Hy�_�
��C�L�L����hG��oh��P2r�7z�y1�	��1�d
!�r�Q^Kyb�8�(�E*��
dM�K�;���#Tpg����2s����'���
�)�u~I1�I�'U��H\��,�����"�)�\�G~��fѷ���Nm}|#�-�̅�W�ɉhi'��E�Q�Mi�vT��#i7��	,�u;i'/��ʰ�8E��<oO�V��3���
-endstream
-endobj
-2222 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-2223 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /TLUPGG+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 2224 0 R]
-/ToUnicode 2225 0 R
->>
-endobj
-2224 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /TLUPGG+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 2226 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 278 611 722 722 500 500 556 667 556 278]]
->>
-endobj
-2225 0 obj
-<<
-/Length 2227 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��n�0��<�
�C&	!U�CT� {I���
9��5
+�j	�ϳcy�_�Z
�v�
/�ZY����L
_
��� �@�/��D�37��X�~�ʒ�O'΋]i�����""�߭b;�+�/
���1?<�^(������ּ�#S���Z9}Xֽ��U|��)�,p%9)�M+ٶ��Q��UQٻUE��?=�a�zyk�/�<I���z:
-�Z
-ʠ)P�)�AGh�
-��p�t�v��
ԁ2�������A=�
"��'�/Ǚ�2��eA
� �+�|��|y�B>d�Wd���;o�ئ��ey��5؏�����A�c��d6��~@�H
-endstream
-endobj
-2226 0 obj
-<<
-/Type /FontDescriptor
-/FontName /TLUPGG+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 2228 0 R
->>
-endobj
-2227 0 obj
-331
-endobj
-2228 0 obj
-<<
-/Length 2229 0 R
-/Filter /FlateDecode
-/Length1 2368
->>
-stream
-x�UV[P���st�&
ɺE�f�GB .�~]07#�� $����� ca$���Ā�:��SOc�8v��L3
?$��Ƀ����t��t���6�;Nc�;3n��W���s.{����wvW E�
����"���)<8���Nd���g?�
��R�xj�?��~���x�M��m*(��\�Ξ^��dk(����S 7P�ʙljy�\�<@�>���� ��[ Ax��f�լ6'�B�'�›tk��
@=o�F�h(�`P�:/���r�R��X�Z=��z�6o�=�>���T�O{�ў@<�g��p�͋+�G���s���"Ğ�=j@�zphD@��w�t�j�c���U��"��m�,�"���I���/�$5�TR�����xrx���R��LGe�~[gk[�,L�vx��/��O����=
�7ت���R�Ln2�m�&�𻁆�B�h�6��G���$:5��v�e �x<
�����t��*�k�%x���/�1c;�lҳۢ�Oo�–�;�h=�
������D�-
���P��<�s���vWt%?�=�
�N ә=�g��U���cm�
�~)�Pu�Yl*��ɻ�������j�/�
�
ӊ����)�g��
K-0,���4��q�(��i�6�%U�
-^ž���	�!���'k�jSuپ�Fשb{=�'$7TƨRHC�'�bip}�
��劼�[�
�Ŭ�֡���9SQ�otK���.�#�c�c��U
U V�ހ
�x%F
�^ff#:%�*�p�f����c
��
\2���F��?d�
�� ��`���J��G
|����g9T��j�#�{܈oPK��Ǭ>�
{O���l��j 
b�3���
�^Zy}��
�Ǐ�Ɠ9��A��vk����q��b1|��GT���\��c,C=��4��I�鸧k-v`.�|.=�
�+۳1$�_G��]��X/��Z#�B���]�Տ��a��q�C[��մrƫ6��2��9�[�;A�2g����P�w�J&���t+���r@Ğ�y�I�l&���H:��"�I�Ҭ#Si��}�^:|u�W�u�)u�O�t}N��8NVD����p�I���Q����*�g��*9WW �AF�����z�����b�&��n~|��˗������~���

-\3�v^s'��7֓�����@8��ŋ��+k'dz䘯=75qrur~c���Ļ�x��k5)��B�	"a2r���RM
-/������
�����L��d��h棑�3ӷ�7Z|M�*K�F��5p4
�;j+9�Fl{�`���?О�q���w�FP9���`Z%|Έ_8M�[ZY-�}'�V��'V���z�-d'j�c:
-�*%��YR��Ք
i�X�����˫��I


��|08Rn�:�EZ�$�q<�nj�7�8�����=?���{�k'{�t6W��|�:d5^wM!?rw�	�b�-2����
��Fۆ�1$6�n���U��,R��+��@�7X�it�x�����<�=�N8��0��U�w��Ǩ" \��H��
v�J�
-��Mq�W7H�}7J�O
�y�!�gMOԐC�����})���1�K�
����5V��u��
-($���{��s�
��e����������)�!�F�,î]�%_
�����Nm�ɾ�9�1�[������@�����6��\
_B�<-��
�8Lx���
���0��
�
�#
�E�
��up��G
�={�w	a�`' ���=R�2j��x������*��Q����8.���&R�=#�Ɓ�2��W~
Ķ�"#b�9�lPQ.�!�����[
-endstream
-endobj
-2229 0 obj
-1789
-endobj
-2171 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-2191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.351 464.17 222.054 474.7]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
->> endobj
-2192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [222.552 464.17 269.934 474.7]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a8ad7732b0e38be9e8c42a93bffdedbcb) >>
->> endobj
-2193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.351 433.476 223.698 444.006]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
->> endobj
-2194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.196 433.476 272.673 444.006]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a7c7056a9fa57d1dd08465dbb8a862b72) >>
->> endobj
-2195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.383 402.781 190.762 413.312]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_afe64e41fa2c3ef17fb78ea3ea4caa89e) >>
->> endobj
-2196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.555 360.754 248.325 371.658]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_af248bcc6fc4a4dff80fd47032a49b33c) >>
->> endobj
-2197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [308.673 344.734 368.113 354.639]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-2198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 318.105 240.255 329.008]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
->> endobj
-2199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [240.753 318.105 279.826 329.008]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_ac6acd7a5076267b606f39476b3b891e4) >>
->> endobj
-2200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.97 302.084 398.41 311.99]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-2201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.351 287.41 218.178 298.314]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.676 287.41 263.836 298.314]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93) >>
->> endobj
-2203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [343.095 271.39 402.534 281.295]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-2204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.2 256.716 201.302 267.62]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) >>
->> endobj
-2205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 99.214 197.257 109.401]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
->> endobj
-2206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 76.49 195.613 86.677]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
->> endobj
-2208 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2212 0 obj <<
-/D [2210 0 R /XYZ 89 770.89 null]
->> endobj
-2213 0 obj <<
-/D [2210 0 R /XYZ 90 484.19 null]
->> endobj
-2214 0 obj <<
-/D [2210 0 R /XYZ 90 484.19 null]
->> endobj
-2215 0 obj <<
-/D [2210 0 R /XYZ 90 451.761 null]
->> endobj
-2216 0 obj <<
-/D [2210 0 R /XYZ 90 421.067 null]
->> endobj
-2217 0 obj <<
-/D [2210 0 R /XYZ 90 379.413 null]
->> endobj
-2218 0 obj <<
-/D [2210 0 R /XYZ 90 348.719 null]
->> endobj
-2219 0 obj <<
-/D [2210 0 R /XYZ 90 275.375 null]
->> endobj
-2220 0 obj <<
-/D [2210 0 R /XYZ 90 200.727 null]
->> endobj
-2221 0 obj <<
-/D [2210 0 R /XYZ 90 200.727 null]
->> endobj
-2209 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im14 2170 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2254 0 obj <<
-/Length 2205      
-/Filter /FlateDecode
->>
-stream
-x��Z[���~ׯ�-pΪ�/�
���
'��ɬ=�d��A���A �Y�O�
		]<#'�MwWu�W_U5������F�ݼ�KP�)���^�=&(��y�|�Q�c�1�Wi�L'���<ȬN'E>��z죻�b��˶���<�O�V
�l��د�`L#�*Ҧ1��\�w���`
�D���޿
��~�uD at e��b�D�͖�O�b/��
F,��'�i酔���>�~
a�Z�h�n�Ů=&{k'�]z��]�{���zcJc�ͺ���^<��f�,�T7)u�B��B��G�J(a�G�&���D�p=�UU6m���'7M+�fDo%1C
d�z��Hy�x$<
G(f�5)J⤳�� ��\O�a*#�*B|�C�L�Z\E<#!"|O�Ag0��M�#@��݀Q�8aWQ"�c�W�^���
�,B��*��@"�[�?�
��p�:�4��q��qB��#=�޼����L
���d��K��47������
-�K���~�}MLC[WE����lFe�za����� �8��6�D�qW}P��jDh0۠�
#?/�|&��Ãil�۾~�#�e�
�X�iJ��WU�/�2-L�c@�O���Bڞi����Y�����\���1���ʏ���S�-��$�K�Uu-�U=:#V溯4�v���O�qm����e]���zd=��M�v[��]�r��d��u��̎���
�怅Ji��-F���?���p�X�Pi��3��
�
@
���`d�cF�xZ{�11�Nऱ��X\<�pq��X>J�S
�P��сpP�P=K���b��0��|
-��E}�
0�r�ub��zW�Fqf����� O*� ���Br���c
���x5 3�(���"3
!����C@"�e'.��[H���Z�W'Y?2Bz��O�ҍ꼮#���
ɟM���#���~���$���Aֹ
�P
��w���1�ޮ�0�î��z
-�)��P������^¦���|
�$�泬��jfn�3�Sfu\z2�vT��@՜�G�P����$�rO������‡R";���C��L'���39��*�8�6�z�ԋAo
j���[�!���u
@<�V`-F���TO�����_צzP�*
Q�Y�|Qƶc��d̐�oe�����:�����X��?\��(̄V|�U9^����Ծ��T��
i�7��7mM��\��:`�ٺ��R��Ⱥ @f� ���߰�A!��V5m2C���Y��u�o�EQAh>	�&��zA��T�Y�����ݎ_h
-���7�bZU�L���XHp���g���dV��f��9f��3�w
+����
�n^�z��N�0"�wNS���0$8q�
VM.���,6
�E(����_�D,�s�������΀(�QB�Y6r"i�}Y`�%�h���R���ru�`i�w�סĄ ̯�+H����spu 1
-yܯ)�#br۪R�>� ujr����C�\�5DT���k���ڹ�냊�
*�p���e��Ŗ�G�l
����xT�
'�@H�����jB����?��,�?8 Vi��m��暀��K A�K���4��?Ͳ�[�G�s1&{I��S�5'X�&P?�o��K$V��-
�#$���l��Ņ{JB���ァ��l�sY�N���J�"�P
��Xr���$�v�f��<�����L��f at h�wH]S�9?�3̖0+��L��
�{|�S��t�|��fIo�9w�g���P��~���\f-��]ƥ��w,;��Ы���\X��^A�auݴ?�RR
2ֶ�
����b�) X='\
:�>�?�8�]œ���^��
�'�	��;��`�!i	"a��`~�c+C�e{�@�۬XgRǢs����2z^�y��7�;
����\AY�h
'��6;�LU���Z��fkS�珲0������V�#7qu`���E�1������q\���P5v�H�VV
O����
-�foZ��Oa$��'}
L�Py��v
���hU
��2��>h����)�]�W�E P������iJ�(��>��ݽ37ow�v�wi�X�
��J���t.u������(��RߧeW�Mt�W�G@�p�{@މ��ҡҬ�ߞ���:)�;ړ8��w�mW?��L׋F�
43��w��`���º����ͼ�ƥ�X��gg��9u��
�$\�{���n�m��]2�u{���� Iлf
-endstream
-endobj
-2253 0 obj <<
-/Type /Page
-/Contents 2254 0 R
-/Resources 2252 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2269 0 R
-/Annots [ 2207 0 R 2231 0 R 2232 0 R 2233 0 R 2234 0 R 2235 0 R 2236 0 R 2237 0 R 2238 0 R 2239 0 R 2240 0 R 2241 0 R 2242 0 R 2243 0 R 2244 0 R 2245 0 R 2246 0 R 2247 0 R 2248 0 R 2267 0 R 2249 0 R 2251 0 R ]
->> endobj
-2207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [326.968 660.373 392.801 671.277]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
->> endobj
-2231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.683 519.765 207.239 530.669]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 409.824 231.425 420.728]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_adf86846ee255deb41ca850ac64c4b61c) >>
->> endobj
-2233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 370.456 189.224 381.36]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a711a61f2016a1a60c7cce6dceb2bb94b) >>
->> endobj
-2234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 344.039 273.029 354.943]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_af3095a51638dbd4f5f64ef0abae85829) >>
->> endobj
-2235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.844 344.039 414.746 354.943]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-2236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 315.63 272.779 326.534]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a4ba9255b9f22cd0731c631579a578efd) >>
->> endobj
-2237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [276.595 315.63 414.496 326.534]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-2238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 275.266 297.297 286.17]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.795 275.266 355.528 286.17]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a49b8e7f8a6b1ed7aaa6e91729323de7e) >>
->> endobj
-2240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 234.902 297.297 245.806]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.795 234.902 347.927 245.806]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a3ae906e1904f2ac295800c2da5ad0eb7) >>
->> endobj
-2242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 206.493 224.451 217.396]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_afc1ff8d6faebe04f1639123b5a35e1dd) >>
->> endobj
-2243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.267 206.493 287.823 217.396]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 178.083 228.327 188.987]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_ad8b71c1b523782a16d5ced5b3103bd8c) >>
->> endobj
-2245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.142 178.083 404.345 188.987]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.974 138.715 232.636 149.619]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a8adda024ba9ada688f17592347ffa4a9) >>
->> endobj
-2247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.669 138.715 408.872 149.619]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [430.341 138.715 513.996 149.619]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 126.76 218.952 137.664]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 98.351 238.817 109.255]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a20fc9fa06d5e6772b60c0d8c968716a5) >>
->> endobj
-2251 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2255 0 obj <<
-/D [2253 0 R /XYZ 89 770.89 null]
->> endobj
-2256 0 obj <<
-/D [2253 0 R /XYZ 90 721.073 null]
->> endobj
-2230 0 obj <<
-/D [2253 0 R /XYZ 90 703.073 null]
->> endobj
-2257 0 obj <<
-/D [2253 0 R /XYZ 90 703.073 null]
->> endobj
-804 0 obj <<
-/D [2253 0 R /XYZ 90 575.588 null]
->> endobj
-258 0 obj <<
-/D [2253 0 R /XYZ 90 565.855 null]
->> endobj
-2258 0 obj <<
-/D [2253 0 R /XYZ 90 459.508 null]
->> endobj
-2259 0 obj <<
-/D [2253 0 R /XYZ 90 426.898 null]
->> endobj
-2260 0 obj <<
-/D [2253 0 R /XYZ 90 360.56 null]
->> endobj
-2261 0 obj <<
-/D [2253 0 R /XYZ 90 332.151 null]
->> endobj
-2262 0 obj <<
-/D [2253 0 R /XYZ 90 303.741 null]
->> endobj
-2263 0 obj <<
-/D [2253 0 R /XYZ 90 263.377 null]
->> endobj
-2264 0 obj <<
-/D [2253 0 R /XYZ 90 223.013 null]
->> endobj
-2265 0 obj <<
-/D [2253 0 R /XYZ 90 194.604 null]
->> endobj
-2266 0 obj <<
-/D [2253 0 R /XYZ 90 155.236 null]
->> endobj
-2268 0 obj <<
-/D [2253 0 R /XYZ 90 114.871 null]
->> endobj
-2252 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2286 0 obj <<
-/Length 2072      
-/Filter /FlateDecode
->>
-stream
-x��YIs۸��W��Ȫ@���{<����SfJ��̄"������X��V챒Ô"��F/_w��Y;��������U��%!
����`'
-�B��'7
-�?o^;~#��pH�^�{{��ۛ�j��כ��g��C�y���Yn�>����_;�I���M'�>���dz��a+
-F��G�g��H0B!F����iVg��7�4v��[Qf�H���,D��VZ�iF05����%���7#c�R�<����Z��V�
P<�
-�*
Q|	�v�ң̽e%j3#W���[��
-� 2}����2�ߊ�
��r�Y,�
-iS����ͭ�f>
Fl�L*7<+*5`�fva��J͋:�Z�zeo���KV��
����+a6�v��s�f���7d+�Q|���Zȍ�K3Ŭ�A	��ة��&��Q�J��۷vfku�_�q辺4����˚����|u˷�����Z����,��-AJN�}i%�؈�6��>U+���
��b�Z��(�n)�����fM���t�U�wŲ��;-�YX��#n�`�B-j���XO1�JkY3h��K�0s<�ͱ[�Q��i��{!�V|c)W[�
)P�l�~�6饯D�����R�.8­L�Y^[M�v�H�����hw�w
�F=S��.�-'���[��,�˝�)o����,��t„

Ay��R��`~�!���<���WJe�;��Pݧ3~��V
h�b�K��ՠr��\�y	������. g�kY���
�a*A��F%+} 
Z�	%�7�Ɋ��l �my�mA�n�xk� xtϝ�
��"�%
��I�ujA�&
�W:�4+��?5i�6m���	C3�:|�	���� � v�٧�Xޤ(��6s
�H�#��H�"��
-!�k�p�}!
��=���<[��q�2A�\����2 8�Ci|
z
�SH���O���J��6��"�QH�I��\�`(��K�I�a�1q��T�&W�_�0�S z���A�U83&p
&D�+
��¹��h{0��Y�����hdY{ ��R��"六�l����3��.j
��
-�J2)�lY�d��
"�2�e��a��K"5X�Bi�mU��H#+�`�ͬXWG��eX�~l��Y���R6� Ε�
���
%�
d�_�o{}��̇�Ӥ2��۰�}���h�{ �
�>�����#n�#Gnܓ�� 
��V�D��2��@��)<S�
�?
�h
�F���8��<�(�s�4b��8�bL�Y�Q
�N�3PSWڄ I�zAL&��_�e��€�z� VСBX@�|
KU�Rd�McSrvU�s
�T�Xˏ7���B��ե�#��;�٦���5<��ln�Ɔ�����t?�:���n:�u
�u��Bn��O�EV
-�>���*SX�}��[��h�u�}�&�%�?Hݝ
-b�Ġ�0ЀB))1@�o3�]��U�66sn�CR
������*�=�q��(i��͎g�@�v

�

cJX�xT5��9��/e.xq<��
t]?�RY]>�VM�uh#����r'&�@}��ٔ�Fm�,rk�l5�Z���/uM�=��!!�P��.'�
��Sz~��W��;>9� X�O��;U9�,=�D�i{���9�~#�L�b��>T��I��ot��u����v�
�M!/��P�V��q+DP�@��ǁ�8#@�`�����a���]������W?xb
����#�6ݑ�
G�V�P�Y\��
-j4���Y� F�G�0F� ?�V�?FÐ`+Q�uYɝ~X6�mZ�뢞
-"�c�"��(j�7������Jc�(8��%(P����4�E
E�����=�moUϳ�~����z��^p�ek�v�xx�(N�]�O�!E��)�w*
��o�_�a0��c¯���3v��z�;��u�f at o�ԝ%�D��
AW8
����m�K��u�
�����
_ۍ�T�+�*ji��_��?���e�ox�������P�����-���
s�/�M��>����m���������n]�b��rs���H��nc��l7���0������7<��
-endstream
-endobj
-2285 0 obj <<
-/Type /Page
-/Contents 2286 0 R
-/Resources 2284 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2269 0 R
-/Annots [ 2250 0 R 2271 0 R 2272 0 R 2273 0 R 2274 0 R 2275 0 R 2276 0 R 2277 0 R 2278 0 R 2279 0 R 2280 0 R 2281 0 R 2283 0 R ]
->> endobj
-2250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.683 659.259 207.239 670.163]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.181 367.995 379.083 378.899]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-2272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 296.098 286.113 307.002]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_acd3100605be3e85bc68685085a2572ae) >>
->> endobj
-2273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [289.928 296.098 462.131 307.002]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [174.383 268.82 201.83 279.724]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) >>
->> endobj
-2275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [205.646 268.82 377.848 279.724]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
->> endobj
-2276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 241.916 179.355 252.446]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a26b1ddc4ece928d4301c1fca3d9c2db7) >>
->> endobj
-2277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 214.265 179.803 225.169]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a22326363cf04596cec471dbe66e03653) >>
->> endobj
-2278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [140.351 186.987 199.907 197.891]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [200.405 186.987 251.105 197.891]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a1b586c1f7e68ef2ad7a47bb83767a32f) >>
->> endobj
-2280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 160.083 177.83 170.614]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a96c42895c3599ed91e187ea39f94672c) >>
->> endobj
-2281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [160.356 91.175 191.678 101.706]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a12e689efd1655b4ec60adc26beb16a65) >>
->> endobj
-2283 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2287 0 obj <<
-/D [2285 0 R /XYZ 89 770.89 null]
->> endobj
-2288 0 obj <<
-/D [2285 0 R /XYZ 90 704.286 null]
->> endobj
-2289 0 obj <<
-/D [2285 0 R /XYZ 90 704.286 null]
->> endobj
-2290 0 obj <<
-/D [2285 0 R /XYZ 90 550.938 null]
->> endobj
-2270 0 obj <<
-/D [2285 0 R /XYZ 90 528.562 null]
->> endobj
-2291 0 obj <<
-/D [2285 0 R /XYZ 90 528.562 null]
->> endobj
-805 0 obj <<
-/D [2285 0 R /XYZ 90 420.515 null]
->> endobj
-262 0 obj <<
-/D [2285 0 R /XYZ 90 412.957 null]
->> endobj
-2292 0 obj <<
-/D [2285 0 R /XYZ 90 314.783 null]
->> endobj
-2293 0 obj <<
-/D [2285 0 R /XYZ 90 314.783 null]
->> endobj
-2294 0 obj <<
-/D [2285 0 R /XYZ 90 285.771 null]
->> endobj
-2295 0 obj <<
-/D [2285 0 R /XYZ 90 258.493 null]
->> endobj
-2296 0 obj <<
-/D [2285 0 R /XYZ 90 231.216 null]
->> endobj
-2297 0 obj <<
-/D [2285 0 R /XYZ 90 176.661 null]
->> endobj
-2298 0 obj <<
-/D [2285 0 R /XYZ 90 109.487 null]
->> endobj
-2299 0 obj <<
-/D [2285 0 R /XYZ 90 109.487 null]
->> endobj
-2284 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2318 0 obj <<
-/Length 1916      
-/Filter /FlateDecode
->>
-stream
-x��YIs�6��W�Vr&�p�[�����u��!�h(	��P��Ŏ�}�@J�dř(��b ���{4u�u^�~�]\	�H"#
9w
GRG�����[�Q2o�(��&)��dSdە���$K�eRn=A]r�q�“�e�OnU��i�{c
R�2K��,o�B�
�]��Pea$]z��^�~�}1�:̈;����{�����C�/c�A_Z;��7sތ�
Q�%<�%�X�b6Џ1��N=JZ_�:I35ay
�jV��
-ز����-F
P�Pn
���:�U��Eiv��
�Y�Rf1O�M>��ba~��Q.�an_�����M��u���M���}P%n.ak�3�D#�g��y@?$a�3��y��SU�\����h�b֬U^'��s���
��{�a)(����5P҆*��d���|�}IG�a�� ��F W$�S�Ɖ�eq���CFB�)BX�E�1暌9�]B,��p�����d�7�ݭ���>wm�

-�>� ����(�Kc��9
�
-0����(��"���#��,
-!���`А0Ώ)�
��6br at 2�E�%�/�u[���%K
�c�jҗg�B�D�/�YB�����. at d�gm)4e�

�7��㊝*�� ��b
<IcC�V�M�W�T[�+�#a7���tk�ߣ�|IX$�JR�������}"�jCNT����
,A���ķ��_
����|٧t\�?�@���/(�>��0�>��3؊H��Ƃ�O�x���
���!
�5�U�f�Y����U�XUk'�b�׳̕b�A����8d��r�yk�,�V�o�Ã��U{�~(YЀc�K�S��<]'[s��^@�{��d�<��������}]��@���2��
�6�|�cH��<T�ۣ�0GӖ�z���4S�q���y�*�l~L��@��&���b����k���;[���C��
�W��7�����)�}0���
����2���JY�s8���qg<
�}��~����`�PJ�zqL�R���&#s��j��d�a��dzb��)
�h���E�hK�%��Jg+��ا��s�¹"��"��N���{ahj (&�`�ݒāU�ӣ��� 1����,U���tQ�,�"ˌ�M"�I���S�E$�cR@�F�w���J�€J>� j���d��(>oA �!Apf2�1�i��m�3�}��d�8lS0;�+N�8���6��mjO�p�kZ"t�p�<
k�}������8�DXt
i"�� �Ksy
��|���T#�ӽA�@;H�IO��s����f���+{��T�J�Z�ٵBs��{ϡTu�@����ꦙ�Y:3:
��'5�6wP��=��1�o��Aʛ��"���6�L�0, �(
-�g�s���	��t3��(`�u϶�Paw]�Jc��}�5ѐ�~o�$���lZ�����v��d��
3Σ/?;�o1�
6���1�.�Z�m+M�J�G1����Cl�g�u�v�b�`Y����#�B�
9@�_@�P\`v��l�6o~hِ�
�/|�9��G_`����@��@i�
�QU�
-_�JljW��fd+�Y3�;�-�&�	���w5]�t�6�v�c
n�W���uZ-�
 ��2�D�������Po��5O���ȠJ:��U�� ��؟�3�<�Yc�0���$;8L�6u�����R��f�5��\�^�)�		�������q�ա?E�]�������w�u�������S�E��pgD��>o�� #�����O�x�?��?�|�$K{���BO�3{�t�_�Ye_'y�d^��ը�/#�~����3FϏN��c��J�g��;䶪���i��T�$3 ���{Y���t�'�uQ�02�õ�I�~��C������G�\��_�����z�;/
-���w��X��
-endstream
-endobj
-2317 0 obj <<
-/Type /Page
-/Contents 2318 0 R
-/Resources 2316 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2269 0 R
-/Annots [ 2282 0 R 2301 0 R 2302 0 R 2303 0 R 2304 0 R 2305 0 R 2306 0 R 2307 0 R 2308 0 R 2309 0 R 2310 0 R 2311 0 R 2312 0 R 2313 0 R 2314 0 R 2315 0 R ]
->> endobj
-2282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.181 682.931 379.083 693.835]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
->> endobj
-2301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.072 539.856 218.628 571.368]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 324.019 194.507 334.923]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_ae9b4bcc84019980d7be4ace75e54c0b3) >>
->> endobj
-2303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.942 293.114 179.274 304.018]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_adc93ada4ec022b8e6020c91412e0b0ef) >>
->> endobj
-2304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.09 293.114 263.687 304.018]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 216.237 218.029 227.141]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 216.237 250.965 227.141]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_a31e5a38eb5511d477ccd1b793fec470b) >>
->> endobj
-2307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 185.332 218.029 196.236]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 185.332 262.043 196.236]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_ab038d193cd145f2bc59b501db605e320) >>
->> endobj
-2309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 154.426 218.029 165.33]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 154.426 290.804 165.33]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_a44dd34b28b7e0ca0ea892e9259ea7103) >>
->> endobj
-2311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 123.521 218.029 134.425]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2312 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 123.521 266.456 134.425]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_a4358da8086e7af078f42a62c817895e3) >>
->> endobj
-2313 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 92.616 218.029 103.52]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2314 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.527 92.616 255.378 103.52]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_afc62e3c93daf5e744e4b3e450c7c7270) >>
->> endobj
-2315 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2319 0 obj <<
-/D [2317 0 R /XYZ 89 770.89 null]
->> endobj
-2320 0 obj <<
-/D [2317 0 R /XYZ 90 721.073 null]
->> endobj
-2321 0 obj <<
-/D [2317 0 R /XYZ 90 665.971 null]
->> endobj
-2300 0 obj <<
-/D [2317 0 R /XYZ 90 642.917 null]
->> endobj
-2322 0 obj <<
-/D [2317 0 R /XYZ 90 642.917 null]
->> endobj
-806 0 obj <<
-/D [2317 0 R /XYZ 90 438.568 null]
->> endobj
-266 0 obj <<
-/D [2317 0 R /XYZ 90 430.087 null]
->> endobj
-2323 0 obj <<
-/D [2317 0 R /XYZ 90 344.518 null]
->> endobj
-2324 0 obj <<
-/D [2317 0 R /XYZ 90 344.518 null]
->> endobj
-2325 0 obj <<
-/D [2317 0 R /XYZ 90 311.879 null]
->> endobj
-2326 0 obj <<
-/D [2317 0 R /XYZ 90 236.651 null]
->> endobj
-2327 0 obj <<
-/D [2317 0 R /XYZ 90 236.651 null]
->> endobj
-2328 0 obj <<
-/D [2317 0 R /XYZ 90 204.096 null]
->> endobj
-2329 0 obj <<
-/D [2317 0 R /XYZ 90 173.191 null]
->> endobj
-2330 0 obj <<
-/D [2317 0 R /XYZ 90 142.286 null]
->> endobj
-2331 0 obj <<
-/D [2317 0 R /XYZ 90 111.38 null]
->> endobj
-2316 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R /F90 507 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-
-2344 0 obj <<
-/Length 1205      
-/Filter /FlateDecode
->>
-stream
-x��XKw�F��+���`��fFʮ%qN�ĥ6]999L*$GBv�����ip_+�y��w�p�p��Ӹ7��8HQ*��� Ł�S��͂�P����2`"A$pɬ�����ޛq�k����ϑL��w�	3X�
0bi<�C� �
~���k;S0�\?�gXB�
#b- qx��c
�V�l��Yԧ4��zZ-��˲0z�
��*�T .��8�Sp��Ryf�Z?*�^2�s_�;5�����u��eQ��lY���
h"	{M��
̳�=.W��Z�b]�2�4�T�VʹSRת�]wV�_���Y9m��;��e��9��cD��e�
-Uek�tϫr��ɼ��2�<|\
��c��W��D��%A�AU��ȏ����>�Z�e��څ	}�"���'�7:�h
-J/���{mP��m=RW��Y�ʞB�paB�%C��S a�'���Î
D�q Cˊ��� Y�	Mf�R�g�O�2�՟/'U�O�M$x�F����9"FD��!��Eך��8�4��3z
��nGIW��{Љ�����Z�#�JSu�+�)�b_�99�L9��X�w�d�c�y��	��/�֭j5Q�}�h�ծG�� �)J��dmҪ���uĐ���H���cha�m
�
���$`��Mr)`����ԙ74]���=�����i��B�f���Yި���>�z�T���mlR��ʼ����R�ǂs�����K��3D�_ո�^����,�M�*@ �` ��5�PW-CRh'{�(p����$h�2���% �tn�t��[a�J���OV����V���G
-�
-ŷ���x��9h���!қ�mH��X��fR��_"n?�f-ij	��J0 t�����l�YB�����W���!c`�
D�ᤋÙ��
������>�o��.������<�1�����kYX�ob����|G�)&o`Ox�=
�P��0x/w�h�?�Փ
-l�Sw��
����yzjJ���64�.~������\R��;c����/!_�1�����g��︅��
^� l+��j"�
-4���
-�J�`]H	���+�t4z,���7��
|�lO��oЧ~�
���CV4Y�
�
kU��� 3�P�g �F�Z����z����D;.���ݭ����I��U�@Sh*O�j{YJ�ߖ�ű*+�1
X\�F���?����
-endstream
-endobj
-2343 0 obj <<
-/Type /Page
-/Contents 2344 0 R
-/Resources 2342 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2269 0 R
-/Annots [ 2332 0 R 2333 0 R 2334 0 R 2335 0 R 2336 0 R 2337 0 R 2338 0 R 2341 0 R ]
->> endobj
-2332 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 470.504 194.497 481.408]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_a29127d8da5f0b833c4a89dbe3d41be27) >>
->> endobj
-2333 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.942 432.707 179.274 443.611]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_afe2f6db5c7f1a92104fe7efa0c301a45) >>
->> endobj
-2334 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [183.09 432.707 263.677 443.611]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
->> endobj
-2335 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 339.634 218.019 350.538]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
->> endobj
-2336 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 339.634 250.955 350.538]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_a40a81d6ee69dc679f08c5e89a101dfbb) >>
->> endobj
-2337 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [137.432 301.837 218.019 312.741]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
->> endobj
-2338 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [218.517 301.837 259.253 312.741]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_adebb1fbe14ec8f0b88fb538b86f0873b) >>
->> endobj
-2341 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2345 0 obj <<
-/D [2343 0 R /XYZ 89 770.89 null]
->> endobj
-2346 0 obj <<
-/D [2343 0 R /XYZ 90 721.073 null]
->> endobj
-807 0 obj <<
-/D [2343 0 R /XYZ 90 603.661 null]
->> endobj
-270 0 obj <<
-/D [2343 0 R /XYZ 90 590.872 null]
->> endobj
-2347 0 obj <<
-/D [2343 0 R /XYZ 90 494.449 null]
->> endobj
-2348 0 obj <<
-/D [2343 0 R /XYZ 90 494.449 null]
->> endobj
-2349 0 obj <<
-/D [2343 0 R /XYZ 90 454.918 null]
->> endobj
-2350 0 obj <<
-/D [2343 0 R /XYZ 90 363.494 null]
->> endobj
-2351 0 obj <<
-/D [2343 0 R /XYZ 90 363.494 null]
->> endobj
-2352 0 obj <<
-/D [2343 0 R /XYZ 90 324.048 null]
->> endobj
-2353 0 obj <<
-/D [2343 0 R /XYZ 90 257.552 null]
->> endobj
-808 0 obj <<
-/D [2343 0 R /XYZ 90 134.312 null]
->> endobj
-274 0 obj <<
-/D [2343 0 R /XYZ 90 121.523 null]
->> endobj
-2342 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2383 0 obj <<
-/Length 1410      
-/Filter /FlateDecode
->>
-stream
-x��YYs�6~ׯ�[ə
-@�G��\c�餉�;��$H┇
RN�_�ť��|��Q:y�� b��o��X��=��z18y�`/CYLc�b�e�K�
��ޥO0ba0$c�e�G˺X/�T�Q��%�� �>�P����u
)���7�~3���D�+�
�$I���l��bp=  �����$�&���
������(�R﫞Tz
�Zx�
�:qW
B!F��j!d�r-��i��䥹���
)3P�>��WZr�w�
-9}H�4�
�\�V��22�Sv��O��>89-	��Ԡ�VY�(SCuy�Y1t�
wvӸ�d�(�(50W� �| ��� ʱ�f�nUMڼ��;��ЈD�$�/@,�{l^
-o_�o�o��Mm������z���n�5[�v�됀�(b 
Aqde����-�.0�W������0�nV����U˹���^�f4K>�i^���;��)W�a��^�8�KA�8R�hq�L�$fF�O�]�-\��-�m=��#&�#��
���ɍZ'�
��I�®	ȥ�mycf�H#����BHC�2��>%	y	�Zs�1��#;hH&;�C�H;Lpj�q�&�l��g}F �pv�
�X�M�-7D�l׿X> �׼�n?���K& \ɀx�^}|a�]�s�%�P��/�Q|��%�!޴��U;��nZQvHp`�d��yVFEwyvc�sk#�RT
s�n��q.W��X���P�#�W��۵��pf) �(OS�`��>�R��ԏB��c�~�Wy��#��cuվ��Œ�z7�MWՔWm����}�
�"�t;�`Ƒ؎�5C��H��H��H�#�,|�#i�'���F(c{v��=���J��7C�������AB�4�]�ܣ�J^>�ɛޏ{��4z���aQ��!�*�}j�5��B��n���H�/�U큵�T�`��3!)��!tT���d+J����l�j'鲵�+K"p��
�E)"�=)�<�p�jg�l�K���Ά�ݨ�	�oqĖ
�� ��0`׀���4o&R�?�o�xS�
-鑘���A�<��X��i�3�
�_���IM
�M�
^&[Z��>�|�H( �b
EB3�BA
5r�����^nбY���3�ˇ5|�Cq�
�j
��ʦ�=XJ
\��B|.s>.z#����G�4>:Z�pٳ2az+6��.
�U�
1�B�=_!Di���['/D�g4�����j�^���>\��~[J�
:���f�"R�gS���=3�+�Q����	%P����M����q�v1�6O�y5_�x
-�.g��7��?!
-�A����jŋ�Y��H63A:��`�{>
�����MW�7�q�;ғ4�7DY������x5oD5G���͜��$Ax�*�>`Y�M
��%W-+��z�	�c����=LT�2ݽ��@w/�6���
;�
-endstream
-endobj
-2382 0 obj <<
-/Type /Page
-/Contents 2383 0 R
-/Resources 2381 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2269 0 R
-/Group 2340 0 R
-/Annots [ 2354 0 R 2355 0 R 2356 0 R 2357 0 R 2358 0 R 2359 0 R 2360 0 R 2361 0 R 2362 0 R 2363 0 R 2364 0 R 2365 0 R 2366 0 R 2367 0 R 2368 0 R 2369 0 R 2370 0 R 2371 0 R 2372 0 R 2373 0 R 2380 0 R ]
->> endobj
-2339 0 obj <<
-/Type /XObject
-/Subtype /Form
-/FormType 1
-/PTEX.FileName (./classparma__polyhedra__library_1_1Polyhedron__inherit__graph.pdf)
-/PTEX.PageNumber 1
-/PTEX.InfoDict 2398 0 R
-/BBox [0 0 210 192]
-/Group 2340 0 R
-/Resources <<
-/ExtGState <<
-/a0 <<
-/CA 1
-/ca 1
->>
->>/Font << /f-0-0 2399 0 R>>
->>
-/Length 385
-/Filter /FlateDecode
->>
-stream
-x��SMK1��W��tf�l�

-"<�

J�_"�`=����M�m+*
e��%��M�˼)� 9
&BE5�~����o`4Gؼ���
�>„Nj�� 5�R�-��q�����n�8��gUXc��ۈ5��\���Y"�
p�I� �U<��rYdܪ�c��� [��
|� �N��V�
-�ZM���!��TY+�$cd�)��L,	M	�TI������)�By:�P�"�(b�
��(R�	X�Y;QF��4쩶B��.�+�S�:�Q����Lؕ�n�f蝥�:�_`���q~i[c��k�vr(�t���aX�6���a��F���Di�#�<Qӵ?rO��

�&��8ܡ�	���k
5,��{Ey/?V$]j�\��_�[�0�ʓ:�՝�Go �
-endstream
-endobj
-2398 0 obj
-<<
-/Creator (cairo 1.10.2 \(http://cairographics.org\))
-/Producer (cairo 1.10.2 \(http://cairographics.org\))
->>
-endobj
-2399 0 obj
-<<
-/Type /Font
-/Subtype /Type0
-/BaseFont /TRNMIF+FreeSans
-/Encoding /Identity-H
-/DescendantFonts [ 2400 0 R]
-/ToUnicode 2401 0 R
->>
-endobj
-2400 0 obj
-<<
-/Type /Font
-/Subtype /CIDFontType2
-/BaseFont /TRNMIF+FreeSans
-/CIDSystemInfo <<
-/Registry (Adobe)
-/Ordering (Identity)
-/Supplement 0
->>
-/FontDescriptor 2402 0 R
-/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 556 722]]
->>
-endobj
-2401 0 obj
-<<
-/Length 2403 0 R
-/Filter /FlateDecode
->>
-stream
-x�]��j�0E���Y���G^
CI7^�A�~�,�RA-
YY��+�*����3W�/�skM��ݏ��@�X�yo^2�|56++RF���.�<��y
-<�V�Y]S��)��6Oj��!#���+��^i�u��9���@E�4�X��^�{S���VE݄ym��c��hI��''${a���E\
�:�&c����	�^�o�Syˋ�T4��D���V�����AGh+�@�SΠ3�G� 
@=h��է@k/��b�F/��,P	��|�]�c�{	f��{���}
<]uJz��X��7�ŕ�_���
-endstream
-endobj
-2402 0 obj
-<<
-/Type /FontDescriptor
-/FontName /TRNMIF+FreeSans
-/FontFamily (Free Sans)
-/Flags 4
-/FontBBox [ -1166 -469 1518 1050]
-/ItalicAngle 0
-/Ascent 1000
-/Descent -300
-/CapHeight 1050
-/StemV 80
-/StemH 80
-/FontFile2 2404 0 R
->>
-endobj
-2403 0 obj
-298
-endobj
-2404 0 obj
-<<
-/Length 2405 0 R
-/Filter /FlateDecode
-/Length1 1744
->>
-stream
-x�UU[pe>��IzIh���^PҴiz�\JiK���4�
-�@h�-I�4-�J
-��_
-��02>�<8��#<��R/�耀N�`
�n<�i ��/����9�wο
 r�
(X�$��0w�1�|jw�M
gS�x�����>v�� ��:g
��D@��+b����|�{ E�=�Ԟ(@�ʣ(�'����]ʡ�)�0�  
���`��F����J�&��Y��Z�C{�Ι6S%-�(0������:��T^�j�Z=gs:�f�s"v��X��=O(�����`�책��
�8u1��Lcp�Y��C
�� �!��l.
z5W���ޖ�j#��n6�+r46g+)`�z��jt�>/Ϥ�T��Hpg��LS�BKY�FskSs�<�9P<���$3��v	W�閼J���6���
s�erEI��l��
-_��DTjU}��@'Nn�i
�Dǚj�l��y�_�aQ��״o�p��vm�<Ӆ`��3FD�f-Nz���.��
����y����LT��X���u
�I��
-m>Ϯ�J�n:D=�X'���Y�p�f��X��C��:4]+�Y�4<�
Q�,
��^8��
-��:�i��[��\"�K��drGtJ�E����@�Y���@Y|�M��u�5
-
#��!��BNC�
ݩ��T\ʖ������q�Z=�X�S�´@�A�'r
}ip}�
�f�"':���p���0L&]�hH�A����U~�0+a�`�Ī�� �F�3pqD�~
z�Q��)����W�:4��F�o�X',3�[��|���oY"�\_����܃�3|� ��0�B(�LY�Crﰣ�`�OY��W
tN�vp<�8���N�y��΍�pz+)
N�HM
GR�׃�Oe�ȮKgr�
-������Z<���D�J��c�]5��������Mn�ݔ.�+a$��m'�
�`��\{��]��XW1����X�8�1V>��VQ�xY�M/�vs-���;I}bN^���:�Pf��
]N���B��bM4O�_���7mm�
-7��u�e
��Y2��$��[�yzS����� ˦b���⨱�������+��ԑ��C#�Qx����ȒQ�}%�蝷?
�np��d�d�U
DZ� ��
�L��l:�3��bSK
-h��"	�x^r��@.�!OJP�ۡ �C
,dN���eٮ–GT���������}B�|EV�b.d����~�!��O��6�W���~E�
�u��QC��ɸ��֥�\��K
���
��yD{����

K�~ �?K�;BD�X9r�7H�h	4��
�b�"U8�^vL�IY��0
-s��Jr��\��ѧq�
-endstream
-endobj
-2405 0 obj
-1334
-endobj
-2340 0 obj
-<<
-/Type /Group
-/S /Transparency
-/CS /DeviceRGB
->>endobj
-2354 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 415.454 242.354 426.358]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a812e3b442d41612ca88f8905d6cb49bd) >>
->> endobj
-2355 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 389.917 242.663 400.821]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a60ee53b704270f784fad7eab1a542bfd) >>
->> endobj
-2356 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 364.381 229.362 375.285]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2357 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.861 364.381 275.021 375.285]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a4211b10c19024d7056b4e36e4d2b7cff) >>
->> endobj
-2358 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 338.845 235.988 349.749]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-2359 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.486 338.845 288.271 349.749]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ae17f1279a841b6efc0efa6441878c025) >>
->> endobj
-2360 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 313.309 229.362 324.213]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2361 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.861 313.309 322.621 324.213]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) >>
->> endobj
-2362 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 287.773 235.988 298.677]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-2363 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.486 287.773 335.872 298.677]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a34c73f38bc99dbcb38cc7214e1e0e82d) >>
->> endobj
-2364 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 251.277 224.093 262.181]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e32932e6ecc) >>
->> endobj
-2365 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 226.115 232.541 236.645]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a513cc77545233d96c437ba7e1d001557) >>
->> endobj
-2366 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 200.579 233.497 211.109]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a2b74eef4fc5f2e35ba14f734f0e8e167) >>
->> endobj
-2367 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 175.042 230.169 185.573]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ac2e30d8774b244ed1bd206f76e786745) >>
->> endobj
-2368 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 149.133 282.204 160.037]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3527c6d35935d9860c07b31970d6dfc4) >>
->> endobj
-2369 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 123.596 278.727 134.5]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a7ce8a057ee2d4a20b8820da2bb6dc2af) >>
->> endobj
-2370 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 98.434 227.958 108.964]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1217cb151cbdbbcf4391987b9e2d232c) >>
->> endobj
-2371 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [231.774 98.434 266.961 108.964]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2372 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 74.333 269.164 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab6edbecd120074f2661ed2cd06ce1cd1) >>
->> endobj
-2373 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [272.979 74.333 350.229 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2380 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2384 0 obj <<
-/D [2382 0 R /XYZ 89 770.89 null]
->> endobj
-2385 0 obj <<
-/D [2382 0 R /XYZ 90 455.999 null]
->> endobj
-2386 0 obj <<
-/D [2382 0 R /XYZ 90 430.44 null]
->> endobj
-2387 0 obj <<
-/D [2382 0 R /XYZ 90 405.093 null]
->> endobj
-2388 0 obj <<
-/D [2382 0 R /XYZ 90 379.557 null]
->> endobj
-2389 0 obj <<
-/D [2382 0 R /XYZ 90 354.021 null]
->> endobj
-2390 0 obj <<
-/D [2382 0 R /XYZ 90 328.484 null]
->> endobj
-2391 0 obj <<
-/D [2382 0 R /XYZ 90 302.948 null]
->> endobj
-2392 0 obj <<
-/D [2382 0 R /XYZ 90 266.453 null]
->> endobj
-2393 0 obj <<
-/D [2382 0 R /XYZ 90 240.917 null]
->> endobj
-2394 0 obj <<
-/D [2382 0 R /XYZ 90 215.381 null]
->> endobj
-2395 0 obj <<
-/D [2382 0 R /XYZ 90 189.844 null]
->> endobj
-2396 0 obj <<
-/D [2382 0 R /XYZ 90 164.308 null]
->> endobj
-2397 0 obj <<
-/D [2382 0 R /XYZ 90 138.772 null]
->> endobj
-2381 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F81 426 0 R /F82 428 0 R /F90 507 0 R /F101 1162 0 R /F72 326 0 R >>
-/XObject << /Im15 2339 0 R /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2457 0 obj <<
-/Length 2077      
-/Filter /FlateDecode
->>
-stream
-x��[�r�6}�W��L�Bd�ә�M:M�ƍݧ���IHb+�
-/vԯ�)��DZ�'��i	�vϞ],(l�
l�2x~58{ɱ�"צ�q55\lp�E�
���!wF]�2�� ��0I}z�����_]��/���)�[�;�
���� >~e`�\ǸU�"ä
�.����������PÁ�٦\11���	A��
y'�"�3�����{=�aDX��<-D9hK$e�ۤNGcj��C/V�|uW�ɑCk��2�V���"�V3MG�5L"��:<�Zsܢ٥ȭ�6�6�Y�
���*۞��7}>�6E�ic��Cx9����,����x{y8���fD�����,����L❚X�9�L�$�\�E"��65ȁ��w��cᥓ`n�ea��rq0D����&ضE�I� 9��f�%�~ہ+��nd����Mv��ͺ��l:��Oa�+�B��bI���42��ٞ��dx��������8o���I|,A�����|5+�v�i;`p�\˪�<��}�R�ε��S�=�C9bˉ�:jV�����,d�V5��.A�gE�7>�E�)��;�v���L�7ÓQ�
O�P�'������tR𶊬�
'y)XD�|D�Z��|W�͐�H
H=vSOMR���.�)F��N6RY���H4������C_F�\�r�������{�� �\? ���`�B�֍�(�d�)�O�e����}*R?�|LXB'���
Fa�J>R��G��I>�c69�u�6��x��L�u�O%H����t�a�ӫ>�.�C at d����������?L��j���|zq��=��=���;l��{� �w�^ޱY'���%����ۯx��?$�"b�zy���jfO�R�r�c��C�T�5���2	!����\��Z�B,Qb���Y
-��-M��V�iU�aQ
������ ��v��
%�>�}���s���O��C�(}�C�=���7�.��jr�ēwb���sZ�GOn�|~��/(���
�R�2�!M�F,oc�4x�d��<Ya<�ڨ��qc�l3A��6��D�w�	[ȨAX��1��*�4×#8T����^
\F2�s" E^ ��	�1.
�" �dU+
�������h�nf�P�n_,A*��)� ���艔6��P����G"$a�N|U	�Ɂ]����Bۻ�Zr���G�Bɦ�
�����!�86��Ԉ���9�̣��:�Qst'ؚ�
qޅ����B-Ca�i�f� ���g����< (��S"�d*8��Z�����M�p�L�O
����HR�<�vJ_tds�
G@��뿅��O�}T�m��u�b���^6?O����::辕TWe�@�q�z�s8r׍�#�XH����:�Gp��
�d�E{�I$�$]M�xr��Ev4��P�
F�"T�Օ@-�
�ict�L��Ş<����܆{�Aر���'�����P�vO��_�/J�C]��~�
���b��Q�ɵ0��n;�7�Pdw{gk��
��(+�m�3��e&�\���z����1II6�]zZ�z���������7M�OT��^�������ᄲV�DЭ���c ]���9u����S`�|.������)
�Xܹf���7^zq��\�d��L^E5�v���۝0PL$Q ����r��Z��a$�v�E:"�tq��e���FD��z~Y��Fw1�{��|�i&|��t��څ�@�f%�cI�&�!Ӓ�qdB
���7JYtD_L���F��©:��ہ�'��v��q��l]p�4��U��h��l�l�s{U��ܲ͞R�Ջ��6wV,ri�
i#n>��s/4���?�`��L�M�[󮋘U��~�
,ƛXj��(q����΃"�eN�$߫��'���[w�d��Zn���d{�_��q����mc"��-W�<�� #L8����g�e5Gp�kČ��7y�@��9��8s�3�_��Re����/^��<i�
���xVx3=�W�X:���N/B&�ndYìJqQU�2�(K�	j�2��
�\�*ʭ�S��7����\�t] ��|����u1Gΐ��6��9�k��ޒ}�����a���;��M��K
-endstream
-endobj
-2456 0 obj <<
-/Type /Page
-/Contents 2457 0 R
-/Resources 2455 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2269 0 R
-/Annots [ 2374 0 R 2375 0 R 2376 0 R 2377 0 R 2378 0 R 2379 0 R 2408 0 R 2409 0 R 2410 0 R 2411 0 R 2412 0 R 2413 0 R 2414 0 R 2415 0 R 2416 0 R 2417 0 R 2418 0 R 2419 0 R 2420 0 R 2421 0 R 2422 0 R 2423 0 R 2424 0 R 2425 0 R 2426 0 R 2427 0 R 2428 0 R 2429 0 R 2430 0 R 2431 0 R 2432 0 R 2433 0 R 2434 0 R 2435 0 R 2436 0 R 2437 0 R 2438 0 R 2439 0 R 2440 0 R 2441 0 R 2442 0 R 2443 0 R 2444 0 R 2445 0 R 2446 0 R 2447 0 R 2448 0 R 2449 0 R 2454 0 R ]
->> endobj
-2374 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 697.14 269.771 708.044]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a9a6e20494d2e7c618d4c6aeab45bac30) >>
->> endobj
-2375 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.587 697.14 350.836 708.044]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2376 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.81 673.514 229.095 684.418]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a945f11d66765e2f542f9c4fb654589d2) >>
->> endobj
-2377 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.031 673.514 311.281 684.418]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2378 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.439 673.514 382.456 684.418]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2379 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.259 673.514 460.276 684.418]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2408 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.286 626.973 228.916 637.877]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a7e4588dc8f29c46edfb1fa34e6a9d424) >>
->> endobj
-2409 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.591 626.973 311.841 637.877]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2410 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.658 626.973 384.675 637.877]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2411 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.369 626.973 461.385 637.877]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2412 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [187.81 580.433 229.095 591.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a110353a7864529b85d5465ac1bce2670) >>
->> endobj
-2413 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.031 580.433 311.281 591.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2414 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [336.439 580.433 382.456 591.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2415 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [414.259 580.433 460.276 591.337]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2416 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.037 568.477 308.86 579.381]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-2417 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [189.286 533.892 228.916 544.796]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8f50e6dcc51327c56d99dc964961d6a2) >>
->> endobj
-2418 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.591 533.892 311.841 544.796]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2419 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [338.658 533.892 384.675 544.796]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2420 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [415.369 533.892 461.385 544.796]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2421 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [265.383 521.937 307.206 532.841]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-2422 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 487.352 232.132 498.255]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2423 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.63 487.352 287.753 498.255]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a52ae035a37af93cc3115f3a45f4e032c) >>
->> endobj
-2424 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.569 487.352 335.075 498.255]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-2425 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 463.725 232.122 474.629]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
->> endobj
-2426 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.621 463.725 287.743 474.629]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_abfd8a93992bbf17101c53d68a44d9986) >>
->> endobj
-2427 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.559 463.725 333.381 474.629]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-2428 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 440.099 232.132 451.002]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
->> endobj
-2429 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [232.63 440.099 287.753 451.002]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ac76c332a5b267f6b6bd749cc3b9e192e) >>
->> endobj
-2430 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [291.569 440.099 341.7 451.002]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-2431 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 416.472 220.765 427.376]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a62737490fa8ee8763ee2ff8b54847670) >>
->> endobj
-2432 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [224.581 416.472 272.511 427.376]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2433 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 392.846 253.422 403.75]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a950e7082860fadc45452ffe241de4488) >>
->> endobj
-2434 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.238 392.846 305.168 403.75]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2435 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 369.219 253.432 380.123]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8a9706372c9b371938f04b68516bb407) >>
->> endobj
-2436 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [257.248 369.219 305.178 380.123]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2437 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 345.593 213.014 356.497]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab780403b7f3997c5f5703ea0218c2841) >>
->> endobj
-2438 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [216.83 345.593 264.76 356.497]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2439 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [159.127 320.258 186.574 331.162]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a5c577b51724616ef96f58ce0f2fec482) >>
->> endobj
-2440 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [164.546 295.296 205.831 305.826]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1e5d8d199e0bcd20aeacd72b2fef10f6) >>
->> endobj
-2441 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 271.296 282.603 282.2]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ae32bc538fedce99e602767b1065ad599) >>
->> endobj
-2442 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.739 245.961 268.376 256.865]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_abf4b919c3b8d7dd958aab203fcabc4b4) >>
->> endobj
-2443 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.384 220.626 212.486 231.53]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a284af200f2e06dcfc079a58b3d4d6a59) >>
->> endobj
-2444 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [178.384 195.291 226.314 206.195]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_afdef7f8fe0ba899b496aaa369780dfda) >>
->> endobj
-2445 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 172.038 201.946 182.568]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3d3179300b5bf2b41a40b5b76650f8e7) >>
->> endobj
-2446 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 111.143 232.192 121.673]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a4399e57484eec3301f8b88011c53c35b) >>
->> endobj
-2447 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [236.008 111.143 279.514 121.673]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-2448 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 87.143 238.818 98.047]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3797a521b54434e13ed2843ebd88a8c1) >>
->> endobj
-2449 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [242.633 87.143 292.765 98.047]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-2454 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2458 0 obj <<
-/D [2456 0 R /XYZ 89 770.89 null]
->> endobj
-2459 0 obj <<
-/D [2456 0 R /XYZ 90 360.718 null]
->> endobj
-2460 0 obj <<
-/D [2456 0 R /XYZ 90 335.383 null]
->> endobj
-2461 0 obj <<
-/D [2456 0 R /XYZ 90 286.421 null]
->> endobj
-2462 0 obj <<
-/D [2456 0 R /XYZ 90 261.086 null]
->> endobj
-2463 0 obj <<
-/D [2456 0 R /XYZ 90 235.751 null]
->> endobj
-2464 0 obj <<
-/D [2456 0 R /XYZ 90 186.789 null]
->> endobj
-2455 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F90 507 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2540 0 obj <<
-/Length 2798      
-/Filter /FlateDecode
->>
-stream
-x��\[s�H~���mE���{��m6;�Jv�*�d�%��d��jAb�p���=}�����1��2/�r�����
������u���Wׯ
i�%����#�G�k$$|��>#���1�Q����l����y4]&7y���
-�ݘ��_�0���
-
�ZF����>���8�� �kxD��o�^�����+:�q:���lu��7<���#��G_�M��
��ч��\ao��%�f���'!�g�gJ�
�|l�i"��4*�1���� v��[󒹿�h�/�����h>�βtS�Q��C���X�N!�����ݦ�Wm"fBW���됎B�Zrc5�Hr2����V�8��xD� �Y�޹٭;S��Ÿ��c�&���5Di?������66�"�IyK��1�`2�8���(`/�(�""���%m*P���T0���wٶp�WI���$H�H�EC=�c��x�]p�	 jD� �&4dH��	$
/�p�|k����?|,�O�qی���8�d�
G�e{io�=ўmT�PWq���-D\�Z�=��ê/eD�7�`�bA�����>fQ�>��;bٯѬXz'��Z���"��'v��@-���>`��v
-�h<�0�''��@J*}������4���U��sа5+��ԙ��&��R�>'��I{��=m��Uf�ZrǬ9M�e���Z�2�7�$e��ǃN�D"��<�~�I�Xt��׆?
y�B����;0
~����

�\S�e2��w0�`���:��FD�����9�OZ�z�(R(Յ)I�PrrbR���΄�
)�z�	
�?#@���K�̠8�ij"��)���"==�y���>�;gU�Ѫ�c�J�I��j_[TIc�
xT��p)�Ƨ
��H���E�����Ȅ�~K�k����{&����6r��Y���f�7^�-��?�y�B�ե�o�^���&ۦ��.���>0�G�OaD{��;�da���Sd�
<x�v�yIYB�A��rb|@B�;�m��;Y����RQ
��{a�T$�x/�������`�
��z[��\��_M��ʀ_⸕�)(՟%_�e�
���E�;[$�h9�-��6�K��3�#,��eHRT�)�KYs|zX�l��
wy(���Rp�<��7Y�����7�j�Lnw���֔@�U�k��4ӝ�r 3��9q�8.&Uc3�w�.8�BgyR
g��T"�6�)=�H?���
G��SV!,�7�ڢ}��F�Mܦ�F�W
�dSW���i<7mfN
֥���`�Q�l����b���n,��ƷiG�h�A���h�wL	�<�n���ߛ1`��8��:?'i
�ӟ����A��r�w=Dޫ,�
�%q{�z
������')
�Z�!�3�Cj��jlF�
�V�=Ѳ�k��S]���5���
-��)S�!����'�����k�
�������$
-U�#�;ۚ/0�j�}�����^�Lʩ
@
���@�����
�p%�ٵ9K^T��&˞���R�
�4"j I�
�a�Mq&�_��4��x'4�����I*��;�����?D�Ҋ!�J
���S�QC��G�r!��"a����
p�`�t[
P�d���c�!R򂁁b���
-b=��Z��� ޠ�=
�
  ny3
�
��M��t(���sb��K�S(��j�0�)4\�C ���( �0CÎʁ+�)?i
_8� ��!Ԯmd�)���61q/`��;.Ti�܆4)j������o�Dd�bx�"�"
�C�h��"���aú�]u��W��2���Xg7�5�+e�, ��T! ��@ �k�b0�B���4vq��Uet?*(�׽e��'
-��$�m`�K�Z���
�&L od�f!"��^-�
֝
�	�ep �����RT(�d ���L�z$��<$)%�lQ�A O�@����p�
�yL�q����D�q^�yp

��;"RؕId�A`;�����=�`�䐡�
�j�=
ᶧ�RZ�{�\M��˽p�����=�{~6��*�C	�D{/
-:�a`&25�5RT=!�S��
�z�X��M7Vї���!���`�q
-�
�!����X�Sk�s���w�a��ɖ�� ���ݪG��T������	Rw�x���
��q��.�X�
�Nl��a]
���g��X���Oc��ئ��p �:��W3�$?
њ�
�٭W�
��"�uq�4Q_^:����3�P���J���I��P��'
-#�y�����oFh��<�Ww
�4�����.߉
�t^F��&7�]{/�e�MB),"�p�ТTMT
ޕ��P�fݝ@�"�wa�X|���`�1�
�R!�GJJ�=]#��k�+]\��/�)C9P�q�����
KmZA�\h��^�1PT��' �C�y�!@ـp4��:�?S��|��<1le����@�,P�l;f'�c�ǎ�� by�9t,�e�l39^
�&�{��m��6O�f��Vh6 AU
�b'��
-��g>m
�gAb��:3ܱT���
-q�g+aǠ���; K�`��
�MFD7l>�W��u�/1����CSKV?2M�x,d�Mޅ �=)D��~�Ǽ�{V�8��z
���2vb��t�:�uI�f4��
�_30�MX�ݏ4p���A��C�{����62�tl۝�9J[
���1vk�"*�y����mb>���m��҄�eJ��
I��
������wv�oT~����	ZӞ���W-�wE������v����e��Y�r
�v�e��VY^m���+���Z��&HJZ:���F&�w�?ۋ������3���s��X�Z�
-endstream
-endobj
-2539 0 obj <<
-/Type /Page
-/Contents 2540 0 R
-/Resources 2538 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2548 0 R
-/Annots [ 2450 0 R 2451 0 R 2452 0 R 2453 0 R 2480 0 R 2481 0 R 2482 0 R 2483 0 R 2484 0 R 2485 0 R 2486 0 R 2487 0 R 2488 0 R 2489 0 R 2490 0 R 2491 0 R 2492 0 R 2493 0 R 2494 0 R 2495 0 R 2496 0 R 2497 0 R 2498 0 R 2499 0 R 2500 0 R 2501 0 R 2502 0 R 2503 0 R 2504 0 R 2505 0 R 2506 0 R 2507 0 R 2508 0 R 2509 0 R 2510 0 R 2511 0 R 2512 0 R 2513 0 R 2514 0 R 2515 0 R 2516 0 R 2517 0 R 2518 0 R 2519 0 R 2520 0 R 2521 0 R 2522 0 R 2523 0 R 2524 0 R 2525 0 R 2526 0 R 2527 0 R 2528 0 R 2529  [...]
->> endobj
-2450 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 707.957 236.068 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a95c109d667deed44698d16eb25efef9d) >>
->> endobj
-2451 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [239.883 707.957 317.71 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2452 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 683.806 242.693 694.71]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aa01e5f8c42361cc03aba32786c4f9e3d) >>
->> endobj
-2453 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [246.509 683.806 330.961 694.71]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-2480 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 649.07 263.186 659.601]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_acdf10439693c83932d0de9a5cf35b396) >>
->> endobj
-2481 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [267.001 649.07 310.507 659.601]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
->> endobj
-2482 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 624.546 269.811 635.45]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_af04e7f91e1cfaf69dcee2df81c3d64c3) >>
->> endobj
-2483 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.627 624.546 323.758 635.45]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
->> endobj
-2484 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 600.395 267.061 611.299]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_af26aee5944d076192d5f6a12086c28f7) >>
->> endobj
-2485 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.877 600.395 348.704 611.299]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2486 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 576.244 273.686 587.148]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a66510fe1afe13b5f7334057bc96efa36) >>
->> endobj
-2487 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.502 576.244 361.955 587.148]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
->> endobj
-2488 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 552.094 249.905 562.998]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a6be74fc6a3ef7d8e1c1939536af2a943) >>
->> endobj
-2489 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [253.721 552.094 301.651 562.998]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2490 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 527.943 255.993 538.847]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_acd5b7ab06d657819656175f7d6a0cd0d) >>
->> endobj
-2491 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [259.809 527.943 307.739 538.847]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2492 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 503.792 243.549 514.696]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a6e35f9362b9f7ed65be59ae07f1da622) >>
->> endobj
-2493 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [247.365 503.792 295.295 514.696]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2494 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 479.641 251.011 490.545]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aef8d1e4a767f5ea79384588d0e19b83c) >>
->> endobj
-2495 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.827 479.641 302.757 490.545]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2496 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 455.491 282.005 466.394]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a6c51199902356b837c63915caaab7a40) >>
->> endobj
-2497 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [185.568 429.347 311.394 440.251]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3d6404d09696f8b693b9260d267df2c3) >>
->> endobj
-2498 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [315.21 429.347 363.14 440.251]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2499 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 394.238 225.298 405.142]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a99adfdf68b5bee7b3963a15c4183e136) >>
->> endobj
-2500 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [229.114 394.238 264.301 405.142]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2501 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.856 394.238 359.105 405.142]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2502 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [381.74 394.238 427.757 405.142]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2503 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 359.128 238.02 370.032]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a501e48144147e2563edc52dcd49503f9) >>
->> endobj
-2504 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [241.836 359.128 277.024 370.032]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2505 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [294.578 359.128 371.827 370.032]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2506 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.462 359.128 440.479 370.032]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2507 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.335 324.018 265.386 334.922]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a701a35ba2b5418869a471932535cf9e5) >>
->> endobj
-2508 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [269.599 324.018 304.787 334.922]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2509 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [323.235 324.018 400.485 334.922]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2510 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 324.018 513.996 334.922]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2511 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.176 312.063 208.193 322.967]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2512 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.345 275.751 276.117 286.654]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1b75c266a974976557206ce451e45967) >>
->> endobj
-2513 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.335 275.751 314.523 286.654]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2514 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [331.001 275.751 408.251 286.654]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2515 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.542 275.751 519.792 286.654]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2516 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [162.176 263.795 208.193 274.699]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2517 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.436 227.483 276.092 238.387]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a5955d6b18f4135b382ca0db2479c11ac) >>
->> endobj
-2518 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.856 227.483 315.043 238.387]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2519 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [332.503 227.483 404.243 238.387]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-2520 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [436.747 227.483 513.996 238.387]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2521 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.232 215.528 193.249 226.432]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2522 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.345 180.418 287.723 191.322]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ae899d1e624241d1328d6c6421f5485e6) >>
->> endobj
-2523 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.941 180.418 326.129 191.322]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2524 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [342.607 180.418 414.347 191.322]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-2525 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.869 180.418 523.118 191.322]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2526 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.232 168.463 193.249 179.367]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
->> endobj
-2527 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.237 133.353 275.893 144.257]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a920814c13d635e9a503551b0988c2958) >>
->> endobj
-2528 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.557 133.353 356.806 144.257]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2529 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.639 133.353 445.379 144.257]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-2530 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.703 133.353 513.996 144.257]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2546 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 121.398 171.361 132.302]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2531 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.345 86.288 287.723 97.192]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) >>
->> endobj
-2532 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [290.941 86.288 368.191 97.192]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2533 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [384.221 86.288 455.961 97.192]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
->> endobj
-2534 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.482 86.288 513.996 97.192]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2547 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [125.095 74.333 176.342 85.237]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
->> endobj
-2537 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2541 0 obj <<
-/D [2539 0 R /XYZ 89 770.89 null]
->> endobj
-2542 0 obj <<
-/D [2539 0 R /XYZ 90 470.878 null]
->> endobj
-2538 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F38 2543 0 R /F103 2544 0 R /F101 1162 0 R /F42 303 0 R /F102 2545 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2613 0 obj <<
-/Length 2450      
-/Filter /FlateDecode
->>
-stream
-x��[Ys��~ׯ�[Ȫ�h
�I�Re{��:kDZ�<��bAĐB� � (����9pIK��T^�!������;
;o.^^_\���#���\�
�
��{�+r>�<����ü ��$���_?\����J�]�t}���.�3�#?pf���_���wFL�FJ
�2x.����]`KJ��I
� i��H#.F�>!�Cȋ��i1�P���L�s�hhf� ��T���qau��
y�oI��*3$�$
<Z�?�'�l�}�भ6qykV4[+9+����6Ԙ�S��	���?22
�|L���i*ۋ-�2�RC���J����byk)u�Ñ�}
`3#�a(�Œ��Z�qD]י���1���rpc!վ���E�F��@�hs+͙�(�0�C>`j�
>DEg@;�+�pl�
���b��dKӖ�,�4����v �RPV�Q.a� �"�׬@Z�*�_���J9!��0s��=�Jyg��y�1
�@���ѝ‰=�ݘ�QGv���|aU����F��piQ�a�N�U8��(NdZX�7Rÿ`��.8�ǘ2
-�8�Yʡ�w��0�UH��aBWq(�\,��j�P��֥2O��l���(��J̬ ��A�%����Cj� �ڪ%;j����S��4;L
�
���wa>�
"�րJ0!F�6}q��
�R4&����iw�	
\�EOk�
� N�ê�"�o��X-�W����� ���5:�B,���B�v����

l�u4����USH���˪��r�0�!���a���L�Fs�wL�:���
A�[��A��4�}8�}�j;7�7q$��!�C�c����(6�۱�5ˡ�r;�$�2�V�U�:0�
��ZN2C:<�z��R��.d>�
� �ڭ���j��X5�`�hWњ�p/@x����H70�c��ZQ�9��mP܎)��bRIֆ��H9��(�O",L�Au�P�
�
X�#
���u'= }����t�V
������,s��eAhy�>��F��m�C?�>��к,4�ج��s�m�=
-Kr9�	���M]��
-��գ��W��]m�Րy�
<�I��^ZYr�.
2
�x��X�0�p��T�0���~;
��i���Y��I�*���P0�vij�
�b5��=��(ډ~����R�h(�Ye����2/�heఛ�#���Z,�f��fZ6�h3�%b�������l
�T�����Ξw-�b�W�W�
#�~�P`�pWy�/��/�W�m
	��@�I;/��,����Z��@
- ay�(�A�8g`՜�

-�n���=y�d�2�͔��0�jI��#U����~LQ�!0>{i'�I�&���U��I���r�eO�U6�s������ؑ�7�+l at M�S��6^���h�5
 ,
�i�<� hU����ϴ;��̄���5ӡ]y�̪q:c���Ѥ[&�N�����N��2O���Tn&��`;:��io��q #�#�
8qn�h�{�„'��]\��G�=^���P6��v��`2�Vqe:v�ʡ��rEyU*�Ҩ��<
�)��IU�V�
4ό�9��O�
~������dQ>\���q�1G`��}��Ա���`�����0���7#uƒ��_�C
��\���G��G�E3/�p9��GC�����@�J#]��e�c#v���f6�k�ess&�؃
Yg��2�
ܼ�f�����aE����:
��^i���|M��`k(��9�?�꽯3��1Ԟ �e\�*�R]�7Z�s#��f��5`�5���:\�������8�M�Tg�%a�j5�2@�V�zs���f�zѵ�U�[���m�>Z
��U� ��elyl��g�,����,�W�
�$x'��J�F]�ӫ-p?�jϬE5k����Y
	
T�U��tǢ�:jսƠ
~G� 9��9��i����3�T<OmL�qӬ��"Z� }�
-�Sׯ�ʉe��ϧ��7�M]<�̮
dms����\v]����:Y
�R�ʎ��=��}���I�w��lm1d�b��W��)~ w���'(�V�#P5d8*p��.F4��a�Ũ�2�1���^qC�p�J|�p��ŞkXc
ص��a�"�>:��N}M<�&o��.�`���$���Avv��5*��ޮ��gS�m��0�"[k*֫�̧78
-K�sp��Q��]{}��`����f
̆���՗o?���3�)����{��~��'L]X��3�~bd{�
!���@��Q~���[_<'%������|	
�X��_�zD��g�G�5�#���5��!������F��>՝�����?'��1�Ś�&�ޤYP��@�C‡sh�q�t�M��.;}��4ޅJ
MMؼ�%L�pa* �s}��*�����ƜW���0]W�5��F��O6���mt%�j�9�o�I���o�s����۲\����f�(d�@ �]K�L�}�T̫�[��*&��$�-���
�6�E
-endstream
-endobj
-2612 0 obj <<
-/Type /Page
-/Contents 2613 0 R
-/Resources 2611 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2548 0 R
-/Annots [ 2535 0 R 2536 0 R 2568 0 R 2569 0 R 2570 0 R 2571 0 R 2572 0 R 2573 0 R 2574 0 R 2575 0 R 2576 0 R 2577 0 R 2578 0 R 2579 0 R 2580 0 R 2581 0 R 2582 0 R 2583 0 R 2584 0 R 2585 0 R 2586 0 R 2587 0 R 2588 0 R 2589 0 R 2590 0 R 2591 0 R 2592 0 R 2593 0 R 2594 0 R 2595 0 R 2596 0 R 2597 0 R 2598 0 R 2599 0 R 2600 0 R 2601 0 R 2602 0 R 2603 0 R 2610 0 R ]
->> endobj
-2535 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 686.059 293.621 696.963]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a7f35fe17c4c48b15ddb66e52e110c2bd) >>
->> endobj
-2536 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [297.437 686.059 332.624 696.963]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2568 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 651.229 297.497 662.133]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ada449a9c1a600893585256666d6fe331) >>
->> endobj
-2569 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [301.312 651.229 358.089 662.133]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-2570 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 616.399 240.501 627.303]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ac034ebc28209bd38f90ba23323f65c41) >>
->> endobj
-2571 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [244.317 616.399 292.247 627.303]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2572 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 554.119 193.906 565.023]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aaec18d4d5bd29cd38e153b4602e027da) >>
->> endobj
-2573 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [197.722 554.119 245.652 565.023]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2574 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 530.248 316.306 541.152]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a0e578573084aafbf76c85db7dd1363be) >>
->> endobj
-2575 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 506.377 317.412 517.281]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3cdef8e8e717e8aae495db38ab2f3555) >>
->> endobj
-2576 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 482.506 250.443 493.41]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab11bfde2a1ce71a607644a38cb914b13) >>
->> endobj
-2577 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [254.259 482.506 302.189 493.41]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2578 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 458.635 280.59 469.539]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8561bc8f545197343c8cf1935e794af3) >>
->> endobj
-2579 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [284.406 458.635 341.182 469.539]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-2580 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 434.764 311.026 445.668]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) >>
->> endobj
-2581 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 399.934 275.759 410.838]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_afba20cade6fa4fcd26b81086a02923e5) >>
->> endobj
-2582 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [279.574 399.934 314.762 410.838]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2583 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 376.063 267.061 386.967]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a427ee580c9a357d0e154cd2520dbe33a) >>
->> endobj
-2584 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.877 376.063 327.653 386.967]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
->> endobj
-2585 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [349.481 376.063 384.668 386.967]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2586 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 352.192 268.167 363.096]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a00413902e11b669bca9a8c81438202ee) >>
->> endobj
-2587 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [271.983 352.192 340.246 363.096]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
->> endobj
-2588 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 264.009 227.679 274.913]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-2589 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.177 264.009 271.664 274.913]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a9dd3a06d94e54ca59e0c41901d9f9a06) >>
->> endobj
-2590 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [151.535 238.185 227.679 249.089]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-2591 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [228.177 238.185 319.264 249.089]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab8ef27e25132c083ae1b59d3162fa21a) >>
->> endobj
-2592 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 212.361 230.519 223.265]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_abdf75082ed3ae874de8fa5cb0198e080) >>
->> endobj
-2593 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [234.334 212.361 276.157 223.265]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
->> endobj
-2594 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 188.489 234.394 199.393]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a73a395dac9898b73e0782a47f4537cd7) >>
->> endobj
-2595 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [238.21 188.489 314.353 199.393]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
->> endobj
-2596 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 164.618 241.617 175.522]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a56e3a5f9a94fb76a527fedea1bbd83cd) >>
->> endobj
-2597 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [245.432 164.618 293.362 175.522]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2598 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 138.794 266.244 149.698]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ad38a887658485f32f589a57a74e6a78c) >>
->> endobj
-2599 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [270.06 138.794 317.99 149.698]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2600 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 112.97 282.015 123.874]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a81715f656d39c399cf4d63b72635194c) >>
->> endobj
-2601 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [285.831 112.97 333.761 123.874]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2602 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.54 89.099 262.638 100.003]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a268b22472143daa3e8f2d0828d1ad565) >>
->> endobj
-2603 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.454 89.099 314.384 100.003]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2610 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2614 0 obj <<
-/D [2612 0 R /XYZ 89 770.89 null]
->> endobj
-2615 0 obj <<
-/D [2612 0 R /XYZ 90 279.053 null]
->> endobj
-2616 0 obj <<
-/D [2612 0 R /XYZ 90 253.432 null]
->> endobj
-2617 0 obj <<
-/D [2612 0 R /XYZ 90 179.866 null]
->> endobj
-2618 0 obj <<
-/D [2612 0 R /XYZ 90 154.042 null]
->> endobj
-2611 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F90 507 0 R /F101 1162 0 R /F42 303 0 R /F102 2545 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2648 0 obj <<
-/Length 2598      
-/Filter /FlateDecode
->>
-stream
-x��Z[��H~�_��b)��
P�h��䶓L2ʥw
6�h�v���������
_�8��U^�2�V�;竢�7�����W��%�bG<�n��z2�I�����3JB13J��L�Er�,�w�L���M��#I}�fĩ��|4�!��̓���w�mj���$�� �+����zy������M�cֆ�H�M����_z��Xy�ͤ�p���{���:whۭ��c�DxC2F��}�<4��׼�n��*�п�Ї�"�k������,g��w�M1�-�U:�~��Qq�j_Ve��Af�_#�,�+�
->Ґ��q�-�e��(
-�G{L��E^��,_]��V�bȈI����p=�<E�HycD-C6��f	1��9��	s�5²Q;�g;�����"_�͐��RJ�ܿ�&�z�j� ��_�����%��@�7�Ҽ8f
~�tx�X�� ���}��6���.��r$��V����.n;�o}�9��'?��?)��ʬ�}���^�yU�Q��F�Ľ����<1K�㤗�ٕ�6
���/�(�dR�9
ߵ˲���.Y��
�PqbB��>N���|�>R�ө�a
�5������e�,��ڶ������ˆL匄��C:
�K�1��V�c�� g��a��Y5������n��!ts��[
2�ֳ��� �DJ��()�v+�9�
��f
��s�f�͑p	�Aͨ|��	Xae�c�������c��86-�uu��1��X0�|?�Y�����Aւ:PTg�1r%�� ��G"&K��d��A2W̿)����[�Vp*������a0kA̘��U�h��V
�=��qW
q
l,0h [...]
-������9�*D11V%[5☪Û����}je��<M��-j��g� \pȀ{> �ϩ���d>u<�(�
 Jw;�d�.�.���G���<ꣀ0�SoSf4V���7#͝6&i� ����W6X�����!�,j���4��d��jq�b+���-MR������F��3���-���,R�����j�.s�5%o[��n����t�냳��cd���Q�5��a@��2��Nv5�Yl�Y��!��D��#?���AW� 1c���,�K�t"�s����}��K[_�6=[Wbh��O�<Bt����͚/�j��lK�����{<��I�Km�{B��/P��hn3�
-
��2�n;��-ق�w���x(��tӒ�d�M�1
�Vxw��5s>��	����d�*r�wn��A�a/>Bfc1����+@^7Ww`T���=��J7�`{+���
@�
X&�9��^e�?2C�����'�;�&1|9=swC
�:/j�Ad��m7?-
����Q�ާ"�� ��0���
d�\�,��Fb Q`;
A
�<�v��ˮ�#y�9a���hI���`��rGQص���_
(V@����cdGt'7v��2e
�`�~�
-�;)��}Y��U�*WV{td����Blw��!^����_
�(De���:Z�6N�S᪬;�v���`5ߴ�u{C����"{
_�b��%~v��P%�3W�� ��%�"�s��ij2&�0�j�t��Ԍ���(S;'0����
0w�%�!lv�}�5���C����
*HD<�
�o�ٮZ�ݎ���?�d��1G��Ѭ@�0V��7o^�:�}��u2s�G���
�մ��UZ�m��������� �
�m�5#T7C�O��>M
$������o&�6��p��
w����˛��J������yYJB7 h��E�t"�
Ȝ_���49H��#^����LJnf���a���q�b!����mo��
)�,
-endstream
-endobj
-2647 0 obj <<
-/Type /Page
-/Contents 2648 0 R
-/Resources 2646 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2548 0 R
-/Annots [ 2604 0 R 2605 0 R 2606 0 R 2607 0 R 2608 0 R 2609 0 R 2635 0 R 2636 0 R 2637 0 R 2638 0 R 2639 0 R 2640 0 R 2641 0 R 2642 0 R 2643 0 R 2656 0 R 2644 0 R 2659 0 R 2645 0 R ]
->> endobj
-2604 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [173.765 707.957 332.797 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a9f1fcbebed65fafcc7439ce24392b59a) >>
->> endobj
-2605 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [337.725 707.957 385.655 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2606 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [397.971 707.957 475.798 718.861]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2607 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.345 661.133 310 672.037]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8bf0912e9b611d41ee76da66fd1bd28f) >>
->> endobj
-2608 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [313.217 661.133 361.147 672.037]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2609 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.885 661.133 447.712 672.037]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2635 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.144 614.308 337.254 625.212]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aee40105531fe1008562584274189cf35) >>
->> endobj
-2636 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [341.371 614.308 389.301 625.212]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2637 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.794 614.308 477.621 625.212]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2638 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.345 556.525 316.077 567.429]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a58869dfc76ca4a5a51e1e130096cfc88) >>
->> endobj
-2639 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [319.295 556.525 367.225 567.429]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2640 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [375.963 556.525 453.79 567.429]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
->> endobj
-2641 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.806 411.183 195.736 422.087]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
->> endobj
-2642 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [454.44 411.183 513.996 422.087]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2643 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 254.888 201.372 267.286]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2656 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 241.383 201.372 253.378]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2644 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 130.917 201.372 143.315]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2659 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 117.412 201.372 129.407]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2645 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2649 0 obj <<
-/D [2647 0 R /XYZ 89 770.89 null]
->> endobj
-2651 0 obj <<
-/D [2647 0 R /XYZ 90 473.835 null]
->> endobj
-2652 0 obj <<
-/D [2647 0 R /XYZ 90 473.835 null]
->> endobj
-2653 0 obj <<
-/D [2647 0 R /XYZ 90 361.744 null]
->> endobj
-2406 0 obj <<
-/D [2647 0 R /XYZ 90 339.367 null]
->> endobj
-2654 0 obj <<
-/D [2647 0 R /XYZ 90 339.367 null]
->> endobj
-2655 0 obj <<
-/D [2647 0 R /XYZ 90 278.644 null]
->> endobj
-2407 0 obj <<
-/D [2647 0 R /XYZ 90 232.019 null]
->> endobj
-2657 0 obj <<
-/D [2647 0 R /XYZ 90 227.535 null]
->> endobj
-2658 0 obj <<
-/D [2647 0 R /XYZ 90 154.672 null]
->> endobj
-2465 0 obj <<
-/D [2647 0 R /XYZ 90 81.969 null]
->> endobj
-2660 0 obj <<
-/D [2647 0 R /XYZ 90 77.486 null]
->> endobj
-2646 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F11 387 0 R /F82 428 0 R /F90 507 0 R /F103 2544 0 R /F102 2545 0 R /F106 2650 0 R /F81 426 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2671 0 obj <<
-/Length 2569      
-/Filter /FlateDecode
->>
-stream
-x��[ے۸}���[�*
��%I�*�xSv��cO�v��45�D"g)����� H��H���}��V�8y��h4��Q�<&�~���K�|}ws��‰AFR��-��
��'?�4
�|�.aR#b$���~�����p��~w����_���R:��o~�'s���2��/�u�)��U���78p�9�ɁC� B�e��`�"6���(�n����21z��U:����b==�����as�K��6��ǞQJ�<p�9_�	�<��ͺ$��8�%GT��WˇbZ�'z�2�b�>�
5<1�3�����;&����)��b�w
o�bX
�b�PQ
?�����ό���և��g�VU�~�������g�Z���f�g�-coM�!�L��¿�ڑ�W�
�$��̀/�ţZ���˦S)`J���`�_��nwE�)�@�c`�����b���L*Ǥzh���<�fs�g�_
��v�.i=�S&6
��]Z�Y�	���
*��X�Y�U�9������r�f�!S[EA\�2s0'
-�a�&�8���:K��0���y��$Jΐ"�dMtUW��b
�ƄoI
��d��e�CT��Ѿ�@t�	�%F�&��k���D�Xm	A2P��*�L k����l����t�����35zܭ�l{?q��A�Vi=���1�rPc3@�1=�c
��#���=����p�=~Qe'�2�}T��ֲ--�S"�ή��H�g�%L����e6��ϰ�?��r�vͅ`\�"Y�� �ӈ�/�k0��#�"̄���#�����GJ
(c�:~{���=��q�A�,�ޓ ��_����se�:8��D\�KI�f��z��dA�ѫ#[(Va��.O?A�-�ȵ���U���f�|
lb �B&B	Ād\��Ŷ$
E��8�Y�h`
�?�`��((��D�҈�p�W-$�
�&A�_Z(-�T��*����P�B�>����E��J�GB�8�k�ۆ ���O�.KC
G|�Gj�#�T=���n�b6
�{s_&0R�_B~��� �D��V���v�_�g�k��x�,�z��y��7{l��Ұ
���&5�;��1���R�e'���S~����V�a�<-gO��l�q �(��r֯�S��â.���<
|��e�ڕ_VGK
v�t~	����X�up�L�cʁyL��6-l�?C�[�&}� Jf(;���������a
P�
*�-�m����p2aK��$
��L��I���IJ��p�Й�*�Vn�����[����6�����$��u�{�w:��϶�$����?�a����!�L,
i�-^�FG�a�'"N�ZF�`8��]�g���:OZ�4���
���t�������s��_*

E��$=
yi*�F��p�JJ��E�Si�+���=���ԩ4O�|�̾U2

G��+���1�)6�O&	,�8��o�,�%��A�=�>�N��r��)ө�K��򩤫��t��
��&'ꕜ��ҝJ )�tt.L���=;En�����
nn�F�Em�}L�b�P�X�w1j����Zb�kw�#��pDhX�;�o��=x.:�30˒G]�W`
϶œ
-aUr����^�
vnB�;�7�$
Ӫc/��C`��6`Z�]��c���ػ�c��N̫�aY�@���m.cHyh�p���jGwI"ʛ}���mti��M���z���I7�
_5��
-z��
`r�-�U�(�l��fOu��d��D
Z���"�4��P�I
�`���5�
&����☷
-��|_e�"
-�Q̿
��4�y
Ŷ��5�2[�i(p� !J ��5��J��V	PXƕPN�BQ`Z���m)

b��B�Oy���*�c�UК^�QP�Y���"��'v�t�'�������	�A3q�~"{�'6S�'=�˓
7�Inu�'D��,�ib��~&*��4۪�E�s�#{�
�������|ѩ�A.�N<��Ri'p+�N�
�j'�̮��7��V�L̎ttDWR)g�AyT�r'
r�xr�3�������'��'0�FO���;� ��
��>U�&V�[!Xv6{�xE?��JO���Io�x�˥���y�ħ!/ͥ؈>������PA�>�z�'WzҞKMO.PO�˦��{�
X�utD�MX"�Y�l���0��U�Q�SO�t�U=i�]<9ȹS�I����tg���������'DQĨ�.�)�&jO�`�k��a&�|�@�*�KK�_[>��J>9��0�$�oD><�ˊ�_��]��![��V�v"zh'4TX/�D�PN(�L9a�
��N��^ʉ>���� [...]
z����r?Ϫ�Fu�Y�EM%��zj7��هY�-���
-endstream
-endobj
-2670 0 obj <<
-/Type /Page
-/Contents 2671 0 R
-/Resources 2669 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2548 0 R
-/Annots [ 2665 0 R 2674 0 R 2666 0 R 2678 0 R 2667 0 R 2682 0 R 2668 0 R ]
->> endobj
-2665 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 632.116 201.372 644.514]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2674 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 618.611 201.372 630.606]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2666 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 407.571 201.372 419.97]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2678 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 394.067 201.372 406.062]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2667 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 153.447 201.372 165.846]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2682 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 139.943 201.372 151.938]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2668 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2672 0 obj <<
-/D [2670 0 R /XYZ 89 770.89 null]
->> endobj
-2673 0 obj <<
-/D [2670 0 R /XYZ 90 655.872 null]
->> endobj
-2466 0 obj <<
-/D [2670 0 R /XYZ 90 609.246 null]
->> endobj
-2675 0 obj <<
-/D [2670 0 R /XYZ 90 604.763 null]
->> endobj
-2676 0 obj <<
-/D [2670 0 R /XYZ 90 522.077 null]
->> endobj
-2677 0 obj <<
-/D [2670 0 R /XYZ 90 431.327 null]
->> endobj
-2467 0 obj <<
-/D [2670 0 R /XYZ 211.842 355.122 null]
->> endobj
-2679 0 obj <<
-/D [2670 0 R /XYZ 90 350.485 null]
->> endobj
-2680 0 obj <<
-/D [2670 0 R /XYZ 90 267.953 null]
->> endobj
-2681 0 obj <<
-/D [2670 0 R /XYZ 90 177.203 null]
->> endobj
-2468 0 obj <<
-/D [2670 0 R /XYZ 211.842 82.124 null]
->> endobj
-2683 0 obj <<
-/D [2670 0 R /XYZ 90 77.486 null]
->> endobj
-2669 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F99 1084 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R /F11 387 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2690 0 obj <<
-/Length 2953      
-/Filter /FlateDecode
->>
-stream
-x��\k�۸�>���j1���-
-4iv�4�����hlyF�-��r&�_�KQ/ڒ-��.�b�H��������=�bD��a����lO������w
-O
2����jb�Dq�������#�fs�1�>E�&�{ڮ_
�eݭ��,�^f
-Oѧ���Ό��6�ͩ�ӷ�h�s���U\܋�E
���+��~��p����6�	q6��d����g<Y��`;3z�\<��p�พ�p���u��&�"���H��J�<�[#��~�]�Q��(:|l%J
L��)+)2��v
[F)��g
8xF��9��uI��aZ�
I�5��t6�ӗ�v\��
�c�6��d���>W:�',�5��O�b�#
-��IG�ݻ�O�	�]L)^3���f�U��V�+O_u42g�#��d=1B���n��O�E�yG\#bL��n�t�kbbBN�1p���k�bx���T&�]��>h,*��B��UqE��Biĥ߉e�	�ZE'de֛�c����#��D
�͂p3S�8+�Ma ��1�3R�Ǯ.`�i�ě20t q�
��c�
-��b��h��t�>�H�����4΢|�u���0V�䡣�Y=�`��b����;�M"�
�ZL�6&a]y1�g�4������γ}�e�J�IM�dec�F�Ҟ�$�w	n
7!��Q Lv}M�%;��ns
o��w�6{܈�H���
3g��s���}��˾��������/����LҎ�	�y�
����Jo���1Y<�K�hW
 Cɐ����c�Va�Y��o�__fTL����Y
����6Isw��S��B�B��eq�x�˴ )��҈�v���%����D�
���+�[%w!'� m��&
d����)Rs�ݴ��	sA~:]����t�~[�b��� 3N��IIՅ\o�9�!-�@��j���V��aDR�x�-
����P��r[~]�
�J$ʼ���o��|�Lm�e5_��/��َ I��M�?��� ��
�g ��4

�X
-��2
Mmb� 3 �C��J���A
�Βn��-�I��7�:_��]�|;���ht/��
 �V!�������
K%H�%1
��C�t�%�Tj[RSi��M�~#2��G��
#�f, ��#:2A�!�	C&s�YL����
�:]g��~�t�l9��7y\�:H�|
׷zH���_��m
��0�����O%��!/%ghDGN	�t�]
-r������N���4m�.ϒ�:#�g�?�"e�U��e'�]�E
/w��HO�����pY��F��=�.���D���S.�t����Y�Z}_�n��l�
мz���d�Fhw2>�AS`��� �"!'�h�΍�q9H�1� !�̴�}]�O�/g��v{�hIq�����/�Ix�",pÑ��r>8�CD�Z
��Nl�U�Y<Yyf_�
J�ϝ�ں(Lu�)�����u���s6cj� 	r��͋�=�6~��
��A�8Ȓ�,���
�;z�![�&бN
�>
-�0e�;n����i��
�!N���a�
bG�RukU��e�d���$�u
��병�A2$� kﴲ��4��S�
-��Ѷx���6��k`uQ�:;
�p�>IM]��Ӫ��SZ>O�`W]����pU��^�Uǀ޼)}� �J7���
��5�U�VwU� �dK�K�zg�ֺ)�v�i"�0��0�S \��%hR_^h2M:ЬT����:^�լ}�o��T�֓V[[��@%��#!���TqRH�^rgۗk�T�
(��p%U�i�*�����R���Ry��
-IB3��H��] �R�a��BJM�U��
-N�l��zo(�F�$F��M
(EiX)�t/(k[K
�
*aՃ���b��J���qf�L�Z)�3k��J�j���T1\H��愐
-=���R��0�d+�!UR-�څ���
7U�.�	�D��9D����sK=o����N!U�BjG#M
�i��
�]��n�B�KETW�R��p�Q톬[DMRGB��{�����R̔*���UT&L��������8C
��2*��
�\F�ҘΪ�g�x
ե5��0��Qǻ��X i��T
��� ,���� ��z��u�4LI�Ґn��
,��E�aL݋�qHT���{aLX&��HˆJ���+-�Rے
����4�#�c�A��1	KDy��w���T
��hk_0LF�ҖNճ%��z��S:j�1�
�~&$�!1
�`'�Э�B*5�|�
����<#������RI�WZJ*�TR�
���c��2F��^,�8��K{�uT�X�~P
U��Q��� !u���"*2i
�x��J�����B*���4�:�
0]\ R�O
�	�-ĠB*e��\\,�ʫ�Ԁ����R=w����ǢZ">�{��x�N!�h]��O*��
QRe���p����-Uvk� �Ai]���"��^-�хNj������	-U��.r����0�Z�
�J��G�T�k���R�u
	���N�w�wo����x
�
-��VR����X��"8���O�DV��r1H�e�!@󌈂�^��ج�E�@nw옅0�S�8l<���
-T�)�@
�H,0�<��>1�6i�)j�F�9�u �'R����g�����v�L҇�:�?�qz�F�M��K�����u��J�M,��5�b�8˃�4�MŖ��z;��kD�^]��C)�0�n �&ЀN�����;U��g\���ň����zr�
-
�ǜ���K�U���A�Z�~+����+ ���'}HQ6���QG�o�t��F[����O�>���MY\1�]����|�}���jF ]���������������}�v�v�t�3�-V���ٜ�q\�E��O����"nc=���W/%�
�����_��vq���?�kd�R7�_U��f���[��)�FTe5�0AR��y��_`�1Q�z��΋�Ջ���7l�-�I3��|��#
-endstream
-endobj
-2689 0 obj <<
-/Type /Page
-/Contents 2690 0 R
-/Resources 2688 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2548 0 R
-/Annots [ 2684 0 R 2694 0 R 2685 0 R 2698 0 R 2686 0 R 2701 0 R 2687 0 R ]
->> endobj
-2684 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 507.234 201.372 519.632]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2694 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 493.729 201.372 505.724]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2685 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 228.801 201.372 241.199]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2698 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 215.297 201.372 227.292]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2686 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 87.205 201.372 99.604]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2701 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 73.701 201.372 85.696]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2687 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2691 0 obj <<
-/D [2689 0 R /XYZ 89 770.89 null]
->> endobj
-2692 0 obj <<
-/D [2689 0 R /XYZ 90 646.048 null]
->> endobj
-2693 0 obj <<
-/D [2689 0 R /XYZ 90 530.99 null]
->> endobj
-2469 0 obj <<
-/D [2689 0 R /XYZ 192.853 454.785 null]
->> endobj
-2695 0 obj <<
-/D [2689 0 R /XYZ 90 448.768 null]
->> endobj
-2696 0 obj <<
-/D [2689 0 R /XYZ 90 367.616 null]
->> endobj
-2697 0 obj <<
-/D [2689 0 R /XYZ 90 252.557 null]
->> endobj
-2470 0 obj <<
-/D [2689 0 R /XYZ 192.853 176.352 null]
->> endobj
-2699 0 obj <<
-/D [2689 0 R /XYZ 90 170.335 null]
->> endobj
-2700 0 obj <<
-/D [2689 0 R /XYZ 90 110.961 null]
->> endobj
-2688 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F99 1084 0 R /F11 387 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2710 0 obj <<
-/Length 1954      
-/Filter /FlateDecode
->>
-stream
-x��I��F���
-�U���%U9$���$�=9%�)
h��������ukA�����U9���o���8�E8z>��zp�L�� #����"�#�
��F5��~1�1
rW������_����O��~�)�H�h���GS��2ˆ
}t7�"N|.�����2#*�W�Q�I�0B!�#�Ef4&�a����� 	_��
=�x�-77ϓ��M�����|�Ӧ9��O���*~�V
-����.�;���4k~�:�(��yK�ϖ#B��y2�{�3B6A�3"־���6���X7#)�����aˢ�,Eyˇ�}�h$0
a�qC<�>.��hL�
���	<H+V���q���ƴ�K�%Q�9�I�in }�-�Nݫg��x̉]��:D�*�z�y��
��R���>ϖ�E:+��M��I�v���p���V���������/��]��T"�I}S�N;*f��<
� �xb�#\ ���'��;.
32a
�&����Ir_:ȓ���
-��n[�B 	k�ח\��=�i+��2�͚H2���
�8�
:[G*�OҕhkIt�	G�JF�Dwm�܃����n��< �rI� �D����x��������
VIZ܌��8��1T���N��#�
ih*
n@Ӯ��H��!����A0�<w\��lD��cUË����1IN��}�*$� ��R5ⲩ�8������! �E:�V�Оn�IUȻ�"��U����+
$2��V�92R�0��eS>�)�#��1
�<�r�6��8E�T��2j�y��-��ȃ�"��A�3b��vԟO*��بr;� ����0�U
7
\g�,H�I��*�MJ�}�2fR!J�6+�e�5pl�,��C�I�g>���{'a�� �h-48�hU
-
��]@�������Ġ�"@�E�O�q�tP
-
�-�;.-{KU
-D��W����㲻�@"3a�5Βy�Z��P֡�S�{ݾͲe�����fb�2J�"H#K
����BY��^jG
��#�2��nP�ަ 0�8�r_)E��3 �(��6;�+���
�bm9���5��jcq�|�����2m�@�.7{���F��'����=C6l�.7;�:e�
�n���?��

1d#��L7����"��oI
:���GT�{�tP=�;
:m�{���,���V���y_d0����Uk� �ɡ�YuV"S2h%�%� 0ɶ��
�3��JeX�@��#� ��
-	<�G"������ܳS"�
�
-a$SB+}#�P�e�DC������
-��y�م'��Z�Cxr��%�H�K�	�w)Mئ^��
-�&�	�'-�A�iO>7�tP�'
��'�;���''�jg�Y�,,��#� �P�9�t�v&�X�Ԅ`Ͼ#�$��
-M<�G�IY$
 � q[�g[��$X�Y6]���iѣXS��	�XS�+�+���DAV�/
BZ���A(lk�s�vi$(��;ZB�=L
-�{^@�� �<�ђ�ĠD�r�K���A5u<ty�8��=Xb_�
��{��,�!���l7�!��@�
�{�a�Z������Q�q��sp���+�XG��4���'�4ia��zxN�9���O��i	�PoL�r��=�e$�:4h]~�7�h�
�˘�{4�������ZE�j�ɼ>�}���[�k,!���������6J��o�"��N��_�����؈ؘ�h��znxl QЙhw�ƫ�:
�M�HQv����r���Y���
-�������X?S]�z�b�Oۊ���V`=�$2�i�@@iax��DU at _�~U~y[R�`�S���t�Ϫ_�E�ߍ�Ĥ���:ɿ	1���8}���w���>�܎��"��
��y�$Uu�K��Y����
x��l���wWW��u��
��e�}X� ��ӻz���:�)\\��Q}ч���e1�
-endstream
-endobj
-2709 0 obj <<
-/Type /Page
-/Contents 2710 0 R
-/Resources 2708 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2548 0 R
-/Annots [ 2702 0 R 2714 0 R 2703 0 R 2717 0 R 2704 0 R 2720 0 R 2705 0 R 2723 0 R 2706 0 R 2726 0 R 2707 0 R ]
->> endobj
-2702 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 644.071 201.372 656.469]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2714 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 630.567 201.372 642.562]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2703 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 520.1 201.372 532.498]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2717 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 506.595 201.372 518.59]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2704 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 408.084 201.372 420.482]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2720 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 394.579 201.372 406.574]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2705 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 296.067 201.372 308.466]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2723 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 282.563 201.372 294.558]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2706 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 184.051 201.372 196.45]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2726 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 170.547 201.372 182.542]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2707 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2711 0 obj <<
-/D [2709 0 R /XYZ 89 770.89 null]
->> endobj
-2471 0 obj <<
-/D [2709 0 R /XYZ 90 721.073 null]
->> endobj
-2712 0 obj <<
-/D [2709 0 R /XYZ 90 721.073 null]
->> endobj
-2713 0 obj <<
-/D [2709 0 R /XYZ 90 667.827 null]
->> endobj
-2472 0 obj <<
-/D [2709 0 R /XYZ 90 621.202 null]
->> endobj
-2715 0 obj <<
-/D [2709 0 R /XYZ 90 616.718 null]
->> endobj
-2716 0 obj <<
-/D [2709 0 R /XYZ 90 543.856 null]
->> endobj
-2473 0 obj <<
-/D [2709 0 R /XYZ 90 497.23 null]
->> endobj
-2718 0 obj <<
-/D [2709 0 R /XYZ 90 492.747 null]
->> endobj
-2719 0 obj <<
-/D [2709 0 R /XYZ 90 431.839 null]
->> endobj
-2474 0 obj <<
-/D [2709 0 R /XYZ 90 385.214 null]
->> endobj
-2721 0 obj <<
-/D [2709 0 R /XYZ 90 380.731 null]
->> endobj
-2722 0 obj <<
-/D [2709 0 R /XYZ 90 319.823 null]
->> endobj
-2475 0 obj <<
-/D [2709 0 R /XYZ 90 273.198 null]
->> endobj
-2724 0 obj <<
-/D [2709 0 R /XYZ 90 268.715 null]
->> endobj
-2725 0 obj <<
-/D [2709 0 R /XYZ 90 207.807 null]
->> endobj
-2476 0 obj <<
-/D [2709 0 R /XYZ 90 145.343 null]
->> endobj
-2727 0 obj <<
-/D [2709 0 R /XYZ 90 140.86 null]
->> endobj
-2477 0 obj <<
-/D [2709 0 R /XYZ 431.18 83.504 null]
->> endobj
-2728 0 obj <<
-/D [2709 0 R /XYZ 90 77.486 null]
->> endobj
-2708 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F99 1084 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2735 0 obj <<
-/Length 2324      
-/Filter /FlateDecode
->>
-stream
-x��ZK��F��������coޱ�1�v��L��ut��&,	P�ۿ�YHB��������||_
-��������a{
�?���pd��TFϑ���		�f��1�H�dB0��:-���X��d�2}\�OeZ�%
-��cBqܾI���U2���iU��O�sּ�V�
DrS�H~y�p����owt�q:�t4]���
�f���Ό��4���
�������fS�
6E"��'D��Vi���J���s]櫹�o6��%q��
�cZRd��깯%q&=���	!�3���B��0�K���Ww��Lt��Ha�Ѹ�QB
.J�i��+������1!��Sn�Y����
�L
���4�tN}���{�J'�!����)�7����]����~Z��4_m�CEBE�e�����#[�We�.�*�iu�y�l5��}�S�(�[o4�_�ʍ�Ԧ
ҍAv at dE"�hB���ͻ���y���\��f�=ـ����
�7庨�
-9cy!30=�m��9/�	�q�ώG
7�<��Z pn
-p,�IT�1�攅X]�S����F�,Q�l$d8Y&�v
�&���
�\���sʾ��
���ۻݤf�1��Q�uߩ��[��V���d� ����n�7����b�
&��
SOQ/��HA!�5���u�X8��K�&���Ζ�V���8��0r*�%��	��bS;�KH?���m oՂ4�Y�֮�3�ј�4�É�"�í�?��M�t�ն6���%��(b�ֽ��]XU��]�^M��JD�\h�4��#Ra4��)b]<zN �߆��焇-E�ĭJxNF���~��+y١񱴽��/ڢ�ԎMg�l�
)T$����
���`��
"�q�����Gr�$hH�Pw���;�}��4[[�r"�ω�vɣ�7lB_`��2]dԆ`8���|��d(�N�Il��Q�2�,z��N,筄O����\� �1��B�~�p
���|��M�0�7K@���r؜���y����p�
)�I�YH�����B�q���-��� e P����R:[p�c9�A(�TJ1���t5s�"
-ɑ�U�1 at a��f��̜Ժ �Z��&�jZ,׀���+
��u�ñVpj�`'�zp����O?�lP����#�84�o�y��s
E���Q��+V� |���L>b���x�"4����
D�ܸ&�F�B�X��ݤ}FFPlK��J�
+u>�Q��^�i<U}b��

��� �8�=V3F�����O��h�%
Ѕ�@�i��ef}��tZ/�ݔr>�y�뺐�p ��X��B

q�EC�E6`�c��" �	

-�8%��kC�p�鐐o�뀐g�>b�
 B�WN��B��@�
-<��$̑�x�
(��CBV���
d�U��<�e��a,
-�m�L
�b�X2�C�e��ʽ��8�K>}i�^��WY���rQ�n���j���UQR�
-P�,�Zg<�]녇�	8�$l��E�I��dM�M�
-ܬX�I��ix&p
�|
ܼ�� �u��S�o
An�u�A/���2�8�F�u�����C�� ��
6����&����7x��7x�b���/<�W��A����C���èp��uĮ��S�Y;!�nyq�S
�P�ӭj8��V5�굪�&��Um$�6Q�-�jf�lj�em��
� �Q�U
)Z���;�V�4�oTc�Y����[
Z�{�忡wm �	
�w}�I� ��@H:��/�]S(!F��]������
d6�N�2
��Ġ��
-�1_��4P�����y��S���X����9��m��C
U'a�U����
9ڬn�`�}�(�;��\}X���Z���b��-2O
-df
,���
�
��
�a�(�e�XH̷n
���9�ƄY�=X> �aP��g�
�����
*wf���

�ߒ>Bl
8E��;�l&�K9�K���n�����1
��e8
��}شg��@'���q�f��p�p���GSx�ҧ����s�V�k
��f�F������pµ�훧v�ך�#��t3򭳙��� ���LW��mTɖ��L��H���1��Y�a��	C�8��@�)����Q�Q
����h��nz��c;g1��>|��V3�o���^=ipX
-�ٙ��wg�a������0zp*?��n>����W������j�I�����9�g�VӮ��S���H����1]mҖ��Z�>4.���a�T�0��9��$���k�����ɡ;�p���奮������!��@�������;l���xYt�1_��e��q��m
$%���
�
�h3�߼�&���/Y�mg�;�?�y�
-endstream
-endobj
-2734 0 obj <<
-/Type /Page
-/Contents 2735 0 R
-/Resources 2733 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2750 0 R
-/Annots [ 2729 0 R 2740 0 R 2730 0 R 2743 0 R 2731 0 R 2747 0 R 2732 0 R ]
->> endobj
-2729 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 530.674 201.372 543.073]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2740 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 517.17 201.372 529.165]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2730 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 418.658 201.372 431.057]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2743 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 405.154 201.372 417.149]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2731 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 255.085 201.372 267.484]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2747 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 241.581 201.372 253.576]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2732 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2736 0 obj <<
-/D [2734 0 R /XYZ 89 770.89 null]
->> endobj
-2478 0 obj <<
-/D [2734 0 R /XYZ 218.507 671.378 null]
->> endobj
-2737 0 obj <<
-/D [2734 0 R /XYZ 90 664.738 null]
->> endobj
-2738 0 obj <<
-/D [2734 0 R /XYZ 90 608.119 null]
->> endobj
-2739 0 obj <<
-/D [2734 0 R /XYZ 90 554.43 null]
->> endobj
-2479 0 obj <<
-/D [2734 0 R /XYZ 90 507.805 null]
->> endobj
-2741 0 obj <<
-/D [2734 0 R /XYZ 90 503.322 null]
->> endobj
-2742 0 obj <<
-/D [2734 0 R /XYZ 90 442.414 null]
->> endobj
-2549 0 obj <<
-/D [2734 0 R /XYZ 90 395.789 null]
->> endobj
-2744 0 obj <<
-/D [2734 0 R /XYZ 90 391.306 null]
->> endobj
-2745 0 obj <<
-/D [2734 0 R /XYZ 90 332.53 null]
->> endobj
-2746 0 obj <<
-/D [2734 0 R /XYZ 90 278.841 null]
->> endobj
-2550 0 obj <<
-/D [2734 0 R /XYZ 90 232.216 null]
->> endobj
-2748 0 obj <<
-/D [2734 0 R /XYZ 90 227.733 null]
->> endobj
-2749 0 obj <<
-/D [2734 0 R /XYZ 90 145.047 null]
->> endobj
-2733 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F82 428 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2759 0 obj <<
-/Length 2044      
-/Filter /FlateDecode
->>
-stream
-x��[�r��}�W��U�x����7e�,N�<%)LA+"� �
�}�`!1 �u��� Ĝn��9
�h2Oh����7�W�34q�i�������HG�Ʒ���Փ_o�&B[œƠ�������w7��o��7��G
?ф��16�-G?�J�[�~�P"�M>W-�����#ڸ�9��Gh
���u�R�&���v����q�X�e��䎉ڂ7��<�Dqs��*>v�:�ύ��p���Hv0�4�8�Ce8�>��A��3I8�\cYrL�X������b
��$���'�M>�t�)}X�~�W1f<Zf��ôb�ĽY�L#N�����;4��JpCČ� ��~����i�?@U8t7�8u��F��XM��'S��xq��I�
��D)�&��~Q����m����
 ��É��|/"����j�n��r1a�U>]���1]/>>d_���xu���)W^f��l����E�.�K�}�9pM����Vf*8#�ڐ2���1+�+t<[���)�gY����bv_\��1����KZ���z����h5���n^�u��.f�����-�pD�+�v��xD�9�Y���<\�=:�:��b0/��ɔQ�(�Y��dq;�4�r�Z���
�b��:�Z"�*h��!��g���]�8X$�=|\=L��n�}�a��Ď`^�������"���"y7H��K>�@�"�5*�v
p���	�G�
�����cT���X5�
-ZE�H�E����
U�),ݚ�!Dl��vPu)��Υ
ܔ�Y}EH]B��� 
V�^��
-������W�~*��WC
'�bj�oU
�+K�hX,�  �yGB�M_�j�.Cz�B�(�ck�'�f!"�帛���M�a�:�Ph�GD�m
-ˇ�k1K�3`V�M�j�#�bTݦ�B�ɗn�
-�^�.nA8妆��Ч(7ʺ��xP�h� �8��q=
w�r�x^�S
�
3
5m��<�\��x��\ص�E	4؂�P.��'*������\"��*�����%��F�V��dX�(E�p
���U.�7#��e�G�`M�Ɯ�]$�D�B����.���k`
�J��U/��r�x��Ǚg/�w��[�*�
��x�Xy4p<��A�*^�7�u�x��V��"t�x	���e�hE�UgT�8���N2 �È�'�5�G�䐰���
��!��k�!���(A���E���F(�Q�+��(;��(�i�A�_�⡃�
-�Z�*�5�Y�v&e͕!U�}��}�����r�-��)���	+�ܧg�ܝ�g���9cϒ3���ߑ5��?��XH>:�w8܋=�T�Yn�����H��:+<����9�Gh
-�+
�,N���+�#�%�X���6��#RPQ�W^�j�*ñb ��֍��ZW� p����c�*�f��!p8���}��f��a��
�Ic/���`��W�p�s��!�e�ň�K^q�������qߥ?f��
�U&b[�A���pV8��mM� �mM/B��5A8�����6�n��
��*ns�L
&�G��FMԫ0��1������Ǣ�ƠXt�A�p��m���qf'��h����1� M�|�6�-d
�,����PÈR.�U#��6��}FQ�\hc��@������v
,SjgOK��X���6�),����c�7~����
ݑ#���42
���Q#ì"�ۈ0:b%v�)aD�FF�$05i_�6T9��\���F���p��%��7l�K�W
nd.��0� i�����kd|�2LGod�
)��{�:��!����L1j#ð�Y��/��D
P���"tY#��/md�z���x*��
-�,�v�k �	�p�-
-#���D�-�!�U��wء�Tۺ���\�؎iN�z��W ��M�7��
�{Ņ�%��5�0�a��w��ަN}��Z�M�ϟ�ys�
����Ҵ݉
�Z�c�ԸY;�M������'ߙd��W}��%2�^��,kr����6w��QE��-�]�}�^?��ի�O�2����U�����M��v�r�f�"��e��ޝz��O�l~
-endstream
-endobj
-2758 0 obj <<
-/Type /Page
-/Contents 2759 0 R
-/Resources 2757 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2750 0 R
-/Annots [ 2751 0 R 2762 0 R 2752 0 R 2765 0 R 2753 0 R 2768 0 R 2754 0 R 2772 0 R 2755 0 R 2776 0 R 2756 0 R ]
->> endobj
-2751 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 694.926 201.372 707.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2762 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 681.422 201.372 693.417]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2752 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 582.91 201.372 595.308]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2765 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 569.406 201.372 581.401]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2753 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 470.894 201.372 483.292]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2768 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 457.389 201.372 469.384]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2754 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 295.366 201.372 307.764]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2772 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 281.861 201.372 293.856]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2755 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 119.837 201.372 132.236]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2776 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 106.333 201.372 118.328]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2756 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2760 0 obj <<
-/D [2758 0 R /XYZ 89 770.89 null]
->> endobj
-2761 0 obj <<
-/D [2758 0 R /XYZ 90 718.682 null]
->> endobj
-2551 0 obj <<
-/D [2758 0 R /XYZ 90 672.057 null]
->> endobj
-2763 0 obj <<
-/D [2758 0 R /XYZ 90 667.574 null]
->> endobj
-2764 0 obj <<
-/D [2758 0 R /XYZ 90 606.666 null]
->> endobj
-2552 0 obj <<
-/D [2758 0 R /XYZ 90 560.041 null]
->> endobj
-2766 0 obj <<
-/D [2758 0 R /XYZ 90 555.557 null]
->> endobj
-2767 0 obj <<
-/D [2758 0 R /XYZ 90 494.65 null]
->> endobj
-2553 0 obj <<
-/D [2758 0 R /XYZ 90 448.025 null]
->> endobj
-2769 0 obj <<
-/D [2758 0 R /XYZ 90 443.541 null]
->> endobj
-2770 0 obj <<
-/D [2758 0 R /XYZ 90 372.81 null]
->> endobj
-2771 0 obj <<
-/D [2758 0 R /XYZ 90 319.121 null]
->> endobj
-2554 0 obj <<
-/D [2758 0 R /XYZ 90 272.496 null]
->> endobj
-2773 0 obj <<
-/D [2758 0 R /XYZ 90 268.013 null]
->> endobj
-2774 0 obj <<
-/D [2758 0 R /XYZ 90 197.282 null]
->> endobj
-2775 0 obj <<
-/D [2758 0 R /XYZ 90 143.593 null]
->> endobj
-2555 0 obj <<
-/D [2758 0 R /XYZ 90 81.969 null]
->> endobj
-2777 0 obj <<
-/D [2758 0 R /XYZ 90 77.486 null]
->> endobj
-2757 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2786 0 obj <<
-/Length 2283      
-/Filter /FlateDecode
->>
-stream
-x��[o�����+�V��s��-M7�n��6q�-Q2Q�T(ɻ���E��$k�E�}1%�sΙs��C
-#*�y���#l?��o����
2���v
)n���m��K�c
��j�ޭ���C6�һE~_��S�p�>%����H�T���E�^��f��_VL2�

�*����������pDjR:�,G����)�� �3����e�)��"�y���&�&�IoR� B��(���X�n�G0�R
?&��e>���)ZH�F
s'�a�m:Km�V�a���ℐ�v�v���,�vp�!��^�5��)�†��xϢ�/ʋ�
'���d�C��d�#LL;�Rc��	��ϋ:N�c���lfq�@�0��n�1{C(ݐ��
-?�ֲ� 7�n~�����HJ
���`U��ޙ��Ŧl,�{�8GT�V��!_�y©�,$���Z��Lw��
�����4��t@�H���<)��(3�����*[o����%Eٜ�o�*��d��W�x�
^�E����M��!��7&F &�D",Xmֻ/�le=��%
;�Z���o^R$�E�u/�c���
�}m��@�KF`{N.��m=���/�ۓ���d,U��Ms�y#᧶y{�EA.W��
-
-H��z_$
Ǐ�"��}_%LA�,�bs7�ы8L������^�
�#�
i�B:� M��=�GD�a9�%�
������**��M��C��)d=y�����%b-���ⅅ��?��bR.W���/��U}���5ɻ�)�c���̮���U��a+��'9GX�
�t�XjX��,<�tB�oH�S&�lW+@�C���!�c`� :�/�u���
-��A��`n|��/X���|C������g�J#L՛��ޱ�%��
{5
-�!	�o���
-2
	��1�QОĠ$���֗S����:�����^FA�;�Q�����xՁD����+��')��ꀕ�Q�����X�T
-�,<��B�o(�S&M��,QqV���C,�)�BX	i���g�\"/�}�K��\��..ѯ�%��^W�H��\�W;������WX!���dK{�йnj���
ۛC���0��/�lP�G%����2Ët�ı�fJ�ҞĠ��AV�A)��ZP�y�e���(YPzq��
Hd�K�����y��r�%큒���X*IP�,<�B�o@�S&(m +��xIC��
Il|۲E�Z�Up��I�J"ً�פ��
�Q�FPv )@S�h;�v��F�0�A�ֻ�2�K�]l{�9���t�m>gY10�ܹ��^._e?��ʯ��A�;NI�R�+�t�E�@���'1(f1hӸ}��v��A-f�<�2����
�,f�8TG��JdD��d��,*����a��c���}Y.��&�bG)�r�dV*��*̡
-
���(KJ$T�Һ���L�Z���"�=
�wĸ	a�}�1��]�5�P�1H�b@-�)�|����d�
_6��9�8$�r��f��� +�`ޘ�C�@i���M8`<�����(��OwbE; J NY�5�_f�f�����Y�X�P'���L�v��i"P�6��n�ٷ��9&w
��|�P� ���&�Q5
���Qyɛ]
���lxu¸5K�<
I�p�|���VE6�����_��B!���3/��{��r��;�t
-7�
��VJ4ܤ
tE{��M��AZd�=�Aٔ��*ao���Ӣi�A/C�}o|#SK�/����L��u|�̓dJ, ���b�O�F�o ·���@�4V,eW�/���
<��g�:�v�|�g�i:��z�
�0fl�]o�}a� 3y�hl��&hǷ�����P��<��uHgP-Вۋ-Ё$���@m�^����Ǽ����ݗU���:A
��]#ȬC�#��4���?��s�$��> �k�|5WO��\��e5����p���E
-
�)=�2��G�S�3��<��W�S����A������g�������
�n.�u[L��rv��%�m�|[��U�����g�o �ީ{L�!����ؖ=��б�6Ų��AJΐ �'�uǐ��
��ϗ�� .:ge6�Cl�
��_@���;��P��Jٹ?�j�B�ýp�B�t/^5��O�R�&��g>��|�Λ
�[:��|L'ͩ_��/�q���J�m��?�6�hCH�ł l+�y=��,k�\��?Q��#�՝�@z0��q<l6�����o�묘#���b�
�?D�����eYu7
pr���P�t�	�"��y��?a��D)������lNܼ_���%�d�����R
-endstream
-endobj
-2785 0 obj <<
-/Type /Page
-/Contents 2786 0 R
-/Resources 2784 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2750 0 R
-/Annots [ 2778 0 R 2789 0 R 2779 0 R 2792 0 R 2780 0 R 2795 0 R 2781 0 R 2798 0 R 2782 0 R 2801 0 R 2783 0 R ]
->> endobj
-2778 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 644.071 201.372 656.469]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2789 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 630.567 201.372 642.562]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2779 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 532.055 201.372 544.453]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2792 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 518.55 201.372 530.545]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2780 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 420.039 201.372 432.437]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2795 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 406.534 201.372 418.529]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2781 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 308.023 201.372 320.421]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2798 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 294.518 201.372 306.513]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2782 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 172.096 201.372 184.495]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2801 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 158.592 201.372 170.587]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2783 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2787 0 obj <<
-/D [2785 0 R /XYZ 89 770.89 null]
->> endobj
-2788 0 obj <<
-/D [2785 0 R /XYZ 90 667.827 null]
->> endobj
-2556 0 obj <<
-/D [2785 0 R /XYZ 90 621.202 null]
->> endobj
-2790 0 obj <<
-/D [2785 0 R /XYZ 90 616.718 null]
->> endobj
-2791 0 obj <<
-/D [2785 0 R /XYZ 90 555.811 null]
->> endobj
-2557 0 obj <<
-/D [2785 0 R /XYZ 90 509.186 null]
->> endobj
-2793 0 obj <<
-/D [2785 0 R /XYZ 90 504.702 null]
->> endobj
-2794 0 obj <<
-/D [2785 0 R /XYZ 90 443.795 null]
->> endobj
-2558 0 obj <<
-/D [2785 0 R /XYZ 90 397.169 null]
->> endobj
-2796 0 obj <<
-/D [2785 0 R /XYZ 90 392.686 null]
->> endobj
-2797 0 obj <<
-/D [2785 0 R /XYZ 90 331.778 null]
->> endobj
-2559 0 obj <<
-/D [2785 0 R /XYZ 90 285.153 null]
->> endobj
-2799 0 obj <<
-/D [2785 0 R /XYZ 90 280.67 null]
->> endobj
-2800 0 obj <<
-/D [2785 0 R /XYZ 90 195.852 null]
->> endobj
-2560 0 obj <<
-/D [2785 0 R /XYZ 90 149.141 null]
->> endobj
-2802 0 obj <<
-/D [2785 0 R /XYZ 90 144.658 null]
->> endobj
-2784 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F99 1084 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2809 0 obj <<
-/Length 2904      
-/Filter /FlateDecode
->>
-stream
-x��\[�۶~�_��J3�;��)MݎS'u�m_�̎v��j��D;����H��D�z:yY�������
ji2Mh�?�޼���IJR�ur���412%J�h��4�v�����Ж�T�!����x���������ۛ_n.ф��16y����3M&8�}B�Hm���4O$�|N�������?	W�������M	�21L�Tm�
�
���y���C��ב���������̨%0�əi�0���/*k�&:�DQuJ*�f$U�&6X���ͤ$v6���`��u0p����8�S]�%Ӛ��T��}ʆ#����+ `6���l�������)?U�=~t���/�3ِ����u��̖�pn���ƹ�"����ӄ��r+D�HAc�.�Ā:+	S,�0�v2
1†�Ά��E�z��i�^E�=��y�
o��p�|���`u�t�A`�?�	���
��q`E
�tE�̓�$[,糅_�K��O�fd���#���u�
-�>PE��-����s�v0r��MζOŨ�C�[v�۲o}��#0�c�"�^m�v�A�("��j���-
Q��%~��C��L�rAF�F���>��
l_f���P�4 8��Ie�du�D�I�}��u�<V�=������ 8�JlHΈNUX�7���6?�&w߮���;�n�3c�*f�d�#�����m[GN%�T�4� �񺅄@ Ѧ�B��Ӕ U����i�t.�܋J�`��&�*�lH鞓E�Ps��A��eŽ.�rb��a�͹�ց4#֪��,O��H���i��4r+�Dq��i�9/h��&3��9܀�G�0uL���j���s�¯7N�L�C����PI�-�3�e���c�?!�PtP�f�b=�9Kx ���
"%B����
-(OOK�����<

 ]a]��!K+A8���Q��<>�����]9X�&�H
V��||\m�
��b�=�4') Y�|�
gHoxU���ٕӟ��ɺit�	��(�+�+Y
�yv��Gv�y�Հ�
->(i�r�傌�
�H?�(2�4�~
e���g�Ͱ*N�,��K��mU�0�_�]ǿ�)���f���h�~㻢F�t�M�ԑ�H�h�ռ�-�����H��d�x�YӽNE��6v��{���2�v��$�X��>�E��q�$��%�`V�f���uB�Ɉs�h^�}��t�@�5@����l#��k��d)
�S�4B�^]$�q����W>I��@&=u�������l�/���n1�ֹ��Br�[<�lğ��W��b*�I��}*ԙ0��=�y��^�R||�3�
-ڦ�e��
f��lN�nP2E����
@I��
 
k��,kъ%k�1��>r���DŽ��
S�2�!t�*�D�8��XU�Ĕ���N$fO=���
/Bbnv���l��^�c^?�v�8�����-1 �H����(T��;��S�f�yY
��鴃��L�Ev�Ul�V*%���<�����1{�ӌ��>�7<���j�DJjc��j��xL��E��4�d�Pã�_@���"EN|�
�Hc�$F�1�c�4��EcF4PAc�,t
�Y1�o4fGS�Fc�jx�z*'��4f/�giL��"��iLV�15+Ә���1�^�NE_�"{�hx��tM@
ex%����/$2��4��
E?�IMM�
���&��)CP�Ցk�)�B�:�9}j�13��htjb0���
؂�Ra�{��+�q�=�p�D�]��^7�]ü�L���ќ�ϼ��l��� i!�E�mx>:�`V&��@l�����C&`e7١nr�Qr���m�\�Zxp���`��{�j�8DN�y���$��
U���
U2�R�7���p�&Z�Ӥ�c9�Hk�iT�H5�66$6f�O�"O!J�-�v�h��pqY�(9szU��en�*�OKM �E��d7�h��h�O5�^@h�à�����}�������_[Kl�U at 0`),�
-�S�g����sI�.�?ly	���� Sa��0jj^��疡 �ɡF���,���,�J�sÉ֦y�S�F����	�~�������9�k�;Nj���'֎m}�[�%l)M
�D�b[�F��ow��
E�S�f�������F�_��7z����ϵ
$�xL*4�� ;�!a"�#]���L��a�u��iF]I��A�[��$ஞf;< ���p�%�qJ�V�i��~=�T_�/�N3����Y�	���|�\��
�D����h)�
▲�s/�,&�K�O�R�g������A��*0��J�|+��Eh�.K��Q3ʫ%v�D1��-
-(f,Qq_��/�{�B_r�U��Ŵ?����G4Pш�Y�FT�
�F�@��܈B�o؅o�!�V�n���P(�}��u
k���g޵�����K��G:ވ|�ԑ��'��4�E$#��c��Nϖ>� 6Ug8.�v���
-&�華�F
�ZL"����%�HWK\����ֺz���=H�%vw�}d�mk��
Uk����m�‹��Z�Z�cډ���kkɂW5���%t��av�Xu�m-�����ZF��;��B�ed�?2][����/5�0�U����V� ?������l1GB3
���D�����V�y��
��Z;[�ЖΖ�$Bi�+}-'.�i~����5S
��U����V�y�lnlA��%�}c�=Pmly�g[�R�.il龍-M,6ѩ���
-��?<0u�����%��Xm-�
��m-%����2����S��w��\\�?z*oG~��
2*ʌ��b���X<��x�f.�?-!� ny����^*� 5�r?��T��w�ކ/ߏ]

�J8�v���'�ћ�6[
-�ȵ���ֿ*5���Ƌ]A�8����l}������5��,˭����L�z�=Vy
-),�w�O�����^�鍊l1%(;�]��ac��L���EQ2_%�l��s�{�����{�f
-endstream
-endobj
-2808 0 obj <<
-/Type /Page
-/Contents 2809 0 R
-/Resources 2807 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2750 0 R
-/Annots [ 2803 0 R 2813 0 R 2804 0 R 2817 0 R 2805 0 R 2821 0 R 2806 0 R ]
->> endobj
-2803 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 618.662 201.372 631.06]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2813 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 605.157 201.372 617.152]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2804 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 406.471 201.372 418.869]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2817 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 392.967 201.372 404.962]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2805 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 166.929 201.372 179.327]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2821 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 153.424 201.372 165.419]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2806 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2810 0 obj <<
-/D [2808 0 R /XYZ 89 770.89 null]
->> endobj
-2811 0 obj <<
-/D [2808 0 R /XYZ 90 720.814 null]
->> endobj
-2812 0 obj <<
-/D [2808 0 R /XYZ 90 642.418 null]
->> endobj
-2561 0 obj <<
-/D [2808 0 R /XYZ 90 595.792 null]
->> endobj
-2814 0 obj <<
-/D [2808 0 R /XYZ 90 591.309 null]
->> endobj
-2815 0 obj <<
-/D [2808 0 R /XYZ 90 508.623 null]
->> endobj
-2816 0 obj <<
-/D [2808 0 R /XYZ 90 430.227 null]
->> endobj
-2562 0 obj <<
-/D [2808 0 R /XYZ 90 383.602 null]
->> endobj
-2818 0 obj <<
-/D [2808 0 R /XYZ 90 379.118 null]
->> endobj
-2819 0 obj <<
-/D [2808 0 R /XYZ 90 293.39 null]
->> endobj
-2820 0 obj <<
-/D [2808 0 R /XYZ 90 190.685 null]
->> endobj
-2563 0 obj <<
-/D [2808 0 R /XYZ 90 147.376 null]
->> endobj
-2822 0 obj <<
-/D [2808 0 R /XYZ 90 142.892 null]
->> endobj
-2807 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F7 1174 0 R /F24 301 0 R /F8 437 0 R /F13 1173 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2831 0 obj <<
-/Length 2880      
-/Filter /FlateDecode
->>
-stream
-x��\I�������-`�k_���qO<�cwrq
v��&"QJjOϯϫ�I�Z�� �� �*�z�꫷}�q2Kp�?�޼��‰AFR��>&'�$$�5M>�F��'c<Z��"�[-�/OٴL���}��/c�G�Ø�Q�dL�hY�'T�ћy�^�ۏ�c�>ˊ�
Dr�h3���Ǜ��7���	'�� ��������8�������7h�p��:O>������WD�����HM��a�E2ܯ�磴L��*IFk�מ���?����V�5�
\�D=kk���1&�F"��!�0� #DG��6mX�p��Ya������i�
<d*")<�Rل6���z�>e
��c*  yz?O��i�ɦ����T��G�¿1�ExRf�t�/�?
^� �+6+��Њ.�cKsD��-��f
-d*���{:��ˬ;�uuƮӧc-}j��EV��e��\>v05_ZL}�����m1͋��1v��z}2�.^�0H4xQAc�.�D;E�
�H�H��J �Cٞ	����]S��a�]��&�.^�0@@��-���=�B\��K� vr
qX���H�0#~��Y�\���Sw�:��k���9 F��b�,��g����X�x
����i1�7>aH�vD��y��:��Ě�3qX
魍��<��%�38,��?��o���4{
��o���|��
E'
�K7a� �F=
�
-</���~S򰷿>d��۳�y�	��6��ߕ8�
�ė�<��i.�G�+�J��5$��#
-y��Qf�ck���,H���@.W�0
-BK86�1�3�����嘩pl��!�8��$x����wh)�Hc�@`�
�Z�1H���о�� j��}*�낢�A�?�EBe�4$gH(�K���L"5Ң�����2�� ���`Ma��m.
��
P�V��>��
-��I5�"��
i
�"���z�
�
iS�r�{DN��������Ns��u���������ߪ|��J�1��im��{{�8��}p��2Ā�_֫�N�i��L0�
�Ⱥ
k�
�,��b��&�~�J��%��K��y8�X��*S����U-,8p���,jC8-���5��{Q�Q�9�X�*M�ѦVy_9
-�v����s�m�
���!��Q&
�Ugr��O��e,�m�1:j(d��e�fvDV@
1�s��}M�b�G���;���!�۟�h��[F����Q��g��ܺ=T��
�yd��hU���
��In,��1V#�j��l�F��G�zOH���Mw�^��i���b����|��xկ�--¸�y����[��m��e�=�5X��J��� ^�QZ�~���~>�6�ޗ�!�=+[���D��N3�؋'R Ax2�
:4?�"g���f�Y�Eo(�wQu�i+���
ʼ@@�,��F{4� 9Av���L�D���M���>еR9�����<��=�v��ɶ�N�2TU��UU��^�[��*Mu3V=��
Uᔰ
-E�	�1	0C����i�D�Iا�(4��l�:X�!l�`S8�<
�*1i�{.!g#
-R��I<L�y�E4g�%�+W��T�,�
,����;
ɄCv!p'K��Y�Q�����ҁ�A�u9Fʰn�Rwz�uH\���
H���fw_�$�4��NzT _���d.��s�'6@
W����Ƽ
W�b6�c
t�"�j���
�p.��e�ԣ���ңn^γǐn?���n>
dm����*s��}%ss�҇�"
8���-ѣ�+��4��Px�!åSMp,GAx�:� l�s{�o���U
�Z�@,&XbK�`�@@c�-
&�V��ƪX�r�2�Pi*s2�R泧-
-�r�j�1"qT�%�D�:ȀL\��j!.�\�S�vMu<���+Fy���jD<�, 
��]x0�
<?�S)5kbd�5��k�j�.�ĢR.6�0&]�
�
-<�J�-��&
D��� ӝ|f;�G�j�����&�d\A�0� �VߚJ�h��Ji[�bR�-4H���ѤR�T�}��F�(=iV�V��R����I�"<n7�ˀT��]��
M���ۂ,�a5�q
�q@!��.&���ԓDr��P���~�� A[���
�aoR{��8y��� @���BT��K�
tp1VQIO����I��
�����]es�
�ڲ���}��A�w]&�
)��xE7[�U�"�6e���LNd�.�î�v�
�.��y�-bRJ:l�E
7�"N�ER�Ē���k�"��
-�@gva�'h��Ǧ�����M~���z�/p�#�l�"���Tf
��3@q	��
ΨA�匠�W�}猢sF��Q.8#�0
�K��7�W�z��_�qTBZg�)�I�6�k�(h�������A�Ⱦܦ��
Gh#[��G�a�H�
`�5LIĵt�?�6�\B��@Qɐ���y��<@�����6���a6�̖At��:�F�~t�#J"L�E
]�GoG����8�|��X����s�[�C����J
Ql�`~	qt�:� l�s=qt���[
�2FGKt�
,Z����$����|��J]z����wE]��a��H�yL�Ŗ�1gw����Q��K�g�Fשӏ��:�״���
Ƥ�_1��^.�<�P�h�E���ё���]���ܙ��"&a���0"�BĠߚ0�h��0j[�B¨e���w��;a�M�����[��ɨ��
-�����'

�N��h*�����/#a��(��὿�1��Of���i1���/����d�O}�_��s��
1
-��SZl�1�L��f`Y��
A�gG�׃��,�ϯ�?Iu���F���k�?m6�?�~}����b�����w/������cU�,�Տ��
.
Q�}�1��
�
���{��Rԍh޻�Ã��,���d���J�d�
-endstream
-endobj
-2830 0 obj <<
-/Type /Page
-/Contents 2831 0 R
-/Resources 2829 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2750 0 R
-/Annots [ 2823 0 R 2835 0 R 2824 0 R 2839 0 R 2825 0 R 2840 0 R 2826 0 R 2844 0 R 2827 0 R 2845 0 R 2828 0 R ]
->> endobj
-2823 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 594.353 201.372 606.751]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2835 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 580.848 201.372 592.843]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2824 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 357.853 201.372 370.252]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2839 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 344.349 201.372 356.344]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2825 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [519.002 345.779 535.938 356.683]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2840 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 332.394 256.164 344.727]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2826 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 109.399 201.372 121.797]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2844 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 95.894 201.372 107.889]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2827 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [519.002 97.324 535.938 108.228]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2845 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 83.939 256.164 96.273]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2828 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2832 0 obj <<
-/D [2830 0 R /XYZ 89 770.89 null]
->> endobj
-2833 0 obj <<
-/D [2830 0 R /XYZ 90 720.814 null]
->> endobj
-2834 0 obj <<
-/D [2830 0 R /XYZ 90 618.109 null]
->> endobj
-2564 0 obj <<
-/D [2830 0 R /XYZ 90 571.484 null]
->> endobj
-2836 0 obj <<
-/D [2830 0 R /XYZ 90 567 null]
->> endobj
-2837 0 obj <<
-/D [2830 0 R /XYZ 90 484.314 null]
->> endobj
-2838 0 obj <<
-/D [2830 0 R /XYZ 90 381.609 null]
->> endobj
-2565 0 obj <<
-/D [2830 0 R /XYZ 90 323.029 null]
->> endobj
-2841 0 obj <<
-/D [2830 0 R /XYZ 90 318.546 null]
->> endobj
-2842 0 obj <<
-/D [2830 0 R /XYZ 90 235.86 null]
->> endobj
-2843 0 obj <<
-/D [2830 0 R /XYZ 90 133.154 null]
->> endobj
-2566 0 obj <<
-/D [2830 0 R /XYZ 90 77.486 null]
->> endobj
-2829 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F8 437 0 R /F13 1173 0 R /F11 387 0 R /F7 1174 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2854 0 obj <<
-/Length 2650      
-/Filter /FlateDecode
->>
-stream
-x��[Ks����W���
������:���#[r.k�
-!�AJ����3 )rvs�r��@wO���O�8�&8���_o..P81�H*�����Dq���o��sj�跛�	�#�%w�ݿ~�y��͵�������~�	��
�tr����N&p�c�3:yq-N|Γ닟.pm
-FT�K�Q�I�0B!���`�"&Fc�1N�l]<�1�"}
Q�.���&�ǬZd��R
¹vR6���h��x�6J�	���!��,�T}�E\��.�"�>/�u�:�"EW#FӖE#"�e�����̫l^��]OvMe�#���ʔ�U��f�bL˼G�1H
C1�iN�d�J�
|����K�NM����O��¿��(�}��#xD�VŲ�o�z[�mXo*g>[}ף�h$�晟�9$󲼽~]�A�ve*��Vc��W��>��!��s,�f+�L�P��P���q��oS͗?���Lh��WRD@�{�{0`Z�Fc�U�^���v���l��gEmJ �J��}&�� ���r��#��7�~)�3/��W���zk���嵟h)i�j�#�]����5��^�
lD�B�:FL�u"�r����)ZY�!,��(��C�DF�^Qw�:�I;��=Mƭ�ЈH�^�h%���<Fbr���ٵ��e�Wy�jFڋԆB1RMy�H����U��/�-
-�;�m�+�]���r�
_�^{r�PN	˫�,&�n֊���N�	4N��T C�r���VVe�|m���Pb�3а������ݠ%�m��
|۳G7B��D6L")��^�8�cJ��?�(��s"�sRTͰ���p�<3�D�P��c��&e����_Ͳ���U1��AE�"l"�.��7��_��j!��e8� QDͥ�}*��Ǵ��Kж4ܑv�S�n�]׍�`J�gNN�͹���˔�M
�,�$Z�̕�]����3N�J�,#IL�u
ʒ3��ϒ�
M����
�P��f0��H���P�K<�j�0�	�\H�zfy��}�h������.,4������
>�/ӗ�Q�����
��T��+Ѿ֒���X�2�<yf_�����{���\�L�����3
���]ן>-�r};vS)��
f�m|;�@)�Hc�?�H;�uc
�����
b�o�̪��
/��0�ӢjA
��
�R��f|'oR�om�0�/
a/��[����c=�;�H*��Bmy��3˪ B���
)�> ܋�9��냬N�n��`�-�hgۻ۫�ܑ<��K>�f^Nz�S6��0�� �d�B'��0�Uq�
�;m
&yF_�` �VeԮx�̃T'�[X��p���uR�[\'5lש ���y���u*LB
� ;
A=lF���c���G1Ւ���S������-�)a�
CT�!�i�gቩ�FxF"<U���b���=�J��
�x�@aGzj�Oz���I|�z���������g=�YT�g=���	b��
-%�f=�0�)�b����z�f|9�����=��@;g�)q?�iXwӍ�t2��9��'Q����P3��+3��Nh8&@�.�A!���&*��!'	o�:ϴ��q���\����%�D�t�,�e3
->ET��chB�y�y�9�I�6�|��t#�
Xjd�\�.�'
�g�㒝����Md�v�fI`�W%;O_�p�A��/�	u�ķ��L�r
��d
�.����/ ӗXgTD��%1*�iIA���f;#:h�vv<t�������Mw����=�h���,��N�����t��ҝT��N�6Hw¾�k�>��$�<
-<HwbPˢ�6�4T$��-��$͊���JŰ����p`��1��a99w�(j!����6P�����6U�iV��� � �0��~P�U?(�l�
�9T��:<�Z��:�m���Z
-�m���*�z�"�]��#����׭m�Qu�$��jZ�lhA�<-7}��e��M�+�{��Ƴ�4��W�6�FM�9*�(����`��|]��cX
�w��Z]�=������t��2����x!�D7
S��:���@��0Gn��:�a�3��Ŝ�
[̹��l�(G�f�
�R�k���~�����Q���
� ����L��%�
w
�rs�?"�$
-z7�Q�/ ӕI�#�ΖĨ��(�L~m��A����i�3pGw��Џ;�	�/_s��r���`��`~�����
�F'g���a6*���92b#듢��ti��Fz�Q���>�(W2�� �Q/����q�d
TR��`[h� 4oFQʡ1���Z�����2|�C�H���V����(IHME�@	��w��N Ϳ�:����/��
Xb��%;���%�������
W6Ln���z��<@�p�Y��7
|�7V������o��V+�=6A�q����=����
�Z�L�̹"�d���N�}�
-�:-���j��*Qw���L��˪B��U�C��D�܄�Z����;���
��m	�qc�7nn��֙-�G�Q��WW�����ų����SVN���
���|�`�l��_Vy����E��3+��%�
-~��W�
ue�	�,[�^�y�]���lW��
��` �۬��׏���{���r��m^V0h7�ǃ���1�eU��(�����N��}
 
-endstream
-endobj
-2853 0 obj <<
-/Type /Page
-/Contents 2854 0 R
-/Resources 2852 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2750 0 R
-/Annots [ 2846 0 R 2859 0 R 2847 0 R 2848 0 R 2863 0 R 2849 0 R 2850 0 R 2867 0 R 2851 0 R ]
->> endobj
-2846 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 543.896 201.372 556.295]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2859 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 530.392 201.372 542.387]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2847 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 530.392 267.79 542.726]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2848 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 331.705 201.372 344.104]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2863 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 318.201 201.372 330.196]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2849 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.234 318.201 267.79 330.535]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
->> endobj
-2850 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 168.132 201.372 180.531]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2867 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 154.628 201.372 166.623]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2851 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2855 0 obj <<
-/D [2853 0 R /XYZ 89 770.89 null]
->> endobj
-2856 0 obj <<
-/D [2853 0 R /XYZ 90 721.073 null]
->> endobj
-2857 0 obj <<
-/D [2853 0 R /XYZ 90 646.048 null]
->> endobj
-2858 0 obj <<
-/D [2853 0 R /XYZ 90 567.652 null]
->> endobj
-2567 0 obj <<
-/D [2853 0 R /XYZ 90 521.027 null]
->> endobj
-2860 0 obj <<
-/D [2853 0 R /XYZ 90 516.544 null]
->> endobj
-2861 0 obj <<
-/D [2853 0 R /XYZ 90 433.858 null]
->> endobj
-2862 0 obj <<
-/D [2853 0 R /XYZ 90 355.461 null]
->> endobj
-2619 0 obj <<
-/D [2853 0 R /XYZ 90 308.836 null]
->> endobj
-2864 0 obj <<
-/D [2853 0 R /XYZ 90 304.353 null]
->> endobj
-2865 0 obj <<
-/D [2853 0 R /XYZ 90 245.577 null]
->> endobj
-2866 0 obj <<
-/D [2853 0 R /XYZ 90 191.888 null]
->> endobj
-2620 0 obj <<
-/D [2853 0 R /XYZ 90 145.766 null]
->> endobj
-2868 0 obj <<
-/D [2853 0 R /XYZ 90 141.283 null]
->> endobj
-2852 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F99 1084 0 R /F60 304 0 R /F72 326 0 R /F82 428 0 R /F8 437 0 R /F13 1173 0 R /F11 387 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2877 0 obj <<
-/Length 2581      
-/Filter /FlateDecode
->>
-stream
-x��[[�ۺ~�_���@��N�-
-�i�4ғm_҃�����eG�����E�(�wn�$Y����\�o$�d���w?�߽���I�RIer���8Q<EB¯I�e at 0l8"��:+���z�x��2{X�ˬ|*<@����!уU1
Q�Zd��;�9��� ���HJ����{w����N8!N��N�˻/��d�?$�T'�v�2��q�|���
��i��
-sj~����S�1Oa(�n��?de��+�$l�^{�{gؿ�n�{{+��q��L����d��@D�4��D�cRa4A�
��ڴem�	�D���:{��ʸ��!{I���ȶ)QJU���,w.��+w�z����ߛ̗y��׎]�2?�y�X��G?t[�WŦ*�y�O��%
-"�a��ˆd8��]/񲸔��k�7マ�uf?�g��
���6��
L]�
?����;P�^�#���t%��Z�u�s2�<y
-��<XN���{���\��%☹�z_
9��^�'o�!S����z��K8,N������lo���v�b�4L�@`�:ڵc
��-��W(NT��
��r5�b�lR�T���Y$ܶ!9E�v�T���
-�Cv ]�����k2�h	g�Ϊ��¤ )!)U37jU����ݪ �9cw�9�b���b8ό���������j��A�s�;�`0`���́.-΋��3���WU�w�fH=�TBe)b�:
� rS�r������T�(ڂr����
-p�o�9�|3�g5��_��3��Ls+V�GMKQ
-�^���
%�8B�!@K�
��^�cApŘ
�N;�;<;
���P
-�i
�Tф�瓼��}���Jb�Ǥ�� ���|Z�
��G�CZ�:Rz@�}�
�J�䖗�ƃߺa�F#F@%�#C��^�� �
I"�%�L�b" ;"0�8SnN�C5�KK#��$0]
-Ci��?�,7�U>5{�_���Mz�c��aպo:@3���q$ȩ�\7"��$��(E�5��[�T��#�z���#
�� �W�|�]t��)(�ʸ�����!
-���E�<S�

���L�
~̫�<�-	ɝ������h��ܹv�J��t���׽h��Q�s$�&��1D���Kt�
Pb�T
	�KBV�
�!km�)�x���1��
��10���Q�'=��r����� �Jw�R�dqOA�`��
-� P��
�z��
�T��<�yql�֋9�^)��H�ω�9�	��.���6%������aɡ<��
-?��4�rV��0e����f�MM��M�*]ɀۮ��I�]>B>�#
	��8�E- �Y�j�B�-u���
�sQ`���6���,�<�}�e����D�R�
�j����X�dKm��~(����I��^�S�xV̿nsS����\��C�H�@����/k�p�wNH��J
�J�^A�K9� ��@-�Q@���ۂ� �h��Ա�u
��
A��
 &I,����]
�۠ݬ��
�e5}�v�
(;��`̙�����pԙ�q#��'1̴�BU7b8�6b�n7b���F
l%�J#V	~[#�f�B
O6b 
Reza6��ӟو٘
��ڙ�@G�` 6�\�!Bw")�R�w
�$�gT�S!���l�E���2ն�|IN�a��a�/��#Z�lK�|�w|�Uy����gE���@z�ۗ㔞@�䩡� 
��?O$q�?��L�?1XLG�-�Q�)ӂ���q��h�t,t
��q��~6�>�8W\����@F;.���E�I\A
eiW�[q�����+
��1���"��L\�M�j0�y��BUC=����z�c���J��TG�VQ��\�6�s�?7��$�Cp
-4 w
�g�ΤL"Řr��7����|��#.�`���Y�PP ����{�C ��ǂ���h�ǂ�#���I/
dHPڙ�pV-r�������k�ͮK�8�b��Ϟ���|�L��㪦�v��ި�^J�BE��*�A�<�ǹ�[]��e��J#�P�
{@)GR�����EߨEo3:Т� �i
��Lv�����[O����z�o65���=�
-���J -jJ�S
� �p
H��LRR<g""�iI�Cu0FR@�)�
-��?�Ŵ�=�+�!�R>\Id".�&2��_Gd��D�1Cd�HM�7��S�9^9i*�+'�+'�R
ܲ-���VH�9ζ?�E���P�MTp)7C`��k�8�&����ƽ�z���}��<4�TS�n���*؅��]�#��$R��{�̓L�@�P5.i���i���ιL+��L�czϴ��#1���L+P�ӊ1�gZ���0�s�L+��(ӊ1�gZ���6_
�˷@!���[�����ɷj���.�j�d��g�U��h��U����#(R���o��dn7�ܥG��Hu���ѝ|h}��|̊�6����#��ɾ����M^�f(���Y����l��e��?�ϻ�-���y��[�I}��;��;�	�a���YU�����v���ƫ��
V�]���Sm���p�
���
0Cu 6���7
��+�"H���s{�~�_x�~ɒ?�`Ov���
u

-endstream
-endobj
-2876 0 obj <<
-/Type /Page
-/Contents 2877 0 R
-/Resources 2875 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2893 0 R
-/Annots [ 2869 0 R 2881 0 R 2870 0 R 2871 0 R 2885 0 R 2872 0 R 2888 0 R 2873 0 R 2874 0 R ]
->> endobj
-2869 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 643.369 201.372 655.767]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2881 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 629.865 201.372 641.86]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2870 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.509 643.25 484.697 655.767]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2871 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 443.532 201.372 455.93]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2885 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 430.028 201.372 442.023]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2872 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 331.516 201.372 343.914]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2888 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 318.011 201.372 330.006]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2873 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 166.394 201.372 180.341]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-2874 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2878 0 obj <<
-/D [2876 0 R /XYZ 89 770.89 null]
->> endobj
-2879 0 obj <<
-/D [2876 0 R /XYZ 90 720.814 null]
->> endobj
-2880 0 obj <<
-/D [2876 0 R /XYZ 90 667.125 null]
->> endobj
-2621 0 obj <<
-/D [2876 0 R /XYZ 90 620.5 null]
->> endobj
-2882 0 obj <<
-/D [2876 0 R /XYZ 90 616.017 null]
->> endobj
-2883 0 obj <<
-/D [2876 0 R /XYZ 90 545.286 null]
->> endobj
-2884 0 obj <<
-/D [2876 0 R /XYZ 90 467.288 null]
->> endobj
-2622 0 obj <<
-/D [2876 0 R /XYZ 90 420.663 null]
->> endobj
-2886 0 obj <<
-/D [2876 0 R /XYZ 90 416.179 null]
->> endobj
-2887 0 obj <<
-/D [2876 0 R /XYZ 90 355.272 null]
->> endobj
-2623 0 obj <<
-/D [2876 0 R /XYZ 90 308.647 null]
->> endobj
-2889 0 obj <<
-/D [2876 0 R /XYZ 90 304.163 null]
->> endobj
-2890 0 obj <<
-/D [2876 0 R /XYZ 90 245.388 null]
->> endobj
-2891 0 obj <<
-/D [2876 0 R /XYZ 90 191.699 null]
->> endobj
-2624 0 obj <<
-/D [2876 0 R /XYZ 90 143.826 null]
->> endobj
-2892 0 obj <<
-/D [2876 0 R /XYZ 90 139.342 null]
->> endobj
-2875 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F11 387 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2904 0 obj <<
-/Length 2474      
-/Filter /FlateDecode
->>
-stream
-x��[Ks�8��W�T�����yd����f�\2S*Z�%�H������o %��d=���E� ����4N�	N�q���ͫ�N
2����>18Q� !��,��:���m¤F�Hx�=��߿ܾ����m�y}{��
�&���@J'��ͧ�q2��o���ɳ�J8ep]&o�s�U�WD����FAM:
-j�0�"
�y?�<��l�o�zDH�vz�I

a��7ڶ��a��0Gg&���:2��@X#�H#���T�M��'�[�v�MF�0F�Po�7�!CI��Z��$R"CU���"���i����uw�ս���i�<+Vy�.�r�o*�f3t|"�HD����e�"���.�x��IX[ʵ_�ן����Y�����YRpd�Q�]T�g�$�H�]
<B��ہBp"=���/Ѿ֑��(�7/�Γ�`������a�g�K����%���z����b�G\�U=�.^�v�ֈb�4�8}�$�)ڟ?c
���(6�I0��E]��H�Kpu���FF����N�^�d� .H��V�G0�Ft����I���P�PM�#!�q9�?����q�
�=��H�馪���@�r�V+��T<V)����9M�ގ<09Ν붓�>O� ��;�a��
L�P�k�})^2����E�2H��7>\#�x���hդ*�3Dg�1x'��lS<�e�v �����_Y���a��a�Xa���"�� [...]
-��{&���b^�U�
�xZ�[h@�Q`)x����N[�$�{ED�n_��{��	a��ٺ�v+��u�4DO�P��[�;�w�g0FP���͢XjC,�u�m�����D�g�`��Hf�� ��5�Qڜ�YVΆI���Y:��¶�w���?l�K��h�N�8��O!��8"zK:���Q
7a���)�a�

5^~�P	���""��H��(ȅ�+ �0��ԛr�q��-����z�T:�|���]��09ضA��rE4P
�z�
r� �u�!_�
�$�&�
\n�jV�m�DWͿ��rZ�
 ,�-�Q���pأ@"�ָ^_��RȬ�a�%�7�5�_��
h�0�ӝ�$�+
�$�e�j��g�
��k��C,t��q퉌}�z�֡?���?��yK��64��I����q��Q
�\q1ס�L�s�Zpa+���Ő�d�Hv��K�#;�Ovl�ܑ
�u���f�R��%;��P��`rgx�'zßHv�|U�ۧ!�#�êTd���PE���j��3��H�ްA����%D����P��E�|=��oX֘a�[�������{=@�(�XJNf^�G�x}h�Ѕ��1d�eK"�Z�O�� p�7T����Up�V��� �@���.�&�R� � 
]�C=�MKA�
�p�OD�L
ٵI�Ov�����OT�Tf�D%Pf{��'j�S����k�6	i�/�+M����G�]<��:_?T����1
Wx���i��:�0�r
�y �����/�x�aV��^}`�!B��� �{8����
�Q��
nί>���
Բ���.c'�9��T���Bn+
��';�#(
�6�>���U�yss��	
��O+i?A
P,��kPI���dE��b�
1��$�gp�v
ș��-r��m����#�52_�@�,أG�D�	�R�Ig���w��ײ -Y��	,��8�
[(�
�)�2��L�t�C�|8x�	���2.�/{��{�}q(��rb��d8l���g_c�Y���S�UQ%
y�P�
-6����AP>�8R���02��7�`�(���x8a���\���26dN"s�5�n����K*��A�s@������Vm�l�{
�3D�G�))�I��(:|��p��*�Yz�G�5�

�p�����4��`�'=A�!�AJ�^9���
*��2R�ձQ������)_A�C�DC��1QiGbTT
-�"��5(�h���
t(�Z�1p�I'v
�j�U!:��:�6��7�8u���� �t>:�/A���A$�$i�z�U2_D��ۭ�G���YP,gG��\8��z�hE
-��a�]����Do�Qbn|~h��k�L�*�Z9$T�H�
�]�a�ۇ�v��
.�c�f�P>���G;~���%N��S����ÝC���S���jH
�,N/���4
K�?� �
�66���wv>�VE[�o?'?!�7��!��M��
E�elD�}:M!X�S�ݢ{&��0nc�	q

�lc��5��4^�Y��
-��čA�x'�M����V�����A�z��������B����wY9��M�7%�{[1�.��y�7��U�d���Ǭ9`�n�p�[(��0�����u?�?�3��[�� �Rڮ�b�y���Ww��u^�ѴZ�����J!�K���ͪj?M)Jx�r��{���&��
-endstream
-endobj
-2903 0 obj <<
-/Type /Page
-/Contents 2904 0 R
-/Resources 2902 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2893 0 R
-/Annots [ 2894 0 R 2895 0 R 2910 0 R 2896 0 R 2897 0 R 2898 0 R 2914 0 R 2899 0 R 2900 0 R 2917 0 R 2901 0 R ]
->> endobj
-2894 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 641.82 201.372 655.767]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-2895 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 531.353 201.372 543.751]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2910 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 517.849 201.372 529.844]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2896 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 505.495 201.372 519.443]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-2897 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 383.656 243.45 397.603]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2898 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 331.516 201.372 343.914]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2914 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 318.011 201.372 330.006]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2899 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [449.509 331.396 484.697 343.914]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2900 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 196.436 201.372 208.835]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2917 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 182.932 201.372 194.927]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2901 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2905 0 obj <<
-/D [2903 0 R /XYZ 89 770.89 null]
->> endobj
-2906 0 obj <<
-/D [2903 0 R /XYZ 90 720.814 null]
->> endobj
-2907 0 obj <<
-/D [2903 0 R /XYZ 90 667.125 null]
->> endobj
-2625 0 obj <<
-/D [2903 0 R /XYZ 90 620.5 null]
->> endobj
-2908 0 obj <<
-/D [2903 0 R /XYZ 90 616.017 null]
->> endobj
-2909 0 obj <<
-/D [2903 0 R /XYZ 90 555.109 null]
->> endobj
-2626 0 obj <<
-/D [2903 0 R /XYZ 90 484.175 null]
->> endobj
-2911 0 obj <<
-/D [2903 0 R /XYZ 90 479.692 null]
->> endobj
-2912 0 obj <<
-/D [2903 0 R /XYZ 90 408.961 null]
->> endobj
-2913 0 obj <<
-/D [2903 0 R /XYZ 90 355.272 null]
->> endobj
-2627 0 obj <<
-/D [2903 0 R /XYZ 90 308.647 null]
->> endobj
-2915 0 obj <<
-/D [2903 0 R /XYZ 90 304.163 null]
->> endobj
-2916 0 obj <<
-/D [2903 0 R /XYZ 90 220.192 null]
->> endobj
-2628 0 obj <<
-/D [2903 0 R /XYZ 90 171.346 null]
->> endobj
-2918 0 obj <<
-/D [2903 0 R /XYZ 90 166.863 null]
->> endobj
-2902 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2928 0 obj <<
-/Length 2651      
-/Filter /FlateDecode
->>
-stream
-x��[K�۸�ϯ�-R�
-�Drr{�o�cO��l�8�a"�Z�c��ק>DP�đ`�a�
>�F?��@�`��ǻ��߽z�p���T��@�@q��������H���`�g�(�G�C�{~��y��%y�?���s�g��9	gY:_P�g�EEQ�~�7����Dr
�h6�����7�w���	��A ����_q���?1
_�C��S�]���w��N{DT�Ss�'��$C�0�"
i^���(��qi�$���u"yp�ӻ�Ms�df8D`ܳ3�h`n
��T "ZRK$�8'�&H
�[Y�v�M8G
-�0FX���_��2𘩈�p�F=d׵��HS��q�W��eN8@=��+�,��␥�$�V�ʬ>6o�hU���}�I��ͣ��<>�UT�뿜�� �&>�(F$�>]ϻ���B�� ~|O`B��P!��j���<�6-=�Ѣ���i� 9Ǟg�[�a_Z�q$4ɑ�������7��HWK|YƗP��&��}J�
�~BR��"I�Y�mU
_`�2��"!du�!(��I%p$}�济D{�pD!uU2�8�8
f^̷����AKA.�pa
a���z��9d�h�����9S��$�r�0�p�\��E�����;��sb��@`�;ڷ����-t�>(�Ўc���<3�k]n���$���!���4�tK�pTA)��:�뜓fe�
��(,{M+�u��Y�*��S1/e.�A�\u<�@"á�@�/����%:�f�ZQ���D�ȭ�a��OX�P�$���s��8ݖ��7y>�b���+c��U�=c]�
�8Θ	p8�Y��p�4�A\����Q-���J��70��\T���	D��n]�������*���4�,�Rl
����6[/���r��1�
d2n�w3����
dپ�o,0���i*��mޝ�znp��4!4<
a�3��$�<b2�%���E\�d@������N|�%��X�ഫ�Ч
-��TM��L��Z�h|���q�
-
��i�+jb`tAf~F��
��B�p�<���!��
���g)���n}��Z�$�3�	��~UH��*�9�2���	gT7��	�:��*"�ML��5m�b�).�7�ˏoH�$mD1�SdM\�0 ~� �t�Mw��X�8-*��Z��Lm�i�O`�,Q0�eA)L�n��QL��g���H@�P��+���D
�%"I!;�R�R���]I6�)u0��L� �@^%`��L�q
��c��]��~
�vF�'�
2X������m/ u��„ܨ� �(�2!E\�]D� }T|��'!��m���
������a_6�Y��M7�p��!§
��X�0�h|��
PC
L���+ r���t�{o�c�y�z�QpK �ɬ��w�$��3=�e�4�aGe���
�6�O
k���wW�qӺS��8�/;Ĺ}u�x��=Nh��|2��K|�ȡl����H r�C���7�i#�Akdh%bG�W�C?�1���G5�B�B��
�9
~��0�}V����1A���h�f*�צ�E�����M����&�� �UHPr	z:�YΡiϲ�
�fD8��8�&�3h�:�UF{��Ei%i�>�C��!���]L�` �^��L |%�jF/���`���t�4�
閫Cf4��� �fԛd^�[`�������o	
�E��[�i���n1����������������}t�Z M��tvt�ZXQI/�*N��%[�3d
�m
0]`��I�[�}JWeK�:tȂB� [...]
�0D�H���̋ �f ��EjP�1���s"��l�VS�Y�$~��E����_
1��Ce���sL��V�*q
%B�D��?���3����%Z�I�K�J��D��� ��a�{�|���Q����Ѥ�C�}���x�l��
�F�m
M$<�aG��q�cR'x��ǝD�K_������x�DS��^���M�
��)�
�J#���A�R��GË5��1/�
�ͨ;��"
��j6�%B��xP�l�P at e�z[�Y�*�V
:Z3���#%�c��i��|��ہ���ő	 q4t7
^�������S�{�u�t[-� ������bnql�����E�G,�,�I�g�n�垲ӣ�e1
^�T���$M���N�_
O�Ҙ�EX��hS����;�C�ǜ�ٝo ��Y� �yew:��;������x4P���,t
�㘣��IG؝<�_�Dm���"��x.�Hf=�Ln1
�,Gy\	-3�X���G�[&C��:��Y�,UߒH����v%�P���
s�d�O�J
sՐ,��:7��hК1�@*$`���%a���4/jFK�r"�r���'"�H=-7ɼ��SH�
���Fg�jN}�8GÉ(���5�s����<�נ8G=��F�
�`��8�r�O�9Et!�_�71Z
@:(h������E�U��:}�5�U#(�$����s.��S��|�Oa���ߑ5�zr�3
�- �
���Ƈ䀘�"��Q��[]y�ۧh[?�.-�|cY����W��
1���s�>5M��@Ec��o�	��L����٣���ߠ9�ǝ]��� y`���>���ϯ^=<m�8�"(��~z|Y)���o����q9����#���r�	���k���̌�R�>�=�7��
���Y��
������y
-endstream
-endobj
-2927 0 obj <<
-/Type /Page
-/Contents 2928 0 R
-/Resources 2926 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2893 0 R
-/Annots [ 2919 0 R 2932 0 R 2920 0 R 2921 0 R 2922 0 R 2936 0 R 2923 0 R 2924 0 R 2941 0 R 2925 0 R ]
->> endobj
-2919 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 631.015 201.372 643.414]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2932 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 617.511 201.372 629.506]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2920 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [99.655 605.157 201.372 619.105]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
->> endobj
-2921 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [208.262 483.318 243.45 497.266]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2922 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 406.869 201.372 419.268]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2936 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 393.365 201.372 405.36]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2923 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.75 406.75 535.938 419.268]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-2924 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 184.969 201.372 197.368]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2941 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 171.465 201.372 183.46]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2925 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2929 0 obj <<
-/D [2927 0 R /XYZ 89 770.89 null]
->> endobj
-2930 0 obj <<
-/D [2927 0 R /XYZ 90 720.814 null]
->> endobj
-2931 0 obj <<
-/D [2927 0 R /XYZ 90 654.771 null]
->> endobj
-2629 0 obj <<
-/D [2927 0 R /XYZ 90 583.837 null]
->> endobj
-2933 0 obj <<
-/D [2927 0 R /XYZ 90 579.354 null]
->> endobj
-2934 0 obj <<
-/D [2927 0 R /XYZ 90 508.623 null]
->> endobj
-2935 0 obj <<
-/D [2927 0 R /XYZ 90 430.625 null]
->> endobj
-2630 0 obj <<
-/D [2927 0 R /XYZ 90 384 null]
->> endobj
-2937 0 obj <<
-/D [2927 0 R /XYZ 90 379.517 null]
->> endobj
-2938 0 obj <<
-/D [2927 0 R /XYZ 90 308.786 null]
->> endobj
-2631 0 obj <<
-/D [2927 0 R /XYZ 90 274.116 null]
->> endobj
-2939 0 obj <<
-/D [2927 0 R /XYZ 90 269.633 null]
->> endobj
-2940 0 obj <<
-/D [2927 0 R /XYZ 90 208.725 null]
->> endobj
-2632 0 obj <<
-/D [2927 0 R /XYZ 90 159.85 null]
->> endobj
-2942 0 obj <<
-/D [2927 0 R /XYZ 90 155.367 null]
->> endobj
-2926 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2949 0 obj <<
-/Length 2651      
-/Filter /FlateDecode
->>
-stream
-x��[[�۶~�_��J3����t�N��N�8���I&Õ�ZN$R&)o���  )R��3
�eI�����oI
�#
�����ͳ)
d$���}dp��AB¯Y�����/��#&5"F�Cn����}���;;w�����
�)
��@JG���O��hï#���ѣ[��8ep]D�n~��5+�Qao�fP��� �y�C�{nތ)�E�L��2*
_;�w؝��vn�dX#���I4p�͏Jtd"i$X
�
-�	2Bl��Ҧ
i�J0�6��{^�w����0x%�k�DJd�_�Y�Y9�P�G�C�o�I�q��D\���t��ww��x6Kf��|�N�TV�����ôa
$.ԕ=h�_�
�ү�
����f
:,PA$"Wt��Y�
����)���l�r�����i���<;��'��
u�}
�"	Nһ93��9x+�S%p%��c
�n�pD��<�"��{������A�.W��q̼�^ec�G�E:��y1fj4_/���u�
��iM�
�-����O�s�?R@ �:�-!�8"R
Kh7�Q
����q�P�c*F�D�F�PD�IF��0k3t��A
�6k�Cd@�X�T�ijU�|�ϟ&i6͗��J�n����/������[�LRbY�N���R��5�3śE���\���z���	����7mP�Y�a��$&(�T'f��,��>�!)F_���1ţu=����u��YU
K� &����P��6 ^C�p6 �l�55����'c<��
?8��['����Z��2�-`)�d�sGV�����hӲ��
+W��9?�%��C2+��Qf{�;Tlm�H�<V��I�7cFG
��D��
�����0�e�	��D�dpC��{LgI�f�a�-��1D"�;�e��3o?c��X��s&
��:� \�R�p��G 5o
m�M�xk
Q�-�q4a
��I]���/�v�`
rI@ZBN�׈��6	��%ř�{�M��C�$�&�Q�S���m���Q�q��UV%sklI1@����V8�_�X���@�� P
�	[�zB�
�:������ܩ�l���
����t��YT�ER�U����q]Y;o{�^�rA��޼KN�
�ŀRЫ5���1I��ÀK-�:��jB+�1�]*�0�h�|�F�
�
��z�[?m�/C���mQp��P`[��!oJ�+�C"f
�
��db���q��;ɪ��y���w�F�:�g���n��l\��J(4�@:�<? q��۷��S��˥��怤:ĝgš):+�R����CF
�ٚ¦�MǬ�:&���Ä�a�!�ש~2�9�p���:������`�¸Hc�j����4`�'���˻��+\��mq�	��� <��6&x��d�m��`�
,e�=��W�<>$��ū���H�RЍ�6/�I��᪇&ٶ��z�%BwMb�,���d����׉M�'Agkw�+X�
:�p�u9��3��		��q! ű���G��C#PX��Y�bP�s��ģ��
-��ζ$tv�G;�	{;����'�v5��t�b�0tfہ�_���1��U���,�DEXO���Q
Ȃ�IT-D�1 ���$�՘���@-�v�����@a�{L� YY��^@-
ᠷ��0�7�
 1ЛqAB��,���
��4d�z��k�8$���-v����?�x�,2q*Ġ>RƄ@�,)��?�s���?4cԧF�1�G_��X�G��џ�a
���K��]�(A���D���u<
��=&���b!�78�&����S�x5#!���)v�s
�&���s�~���\�޽�`)JFz��σ~�5xŃC?T�o2h��h���2�* �ӡ���
)�χ~�U�O@5�ϖ�.�~z������Ū��u
����U4�B?ĂM��B?�8�s �ԑ5D]���>���>����>������"]�������!"�p�PH��o�[G6v
d_à���}+�߫"��m���9���`�sU���O��&ж@b�zI�T
��A���u��7
P�HR�1��[��t5���:mZ![z��
�<����*�>s�-���%
i�\
�5���h����	�h��-���r=D��r���W
�O%?
wm� [...]
Qp���'.~}]�����@̮dbo�q�E at f�Kq��I[����й����S��$쥻�_�İw��=�^//�[�>�K��o+Z���<��
���c��'�]h���ER��P�ֈRuR{�6����W��P��R�����"��~�})����&�"E٩�w_���ܸ��
X�D)�&��n�y�
x�jɢ�@lCn�&����o(���h�>K���c�7����
S�#���|
�녶g*���z�eR�e,Ĩ����u\W���}�.ʴ)_�ޔ\'�.I�Z�����޸
-�{�q�-A
�j��g����2�����j�0t3x� �7��2oz��v/K����u���*^��
-endstream
-endobj
-2948 0 obj <<
-/Type /Page
-/Contents 2949 0 R
-/Resources 2947 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2893 0 R
-/Annots [ 2943 0 R 2953 0 R 2944 0 R 2957 0 R 2945 0 R 2961 0 R 2946 0 R ]
->> endobj
-2943 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 643.369 201.372 655.767]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2953 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 629.865 201.372 641.86]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2944 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 443.532 201.372 455.93]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2957 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 430.028 201.372 442.023]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2945 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 243.695 201.372 256.093]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2961 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 230.19 201.372 242.185]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2946 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2950 0 obj <<
-/D [2948 0 R /XYZ 89 770.89 null]
->> endobj
-2951 0 obj <<
-/D [2948 0 R /XYZ 90 720.814 null]
->> endobj
-2952 0 obj <<
-/D [2948 0 R /XYZ 90 667.125 null]
->> endobj
-2633 0 obj <<
-/D [2948 0 R /XYZ 90 620.5 null]
->> endobj
-2954 0 obj <<
-/D [2948 0 R /XYZ 90 616.017 null]
->> endobj
-2955 0 obj <<
-/D [2948 0 R /XYZ 90 545.286 null]
->> endobj
-2956 0 obj <<
-/D [2948 0 R /XYZ 90 467.288 null]
->> endobj
-2634 0 obj <<
-/D [2948 0 R /XYZ 90 420.663 null]
->> endobj
-2958 0 obj <<
-/D [2948 0 R /XYZ 90 416.179 null]
->> endobj
-2959 0 obj <<
-/D [2948 0 R /XYZ 90 345.449 null]
->> endobj
-2960 0 obj <<
-/D [2948 0 R /XYZ 90 267.451 null]
->> endobj
-2661 0 obj <<
-/D [2948 0 R /XYZ 90 220.826 null]
->> endobj
-2962 0 obj <<
-/D [2948 0 R /XYZ 90 216.342 null]
->> endobj
-2963 0 obj <<
-/D [2948 0 R /XYZ 90 133.656 null]
->> endobj
-2947 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F11 387 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2970 0 obj <<
-/Length 2776      
-/Filter /FlateDecode
->>
-stream
-x��\[s��~ׯ�[əp��K��L����tƱ՗&$A'�(��ֿﷻ @ %��:�� ��ٳ���9+��&�ٿΞ��=����#Ns��_g�fF:�4~]e?�%J�'�R:��W����rv[\����*_ݏ

�WcNG�1���b<኎����u�}]\�]��, at R:|�����gߝ��~���X�Ac����Ͽ��
-�_f�g��a�<�\�:�ޜ�tF���W•���r��5i
�Tf�	b��
���eq��.������3�	
0O5Q���>��>\A��ǦI�s���H�W�4�8֡�pe]�����I�!�HcUd�-��W7%�ו�xCY���4�vϢ�^,ƒ������oVcaF7�y�ؼ�x�ek�.�0F��
���;�FN%lC��� ��]	!	Ӧ_ at A
�頜:�oJ��v�
s5z�}����گ���dD9����t
��{
X5�>2DY
��!a	���|q�C�i"w�\�1���
�������gys?�..��|3���W|�\�!WS�zn�!Q�C�V��O�A��9sIc�I4�GFO
�:��p�d���;/r�G��\��ӫ�+d����۫�2�
-N)�����X~�
�L��mac�=����#֊$�+�ә>�������yP�w,��B.$��|�)�
�'�"�)���CV������m�I�FD�LZ��جr('�cn��-�ʦ`A
-F�OM�:�7�h��PE�0Ԍ1�8Z�����%R��K�Sv-�ce+��yt5�[ 
Hd�$��~�)�=t-�ǬcI��Z���F<���-f�
-�L��8I�
A7Z �8���Q�
- .��Z�8}T
~ݷ Jh
�_,6ō�
 �8���W��
���m���C�T�S`- ��;�Ꮪ�88�ɖ\��a����?��9��7�b��m���z�22��|VOkn���ӫb1]��$A�0���>�m7ѝ������xW,���KO��a�.Y����d~��I�
���gf��#v8"/�s��^��B��j
�׿ �Wq3���|6�7A���n����>$�B0A�A}�,�1�	��sd,p ��
k����ob��mBk�C6�pb�ؿ��D<
.$�6
-֩���Jh����Z��Gª�-�%�4@ɩL�
[k��jq�Me�1#T��`����2��o�����0�
tQZ=
t��ܣ�=� �:
����
(�N��́��O�P+NM1Z����G�X1�10J9o��G��46����y]�{Tѵ��]r����7��
���C�>���ӌ���
-HR#���/��>|��A�
a#�au=j{'q�ozM.|� ���)�a�q�������`C��Η3��4��{�_o�� l��hx�Yl��*���)z	Lg|��m�( �:����Ȅ�A�3��[4,��^��e����f����z��&��%�ߕ����<�槧��}5�*fy	�6���b����@�<ɿ�U�3`�a&�{
M񰂯�U+���+-)l e��#�
A~I��	
�
�I
��`����_uR�7����oGB�U|[��R�MU�=Z�Þ
�Ԉ������|%v����%_�-�*�,���`��"6�ⴂ�/޺6O(�J�dv%���=����⪷�
�eY
-��Vĸ{Ͽ�_*z�u6���J꫟�=�S*�
-�e���E]�]|3�����JA�IQ����������E��
�^W|�0T|
����Ύ�?�}�	Y����BїѪ�'͢o`#}�]�et��k������T�V�7�z
	�ŷ:�!u
�b�w�FU��?
���B�R�xR�}����� yO�����Dh6��mK�崮��v��7A�M� ��u�l�ķ���Ψ�1hC�Np����]�
-�=T`�lGfՋ��|���3���w"%�O��z��P�;��܇�'��"^��慎S�����%)�����
�S�5��U�j��
��/ &�G�K@|T�OԗB-x�]r�a+8P��)��#�iy at _�D&z�j-.>����R
�9��
,<̊SS�V�#>bbʾ�@7쐶ĉ\�q��?nW�������q�饦L�[�@Uʮ��"t��J��E��5��ҕ��]���;�
��f)�~�S<�+��*QU�,aW�KM�MZ�LO2�
��FRHדhPLړ�
&�ߧ�
-��It$t\O�%�/=�T=���=�@�Τ�P�D�ў\��;=	��Ih��Ih��:��:�N=��A����F��^Ibx{�ӻp7	{h�u���2�]�9-��L����@�?
2
y�m��r�'A)���z
-�C��)z�����)�/��ӜB7:V{�)����f�k���k��)t��]����nEٍhL��i;�o�����P7�\Hwj7�BX�f�����D�h3�Iv`3�k���������H{������
�?��XºG{��b���FB��I��ޘ�DJ������4&�Yr�a�k-F��K8��‶�i,�՚<|M��e8hn�l��~S
���\$mH

А8��^n2���G
����PB���������t��+���uTʀ���D�g;zx���x�Q?�O~�7���
���ڗ��������/c�F����/�y�;�f,�h��Vq
-�&֯�Y�7EQ&���߲�jv܇=�c��fs��g�.�7�bqC��b�����P]���P?3�e��
N��&�F�6�=4�\)<��wh���yѼ/���^�E��%t�S�� {)��
-endstream
-endobj
-2969 0 obj <<
-/Type /Page
-/Contents 2970 0 R
-/Resources 2968 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2893 0 R
-/Annots [ 2964 0 R 2973 0 R 2965 0 R 2977 0 R 2966 0 R 2981 0 R 2967 0 R ]
->> endobj
-2964 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 694.926 201.372 707.324]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2973 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 681.422 201.372 693.417]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2965 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 470.78 201.372 483.179]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2977 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 457.276 201.372 469.271]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2966 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 234.679 201.372 247.077]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2981 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 221.175 201.372 233.17]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2967 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2971 0 obj <<
-/D [2969 0 R /XYZ 89 770.89 null]
->> endobj
-2972 0 obj <<
-/D [2969 0 R /XYZ 90 718.682 null]
->> endobj
-2662 0 obj <<
-/D [2969 0 R /XYZ 90 672.057 null]
->> endobj
-2974 0 obj <<
-/D [2969 0 R /XYZ 90 667.574 null]
->> endobj
-2975 0 obj <<
-/D [2969 0 R /XYZ 90 584.887 null]
->> endobj
-2976 0 obj <<
-/D [2969 0 R /XYZ 90 494.536 null]
->> endobj
-2663 0 obj <<
-/D [2969 0 R /XYZ 90 447.911 null]
->> endobj
-2978 0 obj <<
-/D [2969 0 R /XYZ 90 443.428 null]
->> endobj
-2979 0 obj <<
-/D [2969 0 R /XYZ 90 348.786 null]
->> endobj
-2980 0 obj <<
-/D [2969 0 R /XYZ 90 258.435 null]
->> endobj
-2664 0 obj <<
-/D [2969 0 R /XYZ 90 211.81 null]
->> endobj
-2982 0 obj <<
-/D [2969 0 R /XYZ 90 207.327 null]
->> endobj
-2983 0 obj <<
-/D [2969 0 R /XYZ 90 112.685 null]
->> endobj
-2968 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F82 428 0 R /F60 304 0 R /F72 326 0 R /F99 1084 0 R /F11 387 0 R /F24 301 0 R /F106 2650 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-2993 0 obj <<
-/Length 1544      
-/Filter /FlateDecode
->>
-stream
-xڽXYw�8~���m�9��	�[&q3�[�>�=>ؖm�
����s�o���K����.�w��nz�z�=l(TX��`�s��ͬ/v ��Fo-&|D���Շ����Ѱ��7��{~���9�|k��}���
��0b�o=�I+˥
��ְ����)��	�����N�	�xD8H`	�C�&�(C��T�i�a��:8��)�\��S��g�t�D���� �A#B��z].���ɹ�d2��+��T���_&y�H�L���Sn�YNb3?/�,J��b)�CR�&2�3ҹA�Sl ���5��>��Lr��s��`���)s0�J3l9퀛�{X��L��p��7�x���;��[��C4�I��!*�f��
�q�/�����8ܘUr�L��R���.'���hTx���
d��)oJ��� �k	NQ�2���ϩ\Q�ݿ���'W���Oگ���OΏ���!�����]�jY
Q�Q�
F&�y'`��la��\׳��<
�7I߅��h6���̳�J&��Q�������,�	p7���H��|��� p�
��c."�;�}N�8@@�
w��YZ�C�J���\s��v�
���b
"e�'�y	�!��!�B�o&��� ��5ez�H,�)a&�Ɋt���b�D�4]��"҄N��fz�,�L�!Н9��F &^P�+�iħ���1�
-�8Ԯ��I&��e�NUQ��j��\9Y)]��i
����м,d"��P
-^����V$
X
�m��+�G,_uJTe
�-�zȭ��+��;��1�_�	�V��Ue�l
_�?7`���
��hK��	M�r�So�|�<�5���}�`�n
f�p��$\ ��و w��C���(�Zղ�0�P�rA�L����ꛥ�e���C�
��
��G�,�T���
t$
�vM�)�B�c
-�A�]S�����P�ۃ����J���9��
��*;����A�:������D*/s�I����
:E��o�ݏ�������(�hR�hY�Ý�^
m��?�G�_GM9��������'���>lYm n�����&�oe]��2L�I6�AA	{���ƃO�/o�k�~�)Lޗa\�����r�����np9ܝ-7�=���S"q��
k�w
M�2"���e�=�=Pu�2�f�~��8�XP�A`X�>K1eR�~�`�ӂY�r�y�l
-���ć~���(d��}�B�c�Z!;��*��Ҵ,
$�y,���]K�U
W�_{�Bj�N}�n̺
���<�?O�S뼯t��:��ۼXI�I��_��������:�3n�C��(a�.L��E�j^}�9b�/9�
-�Vd� 2!��]����@�7�G~�l-t=�!���L<������z��x�b�u
-`[8�-`}�(���U
 Wy�֛v����[��MGj�6Le�0�$�+sE�S3�9��}�m���¤��**?�4�Y�P4AX=s�
e]
�(ߛ���S����tsI]����Ť\�2
��E�]���]47�F&Vif�%0�R��� �R
-endstream
-endobj
-2992 0 obj <<
-/Type /Page
-/Contents 2993 0 R
-/Resources 2991 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 2893 0 R
-/Annots [ 2984 0 R 2996 0 R 2985 0 R 2986 0 R 2987 0 R 2988 0 R 2989 0 R 2990 0 R ]
->> endobj
-2984 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [119.351 634.064 201.372 646.462]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2996 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [93.63 620.559 201.372 632.554]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
->> endobj
-2985 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 435.838 171.803 445.766]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_aaa76c2fe8629d0c3251374d87a0da4a4) >>
->> endobj
-2986 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 403.617 196.709 414.148]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_ac49c86d7db3259a07d9a2b293e573733) >>
->> endobj
-2987 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 372 149.656 382.53]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_a95eb0b200e5754f1b18972012c1807d4) >>
->> endobj
-2988 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 340.382 219.394 350.912]
-/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_ae25095de7466faeb9f7bf4c476f34cf0) >>
->> endobj
-2989 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 91.246 194.697 102.15]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception_a66765523c60cdb348393876561c5d0e7) >>
->> endobj
-2990 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-2994 0 obj <<
-/D [2992 0 R /XYZ 89 770.89 null]
->> endobj
-2995 0 obj <<
-/D [2992 0 R /XYZ 90 657.82 null]
->> endobj
-809 0 obj <<
-/D [2992 0 R /XYZ 90 551.334 null]
->> endobj
-278 0 obj <<
-/D [2992 0 R /XYZ 90 542.408 null]
->> endobj
-2997 0 obj <<
-/D [2992 0 R /XYZ 90 455.717 null]
->> endobj
-2998 0 obj <<
-/D [2992 0 R /XYZ 90 455.717 null]
->> endobj
-2999 0 obj <<
-/D [2992 0 R /XYZ 90 424.091 null]
->> endobj
-3000 0 obj <<
-/D [2992 0 R /XYZ 90 390.747 null]
->> endobj
-3001 0 obj <<
-/D [2992 0 R /XYZ 90 359.129 null]
->> endobj
-3002 0 obj <<
-/D [2992 0 R /XYZ 90 305.764 null]
->> endobj
-810 0 obj <<
-/D [2992 0 R /XYZ 90 207.719 null]
->> endobj
-282 0 obj <<
-/D [2992 0 R /XYZ 90 198.792 null]
->> endobj
-3003 0 obj <<
-/D [2992 0 R /XYZ 90 112.101 null]
->> endobj
-3004 0 obj <<
-/D [2992 0 R /XYZ 90 112.101 null]
->> endobj
-2991 0 obj <<
-/Font << /F70 324 0 R /F82 428 0 R /F60 304 0 R /F81 426 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3014 0 obj <<
-/Length 1931      
-/Filter /FlateDecode
->>
-stream
-x��Y[��F~�_���V=}�/�-�=[�&U�3���b����
h<ί��7Hhƶ�j�h5͹����&�ѿ�~�����8�P&��n�Q�#�f�
�����#.��ǻ���vu��^���CY�5y�9�8F�'����J�~�Mwɂr
�(�u˷z����XWK
Y&y������W�W���#�D�H�h��z�
G+�~
a�2}���QJ<�跫_���#���<�n�Lt#rP�#�{���(�
-��
-~�˦�uE]Y��1��4E,�
�W�Km��*/�}k)���{v�V�{o
�
?�6�02�D�����v'W�r��U�[��ֺn<��"0<��SBp��]�&�,�ކOu V�uBy�	Dq[`LK��H���2js�3���R>>�n����	�S�Co�g�P
?^��j�6�3�R�95&^�,EDɃ��0*���pf���<=K
q 
�)��@"@8B--ƽր����a�?��F�K𧰦���;�%
N7L�C`"�R�8��%�^����LL/u�F���Cpg��!X�'a�`Z/���._j4���E$Dԛ�U�X:���;ݸ�;Z:�
u�ѥ�V����V�f�
�������$$�i�;�p\T
��"3B))J�֛ LJ��)�R���E�j��
�
��Ix���ժGiWO�z�7�n�ܻ(
�!8��V�@��{}Yq ��	a+U�N���
�ߣ�qD5�E)D29�+���	gX�Ws
����ݾ���?X�t�Ϛ�V/�C��
ۘd�T#��}lg !'�3-�8�XyK�o���BNշ���>K�i�<\�a�A�s�J')�8(����]�0�b}��I3HDO� E<�} vў�)��)�m�6���:�F�0

N�I�
�	�j�
�
\0��_��������!W�OɪN����b����/h&�� �b
��Ϋ��d�Ч��p8=�
KƟ��3��M"�3Ƶ��&m+����]�� ����?�_��Ӓ3
�K�f
-&�y���5����u4s�hr���
",�Y^���+=�� /[n��"����r6�n(s�GC��ص�v�u;wyk��uW�˿�vQ���Yو�-S��1SALYw����6����w�ʢ�y�^�� �f��/��|y�޻�9�V���z�
-�^hXM���y��Q�բ��6	P�
-C؅�9�L�p�M��,=x�6 ���>,l��Z��{��
��5t�t�Լ0%�����N�y(��a��a~����;P�b�Q�\�5{�- �?z<��_���Q��"�s���L�A����˳#�*;)��10�dGAJ>w�!�Eg�`Oq���r�!bfʱ
�"�x�|�φ���N�ڡD)���A���tDQ�zWT���wf� [�	�`y��;4��i�-����#E��,#8ʤ<݄�/�Labsvt?r��;z"��П�QӮ0y����c��D��k��P 0��R����~ܟ�%�$S��I�o~b
�4:Z�8��"��� �@W��OBo����zո�����3
�fՒ��q����
����
E/�.����������	��)EL�s�P(�Lk�la= ����"3����3�-�3�@����z�ǞzDA�����=������=j5���F%��������<�^����J�/����p�9��D�ОI	��E$�<�fr,����+o])vM_��h�F
�wE���z�u�?K(��.��n�
��I���U��������%D��q*a�W�y�[�
�����W�}���!�Y[/��Z�|��(�1�K^��2�o�\�m�2A~�a�����Ea��+[����}�x�u�ﯯ�� [...]
-�ڧ~�j�`<��G�&RR{b��/Ç~���-�^��_'��/�	�
-endstream
-endobj
-3013 0 obj <<
-/Type /Page
-/Contents 3014 0 R
-/Resources 3012 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3025 0 R
-/Annots [ 3005 0 R 3006 0 R 3007 0 R 3008 0 R 3009 0 R 3011 0 R ]
->> endobj
-3005 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 527.367 149.098 537.897]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_aaa7f7d2e2523000e62d85670f268362a) >>
->> endobj
-3006 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 499.471 136.665 510.002]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_a8d74790917f006b8ce83d9be0d356576) >>
->> endobj
-3007 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.921 471.202 173.486 482.106]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_ab54edfb4d01886f38228f56771aa085d) >>
->> endobj
-3008 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [177.302 471.202 212.49 482.106]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-3009 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [184.141 371.131 219.329 382.035]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
->> endobj
-3011 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3015 0 obj <<
-/D [3013 0 R /XYZ 89 770.89 null]
->> endobj
-3016 0 obj <<
-/D [3013 0 R /XYZ 90 721.073 null]
->> endobj
-811 0 obj <<
-/D [3013 0 R /XYZ 90 633.415 null]
->> endobj
-286 0 obj <<
-/D [3013 0 R /XYZ 90 626.815 null]
->> endobj
-3017 0 obj <<
-/D [3013 0 R /XYZ 90 545.987 null]
->> endobj
-3018 0 obj <<
-/D [3013 0 R /XYZ 90 516.357 null]
->> endobj
-3019 0 obj <<
-/D [3013 0 R /XYZ 90 488.462 null]
->> endobj
-3020 0 obj <<
-/D [3013 0 R /XYZ 90 432.049 null]
->> endobj
-3021 0 obj <<
-/D [3013 0 R /XYZ 90 322.065 null]
->> endobj
-3022 0 obj <<
-/D [3013 0 R /XYZ 90 299.315 null]
->> endobj
-3023 0 obj <<
-/D [3013 0 R /XYZ 90 299.315 null]
->> endobj
-3024 0 obj <<
-/D [3013 0 R /XYZ 90 238.592 null]
->> endobj
-812 0 obj <<
-/D [3013 0 R /XYZ 90 146.84 null]
->> endobj
-290 0 obj <<
-/D [3013 0 R /XYZ 90 138.905 null]
->> endobj
-3012 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F90 507 0 R /F99 1084 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3029 0 obj <<
-/Length 672       
-/Filter /FlateDecode
->>
-stream
-xڍTKS�0��W�u�"ɖls+�1P��q{	L�q���迯^�3��h�Ү���]cD�V˅��)ד�Y���(攃d
b
� F�����8���y�H�e��~�z���&Ku�%γC���3F ���龒��q^��
-ԗk	��7O�i@�"b^��0t�"�
��{#��h�}>�Y_4u�Q��uq��y�?2q�L�{J�,VQjs����V
���		!n��ݯ��'q�eؽ�
�� ODA$��@�Q8
-<�8
���(7
Թ�Ga
Q=����g��l��b�]Qo��}
2&R�t��a)�Oe�- �
�
����Ӣ���貶xR�O��t�R� �V�O��T�z���)��D	��
-�<��/Y����澩?KN=DBĩ���zm�l�Dݧ�vm�v���fe�Y��v��Z�i�I�ȶ�f��6e�(��E�C[wLKq<m�]�1�F}���B��MB���)
-�x��������Yv
-&aH�ᾭ��X\V>8md��t���'�S-ۂ�8���
�δdww�Ƹ�'�=�i�in/^ֽh��^�u��D{smo�zHK����3m�k��"��2�R����g���R�	�X*M�O�c�?
/�!�D��L6��X��!œ������v7��Y�E�z���b
-endstream
-endobj
-3028 0 obj <<
-/Type /Page
-/Contents 3029 0 R
-/Resources 3027 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3025 0 R
-/Annots [ 3010 0 R 3026 0 R ]
->> endobj
-3010 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [113.91 685.666 170.687 696.196]
-/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set_aa80c4fa3121e341ac6068c60394eb07d) >>
->> endobj
-3026 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3030 0 obj <<
-/D [3028 0 R /XYZ 89 770.89 null]
->> endobj
-3031 0 obj <<
-/D [3028 0 R /XYZ 90 704.286 null]
->> endobj
-3032 0 obj <<
-/D [3028 0 R /XYZ 90 704.286 null]
->> endobj
-3033 0 obj <<
-/D [3028 0 R /XYZ 90 657.097 null]
->> endobj
-3027 0 obj <<
-/Font << /F70 324 0 R /F81 426 0 R /F60 304 0 R /F82 428 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3089 0 obj <<
-/Length 1149      
-/Filter /FlateDecode
->>
-stream
-x��[o�6���+�6��u�c��M�^�,
Z�
u�Qr��׏�%s|��(
�!�MQ��s�!
���� nLL�|Mof���9���cg�p"��9�Ĺވ��~
�1{�3�ŵ�D>�ͻ�c<��$��K��"�f 釵�1B ����S9�+�=��D1��s��������F:t���h��08wcL�0$O���{�<�)^	NQ*���|��7S:Ur�����@��ZK�Îz�hѫJ����*]r�+��1b"�\��5�+s��9E�=�2�P��y�<�0:����WJ~�q٧ K(%չF��d��j�%�`?�b���#�Xp��l��2
�K�R�w����Ӕ&�|�'�w�c�����ߡK��	�XRV�R��ꞅ~�L�ہ�Fus�x�y��������F $h
R�u���F�UP~�ŀ�b���Х͚�b�
�W����#�Jv8�/WЅ�9esi���|�5t&؜g���˷��R�[�����w>���'h\�w��H�"�;$
- ����g�MH~�e\��z(���Rk��b�t
�'�Pߒf��lY�\I��qʻ��
q��;��X[�*cVr��w�-�}��6Vk��E�$���I�E��l䒡��,~�(p�U���C^��`T�I��\���
g��%&I
�紐��`�`��6QiB���6��l���&|��l
k%TK3]�ElJ������h�������p����"�ljq�Y��iv]$�P�͒UU},K�歈
-�3!g�LZ�.d�
9x~�ڄF}�f�x���<eS
-
�ۭ�{���7��Q��_|2����rj"��CL��+s1ީ�K���ޔV5 �|�����Y*:��nSU0]+�g�ٌ(��?xp��AnS�޳��|U>�X&2�eQ�TY�,���by�
��YO��_��ɣ�/�>�74�(j���
�b�a�)���Q����n�c#
����eb�6y���:#�:	�]�\}7"dX���X��n��偪�ߪ���]=ί�G���t��Ozޘ
-#`�o��.�����|�,�X�X��4 ��}w�˶
-&���G*tg^�
�j�g�X�@|;^ ��Q������lW7������u~��_�_��DQ
-endstream
-endobj
-3088 0 obj <<
-/Type /Page
-/Contents 3089 0 R
-/Resources 3087 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3025 0 R
-/Annots [ 3034 0 R 3035 0 R 3036 0 R 3037 0 R 3038 0 R 3039 0 R 3040 0 R 3041 0 R 3042 0 R 3043 0 R 3044 0 R 3045 0 R 3046 0 R 3047 0 R 3048 0 R 3049 0 R 3050 0 R 3051 0 R 3052 0 R 3053 0 R 3054 0 R 3055 0 R 3056 0 R 3057 0 R 3058 0 R 3059 0 R 3060 0 R 3061 0 R 3062 0 R 3063 0 R 3064 0 R 3065 0 R 3066 0 R 3067 0 R 3068 0 R 3069 0 R 3070 0 R 3071 0 R 3072 0 R 3073 0 R 3074 0 R 3075 0 R 3076 0 R 3077 0 R 3078 0 R 3079 0 R 3080 0 R 3081 0 R 3082 0 R 3083 0 R 3084 0 R 3086 0 R ]
->> endobj
-3034 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 659.542 278.601 670.446]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3035 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 635.546 278.601 646.45]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3036 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 611.55 289.122 622.454]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3037 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.849 599.552 285.804 610.456]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3038 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 587.554 278.601 598.458]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3039 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 563.558 289.122 574.462]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3040 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.849 551.561 285.804 562.464]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3041 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 539.563 278.601 550.467]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3042 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 515.567 278.601 526.471]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3043 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 491.571 278.601 502.475]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3044 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 467.575 289.122 478.479]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3045 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.849 455.577 285.804 466.481]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3046 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 443.579 278.601 454.483]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3047 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 419.584 278.601 430.488]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3048 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 395.588 289.122 406.492]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3049 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 371.592 278.601 382.496]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3050 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 347.596 278.601 358.5]
-/A << /S /GoTo /D (page.88) >>
->> endobj
-3051 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 323.6 278.601 334.504]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3052 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 288.93 278.601 299.834]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-3053 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 255.036 140.809 263.883]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3054 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 228.983 278.601 239.887]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-3055 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 204.987 278.601 215.891]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-3056 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 180.991 278.601 191.895]
-/A << /S /GoTo /D (page.88) >>
->> endobj
-3057 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 156.995 278.601 167.899]
-/A << /S /GoTo /D (page.88) >>
->> endobj
-3058 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 133 278.601 143.904]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3059 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 109.004 278.601 119.908]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3060 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.272 74.333 290.228 85.237]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3061 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.648 659.584 505.603 670.488]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3062 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.33 647.629 502.285 658.533]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3063 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.02 623.719 488.975 634.623]
-/A << /S /GoTo /D (page.39) >>
->> endobj
-3064 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [481.214 599.809 493.17 610.712]
-/A << /S /GoTo /D (page.34) >>
->> endobj
-3065 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 575.898 495.083 586.802]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3066 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 551.988 495.083 562.892]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3067 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [501.03 528.078 512.985 538.981]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-3068 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 504.167 495.083 515.071]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3069 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 470.803 495.083 481.707]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3070 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.02 446.893 488.975 457.797]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3071 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.263 434.938 512.218 445.842]
-/A << /S /GoTo /D (page.43) >>
->> endobj
-3072 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.648 401.574 505.603 412.477]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3073 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 377.663 495.083 388.567]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3074 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.648 344.299 505.603 355.203]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3075 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 310.491 357.291 319.338]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3076 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 284.523 495.083 295.427]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3077 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 251.159 495.083 262.063]
-/A << /S /GoTo /D (page.89) >>
->> endobj
-3078 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 227.249 495.083 238.153]
-/A << /S /GoTo /D (page.89) >>
->> endobj
-3079 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [498.071 227.249 510.027 238.153]
-/A << /S /GoTo /D (page.90) >>
->> endobj
-3080 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [442.182 191.383 454.137 202.287]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-3081 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.263 167.473 512.218 178.377]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3082 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [500.263 143.563 512.218 154.467]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3083 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 110.199 495.083 121.103]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-3084 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [502.983 86.288 514.938 97.192]
-/A << /S /GoTo /D (page.64) >>
->> endobj
-3086 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3090 0 obj <<
-/D [3088 0 R /XYZ 89 770.89 null]
->> endobj
-3091 0 obj <<
-/D [3088 0 R /XYZ 90 684.655 null]
->> endobj
-3087 0 obj <<
-/Font << /F81 426 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3164 0 obj <<
-/Length 1460      
-/Filter /FlateDecode
->>
-stream
-x��Z[s�6~���0S	�L�3���:��{�N�;
�e���#�n�__���[� {��XB��s�9G@�% ]�Ά��

H�ꘚ)
'�$�pTd�c�A� (_�W�� ���ʛ{����YG�;l=��v A>��-����W �Y�Tݱ���K�dh:�
�A�X%b���=kH� T!�S���;���
S�
�#����_4�ѯ9)Ά���˖����m���Rr��U�
�D$%^@^�!W��UF�A�����w���׼�]�9��`�
º����D���RG��$ďj0֡��s��oH�I�ǫ����c�ブ|/%� 4�1������n��llXBY넀����-��W�����1GT�a�^��<���k&
-�7�%���%�*T at B��{�����8s���zLH��8�#�
�-�pD
' Q
���^�
-RS�=�2��d��N��V��
����;��E�	���Lْa.�Q��
�it�a���9*�u��,���>6@�MCHC/l���c�|M�K�?�ǃ\6@���iJBf
���q��-�`9#�J"�����S����$"&��߭*����Ɉy!fٷF��d�
-G{M�
%�7K��t�<���c,V��e����`��.�N5��HV?�ؘ��,Bђ�
�:�;��3
��v)M��k6'tϢ1+��r1��3&C��|�ݻoY���
g��]�\av�9&�{<�8�Q���l;��Nl�W�����d�jjFC�)��8}jB����LCL3�ʦ:�`��
�	T`;�
�o���=����7�;&�Udً~�1��Z�r��Rq�x���F��'r���^��1�dk�/c�K�JP�4�[����mb�Ќh�O���
 �
̓��Zh��
 )7��ì�!(��D��ƛI��V�+�
*Ǖ�<�T �yqq at 6��6����e5����k[����n�Ҙ�ݗ�VN>zӔ-Z�Nm1�bnm� -f��Z�Uװ�Lk8*d;
C?��
����殟�zQV.[&��@[�gٲ���6�T2�8��'�E_�~��'tݗ��MHi1sH(W��٩��e�P��|�R�����
f�+�9�5���d⤒�
�
-�#��..
�'soH4+�M<�9�����֧����:�}2��V�7*��� qlc]n����
?t�37���
-(�v��>�hT���{��4��G$)=M+.���
-��� �������wS0sƍ&�v6",+jQh�Y�����s��1���y8��%������~��2аT�䟰<��
-�eiy��s޹S4��B]��l����l��ۄ��\Lձt;?C��4��$������C��|��9��!9��o�h���
@��xY��P�
�J[g�
0.��E�o)��!mM�iZ[��=������q�'�,VG�㏥�6�,���&1�d˜r��5�yP�&b��,��
-endstream
-endobj
-3163 0 obj <<
-/Type /Page
-/Contents 3164 0 R
-/Resources 3162 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3025 0 R
-/Annots [ 3085 0 R 3092 0 R 3093 0 R 3094 0 R 3095 0 R 3096 0 R 3097 0 R 3098 0 R 3099 0 R 3100 0 R 3101 0 R 3102 0 R 3103 0 R 3104 0 R 3105 0 R 3106 0 R 3107 0 R 3108 0 R 3109 0 R 3110 0 R 3111 0 R 3112 0 R 3113 0 R 3114 0 R 3115 0 R 3116 0 R 3117 0 R 3118 0 R 3119 0 R 3120 0 R 3121 0 R 3122 0 R 3123 0 R 3124 0 R 3125 0 R 3126 0 R 3127 0 R 3128 0 R 3129 0 R 3130 0 R 3131 0 R 3132 0 R 3133 0 R 3134 0 R 3135 0 R 3136 0 R 3137 0 R 3138 0 R 3139 0 R 3140 0 R 3141 0 R 3142 0 R 3143 0 R 3144  [...]
->> endobj
-3085 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 707.957 278.601 718.861]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3092 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 664.186 140.809 673.033]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3093 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 638.219 278.601 649.123]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3094 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 614.308 278.601 625.212]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3095 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 590.398 289.122 601.302]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3096 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.849 578.443 285.804 589.347]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3097 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [190.801 556.525 202.756 567.429]
-/A << /S /GoTo /D (page.22) >>
->> endobj
-3098 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 522.652 278.601 533.556]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-3099 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 498.742 278.601 509.646]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-3100 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.539 474.831 272.494 485.735]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3101 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.272 450.921 290.228 461.825]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3102 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 417.048 289.122 427.952]
-/A << /S /GoTo /D (page.55) >>
->> endobj
-3103 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 393.138 278.601 404.042]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3104 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [286.501 369.227 298.456 380.131]
-/A << /S /GoTo /D (page.64) >>
->> endobj
-3105 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 345.317 278.601 356.221]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3106 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 321.407 278.601 332.311]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3107 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.59 321.407 293.545 332.311]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3108 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 287.534 289.122 298.438]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3109 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 263.623 289.122 274.527]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3110 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [273.371 229.75 285.326 240.654]
-/A << /S /GoTo /D (page.67) >>
->> endobj
-3111 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [287.836 229.75 299.792 240.654]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3112 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [283.782 205.84 295.737 216.744]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3113 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 172.032 140.809 180.878]
-/A << /S /GoTo /D (page.71) >>
->> endobj
-3114 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [195.244 158.019 207.2 168.923]
-/A << /S /GoTo /D (page.25) >>
->> endobj
-3115 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [278.282 146.064 290.237 156.968]
-/A << /S /GoTo /D (page.27) >>
->> endobj
-3116 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 124.211 140.809 133.058]
-/A << /S /GoTo /D (page.28) >>
->> endobj
-3117 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 100.181 140.809 109.147]
-/A << /S /GoTo /D (page.29) >>
->> endobj
-3118 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 76.271 140.809 85.237]
-/A << /S /GoTo /D (page.29) >>
->> endobj
-3119 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 697.94 357.291 706.906]
-/A << /S /GoTo /D (page.29) >>
->> endobj
-3120 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [497.121 684.047 509.076 694.951]
-/A << /S /GoTo /D (page.30) >>
->> endobj
-3121 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [471.133 672.092 483.088 682.996]
-/A << /S /GoTo /D (page.30) >>
->> endobj
-3122 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [457.593 660.136 469.548 671.04]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3123 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.042 648.181 498.998 659.085]
-/A << /S /GoTo /D (page.34) >>
->> endobj
-3124 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [461.708 636.226 473.663 647.13]
-/A << /S /GoTo /D (page.35) >>
->> endobj
-3125 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.029 624.271 507.984 635.175]
-/A << /S /GoTo /D (page.35) >>
->> endobj
-3126 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [455.083 612.316 467.038 623.22]
-/A << /S /GoTo /D (page.36) >>
->> endobj
-3127 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [489.403 600.361 501.359 611.265]
-/A << /S /GoTo /D (page.37) >>
->> endobj
-3128 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 578.508 357.291 587.354]
-/A << /S /GoTo /D (page.37) >>
->> endobj
-3129 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 554.597 357.291 563.444]
-/A << /S /GoTo /D (page.37) >>
->> endobj
-3130 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.965 540.585 508.921 551.489]
-/A << /S /GoTo /D (page.38) >>
->> endobj
-3131 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 518.732 357.291 527.578]
-/A << /S /GoTo /D (page.38) >>
->> endobj
-3132 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [453.399 504.719 465.354 515.623]
-/A << /S /GoTo /D (page.39) >>
->> endobj
-3133 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.72 492.764 499.675 503.668]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3134 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [478.057 480.809 490.012 491.713]
-/A << /S /GoTo /D (page.41) >>
->> endobj
-3135 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [476.642 468.854 488.597 479.758]
-/A << /S /GoTo /D (page.41) >>
->> endobj
-3136 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [510.484 456.899 522.44 467.803]
-/A << /S /GoTo /D (page.43) >>
->> endobj
-3137 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [501.299 444.943 513.254 455.847]
-/A << /S /GoTo /D (page.43) >>
->> endobj
-3138 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.079 432.988 436.035 443.892]
-/A << /S /GoTo /D (page.44) >>
->> endobj
-3139 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 411.235 357.291 419.982]
-/A << /S /GoTo /D (page.44) >>
->> endobj
-3140 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [512.697 397.123 524.652 408.027]
-/A << /S /GoTo /D (page.45) >>
->> endobj
-3141 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [488.826 385.168 500.781 396.071]
-/A << /S /GoTo /D (page.45) >>
->> endobj
-3142 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 363.315 357.291 372.161]
-/A << /S /GoTo /D (page.47) >>
->> endobj
-3143 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 339.404 357.291 348.251]
-/A << /S /GoTo /D (page.48) >>
->> endobj
-3144 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [511.6 325.392 523.556 336.296]
-/A << /S /GoTo /D (page.49) >>
->> endobj
-3145 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 303.539 357.291 312.385]
-/A << /S /GoTo /D (page.50) >>
->> endobj
-3146 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [380.762 278.288 392.718 288.475]
-/A << /S /GoTo /D (page.51) >>
->> endobj
-3147 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 255.718 357.291 264.565]
-/A << /S /GoTo /D (page.52) >>
->> endobj
-3148 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [507.715 241.706 519.67 252.609]
-/A << /S /GoTo /D (page.52) >>
->> endobj
-3149 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [470.027 229.75 481.982 240.654]
-/A << /S /GoTo /D (page.53) >>
->> endobj
-3150 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [499.366 217.795 511.321 228.699]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3151 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.375 205.84 506.33 216.744]
-/A << /S /GoTo /D (page.59) >>
->> endobj
-3152 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.336 183.867 357.291 192.834]
-/A << /S /GoTo /D (page.59) >>
->> endobj
-3153 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.923 169.975 506.878 180.878]
-/A << /S /GoTo /D (page.64) >>
->> endobj
-3154 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [466.709 158.019 478.664 168.923]
-/A << /S /GoTo /D (page.65) >>
->> endobj
-3155 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [379.089 134.826 391.044 145.013]
-/A << /S /GoTo /D (page.69) >>
->> endobj
-3156 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [377.983 110.916 389.938 121.103]
-/A << /S /GoTo /D (page.69) >>
->> endobj
-3157 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [496.049 98.244 508.004 109.147]
-/A << /S /GoTo /D (page.70) >>
->> endobj
-3158 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.279 86.288 505.235 97.192]
-/A << /S /GoTo /D (page.70) >>
->> endobj
-3159 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [477.409 74.333 489.364 85.237]
-/A << /S /GoTo /D (page.71) >>
->> endobj
-3161 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3165 0 obj <<
-/D [3163 0 R /XYZ 89 770.89 null]
->> endobj
-3162 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3264 0 obj <<
-/Length 1586      
-/Filter /FlateDecode
->>
-stream
-xڵZ[s�(~�����3������>����d;;�v,a��n�i����Į-��$6B߹p����,
�
=�����1�s�pb���
���:���=�g���3�
$�k
@ ��������Q�@�v����O_�����p�8rn�I�3�|�?s.G��}EЮ"�jq�9�U��^Ӕ��9'�v���;��`LW����oܡ@� ��ҿ�)[� p=?ng�y49�0��̃nD��?�`��t^;�Q���\{��ˑ������
"7���I�� ��[=�m������ciܖ���&�&Y(R3���"�YY�G��L���,�������/�P��<�8�C�>�B��F}Κڇ�/j�I]r����`%�[��,����	���c+�%����qɻeX��Z�/o�y���
������\�����V� ��B(���yFMb�ӈ���"����	�䛤��
��Ɋ%�
�שG�
-J8��Y,��w����r</WE��lY`��T����=�϶L7:��
E\��F��W�!~�i�k:D/I!��f��bũ|��u�; eʰ�L�x
-�q1
��'�=������p��������X*y6���0V��L
Dr*w�0����σ��I�E�Y�4�0(�]�����L�'e!�!f����6�0��F0Q���T�$-0�K�9M�+Z�X*�p�R����#l�M�.�t�M�?$[���r����\K�)^��G/(LƈUjQ'X�rK�-Ƣ01hv/~M@��n)��\�nZw�#�D���O����:n<�ڊ2�x=a�����<���ߏgP�p<c���tҌ�A���x���s��țj3�<C;qbl����O�O�#>/�l՜ߗ)��R�KɤJΒ;�0�W���

9�tk��:�C�F��Ru���0�Svf���d�'mu9�͜������O��l�%��e����o������I!���ӄ	���8��
-������&B�jU�J�N�\��I�i��9�DO���{�3Bȸ��쩛Q��>��+Z$&m��f�]c�#��)za�@�e{06u�|{(1
��%�ƅ݋]�R�G���o:NŲ_�0�Ǔ\ii( E�NWye��f�'�>�
||�RZ���n��7�\���HS���
E�tW�NHwзB^��K�
Q��DE-�9&�R�ŪR��5�fz[9m�„ԴP=���.
6d*��*qj����۬�r���h�
��
��E��}�Hq��zQ5�1���3?�m�@qϳ`���V�s�
6���Sy���I(˾Ğ
#d:ѧL|U�e�G���,rV�!��_E����!r�?M�l�&�q��sZ���@1�B�����^�A�z��u��r�Џ��p�����5W�Tߏ��������6�
yK��Jf��v��1�`,�F�-(�mc���#Ŋd��g �Mr��z�@�Cwr�K�KJצk;�s�Oo�m&��0���^{#纮������R�b�&e���
�����.J���K���r0oB�m�B�� t�Z�I��0��?7�����<+��]��K��_
-endstream
-endobj
-3263 0 obj <<
-/Type /Page
-/Contents 3264 0 R
-/Resources 3262 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3025 0 R
-/Annots [ 3160 0 R 3166 0 R 3167 0 R 3168 0 R 3169 0 R 3170 0 R 3171 0 R 3172 0 R 3173 0 R 3174 0 R 3175 0 R 3176 0 R 3177 0 R 3178 0 R 3179 0 R 3180 0 R 3181 0 R 3182 0 R 3183 0 R 3184 0 R 3185 0 R 3186 0 R 3187 0 R 3188 0 R 3189 0 R 3190 0 R 3191 0 R 3192 0 R 3193 0 R 3194 0 R 3195 0 R 3196 0 R 3197 0 R 3198 0 R 3199 0 R 3200 0 R 3201 0 R 3202 0 R 3203 0 R 3204 0 R 3205 0 R 3206 0 R 3207 0 R 3208 0 R 3209 0 R 3210 0 R 3211 0 R 3212 0 R 3213 0 R 3214 0 R 3215 0 R 3216 0 R 3217 0 R 3218  [...]
->> endobj
-3160 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [252.834 707.957 264.789 718.861]
-/A << /S /GoTo /D (page.59) >>
->> endobj
-3166 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 686.104 140.809 694.951]
-/A << /S /GoTo /D (page.60) >>
->> endobj
-3167 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [263.358 672.092 275.313 682.996]
-/A << /S /GoTo /D (page.63) >>
->> endobj
-3168 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 650.239 140.809 659.085]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-3169 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.137 624.988 180.092 635.175]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-3170 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.692 612.316 287.647 623.22]
-/A << /S /GoTo /D (page.75) >>
->> endobj
-3171 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.682 600.361 287.637 611.265]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-3172 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [243.025 588.405 254.98 599.309]
-/A << /S /GoTo /D (page.76) >>
->> endobj
-3173 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.835 576.45 278.79 587.354]
-/A << /S /GoTo /D (page.96) >>
->> endobj
-3174 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [275.881 564.495 287.837 575.399]
-/A << /S /GoTo /D (page.96) >>
->> endobj
-3175 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [230.283 552.54 242.238 563.444]
-/A << /S /GoTo /D (page.97) >>
->> endobj
-3176 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.871 540.585 263.827 551.489]
-/A << /S /GoTo /D (page.97) >>
->> endobj
-3177 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [171.474 516.674 183.429 527.578]
-/A << /S /GoTo /D (page.32) >>
->> endobj
-3178 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [175.339 504.719 187.294 515.623]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3179 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.292 492.764 245.247 503.668]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3180 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [157.935 469.571 169.89 479.758]
-/A << /S /GoTo /D (page.34) >>
->> endobj
-3181 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [168.146 444.943 180.102 455.847]
-/A << /S /GoTo /D (page.39) >>
->> endobj
-3182 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.337 433.706 153.292 443.892]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3183 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 421.75 140.809 431.937]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3184 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.393 409.078 146.348 419.982]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3185 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [126.633 397.123 138.588 408.027]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3186 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [141.337 373.93 153.292 384.116]
-/A << /S /GoTo /D (page.43) >>
->> endobj
-3187 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [149.885 361.257 161.84 372.161]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3188 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [155.424 349.302 167.379 360.206]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3189 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [153.74 337.347 165.696 348.251]
-/A << /S /GoTo /D (page.42) >>
->> endobj
-3190 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [161.501 313.437 173.457 324.34]
-/A << /S /GoTo /D (page.44) >>
->> endobj
-3191 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 290.243 184.525 300.43]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3192 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 278.288 188.4 288.475]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3193 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.684 265.616 268.639 276.52]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3194 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.005 253.661 262.96 264.565]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3195 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.267 242.423 145.223 252.609]
-/A << /S /GoTo /D (page.56) >>
->> endobj
-3196 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [225.899 229.75 237.854 240.654]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3197 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.358 217.795 182.313 228.699]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3198 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.386 206.557 177.341 216.744]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3199 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.368 194.602 182.323 204.789]
-/A << /S /GoTo /D (page.55) >>
->> endobj
-3200 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [170.667 181.93 182.622 192.834]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3201 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [182.552 169.975 194.507 180.878]
-/A << /S /GoTo /D (page.58) >>
->> endobj
-3202 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [204.27 158.019 216.226 168.923]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3203 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.792 146.781 146.747 156.968]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3204 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [172.57 122.871 184.525 133.058]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3205 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [176.445 110.916 188.4 121.103]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3206 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [256.684 98.244 268.639 109.147]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3207 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [133.267 87.006 145.223 97.192]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3208 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [165.386 75.05 177.341 85.237]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3209 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [383.532 708.674 395.487 718.861]
-/A << /S /GoTo /D (page.67) >>
->> endobj
-3210 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [398.476 708.674 410.431 718.861]
-/A << /S /GoTo /D (page.68) >>
->> endobj
-3211 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.273 696.719 363.228 706.906]
-/A << /S /GoTo /D (page.69) >>
->> endobj
-3212 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [403.178 672.092 415.133 682.996]
-/A << /S /GoTo /D (page.71) >>
->> endobj
-3213 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [373.559 648.899 385.514 659.085]
-/A << /S /GoTo /D (page.73) >>
->> endobj
-3214 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [357.5 624.988 369.455 635.175]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3215 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.263 612.316 403.218 623.22]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3216 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.801 600.361 408.757 611.265]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3217 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.892 589.123 445.847 599.309]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3218 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [424.467 576.45 436.423 587.354]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3219 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.887 565.212 388.842 575.399]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3220 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [417.833 540.585 429.788 551.489]
-/A << /S /GoTo /D (page.64) >>
->> endobj
-3221 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [351.422 528.63 363.378 539.534]
-/A << /S /GoTo /D (page.64) >>
->> endobj
-3222 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [345.883 505.437 357.838 515.623]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-3223 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [395.676 480.809 407.632 491.713]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3224 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [399.552 468.854 411.507 479.758]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3225 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [389.051 457.616 401.006 467.803]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3226 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [392.926 445.661 404.882 455.847]
-/A << /S /GoTo /D (page.85) >>
->> endobj
-3227 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [387.378 432.988 399.333 443.892]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3228 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [391.253 421.033 403.208 431.937]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3229 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [473.165 409.078 485.12 419.982]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3230 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.271 397.123 486.226 408.027]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3231 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.157 385.168 394.112 396.071]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3232 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [394.879 373.212 406.834 384.116]
-/A << /S /GoTo /D (page.88) >>
->> endobj
-3233 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [376.329 361.257 388.284 372.161]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3234 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [438.874 349.302 450.829 360.206]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-3235 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.509 337.347 505.464 348.251]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-3236 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [474.132 325.392 486.087 336.296]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-3237 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [421.45 313.437 433.405 324.34]
-/A << /S /GoTo /D (page.88) >>
->> endobj
-3238 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [434.172 301.481 446.127 312.385]
-/A << /S /GoTo /D (page.88) >>
->> endobj
-3239 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [411.995 290.243 423.951 300.43]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3240 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [412.603 278.288 424.558 288.475]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3241 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.302 265.616 419.257 276.52]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3242 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [370.79 254.378 382.745 264.565]
-/A << /S /GoTo /D (page.81) >>
->> endobj
-3243 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [363.597 242.423 375.552 252.609]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3244 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [400.408 229.75 412.363 240.654]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3245 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [432.617 217.795 444.573 228.699]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3246 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [423.92 205.84 435.875 216.744]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3247 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [433.056 193.885 445.011 204.789]
-/A << /S /GoTo /D (page.89) >>
->> endobj
-3248 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [445.778 181.93 457.733 192.834]
-/A << /S /GoTo /D (page.89) >>
->> endobj
-3249 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [460.722 181.93 472.677 192.834]
-/A << /S /GoTo /D (page.90) >>
->> endobj
-3250 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [419.497 169.975 431.452 180.878]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-3251 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 158.737 381.639 168.923]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3252 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [406.764 146.064 418.719 156.968]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3253 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [396.264 134.109 408.219 145.013]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3254 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [487.431 122.154 499.386 133.058]
-/A << /S /GoTo /D (page.94) >>
->> endobj
-3255 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [468.054 110.199 480.009 121.103]
-/A << /S /GoTo /D (page.95) >>
->> endobj
-3256 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [425.026 98.244 436.981 109.147]
-/A << /S /GoTo /D (page.93) >>
->> endobj
-3257 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [369.684 87.006 381.639 97.192]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3258 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [368.03 75.05 379.985 85.237]
-/A << /S /GoTo /D (page.82) >>
->> endobj
-3259 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [382.974 75.05 394.929 85.237]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3261 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [278.726 44.211 356.036 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3265 0 obj <<
-/D [3263 0 R /XYZ 89 770.89 null]
->> endobj
-3262 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F11 387 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3315 0 obj <<
-/Length 1085      
-/Filter /FlateDecode
->>
-stream
-x��Y[��6~���[a�h%_�>�Iwv�iiB;��d4��ַȦ���H�a��Ɔ�!} �d}�;�s$#����O
>�]����l:��7O�����|}��*=|�˛��	����l�qp�ځ����	��
~ Z���M1�MK�F������D0�צ<�!ƥT�>"d&��y�$A��bŒ�}���DXqyg�����ح�KY�k�M��s5?�m��
AyR��l���6�O
�eա�]
�C��;��#K
.� yFF�<fI.�u��
��d�	�R �q�ņ�r���)Sr�-�s
&]��r�
�Am4��u~���p�!F�u��\H�4Y�΢�*��r�;]D�A�������L��,]%�`��,Q�
��.�eM�����,�6K6�D|&�����1���t1��k�+F����x}��2U��ke{�&h��6j�`�p�Kt�5��
���
3��:�f��;���#V����*��ع���K�ym+�¾OCpA�7�}KP
l)�O/�銑L~&�G"T����^JA=9�M>���D� W
-��w*n�bY>
;���sV�9+��y��Du�8!����l�]�$o.�~�h��
p����/|h�by!���$���'d"R�.�
A�x=2���
\�H���+Z�����_�=�p-
���s�NC��ȋ������)
TA�N��*��L�?��o��~$�Y{v[<(���0�ʧ�x�?L��qzKp�>
j�T/2�!Bn}�{A
/�äS�����5
�}F�ŗ4�E�v�W��՞�jY�mcD��������H���#�Z���y�D�O���a_�ZЌ�Ĺߚ��r�k�y��b#�<�wM�V�C����
_��6D��L=��'�k�����oR	�
7�x�g��+��5֯Ǝ���B�i�K6Ԛ��P_<С�d'+�=-G
i�hX�x/���u!��~ϙ�n�8�����&+�����.trԃ"9��pdI��UV.U�{������YS���6��Q�E�����VaΒi\sWCσ�ݽ���pI&�ۼ�'r0�{X������
-endstream
-endobj
-3314 0 obj <<
-/Type /Page
-/Contents 3315 0 R
-/Resources 3313 0 R
-/MediaBox [0 0 595.276 841.89]
-/Parent 3025 0 R
-/Annots [ 3260 0 R 3266 0 R 3267 0 R 3268 0 R 3269 0 R 3270 0 R 3271 0 R 3272 0 R 3273 0 R 3274 0 R 3275 0 R 3276 0 R 3277 0 R 3278 0 R 3279 0 R 3280 0 R 3281 0 R 3282 0 R 3283 0 R 3284 0 R 3285 0 R 3286 0 R 3287 0 R 3288 0 R 3289 0 R 3290 0 R 3291 0 R 3292 0 R 3293 0 R 3294 0 R 3295 0 R 3296 0 R 3297 0 R 3298 0 R 3299 0 R 3300 0 R 3301 0 R 3302 0 R 3303 0 R 3304 0 R 3305 0 R 3306 0 R 3307 0 R 3308 0 R 3309 0 R 3310 0 R 3311 0 R 3312 0 R ]
->> endobj
-3260 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [210.189 707.957 222.144 718.861]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3266 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [214.064 695.952 226.019 706.856]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3267 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [203.563 684.664 215.518 694.85]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3268 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [207.438 672.658 219.394 682.845]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3269 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [167.04 660.653 178.996 670.839]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3270 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [181.984 660.653 193.939 670.839]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3271 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [251.404 647.93 263.359 658.834]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3272 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [220.968 635.925 232.923 646.829]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3273 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.745 623.919 249.7 634.823]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3274 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [179.772 611.914 191.727 622.818]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3275 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [134.284 599.909 146.239 610.812]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3276 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [191.389 587.903 203.344 598.807]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3277 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [233.999 575.898 245.954 586.802]
-/A << /S /GoTo /D (page.90) >>
->> endobj
-3278 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [237.874 563.892 249.829 574.796]
-/A << /S /GoTo /D (page.90) >>
->> endobj
-3279 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [196.371 551.887 208.326 562.791]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3280 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [180.878 539.881 192.834 550.785]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3281 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [147.105 516.588 159.061 526.775]
-/A << /S /GoTo /D (page.97) >>
->> endobj
-3282 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.539 491.86 272.494 502.764]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3283 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [260.539 457.049 272.494 467.953]
-/A << /S /GoTo /D (page.40) >>
->> endobj
-3284 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 433.038 278.601 443.942]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3285 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 409.028 278.601 419.932]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3286 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 385.017 278.601 395.921]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3287 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 361.006 278.601 371.91]
-/A << /S /GoTo /D (page.86) >>
->> endobj
-3288 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 336.995 278.601 347.899]
-/A << /S /GoTo /D (page.83) >>
->> endobj
-3289 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [281.59 336.995 293.545 347.899]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3290 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 312.984 278.601 323.888]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3291 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [266.646 288.974 278.601 299.878]
-/A << /S /GoTo /D (page.92) >>
->> endobj
-3292 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 255.065 140.809 263.912]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3293 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 208.299 140.809 217.146]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3294 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 172.333 140.809 181.18]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3295 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [277.166 146.265 289.122 157.169]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3296 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 112.356 140.809 121.203]
-/A << /S /GoTo /D (page.61) >>
->> endobj
-3297 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [128.854 76.39 140.809 85.237]
-/A << /S /GoTo /D (page.62) >>
->> endobj
-3298 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 696.002 495.083 706.906]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3299 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [407.881 660.136 419.836 671.04]
-/A << /S /GoTo /D (page.74) >>
->> endobj
-3300 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [493.648 636.226 505.603 647.13]
-/A << /S /GoTo /D (page.57) >>
->> endobj
-3301 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [490.33 624.271 502.285 635.175]
-/A << /S /GoTo /D (page.69) >>
->> endobj
-3302 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 600.361 495.083 611.265]
-/A << /S /GoTo /D (page.84) >>
->> endobj
-3303 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 576.45 495.083 587.354]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3304 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 542.577 495.083 553.481]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3305 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 508.704 495.083 519.608]
-/A << /S /GoTo /D (page.90) >>
->> endobj
-3306 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 484.794 495.083 495.698]
-/A << /S /GoTo /D (page.90) >>
->> endobj
-3307 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 460.884 495.083 471.788]
-/A << /S /GoTo /D (page.87) >>
->> endobj
-3308 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [494.754 436.973 506.709 447.877]
-/A << /S /GoTo /D (page.33) >>
->> endobj
-3309 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [470.385 403.1 482.34 414.004]
-/A << /S /GoTo /D (page.97) >>
->> endobj
-3310 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [483.127 369.227 495.083 380.131]
-/A << /S /GoTo /D (page.91) >>
->> endobj
-3311 0 obj <<
-/Type /Annot
-/Subtype /Link
-/Border[0 0 0]/H/I/C[1 0 0]
-/Rect [447.701 345.317 459.656 356.221]
-/A << /S /GoTo /D (page.44) >>
->> endobj
-3312 0 obj <<
-/Type /Annot
-/Border[0 0 0]/H/I/C[0 1 1]
-/Rect [374.32 44.211 451.63 54.174]
-/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
->> endobj
-3316 0 obj <<
-/D [3314 0 R /XYZ 89 770.89 null]
->> endobj
-3313 0 obj <<
-/Font << /F70 324 0 R /F60 304 0 R /F72 326 0 R >>
-/XObject << /Im3 319 0 R >>
-/ProcSet [ /PDF /Text ]
->> endobj
-3317 0 obj
-[777.8]
-endobj
-3318 0 obj
-[513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 799.4 513.9 799.4 513.9 543.7 770.7 777.7 733.6 847.5 756.3 656.2 804.8 850.1 449.3 566.3 870.4 699.4 992.9 821.6 782.1 656.2 810.6 777.6 627.8 599.6 699.1 599.4 970.5 849 596.5 699.2 399.7 399.7 399.7 1027.8 1027.8 424.4 544.5 440.4 444.9 532.5 477.8 498.8 490.1 592.2 351.7 420.1 535.1 306.7 905.5 620 497.5 515.9 459.2 463.7 478.8 371.1 591.4 499.2 736.6 582.6]
-endobj
-3319 0 obj
-[799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 513.9 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 1027.8 799.4 799.4 1027.8 1027.8 513.9 513.9 1027.8 1027.8 1027.8 799.4 1027.8 1027.8 628.1 628.1 1027.8 1027.8 1027.8 799.4 279.3 1027.8 685.2]
-endobj
-3320 0 obj
-[611.1 675.9 546.3 675.9 546.3 384.3 611.1 675.9 351.8 384.3 643.5 351.8 1000 675.9 611.1 675.9 643.5 481.5 488 481.5 675.9 643.5 870.4 643.5]
-endobj
-3321 0 obj
-[642.5 589 600.7 607.7 725.7 445.6 511.6 660.9 401.6 1093.7 769.7 612.5 642.5 570.7 579.9 584.5 476.8 737.3]
-endobj
-3322 0 obj
-[569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 323.4 323.4 323.4 877 538.7 538.7 877 843.3 798.6 815.5 860.1 767.9 737.1 883.9 843.3 412.7 583.3 874 706.4 1027.8 843.3 877 767.9 877 829.4 631 815.5 843.3 843.3 1150.8 843.3 843.3 692.5 323.4 569.5 323.4 569.5 323.4 323.4 569.5 631 507.9 631 507.9 354.2 569.5 631 323.4 354.2 600.2 323.4 938.5 631 569.5 631 600.2 446.4 452.6 446.4 631 600.2 815.5 600.2]
-endobj
-3323 0 obj
-[892.9 339.3 892.9 585.3 892.9 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 585.3 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 1138.9 892.9 892.9 1138.9 1138.9 585.3 585.3 1138.9 1138.9 1138.9 892.9 1138.9 1138.9 708.3 708.3 1138.9 1138.9 1138.9 892.9 329.4]
-endobj
-3324 0 obj
-[594.7 542 557.1 557.3 668.8 404.2 472.7 607.3 361.3 1013.7 706.2 563.9 588.9 523.6 530.4 539.2 431.6 675.4]
-endobj
-3325 0 obj
-[1055.6]
-endobj
-3326 0 obj
-[399.7 399.7 513.9 799.4 285.5 342.6 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 285.5 799.4 485.3 485.3 799.4 770.7 727.9 742.3 785 699.4 670.8 806.5 770.7 371 528.1 799.2 642.3 942 770.7 799.4 699.4 799.4 756.5 571 742.3 770.7 770.7 1056.2 770.7 770.7 628.1 285.5 513.9 285.5 513.9 285.5 285.5 513.9 571 456.8 571 457.2 314 513.9 571 285.5 314 542.4 285.5 856.5 571 513.9 571 542.4 402 405.4 399.7 571 542.4]
-endobj
-3327 0 obj
-[525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525]
-endobj
-3329 0 obj
-[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456]
-endobj
-3330 0 obj
-[500 500 444 500 444 333 500 556 278 278 500 278 778 556 500 500 500 389 389 278 556 444 667 500 444]
-endobj
-3331 0 obj
-[761.6 489.6 761.6]
-endobj
-3332 0 obj
-[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
-endobj
-3333 0 obj
-[388.9 388.9 500 777.8 277.8 333.3 277.8 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 277.8 500 277.8 277.8 500 555.6 444.4 555.6 444.4 305.6 500 555.6 277.8 305.6 527.8 277.8 833.3 555.6 500 555.6 527.8 391.7 394.4 388.9 555.6 527.8]
-endobj
-3334 0 obj
-[500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389]
-endobj
-3335 0 obj
-[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410]
-endobj
-3336 0 obj
-[500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.3 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520.5 465.6 489.6 477 576.2 344.5 411.8 520.6 298.4 878 600.2 484.7 503.1 446.4 451.2 468.8 361.1 572.5 484.7 715.9 571.5]
-endobj
-3337 0 obj
-[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
-endobj
-3338 0 obj
-[556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444 394 220 394 520 0 0 0 333 500 500 [...]
-endobj
-3339 0 obj
-[556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1 [...]
-endobj
-3340 0 obj
-[638.9 963 638.9 963 963 963 963 963 963 963 1222.2 638.9 638.9 963 963 963 963 963 963 963 963 963 963 963 963 1222.2 1222.2 963 963 1222.2 1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 1222.2 1222.2 963 365.7 1222.2 833.3 833.3 1092.6 1092.6 0 0 703.7 703.7 833.3 638.9 898.1 898.1 963 963 768.5 989.9 813.3 678.4 961.2 671.3 879.9 746.7 1059.3 709.3 846.3 938.8 854.5 1427.2 1005.7 973 878.4 1008.3 1061.4 762 711.3 774.4 785.2 1222.7 883.7 823.9 884 833.3 8 [...]
-endobj
-3341 0 obj
-[472.2 472.2 472.2 649.3]
-endobj
-3342 0 obj
-[777.8 277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 1000 777.8 777.8 1000 1000 500 500 1000 1000 1000 777.8 1000 1000 611.1 611.1 1000 1000 1000 777.8 275 1000 666.7 666.7 888.9 888.9 0]
-endobj
-3343 0 obj
-[222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500]
-endobj
-3344 0 obj <<
-/Length1 1406
-/Length2 5931
-/Length3 0
-/Length 6889      
-/Filter /FlateDecode
->>
-stream
-xڍuT��6U:ҋ
-��{/"��!%�j轋HQ���t邂���T)�)����s�>��ֽ+k%�;���������XP�i�@"Ђ !�
@UW� ��B@�)�	
���N�eCy����@��`4֦Ac��H�� $
- IȀ$e�@�(�7���A|� ]!�=$�Eʥ���G�����:?x�� ������p��;
�B ]�掭����P8
���<r�h����������K�rR� ���� #�
�s ��
Ѓ���P"��8ý�r#
Ѿ
�5���0�6�� C���Z: }�/��_ ��� @B����+
�;�"�= 8�	�w��5t��~h ��
q�Bb�!>��

�}u@C� �2���
��{�����n�8
-�J�m�:�A��C��H�O
��A�}��3\W�����G88�����!l��{zô��`�&�ۜ`h�8PZDRB �����¿
-��{�~;A��XA��Kw�aH1^ ��a����)p�C� {�
A���X3��3v�(���]? ���'0v�
�7���XXG�\E͜��9UT�~ ���@PDZ ���$%E A�L��M��� �s��H��pD��b�m��L|������YA�]h����oB�_���
-~�����W��u���F�nn��<�?�
����]ho4V
�H�D�
5���h]������ZhV$�'�5���9��P����9`ӻ�0���; �ˇ�
��^��N�
�U�?K�#�H�_�� @P(�?)v�ؓ8 �����{��B$��
8"Q��f*{y���~�a~�_n���z�PX�^l��Ͽ������3SH�l�K]d�I��M_���\��y13�vD����
�c���n��eu�#�Ol������G��g����V[I�G��m)�����4QZ
��
4
s�o��Ǖ��-EiPH{�۫�W�W��]�Ԫ�Z��6�yٸ`�i�MX�W�}�$�5� 
1͞�����4y���=�'
�N-�X-�$�N�U��x�f��l�ĂD�n�Fe=�
�GLi���	�dG�+ME�c�0��w6�8�>� �}�Z�JeP%}[	L�xg�$�Ӕ
{��7o��Q����6�-��;6�&N�
-
-�A@�5uq���r�pQ�⨧���}9
2w��
-�*+$�`�dE#�>g�<4_b�$��hQj�
�Z��=w
{P��O������i/Eb�L�ӝ��
-��]:~�Js��Ņ�z�
���I�
?�g\`T�R�".�Ur
u�&Qz�b��j���{b�[Rӧ�4
��“��//9��+��n�>���20sIjܺ�����!w�g�z�ĕ �nr�O
D���;��o��
��|�g�,��o�������,I)�G��S@��
���
�C3_pkя���)�V��;o���Z9}��	��Et��X}��u�īcP]%��ʾ�v�	��0�����VD����ݺ�z�(�T{��a���`���S��u�R�c�`[X���foW�<�-鷤� ���5�!6eJ�kS�o�~܍zQ�;��6����挐p��˰�h����%�� �k�ץ�e�~���l�����K��NP^�筚/����>*�8f�
jO���!3�%��d�~2��y��!f�H�QB%�sɎ����/�)b�3����
˾�7�H�M�����{Q�}SQ�}XA�ə�c�\���Da��m�\���^t-��'�ؤ����ѼA��oc�Du`��t��/p.kQ:�5���j
ô�c��	Xrg�#�+_�b��l���>Ib����-��~���\����!=N��*n\�Y����(�*|���-v����m���z�̸�Ņ߫�ۆ
Z+>
9
�
-�
� ����O}�[t�\]���l�����x��-�R뎭Λo�60��d(*�)��N��վ���
-�J�S��
�S���J�]'����-��tE�dQT
��sN_���{�ӏ`
-7�O���R>���T<g��Y
-�6z;U���
�&.Dn�G	��OnՔ;�Տ���A�j�3�vs3g��w�.1��"!�g�ֹ��P,����]�l#�>�[&ި�d�c|������k�XfP?��h#�rOW{.%����v�W2gҩ�o�;?
�*U��P8L��_�w�Q��p�4�@
7�]!��D����i�.*�75�ە��b)*|8��;�=łe%�����Q�x�?Z�|M/
�߷�Y�9-?޻ύI<7�5{�\�"�Z�YLΒ&UE�`��J$�?�%H��&Ygԩ�����rU�R�P��H��E�E��kK<I;���1�أu��a�"y>h�3��
�w`����@r�6{�x
��&��ܐ:�����Ֆ�SCI���k�
� 6�i�UY)2�O
OdB�W��|����+�stUe!��˫ʘ�cN�����2���<�ԋ�$�����7�4)�Y�~Q{��fUl<k�^��"Ӈ�\��̘I���x8��
2�U� ��˞o9׭)S^Q��%��ڪP����P�
�
վ۹�9Z`�����e܅"�|;Vӌ1��kx{<��f�dd'����ד�`�=��N��\�"r�@�_�*lIa�2�=
�E6���͚��񨎸�.G�r
jݮ�mʂp
��`�`����Ch)��]��:�l�Q|�5��d|7*&Y.���f
-��ħ>�
$᯸>��&PN����ÄD��jI'1����ɮ)hm�կ=�_ujb�.P5��O�<F:�81ƻ1y� E��3XL��
-?��@��d	��-�9�+-e=��RiuQ�B��R�(���?2�9#��&��́C+{s��9�<�.�
�ǜ��ZE� �
�TD�
�TK��}���\梛Q���k���5c•��CQ6�ed����G��)�����b�b�v�~j�{��H�)�gV�n��LLft�S����ܣ,U��tnp��ٙ�X,�!ˮ�r�|Q��[]�	H�8��Š��s{�9w�
_s<S간t�U|
x���-6"�ڎu�"
C�g_c��wz%��?���:%�"����S+��Gݥ��"!\ n�
���8��� �/8����A9+�#d��~@ű�ƞa�bp�Pwa
�x�Ql�
�
-\�O�k/x���
c;~�~&�%wk�~�&��(��@�ϺO���
-r;��d�lɯ�Q�n�[�
m-�@f�
�К��zŻIz�/1�;k��7���2g9��
����1�߾B�.�5�����������t�D��.�3Ra�����=�Z��x���>1q|��SM� ������өSn�w�Cv���<���Y&]��r��"��f=n�N
��
-�d���Db�QJ
i�i���C�ZvX�nn�ǝ�j
���4�6�+�)���8��f�SH� +�`� ��'&
-��z�$��eɓdf
OR�F�WH����$�\aT�i�H��N�d�5.'��	r�՚ώ�ٷ���81K�
I1�%*қ��Ț�v��d��m����3QN,���k�����O:�\H�:�������y�
iw���p�q�
š3Z�{
;k����r

z|*u�u�U�	����8J'
]Y{�Lb\x/�h<U��h�1e��R��&�� �[����4���7k�}���ӷ\q
:�O}_����}i���H��_�r:<�s�����b�d������͌o��m���o0&}j`ɖ���=��ṃ�J�q�es4��]��|��0
ڂ�6�
V`���=�͕�P7[����_��j�q�<�8񡶫��f��<�R��/;y
-ax	`77����;*;v�]tЕf}�q��ՠ��q+/{1�~A4�|C�ŏ�:���X	d��Bx�@
uj���?ԗ�q Ce��
�
-�����ݏ�)}4
$����t
���o]__yN/T�2���j*�$7��ʸ�Ye���j˦O���<J�9<�}�Y�Y~$��}�>߲�x�x�Kw@�,ё9�b�&)�ζ����Hʀ�fc���q6oحi.�|jƃ,�Hc��	f�$Š�D��\�A��{���+�N��)� [<�Ӻ磰:f��

a���,�,
w%o(v��g��g������7���hXJ
kR�\���ꣀS�ԁK�j�R��0����p��c)
���u��Hd
-�}�L��տ[S^*�!8
ᤒq�]%m�$+~-�x�������F>,��
E�F��)�q��� P�s��9�#�W
�k'��9l���T㫇vV��Fv�&�N��w�Ėr>r����(��f�\s�_��3/�SQ�.5K�"[��\�K���4zMl<dgc��#�+�
�>�ܽo���6��G�4�����>���r���S���]FLt
�c9z���-�
v7,�ud�����
���4�Y�U��q��'x1��jz=}�� ��5}��G*Z�O�O�qe���A�ж
��9�Qoj�|
D��3���ʒ�i��F7��h�p%�f顭����Jk�ʛ[y��F�����%��g4����f��÷�
VT���
�0��Uژ+�����&�'��;�lc��]�'��q[#����V�d�W.'M���BJR:Dd5P��2*���a[�,��Q�<nd
�-�CZ��c���/���M�F�_��țʏ�y��j?_H���-�qF0�5�&'� h�N�^ұomۿ
-���\r}����%�����'�cl_��4=6�Σ�l�If2���ar����S�� *J��¨s���x��w�x���_���:�S5���\N�o�Ď�-��^zAj��
���[�G0ԓ��T�d|�����<����˯�(��>�M��Ln��H6()�%���(�D���?�E4G�A��;�	�23l�~f��O�3<�x~���>�NIH\t��'&��9~�����˴���̛�S�VG����pW��C���w-����L�0��R�����Z3��
W,i]?�������Q�Ǩ��� �
砅W�e.}aʠZ�Cy�����󊪪�B�����X�������v�"f��@L�
f7�r�͙�G���@4gʪBW�Plؗ~'�ƕG�D��	)�խ̦�-���ya��4,R7oUS�
���2���2F��W�ʜݞ
�@�mT����f
��W��wfۀ�K}��{u\�uE��UE�����x��a
�� ��)�CD�O)_"��{��
�5\�����Q=�]��?�,����1�x�]��{
��=~��0L�[ycB�
�
�*�`%��NG�����e����^
ܯ���'2U��,�[}hߊ��Q�>�y$D3`�����6�����
��r��
��.S{�v�l�Tu�s�lr��;��6H�Җd3BC �J�5,�6������G>Q������̌�=_k��Pj�)�p�_ab1N>)�d�N�M]�?
Y}:�1&d`Wg

�9��M������	�a	nOF�CvXN�X�ث,33��8�^Dh,�
?i�
Y�|j�ĕ�X��
r���4�����<OH1,��U|Y�m��8��Y��������*p��%��u�cfz�m�G`�ꦼ�~� �7��
���$�-��O��Xc$
����uN���>�&'"��E
-�G�xF̭{��К��4�F���<��ꩤ�.�2Q+���d����J�٪p�B��
-��~�E9�&m6|{xV�֪�]�!�CM�'�|B�tv
-"`W���K�8Z��f����v-��^~s��OȈ�w�
5
*'{y7�7g���H|�d�i�<��O:L���˻���X��/�/��5�o�-w�
\�
�f��%�Jz��@O��}2F�����yLO7�nμ�H0U��nI���Y��S����+���z����mA���]�=�	>A#�������/%�hF6�I�$���嫗%I���3��j��Ož�Ã��w�� �e��2���rbZ�S���16�
=b��D6W5Pzr����W��d���!���x$��6�
"Ou�=�[����g7�*~���C(u��
q��B
F�FL������X�\
5�&�L��|�����$�!!/�
����
�z%���ev��\2�x�"e�v�^
f����i����h�@��������^[
-N�ZZ��S���/�fL��c�`����
^�?�v%�%�͋>�\-k�8�g�O��K���\�~�\d�)�i6��ޥ������!�����̂��+�77W�x*�8
Tf: �H}4W���=$=L�c8ǔ�B2�����#"(����W�X��Ջ�WE!����\lf������ŏq��$֒+��D1��^�V��6�ͮ^�_��(�n.I3x���g�����
�a���O Ns�Q��,e��N���G�rtv�њ����9�B9�8�Z��G%^�j�̼������U1������.R
���Ef���d�
�Ԝ��L�������-j/ʰT*Oj
-��c��Uv%neN�ȱ�'�4-/ȧ�.F0CsF�W�,*�4�_�?2#(i���q�QMP(b@��3p�:_�Χ�}7�f+_=�����z�B���*�d�eɹ��KyP�IwY
L�3�)sq�W�SP-�������G�'+��嗭��q������`����@d/u/�>��d_�Y@���4j�

-��zP8㨵�Av����:ZG'ɭ���}���el���>�+V#�N��3�	1�;���7/+��o������I�0�s�k9p�ʊK�m�]�c�pZViqL9CI��qG~��&o��<��F�$����<��+�Ϻ2'���K���]}$!��]M5�����55�����-���;�O�7�Au>���MP}
-endstream
-endobj
-3345 0 obj <<
-/Type /FontDescriptor
-/FontName /LBWBDW+CMEX10
-/Flags 4
-/FontBBox [-24 -2960 1454 772]
-/Ascent 40
-/CapHeight 0
-/Descent -600
-/ItalicAngle 0
-/StemV 47
-/XHeight 431
-/CharSet (/summationtext)
-/FontFile 3344 0 R
->> endobj
-3346 0 obj <<
-/Length1 1637
-/Length2 8547
-/Length3 0
-/Length 9615      
-/Filter /FlateDecode
->>
-stream
-xڍ�T��.L�"�)EK��ww�8- @�ܽX�K��R�)Z�@�x�S
��_���}���u��Z�73�̼3�̻�0�hj�KYB���PG;P ���� �<
@ 7�a�[�Šv�C����B�8�A��,� T�:�]�\< .~a.a �

-�
�:
dA�K�@��c1�@a
�k�C��L� .!!�?�R`g���B؀

2Z���P
��_!�Dm�0'�����u�gf�A6 -0
��
-��.�r �U@��Ӡ
�B������=��pqq�;
���T0��`�?l�������O����8��
���:�@�
Gk��

АW�@�#�  G��@�=
��rA�A��?��K��
*��>��3��s�!��k��
��r��2P�#���|�g��C�=8���#����o�
-�hi��
K��#���$��A����� �x� `' ��†�w
�#�o�C
>^0(
`�P�b~���\� ��
���߆����� �
�
l
q��'��l���0g�;�5�~\ �����f	u����Lj9�䵤��Y�*�?Fii�;�������py>�
�?
���?�� �_��WD%G+(�w��U<���J\���_{�
����B�L�����x���ނ?\����;�����{"y{�?�L�?v����/��]ˡ}X������h5�%����J�ÒH9Z?�������
����-5!
�?���4
r�C
��P8��������a�,�
.����4�����c��e��9�
-���w��� rvy`=P�A�xq=,�%���89
���C�> +�3��A
	 8A�UJ� N��H�� N�߷�C���q
��� ������]����@*N��� ���p�����aK@�{j�B�c����'�������/�!��?"�Cv�?��j�����CW�`�CG������`w�֏)��H�mup�E���ڰ(�~ʅ7�p�	�Gn�t9N;#} [...]
u��;���5�y���٣�x�sJ�)�F��I�υ
�{�4�"�;0%,�{��_Tw}�wc$.�PiQo�,JW%����S
�dޯ��wB�"�û��(��d���*�m�Xqn�K}�s�T��ʮ�k�9�~JY��zs9�7Y��;�	���$w,{J��.�ՏlV�v�i�:l����~y^R�戥S��s�#,g3èQ�����z]���
e?���BT<f&�F�n\T��^��3��ʼn�}\��S���j����2�`U��$�y��*(���>c�)dB���`�M��x��Pp���+$�\��n��q�ᙗ'�]�q[�4�SE�c4a��R͜���W�\�_j-R��d<�
�ϼ+ܗ�U�
��>e�-|�K�o��� �������hR��pڲٕ�7��?"�X"�g�^��|텶 �`�D]�x�� ��c�j=�J4��荵[����`#��`�?oN��W�u��j��O5��{���4�
-,�@\�F�V5$�l|؉f�����ڊ{�"�tҔ�<^E1����H, �C�x#}�ǚ��8]
��u�)���=���4�^��Uo����#}Z�]2������K��-�+y�F,spB
þ%�Q�[����qE�SY���ٌ�
�Dܖ��*.�W�A�E���\�mM��% o�6��Bs?�N7à}�׌@ۄ�j$�
k,�2톐
F4?B�
�ضՔ	 t=e��Ca�멷u��u��Ne
���aA��N�Mԇp4
1��KM��~��y��.��$�<����`{0��T}e��p�w��k�ut�`��/��j�4]�:�4
��]|�jZ���5����Y��{��_N�k��U�m���y{�UO��8X�IVZ�"���\�e=M���%oN�N>�>a��+Wb:
�w,sS"��#ODUz����
_t�9���qE+]5
��3�H��M�NJ�ٶj�=�U�y;No�h��`z�@o��*���
�����:�G>w��3����-����1;��d�����N�P�z����2�pձ
�7

XB+KW�{u��D3��:����{Zn�Ǘ��ž�����8�0Û7�(;II<�wq}����39Aʹ�GN��%�+������PATm�q�D�g����Zn�D
���f|��'�t3�C���'�9�?V�8@׀�
}>�f�Ynxِ�GF<6q�-8��<���F�A,
GM�$��$0`O <"���=MRT����}'�OPFi�T,��M��N�o���@G��X(��
^y������ӧ�S�
-���3�^r��&�h��5T�⺸��S"�D�g2uV��G�X��͗��r[@@�g���b�T_�S?�z�Vؘ�t*����6:�n�FTG������R�
����Q�/T�2���RK�
6�z���_���3ի$��xv�����w0
xd'
����~O�-n�`[�ate/��+a+����<;}m�91
S����K-s�HM�m^cw�
��:�o�8:�e��b�ܽ�K���X�˒�jL��
���ʗ8���20�ͯ�"]2HB�-F��L�X97!�1�ä��H�)-ͦ'�!�	Ƭ40��!�e�\��c��8��+�N�|+�����Pž�j������A��!�ː-��܄]�5�AO�jL[�Ň�X��ʳ��Z����"e��؝GZ7X����
"�:�

�
�6�T���Sx6̫�3&�'(L�rIօrp
-!��*=�
��L�/h���Ω��b?m��M��U��S���Y��p5k�h_qcX�u�Vo[���[�ݚ�b�Q���L�9So3P����%:+u?�
($�5��ܐUJ�?a���k+21d5B�qf����r�x���z
&�v#�W4Qd�3w����)�_���Q��;���!5W���#�Ez.��-G�N����

�p�4[��)���Dl]��3u��um��I��$Όx".A�����'k�<,Ӷt�]�ۂ���G��G�4
��C�w�[3��"�~X�/����뛓�
�����8h9m��*�&���GbK*���̔�*w��
��i��R�
M��D���DϢ�=S�꣦ħlj�}�½_��
d��c,$�1:�B1�rM�����3IS�Qx��[�uR\�"�sZ
#ϼ����c�σ�l�м2����t��To��<�U�=�ǎW��g���l�-�B���=��t�L)�����n����1�u;�9:�>Q��/I;�� 2dGl��lU�Us{fL
��#�a�j�#�����>��_�@�jFR�!�2e�x�z<a
-Ɨ��F���Z���*�,����sW���.�Q�wۣ^@�M
���n���-˔8�]=3�>
��.-���t�h��y�ἀQ���X�u1;��ۆ_���AE��Ik�������K�U�9#b6��INS
ӌ�
-�c�\.�@c�Y V�I����x�*ެ�B����[v��OM��Iv��'ןT��;D�K.��I�X��x�<�A��F��t��}�R�
�
<(?�F7����t���q���j٦.B���K�>W�[l9K~�H&�P����-��m���@��
?~����D���j��0'6�3�W5����t
X��)���K�/��Ċl�iF��Pl��;z�ܺ!���Hy�r�Df���U7�g� �i؜aⓃe��(��x��y*'����� �ܽ�$��
-���[��
^��a����o�
-If�d0RX��R6R�x�x�0
�
-�j��J���
���-��}D,j�A���
�v4�2���B[���|�|UG%7v?~�T�6)����lW���4�����<�pW��
���!�8}�*r϶bE�Xg��=h?�\k��
-n�P�������Ž
Zź�6�����)�
f��&S�t��zk@�����;����j4[�9����k-0��5n����L���DyE�դ��S��&}�3X�ı
zN�p�T65>�c�U�i<L|⳹����I��*���o
b�'E&�|rQd��w���
�A;�ػV�d�Bg8vH�34��wv�-MC
-r6��O�B �DK�f�+�B�4)P#I�x�N����g{�
r��s]�Pv�Q�x�'
���|�
�7��	m⥿Tܝx�򗾘"
-��Ҷb�y��O3������JV4'p�s�,9��
g1Q)�o�h��L�T����㠟��~X��,5�	7����dF���7J���[8��3W�ߴ�i��}.M�ߋ\�1R03tz.�����i��D�����}����ʱ
m�k{d��
R�DJ��ܠ�x�:G\�͸�BD��<��Z¾��ڂ�p�I3�����;�͎�z�����/�\441~���s�k}k4�6�M��k/�ʯ|A�p�p˗���C���+������;|4%q���Ĉ�3�!4I������t�"O�>
���Q��L�+Ŭerbk�%.7w�=�D�Ƿ8�>��U���D�`w
o��
(X�mJ��B!�w)-&D���o��>���?�����&��Qds�L������\�(��<���� ɵZ�����+qz;�XQ�P�?۰�S��a�8e�>�vrػ������Ru&�uz����ڑ��]�z���z���R��{����X_P�|�8cg�N\�N�R��n� [...]
ﳾ���vy�6,bN��p:��PW�Ku�o����^��d��<���7�e5e�yU����%���
��i�����N�$��������O�P)Љ}��\u%dE�������n��?
�}����𭏠3

������ٲG$�{A^N5*�ʆv�,13~�^4d�XѰ���sH�&���ebzV�#��,�7��E�p�Pf��<���a�����v��_%W0�
-R"Aj�o>'=#��{_���W�|����&8ZL
x�=2�ݦ�y����|"3I#
9W̽:��-r�{��z��}<�-krŘ��Z����#�e<61wӨ�R]�O�:?�k`��JϬJ�Ho�ɢ}�F��|���C6�G�c�S�8�H�}��3���^Y���[�9�3t`�<�R���
���$?�9��C�;���g�����؉ǧ�C$,���#�/EOH�\��MA:�jf�&��-
�WI�o��,��akN
Zc�}ϗݱ�N��]ߠ�(��T6�yZ�N�T��3C�
��>��OZѷ�,~t�<,�Y����%��#g|���a�P���Q��#:�P&/��r�� �S��J.�y+��,6
3W���^�9L���Bm���X�M���
-�k��
X�K!�2��:�S��+-T�Q�OjuP	��<}�	���)T��C&��X_u
fIGU-F�o�5b�0��
-����Х�-���'~�~ZO]���h�|�PЙM��d}o��B"捈�`��� ��+k��E��ݐ>�q�%��f�~'Ot��^�5[sI��	�
�ϟ+�����/�=��E
�
��0��O��CX;�>�2�m&�)P�	��>��P�<CT7,�U"t�5�B)�x94�����7�^4�e
�TQ 6���LAO<
��!�}��-�G��*5-�7S:�n�p�0��m6���3�G������-���뒼:UK��0d��i8��<�F{��‚rI^X�n,b�J,0�Nh�3�^�@��S6�#�qV��|�S05�J��
���r�.{ۥ1���9I�K������vfR�N�t6�Q�-�G�Z�L��,�W�cE�����شl�7{+q�t����=�
-d6;,N~���~����9o<ib�Ia�Bp ��b�
����W-y�"��.���!땷۰��EdG�;�6�^.<ˏyM��*�;��U�<�0k�;��$_���ߢ��Y����{Z߫Դ��v���I}7��#l/��b
Ҵ~�ga�iLj�8��A�k^��3�F�=]��pR$R3�cb�J��{�m��j��gKB�+�)�>���;ӯf^v��`

%�+U&|�\��m����P�>�E��n�4k��8��}Z2�n�N���
5�C��� �~﨑/��Sz�.h�l~�u�"ƝG��v�&��J ^��Lbq��Ԏ
�57�����ykq�E4
I�$�E�j��m��ze�撌�7SNǗ��
J�㪼eU�����9�w�w���Dz�-5��~�:�<�u��72[�H�bOdk��}%[%J&�C�
���kGN�J
*�2V�|'�c�5��uz��X�6o0b�ə��>�|�d�،\
*/���g���w�(B�嫲H��K����-W�-�k��tI$����E'}�n�x�*S�&�Z6
Q(�[���FE��5��-�e�X7�1���gEM�S�2	 ��畜"�vH^���BG,����
��BV����݊S��
oAB�Of;����	�;�w�F�݀�`�Okj�
?w+���8�*'�o����
ܘ}Z��\��<�3c,uA��iB+��@�oq����	(0'vm�6V9
-��P�7n��ZN<�|Z�ߋ;���{>� ���H#��&�|��Ev(������*�X簜�{m���Y���
�A�{j���!��}�!���X1� ʪT��
NF�BX����O����c���4�$������t�
-I�FŭN

�,�k:݉�PۨШ�z����8N��G��!>ЦȢ��+"����ݏ
1������
�j������f���5l���G-����w4tm��Dhb��S�k��V�%�\$����z��|ғ��Qb�l�Nn\"}�$b&J7�T�Eo��Բ<y�Q�ˢ�����:�!A�!!���M�X�
��kX�"9�kK�P�Xet�]�̜��N=�O�.imLd�j(
���%B�ɴ��t�Me8I�m�_�&@��G�˽��2œa�

te�B��
㒉�(��	Ao��֫`>Cؾ��GH�U�e�-9SW�q�J��/t�o��m!����Y"���Q��T� p�g{8�H�O���EW`�O��q|Jo�Mk�7?�I��ͼ�r�
�EI��x���MkiDU���{
�8<Z��>�
M
B�$ �u�eMd��Ew���{CI>qw��Ĉ�HϦ=�x6q�˯X&;���J�t��/ˁ�I@���ns�2
���
�dl�mլ]�H��<
��P-R���\ 
��9h/���
MF-�ɂv
��Z��H��鏤;��2
ۭ��5�8�$��ԯC3��=�H ���7*\G�$d�
-:,r3�s#IϷ�NV�vO�j�̚�z���%V��- �w����{�IѬ���B/�-m6�̢�ɵUV�c�
H:��ǯ�����i¯�2���a�o���9ԷJ�_p�?C��d�vc W77��'�?G�,qU!0��&��Q͟��c|�˾?�/*^0Ah�_��
���w��(�]�OL�
-�3�.g�{��V����QJ�ɰn^���%α�du����������6T��S�4<7�){
v����Re�����$�e�#�5_
-�b�k��J;u��9-���8-ծ�Vl�v<�Y1O�`}�UM�3&i���p����29C�

��N,A��w�Jq����F1�����/M��`�r��
�d`�������8N�R
��s�lIϹ���� Ym���^��ؒ�W�'L�
�T�
��\�3K}jJ��y)
*0!p]�HH�!�tVN���:�q����N��;��)t֝G� 8pN*]|ϊގa}`��)X]�|%��=>��`��?�ݬN��t��N���z<^f�xpa ��N݄Z��N/��~J?��R�n:���@D�[�J,x7I[�z
`B� �8���ױ��g.��宱`���aW-�����
3�~@uh��Ɯ���˦<��t�Pz!�f���ԃ��r�)��*���m�@�د����>"�gLV֚Ӓ�l�����L��}S�9=
������	�Us;�|��b�P����,�I��~�
A� n�4k1�9Y��FJ�B���2�hؓ0Z�3��YN��8D���a�d�cR�-?.i6]OvcM�3��;�=\��֕��qu�7�	
P<
-M{F��J���J�MNE�м&�{���S\I�|*�,
Axa�]'ljD�u �H�d*"Xh�"��-O���J|q�,J�g���l�uO��ʣ�E��@^�.eHZ�Y�qXs
���r=:
�Z�ޝo�m:+��\�+=eA���u��v=����,4
��
������v�S��͏]� ҳ���X贱�qL�����T�7
ie+SR�W�<;@�WM��Ico|4-��-ŠE�hy�t4����
-ϓw	�G����A�^��"�����MϞLe�� ��
��-���̳q��x-\� ]ğ=�L)�Nl�g�/@غ�
-7:��̍N�\�%Py��|&�eo�m
-�����]�"��6�^\j�(�nx?��쑀܁2+2�"������T�h�����56Mɗ�/D(ޒ-Ք��C^���C*E��}�Gp�����Qܧw�*�&�
�B*�+4�2|�_���^������{uJ=KC�J
���C�lE�J�㙜��\X�>U�1[�W�Ev��~Av�r���r�0__����}9�B~
󆨤?k�[O�PO�Z-�zغ��
����jG��*�H3��NG�U���A^��٨�1�i�x�+���R�/6�-�M
�������+˵ȵw
-#bx����K�JxO��P���Օr�[�C�4�Ⱥ��A�#J:��V�M?/qq��y��;�h�}3���C;����B�kE�Q�K���U��dk�s����؜�

>�����:��`X�����0�
��
k�&wd���ȉ���9�d�7
-������v2�hߞ�$L���*��1b3��0����bw�w]��>㨑/�n�1h���p
�q\���_����O�T��+���*�t:�
@���&�Z���B鸶<W��7M:��C�12|h��-$8��A�C��{Q�:���1V����ڒ@_��aL�h�����˜Wp�C�ɲ�#�t6:$O�X�"l͚�B�2x���������y8Q�dm�oH.;���p�!;р��K���g3�!�U��sA����.=��V�A����jYTOC��I�^
-endstream
-endobj
-3347 0 obj <<
-/Type /FontDescriptor
-/FontName /EFRBIB+CMMI10
-/Flags 4
-/FontBBox [-32 -250 1048 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 72
-/XHeight 431
-/CharSet (/a/b/greater/k/less/m/n/r/s/triangleleft/triangleright/u/w/x)
-/FontFile 3346 0 R
->> endobj
-3348 0 obj <<
-/Length1 1438
-/Length2 6052
-/Length3 0
-/Length 7022      
-/Filter /FlateDecode
->>
-stream
-xڍW4������n�����j�ڻ���$$���TQ{oB�Q�Z�F��=����j����}�����{O�I~�~>���|'���F���p;�
��
-I�ut4�� !!!!abNNc(�򗞘�>���a���C�0:
-��4=\ @ P\(!-$�������<�� 
�&
As*��|PG'��_� .07 (%%��+
��
-A@� @�r��b*�A. #8
-A��+��
-�&-(���% rE
-��r�| /(�	`AB�{�O� ]�+�4bN����`w at y� F�C`HL��
� `��4�zn�og��|�?� 
- �N�'�g"(�W0
����`>P�#���i
��Q| ���#�	�ă<AP�
��W� ��� �A������H��O��?�`�Yf�
wu��PH���@0��}�
�!
���Kr���
~°�p4�A�= *|0*�t�@LHRBDR
 q@��N�?
��A~�?�
~np7�$ � ���!A� 
-�	���K�@ �

-F� �P�?�1j��o3�`)�� �����5�a�p���?�F,h���kp��俍JJpo���/,& 
-	�$0����	����V�ӝ�?5`pL��(0���?����7܀�Ѕc
p��+!1!0�
��ނ_!��f�?���
�y����s�v�v�+�����
(�r��1+�OWS��ց�C=\�Ӫ�a�D�!:?PT at H�
�T�zC���(��o2�5
L
(
�GB^<�(!���av�s� 13�m!1���5ޟ2�j��C����Ia1q � �c(��� ~@���C�q
 ( ��0! 
� �
A�s��� Aǟ7
�0��:!����&~*�U
�@`��EL+ɿ��&���eœ��Z��(2x�
���}7�*�!D���>��`��5�U�6��f�ܡ���=g~��o��兏�7~�uG�g�W߰?%��0���5a囦(1K� z���;���
{�8����uO&zݾY�&�ު��YS��M�(u{��l�o�"vD{'w�5.t�UT�n��l�)q�W5�B�@�,�������!+{
(
-U�~FQ������%�[�~v�T��F:�������Iͻ�V�f�YQN��[�dmk�N��S��P���Ol�
�����7O<
�9��[Xv��9��+��ߩ�� ��;E�h�*���i
d�*�
%�X��I�:0U�;��� �=\�::�(������a}����~�`���ɪ���
D��/���dE����P��+�TARr��N���M�|b�QN�u�$]����	wO�
%����k�
ˣ�$
˷�����R�w�Zn}O�l�4>V�u�^
�j�)
���=�ъ����XT�H�}{�|�1}l%,춄���r�
g*\D	�L����|���JȂ�lӭ#�)����ÚYOo
�5����8�Wz
��BZ�E(��$>Pqci����*��f{a]���M��g� �崿K�x�J�6 '�d&[ÄS�1��ڌ�S�Z����on�Rj��t��O��Z_
��W���{�
-5�p���6E�G�+�!�3�����T<�
+�M��7D
-sP�ۻ
	ӃO
�
`�'�Ác��"�֏�e��;���'&����'��ʙ�Ƶ���h�wb�
���-�a�Ĵ�hb�4�z]^@B
�a+�HwyRl����0_��j���"�F�xM��U��
V\��g����ڴ
-Crh�%Sq��
��ܔ��,����b8��V��g�
��d�&O��
��M����M�>�,Ta���v.��
�y�_���	�\^���=r)ֹ�� J�>�����	��y�bq�
Q괹��Wz�

��O��F��H�L_&ٹ�
��HfqV
����
����
cV at sPtɚ)'lΆ
 
R����ꠔE�U�u|��"��>�����K������+�2c��	K�K
���ɭ�����r�c�
-�w�&u������|��I09k?���}�+�T
-_�5x��K}�n��aKiӞ�:>� }%�z������!��5�4�E����ym� d��m/%�h��2#�_�-�����u*7�8�
l2��
g�g�Z';����2ߣ���!į�C c�p9�����K� j��y8�g�Du�9�+-�Gi2��('��r�>DOpV���tݜ	�=�Z�'@��J#����Z�$���9Tr�IS�h

->$�m��o�,4hꖆb� Z1
���k��b��
|�3hY��������pI�-�t�}itW��gӡ�
�+ň�!�ljT4*_	�AKF�.T����aEH�̿�j�Թ�A��9׹4�	d��Pb9�|��ְw���S� ���@������e������A){��'� 
@�¦̭8Qp�IQM桓N/��h&�0�k[�RA:_xM��>p��_b=
��}Ǻ���
!b�L[N骔S�\E�1{��ᫌ
�b�c�^����l|ޛl]�L�b%MZ փ�����y�g�;7WO
YS�6��+[��[�T�,�l>@����S�MF��X5�u;���A3+��7_/I8����}����I	��\o|���˻j�.ja�
{�
�
H?�d;���~8#�U�9�s�Jn�1�L��m�Umq��@o�Q��6ix���G2�E��o��h�����h,����+˱T�x=N��`yW{

6�|p7^��ܼc����T�f��������j��=K)��4t3S⚒��#�Gt^cɮt��3�(y�1���H����x���w��ٿ�.���NtI|�Id8.���K�^�"
-�5�
��v~���m�
'��!�Ti�eM�k�2Ұ;����0MI~üIk����5�2�9����#ה7�I�f:8��Љ�d����S�����N=�f�b��U����
����
����
�\��g<
�
���=+8p�{�&|�e�ш�6I;_
'o��J0
��p/�_ҖF�%4Wf7��C�G'ih}�"��N �t���Ać�Vx6��j`(�л�`g��P�޲�n�y���1��[z�Ru�Ih�fAN��+ߖ�[��-�UBS.Ӟl&±�7%.�B���
r���w!�֞�v,=�6nsظR�B�C�}����	젘W,��3*�U+�j<,{�(�/���l�Bo��;��%_��"�MA��C���C�ӑ^�[֨(�ݖ�q���H�Z+[�B���%;��{������
������IL��j��Jús��Eu�l�U�'�>!G�t6˱c&E��1蝠OO�i�	74����?l��
��Y�:V����*˝�M��
-e���
;�]k�C�v��5���^�]��"d�0�:�
�%�5���C�^3#0P0|��a���{cX��n�[��k
��I�
���)c#�]���*
%��63 �\�c���9�M�#�4�IƙI<�x�V})���[�]��
jLzd{��LU9{�����^
üdYMq
-��������	��78<��	h���=N
-[�.�k�
�V
'�^,�Ÿ<�B'9���p#
Qc7�n~�%4@�F�+�
-ߣM�BQ���`S����C��NJC���B�(��}��izG����$��u�[c!�}v�Jj}��w.폵�ɸ �;�f\1�I�`�F�腾�20Fxm�^��Ahx�Wj�Κ���/^o�5��,�i�:VP(��]����z9���V�k��х������Z�B؇��
7�������dM�d�+��+��|Ƴ�X�o����#0k֪��w��E��T���ndI4"��T���f󍒺� 
u��D1�
��
-DХ���q��	�m��X�u_�X�`�;����ʩrg7��1

-�&��R��}��yt��/�D8!�/oN
U��o�Ҫ��m%�ow��3[D����%ϼ�~��^��m�o_P�H}����B�6�E�vt��܊�Xj]:�l��`��~��bHa�06���{V��>-�l�`�d�o�Pu΅���չ��Z-j*�X:z�l���TY�i�q;}@�w��:�^��eV���<"!�mC3�
[��J
���ԾrNS�kL
�x	�r����-oL��;
r�0�D
i��
���ڙ�v�w]��A�("=���ް�*cr������1��8�i�hm���>OhD�{�.ܯlOHB����C�
.�:�L�?�Y�%���e���K
J|/N
u
-)�lo�`�3$�
_?������H�K��֫�)<��hn�m=UDL�$���a �-�nّ���`t1�3�5꩔gN��BźCzY�=�q�9`����L"T+x4�<�b�G�Ks�(gv8�ZrO�����Ԝkx/f�S;]�h����6������F�E
Ԕ/d��l&Ɗy�R&+��
�\�fq�T�
1���`y�c��ʹ1��U����mmZ�9�-	fgd}א�˖�
��$Q�Az�+f��Z�=�l2�LT� ��-�a�!�e�"���e���O���TW��"�`r�Őj�Q�w���2���z�6x��9���s@�M�b���೽��z4��\�W$j��
����������s�⢰>Bō�g"��l)��I
NAtS�o�S�����
@�%a����s���.��U	{��\�P�/(��R�����Wķ]T-?��'��2
-�nqj{e|�0�J�Js)�5*�E?����[Nެ�#�O���`�W���������LkX)�<��+Gj���z��G*�6E�BT���FS�	�Ն���L��.�a�R3w��$���kR�x�]�����A@�]2��jHVZ���
ҹ'��{�Fc��]��o�S
-�=� �7q���&�XQ��&�S�\8#.W
-���#r"�s^�ԛ3���%�1��j�Z=>ȉ1�f�J�
�\zx;�E���j�

-��������7f9��q�w
��D^�Ǔ0:nJ����Y�}���Ɣ%�RjL �%��
]�5�ٲj�O>BD�_�X+�ͦ�e7l*�64�JְK����Rn��2��7K���>BvU�e��s�꺙�r��Ԫo���]l+#�
�J\X�\�K��֔)���-vΚ
-�
t%]u9Q	�箱a����k�}�/�:
-��I�L��e�<
��������l��?'���̛6�I�I]
ʝ�u�=� �
�7
�x����hA�
r�q X�{���xu�6|Z<�& 2Z� � ;e��z��نI����ַ��x�8��sL�����[5G)���-�|̢T�(
^M��
m[�
�cj�
F�.
�*x�e/��I�ڱ2&�"_=`���:�>�Y�S?�(�
k�g�5�4�!AԺDɯour��{��6qgLE��ǃ
hD�G�b
��	{h;�C�!>y�ַ�ү�83�e�Ė>>V�
q�xJ�e�;�^LѽM
V�Ux~M^¡3��U\�~2�'/ev^��͌��S�����~�
 �
f3C[����9}��)cc�
%���3|f
:�7*��Y��Gxx� *�AB_��ؿz~�����{E)k8ej3İ܆�	��{��b���4<�j�d��������,����N�aDJ��D �v�*��#&��+œ�Y{�������2>��˦Ix1/Ֆ^Q8�pH�)���c�–�mjKC��ͬx�����z�d���h��|�e+U��/S�D��g�
;����vVM;t�g:472����Ex�����.��q(�j.>)�o��DRl�V_s(�L��-�5F��#�7��0�M�����
�Ŕ�?�>ᓹ\8^eꀞ�w7��(<�3�"-����5�_��v�L���
��2�"j���Wr at g�K���d��o��MB�{G���O)4�k��%8Nؒz�Y뒯>8|?�/l��"�$���%��]o�5�Q�Z���\_����ŝ�i
���(��'MG������O��>L/�<��6�]��];��nP~�
e�da�/ͯ�]����A��;�u����r5�#��=@�{\|8���������]�-����ǡR���W$�J��G��ll�u�H� <�V$Վ���b���kn�vRH��;�x?|�*7o~.��{��Of��Y�d�E�
���Aϓ�� �����H��4��]��_�_��a�:��lgV�>g%�ÍHQh�*o>|d93I'�՛ϑN�GR��دh7�GE�o

4=xPx������:]鏔[{/����.
�z��~�4���c<��MpǴ7$/���w�L�Ɔ�.R�y�ْ[=_�<��-��O�U��j���'4J�уHd�[00�@;>�j2�=O2D��>,���H:M\�~A-�2�aˇ�|Mvڝ=������C<a
o+��@�.��]�S�Uur��Ƌh�i���J��z-��N�:�/L�
x�G~�:yH�qѩQ땳��DK��WH�������\
=�ؐ�i�\�n�(lN���пa��L�/�~g#[]�k�+�N�}�HD\��Õ�g����v�L��;6�xc�
$��`�9�
G��U�>7��}�Mwֽ��:�I>HM��׋P�A��L�
mV�m!\��>ꊷ7��*~}�w
g�j%��Q��F�MhQ��ȴ�S
,��=WmC��Ee�5&\�-ϛ8����N�|+w+�Y����
�� ��BcRHK%�+�ZM�ִd���{��B�h�����V��
��0��d ^��1�)6���9����z��<��6����#�("^�֝���<��'�є�Ujhᘟ��� �`�ˇ��YI+3�,���֜�i�dNT�.�sH{rw�
�
1
VT]b���)*+�U�\��nᒎ_=>�v�Q@��f�	+�r�U�4-��v^y���vx��l�s���?�%�2|��ȃcv!'q�{.�|������上ͧ4�h�7C��hL
�;	=Ż�V�L9���
�
�������G��9�Y9���]C)��p�η*�Ef+}>
�IW5���I�L��[e$�M���W��C�Y
-endstream
-endobj
-3349 0 obj <<
-/Type /FontDescriptor
-/FontName /ZGGNQH+CMMI12
-/Flags 4
-/FontBBox [-31 -250 1026 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 65
-/XHeight 431
-/CharSet (/greater/less)
-/FontFile 3348 0 R
->> endobj
-3350 0 obj <<
-/Length1 1467
-/Length2 7070
-/Length3 0
-/Length 8050      
-/Filter /FlateDecode
->>
-stream
-xڍ�Tl7NJ���h��ɑ#�1��`�����.���F�$���T�o�������9�wv�v_}���w��`�3�W�E�@�8�_X at H�
iH ��D��D98
a(g�_jB#(�
������2
-F�u*`���4=�¢ a	aI!!�����ߎ�
@�	�� �8ԝ�C�ꃄ�;��e�>�!< aiiI��� E(� 0�ꂮ;
���r(�������� ��] �����x�P��Pw(�j
��v��A&@�0t���� �P^`$�V8� P�;:�n
E��� ]W(����>�_w�O���%���!��+����`�P�.P[ ���ᶿ
���t<�
s۠
~w �`4���C�0W���;��D�_iз�
-�UF��@�(w�_����P��}�L�	����%���v�@�z�
->���<�*��U����(�������0 ��zC
�7�q��6�V����"\vhP�
�C����PH����-
-
la�j���
�������G¼fBh�	�~}�s�@��w�����|uAƺ�z��Ǧ�����k�
�EĄ���������k����z�'����}y������
��%th.C��P�\H\���^��!������F��m����������1�]`�>9���B��^���C��2j
�p�_�
-�^E�=����bBb�0w �j�CA
���Y�k8��P=�;�׋���z� N�W�
=�?&�;zQ���K�����}��!�_�(". #�`B4!В8�赵�z��;@P �@�C h�� ;��ט� h�K��(
���(
t�GDD�_�$@����� 
H$���TB7������B����YD6ı.���"���
�a�����
K|T���Z�AN��Vp�Oh�إ��v����7�O��
>bg���
{f��ٛ3��I~�
���-ƩJL2��~
=ƨ;o
���p�>��K��(Jj���t�yY��M� m����j3d�)~B���m
���ɪ%�yI��U{gupxh�ncwT��g���s�]U�!1�Z����Wy��{�d~6j��T���4�Cʅɭ�4�Wlx&��I�{4�
�����gi���=�Riy�Y��#�l喁�u�~��>��]
��L�f��;��CU��Ӏw�Q��5S~�|�,yA�=/��y��p��wn�����P�G\�7y̭a��
��3�}���e^v`ƌhʨ�m���Y|p�5����&'&lj��c�o��ķ�S����M�`y���<]A�u��������?
o[�_bW�JsP�\\�yL�K�Z��"k1
�I
����cY9�������Ko�6�T�h`��g��� U`�#�|�D\��sw惾��*�A�� 휲g��Q�»��(NABE���Jv����
-FI����a��(]M��J�姘C��M�`��7
�"� {��ZJ[B�K�E��B����@�8+�����E��D�t��%�\�
-M�wk�H��E�J�g�����ĩ� .[����E21^D졖<o�I�|�y(y_'c��k�5�e��+��M�W�T�[�\=�q>��ќ�l����w��b��m���r�O}�#�?ѓ'&��լ�.�
-��d����&QZ��Y
Ű�؝����������2;�����cC�b����U��g�
�����%ń͌��h2t爝=;��
L
���_HM�6��qY�OE7�k*Ju�����\��GV��oߵ7&K�+���Ǘa��6�0Y{Ż;������l�d��iE����@��Bԉ�8y����8�ckuC���:ɍ[�� �B)&e��t�g9�w
�����g:wP�J��{���V)��h�
�.�L�����ع��I�G�/)�w	
n½���
|w��w��cO��|���`�?G^���&bTwqB9q�
-=(
��35y ~���9��`@��;q�
��u�S[������~>�D��:KQdncX��J��
����d�c�X�h���O4��J���Hd��ȋ���i��LW�|���Cn�5
-�,Ͷ	!˕�6KqS$�
�W�٭�So�H
���z�<?0��V�8\m4L��
�c iq��a�({�e8��x�v��R�!6�,;�KBo��5�
rs�hӗ�hH��$�d<��K���<u�J~�6I��~#��Y��/�RloW����N���~�J��L��&�O�!�D����U�]�����إ
-���
-���Ƹ��s��/�	%�|z�8|�t,�:B�K�P����iƚc7-F��'�W��gp��Y�D@��N���D���S&�[�S���#U��kڵg�ǐ̽�6�Ùx�

�����!
9TQ����S�ځ�t_Z�=�6 at D�<��
�ܣ-p�:�Z�/�O
!aj[ɠ�
� .{=���D`6�P�g�[]�|�+��0~u
2
t��Q��P��
 �&�6���k{�\�S
�K�� 9
-��Uڞ���V��9w,����^K��H�����(
y9�`��؆Ҫ|%�Ak| ?��p��-�L�s��O�r~'7�},��y��q%���l�ph�zD[�����j�#���*[�{E�\�o�N���3��Cs�
-�
،V_�g������,ߖ�b��y'R)`�l����l.�K?��i�5�]��`FYhp��z��mȠ����-�Yr�
�[6�]�M��"��� �h��*kF��
$HpNc�ql�6�M�@{T�p��w�c�I��F�xA�]��m����U�k�ڣFZ��k3h)��T���R����l�F_����馫�8�?�������U�����G4qM�J��>�w�
���wC��M�c�
���"ޓ���8�҂2�U��	N�o��6���al��@����V���ZH��8Mc%Q�z7��v�㽾W��

>#|����j��V�Pjo;�HKg�(;Ӧ��gQ!��qr:��ܸ�u�vƦ_Ǝ���.�{��DU�*i^�*PZ0-b����"Mw���5t@�
ި��:�M��PJ��t-�$�j����D�$.H%�E�
-�K#��W
�q5�Wu>54
�z@ו�I�"s�,�/�B�5C@
-v�1��uR�"�R�Y�#ޖa1%��F
�G�ɽ�3����_nʏ
��f�Kؾu��y%|5���Jm���y�<���|�{�]G�@G7��Kq3�3�����WbMѾ
�uC���#j�|�r���ʦ��8��
\�}
���	��%B>�
-K�d���#���4~հ�ZW�Fu=�nKv��ۣsZ+���֎�P��
�
H)o{\E��4�M�4�x�� �)���lT_�
ŏ��V	�U-R ��������3|���	�[�/�{�<y�c-�5�YP�<�Ɏ���ҭ}"1ǰp&�G�N�~Ź���g�`�V�n�r�&�ӤI��/��ɻM
N� ��E��'�
��S��P^E=Ŀ��,t���`kՓ`��5�
���OtI�u�{����~l/.���z��ܦ/��:�<�}[X�"2�r�F;��Y/��*�L��d���B����uJR]���by
??�>�N��`%�s�t��f�%?��(<��t�\9���Z�7HnK��hk�;]D�E�Hm
=����

�nRF�2S�n�}V��W�!꿴�kX�(�]�3��1ŝ�?�̍����2����0*���x����y�����0�1�
(��|����i�<7&���*G�"�=��SG�]5��o�K��m��h�}T!c���&3��d^�I��3@��>}��M��wm�̙2��4
@a$I8�c&����K���fF�x�}`l��"#�@��ǖ�
6�`%VC�
_/�.̴�v�ՠ�C����@��z�I�@����w�5fU����.���m�
-�,�O�
{��h�R��$�E1��rQ&Ac��RӅy�ϟ�U���{K�WSD�TF'�X���J
�u|w��J+�l�6��玊"�}o��ue#Ԍ��
��
�A'��Ǘ�HlUۊJ�s���F��x��,b�s.V�>�����W2˽M�/�a�����)�2�"
��WH����K7
Zi�1�����.v\in��U�4}J�7��S|n%[�:�
+\��@	�.<p�
��#
\�^�%�C"�+Ы!�H��ͩ�]��ueK�O&G�^�+
?���ph���a�^C��K��
�ⓤV}:S�"��P�F{ڣ�R���'|�ŏσ�龑oU�d~���.ҭj�������y�nܺ
�p���׸� 1���h�5f��R��5T����n��c7�ڻ�%�5?cM|��y�E8��uM�j�(��H^��<�&��᐀gon+����Y���������s��`?1(�:���D6��*R$I��'��;s}��(���
M�{�s�];E�+��[�;��R�_=�4v����h~
-QGݜ2���*dK�~p���4(F�����G���}��]Bf�1QT���
-l��*OM1��?��*a��ݬ�r+�9�U
l��ǯ�.�V!!S�{�
-�ʼnAS7��6�'��������g���\�#y���Єi�G��1�W��_&��a�M��������7��TU�nN�o#��Įg�Fk��sS����?%��(��=��}5��pl:üq�
-'K��䀞�
ͷ�f&v��>��*E�k"������?��c
r�3�?}%�$���B5:&��*|��9���·f�ҙ��|�R.�A#rRg7
��E�Q�4��i2X'�M�LN9pW�
#:��;�����'���O�(�rR�پ

� _?/vvt3~o��C8�}���U2c��f�9y�_�8�v�4��~�A���6c��)�P_X��E�2�ŕȞ�'^"� ���uZ
���=�t z���6���#�߰(�D7*\F���]��&��=;����MYtY���A���H|尔��v�PstE;���;� c$$VJ�*G���h�$b>�
�/�dcq���Tk��L��1���?ح�V�-����g���a��u0ן$�ty	o�c����\���:��,�y,c���#�ʞ��]�z��e�H��w`n��]>�HK]�X*��wZ�Yn�ӏ�.�I�4����R��H��Å������b@
7��#��=Ma�&ȡe0Ԗ8|��R�a�$���+�
���@�A��"�,��c�
�� [...]
_ע9��ڐ�w���6�#f����gd\��-�:��OU
JD��/5u�t_`f����<�n.P��6%2�T�%���·�#aZI�
�R��_�ү�ގɃ�/�Ĭ
���\~y=!���Y�$���#��U쵈��Y���<?��᪋Әy
��y�)��rOz܋���Q,E�ڧ�wď0y��`�ǨuT��ni�j~�3�(/
�"���H��vV�����۴�?�~�0
-l?i����8��+ow�bCR
�R�_<��/�׆:�v.�2!ǂ�w�h����F�,�a��
���l�
-�B�Բ���͡F
�
s�[����*�j��vY�I��ŧ��x�T�I����u֏b
�Ħa����V��q�G�щ���TO���˺�j
�!��
]Ӻ����f at sO��D
q�ެ�;���g������t�
�R���T��1���n�������W]2s���G%��,:�/*\v�"E�f��k[j=�w��?=a����-+����lw��@��[��G�=�=��o�7SW+���K흱�录�aXk+>� �>��-
ٹ7N����체�Q�<"��ڴ���1^ֱ���SB/�nƇ^���Z2k\���Ɉl4G�~�!@�ɲ/~��y�����+���YZPqxT�&b�,� RE���>\k�X�C�����7l�w�6�tRnU�=��z��GIs�a��
���J�.���̎�i�OG$���=��]fB
�}���+��QLW'h�s�k���
--�����K
�`�\1BM#ߪ1X��5$y"��4|�~��ӭ�%�ט؆<��yţa%�LF��R�fu#��dzbcC�
w�S��0�w�2�OU� �}}�0gᗪ*�
R#�-�b��E����
-[rn};

oDpK��?��pf0�b�����fʧ萖�݅o-P��=gR�n5p���RB֨�O,��\�qd�EZ�"��L8�p�3e���zI�U���e��Ȧ�����"�7%��
-Q���>Va爩<�3_lim읝W��Ih�	�)����T�ʌ�+~������I�!4��ߊ-fC%b{F^�~�EQr���X���kY|5Y��&��E7��žm3����L�XA
	S�?��Y4�z�ލ�߁S�(�*P��C��!�F=�!
Y7��F�7Y�^���a��AE�����4	C�Gx,�(_-�������
c���[x��qa�(.����E�0j*�����
-�S�/�	������
�_ȷ�'}���{=pH[9�ٙ��x�q�k�b�c`��|t$@c��f���U��6�ju5>�&�J����
�x������%��� 
3���f�IC�ǝ�������
-	�P������ߌA�
dw݉KKE���
Ng�\�`�d���`bi
%��cл]�	l_X�>��6��'��.��J3�r�d��(r�U��6��ʏ�
��X#c��D������bM"�Ya�0{�;�Li}qc�j�+�a�<�y|uS�3"gݛ<oOo_�8{�+q�s
��y
\�\�r2P~1o��Qѩ%���`6p�<�:�u�!i=8��<�����Y}v{MٝHN��u�i�S��F�7��?LG�v��F
�qj�|O�8�U�Y�(�^��jx���A�_A����Ҏ�X��_

'/��|��0�
�_���t웥�����`o0�Bo��Ӱ�c�x���C;f�:�����8󂪏�+�:�!	|_q	-�Q���}�@���3F7�ǘ��%(n�
̱�
�c��H�
3�J�j��f���.=Պ����
3�D�33�����O��u%�D3��ֲ0��F�j69�=RS]} -s�q��(ګ�Ґ�I��\=4k�^,
􋇋��"�0`�}=+�;XZr��N�la�ǷO_,M�=V<'�J�+h�e�sc�6=�T<&�(ǃ�
%a�	N!N����]�|�����
-�֓/�#���±�֌ɮ�dO8��8KM��=}O�GW�
-��Vrp3�w��I��$dp��.�#�P���S
��P<�|Z�:�;˃ƻ'������g���0v(8O�7�*�M`
�������
y�9�@(~!�G�O�{
�m3���s4$�j�������Ғ��~�%
�
�Pgj��ߌD�=l!h�4�.��	�d5��]�����KѺ�[WŽ[
�����]�J=�)�K�#Ѭԃ���e���Li��r�0���	[
i�&��#��
V
�
���b=�e��!�l�~��He�k"{�}9���k�5��D��ytN]�3�DV�o�
-��c��_Ɍ��
]Su��X,�a��_���e~�r�#�k`�!�G|h��x�mGU��ҽF|���B�I\x���^R�~�͔
aa��
�����_~�y
�P���.�1~
�T'
�L�UY�Y����
K��Ng��E7��-�,O���~�ُ�>��L�M��o��8�	�h�3�N�4���$E���'�����l��'���$"!uU�w:���f
�qxur��)<�v�h|�b�LlK7�l-)��P�L�.��!��3�(���^]���c��E���j.T��.�y�՜
��F)��T��4��4�L��b��qx?��"��$��CoޏT�%Y�0����#x��Ď�_�oH��U�\���k�S��_�
H
!.����L�oq��N�W��4(����ua��۵���!�|�K��S(v�TTu�
������SZ���5��dtj���
k\
-t��p��ĮX�ֆ�S��)����J� Ɉ��
-endstream
-endobj
-3351 0 obj <<
-/Type /FontDescriptor
-/FontName /OMWOOP+CMMI6
-/Flags 4
-/FontBBox [11 -250 1241 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 85
-/XHeight 431
-/CharSet (/d/e/m/n/u)
-/FontFile 3350 0 R
->> endobj
-3352 0 obj <<
-/Length1 1497
-/Length2 7487
-/Length3 0
-/Length 8489      
-/Filter /FlateDecode
->>
-stream
-xڍ�T�k6L�tI��
Cw�t��0
0�
14�% �J
"
� %
�4t7"͇z�{����Z߷f�g�k׽�{_�a���疳��@��07��O
����*�������af6�"�!�q�� �
P8L�_
-��ަB��i�a 5Og P  ������������A^P[�&@
�x�0+�]}ݡ���c�~���@11��� 9�;
�4A����`�3@�B��U�M��p�������x����ٹ �P�@�q���~h�\ ���0

�
��p;�7�
�78C���}�'���?
����v���k�	��u7  �?����U
-��
��.� �/f��:C ��< ��r���烼@Pg��}���A e9] ��_�<��PW����E�_e�oY	f� wq��
8��S��C������g�N0�7��/`����"a���k��yBT�
-�7��c��  B|�"�� � �v��U�����	�e�g��
-w�ݓ�B� �8�
 / ��		������� �=��O�{3����;�`�w�= ����?o��Ü}�	�=_^

-cme�?��㓗�� ��� n~!> (�ܿ�w������o��Wo|�T���@�?
�/�o
^ɂ�a��Z�{-C l�HߜO�|� �?/���?�������6�����������q�\�ξ�K�q������o�1��*kBl��.��UE���Cf/qn� ��;�C��Ձ"����,��p�� :p�/�}�����t�U����~���
C���P��ᶿ��_H rw���
�
	���kk
���w /
��O�s���q~��W���lA ��/(��
�x]���z��
�{�
� x=������~O������L gn�s�
k;�����^�D?�87��
+��B�)MX-%���̫�Q��*[:vjɻ���:s�ZGW�+x�M��iOg�8}w�<�����a��	)�8M���k�>$
�X���2��}����=���,���"j�mZ
�Ks4�iČv���6kB����]BW�̣ӵ��%;.p�����
,��v�>S�
-Y;d�@)I
�(
-bV-�_�z�E�o�D^��l�=�4q-��x-(�j�e���g�Dw���
�/a����9ֺ#���jN�-����
Q�>�hK�8�}�h��X����ʹ�
`�L#�	��fa�����ӿ���Yi��G.�%^<`�3��M1{�4��>�K��EqL��Γ[ۇ2��
���N�K���?)
��G���
-45g[�D1���6����5�=p>�+��>����~{�Bɰ������çv_�rw8.
�V\��ˋ~j�����Cv�
++�T��fYCT��V��{���ҢWbu_��벦0wY�=/k�f� ^Cu{i@�=��C�sx5f��ؙ�]��C��d���|R� �QU���K>1hd at _�f����^�8��^�]2�o��IRi���6G�Ko_aek���^!�Ff�C�z渂M�*Uc9kH�؀�z,�MaA�oߘg�6|�Wl�� �}`��вk�*8nc+
-)
�ZG�f�1�c�~r"V5 ���S�

������5�U2?����|p�����"
�
�$�h�(^�^�9���qL��cE4q�e���
o��\�W
����ׯ��J��i����ݿ��N�~��_�gLH�L���]1'���܍�(	� =�X�ϚG�F/�y��
���$b��-�@3�ih�����(Q���ꇋ������xӢh����HSկnvD{}��g�?��bsf��΋W����� ]�
�HH~�䝟���=��;��d�{��.2ܽ�%`w�ȟ�m�z~]6�ݐ�Oi����ÜU�!V���|����ɝ�����톈�Y��@�Kc
��d`LX�:F����{�%�7�+i���l��wm-9f��W���Q�MG��wh�t�+-A�
-^��OT��\�#���V�"��{�#wnNg�*
�8H�r,���8X$^�Di�؎�T{��CW��Y�d��.h�|�n���
���~I*��A���a��?��8���i܏�k2Fψ����t����tJT���N��ƫ[��|Bc:�v~���M.�w ��PS~��We��Uv�qQ~L�΅*�
��o	d:�yH�M���@�FNf��i
-ݨ�NJ{1�[��y�|������v�SNMh��j�/�n����.`�G�&����D2�`���Ky?ZP)���)ږD��>)��<T�j*�̣��<�?�U�hon���Yn缫K��'"����
��C��]
G��gz�����GI��N����e>z�"YQ�3*h=$��w��L՛�˜�}H��Уr�I���]�
��zf�;�[�o�a�+C�LU,�SQ(:��Ӣf���R,�J��j*2ay��4[ڐ�R�����3��

-����>���g���
�(pE�2�$��
:Q�㎋)
��2S˭��
�5�3H�u�����W�5����H���������O;O�W,�Z�
f�1�1f�����v(0qԈ�ܸ��
7S5�
S��6j^��I��nk�!k�����Tj�:�i�/��d���m��8��}�����yHˑ~��A�y�-Oo�I�Ӯ�>��O_�7}a^@�}&�C�-A^�ܯ�C��
���X%�d�:Ⴀ�ʘ��9�ё*y<2)(���(Z@�I�!	�Թ���Eۇ^��l�il&�#�k/�-��Ĉ�7AB4w٣o�'Tw�N
os��x���YC��24|���N�Ӝ� g�#G�ս��S}3����÷%�6�^4޷ˢ�#�j
��.��_m{B��(���B�5�_�)�d�.�3)
C �Lb��Lkf�]AY��
#Z�c?[o�v␱Է�jBI"/X.�$�.n�u�b- ���?4��Q�m�ЈN�� >�n�4����*FpF1��C�
>8�<ѫ�,��;�����4@�q�ٯ�_k]��T��ڒ���lT�9�q^��<d����{�uZ�L�8E��]L�x1�i���0j�Pg�z\�蛏��'(Nx�f���Z�7Aj�R��c��
-D.��m�GTt�&߹�CK�~��
�H@��@
�z�	9m
�$
DٷF�ʑ��<��ƒ��J��ibWw����2��d�^�ָS�
�9>�J���T�S"� w~�7�:�%�'��Mд2}\x�<�
�p�?݇@Nn�tW?�v5Ĕ�}@]�3����C��� �$�3�����'�=7��
��\
G��R [�!~"FǸi�
CˉAi
���j��m�)ƙ;�b�iG6ĥ6�4cW�j<�t�\���������-��U�o����4�-@�	�.6$������9�e��7X)zF^�/,OO�+���Fz˸S\g}
��
��<��
�a�܈���%w�-M�<?���[�
�cl*�j�{��\��f��2����l
Iɬ�tK�4�
���Q��g��7՞-[S����
-	m��
s�+x=��,ѵ�T
���G���: �'��Y�k!LFy�N�k�{��Ҽ��X����։�'��|�
��.����D	@L��}�GVעx})�,q��ϑ�,׬���]�v#�?e��
D�>�E��:�d[_�O/�=����s��>���2"������?�)b"D��J�B_;�6Y��싊�؆V�U_"Z�r_�fZO({������@5�󏲴C�~��
)+�L(N�\��KȺ�TAӢh��1U44/"\u��7(tC�f�:Y��?�c)%���y�bިc`l
��"��a��?���/7"y�����=:��SA�&��^�>�|V��'�S��RCJa�Y'r�r�˳&5i��
��!G��ଙ�S�GC�AB���\
��
&�ԃ���Ng��uΰ��y��;�M�����A�K�V�9� =w:N��l[|A�.rP���p�
Ecqb�k?�hH��M8��2��;��
�
-�ՑV
-�Ϛ�_�mYo 9�
���F�8��X�Ű��0^�a��f>���vkx��~Y�~�S�]��|Ӵ�\x��k6v���L��ߙm>�R�q&Y�4
-�}\��{��
-LG�1�c�
-�Z ��Zo~��U���1�)MN	֎��7Q:E�Z=��Uf���J"���AV�:~}�#Nk���0&5ٍ���
��x����	���T� D-Vw
-��h��)�8""u��
�D'A�QYcXxo�)����׬���z���^Z����fұ6���)!���	P_�֘*��-\=pb�S��N���:��#�>�
�����役mˎ"����d�����/���i�tY
q�V�1xq��$|�R
oz?A���52|�SN7�4.�+��s[�^��)��J��)��;�/N��:�I��[ְ�/���
=a,��s`�ٖ��4�~K�n^Ȓ4����rv�L����
��
-X/
����{��>��LKq���ׁ�mhC��L"�4�����$ц/������SFW}Ԃ��G��`^�js/rBY�1�����ڱ�plj�|�I�����Z��f�L������8c�ْ�}����>��Y�4ӎ���Cd''��1�"�x5�%WL{������
Ҋpڢ��=-�a�&<�%3�s,�ıXh7�r��.a���|G'n�?*Sr'�ix�9�ɒ߂���xz6y�='���f�|���L���
*�{PD���^�\�K}]�j���i㢹�F�-� ��:"�Z�Y��/�$}��iM�����[[���FB�~MZ��C�QRI��
�v�Ȟt��z��?C��XSt.����
-�� �L�u����ru2
���s6Q�ⳙK�7��
�����
R�Ȣ��<oZ[,g�xv?�|h�C������S�2U�����nT�AÖ�W��е)
A�ш���w,RT.����?��7�>I�v��g+�[,;�]�W^��=j�7
�pn�L{�zs���q8�c=�ؚ�!(�@��U�#�6��>I�Ve+�yU(:�]����0�D��\'Z�C��if���k~��[5r�;�7;x�D��:��Kr�U�Z�o��
K�
�
녪�Iل��P��:*��X;'_�F宍�I
A>_�U�
-�� g��D
-���F�~f2�د��ܜ��_E�I�{rs1�~|�N�L͠
g�U�������B��l"������]��������|����_�����}��R�l��Q�a&?	���kVf�͡B
�%ս���8(��fw��
օS�9��&q -�;vnxRIF�A�?!��KxO�	^mn	iz�:0��Z�qY���^�ۓ��mo�J�>���S
��w����0
��V�ߙ�
1z26�hX/6j#��{#}
-ǡ
�s��|���Lk�����	��v
�"J���]u~;I6�m^\1�
�T����[c�ۓG�Ck|:V�/�^���3x&7k/����T�Mͮ��I�f�fӊ�
�5b��Q/Q1s0
��r�mŖ%�����<E]��b
Ѐ.xc�\�6��K���9<(4G
.�3�V�K��I����J;ڝ���Aeе�����z
��d�����c[�zYy��w��[|}!<�/��u�Z!h�g��CO{�w��	���/m���%��"�e8� �Es\�8�B���U�a~��S7�(��X
���G��K�r����
��VF"�oɇ 
ی�G?u]+l�U����
�wܒ��D
r1f�?�
�
-�D�-J1r�oT����=�E�j�3�C
�JZ-�QE�=�"S�n�r?��HH����$ܾ�	�q
�_�	�߿V}	 :�we�I& KCu��L5҈,]k!�Eo16�}&�e}�ǐ98�tL���,�fV���.��H���3��U��$�+�d�2�^7��a�ۂ��	ǯ9��[d�
����
-;�('�}ot(������
V�(<*Z���ɑG�Q��Q��|Z������+�ûn
&�38��ާ�F-�w�{���*ZPd�<�}ʖ�p�d��0�L�+K�yBH������I�N���x(YdB�k磰Җj"��$���sp�`��p���]X>a2�vGS'�XҶ��r|׍	����ɁҬ/>#C$5 ���)�ٴ`s.x�x��D��?؈e�8�f�
�7�j!Xx�~� ���|�<�@�����ml���+4���F��t�Ш���[˝���
�>�>�L{���ϳW
���y	�ƝIs�
0�ȓ�5
�M�������
8ہ)Q�Y�x��5�#����V���T:�q�Gqs���5�~mݰ1�SG�~�-ci���b���p'0��Y�
t���=r�_>�������=��2E
��̶���J�{�.&�"4�HH�,�4$k���Qw�
Vϻ�B�/کd]��<!f�=��� 
�*��(�ü��R']�	-��]���8����(�fS�Z�+�kP?a [...]
��~�h�n��g/j��:'����~:u�[s�
����5V���7=�O�D>��[���a�UW��6�.æl�ƾ�XM���q���E{v��
���ÌI���:�:�{N�-�2D/s^���=we�P��|���׬�����&�恞����l�s��2F�;�)�Q ���o��ҙ��
|���gr�E&49�t$��Bg��:=�3.o��ASSrW׸L�I��
5&W!�xk���J����S�I��R���ǑC
PY��d~�����8	
-���J����m���E\)��6�srO�s�p�Ow	�
�J�]�N'zJ��bc�` �Z����D��b3�C�hmR[
dX$}��i�G��P�g\�2����œ��6�:pռ!
=��!���;�Q�f�\�K,98�
-؇{'>H�_u�}�5Ik�|����[�Hon%q��}��o!�������|�: �2�Ի
&꛸��+q��.��=	�L0/�
-�xA � �S�G|w�����[#t���a�X}YK9
��͏�R�
-���L�v�(Oj��L���{�W.���L��C�SW'�G.�
?+DE)�y&�
��8oy�}~(/�
�b)��q��?	�sIt=���
m�?�7�u����cFF�0������hh����
t�T����[i'��k02
�:k��ԗ����tR�}uQ�:DU�l�;�t���i�f�1M��E�� Ut��4��q�8_���@�� %�����G/��NI�r��i;�t��Tv}}
��A�(�R�Y��O�|
j�I��9
=�Ѣ��味OEoYW�P��5k��W�ħt�9n9��{[��z"R�z5����@>���L����?��Y����]\�n��
����1�C��̮�������h�G裯���pܬz�
"R��Sz�qǑÊ|q��!��7}�I����+�f�
-�֬����
��D��y�#��� 
�*��u��ķ���\������������rE�?y�}��v��K�ב�!��S���vy(�F`�Z�4K��ąQ�3	��jO��m�CV*���{��P�Zw�F�fR4uS
Eb7Va�>�v��_����InML�9�,@$9p`�d�n�q�9�@�4bd�;�½
���+��ҭ�98�h'�;��l�2#����C_^�	i9qQQaK��_�Rikw%n�9�exT��&a�u�������e��Y*��%�Q�r�'��]?Y�I�#
�*����}N�R�}�ފq��lmi�S�-bM���
O/��
���?Gz�,�sGj�A�/
����Hy���<ȅ���h
-h=(Z�+
9׶.��!$7~���F���*�T���
����}8F�M����2C���nF�9W!��\&����
�ƌэu�sjY�κ5�u�j�{��K�?���o�Vl
�n��K�o�B�
m ��M�b�@��
�����s%���=[���I�Q���+�w�<;�����S�òi<�{�t��;���gI^�|ƶ�z����F3�(0|w��o���
�Փw�d�9r�wVJm�_��@m�dz_�H�vU m��F�q��j$4y� u,Gt)ƾO���nJ�����>�P��;'c�E�O������>emb�
Q�c�H��osD�Γ�@u1JJ�⻪�-��8E�-[�D�A �o46���������9ijD$W�9$�*m��p�,��kb��9uF�������v�R��u
-6
c�!�B�8��Ҝ�'�R_�6�
Y+�ҝn+��e���H�T\"���
;ʝ/9x��$�,�(
����ִ� � ����@�����o5jO�)S�e��v�m�x2a/�l�>8vjh�]��0�K�����~
�U#)#r�QwuϚ��ضܝt^�{��W7�(~�&QW|��)���}~�F���`T/9�e��=�O�2!UUw&44���P?������
-endstream
-endobj
-3353 0 obj <<
-/Type /FontDescriptor
-/FontName /PPNWOF+CMMI7
-/Flags 4
-/FontBBox [-1 -250 1171 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 81
-/XHeight 431
-/CharSet (/d/e/i/m/n/s/u)
-/FontFile 3352 0 R
->> endobj
-3354 0 obj <<
-/Length1 1491
-/Length2 6577
-/Length3 0
-/Length 7577      
-/Filter /FlateDecode
->>
-stream
-xڍT4�۷V�!z
�h�E��{	�E��2�-�
��k�h�ѻ�������Mʽ���{k��f�ߜ��w����!��-��
-�!���R %


I (" 
-rpA�ΐ?jBc�;
-�I�7%w��)��h?
8
���
ݕ��@��_�pw)�2�j
� h�a!����
j�D����� �$%��~�\ �P0�!
 .�`�3��B�>�J�-�D�J	
-zyy	�\pw{Y
>�� �A@�=!����� �od�
 #(��n���C h�3
�!�
0[�; ]
`��
�s��~;k�v����������D�L��
-��pW�
-��A�! =Um�7� ���t9#��x�'�
�A;��
PU0 �� ��C�ݡ�H� �����4�[V��*�]\ 0$��g�Pw}�>��'��{�|�vP���O�
��`P7�������=	J��H� n �7�A�gz#W�/��O5���+�`���A����'�t�����wÿ%B!!�-��@�0������2z��Po��=! �����^�p���?��+���m������6EE�7��_X�/,�� ������}����A�4�'������������v����p4�! ��o	������
-�߈�3�����lH����������A.Pg�?h.{ �{�Go�?]M �wYb
�p�O����=���B��?�
E�B�!��P$��7�����3ч#�?�
t�6�ځ���
-=��&���_��)C�[��>T``���u�
 ���|ф@Kb _!���B�
 ( �#�! 4f�
ܝ�����?
���BB� A��EQq� ����8�!v�
w�1�
����9���j�����ah
ɿ��&�����:V�6�T*�{�o
K��
-��?�G���Y�&fe�i���v
�>tl�Ut;�^��拪a��=�gVݲg����>œx�{��:Eڀ�g���$�ڽC�1�V;���}�!�Wu��s/N�"UqͰf���ʢLm*I�ݵ��F�~�
��4\9k.q!�і�Rt�Y��[O	�*n��
�/�u3vDizo|e�$S��Ϡ,�Wa���"��N:����m�
۞�e��j�C���
���z�n��m��'�y���C	��,���aK�B�mrNy����F���O
�E���Q��J*�����=�X�k
g�J�C�ސ�6S��K�����<�3~�}��
�����F��
g��-�O.mkdc�`���W�L`Sfwc��ZC���r�x��t�9�(�-"��{F
*���|`��O��?�‰~=՗"�7�B|����:�z��r��

�AL�
`D�I�
�9����e,9'��!c�� �
h���� �p���L��&!�k(
-�=�*�hNs,_%Y���a�[2/9�ά�R��н;���A��o��d�JOx��8��e�{<�lŀ��k�����ZU����N���
��(���hӺy���
-,��+
-e���[]��o|H�N����s�7f�eQ�/
Z	6ϕb�qhP۩V�M觏K�8����ԑۢ���}�ZxR�9:��<�M
H�����ͤ��0��@�K��}��-
t�9 4i2����
�S
-7�{K�~L���i�����ŹQ��R4e"f5��֞��RƋn��<o�
PS|�N�� ���:�s'=
�
Է=s��˺�q�E��
-D��bC��/�Sц�U�q")2֓|u�U��-�d ��@-KJ>�
����
5p�ʧ�|Ce��Zs��Q^=��Ve��[K.�J�dJ���#��ր�^�w��m2=��4̒��ˆQ�w��fԿ�︼k�T�
xV�Ioʖ�=�2N.����M�&C'���w,V�rcM
[��נ�<:��L b}��X����UF]�5�IZ-3aY�y���7z��-
-d��ZÚJ�������s�wA��u��&8M�WXF^� oL��5��hwS���ڈ��~�S�3�+���x�ŭR���R�+i��D�n*��Dh�'�w�>"F5��L��]3����t�� ��
4p��&>�����|Jt�"޺���L�\H
a�2��
�b�J4~�s���™J"
J��L����ߍ{�a���<�h���e�qZ\�w�*=��K.I�Zy��2��:8�|œ����z-X�ڑ��a��F͟�W��f��
�o�|����pw†��ʒ<]�������
˚�f#�I���g���ki,����Z�#��$ jv��?��	���>.%�X?v\1�r`��ִ�A��Kx�:29��/,�
:-�f�y�{��&`ZF�=��c�k�^����MV��vk&��ٛ�}c:�+^�j�
	"�:�X�薋O-sN5?����|�	��Y;&�<0����tluS�G AZ��
���h�� ?�8��&>����Ҹz����ӡ��ok����~
-����#`Y[���,�|y�i.V�@d������A
�~j	�3�,�W7�+6�7
7�B
U���&25V�W|�T*��i�?���&a53��@�v�\w7ȓ�9;�S��[dO��Z�z�o�ж΁�d�RD�"j�V�|�HgsBӥR轒�x���9'A
}vؔ�Ξؾ
�Z���|�

�1I.�d��M��mjm��ER¿`K`m,��q �w� ��$'�[A�
9�,FH�}����T�W;���eHB�Ҙ1ni��.65-o�:��@`꒘rjN1L��#	V�dr�����I�?��'Ȃ����"��Ƴ����
-��.&0_2�~��YT1QݿX��=�e"+�o����+��(�����ԓ�6�<�i�S��r)���{�R�� ��~ʡ�s6�����t�/Y(r�}�!�^�V�q5Fա֙_:В��,��<�5('lf�~���t��A$�cQ^�E
_Ò�w��W[%Ó+S��Iᯂ�iT���D��
쩎��<���="��q�\{�� ׺1�bk��g%�z`DŽ��'���-?�Î��Q
Kzc�����jR�2�ɨ���o��y������v��G��v��qP,������U�����ȱM��R�ּ]t�9xR��H-������r����椕���?
WE�X�a��}]��O���
-\�
P�]TX\���C>�ۥ��ú��xc���>m�G� p�_��p�O���Izioψ.���{�NX+$�}t!��"|�]��x;)���u�j��>�^�#ޕT����N���Yʻ��_����H+g�$�N:�)_l �X��̐��0�xT�s�b�{8MIE�5D�̞�-H�@�\
p�6nM�Oy�8"�-�ѧYs^%@���'?�
(����XK
-o����+�˸b�b�m��5�ٛ���j��MM3�5I$��
\��{�H�J�k����E�
!ئ�;9.Wȓ�(%_2HKY�Dv�sF�ݷ� �=L�]9?��k�#�"�Tv
/������y/�ښ j�����Ʉ��ԙ������8)A\^��?Ⱦ�rD84D�]nV7�롹cE0�${���n�v�Ŏ�����"��-�-8LZj��L{P����[%C�tr�����`G�]�&1�8��Tu��<��'���L��Rc*�e� "�c(�b�C��4�E�h?,�S�r��SO̖
��N
��S��򦱡��F�5��#l���3�
�K�U6��k(ʌ ��e�
�����<U����7_r���qH.e\T�T��8�lW�v�0$�>M�1��>&���]?��.�$dl��
�S.���M��]�_4����P�D�]���&|��4��)k������0=]�=E�}��ET�h�$�:e�� �%l
$��8�y��kQ�;�R�-�|�
jmdt�z��Pp\V����ƴj�� j���8���˅hrG��;��/O�x3G�c��v#��r��@��1$�&0̠��+lѥ�ܜ\�	��dHJ:e"s�!+~�����ǸuQFD�r�t��k���mN}�����*<l�4
�L>�
O�ﱉ�s@��b�TQ()�إ8��%�޻�*�B�T�,Ə=��y�՗,��"�
^b��Ѱfi��b��-RL�D�=�����6躗^c�dr�,'�D����y�B�;�`���� �X
��L���3y�rQ�)�rs�����R�>�=��A��$��/!e�R�o�N:��ui�n��ғ^���l��I�{G�|N���
����*TQL�����78�-M�G||
-�Y;�X-�K�{O�EJ��%]O�E 먽����I�8��ʭOo�R>\W at iij�?�3yJ��P���N�
��7	���t�@�VU �
�<._qQ�ŹxĎ��6�]�T�íZ�L
�L�|V�q"ӧ��l�0F�tMͤ㦡�wXN�A{����
��򧰌ѐ�E�?뙄?�$r���l �?x�T|%�;�:�|N�
-IBt�	�3�"Z�p���
-��
���7�]��_�}�]\�;%%���TFJ�5����1�h��Ԣ�/:E;�v�O����rjL2+��FL~w_:�Sc-E��\�;}�j1��A9�[�T�H�Lr �|��s��(����� �c��b�����u
�9�
iW��#g84h~���Ũwq|I��� ���~��E�G�a+�n�R��#
Ґ�N�)���z��>���:��y�1 ,��[~�*���Ւ��X�̆��q��&5AȰ�$��O�үP'ݘ�ͬ������'6�Θ�����g�$s�N5 ��Lu�������iHi����-?{
_��J�FuRjq���C5��ݚW?�x3�9�r���j���I������8�r�.lVm
�O���E
-��(4?0|с+�w���LI�_�P��YC &W_�:e�ݖ:��y�_�o���z\n����Q���ґ~�M��KD�m
O��uʥCS����e�� |���T��Bѩ��%g�Ap^��؉@8������~8������T/��������*�ϳ�
��03q�D6�	�F��p�o��σVZha5�{��j#w��
-ߛ��S��h��e�e
#��"v��qt����q!ڈ�2ڎ�Hu��Q�
;��ў�
��?�x૏J��6�5�vê;�����p,Ź΁cn_��� ��x����k*#�M�vK\"���R�
-X�T��5Id?ߤ
�v}�6
�d��x���+."zN8��r!&���yJ��n@���#{:�=�)
j�]�xXQ	[�ޓz��X�j@�X��#�עۥ���7����÷�?Z�*�M��	M.NQGS��
��{B��LY7�ׯ��
_����TG�!#q���
-U(
i8,S�m��?��drp{Boі2��`�ȚJ�ձ��H7�
-���ЄcwCE��-��]b>�����k�xT3G��'p
��q{$YB
�Uv)��M�����F��&���yG�ט�*ۀ�$!@�����Pk�¼i�;'��6
鴀h��-�KZ�$X�
w���@����� BL��
�~��MǾ�g ��i�V�x��R�Uu4QG8��5��b#
l�Tw���a4�
;���h�
�zL�{s��գ��g����,����6�Q�ފV@���(�F��_Ϸ�O���*Y���U�T���
-k+47eF��7�e=$�vG
-����9>�
iK<�_�,�Q�"���>������ ��DM�ɧ����-��&����^���
-g�5)||���=��E��
��'}NjV񒽬J[qq����
�H����WM�n�]�Ꙉ�4���u����ʘ����9ȗ����CFK��j˯�o�}�Y��>�rު^�#�~2�ZNg��eRc�b�t�������s��Te1�J�����J�w�oȸ_�`r��1��R�(���
!k	���mđ�-�Ҵ����m2�8z��V��'7\��
-��1>�2��
j	�U���'ra&��h���gц-h/G\7wͧ077��q��|�;5��`r�.�K7hՓ��M�[{�p3�#�
�+Ԛ�Sv��؏A�
nfC��<�r���,=rt�,6�~�Md��v�w��z�d�]�M�s��
-���嶖W�e
(��ں��k�xW��.��� �/E��J�P���%������/��$�ZZ�~�8�(��]7R�/��+*�)���q��K�Te�$|t�����-ǧ��-�ר/[�?ĺr��g_�~0��V�����m���h��Xɔ�T�h�h�;���)����HV��k*�X޽ -o?;��p.���a�c{�7������(?���~�H���mSkg�1[����G�l�޴
�"�
G޷#I�n�o��j3���?�u�~��7t��E�dD��ѹb�raܙ
'���o��&V�Z��ғhͅ�.�@�[����X�����k.���x

����n����t�}7��ޫF�w
�N�u��M�:v;f<R[�>���L�c\~?�B�����Aw�܏P���[��;K��O��1�O�����������W|��[�����w��8��߹�>K�
��zvy������T�ɉ�yI��oCs��]���
�[R���嶯�8�=�J5
�_���T������Uफ"���\bg�Z2��t��+�t[h�%�&Zޣ
�~�
EhF2S��g7
��tQ;��V>d�Y�}�'����͸(G�q��a0���

���#�Շ��8-��3��D��$�^t�@j�D�P-)�qIK�E�0�!W,L�V��8��;o��g)�=����/߁�< '�%�^n�΄tr��ˏ8���
����wYw��]19i�����8���c�>{������쏿F���+��>t+^��_b���`�F�rPU�È/���6+
-���@9�L�XcV2?E��j������H���]�.�qۻ���������3�2�6�5a���ɂ�~�j�_�����W�
�������n����~8�1��:3����XE�F�
��qM����gRzb0��/
�/��ڬ%�^V�(�Dl+
�T�����C�����}
\u-�z:�XoS@�Id
-�V�}jj�㈝��L�Z.T��Ç��JM�o�9Y
�7l���8wu`�f��
;��l���in
-z�
a��/�k�ev6)
-��,�p
-��>C�wmH����G��fb
����=�@2��Q{�
���!����yA?њ/5)6K9}0_�
l\jE>f�F'�|8Ҋ���Y,����J^;j�Ň�6J]IJ$FPe9#E|W�ԟ�֓j����d�>�
֦�<��}�0b_��c�����,��I���fٛ�6:/�-Ai�5�;�:�	&��b�as�k}�[
-��s�ipTE	�2y�NdfH�S�\4X��,����(��L����k͑yX
�*���(4H��b�i�~���3�0�t���i
Z�x�lė�I���alZ$#\p��~hۦ��x2u���;�&YL��^�6m'�PJ�9�y���&�4����_�-
�\ly���N��<�;�u��L]R��#���1�w��Uy�q9���o����4h-C[8#�޺�g2�|� ����
-endstream
-endobj
-3355 0 obj <<
-/Type /FontDescriptor
-/FontName /DGLWIM+CMMI9
-/Flags 4
-/FontBBox [-29 -250 1075 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 74
-/XHeight 431
-/CharSet (/less/r/triangleleft/triangleright/x)
-/FontFile 3354 0 R
->> endobj
-3356 0 obj <<
-/Length1 1663
-/Length2 11087
-/Length3 0
-/Length 12167     
-/Filter /FlateDecode
->>
-stream
-xڍ�P
�-
-A�%�-H�N�
��ݡ�&�X�
,X��54ww��w{df�����{�U�g���}���LY�I���$i�2�2���TYY ,,��,,l(TT�`�
�/1
-�&��	l�����#��,7�>�)�A ��6 Vv ++7

�����?�v�| q�9@� k9�P��ٻ;�-���n�sК�Xyy����9��L  ���٣��
@��

����	Z+(Ԟtuue6�ub�s��c���V U���d��0@���gf�(T u+�ӟr5;
���#�,��� N�7�!� G��s���<@�
�SY�OF�_��2��m�ۿ
�!\613���7���!� 
�
�$)�
u�2L �Ml����mLL���� )�0yN���
��P'f'������<WYb.fgk
�@�P~�'v�=��
�gg�C�\!�
0���w���@
��$#��ʳ��%
-�daa��e�
  73+�o�����?H����
�=����I�����O' ��
���7����`6�LA�`�?֟� �?�s�
�n =���c����}2x
/s;���?��(�##'"��g�s��vn O& '
����q?������O�H�M��/�2
; �9<�?y��5��

�=(�=�2@����p��=��?/�W����������o@��66���l�����(;C��B��y9 ����s�@�`g��ee�&��!�����`'I��\
5��s��Ӆg�6`H��	���0=7���3{���8=��
-�O��Rbfg�{��8� &��&�(ϭF� O��
5��1�  3��|�7����wGy�@�ߢ?/ h�7�
��o��
- �
��[�; h�/� Z�
� ��V~6n�|�
��ߐ�|~:��Ϯ��+�
�����/�S���9
{g����_� ��}�%�j�/�9P��=#��������7�ux���O
�2C���3���l��y���s���O�$:&�9��η�_��U�~Xq���kG_ܐ���'}��o�y���t�uo�:��	ev�{$w_�k12���׃����{���T��<�����];�ܾv/
O�T٪�C�/
g�Ԉ��/���2M��'G�2#�c
��������y"��f@�>�d���]e�t3�T����J at I��O
w�98F�)�� �7�Y���=�� �G��1q�	�y�-����r�ka�̌Ҽ��ڌ�*��6r$W©h2
-ǂV���X�.5_j�YX'��}L�ұ���o�qX���f�
-Nl����h��*�"�te����
[\�K!ND(��h��`�3��#�	x~8�%d]�ea��A�
$�ř�u�ɻ��X�euc��� �)�K���G��q.���qj0mV�D[h�r�
-5�v2�x�Z��,^�N*��9{�C��!#��s��/L����
o�/�2��Ϝ9*d��LC;����A����;�%%��8�v�7�e�E�>��sf����e�:)%K���ȿژ�@6�8Tu!���z����vc�5�ޕ�XF��&oN�KnW �k�`V<����O7�Ώ����5-
Z*��'�ԭ8
-��}u�'���o�ԯ�)<Va:fƇ6��6(=m��
8:����p6��d3~_�V��F�=Z��/k����U�Lv�Vz�E)^~gg�
>��Ѥ.��1`?MǦ[�{�	ߒFտ+wү^ƾ*y�ߪK�".�Qcyt�+>c�M*K�S��K�&��j:.�lf
E�
�J/�
��F�/
Y�E��$�
�p$�
�)��ꨄU,ev�,�@&�*
���Q�ײo*��:��d�ad��0�
�܈���P(�5G;F[������ƞ���_K�X��Kr�E���}��x�S�
NDE
3��&�F��R䅔�$дk{TSw3���gu���R��T[[Y�"�G`,tƝ���j4����r��,��:E|�:r-
3��?WrC����3�.��
1��ihY�؄��;>��	���Ñ�~c���
�^�ѕLcv��׊{��-�pB��S��

���(O���i���
�
��/��������u����������<M>��J�G!!v_�}
&G����2��X�%�LIis�{[Z����׊�?	�
��!D"���f���3����
$Hft��Q(e���Xv�I�
����D�����U�������
�8\3:����5�c�
h�P�Ƨ���;�����حf�LsE}�����y����<-67�

2y���v�>�����^�w�U緇d,1m:Yv
7��7�W=~T�e?��p\ז��
�;V �FB2Vo�w�DmI"��ղ�F�M0G*�u���:�
 �|U�/�T;u�.bڟ��H��.����K�I;��,so�x[3��	x��
-'�b6e�� ��o��%W8س��Ӛ
-.��-�]4�b�KB��5����3+v%hqёf�JY�-��DS�NMT
�%P����X,]$g�*͆��s����qV"�C����:k��֩�G�i�u��T��W��N�kz"Q
c�(��+�M��'.���*��W&�tR$a%��,`��	i�7vw��
�7
-
-3�R]�Kzp��O�
#���Ș6�7%��� �YM�(-Q"�mM���j�
`Ƭ#��#UL�zܼ�M��=p�ߕӘw��Ï��]����
kk~���9;Wɬx���t��y��g���'
p����u�=�
a�`�I�tR���l$l���N(��l�2�A�1�cT�1�ݭ[�JB_���Y���cj���T<��_�Ž����?��<�q��+�r%f��U0c3O�4I�AGp�e�;�w��䒫�r���Y�wI�-���lhm,����M��"���w�����
nL8TX�*} %���y��y�'����N�R �=�ې^��l��Mɧ{|�8.vD
��.pQo	W��楔�?RNJ�Z�]��p�Æ�"GI*՞
-�!��W
�U�$"���
�<n�M�]{��s��fnFk~�g uk6��
� �
�
�wF6M'lC�����Λ�`�Eqg>��tkX_���8���ً�0�q�Ͳ���1��E��A��VD��K�]��d$>�%�
�����n�:�R(�K��C�;�8�DF�
	R�Wkǻ~�$"h6uXc�X�y��Ϝ~m̑ߞ	�3�z�ՌQ��5U�d����$9}���%��b�t�5����|����u�t����K#7����O,�w9m{�F

�|9�U��(�J���+c���
S\����W
�
���͜��iݛ��񗼥ED��P<
ˇ�_]�3,m�;��)C�_�o��ϊ���
-�*�sj�����z%&a
���m�����
-G%vX2�N�{��F�/e����c���Wʼ3���N�!�4�e$�
�n���z�&.z��H�-�R
������8\1�l<P�('ٴ���]����xM�r~�+�g`�iu�Kb,�݋#T��?���ķ���/^��D�*.͍r�r�ըԿ*6�qGU 1�&O�9����\ta
�8����f���¯fuB�o�Q�%a5$��
#�'�Z��HG�T�
-�����[�R�l>%����qwR��gZ
C�Ъvuh&Lڿ�w��h;�N�$!F�x8Y�,\T$�a���́�/(e��Ğr��+
dž�SL��!{>����9H
&�Y�
]��1]֏�W��9b�Y�(}�
mE�~9�c�w��BtW�蓛�]�;]
ۥ`�
-{F�O�"�����{�!1k��~;8"�b������Y:)'�S2��_V
O�P�
���Ǭc�����Rós��י��b��ý�%�tͨZԣ�?$#��M�e�	���Y��LH�6�I�T�-J�B���
�K�k�:��j>'A/��nl�D�wKc�I�\�Xnv��$�>�-���*�X1�����Zٍ�O:(�k��}
���46�9��9��������>�D�
�5k�p���5o�� �l���Y��W�7K��"7
��PA��u��X)��z>RUJ^.lꏷ���t�Z�0��]��K��p�NUQCbUQ��n_�2gt���9
-*�W�~-`�����T����o�
�:7h�k.��{�8�׾8��_o�洊v%��J���A�LnY3�o��щ�,��1��� ��ߎ�E�~*���$�
-��(�`��kh�`�
S듎�
�iLR9zX('�|���ֶHZ]�"�c�C�>:��$�w��5�[�Mm�)0���
�a��&^��Zxۭ�k�-�T?�p#΂�ËOE=q��i�����>;���n:�Cm��Xc�;�C��(�3��y�B��
�bj
�D9ʬ
>$��jlC��%�	
-����6�'��H$��>��@[{EN9nX�P�]���I�tB٪n�D�s��������BDl
��@�N��
�
�$�
Ҥ��‰
9�
�<������w�s�2o��Y� g�V��T�孊u�~~�Qs|t7�((�HM����G������	s��,����\�F
��u���K[�d�o8�8�|p[L@�bn�����y�X>o��O�PA!�=�����blS�#Ÿ��N({C�
FXM�:A�	�9�<�Ã�&��HC�����̤L��ݽy��d�;݌,��!����t��›}%!e �g�\�(�l��B�i��$���ƃ��em]�Ngm�!���
��P�t�Q���R��'R��o��;!����.Y���
)P(�^�Y����LT� n:
�l;�-�OC�bRZ�DŽ�,�k�kc�[�@{��SW@�`<3
-��^0f��y�B\n�H#c���ZE���>�bB����3.Q�"��ݰ�Ɏ!���վ�{8㴺_)�׷he<���	Kg��(�f

�m�>dKSi�o�[^k0���@3��|ҧ�-JA�
��F %�]bI͖G�QD\�R��N&)��k'�
�A)Һ�TQ�.��0$�F=6
�WD#ݩ���뿱��/��_j�Ŗ���e�`�"o�H
/~��	xx_�ʼ�r��B��cˌI3���.�48g�~O��
����s1-����v���[��3��T����9���7P`�$��j���1�*Ghk�ѝ���="ÖE�%�%�ma�����x���%?g	b�k�~����ÑH!��ȇ

�s�_��f������qL
G�]b�K���ys���ypK�X(�>S�gFl��F��ܾF��^���'$�m|^��@�Nu�"m�MW˾�oJz�/���:�����&<5[�s�˴��z{Y��RF{��ci��vm҉d��P��7|��9�ە�����w������Z��|�) [...]
�e�OH�ӧ$�k��6B�E
g�������<���L�cԽ9wpGrƂ �B�v��_K?����]��
��C�cp�T��
-M-��[���ȑ#�
-4��=��,�,�L6?}v���
K��Ҿu_�/.
}qK������CH�͠�3G��씙�/�m�� ���$��3�����Qn���ܳdi�����e"�仞���@6�BW�����|����2��19E�cp�O#w
Xs��	��{kd��
��
jܯ[�uH*��v��^S�ω�Ȣ1�l}��Є�9���"A1�'%�K���F(�~�|��p��m���˃��_I<sM)�iF�m\'�R���UC`}�CM|�%�UDכқ]�R�@�"�0��KJƎ¬��5�����B�G����'�5�ꡦ��Wbc���1ǰ^�n�^��
T
��I91q���a��r����u�%�n��	�
'c�	�P���[��T���^I;Or=�t=�&Ѥ�����Q�"e?#U�+�6�8\����F�
-�g)=�J%v�\�o'p3�l at l�[?�h�5�I���kA�����GgT�.����W)��ɜJO����
-��

-�J
�m+>��T�n[b�(�k�Z՚F���a� )^g��<�U����I�������b�Ψ�y��j�*�֣}��y\��,���Qg��8
-O��(ŭ-2 N#�+�F;��'$PJ���4:�
�>ir����=_���݋>��|^zo܉Z}r�Y
�#v�y��>�M�T
���ܠ
��~:��y�|���K�u�+?��
-�q��[5���k�X��h�ҡ5/����S�p
�
�w�y���hȋ��۟ �S'���9��S5jXay|~�S���"�GQ��j�l�����������˦�/~�%)#:�5;�����y�8 m�f
�N�v|
�)o
+$�uig�#��E>�	��\��9%�>E%�FoqY@�M��������%�j�bӢ�'o�u@�W���t���ԯ�;��K���EZ]H�
���W���
:���؍ ClE2Dz
�<��`j<�D~s�������(L� X.���7�a�r
��C�rL3KZyj?�Ç�E��h:q;o񾎎J
�͎J+s��U�
�lj�1UK�aJ(D�|�
]ϠĄ18a�Pi�Z�ق�2\#��
<���願��4Ϸw

$�߂�H�x
c�4<!
�\jg6q�Ck��*��*y��zaWJv�ZJ\����ke��d�3�;"���x�r��bu�T����& –C�V��
�W���(l����_}W�M�����S��լ*l��q%}���R�����O�*�Z�0눎��0�K�ǛFJ�}{�J�RR�C0��59J�I�x���	��H^�A`�Y�n�u�^��^̯t��>He�)~Jf �gbQP�
k
r�1Q��M�eD>���^Ļ��DWʥC��1/�z�gM]>��ٹ	�p���Tf��WET4E8��%��&x[�#7�{k�0�	4�hy�����4�z�_ۋ�8#Z�eϿ&x��\v�8��*�%Q� ��
���Nws�[������U�8.��L�B�����we�)U�|�R{����鵄(�`]�ȵb�{��
&
1~��+��%���/�;��t��C��g��u+�J�N��C^;�\�X^l1��w)"���_�"p>�.�"�c�����[��2
�?�~�'HC^p�
�6����
�e�
�8��:���vv"�t�w����̰Z������}��tW7$8i
/�ҹo�
���2�/�氡*�{
f�0���	�@y->�-����^3yP�����Vrk�jO���j��t�zx$�
m�UD�AEv$+�!���ޙ�9k�nK>͛�ݫP�f��
g,��/8%��#~��LdE|7�}w>G8�}��,��1
��
�ә�ψ���|���wbjLs�h�����Z�:ϛ��O##7���L��w�%-�� 
z
-N���R�$����`�Y��{��y{sT�eT���U��
�����͸�&NK�$�DL�b�r��؂:�k�x$ѓ ^n�O�\�|�T�Zg {�F��6 �M��b�}2��L꫽I
 )M�Y+(Z���P�Ҩ@.�I�6�u����\X&�7m҃�;��Bs��ĭK
ʐ}8
�M���$�QS�n�?
-�k(�F
-��a������d#���TS��
�ľ��ߵ�Z3��f
-�X�G
Ǝllۓ�!�]�n��\��\�W�
8^�:��tBp[f	\�h�7B����Q��?s�TWb��OJ�LGO+1��/c�.eJ�@Q]gm���Q�v�ā��Q�4Q����'?(���^jH^�����Rʑ(_�H�쩭k�g[H/��A�i_�n't�Ϝ3�
k�#P��3�Z�ܜ�GK�B�ʯ�E#ݪ|���143D����2���pr�O.���F�ă�
-�)
�j�;)|R�e��
iy���e
�C��2w��-�n
-�y��r��n9�L3�
�ǂ������5���rR5�9���i5	�!���c͗��J
{?7��UCC�x� ��}�Ō����
mJ�O��O1L�<�SD��W
-9

M�xx�TWI�o��X��T�4��7�g����?��
���KO�ġ�:)����e,����	�܏K���Z��؎�FOX6+�-+
Ϣ��2d�,W�1-�qw+�7�qO�A�`�oV�s�[ibK�>�9���d1�ۂ%
�憭dW�4�碥0��)����QS����`�������_�&�3������r��BO8�>N���i`]�+�!8U?I47�C%�eV
-�o`����
$g�Y�
-�{�?Q���Eog���B��;N��\�~��}����%�N�t�����+���)�HAs�s��@��U��wV��|r��W�U�����b�#�@)�..U|w��/�=%�-������XIx�~���n���ը٘�Hj�kg��"E�Xt��,U�Kz��|g��L�3�y�4�b�S�4������
�
n�
���q�^��@���{��FҦSޝ���o��ο�i8*p��+:�u�	���W�[=6
-հ�0,~%
��
��na��=�K
��C��U�q�H�=�&�C�҅�\?}z��>Y�#��n��}QE�����\l��#���?�8s�~�V�w�:�9�B(F��5:�t>�����1��G${�0#��˗O�|���U}��QL7
c�K%�5��Ep/A,�?+6�$ߐVYH�DŽ�m��N�gI<�g��߮TG&�ي
o��kZg�RF��\���u���D���Gt�o6���J�c>�y��g�>݆�6Hݺ�
�h</��44�z�Rj�����p^+Ph�����2�m���"j���@;FL{T���C������t(��k���b#ٟGϟ�
�]%��ֹ��b�]1I�xs�
�����v��a�P��i}�ZF1��	L���Cb_��?�G��^pu/!�{oh���p���6^� ��&wD����r��#
-Ɣ� %�ɣ�
uW!)@f�Y̓����n=Rk�
�<�/�a�$'�E��B��~��C$̘�F[3R
�>,���wY�z
�����7��Y�r�m[

-�Eہ���D�t at D���S#ڒ����-��r%]"l%e&��lV��z#���(
�j��C�rߓ���L&�����z6�>����0����K����	h�`3
�v��/m
��
o�����ӷ�� (�kiJ����������̷O>І����U�X3�����_im��
\���[I��ҥX9q�J�~)r��Θ1x���

�-���x16={�h�k%�|�U�����!�Ms��^R��B�
�%�U�C
����� �rUHdRُ��m$�PC��+
�3�C$�=���
-�`���y&jA��N����
�xi<��|�sT۶�;�Sy`����~��_w}16uJ����K��E�y���ֶ
\�i�O�*�7
����T��?}��*

Џ]n��K�+F��(r9�
�{��[Y���E�]
��u:���>\��A�I��;4��ߞJ K����������Jw����W�_|�`b��V�
n�2�պ�t�����6)�,۷�(x�k�x+�E��O|�����XY�^�������5�I9Imo.�
��$�q��i{�����*�&;�XyOw�q�/�0�l��6�ڑ�^��JKh��WpBk���[&,��Bk�XԻ�fwO�>\����B�
����>;��m�l��
�^�7ڝz U7�+��Z���:-��8�(��8P�8 $5��(ȓ��ld��m
4����
���R��K.�{�B���T�<���.�
�?�+i�e8�C�V�Z�h�4�!^v�k���ZYZ�AWTW��T�0y�}�(&&5��;�I8�Ow�����R�ٲ*��N�h�x�Ų'&P�WS��yL���݀*�� �.���I��
�+
K�ʶ����G�֦8�ީ�\�1�|�0�f]��I�@e�|�8����ݑ�����hAz\|��4 K���Q"f�-��e�W>�J\-B����\��5�c��B��T�<1��#��u��ʷb98�@!+��F��`���3?���G��O [...]
-�0P�'�Q�ԅE����A��鑶���ݣ��KL�<x̡.�r&Ǥ�-�'�@�����ro�9�����N��OP?�ć"�o쏭�f�W/�\^;�j/Rx,��]Iч
��
���=�Gz6Q��Ӹ ��H��4{���V�1l?��A�1���S�]Bs�]�=��ᦴg�U�	�Aa>BT�H+Q%C;�h��7�sVy�ŕe>��5��L���`�~���=�.'
4�o�	<gE拍t���wA�T��,'Gb��8�J���
-�c=�8��t�w�Q!ۤq-98\TK�`�9v���� 	�¢`����Hc�4�H���	�
���H���J���ȗ0N�
+X
-0�6ǐ�T5������������‰*� ~`tK�	i]��3~2�
{(�����d�C��~�(��g��;�q�ϺD���bS7�m��$r��)��X�'�;�=Oz��؅��wn��!�Q�W?�����ƨzH�~Y$%�Q��6�Č�;2�
N,-'`{ߗ]�����L���u�Րzc
n��d�t7��c�h,�>��ztB���5Ւ1�c��
c~	x�c��
�	�p�BFChj<��+��}��&��?�c>�)
�dS�~T)C&���qz�u���w��'/
J�v�Ej�\��n�=�z�ˋ_#H�]�8�7��M��
I\�z}��97�����E��F�}n��Ѣ!�L����¼�O7�7�vH�Y��'�
]�4�ҙ�^U;�N�U��Wu���0�@�Ө�^��#昱&`�H�؍�[�`+���.�o4ǘ��5L"��c��A�
_t]��{\�&�^ƪ�Li!��ɫ0��Y53��j�fK�M�8�
�;�ʋ������K�Vc ��mo��iy��G� ���.�-����/�ʲ38�-�c6�#!.D7��Dt�fp���p,9RgZ��)b
w-�޺��4�a�p��]�.Fq��dU��dN�%\n�O߲a�#
aQ��p���9��=q����;���moT�ϪIx�"��������3v��U���M�bzE~}�Ox�_��atE�Ӗ��	
Jܻ�K6�M
-i�gs��B8
�f�
N�>���N�Oߤ�d����&�?�N�i�=;ˤ�=��� $8�^BH_A��ȥ����Jm�W�d�I�ݹ_�(������,�!iAX\�^�[T��|޷�7�g*�����q�)�
E9�g�ɍ
�.ѩ�Z����˄H���,��X�������.Ԥ �3qlS�/��9a��Z�Z� {$�bA���UH6U�sѩc��o�wܱ�s
_TZ�����#X<�X<��>���I���m����b�����pl� �]i��~*~����ʫ!���npvB
-�W�Q�l�Ķ�D��n��K��Zᶤ;���L
y��u$`�[<��2ɴ�U���Bnҙ{��z��I��Ѹ���^�ABg
3={�Џo�1$�>QM�P�� x��W}�>h
91[J���_�OXC�
-댪��S�٭3k�a$~_6
$W���(�;��a��Y+�P,���HU���>\�A��"�'���Jf�4}/-ob�}�h^�0�UxK�����f�[
z�Ӫ��V�?�.V�ǝȋy]���k����N���J(w��
��[���֟4q�,8L�4��,-�]���P]Y�
�&�σwC:ʋ>u����
��B��l��D5Dz�w��!�e|�E��W��lc?�
�5��9�]��|ˬx����㵞�%$��]2�芒�q��ި�Fb��}�`��Mm�~a��MR�/!����NvbM�Mnl��dL.��V/��iPJ�ƅ��*sZ;">�}P�$|��7l��P#VN�~?�B�����cH���,9�
�⮲Ξ�i���(9��*Q3,�ӯN�ͬ�vk>3���g02���

�Sqӄh��G���|5� ���9-�Ĥ����U�8��9��Ӝ�F�#��ɭ_�RP?
�r�k�tt�G��
-endstream
-endobj
-3357 0 obj <<
-/Type /FontDescriptor
-/FontName /GYIKAE+CMR10
-/Flags 4
-/FontBBox [-40 -250 1009 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 69
-/XHeight 431
-/CharSet (/a/c/d/equal/g/h/l/m/o/one/parenleft/parenright/plus/r/s/two/v/zero)
-/FontFile 3356 0 R
->> endobj
-3358 0 obj <<
-/Length1 1571
-/Length2 8204
-/Length3 0
-/Length 9229      
-/Filter /FlateDecode
->>
-stream
-xڍ�P�.�S��h
A�Kp���ݡ	$����]�w-Z�/�(�@�G{ν����3�Mf��-�K��g�Q�b������`P;H ��� �x8@ nl P���%����T�zi8�
� �1C<���� E{ ��_�K@p�@B�2���2f�K�
-@;c�a�
p��
��
L� .!!�?� I0
ba��!l�7Z���`0��B0�� �œ�nnn
f�
0��83�
��h���pW�%�w� U3��8�� m��_b-���
<�!`��
�
<�
�RP�9��+�e���5 .�����w 􏳙����
��Z� �`���2�
�0�Z�64�w�=����A���
�$n��� �=��wu�p�#™�b��B��a
�,
���98��g����@�`���{p��
����l�ZZ�.��őS
-qr+��m� ����� �@ A! �	 v����
\���G��[�����#�`�P�b~���r6sp���?����� �
�
l
�b�'��l�~�<
�0=�
 ������[�0�����
�SGWAMS��O��VII��^��  ;7��%�x8��w������H�� ��OD�
 �W	��W�s���ua��
��
�L���1�d�����L�?.���
��B���G����������5s��{��`�
�a#T`{�_S=�_K����8��Va���Pk�7�,q[�C6�_3xo���aΐ��
��
��îY�=<%����?��_)
��Y��9n>~�
n��0����zXNK��^89�0ă
�<�
��{�B N�ߢ�� �����w>����\ N�? ����k�(�t��z�|��p:��8���� N�?�C�.��d�t���1.p��c�]���2���`
��9��H�m}p�e��S7��q��^:3��"���3��&;p
�C2e�=��WY��KԷ^{m��a�I�~yߘ&hNm��^�$�(ړlx���]�Ŗ����n�
jr�"0��EO���ҭ_޽a�|�c�ܦ�V
��M�4{�N�q@�'`�y�,9-���#�cw�O?f��&�X�}�cx��
7�c�f=W+���{(�)
ɟ�^}�b��NU|2���x
�1m��s�C2��6�禪�%|��pB�����D!*z��e�C)M"o��⺻©@��3�Z"�^�^�
�r��f˜��!٫�����q�]Yq<�R��<f�覈��p�e��V
-A�g-5�>�������i�Dy���S������a\�<�����
s���8N/k
AE�axC���lN�ˑm��N�$X���2&������MW��h��z�g_(��&g�ƫR
-^[g�sk`���ly_Ks����5~���i$���TR���*��
�Xe��U��wd2��X�g�����:�26�?M)�Pؑ;��x,紬m���~���j�;ce������R�Z�˼{W���6�72��>�*��^qDVc�����Z���'�2G�oT<�A���U��ʡ}�Q!�ȯ�c� 
��
s�rA&u9�y-`���]�5�F#�05l2=��\
�6<��V����l���^_��l���[�v�5���1�����f��R�9}1l�d�V����Y�
+U�'���
��UEj�e�Hi}���T�a��v�$�
���绚/����Ȏ�8;&<k�
-�L�ʫQ l�s\'��x�e�.gʏ����
ѣ���Zz��#�b���by䙙ģ�I������:���_�8d�<����UT?&4�/���ˊ�u�OJR֘�����W���h��a�]�LH��!0Q�W�c!����
)i�ߡ:�̿X7�������7�=xY@#N^w/y�ZD�;�'f��c�:���0)�e
�W g�6?�Q�R����O������[
/�
(�Sw�n���R�
��M	eh�*�4�Id����v���4EBU�
��I�&�	���HFB�poa�n�I�:��-�Q��f�_$_�
�����
�0�~X�E
-Ȉ�8��_��Bd~�ω�|<��A.��e�S%�� ɓ:p�H=��`H5����^c9v/���K�٪CT�oӚ?S��KA�Vl\�h�)�ڣ�/+Vڣqm�M �,KL����0�
�`^>���H��
�ib�:��� ��vS��`}&����f
�H�x�W��ՂD�P�
-Z4�3�+]��X]�v\
��x�c�k)���Zd����|�vf�`I��aϮ�^�7�ez�+&cd���f
���He�{�����&)vŧJ���K#ͮ
-ߦb����Y�_'����
-�|G��O|��+��nE�`�OV�/kp
i�9�{0i�i���:.Ի�"=N�L����

�$#1=p�$#8�ߩ
i��r�s1��:��ވ�9Q�;Vw��AE+����}`�9�SI3���,v�<�^�Za�l|�
������
�õ��0�%��x6�Q-皐���J���k��B>Z��W4�So�Ϛ��X��Qd�̄.����e�u*2�����D��s)��@U������nE�W��I
�y���
i'E���v<��$&-O8~����r�����lD�KC0P��{=œ�gU�-�1>u���И��c~T�8��ېswm���M���
��
��F9Sk�y�ғ_eK�K�
-c���v���C����YS�	f�}jE�7�%�~�{����S�W��q|6�ܪMY�i��`�➴�lv ߵ�I�d�G*����G�GO01&9��}����K	5I߻�G
a_��b��?�d��D&�P{��?s�L�������%[4��tl�y�36��dZV���3����	�$+���{�&�����~�?mEi8�+ޤ�����G9�R�c}���8��d��d-[P!Wi���<{_��&�4t&��G;u�'��/b��g2�L;�(3BG���y��
��0A�U���ZX�sb�9"���T�j�:�e��K}��1L:��8)U��UhQ
-�K^r[����u�2�|rr��
W��&�\
����;[��2��FRo�;�G�[nJ���[u�߄?w�^�pe
XgX��#����Na8d���Z���H�6���y�\��.�Y���c>�V'�N#=U�B*���@�ךS
-b����ɦ�
�T�z9e?�6�/�L�;��K�F'�
�:�������/	��j,\ƻ�ǮD
-i&�
-o׫C��ib�1�\���0�

�1&�M����Q��jK���;R ҳ%]����Pޟk i3[�/%{�#�����rҾ�}
�m�/0@�eߟ�Sn����a����s�z(�[�
tG}*�n��*�����Z����P�Rw�������~��o��(Vk'�J,%]�E)l7�������r�����H�
v+�

-�7����p>^~u�����@i=ڳ}q�
�EwS���9�����E�TMRac�8��F�
�nD�-o�<y:��u��	���z/�c^H������#c⼍6��%k���
-���/D�,

�N(��P��=u�;�c$�8��DNؠGu�q��'������{����N�v�{EV�9��g�O���)����:ī��bkb��d�5vdWL�O��W����=
�.�o���̈���#QHky�oe������ݐ!�1�طG<�����J�����=
-�W
ޖIv� ��!b�)=e�N&
�x4hqlc(l߽S3
�XT.S�'��YM�q�^�.GCv
��N��ܑ�W��J�fp��߭X�"�먖�SG�/��7M�]�d,O���{V,CЂ�x���]�0#C߹���o!]��g�-�B�R?�޲���
-�
>���0�[I���x��
5������87�
�[�J��=�
-}��=���k����n�[6l� a�|��^��Q�
-���ј�E�Q
�9��EL"ez�Tl;FG�j$eJ:̝j����.�<�F*��C��.��{+���O
-�Cs
-��wI����5
�I���"X��LD�/��X
<��A���*��9��Su�����GW*�R��ښ���ÛG��+4uK�V��r� k��
�
��(n	- �w�9����mZ�*bPX�\V탁��"�}Q�alR�ν�Kv$_��i
-�ُ�ӕ�_��7�j,p	=9w���y�6lI�Xz��+"�g
�3�UI~Ӿlny:Z�N�<pn����k��7۾����y�P���h秼YJ��oB��Ȍ��կŃ(���4],���~̀V�]s�O��D��vxn��|ޙ9�����z�����`-�}�@A�7Oa�۟�����lg�<��v����T{f��Fg�̱j�#Bt��O����O���K�`
��0I���I��DzE��"����#�g�گ#e�����*f8c�
�[���X7[2���>ԍ��|�o�Y�ϯ�Һ&;�V� �7�z�ol_�Q9��e�Ɯ�\��nW7�nM�%���uy�\��^y�~
�@F�d��g�u��˫kǰs�Z#7���dy��gͮ
o^�������'��f)��
���xO�RLӝ��1!
��ҭ�Ad
mҵ�%Tg�/q���
c�WKhrZ{#��:�#�+��C���8m6"�X�
-����E��T0��a��*rي+�V�h�����������8%�(�P��u-.I�6�"

���+�'/JU�����KJ��=���BYk�WI�|-���u�k��F�u�0ω�V�
��!�iQ��:�&�;XF�V�&k�O��ޖ�h���]z\h��㐎}[����}o��a�G+Y^��X���G��U�q�������~T����^Ѯ�h��$=�לk�/� ���(�7!"v�*��;>�Q�
���"�>��R�����<��d����<T���Y��*����{]F��b���k��Q�uS
5��\L��i��T����o�����GA'�SbV��OEj����2ū���es�&��HC���={”�Y��Hu��0���U�1�
��yGo�
t��
-����f���
��\�
ο�J���"磃;,}a������3
KSV�Y=��bP۩��)�*���Q&6��� n7�
Q�9�E>ͦd��S�Iͧפ�
-�v�Y��z`O��ӗ���G��]�9P<�%�H���[�"Y�H��3��g�{,Ө��FY��s�De���t���ʾ>�>@���v�s���i�f$4���U��X`N I�jɅ��v�rnф��
+��#�S���B�CME�13*[H"�.�L�n[s�:8��ɨ���(%���
��%�=��
}��p���l�	H��T�17k���ą�|`���yS��f�W�'�2<v:)�F=��l{�s}T��l����px��a���/o�19��
G���z����
��fSK��gg{��7�Sgi�:�CM���bI�`��\[�jZ'R�4�������L��=�����ky�e�h��*�ܽm�Tm��z�Tg_��6�x�%Bgc��$�[�Fz��0�W
7��4Q\Ml�
��Q��L��0ݘ�����p]�;�z��7�ܨ��d�QW�!~fZ,z���YηWM�]�D&�B���F� 
�7���E��Hh�("s�K&{�
��A[Lҁ
.����(&�-\�Rq.Sl���d31Nf�(�/�y��g�~���ܬ�p���i�BN�ބ����+�?B_�y�3Xt�p�RFy��ӎ����7�F�b�T{b/=���
ߟr�t^��d(>��/Yܕ�Ue�k�{��c��ך��*�1D��n,%�(:���$,�պ�ː+<N�?�w
”h
�U�Ωڬ�򘣇
�[�����ܚ	/�1�
�w��ʋ�ufA��h�Ε��#i�]�r���`�d��OHO�u8�o�Wl����4p�5��I�s�=V��eIYz~�wW2�����R��������f۾p��h?�՞�Z���!U�Z�=�1m������g�*�G^�!]����"�H,�y±{���R�vf����
S@�m�XE�a�
��2ǎ>g����E$Bur,	@�'�ÀABY��n�W�6!9*o
�O�'�Pb������E>��D�0`�ls+1��o�C�gBӾS=�,�
j����fy�Ꝧؕ�

�D|��~�t��@�C��}�i�i��ղ� [...]
�p�

�K�͏j.!�BK��vvn*N��v�}cl�,
�
�e�9j����%���wZ����5�ʁA�i�T��p&<8���L��%���~��x#���5K5��t��� [*:���Ï�A߉�_��*�dCG@
�mE*�ɫ/¨��h$=�����3ɉ��Rx�l��,o���d���^
��7�빗����?
�F��`~}
=^���/\T�c��6N�RЌ����,�%U��|�Q���C9�$p%[M�]r�\Gz*��V��xD'xU���H
�Z6ઝFU���5b^��"��P)�`�ǯ�r�8qoQ�rn���G0-���
�i�t�|;Sɵ��ن��Bg:��%��c	����3ǹ�Vz/:� 
��h��B�8E<�ܫ_9���D-��<.��񈥙��#�q�#��s2�eö�x�U5o��e��$�9ߏpFWI|q��a!S�Jt�I-5 at s���ц
g��Ml���HZF�b���C��4�p�A�Zm��U��%j�R�kN-���gN/�xD4M}��˖~T���)�X��7VT���*Z���E�TE���G����Re [...]
-��Ԫ��!�2py���Z��w����Uy�/7�%e6l4�V]*RF��7sѠ7x�w5y�°}aMGw�N '��[}~�*�R��(�u�`�-�e
-s$,�%E/vB_�{9>$8��ԓ��xd%�Mԏȱ3l�s_�����ъ]X��u����s3.X��:�}�^���`Jg�B��,k�B-��w�+׏^9���jз)-�����;�^L��
���
��w���زr���z]̏�p�^��t��O���7����N
8�2��w:MIh:�.Y�3'Eg����u2b�CM�
��>T����
��ҟ
�E���$�yms��S��z�E{�/���3OR7�[������v2�Z�i��OqM�I��k{9D�w}Q
�@){��ܬ !x\eV�G�X�8 at X�)Mg�6�r����!�����ͲKLj����"�ƣ����o��Uu��?�t��z��^�۟���я��k�m��D�U+
-�k�G�r7�Mm�ԫ�z[���ά�
ܪҵ&��~s�*��OxݟV��%
v%���f�U/��nR:,N
G�O�c^�P��������E�jS�UY$�7�G���qB�o
��:��I%P�3������>?�v��`��<E�u���x�1���&
����J����c�����D/{=����r��`����$8o�Ǵf��S��H�����e}HQtw��f�9eT�B��dŒ��^��89�E���0�
�]]�J��7%��).$����K��=�҈�;���
a|��}�@�+XS�k����(�v�� ��uc����s�������eo&�>n��c
P��+b ��w߅'NQ�P�Y8�i/��}��Q/l�~'�Ou
^r�m}��N�~�R+��j�8�I������XM�g�Ԏf9n�K7���T� %ry�}�xr%�'Ս\�i�j��5�c��Kܹ��%LE����_�P��(K
'^�y���i`
}�i���\���)-����5<yVP
B$^6�tµJt�ߟ
F��o@@> �5 at w���9?�qNwwP^J�p휪&��3��>_\M��,��vh�s��O�V�k���ͺ
?HC[�pձ���| T&��lx�K���D�.�J��hH��Ĕ3V�鄹�ɡ�:,��1E;M��5Q>�u�3)���+
������>�#�
-	��.;{�O���c�q����a4�ѥ|X���i��l��Y�D�c�Ҥe?�cB��l:GY^Ju�N��
���S��Y5iݺ�[�m���+�W�|Ê�ˍt����
k�r"���ƅ��J4��v�����_x3�Q�Qp{V�����jӖ��
�k��Բ&"��p�*�UŒtY�RU�+�k�}-���9є�
P�?!�CE	�s8�̻�10���ܜ�H��9��bTKD_�x 
��d��o�ߐ�[�-:�d*��	4K�
���/��Z�(���5r5dXJ�CtSc��-�M��%��#�
-��@Z�r�5
~v.��[%|S��V?��ڠ�gDE��TԴ}	��M(}��,���� <{.�DqI@���Eߗ �e�|͚�H	
-
��^8�yM)7_M��'�"���
-�rR
�&� :_Ic�%iߨ�_�>S֏h�[�*P��@8�+
��� 
��j���:Zc�'��b�Q����r�6�(l~ͧ�S����jo��	@8z:`c���@��e��\:
�q��J)߉Z���%�2

I��?
pW6zԩ�{��
��e��ns5�0Mb�4�K��uF��}\�	��f���{�3{?�
_���P�P�f^�H�N$��B����g)�1 ����
Q�h8}� ���Ġ/`Ku;M��RK���
���l=RN:�H�������`���^�>hW�B䚼��e6�y������wA��W�&�s�z��3J���)x��h��n�XHҎ�/+����/�9�a��֌$��<�O[�f�L
Ľ�i����U"���Ȝ�	���񡣔���U��S*��Ĺ�SS�Za�-��msX���tv%�,u���:S�D��e��\"�r��'[�����u�)�M��
�Za?[W\��
�� �{��o%tZ��^0��e�Ż���%�b�9(:���*<�a��(?l/��
�M�����N�Q��̍�	,&���@��H�v�,ܶ7����:R�S��qW�fA��"�\����;o��`/�v^C̤G[P Mm&�w����Wp�ڈĨ5�J��!	?�"1�����$�Θ
-endstream
-endobj
-3359 0 obj <<
-/Type /FontDescriptor
-/FontName /UVIORO+CMR6
-/Flags 4
-/FontBBox [-20 -250 1193 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 83
-/XHeight 431
-/CharSet (/a/b/d/e/i/l/m/n/o/p/r/t/u/x)
-/FontFile 3358 0 R
->> endobj
-3360 0 obj <<
-/Length1 1622
-/Length2 8597
-/Length3 0
-/Length 9652      
-/Filter /FlateDecode
->>
-stream
-xڍ�T�.�	�P�w.-��Z,� Aܭ@q
-�kq)w+�)�Z�(�{��zoe�d3�g��+LtZ�\��+�����
ʪ�A ~n��Ĥsw��)0@]�`�ؿ�P���L��`���U<
���@^!1^a1�����*�{¬���@
�`�E8���l�����d��yEE�9���v��� `8P
�nuz�;u���\�>�sww������;�q#\m%�8�^0w;��
��	���
� ;A� �
`������"lܽ��P�����
.x�������@]e5��3���ڟ���J������_�;����
�@N�`�
n
��9B��
-j����@0���!��
�p�	�9��

�H

T�������
�
-svw�v�9�f����C���ֲ''(��
�;?9�+�Pu�?�� Gx���<����6�)X{8���a.
Pe��,
D�d�Pw� �.@�7�s=g�J�������@�
-� �
�������]=�~�V�7���aw�����A
��?t��
|z<^ ������lY#�>����\
Ccce�?����Ax�����\|�  //P����^����H����r��Qn� ��I�v�����L���.l�����x�c(����7	� _�����Ǖ�������2��������Z������s��K�0�
���x�
���B�\bu�5�������͐��:�]D���j�s���9@����{G
��p��~f�\� ���
v
���=t��a��;�<
����s|�B@��+����$��}XNk��s
��#�� � m�������D"@
����|x��y�<п��o���Я
�<��o�֊y���������C�ۇ7�_j> �� ���_P���/�@�������Y�B]���_��x��>�/��C����x̠Po(0;��<
���zQ%M�ŵ9">��i����7���q�����!+d��\:e��`a]��Lj���o��#�9I�����"Qg|�03F�y���tM/
5��Ԗ�����
�&��\<�|�
�O��5���C�ӛ�[�T�oJ�r��ǚ�(�dʳz;EA���E��Nt�?yv>A�3zO���؏�/�3Y�{u9�X����I�HiBA�zF44��'���B�ͯ�`�ݤ�Ga�B'��b����3X�H�d?*ݖ�����A8�bd�\���[β�Jg����YN���4M)Q�G����²��kBQ�*
t����X�i�]c�<i%�hO)S+��ypi�q��k{mx��P���bX���`%]9 �`Ab	��w7X�I�*�eu/�(�8�G�B�����䏿�Sa��qD:ؕL��kz�-��`
;0s&mYHg
�
DB��'�%�
G�
#�ز�R�bh�;�Рb�9�nE�X
ęT4$�����b��K�ԡA�16�7
{m퉇��S��T~�ꂉ�A�.ګ��aWa�l
-y���_�3��p
7��f:�a����GS���o���������
���e4lb��;C��bgЛ
��-�v	*p<�I�g�_ic���P����x��d{w�6�.�k\>�ˉ坡���g��"L>���I���f'`"0�2���q�VHʨ�4r��ZK���K�(it���a�ۻw_j�ur>��dYE�.��bmN�Nz�jyd]���!a5�ټD����Ҟ��
 w��Ҁ�v
�A�>����>ηA_��������������S�zD.��ȵ=E�R�$�X~�{4aA|/��ɼ���Ϡ���������_{�6X�����)m�)1
Q��QX.E5�9�� �oh�R{��:�WuF�Ʃ�v��� ��f��|�q�S�����S�-���?0jP��F�iX��
��jJ�{N���cOp
-4���+o�|7	�d�S��g2+�� '׻h��։�w��<:Q��i���j\�.]�݄o�ʨ1k��r�1����g
�qd	���������I����m]p��hd [...]
-1wq=>r]��
I���(ç`�T�t-0�zS��ѯ���.�H\�I��p��I�l�g�����I[��-�yP����I?����s�74�A*ay��zKLa\��oM~�ى�]�D� �D���s���f�K[U�K�׮O}�mk���Kg�K�s� ��d�"$�Ã��\�N��v]�zo��:-�
���J�4i����J=�
�w�z���^�Mɍ�=x�tn�_VvU-gKo�����}�i
o'
�f��-V$/�7M�� �K�RԎ���USy�h�W��J�2fƙ�������"��e���% ٯ�l���A�����\.��;��}\�0�B~��y;��E�M�ն��ʩ��%{a�x���=�����V׋+R���6��f���l��J���F(s�{-ɟ�~���<s�s)BR�쩑)ۚ��n_>�Lh�7�
˂���]jN̉�;��%����(�C�kj���y�ֆ���y�i�
��m愒,�s��N�zx�����T�H�#�p�-��l���Gz
���㠽�t'�4iw)�Q����
�y�R�O�J膹Zc+�'��(��N ���v}k���o���
���R�
��>(|ip���i2�}WKa3W�66�D�z�K{�RQ}E;pR����ܨ#�Ʃ��s��gg��s
�H
Ȓ�[��e$�����e��+�HYvn�Π������8�>E�Ͳ-����K]֑Icq�zKpf� |b"W��Α}v��G{����~ӌi���� ������6|͋���^���Θ�?����o��L�˷�@uu��-kF�J���'m����ߋ����:&�% �Q���;ɟ�U���_��x��q+TZ�I��)�������JLN��j��l��T��������sU

X�e,�p��X:8{��Te,U|��_,xU�C����jE�x���v�GĘl��~(�4�x�̥���.z�H�*@��� g`��/ny 
14��'�&im5$�x��
��y�J�29wߠ6��ǜ�fm2
p�n��
!��@ѫP��s�a��1��A�Y�#ɚ�0�W����8�rϴ�y��.�V�}Uډ/Rrѿ����A"�8GR����}
�7�S5:%A-�R}�@�t���@�
��DA��.A���6v��?��Ӡ���:���s�1)���:))D��Ž���{��`zQ�cЋ�x1'm�M������2_���W�Q�G�5|/T5�lR�B�FҪ=&˛ϱ��ѓ��M�ԗ|T������e����A��R��'���	�w��
-�N ��{�
�1�%=�-R�.���L9�p�ɰےH+���b8nj
-,�qvWN�i�L���'�懳�N����h�\/
��7}�i��c�F8��v��/L�P�OQ��09���,q��\8#*��AϛvC�ӣ:�c��L��&�Za>����r��0�f��<Y�`ջ�왱#�/b��
-�CS��/�?6is\�Q
-�ɵ����?;#�C^���^���� 
�/o�һ�l"H"��L���eF�q�t��;�;]"
�}	�OK衘�S����.K���r�5�#�<
�P,h���Jp�
-,5:"�@e!-���2����l�T5�xy��mtt�I��*��(E�#�t�
��b�c�p���������
%
.
���
.�h�V������=�W57V�Gf���ᠴ#��D�/�Kևn���lw|���-,�׶������ǣz�T���5k�^�E�<cxQ8p�H�Dv��w����
-�"�;軝��
�g�N�T��O�b���6�╟^��	ק��w^ަlu�E��A�0XV�!�-�W6^+�FSBzW��t�Ym�kqx�%�Rv%80�U1�dMH^2�&���9
���}|~��I.���.L�%*6b�p��D����\j�!!��Ǒk�����p�c��J�^Znj�08wX�9N�e%���E�X
�ˊ��\��]�h��m�Hsf������B��1<���p
݃6��8��y�N�6�H�K�=�%�w�,9�	�\�n���0>L#��2�E��P�l�5�
8G��fb��k���-\����
�;[MNt�ߛ���E^�R�q�.��cV�9��`ƺ呋c����$�^<Q��]��B��x�9b��*k��������Ji^W���}��E�����#̲(��)@��Pvq�C���
-Ar�"��짳ɤ4�:	U���

-�?���T�������.�<�I�Pk�_O�")L��{ϛ]�
�(q�z�&� :������,��4b{K�Y��E����[�̆��y��lS�bF�4��
-5��S��:7<ӷ:1
$�()�
_ְ�- ����,�{���KH�^!�Hˀs�{O�[J�
�O��ҷh���,ӲV&<��wQpfF��2^�%����Uo��'��$��):ӃN�1�v���4]W�ER.��ɼz;���G��;
�p��!�_�}�jI�xo״�9�X�[o��*W*M�o�X�ҢͳA6�"�bڄ��.��ٴ����햳��)�΋ا�~��T��{��_����a
-%�����<��r�+?$Ff7sv�W�;5<1v�dG��N�&v/0�b��3�J+
-�H������C��H�
QoN9�,J�G��f�ې��
-����O��j,OB�S*��s��xO�D�9�%��"��שS��s�^뀛'܄׳Â[�C��N�s����
��w��
.��AA7lj~�ԑjE���$��ǝ�2�VPz
�:ޗ���c,O�ӟ�ۏ�r~$)+}lUG��m��

Z+��V��{��R��{e��M�f�+�#[y��sH��<���av�2����e
�b�o]3=�����Ӌ��]ee�n�ST�a�Yö��%��sϬ>�������F�Qq}|��s�;�vr�GA )a�0\�I�
Q]\N~r�~
-���fr�")�x�
d�T�$Pš>����u@
�튙�d
�t
��i�
(��������(�K����)��+�n������5a��c(!~*�OVV
ў��˳c�	�)�'[/U��չZ��[ja�	�bG��gg�$�_l�h����z�Gǰ����
_�*5[�������
��F�^cT�%���{�f5G
L��_�8�k%�Y="W%�!tG���K�؈:;�$p	���Sآ|'H��V�����	�},��M�$��l~,��qb�؂o� ٰξ��Z]���v)zSw�	ZB�M�Ӷ�=*��\*�
�i3`��2Brg3�
`L��.��b�欖R�Ϯ���^�����$c��
��,Gg�S�jֲh�ڋ.��Jv�2�f�8^�`�jԮ��7G���cC�J'?
�Mc
~
;Q�T	�q���lߓ�8�9�� 
��0�5�9�&�ߦԳ

���S�3��P��9�Y3b�$3�bѠ[ӎ�`��Me$.+ա��n��Q��tǛ �7�CfR��<��C��x;�ⱳo_�X�	�q
+4;�n� �ΨZ�٢�f)�TG]=u	�Lm
-�]E�
ѣZ�\�����2mcB����ؗ�!f4:�Ȝ4������s��|4��슥S�)
�iK�]����� �ˊ���ݽͅ?�)����~kto�	�@���`��9_l`��UL��|�Kџ�
]
-�N��%ہ�r�iz�zB&L?�ǔ� 7����'��9Ys��@�d�
P3u����7���{�xV ��ӥ�H�K7�k��W����d
K1��[��3���%�h}1����k0���
/��%0��
�=k�?+գ7��C(]�9$��J�6$�����*K�p�|	q6�?2lx))q�1�z�j�I`���j`+��x�%:���
xN�C�R��T͊L�K���W�},
�m����&�uO�R[U������p.%�dw�[

~Vy/B���'t�3 at 4rдUk�r_.�ɼ��Wm�w(��%#A�l����OGumd�8n�����c��HU"�6�8e\�#+(Ls��/&d�
^��+���st:���>:9��P�����,�t�ձ�j�5�hY<Q2D�!��mk��<n��",~���{h
5�
��y
��
�n�x�K���h�o�cl���S�T����3�u+�GN����/5�ZlNs�#�l4rWl��i,��{�B�(��]��6	g
��6
R��r��
�[xg���[)0�-ov$�� �?�_*�/p��ӎ!�U{��
Y
,�����Q��.�CA��
��^%��
qE;�MJ��8�
5�C��B���

���iX�[W=�T3Z}DH�y�q��p�u^'79�ę��ơ~5�} �$�1����Բ ��B��a�Q�B��΍+}|���jѡm�V:Ih�ܟ�&�4\�~�A��{���K^E�m���sV�R��٠��Ѭ[4�\}"h�i	2����ҭ��&,޽4%�T<.������N�O��\��OAb
b|�F�2c;�L���o�y7p�l!vNR����74{���"8����%:�%.Ks4�
��Kws��G���|����
�7miA��F�jq��5-����� �y��V����2^M3��v���a�3��[	���~��/O��l�+�0YTJy]�t���e�����+�V
�/���)����8��h���
�v��{L1���t�^~%���bڴXi� �����=�#!!%֔V��v~�6zY�U!o6���Q�6ԙ=E���4(&�ނ6�夿7��lݍʉ�����(H:�}�|Fj�ڸ9�Z�bF#�$������P��|EG}
ً�R�a!|��5���Vڀ\F����˭V�C1?U�����Ͼ}�:
��V����a
$�N�V��+�~�]ʔ�i�6���ۊB�dR�e1
x:Wh���
T�Q�jf-mW�|�BG4�p@�yܫ��xKy[r�+/��KUҏETMT��X�
;�I|�QEK��2��u���ȫ\w�է·T�
�!*L������fu�ȯ;�Qmz�~��ۡ
�%)*/;*�VB�4	3˧>����@�q2�7���ލ0�zg
 Y�j�jk�\�

#"%�5�MP��Tl�ڕ��χ
�{���NŬ������DS�B��?3�E��}�;]1��˹��",	�'�^�l�P
�A:Ɩ��a�ڝ<���Aw9l�i�!
-��Y
-�G�p-Eu�@հ��R�����M� }��
s

jR��Eu'�
1R���;6��Xo�#�
�|�<��r%%�
��V��/#�}��4)���6��1��n8��8Ij]P8l��q�+"�o�|yH�\4���8��!���k��5ٌ@{TUXqH�R�WE-e�B��Xצ$Κ
SO��o�O�4zp>�z�m䒍O�|���FYoAҪ;�t2U�x�q�8�VU�`�J�ɎE�ǀr��_\���]�H4"�r��u���hڜ?��)
Y���p'{�I�Is���{�Q��:����[�yS�0$�ӭD��,�
���p%��>=[ݭOl��5:́H\Ċ[�ힼAδ����g�m�GRi�Y�1��i���K��\z���W�
[L��tu˭�aEw
y�!�M`[�T,<	�Wf�r���'z���
��
-�Y��C�-������+�6��;�K�A��'�p���Ⱦ�3E1n�]�#�Ɍ�y�mRv��
����S.�o�s�=Jc��h�^�β
k��&��*�
��Պ���o
L��f��>[����Ǒ�}
��V<�=1
��D_v|p�,v)c����/Z@�i�L>NJ�	k�=
-AW��;߫�|��Ģ,
�V�ҚϞk���g��훴 ,�
�%+��̆�g�
-�A[
��=�<��l ��u�"P��E
��� k
-Ɏ�ݡ�s<<�I^(�F��x���=u�
�u��ۡH5���O�F+wR��8��z�KV����
T>�Xx�C��]��z��(�����1VD�
C���/;r�{�׌���{�g��v��]k��[��˫+��5bc�v��}�?p���:�c�*٤�mB����r
-
�}�EQ�>WR��
-v
 ����_���B�ə���"�nS�]9,Q)�|-��I~
���ɷ:L���V���w;��jj9.`��YA
�+�J`n[��R"�
Ϙ�?G�������
$|�*ʇ�K�-�֒��z��X�]*���s5��j�oQ
*�Iذ��a/����6
-
�r��*%��~a���O�<������u.y�$|������{���Ƿ�t�k�
{��y�NS��+�˟�47�ˤ=V�]��
$��O��[�t�
�p�
-`N0�
-_],��t�!U��HO����ߵ)D��4L����e���Lz3Y�#��{%��n:KC�d�(d��
`��ڪuCcG�K]�![����g*�r`�)>[[
����i���Nh6UN�L�s|�?Ʋ\0�$���ib��ۋ���fd�.�&��
���e�otv��
ٝ�8k�|Ͽ?4�룐�6ϥc�
f�E'��Ԡ�����x&7N���ҭ˰��w)��_BA�Q��y��XJ����#���4U�����0�z��,��\Z�Z�ueM�D��$�Oi�a�2m���:�
-�l����U�,�f4�:�d�t����tm��K�+�$
�>�EW���������A�g�3#���7�ǭ�31'_�L-3OG&���������gUw�#=���ӡ�V�<��:!�
���ՅԥƏ�ňy��\�i�#����'C�w9 O@�-�����;��V��8
J��0�8�%���"�ۊ��r��ɝ"Z�;h�\5-u'�1܏�䫹�^��/�t�����LOF9$���s�
0s􌎿`	n�ኝ�X�5�L�-k<��[3o�
L%�z�`7��ILkVp���|v��E�i��#����p�XN���f����H�|n��鷐�k��įl9�I���)}i?�|C��P�h6C`R����CG
���4;�������<���;��sc�fC�
X��
���9� �n��Bэ����9׹\�UFk��ѷ4������Dj�CG�TR�+�O*j���Y�Ɖ�C���mb�bv�:�}��+���oإ��/!C�[�{ᶚ�;�[.�+Kj`U,%3�J�R���@*�z��3p�J�+
���ח�'����瑲Xj����m5���8ٍ�
!�ޮ��t�A���Lmɋ�]�'�,�l����{A�s�:�
L
-�ۺ��@|�V

ˀ�a�:�7Z{f�
Y�3�@�ӻ����v"��ש�+ ��
-endstream
-endobj
-3361 0 obj <<
-/Type /FontDescriptor
-/FontName /VWYYIV+CMR7
-/Flags 4
-/FontBBox [-27 -250 1122 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 79
-/XHeight 431
-/CharSet (/a/b/d/e/equal/i/l/m/n/o/one/p/r/t/u/x/zero)
-/FontFile 3360 0 R
->> endobj
-3362 0 obj <<
-/Length1 1577
-/Length2 8923
-/Length3 0
-/Length 9964      
-/Filter /FlateDecode
->>
-stream
-xڍ�T��6,ݍ��
��Hww�� �0�
�� !-�)�J�tKR�-
�����_��֬�̽��{���7
��6��%�
$���q�s
-�U�� ��<윜��tt:;�_Zt:=��3������<��  %W; ��_�K@�����)�/G��0@�����`P�3:�4���	�vy��#�т	�%$$��'
 ir�X � U��5��)���
���\<�
�Q����A����ݝ
h��s�1��!.� -�3��
d	��.@
h��;:
@����Zf��t�v
��)�j	r<�h+� �
@п�U�r`�}5 .v���
��
����; ��(`���T�]<\X@��oG��3�)
���͟
��Ij�O��ݝ����ř�b��C��0O�,
����ۃ�.��듁8�,�nݓ��Xm�0w��_g+���w
��
�P��+HQ�o�'�?:0�����) �
 9@
�
��u<
@�\��O��z;�
 VO-�|!V��?tog����
-���O�K�\\ K��
�
�@��AR�����&�� q>�
�������,aP;���
�CVJWK΀�O��6II�< �l<B 6n>N '?@�����(���_���j !����"�
-������Wns���ua�w5��A �h����������L�?!���������#�jg���������!v�۟X�����������>�%VYB\��ת�|�
I(��ߗq��x�,5 .��_3x���@A0g��g�����?��]��}zJ��&��zZ��N)
��Y��9n>~ ��	��4�'������� �?�p�Ca.O!���|V0'��� p ��H�+������ 9�>��^ ���� ���
-8��������������@�@V.�h����E�b�9����p��)��?O���T�u=�NO�.��tw����O ��}�+��U�M]H�U�$�;���4ݦ�{&6��O�7�(�LՙA+N�$��q��e/$)��ZP�?&j���ܙ�kMn���O���I��Q����Hl��;���"��u(��:�
-bk�\���{���	����Uͯ�qW>���&�d�.�<k��م����g���4~��#�R<
��~
O���U���Y��
-
n�NRZ��$�#���R?S���K����=ZE�(s�XS��p�rgTC��B�{j�F>sm�&B��	6k˚	M��՟W���%p��Q��l%���K���&�|Qh��0+@�X��
�>�l ܉ɓ�S��~4Zx�^Q��f�֊T���^��>������2_mL	����T�_�w~K�T��
_z�#'�\��f����F������
#��!�H�LZa3�p�7��H ׮D�"�B�h�]�~�1�Y����;0a��e����y���V��)�)��I>�Ď!���/���[�	�1JW��9D�AU�47�w�W
Z�}��ۥ0[�������AL
驨�(ݔO��2����;�
�z�'�*
-\�����ږ��1�"�<]~
+[RmZQ��g�m(:
�бo̗���R8��
��5
-y-TWf�y��d�}�x�
-l	"�SL-r�e�W�{${�q>�
S68�Ċ��Z𯨿LLO�
-�ء}h�<y�.�z[^ �&c��L�0�GYl:�]��
e5��D���S�_��[�{sI$Qc4�p��v�3����ڗ]g��
�
$N�!ӽ�
��2��9�S:1��]�^��}y�����}�u�ɓb���[
h��z��_[W��m�[D4�1ܘ
��ةAa��UG��
����,$d���[GH���"9=�D7^�����o$��{a�MO�g�-��W�A�
C���%6&ov{?��;�o�R���ּ��X��9�\������\}�@񍊞H��Mδ���_��49&��*D�s��̎��L�B��_-�Z� z8URu,��HaJw��s���#Q�ٍ����L�[\{����uĈ�f�S�.��}kn���0�2f�)
�T0
j#*F�U럤h/tCev��>O7ﹶa��0
����m��'&�|��6C\x��d� ��fٟg���J7���C��a���,[���KJ~��,D�>��z�kE�F�d3�&ڞ|��=ՆF��ށ�h��X
v���� ���ŏޮE��ڑ�@��j?]_�n��Q�r�<8m/���
-$�y��gqn
b\j

%ݬB���5_&
���Ȍ���/���_����VK�
�D�s��
�������Wg�#�Yݮ����v��k�qWrC�r�Us���v��ȋ����54����>����j�*��r@ȉW	'iai� ��!C���T�\���p�>V�
�.&���ۓzѾ��ʔf���|�ҁO��Y��95�vO؜�^`�&9�|�H�mU����^�j���uM,����q
n��P�-�ӄ��U^j��I��*��.��":Q��,���׿��#��
�ln�^l�Ǹ
��IG�
�ۍ��ޛ�Z�Z�UL�s���{����c`��`e�u��
Rޒg6���IPv�;� �A�ڞ0����ߕ�Mj�g�
�F����v!�p-/xs���L���@]��;hκ>�DT����+={os�^P7�����i+�|��͸���NEo�>u;�y}j�
����`�~II��A�\$!+T0����:��
ڲ2�=E
����� �ki�d���
-ʑ
�s!��2����B�/�”'y'�;
@&�3�qD/{e�:�"����!��$�b�*���/��#�J}wR��Vɨ�c�^D����S
�$��*@?�� ��u��D����i����ʂ0K�X�}�
B�hJ�E��n��/�=��a��e��y?�".L��*6
ߴ��%
tBmW6cD�c|3o�FF�����\ʕb�E����J*��������
��n���Á35Q�V
3bW�(�s��w�mQ����|A�:������#���
��;�|޾e��
��-Gi
-@�]�i�\��lo%�6�sM�4��7O����3h_��T�T���f��7K!�q4����K�P����:�}D�pY�ɱ��U3*g*z���Fe��=�M��{��D�X���E͕ާ>�
��3����z/Dx�t)zo�l��zG�n/|^��y!�(d���e� ��R#>���i��r�8�'��U��
n�*��Y�_i����h���^��]��_L� +>��)o����F\)>ӔXChz��w��|���
J�w�y��W�˰5��)��i������
"�����S��q^��:���\
��cǀP΀�A���
��<���3�]
-�},�j[��{�\>��Q��u�A�8�u��	@�k|:?��H��vz(Ȅ
oeL�>ϽB��`&m�?
-�byaۉ�Ʀ�m“I��d�m�¹-��5Y���	�$n�
"9ў!�b>T�X�j!��.촧�m�R/"<j#t
�y����5��4b.�!��ށ�j��
|0�Y���
AQG0�R�R�j�G&K�y��N {^�uV�m��
�e��V�\�dtl!�|im?�|�Դ[���
�EZ_J����L߭hO��oҋ�].��w�*��|��O�e����@/�
A��^���
ԯN�Q�O
��R�M֝|l��s:
#�^(�X{�oI�n1.�Կլ��4��'U���7�x��m����qV�n
-���Slv�<�̨�}�g�K�"���<�$G���сx��#o
 9���]l]�<��?�e�+J��/�Db
��&��K��`���w��ѠM��4F{f1��+y��
5�]���H
�𾕟+	�Oe
gG��&d����C=��̡����5��h��x{�0)��
�l��T	���3�c+f0Lq���k�m�[!)<t��˽JO�&�|<-g�\�1O%�.<��R�����!u���a��@�z

�������
-� �
��W�%�
f�N™0t�Љ�L�o(v3�צ�
�rn׿��j�-���(����<c��g�	y�J�̥�m�Jɘ4��b��{�	��#ȑb�i��ŐK,�{=�4b����{���҄`¦j�5���|�����[�;;vG�W�j��W��=/�s�>�Z2���	� ���
<҈
-�F
	�SU�>�
8�*�:W��3��
8x�0������}'��C]��9��B
���d�[����,��Tz�:�R�r�y�� �|rȀ5�œ
r��ޠ-4�d��(N��	i�f������0�YkVV��p)-k�s���NI$�-�)�B�0y�
�6�R�o
-d0Hk�c�	�9�|�x�$�W��8�h�3\R�Õl�@�w�
>�1
r�E3��ܭ
݅,b����V��Pt���vT�L咂ԇ��#/��98�7�7�����_�ŵ{����pe���}��uWb�tw�����e�q&<�+��z>�-Θ��!��j���V��]c̳�W��?��V�W���~�^Ϲ�R�n�P�ޢ���Ĺ�����37{'���x4�1��k�>�^�k��O�x'�ī�H��)��(���2�z��	l`	�
�
->��5J�������
eL>i}�Z�Vh̆r��
-���/؂�)���?���&��"y�mbۆ��
���G(��zq�������,w�~�I
�Z~y���0�\���L(7u���
�-��㕅H�P鼸�d�̹q����M����G�yq�:A�j�R�)!�+m�/�S}R
�0��n��O��2�d"�X�j)*
�M�n;t֪��<
�ZN{�Vq�߬0H{ ����1M�
�m!�}O��?z�ιL}[��~
9M*	x��Wv�����=�at���K��'18>�hx�HM�fY��ٝW�{.<�qlm-�~����RD�"���)��d�x��A���Y1R�<?>CvZ
{$(_,�f�2G`j�X��duO�
��Wb����~&9�0�tp壸�Y�ߜN&A����Q�.&�jB
o��!3�)�&{+J�|<S�ڗI
-�I�yi��D�g���u���<����BֈR���
��
S!񍎜�J�Xp�++�J�N������K�
*;~�qƫwZJ�S%�c�^2��� ��w;ɲ-��VFs5���B|�gc�1܎��q��JD�d+��퐑�n�9�=.F
�o
	ԋ���)�e�63���Aʥy7�>�
������z�f��&M��ҫ�
-��A8
\G�ye�@M�����aU�R�ڛ�w;8-���[�Ja䟂� �M
b�/��0%��R
 ��rΤU�b��縫
�f�l�\𑗾ZF��R�
�SND���!ܶ��_D*��~Uz1^Ռ��[0��fu
)���U�}#h�Ϻ�
g�*6y�ɛ�h$>s;���-�m�6;bJ��'�qZK���}�=������u�j&V����-\z�:�_v�#k���2�[��4�|�i�rZ]��&�S2ejf�G��7tt֏}�s�H��m;+��[�}
���j�7�v��Z;��I�Օ����R�s��6�b?�T�%��-\BMq艘�<�1�L�2B��t軃�xs*�2l+C�I�{���Ĝ�ح�c��0ַU�e�j�A���_>;!�՜|�Q�7�`J��
-�'�
�0Wo�
-��
._��hz
,ۮ|�c�נ��!($��:�L0h��=o��J��{���!����0?� ���7�F6�HE�Z~\��IBM0��I��k���U�T:��~jU/��l�o�JL�*���N��̊Д�
i�mM*�O�%�D�z	�5�iQ�ѯ���-��g���ξC��N���3?���N�<�'F��4�*R$ J� L�/♻�2B`�;)on��~��\@�3Tt��$1p�'�x9•M��q6'\(�TeY��Wz�F�.G���8oxK9ې&7Z=J-:��F
�\�B>�
���9hG#蒮��uFB� Y kM{{I�"��T����}�eU���N��!���J�itN����]
�K-g`ގ���O]�E�N��@8��d��������YQm��ɼ��[�������YuN�&�[ª�B���9��!�2	7��Mq��E�)��I���c[%&J��(����(
��̚ٽ��E�&>Ӗ[2Cl��<ؤn�'��פ�^�N
-��Fr9��#�\J�R�z��d*�u�
-�'�mv�~
C�*��Y���C��K7��ꈐ���7-��In�`�=�n����d/���q�Ʀ_��ɐQ�woSZ�<�.��?V��z��Ǩ�v�|Z�%,����sV���w���	��C#Cʖ��
�
-
-6�;���Ȥ���x��6��
-=U'~4KZ<����U�9+c�����b�t&����|�����!ʵi
��zM~ie��@��7����?,���w���2�
\a�>��J{�+���P�v��
,
��9�;=���8�f�NGf�B,A��)*�M�qg���J
U���"�����C���v��eh�4��L
f��Oi'ᓚ3
-�͙}M\Dт�g�?	�d�7�!	z����֝o~լ��@��eT�z�
Ϧ?���A���˖���נ��Cb���L VMzީ(Ê	�"��N������"$��K�
��$��fLu�K ���R��"9���?{wDS�Q�F���E&=��ʁ��s0P�y��jLG���K�;j��'�;�K���0����4"��l^���C�U����i�?�*V����K�o����}���}XY�T	?�>0$�ѹ5
̈&WN��Ŧ���ܕ�lV��8��N������a	��$nƄJֿ���3	� Õ�ep�J�@���\Od!��Z}�cN5�*x�j�y����S�����m��_s��߯q�/��y�81
�v�B7�v���~�����qxn���
�
��d�#�G��?��	�Ď�2-zȑ�4K��
P���f
<�p
�u�5b,�kV�����*H�P���X7����	��)D���;&�2�R�RNi:�V:_�=��\�F���4ɷ�Y�#d Ÿs���*aF3LH

��������s�5����F��a�n�Z�Ɛ�U��3V+�F
��.�>?q��0��S��N��/�/`X� �OM�}<���$8zt�Y2�Q-�F'������@�����D3�}�͊H�S���X,b�� �d�m���T��Jj\歰�깉q��:܍"����f2�н��%��J�T�L�Ͻ9�-�kl9٩���
�L2X1#�Q	 D_�������D�/_(�|�T�?
�����W�f<C�K�QvC([C�2w�KHP�����q�4�<�E�Go�L�W����RJpd�
o��̜��
>
-Lu���n2M]�̀�N#u_�3:�Èܔj���N�n���`ꇝf�cqd�0<c��9u�wZ)$Hz��]�pN�o�fX=���(�+��F�e������
�ߤf����J�j�QhH���;��|�{<K��)�!+�
J��.
9�g�`>��*���`�̈́�b�ǂ���T;S=�~FxrU�wOT�^:Bŕ}���W��w`|���iW�=��/
�}�FS���7rM����p;�FK�+����'�h�;[�riP��a��Aφ���HइU�����̒F��~��!ZWY;������.�h8l(2l���M���
}_d��<��'�
��
T�Zn�S\���
��O����Ļ�����{���p�7M��#��劸'�Y��L���D�2-(N>����Mx�a�cB#�U�#�u
u�bړI:z�*_jWx��|��dP�v��.��>:��&1.��!��|W+H�V+YO�#9��<�r��w�
gGl
	�<�ڎX�h|~��}����x��(ZUѩ�xwt���Vtj�[U%%}�{H����Ԑ�2�Q%"�2$t��谖��ppM�
ӝ�^�7�i$"k�1���j�7� 
��C`Z�Mm��2���g��³��\��X��+k)�����
�^7T8�G�y�ݿ*�
-��R��������U�ʿ�|�FG������M�#VU��[�&5S�yW�
�٢>����1�L
Dh�����~��.�c�ÒF�{l]ĕ3�W�Gu �����TN�4J%BH"�T�
"����꬛N���v;�G���������v�p[���T�N���X��&i���w
hLe��~�F$�ՕM
�;�X�<'f��Ȁ�3�:�l�L��#Q�
-
+ʣ

W����|R��o�C�S%b�$�����6A201�
R2^�1�=��2�Jrn5���m���,����w��0'q_)>5���X��,n����||�׮ &�^c��9�bh˨�Q�U��� �JRz�T���4ɭf��&�>��L�]�;`RQ(�� �Z��̹^�g�ʨ���O۶�{	rf�GNb���5��G��b�P9��	����/|��FNdi&��
��
=5=�r�>�Ʌt&����"�o���j5���Xx��m�u��5`��LmQP*��BJS?�
U��^�%��e6��Z��֒�z~⁒�P��NT����
�م�K�]?y2a9�7�u���AӷPKM&*
�
-���ݼ��Ne��v�dU�
���AX�Q�u��I���`�έ����t��?&bP`��-NBZ���"�&(E	Qa�(閅i���6%κVeK���Zތ��
F�Y��'��Yo��%�0V�N�:�x���$x�[5d�/�B�o-�ӗ-��n�a�o�K�ʴ �1�k��P�
9(�wĞ90�!~�!T(�zi$�Q�f'��U�$���C�_0��CL�~���I0I>�9��M+
y
-'`N˓��S�hmg�L
�y��U�;��"�擈
��a ���|Kp�<2Y�ݕ�ca����M���0BN&P{��]"�J=Џtjc	�lK�Nk�6�w␅��>�^6
t(tR�-y	�Jݑ�I
a
�s���^��9�� s[^�M
�]��6W`��yL���2�m
-��l��o��OyG=rO
QT�����uͯ3��C�G��^rqB�N�ĩ;��D�~�6���̥	�?t�o�#{fB�|#�|I+�
�S�|:� ��1�F����:���L���(3�ktb~ J2��!��T<s

�w��YH�WD�]��֯�8/1s��T�r+t1�
&yD�'�h�
�`�н4P��?r�
Kˍ��s����}R�ߨ��]'��맾�PCUS3�\@����hkd��~"���h[�t�hp���O�U��O���>F�
��]u���
IU
��sd�q�({O���,�Q~��`N�U�
W�r�U=G
hsqt���"��膥��'�������q�َ:V��﷝:�D��;���QT��x���f�Sm�m��f��[�
�B
Lct�c��%��{3�a��)վ��S��p\_�	_��ȿ@P�ѷ�a^�!I���S�y��n �[l ���ͥh��SN*�W�s��> [...]
�8��hV9�
�!
����t�+�;Z�E��T���40���YX��> 4��h��)nS�{��p7̯�>��[{�|���_��}Av�F9�	���x���̆�l�t�B?{��v�0Y_V��MXP,�`�-K�-F����i��G�������V�� :�z����b���&@vT[���["4�
�F�:�Iį�wx
���K��ɟ ]��%=�R
���
��`�$�c%U�b�x.oBѨ�vi��0
��)�&S�"O�9.�����y�k
����ܣ���x��aK.�o�SO�y�gD
4��mV�#�7�pZ,y��$��w+�
�q\f�%���cB�7��W��I��L ��|k��ם���J&����&�`�I֮w׹�(��
Z�����_Z&���c��<�ܑ���HP
-endstream
-endobj
-3363 0 obj <<
-/Type /FontDescriptor
-/FontName /EBURFX+CMR9
-/Flags 4
-/FontBBox [-39 -250 1036 750]
-/Ascent 694
-/CapHeight 683
-/Descent -194
-/ItalicAngle 0
-/StemV 74
-/XHeight 431
-/CharSet (/a/d/equal/h/l/m/o/parenleft/parenright/r/s/v/zero)
-/FontFile 3362 0 R
->> endobj
-3364 0 obj <<
-/Length1 1540
-/Length2 6820
-/Length3 0
-/Length 7853      
-/Filter /FlateDecode
->>
-stream
-xڍxT�[�.R�HH#-
�%�%�0
00� 34H�Hw
-J�tw+
�� ݍ�J�G��;��ݻֽk֚������y��Fm=nYk�X	Cr����5�L�� ||�<||x,,�$�7��bvF@�0���!�
"Q��rԀ� O]� ~A ��8��8@��O�oG��8@�
-�h� ��a`
�<���bk�D����� ��<�
�u;C@@@��;�*��P�

#=���]��t��uss�:"x�ζO8
� H;�.vv[~Qh
���� �� ��
zp��
@P
C�B\`�`g �:@OU
��������#�������'ݟ�_� ���@���y@`� 
�RR�A�#�0�_�@(���!P����ց %Y
 ��?��D�  �_
y�A
�"�Z
���!x��� q�P������0����
fm󋆵��
���������ق� !>1aa!~ � ����U@��	���Fq��r�;lP4�>0��
t��.`��m��
-��`
!V`[
��(l���g�;��%?~ ߯���Q
-��à
���n1������2���1����^�b n1a> ??�0 at DD���<�9����F���?��_Ua6p��_$P��7�?�`�36
�WЄ��
��#�g|B| �������i�W�����{GJ.P�o;�_��
��z��@����

8jB`��j�k�5������"����٢t�������_8�q[kC� ����w3P5�X����wPQ||�eC�
�u� P-�m�&��ua ��� ���
x(�VB /~ԬZ��K
���#Q! G�
��Wc�@�3���/�o
U�
���`(
��
��
�]�(�sA���
���LP ⟤� ^'T)�5�.A�D��o�0�uA���_$A.�Ψ��jD����ߗ���N�AA�UA-��4n���XK�m�1&�aBH��o��ԱӔ'^�=�.{0��=S2>�M�yp9���3�1I%��ػ*wĝ���i�-��Nm;*�
�Jr�CG��
ӌ-�h�*X�Kp��ƻ�6Ħ��.��N̘D�|-�ն��ʄ�y9`�8���,�E_�`��$�B�%��ǪYT���/2�z�Orպ˅�BȨ�{>e���"��xZ�@c�:�/J�a��s
a]�x.��s2��9�_Х�VS����ˡ:�j�дTV��	��Z��w^�
q�v�*���Xʭ��R���ݘ� ���[�IxAᅉ:�\]$��@A�����_���
�'JAE����ֆ�;
��]I&ȨYȴU14�]>����Rb�;�j��2�zg>�#��1nM��ى�W:�Dbȩ(��T�
o��Ί�������nnS�0��c�6$��'��������k"
,�7ILH�pPD�~�Tx�T@�T�������;
-:{�ĕ��t��ߵ��r>���P�n3�{^����8R�s�%g2�$2��-wc�kIV��Y���Q�6�j��e��L��	����o��ZM��hS:���[�7�Uj�c
�Y
(��3�AKꢅ������[�p���l�ξ��]H<^�w�ت�<t�Y�BN@J�6,&�Z���*慉f�@�M�� 8V 0
�A����[�J��Q��1�j� ����tt�M�������i�'�#/@I����W^c-�
���ʃ����F/h4��L
/��4��DO
�k+
�_
�Z
-4�+k,��$z��S�OP�������B��
'�<�a��@����p����=�~��5a5ʠtK��W�]׎�=�R��q~٨W(�@��
��7�ŎD�j3�}�����P�s��q.�1
�Y��n�;����k}��bT�Y5Y�s��7]�K䤑Dj��qJ��
��b$�P��=�7^ޫ߾�� ו
-��m��4��&�q*F��]e+Ռs��c7�M�
����MY{q�]�	
	�R�
O
����=c*�^��F9���UW>q&3CG���pR��QV?�`Q�)�k+覬ꥶzqu��lY���GOvЅ`�������{zڪ�6^j#E��`��a��}�=���Q��Ɵ3�
�,Z92��*�!񤒋�lQO�����N=�c�a�3(А>�ޕ^�w�q%�L)5�͏�YU&��y�'dq$���^-j�����
l���!(��ܘ`!
�
R��#N��-��ͶW����™�Z�Wj�\��δϏ���,��
�����J�e����2� z��J��
�@��;jaW�
��(�oJd�
 q�
�G_�ኯ)7
�?�r���0�c�ڻ�Q?2�5�
�
`񙹞5r��ĜD��V�hd
-��YY��Hc�_����/�
̎U/S���1�HDo%^�X����
-��
-�I�����S�Wq�R�+G[���/���y���}}����>�dO&q��M�޹.G�`�Wk&�Nyh�
ڱ �oe�?/k��X[/5�[�l���mIO=�G�?�B�@�S숅co��\�,
�t����b� ���:N��14���-�yզI[�}k�3�b�
$Q�*q
N�
-?�����3�ďt��K��[y*�K3�x���1nU&

�
����bިo�m���5J���V�5[i�z;
wc
�4^�^ �q�O�l;M��%��`p��uO�:��h���k��i�(��,ziD��Jާ&���Ӻ,��o�/��>σL<{������Yj
E^?疩��#5ĺ�a;��
;/B�~|Gd-��Ҙ
��=�$0���AӨ֤c_iFrKΧ:iۡz�{Iw�}nj�B`���]��z�1�-r�h�����W�Jg���,(�#��;>zΕ���e̻l���ZPԧ�Y�8���ϼe�t�ș`�+pZȬ�|Ͷ���&���~�
�vv�y-�,eLGd��f�Z����R�ra)T$@͆���s���Oe&/��ǃ!��|��݉�!�T��
�u���ݦAލ�
-w��
s}_�S�w���6���p*ۿ
Z�V�a�j�Av-���	m�
Q��1C��wG�h��k�sּ����m����
�B�_��s��FC�^�u0�����הtJC�II�=O7E�z���X��{觽��5t��H^�zQ0d+?@{{8�єvG��n�~���/o�eSloJ��8
�~�Xd����
�}����9��}N�#��K.+���c�n�t�����)���E�67
~�r��&9fҺ�����$����Tz�l
z�
��e._���C	�Ӗq,��-�	m�}�'n͟���y�e���^57
�/��28�-�x�#�2G�v+��
�_�}���t$�������a�
�\d�^�
B�K���q�E?����C��1�Ơ�~�q�A������nͯ���PR2a�ŷ$���IY���n��Ex}�.��Hg��3h��Ӫ��wԹ]�HU����<���{����
Tx��) �ɩ\����[�b�롳֤�Lv�
���X g9͞�����'�-i�Ë�t6�ïɻ��X�q�\t^��|��
cs�q��j�;��j]��ul����C�ts
�����{�S�-	$ݩ1��#K�OwO�- ��f�G��̅�.�����?��ђ
b}2
ڵ7��y���sq5�-u���=�%��ݍ��H;.���Y[��ģ�u��{T�S�۾D@�D�c�H��)��ä���Zb_�m^�B����|�IH݌�t
&Z70�
5U;����ڴ�����Px�LE�J����ю섯`���v�
���K�#1��&�{)�W�Ҁ��L/���DB�yJ���Տ3�R����d
KH�[_T�

1,u,�?�Ŏ�}3v��^���'���G�z���g�-wi�8�+0������+~Km��הg���̷�4Ay;�<>9�#���
)F۔�S@�i�R�:m)�0p��`�n�a���6���ξJ�$ 5��tk��:&g}y�Ę�c"�x at fJAht�4a(��u�)�Ɂr*����e��
0{'����'��
�Y���"np�U5�Ը$���ݸ5I���R���J��b-䴈��e�ɠ�<�b���-�4��.���~�z���vg��+DX�W'��҃�q!�j��/��hن^��2�m�-_3]��p�n�B����{�Rة��9�ҳ
-�~R���wZ�`t��^PZ��?a���z��qء�C��q�� �;
WY�"�Vp[i�4��JC�k��K1�| �����,�r*	3���
52��Ӂ������n99�Ȧ!�G9q�<�Q�����O���d'�N��x���pL��Br^��;��oh��_�)��bZ�Lɒĵ�v�t>a��:�Ey�zJHN�ga�;���AD�F)jv3�
�qR\�0�ӿ;AJ�LE:���H	8Rqd
�ڜ5��'.��^z<d_-�2�ULC\�آC���NJXro<�ٔ+�*�r~u��th�
���R�}���s��}��3�w�eA
����I�;S�Sh,�>*��ԩ�yY��o�S�~tvj���o��DBM�

-F�!���.V�%59q`�q�c�dX2���rTN�7�Hϫ���фW[
D�ϕ��|�B~i]P�N�Q���K�hi����z�ŝYV�c�*�R���6S��HHWI˄IX�L���=�
bMC��^#a�-�I�n��
	}��ہ��)��
�1
��o�MT���kW�U����u-L�Ө�aV*����0{bH-�t��1��x_{�EI�9���O.�|�<GYmFۮ��f�Y���N��<Α>���
�&��dRB����Q�ʊ��O�Z���0?����"
-���}V�G��)�`�
<��<��%ީ9q]�i?�U�7��И\��
��H�������}W��`┻�+w���p�
�ɢy��U%���߅x��#(�0�
����I�G�ܻ����s��@>�*�\����h{iAЊ쥑u�́��]��'^��yvv1���V�}70G;�U�$B?wQ��P�}<w:��^�ޅ�i�Z�ǂ^bR�k����7�����O�y㔘�
x*��lb��q-��L�Q1
L��K��#����O͗?3�]	k}��y���
�"9�5\,��*%ɫ/-븢��6@���.���\���ώ��Rv�]1��!b�M�d����m��y��E�xmF4+y� �
K�u}�ݞY�� 8
ͅ
率����=֚��s$�|Uv��k�F9�ה���s�����_F6C�!��@t�L�74�.>���>Y%3M}L�f�YԻ���h��L&2C�40�<gb�S�~����5��ꉋBHF|8��)��u����tA���
��W��K��P~+T�̸Q����
WUiS\�
�0��g�5�#��w4��Z�%�����C^nQ+��q9[`�]>Ey��AA�g�yQu���<�3� q��ԇ4��I�H6�Dkr1.E��#�5,�T�HQ�^�H��L�P�{}��Y͟���]�^���`�$��0����ζSS{�3E���F{쵉�VNʘ�;m��"2#Gzg���$�,t������s���t�5c0�/����f[ja�o��cH [...]
�˒�����3QQ{��x�n
�<"��
�z�y��rG at r�r8��
�xI�U\a6�QF�4�HK�
�F�j��62�v�+0d�u#���x����� �����꺀���$��z ��eOݙ 2���)Ǿ8$�ۛ��f�� f/�����z�]6z�	)y5�
\Hā|�&�!�/�J�3�G��#�g�r��~�J�����Z����}��{���c��
-���q��Fb�<}�V_q1 U��হ�Y
���3_j	-i��u[��+�E0�-
-��
2Y���}q#�Wi���.��$u3`�̓؟���_����~���t ��).ūa�PU�R>I�Z
�׭"��>v�€�'��:?�����rOc(�S�p����+5,��e%x����d8ĻN�9&Q/��O�K��r}�}�4��a =�I9ـ���R	V�G���}J��Z'������~��5S|�[+��N��h��W6a��Ua�*y�v5z-l��P�tv[7s�|���.�
ߗ���J߷�-�d]Kq�W��]'�i����y�X�oX�1�7������;f�
�qS̘`��y�)�dk]ٽ���2^1Rw=�����=�[��!��{�h����_
-�*� ��#I9+�"(#�{t��]���O��8��9��.k;��7�R|/�\����
��yM����b�}���Tn�z���
-��ĺ�]5D��vq�tzq���l�bWZ�����ҙ>Cӭ��=%+ST=��)~��9���\蠁_/�%�f�x#���
G�]l����sl�:��_.�v3=�u�KQ�	]r��V 
-LOبq�W6|K��i�SE}vT�%Ͷ�=�PQ{b�R�/���d�!S�|�y?'"h�j��Bq��*�P`�DJ�N�q���)����;�	j�Y��'��>�g"j�1jz�u�m<�1����&
Pé=(�Ą�jiaff�,zoGjW�4��Aj��凣�G�B��%��D�
髡��es ��F��F~��I�p��,������I֣b��Q���Ϸ�����i��_�]�3tͲg����2���>6�2t���M<ws��%E3.�[�⟫��T\F4��{zC��K1�s���h��'|�Y�(i[�����o���<Y�0�zW@�&("޺�Zi�
�cf*I��}DfG�T�G���Y&F��}�!᮵*���
ز��U\�]'��
�h-!��aKD��{�Z���1	2����*��E���M���X�a
H�R>�TXzk��MI�פ���Y���2D2�|EV�y(��\mUB��V6!�K�W:|gZ���z�m��l��x�:y�|��v�ޖy! [...]

8Y�*�Yp^�1��~��ç#O��m����$E����j�K�]���:ң/vAЅcޢ�2N�`=���֒�3\�ڢN+=�����w�q�5h����]^$�|��`��
Z��>������
O;1'�:�����۷�=�mUs��P�7,�S�����^�k����4��X=;�E�y?��)U���0k��;CK��­��]���
-a!���QJ�b�SC���ٶ ����~�
��.�@�YR�`s��"����`���(�,�Ͻ�}�yq��91
����SvhJ�n��ߧ��E�'�,�<��Awr��!��̔�K��<ge �8":���
���JD�@�T�ꁍ�_FR:�
i��ۥ�<歗I@]���z��'1��Ϭ�a��?>wfXJ�VیP��'�#���_
iPe+�4|�
�
-������o���Wב]� -�%��
i-�O�V�<.ъ�V�3.|���=󈁤��/{�e+T�m���J��\��,��
c�A���M8��d"y�	�%]����Re���u���.��*�M�沇A Q�rG��p.0�yV<���S��h�0�-��+�0;i�6�J����w
���.Y�ՙ+]n�c�M�I��]U��e�*��]Jn
-endstream
-endobj
-3365 0 obj <<
-/Type /FontDescriptor
-/FontName /HQMTAG+CMSY10
-/Flags 4
-/FontBBox [-29 -960 1116 775]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 40
-/XHeight 431
-/CharSet (/asteriskmath/element/lessequal/minus/negationslash/periodcentered/plusminus)
-/FontFile 3364 0 R
->> endobj
-3366 0 obj <<
-/Length1 1504
-/Length2 7108
-/Length3 0
-/Length 8129      
-/Filter /FlateDecode
->>
-stream
-xڍvP�k�-ґ&z	:(ҥw�����PB�Uz�"*U��D:
-R�. 
D������w���L�>k�g��;��62W��
�hN

) ��Mo� @ ) $I��o������)�-�,�R�_j8G�ԡ8��>��� K�2
-`Y 	����( ԡ�@��F����jh<��#��� �$
 ��ˊ��"��Ї�\�HBE'�;�턀���J!���y(HH��� �H,�qQ� p� 8��� �
�H�f at J~��+�7E;�|�8� �#��(,!�
�c �� S
=��
��Y�� �@����+�;��Fz at Qx��p�
5��8_� ���r��cфx�7�u$8��9��j
��E�Ax�@,��E�_i]�@���H$
��R���:w"�
/�g�n(�����3s�E��!a�Bxz�u��r!@��`.p
 ������=p_'W�_���
��F�/�� ���p&��"��J,��a�������%
�!�p G�
E�Ov
w�s&
��؀�@�>�y�#�
�F���q�=_	���jf���v�&��/.
���#�UR
 +'�w������o����n�ꠜ� �?�����_��kc���`�&H�G�� ȉ���������e�)��/������,�����H�;�/���p���Gv�߮��?���!���m��A	ۡ�r!(\
,
I��XM�/
f��9����ߣ �pG��Fh,��
�����tNn��
-�0��&8a��]W儆�Z>I�
 ��@� ��$!�?���0��oy$�(4� p
8�1���*��b	�X7�\�`I0@uq!��L�o
����`B(ꂁz��� C	
���
A 	,a}������CX�߂#��������('��N��V?l<�Re�_
 ��o�L���	|��w�#���� +�җf��Y��x ���Ѡ�m[���T�<
�F�כ[�=?v�\��`�.�e�"�2|d�I�`Cj#�d9~*�.�\�����l-�
�<9��Ne�Ū�6#����7��mKwc��e�c���8wx�1����M\F��tw���4��BݎJ��0F6&�[ܹ}�]l̏�o��	܄
�=KI�a+F�	̐ �G�

|qo�@H@	��>UDąD�v����ʍJ����O��RVW�r�g�";&3B��N�}��
m��,j��m(҇Yo#X4+y���ʃ<�S���;�Ͽ��A�
$�&NPX��{�}�d~^���md�t��]��,���'=ɜ�|����^���V�_�z���1�
�=��F���%��|r+� �O���>��v�D�Ҫxz�x�bɮz̠���Y�,y�uk��[]�t���'X���+V
-tCMO!��:�J7_58�	�h���ԧ77�p5J��+R�\����௕ld�p~!��Ŗ��u�f��E�zQ�?%�/��K��A>��-w#>�$��O�Q��W����v3��y��rʺ�~7�6
�w��j��7�-��>o�:�t%�*�3��Q�uCx_Nl�_�b��`����b����ȸ���!��R\5n�be�-K���k;d�����R���t���G&�y}�$�Js��~A�U"����iq��h�8dσ��y>x�'{ܣ�/x��Ruαݵ��q!#\����)a2AWcV�
���<ZMF[�J�$}�m�aV�Z������L~�o���d\L�Q<u
,���8�o�
-
=�{Qn�q!
-�ޝ�rb2/�
�JҦ_`� �f~#"��hc��(t�����$�ß�{������m���!!mL;{���@&�U�B�;ѻM\R2��.2�m+w�
?l�d�z�!mE��}�s�
�����{�©�yW�&�#�ɏ��$R%�`�+�J1)=��ͤ��Këj�zN�Ca^�KUYQ�Me�!Ukaܐ�Dۛ�"�a��i�c��v~j����.������(�:O�[d5ls����
d.�~ϧ��գ�t����Y
�榪��ݼ\�����.��>��R�/�VeAs֑�É
{
w�;��!�C��㥶ho{��j$v~I��l~��1����R���b,�0��Hj�k5[��
c��pǫ
<���^'������A����%�N�#���",g�6I�Ͳ�
�F\�O�e#����w0`l��	

_�
����|�򑜣��
�{SQ2���l��X`,�p�3#�	�x��4���
Nʦ�TvЉ���c�9~x�
z=�;�{��yM�Ɖ����P6E�G������`ַ��S5��R2�������ǜ�P�A� d[E*A}!
�=�ZLSz��2�k�'n��
U���-�	'�~�4M&���q�g��$�M��
:��6Jɢ�+��yB����<�����
-�����р�Iz>>�G�	��R]��!0�
E
-�o
_)��R��g��7��S���
T�أl��ޟ3�]��/oJN:�
-������J+����@���" 8zTW

z��6�s!�
G��t�\�*8Ye�9.XZ�M�*��I�e�8>ٟ�����%3�9�|<VH�Nsx�^r���c����\{ϩ�(�3⃺�ٗ&l٣Whk8�����@��f�ʎ�
-}4��.<A/u���I"�ba?\�a���-�Ҏ����g�A4���(�w��T�y���I'C��#�����}K �K
��w�Ʌ����em�Q��7�]�*�����`R[i9���^{=@f��F����:֍
_�5i��A�^quߝ��֌1�"�v�������
^��T�(	��c�O4K�p�*{
�x����Z��6$�%
-�-3j�^��\�k1Dt�b?\���y`�6���#A�}���Ǯ���-����d�u���ȊWϹ��Yy�E�7��t���
n�TT�Hb�x�:�e�޻�Y�!��8Բ6�3 at w�����&E�)��Y��b� o`�y� �N�u�c�
��X�<���+a��N���5�Jw;)8��I�g�z�_�2��
-�
�P������
w�~�Zsb5Ur5;b�6�r[#/�NZMI;M;���P	8���5���bgn�\�]�<&g����/��(q�����f��Z#i+s��D��(�W�ȕi'\�h)���BC"l��={�=�5Ý���k�'ys��i�/��{���*�3khԖ��̻�kE�fwy�
�j�
�Kb=��)b���������u
~�O{h�^���X%�]
�� �XV{�]�[bH�i�O/�ē�;�*�}�놏܏�]ޅԲiM~������w��9�՝��9
-����`������Ԑ��5�Qσɔ�)�^DD�,?��d���T��x[��R��4�k�C�zh���y^K��, Y�gi �P�6�MN�]��
-�B f��R�U"�I�w$ַ� �N)[�^��=x%��ڙ���(�]u

s��pޠ�s`J1��+,��ُ�F�Uz�B�^���*�
=� �>7n}�4���l=�Ѡy7\�5�n�1nu��+����W���z�u��*u���ēF�<

,+�C��"̄�=�W��/�j��l?�M��8`�o+�
�"{�W�R]Ͳ,��"�Z�����-���`�G��^w���m�O%Q�+��oD��t�J*����'	�/�1���M�|�a��
���!�^&�􈳸k��P��N���UBK��yi2�����B�:
�>�k�Ir�J�O�S6_�{�W]}�D��=���xU�,�����f�
tF��u��3[}n�1�ܥX��z�k2m�P
9�ڝ��p���4R �����"��ޣ�qS�2�
-�����U��a��Pu �Sb�Ƃ��"Ӫ����9���3 Q��d�a
��C�9q��g���N���[B������pXpV?���l]W��mϓ�@��7�=��'
��C\ǹi���ڸY�;�Z���U�=9��.j
rf ݰ���GXc]��(��֐��
iJ����'��[�n	VԚ�J>��!9v���e
�Z�j_J+��
Sm����DQ
�������ę6�E(�O�����E�-��Km�e�I��Dc���ɉ���3�l��[�/εt
-��t�)
-��P]N�>���[��1{�+.䔏
�?�ou�U��Vv��Y��>�>#cd
-y%���hҬ�9j<��y����C�|�R>5��tS8���@F������&�뤻v���]ON4#S�߭Ͻp{G��v�	T�S����`��j|��`
����y�ɍQ&�d��2T�Q�ⵥ'�{�e�w�Nl ��_��m�Ku���Ƭ0D�>-;*p���t�q����e�ݭ1���^�܀�q
#�
���rK���!�o���x
-�e����N���+���F�r��[W��Jz����5󍤞��O���ʀ��=i���(�6�au��R�����&ކ�\GF��h-yٷ��l(����~�;R�
�-�Vg���Py��H
�Z��j�G)�S�(vtF�\�i
���|q﷧�<�Z��j���ޞR��4k�l�o'%�̡��
��Z�٨]޷�C�ᙰ���"��e%��"���۹�����p��4�s��
�9rܭ$C�|��
-1��8��I���%���|MY|s�[��EX��K�S�q�)X�.�C3w�����%ΐ" ���7|��,�����1_��	 :[�
ROh[�u�z
-ↆ�t*��4��y

��
-/�=�Jl�[I@��rz�M�9
��G;��+�}���~�t
9+��g�Šo��օ�5��ګ6
 w˨���8�ږO��'�Ѫ<ⴾ��b%��ޫ=o�2Ke��Y��1�=^dpY�!�<�?�m�>�m�]�G�vۇf탲���4�䡗��n\�?0�Zp6 m8MQ�OW�/�Թ��jd�_��Bz/�K���s�?B*���
�P��?L�E�+
-/>��ƆA�cY��hD��

-
�
-�$�uZ[�
��,lOYy��.
�
���}v_R%W���������~�ʰ����/�?]L��yu˗�X����#�<�6����<y�*{���B=N�hٶ���
���%��ahɌ�}nB9�/}��ؤ;���)p���Ͳ
�f���ZD��q�@
�x�t�1�c�1C��L� .��]��|<���
d���|Ȫ�Z�R��yj%>�AV��9�&e/����%��;�ݹ��y�4��sO��a�d��V��u2��$
����R|2
�k[T�M����I���&
-O�`��GĜ^���
�f�3�W{<)Z?G�X
�$�+m�W4F?�d�b��5-`٢�i�Y��X�h�2�1$=w�ìȵo�e�m�\_�wYyl�D��^�"M��ۖ>︕�-
���H��O���aHև4�!7dp�;�9�
-_�p#���m��O`T�q�#�[c�
�K�o�
�
m_}S�DN,�ᝎ>��~���)�v��;��$R�3��9u��*@W����k�*��YٴضT��9�.H೉~���P�1i7kf+BV��'��G��AxF�Tr.�C )XtM"q2�	��4⭁���7Ђ�$!�s5�UEf��r��Su��f{S����z@��
�b<!@��v��
-��:g�f5.!y����8�yä�q�.�9�nf� k�3��aE02;�iT`v|�-p/
x��^V�J��������$(�]%�L�����s���o��?1
��\az��>���P$
��_b�P���ܾn��?dx J6j�f�
-������C�
wW����
-9�j�
䠭�S
�=z��(Ph�)�=
�枋�ѭ�����Y��g�^��s��M���B�p�Y��nk�ǽ��7���2����Ҁ�۫[v���U/�p��Z&7�^�n�
�ݲD��o�-TS
�o�@��=$��[�	��j�R �%���U A��p�Y�}

�V�Wm̫~W�drմ���&�$�$��K�B]���l_P�o��k��鏔(bbH�S��L���v���}ae�.a#~]�%�g�d����b3��%k,)�nm�Ei�'�
P�*[0�w+��}����"�t���i�Oő��y��8n�g��R�?w�]V��bB�Y
;dž�E�O6�F�}�}�=�NJ~�
�j6��jn��J��nn�~�1����0�@�(2�W=^:�A���%�&��+K� ��J�>Ed��H����6f��S��u���tN/_
����W��92�������b���U��z�5�r��V%>��u�K�CM_��V�
�ֿ^��j}��ɥ��l}�/=�8Z4{{�3�������d�V�b�V���7�
-��m�4j�6;{w��|�S+���%�(6� ��i�M���5��͋̍��%[���e�Z���<��
�sKy&f�l���RD���$�fa�}m'9����0Xns��#>��⬞�G�zL�ͽ9�BI5���l�<'�ʅ���#�O�t�!N5�~I�<�a�	+Zq�0�vwԸ%��{��Ňs�R<�;�}�ݥ��D�[Ϭ�~��`giع��V���"<���"�����L�8p�9�-ڥ����6��v<�j
c�\�[�u�ݧ�`=�$#W����Q*n��m�kU��
؅�=|���:6ȱ���$���%��
-ʥ\g����n|�S?!v�$��5�ƻ�!�hYV0s��6I�垑!���#�Ē�*5
-
{'E�]6�D�*�4�U��U3�5/��i�3�7܆�!C`�U�E)0��g�:�wۅ2���	2�mL��ܹ ��G����J�5��3�}��Aj
{x�To.�
g
��-�d���F��#-����C������/0��%H39�OW��ukה9�^F���n��#�>o�
�/��tK�
�uo�Vm�gn2��(�q��-��j�)|���߃�p��
��on)��^f��Z�~�әk���S`�奫1���nB���ﴽ*^�
}q3>�l�0e�q
o�(S���
����y�Ѡ�
�4w��{
���Q��8K�l�
�;�
�-R
�2��T�� �j���,t�#R�5$}��Ht�/��v�$B�E�َ�}���@
hn�so�r��)j��c�="Y�h't� �v�5�3F�H"�ޠbɏc��
t���sŃ�N�~a���S ��I������d'EQ���CeI�a�r�d���-��G���>���V���Э��/�-م4�.���1/��uu�jU��w��
��-�<�
���%���o5\�YKBh��f^�*g�jB��%��@ZU�����55sj�
 �
-��|�XF��ߕ�+�����n�:���B*"���
��8������B�����c��U��&l̒�B?�^���o�¶	�N>�~p���4�$�
1����}��Σf�����4��*��&���e��z���h�!�a)��X��8��,�:�
�:o_`�n�t^��`�467T�����p4R�5�b��-:F�=������LUλ0)����
��6��
e!��5�xn��)��rA�s�<G�2D��b�cm��Y�9�r��wJ��4�OS��Ri=

��
+���j��ZH��-��³wh	�H���]T
ؘ��ƺS�VUYD+(�^��y�UWG���P��/���hԨxw�D�?Q��E�5��
-{ź3��AX���� ���=RMоI��ɪ��g�x	3�1�ѴB��}!���F� ��N�.�V�D��,@��h\F�A��vXȳ�� �Ig� ]H!έ}��B���6*�=���΃���\$��‡����#����{�{\P
��`����q�|��H���
-���k�R�I�<�`�
�c��]�E�c8�5b~PO��D��)��C邎/���%ė�]X{=���_������6���[S
��Qt1&��9���Ĕ<���V����܍Y��F�m�
�*+>�*�+Wꭘ����(Z7�Ԯ�c@�?r㏌�����Tg�
nt��
���r����!Ŗ�N
vH���M3jk�R�3��Y\�b/\YJg]An]��
�� ���fU
�o39�W]��'�$�Y���^ǂ��:�]�Z� 7z�f}����[#J�������oy�Qe}M����ժ�v�l�
|�y�*u8� ��Rhh0}=� �B�>
-endstream
-endobj
-3367 0 obj <<
-/Type /FontDescriptor
-/FontName /VYEUCT+CMSY6
-/Flags 4
-/FontBBox [-4 -948 1329 786]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 52
-/XHeight 431
-/CharSet (/asteriskmath/dagger/daggerdbl/paragraph/prime/section)
-/FontFile 3366 0 R
->> endobj
-3368 0 obj <<
-/Length1 1411
-/Length2 5990
-/Length3 0
-/Length 6951      
-/Filter /FlateDecode
->>
-stream
-xڍtT�k�.�(����0�HHw#]�0�30
ݍ��t��JH	"���)�!�
-��{���9k��f�w������_6-]
ik�TG�x�� ��F" >>^>>~"66=��LĦE��p��� ���QhL�B��#� 7G H  �������
��@����0k�:/@����"���0[;��߯ ' ������ i'(��`�
�	]v�" 0(��_)8��P(g1 ��Ã��ʋ@�Jr>x�Pv 
�+���"
� ;A�0�%b���\���	�G
-wEG����H �8 at WY
��
��qV����Wo  ^����+
�;
� ���p/�`s�4�xQ��� 0���#������a�`+��
-�� 0��_�\!H�3ʕ����"�Wt���ֲ''(
�J��~r0$�n���d
���_���	k7g�S8��
�,��
"���� B|���EP �b��^��������8#�6hP?�
�G��
-v�PH7����6��D�a�
-j
���

Cm����G�<&|h� |�~�y3C��w�����|���jz2���&#���� <��@ ?�!"���w��4�o�Q-0�����Qn� <��ݼ�y��%
��V���
-��� ��o�'�A?@��
�;����_Y�_���
)�9:�6s���f����/���P�PG���߮�?�����9��UF��4�-q
� /��
� �Zk�P�?B�{��08T
�
-���AG����
�u�W�=��&(z��]W
AX��>~!a �{�E�/$������[�  /
�B� �
� 6$ѯ���N0���/�7��	C���Z7$���%������k�zB!D3S��P����o�

<_��V���uE
-�ا_�ة�g(���XZ��H���&|lʗ���۰�i[V�b�R.
-C�kM�'�����l���
I}�F~���t����A��ԏ0�v��򍂟ͮ�ƏvN���d,)
�X��]�h#�T��)Y
�$�MO���O�hX܅Lc
ݥךI\z��BoVwW���+Վw�e�tT�*,9�=t�	Y*u��2B_e�$�ߣ+t
-g_�v��12��u��9���a���H��*#5
�c����,?���^�I
�jD�%k����"�2ȶWqB�F��3Ś/K���Á�`#��(ݞ�;��
�����.GJ�44���7���$`�fw�˅�ƌgu�ԪH|���1��N7Le�SPܑ��xl�1��x���4%�	 �ϸk�������Ɋ�ŕ��I�@��n�լsΒ�U��(yK at 6��9b^p�f{��%I�b��2߼�9p�t�D����Z�?�����Q2R�wc_ƪY'��g���@y�*b]�NޚG�8�
�X|�'
��c���k�s�&邟���]�ǘ�(�%����x��\�&ĴJ�����6����\,E.�UM���c�5
�f*�����
-�����b��|/
-ʄ�K�@V罰l׮y�H�]]�K���
-���8��e��5���ۜJ}���]��
iR��폧	������zU�"�,�����7R��O�KFd�gNMY�dE?
-��|��]b�!{ŕ!��d&?�Y]��i�~e�p�,,}�+���ի�z��o�V�@� "iԱP��u���b*�x
����s�����3VA�F-�|�#}�-�HϢ�
4Em2v������vn�Z����
d�)������2��dp�'�r&��j �JU��͜M?���|���'��Ā#Iۼ���PO?��ʞ������ɦy�q��=��k�;�����̩��`rV����b�X
-�T���&����Dš�o8�b�^��@�u����v�3��l��O��T���f�X#�.kU�(���A����81C'�� �㖋���ى*T2�
?���I�'wLg 	�5��OMI.Z
z�&R' ��5��v\zW5ǴW�ޛ��
�K�O�V�����TLͤ:�� ���L�gy�
K3t�U!EG隂
��=�O?:����%B�
-�|���'��#��*\T@
SX\
ڙ�nt7��g�X-N��
�\%v�?��Q}6{k.�̘X�	�^~}�A�>}7�K|y!�e��
���k0)��m�,e���oKF��
-h�&�IM�ުz/׏�

��~���(�
���Ygh#�]V

�;�L5�
���ɪDg����ZyM��/�D~��6���q�-������6H*_V��Ƽ�
\�Ϣ��Y�����ܯ���
�������sa۝-�{,S�����o3'�;�s
ĩ4�
�z��
��헮
}d,YΩ
�
�
Oկ�QI���0$�i�qG�I�ʧ&mU:˜
.�T�w�a��tO�b+Rz��_������V(TZ�|q8L�|�Ÿ�=��0
�
qTv?�� sv߶�U�e�Q�’�
8�'gr��{
|���_����KQ�Ǖ� �b�;������lv��ꃆ�e�,�	JgB��2�o����C����:�H��_�.)njIG�4(QrF�x=
[�ʸ3k��QZyC"c���7�[/�Ӷ�0&��h(�\sq
�!\�����W���`d�=���ɴ�lDP���\LS,��
�%��_�Rzꪟ)X3��qGN7�z����7����Gf�N�{�����>��0�
�{+�g=�PAĕ�����"Ñ2���P!��\�SxF�iuE���a� �J��>[���ݭ��R��'K���~~��\�in1$�zY��
�Y`Wޮͪ_�e��8�h�{i�8�=��F�
�LbJ1D���n	ԩy��}�0̿�n��\�A*n�D�
���
�O��c
-X�w��G���hQ���7�!-�7�Q	�Eq�r�2��
�������B�rgj߬i�24D�p���z��
-^K� ?-.r�bn)J]�!F�':�g�ɓ&�}�&�x�U�>��¾�;�.%,Y�F4w��j�:䇺N&��C�7
-�p,&�,�F_=�v�:�,�bo�֙�
q�=�$��\$�>�ɟ�$��'��r���!lK�k.�r��|ihY�ӝe��XU���b�f}�ȼ���
�Y�
-�4�
e�5$]7���w���kU�2嗸
�UZ��
�0J_��l�Ά
"\B���]�y6�J�����[�dzo�5�\.$��
j�~�B�����X�n��/�����g�Ɠ)�k����.w�~-��U�+�q�����M��6��
m��S�1��"��iy�AW�=�K�\�Xʵ�z/o��y�$�
�[��zP�!S��çq�x}�w��e�Ӭ���W�
:��_`�F8�{Gڲ�J��Reu�V	��w�qi�zÿ^8�������C/E�h�����Bd�������%N��Uk��LC� u�1I�_o��Ҕ���/4�C�Y�Oz�("wk������~�F|��@�nĞ�.���
-���ڢW1J�K`K<��bǯ�Y�Q}d�c�~}�s���z���FX�� ��ί+�&��x�C����.w�D��
	�<H
-�׾3�wn����`6&�5�v����?��\J\��Z3eÕ๒�O�$�Y\�/�,pt����a�h��F�MX�5�$c�F M�u�@��Ãc����J;
Z/ʶh��]^P��H�	��|�P,�q�r�Ȳ�^5��Jh*r6��"���&�������1��N
���$ʕ1��Iٴ�R���mb�-5[�e�!͟�;��Ս�t������~�Rk��E�W�4��2�֘����^m�N/L���*�&��o+eA-��������'۸`ªo`
>���F�ފ4�������I�U�M�Im��ϸP���s�"՜�d$�	�f� �	]�͝DC����ϗ���%�k`��ǽ�&�X�њ�M*	�V´z�@����������$B�����;�F�ލ�b�ڵ���W%�ܣ\x��#�����T���}y��	�9���O�*屪BM�B��<�k�p�]��Ϗ^�7�1fY��<���3�e9NE�j� ����8�(
�\Q�
'�kM�K�ҋ�s���!�/�����
\�-��m�D8p+i�
�V,�4*��:�
S�9�,w)��]X<zD/��;���Ќ+sze^�����8h�d�
�_ �:���gs T�
Y���u��q�1��S����G]
��%S�E挦��A�)�=��^
-s{;����G�i��"C��]G;�$z=��պvsj���~��'(����4�-Lp��'�O�u��䡑`���G����#ͥ���ŭ��Q�>g�\ǔ;�4)��ϟ���-��Z���(D�f]GT��
�'!�S�p�9�#�P^:�kN�
��-{�;k�{��e�dJd�$ f���}M��IJ��9���lg,w�����7pƠA�k��6��ߍ�W7'�Q/�r{����c�(on��V$����/^}|f�F���
׷Kk��J�������H��F
�-mg����JX���k8�|��r��Q.��.wo���g��絤�g�1
��K��q��*�z�F�o��2�0�|uA��7�����do�_�U
�Q
��\��(��u�S�0��@��xS�Wm[6�!g��&f.(5͐���T F���r	1^2�
v�C8j�%��4<�HTls�ދ�E̜4��aw��I�n��ᕨFہ*��_P��t�>O~X
S�x}�y
y�Au2�`kP�F��(�|Mv���f�ig�&�i�
OϷ�W(�
H7�� l
)-m���/�?����F�_
-4�0Ozc��	��4��j[}�A���?��.n
�^w�|i�7��d��u9�
��F���\*��d
�{���$� ~:���'JA��\3�ykq_�$���n�v`�=Hҟ
-O�v�c�ٝ�A�BK葻+	3
+�XB~<�����ch��$o���~�Jšc�V.l!w���
��3-�Z]�U�?�=��Bp�
+2u,W�3ԋ�,D�t���#a���њ��#P`�7
o{�U���U�u�����#:�z+?5vɂ`\��� �s��� �
-p\�g�t�=}M%��:�{���(��1���p��]*9���⻤���o}��C;����Ce:}/�#>~��,|A�D�qV�.��2�Y�M��K'�o��>~Z8[-"-ئ����\���>��NkEJ'~��^$�
wCrBs
�KrKW��pI�׭!�i��8�U��+$~z��
V5õ
� �f�$�
ѻ!|Nf�<Q0lNZh�.
�8����U����->
{��y���ّ�&U��{OH=N8;E;��Y-�䁄�-
��J��[m>K����֛I���Ԗr�_�FR<���ԻjY]�O}����W�	
X4P�Uws�g�iAc��3�z�U�V��W�1�6��e���Jk�����J&T�G��"��H���<����oTh�'�Zڰ9����s�[�U<���,�<+��~��c�[:3r�NouV���k�h�^�b�W*(6�e7%��]'Gq��}�̏0�qX��?']ar,0�օ��"�����
�
|�f�(�f���5,G�e�7
� 3Tu��-kg�tƉ}�X	P,��҆�-M���s�v,�߬���
���
���)�^\]�}�Lx�����Y�u
W�A�
��N�AN/8�s����
�إ��]z�d���o;~͚�ŏ��g��~G�m��N�Q�If�9��6��QCx��@@��,�_���h�>���UR L��;�h U&Rf�3�xNܫ��a;"�B2��np�z����+Ю�Z�~��gݒ>��EN��ÂҎ����Y �TΒ~��	;jw����Sb3l�2vĝ#�A�&I<�cc
n�޷1�g��8MDK��'�ң��X�܋z2���:G�!��S��k2
��|6\
�Q�.D k����	��1
��x�p�R���Ot��D/R�b�`͝�uX!�
-�{\UyT�l�e
NX�&�CyfX"uJ�!��^�F�2`r
$!I~
�e*�����V�o]��#��<u�F|!�t�.��C��vW�u:r���l�^�/Byڈ�����l)��M'h�hh�
/��H�3Ǫ�2Ѽ�

j�k�a�]
���'�-Ǎ��G��HΓ�`D0��IMM�<��r�m�v:���^j5���YL��SZ��$:�ͬC���W�Z�p<��F�kG�{�
U��2�P�~D��Md%���6y�\c�s�
�9�g���|�]����'�B�S��}�D����'7+M��%
 b
�	�g��:X
���8��1�q(�cqf"%�+ at d�0�W���
o�QY����հR��w������&��*?����,�.��f���e逭��"��_5K��̻� ����g;�^��M̶j����&�W �}^�Pڦ��[IG5�BF-
��/���n�g��/n�/�{w�(W�H�)��T3-����j��0ĥ�e���.g�%W���y������aѮ�VE��T��	�PH^
.l�w��
i۝;��I*b�6)n�
�{���kn�f�u-.)dZ6��R������>0P\;7��������p��»=�ǽ^����Vo����+Ai�On<-Z
�ob����Z�f�^��,��9|�	��
ȳۉ]��f6�>ܢ4�� 91C���5^>�ZSbvw�0�ۦ�
��ݣXt`;�?��S�`�=���B1�F�;(g��*f
({
G�
 	��y�H�ȀhgJ��
+��O�,}���d�.���n���<hO�`J�pj�=�?<u������^X5�[�\�V��4��z��M��ǁ���䝜�b�QdQRl:/<cU��J�`#Q���h0u�
-����,�ɢ5U��{,^�i0����5�z�'}�iV��ګ����r�h����P�~*n���t�&��XՆ*7\V�$����z
-endstream
-endobj
-3369 0 obj <<
-/Type /FontDescriptor
-/FontName /ZQLTBN+CMSY7
-/Flags 4
-/FontBBox [-15 -951 1251 782]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 49
-/XHeight 431
-/CharSet (/minus/prime)
-/FontFile 3368 0 R
->> endobj
-3370 0 obj <<
-/Length1 1463
-/Length2 6796
-/Length3 0
-/Length 7790      
-/Filter /FlateDecode
->>
-stream
-xڍuX�m�>
N�	at��n�AR�6ƈ
�� �HIH�"
"%-
"��� !�H�ߌ�}��������
�v_篮���
������F!�"� 1�����
PLL$&&��@`�a` �
�A��
-�������8L�����@}ow��$P\FA\VAL
(!&&�w"
-� �� �@#P��a <(O4�ō��� ����
-�*�y��	4c]`
���;�
A����h����z*�������

-
W�"�. at 3���A�?	o�=`��� <@
�7n�r����0 pG@`H
��	�����@s=C��'
�;��w�0��� �A��j���g#�W1Ayx���$
�p���
AX?�0���L�cP�z��v�%��9��f
-�������X
�p�IQ�g�)k!�(��ܟ&
���_��ͺ!Q���?
g�����S�����i�I�A�cp(-&/##%�ya~џ�-�=a���?a
��@O�'�G�p��~ ��
�E{�3��@\
E@�@'
���;�9�^�.��ډ�'���דN^P������WTS��L�J�7����Q~�@I1����4P\\N(++
�g�
����&`ğ͉���
����wx���#
�?� �s�-N�0 ���o/&-�}���
������]�7�������������0����''eo,�F(�9���j
�me#����Q=,g5$
'qq)���o
��F���&,�巐��
-�
wf�� ~�qpUbb�ù�{�`p�+Ù�s����$�e�`4�ÉL��@q�M�0�_����(,���
tF�?�U\B
(
-��8ڸ�L�o
����$P����`O���ŀ��+r�	�co4��_2�m����W
�� �M� ���u���5j,�"�GH?�ǥ���Jcyg�����Lz�߅V^�2�}=1
�"�}<�gߙ�!S�1O�wY}G�`�d�c����c�Yq���RMoP޵#��{`=}
%�%�V�Z|юY���z K�82Y�����7	l8�?bm쩒h�v�-�,�.IGꭉL'��vIك

���z�$w

��e*�i���9�����S��0x��҇�2R8��zD�~ �v���o~��3������ݤ�A��b�>;�/
v��[0��F#޺[ I;]�����H�Y�.�4 eT�Ժ�$�lŚ�үAIFQ���~�ٯ��լM
�U�
-)Wx>P9�����}��W{@BYC�p��6�"�������-x&��]�k�0�5�[Э}���ԙV1�J�^
����n�)�?秸����9v��$"�`i$�y�}�8C��3wM�!f��Ҋδ��6�'�G�J��}\s�&5}���
m]�T����ӶA�0C�2���}+ap7���R�H��/�ݳW#��7�y����)Q4�

}x�H9r�|�j���^Bx��e(qw��K���=�_�$�6�>A]j�aq��0�Sd�n���4;�������x�p��^%�mQ�J�����t��i
�.�a�?�`���\�
�
"E������R'�;Y�O&�ڤyf罃|Z�ܵw�'��ʣ��&�&�L�M�����*����.܃�Q9=Qe��
W����g_h��.���M�M�㽔��;v�Lm
�����>��6�-Kv��p$��0�x�@,�KZq���b�K���e2;t����G�t\@i���(s����tF�Cٱh�Y�7u�6zөX���wDaJg^Y;�����h?z�ԅ������뿄)�Z���P
�d�IM
-�������%�

�N��fQ�2�y������?05	�d��C���_SL�dr�~�t��G���b�X�
I�����IӢ��Cg��'R
�?���Y	*d����x���ތ;�
I!u0�.���L%A{vL�&
{k-V:�}�4���k�|�¾#��]�B1DvJ׮_�qp�n`�
L�O��? �W at S��Gٚ��H�ri�oa<�8D7�
<�R�eX�o^�����ɠ����s��m�Zt�s(��38����;+���J��m�>r̞�'�+-k(N����nh��`2Ag
-��ĖH���m2�c�C�
4[�6
�m�n>�o���JCy
-Ҩ��
8M�(=h��#�%P�an�t8�!���4dʹ�_ɿ��1q��6�8`�\��HQj%��q���7ϳr/uM 
%�l��
=���#�!Է�Nz�5����f�4�n�����b���pL�l[o�x����#�g�����xHw\q�C��6�;�1�v쟿X�ZPW�܈u���U����pyY0��gr�g���cv3|�+��6�s?�*���Q��
WD�
M�I��J�0������3O�
8m{�C��Lo�����si��^�/�j>y6#�[����.�Y\��8��G`-1����Bm�)�=Y�����L�
�#���"#M	�	ֳ�bf�T�K���Q��DjN�e�"���^N^K������{c�m8ض<DMgo9���u�$l���Rt��a{u��K�
�人>�͘�uD��~H��Si��k2�?fR75g���J�f'jm�?���
�����dP�}gv
�j�+��\�r�	�lNA�8��̈
�K߮2x��|��9�s=
K�G���+��
n���ɮ�˫6;ľ����%]�z,���ۮpEw�G
��8A�� �
��-��o'����~�����
d�}�
-�&�-�y}�&�A�P�}��"��Ҹ��Qu
�2��%qmnZ/���J���n�
-W
-�1WX�ۥ�@Å�
:g%[���
�t"X�n4ߡ)�uWy�._��Ǐ���
z�|ӢXW����A�hؖ9�̺��_�/K}�{\��*K��������W/�9Y�Z8��MXI�|�D�u�g�_
-�w�
gɌ
�_&R�1a�p/f���d��c�apQ��7���
s�	�����O�<nw�]�g���}۟�ĉ
V�i�5������%K���+���a�
��	Fi0�E���o�J��xH��{�7B�{�����^��A��E=X+���i�j-F��"�
�?k�L;{��
���n�i���-a蒲��0���
�b*{��(Ke�'sh
|�V��:Ft�δip{�
U��5_T2	�}H�mMBn��4ܬ�#C�p_���"^y��ce at hőKfQٵ�
�e�J���,!����8�+o^L��â���2��Ӫl�N?ʿ��J�d��$�ɯ��h~�za��\^u9	�JΧ��Њrsg�:�P>��F�6�f�P������㪇��4
�����q���i��y�|����;�p'�u�A��Xc/~h
L,Hyska�TO�(,CL���16���ׄ���tk� ��C�걻?�*+�� �
gYT��2&ԛ�G荸�
-䘳�Yw�:^�
ý�5���cU���*ZOA2+�.�I
$*
Q\v|�t˝N������U�=gõ���٨���O����S|�imGwDf�
^y^bqZ��2��?��ĊJx����)��
Oo�hN9�5:�,Z�u���/qY0��~w(X���qrh�E)yFe�
<�@x�4��8]'�� [x29BP�΀�Ǘ黻�
'FY1�kMEr����̢����:.3��)����I4�D���*�C/F#u;�r���$Z�����*��a4@�٪5����Fn��o����c]�W�xx��H۹�Ų�G�X��e�'Ɖ�	%6
-3�BK���b���@�1}00+�s�n\� 7�х@x�\V��KÁd��سRq��i'u�\��.�
(��u/����B�{�`}�!�a`
5e��g���e
,bo~p|�<���EJ�}y�M��V��1bI��_ZHn-O���1VƧ|G
�i�yz<S�yw��҇
,f~Q&n�ۚ
-������F���M%S�R�
p�>�
-ֱ�ς/#_�>6��,jYl)}�9SV���G�s�WM�������(��f�����	����z�S�˪6���ό7�&M
�,�����3X�{��
-�Ca��d��4�'
��N�x����>����m�i:��_���y��
,��
�g&T������LHg5�N�5��X�����@��؍F����'�*��3�dfk+J������8}���.,�� �?�h=.[H�I�
7�4W벜O��ߧ�Ԝ����ai�n��e�
���ٕE�I�qf� �� DSDS�Y����)pk�,]��ޯ�%�I��W���_�v��RpF�[
-�*NP&��\��DG[�۝�dK�Ѳ�a�B�^�ب߸�8���k�O��B����P1��
�
-�����(�c�[FHV�"�(���c
������̈́Q`�j�Mѽ�Ϛמ�

�%��p�қ�]p'�U�%\��rs���g��H-�}i�G��GQݥ���x;�MmEȾ��7݂�������)�\�-��(:7K.�1m:}[��q*7�1�|��.�o}�_�����4kZ
d�gB�?�l
����w������Aq�Jƕ�������d����WA��{��'\D��uxGNE3��0C�B�
Z>3��}�=M-��]n��=$���ˬi�g{j

-
-s
-��\��
-P���
Sn�</HK�

������{������/J�(��;f��Cw-s���31�.�1��`�x,s�FG����ȋC{���c���̵d�l�H|twM���|5�{�Di���a���G�v��7"*��|
s��z�:�5�O��Q��`6Q�y���<�VZG��)��(�L�J��
�`b���{^�ԞV/.,Y� 4�W��_�k��_�m1GU�GK����
�g�
�&$���5
-���pZ<K�׏1bݸ��S��I{�A�F�e�&�W�@���6E~TN�g�� �
�֜��u�k—�S�^�������~��dVE��C��j���9g��kϘ�W�';NQ���V�����T�^4<��]5""�\�	������ ��c�k�#�
�2�1=l�%�� ��s8JN�j�/ņ�nH���Ӏ2'�t�
W�.�%|#�������[���#�o	�m�6���=񫆣�0��o^5]��(��O
&:�2��a��"{�Z�敏�1��'�
�����V������,E�
&�����X��/�r���p�g�Vn�z����C&H��;
���#��FR��{�=t���
�$q�Ӆ"Y�lS��F]��^w
s�G_��.�I�1�v�/
��B��x��hg����9�d����$�������f*٧��A�
e 	�Up|����dpebh+�n�OR�^@pR51͛��GV#���kx'����� !��<����@J�B.4k#���L%�����݇�rn%i�_
�=���
~=*E�j 1��q�z<��M��^�u'�X�d�pq�
-�q�QVv,�
-��EvK�4|�?�2�� ���_QKv��P��C�N?,x}�X�C\��9� L�n�&?���ڮ��)��+����
�4�� �
����j�I�7����
��y_[c#�> "fr�����K
-�Wc��D
N���fL1[M!����c�y_�&F�wW��+��5��T�l+^/l���}�
i�`ً��F��^iO�/V8�@�����g��
�ݙo���n��
+s?�ۣ���W��-?|{��/����D��f�p����i��&�
���_��k���l'.l���Ƴ�|
�a|0�;���oo���Y��a���w��4�'z���2de����
��n��nr��������RxLDŽE�����g��K�L?>����P�
s����y;�a�l�0��]!������\�
6��ʹ�c�r��5�wb�l�"��0J�s���?x�Ŋ�o�
��V�������[�zT�*��}��b�.ɢk���������v�:Yu���Eϰ�[�BW�?�PJE0}I��687
/�q��pG��,~�7�<�d����Z�^c)	^�UՈ�m���چ�Wg}��&�K��V�]
TvKZ���)�B�r�lN�ܟ�Zr]���)D_�{`���>��%�
N鯑��
�/��׬{H1&��i��N
��Eo����i��p��	��*E��ϘI�"��*�
��J/�4���y�Vp���akup{��x#�S�v
� ���,�`��'�x��2�ևo^F����
��h�Y�L����*��0X�I4�_��B�	֣�k�����r��U�+�!YI��T��������m1��/��\
�+���I%���aX���k���k�^�3
-)Ӈ���
�
�3H�&����A�q�����l��}H��&��;���6~����Ʊ�y��a'����
�g��j̔��wRȔ�vDr�����5d�:4~~��S-�����#�X����V<z���jk�o�h�:��L�$#^��/�
j�8.\�%�U����<���&�H7��/�&hW�ҵ����]����5b�u��
-r���
'�9�(�(n��_��R��x}U��ጽ'��Pe���ni�dؼJ���D�N-͸�Dj��u�hE;����&U�
�@|sf��X�	;� _I
����Б��
�������B�
_Ǯ�Z�}�E��b��x5+}�����x�d��%�YC�iP�
E ^�N����`���h�>�=z�^�mKV�y�[0s�%�J�Q��8�� `my���r��
�� 
G��B
Y��6C�_��vʩcDONX-x��.u�
o�_��
��4�	�m�7�J����S�!
��D!C��1_o�j�
-�B�1�`Pu
���fw3�`�lV��v����I-�Ur�⑲����_68��Ig��>a��IN+ܶ���y�����늘|��d�$`�}@0z��Pm���|:bz{�wә|�&|$LQ;�R�zmu��^D��e�
��PυwuCц�h�[+�m%ƫ}��Bߓ��U�7
�w� ��3�@�E��A��ث��|7��4��V-<7Nk>S'��J0���QGa�r9�>z,V�uޓz�T��,[��_�I6`9�H
r��&B��<NPXHP
tW9��
��N��㱢
E�s���r�\.|x=�f
���
�=t�e��F�w��C�3�Βx4Hv
��[P)�����)���/d����孤��2mT��f��Δ+��T��`����k��j��F�E���'�	5���|�7���cjac��!x,�;�8e��Z�?
�Φ_�*�h�����K��d\�cxN}P�Δ&��ԛ��9a#�no��V����W�I�3��o\k/����k�
��nmgOm��%2_X���Ũ@tE�>EJ�%2�xI�#��!4�n�|��J���c"�$�5�ы	ڬ�p�{�
K�~�\�c���{�
��W�jRS���9H�����ܷ�9�s}�x�g�%Z�#��B�#�u��.�
Z����)Ց��)�
-�ݘ� �k%�b��
���%���_I?��0h!OV���[���U�݂��6��w)��)��NM؉�i9~?Ts�$�kg�>�?{��a�槮9��|]�TU��x��rE-̐:H@���i7�û)�V�ճ)��W��Y�8��R�
-�z��6�j�[}�8䫓6|��ܨO���7�8A�@���E
��
��t�i[�o�0�2�okE��)���5u�ɽ#���Imަyz��!�v�5*:
-@
���/C3 at L�#&M[��Q��HZ/���"B��hkw�<���7�a$}p��� SZ�
-endstream
-endobj
-3371 0 obj <<
-/Type /FontDescriptor
-/FontName /DFVRAV+CMSY8
-/Flags 4
-/FontBBox [-30 -955 1185 779]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 46
-/XHeight 431
-/CharSet (/dagger/daggerdbl/paragraph/section)
-/FontFile 3370 0 R
->> endobj
-3372 0 obj <<
-/Length1 1439
-/Length2 6459
-/Length3 0
-/Length 7435      
-/Filter /FlateDecode
->>
-stream
-xڍtT��6
C�D����tw
-�tJ3����mtR�)��%�HI�t��(-����g��������;;g�s�y=�u?<��F���=T
���

� Uu�̥�BB�BB" 

c�xL�h

���_�h(���@X���r��E��2’2BB@!!�
�h��� ��(���Dy�a�NX\���������Ғw~��]�h� ꀰNPW\E04B�aP���R��9a�(AAOOO�+F �vT�u�	�:
�(�
-�$
��B3 � ��`�߸��	BC�8 C\�;EqŁF��@=��Y���
��
-
�'ݟ蟉`�_� 0�!�aG�
�k
`��w� �#�A��A
 
d�s��9��l �����a(,F ���(�3
��" �HWW(���O
���q��-�{�.�'������8�$qG	� `n�PM�?.8���Ņ�%$ą�P7 �
�$�3��7
-��(��1��E!Q@
	�?����b@
P ����߆� ��@
��C
a�?�q0���7|4�
h)�Ӟ0P���?��q� p���WP�B뾮�_��Ǧ�����H��ť���b@III�������&�
���4'�OFM�(��������G|V���t�8-C�|�H�JH\����^�_!�7�������7����2����f�+
���'ew,n-t���@�����*�@!0w���jbA��PF8�$�/,& $��a�a^P�>

v�-��G���!��H
�狃��/n��.�W�3+(n��]�.����>q	 �y�p"�
-�����o�� �Ņ q
��H4��Xqy�p��
�i����08�(��
7��Q	� 
-�q�!�1���vG�q9~�����_O��> ��!�u!-�5�,��_�Hf��"��{�ű7's|��I�j����A*R�?���}�c���x��������{�X��=�*;��}'��
��$��dj�"�v���%�%o�ه�P�Nѕ�傋6̊���X�3��D9�m� ʜ�{
�onE
C��Ls7�4� ���
��D3�x/ZƤ����ٛ�Tѽ��]��atL�|�8�z���i5b�n��W-M���T�vs��Nr�l"�ͫ�^Q�G]� 
-�������
	�R#G#a�D=�FRY�Gh�
}��F�:�e��\�U�
��j)�,��gw�;];�ɭ;�O�?vD
�9��^��
Wzʴ8
Ὀ���%��UL>얹��)�]�0!�M���c���3��k���c6T���v�Ә}|���T� 7Ht��k�)�ǎX���O�𞰡����졡��j�
YR2)�^��CoP�z�kZ��__^��K�;gz�K�=d
j
Ư�٫И-����I�cȐ(8�6�%���7�w夬bv�}�W���V�����Ƀ�����
-mT]��
\K�]����7��g�
/�f�,���0K���{�}�L�STj�
Vj��*��I���W
��=V���mAK9�/Na��([����\��F��i�%v%x7ӣ��=��
��v�g��{����f%3n���DM����r]K'
���wR�/��l�}ewU�]ͅ�a�fu�s��k1}
-.m�~׷j&�[~l8��a�u�����
R�^+�\Ye
Fd\��<_��\�'��D�-�Y�߳���P����#�%�Ȁ�Z/ep�q��N1tb����
��k��`�������J_��G�_�y�����!t�|c0�;(פ�jo��mq.8��<�xW�q?���;
Z��
Bד��P�k;�!�Wyw��v�%�mO$��P�	c�x�c�{]6�E��7'A1_s536�bU_��Ŵ
-�k�8l*���
#��_(j]V.��W*�j4�����(('N
d�B�5<Z�;��t�u�����᜝�	�&�&�Q��Ll�i�UJ�*�I�7�Ǔ���o�9أ�u.���F�S$���k��.5��F�혔1e�$j
tE3�}����{z
��^:�fap���f�k���TLŜ)�:(*ӤVbG�(^�IK��NB���ϱ�T�yI`�LJ��:~��؏_�5�������s�Ƨm�26Y10�٩4��95�����",��
������͔q���s�.�-Zܺi�" �^
/��v���G0���HW{�?^E0�(����S��.��Q5sH���u�ާ�>D��G����c�/֬'c��.Lw�ExA��`��f$���I^�ש�n˵�9Q��IV;G/9�
-�́����_�*�
$�͢��
M�nG�ma\��疪|�z%����zk@;�\�<{Or�z|��G��6X�a
ws۲��&Kv�_8�Jm0�Y��{�H��3\k~�l
���~�I���W�a>s
$��=fU�7;�ىL�r�Xb7yv  ���oX2����nk}�d�`v���p��)��D{�Ɯ��IG-�3��2W���󪭟Čdpp�����#��շ[
�P��p��,j�7#?��B��,=T�
ׁ��cm�
�T��h���t�#%��M�Q�8M�h�%���
��KC�V�>�g��!P��}=��y�+�t��ȁJ���O*�T ��m�˼W2���~�R]-yМ����[
��Q
�I�(_k�<�(����H�(a�>��
�H_���
̴��}�nnM��3jW�AgR���.E�Ԃ֚`R����i�j�c�׉�eZ�
6.��1{u��𩽧O
>ud歗�
-ʠ����
no����%u
ro�MT0��L\K6���.5�6}��-���K�-~������r��`���hgڶ�=r�T5��bXP}b 
�0{��!�X��*׵����}�؝MMG{Rtd�՜ґ
-׳���F|�p�^/�,�(���a�[�ܳN�	!�|aA��J��L�t�z廮�'

^��$��Uf5�xQ�J^�/���Mj׻�Quj�/��@-;Zҹ�iD��(����5�ڠK$cZݮ�����V�1��,]���KյL��

��'��5�31y�
?�t�i62`�
FyO�EJ��G���[g�%�c����=�a��͑��ǁe�|aX�B˱�!o�2B'�H2�b�g�\>��c����x�G:�LsRM�]�K�3�ڃv���l���:
E�}��dlݓjV�#�N�ݛ&jv�92�/�oս}�6<d�%��ҳ
�@��UW��Ӿ�Jx�uz��$�.6R.-a���a�?js]��� �т|��8�%(S���9���''���@��9&P��[b���#'}fQL�
M��OP՚[���P��i�����oc9'��H��i�Om�=% v�=H�]re��k�v�����mA��
W�KɉZQ���U7�B����'S���ۦ�X�\&��3/�--?�����@M��-y���Y�wc恳��xF�d�>5�2�>e�4"q�)
n��P��0��#z�&j��߀���«��'�3ǦF���H���c)yP[\Td��S'���e
��db��Ű1
O��j�=�X�Nx��`�%;��~���P|�5�V�Fo����'f\f���o[Ps9��	�����ߊ��� dW)���_�B;:,)=�
v�W���=�3�=�C�%��v���|�Tj��0_�0}.�(������la�I�>��ǭ�<
-|l���Zy�������K 
��
-�
4��_�r[���R�1T�jzrh-nd�L�ғ�c��ѹ��
-�Fsױ�;W��Y�Q�3��EB�����U���Z0@�-�9�L�H�����9
-O�[�(m*��du�Y��oX
j�/{]KeA��?�J��$ 2-�v��>�OA�<
�f��!�dhQ�.[�2o����
p���+N9ע-���^�ob��o+n�5��i)�-��L��QkĨ�P�$v�p�jp�)xPȭ��ڿy~îO{�_�	�3��>mA�=Ú��v�!Q\\�
G��.�F�&�o�W��
{w���R���mF��5��Gc��E�!�W�K�u
2�nE�wt��V�"bj�Hw'��do�
-f�>L�v���B3't��R�����m�cH�!U��ӝ�2��ؗ�b�T]I:C�M�S�tƍ��@0"�
�o����j�2��q��nG��8L�$Mn�FXc�M[�~�mF�p3�}?�o�g�9�^���y�p�>����s�*5���D��#������Q�j��ً9wFq�[�h��nY��w�C��>Ӎ���]�V�1E3z���a�A-2���|dp8Fy����R��k�����,���`,��]B���I� >�'tV��K	^W����A�d|��-N5���*��Ȝj�쁺��}�R!��ln6��A�
����,k5᥋�
�\�2�gO梣�W���"VUKo<��R~�l38J��nZLϹ���
���w�
s�—�X�բ��[�O���<�^-P.�n|���*�P�k>/{U�lJq��
-�{�x��,U�
-�$�� �ɫ���'�&Ƿ����f��<�+z?�ܯ��F�k�
-�\Cw�X�izF��/�erUd�m�gT���A>	��?6��T��0rl�]	�D.H��hɍa����`��lf�c�O�dG���
A�Ols>��
;$)w��)
O?�J��L��f��.��4P�E, ��O�X��
�d�R`�KMZ�fH�D�]��/+h�������Нn��f�ᦍ���L�Y~�s�NٍՉ���w���Ť�H�ړ�*#�FvX������j��
ؐc璘��:��o�q�<�����Z����:�,�_樂��u@�OڢH �\1=G���9I�+$�������[Y�$1W:ّ3��
- at M�(�� �ɱ���W#�~B����I^�����=���c��������f�f'���|���y-�!���4Z������|,�Ad��#�����'��/]|:DI��â?��*|WN���A�H>��z��z�2��@�5�sWì��yV�l��b���"�-�u��ūQZ�	�/ޣ�J�j�q$
n�}oh���=[ݞy�7]?���)#�X;>y��I���eB�mɓ���e"��rhkpg��#/��`:=Ì�{�1~��.���{E���ū��O��
�D�ex�p����s�� �Z]��՗ƻbonu#�`;[N�t��zҁޚ�*��t��f*��™_��x
Q6�hW0��!!�l���!7K�K�P�ƪ�|�#M̀J��G���
{�J��Qc��W��7Ɂ�N���6F|���W�D�.��Tp�Br��y��%�D�>jT!nW��<
����4��k�>�+�-)(�
�����ÿ?�}�̗ݔ|*�^%t9����y�L?|C5��%����u�@h�D�p=aZ
]�
Q��x�����1k�["��k����ə�� @����Na���qD�(��6��(=4���4%X
�K����v`cV�1�m�D�
c{͒ e�H�n�ct��MnL~5ɱ0�z���Iz�j��L�^�=�[�93@��,h\��i�'p�C��e�������b�rD/4
:\<)˔�AŖ3�Q/��$�d}�{�0XUy�����
�JM4��âPHH��w>m�4�ː2����
3d�K<"'r��6�T�������:�t�Ì
C�򺼀��"�c�J�A �@/5��~�^[m�)�*
<�k[5�m�O�
-��#d�X���""�Cw"[�	>�v�5I�匉i�M9���fE��
-�v���c��7`���v�C7��"�m,v|Jb���sD����
X�)˷x�˽�0��#�O����V��h�H��P����ZC���^Uۓ�2� �{��<=i�ZT���L��Fm��-���ª�t��#
�b��j�X��� B�P�
s?��
�����^��	,'F��K��|_�MTj{�V(I�3��'���Z��*����N�ڭ�캞��N��:V����+*
�K��\�3�'�z=�,j�["+E��
-��.B�55�4G�W��Ju}�|�0���Y�o%[>W
�(�~ �yQ�d��9vh�j�·#1,��h_r�t���':��%Lf���Q�7��,ɦ<��J��!�F%s���8���^�ް�+j
�]il�Y���b�8߶�
-�0�4Ι
(�
�

��ؒ�����&�b댡�8J���#(�t�מ���i�M�P�Ŕnk�f��]y���8�C ��{Lz�	�^IE�\^T�<����K�
�g�8^�?�e$w�NaH����-��o�
��Ȑ�8ɸ��v�Ω��'
�B��j܎�Z8
-��>�<j���`»�[����p)(�6O��3V.�k��$pe���}�:
��ݫ�}_>�Y�_��~/3���
��e�P]�Z�������i1W"��iO؛a1�V���e��G�����r�D^uJ3������KW֊��I:a=Ke�
��H!�^)�_&�� +�5��E Mz� ���[?����B��X����m^�Z5g�&#�VD1�Q�.�|�}�䢃�
�}]�\�J�gHm��u�I&Nת �-�OS���la�r΀,�N:�z���w���U���Qc������?�nf�u7��yQl��E�6ۼg�;S"L��)���~�q�����#9����9����X@��.�4�AZd�����7�_�o�x�'|i���3��*���S���NM�WMnn!6��%��������x�JD��2vr{����������Ƞre�8Vw
a�{��Ϝ�n�[XQ�W�w�+;��H[Q�GGi=�Sz�֬&wwJ�A�
��L(���*:�O�HpJ��im��Ab?6��7�V
��) 
=SzV�}�2��,�2.ep��E� ��i��{cn>>U5�?��x�$�Y�9IkHq7�ڂ�o���
ϙ�LcM�K�Ω]Z_��LT���X�}ŚlBTi��
���r{j
y�<�e�R4
�|�q��si/,�]J�s;ɪ>�~���b������Ba7ܔ��[s�RG_�&���]��d=�E�\
��%2�E9�d�Q�)9�,�y�����A[_��O>R#t�����GI�Wy��)4�W�(U��c�hv���(�49y˦�)��
]�

���۪m�����H��J���{�Jo7�ڞ ��O�l
��T�
Xf�-
ȟ�\�x>�":�Ե�r����Ͻ$|m{l��Vu]Lf

�M<u
-6���M ���|�P�WK�HR�|8E�Y��!�u|2���/��+�:�n���פ��+�g�J���6��!�Ҥ�E\
3=�X(�33�1T�|t ����n
�(ǚ�ӡnn
����I���P�uռ��b�-�u}f�X.��y᷐J[h>šΡadY�^�Q�Z�id�����B�I�9��.a�Ώ�#TY4��O�7�"�+�~��m���|��fC'��{��~r�nͷP�Z�|D����%���W!��W
&�ʪ�hi�`�n�
-endstream
-endobj
-3373 0 obj <<
-/Type /FontDescriptor
-/FontName /JZJKNN+CMSY9
-/Flags 4
-/FontBBox [-29 -958 1146 777]
-/Ascent 750
-/CapHeight 683
-/Descent -194
-/ItalicAngle -14
-/StemV 43
-/XHeight 431
-/CharSet (/element/lessequal/plusminus)
-/FontFile 3372 0 R
->> endobj
-3374 0 obj <<
-/Length1 1430
-/Length2 6367
-/Length3 0
-/Length 7333      
-/Filter /FlateDecode
->>
-stream
-xڍtT�[�.U 4�&��C�JG�H��B!�BB�ޤ"Mz�қ�D�R��KW�+��x����޵�]Y+��<3{�=�l.v]E;�-L
��
�e emCCi 
�E@\\��3��eC�#PH��PF� �O���QH�
��%d�%e�`@
���B� *�
�-�C!a� .e��7w����/p
�KKK��N]`h��!�
�D(�0 at A0���Jܒs�`\e��<==!.�(4�6?��8 �0w�f�"
�@\`1q����({�'
pg�t�e`�v04�;
0����������ܟ�_����(��
-Az#�p�
�
�i	b�0� i�
qvG��!
�3���9PS� 8��C�W���;��E�_ep����SF����wЯ�Thw��BM�	��D��1�H;�_$찮B�7,LC�����a q0,%*
�� ��A�WyCoW���o7����+��Ǒ��!�a���;�`�X������	
v(���H����0��l���/�
�Ӟ0 ����%N^v(�����+d��h�����bJJ(/�G@��D 	i)���E���7��^]�Ok����@ڣ ���o
Dq���� �>A�S2
���[���Pܗ�������T����K��ݐ���w������� ��� pB�bpK��­�ư�Yf����wT�-�"���5"��^0;]��[.W������^@@
��n۠N���
7��!n��}�*����u"� ��x��8q���>¸���y��5 $�Dap) ��`�B�~
T�3!�/�Sr���Y���ׅ����WP,�[��:������%���`P��)T6Ա6��i�"����;�q�5�
���V�w*�$����E�bR_���[G
-�.|>7Փ�7'赜��[�鏮��fF��.��X��Bv]�Pa�����(ȉ�	��
W�V�J7��Գ[ݫ��tv��Ԛ�z��&�y�@̃h���	�\��I�KR^�=/ꉣ�q���l���@~�1��>fK"O�M>�/7qog�d4c`!<�

��Q�|v�~ڧ�(zQ~:
�#�7����S��:*dP����/�
œ�tN��C~��
�,s���DuφF�tk��;�M?���kն
o����W찓k�̈́�}�̎��rX�*�U�;a��=����M��U��h|��/,R�
��CY� c�ev���﷟+�'��w�N'˶}k�;_��%��< ^�¬���<1>Fg
ۃ�Uh�*oŹ5�:(��j?��`y˃�q�����7R,ץ�)�
�� ��-�ʶ8z���ĤT��(o���f0�
'ɚ[;n5�
`N`/�(p�~<��Otܖ~2e�s at Jч}�U2n��=��)�K�2����{�*��+�m(�ɛͼ�����՘��
�*��|-
���Asڨ���.
�d~G~y6�i� �tt@��a��,?�W�)p8"�!�Iʵ�WN{3z��W?=���k�7�%��z�j��me��$�fw���4���`�W'��\ ���4R�|l�u�w��
-P��W��E�
�Ɣ	��xR���O��О�</�o�#pV'"p@�U��3�w%��Ѣ��询�<]DN�ڟ�*Egh
SE��Ǻ��Q-mGb����4T�yG�V�y>����LI1o��L	
-_v�Tt��m*��nyrb�N�j›MYO�Ի%��B/��˷�>���==�h���ùV7w��yu�`G;���-����	��(h��������%m����ʵ��gaԛ�Eo� ���t@�p�b��	�
��L�}k�%�"5����<�W���7�
[I"[�FF|�A�
�=����A�ƅ7$
֚�� �k�q����!��&={l����EQ�Ǽ��"��:�Q�վ�������Z.� [�^�G �g
�r�O��jt��,z-k�J���~fIo��q��M���h��J,`�����|��F<�I���ˑ�3]ao�U�w0���$�rQ�4Τ�zW�S����S�z�1s
������v��z�h�K��Ji���Lycע����t8�(<����~� ����c�X���]#
fw���?�dA!�*ˇ)+o��&���
���R�;����A����]u�
̸
e()���,�V�#ׅ}y�;B��[���I>D����^�\����r��^�
-��
ո���^p��\�,�Ŷ
�j$Y��_��ۆ��8�C��=`���
�n�][p�@jw�^Eu�
����Ӣ�>��l"�w���%:V�>�&��LѾ
��#�0 ��H�-L�Q>��;��g�
Y_kaۇHҖ�
�G���)�/
�n��|� ����s����;�w�_���'oH�ޯ�/�s1A�Gձ�
,&S��"?f�,M����(�y�0����-����:b��
-3fi��4r�;W)���H_�𑭊EG��J͟�:͙���}�˺�]"v�_�v'��d�R�R�\^�Hg��>�����?���N��x
>Z�Z�
S�&v� ��pɼKe�B�39���dDzF�i8X�T�Xz�p�"��
�?]�.s3(��^�rD�ݘT���G��y�j����#mSL)zGw6�\L2��9���{J
շK��5o
|��V�����î���r<��! ���^�l�H7���儁!�-���M�r�i��ϩ�R��

�z�Q���c8?�
o�$I��hg1M��ED�Ӄ�c���*��˔UP�k���0���5A�5X>�$� �xv9�+�����O�l����(]�e�
��H {����c������/t�gC��̵�Y|i
zGS�T��m+\�����H���d
-��(��!�W0��s_����=�jZAT^A��"U����U"����7|;=[i��
� 
-u
./��lI��R�y�%�H�C@������a�q��q�D��	�
�
q��=�j�/��cN�4��6zR�����R��\������S�����]�v�=#��K�weس��l���"}먲��c��Y���0��g��%�;�^��}U�@)&�`�᎟�S"���{JlK�&'��9l]+~w�#:�{w���yݽD%�_�cV���r��,�T�$��1��#L\�Mfo؃�o���0
-��9j>��-�74/?&� .5{��Σ*-�)Q����
 Ԭ]��S~��1lbn�`��w=��#x��peIef7��
��#�Ը�}�� ����Rv��Fy��Iph�#"����Tx�hiE�Ä��D��E����3L�/A۶Y�-_��� �xNNUU��yf/�U�n1�L��w�r!�*Kj�R�&xyS6?���i��A����tY�s��pS��^m�C'3��и�Lv%K���̷�ǟN�^�R���ko��	ռ����笄<�x�8S*���ܗN.�E�?��r5e �O�UV��}I	9�ы�^�V�Ww9
-���@\�
:T�i&/G����~�3V����R�}U= �@P\5��:�1�Ex{�*x�vx%��"��*�N�o����m�kO�����iEJ���-� ��v�o���".��/��L���6�Ck�<�lUC@:�'&G�ʟ�1���g���VFu_�F|�2�g{�
a6|hy$Ћ�/��d�ڗ�4��H�Vֆ4V�o�T�9a�Μܔ�K�
������hsjl�i0����H~��J�|l��BM)�)t�&�h#'����
8\�d���P at T��:j�}�ِyrr\��J��ʏ�jE�Eu廀��ͨFH�hȊHӱ�<*�61�h��	��i�%Q��,li�GZrZ���&-�Q�r�=� Z��Q�*��)�P��ڂ��Rb��.?h��|-eߒ�
x�+�26i���w���[`��#|���T]�cAǻb�~7r��Tg�S�-�
o^��}����0 +`�
�<(� KH�H���H>:9`�7g�ߐ��V�OtZf�2��Qߥ�g��Y�|�����«it���Z{Piڼ��fE�7�<W."�]��sK+'�����Xt��K`�#$66ى=�Q�2��������8^<z:�Q�	�.K3i�Bo�J��ʳ뭩#�۶F�����շK����
+
�/?;����d���y7�
�7����������ZBl7� IR�����0����ЧU��̐1u��0��Njtm.������R�3�x�J���Y��CnZG��7O��\�ɩ`�\�D״���8�}ْ�V%���<�Q�[F����
~��u��Bz�X������\,�}
�H�l�O�ǑSY��Ȫ�L$r�*�$�]Ja����a���
S�����[��l�&��-��e���]��A�
�r��,
�!,�min_�,H��i�^0�a�~�餻�a
w��"���

�����0�0���y�����'�/�d0�T���%>[��$Yt�Xe	���y��\����e]K�z'B��x [...]
-����as�/�9�J���n<�c��l�~�����tv
]3R������A}���0�A|�nI�A���Q�&���D�h��������Va�upx-�:���޳��$�1��S��]�W��C�
-��Ǫ?�&ݦ�{y���h�Y��SJ,71���ܭ!��v!�H��������3#ޔM�f
G�e]s��%���UE�f�/���Y"�]d�S?S��
�{1�ޢV4��СS?�k
=U+�y�59��
�
-�
>4�c�e�ԔiW�:��T�%��P1ۼ���4d� N�������S��EG5h���TҘ�g�Љ���d$���)�U��xwFv[
O�a�{�~�9�pN{>�	�t~�67
C[1�eQ�?����x���\��D���96IuRf�V��j�%��Q���3?��޷*
-Oو��d!�*;��
w��D��84�\$�F_�i�	��1

�(o/qB�gN�("��
q�u��j_�V�?n�
˖O:}k@ ���J��
���ʠL���-s�l�Z�?��9�ܛ�륕��YVn��p���q�.2�g��l���[�����a����+U��i���!i��$��=^j>��ϋ�v
����%.
���D,�6h�P�3���Q�w�i��,������ձi6�*�_���ܝL�:�X=h���I�Rva6"�<�F��9(�<��>Ø/1��a2�r�8��՚�{p����
��4��u�]��0�i���fF��\E$~7��f�=r���ljt�rVz$� =�ѽފ��1;7��A��*�������`�o�
5���
Ԇ�x����6ߒV�"ϱ a_I��d%��/7����+b8�ڗ%H�H4 �'c���zT��^d"2�u$�M���M��"��!2��%�M��g�Di�$�L��;�:���}x��� �:����`k�q�F�
�������3"�(��d���k�e
�:��k�	_6}
J$���N�)��O�<�I���L�#_�_����]iV"
�P��ѹ��3�ů����)
D�� [...]
-;�?��j1{{�N
Z�
�9[4U8Պ���0��
�D����鵄>7��)鎐��
-kT}K<����0��AD��tO(S��}/0>c�wn>
-��c��ښ��f
���[��;I<x�6VQDUp)B͙�\��;���ͺ�
��@��y^HͳhV���&�����֤�h����|�bJ��+�ҩ�K<�8�e���9�$[�V��9i���*��A��'��<��v!�B��L�
G�����SK]?e�=^n'�~��\�@��GcT^}!\͓�V&"�Z�p���S惰A#���
-�"m���l]��[#>��������|��
���/5ͷ��zטڶ�r��5��
�H$t�wӳ\i'S��\
�
��?os�&�p:qؔ@Qi���{ �2DsV���4��i��ٱ
�cU)���XS>9`U/�"}Yn��HN�Bfk���Ɯ���m5<8��L����	��9�'�����f�=N����0��ࣵn�7
��BL:3Һ4�_���N�/=ߴ^%�cV���� �Q�����$Y��v(���|q��+!�~ՠ����8
\'�ɘ
�I��
-!A7ME�!r�u�g��_+�>u�
��+���ܜBI��/�P[�\&U�?d3�kِr��Q�H��T�$���J��b��!��b�G_�ł^𬬊�c�4 �����Y��?�?uM�
o�X��U����a5�l�<.R�/�]�
]{p��Ms�"����/�K��UMB�N�y�W
-9�m�4\�{ٌ�˺��*\{�a)Z�T'>
h?�˓��1�������@A�O�I�,� �`�_��7b7e8���Е�_��a�4�)�ƹ_�kx�
�����F/��+S����{��|ޒ1���
-���ym�
���]�`\Cp�UӸG�
�Ve�e�1��������PB
��
�=W	RT4'4n����vQ��3͗"
�ݔ���jԩ
O>+X�-�N=
-F�ծS�H�2�W��
�5�~�'��Ȱz;����/�~5pV"*#rl� E�l�ϋ��%�#
6�"�.�Y�.&i�s1fc�hb�z�B�.�ym
����
u����d��g�Y~��^�)�!+ֻ��#h]�_�2�~"6���xԨ��(��Ǹ�(#ٔ�š�Z#����钄�ݹ��F��M�b
-:.�Ĭbt�,�r�t��К3��gm1���ц�D=���Q�?�&\U�r��s�g�S|.vlru�Y���Q�[Ϭ�T
��O,�������y�6RD(����!="'�˄�k2��������oB)sW�.S�^�
������a[O/
��dz3���\^����!g�FF�zSb�����&T�\�e�3p1ǢI
��VEH���M
'��np_
-��+S�y�
-E�����L٪e�fa��+^.�o$}Q���HT2Ҿ�� �-=v� 45�����\�uJ���|�mIǼ
!s����=)�!K
'�xdb��^{��((
-�̩ȬT~�k+$w����T�6��_f����?&�3�
-endstream
-endobj
-3375 0 obj <<
-/Type /FontDescriptor
-/FontName /YGAXLK+CMTT9
-/Flags 4
-/FontBBox [-6 -233 542 698]
-/Ascent 611
-/CapHeight 611
-/Descent -222
-/ItalicAngle 0
-/StemV 74
-/XHeight 431
-/CharSet (/e/m/one/two)
-/FontFile 3374 0 R
->> endobj
-3376 0 obj <<
-/Length1 1328
-/Length2 2269
-/Length3 0
-/Length 3132      
-/Filter /FlateDecode
->>
-stream
-xڍS	8�m��4YI#z��!�m��哌��y3cL�l��U~"[�/B"IZ,Q�$��$[�6!��?��������k���9�>�<�9�QVpt�2&ӽA<���B#P�����
�PX
-��)+�@l*��Sv�,�N��”	�<����� k@c��>z�>
-`P(�@:S0#Ad�X�i 
�lJgp��/���<�$5 ���Cs)
0 ��H�l
-��H"Rg:	���R�P�l�>

� �t����&
�) d�� �
,R��
-5Lp�@�e�3݇
Ld� �@�H ��
��� �U��lH[�.4��� h�g����Dm)�H"�D��>
�v[ �ȋ@"�E�������,=��� "��
-?�	1�,
�.rD.��ٜF6��46
��>3�	�x}�"W��O��B�| �g���@�A�
��l�3�~�|A6�Ca�z� 
��X��� ���E3�Cx(�� |x4�p����BY� `39`x��
��`h4@�Hl��h�_�yf�g�Λ?
-�@��P�����<���4*�|i�Hc���+�:ML�!@�hicx:�jc=�!��<?;���Ց���o�h>t`�2	^�~	ZQ���ڨ�W����
����¡H���^�������,�S��|�C�.�U���'@T�2œC�����kl�!N�?�Vl"o3�i�ԟ�Xx($;BleY<Kv���ǚ�Ht���`p: ��$ra(�B0�1��y[FC��	 4:�08�p��΄-�D
 �M��Ғ8L&og�&ǫ�㾴� �`}�餝�~�c�?]2�
�k�h�6}H�v5�
��)����4���^�[�/??�0�)�^�W��9���/�w�Z��{D3�c��I�-�¦���
K#�J��Fh��ݥ�I3pj�Q΄���k�s)�֨\}�hON\#�����1Ω)5)7�ꮵRb}���&U?�9��
7��X�ʔ}�J�a3�����x��ƫ�R
m0��?�=S
���js6�xXQ7~����KWT�w߹����}֢���
����]�*ڽk��
�K-��j���-R���+=���!ISz,¿�]坙]�M)L��_=�9ߨ!��H�	;�#��mp�u�_�PG�'��z�S��OY>�
QpA
�`��;\�AX��e_�n|�tM�Ѝ�}wZR��U�m��Ų����!����G7/A6}�O
������
�{���f�u�_�
lFG���
��!�_�!�']o��e^��͗L\�DD�o���
;��j�4p�<n��$���K�>b~�Γ�}����#˹�
jĔp]|��?Y&��d�<�
���q5����OUr�հ��
sw~��~�U��;~^M	�D�?���NV
�Ӳ^�Ye��"ȸ
/�� 0��
�[
:��
��*�4Yy.�B&y֠�+qQ�q�ӥ�/�ܨ% %�R�cR;v"Rc'	w
ƇJP�ڂ���;J��R̊���4˜
m�#H�{v�vj
�σ����p�z�\|�T0�ξ��Z=ao��&������ �K�i����
�WM�Gq���	��ጱ5�`��������f!�L�w{�8i϶�g����mbR���)z���z])���⛭q[������1��Gލ=T��ت
-�G�
>��x�	�n�V���<I�
��7�4���bT`@�T]�z��%BC3�f�T��]�я���x��v�՗�����F�MG��
Ͻ*��H�kъ�<�U�{�]8�ӲqOnS"a��	����=���\���ϖ�ͭ���SoDz
i�v����:�u'��7U{�_/��ç�=�9�J%,�!U���[S�.x0\V��x��zOQ�����ݲQ��7|�4*
%@���g%�\�H�����(����[�ӫ�&r)ɮ��W�k�w^�j Im9�(�^�(=Y����E 7�
%<\�[�3�v�Ԉq�։��5˿g�鈮x��-*�E9[ܛ����q���a�CeWԘ�CW�B����=�%�/;�'ی9jo�:Z=c���`

�UF<�J�T
-�����_Z'��2�zB-nk��h#�X␄L���3])��N�	br�*/%��w
���
���
Iٵ[-�Y�o��	��ko+q���4�HgR�&[�L@��d�������i���OԌ�[���'=
-<��m��C�A�-�Gk�U:���`լƛ�ًS�G��U�#2B�X�z�k���#tn[\��f���
qU��G�c�p���~�vX�����X�

g
ӗ����r�
mSYع~��X���7E߆"u�rX-�b[�kv�[
�$)bFe���r٧�4V�tF��$�� WZ������O-R|�mg�5,��N;j��1o�z�������'X�“
���ژ��O#��H�]�#�h�H�=I�%ML��z;��f����	ё�S����(���"B�@9�j��h$�S���Nf��)j�E�O*�y��c�=8�|lz���A�d�%f���[�:$k�fV�Zh+
�c5NT��:}��r���&�"�|E���H�ܙ��bd�����Ż~�Ӯ�$_��2�pO}X0gH�Z���
-7���Zxb�Yt?����8��W����_��N��9|X������
�+M�����I�����_2��H����L�[���K��y[x�xsWr �$evo?	�չ���_��#Gt������
'�+,�
��J��`�{�A�{���8C��]�ӄ�^�����ވ)�Nn�����.���ۥ �-

|lQ�g
��HA�d_��z�1�WT5a(_ȁ���wJ�Vސ^�ȗ�DJ���j������~��_�jO���������;&l��v�W
��0�(飜���l�lr"�X���
i�f�������-f�#�Kt������F�4�����EbW{tz��)8R�W4��#�ld�_� �n#=�4��т��ܺ�[y�ܫ������]wmv�nO��٣(��N�6$b�\C.b׿�{ے� c18���vQhe�m|���
s_������e�[��eE'�
��䟩�9�z�t�w�P��{1N��H��9p�`�
e�axE�����D�ٝ䮩�Wrb�"�F�|�?��k��
-endstream
-endobj
-3377 0 obj <<
-/Type /FontDescriptor
-/FontName /OAKMXN+MSBM10
-/Flags 4
-/FontBBox [-55 -420 2343 920]
-/Ascent 464
-/CapHeight 689
-/Descent 0
-/ItalicAngle 0
-/StemV 40
-/XHeight 463
-/CharSet (/Q)
-/FontFile 3376 0 R
->> endobj
-3378 0 obj <<
-/Length1 1612
-/Length2 15465
-/Length3 0
-/Length 16274     
-/Filter /FlateDecode
->>
-stream
-xڭzUPeے-�P�C�����ݡpظ�C���n��{��;�:����q�{?���#���9rd��3V�ؤ��i�m
�b�6N��t
\ 9skCgGY[Z%��3����T�h�dnk#b����"@# ����� lk��`nj��PUR����������?=v:��� ��<� �l�6N ����@��`bn�+hJʉ(��T�@���@����� cn�qRLl
 V�X �lm���*͑���#� �h42��
�f���E�:X�;:�y�;L

l�����`ncd�l��?vۿ	�9��������`���h�`n���UAD�<��
����h��
�5�ilk��WI�����:��8��nN�2��
�
����f�`�7
gGs�1�8 M

�����`�`�՝�	�/���Y��������`���2��cd�����OnSs8��E����������?}.@��D���P�!a`lkc�0�����:�I	���L��'�����+����?��5�/��z��
Z���J���� ����al2���+��+����������Ձ� ����t2��
A�?�0�1��h�(f�4V0w22�X����vUc����
�7@����o>3s#K��Z���������o���2⒊J��~��
��G{'w�?���Y[��\��!$d���si���lr02z�?��
��������������.�?~�Z��������_���d`c�g��������Ꮺ��?�s����n@#��E[#�@�Ԍ4����q��}=��Av%�*��~U�ݾ��ۜ?�ߪ��&�>Z�N��KQ��`Z�w'/��){�Q6��٩���uK�N�#=/�e� ����w��t�ߠ&ۙ
`.)��]���I
�|�R�b0:�@Pk
-NN��
�F�u_C��ƣΎ�%�6��I:�����pWo�����í�\Nw���=���R�`�'��`�?{~�6iڌ�o��S�r&�HQ���E�F�ɾ��	���=l,)+�vs��Ζ!$M&L�)/��~4�[�o��=�F��p�� B�����6"	#�3�(�lߞU�jWC�t?���2&��[�5f�C�
 G1�C�xm�Wwv,�<}�t��:��=
l�<�ˋ�ޏ]� ���0��K��
�
dzC8-5�25����ٷ��T�P( ]���g��$[Oq��%k[�z5�bk+���ʿ�BL�O�J�d%�%5T�ۑ�8�`���V�`̓�Ejt.>�q>/�}��.�/��ry0ƴ�M�3 v��W<��[$��7��������sqb��^�����$�
�'ǂ
-Dј�7�߹��^��=�w����d�qS�ox<
-3�ƃ�
-�BI~M�,p_���m#�1qܻ�d�J>EA
�}��e���f��*��`O�<�o
PfRۆ
��M�5
2���
�-E�8��(����
#r�NaoJ��H#-|O�XH$X��8�AW��$cl��B^w�;�
X�e��.|�
�cF�B><~�b.
$7 ���5�d��j�
�A�&s|�s�{�Zd0,'[9�t�G6�P�"�ov՛��ԄC�Y

��T�M�+"��A�`	Il�F?�ϼ".�Jf�GN��B�b�F+�
.�։�N�_\?@�� {�U,��^��8���T��ϧ;z:s$�f�F��赔�o~�-��S��
�r!�N�Z;�V�!�
n��*&��Z�55�8?t�Ynz�O�ﺼ~�Nc�o�o|O�\�H1D�E{�Q��������W��,�`�%E�Lቮ�X
-̴=|�����9�R�׳� �6)�-�m��6��v�_�����
�7
~���Ȯ݄�Ƒ�)B�3���k��O��5�fJ��
-|Im���rݶ�ýu����t2��w��YX9gD�e�SP����Q�|�G��/�;��K�����

�GTULt'p����x�_��)LM	�"���©�j!?�Eax���c���l�%��bj��x�GE�mq��
c
��$8O�XJ�V���ۭ	?K��$�-R�Q�Y�������ըkj�% �m6��p�,[��*�ԕ��Uԃ�8�C���WY���:�pm;�Zz�Ua�>!���
��T at P����@p���GՃT�<�
�KH�
�ml����3��T�y3
��%ӌ�� JR�
-��5լ�sk��� wὟ8c"ft:�1��Ʉȭ��ز�����1�RӬ��9��S�
dng�3�H�B��U!�a�|��+�Jzǧy����Y��
6u:�>k�DE�`0�]ai����]=�=���H�.������xa�z���n at 5,7��%��ݪe/��D\}m �L*u�/v�s����fl�*�t�	���< e������O�]#I�i���z�F0G��
�����|�
��;[]'��M�ӝ��-kl�f�@ĝx1��Q��K9��N����~�|�
�6
m�Z�i
�G ���d��p���̖���ɻ����soY����\P�
i�EJtL�g�U7 ����V�K%-�'��`�fr�շ�7>�RCN��Y��
���R��,&Ud�w�
�*�u�����H_�H"����@�Z�nK��kOj�r�8U�w�
>C\#Gʭ���rYr��wSV#*hZn��
�kP��jf���GҊ6z��Ģ��r����8,�������N�I7�截2RӍ�9��eb�&�%0O����J�	�K
-
e[{Z-a|�9Ub�
ټK�r��h�_��< �}%���-o 8Yr����_��S/����g&�g� ��*�*�E��.e�e�da����}w�=
��`'@�Pq�S��
��\�
5
!E
���`�����zogU-�Żֻ������x�>J������]V���)�s�*���\W
�n}�wQ�{擦��e����ߠrky��an�1r���bI����Sk.no\b�	N�⼥�I�K��>
-3����~0���Е8$
y.�f*��,��Zn� ظ�JOU���?o�HZ�ҙ\NuJH�7��Y��
-�n�!�iw�E4�,ӛL�;�}��y�p-v>�`xg��
�3,Gt�\�N�i�Q��tT�
�G�����j��8�&�i��M��I���h�a� �q84|^�rH��>9�Bg(�\���pO� �{�B㮣}���Q�γ
-���P8
��,GZY.�‚�,�uw��ί<+���������X�w�T-�._)
lJw#s"0m7l��Ig	�wdB�
���l܎����{�@
F��>*h�r���T!

��;��ebīm��Í#�����A;���P�L2�`v|��
-�;�^�
�]Q���=!|�Ƽ1{���
-�9��
~Ҝm�j�N���+���͘�FSc���QY$���Y�%M��j>v�V��HP�9�*m�e՞�=E���-A]�]�*�o!��k�O�*U+
Lt%qX�Ci�)Rk��0
װ�=�e��J1K�b�/
}����qn�V`�
���I��]�T�m���>��b\�M�{U��W�eTT�Z�(��dX����`��b_ۂx?�؝��7vo��y� ��YV��8`����6\�V ��*/
�V�37��������� �c�^�����8ʹ��$3W��s�
�����6��DĖ� �/�Q�tƍI���d��1��~�`��h	�\ٹF��vl�ci�[��6�%tΧ�%�(����
!
{��Si�oCQ�G-�&<�A2�����<��-�
�c�i�MG���
�ߨ��
-�IF��������L�}�4��<\~��mO^3F�v�m�z}a��M����a�҆�0�rO��f9_끺9Ȭ��B������6>�n��
,6�m�C����
.�`��N�t�Sq�5�%R�"���'���m�I.����9q$eԂ8��SW��1���ı��7�.�ix:
4��n�1
�Ua�k�6��#_^��,�֥j�N^Dh!|Ѱ��j�/0ZxBS3Tmr/:5Ύ�!����R�cߨݍ"v�Cb�g�3`�g��q�aT���OC�'7��L�t<��n�G��J����b�
sf	
g�ze�*\�TH�Z8>WPh�8���������x��gO����|�:�{�A��D+�e�>t�r�uf�q��
�v0��
- ��� �K�����y�Ʀ���L���V!���;�u��j7��pMgL+3&��'�h:�� ��"���Tg�&NO�������ٜ����Y��
Q�8²��&��<{M���k,j��I�w�3��n�o1���>�ى�C$yV3��
��G��.4
��s�
:�iq�]T8a*�}�<L����Q�����1���p �������t���&&�
C�
^�q���
-�uyJ��5�����i�Z�m�
X�
B�J2T�.��8+!rq�Fsp�iv�L��=�=�y\j�uJ`�؉�X1˷��MBG�_����1��~��nA�� ��n�BHx�����t�[_N
�>
-��]0�*�*������B�
���1�[a�n���4��b�Dy�5��F^B�������A��*3��
�JK�|ݝ]G���|���UɳB6���۬8��������
�*�=br��eq�"��~xMCb��fi�uBEoWƟ�I�2��
-���A�q)B���œA�<�3FB��Y�a|n�T�|�kLd�Iwb�lB[���
-m�H�6�Kn�
���.H�	�:
�^��Q��� ���8�
-_����^��O�
�FJ�����59��Sq��+�y�ͯ�K�gb�4��^��ae��!o�3����Wl
��0PV����]ʟ�N��i at Y�Y�qM�'�Y)��S�r)i�t�/��:

�(���+(��#�۝���x�JHhJ��X/
3�R-��*�l>ڠ�ׄ�:���'d��D�
-ӗ��\��]��L=f8��"@T���;?eY��?,O�8����dV��i�_�2� �S�c�|�D_\W7�	������ ��k���^��X �h2�h^SU���/㊃��߽``�S,�X�g���w"�d���]�cKzk�1��W1x�#Ņ cv?*O�[(�L���,90vE�S��po���WȮVC�x��z�5�I&�ޕ�UU�`�WV�[�:�W<EK���]���=/�-��
D��|X�?Q>U�p7Oz�X�RH�~��d�-���dhAB����\I)�^ݠ�:Kb���oH��n���{l�~)��ߝ���ԏ��QR�I?Ϻv�g?��
 `��4��h[ۚ�����t�VT@71'���ŠP��%��[X"0�+�
�u�h]�Y;
D�

S�`\�
�'j5q�/V�
-�	U�p)B�;�a\O�`q��6�U�X^ dB�s�۳��K9���$�]�3��D0��"���.�e����
al�	l�9���V�|�O�li
�/�m��bT������ϬQ���C�	�K��T_�%Q�\��x�����>�iU�]���^�
NbnLm:�-���۟�a%K�FM��x,��um���:��v(�[�6U{��f�Pq/
Ou��5:uCjZ.)����
<��Z�6�(u�%�~������
�O����o����(�.�d�U�ݿA%bj;S~�j�I-Ϧ�R@�W�l��բ�˅'�J�(9������0�U
�Z�Ր��� ��6�Ob�50��#��)r׮�ۓ�R���!a�#fJ��Ax��w,��I�u�����߱��K3Wr%`l��{��AU ��,ޘ��X�����y�r�p�W���KS�E��8�v���Ү�3LY�pV~�j��x����Op�-�5l�r��{&��+COm�:o*��s*5�/�
?��6 [...]

��8�\<�z��<�r�ӟX�P�
-��H�Y5c@�_�W�>�==3���+^��l���L6����UzI��8p���t�xh�Zb
���tNC$
��ۃ��te���^o��hRw���9_����T�9!�Ց��I-��ld.g���/R��&
#���.�$�ʷy�Q�����ԭ3���U��>���h/ն��%��8Q;8�P�C�ΟT����R:�V.��'>ܶt�o����
�Hh/��=K�0�8�9�K�_��~[��{zCnrAZ+iP.���D�6
�J�
-�+��4�
��Jwǩ\\<_�~�����]���ngqe|�GP�k���6��k9��"*
&b�꫎��)���C��fN��i
�tu�

:�SB��-O_�	
2�(���M
-����R��Ǭ���� ���r�����8(�'�R�u���줊b�Mr�˞��~4���AF��
9
����ѓ=
ޙ�CA��Y7�$�
�wh�n�!�&r�S
V�a�Hk��= Z���\�[���*�w�^�#Y���Hb�\Y�4�j�C�j���+J0` �nRpqu��î���GC�ҙ�RaY�>��0�M$V���K�

n�tc�
$�<��w~^`��0�W���^�

�_��P�KL�_�U{�-�$r>
���H�\�C���6��i�搻�`�#/@���8C��N<�
��P��#��YAP��W�8���qw$����k'YPI&�/��2cDL��$D
7;��q�Nfy�LI|�|�f����u�ys�뫾&dH�o����? FRC;��;��ῐ�~(uЬ�
o��J	�3K
-ԕ�a������
-ye�8����b��
،tNXǿ��*�}w��l���#Q�4�"]�=��wX
�����@�/z_O�a�L
��F���y�4mϢ��:b+%v�	���c/��蹻��7��q��v�"Q���j7�;���
��}
��^�P��4��)�ǞO���|B�)����D"d��H�
yͽ~�y-
r7h��X%��5�
����^R�����<�ԓ�fo$�Q}
�2��3�4oz	4�A�C?6;J旝ד�|F���	
�Uǝ���#?��XI}dk�
-�#��Ԟ����
-�)��
,�
`��
VJ���]�b; �Ð!1�0�x;5��E6�'|0M�׎����I9;
�>{�ͨ5�,����ζ���J�Nz�4����S�J
-��q�����O7N��aM����%��.j./Tq�vh€z7���3�Vڹ��U����[#�����`�3�	Mr� '���|����O�%��en���ޖ� ���tA�7�zi�`�(+p����[�v�N˒��П)ʫ�	>z?�閤�W��w�E���$��i���0z�+=�>�~".hE+;�i�QZr���u�gd��|����3NE�M=`�
!
�zJw�7���I_��|#���3UvG��.� ���e�])�$Zd�7�����i�����O�S�>��C�R�(�}����^db
��'i�Y~$�R��!'��@�G�i�
�28��*�
��:��ρ�ԇyqd�'�z�ɋY��R��+h��Ǜў=E$Ρۧ>��sf�6�5y�j�fi�

�3�[!�.�yYϟWI�D�� ��9��MR�����U�c
����x�'ϖ[{�_��4z�S� �.
(��gM�`����
sw��3B����-���C:��`f��z/]�
�w��� ��ͳi�2�0��~��pRA���z}��:�AQ��Ld�,Bw�����kr`ڙ�yǤ��2
�4���f_�v
�-"�z�����y�f���g���x1SnPW�f�Os5�0R%;Z���v4�#GQ�����33ޫ9����C9��?E�	�|H�?��:<����v�� ��8�� HOς��u��i&ă�O�a�J߿�A�@� x�Q]y(x�y
��V���ܲP
�r���u[��2�5Ў�xL&X��}���
��aΦ�|�� K�[.�XY=7(�;��eeҞ�X��"��Y��Q�[�#R�_� J��dz�ʛ��0���ő<����KQKa��D�e���f����&�}�N��=�	=�<=�K
^�cFY�!7��_��E��;-Y��Ѷ���|[T��ט4x�6�0��(-�"�u�X-��Ξ��&8�ҿA��2��6�=(�|
ǜ�+\?j*&/�RR�N��CVr��@��#��@�g�p��=�ʃ�h�]+�嘵�9���zm3Na&\|�d�9�Z+m�R�T��ż�F]��i������5�Λ=�+�2�۽
K�.�?���������{`S�i_�q!-[����]n�Q ;x���d���ʊ��$�[�~
9*�X�JIr5�*��x'#ɷ)H\��k�q���,!��՘�+	��XC�~f�W�mc�}z�䛢��.�=	ɦ���
�s���i*n�
M��W�C�Ȍ���qm
߿N�%�n`Tbc�D�r�
��<��fZ��k'�
A������F���r=X�[�ە[�����\���h��
�*҂���4�
9}�y��P���
<6]�5�2dI�I��]^���ќ%��E��2�]����d���`h��kJbf�Yzq-����#�PZ�.�V����Q�S��{�$*��z����
AY��ˁ��.�
À>�C��vrf-n7Q�VΈX�N�4���������)w��Av,�{G�ڒ�R�{${��sk^�
-���e�-IJ{ލ|�ڜ��6��G�ױ�A����{)��КNV�.f����:
�ҟ������Ҏ��c^|�U0�Ԝ^UA6�^'d�
�$|C2:.�&i�}�7a�Q�3�/�C����a�O
���F�
N�c��z��6�. ��mVB��0����M����}m�;W�1��-��7�-���2E�{x߻Q���U�o>1|Þ���Z�wi����pE
Ǽ\p8Q#/RW�;�[��'���i���)(���Q6e��k�*uPr
�h&eٚ[Yʝe9z�T��&��`����ה̤����R��J���ld7�+܀����nڡ�
d�G��ܨ}�y�Ւ�
#h)��(�
��0w�"�a��]%�
X��Bn�ݤ��v��|�ug5kz�)rs�U��[��
aڸ����K
�; ���
a��4'e�D����t�|"}�o��:�m2LES�D��	w5��

g��Sh�l�Q�[Fq[�Ս�&�Rr
�unw�X��Ԧ7��
jf�O��6���E��)<Է�7@>C�.���1
1VMU|
�@��U���r�[�������d�H����plEjFp
-W��7>-ѽs�sτ��=��!���-�/��fKH0ZP�1�EI�#'
1C��7�%�s�<�;��L��|��g�Ȇ����M�����QL�~����v~(�e�zo����:�����,�6�����~<���ܣ	[/M߬}�.���l�-c��q�Y�H�,����
��㸁lT7w��0x�����j���+�	�X�d���Lu�-�1��	�7��l��)f
Q'�zP'U��
F+!d2���֔��e�t�2��E��X��ĥ�U���d-�%�k��n"�c�mM{tgM���n�ȡ!ѹ3F
�
`B�7�9��rQ�
F3��./���3�|&[ݝ��>|(x at G`*�<+��
-+�36mM�Z�a���cV���%;z�VFUN�����hAqVR�
-�<�d�`

_M�QM�(��G���BRa"�ܣ�I�<�_����P>�p�e?x�*}�8~1�����WK:5d�:���1I>�
d�}Z���T�\A�{���p&A�d���4��E.%aU4�&?1t��M���~���Yfp��W\�z�_�܂�SR�IR�
<a%C��F�驘f�_�6Z�__W�&<��e�en��ia ��xއ
�F	ƭwi{
���u4w�P���ڕa�-̪`O^��t7inJ�^
�p6ZJi\_<TOr�,eh��2X�2�°�%m靵��Gt
LР�:w��eqq��㴩ukEB��[4��S��%�oU�����
N�x��ǂ~
�
-�9\��#j�_3
������2=

��N[9�,��|
�!�\5��EGԈ��J��?BA�hz$�:\����Ǝ�$^_��tgR3Q�T�2]�����(���a�Pc��5��E�g�6���߈��
�
������@�����,�։0�]����̿�e���@�ɾRJ��8u�_�7�b�ɺʄ۫k�
 ���=U���!�5qC�?�/��x�������	ӓ6
j�L
p���L�,>��+���x`?�~�x��mC>5��v]�
v�
9�/�ݗ
����X׆�<ջW�ن{�{�6M�� Ôd-�Ɗ7d9GӳT�Q#����;[�
��t&j?t���F: [��59��2���䧠�*=�8�P��j:�l�x;���QLl
�?c��[��K���B��+��7-��K��o�t���#�dV+�l�BV㓿p
�so܍!v����c$��TkK�n�&��3UhnTy��v�*
���[��؃�͋�~�X
H2���%�5��
Z�\8��x��
1ٳH��g���9�_�F�cc�F�\G�zN
�Z�2��U�j�/�����V:׮N��PL秒
-�$�
��b$�`�
-٘��MO��6e%��Ys
ߧ2e�Y$��M�4��B)N ��	!@�X����@u���e[)k�B�H�+�<"��Z��!��6ѣ�Љ��w��y֑I}�aA/����i�(�l�K˶+M�Ȝ�d�S��ԁ�e�V.J݊�S?;r�#x� r���y5
�I����u}�>�
ά�����G�~5�.��8`<��,���qR��o���K�L!�˭�/f��d��j$dP���Y�E�Ph��b�Ҁ����e'v��wΟ�K/I�+��>4R��	fJN���)ۗ�ֵ��0w��b�Z�]�Ne�Ӛ6�
!��s��J%�]c��������3]b�C+FKPD����x[?r�B�
�T%
�K�
>�3�f��Z�6kN%
��M���m�=��E_�u�j=:�f�����Ry�k�Q7��]��g!ui�~��1�l@�6�52���o�U�a_�\t����ol��c���"W竔����`�P8ْI���F�~��Χ
i�_�yCA��
�� [...]
-�bDh� z�}6)a�Y3['?�X��o���
-Q�ᶣ엘�u�,\
�+6���w�m!��Eп�_ׯ�����.�>yU�������s�����h�e~�����>�
��H�Rլ9�6��Z[�Z1��_�!�&�j֣k%0�ܲ��F�b�`��*�o�:K^F��m%_�����&���,w�R��Z�
6�����ww��&}��g+�S���0�y�L�Ѱ%����D�Ɯ
����4�ϲ��*����g��g��7d��m��B��q	��
-����_?��r92�};�2J�q
.6�۠1pJAl�ڴ��-'��0=��	Z�fׇ��r�� ����~SU㘢i�Q��2r����됸��!6�5CS`+� (�geS���W�b�E�2 V�Mk
�	,�T�^hV��J]%��4����H?ӥ�_<�V�E3ω
z�O=>au�c��ީYʹz�y���kKeN��$r�y!r�ཪ������9*
i��O�'-;�U�d��x����q@g׋�Zk���VgS�=!�������7�$���&�(����Ɨyz�7}F>H)
�e��Q�M���=�ogr�o6�U!1�����
6�p��b	+�������v��,�_��)�%��1*V���vx����sÃ�͸��3٥$�u?�����g��^�jY�! �0�8�6��<��9i�)�]l��b|)έT:�b�Ya�q�9�xF���D��E�ԉ�>
-0������$c@�
��V&�,]§:��Z���2�/DTuu/�Js٬K˷��%J��L
���iP�X|��v��".��c�#�6�ZHЅ�P�]/�wMw08.�#�����A�[�z|
-
L�VPv����ԇ��&���,{�8q�)"�ez���L�e�5gp���&����ev�zT���NM����Z���i���	\�dd��P*ۜ%��&y��r]�
��=kM����\�
��NI�n$�o T@�#�bM	�^�
-.�g�烓�́�:29c�B��}藳p
}c��K5���{�ex�Y��S�q[�����3xE)x��a��Q#�skyI��4x��=7�h[�ЌP
-�\{ �Llg����W at -gb
�r[
-E�nE��z�S-U|����Ѻ����Mg���zз�[���
ы��P�� x��f<�Y1uhk�ɵ!����8b`��,�DT61�w���~�tA��W��i�|����Պ�n�j����~'�BI�"?�l�F�o>/_�Z��0��S�������B�y���U
�!K�`2�;�6�b��WX*�i�/��+Iٜm$��^�T;7VxZ�C�2k��O���ǥTu�wv
ҥ�C������G�� ��N�� 7����nQAQE-U�����ɉq��7BS�"((:@�a�)��Fx"��,�6�c|3{��F���&	��z��;�M
��o1�����!8�D�_H{�}dh��Ew�-b#0��z�\v���=x�����љ�u��� ?���N6�?�u�aΥ6�Q��S]�!*��
X��"=k�!
��b�}��O�m/�� �N�fa�' f{
\b&y
�~t4�>�\�H���`o�O�U_���tF_˕���3�����h�
-����cL��V[6ֶ��#��[�
�I��<O�U�;'��No题�ً��?�g)�_�g���楝:n{���-O$�'u_���˯S(
Y<�
·�p�L�t���-�P4����R���Y��X�܄��(epۢ�:iމ�FS�`�DbBmI.�G�|�D���|'�-|������o��)a�#x�u.�%�?e�-(v�(H�a  
��!�
gq�cƌh��Z>���d���.c?H�¦�mQ@{7��/�Wyo����`і�A�
����>P!(zq������^?�Xi�G�NYz�D�
����U���a�!*���)���V�
X�afv�A)�
^l
-��%���o�9���m�p>i�r�2���6�٣c�����zR�ð�u�������%�-��I]�
8"�����K�5��Ϛ4u����t"�ՠ�֏U=7��4�����Q�K��#�O�k��v��
��i�^��5���%vj�&
-[�o��lټ'}W�X�fMlHU����x���9��Y!�#�q����:�(ʬ%��6��6
�<�ʮQ�]L�a��
���dC-��U/����𾴽�hdr�bY
�
23DY�
,�>:A��-+��3&^�O}���u�"--C�	���m�
0��߈��Y�)�0�#��?S|�"p9�5���v��`F�h��-���A�p�fwߚ�+�
{��Q˞�� o�)�c.
�d��a�_n7�D/
�`�}�;E
�p�
Z��NW{I�J������}8�M����X�k�j��薳�z��Qo�f��I;	P{����|?P�����������yg�Gu�dz8
-M&@�z����4
å&B�U���r��<�$�j;*
-d
k`|
��ף�nCm1����Ą۰��{��i_�����8=��
+�#�Cox{�^�E�,wG8�)���W:�jk`�&�Q�����)�ԷQm�G.X�8KIi���ay�ǚ�
Q�La
�����m�x��( G���
x�n
�}<�gؽg���8+;}HH:ORN_�d��
�H1�2Zr��:�RDf"�*��GVC�\�G<���ը��hµ�b��f�?Fr���|x���ԃ�6�
m�$���'iU
�3��M�z�AB��=�
�0�*(��
`!V�K��O(
-Dz��
/4�-v�v��y	^
H�N��5sJL]겅Δ������1aw 4����%�mAd��u}:���q�8�N�t*D�����h�����^����Z�ѿb�e�F�~�¥~'#3�כN����/q2L5к
P��
��&��

%t�?,�1�ʘ� n�&�T0� ��e0�+�L
����X W�Lu}�Iu;Ȧ���„�PU_�]��iao[	8���:y�
-R~�4h声f�c�Y�ޫPW�i�!�E�_~�b'�X���l/��=��E@�.����ف�	���6�@�ȼ�Ž{����a�]�a��G�_T�F�t��v
Ic�/�u�Lؓ��1�Z.q�%�/���ĽMX|n�+깋�T�@F���*:�u����bJJ�)��L��2���j�h�y}� G��|��͏�:�T���+����7
��}�O�,�3`HBTu?֍
3�I�����
����Hxv���r!��lmD�F����ai�HUN�,��c�?��?�6;��zU�@gB]����I�
��c!(:�x�Ӄۊ�U唞)k՛�֢�Ⓑ�
�۽��c�ǰǨ+�r�}���*֕t�2��6�*'*s<��ݾ&ا 
Y�a����Ti�ͫ:����:�̐eJRQm��2��=�K�Yq�XK1�]IMU�/B�B�
��ct�w�B��9�X=�q$���۝x���ߠ���i�@�J�y�C��k���z�b1��$��2�p�����4�'�ϼ�.{+� ���M�U߽��$²�� [...]
� ���d?Y�|
r�B���hE��֯�6�N��Ȕ�Mz�
��W�θ`'#���#�h�*��4(b2k8�*9]�J�N�c�jY����!
�54���������1fF�r�.�����xG}�awb�7Y�R5m,
�(��䐖)Hy��U��V������2_
Y���ƺ���<.Bd�%q����˽S��޹�h�Y��'
��;�0��s���z|
}x&
8��N������E�Ts&���^��^H
�6��TlV�ۤF�D
)*�*]�	7
3="�Z[u]�k���:BFI7�W�F�':�#����F?
"�[��h4n|�n�.��>��d A��
hz<I���.jX�0
Eׯz�a�n
��A6R�(
.�/,��$~
��h��R
wd_s��ȕ~a��$$�sw
�Ҫ+/��!P�ٛ����+
ƽc��2�'~Z�r
Lv�b�J`@�IT���*8�
-�gլ(Rȍ��a�xOJ@�ʪ���lF��E�8�%��6��6_v��X
�sD&+��L�N��E!�Q�+�S�O6��ckp�XK�-�I"�9�fA�$/y-.�*ԳX�H�0?^���	Ӎ	Ө�@l�,M}�e�؍]�b�΍���W��nx��
E�˱{��o_l�I-�$1Rp�#V�u'�H������	�\��4�D�z�i�(�BEu��(	����?��UAEs/ �W�̒$����L����x�V���'�F
���|���y�D29d9�ʻZ�'=h�v1�Ǘ(`�����ٔ ���"�A�?H?L�G��-���m�L*(�a����U�q
R}��s������c�;U�R�C�>N�J
�W��� �
+��ξ�
������ a�>��3T
找;�Y�l�#�t�
=7/�����8#8DqA�^��4M�t�������7F�\lL��O9ZT)yq�H&7>��o/��oA��0UFB��Ԉ�ST�5�p���Ks�%!�%�*��0�`T�B$/]�B�IJ���C�H&7zã�m�$�	������
o�x�B�E�D�8^�MԆ y�w�sR�e�yu��H��c�N�i~l t#_>s9"73Cd�-���g�ES�z��w5���yo���k�+cM��4��
-5ςɚu�C�E���l�Q;��۬��0�y��ᤇʎhHڨ���
����4j4S8�U� 7 �@|:"�~ ����Z
[=���
�A��+���q�k��-7T�28�5{�o+܍���4	���壍�+��1{֌!�����ʂ�
��1E
-6Գ�U��m�������d at m����{�C?���
s��K�U�^#�>HD�+��y
-endstream
-endobj
-3379 0 obj <<
-/Type /FontDescriptor
-/FontName /OLGIQR+NimbusMonL-Regu
-/Flags 4
-/FontBBox [-12 -237 650 811]
-/Ascent 625
-/CapHeight 557
-/Descent -147
-/ItalicAngle 0
-/StemV 41
-/XHeight 426
-/CharSet (/A/B/C/D/E/F/G/H/I/L/M/N/O/P/R/S/T/U/V/W/X/Y/Z/a/b/bracketleft/bracketright/c/colon/comma/d/e/equal/f/five/g/h/hyphen/i/j/k/l/m/n/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteleft/quoteright/r/s/semicolon/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3378 0 R
->> endobj
-3380 0 obj <<
-/Length1 1630
-/Length2 9643
-/Length3 0
-/Length 10477     
-/Filter /FlateDecode
->>
-stream
-xڭzUX�ݶuqw���8-��n��h�$��P�h�"-�w�"ť��K�Xq�O�o�ϳ�suξH�wͱ�2�Zo.�D���)m�*@�pN^.
������q� �\5�
A�'���I�h	A�r�p��h�Z�� ���˜L Y��d�`��1dcg��������?�'O�
`~zp:B�N at 0����
�o� [�# ��e���`U��(�@KG���S)� 5�5
�l!. ǿ k��4��4
`	�A�֠'7��5�� @�.N �� ��\,��
�! �����OOv[�_	A] O;���'2-
�vAဧ�Zr
-�	k	�z�ۧ�6k�?%��=�<�pK�=�bY6 ����)���W�0��_p \�v�.6�@���Ow�U'�Uo	�:z��
�k�� �À��\��|O1��O��@`L�?â
�� xy��۸B���]�j럙a{J��v�� m1�5 � ����\�9���G������5�o���z���Z���Q���i ��d O�
��s�8Z� ��5�����	���?8��FC�������ae��SS��vO�p��q��m�@
@-��-����g���6@G���_m}r���7L�-���G��! ������乵TՕ�t������ZO� ���c�����
���S����R (�
- ����?D����_kuK�
���������ϿV��F#�����
]�%��i�����vuqy�����T�?��=��Ɯ��X��'�&�+�2{���tu�"�C
j��r��!�~Iak�%��\��E
�<��[*/��;H
Y�?f?�e`��!Xfnd��6+�I�a�}<���l,�c��>��c��J���
���?�[�?1�%��ubu
I+~�3��܃��{W�,�}�=�(�[T�1L��d�>
�%�=-\~�X?�ܺ	���j��/E�������=6ꑮ�F��

̩�'gJ
�����f��
|����Q�c��U�s:B�um� H{��%�9
-�4���V�J66/��,C�_ �1Lz48�����!��Fi,�#�
-�\4�ħ��O2I��{��L���c�X�+��j�.�u���Z�:�s4��	�
��;D��6�)m7޷v�� ����� /��%�[6�L�/�h��E);e�)�l���Ճb'�|ϟ��!ݮw|������z�)�0�|���*�x��'rC�G���B�K���OU�z��Yۍ�����v�Q�2�J��'���t<���Թр�
��oa�%��-��Iv���6i��dz2
7�F��_�,�X���5��j�H��+��>m@��Z�8߹��8�|־�lx騶�+BE��t�3

��E�?��g��Sb�.��h NKi��T_�S��w�D�Lv�Qdݹ���h��
-
-k���jm���oN~���
U�]\\o,�I����p�̦1S%<�#�@���h����[3Q�N�ς�~��jѳJ)�>TM��$�
-_FiŐ�
�y�/	�|�(�t<A�C?�[��@���r^��N���2D4���>�Z���y�Yq+0-�ME�j2�o�r��2
[�Z����l3=*P����U@��̵��B�Z�R�L�;_��(���[�`�� �m
��<
z��v��
���֑�yr�ڡ�9�~K���������`zy��}�,.�<�w�Uv<(4
��E��r����0���O+Ɵq�
�
8��L�$=./jm2y��Ÿ��Iѐs�����D�c�3E���������rG8Br[�HR�s����Ϙu�& y1���r��n��Amx�����hKG;�ъ�#��
-��f�4z��i���Ǩ?��!\���v�"pݙ��K�]}��
-�]#f�
4�Ҹ@,p
�G���Lw�I��'��d"�$�ͬEeV��������ǫ+�2gf�gX5�&�J嗐��B��%"���ü{Z��ܐ�m�e�u�oŦm�t������5Lr���&c���2
{�����7�_�w��X�֕	
�I非�����&�8���0�,4ֺX�Di*��M,����4C
[�=u�|���4���Z����Ќi���؍���Qx8���k�� � @�5����X0
k��Vh��\)D�mE[8t�Hۖ}aaY���~�
���؂����p��P� e���l=%�q���bg����Z��#"�a�u�P4��M��S�׀jՎ���`;yK�v��Ef�H+�"F۾H��o7Ԡ��/y��^.�|�kpc�e�c��J?�1Q	N�Y|��>�ZLD��ͭ��p�����
^Q6��m3�3
I'�}��&�6*1r*�R�+���7,Q�s����
�
��y.A7n����io��Y�����48Jn��-������n�\��j�g�,#�ˡ	z4�~qFt���j�3���2�z
��
�������J���%:_�W7J�r����k%=�l��<>KY�jN��
-�ʲ�ꎴ�_�H�z}���Y஺��ڈ��W�SN2��
��N�E�Д3
-��}f!������
8�yȧl�,3�i�`<I���$XI6rђ��F�
N�ԥ�����wj��
���<��*�

d�3�icMi�Vf� �X.5A�(��6�S&��Y�r�<�	�q7�9
-��f"�V
>�'��
�[�K�J�>�Š�H���f]4I�6�I'P�޲8U��4����L�}���*-�6��݆�^̫
��",n��b��:�=���z����f#r!Z� A�
�6��F��#��o��rE7߾���3��m��e��!������n�ÙI�
y-]�̐�(��o��{��w�J�ʌU�߱�x��.(s��_�� .�{� FA�R��
�dC'S�hm�C�m���cF�t�Y��p� r����7��
Ӣ�ƃ��,�)�����fʎR�qW�~5̰�����x�.����,?�R��h �܁���~�

���2!�ٌ‡?mq��|�����Gm���ĉgd���&���4.[g��~�� ��
7��L�7
B���o�;�;���Ѷ�b'v�+m��v��
��p��
�`Ƕs
Ԝ�jF��췃�κq@��#����X�
l�U'�3l&�!	�6�G���+Z��'8��t��{22��Ĭ,XZ�|6���;	�· ���C�~D�������CRt����
-���|��
-�U��(QwƻW,U
-Qv-�иe����K�<���ϵI
FA��Ӵ�u4ӑ2/2"
j�WQ^�U��:|���|��q.G���I���2�/H���F`n3mY�zI�!��p!V�͒ 2W!0�M�A��]h�>����
���~��&y�E|d�t��p�A
 yKcR���P:��ʝ�էq�v@����MC���#={�6��jTCN����:P�'�nr�y��د���L��������[�n�T
-<�c�*D��Q5i��G����7�
w"����P�?^�w,i��|u;D]+p�9w�3�}3���S#	�lj�P#��ɯ��{�Eo<-(2l�,����o�ZW4}/|����� 
-�ŲF��w٪�Z=�� �.�Ϫ�#��(-�
�WL7�,�67�+�wiw�˩���&9
sE��ц�[�t��e��b"� E_&�&�?���y�k�N���Ī���9W�mzP����(�2	�|�;�#�N�LEu��̦u^���Z:M��Q��je9]@6����0r��8|��d�=���?�ҝ���5��`�ރ8�]���]���yCvE߼��z�j�n��X/���j]�V�
-FI��
f)�,�:��~��H/l��q؃ ə�/H'�f��
�CՔۛ��&�˖�O��F�A$��h���W�M�`��ll}�ˆ���\|��径��
�.���D�Ī9��=�7�["l�
��*#����|���OE��ﳭj�a�
�};�r���yv��s~�7�,�c�F�
/�%J���K�ȭ�$��

Y
�C��wy�\�c��{(L_)`����v�ED�Zg�Œ��9B^�/T�V|��2v��sc&}'��kȸ�%W:�^�����̛t
��8�| 0@�:��jY1�<�5]b�c@Õ��8˚
��H�4�3>72VX�Y�F�r{�(��\������7�}�gO%��Vؕ.��[�E"vm�inD��qz]���K}�M}�����=�H���۫l�|��[�P�4��9�<���e��0
��K�0s�yr]u�]����
єd�؋�S?���92���q�'��v�v�F�li-$q��ZM��K��}��վ���
�k�}G��/�+ [...]
-�MV��X�&�3�"�5�Zwqi]�/��~k���T�

��N}�jB�����^�6����^:��#t@�k
����EC[3TW���
-���Z�-e�ؚǑ[�
<4ɫy�"(s�e������q�l
Խ�4���P�p���$�E~��Vԅe��iE�
�+�ۤ+NL�̵�
-铣,"�?���֠��M��h�U<�3ʭ68��%"'U�~����,ry�Bs�e�a�5i���F�a#�#�
g����l�Ž�j�7c?cF��,�կ����M�unE�<��5w�ʼnӅ���>�C�!>�nq��߁}/H�k�����OS7r�=�ů�ё+�z^�4�#��^ЇMd$�ܽ��d�xv�n�DQ����l,�tEQ�7�ڍ�"֛6�����/�V�e��L����
ц�N����R�|)_f��
�Z�s񑺎S��	��†i��*ө6��#�Wc��h����F�}�U�����;�a��Q����T�d�E� ��bYU"Y�.ܞ���T���K������?�-‡c(\�z����ѩ�ȍ�

K?��%�
-��A���Y>9�ƪ�&+���Ԝc3C?�O��C��
�_>D	_?	ӛA<���wn{z��kpeF�l={y���`O�cm��s����yR
0c��lۗ�,zW��'�JD[�g��!(/���m�l�ڏ�q�{����q!��l|Er�f�%�
=�4�
+E�@�F Ka���d����2Q6�x���VߛX��v���Š�͆�{��o�s�v~��*9��1�~�51�B�M�l��ߟ|t�v
���k4v��
���:ه*�ȡp�#��+J���ȚD�)
z F#�o����xuJDCk��z��LVo�@�r�����å`�~&
	�-9��)�􎇙[_?3�a��������x�C��I���<��:e��GDfiu�C�5�wR����m9�Y�9:�%�N
�N�1�3e��-x�36 ]G1ȧ'���m
o1i�_X�l�<rQ��>�8}�}s��w�ڪ-�=���,� cw���������jqzg�G;H�{�V�4�D[3<���s�P�N�Fa<�`|)�#J�
kq
`���
��_�z�`z:�nR�8e��5�&!<��W��a(����Y�Ω*
m���}�y��=�6���*i,��K�a�.�
�x#��@����
'X���4Xc2��-m@�K
Z��B��M�D��z��.�(�q=�� ��j���t�@7LK=�Tĵ��ED1�-���>����g?�fEW�Y>s���.��X� 2`���
�G���to�Z���;
�
ө����xs�.�v~S.5�H��l�L�v�;�dy��pv���k��
@j
�h��dڂ���1��P�y!�1eN�{��դ0���p�٨�V
��.��6����Αx*K�"3���L0{�{�D�&���m��gs���V�����.�����Gx��E%��?)���
-�U*��m�o
�]x�d���@�
�/�i��ba7e�u4�d��D��4�
�~�
�5KDR�{�ec�:l�i��W
O����Xiy�.�vs�!��f�G6�����O[Y��)�:�ǣ�_
(�+I6�!�~��*��ޢh��IN4��)e�
6b��%�Pc���K����_�I�M�������%�<�z�5���	��}�wvvA��쒸�|�a�\�
-���r�+D�䥢t
���̛>&i�("d�m���ɢ�}��+y�
z[������B��ю��`�
+Gx��C����'�>�op�-���1��X�z�qw�`�3�k��^
�P[��#��E�
�}��߄���)3�Y�A�c������G
��4����=��=
-oH���B�z���X�#M�
>ԅ<w��{���Ԍ�\q ���B�
��n��iM���#}�����&������k+-��@ ,"`}5��HaJD
-�a(�
����1�{hZK�Z��(%q���\I
-gW����J��=�Bs�/.C���l���-Eo� ���h�<�_����%~w?� ��	
:	�{
-SrQ	���pÌ^Y˨Ky|
TܿI�k������4���]�m���u1�o��{φ0ߩ��Yr~h����,fg!��toM
-@�:�eI�__�
�Y�����I�,H&'n
-'l1�E������S?�
�.���76Y�5��g��O2u�Q|�z��6��45?�z؆N]e􁻞���

D
�Bh?j�[�n��U,K5���޾������f��Zk!y��pդ_��h$������!�n�TK��-�l�y|m�T���b�"+҂��;tID�OGik�	���#Fu|%ۤR׸�(
��V#Uo0��l�>�S��{ĸA`JZ��N�_'�I���Nc&��?

zTo:���am��$6ːW�W��� ;��T�=+?V%��zՇwy�S����VB3��o������R�
��I��/���]Bu��mGht�t�?
7�����%6�g9֬{5>f�P�g⦊.�?��� O�V6��G���C��8*���˞l~�B�r��K�,��`��
8����%Ϥ,W5�BQ<^ތ���I�?����OMnp����	<�I������Sv}���e�d�v�c�]�>� Δ�8Ǐ8��wK�)��m�z��<s:�AC_����m��@�H`����j3"��O�~Y�u~$�P�o�U`�!GۢC�M
�F�^��]�L�`�g�t�3��ƃ�G���ZT��,{
-
m$�h��h��߲�:Dk�SM��*6RI@�aZ��+�+,$Q���޷�D��֎�����'P���b'䏌���^��ODU0����k
- I�%�X >
-}�(V���d������"j�:q��@�u��I,�H�xv at esԾ�;c�R�.�_ze�������*�C��������۵8����#iU#,�/a�+�3��
�\ƨ^#�?Y�LL
-gk��N��Z����A&��
-r(<��%gə6|�/�o���w(ه��V�����7���4�mQ>X�1�^;���e�ou>��q�S�c��A�ٓw!e�>t�KY�^��Cy�(#DԢ����T��V���!�k��0�Zv"\��!U�No/��eP����%�6˾]|�el�ܨ�H��ʗ�r
�
�A�o�!�>��-�z�Y�����ܠ�X�h����v�O;����rB���7E2Xw:���P�Y��ⷡ�z�J�oq���%.��|��`O��;�P�p��3�P��Yeg{%��

-�1�uT�c���"G�?���O��5Ҙx)��a	r�s�	��cۍe��K�1��C)Kv���z@</"�6V�*
C=
-c
�*Tw�� X(�=f\X4is6	�<G�n�_� �
�Ra�1~7��0�E��a6�w��9����
- C�g�c^��>s�P����lꊀf�̻یr����R��K�ޣ�d��4o�7p�H�Z!"��|:��p�:Jd�e�F�%-����Ax��H-c�%q8
�P��ԯmxaMOˡ@+M�{Dk�۽��~��E���x���z�
��Z�T)Zg�Q,X	�G��H���*5Y-�eL�Rw�ߵ�{����p��i.�} �H%����H�ְT
�&}��ME���2�W�&R��&�
J*��9�y���:�7c[n��
M�!����֭�c:
���I��UD��{�"S=::B�Α(���A
@>�v
�����\��7#(�<r�on��;��!�q�b�r�wn�q� �=5;���k�x�!������C��(E�>��u 4f��z�8,��XWu���k^�C�k�UF���/M^�'���I�
���l'��ȼb��'��#9�
�+�yO���t�|����ٺ�֣����r3�P��C�8��(M�(
ٓ�U	��"г�&�(X�f6�B6�D�!$� [...]
-Ƹ5;�3M���:�fz"�:) [P�T���Lbp��W�������Ό��c?hm?+jɓ���v��e� ���Q��k	
�Z\��Oq�D2��5h%���w"[��|$��W��@��Z�?(3��Z�����Z������O$
t�v�|��yZ��[볝,r�
]�e�|�}�0(g
-�A��
��,���.c����|��e�R���0���87,"���k�J�w�I��]����@A�z�]����b24B<��%��9{h���݌��[wt����q�dN�z���8���f��@
B���Q[�h{|*~6x�9�\CeJ�{�
=>�-s�aؽ/����������
�_]�ZohX6\۹8�z��7 U�;��yH�i�!�V$+��m�
b��D���o
@
��4�����֤�T�-�W�愥�gP
'}�|&O�9�jȇ�Y]�ߜ����Ƃ�'i֙�Ӻ���$��e�l礔��H�S��Ī�K��S<l(��=߰Tr�
'\YJ��q�E?ʖ[�G�E�_F{��K��&"�2i
)��!�`�9���>Uw�x�Hu߄��]��H��z"���"ݑ���R��Z,W�Z�A��x��F�F�L��À\��\—T��.igs
lIaO>��1XA^�
��ت&�D�¼�v�b^�|J
b�3
��ߊ��\c��Nǎ���3�Ja'Zz���2_����_�w�.;�����>��i��
�Q������s�>G��tw���
"�^}>fߢ�
LL��B���+�T:�x�Cu9}6�V;$y
°���@.�6v��pd;�5��0
����T�
q$�B"j�4Hc¹���$_3�
���*e���.�
�-�z�k�m��gq�Z��I�HU�y<�A��tu
;�G�+W�{�z�q�@�f��3B$�i>�m1��̱�#��P�$3HZ"(�@ߓ}�*S�wrU��N(�/�[8y�1 ��%E-
V��G�N��x�^��3�|e���9�أj�c�ܒ����>�?�M�x�k�04i�,�M��ޮd�w���OK���
���wt����9�ʁ{ ���ؔH>�
 �1v�]ҏ{�Q�6�v�l
-�����ji�����3?�}���
ԇ�Fzc+'�t�
o��`��;ـ�A�T*Yߍ������-��5S�Jr}���u�?VMDT�.f1�������&E�
.}`��m����ͫ��A���[�hgkJ�x�f�����ߑ�RW��a7\�M{5��MG
��y�7e���<��)��XdO�G��n
�h��7bV/�%_١s)�%�zY�
DM�rDt4y� �R_�"^�뱠��sL�c64wxʋ�
0di:�7�'��"�i��ޞHe�N��Uq���f�EEk��ڎ����}Hz�NW��bKc��[�M�W\Qc���,|�p��j"�1xF��j�v�O�GPS��YL�^~�uiY�I�$S��^!�2ʹ�e�ŧ4a�2z*IOfz�#�w�Hp��we���������zc��ةQB#�oS���Ee�����u�й��Q�����
]��K��
:�$*
0v\9����R��5g��v�Y���
-7�l[���;��YZ
��ҡ�l2�]D�BDǭUV!��d�/r��\q��&�LO����MT���m�~�A�{�-��8�XnQJ���2d8��>�T�2�p�lFF�ݝ���H��>�8���w��б ��"��܄�6:��\�C$`��W���(�
�+}
P��dy�F��uO�U#���i�d���
�f�4����6\<.�<>�if�Q[�h���W�ኚ$]�ځg\l
��Y|�i�zG>�ĕ(��$����4���CQ�_d����V
-�]$�C�\�
�*U_JT��x��ַ=`�A�s�% �Nm<�CsH
�z��V�ǃ�h�Jq�.���\����
�B���^��S�ő���31>9U�w�4�h��Pߣ����)i�0k�Ƹ�S_q�Kќr4t9�:���4JQ	�!�R�����
��nN�g��Ǯ�x3��~T��
8��
-endstream
-endobj
-3381 0 obj <<
-/Type /FontDescriptor
-/FontName /PKMHPR+NimbusMonL-ReguObli
-/Flags 4
-/FontBBox [-61 -237 774 811]
-/Ascent 625
-/CapHeight 557
-/Descent -147
-/ItalicAngle -12
-/StemV 43
-/XHeight 426
-/CharSet (/B/C/D/G/P/S/a/b/c/d/e/f/g/h/hyphen/i/j/l/m/n/o/p/parenleft/parenright/period/plus/q/quoteright/r/s/t/u/underscore/v/w/x/y)
-/FontFile 3380 0 R
->> endobj
-3382 0 obj <<
-/Length1 1625
-/Length2 12728
-/Length3 0
-/Length 13573     
-/Filter /FlateDecode
->>
-stream
-xڭueT�]�ep'�h �����h
������
��w��n�a��ͽw�7�����k=��ή]��TS�*�2�ٛ %��X�y
- [����
������������HA!�4v�ۉ;y�@3����
-`���A� ��;x8�,,���*�4tt��e�0����M0��@���
-��w��9�C�?_TΖ@�9�UTҖV�PK*�$�v@'c����
� 2ځ�4 s{'�Ϳ ��*AK3�c	�� ���~
�n
-t��8 �lA`��7 X8�9����
 �3�q1�K��nn�!'���w�;��=�l�rp�gU��OgKc翹��w7���=�����oI���a޽�� ;0����7�	`;�{��~sp�C�
���/� '�����

~�y��۝���To��`���m�����
�1gDda}�i����d���wX����,�����8�����O����
�;	c3{;��
�I���=%���Me��9��$��D��?q�]���������p��Q0�}�-���� �
���K����el
���o��{�&�_\����O����!�v�032��K�܁fJ gSK����{�����3q���U��� f��Y�L������_.����7��B�ÛIJJ\UX��ۭ�D*�π����;��]����
�∈ػ�X�x 
l�\ ���������I���卝�@� ����Y�������o0�v��f�F�����}�����m����.�?O����8�3�@�;�qi�ޔ/�*5#͹7{`LL���j ء�N� ϯҾ�75l����*��~����c����
��P�
Ug2�,��Wr��<�5�6.�� &�"��c�(��Y�
h
Nf�ݭ1e�ϰD�mlN��w4~�y~X��8������`�D���Q�tL�pp���oxp�����7!]V
�1�O�i�����M��+̣+������V��2��
-���[޵�f�|fo���,My5���8�7M�	M0f�v2y_d>M�����

U��_�����1����o_4f��vBg�4�<�-JN׎�3 �
��Or�eӁ科�憸��*���<LIk�ʏr��Ė�+Ȫ�߭D�"�
�KK,�E8B��g=Hi���%o�:�m���}�K:��#�}[���������%Vmd��$�2�HF��^� u&��������\�lz��V4Up

}Qg;��S?F���L�^� ���[��p%{ԬH#}
]��Ē���}��*�TU|����I��I}�k#.���h˺s��t�ԪY%vG"��O)*>���G�lW�,�oq�M8+l7�(�^E?ט
-~e#��;KG	G�y���6��
��
5;+���"�8�wh��ZqP'���y��
�`�<�WUBt�S��
� ��3�^O��
-^�?�s�������
�ɯT��Z$�ו��s˙*��o
.�x���+P6�a�4���X�d�t��y
@pQ�8]�
-x��y�8�F�l�н��H�|`Z8�G�Õ=��XK͸�H�6���z�
�
%�L�E��age�;����֓�lq���1�$M��F]bU�1�l��r�ޤZN�
�H��z�d�t�|��6�ڙ�y	����iM�8�
-���Y�4�����c�|R 7e�
�͡�@�Q�������h��f�33�:ü4�'�"Qn%D0d���w|�h�
7�ƒͦՁ�q�e���9�Q	�����ҥ��ko|���F
�v"������{ǵj#S�#���n��Bh7Me2��[f~�ꄏ�+Bao�ct��}� $�A���s�Մ��uK9r~�wF+�L�t��K��c��C'��EI4.~3�ڵ�+:�x>�2 ���2i�O'���P�K<2���R�������|
���lUy���������qq��]�P�
-�Zj�sB=3���&
� ��}8����TO�[��
�
$�?D�
Z��>i��Fa�Ku7P�HJF���aQ�G���(�
-<
Ee����d�>�/B"׼�,��5�uLפ�uL5�L�j��@B������(j�QG�@�U��)K�Ur��Y��,�sA��
N	�W�øf����e���ܘ�� ��ߨ��E����;&
#5�t��
�GD
ERO�!h��Z7o�&	
-
-����j�hR
� *μ�46z���ˆNKJ�%(/�xl�,Z`D���L+�#T{�����[6\�Rk�%�Y�Ve������� <XS}ۆEAܼ��$9�ҥ�
�.h��"�N��j�KTYYAbO �P��Q���ŏ�ia���r�/���\�?�[E�~�����w�$Z���0KJ��,WkΖ��� �)�~ϣXp�$B�
��5le
�PB��<�����,�?�V�
-��'Vvh�j�/n���v1)�Dʋ�1XH�E��ƣh|�"�f�am�Q���Ɗӡt)'u���`%�s&���2����_Lz�g�5M�;�|�B�����_�Ix��>�2����ꤨM�r��&ݣ�t�
�ܕ�7d�a
~������ҋ
�c�@�'!�R�����5��K�2�FO� ((3�U����{�c��U��Ϡ2���}���Q��:"6�_�@�,��18-�iD����`�uXc�8A'�?hRu=��o*�������.��!=(���TQ6XDAf��?ǣ��<aV	W���}e�� 1u���|c��m�I)��;�Lfr���X_���nK@��Av�nY��A;U�x~4��mJ��b�e@"+�0=ח�O���ϥ��N���cD�I+"�r?��0��j�n��qV���W�
���j�i��3���n��X�������xXš`N�Jt/y����h����$��w���7�!��`�Pul�q
�j�]=_���S- [...]
-R��rq*��1b�=��,���-������0��?o��9�z7�l��X��޵Me�Ը8����bm;l��+�R�y�٫�80������R�Hile-��+rS��ƨ��Ak�� 2N�� ;���bRA^'�Nx��I<��My9���W�j}�ئoEkJ<N��`K�*Ý��Ϥ:;	�P"�B�If
�Y"��u�7�
�Z�=L.7~	p�8��4]� ��t��� �@q�8��Ŀ"Z�2D�d��'�դ
-O��j�i.���*Vk��V�H���.)�@)l�v�ܸ�!�+�@4M5E&�F�1襀E�r(�s��U*.{��q
�\�O>�!�7I�RF�5~�;1M��o��D"��k���~�
�	��=xie�&�����M9~���o�����%Q���5���P��hH��hh�:Я/�Fp���d. �����3ٽ:��.I5 z�"����T:
�,��J��N#�k$�{=sF�*ױm����l`�3��f���ϨM��7����2?��G�O޼��&�P�<R0d!���+�ޖ��OM2q��ͷ�'���ABk"�
� 8��5dx+��?�4N��>޲��U3��)�-�|i(�+�”d]|S���4ǢC�ϗ#}a#��.\O
�hltK��8�U���
�\w'\չ����&� 4r0��2>��g�g�]����t�?��$Ԍ�q���7'��s�ѹ<�
�M��h�>+.��'�1Ps�"x�|b�2 ���֢�{�ʯ.�5қ�zld�{x]n�= [...]
ݨp?���a���bk�dY��8���U���
q�`5��G�a+��|�Su�2��pc*�2K�4��,����O��
o��/5��3�az�I

�m�]`�x�L j��-6Y���eN_�q��o�)d.h^�1Z�uԬ����Dj�E
;��9�c�c��`b�'
��n�1���<��^��JA10&ӟ�cu��ф
�>����`�565:�L濧�@�e�m����e�B	>�
~e�9��P�M��V�X�~x��l�v"�kr2�J�(�J��4�'
\��vN�"�[���חIL#�Yf�~aP�7�mzf�æ�]�|,*��;�"{d��]Ě���0Mf��:����]E�|ۍh��(���)��K�-� m��~kn�,K��E�l�q���ؘѾw���Lԯ��%]C���'u��A����Ũְ�N���Sўk��F<�R[9��8��}�
�6�6
�<�)
LJs�p��ђ`lگ(䃺N�C�
7���sU�%3m�E^��t�}�R,b����_�Á��*�,�u 1xlsr9��$;:0or�y�_nO����/ݡ����r���-C�b�R�+�,�zH5UK�k�0���!F�T���ue�	�,1�q
7�\ZV�x�:�k���z�֌���ç��ND�'�N���a��i������ԐJn�G^
P-�VyXd�c�xM��Ԧ�U�HPnI�/��$���D��1�YX��m��ƂČ%�[" ����y��f�~pP�
���_��H�{��v���ڢ�E.6\[��U:�[u�}�  ��Eږ����=7'0
�r?���5��M�
�W�-����xsL�
��"�ڹ4�Z��&��i�F&�U��{�_q�`ˀL�A$��S_Dג�)HPq�\�1(��0Ѱ0uꇒʱ�Ns�
�<OC�ja��<ؐ�����oZ
}	���%@���
��
�y�Sh���QDWbfvhȍ�x(H�o+�����|��;6J��F��s��6S�V?uky����N�~_�*y6�z�ɣ���M�+�oV 3���
D��ڌWx8\gNK�GrF�C���DSXH2yd���Mq��WW�6/.x[�o�-w��L�(
F)P��`�3	%n��%I�
�X�A
ߍ�j����7a�jG°��OE�ͱ�����zq⸒,�&!�!-(��j/saF~�^��ud��u�n �~��ɭ�Df���x!Q
���<2WR�7]/f2�{2�CĎ��C�:P�Xy0�_7d��"�'0�-T��+j`J�R�	3�?{�7��/�	#�Va㐝�"6��������a{�ϗ��?b1}Z�
�ػ�D�Cz}L�����?���E��/,��_m��U�\2߶DD��~䈷o-��K0r!xt�|�PG<�V�}իќ�f

o�,Ly���p���}.�%�/"6w־��'�jnJt�8��m|Ɵ��R�ayy��G��鹞�J
�h߻k۽>!�4���LXt�q;��,^��$�W��{P���r��g����P�#������y�p;�������^92vJ�oux?qL�e_|:AsJ�<Z�%�
�,��ﴚ7��E ��|2�IvR�ּRd�!��
��+�C_m�j]�M,�{�|AS
s�c�Pm?t����߫O
lQY�+s߾�ϥ
vqBS�I�| sk�k��[�����g�
%���z�
�5�熅�2�m{6i���
-�0�D��V;/
-29�~չ^�t�|F�!Z,$���
-���z
9Dž	-��-�|H���/t��|rj
���p;��we�M�}"}��^Y�n�^�W;y
.���QP[Ͱ�rMi���d��w���խ[L?h������.T�[&��������Z]��K��靨�)�B3͙K ��œ<=G��"�n��o�#�A���U������_�յ�R����us9���z0�g$�5�aW��^2��Emͽ�"�r�^�그�/�'����Nb�\s�����h���|���i�]�;���>�-1���=Y/
�nKx�1Q%~�Lx�Z�(���;�(�i�Cە
�:���OF�S�u//�ŋ��Gb��j���<�`��7$b�ޓwL&�3-���	���P�e�,�@l��<�:
-zL at Gb3�NH⨚to�i�o�_cvIp�n���6Y���~�����LH�M�NǍڥ>'�U]�0��_��w��S;�xb&���⯺!�a0�q�u�
�c	+.�7��%��eĦ��/N>�n
Gn��7���n�}� 2S��2a�紫�n��y�P�r���π�s��:�z�z�,��"R�.J�F
-�"����
��b?[
8�d#ꅄ�.-0.���
��$W�
�Y�
�	��`���[�������_��u���&zS�C�� �!�ɥi���܀C×A��{��sy�RwuȞҳ��J�WN<IO;.�m[o�i�
-����
-����J�q����/̥l��q��$�����SƷL�����Fw
5��O�~%��������`$�vt��	�Uo�Yk��{|)��Yq
s	��
�M8Q+/
�|N-�d��c
�þ1���ɛ���� W]ȅόO�h��b;5^�K`���B*2jI���I�s/EN�Yoq��
�.21���t��
ZD?�U�l|��[Ga�K��6+㳔ү���������7�����g�>E�"�:�W*:Q�40ѐ���t�
.�re{���H�U�|
r�����8�/���-�.IQL;��&���aG��9�0�*
�l�9i��
G� 4ͼ�6n~
l-�p
�&���%q;�5/���Ot�/K�N�i��.fl�l0���c�o60c–n1X��)�YU��h��Pȍ1���ٿ��_�
��U����pŶG��\g*��T�9
���W����mD�s%B{ܘ�#�(*�x�*�Q��]B5�h�i��6�i�ϛ����c��Ǹ"�Y�jq���ٶ���A��]��������m܎<B�o�����%+?J4!�Қ|���p��)�H��B���H�����$�!�yM91�X����B\��Q�'�B�.��=�d}����-����h}���
!�y��C\����(_@�'Ḵy
���z@]��[/��D�����Υ�z���Zː�F[�_
4���

-w�Œ�s�E�g�l�r���s�h�]�I� SlBy�����h2�`H$������԰�>G;8���7��UA����3U���1�r��Ɠ9���B ����C�G�3���c����q7�g���9�� �:�Vez+�~d���ٳG7���Śhؽ
��n�F����F=I2Vg�y�u�!��~��=_Ob�������/'tn̨�
�P�e�F!��G�z���63���'_Y�0�*�b"3�w��J�W�ˠ6�/K��z�V�3�
�8
-�͌��iJ:���MK�OF�4a��{.�3��c/�n�1�[B+��/��
(F
�Q7� $�����M.
�ɪ�k@^�
��2�
a�ڹ�#w:��;�Bހ�E.�ױ�aH���H�lƺ�6
?՟�
�ϯ����z��n�F�"�??8�Mc�n��
��/6���9,�o�唯�ݰ��K���&Fe�}��Sו�.��o�h��۱W�t��CO�
-�KE���<������ȉ�P>2���Fe�$
ʸ
��]ܲƏE�o�ټ]�m�(õ�]
����3f
�19�
�oRә���4d�x"���s�4��´�M��������R�7�E߼@s�}Lg��v��Mt
R9�9 Y��.����$�^��VM�cr���:�����꽠��^�jcC*v���p��>k�6��1ʭ�ͧ߂�q�昖~k4qzV��B��}����?T�a�-�m��l�}�g�����E�=�-l�T�0���p&��	�
/��Z'�ɭ9���E9={�๷y���IJ���W���Z����_�$L�Ŗ.����9WI띎rʹ�-�_�L"��'=���
Ժ�Ch/`'�и� �҅H#>����a��@h��q9�Q�酴k,_���UT��4�(ྭ��ٕ�%k3oR
��.J��^踣"�s	���)���i�6�x
-�lvC(�}�=�15V?�gL�B:��u0�w�O^${�5w߳�2�s��NT'h���U������
��
-�D��1�I%`���Y#	�,qV�"�2Y���'�u�����L�m��9(�0���gd̾�
"�ga�{w2J�>���?Sc�榋T��q5��g�{�П��m�9�
(������!#�
�8F]�ߞ�TV��Z���%+��!�-� �� ��x�Y�|`��]��U%��-H>.D
-�# �I�VwJUŽT䭄
�8�u~0
/ܗa���5SuSZ�����)������w0=��˰žz�f�c5.�
!����C���|܌/R�$c"0`y�rلN�k}W#���
Z�K��
��zo�\!�L���f:x�ư�����8
�rW��A |�2�[S˵���T�<�[�9����<���:A7�'���ِ�5z��Q
��*���D������q�9�������A��C|�,�YP~!�)fqA։Dl���_���~~����By��%x
��I�J��9_D�wn�GH��}��
�{�:�����r��m~h�nRB0�3\R�����פ�
��
���-><,��>���o�+)��x�Mf��O �m�f�Q�2JU���gB�
!�����
H�a5@��ѵ�}�2�{��JF�??��zň�� dwl�
-q㟁*	�:�1��u8!>M,%y�p��8L�qYw1&Cꇧ��
-�
M1}"8kK���\%
Bݎ�`mۓ�]�N���OT�����7j$|��Kx灈�A�׎���S%EG����}�nJH�&�j�%a�Z�12�(��z
Of�o�\��,��T4��:)�"lo��T�$��f��}N ��������g���ev͕�
-R��ǩ�ཝ�)�^BiD;�ʖ����g�&t����.-�?�1N��̧��1[bK)Ṅx��߯N��G��b��ǚ���OrqrJ����P��b)H�R�yd#�\�����0.��J
-�.�r~HR
�>��K~#��������DŦ�
-���4;�/>
�5L�W&���["׊<���}�O���"ЧaN��O
�b��T�v]~��J���l=N/rɒu��Sv����點w<M���h�
��,T��F߂(vi�6�󚲺��`R�++�{5�h�AOX1Z�1�
-|{��
�L
�Ԩ0Y0
(�0Q˿ nA�H�ge+?s/M��x@�

�+��h�����)M}���-���1
+ʿ&:��� F��J�t�xM���'/1<�
X��ʇ��3
zr�C��:k
��I
�l0��c�NG�>�1_!n�e���l������	U�%�������{/d�Uh�Lݸ.v�ˏ�sh
RD�Jʯw+e�'�#���l��
-\������e��|dhؕlOaey�7�&��I?�D~l�m���O
Ϣ��-���~)�
-~:H���^�
P��%�\LFC�� �ӡ����g=�'������"�Q��XJn�b#�B;p�uhN>�A��[
�����ѾJ�m����A��'�K at 0,�.�)�s�
?}R��kA�js
�� ����?�}.�G�q��I�m�2  �\���B�� Y����e�/�'S������9�J�BS�
"%�)q
Gb��7����[�'-��9�LU���}i�ϭ�f7��c�2�!u���˿�$�
_�
�Qyz���Z��Y�yMQ��~w��gv�;
n���`2�
lt��]*<�+'��'
���C\`8�髮��!Nu��9�͹)@��oV�/B�����/��r¹g|W�~dQ��
�k�x2d2AE�+B��L�[��2ҫȟ>6A��+����SY����"�vf|��T7�G�=�}K#
��a	�3_��.�\g��������K
�Mm��
��L at y��D�� �V�En�#������jv�j4Y'��Ϝ<g]K�E�o. ���[ҷ�c�6�X�?���
|��'ai�T�`�um1s
�<e�T� ��;F��|�Q؍�
FV:���OIеp�B+�?�y�`~T%�e���f�;AR`9x�෽_��u��w��<�����t���V�J�b��ĝじŞU<�Wq��o^iޮ����	[j�����Rs�
�������&�P�o��L�Xַ��X�=���2���$���@2�w���
T?��ܞ�f�kqxA�N��V�K7vG�-�b�2������|�4\�(?PU�����?P{;3Km���q�m�fa�+��|-�Е
 [...]
(
�*��P0��Z7DOy�$+�D����j=���2+1h4a�sg������
�_���n�U4��>ش�)��me]E�a��A��6�5�R���]?���L}��з��Ͱ��s?S���k��K`�q)�o�Ez7q?
r��1��ZˣD|ER����]�ԣ��F��˅݆۬�.��e����uB�������gA��T����'��]l?�����
�����-%�Y��~�M�T���KC�j�LB���87!�
-�0�	.��{�{f�U�D�8�V?�a�U��Jtw�z�Ȭ�zX��ݎc���ڶ�
�A��tՓ�xr�R�~�>��@���7f��e��5
CR�~����S,��r�U����o�ce��F�r��fuLÄ#�QGێzU�)�.O��3G�
���2T��`�
fzGν@b��?_\���
-��!�ޚ��0a�?���kL�1����p^�X��{��J]�
-�]ZN�1x�����+�u
���M]�x�&�ͪ�jav��}ݕ?���u8�y�6٣qp���
�s��fha�2?��n�n�Y2�w��~?�%�%��a}�"���Px�v�,��n鯧n���2
i��0�\F~��A�&�����.U���(��I�e.�����A��qu�S5[�)����x*hB/�f���%'ۤ=|�əc
-N����C�W�~�n-�^�
-�ʩ��5�3jdMd{ff�(�r�u[%Ŗ�xhΣ5�3�%�7��)�ڀ"51�V�
�J?�cm�l�>���[$��1�[~�����Ix#]��Z���ތ1��e�K����ekN�r `h�`E��V[��	�]E닛&���Ƹ
�	%t h\�R�)]�ƉM�^מ@۬hK�
;+0t��}���4���
�?ԨtR"���/j���r��E�G2���P9U���V��I�zx
-
-_a�GO�Oׄ� ���rF��S,�!a�X]K���һ8�|u)\E��Buw�aG���N{�8�/� ()z���[���s_B2b���q[����%Dߜو��,��ҹotN�g��$f��?P*�1
�
d4Cճ%��Dfc�Fz�6���`G$>
>hZZ��k��Ĥ4�g[L,r���aE�G֊��[[�.�O�q���Y�pT?`��p�
-�����{�熜�cC�%!k��$�(~�L��f��@X|b.4Y	5��&�)�M׬f?0�m��i�#��VyE����?�g���{���
�W�&W
-E1F.�����-"�Β��e��^L|���6��#XD�K�[��;�N�M�ŵ@�z���zd����Q��S�V�'N� Y�&o���d1[*�D-��0��TX���b:2#w���on�+�Jq�d�y`���\��Q+��Ac��������-`�yLG at U��L�Y���E��^����Gm��*� �v���'�
&��
-�:��X�yr���oRwT��፮�t�q�X�
�Vɾ�

 ���T�y������/���Bd��}zae�Ý�Q� PJ�Kg�;a���4/��.�gO��Ƹ�#0���[-Q#��&��aWF�t
il��GܛEpq�2��U�7�K}5����G���=E�C�l�ǯ�0Ƿ�f"w���#PaT��!Oq�?� R�m�y1���"�u����u�z�繼�f�n�k��������1u�t�a��胞9��[��rg��&�B��u�i��9QN�ړ?�DI���'6�>ˈ��&�M
�-���+�
�p���'d ���>�t�9X�퇨K�˙
�X*66
����DK�
G1�
-���_s��t����Yd�+�9&mW�1��%�<I%�d����vM^l�i��@�X�V1�6��p��W��X�ҘO�
�8��^���w�v��k
-�������A/��hx�s�rVZOh�y�]����Nr
�"� ��2Q�Y�ĭ�d♥A�f����;��6У���I:���$��{^�J�� ǒE�!_��&�.�Ԛ0���{A�jf��tC~�t�q|	�K]fQi�x���q�c񆔴D+8K
-Ff	W
�ԙYv1����Wם��;���Pd��]�7S�I�$E��w7 �٭��,7neo�~�6���a𰴓�Y6�3�2�ݹ�{Ǘ�D�;������
�'��e��
]ֆ��z��}f����g+�7��6/�t��}�
�d
~�6,<T�$�a��H�Iv���T����L6�:RRbx�eP_zw:8�CB��ɳڬ��'<�(
-�f&.�e�*��;JH������

�2Tد�)�Ts�*2c EH
�����%�	
p�:��Gٲ��܀�;z]ց� xÍ���QE<�i89�a��{٬&�CM��E�	�b�/����`(�ă�n���O��j&��9SV�{��J��a`e�_<H����X¨O��U�O%w��t߸��j(���q��
��T�$�QS?J��s7?&@T�`����%��`��3�0���gI{������v�q�\�G�w�ЬBJwKL�9��F!��M���w7'��\|sdSM1[k���4h��
��TJ�vxa��&N캜�Xs�øU��Ӛ�՘�\+/�qR"���K ��H�- ��aE��M.��pc�}hY�;�N��S�� ���%S	� b��)�7
-endstream
-endobj
-3383 0 obj <<
-/Type /FontDescriptor
-/FontName /HHESAH+NimbusSanL-BoldCond
-/Flags 4
-/FontBBox [-139 -307 822 975]
-/Ascent 722
-/CapHeight 722
-/Descent -217
-/ItalicAngle 0
-/StemV 114
-/XHeight 532
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/Y/Z/a/ampersand/b/c/comma/d/e/eight/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/quoteright/r/s/seven/six/t/three/two/u/v/w/x/y/z/zero)
-/FontFile 3382 0 R
->> endobj
-3384 0 obj <<
-/Length1 1641
-/Length2 7476
-/Length3 0
-/Length 8314      
-/Filter /FlateDecode
->>
-stream
-xڭweT�۲-	�

�஁�!x�h��n܃���KpwK� A�k�@pMx$��s���?����[5�fU�Y_�nzj5
6	s�)Hbc�b����L��@{%�7[sI���<
h
x����%�@@b/���: s��
��
�B�HB
ܝ��V0 ��[
f�[~� L��F�"�`K{ �Ӄ
��`��=Q��5@  �
-� ۂ ��jz�*� &Y-�,�
��Ԅ���-�
�6�CA� 
������S��֠�O\P  u ����@nf ��+��d�B��`(��	h{� �7�u6�]���� 'ȓ���D�� fN`�)����_u¬��߹��' �x�4��9�n��D�€`{( r���e
-����@���OdN�?e8C��������:�ۂ��'�'�߷��>��{������h��� �AA��h\�O9�`O�-��h
�F������n���7�r�sAL�g����9���
`�@�P���R��g*���D�H��?"��N�j�_^�����Ojg[[��� ��h O�
-P��5����w���+l�������M�?
u@������_���Oڰ	�
�eCe�n s50��
-`�}��?v����l���'u�\,������������
|A {���$؟�9�dtU%X�{�����<�4�
@���JGb���o�7o n O6.^
 �� @�� $(��ߤ�����2�v�s�srr������d�i{3���Ҁ�͟f�_�߰���ӓ���S���L?�2C�:1	�N�H���
�I���p�9��k��UC�}SCׅ*L
j��>
�ju�=p����rg��-cw2�8�ܛ��7w��]�e�=�Q	fڡN��Ɍ��;~N흍1��F�H��y�PN���h]���
�|�R�b;p��j
���>
v�"�n��dǠҋ �|��a�&N�f��\��o�޷��U��VY=4]�	����(�����)2W��\�I��8�WT�A/��i"
-�S6�^�*+3f���M
�rI\�I��ҡ�$7��ns�N�e��ޞ˶_#�g$6˽h��%,�
�kT7Dy���ڼA>0��5�@���V��U���K�]�P�<
LG����_�w�kMno��4��\��;h�����6�q�-��E�Tm�E;�m�_� )>w]�׺OEc4�u�^�~T!���9�D�7z%|ݬ���&]�sO�/-%kU3�G/)�
n�/����<�:��z��b����%S������YG��E��	J���5#Z�����aB���_Q��r,�Yf�
NԦ���SH�v�o���V릫±5;��03y�H.X7؍��>�o�~ H��睒{-�,�0��pe�ҩ�d��]ӥ���Q����k�
�|}O�Yc2����VVTJ7����/�N�>����REhF�'w+��ꈉ>	����}
-s�p�3��v��,Ц�@���Q✆�.W'��K&�ѩ�����oc1;��"��a����	ɮ/�_
ܷ9��
��L2 +{~�i
�3껮���������x]����|)-{~��ݎ2���}-B�8���9��=b�VFZtI�˘��:6N�4�ә�9E�wY�����#G��~�2��mF
%4ߘwhk��V��*$P�e;��Q�(�ύ�f��ى�;k��]!�%d��H��{�3�\M��čnn��V���Y:�
I�\�3��#Ÿ^��`]�\|������=��8g�!��L�D��מ���L�ΆE�!���0kF�W���f'�˺��o�T{J�Q*���
�I�=
��}�=���v�HӴ������lh+�p�qHP��E�Y"hw;��vh��]�ę��^5���ѝ���6yv���f%�.^|����[���Gf�di��]G���1�;�˲2E��
��3�&;'�L��/��V*�׋ke��$�G�0T�P"3#U�G�	"���N��\0�=L�ˬ�$S�~>;��Ր"�
%q�1��n
1F��U"jx��OT�
-W3	�����_�0���H�Ρ
M�G��]��m�|��G���v~u�vwz�S!��`��U���Iv�/V�w����uo�o�# �r�Jc�,�d�����o/G>����T�fMgE�v�ޯ��,~���N�k�h�,O��z�����:/�p.h,��l[a��'Ur

�"U=B� ]i����(Of�u�֋Q��(ǹ��EQO�u�
��Bi���"B�4���?
K��@�Q½|n��\�b����B�
��N;U#�
(�j�&��U��\�=m}��'5"�s j�����Q&��I�e��)t����Q�΃d���R+d�ijk8�WX�t����W�!��ױB���@�>|����nZ�a�!���r�}����a��H3��*z��V���!�
m
��.�����7����,������������"��&�l����}R�	��+�HȒ�L}@Lz�]�vi��_�9G��#����0;�E��6#@���O�
[O�b
-5�^ZS�NHI�%y�!Ar�m����ߕ�p6��ۑ�g
8~�s4�z��
	�u�׋��
ɺ�d��
Af���LN�*l�o�����Q<sn��W�rK�:��R�e�ל[���7GM�����s��c�-�r
7�T����j�z�֒`n��
.y��CKGG�
��tX�Ƥ��ޭ:��A2�ߍ�p�~j�L�af!o�qi(��@}[����B֫�7�xsbDr�56YbE��ds�f%�
-0��h�3'��8�@+5�KQ;�/��&<%v

���p9̅�STgg��%���=�3�� <[B������-#����B;��k�o����7��B�# �+#�;~�b,�Jb�q�m��覕�>F��Մ���s2w��@�O�#�
��5_�.�����A��-[
��/E�w��
-��Ys�9�*�N4
�]�7b��|@�!j/�9�/����E�J�8�&}>�`ux"�C�
��
Df�����'~Tm�i�B�u7��`��b��������zGO�/O�Vd���y�&Z����z�w�\��5������r���`�9��L{
�B
���c7x�7~���-� ��)�6�S�K"��ě<
-���tt&�ν�#D�
���a�-��p�ZrnW��6�Z�
�n0������ܲ7��K�
�LJ���@�$�˿1SRיo��IPd���w>�g:�
]�5\�U��:�E@&�Z��̥�盎b`�j��
3
�yZ��S�$�3
ײ����S�V��S��J�B�4�������#��ǝ��M��R����[\��8ңA"΍���
-[zL=�wm� �
z����Vy&������w׈�r�������6�u
�(���d?F�WLo�"ˏ攼��&-KxW_ŗXk�aw������k�~[�Y�����2'��Z�gmI��DM���Ap}��ptȟTb�0�{IP���.$��*�3i��Bfi��Vt��3VV�`�Z�
�W�f�(�
�͕�11)�
-4��L��+t�}eO:qӎu�9�@���V�G�p5�Zlbe"��wk:*��[Q�8�<�á�)�����-
���8���F�(31��M���a��Y�95S�'37����w�{����

-�}S�
q�er���׭[�����r8Zgl����)K��D_M&s��E�>t�}q�ʮ�-��#�w�h�|[jF�U\��b)v�R�����5�[����OT�iɜU�:E|'�v[?�Ѝ��DC\��lx�8�G�!;�.� !
"��t,U���� Eث\4.mtdE���e
-��$��?2��w�E����
�X=��1���(p|����a����rZ��%cw2������|

)�=uiw�$d�7?�
'���8��=K


-�8�a�
�X*��!kv1@W� d �V�h٥�7�B��ڐ#�����׀"�|#�Y��!77�
G;m�~48���
[�*�2�{�Y���2���^���LBh:��&�>j`�����\.���S/��dZ�z���&��gm��U%G}�1_�
�}��'���&���
_h{�3���b��X�w[�N�7z��r�j�žJ�
�8�B{����lb���~
�ᩨ ��
2҆)��0O���|] �0s�w{4�}ȨS���4��
m�odR�>Z�'
�-��
�4��3�%P�&�
sF�֧�N����7��;�[)�&-�e�Ol
TElۑ�T������^�
�r����|�R;��
-L��&�
��L끐��+e
~�B��k8�k�J6���Q��2/_�
�m���/�xQ"
-����+=�0_9�^=�*� :��FD
o~�c�M��
�O����	��
���8��� �
n�)���E�K};/�4�ʶH|�e���$�MUV
�t��vj{�ҟh*�#�Oq���n�>�p��\��ӡ��̮:��9��q1($)�cR81$��74�-�ݤ]�Wv��r,/3��R(n�=A.V<�&����O��3rH�r�Y���6)K�g�d��W
og�����**G���ƥ[
!�jɷ���D^��P|1%���[�ш�{\j�[���*�"淁K�����ߋ
���(�����k�8R#i��߅���B��|SLI��F�;��G��/�
f�^��
�W�UǻJ�4������B"�bHAENtuq��
lf�T;Fz��E
-},�Z�1Yp=��9	�.
r���&n��
���N���ޯ���j��U���
PL^�~l� h���	r�
g�R?������W�u��Ҵ Q6�����@�]�ϼ�⧇&��˒�Z�"#l�$ޝ��|��G0��7t�w/����8U]J/�y$z{
s���w~��
4
�t8��%�[�H;!���s��L��g:��*����
-�$}h�|�S\vs��k���l$u����0�(�Ps���dv�
��g&ۦ�<D&b
���
�w4;�lB"��=��m=��,���!����Q�k��� 
-a�h��pL2��*d�|8ɫ�K�8%斩�퀷el�fHd"J2�x%zN(=����Δ"$��f+t"���I��Z�� �$�;�}�X��Z{IyށS�njZ�>�gyg�W�5��"�����IZ$�T����X

����~?)(է�7&��0NKq��DG�-�(-�X�k�L�K'61D��p�Z�Y
%{�*��me��f�~ �#�;��GY
�
;�-�ƹ����6�ϭ����-�6�rx�V��Y�!�er_����+>���\X4�
Sq���߂��Evԛ�e���, *#5z�v����US����۬+�b2�E

1�}��E�:�S[�$=�@���[t\���Ӵ6�ZU��mt5��d�B�[��)�;bIX�6l�S܋b�E�g��������l1ލ(
�f�>n�B4ϣB�
�SՎG
-�ĪZ�
�SB�:k��E"tyH�\�
��>�\9o3�"����ud�\đ�Ɛ�����8�	`L1�̔�+�q���4�1�Y��Y�6�d�45b�=\�D�Z�}��8b/��?�g�8feNw�J��7̼��1,�;
<B��9���̹{�|�x��9b�Λ��/3.��O匏�am�/Ǡ�Y*�gY���0�N؝9l
�����,�S�}A��	a�3�,7�5�)���##5j
�U
,o�'Ij!�y
�zȖh
KT��e�uo� N��bh���A��ĕ�;f�qh8�;���e�{J�wv�ȏ�=A���,����xWR'�S���߇,ȉ
،QT>���Cybɂ��5-��#�6}�fQ�_]<��.s�4�̮�&}yFo�k��<�#=���Pa���ҋ��h�ìB>����o���W���*��Gڢ����Z�z퐣��r/��z�ü�+�3{�1b|�r�������8"��
-Q��};��m����[�a� ��sgRC������5�c_�ܪ G�+�O�õ�TD��]f(M`>�,�t���i:��5ڠ)�vJ_c�_���O�s
]���0&��
K�J:�h)>�����\�dV֘N=Խ:��&='I�\�ы�N܍�֪I>�RU�%n\�1��[q�;-
\�(;W֘�v� ��!���ӭ61�Cc~�JcV�B���K����{K1
�w
�����nȤx�m*"T�b���w9_������f�iYP�|�M�d`l"�
��r=��B�%�������#!ι�u5���V	˻R.��Yx|�Z$
H�0]}�F

�������f�n�A�.2�q�+�#�ijݝ������+�g���T{���+�
�Ӗ�eI*+a��vh��g����An�R#VB�_���
�Nr��Sv���>�e��aDiy�r>�Y�`�<��)�mU����^R�����&G ��~U>4Mغ�)󧄘C�w�~X
5�V��>�M��`Q���׷�V�VZi�����q1�
>��{��S�K��n�����#h˹D��	?"5��T�����W�Fˊc{0:�c����kR�)Mə�QH��2���f�g4-tt�>/��
Ur��v���十F]'�
(��?����?�xULu�P�67b��頱<�c�A��7��>�W	�^�9�NI9b򢡅�D:<�����]μ6����:q7�/�6�8�o�3�u	\�ۨަ���
�>�af��6��a�m�:�d#�2	m|,�`�ٜ��am�)Z�_ʳ��f����3����PA���A�g�{XJ̱�ӳ�

�6�q>?NM� ̱qY�d.X��~i
-w�7�v}��fAۡ�'Jb� �j6X�4%a:�(0Օ{���V}���;T�=쭷�*TW���~)�]��JM�H�	��k+<R^�n�]�ќ9�dJh���@��c���ηxl4z{2���&��\�N�u6}�#y?���v
-
��ۢR�z��F�5���
��fZ)J
�^����~���R>i=�t;�e�N�
���	p3A�B�j�;-�#����?}��bx�F|���
O
-E��Z���r��Yx���BHFԕl��$9�~T��ƾ�M�����.kb!�M�Y4ӡ���7�4ZɆ�j���s��m"��l�ŋp��y�+��*(Ug���x�y��铠�
-3�O���'c"}*4ެ�=C!:����,��\F�@׹%�C��{�Bz-10"�BB�M�`эB�i�U��jUh�z�e�
q��gڼ��B����Ȯ_�� |o��n��O�����~��Ǖ�s(
�̀�dr��f�?����dsH���kR���
-s�2�C�%`KlL����B��N��oF3tR>�۱;R��
�Bu��턥�ߝ�5?:!��^q]��`�)��4f�9~Ѹ�1laˆ�1�:Q�?�Ð�Un���?���;����ԟ(�;Gw��@^�7�'�� �kA�e��c��: �g�We?>��wA6���(^�Tp)���o��t����n��&�
/E|�6ߒw\#
�,"/D�$�uhzA�
'��K b����+�&��T�%G�{��
���
�LD�\Z��炯_��gɦ��6���b
��n�S�>;�M^x�Ā���&��6s5�p��������ot��좁�|枯�کɻ$���������Q@(ܒ2�
��
[���T�j�
-.K��c�֖걈G�|R`^�j@?6�Qiw�(�%�c竑���K�
c�RI)-��o.�$�]sQs݆�>tc{c�ҿDo�BE� ��P���V���%1{f��ㆁev��s����&����1[�퓂��=��-_5	
�@�.�1#:�X2���䛳����5&8�V�Y��������~���o��٭7T!�u�S�%���a`�g
Hur�f���(�|��>dȣ*���O��ksh%ޓ�cZ�o~u��g�t at v꺯U�"���p+��p�<0}�u|0���L�Y[o/'8��A��7z���0�������
ҿ~�SFWk}�b�׍�O�BR����b��s�k�.0��*�C�V�t1Yx���4�K�G	k����T�,�O��ԇ4-�w�\+f���
�
�W��9��Z�� ?����*ōuS�kl�I��
4��0�_÷
�C�8պ�/E�����a����j�e=
f�׶���$4 ��8ƺ��9^͍,�V�����=��A���A
�$��w;_�`CyT��fcsЗ
-+���ٰH��rU�
�5��`rvVی�
wV�TX�<	��om5�OZpșm�E��En��
-Z8�� X�5���8ջׂ���HB�'�7���rx{��M��^��,��ie�� �!�
-endstream
-endobj
-3385 0 obj <<
-/Type /FontDescriptor
-/FontName /HJFXOA+NimbusSanL-BoldCondItal
-/Flags 4
-/FontBBox [-143 -298 913 989]
-/Ascent 722
-/CapHeight 722
-/Descent -217
-/ItalicAngle -9
-/StemV 120
-/XHeight 532
-/CharSet (/a/b/c/comma/d/e/f/fi/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y)
-/FontFile 3384 0 R
->> endobj
-3386 0 obj <<
-/Length1 1166
-/Length2 6174
-/Length3 0
-/Length 6943      
-/Filter /FlateDecode
->>
-stream
-x�uWeT
ٺ�݂;
!�4n�%��i��nhww	��=@�]�k 	A
��̛;�νoՏ:g�>�gW�U��5u8�m�V (���������t,!��� ;w�#(`���.�������,�`(D����ڻ�,a ^ �(
-�y\��
-��D�0�3��	��`N`�#%�vwA�:�..N`��6�
����l;�Ϫ Y��7
lg��i볲�s���� ���b r 7�
��� 9A]~WzL��
���
�ik)o��
�b���rs��Z�
1.7[.���ب<�F��;��o���0���P���������l
���1���
�
��R����G�o� y�"@^ � ���]R�����������@] ��Nn �-����f��a� ��K����`���@v���w�Gd��^�{��\@  �������@m�'���-�A n
E]%y����(�cJN
!~ '����S
3���3㿴�K�?PMK���	�;��
-�s�G
��s{�&����=�:�X���	P �����Կ���X�������*,�x��
�
-����%�?�-��N�����t���G	n�����9�K&���
d�	�[��i��T���=iB����d '� �?8]{��#���xP ��?J�C��6`�
@��JK�Ϳ�ߴ�;
�(����_{[�c� ��ki
j-���vU'M�ɹ���WP�����+�	q�
�G�ܱ����pj��樽D�1�2bD�|�����L;:!Q8!�b4�׻��8',�?���������d���+/
�IȎ�D at Ii��vv]5Шh+��15v�YEHoB�4��D�f�;�!���ʝ�S���F���D��s�}2���/��
'VT��B�
㝼7��*R
�]
oc�wθǰ�
��⠑���Y��#'�Pu[�Ơʜ+�k�b�^䔆X�[�z2�|�)��J�����c��
�P�3;Ӹ�A�}י/��V�MG�=d{:T�6��Mh����)!
����~J:��E�/[�
D���7Z�;j�r�1����L�
���1�rhV^��.Pn�����}a)xP|���o�RG/w�pҩ��z�8Y�����\�
37\��`A.���{˘�M`ύ����˜l��Ʃ�`Ȉ�>�õ�3�h��m�㋑?�+�؛[��������[:�jʏ�B�)dVG(�M!�߹���	t���,1�;4�J��-:vP�>�D�a
���O��q�1u����w_;��]:KD�p����C�J��.0��i�+�$�.�UG���V'��3�_��Yى��,�q���%�{��FJS:�G7�M��u��`� �HObD�GK���K�w����	��kq�2쟒���� )��n����J�!y�R��ۧ��G�(�A�ة��N,WndS�N���J�@ [...]
Z�†��tj������E��&k�%[
c����
��.����b���=I�܎���I����0�zl��1��	��>��KR��Ω?�ʓC�vgk��XL������ι��ث1��� �|��S�2��:��)���#3ox���u�E^vw;����=���zl���>qF�
!����ݸ���n�����X0K=_���%���Ro��[gR��y�)��HCD�g�'��N��Dg�uE��՜��d�
-������Z��{ɳ�ɜ����~�h��'u�+��QǼ��F�X���sX��gs�isM͒e�?тU	��@ܤ��T;���
*�F�[������N���幆��5���6���������[w��o�/#��(v�S,�������Mًf0bl춥�+bT��]�yH(����Ďq�Ȃ����*m�/�h��2���5��c��������)S)u_qz
�I$
Kl?��V������խ�������
�
	T�MJ*���G~xgu�h�FA���[߃3��p���ςA�y���6�
��	M�x�*�D�q�Z?�
C�y�06��I:�����u�����
�hf�I+�g6ъ�k
m�.vT�T���M
-�_u�hx
�ѭD-]_�j_���t�tfΔcmHI2�0QS� uR�R=〃��
ރ.=�����$���1�}�9�/Ģ*LVƮ\�Jgy
�Ӥ�9�1�n�Y~��2Q\ ��%��ii���_+��
1�b�漢��r���&�
X�~�L&l�Gt�|���͜3y|��7s�c��Ɖ?�S�=�SKM#�Q�!�y����I��

���f�R_3�p��v#f�͘9��b��Y��X�z~+!�+����qՍ�`+)oX7^nP��n!��Hw�?��
z�Z���w;9���k�#�9���fƔ�
ő�g�����SY/���O"�@b�
-L�>�1���c[���
b�o�����A�]���/��
�)��D���,���0
-ޣ�v%��g�"��L�����c�S�*�$hN����ծ�;G�
���{	���75Nt/�[�
ɽ�u��3+\+j���"ݺ��TQrş����HJi�d�g���,�
U2��/�=pl�9�
}9�<�,�Ǩ5��
P�7��K㢙OU�h��z����-��Kb�"Z��a���A��"�`�זC)xZ�wG��=������
-P1�ui�m�l����<�<�����-�a
�\*��@�*1�W���*[;9�H藸��� |5ڼA�hE*�\SRSԚ�t�
�z�Lˠ����<3���2��2�W���u��L^}_����ݱq� �����/�Ǻ)w�ïXu���O���
�������Oұ	�Z�TpG��f峑w��y񲎎W�+�_F�?{~�O�6�l��*U�*���󝻌_�M�
-_���nj�+gjD�����N%���ګ�qW��D5bo�#.���w�dZ���_�$l�������>�^�w7�	"R�K��h�T��[�
~�y�*_�u�;>��XPO�%sz�7���aF!\4�Hn��x�߈����|���Nk����r��s�v��u����mL������VLJnk�
5ތ�I[n�z����R�h��N��qI�����>8���d�!�[;%���o5^E����b�u��
���Qp���P�ӢS�S�^�X���N�
����g/�a�����<ΨB)5U�Ё�oC
�d���b��J��y��]HϺZW�ӐK�&�\c&���I$r
�N�&��XSy^a��,7G�L��$-�>�a*�đ�#EĹK#ᎢH�	.���
�
�u�ld-^�̺��.1�
���(2��V�
V��n"`��x�u�����](��eV��a�Xt������y_ ���
$X&wA=2�%�?�z�O"ʦQ�;�q�7i^*q%��<TM���ʡ'��po� �l5��|�A��)f|q�V�߳��
(�9or�y�!�����	���e�����f��G#J�!��iQu��I�� �H
��
=���^,�[	W�#�քR�޲$��I���1��g�� ����b,�j�G��jg��	� S6
-��u �l��5�����Yu3P$��[7U�u
d_���6u�#����
��H�y�.펾	E�c&�)�ЌK䰏I�@�
���)��Sڪ�c�vb/-�6H�ܛ�Krv�%�b�̨a;��+��s�t
���f��UZ��}j�* �1�s�����'ڴ��p�Go|MQ��	�c�����)8�X���y�g���}�����]K
l¶�h�y�9yrf�"���6\4m��@����Lۓ���%_�L$w=/�/��A�֓�.9��Dii<��-dE_��=L���`���5�
����;�9*R�1߆��(�,��%�ZR�t
����|��W�~P���9ᾃ�|�1X���˖�D��Oqâ�A��@L�Dt3��A�W�1����4E6'6�(���Ԋ��,�5
��z�I�i&�_.�Y�P�
-un���$��K4l��V�� �H!��D�
�G�9y�"���$tצYF�z��Fr�<�
rN=�5�G��c�lqqpX����3$�����ȉy���OC`}��[<?�[58!��u��~(1���<�ښ�}V��������J�#1|
q��]��Q������~�I�ޔnL93
j�
-�mW��N#z����ި>T��_��
��7�1{eg*�g�U�������H�b
�r��
t�̟��!���ŕ)�V5���-���I��Ē���7�v�{�|t�T}�φ�<���+�%��tV�(�i�]�0���ұ���t��awd1��l�
	&l$E��=�y�N���/������+rτ'��,gg�xj��g�z���~D�T�D�;�mϏ5v�"���cG��?T���
�)�����a��ը�8<T!���,��?�
(�moF'X��mYDR�ԫ�C���[X�M�c�_>�D	q�MޫV�x�D�B��f?�z�j�h>�34世qpLA��aP��o9l��F_����O�f��H΢G��Ȋ��c���T�Z�������8m����G�5��W*�
� ՗ß3u����j���!�����*�Xo#����4r#�کA����n��܇Do�	����x�]�*(���qX�����^Mo}f����J at f�%P��ɑ]䍌g���8�M��?�ޑ��@M� ���DHq`��2f�2�g����
-���ed�
/�#Ip7n7y�T8]�q���鰊������^S
�La�4���Q�&
��8ܸ��7�A
�5=����z���P��	��j-M�:]�
-�ڧ�Ϧg��bq�����7i�Lo���-�P

K%uQVtcB��w�	�.1#4��#	�f�l��
����

��r�ǒ��#��kk���Ñ�OJ�+�5ч�������w���u��X߮>xߐ��;��=w�~ʪ�W����2T��St�j��ߣ��3������.
�I�i����p�z�
6g ���
-���������z��<l+�H"~K�����.�|,(�	��s?�Ut9�{z�`1��a��:���1V&����ϊ��M���l��	7��;߈�7/��&JA��o�j��W�
E��o?�Q�
�

���<�kp�����	�`��9�߅N!��9��< KsІ��>����W!C�_פHk�(����r7�Yj��e��h_y�]d&�N”�l
-�/ߑ����$�� '�i�N^Z3�t�zNN�8��ϐ �F+��!W�]�>
5��`�cUQ.iI�����m��%6���+�ҀpO�����0�^R"y%K���w��>7� �
V�z4��/�y�Ƒ���C�g9jYs��
��Q�Lo���	�����F���#[�譢�)�
緭�8��ߕ|&c4�������˺ʘ���C,1Bc���}�0# lRn��q�y20h��ޣ�J��
R��Q�ޥ�Y
Cx00h*��v|_��l�a�o��T��u����ꔥ���VW�#C�fQ�Mgth���6�n
-�]��f��k�Ĉ%5EE�V� 5%��$��cneu�Ӓo��a��3�36���щ��LO^7_*
�K
�ሏ1;�#��ц@"���V��L�$��\2�xV��
A,���ǟ��a�������T2�LjB\�զ�
�z
-
�HS��L�����?)7�����Ӈ^N)n	j�C0���>��K?S
W�<��!̩5�h!�TȦ�2E&B��1�X�O]�� nT��g���Y�#�@9v��5����@�����=�!�E7�|�Y�Wp�fe|�^��z�
���/r�
E/
�r�ۙ*
��su��]	�z�F��0D^��N�a��
����2��P�4���>GeP�-\ƴi�P�L�/�
-Б�-���M�hj���D��$���`8Y�C��;���B�+>�LC��g�j���L���w�%US�[e�l�Pu>�ۧf�yg
GS��?�
���Iௌq��?��lAj
-)�
lj|�ŭk;��0'�tX�PBk
�ѽ���N#��ļ� R4 )��P�"��#*�7a�)��-џ`��f�CbSm�\B�P�7�:b����m[�����5�Os
-?��
w
��yq��Yx��i�ܩ��&h��F�����N}�
�������*���
-^%j�	~
A
-QI߼[��Bg=B�Q�];O�=����o�
B
T��?u���q;��T
l2�qHRNR'�wt��E�W0��վ�

��C��v<S��l�i
��	�^=�t$�ɇ\��g{�xm������@t�����')pQ��C��$��ZRz'�C-�d9��i�Ng�e�N���[<8I�4����}xj�0E(��󖛍�Za�njG	Q�]6���)g�Ȉflؒ���R3�z��2�s{?���S�זrɹu��g�ǹ���G#�	_�B�ZKq7S��)��x�jf�Oi^�4յ�2�n��#z:lJ�p���b�����ݘ�/ƍ˖�6RHp���
��q2\�.-��ކ�U�G�^��ÿ��W;���r獺I���f��A�v
�5�Y������
�s�ضˡV9;��|ؼ�<�L �wK�Y�T�ï�Jr�SQ�����]=Jh��	��������K�jD�����z���K��*�$/����;;���,��&U/�èU=�~�٘{|-�xr���-����ME�!��33�f�R�Q8/K�N�B�ͮdC����ى��,�:�R
���������qA����Od�bԹ^e�:���mn�#�D*�����
-�92�<�ǘ��uge=G�)Wٲ�_<1;T�!�����T���LW��q
 ���~�����P,�aut��� J�q 
-endstream
-endobj
-3387 0 obj <<
-/Type /FontDescriptor
-/FontName /OKHTIE+NimbusSanL-Regu
-/Flags 4
-/FontBBox [-174 -285 1001 953]
-/Ascent 712
-/CapHeight 712
-/Descent -213
-/ItalicAngle 0
-/StemV 85
-/XHeight 523
-/CharSet (/A/B/E/H/I/J/L/M/P/R/T/U/Z/a/b/c/comma/d/e/eight/f/g/h/i/l/m/n/o/one/parenleft/parenright/period/quoteright/r/s/t/two/u/v/y/zero)
-/FontFile 3386 0 R
->> endobj
-3388 0 obj <<
-/Length1 1626
-/Length2 16210
-/Length3 0
-/Length 17064     
-/Filter /FlateDecode
->>
-stream
-xڬ�UT]��&�;w�������,<�Cpwwwwwww� !��ɷww�=��s�翘c��꩷�I�T�M팁v�N��
L< ���������
�
�<���gG 'u 9��lŌ��< M�)@
h`a0sss#�D���
@�N *uMjZZ�����0v������ s[ ������
���o���@U �d���� QE���
-� *Iu�$��`d
Pr6�� �@&@[G 5���`�o`bgk
-��5G����
F G{�	�o��h���`t�9:���
�F�Ng�d ٚX;������_��
��z����M�d���h� �w���$&�o�NFN��v�5���z�ڙ8��ҿl���:�l
N at 7�j� G{k#����&�w �
��#�����
��F��@Gǿi���g:��'��������_�v���_@N�@k3f��5M���6�"0��+Ҷfv f��M�������Q��3�A���Z�L�f�
-vNK���Xf��#�������[���G�r�=�����?SK8[[+��]����#cd
�{g r�����+��d����ޚ����6�O����ߑۚ�������J���
h�r2� �Y��׿�궦@k�-�/��)�����?lj +�`��	hk����R�/�꒒
-Z"�����/G��K��n���hE���	���sx�3sp�Y٘������9���%�����dy#'�@�o�L����|�%��Gq[;��F�������/�?fg�����������y �
h���lg�h����T��3<)����
9
d_ҠV��Wm����]a�V��8��������P��h�ۚ�'x�G�MFݗ��E��I{�Ϩ_��v��y�(�����q�7���_�C4��� w�H�G�����
��$�>��
����E��������P�5t�!mv
<9��O�o�D'wC����N{0�1g{m�5Q�8Ӧ�ty��-�
��*-�����[�$
�H��b1e皓�:�P-��KD`
��$e�/걽�QMNP!c�
f9��k�eX+k[���{1�N�艡Je��b�<�Yؓf
-���+�	�E ���N�yD��ϡ��{�^�
�b
�^�U�wM
%�ر�;E����#�˽�Au�=j<�
-��#t�O=�]�k̃3Z�@Z��C_={�n	3
Z_�L;�Nֺ3�����'�\	�c�x'\,���='���"
-�`�7�gz�'*�CV����6�`�p��'���m���n������Q���枧��~]d�Ò��qz�gS-�'�
o����t���"
R
w"(�1;�ݨ� G���C'�P����]c���3F�O���0�sB��iq�8Z�y!O���9��Vl���眞�{�`m o��ƒ��>oC���������{�����
�|X��,��
fH���=�k��'�;`z��wqM^��5;f���~��b�C����4Af=���)��6��w
��M�[,�����v�l&U^
�$�0�
����ܚ��8�X�n_�W��b�
���KY]�-	�ij

��	�����3�:fۗ�v�܋r��>�����§���ne��*�a}�y��\Nx�<������)4���7�����Ha��L�p��.9�C,�]��r��8E�)5^#T:�k�q��k���!37o�Ţ�hh��;�\�d;���o��+ڟ�L0����]����Y9ʪ4<}�?Ds�X]� 
�AΌ(1m������P����W�y	
Չ����<�ϯ�n��Ɲ��G��#����oA
t��@��p] �De}&ŧ��I\�7�f+'h�oߥ��f�'B;7�Ԏ$�a�6��,�|���ce5B�{���{��o���H�5#
�m�`E6x`F
-u�LΕ9�P������ru���V�{F�dІ�V1fY�E��6�ۿ��(�9�\)��~�0k.��Ӽ
X5�Ugl@�}�[��/�	4����6XL�^�A5�U~�]I�h�_p��]*,����3
B\k&����%�Wk��qe���3<�X�=x�̽�����"�=��ŋ
-m��"wf}/�^��>]�te�H�������L,��������,��ll���%�e��38\dzQZ+/���h�(I�;z!rX�[�dhy�<�
��Sָ.D
U�{	*Ѵ�β�y'"'�׺�2����;�x�wM�8
nUq|��uI>y�~u�JۘR��O~W,۲�]	I���0��K7�OU%���4y�K�^O
�d�)JXj���BLz�<��TIt��U��x� �ꘄ�j�,���
-A4���БWS�����s�l��xyRC��C(���uS��M����_���0&��U��A��G��x~r�
-x_��|/�������#J�>�N�l�r���:��
-ە
Ꞧ�b<@˨ف�;��2���N�64a�!���?>�����`ݩ=?��}��H�v=�II��V�s��`�Ƨ��![��᳍<�ٮ�S��v7�z�:;�znjr�`#K�t9��a��rˊ)���')���ip��'^=PÖCM����J���q��6U�XH��:r&x�_I������������(,@ϸ ���
��nkY���
J\I����W,�l
tҵol
-�zN;�F?
e\Z;N�^L�1uMTs:p?����l���h6KN�\��
��a;g�&���B��vst7<%,�Jl��P:(&i1Sb��3(�Rf��m�Ԗ�^��V>����g��:}�ɖ�^@P`/�M���5�
�N��q������WI
#h��i�,�\Y��m_#�:�w.���Ȥ�	
b�7h���J�3&>��5�����6��������
yЅ�ꡟE~����,=o� ���R�;��v��ƍ��
t� F��${�w��n�F�m`�k�h����6M8�X���?!�{zb�U�e�BB�@#
�����!��9[&W�\+�*�Y)!9H)m��M�&�WZvv���zx�G�!	�K5���r�@
��Q��
E�6r�?E㜲��
��-��?� Wv�����s���&аT�����J��V�[��ҝ)����s�-��o�Ď�ި���P�1)Y�b��$�̊/�I��D��$�v��Jߖ�uM��G������Dӡ�qٟ�5�B�,"8��V�-�D��
#��z%��
M��ҙc�w�]�3�e�m߃�+�	����P��V������:C���K
<-y;D��?/��L{�U2o
�&UM��Ĝh;�{ϧ�T����~5��4��V��˝�
x��5�T� )��|̈�l�S`ۓyJ	NUUڈF�ӢO�zFv��Ж��r��t�r��N�ν-޲+
�:Q�`갷f$�f�)Q�f
)=Դ/��|�+ՔH��Z��/C�<��Qʆ&;0r��Gs�h=6K9Uċ;/
�F��Ѹr���
���l!ph�.�=�k��k=�f �s�K���
���R�kK�
6zzj��1���#�h�}|�+��ݠ���qz��L���_Ĝ,]x�&��m2�5��SfL��Q"m�]R�>Zߚ��^�`�~�c���1��h.ω���2���A���}��� �`���X�=�+��%}���o
�Q�s�5wcP}N����L"_h�9r�oGyTU�>l�]:�
c��w )��l
:�8m���g�ȔNu�-��{�{]����݈^	<X�H�XcI��T���p�ZGv�+0���:���9*ѮU�
ݒ� CǓ@���N���
wT��Pµ1V-r�S�:���ݴ�x�b��ܽi�>e����9�*㺤bm$\r������~^E���D{TBn�.�b��K]r������
-����Y}�q�rÔ�ݔ�� �� �l�k�a�r�v�o�k�d'��<��l���<��
AX"V�,ƨm��S#��wh���6a�9,��������v����E \��-�4���`��0��&�F���CB��,����>�H:dP*
��R��t#��N���ILT�%�(�Q�5<��n�"egS;ب�[53���En�F쫬]D�IKrl��V�9�9��	�D��`��'C$�#�\�⮢�5�V�\��:�o�\d�.��ƦlWd2RW3%=�L:�—��O��<

qٞ-�#r&�b�URXf;�"6����e��JݔҸ��"�
v�\o�Ⱥ$����e�<~�������|�d����ƹ�)7U�)�z�RF�M��}?��I$xO�̎����6x�5����dYTݻ _�݀
-
�������BQ
g�~	�`c�u�MJ�]b�_�i{�Y��*W]
ǖi�qc���~>�ag�[��
N��"=kЅ_Yr+�%��޺W� {J�A��n|N̤�ύ˛�Ba�
���-�c�#���z~n��^��?���3����L
���ͩ�p8D
�uI�щwT�'��
zG22�4S���J�3�ʥ��#t�]S+�VR�F�k0?r�	�F 
&��1+��d
mG�$�,h;�g+:̿�b��vؾ�����,��
-��^o��F�us��U�D-">|0�X;@e�����ls�fn���i�'��+l�O]�� M
�&�����nw)��37�^x2r]5	��m0��:��.�u`F�����m�Z�[���-�4
��3	�_����	�/��53�񼶁�����xr��F�o�y��D�O�#���
B�@�G���� gs�cY�%&��؉�ʠ9r�S�
$���<)1:I�3M�Eq��G�;���̻J�C<F+~>\����G�A���
-��U�\&�@P�;i9�לDg%W���T��YU�C��+�BX�6�njW��_�O�\{�{���Jߦ�|�n	�x�����ۺ��i�
a`��(�u�~�5�PyU��n�
-eL���C�
UjE("�2���l��V��`g`�M�F�
-Dr�;fQw�
-O��†[�Z¤�~'�ӥy�ֵU���\�Y�l�ט
-E�TKKM4��̦���zi��#=8��U�J�t�2�x8��L�
\	�r_`�c�5I�R
<���քX6,>7�Rፌob�]��D�t��%e�R��9
��`�'����3�)>2��}�j�Mmx�w�B6Ȟ�	+f���&0�e$������qF��zX'�kC�Ë�Fn�g�I�$^�q�(���J�#�D+7;i
�<��Xt���d��a:g��[�j�&�wh��ùb�@��}���C/YEժݰ���!	��f�o�λP�W�աj@,͝?�'(�%vd7	����>�Ƃ�xC�iB2Wǟ���C�
��0;�7
��u�P\�6����y��T���
�կ�M����t����[-�y�����W�
W�Bio�����GNJB{�1QuI�z��
�$��]uw��N�ݧ���ݒtƳ�fB�
{8�.�~��
V�
�1kGI^�b��eM�������
�=�R�|�7.�b$"�RD
w�iߧ��k}S�-��hzn�	<G��B���˖�X|9Z����%���k:�i_����Pqd}Sw��\%�Bi���/&�n�u
S5�f�#���\����]��dx�C�4��GsE��Es�6;FЋ8a=<���Pw-�e7���
�����f�gQC���Y� ��3���+��y�m6�<��c�1þm�'tk]�*e��PM�L��]r0�b���=���W�[�0]�.�5

�_����1�-�G��1�p������t���
Uj������4�!
���m.>s�o?m���c��)��諣
&G�<�LH�=g%��Z
L_l���Gp�����yը���ن@�b� ��JC 9G�(�q�YA��P]�gh)���w�#�����M�D�h��oRV
�X�%���+������>�t�J�T�6�_���ix�d|�����i�


-�b��VV%3�=�y��͛b�YeM��Z2�f3��G��,H�4I��(��p��
-����~=��\qh(�R��e)�4x	�����E��2��Z<D�j
��'����t��~��] /���G��]3��&��N�ז�%QQϵDeDn���c<�
-�~�����=�~w�X�v\�*n��I
m�	��|V)�5�)���|��)4_ޣ&*�]��C��u.�ܳ)=�A6�j>1Ь-��v��
��-�D��g��y��m~)���_Q"{�J�0����C�\�ZC�li��v�歘V����
-0���
{J��p�ϡ�äy
)`u��$�3��5'�|L}_� 5�>N�7�l0��Lz��>V4��œj�:c:ՂK��lK#��AC~LX0~uZ���8M\���&�+���.t
E����E$I�Qe?6hK�>���DM��
�c��{HՉ)�RBO]�1�Y�z.�bp\]>��
&�t=�K���;�焋��۶J�M�����1̀"3����
�)��~��c�_�;���t��ɹ��GbU7�Tn�q�L5
�v%����j�⸟�4Qq���t9�=7�,�X) ��I�S���d0�
-����⹖��A5�k_j�g+a/�
�����@��1���c���Lr'�RoG޲V+��.1�}��ut�
;$�j��PNm�=}[wH8j-(�����#2�8`�'�*��Z
�$�O��1��xG�3�
5�"����x0�t�ϱ�koW5�i8
1�J����`P��`l�o8���V������h��9=y'
0���2�
���]b�xH�s�
�"����"A��Ã$VK���ѐ����x=�](��Ԥ�cSs�a�m�G�U�`i�'Z`g�
�9c���
$���F�~
��M�b�;B\��h<�Z
>yð�WA(��E����0�7�ﺊ�0Ycx���
���<��~�EhoN�A�XP7��7A�9�� K�
��6�ҵT)ق��m?=cg�L
Z�5�
��:���LL�Ǘ���Dv���
1{&\0��{�-$��ٱ���
��{�(�f�,4l��V�gQ�A��҆
#]�
�+�?jv��}2�r9C0;�J��5�l�&��n+�
�QV4_K#��������	*Q�
�0���~^�xe�A<T����d0�֣*F�o7�u�8�N�۪�U�Ѣ����W'�ΰ�H=��w?��1�[�dm�V0�U̸��v���8�/��{�WWQ���?�M���e�E�s*��
ѹ�8�ƤN��{���=`�9�͸�Du����;l��uI�`f)?P�߰	�Z�k�؛��b�*,�\ҙ�f6���&�`��a?�8D?v��Y��0y9�}�����g�+M#��@�DL�^�ݷ�b�V> ���{;}i0������fH
)uP
�D���J���H�
��^Z5���A[����V���������
-D/
���vbh��
��q�V sI��J�X{�
�4��LZ��W�%���Z���7�_ް=�������
Ѕ���!��Nx��p��ߎ��j3�pܘB�P�g6���9��uO����U=��O��r�΢3C�c.�z��D����Rti^<? �-^#�m[�,&�R!�@�m���
-���f������'#�B{�Z%�)HDb����NF
�#ԈPX	'W��Jl|Rd��֞� Fy���,��ژiѢ�P7$s��:b��' ٴH�����g��mN����ɲC�֌׮�I�%�;�mgэ�꿿�Yp
R�d��c�,�&��?́cd3
Xt�A�y)c���6�I�F
���f`��#�'Zx�
���L�vX�%q���'�k\JXo#"9*�Ŵ?'�YM_bsq���*>}҇8��s�_7��n(�F���
Ds��Ki\�ѻ+����

5�IU`���y�ԨJ��:��!E�
�t�ry�UU���\��ya��EF�
-
;���7Y[s�L٣�XG�zӍq��1Gs�u����Õz�!�9��C4!��<�&�l��^s>�
��������}���
-���2�D':GL�N��Tv
-�z�
��qC���/ ����5�4I�F��l.������4�L�<i��{GO�M�
S\�V/�H���/}V�&���w�zg���o	-���ÅkUpcĔ5ʼn�<��Q�������S~�
�R"�饯�I��;���Z����J�&g���0<h�:B ��L?k0��+��
:����q�ݳɍ�_8볶6�f�"�l�\`
������P��&[�TH�RK[���OOnvl�RE���-wl���~lugi(
��a�_��K�K<�[��d�e�;ך�
-ySd��&fE���)��p�u���N���7T4W\�]��1OR��0+�
0�F�
_z��IJ^��� iC�����f-��;!͵ɵ��$���oi��$9�C8/5�%�8��t�K���|
!9��L�3�e���i��
-uI��I�)#�VN��<�Q~�<�:��2D��#EK]���Fs���gt/Q���^�/��Ȧ��ϑ����fcn���/2Ν�
��P���s9qV�T�V2e%��YDFIb'�Y �G=; ����U;�pb�,�^ض��:�*G�zU�
�i+��
�P+�K<����V�|h�?��}'���,[�
*�qzh"�Rɉ<��Ƿ�
?u�B����ң�Ó�BI��D��Ru�Z�
/�E_t]&��6��{-7n�6�3�+�>�Cn8�ˆO����I�Wl�x�j4jC����կd'
=!7I�k����02Ϥ?>#����7(���ˈ�#��~�z�z=%��n�*�������둬i�p����;�\Z�W�]2�����7-��L��O�[�����P&�/f�#ʖ|�w4��x׉���1��&�N)>���H�M���|}!1H�J]��q̲��L!ߐ�78Ǹkno����D��QT�K
��1�ܴ��B���s
���_�J�3c�n;��Gm6lja�q��J̿��N�
-�j��n&�Z�N��.��|/��їU�"���)Q�( QbI�P%���2��m0�MQ]��^��_�@��8o�d�:"����]	!@��'�q,�ew�)	��W�Ѫ�
�9�"�~�"�4`U���趠a�A>2�
�X���8���S��۴��IUo�/
/��~!�?�L�������'ߜ�Ԍ�	�h{��)���ҽ��(�N�)���

/�j�"-��:lГ�J땭��I1�T�ob
-E����vs�d$�+V�b��������d�߁J��`��/iw9&���Ͼ�B��#Y �
K*\v�c�""��o��e�H��=����z$x;^���C׆3�>A�yMsi�e
-#��s�1'|����{���^B�+�.n�� ��/>2�)p>��u�W{�薅.�
���!b�z?
-�
s��Q㴄�n��&��; �Ѱδz�.4�
G�
�4�e���W��
-wS^�R2C�ըd�z�U�Ă�d4�4Re>K�8�����(!
�-�jVչT�=���à���?\��ϝ /Nڶ�-C%ؽ�/I�:��0
?:�"
-�;�,aZ�� :֝�l,�#�*`|�
u?��̘���J���n�����~�o�1��8
�����5*�`��q�j��;�*����h�3<��|����$�j���M�.zQ���pRw�̦�2�[:yVP��?C���H>����/Š.~hηH�Jk�)�T�{p5�W b���1m>�Bf���k2��Զ��}���1�
̀x�н��i�h�
�����Ŷ�`��Ár��*�5E��^�S��[�%�|i�k�^�	�/c�wg gj��ĕ�kL����JjPN�
-Ix/�i$�u:��i���^���:�fz��&y�l����jMPt����T*3�Rw8���uC�n�a�sP��*�0��>��;Z�HRp-���e�\�\>Ue�HL}��5�WH��Ƣ�����?���!�P�z��.�;���U��ǝ����
O�����J`b���R�맯8��J��}�n�� �#�
!��B�c���*`C��F>�fo.ʄ#=/(mv��;%|x��D>�ӝ0����b�ُ�U<���1�)^�7gB
.?����rM`˯�L@�i
���HL�Y.u�����W���X
�Jc]@�>��Υfx��z]E��w��򰮢wM�Ǡ��yA7��\�~�
sl�$���
.%���s|�@C�[M0�
�
��ur҇������=�ՠ8�V_Y�W<�<2Z.�ߐ����_˃��S����E���j� J�TVw��Š��1
9���l���&��Sw5uQ$�ֽ\bc��{P�����y��S���.#�5��zZ�q�zv�D
-�4��f�����`=��C����
���%��ޫ��3��Io�*�A���o*�x˜Ȫ����q�b�S�]ҕ
m�
�
~�Ri��|�<d�9�wI`A9D��m�/=N�}Q�0a
��\]V���/�{,vD


-{f�@r�_�hD���V1�M�w
B�v�'��z�f�L/K�.���G�U�C�[М~9��g7��߷V�ܤ�|I�6c�Z{�_Te�#s�Ze�܇}�{=�>J�c
�Q0*N�l�/
.��FU7q?8s�x��
��UϬ
-0sh���x�펟~����߁f����hs��o_�fw�7J2
L��lTg��G!�_��&Ō�3Y>�2
��
�
�
�
T�FxO^��|��Jg
|�t�<�T��næl)�#q�=�ͺ[ɝ�D�DoG8��rJ����7��j1����x+�3�j�i�/2�QŰ4q���rid�!��f�3ҡb��u� ��o.���K��:���c��9'�#=·&R���_M
-�k�P%��+�0�VӉ4�֍P�j����Y�x7� i ��x���
x�f*���
L�g��Z�
bTx>����0<m��z��Ou�aV��&r�R~��q�!��T^}Y���~�=�߆�^�nc��7�?��_�˷���Uo��0P�/5��r���^�҂���z4P�uJ�j�V����u�
q	��ń9(ڻ?�Q号ΰ��a�ײ����hC�,��N(a�OO�������� ���'R����F%�ș�K�cvv�T�����&M
�l����71;�������M����ʟ�J�
-�h��w�B��u��{Nk�<C���v��;�
-oZ�kU��7�5�"l�3e}&o�O3�Q�
-����_���8_(w��F��Oi��;T?������Z��!�x-�m4��/�FRҜ����F�iU��6�Ӎ��zt8�Q��w�J���T��:N�;A���\f��63G����D����B�kڬ������U�7ʾW~�k���k�71�:���W�2��	,N]�!��Ԧ~�
D�����>N�i���9�NJ
�f[���
�+�k�/B����������pU�|;�����	�����͌pL</�
��}vˊ��O��~}ˤ
GGD,/�2�UJ��[�idT��s��� ~��Ҕ���
�Π�S6��ߓn�� >J�0/�M���p3�'
-P��W;V�neq��qʃ�
-ͷӃt����8�4ONձ�@�A<�q�:g2�x¸�7ߜC���񯓘��1�+���#��(+��tQ�E�6��{���8_���nߔ���N������J6%-~�����R�2J7ɾz凿��n��>���e��.g at N;�C�Y֙V�“}=�Q��8�D��7a��m湸c>��!�|'qS@�z�3����@�Ӂ{�~�
���agk�O�
<��-��kL��+��
~O
��e�_
���� [C2�L��ra�
3����q0`ʥscWx�07%+�\�I�/�����k"�T�#%V{���	��L)絿�Ľf�#�j�c�c�e�n�Ѵ��ζ�f�e�
�־ʵ]:?��"�7�
�&����2v/K��
o��ӣ�}� ɻ�;��O+[/&�^=�l��&�U��,Q�@���Q_�HM0M2U/=Y� 9(��aO��@�}�����=�tn;��YS��K���ד
68,ߤ���NW��Nt�(�J�D7g�&�*E��N0e����o�)�Z�e������S��ո_ҷD����i�2O��
�P�4��COOb�YeeN���V�.~2��Ġ��tбR��1<
�U�.�['P�<���2�T#wG��R�
-�}n}���S�+�.׳ ����0ߖ�w���G�2�~؟���/�Ii��~�G�Co|%ޟ���S��
9�"��bUt�Q�³��Vׂ�"����6W���K����n�0�õՃʛ�KxoA�m�Z��f���;�ix����A�Ѵ���Ju��� �|م9UV�
-���~��,�=̅���+�3j��.�Y���i̦h�D&u�*ySf7M����n��5�oM	��)����uM��v|���� �d�k$&��?��6Ո`��7F�2R[s	H�^��Es��
-2P�=	��t͝<��
D��ݛG�
L�㿮���4|���q�(�U�/5��x�W������
�M�_�t|��jf�Mާs{�^����4��%{)�u����foEb����� {����7e�c����D�к�2
-
�ޫߨA<���A _~�zGڔr'N
뼄|�@ח5��:���c�OD.��� (0�/=���[+���%P1��[���R
����t�ibڅ����r.�q3
��Ȧ��d���{]����'i�l�ռVJ�I��r_�:��?d����ٞ0?�ij,[>�
`�>!�o�v%�ZB*�r8`R�ՙO�%CY�hۣh-u�	�
-����Bu���2F�<t at A
�N�Y˜J��d6��H�K�LC��N.��;xY
_:����*Wb��Ԙb?�d��
�,��ƶÆ��i;+|�w9����.�=��v���Fp�s�~o���
��?;`\B�.6)\;�V3�a� !����ʕ�����aul*JE��#��?bºC���h;�Ň6v�[��,=
-��w���Ո�| W/�ژuBM���8U{��Y�2/NT�5JNG�w�j��dx�"0��f"J��aE'.~��9u��ղ%R��6Y�j��'�b��K[�
��y�D��yq}�%B��r!?�5���W���
-��`��I����Q��Z���#�
_q�y�*d��d
-(����V�=y��i���9�t:�L��.4�_������~�GI��xm;c9L���}<u���~�qu�39-�d�@�
�E
)�2��=W�v���o���t�ܷ���l�
����U
U�
��(#<�()>/�3������
ۨ����Pm��`.��r��
7�	V;k��������B�f�攡%�q�0�]�����
d�Cǒ,
9��b�Ǎ�s�
Ab/�#
j��T.:����
�����l^�y
-���k/ٴ����iH�;����|��97Sʆ�0���?wv�8v?���q�DUr��"���Kr0	n�8
����8ma��#@.ݬ3�JZg�%�^�{H���樯�����ȧWuC*��ݢ~�.
:e����

����S��3��\Y�v���6�&�\��҈"�����Rר�4�0�ͲY��gE���}��ٴ������H�	1��::g�V�R�������=5"r3bS߉ �8�!5k�<��X��ӛ��� ���
~QY!���o��v>��%��_�`
���X���o'�/S�
�j�ޝ��&g��m}d�TǾ����vz�
)��zz��A��}-��U��s
��S�*K=�7O�2uڰ����r��ލ
�ś+�û�蕈 ,�>�����gq�t1嚡oL
?>�Z���X�_>,|>X�7t���ɨ
-ws��5���"��k��r�
-t[>�x%��1[���-��Z
-��c?UAE��q�58O�K�go�FX�X����U6�X5��� Bm��
d���N�k�^�K�r\�ѕ�N�4
-��ھ2�a�(̈}N� 2
�,8������1(
֓�A<�'̔��`��u\��.6�����9p%g�p�/���iT�_o�
��Ə�–tK��#�>�<���5�p��<�Yb�&&�ܯ�7��.9�
�0Z:h_?��]�SW(
-��ZV�kѮ�
۾cV
�`��\K}�~r
�W|�y�^����R�'b�`��uM�<P)~�Zdp*���z4[�1�K����a(���	:�!�;������&�Y����C�;��
-��m�;���͠L.��N��}K�XK��9�Z
���1�M��L؃�
-'7�7f$W� �y�jW0�/=sP�`��::ٙ��?X(�6Y~a��{8�]��W�
��
�#�����*�R��{�%��B65�����`����S��|�a��Q����
B���X6	d�P+�����-�"�D��3�x%�_��#���v��Ӈ�!J���;C��[㈵�
}>� 5�e�Z?(�$.`�0�
�̳mk<QO��	V����Ŵ��o~�qDY�A5��ZQ����
��A��2�����
���X�Ӆ3�B��M��&Qn�x��io�^%��l��{������a��m�b�
H���B\5b�5�A���$"�Q���˘���FkݨO����{g�J^���eP��^5�#�O�9l
�e��~�� E�M��	�C���YтWSR*�͖;����
ԓ��V�O����~ߩ�����Q��2����c�v�Y�
-��dd�!{��&Dـϻ���ͯ.h�d�U�	��rkH|D�i�`(�c��!�f�˅./��3m ���� V���-\��Wh��s�y��f��2��Z�y8`�L�o���r<�D�"ױ]�2]����hwf]�
�4	�3yʛ��D��_� �`�(������_����
P6�<�f�j-,�Գ��7GG���txX�ā��x�-NZRԵV�Y
-`��)�[O�=㾴�n��8�Su91E����(�#Ң��Y5Y�W�`�ڵE�YW�`L���_F��P[�Kf����������u��A���b&��{
=S�}s �j_��
��H�����
{q�fZ��X:��m��1��CҁJ}#]�+��P)+@������[��l�f!���ɗ�`�{*�z�w��
�jQ��!��R`��<9�i�V����I�2
�,TW����D��0\z]=Z+ɕ� .�j:
�|ήO_�DsnK��Zr���/U�T�
�F�,���&�.Te�v��◐%���f��B���J
��O�mX/�A�ī;-锨&�m_�B�I\�
��]a1h_֞�p6�����|T5^����+O1
���D6�BьA�&����r�����#�Wl�}�{$��ǘ:�����VE�,PLH,�X8��2���
-V�j1]�
-�
L��5��
��N�״V
a%�[@E��N���U�՜`��$�
2sлs%�M�PmFn���m�q�
���qg�Q}O�,#��I*!�{�W0��B܋���� O�v��~�F�.�
-0��i4�3Y���
-,�x\	"�ʹ�o���Y�k�����IXU+�w]�Vj\��К��X���9�W}���H<��3

#�Y��N&k:S
-aK)զ2%�]��Ch�T����뮇��?m���3�n��,g3���
-���Ť)Њ�\�?F���z�PhQ����2��*�Y͓���&�8F
o��D3�#ثa���`�:���Ky
��
��X�\z�JQ�n���rS
-��*{����E��p�~���}����9��Yo������� ���ؑ��s�&`us"���$m6�2�ZEJ�Zk�&hm�!�P�T
 ̐R�:�Y4��خf�)��"��U��j4�����c�5�ʢl�	�t��Y�hQ�2vht�f�
t�ڎ��/�$=X��
-B��=���n�Ti�q��{��dO6,
u��
�*��-ĕ"�HBI/�: �'�������F\�[mZ�H��r+n��C�vmcT�]�@7	���c�!1���A8t����f��6��ʷ%��;��Qv.��O`NB���3�'ږE.����C��R88�-�]g)3���\��9R��N"�
g�+�A^�� L��Z����\��3B(�k�p�߿he��L

�� W�:`?s۱�
|���e8/�q�:�h�Hc���Q�F�+�d�g��|�����d��~U[�U(3���a
��"�����wO�npHV�G.��ٽĩR���ձޠ�m��v���k��w������Ɖz&���=�B�,l�ʴw#��
-�=��}��.���b�"!��Q���@Ǵ��!�0���@��X��b�-*i6|�� ��v_r#����U����S�-�x�H�<��L������Rd,<	��§@:�j}we��Z=k��Г<�ulQ�R��DG��u��yF�ܦw���
4A
-�1����LB�����aU�����r���┭OK�;�U.A]�13����\WlU6�՝b��#���s�L �5l�K�Qbq��95[c�i��{~9e|ځ\�ߣE�x{!,v�1w��/�|��J�zV
��
:�x�V�ɦỜd�6�,���?J�~�(N%�ǫ��Aܪ@��~_����W�K(%M����~�
6�L���t��z�m��v��vy2	h6q
-���V��xp�
��P�ZG�W��
-P��T:�
���G�l&��3B��[j]�t/tw�A+��Aw
������	٠
ƒ�s�/qӲJ���޳+�IC+D��%�ͺ~�^���l�CC�[��ި��E~�8�;��n
-�P�e�y�օ�=溥���aω�m=Ͳ��t�I��gY�Wi&f.bo��F���I�Q瓼~��*��bwA��3�〆︑���bF�C�^1/��݌���Id�K訪��|�
c\P3D�fÞ��H[��1?`�M��R1�܂0���t��p,ۜ��O#q�Ԕ�V��dҎ�Y�9C[�el4LC&)qO��ю�wR�g�E]���ɸ��?��qef�����t/���`���,�N��oXH�d3}�rE�.�?������/󏞞�3(	L��FO
�,gW
�\�

H��reI��
-endstream
-endobj
-3389 0 obj <<
-/Type /FontDescriptor
-/FontName /UGGNXB+NimbusRomNo9L-Medi
-/Flags 4
-/FontBBox [-168 -341 1000 960]
-/Ascent 690
-/CapHeight 690
-/Descent -209
-/ItalicAngle 0
-/StemV 140
-/XHeight 461
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/a/b/c/comma/d/e/eight/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/quoteright/r/s/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3388 0 R
->> endobj
-3390 0 obj <<
-/Length1 1642
-/Length2 4182
-/Length3 0
-/Length 4987      
-/Filter /FlateDecode
->>
-stream
-xڭTy<U��V!sJ�y�3τp�S�:#��
�9��X�B�Ȑ2�	Gd&�1c���sƗ�=����~���Ͻ�{�w=k=k�����6�ׂa p=
/.-!�
� �!^8
��	F	$n
�!
�`@��h��u�p0
�A_��ʀ-
\�C@ZII����x�Hg< dma+,**������DH�8�3 }܂�0
�p4�D�_Z�� � �(8�cjfg`��X�p4
Kj��
�BB
-G��� �P� ��!�[�I���p �y��HR�
-�8�� 8�
�Ñ�$pƂ�x�
�1 
Ey��
 ���y`1$wF"3���8(�HYͮ�������!I0�A�<a��qK?1
	�h
��{�sA� 
��@�	��$2,�g^8$���
-� ,�����8
���}|;�	�K�`�g4��?k@�qpB�FZ���'�vF�i$��� �� �R��0/�?�[p��
:�aR`�" 08�F��'���;�%�>������y�7q��_~�����Z�
�2���מH��H� ����
8�7H����#Q�����-�W���w��ڙ�������/3����̐x�
� �H��n����($N��ݒ���~ì\�P7�r� 8�{$�~�/ihҳ������i"�V8��l�1�
����1ހ��
�qY�ˀ��<�$���d��#�����"���RRR� �������7]4;
!K<
#M�?
�0�
�%��s����s��po8�fp U	vMHJ��Oin�r��N�Ts�Gv�Ufz`!�6 ���R���C$J;�+��
ӆ"3�XQ��q��4v?^��t�Q�Jљ{�N��K�}��@����R63���N/PrtV�b��v�yo�2��x0�C㋣Y�Ζ�1e,.	���������T���~��hr45�
-����E�X<�&v�zH�K���HӶ��n���j6�i�'_ۥ�)-��Я�8q�b������~k>�㦌X�fO���GF�[!�
ucwJA��m��:]°����ꊭ��O��}j~3�젘���?O��s�T�ݷ~��4S�z�ލm��D�
T�]�#ڍav����R�7�U�5)z˄�Ƚw�R��e�L�S�gi	U�56�uM�c6;�ٷw�OG��=]j��<�
�D
-�^/\l�
	�N��������/������H
i~��
j�����·�x����wff4���TC��3�Lvq�P��t�%c�R� ���GQd/³�󮎟V+eLf�QC�����E��

.
�=���}�X�ף%���v�d�a���Tb+�-ڬ�ͱr?�hCw��[��z
-S�eb�~B�a��4�M2s+�W���5����Ze�	���9>I�gH<�
�H_��6=�p�?Q�,�IUw�|���'[���cY���s�S
��70Ω7巨�
Z���\�<@��A?F���..��<�.�K�7o~���u�>�O����
-q�u�]v�I��MW�=08�,t!ʖ<��Nx�О<��βdpt��a_w߼���Et���>-ݔ7C�6
h��|�QO���Mٳdc�޿�
���~	zR��d�H�X&+w����v�ɑ��C�R���9i��K�kB�8���D��#&�.�c*=�0"�9#5�ս�ȝ�.�B�
�r��y�,���K������w�b�1[�'
���cĭG��f0P��������V��h)�Y
-Z��`�ٚ����Z%�gb
�Y)�Y/�^����J�*k�
��b;J�Hp���Fkq�7�X�����DEױ���z��w��9�6����G�{���.e^Pu@
�>�/�@�??���ݩ#/NI�qK�������t������g��
�Q́^L6���jÃ
9�:z�P���j�$�UT?�X	slvJu��J�oE �jrz�tݵr��+�̓��})_]s"�f
��_�rRD��QSY
�~�V*]�r�dt�:�щW�myyr-�z���4� )�o�"�����(嗃�Gum�ɻ9��C��l|��7`���[;���.sn8����B�������.�v�+��em�gw�)�9{�~�������\�R�����
�J�|~5�$.�֍��FQ.I�V�!l�
�����j:5 P;5�(�
���U:��ߥ�mI���U�W�|�_:�0�A��1��7����wR�ۿ0hѶ�p�l8�5r�
���ߴ��}�f�UALt�:�4�^Ň}�,��[�Ě[2
]~b�*.��7��⧲�3���"Yɍ��Wx�

�b��9���wM���i�3�/��l)S��UD���1�) 
-�{$�^Z�
-��q��Bl�<��`٧��X�x������%���[�il�ĴE�XD��/���	ij��/9C��S�Ţ��[�y)yG���Kk����V�E�N��cA͎��4�
�9钚�:6H��I�õ{z�CÍdҜ���q��YTl�>w�H�I��s\H�T�=�Y.<�H�%�o�
����t��
ԑ��KѮ�e�3�2�Umx��0�(����4���.��c�;Y�"���SI�t��2�0bj�x6�U2	{��D�m�i%o���G�� ���MW���0.Ű�����_�ӌ�,VW���2��D����E�O"���W?�


��:�
������Z�h�wm򑤫��h�ΌW�/�]z^�(��QM�ٹ��@���� )�wX��ŕ���!��O.�*U�l
����}9s������%Ldz
��@l�Ͻ5D��B���ڣ.���Sk&f��ĸ������@N�>*8�-�����x�;�7emy
SG��QZ�XP��:SN
����'����p�0���[�-�N�!U��%
PO)�.���H��A���
�Z�!���t8Ȱd̓#l�v��V:
��L�I{��?d;�k�9��ܺ�&�%vf� �.;�����.Δ뎐�u�e���%
�2�3ߓjY��Q1�� ΰ��� ߥ0�&����f3�m)w\k�� ��j�g#�V�lZC�n�w_���0ϝ4��Ar%�v��
-j�j����ʫ���X^�	 ^�L�d
ְn���Y�hj�U���Q礨��
�|��
��^��C
u	�&n��E3I�v=�?�����rB�wO�mɆe܏
��<������q
~��
�P�e�
ڈ�
}S�*�%���}��b.�	�����]⤽�|�Z�g�^MKe4;G��>����C��
��I�~+5#l���&
B�R'���uv�.{T���V,���X�;q��B��TL�G�id��-�Z�ڇ��`l��+�l!c���c�suXH�X]�D$1]2��7�jya�Cv��J��Kˍ=���ю�QD
��]ZP��2����1�
�72G��y�F�	���Nr�r���_�2���s�J�
e�I�`ٙ�2qٟ��Y��f<.U���:q��!?����z�ۓ�ŎG��xj�{ٟ��lc�Ծ�)�r�'pZ`8Uc��S���,o������\��gy~/se��ΰK}�z����ץX�踽qP/+aVc7��_�K��������ށ���g�-��
���3��JA0�� 6n�`�
a�A
s���S�Q����t�ݻV�D�6��
9b�Bi�,�g����辔��4�rh�
V��Xh&C��X�����˘�q
-؋+Jɣ�Ia��La%
�L��|��
-1�9�fʝ��sz�0�R�[�
:�cK�0;�,NT�K����[;����
�L��u�f�
HRMZ���-s:�Yc$g��O��N��˔�'�����V�Fm�RU�,_�(�F�Nl7ͻ�\sc�N�R���Z;�Ѷ ��1���V��	�^|�YB���"
-
-�V�N����DY=-z���z�ڮ|�7��{�T#, LOO8�\C.3������e����Hfd��
-9�\s���뼦Ū�%�g�7߰\��^�ï�w[Kٸ.��!S�T�c$V�`b����^
�G
��P��'gK��,���m8$�%����pL�_�7�
���j=��9��r��������T�w�Uڦ�h���Q�A/���O6����{�Kz�XE�Orsy��J�WEv^]���$
^_���Ȋ���
}]�
K����'*	���u_Ò��䣵�����OjTXM�i	w�'��u�05�5fem�]��=
�a|�.��/��{�K����y�RI�}����F�B6L�
-;
*��2Ďx��x�/���ky%_��{���.�[��o��R��{ڬnV�(s7�z�@!���k~���FE���E��>9cx���͹�<������&j��
-a��W�
-8��*��ۉ�]��u+h��K��n
>o���V
@���ф�6�z����%Vۥ�V�t
o0?�����I��9UT~x#*���R���қr����ȗ<�N��D�+����j:Ɉ@�!��sR�Fm�
�N�ѿ_��T|�B3��m^��5���ϵ��L{
��݈�1�'��ޢUԩ�z]�]�}h*G7��ь�
v"ѳ��m����bv�.�Z��W�ދ�7
p��ϻ�5mi?&?iG�
ds6�\R�-&3�m�=2a#<�nm����N��~��~����*�uM�l �V
�_KS.�vYu��֚ʠ[!�g�Tʲ��Կ��|�U�8
-64��h#������Mv[��fB��M_0"�
���-n��n����n�M�x��{D���R
-Ì6)���.�zFG��0�L���y'G��'i|�]˯.���K>���J�lg�k�(�h=w��'�}��I�mY��W���kc1�CU:�4w����K��
~Pl�iG&46��V���Hؽ��O
�����BM�#Ɨ�=
@%��
�x�[�כ�qB^L��|��|r'��z�6
j{u�M3�;���|3ֱ�s*v��}[l��1�-j�����۴Gp_;}�>ļ�t0�W|$+��f�����O�
͸n˷�`E
-�e���|_k"��t�
-endstream
-endobj
-3391 0 obj <<
-/Type /FontDescriptor
-/FontName /JRLFVU+NimbusRomNo9L-MediItal
-/Flags 4
-/FontBBox [-200 -324 996 964]
-/Ascent 688
-/CapHeight 688
-/Descent -209
-/ItalicAngle -15
-/StemV 120
-/XHeight 462
-/CharSet (/a/n/y)
-/FontFile 3390 0 R
->> endobj
-3392 0 obj <<
-/Length1 1630
-/Length2 19675
-/Length3 0
-/Length 20521     
-/Filter /FlateDecode
->>
-stream
-xڬ�c�`ݲ%��m۶m�Ҷ�Yi۶mە�m��W�9}�����O�����+03V�EJ��L+hlgh"fg�L�H��E gac��dg#g�)C�db�B�W�
-EJ*�hb�lag+b�l�E�nbL bbD��D����	EJ lg��haf�L@���NIMM�L
=�C�����̖����������_��kGegsS
kayMI9q
-q9Uq[GkCk
#
#['JS;G���l�-�)͉�/���������_7w#�T4�&�6NN�	,��

l����َ����������M�������_
����`
-vN�NF����*���;Ogs�b;Y�Uؙ��4�3r��������:X�:8��;��Є��������o�`���J������?3�!p413p4�6qr�
�����g��K����
������������ڔ���oL#翱�,l����I[S;F�ˍ]��C�j���Q�33��00���� 061����s������e��>��(�o!�����7r�+G��%����Z���Z���� �{��]2��
�
�?�������c`ca�������&�N�� &�l�-��f�a�c����I����X���Ȝ����o��%W�56q���5����J@����_t*�FV�����o������/]�ʟ^UPFSA���`�e��w�U<����?���3���`����	�h�8h�8�޿�	q2���߄���e
�
-�	~�����_����?O:�F�������Qv6�5�;m�S������/��Z ����������jm�Έ;�2-3ݹ=wdR��@#�H�}i�JQ�_�]�oZ�.g��gm0]�4�w��ҹ�ס��h�5yo��u>�ob���-�Nv� z�R��
�(��E�
-6���IE%ݒO0��NfG��J?b�?�g{8�ԆX�.�& ����
��ӗg�?#ýw�����9�����>��I�
����Fߠ��NUKY��5���n���.�$O1�Ȍ�W�xf?��
ˆ��nס!�1LE	|4���3*R��]˒�l�
|\iV���1��M���i�E��߈jC��Z!��j

銚j��3�,�X���|p�u~cI{�Ѻ�ο� x{ �U��/hGx-�i���"

x4-C�.���ߕ�Yb��y��R��Є*�,��G�@��Ӛc�kݤ�H��1C%�l��$sI��u[{u�����.��Ϝ
4I��Ax4�hJ�\�IC������$k]|�-�75���<�ޭ���J��`�O���$x�aA�'s�W�O�
q���[��C�|ң7c�>��рl ��Ԋ��e��!jk���+�9�	.���
�T鶙�nIFj ��ꚹ��[�J|Ѝ������
��9W�mߘn�9�
-���g^dh5jT�����2�׭�,�]���b��,��8ag"C�
�-�M�[-nL\�1�+�P,�-R�j�`�R��^句���
h���T��,�@����� � xU��ZM�
�lh������( d�'���V{�� O�W�&rx�b��g�n�Ʋ%�q�a��oI
�w�Xd���؟/j�W
�
8&��s&����v$r
z�_����(�N)
��ї�+��A�VAk;��iwf�H���
��jvv�-9�%��\']t>u��x��җ��e�T����FX����	4�m�
�MdP����A�Q� \��Y*WB
�K_�T��RO��9MYe�S��ێu�2��I������v��K�=��M�"�w
-��ω�qc��w�L0�X�%�,&�j$�l
+5�ub�Ϛ;�
�A��HQ!�#N.z��S��l�����i�3��\�2ГWOG����w^[V�"��r�W��R6*u�����>���m9�Io�ٖ�oo
������ޥQ��n��4
Q���i�Vq����2��;��
�������)��1��2�pp
ase��;f`�s�LX��J��p�B�7AȠ�B�\��
��w�\��U�
-(��=H��p{P}R� ��n���ͻ������^�{S\lN���ï��V��i֑�O(�q 0a�~p��-�S; "��o��Em�[��(qhؐ��q��^�@����l3k����8��J����>5�L��t����;cG�7��-m�w�ąn\��s�Vn�(��k��
÷���8o�2O�(�F����^#
�S�^F���uZ��T�&TX
0����\���%)�<|F�C�c�����
-�ZK<ѫPS���j�d�D.���5؅#*��b`&x��aY��۹� �Y�+$��J�����v���oR��@>�݈aI4;�!w,_����>>�>
K��P������G��,
�>��S܅\V���1���&)����]Q����(�]"fa���/�S�1{��nd|��$V��y�ۉ�$W|��*a	]�~�r�!
��ߋ\
��Ţ
���r��'︣/	���fi�͈��'�-U�TϷ�E�F
�!��>
qP�P�
����ch
�h�`�I����QXPw'(�ն���<�O�ü���T��gw��9�ZT�f��,�$��%~`�ȯ�5*N4В��i���/�"w��A���L@�R��1����?�*�"�i�'bw��Lx:��Q���^��
�y˥��vXdEA��;�O܂G� t�Jd8@���vT�?���_�
{A����o��n��(�Mު�ճ�i�sf������Z�!�I���

\
5~^�����N�����li�[��b��{쀾���`�������=$�Z&D��t��o�EjiEW�e��ĜɆ!Z!:#���ͩ
���]�˶p�e�)��m��K
>]���� ��*�
�QX^n���
�M���X5f$r ����{}�l
-��͋��Xmk��kf݄�ifo�g<˄��L� %�5��ٸ�l��o�h-q䫳]��Dy!g�iG#��н�ۻ6�Ҳ�Q�.�C�
'xC��Qk^1wL�K�h �A�ܠ��”5:��.6
-���{=����4,�7f��͒�8c��}2=���v(BS!�u']�4��Hȿ�?Qo��,J
Ÿ�P�r�G�iI9dc�rq=���	9����GC7n#�����S=<�� ���<W2g�}��@�
J4�d0�
���� 8�.7l��Z�U�2�:*�Jm���߄��F:�g��gZd�QӜ<&�r���
vt~�B�
i�5R���,�Jߴ&

��%/�>fڒ���7[�jb����
��L�7����>�[T,�h7�L�L�E&��#(�j���8/��
��Bs�1ʠ�]+�͉}�Պ�
�YļdQ�i��8(Zc+�D�XB�$��t�C	��w$)��_?��#�ֺ
�!��a�0e����΄�qb��b�4kT��5\F{{���A���u�/�o��1�
�ֳf�L;15I�t{�Y֙	
-��s��ݦ��Y͘��
���]�
�X�߳���_=�V聥���N��w�
���GҰ�����9%1�a�9�ڀ	N��rW
�غ�ODlb7������r�n�7r~ ��� Z�6�|xOK�L�<,E��b��Ut�OBOIϢ��?�y
י��p
�����Đ��Y�dy ��߯\��@�@�b���!q4�=Z��WG��=�4�N2dG�H
L���q�E�B~�
Ӡ�M6�����<:]����UŦC�.K8BFǼH����Ċ;�{7?�u������4�3�(\����
L�༭9�
?���s�<�L
�����"q�da�J�I!h�Q���w@��!���'��s1:
[0�|�B�)
�ɮ��������ʎ5��"���Zk"�%z�����؎T��$��h5a�j�O�	��
V��3�%S�u	;�`��'=ss|���h}f���VP��v�2���Ξ

�O峁%�2QɎF����3�,^E�
*&=
�C>� �Q�xҖ/j��v6��޾.;�x��
���s#�0%𫺪#{�
!ۅ�ˏ8 =W�?�XD�ǁQ�9ɮ�7��@C��� `t�;с.��n�>#my� Ed������
s�&�7`�&�;����K =��$�]�9.~�aj=D�et5q�	r���0R��`r8Y�=A���QTOv7,P��XP,��_:��I��y�E�7��繩���a�'����Y2Q^
C0��}��C�a����2�IFDQ�{b��<9�4�_���P/��2�Dr?�v
�wij=�{E+dd[�;���!I�>��e�,6�j�:��B2C�� �?0M٠u�	
��3�ezW5xS���81a�i��`Y��b�;�fܪh���mD���}_�lA/%v�oȴ'ј�-[�YB�[ȗ�̋cq�P�2Q����M�4�B�y�Aq)��&��<�G�.P�
�u���U~	�^&�x
b�8@����\;:J�U�BO#@{V�[�6��0(�
V�!���Di�%��8�fgxZ�+Z� �C�a�D�Xc�*S0I��N7��SEU+
җ�rno
r��(���k�l�
Iu
�iD(b��z������٦ȩ,����-y
�N�yl%��i
�`l�	 �
’��?��m����-�X��7+[r��ȼ�"���A��
-���M��  �
��Tq3J.�J�Q<�y5$%p9��Mλ]�>3P�@��J��� ���Cn%B�C-rېx�R!�\����߇m&
���2=f~7+�x��2�]{����?�\U1����\a�A�2;�$�q
E��/D>��%+���a73�I�f��t,q��P�ʠ[�~��6i�g+��I��;���3
_�"�~�Ha�i��|r��3����oG��x�έI��3
�+J�U �*"]���k�6�y���5�����Գ?�0l6�pn�U&
�R��Ԑ�8��H�0���'#Bu���ta��J�"PJ>�ݗ~ŋ���F�'$���Aĵq!���#�*6cP��A<�
�A�%�7%y�.��
-�E��Oz���E_�v�,âu}c�`B��.��Y������fgf5�]H	�U�g��G:EӺ��g�ܠ���B��3?;W-*�J�ń��

�P�1
�>	���j�g,/n��@�qӆ��� �.*>�4��6� N����L����{ly"ۚ_i��]�ew��j<�� *I�
-�me�9v
|��u��~i��N�r+�b}�,#��q��	��
�Y���J@������'."O��E���q�����syp
-�c�W�\o�h�F��sߐc¨�7�,o��$Q�?�5؁QRٻ��x]�����sG���ʓ�'O����Xw^�8-
��8�v]�2V�]�z�wG�ZA�8DO��t3��zW�T?���A)�0۟h��:��
S�O<o�'~L08+᝺���5�/E�k��5
tkS����º���&%���g�
��x���>��W��ا�nc����^BD�J��G`h��B�T�xǀ��\к|�7H�s����
�"���O��f��W�������ntk~MfxEk1q��me�𩅫�ad�������U�'nh߸\�@�=d	��}j }���
��`����f��0���\��R�x{Ry}>�ƶz%s��5�)<��žЎ��6]��:J‚�������j�Ҥ
��e���彂-��*x�.P��ߩ�3�x5�$����}30v�T"�
5:�ѱ琭gE϶��y{�2L-�(�<$�`eQ��,Ю�F&Fn��8.N����ϵ
V�*�9�3�{{�Y7�����v��)p˻LF�d)�Il<&��ݖ���j�D�#�O��}���:ݦ0�
���B��g�>��r�~��,���N�z)���YZ31�
����6�L6�����L�pf�z���y�N0�nz/Y_�xQ�ğ�q�FH1��(#�}��+�~���K���� \A�]y�R-��� [...]
-���H�
�c
⺥2�d��$xJ$!
y�?vk�����
���h� 3I��
�a�C�R�h0ק޿>d7y嘄֪С�`�)���S�XX�N�U������Vig�X�Ros�@�OE^iElBH��*k�>"r	B�8:Z���&�21�8w�	�H
�߽�!,׵:
�̳�
-��L�/$��� �_
-���5�NY� �l��q۽��C�+�dp˴+Y�,4��oc�k�����ɉ�EѶ���y���^�E��~��]��
_'a�]D
�!6�0�OuG
�p��5��������.
�c�K��KM��X]%���}���Qp���Ъ���YP��x�NkN�����6�|�[ֲ�e�t���l�-"f�7'��b�!׾��(�)(�ɼ�z�ܹ�r�Z��c��Q��e;C�ܲxyy���_t���ap5�:�y�_ ��Yg�̈�m���{�S��f����O��5M�����x���;kSe��H�b��|!��m8a�[�&�ћ!�`�w���O���ż;w�x�� �F�8s��r�����Cj���`��6��g��R�c�U����1��[f�/�&CE`]h�^�T�Q^��%��c9?�1�lF���>��D�l�z�C�� �%?� 
��ڗ}�iPV
�*�Cʦ�^l���0����}_XE���'(i�sB��D���N�4-U����|�l� *Cy���#�mc��)�X
�s[�
�yi��YӁ�e�W���fv5
�l��s�]Rc~�YL�T͍)�+���k���8j94���$���E��Z*<�1_ [...]
s�
-�=�f����PW�=0	I�Z�es�с���7a�C�)L��%�	�4)oy�3�^\K�j{���+?v�Ƣ��Ǐ���@9N�
���K8��>@�q�%>U��(��~'L!�7MJr
���QKSA
n3�
�aXnA�&7@�*�
J���Aa���U��&�{pJ� �-���
-CgX����&�O���ch5D����e"������22�w*ߝPrp�['��mU�8;{W�O�f��
T"K�TC_~�
���l#Vz%�bx��hF��	rKK�2t�H��q����i*�ߺ��l�
����V�;ۥ�Z,���P�,�
�x�BS0fb1�8�~�,y��mW{KR���x4i�?Pܺꛟ�+��9��"a:�}�&(Cբ������
-�(���ƞX5�R�4�~�K
���������r�y�(6�ht
-Xwo
����D8�m�4\а%�R��#��\�J��-d�OaPM
.��@ U��uDW!
M� ��,MI~<���xv�|��
����v���m�ˬ	aA���'��i�	60�d
K�!G��6�0_ɑ��+h���ؽ��d����H���Zh��f*�X���xs5�T��
���GƂ������(|�A�׾yj�i��lu�e��Tŕ��g6��+Gw[���h�[�^��I�{b�� &
��sH����I�򁸩\i$u
���;� Zh�<	���R���U2�@���sPm��p
��=��a��j
l�����L��,���
-Ik
A)�L��0<�B4��C���?���{ܸ3z`ͽڝVt���[��F���u~
-���̄3s
��
��p
��׫pd�`���%W����܀�=��a>��TX���p����@���rpBqth�8�#����x�3�
H
3;)HyM�nNܗ�!�0
C��]k��ɨ0�&l�0j	[(�տ(�2��N�=9N� \�1�y~�9�� �5�TY`���[؀�n�	L�R%��v��=b����{P���!�A7������l�
-e}�e��ZL�(
b�~'� ;�3
�7( y�4�*K
<����D[
�5?P=��
�tpN.��y��T�׆Χ����
f�m]�?BԨ�D�Xy!��o/߂�����M���{�J
���(�����Y�}C%�GL��ُ|����m���~G���pe���9L-}��mv7
�goH�^���
-�i�<��0��cA'��$�G�NA~�*%oP�?�mLnW
���J�^�Q�ˌ�
&GX
���r���&��i?
��!F�K���g��_96�e�_A�hYbO?��NM3O�{Uh��N���l)�=7���8�g�.,غ�2�/�Q� �z��l�iX�E&]4#+YT�*��&�fH��C��%fC	��@͢��\B� �G
�#���M/�
��m�_A2�8b��3%	�h��g�'�t�%�T�1
!.�^�T����C��'K���x� ���l���kZ�UQ;~����O�}
�҄�I[���[3����lK�
�-(�k;�/�G�N
�	����qH}
��\�ñ5IYB at Fַ�!e�N
�J�*���>����FcX��n�۟Ԩ�8�
>w9�h^���jl��b�'2;&
˨�g�x��uJ)Oܹ��"?�	��D�w���XOvuo�u �f��5�e��T��G�T!}
}O5�1 _b~�n.DB}��!LM3���C��(��/�zk�ވ��}{��!�N�".�W'�6
�+;�ε��݅�c�̾(��ޗ=J���*�6������Af�6 ]pC}?鐦�Gld��:;��γ�J<�m&@㷨��V���!sZ�Hoe��`��<9>
q**��g˨uF at ckEa2DT��1�����
-��*��JN���T���߆�n�8?
�ߞF�ZVA��ھ�:��0�iپ��}􆣄��s �{��֍�MC0�\6�
�qH��F�re\�-Ƒ*eѠ�=��Y��|�X�"�������΢
�z�lE�^�8n�D�4n���o0�%	D����-�`�77��u'9j�ZZFi�BA�@�!~�n995��7��6?Iw�c�/��zy)rUR�V'�_m��`v�g]��Q�eK�j�{U���b�/	M��gل�ooP�l>
����~��@��I͓��Y���7¯�N�+
-�w��Dy@�]&o�e�_
-0�]u᭰J��D/_����I8�x��#0�H1J��
�⢱�H8}$�R�,p����gw�ty��z��3�4� ����;5u����S�ᅀz]�'�^��-�]םo�)��EA�b�,?��t�$����F'����
�iHVqqt
�JjשY��GiQs)x�z؃�5'G�On��ۄ�=��mЗn����,{�T�y�b�<�q>�k�[>/�� m^��"��>�x��D��<"4|2�
-/�l���^�T���ڼ'�jI ^B���AM
S���[�v��1
 �!�_.���
��f勤�O'M�B�xj�ѐ�˜,y&:���^*��m
����|�'岟M&n����a3׈jS.8w�Oz��\Ti��փ�n��
-{by0��	@�֑Ÿk%~����=���rrQ~
����V@��2�q�1�
7:���t=$N��^��s����r:I+�B5>|
-��҄r	�s�8QMf�q߇��.��
��
��*r��ƯR\���
�����į��l��;�M�q�C���� ���g@�����
�������0�44��a�{6$$}L��&���{z��&��Ԙ��{0K\��
}c��컎V��W��JBT�
IcO‹v$�7
���F)5���ȓ6�~,s��Jgƛ|R�J�b�S3eI��
?̐�
��s09�	�to;_�C�e�
-0��� �	7LyP��u/�,�o-'�;J����ЧMD����щ�ǮWhPW�[���� ��J �`}�g1s3����&�J�?�bs3���H	��|����
p�#f����cJ�6.-m��8�78MP��*�o �M���J�_n��
-$U}ȓ����T at y�N���G��t�q-
g��P���6Ʒ�h'�z�
�n*�y�"|CԷeDN���Ƶ
&	�F����7��R�>�A�
���7���֩���V=���e��!U%�`�H�=�_�⍲]���ٽ��T�8�B*L~Z�<�
<�yS�چo�,�Nk@����.w��:[������f�h�l��f��w,�b"6S|��q:� ��³���Q�c+� 1X|f�gV��"��M�
-� �7�
����0�Vq� �ko�P��nǼ��oZ�\>��i��8@��:��Pz]~x&65A$ T�$
-����r{,�����4������cߜ���J�J�C����y�
-�F;��|�H���^�ڶ8��	r;� �Y�TK��#�N�Xg��Nķ
�B�q�MD9bZ
+�¦	�m1܌S`����0�bO��I'�X�h�ݺ�ihv�=�:�Nh��
p�W|H���Bg&�7W�_^�N2��9�e�����liS�+B�\�l����
�C- (�ޒN���+
\�16[�H�
-�,>�y�%)
Z�$4������	-
�lSt�̮T)��9�u/t�wm��,���27|^ЀSl7uڭ��|�6���(�E�>�
$sg���2R�N����ɘmB�a��������YZz��Y�y8�<�҆@b�ڠ|
-n�
�t��ï@���Ρ���p;���ꗏ�
dyΌ�ޥG�a�o�e��U�g��J��fl�"f��}�4uK��U�w�)�jgO�sOu�qF'G0��z�븣��M�9+��cf�&|�>4x���v�Y�C$3�&5Z�#�T��c��2���2B�7�J5t��
�L�J���5]�
V��ݑ�܋����n���&4R0*�$�z���OʞzK]��}�rL�_.�W���
t��kз��r͋
�B�ʋS��mBk�f
�W��4���3�/g�G��#�#EW[��F���$_�o��h÷�n%!G�
�� �ƣ-g��|9iu�/��VAK@�nA ̉��2 lwϾ��}����Y
�D����I9���W8cP���,6��n^��ڟ~��������mR?��/}���3��pS�P̵�B*�/o٫�:��kF{�<���F~��[{H�^�L�A����(ۻ��ԝ~׻A.�ij'n�w�#n�k6w��a�&/p��d������%'f�=�����Æ�����Dڔ [...]
-�����E�W���v�
Ս���U���i�*���Y)-�ka�˒
eu��|�0;Y�\�t|M5��9w5P�
"|�f�?�l5��TO]�ZZ�

+K�߼� ��������h�B`@
-��
-���Dw�R5�bRC"5�IXi�Z/G�K���JW����:�C�@i׷�J�=��d
��t9&��Z=@�,y[ïj��w{n
X���C���z
-NA]�'rqҖ�)3l��K����
�O� 4]�Z<�u���:���^\3m�"š�*���)�*�����?Y?��@(
����km�b
h6�
- ��+��ƾ'��|���P�gRN�ØRs�m��:
�o51��c	�$����eE�3W�b
4v�>�$-����3�;i�7ʬ��\~�$���շ~�^)~p��ևO
�i��(��'�Cׇ�2�Hn�
_>z7-�$�cy^C�s��mm
%:$�]Q�<p�����LH�3�i�v���o���96F �E�z2 �(<��9r�J�����}�{�کEW$

�0���A��H�^j26F�=P$�n�}�	��֚ͩ��F�r�
q��`�w(�r�g�
yq���w7[��
�l��:A�ݟ��
tc�6I�H"1�W��
l
0�	W�+�RZH$�.�b�Pmr�M�越xѱܗ��w=ݐ�$@e��Í�VǼ�R���m���6_�.1V��#�hʋ�h}1a���K������l[JTю�Wm3Gen�_^�uC�,(w~oq��a�۲��a�y�e����fNa^�_�Ǵ%��<M/�Xq[p\L[�'4t�R���~� $Hf��*b���ŝ�J�+��6d�g�B�҃,e:ǏH��=�#cŷf�
� ����V)�`���\���	����!��L��Y [...]
P��*tsոO2\U��7���6�Kt��=B�͛��X�t9�	Z��h�<�3�d��=�Ƹ�C��I_�
q�`���xE-S(Oڷ��Q8=���+�~�����I��8_a:�(uO��� �]T �;��e�`��D�[qL"HxD��Y�
��)$�l��8`��w�2 oO�zs��)d����tNCZ�&����!
-�"�
1U?��6�-�Kw)t
-���Z���
�wxJ�
�9�c�"�O7l�}��
}C�ǎ�
"�j���E�}s�]�4����eeͦ��=K������[2�{�]��3Ҡ=W����ֺ�� �q͖_W	�+b`ugx�j�
/%�
-�S�b,�<s�ꞇn��Y��[yv⭘�A����*���N�(!`�u3bC����fO6!(�j�i���td6`��z nA!�D� :�
PV{�pX��7�Z؍:�L�C��c��	]E����E�D?nVn�n�.�p(}�Tbԭ�����"���n�ft�+�Q)�c�]�g�RO@��S�+Yd]
�mn2%4���z�J^R���T��W/��Ԩ��.;z���˔���b�脗+jXbD���FŎ��5� k��#���w�J���0��
x����Ό
��*�P�-�p��2��)�d]Vj{�����H5�
�\�%D�742lj�=�#
L)�:��("�MP6��;�Y�[�ta�759�әR�0�H����Zd2q�"}�t�I��*��&G���m��[�R�e-t�[J��m��a}0p~�
�B�ʪP��3�;�ר�r�oz�K��:��+c
 �{ ϔ���x�1�4�R�w/�� �\�1Ⱅ�p ��G_u$�F$��Q9tY�N�V�ި�Ǎ&rJ
Ɖ9
�M㚸�G��D�wK��o�q�y+���"�6w�^�VC����W����C	��"�]ӏf�0�頙����EI�W��)s�
��B��ē�T�
�����6�P3=��W��.A��?YP
_�4�K��+��)�#
l�%D(�b��g����^u��Wze�� ��'O����Ld�BH��w�4��xEUr��D�2��?pf�
>��/���}��Q�c
��Y�L4d�m�ɗ����$��́}�zw��&���eB烌R"����>�fS�B8���
zl�:�C�t��h���-q
�g���]j���8aH�x��#g�&TR�FKd'=�s� 
oެ�2�#���2�ru+ٴa����bB
�;�l�X4
Qx��*^�EP0�^���\�O�W�'^���Hd|��ǽ��#��8�vy#St��sO	�&,\ȽQV~=�̀'�>߃_�0�2v�3�����م��j�B��٭v5�R�;�
f
ո���
>%Am��g�ۓ0:���H�
�:Y��tSQ��D�H�x��ѳ�(!�G��}�(N��b�d at wi�e�&:���ңt�
ߏ������;�-�Q�i�2�Nr�`���[�5O��8�
-��#��T̚� ��k�;��h+f�W� ﵇A72�4	C�K����W�\�
d
���P��֭�����gv��庬d���ˣ�������\~��ˀ�,3Y}��]�<*0:y�o�������� k��p��~'�F�X�d�
��7e�����\�F�
���x����ST���.�)�Td.��O Q�
��-�k�%	��д�
jbn3X��e��0��
-q�������������{J4C߳(dq�!����݀#��#2�
�s?�����/�
��
��ysr��,���-��x��%%1Cj�_��Z��r�
-�x<�/�F��dW4
���6@թ�&�W�ׇ�tTe��`i�!&��m�F/c4��D
��k��F��(�w�`kN៶�{
-� MQ�5š2��<D)rm����8aUAgY=��qjd��&<
н��˒�j)
;0�uW�X���Z,/�71�1���q�T�;
ͼJɆ�c�9�\
-�n��$µ`��V�3��f��kl_[��9u��w��/ŁkzP01/�� ���(̡ӿ��2�1�&/�9�g�1M]]1�
���k;�_��˄hU�e0�:�qKW:
Ь���3d�KXv1M���7	�8з�C��k�挼���-�K��eE��>��*�
�U�eA
p��91�"r������E1r��T�
�NH�T����I���
�N��G�����R�|]��__@u�Q��"Q�q�K^#>p�7�Ƀ�sЭLzI���:3�Ȑ�>�+�e�� 
`=VKP��@�k΀�
 �~?��5u��B~��N�t�W.]�&���`�Y�u�]$γ.잸~�aL�l��~
h�|H�g'������*��4
�A����7U>�Rt��S��I��.\A;��|@S�X��s�1�����g�!f��eK��#�4%tzY�
�DB�.�t�
�*	���,P���&xPCF�)�3DZ�l�䈏b�dM��.M�7m�w��Z��
���E$ފ�o46t�C<ע���Ϲ����c�
���}�޵�q�0_1�lJ��Y�jqK�mx�E���$ �HU�Be�����J��ci�

���r8a��k�pv��:DI�x�n�i� 
- at 0�u�^��
C1Sr
-[�3�"[�[��U8ky��mv�m�35��y�\
-R�CR֞q��(CCՒE��&sІ�Ð��,`ķ]<�{
����zE?<�s��5S���&����y
�8���t-_؛�u�
�"�?�Y�;!��2�}��A!x�O��f�87�8D^����;J�Jg��.S�-I8�S�
-�Yyӳi�
�Ѓ�&��Y�E5o����k!	�JM��k�(f �,�&.��M
~mJ����O0������!p�!��%�Ɍ��|�
6x��6&h](��\�]��F��j$��
-��
ר��U%I���$F��)�r聉?�Y���n�e(H)�@BU���U.T���2��;ںlg��ɀUx�o��K�m��6B���V6Dh��K�3��[�� i ����'S�v"@�*��̅��G��S��%,E���{�!�43'��r�"�6p��$�yVE�*!�`t
��%���|���e�d��hu��o1����;DN�F�+8ˉ��g�zC���\y�*k�1���
ֲ+4c(��P���o�Mx��\�͟�t\ �$A�i�GZ�`�
-р�
X�	u���]L�װ�Rz��O��)�b���o�8%
�(�

�Y�O����7�9�O4D|F�QHS7,��-�lԏ��?Mϥ�.5l���-s�xǵ:���~��?�92�˂��3w
-�-���KDW��'��77.�ID=D�� 
	эȔT��Gk�V�5P ��S�[C��0�N��
+θ�<��#�VE�
#����a��$�i�Z`����*-A0��Q�
�;1���Ge޺*
.
ʧ�#{\�/�>��{��ћ��"����R9 [Lo���nmz

-MJ�(܋�H�YLo���8���y����v���=�
�L?*gv�J��qt�O/��e����-dGh�si�lA
ʍ�7�1�q+����^��T�-�>(�)��t�Q��}\��'����,Pp���L��PЯ��Y>ƞ.�@�5�XI�i�:*w8ֽ6C%�F��j��0�s�9��׫	5�6��6
N��lQJ��y��_��6�(n�ޑ�cņ�i�+~��E/�5�t��^AK�[1r/n��Zh�U��|2�0ab	��8�8����s�ϑ���5R.m�˕
�ӗv��$�;�`�T4�r�q\jC�3>��:�������YiF��;�K��
-����F�(��5
��2
Fu?�:Nrv k����^
W�ܽ�p���SY��wޯ$�G5�?��D����W��g����
�v���
�ȟ�
�L�|�\�=:8Lq� ��oS���A?�z�H9��?�BZ�uG���U�M-�'^�����Q�3���ӽ�`��
�c�<�v����������w]��6�g
���Xaȱ�t��rB&=�/
- ����yW�u�шm�S�P��W+�	I��
N�,�
]��G�bq��K)$�h]  '������R��	<
_� ��F�M\�Q���\�$Y��Y煮�kr�
ˣ�����D��De(�?�L����&0�ۨ�X��lO�l
]Jc�bυ��B�-�����P���XJß<� �A���
E��X\iguE����_ +��������3���6�?�j&���Z�7a<d
&�yM>��6�
VLn�|��Ɨ�{#�
-}�nF��dt��U&e��� W�fn+�q����o���,0���F�������U)߷�*��T��N��a(�󊙜��N���G�@�v�IE{�����%�N�KXt��!ӑ�\y���y#��3i�]

-����c������`�Ms���l=!��K\Q
�bh�+���s at pCE�OkCtu"|���tW5�A������B�M�c��A����
F�m���
��
s�o��*�I�]�����΃7L��S�~����"$�c��%Z/ȵ��(�
��s�;�
�4*��Y~�>N����5->��؏ɰ��I{��x�����o����̷M_�^@�k��
ʓHti ^�B��;�ʰ�2�X������
ˌ3�ĺ8�>�d�!�Ld�.u�t9یȟe�ȿ���=�QeCV>�5f��9G�1Te;�����"h}�
���{`��m�����MZ4t�w}z���� ѡ��
���d��ܸ
���T�\�cF��q
�!����.?q7\�U�H�s��$S����cnW�[֞Tb�$�D��&��3\��[���l����
֐e��]>�Fv��A��e��*\O+�o���D��26����
"?í��v�%����Q����.󏉂\|���Rw�I�[?�
���ps�#���`Z�w�hY�"����R��Ȩ�.A�`�vH�yKz�m��+�-ϹK[���ҕ��N�����Aٚh��>�{���iC& 4?�sS�F�h��<�;êH�:��|�D������Zw��>�1�]���'��R�5#�����	���ay
��a�r��J��W��� i�k�{ǥ@��$�a����OJ�)
$��������2���
�j�ȓ��eNgx�Y]�t�(�$/;
L)��y�V�<9�ЙFצH��!q��S�y����sf;�nf���.�d
�c$,-^�~��nX,�
�C��l�by�
���Os��{�B ���r��
�W� �"��P�Q�����;̊�p
��`�7��H�XbE���%5�R�ܢ
o<�$U�ml*vy?�ܦv�9�E�E`3Y��t��
�{��RP'wu7�`�������2���1�4��"��
r��q
 �h<�>�"K2��B�+����X*0ȉ:�C��~Y.�[�
g��"�ͪ
�����x�
-�o���;���Ӎ��0��z� U����%
/�lū����&�g~{�3Qg��q��T
����
���y�a6�G�O���{vWXFF�O8�4�{LelG}��)���(��a��5.�0���6�$ٽ���Y,{hb���uY��h��q��{���#��-c�;9�|��A6�2(3��0MN��!�L�w��V߯P:q^�h_�Ȟ����6�������
�G�v@��
�lx�p�=�}%��*�G�0����G�_�L��s�< k��BR������d�� �}��X�x�#�ti���@L��<A���AAhت.�k�ջ�ǯ̕@�S�ź�Z�G��y���<q.o�������r%za���Ʉ��8dW�H��"�
�j�Z� ��
-L
r��>���.-fZP`wz��]o�]�7��f�fb���2�Q��/�:��?
ِ3a��ڛ�����\��
)?�ra�3r�&�z����Dmq�<#��Z&}������a$�a	e��î�	6w��
-�(����Pk�A�
p���8����W}�|�fX��*'��1��F�ɿEGU����]%K�r��{�у$�#4Ma|��rQ$ Hט�.�p$���r0_����%H���i��I#�<OU�⃊�������q
\Q2+��w���q��|��i(�����;�
-̭W
]7l��	h�[t;zG�̽ ר��=>����������=����5't[P�6��ɐ���Yi��2j;[�r��6�Ĩl�X�5@nu^�y���m���:8u{���|�18f ��=��1�sAWD*��j�1��o2j�ۈl6�N3�< J���tu�m��]ii`
t��y�76�z&f���0���œf6��=d<����*��_h���{�����\�0�o�Vs�<S�;��F%N��GHP�,}(��T�o���
�Q�JLr�
t�&%���.�K�x�Ȼr��ʠ˦ܱ�F����� �@>
薻竂	T�uA�|P��8At�Y<?f�W[0�?��c��g�����
�{.��Nv
-�|�z�,��k�v��[/"�5�d����
-F��'@\��ڟ�Vw��|5p/W�粐�#`q���0P��ޠ��P5=C���t99j�aX1�VTE��s�5	?8*�,�l��
&�l�.���IK�/
-w\yP`��
	��7y7#��~�6�2�����N�=�V��l ��9�9���
Q�C��]�H���xAc,���&�!�n:Y���<��G',C��6
-OPе�[����4��=��7"S�u{ë<q����.7�
-�`0�L�ִ�Tk"� �F�3&J�,��>����G
��B
#���
��]�]e�"l���>]�ݟww�9��!�>a����>-���p[�9�6g�ߔ��¬W��V����Ňc|gg�Y�ά_Z�G
�2�l�n���Un��"�ۊt��C�JD�ݥ��n����i��(�Rw���a�s|��V@�Q2!	�ȩ��Ğ*;
���hzD2՟"�†�8C�9���F�D�`,O��`�4��"Ol�r�t�v���R at S�iɶr_��ʰ!5����f�Ǿ~�2ٌ���p����h����B�����q������
�7���{42ht#���e�Z,�����}t�
�Y�y�[��hDŽJ�$J8F.NT�u?qLƋ�֭�	A���j?�������Bp!��.(��ث{
���T-��I2&lbB
�
-��
����
-3Q���Ȥ��= ���^�\�}�h
-ё!�O��I�-t�;k�a>��B�->�c\`("@���K��l�q
-�!Z_�<8�ύo{���/̡#�õN�Y���c at W��	4�9�2Ր��P_ig�V�hm��
�ǚ�G䤒�!:�d������
�`s��y:i����K����n�aT
q��e5���p>8[�,��o0�3P
-c�\�Z9�
-�`A��1>��O��S�CC�j>��W>�bb���+�ƶy�n� 
��O�{ގ�a��=�J��c�4OS��u�jBs�|]�J����*v>��6�͡��Cd����4ݔ
\���տ��5H
x���XŦ�y�|�+'�
��|֠!U\e<$qp�2{�+�#�{h҈�Q��������\�&ԝ�j�M�E��cŃ�/��K�Ō����
$}�J��z��E֏^�_QT&�At�u���.�k�`���툸+M�:�M�Oͫ]��TZ:�p�:6����w�4~q�?M.N7	��ǽv+mA�Dٍ���`{CO ��ʔ�M�A��-��I�7
���f ����/
�r��*tN=.��S������6�D�@�+3l0٠,S�*�8� ��f-��r�H[xHY��A�[��0� "������۔�����+7�X&�s��A��^ݒ��)5H;�m�����CZ��=�*M�9�"�Ô���w�y/i�H��Qx� �s�AQ>�r�
-�
j���Ǝ�UOا�[�/�0�m����tO�
�\�c	V�o[$=PCMJ��ENQ[=$Ȓ�Y�����w~��_W��s[�Q�DŎ�jnP��
-	�A��֣��+�9"^��҃ҧu���^2�nW��k2Zw `
-endstream
-endobj
-3393 0 obj <<
-/Type /FontDescriptor
-/FontName /UALYPC+NimbusRomNo9L-Regu
-/Flags 4
-/FontBBox [-168 -281 1000 924]
-/Ascent 678
-/CapHeight 651
-/Descent -216
-/ItalicAngle 0
-/StemV 85
-/XHeight 450
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/asterisk/at/b/bullet/c/colon/comma/copyright/d/e/eight/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/percent/period/plus/q/quotedbl/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3392 0 R
->> endobj
-3394 0 obj <<
-/Length1 1647
-/Length2 16004
-/Length3 0
-/Length 16868     
-/Filter /FlateDecode
->>
-stream
-xڬ�sx�_�&
�vv̎m��;�m۶mu:��;�ض1�{�9s�:�7�̜?���U�����]��� QR�&ljo
���s�����P��5vuV��U����4w�v1�����((D��F.��vbF.@
�&� 4�� �����( ���N��. juM::�����`���_OgKs; ��7����-���/����*p� �,m� QE%-iI ���:@ht�[������	@��h�
���;l�� ��ۙZ�S�3�_.ag���hb��
�at��8 �l-���>,��NFv.���
`igb�j�O�f��J�����ۿ�_2%{gg'K�ߨJb��������Ζa���ߝ��&����/�/�_�������p�'�1`j��`c��7�_2'����lig������FN�6 at g�4��9����Uo��`��/o���_9X�8m��Y��4q������~��3�03��n������_D�O���M������`
-4�cT�w�@��2����
����"�����U��������J-�jc�`d���=g ��
����66FN���������������_wk��������Cۙ�U�3;��͖��
@S%K
��������]���dci�+�������,,M���Q��������W�U��"*'/-G����ڬ�+\�<
���IS���-���� xc��|c�d�{�^Gn6�����"b�ϵ�����@��������?~����/4�v&�����������_�`W'����k���?���@��nu�ބ7�*#;ӥ;dJLg��|$ԡ�Y��(�ξ�?#b����>��e����ҩ�Ǿ
��X�
Uo��������ON�� F�r��3��E�-m&���)e��w(™��N0WO4dnE�H~&�M�](- h
ŧg���O�TC�#ý7����ty��F�~��$).��N��&���n�������d�v����^�/,�?��gtEҝ�W-Z���F�-D�� ���Y�>�
dq&a��(���L��t2�Y�n�
��!�H0R�f�K{�h}g�h�X�VY'̆W}qUn;���H*�]q�)��%�o��o.��J<~K�*��r?�*�U��aE�	�@�J�=!}<wQ�S5c8m\/b*��Z���zo���Q��A/D�������a|jgn�+3��=��Ʃ�[�
�� �L��zKU�?8�Ќ���+ہEY�&z�7���Ue
-��3`��vW7cc7Ϯϫ���U��ʧ�&XD*#��u�K�X#]��+È.���i��dۂ��&|�_��-�o��5�3F�V8
����p5���E���ʫ�� �L����ͨ�g�N�*�'��C��0Hĉ��<�!�R�D�}?h�Zy���P]���
-�A���q)���;"7
�"��D��Ќ��,Z���w���I��~Ϧܙ�R
-�A��2~%76HT����t��-
��
ĭ�x�䉽E��0
1O�]!�<�����D�7� �VS���Our˞ZY
�Z|��z9�o�`�k&���-��9��'I'�b�B��P����-_�#�@�&$�W��89N�۰m�����;ծ�@M.hؓ9�a���{ۋ�|��ߔ�}}
�A'$T����,��4���'!]:����w���l#B�G覂�3 ��$X4���bPW�}Ev����
-�#���_��� �B`�Q(�.�l��.�1^Ӡ.Ƃ�Y��[���F^����V�*
☍�d�q��l�b9`b�$���
a{�����6�����w
�����H����W|�<��U�.ܽX�p簡?����y�@�R�QG@]���4�'�eD����	
�M�l�ӷI
a6g�fZ��~L�)��c
m*T����N%
-��S$N�W����7�<��9�_O��kk��>C��
k�]�Aх.��b^L���u=�W�2��;�
���C�a6�n
�I0���5��ƣ�5������t�zp~P�;S�5�#�b
[�J�,���%�u� AW���{$��1��-��gtꊥ$��y7�7���i8��A�u�i�D��4[d6v��a`F%F��_�`�iݔ
��V�����L�՗W�%WS�������0y�x�-$J��U�/K�n��g��[���~W_�nmB���늼��D���G�p'4N��\qwߒ�_*&ށf�ٳ����]��?ot�h"�M����"o"ߌ�y\N�i����2�N�qa��sx3�*�zո�([	��1v{W}����fzMO��u<3�����p�):���
:�@�f[D?�:'�-DM{ ��`1�~��R���' m'�H �
K�+=,�B
�n�-
�Y�áȚ�_W�6S	����2�G�ϯ)�4�&{��y�Q��捻K���7�������K�8ֹh%�
�p��*�OD!���>���S��e�Ybg�4�N g��z��ɯ��i?�i�h(���m�kĺ�6%�QUmf-5���'�L��:��/�a`��&ܤm�)����#��3�r,�@ַ��@��X�|nu����2`4��9§��P��A+I�
Rְ�+' �
�\���>Hd
-�Q6�=�#�k9
�

դ\��l�����_�{=c��2UZ���,HVg�t46�;,�=t�fK�ė��W���
Q�!o,ɒ1�O��f��;�9M����|�/�j�*0��
�(#���©�
J�S�W�3,+Y��^[v$�%&���ʜ�ul�=
-5�P?9E�V����#*�
�g#*?zB��\�$
q,-1lv>�#|�o��o���yIŎ0{�9]�֗I.�����`���x�u���
�"h�-%��>(��a]l�`���
9�lk[~�Yz�J�E�>6QN�S���YV�{�
r��
��� �M�!@�"�	T�0&������(^�G6�*
��O�I]x%M9����� 	i�ϧ�#�=��+}����W�N���w�h�<`Ku��O��
��EP��4\lC�
GS
��܃��14z_q9�U��feq`:i�6�z�I�ӗ5���H#7֝�����x�W �5
���o�n�BNa�*~���J��y��3}v�,r���JK4[�q}_0��@j��SA�0�#��}*
<��^/�]f'�y"�`�����fؙRs���ǖ��i��ҧ�F�i��p/e3������+zb���F]����f�d���J�u����S����?sC�����4��E����A��k��#!��
BL�[*�-�U߱�B��xpQ�� [...]
t_��)�_���懹t&e�_�Һ��g	�Tп���]VF�
X���pOM�o[��,���=Ͱ����

��[�y@����FX,`��j�E7
��
��N��`�Ǭ�$��k��}��"�5��
�b��}��]�
��^F4K.�7X�/��.u�����P=1�7b�i���s�.�����'�G������-{6�2�/ׇ��
-�^H
6r�uVKj1���M8F�K)���H��
ڶ�-١��!$��3�y0-�p^����ߨ��O_r���,���}�D(@r�*ಯ�r!���@v�Z�V�!<)}V
�+�T�)�<n-4Y���V�/���?�k��%�;9��,Vh2�����}P�m���V,}�
�/
-%D~|D׉i�
H/A)�&��*֥�ע�P$�R�1/M��N7�Z�r��/���cU��y�UL8[e��S

�SJI (sp�,�D�-�D%���16HП+<�d��8�v��������ʺY��e)O�Ȁ���� ���6 W�c%
���9=C���4��el
-�>�������AtcT�� +� x}=K���߅$t
2py/4�~�sR���
OFA����ŋ�^�Wc,'��I��1Oն��C
�dhA�%�g�K��%nc.�
�E��Q%5�^���S?`b��m�	C�
�%tS�u~=������
-]����w?p4`fmx?�"MOԷ8�l�%�/���.AU�c�g���M��|���t�Qu�L��X��n
�qX��6=�fS����D���d���	�j
-��i��S
-})bթ4� lR�JI�T��/����_�)�r;��'�O+���@�+-i t���&�
:��щh��L����Vk�S;kۇ7�sƄ�a~Et���j5�/�X�d��\��*R�h�����9z������ n�m��܁�7U/�/=�sT'�s��@#2���F�z���C��cV�W�a�=:{��­�[is����Jŝ�� b�!����T�]�G��
$�ή��J,GWݟ��%:�n���}c�Y� b���R��e!��S�͏jDB��4I9�H������υ3]ô
��K�� ���>V�Rf
���_�t��r�/�^��JDK%�
-���������	4�@�@�����M��F��'���u��I�ܘJ�����ر��ʞ��r[�

�%P� @���r0�Ιs𮴺�/�+o)��w�m��
m��`�*�y+̹��q�!�y���'H�_�Z�ɧ`VTB d*�le��8D4�W O
���E\���-9#����L�,[]�3�0Ó�1��@^�VM;��o��˼uV�xB�����@{:<ҡ�S�,��� ���U��S�N^���s��A
��%`;��P]��bP�K���"2�f�P(��ۇ�/L �-)�
�d.AtY�U-�^u�8|�:�OC	!=P#?Vy����ױw
��g0�Ră�!^8�F)	����N�r�c�H�22Pab���:�-�;g��wq/V�ۈ
3V�?<Fr���z������
�R;XN��8��z���rՒ�C���+l�>쵋?��3��;���#�U��s�ݣ�:����Z�O�[&�@!�v��=�R�1�)ĆZp�xG2x�2V̡�N�olXַ�J �1�<�]J����={��h�j�H��o2��橹��
�J&p����Ra#Ƌj_3���f_*Kr^ ��uӃ��u���6�A"$<gi �^r�RetntF$7���
�B�gр�
-�P�Q
���e�[�Y�%��Vװ
����
��.M���@���.�&G��ߠ\� 鵡?��Ɗ��X�
-� �8�s���qm�x�2���a{��x��[�Q �8gH��"�ny���K�eL��5�CtN|��4@���R�o&,}
�fι�m{�ʥs��g@z�G�ȹ
-X�!�'!����1of�B�_���g�����Y
=I����
��
-h�ռsQ�FS�(�Q�V�F����p}䲤��5bGˍ�ʤh����2B��'�{=�������W@`�{+nם֎��c��9�U%c�j�+�5��g�~}��Gx�n�6��Zc�eL
��(��
Xj�
i>�q���g�X;���C��C�����@Mm�lTz�HI�b�s�^���P�z��Y9oy�7��	�[H��3��S�c���u�8Y�`D.ZV.:�P�Mr��J�&����nz6CCo8㬅����r[3��_�id�6�C_��[���b���a�3�
-�1������!>i�|6��	���1`�|d�'o">9�,�fs���@q��8s
M��
�(��
-v��h��vA>���O
-\���SBH��ft*?>������Y�{������b���:D?߫
�-骶��y~
wW��-��lx��?�a�A�
-
fHhd��l5Jm��P�8tϼt����qH@{�!�Ktu~wk�ೋD��*:Y ��]�4�9
e���*��|�j��;������
h.�>Np>���k[碨�P�
��a����pc��]�b˵
-�\��JL0h"��3p�|�Yc�
�m�lO��%ϙ��W�0IP�7
 �7�pt
-�+���/�����f��M`�\�R��1�e1�
�x�֣�Ws>=\�N��#� 3��Z�yiK_���OD�UK�b/ە$ܴ��
�k�գI��8)����XF�3�D��(C��^��3ߊt��%0f���S��{"��5����SY_�Yݙηy�Vt
���%o�7�C��˯䲙
�C�0nߍr�_��40X�D
-nҝ2��0��j���ͺ ��]�t���9����ܻ@lu����N(����h�
)m��)B�#�90�c/o�#�[ط�A�G�ӉV�]u/�{;�ى�U��`
��;
��4���ቺ�
-�S,ÍAo��c��e
���*��
�W��`�B�i��O��({jFE�
E�
]
~I����E��:����g��|�(��*�l��
-h][/W�8ҝ��8!y�8��1��ѩ����Q�T����
t��9����
�f��%ƞ����E�!>��Z�5�
wQ��c
�����?��]��pB�v��^1�!�
�n,��w$L
����jn����s/ƛ�*yUd�|���o*�3�����FhY��#
zN*�N*��*���]�|DML��H;.�~E�_����
�}��D��p�e��nh�����n_��V��`&7�SsF8�e� ]E����8g�7.��
F,���s��=��I�`��j´�>@�Ol��a�hlw����m���z�$fj�vG߶��9�r���/�i*n���:���D2�gG��ͬ���k���0V��5��cb��L�
z�9����U�}��T�x�$m�e�h�EA0�S��Ҹ��٧�/�JE"4�_�1
n�`4!�&@��r�$;��S�6�g����H��a�v�5�q�AFۙ��0w��X
-�>A$B�љ
*Fo�����@lc
kKQ�r�EW}��(a�q�#�����V�ZH�K��ꈳb4���:���Sl�uj�������h�M���WS��tĤg1@��H���
.뙼�!`�=����"��	�����`�=z����aQC�z�#�l���ȶ ��z�I�t���h�l��_���&@��EZ����5��3��S5'���-nXʓ@��Y�6o�ی���Nc�kE�ə׎��6
��-�&v]

�ҥ����Q�K�z���
:����.�Օ��5v�m��
�Y�[���C��
?"��sg߮)&z`o�Ez�}��q�
-��|
UV�n"�,ˤ(]-Tɇ=���۱,��Q�
�k�k���������
��D
-5����w��L.d8��8R�aCCu��8Y��ާ�_�ȼ]ܞ�������ި+iJ]�'�ɚ�E�
�E�sV��h�P+ǿEf;3<�;�R7o{���
�x����V`7�]�g�}]I���,��Q��r���%��r���m�޾�]w���Q�������}��E����h7<��b����JPt��фn�������
�:Gu�v�ҹ�
���C�更 ^Ry�|�uϯ}eˠ�S��^h���&��
c6�O����
'C$���E�Ŷǻ�3�6~���n-
:���D��
\��BV�����w).��
դ���]�?j�4��O�O	�ӽz�e��ӄ�����y=c9��6�
P�{P����zp�˔���$��<�=�/,eGt���c��$�����[�������P��c�)����bx��U,
-��3���@B���g8�
j�� �V��a��㣡O������$ٝ!�U�����(�v
��0�4d2�Q� �Z�7VM�����8$�H`b�����=6��Z׳q8�?��j�c�|)�EP}>��5�,Z��a3�8�rƋl���:�
�]��}5�ʋ��3��"��������E<���
��e:�Ia�ڣC+"n�™�[Q*+��v��n��/)�$
-���5=��\���Y������dwg��A���,+�&#�e	dgr#��"��K��F*:�X�(P�
:.��>� 9B�)K^��j��
J�=�;��?�\�+c��ԊE�2y�ye�LL����rD�����L�t�{�Z{gM�0�j1�?�L.�#e��H��
�b}��-�L8�Q�V��{��yϴ
!�Pe1k��J:�|- y�X�Nj�� ɾ�8}P���nn:�7�T��Io�7I���vT���̠��[���F�����H�Z�T��"6-���Zfrߛa��q\_(�!���V��|��4ށ
hhk
��$�M�G�;��ڦ��a��?��(
X��x�ޥ 3������`���K��j��m���H��[��c.�}�w�3���/���.@*�7���<ךX��Ȩ�
sL��u�� ɓ��0"����G��$�6��
�)�N�ٽBa?Z'o�
,�z�8�8�MW���h���
A��7�!*`v>��"A�//_�KI
Ŏ��Vĺ��?N���7�^�%U99Թ�MQZ09z&'�t�k�
��
;u=�uS��X�Y?l�
�}����@�<E_��������aQO�8\~0�'
S]όw�U�Jɰi�jp��k0���l\љ�<�u
�ݻ�f;�Yj1{xw$х[7��TIAFT�(-����K:�����q�E�97u%�$
N�%��&T�!Z�yy|/�[*R�DTT
-
��^R��
�fS]���
���"�2����fe��.ݒع����"��tٳӋ�,Y݉��Q�>}���`��BF��� ���Pt
A�Z<&�9�2�̽JL��a��7
�$��^��
-�3}}s�>u��
�����<�xWUcR�����u��BC`�n�IcA��(��P�1�
��l�fA���Q(-���.���>��Dz�u�-��P+��v�o������u��
��(�٦RR�p��FԐ7�p/&����XTZU(�<�>X��U�AX�
��A��:a"�<䡕�>�#� u�A�3u�k���.������l9tV��:W�%߬��'̺�s��Ix=���s �PoLKMƃ��]n���q�Յ���NJZUz7����:���S{"���l�
ټ����W�Ӭ7���ⷌ�����ֲ�T�OޠH��A�guS}t9�����6�J�����-�A���ЏKp�ՆN��2 ��{/4(\e=G��sITNF���
���z���g�T�T
5��=��6|��o����j�9�{�'g2}]'�Ѝj7�����!�&�Dl~�\��
&6�4��=�=���,��*��^\�I	���!�h+�~{�D��>H ��Q�z��Ѝo0�����av|�X(�a�����8L_��7�Kh�lZ�1uKmk�ecX���K�$5����zҩ ��no��vn�v�r�$�U�H��r\���'Z5���Td�+*6����/&?]��
w�
t�M*FccF~�@�#}{�6�^W�+-ػ*6z��7���5�{�Ml$�}[
��l�70�XN_�. ����t<���>)��U�k��;І2���
��%ޤxU�x ^���Ƨ��aD���(�k��*q��>?�L�w`q�=I
$�L�+�8SQ݌���g|bƇ.�N�W�
-	ǫ�Ҿ���°
L-"\�W)~�k�
��
n������\X��#2�g"U�J�:�+Ͳ���!�Wn������o:5R4r���z������I�G�Qn��'�:�}�B1]�?�=A^0��|�݊���Z����CX��3�l�n�SB�`�1���S5�����;l+�&��2�����x��,��fU#�Є
�v,a��G+���g,(0e��#ǢT!�=��cz3B����EV�kl
fOn
Lt�&G�f�OZ����� �p�+�
g
�)�>�)�����D_LW�n��-
�2���g�o��?��"�l����KOU���z/��5�;gcK��G���Br
��f��;��	z ��	��8
?΍�<���VO����}�>��R�����b؞���i�ە�İ1tcF4?{u�HݝfJ��qO���P���*E�����0�"�����_��	��޶��K
�
La9�øN��1�F���bv/���t(��OICv�1 { ��ڝ��U���)���z��

-`��1��m�ѹ���8��ux)�~�eT;�!��3�����t����i����6/[f����Y�M�ͮ����7�)�]��~�zK飔u�h!�b|
-<{YHlc�;�F�wxY'��̕��sUb���-#JIhM�hV�7�AG
R�%�PU�v��G1ݙ�$h�І��~�0��>����x�ӈ�t���(�ƻ��)�����f��~����Ԑ'%�~ g��PE�Y!
�K�8 >���0"�KS&�� ��^�v+q	ε�k�I�4v��`'�e��#L�����1��sC��f��
-ï:cs�]�H&�.�
��+SDŽ�����uk�m�=�0��g�
|��e�
�4��$wB������O��w�(

���
�+�|��WP��Y
-ħ|k
-*��B�HײW���6Kn�Si�'�(E�J��'ibYf`�R;����hBUj�~��iK�j��n������3:
��ζ��W�4��z���ޯ�S:���#�uH
�e��lsn�� @��M��8�^p�u-��
:�$�wϏj�L�
-�ٙ�V4Yۆ}R�D�;��sǟ�p��Pl��:�������G�Ma��R����c�
䠊�
-k����)�{V�W���_M��Ėm���=!�
-��b/��Q��.��P
 �ȼ�/6ߒƢ�1`F��(H�"/���"Sq8��e���j�x�Q�)6cLV�ꮬW{ת~��wT��9r�0
�����c�w�p�%�
�M#%�0!�F�.�I|ӿ_;��8��x�wH����x�w��җ�Wv�X����E"�_��1��C��
+��X�����@�
�9;���O��>u&`��%0�~ް%0	�����*�]����ψ�H1(+
��Q�,����x�(]](��4I%i�U �d��wJ��W��.i�
r���Ѐ���N;kE�N���Y5�ׯ�W�+�����$N��أ�m;w�������W�~Y���*��:���"��g���t��ͳI���~Q
Vz�N��s?�
Ve����m/�m��QN�o�������R���9|s��xz��)�<�r a�'2w����S2qG!}�!�� �
!�{n;鬛U�,�_?8˺���	5�e&<�ի�kq�1q�=���Pi���8<�."�p�}�&MJ��預�r,L ��L4��J��h��uƗc��zX!����٩3$�.zQyWi��
-s`��p�u\a�:�vY촭w�8��~��'z��[�m��6♙����Z�z�,a�w���F`,����U6���j��
-#[5A'�Cb%�ɠj�
-��"�Z��@R��@�b��AAԉ�+�pZ�F3?H��=��BM��� u���Mc���@M	4�*O#��o���N�&ޗt��]�ϟ�x?)C��N'a"�ދ�TYsx�
�!<�:�ӫ��)zA-���L���\�V��nq0N}��^}
`b�4�f�`�}�	��s�dR��*{�;o5Ξ
���X�IaH9��}oP�j���g�D~����P��(,\[(kff�;�|�螉�S����'9i��K˱��wy�>y�cYW��S�x��u�g,�
��e,��ܐ�ٴR4��
������
!B�R�
�V^�;d���.I-B(r)�d}k�qq~�<*ZG�Nv
<5p�OI[��]��W�Vq�y0�Z�ʰQ�VRVy�b�w�c���w�(�:�b��u��A�I�z
�3oaJJ�t8�Ғ�ޘRVH<�����J0��`�(kY�i�"�&�4����c�ٗ\�BhGП�w7݊L|�
%,���s5{'�����0�L
-%�@�|A&��b�m���]�+x���E�����1�2o��)��)��<{����E�^ٰw�֬H1���^�*"* �����b��9�����\l���`=�$�;�Ƿ�_�?����0ۤ�vKS�_�<��
<z�a�"�8��&���#�aș�з���p�N��Cj�F���we���cL���#u2A��=T���5zT]o]L�ƥJ�D*
%|u�Tœ���o�����
-�f?Ln���B�VM�
�I�-�t(�X�6}O�7"<,r!��OM5AXH'���/����9���$�J��ND_꘿%�J=�,:
�H4�XYF&i�g�4�3�v̿�Ӟb���lh���\:��@��F2��<U_`�W9�n#���ҽ���ղ=X��7|��ՙ6����21�Q!�˷�M8Jc� W��G_���dC�;�IW���qI����%��F}�hƜ^�9�Ap��k��m�����
�K�I�q���)�x;
3k;oD�A��V0��O�Q-���b%�[*���e *��
��j���JCܛǍ �ȫ��1�f�A���g&/�wj_�{x,a�g)��
��V"
��
��V~���
�]�h�@�U
���QF��o��w�I>�I�fS�)�2���\���8�U�wE65��{�\x�(<{��`?�p
-���X�Z*;

0��A��
�O.>͠�_�.�-ơ�93�~OS�3!m?����qUQ� �z��*�ḑq��;��x����GN)aU��>hT �
�����V��J��/��m��'C6WV{hX/���a���KX�����a"D�'�k[$k˛h��M��1�δ#0c�bC
 ��Z��v�o<������?�@�S͏Dq�c'd�n�C��ą
A��NǪ��ڥv`ع��TYzmS��1x_8?kZ����[͉	xemlf$���{�,N9u�Mg����!?��u�&�7�Ƌ�#���H�x�*��u_v����:���X�s{;<�i8F��
��i;	W���n��YM�ʃ�"�<�&h��%�����M��
B/ˑgz��힠蕪��s1]�X�oJ��O��D���m
�`�X�!Ta����,A�a�QJ��z�%��I �^��CV��Z��6I��J�༙;"��Xu��R�Jߩ��laZ���nM�.&�ݑ
��$b(�['��viS�#cE�˒��.�����Y��
�.V������y
y4?�?���\���Y��	���~0WO���1s�"BM@�����j\�캎�l���J�Q?�"?��A0���� ��U�q�%���@P�v�;*{�I�f�"�$��y��5��˕>��,��l�t���;
��#���Q��jR��+
��3^Ş�r���F$画�?

l;���K
�<��WQ� J�L
XR�|�F
j0c�c� �+�tL��$�9LO9��R��%h�<ʼ:��3nD$Xt��21#P��23�qc�H0�e��&K{�;*�	���*�s�ڒ����
-���Rl����&i�?/��9�
�h���ْ��]r����
��=Vu��u<V<�nB�)
���=k�
�3����*"�j��>�
2ۦw�!���'�n$�e�5NuLQX
#'����c��
�@F����ޑ���w@&ُ�%�Bjx9���Q��]�7��G/2��iL��f�[��s�y�U�77���5�
-^��NFF.�j
}�.� F�*Z�&�X�r�g��\
&͐q^���FGƐ���
=�6�G��
dC�Kr4�^�<��=�}��
-HK�M
򎮑�>���)h7��^'�߷�<qi�I�״�D��؉����~\� �


��9�
7o at N
}��a�*��
�T���Xޠ�t���{����v�8��W\�
!��2���~����D���D������g�Tv�D>FHl�%�:xMAz��2���>
4�SNˍZ�)F|�������j�h/J��eP�<��R�
�NAӹ���A��ּ_���"RJ�-�r.I%I
#|����-�A�
�[��q�LT+����x&Ѵ{3&i8,7
���Ӌ�����A�Iy��jE��FK�`f���RUDZwr�����
�`؄Y�y���7A�3��
4܍-s���i{�mt�\o�U�)/2N�
O���X܊�c�����yK=�%����"Oޔ�z���lq�q}ŐiK�5�P���I��-�]t��
�W�����LJw�n�| �����X��s��nzj��ՙkz�QO	Q�{f���fw�����)��� [...]
��x�&��O�biFBuB|.��
,
���`�pu�j\��Qr|N}�N�~d��q�ա����jJ��'J��m�;��q�r�Q�p0���l�
c�1J�6'�n3(���40|�Q^�
-`��|8�&���|�n�xbc���"�Ԍ��J�kpy�k�������J8�Bj���Ơv��H�:0C�����%;)3�?���PA��
x4W�b��vR�`2�Rz�����8�9'Yi���"
�������}F-�
�׉�iU�O��Eٟ���k�$؂Q
	��
�}��
��j�.e�
�:�p
ª�
dA�iш�
�����K: �r�ط�O���K5
-�ʛ�
�9A��|^��)萸���ɔ/��J�,gki��s�쳛!C�Ì�Lw0/�yƄ�J���{�f��.��%��U!�X�d��sE�M%�R:Kٻ� ���qrǫ��6�]�p۶����+~��GZN?
�0U��M�4J�6ľ�v�~
�6H�V�Q#��1�a;�
�&M���3�
�� �kY
�}���
-+P���{��f�$�L�g#C$
?�
�
��g�lE�b{ ����N0���0�{��
Y�Y`=�S�8Uq�����[H�E%}uo���9� �]��P�4�j$ڤg�
ӼZPX"�ˠ�!0~��C��2#���rc���X���I�b���U@�
���(��‚���+?� DfO�be��{%���mḳ�������]d��ڷGT�����l�W���-&�����S�g��������ZA�~܌
- ���&,�� ����~�
q(��0��T͟��<�
!�iVԮ�s��<�V�_�$��_j�(
-7��M�}׎�7�6�Q�d<�zG���
�Ж���3� ﰖE�R l��=�(�\�����(Z�K�9y��%r��٦��P+�Ym���ɖ
��ølR�>�����,��"í��#��B�����l-��C^��:t�a��V�
-[U�����tLƊt��MXfK���5�W
-k��t��/�]��le�6��Y��_ڻނ{�i�����ΒY�t�h�Z��$ڦ
����U�#�A|A�{��M�ﺼ�/
M�?��ӸX�)*�TΙ9� �K� uݹ�5!	��vB��q fVcC�V�f�k��uB�z/���8��^��@�{o�bw�R �ax�#��
�#:V
gi���
y��oA|�GR��Sz�Uqw�`����y6{���	�����4�Zi�8j�!u�xU���S|����۽���K8�����n��:��~�{��ʟRۏM���~���|S�
��<�쩐��o~ED

�Bxq���ڌ�/�ĥ.	�4ѢW!첌T
-J�VQ�+Z�)�^HȜ�A8n�:�d�<�ۈ]+n�?��6������~꣰�Q�i�Z��C!
���F�¸��������J��
ޝqO��>��P76os�����A:�e
�������
iF.eȹKҗ���d)w��lZ��y�)����H%p�$L�k�J�5��'QHi(�l��~5I�4~��|�o��~������b;����ĵ�[z�`>LJ!��⅍#�I˴�����no��.n�}���aA�bQ��)Wvwj�3��j+�\;��W�����N�W>j�p�Zz�l���[Y��y�8=���~Zn �ϒJ4��F��e3�� 9�x���m/!q����z�� g�?�M&B�t�"n
}�J�3$�ӈ��7tl�o�
�'?�e��6�
Am���+�� ��
-Bų7�GN��zJHD?�@2t�g1�WH�}#+��ae��5$�K�TͨOQ6B�rZy�~��������볰�2i&+�Mȅ،>��km
\���70^�>�0n&sb�HA����P�[3���5�ʿwr�.��k���XY+"�Kn'Q��Ӵ6�9�l��k�m�18F
2_���`A���n!D����e@�%J���
�&�lD�eG�Oa�2�X�K���_jz�ۿ1�L���ӳ�=/M��V��w��
J����7VC �s<ѐ,(/@�S���"\�����6G���V���3P�9�/�H
�#*�N��
9k��,�?��xO�]�UBI
	fwh
2w��什1�4�jU0˞��e�3�z�.H(�D�R�F?���
-�*n�9"��W�r'�Fw�V���t���@1�HKܸN@?�tO��N?9'CQ¾������-� pt�F)��y
�
[�k��r��ϣx��'���g��V�#�3�o�
9<O[;�Q��b�.cfqVl<�Ӓ(��2��
���Q�{��ﺒ(7w$�(��q��#6��!�A��P�N+���ǟ)�`��X|Ώ
s�;s}O��͙��5����y�
����G � $��I�K;�Fb�v4E�p����g&�'����t�\��s�G+���
p!��}�W0p
�<�w�61%���,&�ɦ�
Ⱥ�g���;NV0x�" ��<����o�(�[�$d
p�E.�����o~&j�g��l�B'͖ ��w�O�i��<�� �q�KԒ/�Ư��,w�D{�da�7"�V⣠6릳OɞX�o�k	
�<l��ϩ�N)�Vq��h�Q?��:_�
-endstream
-endobj
-3395 0 obj <<
-/Type /FontDescriptor
-/FontName /RCLMIL+NimbusRomNo9L-ReguItal
-/Flags 4
-/FontBBox [-169 -270 1010 924]
-/Ascent 669
-/CapHeight 669
-/Descent -193
-/ItalicAngle -15
-/StemV 78
-/XHeight 441
-/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/Z/a/b/c/colon/comma/d/e/f/fi/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
-/FontFile 3394 0 R
->> endobj
-3328 0 obj <<
-/Type /Encoding
-/Differences [2/fi/fl 34/quotedbl 37/percent/ampersand/quoteright/parenleft/parenright/asterisk/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon 61/equal 64/at/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft 93/bracketright 95/underscore/quoteleft/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z 147/quotedblleft/quotedblright/bullet/endash 169/copyright]
->> endobj
-1171 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /LBWBDW+CMEX10
-/FontDescriptor 3345 0 R
-/FirstChar 80
-/LastChar 80
-/Widths 3325 0 R
->> endobj
-387 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /EFRBIB+CMMI10
-/FontDescriptor 3347 0 R
-/FirstChar 46
-/LastChar 120
-/Widths 3336 0 R
->> endobj
-1018 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ZGGNQH+CMMI12
-/FontDescriptor 3349 0 R
-/FirstChar 60
-/LastChar 62
-/Widths 3331 0 R
->> endobj
-1763 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /OMWOOP+CMMI6
-/FontDescriptor 3351 0 R
-/FirstChar 100
-/LastChar 117
-/Widths 3321 0 R
->> endobj
-1172 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /PPNWOF+CMMI7
-/FontDescriptor 3353 0 R
-/FirstChar 100
-/LastChar 117
-/Widths 3324 0 R
->> endobj
-2545 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /DGLWIM+CMMI9
-/FontDescriptor 3355 0 R
-/FirstChar 46
-/LastChar 120
-/Widths 3318 0 R
->> endobj
-437 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /GYIKAE+CMR10
-/FontDescriptor 3357 0 R
-/FirstChar 40
-/LastChar 118
-/Widths 3333 0 R
->> endobj
-2543 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UVIORO+CMR6
-/FontDescriptor 3359 0 R
-/FirstChar 97
-/LastChar 120
-/Widths 3320 0 R
->> endobj
-1174 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /VWYYIV+CMR7
-/FontDescriptor 3361 0 R
-/FirstChar 48
-/LastChar 120
-/Widths 3322 0 R
->> endobj
-1162 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /EBURFX+CMR9
-/FontDescriptor 3363 0 R
-/FirstChar 40
-/LastChar 118
-/Widths 3326 0 R
->> endobj
-301 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /HQMTAG+CMSY10
-/FontDescriptor 3365 0 R
-/FirstChar 0
-/LastChar 54
-/Widths 3342 0 R
->> endobj
-303 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /VYEUCT+CMSY6
-/FontDescriptor 3367 0 R
-/FirstChar 3
-/LastChar 123
-/Widths 3340 0 R
->> endobj
-1173 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /ZQLTBN+CMSY7
-/FontDescriptor 3369 0 R
-/FirstChar 0
-/LastChar 48
-/Widths 3323 0 R
->> endobj
-302 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /DFVRAV+CMSY8
-/FontDescriptor 3371 0 R
-/FirstChar 120
-/LastChar 123
-/Widths 3341 0 R
->> endobj
-2544 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /JZJKNN+CMSY9
-/FontDescriptor 3373 0 R
-/FirstChar 6
-/LastChar 50
-/Widths 3319 0 R
->> endobj
-1161 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /YGAXLK+CMTT9
-/FontDescriptor 3375 0 R
-/FirstChar 49
-/LastChar 109
-/Widths 3327 0 R
->> endobj
-2650 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /OAKMXN+MSBM10
-/FontDescriptor 3377 0 R
-/FirstChar 81
-/LastChar 81
-/Widths 3317 0 R
->> endobj
-326 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /OLGIQR+NimbusMonL-Regu
-/FontDescriptor 3379 0 R
-/FirstChar 34
-/LastChar 122
-/Widths 3337 0 R
-/Encoding 3328 0 R
->> endobj
-507 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /PKMHPR+NimbusMonL-ReguObli
-/FontDescriptor 3381 0 R
-/FirstChar 39
-/LastChar 121
-/Widths 3332 0 R
-/Encoding 3328 0 R
->> endobj
-426 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /HHESAH+NimbusSanL-BoldCond
-/FontDescriptor 3383 0 R
-/FirstChar 2
-/LastChar 122
-/Widths 3335 0 R
-/Encoding 3328 0 R
->> endobj
-1084 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /HJFXOA+NimbusSanL-BoldCondItal
-/FontDescriptor 3385 0 R
-/FirstChar 2
-/LastChar 121
-/Widths 3329 0 R
-/Encoding 3328 0 R
->> endobj
-300 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /OKHTIE+NimbusSanL-Regu
-/FontDescriptor 3387 0 R
-/FirstChar 39
-/LastChar 121
-/Widths 3343 0 R
-/Encoding 3328 0 R
->> endobj
-324 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UGGNXB+NimbusRomNo9L-Medi
-/FontDescriptor 3389 0 R
-/FirstChar 2
-/LastChar 150
-/Widths 3338 0 R
-/Encoding 3328 0 R
->> endobj
-1051 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /JRLFVU+NimbusRomNo9L-MediItal
-/FontDescriptor 3391 0 R
-/FirstChar 97
-/LastChar 121
-/Widths 3330 0 R
-/Encoding 3328 0 R
->> endobj
-304 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /UALYPC+NimbusRomNo9L-Regu
-/FontDescriptor 3393 0 R
-/FirstChar 2
-/LastChar 169
-/Widths 3339 0 R
-/Encoding 3328 0 R
->> endobj
-428 0 obj <<
-/Type /Font
-/Subtype /Type1
-/BaseFont /RCLMIL+NimbusRomNo9L-ReguItal
-/FontDescriptor 3395 0 R
-/FirstChar 2
-/LastChar 122
-/Widths 3334 0 R
-/Encoding 3328 0 R
->> endobj
-305 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3396 0 R
-/Kids [294 0 R 309 0 R 321 0 R 334 0 R 384 0 R 418 0 R]
->> endobj
-430 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3396 0 R
-/Kids [424 0 R 435 0 R 442 0 R 449 0 R 456 0 R 463 0 R]
->> endobj
-473 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3396 0 R
-/Kids [469 0 R 476 0 R 484 0 R 492 0 R 504 0 R 511 0 R]
->> endobj
-519 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3396 0 R
-/Kids [516 0 R 522 0 R 527 0 R 533 0 R 559 0 R 594 0 R]
->> endobj
-633 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3396 0 R
-/Kids [630 0 R 683 0 R 747 0 R 797 0 R 841 0 R 869 0 R]
->> endobj
-899 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3396 0 R
-/Kids [894 0 R 928 0 R 953 0 R 972 0 R 992 0 R 1013 0 R]
->> endobj
-1053 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3397 0 R
-/Kids [1045 0 R 1075 0 R 1101 0 R 1122 0 R 1156 0 R 1194 0 R]
->> endobj
-1230 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3397 0 R
-/Kids [1219 0 R 1238 0 R 1277 0 R 1299 0 R 1327 0 R 1357 0 R]
->> endobj
-1396 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3397 0 R
-/Kids [1382 0 R 1401 0 R 1418 0 R 1444 0 R 1483 0 R 1519 0 R]
->> endobj
-1568 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3397 0 R
-/Kids [1556 0 R 1600 0 R 1633 0 R 1662 0 R 1703 0 R 1758 0 R]
->> endobj
-1799 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3397 0 R
-/Kids [1789 0 R 1808 0 R 1829 0 R 1854 0 R 1875 0 R 1898 0 R]
->> endobj
-1938 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3397 0 R
-/Kids [1925 0 R 1950 0 R 1972 0 R 1991 0 R 2039 0 R 2080 0 R]
->> endobj
-2107 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3398 0 R
-/Kids [2101 0 R 2114 0 R 2137 0 R 2156 0 R 2174 0 R 2210 0 R]
->> endobj
-2269 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3398 0 R
-/Kids [2253 0 R 2285 0 R 2317 0 R 2343 0 R 2382 0 R 2456 0 R]
->> endobj
-2548 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3398 0 R
-/Kids [2539 0 R 2612 0 R 2647 0 R 2670 0 R 2689 0 R 2709 0 R]
->> endobj
-2750 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3398 0 R
-/Kids [2734 0 R 2758 0 R 2785 0 R 2808 0 R 2830 0 R 2853 0 R]
->> endobj
-2893 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3398 0 R
-/Kids [2876 0 R 2903 0 R 2927 0 R 2948 0 R 2969 0 R 2992 0 R]
->> endobj
-3025 0 obj <<
-/Type /Pages
-/Count 6
-/Parent 3398 0 R
-/Kids [3013 0 R 3028 0 R 3088 0 R 3163 0 R 3263 0 R 3314 0 R]
->> endobj
-3396 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 3399 0 R
-/Kids [305 0 R 430 0 R 473 0 R 519 0 R 633 0 R 899 0 R]
->> endobj
-3397 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 3399 0 R
-/Kids [1053 0 R 1230 0 R 1396 0 R 1568 0 R 1799 0 R 1938 0 R]
->> endobj
-3398 0 obj <<
-/Type /Pages
-/Count 36
-/Parent 3399 0 R
-/Kids [2107 0 R 2269 0 R 2548 0 R 2750 0 R 2893 0 R 3025 0 R]
->> endobj
-3399 0 obj <<
-/Type /Pages
-/Count 108
-/Kids [3396 0 R 3397 0 R 3398 0 R]
->> endobj
-3400 0 obj <<
-/Type /Outlines
-/First 3 0 R
-/Last 63 0 R
-/Count 10
->> endobj
-291 0 obj <<
-/Title 292 0 R
-/A 289 0 R
-/Parent 63 0 R
-/Prev 287 0 R
->> endobj
-287 0 obj <<
-/Title 288 0 R
-/A 285 0 R
-/Parent 63 0 R
-/Prev 283 0 R
-/Next 291 0 R
->> endobj
-283 0 obj <<
-/Title 284 0 R
-/A 281 0 R
-/Parent 63 0 R
-/Prev 279 0 R
-/Next 287 0 R
->> endobj
-279 0 obj <<
-/Title 280 0 R
-/A 277 0 R
-/Parent 63 0 R
-/Prev 275 0 R
-/Next 283 0 R
->> endobj
-275 0 obj <<
-/Title 276 0 R
-/A 273 0 R
-/Parent 63 0 R
-/Prev 271 0 R
-/Next 279 0 R
->> endobj
-271 0 obj <<
-/Title 272 0 R
-/A 269 0 R
-/Parent 63 0 R
-/Prev 267 0 R
-/Next 275 0 R
->> endobj
-267 0 obj <<
-/Title 268 0 R
-/A 265 0 R
-/Parent 63 0 R
-/Prev 263 0 R
-/Next 271 0 R
->> endobj
-263 0 obj <<
-/Title 264 0 R
-/A 261 0 R
-/Parent 63 0 R
-/Prev 259 0 R
-/Next 267 0 R
->> endobj
-259 0 obj <<
-/Title 260 0 R
-/A 257 0 R
-/Parent 63 0 R
-/Prev 255 0 R
-/Next 263 0 R
->> endobj
-255 0 obj <<
-/Title 256 0 R
-/A 253 0 R
-/Parent 63 0 R
-/Prev 251 0 R
-/Next 259 0 R
->> endobj
-251 0 obj <<
-/Title 252 0 R
-/A 249 0 R
-/Parent 63 0 R
-/Prev 247 0 R
-/Next 255 0 R
->> endobj
-247 0 obj <<
-/Title 248 0 R
-/A 245 0 R
-/Parent 63 0 R
-/Prev 243 0 R
-/Next 251 0 R
->> endobj
-243 0 obj <<
-/Title 244 0 R
-/A 241 0 R
-/Parent 63 0 R
-/Prev 239 0 R
-/Next 247 0 R
->> endobj
-239 0 obj <<
-/Title 240 0 R
-/A 237 0 R
-/Parent 63 0 R
-/Prev 235 0 R
-/Next 243 0 R
->> endobj
-235 0 obj <<
-/Title 236 0 R
-/A 233 0 R
-/Parent 63 0 R
-/Prev 231 0 R
-/Next 239 0 R
->> endobj
-231 0 obj <<
-/Title 232 0 R
-/A 229 0 R
-/Parent 63 0 R
-/Prev 227 0 R
-/Next 235 0 R
->> endobj
-227 0 obj <<
-/Title 228 0 R
-/A 225 0 R
-/Parent 63 0 R
-/Prev 223 0 R
-/Next 231 0 R
->> endobj
-223 0 obj <<
-/Title 224 0 R
-/A 221 0 R
-/Parent 63 0 R
-/Prev 219 0 R
-/Next 227 0 R
->> endobj
-219 0 obj <<
-/Title 220 0 R
-/A 217 0 R
-/Parent 63 0 R
-/Prev 215 0 R
-/Next 223 0 R
->> endobj
-215 0 obj <<
-/Title 216 0 R
-/A 213 0 R
-/Parent 63 0 R
-/Prev 211 0 R
-/Next 219 0 R
->> endobj
-211 0 obj <<
-/Title 212 0 R
-/A 209 0 R
-/Parent 63 0 R
-/Prev 207 0 R
-/Next 215 0 R
->> endobj
-207 0 obj <<
-/Title 208 0 R
-/A 205 0 R
-/Parent 63 0 R
-/Prev 203 0 R
-/Next 211 0 R
->> endobj
-203 0 obj <<
-/Title 204 0 R
-/A 201 0 R
-/Parent 63 0 R
-/Prev 199 0 R
-/Next 207 0 R
->> endobj
-199 0 obj <<
-/Title 200 0 R
-/A 197 0 R
-/Parent 63 0 R
-/Prev 195 0 R
-/Next 203 0 R
->> endobj
-195 0 obj <<
-/Title 196 0 R
-/A 193 0 R
-/Parent 63 0 R
-/Prev 191 0 R
-/Next 199 0 R
->> endobj
-191 0 obj <<
-/Title 192 0 R
-/A 189 0 R
-/Parent 63 0 R
-/Prev 187 0 R
-/Next 195 0 R
->> endobj
-187 0 obj <<
-/Title 188 0 R
-/A 185 0 R
-/Parent 63 0 R
-/Prev 183 0 R
-/Next 191 0 R
->> endobj
-183 0 obj <<
-/Title 184 0 R
-/A 181 0 R
-/Parent 63 0 R
-/Prev 179 0 R
-/Next 187 0 R
->> endobj
-179 0 obj <<
-/Title 180 0 R
-/A 177 0 R
-/Parent 63 0 R
-/Prev 175 0 R
-/Next 183 0 R
->> endobj
-175 0 obj <<
-/Title 176 0 R
-/A 173 0 R
-/Parent 63 0 R
-/Prev 171 0 R
-/Next 179 0 R
->> endobj
-171 0 obj <<
-/Title 172 0 R
-/A 169 0 R
-/Parent 63 0 R
-/Prev 167 0 R
-/Next 175 0 R
->> endobj
-167 0 obj <<
-/Title 168 0 R
-/A 165 0 R
-/Parent 63 0 R
-/Prev 163 0 R
-/Next 171 0 R
->> endobj
-163 0 obj <<
-/Title 164 0 R
-/A 161 0 R
-/Parent 63 0 R
-/Prev 159 0 R
-/Next 167 0 R
->> endobj
-159 0 obj <<
-/Title 160 0 R
-/A 157 0 R
-/Parent 63 0 R
-/Prev 155 0 R
-/Next 163 0 R
->> endobj
-155 0 obj <<
-/Title 156 0 R
-/A 153 0 R
-/Parent 63 0 R
-/Prev 151 0 R
-/Next 159 0 R
->> endobj
-151 0 obj <<
-/Title 152 0 R
-/A 149 0 R
-/Parent 63 0 R
-/Prev 147 0 R
-/Next 155 0 R
->> endobj
-147 0 obj <<
-/Title 148 0 R
-/A 145 0 R
-/Parent 63 0 R
-/Prev 143 0 R
-/Next 151 0 R
->> endobj
-143 0 obj <<
-/Title 144 0 R
-/A 141 0 R
-/Parent 63 0 R
-/Prev 139 0 R
-/Next 147 0 R
->> endobj
-139 0 obj <<
-/Title 140 0 R
-/A 137 0 R
-/Parent 63 0 R
-/Prev 135 0 R
-/Next 143 0 R
->> endobj
-135 0 obj <<
-/Title 136 0 R
-/A 133 0 R
-/Parent 63 0 R
-/Prev 131 0 R
-/Next 139 0 R
->> endobj
-131 0 obj <<
-/Title 132 0 R
-/A 129 0 R
-/Parent 63 0 R
-/Prev 127 0 R
-/Next 135 0 R
->> endobj
-127 0 obj <<
-/Title 128 0 R
-/A 125 0 R
-/Parent 63 0 R
-/Prev 123 0 R
-/Next 131 0 R
->> endobj
-123 0 obj <<
-/Title 124 0 R
-/A 121 0 R
-/Parent 63 0 R
-/Prev 119 0 R
-/Next 127 0 R
->> endobj
-119 0 obj <<
-/Title 120 0 R
-/A 117 0 R
-/Parent 63 0 R
-/Prev 115 0 R
-/Next 123 0 R
->> endobj
-115 0 obj <<
-/Title 116 0 R
-/A 113 0 R
-/Parent 63 0 R
-/Prev 111 0 R
-/Next 119 0 R
->> endobj
-111 0 obj <<
-/Title 112 0 R
-/A 109 0 R
-/Parent 63 0 R
-/Prev 107 0 R
-/Next 115 0 R
->> endobj
-107 0 obj <<
-/Title 108 0 R
-/A 105 0 R
-/Parent 63 0 R
-/Prev 103 0 R
-/Next 111 0 R
->> endobj
-103 0 obj <<
-/Title 104 0 R
-/A 101 0 R
-/Parent 63 0 R
-/Prev 99 0 R
-/Next 107 0 R
->> endobj
-99 0 obj <<
-/Title 100 0 R
-/A 97 0 R
-/Parent 63 0 R
-/Prev 95 0 R
-/Next 103 0 R
->> endobj
-95 0 obj <<
-/Title 96 0 R
-/A 93 0 R
-/Parent 63 0 R
-/Prev 91 0 R
-/Next 99 0 R
->> endobj
-91 0 obj <<
-/Title 92 0 R
-/A 89 0 R
-/Parent 63 0 R
-/Prev 87 0 R
-/Next 95 0 R
->> endobj
-87 0 obj <<
-/Title 88 0 R
-/A 85 0 R
-/Parent 63 0 R
-/Prev 83 0 R
-/Next 91 0 R
->> endobj
-83 0 obj <<
-/Title 84 0 R
-/A 81 0 R
-/Parent 63 0 R
-/Prev 79 0 R
-/Next 87 0 R
->> endobj
-79 0 obj <<
-/Title 80 0 R
-/A 77 0 R
-/Parent 63 0 R
-/Prev 75 0 R
-/Next 83 0 R
->> endobj
-75 0 obj <<
-/Title 76 0 R
-/A 73 0 R
-/Parent 63 0 R
-/Prev 71 0 R
-/Next 79 0 R
->> endobj
-71 0 obj <<
-/Title 72 0 R
-/A 69 0 R
-/Parent 63 0 R
-/Prev 67 0 R
-/Next 75 0 R
->> endobj
-67 0 obj <<
-/Title 68 0 R
-/A 65 0 R
-/Parent 63 0 R
-/Next 71 0 R
->> endobj
-63 0 obj <<
-/Title 64 0 R
-/A 61 0 R
-/Parent 3400 0 R
-/Prev 55 0 R
-/First 67 0 R
-/Last 291 0 R
-/Count -57
->> endobj
-59 0 obj <<
-/Title 60 0 R
-/A 57 0 R
-/Parent 55 0 R
->> endobj
-55 0 obj <<
-/Title 56 0 R
-/A 53 0 R
-/Parent 3400 0 R
-/Prev 47 0 R
-/Next 63 0 R
-/First 59 0 R
-/Last 59 0 R
-/Count -1
->> endobj
-51 0 obj <<
-/Title 52 0 R
-/A 49 0 R
-/Parent 47 0 R
->> endobj
-47 0 obj <<
-/Title 48 0 R
-/A 45 0 R
-/Parent 3400 0 R
-/Prev 39 0 R
-/Next 55 0 R
-/First 51 0 R
-/Last 51 0 R
-/Count -1
->> endobj
-43 0 obj <<
-/Title 44 0 R
-/A 41 0 R
-/Parent 39 0 R
->> endobj
-39 0 obj <<
-/Title 40 0 R
-/A 37 0 R
-/Parent 3400 0 R
-/Prev 31 0 R
-/Next 47 0 R
-/First 43 0 R
-/Last 43 0 R
-/Count -1
->> endobj
-35 0 obj <<
-/Title 36 0 R
-/A 33 0 R
-/Parent 31 0 R
->> endobj
-31 0 obj <<
-/Title 32 0 R
-/A 29 0 R
-/Parent 3400 0 R
-/Prev 23 0 R
-/Next 39 0 R
-/First 35 0 R
-/Last 35 0 R
-/Count -1
->> endobj
-27 0 obj <<
-/Title 28 0 R
-/A 25 0 R
-/Parent 23 0 R
->> endobj
-23 0 obj <<
-/Title 24 0 R
-/A 21 0 R
-/Parent 3400 0 R
-/Prev 15 0 R
-/Next 31 0 R
-/First 27 0 R
-/Last 27 0 R
-/Count -1
->> endobj
-19 0 obj <<
-/Title 20 0 R
-/A 17 0 R
-/Parent 15 0 R
->> endobj
-15 0 obj <<
-/Title 16 0 R
-/A 13 0 R
-/Parent 3400 0 R
-/Prev 11 0 R
-/Next 23 0 R
-/First 19 0 R
-/Last 19 0 R
-/Count -1
->> endobj
-11 0 obj <<
-/Title 12 0 R
-/A 9 0 R
-/Parent 3400 0 R
-/Prev 7 0 R
-/Next 15 0 R
->> endobj
-7 0 obj <<
-/Title 8 0 R
-/A 5 0 R
-/Parent 3400 0 R
-/Prev 3 0 R
-/Next 11 0 R
->> endobj
-3 0 obj <<
-/Title 4 0 R
-/A 1 0 R
-/Parent 3400 0 R
-/Next 7 0 R
->> endobj
-3401 0 obj <<
-/Names [(Doc-Start) 299 0 R (GFDL) 508 0 R (GFDL_GFDL) 331 0 R (GPL) 438 0 R (GPL_GPL) 332 0 R (classparma__polyhedra__library_1_1Artificial__Parameter) 634 0 R]
-/Limits [(Doc-Start) (classparma__polyhedra__library_1_1Artificial__Parameter)]
->> endobj
-3402 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) 635 0 R (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence_a47b1b172706010e446aa8055c982a857) 981 0 R (classparma__polyhedra__library_1_1Artificial__Parameter_a1ed95ba05855767fd9fd6bf04f9e9167) 958 0 R (classparma__polyhedra__library_1_1Artificial__Parameter_ac04b78a2c208b111ea763b7bbc01e20a) 977 0 R (classparma__polyhedra__library_1_1Artificial__Parameter_ac1ce31354ecf79ca6c6c819059ec7de6) 978 0  [...]
-/Limits [(classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) (classparma__polyhedra__library_1_1Artificial__Parameter_acac3d9fa21c9924c62f2221831d7b873)]
->> endobj
-3403 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Artificial__Parameter_ae44414ac09129205a7f718517caca304) 975 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) 639 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_a8be0080275e869b6858313f3ce58879e) 1021 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ac0b40b5fd7fce9c2e70001fe21b04ecd) 1020 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ad3af2e55a3f9bb1410625b2f98a371e1) 1022 0 R (cl [...]
-/Limits [(classparma__polyhedra__library_1_1Artificial__Parameter_ae44414ac09129205a7f718517caca304) (classparma__polyhedra__library_1_1C__Polyhedron)]
->> endobj
-3404 0 obj <<
-/Names [(classparma__polyhedra__library_1_1C__Polyhedron_a0a28bc5d3066a6ffe552a90aa688fe46) 1065 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a2cd3747157a618a88e2c95bc45451f12) 1080 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a4980562fb3e164d31f6a0ce66b638ce3) 1050 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a5431caa9e7f5c824e9a6ac2e6d69fd87) 1064 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a6eb50dda90cfae549d191f5124f2562d) 1052 0 R (classparma__polyhe [...]
-/Limits [(classparma__polyhedra__library_1_1C__Polyhedron_a0a28bc5d3066a6ffe552a90aa688fe46) (classparma__polyhedra__library_1_1C__Polyhedron_a848091b71fff6f0085950e64b6479e4a)]
->> endobj
-3405 0 obj <<
-/Names [(classparma__polyhedra__library_1_1C__Polyhedron_a922faaab6e2cb023231b56b049bca0f4) 1066 0 R (classparma__polyhedra__library_1_1C__Polyhedron_aba7be77030b5b01a9e1049ce41bbfa77) 1063 0 R (classparma__polyhedra__library_1_1C__Polyhedron_ad4fd0a018fd96e10fddd740337f60ebd) 1049 0 R (classparma__polyhedra__library_1_1C__Polyhedron_ad51277b918f8fc2a6892b1a987f8f746) 1090 0 R (classparma__polyhedra__library_1_1C__Polyhedron_ae6b00d1beeeae893cca2817406d0039a) 1062 0 R (classparma__polyhe [...]
-/Limits [(classparma__polyhedra__library_1_1C__Polyhedron_a922faaab6e2cb023231b56b049bca0f4) (classparma__polyhedra__library_1_1C__Polyhedron_af495c3499ed2742d6b68bc6bc99224d7)]
->> endobj
-3406 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Coefficient) 641 0 R (classparma__polyhedra__library_1_1Coefficient_a1ef0c686ebed5c06b004a0799f3b1599) 1114 0 R (classparma__polyhedra__library_1_1Coefficient_a22380e8edd12a8121b5af6a60eb05da2) 1111 0 R (classparma__polyhedra__library_1_1Coefficient_a27e2ee6c6e6f960cc523a3366249f5f9) 1112 0 R (classparma__polyhedra__library_1_1Coefficient_a2b3404ee14fc16f5592bb10a1a4bdd7e) 1129 0 R (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb1 [...]
-/Limits [(classparma__polyhedra__library_1_1Coefficient) (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb12fac766004b358c5)]
->> endobj
-3407 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) 1126 0 R (classparma__polyhedra__library_1_1Coefficient_aebff23eb304cef5bcd9ac11ee5d7c7ed) 1127 0 R (classparma__polyhedra__library_1_1Coefficient_afd68df98e748af269b3588ca5504bb1d) 1125 0 R (classparma__polyhedra__library_1_1Congruence) 686 0 R (classparma__polyhedra__library_1_1Congruence__System) 687 0 R (classparma__polyhedra__library_1_1Congruence__System_a559e1395399115eb381a421c8916eb1d) 1199 0 R]
-/Limits [(classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) (classparma__polyhedra__library_1_1Congruence__System_a559e1395399115eb381a421c8916eb1d)]
->> endobj
-3408 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Congruence__System_a6efa775d8084cb3611b1b6b512dc2827) 1200 0 R (classparma__polyhedra__library_1_1Congruence__System_ae287421ae1ceab78c861efb2803c1edb) 1198 0 R (classparma__polyhedra__library_1_1Congruence_a3c4dfe2a773355c5842dbe133a7c974e) 1164 0 R (classparma__polyhedra__library_1_1Congruence_a6f45bd1aa87e7b459ee0d93a65ff05db) 1169 0 R (classparma__polyhedra__library_1_1Congruence_a894f888629036722adcbc81268cab48a) 1165 0 R (classparma__polyh [...]
-/Limits [(classparma__polyhedra__library_1_1Congruence__System_a6efa775d8084cb3611b1b6b512dc2827) (classparma__polyhedra__library_1_1Congruence_a90cc7704ce2f0ee6c205bfa3877a7671)]
->> endobj
-3409 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Congruence_adf1055ffa2127b453280f5491cb15ffb) 1160 0 R (classparma__polyhedra__library_1_1Congruence_af0873d79c213b1552008ea16229b58e5) 1167 0 R (classparma__polyhedra__library_1_1Congruence_af6656a7b76ac03bbfccba848d6a42dc2) 1166 0 R (classparma__polyhedra__library_1_1Constraint) 688 0 R (classparma__polyhedra__library_1_1Constraint__System) 689 0 R (classparma__polyhedra__library_1_1Constraint__System_a172718f103bd4533e3971e8e69f9f60c) 1225 0 R]
-/Limits [(classparma__polyhedra__library_1_1Congruence_adf1055ffa2127b453280f5491cb15ffb) (classparma__polyhedra__library_1_1Constraint__System_a172718f103bd4533e3971e8e69f9f60c)]
->> endobj
-3410 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Constraint__System_a67b38d56d0f11bda997b393e7b5d7c5f) 1224 0 R (classparma__polyhedra__library_1_1Constraint__System_ace9427756858d751136f1e72309b9be0) 1223 0 R (classparma__polyhedra__library_1_1Constraint_a19ca194f097ddf860d1ad80961a5eda2) 1206 0 R (classparma__polyhedra__library_1_1Constraint_a2531a33c20c3cb27ea7fcf0a04339c2e) 1203 0 R (classparma__polyhedra__library_1_1Constraint_a5b54a0e76432b52a2259a02f31fc0b83) 1205 0 R (classparma__polyh [...]
-/Limits [(classparma__polyhedra__library_1_1Constraint__System_a67b38d56d0f11bda997b393e7b5d7c5f) (classparma__polyhedra__library_1_1Constraint_a6062c78f7cefbc808b99f35b72fcda8a)]
->> endobj
-3411 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Constraint_a9fb052eb3479e107bde4cfd95599c787) 1204 0 R (classparma__polyhedra__library_1_1Constraint_abd74986494a6e574bb0499b3b7109379) 1207 0 R (classparma__polyhedra__library_1_1Domain__Error__Exception) 693 0 R (classparma__polyhedra__library_1_1Domain__Error__Exception_a18ac064d1fafb42b385e6b942df648f0) 1250 0 R (classparma__polyhedra__library_1_1Generator) 694 0 R (classparma__polyhedra__library_1_1Generator__System) 695 0 R]
-/Limits [(classparma__polyhedra__library_1_1Constraint_a9fb052eb3479e107bde4cfd95599c787) (classparma__polyhedra__library_1_1Generator__System)]
->> endobj
-3412 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Generator__System_a379e7fec2e73df8beb7904b85d7645df) 1331 0 R (classparma__polyhedra__library_1_1Generator__System_a62ca7c2995414638d139847539631598) 1330 0 R (classparma__polyhedra__library_1_1Generator__System_ab8be81becce1bc803566f5b19e366799) 1311 0 R (classparma__polyhedra__library_1_1Generator_a3c40a54218985599831d143c5bb5972f) 1291 0 R (classparma__polyhedra__library_1_1Generator_a67b795731a54c5c3b470d44e10806ac5) 1283 0 R (classparma__po [...]
-/Limits [(classparma__polyhedra__library_1_1Generator__System_a379e7fec2e73df8beb7904b85d7645df) (classparma__polyhedra__library_1_1Generator_a6c93053ad6b6bbcaa9aee01b646bba06)]
->> endobj
-3413 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) 1281 0 R (classparma__polyhedra__library_1_1Generator_a8fb4edb895a850c5ddf8646b31d92a07) 1294 0 R (classparma__polyhedra__library_1_1Generator_ab67f80234f60baee3584e955d4fa3f0a) 1292 0 R (classparma__polyhedra__library_1_1Generator_ac3e1a9737e2b459e439904f9817f4289) 1293 0 R (classparma__polyhedra__library_1_1Generator_ad2b2c058d1c2dfc8c14144caa50ee91d) 1288 0 R (classparma__polyhedra__library_1_1Gene [...]
-/Limits [(classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) (classparma__polyhedra__library_1_1Generator_ae1acaaf59811107a0571b1f65a41b012)]
->> endobj
-3414 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Grid__Generator) 697 0 R (classparma__polyhedra__library_1_1Grid__Generator__System) 698 0 R (classparma__polyhedra__library_1_1Grid__Generator__System_a4c7c1b1005912277576320fd650d1e89) 1391 0 R (classparma__polyhedra__library_1_1Grid__Generator__System_a8f448359523682c0623804af48cc2dff) 1390 0 R (classparma__polyhedra__library_1_1Grid__Generator__System_afb407c2937347e7381fed31b31a46e98) 1389 0 R (classparma__polyhedra__library_1_1Grid__Genera [...]
-/Limits [(classparma__polyhedra__library_1_1Grid__Generator) (classparma__polyhedra__library_1_1Grid__Generator_a147ad6db2e9d13bee7450666cad83d7d)]
->> endobj
-3415 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Grid__Generator_a45537abba3ff2661633cb4033fe15e0b) 1368 0 R (classparma__polyhedra__library_1_1Grid__Generator_a58e50b5ebd0b0f5b4d5e44690a939e34) 1339 0 R (classparma__polyhedra__library_1_1Grid__Generator_a61e7f56c96825c1dbd9b1753ead625b7) 1365 0 R (classparma__polyhedra__library_1_1Grid__Generator_a7440d17db8648a633c9b77c512bf8f9b) 1361 0 R (classparma__polyhedra__library_1_1Grid__Generator_a8b88040458f91e980a158487b14a359e) 1371 0 R (classpar [...]
-/Limits [(classparma__polyhedra__library_1_1Grid__Generator_a45537abba3ff2661633cb4033fe15e0b) (classparma__polyhedra__library_1_1Grid__Generator_ab557b1ec4f75e98b5b4155b932d7a6af)]
->> endobj
-3416 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Grid__Generator_afb38d7eabfa00c8d068e8cdd4820d46c) 1360 0 R (classparma__polyhedra__library_1_1IO) 701 0 R (classparma__polyhedra__library_1_1IO_aedad05516ed695dabfa4fed118d41145) 1411 0 R (classparma__polyhedra__library_1_1Invalid__Argument__Exception) 700 0 R (classparma__polyhedra__library_1_1Invalid__Argument__Exception_aefc6c6941cd663b4715cc71e446d4fa0) 1406 0 R (classparma__polyhedra__library_1_1Length__Error__Exception) 702 0 R]
-/Limits [(classparma__polyhedra__library_1_1Grid__Generator_afb38d7eabfa00c8d068e8cdd4820d46c) (classparma__polyhedra__library_1_1Length__Error__Exception)]
->> endobj
-3417 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Length__Error__Exception_a84966c712051f47e1dcee5490d5ca670) 1423 0 R (classparma__polyhedra__library_1_1Linear__Expression) 703 0 R (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) 704 0 R (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a1109f21e2d8d35f3dae8ddc8074dd7cc) 1491 0 R (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a733941c541eb74a6c925db946b39e46e) 1493 0 R (classparma__polyhe [...]
-/Limits [(classparma__polyhedra__library_1_1Length__Error__Exception_a84966c712051f47e1dcee5490d5ca670) (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ad6ca74b77c4e7c632ddfdc6ab8f3567a)]
->> endobj
-3418 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ae2a6394e34e787c14484f3d411e022ff) 1489 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference) 750 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2a702d0e6013ee746e60e4b3c53abfb9) 1527 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2e6d73507de036e41aa8e1cfc717835e) 1530 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_aa575e8597c3 [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ae2a6394e34e787c14484f3d411e022ff) (classparma__polyhedra__library_1_1Linear__Expression__Difference_aaaeb914f871ccb4e97fc4fd513364b94)]
->> endobj
-3419 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) 1525 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_af36458b7b549f4494a2554972244867b) 1524 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum) 751 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_a04d7bcdd3d8cd086fa28922403cbeb6e) 1566 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_a1af748b5b83815f826301969cee51712) [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) (classparma__polyhedra__library_1_1Linear__Expression__Sum_a6d0d4f5a1f45dd0c5ccb2abe003bb041)]
->> endobj
-3420 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression__Sum_a75fb2490197b55a1474aff4ce0022598) 1562 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_aaf17ce2383d125a60b8283addae73c7c) 1567 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_acd2297a09c09cc44bf66eaafb90e0d7c) 1563 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times) 752 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_a0e3334c609b7d72493ee150349098048) 1636 0 R  [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Sum_a75fb2490197b55a1474aff4ce0022598) (classparma__polyhedra__library_1_1Linear__Expression__Times_a2a5cc6cf6acdd7c5695af1ef807c40b2)]
->> endobj
-3421 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression__Times_a84e0592d7a7e218f4c4c782f882f18cc) 1605 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_a8bddb181c1be9d2553b18871ab85e84f) 1607 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_aa37c50d4e586466d66070a61595399ec) 1609 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_abef3573de0c962f79637f379b089b0ad) 1612 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_ac3 [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Times_a84e0592d7a7e218f4c4c782f882f18cc) (classparma__polyhedra__library_1_1Linear__Expression__Times_aca857d6f0e8cef1c2a2b077cd6a513ef)]
->> endobj
-3422 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) 753 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0b2d532ef24c4ccd4a4a04907d03f2af) 1639 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0e57cbf0841e9af58ac2a52e89865a86) 1640 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a48032da1e7c874083e027a065499bd5b) 1643 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_adb [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) (classparma__polyhedra__library_1_1Linear__Expression__Variable)]
->> endobj
-3423 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression__Variable_a5bb6231ba1b0357cce472468fc4733f2) 1669 0 R (classparma__polyhedra__library_1_1Linear__Expression__Variable_a820ba8207751c8764ab6a51eb1183a7c) 1667 0 R (classparma__polyhedra__library_1_1Linear__Expression__Variable_ad6f7c3aef257204c507d0a85539aa987) 1668 0 R (classparma__polyhedra__library_1_1Linear__Expression_a0c6bf4c112511ed41878554ca3c02977) 1448 0 R (classparma__polyhedra__library_1_1Linear__Expression_a2cbe4b9 [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Variable_a5bb6231ba1b0357cce472468fc4733f2) (classparma__polyhedra__library_1_1Linear__Expression_a3a962a357f4260b224518672b80ccdc6)]
->> endobj
-3424 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Linear__Expression_aa4c34f9b1017a3b44afaa423b832722a) 1449 0 R (classparma__polyhedra__library_1_1Linear__Expression_ab9e90a38fb859d1dbe667efec83743d0) 1455 0 R (classparma__polyhedra__library_1_1Linear__Expression_ac622b43c176dfe1b92260b841192b305) 1452 0 R (classparma__polyhedra__library_1_1Linear__Expression_ad7fba193bb811d3dd21903c3fb5e2428) 1456 0 R (classparma__polyhedra__library_1_1Linear__Expression_aedb7a64c3a6bdff1793482110849e5d9) 145 [...]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression_aa4c34f9b1017a3b44afaa423b832722a) (classparma__polyhedra__library_1_1Linear__Expression_af6431ecb966a6e38dc55e7f4274b31db)]
->> endobj
-3425 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Logic__Error__Exception) 755 0 R (classparma__polyhedra__library_1_1Logic__Error__Exception_a655c21143c2eb90c64487e6e4dcd140c) 1707 0 R (classparma__polyhedra__library_1_1MIP__Problem) 756 0 R (classparma__polyhedra__library_1_1MIP__Problem_a029ae33c5a3d2e301e08d77744d6b739) 1768 0 R (classparma__polyhedra__library_1_1MIP__Problem_a0a9d6f3a0eb496081b86efbb0ea0a011) 1774 0 R (classparma__polyhedra__library_1_1MIP__Problem_a10856aafcb2ba1f52e5158a [...]
-/Limits [(classparma__polyhedra__library_1_1Logic__Error__Exception) (classparma__polyhedra__library_1_1MIP__Problem_a10856aafcb2ba1f52e5158a96950d32c)]
->> endobj
-3426 0 obj <<
-/Names [(classparma__polyhedra__library_1_1MIP__Problem_a163804d4b5d0f7361974963ef22f98ee) 1714 0 R (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) 1710 0 R (classparma__polyhedra__library_1_1MIP__Problem_a1dc4d783858f3eff8674c04502f4432f) 1764 0 R (classparma__polyhedra__library_1_1MIP__Problem_a259d72e4c1cc8fbf723b463475882c9e) 1711 0 R (classparma__polyhedra__library_1_1MIP__Problem_a3659575ce6ee121e2a2df2c347796fce) 1778 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a163804d4b5d0f7361974963ef22f98ee) (classparma__polyhedra__library_1_1MIP__Problem_a36ac8f2a9f570db98e652d333541ae5c)]
->> endobj
-3427 0 obj <<
-/Names [(classparma__polyhedra__library_1_1MIP__Problem_a4155cebeafe8bc5e3d7d863e1a24abcb) 1719 0 R (classparma__polyhedra__library_1_1MIP__Problem_a42d572a34bcfa6f75a730215898de8c3) 1767 0 R (classparma__polyhedra__library_1_1MIP__Problem_a4b15258348ad1f31d1857eca9dd9bc68) 1717 0 R (classparma__polyhedra__library_1_1MIP__Problem_a535529376fbabac6dde098be2c0bc9d8) 1776 0 R (classparma__polyhedra__library_1_1MIP__Problem_a68cd1f4ad51eff8dcc8634ae7990b3e8) 1771 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a4155cebeafe8bc5e3d7d863e1a24abcb) (classparma__polyhedra__library_1_1MIP__Problem_a6cace6b1265203d0fff22021fd2a56a2)]
->> endobj
-3428 0 obj <<
-/Names [(classparma__polyhedra__library_1_1MIP__Problem_a76aa40d264daa4af312ae293615ba3d6) 1769 0 R (classparma__polyhedra__library_1_1MIP__Problem_a77b86c1af3be2ba98179fe26fc5560de) 1721 0 R (classparma__polyhedra__library_1_1MIP__Problem_a81aa24851effbe4fade96c65e7c575d4) 1772 0 R (classparma__polyhedra__library_1_1MIP__Problem_a8c602e835a5fe866cd3d0838c42ac9e3) 1777 0 R (classparma__polyhedra__library_1_1MIP__Problem_a8e5ebed0862d7349443d391cb8aa9ab3) 1781 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a76aa40d264daa4af312ae293615ba3d6) (classparma__polyhedra__library_1_1MIP__Problem_a8eb4ecbc8176c3018d1d742f5abb8115)]
->> endobj
-3429 0 obj <<
-/Names [(classparma__polyhedra__library_1_1MIP__Problem_a9971c2e55bbf3477c321cb1fed28c430) 1773 0 R (classparma__polyhedra__library_1_1MIP__Problem_abc1363206f93e6778c1e9d136f24c01b) 1715 0 R (classparma__polyhedra__library_1_1MIP__Problem_ae1928da791c8514b7e82e2d750ebdad8) 1720 0 R (classparma__polyhedra__library_1_1MIP__Problem_ae65e48247a4f2477e8c00f5088190bfc) 1765 0 R (classparma__polyhedra__library_1_1MIP__Problem_aed0b5ff233c2092ec5414bcf36747dd5) 1716 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a9971c2e55bbf3477c321cb1fed28c430) (classparma__polyhedra__library_1_1MIP__Problem_af44c1d2698cf0080c2e7cdc4fc2b9634)]
->> endobj
-3430 0 obj <<
-/Names [(classparma__polyhedra__library_1_1MIP__Problem_af933208cb9b9013073316c1107b3649d) 1775 0 R (classparma__polyhedra__library_1_1MIP__Problem_af95bf704d29d8b91d248d1d437ad703a) 1718 0 R (classparma__polyhedra__library_1_1MIP__Problem_afbd6f23017c162cd460d4b0ac42ae4c8) 1770 0 R (classparma__polyhedra__library_1_1Overflow__Error__Exception) 759 0 R (classparma__polyhedra__library_1_1Overflow__Error__Exception_a3c4ed48495c48bc67b46023bb0b62828) 1882 0 R (classparma__polyhedra__library [...]
-/Limits [(classparma__polyhedra__library_1_1MIP__Problem_af933208cb9b9013073316c1107b3649d) (classparma__polyhedra__library_1_1PIP__Decision__Node)]
->> endobj
-3431 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) 1998 0 R (classparma__polyhedra__library_1_1PIP__Problem) 763 0 R (classparma__polyhedra__library_1_1PIP__Problem_a01868d21a17d9549b711240123d5b81c) 2055 0 R (classparma__polyhedra__library_1_1PIP__Problem_a28b832ea15d4a33b33f51554b5f54a43) 2049 0 R (classparma__polyhedra__library_1_1PIP__Problem_a29bc2f9d0a2c4c96011fe36312a53e2d) 2095 0 R (classparma__polyhedra__library_1_1PIP__Problem_a373 [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) (classparma__polyhedra__library_1_1PIP__Problem_a373a253b31500ca4f15cf2b22e3b9eea)]
->> endobj
-3432 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Problem_a42e9887cb1bd2e0914862d448881d047) 2087 0 R (classparma__polyhedra__library_1_1PIP__Problem_a4c79cc34280a10e3ca9d2a2fdb8f52fa) 2045 0 R (classparma__polyhedra__library_1_1PIP__Problem_a5bc4c5bb38b21a01517358b417867797) 2060 0 R (classparma__polyhedra__library_1_1PIP__Problem_a5c952c2540fc4ea96e8aaa1109d6ea0c) 2096 0 R (classparma__polyhedra__library_1_1PIP__Problem_a6adb9a394696d907389f2fabc3d7f643) 2050 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Problem_a42e9887cb1bd2e0914862d448881d047) (classparma__polyhedra__library_1_1PIP__Problem_a77791a65ff33495b86466f4a672cd531)]
->> endobj
-3433 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Problem_a777f48d40962e0a1f7ddcd691bde154d) 2093 0 R (classparma__polyhedra__library_1_1PIP__Problem_a7a934327db411e24b7c2a073983d2a3e) 2086 0 R (classparma__polyhedra__library_1_1PIP__Problem_a84f5ab2a93289e1436a1ea7ef58fb460) 2053 0 R (classparma__polyhedra__library_1_1PIP__Problem_a89335d3e61d877bf25e41e562bf2fb34) 2051 0 R (classparma__polyhedra__library_1_1PIP__Problem_a8959e3a2e2612143cb56991236663058) 2054 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Problem_a777f48d40962e0a1f7ddcd691bde154d) (classparma__polyhedra__library_1_1PIP__Problem_a9117ebcf4233e25be986d6b67ca78f1d)]
->> endobj
-3434 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Problem_a925ebc675d3deed289aed0d97dafa81c) 2094 0 R (classparma__polyhedra__library_1_1PIP__Problem_a92ced4994293ff25212f86d55421a48a) 2085 0 R (classparma__polyhedra__library_1_1PIP__Problem_aa86001c9fa5a81f40582bac023132a68) 2052 0 R (classparma__polyhedra__library_1_1PIP__Problem_aaacb839f41a9e7355e1e1e5cc9ad0894) 2083 0 R (classparma__polyhedra__library_1_1PIP__Problem_ab3b703e4e468da3a5f49ad28905527e9) 2089 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Problem_a925ebc675d3deed289aed0d97dafa81c) (classparma__polyhedra__library_1_1PIP__Problem_ab75311edf7727278b2c6621e4cf08986)]
->> endobj
-3435 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Problem_ac41bfa66bbd6a2c52616ea5d4a6270a0) 2097 0 R (classparma__polyhedra__library_1_1PIP__Problem_ac9e60b83b647eaf62c173ecf3539c536) 2048 0 R (classparma__polyhedra__library_1_1PIP__Problem_ad67204128201f54bc7e543a16e67e951) 2046 0 R (classparma__polyhedra__library_1_1PIP__Problem_ad7ae9489e4e3449bfedbafd36d929f55) 2058 0 R (classparma__polyhedra__library_1_1PIP__Problem_adbae3f77deab71eb8d31dc8e551bdeed) 2084 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Problem_ac41bfa66bbd6a2c52616ea5d4a6270a0) (classparma__polyhedra__library_1_1PIP__Problem_ae2e189679413b6058b03b13fc1b8dcfd)]
->> endobj
-3436 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Problem_ae7dc52a107e3c90f03801ac327d35589) 2059 0 R (classparma__polyhedra__library_1_1PIP__Problem_aed3b733dc78567027867440a5774e70b) 2057 0 R (classparma__polyhedra__library_1_1PIP__Solution__Node) 767 0 R (classparma__polyhedra__library_1_1PIP__Solution__Node_ab532119425bcb15a8c6063d19f071c3c) 2180 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node) 803 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Problem_ae7dc52a107e3c90f03801ac327d35589) (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93)]
->> endobj
-3437 0 obj <<
-/Names [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) 2219 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_a7c7056a9fa57d1dd08465dbb8a862b72) 2215 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_a8ad7732b0e38be9e8c42a93bffdedbcb) 2214 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_ac6acd7a5076267b606f39476b3b891e4) 2218 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_af248bcc6fc4a4dff80fd47032a49b33c) 2217 0 R (classpar [...]
-/Limits [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) (classparma__polyhedra__library_1_1PIP__Tree__Node_afe64e41fa2c3ef17fb78ea3ea4caa89e)]
->> endobj
-3438 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) 760 0 R (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a0f022d23c55748a9e437e1625149bf5a) 1902 0 R (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a35e4df2723c110fbdadbcde7fe9cfae0) 1903 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) 431 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a08c3b1c1c4e916f10c85114ac888c040) 1928 0 R (classparma__polyhedra__library_1_1Par [...]
-/Limits [(classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a0c349132b447b3e6a5234a23257f417d)]
->> endobj
-3439 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a4e5e7fc32bfd0ae986d63ec82db62f6a) 1912 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a5223af806da56cfe9a7c6ed71b4a0604) 1941 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a65283b563ec02a47928cc176c738f78b) 1911 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a6b7d95f94c10fe3747eff2a3e05f9d32) 1907 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a [...]
-/Limits [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a4e5e7fc32bfd0ae986d63ec82db62f6a) (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a805ae2717e65749d104d71978ed97fa4)]
->> endobj
-3440 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) 1930 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8876ac784666f054f546f48404cb27a) 1909 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) 1929 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ab6bcd066e77a3dde5c6127ac6dfabfa7) 1910 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ac5 [...]
-/Limits [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ae763a3d0db8c57898dff5ba199ea87e5)]
->> endobj
-3441 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_af46aeb04c5a5a83a60ddf1a280c8b648) 1939 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_afb7d3612f1ec7e7432a4168ea245f0f9) 1940 0 R (classparma__polyhedra__library_1_1Partial__Function) 761 0 R (classparma__polyhedra__library_1_1Partial__Function_a054857677ca99c51342e420e9d5bad9f) 1984 0 R (classparma__polyhedra__library_1_1Partial__Function_a0861934c38d4b7e0432b6ba71a40df2d) 1979 0 R (classparma__polyh [...]
-/Limits [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_af46aeb04c5a5a83a60ddf1a280c8b648) (classparma__polyhedra__library_1_1Partial__Function_a52e000efba75d51e7891f8e9da8e4e1b)]
->> endobj
-3442 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Partial__Function_a661ab4cd615864ae392638259f9c58da) 1981 0 R (classparma__polyhedra__library_1_1Partial__Function_a940d4cc630004e148b25a81010b12d61) 1976 0 R (classparma__polyhedra__library_1_1Partial__Function_aa348a444933ae006cd061eb2a01af5b7) 1983 0 R (classparma__polyhedra__library_1_1Partial__Function_ab8e3183f9373557491bf9d9cee30548d) 1977 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) 804 0 R (classparma__polyh [...]
-/Limits [(classparma__polyhedra__library_1_1Partial__Function_a661ab4cd615864ae392638259f9c58da) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator)]
->> endobj
-3443 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) 2294 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a12e689efd1655b4ec60adc26beb16a65) 2299 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a1b586c1f7e68ef2ad7a47bb83767a32f) 2300 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a22326363cf04596cec471dbe66e03653) 2 [...]
-/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a96c42895c3599ed91e187ea39f94672c)]
->> endobj
-3444 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_acd3100605be3e85bc68685085a2572ae) 2293 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a20fc9fa06d5e6772b60c0d8c968716a5) 2268 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a3ae906e1904f2ac295800c2da5ad0eb7) 2263 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a49b8e7f8a6b1ed7aaa6e91729323de7e) 2262 0 R (classparma__polyhedra [...]
-/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_acd3100605be3e85bc68685085a2572ae) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a711a61f2016a1a60c7cce6dceb2bb94b)]
->> endobj
-3445 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a8adda024ba9ada688f17592347ffa4a9) 2266 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_ad8b71c1b523782a16d5ced5b3103bd8c) 2265 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_adf86846ee255deb41ca850ac64c4b61c) 2259 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_af3095a51638dbd4f5f64ef0abae85829) 2260 0 R (classparma__polyhedra__library_ [...]
-/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a8adda024ba9ada688f17592347ffa4a9) (classparma__polyhedra__library_1_1Poly__Con__Relation)]
->> endobj
-3446 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Poly__Con__Relation_a31e5a38eb5511d477ccd1b793fec470b) 2327 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_a4358da8086e7af078f42a62c817895e3) 2330 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_a44dd34b28b7e0ca0ea892e9259ea7103) 2329 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_ab038d193cd145f2bc59b501db605e320) 2328 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_adc93ada4ec022b8e6020c91412e0b0ef [...]
-/Limits [(classparma__polyhedra__library_1_1Poly__Con__Relation_a31e5a38eb5511d477ccd1b793fec470b) (classparma__polyhedra__library_1_1Poly__Con__Relation_ae9b4bcc84019980d7be4ace75e54c0b3)]
->> endobj
-3447 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Poly__Con__Relation_afc62e3c93daf5e744e4b3e450c7c7270) 2331 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation) 807 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation_a29127d8da5f0b833c4a89dbe3d41be27) 2348 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation_a40a81d6ee69dc679f08c5e89a101dfbb) 2351 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation_adebb1fbe14ec8f0b88fb538b86f0873b) 2352 0 R (classparma__polyhedra__ [...]
-/Limits [(classparma__polyhedra__library_1_1Poly__Con__Relation_afc62e3c93daf5e744e4b3e450c7c7270) (classparma__polyhedra__library_1_1Poly__Gen__Relation_afe2f6db5c7f1a92104fe7efa0c301a45)]
->> endobj
-3448 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron) 808 0 R (classparma__polyhedra__library_1_1Polyhedron_a00413902e11b669bca9a8c81438202ee) 2630 0 R (classparma__polyhedra__library_1_1Polyhedron_a0e578573084aafbf76c85db7dd1363be) 2623 0 R (classparma__polyhedra__library_1_1Polyhedron_a110353a7864529b85d5465ac1bce2670) 2468 0 R (classparma__polyhedra__library_1_1Polyhedron_a1217cb151cbdbbcf4391987b9e2d232c) 2406 0 R (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron) (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e32932e6ecc)]
->> endobj
-3449 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) 2567 0 R (classparma__polyhedra__library_1_1Polyhedron_a1b75c266a974976557206ce451e45967) 2563 0 R (classparma__polyhedra__library_1_1Polyhedron_a1e5d8d199e0bcd20aeacd72b2fef10f6) 2476 0 R (classparma__polyhedra__library_1_1Polyhedron_a268b22472143daa3e8f2d0828d1ad565) 2634 0 R (classparma__polyhedra__library_1_1Polyhedron_a284af200f2e06dcfc079a58b3d4d6a59) 2463 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) (classparma__polyhedra__library_1_1Polyhedron_a2b74eef4fc5f2e35ba14f734f0e8e167)]
->> endobj
-3450 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a34c73f38bc99dbcb38cc7214e1e0e82d) 2391 0 R (classparma__polyhedra__library_1_1Polyhedron_a3527c6d35935d9860c07b31970d6dfc4) 2396 0 R (classparma__polyhedra__library_1_1Polyhedron_a3797a521b54434e13ed2843ebd88a8c1) 2479 0 R (classparma__polyhedra__library_1_1Polyhedron_a3cdef8e8e717e8aae495db38ab2f3555) 2624 0 R (classparma__polyhedra__library_1_1Polyhedron_a3d3179300b5bf2b41a40b5b76650f8e7) 2464 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a34c73f38bc99dbcb38cc7214e1e0e82d) (classparma__polyhedra__library_1_1Polyhedron_a3d6404d09696f8b693b9260d267df2c3)]
->> endobj
-3451 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a4211b10c19024d7056b4e36e4d2b7cff) 2388 0 R (classparma__polyhedra__library_1_1Polyhedron_a427ee580c9a357d0e154cd2520dbe33a) 2629 0 R (classparma__polyhedra__library_1_1Polyhedron_a4399e57484eec3301f8b88011c53c35b) 2478 0 R (classparma__polyhedra__library_1_1Polyhedron_a501e48144147e2563edc52dcd49503f9) 2561 0 R (classparma__polyhedra__library_1_1Polyhedron_a513cc77545233d96c437ba7e1d001557) 2393 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a4211b10c19024d7056b4e36e4d2b7cff) (classparma__polyhedra__library_1_1Polyhedron_a52ae035a37af93cc3115f3a45f4e032c)]
->> endobj
-3452 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a56e3a5f9a94fb76a527fedea1bbd83cd) 2617 0 R (classparma__polyhedra__library_1_1Polyhedron_a58869dfc76ca4a5a51e1e130096cfc88) 2664 0 R (classparma__polyhedra__library_1_1Polyhedron_a5955d6b18f4135b382ca0db2479c11ac) 2564 0 R (classparma__polyhedra__library_1_1Polyhedron_a5c577b51724616ef96f58ce0f2fec482) 2460 0 R (classparma__polyhedra__library_1_1Polyhedron_a60ee53b704270f784fad7eab1a542bfd) 2387 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a56e3a5f9a94fb76a527fedea1bbd83cd) (classparma__polyhedra__library_1_1Polyhedron_a62737490fa8ee8763ee2ff8b54847670)]
->> endobj
-3453 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a66510fe1afe13b5f7334057bc96efa36) 2554 0 R (classparma__polyhedra__library_1_1Polyhedron_a6be74fc6a3ef7d8e1c1939536af2a943) 2555 0 R (classparma__polyhedra__library_1_1Polyhedron_a6c51199902356b837c63915caaab7a40) 2542 0 R (classparma__polyhedra__library_1_1Polyhedron_a6e35f9362b9f7ed65be59ae07f1da622) 2557 0 R (classparma__polyhedra__library_1_1Polyhedron_a701a35ba2b5418869a471932535cf9e5) 2562 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a66510fe1afe13b5f7334057bc96efa36) (classparma__polyhedra__library_1_1Polyhedron_a73a395dac9898b73e0782a47f4537cd7)]
->> endobj
-3454 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a7ce8a057ee2d4a20b8820da2bb6dc2af) 2397 0 R (classparma__polyhedra__library_1_1Polyhedron_a7e4588dc8f29c46edfb1fa34e6a9d424) 2467 0 R (classparma__polyhedra__library_1_1Polyhedron_a7f35fe17c4c48b15ddb66e52e110c2bd) 2619 0 R (classparma__polyhedra__library_1_1Polyhedron_a812e3b442d41612ca88f8905d6cb49bd) 2386 0 R (classparma__polyhedra__library_1_1Polyhedron_a81715f656d39c399cf4d63b72635194c) 2633 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a7ce8a057ee2d4a20b8820da2bb6dc2af) (classparma__polyhedra__library_1_1Polyhedron_a8561bc8f545197343c8cf1935e794af3)]
->> endobj
-3455 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) 2627 0 R (classparma__polyhedra__library_1_1Polyhedron_a8a9706372c9b371938f04b68516bb407) 2475 0 R (classparma__polyhedra__library_1_1Polyhedron_a8bf0912e9b611d41ee76da66fd1bd28f) 2662 0 R (classparma__polyhedra__library_1_1Polyhedron_a8f50e6dcc51327c56d99dc964961d6a2) 2469 0 R (classparma__polyhedra__library_1_1Polyhedron_a920814c13d635e9a503551b0988c2958) 2566 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) (classparma__polyhedra__library_1_1Polyhedron_a945f11d66765e2f542f9c4fb654589d2)]
->> endobj
-3456 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_a950e7082860fadc45452ffe241de4488) 2474 0 R (classparma__polyhedra__library_1_1Polyhedron_a95c109d667deed44698d16eb25efef9d) 2549 0 R (classparma__polyhedra__library_1_1Polyhedron_a99adfdf68b5bee7b3963a15c4183e136) 2560 0 R (classparma__polyhedra__library_1_1Polyhedron_a9a6e20494d2e7c618d4c6aeab45bac30) 2465 0 R (classparma__polyhedra__library_1_1Polyhedron_a9dd3a06d94e54ca59e0c41901d9f9a06) 2615 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a950e7082860fadc45452ffe241de4488) (classparma__polyhedra__library_1_1Polyhedron_a9f1fcbebed65fafcc7439ce24392b59a)]
->> endobj
-3457 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_aa01e5f8c42361cc03aba32786c4f9e3d) 2550 0 R (classparma__polyhedra__library_1_1Polyhedron_aaec18d4d5bd29cd38e153b4602e027da) 2622 0 R (classparma__polyhedra__library_1_1Polyhedron_ab11bfde2a1ce71a607644a38cb914b13) 2625 0 R (classparma__polyhedra__library_1_1Polyhedron_ab6edbecd120074f2661ed2cd06ce1cd1) 2407 0 R (classparma__polyhedra__library_1_1Polyhedron_ab780403b7f3997c5f5703ea0218c2841) 2459 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_aa01e5f8c42361cc03aba32786c4f9e3d) (classparma__polyhedra__library_1_1Polyhedron_ab8ef27e25132c083ae1b59d3162fa21a)]
->> endobj
-3458 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_abdf75082ed3ae874de8fa5cb0198e080) 2631 0 R (classparma__polyhedra__library_1_1Polyhedron_abf4b919c3b8d7dd958aab203fcabc4b4) 2462 0 R (classparma__polyhedra__library_1_1Polyhedron_abfd8a93992bbf17101c53d68a44d9986) 2471 0 R (classparma__polyhedra__library_1_1Polyhedron_ac034ebc28209bd38f90ba23323f65c41) 2621 0 R (classparma__polyhedra__library_1_1Polyhedron_ac2e30d8774b244ed1bd206f76e786745) 2395 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_abdf75082ed3ae874de8fa5cb0198e080) (classparma__polyhedra__library_1_1Polyhedron_ac76c332a5b267f6b6bd749cc3b9e192e)]
->> endobj
-3459 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_acd5b7ab06d657819656175f7d6a0cd0d) 2556 0 R (classparma__polyhedra__library_1_1Polyhedron_acdf10439693c83932d0de9a5cf35b396) 2551 0 R (classparma__polyhedra__library_1_1Polyhedron_ad38a887658485f32f589a57a74e6a78c) 2618 0 R (classparma__polyhedra__library_1_1Polyhedron_ada449a9c1a600893585256666d6fe331) 2620 0 R (classparma__polyhedra__library_1_1Polyhedron_ae17f1279a841b6efc0efa6441878c025) 2389 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_acd5b7ab06d657819656175f7d6a0cd0d) (classparma__polyhedra__library_1_1Polyhedron_ae32bc538fedce99e602767b1065ad599)]
->> endobj
-3460 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_ae899d1e624241d1328d6c6421f5485e6) 2565 0 R (classparma__polyhedra__library_1_1Polyhedron_aee40105531fe1008562584274189cf35) 2663 0 R (classparma__polyhedra__library_1_1Polyhedron_aef8d1e4a767f5ea79384588d0e19b83c) 2558 0 R (classparma__polyhedra__library_1_1Polyhedron_af04e7f91e1cfaf69dcee2df81c3d64c3) 2552 0 R (classparma__polyhedra__library_1_1Polyhedron_af26aee5944d076192d5f6a12086c28f7) 2553 0 R (classparma__polyhedra__library_1_ [...]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_ae899d1e624241d1328d6c6421f5485e6) (classparma__polyhedra__library_1_1Polyhedron_afba20cade6fa4fcd26b81086a02923e5)]
->> endobj
-3461 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) 2390 0 R (classparma__polyhedra__library_1_1Polyhedron_afdef7f8fe0ba899b496aaa369780dfda) 2477 0 R (classparma__polyhedra__library_1_1Timeout__Exception) 810 0 R (classparma__polyhedra__library_1_1Timeout__Exception_a66765523c60cdb348393876561c5d0e7) 3004 0 R (classparma__polyhedra__library_1_1Variable) 811 0 R (classparma__polyhedra__library_1_1Variable_a8d74790917f006b8ce83d9be0d356576) 3018 0 R]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) (classparma__polyhedra__library_1_1Variable_a8d74790917f006b8ce83d9be0d356576)]
->> endobj
-3462 0 obj <<
-/Names [(classparma__polyhedra__library_1_1Variable_aaa7f7d2e2523000e62d85670f268362a) 3022 0 R (classparma__polyhedra__library_1_1Variable_ab54edfb4d01886f38228f56771aa085d) 3019 0 R (classparma__polyhedra__library_1_1Variables__Set) 812 0 R (classparma__polyhedra__library_1_1Variables__Set_aa80c4fa3121e341ac6068c60394eb07d) 3032 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) 636 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a1834eabb1a6 [...]
-/Limits [(classparma__polyhedra__library_1_1Variable_aaa7f7d2e2523000e62d85670f268362a) (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a1834eabb1a60cd21454609bb6af2b70c)]
->> endobj
-3463 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a20f960ad44478ccbccc6ba807c88ec88) 997 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) 637 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation_a5989bf59e335673996e366dbea747064) 1000 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) 638 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a0940a9ce95b204cbc7b0ba075e3802be) 100 [...]
-/Limits [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a20f960ad44478ccbccc6ba807c88ec88) (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a239f39386ac001c6c20a50505e8bb671)]
->> endobj
-3464 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a26d3ec66128ed1a32ecf5905b0beae28) 1004 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a6a6f001254ef8c3b3eddb432ca6e9dbe) 1005 0 R (enumparma__polyhedra__library_1_1Complexity__Class) 642 0 R (enumparma__polyhedra__library_1_1Complexity__Class_a00d82d93d2d0113f1ea5b615decb2849) 1136 0 R (enumparma__polyhedra__library_1_1Complexity__Class_a5c1b244e9422e1c29c71844a9f896aee) 1135 0 R (enumparma__pol [...]
-/Limits [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a26d3ec66128ed1a32ecf5905b0beae28) (enumparma__polyhedra__library_1_1Control__Parameter__Name)]
->> endobj
-3465 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Control__Parameter__Name_a3d873e83cf77a02b55c7d6d6d245ed23) 1228 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value) 691 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value_a7483a53d677492ed42b591525243d243) 1244 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value_ac1791e52b930ea1fc3863866a26b1a81) 1242 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value_ad6243026e52cac8f2b4ef458ff4b760f) 1243 0 R  [...]
-/Limits [(enumparma__polyhedra__library_1_1Control__Parameter__Name_a3d873e83cf77a02b55c7d6d6d245ed23) (enumparma__polyhedra__library_1_1Degenerate__Element)]
->> endobj
-3466 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Degenerate__Element_a9ff8417659bb4800d825f91fa8685aaf) 1247 0 R (enumparma__polyhedra__library_1_1Generator__Type) 696 0 R (enumparma__polyhedra__library_1_1Generator__Type_a2c6506f69be68e287d31aa3db68d664b) 1336 0 R (enumparma__polyhedra__library_1_1Generator__Type_a3b9f75c49b0c6f00923b8f7d827ca9ad) 1334 0 R (enumparma__polyhedra__library_1_1Generator__Type_aa8aee01f50041535fba84ef399e5ee81) 1335 0 R (enumparma__polyhedra__library_1_1Grid__Gener [...]
-/Limits [(enumparma__polyhedra__library_1_1Degenerate__Element_a9ff8417659bb4800d825f91fa8685aaf) (enumparma__polyhedra__library_1_1Grid__Generator__Type)]
->> endobj
-3467 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Grid__Generator__Type_a02ca1ef23d4c2b965198ea42d9d683a4) 1394 0 R (enumparma__polyhedra__library_1_1Grid__Generator__Type_a1a63d52277531ad7883e6679a90fdc67) 1395 0 R (enumparma__polyhedra__library_1_1MIP__Problem__Status) 757 0 R (enumparma__polyhedra__library_1_1MIP__Problem__Status_a417470c5917175d267ea3ec71df18027) 1866 0 R (enumparma__polyhedra__library_1_1MIP__Problem__Status_af2bdcebf7178739216e2dc7f5c421c9c) 1867 0 R (enumparma__polyhedra_ [...]
-/Limits [(enumparma__polyhedra__library_1_1Grid__Generator__Type_a02ca1ef23d4c2b965198ea42d9d683a4) (enumparma__polyhedra__library_1_1Optimization__Mode)]
->> endobj
-3468 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Optimization__Mode_aed6d879ab6fa6e6dea28b6841058c848) 1879 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) 764 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_a1676341382601ab9c96f035983f372d5) 2142 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_ab5cadae2d9d1e506769cafc7dd19c5b5) 2143 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Val [...]
-/Limits [(enumparma__polyhedra__library_1_1Optimization__Mode_aed6d879ab6fa6e6dea28b6841058c848) (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a46e366594cc5fa0e10c75a1b6c17df09)]
->> endobj
-3469 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a7d97a0adb78a51c7089586f7ee4cb6bd) 2159 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abc9126a51dec07227e4919899e44589b) 2160 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abd8921ad9d2cc32e7ee32de63704c1c8) 2162 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_ac2b60fec8498b08d7f22b2264d3948d4) 2146 0 R (enumparma__ [...]
-/Limits [(enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a7d97a0adb78a51c7089586f7ee4cb6bd) (enumparma__polyhedra__library_1_1PIP__Problem__Status_a89f381f0a22cc6f22b445a4c1691db77)]
->> endobj
-3470 0 obj <<
-/Names [(enumparma__polyhedra__library_1_1Relation__Symbol) 809 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_a95eb0b200e5754f1b18972012c1807d4) 3000 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_aaa76c2fe8629d0c3251374d87a0da4a4) 2998 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_ac49c86d7db3259a07d9a2b293e573733) 2999 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_ae25095de7466faeb9f7bf4c476f34cf0) 3001 0 R (group__PPL__Java__interface) 800 0 R]
-/Limits [(enumparma__polyhedra__library_1_1Relation__Symbol) (group__PPL__Java__interface)]
->> endobj
-3471 0 obj <<
-/Names [(index) 427 0 R (namespaceparma__polyhedra__library) 562 0 R (page.1) 298 0 R (page.10) 494 0 R (page.100) 3165 0 R (page.101) 3265 0 R]
-/Limits [(index) (page.101)]
->> endobj
-3472 0 obj <<
-/Names [(page.102) 3316 0 R (page.11) 506 0 R (page.12) 513 0 R (page.13) 518 0 R (page.14) 524 0 R (page.15) 529 0 R]
-/Limits [(page.102) (page.15)]
->> endobj
-3473 0 obj <<
-/Names [(page.16) 535 0 R (page.17) 561 0 R (page.18) 596 0 R (page.19) 632 0 R (page.2) 311 0 R (page.20) 685 0 R]
-/Limits [(page.16) (page.20)]
->> endobj
-3474 0 obj <<
-/Names [(page.21) 749 0 R (page.22) 799 0 R (page.23) 843 0 R (page.24) 871 0 R (page.25) 896 0 R (page.26) 930 0 R]
-/Limits [(page.21) (page.26)]
->> endobj
-3475 0 obj <<
-/Names [(page.27) 955 0 R (page.28) 974 0 R (page.29) 994 0 R (page.3) 323 0 R (page.30) 1015 0 R (page.31) 1047 0 R]
-/Limits [(page.27) (page.31)]
->> endobj
-3476 0 obj <<
-/Names [(page.32) 1077 0 R (page.33) 1103 0 R (page.34) 1124 0 R (page.35) 1158 0 R (page.36) 1196 0 R (page.37) 1221 0 R]
-/Limits [(page.32) (page.37)]
->> endobj
-3477 0 obj <<
-/Names [(page.38) 1240 0 R (page.39) 1279 0 R (page.4) 336 0 R (page.40) 1301 0 R (page.41) 1329 0 R (page.42) 1359 0 R]
-/Limits [(page.38) (page.42)]
->> endobj
-3478 0 obj <<
-/Names [(page.43) 1384 0 R (page.44) 1403 0 R (page.45) 1420 0 R (page.46) 1446 0 R (page.47) 1485 0 R (page.48) 1521 0 R]
-/Limits [(page.43) (page.48)]
->> endobj
-3479 0 obj <<
-/Names [(page.49) 1558 0 R (page.5) 458 0 R (page.50) 1602 0 R (page.51) 1635 0 R (page.52) 1664 0 R (page.53) 1705 0 R]
-/Limits [(page.49) (page.53)]
->> endobj
-3480 0 obj <<
-/Names [(page.54) 1760 0 R (page.55) 1791 0 R (page.56) 1810 0 R (page.57) 1831 0 R (page.58) 1856 0 R (page.59) 1877 0 R]
-/Limits [(page.54) (page.59)]
->> endobj
-3481 0 obj <<
-/Names [(page.6) 465 0 R (page.60) 1900 0 R (page.61) 1927 0 R (page.62) 1952 0 R (page.63) 1974 0 R (page.64) 1993 0 R]
-/Limits [(page.6) (page.64)]
->> endobj
-3482 0 obj <<
-/Names [(page.65) 2041 0 R (page.66) 2082 0 R (page.67) 2103 0 R (page.68) 2116 0 R (page.69) 2139 0 R (page.7) 471 0 R]
-/Limits [(page.65) (page.7)]
->> endobj
-3483 0 obj <<
-/Names [(page.70) 2158 0 R (page.71) 2176 0 R (page.72) 2212 0 R (page.73) 2255 0 R (page.74) 2287 0 R (page.75) 2319 0 R]
-/Limits [(page.70) (page.75)]
->> endobj
-3484 0 obj <<
-/Names [(page.76) 2345 0 R (page.77) 2384 0 R (page.78) 2458 0 R (page.79) 2541 0 R (page.8) 478 0 R (page.80) 2614 0 R]
-/Limits [(page.76) (page.80)]
->> endobj
-3485 0 obj <<
-/Names [(page.81) 2649 0 R (page.82) 2672 0 R (page.83) 2691 0 R (page.84) 2711 0 R (page.85) 2736 0 R (page.86) 2760 0 R]
-/Limits [(page.81) (page.86)]
->> endobj
-3486 0 obj <<
-/Names [(page.87) 2787 0 R (page.88) 2810 0 R (page.89) 2832 0 R (page.9) 486 0 R (page.90) 2855 0 R (page.91) 2878 0 R]
-/Limits [(page.87) (page.91)]
->> endobj
-3487 0 obj <<
-/Names [(page.92) 2905 0 R (page.93) 2929 0 R (page.94) 2950 0 R (page.95) 2971 0 R (page.96) 2994 0 R (page.97) 3015 0 R]
-/Limits [(page.92) (page.97)]
->> endobj
-3488 0 obj <<
-/Names [(page.98) 3030 0 R (page.99) 3090 0 R (page.i) 386 0 R (page.ii) 420 0 R (paragraph.10.18.2.1) 1289 0 R (paragraph.10.18.2.2) 1302 0 R]
-/Limits [(page.98) (paragraph.10.18.2.2)]
->> endobj
-3489 0 obj <<
-/Names [(paragraph.10.18.2.3) 1304 0 R (paragraph.10.18.2.4) 1306 0 R (paragraph.10.18.2.5) 1308 0 R (paragraph.10.21.2.1) 1366 0 R (paragraph.10.21.2.2) 1369 0 R (paragraph.10.21.2.3) 1372 0 R]
-/Limits [(paragraph.10.18.2.3) (paragraph.10.21.2.3)]
->> endobj
-3490 0 obj <<
-/Names [(paragraph.10.21.2.4) 1386 0 R (paragraph.10.25.2.1) 1412 0 R (paragraph.10.35.2.1) 1795 0 R (paragraph.10.35.2.2) 1798 0 R (paragraph.10.35.3.1) 1815 0 R (paragraph.10.35.3.10) 1859 0 R]
-/Limits [(paragraph.10.21.2.4) (paragraph.10.35.3.10)]
->> endobj
-3491 0 obj <<
-/Names [(paragraph.10.35.3.11) 1861 0 R (paragraph.10.35.3.12) 1863 0 R (paragraph.10.35.3.2) 1816 0 R (paragraph.10.35.3.3) 1819 0 R (paragraph.10.35.3.4) 1822 0 R (paragraph.10.35.3.5) 1834 0 R]
-/Limits [(paragraph.10.35.3.11) (paragraph.10.35.3.5)]
->> endobj
-3492 0 obj <<
-/Names [(paragraph.10.35.3.6) 1837 0 R (paragraph.10.35.3.7) 1840 0 R (paragraph.10.35.3.8) 1841 0 R (paragraph.10.35.3.9) 1842 0 R (paragraph.10.40.2.1) 1933 0 R (paragraph.10.40.2.2) 1934 0 R]
-/Limits [(paragraph.10.35.3.6) (paragraph.10.40.2.2)]
->> endobj
-3493 0 obj <<
-/Names [(paragraph.10.40.2.3) 1935 0 R (paragraph.10.40.2.4) 1936 0 R (paragraph.10.40.2.5) 1953 0 R (paragraph.10.40.2.6) 1954 0 R (paragraph.10.40.2.7) 1955 0 R (paragraph.10.40.2.8) 1958 0 R]
-/Limits [(paragraph.10.40.2.3) (paragraph.10.40.2.8)]
->> endobj
-3494 0 obj <<
-/Names [(paragraph.10.41.2.1) 1995 0 R (paragraph.10.41.2.2) 1996 0 R (paragraph.10.43.2.1) 2105 0 R (paragraph.10.43.2.2) 2118 0 R (paragraph.10.43.3.1) 2120 0 R (paragraph.10.43.3.2) 2121 0 R]
-/Limits [(paragraph.10.41.2.1) (paragraph.10.43.3.2)]
->> endobj
-3495 0 obj <<
-/Names [(paragraph.10.43.3.3) 2123 0 R (paragraph.10.43.3.4) 2126 0 R (paragraph.10.43.3.5) 2129 0 R (paragraph.10.43.3.6) 2140 0 R (paragraph.10.47.2.1) 2181 0 R (paragraph.10.48.2.1) 2257 0 R]
-/Limits [(paragraph.10.43.3.3) (paragraph.10.48.2.1)]
->> endobj
-3496 0 obj <<
-/Names [(paragraph.10.49.2.1) 2291 0 R (paragraph.10.50.2.1) 2322 0 R (paragraph.10.53.2.1) 2654 0 R (paragraph.10.53.2.10) 2715 0 R (paragraph.10.53.2.11) 2718 0 R (paragraph.10.53.2.12) 2721 0 R]
-/Limits [(paragraph.10.49.2.1) (paragraph.10.53.2.12)]
->> endobj
-3497 0 obj <<
-/Names [(paragraph.10.53.2.13) 2724 0 R (paragraph.10.53.2.14) 2727 0 R (paragraph.10.53.2.15) 2728 0 R (paragraph.10.53.2.16) 2737 0 R (paragraph.10.53.2.17) 2741 0 R (paragraph.10.53.2.18) 2744 0 R]
-/Limits [(paragraph.10.53.2.13) (paragraph.10.53.2.18)]
->> endobj
-3498 0 obj <<
-/Names [(paragraph.10.53.2.19) 2748 0 R (paragraph.10.53.2.2) 2657 0 R (paragraph.10.53.2.20) 2763 0 R (paragraph.10.53.2.21) 2766 0 R (paragraph.10.53.2.22) 2769 0 R (paragraph.10.53.2.23) 2773 0 R]
-/Limits [(paragraph.10.53.2.19) (paragraph.10.53.2.23)]
->> endobj
-3499 0 obj <<
-/Names [(paragraph.10.53.2.24) 2777 0 R (paragraph.10.53.2.25) 2790 0 R (paragraph.10.53.2.26) 2793 0 R (paragraph.10.53.2.27) 2796 0 R (paragraph.10.53.2.28) 2799 0 R (paragraph.10.53.2.29) 2802 0 R]
-/Limits [(paragraph.10.53.2.24) (paragraph.10.53.2.29)]
->> endobj
-3500 0 obj <<
-/Names [(paragraph.10.53.2.3) 2660 0 R (paragraph.10.53.2.30) 2814 0 R (paragraph.10.53.2.31) 2818 0 R (paragraph.10.53.2.32) 2822 0 R (paragraph.10.53.2.33) 2836 0 R (paragraph.10.53.2.34) 2841 0 R]
-/Limits [(paragraph.10.53.2.3) (paragraph.10.53.2.34)]
->> endobj
-3501 0 obj <<
-/Names [(paragraph.10.53.2.35) 2856 0 R (paragraph.10.53.2.36) 2860 0 R (paragraph.10.53.2.37) 2864 0 R (paragraph.10.53.2.38) 2868 0 R (paragraph.10.53.2.39) 2882 0 R (paragraph.10.53.2.4) 2675 0 R]
-/Limits [(paragraph.10.53.2.35) (paragraph.10.53.2.4)]
->> endobj
-3502 0 obj <<
-/Names [(paragraph.10.53.2.40) 2886 0 R (paragraph.10.53.2.41) 2889 0 R (paragraph.10.53.2.42) 2892 0 R (paragraph.10.53.2.43) 2908 0 R (paragraph.10.53.2.44) 2911 0 R (paragraph.10.53.2.45) 2915 0 R]
-/Limits [(paragraph.10.53.2.40) (paragraph.10.53.2.45)]
->> endobj
-3503 0 obj <<
-/Names [(paragraph.10.53.2.46) 2918 0 R (paragraph.10.53.2.47) 2933 0 R (paragraph.10.53.2.48) 2937 0 R (paragraph.10.53.2.49) 2939 0 R (paragraph.10.53.2.5) 2679 0 R (paragraph.10.53.2.50) 2942 0 R]
-/Limits [(paragraph.10.53.2.46) (paragraph.10.53.2.50)]
->> endobj
-3504 0 obj <<
-/Names [(paragraph.10.53.2.51) 2954 0 R (paragraph.10.53.2.52) 2958 0 R (paragraph.10.53.2.53) 2962 0 R (paragraph.10.53.2.54) 2974 0 R (paragraph.10.53.2.55) 2978 0 R (paragraph.10.53.2.56) 2982 0 R]
-/Limits [(paragraph.10.53.2.51) (paragraph.10.53.2.56)]
->> endobj
-3505 0 obj <<
-/Names [(paragraph.10.53.2.6) 2683 0 R (paragraph.10.53.2.7) 2695 0 R (paragraph.10.53.2.8) 2699 0 R (paragraph.10.53.2.9) 2712 0 R (paragraph.10.56.2.1) 3023 0 R (paragraph.10.7.2.1) 1083 0 R]
-/Limits [(paragraph.10.53.2.6) (paragraph.10.7.2.1)]
->> endobj
-3506 0 obj <<
-/Names [(paragraph.10.7.2.2) 1085 0 R (paragraph.10.7.2.3) 1086 0 R (paragraph.10.7.2.4) 1087 0 R (paragraph.10.7.2.5) 1088 0 R (paragraph.10.7.2.6) 1104 0 R (paragraph.10.7.3.1) 1106 0 R]
-/Limits [(paragraph.10.7.2.2) (paragraph.10.7.3.1)]
->> endobj
-3507 0 obj <<
-/Names [(paragraph.10.7.3.2) 1109 0 R (paragraph.10.8.2.1) 1132 0 R (section*.1) 429 0 R (section*.10) 460 0 R (section*.100) 2651 0 R (section*.101) 2997 0 R]
-/Limits [(paragraph.10.7.3.2) (section*.101)]
->> endobj
-3508 0 obj <<
-/Names [(section*.102) 3003 0 R (section*.103) 3017 0 R (section*.104) 3031 0 R (section*.105) 3091 0 R (section*.11) 466 0 R (section*.12) 472 0 R]
-/Limits [(section*.102) (section*.12)]
->> endobj
-3509 0 obj <<
-/Names [(section*.13) 479 0 R (section*.14) 480 0 R (section*.15) 481 0 R (section*.16) 487 0 R (section*.17) 488 0 R (section*.18) 489 0 R]
-/Limits [(section*.13) (section*.18)]
->> endobj
-3510 0 obj <<
-/Names [(section*.19) 495 0 R (section*.2) 439 0 R (section*.20) 496 0 R (section*.21) 497 0 R (section*.22) 498 0 R (section*.23) 536 0 R]
-/Limits [(section*.19) (section*.23)]
->> endobj
-3511 0 obj <<
-/Names [(section*.24) 801 0 R (section*.25) 802 0 R (section*.26) 898 0 R (section*.27) 957 0 R (section*.28) 980 0 R (section*.29) 995 0 R]
-/Limits [(section*.24) (section*.29)]
->> endobj
-3512 0 obj <<
-/Names [(section*.3) 444 0 R (section*.30) 999 0 R (section*.31) 1002 0 R (section*.32) 1019 0 R (section*.33) 1048 0 R (section*.34) 1078 0 R]
-/Limits [(section*.3) (section*.34)]
->> endobj
-3513 0 obj <<
-/Names [(section*.35) 1079 0 R (section*.36) 1110 0 R (section*.37) 1128 0 R (section*.38) 1134 0 R (section*.39) 1159 0 R (section*.4) 445 0 R]
-/Limits [(section*.35) (section*.4)]
->> endobj
-3514 0 obj <<
-/Names [(section*.40) 1168 0 R (section*.41) 1197 0 R (section*.42) 1202 0 R (section*.43) 1222 0 R (section*.44) 1227 0 R (section*.45) 1241 0 R]
-/Limits [(section*.40) (section*.45)]
->> endobj
-3515 0 obj <<
-/Names [(section*.46) 1246 0 R (section*.47) 1249 0 R (section*.48) 1280 0 R (section*.49) 1285 0 R (section*.5) 446 0 R (section*.50) 1310 0 R]
-/Limits [(section*.46) (section*.50)]
->> endobj
-3516 0 obj <<
-/Names [(section*.51) 1333 0 R (section*.52) 1338 0 R (section*.53) 1362 0 R (section*.54) 1388 0 R (section*.55) 1393 0 R (section*.56) 1405 0 R]
-/Limits [(section*.51) (section*.56)]
->> endobj
-3517 0 obj <<
-/Names [(section*.57) 1408 0 R (section*.58) 1422 0 R (section*.59) 1447 0 R (section*.6) 451 0 R (section*.60) 1488 0 R (section*.61) 1492 0 R]
-/Limits [(section*.57) (section*.61)]
->> endobj
-3518 0 obj <<
-/Names [(section*.62) 1523 0 R (section*.63) 1528 0 R (section*.64) 1560 0 R (section*.65) 1565 0 R (section*.66) 1604 0 R (section*.67) 1611 0 R]
-/Limits [(section*.62) (section*.67)]
->> endobj
-3519 0 obj <<
-/Names [(section*.68) 1638 0 R (section*.69) 1642 0 R (section*.7) 452 0 R (section*.70) 1666 0 R (section*.71) 1706 0 R (section*.72) 1709 0 R]
-/Limits [(section*.68) (section*.72)]
->> endobj
-3520 0 obj <<
-/Names [(section*.73) 1766 0 R (section*.74) 1792 0 R (section*.75) 1865 0 R (section*.76) 1878 0 R (section*.77) 1881 0 R (section*.78) 1901 0 R]
-/Limits [(section*.73) (section*.78)]
->> endobj
-3521 0 obj <<
-/Names [(section*.79) 1905 0 R (section*.8) 453 0 R (section*.80) 1975 0 R (section*.81) 1980 0 R (section*.82) 1997 0 R (section*.83) 2042 0 R]
-/Limits [(section*.79) (section*.83)]
->> endobj
-3522 0 obj <<
-/Names [(section*.84) 2090 0 R (section*.85) 2141 0 R (section*.86) 2145 0 R (section*.87) 2164 0 R (section*.88) 2177 0 R (section*.89) 2213 0 R]
-/Limits [(section*.84) (section*.89)]
->> endobj
-3523 0 obj <<
-/Names [(section*.9) 459 0 R (section*.90) 2220 0 R (section*.91) 2258 0 R (section*.92) 2288 0 R (section*.93) 2292 0 R (section*.94) 2298 0 R]
-/Limits [(section*.9) (section*.94)]
->> endobj
-3524 0 obj <<
-/Names [(section*.95) 2323 0 R (section*.96) 2326 0 R (section*.97) 2347 0 R (section*.98) 2350 0 R (section*.99) 2385 0 R (section.1) 2 0 R]
-/Limits [(section*.95) (section.1)]
->> endobj
-3525 0 obj <<
-/Names [(section.10) 62 0 R (section.2) 6 0 R (section.3) 10 0 R (section.4) 14 0 R (section.5) 22 0 R (section.6) 30 0 R]
-/Limits [(section.10) (section.6)]
->> endobj
-3526 0 obj <<
-/Names [(section.7) 38 0 R (section.8) 46 0 R (section.9) 54 0 R (subsection.10.1) 66 0 R (subsection.10.10) 102 0 R (subsection.10.11) 106 0 R]
-/Limits [(section.7) (subsection.10.11)]
->> endobj
-3527 0 obj <<
-/Names [(subsection.10.12) 110 0 R (subsection.10.13) 114 0 R (subsection.10.14) 118 0 R (subsection.10.15) 122 0 R (subsection.10.16) 126 0 R (subsection.10.17) 130 0 R]
-/Limits [(subsection.10.12) (subsection.10.17)]
->> endobj
-3528 0 obj <<
-/Names [(subsection.10.18) 134 0 R (subsection.10.19) 138 0 R (subsection.10.2) 70 0 R (subsection.10.20) 142 0 R (subsection.10.21) 146 0 R (subsection.10.22) 150 0 R]
-/Limits [(subsection.10.18) (subsection.10.22)]
->> endobj
-3529 0 obj <<
-/Names [(subsection.10.23) 154 0 R (subsection.10.24) 158 0 R (subsection.10.25) 162 0 R (subsection.10.26) 166 0 R (subsection.10.27) 170 0 R (subsection.10.28) 174 0 R]
-/Limits [(subsection.10.23) (subsection.10.28)]
->> endobj
-3530 0 obj <<
-/Names [(subsection.10.29) 178 0 R (subsection.10.3) 74 0 R (subsection.10.30) 182 0 R (subsection.10.31) 186 0 R (subsection.10.32) 190 0 R (subsection.10.33) 194 0 R]
-/Limits [(subsection.10.29) (subsection.10.33)]
->> endobj
-3531 0 obj <<
-/Names [(subsection.10.34) 198 0 R (subsection.10.35) 202 0 R (subsection.10.36) 206 0 R (subsection.10.37) 210 0 R (subsection.10.38) 214 0 R (subsection.10.39) 218 0 R]
-/Limits [(subsection.10.34) (subsection.10.39)]
->> endobj
-3532 0 obj <<
-/Names [(subsection.10.4) 78 0 R (subsection.10.40) 222 0 R (subsection.10.41) 226 0 R (subsection.10.42) 230 0 R (subsection.10.43) 234 0 R (subsection.10.44) 238 0 R]
-/Limits [(subsection.10.4) (subsection.10.44)]
->> endobj
-3533 0 obj <<
-/Names [(subsection.10.45) 242 0 R (subsection.10.46) 246 0 R (subsection.10.47) 250 0 R (subsection.10.48) 254 0 R (subsection.10.49) 258 0 R (subsection.10.5) 82 0 R]
-/Limits [(subsection.10.45) (subsection.10.5)]
->> endobj
-3534 0 obj <<
-/Names [(subsection.10.50) 262 0 R (subsection.10.51) 266 0 R (subsection.10.52) 270 0 R (subsection.10.53) 274 0 R (subsection.10.54) 278 0 R (subsection.10.55) 282 0 R]
-/Limits [(subsection.10.50) (subsection.10.55)]
->> endobj
-3535 0 obj <<
-/Names [(subsection.10.56) 286 0 R (subsection.10.57) 290 0 R (subsection.10.6) 86 0 R (subsection.10.7) 90 0 R (subsection.10.8) 94 0 R (subsection.10.9) 98 0 R]
-/Limits [(subsection.10.56) (subsection.10.9)]
->> endobj
-3536 0 obj <<
-/Names [(subsection.4.1) 18 0 R (subsection.5.1) 26 0 R (subsection.6.1) 34 0 R (subsection.7.1) 42 0 R (subsection.8.1) 50 0 R (subsection.9.1) 58 0 R]
-/Limits [(subsection.4.1) (subsection.9.1)]
->> endobj
-3537 0 obj <<
-/Names [(subsubsection.10.1.1) 979 0 R (subsubsection.10.10.1) 1170 0 R (subsubsection.10.11.1) 1201 0 R (subsubsection.10.12.1) 1209 0 R (subsubsection.10.13.1) 1226 0 R (subsubsection.10.14.1) 1229 0 R]
-/Limits [(subsubsection.10.1.1) (subsubsection.10.14.1)]
->> endobj
-3538 0 obj <<
-/Names [(subsubsection.10.15.1) 1245 0 R (subsubsection.10.16.1) 1248 0 R (subsubsection.10.17.1) 1251 0 R (subsubsection.10.18.1) 1286 0 R (subsubsection.10.18.2) 1287 0 R (subsubsection.10.19.1) 1332 0 R]
-/Limits [(subsubsection.10.15.1) (subsubsection.10.19.1)]
->> endobj
-3539 0 obj <<
-/Names [(subsubsection.10.2.1) 982 0 R (subsubsection.10.20.1) 1337 0 R (subsubsection.10.21.1) 1363 0 R (subsubsection.10.21.2) 1364 0 R (subsubsection.10.22.1) 1392 0 R (subsubsection.10.23.1) 1404 0 R]
-/Limits [(subsubsection.10.2.1) (subsubsection.10.23.1)]
->> endobj
-3540 0 obj <<
-/Names [(subsubsection.10.24.1) 1407 0 R (subsubsection.10.25.1) 1409 0 R (subsubsection.10.25.2) 1410 0 R (subsubsection.10.26.1) 1424 0 R (subsubsection.10.27.1) 1486 0 R (subsubsection.10.28.1) 1522 0 R]
-/Limits [(subsubsection.10.24.1) (subsubsection.10.28.1)]
->> endobj
-3541 0 obj <<
-/Names [(subsubsection.10.29.1) 1559 0 R (subsubsection.10.3.1) 998 0 R (subsubsection.10.30.1) 1603 0 R (subsubsection.10.31.1) 1637 0 R (subsubsection.10.32.1) 1665 0 R (subsubsection.10.33.1) 1670 0 R]
-/Limits [(subsubsection.10.29.1) (subsubsection.10.33.1)]
->> endobj
-3542 0 obj <<
-/Names [(subsubsection.10.34.1) 1708 0 R (subsubsection.10.35.1) 1793 0 R (subsubsection.10.35.2) 1794 0 R (subsubsection.10.35.3) 1814 0 R (subsubsection.10.36.1) 1868 0 R (subsubsection.10.37.1) 1880 0 R]
-/Limits [(subsubsection.10.34.1) (subsubsection.10.37.1)]
->> endobj
-3543 0 obj <<
-/Names [(subsubsection.10.38.1) 1883 0 R (subsubsection.10.39.1) 1904 0 R (subsubsection.10.4.1) 1001 0 R (subsubsection.10.40.1) 1931 0 R (subsubsection.10.40.2) 1932 0 R (subsubsection.10.41.1) 1982 0 R]
-/Limits [(subsubsection.10.38.1) (subsubsection.10.41.1)]
->> endobj
-3544 0 obj <<
-/Names [(subsubsection.10.41.2) 1994 0 R (subsubsection.10.42.1) 1999 0 R (subsubsection.10.43.1) 2092 0 R (subsubsection.10.43.2) 2104 0 R (subsubsection.10.43.3) 2119 0 R (subsubsection.10.44.1) 2144 0 R]
-/Limits [(subsubsection.10.41.2) (subsubsection.10.44.1)]
->> endobj
-3545 0 obj <<
-/Names [(subsubsection.10.45.1) 2163 0 R (subsubsection.10.46.1) 2166 0 R (subsubsection.10.47.1) 2178 0 R (subsubsection.10.47.2) 2179 0 R (subsubsection.10.48.1) 2221 0 R (subsubsection.10.48.2) 2256 0 R]
-/Limits [(subsubsection.10.45.1) (subsubsection.10.48.2)]
->> endobj
-3546 0 obj <<
-/Names [(subsubsection.10.49.1) 2289 0 R (subsubsection.10.49.2) 2290 0 R (subsubsection.10.5.1) 1017 0 R (subsubsection.10.50.1) 2320 0 R (subsubsection.10.50.2) 2321 0 R (subsubsection.10.51.1) 2346 0 R]
-/Limits [(subsubsection.10.49.1) (subsubsection.10.51.1)]
->> endobj
-3547 0 obj <<
-/Names [(subsubsection.10.52.1) 2353 0 R (subsubsection.10.53.1) 2652 0 R (subsubsection.10.53.2) 2653 0 R (subsubsection.10.54.1) 3002 0 R (subsubsection.10.55.1) 3016 0 R (subsubsection.10.56.1) 3020 0 R]
-/Limits [(subsubsection.10.52.1) (subsubsection.10.56.1)]
->> endobj
-3548 0 obj <<
-/Names [(subsubsection.10.56.2) 3021 0 R (subsubsection.10.57.1) 3033 0 R (subsubsection.10.6.1) 1023 0 R (subsubsection.10.7.1) 1081 0 R (subsubsection.10.7.2) 1082 0 R (subsubsection.10.7.3) 1105 0 R]
-/Limits [(subsubsection.10.56.2) (subsubsection.10.7.3)]
->> endobj
-3549 0 obj <<
-/Names [(subsubsection.10.8.1) 1130 0 R (subsubsection.10.8.2) 1131 0 R (subsubsection.10.9.1) 1137 0 R (subsubsection.8.1.1) 897 0 R (subsubsection.9.1.1) 956 0 R (table.1) 1107 0 R]
-/Limits [(subsubsection.10.8.1) (table.1)]
->> endobj
-3550 0 obj <<
-/Names [(table.10) 1385 0 R (table.100) 2912 0 R (table.101) 2913 0 R (table.102) 2916 0 R (table.103) 2930 0 R (table.104) 2931 0 R]
-/Limits [(table.10) (table.104)]
->> endobj
-3551 0 obj <<
-/Names [(table.105) 2934 0 R (table.106) 2935 0 R (table.107) 2938 0 R (table.108) 2940 0 R (table.109) 2951 0 R (table.11) 1387 0 R]
-/Limits [(table.105) (table.11)]
->> endobj
-3552 0 obj <<
-/Names [(table.110) 2952 0 R (table.111) 2955 0 R (table.112) 2956 0 R (table.113) 2959 0 R (table.114) 2960 0 R (table.115) 2963 0 R]
-/Limits [(table.110) (table.115)]
->> endobj
-3553 0 obj <<
-/Names [(table.116) 2972 0 R (table.117) 2975 0 R (table.118) 2976 0 R (table.119) 2979 0 R (table.12) 1421 0 R (table.120) 2980 0 R]
-/Limits [(table.116) (table.120)]
->> endobj
-3554 0 obj <<
-/Names [(table.121) 2983 0 R (table.122) 2995 0 R (table.123) 3024 0 R (table.13) 1796 0 R (table.14) 1797 0 R (table.15) 1811 0 R]
-/Limits [(table.121) (table.15)]
->> endobj
-3555 0 obj <<
-/Names [(table.16) 1812 0 R (table.17) 1817 0 R (table.18) 1818 0 R (table.19) 1820 0 R (table.2) 1133 0 R (table.20) 1832 0 R]
-/Limits [(table.16) (table.20)]
->> endobj
-3556 0 obj <<
-/Names [(table.21) 1835 0 R (table.22) 1838 0 R (table.23) 1843 0 R (table.24) 1857 0 R (table.25) 1860 0 R (table.26) 1862 0 R]
-/Limits [(table.21) (table.26)]
->> endobj
-3557 0 obj <<
-/Names [(table.27) 1864 0 R (table.28) 1956 0 R (table.29) 1960 0 R (table.3) 1290 0 R (table.30) 1961 0 R (table.31) 2106 0 R]
-/Limits [(table.27) (table.31)]
->> endobj
-3558 0 obj <<
-/Names [(table.32) 2117 0 R (table.33) 2122 0 R (table.34) 2124 0 R (table.35) 2127 0 R (table.36) 2182 0 R (table.37) 2655 0 R]
-/Limits [(table.32) (table.37)]
->> endobj
-3559 0 obj <<
-/Names [(table.38) 2658 0 R (table.39) 2673 0 R (table.4) 1303 0 R (table.40) 2676 0 R (table.41) 2677 0 R (table.42) 2680 0 R]
-/Limits [(table.38) (table.42)]
->> endobj
-3560 0 obj <<
-/Names [(table.43) 2681 0 R (table.44) 2692 0 R (table.45) 2693 0 R (table.46) 2696 0 R (table.47) 2697 0 R (table.48) 2700 0 R]
-/Limits [(table.43) (table.48)]
->> endobj
-3561 0 obj <<
-/Names [(table.49) 2713 0 R (table.5) 1305 0 R (table.50) 2716 0 R (table.51) 2719 0 R (table.52) 2722 0 R (table.53) 2725 0 R]
-/Limits [(table.49) (table.53)]
->> endobj
-3562 0 obj <<
-/Names [(table.54) 2738 0 R (table.55) 2739 0 R (table.56) 2742 0 R (table.57) 2745 0 R (table.58) 2746 0 R (table.59) 2749 0 R]
-/Limits [(table.54) (table.59)]
->> endobj
-3563 0 obj <<
-/Names [(table.6) 1307 0 R (table.60) 2761 0 R (table.61) 2764 0 R (table.62) 2767 0 R (table.63) 2770 0 R (table.64) 2771 0 R]
-/Limits [(table.6) (table.64)]
->> endobj
-3564 0 obj <<
-/Names [(table.65) 2774 0 R (table.66) 2775 0 R (table.67) 2788 0 R (table.68) 2791 0 R (table.69) 2794 0 R (table.7) 1309 0 R]
-/Limits [(table.65) (table.7)]
->> endobj
-3565 0 obj <<
-/Names [(table.70) 2797 0 R (table.71) 2800 0 R (table.72) 2811 0 R (table.73) 2812 0 R (table.74) 2815 0 R (table.75) 2816 0 R]
-/Limits [(table.70) (table.75)]
->> endobj
-3566 0 obj <<
-/Names [(table.76) 2819 0 R (table.77) 2820 0 R (table.78) 2833 0 R (table.79) 2834 0 R (table.8) 1367 0 R (table.80) 2837 0 R]
-/Limits [(table.76) (table.80)]
->> endobj
-3567 0 obj <<
-/Names [(table.81) 2838 0 R (table.82) 2842 0 R (table.83) 2843 0 R (table.84) 2857 0 R (table.85) 2858 0 R (table.86) 2861 0 R]
-/Limits [(table.81) (table.86)]
->> endobj
-3568 0 obj <<
-/Names [(table.87) 2862 0 R (table.88) 2865 0 R (table.89) 2866 0 R (table.9) 1370 0 R (table.90) 2879 0 R (table.91) 2880 0 R]
-/Limits [(table.87) (table.91)]
->> endobj
-3569 0 obj <<
-/Names [(table.92) 2883 0 R (table.93) 2884 0 R (table.94) 2887 0 R (table.95) 2890 0 R (table.96) 2891 0 R (table.97) 2906 0 R]
-/Limits [(table.92) (table.97)]
->> endobj
-3570 0 obj <<
-/Names [(table.98) 2907 0 R (table.99) 2909 0 R]
-/Limits [(table.98) (table.99)]
->> endobj
-3571 0 obj <<
-/Kids [3401 0 R 3402 0 R 3403 0 R 3404 0 R 3405 0 R 3406 0 R]
-/Limits [(Doc-Start) (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb12fac766004b358c5)]
->> endobj
-3572 0 obj <<
-/Kids [3407 0 R 3408 0 R 3409 0 R 3410 0 R 3411 0 R 3412 0 R]
-/Limits [(classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) (classparma__polyhedra__library_1_1Generator_a6c93053ad6b6bbcaa9aee01b646bba06)]
->> endobj
-3573 0 obj <<
-/Kids [3413 0 R 3414 0 R 3415 0 R 3416 0 R 3417 0 R 3418 0 R]
-/Limits [(classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) (classparma__polyhedra__library_1_1Linear__Expression__Difference_aaaeb914f871ccb4e97fc4fd513364b94)]
->> endobj
-3574 0 obj <<
-/Kids [3419 0 R 3420 0 R 3421 0 R 3422 0 R 3423 0 R 3424 0 R]
-/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) (classparma__polyhedra__library_1_1Linear__Expression_af6431ecb966a6e38dc55e7f4274b31db)]
->> endobj
-3575 0 obj <<
-/Kids [3425 0 R 3426 0 R 3427 0 R 3428 0 R 3429 0 R 3430 0 R]
-/Limits [(classparma__polyhedra__library_1_1Logic__Error__Exception) (classparma__polyhedra__library_1_1PIP__Decision__Node)]
->> endobj
-3576 0 obj <<
-/Kids [3431 0 R 3432 0 R 3433 0 R 3434 0 R 3435 0 R 3436 0 R]
-/Limits [(classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93)]
->> endobj
-3577 0 obj <<
-/Kids [3437 0 R 3438 0 R 3439 0 R 3440 0 R 3441 0 R 3442 0 R]
-/Limits [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator)]
->> endobj
-3578 0 obj <<
-/Kids [3443 0 R 3444 0 R 3445 0 R 3446 0 R 3447 0 R 3448 0 R]
-/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e32932e6ecc)]
->> endobj
-3579 0 obj <<
-/Kids [3449 0 R 3450 0 R 3451 0 R 3452 0 R 3453 0 R 3454 0 R]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) (classparma__polyhedra__library_1_1Polyhedron_a8561bc8f545197343c8cf1935e794af3)]
->> endobj
-3580 0 obj <<
-/Kids [3455 0 R 3456 0 R 3457 0 R 3458 0 R 3459 0 R 3460 0 R]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) (classparma__polyhedra__library_1_1Polyhedron_afba20cade6fa4fcd26b81086a02923e5)]
->> endobj
-3581 0 obj <<
-/Kids [3461 0 R 3462 0 R 3463 0 R 3464 0 R 3465 0 R 3466 0 R]
-/Limits [(classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) (enumparma__polyhedra__library_1_1Grid__Generator__Type)]
->> endobj
-3582 0 obj <<
-/Kids [3467 0 R 3468 0 R 3469 0 R 3470 0 R 3471 0 R 3472 0 R]
-/Limits [(enumparma__polyhedra__library_1_1Grid__Generator__Type_a02ca1ef23d4c2b965198ea42d9d683a4) (page.15)]
->> endobj
-3583 0 obj <<
-/Kids [3473 0 R 3474 0 R 3475 0 R 3476 0 R 3477 0 R 3478 0 R]
-/Limits [(page.16) (page.48)]
->> endobj
-3584 0 obj <<
-/Kids [3479 0 R 3480 0 R 3481 0 R 3482 0 R 3483 0 R 3484 0 R]
-/Limits [(page.49) (page.80)]
->> endobj
-3585 0 obj <<
-/Kids [3485 0 R 3486 0 R 3487 0 R 3488 0 R 3489 0 R 3490 0 R]
-/Limits [(page.81) (paragraph.10.35.3.10)]
->> endobj
-3586 0 obj <<
-/Kids [3491 0 R 3492 0 R 3493 0 R 3494 0 R 3495 0 R 3496 0 R]
-/Limits [(paragraph.10.35.3.11) (paragraph.10.53.2.12)]
->> endobj
-3587 0 obj <<
-/Kids [3497 0 R 3498 0 R 3499 0 R 3500 0 R 3501 0 R 3502 0 R]
-/Limits [(paragraph.10.53.2.13) (paragraph.10.53.2.45)]
->> endobj
-3588 0 obj <<
-/Kids [3503 0 R 3504 0 R 3505 0 R 3506 0 R 3507 0 R 3508 0 R]
-/Limits [(paragraph.10.53.2.46) (section*.12)]
->> endobj
-3589 0 obj <<
-/Kids [3509 0 R 3510 0 R 3511 0 R 3512 0 R 3513 0 R 3514 0 R]
-/Limits [(section*.13) (section*.45)]
->> endobj
-3590 0 obj <<
-/Kids [3515 0 R 3516 0 R 3517 0 R 3518 0 R 3519 0 R 3520 0 R]
-/Limits [(section*.46) (section*.78)]
->> endobj
-3591 0 obj <<
-/Kids [3521 0 R 3522 0 R 3523 0 R 3524 0 R 3525 0 R 3526 0 R]
-/Limits [(section*.79) (subsection.10.11)]
->> endobj
-3592 0 obj <<
-/Kids [3527 0 R 3528 0 R 3529 0 R 3530 0 R 3531 0 R 3532 0 R]
-/Limits [(subsection.10.12) (subsection.10.44)]
->> endobj
-3593 0 obj <<
-/Kids [3533 0 R 3534 0 R 3535 0 R 3536 0 R 3537 0 R 3538 0 R]
-/Limits [(subsection.10.45) (subsubsection.10.19.1)]
->> endobj
-3594 0 obj <<
-/Kids [3539 0 R 3540 0 R 3541 0 R 3542 0 R 3543 0 R 3544 0 R]
-/Limits [(subsubsection.10.2.1) (subsubsection.10.44.1)]
->> endobj
-3595 0 obj <<
-/Kids [3545 0 R 3546 0 R 3547 0 R 3548 0 R 3549 0 R 3550 0 R]
-/Limits [(subsubsection.10.45.1) (table.104)]
->> endobj
-3596 0 obj <<
-/Kids [3551 0 R 3552 0 R 3553 0 R 3554 0 R 3555 0 R 3556 0 R]
-/Limits [(table.105) (table.26)]
->> endobj
-3597 0 obj <<
-/Kids [3557 0 R 3558 0 R 3559 0 R 3560 0 R 3561 0 R 3562 0 R]
-/Limits [(table.27) (table.59)]
->> endobj
-3598 0 obj <<
-/Kids [3563 0 R 3564 0 R 3565 0 R 3566 0 R 3567 0 R 3568 0 R]
-/Limits [(table.6) (table.91)]
->> endobj
-3599 0 obj <<
-/Kids [3569 0 R 3570 0 R]
-/Limits [(table.92) (table.99)]
->> endobj
-3600 0 obj <<
-/Kids [3571 0 R 3572 0 R 3573 0 R 3574 0 R 3575 0 R 3576 0 R]
-/Limits [(Doc-Start) (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93)]
->> endobj
-3601 0 obj <<
-/Kids [3577 0 R 3578 0 R 3579 0 R 3580 0 R 3581 0 R 3582 0 R]
-/Limits [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) (page.15)]
->> endobj
-3602 0 obj <<
-/Kids [3583 0 R 3584 0 R 3585 0 R 3586 0 R 3587 0 R 3588 0 R]
-/Limits [(page.16) (section*.12)]
->> endobj
-3603 0 obj <<
-/Kids [3589 0 R 3590 0 R 3591 0 R 3592 0 R 3593 0 R 3594 0 R]
-/Limits [(section*.13) (subsubsection.10.44.1)]
->> endobj
-3604 0 obj <<
-/Kids [3595 0 R 3596 0 R 3597 0 R 3598 0 R 3599 0 R]
-/Limits [(subsubsection.10.45.1) (table.99)]
->> endobj
-3605 0 obj <<
-/Kids [3600 0 R 3601 0 R 3602 0 R 3603 0 R 3604 0 R]
-/Limits [(Doc-Start) (table.99)]
->> endobj
-3606 0 obj <<
-/Dests 3605 0 R
->> endobj
-3607 0 obj <<
-/Type /Catalog
-/Pages 3399 0 R
-/Outlines 3400 0 R
-/Names 3606 0 R
-/PageMode/UseOutlines/PageLabels<</Nums[0<</S/D>>4<</S/r>>6<</S/D>>]>>
-/OpenAction 293 0 R
->> endobj
-3608 0 obj <<
-/Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords()
-/CreationDate (D:20120628125827+02'00')
-/ModDate (D:20120628125827+02'00')
-/Trapped /False
-/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0)
->> endobj
-xref
-0 3609
-0000000000 65535 f 
-0000000015 00000 n 
-0000058491 00000 n 
-0000992531 00000 n 
-0000000060 00000 n 
-0000000134 00000 n 
-0000062540 00000 n 
-0000992446 00000 n 
-0000000179 00000 n 
-0000000344 00000 n 
-0000097426 00000 n 
-0000992359 00000 n 
-0000000389 00000 n 
-0000000575 00000 n 
-0000116800 00000 n 
-0000992233 00000 n 
-0000000621 00000 n 
-0000000711 00000 n 
-0000116856 00000 n 
-0000992172 00000 n 
-0000000762 00000 n 
-0000000824 00000 n 
-0000121763 00000 n 
-0000992046 00000 n 
-0000000870 00000 n 
-0000000975 00000 n 
-0000121819 00000 n 
-0000991985 00000 n 
-0000001026 00000 n 
-0000001126 00000 n 
-0000121875 00000 n 
-0000991859 00000 n 
-0000001172 00000 n 
-0000001257 00000 n 
-0000121931 00000 n 
-0000991798 00000 n 
-0000001308 00000 n 
-0000001413 00000 n 
-0000135525 00000 n 
-0000991672 00000 n 
-0000001459 00000 n 
-0000001544 00000 n 
-0000135581 00000 n 
-0000991611 00000 n 
-0000001595 00000 n 
-0000001675 00000 n 
-0000160946 00000 n 
-0000991485 00000 n 
-0000001721 00000 n 
-0000001851 00000 n 
-0000161058 00000 n 
-0000991424 00000 n 
-0000001902 00000 n 
-0000002050 00000 n 
-0000180797 00000 n 
-0000991298 00000 n 
-0000002096 00000 n 
-0000002241 00000 n 
-0000180910 00000 n 
-0000991237 00000 n 
-0000002292 00000 n 
-0000002483 00000 n 
-0000194456 00000 n 
-0000991122 00000 n 
-0000002530 00000 n 
-0000002655 00000 n 
-0000194569 00000 n 
-0000991048 00000 n 
-0000002707 00000 n 
-0000003049 00000 n 
-0000200461 00000 n 
-0000990961 00000 n 
-0000003101 00000 n 
-0000003491 00000 n 
-0000204040 00000 n 
-0000990874 00000 n 
-0000003543 00000 n 
-0000003931 00000 n 
-0000204379 00000 n 
-0000990787 00000 n 
-0000003983 00000 n 
-0000004401 00000 n 
-0000204665 00000 n 
-0000990700 00000 n 
-0000004453 00000 n 
-0000004826 00000 n 
-0000207935 00000 n 
-0000990613 00000 n 
-0000004878 00000 n 
-0000005211 00000 n 
-0000208344 00000 n 
-0000990526 00000 n 
-0000005263 00000 n 
-0000005565 00000 n 
-0000228391 00000 n 
-0000990439 00000 n 
-0000005617 00000 n 
-0000005911 00000 n 
-0000233528 00000 n 
-0000990350 00000 n 
-0000005963 00000 n 
-0000006281 00000 n 
-0000239625 00000 n 
-0000990259 00000 n 
-0000006335 00000 n 
-0000006625 00000 n 
-0000240330 00000 n 
-0000990167 00000 n 
-0000006679 00000 n 
-0000007007 00000 n 
-0000246756 00000 n 
-0000990075 00000 n 
-0000007061 00000 n 
-0000007351 00000 n 
-0000250639 00000 n 
-0000989983 00000 n 
-0000007405 00000 n 
-0000007733 00000 n 
-0000251050 00000 n 
-0000989891 00000 n 
-0000007787 00000 n 
-0000008138 00000 n 
-0000251342 00000 n 
-0000989799 00000 n 
-0000008192 00000 n 
-0000008548 00000 n 
-0000255037 00000 n 
-0000989707 00000 n 
-0000008602 00000 n 
-0000008930 00000 n 
-0000255330 00000 n 
-0000989615 00000 n 
-0000008984 00000 n 
-0000009340 00000 n 
-0000262670 00000 n 
-0000989523 00000 n 
-0000009394 00000 n 
-0000009679 00000 n 
-0000266993 00000 n 
-0000989431 00000 n 
-0000009733 00000 n 
-0000010056 00000 n 
-0000272265 00000 n 
-0000989339 00000 n 
-0000010110 00000 n 
-0000010418 00000 n 
-0000272676 00000 n 
-0000989247 00000 n 
-0000010472 00000 n 
-0000010785 00000 n 
-0000283507 00000 n 
-0000989155 00000 n 
-0000010839 00000 n 
-0000011190 00000 n 
-0000283918 00000 n 
-0000989063 00000 n 
-0000011244 00000 n 
-0000011580 00000 n 
-0000286822 00000 n 
-0000988971 00000 n 
-0000011634 00000 n 
-0000012010 00000 n 
-0000287115 00000 n 
-0000988879 00000 n 
-0000012064 00000 n 
-0000012314 00000 n 
-0000289837 00000 n 
-0000988787 00000 n 
-0000012368 00000 n 
-0000012724 00000 n 
-0000290128 00000 n 
-0000988695 00000 n 
-0000012778 00000 n 
-0000013106 00000 n 
-0000310635 00000 n 
-0000988603 00000 n 
-0000013160 00000 n 
-0000013551 00000 n 
-0000319776 00000 n 
-0000988511 00000 n 
-0000013605 00000 n 
-0000013991 00000 n 
-0000328930 00000 n 
-0000988419 00000 n 
-0000014045 00000 n 
-0000014396 00000 n 
-0000338753 00000 n 
-0000988327 00000 n 
-0000014450 00000 n 
-0000014811 00000 n 
-0000347439 00000 n 
-0000988235 00000 n 
-0000014865 00000 n 
-0000015259 00000 n 
-0000354821 00000 n 
-0000988143 00000 n 
-0000015313 00000 n 
-0000015689 00000 n 
-0000355232 00000 n 
-0000988051 00000 n 
-0000015743 00000 n 
-0000016094 00000 n 
-0000361909 00000 n 
-0000987959 00000 n 
-0000016148 00000 n 
-0000016446 00000 n 
-0000395931 00000 n 
-0000987867 00000 n 
-0000016500 00000 n 
-0000016831 00000 n 
-0000398660 00000 n 
-0000987775 00000 n 
-0000016885 00000 n 
-0000017208 00000 n 
-0000398953 00000 n 
-0000987683 00000 n 
-0000017262 00000 n 
-0000017628 00000 n 
-0000399246 00000 n 
-0000987591 00000 n 
-0000017682 00000 n 
-0000017991 00000 n 
-0000404552 00000 n 
-0000987499 00000 n 
-0000018045 00000 n 
-0000018406 00000 n 
-0000421947 00000 n 
-0000987407 00000 n 
-0000018460 00000 n 
-0000018783 00000 n 
-0000429322 00000 n 
-0000987315 00000 n 
-0000018837 00000 n 
-0000019168 00000 n 
-0000437650 00000 n 
-0000987223 00000 n 
-0000019222 00000 n 
-0000019520 00000 n 
-0000459662 00000 n 
-0000987131 00000 n 
-0000019574 00000 n 
-0000019991 00000 n 
-0000460011 00000 n 
-0000987039 00000 n 
-0000020045 00000 n 
-0000020467 00000 n 
-0000464042 00000 n 
-0000986947 00000 n 
-0000020521 00000 n 
-0000020852 00000 n 
-0000464335 00000 n 
-0000986855 00000 n 
-0000020906 00000 n 
-0000021237 00000 n 
-0000471381 00000 n 
-0000986763 00000 n 
-0000021291 00000 n 
-0000021602 00000 n 
-0000489687 00000 n 
-0000986671 00000 n 
-0000021656 00000 n 
-0000022055 00000 n 
-0000496294 00000 n 
-0000986579 00000 n 
-0000022109 00000 n 
-0000022556 00000 n 
-0000502977 00000 n 
-0000986487 00000 n 
-0000022610 00000 n 
-0000022941 00000 n 
-0000507077 00000 n 
-0000986395 00000 n 
-0000022995 00000 n 
-0000023326 00000 n 
-0000507606 00000 n 
-0000986303 00000 n 
-0000023380 00000 n 
-0000023670 00000 n 
-0000650324 00000 n 
-0000986211 00000 n 
-0000023724 00000 n 
-0000024037 00000 n 
-0000650794 00000 n 
-0000986119 00000 n 
-0000024091 00000 n 
-0000024419 00000 n 
-0000654695 00000 n 
-0000986027 00000 n 
-0000024473 00000 n 
-0000024753 00000 n 
-0000655282 00000 n 
-0000985949 00000 n 
-0000024807 00000 n 
-0000025115 00000 n 
-0000026518 00000 n 
-0000026637 00000 n 
-0000029975 00000 n 
-0000025167 00000 n 
-0000029862 00000 n 
-0000029918 00000 n 
-0000982321 00000 n 
-0000980596 00000 n 
-0000981028 00000 n 
-0000980740 00000 n 
-0000982853 00000 n 
-0000983209 00000 n 
-0000029631 00000 n 
-0000029815 00000 n 
-0000030402 00000 n 
-0000030227 00000 n 
-0000030127 00000 n 
-0000030346 00000 n 
-0000037448 00000 n 
-0000037614 00000 n 
-0000037766 00000 n 
-0000037932 00000 n 
-0000038230 00000 n 
-0000032269 00000 n 
-0000038410 00000 n 
-0000034472 00000 n 
-0000038630 00000 n 
-0000032082 00000 n 
-0000030443 00000 n 
-0000038574 00000 n 
-0000982495 00000 n 
-0000038082 00000 n 
-0000981610 00000 n 
-0000034241 00000 n 
-0000034425 00000 n 
-0000037217 00000 n 
-0000037401 00000 n 
-0000097539 00000 n 
-0000062652 00000 n 
-0000039044 00000 n 
-0000038869 00000 n 
-0000038769 00000 n 
-0000038988 00000 n 
-0000041116 00000 n 
-0000041267 00000 n 
-0000041417 00000 n 
-0000041568 00000 n 
-0000041719 00000 n 
-0000041876 00000 n 
-0000042026 00000 n 
-0000042181 00000 n 
-0000042332 00000 n 
-0000042489 00000 n 
-0000042640 00000 n 
-0000042797 00000 n 
-0000042948 00000 n 
-0000043105 00000 n 
-0000043255 00000 n 
-0000043412 00000 n 
-0000043563 00000 n 
-0000043721 00000 n 
-0000043878 00000 n 
-0000044035 00000 n 
-0000044193 00000 n 
-0000044351 00000 n 
-0000044509 00000 n 
-0000044667 00000 n 
-0000044825 00000 n 
-0000044983 00000 n 
-0000045142 00000 n 
-0000045301 00000 n 
-0000045460 00000 n 
-0000045619 00000 n 
-0000045778 00000 n 
-0000045937 00000 n 
-0000046096 00000 n 
-0000046255 00000 n 
-0000046414 00000 n 
-0000046573 00000 n 
-0000046732 00000 n 
-0000046890 00000 n 
-0000047049 00000 n 
-0000047207 00000 n 
-0000047366 00000 n 
-0000047525 00000 n 
-0000047683 00000 n 
-0000047840 00000 n 
-0000049943 00000 n 
-0000047996 00000 n 
-0000048216 00000 n 
-0000040625 00000 n 
-0000039085 00000 n 
-0000048160 00000 n 
-0000979284 00000 n 
-0000050102 00000 n 
-0000050261 00000 n 
-0000050420 00000 n 
-0000050579 00000 n 
-0000050737 00000 n 
-0000050896 00000 n 
-0000051054 00000 n 
-0000051213 00000 n 
-0000051371 00000 n 
-0000051529 00000 n 
-0000051688 00000 n 
-0000051846 00000 n 
-0000052005 00000 n 
-0000052163 00000 n 
-0000052322 00000 n 
-0000052480 00000 n 
-0000052639 00000 n 
-0000052798 00000 n 
-0000052957 00000 n 
-0000053116 00000 n 
-0000053275 00000 n 
-0000053434 00000 n 
-0000053593 00000 n 
-0000053752 00000 n 
-0000053911 00000 n 
-0000054070 00000 n 
-0000054229 00000 n 
-0000054388 00000 n 
-0000054547 00000 n 
-0000054765 00000 n 
-0000049572 00000 n 
-0000048355 00000 n 
-0000054709 00000 n 
-0000058125 00000 n 
-0000058327 00000 n 
-0000058660 00000 n 
-0000057978 00000 n 
-0000054904 00000 n 
-0000981962 00000 n 
-0000058546 00000 n 
-0000983029 00000 n 
-0000058603 00000 n 
-0000983327 00000 n 
-0000404494 00000 n 
-0000062216 00000 n 
-0000062378 00000 n 
-0000062765 00000 n 
-0000062069 00000 n 
-0000058812 00000 n 
-0000980016 00000 n 
-0000062595 00000 n 
-0000062709 00000 n 
-0000066330 00000 n 
-0000066664 00000 n 
-0000066191 00000 n 
-0000062955 00000 n 
-0000066494 00000 n 
-0000066551 00000 n 
-0000066607 00000 n 
-0000070268 00000 n 
-0000070601 00000 n 
-0000070129 00000 n 
-0000066803 00000 n 
-0000070430 00000 n 
-0000070487 00000 n 
-0000070544 00000 n 
-0000073857 00000 n 
-0000074191 00000 n 
-0000073718 00000 n 
-0000070740 00000 n 
-0000074021 00000 n 
-0000074077 00000 n 
-0000074134 00000 n 
-0000078059 00000 n 
-0000078334 00000 n 
-0000077920 00000 n 
-0000074330 00000 n 
-0000078221 00000 n 
-0000078277 00000 n 
-0000081827 00000 n 
-0000082104 00000 n 
-0000081688 00000 n 
-0000078473 00000 n 
-0000081991 00000 n 
-0000082047 00000 n 
-0000983445 00000 n 
-0000085598 00000 n 
-0000085987 00000 n 
-0000085459 00000 n 
-0000082243 00000 n 
-0000085760 00000 n 
-0000085816 00000 n 
-0000085873 00000 n 
-0000085930 00000 n 
-0000089705 00000 n 
-0000090096 00000 n 
-0000089566 00000 n 
-0000086126 00000 n 
-0000089869 00000 n 
-0000089925 00000 n 
-0000089982 00000 n 
-0000090039 00000 n 
-0000093364 00000 n 
-0000093810 00000 n 
-0000093225 00000 n 
-0000090235 00000 n 
-0000093526 00000 n 
-0000093582 00000 n 
-0000093639 00000 n 
-0000093696 00000 n 
-0000093753 00000 n 
-0000096659 00000 n 
-0000096835 00000 n 
-0000097011 00000 n 
-0000097206 00000 n 
-0000097596 00000 n 
-0000096496 00000 n 
-0000093949 00000 n 
-0000097370 00000 n 
-0000981784 00000 n 
-0000097482 00000 n 
-0000101508 00000 n 
-0000101726 00000 n 
-0000101369 00000 n 
-0000097748 00000 n 
-0000101670 00000 n 
-0000105639 00000 n 
-0000105859 00000 n 
-0000105500 00000 n 
-0000101852 00000 n 
-0000105803 00000 n 
-0000983563 00000 n 
-0000109231 00000 n 
-0000109449 00000 n 
-0000109092 00000 n 
-0000105985 00000 n 
-0000109393 00000 n 
-0000113198 00000 n 
-0000113418 00000 n 
-0000113059 00000 n 
-0000109575 00000 n 
-0000113362 00000 n 
-0000116349 00000 n 
-0000116525 00000 n 
-0000116911 00000 n 
-0000116202 00000 n 
-0000113544 00000 n 
-0000116687 00000 n 
-0000116743 00000 n 
-0000118522 00000 n 
-0000118679 00000 n 
-0000118856 00000 n 
-0000119013 00000 n 
-0000119170 00000 n 
-0000119328 00000 n 
-0000119486 00000 n 
-0000119644 00000 n 
-0000119802 00000 n 
-0000119958 00000 n 
-0000120116 00000 n 
-0000120274 00000 n 
-0000120433 00000 n 
-0000120592 00000 n 
-0000120751 00000 n 
-0000120910 00000 n 
-0000121069 00000 n 
-0000121228 00000 n 
-0000121386 00000 n 
-0000123565 00000 n 
-0000121543 00000 n 
-0000121986 00000 n 
-0000118231 00000 n 
-0000117050 00000 n 
-0000121707 00000 n 
-0000180853 00000 n 
-0000123724 00000 n 
-0000123883 00000 n 
-0000124038 00000 n 
-0000124197 00000 n 
-0000124356 00000 n 
-0000124515 00000 n 
-0000124674 00000 n 
-0000124832 00000 n 
-0000124991 00000 n 
-0000125149 00000 n 
-0000125308 00000 n 
-0000125467 00000 n 
-0000125626 00000 n 
-0000125785 00000 n 
-0000125943 00000 n 
-0000126102 00000 n 
-0000126261 00000 n 
-0000126420 00000 n 
-0000126579 00000 n 
-0000126738 00000 n 
-0000126896 00000 n 
-0000127054 00000 n 
-0000127213 00000 n 
-0000127372 00000 n 
-0000127531 00000 n 
-0000127690 00000 n 
-0000127849 00000 n 
-0000128007 00000 n 
-0000130183 00000 n 
-0000128164 00000 n 
-0000128382 00000 n 
-0000123194 00000 n 
-0000122138 00000 n 
-0000128326 00000 n 
-0000130342 00000 n 
-0000130501 00000 n 
-0000130660 00000 n 
-0000130817 00000 n 
-0000130975 00000 n 
-0000131134 00000 n 
-0000131293 00000 n 
-0000131451 00000 n 
-0000131610 00000 n 
-0000131768 00000 n 
-0000131927 00000 n 
-0000132086 00000 n 
-0000132283 00000 n 
-0000132440 00000 n 
-0000132647 00000 n 
-0000132805 00000 n 
-0000133013 00000 n 
-0000133171 00000 n 
-0000133385 00000 n 
-0000133543 00000 n 
-0000133747 00000 n 
-0000133905 00000 n 
-0000134106 00000 n 
-0000134264 00000 n 
-0000134454 00000 n 
-0000134612 00000 n 
-0000134800 00000 n 
-0000134958 00000 n 
-0000135149 00000 n 
-0000137379 00000 n 
-0000137566 00000 n 
-0000135305 00000 n 
-0000135637 00000 n 
-0000129804 00000 n 
-0000128521 00000 n 
-0000135469 00000 n 
-0000983681 00000 n 
-0000194512 00000 n 
-0000200404 00000 n 
-0000200688 00000 n 
-0000204322 00000 n 
-0000204608 00000 n 
-0000207877 00000 n 
-0000208287 00000 n 
-0000228333 00000 n 
-0000233470 00000 n 
-0000137725 00000 n 
-0000137920 00000 n 
-0000138079 00000 n 
-0000138266 00000 n 
-0000138424 00000 n 
-0000138619 00000 n 
-0000138778 00000 n 
-0000138977 00000 n 
-0000139135 00000 n 
-0000139336 00000 n 
-0000139495 00000 n 
-0000139690 00000 n 
-0000139848 00000 n 
-0000140049 00000 n 
-0000140208 00000 n 
-0000140394 00000 n 
-0000140553 00000 n 
-0000140747 00000 n 
-0000140906 00000 n 
-0000141097 00000 n 
-0000141256 00000 n 
-0000141448 00000 n 
-0000141607 00000 n 
-0000141807 00000 n 
-0000141966 00000 n 
-0000142163 00000 n 
-0000142322 00000 n 
-0000142526 00000 n 
-0000142685 00000 n 
-0000142863 00000 n 
-0000143022 00000 n 
-0000143222 00000 n 
-0000143381 00000 n 
-0000143575 00000 n 
-0000143734 00000 n 
-0000143939 00000 n 
-0000146207 00000 n 
-0000146414 00000 n 
-0000144096 00000 n 
-0000144314 00000 n 
-0000136936 00000 n 
-0000135789 00000 n 
-0000144258 00000 n 
-0000239567 00000 n 
-0000240272 00000 n 
-0000246698 00000 n 
-0000250581 00000 n 
-0000250992 00000 n 
-0000251284 00000 n 
-0000254979 00000 n 
-0000255272 00000 n 
-0000255565 00000 n 
-0000266935 00000 n 
-0000272207 00000 n 
-0000272618 00000 n 
-0000283449 00000 n 
-0000283860 00000 n 
-0000286764 00000 n 
-0000287057 00000 n 
-0000289779 00000 n 
-0000290070 00000 n 
-0000310577 00000 n 
-0000146573 00000 n 
-0000146771 00000 n 
-0000146930 00000 n 
-0000147131 00000 n 
-0000147290 00000 n 
-0000147496 00000 n 
-0000147655 00000 n 
-0000147860 00000 n 
-0000148019 00000 n 
-0000148219 00000 n 
-0000148378 00000 n 
-0000148567 00000 n 
-0000148726 00000 n 
-0000148922 00000 n 
-0000149111 00000 n 
-0000149270 00000 n 
-0000149464 00000 n 
-0000149623 00000 n 
-0000149826 00000 n 
-0000149985 00000 n 
-0000150183 00000 n 
-0000150341 00000 n 
-0000150543 00000 n 
-0000150701 00000 n 
-0000150895 00000 n 
-0000151054 00000 n 
-0000151250 00000 n 
-0000151409 00000 n 
-0000151598 00000 n 
-0000151757 00000 n 
-0000151971 00000 n 
-0000152130 00000 n 
-0000152345 00000 n 
-0000152504 00000 n 
-0000152699 00000 n 
-0000152887 00000 n 
-0000153046 00000 n 
-0000153238 00000 n 
-0000155577 00000 n 
-0000155769 00000 n 
-0000153394 00000 n 
-0000153614 00000 n 
-0000145748 00000 n 
-0000144440 00000 n 
-0000153558 00000 n 
-0000319718 00000 n 
-0000328872 00000 n 
-0000338695 00000 n 
-0000347381 00000 n 
-0000354763 00000 n 
-0000355174 00000 n 
-0000361851 00000 n 
-0000395873 00000 n 
-0000398602 00000 n 
-0000398895 00000 n 
-0000399188 00000 n 
-0000421889 00000 n 
-0000429264 00000 n 
-0000429557 00000 n 
-0000459604 00000 n 
-0000459954 00000 n 
-0000463985 00000 n 
-0000464277 00000 n 
-0000155928 00000 n 
-0000156138 00000 n 
-0000156326 00000 n 
-0000156484 00000 n 
-0000156701 00000 n 
-0000156910 00000 n 
-0000157069 00000 n 
-0000157265 00000 n 
-0000157424 00000 n 
-0000157620 00000 n 
-0000157779 00000 n 
-0000157966 00000 n 
-0000158124 00000 n 
-0000158315 00000 n 
-0000158473 00000 n 
-0000158667 00000 n 
-0000158826 00000 n 
-0000159011 00000 n 
-0000159170 00000 n 
-0000159361 00000 n 
-0000159520 00000 n 
-0000159695 00000 n 
-0000159903 00000 n 
-0000160111 00000 n 
-0000160325 00000 n 
-0000160528 00000 n 
-0000163015 00000 n 
-0000160728 00000 n 
-0000161227 00000 n 
-0000155214 00000 n 
-0000153753 00000 n 
-0000160890 00000 n 
-0000161001 00000 n 
-0000161114 00000 n 
-0000161171 00000 n 
-0000471323 00000 n 
-0000489629 00000 n 
-0000496236 00000 n 
-0000502919 00000 n 
-0000507019 00000 n 
-0000507548 00000 n 
-0000650266 00000 n 
-0000650736 00000 n 
-0000654637 00000 n 
-0000655225 00000 n 
-0000163203 00000 n 
-0000163396 00000 n 
-0000163582 00000 n 
-0000163777 00000 n 
-0000163963 00000 n 
-0000164158 00000 n 
-0000164357 00000 n 
-0000164557 00000 n 
-0000164752 00000 n 
-0000164953 00000 n 
-0000165138 00000 n 
-0000165328 00000 n 
-0000165538 00000 n 
-0000165727 00000 n 
-0000165947 00000 n 
-0000166156 00000 n 
-0000166342 00000 n 
-0000166536 00000 n 
-0000166727 00000 n 
-0000166919 00000 n 
-0000167119 00000 n 
-0000167316 00000 n 
-0000167521 00000 n 
-0000167699 00000 n 
-0000169935 00000 n 
-0000170129 00000 n 
-0000167899 00000 n 
-0000168119 00000 n 
-0000162676 00000 n 
-0000161392 00000 n 
-0000168063 00000 n 
-0000170337 00000 n 
-0000170543 00000 n 
-0000170743 00000 n 
-0000170944 00000 n 
-0000171153 00000 n 
-0000171358 00000 n 
-0000171557 00000 n 
-0000171746 00000 n 
-0000171941 00000 n 
-0000172130 00000 n 
-0000172324 00000 n 
-0000172527 00000 n 
-0000172726 00000 n 
-0000172928 00000 n 
-0000173122 00000 n 
-0000173311 00000 n 
-0000173525 00000 n 
-0000173740 00000 n 
-0000173936 00000 n 
-0000174125 00000 n 
-0000174321 00000 n 
-0000174513 00000 n 
-0000174707 00000 n 
-0000174891 00000 n 
-0000175109 00000 n 
-0000169596 00000 n 
-0000168258 00000 n 
-0000175053 00000 n 
-0000176977 00000 n 
-0000177174 00000 n 
-0000177382 00000 n 
-0000177589 00000 n 
-0000177803 00000 n 
-0000178008 00000 n 
-0000178209 00000 n 
-0000178397 00000 n 
-0000178590 00000 n 
-0000178775 00000 n 
-0000178969 00000 n 
-0000179156 00000 n 
-0000179351 00000 n 
-0000179551 00000 n 
-0000179751 00000 n 
-0000179946 00000 n 
-0000180146 00000 n 
-0000180332 00000 n 
-0000182837 00000 n 
-0000183047 00000 n 
-0000180520 00000 n 
-0000181023 00000 n 
-0000176694 00000 n 
-0000175261 00000 n 
-0000180684 00000 n 
-0000180740 00000 n 
-0000180966 00000 n 
-0000983799 00000 n 
-0000183235 00000 n 
-0000183454 00000 n 
-0000183662 00000 n 
-0000183848 00000 n 
-0000184042 00000 n 
-0000184233 00000 n 
-0000184423 00000 n 
-0000184623 00000 n 
-0000184820 00000 n 
-0000185025 00000 n 
-0000185203 00000 n 
-0000185404 00000 n 
-0000185599 00000 n 
-0000185807 00000 n 
-0000186013 00000 n 
-0000186211 00000 n 
-0000186413 00000 n 
-0000186622 00000 n 
-0000186826 00000 n 
-0000187026 00000 n 
-0000187215 00000 n 
-0000187410 00000 n 
-0000187599 00000 n 
-0000187793 00000 n 
-0000190238 00000 n 
-0000190437 00000 n 
-0000187994 00000 n 
-0000188212 00000 n 
-0000182490 00000 n 
-0000181188 00000 n 
-0000188156 00000 n 
-0000190639 00000 n 
-0000190833 00000 n 
-0000191029 00000 n 
-0000191218 00000 n 
-0000191432 00000 n 
-0000191647 00000 n 
-0000191842 00000 n 
-0000192031 00000 n 
-0000192226 00000 n 
-0000192418 00000 n 
-0000192614 00000 n 
-0000192809 00000 n 
-0000193000 00000 n 
-0000193195 00000 n 
-0000193380 00000 n 
-0000193571 00000 n 
-0000193800 00000 n 
-0000193993 00000 n 
-0000197193 00000 n 
-0000197386 00000 n 
-0000194179 00000 n 
-0000194737 00000 n 
-0000189939 00000 n 
-0000188351 00000 n 
-0000194343 00000 n 
-0000194399 00000 n 
-0000194625 00000 n 
-0000194681 00000 n 
-0000197618 00000 n 
-0000197805 00000 n 
-0000198037 00000 n 
-0000198266 00000 n 
-0000198496 00000 n 
-0000198694 00000 n 
-0000198888 00000 n 
-0000199076 00000 n 
-0000199265 00000 n 
-0000199453 00000 n 
-0000199694 00000 n 
-0000199901 00000 n 
-0000200744 00000 n 
-0000196950 00000 n 
-0000194902 00000 n 
-0000200063 00000 n 
-0000200119 00000 n 
-0000200176 00000 n 
-0000200233 00000 n 
-0000200290 00000 n 
-0000200347 00000 n 
-0000200517 00000 n 
-0000200574 00000 n 
-0000200631 00000 n 
-0000202380 00000 n 
-0000202620 00000 n 
-0000202861 00000 n 
-0000203107 00000 n 
-0000203345 00000 n 
-0000203583 00000 n 
-0000206593 00000 n 
-0000203820 00000 n 
-0000204951 00000 n 
-0000202193 00000 n 
-0000200909 00000 n 
-0000203984 00000 n 
-0000204096 00000 n 
-0000204152 00000 n 
-0000204208 00000 n 
-0000204265 00000 n 
-0000204435 00000 n 
-0000204492 00000 n 
-0000204550 00000 n 
-0000204721 00000 n 
-0000204779 00000 n 
-0000204837 00000 n 
-0000204894 00000 n 
-0000206831 00000 n 
-0000207066 00000 n 
-0000207302 00000 n 
-0000210705 00000 n 
-0000214100 00000 n 
-0000207538 00000 n 
-0000208401 00000 n 
-0000206415 00000 n 
-0000205104 00000 n 
-0000207701 00000 n 
-0000207759 00000 n 
-0000207818 00000 n 
-0000979430 00000 n 
-0000207992 00000 n 
-0000208051 00000 n 
-0000208110 00000 n 
-0000208169 00000 n 
-0000208228 00000 n 
-0000214168 00000 n 
-0000214393 00000 n 
-0000214589 00000 n 
-0000214814 00000 n 
-0000215005 00000 n 
-0000215230 00000 n 
-0000215421 00000 n 
-0000215615 00000 n 
-0000215838 00000 n 
-0000216032 00000 n 
-0000216257 00000 n 
-0000216453 00000 n 
-0000216677 00000 n 
-0000216902 00000 n 
-0000217127 00000 n 
-0000217321 00000 n 
-0000217546 00000 n 
-0000220811 00000 n 
-0000221036 00000 n 
-0000217740 00000 n 
-0000218199 00000 n 
-0000210392 00000 n 
-0000208581 00000 n 
-0000217905 00000 n 
-0000217963 00000 n 
-0000218022 00000 n 
-0000218081 00000 n 
-0000982671 00000 n 
-0000218140 00000 n 
-0000983918 00000 n 
-0000211456 00000 n 
-0000211587 00000 n 
-0000211737 00000 n 
-0000212005 00000 n 
-0000212384 00000 n 
-0000212622 00000 n 
-0000212644 00000 n 
-0000214077 00000 n 
-0000222762 00000 n 
-0000222880 00000 n 
-0000222998 00000 n 
-0000223119 00000 n 
-0000223240 00000 n 
-0000223363 00000 n 
-0000221227 00000 n 
-0000221417 00000 n 
-0000221641 00000 n 
-0000221831 00000 n 
-0000222021 00000 n 
-0000222246 00000 n 
-0000223426 00000 n 
-0000220604 00000 n 
-0000218393 00000 n 
-0000222409 00000 n 
-0000222467 00000 n 
-0000222526 00000 n 
-0000222585 00000 n 
-0000222644 00000 n 
-0000222703 00000 n 
-0000222821 00000 n 
-0000982139 00000 n 
-0000222939 00000 n 
-0000223061 00000 n 
-0000223182 00000 n 
-0000223304 00000 n 
-0000228038 00000 n 
-0000228215 00000 n 
-0000226401 00000 n 
-0000226811 00000 n 
-0000227033 00000 n 
-0000227255 00000 n 
-0000227477 00000 n 
-0000230938 00000 n 
-0000231160 00000 n 
-0000231348 00000 n 
-0000227697 00000 n 
-0000228684 00000 n 
-0000226203 00000 n 
-0000223619 00000 n 
-0000227862 00000 n 
-0000227920 00000 n 
-0000227979 00000 n 
-0000228097 00000 n 
-0000228156 00000 n 
-0000226607 00000 n 
-0000228274 00000 n 
-0000228448 00000 n 
-0000228507 00000 n 
-0000228566 00000 n 
-0000228625 00000 n 
-0000233293 00000 n 
-0000231571 00000 n 
-0000231793 00000 n 
-0000232016 00000 n 
-0000232205 00000 n 
-0000232432 00000 n 
-0000232659 00000 n 
-0000233821 00000 n 
-0000230722 00000 n 
-0000228877 00000 n 
-0000232822 00000 n 
-0000232880 00000 n 
-0000232939 00000 n 
-0000232998 00000 n 
-0000233057 00000 n 
-0000233116 00000 n 
-0000233175 00000 n 
-0000233234 00000 n 
-0000233352 00000 n 
-0000233411 00000 n 
-0000233585 00000 n 
-0000233644 00000 n 
-0000233703 00000 n 
-0000233762 00000 n 
-0000236271 00000 n 
-0000236492 00000 n 
-0000236688 00000 n 
-0000236884 00000 n 
-0000237073 00000 n 
-0000237266 00000 n 
-0000237486 00000 n 
-0000237679 00000 n 
-0000237900 00000 n 
-0000238088 00000 n 
-0000238310 00000 n 
-0000238529 00000 n 
-0000238749 00000 n 
-0000238937 00000 n 
-0000239159 00000 n 
-0000242441 00000 n 
-0000239344 00000 n 
-0000240388 00000 n 
-0000235992 00000 n 
-0000234001 00000 n 
-0000239509 00000 n 
-0000239683 00000 n 
-0000239742 00000 n 
-0000981318 00000 n 
-0000980451 00000 n 
-0000239801 00000 n 
-0000239860 00000 n 
-0000239919 00000 n 
-0000239978 00000 n 
-0000240037 00000 n 
-0000240096 00000 n 
-0000240155 00000 n 
-0000240214 00000 n 
-0000979138 00000 n 
-0000979723 00000 n 
-0000980884 00000 n 
-0000980306 00000 n 
-0000242669 00000 n 
-0000242896 00000 n 
-0000243124 00000 n 
-0000243319 00000 n 
-0000243507 00000 n 
-0000243728 00000 n 
-0000243924 00000 n 
-0000244117 00000 n 
-0000244313 00000 n 
-0000244507 00000 n 
-0000244728 00000 n 
-0000244921 00000 n 
-0000245142 00000 n 
-0000245334 00000 n 
-0000245556 00000 n 
-0000245775 00000 n 
-0000245995 00000 n 
-0000246182 00000 n 
-0000247282 00000 n 
-0000242135 00000 n 
-0000240676 00000 n 
-0000246345 00000 n 
-0000246403 00000 n 
-0000246462 00000 n 
-0000246521 00000 n 
-0000246580 00000 n 
-0000246639 00000 n 
-0000246814 00000 n 
-0000246872 00000 n 
-0000246930 00000 n 
-0000246989 00000 n 
-0000247048 00000 n 
-0000247107 00000 n 
-0000247166 00000 n 
-0000247223 00000 n 
-0000249060 00000 n 
-0000249289 00000 n 
-0000249516 00000 n 
-0000249744 00000 n 
-0000249939 00000 n 
-0000250125 00000 n 
-0000253107 00000 n 
-0000250358 00000 n 
-0000251400 00000 n 
-0000248862 00000 n 
-0000247448 00000 n 
-0000250523 00000 n 
-0000250697 00000 n 
-0000250756 00000 n 
-0000250815 00000 n 
-0000250874 00000 n 
-0000250933 00000 n 
-0000251108 00000 n 
-0000251167 00000 n 
-0000251226 00000 n 
-0000984043 00000 n 
-0000253341 00000 n 
-0000253576 00000 n 
-0000253765 00000 n 
-0000253999 00000 n 
-0000254228 00000 n 
-0000254463 00000 n 
-0000255622 00000 n 
-0000252909 00000 n 
-0000251566 00000 n 
-0000254626 00000 n 
-0000254684 00000 n 
-0000254743 00000 n 
-0000254802 00000 n 
-0000254861 00000 n 
-0000254920 00000 n 
-0000255095 00000 n 
-0000255154 00000 n 
-0000255213 00000 n 
-0000255388 00000 n 
-0000255447 00000 n 
-0000255506 00000 n 
-0000257797 00000 n 
-0000257988 00000 n 
-0000258209 00000 n 
-0000258402 00000 n 
-0000258622 00000 n 
-0000258810 00000 n 
-0000259031 00000 n 
-0000259249 00000 n 
-0000259468 00000 n 
-0000259655 00000 n 
-0000259876 00000 n 
-0000260072 00000 n 
-0000260261 00000 n 
-0000260448 00000 n 
-0000260669 00000 n 
-0000260865 00000 n 
-0000261052 00000 n 
-0000261273 00000 n 
-0000261469 00000 n 
-0000261658 00000 n 
-0000261845 00000 n 
-0000262066 00000 n 
-0000262262 00000 n 
-0000262447 00000 n 
-0000263375 00000 n 
-0000257446 00000 n 
-0000255775 00000 n 
-0000262612 00000 n 
-0000262728 00000 n 
-0000262787 00000 n 
-0000262846 00000 n 
-0000262905 00000 n 
-0000262963 00000 n 
-0000263022 00000 n 
-0000263081 00000 n 
-0000263140 00000 n 
-0000263199 00000 n 
-0000263258 00000 n 
-0000263317 00000 n 
-0000266758 00000 n 
-0000266229 00000 n 
-0000266405 00000 n 
-0000266581 00000 n 
-0000265781 00000 n 
-0000269044 00000 n 
-0000266008 00000 n 
-0000267169 00000 n 
-0000265628 00000 n 
-0000263555 00000 n 
-0000266171 00000 n 
-0000266288 00000 n 
-0000266347 00000 n 
-0000266463 00000 n 
-0000266522 00000 n 
-0000266640 00000 n 
-0000266699 00000 n 
-0000266817 00000 n 
-0000266876 00000 n 
-0000267051 00000 n 
-0000267110 00000 n 
-0000269270 00000 n 
-0000269497 00000 n 
-0000269691 00000 n 
-0000269877 00000 n 
-0000270102 00000 n 
-0000270326 00000 n 
-0000270551 00000 n 
-0000270748 00000 n 
-0000270975 00000 n 
-0000271169 00000 n 
-0000271396 00000 n 
-0000271582 00000 n 
-0000275369 00000 n 
-0000271807 00000 n 
-0000272911 00000 n 
-0000268783 00000 n 
-0000267336 00000 n 
-0000271972 00000 n 
-0000272030 00000 n 
-0000272089 00000 n 
-0000272148 00000 n 
-0000272323 00000 n 
-0000272382 00000 n 
-0000272441 00000 n 
-0000272500 00000 n 
-0000272559 00000 n 
-0000272734 00000 n 
-0000272793 00000 n 
-0000272852 00000 n 
-0000283272 00000 n 
-0000275592 00000 n 
-0000275816 00000 n 
-0000276009 00000 n 
-0000276236 00000 n 
-0000276432 00000 n 
-0000276625 00000 n 
-0000276852 00000 n 
-0000277048 00000 n 
-0000277237 00000 n 
-0000277429 00000 n 
-0000277655 00000 n 
-0000277850 00000 n 
-0000278037 00000 n 
-0000278229 00000 n 
-0000279215 00000 n 
-0000275099 00000 n 
-0000273077 00000 n 
-0000278392 00000 n 
-0000278450 00000 n 
-0000278509 00000 n 
-0000278567 00000 n 
-0000278626 00000 n 
-0000278685 00000 n 
-0000278744 00000 n 
-0000278803 00000 n 
-0000278862 00000 n 
-0000278921 00000 n 
-0000278980 00000 n 
-0000279039 00000 n 
-0000279098 00000 n 
-0000279157 00000 n 
-0000281437 00000 n 
-0000281671 00000 n 
-0000281903 00000 n 
-0000282136 00000 n 
-0000282336 00000 n 
-0000282529 00000 n 
-0000282760 00000 n 
-0000282990 00000 n 
-0000284152 00000 n 
-0000281230 00000 n 
-0000279395 00000 n 
-0000283155 00000 n 
-0000283213 00000 n 
-0000283331 00000 n 
-0000283390 00000 n 
-0000283565 00000 n 
-0000283624 00000 n 
-0000283683 00000 n 
-0000283742 00000 n 
-0000283801 00000 n 
-0000283975 00000 n 
-0000284034 00000 n 
-0000284093 00000 n 
-0000984168 00000 n 
-0000286031 00000 n 
-0000286270 00000 n 
-0000286484 00000 n 
-0000287466 00000 n 
-0000285869 00000 n 
-0000284318 00000 n 
-0000286647 00000 n 
-0000286705 00000 n 
-0000286880 00000 n 
-0000286939 00000 n 
-0000286998 00000 n 
-0000287173 00000 n 
-0000287230 00000 n 
-0000287289 00000 n 
-0000287348 00000 n 
-0000287407 00000 n 
-0000289262 00000 n 
-0000291847 00000 n 
-0000296858 00000 n 
-0000289497 00000 n 
-0000290186 00000 n 
-0000289109 00000 n 
-0000287634 00000 n 
-0000289662 00000 n 
-0000289720 00000 n 
-0000289895 00000 n 
-0000289953 00000 n 
-0000290011 00000 n 
-0000296926 00000 n 
-0000297120 00000 n 
-0000297350 00000 n 
-0000297546 00000 n 
-0000297740 00000 n 
-0000297970 00000 n 
-0000298166 00000 n 
-0000298360 00000 n 
-0000298590 00000 n 
-0000298779 00000 n 
-0000298973 00000 n 
-0000299203 00000 n 
-0000299399 00000 n 
-0000299629 00000 n 
-0000299856 00000 n 
-0000300083 00000 n 
-0000300313 00000 n 
-0000300542 00000 n 
-0000301352 00000 n 
-0000291534 00000 n 
-0000290339 00000 n 
-0000300705 00000 n 
-0000300763 00000 n 
-0000300822 00000 n 
-0000300881 00000 n 
-0000300940 00000 n 
-0000300998 00000 n 
-0000301057 00000 n 
-0000301116 00000 n 
-0000301175 00000 n 
-0000301234 00000 n 
-0000301293 00000 n 
-0000293309 00000 n 
-0000293440 00000 n 
-0000293590 00000 n 
-0000293914 00000 n 
-0000294351 00000 n 
-0000294589 00000 n 
-0000294611 00000 n 
-0000296835 00000 n 
-0000307124 00000 n 
-0000307317 00000 n 
-0000307727 00000 n 
-0000307936 00000 n 
-0000308137 00000 n 
-0000308345 00000 n 
-0000303197 00000 n 
-0000307056 00000 n 
-0000308553 00000 n 
-0000308795 00000 n 
-0000308984 00000 n 
-0000309172 00000 n 
-0000309415 00000 n 
-0000309623 00000 n 
-0000309866 00000 n 
-0000310053 00000 n 
-0000310295 00000 n 
-0000311047 00000 n 
-0000302902 00000 n 
-0000301548 00000 n 
-0000310460 00000 n 
-0000310518 00000 n 
-0000307522 00000 n 
-0000310693 00000 n 
-0000310752 00000 n 
-0000310811 00000 n 
-0000310870 00000 n 
-0000310929 00000 n 
-0000310988 00000 n 
-0000303996 00000 n 
-0000304127 00000 n 
-0000304277 00000 n 
-0000304569 00000 n 
-0000304974 00000 n 
-0000305212 00000 n 
-0000305234 00000 n 
-0000307033 00000 n 
-0000312815 00000 n 
-0000316554 00000 n 
-0000316622 00000 n 
-0000316863 00000 n 
-0000317059 00000 n 
-0000317255 00000 n 
-0000317448 00000 n 
-0000317688 00000 n 
-0000317882 00000 n 
-0000318124 00000 n 
-0000318330 00000 n 
-0000318570 00000 n 
-0000318763 00000 n 
-0000319004 00000 n 
-0000319197 00000 n 
-0000319438 00000 n 
-0000320303 00000 n 
-0000312538 00000 n 
-0000311228 00000 n 
-0000319601 00000 n 
-0000319659 00000 n 
-0000319834 00000 n 
-0000319893 00000 n 
-0000319952 00000 n 
-0000320011 00000 n 
-0000320068 00000 n 
-0000320127 00000 n 
-0000320186 00000 n 
-0000320245 00000 n 
-0000313613 00000 n 
-0000313744 00000 n 
-0000313894 00000 n 
-0000314182 00000 n 
-0000314586 00000 n 
-0000314824 00000 n 
-0000314846 00000 n 
-0000316531 00000 n 
-0000322068 00000 n 
-0000325752 00000 n 
-0000325820 00000 n 
-0000326054 00000 n 
-0000326250 00000 n 
-0000326446 00000 n 
-0000326640 00000 n 
-0000326874 00000 n 
-0000327067 00000 n 
-0000327301 00000 n 
-0000327501 00000 n 
-0000327736 00000 n 
-0000327930 00000 n 
-0000328165 00000 n 
-0000328357 00000 n 
-0000328590 00000 n 
-0000329459 00000 n 
-0000321791 00000 n 
-0000320484 00000 n 
-0000328755 00000 n 
-0000328813 00000 n 
-0000328988 00000 n 
-0000329047 00000 n 
-0000329106 00000 n 
-0000329165 00000 n 
-0000329224 00000 n 
-0000329283 00000 n 
-0000329342 00000 n 
-0000329401 00000 n 
-0000984293 00000 n 
-0000322852 00000 n 
-0000322983 00000 n 
-0000323133 00000 n 
-0000323417 00000 n 
-0000323813 00000 n 
-0000324051 00000 n 
-0000324073 00000 n 
-0000325729 00000 n 
-0000331239 00000 n 
-0000334784 00000 n 
-0000334852 00000 n 
-0000335088 00000 n 
-0000335277 00000 n 
-0000335463 00000 n 
-0000335698 00000 n 
-0000335886 00000 n 
-0000336081 00000 n 
-0000336317 00000 n 
-0000336513 00000 n 
-0000336701 00000 n 
-0000336889 00000 n 
-0000337126 00000 n 
-0000337320 00000 n 
-0000337557 00000 n 
-0000337759 00000 n 
-0000337996 00000 n 
-0000338181 00000 n 
-0000344845 00000 n 
-0000345039 00000 n 
-0000338415 00000 n 
-0000339342 00000 n 
-0000330926 00000 n 
-0000329640 00000 n 
-0000338578 00000 n 
-0000338636 00000 n 
-0000338811 00000 n 
-0000338870 00000 n 
-0000338929 00000 n 
-0000338988 00000 n 
-0000339047 00000 n 
-0000339106 00000 n 
-0000339165 00000 n 
-0000339224 00000 n 
-0000339283 00000 n 
-0000332024 00000 n 
-0000332155 00000 n 
-0000332305 00000 n 
-0000332585 00000 n 
-0000332978 00000 n 
-0000333216 00000 n 
-0000333238 00000 n 
-0000334761 00000 n 
-0000341083 00000 n 
-0000344777 00000 n 
-0000345276 00000 n 
-0000345519 00000 n 
-0000345715 00000 n 
-0000345909 00000 n 
-0000346151 00000 n 
-0000346360 00000 n 
-0000346604 00000 n 
-0000346797 00000 n 
-0000347040 00000 n 
-0000347850 00000 n 
-0000340833 00000 n 
-0000339523 00000 n 
-0000347205 00000 n 
-0000347263 00000 n 
-0000347322 00000 n 
-0000347497 00000 n 
-0000347556 00000 n 
-0000347615 00000 n 
-0000347674 00000 n 
-0000347732 00000 n 
-0000347791 00000 n 
-0000341885 00000 n 
-0000342016 00000 n 
-0000342166 00000 n 
-0000342454 00000 n 
-0000342856 00000 n 
-0000343094 00000 n 
-0000343116 00000 n 
-0000344754 00000 n 
-0000349565 00000 n 
-0000353123 00000 n 
-0000353191 00000 n 
-0000353430 00000 n 
-0000353615 00000 n 
-0000353799 00000 n 
-0000354038 00000 n 
-0000354243 00000 n 
-0000354483 00000 n 
-0000355290 00000 n 
-0000349351 00000 n 
-0000348032 00000 n 
-0000354646 00000 n 
-0000354704 00000 n 
-0000354879 00000 n 
-0000354938 00000 n 
-0000354997 00000 n 
-0000355056 00000 n 
-0000355115 00000 n 
-0000350362 00000 n 
-0000350493 00000 n 
-0000350643 00000 n 
-0000350923 00000 n 
-0000351316 00000 n 
-0000351554 00000 n 
-0000351576 00000 n 
-0000353100 00000 n 
-0000357572 00000 n 
-0000357806 00000 n 
-0000358030 00000 n 
-0000358219 00000 n 
-0000358443 00000 n 
-0000358635 00000 n 
-0000358858 00000 n 
-0000359054 00000 n 
-0000359278 00000 n 
-0000359474 00000 n 
-0000359698 00000 n 
-0000359893 00000 n 
-0000360117 00000 n 
-0000360341 00000 n 
-0000360564 00000 n 
-0000360787 00000 n 
-0000361010 00000 n 
-0000361230 00000 n 
-0000365506 00000 n 
-0000365729 00000 n 
-0000365921 00000 n 
-0000366144 00000 n 
-0000361451 00000 n 
-0000362612 00000 n 
-0000357266 00000 n 
-0000355471 00000 n 
-0000361616 00000 n 
-0000361674 00000 n 
-0000361733 00000 n 
-0000361792 00000 n 
-0000361966 00000 n 
-0000362025 00000 n 
-0000362084 00000 n 
-0000362143 00000 n 
-0000362202 00000 n 
-0000362261 00000 n 
-0000362320 00000 n 
-0000362379 00000 n 
-0000362438 00000 n 
-0000362496 00000 n 
-0000362554 00000 n 
-0000384288 00000 n 
-0000384406 00000 n 
-0000366332 00000 n 
-0000366555 00000 n 
-0000366750 00000 n 
-0000366973 00000 n 
-0000367169 00000 n 
-0000367391 00000 n 
-0000367585 00000 n 
-0000367809 00000 n 
-0000368006 00000 n 
-0000368230 00000 n 
-0000368454 00000 n 
-0000368641 00000 n 
-0000368830 00000 n 
-0000369208 00000 n 
-0000369395 00000 n 
-0000369619 00000 n 
-0000369806 00000 n 
-0000370030 00000 n 
-0000370253 00000 n 
-0000370442 00000 n 
-0000370631 00000 n 
-0000370833 00000 n 
-0000371057 00000 n 
-0000371258 00000 n 
-0000371480 00000 n 
-0000371681 00000 n 
-0000371904 00000 n 
-0000372127 00000 n 
-0000372323 00000 n 
-0000372519 00000 n 
-0000372714 00000 n 
-0000372937 00000 n 
-0000373127 00000 n 
-0000373350 00000 n 
-0000373573 00000 n 
-0000374206 00000 n 
-0000365011 00000 n 
-0000362778 00000 n 
-0000373736 00000 n 
-0000373794 00000 n 
-0000369019 00000 n 
-0000979576 00000 n 
-0000373853 00000 n 
-0000373912 00000 n 
-0000373971 00000 n 
-0000374029 00000 n 
-0000374088 00000 n 
-0000374147 00000 n 
-0000384647 00000 n 
-0000384829 00000 n 
-0000389802 00000 n 
-0000389979 00000 n 
-0000390156 00000 n 
-0000390274 00000 n 
-0000390392 00000 n 
-0000395343 00000 n 
-0000395520 00000 n 
-0000395697 00000 n 
-0000378651 00000 n 
-0000378887 00000 n 
-0000377251 00000 n 
-0000377446 00000 n 
-0000377636 00000 n 
-0000377826 00000 n 
-0000378027 00000 n 
-0000378251 00000 n 
-0000379005 00000 n 
-0000377062 00000 n 
-0000374386 00000 n 
-0000378416 00000 n 
-0000378474 00000 n 
-0000378533 00000 n 
-0000378592 00000 n 
-0000378710 00000 n 
-0000378769 00000 n 
-0000378828 00000 n 
-0000378946 00000 n 
-0000984418 00000 n 
-0000382222 00000 n 
-0000382423 00000 n 
-0000382647 00000 n 
-0000383056 00000 n 
-0000383257 00000 n 
-0000383480 00000 n 
-0000383890 00000 n 
-0000384946 00000 n 
-0000382006 00000 n 
-0000379184 00000 n 
-0000384053 00000 n 
-0000384111 00000 n 
-0000384170 00000 n 
-0000382853 00000 n 
-0000384229 00000 n 
-0000384347 00000 n 
-0000384470 00000 n 
-0000384529 00000 n 
-0000384588 00000 n 
-0000384711 00000 n 
-0000384770 00000 n 
-0000383686 00000 n 
-0000384887 00000 n 
-0000388094 00000 n 
-0000388504 00000 n 
-0000388913 00000 n 
-0000389323 00000 n 
-0000389520 00000 n 
-0000390569 00000 n 
-0000387887 00000 n 
-0000385125 00000 n 
-0000389685 00000 n 
-0000389743 00000 n 
-0000388300 00000 n 
-0000389861 00000 n 
-0000389920 00000 n 
-0000388709 00000 n 
-0000390038 00000 n 
-0000390097 00000 n 
-0000389119 00000 n 
-0000390215 00000 n 
-0000390333 00000 n 
-0000390451 00000 n 
-0000390510 00000 n 
-0000393215 00000 n 
-0000393625 00000 n 
-0000393826 00000 n 
-0000394025 00000 n 
-0000394225 00000 n 
-0000394415 00000 n 
-0000394645 00000 n 
-0000394875 00000 n 
-0000395063 00000 n 
-0000396225 00000 n 
-0000392990 00000 n 
-0000390750 00000 n 
-0000395226 00000 n 
-0000395284 00000 n 
-0000393421 00000 n 
-0000395402 00000 n 
-0000395461 00000 n 
-0000395579 00000 n 
-0000395638 00000 n 
-0000395755 00000 n 
-0000395814 00000 n 
-0000395989 00000 n 
-0000396048 00000 n 
-0000396107 00000 n 
-0000396166 00000 n 
-0000397914 00000 n 
-0000398142 00000 n 
-0000401209 00000 n 
-0000401443 00000 n 
-0000398379 00000 n 
-0000399304 00000 n 
-0000397752 00000 n 
-0000396406 00000 n 
-0000398544 00000 n 
-0000398718 00000 n 
-0000398777 00000 n 
-0000398836 00000 n 
-0000399011 00000 n 
-0000399070 00000 n 
-0000399129 00000 n 
-0000401676 00000 n 
-0000401913 00000 n 
-0000402150 00000 n 
-0000402386 00000 n 
-0000402621 00000 n 
-0000402856 00000 n 
-0000403091 00000 n 
-0000403328 00000 n 
-0000403565 00000 n 
-0000403802 00000 n 
-0000407719 00000 n 
-0000407956 00000 n 
-0000404037 00000 n 
-0000404964 00000 n 
-0000400957 00000 n 
-0000399471 00000 n 
-0000404200 00000 n 
-0000404258 00000 n 
-0000404317 00000 n 
-0000404376 00000 n 
-0000404435 00000 n 
-0000404610 00000 n 
-0000404669 00000 n 
-0000404728 00000 n 
-0000404787 00000 n 
-0000404846 00000 n 
-0000404905 00000 n 
-0000410563 00000 n 
-0000410681 00000 n 
-0000410803 00000 n 
-0000410926 00000 n 
-0000411044 00000 n 
-0000408192 00000 n 
-0000408429 00000 n 
-0000408665 00000 n 
-0000408902 00000 n 
-0000409139 00000 n 
-0000409341 00000 n 
-0000409577 00000 n 
-0000410046 00000 n 
-0000411107 00000 n 
-0000407485 00000 n 
-0000405117 00000 n 
-0000410211 00000 n 
-0000410269 00000 n 
-0000410328 00000 n 
-0000410386 00000 n 
-0000410445 00000 n 
-0000410504 00000 n 
-0000410622 00000 n 
-0000410744 00000 n 
-0000410867 00000 n 
-0000410985 00000 n 
-0000409812 00000 n 
-0000984543 00000 n 
-0000416963 00000 n 
-0000417086 00000 n 
-0000417268 00000 n 
-0000414702 00000 n 
-0000414938 00000 n 
-0000415133 00000 n 
-0000415605 00000 n 
-0000415800 00000 n 
-0000416273 00000 n 
-0000416683 00000 n 
-0000417509 00000 n 
-0000414477 00000 n 
-0000411260 00000 n 
-0000416846 00000 n 
-0000416904 00000 n 
-0000417027 00000 n 
-0000417150 00000 n 
-0000417209 00000 n 
-0000415369 00000 n 
-0000417332 00000 n 
-0000416037 00000 n 
-0000417391 00000 n 
-0000417450 00000 n 
-0000416479 00000 n 
-0000420067 00000 n 
-0000420294 00000 n 
-0000420523 00000 n 
-0000420752 00000 n 
-0000420980 00000 n 
-0000421209 00000 n 
-0000421437 00000 n 
-0000421666 00000 n 
-0000422475 00000 n 
-0000419860 00000 n 
-0000417728 00000 n 
-0000421831 00000 n 
-0000422005 00000 n 
-0000422064 00000 n 
-0000422123 00000 n 
-0000422182 00000 n 
-0000422241 00000 n 
-0000422300 00000 n 
-0000422358 00000 n 
-0000422416 00000 n 
-0000429023 00000 n 
-0000429141 00000 n 
-0000424567 00000 n 
-0000428251 00000 n 
-0000428319 00000 n 
-0000428512 00000 n 
-0000428743 00000 n 
-0000429614 00000 n 
-0000424389 00000 n 
-0000422642 00000 n 
-0000428906 00000 n 
-0000428964 00000 n 
-0000429082 00000 n 
-0000429205 00000 n 
-0000429380 00000 n 
-0000429439 00000 n 
-0000429498 00000 n 
-0000425354 00000 n 
-0000425485 00000 n 
-0000425635 00000 n 
-0000425923 00000 n 
-0000426322 00000 n 
-0000426560 00000 n 
-0000426582 00000 n 
-0000428228 00000 n 
-0000432065 00000 n 
-0000432287 00000 n 
-0000432510 00000 n 
-0000432706 00000 n 
-0000432898 00000 n 
-0000433121 00000 n 
-0000433311 00000 n 
-0000433534 00000 n 
-0000433757 00000 n 
-0000433947 00000 n 
-0000434171 00000 n 
-0000434395 00000 n 
-0000434587 00000 n 
-0000434810 00000 n 
-0000435034 00000 n 
-0000435258 00000 n 
-0000435446 00000 n 
-0000435669 00000 n 
-0000435865 00000 n 
-0000436089 00000 n 
-0000436312 00000 n 
-0000436536 00000 n 
-0000436759 00000 n 
-0000436983 00000 n 
-0000437207 00000 n 
-0000441218 00000 n 
-0000441441 00000 n 
-0000441664 00000 n 
-0000441856 00000 n 
-0000437427 00000 n 
-0000438651 00000 n 
-0000431696 00000 n 
-0000429809 00000 n 
-0000437592 00000 n 
-0000437708 00000 n 
-0000437767 00000 n 
-0000437826 00000 n 
-0000437885 00000 n 
-0000437944 00000 n 
-0000438003 00000 n 
-0000438062 00000 n 
-0000438121 00000 n 
-0000438179 00000 n 
-0000438238 00000 n 
-0000438297 00000 n 
-0000438356 00000 n 
-0000438415 00000 n 
-0000438474 00000 n 
-0000438533 00000 n 
-0000438592 00000 n 
-0000450548 00000 n 
-0000455493 00000 n 
-0000455670 00000 n 
-0000442079 00000 n 
-0000442302 00000 n 
-0000442490 00000 n 
-0000442712 00000 n 
-0000442906 00000 n 
-0000443130 00000 n 
-0000443326 00000 n 
-0000443548 00000 n 
-0000443741 00000 n 
-0000443965 00000 n 
-0000444158 00000 n 
-0000444382 00000 n 
-0000444597 00000 n 
-0000444821 00000 n 
-0000445251 00000 n 
-0000445473 00000 n 
-0000445688 00000 n 
-0000445912 00000 n 
-0000446664 00000 n 
-0000440876 00000 n 
-0000438817 00000 n 
-0000446075 00000 n 
-0000446133 00000 n 
-0000446192 00000 n 
-0000446251 00000 n 
-0000446310 00000 n 
-0000446369 00000 n 
-0000445036 00000 n 
-0000446428 00000 n 
-0000446487 00000 n 
-0000446546 00000 n 
-0000446605 00000 n 
-0000455788 00000 n 
-0000455970 00000 n 
-0000456152 00000 n 
-0000456329 00000 n 
-0000459486 00000 n 
-0000450077 00000 n 
-0000450266 00000 n 
-0000450725 00000 n 
-0000449924 00000 n 
-0000446830 00000 n 
-0000450431 00000 n 
-0000450489 00000 n 
-0000450607 00000 n 
-0000450666 00000 n 
-0000984668 00000 n 
-0000453969 00000 n 
-0000454170 00000 n 
-0000454394 00000 n 
-0000454804 00000 n 
-0000455213 00000 n 
-0000456445 00000 n 
-0000453771 00000 n 
-0000450904 00000 n 
-0000455376 00000 n 
-0000455434 00000 n 
-0000455552 00000 n 
-0000455611 00000 n 
-0000455729 00000 n 
-0000455852 00000 n 
-0000455911 00000 n 
-0000456034 00000 n 
-0000456093 00000 n 
-0000454600 00000 n 
-0000456211 00000 n 
-0000456270 00000 n 
-0000455010 00000 n 
-0000456387 00000 n 
-0000458520 00000 n 
-0000458768 00000 n 
-0000459015 00000 n 
-0000461864 00000 n 
-0000462113 00000 n 
-0000459263 00000 n 
-0000460187 00000 n 
-0000458349 00000 n 
-0000456624 00000 n 
-0000459428 00000 n 
-0000459545 00000 n 
-0000459720 00000 n 
-0000459778 00000 n 
-0000459836 00000 n 
-0000459895 00000 n 
-0000460069 00000 n 
-0000460128 00000 n 
-0000462362 00000 n 
-0000462610 00000 n 
-0000462859 00000 n 
-0000463049 00000 n 
-0000463279 00000 n 
-0000466359 00000 n 
-0000470066 00000 n 
-0000463469 00000 n 
-0000464393 00000 n 
-0000461657 00000 n 
-0000460341 00000 n 
-0000463632 00000 n 
-0000463690 00000 n 
-0000463749 00000 n 
-0000463808 00000 n 
-0000463867 00000 n 
-0000463926 00000 n 
-0000464100 00000 n 
-0000464159 00000 n 
-0000464218 00000 n 
-0000470134 00000 n 
-0000470330 00000 n 
-0000470561 00000 n 
-0000473439 00000 n 
-0000477509 00000 n 
-0000470747 00000 n 
-0000471439 00000 n 
-0000466172 00000 n 
-0000464547 00000 n 
-0000470912 00000 n 
-0000470970 00000 n 
-0000471029 00000 n 
-0000471088 00000 n 
-0000471147 00000 n 
-0000471206 00000 n 
-0000471265 00000 n 
-0000467144 00000 n 
-0000467275 00000 n 
-0000467425 00000 n 
-0000467713 00000 n 
-0000468114 00000 n 
-0000468352 00000 n 
-0000468374 00000 n 
-0000470043 00000 n 
-0000477577 00000 n 
-0000477771 00000 n 
-0000477995 00000 n 
-0000478192 00000 n 
-0000478419 00000 n 
-0000478646 00000 n 
-0000478873 00000 n 
-0000479066 00000 n 
-0000479274 00000 n 
-0000479501 00000 n 
-0000479691 00000 n 
-0000479886 00000 n 
-0000480112 00000 n 
-0000480304 00000 n 
-0000480528 00000 n 
-0000480723 00000 n 
-0000484467 00000 n 
-0000480916 00000 n 
-0000481666 00000 n 
-0000473135 00000 n 
-0000471634 00000 n 
-0000481079 00000 n 
-0000481137 00000 n 
-0000481195 00000 n 
-0000481253 00000 n 
-0000481312 00000 n 
-0000481371 00000 n 
-0000481430 00000 n 
-0000481489 00000 n 
-0000481548 00000 n 
-0000481607 00000 n 
-0000474351 00000 n 
-0000474482 00000 n 
-0000474632 00000 n 
-0000474932 00000 n 
-0000475343 00000 n 
-0000475581 00000 n 
-0000475603 00000 n 
-0000477486 00000 n 
-0000489511 00000 n 
-0000484660 00000 n 
-0000484851 00000 n 
-0000485095 00000 n 
-0000485339 00000 n 
-0000485584 00000 n 
-0000485795 00000 n 
-0000486039 00000 n 
-0000486249 00000 n 
-0000486469 00000 n 
-0000486713 00000 n 
-0000486934 00000 n 
-0000487179 00000 n 
-0000487423 00000 n 
-0000487614 00000 n 
-0000487858 00000 n 
-0000488079 00000 n 
-0000488324 00000 n 
-0000488545 00000 n 
-0000488986 00000 n 
-0000492906 00000 n 
-0000489229 00000 n 
-0000490334 00000 n 
-0000484134 00000 n 
-0000481847 00000 n 
-0000489394 00000 n 
-0000489452 00000 n 
-0000489570 00000 n 
-0000489745 00000 n 
-0000489804 00000 n 
-0000489863 00000 n 
-0000489921 00000 n 
-0000489980 00000 n 
-0000490039 00000 n 
-0000490098 00000 n 
-0000490157 00000 n 
-0000490216 00000 n 
-0000488766 00000 n 
-0000490275 00000 n 
-0000984793 00000 n 
-0000496118 00000 n 
-0000493097 00000 n 
-0000493308 00000 n 
-0000493562 00000 n 
-0000493783 00000 n 
-0000494036 00000 n 
-0000494256 00000 n 
-0000494511 00000 n 
-0000494766 00000 n 
-0000494957 00000 n 
-0000495212 00000 n 
-0000495466 00000 n 
-0000499267 00000 n 
-0000495720 00000 n 
-0000496824 00000 n 
-0000492654 00000 n 
-0000490500 00000 n 
-0000495883 00000 n 
-0000495941 00000 n 
-0000496000 00000 n 
-0000496059 00000 n 
-0000496177 00000 n 
-0000496352 00000 n 
-0000496411 00000 n 
-0000496470 00000 n 
-0000496529 00000 n 
-0000496588 00000 n 
-0000496647 00000 n 
-0000496706 00000 n 
-0000496765 00000 n 
-0000502801 00000 n 
-0000499478 00000 n 
-0000499669 00000 n 
-0000499899 00000 n 
-0000500130 00000 n 
-0000500326 00000 n 
-0000500523 00000 n 
-0000500754 00000 n 
-0000500951 00000 n 
-0000501182 00000 n 
-0000501378 00000 n 
-0000501608 00000 n 
-0000501805 00000 n 
-0000502036 00000 n 
-0000502231 00000 n 
-0000502460 00000 n 
-0000503565 00000 n 
-0000498988 00000 n 
-0000496990 00000 n 
-0000502625 00000 n 
-0000502683 00000 n 
-0000502742 00000 n 
-0000502860 00000 n 
-0000503035 00000 n 
-0000503094 00000 n 
-0000503153 00000 n 
-0000503212 00000 n 
-0000503271 00000 n 
-0000503330 00000 n 
-0000503389 00000 n 
-0000503448 00000 n 
-0000503507 00000 n 
-0000505226 00000 n 
-0000505456 00000 n 
-0000505687 00000 n 
-0000505883 00000 n 
-0000506080 00000 n 
-0000506311 00000 n 
-0000506508 00000 n 
-0000509662 00000 n 
-0000513047 00000 n 
-0000506739 00000 n 
-0000507664 00000 n 
-0000505019 00000 n 
-0000503732 00000 n 
-0000506902 00000 n 
-0000506960 00000 n 
-0000507135 00000 n 
-0000507194 00000 n 
-0000507253 00000 n 
-0000507312 00000 n 
-0000507371 00000 n 
-0000507430 00000 n 
-0000507489 00000 n 
-0000513115 00000 n 
-0000513337 00000 n 
-0000513559 00000 n 
-0000513755 00000 n 
-0000513977 00000 n 
-0000514173 00000 n 
-0000514395 00000 n 
-0000514591 00000 n 
-0000514813 00000 n 
-0000515009 00000 n 
-0000515231 00000 n 
-0000515453 00000 n 
-0000515675 00000 n 
-0000515897 00000 n 
-0000516119 00000 n 
-0000516341 00000 n 
-0000516561 00000 n 
-0000516782 00000 n 
-0000516967 00000 n 
-0000517187 00000 n 
-0000521301 00000 n 
-0000521522 00000 n 
-0000521717 00000 n 
-0000521938 00000 n 
-0000522134 00000 n 
-0000522323 00000 n 
-0000517381 00000 n 
-0000518370 00000 n 
-0000509322 00000 n 
-0000507830 00000 n 
-0000517546 00000 n 
-0000517604 00000 n 
-0000517663 00000 n 
-0000517721 00000 n 
-0000517780 00000 n 
-0000517839 00000 n 
-0000517898 00000 n 
-0000517957 00000 n 
-0000518016 00000 n 
-0000518075 00000 n 
-0000518134 00000 n 
-0000518193 00000 n 
-0000518252 00000 n 
-0000518311 00000 n 
-0000510409 00000 n 
-0000510540 00000 n 
-0000510690 00000 n 
-0000510958 00000 n 
-0000511336 00000 n 
-0000511574 00000 n 
-0000511596 00000 n 
-0000513024 00000 n 
-0000566698 00000 n 
-0000566875 00000 n 
-0000522512 00000 n 
-0000522734 00000 n 
-0000522930 00000 n 
-0000523119 00000 n 
-0000523308 00000 n 
-0000523529 00000 n 
-0000523725 00000 n 
-0000523914 00000 n 
-0000524103 00000 n 
-0000524289 00000 n 
-0000524511 00000 n 
-0000524707 00000 n 
-0000524896 00000 n 
-0000525085 00000 n 
-0000525272 00000 n 
-0000525469 00000 n 
-0000525690 00000 n 
-0000525878 00000 n 
-0000526075 00000 n 
-0000526297 00000 n 
-0000526484 00000 n 
-0000526681 00000 n 
-0000526902 00000 n 
-0000527088 00000 n 
-0000527310 00000 n 
-0000527498 00000 n 
-0000527719 00000 n 
-0000527906 00000 n 
-0000528128 00000 n 
-0000528316 00000 n 
-0000528538 00000 n 
-0000528724 00000 n 
-0000528946 00000 n 
-0000529168 00000 n 
-0000529388 00000 n 
-0000529610 00000 n 
-0000529831 00000 n 
-0000530053 00000 n 
-0000530275 00000 n 
-0000530496 00000 n 
-0000530684 00000 n 
-0000530903 00000 n 
-0000535403 00000 n 
-0000535624 00000 n 
-0000535819 00000 n 
-0000536039 00000 n 
-0000531089 00000 n 
-0000531664 00000 n 
-0000520725 00000 n 
-0000518566 00000 n 
-0000531252 00000 n 
-0000531310 00000 n 
-0000531369 00000 n 
-0000531428 00000 n 
-0000531487 00000 n 
-0000531546 00000 n 
-0000531605 00000 n 
-0000567052 00000 n 
-0000571764 00000 n 
-0000572000 00000 n 
-0000572241 00000 n 
-0000577341 00000 n 
-0000577582 00000 n 
-0000582481 00000 n 
-0000582658 00000 n 
-0000582835 00000 n 
-0000583011 00000 n 
-0000583188 00000 n 
-0000583365 00000 n 
-0000583482 00000 n 
-0000587825 00000 n 
-0000588065 00000 n 
-0000536234 00000 n 
-0000536454 00000 n 
-0000536641 00000 n 
-0000536861 00000 n 
-0000537048 00000 n 
-0000537269 00000 n 
-0000537465 00000 n 
-0000537686 00000 n 
-0000537882 00000 n 
-0000538103 00000 n 
-0000538291 00000 n 
-0000538512 00000 n 
-0000538700 00000 n 
-0000538921 00000 n 
-0000539109 00000 n 
-0000539330 00000 n 
-0000539518 00000 n 
-0000539739 00000 n 
-0000539961 00000 n 
-0000540147 00000 n 
-0000540368 00000 n 
-0000540554 00000 n 
-0000540750 00000 n 
-0000540938 00000 n 
-0000541158 00000 n 
-0000541344 00000 n 
-0000541540 00000 n 
-0000541729 00000 n 
-0000541951 00000 n 
-0000542137 00000 n 
-0000542333 00000 n 
-0000542529 00000 n 
-0000542718 00000 n 
-0000542940 00000 n 
-0000543126 00000 n 
-0000543322 00000 n 
-0000543518 00000 n 
-0000543707 00000 n 
-0000543929 00000 n 
-0000544115 00000 n 
-0000544308 00000 n 
-0000544504 00000 n 
-0000544693 00000 n 
-0000544915 00000 n 
-0000545101 00000 n 
-0000545294 00000 n 
-0000545490 00000 n 
-0000545679 00000 n 
-0000545901 00000 n 
-0000546097 00000 n 
-0000546290 00000 n 
-0000546682 00000 n 
-0000546902 00000 n 
-0000547096 00000 n 
-0000547287 00000 n 
-0000551200 00000 n 
-0000551421 00000 n 
-0000547675 00000 n 
-0000547957 00000 n 
-0000534710 00000 n 
-0000531830 00000 n 
-0000547840 00000 n 
-0000547898 00000 n 
-0000980161 00000 n 
-0000981174 00000 n 
-0000979870 00000 n 
-0000546486 00000 n 
-0000547481 00000 n 
-0000984918 00000 n 
-0000588242 00000 n 
-0000588477 00000 n 
-0000593510 00000 n 
-0000593687 00000 n 
-0000593863 00000 n 
-0000594098 00000 n 
-0000594334 00000 n 
-0000599547 00000 n 
-0000599724 00000 n 
-0000599901 00000 n 
-0000600078 00000 n 
-0000600254 00000 n 
-0000605291 00000 n 
-0000605527 00000 n 
-0000605762 00000 n 
-0000611626 00000 n 
-0000611858 00000 n 
-0000612093 00000 n 
-0000617326 00000 n 
-0000551607 00000 n 
-0000551828 00000 n 
-0000552020 00000 n 
-0000552241 00000 n 
-0000552429 00000 n 
-0000552650 00000 n 
-0000552838 00000 n 
-0000553059 00000 n 
-0000553280 00000 n 
-0000553500 00000 n 
-0000553687 00000 n 
-0000553907 00000 n 
-0000554099 00000 n 
-0000554320 00000 n 
-0000554541 00000 n 
-0000554727 00000 n 
-0000554948 00000 n 
-0000555140 00000 n 
-0000555326 00000 n 
-0000555547 00000 n 
-0000555742 00000 n 
-0000555937 00000 n 
-0000556159 00000 n 
-0000556354 00000 n 
-0000556576 00000 n 
-0000556797 00000 n 
-0000556984 00000 n 
-0000557205 00000 n 
-0000557399 00000 n 
-0000557620 00000 n 
-0000557808 00000 n 
-0000558029 00000 n 
-0000558215 00000 n 
-0000558435 00000 n 
-0000558622 00000 n 
-0000558842 00000 n 
-0000562681 00000 n 
-0000562903 00000 n 
-0000563091 00000 n 
-0000563287 00000 n 
-0000563505 00000 n 
-0000563693 00000 n 
-0000559029 00000 n 
-0000559486 00000 n 
-0000550714 00000 n 
-0000548182 00000 n 
-0000559192 00000 n 
-0000559250 00000 n 
-0000559309 00000 n 
-0000559368 00000 n 
-0000559427 00000 n 
-0000617562 00000 n 
-0000617798 00000 n 
-0000622956 00000 n 
-0000623190 00000 n 
-0000623367 00000 n 
-0000623603 00000 n 
-0000629032 00000 n 
-0000629207 00000 n 
-0000629443 00000 n 
-0000629620 00000 n 
-0000635002 00000 n 
-0000635238 00000 n 
-0000635411 00000 n 
-0000635588 00000 n 
-0000640369 00000 n 
-0000640603 00000 n 
-0000563889 00000 n 
-0000564111 00000 n 
-0000564299 00000 n 
-0000564495 00000 n 
-0000564717 00000 n 
-0000564905 00000 n 
-0000565100 00000 n 
-0000565288 00000 n 
-0000565478 00000 n 
-0000565888 00000 n 
-0000566298 00000 n 
-0000567168 00000 n 
-0000562375 00000 n 
-0000559695 00000 n 
-0000566463 00000 n 
-0000981464 00000 n 
-0000566521 00000 n 
-0000566580 00000 n 
-0000566639 00000 n 
-0000566757 00000 n 
-0000566816 00000 n 
-0000565684 00000 n 
-0000566934 00000 n 
-0000566993 00000 n 
-0000566094 00000 n 
-0000567110 00000 n 
-0000640839 00000 n 
-0000645762 00000 n 
-0000645998 00000 n 
-0000646234 00000 n 
-0000570255 00000 n 
-0000570665 00000 n 
-0000571074 00000 n 
-0000571484 00000 n 
-0000572362 00000 n 
-0000570057 00000 n 
-0000567406 00000 n 
-0000571647 00000 n 
-0000571705 00000 n 
-0000570461 00000 n 
-0000571823 00000 n 
-0000571882 00000 n 
-0000571941 00000 n 
-0000570870 00000 n 
-0000572064 00000 n 
-0000572123 00000 n 
-0000572182 00000 n 
-0000571280 00000 n 
-0000572304 00000 n 
-0000575775 00000 n 
-0000576185 00000 n 
-0000576595 00000 n 
-0000577001 00000 n 
-0000577764 00000 n 
-0000575577 00000 n 
-0000572542 00000 n 
-0000577166 00000 n 
-0000577224 00000 n 
-0000577283 00000 n 
-0000575981 00000 n 
-0000577405 00000 n 
-0000577464 00000 n 
-0000577523 00000 n 
-0000576391 00000 n 
-0000577646 00000 n 
-0000577705 00000 n 
-0000576799 00000 n 
-0000580214 00000 n 
-0000580624 00000 n 
-0000581031 00000 n 
-0000581441 00000 n 
-0000581851 00000 n 
-0000582260 00000 n 
-0000583602 00000 n 
-0000579980 00000 n 
-0000577944 00000 n 
-0000582423 00000 n 
-0000582540 00000 n 
-0000582599 00000 n 
-0000580420 00000 n 
-0000582717 00000 n 
-0000582776 00000 n 
-0000580828 00000 n 
-0000582893 00000 n 
-0000582952 00000 n 
-0000581237 00000 n 
-0000583070 00000 n 
-0000583129 00000 n 
-0000581647 00000 n 
-0000583247 00000 n 
-0000583306 00000 n 
-0000582056 00000 n 
-0000583424 00000 n 
-0000583544 00000 n 
-0000586373 00000 n 
-0000586782 00000 n 
-0000587192 00000 n 
-0000587602 00000 n 
-0000588654 00000 n 
-0000586175 00000 n 
-0000583769 00000 n 
-0000587767 00000 n 
-0000587889 00000 n 
-0000587948 00000 n 
-0000588007 00000 n 
-0000586579 00000 n 
-0000588124 00000 n 
-0000588183 00000 n 
-0000586988 00000 n 
-0000588301 00000 n 
-0000588360 00000 n 
-0000588418 00000 n 
-0000587398 00000 n 
-0000588536 00000 n 
-0000588595 00000 n 
-0000985043 00000 n 
-0000591181 00000 n 
-0000591591 00000 n 
-0000592000 00000 n 
-0000592410 00000 n 
-0000592820 00000 n 
-0000593230 00000 n 
-0000594450 00000 n 
-0000590947 00000 n 
-0000588821 00000 n 
-0000593393 00000 n 
-0000593451 00000 n 
-0000591387 00000 n 
-0000593569 00000 n 
-0000593628 00000 n 
-0000591796 00000 n 
-0000593746 00000 n 
-0000593805 00000 n 
-0000592206 00000 n 
-0000593922 00000 n 
-0000593981 00000 n 
-0000594039 00000 n 
-0000592616 00000 n 
-0000594157 00000 n 
-0000594216 00000 n 
-0000594275 00000 n 
-0000593026 00000 n 
-0000594392 00000 n 
-0000597216 00000 n 
-0000597626 00000 n 
-0000598035 00000 n 
-0000598445 00000 n 
-0000598855 00000 n 
-0000599265 00000 n 
-0000600372 00000 n 
-0000596982 00000 n 
-0000594617 00000 n 
-0000599430 00000 n 
-0000599488 00000 n 
-0000597422 00000 n 
-0000599606 00000 n 
-0000599665 00000 n 
-0000597832 00000 n 
-0000599783 00000 n 
-0000599842 00000 n 
-0000598241 00000 n 
-0000599960 00000 n 
-0000600019 00000 n 
-0000598651 00000 n 
-0000600137 00000 n 
-0000600195 00000 n 
-0000599061 00000 n 
-0000600313 00000 n 
-0000603723 00000 n 
-0000604132 00000 n 
-0000604542 00000 n 
-0000604952 00000 n 
-0000605880 00000 n 
-0000603525 00000 n 
-0000600539 00000 n 
-0000605115 00000 n 
-0000605173 00000 n 
-0000605232 00000 n 
-0000603928 00000 n 
-0000605350 00000 n 
-0000605409 00000 n 
-0000605468 00000 n 
-0000604338 00000 n 
-0000605586 00000 n 
-0000605645 00000 n 
-0000605703 00000 n 
-0000604748 00000 n 
-0000605821 00000 n 
-0000609295 00000 n 
-0000609705 00000 n 
-0000610115 00000 n 
-0000610497 00000 n 
-0000610906 00000 n 
-0000611285 00000 n 
-0000612151 00000 n 
-0000609061 00000 n 
-0000606099 00000 n 
-0000611450 00000 n 
-0000611508 00000 n 
-0000611567 00000 n 
-0000609501 00000 n 
-0000611685 00000 n 
-0000611740 00000 n 
-0000611799 00000 n 
-0000609911 00000 n 
-0000610306 00000 n 
-0000611917 00000 n 
-0000611976 00000 n 
-0000612034 00000 n 
-0000610703 00000 n 
-0000611096 00000 n 
-0000615318 00000 n 
-0000615728 00000 n 
-0000615918 00000 n 
-0000616328 00000 n 
-0000616518 00000 n 
-0000616928 00000 n 
-0000617916 00000 n 
-0000615102 00000 n 
-0000612370 00000 n 
-0000617091 00000 n 
-0000617149 00000 n 
-0000617208 00000 n 
-0000617267 00000 n 
-0000615524 00000 n 
-0000617385 00000 n 
-0000617444 00000 n 
-0000617503 00000 n 
-0000616124 00000 n 
-0000617621 00000 n 
-0000617680 00000 n 
-0000617739 00000 n 
-0000616724 00000 n 
-0000617857 00000 n 
-0000621001 00000 n 
-0000621410 00000 n 
-0000621595 00000 n 
-0000622004 00000 n 
-0000622414 00000 n 
-0000622615 00000 n 
-0000623721 00000 n 
-0000620785 00000 n 
-0000618122 00000 n 
-0000622780 00000 n 
-0000622838 00000 n 
-0000622897 00000 n 
-0000621207 00000 n 
-0000623013 00000 n 
-0000623072 00000 n 
-0000623131 00000 n 
-0000621800 00000 n 
-0000623249 00000 n 
-0000623308 00000 n 
-0000622210 00000 n 
-0000623426 00000 n 
-0000623485 00000 n 
-0000623544 00000 n 
-0000623662 00000 n 
-0000985168 00000 n 
-0000626691 00000 n 
-0000626891 00000 n 
-0000627301 00000 n 
-0000627502 00000 n 
-0000627687 00000 n 
-0000628097 00000 n 
-0000628283 00000 n 
-0000628693 00000 n 
-0000629738 00000 n 
-0000626457 00000 n 
-0000623901 00000 n 
-0000628856 00000 n 
-0000628914 00000 n 
-0000628973 00000 n 
-0000629089 00000 n 
-0000629148 00000 n 
-0000627097 00000 n 
-0000629266 00000 n 
-0000629325 00000 n 
-0000629384 00000 n 
-0000627893 00000 n 
-0000629502 00000 n 
-0000629561 00000 n 
-0000628489 00000 n 
-0000629679 00000 n 
-0000632863 00000 n 
-0000633273 00000 n 
-0000633474 00000 n 
-0000633659 00000 n 
-0000634068 00000 n 
-0000634252 00000 n 
-0000634661 00000 n 
-0000635705 00000 n 
-0000632638 00000 n 
-0000629905 00000 n 
-0000634826 00000 n 
-0000634884 00000 n 
-0000634943 00000 n 
-0000633069 00000 n 
-0000635061 00000 n 
-0000635120 00000 n 
-0000635179 00000 n 
-0000633865 00000 n 
-0000635293 00000 n 
-0000635352 00000 n 
-0000635470 00000 n 
-0000635529 00000 n 
-0000634458 00000 n 
-0000635646 00000 n 
-0000638803 00000 n 
-0000639212 00000 n 
-0000639621 00000 n 
-0000640030 00000 n 
-0000641016 00000 n 
-0000638605 00000 n 
-0000635872 00000 n 
-0000640193 00000 n 
-0000640251 00000 n 
-0000640310 00000 n 
-0000639009 00000 n 
-0000640426 00000 n 
-0000640485 00000 n 
-0000640544 00000 n 
-0000639417 00000 n 
-0000640662 00000 n 
-0000640721 00000 n 
-0000640780 00000 n 
-0000639827 00000 n 
-0000640898 00000 n 
-0000640957 00000 n 
-0000644252 00000 n 
-0000644662 00000 n 
-0000645071 00000 n 
-0000645480 00000 n 
-0000646410 00000 n 
-0000644054 00000 n 
-0000641196 00000 n 
-0000645645 00000 n 
-0000645703 00000 n 
-0000644458 00000 n 
-0000645821 00000 n 
-0000645880 00000 n 
-0000645939 00000 n 
-0000644867 00000 n 
-0000646057 00000 n 
-0000646116 00000 n 
-0000646175 00000 n 
-0000645277 00000 n 
-0000646292 00000 n 
-0000646351 00000 n 
-0000648451 00000 n 
-0000648861 00000 n 
-0000649087 00000 n 
-0000649313 00000 n 
-0000649534 00000 n 
-0000649760 00000 n 
-0000649987 00000 n 
-0000650970 00000 n 
-0000648244 00000 n 
-0000646618 00000 n 
-0000650150 00000 n 
-0000650208 00000 n 
-0000648657 00000 n 
-0000650382 00000 n 
-0000650441 00000 n 
-0000650500 00000 n 
-0000650559 00000 n 
-0000650618 00000 n 
-0000650677 00000 n 
-0000650852 00000 n 
-0000650911 00000 n 
-0000653325 00000 n 
-0000653544 00000 n 
-0000653764 00000 n 
-0000653984 00000 n 
-0000654169 00000 n 
-0000656427 00000 n 
-0000654355 00000 n 
-0000655340 00000 n 
-0000653136 00000 n 
-0000651123 00000 n 
-0000654520 00000 n 
-0000654578 00000 n 
-0000654753 00000 n 
-0000654812 00000 n 
-0000654871 00000 n 
-0000654930 00000 n 
-0000654989 00000 n 
-0000655048 00000 n 
-0000655107 00000 n 
-0000655166 00000 n 
-0000985293 00000 n 
-0000656652 00000 n 
-0000657050 00000 n 
-0000656274 00000 n 
-0000655520 00000 n 
-0000656815 00000 n 
-0000656873 00000 n 
-0000656932 00000 n 
-0000656991 00000 n 
-0000659037 00000 n 
-0000659188 00000 n 
-0000659338 00000 n 
-0000659488 00000 n 
-0000659639 00000 n 
-0000659790 00000 n 
-0000659941 00000 n 
-0000660092 00000 n 
-0000660243 00000 n 
-0000660394 00000 n 
-0000660545 00000 n 
-0000660696 00000 n 
-0000660847 00000 n 
-0000660998 00000 n 
-0000661149 00000 n 
-0000661300 00000 n 
-0000661451 00000 n 
-0000661600 00000 n 
-0000661749 00000 n 
-0000661899 00000 n 
-0000662050 00000 n 
-0000662201 00000 n 
-0000662352 00000 n 
-0000662503 00000 n 
-0000662654 00000 n 
-0000662801 00000 n 
-0000662952 00000 n 
-0000663101 00000 n 
-0000663252 00000 n 
-0000663402 00000 n 
-0000663552 00000 n 
-0000663702 00000 n 
-0000663853 00000 n 
-0000664004 00000 n 
-0000664154 00000 n 
-0000664305 00000 n 
-0000664456 00000 n 
-0000664606 00000 n 
-0000664757 00000 n 
-0000664908 00000 n 
-0000665059 00000 n 
-0000665210 00000 n 
-0000665361 00000 n 
-0000665512 00000 n 
-0000665663 00000 n 
-0000665814 00000 n 
-0000665965 00000 n 
-0000666116 00000 n 
-0000666267 00000 n 
-0000666418 00000 n 
-0000666569 00000 n 
-0000669434 00000 n 
-0000666718 00000 n 
-0000667000 00000 n 
-0000658434 00000 n 
-0000657203 00000 n 
-0000666883 00000 n 
-0000666941 00000 n 
-0000669585 00000 n 
-0000669736 00000 n 
-0000669887 00000 n 
-0000670038 00000 n 
-0000670189 00000 n 
-0000670340 00000 n 
-0000670491 00000 n 
-0000670642 00000 n 
-0000670793 00000 n 
-0000670944 00000 n 
-0000671095 00000 n 
-0000671246 00000 n 
-0000671397 00000 n 
-0000671548 00000 n 
-0000671699 00000 n 
-0000671850 00000 n 
-0000672000 00000 n 
-0000672151 00000 n 
-0000672302 00000 n 
-0000672452 00000 n 
-0000672602 00000 n 
-0000672752 00000 n 
-0000672903 00000 n 
-0000673052 00000 n 
-0000673203 00000 n 
-0000673354 00000 n 
-0000673505 00000 n 
-0000673654 00000 n 
-0000673804 00000 n 
-0000673955 00000 n 
-0000674106 00000 n 
-0000674256 00000 n 
-0000674407 00000 n 
-0000674557 00000 n 
-0000674708 00000 n 
-0000674858 00000 n 
-0000675009 00000 n 
-0000675160 00000 n 
-0000675311 00000 n 
-0000675462 00000 n 
-0000675613 00000 n 
-0000675764 00000 n 
-0000675914 00000 n 
-0000676065 00000 n 
-0000676216 00000 n 
-0000676366 00000 n 
-0000676517 00000 n 
-0000676668 00000 n 
-0000676819 00000 n 
-0000676970 00000 n 
-0000677121 00000 n 
-0000677272 00000 n 
-0000677423 00000 n 
-0000677572 00000 n 
-0000677723 00000 n 
-0000677874 00000 n 
-0000678025 00000 n 
-0000678175 00000 n 
-0000678325 00000 n 
-0000678476 00000 n 
-0000678625 00000 n 
-0000678776 00000 n 
-0000678927 00000 n 
-0000679078 00000 n 
-0000679229 00000 n 
-0000679380 00000 n 
-0000679530 00000 n 
-0000679679 00000 n 
-0000682856 00000 n 
-0000679828 00000 n 
-0000680049 00000 n 
-0000668669 00000 n 
-0000667127 00000 n 
-0000679991 00000 n 
-0000683007 00000 n 
-0000683158 00000 n 
-0000683309 00000 n 
-0000683460 00000 n 
-0000683611 00000 n 
-0000683761 00000 n 
-0000683912 00000 n 
-0000684062 00000 n 
-0000684211 00000 n 
-0000684362 00000 n 
-0000684512 00000 n 
-0000684663 00000 n 
-0000684814 00000 n 
-0000684965 00000 n 
-0000685116 00000 n 
-0000685266 00000 n 
-0000685417 00000 n 
-0000685568 00000 n 
-0000685718 00000 n 
-0000685869 00000 n 
-0000686020 00000 n 
-0000686170 00000 n 
-0000686320 00000 n 
-0000686471 00000 n 
-0000686621 00000 n 
-0000686771 00000 n 
-0000686920 00000 n 
-0000687069 00000 n 
-0000687219 00000 n 
-0000687369 00000 n 
-0000687520 00000 n 
-0000687670 00000 n 
-0000687821 00000 n 
-0000687972 00000 n 
-0000688123 00000 n 
-0000688273 00000 n 
-0000688424 00000 n 
-0000688574 00000 n 
-0000688725 00000 n 
-0000688875 00000 n 
-0000689024 00000 n 
-0000689174 00000 n 
-0000689323 00000 n 
-0000689471 00000 n 
-0000689622 00000 n 
-0000689773 00000 n 
-0000689924 00000 n 
-0000690075 00000 n 
-0000690226 00000 n 
-0000690375 00000 n 
-0000690525 00000 n 
-0000690676 00000 n 
-0000690827 00000 n 
-0000690977 00000 n 
-0000691128 00000 n 
-0000691279 00000 n 
-0000691429 00000 n 
-0000691580 00000 n 
-0000691731 00000 n 
-0000691882 00000 n 
-0000692033 00000 n 
-0000692184 00000 n 
-0000692335 00000 n 
-0000692486 00000 n 
-0000692636 00000 n 
-0000692787 00000 n 
-0000692938 00000 n 
-0000693089 00000 n 
-0000693240 00000 n 
-0000693391 00000 n 
-0000693542 00000 n 
-0000693693 00000 n 
-0000693842 00000 n 
-0000693993 00000 n 
-0000694143 00000 n 
-0000694294 00000 n 
-0000694444 00000 n 
-0000694594 00000 n 
-0000694745 00000 n 
-0000694895 00000 n 
-0000695046 00000 n 
-0000695195 00000 n 
-0000695346 00000 n 
-0000695496 00000 n 
-0000695646 00000 n 
-0000695797 00000 n 
-0000695948 00000 n 
-0000696099 00000 n 
-0000696250 00000 n 
-0000696401 00000 n 
-0000696552 00000 n 
-0000696702 00000 n 
-0000696851 00000 n 
-0000696998 00000 n 
-0000699243 00000 n 
-0000697146 00000 n 
-0000697369 00000 n 
-0000681857 00000 n 
-0000680189 00000 n 
-0000697311 00000 n 
-0000699394 00000 n 
-0000699545 00000 n 
-0000699695 00000 n 
-0000699846 00000 n 
-0000699996 00000 n 
-0000700147 00000 n 
-0000700297 00000 n 
-0000700448 00000 n 
-0000700597 00000 n 
-0000700748 00000 n 
-0000700899 00000 n 
-0000701050 00000 n 
-0000701201 00000 n 
-0000701352 00000 n 
-0000701503 00000 n 
-0000701654 00000 n 
-0000701805 00000 n 
-0000701955 00000 n 
-0000702106 00000 n 
-0000702257 00000 n 
-0000702408 00000 n 
-0000702559 00000 n 
-0000702709 00000 n 
-0000702860 00000 n 
-0000703010 00000 n 
-0000703161 00000 n 
-0000703312 00000 n 
-0000703463 00000 n 
-0000703614 00000 n 
-0000703764 00000 n 
-0000703915 00000 n 
-0000704066 00000 n 
-0000704214 00000 n 
-0000704365 00000 n 
-0000704515 00000 n 
-0000704665 00000 n 
-0000704815 00000 n 
-0000704966 00000 n 
-0000705116 00000 n 
-0000705267 00000 n 
-0000705418 00000 n 
-0000705569 00000 n 
-0000705720 00000 n 
-0000705871 00000 n 
-0000706019 00000 n 
-0000706170 00000 n 
-0000706321 00000 n 
-0000706542 00000 n 
-0000698676 00000 n 
-0000697509 00000 n 
-0000706484 00000 n 
-0000706669 00000 n 
-0000706695 00000 n 
-0000707163 00000 n 
-0000707467 00000 n 
-0000707628 00000 n 
-0000707755 00000 n 
-0000708191 00000 n 
-0000708518 00000 n 
-0000708645 00000 n 
-0000708672 00000 n 
-0000709141 00000 n 
-0000978674 00000 n 
-0000709405 00000 n 
-0000709877 00000 n 
-0000709997 00000 n 
-0000710035 00000 n 
-0000710387 00000 n 
-0000710832 00000 n 
-0000711308 00000 n 
-0000711784 00000 n 
-0000712216 00000 n 
-0000712592 00000 n 
-0000713167 00000 n 
-0000713810 00000 n 
-0000714508 00000 n 
-0000714552 00000 n 
-0000714870 00000 n 
-0000715223 00000 n 
-0000722233 00000 n 
-0000722465 00000 n 
-0000732201 00000 n 
-0000732483 00000 n 
-0000739626 00000 n 
-0000739861 00000 n 
-0000748032 00000 n 
-0000748262 00000 n 
-0000756872 00000 n 
-0000757106 00000 n 
-0000764804 00000 n 
-0000765061 00000 n 
-0000777350 00000 n 
-0000777636 00000 n 
-0000786986 00000 n 
-0000787232 00000 n 
-0000797005 00000 n 
-0000797266 00000 n 
-0000807351 00000 n 
-0000807619 00000 n 
-0000815593 00000 n 
-0000815891 00000 n 
-0000824141 00000 n 
-0000824415 00000 n 
-0000831487 00000 n 
-0000831720 00000 n 
-0000839631 00000 n 
-0000839887 00000 n 
-0000847443 00000 n 
-0000847692 00000 n 
-0000855146 00000 n 
-0000855375 00000 n 
-0000858628 00000 n 
-0000858847 00000 n 
-0000875243 00000 n 
-0000875733 00000 n 
-0000886331 00000 n 
-0000886687 00000 n 
-0000900382 00000 n 
-0000900834 00000 n 
-0000909269 00000 n 
-0000909567 00000 n 
-0000916631 00000 n 
-0000916989 00000 n 
-0000934175 00000 n 
-0000934643 00000 n 
-0000939751 00000 n 
-0000939996 00000 n 
-0000960639 00000 n 
-0000961212 00000 n 
-0000978202 00000 n 
-0000985418 00000 n 
-0000985538 00000 n 
-0000985664 00000 n 
-0000985790 00000 n 
-0000985873 00000 n 
-0000992603 00000 n 
-0000992869 00000 n 
-0000993658 00000 n 
-0000994382 00000 n 
-0000995151 00000 n 
-0000995920 00000 n 
-0000996604 00000 n 
-0000997307 00000 n 
-0000998076 00000 n 
-0000998775 00000 n 
-0000999544 00000 n 
-0001000191 00000 n 
-0001000960 00000 n 
-0001001697 00000 n 
-0001002410 00000 n 
-0001003195 00000 n 
-0001003859 00000 n 
-0001004675 00000 n 
-0001005547 00000 n 
-0001006382 00000 n 
-0001007204 00000 n 
-0001008069 00000 n 
-0001008844 00000 n 
-0001009693 00000 n 
-0001010502 00000 n 
-0001011192 00000 n 
-0001011953 00000 n 
-0001012714 00000 n 
-0001013475 00000 n 
-0001014236 00000 n 
-0001014935 00000 n 
-0001015675 00000 n 
-0001016436 00000 n 
-0001017197 00000 n 
-0001017958 00000 n 
-0001018719 00000 n 
-0001019433 00000 n 
-0001020218 00000 n 
-0001020967 00000 n 
-0001021832 00000 n 
-0001022697 00000 n 
-0001023487 00000 n 
-0001024252 00000 n 
-0001025261 00000 n 
-0001026210 00000 n 
-0001027042 00000 n 
-0001027859 00000 n 
-0001028641 00000 n 
-0001029317 00000 n 
-0001030062 00000 n 
-0001030807 00000 n 
-0001031552 00000 n 
-0001032297 00000 n 
-0001033042 00000 n 
-0001033787 00000 n 
-0001034532 00000 n 
-0001035277 00000 n 
-0001036022 00000 n 
-0001036767 00000 n 
-0001037512 00000 n 
-0001038257 00000 n 
-0001038942 00000 n 
-0001039681 00000 n 
-0001040523 00000 n 
-0001041262 00000 n 
-0001042001 00000 n 
-0001042694 00000 n 
-0001043406 00000 n 
-0001044260 00000 n 
-0001045137 00000 n 
-0001045740 00000 n 
-0001045938 00000 n 
-0001046112 00000 n 
-0001046282 00000 n 
-0001046453 00000 n 
-0001046625 00000 n 
-0001046802 00000 n 
-0001046977 00000 n 
-0001047154 00000 n 
-0001047329 00000 n 
-0001047506 00000 n 
-0001047680 00000 n 
-0001047854 00000 n 
-0001048031 00000 n 
-0001048206 00000 n 
-0001048383 00000 n 
-0001048558 00000 n 
-0001048735 00000 n 
-0001048945 00000 n 
-0001049218 00000 n 
-0001049493 00000 n 
-0001049769 00000 n 
-0001050042 00000 n 
-0001050315 00000 n 
-0001050588 00000 n 
-0001050861 00000 n 
-0001051138 00000 n 
-0001051419 00000 n 
-0001051699 00000 n 
-0001051980 00000 n 
-0001052259 00000 n 
-0001052538 00000 n 
-0001052819 00000 n 
-0001053099 00000 n 
-0001053380 00000 n 
-0001053651 00000 n 
-0001053916 00000 n 
-0001054146 00000 n 
-0001054358 00000 n 
-0001054561 00000 n 
-0001054763 00000 n 
-0001054966 00000 n 
-0001055171 00000 n 
-0001055377 00000 n 
-0001055586 00000 n 
-0001055793 00000 n 
-0001056002 00000 n 
-0001056209 00000 n 
-0001056418 00000 n 
-0001056625 00000 n 
-0001056834 00000 n 
-0001057041 00000 n 
-0001057250 00000 n 
-0001057456 00000 n 
-0001057658 00000 n 
-0001057840 00000 n 
-0001058050 00000 n 
-0001058293 00000 n 
-0001058534 00000 n 
-0001058777 00000 n 
-0001059018 00000 n 
-0001059261 00000 n 
-0001059501 00000 n 
-0001059741 00000 n 
-0001059984 00000 n 
-0001060218 00000 n 
-0001060439 00000 n 
-0001060725 00000 n 
-0001061014 00000 n 
-0001061300 00000 n 
-0001061589 00000 n 
-0001061876 00000 n 
-0001062165 00000 n 
-0001062453 00000 n 
-0001062742 00000 n 
-0001063031 00000 n 
-0001063319 00000 n 
-0001063608 00000 n 
-0001063892 00000 n 
-0001064143 00000 n 
-0001064334 00000 n 
-0001064525 00000 n 
-0001064718 00000 n 
-0001064910 00000 n 
-0001065099 00000 n 
-0001065283 00000 n 
-0001065468 00000 n 
-0001065652 00000 n 
-0001065837 00000 n 
-0001066021 00000 n 
-0001066206 00000 n 
-0001066390 00000 n 
-0001066575 00000 n 
-0001066758 00000 n 
-0001066941 00000 n 
-0001067126 00000 n 
-0001067310 00000 n 
-0001067495 00000 n 
-0001067679 00000 n 
-0001067864 00000 n 
-0001067969 00000 n 
-0001068159 00000 n 
-0001068417 00000 n 
-0001068694 00000 n 
-0001068980 00000 n 
-0001069192 00000 n 
-0001069464 00000 n 
-0001069726 00000 n 
-0001070017 00000 n 
-0001070275 00000 n 
-0001070533 00000 n 
-0001070767 00000 n 
-0001070964 00000 n 
-0001071080 00000 n 
-0001071196 00000 n 
-0001071325 00000 n 
-0001071467 00000 n 
-0001071609 00000 n 
-0001071742 00000 n 
-0001071866 00000 n 
-0001071990 00000 n 
-0001072119 00000 n 
-0001072253 00000 n 
-0001072392 00000 n 
-0001072535 00000 n 
-0001072667 00000 n 
-0001072786 00000 n 
-0001072904 00000 n 
-0001073021 00000 n 
-0001073103 00000 n 
-0001073297 00000 n 
-0001073489 00000 n 
-0001073609 00000 n 
-0001073743 00000 n 
-0001073865 00000 n 
-0001073975 00000 n 
-0001074015 00000 n 
-0001074196 00000 n 
-trailer
-<< /Size 3609
-/Root 3607 0 R
-/Info 3608 0 R
-/ID [<DE553E4317349B5BF03E76CE8005525C> <DE553E4317349B5BF03E76CE8005525C>] >>
-startxref
-1074523
-%%EOF
diff --git a/doc/ppl-user-java-interface-1.0.ps.gz b/doc/ppl-user-java-interface-1.0.ps.gz
deleted file mode 100644
index 89f8918..0000000
Binary files a/doc/ppl-user-java-interface-1.0.ps.gz and /dev/null differ
diff --git a/doc/ppl-user-java-interface-1.1pre8-html.tar.gz b/doc/ppl-user-java-interface-1.1pre8-html.tar.gz
new file mode 100644
index 0000000..64c9fd8
Binary files /dev/null and b/doc/ppl-user-java-interface-1.1pre8-html.tar.gz differ
diff --git a/doc/ppl-user-java-interface-1.1pre8.pdf b/doc/ppl-user-java-interface-1.1pre8.pdf
new file mode 100644
index 0000000..dd75660
--- /dev/null
+++ b/doc/ppl-user-java-interface-1.1pre8.pdf
@@ -0,0 +1,26401 @@
+%PDF-1.4
+%����
+1 0 obj
+<< /S /GoTo /D (section.1) >>
+endobj
+4 0 obj
+(\376\377\000M\000a\000i\000n\000\040\000P\000a\000g\000e)
+endobj
+5 0 obj
+<< /S /GoTo /D (section.2) >>
+endobj
+8 0 obj
+(\376\377\000G\000N\000U\000\040\000G\000e\000n\000e\000r\000a\000l\000\040\000P\000u\000b\000l\000i\000c\000\040\000L\000i\000c\000e\000n\000s\000e)
+endobj
+9 0 obj
+<< /S /GoTo /D (section.3) >>
+endobj
+12 0 obj
+(\376\377\000G\000N\000U\000\040\000F\000r\000e\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000L\000i\000c\000e\000n\000s\000e)
+endobj
+13 0 obj
+<< /S /GoTo /D (section.4) >>
+endobj
+16 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+17 0 obj
+<< /S /GoTo /D (subsection.4.1) >>
+endobj
+20 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000s)
+endobj
+21 0 obj
+<< /S /GoTo /D (section.5) >>
+endobj
+24 0 obj
+(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000I\000n\000d\000e\000x)
+endobj
+25 0 obj
+<< /S /GoTo /D (subsection.5.1) >>
+endobj
+28 0 obj
+(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000L\000i\000s\000t)
+endobj
+29 0 obj
+<< /S /GoTo /D (section.6) >>
+endobj
+32 0 obj
+(\376\377\000H\000i\000e\000r\000a\000r\000c\000h\000i\000c\000a\000l\000\040\000I\000n\000d\000e\000x)
+endobj
+33 0 obj
+<< /S /GoTo /D (subsection.6.1) >>
+endobj
+36 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000H\000i\000e\000r\000a\000r\000c\000h\000y)
+endobj
+37 0 obj
+<< /S /GoTo /D (section.7) >>
+endobj
+40 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000I\000n\000d\000e\000x)
+endobj
+41 0 obj
+<< /S /GoTo /D (subsection.7.1) >>
+endobj
+44 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000L\000i\000s\000t)
+endobj
+45 0 obj
+<< /S /GoTo /D (section.8) >>
+endobj
+48 0 obj
+(\376\377\000M\000o\000d\000u\000l\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+49 0 obj
+<< /S /GoTo /D (subsection.8.1) >>
+endobj
+52 0 obj
+(\376\377\000J\000a\000v\000a\000\040\000L\000a\000n\000g\000u\000a\000g\000e\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e)
+endobj
+53 0 obj
+<< /S /GoTo /D (section.9) >>
+endobj
+56 0 obj
+(\376\377\000N\000a\000m\000e\000s\000p\000a\000c\000e\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+57 0 obj
+<< /S /GoTo /D (subsection.9.1) >>
+endobj
+60 0 obj
+(\376\377\000P\000a\000c\000k\000a\000g\000e\000\040\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y)
+endobj
+61 0 obj
+<< /S /GoTo /D (section.10) >>
+endobj
+64 0 obj
+(\376\377\000C\000l\000a\000s\000s\000\040\000D\000o\000c\000u\000m\000e\000n\000t\000a\000t\000i\000o\000n)
+endobj
+65 0 obj
+<< /S /GoTo /D (subsection.10.1) >>
+endobj
+68 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+69 0 obj
+<< /S /GoTo /D (subsection.10.2) >>
+endobj
+72 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000A\000r\000t\000i\000f\000i\000c\000i\000a\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000S\000e\000q\000u\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+73 0 obj
+<< /S /GoTo /D (subsection.10.3) >>
+endobj
+76 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000o\000u\000n\000d\000e\000d\000\137\000I\000n\000t\000e\000g\000e\000r\000\137\000T\000y\000p\000e\000\137\000O\000v\000e\000r\000f\000l\000o\000w\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+77 0 obj
+<< /S /GoTo /D (subsection.10.4) >>
+endobj
+80 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000o\000u\000n\000d\000e\000d\000\137\000I\000n\000t\000e\000g\000e\000r\000\137\000T\000y\000p\000e\000\137\000R\000e\000p\000r\000e\000s\000e\000n\000t\000a\000t\000i\000o\000n\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+81 0 obj
+<< /S /GoTo /D (subsection.10.5) >>
+endobj
+84 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000o\000u\000n\000d\000e\000d\000\137\000I\000n\000t\000e\000g\000e\000r\000\137\000T\000y\000p\000e\000\137\000W\000i\000d\000t\000h\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+85 0 obj
+<< /S /GoTo /D (subsection.10.6) >>
+endobj
+88 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000B\000y\000\137\000R\000e\000f\000e\000r\000e\000n\000c\000e\000<\000\040\000T\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+89 0 obj
+<< /S /GoTo /D (subsection.10.7) >>
+endobj
+92 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+93 0 obj
+<< /S /GoTo /D (subsection.10.8) >>
+endobj
+96 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000e\000f\000f\000i\000c\000i\000e\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+97 0 obj
+<< /S /GoTo /D (subsection.10.9) >>
+endobj
+100 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000m\000p\000l\000e\000x\000i\000t\000y\000\137\000C\000l\000a\000s\000s\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+101 0 obj
+<< /S /GoTo /D (subsection.10.10) >>
+endobj
+104 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+105 0 obj
+<< /S /GoTo /D (subsection.10.11) >>
+endobj
+108 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000g\000r\000u\000e\000n\000c\000e\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+109 0 obj
+<< /S /GoTo /D (subsection.10.12) >>
+endobj
+112 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+113 0 obj
+<< /S /GoTo /D (subsection.10.13) >>
+endobj
+116 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+117 0 obj
+<< /S /GoTo /D (subsection.10.14) >>
+endobj
+120 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000N\000a\000m\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+121 0 obj
+<< /S /GoTo /D (subsection.10.15) >>
+endobj
+124 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000V\000a\000l\000u\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+125 0 obj
+<< /S /GoTo /D (subsection.10.16) >>
+endobj
+128 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000D\000e\000g\000e\000n\000e\000r\000a\000t\000e\000\137\000E\000l\000e\000m\000e\000n\000t\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+129 0 obj
+<< /S /GoTo /D (subsection.10.17) >>
+endobj
+132 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000D\000o\000m\000a\000i\000n\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+133 0 obj
+<< /S /GoTo /D (subsection.10.18) >>
+endobj
+136 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+137 0 obj
+<< /S /GoTo /D (subsection.10.19) >>
+endobj
+140 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+141 0 obj
+<< /S /GoTo /D (subsection.10.20) >>
+endobj
+144 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000T\000y\000p\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+145 0 obj
+<< /S /GoTo /D (subsection.10.21) >>
+endobj
+148 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+149 0 obj
+<< /S /GoTo /D (subsection.10.22) >>
+endobj
+152 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000S\000y\000s\000t\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+153 0 obj
+<< /S /GoTo /D (subsection.10.23) >>
+endobj
+156 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000G\000r\000i\000d\000\137\000G\000e\000n\000e\000r\000a\000t\000o\000r\000\137\000T\000y\000p\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+157 0 obj
+<< /S /GoTo /D (subsection.10.24) >>
+endobj
+160 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000I\000n\000v\000a\000l\000i\000d\000\137\000A\000r\000g\000u\000m\000e\000n\000t\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+161 0 obj
+<< /S /GoTo /D (subsection.10.25) >>
+endobj
+164 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000I\000O\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+165 0 obj
+<< /S /GoTo /D (subsection.10.26) >>
+endobj
+168 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000e\000n\000g\000t\000h\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+169 0 obj
+<< /S /GoTo /D (subsection.10.27) >>
+endobj
+172 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+173 0 obj
+<< /S /GoTo /D (subsection.10.28) >>
+endobj
+176 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000C\000o\000e\000f\000f\000i\000c\000i\000e\000n\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+177 0 obj
+<< /S /GoTo /D (subsection.10.29) >>
+endobj
+180 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000D\000i\000f\000f\000e\000r\000e\000n\000c\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+181 0 obj
+<< /S /GoTo /D (subsection.10.30) >>
+endobj
+184 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000S\000u\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+185 0 obj
+<< /S /GoTo /D (subsection.10.31) >>
+endobj
+188 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000T\000i\000m\000e\000s\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+189 0 obj
+<< /S /GoTo /D (subsection.10.32) >>
+endobj
+192 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000U\000n\000a\000r\000y\000\137\000M\000i\000n\000u\000s\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+193 0 obj
+<< /S /GoTo /D (subsection.10.33) >>
+endobj
+196 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000i\000n\000e\000a\000r\000\137\000E\000x\000p\000r\000e\000s\000s\000i\000o\000n\000\137\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+197 0 obj
+<< /S /GoTo /D (subsection.10.34) >>
+endobj
+200 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000L\000o\000g\000i\000c\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+201 0 obj
+<< /S /GoTo /D (subsection.10.35) >>
+endobj
+204 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+205 0 obj
+<< /S /GoTo /D (subsection.10.36) >>
+endobj
+208 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000M\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000S\000t\000a\000t\000u\000s\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+209 0 obj
+<< /S /GoTo /D (subsection.10.37) >>
+endobj
+212 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000O\000p\000t\000i\000m\000i\000z\000a\000t\000i\000o\000n\000\137\000M\000o\000d\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+213 0 obj
+<< /S /GoTo /D (subsection.10.38) >>
+endobj
+216 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000O\000v\000e\000r\000f\000l\000o\000w\000\137\000E\000r\000r\000o\000r\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+217 0 obj
+<< /S /GoTo /D (subsection.10.39) >>
+endobj
+220 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000a\000i\000r\000<\000\040\000K\000,\000\040\000V\000\040\000>\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+221 0 obj
+<< /S /GoTo /D (subsection.10.40) >>
+endobj
+224 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000a\000r\000m\000a\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000L\000i\000b\000r\000a\000r\000y\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+225 0 obj
+<< /S /GoTo /D (subsection.10.41) >>
+endobj
+228 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000a\000r\000t\000i\000a\000l\000\137\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+229 0 obj
+<< /S /GoTo /D (subsection.10.42) >>
+endobj
+232 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000D\000e\000c\000i\000s\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+233 0 obj
+<< /S /GoTo /D (subsection.10.43) >>
+endobj
+236 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+237 0 obj
+<< /S /GoTo /D (subsection.10.44) >>
+endobj
+240 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000N\000a\000m\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+241 0 obj
+<< /S /GoTo /D (subsection.10.45) >>
+endobj
+244 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000C\000o\000n\000t\000r\000o\000l\000\137\000P\000a\000r\000a\000m\000e\000t\000e\000r\000\137\000V\000a\000l\000u\000e\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+245 0 obj
+<< /S /GoTo /D (subsection.10.46) >>
+endobj
+248 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000P\000r\000o\000b\000l\000e\000m\000\137\000S\000t\000a\000t\000u\000s\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+249 0 obj
+<< /S /GoTo /D (subsection.10.47) >>
+endobj
+252 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000S\000o\000l\000u\000t\000i\000o\000n\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+253 0 obj
+<< /S /GoTo /D (subsection.10.48) >>
+endobj
+256 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000I\000P\000\137\000T\000r\000e\000e\000\137\000N\000o\000d\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+257 0 obj
+<< /S /GoTo /D (subsection.10.49) >>
+endobj
+260 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+261 0 obj
+<< /S /GoTo /D (subsection.10.50) >>
+endobj
+264 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000i\000n\000t\000s\000e\000t\000\137\000P\000o\000w\000e\000r\000s\000e\000t\000\137\000C\000\137\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\137\000I\000t\000e\000r\000a\000t\000o\000r\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+265 0 obj
+<< /S /GoTo /D (subsection.10.51) >>
+endobj
+268 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000l\000y\000\137\000C\000o\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+269 0 obj
+<< /S /GoTo /D (subsection.10.52) >>
+endobj
+272 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000l\000y\000\137\000G\000e\000n\000\137\000R\000e\000l\000a\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+273 0 obj
+<< /S /GoTo /D (subsection.10.53) >>
+endobj
+276 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000P\000o\000l\000y\000h\000e\000d\000r\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+277 0 obj
+<< /S /GoTo /D (subsection.10.54) >>
+endobj
+280 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000R\000e\000l\000a\000t\000i\000o\000n\000\137\000S\000y\000m\000b\000o\000l\000\040\000E\000n\000u\000m\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+281 0 obj
+<< /S /GoTo /D (subsection.10.55) >>
+endobj
+284 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000T\000i\000m\000e\000o\000u\000t\000\137\000E\000x\000c\000e\000p\000t\000i\000o\000n\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+285 0 obj
+<< /S /GoTo /D (subsection.10.56) >>
+endobj
+288 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000V\000a\000r\000i\000a\000b\000l\000e\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+289 0 obj
+<< /S /GoTo /D (subsection.10.57) >>
+endobj
+292 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000V\000a\000r\000i\000a\000b\000l\000e\000\137\000S\000t\000r\000i\000n\000g\000i\000f\000i\000e\000r\000\040\000I\000n\000t\000e\000r\000f\000a\000c\000e\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+293 0 obj
+<< /S /GoTo /D (subsection.10.58) >>
+endobj
+296 0 obj
+(\376\377\000p\000a\000r\000m\000a\000\137\000p\000o\000l\000y\000h\000e\000d\000r\000a\000\137\000l\000i\000b\000r\000a\000r\000y\000.\000V\000a\000r\000i\000a\000b\000l\000e\000s\000\137\000S\000e\000t\000\040\000C\000l\000a\000s\000s\000\040\000R\000e\000f\000e\000r\000e\000n\000c\000e)
+endobj
+297 0 obj
+<< /S /GoTo /D (subsubsection.10.58.1) >>
+endobj
+300 0 obj
+(\376\377\000I\000n\000d\000e\000x)
+endobj
+301 0 obj
+<< /S /GoTo /D [302 0 R  /Fit ] >>
+endobj
+305 0 obj <<
+/Length 1277      
+/Filter /FlateDecode
+>>
+stream
+x��WIs�6��W��)5c"X.�%�Z{�k�=4��!�-��(��}X$Q	ݦ�u<#�{��H�
pp}���I�$��!L� f
�Es��	F
�ilU�k{����n\t'?���(�Y�f��'��x�Q��`�
H�#"�D�O��p�����Yx?�q(lx؈��㰫�+��&���M�p[�f8�N��o�:�$g�I��N��?&`vw]��F�
���R-'`G�Zb9��cC��T�gzw�N�Ɓ��͍WW@��:����S$����o3�z
���
1�\�H�w�
[��ꫮu��������h�Ĥ�ň'��y�b�՝3r&�V�XZ#1	Rpc��$�c���T�1��
�Ϭ��t�� GxX��
rϟ��
AL�3:D�4���(��1�e+=ȯb�2�ʺ
#3�j���lj%(��fꋭ��bDh>$�y�P�RB!]
%��i��ѫ
R|�[<�v��:3��������޽���oM+�Y�l���$Py
+�:�A����i���4qU���s�LP���u��K�GL͢��]W�7h
>��t��[	/^Hi
+�f�Z(]o��߬ם���+m�E���me��Ä�&�^�[��9�Е<�W7o�բ����yZ8����XyT��,�;2�&���n���l��CJ��FI���s�^וs�
����&�!d�˲�*z0��*�����lK��0[�I���Fw��ӹW]�D�tΥ�@�L��غ���J8s�
6��j���C|v��3��'v
c�zsi��F���m�e�;�6`Fz޵ZuutUw&��N:mE��Cp������e�l��	ԃ������4f� z���ڪ-��e�v�5�9�^��p��f����BU�C��Ӻ�T�W�hf�yO���n��x�4|�K��nS몗��.g
wXz�Mi������l���9�1�Ko�	!�hX8_�Ѷ4ĩЃ�3�d�V�
��L��C?q>RFFz\FjF	Ĵ���)�ނ��-��.
/�g�/�A��]!j'��
+���mL����[�g�
a	�/kш��x�-�����C{ۓ5N;��/���_bQ{�}7�1?�|3�ȿM�g2�͠MP�����1C9���4^�w�x]�h�V�Z�@�J�:�
iFp#[��e
�A�Ǖ�

�1��o4�$<�{�T
��X?^�.�^;A��1‘�r �����E%�
+�3^/L�o�^�%*����@��^r�zW��Dki��~�� _�9="�y���d@,��;������s�O�� �#R

+endstream
+endobj
+302 0 obj <<
+/Type /Page
+/Contents 305 0 R
+/Resources 304 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 313 0 R
+>> endobj
+303 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/ppl_logo.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 314 0 R
+/BBox [0 0 640 829]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 315 0 R
+>>>>
+/Length 2688
+/Filter /FlateDecode
+>>
+stream
+x�m�K�#�
D�ZEm�4	�
{�(�#�sD��'�*�>��j�V��L��ǑS9���������9����qӸל�i�Қǟ�>�u��V���)�2k�%[�׍�jk
e���<F��bȣ��u��5�ID���q�^��%�R��ˬ���|�T�4��yԮ������hYϔc�ԭ��V�»�>�������������J�k�>�si���3�4���Hݏ��{�l��V����^.&ϩ�<&;�����u��I
@����Z�KD�P���\�i����s|��R4�h}�9��艥����b\K��؆��j�ik�L���=�̸�"ؼZI��(	���%s6W���+�y�1�H')�ql�
��g���y�Qs�_7������/�;ji�y�'x���k%_�J>8{w@�wv�NQȁ�l�=("JY�s����Iy
ǹ�k�S���+���}hk�>"���Rd�'n$�4��
�įGh
�Y�ϲ����Ȭbeh&f������3(0Ϝw�9��Б ��‘�^@�A}� �T�4D�߶V�?5�$��[e��!�f�b[�l��E�4����Y4�9p��	���n<���
��9;�D4%�q�+^�kK��%��9�5��|?ĝS�Ī��@.�"�A���T�5&�%^�n59:�/H��(%�~����a	Z=�d�I��fJ+�^+�︌�B2X����#ѥ�S�����0V[-NS� �(b&�C��*�s�

��*d�K
��5ɫ�6�؄KC�hz�4��)�
�y� DF^Akz�\3W��m9�`����@�l:�MYe��B�:x6+b� h�6$sܨ��W�Z�^,����Ddx&hI���
��$�a"q���
�:��RSH�2<Z<�H�r{v%��.W次�8��?�BJ6
b�H4
,Fߎ� �Ԛ�������2��B�Z�	�.Ŋ�>@��񸵊��d�J�
�S����Q��ufG�.-�+���]��ҢxR�ِNV1�0	K��r�ہ�
��.�Q�<��͙N��*7b�_<��6���G"Cd�t�6 D�x�RkT����`; F'���́�����Gy����.C��EK�+��
(�eC�K8T�2�Q)� [...]
���B[�}��T�<��W��Z�.q[C�T"WCNҵ�e;WCk��KC�CV �E���*!��h�n�o�v������"?�1˪���롋q� vZ��K�	��.����_�6=:�+Ң�y�����
���K�4zx��
�L�ť���IoOCE
;Q6M�`]�����TD��s��E��a�,|ʙd9�Iङ��CK-���{|�׎�Aг�=GD�~W�#�J�6l=��W#,�8�$���9G�=UT�����o	���2+�S�2��Q{��u���QnU=�Qc����0Wv�b�0�����J
�QK
Ց7�4<�U��
�Sz
�j}��RdJ-��U"�
Yl���U-��q"N)����I�+�F�ۜ+����Ӽ
��M�תoÂ���l6����Q�j�q�'���}BR�
PKǧ��ѓ�%2V����,^��
j�b�K����L�N͙
�q����MW��.�P��W$������
+D���5G�\����84I���$�h<u�k�L59�0%Q��)�FX�C��ӻ�
�����
���a:׊]G'�u
��Z��B�^LE��e����Z7D�C���c�I��
U��]��iQ8s�2��*'��X�"���h6b�B��k���L2(:����I�1�s�˹�����{�uo:�k�%�.�k[��x�R�����u�
�<�����-�o�ͻ�m���

�	x���}�H�e�.��XD
�8r�D��\�%#
����k�6
%o؁zW>
 ><�ϸ�x�G���/�#�"pb:�h]�F��7��>��KHݗT��r�kwت �ӠD���Ւy��K���կ���,�G��C�Ss|��<g��uo?�������K@�
��	4�ͺ'��)�$&O:3
��.��[�G�¸���E�;{
��*����Kw�-K���T@�O���+LH�㛃��ӊwĪfgh*�� Mj�TV���F1�k
I
�?5ڮ����åےT�ѻP.d�wѩ/��"\G�
���
��G"�
�u��+��t�bg��[����pS�jeg)s_�螢bM��R
-εQo��
}� ���������@1n�M͢
���6"�-lW�Z7U���
;���mD+�|G�F��Z��@
����Q�5����(g�`R���X�6T�����.��|��6���ч��
�?��3
o���3��� m�B ��MY:c�q�P}E'�-2���
+@!S#����s����I���U$ZJZ$��\!X��P8���+�x^�|�f�:��d|?@__��h���^�a9��n]چ�*5s|Y��E���v_�#^��[�/�s͢O��
�?v�s`\�ؿ��^X{��~Ej�aW�K/Tz�
����Z���\��j�
|��>�?��a��x(~?�B�
<q����
T��5F#��
�s�B�
+����[���N��o�ِW]r�a'tܯ�_�|�"�8w�VۥDD�#��n���f���?�
�
+endstream
+endobj
+314 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100336+01'00')
+/ModDate (D:20111106100336+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+315 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+306 0 obj <<
+/D [302 0 R /XYZ 89 770.89 null]
+>> endobj
+307 0 obj <<
+/D [302 0 R /XYZ 90 721.073 null]
+>> endobj
+304 0 obj <<
+/Font << /F58 308 0 R /F24 309 0 R /F41 310 0 R /F42 311 0 R /F60 312 0 R >>
+/XObject << /Im1 303 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+318 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+317 0 obj <<
+/Type /Page
+/Contents 318 0 R
+/Resources 316 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 313 0 R
+>> endobj
+319 0 obj <<
+/D [317 0 R /XYZ 89 770.89 null]
+>> endobj
+316 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+330 0 obj <<
+/Length 1562      
+/Filter /FlateDecode
+>>
+stream
+xڝWK��6
��W�Vif-���J/�n�������L��,Ӷ&��Hr���
�-{���'� � >>�����й�wz��b7Eh��V��.�����ZY�m��:��;�;
�1�[1����V��|�ʬ��[������v�/<sk�����.öK4Ź�99�+�g�s�m�������%�_��8�r)����m�)�*ѫX����-��C��+'l7k@�qOQ\�A�S�9Ӿ=�����1�*?��6��M��t��Z7-wg�#7>��o��֮������uZeK���V1qx`'�NovR��[�2{g�*��O�L&c�잹ֻ��j��uVN׃`1
7UR4r�nc����9a`� ��۫�n D��F�ZR�zeE�\e�g����~�&�?+Ym����r�>�q��qA��J�k�|��'�ڗ��T���Yh��p�mY�G9w�0pd$&��&y�H������2��-�
+�K��E� `�,C�ޱ>+��f�y��&��ܣ�2C{ K�"�௨Է��f{m�B�٣��D,�[�D��g2E�5&#���UY4ݻ=�]� ��N�l���.t��mZa�I��M�o/mDmM�:]�8 ѱ��!�6r�فȩr4Q8��H��
+r~e�Yq���Kh��ɩZ�p���by��>�*ͪ�P�T��l-fZ�F`ڿ
+���c(
�
�ʍ��v�j(�ׇV,��&�|�>4��xD��BaKnP��A��Q糓�P��,d���R?A,�X"qL
L����l��
+,��X at E� ]�e?
���P7�
�M���|�4o1���x�&
�BY�k�(��:�|��<�Z����P �(8�g�
0R9ЄI/rU�h`�T�5�	89u��a�8��Wk��
��4$Fw����AB�1AB�}:0�;|��	�L�ؖ{iX�0���)�s��Z�P��!��L2M��F�wsR<~�\���`:
<�?9�P
���[��OY*fq-=���F�}� |[�1^��ġ
����;p������h�I+T4ޏ���LO>N��0�0S'd�|t��x��N>Ά.��I
���e����@��䭳OM�tw�qSI�i�,��k���4���&���&X
�!���!����N^�
f*� ,
mDE�e	���P-�H������p�����Y���ؐ��{ϭA��ha�5�	o�W���f�|��c톘�"u5i
���>�rs��0�h��l��D2/!p~k�mY7G�42�.�X����*b)���݁M��nSv!r-�
+�]�֬;�ϫ���9;]N���9����<p�Al�%7�u3�����W��6uo��{�8�~G�o$<憞o	_�^?���s��~�Tڴ��������_���tR�r��C1b7
����

� ��Ϳ,t�����Av���9�O$�k���R()6�d#M��
�V�j֢��/�	�ߙIqHZ���5�79�W�O���f��w���i�	�V� z��g��~�,�f�s��ή� ��Ce�I�� �#��:�D���e�
�(��
+endstream
+endobj
+329 0 obj <<
+/Type /Page
+/Contents 330 0 R
+/Resources 328 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 313 0 R
+/Annots [ 320 0 R 321 0 R 322 0 R 323 0 R 333 0 R 324 0 R 326 0 R ]
+>> endobj
+325 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/bugseng_logo.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 335 0 R
+/BBox [0 0 640 166]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 336 0 R
+>>>>
+/Length 1662
+/Filter /FlateDecode
+>>
+stream
+x�}W[�
7
��S�	��8F�
�c6���)R"��Y��Z��J$U��ʩ\Y��Ϗ�o��ۿ��|��r)�j5�hu�9��]^�<r9��m)S�M�:)��v��� j��a+%�z}
$�$�/�*i^�jjS.*s&,t���R�<+h�:��wݱ��)�Z��
i%�z-�{�
Q݆��V,�Y���W���I_���'�ԫq�"��
��'
�*���b.i��\O�>���%�h�&�Ȥ�~˄@�D���N���$�_�&a#��e�Uj�|[Q�^o��2o���îi!cZ�ף����
i����s4eW

E����݆��
�<+Z
I��P꽇�8Y�Ɨ��3����4�W)�����/r�]w��<�ʶ�q�<��~�t��
�_u)�V��Y�U�����
+����/ 8� &���Ua���j��Je��+%
+��̉�)i�U
�
�S���F_@��rG�T���HE�
nw�6[.�:�o��@r�������ЊCAT���F_�n�n��)|�d�Q��
H�i��?
�h=�8�8΍=U��UPC%Ӎ�.
��(R�ae*77=�󱁉�S�^�
+��3��j_
��
�Z�|>j�$�3�#a���>�׹2D���'N)�
�+ }��"��{�7��Aw�a���mŏ�
+FVCg��
�ԭ����)_����'�\G�^����\��1B��g��n�\ڠ�NY�
:��Yq�&�Fa�-��� B��S��f���7�G	#S���
٬7��E�� 9�D��M
+G
+�20��Ci�e�+������D�����ô b�~#����z�'�\.���F�է��]xv���i�@ I�8a�=�z[PjVkn��w|0S��t�h�m�ل֩�H�F��@0#����5�jN�1�-�R�F;p1jվ(�֙EHG´��i
�;i�`
 {��&4X��s[4�I�
d�!
޴r/^�a��@��Ƕ�?Zr�W��U��PǗ}2
��di8�ÍU���Q{?��b:���H��l�D��
�0ձ�vxk�ڱ�ʜ�

ו��^Y�"Ƃ۸���8�z��Hح�(;�����_۲h��a
�
+�e���f���hX�R�iqV`z��!��9s���}���g�z^���A�.a?�S�*To
+�W�h@�+V�C�`�x�k��a�<��]a�M�:r�#�`[�{���T�|�W��$̽�g����+�xآ%��
-$�*^*��w��+�M��M1����Q���o*Z6�P)�P�n�+T�`����jV�
+	�
+�,r ��U��W
O�qj�T�M�J�p/������5쐯�kC����u�%��u_(�@�3~Gvig\��W�A�^���j;+t,q�pLM{9i�I�s$��!w�tꡎ�+�!�HB�$���� ������d�_
d7e"�yξ��W��w$����+N�n�� 8�uXl���W(��DY6�~٭����Ȧ�<6��IJGfQ%?4�
�
��L+Bt���{1m�8�MS&L��r9=56*�Q�*�RȾ�{O�C=��P���Yb���
���h��k
9K,k�8�n#�f:Vl07�:��+��i�v,��~"[
�k�� :)��
z��U����3���b��X��?k���1�G���f��σo��?Q��B
+endstream
+endobj
+335 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100335+01'00')
+/ModDate (D:20111106100335+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+336 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+327 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (/home/roberto/tppl/../ppl/ppl/doc/ppl_logo_no_ppl.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 337 0 R
+/BBox [0 0 640 640]
+/Resources <<
+/ProcSet [ /PDF ]
+/ExtGState <<
+/R7 338 0 R
+>>>>
+/Length 2432
+/Filter /FlateDecode
+>>
+stream
+x�m�]�$7���y��%R����
+��C��s���ʬ��6
�Z��"#�d�u�Tά������ۿ����_G>K>{���gM^ο�8�s��(�czʥ����z���-U[�%�b�
9'cYSu��ó�T�*�^���δ��i��O/<��Y�J�8�|�6�i�G����T�2
�Q��R�RNk
]ΙϞ=��ǟ\�ۡ�Z��~��(�����YZ�<k�-����5k��Z��Q����~]7���Z
F���~��f��|����B5n��1�Sֈ�g
�
k+���㨥���h}�Sd�R�6{��X7S0�>��zʤ�@�����X�k���bq��x����e��2�ݒ9O�~&3y�-�qN�\Vy�V6����׍��}�p��
FX��k�0H
m֖F�uM@��办®�M쒑Rqp,�񶖕���y���W�2��
����:9FLs9o���n�	��S(v�A'{��� �\w|Q���҆�<i=ML�ZR�%��
+�&�
/81���L�n������``^I���*��g
��l���q��Ǘ�_� ������Q�Ov��vT�p���в8>���
d��o�ўAC�+���
b�8�$=��Zs����	~�4��ɓd�7^�ۣ�� X�~�����>�v��Я*�6[�h�b��h�G2o '
L4��dV2��?�i=�kq���@�7Ye�i���
�|G`ped�m��ڵ��\*'3�	
+�V/#�0�ۜ��!0�x/uA�N��ㄵ�"3 H�W�
v"젰aC"`� 6����{	�T�g��H]~!
b��S'����Z���>���]<ˀ����'
?��M��������
q�K�ؓc<1�c�3����x�h�H/r�ђ�'�
��(
���4��-0Y�~�BJ�1L��	�
^,t�����

"��bQ�N�b�3J"�� ����B	���
�����6\�h,�0pRٖ��Ѡ= Pz=�%�B�Mޑ�>ؙ�/1��
#��@ңvR��`r+pB���{Qo`
	@���_轁D^��j�J��H���(�B�3qy_�
�����G��K�cG� ��-TlFq�4T�G08��2�
�,E�
⃝VTD�
JY��&x;w+d�H\��)SU�t�����_!ԙ�q��P��h�[z
I��f�Q�M�sTQ؜���"�Ch&,�ɮ� ������M�k���C[�}���<��N�Ӑ7�}���C<;�d��./�F\KXS�>�"�
+}W,T&w�>8�[�����
+wx�_R�O;��{U�⑨���A��Wn�_N����#b��,���n~v�7�hI�W�{�Zw�LV1'�HI(6�;�C���
JBCFU$�=z����Ԝ�� ��8 ��{S�b�wH�g�Uk"�n�)[dA4ohw�@M�z�|��Z?��v#�քD�v��V�S"�Ed��
�5���:ND
,��	��{�!���}����?>'��+�S�2����mj� ��A�U=�Zf�wH�x�d��y�J����H#��� �Ҙ�
y�NP�'
b���#�U�
�\_j���D�[���</������r뤈J�o���jQ�e
+��3��˵O�yK�b���C���C�a��!쩨.6%g�'���Ս��@�/��4qS�@
bgS}w�}-���Cw#B�ZD�k�B�,&%U4�һbܴ������!'QE��n���	�� )�rO��1
h���m@��P�&�q��S��J��Yn��PxV��S;uc��D���z�S�_b
���-�]���8,�@GC�U���$�
zٲ�4w����L�@ԁ���SQ�H&�0�tJZ�*6�?�R���A��e� �!�0nI��-���R��ʵ� ĞƮ'*اq��n/���u�!m� 
����ss
 =��-
+ z�`�k�,�~�D�x�mC�`M�`�+_���x?�d�։U�uh�g}P�d�v-���q����:(��ڕ/�Ƿ�'��_�D�Q�fBc��/�fMj%�i���	%�8���U`�ԏ�a�l� 0v��s��DRn��h|�n�r��6pd�q�e�c�h�v0��Af�
���� ��jw-:��v��{�Њ$�&H��

�|��|�zL�w�zW|ׄ����_�N+��H�z)x_�{h ��\1Dz^ �Kc��!�aw�w�h
�(��.����
m��HA3À%�br�\�g�(���N�m��Ppn��
�88}�B?
+��?��"�`�����tu8��5���w\�S��i��h�R;�%{��.�L�
�
����3Lp	�rp
3Z[���&=K٣�E'h�>��o��4�	���^4�ѵlP���m�
�p#�י)ח�,�����M��ڮ5unT��7���*�G�F�Xjf%�A�H�K�;�4�ьw��
�JV��q��
<��d��������S2
�
+endstream
+endobj
+337 0 obj
+<<
+/Producer (GPL Ghostscript 8.71)
+/CreationDate (D:20111106100336+01'00')
+/ModDate (D:20111106100336+01'00')
+/Creator (cairo 1.8.10 \(http://cairographics.org\))
+>>
+endobj
+338 0 obj
+<<
+/Type /ExtGState
+/OPM 1
+>>
+endobj
+320 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [385.063 648.798 490.947 659.702]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
+>> endobj
+321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.426 626.945 322.585 635.792]
+/A << /S /GoTo /D (GFDL_GFDL) >>
+>> endobj
+322 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [231.464 595.308 337.877 606.212]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.fsf.org)>>
+>> endobj
+323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [440.112 583.353 513.996 594.257]
+/A << /S /GoTo /D (GPL_GPL) >>
+>> endobj
+333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 573.455 169.87 582.302]
+/A << /S /GoTo /D (GPL_GPL) >>
+>> endobj
+324 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [204.862 457.687 398.138 467.585]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com/products/ppl/)>>
+>> endobj
+326 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+331 0 obj <<
+/D [329 0 R /XYZ 89 770.89 null]
+>> endobj
+328 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im2 325 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+343 0 obj <<
+/Length 19        
+/Filter /FlateDecode
+>>
+stream
+x�3PHW0Pp�2�A c(�
+endstream
+endobj
+342 0 obj <<
+/Type /Page
+/Contents 343 0 R
+/Resources 341 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 313 0 R
+>> endobj
+344 0 obj <<
+/D [342 0 R /XYZ 89 770.89 null]
+>> endobj
+341 0 obj <<
+/ProcSet [ /PDF ]
+>> endobj
+393 0 obj <<
+/Length 1475      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6}�W��h�K�ә,���q�Xi�
��`���I*����H�@��N�'Q ��sν �3t�s�y�뜼����d�9�[G��S��
�������e����{�|���խ�l��:w
�ۀ뷩υӏ;7�3�ͯ
�c)���C���b�\w�ꀥ�@�c�P;}���I��"���ֲac���2
�t�VQ�2� �	���"
+�+7
���z��P��cN�}p�
+j��]�����Deḱ8�4����E�WI�d����Bw���(�l�U�A�*U�{����f,,�4�l�"A]��.�풖�t0
7�Γ����%��3.�Z�ؼr]�*>ж���6&}� �5�/C����u)��~��v/@��~�
!�ձ(	Y�9�h�*������t1"��Z�S��T_2w���ء?5?�ج��Hg�*��GQ��g�5�B�}4g3�_��<�M��<��?�]���C��$x��>��A~�{�w�J�UQN8�����. �}�b�_,(
����Ex��3x
z�_<Dݰ�0N�b���Be�U��P�p=��8zWBo }��r���Yk�r�Yk9�Z��Z��癸�0��`���Gj���8��S���O��iH������ܹQ?
�X;�A) ��b�{�� P?
+�A�t��LGo=ȹ�S�*S��x�>�(5�bêg2�
rp��Bc�X����"i

 {�Nu	0��[�jD=O �~���_�&�i�8-����i2��`�PZ�e���Ꝛd*_\A� |�$l<����;�<�hP���$�=��c�Ac&�q���p>'I��i[{�V?���ʭ��NNoE'§\����
�>`���ǚH�8��4�-s�
�~\5�%'��1w����M����2kՉ[�����뉚
bL�4"#���t�-*�9
R�I Sc�em�V��0���)�GWނhECp}�*6gCP�P�9Td5/�0��u�����l`+6��珰[�?7GL�Y�\���`�\�8;�"�/B ���
��
�Se���102�/���<a+Tp:V�l�6�ұx\����M঱���4��,8��W���BE��A3_�Aa �>%-R�]���ws�ɐ6dXgbyH�^����Xn���1,1{B�m��T[gY4v�}J�����G��w(7����*
+a{�־-��^��P�J�<)7��Ӛ����:(
V�ϻLT��'Ӥ�:k����Oj�̗�Ȥ�Pɰ�^��9���s�52)�.�D�%�rS8�'�
m�X�8�c�� �G<��?9d���~rX}j��[��X4_�S�|�W<j����E}aw"]5��U�������7a2m�����oNL�;��Y�{P�ƺ�kղXc��W�ǂhȇp�W=*�ɯ''���\ǥ�O����s��wo�Z$N�K��Ƹ:��o>[�)�>c�%Pkp�>�\��|b���پ�4����y�j]�
�/ [��
+endstream
+endobj
+392 0 obj <<
+/Type /Page
+/Contents 393 0 R
+/Resources 391 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 313 0 R
+/Annots [ 345 0 R 346 0 R 347 0 R 348 0 R 349 0 R 350 0 R 351 0 R 352 0 R 353 0 R 354 0 R 355 0 R 356 0 R 357 0 R 358 0 R 359 0 R 360 0 R 361 0 R 362 0 R 363 0 R 364 0 R 365 0 R 366 0 R 367 0 R 368 0 R 369 0 R 370 0 R 371 0 R 372 0 R 373 0 R 374 0 R 375 0 R 376 0 R 377 0 R 378 0 R 379 0 R 380 0 R 381 0 R 382 0 R 383 0 R 384 0 R 385 0 R 386 0 R 387 0 R 388 0 R 390 0 R ]
+>> endobj
+345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 685.699 151.499 696.578]
+/A << /S /GoTo /D (section.1) >>
+>> endobj
+346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 665.21 229.087 674.186]
+/A << /S /GoTo /D (section.2) >>
+>> endobj
+347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 642.818 252.131 651.794]
+/A << /S /GoTo /D (section.3) >>
+>> endobj
+348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 620.426 165.446 629.402]
+/A << /S /GoTo /D (section.4) >>
+>> endobj
+349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 608.395 173.686 617.242]
+/A << /S /GoTo /D (subsection.4.1) >>
+>> endobj
+350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 584.08 180.928 594.959]
+/A << /S /GoTo /D (section.5) >>
+>> endobj
+351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 571.896 202.726 582.8]
+/A << /S /GoTo /D (subsection.5.1) >>
+>> endobj
+352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 551.541 186.288 560.517]
+/A << /S /GoTo /D (section.6) >>
+>> endobj
+353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 537.454 202.677 548.358]
+/A << /S /GoTo /D (subsection.6.1) >>
+>> endobj
+354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 517.099 155.484 526.075]
+/A << /S /GoTo /D (section.7) >>
+>> endobj
+355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 504.949 178.398 513.915]
+/A << /S /GoTo /D (subsection.7.1) >>
+>> endobj
+356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 482.656 206.393 491.633]
+/A << /S /GoTo /D (section.8) >>
+>> endobj
+357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 468.569 235.633 479.473]
+/A << /S /GoTo /D (subsection.8.1) >>
+>> endobj
+358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 446.311 221.874 457.19]
+/A << /S /GoTo /D (section.9) >>
+>> endobj
+359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 434.127 275.613 445.031]
+/A << /S /GoTo /D (subsection.9.1) >>
+>> endobj
+360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 413.772 196.43 422.748]
+/A << /S /GoTo /D (section.10) >>
+>> endobj
+361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 399.684 390.062 410.588]
+/A << /S /GoTo /D (subsection.10.1) >>
+>> endobj
+362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 387.634 433.22 398.538]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 375.584 446.97 386.488]
+/A << /S /GoTo /D (subsection.10.3) >>
+>> endobj
+364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 363.534 469.504 374.438]
+/A << /S /GoTo /D (subsection.10.4) >>
+>> endobj
+365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 351.484 434.247 362.388]
+/A << /S /GoTo /D (subsection.10.5) >>
+>> endobj
+366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 339.434 392.419 350.338]
+/A << /S /GoTo /D (subsection.10.6) >>
+>> endobj
+367 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 327.384 366.431 338.288]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+368 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 315.334 352.892 326.238]
+/A << /S /GoTo /D (subsection.10.8) >>
+>> endobj
+369 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 303.284 384.553 314.188]
+/A << /S /GoTo /D (subsection.10.9) >>
+>> endobj
+370 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 291.234 357.007 302.138]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+371 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 279.184 391.328 290.088]
+/A << /S /GoTo /D (subsection.10.11) >>
+>> endobj
+372 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 267.134 350.381 278.038]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+373 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 255.084 384.702 265.988]
+/A << /S /GoTo /D (subsection.10.13) >>
+>> endobj
+374 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 243.034 415.517 253.938]
+/A << /S /GoTo /D (subsection.10.14) >>
+>> endobj
+375 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 230.984 414.411 241.888]
+/A << /S /GoTo /D (subsection.10.15) >>
+>> endobj
+376 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 218.934 394.476 229.838]
+/A << /S /GoTo /D (subsection.10.16) >>
+>> endobj
+377 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 206.884 412.349 217.788]
+/A << /S /GoTo /D (subsection.10.17) >>
+>> endobj
+378 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 194.834 348.698 205.738]
+/A << /S /GoTo /D (subsection.10.18) >>
+>> endobj
+379 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 182.784 383.019 193.688]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+380 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 170.734 375.567 181.638]
+/A << /S /GoTo /D (subsection.10.20) >>
+>> endobj
+381 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 158.684 371.94 169.587]
+/A << /S /GoTo /D (subsection.10.21) >>
+>> endobj
+382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 146.633 406.261 157.537]
+/A << /S /GoTo /D (subsection.10.22) >>
+>> endobj
+383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 134.583 398.81 145.487]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 122.533 427.024 133.437]
+/A << /S /GoTo /D (subsection.10.24) >>
+>> endobj
+385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 110.483 319.378 121.387]
+/A << /S /GoTo /D (subsection.10.25) >>
+>> endobj
+386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 98.433 408.473 109.337]
+/A << /S /GoTo /D (subsection.10.26) >>
+>> endobj
+387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 86.383 384.125 97.287]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 74.333 433.13 85.237]
+/A << /S /GoTo /D (subsection.10.28) >>
+>> endobj
+390 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+394 0 obj <<
+/D [392 0 R /XYZ 89 770.89 null]
+>> endobj
+391 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+429 0 obj <<
+/Length 1199      
+/Filter /FlateDecode
+>>
+stream
+x�͙Ks�6������� �At:=ԏ�
�Q-%;áeX���8���KVd�Yɉ@.�[,v��7�������78Г@r̽�'�'����ޕ�$���Gx��桺������b<��zG�ާ
2]�C��
�Лd���л5ͧ
D�ޗ��̣��k�z��`;��q=m�\��㫃C�I�'5CA`�dП�:��Y�>ܫ[
Gir�c�p想$W����δ�ϓ"��� 3�Ni�OT����A����K��T��0��>�A�Ahy�RV��iؚ[�5׾���-�܊k���a%n0Ϣ��B�@��"
��I����!ǻd�o�>7}�y�/
��.����a�G
�Ƈ !��:�oR���G�ʒne��
]1M&ё�E�8Q���3����
�H
@����0��̘C��� �
�;Pp7D�2.�Ex�w�u����ܰ�$Wa����q�|��h�΋[e�*d�렆6���|��!$EU��l��������!�(�a�'�2;86:iE at 1B!;�gs˚��v7����Çglac��ݝm0E�/��V��ry��0�/�CI
+0�OŽB��������߾$�b˫�7d��(�,�8����m%�-WҖ�͡VP�64��PM�Z�\,�9g���
X�%��2����������A���H�6��L�JG�j]BC�׳�p���dȭJO����|���q�*����"�%�
+K�Q�.J�,B½$N'������J9"SA��R8|PR+�V$y9W���U��s�T	.ET�"�Cdp',щI5qYh{(,��$��#��.��J�ѥJc�O ��w�a��-��
2�
�p@&���KJ���c�|q�|�f<=d7Ej]O)
��i�
��궋�E�ݷ>�5�Wr����r��Q�3��_p�Ñ	��1�R'�4����:��X���qw0�Yk����5��_,tŞG#U�'����&G�G��'p���G��`�P at D{>x�ߪ�OD3�D<n���19�s̕� L���z@$�;Wם�3m��$#�aa�=��{�G�ݙ(R���d`�������6j�ó��i
`���Yܴ���tO�ƈ?W���1����8_�m͸6���Η�4�*4}�L
1�F�
���%��j��
+�A -7
��r��`p���U>�"�n��| �
u��u"3+t˒�1�kX��� ևkx
+endstream
+endobj
+428 0 obj <<
+/Type /Page
+/Contents 429 0 R
+/Resources 427 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 313 0 R
+/Annots [ 389 0 R 396 0 R 397 0 R 398 0 R 399 0 R 400 0 R 401 0 R 402 0 R 403 0 R 404 0 R 405 0 R 406 0 R 407 0 R 408 0 R 409 0 R 410 0 R 411 0 R 412 0 R 413 0 R 414 0 R 415 0 R 416 0 R 417 0 R 418 0 R 419 0 R 420 0 R 421 0 R 422 0 R 423 0 R 424 0 R 425 0 R 426 0 R ]
+>> endobj
+389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 707.957 431.447 718.861]
+/A << /S /GoTo /D (subsection.10.29) >>
+>> endobj
+396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 696.002 407.377 706.906]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 684.047 413.663 694.951]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 672.092 444.448 682.996]
+/A << /S /GoTo /D (subsection.10.32) >>
+>> endobj
+399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 660.136 422.301 671.04]
+/A << /S /GoTo /D (subsection.10.33) >>
+>> endobj
+400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 648.181 403.492 659.085]
+/A << /S /GoTo /D (subsection.10.34) >>
+>> endobj
+401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 636.226 365.325 647.13]
+/A << /S /GoTo /D (subsection.10.35) >>
+>> endobj
+402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 624.271 396.877 635.175]
+/A << /S /GoTo /D (subsection.10.36) >>
+>> endobj
+403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 612.316 391.886 623.22]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 600.361 417.48 611.265]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 588.405 364.614 599.309]
+/A << /S /GoTo /D (subsection.10.39) >>
+>> endobj
+406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 576.45 414.411 587.354]
+/A << /S /GoTo /D (subsection.10.40) >>
+>> endobj
+407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 564.495 375.138 575.399]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 552.54 390.222 563.444]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 540.585 362.008 551.489]
+/A << /S /GoTo /D (subsection.10.43) >>
+>> endobj
+410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 528.63 473.638 539.534]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+411 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 516.674 472.533 527.578]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+412 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 504.719 393.559 515.623]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+413 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 492.764 388.578 503.668]
+/A << /S /GoTo /D (subsection.10.47) >>
+>> endobj
+414 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 480.809 372.708 491.713]
+/A << /S /GoTo /D (subsection.10.48) >>
+>> endobj
+415 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 468.854 444.777 479.758]
+/A << /S /GoTo /D (subsection.10.49) >>
+>> endobj
+416 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 456.899 479.077 467.803]
+/A << /S /GoTo /D (subsection.10.50) >>
+>> endobj
+417 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 444.943 387.472 455.847]
+/A << /S /GoTo /D (subsection.10.51) >>
+>> endobj
+418 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 432.988 387.462 443.892]
+/A << /S /GoTo /D (subsection.10.52) >>
+>> endobj
+419 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 421.033 354.805 431.937]
+/A << /S /GoTo /D (subsection.10.53) >>
+>> endobj
+420 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 409.078 380.827 419.982]
+/A << /S /GoTo /D (subsection.10.54) >>
+>> endobj
+421 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 397.123 387.661 408.027]
+/A << /S /GoTo /D (subsection.10.55) >>
+>> endobj
+422 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 385.168 342.063 396.071]
+/A << /S /GoTo /D (subsection.10.56) >>
+>> endobj
+423 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 373.212 401.16 384.116]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+424 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.948 361.257 363.651 372.161]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 328.9 120.226 339.272]
+/A << /S /GoTo /D (subsubsection.10.58.1) >>
+>> endobj
+426 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+430 0 obj <<
+/D [428 0 R /XYZ 89 770.89 null]
+>> endobj
+427 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+435 0 obj <<
+/Length 2998      
+/Filter /FlateDecode
+>>
+stream
+xڵZ[�۶~�_��R=+,��8nR���f7����ѡDH˘"e^�����`��޸I���e 
���`�ru\��wW��n���*I����a��U�'"����:�z�����%�ެ]�G��������B�	���0x����W.�ɕK�"�W����_�*���WRxI�z0D���<��۫^IfM
+`?�h�\_x~�,����zN]){VU
�*�Iבs\ob�p�o�m8��\mT$/����5l�n��)�n⼩��{��);�wuZ?�ܾ:����.?�uFy{O�iI#y���`��UMs�=��t���q���*�.lq��0�:G-�/
v/�L�B��U]W$+�\WxǏyf�O" ���m�_sB;ew�u�O
��5m��ۼ*y�;�}U�}�6���͝����o�8�_�xs��uÃվM�UiO���v/� P�('?m&7b�
}�pm��<g��_EW��7o^Q�`����
�b����.u�
�:�`]e��#M�P���8
+�
�]$�k"����
0��
.���ɀ��q,���l6U��S?�G�dRsX;�-pr^s��`H[|��9�W����oT�������5���)-;��Y9�H�X�����������f�׮i�������d**0�}���8�N�p3m�z�6v<my��y���I��LRYR&�����z���lY���k�p�f��
б��C�iA0^,\?�dy3;�4�V����וȜ$偄���
���=!8m���/�ܧ
5vZ3��eӦEap
������x\���" Xa�o��^��
+�/{��ꥍ$ċd��MQ��(HD�G"4��I�0�cX�Q�+�@RJ@�2k��&�� b����E

D����H�e�Z7-��}˪�L�aZ=ܐ�!�h���f�=d'{]v������
�
11��EW.�NjM4
���
+�To7D��K�C4���
�K��:9
h�Ǯ��|���C^�8ӵ
+�l���
�Q�
�AA���=�0
zI,�p&SIy�E�[������„F��fe!Qu�Xl䠩qN���1P��cYޤ��	fav�
ty��82=��dq��gm fj�W.8F� ��0��ֵ6�Dv7t

�,x�+�j��;N��=���
p�����v�)��e��Y�+���I��5��� ~�����}^
Q/��f�%����#i]CbeT�ME�6p��C3�'j��!����;+��CL����nH���3s�V���L�Ĕͯ��tA9�*�u�3L<V
#��8oB!|M�<<N����H��q,|�+>
?�T#������ ���'~|L�
��\%�Ez�C(��׃�4�!y��6�`
J������c�
ͳ��"�˜
�9	�7^o�票���(�	�ȹ�
V!S`��ec_t9�+�
({�tH�k��M
�c��,Z�@Q������SV��d8q�d�Z�{���
ԓ}�>%Qa|N3�4)�����t�dbe�(
+H�- �a�<�n8�R���?߼�����E�m�Z
0HĪC�:A�5��
E���	_h!XW�	@��|#2Q�
Ž��D�݅
���q)�T�9
*�����Y
w��\cH�~ı�Kb��%j�:9�k>v�Ԝ9�I��W]�}5K�&�%��|�d��^�I�TreZV���@��uĄ�Ǒ���P��"�y�� z^cIS��'>�֘�@[^��D��D�fw��FHx$1	����Jl�u�4N�71
+V�/�8���{#�o��n�+ г�Ľ!�m�@$*����w{��[����(���Dh׾H\�Ci�{􌬛
6z�+�����
z@� �%�غ�8�����WY�����/��I��p�W���k����a{��&==	�6�}F�BƢW}���OFE��H��G
+L��}Yd�o�x�=om���
U
;�=�<m'�L���?a)�mZ�d���C]q�<R?MI���y��yZ�ͳ޹'�\���^�&
'��ϫT����AG���q�	&’J����d�/$�Ym*&*�DLs� 5a���S�Du�fU�Ma(0�Iie��L�v&��4I^8��y9�9��p����"���/�5��I5��I���Q/�����(��
~/�yDI��ˋ�
�l	
+���4.���iύy���j>�ꅥ�Q.��s��j
��nO�UV
 ������׋%6
�Q=���(�.��|OH�'�*2ׅ�i�$e��i���$q0
\��ZM
t�\r�������|�y]�<Ώ,Y�RMv�<�a�)WpM%7{/��}�A�•�+�ޯ4�ҧ�v F&<��0�&�
��Ar����f�w�%@�uе.y�x�k*��S
3�'���P���R���s
�_ ��g�	Jz�U�s�w6�����^�&��4�\�"
Q���R\q����V����6� ajpCU�w�q�>_T�^�
O>��"q��u}�wxV\���{ʭ�օ�ZZ�|����3���
>���J���Ol���ה�<�-���5�:
���ş�.ʊ��<�x�e�&?�:��!sE\�o����ˏ׶vP
G��:��5���?P� �]��r�
�5/E+[�b ~_�m�}^}BN� �n��}�{j:�����t=��p�$d��"���"�
��"ŷ��#�U^?"x�"��7�0�'69$x6X��wo2��y6����X��)j�g��\!(C�4X��8���@�@~=,��Z�������KD�׷Z�M���I*�N��QJ����)dm�Ъ���n
�sM������̙]�wG�|;B��r�.��:Y�,�
B�f�_�	S��� ��Hy_���@��H"/�!�b
�
�/q\/_������r�C>
�
y�_�<V�N�@�_�&$
t�{�ul��׭���@w}����sr�8���,�m�_���c�ˣ�ë�œ��Q$d��N��/1����B\VV���W��(R�b�6�v!ܼ<y��e���� S��U
+endstream
+endobj
+434 0 obj <<
+/Type /Page
+/Contents 435 0 R
+/Resources 433 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 440 0 R
+/Annots [ 431 0 R 432 0 R ]
+>> endobj
+431 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.204 337.718 537.142 347.999]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
+>> endobj
+432 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2 0 obj <<
+/D [434 0 R /XYZ 90 721.073 null]
+>> endobj
+437 0 obj <<
+/D [434 0 R /XYZ 90 697.183 null]
+>> endobj
+439 0 obj <<
+/D [434 0 R /XYZ 90 583.798 null]
+>> endobj
+433 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+447 0 obj <<
+/Length 3194      
+/Filter /FlateDecode
+>>
+stream
+xڥZY��6~�_���*M��<9��+^���L6���R�I�)R�G��/����T�e� 
t�����*X�������K
�r?O�t�xX��Jǹ���ۯ~���/��WQ��*Oa
���񛷏���ǻw
+>+��_g����_��
�_�?ʳ�Gb:��0��\=���.���
��
� ��([i�|�x?�aB��i��6Ix�V�M�'^w�L
견�a�},���&��g��J�+3ԇ�f[����
U��6�Δ����븷�Ϧ�Z��^�� �v/�ܼ{�w��eO����WY�
�˜of�(�3�����U�6Q��I��6`�<I�Ֆ�l+�k��,����,Ѩ�N���*(XV'6��ol�T�0��8wl���6*��DǫM��Z��?��}�z��:
�B62�\��ؘ3wv�jo�X�Y
��(�#[&�P7F�6¾���+�}
�b������uuӲ�A��S���C��8��'���ƶ��ړp4|WK������3|���}���0
�p�@�cѝ�j/fg�������:��C��9�_ at B��Z;�g(R�e{�k�s�
�C}K@��<�˦

��lK+��}+Z���om��ڊ
F������2��b�s93
ix�[8�
�<(Z�1�
�,v,j�>ڏ�|�븣b�����W bv�;ǵ�W0M�ֻ�@�ݛ��m�>B��A���A2�G
+a:��tZ���de
� �3��@͍y�ݩ�� 8v'�1���ۢ����R�ד�7���z
yf�w�г �];刽��lc��h��[��
Pe:�,O=�X$���g�w;�+�[k��g{�nc��Վ�
}>4"$�`g� 
����>�bh��03՞��cr�ŀi��� ��j�c��p(
=ygrm�������J��v�
��A� Ab���FR�C��`�u���
Z@� ��AH

l1����ޭ3�Wld4�Y���~��8f �x~�C�
3ݐ� �4�c՛�/���Av�K	�Q
 C����!%�4��'#b�;FC�O���0�>^�w�
��(�޾�&l�qH"po;ۜ'��
� ��D�R
yEGҠܩ��0e�_:U
I&@�"[�o[������
�������[;�1C$��`��
��-0LsP����7Ўt�
��kŦ�.�x��4�va}�(��o���
�S��𦩬u�LҨH���Nd~��M8���^2��|?첽��=/��LM�Q �YH��Q�o}
��O�
+�3��f�:�o�Q�!߿��-K�а8��/�9�_�(�kYl�\��a?����M0��a�r�Ѝ���8

+�����b6�ʜ�*
`M�-G�κ�/��y�S�}0�[�7����(�Mc�o�v�
W*��4��,���~� ?L�<ROŋi�(��~n�[,|�.0p��P�}\+�=t�Ю�C��-׻Zbe�r�N2O��϶���{!
7�%�7;*S�
)��R�m��|��ø$����9�
��hH���%�T
+H�CM���{��n�}�ZT'�n0�+5FW����\��)��4��9�bR�&�܎j�Nj^�\��+wͰ��b��{�8쨹��a+�&�
�
I�w'Yj�Y��X���K`Հ����qI5</� j ��
���]��B���
dz�&:q
^�'qx���d�0ͽCS��"c� W@
7(�	|ij;!����v��:�g�4t�\)�rr��/�pE]��M'�h��x�p
72�q����%�V=�`�
`���$�suc
���\���p{��(�1H�ݱ���+�
ց��\śai\
�ʔ<�
�ôͯ�j��+����]�a���{�7=i�;��o�Z�fpb�!�wa����ԗ��g���
!�r��G_�-&��(E��f|���@
���h�ޫL���Ta�
0H���'b�x�'��Tk�R�P�5|iv%9��\.t4�G6U;A{

+�nb��
;B��{�(��W
)G�0�L�
&S��>�m<`�<�P��
+�=Mn\��Wo �a�"�%w��۵�����o�j
��s)L�#����x;f����q�ܾ�+1fz0���Pd��
RW �Mq?ځf���"�>t�d���}����m|[�\)�ϯ�W���m�B9$��!���|����=�us|�9�l�TVLp���k�����\�z�_t\���J�/�b	fb���)��)�9:�$�����arA@�[|r+�r�,���XV��Zܮ�=�Lu�
+7���]r�WlwǶ�O#�&�"��FKy�Xs&
�_��3���l$d㽵�2��~3�>y���� �sW�~i�V9���j�O�7�u
�U������iRݼgo�uV(�ܪ-�xY �5=�u��
 �6 �1P������qdX_&��{�GI��[�
��
+�7^��#׺��І{��������&ޫ�Y�9'�tj#J___��� 5��0�
"���p��N���Uʧ�����`e'�gh��i
|f�>8
|��f��K$k�M4�AN��^oy��Q����2u���Y�R\�d�^����
8F"�
(��Єk���;x-F��*�~ě7�Œ��.�P��<ӷ�P��e���A

������ÿ�\\a,����N'{�R�^L�!�2e[��X�����{���u� I�u\Ffo�eK��
� �ul��
+"{��R���(����@	T�g��^
-?�K���Z@�Ś�<D��l`dj�g\*�y
$��܆�!�(2��|�*p�EW�E�w�y=�X=�X�f
�:�>F&A+���x�(q�
%
�Ձ����8�c�&�sP��I@��~���x̹��1
�?q?����N���\
ey�Mڬ]
5��4��Ԟ�J����)9�k�-ƫ
����лz/��+A G+�
+�>Y������'��!Q�ߧhC3C�f
л\
V�j�]������������
�[6��%)��'"�O\t?���6!�:����������a�g��L�����O��
+��!}����͑��ߞ���k6�ۀ��(��GA���2|U���Lx�5�����e*��|{s����ls������g��N�;��Ozo
������S��46C�K�|���5����+�������������q��~�o{Cx�]�WT0x����3�K
�p
+endstream
+endobj
+446 0 obj <<
+/Type /Page
+/Contents 447 0 R
+/Resources 445 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 440 0 R
+/Annots [ 442 0 R 449 0 R 443 0 R 444 0 R ]
+>> endobj
+442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.985 469.662 513.996 480.446]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 457.587 157.746 468.491]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+443 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [297.062 285.216 388.718 296.12]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://fsf.org/)>>
+>> endobj
+444 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+6 0 obj <<
+/D [446 0 R /XYZ 90 356.013 null]
+>> endobj
+450 0 obj <<
+/D [446 0 R /XYZ 90 323.352 null]
+>> endobj
+340 0 obj <<
+/D [446 0 R /XYZ 90 323.352 null]
+>> endobj
+451 0 obj <<
+/D [446 0 R /XYZ 90 213.926 null]
+>> endobj
+445 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F72 334 0 R /F11 395 0 R /F24 309 0 R /F8 448 0 R /F83 436 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+456 0 obj <<
+/Length 3255      
+/Filter /FlateDecode
+>>
+stream
+xڍɖ�6��_�[���e���'^�=��w��
�$$�5E�\����S@���\Z@(Ԏ�b���*\�����͋7�p����vuX���.�o�-����A����0x��7�Z������2�?�Bם�I��y���������MW���Qg�]�*�7���J �_��d���h�y��	�V�/7��	}*�s*�hEL��:��H�K���y��
-�Zs<��-N��I3�ֺ�Q�N�u���,е`i��n;
��̣R׸���Gw� ;�N��
+!Eu�
g��nh[]��E��w��>˘O@��K���ݬ�0�:}hZ
�%I�8q�I��PxaH��^�Z����ԝy0���j�바��[󀨆��i.�@#
q]s��Q(!)!����;7�9<�=��g�.���,/^u�L-h���Kjܸ�w�m,�A�~�9�
+&�U�KE�{"WX[�ݕLp���t%����� ��c�η���I#M�����Bʡ�E%smIR��<t=�.��xwS3��=+��c�u�� �5�hn%���:�.�e����z�3 ju���5%�e���YG�"m��B&l?�G4���T��-�
�@J
��f�m&�44����C$,��P5���� �":�����V�˺d�x��
������ٍ:������
F��X���z�ôb��־��L�+/.Uͅ�Q�Y��h��	D��m�����cp��G�(�'ӟ9qø�^_:��p|
�0�?�����cp<�L�$�HV6�
�QV�xQ,�#�
��i�?�n����"���_�2�k ]
2���t�!Z��bٱ6�+�����1�/�M�
�UZ
��a0R�O����&5�F�[�N �����g�Ҫ��ʑ�R����U��h5�1�X��EY��{A�q�.��1L,)��������
��40`�
��0�1*q�@v#�. ��cѷ���C�`�Z�����H-j\�>h٩Z�� ��I�G]�.�h
Q�WN
Jz���O�����`���
K<@�mS�f��e�\�/��^

`���-~i(��k�A�Ĩ0�ҙcM$��(�e��0��'�
+@���� 
�W�9l�G-	ڡ��D;�a�
��j"�-�Y�+L����⽪�
Ǔ�/���z8��Z`�
A�ol8��^�~��s������_���:��*�c�~|��9�u�>
Qk��#i�%9�~�Lv���1�߻�g�g���9
X�"
+7q
#����(~�P�k�65�̕CO�k
Sv)�)%r���(��`n�����d�(<!���
�iR ��$�᎞w��,��@X��^zZB���$���4���x��]��p�3ϜQ
�
:+ ��뽨1GA� ��g�.-�)�j%
+C�wj:�Y	o8M|'7Y�~8��j�=�
�uoĂa�5���y�30?|KPN��)�\��7�,�|f(�g����l�Sv�k��w�r ���F�
�[�͢G�%
+c
 �[)ق� ���Q*`q���*
���4I��O$y
xy]
�J��	<A��oY����p^45���C��AO#��cdP=_z�
+NHf�J��s��Ϧ��WN
����r�h���c8S=S�
d8��*
��搓F�=r���2���
ð
+Od�v��GʛɋT݆;k1�g�hk�ȓ,=��$�Y��?�)��Թ�0Px� Zb�myA��(< �˥2�bi�Sʞ0*?����ñl�]F.ВCT���P]Z�{Ւ�a� ��,Y`v��������9\���A��Jr��8���Ju��y
OM��=N�/�w(��4�~<BO�U%�j
+���Ёm�ns}xy�R}W8L6k)Ըxh���ı	n���~�޼x�'+�z��,`$�6�>F^���
Iy���+
���W������
㓶�ޱCh�
�2�3o6�4\3��	�Y�͞���8N��e S���ng����d$Gk����ň����W�LU��D���<�B�����
+��2Ϋ`[���'�)n���s�y
�-��I$�#$,r��r��>R��G����u�l��n�ֳ�
�Sv�
+/����"���S,�*�W�L=	�P���
K2�*�x�G�MD�F #��I�ZQ�1
�*Y9��b� �P
l#sP�#?�k#D���hrc� �[��7���4�\留��7ʹ'P�����`Jg�fP+^���\
0�?�8a&���^κ�ͤ�
#.���R]zAɅ�]� ����uQd����
�Dq�ӝ�%��2wH<��{��B�>�-���q�I(��lYx�7���
[�+]VJ�`�wZ@�i
KL�f_7T��䱘K���ȴr�EV=���%/*�Θ��	��b����ZZ���{�܍~�[Ľ��/G���̊Eo{
 V��Q��PO��A�p�ۄ�^��C�IfsEn��{�Ĝ%��8�A<�2	A��J���FBG��ƽ�*%��`8�z�A��N
��x��j�͟E�jA�����
)y
�PcqF�ဋ����tA-�2l�x���4�Y�A�jٚHf�ª�w�̥ؑ�b���m��^���w9Kr�r��s�֖��ƤO�<;�B��t
+E���E5�T�$�Y2�l��1<�
bQu�;�<��4
�ɷKe��Ud����R�}�7���r��كdj�-:�o
C
��D�}Q������l�PWՏ}{��u���I!k&�c&�'��15 at 8f2
�ʌ�SMQe��TE
+G0ٌO��d,�J=?
+EU�‡
\�Oi�%��-
3ب*��[�kc��2�j�
�~�*E̜�
�[����V�-��}~�y����.���ZQ`r��
y
+���ɷ�0���-Ҽ�E�K���s�%A�yy႐<�}�~ȧ�K6�
+36��vNB�{��%#jVQn
��&�ט����}�?�Zsw#��	�B��J�=Y��t�Y
+�ϏB�m�ʥx�	!�
+���&)��
+M��cT
+�eUu�{?o��2U�9E+/	5v�.�ع�,9�#	i��p�&"Q�h���qtG|�ٗ��NLԵ��,��#W�#'��#���A̹��r���x��������>���.���>��&��Ӫ��mH��B�Ԏ�>�(�͜@���~Zc7��U=�"�{U�F����
�!%���u�\"�+;�'�M�q��&�RX"N}��ŋ���i������n�	��={?9�1�g���8V��
��6�
|�	7a��p�?�E{P /ޝ�ի�2�g���Iϭ
+endstream
+endobj
+455 0 obj <<
+/Type /Page
+/Contents 456 0 R
+/Resources 454 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 440 0 R
+/Annots [ 453 0 R ]
+>> endobj
+453 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+457 0 obj <<
+/D [455 0 R /XYZ 90 363.702 null]
+>> endobj
+458 0 obj <<
+/D [455 0 R /XYZ 90 337.849 null]
+>> endobj
+454 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+462 0 obj <<
+/Length 3135      
+/Filter /FlateDecode
+>>
+stream
+xڕۖ۶�}�Bo����$xۧ�MR�n��>�$y�HHBL�2Az�~}�^dڧyY`0���6؜7�懇o�^��|��*�<�6y���|��0�6�l��o�?n�������?=����=|����!��`��d�
6e���o���`��
mj6���[o�
���)I�)	�}�ekwq���
���?�ݣJ�m�8Pۗ]l���[���q
|gJm�~ų�V<��;��y��2��#��b�^���=		�p{�~����ۓ�A󲱽�N��(t�Ӷw��``m\O�6���<I�
|g�

?/ ����x�
+��������P^xTȾ�?��ë�ڵ��@OM�Y��S&Q����U#����
�'5	�*AY����!��
+����Am�ڡCQ��a���`�[A)�s�8�L��(��3ѫ��W�"K���
`1�N�9�P�\� ���:
�
��NW#��G$���%���`왯k����,Hn����Q�������w]����A$&EkG�	����#`.t�Μ��ޏwe�T	W��=YN=��~EW1��\����0R;
+��{S P)z
i�����;t�e�LQ3�-� >��%� ��M��e{�濺��>�1��Q�=��m�&[4��fΈ&[�ayà,����Q�|��tW]�̉ �b���Cע�M9ԅ��4�]�4�4 �
{
���DY������]/���m��H*{�bV������Uwn��o��B!��ӴԚdn������ع���9vEg����$u�����T}q��̸`flY�;
�M�+ �y��dϯ�/�~�.8�[?ZEI.��xik-h���� 	
+����eL�P!�#��ҵ�`���d��X�	r-�ř8�ӂW�Q��Z��7msm�sqqn�;q��ŗ��@�
+5���z� �k¿��m*K$�f!q�H��)�
ݱ
9^nm}��n��V�	�N&�(��&[�c ��{`�w�g�ĥ[�W��Z놃
�(�
8sk�t�����š�a�J / w�kd��V�\>������2���b \�cmJ�'8F�
����P��Q�9�e��}}.��Nthl��*be
�q	W�6��
��`ZMK��iD	a�
�2��\�Sԍ�D�Y]
�c+���&G~��U��ny���[4>�	N��ar�%�ё�<8��{p�a��pq��x����Y
�;V��Z�@�
��E��bo+� Sk�3�
Z��ϯ���+�w�Z�����I+�=7(4�0��#�@�)p�T�$p5`o
q�Tȁ�+	O9�oc s�o
��3�Q�K�'ra,��نG>���[�5�zO�h��V늃lΏ��Y[���k�BNP��HS�A�GQK��!"��wMp���+�$~�{|������e�/"Z����vwv&u$�c
��� ��bR.xV� x��϶�����
��C@��3���-t�L�7=�Zr�*�� �y�x���K��cؘ��1�
Xs�Z�x
��Hp߶�[-��)���(H�
0�:uZF�h9��C',�f
��SwaW
+�
�ZI�z��y��RV�D`�bÀ��ʤx3Q�Y��
�ơ0�-0NQ�̶�
���9�X���.y}�m$�e�R�ڟ(�k!_�Mk>�:(�h�0��>=}�����)_�O�.q0�K���k�q|r�U�lј���7Za��
�Q_V���⤢ X����t�VrW�u�3gˊ%~9����`:�A����ΉjN��AF�M<g at U�o���`M)�	.ShI���Hb��ێ��z,� ��0�DB���wc���-
ϱ��^z΋|���"�+l�/z}�r�
���d^�	I{a
�+��%9ztd2>n�b�[���v�چG���}���V ~�WB�׎�E�jm����m�)S���W{�h�D���=J�=��H��~�b�0�q�!���
�)�˜/�e�*ڞ
&�5���AIێ'�d��B�a��:8�ęT\o:5�rY�w�޳i��J���_j@�
f! ����R͔b��'�N���R�k�
X�f��R���2H�����KFg��$P\�1=�%<=v`:2q�v�^
-�6���S
�"G!�]{皹����.��0+�(�H���:�|����в)����1�"Vq��X�9�B,���ֈ�H��6y4�T�|i�X�R�D�P��[3g3�T��M/)�`��M?��A
+9�Wh���?�Q��p+�&�I�����uu��E�0�	?���
X���c+z���D�A�kyڬ-}�� 9޼?ZZ��p�
��V��w!�`@o
�^ܸ'�
�1~Bj�Yyx��v��
+��>�0n�
v��2U-$�
�~��"�)P;����I'�ꖃ��Vt��E����qB2x1<M �5�!ԑ��Ee
��0g
lg�E��0
��O�.�S*f<)�s1IƆ��2�)�~� L\8������5��e,����	3u,�!%p3�8�B�"q����	.ʽ�2�%{9����ڧ�s��s���o�
hd I
�G�| �#� A�P 7cI�c�UcY��d̴f2��XqRG+2g�
+[����
���z�p�%�/

+}�ĊD��I�YQJ��ͣ#S�$�D��md�/)����;��WI��+����T�%1d�4�������-_T!"�~�D��Q_��D�=�iI��vT��RPř$
q��$G��(�l�
�fs4��S�
#	��{q6��(Fwu�u�4�m�ǧ�������w�g�@���������$���0��V}��/h%��3C����8�ei�rh�w�5F�/%*�t�����Q}�
����e^�ǜ
֎��ډ"�a(P��
V��f���*��X'�LM:0�_$�
&a��~��Ɲ�����RWt�1Z���>���9?U�LE������q�Or�?��pUf�������~�D����lB��c�0"��,���,:`f�^�_���޿ǃg����_�xv��п�
�T	��`���O�&I��k�����DOZK����0�����j�
x�E��?�K�_����q8;m�{p�B��,�i�ώ_�vc�K92�5
 ����43
+endstream
+endobj
+461 0 obj <<
+/Type /Page
+/Contents 462 0 R
+/Resources 460 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 440 0 R
+/Annots [ 459 0 R ]
+>> endobj
+459 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+463 0 obj <<
+/D [461 0 R /XYZ 90 648.144 null]
+>> endobj
+464 0 obj <<
+/D [461 0 R /XYZ 90 288.417 null]
+>> endobj
+460 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+468 0 obj <<
+/Length 2841      
+/Filter /FlateDecode
+>>
+stream
+xڥْܶ�}�b�̩���>�'G�\Rdem�q�$?`H�
J<F ���}��
^�U)���n4���xn�N;??�x8�����ܿL�]��I���w��K�܍���N��
b�����<��Ԣ���p�TA�7��M'a�eQ���?߿������7>l��|b
�i�+�z����Ha��

Q�������ͯ7����Y�:�﻾OG
]�<p
�ޏ���E�������� ���;���'#
S�s���%-�i�cӫ������"a�6�@ ��}8�ժ��e2ק��~��߶��0Ν�E�_�GjY�q�{N�?Ѭ;����Aҷ�����{
eN{$�h�+�� v�(>hB�N�M[�'U�]K�
��CS��,7Xw�������*��G
%#�1;�q�>z^PUF�a�8-8�i;���nC�C�q�:��k���ϒ�z�'����z�j�Si)�+�+�Ko���Z
<��$
Y��~�'����
�,1�ҩZUB����
�.�=��b��n�ղ�*&D�4:���u �?ҷ�3���;
%u� ���q�(K:�v�A �h��g���a�k�u�[��ȋ�b�/�cr���&ƒ�/-.x4���%���nH�$ƾ�d�&�J����|�-p`��W�i��L�M��bN�%A� �p��$��#;\�8cv_:
+��g���?�:�]`���bF^�M6C��+G(UWTB�Ol8���j�V��=qi/�g����R�=.��h����]�xƎ
��x>|e�R�~oq�:¸�j���ld��}
;�d����BP�f��.U��!�I%M܇�҇2��g��
�Y?2BlH���On�*���0
��bq>{{�Z�H�8�1��
/��0��E�}=
�ſ�%�v����ŕ[���vKC�[�8��ݞ��G��SҮ-y${�'��������T�˚�� 1��f
+���"�.і���,�yK���EC;t�
��!ҟn/Z�^�
+K��L*
+G��l�Q����>�`�ː�i!
�`��'�Jy!\f�
+$,U
+Q̫;�t��4��F�	ƈ��+Q4
 �as�V]�����I��	W0D�PQ��a
͙�,i�$eJ�.��f�p��*�O������j��1cR
&e�\Q�y�C'�B.���0����h�+�JJ�i�����
+nE���žݺ��8`���0%�!�jm5�y%�9�p�f�e���ft���=CU�g�Ib�I0-n⩏^�u$\b�
�NNo$3w
FW��F\Ib�v~���|\�,���4�p����qi�-_���[�C�
m�&x.��㯇�_8����0Q���"���k��1tC�E���f�8J���������`h�_�*�W�2Z�����clK���ˡ`J,4�{Ԧ�z~5;†�`��t
��7&��6�_�T��sg�nǪ~���x1�89�m�Z��eoaՒ=lݍGkJe���¾;?q�0�B_c�����]����'~�T3c�a��S�5��ժ���cD4���9��œ��7
G&¶@Pf��`Za�%d�����(Ϳ.��d��d�E�
`�
G,;g��t��|J�YfScF�j�L���
A�mZ�"�f94���6��gn��K_�\t��6}y0�/@'x
+�&
+#Ѐ�7r,�>J˚�
�����+ʀ��z��`����Iv�>ڔ�pV2��V��c5|��
v�4���l�q�W�s���B�
��MA�R�	$�>�綒��*Ϧn.��gپs|i9r!���%/�0��vw�y@'��4�qG_a�q
��V�Bk�l�e��Qœ
+���*�8��cra֘
+"�fY�W�'
�O���iJ��U�n�Y
�&D䤰8�8!}�B�K��s^R�U)\ˎ���8����u.���mb�ʶ
+�WKˮ�$N�t�q���a�����������(`e��l�H&wM���p �K	��,0iѰ3j1Z���>�|�����v:W?r65��J��~ )�� �-���[W��J
g�;O��S���LXtpc
+�?�B�Q!ȝWG*�H��B��>
~���-V�H��3��Q-.Tl����,��Tݥ2e>
/;9ˇ yK��tr�uG9
D�Mn�����mW�*&

��MG�(��e�
�/[���(
N�!�R8$a��I*���
6����
�1���aƚ�+���
u5P���.K��\�V������`"@P��?}SC�
C"�����G3��W*H	?&��X߉B�t�`nh"���yd�LjV�O#z|�P������9ח؈�_��r�d�'�Զ�X1��L'���@��I���,)������B��E�C�j����&���iCq��r�c�A�/i�j���1֝�]�jq�8M@��^+��c}3��^@�����$cK/�L��8�f	��X��
+u\TW����k�!�
�j�
��X��
��|�<���`�I�Z�)���k at g&EA�0�
閑	�ZY
+6�
��7Os �"d�l&���G'�<<H.��h�`6��LT2��[�r�P2="wDb2Q�eO
;���(�"�
MzQٸ�svvC^�
�f%,�L�s at D�:�r���j/n7_�L�E�]u�6���B�I�����[�65��`M7
�o�������*7O���T�ԍs��rl5
���5g~,%��_ќ��0{5�;��^�7`��E4�}
������]��e��ޥ��NJ�H�O;;���
�$����PF�s�_���?
�N6'|��˴8M]/���񉨦�c!�gQ�;�����c�w�$�
+|�y~
+�C��� �Bܿ���O-�e��� .�k�
+endstream
+endobj
+467 0 obj <<
+/Type /Page
+/Contents 468 0 R
+/Resources 466 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 440 0 R
+/Annots [ 465 0 R ]
+>> endobj
+465 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+469 0 obj <<
+/D [467 0 R /XYZ 89 770.89 null]
+>> endobj
+470 0 obj <<
+/D [467 0 R /XYZ 90 701.424 null]
+>> endobj
+471 0 obj <<
+/D [467 0 R /XYZ 90 550.728 null]
+>> endobj
+472 0 obj <<
+/D [467 0 R /XYZ 90 411.987 null]
+>> endobj
+466 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+476 0 obj <<
+/Length 3389      
+/Filter /FlateDecode
+>>
+stream
+xڥ�r�񮯘[���,	�}K
oʎ�l��!e��!1�
rL����O�@���*�4�F�ߜ����!��_�B
��O�w�?��<�����C
�<����wAv���W�8+�Q��
~��o
������}�x��]K�!���1/����C
��qY
�	�zHT
�����w�/⧈7�D�1������*T�y���*���GQ��tO VE�M�=|��>J��0�C?\�Xu�~�!��


TrLryǿ�f�l���_p��
~F��	\3^�#�WS3��
)
?��xG���F��6<:�<���
�:^du4p
+
�g^�@��;�&��:}��$�
�XS;�Ƌ����!�zA  �2MY ����C
�p}f�[8���>
+.Mg
�k}je��~���]M�� ��J��+Z�eIG�����2�5p�8R$I����]6k��D7�_�g+E8D�1�
���X�1�~�T����!���0�����o+Ufr]�0_1��a�t���J0�\O}����nY�H�`~��e�Td�
+l���Q�¦�ډ���W[[�׍
��t�@��5$��d�ZNWS7�O����BUU�鎹���Dz_:�,�W�8�q��0T���j�
#i����j��5߀���b5ٱ���w�M���pDK/�љD
۟GV��0��@㪋���=

D0*�g�����B����
+�i���"r׮D+�J+Բ�y����W	�Z%d_�ݧ�O�(ʍJ�7&�("zL��f
M�0�L�g�v
(QB �mS3
+�l$���h;2h�
�0����
+b'[W����bۓ<�>oa�AEY`o�&0��hy��*+�;�n�0���p��F����
+�ޢT
�=Þ|��
AtG�C�
��A����s/Ѭ��� S���
+�$ͅ%1Ū����0Ǚ�n�|t�֊��;7�K

=⋔h#��2h�cm
^������B����� Y �����c�;0Y������{���a�9�*|�"
����m ����YW�=#3�ݬ�b-pm��
+�(v�m� ީ�u�
�@"�X�}�f$G��m�;�EUR�Jh�U
+�w*R�4�,uN�*c@Ь]�ȇ��#͏Ό^z�
�
��7
+�{�BGT���W���o�{���
��'��9��!�-Ů &a!��B1��<xs�vK��pә�3��������g��
�x(P�KX�	��)��@6
C���J����wz\{4�g-
�7��L�c6��	YU�B
r������ �ǭZ�R
+%E�"A��i�{��B	=��`*�Wo�p�
��Z�r�eS%#��4|
�(�
�C���I�w�g'��;��f���xW+�i6
�1��"�$h�a8m�4��	�jc�'�o#�o���"���TA��� <PL"��RR�X�t�oh�J��?Mr��	�Nrc�6�Y��%=���2Y|
��|��2�:­��tyY�A�[�vB�y86��|?���W��rgH�8�G

(
<�p6
&-8����}ı>�����q�9��!�o,q}/��M'#�:�]~��*u�֜X`�1!_ńl�\(�1f�KR.�`a2?8�,���L�ř�������{@�HJ���i#+
�l��Aa��!�� ��\��1��
L>_$�Њ
j�tZ��A�$tsD=��VMی���t�0���$>qpՐ�h��U��<�A�\3�
y�_F���E�:Ɓ�V�B׊#��O
?�5���:��7�֗�s/N����$Ez�[v��
"(KF�;�
�V��X��W��k����H�vs4�+�
1�S���Y�^�X��N��s˥7�i��(WL5�$�~ͫO� �Nd}�Y���%-��L�.Wt)�#F�_Ϝ~%#��xkHd��|e�h����kc1����ܶ�`+�
�i�r�Ji$�%Sc-|#�"x��<q�Tr�ױ&�b
�>�s&��2@�r�'#��%�%�C
�'Ӂ�iy�6��U����Mr��
y��"�Ƚ��&U��i��ASL��k�}�Z"�x�|�dO��1{��
T�V0�'5'�m!=�N*R1�r����v����z������4�a�CŠ\�!Vz��L3W^f�V��rQQ���l~�T���(��o-]
�>rm
����{-��
+pBX�����b�[�|i('�ūѝЖ
OF(��TK,B�rmg� ���5�,7G;0Z.pƥ8�8�
ә:��.�]��l@ �f�؁��o��mn�ov�啸�9�inmg�;N�6;�=;�B�v�,D���1�r�F��l��i[x'���U�W�7��o<]69��+D�zk���z�(H��~:���5(Ќ�l��a
�����v��Ⱀ�}.7"��I9�
~�n�hʂ�"
+>�GɌ����QSM��rʰ�)��
+
G�xEa�s�+E��+
!�dH;�7�3ŎXq\���Cӗ7�pB�P��^�t��S�ų젰�KU��]/z����_�5kJ�	�Q��[�+I(��^�?���u���r)���.�o��2/�MDBW#�L���]⒕���
�

�F�L#��)
�����
/,Hұ��~B,��\R��[�y�W��^�)��<\���B�B\([�9��
�Q�4C�q�j�z�n�C���b��q�J�;��U�c�^3��70i.-VA�s_]�6��W�a]�E�f�k�Lh�
+?��sRف�V<�J2��@b[�:�	���0f�q.�]�J2/R|��5	%!;�L
���	���?
?��swX�N+����9`fs�]��
�:2O8��"Qprj�4^I��
	�V�g"��,��`��~�I���p�alf&�ٽ/�x��7�{�! ]����<xU��^%1㑕&��5Q
Fv�<�R��ԉ]��0)�\.
+ �����g���j:ʃ��D:���
a�:n�U3��ŀQ#�GB�9����N����q&'�L\��
cA�5d�0>�JOv�Y�w�%���B�d����6�����Ե3��_
 ��^��Ή<H���K鑺Oix�|L�&����7 
Q@�Me��ݢx"���(9�>�0���h�q�$�d�[)=��U5Qf��H�ad�Ҍ;�H�X-G�u
+���i���`h�.2�P�+�i$9F�ӣ�����P�`K�oX��rI�
�l�7�͌S3����t�q�I��'D�`��Ki����	I	9=}`ذ�
��Nl���c�����%oc�Ӓ~���]x
�<W��i����/����=[�= ��� �,*ގe
���(��*T�tW�.�~��5��DR�B
6iW�I
�[�BE��=����;��%�̍�����*�:B�
�>#���8����k3�
�p������2���޿?MO�g<
+*�m-���f��;7��)��sl8n���w
�.
+endstream
+endobj
+475 0 obj <<
+/Type /Page
+/Contents 476 0 R
+/Resources 474 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 440 0 R
+/Annots [ 473 0 R ]
+>> endobj
+473 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+477 0 obj <<
+/D [475 0 R /XYZ 89 770.89 null]
+>> endobj
+478 0 obj <<
+/D [475 0 R /XYZ 90 702.102 null]
+>> endobj
+474 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+482 0 obj <<
+/Length 3131      
+/Filter /FlateDecode
+>>
+stream
+xڭZK�ܶ�ﯘ[8UZ�o��
%.;���r�R�\3���Aj=���H���
|��G?��5���r_=|�������P�Ee�w�C
���
z��'/:>Fi�}�ݏ�P�ʆ;o��FW�~�+���)9y��w�<���Ç��
+!/����P�?�
j s��8
���=$Q
��ᇇ>�)��)��C>�6��$��Ze5�A�W�?i��q��л*��K?
�����݅I?��P�p\^�w�$�>
��S��j暺Z
�4^�FU��)�i'32ÓlVVU���N�"4p��
+�
A�"MY��;3�MS�QV ��-|X"K�/�����ԇI�U

���W2��B*o���4}�1��
�����Jّ��fC��[9�wf�X��X�]��'�h�����/�W��Ll�Z�
)	����Zy��k%�N��
+�GC� �ۡ�'�d�{p�e�L�k����-ӟ�!,:�g�ki����l$g���ݞt���[t4
��,��w�U��6�IsR܆
�Q׊6 ,�0���ض@�]�L�lV�Ξ���&����i�ۭd%��G��/�W�
�a(;02���ɋ`��V�#�8��L����cd
���@��[[�� �]ɱM��\����W��Ax�,���ivd�Y.������;v�竮�B�!>w6�;ۜ��`W�s�엯�J�MF�XK�ө�Q�Y��6r���=_�֟���D�8U
� �Q͙��lAAkp�;�ʮ�F͑q v;v>F�w�k��7,H���b٣?��ӵ\�1�ď�o�iV���X
hG4�Ɐ��pNw��з���j�F����8K�h�Fo�G
FK����a'�E�����Lqn8.��E�~��
Ž9e�Ş!�s
�3���Y	;��vtE�S�؝
���g�\�"�
��e|J$��j� C�}
�$(v�l���1
#�5C�.
����JݔO�
�n �@��OlX�; [...]
�pc4�YZ(��8��o[�g�A��y�nx<�t
�v���d̺�#�����)`E��Xd��c�+ ��^�EšҮ��
+
y0҉%� ��-3��P�<`���|�&$p
�c)h���O�+�p냐 {sfqAm{v&i<�5�B�o�J�Vߣ ����������Ѳ� fbq���M��/��@�� �����%�S1���mq��ʘ�'�XX
`x
�9йS8�J�2�s���
Lb�����YQ
+)��X������|���&И�ڋ��D���6�\8Cp.��/
/�
O���1"�vÁ,x9���N.�G�Y
��%�E�u�Lx�_D� ��"�?M��P򏍇��x�tD&��h�5���b6
M
y1���,$�Q�Ϊ̉eOb���Np�oG%�
�8�
��P����?
-�K�
�A	UHѣ��3�*@#��N��sa�<~�=��
+c�2r-y����
��K�,̋��f�96��īԀ� v�X��
+4��hlK̄���DA��lJ�5H��޿�!�&�ԛx���d�*>d�F��wv2�ڲy!Ⱥ�
piv,�gM%� r�){�Ht�pl� �y�� 
v�(�^4j�e�(7�78����a��E����]?���)�5�3����c@�.�0P�%_�s��W�`
�g����r�Vu�k�B��?�*��BOѲ� 4�
���s�A�
�X-O�
��Qݵo �K1@��sN@�(�c<t���8�u��>��o0<�s�X!�C��I|�v�<�Z����1�G&9��km���-8���9����l�k��=?�`�'u��Q�Uf,f�ź�̿R{5L�uR���
�l��
IO~�kS���<_���2#
+���T�dM�z��{�𧐊�A at 9��‡
+t�LLĊ)��C���@�D�z͒O���0<̗<�dZ9�� *-;[�K��=� ���7�چ�7�C�!0���z�^
{��@
�����`��Z(A�s�O�9Q~mE�����I�:��3���OY��*	�6I%�v+�՛�
��b���9��Ɇ~' ��&�:p�X����+Q~yݗ���
*Y���kֆ��9�`�z��o�P��>�ɇ\�s���p���ˮl���A?GhY���'�V���Y3�m1����kU5���1��ۄ����R
�mM��CY+�7��ڇ:��'m�q�`�Vq��s��C(2_�e��v��ﳟ�L��x�Y����/7�*k���֏�@���cN*��i,:-�t��R{�GأZ�f��z���~��7���+��j�
+�A�4X�ۄ��3V�.3'y���MMv�Ҙ��_2���*�p]
+D���k��AK
���5W�V5j	��	)ָ'��{3
�����7�3�L�����M���� _�W
a�`��.�=
+�=b�v�q�y&��C��|Fׂ1��޻�Ӱ�	�1�y��ل�s[`n�J	�D���>�>���0�2.��y�V���s��T
+��+���J92�L����������8��/	\v)���
+�
�Yo�di^Z��O!"~����B���A�MO� ]�JĕЈL�#D���,�����5N�Ö�-
�m]�7�M}���H��f9w>�|�ċzc��z��I��x�� 萟��d�/�/�Vy;��O���b�TDZ}	�R�ũ}(�y(N��b�k|�݇�m���W�8]��d�G���el��!6��0
�y�X�K�s���5Kt����`�v�#����/�X�AJ�V�
�[Yi�¿c�����$��ϣ���	���_�P0��F$����:�޾}Ío�o.���2�a��k�	vVB�/�:b��o�nN�%�l��������c
k����Ͳ�?����P"G�(��0L`�$���틗/��
 ����W�er��Aڹ3�����T�?�X��A�gYd6���A�����mӠ�(��_���uvY�{��8�p
+endstream
+endobj
+481 0 obj <<
+/Type /Page
+/Contents 482 0 R
+/Resources 480 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 485 0 R
+/Annots [ 479 0 R ]
+>> endobj
+479 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+483 0 obj <<
+/D [481 0 R /XYZ 89 770.89 null]
+>> endobj
+484 0 obj <<
+/D [481 0 R /XYZ 90 528.372 null]
+>> endobj
+480 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+489 0 obj <<
+/Length 3096      
+/Filter /FlateDecode
+>>
+stream
+xڕK�۶�B�Rߗ�I����:�;nZo��
��BM2Ie����HPb���0��`0on�y����p��"�T�j��7�Mo����{�
6?G�����6j_�j{h����=�}��
awo�>�% �7	o�wE��ۻ��7X�n�TUn�	��d���f����wq�����$�%	���q{�&y��.8�"}8��h�v��Ok������A�&q����i;^�u�z�a�CǓʃ�G�/`��3�e�������v���4f�"+�Gw#�w�k���ic!�I���
P�9K`�hZC��$rG��C`b�G�@���e�>���;t��%�b�D�H	r�m�ӹ���_�`k=��a�'��2���"��$�rIbz7A��>���zE˜�f���0��`Y��܌C�1�
/�D�p�[T�QD�~a�G�L�>�^�������q�mZv���a#I�Ͻ
G#����ĕ��y<
c=�AF�S�3
+`�
/2/���9/������-B�?<R�6rY�|�G$��x�ğ��&K�$���]��
v@�L��mVF(�N#�BH,�ʬ�D��)�k��5�5�8�'Pq�z�+�ޝ���f4��bB��
���4�ܘ;���(� e��X�~��04/��D�
�T
]�����1���� ��Ȣ�
�yY��xR
j��i
�
<[��,a����u	�g
]\�#��o�9x@�T�

�L�϶iC_F���Ժi��(�%
�G��ۧ�(����"�xEm���M�<�]�\�P�D"49�y�`,� ��ԃ[�j�
�
���J��|�) �h�$	�,
I�
�������-����<�@M�gT��j��z8�(O�j]��0\wG��H'��p	�d1#F����޵rC��Z�F�„;�
������5(��'a�D'`;OI���4J�����X��t��#@$J�R8�t�E��*~\��
a��Ŵ�v$��D�"�(%��J)璸Vn8�Q�nRxU��
�v8EW�;P��^d5G��f���y�q|$i�A�9��PH	cN`���PQp�(�
+B������3Z�;1�so}� �w��A�x'
o
��W���1��z�M��#�K�t'��$wqZ����Z��4������ډ(��a�ƸGqV'�{�W����I�I��k\z��
�3�/?"�Dz4�TM��Û薤��02t���b��u������&�M���.a~审���E�X�~�`C9rrT
&>\����7�,F��PL&#�S�b�E%ց�.��dpŶW�B�
~U�v�U�����x
��a���j����Ln�d��L��{��2�H�`U䓴� ���,S^C�A�-|� � (���y�'ǃ�� ���H��H�,�\*���c	E0b-ͦ�Pt
FsޓW	Ug�g�敚�ʣ����$<�А�
�WX���G(�a5�������n�i^�Jh�����L��=�[A�ezK�2�Y�&��ڕ�گkL^u�UX�������xvĻp�VF�hȲ�ԸR+�7�(KOn�t�"�f�T*O+�t8�P�ֵ$�jr�0�
�`] [...]
�N��|"w���K���"
+�|�w���	��������Taψ�B".��o�)"�����kSġ�X:Q��{�IJ�ǝW`X�5ס���U�w���n�Y���2a����w���K�K_B�꺩���2K��TE
��C�d�'/�F���"�R��R��RȖ�`���x@�P����@=u0j�B�*j
�Ǘ���$h�R��1c����J	��7��!M<�
Q^I����
+�2F��P�4�	6
��=	���ػ�'\��y�oaFo���jiq+%}��^ �+`K�	��
�T����]!ι��;�E{�|�ށ���&QE��*;�^�`��F���l�
�=2�˛�NۄA�(��`���
K��Ҭ����	�~�w̒�P�{�
X��x4'�l
ˍ�@�����Ƣ3��,	s�L҉�t���
+�i�ߢ�r���l�!އE�*�JK�ip!8p^���O�<�d�o�[�.%� �
dՆ����
s�K#KO˄��kdl:��;XwY�CS���7�71K��|���8���e�b�|�
޸��k=����%EꌟU�|rr�!�R\��Zk��8����
.��G��g�Z�'3.1f��I�S�%
�t
V}_XX����

Ȓڳ�”�aF����K�֧_��E�J������U���U+���4aJ��B��i=��J�K�8��|u��3
1��Ź/�U���Bk����'
8��x"��'��qj���t��ƒ�مzKƖ"�Dd�Kj�|�V~:}3��D�tt�S�۷���Ʌs�b
�3�=\y��?�Y~yHs�f�Gu�y_7ڶ���hd�_�h�Z��Q��Ŏ�
K�B��#��V�j��u�?Qq3�\8��Qv��#�ʷX*i\E�i����L?q�M
+
�1�o��C=e����X���K����T|O�7��̑��;`��T���6f�.���
+>A
'E�0
�W߶j�b3�{�w?��{��U�*1�O
+�K��
n
N���
|'m-�5L�t�t�O��-�>��?�����uw��"Ta����+�%�K��IW
�7F$���8��{�g�4�\a�$�����8�������i0�����rf�\�x���S׫u���b�ܮ|�7�^fT�
+endstream
+endobj
+488 0 obj <<
+/Type /Page
+/Contents 489 0 R
+/Resources 487 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 485 0 R
+/Annots [ 486 0 R ]
+>> endobj
+486 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+490 0 obj <<
+/D [488 0 R /XYZ 89 770.89 null]
+>> endobj
+491 0 obj <<
+/D [488 0 R /XYZ 90 614.668 null]
+>> endobj
+492 0 obj <<
+/D [488 0 R /XYZ 90 379.873 null]
+>> endobj
+493 0 obj <<
+/D [488 0 R /XYZ 90 259.704 null]
+>> endobj
+487 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+497 0 obj <<
+/Length 3509      
+/Filter /FlateDecode
+>>
+stream
+xڕZI����_����
�%�,
�xˤf|H�>P"������E����AB_�4
t���o�7�曧�|~z�>�7ŮH�t���)�M�$�^���
�o������'m���e���i������

u�<νb���o������S at K�� ��]�o租�7�������7/�t��aD�f���O���߅	7��{Σ�=�.�ej�.B��6��r4�8�d;����˳�!v�N�3O��_�0:t����m�{����y0��H%>��
|���ϧ���L��S���x����f �y����������m��BM��h1t�Ǿ{�˳��7[z�
u�
l�f��S$	8}9ՇN4�Hg�ԑ��w_�"�FD��tV�"7P��ġl
����W�$�E��}$�釺k�<v3c�.
��c�U�<���0�jԬ�QQx��ٔ�y�ys��6��GlP�a⽴�*��t��W|E+{�ƾ�f��
�!�1S6�)��v�Mu�
DI,
3�pMy
���y@˗#p�SS��7����gKu�k
�Y�eK��ӟ�q4��u�
(y��l�Q�
=�_hUN���a0MCPt�Q�=(

�Q"���÷����ҭk�T���%$��y�������6W
� %�����6��`�����νsWտ�~x(G�@̡GJ�N4ꈀnq��{�����_��
3I�����2��M���ƁsY�w��jQga�YX�/�vĨ�V

Ļ�v
�"�JtU����;7�^��,�rD���pf� �"�U���Y���&&���K1�Q�(q
+KL&��k7X��v�[���	h��`���xj
kS��`��w�`�f��=�ƀ������R����z��}�5\�cً΋Pw��T�r|
��ʛ��;5E�K�M.�y��
�c���l,v}�t��S�
��K
z���*|��;�K�]��m�N��8����k
�_�g��|`�$&���-�{�X*�����KҒˉ����wi���s�{"��”��
]�>]z:; ���FW�:}ݙ�3�u�vh-��$W��;�-�]G��䆨�Ǵt�l�X�3������İ��m�%ba���� �d���+1վ<��YJ�,f��
�ΤM[�]߾%����
+��$���&�E ���,Ib,��(�>osR'��A�а�((�4XⳐ
�
Lc�����x�l�vp��
��H��EV���h�O⯜/uJ=�y���W��x�a�i�_�`�JF�S
N@��G�Q��)��xV�cc�7:����K�i���DC��%��Q5K<B�X��ZQn����]��Rj����D.B���݉|7*��7��=|�OȌ����r��,�@��W�ku@
���,d�y�yp<(!#��~�޳��*
���'
���<����ZN�F+�M����,_�L�8r9	?]g2�Z3��!�dzk�d
���% ��o
�
�
���3A�(��Pt�j���0���-�D�T��C))c�G��'[V�
�x�ӲA�B�k�}�؇$u=��;����N�  �ד�=�)c���{J�9|W��ٳ�y�Ʊ�Rq��1Nm��[#�<5e��s3�8S�
�"叺ʟ"խB�q
/��yB^�<n��8���b�RP��t��H�\*-UY
u��Ӥ��f���4	
FRг�ա��(E�>��
���S�;�>� ��]�;����
�$���kV��T�Gi$�
K<M��(L�� A1g���1�<��
�G��
��
���@��@=9���̘(���W��bg�Y�s���|o׼�(|�\��-�7[�uK���"tsg�#6 at O��4�@s�z�PxOq6_G�A�A�Z^�ʑ����(QD�#�+
ߩ
+�c��A"*Ƿ�MS�S�h��/۩��V3�GI�3N#�	�\��7��f���'=i�A3X�k��"�# g�b�	4�YJ�rk0l [�jر�}��n�����d
+2�P�ƀ�SW��.����7������@�/n�p�������ij
��
����k���9���K�L
�
nB�x5'~�
��](�
+&�v!�!ѥ"����W�o��ڴ��
Qī��
.t����
��QW�
]�٘"vľ
��!��;q��&�z`K�3`�t璼_و5�y�!s�So�q
�c ��
1��
�_M�
�j^/U\�x[��V?�iIC
)� RP�8U=
�Zr�4�p���G���,���2���v at lD���r:l]���
 �ȥ��!�rV�S�W��5U��`���U|��LU� r�(,VR���!�4���p�:�D�E���8(35)�
(&^��/WBU-U
bVˑ��e6��Ev1���
ć�\^�@H��;�R
��u����&�C�vp�а9n�!#�E����F��C�$��U�-U��E���#
�A䁤��9���/%!X?��Y
1êC�[aӨ}_��;q���}���L�>��S�t��5^�mDZ�Χ�l}F�,��Aص�5@�'x5�s黱=�X!����"X��3[Y��y�S!��Ȃ������^�ҋ�#�*On�p�5��q��0P�͊�X(HVJ�cߝ�")J
-D�.�n-!`�	�\ITj�"����h%Q��2�Ex
�
���1�5�Q�x�b�x-����z:��P$�]�\V�
d�-t��9��=�,
����/�b^}.���e9�X�$�nE	�l�ބ�
W�P�&^ Lr�t at 1^�I#)�^(�f��<�X;����y�"��6�%�3�
,G�ز?%�d���+[�6
��%�vC[���=�[w��O`�'FA�����LH
s|({�
�~���ر~vOaΨ��y��(d;!���������J�6��T3m{B
]�q�.�����
�+�śW^&k����9���[?���{/k8C>�-Br&[
+}�g�2�#Fkyʅ�Xpo��dF_�z���w�>��#e�_B���G^=̽OS�]8�@���`}��ޘ�;��IH�6���H
��u
��
	8*�[f���`+��eg	����ԏhv}5?-�\9t�42}�Β�\Ԝf�}���(�����{������&��R�R�}�
-MӘ�!�WߐC��(
�㢡�C(��^��n��~8��<�-/��Э��� )f���7%�@�2c�w��@�s8*��>O�X����Fa�1"���7�����q�����\x��r�Y��l��>.�Z`(h5��ee�����g�����.!
ʌRDw
��1[����1
&x���6
_�"Y
�
�(ɊݕDǶ<-3��ʫU~�JM޽���W��.
�?�{��HE7<�Y��Tq�K_�9������h|�;}#'_5�ϊ��]�Q|�})�i07?��P�������
+`�
.���W5��d��
^�ll�;�}-t8�p1
��5��?�{����>���?�er���4�s��[j���2?��E�v��6+��viZ��F��2�c�m����9����sY~|�M��
+endstream
+endobj
+496 0 obj <<
+/Type /Page
+/Contents 497 0 R
+/Resources 495 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 485 0 R
+/Annots [ 494 0 R ]
+>> endobj
+494 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+498 0 obj <<
+/D [496 0 R /XYZ 89 770.89 null]
+>> endobj
+499 0 obj <<
+/D [496 0 R /XYZ 90 702.725 null]
+>> endobj
+500 0 obj <<
+/D [496 0 R /XYZ 90 130.792 null]
+>> endobj
+495 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+504 0 obj <<
+/Length 2846      
+/Filter /FlateDecode
+>>
+stream
+xڥY[w�F~���ۢs<.�}��Id�Ah
�$XB'4�2���[��!{��wwUwuu�Wd}�>�7w���{WLGS�t�~0��x:�
X��h�>�-�a`9��1u�Qg�e�/�5�n����,}`�y{�N���/��
��#k:|�M��ش`�뛟n�*ε*�12
��>���O��-K߇��	��GqfN]�-�,��̍�VCC�>��`¾(y��\և�TG��X������4�}eq�{E�t��j���h�(�
+���x/��-�
��hk}�	�=�m~w�gx�5�o��X|�k�-�lǴ*��j/ފ��3�-N��X�4�w��V,j�n�\m��Z�oJB�c���8�y��uZ&�����~c�<�Mb��$#B�>2m� ��ՁH���e*�Z#�01�
=��h�R2�9�0yXnx���CW��N��<)���7�g閗�a
G��W��L{d��Բ�Q��c3�

�����<�����GZ�EΤbϣ���&W��C<4;��x:�ZQ�7�4�]���s[
��<�N98�I-�]��%%�t�����	쌕��s���C�m�`�z��"&�@�x��ik��,��x�=v
l�`z��y-�c�V�����,�%��S�+�>���6/��FQc_�?�
W� ˤ:g�����
]�x��D*L�Q�v
��,S��8��J�h�N�ǥ�����u�[�=i�5���g�p�
+"v�b����\3�9Y��mJN�E�|=C�8B�����m�\x��a�x�� -*����-'
��6)s��" ���>��������<�;��� w���d�$$�.����
W<V���o������f`� o@�����5.��J��t�V�_^#�SK�/��ںسM�R�(�B�˃�v���O���T8a�J$@T}��;sb~cF'QTL�G�Z�D���	�H��^�
)]&�HzLdV(
+�c���[��L�FA�t�D�@fo"�J�i�����SZ�5
in<ȉ$
�^t�@
[F'ڀM&��.UQsy�.��4���x��
+�u�<X@�z˒�����1T����1E���,ý��H@������-��	���Ty�P������7x�m�?ـ�`�
�N���e�_u�L*�
;K�.f<��ަ��_�.Us
+�Ǝ�
B#M��Ј�&��iZhUd4�4�%��\
+�Dz�NJ3~��ַXU�AF�e��{M�S-Ϡ��/8��.
�-dž ��*WcU��]ZK$ #I��Ke'��ì�3�/;`W�FD&Wߝ�d�d�}���<�s6	�9
�˜��`:!�!��R��bW�[��5��ԧ��ҥҸ�QM�����}�V=o��E[��0�\�|(�����}� $m�J�w�k�u�UO�	�+{��۳'�u�*�'
뎯��
+P�Bp�����m�i;8�q����\�I��{���R>�����:M;2���Jú@���hg�~���
����S[%%
��YQS��K.���o��	�8����|@�R�c!�A�.��
�e��D�e�4��Q����#����W��s�q�X0+
xɚ~W�^{�P0�I��t0��Q.�Qj�;��*�lK��_O�XSW{��w�%��rK�Si�5��RM(��SQ� j�n,�S�K�~�(�����Pd;�������=D¾Ie'	4��jڬ!J
+ҕ��FkK;O�-
+�b��ˎ�eh�`�2�돡c��^U�=���e�Ԃ5���\���
Co���~2N0�9\=���-�������~�D�?�=w"�{~^��oJ�n�r,G[x/ChQG�����(�r��G��>�%Xˑu��]0d�KD���$����_���1b��j1��u�B��g4�9q�:�B��Q௙��}^�
BE;�~la���.G�5w)8	���&⍭���{
��k_��,����������ϡ�^�)l�<�&y���@��-6s0���6O�+�,p��n/lh��^/��7y
�	>��5@���#0��`�S�	�f�}-A{Y���k��l��BYo�����&ԭG
�c at h�]-
�?�
]�#!X��䧍�jY���T�2(��-g�
_sq�q8.������j3��n
�_��m�"�6;�*����ܿ�gQ�ſ�} ��z�y��V�IdzܶX0k����^�ګ�~	f�
�e���!�W2�Va����#�9����W�O�Nj[��[���C^���&3D�����6˅�ʁ��H̙s� Hy�S��)��2�{}>�l��7v
_�so6y�N������t�<��t��*� 
�/ԗ�ӞV� ��=�
��E-�������h�;�
��E��݊@��;��E ��\t$N�p���{�
���mҎ�]���_����3�X[?���Y�H��=��{`������%W�ƒ��{�e;���xm��k��r�1X�Y� ��DZ�6�a�n띗�Iʷȣ|��&ߒ
�Xf]ɞ@���3�5aE���ʝϗ1�3���lB�d.�Н�%��7PU�%�P2�Ι�1��R��2-��
�^��PfF�=��Oa����/��$��(�b��)���5߸��!���s̑kZ��s��cwdO�z_!����Ή���sp�����>��O�@��?g4u�	�:õF�n�K��
��y����
�M�)]���9~�������ͭ�6UR6�S�~��s,��"r��d1FƩL&hX��@�:I����ߛ����L5;π'�
c��kz���??~;�WI�>����}{�uG�c��ͧӱh>r 
����
&�
+endstream
+endobj
+503 0 obj <<
+/Type /Page
+/Contents 504 0 R
+/Resources 502 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 485 0 R
+/Annots [ 501 0 R ]
+>> endobj
+501 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+505 0 obj <<
+/D [503 0 R /XYZ 89 770.89 null]
+>> endobj
+506 0 obj <<
+/D [503 0 R /XYZ 90 643.138 null]
+>> endobj
+507 0 obj <<
+/D [503 0 R /XYZ 90 533.901 null]
+>> endobj
+508 0 obj <<
+/D [503 0 R /XYZ 90 309.932 null]
+>> endobj
+509 0 obj <<
+/D [503 0 R /XYZ 90 164.745 null]
+>> endobj
+502 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+516 0 obj <<
+/Length 2555      
+/Filter /FlateDecode
+>>
+stream
+xڵ]s�8�=��o�gZE�,o���m�K�\��M�ݙ�e��T��\��� �%W�v���3&� ⋔3�����wˋ��cg0�'������G;��
|���/p�wO
�\�"���~��1��i,�JB'�G���?�/fˋ?/\X���;��� �]|����q���$
4�n0�|h����N[��\L׵]����>���Cǚ��v�tu��k���^�
	{o��A=L��L9]��̰�^�>_̮y��4��~�����Ή���]��o@�I�t$
*�z�i�a���n
�
p��|�
F~k����lg�,ܱ����y^˲(e-�T��"Km�]���܀Z����3�Š���GZqL}gbՉD ��ig"�ɒ
��c��y}$�^�d�.5���d�X�Yj�R
�����%O+��$�X乪	^1n�=C��*F�ԫH
��`��7���cq��u�oA]#ת�* -%�]�a�*�^;�͡��}YW4�JD�ZEv$�%D�L��f�������3UI�� �R}Ow��s͹]U*�ײoWt<-E���c:
?������&�n���,͙J�9��i��
+ �ږbz���癬*<�k1(

%�j�+N�Iȶ0/�ۮy��^&��U�

���$pHL
�HL�����ڗ
oP����v���=^vwM�]�
?-��������r~�x��iK�q���DcZ����f^���)X���]&R_��R����k�uR�N�x>�hZ
��
�?��jO��'3�@�zT�XN�B��1o�q�b䛘���Kk�DE}t�+^���R�s�BUU��xl�Ճ�'�f:��X��">@H���'ik���R6H����<�No���Ԧf'a�!I���:�Q�L�Ƃ!P�e�z�隇I�H��|��}��e��M�k�#��r�ҁ*
Yk�� **.׭k�E�AR"�nT��V��1�P)T4^�΄�1
c$�Z�VbC�ҚzZ�G6;f�
O�E�ܴ���l��-�n�����x��6��-�g�q[��_�#������0�3��8�W�=Ή^;(�W��[��&�z,0Bm��D�3�H��)mBj�i$���Ϥ� [...]
T�^K�7��G�O�Ɂ�J�p���	�+�sivg��c�P
;4�(�ڍ:r�ľN e�+�+s%-��᪥!�
#):!��D�ߨ��6:!Є 
~�:_bVEx����U[�1�
�:�WSbk�ӗ
�K
+v�%�撢�1�E�*�|��^��E�7zX�
�&�k�ׄ�P�ɒ<
;�
�p<�N�\
4cxG��5�.�������>���tfoy�_���xYgi~��D�ߝ;�!��hVL����
�"D�����iI���3c���ӻ��[�\�̐��X��R#�)A�8z��4{������GCG>_��
���R��f�������O�p]�Afs=4
يK=
�M[ޜ����iV�ځ?'6�D�0�����Hڍ��:���'��
q=�),�y�gi9�!���TR������@��|�YI]�]^
{��mUn/3����(
��ީ��x�
���ƠD��f���ks���ٙ�:^C�M�)�[�.WP�p9H�p�~��͋K��
Q���#��PM?�c�_�.
����xb���]�
�<g�*]�xM-�\�gXP�T2�d|\)K���T��!���[e��"?��Us��-�b K��U�QЏ}�#�����d~��]��&a7\���b,�sW��[��>-g�
���{ciR8��
M`�7��y���b�I�����g�WSM4�� 3�F���-1zDh��,a�QL�N�c�۟�+~կ����р$�I��u,x��~�q<�
l�"\���
^ [...]
*n-OT�f�JZz@&y���R$V����W}�[Q�����՜Q��t|pԙ ���	`mLBKB��KGmØ�n:H��+s����5��%U}�S̿��2|~sB˰��B�<����t�<��
�?\
��tz
֗Fиy0�\6��i��D��SP,�J�Z���S������ANM��;�N��i�$`��$Q;�F��9��kdr&����l�'�I������5��������B�v"߄�_.;΂��m�2�nMw��%�����7�m%�'c��ҷ���&Q;����-���
�3��ȷ{aޕ�mo$�S%�����I�{�	��߳��Nrm�(e�֍1ƥ���J?��s<�uGgZ_�̷6��u}�<��
�fn��6٭�l�˨?p\;
=�@8�?/
�q����ׂ���Ȉ���\+8��ׯ� �`7~
+endstream
+endobj
+515 0 obj <<
+/Type /Page
+/Contents 516 0 R
+/Resources 514 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 485 0 R
+/Annots [ 510 0 R 511 0 R 513 0 R ]
+>> endobj
+510 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [314.956 283.108 472.963 292.215]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
+>> endobj
+511 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [152.087 74.956 321.452 85.237]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/licenses/)>>
+>> endobj
+513 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+517 0 obj <<
+/D [515 0 R /XYZ 89 770.89 null]
+>> endobj
+518 0 obj <<
+/D [515 0 R /XYZ 90 658.239 null]
+>> endobj
+519 0 obj <<
+/D [515 0 R /XYZ 90 545.815 null]
+>> endobj
+514 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+524 0 obj <<
+/Length 3192      
+/Filter /FlateDecode
+>>
+stream
+xڍ�r�6��P��R�E��Ȟ<����3���٭T�DBw(R�(گ�~��d:�
4
t�����-��w7�^n�?&�"s�؏/�E�.�0s�F����~}�~ĩ�e1,"�?<�|xzyƹ�/7��x0�.<^9I��7?��.
+ �p� K'B:,B?��Z<���Ɲ
%�>��9��{���j�e��Wk�u���ZU1�K��ʜ���\׭��n�n:
�9��/�1�ƨ��w�wnz#���u��]3���ԝ2g^!x��,X>nIh�b
�Ϣ�`����d}ȶ
T<l��iz8�fpUn
�G�;���aԃ:3N��mYh#;�
�ҷ+o��}�Cd��!b at XU�_Y |�	0��G�ZϱՕ�;�,[��n��t��e!hr|N�p��e�=�U�s�"�V��T����>^)�"�1�F�KE9 �I�-I�VQp�*
+!YEA��n;�
+�if�О9�+�'o����������x��VL=Z$��V�f�ua{�@#�'���E���}�
���?�Nή������j��?ߟ��5h���
+g�
*م��ʦ��u�p�c�q
?BtlpE,��	���%��K��
��:�'��\�A�w��h���}��]w
+5�AV�r2���:������<PY�2��]z�ǽ�f�E����c�����}@�)��v�'Hœ5dz)w{����ō�o�����w�����CcgNq���v'ed��나�c�c�;��ܣ����?U�b�,�Xnь�[5���ҟ�0��y��%�ȏ���~�]�sS�aQ��e�邇ha�� �Z����L��;� �6��aXP����,�I�힕�:"+�"�mz��|��
y$:nwylr�t��jN� ��BkT�ƺh��M������w�>�k
]��pq��}�����0�x�P�Y(N6D'�}��*
�{U�	�FU���4�W5FZ�k�7��u��En
)�`| {�0�ɣ�-h��C���X�&tZa �����h��(M�
����`�o�P4낦���VñG�
ڲ@H�
+��β����[��K�@Qb
�p���s|��ܞ9�%�Iᨥ:�`z8h���Yx�Dnfꦾ����E�g
!�P���@��VC���$�=h�L,���-Xx��z`�����I"�Jd��;$�(G�3H���t�H9J�c�lᦥ��n
�a�BD.+�3dq��h�_4�
�`���A�h���1W�.L��L�
+ͮ|s斴�
�مi�hc
+�ܰtc���--N���
 �ȭճJo�[d4	��|�x�(���6(! 0)J
u�Ѐi��^���_&�}+t����*��uo4�-�L�
/B�8vZu��Vr�0�
ς�B
����$v#dȏp`�#��!~l��He���1��!��9*t[�j��dV�p��*��ї�/��Jɣi��+�
�.2��!�#�	��P�L�
����qKG����
+*7���Af!d�����<朌j�-K]�ɨDޒ�\stxCy��|aUpTA�U��D�' �Jʭʂl
A�-H��
���n-���s��aJ��9s
�i�N�e���O���+����-���
�$W�Mn�<\���P@����S؅��Aΰl{�a�
+
+�.��P���!
+�.#Ҟ���JA,��u�����(O�
f �L�FS��K,z��6V���G	�S{��<
�{gc�d/[��L�wCBo���R���
nj��h�×/�
�}x�����'&���;�?|||z|y������x$� �x� �zW�
�h�@
�/����V./H�q4�2�6�H@(����q �v��esŸ��p>
+��MC#���fn��e�p0��7��r�Jr�0�2 l��^d_OB�c��fɠ�Ɉ�̑���{��ajb���wQ��L�8�b��9��
��!~U՝�P�!	N_�>$�9���-��T\
���:�
@�^.�� ��l��#0n����%�dP�!W}��7Ʌnm
��	ݳ��9N�^"�
��0�6�'�+��$
+� 
���la�
8I��ʃֈG���l p��
$��%Ȭ���U������F��W��_�Уa{{n�[�O�-Zyx�^0�\;�3T�8(�ܞ풡����<MN�W%�t��}��
f2���ѿ��A��s�Xj�㋆U��}e���lj���
���n?Kf���w�rr+�v�SCD~?f�0�	/`��o��yJ���ȝ'�
^]��ؘ����h|dzRv� ='H�(&=6�]�)����CByqoQ;�*m%fH��&��e6����j�ߒy���[[�y��)���S�M"^֐69
!���(b;
��
�kr��8`+��tF�3XI��yX�c�W���l'E
w
[,��zu�@�+�w�f�v_
H79b�c-�򘤎������U�	�uwn�o�2f�1��A�R1�M�f����F*y�!�l$c����G!���1K���Rb!QvM/4�	*�SB�Ց`ClY_/~�L�Yf�e9����V
�ȿ�o���R��9�ã��Ge:�(L_�x��̥�*S��
w��.��>�?:J�J�:B�>$,�c|BG<n��g
��e��᠄Y2�
&7��x�Z�H項L�kL�S"�a-T���FT?�X��u�o�ވ7�Ѱ%	˵����L��l ��J
�����@�?q�Ǧ�Lc C�]�
�� �����*T�BTy�W�+�
��0��noyH�V 9M�M�w�H��L��H��veW� [...]
+"h��)x$q��Y�1�����!Tɖ��s�'�7312�`ؓ.�
:j3�-
*4"֢
!c�vzaLDJ![^o�����Ha¯U���FY ^�
����V
<	��I�Y��?m��\;b�k��;����M�3�ķ���OЁ��8e�1Gzk�`���w�z�C#I������s����z�;����듅a�D�����u\/I|���iҮ���!X�o��Hn
��#A��>v���m^8���M'�
���;���
�>=�H�ţ��*��\@?��
	�?Ki�}
�N�?���)[}j��bG6���«?��~��z��~�Ks\�$�{v��p"��)��ګ;�?y
�
+endstream
+endobj
+523 0 obj <<
+/Type /Page
+/Contents 524 0 R
+/Resources 522 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 485 0 R
+/Annots [ 512 0 R 521 0 R ]
+>> endobj
+512 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [225.562 672.092 508.501 682.996]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/philosophy/why-not-lgpl.html)>>
+>> endobj
+521 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+525 0 obj <<
+/D [523 0 R /XYZ 89 770.89 null]
+>> endobj
+10 0 obj <<
+/D [523 0 R /XYZ 90 655.975 null]
+>> endobj
+526 0 obj <<
+/D [523 0 R /XYZ 90 623.669 null]
+>> endobj
+339 0 obj <<
+/D [523 0 R /XYZ 90 623.669 null]
+>> endobj
+522 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R /F83 436 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+530 0 obj <<
+/Length 3688      
+/Filter /FlateDecode
+>>
+stream
+xڍZ[w�6~��������
+����I�l��w�ٶEI<�H�������$E3����`0 s���na/�^�|�x�&��2�p�]��"��e��Y�fyW7n`[o?�"�7�����LzwU�
��Mڼ*�>O���������x|w����녃5�#k�h�H��a/6 �[�K/^-���]�b����
{�n8e�q��#�>������	�?�'��x�VF����R`I�Ҭn���N���V�Ǥi�]�H��ʷU2��'�\�7m��F�
�Dg������
g���L�/�)8O��
�
��{L ��~`�f\�w�4ʪ�� �L�&95S�N���p��uVdI�m�וڇ�3(*Kl�^Y���?
�ٗ��I����~�Qۡj����ʱqv>�r�
��
'�'
i� �����5��˞�h���-	Ad]>^A
�l����%�VVZ
i�I�X� �
 �p>d�.�B�t���M�%�d]謞hX$���;;�YJtm�ò
+�t�U}Ht��}��
{s���w�vS��a$RBʯ\���h9V^;��V��+`��Y��9v�"O�"�� �	��j��
HmI/�Esq�y��;��S�
BK��:�w�3���zS��6���{LqCa/O��T���M�Vu#C�
��ہ-���\�@Z
��(�+�K�c��^�`�#c�%� C�
+�XW�:9(=��h����	�{�A�6�!���&+T�̍V�_��	
+�l�ʷ�k�NѪ3�!�
Pa���cg�K%���L�_��j at d�;PH���Q!M*D
g�I�x���
z��:�ړ�Y�B�l#��w
��NM!��?��w!
­�G�
�I�(eV=b��~ѭ��&��P�m�t��t�As����!��tG�~�o���0�b�L1�� ]gY)��3;����w���
+iYғ7i��P�7
���M7��š�L

+
.�g�Xd�D
 ��
'&��)���
�Vi�
+s>���ȷ2؉ꢥfǡ+�şJ[k���a��ԡ�Ju����!v
���8{�j�����ƌ�IQd��.:&8��s��
k��Jǂ�[��
��ߎF�a��%�gF��?7��2-:�t`
�� �����^�di+V)�
��:c7����P$��9`ᐦ��>�ɿ�����h������
���t�K���G\Sq2�g��w�w
�b	DR����I��V'�s�4�K�uű���x����{@��)��c+}�xe=ܽ�&k�]�w
��'���@F�`�y����	����3���
�il�fVyY<��.�
\����k���44
s�wo��h/jZ��#��>͠Mq ����u"�����pb3Q���@lO�O�ŀ���4kD�"�"V4S�"�"��@��y����*1
�@��
�������u��Q�:�����hd��qW�E�.�s�L\
4�aI!�f:�d�D�L&�7���$ `{ӥf�ZY�@�[�#ll�fV/$�
+��%�ٵ@�}�j����q�l��(�
����B�dc �����Z����S| 5Sg]U_�5�ہ�Q��k�d��Z,ر�7�� YԢ��f4��ي��o���,��
/�S+��W%��
+�'��]�.L
+�ƶ2�rHolr��rM����\�i�5�ru(��%��8�\9������9�o�!^*��2�9'1h5ᰞ��tCLD����S��hZ�F�9��\/@>����#8�����u1Ž�� �r&�= h��A:
��V�O0�(����̹x]�W�q*�/Mp��A�D���d�,eُ�1H�SmN�┙聢�U��&h��.�-��T?��R��
X��)���A�
ve�
+��@[��`\��R�\.�YN�L�u-:D�l�?�@=��৩�Cs
��"� �o�gbt �*/pG��3QK��[ē�R��)iw�;�})��1c0�� T���-
+�q�V��]����Cw!6� ��$F�r Yg��ކD�~a&��.o�/����w]Vs��w�M�@�"I�����s��B� ��d��˥$��!D\A^i
�
��Q@S�r�V�ӗ�� _������>�֩�d
+���	�Q]=S�	�Z Z������
+�P�n����"���D�i
+�9hzeT�D���n����7�ah����O4�E^��:gN�Z
�Cf�x���d�`k���!�Po��>�5�T}�l'
v�Ր�`�]|��E�`u��(��\�0S�d;�t;@_��A�#��;��~����9�(:E�[L��HƮ�J_w5+�b[Ie$
�'�O�.��W n�(�����q^?\�T�6�	���&�
�ɺ	`��S."`��S���S# I�̆&�y���IU��h�� ɮ|�-�-t�zEZ7���:}	�M
9&���l�߯��������������oez87]����!M�b�m�VѸ�C�sC�qmm��}g2(feuV��Sg�k�(�yw�-�]��|��V�J�K�O����Uy6��|���pa<�^�F9WQ%��K�
]��o�qM�VA�(�\���j�(��3
��$w�زv4�P��0Ne��
�FkkE
������R� BQHC*���S*��
+Z�%h�F��J�F�l*�H=s�T�n�'Ph*�a�/AD�2+H!��:�)�lmxj��
atcWM{�i�
HǧS	3ݗ� �bfI�I�k��j
a�R�+����R]JG� �3nMe
�gm�Z��'�1`m3;��J�q�>��|!"����O�
+gDH^%,9;e)b{��=�D
6;���=��H at X6|S�J�T����B��ﷂO�̄�S;0���Yw
+�ʪ���8v��y�2&�
�ySl
;�J�Me�i�N,�
+heⒼ�	L��\`$o�G�a�"3��%�W�1��3
!fhMD��G�w�g��3N�
�Hys,̐���:O
�q	<���|���������;
+��S�C�yk��1u��6%��?��@�K
!��&F<
4�p��7�Ym� ��H\���:˘�Y�!�)�
Q�,��ĥ�
۾V��7�2J4��}����=D�x��z��(~�"�5E8�5Q��U���͐�cɳ���M�R�L}�����@�/�n��x6S���5r=����w��)�#�������n��w��&+�g�bΥ���=��N����^�W߷}k���:_4���M 3���cIi�er����g�at|��H���w�=u�D���\�$Z+�����;����B���� �'L���0���7?��Tuv�1	U���A��fM�Č�F
��1t\�P#	g
Ԩn���z�zs_�c#�
��q����e�&@�GeGBeQX�&����m�>W�iZ{�1�aHи�Qa�<(ȕċx�xF���Fs�\�/,*�jT9o�yZiD�xV�8�k�T��;�Q
��Ѡ��J<�S���\��
�������L��l�}ƛ\c���d�N��� [...]
+�e�z��]�]�2�����ˏ��G%
����^�Fo��i�L�2�Z��T8U�/��q��CRv
��M��\z�8K7�"G���S��e�_��O��;ځk�K��1$�p�
x�b��Ի%����M�EK;t����C})_���M��.�
`;�0t���^�Kۉ�a��<h&*����[�U���/w�s��
+endstream
+endobj
+529 0 obj <<
+/Type /Page
+/Contents 530 0 R
+/Resources 528 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 532 0 R
+/Annots [ 527 0 R ]
+>> endobj
+527 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+531 0 obj <<
+/D [529 0 R /XYZ 89 770.89 null]
+>> endobj
+528 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+536 0 obj <<
+/Length 3230      
+/Filter /FlateDecode
+>>
+stream
+xڭْ�6•����ݒ�̑�d���l�V�٢mmtxt���~q��d�djg��Z$�� hwuZ���n~��y�:qW;g�����ڹ�$�9Q
�|���
7ܿYq�x�&�Ň��������ͫ��O7

�+��GN����o��
�oV����!U���[��n�y��[��[�<��x���f���uV�hէ�hU��tݫ����w<xlZn�&H�� �_��A�:k�Z�4��k��
��n�N��w��{�X�z�b_>n�h�
�A�~l����P�ܾ
�l�H��RS+Y�,�^�%r���﮶ �]� ��ƥ/r�Y�_�5h�*�:���aM�_��;�CVr{*��%n��5B���f4Z���<�������%;��1\$N��q�'I, u��g����7���
�d�&���n%��(=�#i{���9
m��P�U[�'�VM+h�J0�u�� �vU
��E�Dl��吣L\o���_Wh
�E��p
9
���M�۬�.�z$&�ll<��I�
���(�S@�a���DQA�#�ᄮ�z�*j���g�.�۸� $�ϡ�@�A
p2�Z��Ҵ�h�.�C��s�{l��[���&��T�Z�D�Z��CLJ`ҍ�Ϩ��Au
A�CX�l|X�.�,_�E�Lc��1�y��
�r�Xm�7��츛��/Ug�pu��e=RO�2����	����RS�,�U��@�EV:��!{�(����b�Xj�.��'���G�l2'E�Iٟ�mŴFg£�T�TpW��(�p���)��^|d�݉1�v,��/��Qb�
�L+Y2pI�Q��e'
C�������V����°e���P�%�[Ue�&���^�F
#�H�坲�-��h~�`WJ]���3n�=���Vv�sL��fB_Tz�4�
���Ս�S� �����z�K�4fնNg�ʢG�_�r1�D�,��(U�Y��Q_(��*/D8�>P�a�]�N�������N`�9��E8��1� $�O_����nK��^��
H�ܴ� �b#���
i��WG�zx�M��G�r�/�h����d��6'�˳�OzF��X+��e
\�5���b�"�1nW_"��|�K�q�
�&:s��a
%- :�Y�OW��Ӂv��������o?���i��4Q�o<���0�+��ۖ����9 �2��\>�k�c,������ `��8xX ���B�&B�!jV�nJ����l���^d{+��h4���V�@;~�
+=���Ҙ�
�� ��x'�C�)rD��Zo
;�
ј/Y�Š%6e�8���,�db-Sh�
y���ɐu�����9
��OC��"(��V�i����z�	gПp�1mp�F��*�}i�N���^�;k���c��uD�:�lf���w1jҦ�� Ґ�y�0�
�6o�SN����;a������
����G���N�t����`��$�A�7
�1m�
b�_�E_��G�iv�
eXx�ءX��a�Os"t�hCqd,��|�!v&
�k�Ab��	�ioY/K
g���ý��l�ۉ�0A?�
7th�(|B�H*Tp
#�7���p
8_EI}b�I�VH?H���o4
1�k�G!$�3
6�#Cſ�]/�gq��
+
+4;�@r��P�S���A�s����>hR��_F�
+
&W�ؑ�Yh��ZJZ ,�++v�
'�����h_�br�VE�(�Ԟ�l
�8��������W��-(��\��$k�Ġ��
�46a�b#
�sHf�_I��lv��������z赪� 
+��82��W9�4��\k���f�������n��`�vp��;,	��T�v&T�_b�x��L���xk�$4.-x��B%�x��w��m���[�`;\	��:nX�`�:�P��˩64�d"�����p��(�
+ :(99't%+�x;\g��Av�X��@�D���&^<a^j�;��,��,��5�FM~h1
+��������g��Mp�sa����WH�%�E���J����Z;���r�Q
��;=K,�cݗ�
S��0�
+�^=��z&�s���\<�.`�A�:ۜ
 1;�>��
���vGH,�B�CW.���YZ�����]-y;'��BD���]����Q��n�
J�UI.����$5�D;�$���D�
+U
�q��1��\�
�۔u����c Y�0x��B��iL
�w��
+�ٳ�׊*��i��#hY�/!�=��Dg\���&����A���dt�Ѿ���iQ�
�',J)8I�	��$S�HR�j
r��Q1)����1�	�� \f`�����Ƽ�8a���RH/f�@)�,x�$����Z􄹜��Un�=�?����5�[��O�I�?��Y��X�Q�.�ԵS��W��s�
}��o���s��[V� L%(
�1�@諚B��{�I��
�%��@�##h�[\P95��,�y
zd�)2P�>ҰՁ�@��B�
㗃AR"fj�1#(g�|�%_~��n��YQ%d9��<DN/Ъ�B� �{�@"�`����x#5;��N E����TRG�?�FAK�`��t����
0�(�O63M�����K�8� �Μ�~���9L�e������m�[�I��'RN�K|���t&`�Y�)$6�ƭ\�./~nAE�e+�Pb}DH��C[��Z4�
+lUX`nv�Y!��k,��feD�U��ݛ'CP�O\DA��Ӈ>���]_�����x�j��m#��U����9�+4�3&֯�	�	���j,�n���I�n`�5����]Z
+&��I)�e!o}�\�NM��3)!~c"U��e��~bi�,�1Q��WIh���.|iG� ��J/�;
+�=!\��\��a�
��^ �B�\����&/�{���v�i$������r
0��l!Y���<����3��6�%�cT8�`�rr�*OL��@d��.M��O�J�^�����(�e������
S�Z8��Kg��_����Q���oVS��)ƚi�?B�&�����K�n\���ħA�M�z� ��V��e�Fr[��
	�8Ő&)��$���׋�ﵨ>~|ˍ7zv%
���`�
��d�#i�~����
���j�k,]
d�`��Y���N)�0�����;���x���������������
�j��'2HǍM�w���\$�{��_:���h8�
+endstream
+endobj
+535 0 obj <<
+/Type /Page
+/Contents 536 0 R
+/Resources 534 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 532 0 R
+/Annots [ 533 0 R ]
+>> endobj
+533 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+537 0 obj <<
+/D [535 0 R /XYZ 89 770.89 null]
+>> endobj
+534 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+541 0 obj <<
+/Length 3215      
+/Filter /FlateDecode
+>>
+stream
+xڭْ����/���5u'O�kӳs��'���>��fF�<:f��� (Qnu�V2O&A@�
���`����g��`U�E*���nU�,.�$�Y��ŋ��"	������v
�R4{�l���{��&�[�Uu��i%^���{s�����Eg���H�,_m���J �Y~T��鰊E��������l�.�a��q���0�ÐX�,
n�����qZ��A��G�s��O�Ԣ�^��״ Y�z���	'�ש-+ V^ս�+U���_�_�f-�;��
+��]��u�R�zkt�]^!��>��S�7<D��^���G��x\gn�P��5�p
�)��$�5r�G�q~J
{����I6X�Uu�<l�^�[�>R1
���:��4!�Cg��}�7kxCo��tg�
+
�����+']`����6
+��J���:V�d�a�A�?���Gl("�2��(�I�80���M��`����u��»���	8�e�"�<#o�eՃ�%��2�ny����zf��a3L4���	���v�Pn=
6�e��[�{���:�}�x�B�.[F���Et�$p~�-��q�v���?�n�-�m��Z���R=r�縇�aV
� ��Wuٴ
��
���`�	�Y p�'��`y�z[
�%m^rT�� �)�� �@7I��n��0
=�>8�G���#�#��Q�
j #�p�<
NF����zu��zOˣ�p�3�
�Ԏ���	��:�L��@[��2+�R�����9k���L3�.<j4V~9?Z�
Su$�=�y������
e
�2��0vQ��)����儷�p�X
̳���mG3��i�k!,\d���w�����_y<���%��˞F_Yi<�c2(��Kٞ�)�]�.�c�4�*I�D	�)��ʢ
59��?�
U�:i�dީ,��=`��Qs��-����}-{��5
��M8>#`7�
�؂P�
ENZy�6>�R�H1L���-���u�r�R˒�8h��qÌڌ�4����%�A���''
׸�5�?�A!�Z�)*����
�Ψ�	#4>

��
����ljo��
5�g<
�
k���/ 6�YD"#���Q������̵�s׆�@�B�� _�ti�tO�l�
�@��Oa��M�C� &�ꂖݻ�����#ds�_{��� C�V
��tGn9f/�J�PP�@�ُ
�S��J����oں��k�"h�x0eD0��Lw�3,��K�Z�_����4�M�������zIvgɌ
����XSM���mQ���v�TH��A*N���V���b��Gl[ �4?ʮ�{E0�S G���s���׾��|[vL�c�4}m\�
GS-�߭��o�$�i����a)b��� <>d#B6�+����Pa<�I<�)�cB���tu䬐wÑ����숎@&�@�,����<;�N�D�PW'>�V�e8X�����W�������~��H�l
&6��솗>I�0���m��=�b��
:�+��
�B�蔂��K�� '���3�vh�\��m#4�e�*Y�h2�)f�~�s�
�Qv��
{�<����0���rr\�+>�U�<nD� ����E�
Z���D���� ��e�U���A �*
[ʻq���
S�{Y����~�J),QْqPC��M��
&�v���f��l�:Vr��\hS�����#�?��
!�
���=�]��Gz�}0d��+�;���
cg1���T��ǧБa�4��V�Cg���d
#��I��x��Sa289M�p�0�]��rs蔥Dy���u�l/���ն��c����
+�~��!��>'#9��n6�a���=+��bf‰��߼�y��B^|z�����B��hF'���w
6ڸ���A�^�X^"�f�0,�#�VUJvF:X
�����
+_.>��
Ş��Ȝbp���
+M���~
+/&��8Ό@������1��
�8u��F6A�щ���z`"b��h)"V���E�Z
�]�y�q�\���a���BN2CK�m�zlT
�
��>ԓ2Dvr�@��s"J� ��
<�s�0~47g��7��~b�uϾn�\��/�<�\��eĦ�4��k3,��,qe�W������̭�3Nf��w���_~<0r
On]1;
U����h�5M �.ղ ~��@RS�T�6��4��-
�k*L�?
��G)(�� 
��&*"�u�F;���ْEر( í�–K��cpT�#�D,���;䱩��o���P4��ن��G���C����q4��P����`6	.�L�C9
���C��t��+�$�(^�A@��&%mL]�l��L�g�	��v�,�p)�ΐ#f�i^��Ij�Y>RSU�'KB��r�
�$>9�w��ǦUF���!�]?�_��j��]̈�� '�?�/}��W��'�e��qnL��*$��@c`	{�<����
���V:x�N[�m� ���@M{��)���
`�-A�cT����$�@� N�	����x��2v���<��
���6��I�ؕ7N�Vc���_�<zE��m#���u3�p��l�]�9'
�5�J���
TOw�l��戮�J�}����͇��D����'��b[Z%�ͨB�06T�x�f^w����l}
+'	��]��
`n��n
+3�`:a4���c���H�b'��k]RA���
M���q��tG;�j����;{?��H���p$��Z>���i?3�)�=�?�=�=��(
+��1Ip� 	.�$��IpO���Ќ��^;�C���5͐Q'D��'�x#�	�]`&�r�B
	�q8>z|TNW
R�#(��Z�K�Mn���4�ED��h�%
��&�bL�x~B�gpC���n�h>qn�Ԡ�F�7�
c� |���-b�,���ĥoL�8��D5��O��Iq��f�	Ʊ}��Lo����s�ᮅ�я
�
��E���.vi��#+��ڌ,83E
+ю)΃��6����6J���������(��,��?Qq�'E�V p�Ǐoi�F���c�A�z?�&,%3Pa�P��W�	.��PQ�Bփ���
�D&`�PR����@r��M�~Y����qX8�@�a�o��}��g�aߩz�C�>��<?�� 
?я�Cc���kL+��!.��?	B?M�U ��׋��,�
�E���n��e�2�
쿫fbU
+endstream
+endobj
+540 0 obj <<
+/Type /Page
+/Contents 541 0 R
+/Resources 539 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 532 0 R
+/Annots [ 538 0 R ]
+>> endobj
+538 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+542 0 obj <<
+/D [540 0 R /XYZ 89 770.89 null]
+>> endobj
+539 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+547 0 obj <<
+/Length 3231      
+/Filter /FlateDecode
+>>
+stream
+xڍ�r۶��_��ˑfb�w�=On�$N;�V��}�(J�	E*����wo A�v;�	��b�X�]�g��={w�����md�b+�p���b{���0��~�;������.-'aA_�ެW7�{\;[�Ͼ�9�d�
�X�r�
�~�Ӟm�af[^��=�q�
|�������Yq
�q���Z\x�=�z��n��j}}{��p{��z��G�7oV�W���Z�n�~!&/߆&i{v�DV��L�
+��`��ǓʓF��y�����M��ǬhxVV����۬R
�������`�	ƒjBhV
��SR%�
�[
�b��2�����[9�6O�
JY}�_�K��
+����x�G��y��6�@W�w��)�d�
IlU�Tj�;[�B��V��W�F�\�
L�<϶BRϓ���P*�J);g���Iش�<��
+�?4
����U�WU�U�D��彖��Ea�oQ6����m*�����E���ߜ!�T�h�&��~����g��;�6D�,���C2>T@]L���m��e��8�秬��V|Ѝ���`��\�*
3%�T���E�$�AhR�|�b��n��z�G�fE-'lKRw�����?2���
M�L��y1�S���`̕�:�� ����{����I�=o��l�c�lh�Z�u
�r�J
��q�D�L�b�z�s��_
C��{����	����T,&
��b��J�M.'����Z@`Q*��$;��=�q}/B���
̉�ʉ=�Ɖ�b�!��ae�1��;�4R�  �*A�R;;и^w2X0�sG�E4S��uL
ym#Ǟ�$E�GX)�&�z��4b�`�U�~CEɚ�/ &����T1š�0�}����UY�T�(����!쒼�
ث�X춪��8��>` 滲:J`�E�}Pu�:8�
�Zl�4K��K�z�Tѐ�����X"ۇ�6
��P�ϸ�s��
`)�X�]�������A��^x��J���1��>��{��B��yŸo� =|��V�a�n�#��
5�w�u�8�e+Ȩ�8��aM�K=<�����cì����zov
`W
�tA�.M��B0�An ��]�6���p���g��TB�
��yk�3N�}�8���Y}�R��)ā��Z�9�O_C��u���?���ט���\D��$o
��YB$CG�:�9Z]
���!�)���!�Q†��[%Rv(9y�� �9\J��L��hA��V
p8�
�53h
�r�������"�^h��@h"�vp�AdI�.M@�
�t�$�M]3�
7�XSʁC�Jn���n6 ���t�Ɍ�#���Xb~ ,7y��4Oԑ���
pJ��Et
y! ���$'
�Q/X��^f�^�b��-��Gc )���p�eY8�{�@z%ѫ�KM����A �޵�&z�&�L�E ������d�CF�h�_kh��h��@�GB���g
3�Ļ��� ^��ˢ=���g�S�{�
 ��:�e}TV����k����ީ"���^����ڶd� ]A��P�����[Q� ۓ��s�Td�o�>K�ai� 7�WX�=jxw���N��;�{���>@
��%?�
�*3��j<��>����z�6�'�U��¡$�i�)
넴i����^��j��Vw��o�)�5�e䈳�\�> �#�"
HѢ�B�����佗��`�p����h��8�M�S�hIm�A7��=�q ���K�����5,6��+�`=;�u
b%M�
O
é*���,<'
�ƒ{���=܀����E.��@0sJ�Cm�(vu 'Ś�c�6��ET��0�YGAu��
+"@�
��P㳘`ԋ)����M4��L�y�e4?%U�5ZH-	���43J�-�q�'��j�73�R��I,
�s�����#���_����^	yC�	tb��*�O��%.6
�к�B
�:� �Q��e�jo���
����T �-F�����݊)ܭ~������[�]�������~���aM�
+��-DF
���r�P{�;��",�
tP,v$�xB{�|�)Ѓv
.6�Hw� �:
�{�w7_�Li�8�����ɑ:J�Ӕi��
{w�����	�)���e�/m�`��*����,�T�$
�N�i:9i�� �]���2���T`����I۬� >�
+%�A�^QÃ�M��((7yv�ͣJ�%�d�Y6<�}F�=�:vȿ���l���R9al� �F��iN?]^><<X����j	>�1�vͥ����H7�0���
'(��G���C�]%��)j��
U��{�O�!�Ml涠�\8N
R��
����F�S3_���R*b9��Z�ڟ&���\Җ�
}(��=�
)�
�
��祐��
�@��ÂA�\0�q�]~#
_5�Ź}B�p��Sc�7e�e�s�A/������ �),����LI<��sHX��!�-/�
1��

z/J�'��DKgj�>cL͠
S��xp9�� ���:�x0�Vɮ����G^e� ��!��.��.uv�N��I\3#��%���#���q��y��
�%@
��
8Ffq
{:�K���CYr�Z0�u���HM�-"t��֥����-5F���(�@�N\w,hrgd����Nm�
��X�Rt
-��0#?;���>B�����&;:���#e������^p����[���A�
+tb9���*�̫�oѲ�[�����zO�h0e[ y�H�d��
�NDO�˷iF���_��xR}v��j
��E:
Nm�BW�
;
|�&
��B��}����6L��7�w��y�;��k�S��~<O�L��L���乖��V����k��Wh��HY�
濭������
#�\}Z�ս
B����i�4(_
�{l9�
����_�Pj�kpҹDuıH���)v�3��$�A(���!��`��A
���h�"��48�U��8�;�AR���q���o8�n
G
�|�� �L��O�w�|n4#b!"�.~�'Q���!�۪,������:���H��&��I�M�'x���h�U���<Eg
���?��l��k��$��!�
���V�z��o5��~d1���wpʶQ2	��1-�=��>z�7%��] ��� �%8�Њ#oI�j�Y���C�r
+;L�?���E�c�f	$���
��!`xՎN*�/uV�_q�))�V����c9PZ,�-��ܽ�\�r
��o�=�*{+�_0����
Aj
:z�NW�Rw�T��ř���D���
+endstream
+endobj
+546 0 obj <<
+/Type /Page
+/Contents 547 0 R
+/Resources 545 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 532 0 R
+/Annots [ 543 0 R 544 0 R ]
+>> endobj
+543 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [258.676 298.279 428.041 309.183]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://www.gnu.org/copyleft/)>>
+>> endobj
+544 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+548 0 obj <<
+/D [546 0 R /XYZ 89 770.89 null]
+>> endobj
+549 0 obj <<
+/D [546 0 R /XYZ 90 183.525 null]
+>> endobj
+545 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R /F83 436 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+564 0 obj <<
+/Length 1505      
+/Filter /FlateDecode
+>>
+stream
+xڽX�n�8}�WyY�������n�n�q�m02m
�ť����
r(�r�4��drH��
�hL��C��ѳ���,�NB����l�$ԉ��!���G�Ox@ݷռ�%���\~��v|��E���e���^�F_G
��a�/ Q����g��A�ڡ�Kb��l*
�{�;W��Gt �;1@
}
�qNx�8c�1����݇�$��=SR��E���,�dU���,�e-O�xz�Z<�P�DŽ��v���s7U��]�1��1
\�K�r�k	\�2Q6(�����~S���l&�+}O+�7GT��{S�
����3�~��{���\�54+
��6kV���	r��yVJ>�L��I���
F�Ye�S�.��^H8#Ӯ��u���uG���Gz��g72+�6Lӫ�f�^N���tv���	N��;#(���ÿi����8��MV�q�]�f`#� e�ջg�,���,�{��K���[��cl�ڥ=�h�
��ȭ�Z]�T`��Uq����hA��=�ZЬ�YU
c��엪z�)�>��1�n��y#��B��hkK8��n�����6uִ��G$��
�v���ܾ~�����������3��
}$�un��

�����J������ܽ��OI�\5�
J�RԆz
+���
^�=
&�Z(��R�൐f.X�@���,�(58A�0�OK�j�J�Z��O#�|po�B����&�jɹ,��e{p�b��D
v��* f�ՙ���
��4�!���@&�rt��?:��|��!�o
+.��E^_��;��Ǧ>�s�3��m��ZZ��
�U{�
�r������T������6�3"�A��
͹�ׁ3��^��^k�	���
/D�lŲ/����V�%�:��-���G�Gx�~������tpv�X���צ<=R`�>0{�/�s��׃�e9�y�!����FeҞ��:U��d�����
#~H��^W�f%�J\�ٍj3�@L�*�˫��88̝�g����_4��SǏ����P�'�

���� 
)
-
G�*KMJz
�=��碮Q�ޅz���W?[uD�J��Y#��w[Ju[�J�,RU�\�q�O,{�Ak���
@������V��W�F6�=����16A~'�&�D)O�b^_b��;���%1�\
ụ'}
�W�k+���
<�&y44�*]���:�.|k��f-��2/H*��Uzx{*���A�^���|�tM�qT,]
}��?��GC��2�	���m�
�t�8sz����I���
�
_d/�v�(���݆?����ӈ����#V���!'4��MO
Y,��6��� ��V۞�f��W�y�]��PK��8\��ފ���~��}J����_+�#�^0�!v�m��t�7؂n-�C��j����ӛv	l_Țw���p}kȺ��Ju�c��A	�b�� t�(#!�2�@��W�C�E�O��
����N
�yQA\��z�
�1u0
+endstream
+endobj
+563 0 obj <<
+/Type /Page
+/Contents 564 0 R
+/Resources 562 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 532 0 R
+/Annots [ 550 0 R 551 0 R 552 0 R 553 0 R 554 0 R 555 0 R 556 0 R 557 0 R 558 0 R 561 0 R ]
+>> endobj
+550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 433.875 513.996 442.851]
+/A << /S /GoTo /D (subsection.8.1) >>
+>> endobj
+551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 315.381 216.421 326.26]
+/A << /S /GoTo /D (namespaceparma__polyhedra__library) >>
+>> endobj
+552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 305.329 513.996 314.305]
+/A << /S /GoTo /D (subsection.9.1) >>
+>> endobj
+553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 188.737 513.996 197.714]
+/A << /S /GoTo /D (subsection.10.1) >>
+>> endobj
+554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 166.669 513.996 175.645]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 144.6 513.996 153.576]
+/A << /S /GoTo /D (subsection.10.3) >>
+>> endobj
+556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 122.531 513.996 131.507]
+/A << /S /GoTo /D (subsection.10.4) >>
+>> endobj
+557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 100.462 513.996 109.438]
+/A << /S /GoTo /D (subsection.10.5) >>
+>> endobj
+558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.6) >>
+>> endobj
+561 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+565 0 obj <<
+/D [563 0 R /XYZ 89 770.89 null]
+>> endobj
+14 0 obj <<
+/D [563 0 R /XYZ 90 535.111 null]
+>> endobj
+18 0 obj <<
+/D [563 0 R /XYZ 90 501.018 null]
+>> endobj
+22 0 obj <<
+/D [563 0 R /XYZ 90 416.597 null]
+>> endobj
+26 0 obj <<
+/D [563 0 R /XYZ 90 381.551 null]
+>> endobj
+30 0 obj <<
+/D [563 0 R /XYZ 90 288.051 null]
+>> endobj
+34 0 obj <<
+/D [563 0 R /XYZ 90 255.759 null]
+>> endobj
+562 0 obj <<
+/Font << /F70 332 0 R /F72 334 0 R /F60 312 0 R /F83 436 0 R /F11 395 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+598 0 obj <<
+/Length 891       
+/Filter /FlateDecode
+>>
+stream
+xڽXKw�6��+��XX�[��6qs�&�f����(�L8��x:��`w�4��
܍WH�w�t_� \?���/
+����k�1P\#!��#��$
+?�׀�-��Nz��.����v.������)
H�^ �U���ы�FLG��p��3�� 塚~���
ŀ"��W�dS�'��L�gθ]�0D�]˜�2[6
Ӟ�K�\�
���r�4d|���l�όR$��[lr�-kv�yn�z k� B����re@���4��rW7��ol��� �㰣Q�u�Lv�ǃ���
U����jJ�ƅ$�U�,B��q���uɝX^1F!��"��B�o���,ӱ���-�3�M�-
���q	/��_�d�z{�d�me7MV�C�@�'��e��
�ry�~ 5��� :���P�#R�I�]���18�CN'�i/���ۈ09?��#LO4�jJWe�1���ܓ�ɵ�tۺ�(����I	}8%(�|�T{c˴yzo���)��r�MVZ�Bo:���}
+��(>�k��x�D2��#
K���o����k�
+2�㲆<:1��v(THE#���9��8+l=��������'�Y�
�B[�zZ��WL.3��5���df���*�V�
)Q[�6��^-�EO��`������O��,�
�͙��o���NXR�|�;�~��+$t�B	0�D)�M>w��5{��U��E�7�����7��a�WK�
i��V
QL����'Ψ�p����&�m��^rc�tk���W����]^^�Ek�~��u�~kʭ���',���Zץ�N�������#(�1���

�W������{�>Së�ᇿ(��f�����6�}�D��xqd�l�’
֮}Q�**��%+��0�_��3�[#|�
+endstream
+endobj
+597 0 obj <<
+/Type /Page
+/Contents 598 0 R
+/Resources 596 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 532 0 R
+/Annots [ 559 0 R 560 0 R 567 0 R 568 0 R 569 0 R 570 0 R 571 0 R 572 0 R 573 0 R 574 0 R 575 0 R 576 0 R 577 0 R 578 0 R 579 0 R 580 0 R 581 0 R 582 0 R 583 0 R 584 0 R 585 0 R 586 0 R 587 0 R 588 0 R 589 0 R 590 0 R 591 0 R 592 0 R 593 0 R 595 0 R ]
+>> endobj
+559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 709.994 513.996 718.971]
+/A << /S /GoTo /D (subsection.10.8) >>
+>> endobj
+560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 687.437 513.996 696.413]
+/A << /S /GoTo /D (subsection.10.9) >>
+>> endobj
+567 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 664.88 513.996 673.856]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+568 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 642.323 513.996 651.299]
+/A << /S /GoTo /D (subsection.10.11) >>
+>> endobj
+569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 619.766 513.996 628.742]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 597.208 513.996 606.185]
+/A << /S /GoTo /D (subsection.10.13) >>
+>> endobj
+571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 574.651 513.996 583.627]
+/A << /S /GoTo /D (subsection.10.14) >>
+>> endobj
+572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 552.094 513.996 561.07]
+/A << /S /GoTo /D (subsection.10.15) >>
+>> endobj
+573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 529.537 513.996 538.513]
+/A << /S /GoTo /D (subsection.10.16) >>
+>> endobj
+574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 506.98 513.996 515.956]
+/A << /S /GoTo /D (subsection.10.17) >>
+>> endobj
+575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 484.422 513.996 493.399]
+/A << /S /GoTo /D (subsection.10.18) >>
+>> endobj
+576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 461.985 513.996 470.841]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 439.428 513.996 448.284]
+/A << /S /GoTo /D (subsection.10.20) >>
+>> endobj
+578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 416.87 513.996 425.727]
+/A << /S /GoTo /D (subsection.10.21) >>
+>> endobj
+579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 394.313 513.996 403.17]
+/A << /S /GoTo /D (subsection.10.22) >>
+>> endobj
+580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 371.756 513.996 380.613]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 349.199 513.996 358.056]
+/A << /S /GoTo /D (subsection.10.24) >>
+>> endobj
+582 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 326.522 513.996 335.498]
+/A << /S /GoTo /D (subsection.10.25) >>
+>> endobj
+583 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 303.965 513.996 312.941]
+/A << /S /GoTo /D (subsection.10.26) >>
+>> endobj
+584 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 281.408 513.996 290.384]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+585 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 258.97 513.996 267.827]
+/A << /S /GoTo /D (subsection.10.28) >>
+>> endobj
+586 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 236.293 513.996 245.27]
+/A << /S /GoTo /D (subsection.10.29) >>
+>> endobj
+587 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 213.736 513.996 222.712]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+588 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 191.179 513.996 200.155]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+589 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 168.622 513.996 177.598]
+/A << /S /GoTo /D (subsection.10.32) >>
+>> endobj
+590 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 146.065 513.996 155.041]
+/A << /S /GoTo /D (subsection.10.33) >>
+>> endobj
+591 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 123.507 513.996 132.484]
+/A << /S /GoTo /D (subsection.10.34) >>
+>> endobj
+592 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 100.95 513.996 109.926]
+/A << /S /GoTo /D (subsection.10.35) >>
+>> endobj
+593 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.36) >>
+>> endobj
+595 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+599 0 obj <<
+/D [597 0 R /XYZ 89 770.89 null]
+>> endobj
+596 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+631 0 obj <<
+/Length 1132      
+/Filter /FlateDecode
+>>
+stream
+xڵXms�8��_��3gY/�P�ә^�䒦=_�뗴��8�p4I��$��o�#��G�]��t�s<�c>�
	�H,8�KGGx��-�s$�1�	:X�ei�'�Bݺ�秎G9&\��F�J3;:���G&�C�:��I���w�,`��!��йi�2�c
�+g6�{DZdO�ϑR�a*�#(ŔZ�Xgq�.VwWj��h�^�X߹� �׺J��g\�E
}*�Aka�e�����93BD�|�J��~ƌbI���� ���
3���vi�
+

�&jmP��
+B�� ��x�C�j�or��+����M}kE�D
3.;���[^|}AcأA'����g�DŽ�n�6��@%
��a�7�O]Fн�Y+ӷ
>G
�-�*�W�Q�'�,`�c�`,8�FS�‹��z
3�	
+���~l9:(�ʾ��6&q�*������JG��������J��U�
�ޮ��O�fU\�e )�
2:sWx���T�?�R�I$X�yj��^A����4i� 
CƇ��X��N������;�m��Ҽ*U�&��6Q�L
<�g
O���	�
o�d�/���R\�%�pЄ?��gA��
}Q�xK�%
�H	��=������Eȶߓ����Q�C��9F�D�
|4��.�U�}��H���77��*�j����r��זNc�@z��ėH���,\[:͗)��L�>ߡ�BR�M
e4SU_�r��4f����YCn�Ͻ������\b~�:QB
z'6��K)�ݪ|��F����N)��՞�e�H��(ج��
+��[*�l�
w��
$F�*ے��t�T�[�W�&0�v �^�˦4JT��MZ]�хNե
.T���{��=���i�C]mH����Q������SH9b�'��{����9�k�'�u��ͱܰ޷�-hފ�n{,ؙug����H������>`X@��cs�4��� K���s�'��;���
�����2�v�,Ηu�T�׈
�٩J�s!m�t��u�o�'Ћ�Ћ��NRL�Z������bo}���F
)ن�0L��u�WU�~3�\��R�K�����XLڭ��B����Ls�̚�
+w_W����� �O@؃kH%�5k$6�͟��vbr�q�C�����?����
+endstream
+endobj
+630 0 obj <<
+/Type /Page
+/Contents 631 0 R
+/Resources 629 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 633 0 R
+/Annots [ 594 0 R 600 0 R 601 0 R 602 0 R 603 0 R 604 0 R 605 0 R 606 0 R 607 0 R 608 0 R 609 0 R 610 0 R 611 0 R 612 0 R 613 0 R 614 0 R 615 0 R 616 0 R 617 0 R 618 0 R 619 0 R 620 0 R 621 0 R 622 0 R 623 0 R 624 0 R 625 0 R 628 0 R ]
+>> endobj
+594 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 709.994 513.996 718.971]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 688.075 513.996 697.051]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 666.156 513.996 675.132]
+/A << /S /GoTo /D (subsection.10.39) >>
+>> endobj
+602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 644.236 513.996 653.212]
+/A << /S /GoTo /D (subsection.10.40) >>
+>> endobj
+603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 622.317 513.996 631.293]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 600.397 513.996 609.374]
+/A << /S /GoTo /D (subsection.10.43) >>
+>> endobj
+605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 578.478 513.996 587.454]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 556.559 513.996 565.535]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 534.759 513.996 543.615]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 512.839 513.996 521.696]
+/A << /S /GoTo /D (subsection.10.48) >>
+>> endobj
+609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 490.8 513.996 499.777]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 469 513.996 477.857]
+/A << /S /GoTo /D (subsection.10.47) >>
+>> endobj
+611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 447.081 513.996 455.938]
+/A << /S /GoTo /D (subsection.10.49) >>
+>> endobj
+612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 425.042 513.996 434.018]
+/A << /S /GoTo /D (subsection.10.50) >>
+>> endobj
+613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 403.123 513.996 412.099]
+/A << /S /GoTo /D (subsection.10.51) >>
+>> endobj
+614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 381.323 513.996 390.179]
+/A << /S /GoTo /D (subsection.10.52) >>
+>> endobj
+615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 359.403 513.996 368.26]
+/A << /S /GoTo /D (subsection.10.53) >>
+>> endobj
+616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 337.364 513.996 346.341]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 315.445 513.996 324.421]
+/A << /S /GoTo /D (subsection.10.54) >>
+>> endobj
+618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 293.526 513.996 302.502]
+/A << /S /GoTo /D (subsection.10.55) >>
+>> endobj
+619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 271.606 513.996 280.582]
+/A << /S /GoTo /D (subsection.10.56) >>
+>> endobj
+620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 249.687 513.996 258.663]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 227.767 513.996 236.744]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 110.365 306.642 121.244]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter) >>
+>> endobj
+623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 112.268 513.996 121.244]
+/A << /S /GoTo /D (subsection.10.1) >>
+>> endobj
+624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 351.473 99.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
+>> endobj
+625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.2) >>
+>> endobj
+628 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+632 0 obj <<
+/D [630 0 R /XYZ 89 770.89 null]
+>> endobj
+38 0 obj <<
+/D [630 0 R /XYZ 90 211.162 null]
+>> endobj
+42 0 obj <<
+/D [630 0 R /XYZ 90 179.005 null]
+>> endobj
+629 0 obj <<
+/Font << /F70 332 0 R /F11 395 0 R /F83 436 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+677 0 obj <<
+/Length 1182      
+/Filter /FlateDecode
+>>
+stream
+xڽX[s�8~���-0S+� ����i����M���}H;�l˄Y.��i��+��ơ��~���H�9��t$h�4>
ލ��)4|��5F3Ç�}��kjܙZ?GWq=�|WN�ZϾ\�.�G�e��b4x �
��;�z�$����T6_�3~U���D�������[y�[�����k�� QbP� Bjks&̳xyϧ�q4L,-
+M�.[�S>
.ӂ�\#���r΃/��&? $Y��W��ދ�l�۶1������3�4���Y�1�L��l�{���#R{P��D��܄m�
��db����������t�|�sa!��9O
VDY��?
s^�aJM������J\Ѵ���Οfh�Z�m׵��~)�>�*�鄗
���i���Z�VC6R`�
0��D]���j��QؾӦ�[M�E�Q�T�����Q2�y")��jI�\}�T� ��a�g��x8^�6
�
J0�74;��YpcaI%�Wnk�||��I�Y��oeyMʼn4eCSiۓj�w��EM���$���3>���'�
���on>��O�@C�e4�ã)�$��U��
+HE?ϣ�����W:|]�8���,
�b-WzRG'�R�D����N,>>2��v�<ٙp�ޒ���8yЕ���3/�
��$�z��Â�$�.v䀺�� 
�>.�W����;#��#@+� ��4�b�Kx!��k��
g9j�$�|y��^���'
�z9=�^��l%�<�c����ݒ'�;�sU��r�vԬ,�k�wy��"�����8�1<v.�͔
V��B�G�)�1J���6ft55.3dRh�P���c�w�l9�����P��ӄ�w��4C���ES-���M+�u�Hn
Y��B�AEGr�%�F�li9���.�s�%�eݸPe������m�c�~
�kc��O=ߴ���v����n׵�=�@��g�T��PtH"�/�i(�=cl#�m���n#(��4m�	z��ŀb��3��D�ǯ��
@D)�:��W��
�pz��<��V���pe�z"s�ހO����`��Eیh�DW�<�
�󍩖O,
,��1��Én��sqRꃖ��,�e���:P
���¼y�A ��dVy�2oyM@�������`H ��!�(����a��L�d���JtQ=wV�"��kV٘ToT�eH��75�Y
+endstream
+endobj
+676 0 obj <<
+/Type /Page
+/Contents 677 0 R
+/Resources 675 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 633 0 R
+/Annots [ 626 0 R 627 0 R 636 0 R 637 0 R 638 0 R 639 0 R 640 0 R 641 0 R 642 0 R 643 0 R 644 0 R 645 0 R 646 0 R 647 0 R 648 0 R 649 0 R 650 0 R 651 0 R 652 0 R 653 0 R 654 0 R 655 0 R 656 0 R 657 0 R 658 0 R 659 0 R 660 0 R 661 0 R 662 0 R 663 0 R 664 0 R 665 0 R 666 0 R 667 0 R 668 0 R 669 0 R 670 0 R 671 0 R 674 0 R ]
+>> endobj
+626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 362.293 718.971]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) >>
+>> endobj
+627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.3) >>
+>> endobj
+636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 673.667 387.767 684.546]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) >>
+>> endobj
+637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 663.614 513.996 672.591]
+/A << /S /GoTo /D (subsection.10.4) >>
+>> endobj
+638 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 639.242 350.149 650.121]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) >>
+>> endobj
+639 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 629.19 513.996 638.166]
+/A << /S /GoTo /D (subsection.10.5) >>
+>> endobj
+640 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 604.817 304.357 615.696]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) >>
+>> endobj
+641 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 594.765 513.996 603.741]
+/A << /S /GoTo /D (subsection.10.6) >>
+>> endobj
+642 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 570.392 279.275 581.271]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+643 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 560.34 513.996 569.316]
+/A << /S /GoTo /D (subsection.10.7) >>
+>> endobj
+644 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 535.968 264.142 546.847]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+645 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 525.915 513.996 534.892]
+/A << /S /GoTo /D (subsection.10.8) >>
+>> endobj
+646 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 501.543 295.145 512.422]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
+>> endobj
+647 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 491.49 513.996 500.467]
+/A << /S /GoTo /D (subsection.10.9) >>
+>> endobj
+648 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 467.118 269.681 477.997]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+649 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 457.066 513.996 466.042]
+/A << /S /GoTo /D (subsection.10.10) >>
+>> endobj
+650 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 432.693 305.098 443.572]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 422.641 513.996 431.617]
+/A << /S /GoTo /D (subsection.10.11) >>
+>> endobj
+652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 398.268 264.152 409.147]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 388.216 513.996 397.192]
+/A << /S /GoTo /D (subsection.10.12) >>
+>> endobj
+654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 363.844 299.569 374.723]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 353.791 513.996 362.768]
+/A << /S /GoTo /D (subsection.10.13) >>
+>> endobj
+656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 329.419 331.36 340.298]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
+>> endobj
+657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 319.366 513.996 328.343]
+/A << /S /GoTo /D (subsection.10.14) >>
+>> endobj
+658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 294.994 330.453 305.873]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
+>> endobj
+659 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 284.942 513.996 293.918]
+/A << /S /GoTo /D (subsection.10.15) >>
+>> endobj
+660 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 260.569 306.742 271.448]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
+>> endobj
+661 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 250.517 513.996 259.493]
+/A << /S /GoTo /D (subsection.10.16) >>
+>> endobj
+662 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 226.144 329.277 237.024]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
+>> endobj
+663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 216.092 513.996 225.068]
+/A << /S /GoTo /D (subsection.10.17) >>
+>> endobj
+664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 191.72 262.478 202.599]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 181.667 513.996 190.644]
+/A << /S /GoTo /D (subsection.10.18) >>
+>> endobj
+666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 157.295 297.895 168.174]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 147.362 513.996 156.219]
+/A << /S /GoTo /D (subsection.10.19) >>
+>> endobj
+668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 122.87 288.311 133.749]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
+>> endobj
+669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 112.937 513.996 121.794]
+/A << /S /GoTo /D (subsection.10.20) >>
+>> endobj
+670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 287.942 99.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.512 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.21) >>
+>> endobj
+674 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+678 0 obj <<
+/D [676 0 R /XYZ 89 770.89 null]
+>> endobj
+675 0 obj <<
+/Font << /F70 332 0 R /F11 395 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+739 0 obj <<
+/Length 1206      
+/Filter /FlateDecode
+>>
+stream
+x��X[s�8~���maf-KI���3�6ͤI&ލ����(X&�rq�$M�
+$lc;��q��#}��M����߳��#��<��1[
4��B��ܸ6@�A��1/
+k�	4Ϣ����>�����cTώ�f�o#$'���B�k���+4�r�����}#���36.G������V��Z��v���
�@Hmj����,~���qt����b��y4��E*r^f��P�"i0�����c��#D�|�h(�x3��J�zԪ-�����cLE��t�|�܍���a��9��c>,��Hg��Q\�\��е
�WR�i�'��@��B���.��a����bYFY�X��JT�z��Bh�7�u�R�|c��G��:�\
��`��A�"(�4T�'�
5XTi�hy
��g:���|&Ұ���rɸkJs
r�d��Y�'"�Bܬ8)����W���R5
zp:�T�eÇ(�AL賏���X�S��
m�2�}&_ �A$=�%p���04�(.��+�����α��>?�f�������-BM��x:�B���c'�����gOq��(�F�+�U�lWTɋ�w�'�{o�4�z
%�x5�� �WA�%�s)���}e�g�6D}N�w�<J��P����+��yz�Zlj3��!�ʒ������U#�ʫ����,
�_$gP(��(xf��H
9�D[]h�Z�Ū�T4f5�cI "��O�JVg�u��1�}pv�O��T�I
��k�y�-�N�R�B�H�2"9BjN�s�$��t���>�'��
�j�łY�rH���I��M]���
�:Dw3�m�'�t�
�)�XR�g6�H�:x~��^�D?�p�gs�STm(Q3���{�&�t�g��l��/sO�	���vBKO9�<fRx�(1mBz�X��#B��
Wݣ?��VC`�k%NW ��(���h+�WזR��
r�[G�e�׎n\���Yw>���V�s��;����^W��ʜi�h�����!�D(6) [...]
+
�u��
����s!��,BLM�9O+
�s�]͊��h�
��n��Rץhß���юNk��0� !�5�۲\�1��Ta!��ıe�
��HQ����%Y.��CN&M<m���@(�-��
�� ��������c�����$��!��n���P��
+endstream
+endobj
+738 0 obj <<
+/Type /Page
+/Contents 739 0 R
+/Resources 737 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 633 0 R
+/Annots [ 672 0 R 673 0 R 697 0 R 698 0 R 699 0 R 700 0 R 701 0 R 702 0 R 703 0 R 704 0 R 705 0 R 706 0 R 707 0 R 708 0 R 709 0 R 710 0 R 711 0 R 712 0 R 713 0 R 714 0 R 715 0 R 716 0 R 717 0 R 718 0 R 719 0 R 720 0 R 721 0 R 722 0 R 723 0 R 724 0 R 725 0 R 726 0 R 727 0 R 728 0 R 729 0 R 730 0 R 731 0 R 732 0 R 733 0 R 736 0 R ]
+>> endobj
+672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 323.359 718.971]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
+>> endobj
+673 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 698.159 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.22) >>
+>> endobj
+697 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 673.667 313.775 684.546]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
+>> endobj
+698 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 663.734 513.996 672.591]
+/A << /S /GoTo /D (subsection.10.23) >>
+>> endobj
+699 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 639.242 344.37 650.121]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+700 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 629.309 513.996 638.166]
+/A << /S /GoTo /D (subsection.10.24) >>
+>> endobj
+701 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 604.817 229.841 615.696]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO) >>
+>> endobj
+702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 594.765 513.996 603.741]
+/A << /S /GoTo /D (subsection.10.25) >>
+>> endobj
+703 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 570.392 325.96 581.271]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+704 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 560.34 513.996 569.316]
+/A << /S /GoTo /D (subsection.10.26) >>
+>> endobj
+705 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 535.968 298.851 546.847]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 525.915 513.996 534.892]
+/A << /S /GoTo /D (subsection.10.27) >>
+>> endobj
+707 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 501.543 349.76 512.422]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
+>> endobj
+708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 491.61 513.996 500.467]
+/A << /S /GoTo /D (subsection.10.28) >>
+>> endobj
+709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 467.118 347.907 477.997]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
+>> endobj
+710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 457.066 513.996 466.042]
+/A << /S /GoTo /D (subsection.10.29) >>
+>> endobj
+711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 432.693 323.21 443.572]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
+>> endobj
+712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 422.641 513.996 431.617]
+/A << /S /GoTo /D (subsection.10.30) >>
+>> endobj
+713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 398.268 329.665 409.147]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
+>> endobj
+714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 388.216 513.996 397.192]
+/A << /S /GoTo /D (subsection.10.31) >>
+>> endobj
+715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 363.844 363.06 374.723]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
+>> endobj
+716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 353.791 513.996 362.768]
+/A << /S /GoTo /D (subsection.10.32) >>
+>> endobj
+717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 329.419 339.997 340.298]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
+>> endobj
+718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 319.366 513.996 328.343]
+/A << /S /GoTo /D (subsection.10.33) >>
+>> endobj
+719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 294.994 319.315 305.873]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception) >>
+>> endobj
+720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 284.942 513.996 293.918]
+/A << /S /GoTo /D (subsection.10.34) >>
+>> endobj
+721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 260.569 278.907 271.448]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 250.517 513.996 259.493]
+/A << /S /GoTo /D (subsection.10.35) >>
+>> endobj
+723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 226.144 310.458 237.024]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
+>> endobj
+724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.624 214.931 286.309 225.068]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 216.092 513.996 225.068]
+/A << /S /GoTo /D (subsection.10.36) >>
+>> endobj
+726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 191.72 304.002 202.599]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
+>> endobj
+727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 181.667 513.996 190.644]
+/A << /S /GoTo /D (subsection.10.37) >>
+>> endobj
+728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 157.295 334.607 168.174]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception) >>
+>> endobj
+729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 147.243 513.996 156.219]
+/A << /S /GoTo /D (subsection.10.38) >>
+>> endobj
+730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 122.87 276.78 133.749]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) >>
+>> endobj
+731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 112.818 513.996 121.794]
+/A << /S /GoTo /D (subsection.10.39) >>
+>> endobj
+732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 88.445 334.139 99.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
+>> endobj
+733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 78.393 513.996 87.369]
+/A << /S /GoTo /D (subsection.10.40) >>
+>> endobj
+736 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+740 0 obj <<
+/D [738 0 R /XYZ 89 770.89 null]
+>> endobj
+737 0 obj <<
+/Font << /F70 332 0 R /F11 395 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+800 0 obj <<
+/Length 1219      
+/Filter /FlateDecode
+>>
+stream
+x��XKs�8��Wp8�H�!��l&3���{����d,;dyx ��ﷅ����R��	����5�VҾ�~���?S����W�-5i��MDž��v�b��]k���wA���6�]�gS�ot9�
a��4,�
�zZ��n m��2-��
�I�f
��6
�5Bj+�O�._)�7�6��mbjicc��5������/r��<g��A�nN
�t����ϛ4,�,�L�հm�����B�q�Ə�q�P,�Dz����g�f!���(�i�̈�E�B-��2��
��vt��l�0&�S�cb��80���x���l�{ P
��Q������0�B^B����N
�:
+�,�l�*A��s�:��]�$HL��d�'���X�^�Q(Ǯ ��#'H�+��D�J�gg��,���n��7�
\d�<�,Z��<��04bV�eBC����9n�k�K���"�Gѩ���?�Oto8�� �MQD�R��P�a�� ����B��
�+����)�
P�)�l�W"¼
<$t���m
�*��c�|����T�C��bΖG
Ėk��` cf�u����p�
۶uJ���!��
���#�2
\�!)Y1�
�JKS�O��
^N����<,�>� 
����\A�de���.{j	|cV�
�
�Qq/��a�
Z�#�^��z�BJ�M$���lX]=���Ī�9/9Ok��;��_�32cQ�
`���y:uODN��
��x�!�^T\��)=*o�h
$��������I��
+��ߑ�.^`3
_�0n�cت$�O]dY_Q�-�ݨ
p��>��9�C�w��q�J�'b[b����g���n
�]p���0�h���
٦�� ��*K��?��\\�^�����&8;yI�#&
+�×�����F25lҒl=�p;�;��P��#��#D�[��3,�VJǓ��c�k�kȵ���)b�Y'�e?� _����P{�E0����;M��c�]wO[�b놪��t��S_'�`��`y�U<�`��
�Ĥ��9l	��t�����B�RR�l�W?k5p~�Xڧ
�m՝����ª����L�Z^�u�pN�ԋv3�d�U�*&݃�[��+KW��ێQ�� ���w�������tSw�D{�
+�&*`�s�4fÑ>mn5Ҝk��S�2L01���]Y�;?�oVOW&\�;�JM��ZvY{g�弦	
&U
+2�����,��
+endstream
+endobj
+799 0 obj <<
+/Type /Page
+/Contents 800 0 R
+/Resources 798 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 633 0 R
+/Annots [ 734 0 R 735 0 R 759 0 R 760 0 R 761 0 R 762 0 R 763 0 R 764 0 R 765 0 R 766 0 R 767 0 R 768 0 R 769 0 R 770 0 R 771 0 R 772 0 R 773 0 R 774 0 R 775 0 R 776 0 R 777 0 R 778 0 R 779 0 R 780 0 R 781 0 R 782 0 R 783 0 R 784 0 R 785 0 R 786 0 R 787 0 R 788 0 R 789 0 R 790 0 R 791 0 R 792 0 R 793 0 R 794 0 R 795 0 R 796 0 R 797 0 R ]
+>> endobj
+734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 708.092 290.622 718.971]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
+>> endobj
+735 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 698.039 513.996 707.016]
+/A << /S /GoTo /D (subsection.10.41) >>
+>> endobj
+759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 672.911 302.338 683.79]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
+>> endobj
+760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 662.859 513.996 671.835]
+/A << /S /GoTo /D (subsection.10.42) >>
+>> endobj
+761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 637.73 275.589 648.609]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 627.678 513.996 636.654]
+/A << /S /GoTo /D (subsection.10.43) >>
+>> endobj
+763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 602.55 393.715 613.429]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
+>> endobj
+764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 592.497 513.996 601.474]
+/A << /S /GoTo /D (subsection.10.44) >>
+>> endobj
+765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 567.369 392.809 578.248]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
+>> endobj
+766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 557.317 513.996 566.293]
+/A << /S /GoTo /D (subsection.10.45) >>
+>> endobj
+767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 532.188 307.14 543.067]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
+>> endobj
+768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [223.624 520.975 282.991 531.112]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 522.256 513.996 531.112]
+/A << /S /GoTo /D (subsection.10.46) >>
+>> endobj
+770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 497.008 301.8 507.887]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
+>> endobj
+771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 487.075 513.996 495.932]
+/A << /S /GoTo /D (subsection.10.47) >>
+>> endobj
+772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 461.827 285.362 472.706]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 451.894 513.996 460.751]
+/A << /S /GoTo /D (subsection.10.48) >>
+>> endobj
+774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 426.646 361.775 437.526]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.162 414.691 242.215 425.57]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 416.714 513.996 425.57]
+/A << /S /GoTo /D (subsection.10.49) >>
+>> endobj
+777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 391.466 400.5 402.345]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.57 379.511 426.123 390.39]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 381.414 513.996 390.39]
+/A << /S /GoTo /D (subsection.10.50) >>
+>> endobj
+780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 356.285 300.486 367.164]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 346.233 513.996 355.209]
+/A << /S /GoTo /D (subsection.10.51) >>
+>> endobj
+782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 321.105 300.485 331.984]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
+>> endobj
+783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 311.172 513.996 320.028]
+/A << /S /GoTo /D (subsection.10.52) >>
+>> endobj
+784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 285.924 267.101 296.803]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+785 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 275.991 513.996 284.848]
+/A << /S /GoTo /D (subsection.10.53) >>
+>> endobj
+786 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 250.743 291.28 261.622]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+787 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 240.691 513.996 249.667]
+/A << /S /GoTo /D (subsection.10.54) >>
+>> endobj
+788 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 215.563 301.611 226.442]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
+>> endobj
+789 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 205.51 513.996 214.487]
+/A << /S /GoTo /D (subsection.10.55) >>
+>> endobj
+790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 180.382 254.379 191.261]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 170.33 513.996 179.306]
+/A << /S /GoTo /D (subsection.10.56) >>
+>> endobj
+792 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 145.201 303.085 156.08]
+/A << /S /GoTo /D (interfaceparma__polyhedra__library_1_1Variable__Stringifier) >>
+>> endobj
+793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.629 133.246 313.785 144.125]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+794 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 135.149 513.996 144.125]
+/A << /S /GoTo /D (subsection.10.57) >>
+>> endobj
+795 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [103.177 110.021 276.515 120.9]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.041 99.968 513.996 108.945]
+/A << /S /GoTo /D (subsection.10.58) >>
+>> endobj
+797 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+801 0 obj <<
+/D [799 0 R /XYZ 89 770.89 null]
+>> endobj
+46 0 obj <<
+/D [799 0 R /XYZ 90 77.486 null]
+>> endobj
+798 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+846 0 obj <<
+/Length 1327      
+/Filter /FlateDecode
+>>
+stream
+x��YKS�8��W��}�"ɏ�[[[5؂�̐�9�TJq��%���ɿߖ%9�aف�"d
�����:���XX��|���j�u��8���[1�:~���F֍
9.
�}Y��S��O�d��bUZ��a�Ԧ���:�
Zdc�(Y�DV��n�ck����#�^�Y>�`�Z׭/-��y��Ԡ#��Ӡ#����<	��vS��MP
�ll�x����~�
B�C�)�X>�3�cO
7�����b��:WdK�rs�R�s�o�D*�_I/7��}������"GQ�k��Rl|kݸ�gƒ{610���D[�k�Hy�D��b���#��t(�X>�e�)�0���XB�Z.�/��ט�wډz�O�����SoiC�F�8K6:��� �9j]/F�(
ڤ�)+���H��c3��|Uz�1MR6
�j/,����?�y��Q/g��b�4��b�F��߰.j5Iz�6lq�6*)�<�y�x>�^��q1�G|4��&!N���a{9��u�r��
+��㮼}^hi���!�c�����;�qV��x/ᐾ�_�L�����r��4���kߘ���o{:��v%������1�
/���\��>#d=���$ �5��Ւ�$
�݋͊�B"@u����]�(�����y�N�j�^
��l6岶H����ˆ��:y���I�t���� �
%1��l�aG�u
>�yS���=�;�Y�H$Z)8���Ҳ�?������|Of��,��
�(h at Kz@��-��g�1Ms΄1z#�����\/ˊg�*����Խ��l^V��{��u�C��V�L�����	��]=!�O ]uu
��&
+*Ql_?�`��9���B����������G
?��=���Ӝ��Bl6����
)V�96A��G�4,߂�7��]U�\��NU��k4~L�і��j�+:*S�
M�&�Nf
+Gy0	�� {
N�(���G�g���5���yi�C��G�fM�Pn��ܑ���ݝ��W�٢���t3h����u
����4i�Q:�BՁ:$5����\
�K}$V�*�f^*�D��h\�Y~����j�
��T����/o@۬xԩ�WM&{6����u޶��
���vj�n�u���M��m6	Q��"ݵ�;pَ��̤��D
d��>�
Uk]�t��*�8�e��K��M�RƠ��Mω 2<���
�Y�ܜ�j���y�(�k;��"B|�i����o��p>)y>AI��쒫�;
�Cb�m2EVn�b����2���LPRC �ࡅ&
�'W�?��4��y�Y'��K��_��z
+endstream
+endobj
+845 0 obj <<
+/Type /Page
+/Contents 846 0 R
+/Resources 844 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 633 0 R
+/Annots [ 820 0 R 821 0 R 822 0 R 823 0 R 824 0 R 825 0 R 826 0 R 827 0 R 828 0 R 829 0 R 830 0 R 831 0 R 832 0 R 833 0 R 834 0 R 835 0 R 836 0 R 837 0 R 838 0 R 839 0 R 843 0 R ]
+>> endobj
+820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.038 630.631 252.29 641.535]
+/A << /S /GoTo /D (namespaceparma__polyhedra__library) >>
+>> endobj
+821 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 561.172 365.215 572.076]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
+>> endobj
+822 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 533.514 379.523 544.418]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) >>
+>> endobj
+823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 505.857 402.058 516.761]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) >>
+>> endobj
+824 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 478.199 366.8 489.103]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) >>
+>> endobj
+825 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 450.541 324.415 461.445]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) >>
+>> endobj
+826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 422.884 284.887 433.788]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 395.226 317.106 406.13]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
+>> endobj
+828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 367.568 289.002 378.472]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 339.911 323.323 350.815]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 312.253 282.377 323.157]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 284.595 316.698 295.499]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 256.938 348.07 267.842]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
+>> endobj
+833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 229.28 346.964 240.184]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
+>> endobj
+834 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 201.622 327.029 212.526]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
+>> endobj
+835 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 173.965 344.344 184.869]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
+>> endobj
+836 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 146.307 286.8 157.211]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+837 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 118.65 298.427 129.553]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+838 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 90.992 376.772 101.896]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+839 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.55 76.49 232.722 86.395]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+843 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+847 0 obj <<
+/D [845 0 R /XYZ 89 770.89 null]
+>> endobj
+848 0 obj <<
+/D [845 0 R /XYZ 90 700.031 null]
+>> endobj
+50 0 obj <<
+/D [845 0 R /XYZ 90 700.031 null]
+>> endobj
+849 0 obj <<
+/D [845 0 R /XYZ 90 647.443 null]
+>> endobj
+850 0 obj <<
+/D [845 0 R /XYZ 90 579.962 null]
+>> endobj
+844 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+878 0 obj <<
+/Length 1292      
+/Filter /FlateDecode
+>>
+stream
+x��YYo�F~ׯ�[I�Z-����@�؁l9V+%/v@�Ԋf�C�!E���=HI�a�1m�}"9�c���ffw�*X�0�s1�9X��Mle�R�Xq�1�l�Z*�*1�/�sŰ]��m�ĥ'W�s�op�|
��
+��o!�U�dp�+K�+cW��F�b��2�5�R|��}���md���:�u��
!���\-�� ��B�`����oބXX]�y�{�,���e�{qt���N�-Ͳ(-
Zz�L#���9�8�O�:K�IIs������љk*.X`��B�me�[린�]�qu"O�-���%����e�
/˨��J�R6�V��?n�Ls�mm�زi�*��"a�fZj���Uё��B��@a�K�
-�@.�Rʀ�U|���i�UK�
7�v�BYQ���M� �滢�IGHb�#�
tl�ƅ�O=	�84��.�X0߭�K�X�<�o��)�$��<Zz]s&�Adh��H(�jG����Y� z�48�;Ǹ��@F�@���T"��)�T3��a��8�@aW
����w�-��2j%Οp�f ���*�D�v'k�	�B����*Eo�5��GQ��1
�(
��dt%K%V1�zc���ay��9��M���2)�$L1�eTD�%��y*Z�[S�#>Ci�Ӣ� ���Η�j�0���$�q����IFW,��`L�h�&�H�a�*�eջ[���iH
�~��z����C��9M��J�e��a9�l�L_n��`�cz�*�,�U��g��%��̩ւl�*(�;�'��O��Y�~J�w�Uw��ʥ�/��j������_��ƴgbS�է~��Q��%ٲ�u
&a�@b�����l; mh\�A����?���d���
����e�.\'i)8ʷ���n���3›.d3�
kʣ���
���T����P��_�<���Z�"��fUd,
g�;���B����<eg�m�!���X�
+��D�y,�.��$
��`
+!I`���!W��X�
qM���p#U�>�z�f<JD��st��K�d\_j�.���1�����
��[���9K ػ��CQr�t?b�غ������E����[�m���9�x��AG�A֘_�}
`P�q�y���}�`4I
�}���x����=��Ǝ��p
D0�'=��f��x9�Ym"N�d�a�t�j��Q�ް}*h�
��^�i���$$��/t�C	沴���c�i
��9�6�^�Vr`��tXd�)we��m4��‚�!�H~�9�Ύ����}���$�i]V�0��ޚ� )�<
+endstream
+endobj
+877 0 obj <<
+/Type /Page
+/Contents 878 0 R
+/Resources 876 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 633 0 R
+/Annots [ 840 0 R 841 0 R 842 0 R 851 0 R 852 0 R 853 0 R 854 0 R 855 0 R 856 0 R 857 0 R 858 0 R 859 0 R 860 0 R 861 0 R 862 0 R 863 0 R 864 0 R 865 0 R 866 0 R 867 0 R 868 0 R 869 0 R 870 0 R 871 0 R 872 0 R 875 0 R ]
+>> endobj
+840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 411.073 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.94 693.266 389.318 703.172]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+842 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 679.922 280.693 690.826]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 651.887 315.014 662.79]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 623.851 308.121 634.755]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
+>> endobj
+853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 595.816 303.936 606.72]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 567.781 338.257 578.685]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
+>> endobj
+855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 539.745 331.363 550.649]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
+>> endobj
+856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 511.71 359.019 522.614]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+857 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 483.675 251.374 494.579]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO) >>
+>> endobj
+858 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 455.639 340.469 466.543]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+859 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 427.604 316.12 438.508]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+860 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 399.569 365.126 410.473]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
+>> endobj
+861 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 371.534 363.442 382.438]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
+>> endobj
+862 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 343.498 339.373 354.402]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
+>> endobj
+863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 315.463 345.659 326.367]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
+>> endobj
+864 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 287.428 376.443 298.332]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
+>> endobj
+865 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 259.392 354.296 270.296]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
+>> endobj
+866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 231.357 335.488 242.261]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception) >>
+>> endobj
+867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 203.322 297.321 214.226]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 175.287 329.43 186.191]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
+>> endobj
+869 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 160.596 271.403 170.501]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+870 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 147.251 324.439 158.155]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
+>> endobj
+871 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 119.216 349.475 130.12]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception) >>
+>> endobj
+872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 91.181 296.609 102.085]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) >>
+>> endobj
+875 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+879 0 obj <<
+/D [877 0 R /XYZ 89 770.89 null]
+>> endobj
+876 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+902 0 obj <<
+/Length 1449      
+/Filter /FlateDecode
+>>
+stream
+x��YIs�6��W��@ �N�3��q�4��6�$á(Xf�-\����a�II���Һ=Q��{���-6�6~�=[���lD(�o,���!χ��xoF�M=l��������*�
VvI�U%tE8�&����W������� R����H�����XA�+#'
+�[1�0\��77�f�Ͱ�
�-���#�	��D���U��2��al�yҶj��Ӭ�]�b
+�J�4E�U��a�&��l�$���=�-�b|>��V�cm�߳��5B��w�Ŕ"ߥ�M\�PZ�T)
�?�<gi��k��H�[;g�׆�r�/S�|�&f� ez)
+��O �eI
�+�NQ-�Nw.[�;b�*^�Ì�\e){D8]��yS-sV���b@^�_���R�Qv�r���6Y�&7���Z�%�@�Zr�N�+��$p�ϫ�k�<VT�eM�
ӱH
+�u������>�
���P
? 
ض�
���!f��G�(�X�m�$..V{]5�[d� �����.����ݰ�͖�
���]8�*�p@���k�^N�����)���F��XN`j��gɺ[�T#Q\SV	��P�������dVv�����j[,��
����V�|<ta9�	A
.G��K��SPe�s��o�:��V�;�T6�E����
=��
�ϛ,�n�4)�NN5vD��CڪݻL�N��4�\s��E�����Sp���4d���!
b^�� ����e��r���m��jB���Uw�v;�D��
�Gl���!ؐ�P՜�X��Ʋl��^�.�rq+h�6m��˷s���E��䡲RM}b��k,����>�k}1o��F��1��)�3��*�wwcQOÔ'�O��^�߂OՆ '��<��c�Τ>���t�"���)�G����E]�G�Sb��ۡ��	���$
x�M#
y��v�C.*�Y$"��!Ktq��-Mun{��qO���L�˫�a�>�i�'��C����Hq�Kp��
�Ʉ��9R�s����
q�uC>np�i
*����>.��$�?h
7\� [...]
+endstream
+endobj
+901 0 obj <<
+/Type /Page
+/Contents 902 0 R
+/Resources 900 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 906 0 R
+/Annots [ 873 0 R 874 0 R 880 0 R 881 0 R 882 0 R 883 0 R 884 0 R 885 0 R 886 0 R 887 0 R 888 0 R 889 0 R 890 0 R 891 0 R 892 0 R 893 0 R 894 0 R 895 0 R 896 0 R 899 0 R ]
+>> endobj
+873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 346.406 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
+>> endobj
+874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 680.334 307.134 691.238]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
+>> endobj
+880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 652.711 294.003 663.615]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 625.088 406.192 635.992]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
+>> endobj
+882 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 597.465 405.086 608.369]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
+>> endobj
+883 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 569.842 326.113 580.746]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
+>> endobj
+884 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 555.357 269.412 565.262]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+885 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 542.219 319.467 553.123]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+886 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 514.596 313.381 525.5]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 486.973 319.657 497.876]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
+>> endobj
+888 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 459.349 274.058 470.253]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+889 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.15 431.726 334.83 442.63]
+/A << /S /GoTo /D (interfaceparma__polyhedra__library_1_1Variable__Stringifier) >>
+>> endobj
+890 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.708 417.242 294.087 427.147]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 213.425 218.955 223.352]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter) >>
+>> endobj
+892 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 199.633 262.113 210.537]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
+>> endobj
+893 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 172.01 276.42 182.914]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) >>
+>> endobj
+894 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 144.387 298.955 155.291]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) >>
+>> endobj
+895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 116.764 263.698 127.668]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width) >>
+>> endobj
+896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 89.141 221.312 100.045]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) >>
+>> endobj
+899 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+903 0 obj <<
+/D [901 0 R /XYZ 89 770.89 null]
+>> endobj
+904 0 obj <<
+/D [901 0 R /XYZ 90 403.79 null]
+>> endobj
+54 0 obj <<
+/D [901 0 R /XYZ 90 345.925 null]
+>> endobj
+566 0 obj <<
+/D [901 0 R /XYZ 90 311.149 null]
+>> endobj
+58 0 obj <<
+/D [901 0 R /XYZ 90 311.149 null]
+>> endobj
+905 0 obj <<
+/D [901 0 R /XYZ 90 231.221 null]
+>> endobj
+900 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F83 436 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+935 0 obj <<
+/Length 1173      
+/Filter /FlateDecode
+>>
+stream
+x��Y�W�8�_�7�9S�@�v�\u<u
��}�9�H#2
�������/(T���	ɽ����b �����`�1�`f�|��0� ��l�O+p9t|������F3_,R��gˣ��|78Z�H�� ���
LA�
.�A��' ��l
+
Ԥ
L
W\Sp1�2���4�o���oO�)��\9���W���ȃp��(�
i��]_�ǃ�Jn,�^A�D	�yK��u�q:Sa�?��8��O
0B�
�D۲o)��ũ���4�(�[�Ѝj��
����^B��Sb!o�#��A������pH�"���Z
(�$���N�cV�<"
y.Mr�Y�Z���p9
�
+/

N���Z���7�0{�]�N:˺���]�S���q�<�%�^<*tɠ����"w���sF�p��3�NXx&�����6IE���B߬�5�TԤ�ث9�z45s�fDYd!������$���{)�vS%�s��YA�[���
�PUޘ�aN�#am��$_mEҊHb	P*S��!_W�qS\�
���C��l��,<��5Oh�Z.jAU � +}m��Ji6Й��3h4}�%+�z��[���n��/.̸���:WЃ&"r���فFu�� �׽�Ic�
+�~���;��Vé�C���$�i�X�E��)2n�^IXP��.��m�a��
�Y�S
	�+�K�Q%���6J%��;�xߙ�m�˒,r㕻���+	��n�o�� �w���\��.��\��
+�zظ-��#�
����
+��������V��*�e3��er��r�!i��5�k޾q�j h�
��R��t��=�sJ���|{̒U�u|�B賑�nb[�Y���"��讱�⼍��`�	��
���䦊SA�>��R�&:����{�D["�0[�*�ڔ~���yG1��"���mJ�X?��禕�]����L?%y�o����)5��"U�����և�6���}�
w��������f��� 
+Ӄ�Q/���e��
��
��7�F���ߞ�T�
\ہN��]�o�'X
Nt�S��%���y.v�Y5pd��*ۓ��a�3�K�n΅����.Y:U
"���ám�\!�T�M���F�I�wq0	'�,������˸��#�=
��� �����u�QF����q������=�
+endstream
+endobj
+934 0 obj <<
+/Type /Page
+/Contents 935 0 R
+/Resources 933 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 906 0 R
+/Annots [ 897 0 R 898 0 R 907 0 R 908 0 R 909 0 R 910 0 R 911 0 R 912 0 R 913 0 R 914 0 R 915 0 R 916 0 R 917 0 R 918 0 R 919 0 R 920 0 R 921 0 R 922 0 R 923 0 R 924 0 R 925 0 R 926 0 R 927 0 R 928 0 R 929 0 R 932 0 R ]
+>> endobj
+897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 710.014 181.785 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 679.922 214.004 690.826]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
+>> endobj
+907 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 651.887 185.9 662.79]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+908 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 623.851 220.22 634.755]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+909 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 597.873 179.274 606.72]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 567.781 213.595 578.685]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+911 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 540.722 244.968 550.649]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
+>> endobj
+912 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 512.686 243.862 522.614]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
+>> endobj
+913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 483.675 223.927 494.579]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
+>> endobj
+914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 455.639 241.242 466.543]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
+>> endobj
+915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 427.604 183.698 438.508]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 399.569 195.324 410.473]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 371.534 273.669 382.438]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.55 356.843 232.722 366.748]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 343.498 307.97 354.402]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.94 328.808 389.318 338.713]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 317.52 177.591 326.367]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 287.428 211.912 298.332]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 259.392 205.018 270.296]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
+>> endobj
+924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 232.333 200.833 242.261]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 203.322 235.154 214.226]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
+>> endobj
+926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 175.287 228.261 186.191]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
+>> endobj
+927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 147.251 255.917 158.155]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 121.273 148.271 130.12]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO) >>
+>> endobj
+929 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 91.181 237.366 102.085]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+932 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+936 0 obj <<
+/D [934 0 R /XYZ 89 770.89 null]
+>> endobj
+933 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+965 0 obj <<
+/Length 1247      
+/Filter /FlateDecode
+>>
+stream
+x��Y�r�6}�W�-�L�U�Ng���8�6V�bg80ɜ���Rܯ/@���ncה�<���!��. ���?L��Zc0p`Mf�Z�7~ ��֕=�"�
;�$�B��b�
�
�,���N9I��~'_z�
m
:�'oǓ����A
i�>#+-W��5��o-�qd��I��aW��u9�k ��pS�`Sa๑"�J_c�7���YWC_��椪�
���>4S�Q���'���VUV�-9���$�H�xJ�A�ak�| ��uy�����O

m��ㆶ^l��c����`b�3��5�8�(1Z�ߨ�:˅~�q����OD7��Ek�^����kF9e)}.X�[�PӬ�R�m at R���r�[�*�k�t�
�� ��b��c�L
׷��V�!�Ў1�S��y��6����#��#��X�n�:
��Dt(<	���OB�&<#7��'w/��l�B�}X��y�&ǜ�
+��.Dq�T2���p(� p��I��+/WC
Ē�zHO����dtq'1/�)z
+��7j��	�O
+j6�5��T���X��W��\C�"c�-.S*�
e]��>2ɥ ��,;���7�
4��"-�oG�[��:Tv�kBa�/%�����^:E����grQN�
0�XB�r��z���ڤT�`�*�[
�`gYV��A��͸�5:���z)/ X��^�7=c�*�k'������(�@�G��ߟ���A=LY
���
.I^�s˻��g;	���x|ب��V%uܕ�禤�'�k%L��4
#��]���f5K���
+���H��
z
+g
-v�:�1L[-H�ee��(c�,=07�28
�4k2�w=P���A9k�`J��j�A�^�%t���
�D��q��DL�B���Hx���<;No@��)��e�'RQ����s�R2vH���W�Z���4�y�{-Ĵ��F�ޒ���4g3�J�S������
�Ϗ��KÚ�#�*��فy�0��1Ni?���
]2�S�|�9�#��N��E�FuCŊR�uj���4��炬�j��C���� �����i�o0��\8y!���mk��\w�u�T5�Qy�]C��g�r�
}�(��~{LsAX�f9���z���4R���R�%m��������ԕް C
ꪝ[!��F7���l$���^��� ��va�(9ms49X4?�j-�>D p
��_P�P�fl����f`tZ��Q)���������
+endstream
+endobj
+964 0 obj <<
+/Type /Page
+/Contents 965 0 R
+/Resources 963 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 906 0 R
+/Annots [ 930 0 R 931 0 R 937 0 R 938 0 R 939 0 R 940 0 R 941 0 R 942 0 R 943 0 R 944 0 R 945 0 R 946 0 R 947 0 R 948 0 R 949 0 R 950 0 R 951 0 R 952 0 R 953 0 R 954 0 R 955 0 R 956 0 R 957 0 R 958 0 R 959 0 R 962 0 R ]
+>> endobj
+930 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 213.018 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+931 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 679.922 262.023 690.826]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
+>> endobj
+937 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 651.887 260.34 662.79]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
+>> endobj
+938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 623.851 236.27 634.755]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
+>> endobj
+939 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 595.816 242.556 606.72]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
+>> endobj
+940 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 567.781 273.341 578.685]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
+>> endobj
+941 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 539.745 251.194 550.649]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
+>> endobj
+942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 511.71 232.385 522.614]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception) >>
+>> endobj
+943 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 484.651 194.218 494.579]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+944 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 456.616 226.328 466.543]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
+>> endobj
+945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 440.949 271.403 450.854]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+946 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 427.604 221.336 438.508]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
+>> endobj
+947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 399.569 246.373 410.473]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception) >>
+>> endobj
+948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 372.251 193.507 382.438]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) >>
+>> endobj
+949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 343.498 243.304 354.402]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
+>> endobj
+950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 316.439 204.031 326.367]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
+>> endobj
+951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 288.404 219.115 298.332]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
+>> endobj
+952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 260.369 190.901 270.296]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+953 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 232.333 303.089 242.261]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
+>> endobj
+954 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 204.298 301.983 214.226]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
+>> endobj
+955 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 176.263 223.01 186.191]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
+>> endobj
+956 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 160.596 269.412 170.501]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+957 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 148.228 217.471 158.155]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
+>> endobj
+958 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 120.192 201.601 130.12]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+959 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 91.181 216.365 102.085]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+962 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+966 0 obj <<
+/D [964 0 R /XYZ 89 770.89 null]
+>> endobj
+963 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+989 0 obj <<
+/Length 1939      
+/Filter /FlateDecode
+>>
+stream
+x��YIs�6��W�Vq� piOI�t�����$
%�2[.
+���}�(R�e�v�'.x�[�����x��y�b>9{
Q/!I�Co~�%ԋDBdOk�Ô����[/c’>2o_�����o�
�6y5�|�0X�
��%�boUL>|��^��(	���b�
+O� ��w1�cB�(t(R8�ѐ� �"�c(�GΥa�>�>�$��U�6�]���+�{C�%��W���gU.ޫ<m��
�={

/YB�eᜄ�{3&�H�,�+囝k?��nS�f��/Jه/[��ֵ/��ѥ�zD����R�>�Ӵ���ؔ�$ݳҬ- ђ�fReW
��3���XV�cm�~d����<�>'�>�9�
+Uu��տ+�}
+���Tl�v��P.o��"S|P>���Y����W� ~�	�2^��Y��ՃU�(�sTh
ڕM�lui�v1q�V�}�m�RO�uV����Ѣ�>]��E�!�>R�!�
k
�=J�%1��N�j�7����Jh�ԭv��d���j�F�����fq���ƙu����tm���/�ͷJ�?r�k��;��N��C��������Bc��1���	�������4�M����U��N&{&�`dAd�J�����Û��������{�m� ~�I7������y��
$�yv�)l}&�7HW딬�{t
��3��.�0�h���.[�i}cZP
+s"%�������ʭ��n�RfV���`�5�6&H BnM,(�\�
�Z�^�E��U�=P�lm�r[��H��{g��ꂘ��'4i"��B�q�wC��3gR�(�oJ�r�C@�M-$��sʁm�$�9�ݜ��
��,���!d��p�B(u:���4? S�$�O#S̈d�X�s����i������եɢV�J݇� �9a�Z�ϻ%�g+��WU,
��]��~�P��ol���q�4��`�Չ�y�3�†�U�@��H%�3kC<�*��/�֪i���n��
O�/+�1�=
+avh�5��0νe�E���Ƶ�.�
���
l��#�J��v1���QzԗaEiv��~c�VeUd�CZ��k>ʝ0�Z
�h
�S�ă�஧o��u�}�w�U����^�;9X
�8�
j
+��K��6qD�`u�
+�P��;�� 
��)�aǠ2},Q at 8;~"
+,"At�d���ZD����Tڬ�l���7�y��4�~(Ҷ��:`���C�EJߢ���  P��0z�@� W�m!h��7`4=��P��_���{�8 l;�0tW�4#��g�;�b�탦�	�7���U����/��t�%ҳ�hQ����5Y�X�eX�ߤ�%��Y�Dڙp�PB�™���o�Nw
�B;�X��o�%J]uM~3[+m�cZ��hc\ټƓ i���B/�%fi�?z& ����2�O���G*���N��f��r ��,�Z��~:�f7V�@`��
�����[Vk�KWvd���V �Zu{9Ha��p���M�
��zYW+T�]�@��2v�
+�ϐjJ<�&��z�)�
x��?�2cnީq��Y��r��CJ�L��d�IQ�����6���y��~i~c�;$1
!��	~<���S�6�*�ʞ�h��
�*����!Z���8�S��g�o��u��U�����}�@��D�n5=�4��ћ��\��.���:n���c��d�
��jp�
�t~ccn	�
��-��tm���g�+�.���A{����?�}q�w��]����X0�C"
���~zwE�p��
� l<w���
;<!R=�������5r������
+p�����
՝�(�fqxo�7��ٛ"�~�`��v�DU��^!�g��5����d�'���Aۻ��t����}��g����ɩ5�i�9��$�^Y�Z�x���ׅr!����k�����N
s
+��
qն��Ζ�z�
YU��nf�q�F���jwr�
5�z
�� y�
+endstream
+endobj
+988 0 obj <<
+/Type /Page
+/Contents 989 0 R
+/Resources 987 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 906 0 R
+/Annots [ 960 0 R 961 0 R 967 0 R 968 0 R 969 0 R 970 0 R 971 0 R 972 0 R 973 0 R 974 0 R 975 0 R 976 0 R 977 0 R 978 0 R 979 0 R 980 0 R 981 0 R 982 0 R 983 0 R 984 0 R 986 0 R ]
+>> endobj
+960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 707.957 216.355 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
+>> endobj
+961 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [138.538 678.967 210.278 689.871]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+967 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 649.977 216.554 660.881]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
+>> endobj
+968 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 623.045 170.956 631.891]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.15 591.998 231.727 602.902]
+/A << /S /GoTo /D (interfaceparma__polyhedra__library_1_1Variable__Stringifier) >>
+>> endobj
+970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [261.708 576.83 294.087 586.735]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [135.768 563.984 192.544 573.912]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 358.787 197.097 369.691]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_a1ed95ba05855767fd9fd6bf04f9e9167) >>
+>> endobj
+973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.913 358.787 278.162 369.691]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.065 358.787 334.082 369.691]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+975 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 329.798 191.16 340.701]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+976 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 329.798 263.777 340.701]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_ae44414ac09129205a7f718517caca304) >>
+>> endobj
+977 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 301.181 159.927 311.712]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+978 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 301.181 212.779 311.712]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_acac3d9fa21c9924c62f2221831d7b873) >>
+>> endobj
+979 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 271.818 215.13 282.722]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_ac04b78a2c208b111ea763b7bbc01e20a) >>
+>> endobj
+980 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 242.828 201.302 253.732]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter_ac1ce31354ecf79ca6c6c819059ec7de6) >>
+>> endobj
+981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [104.984 169.315 188.171 180.219]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter) >>
+>> endobj
+982 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.661 169.315 496.91 180.219]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [467.979 157.36 513.996 168.264]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+984 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.296 107.308 396.428 118.212]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+986 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+990 0 obj <<
+/D [988 0 R /XYZ 89 770.89 null]
+>> endobj
+991 0 obj <<
+/D [988 0 R /XYZ 90 533.034 null]
+>> endobj
+62 0 obj <<
+/D [988 0 R /XYZ 90 461.614 null]
+>> endobj
+634 0 obj <<
+/D [988 0 R /XYZ 90 429.346 null]
+>> endobj
+66 0 obj <<
+/D [988 0 R /XYZ 90 429.346 null]
+>> endobj
+992 0 obj <<
+/D [988 0 R /XYZ 90 378.328 null]
+>> endobj
+993 0 obj <<
+/D [988 0 R /XYZ 90 378.328 null]
+>> endobj
+994 0 obj <<
+/D [988 0 R /XYZ 90 347.604 null]
+>> endobj
+995 0 obj <<
+/D [988 0 R /XYZ 90 318.615 null]
+>> endobj
+996 0 obj <<
+/D [988 0 R /XYZ 90 289.625 null]
+>> endobj
+997 0 obj <<
+/D [988 0 R /XYZ 90 260.635 null]
+>> endobj
+998 0 obj <<
+/D [988 0 R /XYZ 90 212.855 null]
+>> endobj
+987 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F83 436 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1006 0 obj <<
+/Length 1558      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~����$��IJԥ�KR�K/Iׇ�0h�q���RR3��
^$[��%�;
{�)^��|%�,
�
��
�N#�$(	i�\�:	v� A,���s���7$cw�e�'�2[݉��,�J.W^�]t$��#�t��l2�v�乨��\�/�(f�R��_3^Ufx)n��H��0aĥ�������z�e@�D�cCQ�����'��a������νޔ;��?s������G����{���cnƀ��ԉ��H`�p�Z�[��u�&�
+�
3_ޚ�y���Jˢ2�4
|
#����\�q�vgY�Q��Wf�UG\�dV1��
a�W�#^lY����*��ߐ�0f�P&�,r
�5���]�r���<|U
\�
�*���rA-o
��7�P�ui�ya�dR���LVef���l�4˅����s���Ɠ��b6����5�,f5�2?b�ye��ft'
+5
+]H����g��,*sLၛ?�
H#VB�ef$E�dV[j���+Y��9��Y�y]&dD���a`�]��WZն��f����#-|��
�� 2�[��r�h�uu�)[�Jkj�r���{���a!
+!y
3'e�o����bem&^�sGB�q�ȏ�����!�ن���ǘ�>s�b[��x��G���hS���V��P�f`�v�0�H8,J��A!�8�pH#K���Z�bQ=B\����)��$�A�S�p4��78�
cw�La9�Jz]l�6EJ|z�b���6�=�s��ߧ�����>
+⨯}��h�Q
����R/n���
i`�� ��o�
���z��!�?v�����R�Yq�R��<����.���)!�D�cs�g��Ox�A�ᑞ�
�(�Y{�=�#q�=ԥ�#�� +Х ;��7S|�Q��V(L5�Ӧ�՚n7�@b:����~���G�������b�D��@��

�
��@8a�%�
��-7�� <�e3�K�� z�@�I��-n�]��z���^�t���)���~�TE!bq�X�<�4u@��E5�鲽�<�)�#{�Ȇ��8l��P��u�T-��:�?e�.���{�it��E�q�{%�������[���ߦ�WeS��M�oI�Q���X(�o�YQ��2d/œa����S������
 K�Gu �LJQ
ĈF���⫐P�~�
+����I��Ͻg0#�����ʪ0/l�I���tPڢA�5S[� -J�B��Qz
+�G9���e:U��Z�
d}������Ňɇˣ��^}����1T�����}a1�0�r�ab��T����e�g:�����i
|����
����;9��w� =j��n*-Ѩ�R�^����&���&~\�|')���N��09[�;��b�Ps�'���Wr+s��^HQD��~�k?҅(��|�2��L�8���f�f�=s΋E�v��J��(�W����?�/
6�oyѴ�/u��.W]ᦰ�"V�{d.�W�l��N;�M}j�
h�'�{�]]/_�F�fQ�b�fe�[�����CҞ�*)/�hk&s]m���6�
+>�m !_�)1��>�cs�ۃvbt���q	yYl����
+endstream
+endobj
+1005 0 obj <<
+/Type /Page
+/Contents 1006 0 R
+/Resources 1004 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 906 0 R
+/Annots [ 985 0 R 999 0 R 1000 0 R 1001 0 R 1002 0 R 1003 0 R ]
+>> endobj
+985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.864 688.032 513.996 698.936]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+999 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 476.432 240.255 487.336]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence_a47b1b172706010e446aa8055c982a857) >>
+>> endobj
+1000 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 384.906 304.164 395.81]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
+>> endobj
+1001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 224.439 210.547 234.367]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a1834eabb1a60cd21454609bb6af2b70c) >>
+>> endobj
+1002 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 195.239 233.222 205.167]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a20f960ad44478ccbccc6ba807c88ec88) >>
+>> endobj
+1003 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1007 0 obj <<
+/D [1005 0 R /XYZ 89 770.89 null]
+>> endobj
+635 0 obj <<
+/D [1005 0 R /XYZ 90 604.001 null]
+>> endobj
+70 0 obj <<
+/D [1005 0 R /XYZ 90 596.586 null]
+>> endobj
+1008 0 obj <<
+/D [1005 0 R /XYZ 90 496.078 null]
+>> endobj
+1009 0 obj <<
+/D [1005 0 R /XYZ 90 496.078 null]
+>> endobj
+1010 0 obj <<
+/D [1005 0 R /XYZ 90 446.117 null]
+>> endobj
+679 0 obj <<
+/D [1005 0 R /XYZ 90 333.408 null]
+>> endobj
+74 0 obj <<
+/D [1005 0 R /XYZ 90 325.993 null]
+>> endobj
+1011 0 obj <<
+/D [1005 0 R /XYZ 90 243.109 null]
+>> endobj
+1012 0 obj <<
+/D [1005 0 R /XYZ 90 243.109 null]
+>> endobj
+1013 0 obj <<
+/D [1005 0 R /XYZ 90 212.175 null]
+>> endobj
+1014 0 obj <<
+/D [1005 0 R /XYZ 90 163.948 null]
+>> endobj
+680 0 obj <<
+/D [1005 0 R /XYZ 90 68.864 null]
+>> endobj
+1004 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F11 395 0 R /F84 438 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1025 0 obj <<
+/Length 1161      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�F��+p
p�pv
\.WY�RRlE���Av�@rH!�Ba����4�!	��L$���,��t��
 [s
['���`x�a�G����,[
����6�nl���3�I��/aQ��������
��C�"�z�<eM���wlM���ˆ��z�'��
��u5�}�[*QQ5�GKL1��
A
3x%��@0�K0��"���1"`���U
��bH(oEi8
y�C`�F!��NO�
�S��
:ŕGy>
+�Y�9����6:H�d��;�(�|��CDq$<�C�4)�⡳��(�[��
�(AR������ށ�9�J������ _�E�s�A���R�����2n^.�
�t��ICϜ���T�KEc
�3�	���y��P�/!��!ž���ܑ����zWk\l��C���
�(�4�?E�+�e���'�A$�W�
	����([k��d�6H�'������ӓ�ÝHkD�D���H�>�\�!f��u����8g
&A�t��e���GXu�ReD�<s�� �j��C�O�pQ������Zل=K�[��f�4��q��,5��¼i�>��zp���{�����eilVjc+�R�
+�!L�M�7�i��u
�>	�}��Ih�ަ����voG�•�o��B����A�T87T�
W��*��ue�
��lT��o�}�����s��I[8:L^U9�@7����r���-

�ᴸ�d|u8�
����������V�[,��I�m�K�#3�A �K�CBD����y�6B�;
m�+��.���
�
]���
����EB�z��W���K��Q}����3������;�
�r���:����
$���~H�$�]ەrxL��"�%���x�L��-A���]F�03>�h�S��[
9\5�+FG�[ٕE�Ųy���+UNjHW])(.�`
�
+
�V}I����IE�x�fz�p����9�"������X�~��
4��h=�ٮ͚�cx3�0cks.�s��>���@�U
<����n2����4�6�_�|�y�ۉU��fu*��]׹�~��
[�	�2�L��G�jt���$�
�W��
l]i�f;�v�k��nl��-��0����p8.���3Gȣ���z��!,�Y�J�q�iS�3n>��c�7X��-
+endstream
+endobj
+1024 0 obj <<
+/Type /Page
+/Contents 1025 0 R
+/Resources 1023 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 906 0 R
+/Annots [ 1015 0 R 1016 0 R 1017 0 R 1018 0 R 1019 0 R 1022 0 R ]
+>> endobj
+1015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 620.755 166.812 629.602]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation_a5989bf59e335673996e366dbea747064) >>
+>> endobj
+1016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 364.69 147.454 374.618]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a0940a9ce95b204cbc7b0ba075e3802be) >>
+>> endobj
+1017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 331.951 152.436 341.879]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a26d3ec66128ed1a32ecf5905b0beae28) >>
+>> endobj
+1018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 299.212 152.436 309.14]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a6a6f001254ef8c3b3eddb432ca6e9dbe) >>
+>> endobj
+1019 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 266.473 152.436 276.401]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a239f39386ac001c6c20a50505e8bb671) >>
+>> endobj
+1022 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1026 0 obj <<
+/D [1024 0 R /XYZ 89 770.89 null]
+>> endobj
+78 0 obj <<
+/D [1024 0 R /XYZ 90 721.073 null]
+>> endobj
+1027 0 obj <<
+/D [1024 0 R /XYZ 90 640.114 null]
+>> endobj
+1028 0 obj <<
+/D [1024 0 R /XYZ 90 640.114 null]
+>> endobj
+1029 0 obj <<
+/D [1024 0 R /XYZ 90 582.633 null]
+>> endobj
+681 0 obj <<
+/D [1024 0 R /XYZ 90 483.214 null]
+>> endobj
+82 0 obj <<
+/D [1024 0 R /XYZ 90 473.586 null]
+>> endobj
+1030 0 obj <<
+/D [1024 0 R /XYZ 90 385.129 null]
+>> endobj
+1031 0 obj <<
+/D [1024 0 R /XYZ 90 385.129 null]
+>> endobj
+1032 0 obj <<
+/D [1024 0 R /XYZ 90 350.656 null]
+>> endobj
+1033 0 obj <<
+/D [1024 0 R /XYZ 90 319.644 null]
+>> endobj
+1034 0 obj <<
+/D [1024 0 R /XYZ 90 286.905 null]
+>> endobj
+1035 0 obj <<
+/D [1024 0 R /XYZ 90 231.158 null]
+>> endobj
+682 0 obj <<
+/D [1024 0 R /XYZ 90 130.013 null]
+>> endobj
+86 0 obj <<
+/D [1024 0 R /XYZ 90 120.385 null]
+>> endobj
+1023 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F22 1036 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+1054 0 obj <<
+/Length 1385      
+/Filter /FlateDecode
+>>
+stream
+x��X[s�8~���mafQ$��m�4�vۙl�}j;
ٖmZ..�f����
�ݴig����9����l�l
켜=��.�#�$(�;�`'
+�8|[;�]�Q��c��E��ž̎;���"K����^�]t���(v͚Gb�,<�2�^f�����H�&���CC��n@���׳�ٗ��C�
E���g�?bg
ӯ
��$v��K�� ��s;�k��}0��
�s�8ݎD����a�En���?�oe����P���,j�]w�y^\�>h��0�
��%�������j�����˙��g����B!�P������F�\~��f�գ��A�9�`
:18���Ap����Q
����4[�Ȉ��
�;b_2ѤŶ5rq��ޙ�G!�S�Y�Z���x����h��M�b ���b�O�i����.]��	���Բ��ǧ`y+��@6�~�� %(
�/��p��#;���<��� �p�J���P&
���#��;���hy��.	Pw9���z3J#��A��	�� %0�
w��#b��lD�ɵ�W�^U�m�"�!�C���a��ФY�
���}�L�}&sY�T3���L�\3�e�VV"���ѯl[Qwn͓qj�s
��\
Z3B���6eec��
���7_����h�qfS��(��2�ʶe�u��1��aJum�!J��t�7M�I�M at w�Sх��0FMahC [...]
+̆mN����G�[�S�5����*m�8��R��D>��SRJ����l<���	��r3�"uh�QD�60_�
+@"Q���j��4��й*!T�Ԕ��[[~�ؤ�"I
?x�ֺ��@���(j�[ ~-*�K8������QDŽ~mVΥ����x@�W���x�9���������J�m���������b�>�B�/���AuX^�:�_nl΃s��±j
�ZXd�x=A�
(��'b�ïh�(����ɰ|s����yj��0³c�r�"4��i���"cDx{���H�_�Qh�e+�T�I�Ф3q�j��
����x
��lH�����z�?2�	E����
U�i�,n�u#��h�"4�ÁS��8(�8J"�
�w��X�����=x��j�(��5/�*Ym������ZV�y��&�oEq�ס��IUw�
꾒q{Y���u+�B�w�ܑ��-���
���o���?��X
��,��a�o�"�y�#�:yY���L��'�����0P,�@#^0��?-^��'�K0/��
�
+endstream
+endobj
+1053 0 obj <<
+/Type /Page
+/Contents 1054 0 R
+/Resources 1052 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1063 0 R
+/Group 1039 0 R
+/Annots [ 1020 0 R 1021 0 R 1037 0 R 1040 0 R 1041 0 R 1042 0 R 1043 0 R 1044 0 R 1045 0 R 1046 0 R 1047 0 R 1048 0 R 1051 0 R ]
+>> endobj
+1038 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1C__Polyhedron__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1064 0 R
+/BBox [0 0 210 192]
+/Group 1039 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1065 0 R>>
+>>
+/Length 386
+/Filter /FlateDecode
+>>
+stream
+x��SMO�0
��W�4���I$��$�4�P�ô��B����nVV�#�Z;��{�^�L��5*�	���gE �q�%��5�o���f�>��P#�!\3Ȍ{ ����
+j�P{���Ȣ�=�f,1���
� �0
3vm�?mU�1F�����
�AM�V�Ӵ[5�@DJ�$֩�V���hS���2�44��S%
+C��Fvb�,
��|ĚIpU�ֹ0�(��$٤E;S�v�S�nj+0
wݏ�ed���5‰s4��P��:���tv�6��Gr��d䊕=�^�	��L�Ih����n��j�
���D����r�����w��h�&YE��.
N���{����}�(��GE�E�gM�~ŧà*g�
?U7�
.1 ^
+endstream
+endobj
+1064 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1065 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /RKBZCE+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1066 0 R]
+/ToUnicode 1067 0 R
+>>
+endobj
+1066 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /RKBZCE+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1068 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 722 667 556]]
+>>
+endobj
+1067 0 obj
+<<
+/Length 1069 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j� �O1��aI�~u!���C?h�0:n�ƈqy�����
+	��wD�����.A�
G�a뼉8���z�:/d�鴊�zPA�����C��(���
N)ΰy2c� ��h0:��ץ�O�-�
�'(EӀA��{Q�U
o[�s��m.���9��,yKz48�1*EQ�y4P�<������z��U��2O/�Sِ*�Q�v�U�=g�u 
,��٪K�
y�3���#K����gi�ZgX�^�T!˒�;�,yg|"��;"�c=�Ҙ��]׷s�骩�K�����ưT��
�G��
+endstream
+endobj
+1068 0 obj
+<<
+/Type /FontDescriptor
+/FontName /RKBZCE+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1070 0 R
+>>
+endobj
+1069 0 obj
+299
+endobj
+1070 0 obj
+<<
+/Length 1071 0 R
+/Filter /FlateDecode
+/Length1 1744
+>>
+stream
+x�UUml�U>��m�Ѳ�]��J׭�K�~����u�]�b+��
+�hG�nd��H4�BLԄH�����0��#���g~�р�f@�H��s߮�m��9���� �@P��LF�`߽G �hݱ+q`�O]
��! �o����#�/����hs�� ?GD��A�"��;S��}�(C�;��h�G}��dtf��M�?A}
�
 ��t8���Wy� U�]d\<C���i�s��TIK� �
��s
+6�N�0�W�r�V/؜���ߐ�
88m{�
z���O�f�̱�S�.�(u!��Lap�Y��M
�� �!�l.
z5W1᰷�ZI
��M�
���B
+8�ޭ�
���3�-��p�[��LS�\sY�Zs˺�fy�c�x���I�?���TӍy���`^]�.�ɗ�%%z���*~�SQ�U��: 
(ܘ�*�
��7!�V"�
�
�����|M{w���j���=��_�cD+��г�R��>t��}�h]e���?,4�AU��5��
+_����m��z��쌩�賈ԓ>��r��A=���l
+ҷ����A�KW�Ŭv��
QO�
���=��
;;6��҅7^�_ �
���drkt��"�EyZ��`֧ìPg�i3�FU�FE���;����4������
ť|���5�
����U>��,D
�dx"7ї�'�|�+r���-
+U���
��n�5��E�/k��#Z�fb��j�J�ހ��"F?��� �wJ�ä�64n
+�_
��{-�;]�爙�[6�x���o
Y �lo����܃[2|� �w1�B(�Ly�Crﰣ�a�OX��[��x��x�q�w`�3�:�־���M�P|05�559
I�_z?��5ƮKgr�
���P��x<߉��N�5��?m5���^
���f�vo�ݐ�������#G�j'W��5
�%��seQ/����V�u��`lj�
"45S�K�����[��-�nWG�L
�K��#F�oW#OFm;&��K���o���؄x]�G$
�(�#�0�VQ�\�F�^����ZB���7����>��r���~�rۦ���b���5�'���Io���M�MM}C�&[[ i
pYnq/�ݸ�Վ���z!�l~��c�����i��N���V(�A����l�
�h́\�C,JP�ס �C
<dv�����϶6?�J�����k~�Ώ����%Y	�������%�C�_�Yn�/�؟���0@��������sC'�K�A����< ->�
,8J��a�
���J��0{��ϒ�G����8�A�P�U@8�^�8�g2�p�}${��AR�E���>DC%=oT.����r�
+endstream
+endobj
+1071 0 obj
+1339
+endobj
+1039 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1020 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.388 172.889 696.292]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ac0b40b5fd7fce9c2e70001fe21b04ecd) >>
+>> endobj
+1021 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.915 657.684 146.976 668.588]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_a8be0080275e869b6858313f3ce58879e) >>
+>> endobj
+1037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.488 629.98 136.655 640.884]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ad3af2e55a3f9bb1410625b2f98a371e1) >>
+>> endobj
+1040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 147.29 184.651 158.194]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_ae6b00d1beeeae893cca2817406d0039a) >>
+>> endobj
+1041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.633 147.29 304.022 158.194]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element) >>
+>> endobj
+1042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 123.571 184.651 134.475]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_ad4fd0a018fd96e10fddd740337f60ebd) >>
+>> endobj
+1043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.467 123.571 248.023 134.475]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+1044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 98.052 184.651 108.956]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_aba7be77030b5b01a9e1049ce41bbfa77) >>
+>> endobj
+1045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.467 98.052 248.023 108.956]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+1046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.836 98.052 333.302 108.956]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
+>> endobj
+1047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 184.651 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a5431caa9e7f5c824e9a6ac2e6d69fd87) >>
+>> endobj
+1048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.467 74.333 266.294 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+1051 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1055 0 obj <<
+/D [1053 0 R /XYZ 89 770.89 null]
+>> endobj
+1056 0 obj <<
+/D [1053 0 R /XYZ 90 704.286 null]
+>> endobj
+1057 0 obj <<
+/D [1053 0 R /XYZ 90 704.286 null]
+>> endobj
+1058 0 obj <<
+/D [1053 0 R /XYZ 90 674.848 null]
+>> endobj
+1059 0 obj <<
+/D [1053 0 R /XYZ 90 647.144 null]
+>> endobj
+1060 0 obj <<
+/D [1053 0 R /XYZ 90 601.968 null]
+>> endobj
+683 0 obj <<
+/D [1053 0 R /XYZ 90 509.249 null]
+>> endobj
+90 0 obj <<
+/D [1053 0 R /XYZ 90 502.351 null]
+>> endobj
+1061 0 obj <<
+/D [1053 0 R /XYZ 90 187.818 null]
+>> endobj
+1062 0 obj <<
+/D [1053 0 R /XYZ 90 138.743 null]
+>> endobj
+1052 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im4 1038 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1091 0 obj <<
+/Length 2352      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o��~���SWV�px�j;	��$��}(��@Q#�E�$eW��{�\x�h�I�E
�Eg����ΐ�V#:zsvq{v�:���D>�G��QDG����b�i,���w#ᇄE>lҳ�?ܾ�p{���^ݞݝ1xEG��$G����ot���w#JD�
����������Ϩ��_�z�D�=�y�p�ƌ �4[T�)�t
��\M�
?��K�-��Z-ʉ'�En��ic��2�j_��NK�yU�H6N�B��_G�#�!�E���5}�)	d�m;���k��)�8�@o
+�"�-�9��]�������7g�OSIA�ٵ�������g*��?�0�,�U�Sy�f7�$�UT؁<N����c�
]�h�YM��<�o���O�x�פ �q���Y�q�N�
ߣ�V��	��ţ��P�1�~�O	=�뿪Lŕr^�23('"����A��o�<�0:^�Z���~�Όģ���u:dhΈd��tBTEO
+U�i�2SimC���Ѯ/�R��45y�<�28e�4��>�M�K]vI]��j
k'6B��
��x�Q�NY�.z?nUk�-W
+|%	m�\�*]��e&�q�X��PF�vE�B�/�xmU�'p�ʊ�I�Q�ZZY:7U�ܛ	cn
mM�!��V�c�f��*C�o
�z
�f�
S��ч
+��H$�ѷRRu����
�b���M�I�nkkK1��t� ں`"0�����]p��~��
�ԗnMQ�
��
3��J���dE�� �72�)�n�j�LE ��g�B6A{e}ꃅ�.�t	#�i�$�1{IZ]�tQ�����:ު�f{7K���Ns�T@!
;�+D_��@&S/`�K(.e��H��8�aab-���H�b��������^�?3}�Y<��ti���e32�
�:gw拃��a⠶��a�!�z!b%]��j(
�J���C�B���am�Z�3�|�+M��K#
�-���t�u����uI�_���qg��n��ھq�6[�)8�_i��s:^��
�n��qPal�.�)�>��f�3IQ�s���p��')���F党���:yLÑ�I-"!����𡟨8����9x,��G�����')��>>j�S] %�U�8�'YQ�|���q��?5��~  HҖ��8K@'�Le]t�.��Ҕ�ǡ٥IGL�٥˅#��[�-@���q22N���6�Q��v'�����ɜ^���:��b��yf�X����1�ͥG �  B�����
�W��XT�(��R�"�kڰyQ X�O��n
d6/v�bY���Y���������'�o����[p���D��9��B

�9z�{�}��a/�A�����t�|�,R(�hS-yZ�i��_Y
�<f
A_
���
�'	91M��w%��@b*M��Vj��_h�=��2ik��� ˈ0�Dz�
K�{�K
��q#��DЧC��,Ǜ:6������| ƴ���f��Ưwyb��p����'
T�)*���r��p�^�k���u[�����A��H�

+j/}N$���G������BU�n�A��p�,��f�� lz��>_�&��4�^k���X7�/^��O�'��=��M���#�#ad���$��j7t4�@_8[{�
dL ��\I=��l���*i/����	�f�v����'s�y
a���|��
.j���/�t������,����/sCy�����g95
	�NEHD�jX�J�q�9�^u.�N���p��E��g��;œ�B]�(����Q���h­&��Q�̟�z�WE�/�#-���4��Aq���ߟ��O�h(N}�tF�w(�I�
+q at d$5)�L�ل�����\
�_�=��ʰ�x��!CӍ��c��G/"��	�����
#��
+"�xI"��?Cd�t�z�gE���,��P -kz���"�u"x�@���J�L��f�2����F����%u(����vk���QOE$���܌�ZA�X+��@��-RP�J
 	x��	����*ГI�(z�j] }�'p G�lڎc �ۻ��D=\��h�
�W�o�9D'"aؽ�f�m�p`M��Eb��*�-���R<np4Wf��l��O���Ay�p�
���.awy�-�����!�~�|������s��w6zX����;����/�c����o7btU ����M[�:m��> 
���ñj�hܺ����_��]���
�a#��8_��]�6�U��3<N��?*U���6�����Ma�;�6_�a�R��s� Z7�7T�ΗF۟�t��j�
+P���]�������ݪR��$��8}��A ��򲰗�����9Ln�ix���*aIq
+endstream
+endobj
+1090 0 obj <<
+/Type /Page
+/Contents 1091 0 R
+/Resources 1089 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1063 0 R
+/Annots [ 1049 0 R 1050 0 R 1075 0 R 1076 0 R 1077 0 R 1078 0 R 1079 0 R 1080 0 R 1081 0 R 1082 0 R 1083 0 R 1084 0 R 1085 0 R 1086 0 R 1087 0 R 1088 0 R ]
+>> endobj
+1049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 697.049 184.651 707.953]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a0a28bc5d3066a6ffe552a90aa688fe46) >>
+>> endobj
+1050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.467 697.049 272.919 707.953]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+1075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 673.613 189.015 684.143]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a4980562fb3e164d31f6a0ce66b638ce3) >>
+>> endobj
+1076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 537.614 184.651 548.518]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a6eb50dda90cfae549d191f5124f2562d) >>
+>> endobj
+1077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 511.913 184.651 522.817]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a922faaab6e2cb023231b56b049bca0f4) >>
+>> endobj
+1078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.222 511.913 347.688 522.817]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class) >>
+>> endobj
+1079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 488.104 184.651 499.008]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a848091b71fff6f0085950e64b6479e4a) >>
+>> endobj
+1080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.467 488.104 264.61 499.008]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+1081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 426.102 306.942 437.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_af495c3499ed2742d6b68bc6bc99224d7) >>
+>> endobj
+1082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.757 426.102 370.313 437.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+1083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [124.15 335.523 183.706 346.427]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+1084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.935 323.568 340.357 334.472]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_ad51277b918f8fc2a6892b1a987f8f746) >>
+>> endobj
+1085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [344.172 323.568 403.729 334.472]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+1086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.189 323.568 473.746 334.472]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+1087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 254.284 191.678 264.814]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron_a2cd3747157a618a88e2c95bc45451f12) >>
+>> endobj
+1088 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1092 0 obj <<
+/D [1090 0 R /XYZ 89 770.89 null]
+>> endobj
+1093 0 obj <<
+/D [1090 0 R /XYZ 90 688.456 null]
+>> endobj
+1095 0 obj <<
+/D [1090 0 R /XYZ 90 552.627 null]
+>> endobj
+1096 0 obj <<
+/D [1090 0 R /XYZ 90 366.337 null]
+>> endobj
+1097 0 obj <<
+/D [1090 0 R /XYZ 90 272.854 null]
+>> endobj
+1098 0 obj <<
+/D [1090 0 R /XYZ 90 272.854 null]
+>> endobj
+1099 0 obj <<
+/D [1090 0 R /XYZ 90 225.812 null]
+>> endobj
+1100 0 obj <<
+/D [1090 0 R /XYZ 90 168.99 null]
+>> endobj
+1072 0 obj <<
+/D [1090 0 R /XYZ 90 146.613 null]
+>> endobj
+1101 0 obj <<
+/D [1090 0 R /XYZ 90 146.613 null]
+>> endobj
+1073 0 obj <<
+/D [1090 0 R /XYZ 90 77.486 null]
+>> endobj
+1089 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F60 312 0 R /F98 1094 0 R /F83 436 0 R /F11 395 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1112 0 obj <<
+/Length 2635      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۸~���[������t�{��ٝt�>�-�2���PR���=  ��!�J�N�H������'�	��r����˟�d$�������
~�M�O	Fj6'��6���Ͷ\==�wUv�*n��z�)<E?ܼ�Q<��=-7�9x��*������}^�-�,r������>\���������8%Rz�X_���'w���#f��~i=��u5yw��+����
+{k/�:�z��i�CѮ�ϵ!�#�U=�asJ'��6�V����0"R
:#dꜚ�n"0z�c�Kw�8����L
+X��P�5�(�$��D
+��1:�`F�NRm��(bh��yE r9��
l�m
����=P��ꌒ
qՌz�i<}��
���L^�����b�t�vTb�95IPhf!��E=�ZcG�q�3�BX� L%��Þz����h	��AEk7��C���<s�M>�b��A�]vl�?d{wWă�vF0���U�{�Ю{��(�A��{'�ջ�����#*
�(pw�~ȃ��[N�z1��u��[,7e��!�|zN��a*B
6
y$؀�;�ة�A���D�c�x�4�
|��ă� M ʨ>�>
i#[����UVl�7�v�|�B͐��C���
�
�\��U����Ι`�o�`�.�
��z�z6���%bؒ���W��X�< l
�����f
{W ��02	m�
+D%�Ԅ� 4�n��V���CB	$�(8d���2
A|��H�p
C�C�����x
��e8�����!�H��e�4l��8$9���Y��㐷4�C� ��3�]��a�DB�
�����h�
琈3D bR�H
D"HS��Q��f<�.C�/� QW�H4���|��I@��@�2�Ds ��o�%T�`�
C5&�Ü�:���!��&��ZO��3�D����]�R�f*��"�`�X��C�y݆@_�s,c\�-�J<2�R=,f�7��1��
��M���7U��w��a�/+��!۵�n�u�8(V�B��4��r s��d
 �� ��E <�� ���� <�
�#
.�14� <@�
��/�&�2��SLТWC��D�]�1T�`
e�O&�
��
R
+9@�M
R��V3�

\�\���

+]�_��m^�����Y�~?��`��Q7b�5�qĸ�N�����#�Hܖ�*���J
?J�4
��!%���@y�!�ة�Ö3�G-`�q�K���~D3:�
+��58~��� A�$�\��
�蝌��-���X`^fC�ш(
��T�\�,�(�ϩj<��-�2m��~�R�6����d�v�=�Mx$���<��d����h���ǂk98���^�T���X�q1[ߺ8�o��
+,��F��C�X*$����쟉H��I��oϔjb
+Jui'�,�����c�-ؗ	���9�[ �7?;QP����
+����T�V�z,vy��I�8�>[�Rb�
���Nv�A�
�Љ��Oy��������?��f�]<ϱ+r����G�TZ:y�%��}�87o���sB�7�a��~"�Y	\IF;�3c�
X#��tsT�侫Z=�Z�~�
+�n$R� �&]j�W���O٪���G5c�z7���!��f�{qrd
)�Hc6���
��<���*����2A�뇪�i�g�E
+�@*��<6p< �:���ݲ�Oq�PrC�
��v��zd
TB@
+>
�o)N�����K�<��
%
a�#
+
���Y�����@�1��(�fE�2��]�/,���
B���UDzJ�p�8^��x:i
+�}��a�,J����"
gM�"���n	��L�Z��5�ZpLG�Z
i��S�1�ZNT��#
�n,@���S��'�uN5A\����NQL�z��0sQwj�;�ޝCߝ�48R���M��*4��S��aX�a��
�DN���
���)�fR���V�=��&{��<��
~L�$�=kz�2�)�.���a��]2�8䬨�֮fV9g�ZY�oD���#�A��b���n���v�� �&-�o���u�[.��'jϿq0�g)EN	��� 
+���$����h�;ʸY�!�)q�һo[\M}�,�6��>��֟�^
�g� juN��a��9��F�=�&H3w�c�v�5|/��ڪ�/��>���vc����PB�Ϋ]��G�rv��������w=/�vmZ{��yNCˠZ,0�4A�
�4n�V�6���S{ޖ5�߽��r[��x
+��FT]${�����%�Rݴx���'�� a)����H�Pvʏ��s��7�R��G	��
ڇ�M
5�6��(��b�顙�����i�h�{\(��p=d�I��B����'
�G�3 7���^�N&��ы$v at i'NaG4U�k��K`�Qq6��-�ӫ��MX��~�s_�����vi��bܚ�K$E����a
+b	B�ȸˆ[��{'3o߾q7�3K>����6�C��/��wo3Cs��]^�e&����_��!��ڕsaP��5�5���Y[��wy��v��w���P���BDH�Ӈ�~�ח/oKX�%Z�m
3�v�R@{h�G��j 

��UG�6�5�8	��;��#��(E�7����@���5��Xº���� Ľ��
+endstream
+endobj
+1111 0 obj <<
+/Type /Page
+/Contents 1112 0 R
+/Resources 1110 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1063 0 R
+/Annots [ 1108 0 R 1122 0 R 1109 0 R ]
+>> endobj
+1108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 254.674 201.372 267.072]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 241.17 201.372 253.165]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1109 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1113 0 obj <<
+/D [1111 0 R /XYZ 89 770.89 null]
+>> endobj
+1114 0 obj <<
+/D [1111 0 R /XYZ 90 721.073 null]
+>> endobj
+1074 0 obj <<
+/D [1111 0 R /XYZ 240.245 659.423 null]
+>> endobj
+1115 0 obj <<
+/D [1111 0 R /XYZ 90 652.783 null]
+>> endobj
+1103 0 obj <<
+/D [1111 0 R /XYZ 332.797 597.584 null]
+>> endobj
+1116 0 obj <<
+/D [1111 0 R /XYZ 90 590.944 null]
+>> endobj
+1104 0 obj <<
+/D [1111 0 R /XYZ 338.775 535.744 null]
+>> endobj
+1117 0 obj <<
+/D [1111 0 R /XYZ 90 529.104 null]
+>> endobj
+1105 0 obj <<
+/D [1111 0 R /XYZ 461.214 461.95 null]
+>> endobj
+1118 0 obj <<
+/D [1111 0 R /XYZ 90 455.31 null]
+>> endobj
+1119 0 obj <<
+/D [1111 0 R /XYZ 90 383.383 null]
+>> endobj
+1106 0 obj <<
+/D [1111 0 R /XYZ 90 361.006 null]
+>> endobj
+1120 0 obj <<
+/D [1111 0 R /XYZ 90 361.006 null]
+>> endobj
+1121 0 obj <<
+/D [1111 0 R /XYZ 90 278.43 null]
+>> endobj
+1107 0 obj <<
+/D [1111 0 R /XYZ 90 235.201 null]
+>> endobj
+1123 0 obj <<
+/D [1111 0 R /XYZ 90 230.718 null]
+>> endobj
+1110 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R /F11 395 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1137 0 obj <<
+/Length 1698      
+/Filter /FlateDecode
+>>
+stream
+x��YY��8~���i�ֲ$����f&N��f�O�T
+c�&��pL2�~[|0N2�������/[+
[OG�g����V�BN�5[Z!�|/D�ï�um���a��ry�H��%�{������ٕ�7z2}��-��g��x3����l?�0r����
�X
u�ZW�G�k
+�7�D��9[
gL�y\oDVEU�gzk�zQ��R��4*��C�
�+��"��¼Y��U�K�ܡ���d+��
c��G�s�-‘�<�X�i#�S��O]����!̎>KC��
i�G���e��
B�"�b�F*���2)A^�0�k!cT"3nT�
"��U�gL0h�F�&:�
a���Y
��z�E
�6>R��@��|�D�4�l��!ľ]�EqD=�8�ߋz�%Ǽ��4�!�o
�lt����\� [��4�/
+`�N,
���b�s�

DŽh]c�!�iU�h^�}�Ұ
TI���)7�c�D�P�m={�$����(�zZg�${ٳ�--)✝���H�2�y��b�C�٬Á�DA
+?�EN�`���� ��

+=�я�$]�Ȍ:P���z�o����=�iH:bCK�d�D?�S��a�aW��Cp,�j���K�&���z�=�G

����YV	�RW�$���E��1
B����P����CyUm�+
����}Pu"N6Q��
�y�/e��'��7A�x
��q
��y�S 2�T��i���9OD|����U�<�1�2�
�*U��]�6p���J�(�=u��� �NTu������Y�)�$�
P�e=ĒB�D��+����8��� �+Q
}���m�J�z������2�
��~�lL���Y�I���5
�/m،��F?���R���$�jأ�*���`�CagAo��Ew+F�����י�l���B,��"
/�ݨ���.E%���s����d�"x 䰞��{�����7�O"�`��*0䵺݊�.t�{wm�b�Bhyu)?MI��5�lS�Q�X��
b��^'M��ˇ�L�z
������.tNT:2-0M2!G2��$�H�iΜ2l
Q�2^�j��ʪ���fnj�y���̤�27dʾ�R<��Jg
W�	�?ZF�/{��p���V�����!�}��>� thH�\�Cr'�0���\�=kF��
J��c�s_��~l`Wm��c��L��`�C� ��ޮI�]cdh[�&�M�>�!���$���0�(�!��S��@�l�{!{���
��ߞ锄����ߞ�
����l8R
+�����n��'�b�=]��H+����
	�� h:t^�N$��3î؇�	Y#� :�`P,�(�
dO(�+�(_�	T�PQ)fFD!���)����c Uh��9��D(� P ٢ת�N
�a�|S��ˡ��fH�`��Q�EO8
؎��#�(�b
+W
mr �
�)�@t�P�օ>�����0r<
+s6
+� y�
�E.Ldgy��*h �^����,�
j4
7����?N��d��
��i�=q�"\z���=Y����0C���fw�n6ɳ�k]� l'n
��;�
�8$Sh�e��]Y�(��S���ϻ��j�%�h
�̃r�*��o��l�W��O�1���U��
�dQ�]Q��� �
+dqC��!U4������׾�0�}�:�ߝ���j�h2��+ �
+�P����e(�xC�1��h����>;�A����:�
+endstream
+endobj
+1136 0 obj <<
+/Type /Page
+/Contents 1137 0 R
+/Resources 1135 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1063 0 R
+/Annots [ 1124 0 R 1125 0 R 1126 0 R 1127 0 R 1128 0 R 1129 0 R 1130 0 R 1131 0 R 1132 0 R 1133 0 R 1134 0 R ]
+>> endobj
+1124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 569.34 159.927 579.871]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a22380e8edd12a8121b5af6a60eb05da2) >>
+>> endobj
+1125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 541.071 159.927 551.975]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a27e2ee6c6e6f960cc523a3366249f5f9) >>
+>> endobj
+1126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 513.176 159.927 524.08]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb12fac766004b358c5) >>
+>> endobj
+1127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 485.28 159.927 496.184]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a1ef0c686ebed5c06b004a0799f3b1599) >>
+>> endobj
+1128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 457.759 159.927 468.289]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_afd68df98e748af269b3588ca5504bb1d) >>
+>> endobj
+1129 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [163.743 457.759 209.76 468.289]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1130 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.759 429.49 174.861 440.394]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) >>
+>> endobj
+1131 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [158.861 401.594 215.488 412.498]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_aebff23eb304cef5bcd9ac11ee5d7c7ed) >>
+>> endobj
+1132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.883 332.164 193.271 342.695]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient_a2b3404ee14fc16f5592bb10a1a4bdd7e) >>
+>> endobj
+1133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [154.225 242.679 200.241 253.583]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1134 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1138 0 obj <<
+/D [1136 0 R /XYZ 89 770.89 null]
+>> endobj
+684 0 obj <<
+/D [1136 0 R /XYZ 90 675.389 null]
+>> endobj
+94 0 obj <<
+/D [1136 0 R /XYZ 90 668.789 null]
+>> endobj
+1139 0 obj <<
+/D [1136 0 R /XYZ 90 587.96 null]
+>> endobj
+1140 0 obj <<
+/D [1136 0 R /XYZ 90 587.96 null]
+>> endobj
+1141 0 obj <<
+/D [1136 0 R /XYZ 90 558.331 null]
+>> endobj
+1142 0 obj <<
+/D [1136 0 R /XYZ 90 530.436 null]
+>> endobj
+1143 0 obj <<
+/D [1136 0 R /XYZ 90 474.645 null]
+>> endobj
+1144 0 obj <<
+/D [1136 0 R /XYZ 90 446.749 null]
+>> endobj
+1145 0 obj <<
+/D [1136 0 R /XYZ 90 418.854 null]
+>> endobj
+1146 0 obj <<
+/D [1136 0 R /XYZ 90 350.7 null]
+>> endobj
+1147 0 obj <<
+/D [1136 0 R /XYZ 90 350.7 null]
+>> endobj
+1148 0 obj <<
+/D [1136 0 R /XYZ 90 303.596 null]
+>> endobj
+1149 0 obj <<
+/D [1136 0 R /XYZ 90 217.149 null]
+>> endobj
+1150 0 obj <<
+/D [1136 0 R /XYZ 90 194.773 null]
+>> endobj
+1151 0 obj <<
+/D [1136 0 R /XYZ 90 194.773 null]
+>> endobj
+1152 0 obj <<
+/D [1136 0 R /XYZ 90 134.049 null]
+>> endobj
+1135 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1172 0 obj <<
+/Length 1434      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6}�W��L ��C�8�v��$��(Hb�E��D�
���K�L�R�]�=w�3s��f�����u�
��ܹ�:;a ��4q>�#�
	��]�U
�e���I��t\���
��N�|��oi�
�fq]{Cʰ{V��^��SYy$re�H�GiH\�y�o��n_����
+#'�?cg��:�"r�v�r'�>�f�����7]!�=��KmˤL�\Mܤe�_M�J/�yjlO�������a&
Yō��/�2��J+,�J�2�kZ��O�L��ܵ;����
؀D@���(e�>`Zʩ�%)���=��[�2�_ ��G��
`�x/�
+���� ��
��p ����8�(\��
Ǻ	�(�("��&�W3j[=���GQO��U��_s�F�����X����� A��8� E��d��F�=^�v	�@�$�.�� ��b-uH�0�R�ʺNǙ!�u�)'SY�}����8�04��1X���6�e�T�X	lY������}Dx����jf��ʆ�w~wy��bt��������;�ީ��G��
�qH�!a�
+�zy��P ��f�ĵAK����83�A���Q�k���A�x������
�S��(
�.���ލ�cۘ��\�I�e��`��<�M�6H��l�
�#C�^
B�ԩW��Ӭ��@�W�N�t��1�&���A}BB�i��!W���;z��|��A�}�����#���;�㠲)Y�=�@
A�1�SXS����nŬj����٫�.�j=k�}������+��V�#�7�Y�/e>��^�n�Dq��e�ѵ���m5�6﷿w/:$Fg���l��#B���J�6<L
+�G��p�KJ��=��[��˦��z�X$k���&X��D!
+���;	��=��G�;dv�/���p%���C����;�%X�aw�����Þ<c�J*]��p&a�"
>���^Rdrڌ�q1��d/��O
+�W��r��,�V�Tc	2z��PX
�]�F
��
�=�!����!�����0��0�?t�t�L��͂��~���=/'m��?���C�zX���evk�T�Q���
�
�X�p�U����K0�
�*q���h��g�66 at v*WCm
7�Q5-Yv��!X�z}�
 86�<<b`BB�F���\��|�$6D�ڞ����h~�DF"F�`c���e#�ƞž��֫�=A����٠�
���%��'�����;O{��!  ��넖�D�a��Յ^������6����*���a51���e����0^�Ek+�b�Φ�^ђ 
;RY����������
��M]<Ӟ�UY�t�Y�89�3��
%e�]�>�	���:��e%m��
lE��h�g�@5�@��H	
c#�v��ݟ�C���<��W%���6�?ڙ�
+endstream
+endobj
+1171 0 obj <<
+/Type /Page
+/Contents 1172 0 R
+/Resources 1170 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1063 0 R
+/Annots [ 1153 0 R 1154 0 R 1155 0 R 1156 0 R 1157 0 R 1158 0 R 1159 0 R 1160 0 R 1161 0 R 1162 0 R 1163 0 R 1164 0 R 1165 0 R 1166 0 R 1167 0 R 1168 0 R 1169 0 R ]
+>> endobj
+1153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 567.372 250.936 577.3]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class_a5c1b244e9422e1c29c71844a9f896aee) >>
+>> endobj
+1154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 538.782 227.703 548.709]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Complexity__Class_a00d82d93d2d0113f1ea5b615decb2849) >>
+>> endobj
+1155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 305.846 164.042 316.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_adf1055ffa2127b453280f5491cb15ffb) >>
+>> endobj
+1156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.858 305.846 245.107 316.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.991 305.846 337.241 316.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [352.125 305.846 398.142 316.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 277.256 191.16 288.16]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 277.256 252.31 288.16]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a90cc7704ce2f0ee6c205bfa3877a7671) >>
+>> endobj
+1161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 248.666 191.16 259.57]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 248.666 257.849 259.57]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a3c4dfe2a773355c5842dbe133a7c974e) >>
+>> endobj
+1163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 220.449 159.927 230.979]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 220.449 196.739 230.979]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a894f888629036722adcbc81268cab48a) >>
+>> endobj
+1165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 191.485 215.13 202.389]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_af6656a7b76ac03bbfccba848d6a42dc2) >>
+>> endobj
+1166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 162.895 201.302 173.799]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_af0873d79c213b1552008ea16229b58e5) >>
+>> endobj
+1167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 93.515 159.927 102.362]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 93.515 180.131 102.362]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence_a6f45bd1aa87e7b459ee0d93a65ff05db) >>
+>> endobj
+1169 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1173 0 obj <<
+/D [1171 0 R /XYZ 89 770.89 null]
+>> endobj
+685 0 obj <<
+/D [1171 0 R /XYZ 90 674.694 null]
+>> endobj
+98 0 obj <<
+/D [1171 0 R /XYZ 90 667.659 null]
+>> endobj
+1174 0 obj <<
+/D [1171 0 R /XYZ 90 585.737 null]
+>> endobj
+1175 0 obj <<
+/D [1171 0 R /XYZ 90 585.737 null]
+>> endobj
+1176 0 obj <<
+/D [1171 0 R /XYZ 90 555.412 null]
+>> endobj
+1177 0 obj <<
+/D [1171 0 R /XYZ 90 508.481 null]
+>> endobj
+686 0 obj <<
+/D [1171 0 R /XYZ 90 414.144 null]
+>> endobj
+102 0 obj <<
+/D [1171 0 R /XYZ 90 407.11 null]
+>> endobj
+1178 0 obj <<
+/D [1171 0 R /XYZ 90 325.187 null]
+>> endobj
+1179 0 obj <<
+/D [1171 0 R /XYZ 90 325.187 null]
+>> endobj
+1182 0 obj <<
+/D [1171 0 R /XYZ 90 294.455 null]
+>> endobj
+1183 0 obj <<
+/D [1171 0 R /XYZ 90 266.273 null]
+>> endobj
+1184 0 obj <<
+/D [1171 0 R /XYZ 90 237.682 null]
+>> endobj
+1185 0 obj <<
+/D [1171 0 R /XYZ 90 209.092 null]
+>> endobj
+1186 0 obj <<
+/D [1171 0 R /XYZ 90 180.502 null]
+>> endobj
+1187 0 obj <<
+/D [1171 0 R /XYZ 90 110.799 null]
+>> endobj
+1188 0 obj <<
+/D [1171 0 R /XYZ 90 110.799 null]
+>> endobj
+1170 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F109 1180 0 R /F102 1181 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1206 0 obj <<
+/Length 1983      
+/Filter /FlateDecode
+>>
+stream
+x��YYs�6~ׯ�[�i�  2=f�\�4M��}J;
��d�<�����A��(�N�>t�3����b�o?P��x�{9��bv�Bb/B��»X{�d!.࿕��gb���k���H�K���_�^<{q��͞_�>�<�
��s$C/�g���
+n��0bQ�]��
(�k��~�a�
+F�륾8�B6r�D���`���
�1���&N3��/(
�:��m���q�5q�B��
�j|/s�gi��ʮ���T;U$
+�(�D"A�Fa���_*i�zm�͕r:����:@��E��˙���<��
�uO��*�'�Uj[�Z5i�qBc�U���9���J�(La/J!
+D��=�f"���_8{Azr���O�@R+��	aO�H�U���q"�>hu�
'�zb��
��? �VF�D���G2aj���o!QI+�
��I����"����8KQ�V,�0���YD���@C�H�'�iR�����y�C�{2�N�3�vs�C%�u�������Eu��n��jBs �']��C�!��ܧ��
:pA���[�4���W�R&)�^��bB]�%��nƸmDƄ�JsU��}ݨ��{��z'��T��saW��J��?��);�1-5'�ߨ�>IJ��S�{�&�*+g���?�Y\��2S��BH�,ݫ����T��@
�ȣ�9�{Z\�
��
#E���t�
`��F��iE��\�$ �Tņ!l:U��?B͔�;(��C�I^�vٮ�Ґ��2�!�>���

"��)� |A��G�Bd�+uB�P�@{B�yމ�9R4�=���8K�{;
�!�P3* �!��F��}P;“# �}P3��( m/��#@x=�[ڒ�a��#��{L���-�G�jL�=`��W�@�z�TA�J�C��]|�����yc6�����H���0��VY���Y)�u�l[�[u�G.(�5	�t�e�uwU&;�UMl���.�vO��X�����]���*n�so]��(
�2�J=9�;ި�Kv�,����-K��a�_�b7����^ [...]
+�����.c�G�U:u�[ݽ�Ӿc�ɣ׫Hbڸ�RU�͛�n&�H��m�~?�ߐ����'\_�h�?N
tH���~���@�ڧpu{{�[BP�4�1�E�K$�~�+
+� �G�޵/E��#�;y(
6�K���TZn?�N�1 "pDP�g�Ì;��:�eM��vISV��o �-5���l5:�|�)�]��xU�.��.N\h�!�M
��7�FГ���N��r�˷_#��U���Qx��nn�q�
Ma�"��׃9����K=
8���y@"�ۍK3��@
��G{4j�c`@bh�R �N
+�r ��j�Z��S`�{@:cz/�	���"
�Mٯ��s ��9�����Y���
�m_�c���cO�TgL_Z�6{���g~�2��
�+���[�vPn��u��%��a
�_4�%���$��$!G�a�$
P�Ž��C�o�������S�I�sY
���m���_
 T�0��k�n1��$�<����r���7&F��?�/�i��L�G���L�C��K(�	%��.��Ew�~��������OuW�o��;̹.'�Jçv��&����j8��*I56�hf��z�X��݃.�����
�I����U\�.�t��La�?�	(n����\��@"
�_�>Bwb"%5�k�}��8{�3�Y	����o�Wh�K
�
J�(����<{��]��[�q���'�J�ܵf���{��o���D~��]K�u�,���
�A�B
Wd#窍�����n�?���EL�Xu
�i����
�
J�����/K���~��&v^V��M���W4���ϊ5�
+endstream
+endobj
+1205 0 obj <<
+/Type /Page
+/Contents 1206 0 R
+/Resources 1204 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1063 0 R
+/Annots [ 1189 0 R 1190 0 R 1191 0 R 1192 0 R 1193 0 R 1194 0 R 1195 0 R 1196 0 R 1197 0 R 1198 0 R 1199 0 R 1200 0 R 1203 0 R ]
+>> endobj
+1189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 665.968 227.951 676.872]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+1190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 416.3 198.363 427.204]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System_ae287421ae1ceab78c861efb2803c1edb) >>
+>> endobj
+1191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 388.335 215.13 399.239]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System_a559e1395399115eb381a421c8916eb1d) >>
+>> endobj
+1192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 360.369 201.302 371.273]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System_a6efa775d8084cb3611b1b6b512dc2827) >>
+>> endobj
+1193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.91 271.128 266.363 282.032]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+1194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [110.861 259.173 160.993 270.076]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+1195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 102.299 157.417 113.203]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a2531a33c20c3cb27ea7fcf0a04339c2e) >>
+>> endobj
+1196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.232 102.299 238.482 113.203]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.135 102.299 327.876 113.203]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+1198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [365.454 102.299 442.704 113.203]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 74.333 191.16 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1200 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 74.333 252.31 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a9fb052eb3479e107bde4cfd95599c787) >>
+>> endobj
+1203 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1207 0 obj <<
+/D [1205 0 R /XYZ 89 770.89 null]
+>> endobj
+1208 0 obj <<
+/D [1205 0 R /XYZ 90 721.073 null]
+>> endobj
+687 0 obj <<
+/D [1205 0 R /XYZ 90 540.536 null]
+>> endobj
+106 0 obj <<
+/D [1205 0 R /XYZ 90 533.892 null]
+>> endobj
+1213 0 obj <<
+/D [1205 0 R /XYZ 90 435.329 null]
+>> endobj
+1214 0 obj <<
+/D [1205 0 R /XYZ 90 435.329 null]
+>> endobj
+1215 0 obj <<
+/D [1205 0 R /XYZ 90 405.63 null]
+>> endobj
+1216 0 obj <<
+/D [1205 0 R /XYZ 90 377.664 null]
+>> endobj
+1217 0 obj <<
+/D [1205 0 R /XYZ 90 332.061 null]
+>> endobj
+688 0 obj <<
+/D [1205 0 R /XYZ 90 208.91 null]
+>> endobj
+110 0 obj <<
+/D [1205 0 R /XYZ 90 202.266 null]
+>> endobj
+1218 0 obj <<
+/D [1205 0 R /XYZ 90 121.327 null]
+>> endobj
+1219 0 obj <<
+/D [1205 0 R /XYZ 90 121.327 null]
+>> endobj
+1220 0 obj <<
+/D [1205 0 R /XYZ 90 91.628 null]
+>> endobj
+1204 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F8 448 0 R /F1 1209 0 R /F10 1210 0 R /F13 1211 0 R /F7 1212 0 R /F11 395 0 R /F24 309 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1234 0 obj <<
+/Length 1361      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~����$`fxE�tmS4K�.ɞ�e�Q��K����wċ,9v�fɀ{t�

���Q�[y�{;��brt,���$��w���0A<�_
��'L	��_��Lg뺸��
�Ί|�Ru�Wuմ*ͫvv~Ӵ�
��c�U�6���R��ľ�2	I����������˄�K�#��D�e���#����È%��U+�^H<
�|���hv�:�8�b�.
+��M�=A"�x&ۍ����4B!�����ja�&_�������
mcF)���yc�F
P�8I���;���a)�$�
+E1Į�\Q�G�L���f���Ļ�r(�i^�T����V�i�Y��W��
{�#
.�*W�c�#;]�)�B�1ܕr��7�
꙰��9g���9?�E�B����xX�?��	�zisl\�#� �Is
"8����f�O��?�}�y��je�$5m�<�-6��IS�5R�H���5 at e�J�� �RUi1,��<Y��b�/@B����2�8�m	�󔠭GZ�X ��f�G�|�G�9 F�x�о�Q��
	
+��("�`��O;W_�6�
�+4�_M��u�
�;%�P���
��vni�7���I����A+׊����:[D��7�\��d��9�H�'����r�}
����
l�c��A{R��= �
����~f�b�0�U]M��rn�M�?��~��MG)����UcQg�r��KWq�ʃ�i�k@:�2?V��*��j��r��˺(���'�
+cZ���m�
�SP
���CG
+([�95g���B ���z�X
�&g"��w�d�Ǣ痆G�\ �6��(����B|ÎooO1�18�O�= |�����4�M��
��/	E	�|
+_�q1v�� ��+ �p ����9�������R�Gڌ-4K�U�0yk���R��i޴��"��Y`&�6
+#נ���Ugx�T"�{�_���Z�4KCgv�ة�a3��yfr�^�s��|����Sv
�;�0m�����������k�L7E;,�&kk
Sp6�Pd��
^&˵������6�:ܙέg�M�SׇS��;���5s�1�
��1���jL�D����i�
�UP��@I�(x����;�s��ݛ�ϑDZLܺ ,o䎷&��1!t9��x�L����7�-�
"iW�~`�(�6{�F�z��#���)��4�;����éN���7�i�ڤ+����եNaf_��H�C��os�>�6w;�1���>���q�E�L�s�x�����ߺ�t�p�I�O��v���h�Y�PV����v�Gĭ�����tSÌ�9����qG��K ��
 &BP�1��?�B���]ɼ�5�e���o�ϖj
+endstream
+endobj
+1233 0 obj <<
+/Type /Page
+/Contents 1234 0 R
+/Resources 1232 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1246 0 R
+/Annots [ 1201 0 R 1202 0 R 1221 0 R 1222 0 R 1223 0 R 1224 0 R 1225 0 R 1226 0 R 1227 0 R 1228 0 R 1229 0 R 1230 0 R 1231 0 R ]
+>> endobj
+1201 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 695.059 191.16 705.963]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1202 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 695.059 257.849 705.963]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a5b54a0e76432b52a2259a02f31fc0b83) >>
+>> endobj
+1221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 667.271 185.651 678.175]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+1222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.149 667.271 205.855 678.175]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a19ca194f097ddf860d1ad80961a5eda2) >>
+>> endobj
+1223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 639.483 215.13 650.387]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_abd74986494a6e574bb0499b3b7109379) >>
+>> endobj
+1224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 611.694 201.302 622.598]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint_a6062c78f7cefbc808b99f35b72fcda8a) >>
+>> endobj
+1225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 522.684 221.326 533.588]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+1226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 276.037 191.737 286.941]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System_ace9427756858d751136f1e72309b9be0) >>
+>> endobj
+1227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 248.248 215.13 259.152]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System_a67b38d56d0f11bda997b393e7b5d7c5f) >>
+>> endobj
+1228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 220.46 201.302 231.364]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System_a172718f103bd4533e3971e8e69f9f60c) >>
+>> endobj
+1229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.363 131.45 257.19 142.354]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+1230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 121.552 132.51 130.399]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+1231 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1235 0 obj <<
+/D [1233 0 R /XYZ 89 770.89 null]
+>> endobj
+1236 0 obj <<
+/D [1233 0 R /XYZ 90 712.265 null]
+>> endobj
+1237 0 obj <<
+/D [1233 0 R /XYZ 90 684.477 null]
+>> endobj
+1238 0 obj <<
+/D [1233 0 R /XYZ 90 656.689 null]
+>> endobj
+1239 0 obj <<
+/D [1233 0 R /XYZ 90 628.901 null]
+>> endobj
+1240 0 obj <<
+/D [1233 0 R /XYZ 90 583.601 null]
+>> endobj
+452 0 obj <<
+/D [1233 0 R /XYZ 90 400.147 null]
+>> endobj
+114 0 obj <<
+/D [1233 0 R /XYZ 90 393.381 null]
+>> endobj
+1241 0 obj <<
+/D [1233 0 R /XYZ 90 294.977 null]
+>> endobj
+1242 0 obj <<
+/D [1233 0 R /XYZ 90 294.977 null]
+>> endobj
+1243 0 obj <<
+/D [1233 0 R /XYZ 90 265.455 null]
+>> endobj
+1244 0 obj <<
+/D [1233 0 R /XYZ 90 237.666 null]
+>> endobj
+1245 0 obj <<
+/D [1233 0 R /XYZ 90 192.367 null]
+>> endobj
+689 0 obj <<
+/D [1233 0 R /XYZ 90 69.73 null]
+>> endobj
+1232 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F60 312 0 R /F83 436 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1256 0 obj <<
+/Length 1214      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�H~��� ��\���:$r�&ޘF��*�xl���rI��~
��q���+m��
s�wn�
��B����?8:���"WP��s�Śm��
�ʹ[�9�W�\c�A�p�^
^]�ޥ?���?�> ��5��sd;Z��~��
��5���h�K+͢
��6�5�
�(��գ�0��rN[d0%DA �0	�X_�*x��p����1�>��!��L���@X��A��c)g���HXn/�)�)�
�q4͂�0
��!���iRd�:�z
�v�`v?`
�(�:`��� 
V���c��a$��E=c�b7���0)ut/1l�\�ɵ��Lf2	e
�Ͷ�S���&��L ��[�9�XO���q4V�u�Nc��ߨiX�
���Z?�H)�vm�V5�L�Cl��) ��Pp\Y4��Z�eׄ'L!Y�Crx�/��UP�E�볁vkr����h8�<;�h�б4
+��
+Y�#P��*��R�n��(Y�IVƲ2�^1����uM]�45"� ��L��D�a��(M��3�-���u(����4,W2)�W�4O35(�Q�Z&u���� X��Ld����,]�'e++�S�r�a��/�X���`��$쉔h`��W�jͼ�
��
���Ja�Tw��l�2�0��1�/cmˆ`S�ֶl�\��m������_��^�4��A�B��CK�
�7���A\�O��4�#�aU*oAO�W�����\��HZ����7�&��wr�ݝ~�:�_K��Bʵ̋��f����?�n��ުI��RK�!��:��"o�8��yP�
	z>	Zt
�v?
�>�C��
R�`�^�PĩI?���#t�?��}��_]]��c0\
+N�
�b��ߞt�+��k�����o*n�&��zk-��Z
b�ȁ�죵�d	��Tkч������o-N䢚4A? ȵ�ŭ^ 1L�H�_�k�v��v��"Jf{�����h\�ӼȂ��^��w}�
�x���ϲ2���b�e�7��!���v�

���dX�����p�ˮA��cHPdS��C;-q��=�C�0d�7w��f{�Y8��v����8�[�u"C�rmP*�N)��Ү���jp��X�ʇ Y���yq� ��k�
��O��v��c��A�mt�+�oh� �Τ�:����lkE��mc�E�#��& B���ݲ(���"�������n{J
Ҟ�\/�4kl�X\�WУ��
һҎ
+endstream
+endobj
+1255 0 obj <<
+/Type /Page
+/Contents 1256 0 R
+/Resources 1254 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1246 0 R
+/Annots [ 1247 0 R 1248 0 R 1249 0 R 1250 0 R 1251 0 R 1252 0 R 1253 0 R ]
+>> endobj
+1247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 627.411 155.753 636.258]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name_a3d873e83cf77a02b55c7d6d6d245ed23) >>
+>> endobj
+1248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 389.149 276.41 399.077]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value_ac1791e52b930ea1fc3863866a26b1a81) >>
+>> endobj
+1249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 359.618 277.516 369.545]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value_ad6243026e52cac8f2b4ef458ff4b760f) >>
+>> endobj
+1250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.485 343.203 300.167 353.108]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 330.086 214.413 340.014]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value_a7483a53d677492ed42b591525243d243) >>
+>> endobj
+1252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 93.986 165.158 102.833]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Degenerate__Element_a9ff8417659bb4800d825f91fa8685aaf) >>
+>> endobj
+1253 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1257 0 obj <<
+/D [1255 0 R /XYZ 89 770.89 null]
+>> endobj
+118 0 obj <<
+/D [1255 0 R /XYZ 90 721.073 null]
+>> endobj
+1258 0 obj <<
+/D [1255 0 R /XYZ 90 645.166 null]
+>> endobj
+1259 0 obj <<
+/D [1255 0 R /XYZ 90 645.166 null]
+>> endobj
+1260 0 obj <<
+/D [1255 0 R /XYZ 90 594.501 null]
+>> endobj
+690 0 obj <<
+/D [1255 0 R /XYZ 90 499.011 null]
+>> endobj
+122 0 obj <<
+/D [1255 0 R /XYZ 90 491.389 null]
+>> endobj
+1261 0 obj <<
+/D [1255 0 R /XYZ 90 407.984 null]
+>> endobj
+1262 0 obj <<
+/D [1255 0 R /XYZ 90 407.984 null]
+>> endobj
+1263 0 obj <<
+/D [1255 0 R /XYZ 90 376.719 null]
+>> endobj
+1264 0 obj <<
+/D [1255 0 R /XYZ 90 347.188 null]
+>> endobj
+1265 0 obj <<
+/D [1255 0 R /XYZ 90 298.257 null]
+>> endobj
+691 0 obj <<
+/D [1255 0 R /XYZ 90 202.768 null]
+>> endobj
+126 0 obj <<
+/D [1255 0 R /XYZ 90 195.145 null]
+>> endobj
+1266 0 obj <<
+/D [1255 0 R /XYZ 90 111.74 null]
+>> endobj
+1267 0 obj <<
+/D [1255 0 R /XYZ 90 111.74 null]
+>> endobj
+1254 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1291 0 obj <<
+/Length 1425      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6}�W��L �K�Z��8�7V�����`�-/
+H���wq�HY�eW���A 
`w��9X;+;�&�'��;	JB:�['�N$���t��#yS�1vש(�ź.
��R��"��x�"좷u����\��n-�?3�n��a��H�F?�[�V�*��4��������|>�>!�v�v��(v�r��v�0����Ob�^-*����[8ד�&�D�er(L���#!��M�!"&ȷ�M�/�W�S��\�!
�&f�5�Li�� �'~ȫ�	��տK��x�E�r=��4�H�V?񂗼j$
�I�B��wfϲ�:�,�@{[
=h�rc�W]�G�
Cfښ_���.�Nn�*�ڣ̽ϫ����1-��Q� �1D�
��_)e�U_�L!:
}q��D��
��i,��FiS9�,%�Q	�Ԛ�Ȝ��:Wa!�ȜC�Xr��|�⨯&[7H��Ί
A�
!���c�C�.Na�˜�ld^sX�>x!�<��G�Ix?bX�����
��ش�c��l�0�Ø%���@i��Vi`J�E.Jh��cG,��5��Ү�Թy�tTpk�	Q�����[+�]��%��G��$0>E�ɺ�n �"�t��xyÅ
_tU��
�'����{h��(V&��7��5��[�5���V�����`
818(UJ�{(��84��Ap���� ���o�'�c
�v�T�OX0���ls��
+���.N&��q���EO"���g)�)�[��ߖ�w:ɵx��)��Q9��ˡ�+��
�TY4O�:�L�b+2+�|��ghۯ$m=���c�a͟ާx��r �/�<��g�v��JOޕ��T^���0����
+f����"��^
�4�:��BoS����#� ���J5<(��P�{�]$d`�@9ф�uu�R^�j�t$���/�%`�K�?��۠�R��
.���_�rӏ�1�ډQ��݁]��'��#vQ��C�L�ҽ���G%s��
+��TDߋ-s
Ơ�ؓ0�}*_&;\�
+hY������{ғ6Y�/�]�~uN��ܕɾ�(Ӷ� >.��Bh�2�H�]i'	A~��2pC!F��MA[�V�bL+<h���1�@��4�t
��2���
����s)��
��g���ݦ:J
M���'�{->q�#�u:��a
��}��p�\��lw��*��R�;�L���">�q4���;N`���3�.����jGv�U2����Y4�@O��Ϣ��
Q��h!��/�WW����UM�|L�U����Ky5ܪ7��L��p�ǘk*�SZu�h
�>� (�2X�M}8�[Hu��:v�A~���(e"}-ݵ���lvӭ@5W(���Gų�
Eo���u���K^髰�6	��3�Am�r�
��H59�7�ڍfbvY�����`����)
+endstream
+endobj
+1290 0 obj <<
+/Type /Page
+/Contents 1291 0 R
+/Resources 1289 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1246 0 R
+/Annots [ 1268 0 R 1269 0 R 1270 0 R 1271 0 R 1272 0 R 1273 0 R 1274 0 R 1275 0 R 1276 0 R 1277 0 R 1278 0 R 1279 0 R 1280 0 R 1281 0 R 1282 0 R 1283 0 R 1288 0 R ]
+>> endobj
+1268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 509.931 219.384 520.835]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception_a18ac064d1fafb42b385e6b942df648f0) >>
+>> endobj
+1269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 282.547 180.391 293.451]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type) >>
+>> endobj
+1270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.889 282.547 200.037 293.451]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) >>
+>> endobj
+1271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 254.817 191.16 265.721]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 254.817 263.777 265.721]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a6c93053ad6b6bbcaa9aee01b646bba06) >>
+>> endobj
+1273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 227.461 159.927 237.991]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 227.461 189.845 237.991]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a3c40a54218985599831d143c5bb5972f) >>
+>> endobj
+1275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 199.357 215.13 210.261]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a67b795731a54c5c3b470d44e10806ac5) >>
+>> endobj
+1276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 171.627 201.302 182.531]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ae1acaaf59811107a0571b1f65a41b012) >>
+>> endobj
+1277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 102.063 179.254 112.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 102.063 235.981 112.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ad2b2c058d1c2dfc8c14144caa50ee91d) >>
+>> endobj
+1279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.797 102.063 317.046 112.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.949 102.063 372.966 112.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 74.333 179.254 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 74.333 196.689 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ab67f80234f60baee3584e955d4fa3f0a) >>
+>> endobj
+1283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.504 74.333 277.754 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1288 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1292 0 obj <<
+/D [1290 0 R /XYZ 89 770.89 null]
+>> endobj
+1293 0 obj <<
+/D [1290 0 R /XYZ 90 721.073 null]
+>> endobj
+692 0 obj <<
+/D [1290 0 R /XYZ 90 634.077 null]
+>> endobj
+130 0 obj <<
+/D [1290 0 R /XYZ 90 627.22 null]
+>> endobj
+1294 0 obj <<
+/D [1290 0 R /XYZ 90 528.842 null]
+>> endobj
+1295 0 obj <<
+/D [1290 0 R /XYZ 90 528.842 null]
+>> endobj
+1296 0 obj <<
+/D [1290 0 R /XYZ 90 483.619 null]
+>> endobj
+693 0 obj <<
+/D [1290 0 R /XYZ 90 389.069 null]
+>> endobj
+134 0 obj <<
+/D [1290 0 R /XYZ 90 382.212 null]
+>> endobj
+1297 0 obj <<
+/D [1290 0 R /XYZ 90 301.459 null]
+>> endobj
+1298 0 obj <<
+/D [1290 0 R /XYZ 90 301.459 null]
+>> endobj
+1299 0 obj <<
+/D [1290 0 R /XYZ 90 271.994 null]
+>> endobj
+1300 0 obj <<
+/D [1290 0 R /XYZ 90 216.534 null]
+>> endobj
+1301 0 obj <<
+/D [1290 0 R /XYZ 90 188.804 null]
+>> endobj
+1302 0 obj <<
+/D [1290 0 R /XYZ 90 120.89 null]
+>> endobj
+1289 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1313 0 obj <<
+/Length 1780      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��6~�W��p�"t��>��nN�$M�����ú{k�I��;�el0,89}���O3��|#��y�����ǽэ�A�BIe0�!���k��9
܍_LjDB	���翾_�4�z����=�p@��)
L���;
L��� #��
�
8ep]{����y��i
hMr#�!�:P� B
+9>��M��C*p�7�$uw٬�N�|�T?���,5B�nBR��	����ou��.�#�w)��F�-8$
#!�P
+'�'J�7+�

+���u�N&�1`>w��`��_�i�G�,� ̒t�\˼��>�R�
X-�����ǫ��S"�j�y�T�R�N�x�
S�4t)M�ٜR$9Crr޶���6Z��`���m���F{ 8R����yaHb�<�~wɣ���?���|@D~b at c�C�ĀFTi��
+̼M��Ƅ
+��B*t"�d�����:J�d�~�&y�n���
8R�
ğ�
v5����
O����"[m�z$X}
21n-
r���	v���d�V�8�{���˚)x��,[,2�#>'����A$�+0��ć�"�
�����
���$ 0������!
ؿc��le�Q�ݑ:w|/��pƛMZ�J��d���
�8��f�9
����ԠR!M�t��
\"�Ѝ|��e��*(�~�T�YJ�6nU�[vQ���z�eB�@Q�,��B�_�i�oy*
���J �$���>�`�t�F:���uMLt.�#3�ɰ
јM�e�t�Ŷ<4��&��ՊĀ�~U(F7�0�Y�!�j�
���}�G�0S4�V:?74ãMxn�jج�um��V弬Z�8���%���v�m��ds�ω����W{�8�B*�殝$HSo8 �0�ޖ��@|*�P�",u�4zkk�e��B
�@T6��*��

Ij�0sH%�%1��2�m]�%;WT��fk�A�F[ob��۟�`�5��]& �m�8p1���&��W!��@�(d^�����R�_5���/� pi�j�M�N��u�J !��+`��b�4f]�H�x�6�d�CzTmJz�K��}��ㇼ�+�?%�}�M��-&LPm���I��y��m% 
3y�?
�\ [...]
+Q�X�:`rV�]."!�_���@B�du(��Vo� �HE
d�9 at 9�0Śm���
q�P�*�>K��;�vN��{��l�`C�n�צ���-�c9�z�y��J#�4�ti�-�IR�.�m
�rK�
+�:)�]jY�ۆ�g\O�=׏��l��!?eY����=���'3�<6G\�Y4�6˓y�
8��Ǵi����1��'���7�p� $*�i�]�y��S�+���N�`'�4�Rz�I�`��X]z��|���x�ܺY\A�S��_��4<X��L=�ƃ��Y��V��W]��������Q��;k���Z}�%�A=�C���Ɛ��T�/m��c� ����Y�t�@�Ѥ���`Z�A�N�F�x	� 
��N�F�:�l�W�L����?��϶�a�DBw
�`�SC��C���Rv�j!'������i���e�޾,��WK�� ��ް,�HB�c�F���
���8'r����7���h@
'�r_y�D�|���W�:�g(���G������}�=o�t-�O���W�W
xH��MEC�!��q�h��_[m�Y��� $��e���g���f�w�&�r�bU�0�*
f%�]f�!t�����[�����D
+endstream
+endobj
+1312 0 obj <<
+/Type /Page
+/Contents 1313 0 R
+/Resources 1311 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1246 0 R
+/Annots [ 1284 0 R 1285 0 R 1286 0 R 1287 0 R 1306 0 R 1307 0 R 1308 0 R 1309 0 R 1310 0 R ]
+>> endobj
+1284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 695.006 179.254 705.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 695.006 202.228 705.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_ac3e1a9737e2b459e439904f9817f4289) >>
+>> endobj
+1286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.044 695.006 283.293 705.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [293.196 695.006 339.213 705.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 667.11 179.254 678.014]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.752 667.11 194.467 678.014]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator_a8fb4edb895a850c5ddf8646b31d92a07) >>
+>> endobj
+1308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [198.283 667.11 275.532 678.014]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 577.998 219.642 588.902]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1310 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1314 0 obj <<
+/D [1312 0 R /XYZ 89 770.89 null]
+>> endobj
+1315 0 obj <<
+/D [1312 0 R /XYZ 90 638.915 null]
+>> endobj
+1316 0 obj <<
+/D [1312 0 R /XYZ 90 479.054 null]
+>> endobj
+1304 0 obj <<
+/D [1312 0 R /XYZ 90 456.677 null]
+>> endobj
+1317 0 obj <<
+/D [1312 0 R /XYZ 90 456.677 null]
+>> endobj
+1318 0 obj <<
+/D [1312 0 R /XYZ 90 383.999 null]
+>> endobj
+1305 0 obj <<
+/D [1312 0 R /XYZ 90 349.329 null]
+>> endobj
+1319 0 obj <<
+/D [1312 0 R /XYZ 90 344.845 null]
+>> endobj
+1320 0 obj <<
+/D [1312 0 R /XYZ 90 273.985 null]
+>> endobj
+1321 0 obj <<
+/D [1312 0 R /XYZ 90 239.315 null]
+>> endobj
+1322 0 obj <<
+/D [1312 0 R /XYZ 90 234.832 null]
+>> endobj
+1323 0 obj <<
+/D [1312 0 R /XYZ 90 161.969 null]
+>> endobj
+1324 0 obj <<
+/D [1312 0 R /XYZ 90 81.969 null]
+>> endobj
+1325 0 obj <<
+/D [1312 0 R /XYZ 90 77.486 null]
+>> endobj
+1311 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F60 312 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1335 0 obj <<
+/Length 1938      
+/Filter /FlateDecode
+>>
+stream
+x��Y[o�6~����l�fx%�tk:�뀮͞�"Pd��fK�$�˿��Me���aORd����
2Q
�"�?O�~��W��7)�$�	M��e$q����ZD�S���9�O�Y��n����N-��f]��Y}?K���JUgmU�|�oZ���)�ӟ�Y��׏j��SU�
+A�4&��W�&�W��',��p��(�L�?�h�߁�L��Y��b�๎>M~���5�`�A��=���yմY[�ڎA(���l�
�+
q�0I�J�C�(
c
+��sI!;�
��!��+�ʌ���̈�ꈞCy
+�IB�fs1��%�W
�XL�C8�2�i2�s<k�QB�����TY}s���VL�UiwA�z���.5�H6�\PN�r�[4gT�[AU"ɹ]|]�k���x��#
3��ږ��Ե�ś���\&&
sJ��n���]]�j�}��{�R-�sQ�*o��B!��9�iW�(02l�A ZaF��tP+��\m�1M(��YZ�������{,��2 e�0��)��ږW(���
E�}=��;���
�U��I����
�pD -lE�ʶب�Z�O��˖MֱdP
#��Y���>L�n2#����
��b�(
������ӯ�m�b9h��jS� ���k.��k��.��Iة&(N�.�նV�*�a�Vu�*ʰ{��h��F�47�,W�tb8��%O)��"Y����"�A���H�!����c���g�J-��J�
���
���;N����J�$��KCw
�w��HΣ�S$�@�i�__�Ɣ-����ct�i#�]��<{�
���-!�
S���X�J�/��+��f��q�߅�RU at +���
,TE�q!�%_WͮV�e/
;�9���(4
�(q��X�%��Y�eg'Y���'gm�g�iZ�k��8#��D>�d9�Oq�=���dn>� [...]
+�+�
+j�v��f0�,���VMQ��'M�k�2 ��@I0a at Où=�Q��U�s�=id�3�Q=K������lR{�q�����G.=	��% 1�	�I�c���p{6��#�Ȣ��
"|�7�wϡ��;e<���m,�L����l鮔`��WJ��Q-g�T��F����9�s�ǯWn��]W��|�}m
���9IM���Q.u�������q�#!=�)AI7�|?}Pi4>r�H�@��r�aDT��X
���( p��-�;���BL�EnC����*7ؽٕ��c�o`�c
l˧^�:�x���6q��78��5@���Æ�*
+�B�e���Y�Z-��ڱIn��N�^��
0�V�ȮX/\�3�j�m�O���Cm�>̙\��
:]��:���O�]	�lFIsX�:?��FS�z$���&/���n�}�XU>RFe�!����Y�e�v�Ao�	�ǟ�%�Y@�>E��SEh'�:���Z ��T<o
+�*X��	p�i�=2�и`�1>
:�� / 
÷�8�}�ڬX�Z�y���.z��x
+����������O���
�2���`��ن%B�1�<3���jU�Z������%2-�B��m@��Q=[��7�q ��!��>�7/��i�j�����F�}����0���8���?m0�_jQ�m�)�����YS-
��?
�����@�#ӳ�����+}�u�U�.K�v�'
�rP�]���e!�
���u�}��N��0A2�b�G�8E\O�>��/��ul�����.[��o5�/M����ӧ3ב�f�γ�ˤu�u7Ad[+a���c�������ȿ�21w{(d��n��k��ˋ���
+xo��js����4Exaѡ̦�U�v�[����J�y�� B��.�$������ot.�nX�����
�m�
+endstream
+endobj
+1334 0 obj <<
+/Type /Page
+/Contents 1335 0 R
+/Resources 1333 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1246 0 R
+/Annots [ 1326 0 R 1327 0 R 1328 0 R 1329 0 R 1330 0 R 1332 0 R ]
+>> endobj
+1326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 339.013 190.054 349.917]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System_ab8be81becce1bc803566f5b19e366799) >>
+>> endobj
+1327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 310.053 215.13 320.957]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System_a62ca7c2995414638d139847539631598) >>
+>> endobj
+1328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 281.093 201.302 291.997]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System_a379e7fec2e73df8beb7904b85d7645df) >>
+>> endobj
+1329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.27 190.012 256.414 200.916]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+1330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 178.057 130.826 188.961]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1332 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1336 0 obj <<
+/D [1334 0 R /XYZ 89 770.89 null]
+>> endobj
+1337 0 obj <<
+/D [1334 0 R /XYZ 90 655.872 null]
+>> endobj
+1303 0 obj <<
+/D [1334 0 R /XYZ 90 621.202 null]
+>> endobj
+1338 0 obj <<
+/D [1334 0 R /XYZ 90 616.718 null]
+>> endobj
+1339 0 obj <<
+/D [1334 0 R /XYZ 90 555.811 null]
+>> endobj
+694 0 obj <<
+/D [1334 0 R /XYZ 90 465.933 null]
+>> endobj
+138 0 obj <<
+/D [1334 0 R /XYZ 90 458.667 null]
+>> endobj
+1340 0 obj <<
+/D [1334 0 R /XYZ 90 358.538 null]
+>> endobj
+1341 0 obj <<
+/D [1334 0 R /XYZ 90 358.538 null]
+>> endobj
+1342 0 obj <<
+/D [1334 0 R /XYZ 90 327.845 null]
+>> endobj
+1343 0 obj <<
+/D [1334 0 R /XYZ 90 298.885 null]
+>> endobj
+1344 0 obj <<
+/D [1334 0 R /XYZ 90 251.169 null]
+>> endobj
+695 0 obj <<
+/D [1334 0 R /XYZ 90 126.8 null]
+>> endobj
+142 0 obj <<
+/D [1334 0 R /XYZ 90 119.535 null]
+>> endobj
+1333 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R /F60 312 0 R /F84 438 0 R /F11 395 0 R /F91 520 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1370 0 obj <<
+/Length 1344      
+/Filter /FlateDecode
+>>
+stream
+x��XKS�F��W��
+�gF=�Fx�e	8��E	{0J��J��}z
�,#ˆE��@I���__�l,
l��~��&�
6��5��F�
�	sΌqg:��6�0l�G$pAH�
}���\Mo�o�������O� J�!�7f���6�|a`d��,7%�Cmx�����֦`D�xm�ooF"DYp�z�<3�f֘R�<,�<z�3W%/�Y���99u�
%.rl�S0V���R�!*\�ڷ���q7f���W'�Je�c���u�2J��PcL<��@i�>q��asal������r�
��G
�\l at -�N�kE
a��n�
��n��wy�~}�ذ�]9����	[fQZj�Z�� ���%x�(t	lňXc���c^�Q��
+�Ǽ��Ѳ���/bXB�Ư��7F�/K.��
&���l��
�F��XK?UN�t���g��hi��
�<K*I^�ǙE��
�
��c�O-�z��G�- ��>�|��Z>6������(ܖ���1*�R��A��*%�0O���G�+#�09Aڈ�^M�ݭY@\��ʣh�Yo��!����
�)���PO�ڬ�>�
�R�/�
{�G�+\�|�.d���8[0��Q
�z���x���%��ce��S5^�G5�
�J�0�%נ����ݷԱ�r���}���^��ҙ����2�VnI�]1��+�ج@U�
��b��6r��U�\��x���K�C�ߟ���yQlr����JL��-��
���k�6X6Ԉ�C�-i���QA S4�ռ'y^�jB���G_ЙÜ���(����aA7�/��H��
+�� A?���O��f�B՛�A���
�A1m�	kv���@{8�f+��5XD�~�G*$bsژ�r{G�t�R�d��9��0�C[W��$),fQt?_%���$Ԙ�*�Y&	�zB�(�<
��V5�
���䓀 �����W8Є��|�o��Yk׀	P�Bi{g��|��wĸw'>�%�-�I�V��� ��?��Rߛ�vߏ���O�-ߪrG'�G�azY�
+Mc
+4��[h(�B���
(��߳��1F��¡��L������6\5ݏ��=N1Iّ�"Lh_��n�y'
G8ȳ�j��'!Cao�uZ�jz��a���:��وRoV�@Xټ4u)�
{�K�5A�C,���ߡ�a������w�c%�&�m
gpXs��7�r�4�C��*��i��}Qt}}�^.��Z��e�.V�Bo<3֣�&��?
+��"nu?���F�@�7_- �/`���
g��)w����M\r�57�DH����\~�L
V
?h�%�˺� y��^_�%YΫR͔`뫜�
Ô�i
+endstream
+endobj
+1369 0 obj <<
+/Type /Page
+/Contents 1370 0 R
+/Resources 1368 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1246 0 R
+/Annots [ 1331 0 R 1345 0 R 1346 0 R 1347 0 R 1348 0 R 1349 0 R 1350 0 R 1351 0 R 1352 0 R 1353 0 R 1354 0 R 1355 0 R 1356 0 R 1357 0 R 1358 0 R 1359 0 R 1360 0 R 1361 0 R 1362 0 R 1363 0 R 1364 0 R 1365 0 R 1367 0 R ]
+>> endobj
+1331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 684.254 138.588 692.832]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type_a3b9f75c49b0c6f00923b8f7d827ca9ad) >>
+>> endobj
+1345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 652.189 136.934 660.936]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type_aa8aee01f50041535fba84ef399e5ee81) >>
+>> endobj
+1346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 619.925 145.233 628.771]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Generator__Type_a2c6506f69be68e287d31aa3db68d664b) >>
+>> endobj
+1347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 366.07 203.633 376.974]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type) >>
+>> endobj
+1348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.131 366.07 223.279 376.974]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a58e50b5ebd0b0f5b4d5e44690a939e34) >>
+>> endobj
+1349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 333.906 191.16 344.809]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 333.906 263.777 344.809]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_ab557b1ec4f75e98b5b4155b932d7a6af) >>
+>> endobj
+1351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 302.114 159.927 312.645]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 302.114 189.845 312.645]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a147ad6db2e9d13bee7450666cad83d7d) >>
+>> endobj
+1353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 269.576 215.13 280.48]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_afb38d7eabfa00c8d068e8cdd4820d46c) >>
+>> endobj
+1354 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 237.411 201.302 248.315]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a7440d17db8648a633c9b77c512bf8f9b) >>
+>> endobj
+1355 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 157.575 202.497 168.479]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+1356 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 157.575 240.962 168.479]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a61e7f56c96825c1dbd9b1753ead625b7) >>
+>> endobj
+1357 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.778 157.575 322.028 168.479]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1358 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 125.41 202.497 136.314]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+1359 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 125.41 244.818 136.314]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a45537abba3ff2661633cb4033fe15e0b) >>
+>> endobj
+1360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [248.633 125.41 325.883 136.314]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [335.786 125.41 381.803 136.314]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 93.245 202.497 104.149]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+1363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [202.995 93.245 246.502 104.149]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator_a8b88040458f91e980a158487b14a359e) >>
+>> endobj
+1364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [250.317 93.245 327.567 104.149]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.47 93.245 383.487 104.149]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1367 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1371 0 obj <<
+/D [1369 0 R /XYZ 89 770.89 null]
+>> endobj
+1372 0 obj <<
+/D [1369 0 R /XYZ 90 703.325 null]
+>> endobj
+1373 0 obj <<
+/D [1369 0 R /XYZ 90 703.325 null]
+>> endobj
+1374 0 obj <<
+/D [1369 0 R /XYZ 90 669.427 null]
+>> endobj
+1375 0 obj <<
+/D [1369 0 R /XYZ 90 637.262 null]
+>> endobj
+1376 0 obj <<
+/D [1369 0 R /XYZ 90 582.735 null]
+>> endobj
+696 0 obj <<
+/D [1369 0 R /XYZ 90 484.019 null]
+>> endobj
+146 0 obj <<
+/D [1369 0 R /XYZ 90 474.751 null]
+>> endobj
+1377 0 obj <<
+/D [1369 0 R /XYZ 90 387.199 null]
+>> endobj
+1378 0 obj <<
+/D [1369 0 R /XYZ 90 387.199 null]
+>> endobj
+1379 0 obj <<
+/D [1369 0 R /XYZ 90 353.3 null]
+>> endobj
+1380 0 obj <<
+/D [1369 0 R /XYZ 90 288.97 null]
+>> endobj
+1381 0 obj <<
+/D [1369 0 R /XYZ 90 256.806 null]
+>> endobj
+1382 0 obj <<
+/D [1369 0 R /XYZ 90 178.619 null]
+>> endobj
+1368 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1390 0 obj <<
+/Length 1929      
+/Filter /FlateDecode
+>>
+stream
+x��Z�r�6��+��4�x`�jۓ4�I
w�x<��L%R��<��� A����%z�EW�i����$q0	pp����w~)q�(�ap3"
H
!�_��O0�dpF0��y����y6���Gy|?M
�8�9�����dt�S���,�Q�����bQ,��X���:
j����>g���������
}p@
+�I
g��;
���� #���4
8e�;
>�>��3�fi~�a�5
#R�
�����8��(
z�֋a�̗I�ZK�a�U88�
1
���N��j���E���3���1�����,I��H3�D��r��{
���ҭ����Q���t���b>q��vK#@u�܎��*K�1�l:�T�'�䥏ABę�$"Q���Rє$��qe���ү�&�p3=
e�ۓP�.U��ȥ��XF)�-2���z�g6ܐO��th��Ȯl���to�/��_��
�04 �!{D���6��0FR�	/���,K*8Ԥ
+����U�E*Z��f!R!���B���l: �_4���ŝ�g�5��lp��?�(�٦�C8d'J���D$��hҪ�
A"w���7
a��F��X��
���������ŏy��
��痐����Q�cP:E•�nI�a���qJ��
��t���IjԾk�-��hA�H�5�EI��j���$�`�"vn���U�.��9��IGI��˵�FAhU��s�'[�H�7�
�c�]��!��'�����P�������76WI�3���ejW�ύ	�:
+x��]�8p9���%MHs_
�^7q/;�\�JQ��
w, ��*CD�f�J��L_��
�u��p�

+�A�*]ZI�~�6�d�#�]fz�Kq���yV�<��p
'i��l�M�-f��z�W
���8�'���;�
���z��Y�Y�L�t

�6 �e\���<
j�;0�E������JH
�V�)�{y8g0q�i
�KkȧO�5p��KkBГY�c���oN}���T��
C�
�/�PZ#`4�N��
+.���yM�(�0�F3΀� �t�`��@O\��Y��}
�aƸ}�2=�
�n�@Gh��H��
���x��t�^L�J
�^g�x�f
�i"�6ܵ��[0�!i8u����hF
+�猆@{h�:��i�}L�{����]��)���h�]�.�,yO��#y�ge
�i)n
+�agax�U>��[�فd�xomO_�dJu[�`�%#�
+D���;���'�����W�#�d."�o�!\�
��\D6�?�� m�B
�E`{Z
��E��u�X�R����n�#9
+́���џ"J[��n�Ó��>�s��
(@�ճ�$w���
+
EH�%�A�B|(�C��� >]ZY���G����9�[�� ���,p�^�C	�
H}��[��Wm�eL�m[ٲ��u�y}���N�:�:c�7g�������!�0�c^�D�%"X�X���(��,2�B�Ҏ���mC:��l�魣�aj��7Zߴ�7�
+{��,Z*
ǤY�:��\>�h}��_o�!
pC�쵼>���(1ݩ�O��,D��s�\h�(
�}��
����i��N�
+�K�
��
�m,�o��ֳ�q��z����Nޣݶ=�͐$��07c�
�*��N#�C��M^
CJ����� �?&E{׮���l��k���S���
8sJ��k�Ɠ�#��j^�����ә���B
+t�
��W�V��tu�$Qӫ>�+o�z�+��t��'n�&�غt�.����/�(���q�����.���u�"�\+3E�����o���ꏞ-��
+�T_�<.������B�4�xn���f)��v�7�,w�$)\���B%�XW#�Ð��|��a"%�;�k���Fw��͌�3���F��~� �
+endstream
+endobj
+1389 0 obj <<
+/Type /Page
+/Contents 1390 0 R
+/Resources 1388 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1402 0 R
+/Annots [ 1366 0 R 1387 0 R ]
+>> endobj
+1366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.82 665.984 242.885 676.888]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+1387 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1391 0 obj <<
+/D [1389 0 R /XYZ 89 770.89 null]
+>> endobj
+1392 0 obj <<
+/D [1389 0 R /XYZ 90 721.073 null]
+>> endobj
+1393 0 obj <<
+/D [1389 0 R /XYZ 90 586.965 null]
+>> endobj
+1384 0 obj <<
+/D [1389 0 R /XYZ 90 564.588 null]
+>> endobj
+1394 0 obj <<
+/D [1389 0 R /XYZ 90 564.588 null]
+>> endobj
+1395 0 obj <<
+/D [1389 0 R /XYZ 90 493.912 null]
+>> endobj
+1385 0 obj <<
+/D [1389 0 R /XYZ 90 459.242 null]
+>> endobj
+1396 0 obj <<
+/D [1389 0 R /XYZ 90 454.759 null]
+>> endobj
+1397 0 obj <<
+/D [1389 0 R /XYZ 90 381.896 null]
+>> endobj
+1386 0 obj <<
+/D [1389 0 R /XYZ 90 347.226 null]
+>> endobj
+1398 0 obj <<
+/D [1389 0 R /XYZ 90 342.742 null]
+>> endobj
+1399 0 obj <<
+/D [1389 0 R /XYZ 90 269.88 null]
+>> endobj
+1383 0 obj <<
+/D [1389 0 R /XYZ 90 235.21 null]
+>> endobj
+1400 0 obj <<
+/D [1389 0 R /XYZ 90 230.726 null]
+>> endobj
+1401 0 obj <<
+/D [1389 0 R /XYZ 90 169.819 null]
+>> endobj
+741 0 obj <<
+/D [1389 0 R /XYZ 90 84.802 null]
+>> endobj
+150 0 obj <<
+/D [1389 0 R /XYZ 90 77.486 null]
+>> endobj
+1388 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F100 1102 0 R /F72 334 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1414 0 obj <<
+/Length 1459      
+/Filter /FlateDecode
+>>
+stream
+xڽXYs�6~ׯ�[ə
+�A��t:�Ʋlj�����d2�Ly(<���w4)ӎ�2y�"���
`D����|\̰\�������V�B�z�rc����q���w��:��,���
lRo_��v�x����f�����'l��#?��l�������ea`}UD��R�Ժ��5�`
+P�,BP�95��/!Z4J��	���Ee=�@��<`'�1
>��!
�
���y� ��!ľ��rD<�>��p�֔��4Y�Q�����.�d=��s��4(<�d �B䢌�|,���?���(�X싾��j�9sJ�eU�^ވ��ۢy,(�'�^?�%��9�.r��y
+<8�+���F?�Ҽzet��J
+l͉�"M���D�ԕ&>-���*�jIzr� �y].��	e���@�����{�<��
��#��}�-��䝲{�F�s�sF�r��xݬ��ik���J�z}��q�y5��
 
rY 
����3�)�{{e,��6�n.fֻ9����c
��@(=�
s
?������*�)�,�z#���t&6Q��ڝ1�V�M
"_8sF��r(��$]��r�ٮ�?(�
�"�p��k����-N֥�#˵vʣ:q(��H�B����$߶�#�UzTq�|\7��G�F�M��L���M%��Ek�$�E�G��W:
2|����H�\g_�!�! !� �7�_�%���$����x�
���~�
�b@�
�Ʃ���6�`	("�a��KP��UpP�T�G���g���T�
+Ԡ3Q�e�Sp�q!n
?���-i���꓈�v-���!�X����$��6 L*�3ҏ<��r�/W
�_�
�N�@jh��%�@7�T�K��j���mXK;�G�XO-{��.
�u7�0�R腊�
��*�iT
�g�ʦ,2�UfiZ�T��%�{�i*^
qv�
F\��Qo�O��_���,�
@s#�����!
�a30�}@��b��<B����o�����I`�)x��1x
+�f

�^:.(���-r�͚���d/�F
+`�7 �����Okh;+��Z
?8�cǫ˷�Q)Gt��<��2l�i�
Ip�PG�U������b���ɺA�Q�3QKJ��tu"
<��lҞ~D ��#;�ț��5
����t,��d-�=��"�M�r$/Ύ�w�B�i9��-�2w��}��v�қ�"0�!���Ne��[�#
r"��$�4
+N�P���X���������/c:�f���ʤ���


��tj�\V��5�!w47M^'���
�����G�<����mt}�Cu!�Rߧ�c�>�=틓ˌYg0{`7~���S`Q�>���
�!��:,j��Wz�_ԛ�(�6Ѷ%����*iq���J��8�ۭ��Dyc��P��eՕK�Ȯ�<�"}er+L0hu��}-�iO
P�awvW׻''�f
G�-���qT=l�)	{����vV��D��g��Z��e
+endstream
+endobj
+1413 0 obj <<
+/Type /Page
+/Contents 1414 0 R
+/Resources 1412 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1402 0 R
+/Annots [ 1403 0 R 1404 0 R 1405 0 R 1406 0 R 1407 0 R 1408 0 R 1409 0 R 1411 0 R ]
+>> endobj
+1403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 610.464 213.297 621.368]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System_afb407c2937347e7381fed31b31a46e98) >>
+>> endobj
+1404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 582.251 215.13 593.155]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System_a8f448359523682c0623804af48cc2dff) >>
+>> endobj
+1405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 554.037 201.302 564.941]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System_a4c7c1b1005912277576320fd650d1e89) >>
+>> endobj
+1406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.907 464.337 278.294 475.241]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator__System) >>
+>> endobj
+1407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.526 453.358 190.592 463.286]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Grid__Generator) >>
+>> endobj
+1408 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 296.648 138.588 305.225]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type_a02ca1ef23d4c2b965198ea42d9d683a4) >>
+>> endobj
+1409 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 268.534 176.236 277.281]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Grid__Generator__Type_a1a63d52277531ad7883e6679a90fdc67) >>
+>> endobj
+1411 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1415 0 obj <<
+/D [1413 0 R /XYZ 89 770.89 null]
+>> endobj
+1416 0 obj <<
+/D [1413 0 R /XYZ 90 629.617 null]
+>> endobj
+1417 0 obj <<
+/D [1413 0 R /XYZ 90 629.617 null]
+>> endobj
+1418 0 obj <<
+/D [1413 0 R /XYZ 90 599.669 null]
+>> endobj
+1419 0 obj <<
+/D [1413 0 R /XYZ 90 571.456 null]
+>> endobj
+1420 0 obj <<
+/D [1413 0 R /XYZ 90 525.326 null]
+>> endobj
+742 0 obj <<
+/D [1413 0 R /XYZ 90 401.871 null]
+>> endobj
+154 0 obj <<
+/D [1413 0 R /XYZ 90 395.072 null]
+>> endobj
+1421 0 obj <<
+/D [1413 0 R /XYZ 90 313.743 null]
+>> endobj
+1422 0 obj <<
+/D [1413 0 R /XYZ 90 313.743 null]
+>> endobj
+1423 0 obj <<
+/D [1413 0 R /XYZ 90 283.796 null]
+>> endobj
+1424 0 obj <<
+/D [1413 0 R /XYZ 90 237.666 null]
+>> endobj
+743 0 obj <<
+/D [1413 0 R /XYZ 90 143.79 null]
+>> endobj
+158 0 obj <<
+/D [1413 0 R /XYZ 90 136.991 null]
+>> endobj
+1412 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F11 395 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1429 0 obj <<
+/Length 1808      
+/Filter /FlateDecode
+>>
+stream
+x��YKs�6��W�Vr����[����$������-��
!�8��]<H�%�6��I�
�~�q0
p�v�����T� F��2��	b
(
#!��4�
	FTDc�1�I�H�֫��6���U6�Γ�>R8Dg�18|�%Eᆟӛ4����$ZJ
r}�x7zs1�>"`��)���d1����)L�
0b���E�)��,8�5��|c���f
gA�8_>m�#f�	�Gu�!]\��v|�YN��jYX�j����T6cD$�L�"�R8�_)�w�k������(�

���2�8�Q&�|z���h�Y������I�6��d��&�_���e>_�\�
� {
�<�`���`c(���ps�
~�fR�@?!!r�Z�s�b��oF��
���i�̳t��:-&�|םN81D�#�YG��h�l
++����w���Lq,�7F2QHRo��m�NW�,��٩�U���Ҽ��]D@��3K�i���Q7�jQ��V²le�����+�4K_����@�
+��
�w�jپ
�����vK+l��{r~7e��W���P�2$��S�J҆
D�>B�,!|�� ,C�4��)�}�� �)�)m��ۢ��#)<��+~�!��I�[z;��1�N��9m���P�
U�9;�zS��9���yn0���ҟGm����K\���S7��̽�C�f�]������Z�y�dE�V�L�
<���t����d����l���*O�W&M󢄣m�^e�rv`��r�F\ư�O��l�},E5�<E3'�K9���};t�9�.7aM��?��k�)�SejX�g�X�
���Q6�����>�·�u�����T觜[��Hݸ>�a��`)r
,�(R���X�;�
e
+V(+�U}�_�B�
�^��Q�C���Ȥ��1

�a
�qJ����0l���
j:9��l)(�p�v$
�ؕ-mP|`W

��H#q"��
M�ƀ
f�>-m�
o�X;�w��1�81f`/�'B�o�*M�d鲧�P�p@�H>�#�NĴ��8�G��rC�EO<���r�1��m݆s���b6�N�alҳ��W�[�b�>�C*jT?�u§�[G!|��c�Ǡ��=_'#�����' ��:ϡm���A�G��]:��v�*�P�*Pd�(������{H����=˺�>��G��� �����f%��4�=	���~��O�C�{ �p,_H�w!���J��"(�����FG�;�xA
�
<K�����⊜=�"���3��T��Q��eG�9�M>�ƍ���U6��� m@�\m1��$�� ��i?@�:,�Z��ög
Vp�`
�z�4�"��BG��y��iP�/gY�^��x
`�l����L�!3�D�dz��Ԩ&/1�ښ�?���
+m�k�K6�AQ�&�S��v��삏ٳ���XËbu��9�����[:;x�> Ч:�M&�!��sh��D.d<>c5�iO�>|��r�d�zZv�y4&�gx/&[�?
+�I��?_�ͅΦ<��2=
+�Ovz/��D���
����f
z_���sZn�#oH5R�СF�u��V��F��}�0�*1
��Օ����w��,>�|��K�5?䛢��/�U~AN)��}�3t�;q����kZbg�'��&���gK�jlϛT�"���}?$�M�E��8w����D ��iQ4�63<O�o���j�����[(�F��M�mY�_��\of�����ۗ�BX����U^WV0���AUk]�=&HJZ��;�&JQ��9�����ق�W�/�T�N�
+endstream
+endobj
+1428 0 obj <<
+/Type /Page
+/Contents 1429 0 R
+/Resources 1427 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1402 0 R
+/Annots [ 1410 0 R 1425 0 R 1426 0 R ]
+>> endobj
+1410 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.292 234.059 696.196]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception_aefc6c6941cd663b4715cc71e446d4fa0) >>
+>> endobj
+1425 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.928 457.19 238.512 468.093]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1IO_aedad05516ed695dabfa4fed118d41145) >>
+>> endobj
+1426 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1430 0 obj <<
+/D [1428 0 R /XYZ 89 770.89 null]
+>> endobj
+1431 0 obj <<
+/D [1428 0 R /XYZ 90 704.286 null]
+>> endobj
+1432 0 obj <<
+/D [1428 0 R /XYZ 90 704.286 null]
+>> endobj
+1433 0 obj <<
+/D [1428 0 R /XYZ 90 658.823 null]
+>> endobj
+744 0 obj <<
+/D [1428 0 R /XYZ 90 563.612 null]
+>> endobj
+162 0 obj <<
+/D [1428 0 R /XYZ 90 557.011 null]
+>> endobj
+1434 0 obj <<
+/D [1428 0 R /XYZ 90 476.099 null]
+>> endobj
+1435 0 obj <<
+/D [1428 0 R /XYZ 90 417.04 null]
+>> endobj
+1436 0 obj <<
+/D [1428 0 R /XYZ 90 360.173 null]
+>> endobj
+1437 0 obj <<
+/D [1428 0 R /XYZ 90 337.796 null]
+>> endobj
+1438 0 obj <<
+/D [1428 0 R /XYZ 90 337.796 null]
+>> endobj
+1439 0 obj <<
+/D [1428 0 R /XYZ 90 267.249 null]
+>> endobj
+745 0 obj <<
+/D [1428 0 R /XYZ 90 70.15 null]
+>> endobj
+1427 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+1446 0 obj <<
+/Length 1002      
+/Filter /FlateDecode
+>>
+stream
+x��VKs�6��W�V�@O���]'ql�dg4Il�P@*���$HJ�$�;�LOX���"����h|�
+q�3M�($H�K�����mz��`�p������t�y�P�M���#
+�����*@q6z�F��o�<
�ss(C�qXS�0�:"-����zi�
Q�C)Y�
>)�(��]�B�Md��
�>�A]}���-D
�@���X�>أl aS�.���Z/��(��,�Ȍˁ�4��ȸ^༸�t��W��a�<8S
c\*��
��D`�ϓN��0����TI��
c��!��Ҋ�z�*G�Ǻ���l|����cԪ���
�5�[k�ĉ�m�V��ص*�v#YY!m0.������2�D�V���"�<
+�`�Z����$Uk�~�WI�{���
�E�
x��)�[}w�9��&�
�'�͵���6��?��8�Π
h�'�䫻u�ͪ����z�$���
XQ��.A�w�d����2I�Ư�
z` P  }Ѱ��!eT`��%�s����BU�#|
1	�1l�
+�mc��U��M�!����Mr�Ϋ���K�u{nQ��L�UԖl-
ӚY'
��R@|v)q��c�sm��÷4E�]՝�4-j,�}ޞa����'Ì�"ћ��F.�
?�ͽ�u&9�N��T�B1

+u�1Q�RB��9q�ݜ�?I�#slPp̃3��*d�sctY��~M�xPc��Ec
kd]Ϥ��[�7�M��I����WU��fI�	��p�r�s��h��Vw�:�0������߁߁~؜ؗ����vc|�ItY@�
��
���RGKA��(;��2��CI�R�E��O��
�^)��<��
�GbC
�q�V�޺�����EԜ����[+��w�f�6�W�h�
��+m�Ms���G��/��N��>E�6J�~��9�M�wNxi at b�z.a�q
tGO��_����Oi��� ѽ��U�����U	���Yx���&>���\�
+���䰙E{/�
��!��o
+endstream
+endobj
+1445 0 obj <<
+/Type /Page
+/Contents 1446 0 R
+/Resources 1444 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1402 0 R
+/Group 1442 0 R
+/Annots [ 1440 0 R 1443 0 R ]
+>> endobj
+1441 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1451 0 R
+/BBox [0 0 408 386]
+/Group 1442 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1452 0 R>>
+>>
+/Length 1091
+/Filter /FlateDecode
+>>
+stream
+x��XKk$G
����?0ڒTOX�`��
�
�����7�L �C�~>UW�{
If��1f��.��K��ҟ�&��;��v��}�w��?&v���{s�����O���ߓw���mz��y��nb�~pM�;���w�Y�(�N��f�C��N�0����8;a��[�M���MJn�S�Zk��=ZoBq\���7;����?L��z�yV��̻��Yծa.G�cg
i,�yg�/�N�=���v�|<U~��+񟆲��p&1
��h���a�nb���혂���[^��ٟ�w��{�<�lW�&{{��
:X;�J
s뇂]s��c���n�����B�d!�tK�o���y��
W�����z��]�����#��"����T��:�#���j�Z-�<RN-w�R�8 h80�P��
��~Nr%�щG���>Y �q��@!�	��>�I�QD�
+
�n�@�������M�
S�$�� b.�ر
(Ț��6]$N�n.
�@

+f
VGTL
`��*���o�
+���2 6<�s�G����Zqw{5�B�H4īl���1���%�%a�B�@|I�
_���&��ؠ�Ȯ�X�J� ��I�H%���+$b�2۾5%�p�
`�
|���R�Ej ;�1���B�i�xDyY �r^1�$�l�� ^}KH��}c���ը)�bMPW,��5�( ��F|��b� ����k+c�� 'b5/<�l�
�5q5�'���ڪ'
+^�{.v
+R���B�� �T(

+��jc�_6�%
���ny���h�T��p��
���0�c���Ԉ�L�hK���zDͩO�%�9�V�
Q�EI�U�+m*a�ũ�ET �UkB�`m��T6T]��|םp�u���x.���C�.���
���r�M�QX�B�
�T)׼i�8֖�G;�!����uێYGd(��,m�Ҏ!Z��ӴcK��	�N�i�8*�����i5�ގ��]>�$�6E:t2�QB��dc����B��^
�v��s�Ct]�;�>ןv�a��],i3L���Q�&0
+U��0���,�m��
~(��}����<� ap
+���$���j��.cN��$��L?N� c���
+endstream
+endobj
+1451 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1452 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /GHWCWK+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1453 0 R]
+/ToUnicode 1454 0 R
+>>
+endobj
+1453 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /GHWCWK+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1455 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 652 500 278 722 495 667 556 611 722 833 667]]
+>>
+endobj
+1454 0 obj
+<<
+/Length 1456 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0��<���!�����¡?j� {�"cr��k<�T*H�c�؛�����H���.�3X�i�n^���:�D�Bja�_5v.I����
��5SR�"���U����C"�H߼&?ث�}�/�u�9�C#�EdI�M&,�ҹ�n$�F��A�ul��#�G�hIM�f�)�RRg�iDm��$d�?���ި���rʳ�ʚHy��
�����J:Bc�@
+�UN��GP*A=� )�4�{�H9�L���
��$��A"_��%�;���`��>c�|L�W�O�|�	>��D��}�Wq/�W��J֐��YK�+��J����&�>9��}�8�qZ�9,�'�Mns��E��_
+endstream
+endobj
+1455 0 obj
+<<
+/Type /FontDescriptor
+/FontName /GHWCWK+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1457 0 R
+>>
+endobj
+1456 0 obj
+357
+endobj
+1457 0 obj
+<<
+/Length 1458 0 R
+/Filter /FlateDecode
+/Length1 2880
+>>
+stream
+x�}V{lS�?����Ib�k�w
ǎ� 1�~�$�8��`�Ć8��<!%
+���JJ)t�&U�&����J���QVФ	m��CbjW��C�i���~�:*M�uι߹�����}�{%�$�:ˆ}`�o�:�~HHR
vgw�������<?MH��C}���~r��=�06To0
���.
�ؽ�P{	I�=7>5�G��j@�}d�o�4}������ǙQB� [ 
+�@D�Ik1iMQ�����U��X��5��
���ERI!F�(�E�A�EZ]�Zo
n���T�����~}(T�ƾl�y�ȁ�A�6����SS�=�8
:Kb7�:�����P�

Z�E|r9k<�t
uZ���ý��*���r���$��V���u'�d�V���.\c]WYU�
+��C-5n��͍��b�>�b
D��֜��d�J��i��Vۥ�7��h�5�Ce�P���M+��RAk���Tt�7�
+l)}����0��jQ�F8� 2&x���'��
��1P���+�lp6�E�rqC|b����PYak����8<��҅���n�B�>vq"*��b��o�:
q

c7��� ֥�X���Gq��
��>0;�
+5�7���������󁉋��&�.J|�_���`�+���;}�J?C���<�.�~=U�:z��FqO^F�637%�W�ǘf����V�1;�R�alj~	]:�q��Xї��ᰥ�rcg��y�}!�s� ��^��v˾ڐ3��I!��
<b*�
�
�Ae�C;��,�*
�0Gҿ�59��Dˮ
A��VY�����odK�<eg[�<eL����	<o��4�K�f����~�V��z����=�o��q�K�Hď��x�ה�9z��&�&ݛ޺mjrk���C��˵���f���0��x�i�����w���ɵ���JM0?^k�#�{�

�n�B.��a���-�
~���^y��(ᮽG�y\���
���C8P�Y*n�I0iF��j81ӎ�x���us���l6o����r��F�cz��t�����]�?M)��~��
������ }�n|���o��vj1- ��Ou��N!="-|��������
�z��%�B�ŋ\� ��6·\���SD
	a�M��h.���O��{��������Өb�XS.���O
|�>W�Ym�)H�j�;"�Hia�Y������X��7�<u�Z��\N��y����\a�ڛf6�*ݞ��1�n��W�k���i���AG�h��V0����hhT�\
��ʺW/����@�`{�ÿK�'�%��†��+�}�pc��ʸJ�\5�Jn�la����������uV�W���U�)~
+
W�x̛�Ҋ�B�I�s�A��I��;ppt��橞��
��
�?x�\\_j���9ޑt�Y+���KvA�-������5Φ�0���3�:ecB����<)�A'��ȝ�q�mr���x|Ki'�8���_x������y������'_8~rGz
8Zd
�xK��>��cK+���&�˹0�\��9j��YA��z���KU��E���etKeВv��
�;{�FiOGK���B˦4[�Noqk��B����ՙ%�ư�n9:�䞱���Sb_�F�ې�v]y�
+�g[�*��̋c�E
��vP��妅��Z�^o���6nE�z��fgY�KOI/�R��\
�b�d�y�Z&��w�a5����l{;x6�ߣ��u
+��o��l�g��wm��N!��Ç��H[[�����5d5�>��Yrnӫ��
���(X|
��(ۏ�� �)2�<5��\�>7(=���x��ș"'1�	T^�DI��F�?v���b�I,�?\2����k���W���y"I�w46�@�MC�i�K:���Q$߅lT.�#q�4��w�;���j��W\����ז�o��JU��� ɲ
�_IWI���o�X�R�Z���g�(+#n� ~��4���MЅ�3���
��#6�L��s~j 
XC򻳤
|Z��gbg'�J<�'t'�MV��^/ ���b/w�[��I9|��71> �!E�8�/�
ϊS�3?V��)Q�JȨp�S�Y

Ը{�q/U�
0�	�r#��=�?�w^�|�6$O=&�IK &���j
+endstream
+endobj
+1458 0 obj
+2130
+endobj
+1442 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 612.732 215.509 623.636]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception_a84966c712051f47e1dcee5490d5ca670) >>
+>> endobj
+1443 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1447 0 obj <<
+/D [1445 0 R /XYZ 89 770.89 null]
+>> endobj
+166 0 obj <<
+/D [1445 0 R /XYZ 90 721.073 null]
+>> endobj
+1448 0 obj <<
+/D [1445 0 R /XYZ 90 630.88 null]
+>> endobj
+1449 0 obj <<
+/D [1445 0 R /XYZ 90 630.88 null]
+>> endobj
+1450 0 obj <<
+/D [1445 0 R /XYZ 90 587.872 null]
+>> endobj
+746 0 obj <<
+/D [1445 0 R /XYZ 90 499.432 null]
+>> endobj
+170 0 obj <<
+/D [1445 0 R /XYZ 90 490.208 null]
+>> endobj
+1444 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F72 334 0 R >>
+/XObject << /Im5 1441 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+1487 0 obj <<
+/Length 1518      
+/Filter /FlateDecode
+>>
+stream
+x��YKs�6��W�Vr��� ���8�$MfR��%�h 
+�������] %QO���
���o����Λ�o���+��E�r�v�D�A��o3�K0��7&cw)�LN�Ez�f���ɴ��'���'��������#���*)�ɫBͿ`L�D�7�
��RYUfy�����c�9����������
�C�N
�Љ���ؙ��wF~:?�M�P>S�f��[�@w�����c	A�[?6SO�i�z4t?�l
+���&�k��j����ϋ+��!�(�Cg�S$,�_(e�W�e�šx�f�|
3 y
H���4�U�ml���`������eE܃
���0pB0��lJ�3�EX��Uݔ��w}��^�vQ̵���������Z	�]R�M����-�6�|�Ca�G���
R?��ц������
+,�!	�ͫӺ�q��r-?��Y2�7Z_l_؋���F��S<}���G��DO3�8����u����n��Q�Hv����7X>`n1k���C
+���M�q��H�	��0�a���&�\9ɒ�����_�\yvR�C�b($G/"A��
+1�/B
��*��:����i ��]C���X��0oz"m�7k�Q��JISdk�a4��[0��`��k�?<�\{�M]&��0����d2k��ӃeC�=�,���u�f�k�ת�ej��:��䎅3��8c<] F�����.���]OG6Z+s�#1�&48cz"epق?
�iQ�J�1N��?�,�2Ʒ��΁|�AU6�h
L��]�W��SK-�.w��?(�v[�� Q�{
� �O-�9FcO�R����"+*WESM�:�j"Ku~O�g�tg� �h{=�]�1v�
��C�j� d��
)�
+⣐?8Z6��AK>���m�#zm!�c�KU�$mSt旪��dY
�A,b�,�r�=_�J�w}qѪ��"����Rbu��j
߈�Dόk`���
�
o�@N���ĕ9H���l��w���H��T�����h���>/�̬�I�{HH{�[HV6L��!-���Ê�����n#29��<\��ֈ��2.�V)ho���Tqж�~j��;�w3��۾�.�&�L�PKul�X*�WC���1���)��}�e#b�h�E���}��=���z�ͼ��~�|�M����ϑ�8� Hmb1�
+��gR�=H$����lj>b�����pM��(� + �	��"�K������
��,�SX�&v�|3��ơ{�q�Mew("|�gRDph���"j�8܇$�~��}?��;��p�
Y��:��x���ު�#�$zbⰅ��n\��Q
��f!5
s��O
�8�-�/pK̠�)��{|���,ޭ_@�n�|�ȅ��V7d�:��ާJ��x���K>ȼ�:6]`�:�\aB�B]x!o샬�y����ӭ~����k 
#B�v㮮�/..��2��E�����B �*�z~̊Ru��i@�N

���0A
�

 ��;�&B�v�����{�>�x���e~Y�c�_�2/�
+endstream
+endobj
+1486 0 obj <<
+/Type /Page
+/Contents 1487 0 R
+/Resources 1485 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1402 0 R
+/Annots [ 1459 0 R 1460 0 R 1461 0 R 1462 0 R 1463 0 R 1464 0 R 1465 0 R 1466 0 R 1467 0 R 1468 0 R 1469 0 R 1470 0 R 1471 0 R 1472 0 R 1473 0 R 1474 0 R 1475 0 R 1476 0 R 1477 0 R 1500 0 R 1478 0 R 1479 0 R 1480 0 R 1481 0 R 1484 0 R ]
+>> endobj
+1459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 675.197 191.16 686.1]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 675.197 210.258 686.1]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_a0c6bf4c112511ed41878554ca3c02977) >>
+>> endobj
+1461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.074 675.197 291.323 686.1]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 633.376 191.16 644.28]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 633.376 225.192 644.28]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_aa4c34f9b1017a3b44afaa423b832722a) >>
+>> endobj
+1464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.007 633.376 306.257 644.28]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 591.556 191.16 602.46]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 591.556 215.239 602.46]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_a2cbe4b9477e2eed6411787d14c306af5) >>
+>> endobj
+1467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [219.055 591.556 265.072 602.46]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 549.735 191.16 560.639]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 549.735 245.675 560.639]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_aedb7a64c3a6bdff1793482110849e5d9) >>
+>> endobj
+1470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.384 507.915 224.634 518.819]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.132 507.915 248.703 518.819]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_ac622b43c176dfe1b92260b841192b305) >>
+>> endobj
+1472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 466.094 215.13 476.998]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_a3a962a357f4260b224518672b80ccdc6) >>
+>> endobj
+1473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 424.274 201.302 435.178]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_af6431ecb966a6e38dc55e7f4274b31db) >>
+>> endobj
+1474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.383 382.827 205.147 393.358]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_ab9e90a38fb859d1dbe667efec83743d0) >>
+>> endobj
+1475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.383 340.633 313.052 351.537]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression_ad7fba193bb811d3dd21903c3fb5e2428) >>
+>> endobj
+1476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.08 225.76 257.33 236.664]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 225.76 513.996 236.664]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
+>> endobj
+1500 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 213.805 173.446 224.709]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
+>> endobj
+1478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.957 213.805 302.212 224.709]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
+>> endobj
+1479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.723 213.805 405.225 224.709]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
+>> endobj
+1480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.735 213.805 532.307 224.709]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
+>> endobj
+1481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 201.85 226.577 212.753]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
+>> endobj
+1484 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1488 0 obj <<
+/D [1486 0 R /XYZ 89 770.89 null]
+>> endobj
+1489 0 obj <<
+/D [1486 0 R /XYZ 90 701.153 null]
+>> endobj
+1490 0 obj <<
+/D [1486 0 R /XYZ 90 701.153 null]
+>> endobj
+1491 0 obj <<
+/D [1486 0 R /XYZ 90 657.598 null]
+>> endobj
+1492 0 obj <<
+/D [1486 0 R /XYZ 90 615.778 null]
+>> endobj
+1493 0 obj <<
+/D [1486 0 R /XYZ 90 573.958 null]
+>> endobj
+1494 0 obj <<
+/D [1486 0 R /XYZ 90 532.137 null]
+>> endobj
+1495 0 obj <<
+/D [1486 0 R /XYZ 90 490.317 null]
+>> endobj
+1496 0 obj <<
+/D [1486 0 R /XYZ 90 448.496 null]
+>> endobj
+1497 0 obj <<
+/D [1486 0 R /XYZ 90 406.676 null]
+>> endobj
+1498 0 obj <<
+/D [1486 0 R /XYZ 90 364.855 null]
+>> endobj
+1499 0 obj <<
+/D [1486 0 R /XYZ 90 289.81 null]
+>> endobj
+747 0 obj <<
+/D [1486 0 R /XYZ 90 137.732 null]
+>> endobj
+174 0 obj <<
+/D [1486 0 R /XYZ 90 122.429 null]
+>> endobj
+1485 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F102 1181 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+1514 0 obj <<
+/Length 1121      
+/Filter /FlateDecode
+>>
+stream
+xڽWKw�8��Wh7�����]��I&m3��Jzr0�
:\�����p�=�B���/Z"��F���i at P�#��h�@A�a���
�:^�~�^ F>\�w�>��|���o�������'���/p�d5��J�
�/�<
+�c}h�<�ᙡ��?#�5��B)���<��J�8O�;f�8�4^�xe^�2�u�V���Ȟ
�\��Y:S�zr}���4���?��V�,�"�?*��e¹#�%�̫w�K�Q�'��8JC�#Α �Bhw���"��':��Ss�nL�W>:. �-3���q�^7��
U5Z!��	�}�
\W��8Y� ,,t>��L*�>��Iޗ��:`����!� ���
cbpW[������s��
+�{��&�b�w;���
����C!8�{�A�yL�l���I�yi��z��V̾ɤ2�P��#�u���|i��7��O��b ,��Ӱo��4�]�(�4dM�%�H�p���
�<
P8f
Ōx࣏		���x?{�Bi'������kYmT^�ó�6$�-W����a"��Ӭ�ˈ�9�c�P�4���N��('Y�˷����9--D��5(Lc
a����Z~�!�����sS��W�Jgz{S���2�.����`�x���J����P8
+}�
S
�*N���cY&*]�q(-��yF����۰7{3�Ĝ���� �d�je4��'�΋��:q�jh�
�Vh�v��R�e_�2�*6��3�QdY��yl�іe�?=l#4���'@__�X��Co����)��
7��EZ�#Kp=*�pT�5��p��Cs
�"
�I��I:&P�QV�b� ��K�c�]�� �^��A%f\�՛��
�Nw(|Ǝ�C�};G�߷cK��n�	���9�0�
+����C����!��l6��Zv>
�+�l��;Y��J�j���:㊗�C�o��?
��Z��?��E/�"
+���� `vh߮�L����
䍷���8$�N$FX����եY\t��޹���&^ڃ�y%բ�S
�_J��r�pl���8s���Cc)ն��� � �c�ndðq���ۿ��!�.����L�U�~7��6KhPK�@��	��� z�O��m1^���氹�
����샻
+endstream
+endobj
+1513 0 obj <<
+/Type /Page
+/Contents 1514 0 R
+/Resources 1512 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1402 0 R
+/Group 1483 0 R
+/Annots [ 1501 0 R 1502 0 R 1503 0 R 1504 0 R 1505 0 R 1506 0 R 1507 0 R 1508 0 R 1511 0 R ]
+>> endobj
+1482 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Coefficient__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1523 0 R
+/BBox [0 0 232 192]
+/Group 1483 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1524 0 R>>
+>>
+/Length 416
+/Filter /FlateDecode
+>>
+stream
+x��T�J1��+�6��$�$���u�C顶V�V�
�}g�d�nA=�,�3�y�&�y�]����4�����<�g�,�?���?�
+��W5�j��"�`&�`
�q��ǹ
����*��Flal�)懻YK�f�}&jg��b�1�q��WQ�=w�а�:
�VM�
6���k5�@DJ�Ķ��V
��kS8���]M��H����H,�E�<���X
	.+٪$�*j@�9q�Ҽ�siH[���l��QH	��:#-�!J�ۖ&J��cd� S �S�
h�[�Y����8�9N��vc�ň�|
��?�vЏ� ���q�
+'
�U9�~#"�L��*"�
'ßS9u��b@�9x�
u��bCh�G�,��8���	>��k
-,��{F�׏
[�JO_z�W�;�GYQ�?U��
�"&

+endstream
+endobj
+1523 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1524 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /TLTMMM+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1525 0 R]
+/ToUnicode 1526 0 R
+>>
+endobj
+1525 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /TLTMMM+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1527 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 652 500 278]]
+>>
+endobj
+1526 0 obj
+<<
+/Length 1528 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mn�0���b��"	!U�ET��=N���
Yp�?+�j	��o��7���<7fX(}w�ly!=�x�nN2�|
L"rR�\"��
;��>�]����)�*J?�8/n�ݓ�z~H�(}s��`������jo����f�,�kR��q/�}�F�4$���aY�>�/�s�Ly`�+�I�l;ɮ3WN�̯�*�W��Q�����^��΅p�ó���@y�� 
���

5�-R	��G�r��=�:�ԃ
+��<�w�@9�t��D�Hh�
+T�W���� �+"m�t�E��"�_Y��^n��^�}���bx>az����f'�e�����H
+endstream
+endobj
+1527 0 obj
+<<
+/Type /FontDescriptor
+/FontName /TLTMMM+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1529 0 R
+>>
+endobj
+1528 0 obj
+325
+endobj
+1529 0 obj
+<<
+/Length 1530 0 R
+/Filter /FlateDecode
+/Length1 2248
+>>
+stream
+x�UVil��y<t���^.��6Q�Msy(�,�IY)ZdmI�)і�$Ncّ�:R��Ċs8? HP�z$-
+�E��Fb�(
+js m�Fnaǀ]�	���d�$�1��}3�ͼ�
 E�

<'��e��)*H�������1�h���jn:;���Gw���
�H�{�iI�5��\���O�/���'�Nf
&L�g��
+I~��ds�M�
А r6����F�Q���5��U��Ӻ@��
�ʠ�ʉB@�Z��a��x��l����w,�V�Mg�_�I&{"��_��ÙמY���n����[Z�,�q�l,l2+a6��W 9��
+�ꪗ;���(؅���r��E�7��4fKX�av����aq7�ҙ��%�����ƹϵ�=ԩKEG+�:x�{�1��v���
O�Y]����R�N_Ueq�[<�o�3F��%�
��.L>=Bc
+��B�B�k�p:��;{��
��dƉQC{b�W��FQl��;��[q��I,n�e������b�xP�q��1��
쓞�Yo0�����H�n���p��:��g=[�y�*���&Jd�Z���)`}�4�Z=�����K&c�Cìz��o]^���x�Z>,�(c!�u�R��ׯ�� Y~f.��f	�FN�_�?���g�72{*���݆�?
{���[xdPo�I�2)*O�9a�4��E�v�—z��T�`��X
+烞lR��mH����{��J�n��X�P
Pg�XɃ�X�J��c��lr���PZ��Ԍ#m���Ⅷ��*��0����̓�����ud�t��6<vD峊��M~�C5y�9�
+��G�VNCn�g���}80w��̂��H:
������kz���+��\��|����������;gMf7(8�/�R�����xcvV��
�N9k��=8j��᳖zt6w��|��g�a�F�������/�1ދ7
:krh�CNΫl��
�d}�

+dK'{dl��1'uP+#�Us�O⛿_ۖ��fǡ��x*��NP�AO",����v9w���	�@��&�»���{�_i
+��C_�����O��
�1Z������kDkPD�ϲO?;�N��e��;ׯ���5y�������v�JN�"e�
+¡�j���ݨ�xV�{]M����??�����UL&bO��@�-�RWk/�-�]�G��t���a��(���K��-��\���KCU�hE�N]Ef��j<��oe�Vӄ)sd�܅��$7i��
>������ܰ�V"��owzN�TL�N*ػ����H�<��(���~Q-DA}��ER��Ѝ���J*
��|ih%
*
F�1kG���]��Ԯ��X�]��4jԘ���������>Z��s����'��B�x93�z~�h
�;�N
�[��_?��	���	�*�H���,�^�+!��t���,������K1cDz���Ɗ��x)��
���9:먌>��;
��ʚ/���P(���B!e�P|��k���tފ���G�f/��m�J�EUm&-`GMo���k���
3h�����m�_wƯ��t��U$ÎM�5_H�q��_?�����?�U�_�(k� �F�CT�k.�$�	�@�7�*�����GhL*�^�qZ�Q��?��]�]4�Ckʶ�����{
�
��#I&`
�~Dޚ��\sY�\���
+��Zڣ�7���z�S?*{(QU�{0OP�L�K�I(�� �O�o
+endstream
+endobj
+1530 0 obj
+1705
+endobj
+1483 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1501 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 422.373 240.166 433.277]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ae2a6394e34e787c14484f3d411e022ff) >>
+>> endobj
+1502 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.981 422.373 289.998 433.277]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1503 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 388.365 159.927 399.269]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1504 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 388.365 199.867 399.269]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ad6ca74b77c4e7c632ddfdc6ab8f3567a) >>
+>> endobj
+1505 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 354.358 240.166 365.262]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) >>
+>> endobj
+1506 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.664 354.358 264.235 365.262]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a1109f21e2d8d35f3dae8ddc8074dd7cc) >>
+>> endobj
+1507 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 272.248 159.927 281.095]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1508 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 272.248 182.632 281.095]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a733941c541eb74a6c925db946b39e46e) >>
+>> endobj
+1511 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1515 0 obj <<
+/D [1513 0 R /XYZ 89 770.89 null]
+>> endobj
+1516 0 obj <<
+/D [1513 0 R /XYZ 90 444.422 null]
+>> endobj
+1517 0 obj <<
+/D [1513 0 R /XYZ 90 444.422 null]
+>> endobj
+1518 0 obj <<
+/D [1513 0 R /XYZ 90 408.681 null]
+>> endobj
+1519 0 obj <<
+/D [1513 0 R /XYZ 90 374.673 null]
+>> endobj
+1520 0 obj <<
+/D [1513 0 R /XYZ 90 292.241 null]
+>> endobj
+1521 0 obj <<
+/D [1513 0 R /XYZ 90 292.241 null]
+>> endobj
+1522 0 obj <<
+/D [1513 0 R /XYZ 90 232.064 null]
+>> endobj
+748 0 obj <<
+/D [1513 0 R /XYZ 90 131.091 null]
+>> endobj
+178 0 obj <<
+/D [1513 0 R /XYZ 90 120.671 null]
+>> endobj
+1512 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im6 1482 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+1549 0 obj <<
+/Length 1226      
+/Filter /FlateDecode
+>>
+stream
+x��XMs�6��W�Vr���ADnM
{�&3�힜�� �)E* ���
��IJrT�u/=q��ݷ�������������L`O"�Ȼ]x{"��G�k���#��1��e�j���Ǖ�5I��Q�1�G�L+3��1�}]I�Mn��`L9�MUQ8�Z/�ۓ�t0�4��P_n/GnG�F,�
q�p$bo�
�}��
�/=�G��}�i텔�3�nF��pשh�!���E��&)U�ߚ4O�Ҩ��En�p�݈�ܭ]=M�>�f�zW��X4|����$��d
�!
+qh]�6�H��q��+W6/�
'k���� QnE�8o_ת�
]T1�CF��Au���O�@Bc��^O�q��6���y���AH�B{c����ϔ����L���>yw`,�v�x��3�^�=u��}G<�|����yC���Ћ�(�Q���B�8�M8��o�t^����3�~ճ���JՒ	����=
+��E��M�9[zvK���b�q�o
��'g�t��1Œ��enK��"J�
*��9��$i�<�9�#7��
n��c%b c�F��ԏ_��zQNV�ܤH��E1��
׺ܚl>��IV��*
� ��C��6 �*)��M�։<q
+D{c�M�\���ka�
u

�,ͳ�
�u�g at MIQ�Ի�7טI��a���6��y	|������,M2���R�7ב,�*���@�����*�
���d8��0Gd8=2�#��oM*o�pE^b���%$�l}���Pѭ��D���Ou���)�S]�L�)����4���d�ʼ�3}x���$�"�dm+�
��z����"
j�g�5�:�2�߻W����N
�VU�X�L���i�� v�<Ms��}�-���0M��Cp$q| ���c�UR�.�C1�QFr�/W>N9
Q
����mw�"<D9\X=7b1�c�Y��б�D`
p#��&��Ʀ�ߍN��)����U�S�)�}�nX
Ʊ�
��"t��d��
��2`��r�0�i�*�d a�(������A��F�=��N�
���wь�/*��(��#���G��ͨoq�*��W��
����G'\v
��q*[nղ�x���,*�hh�B�����:>�l�Ҡ퀾[�)Z"�����P0fp֍n�v������/0����@†�We�ywr2�.a�[���NО^�
�Z:\��%�`q]Q&j���C�Dm ��E`"��E<��E�᷈� RnV
+endstream
+endobj
+1548 0 obj <<
+/Type /Page
+/Contents 1549 0 R
+/Resources 1547 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1560 0 R
+/Group 1510 0 R
+/Annots [ 1531 0 R 1532 0 R 1533 0 R 1534 0 R 1535 0 R 1536 0 R 1537 0 R 1538 0 R 1539 0 R 1540 0 R 1541 0 R 1542 0 R 1543 0 R 1546 0 R ]
+>> endobj
+1509 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Difference__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1561 0 R
+/BBox [0 0 230 192]
+/Group 1510 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1562 0 R>>
+>>
+/Length 416
+/Filter /FlateDecode
+>>
+stream
+x��TMK1��W��tf�l�

+"
����/�V�
���l��v
�QdٝI��d�we 'o��j����M�s��d������|*�[~_�l�V���=d�
Pt��k;xQ5U���X�8�(v�YK���}G4H�"�Ì�2^?mU�1F��2�l��B�W�M��iڍ�]!"%C�TY+�I�H�)�ͻ
,
�R�
+C��Ffb�,
+�yL~��IpY�V�p��L���d���"m���\
϶�
��p��
Ҽ
��x�uQrl
"
�
�"���^7�+�

�d���.d25Ee�
��=Y�w����M'n�p��ѓ=�7rȄ�!��q1�i+���(��)�
���+n,��

7XF�q�˂�&�.�^c�a	��3��~T���5}�$:��wUq�?U��
%�
+endstream
+endobj
+1561 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1562 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /AQGUWR+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1563 0 R]
+/ToUnicode 1564 0 R
+>>
+endobj
+1563 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /AQGUWR+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1565 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 495 500]]
+>>
+endobj
+1564 0 obj
+<<
+/Length 1566 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0E�|�,�Ev�KBHU�aчJ�`��b,C�}�/J�Z����xf�^���v�~P5Od:�=���+����M�$ݩi��W}�4��y��������3���g�<�姄��w��w�J��K������l'ʒ�$�&
�ڸ��gJ�y[�wӼ
�����1��WR���5�}c��YX%&�2a���R��uk|
!<ˎYIF:����4hio@h+
A
+t�)g��	Ԁ����h�i�z�$d"��'2DB�/G����.��v ԗ#�X�3m�����]l�ڽ���[x�Nݽc�&�k�Tg����W�~�>��
+endstream
+endobj
+1565 0 obj
+<<
+/Type /FontDescriptor
+/FontName /AQGUWR+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1567 0 R
+>>
+endobj
+1566 0 obj
+324
+endobj
+1567 0 obj
+<<
+/Length 1568 0 R
+/Filter /FlateDecode
+/Length1 2120
+>>
+stream
+x�UUilSG�YI�	6���8�q
����#�8�M��؅$@��C�-G(�*P%TP���CE�P��@-��T�ڔ�R�R�	*���{v8l��ξ���]@ H�j`P��/2<��?����ؖ�60��Nk��H׿�IAGk�(-�>f
+��I�F�6n.A�i�c$/�
�� 4��|��}�̓x�	 �v�g��6 ��FAA1�����,zKӊ
�[<�F���Y�s�mLò 
2 �z�s
gT��zC��h
n���TĢ[���T�]
�ԅC���-��v
i��'g�;�9ٜ���d� � ٠�(8<
Y��K�圗♇U�����]��
+�ɫ��*NK�M�U��ey�&�P<�2�:�VUV^�
+��2�4V�q��
~�j���g��m9�))��*uf��f/.�o�թ�i��E >"^�i2�t��<�:���p8`��k8��׊�vE�� 
?%�t,�Er�DL��
�� ��)ʫw6����B}�0mcɬ`��i���8<���	N���Ń�&���*��b5�'�
����]��$�hk�,6����.�[?��phx�
�}�ZX�țo
�ԑ@����e�~�B
ѣr?���>�Z�d�1n�[L
�{((�һ$��Q!pw�݂�Y��隙_��e���Mjsv���QH��ɖ��3\�Vx����9�k*[�
�^Oi$(��FſK�5�F9W;�
R�F�ȳ���GHG9a�c6�,R�d��8�Y��n>�{��Ǯ�����m���z��^׳x���՞"��/I�Ix�Q�S �"��.ټ�I��z��
ձ�����ۺc��uᰏz^��7��=CG�����e�K;�n
Y?<q�$t=
�:

+Q��1���7娡}�Y3��G��_<k��=�ͯG{+����+!�Ň��|����p���. at T����B�~�z�
r�K%Ed�,��+(�-�����_���Yo�^�f~Q�ŽP�����h�6{ō�[R&Վ�;����!}N�o�(w?���]�.|B�Z��qꉌR��~4��)�A!�=Z���ڳ��W
w�/_F
���N.��
+�h�ܦc���T1j^�h���1��V��穵6/o��v�)����B�ٿi���Oq^N�$��v^Òp \h������*Q�v"�)��$Н�0��|~�o!�c�����w�Tlp0v��� ���z`��r~S�\g7 �8�����.�b�����$�7��{���
���&9�։exIu�e�U>t�Np��
��&a2�~6�ɮM
ف		�V;�;^.�:��;�}��>\�X�|���ޑ�;O�Hd���P�NP��D���S<N�q�r�w��L�f9oI_I]�&�R!��*
h�M�S���O�3��e���Mg�|]�bJ�c�Qܑ�\�c��	�t�X����$1&�U���ͧ��U����fv�X�i�� �^��=��p
��iNk`��Ik5�~4��A��q�}z��'h�1�J�I��[�
t��I?|$�60z��������%i�ʕ4�S����WQE�W�����٘�,t�&ʚ�rZ2�TP�t-��
+endstream
+endobj
+1568 0 obj
+1591
+endobj
+1510 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 435.267 238.482 446.171]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_af36458b7b549f4494a2554972244867b) >>
+>> endobj
+1532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.298 435.267 319.547 446.171]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [330.008 435.267 407.258 446.171]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 406.744 191.16 417.648]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 406.744 252.31 417.648]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) >>
+>> endobj
+1536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 378.222 191.16 389.126]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 378.222 257.849 389.126]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_aaaeb914f871ccb4e97fc4fd513364b94) >>
+>> endobj
+1538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 349.699 238.482 360.603]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference) >>
+>> endobj
+1539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.98 349.699 262.551 360.603]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2a702d0e6013ee746e60e4b3c53abfb9) >>
+>> endobj
+1540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 278.421 191.16 289.325]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 278.421 205.277 289.325]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_aa575e8597c316031b6de799f6b5e55bf) >>
+>> endobj
+1542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 249.898 191.16 260.802]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 249.898 205.825 260.802]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2e6d73507de036e41aa8e1cfc717835e) >>
+>> endobj
+1546 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1550 0 obj <<
+/D [1548 0 R /XYZ 89 770.89 null]
+>> endobj
+1551 0 obj <<
+/D [1548 0 R /XYZ 90 454.575 null]
+>> endobj
+1552 0 obj <<
+/D [1548 0 R /XYZ 90 454.575 null]
+>> endobj
+1553 0 obj <<
+/D [1548 0 R /XYZ 90 424.318 null]
+>> endobj
+1554 0 obj <<
+/D [1548 0 R /XYZ 90 395.795 null]
+>> endobj
+1555 0 obj <<
+/D [1548 0 R /XYZ 90 367.272 null]
+>> endobj
+1556 0 obj <<
+/D [1548 0 R /XYZ 90 297.728 null]
+>> endobj
+1557 0 obj <<
+/D [1548 0 R /XYZ 90 297.728 null]
+>> endobj
+1558 0 obj <<
+/D [1548 0 R /XYZ 90 267.471 null]
+>> endobj
+1559 0 obj <<
+/D [1548 0 R /XYZ 90 220.683 null]
+>> endobj
+749 0 obj <<
+/D [1548 0 R /XYZ 90 126.429 null]
+>> endobj
+182 0 obj <<
+/D [1548 0 R /XYZ 90 119.437 null]
+>> endobj
+1547 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im7 1509 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+1587 0 obj <<
+/Length 1245      
+/Filter /FlateDecode
+>>
+stream
+xڽX[w�8~���m᜵"	$�o��r�m��������X��rq4ɿ�l�n6�����E3`kia�j�v2:����SnMV�-�
��6��m��/����DB�����4��4��k����ۈ���9ϐXQ:����9|~oa䆁�PoJ-���L����#��
+�B"�ȼ�VRť�"�)��<K%R�ȕ!�B�b�Γ���+1M�����F�L
+5�x\+Yq�M��MmD���	Ƶ���(�Ű�<L���F��oXo٦���d���:
��
�ޘ�e�ԏ�����5�V#�}�<Ns�M5s|;�#���G�Τ2�e�E%X\�v�<���c�"B
�ϔ��Q��Z6�^��{��{A�
���S��	���v��c���A��IL�@r �����{J��'�����Vq2/L��<��W��.W������\�G!��hw4�\TM,��J����%P��2$[z�`q]�M�G�����8�����qa�����	C�:�6��1�@ *Q��w���'��r��E<��B�Y���	���T6t��k(-�q����0��<R��b�r���AN r껯
����_�yp
�Z�O�
"
�/	:���b��ʃ�GI�����=�qC\4�����4vp�G\�B�\�7�!��K��rn�?�R�3��*�O_P�W*/��h�pB,O���.�J
���)'Z6�?!�鉁�]���.��~V�
�
�S<��	84Y�Is�@��q���q��ʹ,"��!�b}#/
���b<8ޚ���fh�ӱs�Iv͕�N����Q�BG#j���x
TS�Dѐ�TѼ,e&�0�@�Ty:��"O�ܡ�~���Ӕ9L���7e�A�9T��^�U8bG���3I� �L���W���Z�����D�H���\�����`K�A9h%�o~S�a�q��
�+�bp#D�Kȧ@S��囩����G߅���9(���
JPO�
Y�<�"¡�F�
xa��0y��	~ o��4���d�wц�Ie2H����U;f��,~���2��ļΪ(�L���	�S��ℿuzT�䌉��fr��&g������7
��:�<
��E1m��ѻ��`���o�F�-+�l6^g�T��^�?
�)���a�n
+�G�U"q���F\�
��?�mr�.𺓭�9�v������-3��N�Mw��\�9;�UK�!�(����
�}�y7�uE9�UcK��Ǵ.�;>��
R�
+endstream
+endobj
+1586 0 obj <<
+/Type /Page
+/Contents 1587 0 R
+/Resources 1585 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1560 0 R
+/Group 1545 0 R
+/Annots [ 1569 0 R 1570 0 R 1571 0 R 1572 0 R 1573 0 R 1574 0 R 1575 0 R 1576 0 R 1577 0 R 1578 0 R 1579 0 R 1580 0 R 1581 0 R 1584 0 R ]
+>> endobj
+1544 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Sum__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1598 0 R
+/BBox [0 0 210 192]
+/Group 1545 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1599 0 R>>
+>>
+/Length 409
+/Filter /FlateDecode
+>>
+stream
+x��TMK�0��W�hv�I�$�j�ò�/�]����w�M��
�Q��3ɼy�I
yS�r<L��j��
�U�w���a���wW��P�<^�b	�֊n����d�=�w#�c{xV5W���X��rQ�>�f,1���
���0
3vi�?oU�1F��ei�� ����f�
++�nڭZ\ "%Cb�TY+�Iƈ�)|YwX���!Uu#+1C

�iJ~ƚIpU��9p�Q��g��-ߋ���oS[�q���m��܄��q�]�Ƌ�s-%��Y8�d��r�A
u3�"�*9c*�`�N.ۓ
+ǂ r�"�QV��#WD��~�
+2�_˂�cYp�Y���M�M�'��Y6�tO�V{4|�2��Ý�6�w��C
+���Q��cE>�\��D��u�a�M�su�>�6�
+endstream
+endobj
+1598 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1599 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /LOMWZP+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1600 0 R]
+/ToUnicode 1601 0 R
+>>
+endobj
+1600 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /LOMWZP+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1602 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 667 556]]
+>>
+endobj
+1601 0 obj
+<<
+/Length 1603 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mn�0���b��"����tâ?*��
�b,Cܾ��J�Z�����8��/�
�?�$^���<Ow+�:�:)�A.��_���bgn�y����%şN����YM
?ED�[�v�W�}_l5wc~xd�PU)��q��ykG�؛��r���{g���Z
S�Y�JrR<�V�m���2q���w��X�zl]/o���
'I�T�ROG:@KA4�=�=�-P��N9���N���:P���S�p��2���!�H	M��
�+�]�� ԗB}E����5t��cZ�n��"~B�l͏Wd&����

,��
+endstream
+endobj
+1602 0 obj
+<<
+/Type /FontDescriptor
+/FontName /LOMWZP+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1604 0 R
+>>
+endobj
+1603 0 obj
+316
+endobj
+1604 0 obj
+<<
+/Length 1605 0 R
+/Filter /FlateDecode
+/Length1 2072
+>>
+stream
+x�UUWlSg����$ƫ�񌳍�G�"v����&qBHp3pȄB	��R��*	P�}��*u�B�
+Z�E�[_�A%$(��!��\���	���q�=�;��K�G�%����$�衅��ݺet��/_�xGZJ"��'�?
��6�dH>�
d#m���*T�g��A:4:�&�f?�g��
OM�
�~�t6�
B�<a
�S�&�B�r�
��St~1��6��3j�2�FI
+!Z�vr6�Z%5�sJ�T��lN����Fv�

W����=5��o�Vk�C�'|�}��ą����It�6�
T�6s���`P��l.5Z5��a��sUB���4NisV@�H�qK��
+
K�$�ۺ)A��,|�<ݸ�\QRZ.	ԆR�ʝ����:�j.]�`�x��ZsFJrR�*�D���1[
+����y��dy��� ���1��x&�Za�T+��i�

��j�L
?Ѧ-�*�+�D�S��<C

f�$�6
�_y�����S���5�q
��ʛ�����z~
�\�u���C�މ��'z �D$j��z���l1
�����*�Fѥ����ڗu��m���'�g&����ڶV�6�֛�s?�
�86�
g����9)�Qb�'���f�TQ3\�r��'b�w0��A�)�P�BnoVJ�"5S��U�*_<2��Y�M�D>Bb8�-����.�b+8V�[�
L�%-]qY�~�/:�ߵ�x=�!W
�
`�*�A�I��b..��юV#ѱ��:~��C�`������5mKQ���
����w,5�
�瀞n�rP���3�g*�y�L"i����;�h_�a�/P�ߤounݳwh�q�&�Şgxծ�����6H�Mn���;�v=h���1t]j��x ��_|D�׆�c����
�YSr����6������������°m X�t��;�aw5\[1k at Xj�H�Օy����ѡ}IXD:�N�D�2Lbw;rc5��V��m�����V��
(�U�0����s�;`�������� Z�����ױ]}
>_|
� [...]
F�b�%AB�w�v<�K*Le"�
#�od��|>���K�S��'��p��%ݒ?�o_,��[��i��$D
�W
xI��M�hA��Fr���#��;�W*�<L
4�O���4�F9.=ޭ�s/ٷľ�� ��#���3B�4J:��K�R�
�Y1�b)ތ�=\�#�/�����.�������t<�o���
+endstream
+endobj
+1605 0 obj
+1562
+endobj
+1545 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1569 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 435.265 214.413 446.169]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a6d0d4f5a1f45dd0c5ccb2abe003bb041) >>
+>> endobj
+1570 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.228 435.265 295.478 446.169]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1571 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.939 435.265 383.188 446.169]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1572 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 406.742 191.16 417.646]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1573 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 406.742 252.31 417.646]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a75fb2490197b55a1474aff4ce0022598) >>
+>> endobj
+1574 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 378.22 191.16 389.124]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 378.22 257.849 389.124]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_acd2297a09c09cc44bf66eaafb90e0d7c) >>
+>> endobj
+1576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 349.697 214.413 360.601]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum) >>
+>> endobj
+1577 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.911 349.697 238.482 360.601]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a1af748b5b83815f826301969cee51712) >>
+>> endobj
+1578 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 278.419 191.16 289.323]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1579 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 278.419 205.277 289.323]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_a04d7bcdd3d8cd086fa28922403cbeb6e) >>
+>> endobj
+1580 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 249.897 191.16 260.801]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1581 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 249.897 205.825 260.801]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Sum_aaf17ce2383d125a60b8283addae73c7c) >>
+>> endobj
+1584 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1588 0 obj <<
+/D [1586 0 R /XYZ 89 770.89 null]
+>> endobj
+1589 0 obj <<
+/D [1586 0 R /XYZ 90 454.572 null]
+>> endobj
+1590 0 obj <<
+/D [1586 0 R /XYZ 90 454.572 null]
+>> endobj
+1591 0 obj <<
+/D [1586 0 R /XYZ 90 424.316 null]
+>> endobj
+1592 0 obj <<
+/D [1586 0 R /XYZ 90 395.793 null]
+>> endobj
+1593 0 obj <<
+/D [1586 0 R /XYZ 90 367.27 null]
+>> endobj
+1594 0 obj <<
+/D [1586 0 R /XYZ 90 297.727 null]
+>> endobj
+1595 0 obj <<
+/D [1586 0 R /XYZ 90 297.727 null]
+>> endobj
+1596 0 obj <<
+/D [1586 0 R /XYZ 90 267.47 null]
+>> endobj
+1597 0 obj <<
+/D [1586 0 R /XYZ 90 220.683 null]
+>> endobj
+750 0 obj <<
+/D [1586 0 R /XYZ 90 126.429 null]
+>> endobj
+186 0 obj <<
+/D [1586 0 R /XYZ 90 119.437 null]
+>> endobj
+1585 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im8 1544 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1628 0 obj <<
+/Length 1078      
+/Filter /FlateDecode
+>>
+stream
+x��X]s�8}�W�maf-K�[�4�dۙl��K���X&t�p$��
�v��4�>!�t�=�\]�� pf�YX�� �O|�X�@�1H}���6F���
#��
����íXI~�&K�� �Or��ͻ6���-�2)�
'�(���~��
^��03�H8����M��eqa�[X�,��C �x(
Be��V��PQ��7�2�W=S����BCh��c��<�2�x�_��Jx,yf^օ4�}�}:�vi�U�
f�T;��y��<�(� �Y2s�L���u��y��I��o�#H�
��Y�`f<���Bw̑�cHqhH���N`�I�� ��AdK!���ΣJa.w"�p�}�!�bט�L�,�aʸ�����*Zd�yd at M׊}F����b��f!%"�v��~�k�����1��L�2�
ܩ �
bB�����}�(q($>5̼��t����g��*�ʌ��ȓ<6/�m��I���	\:n`�u��p�D�Y�߅$ ��2�"�e$�O�x?Y���o�#�;�
'�/���a.�R
C����T�+Q�2/',5�Ց�um�]k7�S�V�^�O��^u��f�ص>iX7�0�إ*N��*�ql�f�p0�f��a [...]
+���ty�y��mJ��0�kMnS3�A�n=�b�J�\**%�X���몒�R�+���a/\y���G���K�;��b��b�����C_^��$υ<�4<59��
���Q�$��D��L6Ք��Hi�A��XY��A�n�1�Q�m��dCN���]� �d�誈��W�ž�kJa[Q������W�
�97�U��E6Qe]�i���o:�T�����q�'G�_ �W����
�h�s�	
Tk|d��u�>d�
+��HY8!���\
#1�o��5�ۉ�y%�a���*��͡�n����N_���Bn�W��8uM���U�>�����
���
2@@Q
�םi�U�y5�/�y
#%�T�.����}�d�췣��5i��.:�)���IG`��#
�m��=��;m���	MC
+endstream
+endobj
+1627 0 obj <<
+/Type /Page
+/Contents 1628 0 R
+/Resources 1626 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1560 0 R
+/Group 1583 0 R
+/Annots [ 1606 0 R 1607 0 R 1608 0 R 1609 0 R 1610 0 R 1611 0 R 1612 0 R 1613 0 R 1614 0 R 1615 0 R 1616 0 R 1617 0 R 1618 0 R 1619 0 R 1620 0 R 1621 0 R 1622 0 R 1623 0 R 1624 0 R 1625 0 R ]
+>> endobj
+1582 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Times__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1641 0 R
+/BBox [0 0 214 192]
+/Group 1583 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1642 0 R>>
+>>
+/Length 408
+/Filter /FlateDecode
+>>
+stream
+x��TMK1��W��tf�l�

+"
����/�V�
���l��v
�Qd��K�͛��we ����&8��	��<�-Lۏ<��קB���fs@��R�p�d
�!+�|
 ���E�T��6b
��M�{��E��l��wB�8#��Ê]�O[u��swY�'6 at c�ݫɦ�
+y7�Fͮ��!�u��`�1m
+g�.KAS>UR�0��nd%fʢP����Y�El�eA�9�4o�\*�V���qo���E	��u!�?�(5^b��(�6�E�L����P�7�+��"���������dȓ7j +	pԙ�
��q=�7q�	��CH;��𧍒O����D�
N�r������ڣ��Yt��Pp��A�5��������ǎF����D���p����Su�� �C
�
+endstream
+endobj
+1641 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1642 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /GLFYYR+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1643 0 R]
+/ToUnicode 1644 0 R
+>>
+endobj
+1643 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /GLFYYR+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1645 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 611]]
+>>
+endobj
+1644 0 obj
+<<
+/Length 1646 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mn�0��>�,�E&�4B��
���� {�"c���5~(�j	��o��3��R?׶�)y��jx&�[�yo^1u|��^�ſZ'�`n�i桶feI�G��/�{�c����7����J��K�����lgJEU�f�{i�k;0%Ѽ�u��y��_��☲�WR��ɵ�}k�,�4��JV%��z������.Cx���*R�(Ah(��AE�€��6:����Agh��T�:PR�ͧA�]8R� )G>�"�D}92H�wBv��w ��"���:��p��}>��}M|q&�4z��w�F����
�|��
+endstream
+endobj
+1645 0 obj
+<<
+/Type /FontDescriptor
+/FontName /GLFYYR+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1647 0 R
+>>
+endobj
+1646 0 obj
+313
+endobj
+1647 0 obj
+<<
+/Length 1648 0 R
+/Filter /FlateDecode
+/Length1 1892
+>>
+stream
+x�UUilW�y>�`�ص�&��8�E��G�E.�
8qb� 	&N�
+�p�Y��TAڟUQ��VU
��j� �҃V�J	E
T*���['@W��v�o���f� R����D��'� ��d�m�
��~���'[$6�����' �J�ycdP}�A=A�=62��ࢲ������� �KH@zd$�g
��HH_A1# ��͂�r Qo��Z��JkqP:�f�yM���y�aِ� f�(xE�I0�m�<���6�D���vxñ�}њ�u�`]C8����s��3m�#���山��q
+N��9f&�|pd@�Qt�Bu����N�Uc�
6�:���Va��h�Uߌ����L�|U��}s�&�P��2Ǿ�QUV^�
+�#�-�^��Ys�t3��I�u�k͎�����EJ�:+��p�J�7�hu��` ���Z�i1��(�mTj5�.3ֆ�ွީ�ֲMz̴���|����c�*�O��Ľ��_i
X[�Ѣ�&ws{X\)6%�m))�[�Jo��\-]Z�)���D��%S�@%X<�.~a��J�hO̡D��@G����yͯ���
���k
�
�,{��w�g0u&0ruddSt�c!�8+�(�a>��ߌ	�aZБ"*x�=
~
*D
���Y����Z�Y�U�q��^ܪ6�X��$Ox��
���E�/p����k�B��ֲu]!��+���ج�wi^�N��ku�� �j�� ���2��(L8f���
&t��f�ma����CGFZvd
+�!t`�jM��&g���-3�η������kC��,���ٔ����=n�7���KV�X۽o��78�9��i�9_�U�
;p�3���7��n�#�:B?�p�8�>��9

+Q��O����P2��j��9��D���&�^�k��C�=�c�+Z��/ۛ!"���郇?��[��5^�5����b�p{�
+K�3����*���N�&{��mx9ۦ�O���|]w��U�FeD|�m��n/)�#�n� $
�

��W�~��J��>�{N�:�:�<���Ҍ�y4��Rl�h��h�&z�X�w{��z��'ׯ���U�c�~ݠ
�T�2L�S�+�:Fa�S5���2L��W����
�m��G�݊ŠX�R
�5�껡���W��Ժ�`��n��
�96���2�NrI��uPM)�t�|Xܺ�1�d'��Dg��E?Ls���%}o�V%�<6&�B"�/�|BͿ��r
��)J*���ր��J�4�:b�
�H#��'���ͨ|�4�{
��+~^�_�
+U�Y���B,Z���Э����x�����#�+aE�%)� ���Ȋ�I��
h��`�w���$�lu�<�`�A����M��$V�'W�g��
y���
$?e���a�/)C#	�+�y��:�P����Q���������vQ�L���M�'C��
+endstream
+endobj
+1648 0 obj
+1429
+endobj
+1583 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 435.235 220.699 446.139]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a84e0592d7a7e218f4c4c782f882f18cc) >>
+>> endobj
+1607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.514 435.235 270.531 446.139]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.434 435.235 315.622 446.139]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+1609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 406.698 220.699 417.602]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_ac3d22627243890fd03c69a0550485a68) >>
+>> endobj
+1610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.514 406.698 270.531 417.602]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [280.434 406.698 357.684 417.602]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 378.161 220.699 389.065]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a8bddb181c1be9d2553b18871ab85e84f) >>
+>> endobj
+1613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.514 378.161 301.764 389.065]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [310.013 378.161 356.03 389.065]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 349.998 159.927 360.529]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 349.998 204.221 360.529]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a2a5cc6cf6acdd7c5695af1ef807c40b2) >>
+>> endobj
+1617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 321.088 191.16 331.992]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 321.088 263.777 331.992]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_aa37c50d4e586466d66070a61595399ec) >>
+>> endobj
+1619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 292.551 220.699 303.455]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times) >>
+>> endobj
+1620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [221.197 292.551 244.768 303.455]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_aca857d6f0e8cef1c2a2b077cd6a513ef) >>
+>> endobj
+1621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 223.298 159.927 232.144]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.425 223.298 182.632 232.144]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_abef3573de0c962f79637f379b089b0ad) >>
+>> endobj
+1623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 192.704 191.16 203.608]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 192.704 226.706 203.608]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Times_a0e3334c609b7d72493ee150349098048) >>
+>> endobj
+1625 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1629 0 obj <<
+/D [1627 0 R /XYZ 89 770.89 null]
+>> endobj
+1630 0 obj <<
+/D [1627 0 R /XYZ 90 454.549 null]
+>> endobj
+1631 0 obj <<
+/D [1627 0 R /XYZ 90 454.549 null]
+>> endobj
+1632 0 obj <<
+/D [1627 0 R /XYZ 90 424.278 null]
+>> endobj
+1633 0 obj <<
+/D [1627 0 R /XYZ 90 395.742 null]
+>> endobj
+1634 0 obj <<
+/D [1627 0 R /XYZ 90 367.205 null]
+>> endobj
+1635 0 obj <<
+/D [1627 0 R /XYZ 90 338.668 null]
+>> endobj
+1636 0 obj <<
+/D [1627 0 R /XYZ 90 310.132 null]
+>> endobj
+1637 0 obj <<
+/D [1627 0 R /XYZ 90 240.555 null]
+>> endobj
+1638 0 obj <<
+/D [1627 0 R /XYZ 90 240.555 null]
+>> endobj
+1639 0 obj <<
+/D [1627 0 R /XYZ 90 210.284 null]
+>> endobj
+1640 0 obj <<
+/D [1627 0 R /XYZ 90 163.467 null]
+>> endobj
+751 0 obj <<
+/D [1627 0 R /XYZ 90 69.196 null]
+>> endobj
+1626 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im9 1582 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+
+1664 0 obj <<
+/Length 1249      
+/Filter /FlateDecode
+>>
+stream
+x��X�v�8
��+�i!�Q���&�I&i3�;���G�iY
Yr�h����lI~ę:gV�) �@�؈
l||
�
6��5Fs#������kf<��Z�GWs}D�Տ_>��?�����h�s@�6H}�#�7����wl�`������6-
�2�~�� kS0�\N�
�A
+8��e��"�e���
+�e�m
�.rA�<�pp�"���mڡ��`�
VYbb>/�,ߡ�b�Np����$��anپ�l��D�q*���

C�?�
�����q���EQ�Y���1���D7c"�K�״A`[�K�G�Өv]�H��8�<�*,�R������މ9|�H�B�ո���m��-��Rm� �-���L�E�Y�
K��Z����CRS��j��
+��6�T
(ٗ�B�qJ�ԙY
Fy���3-I������q�hm'o8K
+�ǀFU��\�?;���1`K
������'d�@A#����csR/
/�gе/�4'�F����p�I|q�
����&�bOkRo�r"�z~Q�SII��=�A��|�1aA-���wVZ�G��O������$w�0�z}[䶸]"�@�s5�1|���d@!����R}�U��
+��N~�iY��E�g�� HV�P��,�
�w��p���i�R�?�H�.̐�y���-
�9d��;:
�� � �������|La�[�7�j	���?Ѥ�ם(�<�C�+L*�"jZ�<%�r;��
y.i6�y�a�	��F�{�Pً�4�R�pw¢�=���:����l 
����S��r����L��$��,�x"�+@��T�r���igt�sx�
�����!�#�r�C��V���(�8i�:�4�We�
=X�	��	NO�,��Ԓ��t:l������G$R���Gʓy��%�y�$�E�����C
�Dt+��kBA��_[�yL
@?B���H��>2[���hf0zΆLv\�A0E�S�
R
ثz�S�oz����6'1D7
C��>N���>:���
RX
�ZQ�F+���;!�����&ң�)�a���vvid"�/p�sW
;�so
t���7e<&�Gu���)�YSů�u�go** ,I=��p)�i����no���U;���u�FU鍗i)�JWM7����_7aZ���� ~I�E�A
�!�—��l��E�s}�ַ�S��B[׀+@/�4�̢,W��IA1
�)���0����Z��e���),.U����_�SC�
+endstream
+endobj
+1663 0 obj <<
+/Type /Page
+/Contents 1664 0 R
+/Resources 1662 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1560 0 R
+/Group 1650 0 R
+/Annots [ 1651 0 R 1652 0 R 1653 0 R 1654 0 R 1655 0 R 1656 0 R 1657 0 R 1658 0 R 1661 0 R ]
+>> endobj
+1649 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1673 0 R
+/BBox [0 0 242 192]
+/Group 1650 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1674 0 R>>
+>>
+/Length 418
+/Filter /FlateDecode
+>>
+stream
+x��TMK1��W��t&�$���u��x�~������wf�l�-~
E�ݙ佼�l
yS�����
�vw��ٮ`�z/�
�|(�K~_���F�+B�V�
6P�`0
d���YU�T�.��q��?\�!8b6�z!�O��a�~��v*�R��25
\��A�Q�e�
r7�Rݟ!"eKMn���fk%�
��}!�mBnd�˜��L*��Jy����U�yNV�	��%Y�NΥ!��>�ޖE����u"Z�C�� є"J��Cf� [(CR�
h�[����!�usuC~w�N���O8��
�$.'��$^�C�(��C�o
�n"���H{�`���*���Q�h��&��q������#t:���Q�
�Y���Ч!h�fp����맊�/5C�I���;@�}c�T]�O�a(

+endstream
+endobj
+1673 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1674 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /STYAVR+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1675 0 R]
+/ToUnicode 1676 0 R
+>>
+endobj
+1675 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /STYAVR+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1677 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 722 833 556]]
+>>
+endobj
+1676 0 obj
+<<
+/Length 1678 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mn�0��>�,�E&	!U�ET��=$H�X�,�}�J�Z�����8�T/��g�>ܨj���v<�w��Z��FȄt���_
��O��i�2�(���O/N�[h��ǖ�E�N��͕vߗ[���
����$͝?o����}�����ާ�E|-�)	,q%5j�l��5�ʢ��*���*�OO����5.�K
�y\J
%� -��4(
�u�#��r��p�t�v5�
ԂR�my�݅%
���'cDB�𗢂��
���� ��l���n%��Yh�ֽ���[x�Nݝ�c
&�k�To���h׬���=�i
+endstream
+endobj
+1677 0 obj
+<<
+/Type /FontDescriptor
+/FontName /STYAVR+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1679 0 R
+>>
+endobj
+1678 0 obj
+322
+endobj
+1679 0 obj
+<<
+/Length 1680 0 R
+/Filter /FlateDecode
+/Length1 2052
+>>
+stream
+x�UUiLTW>�΂8#�:[�a�aP�7�"*æ���
:��#�Ce�h늂b�4&Mw�4mj�tK�jM�i�?FM��&��M��j�D���M��Ծ���y�l�9�>bD�Beĩ��'�O�>
��Bڽ�{[�u�O?�}'��f�#��o��~2
��\Z��x���o�������-FTs�>�k{b[��a.��	~:|F�x;�F�@�d�r�=ʍ�"֩
��F����'\���)�2�l�l��
�Ŭw��I�
��*{�>��_?�;�mGG���P��2���jl9�oב�>���l_�ʖ~8���;����%2�%��	X`Օ'�ϻ %���g^�#G�b���4���_����:��|]��qM�a�������ٮ�sJJu�hfGm��m���Z������#�l�)��)�:}V���.*V����b�0�
+�U��$�i�"9��&{l,�D�n��}�k�+��u���N5�y
+
;�;-�Uh����R]�S��.��4F���$���Y3B�κE����UΌ�%q7��!ԉt�����
�x�8:w��ɂ�ceqe�m/��26���ۿk��:��Z�ȳG�
<4�&������Y
��U�
U��L��hD� x�͜p���H`d�(�O�_�4���k���2-3[ʚj������8��{R��69�Ӕ8%qb�`˄�9.�4�;X�_����Y�2�6�c!�~M��8��\٬��F�0�j�)D�v�
�4�&
;6��.�uΔ�]�tD2^o�ݳ��vc�E��\,2᲻�ݕ]�׎0~��,Pȵ��+�xf���3������}^طI��
���9��׶����
��D������džw
Y�ҕG��V���j��rX?<>k݀��;
������JWWҿ9pN�5�,�5���Y
��o��0��Ouؚ� ��v�j�`W^�5F"�
u^/��y-��-v�#W�!�m� M��/�mz����w�ciɒ�p���iD�
Ae3�0k��
�a��
з�vA-g�ǣ����
`K��ղ;��8%�k�1�g&G^�ä�m�9���
n��ց�����Ef`��y���z]B�N�6�%���f2T

�PC5[���,��v��*P�*hXS���:�tʥ3�PC���K���E�Sr&��
jVD�#����T�4?Obل�
#'�,���C'���k��Y��Ž�P��`'�#�Э
O�k$�;4���a�!��뾏�|u0��FO�a���&���
`b:c��ܟ$�u���%�P�`C��[�d���,?�Q�af��{I���@�B���H�R"![=��9�nS��Zt�
};�Rq��$�g:��^Adf�=VU�E3έ>y�5��17hn
3oL�u|�I)���f��@��@5���Ԭ��٦�ݽ1���ƿ�(/$?�
VOU� U���]�N�N������� +癕V`��NP3�IX9�Gj��:ȃc>���,0�
d���|�q�x7֧�Ԍ�w�!��
xj��־�

�h:���=��V�����N[�5W�Ա�'��?�ⳉ
+endstream
+endobj
+1680 0 obj
+1544
+endobj
+1650 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1651 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 389.536 251.483 400.44]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0b2d532ef24c4ccd4a4a04907d03f2af) >>
+>> endobj
+1652 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [255.299 389.536 332.549 400.44]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1653 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 359.608 191.16 370.512]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1654 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 359.608 231.1 370.512]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0e57cbf0841e9af58ac2a52e89865a86) >>
+>> endobj
+1655 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 329.679 251.483 340.583]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) >>
+>> endobj
+1656 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.981 329.679 275.553 340.583]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_adb175a61cbcdf46716687740a28e92db) >>
+>> endobj
+1657 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 255.098 191.16 266.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1658 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.658 255.098 206.194 266.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a48032da1e7c874083e027a065499bd5b) >>
+>> endobj
+1661 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1665 0 obj <<
+/D [1663 0 R /XYZ 89 770.89 null]
+>> endobj
+190 0 obj <<
+/D [1663 0 R /XYZ 90 721.073 null]
+>> endobj
+1666 0 obj <<
+/D [1663 0 R /XYZ 90 409.547 null]
+>> endobj
+1667 0 obj <<
+/D [1663 0 R /XYZ 90 409.547 null]
+>> endobj
+1668 0 obj <<
+/D [1663 0 R /XYZ 90 377.884 null]
+>> endobj
+1669 0 obj <<
+/D [1663 0 R /XYZ 90 347.956 null]
+>> endobj
+1670 0 obj <<
+/D [1663 0 R /XYZ 90 275.109 null]
+>> endobj
+1671 0 obj <<
+/D [1663 0 R /XYZ 90 275.109 null]
+>> endobj
+1672 0 obj <<
+/D [1663 0 R /XYZ 90 223.6 null]
+>> endobj
+752 0 obj <<
+/D [1663 0 R /XYZ 90 127.624 null]
+>> endobj
+194 0 obj <<
+/D [1663 0 R /XYZ 90 119.753 null]
+>> endobj
+1662 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im10 1649 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1691 0 obj <<
+/Length 1171      
+/Filter /FlateDecode
+>>
+stream
+xڵW�v�8��W�kX K1d��ñ�9�m�{c��P�
+�f����(p�c'�4�{�p���Y�:Y|�^

�؊Q
���^[1�B?F,���uc�<�q	���$�L�6u�t�W"�+�Hēb��Y��
	�Ȯ��я�oڼ�
�2l.����K��j�R�q�6��g�����˰E�%
��������Z��3
�#�QM*-�z�,���_
�
*��"�1�V�\�m�Η&��$I�_ֵЃ}pp�'�F��w�8�;y�,��7h��=H�]
S��}�Q
���5T��u���i	�k@?�Lj29���a���n�����)U>c������Nhy
+������%z|�U��p���$@�Y@,��[J�l��Td��˓�u�b�'tO6�%�{��a�����O�?�z�X�[ 
|	�R��
�C
�S�+��	�z����
C2�i��|e&ճ�i�y2��Ҋ��l
J��|"�B����L�F�42�K"�a0`�0�V��r�_�֕�j��������D5w�Co�z��|�
�W�lA��N��C����.C�eR�~�ӷ��^�Ӣ���һ#��
�jX�CѤ
����j�����5�CĨ�!o��P�E�7�ȵ���?V�����w��0{�W[J6��kQ��e�
4y
P���>rVu��;p�I�!m�G�Ȫ�_2^q1�ю!2�uQ�Қ�!jo1�s��n��8����9�-��h��D6f��b����&��>a�"�b�>��{�E� ���m�@0�P�WHbm:ವ�??�bp������c��uḑmZ	�9�#�аx�cG�pj���tj;N�#D!'��d�<v�Vo)���0���
.Tk�by%z_��d��ɣUǧ�ʅ������4y�BU��$�F"�T�7�\�'Md��v  %,xE��Ӣ��4Zo֝���t�{$�C�i~GO>�Vti
�(+�TY痂����W^
+��@��h1
n�X_��}qq�gۅN}9O��K23�j�X���_ �n���a�6��%���p�tX�Qj�2e6��!��`�+�G�������)�ht
�������v���`�e��d(�x�:��0D8 ��A��Z�>1�c��Q�u]a��A@{�m���וq���ͯ+�7f��
+endstream
+endobj
+1690 0 obj <<
+/Type /Page
+/Contents 1691 0 R
+/Resources 1689 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1560 0 R
+/Group 1660 0 R
+/Annots [ 1681 0 R 1682 0 R 1683 0 R 1684 0 R 1685 0 R 1686 0 R 1687 0 R 1688 0 R ]
+>> endobj
+1659 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Linear__Expression__Variable__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 1700 0 R
+/BBox [0 0 220 192]
+/Group 1660 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 1701 0 R>>
+>>
+/Length 417
+/Filter /FlateDecode
+>>
+stream
+x��T�j�0
��+�q�؎m9�`�ö����i;F;Xw��OJ�M`�q���ْ߳�ޕ��
�6BA%�qO��9�`�B�}���
>�-��j���"�;`&�� �q���
^T��+��F,a
Y���L�,	� �;2���Z���iި�c���!S��z��,45�X ��٪�"RmHbY�
+0�1m
.�]*�
���u!
��(+���d�K����D��L֦�dE�5'`S/�����<���϶M
��p��	i�Q]y�eQrl<��
dR� ����Į���S��tH�����{ݜL;�DzI�&��O�_ �]9���:� ��C�9N�?m�t�܂b@�����@Uױ�;Z����(:Nw(8m���C	kx��Q���"V�\zM�4�����YV�7���{���&
+endstream
+endobj
+1700 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+1701 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /TFQXBQ+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 1702 0 R]
+/ToUnicode 1703 0 R
+>>
+endobj
+1702 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /TFQXBQ+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 1704 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 556 556 667 500 500 667]]
+>>
+endobj
+1703 0 obj
+<<
+/Length 1705 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]�Mn�0��>�,�E&�4B��
���� {H�������5~(�j	��o��3��R?�f𔼻I5��v<O7��:�FȌ��F��֊$��e�<֦�DYR��ٻ�vOz��AQ��4��\i�ui��ܬ�ᑍ�TTi��q/�}mG�$�����}��E|.�)�,q%5i�m�ص�ʢLê��ê�O�Rغ^}�.��������E:J�ZʡiP��AGh�@
+�SΠ3�GP
*@
()��Ӡ�.
)cP)G>�"�D}92H�wBv��w ����uhm�:��|�͹0��(�L�i
����Nvu�����
+endstream
+endobj
+1704 0 obj
+<<
+/Type /FontDescriptor
+/FontName /TFQXBQ+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 1706 0 R
+>>
+endobj
+1705 0 obj
+313
+endobj
+1706 0 obj
+<<
+/Length 1707 0 R
+/Filter /FlateDecode
+/Length1 1892
+>>
+stream
+x�UUilW�y>r�$v��A�G
�"��r'qȁ'v�	����)�@��JJ���*U%
+�Ϫ�R/��J�j�P���
T�Z qHP���;o� ]�
3;o��@
+����8
���N����=�

����I�������@]E:o��!�'H��G&v�R�I>Mrdx�/P���$GGb��q��䰁��3
+���,((�}�Eo�2���3lv���5��7�`��`֋�Wt���f-��j�Ity=n�7X9
߳o V�N](T�	��n���9<y�M��>
�06��3N�	�(1�̄Yn �
�7�.�@��>y�5)��F��fU�\�j�PM~��XiZ���,TEzڷ�ir
�K�r�
ի+�T�@4k��ʋ;>jn����i��`d�ٱ,K����T���Mgi��]sQ�V�-
�  h�SLKh�@Ao�TkPt���D��z�F��Y�6���V�
+:�H�<�3�b��O&~Z��Mc��ꎕ�7���#�J�)91mKYQ��޺Nz
�\�����J�$�$B�.q��*��au��\�$���
J�?
2](�C�5?�
�vL�1:>95�
+5:�Y�̱7�g0u&8rqddsl�c!�8-�(���$�wƄo0-�H��
��w��,���g�iV|�u�i�/iU�s�,C�C�'�IXZ��"������m�p~���]a��+����٬�wyA�N��suR� �j�e ���"�('L8f���&t����m�kݣ�������H���;MΆ�
[g��m���0��kc��l��>ř	9����=n�7��3V�X۽���78�9����9_�U��
�<Ձ�ң�M��F7��n
��\�k�]�`�
�������Pҿ�rԐ�|�
���Ul/޵�����항ɗ��0�uw�����k/�5��%��r����p}�

+�K�#����*)�=��M���mx�ۦ�w���b}w��U�FiD}�m~i���浣�݄?@H:/p|
������c�W�Ƿp�r�9�)ǩ�i�z���`+H���'���ء#��|�;5�C�>�|5�/�3V����N��a��2\�T1j�
�Ѵ
�0��^�'�w�mi
���*Ū�b��qW��{e���e�t����yc$)��ڴC���"�e
�t�rRXl(栈���'�?��GĝbCrܘ���
J���J�y`L$h�D�_&�BͿ���~^IUQS��B�m
h體A]�#�^��$�1���ӖޛY��i�9��?V���>�)��)�IL�E_4+nKס[��ӝ��{
�����(+/�"
B@�FV��C�
n@>#�IN٤���h�����wg����4���[�v&�g�S��
���QF2�6L�3��H���i
-��q��J�mtF���E9z/@?�,�,�-$�
+�� �P��
+endstream
+endobj
+1707 0 obj
+1430
+endobj
+1660 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+1681 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 426.379 229.336 437.283]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable_a820ba8207751c8764ab6a51eb1183a7c) >>
+>> endobj
+1682 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.152 426.379 268.34 437.283]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+1683 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 394.077 149.098 404.981]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+1684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.596 394.077 189.038 404.981]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable_ad6f7c3aef257204c507d0a85539aa987) >>
+>> endobj
+1685 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 361.774 229.336 372.678]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable) >>
+>> endobj
+1686 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.834 361.774 253.406 372.678]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression__Variable_a5bb6231ba1b0357cce472468fc4733f2) >>
+>> endobj
+1687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.588 210.527 102.492]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Logic__Error__Exception_a655c21143c2eb90c64487e6e4dcd140c) >>
+>> endobj
+1688 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1692 0 obj <<
+/D [1690 0 R /XYZ 89 770.89 null]
+>> endobj
+1693 0 obj <<
+/D [1690 0 R /XYZ 90 447.577 null]
+>> endobj
+1694 0 obj <<
+/D [1690 0 R /XYZ 90 447.577 null]
+>> endobj
+1695 0 obj <<
+/D [1690 0 R /XYZ 90 413.54 null]
+>> endobj
+1696 0 obj <<
+/D [1690 0 R /XYZ 90 381.238 null]
+>> endobj
+1697 0 obj <<
+/D [1690 0 R /XYZ 90 326.418 null]
+>> endobj
+753 0 obj <<
+/D [1690 0 R /XYZ 90 227.534 null]
+>> endobj
+198 0 obj <<
+/D [1690 0 R /XYZ 90 218.179 null]
+>> endobj
+1698 0 obj <<
+/D [1690 0 R /XYZ 90 112.786 null]
+>> endobj
+1699 0 obj <<
+/D [1690 0 R /XYZ 90 112.786 null]
+>> endobj
+1689 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im11 1659 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1738 0 obj <<
+/Length 1863      
+/Filter /FlateDecode
+>>
+stream
+x��Y�v�6��+�+uZ�H�Tv��$�5v�Izx ��򡀔
��;ăi=�$r��

��ܙ=g�x�ϣ�nGW��L�4$�s{�L='
+����9�]���}��a��4!�����ono�o����#
�<ky���I���?<'�ׯ
���yP�
+' >\s�f���3�x������b��c�����y���7L�<O��N�X5�*��v���pw��3!�2�3���r%S�,�s�5�7M��\�J����׼�>Lr�^�ǘ�<ןd�nD�k� ��p�B��n��n�'��[!���zyx]�����q�]�K���x�=���z�(놕)7��F�YAQ���Ec�Ww���5�Q..Ҫld��p?����fuX�1��{���`4�To�A4K�k^�x��(�LOOE�
Q�
*�*]�l���z���N��i�js�0ƞ��C����UaE��,7����y$��z��~
~B&Z� L��	|]-D��h}$�\	��ak�bZ�����5��uɉ]|ۋ��N����,���4T ��C���B�G4���a��A7�l;�O#�ê����%����F�8���'>���d`��݌C�뗳=Z�X-�U�4�Z�d��|
�9/4�\��w��p�!�����\яq��^�O�C��,E
.��R�3	wX���j!YQt����
�K</�%��1���)�j�&g��l�:y;��
��
��\���l�@�F�s���Z��f�]���AV�@���D�����f�u��yS��U&�6
+ JZ�Ʈ������Z��	(������0�
ۺ�\}��#�OI�b)O2�W��_�}r`���A�0PL "1��G�͙�x��[��z��(ֆ!���;U�#+�����=x�!)3s-Y��ʱ��@�6�a�9�?'��@?��J�G�aݡ{6؎��;� �2)�P'7�`r at NlYl��������!���a��Ȓ�� �{���l���6��u7Eݨ\ Y���Μ������oc�K�*��$7����A����,$z���mP{�2,�q+(g��A�Je˝U�;����͍���5
+|
�B\��U�@���]�b(vN�]y۬�?Q�4R�JU�N�H�u�:?gڜ�.ٵ_k���e7Y2��}(|W�R��6�g�����h��P���=NP-���
+.<��NX�����&h�ި����Yz�τ��гү1#Dڶ�|�XS5,O
+^Tr��2�o^?
y��
��o�?�Ѻ�Ѵ��c��W��|�w������3�����2�yyf^U9?Uɿ��
�}��i[D�e���_�w`���
`��i`cu{\�3t@�^�8�C�Al��8q4=�=^����k�oѪDv�V)�S~5s��
���=��
��d�{��A�ʘ\�(���(Ž�_�{�ؔ�N<�œe٣6&��6iO9�C�P���K��c���pXċ=6iπ�
P����p/�����
UKyv�P}��dz+���c]���J�z(�'�pS%�ӷ
��T�l{�D��K��7����
�/���o{lk-Xk}�U
����<(���� ����е��!>�G��DvĻ���
���;��Q���Nv�a��L�զ_����=&���;=@%����U��#��ڭ���;L��{
���!Al�_� �
"D����Ǒ�<
ED}ܽW��yq���L��n�M�� `�M#?V�
��x�.��A7���7�vp��V.�l��0��;g������Ɣ����ʮ h
�-+�G���q�+O|���3�������Vdg��q��M�zvq1_/��Z���S�m��y�X�~AB��Q�n�
�����-�
+endstream
+endobj
+1737 0 obj <<
+/Type /Page
+/Contents 1738 0 R
+/Resources 1736 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1560 0 R
+/Annots [ 1708 0 R 1709 0 R 1710 0 R 1711 0 R 1712 0 R 1713 0 R 1714 0 R 1715 0 R 1716 0 R 1717 0 R 1718 0 R 1719 0 R 1720 0 R 1721 0 R 1722 0 R 1723 0 R 1724 0 R 1725 0 R 1726 0 R 1727 0 R 1728 0 R 1729 0 R 1730 0 R 1735 0 R ]
+>> endobj
+1708 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 459.034 264.491 469.938]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
+>> endobj
+1709 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.672 445.646 345.558 455.552]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+1710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 433.605 242.354 444.509]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a259d72e4c1cc8fbf723b463475882c9e) >>
+>> endobj
+1711 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 408.177 208.312 419.081]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+1712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.81 408.177 315.797 419.081]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a8eb4ecbc8176c3018d1d742f5abb8115) >>
+>> endobj
+1713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 382.748 229.362 393.652]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+1714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.861 382.748 275.021 393.652]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a10856aafcb2ba1f52e5158a96950d32c) >>
+>> endobj
+1715 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 357.32 228.785 368.224]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1716 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.283 357.32 305.586 368.224]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a163804d4b5d0f7361974963ef22f98ee) >>
+>> endobj
+1717 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 331.891 234.334 342.795]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
+>> endobj
+1718 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.832 331.891 314.313 342.795]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_abc1363206f93e6778c1e9d136f24c01b) >>
+>> endobj
+1719 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.384 306.463 226.314 317.367]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_aed0b5ff233c2092ec5414bcf36747dd5) >>
+>> endobj
+1720 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.384 281.034 212.486 291.938]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a4b15258348ad1f31d1857eca9dd9bc68) >>
+>> endobj
+1721 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 255.606 268.376 266.51]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_af95bf704d29d8b91d248d1d437ad703a) >>
+>> endobj
+1722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 230.551 201.946 241.081]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a4155cebeafe8bc5e3d7d863e1a24abcb) >>
+>> endobj
+1723 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 169.399 192.89 179.93]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_ae1928da791c8514b7e82e2d750ebdad8) >>
+>> endobj
+1724 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 145.353 316.306 156.257]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a77b86c1af3be2ba98179fe26fc5560de) >>
+>> endobj
+1725 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 121.679 310.627 132.583]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_afbd6f23017c162cd460d4b0ac42ae4c8) >>
+>> endobj
+1726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [314.443 121.679 371.219 132.583]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+1727 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 98.38 232.192 108.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a68cd1f4ad51eff8dcc8634ae7990b3e8) >>
+>> endobj
+1728 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.008 98.38 279.514 108.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+1729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 74.333 236.068 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a81aa24851effbe4fade96c65e7c575d4) >>
+>> endobj
+1730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.883 74.333 317.71 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+1735 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1739 0 obj <<
+/D [1737 0 R /XYZ 89 770.89 null]
+>> endobj
+1740 0 obj <<
+/D [1737 0 R /XYZ 90 721.073 null]
+>> endobj
+754 0 obj <<
+/D [1737 0 R /XYZ 90 604.785 null]
+>> endobj
+202 0 obj <<
+/D [1737 0 R /XYZ 90 597.817 null]
+>> endobj
+1741 0 obj <<
+/D [1737 0 R /XYZ 90 499.471 null]
+>> endobj
+1742 0 obj <<
+/D [1737 0 R /XYZ 90 473.994 null]
+>> endobj
+1743 0 obj <<
+/D [1737 0 R /XYZ 90 448.754 null]
+>> endobj
+1744 0 obj <<
+/D [1737 0 R /XYZ 90 423.325 null]
+>> endobj
+1745 0 obj <<
+/D [1737 0 R /XYZ 90 397.897 null]
+>> endobj
+1746 0 obj <<
+/D [1737 0 R /XYZ 90 374.194 null]
+>> endobj
+1747 0 obj <<
+/D [1737 0 R /XYZ 90 347.04 null]
+>> endobj
+1748 0 obj <<
+/D [1737 0 R /XYZ 90 321.611 null]
+>> endobj
+1749 0 obj <<
+/D [1737 0 R /XYZ 90 296.183 null]
+>> endobj
+1750 0 obj <<
+/D [1737 0 R /XYZ 90 270.754 null]
+>> endobj
+1751 0 obj <<
+/D [1737 0 R /XYZ 90 245.326 null]
+>> endobj
+1736 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1788 0 obj <<
+/Length 2167      
+/Filter /FlateDecode
+>>
+stream
+x��ZI�۶�ϯ�-RU��B dn�
���yϼw�S*�i�P�BR��klIQ�,�\$����q�
p��ŏ7�o%b
*��E�@�1���������`�G�\%�u�=ܩy�L��Lʇ��#�����
�hT�fj5�P�G������'�P��g
+�1������7�/~���� C8 ��d�V���
���F
�I� �
�����
�d��٢0�@6j�H��KI"���j>w
&�oV��U�������!�(I�ڽ��Z�˷1i�Db�/�]dV�9]n˜�)u�[
j/��8�V�Ȩ�
x�V�-7!�#�%\`�il�~��w�
+>O8�2O�tL��^�㖼S�:�����ҙ�ySϪT=-n�P�6��b��@����o|�
�9���*)�?}]�������
+�<�ꡣWJ�	h����µ��j��D�w�
�vV1dT
�
����@��~���!"��#[��*��h��b�η��$>�!�I�m(�Q��P�u��"�$QJo/mu�8�c�-òk0�Q�a��a�W_���N�e���"�ly�	&��y�Q at A�v��x���E������մ�w�/�`h�<e��S3�:�L��ކ�]�F
"7i��]Z�iҝ�G%
+)y��;�HkWc��u�ԛ���}���:�U�n���I�����byB�
+����5�I�MR�3�^�p �Y�L�
z��2lk <��?�p( ��~I{�,Uy�K[����
2=���MP�
$���8W��NB �H朄�b�@8�������
\�&3&�|�� :��^�ҩ 1B�]��Nq�Q,��E!I��歋')�>�H�9U�J7��p�
�W��]0���Y �@{� ��p� D,'��嘁�U�����d=���{���B-�v�Z
�A(E�������:؄���̖�yd��
+�E�!V����������;}��*��6m$z���I՛2�~U\�����{�hO��Jo߻����-�t|��Vuu
{r=�;�>�5q��-��`e��l�1�[6.�^�:pz�������h��$'?�-8��9no!8��D$��8�#9�#ӣ9�E�j���
'��'$9&�<%�U>-�1ȫ�
B!�H�#11Y�m�\aV�����n/�[�Ab�����8s5�oU>@L�{oK��E^ۊ�m��1��P&+U��z���GE6�2M%���c�|g/��(�=��l�!f~����
�O��;A��{#u�W�d�'|�Nl���	C at zd��� ���X+F�g�4(
��%�4/f�=>�(6��Q�����M�}5��޳y
+�D�k���u6`103�\��7ltw3�t�y��	���j�+�
+5��P�\�]c���YZ͂}��
+����,�P�! �����&�z��L�S��
�
���<���-;܁��CH�Uuc~z�P��Dg�A*�fthZ�G�
�3g�JAհ �w�)��"t6���
��]ro� ̪։>��àW�{9w
+{�5h&݃�8n���.�ִQ
�
�؇Uc�޲1@y��#�;8[H��t���(�-a��V��}ネ�
�w�;=�B�	M���@ f�^b�
�1G^~x�8�9��U���/�<
蕃�N�j!�#J}r�_��y��=�}R�J*��M2�]��ؘ���J�D#��QΡo�B�+�(�̗8��6"�5�?�t��7]��ѱ��GǠ�#�j .^܄�J͓,������>C��`�`�G�l},!m��h@��w��*�Z9��Q�n�Ca
Mu�!}��¸�M"7�N�Lm�۬L�;'=/�Q|� P�����໼6���x� c[[C��@����u��Nz
(�uf}��S��u�7��-���~6�/��!S���N\m�ԣi�K=��R���\j"
�)����a� ��f��F�C8a����z�<�k���9,�C�
�O=E��S?�0�
+��N|���*�D<v
w��ȫ���}�w��o�ȇ$_n���ڸ\�>��
��R�wc�Gnw}L��Z�6V�U��	" #�m�;�J!����ݿ�-	(������������ͲR�͊��������XT�.
)��:W� �6��܆��^�`��`�a"%53����
\�[��Mv�~��tkӤ
+endstream
+endobj
+1787 0 obj <<
+/Type /Page
+/Contents 1788 0 R
+/Resources 1786 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1801 0 R
+/Annots [ 1731 0 R 1732 0 R 1733 0 R 1734 0 R 1757 0 R 1758 0 R 1759 0 R 1760 0 R 1761 0 R 1762 0 R 1763 0 R 1791 0 R 1764 0 R 1765 0 R 1766 0 R 1767 0 R 1768 0 R 1769 0 R 1770 0 R 1771 0 R 1772 0 R 1773 0 R 1774 0 R 1775 0 R 1776 0 R 1777 0 R 1778 0 R 1779 0 R 1780 0 R 1781 0 R 1782 0 R 1783 0 R 1784 0 R 1785 0 R ]
+>> endobj
+1731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 697.428 263.893 708.332]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a9971c2e55bbf3477c321cb1fed28c430) >>
+>> endobj
+1732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.709 697.428 344.958 708.332]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 674.376 267.071 685.28]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a6cace6b1265203d0fff22021fd2a56a2) >>
+>> endobj
+1734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.886 674.376 353.685 685.28]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
+>> endobj
+1757 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 617.019 239.036 627.549]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a0a9d6f3a0eb496081b86efbb0ea0a011) >>
+>> endobj
+1758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 593.967 239.325 604.498]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
+>> endobj
+1759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.823 593.967 262.697 604.498]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_af933208cb9b9013073316c1107b3649d) >>
+>> endobj
+1760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.663 570.542 288.644 581.446]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a535529376fbabac6dde098be2c0bc9d8) >>
+>> endobj
+1761 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.021 570.542 335.844 581.446]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1762 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.306 570.542 457.323 581.446]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1763 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [484.029 570.542 513.996 581.446]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1791 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 558.961 146.454 569.491]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1764 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 524.577 193.358 535.481]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1765 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.856 524.577 252.296 535.481]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a8c602e835a5fe866cd3d0838c42ac9e3) >>
+>> endobj
+1766 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 501.526 193.358 512.43]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+1767 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [193.856 501.526 264.491 512.43]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a3659575ce6ee121e2a2df2c347796fce) >>
+>> endobj
+1768 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 478.475 230.289 489.378]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_af44c1d2698cf0080c2e7cdc4fc2b9634) >>
+>> endobj
+1769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.105 478.475 280.122 489.378]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1770 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [303.315 478.475 349.332 489.378]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+1771 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 419.884 256.859 430.788]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
+>> endobj
+1772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.357 419.884 349.541 430.788]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1dc4d783858f3eff8674c04502f4432f) >>
+>> endobj
+1773 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [353.356 419.884 459.786 430.788]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Name) >>
+>> endobj
+1774 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 395.699 262.618 406.603]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_ae65e48247a4f2477e8c00f5088190bfc) >>
+>> endobj
+1775 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.433 395.699 371.757 406.603]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Control__Parameter__Value) >>
+>> endobj
+1776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 329.993 172.361 340.897]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a36ac8f2a9f570db98e652d333541ae5c) >>
+>> endobj
+1777 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 302.957 172.361 313.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a8e5ebed0862d7349443d391cb8aa9ab3) >>
+>> endobj
+1778 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.607 302.957 294.434 313.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+1779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.048 302.957 385.297 313.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.344 302.957 486.143 313.861]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode) >>
+>> endobj
+1781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 253.006 172.361 263.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a42d572a34bcfa6f75a730215898de8c3) >>
+>> endobj
+1782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.176 253.006 234.626 263.91]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+1783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 226.343 177.83 236.874]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a029ae33c5a3d2e301e08d77744d6b739) >>
+>> endobj
+1784 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 199.307 191.678 209.837]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a76aa40d264daa4af312ae293615ba3d6) >>
+>> endobj
+1785 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1789 0 obj <<
+/D [1787 0 R /XYZ 89 770.89 null]
+>> endobj
+1790 0 obj <<
+/D [1787 0 R /XYZ 90 689.214 null]
+>> endobj
+1793 0 obj <<
+/D [1787 0 R /XYZ 90 434.533 null]
+>> endobj
+1794 0 obj <<
+/D [1787 0 R /XYZ 90 410.537 null]
+>> endobj
+1795 0 obj <<
+/D [1787 0 R /XYZ 90 348.472 null]
+>> endobj
+1796 0 obj <<
+/D [1787 0 R /XYZ 90 269.836 null]
+>> endobj
+1797 0 obj <<
+/D [1787 0 R /XYZ 90 242.8 null]
+>> endobj
+1798 0 obj <<
+/D [1787 0 R /XYZ 90 215.764 null]
+>> endobj
+1799 0 obj <<
+/D [1787 0 R /XYZ 90 148.94 null]
+>> endobj
+1800 0 obj <<
+/D [1787 0 R /XYZ 90 148.94 null]
+>> endobj
+1786 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F60 312 0 R /F40 1792 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1819 0 obj <<
+/Length 2649      
+/Filter /FlateDecode
+>>
+stream
+x��Zݓ�8����;\+�@rO���V����e�)IM1X��`p o��믥����uuO�>�[�_	Qo�Q��no��Q/!��һ]z	��0!B�����
9�t��
dLX"a�i����n_�v�^�ݼ���rà�z
�
�^����z
h~�Q$���
�x!�Yx�o�qC�(t(�
�Ĩ$a{c�1�#��0�y�R�]�ٜ
�/�*��*�Z���cƄ�����٦���K�zsbpq!ϥJ����_��,V �3l���ύJ��+��GJy���@�ZwT��*��/���[K2-�RV�i�<�Sa�30�J�N�m�X,K���,	����v����\V3.��%���?�:OA=M78���\Y����M��=C�5�jK�#�gY�[}�Y��m�gy[|�!�e^�
�c�V�H",�]1
��*-���7��<1�������Y �Jh큳PMV��j��(�����+k�4Lt�[���W߶�j�%���W��ڶ�&�O��F�����*�
1=鷃���m���Z [...]
X�okܪ|�wZw6��[�Xj6��H�'h��2���6-4K;�*v(��҈v����
� G��?��FQ��
|�XsLM/�Z�م��� ȑe~��j��M7pp��������� �l=���}��z[�����N5d6eh�����4�v�s���f�h>��h���N"0Y��A�z�`�"�U�*wU��A�[�j�m��`��5GW�ΐ��Y�Z�(q�n0�A��f{��X�:�� ��X�
v�̻#�nhUӍ3�#�h����4��X�ݩ��U�u-h~ ���������G�fx���Ba����� t˶�k{f���ó�
��7bS�z�>l���ˊ��
�,�
+�U�"zXЙ/����cC���Z�(�G�	t�?���e �8�
�V���fn����5�i�7�B�` NVm����z'���^���ΥD����EUjU����V%�i�͢�G�J>�V�{R�\
Nyfa��]�_h�%~��k�+V)��8���5��W�
lzO��t����&A�M�����7�����:H~'dk�Ax���c�9�g��d^="5f��s����	�t�?C&
�L�
�pK�AV-���B`�ѬngSZpu��K�6����ٛ�0'pykn<$A�8��� ޛ� `"!Lxa 	��*��$N�:����j�f�hR�v��*f����jQ�p�	i��a:��}�C�Eƾ�;�i��!d/�M"�ba��B��5
��Y��P5.C����)d��O�s ��ㆨ)�_T�Y?�	�2 $,�jH�^
�nzB��ǘhdE|8���nЇ�ԕ�'�5$�-�.
AR�hd#�./�S�A鄹X'M�gC &#!��w2��dx�F�p�_vy��U3�§M��m]ۗ1'ͽB
#��Cq���
�מqA
c�ݺ��ܭI�����
+=𨘷�
�Gn�Ѵ(^�`7,"�|�?�F�9�CZ\j�g]�!g����$�4�FE��xq4���
N�q�
>
�ǽة�L0ճ&��
�
h��!�$^���8G�zv�]��R¡� ` $C"w��iM�x ��=Y�
+�ȕ���#${:SfE��t�W�Qo�:oFl� �n
9��2�B1�q$#)�D�)�Z�q��!~@�
�$����[��X��5�
LU����9���i|�N���`�J$<�O �';$��
H�vBr!:"��Ζ
#��RH�t�BI,ܯ��\��W5�_�e�3,����>��-���
+�e���� �
+������4!<p�{����Rۖ#^#�
L����8��u3��L�Es��;`$��鐏��v��A��u٩D��;�\��R�5P=mU@�FѴ�z
��~KS��[m�-.4:�)�-G�
��	�wՖ��Q��B�j��1��2`�uF�$"[m	h?Ymq"���xf݊�28 �����t�����U�1���LzϚ1�� ��$�ݿ*�?3���G, at I�/���V���T�~�?"��Ƅ�^�M?����(��V�;�W��Įħ-�h�:�qH9����L
��A@��a�E���e]Y���*k�p�ш�q���7���}�=��rW
��O�xI~Pr�d���ğ�c^I�J
��8s?L�/�ADC���Qʢ���M��ONѤ�L
+H��)�P&���=?��R��:ԑ���}�bN	H� ��SSDh��P��i���(�	Id4t�"�:)Ƒ9���4�0.�;
x���+q�%�˰�䥝F��$��)�55EĖ>9�
+Z�!h3�xƤ1�Ub�ck(��Wc.��S�=��@QS�eb��
��I��X �!)a��,���A�\'�8\��ܞ��tJ�,��]�쁃�G����ӡ����+������L���R��������؆�7���b{rs�7��v
v9��l2��p�;�{�_�`ed.=`�۴\�ҕ
����y�oW�iѿU�u&���?��r7�c/�s.FضV1�A1�ޫ��
.�s��_�\m�
Xa�O��m�}����nըrE�js\7�'C
+M�ܲ�6W�ݟ�7���.@��8\`
+endstream
+endobj
+1818 0 obj <<
+/Type /Page
+/Contents 1819 0 R
+/Resources 1817 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1801 0 R
+/Annots [ 1811 0 R 1812 0 R 1813 0 R 1814 0 R 1815 0 R 1816 0 R ]
+>> endobj
+1811 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.411 636.226 342.66 647.13]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+1812 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [264.006 542.886 322.456 553.79]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+1813 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.912 513.306 329.362 524.21]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+1814 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 286.28 201.372 300.228]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+1815 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 286.28 432.413 300.228]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
+>> endobj
+1816 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1820 0 obj <<
+/D [1818 0 R /XYZ 89 770.89 null]
+>> endobj
+1821 0 obj <<
+/D [1818 0 R /XYZ 90 475.822 null]
+>> endobj
+1809 0 obj <<
+/D [1818 0 R /XYZ 90 453.445 null]
+>> endobj
+1822 0 obj <<
+/D [1818 0 R /XYZ 90 453.445 null]
+>> endobj
+1823 0 obj <<
+/D [1818 0 R /XYZ 90 365.274 null]
+>> endobj
+1824 0 obj <<
+/D [1818 0 R /XYZ 90 311.585 null]
+>> endobj
+1810 0 obj <<
+/D [1818 0 R /XYZ 90 276.915 null]
+>> endobj
+1825 0 obj <<
+/D [1818 0 R /XYZ 90 272.432 null]
+>> endobj
+1826 0 obj <<
+/D [1818 0 R /XYZ 90 189.746 null]
+>> endobj
+1817 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R /F8 448 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1837 0 obj <<
+/Length 2776      
+/Filter /FlateDecode
+>>
+stream
+x��[m�۶�~���*�T0�A������uf\�͗4��I<
[�<��s��g�B��H��x�x<�Hpw��>xv���&��?n�����O
+GiIe��.�8R\#!��:�uF0bb� ��CR��C�}�O�e��f�eR>�����}\~,�$���t7_P�g?l��r��һԾN�U
+�bb&���/�o�~��zC� 
g�@*�V��_��
���

G�l�]�)��6�|����^��\|c��a��<R��
�˷��҇:+��t �@��`
�%T
��:8>�AG�k�DD�Hj�` �Ʌ�i!zb	\I_���#�>'
Q�R��]0d��r�E|j��w�
f
���`��p}H�M}�|[�s.fE�l�/
��a���سI���yE�`�#"Ոlwe7�(ֈ���_��bN��[�B)�3������8EL[�'�l���d#8�M:'b~K�ͤ�FO��Q����e����%(K�
+��,0�'� �l T�T֍�ڎ
�`�u�D
�)#�(>i���L�"F���gŀ�}�ZQpJ�j�y�է���Ѝj��%Q
s�q�X ��D��9�=%�l����35�<�Ԫ�
3K"Έu���
����sh
�G���8Lt���	F��	{��Sw����.�,���깪�R����r��܀óoV�������G�ڿ+�]̭ 0r�á����4ܙ�vߛ][���V���L�V诠���G���U�'<�����c��
>�0��T۵���)Ӥ�2`l}���K4�\
G]H�إ�w�
'��i��
+��I�nV
+ҥ��y"�s���qZP�~��~�X�,d$���hƗš�u �!O���4�|Vdk�˒�C�J1��� KL` �1�P�c�z���^,�$	�> �sBf�xh��x�����z���0A
+�������F���{�5¤��n�jZ�_�4�����|�	��� 
�
+��
Y�J���b��H�6~����Vq�ү�pL�6uW���y�0�ܔ�����y(m*e#Z�4�-
�Iy��^�G[s۲1O}�U��&���z����.��}�ƺ1�C��(���nn�^h)O�Dg��\zY�M��Z���@��h��@K�p�>4�q
$��
n՜�f�I}�Va��$���I��}@աnn�8�B7���J���|�Ϝ)4�J`��[ߪ4K�
�\�ٶ�7 H;����I=�tu i�qˈNB17�H	�ޤ���A f� �S
���\�6�SK���#��Ci㉪��v=
�
^�^�@�#��ڰ��
+t���!��!��
<�#�G��I��R�U�NԬ�T�x,���
��'�h�c�̊�^P
�KF1�p��w�ڸ�����J+”A
B�V��}��ٯ��wÓ���z}*� �+�l�2�r��X�e�a�k�ԕa���4{�.�p�(=Qp@�����pGb���d\Q� AI1max��7�^����`�G�=Ag��0c�C51�5�w��*hB�/�T���7
(��^}� �G�P��U�X��nU�g�BJ�H���h��(�W�
+#{�켂5�6�'(X_Z�y��t�����+d
�P��b at V�:�b?���mYP�`�W߲�ֽ�Mݓ���|��dN�O�y�_5/��}Z��i���4�ӭr-
E
>	
���<���o@���c�
+(�K�t�(��Y
i�-�Z���E�t}F��C��dƬ�+�͌
ό9RT�d�
߅8�+��pQD�3Sc� ��D�0����Ԙ"�)lЀ�ޛ�
ggư�P2�
���
+W��ЀL�}&���:��N7���>�S
+��Pt�^�G*��j�&Qˁ+�S,t�6?v�jXO�)�
+�ᗹ����@�j�9���i	��ڔ6;�"ѐ�=�.p�/�b��c�[Y0XV品����j ��VPrv6O0
)Š�gSV
��'��oܣo�]N�Cq�Ȕi�qW�G�
��֪���))��,��c�Z3ٍ�MZ
)\��S�� �
�O0Љ�s
�b�b:)=x�6���#�脹EG�4��ߝ�0�(����j����^�}�v�q;�p��]ꟴq��+tY2}:^aI�-�_�܁м��ͪ(͖pa�y�	isM�U�w�mg�dԬ��Eoxx��:���C<
� ��i�
W�<��Ka�����_�/d�r�&�
+�;s_h
+�~_(PѾ�F�}���
��&0��
+���4���
܈a����a�� 㐮��VL���l"�$C��a�nk82�.����N��R�g�^*){��o�
l7�.�Ib��^�Ø��:~n�b{���N�rBӑ8)�!�$���l3������8L��d�;�f�>ZT�s`C��8
���;�!]����Y͝suF��1�[����6��I饫��6[F�A�+�栛�����9~��:{lɒԧ�ȼ�&�x�H�b���W�<I�L\sH!�I�Z�d��z��w&K�@�'I���H�6x��p!G�ފ�"V�9Du�#	�ge�#-?��T)fH�i�j�jDL}�Sl��.��I�Z�
+{��DHŠ�<�[n�@���
	T��HSd��)S�j��*��� ���[���w��m�؂�{�!�7���7|���ϵ���*-�2���z����D3O�f]�}��2��@"w��s��n���/j���6��=�F����}]?|�����J�
Z�ù��X)���rל���j <��Ӿ���v�II�|�1�ee+��so_6�o��X�c���? ��p

+endstream
+endobj
+1836 0 obj <<
+/Type /Page
+/Contents 1837 0 R
+/Resources 1835 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1801 0 R
+/Annots [ 1827 0 R 1828 0 R 1829 0 R 1840 0 R 1830 0 R 1831 0 R 1832 0 R 1848 0 R 1833 0 R 1851 0 R 1834 0 R ]
+>> endobj
+1827 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 693.377 201.372 707.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+1828 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 693.377 432.413 707.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
+>> endobj
+1829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 682.572 201.372 694.971]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1840 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 669.068 201.372 681.063]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1830 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 419.182 201.372 433.13]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+1831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.238 407.227 379.76 419.56]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) >>
+>> endobj
+1832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 267.18 201.372 279.579]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1848 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 253.676 201.372 265.671]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 155.164 201.372 167.563]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 141.66 201.372 153.655]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1834 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1838 0 obj <<
+/D [1836 0 R /XYZ 89 770.89 null]
+>> endobj
+1839 0 obj <<
+/D [1836 0 R /XYZ 90 718.682 null]
+>> endobj
+1841 0 obj <<
+/D [1836 0 R /XYZ 90 643.14 null]
+>> endobj
+1752 0 obj <<
+/D [1836 0 R /XYZ 90 618.607 null]
+>> endobj
+1842 0 obj <<
+/D [1836 0 R /XYZ 90 618.607 null]
+>> endobj
+1753 0 obj <<
+/D [1836 0 R /XYZ 227.842 561.435 null]
+>> endobj
+1843 0 obj <<
+/D [1836 0 R /XYZ 90 554.795 null]
+>> endobj
+1844 0 obj <<
+/D [1836 0 R /XYZ 90 498.176 null]
+>> endobj
+1845 0 obj <<
+/D [1836 0 R /XYZ 90 444.487 null]
+>> endobj
+1754 0 obj <<
+/D [1836 0 R /XYZ 184.963 368.282 null]
+>> endobj
+1846 0 obj <<
+/D [1836 0 R /XYZ 90 361.642 null]
+>> endobj
+1847 0 obj <<
+/D [1836 0 R /XYZ 90 290.936 null]
+>> endobj
+1755 0 obj <<
+/D [1836 0 R /XYZ 90 244.311 null]
+>> endobj
+1849 0 obj <<
+/D [1836 0 R /XYZ 90 239.828 null]
+>> endobj
+1850 0 obj <<
+/D [1836 0 R /XYZ 90 178.92 null]
+>> endobj
+1756 0 obj <<
+/D [1836 0 R /XYZ 90 131.799 null]
+>> endobj
+1852 0 obj <<
+/D [1836 0 R /XYZ 90 127.315 null]
+>> endobj
+1835 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F8 448 0 R /F100 1102 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1860 0 obj <<
+/Length 2669      
+/Filter /FlateDecode
+>>
+stream
+xڽ[[w�6~����J�D�}�fӞd���x��
Z�mn%�!)'��@JE],1�D
+$����73N
��t�����?*�d$���}bp��AB¯E�i"���	�#��o}��כ���|tϮ��\}�"�'$�H�d����N��>���|�/�N\��ǫ_�F��Q�nݥQP���� �y�C���ۯs�TgE^y�vD�
Fp�(�%T
���G�Π#�{˄�0��qr��8�
ғJ�J�]��D�N8�`� ���}�`�c��H��],�Y,BA.W�4
+��b�˧
O��e�����25yX�l^��<�8�M�dF2B��7^�}�H1l�1�V �Ѿ��H5l o��\��Z��,�TL����d��J&��

s at u]�Y^�շ��+gع�kk����W�h|"�j��y
r�0N�O��|k��l^7���V�n�eWS��U��)�[��3�5Ҁ�h,s�VqF��5���~=�6�m~ԏi����m?����+��B�BD�v��c6d�|�}	��C�`1y����'�DJ̨��"��=��]
7�n������x��u��֊����I�-�/>yJ�U�{vP
�2<�| ?hY�
8�V�]�(�\-��O�rJ��ۣ]�C�sp�d��Iqo�evW��l
�L�	������ .w
%
xogήץ����TM�v�*[�� �q��Ёq�8�'ҡ����{l��1�,����G�_��:x
 ��X��gt�w>����g�iy���XNOlU5����n3�t�uzb3��r�
�H��#=Ht����Lb��("X�Nm]�|ccWw�<�Un�;�voCgш����(
�
pj1�󒃾�7�a
+QX��
::i��
3c:�� ӓ6!4 \�H�:G%mB��_���E�mD���g��X[d�.m��z2�a/�M�S��S�� O!pr�o@�.�}��'7Җ?��-�ڤ�)z�&$�<����ߙ����^���$R>n<w�̣�JP���1�R}NE��(��/0��G���KK��%J]D'(A�Q��1J%	���
/aӲ��'Q*�Spp�1�`X#���Q�G��n� �j
GX�T� ����ҠE���73C�q���F�ͣ���Fi��

C��S��Y\��
���I��o�^�{�D�yAw�N*�0k�H]�퐎q�Qһx��E3��
Z�G&�p�o���@ыx��\��3
�3�h8Փ����1��1�Y	��� �n�=��z�~��z]
0T�
\,�t��]x9p�������� J!-Nr.
���
ct`�"
�4�"%t� +���t�Gk��������ho f������dkb���K6f
^
l�Z��g�ɧ'��3(:%�͛A�a���a:��L�|��a���7i��
�z^�lh���S�,��P�=J�ڮ��i3����ަUv{��L�y��8fUw�:_�֍4ɮF~���߭�).�3EX�"H�#L�<�f��
�ڛ��PBӄ��O��2*/I����1���
S&
��t�0l
�K�$V����������x���r
��t�`+t 7g!
m�����Н<@r_r��7I��ln˴�-4��a�"iz	�
�����
�̔(

s�C��Z �C8�	i��������PjY�)콣	�
�rW�ۤ��)���jP.C�����.l>��2p��3XT UѬ9�T'�5^B�b6�#_��CaL6�r�l@�7�v�q at NU ���O7�I$�l���))�t��9S
p}���4 }�tF$&��T�ۗ��Lܱ)��3�I�'l��Z/���7�fC����v�;
%�yg�:i�P�C�7�����
�s0I~VT�!8��/
+����ڝqi���ˈ�g=�i�FxI���M�xak��S
�K�G_
#g�W��p�kI�d+L׷n�9p�5��R� �7+��N\�q�A��0i��M�{�FM\�_
���9)�/�r���]f��a�����+��!zL��-1 �p����@
E*�^C�
+c"v���w�����!o�P���}�4�
A���9����Bs�bO���S�)$|cK
����?�
���9����"5���U�<���*˿;�Ν�~�`�!}gK|٧n�}{'��US���@T�,�|�~O&}�8^մ#qԪ)�����j:��ڪi�B�UM#sDUS���a&/ɱ�<!�S/	=R�n��M��β|^��@�ݲ����dM(�<`��ja|��q�"�1� ��(
a�l[VȋƇ�
J{b��l��� Q�q�ɸH���+��Dx��B���
�'#g��/q
���
�P!>CvY��;�ٝױ���X��kW.����T��rk0W�#����=\}�>Nw�1��#��ƀc��� !�|YMǥ��(��[�N�-H�D����� �;��R�}�@["��ʪ��<N�� �u���-�������\O)�v��öO���݊%�,@�V�
�Ͷ�Ӭ��S
�m�s��?�����+�Z~N�u�м�.�my�Ҵ����S [...]
+endstream
+endobj
+1859 0 obj <<
+/Type /Page
+/Contents 1860 0 R
+/Resources 1858 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1801 0 R
+/Annots [ 1853 0 R 1863 0 R 1854 0 R 1866 0 R 1855 0 R 1856 0 R 1872 0 R 1857 0 R ]
+>> endobj
+1853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 694.926 201.372 707.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 681.422 201.372 693.417]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 570.955 201.372 583.353]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1866 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 557.45 201.372 569.445]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [122.971 358.639 210.761 387.954]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status) >>
+>> endobj
+1856 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 149.274 201.372 161.672]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 135.769 201.372 147.764]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1857 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1861 0 obj <<
+/D [1859 0 R /XYZ 89 770.89 null]
+>> endobj
+1862 0 obj <<
+/D [1859 0 R /XYZ 90 718.682 null]
+>> endobj
+1802 0 obj <<
+/D [1859 0 R /XYZ 90 672.057 null]
+>> endobj
+1864 0 obj <<
+/D [1859 0 R /XYZ 90 667.574 null]
+>> endobj
+1865 0 obj <<
+/D [1859 0 R /XYZ 90 594.711 null]
+>> endobj
+1803 0 obj <<
+/D [1859 0 R /XYZ 90 548.085 null]
+>> endobj
+1867 0 obj <<
+/D [1859 0 R /XYZ 90 543.602 null]
+>> endobj
+1804 0 obj <<
+/D [1859 0 R /XYZ 90 447.8 null]
+>> endobj
+1868 0 obj <<
+/D [1859 0 R /XYZ 90 443.317 null]
+>> endobj
+1805 0 obj <<
+/D [1859 0 R /XYZ 90 337.717 null]
+>> endobj
+1869 0 obj <<
+/D [1859 0 R /XYZ 90 333.234 null]
+>> endobj
+1870 0 obj <<
+/D [1859 0 R /XYZ 90 263.381 null]
+>> endobj
+1871 0 obj <<
+/D [1859 0 R /XYZ 90 173.03 null]
+>> endobj
+1806 0 obj <<
+/D [1859 0 R /XYZ 90 126.255 null]
+>> endobj
+1873 0 obj <<
+/D [1859 0 R /XYZ 90 121.772 null]
+>> endobj
+1858 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F10 1210 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1885 0 obj <<
+/Length 1975      
+/Filter /FlateDecode
+>>
+stream
+x��ZKw۶��WpW�
+�`w͵ۓ4i|mg����d��H������
���d�fz�+B48��7 ��&��ϳ���?)
%(�TF��(���	~��1�����`�㻴ܦWw��˭Y���&�.���\��}uvuVΉ����^]�i���
*p|��~tn��M2��X���X$��._�N/g���#��H�h��}�
G+x�:c
}v���
���b��
�OD�
�G�S���:A�H�4��ӿ��Ί�r�D�Tx
V��x,����n��؃��o-�$�d�S�\�MP"�@,�'���uD���#
+�
��&Z�Bf�,o���&\���Qj�*x�uRl�,�:-�9qQ^���G�P�(�z6���$�
��GD��;oe�)Ne=o/o�bNE�9�������5~ �w���0-�`^�~P�uV}S���J
Z!�(��$��\�"���dzd
G
+]���-*
+�!sX�O�.� OG\$��}���M��E�g�tp�n&��kǸH��`
Eu��D'��c�(�����>'$���G��H�I�k�$�}��:�2�����
�2��$K��D��m�=
��z�b("T �l����fl	���Na	��
���j��?b�狄P;"=|@ǂ/
+���un�]�,H�8��M@��
��&=�& ����o����#C	i�|߇�,�7v��ʪ�B���`��Ò�. hX��;�����
��t
[h
+�����#vGb�a{O��:��'m�z����M�����v�s�ׯ�E0�)N�J�C%%��͜Ua��;ˠk/�7vܦs��O�����

��ė��M��
�ʗ)L���Q��QXG���B&��
+���}g�.�.v�ʬ����'G�`UZ�D�I+�Y2�
>�Z��s�Os��"�P� ���
+++0�Z?����J�>D"AП��.8��@��H|�x#���}$��H�[��0�I	cٷáA�م�p,bLQP1�6��fmKt� n6dY�����9��n��
�
�-]
`�c��
� ���pe�Օ��� '��Es��D����
K�[���b$c��
ܜ4_�#�Vj��Xo�TE��Kۅ� ��i�h.W c(���)�튂hĈ<�S`�¢�T=�$�H,	(s�
��q)�8�†��y�Ԫ��\���a�
]*����W�D
+ɣ%Z!���$�ö��iI�7��
+�
�}:�ؑ8%I��LL'�!���F{��K'"�O��� �xZ��
��|��,�)��R �U��m��v�t�,��
7Zn�*
?���7����κ,��^���Z�,��Fkc~�U��.
ڈݯS��)�Y��˫� ���

i���}>Q��A�b��[�=}Rؒ�8YQG��jĽ:6	��d��l�!���)�SS&��G�%q�&�Br �+�Tx���Ob��t�����:>��
+w?��~���D
#��8�

+�6�⬨�
�5@خ^[S����;섐��ľI�aM�䁺�
ߡR��C
0���\�vnѳ���Ǻ.�k+pW��Lh����W�@��Ζ��_:�����7�W���w0|{��9z��6��|�n�����
P����M�._�����v(���Z_���w�=9=���
����g���Qsoqb�4�8��
91ղ��lk�n����0��'5@�^J���?������ڠz\$�xDO��,B�W��)�7m����u��{������
������X��u#/�X�v�[P:�l]�.�����ECG�
+,
UH$C6zv��^w�ٽy��7��&L|�צ\�R\�W�+S~g�=���4�5�U�,+ B��I�+���Ah�` ��4��}�#jF���>�s���Ԟ�����/^\�n*�� ��q\�?V
+a�^|�p�-��K��˭�	jҮ��`
�6
1��
����
�?6�/^mYtR@\�7
��+p
+endstream
+endobj
+1884 0 obj <<
+/Type /Page
+/Contents 1885 0 R
+/Resources 1883 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1801 0 R
+/Annots [ 1874 0 R 1875 0 R 1876 0 R 1877 0 R 1878 0 R 1879 0 R 1880 0 R 1882 0 R ]
+>> endobj
+1874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [95.231 693.377 201.372 707.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
+>> endobj
+1875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [95.231 593.316 201.372 607.264]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
+>> endobj
+1876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [95.231 468.066 201.372 482.014]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Domain__Error__Exception) >>
+>> endobj
+1877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.841 339.544 249.291 349.472]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+1878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 282.358 251.513 292.286]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status_a417470c5917175d267ea3ec71df18027) >>
+>> endobj
+1879 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 253.205 253.715 263.133]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1MIP__Problem__Status_af2bdcebf7178739216e2dc7f5c421c9c) >>
+>> endobj
+1880 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.841 179.391 249.291 189.319]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1MIP__Problem) >>
+>> endobj
+1882 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1886 0 obj <<
+/D [1884 0 R /XYZ 89 770.89 null]
+>> endobj
+1887 0 obj <<
+/D [1884 0 R /XYZ 90 718.682 null]
+>> endobj
+1807 0 obj <<
+/D [1884 0 R /XYZ 90 684.012 null]
+>> endobj
+1888 0 obj <<
+/D [1884 0 R /XYZ 90 679.529 null]
+>> endobj
+1889 0 obj <<
+/D [1884 0 R /XYZ 90 618.621 null]
+>> endobj
+1808 0 obj <<
+/D [1884 0 R /XYZ 90 571.996 null]
+>> endobj
+1890 0 obj <<
+/D [1884 0 R /XYZ 90 567.513 null]
+>> endobj
+1891 0 obj <<
+/D [1884 0 R /XYZ 90 493.371 null]
+>> endobj
+755 0 obj <<
+/D [1884 0 R /XYZ 90 391.199 null]
+>> endobj
+206 0 obj <<
+/D [1884 0 R /XYZ 90 383.813 null]
+>> endobj
+1892 0 obj <<
+/D [1884 0 R /XYZ 90 301.004 null]
+>> endobj
+1893 0 obj <<
+/D [1884 0 R /XYZ 90 301.004 null]
+>> endobj
+1894 0 obj <<
+/D [1884 0 R /XYZ 90 270.117 null]
+>> endobj
+1895 0 obj <<
+/D [1884 0 R /XYZ 90 221.991 null]
+>> endobj
+756 0 obj <<
+/D [1884 0 R /XYZ 90 126.965 null]
+>> endobj
+210 0 obj <<
+/D [1884 0 R /XYZ 90 119.578 null]
+>> endobj
+1883 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F10 1210 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1902 0 obj <<
+/Length 1261      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6}�W��La��t���Q
ٮ���N�CQ�Ĕ�
�v���H�,�N�t�b@ �r�vHckfa�m�qop`+B�O}k|gE�
+�y>��Z7�����w�CD"���������J>�
�{�=��E�����J���GlM�����B뱽�[.e�f�U��
֮`D=���v,d��Q
\4'��4q����A]�t��nj^�n-�up�w��,���G8�`?P�m�JLb��]��Y7}c{4<�����g[������UߕV)E�K�>	�LY
�E��_�:-
@�a;��*
����UͧH�Y
�F��,0��3�	�>@��
~�:N3>UQ;�U"�Ek�
b#T��!w����Iƕ�%��{��S^��JI@ꃯ��x���e�伨;Rw�P�zn������!؎��\�u
B
+�27���ʲҡ���3u�c��7k0W5��c;j at g����vѧء�~�v�]����<���1� In䯲��,b���;�x~A�@F�Z_1����Lu| >8Gh�+`��
B�9��-�)�
��^�S�S���҉�!����������t�Rz��šP�?��[w�X9I� ��f��0${�͠5\?ذ�9�
�С�Y\Uj{��`�q����[�һִK������},!?�?&��t#
+Q���v��a1�"���˦�.�Kc��YX�+w�\�|
ڟ4E����~�,��2���l�5c<|<dfNd��/��! �E��P��;������*	ȡ�����R�kΒ�P���TN K�b�_�s��+���+O��<�����IYHV�5�(i��GҢn}��5(�(�
�LR`�ʨo�@��@���
oR6���U�~��-����?ѣ�=��1{���u|II��^�Rꢠ�[�r�
_�����
��v��l58��������k�o��F�Bfn���F��6e�� r���_T���
�
��
9Jρ�хĨ&̝ZU-e�~�~^?-t���%.t7\;�F�ONK��N���R}^����w1����%�a�rn��O<�w���V��x�*م��E�W
���g��VU���W�OQ ����*��P�Q�9}%�I��aw�>42�`0̙uT����>����-@U��
����tq�^m�u'y{�>.fM<��@��%�D�Uq��y���(.�8s�)��Q->���2���3�u���Pp�Y�=��Š
 �
U�^�
&ͬ��
%���Ju%
���.�7/�ƒp�ǝ�U��h�()
+endstream
+endobj
+1901 0 obj <<
+/Type /Page
+/Contents 1902 0 R
+/Resources 1900 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1801 0 R
+/Annots [ 1881 0 R 1896 0 R 1897 0 R 1898 0 R 1899 0 R ]
+>> endobj
+1881 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 683.928 187.833 692.775]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Optimization__Mode_aed6d879ab6fa6e6dea28b6841058c848) >>
+>> endobj
+1896 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 409.955 224.515 420.859]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Overflow__Error__Exception_a3c4ed48495c48bc67b46023bb0b62828) >>
+>> endobj
+1897 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.594 126.084 156.032 136.988]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a0f022d23c55748a9e437e1625149bf5a) >>
+>> endobj
+1898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [123.594 93.47 167.091 104.374]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a35e4df2723c110fbdadbcde7fe9cfae0) >>
+>> endobj
+1899 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1903 0 obj <<
+/D [1901 0 R /XYZ 89 770.89 null]
+>> endobj
+1904 0 obj <<
+/D [1901 0 R /XYZ 90 703.224 null]
+>> endobj
+1905 0 obj <<
+/D [1901 0 R /XYZ 90 703.224 null]
+>> endobj
+1906 0 obj <<
+/D [1901 0 R /XYZ 90 646.008 null]
+>> endobj
+757 0 obj <<
+/D [1901 0 R /XYZ 90 546.742 null]
+>> endobj
+214 0 obj <<
+/D [1901 0 R /XYZ 90 537.193 null]
+>> endobj
+1907 0 obj <<
+/D [1901 0 R /XYZ 90 431.308 null]
+>> endobj
+1908 0 obj <<
+/D [1901 0 R /XYZ 90 431.308 null]
+>> endobj
+1909 0 obj <<
+/D [1901 0 R /XYZ 90 375.819 null]
+>> endobj
+758 0 obj <<
+/D [1901 0 R /XYZ 90 245.247 null]
+>> endobj
+218 0 obj <<
+/D [1901 0 R /XYZ 90 235.698 null]
+>> endobj
+1910 0 obj <<
+/D [1901 0 R /XYZ 90 147.437 null]
+>> endobj
+1911 0 obj <<
+/D [1901 0 R /XYZ 90 147.437 null]
+>> endobj
+1912 0 obj <<
+/D [1901 0 R /XYZ 90 113.089 null]
+>> endobj
+1900 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F22 1036 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1931 0 obj <<
+/Length 1474      
+/Filter /FlateDecode
+>>
+stream
+x��YKs�6��W�V� ���ڤ��5��N/IFCQ�D�$�q}/�Rl�I,M���K��~��- co�a�����{)J#y�^��8L��m��	F!�c�o2Ye�MSޮ�Rf�X�L�1��, �׿���a�;gJ9���Y��L\
+��u.�iBR�G$�x�j����ӄ�}�#�
���˫����[��+#�&ލ�Ty!e�,����l]Èr%��u4a;���d)"���ˊR,�V��[��b�M�
t*NN�1t؛���]�w��&+���K��
P�ge/����v#���<�zi�BS)�J
�QDC����,�D��,�.����uS.[���/�B��Q�X�o�M�W��2
�
�l�
�ot�ٗ����:g�l*��p��e�,�)���1-ų�z$B!K t
��}��oOz?��� �ù��2��3y+�t�A~��S�
S���(I*�/����
O1��p_0ēx���#H����76 at 9���\��O1/L�D?�2��ߐ0�D\	
����1C�OcK
�-�-��Q?

J<	ٓ��h��R�	oFph�q�	"pf�P��2�є2��}t4*�
*8c(K��R�����]����:Wuڢ�R}�E)fF﹪��80��@�^ߊj!��O��-�v�;͊����O��c m�)�+���w�2K):��~�(a(䠆���
�:wAA
�
���K��J)���u�Wٲ[
MvG�q�c�#�BQ	�\�$U�N��	�@�S���AK�C�� 1�|�j[��@3��֯`����9�
P=7:�C|
+�ir�ס`| �,BJ{
+�-��u;!�!՟�E~���8�]��������y�]A��� 8��D��z7F�1�����Ur!���9����3���Ħ����Q��~)��tE���R
��2�j��0]���xXjmǏ�~睼#�C���E��gk�Yv/'1�u���r�����!Z���fm#p���~Z6�ڤO7�*DK!$�^��]��ܪ�#jiE�h�O������0���\�v�(��B�Hj⣄��;#H�ypT#U�����TE5�v���UB��|�{7{xѣ��UJT!PO؋2F�nc�DK\����M#���C�
��E
+���u�t��+ʽ�m�H1���5�p�*@
`S(� �m��.�Ua���
,����M��S�}-�xA�jG.���f�
+A^
��
Xllr�8h��:�D��p���ߌ��[�2��l|�p�~�x�����<q�?�
�I��ohV���hz��S�[��7�4
�
{ïo� "��,�w�a�8�߾c
���e�9tg���Vv��к�̹
z�
+���V
�۬�
T*��
�
���LHT���oؽwMg|����ZaIG
P��7�����<;9Y�V�+�7՗%p�q
��};�vt��-rW�~�	�"� �|�`�I
��cY��>�'/+�h .w�{�xIu~
+endstream
+endobj
+1930 0 obj <<
+/Type /Page
+/Contents 1931 0 R
+/Resources 1929 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1941 0 R
+/Annots [ 1913 0 R 1914 0 R 1915 0 R 1916 0 R 1917 0 R 1918 0 R 1919 0 R 1920 0 R 1921 0 R 1922 0 R 1923 0 R 1924 0 R 1928 0 R ]
+>> endobj
+1913 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 484.191 263.464 495.095]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a65283b563ec02a47928cc176c738f78b) >>
+>> endobj
+1914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 459.966 257.925 470.87]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a4e5e7fc32bfd0ae986d63ec82db62f6a) >>
+>> endobj
+1915 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.068 396.092 247.464 406.996]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a0c349132b447b3e6a5234a23257f417d) >>
+>> endobj
+1916 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.068 370.248 248.022 380.778]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a6b7d95f94c10fe3747eff2a3e05f9d32) >>
+>> endobj
+1917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.068 344.03 256.072 354.56]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ac555ee6fa79c8a4d49f8ce2a14ca1cf6) >>
+>> endobj
+1918 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.068 317.812 240.819 328.342]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8876ac784666f054f546f48404cb27a) >>
+>> endobj
+1919 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.906 291.221 233.078 302.124]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ab6bcd066e77a3dde5c6127ac6dfabfa7) >>
+>> endobj
+1920 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [201.906 265.003 231.006 275.907]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ae763a3d0db8c57898dff5ba199ea87e5) >>
+>> endobj
+1921 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 201.129 287.823 212.033]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a805ae2717e65749d104d71978ed97fa4) >>
+>> endobj
+1922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 165.945 304.969 176.849]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a8ac14db1f77aaa2e88fb7148633f7e) >>
+>> endobj
+1923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [188.068 141.719 268.086 152.623]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a08c3b1c1c4e916f10c85114ac888c040) >>
+>> endobj
+1924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 115.502 291.13 126.406]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_af46aeb04c5a5a83a60ddf1a280c8b648) >>
+>> endobj
+1928 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1932 0 obj <<
+/D [1930 0 R /XYZ 89 770.89 null]
+>> endobj
+1933 0 obj <<
+/D [1930 0 R /XYZ 90 721.073 null]
+>> endobj
+441 0 obj <<
+/D [1930 0 R /XYZ 90 615.019 null]
+>> endobj
+222 0 obj <<
+/D [1930 0 R /XYZ 90 608.025 null]
+>> endobj
+1934 0 obj <<
+/D [1930 0 R /XYZ 90 526.12 null]
+>> endobj
+1935 0 obj <<
+/D [1930 0 R /XYZ 90 411.328 null]
+>> endobj
+1936 0 obj <<
+/D [1930 0 R /XYZ 90 385.299 null]
+>> endobj
+1937 0 obj <<
+/D [1930 0 R /XYZ 90 359.081 null]
+>> endobj
+1938 0 obj <<
+/D [1930 0 R /XYZ 90 332.863 null]
+>> endobj
+1939 0 obj <<
+/D [1930 0 R /XYZ 90 306.645 null]
+>> endobj
+1940 0 obj <<
+/D [1930 0 R /XYZ 90 157.144 null]
+>> endobj
+1929 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1956 0 obj <<
+/Length 2393      
+/Filter /FlateDecode
+>>
+stream
+x��ZIs�6��W�6R%�����2�x�{��'vN�]*J�,VS���
�����͒"ǜ���o����y�����ɐ���6�8��D"��M�q����
cDd����|����wz�����W�p@�~��8X�>~���?1O�}�)��,����v��Ha_$B"Ž�D����0�ۂ�
�񬪓:]�T�Y�9��93e�
�ϊt��j��'�/��~�R��N��h�1��	
�浥��Ժ�2x��^��<�A��kU(E!'��0;ߩ����ҳ6ۢt���������+*�-fJ���&��a9g�L}mR;���{Oi{�v(r��i���}�x��m'��#�9:�E�����Ju�a��x8������	�X�)�{I=��;=;�:�y�^�Re�
j����������Q �>��
+^|;��Z'��,�T����mUuӋ�\����zy�+����]p�^u��:�g�Ӏ��6�BTh������O@�<��`
�HZ�	F
#2_
v�^�I
+>
�i
OպLF�3'��l"�L�s�gIUyE�L��4��Y�*��y���\�{m�|m��}�/
���&�i�گTi��qD�VźكK'/�r��跶�|T}�����7��!)���\A�?\j蹄�"�6�0)��
+��&��-E6'd��S���#I�$�#�$��<_ij�y�p�Mr�
L,�B6��
E��3:;o
� 
+9�Abd�G� ,�p�����Kq8�  ��p�1����1.�qO�4�g
� s�}�`�0�-��t>�
��,�s�0��	����� j
��
+����"sgf
�!�M����.Q�����l��]�q㦪�h���x��B
�%�ڠ
�"�X��+��uL���ƒX)��
M���Tp�@�|)Ѷ,��̑��^=C���h
pH�_�����P�o|�bt�b!����A1��e��`o�1A�!�إ0F�p������
+��	6�(�J�9
�r!�Ed��&C�0�	c���1ЃG���E<��O����1�O��9�i<�ݤ���X�a�
[��A1�mQ
�O;��ќ@b\~qOi��#+

:<��i9>�ʇ��
 �l{�&S��
�L���
��$��G`lm�
+
[
p�i�M�����m��]�]	�i��t����_��_z��~�&Z-B1�)��b��@�S
f��`�T�6�[�!�<�5
+�
8�Ƒy:�K��h=�$��7�.����a���$�mX��]]�X�SA�
AD�tO���	�
������4�c�0
�MT ܂�j
+Q J4咨 �-��$"�a�8
�0�
+�$�}�eYz
+�cpy߽�Y(M��:o�Ǫ�2vK*都��j���gVNl1�d�1Yo 3��R���P�nL��4��p�
v�HV�·��	�,O��uoY9l%ҿC���*�@���e��WL�E�hSHX6蟔e���v�i��Uѫ��9dzo��e����7��3
�43��tS��Q]�����4i�-��&8�V�

�J���GEY�	=Tv�f�0hw�vWV_����`i۔.�l�.� @`�
�� �z 1����0H#A���o
�E�JQ�2�(���gx�P�S9b����]�@]�S���\�
G�u7��w"F"�a�R����3�؁�"
�(�/�|�S�!w�$�p\w9̷�yy�o(�$�h
%��#�-��6ܜI�\��ޘ�G'�n��������Ӿ���W�6%+�]ɺ��_%zu�ݵ�!7gEҵTE��!ot�����R���H�!Շ 3�{P��T+ ě�.4��T��M�n��`
�.t�[�޵-�#�'����=��Rϭ�=�t{��Ot��.J�<���De��hf��ou�����	�i�TV
슗?�/bL���~���b�N�'��1&�k�I*/�1�O�
b
a#���1D�)D�1��$��x����C	������K���D�r�۹�Q������%��)鮡�H\ሆ�$L���L��\I`4�@ ����@�>���:�
+��5E� N��h�,�{���7��6���=���
PGC���q�
J��0��yx2���ʾ�ȚZd��\�UUپ
<����>�����M�� �I�{M|7U+wWQ��s�q0�(F��۠�}�
]�2����M:t�ʎ��)�$
+�
����n���}���IQ���E��M\�߳���u�@o���"���]s`����~��!х�ξ���M����>�5^�vS�V���.�J���o�v�^Un' �b�D��r��|i�����uj�
+�������������*@P_�ān�nd���m��c߻��b�;��DC�
+endstream
+endobj
+1955 0 obj <<
+/Type /Page
+/Contents 1956 0 R
+/Resources 1954 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1941 0 R
+/Annots [ 1925 0 R 1926 0 R 1927 0 R 1948 0 R 1949 0 R 1950 0 R 1951 0 R 1966 0 R 1952 0 R 1953 0 R ]
+>> endobj
+1925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 708.331 243.549 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_afb7d3612f1ec7e7432a4168ea245f0f9) >>
+>> endobj
+1926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 682.603 251.29 693.133]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) >>
+>> endobj
+1927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 654.509 300.554 665.413]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a5223af806da56cfe9a7c6ed71b4a0604) >>
+>> endobj
+1948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.062 629.155 308.295 639.686]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) >>
+>> endobj
+1949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [227.82 343.538 335.356 354.442]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) >>
+>> endobj
+1950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 332.205 210.548 342.103]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a65283b563ec02a47928cc176c738f78b) >>
+>> endobj
+1951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [458.893 172.038 513.996 182.942]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a8ac14db1f77aaa2e88fb7148633f7e) >>
+>> endobj
+1966 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 160.083 155.753 170.987]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a8ac14db1f77aaa2e88fb7148633f7e) >>
+>> endobj
+1952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.473 86.288 424.869 97.192]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a805ae2717e65749d104d71978ed97fa4) >>
+>> endobj
+1953 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1957 0 obj <<
+/D [1955 0 R /XYZ 89 770.89 null]
+>> endobj
+1958 0 obj <<
+/D [1955 0 R /XYZ 90 698.405 null]
+>> endobj
+1959 0 obj <<
+/D [1955 0 R /XYZ 90 644.958 null]
+>> endobj
+1960 0 obj <<
+/D [1955 0 R /XYZ 90 598.491 null]
+>> endobj
+1961 0 obj <<
+/D [1955 0 R /XYZ 90 536.717 null]
+>> endobj
+1942 0 obj <<
+/D [1955 0 R /XYZ 90 513.523 null]
+>> endobj
+1962 0 obj <<
+/D [1955 0 R /XYZ 90 513.523 null]
+>> endobj
+1943 0 obj <<
+/D [1955 0 R /XYZ 169.73 432.441 null]
+>> endobj
+1963 0 obj <<
+/D [1955 0 R /XYZ 90 425.801 null]
+>> endobj
+1944 0 obj <<
+/D [1955 0 R /XYZ 215.131 334.736 null]
+>> endobj
+1964 0 obj <<
+/D [1955 0 R /XYZ 90 328.718 null]
+>> endobj
+1945 0 obj <<
+/D [1955 0 R /XYZ 90 248.986 null]
+>> endobj
+1965 0 obj <<
+/D [1955 0 R /XYZ 90 244.503 null]
+>> endobj
+1946 0 obj <<
+/D [1955 0 R /XYZ 267.991 163.236 null]
+>> endobj
+1967 0 obj <<
+/D [1955 0 R /XYZ 90 156.596 null]
+>> endobj
+1947 0 obj <<
+/D [1955 0 R /XYZ 484.685 77.486 null]
+>> endobj
+1954 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1978 0 obj <<
+/Length 3116      
+/Filter /FlateDecode
+>>
+stream
+x��Z[��~�_a�2���N�A�4)6٤�d�.�
��%G�w2��=��f��3�}0L�����|�Pxv?ó�^�����
+�R�J*g7�Y�g��HHxZ�>$#��
�1N�Y��n���qcVUv��窱z�+���9����S��sއ9
*p��6�k��ɬM5':1�����$�l��滫on�~�"��Ϗ@Jϖ���l���0b��=�I��
������~���0��6�_بf�����Q$�^�&k�%��HR@���Osʓ2_٧ �c�)UH�`8=�:E�N[�لU��j�+�����Kxbu�V�Y]1��pu�pd��\
+{� �i90*���0�aSF��&�E��B�_d}��送�#IԦ9f����
8H�
yU�r�E��XY���ʂ�
��Vf�װ�7�b~�K����o��z4��^�$@$"P�S��	���� t���hoР������G'���~+�K�TJg
J�ڿ��i�Cj6�7���ij�i�Y��CmV��.CW�
��2�.[�U#�p� 
+I��-�n=��U���
�O���8!����ԮŒfN�MV�˚
6�
,W�ٔS��}���on��ks�4gq�O�v�sk[�ٮ���c';��eg_XG����}ٝ�
+�4��%P�T��a�AX�@o6��
QI at s�	�Q��Ѧ#�lOe�CU�Ž��CqW
������u��t��#M
��@���MG���p�U�*�ƚěV�z[iuتE��;�<��8�
0U7+�2�LQ��yȷ��~����&*?����^�ٽ�CTt���M�|*��q�G�cA5�qpT#��]�c;�]l��9=�SLg�0$�xml�)q�8gwN/�<wNF�?3�s8�
�b�;'|��Y�
P��aA�hɆ,�
ᵺ�
l��r$�&ߙ��x�
aV���,}-I��em��D�� �.�.��(���ɜk9����
Փ���Z?�z/�yY�F��6���4m|^��mpJ���2ѵ�3'"�}_�h���
x�l��xA�M�v5���
��"i�Xg,!���Cz����Q?h��)��8��9�DSYQG�K�4�	j��I`p� �Uo��B�BX��` �
����"��+�6��T
�q�Ɠ����
�'V�l�Ҫ
pZ�ڏ�%��[�'dk�����r�'e���7�²#�\
�/��u�7�ow��<���n�|�lC6~_��ŵ�&̿MU��2D"�r�>��0[���\�~)��sj<��`�_�IA�ٯ�����q�(}˟�m݅
p禪{�l�Ց�k^Q&�N](?���-0���f
�Ғ�d�v�ɲ
4�loQ��όB�g3��N宀C�n
 ����lj��^0�6�`
ևbi��ƿy�߬�9 �81
N�
qu��'렇2a`��E�7~��o~_��
'����i+���_f� 0-�&��T ��h���ĕ]&9����u@
�.�>>��&�E�N��ʾZ���%H��{B�I�	�������w=����*gɒi�H��;r���04��m�Ȣ�.�����W�����$��G�;٫��A�N���
+̉3��z5Ɨ	-)
����������τ��]�
�)$.V�,��^����d���_
� �K5���Fȿ��*��� ��˃
,",���	�ax�jS��i?�v���h
ġ�����1�c�"鳋��;-�A9�I[R������7͛����#l��Y�p��ʞ8�&/_�$J"��S%�,B5�r���J�άrJ��Zr�m��	g&�����e�.aD�m�l�S�
�-�q��F
+��g+`g���	5�)��7/�n
+�q�m�Zy��`5�Њ}�
�i��
R
[
�Cy`
� �m@� :�����$�'��D��C�������� a�":Pv�(�����!9^F ֖
i4��=Ŵ�a
+n����)AS����f�ゎ��F��}lv�C���r�+�C`o<��2@ۄ�l�	�l�����L�v
�ͣ��N~B�·���� F���Q�=d��P
z΄␂c�B ��f@\�8s@
��P<s{�W
�Q����S����qx*F8�.p8���1
���{��[h�h���mף�&4���3JG���~�ox
+k<��
+
�|��Ϫ�@\�bV�\,c\
+Q�*\��+�Q�
4�D��p��zFS��`ц[�
��Cc���
+j�cv��6`�&��[(�v����;<��
|.fTq��k��.[{�H��3�a6��܋S�R���yгs��$�<��j���V�
#�VZ��5- p��Ӳ�;
�Y��o������(Hz>0�`*�u���{Q����9@�&��ܗ������i��B\�&����r
d�1K�p�����|&���l���lN����ϐ��iz�Ǡ�?-�vy�ɘ�}�G��C �X���6�F�]VLH� =�s�����W�_Us����
��!I#z����H1G�K
+� zG�b
����:�j���8�M����L<���P_&��5��F�=}gW��G��,�Yգ��`�y=�atu�&՟sT,EL�B3��!loz/k�/'�<_E�v�4'���Lz�q ��k�zUŕ4O����q�1K�$3�ڻ
�0���	�:��w۲�������#"�1�1�
HǗi�&Awf�
l��-��`C�]�G���`
�!�������q1r�>
f�P�Z(��w�S8mo\�%Z�>q�2^�B�,����2{S�b��w%
Wp���Ƅ
+���
+��ٛj]V��Q^�o����bʚ�èPI���=�o�l�	L�R�mY�`�˘q���߇)�:YW��y�0w
��޼*�]xQ��}�˛���~�K �;�Ǻ1�7]�o���e�%���� 
hQ�<���F�
+��
VH�z�
�����w�*�z-��>+��}����p
]�Ԧ��\�$�����+ Ԫ��TH����~�
�~6Ѳ�^�����n��b�HW��4���o��
�kS�#�q)�{Y)�����
+�e估j�
�K��Ec�=�F��~
����o���b�x�n�f)�\:�N��O
+endstream
+endobj
+1977 0 obj <<
+/Type /Page
+/Contents 1978 0 R
+/Resources 1976 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1941 0 R
+/Annots [ 1970 0 R 1971 0 R 1983 0 R 1972 0 R 1973 0 R 1985 0 R 1974 0 R 1988 0 R 1975 0 R ]
+>> endobj
+1970 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [325.99 480.941 429.602 491.845]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
+>> endobj
+1971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.138 468.986 513.996 479.89]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) >>
+>> endobj
+1983 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 457.877 150.772 467.551]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) >>
+>> endobj
+1972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.511 359.326 363.123 370.23]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception) >>
+>> endobj
+1973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [470.161 347.37 513.996 358.274]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) >>
+>> endobj
+1985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [89.004 336.262 228.481 345.936]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) >>
+>> endobj
+1974 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 218.618 201.372 231.016]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1988 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 205.113 201.372 217.108]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+1975 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+1979 0 obj <<
+/D [1977 0 R /XYZ 89 770.89 null]
+>> endobj
+1980 0 obj <<
+/D [1977 0 R /XYZ 90 721.073 null]
+>> endobj
+1968 0 obj <<
+/D [1977 0 R /XYZ 376.044 635.513 null]
+>> endobj
+1981 0 obj <<
+/D [1977 0 R /XYZ 90 629.495 null]
+>> endobj
+1982 0 obj <<
+/D [1977 0 R /XYZ 90 560.299 null]
+>> endobj
+1969 0 obj <<
+/D [1977 0 R /XYZ 155.355 460.184 null]
+>> endobj
+1984 0 obj <<
+/D [1977 0 R /XYZ 90 454.39 null]
+>> endobj
+1986 0 obj <<
+/D [1977 0 R /XYZ 90 320.371 null]
+>> endobj
+1987 0 obj <<
+/D [1977 0 R /XYZ 90 242.373 null]
+>> endobj
+1976 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R /F60 312 0 R /F24 309 0 R /F84 438 0 R /F11 395 0 R /F8 448 0 R /F10 1210 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+1999 0 obj <<
+/Length 2077      
+/Filter /FlateDecode
+>>
+stream
+x��Y[s۸~ׯ�[əƅ$�}��l:N�]7q��

DBS^^⸿�7��d�N�mlB���� ��
�����vq��c/EiLc�v���a��~��?�?n_{,NIcX��?����/�޾W���.>-��
1�#�/���^��
F,M�;=��B��Yz�_`���D4RC��
+&l�`�"�C��
u�0ꋶ.����իxj#Iǩ���44,nw2X2
�w���z3�d�u�U�gљ�P�5õ����A>
+�q�����z�{��E6��
B��!��~'[9�
+���
��<�R
++���苦
��IY��`oIJ#�^B�d4D��]+�]S�槨sGד�/�~�!fM�z-mJ*e@"�K��q䃝!
�;��ͫ;�i�u&�P�r0����B��e�i��LuF�p�*r�'�E~oH}c��Tb
+
M�ٹ��3@�����f8:DMu��
xS������G��
h,������TD�X��Gت���7HO\� w!���$�Ԭ�Ɇ
+�e#�H��u�T��QV����}ale-[��ܮl��H�MS�������1���aV6
�Q�Б"ƘQ�wJ�����e�����)�w2o��M�nEk��(�Ta��
+\W�q
U��t�Cad��`�`I0��+Y��C���1�P�!��>������f��A9B5�(L���
񍅧�)�(�g�OaLY4�_j���7~�	����~_@����"C�<*q�,�Q�WC��D�����J����Cu(���/I��.i��Ns���FM
?*o��{v{���)�l�qFQ�E&;4�&�\��z���@����-'�
5��m�Qf=z(q��FPے���@;㑷�Zk耱s[����U"AI�@!�h�[�wǥ����uT�"
����K@�8ԉ@!�)�4D��D�i(
�N�FV���
+�G�`dJa�2�� �
+L
��4En�q�ɊN��C(��
�<P>~�w���nt�~��
t�(
��^�dˆC�r�nf�L�Ji�&�.u�#Y|<�"B�Z��� حR�m��Gh�4��ԗ��J��*k���f��w�ZS}Gc��F���<�4��G�v�7
���f}q�\�����E}R=�/F�
�[1d�����(�Ľ
�VUm�̕�.G��(R`�A�s1•��*�?%�s߃�l?�Y��t���Z*�ݺ�h�<ͣB���N��w�@�o¶'�K�1!�9��R���3�I�6݋p8�2[m��
�dø�P%t�� (O�>F�ۗ6��ߧ r;9�B9uK�
z��qg��:Ml�?����hP��0
qR
L��$��MzQv�L
���v�p��0�z�k��橚�C/�f�g&crԢ�jy�C����m�7�.Q��ߣ��ʖ���>("wT|){Q�.�/e�����	>
+%�s�#��X����w��3�Jm(Mk�=�dʄ�\��{Cܙ�{c5JY��U
��v��M��Y~��wMnբ��	
����!B����\v�7�*��j���8
BA�����]q&�͆s�m3cv�2�����ܰ��|S��Y����?
���$�w�؈qv�NQ��'��
+(&�fE8{ܕE
�>����
���
ep�x���O�5raG��>��1�>�t�8�ͤ���Tl����9Ć� =i]!�6,SB�����a�pS�*����i�
���'��S
+%����
>9���\�^:Ay�(E	��ʣ�c��j��w�V_QO��[���.�
W掶iZK7��Q_
��-}�N,ԗ�^�-'���ÿ��j9�͵�A���g�A�����2�З[�[�#2a7ui���
yo.�U���c�3Z��lr؛�s�>���k��;��OU1�2e��T5Yr0I���&�S�r:�/�K������fvK�<0�e
^�Qʡ�T-�	��Ι3��yc����F��Al���S����_�(�ߊzp%�Je��Ca�ط21�  �����Ř��ڿ-tJ
� �b������ö��e�
l�F�Ŝ#|�v��T�Rt� ��o�� 9

+endstream
+endobj
+1998 0 obj <<
+/Type /Page
+/Contents 1999 0 R
+/Resources 1997 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1941 0 R
+/Annots [ 1989 0 R 1990 0 R 1991 0 R 1992 0 R 1993 0 R 1994 0 R 1995 0 R 1996 0 R ]
+>> endobj
+1989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 480.485 182.174 491.015]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a940d4cc630004e148b25a81010b12d61) >>
+>> endobj
+1990 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 453.846 184.485 464.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_ab8e3183f9373557491bf9d9cee30548d) >>
+>> endobj
+1991 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.383 427.582 263.817 438.486]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_aa348a444933ae006cd061eb2a01af5b7) >>
+>> endobj
+1992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.555 401.317 236.709 412.221]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a52e000efba75d51e7891f8e9da8e4e1b) >>
+>> endobj
+1993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.555 375.052 183.578 385.956]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a054857677ca99c51342e420e9d5bad9f) >>
+>> endobj
+1994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 349.161 177.83 359.691]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a0861934c38d4b7e0432b6ba71a40df2d) >>
+>> endobj
+1995 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 281.722 191.678 292.252]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function_a661ab4cd615864ae392638259f9c58da) >>
+>> endobj
+1996 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2000 0 obj <<
+/D [1998 0 R /XYZ 89 770.89 null]
+>> endobj
+802 0 obj <<
+/D [1998 0 R /XYZ 90 605.136 null]
+>> endobj
+226 0 obj <<
+/D [1998 0 R /XYZ 90 596.008 null]
+>> endobj
+2001 0 obj <<
+/D [1998 0 R /XYZ 90 498.29 null]
+>> endobj
+2002 0 obj <<
+/D [1998 0 R /XYZ 90 498.29 null]
+>> endobj
+2003 0 obj <<
+/D [1998 0 R /XYZ 90 470.291 null]
+>> endobj
+2004 0 obj <<
+/D [1998 0 R /XYZ 90 417.761 null]
+>> endobj
+2005 0 obj <<
+/D [1998 0 R /XYZ 90 365.232 null]
+>> endobj
+2006 0 obj <<
+/D [1998 0 R /XYZ 90 299.527 null]
+>> endobj
+2007 0 obj <<
+/D [1998 0 R /XYZ 90 299.527 null]
+>> endobj
+2008 0 obj <<
+/D [1998 0 R /XYZ 90 254.703 null]
+>> endobj
+2009 0 obj <<
+/D [1998 0 R /XYZ 90 169.613 null]
+>> endobj
+2010 0 obj <<
+/D [1998 0 R /XYZ 90 146.613 null]
+>> endobj
+2011 0 obj <<
+/D [1998 0 R /XYZ 90 146.613 null]
+>> endobj
+2012 0 obj <<
+/D [1998 0 R /XYZ 312.673 77.486 null]
+>> endobj
+1997 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+2020 0 obj <<
+/Length 1450      
+/Filter /FlateDecode
+>>
+stream
+x��X�r�6��+�+9S�x �]Z�
�I�&�*�h(	���@���}/�H�r
��3]�@�s_�

+� �N~��\�$8�H
+*��u q��qw��CH0�i4%�p��2�����V�t6/���(�!�����j��󺚿�W*�R�ß�l���wj�tD�PUK����P���ݫ�/w�/�p@,��4X���p��ǯ��L��fSĔ���O��`�
F�����|K��7B!G��ȻWeM~��iX��Ʈ�ӧ )��Ss ��1��Tv`OaQ� Β6rDHh���8AX\�:��u��h���"�!����a�g�) �!��x�9�ss��
*��ަ�#�8��\�T���b�4A������20%PJb�$�/_MW7���B$�0�N�[�k[���<�����Y;��.w��R1��Z����
+����o�4�=�DpĈ
93�ǑL��G{�V�AW�l޸�}Dy���c�)I�
�hH@��CC'f�R؛m�����^��9ψWU7�nU�Y^�͝�	�$�� �~�
	��o�x�U�<��j�#�u���ޅ��F"�n6�R:k�Gk]����뢨[��憑�Q�B�+T�Yj���Ֆ4�|��Ô����ظϻ���E��Ͼ4`S�:В�sj��d
�R��DA�0E�%D��ǘ�!�&'L��@�#Ԝ���i�	d+by�֔��=��K�$�2(C��!
+?�b�IH�%L3�"NGp�8�X��Pi3�cYJ�S#��z�Qd�t�٢�TF=f�6�f���ñ3�
��a;�V[��&3�Ĵu�mtV��� ry

+�a������%$
"I�8MLF�@�I��4[�k��=��-�
�kH�91�ߘzcӞ��R;�b?�f���ȗ6�oT�Pڮ=��tw�ގ���0y����4�;Z��9���u���E��|RV}��ym�͋ռ�w��cQׅ�\�@����D(
}u���"6}I�h �$�`]}ן�]�6�ODž6�\-��6�P��4�J����sw�bs"���N����M?l����Ɋ�s ����a2F{�
2�$��I63_OO���G���
���K�)t�W}Ϳ\Aɯ�
�@�;�0���0mF�?0�rM��̐Dč�k�dy�O�V���w�g�3m��cz���11_L갧I
B�j����iϊ�w)�K��J�o����E at 8��13�T������س�}����T�6��B���
���V0�]��t� H�~�������������
��a"(J�������B |��c~� .�QÃ}�x����uVm�F
�צ۽��s�����MV
<9�#�v��>�wZ��
@p1�+�6��_���mb��
P
�z���6������٫j��@5'�?����ts������������=�܇�c���>�N�a�ֽ�o�������
̻�
+endstream
+endobj
+2019 0 obj <<
+/Type /Page
+/Contents 2020 0 R
+/Resources 2018 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1941 0 R
+/Group 2014 0 R
+/Annots [ 2015 0 R 2016 0 R 2017 0 R ]
+>> endobj
+2013 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1PIP__Decision__Node__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 2027 0 R
+/BBox [0 0 210 192]
+/Group 2014 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 2028 0 R>>
+>>
+/Length 416
+/Filter /FlateDecode
+>>
+stream
+x��T�j�0
��)�q�؎m>Ơ�ö����c��u�����n�ֱ���?I��|(� 9�M��j��
+��]ȵ��h������
?�„�75�j��"�{`$�`q
��@��^U�+��F��\rS�.�f,q6K�;���A,9�ؕq��UQ�=w���
�N��V�۴k5�ADJ�D֩�V��iS8�X
+���!Uu#��S�%��
�5�ࢀ-sࢢ8��e�f�D�&�Y���V�x�e��:5�%ar���0�M�Ha8/�;�C&;T�t닇l
���d���9,?��m��l�7��	'G��F�p����t2�_�^kd��H�E������)�P�\���1���95˂����CZ��0{bE��N
N��;�{���<��(g�jGҥ��=�z��AT��y�X=�o'$�
+endstream
+endobj
+2027 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+2028 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /WJGSON+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 2029 0 R]
+/ToUnicode 2030 0 R
+>>
+endobj
+2029 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /WJGSON+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 2031 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 278 722 500 500 556 722 611]]
+>>
+endobj
+2030 0 obj
+<<
+/Length 2032 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0��<�
�C&�4B��
���� �:E*�2����x�T�%�>�g��uzi�3,���I���
�r<O7'�z�&9�A.��_��MRon�y�1zJ���/΋[i����"Jߜb7�+�.-�ڛ�?<�Y(K�k_��Ȕ�Q^�u�m'>W˔hIN�g�Iv��rRe~�Ti�ꄍ���9l��ߝ
Dž?�e���:
+�Z*�)P�Ԡ#�H'�=��t���@%� 	�>��p��A� ���	�+PS�|P�)�CM�|E$�+�p��������}v��[x0a^ۤ��7e'����
�j�1
+endstream
+endobj
+2031 0 obj
+<<
+/Type /FontDescriptor
+/FontName /WJGSON+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 2033 0 R
+>>
+endobj
+2032 0 obj
+319
+endobj
+2033 0 obj
+<<
+/Length 2034 0 R
+/Filter /FlateDecode
+/Length1 2064
+>>
+stream
+x�UUYlSW�{
;�Mb�Y 8v
'Ά����9ds�į��8qb�B�I(���(�V�TU�(����S?�R��P�(� �~�s���'ݹ˛{f���{@  ʁBa��?
�<� ��4�;x`�
�r\�
 ]

�����9��	Ϝ<�~J%�Ľ)0�o��L� �(���~?@�yܟ�}�"L�R���߄6� � ] 	� �ʠ�4�
mT!l'C����UK�P�1S9M�DHЫ8�����1#K�ΐit��鰛���`���A��J������L4�\8:y�IxF?
]
��{�h
1s"��
1��U��*
gsi՜ńþ5ֵ���٘!�Uۜe$Q��U�n����:K���i���֗��6�ˊ�K�>w[�`}���^W#�ʦ��3-
~�޼!Y��#����̖�B�ۺ�
�R��� �FQ�>��9�hUF
u+�lzR���Te�k�
Z�[X��]%���`0��
F��̈́��
uQ��h��s3k�u�<���FU��xsM
ۅ�Ȱ���"|�2�+��/��
�<�Tkp�ʥ�S6[�GS��~hQu9-f�S���
��

ON�j��wK3M�}��3�$n�3���h��a�Fy^�P���yV�g�43�G��F8	K���o#NM�v<��IONU�l�o��>CK3�u
2}��&
+��D
 ��U^8�
+W�tUvy�ϗ�P���##�B�W��.fy*�}b����j`@�A�G\\"F
�Nj`#:%�I������͎���֏'k���L��m��k-��;zg	�X_�ʥ1�;�|� ����$HEOUF��#�^%A�WY}V����s��P�q����X�/�f��M�k!I‹pgWh��'����~v���.��q����/������Q�N�Q�zb��9�Z�i����o�p`���HI�}��^�!YOv��>�aG��J�`�]� �+�z=��Չbm%�k���Y1^�����
��J��x��n��/4�W54T�SI��p�.������Pί��|�j�PhGqױ�j8�����XI;I>���ǯ����
]��n��<~⤈��y���^�c>1.3��n1:�#Wn��4�G�|\�gdrzO�(�r�����L���N��� �n"�	9�H�>�|�HX8Fs�@:�H�l�9ܮ*����n�>�&�J�9oS�����K���
	j]�ֺ�����Ҍ
+��]���e�
��?ўz�������؂ʾb[y�@����B�GF
+�X���F�n����%�#*:3,
k$�"��KWp��<���O[D��>֭AK��i)=�t�
km3"a�a�q�C
� e
;Y�E"(!aM.jȠH��bL�~
H�4������-JPa�[
:�6iS��+ޕT�7�K
2�������r�`�>�I�m
��C)y(� 
һ/�.K�.��=zz
�h.8q��%PCs#�qo�{PM^��x
)xV��vҋЉ� ���#CԽ���q(>��?�0���e
�!}�Gm���_��
���a^3q�~L/�K8����
����?\�FO�b��Ǩ���_>b��5��
+endstream
+endobj
+2034 0 obj
+1552
+endobj
+2014 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+2015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.351 284.726 206.184 295.257]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [206.682 284.726 252.948 295.257]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) >>
+>> endobj
+2017 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2021 0 obj <<
+/D [2019 0 R /XYZ 89 770.89 null]
+>> endobj
+2022 0 obj <<
+/D [2019 0 R /XYZ 90 721.073 null]
+>> endobj
+803 0 obj <<
+/D [2019 0 R /XYZ 90 624.146 null]
+>> endobj
+230 0 obj <<
+/D [2019 0 R /XYZ 90 615.177 null]
+>> endobj
+2023 0 obj <<
+/D [2019 0 R /XYZ 90 302.582 null]
+>> endobj
+2024 0 obj <<
+/D [2019 0 R /XYZ 90 302.582 null]
+>> endobj
+2025 0 obj <<
+/D [2019 0 R /XYZ 90 234.995 null]
+>> endobj
+2026 0 obj <<
+/D [2019 0 R /XYZ 90 234.995 null]
+>> endobj
+804 0 obj <<
+/D [2019 0 R /XYZ 90 145.889 null]
+>> endobj
+234 0 obj <<
+/D [2019 0 R /XYZ 90 136.92 null]
+>> endobj
+2018 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R /F91 520 0 R >>
+/XObject << /Im12 2013 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2071 0 obj <<
+/Length 1814      
+/Filter /FlateDecode
+>>
+stream
+x��ZIw�6��W�V�%�poO���n�����Q$����w��"eʒm��E�
�
f���4��j��btr�b�G�C
�ba��p-��͍�cǙ|�xc������"���㇋�.�������jD`D����Q2��s�~c`d���]NJ
���\磿FX���ES<4c���!���Y5���U
M��z��,��B�O�4*�,咻��~��:��Y�g�Bd���J��h�R��ӫ��yjc<>{}��lŒ��6
�6^e�r"��q
dW�ex��c	��ǢƔX�s5WϪx5�T�
e_��J� /���
K�Pg���O�](��}��zV91�9�,�8-��5/��F|�&��qX�!�ŃsV����"L���ч��X���3�����So�B=#�„�c�������}����v'�Q������)\�
��Kj۴V3:���
�
S�C�7�`�L�2�P{|-�y=��e<�]Mc�@ t�؊���୴e(&�;f<�d#�Ǔ0
'����U�l�0�.�0�,/c�2%�&~=�i��:\���k��ڎe
q�U��SOq[ i�����D
��EؒLm\���2�
��
|�t��l
/��4�\q��	��75ۯ�Ȳas�
߽�I�y�
+%Ꮐ�a���,�p��h� 9Lj�*�b��U�G�TڠI.3�YQ�Lo?�Ƴ��}?Դ.�t���Q� po�D�6�w�\;����'��Z�-�}Y	/[H��S`�M>�K:^��n��� �C����
G0=bi<U��d�wmɖ��16k��y��|���a�5}d�搷f��`/[w�'X{``�Tv���`�'��)r)=�H ��q
YԤ,���@�����\��iڄZ
�D�1��
`M,д�
{.�	��))$���[�M"y���H1� N�2��q�|~�]�	�e"Ӵj<�iy�v��u�짫
�Ѕ�^���B
E���b
�-&d9dH]�+:
�2�v�{/��1�yY���aȣ8�U���D at n��7+��,���aEvrǼN;�2,o7q�'�t�;e�����l�+�2��,F�Q�����"�>"�ā�޳���eV�� aIV��=�u�
1S���V�DS�]I�bSFQ�ǭ�Nwj��X�i>�D���ˢ�g��
�
=$��`����
�`�e+��B���n��S�X j�t��A5:%u1U/��d�h*_���h���J�|�4a]o�'8����&�Tb�Z��8�a��M3�@pt-kp��NGAu
�
�Q1�m]qĵ��:���2̛
+�7���gI
�g1�5O��LA��h!
��٢Z5ΰ�f�]I�[6ʕWE�q�+���`��T�h������/Q5=��
��GS��w�O�����a��^����>��긦
j�}�W@���Tj��t ����FU)�[��������Zl
�iˇ4�����%�?��^�D-���`�
+8�����ߗ�@�C7�s*-�w��nS��vM�t|e1Ā�����hH1�i
�(F���L�7�	���ly𖍺_�u�l�W�W�2�G�x����>ך�'w��CJ��	0z�el!�1
R��j8n+�
��Ml�\�e���߽�*����W
Q�4��Jk��ʗ�x�a���R9�n��z��8y��Ƌ
�m�M��tCP��v�T
+�D�zS	�E#��w��&�*=V=��tY�K=�ȕ"BhT��ⷉm�y�����(���M�� ����x������9�[a��1��l�?�e��~r2���H.Q���	�Ů��F����&^W��m���O�
+endstream
+endobj
+2070 0 obj <<
+/Type /Page
+/Contents 2071 0 R
+/Resources 2069 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 1941 0 R
+/Annots [ 2035 0 R 2036 0 R 2037 0 R 2038 0 R 2039 0 R 2040 0 R 2041 0 R 2042 0 R 2043 0 R 2044 0 R 2045 0 R 2046 0 R 2047 0 R 2048 0 R 2049 0 R 2050 0 R 2051 0 R 2052 0 R 2053 0 R 2054 0 R 2055 0 R 2056 0 R 2057 0 R 2058 0 R 2059 0 R 2060 0 R 2061 0 R 2062 0 R 2063 0 R 2068 0 R ]
+>> endobj
+2035 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 685.366 169.043 696.27]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ad7ae9489e4e3449bfedbafd36d929f55) >>
+>> endobj
+2036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 657.618 169.043 668.521]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ae7dc52a107e3c90f03801ac327d35589) >>
+>> endobj
+2037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [213.546 657.618 291.373 668.521]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [305.151 657.618 361.927 668.521]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+2039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 629.869 169.043 640.773]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a77791a65ff33495b86466f4a672cd531) >>
+>> endobj
+2040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.859 629.869 227.991 640.773]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+2041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 602.495 177.83 613.025]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ab75311edf7727278b2c6621e4cf08986) >>
+>> endobj
+2042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 538.335 264.491 549.239]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a4c79cc34280a10e3ca9d2a2fdb8f52fa) >>
+>> endobj
+2043 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.672 524.857 343.567 534.763]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+2044 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 512.726 242.354 523.63]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ad67204128201f54bc7e543a16e67e951) >>
+>> endobj
+2045 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 487.118 339.738 498.022]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ae2e189679413b6058b03b13fc1b8dcfd) >>
+>> endobj
+2046 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 461.509 208.312 472.413]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+2047 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.81 461.509 328.111 472.413]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ac9e60b83b647eaf62c173ecf3539c536) >>
+>> endobj
+2048 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 435.901 294.926 446.805]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a28b832ea15d4a33b33f51554b5f54a43) >>
+>> endobj
+2049 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 410.292 265.597 421.196]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a6adb9a394696d907389f2fabc3d7f643) >>
+>> endobj
+2050 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 384.684 195.042 395.588]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+2051 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.54 384.684 275.967 395.588]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a89335d3e61d877bf25e41e562bf2fb34) >>
+>> endobj
+2052 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 359.075 229.362 369.979]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2053 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.861 359.075 275.021 369.979]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_aa86001c9fa5a81f40582bac023132a68) >>
+>> endobj
+2054 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.384 333.467 226.314 344.371]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a84f5ab2a93289e1436a1ea7ef58fb460) >>
+>> endobj
+2055 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.384 307.858 212.486 318.762]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a8959e3a2e2612143cb56991236663058) >>
+>> endobj
+2056 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 282.25 268.376 293.154]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a01868d21a17d9549b711240123d5b81c) >>
+>> endobj
+2057 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 256.641 282.603 267.545]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a373a253b31500ca4f15cf2b22e3b9eea) >>
+>> endobj
+2058 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 231.406 201.946 241.937]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_aed3b733dc78567027867440a5774e70b) >>
+>> endobj
+2059 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 158.801 192.89 169.331]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a5bc4c5bb38b21a01517358b417867797) >>
+>> endobj
+2060 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 134.664 316.306 145.568]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a777f48d40962e0a1f7ddcd691bde154d) >>
+>> endobj
+2061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 99.942 322.941 110.846]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_aaacb839f41a9e7355e1e1e5cc9ad0894) >>
+>> endobj
+2062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.757 99.942 383.533 110.846]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+2063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 74.333 293.621 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_adbae3f77deab71eb8d31dc8e551bdeed) >>
+>> endobj
+2068 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2072 0 obj <<
+/D [2070 0 R /XYZ 89 770.89 null]
+>> endobj
+2073 0 obj <<
+/D [2070 0 R /XYZ 90 704.286 null]
+>> endobj
+2074 0 obj <<
+/D [2070 0 R /XYZ 90 647.055 null]
+>> endobj
+2075 0 obj <<
+/D [2070 0 R /XYZ 90 619.307 null]
+>> endobj
+2076 0 obj <<
+/D [2070 0 R /XYZ 90 553.339 null]
+>> endobj
+2077 0 obj <<
+/D [2070 0 R /XYZ 90 527.92 null]
+>> endobj
+2078 0 obj <<
+/D [2070 0 R /XYZ 90 502.311 null]
+>> endobj
+2079 0 obj <<
+/D [2070 0 R /XYZ 90 476.703 null]
+>> endobj
+2080 0 obj <<
+/D [2070 0 R /XYZ 90 451.094 null]
+>> endobj
+2081 0 obj <<
+/D [2070 0 R /XYZ 90 425.486 null]
+>> endobj
+2082 0 obj <<
+/D [2070 0 R /XYZ 90 399.877 null]
+>> endobj
+2083 0 obj <<
+/D [2070 0 R /XYZ 90 374.269 null]
+>> endobj
+2084 0 obj <<
+/D [2070 0 R /XYZ 90 350.386 null]
+>> endobj
+2085 0 obj <<
+/D [2070 0 R /XYZ 90 323.052 null]
+>> endobj
+2086 0 obj <<
+/D [2070 0 R /XYZ 90 297.443 null]
+>> endobj
+2087 0 obj <<
+/D [2070 0 R /XYZ 90 271.835 null]
+>> endobj
+2088 0 obj <<
+/D [2070 0 R /XYZ 90 246.226 null]
+>> endobj
+2089 0 obj <<
+/D [2070 0 R /XYZ 90 115.135 null]
+>> endobj
+2090 0 obj <<
+/D [2070 0 R /XYZ 90 89.527 null]
+>> endobj
+2069 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2111 0 obj <<
+/Length 1938      
+/Filter /FlateDecode
+>>
+stream
+xڽYY��6~�_����$��D��@�̴/��qlMFű��L���^m��I��+��{���E2v�v~=�����E������k'�N
�(��_�|p	F��-���f�&[n�rÊ&[�|�d�ދ��.^^,/�$n�*��[����L�|Ϯ�zͪ��z�7��OW��~�:�rF@ �-@����7g>a���WF~�8�A'�><K����6�L�J�$p�-
+�n�)�Ќ	A�h�.Yk$lo�n��Z7 at _��n�a-Ȯ�
+�a��u�����	ڛ)��C��T��EJ��$	
+R�R�P�#QC��� ��d�:
[P��8
B��)
G������{4to�^F�[��"�0�%�ڀ�^͔���X�u%�&�U;][���C|p
��ѹ9L&���#�P��@*냲�V�iQ3����~���\�i$� ��(��5x>�H�"�
 Tǜ�#�q�
/��!%?7q��{����
`g�1�f�朌�H6-�bT�czT{-�1�Q��0�L������v��j=��.�{S�R�B�V�>A�(��
+Vu]��:�(.���f �!J݇�nX.��� <ؐ����q�ć�;�
�Ý�ϑ�+�1
+(�&G=jH���ty�f�NL�u`��������o[���2q� ׭� f����m[��
v�մ�}/�2�*�޳v�T�&F>}]7'��f& �V?���hʼn��B�!
^k&A�[>��q:g|C���2�!
jQ$&���ݎ5{�
��>@�mu�/�T
�]�������4J�說z���u��P��H���#��Y�;�!$��-�.�f�ܬ��+N嗓�W+3B.�h2Rf"�[xΑ���S�	�$�80td�U�֧�f^9w�)n��
V�g�
=1�%!
+�����k!����yiV���ȗ��B�1򫡄�%I�Z�֊9�4BI:�X
�����%(A�_�>"�ub%Kݲ�e�G�
۬���/vU.�8`�qЉP�'*��4x(�Ȫ��J(I�K���0Cp3

+���NV�Ϗ]&�j���&�2���G�O��9��E��d�e�qP�N,@>_�zpG����y�ڌ���L�
��ɾ,��1���i���5<�}/����[ÐM�njo�.�ʣ���SH�>	 ��4�k�TFR�\��&�r�8̟L?���>IvHV��bY���'
�4
ZL (u�dt�ݪ�7[��,"�,璠.XH�ny�=
�s�
+���t9���S�S�_孭l�6�ٓ�X��$���W�V�e;�B_{S
�I�����d��I�올խ�1�%�Ͷa:.�7f���cۗDj�D��������I
^��KK04�u��ٻ��
�Q�բOS�ؑ/�\�py.VW"F�Sp�	�e��e������Сi����.3�c�,UaW��+
��]��!u�_;
+U�4^gx{�����]�j��q#�;��h��q|ұY��yW<
>;a���5S6b�'nT��������ѱ��Z}���`Y��̘k�%\^�(;�$"m�6�w�~� ?L�dyޠ���~@����m%ԭ+����w7ucz� &�
�ѯ%-
G`V�_�~Qo��=@w�<=�$�\I��=���i�j3��#��
-}k�l
�,��
������*��=⌕�qv�ٱg��7�K�Y׮U>�jc�E���Cԋ
ޱb�
8B��]o
�T1c�HU�s �
�n-z�
u
��jࢼ`M'��m��&7>sL��DT�0'~�Q�s@��1�O��*�Q��Z�;�_�֍W��RS_��Ϊ�.[���i��)��?k~���5q�MV�,��hV4}*&�@�H�� Y+`8
�RU��ٱ�ߤ�Ё[HGӛ��>>?_�ւUk��3����X�ZG��R� Eg��d�k�~h��1Ϣր��(=1�c�F
�꥝h:�_n|�y
��_��9H=
+endstream
+endobj
+2110 0 obj <<
+/Type /Page
+/Contents 2111 0 R
+/Resources 2109 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2121 0 R
+/Annots [ 2064 0 R 2065 0 R 2066 0 R 2067 0 R 2095 0 R 2096 0 R 2097 0 R 2098 0 R 2099 0 R 2100 0 R 2101 0 R 2102 0 R 2103 0 R 2104 0 R 2116 0 R 2105 0 R 2106 0 R 2107 0 R 2108 0 R ]
+>> endobj
+2064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 695.814 232.192 706.344]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a925ebc675d3deed289aed0d97dafa81c) >>
+>> endobj
+2065 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.008 695.814 279.514 706.344]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+2066 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 670.406 236.068 681.31]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a29bc2f9d0a2c4c96011fe36312a53e2d) >>
+>> endobj
+2067 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.883 670.406 317.71 681.31]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 603.267 239.036 613.797]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a5c952c2540fc4ea96e8aaa1109d6ea0c) >>
+>> endobj
+2096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 578.233 236.008 588.763]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status) >>
+>> endobj
+2097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.506 578.233 259.38 588.763]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ac41bfa66bbd6a2c52616ea5d4a6270a0) >>
+>> endobj
+2098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 553.199 217.368 563.729]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.866 553.199 251.968 563.729]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a92ced4994293ff25212f86d55421a48a) >>
+>> endobj
+2100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 525.798 217.368 536.702]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [217.866 525.798 300.127 536.702]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a7a934327db411e24b7c2a073983d2a3e) >>
+>> endobj
+2102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 446.892 288.54 457.796]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
+>> endobj
+2103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [288.441 446.892 436.524 457.796]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a42e9887cb1bd2e0914862d448881d047) >>
+>> endobj
+2104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [439.742 446.892 513.996 457.796]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
+>> endobj
+2116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 435.311 201.079 445.841]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) >>
+>> endobj
+2105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 407.91 318.518 418.814]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_ab3b703e4e468da3a5f49ad28905527e9) >>
+>> endobj
+2106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [322.333 407.91 485.779 418.814]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value) >>
+>> endobj
+2107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 336.315 191.678 346.845]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a9117ebcf4233e25be986d6b67ca78f1d) >>
+>> endobj
+2108 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2112 0 obj <<
+/D [2110 0 R /XYZ 89 770.89 null]
+>> endobj
+2113 0 obj <<
+/D [2110 0 R /XYZ 90 568.654 null]
+>> endobj
+2114 0 obj <<
+/D [2110 0 R /XYZ 90 541.627 null]
+>> endobj
+2115 0 obj <<
+/D [2110 0 R /XYZ 90 474.488 null]
+>> endobj
+2117 0 obj <<
+/D [2110 0 R /XYZ 90 423.739 null]
+>> endobj
+2118 0 obj <<
+/D [2110 0 R /XYZ 90 356.059 null]
+>> endobj
+2119 0 obj <<
+/D [2110 0 R /XYZ 90 356.059 null]
+>> endobj
+2120 0 obj <<
+/D [2110 0 R /XYZ 90 304.095 null]
+>> endobj
+2109 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2132 0 obj <<
+/Length 3073      
+/Filter /FlateDecode
+>>
+stream
+xڵZ_��6�O�;y�ː���Om�v��z���S��he��Ė
I�&�� @I��m��=$"AI��^�ڭ�ꇛo�n�}��U.�$LVw�U.Wi��8��f�6H��ow?�t�	�'0�R���/w/�{�c7/�n>�(�+E�c�f��x��7�� �Ǖ:�V�鸊B
����Ϳn�T�d��RB)Z�7��0��~_��*j����`����a��
+ u�XoOE[
MoZ�������*��G��~��������Q7�mm�*vk��W��G�3CU�4lکf��龲�*W���<�i�
.K�A�2V'hV
}kf�����ҝLYm?;�%媞�˦��� 
;1���$�H��=,�#����)��P��jc:�ΧS��4�mZ��4W��XVuٚ���� ]��ù���ؚ�7O�_�
V��B�}��팚H�M���R��٠�8�At���x:؃�D��}Ãd71����cӺ3<�-�Lmڂ6d/Ĕ��� �|�l�,�
C��t~H.�oO���Bǚ��N�^�ͮ-N����cUW�3O�3�/OJg��k4h
+48�N��)�
+T��f�ދFL�Z��u�
+V�/xڱ������94F_��8��7ݜc0�6��A8J�<^������*�R���%?�����^���jp\
.:�,4���W|fϾ�)�B�����
>�!ӛS_
���f���f���O$�:X@��]���2�J�
XE]{a8�>��oDm�ɐ�<pr�#���5�"Ln�#r
[���}U�A��<�ƾ5oG��������/h 0�k|�IȠ�w���/
���@E��2f�����n,b"�B
4���Xom�Y�����t�m�uQr��l6 ����0�=�g�g�$�f"Jr�_�3�	���3F�c�JÞ"�pO��~�h ��uq�
oZn��4u��g
�9� ��)��6S{�i��]4F
��
�-��!|�v%J�d�D
+���������U��l��B��l��3$A�7�[��:���N�;�P'`�
kߞ��٫\(�
S����A8H�`� �jT�R���},$:�|�z\�L�R;
�š[�4TB�|��g��1�J�`e�� ����#�E�⹑�HF�(6Rh
L���3˄�~ɬ��Ȑ��N9&��P��G�__�� �X�߻st�2��J�̃��n�r���
M4f
 ���\�@�䚾.��\
�@*���.0o��4ev'�0
�
��f��<t�s��&�H��� v�
}s���B� ^
��uK�	
��$}�B
�ۣ ���=��M���]L}0����&�8�l�{�K����ݳ���K��,�w�
+v�H�2����,��������D�R"�)�̧11'��N+C�n�A�Z(�%ؐ�P
#H��sV,�h�����:�ը��N
�-�w�q�=$�G"ӑo�֎�m����;55�;��f�٧��nz"L
��4
�
w�s����.�ێ-���B R/DV�S�X�Tȫ`�$)j�+ْU�գ�t.ݬ��Uᗠ���j�иg���
�
U�hg�1!ZE3��G2`�~:�-x�
CSREM4	��]���c�z6��a�@<E��#l0�Vd�S�
�mA��]a�j5V��+�R�}��ʊ��
�fs.d,�BN3�@c��Z
h�kj(0K���D
���&r4���8xsF
q`�Q<�K]j�����
��'p>���&m���b?C����,bM��cgn�p�pp�)d�G�U�
C�^,�����E�
�uw�����"�E�^��T�6pOn�VL�4����#`:5
��vnC��9wL���Ԣ&���t�
��D"`j�/V���WOQ
+�˃͑��
+s5yy���^�\�Pw7��kN�ٰ����!|kY��|��c��^�
�c���
+�$����ƅ�0&�b재X�+�Zl6���u��d��T��E��<un�����̛?��H���C�	$�.t(TλPjE�H)�ﬨs���
B�������My�������q5HGt�{�	����������҉Wa

+���+q(�,މ����[��bP
�(	�( 6vT�yo6���T"�:�	�e$�x����o�����g�K%����I��2X<�xݢ5�k�*��y">�yɨzL�,|�l0N�C�aC:��DT�D���N�ف�+e9&�M�2��I�0
�շU�!�Y���(J@��QA�M�~����BO�r�*�!�^i�<~���N⦓�@�h�_ѠӚ�uy��w��"p�1
����_�W��_�
K+�3���#�a
��zcZ��e���RiL��3
��C����7
�Ї��V��>)&����
����CU�h�<�
2O��>�CI0�U;[�r��-2������U�'	���]�W�]Aș��J�牭�r0rr�u�yW� \�/o���_�� ���Sy
+����K���rS��_��r*4�G��U���~?��X�B���$�<H�~TT⿨�_�$P̄��Ɲ3�!��.?v�����ھ�U�5uyh���Y*R=���X|/�t)��H�{��� ��,��d��|�֨u6�!cmw>��V�b�����WBr�aTd᰾\P0��3UP��//V�P��z
+10�O�<Z�"\e����V��,�x��4'���Q��8ѐG���F���3yz�)�1D�~�
�f}�
+�j.�MDZ��D(c'�5��we�
+g���dl�R2H�l�]����RR���p��s�0Aͤ~���.����h
	��W�C�
HϦ��۷
bŃ+ɷ
����"?��ј�QzT�鮔��%4�R:L?��Y�}7 5��:�%�
+�g���߃-�ö���^�)�����_����x�!����ҿ
�L� ��=>�:R�ih�m;��0�٫�^�h@�(��ݎ�C$O�������y&ց%�럩�#?w��+~.�ݹ�1�+�	���K:�ә�������hy�84�u)�N��(:��7ưm�v�����}�lA x9;������g��]�#��4�qr�B!68���e��k_Հx,&i�w�����
+endstream
+endobj
+2131 0 obj <<
+/Type /Page
+/Contents 2132 0 R
+/Resources 2130 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2121 0 R
+/Annots [ 2126 0 R 2127 0 R 2128 0 R 2129 0 R ]
+>> endobj
+2126 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.07 357.438 328.202 368.342]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+2127 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 118.457 201.372 132.405]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+2128 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [304.891 118.457 432.413 132.405]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem_a4c79cc34280a10e3ca9d2a2fdb8f52fa) >>
+>> endobj
+2129 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2133 0 obj <<
+/D [2131 0 R /XYZ 89 770.89 null]
+>> endobj
+2134 0 obj <<
+/D [2131 0 R /XYZ 90 331.909 null]
+>> endobj
+2091 0 obj <<
+/D [2131 0 R /XYZ 90 309.533 null]
+>> endobj
+2135 0 obj <<
+/D [2131 0 R /XYZ 90 309.533 null]
+>> endobj
+2136 0 obj <<
+/D [2131 0 R /XYZ 90 209.406 null]
+>> endobj
+2137 0 obj <<
+/D [2131 0 R /XYZ 90 143.762 null]
+>> endobj
+2092 0 obj <<
+/D [2131 0 R /XYZ 90 81.969 null]
+>> endobj
+2138 0 obj <<
+/D [2131 0 R /XYZ 90 77.486 null]
+>> endobj
+2130 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R /F8 448 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2144 0 obj <<
+/Length 2754      
+/Filter /FlateDecode
+>>
+stream
+xڽZKs�F��W�dm8��csJ�x�ޤJkk��T	I�� 
@r����)B[< �==���g0�br?����
lo������{�'I���nb�Dq����ɗ)���ٜ`����\'7�b���.��f�ݖI�<Sx��>\�\�3����*]��T��URU��Sz���i�H�
�RO��}��x���ŷ
�	���d����O���#Ό�|w��N\W�������܌4�͈DHgB�"ڝԮDD���asH��6�4�����0
	:�2�z�eN1AR�1�S̑1w�n���>Ϥpk7 ,�r�F��Hk+le��`.{D0ILG��Mr@0S��`�gsA�tU��V���`&
J��J+`�h,��~T�E�.9m�+�.�,�o>?W5���2�5�,�!�s�8��L�0
#��ߙ�Ӥ�p���sZ���P�D`�ɺ��"=1��0�	bЮEDi+�,_ey�խ_X.��Hp1�36�[�`���1[-C|H��ځ�ٔ�8rW�hX�~{���+��u��BV�dN��������8~���g�<$3��OX �g�j�X^�,x�WY��E$��؆����:��Y��Cఝ��_y���ᆚ��V�jP ��"
����$�3p�3��
�9�rS�u�
KV��<.��{q�gW�
Vވnn������؆����U���K�x���I
4�X��ҧ
1n"��9xJ=ͧ��"[�{�?�
iI&3[?+K�P��o,���%bz
��x
RI��� ֬�EC��\	�� 
�o�&�| 6��Ahol��S��Ey��*��|�j$p��C6�T"�[��
o��% �$+ۼr��n�lFĎfD?���4
�>>��n��xco���{cp��N�����S��n'�������9$4D%���8�;W]G�r��qD�j at b~��)��,)��ў��8����?���- ��!����L,C�ђ%�,w�`
�C�A
���X
+oӻ\%h���U4#1�8=Ƭ9�Ha9kN�Cr�x'���9�l@�(LhpĈ�M�K�>�r��bY@Pi)��M����Q�eA� r��1[
��a�Xĕ8Km�ol�cT��M� �'- ��)
�G��>�t'r"�ޏ���b�i�
�i��Xt�}��\BD���؇]�"f6]�mR�S�¾�a��"��8��o

n
݌@vtX
pj��7[4��_�a�'k�.J�(���:6Q': ��
p���	������6GT1��u���}�_�w�v��9�� ���h
}[��~
|� 
����A
S���G� ��[p�Id�3�U�S�m��3�
\J �*����Pd�?�����Z�^ے�Dfo�[�g��r
<$uxT�o��ɽ	���t
Nb��hK��t����J�
��

�a6� �څ�U>�e
�p��]�y�����.�uc��8"-BTQ�!*�,7�lD^����(
+9�ߍLл
��\��u��%��C��Q5,ڋ~w�@�n��W9�������C���q���Ԣ����v�6VN��
+����h��DwZ}�{����ډ�݆Qo԰W�#�){ק �1�m�u�bQ�8��^���=RA���R�5?�Ɣ@\v�k��p0�m���(�ë��j��ܦ�I�PTap�$t���=N�f�2�����5�aP�IG 
R���#�x&�`���Y��lخ��Β���[�c�v��qm��ꞝ�Fc
�#LFh�YJ
ӓ�hcpm���Im�1�m�H��{�F�V�B�X�n׺����`�1�#C�
���vGd���u���(m��[Qu���"��}[
C�
s���I1��t���6
{�GV6��LJ",�b���"��m�coIsD�B�m�
�Sp�_���o@�!)
+
��+��+�S��u(��V�Ph{e:���>,��O�u��jB��!f�g
I�ʖ7?�3���n��f�"<�����L��=Cٳ��ɪ��QA�����{��J�A
�fh�ok��:���eCW��iv��[T�3�܆���f	q�E���
u��_N�r����u����3.�X��߶�z��e��YH˾��������}�&-�l�����MRA�3�#xa�íSo`�d>�ڊ��(S<=ȜC��%�*fZ�0��
�,Uk�äH�#a��L�؟��"��H�a�b40)�sD� N,X�IH�Z-�Z��1G&��6�y`j�V<cw�`(Z1�0�}��nG�˷Q�6(�
De��Q���t �m�0="��P
D)����jD�4����a��6���^,`�j-�8�����Uv��%�n5p�j�[y> bB��2	��IԁV���V[I��V�f��;��*^�=�#Z����
�(U�(q
�:[�ں��	�(�7��C�ElE�
Abl%��mQ��$?
��vi����
+��Ox,�K�
+@(�p�X��QȊA� �Η�ٲE�"�pUV
a*�c�;�	P�AT@M�
���hr�=��?�P�e�5���`�ð��\A�>n��
>y�=ߤ�����9W���ˮ�~�7}��#�'�%��cr~��)w޵�?UZ�m&�4���$oO�Y����rB�6e�;����4L����Is��
���
��> 
��
�z������*��ѢX�.��c���� ���l+<\�å���6"�3��Q ��7^�(w�~�{���0<���f�_
+X�m����o
+endstream
+endobj
+2143 0 obj <<
+/Type /Page
+/Contents 2144 0 R
+/Resources 2142 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2121 0 R
+/Annots [ 2139 0 R 2152 0 R 2140 0 R 2155 0 R 2141 0 R ]
+>> endobj
+2139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 274.363 201.372 286.761]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 260.858 201.372 272.853]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 162.347 201.372 174.745]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 148.842 201.372 160.837]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2141 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2145 0 obj <<
+/D [2143 0 R /XYZ 89 770.89 null]
+>> endobj
+2146 0 obj <<
+/D [2143 0 R /XYZ 90 630.741 null]
+>> endobj
+2093 0 obj <<
+/D [2143 0 R /XYZ 90 608.364 null]
+>> endobj
+2147 0 obj <<
+/D [2143 0 R /XYZ 90 608.364 null]
+>> endobj
+2094 0 obj <<
+/D [2143 0 R /XYZ 227.842 551.192 null]
+>> endobj
+2148 0 obj <<
+/D [2143 0 R /XYZ 90 544.552 null]
+>> endobj
+2149 0 obj <<
+/D [2143 0 R /XYZ 90 464.023 null]
+>> endobj
+2122 0 obj <<
+/D [2143 0 R /XYZ 184.963 363.509 null]
+>> endobj
+2150 0 obj <<
+/D [2143 0 R /XYZ 90 356.869 null]
+>> endobj
+2151 0 obj <<
+/D [2143 0 R /XYZ 90 298.119 null]
+>> endobj
+2123 0 obj <<
+/D [2143 0 R /XYZ 90 251.493 null]
+>> endobj
+2153 0 obj <<
+/D [2143 0 R /XYZ 90 247.01 null]
+>> endobj
+2154 0 obj <<
+/D [2143 0 R /XYZ 90 186.102 null]
+>> endobj
+2124 0 obj <<
+/D [2143 0 R /XYZ 90 138.559 null]
+>> endobj
+2156 0 obj <<
+/D [2143 0 R /XYZ 90 134.075 null]
+>> endobj
+2142 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R /F60 312 0 R /F8 448 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2167 0 obj <<
+/Length 1548      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~���[%`bH�ԥ{J�p���
��0�v����,��;)�t��A�a��DQ>�s��&�����M'�"�Է�
+�V�"�}x��>�v�N?X�"� ��
]�O��Ӊ�6N�>a�(y��Кg��_�u
�,��(���e�
<Sk2�y��+�'�\.�C;z�˜Y�PĔ7��nʼj��V��
i� G�
O�yJ�.!eN��LP1L�����R��8�V�"O�ժ�T����j�*��Td�g�zVq�T_0�1|C�i#歀]�!�r=�X)wF�C
�
�`��
���(�z��$Ax6�	�ֱ٤��Rb�ш@��b����ǵ���(�,�gȧ�s�(
+�u�W��$lU1j�E�b�߈�r�yO��bޣޖ�4�*��qC���dY;�SDBދ>G$`��Z
��6
UEz+����̱�F��1���](� �֚/Vu�%���m[Ժ$���M��؋�?���
�$_vS��B��3��d�݈�9~v40� �@y��>������p2zw:���ry˳
�@<�0�L|�]"�.||
�΋Zmh�
`�I���wv.�������
�r�
BtE��(�T��YRWf�
+�.q�+U�M���
���`�o�њ�v&��y��
j
jkQ��
*�Ӹ��;��Y���(�Zh�]�E�¢H�¡ܾ[���g*�=`�sq�,�R��J����.�X�j��c�b�VZ��Bk�c�&��#�#$p�4T?���0^�b!�:�=$
�a�H6| >8Gh���t/4��д�������r�ڀ��:xdza��<�
�A؋
�[�4
8*�Z����(„�c
�����;��qg������~�����i�?ˊ��9����˥X��(E>�2���R�2��A���b�ת7fd�
�b�.�
�0 @�v�ܴ-��U �u]&W��M-�"�?:8����	8RU)��<�k�:�8�����&�������;->X��e��sAa�) C!�F�yS�k
�T��:
�X�w�&my=��Pv�|�ѧ������#\%��>p��9�{E�ϞF<�k�m�?"��E
'i�e�3Ǣ��ɪ��g2�U��^{}�<�J�y���zv�b���R�g2i��8ߏǡ�ЄA/< [...]
/���>
�x�p`/
�ź�q3��x����
��
�q��O�㢪�ej\�N��E�7����.'��%������&K .%�W��"w�\�� J�/�����؏�����
꿻�2Cio4��1�����
ǵ+�%
L�j.OO�7��]|_�U��O�	2�bݺ�پ��)
+����� (��K�o0��H�7���NFo
�2�:.@ك:�
+[L��� �0�r4QL;��	h<>U���v�4ΗM��?
������3�[+Q�q8�uv����L�}��3+��ي �*E(o��z�k":�T�����'u����
뫡��^�=8�j��ȗh^d���A8����k\͊Rǒ䰙��k�͚�
�
�d
+endstream
+endobj
+2166 0 obj <<
+/Type /Page
+/Contents 2167 0 R
+/Resources 2165 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2121 0 R
+/Annots [ 2157 0 R 2158 0 R 2159 0 R 2160 0 R 2161 0 R 2164 0 R ]
+>> endobj
+2157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 402.021 216.625 411.949]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_a1676341382601ab9c96f035983f372d5) >>
+>> endobj
+2158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 374.362 230.463 384.289]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_ab5cadae2d9d1e506769cafc7dd19c5b5) >>
+>> endobj
+2159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 147.287 248.734 157.215]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_ac2b60fec8498b08d7f22b2264d3948d4) >>
+>> endobj
+2160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 119.628 264.226 129.556]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a7d97a0adb78a51c7089586f7ee4cb6bd) >>
+>> endobj
+2161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 91.969 240.973 101.897]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abc9126a51dec07227e4919899e44589b) >>
+>> endobj
+2164 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2168 0 obj <<
+/D [2166 0 R /XYZ 89 770.89 null]
+>> endobj
+2125 0 obj <<
+/D [2166 0 R /XYZ 90 684.379 null]
+>> endobj
+2169 0 obj <<
+/D [2166 0 R /XYZ 90 679.895 null]
+>> endobj
+805 0 obj <<
+/D [2166 0 R /XYZ 90 507.609 null]
+>> endobj
+238 0 obj <<
+/D [2166 0 R /XYZ 90 500.642 null]
+>> endobj
+2170 0 obj <<
+/D [2166 0 R /XYZ 90 419.92 null]
+>> endobj
+2171 0 obj <<
+/D [2166 0 R /XYZ 90 419.92 null]
+>> endobj
+2172 0 obj <<
+/D [2166 0 R /XYZ 90 390.527 null]
+>> endobj
+2173 0 obj <<
+/D [2166 0 R /XYZ 90 345.415 null]
+>> endobj
+806 0 obj <<
+/D [2166 0 R /XYZ 90 252.875 null]
+>> endobj
+242 0 obj <<
+/D [2166 0 R /XYZ 90 245.908 null]
+>> endobj
+2174 0 obj <<
+/D [2166 0 R /XYZ 90 165.186 null]
+>> endobj
+2175 0 obj <<
+/D [2166 0 R /XYZ 90 165.186 null]
+>> endobj
+2176 0 obj <<
+/D [2166 0 R /XYZ 90 135.793 null]
+>> endobj
+2177 0 obj <<
+/D [2166 0 R /XYZ 90 108.134 null]
+>> endobj
+2165 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F72 334 0 R /F60 312 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+2186 0 obj <<
+/Length 1205      
+/Filter /FlateDecode
+>>
+stream
+x��W�r�6}�W�-�` $xɛ��
��(���cg4�IlIB!);��..�D�R'U��' ��=�s h�:�|w�NC�b
,@�9�	
+�� z3t�P����RB��J�<��d���2�d�]���nH
<�&�ҥ�#�2�OFuR�+��8qz�:7���
=IS�v�A���:���;�:�"�78#4�;7_	���'D�G�AOʑ�<�fh���!6"�Y�%����bJMt��qm|�\Y/֍�Y�t9�>��O�W�NF���w���?
��V��G���"� ����g��|
S�xp����zi��0��8UmJ��|0���^�V!\�8��N��JH�K�����P�.
+�rs���/�cvd.���\�__\�+��X�S��d�`�00Ԣ�[�	��{:��<���If�K�{*�u�@�Wު�v��΋1�P��8`�/
S˘��N�L�`cA����Ne�Z>@���fǁ��8e��wĕ����Ҧh#)5�wM4E]�ls<�Ѩtx�
�ykjܠ4��u.
+��m�^�ֶ���A���ᅂ��م����0�Y&U i��
�L�oႨal�� H�
ss
� �911O�ؐ'_\J�����S`�|)� 1�L'�q� �
��TĨ�Α'�E�kR�a
�1���v��ez/@�!$Ǩ�S�@j�� ����[�����yt�K�3N��!;���=
��h��;7j�O�{��Rw�
Q��[�7u��+�
M	�@���(u�{U}�����u=�yCy9���l��2[Ih(��]dv���䐾��;Җ��Z��>��2�S���>'����w�)c?Zw�/O{ǣ����D:����O
oOW��h��@�z�Y��`%*C�MؽT+��Ԋ�?=6�:���{
1��GՂ��\�o+���
v�r���n��^
�~S/Z��`
�
[0Z^��z��ՓZ��� �U���= .�Lz�dIU�D�P[��\kK����#|��X5������S,`8����b��+�q40�J?�
��a087�O�
�#�I�X' [...]
+d��")��e��pb5�ڄ	��U)"�G���`��h 7�����/�Y�v"`���ч_:�e]��
ݭ�(T�i涋���6k7���ƒ0�k��ͱl��� .�@��7�BGԌݶ��,�G��C%�e�H�
����
+endstream
+endobj
+2185 0 obj <<
+/Type /Page
+/Contents 2186 0 R
+/Resources 2184 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2121 0 R
+/Annots [ 2162 0 R 2163 0 R 2178 0 R 2179 0 R 2180 0 R 2183 0 R ]
+>> endobj
+2162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 708.933 262.572 718.861]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a46e366594cc5fa0e10c75a1b6c17df09) >>
+>> endobj
+2163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 661.098 306.836 671.026]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abd8921ad9d2cc32e7ee32de63704c1c8) >>
+>> endobj
+2178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.841 414.078 245.973 424.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+2179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 322.33 248.196 332.257]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1PIP__Problem__Status_a89f381f0a22cc6f22b445a4c1691db77) >>
+>> endobj
+2180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.841 213.953 245.973 223.881]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Problem) >>
+>> endobj
+2183 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2187 0 obj <<
+/D [2185 0 R /XYZ 89 770.89 null]
+>> endobj
+2188 0 obj <<
+/D [2185 0 R /XYZ 90 721.073 null]
+>> endobj
+2189 0 obj <<
+/D [2185 0 R /XYZ 90 687.351 null]
+>> endobj
+2190 0 obj <<
+/D [2185 0 R /XYZ 90 599.525 null]
+>> endobj
+807 0 obj <<
+/D [2185 0 R /XYZ 90 481.613 null]
+>> endobj
+246 0 obj <<
+/D [2185 0 R /XYZ 90 462.55 null]
+>> endobj
+2191 0 obj <<
+/D [2185 0 R /XYZ 90 350.317 null]
+>> endobj
+2192 0 obj <<
+/D [2185 0 R /XYZ 90 350.317 null]
+>> endobj
+2193 0 obj <<
+/D [2185 0 R /XYZ 90 260.756 null]
+>> endobj
+808 0 obj <<
+/D [2185 0 R /XYZ 90 142.844 null]
+>> endobj
+250 0 obj <<
+/D [2185 0 R /XYZ 90 123.782 null]
+>> endobj
+2184 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+2202 0 obj <<
+/Length 1551      
+/Filter /FlateDecode
+>>
+stream
+xڵX�v�6��+�+�
� d��u�����$9>��l)ʡ(��� �@R:j��ļ��p�	p�n��bv�V�@!��$X����	�[�CA����A�HDT���W�]-�\-n̻ٛ��ی�+
��#!��v��+V��}�Q�d�d?����7��g�oJ24�D��yY��2��b��9�8\e�L���zW��CZn�ۇ]��^���6��ʴ�
%<Dח׷7��Pe���j��/��	�_p�q
|GRрc�aƹo3�ت�'��}��\\nI
�ށǝ�Qn���]�c�(�������K(�\��\�"���@e�����ҭ�
���y?�� �$A,�lDI�/�roo���a�VYDy�
��
�C����h�5���:-o���P��
�sd�3��̖��FU��~h���
���ᧈ�e���zj�^�r$J���0%
)"
)�\�>��PB����^�i�S;����"��a��փ͏�]��cϋ����s�h��ty��bI�o [...]
+�y�����q
z�8�uP؞2x4�
�L9�#&��C��U����z�,��jX��H|�b��t݋�tB���]�Z�)�ȹBkW�:�vk�<luQ�#��	m�e����
oj
0͛��:="2�}�����e�{<P(L�8����+)���2FL*�aiD�f���0��X}
1��Y��$F�
Ի��e؎�	#8�����	��7�����	�<�f#θ���v
+IB����
+�%�z+XB��ҷŽ�i�lGɠʡ�@?e��)^7�H�Ѓd蕾��i��[X����t�0�C�+��vL�&:=��������Z��1��V�~���
2@��`�2���'?� ���ˏ�"�@�;@2�L�Jh��E�ni#g���{��M�o��uMC�]Բ��rѪ�j�SӲʾ`L�Y��d�5�r�N��p~Z�	���oY�����61"�����[��;R�}
+
��q��'hL��B�_�000x
+��
+_���8� ��*^�d�:�ҫ���"����
�� E�o��o�U�;���v &�W��
@����GslD��"�e��g��O��(Et��(��i�Ȯ�y���O�N��lt�˴j at f]��]��|g�����@D>8�vG4�KN�Fg^�gjf���c��e�Zti��
`[v�P֬�q#<�@K0$D�H
)FC�g��%��’���(�&�
�)�i�}�gQ7��>�P�1W�
�N�%C?O,]R�8�f�ꒇ�G��s�.���9E`�r"͉�+�
�~� ���x �+h|�To#־���Nw�ӭ�\��7>��țw��b��
�1m���s}��-��[�ݮ���n�/
��k
>�m�{]�q
�h�kZ
Ҽ#)�
+��A�4�Es8�7�ɨs���_f��un�
p"d
����w��^���F�Y�;�"�vW־d<�Z
�����F
+endstream
+endobj
+2201 0 obj <<
+/Type /Page
+/Contents 2202 0 R
+/Resources 2200 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2121 0 R
+/Group 2182 0 R
+/Annots [ 2194 0 R 2195 0 R 2196 0 R 2199 0 R ]
+>> endobj
+2181 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1PIP__Solution__Node__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 2211 0 R
+/BBox [0 0 210 192]
+/Group 2182 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 2212 0 R>>
+>>
+/Length 414
+/Filter /FlateDecode
+>>
+stream
+x��TMk�0
��W�ĕb;�a�P���;�
�~���
��'%v����
GH%YOO�͇2
���D��&د���<�
����
?��ϗB�����3@��T�p�d
� 3n��x��«*��B�m��-7���n���z�

�c�0cW���VE
c��]��
�Xhwj���Bަ]��
"R2$�N���d�X��ɹ��RД�O�(
��9�2/��s�
�L��B�̉��r ݜ8�4k'��q�4����u�����x��ə>� 7Q��7�:L_��t
Rz��S*��?�:l>寮m�7l(6���&GY�G���~�8��%�5�����"�	��(��J$m�H���D�/=ˆ����CZ�ѰzE���
N��;�{���<��(w�jGҥ��=���/�AV��9~�
�7B
+endstream
+endobj
+2211 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+2212 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /BOBEUM+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 2213 0 R]
+/ToUnicode 2214 0 R
+>>
+endobj
+2213 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /BOBEUM+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 2215 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 278 667 556 278 556 722 611]]
+>>
+endobj
+2214 0 obj
+<<
+/Length 2216 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0��~�=��L i$�T��Qi �%E*�2����x�T�%�>�g��:��ϵJ�ݤ^��v<O7��:�FȌ�H��֊ě�u^x�M?����Ë��V�=��ADɛ��s��ץ�Ts���G6
���Hs�˽���
��`����ò��o��j���GR��ٶ�]k�,�ԏ��ޏJ����,����w��r闧�)�e��t���rhT*z�Z�H�
Q�
:C{��ԁr�E�ųp��A=΂
2
��'��8����ḋ�ḋ���H�W��R��m׻��{���9߶�`B��N
��o�Nvs���j�5
+endstream
+endobj
+2215 0 obj
+<<
+/Type /FontDescriptor
+/FontName /BOBEUM+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 2217 0 R
+>>
+endobj
+2216 0 obj
+321
+endobj
+2217 0 obj
+<<
+/Length 2218 0 R
+/Filter /FlateDecode
+/Length1 2084
+>>
+stream
+x�UUYPSg>���-b�6CH�!7
�IBXC ��a���P+֢�*:S;u*��/�v�t�P:�ЩSڗN����hG+�q��}��MϽ�w�?��=�Y�sν@  j��i0����; ��P�>4R�����P&

��q��
ϏQf
�@�)��<��B������M�����A �4� ?	NO��H"�
} �]� �L+�ke� ���d��LW�h3��b�B3@
+� j��1f�R!�����b��1۬��S
:<
�����:]~�/�A{��3�ا��h�������2U��� �y�2c�+Ѫ!�#VKM���T�A�+N��m�D*P�
�[����$��X ����%�d�K^���+3T�WT�|����*������U at w&�
�ڐ�����,�5��Xbb�m.엤IJ�� �80�-�K�R��TkcV������S��;ڲ�}F%{+�i�d��;Z�bM�#*�6��C�'�m	�,��~��i�*i�^�-�s7�ɨ����^_�1�أ��:cDZN Rj�Թz���
�1/�LX�
JT]+�!ͦި
I��9:>1s$���6�w�ӌ��o�͓�yO�H�78��"�Bz���c��\
 ϽS�
��@2��+��3��99ѽ\П��!�d�l��5K%���-n�:�G�l�8�hK��K\�:V�\]Am�ϧw��v�Ș��w�"��)��d��\��3sU@�^�RcvFJ��юZ%�r	�uJ�#$��7���=~�H�d� [...]
+��&gd���m�5ߎ���[��J�?l�}��ι��?�#�7�.�����y�‡�Ճd}%�VTS��0_�֬������ɞ�>R>��/Թ�u
T�7��H��]�.��҅��Y���3&�%B����2�P�e;�#�R�J��3�d�B*��
+��"����6}��W�;}�
	��=-]6����Tc�>G���\O�ݕ���Ogҟ
|��X��e/4m-S
�e�.�ޢ��V�rl��8��=�_�?�zQ���x�rϭ�V���*̎6_����A���������/�-K?�L������*+�ce�l�<#=5?�����{)S.lH(2�3��ga}������V���u�uT�vc�m�����N�1.�.�o�z�"�I|gr�b��Ύ���d��}��_P?�c�
����c�Z%y�����V�S�v�
'� ™"�n!� ���<S�bH!���C9������B�41�dH	~A�8Ai �Β�m%���$��rZ:�7��o�"xș��޶_����"���DX��T���E��ؿZ!z�&�x��k�b��*$
�8���
!�w�EV@�g���eNN��`�=��nB��R^�'h��
��c���	v>���{�y���%F���g�
5#.�����uE8�"���� [...]
+endstream
+endobj
+2218 0 obj
+1575
+endobj
+2182 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+2194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.351 436.739 217.601 447.643]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.099 436.739 292.877 447.643]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node_ab532119425bcb15a8c6063d19f071c3c) >>
+>> endobj
+2196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [296.693 436.739 331.881 447.643]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2199 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2203 0 obj <<
+/D [2201 0 R /XYZ 89 770.89 null]
+>> endobj
+2204 0 obj <<
+/D [2201 0 R /XYZ 90 455.733 null]
+>> endobj
+2205 0 obj <<
+/D [2201 0 R /XYZ 90 385.929 null]
+>> endobj
+2206 0 obj <<
+/D [2201 0 R /XYZ 90 385.929 null]
+>> endobj
+2207 0 obj <<
+/D [2201 0 R /XYZ 90 329.385 null]
+>> endobj
+2208 0 obj <<
+/D [2201 0 R /XYZ 90 304.952 null]
+>> endobj
+2209 0 obj <<
+/D [2201 0 R /XYZ 90 304.952 null]
+>> endobj
+2210 0 obj <<
+/D [2201 0 R /XYZ 90 216.78 null]
+>> endobj
+809 0 obj <<
+/D [2201 0 R /XYZ 90 126.834 null]
+>> endobj
+254 0 obj <<
+/D [2201 0 R /XYZ 90 119.544 null]
+>> endobj
+2200 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im13 2181 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2239 0 obj <<
+/Length 1438      
+/Filter /FlateDecode
+>>
+stream
+x��XKo�8��W�P3�$�ў�ͦH��f�-
ڢ
�z��Ԡ��×l���-�b�=�hr8�|��
�����r��bvv�b/Gy&�b���K�
��
+�O0��`N0���Ɋ-wM���-K��L~	R�����"Hc_$�9_��<���/Jֶ���o��P��_�,��(�������}�P
{ĨAQ�y�j���
+��0��̻ӓ*/#hK�f��
"J��A�@��-��cZ�S!�V��|li:ǰ&�a��/-Χ�Sa�0��)"4�h���*l�f�a�z�a_��ځ�ˊ��y���1
+����b����7��ɢ�q✠$��u��U���X���ë�����N4u{/؉�I��(��a����~�t��{7��V5�DR�s@���
An-��z��E���){��q��2G��v��US
���1��#G�e���$V����y9���]/k��ݭu�aG�U�Al�>g99K0AQ��YK�nEkf�7�P��9�nȎnG���Ω
���i at Ky'Z�l�F�'L�I��4���"J
��s��沰�
�����2K��
!��
��
v
�L�תiJ�������瞲����(W��tvb��Q
+w��gW��4=�/�Q��Ș�}Z��3m
�h�c
�ֈcN��`Q�J^�c���:����I��}����: �M�xۀ=྅���;.o���G�>*O�;�w>�
�9��J1���F�<��?-����+�*��o�ԭ�����iy{ڧ�~Х��;�Ou���e�Y2�	��Z���u��(`O���*CΠ`��w*�v,�^�w#�"��z�6*��?��#�e(NrH�#��� ��Zc����ur��X��td7�Cnf��P�וJ��g���_�lT{�]'����͗����x\�~�l��#��
�G�~n�3ѱ,�p�'N�p�I�p�5�Y?/�u���M��ev�i.CC�=��A*��$KQ2dT�ģ�gR��I�U�OD����J%}����� /F!���m��h(m�4?���u�9�(��sޮ��}S{L<c"��4�t
>�?8�}�E)҈%�
�
e�y���Z-JuV������#
��`4M)c�*m�"D��c3*�y\A��v�ъ6 ��|"T#S��lV�RA�1�S�_Ȧ�
\G�g��jns��NE�ƞv�ʥLL9�<8^Ÿ��W�P<�`�=��螮m@ԓI6�
+1����5���:�2�\��r���x]}J_�T�h�xJ�q\���$J�衯=��I�$���"
+󭳻Sr��t���@�
[�Y����N�Tv�(�a.1�TY��½���ս#F�Q�Y��4��{��Ͷo�����qx�y�^��!T���.��v����٪���٢uS}=����}19�T5rp+U��`��s�3?�%PZ�W)LR�ϼJ��G^����WYe@
+endstream
+endobj
+2238 0 obj <<
+/Type /Page
+/Contents 2239 0 R
+/Resources 2237 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2250 0 R
+/Group 2198 0 R
+/Annots [ 2219 0 R 2220 0 R 2221 0 R 2222 0 R 2223 0 R 2224 0 R 2225 0 R 2226 0 R 2227 0 R 2228 0 R 2229 0 R 2230 0 R 2231 0 R 2232 0 R 2233 0 R 2234 0 R 2236 0 R ]
+>> endobj
+2197 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1PIP__Tree__Node__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 2251 0 R
+/BBox [0 0 376 170]
+/Group 2198 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 2252 0 R>>
+>>
+/Length 545
+/Filter /FlateDecode
+>>
+stream
+x��UMk
1
��W��#Y����B(zh;�C�a�ͦ����п_iƞ���
²#Y���}o�_
G ��`(^��|1�yy��5�÷���V
�
•|��
�E�Bx���>{��d�	>���2h�/���ʡ8}�4��d�%d���ɞb�,��
+a5�bK))�)�,|��0>��퀃���5�o�*�ZW���ʬ��|-�ľ��s
\�Hi)�r{
~��@�m��IE�iA��z3^g1��I�k��q3�p[cKX��!�
MT�x����>�Ґ�>
\�v��]\�;
-t:�P�0�1�4x�+~"t�;�QG
�ҫ�,	�.��,Hy�_�
��C�L�L����hG��oh��P2r�7z�y1�	��1�d
!�r�Q^Kyb�8�(�E*��
dM�K�;���#Tpg����2s����'���
�)�u~I1�I�'U��H\��,�����"�)�\�G~��fѷ���Nm}|#�-�̅�W�ɉhi'��E�Q�Mi�vT��#i7��	,�u;i'/��ʰ�8E��<oO�V��3���
+endstream
+endobj
+2251 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+2252 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /TLUPGG+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 2253 0 R]
+/ToUnicode 2254 0 R
+>>
+endobj
+2253 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /TLUPGG+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 2255 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 278 611 722 722 500 500 556 667 556 278]]
+>>
+endobj
+2254 0 obj
+<<
+/Length 2256 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��n�0��<�
�C&	!U�CT� {I���
9��5
+�j	�ϳcy�_�Z
�v�
/�ZY����L
_
��� �@�/��D�37��X�~�ʒ�O'΋]i�����""�߭b;�+�/
���1?<�^(������ּ�#S���Z9}Xֽ��U|��)�,p%9)�M+ٶ��Q��UQٻUE��?=�a�zyk�/�<I���z:
+�Z
+ʠ)P�)�AGh�
+��p�t�v��
ԁ2�������A=�
"��'�/Ǚ�2��eA
� �+�|��|y�B>d�Wd���;o�ئ��ey��5؏�����A�c��d6��~@�H
+endstream
+endobj
+2255 0 obj
+<<
+/Type /FontDescriptor
+/FontName /TLUPGG+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 2257 0 R
+>>
+endobj
+2256 0 obj
+331
+endobj
+2257 0 obj
+<<
+/Length 2258 0 R
+/Filter /FlateDecode
+/Length1 2368
+>>
+stream
+x�UV[P���st�&
ɺE�f�GB .�~]07#�� $����� ca$���Ā�:��SOc�8v��L3
?$��Ƀ����t��t���6�;Nc�;3n��W���s.{����wvW E�
����"���)<8���Nd���g?�
��R�xj�?��~���x�M��m*(��\�Ξ^��dk(����S 7P�ʙljy�\�<@�>���� ��[ Ax��f�լ6'�B�'�›tk��
@=o�F�h(�`P�:/���r�R��X�Z=��z�6o�=�>���T�O{�ў@<�g��p�͋+�G���s���"Ğ�=j@�zphD@��w�t�j�c���U��"��m�,�"���I���/�$5�TR�����xrx���R��LGe�~[gk[�,L�vx��/��O����=
�7ت���R�Ln2�m�&�𻁆�B�h�6��G���$:5��v�e �x<
�����t��*�k�%x���/�1c;�lҳۢ�Oo�–�;�h=�
������D�-
���P��<�s���vWt%?�=�
�N ә=�g��U���cm�
�~)�Pu�Yl*��ɻ�������j�/�
�
ӊ����)�g��
K-0,���4��q�(��i�6�%U�
+^ž���	�!���'k�jSuپ�Fשb{=�'$7TƨRHC�'�bip}�
��劼�[�
�Ŭ�֡���9SQ�otK���.�#�c�c��U
U V�ހ
�x%F
�^ff#:%�*�p�f����c
��
\2���F��?d�
�� ��`���J��G
|����g9T��j�#�{܈oPK��Ǭ>�
{O���l��j 
b�3���
�^Zy}��
�Ǐ�Ɠ9��A��vk����q��b1|��GT���\��c,C=��4��I�鸧k-v`.�|.=�
�+۳1$�_G��]��X/��Z#�B���]�Տ��a��q�C[��մrƫ6��2��9�[�;A�2g����P�w�J&���t+���r@Ğ�y�I�l&���H:��"�I�Ҭ#Si��}�^:|u�W�u�)u�O�t}N��8NVD����p�I���Q����*�g��*9WW �AF�����z�����b�&��n~|��˗������~���

+\3�v^s'��7֓�����@8��ŋ��+k'dz䘯=75qrur~c���Ļ�x��k5)��B�	"a2r���RM
+/������
�����L��d��h棑�3ӷ�7Z|M�*K�F��5p4
�;j+9�Fl{�`���?О�q���w�FP9���`Z%|Έ_8M�[ZY-�}'�V��'V���z�-d'j�c:
+�*%��YR��Ք
i�X�����˫��I


��|08Rn�:�EZ�$�q<�nj�7�8�����=?���{�k'{�t6W��|�:d5^wM!?rw�	�b�-2����
��Fۆ�1$6�n���U��,R��+��@�7X�it�x�����<�=�N8��0��U�w��Ǩ" \��H��
v�J�
+��Mq�W7H�}7J�O
�y�!�gMOԐC�����})���1�K�
����5V��u��
+($���{��s�
��e����������)�!�F�,î]�%_
�����Nm�ɾ�9�1�[������@�����6��\
_B�<-��
�8Lx���
���0��
�
�#
�E�
��up��G
�={�w	a�`' ���=R�2j��x������*��Q����8.���&R�=#�Ɓ�2��W~
Ķ�"#b�9�lPQ.�!�����[
+endstream
+endobj
+2258 0 obj
+1789
+endobj
+2198 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+2219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.351 464.17 222.054 474.7]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
+>> endobj
+2220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [222.552 464.17 269.934 474.7]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a8ad7732b0e38be9e8c42a93bffdedbcb) >>
+>> endobj
+2221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.351 433.476 223.698 444.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
+>> endobj
+2222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.196 433.476 272.673 444.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a7c7056a9fa57d1dd08465dbb8a862b72) >>
+>> endobj
+2223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.383 402.781 190.762 413.312]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_afe64e41fa2c3ef17fb78ea3ea4caa89e) >>
+>> endobj
+2224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.555 360.754 248.325 371.658]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_af248bcc6fc4a4dff80fd47032a49b33c) >>
+>> endobj
+2225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [308.673 344.734 368.113 354.639]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 318.105 240.255 329.008]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) >>
+>> endobj
+2227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [240.753 318.105 279.826 329.008]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_ac6acd7a5076267b606f39476b3b891e4) >>
+>> endobj
+2228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.97 302.084 398.41 311.99]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.351 287.41 218.178 298.314]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.676 287.41 263.836 298.314]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93) >>
+>> endobj
+2231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [343.095 271.39 402.534 281.295]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.2 256.716 201.302 267.62]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) >>
+>> endobj
+2233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 99.214 197.257 109.401]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Decision__Node) >>
+>> endobj
+2234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 76.49 195.613 86.677]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Solution__Node) >>
+>> endobj
+2236 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2240 0 obj <<
+/D [2238 0 R /XYZ 89 770.89 null]
+>> endobj
+2241 0 obj <<
+/D [2238 0 R /XYZ 90 484.19 null]
+>> endobj
+2242 0 obj <<
+/D [2238 0 R /XYZ 90 484.19 null]
+>> endobj
+2243 0 obj <<
+/D [2238 0 R /XYZ 90 451.761 null]
+>> endobj
+2244 0 obj <<
+/D [2238 0 R /XYZ 90 421.067 null]
+>> endobj
+2245 0 obj <<
+/D [2238 0 R /XYZ 90 379.413 null]
+>> endobj
+2246 0 obj <<
+/D [2238 0 R /XYZ 90 348.719 null]
+>> endobj
+2247 0 obj <<
+/D [2238 0 R /XYZ 90 275.375 null]
+>> endobj
+2248 0 obj <<
+/D [2238 0 R /XYZ 90 200.727 null]
+>> endobj
+2249 0 obj <<
+/D [2238 0 R /XYZ 90 200.727 null]
+>> endobj
+2237 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im14 2197 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2283 0 obj <<
+/Length 2184      
+/Filter /FlateDecode
+>>
+stream
+x��Z[w�6~����R�T0.$@v��I�u��n�}Jzt(��R�Rv�_���)ђb+����`��73��h1£�.�usq�J�Q�N���v��qx�F��y=b<F$�0ȶ����͏�n>�w?�\|� �
+��!��ˋ���QͯG�$
=�N�QH\�ч�_/�W#�[s��lG1B!N�Q#:��q�V.gR�'����u9�sU���j�^ʲNm�QwX 4Mh�B!z�#�%�0��4���-�aTY�:��z�aS�r�F�V3�A��J�2ݷ#��H�x
���C֤(��֞���� 
r;���XU�		6w2��1�8�xFBD���"��6,6c
���z@�(D���(	�1�+qcDk)$��8>�d!�Hv��Ne��4oS9�~�
OB�
�!���"oBc75�C{ྗ�Z�f���t7���W��
+�K���~�}M\C�UQ��b;����H/��ރ�|�
`�7cf�:�k��!K&�jDXp�`�
� /�|.��Ãk���}��G�e�
*X�kJ��WJ狼L
�|?��G�鬐�gZf�gk�
+�'
��������1���ˏ���U�YAI�6WZ�j��GkD宻*@hGp�`~�MӦ��)��/�zd=��M�J7[�7�Z���u���B�R����H��;�,(��C�c�B~��f�Q�bO@���O�F;`�Dx 1�s:��u܈
O[�r&��	i,A1�[�N<q?¯$���|���<��({
�сpP�P;K���b��09�|
+��E}�{
;f4P�{d=�NLX�,��
y_'���.�Z0
+�>��1��W�ŀ���:��0�
"
Z�
cMv��;#ܾ��Բ��ì9!�t�O��?����
����kUX�v�#�^�>�y]
�Uy'uބ
�hӕ�-�: z�]���bgB���v� �	v���30L�ϝ��R�����\w6����&�7�g�������Ϙ���kCPޓ����v��ZB���#a(�
I��a�4��Q��@G���(�
�]��,�@�S-��\m��9����ޠ_
z�к7�" �ц�_�1�C�k1� v�ǥy
+]�0͕�����&
1�Y^}6��c��e�	��$!�ͱm,siuO�4�Ңpz�aP�r�L�ȗ�#
i�e�
<�$�T�oZ�����z��9�u���%.�	�u� � $
�[~�A
��g[jV$d�;wc]֍�
���|U���0��᡼�\{o��펟h
+j��W�b�T!��5\���
�Ε�&��cVzt��e�O�Q��9�ט}�iF��{��r�i�4���\�lYYlZ�0nI�1��X����5L����Q�����l�D�@����4!�;/K�+��K��7��?��5� �ڽ���%&a~.\A�gΞ��G ������8"�W�)� _�#���\����|h��C�b
�ǃ�9} �V�mq��Vj�W1�A�Q�l�4�e{��&����
� �
+���	���$X0UMH������e�7�*��m�-ќar
+ Hr*"�=��杖��Y6m����X�ɞ����e�V�	����@�$������A|6����=%��Pط�S؍�36��,�'7�y�B��x[(d
E,9^�am;I7mk
xJ:�j8�g���[*:������e4|�[>�����q|�,���[@�[@��]홫�;#%�_w�4�y
�d�q���
�NAO�.��aw?��WP{X����CJ�G�L��a�5��:����}DZ��
�S��wR�
�;A�0�z���9XwHZ�H�j4��C�����PG�� E��1/֙����!�<��;��Wi��J~�ö�*�
��`�� p�h���̄�ة�i�vUx~/
WH�Ki_/
m�6r����h�jQ;S�j�>�p
���w���@Z�Xy2Sk�����%�H@O�<�n�r�$~�
��hS
��2We4�e�	�N�+Cg �Qb����d�BP��{o_6c|��Ւ�^*�l;��l'��
 ېn�L
]�i����~�n^w?�ٖ7i�X�
�������,�?���GQ��6-�j��9)k�7DVZ��!����8�[���j6�
X"[��������������
��{;��SǷ�=���~��и��F���/���]
+endstream
+endobj
+2282 0 obj <<
+/Type /Page
+/Contents 2283 0 R
+/Resources 2281 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2250 0 R
+/Annots [ 2235 0 R 2260 0 R 2261 0 R 2262 0 R 2263 0 R 2264 0 R 2265 0 R 2266 0 R 2267 0 R 2268 0 R 2269 0 R 2270 0 R 2271 0 R 2272 0 R 2273 0 R 2274 0 R 2275 0 R 2276 0 R 2277 0 R 2296 0 R 2278 0 R 2280 0 R ]
+>> endobj
+2235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [326.968 660.373 392.801 671.277]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1PIP__Tree__Node) >>
+>> endobj
+2260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.683 519.765 207.239 530.669]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 409.824 231.425 420.728]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_adf86846ee255deb41ca850ac64c4b61c) >>
+>> endobj
+2262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 370.456 189.224 381.36]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a711a61f2016a1a60c7cce6dceb2bb94b) >>
+>> endobj
+2263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 344.039 273.029 354.943]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_af3095a51638dbd4f5f64ef0abae85829) >>
+>> endobj
+2264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.844 344.039 414.746 354.943]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+2265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 315.63 272.779 326.534]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a4ba9255b9f22cd0731c631579a578efd) >>
+>> endobj
+2266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [276.595 315.63 414.496 326.534]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+2267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 275.266 297.297 286.17]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.795 275.266 355.528 286.17]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a49b8e7f8a6b1ed7aaa6e91729323de7e) >>
+>> endobj
+2269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 234.902 297.297 245.806]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.795 234.902 347.927 245.806]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a3ae906e1904f2ac295800c2da5ad0eb7) >>
+>> endobj
+2271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 206.493 224.451 217.396]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_afc1ff8d6faebe04f1639123b5a35e1dd) >>
+>> endobj
+2272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.267 206.493 287.823 217.396]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 178.083 228.327 188.987]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_ad8b71c1b523782a16d5ced5b3103bd8c) >>
+>> endobj
+2274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.142 178.083 404.345 188.987]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.974 138.715 232.636 149.619]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a8adda024ba9ada688f17592347ffa4a9) >>
+>> endobj
+2276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.669 138.715 408.872 149.619]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [430.341 138.715 513.996 149.619]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 126.76 218.952 137.664]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 98.351 238.817 109.255]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a20fc9fa06d5e6772b60c0d8c968716a5) >>
+>> endobj
+2280 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2284 0 obj <<
+/D [2282 0 R /XYZ 89 770.89 null]
+>> endobj
+2285 0 obj <<
+/D [2282 0 R /XYZ 90 721.073 null]
+>> endobj
+2259 0 obj <<
+/D [2282 0 R /XYZ 90 703.073 null]
+>> endobj
+2286 0 obj <<
+/D [2282 0 R /XYZ 90 703.073 null]
+>> endobj
+810 0 obj <<
+/D [2282 0 R /XYZ 90 575.588 null]
+>> endobj
+258 0 obj <<
+/D [2282 0 R /XYZ 90 565.855 null]
+>> endobj
+2287 0 obj <<
+/D [2282 0 R /XYZ 90 459.508 null]
+>> endobj
+2288 0 obj <<
+/D [2282 0 R /XYZ 90 426.898 null]
+>> endobj
+2289 0 obj <<
+/D [2282 0 R /XYZ 90 360.56 null]
+>> endobj
+2290 0 obj <<
+/D [2282 0 R /XYZ 90 332.151 null]
+>> endobj
+2291 0 obj <<
+/D [2282 0 R /XYZ 90 303.741 null]
+>> endobj
+2292 0 obj <<
+/D [2282 0 R /XYZ 90 263.377 null]
+>> endobj
+2293 0 obj <<
+/D [2282 0 R /XYZ 90 223.013 null]
+>> endobj
+2294 0 obj <<
+/D [2282 0 R /XYZ 90 194.604 null]
+>> endobj
+2295 0 obj <<
+/D [2282 0 R /XYZ 90 155.236 null]
+>> endobj
+2297 0 obj <<
+/D [2282 0 R /XYZ 90 114.871 null]
+>> endobj
+2281 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2314 0 obj <<
+/Length 2094      
+/Filter /FlateDecode
+>>
+stream
+x��YKs۶��WpWr&��ࣻ$�;N�67uWiG��̄"�����{��K�b�J
-D<x��w� v�v~�xu{qy
a'AIHC�v�$؉��F���%1������j���2�߉���<[T��{v�;�b�̊��\<��Qɉ�fJ���-��M#*ޔ�7�
��s^���X	�IK���݈y߾������ٱC��
E���\|�;)L�q0��yP�6N@}�ϝ?.�w�ͱ1�L>�?B�@ �1x�z��fMV<i��w�����[�YH��[+1��Ԍ��[��t�Dó�R���ʶ����u�W׈�K
��(3��re�Hܪ��=��A�?g�3�g���G�lj$�$S�����
(ɧ����I�
ϊZ��䅞]�����ɸ�Q���ֆʊ����7[x-�&M�,
a�^�˜~�cK��g��[�r#�JAF1kOEPŒ�w� 
h2�Z>J^����73Ӻ�
9�WWz�����kc=0_����E�e�G��U���� )��4��\lD���U��H
ȉ���b�X4ʨ[�m%j��X���N���X6��t�d�
�2����!X��O�V$c)zZ��ف���B��<ׯ�q ���9uk�1��-_
+K
+ �M���&���T����C�+�v�7�ʬk�$�|�Q4����09�Y�ܕv�l8I\
�J�YZ.wR������,�I5��vx���̏�@H;��*����J��{P(��)�Rf+_�� b�I�APi�C\4yh�r^yv�rQ7�"?�m��
S.��hHV6U��R�/|�=��ny�mA�nI[k� XtϜ�
��"

a|�, at h�&a?�S�MbP!�Z9�b%�@�OM�M���B��K�>�R�aƤ8@,�
0���ʛ%q�f��
Iq��)R�R-�VF��`8�>��Þa�و�.H�Y
� d�(�-J��1���'Q����%
�6��"�QH�Y��\�`(��	�,F�,
C�0�8vg�G!&��?R1�Re �f	Q)���pf4�L�=Dp���ͮ*�;;�mG]y�n�.�_���Y�
��Y%�]���TR&���� X5:��
+
��de9d�z%���0���\f�,���AV��
֢���r[U�f�Ȫ�1�dV���\�8��H�?֑��H��l\
2�8��I
+"�l������
B{9�X�ԩ�*�Z־��
�:���P��'
�Ixʌ}�����{2��#T�
+��q�
�_A�
�)<S�
�?-��"Px
ib�� 
J��`F�u������?c*��@�,<� Q0u�q@�$�Q@�#H�)�dt��a&Q`f�
3t�P�~�T,�yJ�
6���
�㽘sXx�Auk��&�]{?ЫK�'ZOw:f����>v)�\�ݯ��U?�:�j}� LsU�w
�����Ә���Bd
�D�I�d��:d�5�Dۮ��1�<��� uwāa�
+�HIA�
+}�_�<��̹٘��IZ�J6F������	�"Y�(�{�c��!�ެ���A��bL�A
+�΀��
6ǐ��2�8�����ﮩ����+[l
j�Lj�.�pS�Ą�����M�jԦ�EnԞ�&X@���,
Y}��$}H�Ȩ܉�TtH
�ѩ<?��U���
A&��
ѧ�н�DMOQ����=G�o�4���ԶU>y�*�
��
��>��5�����/����|i�Y�"(A U�kG~��a�/����5n�n��]���������ie�J��H[�#��?k&.�S�
+j4���i� F�G�0F� �8>�*!�
`kQ���˝zX��6��u�L9�1b}�Y�����v�Z��=�����@VヺS�
���Kߨ�|��e�*x���
��:��ox�e,[�ۉ���8y�w�?E�E��H��B�D�"��j
�ģ+"hb�Û�Ŋ����
_��7��+u?�4S֢���_���-/v<�ZŘ
���|"�@f��g'��G�����
���vL{'�дX��f����b��E�F�rs���#y5�:[�rnJ�)&+`r�.ʐm�-�
��:�
��I�|
~�g�h_4�7߹*A/�G����0
+endstream
+endobj
+2313 0 obj <<
+/Type /Page
+/Contents 2314 0 R
+/Resources 2312 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2250 0 R
+/Annots [ 2279 0 R 2299 0 R 2300 0 R 2301 0 R 2302 0 R 2303 0 R 2304 0 R 2305 0 R 2306 0 R 2307 0 R 2308 0 R 2309 0 R 2311 0 R ]
+>> endobj
+2279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.683 659.259 207.239 670.163]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.181 367.995 379.083 378.899]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+2300 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 296.098 286.113 307.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_acd3100605be3e85bc68685085a2572ae) >>
+>> endobj
+2301 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [289.928 296.098 462.131 307.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2302 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [174.383 268.82 201.83 279.724]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) >>
+>> endobj
+2303 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [205.646 268.82 377.848 279.724]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator) >>
+>> endobj
+2304 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 241.916 179.355 252.446]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a26b1ddc4ece928d4301c1fca3d9c2db7) >>
+>> endobj
+2305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 214.265 179.803 225.169]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a22326363cf04596cec471dbe66e03653) >>
+>> endobj
+2306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [140.351 186.987 199.907 197.891]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [200.405 186.987 251.105 197.891]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a1b586c1f7e68ef2ad7a47bb83767a32f) >>
+>> endobj
+2308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 160.083 177.83 170.614]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a96c42895c3599ed91e187ea39f94672c) >>
+>> endobj
+2309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [160.356 91.175 191.678 101.706]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a12e689efd1655b4ec60adc26beb16a65) >>
+>> endobj
+2311 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2315 0 obj <<
+/D [2313 0 R /XYZ 89 770.89 null]
+>> endobj
+2316 0 obj <<
+/D [2313 0 R /XYZ 90 704.286 null]
+>> endobj
+2317 0 obj <<
+/D [2313 0 R /XYZ 90 704.286 null]
+>> endobj
+2318 0 obj <<
+/D [2313 0 R /XYZ 90 550.938 null]
+>> endobj
+2298 0 obj <<
+/D [2313 0 R /XYZ 90 528.562 null]
+>> endobj
+2319 0 obj <<
+/D [2313 0 R /XYZ 90 528.562 null]
+>> endobj
+811 0 obj <<
+/D [2313 0 R /XYZ 90 420.515 null]
+>> endobj
+262 0 obj <<
+/D [2313 0 R /XYZ 90 412.957 null]
+>> endobj
+2320 0 obj <<
+/D [2313 0 R /XYZ 90 314.783 null]
+>> endobj
+2321 0 obj <<
+/D [2313 0 R /XYZ 90 314.783 null]
+>> endobj
+2322 0 obj <<
+/D [2313 0 R /XYZ 90 285.771 null]
+>> endobj
+2323 0 obj <<
+/D [2313 0 R /XYZ 90 258.493 null]
+>> endobj
+2324 0 obj <<
+/D [2313 0 R /XYZ 90 231.216 null]
+>> endobj
+2325 0 obj <<
+/D [2313 0 R /XYZ 90 176.661 null]
+>> endobj
+2326 0 obj <<
+/D [2313 0 R /XYZ 90 109.487 null]
+>> endobj
+2327 0 obj <<
+/D [2313 0 R /XYZ 90 109.487 null]
+>> endobj
+2312 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2346 0 obj <<
+/Length 1897      
+/Filter /FlateDecode
+>>
+stream
+x��Y�r�H��)t�
+wz�Z�63@&��
�J�r�Ȓђෟ�I��
+����_�V��t��b��ttq%���3]8!v���l�
��0}�0?@$��^�|�f����V퍞OG�G��C�}���ףw�3��WF,
�}h�p��7unG��#ꩡ���l !�#��È��1
?�U��r�N(
`V�E���<�6,.��]U�3�
��j�{�=<N*YDU^�Y�Fei��f�ZI3�'��:�+{ _���rU�(��07/F�;�}�'YU���:w�7~���\�4ݮ�H
�!��<�
���C�y^��L�8WJ`ec�<��2��=c��
�e�Ȁ��T�$0\�ڸ��v)�(�`l����4�6Q���#��@��\��O�Ea��[�#���r�S�����b��{����dVD�`�u}o��]F�6n��a
C�8�0�����4��2��9,EH�σ�H	6���>K�!;K�=D(=�x.�l��d�=�
�K,H_��MM��-UX
r ��,<�a�B��V0a>GAȝ	�����^S
+MYy�=�NBBՈ�*��πO����U]d�jkf�\�Bf�.�0�mm��;�	
�ESI�UR�S=(Ca[mЉ*80҄�%�` |���������,ɖ}J��'��
+Z[����@%���KR=���!�6u�D
�}t!u�
�XC_,�$M�д�LYU� ��e�5���,s$�}�q�ԝxZ_�dޚ�E�j��82<ȸY�
+�޲JVe�	ed��2lY��u�5�I�r<�Wg�4�G�4�
+;�ǯ�B�J�{�
+
��pc��Ƙ"YZ
2��R���YC}���h�J�
es�^��:�R/˕ḯI��u>O�cL�͹P���Ζ0yp�u�D�W�P�����"�v�`\��p �Qi���JZ�sX�����x��W�]�lkza8~�8�\!��[����s9r2���T���8�$MJC��De)jQ,��A`�?��xe�� �4�l.8�gU��}���V�p��L
 �Dew�n��z�� &�
|4
����TEo4]�z �"OScy����$�O��M|�Y B
+( ��=�ް x�ҮT at E�� ��R�v2�=˿lA �1R��d�1�i�Mm�3�� ��:`؀�#�� Ā��pBQ at O�)O쵩
���i���

�)�Y�SS���oF��@!�y��!b�ߗ��`������F��72��Wƥ��ȅ+Ʀs�����!�Wt�u�WRf�Z��Z�Y��}�eUDPc��uu]�@�4��N��W壚�� ��8��۽�f�����w��)oj���V[�
�0Y'^�
 ~�ϵg��&�y�F��n߼
h����=�C���RW[ֈ��{Ô#�����,ϡ�e����z�&�<f���g���s��MQۘN�Hͳ��&
[�v}J-�Ƕ}�
	��;�Kx�N�
��!&�J�
+:��o�^�ܪ�i�槦�
������S�?z
��j��w���{PGe��j��.����F��f�4[R�)L�>n�P�5
A׫aSha�yc�Í����J�Ŷd�-�L4�j�-  ��C�y�k
��/�A�$�પ� �U�?�g�GxF�V�ð?����a� o]5�~�o�J�4qZϻwIs��p'$X+��N�ƒ�
xV���t�ջ��U=Q{W��Ὲ �
�/���
�-����g@�A���Xo6w����5s��@�#7z���~�@��(�&�
QL�}__�e�v_�z�([���
|�*�B?�c��4����v}
eu��m�Te���)�)d`?�0�u+��Q�S��#��S����7�mUU���zY�l�b��{��]�?�_8�yѠ�
�:�|��O�}
+endstream
+endobj
+2345 0 obj <<
+/Type /Page
+/Contents 2346 0 R
+/Resources 2344 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2250 0 R
+/Annots [ 2310 0 R 2329 0 R 2330 0 R 2331 0 R 2332 0 R 2333 0 R 2334 0 R 2335 0 R 2336 0 R 2337 0 R 2338 0 R 2339 0 R 2340 0 R 2341 0 R 2342 0 R 2343 0 R ]
+>> endobj
+2310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.181 682.931 379.083 693.835]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) >>
+>> endobj
+2329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.072 539.856 218.628 571.368]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 324.019 194.507 334.923]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_ae9b4bcc84019980d7be4ace75e54c0b3) >>
+>> endobj
+2331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.942 293.114 179.274 304.018]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_adc93ada4ec022b8e6020c91412e0b0ef) >>
+>> endobj
+2332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.09 293.114 263.687 304.018]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 216.237 218.029 227.141]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 216.237 250.965 227.141]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_a31e5a38eb5511d477ccd1b793fec470b) >>
+>> endobj
+2335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 185.332 218.029 196.236]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 185.332 262.043 196.236]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_ab038d193cd145f2bc59b501db605e320) >>
+>> endobj
+2337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 154.426 218.029 165.33]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 154.426 290.804 165.33]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_a44dd34b28b7e0ca0ea892e9259ea7103) >>
+>> endobj
+2339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 123.521 218.029 134.425]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 123.521 266.456 134.425]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_a4358da8086e7af078f42a62c817895e3) >>
+>> endobj
+2341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 92.616 218.029 103.52]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.527 92.616 255.378 103.52]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation_afc62e3c93daf5e744e4b3e450c7c7270) >>
+>> endobj
+2343 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2347 0 obj <<
+/D [2345 0 R /XYZ 89 770.89 null]
+>> endobj
+2348 0 obj <<
+/D [2345 0 R /XYZ 90 721.073 null]
+>> endobj
+2349 0 obj <<
+/D [2345 0 R /XYZ 90 665.971 null]
+>> endobj
+2328 0 obj <<
+/D [2345 0 R /XYZ 90 642.917 null]
+>> endobj
+2350 0 obj <<
+/D [2345 0 R /XYZ 90 642.917 null]
+>> endobj
+812 0 obj <<
+/D [2345 0 R /XYZ 90 438.568 null]
+>> endobj
+266 0 obj <<
+/D [2345 0 R /XYZ 90 430.087 null]
+>> endobj
+2351 0 obj <<
+/D [2345 0 R /XYZ 90 344.518 null]
+>> endobj
+2352 0 obj <<
+/D [2345 0 R /XYZ 90 344.518 null]
+>> endobj
+2353 0 obj <<
+/D [2345 0 R /XYZ 90 311.879 null]
+>> endobj
+2354 0 obj <<
+/D [2345 0 R /XYZ 90 236.651 null]
+>> endobj
+2355 0 obj <<
+/D [2345 0 R /XYZ 90 236.651 null]
+>> endobj
+2356 0 obj <<
+/D [2345 0 R /XYZ 90 204.096 null]
+>> endobj
+2357 0 obj <<
+/D [2345 0 R /XYZ 90 173.191 null]
+>> endobj
+2358 0 obj <<
+/D [2345 0 R /XYZ 90 142.286 null]
+>> endobj
+2359 0 obj <<
+/D [2345 0 R /XYZ 90 111.38 null]
+>> endobj
+2344 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R /F91 520 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+
+2372 0 obj <<
+/Length 1224      
+/Filter /FlateDecode
+>>
+stream
+x��XKw�8��W�XX�I�]'��4��d��*�ɑm�q�
8���B��I[g^+���}���~���%R�
+*��Y��@�)���mH0�4�q�R�Rݭ�ls������R��H�]F������t��E�GC�qx�����+=�eD�P�
R	i(e���b����뀀Y8 �
�dL����8���E�K��9�
b��׃��y��fi.ο���G"d�
�9��Z-2=ciwդ\�G��^��\t#��!�Ki%��k�k�
�X׏Z�e/>���ʧ��"��R-��&"���״pa�l#�X�2��y]�2���1��3���t��wV�/� �	մ����
u�������1"�{3׹.U���YY,w<�YVD����|n�>aL3���؀�$2�����R�?u;�P+���ϊm��/�`���Q��^-6���rNM�
�6�sF��=�`�	!�
	B��!��"


� �@��õ��Z�?�O1�0NO��š2��oi%&�&�P
���i�9"FD��!��E��=J�8��њ:J�Z;

+L�����
u��VRlž99�L9��P��h2f�1G^��1��-&֭z9֥]��|��
D4EI
��MZ9wٻꃸױv�n��c�0붅w{�yI
$`����R�
+��y�3�a���S�b
z�r��:�!̆�����uD�xJ�W*Q��qE���{O�|SY��Pp����n�+�����+׮���b-�l�>��t$
+�@[YM�i��2$�:��FD�k�s�=���e�<3�"(J �=�\�>�p��ȕLe����?�Z^@�E(�*O}����]��C�7�ېF���U�qT�q{=��CS;PYV��,lX�Y�Xg�6�nj3G�Un_ّ�LC��s�R��>
����:�?m���1����I�
��M��y�<�1���d�7��`�4ɟB���{��M�
�	d�%�*�ދnm�J?���>
S�� ��dz�<=�H�`�nư?��Q�f��Cz���?4����j����������|�����k5w��LY��M���@
?X�`|P�Ze�xX_˪E3|T�J����h�@ֵ�I����կ���x at 1�4��t_׫W��x=�t>G@��lo_�
+�
�ڬ-��9l.-�}���s��� B��1��6'����m��-Y𦀼l5�����
+endstream
+endobj
+2371 0 obj <<
+/Type /Page
+/Contents 2372 0 R
+/Resources 2370 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2250 0 R
+/Annots [ 2360 0 R 2361 0 R 2362 0 R 2363 0 R 2364 0 R 2365 0 R 2366 0 R 2369 0 R ]
+>> endobj
+2360 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 470.504 194.497 481.408]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_a29127d8da5f0b833c4a89dbe3d41be27) >>
+>> endobj
+2361 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.942 432.707 179.274 443.611]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_afe2f6db5c7f1a92104fe7efa0c301a45) >>
+>> endobj
+2362 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.09 432.707 263.677 443.611]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
+>> endobj
+2363 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 339.634 218.019 350.538]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
+>> endobj
+2364 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 339.634 250.955 350.538]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_a40a81d6ee69dc679f08c5e89a101dfbb) >>
+>> endobj
+2365 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [137.432 301.837 218.019 312.741]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
+>> endobj
+2366 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [218.517 301.837 259.253 312.741]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation_adebb1fbe14ec8f0b88fb538b86f0873b) >>
+>> endobj
+2369 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2373 0 obj <<
+/D [2371 0 R /XYZ 89 770.89 null]
+>> endobj
+2374 0 obj <<
+/D [2371 0 R /XYZ 90 721.073 null]
+>> endobj
+813 0 obj <<
+/D [2371 0 R /XYZ 90 603.661 null]
+>> endobj
+270 0 obj <<
+/D [2371 0 R /XYZ 90 590.872 null]
+>> endobj
+2375 0 obj <<
+/D [2371 0 R /XYZ 90 494.449 null]
+>> endobj
+2376 0 obj <<
+/D [2371 0 R /XYZ 90 494.449 null]
+>> endobj
+2377 0 obj <<
+/D [2371 0 R /XYZ 90 454.918 null]
+>> endobj
+2378 0 obj <<
+/D [2371 0 R /XYZ 90 363.494 null]
+>> endobj
+2379 0 obj <<
+/D [2371 0 R /XYZ 90 363.494 null]
+>> endobj
+2380 0 obj <<
+/D [2371 0 R /XYZ 90 324.048 null]
+>> endobj
+2381 0 obj <<
+/D [2371 0 R /XYZ 90 257.552 null]
+>> endobj
+814 0 obj <<
+/D [2371 0 R /XYZ 90 134.312 null]
+>> endobj
+274 0 obj <<
+/D [2371 0 R /XYZ 90 121.523 null]
+>> endobj
+2370 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2411 0 obj <<
+/Length 1403      
+/Filter /FlateDecode
+>>
+stream
+x��YY��6~���[%�撔�#}k.$M�m���&0h���J�Cɻq}���c�=���)�`��9���͌fD�-<�
�:��J���,��7�{��(C,���w�'i�y��
��,!3�����F������ˀ�_�#V��$�����3�f0���(�R��,*���p-����kJ|h
+!���\
+�7\NE0�
���//�ͼRv����UUl�b����'��M3���J>3������v?�i�f�c8���՗F��%�c�g+�&�ޔ�y/*��v�Q�����ʆ;�
.i��KS�����$H�"� 4�ߋr"�
�Z�i�W��u�.@"D�Ѓ �8
�C��C�m��
����C�&�W�|�i�9���}GD at R��{�
8	Q�������R�'�]`ؗ������0�)+*�pk5�j��h��zŧb<�K!�����f~�D '�R�7��� Z
i*C����Q4k���s�V�����_�i�:�1���U��m���Ȏr���5i��Y�]�o"A�d�"t�CR���CP��� �ϵ�'����x0�Lw����Ko���8m�l7���H �pv�,�.ʝo�r�l~q� ����Z��T&~�3�J�c���/
�+{L�2����� ��K�C�i�e3��ԍ(��ش�գ��"��5Do�s����q�֐A�CAtb [...]
$vH�0���@bY��@2�'����Kk�����2.�EK~54�	p�;
}P��+;W��8�J^�����ޗ{�R��ݻ���$��X��*��{n^�Mm��U�
X�EU�]	�L���!��-�V�@S���N��zǶ-� X�
�E�S�MY�Aĭ厨��S���C{���;�B�'�䤂������Ȝ.w���*����
�
&�%�������E>�E��%�
s�s&�4
T�жx�ji=�Es��S'�P.6�$�ch�Q
�ƫ
+�~�e��S��T��
6�E�
�Gڏ��a�6�G[����_!��*瓢7�_i��z�_P��'�W\�h�F&Lo䆽6�M���h���5B�ƈ0ӿ�q�DNc�z<WU9�J��5��w�W�_WJ�ǾX��+n8��YLQB������l{,��8{,�
9�
+�S���	�7�>�=��Q����$D�V��hԝ뜿���\����3�\���-|yE�uR�5����)��
���k^l?���OלC���W
CxօhI������o����l����eӬ���M֋Z��V�MG�
+'	����
�Jui&K�O��!����,�
+endstream
+endobj
+2410 0 obj <<
+/Type /Page
+/Contents 2411 0 R
+/Resources 2409 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2250 0 R
+/Group 2368 0 R
+/Annots [ 2382 0 R 2383 0 R 2384 0 R 2385 0 R 2386 0 R 2387 0 R 2388 0 R 2389 0 R 2390 0 R 2391 0 R 2392 0 R 2393 0 R 2394 0 R 2395 0 R 2396 0 R 2397 0 R 2398 0 R 2399 0 R 2400 0 R 2401 0 R 2408 0 R ]
+>> endobj
+2367 0 obj <<
+/Type /XObject
+/Subtype /Form
+/FormType 1
+/PTEX.FileName (./classparma__polyhedra__library_1_1Polyhedron__inherit__graph.pdf)
+/PTEX.PageNumber 1
+/PTEX.InfoDict 2426 0 R
+/BBox [0 0 210 192]
+/Group 2368 0 R
+/Resources <<
+/ExtGState <<
+/a0 <<
+/CA 1
+/ca 1
+>>
+>>/Font << /f-0-0 2427 0 R>>
+>>
+/Length 385
+/Filter /FlateDecode
+>>
+stream
+x��SMK1��W��tf�l�

+"<�

J�_"�`=����M�m+*
e��%��M�˼)� 9
&BE5�~����o`4Gؼ���
�>„Nj�� 5�R�-��q�����n�8��gUXc��ۈ5��\���Y"�
p�I� �U<��rYdܪ�c��� [��
|� �N��V�
+�ZM���!��TY+�$cd�)��L,	M	�TI������)�By:�P�"�(b�
��(R�	X�Y;QF��4쩶B��.�+�S�:�Q����Lؕ�n�f蝥�:�_`���q~i[c��k�vr(�t���aX�6���a��F���Di�#�<Qӵ?rO��

�&��8ܡ�	���k
5,��{Ey/?V$]j�\��_�[�0�ʓ:�՝�Go �
+endstream
+endobj
+2426 0 obj
+<<
+/Creator (cairo 1.10.2 \(http://cairographics.org\))
+/Producer (cairo 1.10.2 \(http://cairographics.org\))
+>>
+endobj
+2427 0 obj
+<<
+/Type /Font
+/Subtype /Type0
+/BaseFont /TRNMIF+FreeSans
+/Encoding /Identity-H
+/DescendantFonts [ 2428 0 R]
+/ToUnicode 2429 0 R
+>>
+endobj
+2428 0 obj
+<<
+/Type /Font
+/Subtype /CIDFontType2
+/BaseFont /TRNMIF+FreeSans
+/CIDSystemInfo <<
+/Registry (Adobe)
+/Ordering (Identity)
+/Supplement 0
+>>
+/FontDescriptor 2430 0 R
+/W [ 0 [ 700 556 556 333 833 556 556 222 500 556 556 556 222 556 278 667 556 722]]
+>>
+endobj
+2429 0 obj
+<<
+/Length 2431 0 R
+/Filter /FlateDecode
+>>
+stream
+x�]��j�0E���Y���G^
CI7^�A�~�,�RA-
YY��+�*����3W�/�skM��ݏ��@�X�yo^2�|56++RF���.�<��y
+<�V�Y]S��)��6Oj��!#���+��^i�u��9���@E�4�X��^�{S���VE݄ym��c��hI��''${a���E\
�:�&c����	�^�o�Syˋ�T4��D���V�����AGh+�@�SΠ3�G� 
@=h��է@k/��b�F/��,P	��|�]�c�{	f��{���}
<]uJz��X��7�ŕ�_���
+endstream
+endobj
+2430 0 obj
+<<
+/Type /FontDescriptor
+/FontName /TRNMIF+FreeSans
+/FontFamily (Free Sans)
+/Flags 4
+/FontBBox [ -1166 -469 1518 1050]
+/ItalicAngle 0
+/Ascent 1000
+/Descent -300
+/CapHeight 1050
+/StemV 80
+/StemH 80
+/FontFile2 2432 0 R
+>>
+endobj
+2431 0 obj
+298
+endobj
+2432 0 obj
+<<
+/Length 2433 0 R
+/Filter /FlateDecode
+/Length1 1744
+>>
+stream
+x�UU[pe>��IzIh���^PҴiz�\JiK���4�
+�@h�-I�4-�J
+��_
+��02>�<8��#<��R/�耀N�`
�n<�i ��/����9�wο
 r�
(X�$��0w�1�|jw�M
gS�x�����>v�� ��:g
��D@��+b����|�{ E�=�Ԟ(@�ʣ(�'����]ʡ�)�0�  
���`��F����J�&��Y��Z�C{�Ι6S%-�(0������:��T^�j�Z=gs:�f�s"v��X��=O(�����`�책��
�8u1��Lcp�Y��C
�� �!��l.
z5W���ޖ�j#��n6�+r46g+)`�z��jt�>/Ϥ�T��Hpg��LS�BKY�FskSs�<�9P<���$3��v	W�閼J���6���
s�erEI��l��
+_��DTjU}��@'Nn�i
�Dǚj�l��y�_�aQ��״o�p��vm�<Ӆ`��3FD�f-Nz���.��
����y����LT��X���u
�I��
+m>Ϯ�J�n:D=�X'���Y�p�f��X��C��:4]+�Y�4<�
Q�,
��^8��
+��:�i��[��\"�K��drGtJ�E����@�Y���@Y|�M��u�5
+
#��!��BNC�
ݩ��T\ʖ������q�Z=�X�S�´@�A�'r
}ip}�
�f�"':���p���0L&]�hH�A����U~�0+a�`�Ī�� �F�3pqD�~
z�Q��)����W�:4��F�o�X',3�[��|���oY"�\_����܃�3|� ��0�B(�LY�Crﰣ�`�OY��W
tN�vp<�8���N�y��΍�pz+)
N�HM
GR�׃�Oe�ȮKgr�
+������Z<���D�J��c�]5��������Mn�ݔ.�+a$��m'�
�`��\{��]��XW1����X�8�1V>��VQ�xY�M/�vs-���;I}bN^���:�Pf��
]N���B��bM4O�_���7mm�
+7��u�e
��Y2��$��[�yzS����� ˦b���⨱�������+��ԑ��C#�Qx����ȒQ�}%�蝷?
�np��d�d�U
DZ� ��
�L��l:�3��bSK
+h��"	�x^r��@.�!OJP�ۡ �C
,dN���eٮ–GT���������}B�|EV�b.d����~�!��O��6�W���~E�
�u��QC��ɸ��֥�\��K
���
��yD{����

K�~ �?K�;BD�X9r�7H�h	4��
�b�"U8�^vL�IY��0
+s��Jr��\��ѧq�
+endstream
+endobj
+2433 0 obj
+1334
+endobj
+2368 0 obj
+<<
+/Type /Group
+/S /Transparency
+/CS /DeviceRGB
+>>endobj
+2382 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 415.454 242.354 426.358]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a812e3b442d41612ca88f8905d6cb49bd) >>
+>> endobj
+2383 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 389.917 242.663 400.821]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a60ee53b704270f784fad7eab1a542bfd) >>
+>> endobj
+2384 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 364.381 229.362 375.285]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2385 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.861 364.381 275.021 375.285]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a4211b10c19024d7056b4e36e4d2b7cff) >>
+>> endobj
+2386 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 338.845 235.988 349.749]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+2387 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.486 338.845 288.271 349.749]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ae17f1279a841b6efc0efa6441878c025) >>
+>> endobj
+2388 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 313.309 229.362 324.213]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2389 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.861 313.309 322.621 324.213]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) >>
+>> endobj
+2390 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 287.773 235.988 298.677]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+2391 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.486 287.773 335.872 298.677]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a34c73f38bc99dbcb38cc7214e1e0e82d) >>
+>> endobj
+2392 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 251.277 224.093 262.181]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e32932e6ecc) >>
+>> endobj
+2393 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 226.115 232.541 236.645]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a513cc77545233d96c437ba7e1d001557) >>
+>> endobj
+2394 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 200.579 233.497 211.109]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a2b74eef4fc5f2e35ba14f734f0e8e167) >>
+>> endobj
+2395 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 175.042 230.169 185.573]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ac2e30d8774b244ed1bd206f76e786745) >>
+>> endobj
+2396 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 149.133 282.204 160.037]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3527c6d35935d9860c07b31970d6dfc4) >>
+>> endobj
+2397 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 123.596 278.727 134.5]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a7ce8a057ee2d4a20b8820da2bb6dc2af) >>
+>> endobj
+2398 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 98.434 227.958 108.964]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1217cb151cbdbbcf4391987b9e2d232c) >>
+>> endobj
+2399 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [231.774 98.434 266.961 108.964]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2400 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 74.333 269.164 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab6edbecd120074f2661ed2cd06ce1cd1) >>
+>> endobj
+2401 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [272.979 74.333 350.229 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2408 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2412 0 obj <<
+/D [2410 0 R /XYZ 89 770.89 null]
+>> endobj
+2413 0 obj <<
+/D [2410 0 R /XYZ 90 455.999 null]
+>> endobj
+2414 0 obj <<
+/D [2410 0 R /XYZ 90 430.44 null]
+>> endobj
+2415 0 obj <<
+/D [2410 0 R /XYZ 90 405.093 null]
+>> endobj
+2416 0 obj <<
+/D [2410 0 R /XYZ 90 379.557 null]
+>> endobj
+2417 0 obj <<
+/D [2410 0 R /XYZ 90 354.021 null]
+>> endobj
+2418 0 obj <<
+/D [2410 0 R /XYZ 90 328.484 null]
+>> endobj
+2419 0 obj <<
+/D [2410 0 R /XYZ 90 302.948 null]
+>> endobj
+2420 0 obj <<
+/D [2410 0 R /XYZ 90 266.453 null]
+>> endobj
+2421 0 obj <<
+/D [2410 0 R /XYZ 90 240.917 null]
+>> endobj
+2422 0 obj <<
+/D [2410 0 R /XYZ 90 215.381 null]
+>> endobj
+2423 0 obj <<
+/D [2410 0 R /XYZ 90 189.844 null]
+>> endobj
+2424 0 obj <<
+/D [2410 0 R /XYZ 90 164.308 null]
+>> endobj
+2425 0 obj <<
+/D [2410 0 R /XYZ 90 138.772 null]
+>> endobj
+2409 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F83 436 0 R /F84 438 0 R /F91 520 0 R /F102 1181 0 R /F72 334 0 R >>
+/XObject << /Im15 2367 0 R /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2485 0 obj <<
+/Length 2115      
+/Filter /FlateDecode
+>>
+stream
+x��[[s۶~ׯ�ۑf"� ;g�̉�t�&S��}J:��$��(��Q�Y� %єH�R�~$���

?�^^�.^ql�ȵ�m\�
�t�e÷��0&Yl2%����bo�J��R�7�›������jB�X�3!�8M&Sj��e��y�|'�B�'_�HӅ!ܝ�q�z����ӈ���A�9X�;��>��� ~~m`�\ǸS�bä
>#���#����T�sLÁ�٦\
11��� B�%�E�%����+�l�ff�(կ�JQu�I�6�;��j�^T�4��U
�����ȡ�
+�y������I�$Z�<���8����tB��Vh�I�f�"�Y�2̻�d��R��m{����͔�Y�i T�Cx5�#���(���$%^N�5��k,�夑��]� [h@�S�5�y�Ƴ�R�][���[x���0^6�	�-�<L�.BNz�(�����֢�6	�"��-����zpqڏ,:
X�Ɏ�Y?��MDZ�9�ÿE[��H,I�5�&&
�80��/S1�K��1�C�]��r5KN%(x1Q^�gS��d�� ײj y+�V��ܸ8������z�8\Gͺ�ˍ?Z���lת���O��Y�ϩCs��
B��}�i"����dԬ�S6��d���02�^
+�U�W�����xUL�X�����r���n�ih at J�ЀZ�f��_���Fj�
��H$�LJSR/#g�`9e
ZDQ�ki���\� �R7 �لq�N�I�֋�z3���,D��>5�A>&L��|Lf��0�$)��#�$�1ۜкOrVa2?�?�����$�G���G��8��p�! ���XC@�~�C������g���M>���
�
��
��
�
�E�R�;� �ج�w�Db���s���g</�~�ȼ"ͺN5��ti@�4���?![jΚ^��JC+ռ[�j\�Z��"J��=+a^��	3��<��!,�!��>����\<�n}�ۓd���I�}�y���Iv�W�O�r�p�+�

��4Z�.�d�ND0��{{�e���.,�/��¼ȼ�>�)�
S�m��.&*�WS��-�(�E]F-�HZ�����.��D���	;�h@ب�1��j��×#8�����A\F2�s& EY 
��S\|C at ZȬVDaI��% �f�YtC��C� [...]
+'�d��P�J/zD�� �S��� ����8~��S�����'�ݮ�ߔ)�x{����4��}����[Iu�N�9�;O{G���
	$z�[��h犞�QE�Bd��b��z&��u!��#�Z�0��~��������zW��m/��A�:���.�;Ž}��>�=Դ��z�{����~Q�����Ux�7��4O�L���
y�ѾyIv�wvz��!���J�V=C__�")�<ڨ˺����d�ޥ絬��a8
�x��X~۴�D�|��h��F�/oE��	U����.�[��� �|e�9w��ۯ����R��剿�&�

E����-𭗅^R�
;9�,�WQ��t�n%�I�3}�{��|-��0I�8�z{#��^�G��"���T�U��[��b��󭧙�m��uki
��
�P��a
��v��R=�3����p����
������zw��qw�l}p����u^����� �l�se��̞ܲ�R�ы��2w^F��r�
i#n>��� 4
��?�`�`����]1�I)��
X����!Q�<�駽Eؖ9y��|����C���goSa���m�r�7�ۗ%��k��fS�)���z�
�
�
g�~YNĖ��L�n���M�x��e�J����E�-t�_`�\�y�����kbY����_	�
+��fW ��2�T�6e 뽨AZ��/�n�*w ���)"�y*gY�..n�Xx��V鳵|��Ѓ<�V��f͆	?�*
A�k���-
��Mk�>�0„s�zl�՟�@���/13~L�/�����T
+endstream
+endobj
+2484 0 obj <<
+/Type /Page
+/Contents 2485 0 R
+/Resources 2483 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2493 0 R
+/Annots [ 2402 0 R 2403 0 R 2404 0 R 2405 0 R 2406 0 R 2407 0 R 2436 0 R 2437 0 R 2438 0 R 2439 0 R 2440 0 R 2441 0 R 2442 0 R 2443 0 R 2444 0 R 2445 0 R 2446 0 R 2447 0 R 2448 0 R 2449 0 R 2450 0 R 2451 0 R 2452 0 R 2453 0 R 2454 0 R 2455 0 R 2456 0 R 2457 0 R 2458 0 R 2459 0 R 2460 0 R 2461 0 R 2462 0 R 2463 0 R 2464 0 R 2465 0 R 2466 0 R 2467 0 R 2468 0 R 2469 0 R 2470 0 R 2471 0 R 2472 0 R 2473 0 R 2474 0 R 2475 0 R 2476 0 R 2477 0 R 2482 0 R ]
+>> endobj
+2402 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 697.14 269.771 708.044]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a9a6e20494d2e7c618d4c6aeab45bac30) >>
+>> endobj
+2403 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.587 697.14 350.836 708.044]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2404 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.81 673.514 229.095 684.418]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a945f11d66765e2f542f9c4fb654589d2) >>
+>> endobj
+2405 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.031 673.514 311.281 684.418]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2406 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.439 673.514 382.456 684.418]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2407 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.259 673.514 460.276 684.418]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2436 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.286 626.973 228.916 637.877]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a7e4588dc8f29c46edfb1fa34e6a9d424) >>
+>> endobj
+2437 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.591 626.973 311.841 637.877]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2438 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.658 626.973 384.675 637.877]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2439 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.369 626.973 461.385 637.877]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2440 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [187.81 580.433 229.095 591.337]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a110353a7864529b85d5465ac1bce2670) >>
+>> endobj
+2441 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.031 580.433 311.281 591.337]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2442 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [336.439 580.433 382.456 591.337]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2443 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [414.259 580.433 460.276 591.337]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2444 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.037 568.477 308.86 579.381]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+2445 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [189.286 533.892 228.916 544.796]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8f50e6dcc51327c56d99dc964961d6a2) >>
+>> endobj
+2446 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.591 533.892 311.841 544.796]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2447 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [338.658 533.892 384.675 544.796]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2448 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [415.369 533.892 461.385 544.796]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2449 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [265.383 521.937 307.206 532.841]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+2450 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 487.352 232.132 498.255]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2451 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.63 487.352 287.753 498.255]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a52ae035a37af93cc3115f3a45f4e032c) >>
+>> endobj
+2452 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.569 487.352 335.075 498.255]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+2453 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 463.725 232.122 474.629]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Gen__Relation) >>
+>> endobj
+2454 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.621 463.725 287.743 474.629]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_abfd8a93992bbf17101c53d68a44d9986) >>
+>> endobj
+2455 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.559 463.725 333.381 474.629]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+2456 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 440.099 232.132 451.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Poly__Con__Relation) >>
+>> endobj
+2457 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [232.63 440.099 287.753 451.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ac76c332a5b267f6b6bd749cc3b9e192e) >>
+>> endobj
+2458 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [291.569 440.099 341.7 451.002]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+2459 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 416.472 220.765 427.376]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a62737490fa8ee8763ee2ff8b54847670) >>
+>> endobj
+2460 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [224.581 416.472 272.511 427.376]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2461 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 392.846 253.422 403.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a950e7082860fadc45452ffe241de4488) >>
+>> endobj
+2462 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.238 392.846 305.168 403.75]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2463 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 369.219 253.432 380.123]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8a9706372c9b371938f04b68516bb407) >>
+>> endobj
+2464 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [257.248 369.219 305.178 380.123]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2465 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 345.593 213.014 356.497]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab780403b7f3997c5f5703ea0218c2841) >>
+>> endobj
+2466 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [216.83 345.593 264.76 356.497]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2467 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [159.127 320.258 186.574 331.162]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a5c577b51724616ef96f58ce0f2fec482) >>
+>> endobj
+2468 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [164.546 295.296 205.831 305.826]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1e5d8d199e0bcd20aeacd72b2fef10f6) >>
+>> endobj
+2469 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 271.296 282.603 282.2]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ae32bc538fedce99e602767b1065ad599) >>
+>> endobj
+2470 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.739 245.961 268.376 256.865]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_abf4b919c3b8d7dd958aab203fcabc4b4) >>
+>> endobj
+2471 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.384 220.626 212.486 231.53]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a284af200f2e06dcfc079a58b3d4d6a59) >>
+>> endobj
+2472 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [178.384 195.291 226.314 206.195]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_afdef7f8fe0ba899b496aaa369780dfda) >>
+>> endobj
+2473 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 172.038 201.946 182.568]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3d3179300b5bf2b41a40b5b76650f8e7) >>
+>> endobj
+2474 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 111.143 232.192 121.673]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a4399e57484eec3301f8b88011c53c35b) >>
+>> endobj
+2475 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [236.008 111.143 279.514 121.673]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+2476 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 87.143 238.818 98.047]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3797a521b54434e13ed2843ebd88a8c1) >>
+>> endobj
+2477 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [242.633 87.143 292.765 98.047]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+2482 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2486 0 obj <<
+/D [2484 0 R /XYZ 89 770.89 null]
+>> endobj
+2487 0 obj <<
+/D [2484 0 R /XYZ 90 360.718 null]
+>> endobj
+2488 0 obj <<
+/D [2484 0 R /XYZ 90 335.383 null]
+>> endobj
+2489 0 obj <<
+/D [2484 0 R /XYZ 90 286.421 null]
+>> endobj
+2490 0 obj <<
+/D [2484 0 R /XYZ 90 261.086 null]
+>> endobj
+2491 0 obj <<
+/D [2484 0 R /XYZ 90 235.751 null]
+>> endobj
+2492 0 obj <<
+/D [2484 0 R /XYZ 90 186.789 null]
+>> endobj
+2483 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F60 312 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2569 0 obj <<
+/Length 2765      
+/Filter /FlateDecode
+>>
+stream
+x��\�r��}�W�-P�r4���m��);��Yk�bo� �X!.��~}z.�
+ @Q���}H\zzzN�9=
+O�<���߮/�^)<�HK*'׷�'�k$$|[L>!����̈́�-�!{�ſ�~���{s�����o.�	q�
���|s��W<Y��7��'��M�	�
������\`�
+��$�.���'!���GJ�m�xl�a*0�(_]R|�$"�/�T`�Lq���~��n����>i���<M�|��<k7�|��	^����gy��21��i\)�W�B>	�ג�^S�$'�)a+���
�DT��
���ޝHoݙ�.v'\_L\��Ub��z�I�%_!E1������P�0)n�S׆oL��pÓ���BD����U�
�!.K�X|^�w�>w�7�d��$���U�l����%SA���9�` 5F���)
�y
+�������d
?p��C�[>�$����G
|��
Ge{��=э6*P��q���"�h
n�h�
A����W,Xy���z��(qn�
��/�<_� 8dm=��$����"l�>�D	DB
0�B;�����.^�.��d ��� $�>&w�G�i�Lj���6�D�0I]�����IQbRxL�3u��BCT�Șw`��9M��p�uXe�7�F�����A'J"�Q�Yp
+%us�����|{�C
+^�N�@s��zӱ��*՟��1���$��G�hD$=�|
�	~��4@� �B��,I�����#AQ��{A9RB
�~{D�!��	Ƞx���|�&�(�V��x0��B'�|���Y�G��N�� Nr��PUmQ��v��������V�D�L�,� (����}��02e��u�q��q=�IRb��
5B׬Vua��oĖR�����D�չѷ�n���&�'��|��~`L �OaD��;<ea���!��z
��wv�yN(!_%����������ѿ��5�����f�3��|��g�:�f�
+ۃYd��>w
ru5fb5u�*4�
ǝ�LA��M�zQ
3��^��)�w�\ͣ�l�N��nZG#�#,��!d���LW������}��1�9
�P *�ޥry|�o�t
G��g��v�����3@�)�r�ڗ�y�4ӽ#&�eP�)r�6q�O˅��'��p���:�ȋb8۽�O%R�q͛�ә�moA{��y�,�e��[T�6Zgq��a^������~��
��̉�ĭ�2H2J�K�%F1ƛm~)�R��,GVh���&Z>b�𿗄� ڭ��u��L0�s
�p؝��$�v��_���;�\�n��{��e竸{�z')��(OwOR80�C�
#B3��Uc66#��R�=�e�����
+	][��*T&�L�
)
��'
���&�n-{0��O��o��(T�	�ٵ��W{Z~�u��fZ�"h �~
�&+��p�e�Bw��wK_���eO!Lj�"3��)R�@Ga~U^�d�����V���ORQ��l����o3\�d�\���m�0�)��1|��
d�f�
Ao0D��F
)�9ݖ���v��XjA�<cb�
+�X���W���l�n��
MZ� 0�������&D\:�B��m�����뾚"
{j
+���@�h.���а�r�
+qʏj��H�p�[62�)���tW��XX��ƶ
�@Z)�!M
+ą�08㣶�)��T/�g
�(ҡn�Ds?
g1�'
�%쪃i��U�1���:����\a
� G{X��z�9P�f�U
]�;�(/]\�`Y}�*(�
+�Z�(�C!��w5lv	�P��V5��Ք	Ѝ
��lQ,ҫc8B�u���rH���'
Fa*��d���L��H
&y )%�\�"�H��|�$��<���<9��G������<�o�H=bW&�M��ݪ��M���Z�1M��
�j�=4ᶧ��Z�{�&���A��HRm��=?���  ��'��7��
�8��.25��5RT=!�S��3�z�쟂��j��ύ�)c=��2N�]�6/�ƨz.NR�έ1l�e�������M�~h��x��o�
/��?؛ u���Ô�Y�u�kӺ�S�r�rb�
O벽�/��7��
�~�����B��Kcu�o�W�@���h��h��݆֫.�"�Uq�4Q�^z����3�P��&����
GI��P��OF\����;��+:0�aU�5"�h�ڃ]�i�t^G�k���[�K����"
�&�2
=txUU�w��l+ԹUw/?
�=����0'�� \l����
+��3%��5]c�[k�+}Z��
)�q����;�t����$���!RV�t��r[f
$eA�R6����N]�)l	�>�x�v�2A�џ�|)S6J
���1R��
�`b}�
":*c6F�
�{�����߶�Q����Vh6�AU��bg��g�ճ׆׳`��g]7ܱp�[�
+�ֳ��C�	�@Imy�1�Ɉ�͇��%;��z~K�D�W�����”5�LS*

�|�w&�bOJQD)���1o侩l
��z���\2�r��x�j�wI�e4��
�
+	m��~��ÈS{���^,��'�^o���)��M�޴2X����
+���5
��ﱝ/�^�{��}x�8a�μ���� �~{m6��V��-�d��/fG�ϪEɾ��i��@��^�D ��ս��>.p�󿲷�4���ֺa�SR�$����_��n��,N�h�n
&U�0��m�K��)6��{'7w�=��+�L
+endstream
+endobj
+2568 0 obj <<
+/Type /Page
+/Contents 2569 0 R
+/Resources 2567 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2493 0 R
+/Annots [ 2478 0 R 2479 0 R 2480 0 R 2481 0 R 2509 0 R 2510 0 R 2511 0 R 2512 0 R 2513 0 R 2514 0 R 2515 0 R 2516 0 R 2517 0 R 2518 0 R 2519 0 R 2520 0 R 2521 0 R 2522 0 R 2523 0 R 2524 0 R 2525 0 R 2526 0 R 2527 0 R 2528 0 R 2529 0 R 2530 0 R 2531 0 R 2532 0 R 2533 0 R 2534 0 R 2535 0 R 2536 0 R 2537 0 R 2538 0 R 2539 0 R 2540 0 R 2541 0 R 2542 0 R 2543 0 R 2544 0 R 2545 0 R 2546 0 R 2547 0 R 2548 0 R 2549 0 R 2550 0 R 2551 0 R 2552 0 R 2553 0 R 2554 0 R 2555 0 R 2556 0 R 2557 0 R 2558  [...]
+>> endobj
+2478 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 707.957 236.068 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a95c109d667deed44698d16eb25efef9d) >>
+>> endobj
+2479 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [239.883 707.957 317.71 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2480 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 683.806 242.693 694.71]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aa01e5f8c42361cc03aba32786c4f9e3d) >>
+>> endobj
+2481 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [246.509 683.806 330.961 694.71]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+2509 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 649.07 263.186 659.601]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_acdf10439693c83932d0de9a5cf35b396) >>
+>> endobj
+2510 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [267.001 649.07 310.507 659.601]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint) >>
+>> endobj
+2511 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 624.546 269.811 635.45]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_af04e7f91e1cfaf69dcee2df81c3d64c3) >>
+>> endobj
+2512 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.627 624.546 323.758 635.45]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence) >>
+>> endobj
+2513 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 600.395 267.061 611.299]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_af26aee5944d076192d5f6a12086c28f7) >>
+>> endobj
+2514 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.877 600.395 348.704 611.299]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2515 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 576.244 273.686 587.148]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a66510fe1afe13b5f7334057bc96efa36) >>
+>> endobj
+2516 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.502 576.244 361.955 587.148]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Congruence__System) >>
+>> endobj
+2517 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 552.094 249.905 562.998]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a6be74fc6a3ef7d8e1c1939536af2a943) >>
+>> endobj
+2518 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [253.721 552.094 301.651 562.998]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2519 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 527.943 255.993 538.847]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_acd5b7ab06d657819656175f7d6a0cd0d) >>
+>> endobj
+2520 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [259.809 527.943 307.739 538.847]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2521 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 503.792 243.549 514.696]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a6e35f9362b9f7ed65be59ae07f1da622) >>
+>> endobj
+2522 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [247.365 503.792 295.295 514.696]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2523 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 479.641 251.011 490.545]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aef8d1e4a767f5ea79384588d0e19b83c) >>
+>> endobj
+2524 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.827 479.641 302.757 490.545]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2525 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 455.491 282.005 466.394]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a6c51199902356b837c63915caaab7a40) >>
+>> endobj
+2526 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [185.568 429.347 311.394 440.251]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3d6404d09696f8b693b9260d267df2c3) >>
+>> endobj
+2527 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [315.21 429.347 363.14 440.251]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2528 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 394.238 225.298 405.142]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a99adfdf68b5bee7b3963a15c4183e136) >>
+>> endobj
+2529 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [229.114 394.238 264.301 405.142]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2530 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.856 394.238 359.105 405.142]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2531 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.74 394.238 427.757 405.142]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2532 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 359.128 238.02 370.032]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a501e48144147e2563edc52dcd49503f9) >>
+>> endobj
+2533 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.836 359.128 277.024 370.032]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2534 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [294.578 359.128 371.827 370.032]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2535 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.462 359.128 440.479 370.032]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2536 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.335 324.018 265.386 334.922]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a701a35ba2b5418869a471932535cf9e5) >>
+>> endobj
+2537 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [269.599 324.018 304.787 334.922]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2538 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [323.235 324.018 400.485 334.922]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2539 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 324.018 513.996 334.922]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2540 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.176 312.063 208.193 322.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2541 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.345 275.751 276.117 286.654]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a1b75c266a974976557206ce451e45967) >>
+>> endobj
+2542 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.335 275.751 314.523 286.654]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2543 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [331.001 275.751 408.251 286.654]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2544 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.542 275.751 519.792 286.654]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2545 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [162.176 263.795 208.193 274.699]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2546 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.436 227.483 276.092 238.387]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a5955d6b18f4135b382ca0db2479c11ac) >>
+>> endobj
+2547 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.856 227.483 315.043 238.387]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2548 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [332.503 227.483 404.243 238.387]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+2549 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [436.747 227.483 513.996 238.387]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2550 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.232 215.528 193.249 226.432]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2551 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.345 180.418 287.723 191.322]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ae899d1e624241d1328d6c6421f5485e6) >>
+>> endobj
+2552 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.941 180.418 326.129 191.322]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2553 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [342.607 180.418 414.347 191.322]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+2554 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.869 180.418 523.118 191.322]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2555 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.232 168.463 193.249 179.367]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Coefficient) >>
+>> endobj
+2556 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.237 133.353 275.893 144.257]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a920814c13d635e9a503551b0988c2958) >>
+>> endobj
+2557 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.557 133.353 356.806 144.257]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2558 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.639 133.353 445.379 144.257]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+2559 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.703 133.353 513.996 144.257]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2575 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 121.398 171.361 132.302]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2560 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.345 86.288 287.723 97.192]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) >>
+>> endobj
+2561 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [290.941 86.288 368.191 97.192]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2562 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [384.221 86.288 455.961 97.192]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol) >>
+>> endobj
+2563 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.482 86.288 513.996 97.192]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2576 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [125.095 74.333 176.342 85.237]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Linear__Expression) >>
+>> endobj
+2566 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2570 0 obj <<
+/D [2568 0 R /XYZ 89 770.89 null]
+>> endobj
+2571 0 obj <<
+/D [2568 0 R /XYZ 90 470.878 null]
+>> endobj
+2567 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F84 438 0 R /F91 520 0 R /F38 2572 0 R /F104 2573 0 R /F102 1181 0 R /F42 311 0 R /F103 2574 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2641 0 obj <<
+/Length 2487      
+/Filter /FlateDecode
+>>
+stream
+x��[Ys��~ׯ�[Ȫ�h
�I�Re{c{���c9y��ł�D� � (����pIK��T^�!������;
;o�^~��~�cG �Q��4wv|W �����<"q6���h
i8]��2��p�Jn��؍}<B��LϘ�<O(ǣW��,u�c<�U_��bX�0% �_?���˧�߯Є
�i���Yz��W�D������U�Rǥ
�+���oW�
��T�
\'��y�<
q1���	A��#�(�d�I"]6�rI��kAZ�X�|&�S�eR�A��)C��A�^p]��?��4
<Z�?�'�l�}�ଭ�I��+��u<�����6���3)>
+W��Hw�s)�/�,n/�
+�d�h ��Y��Z*VKC�K
���+8��Cz
�k���u]g����'����A�L�}���E̳C~�rG�e��4D���
�S u$��
@ch��� \�
ީ7�.��W�
��#�x�q�@���3�+�?@���5+�R%
���^[�'$�f�> 3�B)��r>O8�z��)�I��C�)O"3^jj�0*�Q͔�6p����0ɦ�:���(I�4(jo$��
\p�1!dIx�����I"�V!��	]š�s	��
�f��<]o�D�<�E(��*ɢ"�*13�����P�ʎ��
�zj+�쨭""�O�?��0qhw�څ��bH#<D��`B�Be��l�;��hLF�UC��������
:>A���U�E�#����ZNo��
����X���@c��?�g	�K�qG#|�s4�U��H"r�WML�
�]��X��.���q�@��|K��f�6�-c`&�v���z]��#(|+�=��a��ǵQ
a���6�bɆ�f��P�`�a��{\�
�/wS֩�N�U�:0�
��ZN�C:<�z�*��]���r
�Q^��?]�Z��f 
��*Z
H���
��u�� P)
+<gJ�5��1�[_L�dM�W�8
�C��gfѠ:B�Y��
��
����b�>zjc`:r�������,s��aAhx�>ܙF
%�]�C?�>��к,4�ج��s�l�=
+Kr9�	��_L]˭
������W���l���y�
<�Y�2^������@ƃ�?
kF��
+�ޓ��ogA�0�������$��l@�
e#hO<{��,FP�.�K�/����g
+̘J���r�[+�>$�yE�(���
���b�C�&�2�F��ƐH�
L
����h��]��Fw��k������ �
���.����I�*m�hH�5�<6�j��Ȼ����
� 1,_*
+|..X5go��[@0�zO
"���
+ӥ�>�l-)W�a$+u�Vޏ)�9�/�q��Iz�w�2T�K���`��)��fU�lM@߼̵
I{���>����b'K�� `�`�m3��Ami�>�2
ʷ�L������q*c���Ѥ[:�N�&
+���.�1d�8i'XY���Z���������L�N�x�<ĥ����
���;v�5��{��e�l ���d��k:��ʡ�ĺ�–��,jr�!�G|�|~V���q�
�eq�����(ꢸ�
��`ø���P�>~@�X at pp���	C�l@^���<����/F�!�/^�L��#����YTI������*�9t>Ѓ��HW�}Y�و�(A�!��	���Aw�
F�Ʉ �`'��<�E����7o��`�m.eh	�
U�����/��ԏ�G��[C�q��T��I2�QC�	�Y%e%�.�U�U=��*ߎ}W�,�b�
X�k3=Tr\��
��ɟ��4L�R�Fd�ߪ�Om�}?V̗/����չ�Vn���Z�
+f	 ɪ��Xu�Ӹ*�+P�Y���	%H�*��R�{�$�7;�~�ԁY
;렂��Y
	
Xͪ6E�gQ5}
��^c�����n�
��L�,I����x*
��&&k��Y��|m��~p����K��2X���}˛��.
RfW����@swL.��_��^��,�U��
+e���z
+�>�}������V�12z������$��������Ώ+�	�2
\�#���.xt1��
o4�qP��7
�1\cjq�V�Xv�=kص�����_O�����
;X��6�g�.`��]�{��k���j�l
+�-~�6�5�b�^���6Ga~A11JT�k�/|�4�@Ҭ����
�����b6}F�O@#Ec��?qϸ~�/r���
��{��O�lO��""\|�(}5`T �/^�x���۾6��/aA
+\��KX�������~�V��� �zH����ׇX*h�tT-��Ϻ�.�:�
����a�؄
3P����+O�
+��2.�0�ܦ��lcK^RI�M]� �.�@�d��Ml�t}��
�������	(�����/�j�����͢���f��#܈kn�bi^Ķ�
/Ӱ�ҁ ,�9&��Q�@���Wa��T�h�U��h^\��2��
��������

+endstream
+endobj
+2640 0 obj <<
+/Type /Page
+/Contents 2641 0 R
+/Resources 2639 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2493 0 R
+/Annots [ 2564 0 R 2565 0 R 2596 0 R 2597 0 R 2598 0 R 2599 0 R 2600 0 R 2601 0 R 2602 0 R 2603 0 R 2604 0 R 2605 0 R 2606 0 R 2607 0 R 2608 0 R 2609 0 R 2610 0 R 2611 0 R 2612 0 R 2613 0 R 2614 0 R 2615 0 R 2616 0 R 2617 0 R 2618 0 R 2619 0 R 2620 0 R 2621 0 R 2622 0 R 2623 0 R 2624 0 R 2625 0 R 2626 0 R 2627 0 R 2628 0 R 2629 0 R 2630 0 R 2631 0 R 2638 0 R ]
+>> endobj
+2564 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 686.059 293.621 696.963]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a7f35fe17c4c48b15ddb66e52e110c2bd) >>
+>> endobj
+2565 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [297.437 686.059 332.624 696.963]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2596 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 651.229 297.497 662.133]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ada449a9c1a600893585256666d6fe331) >>
+>> endobj
+2597 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [301.312 651.229 358.089 662.133]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+2598 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 616.399 240.501 627.303]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ac034ebc28209bd38f90ba23323f65c41) >>
+>> endobj
+2599 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [244.317 616.399 292.247 627.303]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2600 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 554.119 193.906 565.023]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aaec18d4d5bd29cd38e153b4602e027da) >>
+>> endobj
+2601 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [197.722 554.119 245.652 565.023]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2602 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 530.248 316.306 541.152]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a0e578573084aafbf76c85db7dd1363be) >>
+>> endobj
+2603 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 506.377 317.412 517.281]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a3cdef8e8e717e8aae495db38ab2f3555) >>
+>> endobj
+2604 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 482.506 250.443 493.41]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab11bfde2a1ce71a607644a38cb914b13) >>
+>> endobj
+2605 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [254.259 482.506 302.189 493.41]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2606 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 458.635 280.59 469.539]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8561bc8f545197343c8cf1935e794af3) >>
+>> endobj
+2607 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [284.406 458.635 341.182 469.539]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+2608 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 434.764 311.026 445.668]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) >>
+>> endobj
+2609 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 399.934 275.759 410.838]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_afba20cade6fa4fcd26b81086a02923e5) >>
+>> endobj
+2610 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [279.574 399.934 314.762 410.838]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2611 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 376.063 267.061 386.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a427ee580c9a357d0e154cd2520dbe33a) >>
+>> endobj
+2612 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.877 376.063 327.653 386.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set) >>
+>> endobj
+2613 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [349.481 376.063 384.668 386.967]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2614 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 352.192 268.167 363.096]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a00413902e11b669bca9a8c81438202ee) >>
+>> endobj
+2615 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [271.983 352.192 340.246 363.096]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Partial__Function) >>
+>> endobj
+2616 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 264.009 227.679 274.913]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+2617 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.177 264.009 271.664 274.913]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a9dd3a06d94e54ca59e0c41901d9f9a06) >>
+>> endobj
+2618 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.535 238.185 227.679 249.089]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+2619 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [228.177 238.185 319.264 249.089]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ab8ef27e25132c083ae1b59d3162fa21a) >>
+>> endobj
+2620 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 212.361 230.519 223.265]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_abdf75082ed3ae874de8fa5cb0198e080) >>
+>> endobj
+2621 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [234.334 212.361 276.157 223.265]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator) >>
+>> endobj
+2622 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 188.489 234.394 199.393]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a73a395dac9898b73e0782a47f4537cd7) >>
+>> endobj
+2623 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [238.21 188.489 314.353 199.393]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Generator__System) >>
+>> endobj
+2624 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 164.618 241.617 175.522]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a56e3a5f9a94fb76a527fedea1bbd83cd) >>
+>> endobj
+2625 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [245.432 164.618 293.362 175.522]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2626 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 138.794 266.244 149.698]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_ad38a887658485f32f589a57a74e6a78c) >>
+>> endobj
+2627 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [270.06 138.794 317.99 149.698]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2628 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 112.97 282.015 123.874]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a81715f656d39c399cf4d63b72635194c) >>
+>> endobj
+2629 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [285.831 112.97 333.761 123.874]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2630 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.54 89.099 262.638 100.003]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a268b22472143daa3e8f2d0828d1ad565) >>
+>> endobj
+2631 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.454 89.099 314.384 100.003]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2638 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2642 0 obj <<
+/D [2640 0 R /XYZ 89 770.89 null]
+>> endobj
+2643 0 obj <<
+/D [2640 0 R /XYZ 90 279.053 null]
+>> endobj
+2644 0 obj <<
+/D [2640 0 R /XYZ 90 253.432 null]
+>> endobj
+2645 0 obj <<
+/D [2640 0 R /XYZ 90 179.866 null]
+>> endobj
+2646 0 obj <<
+/D [2640 0 R /XYZ 90 154.042 null]
+>> endobj
+2639 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F91 520 0 R /F102 1181 0 R /F42 311 0 R /F103 2574 0 R /F60 312 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2676 0 obj <<
+/Length 2583      
+/Filter /FlateDecode
+>>
+stream
+x��ZY�۸~�_��PUqpk+U뱝�c;^{����8�aE"eR����4����V�����F�����`
��oO�/._H
�(T׳ Ɓ�b���CEG\�
+�P��&�ޫ��~����yw������W8 n>GR����?p0��WF,V��
�
"��>\�v��)�m�h�D�DfHB!΀O�r���|
s��,Y�#����
���Ц8�өo�,����v&$\��t��7O}�/�n��e]$�|2��&)�t����0�;�����㝞��\>���1-��U��`I��o><�k�
2bR>��8|�x3�{�P$T0�Ŝ;���3]�l�̀������l���݈�F`D�j��lm}4�ŀ0��~�_wcq5b�'�κ���
�Zb!"3o,��8&�����rU�"
�#��{]��4���N�F1b2��f�v��Yg�
+ݦ��)�)��l��'�r�Y��w3n�3Y��k�l�[�?ˈ�K�yb����l��+͜?b�Z�(\;dR�1���%�ګ�dm7z̸�E�
>���ĭTr
�����TO]�]<���5�/��ʽ��Gm[JH��f���!S)A�VcPgc{�0&`����X,�	��0�ͨ
+���ht�y����=�n��atA�f4�{?�1���C1�����p8G'��
+��ԣ��D�`>@��A3d>��� �a
e�c������
�����
+t86�u
��~nj ��8fP�D��Y�(�����8+�!V=�$>�`�T�iH��$SE��|�M��T����=f���r`��?J��R�-�1�A
:�B�� 
�
h����R-kg�# nh$�j�)w��v�3�;
+����ُA��J,UT�Xk�D��eH�����
�?G���X�D�׫O������c&	��>�S����C���
�C�{ɵ2V@�������5I�m����'Ue�u���F-o��
%�bȩR}orY���sr)��� �T�)��\�/�K5D.s
a�#�U^�F�dF��
�`���C��AV�
�*��Ѻ�(�;�
���Phӣ���[w$Tpv���HR����
�8_[t���PŇ�i;�;}Wс�*�z�8��D��
k,r*M���?���HE�T n�<d
6�n
���E$�y��H���d��XJ��;]�{
+��^�B�$$,���
���"y?��8d(`��3�N�E%�.'E���jO��I��
�*1���T��;;)���
+�k�tg��]������}{eS��vD�*��rV;�j_b�k����m�+��r��TC��|VEn��Cr/�ȩ����ǭ
D-�r�l���2i�!�O�(K8���`�-c�^s���f���[_�g��g[s�h
Ipw�����>���M	�e�ʻ|��r �:>�?�c��o�Z�oL!R�4u��ʬn��
�j�f�
�%2�r�۶�;�Z[
&�A�L2���k�j���@���'�\��$���O��êJ��\�IZ�
;�=�Bc��.�l�,L���7
,��")���&�T1?
�y�zh1� -�
FT8�,u��lpD��7,>���c�Z�+��ۅ>"��n�qY����3��	/�|��'֪d+G
�uh�w
���N�m�/t���b�l:�DY�3
+2`{> �Sq�	�~2꬜B�$Q���:�L"�Ѵ�^D��"��ޅ�h�
qG�F�;5&� f'c/���B�;
�Q���G1д"M 2��
��X]��&��A�r8�
+�:����ۇ
g
h������zSd�lJڶ���Zl� ��
�����z�#�*,��<B��L��"��Z4牴�
�s|�"*ޑ/�����������@%
u�=�`Μ��_&z��Щg뉜#��m�
+�.������@���eBҊQ8J����{B	<I_�����Bs/�����5�_�
ʣAl$�%����tl&Y�ӛ_,Iu)�_�F�4{A�*
+����d�.Rl�n��/ ��=�0ٓŠ���a�u�q}�
+�C��Fis
����XGLr��U2�s���KW�ZT����
T�}��ck8�a-�G�n��@�΋�o��`����`���ըx���
/ �f���C
$�XY ����۱�f@�Y�1�t��~$1�W��u
J���
֙3��k���_(V�x3���
<�*Nn���G�
��4��5T露y�eeٵ.K�V�|�<A���؝?WC����
#�!�0ϋ�
/��"���i��m��}��4߶v{�z��	Y�8�$bE�&zv�D M�3��� �&Y2��dL-�g�L�`��l�tF�T����8S�'P���\_1w�)���6���>�������t�V�H���"����ގtA���?��d[#�xl}��`"%�/�m����;._.Y�,a��1�7��W�ʆ�����to�߽{��Z�u��7��4_ ���O�(�?K]�e�y���{����Æ�DV�V��"s���Z�
���z�����,�ܿC����n�^�tyy���:��I��.��d)n�V�m/�.|棓�0������_
+endstream
+endobj
+2675 0 obj <<
+/Type /Page
+/Contents 2676 0 R
+/Resources 2674 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2493 0 R
+/Annots [ 2632 0 R 2633 0 R 2634 0 R 2635 0 R 2636 0 R 2637 0 R 2663 0 R 2664 0 R 2665 0 R 2666 0 R 2667 0 R 2668 0 R 2669 0 R 2670 0 R 2671 0 R 2684 0 R 2672 0 R 2687 0 R 2673 0 R ]
+>> endobj
+2632 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [173.765 707.957 332.797 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a9f1fcbebed65fafcc7439ce24392b59a) >>
+>> endobj
+2633 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [337.725 707.957 385.655 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2634 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [397.971 707.957 475.798 718.861]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2635 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.345 661.133 310 672.037]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a8bf0912e9b611d41ee76da66fd1bd28f) >>
+>> endobj
+2636 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [313.217 661.133 361.147 672.037]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2637 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.885 661.133 447.712 672.037]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2663 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.144 614.308 337.254 625.212]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_aee40105531fe1008562584274189cf35) >>
+>> endobj
+2664 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [341.371 614.308 389.301 625.212]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2665 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.794 614.308 477.621 625.212]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2666 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.345 556.525 316.077 567.429]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron_a58869dfc76ca4a5a51e1e130096cfc88) >>
+>> endobj
+2667 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [319.295 556.525 367.225 567.429]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2668 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [375.963 556.525 453.79 567.429]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Constraint__System) >>
+>> endobj
+2669 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.806 411.183 195.736 422.087]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Polyhedron) >>
+>> endobj
+2670 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [454.44 411.183 513.996 422.087]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2671 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 254.888 201.372 267.286]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2684 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 241.383 201.372 253.378]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2672 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 130.917 201.372 143.315]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2687 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 117.412 201.372 129.407]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2673 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2677 0 obj <<
+/D [2675 0 R /XYZ 89 770.89 null]
+>> endobj
+2679 0 obj <<
+/D [2675 0 R /XYZ 90 473.835 null]
+>> endobj
+2680 0 obj <<
+/D [2675 0 R /XYZ 90 473.835 null]
+>> endobj
+2681 0 obj <<
+/D [2675 0 R /XYZ 90 361.744 null]
+>> endobj
+2434 0 obj <<
+/D [2675 0 R /XYZ 90 339.367 null]
+>> endobj
+2682 0 obj <<
+/D [2675 0 R /XYZ 90 339.367 null]
+>> endobj
+2683 0 obj <<
+/D [2675 0 R /XYZ 90 278.644 null]
+>> endobj
+2435 0 obj <<
+/D [2675 0 R /XYZ 90 232.019 null]
+>> endobj
+2685 0 obj <<
+/D [2675 0 R /XYZ 90 227.535 null]
+>> endobj
+2686 0 obj <<
+/D [2675 0 R /XYZ 90 154.672 null]
+>> endobj
+2494 0 obj <<
+/D [2675 0 R /XYZ 90 81.969 null]
+>> endobj
+2688 0 obj <<
+/D [2675 0 R /XYZ 90 77.486 null]
+>> endobj
+2674 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F11 395 0 R /F84 438 0 R /F91 520 0 R /F104 2573 0 R /F103 2574 0 R /F107 2678 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2699 0 obj <<
+/Length 2592      
+/Filter /FlateDecode
+>>
+stream
+x��[[���~�_��J�w<�K[�S�����}J�W�v�JԆ�lo}�̐G"%�硁�K��>g�9���c����o����7w7��W81�H*��Ebp��AB�_��	�H��-�O��b��?oV/OټH�Wˇ"-^�
+O��)œ�)ѓM>��O�[�ۭ���-2�^��2�
<����7o�n~�!`N��A �����_p2����vft��}h�p��u��x��
8����)B!
�E�_y�[~�(���f�����9|j%))�L��9+)2��v�ZF)AJ��<𔐉r�vI�q�K��
+���No��e*�M,���ES" ��a����S�THj
�:�0���-��u�bm�E���
(~�V�/�2~�[�V�P�
+D�g>,�,-��~}�e��.aY������RC&<��F�xf]�Ϻ'��$���1��Z֯���x) '
�PD��}�v�"ߖNЦ
q�`)|W�3��@&��cR}h��K<���b��^��u�B@�1Y=��N�SQvWxY�fQ@)��6?T��X�y�V�9��N��i�mSː��� �a�9��-�zŐ�[0

���:˞w��m(��yV�qO��!E�٦�Z�>4���Z&"�$�$����H�R	��c����Dw�@	aQ�(�d�4�=X<�>U{o�\%�	[��ֻ|���s�Z���ZL��<��Y�����K88�#X�u��*�#�jPc3@�1=�c
��#���=����p�=~Q�g�2��T�Akٶ���)�VWg(�ȼe�%�ɶ��e>۬�aGXe���ʅ`L��X��H��%_��ȼ���V�0$~
�k $�� D(uB��$س`�끐$��
�d���i�~]�����+C�l'�F
�!"��R��'�Z���~@�
+��w�l�34���\��]?/�l�ϧ�&�,d"�@
�7,ܡ:�mWN�~��m���?
�>��\�8~(��
ݘ�jAr΍	�yi��Z>Ҭ���C

͂c�TM��|�H �gu��s�
 {h��7eh��?��_ڲ�DU�p
�
+�����p�3���|>�zB`ZA`RC`�
�M�ݮ�b��囝W���w/��J�FҰ
{��&5�=�h>��2�f'��F�گ�h�^엧���ߚ�[� ȣ��Y��vO%
+�e]d�}y$�l�K�ڗoV
��l>�cd�x
�-���r��:�٩�\ ���>�_ 03����H��#����aP��*��m瀴 3a{��<
��,��I���EJ��p����Vn����
\����nS
P�k	
��v���l��?۲��#��?]�����!�,,+Ҧ-^�F��KU�NOD�R��J1�i�Fj|q�����,i�����Ns8��nS�ꦜ�\��Ji�݉��ȡ�[�/%���o�RR�/�PJ�^�t�%�Դ�.�y�o���[�h?�S�(Ғ�,��}1I@�X�)&8�3feZ�������t�-G������D,�+�
+���U��D��stT�K	D�
s���9Zb�y��`��E�97��#ŢϾ�L�b�ЬX�9wCb�97����ⷞsG
P5�>�и9w��ɜ{t.:�3�eɣ.�+d�f�ʓ
+aUb�w��Y�
v)!ʝ�S�i5�����m�C �0��ݔ�cv��ػ~c��I̫6�,a ��v¶
�1��<�^��X��c�$����}��AZ��ENs=�x�������c
�z�dr��,�U�(��|��Ϟ�a��!Q)-1VL�8aRx�Ig�p�����Ν(LD&E�Qo�h>���T�2��I�ȿ
Ť4V�e&�Ξ�UL�2_�1)p� #J���U
�f��n	���L��w�Bc`ZFq�Jػ�I�P��
���
+��k���U}xz�G�E��$�]:�$
+�|�
�2�Nh&��(��bk�y��<�qS���V�B�����*�^�gQ at EŢ�j[Y��e�ע������E���V�7:!�PŋsZ*n�
��a+�������P`�E�ĜKG��*�
�(�J�P��C�S(W�:O
�O�x80�B�T�B�����ǜ{G��K��&jbͽ ���fO��G�\iI{�6-�M�t5�~�4ڍ�̃H|^��Z�-���v�T�Z�"(?�R/�JK�k�i� �j�Hw��
X�9ut����DB�8�D-la`)�V
DݏC�ҔV�iJt
+���q(eFp(��]Iآo
�6GK
ơE�2:�B�@�����o ӭX
U
3I��Ĩ$
+��4��I���H���#Q�p�NH�ѹ�^V�~75�J
-��B1
ae.1(��BC���"Pt���a�	k�`��t�'T��O�9����Oӷ��3�?�M)�V�Ox'*}RU����(R������,X��BI_�ܞ�������>�S�Y��i��O���wY���=��ֿ�Y���#����_[*“p�adAy.2m'�hz�@֏YV6}������
Pl�R�i�{������m�?�Y���`H{xX)��h���zS�n�S�
�jH^79L���
+ ��W�&ʍ?�_�ڽY=X�x�n͒�m /�?��$��
+endstream
+endobj
+2698 0 obj <<
+/Type /Page
+/Contents 2699 0 R
+/Resources 2697 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2493 0 R
+/Annots [ 2693 0 R 2702 0 R 2694 0 R 2706 0 R 2695 0 R 2710 0 R 2696 0 R ]
+>> endobj
+2693 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 632.116 201.372 644.514]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2702 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 618.611 201.372 630.606]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2694 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 407.571 201.372 419.97]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2706 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 394.067 201.372 406.062]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2695 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 153.447 201.372 165.846]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2710 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 139.943 201.372 151.938]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2696 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2700 0 obj <<
+/D [2698 0 R /XYZ 89 770.89 null]
+>> endobj
+2701 0 obj <<
+/D [2698 0 R /XYZ 90 655.872 null]
+>> endobj
+2495 0 obj <<
+/D [2698 0 R /XYZ 90 609.246 null]
+>> endobj
+2703 0 obj <<
+/D [2698 0 R /XYZ 90 604.763 null]
+>> endobj
+2704 0 obj <<
+/D [2698 0 R /XYZ 90 522.077 null]
+>> endobj
+2705 0 obj <<
+/D [2698 0 R /XYZ 90 431.327 null]
+>> endobj
+2496 0 obj <<
+/D [2698 0 R /XYZ 211.842 355.122 null]
+>> endobj
+2707 0 obj <<
+/D [2698 0 R /XYZ 90 350.485 null]
+>> endobj
+2708 0 obj <<
+/D [2698 0 R /XYZ 90 267.953 null]
+>> endobj
+2709 0 obj <<
+/D [2698 0 R /XYZ 90 177.203 null]
+>> endobj
+2497 0 obj <<
+/D [2698 0 R /XYZ 211.842 82.124 null]
+>> endobj
+2711 0 obj <<
+/D [2698 0 R /XYZ 90 77.486 null]
+>> endobj
+2697 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R /F11 395 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2718 0 obj <<
+/Length 2940      
+/Filter /FlateDecode
+>>
+stream
+x��\k�۸�>���j1�7��(�l��d�m�L����Ɩg��Ҭ,g���^�zіdYfvQ
D=////�#*f3l��`s
+�W�7/�Ux�@R9���<S<@B�_�ُs�?߾�1�	$�T\��o?ܾ�����w��������Rz�����3����[h�z�\<��q�ฝ}���
v
+
��� B!�e��`�"�X��<	��S�XR���i������f���>JD(-0���(�Am�e�R0�8�=��!�/��:�j]$���%G�9�o��,�K=���b��/��
Z1O�
?ǻ�?��q?a���G\ #.x5���$
+��ן� 	����4���P���
���"ӬyG����V��qD��-�+�%��h��tGI��7�
�F���So�@!&�L
���v��^��"��IW��z���
�UqE��Ciĥۍu�
�_E7�	��˩Y
�f9�
�s��mj
eQ��Jϑ�;�T���
aZ?�
H
�J���z��@
��]8GJ�%Q�i�9��Y͕��>@(f�
�yJ�q����o�3�8�b�4�	�ʏ�!K�����q��x�
J?;�T"Nj"�2�<L��@@�~����i�
l

��x��D�<R 'in���S��^3͞6��
j�G&؜���bߧ�d
�}�d���}j��'�Odo�IG����u��
5_��J,��c�z��V� ��!ř���l�D�;�ק�p{(o�'���InO�a2uuBHXJ�����,
+W����eaV�JwO�<Z#���RD�%��J����Ur���r�
wQ
ef!ۻ����,��ko�{�I����>��H��[:@�.b��IJ�C�xV��E�A����C�@
+Ĩ�Vk�k%�
F$����␋H��\[n+�o��ÞW�D�~���
����
'ZW���_�*����)�i��a	"��~V��JSπ���1-��Ԥ�
+rY
�<�.���,�&iے���aW.�ş��ۙ�=�G�{�?� I���$߈�LM̨_*A2/I�Pi=�JWZ�M��%5��Q����+�iz?z�^i�<��;�%�R~�D`N2�����5�aC��lqׯ�N�-�|��ś�����q}��tq����}z�`�)��~*$�����-9%@����,5�]	�	eRi��]�%�56tF8dž>FE�&�-��$N �V�(Z����?�ۭ�a�:9!�{HlR'+��f�#�6\��j��Y�Z}_�n��l�
вz���d�Fh?�Ѩ)0q
��
+�D�`2b�F� ��1�	 !�̴^^EO�/g��#v{�hI1hQ���?fx����r>8�cD�Z
��NL�U�Y4�8f^�
J��ᆚ�(Lu�)�
�7ɂ��m���s�`j� 	r��-��=��G=�GU��q��#��O��w��C�BM�c�
:
}a�\w�>f���I����!N���a�
bG�SukU��u
�d���81u
��۳��A2$� k�2�b��z��h<X�`�oy�5���h�
p�>I���	�U	٥
�|�0
���
+'M��
+��
+�.��yS��@
ؕn2
++=n=+j�E����.AXɖ2r�t�. at Z릸��"��hì'�HG�y�I��I!9�m�4}�@3b�>���hSV�I�
 ��*��VS[�G�@���=���T1��B/9���˵z*��Tj����4oU����J�q�H��WR�$�ЋU�.PT)�^���ɦKQ7C>�a�(�J�$���X�Rϊ�p?(lSO��*a����c��J��V�iv�t�U�1k��J�J��Uq��jfπ�
+]��7�S��0�d2�=U��S
������
��
\��S��S�v{�gW|��e��z�P#�ԎF�l*�	s9�������R� �j��h��Rᒫ��}Y��'&��S!�0Nk1U	�XP����,�2!`"�,8xG,��bXyUS� 
����+��,�9�L�Smvs��
+CA�w9u�����&�HU߈��
2�<�`
+	p�)k^�I��+
�iː�zj_�
Ǥɽ�w�T^�yI�A�I&?Ҳ��(A�JK��Զ�A�:6M�H���W.�ųL�Q��W
f�+�dk��1��^iK�����]M=bܐ�Z�a
+3'���I ����xG,�I5t˯�JU������p�VPe�UIZ)��+-A�	V
+����̱T�f�c.�[
sj��9�r�y�u߫�*��Ծ�<JO�<��5���L�#^&�R�L�ѷ�Ja��1�*�|L��[zj
ѫ�J)*��*=գ�*=��C��T�
�'z���V����,��:
�SO%Z��AA��1���T�T�
#��nI��"(����r]�b�+�6�Р��$U�$U�Z����n��J�j4L+���T�+�jWR=6$�6�=�7��t���4��müݕ��J��Z�,
�8BG�_�m
U��JV at Q.Fɲ��" xh�Qp�i~�,�����͎
3rJ�́c�s�!��>!����|�ga�+h�&$�:U-�H1��E
+�������<X^L��8y����s%Go 3�!H�$
�P�/[H��t����[N�!F���
x��&B\"��ڒp�` ��h�W^Wf��E��@��B7�^3h@�,�����;U��gZ���ń����:8E���
M��5��Lz��N-e��^g������>�(�?�h�>�T�
;~c1Q�J��΋��;兗ovl����%�-����|A���
+����g���������ФG��c��
��C�P>�&ɣl� ����K��G������_��n�Y��O�F��$�)��Y?�b� �c�S�v��uo��E��q�"�c�?�������>J
��tIn^V
+�f�m*�b�fu�.�]�������
+endstream
+endobj
+2717 0 obj <<
+/Type /Page
+/Contents 2718 0 R
+/Resources 2716 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2493 0 R
+/Annots [ 2712 0 R 2722 0 R 2713 0 R 2726 0 R 2714 0 R 2729 0 R 2715 0 R ]
+>> endobj
+2712 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 507.234 201.372 519.632]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2722 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 493.729 201.372 505.724]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2713 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 228.801 201.372 241.199]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2726 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 215.297 201.372 227.292]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2714 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 87.205 201.372 99.604]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2729 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 73.701 201.372 85.696]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2715 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2719 0 obj <<
+/D [2717 0 R /XYZ 89 770.89 null]
+>> endobj
+2720 0 obj <<
+/D [2717 0 R /XYZ 90 646.048 null]
+>> endobj
+2721 0 obj <<
+/D [2717 0 R /XYZ 90 530.99 null]
+>> endobj
+2498 0 obj <<
+/D [2717 0 R /XYZ 192.853 454.785 null]
+>> endobj
+2723 0 obj <<
+/D [2717 0 R /XYZ 90 448.768 null]
+>> endobj
+2724 0 obj <<
+/D [2717 0 R /XYZ 90 367.616 null]
+>> endobj
+2725 0 obj <<
+/D [2717 0 R /XYZ 90 252.557 null]
+>> endobj
+2499 0 obj <<
+/D [2717 0 R /XYZ 192.853 176.352 null]
+>> endobj
+2727 0 obj <<
+/D [2717 0 R /XYZ 90 170.335 null]
+>> endobj
+2728 0 obj <<
+/D [2717 0 R /XYZ 90 110.961 null]
+>> endobj
+2716 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F11 395 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2738 0 obj <<
+/Length 1974      
+/Filter /FlateDecode
+>>
+stream
+x��[o�6���+�6��/��um���4{�@�ۛ-���4�~��%�,_j�-�ɲ,�sxn�DG�Goz�]��^+
d$���Mdp��AB·q�O0l0$��m�-����q����j>����q�p�P�/�_��!��r
�V��Er��ߒt��Hn`��ϗo{�.{_zl�)lH�h��}���1�~aČ�
�C��S���c�C����
+{i?��i֚
!����E��_�����r��K�@�VM��M�^]$s�u�<m�#�i5�9o}�d
ŝ]
�m3C���>;�(čyS�`
�[��E��Έ@X�ڋ
u�q �MF�
�D@����C�>N4����S��!�}�|
+�Iu�o,pG�@Z�*��$��eV<	9Ӕ/!�D��#
��~ 7�*w�^˦�!'vF<���u��wYZ�S>M������r>�����u�?$I�Q�p���6'M$hԕ��t�*��
�qL���t�R1��iP����U�<?�5�r�A�	c�5��`��W_G�m� OҦOT(���}I
+�$�e[cr�Sw4�'�����1�d���-rqD���T��-�kHt�	G�RF�D7M���lRJ���1o��P��U$���E������x>_��
��O�I�_
m�"��BB![neʆ8Ȓ���A��1m{�1��T�
r��k
+˚��i�
P�(kxv�QP�"&�a��P��
$�U�F\֕ge�g�d8KG��-���yR�f`G���
+�L�U{�̝�"�q
��)��ZcjPy��	*OA�*ʦ�v�QÎ�o��I�$��������xT���F�0���
��X�
+#[X�pSEB>��
iw�
+���l�
�T�Ҳϊ}�p
<[0�~v�2j9͇���(,��-����J��C���t�"�B�Ѐ�Ґ�ZH�����"��������è�s�ɩek�J���J��rp\6�Hd&���Q2wb
W�Z�B|lq/����<����&��X��ң���"�g�䠐F9B���!��~O�L��[(7oTX�8o�_c3�
�UY�E�a�B�c��=��s��^����&�P�;����Ӻ
,���#��3�M
��v���F��� �  2ݐ� ��

1d'9�L ��H � w[��{@@U ���a �� �.��~��ǽ�|	k�r���ek�0����XuV"S2h%%s'0ɞ6�k&�G2��ʰ
���{2A�%x��d�U��Fyq�c�DB=J�H�(�V�F�E$
P���DC��z�DR���~���'��Z�]|r�%�I�S�	��)Mخ^��
+�&�	�'
�A��iO�7�tP�'-
�'�;���'�jc�Y�,,�
#r'�PXs�i
!�H:�R�	'�}{�I �%�x��d��HZDⶎ���	�I�ȳl<[����y�bMf&�b`	L������b�!Y%4	Q���y�P��Z%�7��HP&Ow�����,h�<�L�AD$x��%
�A9�h��O��
�A�<ty�8����,�g�@�isŁD��
79J�N
+"0?ۍ}
+�
dW٭�	Ұ�Z���� ��Q�q��sp���+�XK��
4�Wӗ�q���!t�:
��n>A�&@C�#0.���
����j�B��3 �@���]�^�iy
弫?�{�?�=��F��G�w��o4����~������>J=���3"��N��`����_وؘ�h��:
X7�(�L��Q�Uq�?k�S)R��{n�Z"$2���?\$��V����߿+.�Ɩ_��Qf�8��œ���4O���D
���Z%�O!�e��w񼸶^��E�d�7�}o�D[������IR�M1���ꏞ���
(��8��:���_��&�$� X
���i����i���֗ŲʶY
+7����O��@듒V�|��a�uO4�ݏ�������E�/!.Z���RD�
+endstream
+endobj
+2737 0 obj <<
+/Type /Page
+/Contents 2738 0 R
+/Resources 2736 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2757 0 R
+/Annots [ 2730 0 R 2742 0 R 2731 0 R 2745 0 R 2732 0 R 2748 0 R 2733 0 R 2751 0 R 2734 0 R 2754 0 R 2735 0 R ]
+>> endobj
+2730 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 644.071 201.372 656.469]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2742 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 630.567 201.372 642.562]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2731 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 520.1 201.372 532.498]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2745 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 506.595 201.372 518.59]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2732 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 408.084 201.372 420.482]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2748 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 394.579 201.372 406.574]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2733 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 296.067 201.372 308.466]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2751 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 282.563 201.372 294.558]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2734 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 184.051 201.372 196.45]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2754 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 170.547 201.372 182.542]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2735 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2739 0 obj <<
+/D [2737 0 R /XYZ 89 770.89 null]
+>> endobj
+2500 0 obj <<
+/D [2737 0 R /XYZ 90 721.073 null]
+>> endobj
+2740 0 obj <<
+/D [2737 0 R /XYZ 90 721.073 null]
+>> endobj
+2741 0 obj <<
+/D [2737 0 R /XYZ 90 667.827 null]
+>> endobj
+2501 0 obj <<
+/D [2737 0 R /XYZ 90 621.202 null]
+>> endobj
+2743 0 obj <<
+/D [2737 0 R /XYZ 90 616.718 null]
+>> endobj
+2744 0 obj <<
+/D [2737 0 R /XYZ 90 543.856 null]
+>> endobj
+2502 0 obj <<
+/D [2737 0 R /XYZ 90 497.23 null]
+>> endobj
+2746 0 obj <<
+/D [2737 0 R /XYZ 90 492.747 null]
+>> endobj
+2747 0 obj <<
+/D [2737 0 R /XYZ 90 431.839 null]
+>> endobj
+2503 0 obj <<
+/D [2737 0 R /XYZ 90 385.214 null]
+>> endobj
+2749 0 obj <<
+/D [2737 0 R /XYZ 90 380.731 null]
+>> endobj
+2750 0 obj <<
+/D [2737 0 R /XYZ 90 319.823 null]
+>> endobj
+2504 0 obj <<
+/D [2737 0 R /XYZ 90 273.198 null]
+>> endobj
+2752 0 obj <<
+/D [2737 0 R /XYZ 90 268.715 null]
+>> endobj
+2753 0 obj <<
+/D [2737 0 R /XYZ 90 207.807 null]
+>> endobj
+2505 0 obj <<
+/D [2737 0 R /XYZ 90 145.343 null]
+>> endobj
+2755 0 obj <<
+/D [2737 0 R /XYZ 90 140.86 null]
+>> endobj
+2506 0 obj <<
+/D [2737 0 R /XYZ 431.18 83.504 null]
+>> endobj
+2756 0 obj <<
+/D [2737 0 R /XYZ 90 77.486 null]
+>> endobj
+2736 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2764 0 obj <<
+/Length 2309      
+/Filter /FlateDecode
+>>
+stream
+x��ZK���ϯ�-RU���ᛳY�v�8k��丶8GÊD�5�ɯO %�����D� �F?��E��H�	���a{
׿=���pb��T&�ω���		�f�/#-ǿ>~L�Ԉ	���w������v�����ow�pB�z��N�˻_~��

�}���7i�p��H
�~�ÁbN!�z
+��;�C1���H��5O(գ��ʋ��_��2�׏�8WN&�昖m�z�kF�F��@�U�2z{�f���B��8�K��w_�OUZ�'z�6�b�>�
u41*
���y��
�bfb(DŽD��@��f��G�,�xb�w�)�:��w��*� X�V^�OY���5x��˺=z���E����w3eQ��}�,2{}���~��VU��`Y���V>[� <h��T"�L�K����)C��s�
 +n�	QH���������Ṭ��,{S<����7Xm�U����+���qh�m�ȁxy
S>*������'��M�e��DչnNY�݅=�~n���j4NA���
��I��G�W�;�㝲�n��+��y��M�S��Ո��N��0�"���N(�	��������蜖�1�`�6��8
4
"�`���=M���/�bm(�^h��5�m]g�C;��9�wa�T�K�
+ұ���/����������U
��fQ[����G�� 8'6��7f�d�7��eVg�u�u(�
� �Q?h��]�U��%]�NQ��Jtb��Po�H�����ɻN �߆��ㄇ-E�ĭJNF��(���+���X��}�MUyj榳Y6k�ŋ*���rx؆�HDn��a����K}�j���_4�b(���q�����>�V����s��/yTG�6�/�G6`m����,�J�J��D��p(���Qe�sp`va5o$�4�/(�
 C�-��1ǣ�t��>[���7K���'rx9m!����{���9R(���3��Ѿ���S
[h?u� �
����
 ��l���P詔b��Ii1��"
+ɑ�U�!@a��f��ʼԺ�Z��&y1-�+ �O�f�bv{��p�k85�[=8���v��J�
^P����#�x
+5�o�y��s
E��
�Q��+V�(�&��LBc����Gb4�k)M�
D��d�4;Ji W�
�~�[4 at i�
+�my�t>�i �c��'5J��kIM�k�,��о�a�s١5C�QN.A]��
&\� ^�
t��E.3�T���z��맴���-0
ĈsFp�
H�p,ƒ!����8�}�¡�"
�@���v�b!N	D>��X(�yZ(��:$����0� ��a�7!���!	k�8
��
����9]0مi�R ���

07�M�uݞ��T
<KzȪ*WY��y=	~ɧ/M�k2w���z� ��v�Ζ�&Oe�K���Y>��x&t��
'pF#H�u�̓ȍ)`Ț�����Y�Z��-��L�c���GBn�k�[�^�:�X�.�n���f@p���k`O�C�N1g#8|�
8�]Ts�p��8x��b� |ax���A����}���Ϩ�Қ}Į��Q��=&����P������p���j�5hVwMpe��H�m��S��̂�-��}�%:� �Q�Y
9Z���[���iWߨ�`�:P��7v�k:�5����
'x����&=� #���WK��{M���{m�
�:n���B�BiJE$l
�Qb�6c�h����,t
g
���l�)�+���wl9�@a��N�
+��ꎣ�
9خvi���d�ƝIl�>��qg�v⓱�c��'�
6��[fc�� |��0r�ـ�V,$�[�
�����
fc�lo���m��0��Գ�ą��kf���

�ߔ>�l
xE��;Dm&�k9$<Ȥ�)�vQ|��)��R
���>t
�:��;onG�)�w(�|0��
)}�m�vߐ
�[ݾ5�o�j�����7��7�9mG��As����n�[k3�ߝ0
>6���X۰�
2_�F�61!ct�
Y�a���Ã8����)���Q�A"���n��o:�&�;gQ��>|�Ԗ3�o���\ipX
+�ٙ��w{�
+	�L�芉R�
v��`��yp�aɒ�� l'n�&;�����Ӱ
 ��~���	
�ӧ�����~��jQe�i�>-�t�L� I�z�<m��?���/c!F���+-6iC�m���5W��w��w�7q&
d=dY�s���w����s){��
+ ��5葉W���?m�?���~��-V
+�
�~߼,[���p�v�� ���67%
+endstream
+endobj
+2763 0 obj <<
+/Type /Page
+/Contents 2764 0 R
+/Resources 2762 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2757 0 R
+/Annots [ 2758 0 R 2769 0 R 2759 0 R 2772 0 R 2760 0 R 2776 0 R 2761 0 R ]
+>> endobj
+2758 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 530.674 201.372 543.073]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2769 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 517.17 201.372 529.165]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2759 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 418.658 201.372 431.057]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2772 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 405.154 201.372 417.149]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2760 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 255.085 201.372 267.484]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2776 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 241.581 201.372 253.576]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2761 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2765 0 obj <<
+/D [2763 0 R /XYZ 89 770.89 null]
+>> endobj
+2507 0 obj <<
+/D [2763 0 R /XYZ 218.507 671.378 null]
+>> endobj
+2766 0 obj <<
+/D [2763 0 R /XYZ 90 664.738 null]
+>> endobj
+2767 0 obj <<
+/D [2763 0 R /XYZ 90 608.119 null]
+>> endobj
+2768 0 obj <<
+/D [2763 0 R /XYZ 90 554.43 null]
+>> endobj
+2508 0 obj <<
+/D [2763 0 R /XYZ 90 507.805 null]
+>> endobj
+2770 0 obj <<
+/D [2763 0 R /XYZ 90 503.322 null]
+>> endobj
+2771 0 obj <<
+/D [2763 0 R /XYZ 90 442.414 null]
+>> endobj
+2577 0 obj <<
+/D [2763 0 R /XYZ 90 395.789 null]
+>> endobj
+2773 0 obj <<
+/D [2763 0 R /XYZ 90 391.306 null]
+>> endobj
+2774 0 obj <<
+/D [2763 0 R /XYZ 90 332.53 null]
+>> endobj
+2775 0 obj <<
+/D [2763 0 R /XYZ 90 278.841 null]
+>> endobj
+2578 0 obj <<
+/D [2763 0 R /XYZ 90 232.216 null]
+>> endobj
+2777 0 obj <<
+/D [2763 0 R /XYZ 90 227.733 null]
+>> endobj
+2778 0 obj <<
+/D [2763 0 R /XYZ 90 145.047 null]
+>> endobj
+2762 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2787 0 obj <<
+/Length 2084      
+/Filter /FlateDecode
+>>
+stream
+x��[�r�F��+��*l��1�$���'�rb��N�`
+�X#�
A����4 �h�೥�� v�{q��M&	M�3��f��߆&�8�urs�8����v�|L%J
G�R�.��,�]��=�w���q�y�-�

M��!�i�ː�t^
G\���Ǭ,�������-/�9 ��k��߼�t3�c��MX��"�&�����4���w	%���K�h�H.���|�:���l>	W��4iE�"�#���0A,U����u�/V�yQV
+�@%x;�SM7��llw���Ҙ�9�hˉd-M.�c
T�O�E��Z��y&	��k�e�����᷵�d�Y�W�D;�s���CI���qzw��r(L:y����v䝗H\�uɈ1���7to�9��
�>�Žw
$�$L���̡�	ʩ#��5n
��!W��s���{�Hl��'9QʫRmY=L�zQ��j�(+�� 1M
N4kƓ�8�(s�e^+v7���鐡<���x>[d�����;�;O���
@�p�2_o͇L�_��l��Ts�5q�nv�[0#��ֆ!�X��XU�ϋ��\�������>�6��ȧ^��KV�����q>�6�*��Y7� z���c��Ͼ�T���H���9|�h]�y��{tluҵ��8�4�����m�<�2�O��oU��:�Z"��B��Mˉ�n��r
Q$�5D�
2�ֽs�x�u>�#�W��<_7��ȦU,�a
$�V%�_�e�	5��wP���	�G�
�����#Tc�SQ��B�R�{%�oZ����Dm
+K�f`
E 65���j)⭽�"7�e\/	c�P�)��Ȃ��)W#�"Љ�ap@��e^v��b�(|[}�
+i]ZM�jI yG�@82Bo��j^��C�)��>�d|tn:���v�w�6b��$L�@":qS�
+�Ŭ�/�Y7e(��H�Z�Q���
+	'_��E4�u,ts
�P7�O݄>��Q֦n�+��D+w� ؐǩ
�됸���~�O1 rx<j�^�y��(�.D���k���0�cP�@��K
�
u	�Ǣ.�[S�@���%�Ԇ�R�����(E�p-�޴�����R��
@�9��H����%еC^
1|G�@:t�R�K_�)��"�b��3/�^��	p1��
`V�E����x쥅��Hn�g/�*��@k�ұ�e�%0�k�����V�Q��=ӟd at d��O�k0����a�����/B��
��!���(��k���u
�/�P���W�(;��(��iCAO`�⡂=�ZE*�5
�lG����>V������r��[��g��̈[Ƅ�x\�#4�h�N&4��b�
��g��Cޝɚm�of
F,Z
��;3
�ٞ򷪼��� [f�|�����	$�����~��!���E4:b�}��D
���
a���pc�ʫ\m�J���X]�F�ZW� P��B��Ǣ��̛v���β���;���ݰ��O{A�����x�
�c��0�Q|1�y�Ӆ��2��t���t���/�Y�6Ǽd��8״��5�!*�{�&���sM�B��5�9^r���@�no���yw����I���Q�*̣s��s)l����1(�9FP�?�xt[�*{�#d��w
��1
�O
�
+D�t�G�c�B�PP`��>o�
+��1�(�H5�(iC�ۛe
+=s
f
�b��:��#{`�A�eJ��29y�a
+
sൃ���
2�$��o�H.�>�
CWP�/�d�U�q�FG����%��4�Hb��&�'�M�
�d�Tc�$�V��	��5�����aqx��܆�1Hcd�(��I�W,�t�I��ґ"�;v/�Y�65Dpq�i!F�dZ�E[}�I&��֓L�B�M2�9��I��ы���Ů��* ��o�\��H�oڢ0rq��K�cǿ�-����!��u�4ny�����]������R�
Ί�S6i�-���=Y�֯H�M.�1T*m�/Y�=�Ǟ"?�y!_z��'a�en=w%`�����MR����d}��A{�+�D�m��j���7��&e^LBj�o7C�6��/h����89˶oh#7QH1Հz7����(3�[��k
W?�76'޼���_s��׎��he~
+endstream
+endobj
+2786 0 obj <<
+/Type /Page
+/Contents 2787 0 R
+/Resources 2785 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2757 0 R
+/Annots [ 2779 0 R 2790 0 R 2780 0 R 2793 0 R 2781 0 R 2796 0 R 2782 0 R 2800 0 R 2783 0 R 2804 0 R 2784 0 R ]
+>> endobj
+2779 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 694.926 201.372 707.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2790 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 681.422 201.372 693.417]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2780 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 582.91 201.372 595.308]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2793 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 569.406 201.372 581.401]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2781 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 470.894 201.372 483.292]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2796 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 457.389 201.372 469.384]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2782 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 295.366 201.372 307.764]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2800 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 281.861 201.372 293.856]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2783 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 119.837 201.372 132.236]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2804 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 106.333 201.372 118.328]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2784 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2788 0 obj <<
+/D [2786 0 R /XYZ 89 770.89 null]
+>> endobj
+2789 0 obj <<
+/D [2786 0 R /XYZ 90 718.682 null]
+>> endobj
+2579 0 obj <<
+/D [2786 0 R /XYZ 90 672.057 null]
+>> endobj
+2791 0 obj <<
+/D [2786 0 R /XYZ 90 667.574 null]
+>> endobj
+2792 0 obj <<
+/D [2786 0 R /XYZ 90 606.666 null]
+>> endobj
+2580 0 obj <<
+/D [2786 0 R /XYZ 90 560.041 null]
+>> endobj
+2794 0 obj <<
+/D [2786 0 R /XYZ 90 555.557 null]
+>> endobj
+2795 0 obj <<
+/D [2786 0 R /XYZ 90 494.65 null]
+>> endobj
+2581 0 obj <<
+/D [2786 0 R /XYZ 90 448.025 null]
+>> endobj
+2797 0 obj <<
+/D [2786 0 R /XYZ 90 443.541 null]
+>> endobj
+2798 0 obj <<
+/D [2786 0 R /XYZ 90 372.81 null]
+>> endobj
+2799 0 obj <<
+/D [2786 0 R /XYZ 90 319.121 null]
+>> endobj
+2582 0 obj <<
+/D [2786 0 R /XYZ 90 272.496 null]
+>> endobj
+2801 0 obj <<
+/D [2786 0 R /XYZ 90 268.013 null]
+>> endobj
+2802 0 obj <<
+/D [2786 0 R /XYZ 90 197.282 null]
+>> endobj
+2803 0 obj <<
+/D [2786 0 R /XYZ 90 143.593 null]
+>> endobj
+2583 0 obj <<
+/D [2786 0 R /XYZ 90 81.969 null]
+>> endobj
+2805 0 obj <<
+/D [2786 0 R /XYZ 90 77.486 null]
+>> endobj
+2785 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2814 0 obj <<
+/Length 2270      
+/Filter /FlateDecode
+>>
+stream
+x���s۸���W���	��G߮m�I����ۗ��
-A2���$'�_��!��,ق��L^L�"v��� ��<����+����n���*�d$���,18Q� !��4�%�z�����I����������y���'��՛��߯|�R�H�d����7�L��{�ˌN����	�
�����?�p`�7H��A� Bj�#�E���c��&���1�:�Q������ʪevh!�q̽T��cvRd��,=��:���ň����N�!�#CY��Ch�}��VY5��a$E�>�M�,��ʋ���͵�l�8��)�011�dJ!�u`g�^��ӯX`g@/�@��6�>�(��4��im��[ȁ�64���C�H�N�.�A3�]o���[�/n�4ER��D��Տ��5/p�)��^;�լղ����C�p*!
��![
�i��
�4
Y1
�C$Ҫ�@�@f� ���Mkme��Ŧ��qIQ67�۬ʠ;v���_o��˼ȗ��A+B/~cbbR at H$‚�f��:�+�u(���
+��~��B 	.z�|��w%l@�K˄jl�4b���	uU�'����%�f{�}��E#���l�4߰�7��Vo��^�r�H�` �:Z���}�ȧ��FLA�,m��<�s
��AAC�0B��˔#q��#�YL���Ѿ��H5�!�pHb������f��C�S�z�*
�G����ʶ�f�r�0΋I�\��{�h�*��:�!�kR�L3���J0=� ���:��$�;�/�yt�����
�KIlj��� ���3Q'��u�g��v��9
�N
�:�	�����r[��>W�32�V`�M�����R@���Uu���C�[i��z5��;�z
+i��^
�gH���x��L�A�@#��x�'1*	|X�c���":�Š����A�;�c�àg������q�Oɗ�<�A
f�t����R�b`P`�C}�A��31h��f#���;�%R"eT
+!���<L�3�D�q>�(0��L�
�Imm0Qp$eg.d����?�~�h�ד-�:��� ��@R>n�N5�z�� �e�J4:+qXF^g��I�cՔD$�=�QI����k�RD������H)p�wRr���P
t �=.����'I�MWX�
)�KIɉ��� ���3I)�����g���r �`��4�mPސ�&��.��zH��53'Q�*�d/"�˞�
��W��J��WW�����7:�	
+��핹d��S�a���O�v���b�'�sץ�\�Ȏ��_���,kNI�b�
��E�@���'1*g1�Ӹ}��z��A-g�<�<�
+��
g=;TGG��Ȉ�:�/�y������Y��Y���e���KŎb�>ɜT��E�C&BOa��H�8�siO����Η�E>{>{ĸ�a�;{Ę
ܮ�
~���`2���c�a��IYl����͡r����
h��F���<��#�7��нRگ��f iz��4;�{��ӥXю���S�{��Kk7�U���}
`@�����3��鯧��0w�|tS�
����
_��]m0��N
�j:�	���)��8�����q'j�-��X��{��5t��
+;�>��_��B!
&�#���B�\m���<��e��_�
�4��Ni/ ��)�H�p�'1*�X���l�?-��
�<6���w4uh��H
s �iw
_"�$�G��f������-@�tt
 �Ɖ���3c0����;���h@A*�~&�f37�v�Иq�w�}�Иf
+
�!$P؜�MЎo�Ӎ��
�Q�gnx
�
�������
�?
r�6~�)8��!/lV}~�u�1��0
+j�8�J�u.um�(���(�~VRZ��I�}H8�~k
�ڢ\��e5@������-F
+(�)=v$Mʣ�)�{�B�~�iG���ۤ���R�`�
�3D^��|��co�
7O�u[L��9���ƒٶh�
>-�ժ�b�K�14�'��j� �a{��eO;xt�{��1�
7T�D�0��0�A�'��%���:�E�,�r8Ɩ�AΆ��TL>��z�C�����3��WR
+�+�	���r��eۦ�q�nɒ�� l'n
��;�-�HXU����^�|�ނ��4��@�Ǐ��g�&��S����m6o
|��3��٤��/X��a$D�,
+~ʊm���wE��e, ���J
rD�B�
I�dm��;��z��+�]7�
�%�n�Y����v;_�b� \kˮ����nH�Z�Y�U�ԁ�K��<��� �S�=
+endstream
+endobj
+2813 0 obj <<
+/Type /Page
+/Contents 2814 0 R
+/Resources 2812 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2757 0 R
+/Annots [ 2806 0 R 2817 0 R 2807 0 R 2820 0 R 2808 0 R 2823 0 R 2809 0 R 2826 0 R 2810 0 R 2829 0 R 2811 0 R ]
+>> endobj
+2806 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 644.071 201.372 656.469]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2817 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 630.567 201.372 642.562]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2807 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 532.055 201.372 544.453]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2820 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 518.55 201.372 530.545]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2808 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 420.039 201.372 432.437]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2823 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 406.534 201.372 418.529]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2809 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 308.023 201.372 320.421]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2826 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 294.518 201.372 306.513]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2810 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 172.096 201.372 184.495]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2829 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 158.592 201.372 170.587]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2811 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2815 0 obj <<
+/D [2813 0 R /XYZ 89 770.89 null]
+>> endobj
+2816 0 obj <<
+/D [2813 0 R /XYZ 90 667.827 null]
+>> endobj
+2584 0 obj <<
+/D [2813 0 R /XYZ 90 621.202 null]
+>> endobj
+2818 0 obj <<
+/D [2813 0 R /XYZ 90 616.718 null]
+>> endobj
+2819 0 obj <<
+/D [2813 0 R /XYZ 90 555.811 null]
+>> endobj
+2585 0 obj <<
+/D [2813 0 R /XYZ 90 509.186 null]
+>> endobj
+2821 0 obj <<
+/D [2813 0 R /XYZ 90 504.702 null]
+>> endobj
+2822 0 obj <<
+/D [2813 0 R /XYZ 90 443.795 null]
+>> endobj
+2586 0 obj <<
+/D [2813 0 R /XYZ 90 397.169 null]
+>> endobj
+2824 0 obj <<
+/D [2813 0 R /XYZ 90 392.686 null]
+>> endobj
+2825 0 obj <<
+/D [2813 0 R /XYZ 90 331.778 null]
+>> endobj
+2587 0 obj <<
+/D [2813 0 R /XYZ 90 285.153 null]
+>> endobj
+2827 0 obj <<
+/D [2813 0 R /XYZ 90 280.67 null]
+>> endobj
+2828 0 obj <<
+/D [2813 0 R /XYZ 90 195.852 null]
+>> endobj
+2588 0 obj <<
+/D [2813 0 R /XYZ 90 149.141 null]
+>> endobj
+2830 0 obj <<
+/D [2813 0 R /XYZ 90 144.658 null]
+>> endobj
+2812 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2837 0 obj <<
+/Length 2936      
+/Filter /FlateDecode
+>>
+stream
+x��\Y���~�_���U�h�#yr
%%E���u^,���rQ!A��d�קg  q�6��_� ����o��\
-#
����w���pd��TF�O����		��/��`��O��n
?l7����b?���]��<Ux��O)��W�DO6�tF�|���{�c�kI6O@$7�6�_��޽���펀N8"^�����_~��N��0bFG��M�S��觻�p>��'��
ڏ|���&�
˜G�0d��'��'�.^'�$��^�G���/�k3��q��L����d~Q��I#���T�� #DM��6/Y�p��Ya������7p����pr�
�
m"%2TU��N<:?N�  ���*?s���O���9?U�
?��?`L��L2%b��v���i�4G>l�t�%��\�� �Sn���pH���Q�9"�B

"�L��~��`�:Ao�2�Ы(s�^v\'���������`����i��)hHX���a�8 
VX�
J ���H��:��vA�8}��U�焬�bð��}�o��
���\$_r�C�&��s1�Ӕ�-�ա�[W�|�����j�� ���
,�_�"�B��į�'nAn�)
2�`dɮ��RB��&�e����_'BjR	|��D�XI�;O8�}��]=U�>�[�~lt�rؐ� i�_�7ٔ�6�W����ݔ�|�<���E��6�,Gru���۶�s�1
i 0��-���-t�(6R��9�w�> [...]
�*�ݬl9�)���E�
]�����=E1������`tR���:�
�Oyt�2vB?
����g���*���_)�n�۪�a8�qr
��z*X�Ͱ����i�۪� ���3�!��5_�.͒x��ںC���l�a

��'���m0؛��|�w��Y~��4�A8�.���}G���^�cVBg����R�*3J�yM�����
2X�æ),A�
��k�2��"A�@�DABt=�
y8X�����[�'8t at 2����� �/��fw
d����l��r+<;�����]B�N���6͖�K�<iP �o��� ��t�%_*�W
+"��)^�mS���&��>�,����
J(���H�1����j%�%.R %x-6���g6;c��aB��
��܀!d�**�D�8�氪<(�ɵ�Gz�#�h,�+z���?>���x�He�u;L,�EDH���%��a�L�PZ��2G*ӌ��2/Ke�N;,�t]d_X���a%
�X�2�d {�9R�fd�����2�[�
b �c
��%��29$-Lg29�+���2�Nfr��
iO&�$1(��-A�0�r��@�Y��0&�b�?�̞L�����L�`x�z*+QɰL�(�7�L��E�?1���dJRf2%��dbŜXi�X&C�V��&�i��4��#�k�w�27��Y4P��D?&2���Uk�*�Ȇ@P�Ցk
* ��A�����R�ITHi�QAH��c���2.`
+ƽB�φ��(�m��4��
8�c�̬�� 3c�r�l�����4�
+AB�BI�6J6�����2%���Y�C�
 a����'+

+�m2?x��e��
W�#�
U�0�@�Q�_Ň�T��{��׵�@��8�
�>�'��d��RC\�z2U�.$
�6lJ؜�^/X�H��[
�,
+b��-ࢼ�WRb�,j���ܸU���ABN�
+r����
(#�$��aP�
Z��<hy>3n��JG3�R������Fz�*@H ,u6�l�"�$A֢T�|�����%���s�
+��F5�)|�	�%!�������:M�R�TQ$��E�ԣ���q��?n�Խ�E|�r�؉N
>�v$H�
+���
+-�cKH�h :v��H%vM�<�<�!�G�ӌ��>�����5���
Ȯ���>�v��HAC��%z؁b*PW��
��)�"m8�D�8u�QWR�3�����i��D��"�.�D8���?���5�@�$���F��i�[Y
8�

0߬כ̕^p��I������n);?��I��>�>�/���U|���l���U���R��
�� -�f��%��G-�.
+�
)�4a߬/�y�>�$`;�$1h;�Hw�_�h��
U�аvT�
�v�ڱ�
u�"
�O��[�{*V��FA��6����0gN�!Ϝ_V�>��F蛦��vL!>�9-"	����z�t��F���[��*�\׫�L��lm���Co����������Y��
H��%�w�cd�ln��
��Zs�֛[>��-�ۛ[�aڊ�R�kn��jء��d����L���!�[J��6���w�����-�Hdma.~!�����
[��
��~�����_��E,
Mh����e�c�:�[!fV�F���oQ�[�[�K��HV�[V��;��[c��.��!<��>��r��gs{
�_�9�������{���
+8�.�-9��%��&2
I#�u��$��T�ޖv�����Hk��% �_esK��J�m)�~o7��u�3r��u��=E=S������x���?x����]�-�~{÷7�!�yv�H��'�?M�����qv,XB?Zϙ�Ή2�|��$�+q~J�|�~������9Wr�����)M>
�~����'�AUp��+�^8ʟ}*j����0�
N��S@LNy7�&��܀��A���R��Q>v���ެY�
��9��/�詽
+endstream
+endobj
+2836 0 obj <<
+/Type /Page
+/Contents 2837 0 R
+/Resources 2835 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2757 0 R
+/Annots [ 2831 0 R 2841 0 R 2832 0 R 2845 0 R 2833 0 R 2849 0 R 2834 0 R ]
+>> endobj
+2831 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 618.662 201.372 631.06]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2841 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 605.157 201.372 617.152]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2832 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 406.471 201.372 418.869]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2845 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 392.967 201.372 404.962]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2833 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 166.929 201.372 179.327]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2849 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 153.424 201.372 165.419]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2834 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2838 0 obj <<
+/D [2836 0 R /XYZ 89 770.89 null]
+>> endobj
+2839 0 obj <<
+/D [2836 0 R /XYZ 90 720.814 null]
+>> endobj
+2840 0 obj <<
+/D [2836 0 R /XYZ 90 642.418 null]
+>> endobj
+2589 0 obj <<
+/D [2836 0 R /XYZ 90 595.792 null]
+>> endobj
+2842 0 obj <<
+/D [2836 0 R /XYZ 90 591.309 null]
+>> endobj
+2843 0 obj <<
+/D [2836 0 R /XYZ 90 508.623 null]
+>> endobj
+2844 0 obj <<
+/D [2836 0 R /XYZ 90 430.227 null]
+>> endobj
+2590 0 obj <<
+/D [2836 0 R /XYZ 90 383.602 null]
+>> endobj
+2846 0 obj <<
+/D [2836 0 R /XYZ 90 379.118 null]
+>> endobj
+2847 0 obj <<
+/D [2836 0 R /XYZ 90 293.39 null]
+>> endobj
+2848 0 obj <<
+/D [2836 0 R /XYZ 90 190.685 null]
+>> endobj
+2591 0 obj <<
+/D [2836 0 R /XYZ 90 147.376 null]
+>> endobj
+2850 0 obj <<
+/D [2836 0 R /XYZ 90 142.892 null]
+>> endobj
+2835 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F7 1212 0 R /F24 309 0 R /F8 448 0 R /F13 1211 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2859 0 obj <<
+/Length 2861      
+/Filter /FlateDecode
+>>
+stream
+x��\Is����W���l��$���I�q&�X�řRA"D�B�
��G���z� �mg��
 �x����o�D�l���/W��z�g�3���2���
�7HH�4�>�

�t�.cR#b$��~�����p��~w�����+_���R:�[^}�	gSx�.�}v���
�����?�pP��"*쭽5��a�3E2�k�aL�(��e�)�1!�G�׎��v��_��vV�5��]�D=k�d~Q��G&�F"��>�0� #DG��6��M8G
+�0F�Po���
2�
^���aI�D���
��xB
=��  ���Ex��b�?ܾ��
�����1-Ó�X�������	"�`a�@�"N	��=�4GD�4آ
+i�@�B�i���ۛbL���q�L�^���i0V>-�*߬*�qu���be1���߮��鼜
�aY<>

���:

^T�K-��NpC:�������B�N��e���.��h�=��_rg�s  R��&�\j�
r\!����S ;9�8���j$C���Ӣ\-���cw�:������
#��j�\�pG�3���
��o<aH���y^N�M�O�ӎh��o��q��j=qI(�&k!5��:_�CާG38,��?�<�<��iq?&0�i��Ӆ�S8�.
u
�݄a�D��0�+��[B�MY����rW�7n����Gd�
�`�WW��L�^��B��8

��+ѾIt�	G�L/�*��ֆ��Y��c��\e�(-�ؼ-�
�@��Oo���L�cs����'���7���C�H1G��3 �h�B�AJ$U��v=�P�6��C�]W9�0�
��v�P��EΐP��~;��3	T�Z�C�^��w��=���0��6	Ig��
k�Y	^s�^���P�s^}i
�"���i=y�T��iV�y�?���0
B1i�)��ߝ�v��O�%D�5`M�V�;�V"�!�Nk\���5����ҩU���<��:M��33�2��vhl�r(�0����
�=+Q�x�/�H���b�ëL��	�dc�	�� ��6���G���Z��2��EQ
GQ'V��JSd�iT�U���ݥX��ja�M/Ŵ�
�
+�dr��_u&_�o+ �D�^�R�Ї1��H!�L�J4�#�j���Ww?�Ք)�x;�z0��j~Ҽ݉�F
+�e��9��x{�9��[������`�G<�V�����Ц������Iո�g[7�NH<z�#y˜@�w����t��ey
��3�-Y�SU,
_���U��E�~^yu��:yȈ}.�'^�Aq�C��{h�x�M�wU�-���t�G8��b=/[��D�O�e��)� <�P�]��`����Z3ڬ�"8���:��Zo^ �hn{��=�B
#�Q�W'V�
��ݦQ�_�Z���X���٢ƞl�u�t�v�}*+����rs�,/ .�m��:�W�c!GuH%,�b�u�l�E�Ð$�|��/G��L�>mG�1�h���r�@���M��p.���&8칄��(H'�'�0��m7��Hw��1�
�ZZX4gAGw>�	�
C�N������
�@ͥ�٦�Aڵ9Fʰn��t{�6uH^����
H��Qû/k�Hn)
�PzT w���d/�1�s�'6H
W������
W�R6�S
t5#�꘴�
�p.O�f.ԣ���ңi`.���r?����|:���t8gu�R��B����CEpLI��Z�GWi�1p����j�p�C�	�� /S���:����q`9[�᭵MD�R�%�D4��aieڊ���'.*��X��	�j>{��В�.�v# '�]�K�
Ȥ�]��L��2u�a��agd�b1����#j��wx�0 �:��Qm��Q�Ni�#��	���T�x	g%�r�q�1��� ?W�it�m��/@�0i 2�m~���3��= �P�
I�l%�lJ�q�� ��Z}m:%��j:�m��M�� ��2GL�#��
?�NQ*zW�V��S����I�"<n7�ˀT�5]��
M��ۂ,�a5��
�q@!��.&���Er�Qڢd?B��-�Yq��7���z��<	b?E$�ӡ�Q��#zi�4��.�**�1�tw5y8B�Û}r_S��@4��l�a�p���A�w]&�
) [...]
I..�y�1bRJ:��2F
nj'�#)Hf�KBɥ���m� ��J3��+h�ӧ���N��M~��躟3p��l9#���T
��3@q	���(b��FP�+ɾ�F_�7R
ވr9����@l� `��4
�zc�����cē6ud%6�Q��_��#K�ԑ}�M
�9PG�n9�:�ԑpy�$5L
Iĵt�?�:�|‚I@
Qɐ���iԑ�C
�o����:���~F�ĶAr��B�F�~|�#J"L�D
]�GoW���o�<:��X��l��SїZ�C���JJ
QlKa~yt�:� �չ�<:_�������%�D-ݟ��$����t��B]z��򛢎�_�0B@��<%�RK���DJ�(�p�DŽ'RG��ӏ�X��k��l�cR�?5N��/�4�P�h��l	ɣ͕�;���3��!DJ�h+1-iD��A�6i��@5iԶЙ�Q�
�H�o��7�諐Fg��A��I#�"õ�P8:�
�Ҵ�	_�
�b�u_����������%���a[q�7�
+�
c�"U
B
�'m�>��7�r[����?y���'�e�Oo�MQ�,��a�?��wc!FP�˧�w�6�{��^Qm�F��O�d��h�cQ�����Y�_�
֣�,��5k?l6�߿~}�4{,��ۥ߾


+o;��u%�\տ���p���n/��
uVc
+endstream
+endobj
+2858 0 obj <<
+/Type /Page
+/Contents 2859 0 R
+/Resources 2857 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2757 0 R
+/Annots [ 2851 0 R 2863 0 R 2852 0 R 2867 0 R 2853 0 R 2868 0 R 2854 0 R 2872 0 R 2855 0 R 2873 0 R 2856 0 R ]
+>> endobj
+2851 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 594.353 201.372 606.751]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2863 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 580.848 201.372 592.843]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2852 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 357.853 201.372 370.252]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2867 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 344.349 201.372 356.344]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2853 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [519.002 345.779 535.938 356.683]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2868 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 332.394 256.164 344.727]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2854 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 109.399 201.372 121.797]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2872 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 95.894 201.372 107.889]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2855 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [519.002 97.324 535.938 108.228]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2873 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 83.939 256.164 96.273]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2856 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2860 0 obj <<
+/D [2858 0 R /XYZ 89 770.89 null]
+>> endobj
+2861 0 obj <<
+/D [2858 0 R /XYZ 90 720.814 null]
+>> endobj
+2862 0 obj <<
+/D [2858 0 R /XYZ 90 618.109 null]
+>> endobj
+2592 0 obj <<
+/D [2858 0 R /XYZ 90 571.484 null]
+>> endobj
+2864 0 obj <<
+/D [2858 0 R /XYZ 90 567 null]
+>> endobj
+2865 0 obj <<
+/D [2858 0 R /XYZ 90 484.314 null]
+>> endobj
+2866 0 obj <<
+/D [2858 0 R /XYZ 90 381.609 null]
+>> endobj
+2593 0 obj <<
+/D [2858 0 R /XYZ 90 323.029 null]
+>> endobj
+2869 0 obj <<
+/D [2858 0 R /XYZ 90 318.546 null]
+>> endobj
+2870 0 obj <<
+/D [2858 0 R /XYZ 90 235.86 null]
+>> endobj
+2871 0 obj <<
+/D [2858 0 R /XYZ 90 133.154 null]
+>> endobj
+2594 0 obj <<
+/D [2858 0 R /XYZ 90 77.486 null]
+>> endobj
+2857 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F8 448 0 R /F13 1211 0 R /F11 395 0 R /F7 1212 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2882 0 obj <<
+/Length 2682      
+/Filter /FlateDecode
+>>
+stream
+x��[[s��}ׯ�[əh��K���Nǩ3��j_��!�S^������ł$H�\�/�L� |��w?Gk��3�����W?�9�4���}�hf�#J��(�<`�(1�d���c^���������tr[������0�tP�2dv��/���7�|�
��������)
^ql����o�/~�`Љf,蠈������o4���%���K��,�\�s�}�����C	W��ԛ���9�c��N��78�W�g�&�<�
,&#�M���j�)�K[I��ӗg�F�]�8��D
+��C���
�+N�N��RD�x����
�
��.|��h��L���b^��t���z���0�H�DUa
v
����J)�

;G��)��+Y��Qa�!n~��z5Zyuɵ$�?���N����ɼ�˛�<��X.'H��md�u
娅r�3�:�`�h�~�c1E4/�7�^f��Z�P��z�BYL�/�.�B��Y:���PdSf��Ѱ](넾�IGF��
��	�����x4�բ� oz��l���aR�	� �6�A

<�/�
�����J���!,��cq��(
>��N2v�v�e�CF���)��)W���{�Թ�
+3�C���4?հ�j�U�H�i⌰�Cآ�X�M�p$A��<�l<E�L��UǪ�P��Ř BoB��;��P�E�҂57-
��l$x
+3x�G����U�mW}[�\��������r���%ί��"v�W%@��Z�s�PS$�չ"�����7���g��,c���h��_Ï��v�֨
���M��h�[�_W"a�e�#>�
+�Y��Xjh�4dR)
D�tr
eM����y�q kd'o�q��iq�
+W�����dT���նD�@�U�<T��ߋB������zHTIc)��J����ib	e�Z�i?�Q�P��Bq0��S�;���\�+��E��*�{"�5)c%��*X�3��q�)<�t�`��h��y(J�ԣ;J�zl�d2~8��c����_9M�	�t�G"Y��2��E��g����>I4�#Z��p����K`_a��2C���
+k��ZR>Y[��!��� ��e�Ev9̿X�k	;��C.����Օ��|(������Ǫꏟf�|usYM�{�fҍ[b�9��R��>�Ž�
$�$���
�[C<i�Ed��r�k�4a�`��PiE��Z��3~%o4�m}���`j�=���N=`�"౎�]p��ہF�j
y��3������
)�6 ��
c޶A^�M;^������h{s��Z�}�|>���x��Ð�r馆�Ⱥa���ݪ�8�&&}F]�`��2iU<G�A���s-�S��N�d���N�;
�Y:�K�l��Pkx�Y1	�G3�<^=5��eU=߉������L�X��}/vQYĜ��}�'��;癎�4m�Ӫ^�3�� 1��<�����������F�J|M|B���������&>a,���x�E|B�!���Q�h�S���p��e�}ħ�N0�2�H�>��R8Tt��3�N��n�Sh�ݑl�:��SCMv�oLvJ?�є1��
+
I�h%]R�S"&�P�b;�ԣ�t����t�������T�pJ,��&�
>UR�SR!|��w��NwP5�9��<]�^�
+M�N+�%�`A}�2-�	 G$���;�ԣ3J"=�)�y�n���z�����_�w
+��mz�SHL]�$E�_AfH3d�LB��!1)��yA#ܷ&<hMx�,t���;����L�x�
��5�Y

+i�t�̃�'�?0v��4mƓ�&�o��'�>��=��dx^�
d<)�I�W��<^�H��	%d� �'�n�S�BGOu��Ǒ���������I����`*^vS at C|�P�ʯ���
��$����
D
�[��ٟ���.�P�= w� �H{#m|(�
j�Ӫ�ua�ͭ)C�߽L'�Q9���]�5���Ÿ|]��r�S��ü ۚ�����"��_]n}��u`]�i��k���A�Mr��A^q���xk�Jh�4]�7�(V��
�kUoO��<?���?
��B�>
FH.���9�ĵM:1�9{�Ar=ԁtt��G'��؀�u>�Y�*
7���/�iM��֏6Jx1:
+x�����H�]ʠ:Y��'����C�	�'3��B&
����*՘RDs�x6$&��0�3���gB��g�B���
M��
C7����^
+[K���bC��j�=>`~�V��S����ӟg�@Wis�
�����j�#�G�7���{
Db �b���
�F�
q
��4�+Y���i����@Ga,t�U��F�f�E%�𵿹�&��!X���ˢwA���S��BJ�ix)��]�)���'X���*>N�EK��>��'�:�$	ur?^�e���-�-�/��P^��^��~�7��*����F���VÅ
:!Ҥl���"�XJH��R
Kf��2E�e7�ʏ�]�
+��jw:���K�:~q�?*^���y�WVC�k�������G�o�u�{���O�$
������3,����eQ�i�|dW���Oy=���z�Q_�۶�V�Xև9z"s�(�m���'[_�㢲�v
�S��\��㟯�n���b>&w��n�l_6��C��gm�B�EY�e2��Y�
d]�6m�2B�6 |�;:e�Js�׸�~\�X߸z7���˶��H�
+endstream
+endobj
+2881 0 obj <<
+/Type /Page
+/Contents 2882 0 R
+/Resources 2880 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2897 0 R
+/Annots [ 2874 0 R 2887 0 R 2875 0 R 2876 0 R 2891 0 R 2877 0 R 2878 0 R 2895 0 R 2879 0 R ]
+>> endobj
+2874 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 543.896 201.372 556.295]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2887 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 530.392 201.372 542.387]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2875 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 530.392 267.79 542.726]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2876 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 331.705 201.372 344.104]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2891 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 318.201 201.372 330.196]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2877 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.234 318.201 267.79 330.535]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1C__Polyhedron) >>
+>> endobj
+2878 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 168.132 201.372 180.531]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2895 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 154.628 201.372 166.623]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2879 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2883 0 obj <<
+/D [2881 0 R /XYZ 89 770.89 null]
+>> endobj
+2884 0 obj <<
+/D [2881 0 R /XYZ 90 721.073 null]
+>> endobj
+2885 0 obj <<
+/D [2881 0 R /XYZ 90 646.048 null]
+>> endobj
+2886 0 obj <<
+/D [2881 0 R /XYZ 90 567.652 null]
+>> endobj
+2595 0 obj <<
+/D [2881 0 R /XYZ 90 521.027 null]
+>> endobj
+2888 0 obj <<
+/D [2881 0 R /XYZ 90 516.544 null]
+>> endobj
+2889 0 obj <<
+/D [2881 0 R /XYZ 90 433.858 null]
+>> endobj
+2890 0 obj <<
+/D [2881 0 R /XYZ 90 355.461 null]
+>> endobj
+2647 0 obj <<
+/D [2881 0 R /XYZ 90 308.836 null]
+>> endobj
+2892 0 obj <<
+/D [2881 0 R /XYZ 90 304.353 null]
+>> endobj
+2893 0 obj <<
+/D [2881 0 R /XYZ 90 245.577 null]
+>> endobj
+2894 0 obj <<
+/D [2881 0 R /XYZ 90 191.888 null]
+>> endobj
+2648 0 obj <<
+/D [2881 0 R /XYZ 90 145.766 null]
+>> endobj
+2896 0 obj <<
+/D [2881 0 R /XYZ 90 141.283 null]
+>> endobj
+2880 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F60 312 0 R /F72 334 0 R /F84 438 0 R /F8 448 0 R /F13 1211 0 R /F11 395 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2906 0 obj <<
+/Length 2571      
+/Filter /FlateDecode
+>>
+stream
+x��[Y�۸~�_��HU�`�J�7q{������ٚ�H
��%SԌ�ߧq�"(��8O�4}~ݠp2Mp�כno��E�$E��2�}HR�(�"!�n�|�t��퇄I�H*a�}���t������ͻۛ�7^ᄸ�)��7_~��
H0b�N��E�)��y���7س��"*̥��
j�bP�c�(�P�
7����2[�U^	�-_;�{W�}�^�w;;��`�L����h�*A�Q��T"��!�0��T�Y'mޒ6�a��Q�pJ���2�2���O^DRxx%3�m�DJ�R2s��GT ;y�.���*�w��"/ֳe�n��̏}��������e���lV�tx��HD���^�0$�ii�S<�/%h�r�t���8_U �#y��I�Q��oÖ>C$�I:�ciI���E:T	��.E3�E�>'
Q�7G�̓�@]fb9�~�uj
+t�J$��c�t��r
�=�M�ޖC��
8Mu7�	���t���
ˎzC���"�
iX.��@
`u�+!�8"R�Kh7�P�"�H�8n�吊��	R
ff��,ik"�HB�I�z��ݠ�:D���!�^�F38�UV���&I	A�zt��E�/
ܫ
+��vW��;�ߐ�$�Yfȵ��,������#�Ωw$A �@����.,Ί��3���wY�w�F�
t,��1y��wv��)n ����h
+�E����r�g�ƒ�`�̓1�O�,gw���E�
̌�3��H���\�fy�9J�0����rn���c>)��`X�\1���������}	�d�/C)�Ӑ�A��!�M�y6ɋY1�e�I��$L*����z6-�����ބ�yH�b�(3�����; h�5�*y\^�~��,�� �<��x���D$BK$��FD at xH`Hq�ܚ?�C5�˼�~C�-���z?��
+xn�/�|j�����M|�c��jժo=�3���:D�N�i��NF�"����Z�=�\�e0>͎g��v�G�e���;�פ�Me
�^/�@H����t�����T�6����9�{��@rk�'m%+&=� \k%�����7�I-�v�
��
+�`~I���H�"�DD��)� 81U*N!	�KBX�
�!k��Xy%�d��[�"+k�q�g�Q��]l�U�u��ҭ��>Y
ET=��ǜ'�T�?�F�\��mH�c}��86Ek�
*_)��X�ψa
T
+�$�NǬ�:&���ń�a�!<��
+��d�8+��0i���=��.��u�,]ʀ�.��E�Y�C<�#\
8qf� �Y�jC�Mupo��c�9/0L�s�awy~̽�e����H�R�m��d-�ӱ�M�
?�^�D@��$&�<{���c1���M�?�t�v����ȡ��\�S<����9!�@\Hq,j�
+4]�a`%��jQ���\n{�߯Q at u
�#��Z@�8��I�{Z at L�XhW
B���A�Y��1��r���#�b��t��1'�b.V�~�3�
*�z�54��b�i
+ԉ�n�p�m�P�n����V
�B�!���P3e!�G[1�)���0����'�b���s�r���!
+E�n��;���m�z��gT�SaM���@�l���e�m#����-�B��>�+~FM<b�eK�4(z[пj��-���Y
��O;z9\�H�<55=`C����I�#�W�i#�� �E1* 1yZ��| "� T���. �8.  ߎ��'��U�ߛD�����kh
��,� 
r-�0d�1�E���"��
X˟,��P
&='<�*T�1�c\ 
+*�sߛ�
,��S
eYE�t,�d����
��(�)��c>�te�cQ����,�/��I
5������>��`A��n�����91���.o'�^
Ȑ������Z�6���zɟ ��
+���O檾����=+:#�������.��睩�2�?R���H�2��G:9��ˢS���/Ri�#�y��)�HJ�2�c��+��mG\4�5����dלm�ؘ����.�~���eL빔�y�VqQS��!
+ 
�Q��+д.E �s&"�:-�qj
���|�
����Ǽ�V�w��r���wV2�_W2��_V��
*�L%�Ը|�A�9A\�Ù�n�G�f2 ^gN��xe{6ˍ͐p;�6k?�%Ex����
T�(7C@[� k����
���ǽ{�7�}����5s
���H7�Bz����.����
)��ý���R�@�P5.iJ-zm�eȦ�;8��Z�'�Z1���V�|�R+{u��w�Ԋ��/��eO)�"�]�Z��K���R+�B�h����p�ң�8��R
��,�j��TN�Ҫ��&���)�U�H�X���wE��S�r�>7SH��~� 
+��}پ�/�9����
��y	Ķ�F at o�%X#(L�(^A�5G�nLX)|���]|h}\�|̊�&�������
�����:/3b�e����d�=�b�D���"�2��{D�9���w�����7�ȶۀ-XO�F�XU�߽ys���ҡ�r�k���
+�yۮ}�u�X�-�Y��;:��Ef�
+endstream
+endobj
+2905 0 obj <<
+/Type /Page
+/Contents 2906 0 R
+/Resources 2904 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2897 0 R
+/Annots [ 2898 0 R 2910 0 R 2899 0 R 2900 0 R 2914 0 R 2901 0 R 2917 0 R 2902 0 R 2903 0 R ]
+>> endobj
+2898 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 643.369 201.372 655.767]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2910 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 629.865 201.372 641.86]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2899 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.509 643.25 484.697 655.767]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2900 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 443.532 201.372 455.93]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2914 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 430.028 201.372 442.023]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2901 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 331.516 201.372 343.914]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2917 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 318.011 201.372 330.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2902 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 166.394 201.372 180.341]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+2903 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2907 0 obj <<
+/D [2905 0 R /XYZ 89 770.89 null]
+>> endobj
+2908 0 obj <<
+/D [2905 0 R /XYZ 90 720.814 null]
+>> endobj
+2909 0 obj <<
+/D [2905 0 R /XYZ 90 667.125 null]
+>> endobj
+2649 0 obj <<
+/D [2905 0 R /XYZ 90 620.5 null]
+>> endobj
+2911 0 obj <<
+/D [2905 0 R /XYZ 90 616.017 null]
+>> endobj
+2912 0 obj <<
+/D [2905 0 R /XYZ 90 545.286 null]
+>> endobj
+2913 0 obj <<
+/D [2905 0 R /XYZ 90 467.288 null]
+>> endobj
+2650 0 obj <<
+/D [2905 0 R /XYZ 90 420.663 null]
+>> endobj
+2915 0 obj <<
+/D [2905 0 R /XYZ 90 416.179 null]
+>> endobj
+2916 0 obj <<
+/D [2905 0 R /XYZ 90 355.272 null]
+>> endobj
+2651 0 obj <<
+/D [2905 0 R /XYZ 90 308.647 null]
+>> endobj
+2918 0 obj <<
+/D [2905 0 R /XYZ 90 304.163 null]
+>> endobj
+2919 0 obj <<
+/D [2905 0 R /XYZ 90 245.388 null]
+>> endobj
+2920 0 obj <<
+/D [2905 0 R /XYZ 90 191.699 null]
+>> endobj
+2652 0 obj <<
+/D [2905 0 R /XYZ 90 143.826 null]
+>> endobj
+2921 0 obj <<
+/D [2905 0 R /XYZ 90 139.342 null]
+>> endobj
+2904 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F11 395 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2932 0 obj <<
+/Length 2496      
+/Filter /FlateDecode
+>>
+stream
+x��[K��6�ϯ�m������$�ݲש�ڳ�8)G�h��H���x��6 R"(J��
\�`�����5h������ۛ7�T81�H*�����Dq����fɗ�`$�hL0��*���dU-^
�Y�M�]��/#�S�qDq�<�V�hLN^d뵿�����Y^Ns�
�b�����7ooo��!�N��A �������8����	F����
Z&�2�]$�o�s���l���4�Ԭ�Hm�<Q�!��:A�fu��7VI���^{�g���g{+��q��L���ud~S���H#���TM��'�[�w�MFZP#l���қ�����p�J-dױ���Pjq��{�,�w�����U6m
ϊe^���l\yS��l6C�"�D䊅
�v+�ᘎt����N��R����:�Wg٣�vBdI��QG�w�M�a��"}t1�I����DzR	���D�ZG��O8��o^F�'��v��y#��`�B�H��%����������m]��H�z�ݼp���
iq��H�)�_?c
��׿�(6�I��ۇ�Q�>�B�XZج��
����C�
!� .�^��֛F#jd;�̝t/�M5 ?H5��yD %=.f��i��nFn\�{O#"�|���=i.Q������gV�d�
R\%c�s�R��y`q���m�}��I&�w~��?2�lB`�����%3��+B�p,�DH=q��52�'K�.�Q��E�Ece�)��6S

 �*f�/���a��a�Xa���"��V�}�(�
3,���N

L0�Peza7���{4:��e$�E���
�lT%�V�4��`�|_G��&���k랉 
���&Һ��@���ڽ
�yGD�n�y�CBoBXo��q���^������Yz"���G�� 
&	����y(�ـ�
Kv��F۠�p�*ю���67�F��v4��}� x�6gi���!Ai�z����
�Cc�����ͯ��C�z�S�6;�ޖ�m�cTÅDX��xJp�q��&�o �!*A4�\DDT
�q�Pr@���zW�8N��E1��X��J�PP7��+�
nT�
1WD���g��0W`� s�@�e� &�w�e��r�V�:osT�j�2.�i�\AZ�[�'š���pD�D �q�4�L�PZ��KVon���!w�ѧ�����%	�/X�,�/3V�=k]�]�t�r��T�k�d썰Իg
��Fx�c/��t�샆�8ɕ���?��c\7	W\Lv�9��\��B�Jd,n7�*���
.)�R���
[/wl��cl��0+�Ju-ۑL���v ��8�
<ћ�D�S���^>
�
!
V��"�Z�*�0ܟV3�h�i�D��
(�x��n̯#C������s��Yc��o�'K�2g�� ��)9�zI��C����D��ʐ--���~u>-~��m��P������w��Q��>��@+»���w>Ja\�xt��X:-�s�������kSW��������T�Tf�L%Pf{���(jT��U��=������J3����h��Ӫ����*]68��«G7w��:�ӎs.��a��
H|D_�X�y�9LX�"z��q���`��L���BGl?t$Fm?X/�9�� �j?D4PKOz�����R
l?H�_o?�m-�.�쐎�s`����<�QU�7��Q�#=�?a���i%m�'����b
*I����([�P
�#���D��
.��9�]�"���6[�K<?�\#�UDЂ=z
H�9��-�t�o
�AZq'Y1}-
Ғ�J�@���3������Qh���*c�Ȥ-<T�? 
�A)���
��
��
�_� 
+�*ƴ���2N�-���X`�.��ܼG����=��t-����M�>�8R����pj{o �XYB��s�p�&0'�9B���9}��)�@W�h��]�T�W������ɿ��ڱ٦��g���UR��t�qt��s���U(����Sk�<��f���sSk���Oz��s4����r%� T���6�c�R�Q1�[U��L�K��zIc�ҎĨ��E\}oX�>-,��2Xڵ��bv�N�8��B|
+��u�mگ !o�'��.�z�|4t*_�/޷�H\W�D��d��	���NJ��Y�/gG��\8��z�hE
+��q����ۏ�Do�qbno|]5����r&i
m��	�x�]�.ʴ6��I�q���1����9f
iG������
+��}�s"2 }J�>�X������v���a��g��C��fY}����jU��������p�s ���t���y$ \Ɔa����;�?]���
"�ޯ?�SH�~#�����}%��e�·��?f�f��Ͻmeom��u^��~���|̚��
��;�DVu��Σј���y��k�#i��}�L�[��d[�
6���߼�{���r���rߙv/+��߷G*˪�p�(��ҝm�6з�
�%ic@؃?�`b��
ѽv��o�-Y�
+�eWD�aН
+endstream
+endobj
+2931 0 obj <<
+/Type /Page
+/Contents 2932 0 R
+/Resources 2930 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2897 0 R
+/Annots [ 2922 0 R 2923 0 R 2938 0 R 2924 0 R 2925 0 R 2926 0 R 2942 0 R 2927 0 R 2928 0 R 2945 0 R 2929 0 R ]
+>> endobj
+2922 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 641.82 201.372 655.767]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+2923 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 531.353 201.372 543.751]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2938 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 517.849 201.372 529.844]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2924 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 505.495 201.372 519.443]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+2925 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 383.656 243.45 397.603]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2926 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 331.516 201.372 343.914]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2942 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 318.011 201.372 330.006]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2927 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [449.509 331.396 484.697 343.914]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2928 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 196.436 201.372 208.835]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2945 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 182.932 201.372 194.927]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2929 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2933 0 obj <<
+/D [2931 0 R /XYZ 89 770.89 null]
+>> endobj
+2934 0 obj <<
+/D [2931 0 R /XYZ 90 720.814 null]
+>> endobj
+2935 0 obj <<
+/D [2931 0 R /XYZ 90 667.125 null]
+>> endobj
+2653 0 obj <<
+/D [2931 0 R /XYZ 90 620.5 null]
+>> endobj
+2936 0 obj <<
+/D [2931 0 R /XYZ 90 616.017 null]
+>> endobj
+2937 0 obj <<
+/D [2931 0 R /XYZ 90 555.109 null]
+>> endobj
+2654 0 obj <<
+/D [2931 0 R /XYZ 90 484.175 null]
+>> endobj
+2939 0 obj <<
+/D [2931 0 R /XYZ 90 479.692 null]
+>> endobj
+2940 0 obj <<
+/D [2931 0 R /XYZ 90 408.961 null]
+>> endobj
+2941 0 obj <<
+/D [2931 0 R /XYZ 90 355.272 null]
+>> endobj
+2655 0 obj <<
+/D [2931 0 R /XYZ 90 308.647 null]
+>> endobj
+2943 0 obj <<
+/D [2931 0 R /XYZ 90 304.163 null]
+>> endobj
+2944 0 obj <<
+/D [2931 0 R /XYZ 90 220.192 null]
+>> endobj
+2656 0 obj <<
+/D [2931 0 R /XYZ 90 171.346 null]
+>> endobj
+2946 0 obj <<
+/D [2931 0 R /XYZ 90 166.863 null]
+>> endobj
+2930 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2956 0 obj <<
+/Length 2629      
+/Filter /FlateDecode
+>>
+stream
+x��[[���~�_�[��U��ѐ<9��e��L�ɾ8[S��hH$��w���us�@b$�}p�������򝯱�
�����w7��*�	H�1Ϲ{t�Q" ��_+��,�_��;��	
<�d���?ݽ���~v������G�C��%Q����|��uV���q	|��u�n�O7��q+U�+aR�ԗJA�����Q��@���Ι��Y���(�S:ˍ^G�{g8~Z>�ώV���9�2��%�
+�
�xD��T��$��#���hY�
+A�\��+��%�J��z
7���k�%�<0e�q��L��/s&� q����,�,��]���d]�*��Z����e�so�$���
�P=΢�&^�E����K�z��
E��7����|A�����t��Ü�"���oGy�uZ�z��E�y�~���c~���������"�Hd�#]���m��7%�ґ.�����,�u���2��3�~DR�#
U'�7��M��Y���Y�i�`�ڑJq�]����Ds�
+�JY�<Z�_�֕���A� W \� ���z���t��W���9W��
	��_p!�8?p�'�l���>2W��Sf�߱��8F=�o����܀ �X�{�R]��V�&~ԋc��Aܣ5�J�pRB)3f�FU�IҢ[�d���:���J�,Zi֪��2���:
T��]�@�^�	T�K����!�W
u�>��uk�i���C%��Ϊ���d]<ݿɲ���4��0f7[��1օ޲��� Ǖ�•�����(�	�mO���
گ$2�K�5���&�����9ET�7���e�ϫ�e���4�,p+�C����d��
Uv�>d��L&L���vo&�o���+]��=˦L�d����
+�H2�h�����*�����Q���l�sˆP��!,�/f����,�+م�6<���TI#5`'uf$@-�5>֍�m$2n[�]��m��S���f���|��%��ٳo�
�u�Ϟ瞜��9����v�4!��Y
��Q��ǧЏk�`��_�dzzp�&�U�kr�5��K�Li�� ��P�IL?�V7�����(߀ӵ^�PJ������?��_pĀ��٦=M�
�'��Ey�G�T�1u�iB���7 
+ؘcXp���\"�,Tc�
I������ОG���8A~���T���mI&��I�7�tL��Ef�����;�o"��`��ur��	�휊�8�>XZ��X�~�
���c��+���B,e.$����(
��+�����pڎ�f�j@��@��:*o�yD����.7ݰ�iF��)]xj��
#I��(�>���
%W8B�7Z���^�G����;��B��Yu��z-P\hv ��j�
��
+��
ԭ�kV�5�w[�vӪW�z���̼:�C�؂�
'�mSrїK|�(P�T��LH!
+
+�����7�i"��9���tbK��@G
��{S��&:��`��a1
(��":-����S<�*]��q�� �Ie�8Y��
�My��g_���*"==��
�P�4�Ҥ��dD\uF
FpM ��r�ɟ6�H�0N��	x����
:�1������
RA�z ՜�7`�
x�2t��1ˠ/$\.���%L�Q��y�p����u��q�-�%8Ÿx��g��Z�E'���#D��K
O;��d\�ᮏlA���@7�:[�
�-
+VT�$�*'�Lk�-�	���&�oufE
n���e��6�`��QB�4X}ٳ{�}��G�
+F#@�
"K^�B�#l]��6f�N���%��q�V�
+�q�USav�y��ϲ��l+S�N�
���83;��<r�v2��B�i8�
%���
w>�R^�IoOii�"��W�v���
�D��
u$<�a�˧a�cT+x�ʇ�"ٹ��^�~�K<[��D�v�N��5�Y5���m��N"�)�
����l�v�||��g̞~d�Ws58a($��OE`���Zk%�
1�
M�yv��l�驔ƒS4e`�S
9]
��c�}l�zU��5z��Jމ�����l�
0�w�
�d���1}΋h;0a��q��<}|��*[]������!��I���w���(�o
+m��`�]	t	Fw)����tN��|���R��6)�Ӓ8)�Cu����΄�����.�w,s��
�~LJ�s����jP���O%�O:�[tKy@�a�B�%+]?wH#�H�h}]�s:����{�����o[�U:�Np'�k��QY��N�
+�E�]Q�`,��i���B
+C
6`(	�	����z�8)FR-{�p"�D61�r�̳0�rE��P-��W�8-6l
+gi8�M1}��'�q�W�8K=ƙN��0PL
a��O%��t>5���A��`:T4}�XP'4�b�"P� �.���0�S�2L_R��Bx�
+��
��g�o>�?���� ��:~ENq�R�<l�6�w���m�������8�K8z�?B�W7HA �����P�xꏝʓ��·0Y��u5�]RD٣����_y��a.�ک��ɾf��K�,;|�M	�e�_�
B|��S�r9�mV����e`	��ͧ����ի��:��5AA>���J����c]��i�
������a���Y��
+endstream
+endobj
+2955 0 obj <<
+/Type /Page
+/Contents 2956 0 R
+/Resources 2954 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2897 0 R
+/Annots [ 2947 0 R 2960 0 R 2948 0 R 2949 0 R 2950 0 R 2964 0 R 2951 0 R 2952 0 R 2969 0 R 2953 0 R ]
+>> endobj
+2947 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 631.015 201.372 643.414]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2960 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 617.511 201.372 629.506]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2948 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [99.655 605.157 201.372 619.105]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Length__Error__Exception) >>
+>> endobj
+2949 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [208.262 483.318 243.45 497.266]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2950 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 406.869 201.372 419.268]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2964 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 393.365 201.372 405.36]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2951 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.75 406.75 535.938 419.268]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+2952 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 184.969 201.372 197.368]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2969 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 171.465 201.372 183.46]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2953 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2957 0 obj <<
+/D [2955 0 R /XYZ 89 770.89 null]
+>> endobj
+2958 0 obj <<
+/D [2955 0 R /XYZ 90 720.814 null]
+>> endobj
+2959 0 obj <<
+/D [2955 0 R /XYZ 90 654.771 null]
+>> endobj
+2657 0 obj <<
+/D [2955 0 R /XYZ 90 583.837 null]
+>> endobj
+2961 0 obj <<
+/D [2955 0 R /XYZ 90 579.354 null]
+>> endobj
+2962 0 obj <<
+/D [2955 0 R /XYZ 90 508.623 null]
+>> endobj
+2963 0 obj <<
+/D [2955 0 R /XYZ 90 430.625 null]
+>> endobj
+2658 0 obj <<
+/D [2955 0 R /XYZ 90 384 null]
+>> endobj
+2965 0 obj <<
+/D [2955 0 R /XYZ 90 379.517 null]
+>> endobj
+2966 0 obj <<
+/D [2955 0 R /XYZ 90 308.786 null]
+>> endobj
+2659 0 obj <<
+/D [2955 0 R /XYZ 90 274.116 null]
+>> endobj
+2967 0 obj <<
+/D [2955 0 R /XYZ 90 269.633 null]
+>> endobj
+2968 0 obj <<
+/D [2955 0 R /XYZ 90 208.725 null]
+>> endobj
+2660 0 obj <<
+/D [2955 0 R /XYZ 90 159.85 null]
+>> endobj
+2970 0 obj <<
+/D [2955 0 R /XYZ 90 155.367 null]
+>> endobj
+2954 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2977 0 obj <<
+/Length 2675      
+/Filter /FlateDecode
+>>
+stream
+x��[[o��~���[)`5���-
+$鶛t
�����E@[�L�D)$
��}�̐IQ��A�Ťf�gΜ��L�h
��W���^�C�� #����"�#�
~͢�b��`�)���X&׫��}:+����H����1z7�8�g&Dǫ|2�ǯIY����]����6���#FL~�~{���է+<�x
R:�]^��
�f0�6ˆ
=�EˈS�E���?W�>N{ET�[{��Y�� �y�C��s�<N�d�V�I���-ʣ;l��I;�u2�w��$9[��%��1�4	,�Q��!d��yGڠhD�F1†zy�k���/dCv-�H�

��z�WI��Zݧ�f��i�T���H*��-��^��f�^��)��*]����8mI������86����zG�`��Y��
T���i�$�!-�|�����\{�}��m���U~��pq)82j/�.��D��wsf&�~s�V֧J�J��c
�n�pD��<�"��z������A�.W��q̼�������"�}|YL����4�>N��"��&�:;�����K�s�?R@ �::�c
��%�
�(�`��⸾/V*�G�s	�����	��

+(a&�EI>!qDڬ����c�R)R�V���a5�f��j�N��f�x�*��Yj,AK�5��$%v����h��zG���G��)�,�lL�*N�����j'7�:ܴA
f]P��NP���HS}Hd��!����x�����7��z�'�v���WY^��3��
b��`!��
���ܟ
�� �bMM�J^����
��S��?�:q���/Wo�J2Ź#+�^�Rd�iY�f���+��
��՗�#�
��
�=�
*���2ձ3I���;,M��������0�f�	��D�dpC�=f�4����ΰ̖�v���������7����u,��9��v
î�=f�y��6��i�1����Ҕ	�\hh�u疿zږ���%
h	IA^"�$�R�g��	���h�= ҕ���m���Q�q��M^�skmi1B����V8�_�Z�
�
+A�fP
�	�X=%҆C
AZBׇ~�_���H
+_��pB��,�;�"-U���򡲖�v
�h�
+
+-Z��N9��Ȁ��[k�ߤ�c��#�C�Z�t����Vjc��T�e6
����-��
��z�]����!�H��(8E�(�������9%�!��Ju�21����x靤A�|�u��^�x
�ܳˇ��n���l\��J)4�@6�<? u
�ݷ��c����怤:ŝfš):+�r�ԧ��cF
�٪¦�M���2&ƍ�Ä�a�!�չ~2�:�p���Cn��?���v�I�%�ق�%�)>i��O0p�?,o�¯p	�R��'�-����	�q�
����g�y/�L��
�p�^9�x�֞��׋��KA?jڼ�&����d���EP��5�Y�H�����<���txv�vw���ȡ
�\�S<
;�`��R

�;~�>�0�%��u(E�8���<zP@
z6��y�YO
=��&�Q�B�&�R�j��x�b�8xfہ�_���#Q��U���,�DEXO���A���IT-
+D�(��]H�x=!�. �%׎��2 �"

v��#� +��
��!
�?�A�,z3.Hޘ�y��= ���U/�tc-���۹��Nv�@��5=��`@��&�ŀHʘ�%%�EHMx�>�G�j�zn�G
��Y���}������c�?
X����XF	"<$��(!*O�.�a�q�1�M�?g
q��Y<)�&�
�Bϫ		�0�L�S��˸7�._3�#�~��l���KQ2лΧx�C��+

��B@~�A[�/@�
h��V��Š���HQ}:�#.
+�:����ǂ?g�j��1��:�;��<�
4=B
�����
�GPG�u1���

�(dw
����G�>�l�U��dCD�0��2����7�l�&Ⱦ�A�����V�UE�Iڈ�c�s�-
��
+���я@��ж@b�'t4
+E�(
�x�h[��P�L2H2���#�54��J�
�t��{,#��m�U/�}f����K�V�
k^!8�"!A-�bG�Z.!��z�֛�R$�o>Ÿ�~F�:�w�J�A�9ر]0��#�^DҤ]�.�Un��'�[�(W~$��Vŭ�<�2�3��	�~n�/���ܴ���B%�ͦ��A4�XC��}�jx	|�?C	��7u�4_��0�wwϧ!�*�	=�Ӑ�03"H�l�
����pȞ(8EW�B��3E�[
�'�f21
+9��&P���怤-Zqh�Ί
���`�)em��� zȊ/cb܈;L\�����C�z��e��7��.}5�l��(�;��;���剀f���:E��"$Z�5�T��^�è�uy��=���=W��?�����l�K���?��HQv����*�k�:Ia��ݻ��ێ}���|���녶�)�j��z�eZ�i"D\��'�CR���
}0-ʬ�)��\��:v%��4��L�_���_W�4؜�bhX6��}U������üL�9��a���<
mޠ{w
��\5�{fۊ��<P�t����,� ��h
��[ѽw�̓���7K�}z�(���
�
+endstream
+endobj
+2976 0 obj <<
+/Type /Page
+/Contents 2977 0 R
+/Resources 2975 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2897 0 R
+/Annots [ 2971 0 R 2981 0 R 2972 0 R 2985 0 R 2973 0 R 2989 0 R 2974 0 R ]
+>> endobj
+2971 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 643.369 201.372 655.767]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2981 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 629.865 201.372 641.86]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2972 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 443.532 201.372 455.93]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2985 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 430.028 201.372 442.023]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2973 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 243.695 201.372 256.093]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2989 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 230.19 201.372 242.185]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2974 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2978 0 obj <<
+/D [2976 0 R /XYZ 89 770.89 null]
+>> endobj
+2979 0 obj <<
+/D [2976 0 R /XYZ 90 720.814 null]
+>> endobj
+2980 0 obj <<
+/D [2976 0 R /XYZ 90 667.125 null]
+>> endobj
+2661 0 obj <<
+/D [2976 0 R /XYZ 90 620.5 null]
+>> endobj
+2982 0 obj <<
+/D [2976 0 R /XYZ 90 616.017 null]
+>> endobj
+2983 0 obj <<
+/D [2976 0 R /XYZ 90 545.286 null]
+>> endobj
+2984 0 obj <<
+/D [2976 0 R /XYZ 90 467.288 null]
+>> endobj
+2662 0 obj <<
+/D [2976 0 R /XYZ 90 420.663 null]
+>> endobj
+2986 0 obj <<
+/D [2976 0 R /XYZ 90 416.179 null]
+>> endobj
+2987 0 obj <<
+/D [2976 0 R /XYZ 90 345.449 null]
+>> endobj
+2988 0 obj <<
+/D [2976 0 R /XYZ 90 267.451 null]
+>> endobj
+2689 0 obj <<
+/D [2976 0 R /XYZ 90 220.826 null]
+>> endobj
+2990 0 obj <<
+/D [2976 0 R /XYZ 90 216.342 null]
+>> endobj
+2991 0 obj <<
+/D [2976 0 R /XYZ 90 133.656 null]
+>> endobj
+2975 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F11 395 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+2998 0 obj <<
+/Length 2762      
+/Filter /FlateDecode
+>>
+stream
+x��\[sܶ~ׯ�[wg�0�6ә�M�i���K�L��(i'{��b[�� �KR�J�
י�/&�>
|���
�4��h�����gϾ14s�i�������HG�Ư��Ǒ���_fB[œ�G��������ߟ���ξ>?{{��f,~�������ǟiv��/3J�����h�I.p�eo�~8�%��J���R���:B��
�R�|�Ჸ�L��u �@�.b���&����~��4�~l��
�iˉd{5M3.�c
�
W֕�?kH
ϙ$
J�2VEvݚ0��ꦔ�,٘,�!W�L;�gq�^,ƒ�����/_��Œn��b��e�&16�	c�)ݙ���M#��)�-�v�� !$a��+(�C7��SG@��6�oW�1W����36�^�1�(y�;Ɉr�2���t
��{
�j�E���������ںA����4�;(�}@@��&���#�,���d��\�����b^��r�\MA�5�Ն�Y�m%
�k�[/�3���$s�g���.j��{A8Qr<a����|�Un��ݘ��rz [...]
+-3�`�r�j9q��
+�Cp�f"o#!Ƙ����j�׽b�BJ��\��t?�^�rP����Wc.� ��-d6�O7��C|B)��PX_��j��ָ�N� ڦ��hx�N�����*����mA���l
+R0"�ф���ӛEd�OT��
5}̄;�	-��2
x5��WΝ
E�Ͼ���TLٝ��v�-/���;-��)V�7��M1�l110��5�R[�e��������E�V��	o��f�GH�
-��8�|]\�ͨX�ˢ
k~�f��e� (��o��7�~�U�07f����Oe-i�����.����
�t����0I��{�%��
Y�;�O�
���2ZěU���6�~y�{���
+��
�s�~zU,����uP�S뺱_϶�hQ����x�g�e�+��եVbX�K��5�J��E����(�qVX~�.��ˁ�eڇ_��B�-k
�� ~�P4���|6�7A���nQ��e_0��J`�fH'�k.�
�L�αhD��5H�1�p
B��C��pb�ؿ��D<=bH.1�
ة��-�h���fh�>V��rXSL#.9D��Z�MV
�W'��M/��h�F�.5|;߮7}�dDк�E�z��Y�G�yj�`�(�/������	Z
�
D��"eqj����M�b� ƀ�>�d��C��i0�y܄q^y�u�>*�Zqo�8��u��Ͳ�c{�찆U��l�i�;z��T�H
+e$$_j��|�V���>��{YY7�G�w�~�5Qx�%���2j�O����"^�
���;���W�<���~�Y�B`�_G��f��_��"��K�A|0�U����1�����D":ab
wi^+zy[��?����G
���PWgA������meY5��<����q�U1��piS\�.�o��dɓ����
6�6̤4��%
��j��|�EDjy�<�G���p��|��|�����Ó�ꤤoBUIߎ��K����9�*�{�t[.$R#�z�Sd>�����z귳����U���ů���%.xlJ�i9_��um|O��J��w%�����S����7勘˲�Vĸ��߾�/=�:\N�~%��O���)I_�2	�fvhQ�|�ˡ��`&�~�I_�}�4)�������f0�뗣��E�^'}�0$}
L�
�^ ������޼/z
y_F��/�4�F���M;���P����I
�}�t��oH��C
+η��a��ż�ԯ��R�B�R�xR�~���ԯ����E4���n�-�ݺ�[�Qބ�l�zK���]�/>�
Ϩ�a�!f��}b�gא�e�P��Ĭz�0&�a힀E���N��0j\Xo���tG�a��P�D8IJp�-��A
+�5^yӌ[�8�-~�3��8�h$n�N~Ue�R�&�I�KP��&��D
�p�\b��
+���ؔ�	���<�4q"�޼Z
��4q��9���ㅇ�8���b���S�&Vq��L�����
�����#&�o���q(�RK
���G�*eaBP��&NC�ϼ&�υ�OZ�8zz��K�,e��x��&�Y%�*�%,Lp�	�I3��EF���Xҕ%��%��Ƃ���Y�
+��


W�h��sY"UY���
6\D�Τ-R�$�ѲL��;e	�-Kh�,Kh��0:�'�u��z�CD
�
+F��^Ibx���
�nx��(��(�eD�4}Z����)U	�
~2�z�muY�
,KPJ����Eg�'u���e��|��Y�Dgэ�	_cʄ�)����J�3t
K�.����,H4��U�

�7a
�6T�@p.�;� a�,�X=�!����[E�h=�Iv`=���%�����F���@=��?4��e��2�u��!l+��&{	E;�>zmB)�ǫMhD��n��6W���%��'����at�҄Ck-�L��7����K
��A�A"����M-0�ק�HZ�0.�=8�&q�^7A�vKG|��P��q��o��4�c�O�;��*��S|
����e�>���)<{1�ߗ�7���N`5�f#l�9���=�^}o^6����w��f�ߔ
�nau���e��?�b���R����ۼ\���/�a��V.{��Uac�<��yS����k=��϶��v��Z���ݟ�=��ެ��
A��pk���(�k�w
2V 4_V���G���c �����
+endstream
+endobj
+2997 0 obj <<
+/Type /Page
+/Contents 2998 0 R
+/Resources 2996 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 2897 0 R
+/Annots [ 2992 0 R 3001 0 R 2993 0 R 3005 0 R 2994 0 R 3009 0 R 2995 0 R ]
+>> endobj
+2992 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 694.926 201.372 707.324]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+3001 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 681.422 201.372 693.417]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2993 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 470.78 201.372 483.179]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+3005 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 457.276 201.372 469.271]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2994 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 234.679 201.372 247.077]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+3009 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 221.175 201.372 233.17]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+2995 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+2999 0 obj <<
+/D [2997 0 R /XYZ 89 770.89 null]
+>> endobj
+3000 0 obj <<
+/D [2997 0 R /XYZ 90 718.682 null]
+>> endobj
+2690 0 obj <<
+/D [2997 0 R /XYZ 90 672.057 null]
+>> endobj
+3002 0 obj <<
+/D [2997 0 R /XYZ 90 667.574 null]
+>> endobj
+3003 0 obj <<
+/D [2997 0 R /XYZ 90 584.887 null]
+>> endobj
+3004 0 obj <<
+/D [2997 0 R /XYZ 90 494.536 null]
+>> endobj
+2691 0 obj <<
+/D [2997 0 R /XYZ 90 447.911 null]
+>> endobj
+3006 0 obj <<
+/D [2997 0 R /XYZ 90 443.428 null]
+>> endobj
+3007 0 obj <<
+/D [2997 0 R /XYZ 90 348.786 null]
+>> endobj
+3008 0 obj <<
+/D [2997 0 R /XYZ 90 258.435 null]
+>> endobj
+2692 0 obj <<
+/D [2997 0 R /XYZ 90 211.81 null]
+>> endobj
+3010 0 obj <<
+/D [2997 0 R /XYZ 90 207.327 null]
+>> endobj
+3011 0 obj <<
+/D [2997 0 R /XYZ 90 112.685 null]
+>> endobj
+2996 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F84 438 0 R /F60 312 0 R /F72 334 0 R /F100 1102 0 R /F11 395 0 R /F24 309 0 R /F107 2678 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3022 0 obj <<
+/Length 1601      
+/Filter /FlateDecode
+>>
+stream
+xڽX�v�6��+�+yN ٹ��:u�DVVI�%�[������� )Q���vc�0p1�ǝ`g�`��ۨw�N`G"�)wF��Ď$b
�f��`��O0��*ʗ�x�%녚��8�'y��=�]4TIT�Y:�[/'Y��)�� ��f4T�*�H�t� �&])�o�������# v�9�!:�e��7��`����/C�Q/Z:��7q�z�z�^�G��z��cy���#""��C��)L�PI���
[
+'
��}�H�h�\i�lK���&_#�6:�
I*�2\��x����(��23�Qj~���穚���
en���$��2��tn�].��_L����"z[�8i `O��G0�Ma��b���;�k� ����`mɬ�>.Tj�/Z�����j9`��%GX�a��3��;
�ra�n��
E�
1������R�E?T
+�'�qሼԸGà�Ø�/
^��"SMY��6%�g��7:
���UM4�Q�.��G�\�<�9;)����:9?��J�~�?�%����-D=OD1��r�;�7�s�0<�cp�p�B
+c���
 ��$��/s��Z��
�u�p�Pژe;����
)P��s*� ~Gw5��"\
��>�R,�zG
�E���X�!n|o8D��*i�!�">D4Z�,��
�%��!�B8lD�� Q�ezHp��%Q����
ʄl����4[��40�N���f�,O(�Н5?�F_"��"
�G. ����/��w(�c҇Z�5ΤLn�eS
T��2S�Z�:�ŅM�����:�E�c�R�G�����<[n��K�m:�
+�7����,@�Y��J)���gPJ���y�I�ok�� ��*�����[ŀu��T��!
Z���

!�"٫\��M�8��|�k����X(Z+5�jK±ƨ�0��
+��W7����
�y��!��oX�|S�{���M�~@���(�<�@D����4����n
�Z��5涫���Hۧ
+��R�i�,�!:�34�}�����XM@�$��.�2�'��V�:\i�����V�����Q��������?O5:�p$������!�m�ݪ&��E����l����"����>_ޞWl3j(L=TQ������r��
�
�+��pp9
_o�М|��3� ?�%^|�sD��{=� �Pi��:� b�ʕ*�SՉ(�J�<ޯ\w4�-}�?�/��Bz���ҽj�^��l���;�C�K����i�@�r��^cտ�I��8�I��w��J�*gw,�y$	���+ɦk������K��[�b#�֣Ǔ�m����}�������`
ݤ
�ǥ�Vi��=�Օ�e_�`��J�ǟ*�Z@�<��F��
4,4���]���]�RG��)�����y5-�B7'콷P$��O|�m �� ��(��;�����ߦ=s��*�ۅ7)$�{M�S;��P�/
c���Q��ZU�kwRy�R-Ad���<��}��S�_����4�?z���܀b�ӡ�e�zsq1��o�&x?@6���N�m�[�_f��K���2ڸ1��1A
\�*l� ^��T��
�6�����w�2�˦E��=��
+endstream
+endobj
+3021 0 obj <<
+/Type /Page
+/Contents 3022 0 R
+/Resources 3020 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3035 0 R
+/Annots [ 3012 0 R 3025 0 R 3013 0 R 3014 0 R 3015 0 R 3016 0 R 3017 0 R 3018 0 R 3019 0 R ]
+>> endobj
+3012 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [119.351 634.064 201.372 646.462]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+3025 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [93.63 620.559 201.372 632.554]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Invalid__Argument__Exception) >>
+>> endobj
+3013 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 450.95 171.803 460.878]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_aaa76c2fe8629d0c3251374d87a0da4a4) >>
+>> endobj
+3014 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 422.126 196.709 432.656]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_ac49c86d7db3259a07d9a2b293e573733) >>
+>> endobj
+3015 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 393.904 149.656 404.434]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_a95eb0b200e5754f1b18972012c1807d4) >>
+>> endobj
+3016 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 365.682 219.394 376.212]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_ae25095de7466faeb9f7bf4c476f34cf0) >>
+>> endobj
+3017 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 338.063 194.488 347.991]
+/A << /S /GoTo /D (enumparma__polyhedra__library_1_1Relation__Symbol_ab6fa928be2e09cfafd92a225199aa362) >>
+>> endobj
+3018 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 89.548 194.697 100.452]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Timeout__Exception_a66765523c60cdb348393876561c5d0e7) >>
+>> endobj
+3019 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3023 0 obj <<
+/D [3021 0 R /XYZ 89 770.89 null]
+>> endobj
+3024 0 obj <<
+/D [3021 0 R /XYZ 90 657.82 null]
+>> endobj
+815 0 obj <<
+/D [3021 0 R /XYZ 90 557.277 null]
+>> endobj
+278 0 obj <<
+/D [3021 0 R /XYZ 90 550.473 null]
+>> endobj
+3026 0 obj <<
+/D [3021 0 R /XYZ 90 469.131 null]
+>> endobj
+3027 0 obj <<
+/D [3021 0 R /XYZ 90 469.131 null]
+>> endobj
+3028 0 obj <<
+/D [3021 0 R /XYZ 90 440.901 null]
+>> endobj
+3029 0 obj <<
+/D [3021 0 R /XYZ 90 410.953 null]
+>> endobj
+3030 0 obj <<
+/D [3021 0 R /XYZ 90 382.731 null]
+>> endobj
+3031 0 obj <<
+/D [3021 0 R /XYZ 90 354.51 null]
+>> endobj
+3032 0 obj <<
+/D [3021 0 R /XYZ 90 310.087 null]
+>> endobj
+816 0 obj <<
+/D [3021 0 R /XYZ 90 214.476 null]
+>> endobj
+282 0 obj <<
+/D [3021 0 R /XYZ 90 207.672 null]
+>> endobj
+3033 0 obj <<
+/D [3021 0 R /XYZ 90 108.705 null]
+>> endobj
+3034 0 obj <<
+/D [3021 0 R /XYZ 90 108.705 null]
+>> endobj
+3020 0 obj <<
+/Font << /F70 332 0 R /F84 438 0 R /F60 312 0 R /F83 436 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3046 0 obj <<
+/Length 1968      
+/Filter /FlateDecode
+>>
+stream
+xڽY[���~ׯ�)����/tӸ\��ggR���͎���
I-
6-�������!�@3�L�D������`��o�����)J�b�8H�qw��c�����]��D$p��^����O�;�lv��}�x�b�s��`��}���5l�
0b�
���vAL\��n��v�`D�^�L��A�X	F�#�	�8|��,/�:�S*�Y���ͫ��Y\݊��8���8�o
Wʜi�
+��*;4�"��_��w�:��FE�������-2V�$A�Ɩ��^�7���Se���֦�
���3,��-�D���٪R�Y�e����U�XQT���n��1-�7�"P�$��O��WJ��s&]D��V��:Ӡ߳���A��쩁ی��K)�T�x�9��
]'���Y���QD� 3�@`�"�/a�!�=�<nz2�jh1��WEDH��^�������š2>�_��:��k$x�~�bfu�-�$,���,?�
<P�*W���Znh�`�,����F�j�zh6�l�F����Wu�:�^W;�c�,�hW��G�$�c�'�o������_�/Ěb�
�H�.�u�^� ���J�6�4M �������qE���Q햪���C�����	�t1G�S1gQWo
�>tQxf�~��8縨|��pK&��q A*P�41�c��Ω��bݜb��)����}U��d�V'����UM�9�e�>�y���Z�L�h����l�
�;0�o
��,:t�D8P~´��\NyƎv�
F���^b��=���&��ICҨV��`�w΍LR�d�x+�*tnhH&���45D�ҙ�^6u^��-�29E-"	�O}���q��*c8�:�*��VC�P�Ay�)C��͘�D���|#*:�k�ˊ�Rp2+G���K�O�_�%V�$�Ў9��0�%H&��w(S�Yь��@D��N�}�����i�Kܗz�t�����ߜ%	�`�ܮ�nm.�H�z�Q?�P��*����j!\�r���ͥ�U��������
%,u�h�	�[@*���9��j�Z�O��_��=I�yI
�S��z�
��<��
Z��x��H��~SbZ�W�z^�5�H@�8=�zc���^�Qg
+,�3��Q�}���K3���&����Ab,u�:	sG�*�Ĺ^�5�
�E��
t�/FzXM�øTkB\�v�4[��Yf�
��,��n;/�^U�MF�-�h��t4�v�n�*K���Y���>*�Re�}�V����>4	o�ս}n�:�_#B3Pϡ0_��-�� $1�f�RV�4ܶP
fF�.����2�$t=jKM�Z�rZ��sݘ��R��w����~�HwPkQ7혚ǎ�ޏ�=1�����x,����kpE[\lA ��������G�A��>�pǭ��#w���0�<'.M�����l��
`uC����7����{��?a��M��n��<֡��H�LR
2�Ӂ�/�@���_q�n�'�;�^���:t?]n�9?S�	N.�q������q&
����#I�Y
+p�&����HbS�@���xc���,M��&ѵ��a���r�;����&�����u�.vߣN���S��\��ه��b��*����t`��>��n�p(��ӛ��u�-�>'���Yb��ZR-��DM�?R�䒚�R�"ʆZ.�k�!օ�A�S���B�G�A�,��H/
+]6,82��L#
H
+.^7z^B��?
�H�/��˱��?+�~�4�@K =��K�;'�����g`�I���k�ПqWow,xS�#9�$����Ǹ��
\�r� �g:�����v��W������C�u/��v�ޘ+��s��?G�t:L�������	�B�>�$���u�0}�����G���g&�j�
+�
+�}��Z
��mn4��e�x&|
��Ǎm�m�͝�X3��7����
+endstream
+endobj
+3045 0 obj <<
+/Type /Page
+/Contents 3046 0 R
+/Resources 3044 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3035 0 R
+/Annots [ 3036 0 R 3037 0 R 3038 0 R 3039 0 R 3040 0 R 3041 0 R 3042 0 R 3043 0 R ]
+>> endobj
+3036 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 509.369 149.098 520.273]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_a008168f710b00996c0183f79c23031fb) >>
+>> endobj
+3037 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.114 481.473 143.858 492.377]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_a9fb15acabc414c238c79e7c4f211c185) >>
+>> endobj
+3038 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.921 453.578 173.486 464.482]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_ab54edfb4d01886f38228f56771aa085d) >>
+>> endobj
+3039 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [177.302 453.578 212.49 464.482]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+3040 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [183.877 372.816 237.346 383.719]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable_a515c8c049d322413eade7a3f05721444) >>
+>> endobj
+3041 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [241.161 372.816 321.738 383.719]
+/A << /S /GoTo /D (interfaceparma__polyhedra__library_1_1Variable__Stringifier) >>
+>> endobj
+3042 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [184.141 283.703 219.329 294.607]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+3043 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3047 0 obj <<
+/D [3045 0 R /XYZ 89 770.89 null]
+>> endobj
+3048 0 obj <<
+/D [3045 0 R /XYZ 90 721.073 null]
+>> endobj
+817 0 obj <<
+/D [3045 0 R /XYZ 90 633.415 null]
+>> endobj
+286 0 obj <<
+/D [3045 0 R /XYZ 90 626.815 null]
+>> endobj
+3049 0 obj <<
+/D [3045 0 R /XYZ 90 528.363 null]
+>> endobj
+3050 0 obj <<
+/D [3045 0 R /XYZ 90 498.733 null]
+>> endobj
+3051 0 obj <<
+/D [3045 0 R /XYZ 90 470.838 null]
+>> endobj
+3052 0 obj <<
+/D [3045 0 R /XYZ 90 391.725 null]
+>> endobj
+3053 0 obj <<
+/D [3045 0 R /XYZ 90 344.621 null]
+>> endobj
+3054 0 obj <<
+/D [3045 0 R /XYZ 90 234.637 null]
+>> endobj
+3055 0 obj <<
+/D [3045 0 R /XYZ 90 211.887 null]
+>> endobj
+3056 0 obj <<
+/D [3045 0 R /XYZ 90 211.887 null]
+>> endobj
+3057 0 obj <<
+/D [3045 0 R /XYZ 90 151.164 null]
+>> endobj
+3058 0 obj <<
+/D [3045 0 R /XYZ 90 103.664 null]
+>> endobj
+3059 0 obj <<
+/D [3045 0 R /XYZ 90 77.486 null]
+>> endobj
+3060 0 obj <<
+/D [3045 0 R /XYZ 90 77.486 null]
+>> endobj
+3044 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F60 312 0 R /F11 395 0 R /F84 438 0 R /F91 520 0 R /F100 1102 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3068 0 obj <<
+/Length 1578      
+/Filter /FlateDecode
+>>
+stream
+x��X[o�6~���[%`fx��n�.��&�K�E;�d��%i��wx�,�N��F�=����s��w�������
�!<_�͎^FؓH�4�Ζ��^�%!��޹O0Q0'c�T��rS�w�*���<����.���>��I�%W��<m��Xe1��
+�T`�UѨj�,�}}���ľ*�
��
.�Nf���>���=b�(���zv~���O�
&c��,Z{�2x�����
��4��lb!���y!b�8�&i��ȩ_��F�˙P�Yj�G�*Ki�$&� ��C*S$c�+��&e���������~��F�
��!NF��P�ؿ
B���c� �sp	}T�fyp�G,�Vw4B1�� 5�����
6��q����kFF�$闀�)A��,$ �xs�U
+a�[\'w�r�2
j0�
aƽ9����n<UMm��\;�pDg���w�����
���Ys��r+�`�p8�g&b�cǛ�
��o�T�vf��M������N-K�S���
�7@·Mi�bW��! ����Us]�?�h��li�(��Y�}0����8,�yTYm� �-�J�8b�4��[ܔ���Do�܎*�%UYNҒ��y�4~~�s܅�}��R�
��6o�����m6�;}�
�v�u�_��m�ҽX8�@���v��ƅRO�PZ�e��<������^V�PUҨ������2�Kmí�������QJx$D��.��tQ�H��:�
`�@^�s
+���K�z��&�m�ɶ�$���{J�.) �$
+ G��H�!���8Ё� �P#
��q��!|\
�|JlN���/�j�Ł4��|�Ѵ�xT��j?(���!�%�ʇ�@
�h	�>3B
�j��)�4��k@��jzD;��T+������S@\�21�����<Hn�����9VM��&E�cǪ^T��d���[OM��fp,��e
�b��X�!>xV�s�U*ՄM"Gk0�Z�]�u��Nf���J��}u��?L����m�Xj�Q�4-�J՛�H]�4&�\q�tV at WQt W�k���!��s�kXal��BN8C!���O[f]5R
�M����d�n�
��$���(M�	�i�|����X���W�XL��(VZ�OO)V�8�+V��R��}�*�.�0I��h�ѩ��au��S��V�t-&��Am���,`�I�#5�.wo��.OR�Y����z?Gת�:�
��&2�5���K���<�2���M�g"�	 ��b��
y��
1����2�-��(�m
4
�Ahި�U�T�t]t=��=��ـ�0��Q�K�;�P_:O����t��=��܋A��0�
���
I������tz}T�Ms�~8�k��
`�W��$±s6P�A:�s�}3zJ�1��Sqܖ�ϱ������
3�R�@;�;�G�b<����d���y��6Y���QE�ڬa��&)�$�$q�e�G� ��T��s�NUG��ֿ�n����6[
(�Q�u�l�
]��ZAs����u�9�����b��uY�Y�k�&ԕ���`�9b�����+�c���&�^��w\B\����u$V�
+endstream
+endobj
+3067 0 obj <<
+/Type /Page
+/Contents 3068 0 R
+/Resources 3066 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3035 0 R
+/Annots [ 3061 0 R 3062 0 R 3063 0 R 3064 0 R 3065 0 R ]
+>> endobj
+3061 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.197 542.56 272.384 553.464]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+3062 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.197 486.016 272.384 496.92]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+3063 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.383 457.059 169.571 467.34]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variable) >>
+>> endobj
+3064 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [113.91 282.571 170.687 293.101]
+/A << /S /GoTo /D (classparma__polyhedra__library_1_1Variables__Set_aa80c4fa3121e341ac6068c60394eb07d) >>
+>> endobj
+3065 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3069 0 obj <<
+/D [3067 0 R /XYZ 89 770.89 null]
+>> endobj
+818 0 obj <<
+/D [3067 0 R /XYZ 90 594.122 null]
+>> endobj
+290 0 obj <<
+/D [3067 0 R /XYZ 90 587.522 null]
+>> endobj
+3070 0 obj <<
+/D [3067 0 R /XYZ 90 528.986 null]
+>> endobj
+819 0 obj <<
+/D [3067 0 R /XYZ 90 406.244 null]
+>> endobj
+294 0 obj <<
+/D [3067 0 R /XYZ 90 399.643 null]
+>> endobj
+3071 0 obj <<
+/D [3067 0 R /XYZ 90 301.191 null]
+>> endobj
+3072 0 obj <<
+/D [3067 0 R /XYZ 90 301.191 null]
+>> endobj
+298 0 obj <<
+/D [3067 0 R /XYZ 90 254.002 null]
+>> endobj
+3066 0 obj <<
+/Font << /F70 332 0 R /F83 436 0 R /F100 1102 0 R /F72 334 0 R /F60 312 0 R /F11 395 0 R /F84 438 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3129 0 obj <<
+/Length 1157      
+/Filter /FlateDecode
+>>
+stream
+x���s�6���W�V<Sc	�<^��r�ݸW���:d�$W�K��J|8��̘$��dbBڟV��]��ql[6R��k�{3�
oF�]�q=ۘ΍ ^�,�idܛ�,�}��?��vF�x����=�X.�$�p�Y,���T
`@���<��
+�Q�ڂ���Oh$N�� ���jR?���Z:0�!�hu�q�3�6��۠����I����$a��4�o'x"�,��	
�o� ��jK�:�h�*���*�)��\t�1�{.L�h�	)����<���	�0�f4�ߟ�k�>�a�����aѥؚPp,c��!�S����f��q޷�� �Q�d$�t
�K��s�@*�G�l�%	:@bۖ�ە�7o?~��D�%,�$ϓ�ui�HC?3�d�mA�
�l���ƃX� ��P%���G'�FnA�LV#\��t�2�\����
���S̷~���7|m�����r<<�d���~S�j�>lFS�t��%��P�Tb���x糬�>Fl�٢�7Oup�V��`�Yy
+|����)%k!��`^�y_#;���bq��|)����Ӥ7�	h�\s��aB���
q��q�qի-�А������
��
�Uk
+�C��n��h�"my�w�)(�xDO���Ut�t��
�JL���8�B�Puo8���-1Q���%9
:;l��"���Gc
h9[�Aҥr_>S�f��r/��%
U�v�:Έ�#
���Dž*��
+ϗ�6�Z�S�'r�m7�K)��S��$M����
+j[ʠ3J�fe�<��
&\~Q]�E��ޔ����I���
O0U�5�B�~�U����ʉ�\1��}*��`'�^�Rk�4�-�"��
��f*F�	k� �	�;0m3׋o6���I��i�)$�4[�8��dZ�:T	I�M�Y���<Wc�$�õ��6^�uڃ�p0\�B�t
���=`��vٸ~]66}����1~���_�4��
�,+���Y���ϝ�wd�g7BK���ڞLw�o�:����/UD*�n�t�yS���ѧ�����yu���%I��/ �*�N_>��an$۠�8r�?h��j:�f�������4�,]�Ti�(W��l��Vȳ
}o���-����\&�%P�E=��ɇYy�em/ܿ��S�
+endstream
+endobj
+3128 0 obj <<
+/Type /Page
+/Contents 3129 0 R
+/Resources 3127 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3035 0 R
+/Annots [ 3073 0 R 3074 0 R 3075 0 R 3076 0 R 3077 0 R 3078 0 R 3079 0 R 3080 0 R 3081 0 R 3082 0 R 3083 0 R 3084 0 R 3085 0 R 3086 0 R 3087 0 R 3088 0 R 3089 0 R 3090 0 R 3091 0 R 3092 0 R 3093 0 R 3094 0 R 3095 0 R 3096 0 R 3097 0 R 3098 0 R 3099 0 R 3100 0 R 3101 0 R 3102 0 R 3103 0 R 3104 0 R 3105 0 R 3106 0 R 3107 0 R 3108 0 R 3109 0 R 3110 0 R 3111 0 R 3112 0 R 3113 0 R 3114 0 R 3115 0 R 3116 0 R 3117 0 R 3118 0 R 3119 0 R 3120 0 R 3121 0 R 3122 0 R 3123 0 R 3124 0 R 3126 0 R ]
+>> endobj
+3073 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 659.542 278.601 670.446]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3074 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 635.546 278.601 646.45]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3075 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 611.55 289.122 622.454]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3076 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.849 599.552 285.804 610.456]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3077 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 587.554 278.601 598.458]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3078 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 563.558 289.122 574.462]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3079 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.849 551.561 285.804 562.464]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3080 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 539.563 278.601 550.467]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3081 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 515.567 278.601 526.471]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3082 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 491.571 278.601 502.475]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3083 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 467.575 289.122 478.479]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3084 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.849 455.577 285.804 466.481]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3085 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 443.579 278.601 454.483]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3086 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 419.584 278.601 430.488]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3087 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 395.588 289.122 406.492]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3088 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 371.592 278.601 382.496]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3089 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 347.596 278.601 358.5]
+/A << /S /GoTo /D (page.89) >>
+>> endobj
+3090 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 323.6 278.601 334.504]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3091 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 288.93 278.601 299.834]
+/A << /S /GoTo /D (page.95) >>
+>> endobj
+3092 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 255.036 140.809 263.883]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3093 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 228.983 278.601 239.887]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+3094 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 204.987 278.601 215.891]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+3095 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 180.991 278.601 191.895]
+/A << /S /GoTo /D (page.89) >>
+>> endobj
+3096 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 156.995 278.601 167.899]
+/A << /S /GoTo /D (page.89) >>
+>> endobj
+3097 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 133 278.601 143.904]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3098 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 109.004 278.601 119.908]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3099 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.794 74.333 289.749 85.237]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3100 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [292.26 74.333 304.215 85.237]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3101 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.648 659.584 505.603 670.488]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3102 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.33 647.629 502.285 658.533]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3103 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.02 623.719 488.975 634.623]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3104 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [481.214 599.809 493.17 610.712]
+/A << /S /GoTo /D (page.34) >>
+>> endobj
+3105 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 575.898 495.083 586.802]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3106 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 551.988 495.083 562.892]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3107 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [501.03 528.078 512.985 538.981]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+3108 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 504.167 495.083 515.071]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3109 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 470.803 495.083 481.707]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3110 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.02 446.893 488.975 457.797]
+/A << /S /GoTo /D (page.41) >>
+>> endobj
+3111 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.263 434.938 512.218 445.842]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3112 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.648 401.574 505.603 412.477]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3113 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 377.663 495.083 388.567]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3114 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.648 344.299 505.603 355.203]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3115 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 310.491 357.291 319.338]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3116 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 284.523 495.083 295.427]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3117 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 251.159 495.083 262.063]
+/A << /S /GoTo /D (page.90) >>
+>> endobj
+3118 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 227.249 495.083 238.153]
+/A << /S /GoTo /D (page.90) >>
+>> endobj
+3119 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [498.071 227.249 510.027 238.153]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+3120 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [442.182 191.383 454.137 202.287]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+3121 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.263 167.473 512.218 178.377]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3122 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [500.263 143.563 512.218 154.467]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3123 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 110.199 495.083 121.103]
+/A << /S /GoTo /D (page.95) >>
+>> endobj
+3124 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [502.983 86.288 514.938 97.192]
+/A << /S /GoTo /D (page.64) >>
+>> endobj
+3126 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3130 0 obj <<
+/D [3128 0 R /XYZ 89 770.89 null]
+>> endobj
+3131 0 obj <<
+/D [3128 0 R /XYZ 90 684.655 null]
+>> endobj
+3127 0 obj <<
+/Font << /F83 436 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3203 0 obj <<
+/Length 1446      
+/Filter /FlateDecode
+>>
+stream
+x��Z]s�8}���maf�H�tvv�i�6i�zkwwg�Cm�ѮG�6��
��q
#�I��%�s����6f6�
ƃ��
60��K#����2�75.���ã������>”�{e��h

���� �m�<ߘă��ؘB󉁑�ƷrPl���sc4�c�W��U"óM
�D��\D2��E:���S�s�EF��ŋaՔ&���9�h}x30.�l�M�V�
+��#
+e�&( ����E4�y�P*�

+�J�Y��e���Tu>J�`���F�	�O��A"ɹ��$iFY&fI��:�
�a	Sٍ�©��M�Zx)��)��m|�
�,�E�	c;�2����
áL�ݸ���ºk#�@ÌO"���W�C���N�d��f\�;.���"،&��v
��
+5���4<x��센0��\F d�<F�AM���L�q�"�`�ox�e�������Ԕ�H� ��B3��
+���8���{O�LC;q���
��'(({J�q5�8e�sT����ˤL��`�d���n�Ѿ���H�����lz��0�t��E����i�U�a`%#�]$3 ���S��h�'"�H����NsH�
��P;x;�d���0����F�|Yf��t�����\<����J�v)�,FM�B]Q�M��W?�pM��`�#~��ɖ�k��젻fKB�2�B
TT�0[>6o<|��h�;ia=��ȱ� ��/$�x�G[�&L�~ٳ�k�!��q�ݞ<��\l�i~Շb�݂�.�,L��j�5l�W��
#����75dmˍl�n�x�$>������a
+y��
M�߃ZԇU�k�g��m�L�م_������`MPn�x1W;�߆��'iB�=В��
�v��n��1�:�T�9Ѽ@�`�6��x}��e��4��]\�{ƕ�<��!eq�C6
pX�۲b���p
�=�1�vx$e*ã�	_�O>}��n}��;@虵Kv�T'̎X�Ү����tGC���v�]���;������'��(���
+��RZ�7g�­;:ܺ����)Of����W
�=s��������Dc1�K�P��٨k�gp{H�P�|�R�
����!�Ѳѓ�
���r�)b����❯����ʃ�M��g"Y6զ���rTu��G�v:���(��Iˠ@�ζ�����H8��u�v7���
Q}l9�v��
J�n
�c��X_�*N��Dd��iձc�|��ls' �������u��y�g���Ocg�ò����#�VL�<w'Pe��kA���/�0y��{���P�P�9~u���
���3�px�
Z}/WM3.�(53��,J��\=�Wa�p{�H�T�CA֞s�8��W��g�O9���P!n}�v����_��
�U4Q�,��&��!�H��e*�8��,"�Ƹ�Ψ��S��b��k�\0��~ň�粳~�j�?�
�0�u�q��6^��
+endstream
+endobj
+3202 0 obj <<
+/Type /Page
+/Contents 3203 0 R
+/Resources 3201 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3035 0 R
+/Annots [ 3125 0 R 3132 0 R 3133 0 R 3134 0 R 3135 0 R 3136 0 R 3137 0 R 3138 0 R 3139 0 R 3140 0 R 3141 0 R 3142 0 R 3143 0 R 3144 0 R 3145 0 R 3146 0 R 3147 0 R 3148 0 R 3149 0 R 3150 0 R 3151 0 R 3152 0 R 3153 0 R 3154 0 R 3155 0 R 3156 0 R 3157 0 R 3158 0 R 3159 0 R 3160 0 R 3161 0 R 3162 0 R 3163 0 R 3164 0 R 3165 0 R 3166 0 R 3167 0 R 3168 0 R 3169 0 R 3170 0 R 3171 0 R 3172 0 R 3173 0 R 3174 0 R 3175 0 R 3176 0 R 3177 0 R 3178 0 R 3179 0 R 3180 0 R 3181 0 R 3182 0 R 3183 0 R 3184  [...]
+>> endobj
+3125 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 707.957 278.601 718.861]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3132 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 664.186 140.809 673.033]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3133 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 638.219 278.601 649.123]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3134 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 614.308 278.601 625.212]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3135 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 590.398 289.122 601.302]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3136 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.849 578.443 285.804 589.347]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3137 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [190.801 556.525 202.756 567.429]
+/A << /S /GoTo /D (page.23) >>
+>> endobj
+3138 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 522.652 278.601 533.556]
+/A << /S /GoTo /D (page.95) >>
+>> endobj
+3139 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 498.742 278.601 509.646]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+3140 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.539 474.831 272.494 485.735]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3141 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.272 450.921 290.228 461.825]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3142 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 417.048 289.122 427.952]
+/A << /S /GoTo /D (page.56) >>
+>> endobj
+3143 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 393.138 278.601 404.042]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3144 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [286.501 369.227 298.456 380.131]
+/A << /S /GoTo /D (page.64) >>
+>> endobj
+3145 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 345.317 278.601 356.221]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3146 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 321.407 278.601 332.311]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3147 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.59 321.407 293.545 332.311]
+/A << /S /GoTo /D (page.84) >>
+>> endobj
+3148 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 287.534 289.122 298.438]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3149 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 263.623 289.122 274.527]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3150 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [273.849 229.75 285.804 240.654]
+/A << /S /GoTo /D (page.68) >>
+>> endobj
+3151 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [283.782 205.84 295.737 216.744]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3152 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 172.032 140.809 180.878]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+3153 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [195.244 158.019 207.2 168.923]
+/A << /S /GoTo /D (page.25) >>
+>> endobj
+3154 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [278.282 146.064 290.237 156.968]
+/A << /S /GoTo /D (page.28) >>
+>> endobj
+3155 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 124.092 140.809 133.058]
+/A << /S /GoTo /D (page.29) >>
+>> endobj
+3156 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 100.181 140.809 109.147]
+/A << /S /GoTo /D (page.29) >>
+>> endobj
+3157 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 76.39 140.809 85.237]
+/A << /S /GoTo /D (page.30) >>
+>> endobj
+3158 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 357.291 706.906]
+/A << /S /GoTo /D (page.30) >>
+>> endobj
+3159 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [497.121 684.047 509.076 694.951]
+/A << /S /GoTo /D (page.30) >>
+>> endobj
+3160 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [471.133 672.092 483.088 682.996]
+/A << /S /GoTo /D (page.31) >>
+>> endobj
+3161 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [457.593 660.136 469.548 671.04]
+/A << /S /GoTo /D (page.34) >>
+>> endobj
+3162 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.042 648.181 498.998 659.085]
+/A << /S /GoTo /D (page.35) >>
+>> endobj
+3163 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [461.708 636.226 473.663 647.13]
+/A << /S /GoTo /D (page.35) >>
+>> endobj
+3164 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.029 624.271 507.984 635.175]
+/A << /S /GoTo /D (page.36) >>
+>> endobj
+3165 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [455.083 612.316 467.038 623.22]
+/A << /S /GoTo /D (page.36) >>
+>> endobj
+3166 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [489.403 600.361 501.359 611.265]
+/A << /S /GoTo /D (page.37) >>
+>> endobj
+3167 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 578.508 357.291 587.354]
+/A << /S /GoTo /D (page.38) >>
+>> endobj
+3168 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 554.597 357.291 563.444]
+/A << /S /GoTo /D (page.38) >>
+>> endobj
+3169 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.965 540.585 508.921 551.489]
+/A << /S /GoTo /D (page.38) >>
+>> endobj
+3170 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 518.612 357.291 527.578]
+/A << /S /GoTo /D (page.39) >>
+>> endobj
+3171 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [453.399 504.719 465.354 515.623]
+/A << /S /GoTo /D (page.39) >>
+>> endobj
+3172 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.72 492.764 499.675 503.668]
+/A << /S /GoTo /D (page.41) >>
+>> endobj
+3173 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [478.057 480.809 490.012 491.713]
+/A << /S /GoTo /D (page.41) >>
+>> endobj
+3174 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [476.642 468.854 488.597 479.758]
+/A << /S /GoTo /D (page.42) >>
+>> endobj
+3175 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [510.484 456.899 522.44 467.803]
+/A << /S /GoTo /D (page.44) >>
+>> endobj
+3176 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [501.299 444.943 513.254 455.847]
+/A << /S /GoTo /D (page.44) >>
+>> endobj
+3177 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.079 432.988 436.035 443.892]
+/A << /S /GoTo /D (page.45) >>
+>> endobj
+3178 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 411.235 357.291 419.982]
+/A << /S /GoTo /D (page.44) >>
+>> endobj
+3179 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [512.697 397.123 524.652 408.027]
+/A << /S /GoTo /D (page.46) >>
+>> endobj
+3180 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [488.826 385.168 500.781 396.071]
+/A << /S /GoTo /D (page.46) >>
+>> endobj
+3181 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 363.315 357.291 372.161]
+/A << /S /GoTo /D (page.47) >>
+>> endobj
+3182 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 339.404 357.291 348.251]
+/A << /S /GoTo /D (page.48) >>
+>> endobj
+3183 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [511.6 325.392 523.556 336.296]
+/A << /S /GoTo /D (page.49) >>
+>> endobj
+3184 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 303.539 357.291 312.385]
+/A << /S /GoTo /D (page.50) >>
+>> endobj
+3185 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [380.762 278.288 392.718 288.475]
+/A << /S /GoTo /D (page.52) >>
+>> endobj
+3186 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 255.718 357.291 264.565]
+/A << /S /GoTo /D (page.52) >>
+>> endobj
+3187 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [507.715 241.706 519.67 252.609]
+/A << /S /GoTo /D (page.53) >>
+>> endobj
+3188 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [470.027 229.75 481.982 240.654]
+/A << /S /GoTo /D (page.54) >>
+>> endobj
+3189 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [499.366 217.795 511.321 228.699]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3190 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.375 205.84 506.33 216.744]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3191 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 183.987 357.291 192.834]
+/A << /S /GoTo /D (page.60) >>
+>> endobj
+3192 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.923 169.975 506.878 180.878]
+/A << /S /GoTo /D (page.65) >>
+>> endobj
+3193 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [466.709 158.019 478.664 168.923]
+/A << /S /GoTo /D (page.65) >>
+>> endobj
+3194 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [379.089 134.826 391.044 145.013]
+/A << /S /GoTo /D (page.70) >>
+>> endobj
+3195 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [377.983 110.916 389.938 121.103]
+/A << /S /GoTo /D (page.70) >>
+>> endobj
+3196 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [496.049 98.244 508.004 109.147]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+3197 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.279 86.288 505.235 97.192]
+/A << /S /GoTo /D (page.71) >>
+>> endobj
+3198 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [477.409 74.333 489.364 85.237]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+3200 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3204 0 obj <<
+/D [3202 0 R /XYZ 89 770.89 null]
+>> endobj
+3201 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3303 0 obj <<
+/Length 1588      
+/Filter /FlateDecode
+>>
+stream
+xڵZ[s�8~���m홚0���>���6��ζ
�
��. *��_	��R	p_b[�w�stn:X+
X��'7��!�b;���YZ1��Yl����Z�p'�o^Y^
�8�z��ݳ���
��7��#�,G=��ad%���g`�b��l/�����ܚ���̬��_#�K$8$�8��(�%b9�%��oq��Ȃ!v?	��=�8�&�\�OlQ
'��6�W��	r��z��׏&S��G�\ǎ�hs�G�B[osã�>�0l�X�����XK@s]Y��:~dG��P;�}S������7��I�^,tp�e��c7���u�T�:�g�2A#-0�FIQq\	�'�?��L�x�`���
gC���6!�3.��0Ces��`��=|J
�
g�`��������������v�l������fAqA7��
�u�Opi`��>L
�QK�"�:1�y��늑bE>�b����y�rx�����}����(��\ԛ�����&��s�yh���)#F
�29 [...]
+������᱒�L,k cd^O� Q�+�U�n���I��1TB^g|
�>����9�"��'��4�	-�7��^U���p0^��T����$�!	�
�������d��W"y�F>�Du���P�F�t���Z�1\�
)��&e�'�1	-
ᐋ���c�>i�v�W��7-c.�`sjy�wX5
�!���f�h�P����L�u��g�my&�g���y� �w��`�����O�u{�V�yv��zř���8΂�[x�}	
+��{M�u}�|GS�u��h�g$ن��]B���I(��U�q;7sg��
��̭1���=
+�V_��Y����.��HA�
�lx2�
�2���TjƠ������z2"*N�pB���OO����ud`y҃oI���E2Ni.\��l���Q�;"t
�@�\�]�QdGn�9��[�"ѱ���`񳀙��NXg �ڜsu���9�����~�Lɨ�1�?
�
+
EK�Һad�'r�����	!0]��oݤ'/��
<xGR\�N_��t��[��B��[
���|�F�fB#!/��K��
qw��xE
���
��f1�T#��Iva8Se�'�/L�q��G~���tx*����*_3���v���;f
+jr���R渃���p��.i�v

i��* ���<1�m@�������t�~Κ<E�y�T���9�����/1O�Q�,Q
�S¿�ֲ���e$'��
+a&��U�\��:9�.gn����NS_�	\;t=ӗqv
����o�|
8a��w��7�4
W�g=�l
7x�-��U���C/���	=��Fhm��[�^ę�ߨ/���ͤX��A�j-"^���
��8`,�C-��1�m��c�~�E�e��'�U��6��؎H#���ؓ�'��1n,����A����)wG
���8���?�UU>��X�W
+;��ޖ
� 
m<�^��L�)kt!�X�k׵��Ğ���w
+endstream
+endobj
+3302 0 obj <<
+/Type /Page
+/Contents 3303 0 R
+/Resources 3301 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3035 0 R
+/Annots [ 3199 0 R 3205 0 R 3206 0 R 3207 0 R 3208 0 R 3209 0 R 3210 0 R 3211 0 R 3212 0 R 3213 0 R 3214 0 R 3215 0 R 3216 0 R 3217 0 R 3218 0 R 3219 0 R 3220 0 R 3221 0 R 3222 0 R 3223 0 R 3224 0 R 3225 0 R 3226 0 R 3227 0 R 3228 0 R 3229 0 R 3230 0 R 3231 0 R 3232 0 R 3233 0 R 3234 0 R 3235 0 R 3236 0 R 3237 0 R 3238 0 R 3239 0 R 3240 0 R 3241 0 R 3242 0 R 3243 0 R 3244 0 R 3245 0 R 3246 0 R 3247 0 R 3248 0 R 3249 0 R 3250 0 R 3251 0 R 3252 0 R 3253 0 R 3254 0 R 3255 0 R 3256 0 R 3257  [...]
+>> endobj
+3199 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [252.834 707.957 264.789 718.861]
+/A << /S /GoTo /D (page.60) >>
+>> endobj
+3205 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 686.104 140.809 694.951]
+/A << /S /GoTo /D (page.61) >>
+>> endobj
+3206 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [263.358 672.092 275.313 682.996]
+/A << /S /GoTo /D (page.64) >>
+>> endobj
+3207 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 650.239 140.809 659.085]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+3208 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.137 624.988 180.092 635.175]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+3209 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.692 612.316 287.647 623.22]
+/A << /S /GoTo /D (page.76) >>
+>> endobj
+3210 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.682 600.361 287.637 611.265]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+3211 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [243.025 588.405 254.98 599.309]
+/A << /S /GoTo /D (page.77) >>
+>> endobj
+3212 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.835 576.45 278.79 587.354]
+/A << /S /GoTo /D (page.97) >>
+>> endobj
+3213 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.881 564.495 287.837 575.399]
+/A << /S /GoTo /D (page.97) >>
+>> endobj
+3214 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [230.283 552.54 242.238 563.444]
+/A << /S /GoTo /D (page.98) >>
+>> endobj
+3215 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [275.672 540.585 287.627 551.489]
+/A << /S /GoTo /D (page.99) >>
+>> endobj
+3216 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.871 528.63 263.827 539.534]
+/A << /S /GoTo /D (page.99) >>
+>> endobj
+3217 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [171.474 504.719 183.429 515.623]
+/A << /S /GoTo /D (page.32) >>
+>> endobj
+3218 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [186.418 504.719 198.373 515.623]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3219 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [175.339 492.764 187.294 503.668]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3220 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.292 480.809 245.247 491.713]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3221 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [157.935 457.616 169.89 467.803]
+/A << /S /GoTo /D (page.34) >>
+>> endobj
+3222 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [168.146 432.988 180.102 443.892]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3223 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.337 421.75 153.292 431.937]
+/A << /S /GoTo /D (page.41) >>
+>> endobj
+3224 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 409.795 140.809 419.982]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3225 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.393 397.123 146.348 408.027]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3226 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [126.633 385.168 138.588 396.071]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3227 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [141.337 361.975 153.292 372.161]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3228 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [149.885 349.302 161.84 360.206]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3229 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [155.424 337.347 167.379 348.251]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3230 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [153.74 325.392 165.696 336.296]
+/A << /S /GoTo /D (page.43) >>
+>> endobj
+3231 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [161.501 301.481 173.457 312.385]
+/A << /S /GoTo /D (page.45) >>
+>> endobj
+3232 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.57 278.288 184.525 288.475]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3233 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.445 266.333 188.4 276.52]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3234 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.684 253.661 268.639 264.565]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3235 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.005 241.706 262.96 252.609]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3236 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.267 230.468 145.223 240.654]
+/A << /S /GoTo /D (page.57) >>
+>> endobj
+3237 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [225.899 217.795 237.854 228.699]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3238 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.358 205.84 182.313 216.744]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3239 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.386 194.602 177.341 204.789]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3240 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.368 182.647 182.323 192.834]
+/A << /S /GoTo /D (page.56) >>
+>> endobj
+3241 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [170.667 169.975 182.622 180.878]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3242 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [182.552 158.019 194.507 168.923]
+/A << /S /GoTo /D (page.59) >>
+>> endobj
+3243 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [204.27 146.064 216.226 156.968]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3244 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.792 134.826 146.747 145.013]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3245 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [172.57 110.916 184.525 121.103]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3246 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [176.445 98.961 188.4 109.147]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3247 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [256.684 86.288 268.639 97.192]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3248 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [133.267 75.05 145.223 85.237]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3249 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [381.868 708.674 393.823 718.861]
+/A << /S /GoTo /D (page.69) >>
+>> endobj
+3250 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [383.532 696.719 395.487 706.906]
+/A << /S /GoTo /D (page.68) >>
+>> endobj
+3251 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.273 684.764 363.228 694.951]
+/A << /S /GoTo /D (page.70) >>
+>> endobj
+3252 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [403.178 660.136 415.133 671.04]
+/A << /S /GoTo /D (page.72) >>
+>> endobj
+3253 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [373.559 636.943 385.514 647.13]
+/A << /S /GoTo /D (page.74) >>
+>> endobj
+3254 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [357.5 613.033 369.455 623.22]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3255 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.263 600.361 403.218 611.265]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3256 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.801 588.405 408.757 599.309]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3257 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.892 577.168 445.847 587.354]
+/A << /S /GoTo /D (page.63) >>
+>> endobj
+3258 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [424.467 564.495 436.423 575.399]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3259 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.887 553.257 388.842 563.444]
+/A << /S /GoTo /D (page.63) >>
+>> endobj
+3260 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [417.833 528.63 429.788 539.534]
+/A << /S /GoTo /D (page.64) >>
+>> endobj
+3261 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [351.422 516.674 363.378 527.578]
+/A << /S /GoTo /D (page.64) >>
+>> endobj
+3262 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.883 493.481 357.838 503.668]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+3263 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [395.676 468.854 407.632 479.758]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3264 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [399.552 456.899 411.507 467.803]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3265 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [389.051 445.661 401.006 455.847]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3266 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [392.926 433.706 404.882 443.892]
+/A << /S /GoTo /D (page.86) >>
+>> endobj
+3267 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [387.378 421.033 399.333 431.937]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3268 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [391.253 409.078 403.208 419.982]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3269 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [473.165 397.123 485.12 408.027]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3270 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.271 385.168 486.226 396.071]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3271 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [382.157 373.212 394.112 384.116]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3272 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [394.879 361.257 406.834 372.161]
+/A << /S /GoTo /D (page.89) >>
+>> endobj
+3273 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [376.329 349.302 388.284 360.206]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3274 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [438.874 337.347 450.829 348.251]
+/A << /S /GoTo /D (page.95) >>
+>> endobj
+3275 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.509 325.392 505.464 336.296]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+3276 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [474.132 313.437 486.087 324.34]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+3277 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [421.45 301.481 433.405 312.385]
+/A << /S /GoTo /D (page.89) >>
+>> endobj
+3278 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [434.172 289.526 446.127 300.43]
+/A << /S /GoTo /D (page.89) >>
+>> endobj
+3279 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [411.995 278.288 423.951 288.475]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3280 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [412.603 266.333 424.558 276.52]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3281 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.302 253.661 419.257 264.565]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3282 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [370.79 242.423 382.745 252.609]
+/A << /S /GoTo /D (page.82) >>
+>> endobj
+3283 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [363.597 230.468 375.552 240.654]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3284 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [400.408 217.795 412.363 228.699]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3285 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [432.617 205.84 444.573 216.744]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3286 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [423.92 193.885 435.875 204.789]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3287 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [433.056 181.93 445.011 192.834]
+/A << /S /GoTo /D (page.90) >>
+>> endobj
+3288 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [445.778 169.975 457.733 180.878]
+/A << /S /GoTo /D (page.90) >>
+>> endobj
+3289 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [460.722 169.975 472.677 180.878]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+3290 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [419.497 158.019 431.452 168.923]
+/A << /S /GoTo /D (page.95) >>
+>> endobj
+3291 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.684 146.781 381.639 156.968]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3292 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [406.764 134.109 418.719 145.013]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3293 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [396.264 122.154 408.219 133.058]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3294 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [487.431 110.199 499.386 121.103]
+/A << /S /GoTo /D (page.95) >>
+>> endobj
+3295 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [468.054 98.244 480.009 109.147]
+/A << /S /GoTo /D (page.96) >>
+>> endobj
+3296 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [425.026 86.288 436.981 97.192]
+/A << /S /GoTo /D (page.94) >>
+>> endobj
+3297 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [369.684 75.05 381.639 85.237]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3300 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [374.32 44.211 451.63 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3304 0 obj <<
+/D [3302 0 R /XYZ 89 770.89 null]
+>> endobj
+3301 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F11 395 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3357 0 obj <<
+/Length 1131      
+/Filter /FlateDecode
+>>
+stream
+x��Yے�6}�+��
+ɶ|��d7SLf7$CR���R	#��V6!��G��Ƌ��e��0�du�nu�,<�������'
:�f��8X�����e8y��ퟣ��G` "b�y� Fz�=x;|`Ջ .fh��
/X��G����`�� C��<~
�:�#���0�:�@|���
��+u��0 /c������l5�k��?�1� B�P+����ӍHWԍBO�y�v°K5�KM��6I%az
���Y*�0{����J:��&��NW�[qI����.D��D�Z��w�oOǷ�� ��rK׉��()����R�$�
�����O�pS�
V�NΤ��a4dqך��FKwT9M��o��u���u���s'J�c��h
..���t#<�
����}Ƹ�{c&F��߮�B2ꋹdr{��c<dR����rhz��g�|�'���e��&��y���Օ�ő
+|��[���C.Yu-�@-4
ZN����$��aMˮ�-�L&�ӚVo�#��_q
 �xe`���,]ZX���S^\��f��e7<����8���t�De��Tb8��l���t7�T
���J�)�Cf3���	ޏ�*��O��,I*\��-����~)�R����n$^*��w
�3�]���
�&
t7aG󿸛�����*�҃�87�ҩ�T�t81�{8q�r\��d��7t����\v��n����@0u
��ռ��u��K���
�
&�U�gU�
M�'��1��nG����

Y��\ee�n�e�0��횠io��c��/�������h��vrzk�Pj�Ư�2���<E
�ϚJ���`���-6S
ё��5��=�v���������w��E�VDT,i����� ��=<��sʫ�:�Ƨ�[�����d1M�Z�t������
,���!�:hz����
Ą���兌aA��V|��ϊȼ��FRE�����yb��f^��Dr�k���=��!äx~��5��DP�Ue
��N
�:
�j
��XW��9/�_��oP�~���
+4�A����h������|�%<�{<6�oY������P�N�EK��3ȏ,�����'C��*�
>
D�R��7��|��Xv�M
���]��T���9"
+endstream
+endobj
+3356 0 obj <<
+/Type /Page
+/Contents 3357 0 R
+/Resources 3355 0 R
+/MediaBox [0 0 595.276 841.89]
+/Parent 3359 0 R
+/Annots [ 3298 0 R 3299 0 R 3305 0 R 3306 0 R 3307 0 R 3308 0 R 3309 0 R 3310 0 R 3311 0 R 3312 0 R 3313 0 R 3314 0 R 3315 0 R 3316 0 R 3317 0 R 3318 0 R 3319 0 R 3320 0 R 3321 0 R 3322 0 R 3323 0 R 3324 0 R 3325 0 R 3326 0 R 3327 0 R 3328 0 R 3329 0 R 3330 0 R 3331 0 R 3332 0 R 3333 0 R 3334 0 R 3335 0 R 3336 0 R 3337 0 R 3338 0 R 3339 0 R 3340 0 R 3341 0 R 3342 0 R 3343 0 R 3344 0 R 3345 0 R 3346 0 R 3347 0 R 3348 0 R 3349 0 R 3350 0 R 3351 0 R 3352 0 R 3353 0 R 3354 0 R ]
+>> endobj
+3298 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [151.549 708.674 163.504 718.861]
+/A << /S /GoTo /D (page.83) >>
+>> endobj
+3299 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [166.492 708.674 178.448 718.861]
+/A << /S /GoTo /D (page.84) >>
+>> endobj
+3305 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [210.189 695.952 222.144 706.856]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3306 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [214.064 683.948 226.019 694.851]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3307 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [203.563 672.66 215.518 682.847]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3308 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [207.438 660.655 219.394 670.842]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3309 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [167.04 648.651 178.996 658.837]
+/A << /S /GoTo /D (page.84) >>
+>> endobj
+3310 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [181.984 648.651 193.939 658.837]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3311 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [251.404 635.928 263.359 646.832]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3312 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [220.968 623.924 232.923 634.828]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3313 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.745 611.919 249.7 622.823]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3314 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [179.772 599.914 191.727 610.818]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3315 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [134.284 587.909 146.239 598.813]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3316 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [191.389 575.905 203.344 586.809]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3317 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [233.999 563.9 245.954 574.804]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+3318 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [237.874 551.895 249.829 562.799]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+3319 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [196.371 539.89 208.326 550.794]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3320 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [180.878 527.885 192.834 538.789]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3321 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [165.386 503.876 177.342 514.78]
+/A << /S /GoTo /D (page.98) >>
+>> endobj
+3322 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [147.105 492.588 159.061 502.775]
+/A << /S /GoTo /D (page.98) >>
+>> endobj
+3323 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.539 467.862 272.494 478.766]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3324 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [260.539 433.063 272.494 443.967]
+/A << /S /GoTo /D (page.40) >>
+>> endobj
+3325 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 409.053 278.601 419.957]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3326 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 385.044 278.601 395.947]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3327 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 361.034 278.601 371.938]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3328 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 337.024 278.601 347.928]
+/A << /S /GoTo /D (page.87) >>
+>> endobj
+3329 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 313.015 278.601 323.919]
+/A << /S /GoTo /D (page.84) >>
+>> endobj
+3330 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [281.59 313.015 293.545 323.919]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3331 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 289.005 278.601 299.909]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3332 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [266.646 264.996 278.601 275.9]
+/A << /S /GoTo /D (page.93) >>
+>> endobj
+3333 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 231.088 140.809 239.935]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3334 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 184.334 140.809 193.181]
+/A << /S /GoTo /D (page.63) >>
+>> endobj
+3335 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 148.37 140.809 157.216]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3336 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [277.166 122.303 289.122 133.207]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3337 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [128.854 88.395 140.809 97.242]
+/A << /S /GoTo /D (page.62) >>
+>> endobj
+3338 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [345.336 698.059 357.291 706.906]
+/A << /S /GoTo /D (page.63) >>
+>> endobj
+3339 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [470.385 672.092 482.34 682.996]
+/A << /S /GoTo /D (page.98) >>
+>> endobj
+3340 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 648.181 495.083 659.085]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3341 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [407.881 612.316 419.836 623.22]
+/A << /S /GoTo /D (page.75) >>
+>> endobj
+3342 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [493.648 588.405 505.603 599.309]
+/A << /S /GoTo /D (page.58) >>
+>> endobj
+3343 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [490.33 576.45 502.285 587.354]
+/A << /S /GoTo /D (page.70) >>
+>> endobj
+3344 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 552.54 495.083 563.444]
+/A << /S /GoTo /D (page.85) >>
+>> endobj
+3345 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 528.63 495.083 539.534]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3346 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 494.757 495.083 505.661]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3347 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 460.884 495.083 471.788]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+3348 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 436.973 495.083 447.877]
+/A << /S /GoTo /D (page.91) >>
+>> endobj
+3349 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 413.063 495.083 423.967]
+/A << /S /GoTo /D (page.88) >>
+>> endobj
+3350 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [494.754 389.153 506.709 400.057]
+/A << /S /GoTo /D (page.33) >>
+>> endobj
+3351 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [470.385 355.28 482.34 366.184]
+/A << /S /GoTo /D (page.98) >>
+>> endobj
+3352 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [483.127 321.407 495.083 332.311]
+/A << /S /GoTo /D (page.92) >>
+>> endobj
+3353 0 obj <<
+/Type /Annot
+/Subtype /Link
+/Border[0 0 0]/H/I/C[1 0 0]
+/Rect [447.701 297.496 459.656 308.4]
+/A << /S /GoTo /D (page.45) >>
+>> endobj
+3354 0 obj <<
+/Type /Annot
+/Border[0 0 0]/H/I/C[0 1 1]
+/Rect [291.118 44.211 368.428 54.174]
+/Subtype/Link/A<</Type/Action/S/URI/URI(http://bugseng.com)>>
+>> endobj
+3358 0 obj <<
+/D [3356 0 R /XYZ 89 770.89 null]
+>> endobj
+3355 0 obj <<
+/Font << /F70 332 0 R /F60 312 0 R /F72 334 0 R >>
+/XObject << /Im3 327 0 R >>
+/ProcSet [ /PDF /Text ]
+>> endobj
+3360 0 obj
+[777.8]
+endobj
+3361 0 obj
+[513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 799.4 513.9 799.4 513.9 543.7 770.7 777.7 733.6 847.5 756.3 656.2 804.8 850.1 449.3 566.3 870.4 699.4 992.9 821.6 782.1 656.2 810.6 777.6 627.8 599.6 699.1 599.4 970.5 849 596.5 699.2 399.7 399.7 399.7 1027.8 1027.8 424.4 544.5 440.4 444.9 532.5 477.8 498.8 490.1 592.2 351.7 420.1 535.1 306.7 905.5 620 497.5 515.9 459.2 463.7 478.8 371.1 591.4 499.2 736.6 582.6]
+endobj
+3362 0 obj
+[799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 513.9 513.9 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 799.4 1027.8 1027.8 799.4 799.4 1027.8 1027.8 513.9 513.9 1027.8 1027.8 1027.8 799.4 1027.8 1027.8 628.1 628.1 1027.8 1027.8 1027.8 799.4 279.3 1027.8 685.2]
+endobj
+3363 0 obj
+[611.1 675.9 546.3 675.9 546.3 384.3 611.1 675.9 351.8 384.3 643.5 351.8 1000 675.9 611.1 675.9 643.5 481.5 488 481.5 675.9 643.5 870.4 643.5]
+endobj
+3364 0 obj
+[642.5 589 600.7 607.7 725.7 445.6 511.6 660.9 401.6 1093.7 769.7 612.5 642.5 570.7 579.9 584.5 476.8 737.3]
+endobj
+3365 0 obj
+[569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 569.5 323.4 323.4 323.4 877 538.7 538.7 877 843.3 798.6 815.5 860.1 767.9 737.1 883.9 843.3 412.7 583.3 874 706.4 1027.8 843.3 877 767.9 877 829.4 631 815.5 843.3 843.3 1150.8 843.3 843.3 692.5 323.4 569.5 323.4 569.5 323.4 323.4 569.5 631 507.9 631 507.9 354.2 569.5 631 323.4 354.2 600.2 323.4 938.5 631 569.5 631 600.2 446.4 452.6 446.4 631 600.2 815.5 600.2]
+endobj
+3366 0 obj
+[892.9 339.3 892.9 585.3 892.9 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 585.3 585.3 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 892.9 1138.9 1138.9 892.9 892.9 1138.9 1138.9 585.3 585.3 1138.9 1138.9 1138.9 892.9 1138.9 1138.9 708.3 708.3 1138.9 1138.9 1138.9 892.9 329.4]
+endobj
+3367 0 obj
+[594.7 542 557.1 557.3 668.8 404.2 472.7 607.3 361.3 1013.7 706.2 563.9 588.9 523.6 530.4 539.2 431.6 675.4]
+endobj
+3368 0 obj
+[1055.6]
+endobj
+3369 0 obj
+[399.7 399.7 513.9 799.4 285.5 342.6 285.5 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 513.9 285.5 285.5 285.5 799.4 485.3 485.3 799.4 770.7 727.9 742.3 785 699.4 670.8 806.5 770.7 371 528.1 799.2 642.3 942 770.7 799.4 699.4 799.4 756.5 571 742.3 770.7 770.7 1056.2 770.7 770.7 628.1 285.5 513.9 285.5 513.9 285.5 285.5 513.9 571 456.8 571 457.2 314 513.9 571 285.5 314 542.4 285.5 856.5 571 513.9 571 542.4 402 405.4 399.7 571 542.4]
+endobj
+3370 0 obj
+[525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525]
+endobj
+3372 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456]
+endobj
+3373 0 obj
+[500 500 444 500 444 333 500 556 278 278 500 278 778 556 500 500 500 389 389 278 556 444 667 500 444]
+endobj
+3374 0 obj
+[761.6 489.6 761.6]
+endobj
+3375 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+3376 0 obj
+[388.9 388.9 500 777.8 277.8 333.3 277.8 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 277.8 500 277.8 277.8 500 555.6 444.4 555.6 444.4 305.6 500 555.6 277.8 305.6 527.8 277.8 833.3 555.6 500 555.6 527.8 391.7 394.4 388.9 555.6 527.8]
+endobj
+3377 0 obj
+[500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389]
+endobj
+3378 0 obj
+[501 501 137 273 501 228 273 273 0 273 479 0 501 410 273 228 0 0 0 0 0 0 0 0 0 0 0 0 273 195 228 273 389 456 456 729 592 228 273 273 319 479 228 273 228 228 456 456 456 456 456 456 456 456 456 456 273 273 479 479 479 501 800 592 592 592 592 547 501 638 592 228 456 592 501 683 592 638 547 638 592 547 501 592 547 774 547 547 501 273 228 273 479 456 228 456 501 456 501 456 273 501 501 228 228 456 228 729 501 501 501 501 319 456 273 501 456 638 456 456 410]
+endobj
+3379 0 obj
+[500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.3 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520.5 465.6 489.6 477 576.2 344.5 411.8 520.6 298.4 878 600.2 484.7 503.1 446.4 451.2 468.8 361.1 572.5 484.7 715.9 571.5]
+endobj
+3380 0 obj
+[600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600 600]
+endobj
+3381 0 obj
+[556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444 394 220 394 520 0 0 0 333 500 500 [...]
+endobj
+3382 0 obj
+[556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1 [...]
+endobj
+3383 0 obj
+[638.9 963 638.9 963 963 963 963 963 963 963 1222.2 638.9 638.9 963 963 963 963 963 963 963 963 963 963 963 963 1222.2 1222.2 963 963 1222.2 1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 1222.2 1222.2 963 365.7 1222.2 833.3 833.3 1092.6 1092.6 0 0 703.7 703.7 833.3 638.9 898.1 898.1 963 963 768.5 989.9 813.3 678.4 961.2 671.3 879.9 746.7 1059.3 709.3 846.3 938.8 854.5 1427.2 1005.7 973 878.4 1008.3 1061.4 762 711.3 774.4 785.2 1222.7 883.7 823.9 884 833.3 8 [...]
+endobj
+3384 0 obj
+[472.2 472.2 472.2 649.3]
+endobj
+3385 0 obj
+[777.8 277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 1000 777.8 777.8 1000 1000 500 500 1000 1000 1000 777.8 1000 1000 611.1 611.1 1000 1000 1000 777.8 275 1000 666.7 666.7 888.9 888.9 0]
+endobj
+3386 0 obj
+[222 333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500]
+endobj
+3387 0 obj <<
+/Length1 1406
+/Length2 5931
+/Length3 0
+/Length 6889      
+/Filter /FlateDecode
+>>
+stream
+xڍuT��6U:ҋ
+��{/"��!%�j轋HQ���t邂���T)�)����s�>��ֽ+k%�;���������XP�i�@"Ђ !�
@UW� ��B@�)�	
���N�eCy����@��`4֦Ac��H�� $
+ IȀ$e�@�(�7���A|� ]!�=$�Eʥ���G�����:?x�� ������p��;
�B ]�掭����P8
���<r�h����������K�rR� ���� #�
�s ��
Ѓ���P"��8ý�r#
Ѿ
�5���0�6�� C���Z: }�/��_ ��� @B����+
�;�"�= 8�	�w��5t��~h ��
q�Bb�!>��

�}u@C� �2���
��{�����n�8
+�J�m�:�A��C��H�O
��A�}��3\W�����G88�����!l��{zô��`�&�ۜ`h�8PZDRB �����¿
+��{�~;A��XA��Kw�aH1^ ��a����)p�C� {�
A���X3��3v�(���]? ���'0v�
�7���XXG�\E͜��9UT�~ ���@PDZ ���$%E A�L��M��� �s��H��pD��b�m��L|������YA�]h����oB�_���
+~�����W��u���F�nn��<�?�
����]ho4V
�H�D�
5���h]������ZhV$�'�5���9��P����9`ӻ�0���; �ˇ�
��^��N�
�U�?K�#�H�_�� @P(�?)v�ؓ8 �����{��B$��
8"Q��f*{y���~�a~�_n���z�PX�^l��Ͽ������3SH�l�K]d�I��M_���\��y13�vD����
�c���n��eu�#�Ol������G��g����V[I�G��m)�����4QZ
��
4
s�o��Ǖ��-EiPH{�۫�W�W��]�Ԫ�Z��6�yٸ`�i�MX�W�}�$�5� 
1͞�����4y���=�'
�N-�X-�$�N�U��x�f��l�ĂD�n�Fe=�
�GLi���	�dG�+ME�c�0��w6�8�>� �}�Z�JeP%}[	L�xg�$�Ӕ
{��7o��Q����6�-��;6�&N�
+
+�A@�5uq���r�pQ�⨧���}9
2w��
+�*+$�`�dE#�>g�<4_b�$��hQj�
�Z��=w
{P��O������i/Eb�L�ӝ��
+��]:~�Js��Ņ�z�
���I�
?�g\`T�R�".�Ur
u�&Qz�b��j���{b�[Rӧ�4
��“��//9��+��n�>���20sIjܺ�����!w�g�z�ĕ �nr�O
D���;��o��
��|�g�,��o�������,I)�G��S@��
���
�C3_pkя���)�V��;o���Z9}��	��Et��X}��u�īcP]%��ʾ�v�	��0�����VD����ݺ�z�(�T{��a���`���S��u�R�c�`[X���foW�<�-鷤� ���5�!6eJ�kS�o�~܍zQ�;��6����挐p��˰�h����%�� �k�ץ�e�~���l�����K��NP^�筚/����>*�8f�
jO���!3�%��d�~2��y��!f�H�QB%�sɎ����/�)b�3����
˾�7�H�M�����{Q�}SQ�}XA�ə�c�\���Da��m�\���^t-��'�ؤ����ѼA��oc�Du`��t��/p.kQ:�5���j
ô�c��	Xrg�#�+_�b��l���>Ib����-��~���\����!=N��*n\�Y����(�*|���-v����m���z�̸�Ņ߫�ۆ
Z+>
9
�
+�
� ����O}�[t�\]���l�����x��-�R뎭Λo�60��d(*�)��N��վ���
+�J�S��
�S���J�]'����-��tE�dQT
��sN_���{�ӏ`
+7�O���R>���T<g��Y
+�6z;U���
�&.Dn�G	��OnՔ;�Տ���A�j�3�vs3g��w�.1��"!�g�ֹ��P,����]�l#�>�[&ި�d�c|������k�XfP?��h#�rOW{.%����v�W2gҩ�o�;?
�*U��P8L��_�w�Q��p�4�@
7�]!��D����i�.*�75�ە��b)*|8��;�=łe%�����Q�x�?Z�|M/
�߷�Y�9-?޻ύI<7�5{�\�"�Z�YLΒ&UE�`��J$�?�%H��&Ygԩ�����rU�R�P��H��E�E��kK<I;���1�أu��a�"y>h�3��
�w`����@r�6{�x
��&��ܐ:�����Ֆ�SCI���k�
� 6�i�UY)2�O
OdB�W��|����+�stUe!��˫ʘ�cN�����2���<�ԋ�$�����7�4)�Y�~Q{��fUl<k�^��"Ӈ�\��̘I���x8��
2�U� ��˞o9׭)S^Q��%��ڪP����P�
�
վ۹�9Z`�����e܅"�|;Vӌ1��kx{<��f�dd'����ד�`�=��N��\�"r�@�_�*lIa�2�=
�E6���͚��񨎸�.G�r
jݮ�mʂp
��`�`����Ch)��]��:�l�Q|�5��d|7*&Y.���f
+��ħ>�
$᯸>��&PN����ÄD��jI'1����ɮ)hm�կ=�_ujb�.P5��O�<F:�81ƻ1y� E��3XL��
+?��@��d	��-�9�+-e=��RiuQ�B��R�(���?2�9#��&��́C+{s��9�<�.�
�ǜ��ZE� �
�TD�
�TK��}���\梛Q���k���5c•��CQ6�ed����G��)�����b�b�v�~j�{��H�)�gV�n��LLft�S����ܣ,U��tnp��ٙ�X,�!ˮ�r�|Q��[]�	H�8��Š��s{�9w�
_s<S간t�U|
x���-6"�ڎu�"
C�g_c��wz%��?���:%�"����S+��Gݥ��"!\ n�
���8��� �/8����A9+�#d��~@ű�ƞa�bp�Pwa
�x�Ql�
�
+\�O�k/x���
c;~�~&�%wk�~�&��(��@�ϺO���
+r;��d�lɯ�Q�n�[�
m-�@f�
�К��zŻIz�/1�;k��7���2g9��
����1�߾B�.�5�����������t�D��.�3Ra�����=�Z��x���>1q|��SM� ������өSn�w�Cv���<���Y&]��r��"��f=n�N
��
+�d���Db�QJ
i�i���C�ZvX�nn�ǝ�j
���4�6�+�)���8��f�SH� +�`� ��'&
-��z�$��eɓdf
OR�F�WH����$�\aT�i�H��N�d�5.'��	r�՚ώ�ٷ���81K�
I1�%*қ��Ț�v��d��m����3QN,���k�����O:�\H�:�������y�
iw���p�q�
š3Z�{
;k����r

z|*u�u�U�	����8J'
]Y{�Lb\x/�h<U��h�1e��R��&�� �[����4���7k�}���ӷ\q
:�O}_����}i���H��_�r:<�s�����b�d������͌o��m���o0&}j`ɖ���=��ṃ�J�q�es4��]��|��0
ڂ�6�
V`���=�͕�P7[����_��j�q�<�8񡶫��f��<�R��/;y
+ax	`77����;*;v�]tЕf}�q��ՠ��q+/{1�~A4�|C�ŏ�:���X	d��Bx�@
uj���?ԗ�q Ce��
�
+�����ݏ�)}4
$����t
���o]__yN/T�2���j*�$7��ʸ�Ye���j˦O���<J�9<�}�Y�Y~$��}�>߲�x�x�Kw@�,ё9�b�&)�ζ����Hʀ�fc���q6oحi.�|jƃ,�Hc��	f�$Š�D��\�A��{���+�N��)� [<�Ӻ磰:f��

a���,�,
w%o(v��g��g������7���hXJ
kR�\���ꣀS�ԁK�j�R��0����p��c)
���u��Hd
+�}�L��տ[S^*�!8
ᤒq�]%m�$+~-�x�������F>,��
E�F��)�q��� P�s��9�#�W
�k'��9l���T㫇vV��Fv�&�N��w�Ėr>r����(��f�\s�_��3/�SQ�.5K�"[��\�K���4zMl<dgc��#�+�
�>�ܽo���6��G�4�����>���r���S���]FLt
�c9z���-�
v7,�ud�����
���4�Y�U��q��'x1��jz=}�� ��5}��G*Z�O�O�qe���A�ж
��9�Qoj�|
D��3���ʒ�i��F7��h�p%�f顭����Jk�ʛ[y��F�����%��g4����f��÷�
VT���
�0��Uژ+�����&�'��;�lc��]�'��q[#����V�d�W.'M���BJR:Dd5P��2*���a[�,��Q�<nd
�-�CZ��c���/���M�F�_��țʏ�y��j?_H���-�qF0�5�&'� h�N�^ұomۿ
+���\r}����%�����'�cl_��4=6�Σ�l�If2���ar����S�� *J��¨s���x��w�x���_���:�S5���\N�o�Ď�-��^zAj��
���[�G0ԓ��T�d|�����<����˯�(��>�M��Ln��H6()�%���(�D���?�E4G�A��;�	�23l�~f��O�3<�x~���>�NIH\t��'&��9~�����˴���̛�S�VG����pW��C���w-����L�0��R�����Z3��
W,i]?�������Q�Ǩ��� �
砅W�e.}aʠZ�Cy�����󊪪�B�����X�������v�"f��@L�
f7�r�͙�G���@4gʪBW�Plؗ~'�ƕG�D��	)�խ̦�-���ya��4,R7oUS�
���2���2F��W�ʜݞ
�@�mT����f
��W��wfۀ�K}��{u\�uE��UE�����x��a
�� ��)�CD�O)_"��{��
�5\�����Q=�]��?�,����1�x�]��{
��=~��0L�[ycB�
�
�*�`%��NG�����e����^
ܯ���'2U��,�[}hߊ��Q�>�y$D3`�����6�����
��r��
��.S{�v�l�Tu�s�lr��;��6H�Җd3BC �J�5,�6������G>Q������̌�=_k��Pj�)�p�_ab1N>)�d�N�M]�?
Y}:�1&d`Wg

�9��M������	�a	nOF�CvXN�X�ث,33��8�^Dh,�
?i�
Y�|j�ĕ�X��
r���4�����<OH1,��U|Y�m��8��Y��������*p��%��u�cfz�m�G`�ꦼ�~� �7��
���$�-��O��Xc$
����uN���>�&'"��E
+�G�xF̭{��К��4�F���<��ꩤ�.�2Q+���d����J�٪p�B��
+��~�E9�&m6|{xV�֪�]�!�CM�'�|B�tv
+"`W���K�8Z��f����v-��^~s��OȈ�w�
5
*'{y7�7g���H|�d�i�<��O:L���˻���X��/�/��5�o�-w�
\�
�f��%�Jz��@O��}2F�����yLO7�nμ�H0U��nI���Y��S����+���z����mA���]�=�	>A#�������/%�hF6�I�$���嫗%I���3��j��Ož�Ã��w�� �e��2���rbZ�S���16�
=b��D6W5Pzr����W��d���!���x$��6�
"Ou�=�[����g7�*~���C(u��
q��B
F�FL������X�\
5�&�L��|�����$�!!/�
����
�z%���ev��\2�x�"e�v�^
f����i����h�@��������^[
-N�ZZ��S���/�fL��c�`����
^�?�v%�%�͋>�\-k�8�g�O��K���\�~�\d�)�i6��ޥ������!�����̂��+�77W�x*�8
Tf: �H}4W���=$=L�c8ǔ�B2�����#"(����W�X��Ջ�WE!����\lf������ŏq��$֒+��D1��^�V��6�ͮ^�_��(�n.I3x���g�����
�a���O Ns�Q��,e��N���G�rtv�њ����9�B9�8�Z��G%^�j�̼������U1������.R
���Ef���d�
�Ԝ��L�������-j/ʰT*Oj
+��c��Uv%neN�ȱ�'�4-/ȧ�.F0CsF�W�,*�4�_�?2#(i���q�QMP(b@��3p�:_�Χ�}7�f+_=�����z�B���*�d�eɹ��KyP�IwY
L�3�)sq�W�SP-�������G�'+��嗭��q������`����@d/u/�>��d_�Y@���4j�

+��zP8㨵�Av����:ZG'ɭ���}���el���>�+V#�N��3�	1�;���7/+��o������I�0�s�k9p�ʊK�m�]�c�pZViqL9CI��qG~��&o��<��F�$����<��+�Ϻ2'���K���]}$!��]M5�����55�����-���;�O�7�Au>���MP}
+endstream
+endobj
+3388 0 obj <<
+/Type /FontDescriptor
+/FontName /LBWBDW+CMEX10
+/Flags 4
+/FontBBox [-24 -2960 1454 772]
+/Ascent 40
+/CapHeight 0
+/Descent -600
+/ItalicAngle 0
+/StemV 47
+/XHeight 431
+/CharSet (/summationtext)
+/FontFile 3387 0 R
+>> endobj
+3389 0 obj <<
+/Length1 1637
+/Length2 8547
+/Length3 0
+/Length 9615      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T��.L�"�)EK��ww�8- @�ܽX�K��R�)Z�@�x�S
��_���}���u��Z�73�̼3�̻�0�hj�KYB���PG;P ���� �<
@ 7�a�[�Šv�C����B�8�A��,� T�:�]�\< .~a.a �

+�
�:
dA�K�@��c1�@a
�k�C��L� .!!�?�R`g���B؀

2Z���P
��_!�Dm�0'�����u�gf�A6 -0
��
+��.�r �U@��Ӡ
�B������=��pqq�;
���T0��`�?l�������O����8��
���:�@�
Gk��

АW�@�#�  G��@�=
��rA�A��?��K��
*��>��3��s�!��k��
��r��2P�#���|�g��C�=8���#����o�
+�hi��
K��#���$��A����� �x� `' ��†�w
�#�o�C
>^0(
`�P�b~���\� ��
���߆����� �
�
l
q��'��l���0g�;�5�~\ �����f	u����Lj9�䵤��Y�*�?Fii�;�������py>�
�?
���?�� �_��WD%G+(�w��U<���J\���_{�
����B�L�����x���ނ?\����;�����{"y{�?�L�?v����/��]ˡ}X������h5�%����J�ÒH9Z?�������
����-5!
�?���4
r�C
��P8��������a�,�
.����4�����c��e��9�
-���w��� rvy`=P�A�xq=,�%���89
���C�> +�3��A
	 8A�UJ� N��H�� N�߷�C���q
��� ������]����@*N��� ���p�����aK@�{j�B�c����'�������/�!��?"�Cv�?��j�����CW�`�CG������`w�֏)��H�mup�E���ڰ(�~ʅ7�p�	�Gn�t9N;#} [...]
u��;���5�y���٣�x�sJ�)�F��I�υ
�{�4�"�;0%,�{��_Tw}�wc$.�PiQo�,JW%����S
�dޯ��wB�"�û��(��d���*�m�Xqn�K}�s�T��ʮ�k�9�~JY��zs9�7Y��;�	���$w,{J��.�ՏlV�v�i�:l����~y^R�戥S��s�#,g3èQ�����z]���
e?���BT<f&�F�n\T��^��3��ʼn�}\��S���j����2�`U��$�y��*(���>c�)dB���`�M��x��Pp���+$�\��n��q�ᙗ'�]�q[�4�SE�c4a��R͜���W�\�_j-R��d<�
�ϼ+ܗ�U�
��>e�-|�K�o��� �������hR��pڲٕ�7��?"�X"�g�^��|텶 �`�D]�x�� ��c�j=�J4��荵[����`#��`�?oN��W�u��j��O5��{���4�
+,�@\�F�V5$�l|؉f�����ڊ{�"�tҔ�<^E1����H, �C�x#}�ǚ��8]
��u�)���=���4�^��Uo����#}Z�]2������K��-�+y�F,spB
þ%�Q�[����qE�SY���ٌ�
�Dܖ��*.�W�A�E���\�mM��% o�6��Bs?�N7à}�׌@ۄ�j$�
k,�2톐
F4?B�
�ضՔ	 t=e��Ca�멷u��u��Ne
���aA��N�Mԇp4
1��KM��~��y��.��$�<����`{0��T}e��p�w��k�ut�`��/��j�4]�:�4
��]|�jZ���5����Y��{��_N�k��U�m���y{�UO��8X�IVZ�"���\�e=M���%oN�N>�>a��+Wb:
�w,sS"��#ODUz����
_t�9���qE+]5
��3�H��M�NJ�ٶj�=�U�y;No�h��`z�@o��*���
�����:�G>w��3����-����1;��d�����N�P�z����2�pձ
�7

XB+KW�{u��D3��:����{Zn�Ǘ��ž�����8�0Û7�(;II<�wq}����39Aʹ�GN��%�+������PATm�q�D�g����Zn�D
���f|��'�t3�C���'�9�?V�8@׀�
}>�f�Ynxِ�GF<6q�-8��<���F�A,
GM�$��$0`O <"���=MRT����}'�OPFi�T,��M��N�o���@G��X(��
^y������ӧ�S�
+���3�^r��&�h��5T�⺸��S"�D�g2uV��G�X��͗��r[@@�g���b�T_�S?�z�Vؘ�t*����6:�n�FTG������R�
����Q�/T�2���RK�
6�z���_���3ի$��xv�����w0
xd'
����~O�-n�`[�ate/��+a+����<;}m�91
S����K-s�HM�m^cw�
��:�o�8:�e��b�ܽ�K���X�˒�jL��
���ʗ8���20�ͯ�"]2HB�-F��L�X97!�1�ä��H�)-ͦ'�!�	Ƭ40��!�e�\��c��8��+�N�|+�����Pž�j������A��!�ː-��܄]�5�AO�jL[�Ň�X��ʳ��Z����"e��؝GZ7X����
"�:�

�
�6�T���Sx6̫�3&�'(L�rIօrp
+!��*=�
��L�/h���Ω��b?m��M��U��S���Y��p5k�h_qcX�u�Vo[���[�ݚ�b�Q���L�9So3P����%:+u?�
($�5��ܐUJ�?a���k+21d5B�qf����r�x���z
&�v#�W4Qd�3w����)�_���Q��;���!5W���#�Ez.��-G�N����

�p�4[��)���Dl]��3u��um��I��$Όx".A�����'k�<,Ӷt�]�ۂ���G��G�4
��C�w�[3��"�~X�/����뛓�
�����8h9m��*�&���GbK*���̔�*w��
��i��R�
M��D���DϢ�=S�꣦ħlj�}�½_��
d��c,$�1:�B1�rM�����3IS�Qx��[�uR\�"�sZ
#ϼ����c�σ�l�м2����t��To��<�U�=�ǎW��g���l�-�B���=��t�L)�����n����1�u;�9:�>Q��/I;�� 2dGl��lU�Us{fL
��#�a�j�#�����>��_�@�jFR�!�2e�x�z<a
+Ɨ��F���Z���*�,����sW���.�Q�wۣ^@�M
���n���-˔8�]=3�>
��.-���t�h��y�ἀQ���X�u1;��ۆ_���AE��Ik�������K�U�9#b6��INS
ӌ�
+�c�\.�@c�Y V�I����x�*ެ�B����[v��OM��Iv��'ןT��;D�K.��I�X��x�<�A��F��t��}�R�
�
<(?�F7����t���q���j٦.B���K�>W�[l9K~�H&�P����-��m���@��
?~����D���j��0'6�3�W5����t
X��)���K�/��Ċl�iF��Pl��;z�ܺ!���Hy�r�Df���U7�g� �i؜aⓃe��(��x��y*'����� �ܽ�$��
+���[��
^��a����o�
+If�d0RX��R6R�x�x�0
�
+�j��J���
���-��}D,j�A���
�v4�2���B[���|�|UG%7v?~�T�6)����lW���4�����<�pW��
���!�8}�*r϶bE�Xg��=h?�\k��
+n�P�������Ž
Zź�6�����)�
f��&S�t��zk@�����;����j4[�9����k-0��5n����L���DyE�դ��S��&}�3X�ı
zN�p�T65>�c�U�i<L|⳹����I��*���o
b�'E&�|rQd��w���
�A;�ػV�d�Bg8vH�34��wv�-MC
+r6��O�B �DK�f�+�B�4)P#I�x�N����g{�
r��s]�Pv�Q�x�'
���|�
�7��	m⥿Tܝx�򗾘"
+��Ҷb�y��O3������JV4'p�s�,9��
g1Q)�o�h��L�T����㠟��~X��,5�	7����dF���7J���[8��3W�ߴ�i��}.M�ߋ\�1R03tz.�����i��D�����}����ʱ
m�k{d��
R�DJ��ܠ�x�:G\�͸�BD��<��Z¾��ڂ�p�I3�����;�͎�z�����/�\441~���s�k}k4�6�M��k/�ʯ|A�p�p˗���C���+������;|4%q���Ĉ�3�!4I������t�"O�>
���Q��L�+Ŭerbk�%.7w�=�D�Ƿ8�>��U���D�`w
o��
(X�mJ��B!�w)-&D���o��>���?�����&��Qds�L������\�(��<���� ɵZ�����+qz;�XQ�P�?۰�S��a�8e�>�vrػ������Ru&�uz����ڑ��]�z���z���R��{����X_P�|�8cg�N\�N�R��n� [...]
ﳾ���vy�6,bN��p:��PW�Ku�o����^��d��<���7�e5e�yU����%���
��i�����N�$��������O�P)Љ}��\u%dE�������n��?
�}����𭏠3

������ٲG$�{A^N5*�ʆv�,13~�^4d�XѰ���sH�&���ebzV�#��,�7��E�p�Pf��<���a�����v��_%W0�
+R"Aj�o>'=#��{_���W�|����&8ZL
x�=2�ݦ�y����|"3I#
9W̽:��-r�{��z��}<�-krŘ��Z����#�e<61wӨ�R]�O�:?�k`��JϬJ�Ho�ɢ}�F��|���C6�G�c�S�8�H�}��3���^Y���[�9�3t`�<�R���
���$?�9��C�;���g�����؉ǧ�C$,���#�/EOH�\��MA:�jf�&��-
�WI�o��,��akN
Zc�}ϗݱ�N��]ߠ�(��T6�yZ�N�T��3C�
��>��OZѷ�,~t�<,�Y����%��#g|���a�P���Q��#:�P&/��r�� �S��J.�y+��,6
3W���^�9L���Bm���X�M���
+�k��
X�K!�2��:�S��+-T�Q�OjuP	��<}�	���)T��C&��X_u
fIGU-F�o�5b�0��
+����Х�-���'~�~ZO]���h�|�PЙM��d}o��B"捈�`��� ��+k��E��ݐ>�q�%��f�~'Ot��^�5[sI��	�
�ϟ+�����/�=��E
�
��0��O��CX;�>�2�m&�)P�	��>��P�<CT7,�U"t�5�B)�x94�����7�^4�e
�TQ 6���LAO<
��!�}��-�G��*5-�7S:�n�p�0��m6���3�G������-���뒼:UK��0d��i8��<�F{��‚rI^X�n,b�J,0�Nh�3�^�@��S6�#�qV��|�S05�J��
���r�.{ۥ1���9I�K������vfR�N�t6�Q�-�G�Z�L��,�W�cE�����شl�7{+q�t����=�
+d6;,N~���~����9o<ib�Ia�Bp ��b�
����W-y�"��.���!땷۰��EdG�;�6�^.<ˏyM��*�;��U�<�0k�;��$_���ߢ��Y����{Z߫Դ��v���I}7��#l/��b
Ҵ~�ga�iLj�8��A�k^��3�F�=]��pR$R3�cb�J��{�m��j��gKB�+�)�>���;ӯf^v��`

%�+U&|�\��m����P�>�E��n�4k��8��}Z2�n�N���
5�C��� �~﨑/��Sz�.h�l~�u�"ƝG��v�&��J ^��Lbq��Ԏ
�57�����ykq�E4
I�$�E�j��m��ze�撌�7SNǗ��
J�㪼eU�����9�w�w���Dz�-5��~�:�<�u��72[�H�bOdk��}%[%J&�C�
���kGN�J
*�2V�|'�c�5��uz��X�6o0b�ə��>�|�d�،\
*/���g���w�(B�嫲H��K����-W�-�k��tI$����E'}�n�x�*S�&�Z6
Q(�[���FE��5��-�e�X7�1���gEM�S�2	 ��畜"�vH^���BG,����
��BV����݊S��
oAB�Of;����	�;�w�F�݀�`�Okj�
?w+���8�*'�o����
ܘ}Z��\��<�3c,uA��iB+��@�oq����	(0'vm�6V9
+��P�7n��ZN<�|Z�ߋ;���{>� ���H#��&�|��Ev(������*�X簜�{m���Y���
�A�{j���!��}�!���X1� ʪT��
NF�BX����O����c���4�$������t�
+I�FŭN

�,�k:݉�PۨШ�z����8N��G��!>ЦȢ��+"����ݏ
1������
�j������f���5l���G-����w4tm��Dhb��S�k��V�%�\$����z��|ғ��Qb�l�Nn\"}�$b&J7�T�Eo��Բ<y�Q�ˢ�����:�!A�!!���M�X�
��kX�"9�kK�P�Xet�]�̜��N=�O�.imLd�j(
���%B�ɴ��t�Me8I�m�_�&@��G�˽��2œa�

te�B��
㒉�(��	Ao��֫`>Cؾ��GH�U�e�-9SW�q�J��/t�o��m!����Y"���Q��T� p�g{8�H�O���EW`�O��q|Jo�Mk�7?�I��ͼ�r�
�EI��x���MkiDU���{
�8<Z��>�
M
B�$ �u�eMd��Ew���{CI>qw��Ĉ�HϦ=�x6q�˯X&;���J�t��/ˁ�I@���ns�2
���
�dl�mլ]�H��<
��P-R���\ 
��9h/���
MF-�ɂv
��Z��H��鏤;��2
ۭ��5�8�$��ԯC3��=�H ���7*\G�$d�
+:,r3�s#IϷ�NV�vO�j�̚�z���%V��- �w����{�IѬ���B/�-m6�̢�ɵUV�c�
H:��ǯ�����i¯�2���a�o���9ԷJ�_p�?C��d�vc W77��'�?G�,qU!0��&��Q͟��c|�˾?�/*^0Ah�_��
���w��(�]�OL�
+�3�.g�{��V����QJ�ɰn^���%α�du����������6T��S�4<7�){
v����Re�����$�e�#�5_
+�b�k��J;u��9-���8-ծ�Vl�v<�Y1O�`}�UM�3&i���p����29C�

��N,A��w�Jq����F1�����/M��`�r��
�d`�������8N�R
��s�lIϹ���� Ym���^��ؒ�W�'L�
�T�
��\�3K}jJ��y)
*0!p]�HH�!�tVN���:�q����N��;��)t֝G� 8pN*]|ϊގa}`��)X]�|%��=>��`��?�ݬN��t��N���z<^f�xpa ��N݄Z��N/��~J?��R�n:���@D�[�J,x7I[�z
`B� �8���ױ��g.��宱`���aW-�����
3�~@uh��Ɯ���˦<��t�Pz!�f���ԃ��r�)��*���m�@�د����>"�gLV֚Ӓ�l�����L��}S�9=
������	�Us;�|��b�P����,�I��~�
A� n�4k1�9Y��FJ�B���2�hؓ0Z�3��YN��8D���a�d�cR�-?.i6]OvcM�3��;�=\��֕��qu�7�	
P<
+M{F��J���J�MNE�м&�{���S\I�|*�,
Axa�]'ljD�u �H�d*"Xh�"��-O���J|q�,J�g���l�uO��ʣ�E��@^�.eHZ�Y�qXs
���r=:
�Z�ޝo�m:+��\�+=eA���u��v=����,4
��
������v�S��͏]� ҳ���X贱�qL�����T�7
ie+SR�W�<;@�WM��Ico|4-��-ŠE�hy�t4����
+ϓw	�G����A�^��"�����MϞLe�� ��
��-���̳q��x-\� ]ğ=�L)�Nl�g�/@غ�
+7:��̍N�\�%Py��|&�eo�m
+�����]�"��6�^\j�(�nx?��쑀܁2+2�"������T�h�����56Mɗ�/D(ޒ-Ք��C^���C*E��}�Gp�����Qܧw�*�&�
�B*�+4�2|�_���^������{uJ=KC�J
���C�lE�J�㙜��\X�>U�1[�W�Ev��~Av�r���r�0__����}9�B~
󆨤?k�[O�PO�Z-�zغ��
����jG��*�H3��NG�U���A^��٨�1�i�x�+���R�/6�-�M
�������+˵ȵw
+#bx����K�JxO��P���Օr�[�C�4�Ⱥ��A�#J:��V�M?/qq��y��;�h�}3���C;����B�kE�Q�K���U��dk�s����؜�

>�����:��`X�����0�
��
k�&wd���ȉ���9�d�7
+������v2�hߞ�$L���*��1b3��0����bw�w]��>㨑/�n�1h���p
�q\���_����O�T��+���*�t:�
@���&�Z���B鸶<W��7M:��C�12|h��-$8��A�C��{Q�:���1V����ڒ@_��aL�h�����˜Wp�C�ɲ�#�t6:$O�X�"l͚�B�2x���������y8Q�dm�oH.;���p�!;р��K���g3�!�U��sA����.=��V�A����jYTOC��I�^
+endstream
+endobj
+3390 0 obj <<
+/Type /FontDescriptor
+/FontName /EFRBIB+CMMI10
+/Flags 4
+/FontBBox [-32 -250 1048 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 72
+/XHeight 431
+/CharSet (/a/b/greater/k/less/m/n/r/s/triangleleft/triangleright/u/w/x)
+/FontFile 3389 0 R
+>> endobj
+3391 0 obj <<
+/Length1 1438
+/Length2 6052
+/Length3 0
+/Length 7022      
+/Filter /FlateDecode
+>>
+stream
+xڍW4������n�����j�ڻ���$$���TQ{oB�Q�Z�F��=����j����}�����{O�I~�~>���|'���F���p;�
��
+I�ut4�� !!!!abNNc(�򗞘�>���a���C�0:
+��4=\ @ P\(!-$�������<�� 
�&
As*��|PG'��_� .07 (%%��+
��
+A@� @�r��b*�A. #8
+A��+��
+�&-(���% rE
+��r�| /(�	`AB�{�O� ]�+�4bN����`w at y� F�C`HL��
� `��4�zn�og��|�?� 
+ �N�'�g"(�W0
����`>P�#���i
��Q| ���#�	�ă<AP�
��W� ��� �A������H��O��?�`�Yf�
wu��PH���@0��}�
�!
���Kr���
~°�p4�A�= *|0*�t�@LHRBDR
 q@��N�?
��A~�?�
~np7�$ � ���!A� 
+�	���K�@ �

+F� �P�?�1j��o3�`)�� �����5�a�p���?�F,h���kp��俍JJpo���/,& 
+	�$0����	����V�ӝ�?5`pL��(0���?����7܀�Ѕc
p��+!1!0�
��ނ_!��f�?���
�y����s�v�v�+�����
(�r��1+�OWS��ց�C=\�Ӫ�a�D�!:?PT at H�
�T�zC���(��o2�5
L
(
�GB^<�(!���av�s� 13�m!1���5ޟ2�j��C����Ia1q � �c(��� ~@���C�q
 ( ��0! 
� �
A�s��� Aǟ7
�0��:!����&~*�U
�@`��EL+ɿ��&���eœ��Z��(2x�
���}7�*�!D���>��`��5�U�6��f�ܡ���=g~��o��兏�7~�uG�g�W߰?%��0���5a囦(1K� z���;���
{�8����uO&zݾY�&�ު��YS��M�(u{��l�o�"vD{'w�5.t�UT�n��l�)q�W5�B�@�,�������!+{
(
+U�~FQ������%�[�~v�T��F:�������Iͻ�V�f�YQN��[�dmk�N��S��P���Ol�
�����7O<
�9��[Xv��9��+��ߩ�� ��;E�h�*���i
d�*�
%�X��I�:0U�;��� �=\�::�(������a}����~�`���ɪ���
D��/���dE����P��+�TARr��N���M�|b�QN�u�$]����	wO�
%����k�
ˣ�$
˷�����R�w�Zn}O�l�4>V�u�^
�j�)
���=�ъ����XT�H�}{�|�1}l%,춄���r�
g*\D	�L����|���JȂ�lӭ#�)����ÚYOo
�5����8�Wz
��BZ�E(��$>Pqci����*��f{a]���M��g� �崿K�x�J�6 '�d&[ÄS�1��ڌ�S�Z����on�Rj��t��O��Z_
��W���{�
+5�p���6E�G�+�!�3�����T<�
+�M��7D
+sP�ۻ
	ӃO
�
`�'�Ác��"�֏�e��;���'&����'��ʙ�Ƶ���h�wb�
���-�a�Ĵ�hb�4�z]^@B
�a+�HwyRl����0_��j���"�F�xM��U��
V\��g����ڴ
+Crh�%Sq��
��ܔ��,����b8��V��g�
��d�&O��
��M����M�>�,Ta���v.��
�y�_���	�\^���=r)ֹ�� J�>�����	��y�bq�
Q괹��Wz�

��O��F��H�L_&ٹ�
��HfqV
����
����
cV at sPtɚ)'lΆ
 
R����ꠔE�U�u|��"��>�����K������+�2c��	K�K
���ɭ�����r�c�
+�w�&u������|��I09k?���}�+�T
+_�5x��K}�n��aKiӞ�:>� }%�z������!��5�4�E����ym� d��m/%�h��2#�_�-�����u*7�8�
l2��
g�g�Z';����2ߣ���!į�C c�p9�����K� j��y8�g�Du�9�+-�Gi2��('��r�>DOpV���tݜ	�=�Z�'@��J#����Z�$���9Tr�IS�h

+>$�m��o�,4hꖆb� Z1
���k��b��
|�3hY��������pI�-�t�}itW��gӡ�
�+ň�!�ljT4*_	�AKF�.T����aEH�̿�j�Թ�A��9׹4�	d��Pb9�|��ְw���S� ���@������e������A){��'� 
@�¦̭8Qp�IQM桓N/��h&�0�k[�RA:_xM��>p��_b=
��}Ǻ���
!b�L[N骔S�\E�1{��ᫌ
�b�c�^����l|ޛl]�L�b%MZ փ�����y�g�;7WO
YS�6��+[��[�T�,�l>@����S�MF��X5�u;���A3+��7_/I8����}����I	��\o|���˻j�.ja�
{�
�
H?�d;���~8#�U�9�s�Jn�1�L��m�Umq��@o�Q��6ix���G2�E��o��h�����h,����+˱T�x=N��`yW{

6�|p7^��ܼc����T�f��������j��=K)��4t3S⚒��#�Gt^cɮt��3�(y�1���H����x���w��ٿ�.���NtI|�Id8.���K�^�"
+�5�
��v~���m�
'��!�Ti�eM�k�2Ұ;����0MI~üIk����5�2�9����#ה7�I�f:8��Љ�d����S�����N=�f�b��U����
����
����
�\��g<
�
���=+8p�{�&|�e�ш�6I;_
'o��J0
��p/�_ҖF�%4Wf7��C�G'ih}�"��N �t���Ać�Vx6��j`(�л�`g��P�޲�n�y���1��[z�Ru�Ih�fAN��+ߖ�[��-�UBS.Ӟl&±�7%.�B���
r���w!�֞�v,=�6nsظR�B�C�}����	젘W,��3*�U+�j<,{�(�/���l�Bo��;��%_��"�MA��C���C�ӑ^�[֨(�ݖ�q���H�Z+[�B���%;��{������
������IL��j��Jús��Eu�l�U�'�>!G�t6˱c&E��1蝠OO�i�	74����?l��
��Y�:V����*˝�M��
+e���
;�]k�C�v��5���^�]��"d�0�:�
�%�5���C�^3#0P0|��a���{cX��n�[��k
��I�
���)c#�]���*
%��63 �\�c���9�M�#�4�IƙI<�x�V})���[�]��
jLzd{��LU9{�����^
üdYMq
+��������	��78<��	h���=N
+[�.�k�
�V
'�^,�Ÿ<�B'9���p#
Qc7�n~�%4@�F�+�
-ߣM�BQ���`S����C��NJC���B�(��}��izG����$��u�[c!�}v�Jj}��w.폵�ɸ �;�f\1�I�`�F�腾�20Fxm�^��Ahx�Wj�Κ���/^o�5��,�i�:VP(��]����z9���V�k��х������Z�B؇��
7�������dM�d�+��+��|Ƴ�X�o����#0k֪��w��E��T���ndI4"��T���f󍒺� 
u��D1�
��
+DХ���q��	�m��X�u_�X�`�;����ʩrg7��1

+�&��R��}��yt��/�D8!�/oN
U��o�Ҫ��m%�ow��3[D����%ϼ�~��^��m�o_P�H}����B�6�E�vt��܊�Xj]:�l��`��~��bHa�06���{V��>-�l�`�d�o�Pu΅���չ��Z-j*�X:z�l���TY�i�q;}@�w��:�^��eV���<"!�mC3�
[��J
���ԾrNS�kL
�x	�r����-oL��;
r�0�D
i��
���ڙ�v�w]��A�("=���ް�*cr������1��8�i�hm���>OhD�{�.ܯlOHB����C�
.�:�L�?�Y�%���e���K
J|/N
u
+)�lo�`�3$�
_?������H�K��֫�)<��hn�m=UDL�$���a �-�nّ���`t1�3�5꩔gN��BźCzY�=�q�9`����L"T+x4�<�b�G�Ks�(gv8�ZrO�����Ԝkx/f�S;]�h����6������F�E
Ԕ/d��l&Ɗy�R&+��
�\�fq�T�
1���`y�c��ʹ1��U����mmZ�9�-	fgd}א�˖�
��$Q�Az�+f��Z�=�l2�LT� ��-�a�!�e�"���e���O���TW��"�`r�Őj�Q�w���2���z�6x��9���s@�M�b���೽��z4��\�W$j��
����������s�⢰>Bō�g"��l)��I
NAtS�o�S�����
@�%a����s���.��U	{��\�P�/(��R�����Wķ]T-?��'��2
+�nqj{e|�0�J�Js)�5*�E?����[Nެ�#�O���`�W���������LkX)�<��+Gj���z��G*�6E�BT���FS�	�Ն���L��.�a�R3w��$���kR�x�]�����A@�]2��jHVZ���
ҹ'��{�Fc��]��o�S
+�=� �7q���&�XQ��&�S�\8#.W
+���#r"�s^�ԛ3���%�1��j�Z=>ȉ1�f�J�
�\zx;�E���j�

+��������7f9��q�w
��D^�Ǔ0:nJ����Y�}���Ɣ%�RjL �%��
]�5�ٲj�O>BD�_�X+�ͦ�e7l*�64�JְK����Rn��2��7K���>BvU�e��s�꺙�r��Ԫo���]l+#�
�J\X�\�K��֔)���-vΚ
+�
t%]u9Q	�箱a����k�}�/�:
+��I�L��e�<
��������l��?'���̛6�I�I]
ʝ�u�=� �
�7
�x����hA�
r�q X�{���xu�6|Z<�& 2Z� � ;e��z��نI����ַ��x�8��sL�����[5G)���-�|̢T�(
^M��
m[�
�cj�
F�.
�*x�e/��I�ڱ2&�"_=`���:�>�Y�S?�(�
k�g�5�4�!AԺDɯour��{��6qgLE��ǃ
hD�G�b
��	{h;�C�!>y�ַ�ү�83�e�Ė>>V�
q�xJ�e�;�^LѽM
V�Ux~M^¡3��U\�~2�'/ev^��͌��S�����~�
 �
f3C[����9}��)cc�
%���3|f
:�7*��Y��Gxx� *�AB_��ؿz~�����{E)k8ej3İ܆�	��{��b���4<�j�d��������,����N�aDJ��D �v�*��#&��+œ�Y{�������2>��˦Ix1/Ֆ^Q8�pH�)���c�–�mjKC��ͬx�����z�d���h��|�e+U��/S�D��g�
;����vVM;t�g:472����Ex�����.��q(�j.>)�o��DRl�V_s(�L��-�5F��#�7��0�M�����
�Ŕ�?�>ᓹ\8^eꀞ�w7��(<�3�"-����5�_��v�L���
��2�"j���Wr at g�K���d��o��MB�{G���O)4�k��%8Nؒz�Y뒯>8|?�/l��"�$���%��]o�5�Q�Z���\_����ŝ�i
���(��'MG������O��>L/�<��6�]��];��nP~�
e�da�/ͯ�]����A��;�u����r5�#��=@�{\|8���������]�-����ǡR���W$�J��G��ll�u�H� <�V$Վ���b���kn�vRH��;�x?|�*7o~.��{��Of��Y�d�E�
���Aϓ�� �����H��4��]��_�_��a�:��lgV�>g%�ÍHQh�*o>|d93I'�՛ϑN�GR��دh7�GE�o

4=xPx������:]鏔[{/����.
�z��~�4���c<��MpǴ7$/���w�L�Ɔ�.R�y�ْ[=_�<��-��O�U��j���'4J�уHd�[00�@;>�j2�=O2D��>,���H:M\�~A-�2�aˇ�|Mvڝ=������C<a
o+��@�.��]�S�Uur��Ƌh�i���J��z-��N�:�/L�
x�G~�:yH�qѩQ땳��DK��WH�������\
=�ؐ�i�\�n�(lN���пa��L�/�~g#[]�k�+�N�}�HD\��Õ�g����v�L��;6�xc�
$��`�9�
G��U�>7��}�Mwֽ��:�I>HM��׋P�A��L�
mV�m!\��>ꊷ7��*~}�w
g�j%��Q��F�MhQ��ȴ�S
,��=WmC��Ee�5&\�-ϛ8����N�|+w+�Y����
�� ��BcRHK%�+�ZM�ִd���{��B�h�����V��
��0��d ^��1�)6���9����z��<��6����#�("^�֝���<��'�є�Ujhᘟ��� �`�ˇ��YI+3�,���֜�i�dNT�.�sH{rw�
�
1
VT]b���)*+�U�\��nᒎ_=>�v�Q@��f�	+�r�U�4-��v^y���vx��l�s���?�%�2|��ȃcv!'q�{.�|������上ͧ4�h�7C��hL
�;	=Ż�V�L9���
�
�������G��9�Y9���]C)��p�η*�Ef+}>
�IW5���I�L��[e$�M���W��C�Y
+endstream
+endobj
+3392 0 obj <<
+/Type /FontDescriptor
+/FontName /ZGGNQH+CMMI12
+/Flags 4
+/FontBBox [-31 -250 1026 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 65
+/XHeight 431
+/CharSet (/greater/less)
+/FontFile 3391 0 R
+>> endobj
+3393 0 obj <<
+/Length1 1467
+/Length2 7070
+/Length3 0
+/Length 8050      
+/Filter /FlateDecode
+>>
+stream
+xڍ�Tl7NJ���h��ɑ#�1��`�����.���F�$���T�o�������9�wv�v_}���w��`�3�W�E�@�8�_X at H�
iH ��D��D98
a(g�_jB#(�
������2
+F�u*`���4=�¢ a	aI!!�����ߎ�
@�	�� �8ԝ�C�ꃄ�;��e�>�!< aiiI��� E(� 0�ꂮ;
���r(�������� ��] �����x�P��Pw(�j
��v��A&@�0t���� �P^`$�V8� P�;:�n
E��� ]W(����>�_w�O���%���!��+����`�P�.P[ ���ᶿ
���t<�
s۠
~w �`4���C�0W���;��D�_iз�
+�UF��@�(w�_����P��}�L�	����%���v�@�z�
+>���<�*��U����(�������0 ��zC
�7�q��6�V����"\vhP�
�C����PH����-
+
la�j���
�������G¼fBh�	�~}�s�@��w�����|uAƺ�z��Ǧ�����k�
�EĄ���������k����z�'����}y������
��%th.C��P�\H\���^��!������F��m����������1�]`�>9���B��^���C��2j
�p�_�
+�^E�=����bBb�0w �j�CA
���Y�k8��P=�;�׋���z� N�W�
=�?&�;zQ���K�����}��!�_�(". #�`B4!В8�赵�z��;@P �@�C h�� ;��ט� h�K��(
���(
t�GDD�_�$@����� 
H$���TB7������B����YD6ı.���"���
�a�����
K|T���Z�AN��Vp�Oh�إ��v����7�O��
>bg���
{f��ٛ3��I~�
���-ƩJL2��~
=ƨ;o
���p�>��K��(Jj���t�yY��M� m����j3d�)~B���m
���ɪ%�yI��U{gupxh�ncwT��g���s�]U�!1�Z����Wy��{�d~6j��T���4�Cʅɭ�4�Wlx&��I�{4�
�����gi���=�Riy�Y��#�l喁�u�~��>��]
��L�f��;��CU��Ӏw�Q��5S~�|�,yA�=/��y��p��wn�����P�G\�7y̭a��
��3�}���e^v`ƌhʨ�m���Y|p�5����&'&lj��c�o��ķ�S����M�`y���<]A�u��������?
o[�_bW�JsP�\\�yL�K�Z��"k1
�I
����cY9�������Ko�6�T�h`��g��� U`�#�|�D\��sw惾��*�A�� 휲g��Q�»��(NABE���Jv����
+FI����a��(]M��J�姘C��M�`��7
�"� {��ZJ[B�K�E��B����@�8+�����E��D�t��%�\�
+M�wk�H��E�J�g�����ĩ� .[����E21^D졖<o�I�|�y(y_'c��k�5�e��+��M�W�T�[�\=�q>��ќ�l����w��b��m���r�O}�#�?ѓ'&��լ�.�
+��d����&QZ��Y
Ű�؝����������2;�����cC�b����U��g�
�����%ń͌��h2t爝=;��
L
���_HM�6��qY�OE7�k*Ju�����\��GV��oߵ7&K�+���Ǘa��6�0Y{Ż;������l�d��iE����@��Bԉ�8y����8�ckuC���:ɍ[�� �B)&e��t�g9�w
�����g:wP�J��{���V)��h�
�.�L�����ع��I�G�/)�w	
n½���
|w��w��cO��|���`�?G^���&bTwqB9q�
+=(
��35y ~���9��`@��;q�
��u�S[������~>�D��:KQdncX��J��
����d�c�X�h���O4��J���Hd��ȋ���i��LW�|���Cn�5
+�,Ͷ	!˕�6KqS$�
�W�٭�So�H
���z�<?0��V�8\m4L��
�c iq��a�({�e8��x�v��R�!6�,;�KBo��5�
rs�hӗ�hH��$�d<��K���<u�J~�6I��~#��Y��/�RloW����N���~�J��L��&�O�!�D����U�]�����إ
+���
+���Ƹ��s��/�	%�|z�8|�t,�:B�K�P����iƚc7-F��'�W��gp��Y�D@��N���D���S&�[�S���#U��kڵg�ǐ̽�6�Ùx�

�����!
9TQ����S�ځ�t_Z�=�6 at D�<��
�ܣ-p�:�Z�/�O
!aj[ɠ�
� .{=���D`6�P�g�[]�|�+��0~u
2
t��Q��P��
 �&�6���k{�\�S
�K�� 9
-��Uڞ���V��9w,����^K��H�����(
y9�`��؆Ҫ|%�Ak| ?��p��-�L�s��O�r~'7�},��y��q%���l�ph�zD[�����j�#���*[�{E�\�o�N���3��Cs�
+�
،V_�g������,ߖ�b��y'R)`�l����l.�K?��i�5�]��`FYhp��z��mȠ����-�Yr�
�[6�]�M��"��� �h��*kF��
$HpNc�ql�6�M�@{T�p��w�c�I��F�xA�]��m����U�k�ڣFZ��k3h)��T���R����l�F_����馫�8�?�������U�����G4qM�J��>�w�
���wC��M�c�
���"ޓ���8�҂2�U��	N�o��6���al��@����V���ZH��8Mc%Q�z7��v�㽾W��

>#|����j��V�Pjo;�HKg�(;Ӧ��gQ!��qr:��ܸ�u�vƦ_Ǝ���.�{��DU�*i^�*PZ0-b����"Mw���5t@�
ި��:�M��PJ��t-�$�j����D�$.H%�E�
+�K#��W
�q5�Wu>54
�z@ו�I�"s�,�/�B�5C@
+v�1��uR�"�R�Y�#ޖa1%��F
�G�ɽ�3����_nʏ
��f�Kؾu��y%|5���Jm���y�<���|�{�]G�@G7��Kq3�3�����WbMѾ
�uC���#j�|�r���ʦ��8��
\�}
���	��%B>�
+K�d���#���4~հ�ZW�Fu=�nKv��ۣsZ+���֎�P��
�
H)o{\E��4�M�4�x�� �)���lT_�
ŏ��V	�U-R ��������3|���	�[�/�{�<y�c-�5�YP�<�Ɏ���ҭ}"1ǰp&�G�N�~Ź���g�`�V�n�r�&�ӤI��/��ɻM
N� ��E��'�
��S��P^E=Ŀ��,t���`kՓ`��5�
���OtI�u�{����~l/.���z��ܦ/��:�<�}[X�"2�r�F;��Y/��*�L��d���B����uJR]���by
??�>�N��`%�s�t��f�%?��(<��t�\9���Z�7HnK��hk�;]D�E�Hm
=����

�nRF�2S�n�}V��W�!꿴�kX�(�]�3��1ŝ�?�̍����2����0*���x����y�����0�1�
(��|����i�<7&���*G�"�=��SG�]5��o�K��m��h�}T!c���&3��d^�I��3@��>}��M��wm�̙2��4
@a$I8�c&����K���fF�x�}`l��"#�@��ǖ�
6�`%VC�
_/�.̴�v�ՠ�C����@��z�I�@����w�5fU����.���m�
+�,�O�
{��h�R��$�E1��rQ&Ac��RӅy�ϟ�U���{K�WSD�TF'�X���J
�u|w��J+�l�6��玊"�}o��ue#Ԍ��
��
�A'��Ǘ�HlUۊJ�s���F��x��,b�s.V�>�����W2˽M�/�a�����)�2�"
��WH����K7
Zi�1�����.v\in��U�4}J�7��S|n%[�:�
+\��@	�.<p�
��#
\�^�%�C"�+Ы!�H��ͩ�]��ueK�O&G�^�+
?���ph���a�^C��K��
�ⓤV}:S�"��P�F{ڣ�R���'|�ŏσ�龑oU�d~���.ҭj�������y�nܺ
�p���׸� 1���h�5f��R��5T����n��c7�ڻ�%�5?cM|��y�E8��uM�j�(��H^��<�&��᐀gon+����Y���������s��`?1(�:���D6��*R$I��'��;s}��(���
M�{�s�];E�+��[�;��R�_=�4v����h~
+QGݜ2���*dK�~p���4(F�����G���}��]Bf�1QT���
+l��*OM1��?��*a��ݬ�r+�9�U
l��ǯ�.�V!!S�{�
+�ʼnAS7��6�'��������g���\�#y���Єi�G��1�W��_&��a�M��������7��TU�nN�o#��Įg�Fk��sS����?%��(��=��}5��pl:üq�
+'K��䀞�
ͷ�f&v��>��*E�k"������?��c
r�3�?}%�$���B5:&��*|��9���·f�ҙ��|�R.�A#rRg7
��E�Q�4��i2X'�M�LN9pW�
#:��;�����'���O�(�rR�پ

� _?/vvt3~o��C8�}���U2c��f�9y�_�8�v�4��~�A���6c��)�P_X��E�2�ŕȞ�'^"� ���uZ
���=�t z���6���#�߰(�D7*\F���]��&��=;����MYtY���A���H|尔��v�PstE;���;� c$$VJ�*G���h�$b>�
�/�dcq���Tk��L��1���?ح�V�-����g���a��u0ן$�ty	o�c����\���:��,�y,c���#�ʞ��]�z��e�H��w`n��]>�HK]�X*��wZ�Yn�ӏ�.�I�4����R��H��Å������b@
7��#��=Ma�&ȡe0Ԗ8|��R�a�$���+�
���@�A��"�,��c�
�� [...]
_ע9��ڐ�w���6�#f����gd\��-�:��OU
JD��/5u�t_`f����<�n.P��6%2�T�%���·�#aZI�
�R��_�ү�ގɃ�/�Ĭ
���\~y=!���Y�$���#��U쵈��Y���<?��᪋Әy
��y�)��rOz܋���Q,E�ڧ�wď0y��`�ǨuT��ni�j~�3�(/
�"���H��vV�����۴�?�~�0
+l?i����8��+ow�bCR
�R�_<��/�׆:�v.�2!ǂ�w�h����F�,�a��
���l�
+�B�Բ���͡F
�
s�[����*�j��vY�I��ŧ��x�T�I����u֏b
�Ħa����V��q�G�щ���TO���˺�j
�!��
]Ӻ����f at sO��D
q�ެ�;���g������t�
�R���T��1���n�������W]2s���G%��,:�/*\v�"E�f��k[j=�w��?=a����-+����lw��@��[��G�=�=��o�7SW+���K흱�录�aXk+>� �>��-
ٹ7N����체�Q�<"��ڴ���1^ֱ���SB/�nƇ^���Z2k\���Ɉl4G�~�!@�ɲ/~��y�����+���YZPqxT�&b�,� RE���>\k�X�C�����7l�w�6�tRnU�=��z��GIs�a��
���J�.���̎�i�OG$���=��]fB
�}���+��QLW'h�s�k���
+-�����K
�`�\1BM#ߪ1X��5$y"��4|�~��ӭ�%�ט؆<��yţa%�LF��R�fu#��dzbcC�
w�S��0�w�2�OU� �}}�0gᗪ*�
R#�-�b��E����
+[rn};

oDpK��?��pf0�b�����fʧ萖�݅o-P��=gR�n5p���RB֨�O,��\�qd�EZ�"��L8�p�3e���zI�U���e��Ȧ�����"�7%��
+Q���>Va爩<�3_lim읝W��Ih�	�)����T�ʌ�+~������I�!4��ߊ-fC%b{F^�~�EQr���X���kY|5Y��&��E7��žm3����L�XA
	S�?��Y4�z�ލ�߁S�(�*P��C��!�F=�!
Y7��F�7Y�^���a��AE�����4	C�Gx,�(_-�������
c���[x��qa�(.����E�0j*�����
+�S�/�	������
�_ȷ�'}���{=pH[9�ٙ��x�q�k�b�c`��|t$@c��f���U��6�ju5>�&�J����
�x������%��� 
3���f�IC�ǝ�������
+	�P������ߌA�
dw݉KKE���
Ng�\�`�d���`bi
%��cл]�	l_X�>��6��'��.��J3�r�d��(r�U��6��ʏ�
��X#c��D������bM"�Ya�0{�;�Li}qc�j�+�a�<�y|uS�3"gݛ<oOo_�8{�+q�s
��y
\�\�r2P~1o��Qѩ%���`6p�<�:�u�!i=8��<�����Y}v{MٝHN��u�i�S��F�7��?LG�v��F
�qj�|O�8�U�Y�(�^��jx���A�_A����Ҏ�X��_

'/��|��0�
�_���t웥�����`o0�Bo��Ӱ�c�x���C;f�:�����8󂪏�+�:�!	|_q	-�Q���}�@���3F7�ǘ��%(n�
̱�
�c��H�
3�J�j��f���.=Պ����
3�D�33�����O��u%�D3��ֲ0��F�j69�=RS]} -s�q��(ګ�Ґ�I��\=4k�^,
􋇋��"�0`�}=+�;XZr��N�la�ǷO_,M�=V<'�J�+h�e�sc�6=�T<&�(ǃ�
%a�	N!N����]�|�����
+�֓/�#���±�֌ɮ�dO8��8KM��=}O�GW�
+��Vrp3�w��I��$dp��.�#�P���S
��P<�|Z�:�;˃ƻ'������g���0v(8O�7�*�M`
�������
y�9�@(~!�G�O�{
�m3���s4$�j�������Ғ��~�%
�
�Pgj��ߌD�=l!h�4�.��	�d5��]�����KѺ�[WŽ[
�����]�J=�)�K�#Ѭԃ���e���Li��r�0���	[
i�&��#��
V
�
���b=�e��!�l�~��He�k"{�}9���k�5��D��ytN]�3�DV�o�
+��c��_Ɍ��
]Su��X,�a��_���e~�r�#�k`�!�G|h��x�mGU��ҽF|���B�I\x���^R�~�͔
aa��
�����_~�y
�P���.�1~
�T'
�L�UY�Y����
K��Ng��E7��-�,O���~�ُ�>��L�M��o��8�	�h�3�N�4���$E���'�����l��'���$"!uU�w:���f
�qxur��)<�v�h|�b�LlK7�l-)��P�L�.��!��3�(���^]���c��E���j.T��.�y�՜
��F)��T��4��4�L��b��qx?��"��$��CoޏT�%Y�0����#x��Ď�_�oH��U�\���k�S��_�
H
!.����L�oq��N�W��4(����ua��۵���!�|�K��S(v�TTu�
������SZ���5��dtj���
k\
+t��p��ĮX�ֆ�S��)����J� Ɉ��
+endstream
+endobj
+3394 0 obj <<
+/Type /FontDescriptor
+/FontName /OMWOOP+CMMI6
+/Flags 4
+/FontBBox [11 -250 1241 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 85
+/XHeight 431
+/CharSet (/d/e/m/n/u)
+/FontFile 3393 0 R
+>> endobj
+3395 0 obj <<
+/Length1 1497
+/Length2 7487
+/Length3 0
+/Length 8489      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T�k6L�tI��
Cw�t��0
0�
14�% �J
"
� %
�4t7"͇z�{����Z߷f�g�k׽�{_�a���疳��@��07��O
����*�������af6�"�!�q�� �
P8L�_
+��ަB��i�a 5Og P  ������������A^P[�&@
�x�0+�]}ݡ���c�~���@11��� 9�;
�4A����`�3@�B��U�M��p�������x����ٹ �P�@�q���~h�\ ���0

�
��p;�7�
�78C���}�'���?
����v���k�	��u7  �?����U
+��
��.� �/f��:C ��< ��r���烼@Pg��}���A e9] ��_�<��PW����E�_e�oY	f� wq��
8��S��C������g�N0�7��/`����"a���k��yBT�
+�7��c��  B|�"�� � �v��U�����	�e�g��
+w�ݓ�B� �8�
 / ��		������� �=��O�{3����;�`�w�= ����?o��Ü}�	�=_^

-cme�?��㓗�� ��� n~!> (�ܿ�w������o��Wo|�T���@�?
�/�o
^ɂ�a��Z�{-C l�HߜO�|� �?/���?�������6�����������q�\�ξ�K�q������o�1��*kBl��.��UE���Cf/qn� ��;�C��Ձ"����,��p�� :p�/�}�����t�U����~���
C���P��ᶿ��_H rw���
�
	���kk
���w /
��O�s���q~��W���lA ��/(��
�x]���z��
�{�
� x=������~O������L gn�s�
k;�����^�D?�87��
+��B�)MX-%���̫�Q��*[:vjɻ���:s�ZGW�+x�M��iOg�8}w�<�����a��	)�8M���k�>$
�X���2��}����=���,���"j�mZ
�Ks4�iČv���6kB����]BW�̣ӵ��%;.p�����
,��v�>S�
+Y;d�@)I
�(
+bV-�_�z�E�o�D^��l�=�4q-��x-(�j�e���g�Dw���
�/a����9ֺ#���jN�-����
Q�>�hK�8�}�h��X����ʹ�
`�L#�	��fa�����ӿ���Yi��G.�%^<`�3��M1{�4��>�K��EqL��Γ[ۇ2��
���N�K���?)
��G���
+45g[�D1���6����5�=p>�+��>����~{�Bɰ������çv_�rw8.
�V\��ˋ~j�����Cv�
++�T��fYCT��V��{���ҢWbu_��벦0wY�=/k�f� ^Cu{i@�=��C�sx5f��ؙ�]��C��d���|R� �QU���K>1hd at _�f����^�8��^�]2�o��IRi���6G�Ko_aek���^!�Ff�C�z渂M�*Uc9kH�؀�z,�MaA�oߘg�6|�Wl�� �}`��вk�*8nc+
+)
�ZG�f�1�c�~r"V5 ���S�

������5�U2?����|p�����"
�
�$�h�(^�^�9���qL��cE4q�e���
o��\�W
����ׯ��J��i����ݿ��N�~��_�gLH�L���]1'���܍�(	� =�X�ϚG�F/�y��
���$b��-�@3�ih�����(Q���ꇋ������xӢh����HSկnvD{}��g�?��bsf��΋W����� ]�
�HH~�䝟���=��;��d�{��.2ܽ�%`w�ȟ�m�z~]6�ݐ�Oi����ÜU�!V���|����ɝ�����톈�Y��@�Kc
��d`LX�:F����{�%�7�+i���l��wm-9f��W���Q�MG��wh�t�+-A�
+^��OT��\�#���V�"��{�#wnNg�*
�8H�r,���8X$^�Di�؎�T{��CW��Y�d��.h�|�n���
���~I*��A���a��?��8���i܏�k2Fψ����t����tJT���N��ƫ[��|Bc:�v~���M.�w ��PS~��We��Uv�qQ~L�΅*�
��o	d:�yH�M���@�FNf��i
+ݨ�NJ{1�[��y�|������v�SNMh��j�/�n����.`�G�&����D2�`���Ky?ZP)���)ږD��>)��<T�j*�̣��<�?�U�hon���Yn缫K��'"����
��C��]
G��gz�����GI��N����e>z�"YQ�3*h=$��w��L՛�˜�}H��Уr�I���]�
��zf�;�[�o�a�+C�LU,�SQ(:��Ӣf���R,�J��j*2ay��4[ڐ�R�����3��

+����>���g���
�(pE�2�$��
:Q�㎋)
��2S˭��
�5�3H�u�����W�5����H���������O;O�W,�Z�
f�1�1f�����v(0qԈ�ܸ��
7S5�
S��6j^��I��nk�!k�����Tj�:�i�/��d���m��8��}�����yHˑ~��A�y�-Oo�I�Ӯ�>��O_�7}a^@�}&�C�-A^�ܯ�C��
���X%�d�:Ⴀ�ʘ��9�ё*y<2)(���(Z@�I�!	�Թ���Eۇ^��l�il&�#�k/�-��Ĉ�7AB4w٣o�'Tw�N
os��x���YC��24|���N�Ӝ� g�#G�ս��S}3����÷%�6�^4޷ˢ�#�j
��.��_m{B��(���B�5�_�)�d�.�3)
C �Lb��Lkf�]AY��
#Z�c?[o�v␱Է�jBI"/X.�$�.n�u�b- ���?4��Q�m�ЈN�� >�n�4����*FpF1��C�
>8�<ѫ�,��;�����4@�q�ٯ�_k]��T��ڒ���lT�9�q^��<d����{�uZ�L�8E��]L�x1�i���0j�Pg�z\�蛏��'(Nx�f���Z�7Aj�R��c��
+D.��m�GTt�&߹�CK�~��
�H@��@
�z�	9m
�$
DٷF�ʑ��<��ƒ��J��ibWw����2��d�^�ָS�
�9>�J���T�S"� w~�7�:�%�'��Mд2}\x�<�
�p�?݇@Nn�tW?�v5Ĕ�}@]�3����C��� �$�3�����'�=7��
��\
G��R [�!~"FǸi�
CˉAi
���j��m�)ƙ;�b�iG6ĥ6�4cW�j<�t�\���������-��U�o����4�-@�	�.6$������9�e��7X)zF^�/,OO�+���Fz˸S\g}
��
��<��
�a�܈���%w�-M�<?���[�
�cl*�j�{��\��f��2����l
Iɬ�tK�4�
���Q��g��7՞-[S����
+	m��
s�+x=��,ѵ�T
���G���: �'��Y�k!LFy�N�k�{��Ҽ��X����։�'��|�
��.����D	@L��}�GVעx})�,q��ϑ�,׬���]�v#�?e��
D�>�E��:�d[_�O/�=����s��>���2"������?�)b"D��J�B_;�6Y��싊�؆V�U_"Z�r_�fZO({������@5�󏲴C�~��
)+�L(N�\��KȺ�TAӢh��1U44/"\u��7(tC�f�:Y��?�c)%���y�bިc`l
��"��a��?���/7"y�����=:��SA�&��^�>�|V��'�S��RCJa�Y'r�r�˳&5i��
��!G��ଙ�S�GC�AB���\
��
&�ԃ���Ng��uΰ��y��;�M�����A�K�V�9� =w:N��l[|A�.rP���p�
Ecqb�k?�hH��M8��2��;��
�
+�ՑV
+�Ϛ�_�mYo 9�
���F�8��X�Ű��0^�a��f>���vkx��~Y�~�S�]��|Ӵ�\x��k6v���L��ߙm>�R�q&Y�4
+�}\��{��
-LG�1�c�
+�Z ��Zo~��U���1�)MN	֎��7Q:E�Z=��Uf���J"���AV�:~}�#Nk���0&5ٍ���
��x����	���T� D-Vw
+��h��)�8""u��
�D'A�QYcXxo�)����׬���z���^Z����fұ6���)!���	P_�֘*��-\=pb�S��N���:��#�>�
�����役mˎ"����d�����/���i�tY
q�V�1xq��$|�R
oz?A���52|�SN7�4.�+��s[�^��)��J��)��;�/N��:�I��[ְ�/���
=a,��s`�ٖ��4�~K�n^Ȓ4����rv�L����
��
+X/
����{��>��LKq���ׁ�mhC��L"�4�����$ц/������SFW}Ԃ��G��`^�js/rBY�1�����ڱ�plj�|�I�����Z��f�L������8c�ْ�}����>��Y�4ӎ���Cd''��1�"�x5�%WL{������
Ҋpڢ��=-�a�&<�%3�s,�ıXh7�r��.a���|G'n�?*Sr'�ix�9�ɒ߂���xz6y�='���f�|���L���
*�{PD���^�\�K}]�j���i㢹�F�-� ��:"�Z�Y��/�$}��iM�����[[���FB�~MZ��C�QRI��
�v�Ȟt��z��?C��XSt.����
+�� �L�u����ru2
���s6Q�ⳙK�7��
�����
R�Ȣ��<oZ[,g�xv?�|h�C������S�2U�����nT�AÖ�W��е)
A�ш���w,RT.����?��7�>I�v��g+�[,;�]�W^��=j�7
�pn�L{�zs���q8�c=�ؚ�!(�@��U�#�6��>I�Ve+�yU(:�]����0�D��\'Z�C��if���k~��[5r�;�7;x�D��:��Kr�U�Z�o��
K�
�
녪�Iل��P��:*��X;'_�F宍�I
A>_�U�
+�� g��D
+���F�~f2�د��ܜ��_E�I�{rs1�~|�N�L͠
g�U�������B��l"������]��������|����_�����}��R�l��Q�a&?	���kVf�͡B
�%ս���8(��fw��
օS�9��&q -�;vnxRIF�A�?!��KxO�	^mn	iz�:0��Z�qY���^�ۓ��mo�J�>���S
��w����0
��V�ߙ�
1z26�hX/6j#��{#}
+ǡ
�s��|���Lk�����	��v
�"J���]u~;I6�m^\1�
�T����[c�ۓG�Ck|:V�/�^���3x&7k/����T�Mͮ��I�f�fӊ�
�5b��Q/Q1s0
��r�mŖ%�����<E]��b
Ѐ.xc�\�6��K���9<(4G
.�3�V�K��I����J;ڝ���Aeе�����z
��d�����c[�zYy��w��[|}!<�/��u�Z!h�g��CO{�w��	���/m���%��"�e8� �Es\�8�B���U�a~��S7�(��X
���G��K�r����
��VF"�oɇ 
ی�G?u]+l�U����
�wܒ��D
r1f�?�
�
+�D�-J1r�oT����=�E�j�3�C
�JZ-�QE�=�"S�n�r?��HH����$ܾ�	�q
�_�	�߿V}	 :�we�I& KCu��L5҈,]k!�Eo16�}&�e}�ǐ98�tL���,�fV���.��H���3��U��$�+�d�2�^7��a�ۂ��	ǯ9��[d�
����
+;�('�}ot(������
V�(<*Z���ɑG�Q��Q��|Z������+�ûn
&�38��ާ�F-�w�{���*ZPd�<�}ʖ�p�d��0�L�+K�yBH������I�N���x(YdB�k磰Җj"��$���sp�`��p���]X>a2�vGS'�XҶ��r|׍	����ɁҬ/>#C$5 ���)�ٴ`s.x�x��D��?؈e�8�f�
�7�j!Xx�~� ���|�<�@�����ml���+4���F��t�Ш���[˝���
�>�>�L{���ϳW
���y	�ƝIs�
0�ȓ�5
�M�������
8ہ)Q�Y�x��5�#����V���T:�q�Gqs���5�~mݰ1�SG�~�-ci���b���p'0��Y�
t���=r�_>�������=��2E
��̶���J�{�.&�"4�HH�,�4$k���Qw�
Vϻ�B�/کd]��<!f�=��� 
�*��(�ü��R']�	-��]���8����(�fS�Z�+�kP?a [...]
��~�h�n��g/j��:'����~:u�[s�
����5V���7=�O�D>��[���a�UW��6�.æl�ƾ�XM���q���E{v��
���ÌI���:�:�{N�-�2D/s^���=we�P��|���׬�����&�恞����l�s��2F�;�)�Q ���o��ҙ��
|���gr�E&49�t$��Bg��:=�3.o��ASSrW׸L�I��
5&W!�xk���J����S�I��R���ǑC
PY��d~�����8	
+���J����m���E\)��6�srO�s�p�Ow	�
�J�]�N'zJ��bc�` �Z����D��b3�C�hmR[
dX$}��i�G��P�g\�2����œ��6�:pռ!
=��!���;�Q�f�\�K,98�
+؇{'>H�_u�}�5Ik�|����[�Hon%q��}��o!�������|�: �2�Ի
&꛸��+q��.��=	�L0/�
+�xA � �S�G|w�����[#t���a�X}YK9
��͏�R�
+���L�v�(Oj��L���{�W.���L��C�SW'�G.�
?+DE)�y&�
��8oy�}~(/�
�b)��q��?	�sIt=���
m�?�7�u����cFF�0������hh����
t�T����[i'��k02
�:k��ԗ����tR�}uQ�:DU�l�;�t���i�f�1M��E�� Ut��4��q�8_���@�� %�����G/��NI�r��i;�t��Tv}}
��A�(�R�Y��O�|
j�I��9
=�Ѣ��味OEoYW�P��5k��W�ħt�9n9��{[��z"R�z5����@>���L����?��Y����]\�n��
����1�C��̮�������h�G裯���pܬz�
"R��Sz�qǑÊ|q��!��7}�I����+�f�
+�֬����
��D��y�#��� 
�*��u��ķ���\������������rE�?y�}��v��K�ב�!��S���vy(�F`�Z�4K��ąQ�3	��jO��m�CV*���{��P�Zw�F�fR4uS
Eb7Va�>�v��_����InML�9�,@$9p`�d�n�q�9�@�4bd�;�½
���+��ҭ�98�h'�;��l�2#����C_^�	i9qQQaK��_�Rikw%n�9�exT��&a�u�������e��Y*��%�Q�r�'��]?Y�I�#
�*����}N�R�}�ފq��lmi�S�-bM���
O/��
���?Gz�,�sGj�A�/
����Hy���<ȅ���h
+h=(Z�+
9׶.��!$7~���F���*�T���
����}8F�M����2C���nF�9W!��\&����
�ƌэu�sjY�κ5�u�j�{��K�?���o�Vl
�n��K�o�B�
m ��M�b�@��
�����s%���=[���I�Q���+�w�<;�����S�òi<�{�t��;���gI^�|ƶ�z����F3�(0|w��o���
�Փw�d�9r�wVJm�_��@m�dz_�H�vU m��F�q��j$4y� u,Gt)ƾO���nJ�����>�P��;'c�E�O������>emb�
Q�c�H��osD�Γ�@u1JJ�⻪�-��8E�-[�D�A �o46���������9ijD$W�9$�*m��p�,��kb��9uF�������v�R��u
+6
c�!�B�8��Ҝ�'�R_�6�
Y+�ҝn+��e���H�T\"���
;ʝ/9x��$�,�(
����ִ� � ����@�����o5jO�)S�e��v�m�x2a/�l�>8vjh�]��0�K�����~
�U#)#r�QwuϚ��ضܝt^�{��W7�(~�&QW|��)���}~�F���`T/9�e��=�O�2!UUw&44���P?������
+endstream
+endobj
+3396 0 obj <<
+/Type /FontDescriptor
+/FontName /PPNWOF+CMMI7
+/Flags 4
+/FontBBox [-1 -250 1171 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 81
+/XHeight 431
+/CharSet (/d/e/i/m/n/s/u)
+/FontFile 3395 0 R
+>> endobj
+3397 0 obj <<
+/Length1 1491
+/Length2 6577
+/Length3 0
+/Length 7577      
+/Filter /FlateDecode
+>>
+stream
+xڍT4�۷V�!z
�h�E��{	�E��2�-�
��k�h�ѻ�������Mʽ���{k��f�ߜ��w����!��-��
+�!���R %


I (" 
+rpA�ΐ?jBc�;
+�I�7%w��)��h?
8
���
ݕ��@��_�pw)�2�j
� h�a!����
j�D����� �$%��~�\ �P0�!
 .�`�3��B�>�J�-�D�J	
+zyy	�\pw{Y
>�� �A@�=!����� �od�
 #(��n���C h�3
�!�
0[�; ]
`��
�s��~;k�v����������D�L��
+��pW�
+��A�! =Um�7� ���t9#��x�'�
�A;��
PU0 �� ��C�ݡ�H� �����4�[V��*�]\ 0$��g�Pw}�>��'��{�|�vP���O�
��`P7�������=	J��H� n �7�A�gz#W�/��O5���+�`���A����'�t�����wÿ%B!!�-��@�0������2z��Po��=! �����^�p���?��+���m������6EE�7��_X�/,�� ������}����A�4�'������������v����p4�! ��o	������
+�߈�3�����lH����������A.Pg�?h.{ �{�Go�?]M �wYb
�p�O����=���B��?�
E�B�!��P$��7�����3ч#�?�
t�6�ځ���
+=��&���_��)C�[��>T``���u�
 ���|ф@Kb _!���B�
 ( �#�! 4f�
ܝ�����?
���BB� A��EQq� ����8�!v�
w�1�
����9���j�����ah
ɿ��&�����:V�6�T*�{�o
K��
+��?�G���Y�&fe�i���v
�>tl�Ut;�^��拪a��=�gVݲg����>œx�{��:Eڀ�g���$�ڽC�1�V;���}�!�Wu��s/N�"UqͰf���ʢLm*I�ݵ��F�~�
��4\9k.q!�і�Rt�Y��[O	�*n��
�/�u3vDizo|e�$S��Ϡ,�Wa���"��N:����m�
۞�e��j�C���
���z�n��m��'�y���C	��,���aK�B�mrNy����F���O
�E���Q��J*�����=�X�k
g�J�C�ސ�6S��K�����<�3~�}��
�����F��
g��-�O.mkdc�`���W�L`Sfwc��ZC���r�x��t�9�(�-"��{F
*���|`��O��?�‰~=՗"�7�B|����:�z��r��

�AL�
`D�I�
�9����e,9'��!c�� �
h���� �p���L��&!�k(
+�=�*�hNs,_%Y���a�[2/9�ά�R��н;���A��o��d�JOx��8��e�{<�lŀ��k�����ZU����N���
��(���hӺy���
+,��+
+e���[]��o|H�N����s�7f�eQ�/
Z	6ϕb�qhP۩V�M觏K�8����ԑۢ���}�ZxR�9:��<�M
H�����ͤ��0��@�K��}��-
t�9 4i2����
�S
+7�{K�~L���i�����ŹQ��R4e"f5��֞��RƋn��<o�
PS|�N�� ���:�s'=
�
Է=s��˺�q�E��
+D��bC��/�Sц�U�q")2֓|u�U��-�d ��@-KJ>�
����
5p�ʧ�|Ce��Zs��Q^=��Ve��[K.�J�dJ���#��ր�^�w��m2=��4̒��ˆQ�w��fԿ�︼k�T�
xV�Ioʖ�=�2N.����M�&C'���w,V�rcM
[��נ�<:��L b}��X����UF]�5�IZ-3aY�y���7z��-
+d��ZÚJ�������s�wA��u��&8M�WXF^� oL��5��hwS���ڈ��~�S�3�+���x�ŭR���R�+i��D�n*��Dh�'�w�>"F5��L��]3����t�� ��
4p��&>�����|Jt�"޺���L�\H
a�2��
�b�J4~�s���™J"
J��L����ߍ{�a���<�h���e�qZ\�w�*=��K.I�Zy��2��:8�|œ����z-X�ڑ��a��F͟�W��f��
�o�|����pw†��ʒ<]�������
˚�f#�I���g���ki,����Z�#��$ jv��?��	���>.%�X?v\1�r`��ִ�A��Kx�:29��/,�
:-�f�y�{��&`ZF�=��c�k�^����MV��vk&��ٛ�}c:�+^�j�
	"�:�X�薋O-sN5?����|�	��Y;&�<0����tluS�G AZ��
���h�� ?�8��&>����Ҹz����ӡ��ok����~
+����#`Y[���,�|y�i.V�@d������A
�~j	�3�,�W7�+6�7
7�B
U���&25V�W|�T*��i�?���&a53��@�v�\w7ȓ�9;�S��[dO��Z�z�o�ж΁�d�RD�"j�V�|�HgsBӥR轒�x���9'A
}vؔ�Ξؾ
�Z���|�

�1I.�d��M��mjm��ER¿`K`m,��q �w� ��$'�[A�
9�,FH�}����T�W;���eHB�Ҙ1ni��.65-o�:��@`꒘rjN1L��#	V�dr�����I�?��'Ȃ����"��Ƴ����
+��.&0_2�~��YT1QݿX��=�e"+�o����+��(�����ԓ�6�<�i�S��r)���{�R�� ��~ʡ�s6�����t�/Y(r�}�!�^�V�q5Fա֙_:В��,��<�5('lf�~���t��A$�cQ^�E
_Ò�w��W[%Ó+S��Iᯂ�iT���D��
쩎��<���="��q�\{�� ׺1�bk��g%�z`DŽ��'���-?�Î��Q
Kzc�����jR�2�ɨ���o��y������v��G��v��qP,������U�����ȱM��R�ּ]t�9xR��H-������r����椕���?
WE�X�a��}]��O���
-\�
P�]TX\���C>�ۥ��ú��xc���>m�G� p�_��p�O���Izioψ.���{�NX+$�}t!��"|�]��x;)���u�j��>�^�#ޕT����N���Yʻ��_����H+g�$�N:�)_l �X��̐��0�xT�s�b�{8MIE�5D�̞�-H�@�\
p�6nM�Oy�8"�-�ѧYs^%@���'?�
(����XK
+o����+�˸b�b�m��5�ٛ���j��MM3�5I$��
\��{�H�J�k����E�
!ئ�;9.Wȓ�(%_2HKY�Dv�sF�ݷ� �=L�]9?��k�#�"�Tv
/������y/�ښ j�����Ʉ��ԙ������8)A\^��?Ⱦ�rD84D�]nV7�롹cE0�${���n�v�Ŏ�����"��-�-8LZj��L{P����[%C�tr�����`G�]�&1�8��Tu��<��'���L��Rc*�e� "�c(�b�C��4�E�h?,�S�r��SO̖
��N
��S��򦱡��F�5��#l���3�
�K�U6��k(ʌ ��e�
�����<U����7_r���qH.e\T�T��8�lW�v�0$�>M�1��>&���]?��.�$dl��
�S.���M��]�_4����P�D�]���&|��4��)k������0=]�=E�}��ET�h�$�:e�� �%l
$��8�y��kQ�;�R�-�|�
jmdt�z��Pp\V����ƴj�� j���8���˅hrG��;��/O�x3G�c��v#��r��@��1$�&0̠��+lѥ�ܜ\�	��dHJ:e"s�!+~�����ǸuQFD�r�t��k���mN}�����*<l�4
�L>�
O�ﱉ�s@��b�TQ()�إ8��%�޻�*�B�T�,Ə=��y�՗,��"�
^b��Ѱfi��b��-RL�D�=�����6躗^c�dr�,'�D����y�B�;�`���� �X
��L���3y�rQ�)�rs�����R�>�=��A��$��/!e�R�o�N:��ui�n��ғ^���l��I�{G�|N���
����*TQL�����78�-M�G||
+�Y;�X-�K�{O�EJ��%]O�E 먽����I�8��ʭOo�R>\W at iij�?�3yJ��P���N�
��7	���t�@�VU �
�<._qQ�ŹxĎ��6�]�T�íZ�L
�L�|V�q"ӧ��l�0F�tMͤ㦡�wXN�A{����
��򧰌ѐ�E�?뙄?�$r���l �?x�T|%�;�:�|N�
-IBt�	�3�"Z�p���
+��
���7�]��_�}�]\�;%%���TFJ�5����1�h��Ԣ�/:E;�v�O����rjL2+��FL~w_:�Sc-E��\�;}�j1��A9�[�T�H�Lr �|��s��(����� �c��b�����u
�9�
iW��#g84h~���Ũwq|I��� ���~��E�G�a+�n�R��#
Ґ�N�)���z��>���:��y�1 ,��[~�*���Ւ��X�̆��q��&5AȰ�$��O�үP'ݘ�ͬ������'6�Θ�����g�$s�N5 ��Lu�������iHi����-?{
_��J�FuRjq���C5��ݚW?�x3�9�r���j���I������8�r�.lVm
�O���E
+��(4?0|с+�w���LI�_�P��YC &W_�:e�ݖ:��y�_�o���z\n����Q���ґ~�M��KD�m
O��uʥCS����e�� |���T��Bѩ��%g�Ap^��؉@8������~8������T/��������*�ϳ�
��03q�D6�	�F��p�o��σVZha5�{��j#w��
+ߛ��S��h��e�e
#��"v��qt����q!ڈ�2ڎ�Hu��Q�
;��ў�
��?�x૏J��6�5�vê;�����p,Ź΁cn_��� ��x����k*#�M�vK\"���R�
+X�T��5Id?ߤ
�v}�6
�d��x���+."zN8��r!&���yJ��n@���#{:�=�)
j�]�xXQ	[�ޓz��X�j@�X��#�עۥ���7����÷�?Z�*�M��	M.NQGS��
��{B��LY7�ׯ��
_����TG�!#q���
+U(
i8,S�m��?��drp{Boі2��`�ȚJ�ձ��H7�
+���ЄcwCE��-��]b>�����k�xT3G��'p
��q{$YB
�Uv)��M�����F��&���yG�ט�*ۀ�$!@�����Pk�¼i�;'��6
鴀h��-�KZ�$X�
w���@����� BL��
�~��MǾ�g ��i�V�x��R�Uu4QG8��5��b#
l�Tw���a4�
;���h�
�zL�{s��գ��g����,����6�Q�ފV@���(�F��_Ϸ�O���*Y���U�T���
+k+47eF��7�e=$�vG
+����9>�
iK<�_�,�Q�"���>������ ��DM�ɧ����-��&����^���
+g�5)||���=��E��
��'}NjV񒽬J[qq����
�H����WM�n�]�Ꙉ�4���u����ʘ����9ȗ����CFK��j˯�o�}�Y��>�rު^�#�~2�ZNg��eRc�b�t�������s��Te1�J�����J�w�oȸ_�`r��1��R�(���
!k	���mđ�-�Ҵ����m2�8z��V��'7\��
+��1>�2��
j	�U���'ra&��h���gц-h/G\7wͧ077��q��|�;5��`r�.�K7hՓ��M�[{�p3�#�
�+Ԛ�Sv��؏A�
nfC��<�r���,=rt�,6�~�Md��v�w��z�d�]�M�s��
+���嶖W�e
(��ں��k�xW��.��� �/E��J�P���%������/��$�ZZ�~�8�(��]7R�/��+*�)���q��K�Te�$|t�����-ǧ��-�ר/[�?ĺr��g_�~0��V�����m���h��Xɔ�T�h�h�;���)����HV��k*�X޽ -o?;��p.���a�c{�7������(?���~�H���mSkg�1[����G�l�޴
�"�
G޷#I�n�o��j3���?�u�~��7t��E�dD��ѹb�raܙ
'���o��&V�Z��ғhͅ�.�@�[����X�����k.���x

����n����t�}7��ޫF�w
�N�u��M�:v;f<R[�>���L�c\~?�B�����Aw�܏P���[��;K��O��1�O�����������W|��[�����w��8��߹�>K�
��zvy������T�ɉ�yI��oCs��]���
�[R���嶯�8�=�J5
�_���T������Uफ"���\bg�Z2��t��+�t[h�%�&Zޣ
�~�
EhF2S��g7
��tQ;��V>d�Y�}�'����͸(G�q��a0���

���#�Շ��8-��3��D��$�^t�@j�D�P-)�qIK�E�0�!W,L�V��8��;o��g)�=����/߁�< '�%�^n�΄tr��ˏ8���
����wYw��]19i�����8���c�>{������쏿F���+��>t+^��_b���`�F�rPU�È/���6+
+���@9�L�XcV2?E��j������H���]�.�qۻ���������3�2�6�5a���ɂ�~�j�_�����W�
�������n����~8�1��:3����XE�F�
��qM����gRzb0��/
�/��ڬ%�^V�(�Dl+
�T�����C�����}
\u-�z:�XoS@�Id
+�V�}jj�㈝��L�Z.T��Ç��JM�o�9Y
�7l���8wu`�f��
;��l���in
+z�
a��/�k�ev6)
+��,�p
+��>C�wmH����G��fb
����=�@2��Q{�
���!����yA?њ/5)6K9}0_�
l\jE>f�F'�|8Ҋ���Y,����J^;j�Ň�6J]IJ$FPe9#E|W�ԟ�֓j����d�>�
֦�<��}�0b_��c�����,��I���fٛ�6:/�-Ai�5�;�:�	&��b�as�k}�[
+��s�ipTE	�2y�NdfH�S�\4X��,����(��L����k͑yX
�*���(4H��b�i�~���3�0�t���i
Z�x�lė�I���alZ$#\p��~hۦ��x2u���;�&YL��^�6m'�PJ�9�y���&�4����_�-
�\ly���N��<�;�u��L]R��#���1�w��Uy�q9���o����4h-C[8#�޺�g2�|� ����
+endstream
+endobj
+3398 0 obj <<
+/Type /FontDescriptor
+/FontName /DGLWIM+CMMI9
+/Flags 4
+/FontBBox [-29 -250 1075 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 74
+/XHeight 431
+/CharSet (/less/r/triangleleft/triangleright/x)
+/FontFile 3397 0 R
+>> endobj
+3399 0 obj <<
+/Length1 1663
+/Length2 11087
+/Length3 0
+/Length 12167     
+/Filter /FlateDecode
+>>
+stream
+xڍ�P
�-
+A�%�-H�N�
��ݡ�&�X�
,X��54ww��w{df�����{�U�g���}���LY�I���$i�2�2���TYY ,,��,,l(TT�`�
�/1
+�&��	l�����#��,7�>�)�A ��6 Vv ++7

�����?�v�| q�9@� k9�P��ٻ;�-���n�sК�Xyy����9��L  ���٣��
@��

����	Z+(Ԟtuue6�ub�s��c���V U���d��0@���gf�(T u+�ӟr5;
���#�,��� N�7�!� G��s���<@�
�SY�OF�_��2��m�ۿ
�!\613���7���!� 
�
�$)�
u�2L �Ml����mLL���� )�0yN���
��P'f'������<WYb.fgk
�@�P~�'v�=��
�gg�C�\!�
0���w���@
��$#��ʳ��%
+�daa��e�
  73+�o�����?H����
�=����I�����O' ��
���7����`6�LA�`�?֟� �?�s�
�n =���c����}2x
/s;���?��(�##'"��g�s��vn O& '
����q?������O�H�M��/�2
; �9<�?y��5��

�=(�=�2@����p��=��?/�W����������o@��66���l�����(;C��B��y9 ����s�@�`g��ee�&��!�����`'I��\
5��s��Ӆg�6`H��	���0=7���3{���8=��
+�O��Rbfg�{��8� &��&�(ϭF� O��
5��1�  3��|�7����wGy�@�ߢ?/ h�7�
��o��
+ �
��[�; h�/� Z�
� ��V~6n�|�
��ߐ�|~:��Ϯ��+�
�����/�S���9
{g����_� ��}�%�j�/�9P��=#��������7�ux���O
�2C���3���l��y���s���O�$:&�9��η�_��U�~Xq���kG_ܐ���'}��o�y���t�uo�:��	ev�{$w_�k12���׃����{���T��<�����];�ܾv/
O�T٪�C�/
g�Ԉ��/���2M��'G�2#�c
��������y"��f@�>�d���]e�t3�T����J at I��O
w�98F�)�� �7�Y���=�� �G��1q�	�y�-����r�ka�̌Ҽ��ڌ�*��6r$W©h2
+ǂV���X�.5_j�YX'��}L�ұ���o�qX���f�
+Nl����h��*�"�te����
[\�K!ND(��h��`�3��#�	x~8�%d]�ea��A�
$�ř�u�ɻ��X�euc��� �)�K���G��q.���qj0mV�D[h�r�
+5�v2�x�Z��,^�N*��9{�C��!#��s��/L����
o�/�2��Ϝ9*d��LC;����A����;�%%��8�v�7�e�E�>��sf����e�:)%K���ȿژ�@6�8Tu!���z����vc�5�ޕ�XF��&oN�KnW �k�`V<����O7�Ώ����5-
Z*��'�ԭ8
+��}u�'���o�ԯ�)<Va:fƇ6��6(=m��
8:����p6��d3~_�V��F�=Z��/k����U�Lv�Vz�E)^~gg�
>��Ѥ.��1`?MǦ[�{�	ߒFտ+wү^ƾ*y�ߪK�".�Qcyt�+>c�M*K�S��K�&��j:.�lf
E�
�J/�
��F�/
Y�E��$�
�p$�
�)��ꨄU,ev�,�@&�*
���Q�ײo*��:��d�ad��0�
�܈���P(�5G;F[������ƞ���_K�X��Kr�E���}��x�S�
NDE
3��&�F��R䅔�$дk{TSw3���gu���R��T[[Y�"�G`,tƝ���j4����r��,��:E|�:r-
3��?WrC����3�.��
1��ihY�؄��;>��	���Ñ�~c���
�^�ѕLcv��׊{��-�pB��S��

���(O���i���
�
��/��������u����������<M>��J�G!!v_�}
&G����2��X�%�LIis�{[Z����׊�?	�
��!D"���f���3����
$Hft��Q(e���Xv�I�
����D�����U�������
�8\3:����5�c�
h�P�Ƨ���;�����حf�LsE}�����y����<-67�

2y���v�>�����^�w�U緇d,1m:Yv
7��7�W=~T�e?��p\ז��
�;V �FB2Vo�w�DmI"��ղ�F�M0G*�u���:�
 �|U�/�T;u�.bڟ��H��.����K�I;��,so�x[3��	x��
+'�b6e�� ��o��%W8س��Ӛ
+.��-�]4�b�KB��5����3+v%hqёf�JY�-��DS�NMT
�%P����X,]$g�*͆��s����qV"�C����:k��֩�G�i�u��T��W��N�kz"Q
c�(��+�M��'.���*��W&�tR$a%��,`��	i�7vw��
�7
+
+3�R]�Kzp��O�
#���Ș6�7%��� �YM�(-Q"�mM���j�
`Ƭ#��#UL�zܼ�M��=p�ߕӘw��Ï��]����
kk~���9;Wɬx���t��y��g���'
p����u�=�
a�`�I�tR���l$l���N(��l�2�A�1�cT�1�ݭ[�JB_���Y���cj���T<��_�Ž����?��<�q��+�r%f��U0c3O�4I�AGp�e�;�w��䒫�r���Y�wI�-���lhm,����M��"���w�����
nL8TX�*} %���y��y�'����N�R �=�ې^��l��Mɧ{|�8.vD
��.pQo	W��楔�?RNJ�Z�]��p�Æ�"GI*՞
+�!��W
�U�$"���
�<n�M�]{��s��fnFk~�g uk6��
� �
�
�wF6M'lC�����Λ�`�Eqg>��tkX_���8���ً�0�q�Ͳ���1��E��A��VD��K�]��d$>�%�
�����n�:�R(�K��C�;�8�DF�
	R�Wkǻ~�$"h6uXc�X�y��Ϝ~m̑ߞ	�3�z�ՌQ��5U�d����$9}���%��b�t�5����|����u�t����K#7����O,�w9m{�F

�|9�U��(�J���+c���
S\����W
�
���͜��iݛ��񗼥ED��P<
ˇ�_]�3,m�;��)C�_�o��ϊ���
+�*�sj�����z%&a
���m�����
+G%vX2�N�{��F�/e����c���Wʼ3���N�!�4�e$�
�n���z�&.z��H�-�R
������8\1�l<P�('ٴ���]����xM�r~�+�g`�iu�Kb,�݋#T��?���ķ���/^��D�*.͍r�r�ըԿ*6�qGU 1�&O�9����\ta
�8����f���¯fuB�o�Q�%a5$��
#�'�Z��HG�T�
+�����[�R�l>%����qwR��gZ
C�Ъvuh&Lڿ�w��h;�N�$!F�x8Y�,\T$�a���́�/(e��Ğr��+
dž�SL��!{>����9H
&�Y�
]��1]֏�W��9b�Y�(}�
mE�~9�c�w��BtW�蓛�]�;]
ۥ`�
+{F�O�"�����{�!1k��~;8"�b������Y:)'�S2��_V
O�P�
���Ǭc�����Rós��י��b��ý�%�tͨZԣ�?$#��M�e�	���Y��LH�6�I�T�-J�B���
�K�k�:��j>'A/��nl�D�wKc�I�\�Xnv��$�>�-���*�X1�����Zٍ�O:(�k��}
���46�9��9��������>�D�
�5k�p���5o�� �l���Y��W�7K��"7
��PA��u��X)��z>RUJ^.lꏷ���t�Z�0��]��K��p�NUQCbUQ��n_�2gt���9
+*�W�~-`�����T����o�
�:7h�k.��{�8�׾8��_o�洊v%��J���A�LnY3�o��щ�,��1��� ��ߎ�E�~*���$�
+��(�`��kh�`�
S듎�
�iLR9zX('�|���ֶHZ]�"�c�C�>:��$�w��5�[�Mm�)0���
�a��&^��Zxۭ�k�-�T?�p#΂�ËOE=q��i�����>;���n:�Cm��Xc�;�C��(�3��y�B��
�bj
�D9ʬ
>$��jlC��%�	
+����6�'��H$��>��@[{EN9nX�P�]���I�tB٪n�D�s��������BDl
��@�N��
�
�$�
Ҥ��‰
9�
�<������w�s�2o��Y� g�V��T�孊u�~~�Qs|t7�((�HM����G������	s��,����\�F
��u���K[�d�o8�8�|p[L@�bn�����y�X>o��O�PA!�=�����blS�#Ÿ��N({C�
FXM�:A�	�9�<�Ã�&��HC�����̤L��ݽy��d�;݌,��!����t��›}%!e �g�\�(�l��B�i��$���ƃ��em]�Ngm�!���
��P�t�Q���R��'R��o��;!����.Y���
)P(�^�Y����LT� n:
�l;�-�OC�bRZ�DŽ�,�k�kc�[�@{��SW@�`<3
+��^0f��y�B\n�H#c���ZE���>�bB����3.Q�"��ݰ�Ɏ!���վ�{8㴺_)�׷he<���	Kg��(�f

�m�>dKSi�o�[^k0���@3��|ҧ�-JA�
��F %�]bI͖G�QD\�R��N&)��k'�
�A)Һ�TQ�.��0$�F=6
�WD#ݩ���뿱��/��_j�Ŗ���e�`�"o�H
/~��	xx_�ʼ�r��B��cˌI3���.�48g�~O��
����s1-����v���[��3��T����9���7P`�$��j���1�*Ghk�ѝ���="ÖE�%�%�ma�����x���%?g	b�k�~����ÑH!��ȇ

�s�_��f������qL
G�]b�K���ys���ypK�X(�>S�gFl��F��ܾF��^���'$�m|^��@�Nu�"m�MW˾�oJz�/���:�����&<5[�s�˴��z{Y��RF{��ci��vm҉d��P��7|��9�ە�����w������Z��|�) [...]
�e�OH�ӧ$�k��6B�E
g�������<���L�cԽ9wpGrƂ �B�v��_K?����]��
��C�cp�T��
+M-��[���ȑ#�
+4��=��,�,�L6?}v���
K��Ҿu_�/.
}qK������CH�͠�3G��씙�/�m�� ���$��3�����Qn���ܳdi�����e"�仞���@6�BW�����|����2��19E�cp�O#w
Xs��	��{kd��
��
jܯ[�uH*��v��^S�ω�Ȣ1�l}��Є�9���"A1�'%�K���F(�~�|��p��m���˃��_I<sM)�iF�m\'�R���UC`}�CM|�%�UDכқ]�R�@�"�0��KJƎ¬��5�����B�G����'�5�ꡦ��Wbc���1ǰ^�n�^��
T
��I91q���a��r����u�%�n��	�
'c�	�P���[��T���^I;Or=�t=�&Ѥ�����Q�"e?#U�+�6�8\����F�
+�g)=�J%v�\�o'p3�l at l�[?�h�5�I���kA�����GgT�.����W)��ɜJO����
+��

+�J
�m+>��T�n[b�(�k�Z՚F���a� )^g��<�U����I�������b�Ψ�y��j�*�֣}��y\��,���Qg��8
+O��(ŭ-2 N#�+�F;��'$PJ���4:�
�>ir����=_���݋>��|^zo܉Z}r�Y
�#v�y��>�M�T
���ܠ
��~:��y�|���K�u�+?��
+�q��[5���k�X��h�ҡ5/����S�p
�
�w�y���hȋ��۟ �S'���9��S5jXay|~�S���"�GQ��j�l�����������˦�/~�%)#:�5;�����y�8 m�f
�N�v|
�)o
+$�uig�#��E>�	��\��9%�>E%�FoqY@�M��������%�j�bӢ�'o�u@�W���t���ԯ�;��K���EZ]H�
���W���
:���؍ ClE2Dz
�<��`j<�D~s�������(L� X.���7�a�r
��C�rL3KZyj?�Ç�E��h:q;o񾎎J
�͎J+s��U�
�lj�1UK�aJ(D�|�
]ϠĄ18a�Pi�Z�ق�2\#��
<���願��4Ϸw

$�߂�H�x
c�4<!
�\jg6q�Ck��*��*y��zaWJv�ZJ\����ke��d�3�;"���x�r��bu�T����& –C�V��
�W���(l����_}W�M�����S��լ*l��q%}���R�����O�*�Z�0눎��0�K�ǛFJ�}{�J�RR�C0��59J�I�x���	��H^�A`�Y�n�u�^��^̯t��>He�)~Jf �gbQP�
k
r�1Q��M�eD>���^Ļ��DWʥC��1/�z�gM]>��ٹ	�p���Tf��WET4E8��%��&x[�#7�{k�0�	4�hy�����4�z�_ۋ�8#Z�eϿ&x��\v�8��*�%Q� ��
���Nws�[������U�8.��L�B�����we�)U�|�R{����鵄(�`]�ȵb�{��
&
1~��+��%���/�;��t��C��g��u+�J�N��C^;�\�X^l1��w)"���_�"p>�.�"�c�����[��2
�?�~�'HC^p�
�6����
�e�
�8��:���vv"�t�w����̰Z������}��tW7$8i
/�ҹo�
���2�/�氡*�{
f�0���	�@y->�-����^3yP�����Vrk�jO���j��t�zx$�
m�UD�AEv$+�!���ޙ�9k�nK>͛�ݫP�f��
g,��/8%��#~��LdE|7�}w>G8�}��,��1
��
�ә�ψ���|���wbjLs�h�����Z�:ϛ��O##7���L��w�%-�� 
z
+N���R�$����`�Y��{��y{sT�eT���U��
�����͸�&NK�$�DL�b�r��؂:�k�x$ѓ ^n�O�\�|�T�Zg {�F��6 �M��b�}2��L꫽I
 )M�Y+(Z���P�Ҩ@.�I�6�u����\X&�7m҃�;��Bs��ĭK
ʐ}8
�M���$�QS�n�?
+�k(�F
+��a������d#���TS��
�ľ��ߵ�Z3��f
+�X�G
Ǝllۓ�!�]�n��\��\�W�
8^�:��tBp[f	\�h�7B����Q��?s�TWb��OJ�LGO+1��/c�.eJ�@Q]gm���Q�v�ā��Q�4Q����'?(���^jH^�����Rʑ(_�H�쩭k�g[H/��A�i_�n't�Ϝ3�
k�#P��3�Z�ܜ�GK�B�ʯ�E#ݪ|���143D����2���pr�O.���F�ă�
+�)
�j�;)|R�e��
iy���e
�C��2w��-�n
+�y��r��n9�L3�
�ǂ������5���rR5�9���i5	�!���c͗��J
{?7��UCC�x� ��}�Ō����
mJ�O��O1L�<�SD��W
+9

M�xx�TWI�o��X��T�4��7�g����?��
���KO�ġ�:)����e,����	�܏K���Z��؎�FOX6+�-+
Ϣ��2d�,W�1-�qw+�7�qO�A�`�oV�s�[ibK�>�9���d1�ۂ%
�憭dW�4�碥0��)����QS����`�������_�&�3������r��BO8�>N���i`]�+�!8U?I47�C%�eV
+�o`����
$g�Y�
+�{�?Q���Eog���B��;N��\�~��}����%�N�t�����+���)�HAs�s��@��U��wV��|r��W�U�����b�#�@)�..U|w��/�=%�-������XIx�~���n���ը٘�Hj�kg��"E�Xt��,U�Kz��|g��L�3�y�4�b�S�4������
�
n�
���q�^��@���{��FҦSޝ���o��ο�i8*p��+:�u�	���W�[=6
+հ�0,~%
��
��na��=�K
��C��U�q�H�=�&�C�҅�\?}z��>Y�#��n��}QE�����\l��#���?�8s�~�V�w�:�9�B(F��5:�t>�����1��G${�0#��˗O�|���U}��QL7
c�K%�5��Ep/A,�?+6�$ߐVYH�DŽ�m��N�gI<�g��߮TG&�ي
o��kZg�RF��\���u���D���Gt�o6���J�c>�y��g�>݆�6Hݺ�
�h</��44�z�Rj�����p^+Ph�����2�m���"j���@;FL{T���C������t(��k���b#ٟGϟ�
�]%��ֹ��b�]1I�xs�
�����v��a�P��i}�ZF1��	L���Cb_��?�G��^pu/!�{oh���p���6^� ��&wD����r��#
+Ɣ� %�ɣ�
uW!)@f�Y̓����n=Rk�
�<�/�a�$'�E��B��~��C$̘�F[3R
�>,���wY�z
�����7��Y�r�m[

+�Eہ���D�t at D���S#ڒ����-��r%]"l%e&��lV��z#���(
�j��C�rߓ���L&�����z6�>����0����K����	h�`3
�v��/m
��
o�����ӷ�� (�kiJ����������̷O>І����U�X3�����_im��
\���[I��ҥX9q�J�~)r��Θ1x���

�-���x16={�h�k%�|�U�����!�Ms��^R��B�
�%�U�C
����� �rUHdRُ��m$�PC��+
�3�C$�=���
+�`���y&jA��N����
�xi<��|�sT۶�;�Sy`����~��_w}16uJ����K��E�y���ֶ
\�i�O�*�7
����T��?}��*

Џ]n��K�+F��(r9�
�{��[Y���E�]
��u:���>\��A�I��;4��ߞJ K����������Jw����W�_|�`b��V�
n�2�պ�t�����6)�,۷�(x�k�x+�E��O|�����XY�^�������5�I9Imo.�
��$�q��i{�����*�&;�XyOw�q�/�0�l��6�ڑ�^��JKh��WpBk���[&,��Bk�XԻ�fwO�>\����B�
����>;��m�l��
�^�7ڝz U7�+��Z���:-��8�(��8P�8 $5��(ȓ��ld��m
4����
���R��K.�{�B���T�<���.�
�?�+i�e8�C�V�Z�h�4�!^v�k���ZYZ�AWTW��T�0y�}�(&&5��;�I8�Ow�����R�ٲ*��N�h�x�Ų'&P�WS��yL���݀*�� �.���I��
�+
K�ʶ����G�֦8�ީ�\�1�|�0�f]��I�@e�|�8����ݑ�����hAz\|��4 K���Q"f�-��e�W>�J\-B����\��5�c��B��T�<1��#��u��ʷb98�@!+��F��`���3?���G��O [...]
+�0P�'�Q�ԅE����A��鑶���ݣ��KL�<x̡.�r&Ǥ�-�'�@�����ro�9�����N��OP?�ć"�o쏭�f�W/�\^;�j/Rx,��]Iч
��
���=�Gz6Q��Ӹ ��H��4{���V�1l?��A�1���S�]Bs�]�=��ᦴg�U�	�Aa>BT�H+Q%C;�h��7�sVy�ŕe>��5��L���`�~���=�.'
4�o�	<gE拍t���wA�T��,'Gb��8�J���
+�c=�8��t�w�Q!ۤq-98\TK�`�9v���� 	�¢`����Hc�4�H���	�
���H���J���ȗ0N�
+X
+0�6ǐ�T5������������‰*� ~`tK�	i]��3~2�
{(�����d�C��~�(��g��;�q�ϺD���bS7�m��$r��)��X�'�;�=Oz��؅��wn��!�Q�W?�����ƨzH�~Y$%�Q��6�Č�;2�
N,-'`{ߗ]�����L���u�Րzc
n��d�t7��c�h,�>��ztB���5Ւ1�c��
c~	x�c��
�	�p�BFChj<��+��}��&��?�c>�)
�dS�~T)C&���qz�u���w��'/
J�v�Ej�\��n�=�z�ˋ_#H�]�8�7��M��
I\�z}��97�����E��F�}n��Ѣ!�L����¼�O7�7�vH�Y��'�
]�4�ҙ�^U;�N�U��Wu���0�@�Ө�^��#昱&`�H�؍�[�`+���.�o4ǘ��5L"��c��A�
_t]��{\�&�^ƪ�Li!��ɫ0��Y53��j�fK�M�8�
�;�ʋ������K�Vc ��mo��iy��G� ���.�-����/�ʲ38�-�c6�#!.D7��Dt�fp���p,9RgZ��)b
w-�޺��4�a�p��]�.Fq��dU��dN�%\n�O߲a�#
aQ��p���9��=q����;���moT�ϪIx�"��������3v��U���M�bzE~}�Ox�_��atE�Ӗ��	
Jܻ�K6�M
+i�gs��B8
�f�
N�>���N�Oߤ�d����&�?�N�i�=;ˤ�=��� $8�^BH_A��ȥ����Jm�W�d�I�ݹ_�(������,�!iAX\�^�[T��|޷�7�g*�����q�)�
E9�g�ɍ
�.ѩ�Z����˄H���,��X�������.Ԥ �3qlS�/��9a��Z�Z� {$�bA���UH6U�sѩc��o�wܱ�s
_TZ�����#X<�X<��>���I���m����b�����pl� �]i��~*~����ʫ!���npvB
+�W�Q�l�Ķ�D��n��K��Zᶤ;���L
y��u$`�[<��2ɴ�U���Bnҙ{��z��I��Ѹ���^�ABg
3={�Џo�1$�>QM�P�� x��W}�>h
91[J���_�OXC�
+댪��S�٭3k�a$~_6
$W���(�;��a��Y+�P,���HU���>\�A��"�'���Jf�4}/-ob�}�h^�0�UxK�����f�[
z�Ӫ��V�?�.V�ǝȋy]���k����N���J(w��
��[���֟4q�,8L�4��,-�]���P]Y�
�&�σwC:ʋ>u����
��B��l��D5Dz�w��!�e|�E��W��lc?�
�5��9�]��|ˬx����㵞�%$��]2�芒�q��ި�Fb��}�`��Mm�~a��MR�/!����NvbM�Mnl��dL.��V/��iPJ�ƅ��*sZ;">�}P�$|��7l��P#VN�~?�B�����cH���,9�
�⮲Ξ�i���(9��*Q3,�ӯN�ͬ�vk>3���g02���

�Sqӄh��G���|5� ���9-�Ĥ����U�8��9��Ӝ�F�#��ɭ_�RP?
�r�k�tt�G��
+endstream
+endobj
+3400 0 obj <<
+/Type /FontDescriptor
+/FontName /GYIKAE+CMR10
+/Flags 4
+/FontBBox [-40 -250 1009 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 69
+/XHeight 431
+/CharSet (/a/c/d/equal/g/h/l/m/o/one/parenleft/parenright/plus/r/s/two/v/zero)
+/FontFile 3399 0 R
+>> endobj
+3401 0 obj <<
+/Length1 1571
+/Length2 8204
+/Length3 0
+/Length 9229      
+/Filter /FlateDecode
+>>
+stream
+xڍ�P�.�S��h
A�Kp���ݡ	$����]�w-Z�/�(�@�G{ν����3�Mf��-�K��g�Q�b������`P;H ��� �x8@ nl P���%����T�zi8�
� �1C<���� E{ ��_�K@p�@B�2���2f�K�
+@;c�a�
p��
��
L� .!!�?� I0
ba��!l�7Z���`0��B0�� �œ�nnn
f�
0��83�
��h���pW�%�w� U3��8�� m��_b-���
<�!`��
�
<�
�RP�9��+�e���5 .�����w 􏳙����
��Z� �`���2�
�0�Z�64�w�=����A���
�$n��� �=��wu�p�#™�b��B��a
�,
���98��g����@�`���{p��
����l�ZZ�.��őS
+qr+��m� ����� �@ A! �	 v����
\���G��[�����#�`�P�b~���r6sp���?����� �
�
l
�b�'��l�~�<
�0=�
 ������[�0�����
�SGWAMS��O��VII��^��  ;7��%�x8��w������H�� ��OD�
 �W	��W�s���ua��
��
�L���1�d�����L�?.���
��B���G����������5s��{��`�
�a#T`{�_S=�_K����8��Va���Pk�7�,q[�C6�_3xo���aΐ��
��
��îY�=<%����?��_)
��Y��9n>~�
n��0����zXNK��^89�0ă
�<�
��{�B N�ߢ�� �����w>����\ N�? ����k�(�t��z�|��p:��8���� N�?�C�.��d�t���1.p��c�]���2���`
��9��H�m}p�e��S7��q��^:3��"���3��&;p
�C2e�=��WY��KԷ^{m��a�I�~yߘ&hNm��^�$�(ړlx���]�Ŗ����n�
jr�"0��EO���ҭ_޽a�|�c�ܦ�V
��M�4{�N�q@�'`�y�,9-���#�cw�O?f��&�X�}�cx��
7�c�f=W+���{(�)
ɟ�^}�b��NU|2���x
�1m��s�C2��6�禪�%|��pB�����D!*z��e�C)M"o��⺻©@��3�Z"�^�^�
�r��f˜��!٫�����q�]Yq<�R��<f�覈��p�e��V
+A�g-5�>�������i�Dy���S������a\�<�����
s���8N/k
AE�axC���lN�ˑm��N�$X���2&������MW��h��z�g_(��&g�ƫR
+^[g�sk`���ly_Ks����5~���i$���TR���*��
�Xe��U��wd2��X�g�����:�26�?M)�Pؑ;��x,紬m���~���j�;ce������R�Z�˼{W���6�72��>�*��^qDVc�����Z���'�2G�oT<�A���U��ʡ}�Q!�ȯ�c� 
��
s�rA&u9�y-`���]�5�F#�05l2=��\
�6<��V����l���^_��l���[�v�5���1�����f��R�9}1l�d�V����Y�
+U�'���
��UEj�e�Hi}���T�a��v�$�
���绚/����Ȏ�8;&<k�
+�L�ʫQ l�s\'��x�e�.gʏ����
ѣ���Zz��#�b���by䙙ģ�I������:���_�8d�<����UT?&4�/���ˊ�u�OJR֘�����W���h��a�]�LH��!0Q�W�c!����
)i�ߡ:�̿X7�������7�=xY@#N^w/y�ZD�;�'f��c�:���0)�e
�W g�6?�Q�R����O������[
/�
(�Sw�n���R�
��M	eh�*�4�Id����v���4EBU�
��I�&�	���HFB�poa�n�I�:��-�Q��f�_$_�
�����
�0�~X�E
+Ȉ�8��_��Bd~�ω�|<��A.��e�S%�� ɓ:p�H=��`H5����^c9v/���K�٪CT�oӚ?S��KA�Vl\�h�)�ڣ�/+Vڣqm�M �,KL����0�
�`^>���H��
�ib�:��� ��vS��`}&����f
�H�x�W��ՂD�P�
+Z4�3�+]��X]�v\
��x�c�k)���Zd����|�vf�`I��aϮ�^�7�ez�+&cd���f
���He�{�����&)vŧJ���K#ͮ
+ߦb����Y�_'����
+�|G��O|��+��nE�`�OV�/kp
i�9�{0i�i���:.Ի�"=N�L����

�$#1=p�$#8�ߩ
i��r�s1��:��ވ�9Q�;Vw��AE+����}`�9�SI3���,v�<�^�Za�l|�
������
�õ��0�%��x6�Q-皐���J���k��B>Z��W4�So�Ϛ��X��Qd�̄.����e�u*2�����D��s)��@U������nE�W��I
�y���
i'E���v<��$&-O8~����r�����lD�KC0P��{=œ�gU�-�1>u���И��c~T�8��ېswm���M���
��
��F9Sk�y�ғ_eK�K�
-c���v���C����YS�	f�}jE�7�%�~�{����S�W��q|6�ܪMY�i��`�➴�lv ߵ�I�d�G*����G�GO01&9��}����K	5I߻�G
a_��b��?�d��D&�P{��?s�L�������%[4��tl�y�36��dZV���3����	�$+���{�&�����~�?mEi8�+ޤ�����G9�R�c}���8��d��d-[P!Wi���<{_��&�4t&��G;u�'��/b��g2�L;�(3BG���y��
��0A�U���ZX�sb�9"���T�j�:�e��K}��1L:��8)U��UhQ
+�K^r[����u�2�|rr��
W��&�\
����;[��2��FRo�;�G�[nJ���[u�߄?w�^�pe
XgX��#����Na8d���Z���H�6���y�\��.�Y���c>�V'�N#=U�B*���@�ךS
+b����ɦ�
�T�z9e?�6�/�L�;��K�F'�
�:�������/	��j,\ƻ�ǮD
+i&�
+o׫C��ib�1�\���0�

�1&�M����Q��jK���;R ҳ%]����Pޟk i3[�/%{�#�����rҾ�}
�m�/0@�eߟ�Sn����a����s�z(�[�
tG}*�n��*�����Z����P�Rw�������~��o��(Vk'�J,%]�E)l7�������r�����H�
v+�

+�7����p>^~u�����@i=ڳ}q�
�EwS���9�����E�TMRac�8��F�
�nD�-o�<y:��u��	���z/�c^H������#c⼍6��%k���
+���/D�,

�N(��P��=u�;�c$�8��DNؠGu�q��'������{����N�v�{EV�9��g�O���)����:ī��bkb��d�5vdWL�O��W����=
�.�o���̈���#QHky�oe������ݐ!�1�طG<�����J�����=
+�W
ޖIv� ��!b�)=e�N&
�x4hqlc(l߽S3
�XT.S�'��YM�q�^�.GCv
��N��ܑ�W��J�fp��߭X�"�먖�SG�/��7M�]�d,O���{V,CЂ�x���]�0#C߹���o!]��g�-�B�R?�޲���
+�
>���0�[I���x��
5������87�
�[�J��=�
+}��=���k����n�[6l� a�|��^��Q�
+���ј�E�Q
�9��EL"ez�Tl;FG�j$eJ:̝j����.�<�F*��C��.��{+���O
+�Cs
+��wI����5
�I���"X��LD�/��X
<��A���*��9��Su�����GW*�R��ښ���ÛG��+4uK�V��r� k��
�
��(n	- �w�9����mZ�*bPX�\V탁��"�}Q�alR�ν�Kv$_��i
+�ُ�ӕ�_��7�j,p	=9w���y�6lI�Xz��+"�g
�3�UI~Ӿlny:Z�N�<pn����k��7۾����y�P���h秼YJ��oB��Ȍ��կŃ(���4],���~̀V�]s�O��D��vxn��|ޙ9�����z�����`-�}�@A�7Oa�۟�����lg�<��v����T{f��Fg�̱j�#Bt��O����O���K�`
��0I���I��DzE��"����#�g�گ#e�����*f8c�
�[���X7[2���>ԍ��|�o�Y�ϯ�Һ&;�V� �7�z�ol_�Q9��e�Ɯ�\��nW7�nM�%���uy�\��^y�~
�@F�d��g�u��˫kǰs�Z#7���dy��gͮ
o^�������'��f)��
���xO�RLӝ��1!
��ҭ�Ad
mҵ�%Tg�/q���
c�WKhrZ{#��:�#�+��C���8m6"�X�
+����E��T0��a��*rي+�V�h�����������8%�(�P��u-.I�6�"

���+�'/JU�����KJ��=���BYk�WI�|-���u�k��F�u�0ω�V�
��!�iQ��:�&�;XF�V�&k�O��ޖ�h���]z\h��㐎}[����}o��a�G+Y^��X���G��U�q�������~T����^Ѯ�h��$=�לk�/� ���(�7!"v�*��;>�Q�
���"�>��R�����<��d����<T���Y��*����{]F��b���k��Q�uS
5��\L��i��T����o�����GA'�SbV��OEj����2ū���es�&��HC���={”�Y��Hu��0���U�1�
��yGo�
t��
+����f���
��\�
ο�J���"磃;,}a������3
KSV�Y=��bP۩��)�*���Q&6��� n7�
Q�9�E>ͦd��S�Iͧפ�
+�v�Y��z`O��ӗ���G��]�9P<�%�H���[�"Y�H��3��g�{,Ө��FY��s�De���t���ʾ>�>@���v�s���i�f$4���U��X`N I�jɅ��v�rnф��
+��#�S���B�CME�13*[H"�.�L�n[s�:8��ɨ���(%���
��%�=��
}��p���l�	H��T�17k���ą�|`���yS��f�W�'�2<v:)�F=��l{�s}T��l����px��a���/o�19��
G���z����
��fSK��gg{��7�Sgi�:�CM���bI�`��\[�jZ'R�4�������L��=�����ky�e�h��*�ܽm�Tm��z�Tg_��6�x�%Bgc��$�[�Fz��0�W
7��4Q\Ml�
��Q��L��0ݘ�����p]�;�z��7�ܨ��d�QW�!~fZ,z���YηWM�]�D&�B���F� 
�7���E��Hh�("s�K&{�
��A[Lҁ
.����(&�-\�Rq.Sl���d31Nf�(�/�y��g�~���ܬ�p���i�BN�ބ����+�?B_�y�3Xt�p�RFy��ӎ����7�F�b�T{b/=���
ߟr�t^��d(>��/Yܕ�Ue�k�{��c��ך��*�1D��n,%�(:���$,�պ�ː+<N�?�w
”h
�U�Ωڬ�򘣇
�[�����ܚ	/�1�
�w��ʋ�ufA��h�Ε��#i�]�r���`�d��OHO�u8�o�Wl����4p�5��I�s�=V��eIYz~�wW2�����R��������f۾p��h?�՞�Z���!U�Z�=�1m������g�*�G^�!]����"�H,�y±{���R�vf����
S@�m�XE�a�
��2ǎ>g����E$Bur,	@�'�ÀABY��n�W�6!9*o
�O�'�Pb������E>��D�0`�ls+1��o�C�gBӾS=�,�
j����fy�Ꝧؕ�

�D|��~�t��@�C��}�i�i��ղ� [...]
�p�

�K�͏j.!�BK��vvn*N��v�}cl�,
�
�e�9j����%���wZ����5�ʁA�i�T��p&<8���L��%���~��x#���5K5��t��� [*:���Ï�A߉�_��*�dCG@
�mE*�ɫ/¨��h$=�����3ɉ��Rx�l��,o���d���^
��7�빗����?
�F��`~}
=^���/\T�c��6N�RЌ����,�%U��|�Q���C9�$p%[M�]r�\Gz*��V��xD'xU���H
�Z6ઝFU���5b^��"��P)�`�ǯ�r�8qoQ�rn���G0-���
�i�t�|;Sɵ��ن��Bg:��%��c	����3ǹ�Vz/:� 
��h��B�8E<�ܫ_9���D-��<.��񈥙��#�q�#��s2�eö�x�U5o��e��$�9ߏpFWI|q��a!S�Jt�I-5 at s���ц
g��Ml���HZF�b���C��4�p�A�Zm��U��%j�R�kN-���gN/�xD4M}��˖~T���)�X��7VT���*Z���E�TE���G����Re [...]
+��Ԫ��!�2py���Z��w����Uy�/7�%e6l4�V]*RF��7sѠ7x�w5y�°}aMGw�N '��[}~�*�R��(�u�`�-�e
+s$,�%E/vB_�{9>$8��ԓ��xd%�Mԏȱ3l�s_�����ъ]X��u����s3.X��:�}�^���`Jg�B��,k�B-��w�+׏^9���jз)-�����;�^L��
���
��w���زr���z]̏�p�^��t��O���7����N
8�2��w:MIh:�.Y�3'Eg����u2b�CM�
��>T����
��ҟ
�E���$�yms��S��z�E{�/���3OR7�[������v2�Z�i��OqM�I��k{9D�w}Q
�@){��ܬ !x\eV�G�X�8 at X�)Mg�6�r����!�����ͲKLj����"�ƣ����o��Uu��?�t��z��^�۟���я��k�m��D�U+
+�k�G�r7�Mm�ԫ�z[���ά�
ܪҵ&��~s�*��OxݟV��%
v%���f�U/��nR:,N
G�O�c^�P��������E�jS�UY$�7�G���qB�o
��:��I%P�3������>?�v��`��<E�u���x�1���&
����J����c�����D/{=����r��`����$8o�Ǵf��S��H�����e}HQtw��f�9eT�B��dŒ��^��89�E���0�
�]]�J��7%��).$����K��=�҈�;���
a|��}�@�+XS�k����(�v�� ��uc����s�������eo&�>n��c
P��+b ��w߅'NQ�P�Y8�i/��}��Q/l�~'�Ou
^r�m}��N�~�R+��j�8�I������XM�g�Ԏf9n�K7���T� %ry�}�xr%�'Ս\�i�j��5�c��Kܹ��%LE����_�P��(K
'^�y���i`
}�i���\���)-����5<yVP
B$^6�tµJt�ߟ
F��o@@> �5 at w���9?�qNwwP^J�p휪&��3��>_\M��,��vh�s��O�V�k���ͺ
?HC[�pձ���| T&��lx�K���D�.�J��hH��Ĕ3V�鄹�ɡ�:,��1E;M��5Q>�u�3)���+
������>�#�
+	��.;{�O���c�q����a4�ѥ|X���i��l��Y�D�c�Ҥe?�cB��l:GY^Ju�N��
���S��Y5iݺ�[�m���+�W�|Ê�ˍt����
k�r"���ƅ��J4��v�����_x3�Q�Qp{V�����jӖ��
�k��Բ&"��p�*�UŒtY�RU�+�k�}-���9є�
P�?!�CE	�s8�̻�10���ܜ�H��9��bTKD_�x 
��d��o�ߐ�[�-:�d*��	4K�
���/��Z�(���5r5dXJ�CtSc��-�M��%��#�
+��@Z�r�5
~v.��[%|S��V?��ڠ�gDE��TԴ}	��M(}��,���� <{.�DqI@���Eߗ �e�|͚�H	
+
��^8�yM)7_M��'�"���
+�rR
�&� :_Ic�%iߨ�_�>S֏h�[�*P��@8�+
��� 
��j���:Zc�'��b�Q����r�6�(l~ͧ�S����jo��	@8z:`c���@��e��\:
�q��J)߉Z���%�2

I��?
pW6zԩ�{��
��e��ns5�0Mb�4�K��uF��}\�	��f���{�3{?�
_���P�P�f^�H�N$��B����g)�1 ����
Q�h8}� ���Ġ/`Ku;M��RK���
���l=RN:�H�������`���^�>hW�B䚼��e6�y������wA��W�&�s�z��3J���)x��h��n�XHҎ�/+����/�9�a��֌$��<�O[�f�L
Ľ�i����U"���Ȝ�	���񡣔���U��S*��Ĺ�SS�Za�-��msX���tv%�,u���:S�D��e��\"�r��'[�����u�)�M��
�Za?[W\��
�� �{��o%tZ��^0��e�Ż���%�b�9(:���*<�a��(?l/��
�M�����N�Q��̍�	,&���@��H�v�,ܶ7����:R�S��qW�fA��"�\����;o��`/�v^C̤G[P Mm&�w����Wp�ڈĨ5�J��!	?�"1�����$�Θ
+endstream
+endobj
+3402 0 obj <<
+/Type /FontDescriptor
+/FontName /UVIORO+CMR6
+/Flags 4
+/FontBBox [-20 -250 1193 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 83
+/XHeight 431
+/CharSet (/a/b/d/e/i/l/m/n/o/p/r/t/u/x)
+/FontFile 3401 0 R
+>> endobj
+3403 0 obj <<
+/Length1 1622
+/Length2 8597
+/Length3 0
+/Length 9652      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T�.�	�P�w.-��Z,� Aܭ@q
+�kq)w+�)�Z�(�{��zoe�d3�g��+LtZ�\��+�����
ʪ�A ~n��Ĥsw��)0@]�`�ؿ�P���L��`���U<
���@^!1^a1�����*�{¬���@
�`�E8���l�����d��yEE�9���v��� `8P
�nuz�;u���\�>�sww������;�q#\m%�8�^0w;��
��	���
� ;A� �
`������"lܽ��P�����
.x�������@]e5��3���ڟ���J������_�;����
�@N�`�
n
��9B��
+j����@0���!��
�p�	�9��

�H

T�������
�
+svw�v�9�f����C���ֲ''(��
�;?9�+�Pu�?�� Gx���<����6�)X{8���a.
Pe��,
D�d�Pw� �.@�7�s=g�J�������@�
+� �
�������]=�~�V�7���aw�����A
��?t��
|z<^ ������lY#�>����\
Ccce�?����Ax�����\|�  //P����^����H����r��Qn� ��I�v�����L���.l�����x�c(����7	� _�����Ǖ�������2��������Z������s��K�0�
���x�
���B�\bu�5�������͐��:�]D���j�s���9@����{G
��p��~f�\� ���
v
���=t��a��;�<
����s|�B@��+����$��}XNk��s
��#�� � m�������D"@
����|x��y�<п��o���Я
�<��o�֊y���������C�ۇ7�_j> �� ���_P���/�@�������Y�B]���_��x��>�/��C����x̠Po(0;��<
���zQ%M�ŵ9">��i����7���q�����!+d��\:e��`a]��Lj���o��#�9I�����"Qg|�03F�y���tM/
5��Ԗ�����
�&��\<�|�
�O��5���C�ӛ�[�T�oJ�r��ǚ�(�dʳz;EA���E��Nt�?yv>A�3zO���؏�/�3Y�{u9�X����I�HiBA�zF44��'���B�ͯ�`�ݤ�Ga�B'��b����3X�H�d?*ݖ�����A8�bd�\���[β�Jg����YN���4M)Q�G����²��kBQ�*
t����X�i�]c�<i%�hO)S+��ypi�q��k{mx��P���bX���`%]9 �`Ab	��w7X�I�*�eu/�(�8�G�B�����䏿�Sa��qD:ؕL��kz�-��`
;0s&mYHg
�
DB��'�%�
G�
#�ز�R�bh�;�Рb�9�nE�X
ęT4$�����b��K�ԡA�16�7
{m퉇��S��T~�ꂉ�A�.ګ��aWa�l
+y���_�3��p
7��f:�a����GS���o���������
���e4lb��;C��bgЛ
��-�v	*p<�I�g�_ic���P����x��d{w�6�.�k\>�ˉ坡���g��"L>���I���f'`"0�2���q�VHʨ�4r��ZK���K�(it���a�ۻw_j�ur>��dYE�.��bmN�Nz�jyd]���!a5�ټD����Ҟ��
 w��Ҁ�v
�A�>����>ηA_��������������S�zD.��ȵ=E�R�$�X~�{4aA|/��ɼ���Ϡ���������_{�6X�����)m�)1
Q��QX.E5�9�� �oh�R{��:�WuF�Ʃ�v��� ��f��|�q�S�����S�-���?0jP��F�iX��
��jJ�{N���cOp
-4���+o�|7	�d�S��g2+�� '׻h��։�w��<:Q��i���j\�.]�݄o�ʨ1k��r�1����g
�qd	���������I����m]p��hd [...]
+1wq=>r]��
I���(ç`�T�t-0�zS��ѯ���.�H\�I��p��I�l�g�����I[��-�yP����I?����s�74�A*ay��zKLa\��oM~�ى�]�D� �D���s���f�K[U�K�׮O}�mk���Kg�K�s� ��d�"$�Ã��\�N��v]�zo��:-�
���J�4i����J=�
�w�z���^�Mɍ�=x�tn�_VvU-gKo�����}�i
o'
�f��-V$/�7M�� �K�RԎ���USy�h�W��J�2fƙ�������"��e���% ٯ�l���A�����\.��;��}\�0�B~��y;��E�M�ն��ʩ��%{a�x���=�����V׋+R���6��f���l��J���F(s�{-ɟ�~���<s�s)BR�쩑)ۚ��n_>�Lh�7�
˂���]jN̉�;��%����(�C�kj���y�ֆ���y�i�
��m愒,�s��N�zx�����T�H�#�p�-��l���Gz
���㠽�t'�4iw)�Q����
�y�R�O�J膹Zc+�'��(��N ���v}k���o���
���R�
��>(|ip���i2�}WKa3W�66�D�z�K{�RQ}E;pR����ܨ#�Ʃ��s��gg��s
�H
Ȓ�[��e$�����e��+�HYvn�Π������8�>E�Ͳ-����K]֑Icq�zKpf� |b"W��Α}v��G{����~ӌi���� ������6|͋���^���Θ�?����o��L�˷�@uu��-kF�J���'m����ߋ����:&�% �Q���;ɟ�U���_��x��q+TZ�I��)�������JLN��j��l��T��������sU

X�e,�p��X:8{��Te,U|��_,xU�C����jE�x���v�GĘl��~(�4�x�̥���.z�H�*@��� g`��/ny 
14��'�&im5$�x��
��y�J�29wߠ6��ǜ�fm2
p�n��
!��@ѫP��s�a��1��A�Y�#ɚ�0�W����8�rϴ�y��.�V�}Uډ/Rrѿ����A"�8GR����}
�7�S5:%A-�R}�@�t���@�
��DA��.A���6v��?��Ӡ���:���s�1)���:))D��Ž���{��`zQ�cЋ�x1'm�M������2_���W�Q�G�5|/T5�lR�B�FҪ=&˛ϱ��ѓ��M�ԗ|T������e����A��R��'���	�w��
+�N ��{�
�1�%=�-R�.���L9�p�ɰےH+���b8nj
+,�qvWN�i�L���'�懳�N����h�\/
��7}�i��c�F8��v��/L�P�OQ��09���,q��\8#*��AϛvC�ӣ:�c��L��&�Za>����r��0�f��<Y�`ջ�왱#�/b��
+�CS��/�?6is\�Q
+�ɵ����?;#�C^���^���� 
�/o�һ�l"H"��L���eF�q�t��;�;]"
�}	�OK衘�S����.K���r�5�#�<
�P,h���Jp�
+,5:"�@e!-���2����l�T5�xy��mtt�I��*��(E�#�t�
��b�c�p���������
%
.
���
.�h�V������=�W57V�Gf���ᠴ#��D�/�Kևn���lw|���-,�׶������ǣz�T���5k�^�E�<cxQ8p�H�Dv��w����
+�"�;軝��
�g�N�T��O�b���6�╟^��	ק��w^ަlu�E��A�0XV�!�-�W6^+�FSBzW��t�Ym�kqx�%�Rv%80�U1�dMH^2�&���9
���}|~��I.���.L�%*6b�p��D����\j�!!��Ǒk�����p�c��J�^Znj�08wX�9N�e%���E�X
�ˊ��\��]�h��m�Hsf������B��1<���p
݃6��8��y�N�6�H�K�=�%�w�,9�	�\�n���0>L#��2�E��P�l�5�
8G��fb��k���-\����
�;[MNt�ߛ���E^�R�q�.��cV�9��`ƺ呋c����$�^<Q��]��B��x�9b��*k��������Ji^W���}��E�����#̲(��)@��Pvq�C���
+Ar�"��짳ɤ4�:	U���

+�?���T�������.�<�I�Pk�_O�")L��{ϛ]�
�(q�z�&� :������,��4b{K�Y��E����[�̆��y��lS�bF�4��
+5��S��:7<ӷ:1
$�()�
_ְ�- ����,�{���KH�^!�Hˀs�{O�[J�
�O��ҷh���,ӲV&<��wQpfF��2^�%����Uo��'��$��):ӃN�1�v���4]W�ER.��ɼz;���G��;
�p��!�_�}�jI�xo״�9�X�[o��*W*M�o�X�ҢͳA6�"�bڄ��.��ٴ����햳��)�΋ا�~��T��{��_����a
+%�����<��r�+?$Ff7sv�W�;5<1v�dG��N�&v/0�b��3�J+
+�H������C��H�
QoN9�,J�G��f�ې��
+����O��j,OB�S*��s��xO�D�9�%��"��שS��s�^뀛'܄׳Â[�C��N�s����
��w��
.��AA7lj~�ԑjE���$��ǝ�2�VPz
�:ޗ���c,O�ӟ�ۏ�r~$)+}lUG��m��

Z+��V��{��R��{e��M�f�+�#[y��sH��<���av�2����e
�b�o]3=�����Ӌ��]ee�n�ST�a�Yö��%��sϬ>�������F�Qq}|��s�;�vr�GA )a�0\�I�
Q]\N~r�~
+���fr�")�x�
d�T�$Pš>����u@
�튙�d
�t
��i�
(��������(�K����)��+�n������5a��c(!~*�OVV
ў��˳c�	�)�'[/U��չZ��[ja�	�bG��gg�$�_l�h����z�Gǰ����
_�*5[�������
��F�^cT�%���{�f5G
L��_�8�k%�Y="W%�!tG���K�؈:;�$p	���Sآ|'H��V�����	�},��M�$��l~,��qb�؂o� ٰξ��Z]���v)zSw�	ZB�M�Ӷ�=*��\*�
�i3`��2Brg3�
`L��.��b�欖R�Ϯ���^�����$c��
��,Gg�S�jֲh�ڋ.��Jv�2�f�8^�`�jԮ��7G���cC�J'?
�Mc
~
;Q�T	�q���lߓ�8�9�� 
��0�5�9�&�ߦԳ

���S�3��P��9�Y3b�$3�bѠ[ӎ�`��Me$.+ա��n��Q��tǛ �7�CfR��<��C��x;�ⱳo_�X�	�q
+4;�n� �ΨZ�٢�f)�TG]=u	�Lm
+�]E�
ѣZ�\�����2mcB����ؗ�!f4:�Ȝ4������s��|4��슥S�)
�iK�]����� �ˊ���ݽͅ?�)����~kto�	�@���`��9_l`��UL��|�Kџ�
]
+�N��%ہ�r�iz�zB&L?�ǔ� 7����'��9Ys��@�d�
P3u����7���{�xV ��ӥ�H�K7�k��W����d
K1��[��3���%�h}1����k0���
/��%0��
�=k�?+գ7��C(]�9$��J�6$�����*K�p�|	q6�?2lx))q�1�z�j�I`���j`+��x�%:���
xN�C�R��T͊L�K���W�},
�m����&�uO�R[U������p.%�dw�[

~Vy/B���'t�3 at 4rдUk�r_.�ɼ��Wm�w(��%#A�l����OGumd�8n�����c��HU"�6�8e\�#+(Ls��/&d�
^��+���st:���>:9��P�����,�t�ձ�j�5�hY<Q2D�!��mk��<n��",~���{h
5�
��y
��
�n�x�K���h�o�cl���S�T����3�u+�GN����/5�ZlNs�#�l4rWl��i,��{�B�(��]��6	g
��6
R��r��
�[xg���[)0�-ov$�� �?�_*�/p��ӎ!�U{��
Y
,�����Q��.�CA��
��^%��
qE;�MJ��8�
5�C��B���

���iX�[W=�T3Z}DH�y�q��p�u^'79�ę��ơ~5�} �$�1����Բ ��B��a�Q�B��΍+}|���jѡm�V:Ih�ܟ�&�4\�~�A��{���K^E�m���sV�R��٠��Ѭ[4�\}"h�i	2����ҭ��&,޽4%�T<.������N�O��\��OAb
b|�F�2c;�L���o�y7p�l!vNR����74{���"8����%:�%.Ks4�
��Kws��G���|����
�7miA��F�jq��5-����� �y��V����2^M3��v���a�3��[	���~��/O��l�+�0YTJy]�t���e�����+�V
�/���)����8��h���
�v��{L1���t�^~%���bڴXi� �����=�#!!%֔V��v~�6zY�U!o6���Q�6ԙ=E���4(&�ނ6�夿7��lݍʉ�����(H:�}�|Fj�ڸ9�Z�bF#�$������P��|EG}
ً�R�a!|��5���Vڀ\F����˭V�C1?U�����Ͼ}�:
��V����a
$�N�V��+�~�]ʔ�i�6���ۊB�dR�e1
x:Wh���
T�Q�jf-mW�|�BG4�p@�yܫ��xKy[r�+/��KUҏETMT��X�
;�I|�QEK��2��u���ȫ\w�է·T�
�!*L������fu�ȯ;�Qmz�~��ۡ
�%)*/;*�VB�4	3˧>����@�q2�7���ލ0�zg
 Y�j�jk�\�

#"%�5�MP��Tl�ڕ��χ
�{���NŬ������DS�B��?3�E��}�;]1��˹��",	�'�^�l�P
�A:Ɩ��a�ڝ<���Aw9l�i�!
+��Y
+�G�p-Eu�@հ��R�����M� }��
s

jR��Eu'�
1R���;6��Xo�#�
�|�<��r%%�
��V��/#�}��4)���6��1��n8��8Ij]P8l��q�+"�o�|yH�\4���8��!���k��5ٌ@{TUXqH�R�WE-e�B��Xצ$Κ
SO��o�O�4zp>�z�m䒍O�|���FYoAҪ;�t2U�x�q�8�VU�`�J�ɎE�ǀr��_\���]�H4"�r��u���hڜ?��)
Y���p'{�I�Is���{�Q��:����[�yS�0$�ӭD��,�
���p%��>=[ݭOl��5:́H\Ċ[�ힼAδ����g�m�GRi�Y�1��i���K��\z���W�
[L��tu˭�aEw
y�!�M`[�T,<	�Wf�r���'z���
��
+�Y��C�-������+�6��;�K�A��'�p���Ⱦ�3E1n�]�#�Ɍ�y�mRv��
����S.�o�s�=Jc��h�^�β
k��&��*�
��Պ���o
L��f��>[����Ǒ�}
��V<�=1
��D_v|p�,v)c����/Z@�i�L>NJ�	k�=
+AW��;߫�|��Ģ,
�V�ҚϞk���g��훴 ,�
�%+��̆�g�
+�A[
��=�<��l ��u�"P��E
��� k
+Ɏ�ݡ�s<<�I^(�F��x���=u�
�u��ۡH5���O�F+wR��8��z�KV����
T>�Xx�C��]��z��(�����1VD�
C���/;r�{�׌���{�g��v��]k��[��˫+��5bc�v��}�?p���:�c�*٤�mB����r
+
�}�EQ�>WR��
+v
 ����_���B�ə���"�nS�]9,Q)�|-��I~
���ɷ:L���V���w;��jj9.`��YA
�+�J`n[��R"�
Ϙ�?G�������
$|�*ʇ�K�-�֒��z��X�]*���s5��j�oQ
*�Iذ��a/����6
+
�r��*%��~a���O�<������u.y�$|������{���Ƿ�t�k�
{��y�NS��+�˟�47�ˤ=V�]��
$��O��[�t�
�p�
+`N0�
+_],��t�!U��HO����ߵ)D��4L����e���Lz3Y�#��{%��n:KC�d�(d��
`��ڪuCcG�K]�![����g*�r`�)>[[
����i���Nh6UN�L�s|�?Ʋ\0�$���ib��ۋ���fd�.�&��
���e�otv��
ٝ�8k�|Ͽ?4�룐�6ϥc�
f�E'��Ԡ�����x&7N���ҭ˰��w)��_BA�Q��y��XJ����#���4U�����0�z��,��\Z�Z�ueM�D��$�Oi�a�2m���:�
+�l����U�,�f4�:�d�t����tm��K�+�$
�>�EW���������A�g�3#���7�ǭ�31'_�L-3OG&���������gUw�#=���ӡ�V�<��:!�
���ՅԥƏ�ňy��\�i�#����'C�w9 O@�-�����;��V��8
J��0�8�%���"�ۊ��r��ɝ"Z�;h�\5-u'�1܏�䫹�^��/�t�����LOF9$���s�
0s􌎿`	n�ኝ�X�5�L�-k<��[3o�
L%�z�`7��ILkVp���|v��E�i��#����p�XN���f����H�|n��鷐�k��įl9�I���)}i?�|C��P�h6C`R����CG
���4;�������<���;��sc�fC�
X��
���9� �n��Bэ����9׹\�UFk��ѷ4������Dj�CG�TR�+�O*j���Y�Ɖ�C���mb�bv�:�}��+���oإ��/!C�[�{ᶚ�;�[.�+Kj`U,%3�J�R���@*�z��3p�J�+
���ח�'����瑲Xj����m5���8ٍ�
!�ޮ��t�A���Lmɋ�]�'�,�l����{A�s�:�
L
+�ۺ��@|�V

ˀ�a�:�7Z{f�
Y�3�@�ӻ����v"��ש�+ ��
+endstream
+endobj
+3404 0 obj <<
+/Type /FontDescriptor
+/FontName /VWYYIV+CMR7
+/Flags 4
+/FontBBox [-27 -250 1122 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 79
+/XHeight 431
+/CharSet (/a/b/d/e/equal/i/l/m/n/o/one/p/r/t/u/x/zero)
+/FontFile 3403 0 R
+>> endobj
+3405 0 obj <<
+/Length1 1577
+/Length2 8923
+/Length3 0
+/Length 9964      
+/Filter /FlateDecode
+>>
+stream
+xڍ�T��6,ݍ��
��Hww�� �0�
�� !-�)�J�tKR�-
�����_��֬�̽��{���7
��6��%�
$���q�s
+�U�� ��<윜��tt:;�_Zt:=��3������<��  %W; ��_�K@�����)�/G��0@�����`P�3:�4���	�vy��#�т	�%$$��'
 ir�X � U��5��)���
���\<�
�Q����A����ݝ
h��s�1��!.� -�3��
d	��.@
h��;:
@����Zf��t�v
��)�j	r<�h+� �
@п�U�r`�}5 .v���
��
����; ��(`���T�]<\X@��oG��3�)
���͟
��Ij�O��ݝ����ř�b��C��0O�,
����ۃ�.��듁8�,�nݓ��Xm�0w��_g+���w
��
�P��+HQ�o�'�?:0�����) �
 9@
�
��u<
@�\��O��z;�
 VO-�|!V��?tog����
+���O�K�\\ K��
�
�@��AR�����&�� q>�
�������,aP;���
�CVJWK΀�O��6II�< �l<B 6n>N '?@�����(���_���j !����"�
+������Wns���ua�w5��A �h����������L�?!���������#�jg���������!v�۟X�����������>�%VYB\��ת�|�
I(��ߗq��x�,5 .��_3x���@A0g��g�����?��]��}zJ��&��zZ��N)
��Y��9n>~ ��	��4�'������� �?�p�Ca.O!���|V0'��� p ��H�+������ 9�>��^ ���� ���
+8��������������@�@V.�h����E�b�9����p��)��?O���T�u=�NO�.��tw����O ��}�+��U�M]H�U�$�;���4ݦ�{&6��O�7�(�LՙA+N�$��q��e/$)��ZP�?&j���ܙ�kMn���O���I��Q����Hl��;���"��u(��:�
+bk�\���{���	����Uͯ�qW>���&�d�.�<k��م����g���4~��#�R<
��~
O���U���Y��
+
n�NRZ��$�#���R?S���K����=ZE�(s�XS��p�rgTC��B�{j�F>sm�&B��	6k˚	M��՟W���%p��Q��l%���K���&�|Qh��0+@�X��
�>�l ܉ɓ�S��~4Zx�^Q��f�֊T���^��>������2_mL	����T�_�w~K�T��
_z�#'�\��f����F������
#��!�H�LZa3�p�7��H ׮D�"�B�h�]�~�1�Y����;0a��e����y���V��)�)��I>�Ď!���/���[�	�1JW��9D�AU�47�w�W
Z�}��ۥ0[�������AL
驨�(ݔO��2����;�
�z�'�*
+\�����ږ��1�"�<]~
+[RmZQ��g�m(:
�бo̗���R8��
��5
+y-TWf�y��d�}�x�
+l	"�SL-r�e�W�{${�q>�
S68�Ċ��Z𯨿LLO�
+�ء}h�<y�.�z[^ �&c��L�0�GYl:�]��
e5��D���S�_��[�{sI$Qc4�p��v�3����ڗ]g��
�
$N�!ӽ�
��2��9�S:1��]�^��}y�����}�u�ɓb���[
h��z��_[W��m�[D4�1ܘ
��ةAa��UG��
����,$d���[GH���"9=�D7^�����o$��{a�MO�g�-��W�A�
C���%6&ov{?��;�o�R���ּ��X��9�\������\}�@񍊞H��Mδ���_��49&��*D�s��̎��L�B��_-�Z� z8URu,��HaJw��s���#Q�ٍ����L�[\{����uĈ�f�S�.��}kn���0�2f�)
�T0
j#*F�U럤h/tCev��>O7ﹶa��0
����m��'&�|��6C\x��d� ��fٟg���J7���C��a���,[���KJ~��,D�>��z�kE�F�d3�&ڞ|��=ՆF��ށ�h��X
v���� ���ŏޮE��ڑ�@��j?]_�n��Q�r�<8m/���
+$�y��gqn
b\j

%ݬB���5_&
���Ȍ���/���_����VK�
�D�s��
�������Wg�#�Yݮ����v��k�qWrC�r�Us���v��ȋ����54����>����j�*��r@ȉW	'iai� ��!C���T�\���p�>V�
�.&���ۓzѾ��ʔf���|�ҁO��Y��95�vO؜�^`�&9�|�H�mU����^�j���uM,����q
n��P�-�ӄ��U^j��I��*��.��":Q��,���׿��#��
�ln�^l�Ǹ
��IG�
�ۍ��ޛ�Z�Z�UL�s���{����c`��`e�u��
Rޒg6���IPv�;� �A�ڞ0����ߕ�Mj�g�
�F����v!�p-/xs���L���@]��;hκ>�DT����+={os�^P7�����i+�|��͸���NEo�>u;�y}j�
����`�~II��A�\$!+T0����:��
ڲ2�=E
����� �ki�d���
+ʑ
�s!��2����B�/�”'y'�;
@&�3�qD/{e�:�"����!��$�b�*���/��#�J}wR��Vɨ�c�^D����S
�$��*@?�� ��u��D����i����ʂ0K�X�}�
B�hJ�E��n��/�=��a��e��y?�".L��*6
ߴ��%
tBmW6cD�c|3o�FF�����\ʕb�E����J*��������
��n���Á35Q�V
3bW�(�s��w�mQ����|A�:������#���
��;�|޾e��
��-Gi
+@�]�i�\��lo%�6�sM�4��7O����3h_��T�T���f��7K!�q4����K�P����:�}D�pY�ɱ��U3*g*z���Fe��=�M��{��D�X���E͕ާ>�
��3����z/Dx�t)zo�l��zG�n/|^��y!�(d���e� ��R#>���i��r�8�'��U��
n�*��Y�_i����h���^��]��_L� +>��)o����F\)>ӔXChz��w��|���
J�w�y��W�˰5��)��i������
"�����S��q^��:���\
��cǀP΀�A���
��<���3�]
+�},�j[��{�\>��Q��u�A�8�u��	@�k|:?��H��vz(Ȅ
oeL�>ϽB��`&m�?
+�byaۉ�Ʀ�m“I��d�m�¹-��5Y���	�$n�
"9ў!�b>T�X�j!��.촧�m�R/"<j#t
�y����5��4b.�!��ށ�j��
|0�Y���
AQG0�R�R�j�G&K�y��N {^�uV�m��
�e��V�\�dtl!�|im?�|�Դ[���
�EZ_J����L߭hO��oҋ�].��w�*��|��O�e����@/�
A��^���
ԯN�Q�O
��R�M֝|l��s:
#�^(�X{�oI�n1.�Կլ��4��'U���7�x��m����qV�n
+���Slv�<�̨�}�g�K�"���<�$G���сx��#o
 9���]l]�<��?�e�+J��/�Db
��&��K��`���w��ѠM��4F{f1��+y��
5�]���H
�𾕟+	�Oe
gG��&d����C=��̡����5��h��x{�0)��
�l��T	���3�c+f0Lq���k�m�[!)<t��˽JO�&�|<-g�\�1O%�.<��R�����!u���a��@�z

�������
+� �
��W�%�
f�N™0t�Љ�L�o(v3�צ�
�rn׿��j�-���(����<c��g�	y�J�̥�m�Jɘ4��b��{�	��#ȑb�i��ŐK,�{=�4b����{���҄`¦j�5���|�����[�;;vG�W�j��W��=/�s�>�Z2���	� ���
<҈
+�F
	�SU�>�
8�*�:W��3��
8x�0������}'��C]��9��B
���d�[����,��Tz�:�R�r�y�� �|rȀ5�œ
r��ޠ-4�d��(N��	i�f������0�YkVV��p)-k�s���NI$�-�)�B�0y�
�6�R�o
+d0Hk�c�	�9�|�x�$�W��8�h�3\R�Õl�@�w�
>�1
r�E3��ܭ
݅,b����V��Pt���vT�L咂ԇ��#/��98�7�7�����_�ŵ{����pe���}��uWb�tw�����e�q&<�+��z>�-Θ��!��j���V��]c̳�W��?��V�W���~�^Ϲ�R�n�P�ޢ���Ĺ�����37{'���x4�1��k�>�^�k��O�x'�ī�H��)��(���2�z��	l`	�
�
->��5J�������
eL>i}�Z�Vh̆r��
+���/؂�)���?���&��"y�mbۆ��
���G(��zq�������,w�~�I
�Z~y���0�\���L(7u���
�-��㕅H�P鼸�d�̹q����M����G�yq�:A�j�R�)!�+m�/�S}R
�0��n��O��2�d"�X�j)*
�M�n;t֪��<
�ZN{�Vq�߬0H{ ����1M�
�m!�}O��?z�ιL}[��~
9M*	x��Wv�����=�at���K��'18>�hx�HM�fY��ٝW�{.<�qlm-�~����RD�"���)��d�x��A���Y1R�<?>CvZ
{$(_,�f�2G`j�X��duO�
��Wb����~&9�0�tp壸�Y�ߜN&A����Q�.&�jB
o��!3�)�&{+J�|<S�ڗI
+�I�yi��D�g���u���<����BֈR���
��
S!񍎜�J�Xp�++�J�N������K�
*;~�qƫwZJ�S%�c�^2��� ��w;ɲ-��VFs5���B|�gc�1܎��q��JD�d+��퐑�n�9�=.F
�o
	ԋ���)�e�63���Aʥy7�>�
������z�f��&M��ҫ�
+��A8
\G�ye�@M�����aU�R�ڛ�w;8-���[�Ja䟂� �M
b�/��0%��R
 ��rΤU�b��縫
�f�l�\𑗾ZF��R�
�SND���!ܶ��_D*��~Uz1^Ռ��[0��fu
)���U�}#h�Ϻ�
g�*6y�ɛ�h$>s;���-�m�6;bJ��'�qZK���}�=������u�j&V����-\z�:�_v�#k���2�[��4�|�i�rZ]��&�S2ejf�G��7tt֏}�s�H��m;+��[�}
���j�7�v��Z;��I�Օ����R�s��6�b?�T�%��-\BMq艘�<�1�L�2B��t軃�xs*�2l+C�I�{���Ĝ�ح�c��0ַU�e�j�A���_>;!�՜|�Q�7�`J��
+�'�
�0Wo�
+��
._��hz
,ۮ|�c�נ��!($��:�L0h��=o��J��{���!����0?� ���7�F6�HE�Z~\��IBM0��I��k���U�T:��~jU/��l�o�JL�*���N��̊Д�
i�mM*�O�%�D�z	�5�iQ�ѯ���-��g���ξC��N���3?���N�<�'F��4�*R$ J� L�/♻�2B`�;)on��~��\@�3Tt��$1p�'�x9•M��q6'\(�TeY��Wz�F�.G���8oxK9ې&7Z=J-:��F
�\�B>�
���9hG#蒮��uFB� Y kM{{I�"��T����}�eU���N��!���J�itN����]
�K-g`ގ���O]�E�N��@8��d��������YQm��ɼ��[�������YuN�&�[ª�B���9��!�2	7��Mq��E�)��I���c[%&J��(����(
��̚ٽ��E�&>Ӗ[2Cl��<ؤn�'��פ�^�N
+��Fr9��#�\J�R�z��d*�u�
+�'�mv�~
C�*��Y���C��K7��ꈐ���7-��In�`�=�n����d/���q�Ʀ_��ɐQ�woSZ�<�.��?V��z��Ǩ�v�|Z�%,����sV���w���	��C#Cʖ��
�
+
+6�;���Ȥ���x��6��
-=U'~4KZ<����U�9+c�����b�t&����|�����!ʵi
��zM~ie��@��7����?,���w���2�
\a�>��J{�+���P�v��
,
��9�;=���8�f�NGf�B,A��)*�M�qg���J
U���"�����C���v��eh�4��L
f��Oi'ᓚ3
+�͙}M\Dт�g�?	�d�7�!	z����֝o~լ��@��eT�z�
Ϧ?���A���˖���נ��Cb���L VMzީ(Ê	�"��N������"$��K�
��$��fLu�K ���R��"9���?{wDS�Q�F���E&=��ʁ��s0P�y��jLG���K�;j��'�;�K���0����4"��l^���C�U����i�?�*V����K�o����}���}XY�T	?�>0$�ѹ5
̈&WN��Ŧ���ܕ�lV��8��N������a	��$nƄJֿ���3	� Õ�ep�J�@���\Od!��Z}�cN5�*x�j�y����S�����m��_s��߯q�/��y�81
�v�B7�v���~�����qxn���
�
��d�#�G��?��	�Ď�2-zȑ�4K��
P���f
<�p
�u�5b,�kV�����*H�P���X7����	��)D���;&�2�R�RNi:�V:_�=��\�F���4ɷ�Y�#d Ÿs���*aF3LH

��������s�5����F��a�n�Z�Ɛ�U��3V+�F
��.�>?q��0��S��N��/�/`X� �OM�}<���$8zt�Y2�Q-�F'������@�����D3�}�͊H�S���X,b�� �d�m���T��Jj\歰�깉q��:܍"����f2�н��%��J�T�L�Ͻ9�-�kl9٩���
�L2X1#�Q	 D_�������D�/_(�|�T�?
�����W�f<C�K�QvC([C�2w�KHP�����q�4�<�E�Go�L�W����RJpd�
o��̜��
>
+Lu���n2M]�̀�N#u_�3:�Èܔj���N�n���`ꇝf�cqd�0<c��9u�wZ)$Hz��]�pN�o�fX=���(�+��F�e������
�ߤf����J�j�QhH���;��|�{<K��)�!+�
J��.
9�g�`>��*���`�̈́�b�ǂ���T;S=�~FxrU�wOT�^:Bŕ}���W��w`|���iW�=��/
�}�FS���7rM����p;�FK�+����'�h�;[�riP��a��Aφ���HइU�����̒F��~��!ZWY;������.�h8l(2l���M���
}_d��<��'�
��
T�Zn�S\���
��O����Ļ�����{���p�7M��#��劸'�Y��L���D�2-(N>����Mx�a�cB#�U�#�u
u�bړI:z�*_jWx��|��dP�v��.��>:��&1.��!��|W+H�V+YO�#9��<�r��w�
gGl
	�<�ڎX�h|~��}����x��(ZUѩ�xwt���Vtj�[U%%}�{H����Ԑ�2�Q%"�2$t��谖��ppM�
ӝ�^�7�i$"k�1���j�7� 
��C`Z�Mm��2���g��³��\��X��+k)�����
�^7T8�G�y�ݿ*�
+��R��������U�ʿ�|�FG������M�#VU��[�&5S�yW�
�٢>����1�L
Dh�����~��.�c�ÒF�{l]ĕ3�W�Gu �����TN�4J%BH"�T�
"����꬛N���v;�G���������v�p[���T�N���X��&i���w
hLe��~�F$�ՕM
�;�X�<'f��Ȁ�3�:�l�L��#Q�
+
+ʣ

W����|R��o�C�S%b�$�����6A201�
R2^�1�=��2�Jrn5���m���,����w��0'q_)>5���X��,n����||�׮ &�^c��9�bh˨�Q�U��� �JRz�T���4ɭf��&�>��L�]�;`RQ(�� �Z��̹^�g�ʨ���O۶�{	rf�GNb���5��G��b�P9��	����/|��FNdi&��
��
=5=�r�>�Ʌt&����"�o���j5���Xx��m�u��5`��LmQP*��BJS?�
U��^�%��e6��Z��֒�z~⁒�P��NT����
�م�K�]?y2a9�7�u���AӷPKM&*
�
+���ݼ��Ne��v�dU�
���AX�Q�u��I���`�έ����t��?&bP`��-NBZ���"�&(E	Qa�(閅i���6%κVeK���Zތ��
F�Y��'��Yo��%�0V�N�:�x���$x�[5d�/�B�o-�ӗ-��n�a�o�K�ʴ �1�k��P�
9(�wĞ90�!~�!T(�zi$�Q�f'��U�$���C�_0��CL�~���I0I>�9��M+
y
+'`N˓��S�hmg�L
�y��U�;��"�擈
��a ���|Kp�<2Y�ݕ�ca����M���0BN&P{��]"�J=Џtjc	�lK�Nk�6�w␅��>�^6
t(tR�-y	�Jݑ�I
a
�s���^��9�� s[^�M
�]��6W`��yL���2�m
-��l��o��OyG=rO
QT�����uͯ3��C�G��^rqB�N�ĩ;��D�~�6���̥	�?t�o�#{fB�|#�|I+�
�S�|:� ��1�F����:���L���(3�ktb~ J2��!��T<s

�w��YH�WD�]��֯�8/1s��T�r+t1�
&yD�'�h�
�`�н4P��?r�
Kˍ��s����}R�ߨ��]'��맾�PCUS3�\@����hkd��~"���h[�t�hp���O�U��O���>F�
��]u���
IU
��sd�q�({O���,�Q~��`N�U�
W�r�U=G
hsqt���"��膥��'�������q�َ:V��﷝:�D��;���QT��x���f�Sm�m��f��[�
�B
Lct�c��%��{3�a��)վ��S��p\_�	_��ȿ@P�ѷ�a^�!I���S�y��n �[l ���ͥh��SN*�W�s��> [...]
�8��hV9�
�!
����t�+�;Z�E��T���40���YX��> 4��h��)nS�{��p7̯�>��[{�|���_��}Av�F9�	���x���̆�l�t�B?{��v�0Y_V��MXP,�`�-K�-F����i��G�������V�� :�z����b���&@vT[���["4�
�F�:�Iį�wx
���K��ɟ ]��%=�R
���
��`�$�c%U�b�x.oBѨ�vi��0
��)�&S�"O�9.�����y�k
����ܣ���x��aK.�o�SO�y�gD
4��mV�#�7�pZ,y��$��w+�
�q\f�%���cB�7��W��I��L ��|k��ם���J&����&�`�I֮w׹�(��
Z�����_Z&���c��<�ܑ���HP
+endstream
+endobj
+3406 0 obj <<
+/Type /FontDescriptor
+/FontName /EBURFX+CMR9
+/Flags 4
+/FontBBox [-39 -250 1036 750]
+/Ascent 694
+/CapHeight 683
+/Descent -194
+/ItalicAngle 0
+/StemV 74
+/XHeight 431
+/CharSet (/a/d/equal/h/l/m/o/parenleft/parenright/r/s/v/zero)
+/FontFile 3405 0 R
+>> endobj
+3407 0 obj <<
+/Length1 1540
+/Length2 6820
+/Length3 0
+/Length 7853      
+/Filter /FlateDecode
+>>
+stream
+xڍxT�[�.R�HH#-
�%�%�0
00� 34H�Hw
+J�tw+
�� ݍ�J�G��;��ݻֽk֚������y��Fm=nYk�X	Cr����5�L�� ||�<||x,,�$�7��bvF@�0���!�
"Q��rԀ� O]� ~A ��8��8@��O�oG��8@�
+�h� ��a`
�<���bk�D����� ��<�
�u;C@@@��;�*��P�

#=���]��t��uss�:"x�ζO8
� H;�.vv[~Qh
���� �� ��
zp��
@P
C�B\`�`g �:@OU
��������#�������'ݟ�_� ���@���y@`� 
�RR�A�#�0�_�@(���!P����ց %Y
 ��?��D�  �_
y�A
�"�Z
���!x��� q�P������0����
fm󋆵��
���������ق� !>1aa!~ � ����U@��	���Fq��r�;lP4�>0��
t��.`��m��
+��`
!V`[
��(l���g�;��%?~ ߯���Q
+��à
���n1������2���1����^�b n1a> ??�0 at DD���<�9����F���?��_Ua6p��_$P��7�?�`�36
�WЄ��
��#�g|B| �������i�W�����{GJ.P�o;�_��
��z��@����

8jB`��j�k�5������"����٢t�������_8�q[kC� ����w3P5�X����wPQ||�eC�
�u� P-�m�&��ua ��� ���
x(�VB /~ԬZ��K
���#Q! G�
��Wc�@�3���/�o
U�
���`(
��
��
�]�(�sA���
���LP ⟤� ^'T)�5�.A�D��o�0�uA���_$A.�Ψ��jD����ߗ���N�AA�UA-��4n���XK�m�1&�aBH��o��ԱӔ'^�=�.{0��=S2>�M�yp9���3�1I%��ػ*wĝ���i�-��Nm;*�
�Jr�CG��
ӌ-�h�*X�Kp��ƻ�6Ħ��.��N̘D�|-�ն��ʄ�y9`�8���,�E_�`��$�B�%��ǪYT���/2�z�Orպ˅�BȨ�{>e���"��xZ�@c�:�/J�a��s
a]�x.��s2��9�_Х�VS����ˡ:�j�дTV��	��Z��w^�
q�v�*���Xʭ��R���ݘ� ���[�IxAᅉ:�\]$��@A�����_���
�'JAE����ֆ�;
��]I&ȨYȴU14�]>����Rb�;�j��2�zg>�#��1nM��ى�W:�Dbȩ(��T�
o��Ί�������nnS�0��c�6$��'��������k"
,�7ILH�pPD�~�Tx�T@�T�������;
+:{�ĕ��t��ߵ��r>���P�n3�{^����8R�s�%g2�$2��-wc�kIV��Y���Q�6�j��e��L��	����o��ZM��hS:���[�7�Uj�c
�Y
(��3�AKꢅ������[�p���l�ξ��]H<^�w�ت�<t�Y�BN@J�6,&�Z���*慉f�@�M�� 8V 0
�A����[�J��Q��1�j� ����tt�M�������i�'�#/@I����W^c-�
���ʃ����F/h4��L
/��4��DO
�k+
�_
�Z
+4�+k,��$z��S�OP�������B��
'�<�a��@����p����=�~��5a5ʠtK��W�]׎�=�R��q~٨W(�@��
��7�ŎD�j3�}�����P�s��q.�1
�Y��n�;����k}��bT�Y5Y�s��7]�K䤑Dj��qJ��
��b$�P��=�7^ޫ߾�� ו
+��m��4��&�q*F��]e+Ռs��c7�M�
����MY{q�]�	
	�R�
O
����=c*�^��F9���UW>q&3CG���pR��QV?�`Q�)�k+覬ꥶzqu��lY���GOvЅ`�������{zڪ�6^j#E��`��a��}�=���Q��Ɵ3�
�,Z92��*�!񤒋�lQO�����N=�c�a�3(А>�ޕ^�w�q%�L)5�͏�YU&��y�'dq$���^-j�����
l���!(��ܘ`!
�
R��#N��-��ͶW����™�Z�Wj�\��δϏ���,��
�����J�e����2� z��J��
�@��;jaW�
��(�oJd�
 q�
�G_�ኯ)7
�?�r���0�c�ڻ�Q?2�5�
�
`񙹞5r��ĜD��V�hd
+��YY��Hc�_����/�
̎U/S���1�HDo%^�X����
+��
+�I�����S�Wq�R�+G[���/���y���}}����>�dO&q��M�޹.G�`�Wk&�Nyh�
ڱ �oe�?/k��X[/5�[�l���mIO=�G�?�B�@�S숅co��\�,
�t����b� ���:N��14���-�yզI[�}k�3�b�
$Q�*q
N�
+?�����3�ďt��K��[y*�K3�x���1nU&

�
����bިo�m���5J���V�5[i�z;
wc
�4^�^ �q�O�l;M��%��`p��uO�:��h���k��i�(��,ziD��Jާ&���Ӻ,��o�/��>σL<{������Yj
E^?疩��#5ĺ�a;��
;/B�~|Gd-��Ҙ
��=�$0���AӨ֤c_iFrKΧ:iۡz�{Iw�}nj�B`���]��z�1�-r�h�����W�Jg���,(�#��;>zΕ���e̻l���ZPԧ�Y�8���ϼe�t�ș`�+pZȬ�|Ͷ���&���~�
�vv�y-�,eLGd��f�Z����R�ra)T$@͆���s���Oe&/��ǃ!��|��݉�!�T��
�u���ݦAލ�
+w��
s}_�S�w���6���p*ۿ
Z�V�a�j�Av-���	m�
Q��1C��wG�h��k�sּ����m����
�B�_��s��FC�^�u0�����הtJC�II�=O7E�z���X��{觽��5t��H^�zQ0d+?@{{8�єvG��n�~���/o�eSloJ��8
�~�Xd����
�}����9��}N�#��K.+���c�n�t�����)���E�67
~�r��&9fҺ�����$����Tz�l
z�
��e._���C	�Ӗq,��-�	m�}�'n͟���y�e���^57
�/��28�-�x�#�2G�v+��
�_�}���t$�������a�
�\d�^�
B�K���q�E?����C��1�Ơ�~�q�A������nͯ���PR2a�ŷ$���IY���n��Ex}�.��Hg��3h��Ӫ��wԹ]�HU����<���{����
Tx��) �ɩ\����[�b�롳֤�Lv�
���X g9͞�����'�-i�Ë�t6�ïɻ��X�q�\t^��|��
cs�q��j�;��j]��ul����C�ts
�����{�S�-	$ݩ1��#K�OwO�- ��f�G��̅�.�����?��ђ
b}2
ڵ7��y���sq5�-u���=�%��ݍ��H;.���Y[��ģ�u��{T�S�۾D@�D�c�H��)��ä���Zb_�m^�B����|�IH݌�t
&Z70�
5U;����ڴ�����Px�LE�J����ю섯`���v�
���K�#1��&�{)�W�Ҁ��L/���DB�yJ���Տ3�R����d
KH�[_T�

1,u,�?�Ŏ�}3v��^���'���G�z���g�-wi�8�+0������+~Km��הg���̷�4Ay;�<>9�#���
)F۔�S@�i�R�:m)�0p��`�n�a���6���ξJ�$ 5��tk��:&g}y�Ę�c"�x at fJAht�4a(��u�)�Ɂr*����e��
0{'����'��
�Y���"np�U5�Ը$���ݸ5I���R���J��b-䴈��e�ɠ�<�b���-�4��.���~�z���vg��+DX�W'��҃�q!�j��/��hن^��2�m�-_3]��p�n�B����{�Rة��9�ҳ
+�~R���wZ�`t��^PZ��?a���z��qء�C��q�� �;
WY�"�Vp[i�4��JC�k��K1�| �����,�r*	3���
52��Ӂ������n99�Ȧ!�G9q�<�Q�����O���d'�N��x���pL��Br^��;��oh��_�)��bZ�Lɒĵ�v�t>a��:�Ey�zJHN�ga�;���AD�F)jv3�
�qR\�0�ӿ;AJ�LE:���H	8Rqd
�ڜ5��'.��^z<d_-�2�ULC\�آC���NJXro<�ٔ+�*�r~u��th�
���R�}���s��}��3�w�eA
����I�;S�Sh,�>*��ԩ�yY��o�S�~tvj���o��DBM�

+F�!���.V�%59q`�q�c�dX2���rTN�7�Hϫ���фW[
D�ϕ��|�B~i]P�N�Q���K�hi����z�ŝYV�c�*�R���6S��HHWI˄IX�L���=�
bMC��^#a�-�I�n��
	}��ہ��)��
�1
��o�MT���kW�U����u-L�Ө�aV*����0{bH-�t��1��x_{�EI�9���O.�|�<GYmFۮ��f�Y���N��<Α>���
�&��dRB����Q�ʊ��O�Z���0?����"
+���}V�G��)�`�
<��<��%ީ9q]�i?�U�7��И\��
��H�������}W��`┻�+w���p�
�ɢy��U%���߅x��#(�0�
����I�G�ܻ����s��@>�*�\����h{iAЊ쥑u�́��]��'^��yvv1���V�}70G;�U�$B?wQ��P�}<w:��^�ޅ�i�Z�ǂ^bR�k����7�����O�y㔘�
x*��lb��q-��L�Q1
L��K��#����O͗?3�]	k}��y���
�"9�5\,��*%ɫ/-븢��6@���.���\���ώ��Rv�]1��!b�M�d����m��y��E�xmF4+y� �
K�u}�ݞY�� 8
ͅ
率����=֚��s$�|Uv��k�F9�ה���s�����_F6C�!��@t�L�74�.>���>Y%3M}L�f�YԻ���h��L&2C�40�<gb�S�~����5��ꉋBHF|8��)��u����tA���
��W��K��P~+T�̸Q����
WUiS\�
�0��g�5�#��w4��Z�%�����C^nQ+��q9[`�]>Ey��AA�g�yQu���<�3� q��ԇ4��I�H6�Dkr1.E��#�5,�T�HQ�^�H��L�P�{}��Y͟���]�^���`�$��0����ζSS{�3E���F{쵉�VNʘ�;m��"2#Gzg���$�,t������s���t�5c0�/����f[ja�o��cH [...]
�˒�����3QQ{��x�n
�<"��
�z�y��rG at r�r8��
�xI�U\a6�QF�4�HK�
�F�j��62�v�+0d�u#���x����� �����꺀���$��z ��eOݙ 2���)Ǿ8$�ۛ��f�� f/�����z�]6z�	)y5�
\Hā|�&�!�/�J�3�G��#�g�r��~�J�����Z����}��{���c��
-���q��Fb�<}�V_q1 U��হ�Y
���3_j	-i��u[��+�E0�-
+��
2Y���}q#�Wi���.��$u3`�̓؟���_����~���t ��).ūa�PU�R>I�Z
�׭"��>v�€�'��:?�����rOc(�S�p����+5,��e%x����d8ĻN�9&Q/��O�K��r}�}�4��a =�I9ـ���R	V�G���}J��Z'������~��5S|�[+��N��h��W6a��Ua�*y�v5z-l��P�tv[7s�|���.�
ߗ���J߷�-�d]Kq�W��]'�i����y�X�oX�1�7������;f�
�qS̘`��y�)�dk]ٽ���2^1Rw=�����=�[��!��{�h����_
+�*� ��#I9+�"(#�{t��]���O��8��9��.k;��7�R|/�\����
��yM����b�}���Tn�z���
+��ĺ�]5D��vq�tzq���l�bWZ�����ҙ>Cӭ��=%+ST=��)~��9���\蠁_/�%�f�x#���
G�]l����sl�:��_.�v3=�u�KQ�	]r��V 
+LOبq�W6|K��i�SE}vT�%Ͷ�=�PQ{b�R�/���d�!S�|�y?'"h�j��Bq��*�P`�DJ�N�q���)����;�	j�Y��'��>�g"j�1jz�u�m<�1����&
Pé=(�Ą�jiaff�,zoGjW�4��Aj��凣�G�B��%��D�
髡��es ��F��F~��I�p��,������I֣b��Q���Ϸ�����i��_�]�3tͲg����2���>6�2t���M<ws��%E3.�[�⟫��T\F4��{zC��K1�s���h��'|�Y�(i[�����o���<Y�0�zW@�&("޺�Zi�
�cf*I��}DfG�T�G���Y&F��}�!᮵*���
ز��U\�]'��
�h-!��aKD��{�Z���1	2����*��E���M���X�a
H�R>�TXzk��MI�פ���Y���2D2�|EV�y(��\mUB��V6!�K�W:|gZ���z�m��l��x�:y�|��v�ޖy! [...]

8Y�*�Yp^�1��~��ç#O��m����$E����j�K�]���:ң/vAЅcޢ�2N�`=���֒�3\�ڢN+=�����w�q�5h����]^$�|��`��
Z��>������
O;1'�:�����۷�=�mUs��P�7,�S�����^�k����4��X=;�E�y?��)U���0k��;CK��­��]���
+a!���QJ�b�SC���ٶ ����~�
��.�@�YR�`s��"����`���(�,�Ͻ�}�yq��91
����SvhJ�n��ߧ��E�'�,�<��Awr��!��̔�K��<ge �8":���
���JD�@�T�ꁍ�_FR:�
i��ۥ�<歗I@]���z��'1��Ϭ�a��?>wfXJ�VیP��'�#���_
iPe+�4|�
�
+������o���Wב]� -�%��
i-�O�V�<.ъ�V�3.|���=󈁤��/{�e+T�m���J��\��,��
c�A���M8��d"y�	�%]����Re���u���.��*�M�沇A Q�rG��p.0�yV<���S��h�0�-��+�0;i�6�J����w
���.Y�ՙ+]n�c�M�I��]U��e�*��]Jn
+endstream
+endobj
+3408 0 obj <<
+/Type /FontDescriptor
+/FontName /HQMTAG+CMSY10
+/Flags 4
+/FontBBox [-29 -960 1116 775]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 40
+/XHeight 431
+/CharSet (/asteriskmath/element/lessequal/minus/negationslash/periodcentered/plusminus)
+/FontFile 3407 0 R
+>> endobj
+3409 0 obj <<
+/Length1 1504
+/Length2 7108
+/Length3 0
+/Length 8129      
+/Filter /FlateDecode
+>>
+stream
+xڍvP�k�-ґ&z	:(ҥw�����PB�Uz�"*U��D:
+R�. 
D������w���L�>k�g��;��62W��
�hN

) ��Mo� @ ) $I��o������)�-�,�R�_j8G�ԡ8��>��� K�2
+`Y 	����( ԡ�@��F����jh<��#��� �$
 ��ˊ��"��Ї�\�HBE'�;�턀���J!���y(HH��� �H,�qQ� p� 8��� �
�H�f at J~��+�7E;�|�8� �#��(,!�
�c �� S
=��
��Y�� �@����+�;��Fz at Qx��p�
5��8_� ���r��cфx�7�u$8��9��j
��E�Ax�@,��E�_i]�@���H$
��R���:w"�
/�g�n(�����3s�E��!a�Bxz�u��r!@��`.p
 ������=p_'W�_���
��F�/�� ���p&��"��J,��a�������%
�!�p G�
E�Ov
w�s&
��؀�@�>�y�#�
�F���q�=_	���jf���v�&��/.
���#�UR
 +'�w������o����n�ꠜ� �?�����_��kc���`�&H�G�� ȉ���������e�)��/������,�����H�;�/���p���Gv�߮��?���!���m��A	ۡ�r!(\
,
I��XM�/
f��9����ߣ �pG��Fh,��
�����tNn��
+�0��&8a��]W儆�Z>I�
 ��@� ��$!�?���0��oy$�(4� p
8�1���*��b	�X7�\�`I0@uq!��L�o
����`B(ꂁz��� C	
���
A 	,a}������CX�߂#��������('��N��V?l<�Re�_
 ��o�L���	|��w�#���� +�җf��Y��x ���Ѡ�m[���T�<
�F�כ[�=?v�\��`�.�e�"�2|d�I�`Cj#�d9~*�.�\�����l-�
�<9��Ne�Ū�6#����7��mKwc��e�c���8wx�1����M\F��tw���4��BݎJ��0F6&�[ܹ}�]l̏�o��	܄
�=KI�a+F�	̐ �G�

|qo�@H@	��>UDąD�v����ʍJ����O��RVW�r�g�";&3B��N�}��
m��,j��m(҇Yo#X4+y���ʃ<�S���;�Ͽ��A�
$�&NPX��{�}�d~^���md�t��]��,���'=ɜ�|����^���V�_�z���1�
�=��F���%��|r+� �O���>��v�D�Ҫxz�x�bɮz̠���Y�,y�uk��[]�t���'X���+V
+tCMO!��:�J7_58�	�h���ԧ77�p5J��+R�\����௕ld�p~!��Ŗ��u�f��E�zQ�?%�/��K��A>��-w#>�$��O�Q��W����v3��y��rʺ�~7�6
�w��j��7�-��>o�:�t%�*�3��Q�uCx_Nl�_�b��`����b����ȸ���!��R\5n�be�-K���k;d�����R���t���G&�y}�$�Js��~A�U"����iq��h�8dσ��y>x�'{ܣ�/x��Ruαݵ��q!#\����)a2AWcV�
���<ZMF[�J�$}�m�aV�Z������L~�o���d\L�Q<u
,���8�o�
+
=�{Qn�q!
+�ޝ�rb2/�
�JҦ_`� �f~#"��hc��(t�����$�ß�{������m���!!mL;{���@&�U�B�;ѻM\R2��.2�m+w�
?l�d�z�!mE��}�s�
�����{�©�yW�&�#�ɏ��$R%�`�+�J1)=��ͤ��Këj�zN�Ca^�KUYQ�Me�!Ukaܐ�Dۛ�"�a��i�c��v~j����.������(�:O�[d5ls����
d.�~ϧ��գ�t����Y
�榪��ݼ\�����.��>��R�/�VeAs֑�É
{
w�;��!�C��㥶ho{��j$v~I��l~��1����R���b,�0��Hj�k5[��
c��pǫ
<���^'������A����%�N�#���",g�6I�Ͳ�
�F\�O�e#����w0`l��	

_�
����|�򑜣��
�{SQ2���l��X`,�p�3#�	�x��4���
Nʦ�TvЉ���c�9~x�
z=�;�{��yM�Ɖ����P6E�G������`ַ��S5��R2�������ǜ�P�A� d[E*A}!
�=�ZLSz��2�k�'n��
U���-�	'�~�4M&���q�g��$�M��
:��6Jɢ�+��yB����<�����
+�����р�Iz>>�G�	��R]��!0�
E
+�o
_)��R��g��7��S���
T�أl��ޟ3�]��/oJN:�
+������J+����@���" 8zTW

z��6�s!�
G��t�\�*8Ye�9.XZ�M�*��I�e�8>ٟ�����%3�9�|<VH�Nsx�^r���c����\{ϩ�(�3⃺�ٗ&l٣Whk8�����@��f�ʎ�
+}4��.<A/u���I"�ba?\�a���-�Ҏ����g�A4���(�w��T�y���I'C��#�����}K �K
��w�Ʌ����em�Q��7�]�*�����`R[i9���^{=@f��F����:֍
_�5i��A�^quߝ��֌1�"�v�������
^��T�(	��c�O4K�p�*{
�x����Z��6$�%
+�-3j�^��\�k1Dt�b?\���y`�6���#A�}���Ǯ���-����d�u���ȊWϹ��Yy�E�7��t���
n�TT�Hb�x�:�e�޻�Y�!��8Բ6�3 at w�����&E�)��Y��b� o`�y� �N�u�c�
��X�<���+a��N���5�Jw;)8��I�g�z�_�2��
+�
�P������
w�~�Zsb5Ur5;b�6�r[#/�NZMI;M;���P	8���5���bgn�\�]�<&g����/��(q�����f��Z#i+s��D��(�W�ȕi'\�h)���BC"l��={�=�5Ý���k�'ys��i�/��{���*�3khԖ��̻�kE�fwy�
�j�
�Kb=��)b���������u
~�O{h�^���X%�]
�� �XV{�]�[bH�i�O/�ē�;�*�}�놏܏�]ޅԲiM~������w��9�՝��9
+����`������Ԑ��5�Qσɔ�)�^DD�,?��d���T��x[��R��4�k�C�zh���y^K��, Y�gi �P�6�MN�]��
+�B f��R�U"�I�w$ַ� �N)[�^��=x%��ڙ���(�]u

s��pޠ�s`J1��+,��ُ�F�Uz�B�^���*�
=� �>7n}�4���l=�Ѡy7\�5�n�1nu��+����W���z�u��*u���ēF�<

,+�C��"̄�=�W��/�j��l?�M��8`�o+�
�"{�W�R]Ͳ,��"�Z�����-���`�G��^w���m�O%Q�+��oD��t�J*����'	�/�1���M�|�a��
���!�^&�􈳸k��P��N���UBK��yi2�����B�:
�>�k�Ir�J�O�S6_�{�W]}�D��=���xU�,�����f�
tF��u��3[}n�1�ܥX��z�k2m�P
9�ڝ��p���4R �����"��ޣ�qS�2�
+�����U��a��Pu �Sb�Ƃ��"Ӫ����9���3 Q��d�a
��C�9q��g���N���[B������pXpV?���l]W��mϓ�@��7�=��'
��C\ǹi���ڸY�;�Z���U�=9��.j
rf ݰ���GXc]��(��֐��
iJ����'��[�n	VԚ�J>��!9v���e
�Z�j_J+��
Sm����DQ
�������ę6�E(�O�����E�-��Km�e�I��Dc���ɉ���3�l��[�/εt
+��t�)
+��P]N�>���[��1{�+.䔏
�?�ou�U��Vv��Y��>�>#cd
+y%���hҬ�9j<��y����C�|�R>5��tS8���@F������&�뤻v���]ON4#S�߭Ͻp{G��v�	T�S����`��j|��`
����y�ɍQ&�d��2T�Q�ⵥ'�{�e�w�Nl ��_��m�Ku���Ƭ0D�>-;*p���t�q����e�ݭ1���^�܀�q
#�
���rK���!�o���x
+�e����N���+���F�r��[W��Jz����5󍤞��O���ʀ��=i���(�6�au��R�����&ކ�\GF��h-yٷ��l(����~�;R�
�-�Vg���Py��H
�Z��j�G)�S�(vtF�\�i
���|q﷧�<�Z��j���ޞR��4k�l�o'%�̡��
��Z�٨]޷�C�ᙰ���"��e%��"���۹�����p��4�s��
�9rܭ$C�|��
+1��8��I���%���|MY|s�[��EX��K�S�q�)X�.�C3w�����%ΐ" ���7|��,�����1_��	 :[�
ROh[�u�z
+ↆ�t*��4��y

��
+/�=�Jl�[I@��rz�M�9
��G;��+�}���~�t
9+��g�Šo��օ�5��ګ6
 w˨���8�ږO��'�Ѫ<ⴾ��b%��ޫ=o�2Ke��Y��1�=^dpY�!�<�?�m�>�m�]�G�vۇf탲���4�䡗��n\�?0�Zp6 m8MQ�OW�/�Թ��jd�_��Bz/�K���s�?B*���
�P��?L�E�+
+/>��ƆA�cY��hD��

+
�
+�$�uZ[�
��,lOYy��.
�
���}v_R%W���������~�ʰ����/�?]L��yu˗�X����#�<�6����<y�*{���B=N�hٶ���
���%��ahɌ�}nB9�/}��ؤ;���)p���Ͳ
�f���ZD��q�@
�x�t�1�c�1C��L� .��]��|<���
d���|Ȫ�Z�R��yj%>�AV��9�&e/����%��;�ݹ��y�4��sO��a�d��V��u2��$
����R|2
�k[T�M����I���&
+O�`��GĜ^���
�f�3�W{<)Z?G�X
�$�+m�W4F?�d�b��5-`٢�i�Y��X�h�2�1$=w�ìȵo�e�m�\_�wYyl�D��^�"M��ۖ>︕�-
���H��O���aHև4�!7dp�;�9�
+_�p#���m��O`T�q�#�[c�
�K�o�
�
m_}S�DN,�ᝎ>��~���)�v��;��$R�3��9u��*@W����k�*��YٴضT��9�.H೉~���P�1i7kf+BV��'��G��AxF�Tr.�C )XtM"q2�	��4⭁���7Ђ�$!�s5�UEf��r��Su��f{S����z@��
�b<!@��v��
+��:g�f5.!y����8�yä�q�.�9�nf� k�3��aE02;�iT`v|�-p/
x��^V�J��������$(�]%�L�����s���o��?1
��\az��>���P$
��_b�P���ܾn��?dx J6j�f�
+������C�
wW����
+9�j�
䠭�S
�=z��(Ph�)�=
�枋�ѭ�����Y��g�^��s��M���B�p�Y��nk�ǽ��7���2����Ҁ�۫[v���U/�p��Z&7�^�n�
�ݲD��o�-TS
�o�@��=$��[�	��j�R �%���U A��p�Y�}

�V�Wm̫~W�drմ���&�$�$��K�B]���l_P�o��k��鏔(bbH�S��L���v���}ae�.a#~]�%�g�d����b3��%k,)�nm�Ei�'�
P�*[0�w+��}����"�t���i�Oő��y��8n�g��R�?w�]V��bB�Y
;dž�E�O6�F�}�}�=�NJ~�
�j6��jn��J��nn�~�1����0�@�(2�W=^:�A���%�&��+K� ��J�>Ed��H����6f��S��u���tN/_
����W��92�������b���U��z�5�r��V%>��u�K�CM_��V�
�ֿ^��j}��ɥ��l}�/=�8Z4{{�3�������d�V�b�V���7�
+��m�4j�6;{w��|�S+���%�(6� ��i�M���5��͋̍��%[���e�Z���<��
�sKy&f�l���RD���$�fa�}m'9����0Xns��#>��⬞�G�zL�ͽ9�BI5���l�<'�ʅ���#�O�t�!N5�~I�<�a�	+Zq�0�vwԸ%��{��Ňs�R<�;�}�ݥ��D�[Ϭ�~��`giع��V���"<���"�����L�8p�9�-ڥ����6��v<�j
c�\�[�u�ݧ�`=�$#W����Q*n��m�kU��
؅�=|���:6ȱ���$���%��
+ʥ\g����n|�S?!v�$��5�ƻ�!�hYV0s��6I�垑!���#�Ē�*5
+
{'E�]6�D�*�4�U��U3�5/��i�3�7܆�!C`�U�E)0��g�:�wۅ2���	2�mL��ܹ ��G����J�5��3�}��Aj
{x�To.�
g
��-�d���F��#-����C������/0��%H39�OW��ukה9�^F���n��#�>o�
�/��tK�
�uo�Vm�gn2��(�q��-��j�)|���߃�p��
��on)��^f��Z�~�әk���S`�奫1���nB���ﴽ*^�
}q3>�l�0e�q
o�(S���
����y�Ѡ�
�4w��{
���Q��8K�l�
�;�
�-R
�2��T�� �j���,t�#R�5$}��Ht�/��v�$B�E�َ�}���@
hn�so�r��)j��c�="Y�h't� �v�5�3F�H"�ޠbɏc��
t���sŃ�N�~a���S ��I������d'EQ���CeI�a�r�d���-��G���>���V���Э��/�-م4�.���1/��uu�jU��w��
��-�<�
���%���o5\�YKBh��f^�*g�jB��%��@ZU�����55sj�
 �
+��|�XF��ߕ�+�����n�:���B*"���
��8������B�����c��U��&l̒�B?�^���o�¶	�N>�~p���4�$�
1����}��Σf�����4��*��&���e��z���h�!�a)��X��8��,�:�
�:o_`�n�t^��`�467T�����p4R�5�b��-:F�=������LUλ0)����
��6��
e!��5�xn��)��rA�s�<G�2D��b�cm��Y�9�r��wJ��4�OS��Ri=

��
+���j��ZH��-��³wh	�H���]T
ؘ��ƺS�VUYD+(�^��y�UWG���P��/���hԨxw�D�?Q��E�5��
+{ź3��AX���� ���=RMоI��ɪ��g�x	3�1�ѴB��}!���F� ��N�.�V�D��,@��h\F�A��vXȳ�� �Ig� ]H!έ}��B���6*�=���΃���\$��‡����#����{�{\P
��`����q�|��H���
+���k�R�I�<�`�
�c��]�E�c8�5b~PO��D��)��C邎/���%ė�]X{=���_������6���[S
��Qt1&��9���Ĕ<���V����܍Y��F�m�
�*+>�*�+Wꭘ����(Z7�Ԯ�c@�?r㏌�����Tg�
nt��
���r����!Ŗ�N
vH���M3jk�R�3��Y\�b/\YJg]An]��
�� ���fU
�o39�W]��'�$�Y���^ǂ��:�]�Z� 7z�f}����[#J�������oy�Qe}M����ժ�v�l�
|�y�*u8� ��Rhh0}=� �B�>
+endstream
+endobj
+3410 0 obj <<
+/Type /FontDescriptor
+/FontName /VYEUCT+CMSY6
+/Flags 4
+/FontBBox [-4 -948 1329 786]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 52
+/XHeight 431
+/CharSet (/asteriskmath/dagger/daggerdbl/paragraph/prime/section)
+/FontFile 3409 0 R
+>> endobj
+3411 0 obj <<
+/Length1 1411
+/Length2 5990
+/Length3 0
+/Length 6951      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�k�.�(����0�HHw#]�0�30
ݍ��t��JH	"���)�!�
+��{���9k��f�w������_6-]
ik�TG�x�� ��F" >>^>>~"66=��LĦE��p��� ���QhL�B��#� 7G H  �������
��@����0k�:/@����"���0[;��߯ ' ������ i'(��`�
�	]v�" 0(��_)8��P(g1 ��Ã��ʋ@�Jr>x�Pv 
�+���"
� ;A�0�%b���\���	�G
+wEG����H �8 at WY
��
��qV����Wo  ^����+
�;
� ���p/�`s�4�xQ��� 0���#������a�`+��
+�� 0��_�\!H�3ʕ����"�Wt���ֲ''(
�J��~r0$�n���d
���_���	k7g�S8��
�,��
"���� B|���EP �b��^��������8#�6hP?�
�G��
+v�PH7����6��D�a�
+j
���

Cm����G�<&|h� |�~�y3C��w�����|���jz2���&#���� <��@ ?�!"���w��4�o�Q-0�����Qn� <��ݼ�y��%
��V���
+��� ��o�'�A?@��
�;����_Y�_���
)�9:�6s���f����/���P�PG���߮�?�����9��UF��4�-q
� /��
� �Zk�P�?B�{��08T
�
+���AG����
�u�W�=��&(z��]W
AX��>~!a �{�E�/$������[�  /
�B� �
� 6$ѯ���N0���/�7��	C���Z7$���%������k�zB!D3S��P����o�

<_��V���uE
+�ا_�ة�g(���XZ��H���&|lʗ���۰�i[V�b�R.
+C�kM�'�����l���
I}�F~���t����A��ԏ0�v��򍂟ͮ�ƏvN���d,)
�X��]�h#�T��)Y
�$�MO���O�hX܅Lc
ݥךI\z��BoVwW���+Վw�e�tT�*,9�=t�	Y*u��2B_e�$�ߣ+t
+g_�v��12��u��9���a���H��*#5
�c����,?���^�I
�jD�%k����"�2ȶWqB�F��3Ś/K���Á�`#��(ݞ�;��
�����.GJ�44���7���$`�fw�˅�ƌgu�ԪH|���1��N7Le�SPܑ��xl�1��x���4%�	 �ϸk�������Ɋ�ŕ��I�@��n�լsΒ�U��(yK at 6��9b^p�f{��%I�b��2߼�9p�t�D����Z�?�����Q2R�wc_ƪY'��g���@y�*b]�NޚG�8�
�X|�'
��c���k�s�&邟���]�ǘ�(�%����x��\�&ĴJ�����6����\,E.�UM���c�5
�f*�����
+�����b��|/
+ʄ�K�@V罰l׮y�H�]]�K���
+���8��e��5���ۜJ}���]��
iR��폧	������zU�"�,�����7R��O�KFd�gNMY�dE?
+��|��]b�!{ŕ!��d&?�Y]��i�~e�p�,,}�+���ի�z��o�V�@� "iԱP��u���b*�x
����s�����3VA�F-�|�#}�-�HϢ�
4Em2v������vn�Z����
d�)������2��dp�'�r&��j �JU��͜M?���|���'��Ā#Iۼ���PO?��ʞ������ɦy�q��=��k�;�����̩��`rV����b�X
+�T���&����Dš�o8�b�^��@�u����v�3��l��O��T���f�X#�.kU�(���A����81C'�� �㖋���ى*T2�
?���I�'wLg 	�5��OMI.Z
z�&R' ��5��v\zW5ǴW�ޛ��
�K�O�V�����TLͤ:�� ���L�gy�
K3t�U!EG隂
��=�O?:����%B�
+�|���'��#��*\T@
SX\
ڙ�nt7��g�X-N��
�\%v�?��Q}6{k.�̘X�	�^~}�A�>}7�K|y!�e��
���k0)��m�,e���oKF��
+h�&�IM�ުz/׏�

��~���(�
���Ygh#�]V

�;�L5�
���ɪDg����ZyM��/�D~��6���q�-������6H*_V��Ƽ�
\�Ϣ��Y�����ܯ���
�������sa۝-�{,S�����o3'�;�s
ĩ4�
�z��
��헮
}d,YΩ
�
�
Oկ�QI���0$�i�qG�I�ʧ&mU:˜
.�T�w�a��tO�b+Rz��_������V(TZ�|q8L�|�Ÿ�=��0
�
qTv?�� sv߶�U�e�Q�’�
8�'gr��{
|���_����KQ�Ǖ� �b�;������lv��ꃆ�e�,�	JgB��2�o����C����:�H��_�.)njIG�4(QrF�x=
[�ʸ3k��QZyC"c���7�[/�Ӷ�0&��h(�\sq
�!\�����W���`d�=���ɴ�lDP���\LS,��
�%��_�Rzꪟ)X3��qGN7�z����7����Gf�N�{�����>��0�
�{+�g=�PAĕ�����"Ñ2���P!��\�SxF�iuE���a� �J��>[���ݭ��R��'K���~~��\�in1$�zY��
�Y`Wޮͪ_�e��8�h�{i�8�=��F�
�LbJ1D���n	ԩy��}�0̿�n��\�A*n�D�
���
�O��c
+X�w��G���hQ���7�!-�7�Q	�Eq�r�2��
�������B�rgj߬i�24D�p���z��
+^K� ?-.r�bn)J]�!F�':�g�ɓ&�}�&�x�U�>��¾�;�.%,Y�F4w��j�:䇺N&��C�7
+�p,&�,�F_=�v�:�,�bo�֙�
q�=�$��\$�>�ɟ�$��'��r���!lK�k.�r��|ihY�ӝe��XU���b�f}�ȼ���
�Y�
+�4�
e�5$]7���w���kU�2嗸
�UZ��
�0J_��l�Ά
"\B���]�y6�J�����[�dzo�5�\.$��
j�~�B�����X�n��/�����g�Ɠ)�k����.w�~-��U�+�q�����M��6��
m��S�1��"��iy�AW�=�K�\�Xʵ�z/o��y�$�
�[��zP�!S��çq�x}�w��e�Ӭ���W�
:��_`�F8�{Gڲ�J��Reu�V	��w�qi�zÿ^8�������C/E�h�����Bd�������%N��Uk��LC� u�1I�_o��Ҕ���/4�C�Y�Oz�("wk������~�F|��@�nĞ�.���
+���ڢW1J�K`K<��bǯ�Y�Q}d�c�~}�s���z���FX�� ��ί+�&��x�C����.w�D��
	�<H
+�׾3�wn����`6&�5�v����?��\J\��Z3eÕ๒�O�$�Y\�/�,pt����a�h��F�MX�5�$c�F M�u�@��Ãc����J;
Z/ʶh��]^P��H�	��|�P,�q�r�Ȳ�^5��Jh*r6��"���&�������1��N
���$ʕ1��Iٴ�R���mb�-5[�e�!͟�;��Ս�t������~�Rk��E�W�4��2�֘����^m�N/L���*�&��o+eA-��������'۸`ªo`
>���F�ފ4�������I�U�M�Im��ϸP���s�"՜�d$�	�f� �	]�͝DC����ϗ���%�k`��ǽ�&�X�њ�M*	�V´z�@����������$B�����;�F�ލ�b�ڵ���W%�ܣ\x��#�����T���}y��	�9���O�*屪BM�B��<�k�p�]��Ϗ^�7�1fY��<���3�e9NE�j� ����8�(
�\Q�
'�kM�K�ҋ�s���!�/�����
\�-��m�D8p+i�
�V,�4*��:�
S�9�,w)��]X<zD/��;���Ќ+sze^�����8h�d�
�_ �:���gs T�
Y���u��q�1��S����G]
��%S�E挦��A�)�=��^
+s{;����G�i��"C��]G;�$z=��պvsj���~��'(����4�-Lp��'�O�u��䡑`���G����#ͥ���ŭ��Q�>g�\ǔ;�4)��ϟ���-��Z���(D�f]GT��
�'!�S�p�9�#�P^:�kN�
��-{�;k�{��e�dJd�$ f���}M��IJ��9���lg,w�����7pƠA�k��6��ߍ�W7'�Q/�r{����c�(on��V$����/^}|f�F���
׷Kk��J�������H��F
�-mg����JX���k8�|��r��Q.��.wo���g��絤�g�1
��K��q��*�z�F�o��2�0�|uA��7�����do�_�U
�Q
��\��(��u�S�0��@��xS�Wm[6�!g��&f.(5͐���T F���r	1^2�
v�C8j�%��4<�HTls�ދ�E̜4��aw��I�n��ᕨFہ*��_P��t�>O~X
S�x}�y
y�Au2�`kP�F��(�|Mv���f�ig�&�i�
OϷ�W(�
H7�� l
)-m���/�?����F�_
+4�0Ozc��	��4��j[}�A���?��.n
�^w�|i�7��d��u9�
��F���\*��d
�{���$� ~:���'JA��\3�ykq_�$���n�v`�=Hҟ
+O�v�c�ٝ�A�BK葻+	3
+�XB~<�����ch��$o���~�Jšc�V.l!w���
��3-�Z]�U�?�=��Bp�
+2u,W�3ԋ�,D�t���#a���њ��#P`�7
o{�U���U�u�����#:�z+?5vɂ`\��� �s��� �
+p\�g�t�=}M%��:�{���(��1���p��]*9���⻤���o}��C;����Ce:}/�#>~��,|A�D�qV�.��2�Y�M��K'�o��>~Z8[-"-ئ����\���>��NkEJ'~��^$�
wCrBs
�KrKW��pI�׭!�i��8�U��+$~z��
V5õ
� �f�$�
ѻ!|Nf�<Q0lNZh�.
�8����U����->
{��y���ّ�&U��{OH=N8;E;��Y-�䁄�-
��J��[m>K����֛I���Ԗr�_�FR<���ԻjY]�O}����W�	
X4P�Uws�g�iAc��3�z�U�V��W�1�6��e���Jk�����J&T�G��"��H���<����oTh�'�Zڰ9����s�[�U<���,�<+��~��c�[:3r�NouV���k�h�^�b�W*(6�e7%��]'Gq��}�̏0�qX��?']ar,0�օ��"�����
�
|�f�(�f���5,G�e�7
� 3Tu��-kg�tƉ}�X	P,��҆�-M���s�v,�߬���
���
���)�^\]�}�Lx�����Y�u
W�A�
��N�AN/8�s����
�إ��]z�d���o;~͚�ŏ��g��~G�m��N�Q�If�9��6��QCx��@@��,�_���h�>���UR L��;�h U&Rf�3�xNܫ��a;"�B2��np�z����+Ю�Z�~��gݒ>��EN��ÂҎ����Y �TΒ~��	;jw����Sb3l�2vĝ#�A�&I<�cc
n�޷1�g��8MDK��'�ң��X�܋z2���:G�!��S��k2
��|6\
�Q�.D k����	��1
��x�p�R���Ot��D/R�b�`͝�uX!�
+�{\UyT�l�e
NX�&�CyfX"uJ�!��^�F�2`r
$!I~
�e*�����V�o]��#��<u�F|!�t�.��C��vW�u:r���l�^�/Byڈ�����l)��M'h�hh�
/��H�3Ǫ�2Ѽ�

j�k�a�]
���'�-Ǎ��G��HΓ�`D0��IMM�<��r�m�v:���^j5���YL��SZ��$:�ͬC���W�Z�p<��F�kG�{�
U��2�P�~D��Md%���6y�\c�s�
�9�g���|�]����'�B�S��}�D����'7+M��%
 b
�	�g��:X
���8��1�q(�cqf"%�+ at d�0�W���
o�QY����հR��w������&��*?����,�.��f���e逭��"��_5K��̻� ����g;�^��M̶j����&�W �}^�Pڦ��[IG5�BF-
��/���n�g��/n�/�{w�(W�H�)��T3-����j��0ĥ�e���.g�%W���y������aѮ�VE��T��	�PH^
.l�w��
i۝;��I*b�6)n�
�{���kn�f�u-.)dZ6��R������>0P\;7��������p��»=�ǽ^����Vo����+Ai�On<-Z
�ob����Z�f�^��,��9|�	��
ȳۉ]��f6�>ܢ4�� 91C���5^>�ZSbvw�0�ۦ�
��ݣXt`;�?��S�`�=���B1�F�;(g��*f
({
G�
 	��y�H�ȀhgJ��
+��O�,}���d�.���n���<hO�`J�pj�=�?<u������^X5�[�\�V��4��z��M��ǁ���䝜�b�QdQRl:/<cU��J�`#Q���h0u�
-����,�ɢ5U��{,^�i0����5�z�'}�iV��ګ����r�h����P�~*n���t�&��XՆ*7\V�$����z
+endstream
+endobj
+3412 0 obj <<
+/Type /FontDescriptor
+/FontName /ZQLTBN+CMSY7
+/Flags 4
+/FontBBox [-15 -951 1251 782]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 49
+/XHeight 431
+/CharSet (/minus/prime)
+/FontFile 3411 0 R
+>> endobj
+3413 0 obj <<
+/Length1 1463
+/Length2 6796
+/Length3 0
+/Length 7790      
+/Filter /FlateDecode
+>>
+stream
+xڍuX�m�>
N�	at��n�AR�6ƈ
�� �HIH�"
"%-
"��� !�H�ߌ�}��������
�v_篮���
������F!�"� 1�����
PLL$&&��@`�a` �
�A��
+�������8L�����@}ow��$P\FA\VAL
(!&&�w"
+� �� �@#P��a <(O4�ō��� ����
+�*�y��	4c]`
���;�
A����h����z*�������

+
W�"�. at 3���A�?	o�=`��� <@
�7n�r����0 pG@`H
��	�����@s=C��'
�;��w�0��� �A��j���g#�W1Ayx���$
�p���
AX?�0���L�cP�z��v�%��9��f
+�������X
�p�IQ�g�)k!�(��ܟ&
���_��ͺ!Q���?
g�����S�����i�I�A�cp(-&/##%�ya~џ�-�=a���?a
��@O�'�G�p��~ ��
�E{�3��@\
E@�@'
���;�9�^�.��ډ�'���דN^P������WTS��L�J�7����Q~�@I1����4P\\N(++
�g�
����&`ğ͉���
����wx���#
�?� �s�-N�0 ���o/&-�}���
������]�7�������������0����''eo,�F(�9���j
�me#����Q=,g5$
'qq)���o
��F���&,�巐��
+�
wf�� ~�qpUbb�ù�{�`p�+Ù�s����$�e�`4�ÉL��@q�M�0�_����(,���
tF�?�U\B
(
+��8ڸ�L�o
����$P����`O���ŀ��+r�	�co4��_2�m����W
�� �M� ���u���5j,�"�GH?�ǥ���Jcyg�����Lz�߅V^�2�}=1
�"�}<�gߙ�!S�1O�wY}G�`�d�c����c�Yq���RMoP޵#��{`=}
%�%�V�Z|юY���z K�82Y�����7	l8�?bm쩒h�v�-�,�.IGꭉL'��vIك

���z�$w

��e*�i���9�����S��0x��҇�2R8��zD�~ �v���o~��3������ݤ�A��b�>;�/
v��[0��F#޺[ I;]�����H�Y�.�4 eT�Ժ�$�lŚ�үAIFQ���~�ٯ��լM
�U�
+)Wx>P9�����}��W{@BYC�p��6�"�������-x&��]�k�0�5�[Э}���ԙV1�J�^
����n�)�?秸����9v��$"�`i$�y�}�8C��3wM�!f��Ҋδ��6�'�G�J��}\s�&5}���
m]�T����ӶA�0C�2���}+ap7���R�H��/�ݳW#��7�y����)Q4�

}x�H9r�|�j���^Bx��e(qw��K���=�_�$�6�>A]j�aq��0�Sd�n���4;�������x�p��^%�mQ�J�����t��i
�.�a�?�`���\�
�
"E������R'�;Y�O&�ڤyf罃|Z�ܵw�'��ʣ��&�&�L�M�����*����.܃�Q9=Qe��
W����g_h��.���M�M�㽔��;v�Lm
�����>��6�-Kv��p$��0�x�@,�KZq���b�K���e2;t����G�t\@i���(s����tF�Cٱh�Y�7u�6zөX���wDaJg^Y;�����h?z�ԅ������뿄)�Z���P
�d�IM
+�������%�

�N��fQ�2�y������?05	�d��C���_SL�dr�~�t��G���b�X�
I�����IӢ��Cg��'R
�?���Y	*d����x���ތ;�
I!u0�.���L%A{vL�&
{k-V:�}�4���k�|�¾#��]�B1DvJ׮_�qp�n`�
L�O��? �W at S��Gٚ��H�ri�oa<�8D7�
<�R�eX�o^�����ɠ����s��m�Zt�s(��38����;+���J��m�>r̞�'�+-k(N����nh��`2Ag
+��ĖH���m2�c�C�
4[�6
�m�n>�o���JCy
+Ҩ��
8M�(=h��#�%P�an�t8�!���4dʹ�_ɿ��1q��6�8`�\��HQj%��q���7ϳr/uM 
%�l��
=���#�!Է�Nz�5����f�4�n�����b���pL�l[o�x����#�g�����xHw\q�C��6�;�1�v쟿X�ZPW�܈u���U����pyY0��gr�g���cv3|�+��6�s?�*���Q��
WD�
M�I��J�0������3O�
8m{�C��Lo�����si��^�/�j>y6#�[����.�Y\��8��G`-1����Bm�)�=Y�����L�
�#���"#M	�	ֳ�bf�T�K���Q��DjN�e�"���^N^K������{c�m8ض<DMgo9���u�$l���Rt��a{u��K�
�人>�͘�uD��~H��Si��k2�?fR75g���J�f'jm�?���
�����dP�}gv
�j�+��\�r�	�lNA�8��̈
�K߮2x��|��9�s=
K�G���+��
n���ɮ�˫6;ľ����%]�z,���ۮpEw�G
��8A�� �
��-��o'����~�����
d�}�
+�&�-�y}�&�A�P�}��"��Ҹ��Qu
�2��%qmnZ/���J���n�
+W
+�1WX�ۥ�@Å�
:g%[���
�t"X�n4ߡ)�uWy�._��Ǐ���
z�|ӢXW����A�hؖ9�̺��_�/K}�{\��*K��������W/�9Y�Z8��MXI�|�D�u�g�_
+�w�
gɌ
�_&R�1a�p/f���d��c�apQ��7���
s�	�����O�<nw�]�g���}۟�ĉ
V�i�5������%K���+���a�
��	Fi0�E���o�J��xH��{�7B�{�����^��A��E=X+���i�j-F��"�
�?k�L;{��
���n�i���-a蒲��0���
�b*{��(Ke�'sh
|�V��:Ft�δip{�
U��5_T2	�}H�mMBn��4ܬ�#C�p_���"^y��ce at hőKfQٵ�
�e�J���,!����8�+o^L��â���2��Ӫl�N?ʿ��J�d��$�ɯ��h~�za��\^u9	�JΧ��Њrsg�:�P>��F�6�f�P������㪇��4
�����q���i��y�|����;�p'�u�A��Xc/~h
L,Hyska�TO�(,CL���16���ׄ���tk� ��C�걻?�*+�� �
gYT��2&ԛ�G荸�
+䘳�Yw�:^�
ý�5���cU���*ZOA2+�.�I
$*
Q\v|�t˝N������U�=gõ���٨���O����S|�imGwDf�
^y^bqZ��2��?��ĊJx����)��
Oo�hN9�5:�,Z�u���/qY0��~w(X���qrh�E)yFe�
<�@x�4��8]'�� [x29BP�΀�Ǘ黻�
'FY1�kMEr����̢����:.3��)����I4�D���*�C/F#u;�r���$Z�����*��a4@�٪5����Fn��o����c]�W�xx��H۹�Ų�G�X��e�'Ɖ�	%6
+3�BK���b���@�1}00+�s�n\� 7�х@x�\V��KÁd��سRq��i'u�\��.�
(��u/����B�{�`}�!�a`
5e��g���e
,bo~p|�<���EJ�}y�M��V��1bI��_ZHn-O���1VƧ|G
�i�yz<S�yw��҇
,f~Q&n�ۚ
+������F���M%S�R�
p�>�
+ֱ�ς/#_�>6��,jYl)}�9SV���G�s�WM�������(��f�����	����z�S�˪6���ό7�&M
�,�����3X�{��
+�Ca��d��4�'
��N�x����>����m�i:��_���y��
,��
�g&T������LHg5�N�5��X�����@��؍F����'�*��3�dfk+J������8}���.,�� �?�h=.[H�I�
7�4W벜O��ߧ�Ԝ����ai�n��e�
���ٕE�I�qf� �� DSDS�Y����)pk�,]��ޯ�%�I��W���_�v��RpF�[
+�*NP&��\��DG[�۝�dK�Ѳ�a�B�^�ب߸�8���k�O��B����P1��
�
+�����(�c�[FHV�"�(���c
������̈́Q`�j�Mѽ�Ϛמ�

�%��p�қ�]p'�U�%\��rs���g��H-�}i�G��GQݥ���x;�MmEȾ��7݂�������)�\�-��(:7K.�1m:}[��q*7�1�|��.�o}�_�����4kZ
d�gB�?�l
����w������Aq�Jƕ�������d����WA��{��'\D��uxGNE3��0C�B�
Z>3��}�=M-��]n��=$���ˬi�g{j

+
+s
+��\��
+P���
Sn�</HK�

������{������/J�(��;f��Cw-s���31�.�1��`�x,s�FG����ȋC{���c���̵d�l�H|twM���|5�{�Di���a���G�v��7"*��|
s��z�:�5�O��Q��`6Q�y���<�VZG��)��(�L�J��
�`b���{^�ԞV/.,Y� 4�W��_�k��_�m1GU�GK����
�g�
�&$���5
+���pZ<K�׏1bݸ��S��I{�A�F�e�&�W�@���6E~TN�g�� �
�֜��u�k—�S�^�������~��dVE��C��j���9g��kϘ�W�';NQ���V�����T�^4<��]5""�\�	������ ��c�k�#�
�2�1=l�%�� ��s8JN�j�/ņ�nH���Ӏ2'�t�
W�.�%|#�������[���#�o	�m�6���=񫆣�0��o^5]��(��O
&:�2��a��"{�Z�敏�1��'�
�����V������,E�
&�����X��/�r���p�g�Vn�z����C&H��;
���#��FR��{�=t���
�$q�Ӆ"Y�lS��F]��^w
s�G_��.�I�1�v�/
��B��x��hg����9�d����$�������f*٧��A�
e 	�Up|����dpebh+�n�OR�^@pR51͛��GV#���kx'����� !��<����@J�B.4k#���L%�����݇�rn%i�_
�=���
~=*E�j 1��q�z<��M��^�u'�X�d�pq�
+�q�QVv,�
+��EvK�4|�?�2�� ���_QKv��P��C�N?,x}�X�C\��9� L�n�&?���ڮ��)��+����
�4�� �
����j�I�7����
��y_[c#�> "fr�����K
+�Wc��D
N���fL1[M!����c�y_�&F�wW��+��5��T�l+^/l���}�
i�`ً��F��^iO�/V8�@�����g��
�ݙo���n��
+s?�ۣ���W��-?|{��/����D��f�p����i��&�
���_��k���l'.l���Ƴ�|
�a|0�;���oo���Y��a���w��4�'z���2de����
��n��nr��������RxLDŽE�����g��K�L?>����P�
s����y;�a�l�0��]!������\�
6��ʹ�c�r��5�wb�l�"��0J�s���?x�Ŋ�o�
��V�������[�zT�*��}��b�.ɢk���������v�:Yu���Eϰ�[�BW�?�PJE0}I��687
/�q��pG��,~�7�<�d����Z�^c)	^�UՈ�m���چ�Wg}��&�K��V�]
TvKZ���)�B�r�lN�ܟ�Zr]���)D_�{`���>��%�
N鯑��
�/��׬{H1&��i��N
��Eo����i��p��	��*E��ϘI�"��*�
��J/�4���y�Vp���akup{��x#�S�v
� ���,�`��'�x��2�ևo^F����
��h�Y�L����*��0X�I4�_��B�	֣�k�����r��U�+�!YI��T��������m1��/��\
�+���I%���aX���k���k�^�3
+)Ӈ���
�
�3H�&����A�q�����l��}H��&��;���6~����Ʊ�y��a'����
�g��j̔��wRȔ�vDr�����5d�:4~~��S-�����#�X����V<z���jk�o�h�:��L�$#^��/�
j�8.\�%�U����<���&�H7��/�&hW�ҵ����]����5b�u��
+r���
'�9�(�(n��_��R��x}U��ጽ'��Pe���ni�dؼJ���D�N-͸�Dj��u�hE;����&U�
�@|sf��X�	;� _I
����Б��
�������B�
_Ǯ�Z�}�E��b��x5+}�����x�d��%�YC�iP�
E ^�N����`���h�>�=z�^�mKV�y�[0s�%�J�Q��8�� `my���r��
�� 
G��B
Y��6C�_��vʩcDONX-x��.u�
o�_��
��4�	�m�7�J����S�!
��D!C��1_o�j�
+�B�1�`Pu
���fw3�`�lV��v����I-�Ur�⑲����_68��Ig��>a��IN+ܶ���y�����늘|��d�$`�}@0z��Pm���|:bz{�wә|�&|$LQ;�R�zmu��^D��e�
��PυwuCц�h�[+�m%ƫ}��Bߓ��U�7
�w� ��3�@�E��A��ث��|7��4��V-<7Nk>S'��J0���QGa�r9�>z,V�uޓz�T��,[��_�I6`9�H
r��&B��<NPXHP
tW9��
��N��㱢
E�s���r�\.|x=�f
���
�=t�e��F�w��C�3�Βx4Hv
��[P)�����)���/d����孤��2mT��f��Δ+��T��`����k��j��F�E���'�	5���|�7���cjac��!x,�;�8e��Z�?
�Φ_�*�h�����K��d\�cxN}P�Δ&��ԛ��9a#�no��V����W�I�3��o\k/����k�
��nmgOm��%2_X���Ũ@tE�>EJ�%2�xI�#��!4�n�|��J���c"�$�5�ы	ڬ�p�{�
K�~�\�c���{�
��W�jRS���9H�����ܷ�9�s}�x�g�%Z�#��B�#�u��.�
Z����)Ց��)�
+�ݘ� �k%�b��
���%���_I?��0h!OV���[���U�݂��6��w)��)��NM؉�i9~?Ts�$�kg�>�?{��a�槮9��|]�TU��x��rE-̐:H@���i7�û)�V�ճ)��W��Y�8��R�
+�z��6�j�[}�8䫓6|��ܨO���7�8A�@���E
��
��t�i[�o�0�2�okE��)���5u�ɽ#���Imަyz��!�v�5*:
+@
���/C3 at L�#&M[��Q��HZ/���"B��hkw�<���7�a$}p��� SZ�
+endstream
+endobj
+3414 0 obj <<
+/Type /FontDescriptor
+/FontName /DFVRAV+CMSY8
+/Flags 4
+/FontBBox [-30 -955 1185 779]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 46
+/XHeight 431
+/CharSet (/dagger/daggerdbl/paragraph/section)
+/FontFile 3413 0 R
+>> endobj
+3415 0 obj <<
+/Length1 1439
+/Length2 6459
+/Length3 0
+/Length 7435      
+/Filter /FlateDecode
+>>
+stream
+xڍtT��6
C�D����tw
+�tJ3����mtR�)��%�HI�t��(-����g��������;;g�s�y=�u?<��F���=T
���

� Uu�̥�BB�BB" 

c�xL�h

���_�h(���@X���r��E��2’2BB@!!�
�h��� ��(���Dy�a�NX\���������Ғw~��]�h� ꀰNPW\E04B�aP���R��9a�(AAOOO�+F �vT�u�	�:
�(�
+�$
��B3 � ��`�߸��	BC�8 C\�;EqŁF��@=��Y���
��
+
�'ݟ蟉`�_� 0�!�aG�
�k
`��w� �#�A��A
 
d�s��9��l �����a(,F ���(�3
��" �HWW(���O
���q��-�{�.�'������8�$qG	� `n�PM�?.8���Ņ�%$ą�P7 �
�$�3��7
+��(��1��E!Q@
	�?����b@
P ����߆� ��@
��C
a�?�q0���7|4�
h)�Ӟ0P���?��q� p���WP�B뾮�_��Ǧ�����H��ť���b@III�������&�
���4'�OFM�(��������G|V���t�8-C�|�H�JH\����^�_!�7�������7����2����f�+
���'ew,n-t���@�����*�@!0w���jbA��PF8�$�/,& $��a�a^P�>

v�-��G���!��H
�狃��/n��.�W�3+(n��]�.����>q	 �y�p"�
+�����o�� �Ņ q
��H4��Xqy�p��
�i����08�(��
7��Q	� 
+�q�!�1���vG�q9~�����_O��> ��!�u!-�5�,��_�Hf��"��{�ű7's|��I�j����A*R�?���}�c���x��������{�X��=�*;��}'��
��$��dj�"�v���%�%o�ه�P�Nѕ�傋6̊���X�3��D9�m� ʜ�{
�onE
C��Ls7�4� ���
��D3�x/ZƤ����ٛ�Tѽ��]��atL�|�8�z���i5b�n��W-M���T�vs��Nr�l"�ͫ�^Q�G]� 
+�������
	�R#G#a�D=�FRY�Gh�
}��F�:�e��\�U�
��j)�,��gw�;];�ɭ;�O�?vD
�9��^��
Wzʴ8
Ὀ���%��UL>얹��)�]�0!�M���c���3��k���c6T���v�Ә}|���T� 7Ht��k�)�ǎX���O�𞰡����졡��j�
YR2)�^��CoP�z�kZ��__^��K�;gz�K�=d
j
Ư�٫И-����I�cȐ(8�6�%���7�w夬bv�}�W���V�����Ƀ�����
+mT]��
\K�]����7��g�
/�f�,���0K���{�}�L�STj�
Vj��*��I���W
��=V���mAK9�/Na��([����\��F��i�%v%x7ӣ��=��
��v�g��{����f%3n���DM����r]K'
���wR�/��l�}ewU�]ͅ�a�fu�s��k1}
+.m�~׷j&�[~l8��a�u�����
R�^+�\Ye
Fd\��<_��\�'��D�-�Y�߳���P����#�%�Ȁ�Z/ep�q��N1tb����
��k��`�������J_��G�_�y�����!t�|c0�;(פ�jo��mq.8��<�xW�q?���;
Z��
Bד��P�k;�!�Wyw��v�%�mO$��P�	c�x�c�{]6�E��7'A1_s536�bU_��Ŵ
+�k�8l*���
#��_(j]V.��W*�j4�����(('N
d�B�5<Z�;��t�u�����᜝�	�&�&�Q��Ll�i�UJ�*�I�7�Ǔ���o�9أ�u.���F�S$���k��.5��F�혔1e�$j
tE3�}����{z
��^:�fap���f�k���TLŜ)�:(*ӤVbG�(^�IK��NB���ϱ�T�yI`�LJ��:~��؏_�5�������s�Ƨm�26Y10�٩4��95�����",��
������͔q���s�.�-Zܺi�" �^
/��v���G0���HW{�?^E0�(����S��.��Q5sH���u�ާ�>D��G����c�/֬'c��.Lw�ExA��`��f$���I^�ש�n˵�9Q��IV;G/9�
+�́����_�*�
$�͢��
M�nG�ma\��疪|�z%����zk@;�\�<{Or�z|��G��6X�a
ws۲��&Kv�_8�Jm0�Y��{�H��3\k~�l
���~�I���W�a>s
$��=fU�7;�ىL�r�Xb7yv  ���oX2����nk}�d�`v���p��)��D{�Ɯ��IG-�3��2W���󪭟Čdpp�����#��շ[
�P��p��,j�7#?��B��,=T�
ׁ��cm�
�T��h���t�#%��M�Q�8M�h�%���
��KC�V�>�g��!P��}=��y�+�t��ȁJ���O*�T ��m�˼W2���~�R]-yМ����[
��Q
�I�(_k�<�(����H�(a�>��
�H_���
̴��}�nnM��3jW�AgR���.E�Ԃ֚`R����i�j�c�׉�eZ�
6.��1{u��𩽧O
>ud歗�
+ʠ����
no����%u
ro�MT0��L\K6���.5�6}��-���K�-~������r��`���hgڶ�=r�T5��bXP}b 
�0{��!�X��*׵����}�؝MMG{Rtd�՜ґ
+׳���F|�p�^/�,�(���a�[�ܳN�	!�|aA��J��L�t�z廮�'

^��$��Uf5�xQ�J^�/���Mj׻�Quj�/��@-;Zҹ�iD��(����5�ڠK$cZݮ�����V�1��,]���KյL��

��'��5�31y�
?�t�i62`�
FyO�EJ��G���[g�%�c����=�a��͑��ǁe�|aX�B˱�!o�2B'�H2�b�g�\>��c����x�G:�LsRM�]�K�3�ڃv���l���:
E�}��dlݓjV�#�N�ݛ&jv�92�/�oս}�6<d�%��ҳ
�@��UW��Ӿ�Jx�uz��$�.6R.-a���a�?js]��� �т|��8�%(S���9���''���@��9&P��[b���#'}fQL�
M��OP՚[���P��i�����oc9'��H��i�Om�=% v�=H�]re��k�v�����mA��
W�KɉZQ���U7�B����'S���ۦ�X�\&��3/�--?�����@M��-y���Y�wc恳��xF�d�>5�2�>e�4"q�)
n��P��0��#z�&j��߀���«��'�3ǦF���H���c)yP[\Td��S'���e
��db��Ű1
O��j�=�X�Nx��`�%;��~���P|�5�V�Fo����'f\f���o[Ps9��	�����ߊ��� dW)���_�B;:,)=�
v�W���=�3�=�C�%��v���|�Tj��0_�0}.�(������la�I�>��ǭ�<
+|l���Zy�������K 
��
+�
4��_�r[���R�1T�jzrh-nd�L�ғ�c��ѹ��
+�Fsױ�;W��Y�Q�3��EB�����U���Z0@�-�9�L�H�����9
+O�[�(m*��du�Y��oX
j�/{]KeA��?�J��$ 2-�v��>�OA�<
�f��!�dhQ�.[�2o����
p���+N9ע-���^�ob��o+n�5��i)�-��L��QkĨ�P�$v�p�jp�)xPȭ��ڿy~îO{�_�	�3��>mA�=Ú��v�!Q\\�
G��.�F�&�o�W��
{w���R���mF��5��Gc��E�!�W�K�u
2�nE�wt��V�"bj�Hw'��do�
+f�>L�v���B3't��R�����m�cH�!U��ӝ�2��ؗ�b�T]I:C�M�S�tƍ��@0"�
�o����j�2��q��nG��8L�$Mn�FXc�M[�~�mF�p3�}?�o�g�9�^���y�p�>����s�*5���D��#������Q�j��ً9wFq�[�h��nY��w�C��>Ӎ���]�V�1E3z���a�A-2���|dp8Fy����R��k�����,���`,��]B���I� >�'tV��K	^W����A�d|��-N5���*��Ȝj�쁺��}�R!��ln6��A�
����,k5᥋�
�\�2�gO梣�W���"VUKo<��R~�l38J��nZLϹ���
���w�
s�—�X�բ��[�O���<�^-P.�n|���*�P�k>/{U�lJq��
+�{�x��,U�
+�$�� �ɫ���'�&Ƿ����f��<�+z?�ܯ��F�k�
+�\Cw�X�izF��/�erUd�m�gT���A>	��?6��T��0rl�]	�D.H��hɍa����`��lf�c�O�dG���
A�Ols>��
;$)w��)
O?�J��L��f��.��4P�E, ��O�X��
�d�R`�KMZ�fH�D�]��/+h�������Нn��f�ᦍ���L�Y~�s�NٍՉ���w���Ť�H�ړ�*#�FvX������j��
ؐc璘��:��o�q�<�����Z����:�,�_樂��u@�OڢH �\1=G���9I�+$�������[Y�$1W:ّ3��
+ at M�(�� �ɱ���W#�~B����I^�����=���c��������f�f'���|���y-�!���4Z������|,�Ad��#�����'��/]|:DI��â?��*|WN���A�H>��z��z�2��@�5�sWì��yV�l��b���"�-�u��ūQZ�	�/ޣ�J�j�q$
n�}oh���=[ݞy�7]?���)#�X;>y��I���eB�mɓ���e"��rhkpg��#/��`:=Ì�{�1~��.���{E���ū��O��
�D�ex�p����s�� �Z]��՗ƻbonu#�`;[N�t��zҁޚ�*��t��f*��™_��x
Q6�hW0��!!�l���!7K�K�P�ƪ�|�#M̀J��G���
{�J��Qc��W��7Ɂ�N���6F|���W�D�.��Tp�Br��y��%�D�>jT!nW��<
����4��k�>�+�-)(�
�����ÿ?�}�̗ݔ|*�^%t9����y�L?|C5��%����u�@h�D�p=aZ
]�
Q��x�����1k�["��k����ə�� @����Na���qD�(��6��(=4���4%X
�K����v`cV�1�m�D�
c{͒ e�H�n�ct��MnL~5ɱ0�z���Iz�j��L�^�=�[�93@��,h\��i�'p�C��e�������b�rD/4
:\<)˔�AŖ3�Q/��$�d}�{�0XUy�����
�JM4��âPHH��w>m�4�ː2����
3d�K<"'r��6�T�������:�t�Ì
C�򺼀��"�c�J�A �@/5��~�^[m�)�*
<�k[5�m�O�
+��#d�X���""�Cw"[�	>�v�5I�匉i�M9���fE��
+�v���c��7`���v�C7��"�m,v|Jb���sD����
X�)˷x�˽�0��#�O����V��h�H��P����ZC���^Uۓ�2� �{��<=i�ZT���L��Fm��-���ª�t��#
�b��j�X��� B�P�
s?��
�����^��	,'F��K��|_�MTj{�V(I�3��'���Z��*����N�ڭ�캞��N��:V����+*
�K��\�3�'�z=�,j�["+E��
+��.B�55�4G�W��Ju}�|�0���Y�o%[>W
�(�~ �yQ�d��9vh�j�·#1,��h_r�t���':��%Lf���Q�7��,ɦ<��J��!�F%s���8���^�ް�+j
�]il�Y���b�8߶�
+�0�4Ι
(�
�

��ؒ�����&�b댡�8J���#(�t�מ���i�M�P�Ŕnk�f��]y���8�C ��{Lz�	�^IE�\^T�<����K�
�g�8^�?�e$w�NaH����-��o�
��Ȑ�8ɸ��v�Ω��'
�B��j܎�Z8
+��>�<j���`»�[����p)(�6O��3V.�k��$pe���}�:
��ݫ�}_>�Y�_��~/3���
��e�P]�Z�������i1W"��iO؛a1�V���e��G�����r�D^uJ3������KW֊��I:a=Ke�
��H!�^)�_&�� +�5��E Mz� ���[?����B��X����m^�Z5g�&#�VD1�Q�.�|�}�䢃�
�}]�\�J�gHm��u�I&Nת �-�OS���la�r΀,�N:�z���w���U���Qc������?�nf�u7��yQl��E�6ۼg�;S"L��)���~�q�����#9����9����X@��.�4�AZd�����7�_�o�x�'|i���3��*���S���NM�WMnn!6��%��������x�JD��2vr{����������Ƞre�8Vw
a�{��Ϝ�n�[XQ�W�w�+;��H[Q�GGi=�Sz�֬&wwJ�A�
��L(���*:�O�HpJ��im��Ab?6��7�V
��) 
=SzV�}�2��,�2.ep��E� ��i��{cn>>U5�?��x�$�Y�9IkHq7�ڂ�o���
ϙ�LcM�K�Ω]Z_��LT���X�}ŚlBTi��
���r{j
y�<�e�R4
�|�q��si/,�]J�s;ɪ>�~���b������Ba7ܔ��[s�RG_�&���]��d=�E�\
��%2�E9�d�Q�)9�,�y�����A[_��O>R#t�����GI�Wy��)4�W�(U��c�hv���(�49y˦�)��
]�

���۪m�����H��J���{�Jo7�ڞ ��O�l
��T�
Xf�-
ȟ�\�x>�":�Ե�r����Ͻ$|m{l��Vu]Lf

�M<u
+6���M ���|�P�WK�HR�|8E�Y��!�u|2���/��+�:�n���פ��+�g�J���6��!�Ҥ�E\
3=�X(�33�1T�|t ����n
�(ǚ�ӡnn
����I���P�uռ��b�-�u}f�X.��y᷐J[h>šΡadY�^�Q�Z�id�����B�I�9��.a�Ώ�#TY4��O�7�"�+�~��m���|��fC'��{��~r�nͷP�Z�|D����%���W!��W
&�ʪ�hi�`�n�
+endstream
+endobj
+3416 0 obj <<
+/Type /FontDescriptor
+/FontName /JZJKNN+CMSY9
+/Flags 4
+/FontBBox [-29 -958 1146 777]
+/Ascent 750
+/CapHeight 683
+/Descent -194
+/ItalicAngle -14
+/StemV 43
+/XHeight 431
+/CharSet (/element/lessequal/plusminus)
+/FontFile 3415 0 R
+>> endobj
+3417 0 obj <<
+/Length1 1430
+/Length2 6367
+/Length3 0
+/Length 7333      
+/Filter /FlateDecode
+>>
+stream
+xڍtT�[�.U 4�&��C�JG�H��B!�BB�ޤ"Mz�қ�D�R��KW�+��x����޵�]Y+��<3{�=�l.v]E;�-L
��
�e emCCi 
�E@\\��3��eC�#PH��PF� �O���QH�
��%d�%e�`@
���B� *�
�-�C!a� .e��7w����/p
�KKK��N]`h��!�
�D(�0 at A0���Jܒs�`\e��<==!.�(4�6?��8 �0w�f�"
�@\`1q����({�'
pg�t�e`�v04�;
0����������ܟ�_����(��
+Az#�p�
�
�i	b�0� i�
qvG��!
�3���9PS� 8��C�W���;��E�_ep����SF����wЯ�Thw��BM�	��D��1�H;�_$찮B�7,LC�����a q0,%*
�� ��A�WyCoW���o7����+��Ǒ��!�a���;�`�X������	
v(���H����0��l���/�
�Ӟ0 ����%N^v(�����+d��h�����bJJ(/�G@��D 	i)���E���7��^]�Ok����@ڣ ���o
Dq���� �>A�S2
���[���Pܗ�������T����K��ݐ���w������� ��� pB�bpK��­�ư�Yf����wT�-�"���5"��^0;]��[.W������^@@
��n۠N���
7��!n��}�*����u"� ��x��8q���>¸���y��5 $�Dap) ��`�B�~
T�3!�/�Sr���Y���ׅ����WP,�[��:������%���`P��)T6Ա6��i�"����;�q�5�
���V�w*�$����E�bR_���[G
+�.|>7Փ�7'赜��[�鏮��fF��.��X��Bv]�Pa�����(ȉ�	��
W�V�J7��Գ[ݫ��tv��Ԛ�z��&�y�@̃h���	�\��I�KR^�=/ꉣ�q���l���@~�1��>fK"O�M>�/7qog�d4c`!<�

��Q�|v�~ڧ�(zQ~:
�#�7����S��:*dP����/�
œ�tN��C~��
�,s���DuφF�tk��;�M?���kն
o����W찓k�̈́�}�̎��rX�*�U�;a��=����M��U��h|��/,R�
��CY� c�ev���﷟+�'��w�N'˶}k�;_��%��< ^�¬���<1>Fg
ۃ�Uh�*oŹ5�:(��j?��`y˃�q�����7R,ץ�)�
�� ��-�ʶ8z���ĤT��(o���f0�
'ɚ[;n5�
`N`/�(p�~<��Otܖ~2e�s at Jч}�U2n��=��)�K�2����{�*��+�m(�ɛͼ�����՘��
�*��|-
���Asڨ���.
�d~G~y6�i� �tt@��a��,?�W�)p8"�!�Iʵ�WN{3z��W?=���k�7�%��z�j��me��$�fw���4���`�W'��\ ���4R�|l�u�w��
+P��W��E�
�Ɣ	��xR���O��О�</�o�#pV'"p@�U��3�w%��Ѣ��询�<]DN�ڟ�*Egh
SE��Ǻ��Q-mGb����4T�yG�V�y>����LI1o��L	
+_v�Tt��m*��nyrb�N�j›MYO�Ի%��B/��˷�>���==�h���ùV7w��yu�`G;���-����	��(h��������%m����ʵ��gaԛ�Eo� ���t@�p�b��	�
��L�}k�%�"5����<�W���7�
[I"[�FF|�A�
�=����A�ƅ7$
֚�� �k�q����!��&={l����EQ�Ǽ��"��:�Q�վ�������Z.� [�^�G �g
�r�O��jt��,z-k�J���~fIo��q��M���h��J,`�����|��F<�I���ˑ�3]ao�U�w0���$�rQ�4Τ�zW�S����S�z�1s
������v��z�h�K��Ji���Lycע����t8�(<����~� ����c�X���]#
fw���?�dA!�*ˇ)+o��&���
���R�;����A����]u�
̸
e()���,�V�#ׅ}y�;B��[���I>D����^�\����r��^�
+��
ո���^p��\�,�Ŷ
�j$Y��_��ۆ��8�C��=`���
�n�][p�@jw�^Eu�
����Ӣ�>��l"�w���%:V�>�&��LѾ
��#�0 ��H�-L�Q>��;��g�
Y_kaۇHҖ�
�G���)�/
�n��|� ����s����;�w�_���'oH�ޯ�/�s1A�Gձ�
,&S��"?f�,M����(�y�0����-����:b��
+3fi��4r�;W)���H_�𑭊EG��J͟�:͙���}�˺�]"v�_�v'��d�R�R�\^�Hg��>�����?���N��x
>Z�Z�
S�&v� ��pɼKe�B�39���dDzF�i8X�T�Xz�p�"��
�?]�.s3(��^�rD�ݘT���G��y�j����#mSL)zGw6�\L2��9���{J
շK��5o
|��V�����î���r<��! ���^�l�H7���儁!�-���M�r�i��ϩ�R��

�z�Q���c8?�
o�$I��hg1M��ED�Ӄ�c���*��˔UP�k���0���5A�5X>�$� �xv9�+�����O�l����(]�e�
��H {����c������/t�gC��̵�Y|i
zGS�T��m+\�����H���d
+��(��!�W0��s_����=�jZAT^A��"U����U"����7|;=[i��
� 
+u
./��lI��R�y�%�H�C@������a�q��q�D��	�
�
q��=�j�/��cN�4��6zR�����R��\������S�����]�v�=#��K�weس��l���"}먲��c��Y���0��g��%�;�^��}U�@)&�`�᎟�S"���{JlK�&'��9l]+~w�#:�{w���yݽD%�_�cV���r��,�T�$��1��#L\�Mfo؃�o���0
+��9j>��-�74/?&� .5{��Σ*-�)Q����
 Ԭ]��S~��1lbn�`��w=��#x��peIef7��
��#�Ը�}�� ����Rv��Fy��Iph�#"����Tx�hiE�Ä��D��E����3L�/A۶Y�-_��� �xNNUU��yf/�U�n1�L��w�r!�*Kj�R�&xyS6?���i��A����tY�s��pS��^m�C'3��и�Lv%K���̷�ǟN�^�R���ko��	ռ����笄<�x�8S*���ܗN.�E�?��r5e �O�UV��}I	9�ы�^�V�Ww9
+���@\�
:T�i&/G����~�3V����R�}U= �@P\5��:�1�Ex{�*x�vx%��"��*�N�o����m�kO�����iEJ���-� ��v�o���".��/��L���6�Ck�<�lUC@:�'&G�ʟ�1���g���VFu_�F|�2�g{�
a6|hy$Ћ�/��d�ڗ�4��H�Vֆ4V�o�T�9a�Μܔ�K�
������hsjl�i0����H~��J�|l��BM)�)t�&�h#'����
8\�d���P at T��:j�}�ِyrr\��J��ʏ�jE�Eu廀��ͨFH�hȊHӱ�<*�61�h��	��i�%Q��,li�GZrZ���&-�Q�r�=� Z��Q�*��)�P��ڂ��Rb��.?h��|-eߒ�
x�+�26i���w���[`��#|���T]�cAǻb�~7r��Tg�S�-�
o^��}����0 +`�
�<(� KH�H���H>:9`�7g�ߐ��V�OtZf�2��Qߥ�g��Y�|�����«it���Z{Piڼ��fE�7�<W."�]��sK+'�����Xt��K`�#$66ى=�Q�2��������8^<z:�Q�	�.K3i�Bo�J��ʳ뭩#�۶F�����շK����
+
�/?;����d���y7�
�7����������ZBl7� IR�����0����ЧU��̐1u��0��Njtm.������R�3�x�J���Y��CnZG��7O��\�ɩ`�\�D״���8�}ْ�V%���<�Q�[F����
~��u��Bz�X������\,�}
�H�l�O�ǑSY��Ȫ�L$r�*�$�]Ja����a���
S�����[��l�&��-��e���]��A�
�r��,
�!,�min_�,H��i�^0�a�~�餻�a
w��"���

�����0�0���y�����'�/�d0�T���%>[��$Yt�Xe	���y��\����e]K�z'B��x [...]
+����as�/�9�J���n<�c��l�~�����tv
]3R������A}���0�A|�nI�A���Q�&���D�h��������Va�upx-�:���޳��$�1��S��]�W��C�
+��Ǫ?�&ݦ�{y���h�Y��SJ,71���ܭ!��v!�H��������3#ޔM�f
G�e]s��%���UE�f�/���Y"�]d�S?S��
�{1�ޢV4��СS?�k
=U+�y�59��
�
+�
>4�c�e�ԔiW�:��T�%��P1ۼ���4d� N�������S��EG5h���TҘ�g�Љ���d$���)�U��xwFv[
O�a�{�~�9�pN{>�	�t~�67
C[1�eQ�?����x���\��D���96IuRf�V��j�%��Q���3?��޷*
+Oو��d!�*;��
w��D��84�\$�F_�i�	��1

�(o/qB�gN�("��
q�u��j_�V�?n�
˖O:}k@ ���J��
���ʠL���-s�l�Z�?��9�ܛ�륕��YVn��p���q�.2�g��l���[�����a����+U��i���!i��$��=^j>��ϋ�v
����%.
���D,�6h�P�3���Q�w�i��,������ձi6�*�_���ܝL�:�X=h���I�Rva6"�<�F��9(�<��>Ø/1��a2�r�8��՚�{p����
��4��u�]��0�i���fF��\E$~7��f�=r���ljt�rVz$� =�ѽފ��1;7��A��*�������`�o�
5���
Ԇ�x����6ߒV�"ϱ a_I��d%��/7����+b8�ڗ%H�H4 �'c���zT��^d"2�u$�M���M��"��!2��%�M��g�Di�$�L��;�:���}x��� �:����`k�q�F�
�������3"�(��d���k�e
�:��k�	_6}
J$���N�)��O�<�I���L�#_�_����]iV"
�P��ѹ��3�ů����)
D�� [...]
+;�?��j1{{�N
Z�
�9[4U8Պ���0��
�D����鵄>7��)鎐��
+kT}K<����0��AD��tO(S��}/0>c�wn>
+��c��ښ��f
���[��;I<x�6VQDUp)B͙�\��;���ͺ�
��@��y^HͳhV���&�����֤�h����|�bJ��+�ҩ�K<�8�e���9�$[�V��9i���*��A��'��<��v!�B��L�
G�����SK]?e�=^n'�~��\�@��GcT^}!\͓�V&"�Z�p���S惰A#���
+�"m���l]��[#>��������|��
���/5ͷ��zטڶ�r��5��
�H$t�wӳ\i'S��\
�
��?os�&�p:qؔ@Qi���{ �2DsV���4��i��ٱ
�cU)���XS>9`U/�"}Yn��HN�Bfk���Ɯ���m5<8��L����	��9�'�����f�=N����0��ࣵn�7
��BL:3Һ4�_���N�/=ߴ^%�cV���� �Q�����$Y��v(���|q��+!�~ՠ����8
\'�ɘ
�I��
+!A7ME�!r�u�g��_+�>u�
��+���ܜBI��/�P[�\&U�?d3�kِr��Q�H��T�$���J��b��!��b�G_�ł^𬬊�c�4 �����Y��?�?uM�
o�X��U����a5�l�<.R�/�]�
]{p��Ms�"����/�K��UMB�N�y�W
+9�m�4\�{ٌ�˺��*\{�a)Z�T'>
h?�˓��1�������@A�O�I�,� �`�_��7b7e8���Е�_��a�4�)�ƹ_�kx�
�����F/��+S����{��|ޒ1���
+���ym�
���]�`\Cp�UӸG�
�Ve�e�1��������PB
��
�=W	RT4'4n����vQ��3͗"
�ݔ���jԩ
O>+X�-�N=
+F�ծS�H�2�W��
�5�~�'��Ȱz;����/�~5pV"*#rl� E�l�ϋ��%�#
6�"�.�Y�.&i�s1fc�hb�z�B�.�ym
����
u����d��g�Y~��^�)�!+ֻ��#h]�_�2�~"6���xԨ��(��Ǹ�(#ٔ�š�Z#����钄�ݹ��F��M�b
+:.�Ĭbt�,�r�t��К3��gm1���ц�D=���Q�?�&\U�r��s�g�S|.vlru�Y���Q�[Ϭ�T
��O,�������y�6RD(����!="'�˄�k2��������oB)sW�.S�^�
������a[O/
��dz3���\^����!g�FF�zSb�����&T�\�e�3p1ǢI
��VEH���M
'��np_
+��+S�y�
+E�����L٪e�fa��+^.�o$}Q���HT2Ҿ�� �-=v� 45�����\�uJ���|�mIǼ
!s����=)�!K
'�xdb��^{��((
+�̩ȬT~�k+$w����T�6��_f����?&�3�
+endstream
+endobj
+3418 0 obj <<
+/Type /FontDescriptor
+/FontName /YGAXLK+CMTT9
+/Flags 4
+/FontBBox [-6 -233 542 698]
+/Ascent 611
+/CapHeight 611
+/Descent -222
+/ItalicAngle 0
+/StemV 74
+/XHeight 431
+/CharSet (/e/m/one/two)
+/FontFile 3417 0 R
+>> endobj
+3419 0 obj <<
+/Length1 1328
+/Length2 2269
+/Length3 0
+/Length 3132      
+/Filter /FlateDecode
+>>
+stream
+xڍS	8�m��4YI#z��!�m��哌��y3cL�l��U~"[�/B"IZ,Q�$��$[�6!��?��������k���9�>�<�9�QVpt�2&ӽA<���B#P�����
�PX
+��)+�@l*��Sv�,�N��”	�<����� k@c��>z�>
+`P(�@:S0#Ad�X�i 
�lJgp��/���<�$5 ���Cs)
0 ��H�l
+��H"Rg:	���R�P�l�>

� �t����&
�) d�� �
,R��
+5Lp�@�e�3݇
Ld� �@�H ��
��� �U��lH[�.4��� h�g����Dm)�H"�D��>
�v[ �ȋ@"�E�������,=��� "��
+?�	1�,
�.rD.��ٜF6��46
��>3�	�x}�"W��O��B�| �g���@�A�
��l�3�~�|A6�Ca�z� 
��X��� ���E3�Cx(�� |x4�p����BY� `39`x��
��`h4@�Hl��h�_�yf�g�Λ?
+�@��P�����<���4*�|i�Hc���+�:ML�!@�hicx:�jc=�!��<?;���Ց���o�h>t`�2	^�~	ZQ���ڨ�W����
����¡H���^�������,�S��|�C�.�U���'@T�2œC�����kl�!N�?�Vl"o3�i�ԟ�Xx($;BleY<Kv���ǚ�Ht���`p: ��$ra(�B0�1��y[FC��	 4:�08�p��΄-�D
 �M��Ғ8L&og�&ǫ�㾴� �`}�餝�~�c�?]2�
�k�h�6}H�v5�
��)����4���^�[�/??�0�)�^�W��9���/�w�Z��{D3�c��I�-�¦���
K#�J��Fh��ݥ�I3pj�Q΄���k�s)�֨\}�hON\#�����1Ω)5)7�ꮵRb}���&U?�9��
7��X�ʔ}�J�a3�����x��ƫ�R
m0��?�=S
���js6�xXQ7~����KWT�w߹����}֢���
����]�*ڽk��
�K-��j���-R���+=���!ISz,¿�]坙]�M)L��_=�9ߨ!��H�	;�#��mp�u�_�PG�'��z�S��OY>�
QpA
�`��;\�AX��e_�n|�tM�Ѝ�}wZR��U�m��Ų����!����G7/A6}�O
������
�{���f�u�_�
lFG���
��!�_�!�']o��e^��͗L\�DD�o���
;��j�4p�<n��$���K�>b~�Γ�}����#˹�
jĔp]|��?Y&��d�<�
���q5����OUr�հ��
sw~��~�U��;~^M	�D�?���NV
�Ӳ^�Ye��"ȸ
/�� 0��
�[
:��
��*�4Yy.�B&y֠�+qQ�q�ӥ�/�ܨ% %�R�cR;v"Rc'	w
ƇJP�ڂ���;J��R̊���4˜
m�#H�{v�vj
�σ����p�z�\|�T0�ξ��Z=ao��&������ �K�i����
�WM�Gq���	��ጱ5�`��������f!�L�w{�8i϶�g����mbR���)z���z])���⛭q[������1��Gލ=T��ت
+�G�
>��x�	�n�V���<I�
��7�4���bT`@�T]�z��%BC3�f�T��]�я���x��v�՗�����F�MG��
Ͻ*��H�kъ�<�U�{�]8�ӲqOnS"a��	����=���\���ϖ�ͭ���SoDz
i�v����:�u'��7U{�_/��ç�=�9�J%,�!U���[S�.x0\V��x��zOQ�����ݲQ��7|�4*
%@���g%�\�H�����(����[�ӫ�&r)ɮ��W�k�w^�j Im9�(�^�(=Y����E 7�
%<\�[�3�v�Ԉq�։��5˿g�鈮x��-*�E9[ܛ����q���a�CeWԘ�CW�B����=�%�/;�'ی9jo�:Z=c���`

�UF<�J�T
+�����_Z'��2�zB-nk��h#�X␄L���3])��N�	br�*/%��w
���
���
Iٵ[-�Y�o��	��ko+q���4�HgR�&[�L@��d�������i���OԌ�[���'=
+<��m��C�A�-�Gk�U:���`լƛ�ًS�G��U�#2B�X�z�k���#tn[\��f���
qU��G�c�p���~�vX�����X�

g
ӗ����r�
mSYع~��X���7E߆"u�rX-�b[�kv�[
�$)bFe���r٧�4V�tF��$�� WZ������O-R|�mg�5,��N;j��1o�z�������'X�“
���ژ��O#��H�]�#�h�H�=I�%ML��z;��f����	ё�S����(���"B�@9�j��h$�S���Nf��)j�E�O*�y��c�=8�|lz���A�d�%f���[�:$k�fV�Zh+
�c5NT��:}��r���&�"�|E���H�ܙ��bd�����Ż~�Ӯ�$_��2�pO}X0gH�Z���
+7���Zxb�Yt?����8��W����_��N��9|X������
�+M�����I�����_2��H����L�[���K��y[x�xsWr �$evo?	�չ���_��#Gt������
'�+,�
��J��`�{�A�{���8C��]�ӄ�^�����ވ)�Nn�����.���ۥ �-

|lQ�g
��HA�d_��z�1�WT5a(_ȁ���wJ�Vސ^�ȗ�DJ���j������~��_�jO���������;&l��v�W
��0�(飜���l�lr"�X���
i�f�������-f�#�Kt������F�4�����EbW{tz��)8R�W4��#�ld�_� �n#=�4��т��ܺ�[y�ܫ������]wmv�nO��٣(��N�6$b�\C.b׿�{ے� c18���vQhe�m|���
s_������e�[��eE'�
��䟩�9�z�t�w�P��{1N��H��9p�`�
e�axE�����D�ٝ䮩�Wrb�"�F�|�?��k��
+endstream
+endobj
+3420 0 obj <<
+/Type /FontDescriptor
+/FontName /OAKMXN+MSBM10
+/Flags 4
+/FontBBox [-55 -420 2343 920]
+/Ascent 464
+/CapHeight 689
+/Descent 0
+/ItalicAngle 0
+/StemV 40
+/XHeight 463
+/CharSet (/Q)
+/FontFile 3419 0 R
+>> endobj
+3421 0 obj <<
+/Length1 1612
+/Length2 15465
+/Length3 0
+/Length 16274     
+/Filter /FlateDecode
+>>
+stream
+xڭzUPeے-�P�C�����ݡpظ�C���n��{��;�:����q�{?���#���9rd��3V�ؤ��i�m
�b�6N��t
\ 9skCgGY[Z%��3����T�h�dnk#b����"@# ����� lk��`nj��PUR����������?=v:��� ��<� �l�6N ����@��`bn�+hJʉ(��T�@���@����� cn�qRLl
 V�X �lm���*͑���#� �h42��
�f���E�:X�;:�y�;L

l�����`ncd�l��?vۿ	�9��������`���h�`n���UAD�<��
����h��
�5�ilk��WI�����:��8��nN�2��
�
����f�`�7
gGs�1�8 M

�����`�`�՝�	�/���Y��������`���2��cd�����OnSs8��E����������?}.@��D���P�!a`lkc�0�����:�I	���L��'�����+����?��5�/��z��
Z���J���� ����al2���+��+����������Ձ� ����t2��
A�?�0�1��h�(f�4V0w22�X����vUc����
�7@����o>3s#K��Z���������o���2⒊J��~��
��G{'w�?���Y[��\��!$d���si���lr02z�?��
��������������.�?~�Z��������_���d`c�g��������Ꮺ��?�s����n@#��E[#�@�Ԍ4����q��}=��Av%�*��~U�ݾ��ۜ?�ߪ��&�>Z�N��KQ��`Z�w'/��){�Q6��٩���uK�N�#=/�e� ����w��t�ߠ&ۙ
`.)��]���I
�|�R�b0:�@Pk
+NN��
�F�u_C��ƣΎ�%�6��I:�����pWo�����í�\Nw���=���R�`�'��`�?{~�6iڌ�o��S�r&�HQ���E�F�ɾ��	���=l,)+�vs��Ζ!$M&L�)/��~4�[�o��=�F��p�� B�����6"	#�3�(�lߞU�jWC�t?���2&��[�5f�C�
 G1�C�xm�Wwv,�<}�t��:��=
l�<�ˋ�ޏ]� ���0��K��
�
dzC8-5�25����ٷ��T�P( ]���g��$[Oq��%k[�z5�bk+���ʿ�BL�O�J�d%�%5T�ۑ�8�`���V�`̓�Ejt.>�q>/�}��.�/��ry0ƴ�M�3 v��W<��[$��7��������sqb��^�����$�
�'ǂ
+Dј�7�߹��^��=�w����d�qS�ox<
+3�ƃ�
+�BI~M�,p_���m#�1qܻ�d�J>EA
�}��e���f��*��`O�<�o
PfRۆ
��M�5
2���
�-E�8��(����
#r�NaoJ��H#-|O�XH$X��8�AW��$cl��B^w�;�
X�e��.|�
�cF�B><~�b.
$7 ���5�d��j�
�A�&s|�s�{�Zd0,'[9�t�G6�P�"�ov՛��ԄC�Y

��T�M�+"��A�`	Il�F?�ϼ".�Jf�GN��B�b�F+�
.�։�N�_\?@�� {�U,��^��8���T��ϧ;z:s$�f�F��赔�o~�-��S��
�r!�N�Z;�V�!�
n��*&��Z�55�8?t�Ynz�O�ﺼ~�Nc�o�o|O�\�H1D�E{�Q��������W��,�`�%E�Lቮ�X
+̴=|�����9�R�׳� �6)�-�m��6��v�_�����
�7
~���Ȯ݄�Ƒ�)B�3���k��O��5�fJ��
+|Im���rݶ�ýu����t2��w��YX9gD�e�SP����Q�|�G��/�;��K�����

�GTULt'p����x�_��)LM	�"���©�j!?�Eax���c���l�%��bj��x�GE�mq��
c
��$8O�XJ�V���ۭ	?K��$�-R�Q�Y�������ըkj�% �m6��p�,[��*�ԕ��Uԃ�8�C���WY���:�pm;�Zz�Ua�>!���
��T at P����@p���GՃT�<�
�KH�
�ml����3��T�y3
��%ӌ�� JR�
+��5լ�sk��� wὟ8c"ft:�1��Ʉȭ��ز�����1�RӬ��9��S�
dng�3�H�B��U!�a�|��+�Jzǧy����Y��
6u:�>k�DE�`0�]ai����]=�=���H�.������xa�z���n at 5,7��%��ݪe/��D\}m �L*u�/v�s����fl�*�t�	���< e������O�]#I�i���z�F0G��
�����|�
��;[]'��M�ӝ��-kl�f�@ĝx1��Q��K9��N����~�|�
�6
m�Z�i
�G ���d��p���̖���ɻ����soY����\P�
i�EJtL�g�U7 ����V�K%-�'��`�fr�շ�7>�RCN��Y��
���R��,&Ud�w�
�*�u�����H_�H"����@�Z�nK��kOj�r�8U�w�
>C\#Gʭ���rYr��wSV#*hZn��
�kP��jf���GҊ6z��Ģ��r����8,�������N�I7�截2RӍ�9��eb�&�%0O����J�	�K
+
e[{Z-a|�9Ub�
ټK�r��h�_��< �}%���-o 8Yr����_��S/����g&�g� ��*�*�E��.e�e�da����}w�=
��`'@�Pq�S��
��\�
5
!E
���`�����zogU-�Żֻ������x�>J������]V���)�s�*���\W
�n}�wQ�{擦��e����ߠrky��an�1r���bI����Sk.no\b�	N�⼥�I�K��>
+3����~0���Е8$
y.�f*��,��Zn� ظ�JOU���?o�HZ�ҙ\NuJH�7��Y��
+�n�!�iw�E4�,ӛL�;�}��y�p-v>�`xg��
�3,Gt�\�N�i�Q��tT�
�G�����j��8�&�i��M��I���h�a� �q84|^�rH��>9�Bg(�\���pO� �{�B㮣}���Q�γ
+���P8
��,GZY.�‚�,�uw��ί<+���������X�w�T-�._)
lJw#s"0m7l��Ig	�wdB�
���l܎����{�@
F��>*h�r���T!

��;��ebīm��Í#�����A;���P�L2�`v|��
+�;�^�
�]Q���=!|�Ƽ1{���
+�9��
~Ҝm�j�N���+���͘�FSc���QY$���Y�%M��j>v�V��HP�9�*m�e՞�=E���-A]�]�*�o!��k�O�*U+
Lt%qX�Ci�)Rk��0
װ�=�e��J1K�b�/
}����qn�V`�
���I��]�T�m���>��b\�M�{U��W�eTT�Z�(��dX����`��b_ۂx?�؝��7vo��y� ��YV��8`����6\�V ��*/
�V�37��������� �c�^�����8ʹ��$3W��s�
�����6��DĖ� �/�Q�tƍI���d��1��~�`��h	�\ٹF��vl�ci�[��6�%tΧ�%�(����
!
{��Si�oCQ�G-�&<�A2�����<��-�
�c�i�MG���
�ߨ��
+�IF��������L�}�4��<\~��mO^3F�v�m�z}a��M����a�҆�0�rO��f9_끺9Ȭ��B������6>�n��
,6�m�C����
.�`��N�t�Sq�5�%R�"���'���m�I.����9q$eԂ8��SW��1���ı��7�.�ix:
4��n�1
�Ua�k�6��#_^��,�֥j�N^Dh!|Ѱ��j�/0ZxBS3Tmr/:5Ύ�!����R�cߨݍ"v�Cb�g�3`�g��q�aT���OC�'7��L�t<��n�G��J����b�
sf	
g�ze�*\�TH�Z8>WPh�8���������x��gO����|�:�{�A��D+�e�>t�r�uf�q��
�v0��
+ ��� �K�����y�Ʀ���L���V!���;�u��j7��pMgL+3&��'�h:�� ��"���Tg�&NO�������ٜ����Y��
Q�8²��&��<{M���k,j��I�w�3��n�o1���>�ى�C$yV3��
��G��.4
��s�
:�iq�]T8a*�}�<L����Q�����1���p �������t���&&�
C�
^�q���
+�uyJ��5�����i�Z�m�
X�
B�J2T�.��8+!rq�Fsp�iv�L��=�=�y\j�uJ`�؉�X1˷��MBG�_����1��~��nA�� ��n�BHx�����t�[_N
�>
+��]0�*�*������B�
���1�[a�n���4��b�Dy�5��F^B�������A��*3��
�JK�|ݝ]G���|���UɳB6���۬8��������
�*�=br��eq�"��~xMCb��fi�uBEoWƟ�I�2��
+���A�q)B���œA�<�3FB��Y�a|n�T�|�kLd�Iwb�lB[���
+m�H�6�Kn�
���.H�	�:
�^��Q��� ���8�
+_����^��O�
�FJ�����59��Sq��+�y�ͯ�K�gb�4��^��ae��!o�3����Wl
��0PV����]ʟ�N��i at Y�Y�qM�'�Y)��S�r)i�t�/��:

�(���+(��#�۝���x�JHhJ��X/
3�R-��*�l>ڠ�ׄ�:���'d��D�
+ӗ��\��]��L=f8��"@T���;?eY��?,O�8����dV��i�_�2� �S�c�|�D_\W7�	������ ��k���^��X �h2�h^SU���/㊃��߽``�S,�X�g���w"�d���]�cKzk�1��W1x�#Ņ cv?*O�[(�L���,90vE�S��po���WȮVC�x��z�5�I&�ޕ�UU�`�WV�[�:�W<EK���]���=/�-��
D��|X�?Q>U�p7Oz�X�RH�~��d�-���dhAB����\I)�^ݠ�:Kb���oH��n���{l�~)��ߝ���ԏ��QR�I?Ϻv�g?��
 `��4��h[ۚ�����t�VT@71'���ŠP��%��[X"0�+�
�u�h]�Y;
D�

S�`\�
�'j5q�/V�
+�	U�p)B�;�a\O�`q��6�U�X^ dB�s�۳��K9���$�]�3��D0��"���.�e����
al�	l�9���V�|�O�li
�/�m��bT������ϬQ���C�	�K��T_�%Q�\��x�����>�iU�]���^�
NbnLm:�-���۟�a%K�FM��x,��um���:��v(�[�6U{��f�Pq/
Ou��5:uCjZ.)����
<��Z�6�(u�%�~������
�O����o����(�.�d�U�ݿA%bj;S~�j�I-Ϧ�R@�W�l��բ�˅'�J�(9������0�U
�Z�Ր��� ��6�Ob�50��#��)r׮�ۓ�R���!a�#fJ��Ax��w,��I�u�����߱��K3Wr%`l��{��AU ��,ޘ��X�����y�r�p�W���KS�E��8�v���Ү�3LY�pV~�j��x����Op�-�5l�r��{&��+COm�:o*��s*5�/�
?��6 [...]

��8�\<�z��<�r�ӟX�P�
+��H�Y5c@�_�W�>�==3���+^��l���L6����UzI��8p���t�xh�Zb
���tNC$
��ۃ��te���^o��hRw���9_����T�9!�Ց��I-��ld.g���/R��&
#���.�$�ʷy�Q�����ԭ3���U��>���h/ն��%��8Q;8�P�C�ΟT����R:�V.��'>ܶt�o����
�Hh/��=K�0�8�9�K�_��~[��{zCnrAZ+iP.���D�6
�J�
+�+��4�
��Jwǩ\\<_�~�����]���ngqe|�GP�k���6��k9��"*
&b�꫎��)���C��fN��i
�tu�

:�SB��-O_�	
2�(���M
+����R��Ǭ���� ���r�����8(�'�R�u���줊b�Mr�˞��~4���AF��
9
����ѓ=
ޙ�CA��Y7�$�
�wh�n�!�&r�S
V�a�Hk��= Z���\�[���*�w�^�#Y���Hb�\Y�4�j�C�j���+J0` �nRpqu��î���GC�ҙ�RaY�>��0�M$V���K�

n�tc�
$�<��w~^`��0�W���^�

�_��P�KL�_�U{�-�$r>
���H�\�C���6��i�搻�`�#/@���8C��N<�
��P��#��YAP��W�8���qw$����k'YPI&�/��2cDL��$D
7;��q�Nfy�LI|�|�f����u�ys�뫾&dH�o����? FRC;��;��ῐ�~(uЬ�
o��J	�3K
+ԕ�a������
+ye�8����b��
،tNXǿ��*�}w��l���#Q�4�"]�=��wX
�����@�/z_O�a�L
��F���y�4mϢ��:b+%v�	���c/��蹻��7��q��v�"Q���j7�;���
��}
��^�P��4��)�ǞO���|B�)����D"d��H�
yͽ~�y-
r7h��X%��5�
����^R�����<�ԓ�fo$�Q}
�2��3�4oz	4�A�C?6;J旝ד�|F���	
�Uǝ���#?��XI}dk�
+�#��Ԟ����
+�)��
,�
`��
VJ���]�b; �Ð!1�0�x;5��E6�'|0M�׎����I9;
�>{�ͨ5�,����ζ���J�Nz�4����S�J
+��q�����O7N��aM����%��.j./Tq�vh€z7���3�Vڹ��U����[#�����`�3�	Mr� '���|����O�%��en���ޖ� ���tA�7�zi�`�(+p����[�v�N˒��П)ʫ�	>z?�閤�W��w�E���$��i���0z�+=�>�~".hE+;�i�QZr���u�gd��|����3NE�M=`�
!
�zJw�7���I_��|#���3UvG��.� ���e�])�$Zd�7�����i�����O�S�>��C�R�(�}����^db
��'i�Y~$�R��!'��@�G�i�
�28��*�
��:��ρ�ԇyqd�'�z�ɋY��R��+h��Ǜў=E$Ρۧ>��sf�6�5y�j�fi�

�3�[!�.�yYϟWI�D�� ��9��MR�����U�c
����x�'ϖ[{�_��4z�S� �.
(��gM�`����
sw��3B����-���C:��`f��z/]�
�w��� ��ͳi�2�0��~��pRA���z}��:�AQ��Ld�,Bw�����kr`ڙ�yǤ��2
�4���f_�v
�-"�z�����y�f���g���x1SnPW�f�Os5�0R%;Z���v4�#GQ�����33ޫ9����C9��?E�	�|H�?��:<����v�� ��8�� HOς��u��i&ă�O�a�J߿�A�@� x�Q]y(x�y
��V���ܲP
�r���u[��2�5Ў�xL&X��}���
��aΦ�|�� K�[.�XY=7(�;��eeҞ�X��"��Y��Q�[�#R�_� J��dz�ʛ��0���ő<����KQKa��D�e���f����&�}�N��=�	=�<=�K
^�cFY�!7��_��E��;-Y��Ѷ���|[T��ט4x�6�0��(-�"�u�X-��Ξ��&8�ҿA��2��6�=(�|
ǜ�+\?j*&/�RR�N��CVr��@��#��@�g�p��=�ʃ�h�]+�嘵�9���zm3Na&\|�d�9�Z+m�R�T��ż�F]��i������5�Λ=�+�2�۽
K�.�?���������{`S�i_�q!-[����]n�Q ;x���d���ʊ��$�[�~
9*�X�JIr5�*��x'#ɷ)H\��k�q���,!��՘�+	��XC�~f�W�mc�}z�䛢��.�=	ɦ���
�s���i*n�
M��W�C�Ȍ���qm
߿N�%�n`Tbc�D�r�
��<��fZ��k'�
A������F���r=X�[�ە[�����\���h��
�*҂���4�
9}�y��P���
<6]�5�2dI�I��]^���ќ%��E��2�]����d���`h��kJbf�Yzq-����#�PZ�.�V����Q�S��{�$*��z����
AY��ˁ��.�
À>�C��vrf-n7Q�VΈX�N�4���������)w��Av,�{G�ڒ�R�{${��sk^�
+���e�-IJ{ލ|�ڜ��6��G�ױ�A����{)��КNV�.f����:
�ҟ������Ҏ��c^|�U0�Ԝ^UA6�^'d�
�$|C2:.�&i�}�7a�Q�3�/�C����a�O
���F�
N�c��z��6�. ��mVB��0����M����}m�;W�1��-��7�-���2E�{x߻Q���U�o>1|Þ���Z�wi����pE
Ǽ\p8Q#/RW�;�[��'���i���)(���Q6e��k�*uPr
�h&eٚ[Yʝe9z�T��&��`����ה̤����R��J���ld7�+܀����nڡ�
d�G��ܨ}�y�Ւ�
#h)��(�
��0w�"�a��]%�
X��Bn�ݤ��v��|�ug5kz�)rs�U��[��
aڸ����K
�; ���
a��4'e�D����t�|"}�o��:�m2LES�D��	w5��

g��Sh�l�Q�[Fq[�Ս�&�Rr
�unw�X��Ԧ7��
jf�O��6���E��)<Է�7@>C�.���1
1VMU|
�@��U���r�[�������d�H����plEjFp
+W��7>-ѽs�sτ��=��!���-�/��fKH0ZP�1�EI�#'
1C��7�%�s�<�;��L��|��g�Ȇ����M�����QL�~����v~(�e�zo����:�����,�6�����~<���ܣ	[/M߬}�.���l�-c��q�Y�H�,����
��㸁lT7w��0x�����j���+�	�X�d���Lu�-�1��	�7��l��)f
Q'�zP'U��
F+!d2���֔��e�t�2��E��X��ĥ�U���d-�%�k��n"�c�mM{tgM���n�ȡ!ѹ3F
�
`B�7�9��rQ�
F3��./���3�|&[ݝ��>|(x at G`*�<+��
++�36mM�Z�a���cV���%;z�VFUN�����hAqVR�
+�<�d�`

_M�QM�(��G���BRa"�ܣ�I�<�_����P>�p�e?x�*}�8~1�����WK:5d�:���1I>�
d�}Z���T�\A�{���p&A�d���4��E.%aU4�&?1t��M���~���Yfp��W\�z�_�܂�SR�IR�
<a%C��F�驘f�_�6Z�__W�&<��e�en��ia ��xއ
�F	ƭwi{
���u4w�P���ڕa�-̪`O^��t7inJ�^
�p6ZJi\_<TOr�,eh��2X�2�°�%m靵��Gt
LР�:w��eqq��㴩ukEB��[4��S��%�oU�����
N�x��ǂ~
�
+�9\��#j�_3
������2=

��N[9�,��|
�!�\5��EGԈ��J��?BA�hz$�:\����Ǝ�$^_��tgR3Q�T�2]�����(���a�Pc��5��E�g�6���߈��
�
������@�����,�։0�]����̿�e���@�ɾRJ��8u�_�7�b�ɺʄ۫k�
 ���=U���!�5qC�?�/��x�������	ӓ6
j�L
p���L�,>��+���x`?�~�x��mC>5��v]�
v�
9�/�ݗ
����X׆�<ջW�ن{�{�6M�� Ôd-�Ɗ7d9GӳT�Q#����;[�
��t&j?t���F: [��59��2���䧠�*=�8�P��j:�l�x;���QLl
�?c��[��K���B��+��7-��K��o�t���#�dV+�l�BV㓿p
�so܍!v����c$��TkK�n�&��3UhnTy��v�*
���[��؃�͋�~�X
H2���%�5��
Z�\8��x��
1ٳH��g���9�_�F�cc�F�\G�zN
�Z�2��U�j�/�����V:׮N��PL秒
+�$�
��b$�`�
+٘��MO��6e%��Ys
ߧ2e�Y$��M�4��B)N ��	!@�X����@u���e[)k�B�H�+�<"��Z��!��6ѣ�Љ��w��y֑I}�aA/����i�(�l�K˶+M�Ȝ�d�S��ԁ�e�V.J݊�S?;r�#x� r���y5
�I����u}�>�
ά�����G�~5�.��8`<��,���qR��o���K�L!�˭�/f��d��j$dP���Y�E�Ph��b�Ҁ����e'v��wΟ�K/I�+��>4R��	fJN���)ۗ�ֵ��0w��b�Z�]�Ne�Ӛ6�
!��s��J%�]c��������3]b�C+FKPD����x[?r�B�
�T%
�K�
>�3�f��Z�6kN%
��M���m�=��E_�u�j=:�f�����Ry�k�Q7��]��g!ui�~��1�l@�6�52���o�U�a_�\t����ol��c���"W竔����`�P8ْI���F�~��Χ
i�_�yCA��
�� [...]
+�bDh� z�}6)a�Y3['?�X��o���
+Q�ᶣ엘�u�,\
�+6���w�m!��Eп�_ׯ�����.�>yU�������s�����h�e~�����>�
��H�Rլ9�6��Z[�Z1��_�!�&�j֣k%0�ܲ��F�b�`��*�o�:K^F��m%_�����&���,w�R��Z�
6�����ww��&}��g+�S���0�y�L�Ѱ%����D�Ɯ
����4�ϲ��*����g��g��7d��m��B��q	��
+����_?��r92�};�2J�q
.6�۠1pJAl�ڴ��-'��0=��	Z�fׇ��r�� ����~SU㘢i�Q��2r����됸��!6�5CS`+� (�geS���W�b�E�2 V�Mk
�	,�T�^hV��J]%��4����H?ӥ�_<�V�E3ω
z�O=>au�c��ީYʹz�y���kKeN��$r�y!r�ཪ������9*
i��O�'-;�U�d��x����q@g׋�Zk���VgS�=!�������7�$���&�(����Ɨyz�7}F>H)
�e��Q�M���=�ogr�o6�U!1�����
6�p��b	+�������v��,�_��)�%��1*V���vx����sÃ�͸��3٥$�u?�����g��^�jY�! �0�8�6��<��9i�)�]l��b|)έT:�b�Ya�q�9�xF���D��E�ԉ�>
+0������$c@�
��V&�,]§:��Z���2�/DTuu/�Js٬K˷��%J��L
���iP�X|��v��".��c�#�6�ZHЅ�P�]/�wMw08.�#�����A�[�z|
+
L�VPv����ԇ��&���,{�8q�)"�ez���L�e�5gp���&����ev�zT���NM����Z���i���	\�dd��P*ۜ%��&y��r]�
��=kM����\�
��NI�n$�o T@�#�bM	�^�
+.�g�烓�́�:29c�B��}藳p
}c��K5���{�ex�Y��S�q[�����3xE)x��a��Q#�skyI��4x��=7�h[�ЌP
+�\{ �Llg����W at -gb
�r[
+E�nE��z�S-U|����Ѻ����Mg���zз�[���
ы��P�� x��f<�Y1uhk�ɵ!����8b`��,�DT61�w���~�tA��W��i�|����Պ�n�j����~'�BI�"?�l�F�o>/_�Z��0��S�������B�y���U
�!K�`2�;�6�b��WX*�i�/��+Iٜm$��^�T;7VxZ�C�2k��O���ǥTu�wv
ҥ�C������G�� ��N�� 7����nQAQE-U�����ɉq��7BS�"((:@�a�)��Fx"��,�6�c|3{��F���&	��z��;�M
��o1�����!8�D�_H{�}dh��Ew�-b#0��z�\v���=x�����љ�u��� ?���N6�?�u�aΥ6�Q��S]�!*��
X��"=k�!
��b�}��O�m/�� �N�fa�' f{
\b&y
�~t4�>�\�H���`o�O�U_���tF_˕���3�����h�
+����cL��V[6ֶ��#��[�
�I��<O�U�;'��No题�ً��?�g)�_�g���楝:n{���-O$�'u_���˯S(
Y<�
·�p�L�t���-�P4����R���Y��X�܄��(epۢ�:iމ�FS�`�DbBmI.�G�|�D���|'�-|������o��)a�#x�u.�%�?e�-(v�(H�a  
��!�
gq�cƌh��Z>���d���.c?H�¦�mQ@{7��/�Wyo����`і�A�
����>P!(zq������^?�Xi�G�NYz�D�
����U���a�!*���)���V�
X�afv�A)�
^l
+��%���o�9���m�p>i�r�2���6�٣c�����zR�ð�u�������%�-��I]�
8"�����K�5��Ϛ4u����t"�ՠ�֏U=7��4�����Q�K��#�O�k��v��
��i�^��5���%vj�&
+[�o��lټ'}W�X�fMlHU����x���9��Y!�#�q����:�(ʬ%��6��6
�<�ʮQ�]L�a��
���dC-��U/����𾴽�hdr�bY
�
23DY�
,�>:A��-+��3&^�O}���u�"--C�	���m�
0��߈��Y�)�0�#��?S|�"p9�5���v��`F�h��-���A�p�fwߚ�+�
{��Q˞�� o�)�c.
�d��a�_n7�D/
�`�}�;E
�p�
Z��NW{I�J������}8�M����X�k�j��薳�z��Qo�f��I;	P{����|?P�����������yg�Gu�dz8
+M&@�z����4
å&B�U���r��<�$�j;*
+d
k`|
��ף�nCm1����Ą۰��{��i_�����8=��
+�#�Cox{�^�E�,wG8�)���W:�jk`�&�Q�����)�ԷQm�G.X�8KIi���ay�ǚ�
Q�La
�����m�x��( G���
x�n
�}<�gؽg���8+;}HH:ORN_�d��
�H1�2Zr��:�RDf"�*��GVC�\�G<���ը��hµ�b��f�?Fr���|x���ԃ�6�
m�$���'iU
�3��M�z�AB��=�
�0�*(��
`!V�K��O(
+Dz��
/4�-v�v��y	^
H�N��5sJL]겅Δ������1aw 4����%�mAd��u}:���q�8�N�t*D�����h�����^����Z�ѿb�e�F�~�¥~'#3�כN����/q2L5к
P��
��&��

%t�?,�1�ʘ� n�&�T0� ��e0�+�L
����X W�Lu}�Iu;Ȧ���„�PU_�]��iao[	8���:y�
+R~�4h声f�c�Y�ޫPW�i�!�E�_~�b'�X���l/��=��E@�.����ف�	���6�@�ȼ�Ž{����a�]�a��G�_T�F�t��v
Ic�/�u�Lؓ��1�Z.q�%�/���ĽMX|n�+깋�T�@F���*:�u����bJJ�)��L��2���j�h�y}� G��|��͏�:�T���+����7
��}�O�,�3`HBTu?֍
3�I�����
����Hxv���r!��lmD�F����ai�HUN�,��c�?��?�6;��zU�@gB]����I�
��c!(:�x�Ӄۊ�U唞)k՛�֢�Ⓑ�
�۽��c�ǰǨ+�r�}���*֕t�2��6�*'*s<��ݾ&ا 
Y�a����Ti�ͫ:����:�̐eJRQm��2��=�K�Yq�XK1�]IMU�/B�B�
��ct�w�B��9�X=�q$���۝x���ߠ���i�@�J�y�C��k���z�b1��$��2�p�����4�'�ϼ�.{+� ���M�U߽��$²�� [...]
� ���d?Y�|
r�B���hE��֯�6�N��Ȕ�Mz�
��W�θ`'#���#�h�*��4(b2k8�*9]�J�N�c�jY����!
�54���������1fF�r�.�����xG}�awb�7Y�R5m,
�(��䐖)Hy��U��V������2_
Y���ƺ���<.Bd�%q����˽S��޹�h�Y��'
��;�0��s���z|
}x&
8��N������E�Ts&���^��^H
�6��TlV�ۤF�D
)*�*]�	7
3="�Z[u]�k���:BFI7�W�F�':�#����F?
"�[��h4n|�n�.��>��d A��
hz<I���.jX�0
Eׯz�a�n
��A6R�(
.�/,��$~
��h��R
wd_s��ȕ~a��$$�sw
�Ҫ+/��!P�ٛ����+
ƽc��2�'~Z�r
Lv�b�J`@�IT���*8�
+�gլ(Rȍ��a�xOJ@�ʪ���lF��E�8�%��6��6_v��X
�sD&+��L�N��E!�Q�+�S�O6��ckp�XK�-�I"�9�fA�$/y-.�*ԳX�H�0?^���	Ӎ	Ө�@l�,M}�e�؍]�b�΍���W��nx��
E�˱{��o_l�I-�$1Rp�#V�u'�H������	�\��4�D�z�i�(�BEu��(	����?��UAEs/ �W�̒$����L����x�V���'�F
���|���y�D29d9�ʻZ�'=h�v1�Ǘ(`�����ٔ ���"�A�?H?L�G��-���m�L*(�a����U�q
R}��s������c�;U�R�C�>N�J
�W��� �
+��ξ�
������ a�>��3T
找;�Y�l�#�t�
=7/�����8#8DqA�^��4M�t�������7F�\lL��O9ZT)yq�H&7>��o/��oA��0UFB��Ԉ�ST�5�p���Ks�%!�%�*��0�`T�B$/]�B�IJ���C�H&7zã�m�$�	������
o�x�B�E�D�8^�MԆ y�w�sR�e�yu��H��c�N�i~l t#_>s9"73Cd�-���g�ES�z��w5���yo���k�+cM��4��
+5ςɚu�C�E���l�Q;��۬��0�y��ᤇʎhHڨ���
����4j4S8�U� 7 �@|:"�~ ����Z
[=���
�A��+���q�k��-7T�28�5{�o+܍���4	���壍�+��1{֌!�����ʂ�
��1E
+6Գ�U��m�������d at m����{�C?���
s��K�U�^#�>HD�+��y
+endstream
+endobj
+3422 0 obj <<
+/Type /FontDescriptor
+/FontName /OLGIQR+NimbusMonL-Regu
+/Flags 4
+/FontBBox [-12 -237 650 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle 0
+/StemV 41
+/XHeight 426
+/CharSet (/A/B/C/D/E/F/G/H/I/L/M/N/O/P/R/S/T/U/V/W/X/Y/Z/a/b/bracketleft/bracketright/c/colon/comma/d/e/equal/f/five/g/h/hyphen/i/j/k/l/m/n/o/one/p/parenleft/parenright/period/plus/q/quotedbl/quoteleft/quoteright/r/s/semicolon/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3421 0 R
+>> endobj
+3423 0 obj <<
+/Length1 1630
+/Length2 9643
+/Length3 0
+/Length 10477     
+/Filter /FlateDecode
+>>
+stream
+xڭzUX�ݶuqw���8-��n��h�$��P�h�"-�w�"ť��K�Xq�O�o�ϳ�suξH�wͱ�2�Zo.�D���)m�*@�pN^.
������q� �\5�
A�'���I�h	A�r�p��h�Z�� ���˜L Y��d�`��1dcg��������?�'O�
`~zp:B�N at 0����
�o� [�# ��e���`U��(�@KG���S)� 5�5
�l!. ǿ k��4��4
`	�A�֠'7��5�� @�.N �� ��\,��
�! �����OOv[�_	A] O;���'2-
�vAဧ�Zr
+�	k	�z�ۧ�6k�?%��=�<�pK�=�bY6 ����)���W�0��_p \�v�.6�@���Ow�U'�Uo	�:z��
�k�� �À��\��|O1��O��@`L�?â
�� xy��۸B���]�j럙a{J��v�� m1�5 � ����\�9���G������5�o���z���Z���Q���i ��d O�
��s�8Z� ��5�����	���?8��FC�������ae��SS��vO�p��q��m�@
@-��-����g���6@G���_m}r���7L�-���G��! ������乵TՕ�t������ZO� ���c�����
���S����R (�
+ ����?D����_kuK�
���������ϿV��F#�����
]�%��i�����vuqy�����T�?��=��Ɯ��X��'�&�+�2{���tu�"�C
j��r��!�~Iak�%��\��E
�<��[*/��;H
Y�?f?�e`��!Xfnd��6+�I�a�}<���l,�c��>��c��J���
���?�[�?1�%��ubu
I+~�3��܃��{W�,�}�=�(�[T�1L��d�>
�%�=-\~�X?�ܺ	���j��/E�������=6ꑮ�F��

̩�'gJ
�����f��
|����Q�c��U�s:B�um� H{��%�9
+�4���V�J66/��,C�_ �1Lz48�����!��Fi,�#�
+�\4�ħ��O2I��{��L���c�X�+��j�.�u���Z�:�s4��	�
��;D��6�)m7޷v�� ����� /��%�[6�L�/�h��E);e�)�l���Ճb'�|ϟ��!ݮw|������z�)�0�|���*�x��'rC�G���B�K���OU�z��Yۍ�����v�Q�2�J��'���t<���Թр�
��oa�%��-��Iv���6i��dz2
7�F��_�,�X���5��j�H��+��>m@��Z�8߹��8�|־�lx騶�+BE��t�3

��E�?��g��Sb�.��h NKi��T_�S��w�D�Lv�Qdݹ���h��
+
+k���jm���oN~���
U�]\\o,�I����p�̦1S%<�#�@���h����[3Q�N�ς�~��jѳJ)�>TM��$�
+_FiŐ�
�y�/	�|�(�t<A�C?�[��@���r^��N���2D4���>�Z���y�Yq+0-�ME�j2�o�r��2
[�Z����l3=*P����U@��̵��B�Z�R�L�;_��(���[�`�� �m
��<
z��v��
���֑�yr�ڡ�9�~K���������`zy��}�,.�<�w�Uv<(4
��E��r����0���O+Ɵq�
�
8��L�$=./jm2y��Ÿ��Iѐs�����D�c�3E���������rG8Br[�HR�s����Ϙu�& y1���r��n��Amx�����hKG;�ъ�#��
+��f�4z��i���Ǩ?��!\���v�"pݙ��K�]}��
+�]#f�
4�Ҹ@,p
�G���Lw�I��'��d"�$�ͬEeV��������ǫ+�2gf�gX5�&�J嗐��B��%"���ü{Z��ܐ�m�e�u�oŦm�t������5Lr���&c���2
{�����7�_�w��X�֕	
�I非�����&�8���0�,4ֺX�Di*��M,����4C
[�=u�|���4���Z����Ќi���؍���Qx8���k�� � @�5����X0
k��Vh��\)D�mE[8t�Hۖ}aaY���~�
���؂����p��P� e���l=%�q���bg����Z��#"�a�u�P4��M��S�׀jՎ���`;yK�v��Ef�H+�"F۾H��o7Ԡ��/y��^.�|�kpc�e�c��J?�1Q	N�Y|��>�ZLD��ͭ��p�����
^Q6��m3�3
I'�}��&�6*1r*�R�+���7,Q�s����
�
��y.A7n����io��Y�����48Jn��-������n�\��j�g�,#�ˡ	z4�~qFt���j�3���2�z
��
�������J���%:_�W7J�r����k%=�l��<>KY�jN��
+�ʲ�ꎴ�_�H�z}���Y஺��ڈ��W�SN2��
��N�E�Д3
+��}f!������
8�yȧl�,3�i�`<I���$XI6rђ��F�
N�ԥ�����wj��
���<��*�

d�3�icMi�Vf� �X.5A�(��6�S&��Y�r�<�	�q7�9
+��f"�V
>�'��
�[�K�J�>�Š�H���f]4I�6�I'P�޲8U��4����L�}���*-�6��݆�^̫
��",n��b��:�=���z����f#r!Z� A�
�6��F��#��o��rE7߾���3��m��e��!������n�ÙI�
y-]�̐�(��o��{��w�J�ʌU�߱�x��.(s��_�� .�{� FA�R��
�dC'S�hm�C�m���cF�t�Y��p� r����7��
Ӣ�ƃ��,�)�����fʎR�qW�~5̰�����x�.����,?�R��h �܁���~�

���2!�ٌ‡?mq��|�����Gm���ĉgd���&���4.[g��~�� ��
7��L�7
B���o�;�;���Ѷ�b'v�+m��v��
��p��
�`Ƕs
Ԝ�jF��췃�κq@��#����X�
l�U'�3l&�!	�6�G���+Z��'8��t��{22��Ĭ,XZ�|6���;	�· ���C�~D�������CRt����
+���|��
+�U��(QwƻW,U
+Qv-�иe����K�<���ϵI
FA��Ӵ�u4ӑ2/2"
j�WQ^�U��:|���|��q.G���I���2�/H���F`n3mY�zI�!��p!V�͒ 2W!0�M�A��]h�>����
���~��&y�E|d�t��p�A
 yKcR���P:��ʝ�էq�v@����MC���#={�6��jTCN����:P�'�nr�y��د���L��������[�n�T
+<�c�*D��Q5i��G����7�
w"����P�?^�w,i��|u;D]+p�9w�3�}3���S#	�lj�P#��ɯ��{�Eo<-(2l�,����o�ZW4}/|����� 
+�ŲF��w٪�Z=�� �.�Ϫ�#��(-�
�WL7�,�67�+�wiw�˩���&9
sE��ц�[�t��e��b"� E_&�&�?���y�k�N���Ī���9W�mzP����(�2	�|�;�#�N�LEu��̦u^���Z:M��Q��je9]@6����0r��8|��d�=���?�ҝ���5��`�ރ8�]���]���yCvE߼��z�j�n��X/���j]�V�
+FI��
f)�,�:��~��H/l��q؃ ə�/H'�f��
�CՔۛ��&�˖�O��F�A$��h���W�M�`��ll}�ˆ���\|��径��
�.���D�Ī9��=�7�["l�
��*#����|���OE��ﳭj�a�
�};�r���yv��s~�7�,�c�F�
/�%J���K�ȭ�$��

Y
�C��wy�\�c��{(L_)`����v�ED�Zg�Œ��9B^�/T�V|��2v��sc&}'��kȸ�%W:�^�����̛t
��8�| 0@�:��jY1�<�5]b�c@Õ��8˚
��H�4�3>72VX�Y�F�r{�(��\������7�}�gO%��Vؕ.��[�E"vm�inD��qz]���K}�M}�����=�H���۫l�|��[�P�4��9�<���e��0
��K�0s�yr]u�]����
єd�؋�S?���92���q�'��v�v�F�li-$q��ZM��K��}��վ���
�k�}G��/�+ [...]
+�MV��X�&�3�"�5�Zwqi]�/��~k���T�

��N}�jB�����^�6����^:��#t@�k
����EC[3TW���
+���Z�-e�ؚǑ[�
<4ɫy�"(s�e������q�l
Խ�4���P�p���$�E~��Vԅe��iE�
�+�ۤ+NL�̵�
+铣,"�?���֠��M��h�U<�3ʭ68��%"'U�~����,ry�Bs�e�a�5i���F�a#�#�
g����l�Ž�j�7c?cF��,�կ����M�unE�<��5w�ʼnӅ���>�C�!>�nq��߁}/H�k�����OS7r�=�ů�ё+�z^�4�#��^ЇMd$�ܽ��d�xv�n�DQ����l,�tEQ�7�ڍ�"֛6�����/�V�e��L����
ц�N����R�|)_f��
�Z�s񑺎S��	��†i��*ө6��#�Wc��h����F�}�U�����;�a��Q����T�d�E� ��bYU"Y�.ܞ���T���K������?�-‡c(\�z����ѩ�ȍ�

K?��%�
+��A���Y>9�ƪ�&+���Ԝc3C?�O��C��
�_>D	_?	ӛA<���wn{z��kpeF�l={y���`O�cm��s����yR
0c��lۗ�,zW��'�JD[�g��!(/���m�l�ڏ�q�{����q!��l|Er�f�%�
=�4�
+E�@�F Ka���d����2Q6�x���VߛX��v���Š�͆�{��o�s�v~��*9��1�~�51�B�M�l��ߟ|t�v
���k4v��
���:ه*�ȡp�#��+J���ȚD�)
z F#�o����xuJDCk��z��LVo�@�r�����å`�~&
	�-9��)�􎇙[_?3�a��������x�C��I���<��:e��GDfiu�C�5�wR����m9�Y�9:�%�N
�N�1�3e��-x�36 ]G1ȧ'���m
o1i�_X�l�<rQ��>�8}�}s��w�ڪ-�=���,� cw���������jqzg�G;H�{�V�4�D[3<���s�P�N�Fa<�`|)�#J�
kq
`���
��_�z�`z:�nR�8e��5�&!<��W��a(����Y�Ω*
m���}�y��=�6���*i,��K�a�.�
�x#��@����
'X���4Xc2��-m@�K
Z��B��M�D��z��.�(�q=�� ��j���t�@7LK=�Tĵ��ED1�-���>����g?�fEW�Y>s���.��X� 2`���
�G���to�Z���;
�
ө����xs�.�v~S.5�H��l�L�v�;�dy��pv���k��
@j
�h��dڂ���1��P�y!�1eN�{��դ0���p�٨�V
��.��6����Αx*K�"3���L0{�{�D�&���m��gs���V�����.�����Gx��E%��?)���
+�U*��m�o
�]x�d���@�
�/�i��ba7e�u4�d��D��4�
�~�
�5KDR�{�ec�:l�i��W
O����Xiy�.�vs�!��f�G6�����O[Y��)�:�ǣ�_
(�+I6�!�~��*��ޢh��IN4��)e�
6b��%�Pc���K����_�I�M�������%�<�z�5���	��}�wvvA��쒸�|�a�\�
+���r�+D�䥢t
���̛>&i�("d�m���ɢ�}��+y�
z[������B��ю��`�
+Gx��C����'�>�op�-���1��X�z�qw�`�3�k��^
�P[��#��E�
�}��߄���)3�Y�A�c������G
��4����=��=
+oH���B�z���X�#M�
>ԅ<w��{���Ԍ�\q ���B�
��n��iM���#}�����&������k+-��@ ,"`}5��HaJD
+�a(�
����1�{hZK�Z��(%q���\I
+gW����J��=�Bs�/.C���l���-Eo� ���h�<�_����%~w?� ��	
:	�{
+SrQ	���pÌ^Y˨Ky|
TܿI�k������4���]�m���u1�o��{φ0ߩ��Yr~h����,fg!��toM
+@�:�eI�__�
�Y�����I�,H&'n
+'l1�E������S?�
�.���76Y�5��g��O2u�Q|�z��6��45?�z؆N]e􁻞���

D
�Bh?j�[�n��U,K5���޾������f��Zk!y��pդ_��h$������!�n�TK��-�l�y|m�T���b�"+҂��;tID�OGik�	���#Fu|%ۤR׸�(
��V#Uo0��l�>�S��{ĸA`JZ��N�_'�I���Nc&��?

zTo:���am��$6ːW�W��� ;��T�=+?V%��zՇwy�S����VB3��o������R�
��I��/���]Bu��mGht�t�?
7�����%6�g9֬{5>f�P�g⦊.�?��� O�V6��G���C��8*���˞l~�B�r��K�,��`��
8����%Ϥ,W5�BQ<^ތ���I�?����OMnp����	<�I������Sv}���e�d�v�c�]�>� Δ�8Ǐ8��wK�)��m�z��<s:�AC_����m��@�H`����j3"��O�~Y�u~$�P�o�U`�!GۢC�M
�F�^��]�L�`�g�t�3��ƃ�G���ZT��,{
+
m$�h��h��߲�:Dk�SM��*6RI@�aZ��+�+,$Q���޷�D��֎�����'P���b'䏌���^��ODU0����k
+ I�%�X >
+}�(V���d������"j�:q��@�u��I,�H�xv at esԾ�;c�R�.�_ze�������*�C��������۵8����#iU#,�/a�+�3��
�\ƨ^#�?Y�LL
+gk��N��Z����A&��
+r(<��%gə6|�/�o���w(ه��V�����7���4�mQ>X�1�^;���e�ou>��q�S�c��A�ٓw!e�>t�KY�^��Cy�(#DԢ����T��V���!�k��0�Zv"\��!U�No/��eP����%�6˾]|�el�ܨ�H��ʗ�r
�
�A�o�!�>��-�z�Y�����ܠ�X�h����v�O;����rB���7E2Xw:���P�Y��ⷡ�z�J�oq���%.��|��`O��;�P�p��3�P��Yeg{%��

+�1�uT�c���"G�?���O��5Ҙx)��a	r�s�	��cۍe��K�1��C)Kv���z@</"�6V�*
C=
+c
�*Tw�� X(�=f\X4is6	�<G�n�_� �
�Ra�1~7��0�E��a6�w��9����
+ C�g�c^��>s�P����lꊀf�̻یr����R��K�ޣ�d��4o�7p�H�Z!"��|:��p�:Jd�e�F�%-����Ax��H-c�%q8
�P��ԯmxaMOˡ@+M�{Dk�۽��~��E���x���z�
��Z�T)Zg�Q,X	�G��H���*5Y-�eL�Rw�ߵ�{����p��i.�} �H%����H�ְT
�&}��ME���2�W�&R��&�
J*��9�y���:�7c[n��
M�!����֭�c:
���I��UD��{�"S=::B�Α(���A
@>�v
�����\��7#(�<r�on��;��!�q�b�r�wn�q� �=5;���k�x�!������C��(E�>��u 4f��z�8,��XWu���k^�C�k�UF���/M^�'���I�
���l'��ȼb��'��#9�
�+�yO���t�|����ٺ�֣����r3�P��C�8��(M�(
ٓ�U	��"г�&�(X�f6�B6�D�!$� [...]
+Ƹ5;�3M���:�fz"�:) [P�T���Lbp��W�������Ό��c?hm?+jɓ���v��e� ���Q��k	
�Z\��Oq�D2��5h%���w"[��|$��W��@��Z�?(3��Z�����Z������O$
t�v�|��yZ��[볝,r�
]�e�|�}�0(g
+�A��
��,���.c����|��e�R���0���87,"���k�J�w�I��]����@A�z�]����b24B<��%��9{h���݌��[wt����q�dN�z���8���f��@
B���Q[�h{|*~6x�9�\CeJ�{�
=>�-s�aؽ/����������
�_]�ZohX6\۹8�z��7 U�;��yH�i�!�V$+��m�
b��D���o
@
��4�����֤�T�-�W�愥�gP
'}�|&O�9�jȇ�Y]�ߜ����Ƃ�'i֙�Ӻ���$��e�l礔��H�S��Ī�K��S<l(��=߰Tr�
'\YJ��q�E?ʖ[�G�E�_F{��K��&"�2i
)��!�`�9���>Uw�x�Hu߄��]��H��z"���"ݑ���R��Z,W�Z�A��x��F�F�L��À\��\—T��.igs
lIaO>��1XA^�
��ت&�D�¼�v�b^�|J
b�3
��ߊ��\c��Nǎ���3�Ja'Zz���2_����_�w�.;�����>��i��
�Q������s�>G��tw���
"�^}>fߢ�
LL��B���+�T:�x�Cu9}6�V;$y
°���@.�6v��pd;�5��0
����T�
q$�B"j�4Hc¹���$_3�
���*e���.�
�-�z�k�m��gq�Z��I�HU�y<�A��tu
;�G�+W�{�z�q�@�f��3B$�i>�m1��̱�#��P�$3HZ"(�@ߓ}�*S�wrU��N(�/�[8y�1 ��%E-
V��G�N��x�^��3�|e���9�أj�c�ܒ����>�?�M�x�k�04i�,�M��ޮd�w���OK���
���wt����9�ʁ{ ���ؔH>�
 �1v�]ҏ{�Q�6�v�l
+�����ji�����3?�}���
ԇ�Fzc+'�t�
o��`��;ـ�A�T*Yߍ������-��5S�Jr}���u�?VMDT�.f1�������&E�
.}`��m����ͫ��A���[�hgkJ�x�f�����ߑ�RW��a7\�M{5��MG
��y�7e���<��)��XdO�G��n
�h��7bV/�%_١s)�%�zY�
DM�rDt4y� �R_�"^�뱠��sL�c64wxʋ�
0di:�7�'��"�i��ޞHe�N��Uq���f�EEk��ڎ����}Hz�NW��bKc��[�M�W\Qc���,|�p��j"�1xF��j�v�O�GPS��YL�^~�uiY�I�$S��^!�2ʹ�e�ŧ4a�2z*IOfz�#�w�Hp��we���������zc��ةQB#�oS���Ee�����u�й��Q�����
]��K��
:�$*
0v\9����R��5g��v�Y���
+7�l[���;��YZ
��ҡ�l2�]D�BDǭUV!��d�/r��\q��&�LO����MT���m�~�A�{�-��8�XnQJ���2d8��>�T�2�p�lFF�ݝ���H��>�8���w��б ��"��܄�6:��\�C$`��W���(�
�+}
P��dy�F��uO�U#���i�d���
�f�4����6\<.�<>�if�Q[�h���W�ኚ$]�ځg\l
��Y|�i�zG>�ĕ(��$����4���CQ�_d����V
+�]$�C�\�
�*U_JT��x��ַ=`�A�s�% �Nm<�CsH
�z��V�ǃ�h�Jq�.���\����
�B���^��S�ő���31>9U�w�4�h��Pߣ����)i�0k�Ƹ�S_q�Kќr4t9�:���4JQ	�!�R�����
��nN�g��Ǯ�x3��~T��
8��
+endstream
+endobj
+3424 0 obj <<
+/Type /FontDescriptor
+/FontName /PKMHPR+NimbusMonL-ReguObli
+/Flags 4
+/FontBBox [-61 -237 774 811]
+/Ascent 625
+/CapHeight 557
+/Descent -147
+/ItalicAngle -12
+/StemV 43
+/XHeight 426
+/CharSet (/B/C/D/G/P/S/a/b/c/d/e/f/g/h/hyphen/i/j/l/m/n/o/p/parenleft/parenright/period/plus/q/quoteright/r/s/t/u/underscore/v/w/x/y)
+/FontFile 3423 0 R
+>> endobj
+3425 0 obj <<
+/Length1 1625
+/Length2 12728
+/Length3 0
+/Length 13573     
+/Filter /FlateDecode
+>>
+stream
+xڭueT�]�ep'�h �����h
������
��w��n�a��ͽw�7�����k=��ή]��TS�*�2�ٛ %��X�y
+ [����
������������HA!�4v�ۉ;y�@3����
+`���A� ��;x8�,,���*�4tt��e�0����M0��@���
+��w��9�C�?_TΖ@�9�UTҖV�PK*�$�v@'c����
� 2ځ�4 s{'�Ϳ ��*AK3�c	�� ���~
�n
+t��8 �lA`��7 X8�9����
 �3�q1�K��nn�!'���w�;��=�l�rp�gU��OgKc翹��w7���=�����oI���a޽�� ;0����7�	`;�{��~sp�C�
���/� '�����

~�y��۝���To��`���m�����
�1gDda}�i����d���wX����,�����8�����O����
�;	c3{;��
�I���=%���Me��9��$��D��?q�]���������p��Q0�}�-���� �
���K����el
���o��{�&�_\����O����!�v�032��K�܁fJ gSK����{�����3q���U��� f��Y�L������_.����7��B�ÛIJJ\UX��ۭ�D*�π����;��]����
�∈ػ�X�x 
l�\ ���������I���卝�@� ����Y�������o0�v��f�F�����}�����m����.�?O����8�3�@�;�qi�ޔ/�*5#͹7{`LL���j ء�N� ϯҾ�75l����*��~����c����
��P�
Ug2�,��Wr��<�5�6.�� &�"��c�(��Y�
h
Nf�ݭ1e�ϰD�mlN��w4~�y~X��8������`�D���Q�tL�pp���oxp�����7!]V
�1�O�i�����M��+̣+������V��2��
+���[޵�f�|fo���,My5���8�7M�	M0f�v2y_d>M�����

U��_�����1����o_4f��vBg�4�<�-JN׎�3 �
��Or�eӁ科�憸��*���<LIk�ʏr��Ė�+Ȫ�߭D�"�
�KK,�E8B��g=Hi���%o�:�m���}�K:��#�}[���������%Vmd��$�2�HF��^� u&��������\�lz��V4Up

}Qg;��S?F���L�^� ���[��p%{ԬH#}
]��Ē���}��*�TU|����I��I}�k#.���h˺s��t�ԪY%vG"��O)*>���G�lW�,�oq�M8+l7�(�^E?ט
+~e#��;KG	G�y���6��
��
5;+���"�8�wh��ZqP'���y��
�`�<�WUBt�S��
� ��3�^O��
+^�?�s�������
�ɯT��Z$�ו��s˙*��o
.�x���+P6�a�4���X�d�t��y
@pQ�8]�
+x��y�8�F�l�н��H�|`Z8�G�Õ=��XK͸�H�6���z�
�
%�L�E��age�;����֓�lq���1�$M��F]bU�1�l��r�ޤZN�
�H��z�d�t�|��6�ڙ�y	����iM�8�
+���Y�4�����c�|R 7e�
�͡�@�Q�������h��f�33�:ü4�'�"Qn%D0d���w|�h�
7�ƒͦՁ�q�e���9�Q	�����ҥ��ko|���F
�v"������{ǵj#S�#���n��Bh7Me2��[f~�ꄏ�+Bao�ct��}� $�A���s�Մ��uK9r~�wF+�L�t��K��c��C'��EI4.~3�ڵ�+:�x>�2 ���2i�O'���P�K<2���R�������|
���lUy���������qq��]�P�
+�Zj�sB=3���&
� ��}8����TO�[��
�
$�?D�
Z��>i��Fa�Ku7P�HJF���aQ�G���(�
+<
Ee����d�>�/B"׼�,��5�uLפ�uL5�L�j��@B������(j�QG�@�U��)K�Ur��Y��,�sA��
N	�W�øf����e���ܘ�� ��ߨ��E����;&
#5�t��
�GD
ERO�!h��Z7o�&	
+
+����j�hR
� *μ�46z���ˆNKJ�%(/�xl�,Z`D���L+�#T{�����[6\�Rk�%�Y�Ve������� <XS}ۆEAܼ��$9�ҥ�
�.h��"�N��j�KTYYAbO �P��Q���ŏ�ia���r�/���\�?�[E�~�����w�$Z���0KJ��,WkΖ��� �)�~ϣXp�$B�
��5le
�PB��<�����,�?�V�
+��'Vvh�j�/n���v1)�Dʋ�1XH�E��ƣh|�"�f�am�Q���Ɗӡt)'u���`%�s&���2����_Lz�g�5M�;�|�B�����_�Ix��>�2����ꤨM�r��&ݣ�t�
�ܕ�7d�a
~������ҋ
�c�@�'!�R�����5��K�2�FO� ((3�U����{�c��U��Ϡ2���}���Q��:"6�_�@�,��18-�iD����`�uXc�8A'�?hRu=��o*�������.��!=(���TQ6XDAf��?ǣ��<aV	W���}e�� 1u���|c��m�I)��;�Lfr���X_���nK@��Av�nY��A;U�x~4��mJ��b�e@"+�0=ח�O���ϥ��N���cD�I+"�r?��0��j�n��qV���W�
���j�i��3���n��X�������xXš`N�Jt/y����h����$��w���7�!��`�Pul�q
�j�]=_���S- [...]
+R��rq*��1b�=��,���-������0��?o��9�z7�l��X��޵Me�Ը8����bm;l��+�R�y�٫�80������R�Hile-��+rS��ƨ��Ak�� 2N�� ;���bRA^'�Nx��I<��My9���W�j}�ئoEkJ<N��`K�*Ý��Ϥ:;	�P"�B�If
�Y"��u�7�
�Z�=L.7~	p�8��4]� ��t��� �@q�8��Ŀ"Z�2D�d��'�դ
+O��j�i.���*Vk��V�H���.)�@)l�v�ܸ�!�+�@4M5E&�F�1襀E�r(�s��U*.{��q
�\�O>�!�7I�RF�5~�;1M��o��D"��k���~�
�	��=xie�&�����M9~���o�����%Q���5���P��hH��hh�:Я/�Fp���d. �����3ٽ:��.I5 z�"����T:
�,��J��N#�k$�{=sF�*ױm����l`�3��f���ϨM��7����2?��G�O޼��&�P�<R0d!���+�ޖ��OM2q��ͷ�'���ABk"�
� 8��5dx+��?�4N��>޲��U3��)�-�|i(�+�”d]|S���4ǢC�ϗ#}a#��.\O
�hltK��8�U���
�\w'\չ����&� 4r0��2>��g�g�]����t�?��$Ԍ�q���7'��s�ѹ<�
�M��h�>+.��'�1Ps�"x�|b�2 ���֢�{�ʯ.�5қ�zld�{x]n�= [...]
ݨp?���a���bk�dY��8���U���
q�`5��G�a+��|�Su�2��pc*�2K�4��,����O��
o��/5��3�az�I

�m�]`�x�L j��-6Y���eN_�q��o�)d.h^�1Z�uԬ����Dj�E
;��9�c�c��`b�'
��n�1���<��^��JA10&ӟ�cu��ф
�>����`�565:�L濧�@�e�m����e�B	>�
~e�9��P�M��V�X�~x��l�v"�kr2�J�(�J��4�'
\��vN�"�[���חIL#�Yf�~aP�7�mzf�æ�]�|,*��;�"{d��]Ě���0Mf��:����]E�|ۍh��(���)��K�-� m��~kn�,K��E�l�q���ؘѾw���Lԯ��%]C���'u��A����Ũְ�N���Sўk��F<�R[9��8��}�
�6�6
�<�)
LJs�p��ђ`lگ(䃺N�C�
7���sU�%3m�E^��t�}�R,b����_�Á��*�,�u 1xlsr9��$;:0or�y�_nO����/ݡ����r���-C�b�R�+�,�zH5UK�k�0���!F�T���ue�	�,1�q
7�\ZV�x�:�k���z�֌���ç��ND�'�N���a��i������ԐJn�G^
P-�VyXd�c�xM��Ԧ�U�HPnI�/��$���D��1�YX��m��ƂČ%�[" ����y��f�~pP�
���_��H�{��v���ڢ�E.6\[��U:�[u�}�  ��Eږ����=7'0
�r?���5��M�
�W�-����xsL�
��"�ڹ4�Z��&��i�F&�U��{�_q�`ˀL�A$��S_Dג�)HPq�\�1(��0Ѱ0uꇒʱ�Ns�
�<OC�ja��<ؐ�����oZ
}	���%@���
��
�y�Sh���QDWbfvhȍ�x(H�o+�����|��;6J��F��s��6S�V?uky����N�~_�*y6�z�ɣ���M�+�oV 3���
D��ڌWx8\gNK�GrF�C���DSXH2yd���Mq��WW�6/.x[�o�-w��L�(
F)P��`�3	%n��%I�
�X�A
ߍ�j����7a�jG°��OE�ͱ�����zq⸒,�&!�!-(��j/saF~�^��ud��u�n �~��ɭ�Df���x!Q
���<2WR�7]/f2�{2�CĎ��C�:P�Xy0�_7d��"�'0�-T��+j`J�R�	3�?{�7��/�	#�Va㐝�"6��������a{�ϗ��?b1}Z�
�ػ�D�Cz}L�����?���E��/,��_m��U�\2߶DD��~䈷o-��K0r!xt�|�PG<�V�}իќ�f

o�,Ly���p���}.�%�/"6w־��'�jnJt�8��m|Ɵ��R�ayy��G��鹞�J
�h߻k۽>!�4���LXt�q;��,^��$�W��{P���r��g����P�#������y�p;�������^92vJ�oux?qL�e_|:AsJ�<Z�%�
�,��ﴚ7��E ��|2�IvR�ּRd�!��
��+�C_m�j]�M,�{�|AS
s�c�Pm?t����߫O
lQY�+s߾�ϥ
vqBS�I�| sk�k��[�����g�
%���z�
�5�熅�2�m{6i���
+�0�D��V;/
-29�~չ^�t�|F�!Z,$���
+���z
9Dž	-��-�|H���/t��|rj
���p;��we�M�}"}��^Y�n�^�W;y
.���QP[Ͱ�rMi���d��w���խ[L?h������.T�[&��������Z]��K��靨�)�B3͙K ��œ<=G��"�n��o�#�A���U������_�յ�R����us9���z0�g$�5�aW��^2��Emͽ�"�r�^�그�/�'����Nb�\s�����h���|���i�]�;���>�-1���=Y/
�nKx�1Q%~�Lx�Z�(���;�(�i�Cە
�:���OF�S�u//�ŋ��Gb��j���<�`��7$b�ޓwL&�3-���	���P�e�,�@l��<�:
+zL at Gb3�NH⨚to�i�o�_cvIp�n���6Y���~�����LH�M�NǍڥ>'�U]�0��_��w��S;�xb&���⯺!�a0�q�u�
�c	+.�7��%��eĦ��/N>�n
Gn��7���n�}� 2S��2a�紫�n��y�P�r���π�s��:�z�z�,��"R�.J�F
+�"����
��b?[
8�d#ꅄ�.-0.���
��$W�
�Y�
�	��`���[�������_��u���&zS�C�� �!�ɥi���܀C×A��{��sy�RwuȞҳ��J�WN<IO;.�m[o�i�
+����
+����J�q����/̥l��q��$�����SƷL�����Fw
5��O�~%��������`$�vt��	�Uo�Yk��{|)��Yq
s	��
�M8Q+/
�|N-�d��c
�þ1���ɛ���� W]ȅόO�h��b;5^�K`���B*2jI���I�s/EN�Yoq��
�.21���t��
ZD?�U�l|��[Ga�K��6+㳔ү���������7�����g�>E�"�:�W*:Q�40ѐ���t�
.�re{���H�U�|
r�����8�/���-�.IQL;��&���aG��9�0�*
�l�9i��
G� 4ͼ�6n~
l-�p
�&���%q;�5/���Ot�/K�N�i��.fl�l0���c�o60c–n1X��)�YU��h��Pȍ1���ٿ��_�
��U����pŶG��\g*��T�9
���W����mD�s%B{ܘ�#�(*�x�*�Q��]B5�h�i��6�i�ϛ����c��Ǹ"�Y�jq���ٶ���A��]��������m܎<B�o�����%+?J4!�Қ|���p��)�H��B���H�����$�!�yM91�X����B\��Q�'�B�.��=�d}����-����h}���
!�y��C\����(_@�'Ḵy
���z@]��[/��D�����Υ�z���Zː�F[�_
4���

+w�Œ�s�E�g�l�r���s�h�]�I� SlBy�����h2�`H$������԰�>G;8���7��UA����3U���1�r��Ɠ9���B ����C�G�3���c����q7�g���9�� �:�Vez+�~d���ٳG7���Śhؽ
��n�F����F=I2Vg�y�u�!��~��=_Ob�������/'tn̨�
�P�e�F!��G�z���63���'_Y�0�*�b"3�w��J�W�ˠ6�/K��z�V�3�
�8
+�͌��iJ:���MK�OF�4a��{.�3��c/�n�1�[B+��/��
(F
�Q7� $�����M.
�ɪ�k@^�
��2�
a�ڹ�#w:��;�Bހ�E.�ױ�aH���H�lƺ�6
?՟�
�ϯ����z��n�F�"�??8�Mc�n��
��/6���9,�o�唯�ݰ��K���&Fe�}��Sו�.��o�h��۱W�t��CO�
+�KE���<������ȉ�P>2���Fe�$
ʸ
��]ܲƏE�o�ټ]�m�(õ�]
����3f
�19�
�oRә���4d�x"���s�4��´�M��������R�7�E߼@s�}Lg��v��Mt
R9�9 Y��.����$�^��VM�cr���:�����꽠��^�jcC*v���p��>k�6��1ʭ�ͧ߂�q�昖~k4qzV��B��}����?T�a�-�m��l�}�g�����E�=�-l�T�0���p&��	�
/��Z'�ɭ9���E9={�๷y���IJ���W���Z����_�$L�Ŗ.����9WI띎rʹ�-�_�L"��'=���
Ժ�Ch/`'�и� �҅H#>����a��@h��q9�Q�酴k,_���UT��4�(ྭ��ٕ�%k3oR
��.J��^踣"�s	���)���i�6�x
+�lvC(�}�=�15V?�gL�B:��u0�w�O^${�5w߳�2�s��NT'h���U������
��
+�D��1�I%`���Y#	�,qV�"�2Y���'�u�����L�m��9(�0���gd̾�
"�ga�{w2J�>���?Sc�榋T��q5��g�{�П��m�9�
(������!#�
�8F]�ߞ�TV��Z���%+��!�-� �� ��x�Y�|`��]��U%��-H>.D
+�# �I�VwJUŽT䭄
�8�u~0
/ܗa���5SuSZ�����)������w0=��˰žz�f�c5.�
!����C���|܌/R�$c"0`y�rلN�k}W#���
Z�K��
��zo�\!�L���f:x�ư�����8
�rW��A |�2�[S˵���T�<�[�9����<���:A7�'���ِ�5z��Q
��*���D������q�9�������A��C|�,�YP~!�)fqA։Dl���_���~~����By��%x
��I�J��9_D�wn�GH��}��
�{�:�����r��m~h�nRB0�3\R�����פ�
��
���-><,��>���o�+)��x�Mf��O �m�f�Q�2JU���gB�
!�����
H�a5@��ѵ�}�2�{��JF�??��zň�� dwl�
+q㟁*	�:�1��u8!>M,%y�p��8L�qYw1&Cꇧ��
+�
M1}"8kK���\%
Bݎ�`mۓ�]�N���OT�����7j$|��Kx灈�A�׎���S%EG����}�nJH�&�j�%a�Z�12�(��z
Of�o�\��,��T4��:)�"lo��T�$��f��}N ��������g���ev͕�
-R��ǩ�ཝ�)�^BiD;�ʖ����g�&t����.-�?�1N��̧��1[bK)Ṅx��߯N��G��b��ǚ���OrqrJ����P��b)H�R�yd#�\�����0.��J
+�.�r~HR
�>��K~#��������DŦ�
+���4;�/>
�5L�W&���["׊<���}�O���"ЧaN��O
�b��T�v]~��J���l=N/rɒu��Sv����點w<M���h�
��,T��F߂(vi�6�󚲺��`R�++�{5�h�AOX1Z�1�
+|{��
�L
�Ԩ0Y0
(�0Q˿ nA�H�ge+?s/M��x@�

�+��h�����)M}���-���1
+ʿ&:��� F��J�t�xM���'/1<�
X��ʇ��3
zr�C��:k
��I
�l0��c�NG�>�1_!n�e���l������	U�%�������{/d�Uh�Lݸ.v�ˏ�sh
RD�Jʯw+e�'�#���l��
+\������e��|dhؕlOaey�7�&��I?�D~l�m���O
Ϣ��-���~)�
+~:H���^�
P��%�\LFC�� �ӡ����g=�'������"�Q��XJn�b#�B;p�uhN>�A��[
�����ѾJ�m����A��'�K at 0,�.�)�s�
?}R��kA�js
�� ����?�}.�G�q��I�m�2  �\���B�� Y����e�/�'S������9�J�BS�
"%�)q
Gb��7����[�'-��9�LU���}i�ϭ�f7��c�2�!u���˿�$�
_�
�Qyz���Z��Y�yMQ��~w��gv�;
n���`2�
lt��]*<�+'��'
���C\`8�髮��!Nu��9�͹)@��oV�/B�����/��r¹g|W�~dQ��
�k�x2d2AE�+B��L�[��2ҫȟ>6A��+����SY����"�vf|��T7�G�=�}K#
��a	�3_��.�\g��������K
�Mm��
��L at y��D�� �V�En�#������jv�j4Y'��Ϝ<g]K�E�o. ���[ҷ�c�6�X�?���
|��'ai�T�`�um1s
�<e�T� ��;F��|�Q؍�
FV:���OIеp�B+�?�y�`~T%�e���f�;AR`9x�෽_��u��w��<�����t���V�J�b��ĝじŞU<�Wq��o^iޮ����	[j�����Rs�
�������&�P�o��L�Xַ��X�=���2���$���@2�w���
T?��ܞ�f�kqxA�N��V�K7vG�-�b�2������|�4\�(?PU�����?P{;3Km���q�m�fa�+��|-�Е
 [...]
(
�*��P0��Z7DOy�$+�D����j=���2+1h4a�sg������
�_���n�U4��>ش�)��me]E�a��A��6�5�R���]?���L}��з��Ͱ��s?S���k��K`�q)�o�Ez7q?
r��1��ZˣD|ER����]�ԣ��F��˅݆۬�.��e����uB�������gA��T����'��]l?�����
�����-%�Y��~�M�T���KC�j�LB���87!�
+�0�	.��{�{f�U�D�8�V?�a�U��Jtw�z�Ȭ�zX��ݎc���ڶ�
�A��tՓ�xr�R�~�>��@���7f��e��5
CR�~����S,��r�U����o�ce��F�r��fuLÄ#�QGێzU�)�.O��3G�
���2T��`�
fzGν@b��?_\���
+��!�ޚ��0a�?���kL�1����p^�X��{��J]�
+�]ZN�1x�����+�u
���M]�x�&�ͪ�jav��}ݕ?���u8�y�6٣qp���
�s��fha�2?��n�n�Y2�w��~?�%�%��a}�"���Px�v�,��n鯧n���2
i��0�\F~��A�&�����.U���(��I�e.�����A��qu�S5[�)����x*hB/�f���%'ۤ=|�əc
+N����C�W�~�n-�^�
+�ʩ��5�3jdMd{ff�(�r�u[%Ŗ�xhΣ5�3�%�7��)�ڀ"51�V�
�J?�cm�l�>���[$��1�[~�����Ix#]��Z���ތ1��e�K����ekN�r `h�`E��V[��	�]E닛&���Ƹ
�	%t h\�R�)]�ƉM�^מ@۬hK�
;+0t��}���4���
�?ԨtR"���/j���r��E�G2���P9U���V��I�zx
+
+_a�GO�Oׄ� ���rF��S,�!a�X]K���һ8�|u)\E��Buw�aG���N{�8�/� ()z���[���s_B2b���q[����%Dߜو��,��ҹotN�g��$f��?P*�1
�
d4Cճ%��Dfc�Fz�6���`G$>
>hZZ��k��Ĥ4�g[L,r���aE�G֊��[[�.�O�q���Y�pT?`��p�
+�����{�熜�cC�%!k��$�(~�L��f��@X|b.4Y	5��&�)�M׬f?0�m��i�#��VyE����?�g���{���
�W�&W
+E1F.�����-"�Β��e��^L|���6��#XD�K�[��;�N�M�ŵ@�z���zd����Q��S�V�'N� Y�&o���d1[*�D-��0��TX���b:2#w���on�+�Jq�d�y`���\��Q+��Ac��������-`�yLG at U��L�Y���E��^����Gm��*� �v���'�
&��
+�:��X�yr���oRwT��፮�t�q�X�
�Vɾ�

 ���T�y������/���Bd��}zae�Ý�Q� PJ�Kg�;a���4/��.�gO��Ƹ�#0���[-Q#��&��aWF�t
il��GܛEpq�2��U�7�K}5����G���=E�C�l�ǯ�0Ƿ�f"w���#PaT��!Oq�?� R�m�y1���"�u����u�z�繼�f�n�k��������1u�t�a��胞9��[��rg��&�B��u�i��9QN�ړ?�DI���'6�>ˈ��&�M
�-���+�
�p���'d ���>�t�9X�퇨K�˙
�X*66
����DK�
G1�
-���_s��t����Yd�+�9&mW�1��%�<I%�d����vM^l�i��@�X�V1�6��p��W��X�ҘO�
�8��^���w�v��k
+�������A/��hx�s�rVZOh�y�]����Nr
�"� ��2Q�Y�ĭ�d♥A�f����;��6У���I:���$��{^�J�� ǒE�!_��&�.�Ԛ0���{A�jf��tC~�t�q|	�K]fQi�x���q�c񆔴D+8K
+Ff	W
�ԙYv1����Wם��;���Pd��]�7S�I�$E��w7 �٭��,7neo�~�6���a𰴓�Y6�3�2�ݹ�{Ǘ�D�;������
�'��e��
]ֆ��z��}f����g+�7��6/�t��}�
�d
~�6,<T�$�a��H�Iv���T����L6�:RRbx�eP_zw:8�CB��ɳڬ��'<�(
+�f&.�e�*��;JH������

�2Tد�)�Ts�*2c EH
�����%�	
p�:��Gٲ��܀�;z]ց� xÍ���QE<�i89�a��{٬&�CM��E�	�b�/����`(�ă�n���O��j&��9SV�{��J��a`e�_<H����X¨O��U�O%w��t߸��j(���q��
��T�$�QS?J��s7?&@T�`����%��`��3�0���gI{������v�q�\�G�w�ЬBJwKL�9��F!��M���w7'��\|sdSM1[k���4h��
��TJ�vxa��&N캜�Xs�øU��Ӛ�՘�\+/�qR"���K ��H�- ��aE��M.��pc�}hY�;�N��S�� ���%S	� b��)�7
+endstream
+endobj
+3426 0 obj <<
+/Type /FontDescriptor
+/FontName /HHESAH+NimbusSanL-BoldCond
+/Flags 4
+/FontBBox [-139 -307 822 975]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle 0
+/StemV 114
+/XHeight 532
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/Y/Z/a/ampersand/b/c/comma/d/e/eight/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/quoteright/r/s/seven/six/t/three/two/u/v/w/x/y/z/zero)
+/FontFile 3425 0 R
+>> endobj
+3427 0 obj <<
+/Length1 1641
+/Length2 7476
+/Length3 0
+/Length 8314      
+/Filter /FlateDecode
+>>
+stream
+xڭweT�۲-	�

�஁�!x�h��n܃���KpwK� A�k�@pMx$��s���?����[5�fU�Y_�nzj5
6	s�)Hbc�b����L��@{%�7[sI���<
h
x����%�@@b/���: s��
��
�B�HB
ܝ��V0 ��[
f�[~� L��F�"�`K{ �Ӄ
��`��=Q��5@  �
+� ۂ ��jz�*� &Y-�,�
��Ԅ���-�
�6�CA� 
������S��֠�O\P  u ����@nf ��+��d�B��`(��	h{� �7�u6�]���� 'ȓ���D�� fN`�)����_u¬��߹��' �x�4��9�n��D�€`{( r���e
+����@���OdN�?e8C��������:�ۂ��'�'�߷��>��{������h��� �AA��h\�O9�`O�-��h
�F������n���7�r�sAL�g����9���
`�@�P���R��g*���D�H��?"��N�j�_^�����Ojg[[��� ��h O�
+P��5����w���+l�������M�?
u@������_���Oڰ	�
�eCe�n s50��
+`�}��?v����l���'u�\,������������
|A {���$؟�9�dtU%X�{�����<�4�
@���JGb���o�7o n O6.^
 �� @�� $(��ߤ�����2�v�s�srr������d�i{3���Ҁ�͟f�_�߰���ӓ���S���L?�2C�:1	�N�H���
�I���p�9��k��UC�}SCׅ*L
j��>
�ju�=p����rg��-cw2�8�ܛ��7w��]�e�=�Q	fڡN��Ɍ��;~N흍1��F�H��y�PN���h]���
�|�R�b;p��j
���>
v�"�n��dǠҋ �|��a�&N�f��\��o�޷��U��VY=4]�	����(�����)2W��\�I��8�WT�A/��i"
+�S6�^�*+3f���M
�rI\�I��ҡ�$7��ns�N�e��ޞ˶_#�g$6˽h��%,�
�kT7Dy���ڼA>0��5�@���V��U���K�]�P�<
LG����_�w�kMno��4��\��;h�����6�q�-��E�Tm�E;�m�_� )>w]�׺OEc4�u�^�~T!���9�D�7z%|ݬ���&]�sO�/-%kU3�G/)�
n�/����<�:��z��b����%S������YG��E��	J���5#Z�����aB���_Q��r,�Yf�
NԦ���SH�v�o���V릫±5;��03y�H.X7؍��>�o�~ H��睒{-�,�0��pe�ҩ�d��]ӥ���Q����k�
�|}O�Yc2����VVTJ7����/�N�>����REhF�'w+��ꈉ>	����}
+s�p�3��v��,Ц�@���Q✆�.W'��K&�ѩ�����oc1;��"��a����	ɮ/�_
ܷ9��
��L2 +{~�i
�3껮���������x]����|)-{~��ݎ2���}-B�8���9��=b�VFZtI�˘��:6N�4�ә�9E�wY�����#G��~�2��mF
%4ߘwhk��V��*$P�e;��Q�(�ύ�f��ى�;k��]!�%d��H��{�3�\M��čnn��V���Y:�
I�\�3��#Ÿ^��`]�\|������=��8g�!��L�D��מ���L�ΆE�!���0kF�W���f'�˺��o�T{J�Q*���
�I�=
��}�=���v�HӴ������lh+�p�qHP��E�Y"hw;��vh��]�ę��^5���ѝ���6yv���f%�.^|����[���Gf�di��]G���1�;�˲2E��
��3�&;'�L��/��V*�׋ke��$�G�0T�P"3#U�G�	"���N��\0�=L�ˬ�$S�~>;��Ր"�
%q�1��n
1F��U"jx��OT�
+W3	�����_�0���H�Ρ
M�G��]��m�|��G���v~u�vwz�S!��`��U���Iv�/V�w����uo�o�# �r�Jc�,�d�����o/G>����T�fMgE�v�ޯ��,~���N�k�h�,O��z�����:/�p.h,��l[a��'Ur

�"U=B� ]i����(Of�u�֋Q��(ǹ��EQO�u�
��Bi���"B�4���?
K��@�Q½|n��\�b����B�
��N;U#�
(�j�&��U��\�=m}��'5"�s j�����Q&��I�e��)t����Q�΃d���R+d�ijk8�WX�t����W�!��ױB���@�>|����nZ�a�!���r�}����a��H3��*z��V���!�
m
��.�����7����,������������"��&�l����}R�	��+�HȒ�L}@Lz�]�vi��_�9G��#����0;�E��6#@���O�
[O�b
+5�^ZS�NHI�%y�!Ar�m����ߕ�p6��ۑ�g
8~�s4�z��
	�u�׋��
ɺ�d��
Af���LN�*l�o�����Q<sn��W�rK�:��R�e�ל[���7GM�����s��c�-�r
7�T����j�z�֒`n��
.y��CKGG�
��tX�Ƥ��ޭ:��A2�ߍ�p�~j�L�af!o�qi(��@}[����B֫�7�xsbDr�56YbE��ds�f%�
+0��h�3'��8�@+5�KQ;�/��&<%v

���p9̅�STgg��%���=�3�� <[B������-#����B;��k�o����7��B�# �+#�;~�b,�Jb�q�m��覕�>F��Մ���s2w��@�O�#�
��5_�.�����A��-[
��/E�w��
+��Ys�9�*�N4
�]�7b��|@�!j/�9�/����E�J�8�&}>�`ux"�C�
��
Df�����'~Tm�i�B�u7��`��b��������zGO�/O�Vd���y�&Z����z�w�\��5������r���`�9��L{
�B
���c7x�7~���-� ��)�6�S�K"��ě<
+���tt&�ν�#D�
���a�-��p�ZrnW��6�Z�
�n0������ܲ7��K�
�LJ���@�$�˿1SRיo��IPd���w>�g:�
]�5\�U��:�E@&�Z��̥�盎b`�j��
3
�yZ��S�$�3
ײ����S�V��S��J�B�4�������#��ǝ��M��R����[\��8ңA"΍���
+[zL=�wm� �
z����Vy&������w׈�r�������6�u
�(���d?F�WLo�"ˏ攼��&-KxW_ŗXk�aw������k�~[�Y�����2'��Z�gmI��DM���Ap}��ptȟTb�0�{IP���.$��*�3i��Bfi��Vt��3VV�`�Z�
�W�f�(�
�͕�11)�
+4��L��+t�}eO:qӎu�9�@���V�G�p5�Zlbe"��wk:*��[Q�8�<�á�)�����-
���8���F�(31��M���a��Y�95S�'37����w�{����

+�}S�
q�er���׭[�����r8Zgl����)K��D_M&s��E�>t�}q�ʮ�-��#�w�h�|[jF�U\��b)v�R�����5�[����OT�iɜU�:E|'�v[?�Ѝ��DC\��lx�8�G�!;�.� !
"��t,U���� Eث\4.mtdE���e
+��$��?2��w�E����
�X=��1���(p|����a����rZ��%cw2������|

)�=uiw�$d�7?�
'���8��=K


+�8�a�
�X*��!kv1@W� d �V�h٥�7�B��ڐ#�����׀"�|#�Y��!77�
G;m�~48���
[�*�2�{�Y���2���^���LBh:��&�>j`�����\.���S/��dZ�z���&��gm��U%G}�1_�
�}��'���&���
_h{�3���b��X�w[�N�7z��r�j�žJ�
�8�B{����lb���~
�ᩨ ��
2҆)��0O���|] �0s�w{4�}ȨS���4��
m�odR�>Z�'
�-��
�4��3�%P�&�
sF�֧�N����7��;�[)�&-�e�Ol
TElۑ�T������^�
�r����|�R;��
+L��&�
��L끐��+e
~�B��k8�k�J6���Q��2/_�
�m���/�xQ"
+����+=�0_9�^=�*� :��FD
o~�c�M��
�O����	��
���8��� �
n�)���E�K};/�4�ʶH|�e���$�MUV
�t��vj{�ҟh*�#�Oq���n�>�p��\��ӡ��̮:��9��q1($)�cR81$��74�-�ݤ]�Wv��r,/3��R(n�=A.V<�&����O��3rH�r�Y���6)K�g�d��W
og�����**G���ƥ[
!�jɷ���D^��P|1%���[�ш�{\j�[���*�"淁K�����ߋ
���(�����k�8R#i��߅���B��|SLI��F�;��G��/�
f�^��
�W�UǻJ�4������B"�bHAENtuq��
lf�T;Fz��E
+},�Z�1Yp=��9	�.
r���&n��
���N���ޯ���j��U���
PL^�~l� h���	r�
g�R?������W�u��Ҵ Q6�����@�]�ϼ�⧇&��˒�Z�"#l�$ޝ��|��G0��7t�w/����8U]J/�y$z{
s���w~��
4
�t8��%�[�H;!���s��L��g:��*����
+�$}h�|�S\vs��k���l$u����0�(�Ps���dv�
��g&ۦ�<D&b
���
�w4;�lB"��=��m=��,���!����Q�k��� 
+a�h��pL2��*d�|8ɫ�K�8%斩�퀷el�fHd"J2�x%zN(=����Δ"$��f+t"���I��Z�� �$�;�}�X��Z{IyށS�njZ�>�gyg�W�5��"�����IZ$�T����X

����~?)(է�7&��0NKq��DG�-�(-�X�k�L�K'61D��p�Z�Y
%{�*��me��f�~ �#�;��GY
�
;�-�ƹ����6�ϭ����-�6�rx�V��Y�!�er_����+>���\X4�
Sq���߂��Evԛ�e���, *#5z�v����US����۬+�b2�E

1�}��E�:�S[�$=�@���[t\���Ӵ6�ZU��mt5��d�B�[��)�;bIX�6l�S܋b�E�g��������l1ލ(
�f�>n�B4ϣB�
�SՎG
+�ĪZ�
�SB�:k��E"tyH�\�
��>�\9o3�"����ud�\đ�Ɛ�����8�	`L1�̔�+�q���4�1�Y��Y�6�d�45b�=\�D�Z�}��8b/��?�g�8feNw�J��7̼��1,�;
<B��9���̹{�|�x��9b�Λ��/3.��O匏�am�/Ǡ�Y*�gY���0�N؝9l
�����,�S�}A��	a�3�,7�5�)���##5j
�U
,o�'Ij!�y
�zȖh
KT��e�uo� N��bh���A��ĕ�;f�qh8�;���e�{J�wv�ȏ�=A���,����xWR'�S���߇,ȉ
،QT>���Cybɂ��5-��#�6}�fQ�_]<��.s�4�̮�&}yFo�k��<�#=���Pa���ҋ��h�ìB>����o���W���*��Gڢ����Z�z퐣��r/��z�ü�+�3{�1b|�r�������8"��
+Q��};��m����[�a� ��sgRC������5�c_�ܪ G�+�O�õ�TD��]f(M`>�,�t���i:��5ڠ)�vJ_c�_���O�s
]���0&��
K�J:�h)>�����\�dV֘N=Խ:��&='I�\�ы�N܍�֪I>�RU�%n\�1��[q�;-
\�(;W֘�v� ��!���ӭ61�Cc~�JcV�B���K����{K1
�w
�����nȤx�m*"T�b���w9_������f�iYP�|�M�d`l"�
��r=��B�%�������#!ι�u5���V	˻R.��Yx|�Z$
H�0]}�F

�������f�n�A�.2�q�+�#�ijݝ������+�g���T{���+�
�Ӗ�eI*+a��vh��g����An�R#VB�_���
�Nr��Sv���>�e��aDiy�r>�Y�`�<��)�mU����^R�����&G ��~U>4Mغ�)󧄘C�w�~X
5�V��>�M��`Q���׷�V�VZi�����q1�
>��{��S�K��n�����#h˹D��	?"5��T�����W�Fˊc{0:�c����kR�)Mə�QH��2���f�g4-tt�>/��
Ur��v���十F]'�
(��?����?�xULu�P�67b��頱<�c�A��7��>�W	�^�9�NI9b򢡅�D:<�����]μ6����:q7�/�6�8�o�3�u	\�ۨަ���
�>�af��6��a�m�:�d#�2	m|,�`�ٜ��am�)Z�_ʳ��f����3����PA���A�g�{XJ̱�ӳ�

�6�q>?NM� ̱qY�d.X��~i
+w�7�v}��fAۡ�'Jb� �j6X�4%a:�(0Օ{���V}���;T�=쭷�*TW���~)�]��JM�H�	��k+<R^�n�]�ќ9�dJh���@��c���ηxl4z{2���&��\�N�u6}�#y?���v
+
��ۢR�z��F�5���
��fZ)J
�^����~���R>i=�t;�e�N�
���	p3A�B�j�;-�#����?}��bx�F|���
O
+E��Z���r��Yx���BHFԕl��$9�~T��ƾ�M�����.kb!�M�Y4ӡ���7�4ZɆ�j���s��m"��l�ŋp��y�+��*(Ug���x�y��铠�
+3�O���'c"}*4ެ�=C!:����,��\F�@׹%�C��{�Bz-10"�BB�M�`эB�i�U��jUh�z�e�
q��gڼ��B����Ȯ_�� |o��n��O�����~��Ǖ�s(
�̀�dr��f�?����dsH���kR���
+s�2�C�%`KlL����B��N��oF3tR>�۱;R��
�Bu��턥�ߝ�5?:!��^q]��`�)��4f�9~Ѹ�1laˆ�1�:Q�?�Ð�Un���?���;����ԟ(�;Gw��@^�7�'�� �kA�e��c��: �g�We?>��wA6���(^�Tp)���o��t����n��&�
/E|�6ߒw\#
�,"/D�$�uhzA�
'��K b����+�&��T�%G�{��
���
�LD�\Z��炯_��gɦ��6���b
��n�S�>;�M^x�Ā���&��6s5�p��������ot��좁�|枯�کɻ$���������Q@(ܒ2�
��
[���T�j�
+.K��c�֖걈G�|R`^�j@?6�Qiw�(�%�c竑���K�
c�RI)-��o.�$�]sQs݆�>tc{c�ҿDo�BE� ��P���V���%1{f��ㆁev��s����&����1[�퓂��=��-_5	
�@�.�1#:�X2���䛳����5&8�V�Y��������~���o��٭7T!�u�S�%���a`�g
Hur�f���(�|��>dȣ*���O��ksh%ޓ�cZ�o~u��g�t at v꺯U�"���p+��p�<0}�u|0���L�Y[o/'8��A��7z���0�������
ҿ~�SFWk}�b�׍�O�BR����b��s�k�.0��*�C�V�t1Yx���4�K�G	k����T�,�O��ԇ4-�w�\+f���
�
�W��9��Z�� ?����*ōuS�kl�I��
4��0�_÷
�C�8պ�/E�����a����j�e=
f�׶���$4 ��8ƺ��9^͍,�V�����=��A���A
�$��w;_�`CyT��fcsЗ
++���ٰH��rU�
�5��`rvVی�
wV�TX�<	��om5�OZpșm�E��En��
+Z8�� X�5���8ջׂ���HB�'�7���rx{��M��^��,��ie�� �!�
+endstream
+endobj
+3428 0 obj <<
+/Type /FontDescriptor
+/FontName /HJFXOA+NimbusSanL-BoldCondItal
+/Flags 4
+/FontBBox [-143 -298 913 989]
+/Ascent 722
+/CapHeight 722
+/Descent -217
+/ItalicAngle -9
+/StemV 120
+/XHeight 532
+/CharSet (/a/b/c/comma/d/e/f/fi/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y)
+/FontFile 3427 0 R
+>> endobj
+3429 0 obj <<
+/Length1 1166
+/Length2 6570
+/Length3 0
+/Length 7330      
+/Filter /FlateDecode
+>>
+stream
+x�uSu\�ۺFI���������a�!��A�;���i�NQ�{�}�=�������z�w��gQ��j0��ۛ���0f6 ?@bg��a
+UdV[� �@.STjjM���!�6�A졒��'^���d�`؀�@^~.��5��@{'~������
+���l!�'J�
�b��4\

l!`su�������x��?�$�
<� �V0 ���=##�����/ 	v�XB4O
W�����JO)d�P��S��cU-L��!����`0~VV
S���l��X����K���N��[3I��4��?u��ڻA����@����ŁU

+qt�I�o���7f	����@> ; � ���X���p �A���M���
�
 ����w
������
�9���y�_��w�ll s0[>]��ٟ`�ş{%S��
` d� ��߿VFOjn���;\��
`ՕWW��e������J����	`f��zr�SF>.�f�����j
+��>����Z���
�IǿFr;9?y@������_�
�t[��|r�ӏ�Z����j�֐v���C�?� <��
P�V����?�M� �
���?u�����#3���Ġ����	�,
q��B` �?�����C���3��K0�q���Ӵ��l�`g移��C��QR
+
+�7�@-�'W�:��
�M�\�����ゞ�����<5��A�
�� �@����*1b7�c
��Z��.d����Ͼ�<�Q&�)&�̹�M̔T
��0�W�
C,��f�'�΂����\6�h��VP���n��KA��qG�c@����R�ZXb[#�
χ�Zk�Q��Min�
��Yz>�[�CY��j�H_�:$���!�h�
�7���h
�W8���&3�}�/�|�ˠ�j�͈��y�;F;�o��D;�u1�e�n�����Zb���DK���A at 0�ǥh'� B!N����>I7��;�,5�3�t�[�,�ʦ$pQD�Y�X�na�k���8�4�
�mk�IӞ�{�2e4��*�ӡ���\��85��xW!��]o9
���Tn��Nk>�<��:
�OGELf

+�n�ָ���ӷ4�L���}^sD��˹����V�r
ee攡�ue����.qf2��7
Ͷf#Y.l[7G�~5�A=��K*��"��C�A����@sF��Q�Uq�7�m� �Wi�ohu�C#���eevf6¯�B5V?��hάX|�#>���U�˫�'���U!���m[��@
��-��X�!4|P�:
O�����D�ܳ�,EHyD^��:�a�å��N8āi�O�*Z�`y�RӍLjU�m+BsI�8l\�j
+ie<)(7������F��
�g�
+
�(d��~��!bD�١uE�]U�϶�&PB7B�Ϸ�G�\�����-y*g�q�Z(�N_��5�7��#�ǹ�� �2�j��W�=<��<��Վl����Y�Bꓷ�)/Wq�y �M[�:���L��z�h9
�[�^�q
0G*��.*�Lq3;;�,B��A_v�PA��p4��
;�KG�?T��]�'��q�62aPء�W���n��8jq\W�s�|AEԆ�.�D�8. b���JV:�(#$�
�o��,X�VJ�~ƣ|pkc�E��j��۪���a�z��vP�Q	�
�f��<���[��U������e��8u1hApxx��TH9;�GW��vM��
+A���\ع3���߸Ј��KMp&�x�h�Sc9�N`C�zt%�%N��mnY��\�$�pc'�kZ
3
�@�Ӯ��0R��q�R	'5IXB�Rk2;�AA��eʆ�
���w48s��P6L!�
m�&D�W��3�I�^�Y��
R
+�~�	�g�3Wx���q���~hz嵒��! $��*XޙpoR�'�T���;i��J��}�->R�4q�Z�UX:�
��&p�����ח�y�ū��74�S=��U��
���vxEi޽#J$Ҍev?p�9ޤ��V� 8j��T-#�����׸����#��	آ-�Xkv-��DH��򍽺}�/j�ޟ�����9M{ۨ<LhS�3 񒺅{G�.4A'
�
E�n�SxbV2�����M�$����
�pZ�a

�[β\����@#"Z�h{�B���*V$
���a�fݮ5��؋�i6�ւn�+�d�P����(��p�e���q����OkMiȢ62Hb%#H�PR��� e�)�"3��KX���[-�G���y����8���4�u��>(�旅�5�H
"��DX���x����~��_�e��/�I&x�
+uW�=_�
e
9ͤ���%��#T�� �Ե�X,О,��dS�eP6�P��J��
?��}��^VƉ�>ۻ
���v+e��-�i�@`	g��b����a����(��S9�� ��͸uP	[wӄ2��n+���A�_P,�� ?G%n+ŤfȩI�gG<C0��pɤ�~gQ��%,���O�
k��Y�#Qz��`�
H�F~��j�8�QVf�-����hu�
�
��Z�j=?t6�5�n@��R5�a����ͧ+�n�d�dk���X
���P�m��zj�Ử#��ǎ��W0�$_q�6V
+�N��.W|<�7�3�F
�Xf"��/�M�"���Rg%�y!��Z�~
�U|�0�H��N��{��-{v7Z�c�g���������kb S�]�⊕1L����(��&�A��< �}��dM��#��B��끿�Uh{_똲�bg]n�� G��9���ی3!Dr(/�B�-{�Pe�
.����N��Q����
~�z`4Yҡ�z���Z�bbؠa��
��C$b�d�D&�	��p�����
C
��x,�2�nݘg�xh&6��Zp�k�jC�7��+���W�Ǿ ���Δ�!wV�� s��z}��K���޹��
����1���
V�3�TJ���LC�‡�&���h�D��u�"����u���}Q1P�8���/Z
+UK
+	�r�Ң�88jI����.�dB�
�J�;�����
E���^�.���P�閽���>m��p{���/ǻ-��f\X�Y�)i��ܣQՏO�W�#���
������m�6S��
E� V����CD��B�����K�N�cnr�����i�/�
�|�~�r|�ƤDx�
0��|����5�l�mJ׵�~���c��AL�θ�r�['�?a�}��[����d3����)�g�n�;0�0�����9����0Jf`
��h��ʄw�������Q��L '��j��;���$�}�\kѦ�uݭ���Y`R�`��T�t�m��������P�>�b���0�:��6b�`�h{h��cy���v�8_��
�E�o�k2���t���p�-�$ �^
�w����fk�S�˫�jB�

�K%��\
ĝ
�k�9���	=t�Q+�N��\�|D�
�Eb���-,(��E[
�ଆwa��/R��p�-��,z�[��E
��P,����F�'fly'�Ips�_[�ۧ��MH�F�kK3ܭ
��yL?:�=OĪѸH�-�U�ą���%-7ɨܢ��mP����ۼ�#΍����;�Dasڒ%�p$�p����qQ:�����bH�BȔ;i�r&3��Q���������G�I��M T~��'l�;��r�I��Va�>��z"G
�
q���u
�G]�Q�N�_�@?���1B�*@��9�_���8�lsZ��E�[��1b5�o�3�Y�C,��qE��stxj
�)�:
`��F8��J*�S�n�]mW:��WQ�~~V�nK9i�s�:�����X��~� 
7vco7�7fi��n3��!�
+��i�㢛'���YزT
EG�,�4��LkL�pd�qFZ�8
+��6��/G���+s.էĵG���A���̊-�RY�Î+Z��3<�e����N��׬����x�8T�`ǯ��?�͝^}��
f�8O*,Wu�"�|5n�'�+�:x�g�f���f4ׁJ!��
"o�(�9;��-[���jn���M|�@D13S/�I�Ht����#Ύ�59�ظ�/���t�V�I,[��+π�
�{O�|U#ԃSa)ͦ�jgx��zK)7·5�~I�q
�,�v� z,$��5Xg�w�$qT�݀�]�>����� l�AjD:Ϣ��^�p��L��RGR�2��*�� ��ȼC����ZD�
�Ar �k�F��HM?*~z�A�U:�&k���|[J�*e/�i��a1�
b
��x�)L�w6šz��)rN�8�=^�S�T>Y��b���p��8��6�;����
]�+��1��>^Pl�1Zl�ުG�]�HÑ(�����mRJ#���U��
9�ʼnJ�J§qj;�)�Y�O�[�rH�5n�1
��5;�����F���9�8��������l������	����f���v�z����w\���Ĩ�.u�L�z�p/яƲ�jn���48���$��������6Q��
+�"�~u�KF�{���g��F�C���ͩ��@�ő�6�̈́���
�����g)I�{�}I�,b���RX�M����jS�|E�d�̙hu?���mji��FW�	��/+��U�P����ւ~� �h_zy�:[{L��M�`˽�^c9D���*�Pd�镎6eW��F�IR�׻�rn+���{�z!��h�5������(�2*y2~�H��H��NYs�3]8��^k���oh��n���ń�o���/ _J���_�ډ!:[�o�0w�ذ)���
��
�zq�M�T���$s���$��獮�M

�u
r������7d���_�71/��v�
��[�n���ı�5�cH5vћu�x��Y�jd�ccQ�C�,‚
�h�I,�R�/�HB��JH�aI���
c����Պ�{�)i �-#��<�֎��������{�Jvh��lR���gL`!b�:�>
��q�r�"�Oߴ�T����������u�ھ����+�/�
ݷ��~�n/Rl�@%�Ei�dJS�1 [...]
�Y+j_�:\������-����3|���
E;���]XM��X��;A>��H�l9;!V�}w�ʓ��=&�z�5�f�	᭫��9���i�
z��/���h����{�ӛ�3���7�����]f��aP���G��0g��ؿ�oٜ���T��s�cd��#njae�J\�
e��5���^���
��_iv�T���;<�����J|�'��rDzJL�� ��يN�C/���ݦk
u#��;�t�L�`�,خܕʚ�[�a�H�J��
��̫}�i�CQL/�8Ԋ R��a�� 0&�u~�Պ��N��F
�
	[bu�f#ퟋ%:E�

�����8?���A�p��m�F�~����V�,�0�,(�E��'2C�>3�]i	��U��'���b�B,��G܇4�X�p@�}S���&�1�$|z����ú���Gi�-'�E1k�
�v�n�٣?͞2c�2�D�2�b�ֽK���,sW��fj^��<�b�R��Q^���/��KL._�
+�oM����i
j���ŻZd�ťw�y
Ecr?׷w�<�g	q8��%T��ج�&yQr���
k�h��~�Z+�
�de$��掆39O�+(�>(�5Ƈj�V�1��&�!�M�b3H��
�UM�c��M��mS���bfPZ�oBɍ�-�5�~�("���_�I.�4Z�\N�\|�j�
+�*È�h�u�+գ�t�o�h4�UE@�l��лҚ
�mU`�b��r��Fދ6�MG��C�	�^M��xQ�o�žSƃ~�:��p\7�����|,��!��O!�፹(n~~"��+Y硳�ȴzD���K��¼��Y#����'��%�/EF���H>�T~��;)���f�L�ֻ+"E�4|Js'��k`l�.��������
��0g�=O̭�uQ�RKS�G�WᰋW�y��:]��iF���ۡ����,
����˂
�j�Q
���k#�
2�_�
��
�(�֤
k^m�i�>=gV���,DAq	7��4H5��F��e��h�56�
+;*�J�
+M,=�g�!M�h�O�]%nO2��Fط�TPő��y�G
+��U&5n���y�3�?Ԕ\�3v�����~�8}�p���6��$�-7qX�8	n*��;31����[/���A����o�[+O��7��dn�4�?
�z��GZ �W-cq�l�L����fȲˈ�G��
�C��<��>�a�}�[^�)�� .��
U�Ȉm�1â�+-}�	5K	��s�[ؕ�)18&���
��m��n�������(��C���<��AB�q��qj/�����98��+D�@�4%�)I�'ɻ�U���4_�:s��%��LZ���
���
���D�/M��]ߦTW'ʄ(���Ӆ4z����js��
���	�t਱큠%M���P��:=Ԭ�o锭��l�R�\����Q���,�}j��4ּ	%C���pqJWh�x
�B�J��o�!8Pz�����
݊"
K��
UV���G���
��1R�L��F��vZ#L�閇>�L at In!�+N����#��,�|�(��X�^�U�j3���1��j���%
�)dl^���.c�96
���.�0P�pu��~"�h`�
#p�������l��]�|`�<P���5�LP�t����q:�L�k��_�dh�x!s&.
H/����J�_�Uaۿ�8�J�
+�	�j�~��=]�
+����7��
�)
+Sg�vn��<��
�[<�h�X��/���/���1�r�7�a�T2�kM���5Dd��0�~���V\Jm���U�{�%6��P�
2�׍/�
+���t�_�!���%�
?2��3^�֚h�p��y'�|��g^Z}���BR�'J��jd�a���zG}�F�Y�����-�3R$>�
+_
+h�L����3�!29Z�awt�5�ۮ<�dN���uѷ�����АH�j���-��FfN��b������O�bǓe,�
��+��Mm�
�[o;���02�+��a����$��{�F[~<��գ
�
��o��;��*AR�T���}ȱE�p�&KغZ./��wdL���S�`�!q�S�OUm�2X��PÜ��F��� �#��γhv ��>g�����<ۓ�2v�b��z�
ѳ��✗aD�ޗ,���}N
+endstream
+endobj
+3430 0 obj <<
+/Type /FontDescriptor
+/FontName /XJRPHX+NimbusSanL-Regu
+/Flags 4
+/FontBBox [-174 -285 1001 953]
+/Ascent 712
+/CapHeight 712
+/Descent -213
+/ItalicAngle 0
+/StemV 85
+/XHeight 523
+/CharSet (/A/B/E/H/I/J/L/M/P/R/T/U/Z/a/b/c/comma/d/e/eight/f/four/g/h/i/l/m/n/o/one/p/parenleft/parenright/period/quoteright/r/s/t/three/two/u/v/y/zero)
+/FontFile 3429 0 R
+>> endobj
+3431 0 obj <<
+/Length1 1626
+/Length2 16210
+/Length3 0
+/Length 17064     
+/Filter /FlateDecode
+>>
+stream
+xڬ�UT]��&�;w�������,<�Cpwwwwwww� !��ɷww�=��s�翘c��꩷�I�T�M팁v�N��
L< ���������
�
�<���gG 'u 9��lŌ��< M�)@
h`a0sss#�D���
@�N *uMjZZ�����0v������ s[ ������
���o���@U �d���� QE���
+� *Iu�$��`d
Pr6�� �@&@[G 5���`�o`bgk
+��5G����
F G{�	�o��h���`t�9:���
�F�Ng�d ٚX;������_��
��z����M�d���h� �w���$&�o�NFN��v�5���z�ڙ8��ҿl���:�l
N at 7�j� G{k#����&�w �
��#�����
��F��@Gǿi���g:��'��������_�v���_@N�@k3f��5M���6�"0��+Ҷfv f��M�������Q��3�A���Z�L�f�
+vNK���Xf��#�������[���G�r�=�����?SK8[[+��]����#cd
�{g r�����+��d����ޚ����6�O����ߑۚ�������J���
h�r2� �Y��׿�궦@k�-�/��)�����?lj +�`��	hk����R�/�꒒
+Z"�����/G��K��n���hE���	���sx�3sp�Y٘������9���%�����dy#'�@�o�L����|�%��Gq[;��F�������/�?fg�����������y �
h���lg�h����T��3<)����
9
d_ҠV��Wm����]a�V��8��������P��h�ۚ�'x�G�MFݗ��E��I{�Ϩ_��v��y�(�����q�7���_�C4��� w�H�G�����
��$�>��
����E��������P�5t�!mv
<9��O�o�D'wC����N{0�1g{m�5Q�8Ӧ�ty��-�
��*-�����[�$
�H��b1e皓�:�P-��KD`
��$e�/걽�QMNP!c�
f9��k�eX+k[���{1�N�艡Je��b�<�Yؓf
+���+�	�E ���N�yD��ϡ��{�^�
�b
�^�U�wM
%�ر�;E����#�˽�Au�=j<�
+��#t�O=�]�k̃3Z�@Z��C_={�n	3
Z_�L;�Nֺ3�����'�\	�c�x'\,���='���"
+�`�7�gz�'*�CV����6�`�p��'���m���n������Q���枧��~]d�Ò��qz�gS-�'�
o����t���"
R
w"(�1;�ݨ� G���C'�P����]c���3F�O���0�sB��iq�8Z�y!O���9��Vl���眞�{�`m o��ƒ��>oC���������{�����
�|X��,��
fH���=�k��'�;`z��wqM^��5;f���~��b�C����4Af=���)��6��w
��M�[,�����v�l&U^
�$�0�
����ܚ��8�X�n_�W��b�
���KY]�-	�ij

��	�����3�:fۗ�v�܋r��>�����§���ne��*�a}�y��\Nx�<������)4���7�����Ha��L�p��.9�C,�]��r��8E�)5^#T:�k�q��k���!37o�Ţ�hh��;�\�d;���o��+ڟ�L0����]����Y9ʪ4<}�?Ds�X]� 
�AΌ(1m������P����W�y	
Չ����<�ϯ�n��Ɲ��G��#����oA
t��@��p] �De}&ŧ��I\�7�f+'h�oߥ��f�'B;7�Ԏ$�a�6��,�|���ce5B�{���{��o���H�5#
�m�`E6x`F
-u�LΕ9�P������ru���V�{F�dІ�V1fY�E��6�ۿ��(�9�\)��~�0k.��Ӽ
X5�Ugl@�}�[��/�	4����6XL�^�A5�U~�]I�h�_p��]*,����3
B\k&����%�Wk��qe���3<�X�=x�̽�����"�=��ŋ
+m��"wf}/�^��>]�te�H�������L,��������,��ll���%�e��38\dzQZ+/���h�(I�;z!rX�[�dhy�<�
��Sָ.D
U�{	*Ѵ�β�y'"'�׺�2����;�x�wM�8
nUq|��uI>y�~u�JۘR��O~W,۲�]	I���0��K7�OU%���4y�K�^O
�d�)JXj���BLz�<��TIt��U��x� �ꘄ�j�,���
+A4���БWS�����s�l��xyRC��C(���uS��M����_���0&��U��A��G��x~r�
+x_��|/�������#J�>�N�l�r���:��
+ە
Ꞧ�b<@˨ف�;��2���N�64a�!���?>�����`ݩ=?��}��H�v=�II��V�s��`�Ƨ��![��᳍<�ٮ�S��v7�z�:;�znjr�`#K�t9��a��rˊ)���')���ip��'^=PÖCM����J���q��6U�XH��:r&x�_I������������(,@ϸ ���
��nkY���
J\I����W,�l
tҵol
+�zN;�F?
e\Z;N�^L�1uMTs:p?����l���h6KN�\��
��a;g�&���B��vst7<%,�Jl��P:(&i1Sb��3(�Rf��m�Ԗ�^��V>����g��:}�ɖ�^@P`/�M���5�
�N��q������WI
#h��i�,�\Y��m_#�:�w.���Ȥ�	
b�7h���J�3&>��5�����6��������
yЅ�ꡟE~����,=o� ���R�;��v��ƍ��
t� F��${�w��n�F�m`�k�h����6M8�X���?!�{zb�U�e�BB�@#
�����!��9[&W�\+�*�Y)!9H)m��M�&�WZvv���zx�G�!	�K5���r�@
��Q��
E�6r�?E㜲��
��-��?� Wv�����s���&аT�����J��V�[��ҝ)����s�-��o�Ď�ި���P�1)Y�b��$�̊/�I��D��$�v��Jߖ�uM��G������Dӡ�qٟ�5�B�,"8��V�-�D��
#��z%��
M��ҙc�w�]�3�e�m߃�+�	����P��V������:C���K
<-y;D��?/��L{�U2o
�&UM��Ĝh;�{ϧ�T����~5��4��V��˝�
x��5�T� )��|̈�l�S`ۓyJ	NUUڈF�ӢO�zFv��Ж��r��t�r��N�ν-޲+
�:Q�`갷f$�f�)Q�f
)=Դ/��|�+ՔH��Z��/C�<��Qʆ&;0r��Gs�h=6K9Uċ;/
�F��Ѹr���
���l!ph�.�=�k��k=�f �s�K���
���R�kK�
6zzj��1���#�h�}|�+��ݠ���qz��L���_Ĝ,]x�&��m2�5��SfL��Q"m�]R�>Zߚ��^�`�~�c���1��h.ω���2���A���}��� �`���X�=�+��%}���o
�Q�s�5wcP}N����L"_h�9r�oGyTU�>l�]:�
c��w )��l
:�8m���g�ȔNu�-��{�{]����݈^	<X�H�XcI��T���p�ZGv�+0���:���9*ѮU�
ݒ� CǓ@���N���
wT��Pµ1V-r�S�:���ݴ�x�b��ܽi�>e����9�*㺤bm$\r������~^E���D{TBn�.�b��K]r������
+����Y}�q�rÔ�ݔ�� �� �l�k�a�r�v�o�k�d'��<��l���<��
AX"V�,ƨm��S#��wh���6a�9,��������v����E \��-�4���`��0��&�F���CB��,����>�H:dP*
��R��t#��N���ILT�%�(�Q�5<��n�"egS;ب�[53���En�F쫬]D�IKrl��V�9�9��	�D��`��'C$�#�\�⮢�5�V�\��:�o�\d�.��ƦlWd2RW3%=�L:�—��O��<

qٞ-�#r&�b�URXf;�"6����e��JݔҸ��"�
v�\o�Ⱥ$����e�<~�������|�d����ƹ�)7U�)�z�RF�M��}?��I$xO�̎����6x�5����dYTݻ _�݀
+
�������BQ
g�~	�`c�u�MJ�]b�_�i{�Y��*W]
ǖi�qc���~>�ag�[��
N��"=kЅ_Yr+�%��޺W� {J�A��n|N̤�ύ˛�Ba�
���-�c�#���z~n��^��?���3����L
���ͩ�p8D
�uI�щwT�'��
zG22�4S���J�3�ʥ��#t�]S+�VR�F�k0?r�	�F 
&��1+��d
mG�$�,h;�g+:̿�b��vؾ�����,��
+��^o��F�us��U�D-">|0�X;@e�����ls�fn���i�'��+l�O]�� M
�&�����nw)��37�^x2r]5	��m0��:��.�u`F�����m�Z�[���-�4
��3	�_����	�/��53�񼶁�����xr��F�o�y��D�O�#���
B�@�G���� gs�cY�%&��؉�ʠ9r�S�
$���<)1:I�3M�Eq��G�;���̻J�C<F+~>\����G�A���
+��U�\&�@P�;i9�לDg%W���T��YU�C��+�BX�6�njW��_�O�\{�{���Jߦ�|�n	�x�����ۺ��i�
a`��(�u�~�5�PyU��n�
+eL���C�
UjE("�2���l��V��`g`�M�F�
+Dr�;fQw�
+O��†[�Z¤�~'�ӥy�ֵU���\�Y�l�ט
+E�TKKM4��̦���zi��#=8��U�J�t�2�x8��L�
\	�r_`�c�5I�R
<���քX6,>7�Rፌob�]��D�t��%e�R��9
��`�'����3�)>2��}�j�Mmx�w�B6Ȟ�	+f���&0�e$������qF��zX'�kC�Ë�Fn�g�I�$^�q�(���J�#�D+7;i
�<��Xt���d��a:g��[�j�&�wh��ùb�@��}���C/YEժݰ���!	��f�o�λP�W�աj@,͝?�'(�%vd7	����>�Ƃ�xC�iB2Wǟ���C�
��0;�7
��u�P\�6����y��T���
�կ�M����t����[-�y�����W�
W�Bio�����GNJB{�1QuI�z��
�$��]uw��N�ݧ���ݒtƳ�fB�
{8�.�~��
V�
�1kGI^�b��eM�������
�=�R�|�7.�b$"�RD
w�iߧ��k}S�-��hzn�	<G��B���˖�X|9Z����%���k:�i_����Pqd}Sw��\%�Bi���/&�n�u
S5�f�#���\����]��dx�C�4��GsE��Es�6;FЋ8a=<���Pw-�e7���
�����f�gQC���Y� ��3���+��y�m6�<��c�1þm�'tk]�*e��PM�L��]r0�b���=���W�[�0]�.�5

�_����1�-�G��1�p������t���
Uj������4�!
���m.>s�o?m���c��)��諣
&G�<�LH�=g%��Z
L_l���Gp�����yը���ن@�b� ��JC 9G�(�q�YA��P]�gh)���w�#�����M�D�h��oRV
�X�%���+������>�t�J�T�6�_���ix�d|�����i�


+�b��VV%3�=�y��͛b�YeM��Z2�f3��G��,H�4I��(��p��
+����~=��\qh(�R��e)�4x	�����E��2��Z<D�j
��'����t��~��] /���G��]3��&��N�ז�%QQϵDeDn���c<�
+�~�����=�~w�X�v\�*n��I
m�	��|V)�5�)���|��)4_ޣ&*�]��C��u.�ܳ)=�A6�j>1Ь-��v��
��-�D��g��y��m~)���_Q"{�J�0����C�\�ZC�li��v�歘V����
+0���
{J��p�ϡ�äy
)`u��$�3��5'�|L}_� 5�>N�7�l0��Lz��>V4��œj�:c:ՂK��lK#��AC~LX0~uZ���8M\���&�+���.t
E����E$I�Qe?6hK�>���DM��
�c��{HՉ)�RBO]�1�Y�z.�bp\]>��
&�t=�K���;�焋��۶J�M�����1̀"3����
�)��~��c�_�;���t��ɹ��GbU7�Tn�q�L5
�v%����j�⸟�4Qq���t9�=7�,�X) ��I�S���d0�
+����⹖��A5�k_j�g+a/�
�����@��1���c���Lr'�RoG޲V+��.1�}��ut�
;$�j��PNm�=}[wH8j-(�����#2�8`�'�*��Z
�$�O��1��xG�3�
5�"����x0�t�ϱ�koW5�i8
1�J����`P��`l�o8���V������h��9=y'
0���2�
���]b�xH�s�
�"����"A��Ã$VK���ѐ����x=�](��Ԥ�cSs�a�m�G�U�`i�'Z`g�
�9c���
$���F�~
��M�b�;B\��h<�Z
>yð�WA(��E����0�7�ﺊ�0Ycx���
���<��~�EhoN�A�XP7��7A�9�� K�
��6�ҵT)ق��m?=cg�L
Z�5�
��:���LL�Ǘ���Dv���
1{&\0��{�-$��ٱ���
��{�(�f�,4l��V�gQ�A��҆
#]�
�+�?jv��}2�r9C0;�J��5�l�&��n+�
�QV4_K#��������	*Q�
�0���~^�xe�A<T����d0�֣*F�o7�u�8�N�۪�U�Ѣ����W'�ΰ�H=��w?��1�[�dm�V0�U̸��v���8�/��{�WWQ���?�M���e�E�s*��
ѹ�8�ƤN��{���=`�9�͸�Du����;l��uI�`f)?P�߰	�Z�k�؛��b�*,�\ҙ�f6���&�`��a?�8D?v��Y��0y9�}�����g�+M#��@�DL�^�ݷ�b�V> ���{;}i0������fH
)uP
�D���J���H�
��^Z5���A[����V���������
+D/
���vbh��
��q�V sI��J�X{�
�4��LZ��W�%���Z���7�_ް=�������
Ѕ���!��Nx��p��ߎ��j3�pܘB�P�g6���9��uO����U=��O��r�΢3C�c.�z��D����Rti^<? �-^#�m[�,&�R!�@�m���
+���f������'#�B{�Z%�)HDb����NF
�#ԈPX	'W��Jl|Rd��֞� Fy���,��ژiѢ�P7$s��:b��' ٴH�����g��mN����ɲC�֌׮�I�%�;�mgэ�꿿�Yp
R�d��c�,�&��?́cd3
Xt�A�y)c���6�I�F
���f`��#�'Zx�
���L�vX�%q���'�k\JXo#"9*�Ŵ?'�YM_bsq���*>}҇8��s�_7��n(�F���
Ds��Ki\�ѻ+����

5�IU`���y�ԨJ��:��!E�
�t�ry�UU���\��ya��EF�
+
;���7Y[s�L٣�XG�zӍq��1Gs�u����Õz�!�9��C4!��<�&�l��^s>�
��������}���
+���2�D':GL�N��Tv
+�z�
��qC���/ ����5�4I�F��l.������4�L�<i��{GO�M�
S\�V/�H���/}V�&���w�zg���o	-���ÅkUpcĔ5ʼn�<��Q�������S~�
�R"�饯�I��;���Z����J�&g���0<h�:B ��L?k0��+��
:����q�ݳɍ�_8볶6�f�"�l�\`
������P��&[�TH�RK[���OOnvl�RE���-wl���~lugi(
��a�_��K�K<�[��d�e�;ך�
+ySd��&fE���)��p�u���N���7T4W\�]��1OR��0+�
0�F�
_z��IJ^��� iC�����f-��;!͵ɵ��$���oi��$9�C8/5�%�8��t�K���|
!9��L�3�e���i��
+uI��I�)#�VN��<�Q~�<�:��2D��#EK]���Fs���gt/Q���^�/��Ȧ��ϑ����fcn���/2Ν�
��P���s9qV�T�V2e%��YDFIb'�Y �G=; ����U;�pb�,�^ض��:�*G�zU�
�i+��
�P+�K<����V�|h�?��}'���,[�
*�qzh"�Rɉ<��Ƿ�
?u�B����ң�Ó�BI��D��Ru�Z�
/�E_t]&��6��{-7n�6�3�+�>�Cn8�ˆO����I�Wl�x�j4jC����կd'
=!7I�k����02Ϥ?>#����7(���ˈ�#��~�z�z=%��n�*�������둬i�p����;�\Z�W�]2�����7-��L��O�[�����P&�/f�#ʖ|�w4��x׉���1��&�N)>���H�M���|}!1H�J]��q̲��L!ߐ�78Ǹkno����D��QT�K
��1�ܴ��B���s
���_�J�3c�n;��Gm6lja�q��J̿��N�
+�j��n&�Z�N��.��|/��їU�"���)Q�( QbI�P%���2��m0�MQ]��^��_�@��8o�d�:"����]	!@��'�q,�ew�)	��W�Ѫ�
�9�"�~�"�4`U���趠a�A>2�
�X���8���S��۴��IUo�/
/��~!�?�L�������'ߜ�Ԍ�	�h{��)���ҽ��(�N�)���

/�j�"-��:lГ�J땭��I1�T�ob
+E����vs�d$�+V�b��������d�߁J��`��/iw9&���Ͼ�B��#Y �
K*\v�c�""��o��e�H��=����z$x;^���C׆3�>A�yMsi�e
+#��s�1'|����{���^B�+�.n�� ��/>2�)p>��u�W{�薅.�
���!b�z?
+�
s��Q㴄�n��&��; �Ѱδz�.4�
G�
�4�e���W��
+wS^�R2C�ըd�z�U�Ă�d4�4Re>K�8�����(!
�-�jVչT�=���à���?\��ϝ /Nڶ�-C%ؽ�/I�:��0
?:�"
+�;�,aZ�� :֝�l,�#�*`|�
u?��̘���J���n�����~�o�1��8
�����5*�`��q�j��;�*����h�3<��|����$�j���M�.zQ���pRw�̦�2�[:yVP��?C���H>����/Š.~hηH�Jk�)�T�{p5�W b���1m>�Bf���k2��Զ��}���1�
̀x�н��i�h�
�����Ŷ�`��Ár��*�5E��^�S��[�%�|i�k�^�	�/c�wg gj��ĕ�kL����JjPN�
+Ix/�i$�u:��i���^���:�fz��&y�l����jMPt����T*3�Rw8���uC�n�a�sP��*�0��>��;Z�HRp-���e�\�\>Ue�HL}��5�WH��Ƣ�����?���!�P�z��.�;���U��ǝ����
O�����J`b���R�맯8��J��}�n�� �#�
!��B�c���*`C��F>�fo.ʄ#=/(mv��;%|x��D>�ӝ0����b�ُ�U<���1�)^�7gB
.?����rM`˯�L@�i
���HL�Y.u�����W���X
�Jc]@�>��Υfx��z]E��w��򰮢wM�Ǡ��yA7��\�~�
sl�$���
.%���s|�@C�[M0�
�
��ur҇������=�ՠ8�V_Y�W<�<2Z.�ߐ����_˃��S����E���j� J�TVw��Š��1
9���l���&��Sw5uQ$�ֽ\bc��{P�����y��S���.#�5��zZ�q�zv�D
+�4��f�����`=��C����
���%��ޫ��3��Io�*�A���o*�x˜Ȫ����q�b�S�]ҕ
m�
�
~�Ri��|�<d�9�wI`A9D��m�/=N�}Q�0a
��\]V���/�{,vD


+{f�@r�_�hD���V1�M�w
B�v�'��z�f�L/K�.���G�U�C�[М~9��g7��߷V�ܤ�|I�6c�Z{�_Te�#s�Ze�܇}�{=�>J�c
�Q0*N�l�/
.��FU7q?8s�x��
��UϬ
+0sh���x�펟~����߁f����hs��o_�fw�7J2
L��lTg��G!�_��&Ō�3Y>�2
��
�
�
�
T�FxO^��|��Jg
|�t�<�T��næl)�#q�=�ͺ[ɝ�D�DoG8��rJ����7��j1����x+�3�j�i�/2�QŰ4q���rid�!��f�3ҡb��u� ��o.���K��:���c��9'�#=·&R���_M
+�k�P%��+�0�VӉ4�֍P�j����Y�x7� i ��x���
x�f*���
L�g��Z�
bTx>����0<m��z��Ou�aV��&r�R~��q�!��T^}Y���~�=�߆�^�nc��7�?��_�˷���Uo��0P�/5��r���^�҂���z4P�uJ�j�V����u�
q	��ń9(ڻ?�Q号ΰ��a�ײ����hC�,��N(a�OO�������� ���'R����F%�ș�K�cvv�T�����&M
�l����71;�������M����ʟ�J�
+�h��w�B��u��{Nk�<C���v��;�
+oZ�kU��7�5�"l�3e}&o�O3�Q�
-����_���8_(w��F��Oi��;T?������Z��!�x-�m4��/�FRҜ����F�iU��6�Ӎ��zt8�Q��w�J���T��:N�;A���\f��63G����D����B�kڬ������U�7ʾW~�k���k�71�:���W�2��	,N]�!��Ԧ~�
D�����>N�i���9�NJ
�f[���
�+�k�/B����������pU�|;�����	�����͌pL</�
��}vˊ��O��~}ˤ
GGD,/�2�UJ��[�idT��s��� ~��Ҕ���
�Π�S6��ߓn�� >J�0/�M���p3�'
+P��W;V�neq��qʃ�
+ͷӃt����8�4ONձ�@�A<�q�:g2�x¸�7ߜC���񯓘��1�+���#��(+��tQ�E�6��{���8_���nߔ���N������J6%-~�����R�2J7ɾz凿��n��>���e��.g at N;�C�Y֙V�“}=�Q��8�D��7a��m湸c>��!�|'qS@�z�3����@�Ӂ{�~�
���agk�O�
<��-��kL��+��
~O
��e�_
���� [C2�L��ra�
3����q0`ʥscWx�07%+�\�I�/�����k"�T�#%V{���	��L)絿�Ľf�#�j�c�c�e�n�Ѵ��ζ�f�e�
�־ʵ]:?��"�7�
�&����2v/K��
o��ӣ�}� ɻ�;��O+[/&�^=�l��&�U��,Q�@���Q_�HM0M2U/=Y� 9(��aO��@�}�����=�tn;��YS��K���ד
68,ߤ���NW��Nt�(�J�D7g�&�*E��N0e����o�)�Z�e������S��ո_ҷD����i�2O��
�P�4��COOb�YeeN���V�.~2��Ġ��tбR��1<
�U�.�['P�<���2�T#wG��R�
+�}n}���S�+�.׳ ����0ߖ�w���G�2�~؟���/�Ii��~�G�Co|%ޟ���S��
9�"��bUt�Q�³��Vׂ�"����6W���K����n�0�õՃʛ�KxoA�m�Z��f���;�ix����A�Ѵ���Ju��� �|م9UV�
+���~��,�=̅���+�3j��.�Y���i̦h�D&u�*ySf7M����n��5�oM	��)����uM��v|���� �d�k$&��?��6Ո`��7F�2R[s	H�^��Es��
+2P�=	��t͝<��
D��ݛG�
L�㿮���4|���q�(�U�/5��x�W������
�M�_�t|��jf�Mާs{�^����4��%{)�u����foEb����� {����7e�c����D�к�2
+
�ޫߨA<���A _~�zGڔr'N
뼄|�@ח5��:���c�OD.��� (0�/=���[+���%P1��[���R
����t�ibڅ����r.�q3
��Ȧ��d���{]����'i�l�ռVJ�I��r_�:��?d����ٞ0?�ij,[>�
`�>!�o�v%�ZB*�r8`R�ՙO�%CY�hۣh-u�	�
+����Bu���2F�<t at A
�N�Y˜J��d6��H�K�LC��N.��;xY
_:����*Wb��Ԙb?�d��
�,��ƶÆ��i;+|�w9����.�=��v���Fp�s�~o���
��?;`\B�.6)\;�V3�a� !����ʕ�����aul*JE��#��?bºC���h;�Ň6v�[��,=
+��w���Ո�| W/�ژuBM���8U{��Y�2/NT�5JNG�w�j��dx�"0��f"J��aE'.~��9u��ղ%R��6Y�j��'�b��K[�
��y�D��yq}�%B��r!?�5���W���
+��`��I����Q��Z���#�
_q�y�*d��d
+(����V�=y��i���9�t:�L��.4�_������~�GI��xm;c9L���}<u���~�qu�39-�d�@�
�E
)�2��=W�v���o���t�ܷ���l�
����U
U�
��(#<�()>/�3������
ۨ����Pm��`.��r��
7�	V;k��������B�f�攡%�q�0�]�����
d�Cǒ,
9��b�Ǎ�s�
Ab/�#
j��T.:����
�����l^�y
+���k/ٴ����iH�;����|��97Sʆ�0���?wv�8v?���q�DUr��"���Kr0	n�8
����8ma��#@.ݬ3�JZg�%�^�{H���樯�����ȧWuC*��ݢ~�.
:e����

����S��3��\Y�v���6�&�\��҈"�����Rר�4�0�ͲY��gE���}��ٴ������H�	1��::g�V�R�������=5"r3bS߉ �8�!5k�<��X��ӛ��� ���
~QY!���o��v>��%��_�`
���X���o'�/S�
�j�ޝ��&g��m}d�TǾ����vz�
)��zz��A��}-��U��s
��S�*K=�7O�2uڰ����r��ލ
�ś+�û�蕈 ,�>�����gq�t1嚡oL
?>�Z���X�_>,|>X�7t���ɨ
+ws��5���"��k��r�
+t[>�x%��1[���-��Z
+��c?UAE��q�58O�K�go�FX�X����U6�X5��� Bm��
d���N�k�^�K�r\�ѕ�N�4
+��ھ2�a�(̈}N� 2
�,8������1(
֓�A<�'̔��`��u\��.6�����9p%g�p�/���iT�_o�
��Ə�–tK��#�>�<���5�p��<�Yb�&&�ܯ�7��.9�
�0Z:h_?��]�SW(
+��ZV�kѮ�
۾cV
�`��\K}�~r
�W|�y�^����R�'b�`��uM�<P)~�Zdp*���z4[�1�K����a(���	:�!�;������&�Y����C�;��
+��m�;���͠L.��N��}K�XK��9�Z
���1�M��L؃�
+'7�7f$W� �y�jW0�/=sP�`��::ٙ��?X(�6Y~a��{8�]��W�
��
�#�����*�R��{�%��B65�����`����S��|�a��Q����
B���X6	d�P+�����-�"�D��3�x%�_��#���v��Ӈ�!J���;C��[㈵�
}>� 5�e�Z?(�$.`�0�
�̳mk<QO��	V����Ŵ��o~�qDY�A5��ZQ����
��A��2�����
���X�Ӆ3�B��M��&Qn�x��io�^%��l��{������a��m�b�
H���B\5b�5�A���$"�Q���˘���FkݨO����{g�J^���eP��^5�#�O�9l
�e��~�� E�M��	�C���YтWSR*�͖;����
ԓ��V�O����~ߩ�����Q��2����c�v�Y�
+��dd�!{��&Dـϻ���ͯ.h�d�U�	��rkH|D�i�`(�c��!�f�˅./��3m ���� V���-\��Wh��s�y��f��2��Z�y8`�L�o���r<�D�"ױ]�2]����hwf]�
�4	�3yʛ��D��_� �`�(������_����
P6�<�f�j-,�Գ��7GG���txX�ā��x�-NZRԵV�Y
+`��)�[O�=㾴�n��8�Su91E����(�#Ң��Y5Y�W�`�ڵE�YW�`L���_F��P[�Kf����������u��A���b&��{
=S�}s �j_��
��H�����
{q�fZ��X:��m��1��CҁJ}#]�+��P)+@������[��l�f!���ɗ�`�{*�z�w��
�jQ��!��R`��<9�i�V����I�2
�,TW����D��0\z]=Z+ɕ� .�j:
�|ήO_�DsnK��Zr���/U�T�
�F�,���&�.Te�v��◐%���f��B���J
��O�mX/�A�ī;-锨&�m_�B�I\�
��]a1h_֞�p6�����|T5^����+O1
���D6�BьA�&����r�����#�Wl�}�{$��ǘ:�����VE�,PLH,�X8��2���
+V�j1]�
+�
L��5��
��N�״V
a%�[@E��N���U�՜`��$�
2sлs%�M�PmFn���m�q�
���qg�Q}O�,#��I*!�{�W0��B܋���� O�v��~�F�.�
+0��i4�3Y���
+,�x\	"�ʹ�o���Y�k�����IXU+�w]�Vj\��К��X���9�W}���H<��3

#�Y��N&k:S
+aK)զ2%�]��Ch�T����뮇��?m���3�n��,g3���
+���Ť)Њ�\�?F���z�PhQ����2��*�Y͓���&�8F
o��D3�#ثa���`�:���Ky
��
��X�\z�JQ�n���rS
+��*{����E��p�~���}����9��Yo������� ���ؑ��s�&`us"���$m6�2�ZEJ�Zk�&hm�!�P�T
 ̐R�:�Y4��خf�)��"��U��j4�����c�5�ʢl�	�t��Y�hQ�2vht�f�
t�ڎ��/�$=X��
+B��=���n�Ti�q��{��dO6,
u��
�*��-ĕ"�HBI/�: �'�������F\�[mZ�H��r+n��C�vmcT�]�@7	���c�!1���A8t����f��6��ʷ%��;��Qv.��O`NB���3�'ږE.����C��R88�-�]g)3���\��9R��N"�
g�+�A^�� L��Z����\��3B(�k�p�߿he��L

�� W�:`?s۱�
|���e8/�q�:�h�Hc���Q�F�+�d�g��|�����d��~U[�U(3���a
��"�����wO�npHV�G.��ٽĩR���ձޠ�m��v���k��w������Ɖz&���=�B�,l�ʴw#��
+�=��}��.���b�"!��Q���@Ǵ��!�0���@��X��b�-*i6|�� ��v_r#����U����S�-�x�H�<��L������Rd,<	��§@:�j}we��Z=k��Г<�ulQ�R��DG��u��yF�ܦw���
4A
+�1����LB�����aU�����r���┭OK�;�U.A]�13����\WlU6�՝b��#���s�L �5l�K�Qbq��95[c�i��{~9e|ځ\�ߣE�x{!,v�1w��/�|��J�zV
��
:�x�V�ɦỜd�6�,���?J�~�(N%�ǫ��Aܪ@��~_����W�K(%M����~�
6�L���t��z�m��v��vy2	h6q
+���V��xp�
��P�ZG�W��
+P��T:�
���G�l&��3B��[j]�t/tw�A+��Aw
������	٠
ƒ�s�/qӲJ���޳+�IC+D��%�ͺ~�^���l�CC�[��ި��E~�8�;��n
+�P�e�y�օ�=溥���aω�m=Ͳ��t�I��gY�Wi&f.bo��F���I�Q瓼~��*��bwA��3�〆︑���bF�C�^1/��݌���Id�K訪��|�
c\P3D�fÞ��H[��1?`�M��R1�܂0���t��p,ۜ��O#q�Ԕ�V��dҎ�Y�9C[�el4LC&)qO��ю�wR�g�E]���ɸ��?��qef�����t/���`���,�N��oXH�d3}�rE�.�?������/󏞞�3(	L��FO
�,gW
�\�

H��reI��
+endstream
+endobj
+3432 0 obj <<
+/Type /FontDescriptor
+/FontName /UGGNXB+NimbusRomNo9L-Medi
+/Flags 4
+/FontBBox [-168 -341 1000 960]
+/Ascent 690
+/CapHeight 690
+/Descent -209
+/ItalicAngle 0
+/StemV 140
+/XHeight 461
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/a/b/c/comma/d/e/eight/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/quoteright/r/s/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3431 0 R
+>> endobj
+3433 0 obj <<
+/Length1 1642
+/Length2 4182
+/Length3 0
+/Length 4987      
+/Filter /FlateDecode
+>>
+stream
+xڭTy<U��V!sJ�y�3τp�S�:#��
�9��X�B�Ȑ2�	Gd&�1c���sƗ�=����~���Ͻ�{�w=k=k�����6�ׂa p=
/.-!�
� �!^8
��	F	$n
�!
�`@��h��u�p0
�A_��ʀ-
\�C@ZII����x�Hg< dma+,**������DH�8�3 }܂�0
�p4�D�_Z�� � �(8�cjfg`��X�p4
Kj��
�BB
+G��� �P� ��!�[�I���p �y��HR�
+�8�� 8�
�Ñ�$pƂ�x�
�1 
Ey��
 ���y`1$wF"3���8(�HYͮ�������!I0�A�<a��qK?1
	�h
��{�sA� 
��@�	��$2,�g^8$���
+� ,�����8
���}|;�	�K�`�g4��?k@�qpB�FZ���'�vF�i$��� �� �R��0/�?�[p��
:�aR`�" 08�F��'���;�%�>������y�7q��_~�����Z�
�2���מH��H� ����
8�7H����#Q�����-�W���w��ڙ�������/3����̐x�
� �H��n����($N��ݒ���~ì\�P7�r� 8�{$�~�/ihҳ������i"�V8��l�1�
����1ހ��
�qY�ˀ��<�$���d��#�����"���RRR� �������7]4;
!K<
#M�?
�0�
�%��s����s��po8�fp U	vMHJ��Oin�r��N�Ts�Gv�Ufz`!�6 ���R���C$J;�+��
ӆ"3�XQ��q��4v?^��t�Q�Jљ{�N��K�}��@����R63���N/PrtV�b��v�yo�2��x0�C㋣Y�Ζ�1e,.	���������T���~��hr45�
+����E�X<�&v�zH�K���HӶ��n���j6�i�'_ۥ�)-��Я�8q�b������~k>�㦌X�fO���GF�[!�
ucwJA��m��:]°����ꊭ��O��}j~3�젘���?O��s�T�ݷ~��4S�z�ލm��D�
T�]�#ڍav����R�7�U�5)z˄�Ƚw�R��e�L�S�gi	U�56�uM�c6;�ٷw�OG��=]j��<�
�D
+�^/\l�
	�N��������/������H
i~��
j�����·�x����wff4���TC��3�Lvq�P��t�%c�R� ���GQd/³�󮎟V+eLf�QC�����E��

.
�=���}�X�ף%���v�d�a���Tb+�-ڬ�ͱr?�hCw��[��z
+S�eb�~B�a��4�M2s+�W���5����Ze�	���9>I�gH<�
�H_��6=�p�?Q�,�IUw�|���'[���cY���s�S
��70Ω7巨�
Z���\�<@��A?F���..��<�.�K�7o~���u�>�O����
+q�u�]v�I��MW�=08�,t!ʖ<��Nx�О<��βdpt��a_w߼���Et���>-ݔ7C�6
h��|�QO���Mٳdc�޿�
���~	zR��d�H�X&+w����v�ɑ��C�R���9i��K�kB�8���D��#&�.�c*=�0"�9#5�ս�ȝ�.�B�
�r��y�,���K������w�b�1[�'
���cĭG��f0P��������V��h)�Y
+Z��`�ٚ����Z%�gb
�Y)�Y/�^����J�*k�
��b;J�Hp���Fkq�7�X�����DEױ���z��w��9�6����G�{���.e^Pu@
�>�/�@�??���ݩ#/NI�qK�������t������g��
�Q́^L6���jÃ
9�:z�P���j�$�UT?�X	slvJu��J�oE �jrz�tݵr��+�̓��})_]s"�f
��_�rRD��QSY
�~�V*]�r�dt�:�щW�myyr-�z���4� )�o�"�����(嗃�Gum�ɻ9��C��l|��7`���[;���.sn8����B�������.�v�+��em�gw�)�9{�~�������\�R�����
�J�|~5�$.�֍��FQ.I�V�!l�
�����j:5 P;5�(�
���U:��ߥ�mI���U�W�|�_:�0�A��1��7����wR�ۿ0hѶ�p�l8�5r�
���ߴ��}�f�UALt�:�4�^Ň}�,��[�Ě[2
]~b�*.��7��⧲�3���"Yɍ��Wx�

�b��9���wM���i�3�/��l)S��UD���1�) 
+�{$�^Z�
-��q��Bl�<��`٧��X�x������%���[�il�ĴE�XD��/���	ij��/9C��S�Ţ��[�y)yG���Kk����V�E�N��cA͎��4�
�9钚�:6H��I�õ{z�CÍdҜ���q��YTl�>w�H�I��s\H�T�=�Y.<�H�%�o�
����t��
ԑ��KѮ�e�3�2�Umx��0�(����4���.��c�;Y�"���SI�t��2�0bj�x6�U2	{��D�m�i%o���G�� ���MW���0.Ű�����_�ӌ�,VW���2��D����E�O"���W?�


��:�
������Z�h�wm򑤫��h�ΌW�/�]z^�(��QM�ٹ��@���� )�wX��ŕ���!��O.�*U�l
����}9s������%Ldz
��@l�Ͻ5D��B���ڣ.���Sk&f��ĸ������@N�>*8�-�����x�;�7emy
SG��QZ�XP��:SN
����'����p�0���[�-�N�!U��%
PO)�.���H��A���
�Z�!���t8Ȱd̓#l�v��V:
��L�I{��?d;�k�9��ܺ�&�%vf� �.;�����.Δ뎐�u�e���%
�2�3ߓjY��Q1�� ΰ��� ߥ0�&����f3�m)w\k�� ��j�g#�V�lZC�n�w_���0ϝ4��Ar%�v��
+j�j����ʫ���X^�	 ^�L�d
ְn���Y�hj�U���Q礨��
�|��
��^��C
u	�&n��E3I�v=�?�����rB�wO�mɆe܏
��<������q
~��
�P�e�
ڈ�
}S�*�%���}��b.�	�����]⤽�|�Z�g�^MKe4;G��>����C��
��I�~+5#l���&
B�R'���uv�.{T���V,���X�;q��B��TL�G�id��-�Z�ڇ��`l��+�l!c���c�suXH�X]�D$1]2��7�jya�Cv��J��Kˍ=���ю�QD
��]ZP��2����1�
�72G��y�F�	���Nr�r���_�2���s�J�
e�I�`ٙ�2qٟ��Y��f<.U���:q��!?����z�ۓ�ŎG��xj�{ٟ��lc�Ծ�)�r�'pZ`8Uc��S���,o������\��gy~/se��ΰK}�z����ץX�踽qP/+aVc7��_�K��������ށ���g�-��
���3��JA0�� 6n�`�
a�A
s���S�Q����t�ݻV�D�6��
9b�Bi�,�g����辔��4�rh�
V��Xh&C��X�����˘�q
+؋+Jɣ�Ia��La%
�L��|��
+1�9�fʝ��sz�0�R�[�
:�cK�0;�,NT�K����[;����
�L��u�f�
HRMZ���-s:�Yc$g��O��N��˔�'�����V�Fm�RU�,_�(�F�Nl7ͻ�\sc�N�R���Z;�Ѷ ��1���V��	�^|�YB���"
+
+�V�N����DY=-z���z�ڮ|�7��{�T#, LOO8�\C.3������e����Hfd��
+9�\s���뼦Ū�%�g�7߰\��^�ï�w[Kٸ.��!S�T�c$V�`b����^
�G
��P��'gK��,���m8$�%����pL�_�7�
���j=��9��r��������T�w�Uڦ�h���Q�A/���O6����{�Kz�XE�Orsy��J�WEv^]���$
^_���Ȋ���
}]�
K����'*	���u_Ò��䣵�����OjTXM�i	w�'��u�05�5fem�]��=
�a|�.��/��{�K����y�RI�}����F�B6L�
+;
*��2Ďx��x�/���ky%_��{���.�[��o��R��{ڬnV�(s7�z�@!���k~���FE���E��>9cx���͹�<������&j��
+a��W�
+8��*��ۉ�]��u+h��K��n
>o���V
@���ф�6�z����%Vۥ�V�t
o0?�����I��9UT~x#*���R���қr����ȗ<�N��D�+����j:Ɉ@�!��sR�Fm�
�N�ѿ_��T|�B3��m^��5���ϵ��L{
��݈�1�'��ޢUԩ�z]�]�}h*G7��ь�
v"ѳ��m����bv�.�Z��W�ދ�7
p��ϻ�5mi?&?iG�
ds6�\R�-&3�m�=2a#<�nm����N��~��~����*�uM�l �V
�_KS.�vYu��֚ʠ[!�g�Tʲ��Կ��|�U�8
+64��h#������Mv[��fB��M_0"�
���-n��n����n�M�x��{D���R
-Ì6)���.�zFG��0�L���y'G��'i|�]˯.���K>���J�lg�k�(�h=w��'�}��I�mY��W���kc1�CU:�4w����K��
~Pl�iG&46��V���Hؽ��O
�����BM�#Ɨ�=
@%��
�x�[�כ�qB^L��|��|r'��z�6
j{u�M3�;���|3ֱ�s*v��}[l��1�-j�����۴Gp_;}�>ļ�t0�W|$+��f�����O�
͸n˷�`E
+�e���|_k"��t�
+endstream
+endobj
+3434 0 obj <<
+/Type /FontDescriptor
+/FontName /JRLFVU+NimbusRomNo9L-MediItal
+/Flags 4
+/FontBBox [-200 -324 996 964]
+/Ascent 688
+/CapHeight 688
+/Descent -209
+/ItalicAngle -15
+/StemV 120
+/XHeight 462
+/CharSet (/a/n/y)
+/FontFile 3433 0 R
+>> endobj
+3435 0 obj <<
+/Length1 1630
+/Length2 19675
+/Length3 0
+/Length 20521     
+/Filter /FlateDecode
+>>
+stream
+xڬ�c�`ݲ%��m۶m�Ҷ�Yi۶mە�m��W�9}�����O�����+03V�EJ��L+hlgh"fg�L�H��E gac��dg#g�)C�db�B�W�
+EJ*�hb�lag+b�l�E�nbL bbD��D����	EJ lg��haf�L@���NIMM�L
=�C�����̖����������_��kGegsS
kayMI9q
+q9Uq[GkCk
#
#['JS;G���l�-�)͉�/���������_7w#�T4�&�6NN�	,��

l����َ����������M�������_
����`
+vN�NF����*���;Ogs�b;Y�Uؙ��4�3r��������:X�:8��;��Є��������o�`���J������?3�!p413p4�6qr�
�����g��K����
������������ڔ���oL#翱�,l����I[S;F�ˍ]��C�j���Q�33��00���� 061����s������e��>��(�o!�����7r�+G��%����Z���Z���� �{��]2��
�
�?�������c`ca�������&�N�� &�l�-��f�a�c����I����X���Ȝ����o��%W�56q���5����J@����_t*�FV�����o������/]�ʟ^UPFSA���`�e��w�U<����?���3���`����	�h�8h�8�޿�	q2���߄���e
�
-�	~�����_����?O:�F�������Qv6�5�;m�S������/��Z ����������jm�Έ;�2-3ݹ=wdR��@#�H�}i�JQ�_�]�oZ�.g��gm0]�4�w��ҹ�ס��h�5yo��u>�ob���-�Nv� z�R��
�(��E�
-6���IE%ݒO0��NfG��J?b�?�g{8�ԆX�.�& ����
��ӗg�?#ýw�����9�����>��I�
����Fߠ��NUKY��5���n���.�$O1�Ȍ�W�xf?��
ˆ��nס!�1LE	|4���3*R��]˒�l�
|\iV���1��M���i�E��߈jC��Z!��j

銚j��3�,�X���|p�u~cI{�Ѻ�ο� x{ �U��/hGx-�i���"

x4-C�.���ߕ�Yb��y��R��Є*�,��G�@��Ӛc�kݤ�H��1C%�l��$sI��u[{u�����.��Ϝ
4I��Ax4�hJ�\�IC������$k]|�-�75���<�ޭ���J��`�O���$x�aA�'s�W�O�
q���[��C�|ң7c�>��рl ��Ԋ��e��!jk���+�9�	.���
�T鶙�nIFj ��ꚹ��[�J|Ѝ������
��9W�mߘn�9�
+���g^dh5jT�����2�׭�,�]���b��,��8ag"C�
�-�M�[-nL\�1�+�P,�-R�j�`�R��^句���
h���T��,�@����� � xU��ZM�
�lh������( d�'���V{�� O�W�&rx�b��g�n�Ʋ%�q�a��oI
�w�Xd���؟/j�W
�
8&��s&����v$r
z�_����(�N)
��ї�+��A�VAk;��iwf�H���
��jvv�-9�%��\']t>u��x��җ��e�T����FX����	4�m�
�MdP����A�Q� \��Y*WB
�K_�T��RO��9MYe�S��ێu�2��I������v��K�=��M�"�w
+��ω�qc��w�L0�X�%�,&�j$�l
+5�ub�Ϛ;�
�A��HQ!�#N.z��S��l�����i�3��\�2ГWOG����w^[V�"��r�W��R6*u�����>���m9�Io�ٖ�oo
������ޥQ��n��4
Q���i�Vq����2��;��
�������)��1��2�pp
ase��;f`�s�LX��J��p�B�7AȠ�B�\��
��w�\��U�
+(��=H��p{P}R� ��n���ͻ������^�{S\lN���ï��V��i֑�O(�q 0a�~p��-�S; "��o��Em�[��(qhؐ��q��^�@����l3k����8��J����>5�L��t����;cG�7��-m�w�ąn\��s�Vn�(��k��
÷���8o�2O�(�F����^#
�S�^F���uZ��T�&TX
0����\���%)�<|F�C�c�����
+�ZK<ѫPS���j�d�D.���5؅#*��b`&x��aY��۹� �Y�+$��J�����v���oR��@>�݈aI4;�!w,_����>>�>
K��P������G��,
�>��S܅\V���1���&)����]Q����(�]"fa���/�S�1{��nd|��$V��y�ۉ�$W|��*a	]�~�r�!
��ߋ\
��Ţ
���r��'︣/	���fi�͈��'�-U�TϷ�E�F
�!��>
qP�P�
����ch
�h�`�I����QXPw'(�ն���<�O�ü���T��gw��9�ZT�f��,�$��%~`�ȯ�5*N4В��i���/�"w��A���L@�R��1����?�*�"�i�'bw��Lx:��Q���^��
�y˥��vXdEA��;�O܂G� t�Jd8@���vT�?���_�
{A����o��n��(�Mު�ճ�i�sf������Z�!�I���

\
5~^�����N�����li�[��b��{쀾���`�������=$�Z&D��t��o�EjiEW�e��ĜɆ!Z!:#���ͩ
���]�˶p�e�)��m��K
>]���� ��*�
�QX^n���
�M���X5f$r ����{}�l
+��͋��Xmk��kf݄�ifo�g<˄��L� %�5��ٸ�l��o�h-q䫳]��Dy!g�iG#��н�ۻ6�Ҳ�Q�.�C�
'xC��Qk^1wL�K�h �A�ܠ��”5:��.6
+���{=����4,�7f��͒�8c��}2=���v(BS!�u']�4��Hȿ�?Qo��,J
Ÿ�P�r�G�iI9dc�rq=���	9����GC7n#�����S=<�� ���<W2g�}��@�
J4�d0�
���� 8�.7l��Z�U�2�:*�Jm���߄��F:�g��gZd�QӜ<&�r���
vt~�B�
i�5R���,�Jߴ&

��%/�>fڒ���7[�jb����
��L�7����>�[T,�h7�L�L�E&��#(�j���8/��
��Bs�1ʠ�]+�͉}�Պ�
�YļdQ�i��8(Zc+�D�XB�$��t�C	��w$)��_?��#�ֺ
�!��a�0e����΄�qb��b�4kT��5\F{{���A���u�/�o��1�
�ֳf�L;15I�t{�Y֙	
+��s��ݦ��Y͘��
���]�
�X�߳���_=�V聥���N��w�
���GҰ�����9%1�a�9�ڀ	N��rW
�غ�ODlb7������r�n�7r~ ��� Z�6�|xOK�L�<,E��b��Ut�OBOIϢ��?�y
י��p
�����Đ��Y�dy ��߯\��@�@�b���!q4�=Z��WG��=�4�N2dG�H
L���q�E�B~�
Ӡ�M6�����<:]����UŦC�.K8BFǼH����Ċ;�{7?�u������4�3�(\����
L�༭9�
?���s�<�L
�����"q�da�J�I!h�Q���w@��!���'��s1:
[0�|�B�)
�ɮ��������ʎ5��"���Zk"�%z�����؎T��$��h5a�j�O�	��
V��3�%S�u	;�`��'=ss|���h}f���VP��v�2���Ξ

�O峁%�2QɎF����3�,^E�
*&=
�C>� �Q�xҖ/j��v6��޾.;�x��
���s#�0%𫺪#{�
!ۅ�ˏ8 =W�?�XD�ǁQ�9ɮ�7��@C��� `t�;с.��n�>#my� Ed������
s�&�7`�&�;����K =��$�]�9.~�aj=D�et5q�	r���0R��`r8Y�=A���QTOv7,P��XP,��_:��I��y�E�7��繩���a�'����Y2Q^
C0��}��C�a����2�IFDQ�{b��<9�4�_���P/��2�Dr?�v
�wij=�{E+dd[�;���!I�>��e�,6�j�:��B2C�� �?0M٠u�	
��3�ezW5xS���81a�i��`Y��b�;�fܪh���mD���}_�lA/%v�oȴ'ј�-[�YB�[ȗ�̋cq�P�2Q����M�4�B�y�Aq)��&��<�G�.P�
�u���U~	�^&�x
b�8@����\;:J�U�BO#@{V�[�6��0(�
V�!���Di�%��8�fgxZ�+Z� �C�a�D�Xc�*S0I��N7��SEU+
җ�rno
r��(���k�l�
Iu
�iD(b��z������٦ȩ,����-y
�N�yl%��i
�`l�	 �
’��?��m����-�X��7+[r��ȼ�"���A��
+���M��  �
��Tq3J.�J�Q<�y5$%p9��Mλ]�>3P�@��J��� ���Cn%B�C-rېx�R!�\����߇m&
���2=f~7+�x��2�]{����?�\U1����\a�A�2;�$�q
E��/D>��%+���a73�I�f��t,q��P�ʠ[�~��6i�g+��I��;���3
_�"�~�Ha�i��|r��3����oG��x�έI��3
�+J�U �*"]���k�6�y���5�����Գ?�0l6�pn�U&
�R��Ԑ�8��H�0���'#Bu���ta��J�"PJ>�ݗ~ŋ���F�'$���Aĵq!���#�*6cP��A<�
�A�%�7%y�.��
+�E��Oz���E_�v�,âu}c�`B��.��Y������fgf5�]H	�U�g��G:EӺ��g�ܠ���B��3?;W-*�J�ń��

�P�1
�>	���j�g,/n��@�qӆ��� �.*>�4��6� N����L����{ly"ۚ_i��]�ew��j<�� *I�
+�me�9v
|��u��~i��N�r+�b}�,#��q��	��
�Y���J@������'."O��E���q�����syp
+�c�W�\o�h�F��sߐc¨�7�,o��$Q�?�5؁QRٻ��x]�����sG���ʓ�'O����Xw^�8-
��8�v]�2V�]�z�wG�ZA�8DO��t3��zW�T?���A)�0۟h��:��
S�O<o�'~L08+᝺���5�/E�k��5
tkS����º���&%���g�
��x���>��W��ا�nc����^BD�J��G`h��B�T�xǀ��\к|�7H�s����
�"���O��f��W�������ntk~MfxEk1q��me�𩅫�ad�������U�'nh߸\�@�=d	��}j }���
��`����f��0���\��R�x{Ry}>�ƶz%s��5�)<��žЎ��6]��:J‚�������j�Ҥ
��e���彂-��*x�.P��ߩ�3�x5�$����}30v�T"�
5:�ѱ琭gE϶��y{�2L-�(�<$�`eQ��,Ю�F&Fn��8.N����ϵ
V�*�9�3�{{�Y7�����v��)p˻LF�d)�Il<&��ݖ���j�D�#�O��}���:ݦ0�
���B��g�>��r�~��,���N�z)���YZ31�
����6�L6�����L�pf�z���y�N0�nz/Y_�xQ�ğ�q�FH1��(#�}��+�~���K���� \A�]y�R-��� [...]
+���H�
�c
⺥2�d��$xJ$!
y�?vk�����
���h� 3I��
�a�C�R�h0ק޿>d7y嘄֪С�`�)���S�XX�N�U������Vig�X�Ros�@�OE^iElBH��*k�>"r	B�8:Z���&�21�8w�	�H
�߽�!,׵:
�̳�
+��L�/$��� �_
+���5�NY� �l��q۽��C�+�dp˴+Y�,4��oc�k�����ɉ�EѶ���y���^�E��~��]��
_'a�]D
�!6�0�OuG
�p��5��������.
�c�K��KM��X]%���}���Qp���Ъ���YP��x�NkN�����6�|�[ֲ�e�t���l�-"f�7'��b�!׾��(�)(�ɼ�z�ܹ�r�Z��c��Q��e;C�ܲxyy���_t���ap5�:�y�_ ��Yg�̈�m���{�S��f����O��5M�����x���;kSe��H�b��|!��m8a�[�&�ћ!�`�w���O���ż;w�x�� �F�8s��r�����Cj���`��6��g��R�c�U����1��[f�/�&CE`]h�^�T�Q^��%��c9?�1�lF���>��D�l�z�C�� �%?� 
��ڗ}�iPV
�*�Cʦ�^l���0����}_XE���'(i�sB��D���N�4-U����|�l� *Cy���#�mc��)�X
�s[�
�yi��YӁ�e�W���fv5
�l��s�]Rc~�YL�T͍)�+���k���8j94���$���E��Z*<�1_ [...]
s�
+�=�f����PW�=0	I�Z�es�с���7a�C�)L��%�	�4)oy�3�^\K�j{���+?v�Ƣ��Ǐ���@9N�
���K8��>@�q�%>U��(��~'L!�7MJr
���QKSA
n3�
�aXnA�&7@�*�
J���Aa���U��&�{pJ� �-���
+CgX����&�O���ch5D����e"������22�w*ߝPrp�['��mU�8;{W�O�f��
T"K�TC_~�
���l#Vz%�bx��hF��	rKK�2t�H��q����i*�ߺ��l�
����V�;ۥ�Z,���P�,�
�x�BS0fb1�8�~�,y��mW{KR���x4i�?Pܺꛟ�+��9��"a:�}�&(Cբ������
+�(���ƞX5�R�4�~�K
���������r�y�(6�ht
+Xwo
����D8�m�4\а%�R��#��\�J��-d�OaPM
.��@ U��uDW!
M� ��,MI~<���xv�|��
����v���m�ˬ	aA���'��i�	60�d
K�!G��6�0_ɑ��+h���ؽ��d����H���Zh��f*�X���xs5�T��
���GƂ������(|�A�׾yj�i��lu�e��Tŕ��g6��+Gw[���h�[�^��I�{b�� &
��sH����I�򁸩\i$u
���;� Zh�<	���R���U2�@���sPm��p
��=��a��j
l�����L��,���
+Ik
A)�L��0<�B4��C���?���{ܸ3z`ͽڝVt���[��F���u~
+���̄3s
��
��p
��׫pd�`���%W����܀�=��a>��TX���p����@���rpBqth�8�#����x�3�
H
3;)HyM�nNܗ�!�0
C��]k��ɨ0�&l�0j	[(�տ(�2��N�=9N� \�1�y~�9�� �5�TY`���[؀�n�	L�R%��v��=b����{P���!�A7������l�
+e}�e��ZL�(
b�~'� ;�3
�7( y�4�*K
<����D[
�5?P=��
�tpN.��y��T�׆Χ����
f�m]�?BԨ�D�Xy!��o/߂�����M���{�J
���(�����Y�}C%�GL��ُ|����m���~G���pe���9L-}��mv7
�goH�^���
+�i�<��0��cA'��$�G�NA~�*%oP�?�mLnW
���J�^�Q�ˌ�
&GX
���r���&��i?
��!F�K���g��_96�e�_A�hYbO?��NM3O�{Uh��N���l)�=7���8�g�.,غ�2�/�Q� �z��l�iX�E&]4#+YT�*��&�fH��C��%fC	��@͢��\B� �G
�#���M/�
��m�_A2�8b��3%	�h��g�'�t�%�T�1
!.�^�T����C��'K���x� ���l���kZ�UQ;~����O�}
�҄�I[���[3����lK�
�-(�k;�/�G�N
�	����qH}
��\�ñ5IYB at Fַ�!e�N
�J�*���>����FcX��n�۟Ԩ�8�
>w9�h^���jl��b�'2;&
˨�g�x��uJ)Oܹ��"?�	��D�w���XOvuo�u �f��5�e��T��G�T!}
}O5�1 _b~�n.DB}��!LM3���C��(��/�zk�ވ��}{��!�N�".�W'�6
�+;�ε��݅�c�̾(��ޗ=J���*�6������Af�6 ]pC}?鐦�Gld��:;��γ�J<�m&@㷨��V���!sZ�Hoe��`��<9>
q**��g˨uF at ckEa2DT��1�����
+��*��JN���T���߆�n�8?
�ߞF�ZVA��ھ�:��0�iپ��}􆣄��s �{��֍�MC0�\6�
�qH��F�re\�-Ƒ*eѠ�=��Y��|�X�"�������΢
�z�lE�^�8n�D�4n���o0�%	D����-�`�77��u'9j�ZZFi�BA�@�!~�n995��7��6?Iw�c�/��zy)rUR�V'�_m��`v�g]��Q�eK�j�{U���b�/	M��gل�ooP�l>
����~��@��I͓��Y���7¯�N�+
+�w��Dy@�]&o�e�_
+0�]u᭰J��D/_����I8�x��#0�H1J��
�⢱�H8}$�R�,p����gw�ty��z��3�4� ����;5u����S�ᅀz]�'�^��-�]םo�)��EA�b�,?��t�$����F'����
�iHVqqt
�JjשY��GiQs)x�z؃�5'G�On��ۄ�=��mЗn����,{�T�y�b�<�q>�k�[>/�� m^��"��>�x��D��<"4|2�
+/�l���^�T���ڼ'�jI ^B���AM
S���[�v��1
 �!�_.���
��f勤�O'M�B�xj�ѐ�˜,y&:���^*��m
����|�'岟M&n����a3׈jS.8w�Oz��\Ti��փ�n��
+{by0��	@�֑Ÿk%~����=���rrQ~
����V@��2�q�1�
7:���t=$N��^��s����r:I+�B5>|
+��҄r	�s�8QMf�q߇��.��
��
��*r��ƯR\���
�����į��l��;�M�q�C���� ���g@�����
�������0�44��a�{6$$}L��&���{z��&��Ԙ��{0K\��
}c��컎V��W��JBT�
IcO‹v$�7
���F)5���ȓ6�~,s��Jgƛ|R�J�b�S3eI��
?̐�
��s09�	�to;_�C�e�
+0��� �	7LyP��u/�,�o-'�;J����ЧMD����щ�ǮWhPW�[���� ��J �`}�g1s3����&�J�?�bs3���H	��|����
p�#f����cJ�6.-m��8�78MP��*�o �M���J�_n��
+$U}ȓ����T at y�N���G��t�q-
g��P���6Ʒ�h'�z�
�n*�y�"|CԷeDN���Ƶ
&	�F����7��R�>�A�
���7���֩���V=���e��!U%�`�H�=�_�⍲]���ٽ��T�8�B*L~Z�<�
<�yS�چo�,�Nk@����.w��:[������f�h�l��f��w,�b"6S|��q:� ��³���Q�c+� 1X|f�gV��"��M�
+� �7�
����0�Vq� �ko�P��nǼ��oZ�\>��i��8@��:��Pz]~x&65A$ T�$
+����r{,�����4������cߜ���J�J�C����y�
+�F;��|�H���^�ڶ8��	r;� �Y�TK��#�N�Xg��Nķ
�B�q�MD9bZ
+�¦	�m1܌S`����0�bO��I'�X�h�ݺ�ihv�=�:�Nh��
p�W|H���Bg&�7W�_^�N2��9�e�����liS�+B�\�l����
�C- (�ޒN���+
\�16[�H�
+�,>�y�%)
Z�$4������	-
�lSt�̮T)��9�u/t�wm��,���27|^ЀSl7uڭ��|�6���(�E�>�
$sg���2R�N����ɘmB�a��������YZz��Y�y8�<�҆@b�ڠ|
+n�
�t��ï@���Ρ���p;���ꗏ�
dyΌ�ޥG�a�o�e��U�g��J��fl�"f��}�4uK��U�w�)�jgO�sOu�qF'G0��z�븣��M�9+��cf�&|�>4x���v�Y�C$3�&5Z�#�T��c��2���2B�7�J5t��
�L�J���5]�
V��ݑ�܋����n���&4R0*�$�z���OʞzK]��}�rL�_.�W���
t��kз��r͋
�B�ʋS��mBk�f
�W��4���3�/g�G��#�#EW[��F���$_�o��h÷�n%!G�
�� �ƣ-g��|9iu�/��VAK@�nA ̉��2 lwϾ��}����Y
�D����I9���W8cP���,6��n^��ڟ~��������mR?��/}���3��pS�P̵�B*�/o٫�:��kF{�<���F~��[{H�^�L�A����(ۻ��ԝ~׻A.�ij'n�w�#n�k6w��a�&/p��d������%'f�=�����Æ�����Dڔ [...]
+�����E�W���v�
Ս���U���i�*���Y)-�ka�˒
eu��|�0;Y�\�t|M5��9w5P�
"|�f�?�l5��TO]�ZZ�

+K�߼� ��������h�B`@
+��
+���Dw�R5�bRC"5�IXi�Z/G�K���JW����:�C�@i׷�J�=��d
��t9&��Z=@�,y[ïj��w{n
X���C���z
-NA]�'rqҖ�)3l��K����
�O� 4]�Z<�u���:���^\3m�"š�*���)�*�����?Y?��@(
����km�b
h6�
+ ��+��ƾ'��|���P�gRN�ØRs�m��:
�o51��c	�$����eE�3W�b
4v�>�$-����3�;i�7ʬ��\~�$���շ~�^)~p��ևO
�i��(��'�Cׇ�2�Hn�
_>z7-�$�cy^C�s��mm
%:$�]Q�<p�����LH�3�i�v���o���96F �E�z2 �(<��9r�J�����}�{�کEW$

�0���A��H�^j26F�=P$�n�}�	��֚ͩ��F�r�
q��`�w(�r�g�
yq���w7[��
�l��:A�ݟ��
tc�6I�H"1�W��
l
0�	W�+�RZH$�.�b�Pmr�M�越xѱܗ��w=ݐ�$@e��Í�VǼ�R���m���6_�.1V��#�hʋ�h}1a���K������l[JTю�Wm3Gen�_^�uC�,(w~oq��a�۲��a�y�e����fNa^�_�Ǵ%��<M/�Xq[p\L[�'4t�R���~� $Hf��*b���ŝ�J�+��6d�g�B�҃,e:ǏH��=�#cŷf�
� ����V)�`���\���	����!��L��Y [...]
P��*tsոO2\U��7���6�Kt��=B�͛��X�t9�	Z��h�<�3�d��=�Ƹ�C��I_�
q�`���xE-S(Oڷ��Q8=���+�~�����I��8_a:�(uO��� �]T �;��e�`��D�[qL"HxD��Y�
��)$�l��8`��w�2 oO�zs��)d����tNCZ�&����!
+�"�
1U?��6�-�Kw)t
+���Z���
�wxJ�
�9�c�"�O7l�}��
}C�ǎ�
"�j���E�}s�]�4����eeͦ��=K������[2�{�]��3Ҡ=W����ֺ�� �q͖_W	�+b`ugx�j�
/%�
+�S�b,�<s�ꞇn��Y��[yv⭘�A����*���N�(!`�u3bC����fO6!(�j�i���td6`��z nA!�D� :�
PV{�pX��7�Z؍:�L�C��c��	]E����E�D?nVn�n�.�p(}�Tbԭ�����"���n�ft�+�Q)�c�]�g�RO@��S�+Yd]
�mn2%4���z�J^R���T��W/��Ԩ��.;z���˔���b�脗+jXbD���FŎ��5� k��#���w�J���0��
x����Ό
��*�P�-�p��2��)�d]Vj{�����H5�
�\�%D�742lj�=�#
L)�:��("�MP6��;�Y�[�ta�759�әR�0�H����Zd2q�"}�t�I��*��&G���m��[�R�e-t�[J��m��a}0p~�
�B�ʪP��3�;�ר�r�oz�K��:��+c
 �{ ϔ���x�1�4�R�w/�� �\�1Ⱅ�p ��G_u$�F$��Q9tY�N�V�ި�Ǎ&rJ
Ɖ9
�M㚸�G��D�wK��o�q�y+���"�6w�^�VC����W����C	��"�]ӏf�0�頙����EI�W��)s�
��B��ē�T�
�����6�P3=��W��.A��?YP
_�4�K��+��)�#
l�%D(�b��g����^u��Wze�� ��'O����Ld�BH��w�4��xEUr��D�2��?pf�
>��/���}��Q�c
��Y�L4d�m�ɗ����$��́}�zw��&���eB烌R"����>�fS�B8���
zl�:�C�t��h���-q
�g���]j���8aH�x��#g�&TR�FKd'=�s� 
oެ�2�#���2�ru+ٴa����bB
�;�l�X4
Qx��*^�EP0�^���\�O�W�'^���Hd|��ǽ��#��8�vy#St��sO	�&,\ȽQV~=�̀'�>߃_�0�2v�3�����م��j�B��٭v5�R�;�
f
ո���
>%Am��g�ۓ0:���H�
�:Y��tSQ��D�H�x��ѳ�(!�G��}�(N��b�d at wi�e�&:���ңt�
ߏ������;�-�Q�i�2�Nr�`���[�5O��8�
+��#��T̚� ��k�;��h+f�W� ﵇A72�4	C�K����W�\�
d
���P��֭�����gv��庬d���ˣ�������\~��ˀ�,3Y}��]�<*0:y�o�������� k��p��~'�F�X�d�
��7e�����\�F�
���x����ST���.�)�Td.��O Q�
��-�k�%	��д�
jbn3X��e��0��
+q�������������{J4C߳(dq�!����݀#��#2�
�s?�����/�
��
��ysr��,���-��x��%%1Cj�_��Z��r�
+�x<�/�F��dW4
���6@թ�&�W�ׇ�tTe��`i�!&��m�F/c4��D
��k��F��(�w�`kN៶�{
+� MQ�5š2��<D)rm����8aUAgY=��qjd��&<
н��˒�j)
;0�uW�X���Z,/�71�1���q�T�;
ͼJɆ�c�9�\
+�n��$µ`��V�3��f��kl_[��9u��w��/ŁkzP01/�� ���(̡ӿ��2�1�&/�9�g�1M]]1�
���k;�_��˄hU�e0�:�qKW:
Ь���3d�KXv1M���7	�8з�C��k�挼���-�K��eE��>��*�
�U�eA
p��91�"r������E1r��T�
�NH�T����I���
�N��G�����R�|]��__@u�Q��"Q�q�K^#>p�7�Ƀ�sЭLzI���:3�Ȑ�>�+�e�� 
`=VKP��@�k΀�
 �~?��5u��B~��N�t�W.]�&���`�Y�u�]$γ.잸~�aL�l��~
h�|H�g'������*��4
�A����7U>�Rt��S��I��.\A;��|@S�X��s�1�����g�!f��eK��#�4%tzY�
�DB�.�t�
�*	���,P���&xPCF�)�3DZ�l�䈏b�dM��.M�7m�w��Z��
���E$ފ�o46t�C<ע���Ϲ����c�
���}�޵�q�0_1�lJ��Y�jqK�mx�E���$ �HU�Be�����J��ci�

���r8a��k�pv��:DI�x�n�i� 
+ at 0�u�^��
C1Sr
+[�3�"[�[��U8ky��mv�m�35��y�\
+R�CR֞q��(CCՒE��&sІ�Ð��,`ķ]<�{
����zE?<�s��5S���&����y
�8���t-_؛�u�
�"�?�Y�;!��2�}��A!x�O��f�87�8D^����;J�Jg��.S�-I8�S�
+�Yyӳi�
�Ѓ�&��Y�E5o����k!	�JM��k�(f �,�&.��M
~mJ����O0������!p�!��%�Ɍ��|�
6x��6&h](��\�]��F��j$��
+��
ר��U%I���$F��)�r聉?�Y���n�e(H)�@BU���U.T���2��;ںlg��ɀUx�o��K�m��6B���V6Dh��K�3��[�� i ����'S�v"@�*��̅��G��S��%,E���{�!�43'��r�"�6p��$�yVE�*!�`t
��%���|���e�d��hu��o1����;DN�F�+8ˉ��g�zC���\y�*k�1���
ֲ+4c(��P���o�Mx��\�͟�t\ �$A�i�GZ�`�
+р�
X�	u���]L�װ�Rz��O��)�b���o�8%
�(�

�Y�O����7�9�O4D|F�QHS7,��-�lԏ��?Mϥ�.5l���-s�xǵ:���~��?�92�˂��3w
+�-���KDW��'��77.�ID=D�� 
	эȔT��Gk�V�5P ��S�[C��0�N��
+θ�<��#�VE�
#����a��$�i�Z`����*-A0��Q�
�;1���Ge޺*
.
ʧ�#{\�/�>��{��ћ��"����R9 [Lo���nmz

+MJ�(܋�H�YLo���8���y����v���=�
�L?*gv�J��qt�O/��e����-dGh�si�lA
ʍ�7�1�q+����^��T�-�>(�)��t�Q��}\��'����,Pp���L��PЯ��Y>ƞ.�@�5�XI�i�:*w8ֽ6C%�F��j��0�s�9��׫	5�6��6
N��lQJ��y��_��6�(n�ޑ�cņ�i�+~��E/�5�t��^AK�[1r/n��Zh�U��|2�0ab	��8�8����s�ϑ���5R.m�˕
�ӗv��$�;�`�T4�r�q\jC�3>��:�������YiF��;�K��
+����F�(��5
��2
Fu?�:Nrv k����^
W�ܽ�p���SY��wޯ$�G5�?��D����W��g����
�v���
�ȟ�
�L�|�\�=:8Lq� ��oS���A?�z�H9��?�BZ�uG���U�M-�'^�����Q�3���ӽ�`��
�c�<�v����������w]��6�g
���Xaȱ�t��rB&=�/
+ ����yW�u�шm�S�P��W+�	I��
N�,�
]��G�bq��K)$�h]  '������R��	<
_� ��F�M\�Q���\�$Y��Y煮�kr�
ˣ�����D��De(�?�L����&0�ۨ�X��lO�l
]Jc�bυ��B�-�����P���XJß<� �A���
E��X\iguE����_ +��������3���6�?�j&���Z�7a<d
&�yM>��6�
VLn�|��Ɨ�{#�
+}�nF��dt��U&e��� W�fn+�q����o���,0���F�������U)߷�*��T��N��a(�󊙜��N���G�@�v�IE{�����%�N�KXt��!ӑ�\y���y#��3i�]

+����c������`�Ms���l=!��K\Q
�bh�+���s at pCE�OkCtu"|���tW5�A������B�M�c��A����
F�m���
��
s�o��*�I�]�����΃7L��S�~����"$�c��%Z/ȵ��(�
��s�;�
�4*��Y~�>N����5->��؏ɰ��I{��x�����o����̷M_�^@�k��
ʓHti ^�B��;�ʰ�2�X������
ˌ3�ĺ8�>�d�!�Ld�.u�t9یȟe�ȿ���=�QeCV>�5f��9G�1Te;�����"h}�
���{`��m�����MZ4t�w}z���� ѡ��
���d��ܸ
���T�\�cF��q
�!����.?q7\�U�H�s��$S����cnW�[֞Tb�$�D��&��3\��[���l����
֐e��]>�Fv��A��e��*\O+�o���D��26����
"?í��v�%����Q����.󏉂\|���Rw�I�[?�
���ps�#���`Z�w�hY�"����R��Ȩ�.A�`�vH�yKz�m��+�-ϹK[���ҕ��N�����Aٚh��>�{���iC& 4?�sS�F�h��<�;êH�:��|�D������Zw��>�1�]���'��R�5#�����	���ay
��a�r��J��W��� i�k�{ǥ@��$�a����OJ�)
$��������2���
�j�ȓ��eNgx�Y]�t�(�$/;
L)��y�V�<9�ЙFצH��!q��S�y����sf;�nf���.�d
�c$,-^�~��nX,�
�C��l�by�
���Os��{�B ���r��
�W� �"��P�Q�����;̊�p
��`�7��H�XbE���%5�R�ܢ
o<�$U�ml*vy?�ܦv�9�E�E`3Y��t��
�{��RP'wu7�`�������2���1�4��"��
r��q
 �h<�>�"K2��B�+����X*0ȉ:�C��~Y.�[�
g��"�ͪ
�����x�
+�o���;���Ӎ��0��z� U����%
/�lū����&�g~{�3Qg��q��T
����
���y�a6�G�O���{vWXFF�O8�4�{LelG}��)���(��a��5.�0���6�$ٽ���Y,{hb���uY��h��q��{���#��-c�;9�|��A6�2(3��0MN��!�L�w��V߯P:q^�h_�Ȟ����6�������
�G�v@��
�lx�p�=�}%��*�G�0����G�_�L��s�< k��BR������d�� �}��X�x�#�ti���@L��<A���AAhت.�k�ջ�ǯ̕@�S�ź�Z�G��y���<q.o�������r%za���Ʉ��8dW�H��"�
�j�Z� ��
+L
r��>���.-fZP`wz��]o�]�7��f�fb���2�Q��/�:��?
ِ3a��ڛ�����\��
)?�ra�3r�&�z����Dmq�<#��Z&}������a$�a	e��î�	6w��
+�(����Pk�A�
p���8����W}�|�fX��*'��1��F�ɿEGU����]%K�r��{�у$�#4Ma|��rQ$ Hט�.�p$���r0_����%H���i��I#�<OU�⃊�������q
\Q2+��w���q��|��i(�����;�
+̭W
]7l��	h�[t;zG�̽ ר��=>����������=����5't[P�6��ɐ���Yi��2j;[�r��6�Ĩl�X�5@nu^�y���m���:8u{���|�18f ��=��1�sAWD*��j�1��o2j�ۈl6�N3�< J���tu�m��]ii`
t��y�76�z&f���0���œf6��=d<����*��_h���{�����\�0�o�Vs�<S�;��F%N��GHP�,}(��T�o���
�Q�JLr�
t�&%���.�K�x�Ȼr��ʠ˦ܱ�F����� �@>
薻竂	T�uA�|P��8At�Y<?f�W[0�?��c��g�����
�{.��Nv
+�|�z�,��k�v��[/"�5�d����
+F��'@\��ڟ�Vw��|5p/W�粐�#`q���0P��ޠ��P5=C���t99j�aX1�VTE��s�5	?8*�,�l��
&�l�.���IK�/
+w\yP`��
	��7y7#��~�6�2�����N�=�V��l ��9�9���
Q�C��]�H���xAc,���&�!�n:Y���<��G',C��6
+OPе�[����4��=��7"S�u{ë<q����.7�
+�`0�L�ִ�Tk"� �F�3&J�,��>����G
��B
#���
��]�]e�"l���>]�ݟww�9��!�>a����>-���p[�9�6g�ߔ��¬W��V����Ňc|gg�Y�ά_Z�G
�2�l�n���Un��"�ۊt��C�JD�ݥ��n����i��(�Rw���a�s|��V@�Q2!	�ȩ��Ğ*;
���hzD2՟"�†�8C�9���F�D�`,O��`�4��"Ol�r�t�v���R at S�iɶr_��ʰ!5����f�Ǿ~�2ٌ���p����h����B�����q������
�7���{42ht#���e�Z,�����}t�
�Y�y�[��hDŽJ�$J8F.NT�u?qLƋ�֭�	A���j?�������Bp!��.(��ث{
���T-��I2&lbB
�
+��
����
+3Q���Ȥ��= ���^�\�}�h
+ё!�O��I�-t�;k�a>��B�->�c\`("@���K��l�q
+�!Z_�<8�ύo{���/̡#�õN�Y���c at W��	4�9�2Ր��P_ig�V�hm��
�ǚ�G䤒�!:�d������
�`s��y:i����K����n�aT
q��e5���p>8[�,��o0�3P
+c�\�Z9�
+�`A��1>��O��S�CC�j>��W>�bb���+�ƶy�n� 
��O�{ގ�a��=�J��c�4OS��u�jBs�|]�J����*v>��6�͡��Cd����4ݔ
\���տ��5H
x���XŦ�y�|�+'�
��|֠!U\e<$qp�2{�+�#�{h҈�Q��������\�&ԝ�j�M�E��cŃ�/��K�Ō����
$}�J��z��E֏^�_QT&�At�u���.�k�`���툸+M�:�M�Oͫ]��TZ:�p�:6����w�4~q�?M.N7	��ǽv+mA�Dٍ���`{CO ��ʔ�M�A��-��I�7
���f ����/
�r��*tN=.��S������6�D�@�+3l0٠,S�*�8� ��f-��r�H[xHY��A�[��0� "������۔�����+7�X&�s��A��^ݒ��)5H;�m�����CZ��=�*M�9�"�Ô���w�y/i�H��Qx� �s�AQ>�r�
+�
j���Ǝ�UOا�[�/�0�m����tO�
�\�c	V�o[$=PCMJ��ENQ[=$Ȓ�Y�����w~��_W��s[�Q�DŎ�jnP��
+	�A��֣��+�9"^��҃ҧu���^2�nW��k2Zw `
+endstream
+endobj
+3436 0 obj <<
+/Type /FontDescriptor
+/FontName /UALYPC+NimbusRomNo9L-Regu
+/Flags 4
+/FontBBox [-168 -281 1000 924]
+/Ascent 678
+/CapHeight 651
+/Descent -216
+/ItalicAngle 0
+/StemV 85
+/XHeight 450
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/asterisk/at/b/bullet/c/colon/comma/copyright/d/e/eight/endash/f/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/percent/period/plus/q/quotedbl/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3435 0 R
+>> endobj
+3437 0 obj <<
+/Length1 1647
+/Length2 16004
+/Length3 0
+/Length 16868     
+/Filter /FlateDecode
+>>
+stream
+xڬ�sx�_�&
�vv̎m��;�m۶mu:��;�ض1�{�9s�:�7�̜?���U�����]��� QR�&ljo
���s�����P��5vuV��U����4w�v1�����((D��F.��vbF.@
�&� 4�� �����( ���N��. juM::�����`���_OgKs; ��7����-���/����*p� �,m� QE%-iI ���:@ht�[������	@��h�
���;l�� ��ۙZ�S�3�_.ag���hb��
�at��8 �l-���>,��NFv.���
`igb�j�O�f��J�����ۿ�_2%{gg'K�ߨJb��������Ζa���ߝ��&����/�/�_�������p�'�1`j��`c��7�_2'����lig������FN�6 at g�4��9����Uo��`��/o���_9X�8m��Y��4q������~��3�03��n������_D�O���M������`
+4�cT�w�@��2����
����"�����U��������J-�jc�`d���=g ��
����66FN���������������_wk��������Cۙ�U�3;��͖��
@S%K
��������]���dci�+�������,,M���Q��������W�U��"*'/-G����ڬ�+\�<
���IS���-���� xc��|c�d�{�^Gn6�����"b�ϵ�����@��������?~����/4�v&�����������_�`W'����k���?���@��nu�ބ7�*#;ӥ;dJLg��|$ԡ�Y��(�ξ�?#b����>��e����ҩ�Ǿ
��X�
Uo��������ON�� F�r��3��E�-m&���)e��w(™��N0WO4dnE�H~&�M�](- h
ŧg���O�TC�#ý7����ty��F�~��$).��N��&���n�������d�v����^�/,�?��gtEҝ�W-Z���F�-D�� ���Y�>�
dq&a��(���L��t2�Y�n�
��!�H0R�f�K{�h}g�h�X�VY'̆W}qUn;���H*�]q�)��%�o��o.��J<~K�*��r?�*�U��aE�	�@�J�=!}<wQ�S5c8m\/b*��Z���zo���Q��A/D�������a|jgn�+3��=��Ʃ�[�
�� �L��zKU�?8�Ќ���+ہEY�&z�7���Ue
+��3`��vW7cc7Ϯϫ���U��ʧ�&XD*#��u�K�X#]��+È.���i��dۂ��&|�_��-�o��5�3F�V8
����p5���E���ʫ�� �L����ͨ�g�N�*�'��C��0Hĉ��<�!�R�D�}?h�Zy���P]���
+�A���q)���;"7
�"��D��Ќ��,Z���w���I��~Ϧܙ�R
+�A��2~%76HT����t��-
��
ĭ�x�䉽E��0
1O�]!�<�����D�7� �VS���Our˞ZY
�Z|��z9�o�`�k&���-��9��'I'�b�B��P����-_�#�@�&$�W��89N�۰m�����;ծ�@M.hؓ9�a���{ۋ�|��ߔ�}}
�A'$T����,��4���'!]:����w���l#B�G覂�3 ��$X4���bPW�}Ev����
+�#���_��� �B`�Q(�.�l��.�1^Ӡ.Ƃ�Y��[���F^����V�*
☍�d�q��l�b9`b�$���
a{�����6�����w
�����H����W|�<��U�.ܽX�p簡?����y�@�R�QG@]���4�'�eD����	
�M�l�ӷI
a6g�fZ��~L�)��c
m*T����N%
+��S$N�W����7�<��9�_O��kk��>C��
k�]�Aх.��b^L���u=�W�2��;�
���C�a6�n
�I0���5��ƣ�5������t�zp~P�;S�5�#�b
[�J�,���%�u� AW���{$��1��-��gtꊥ$��y7�7���i8��A�u�i�D��4[d6v��a`F%F��_�`�iݔ
��V�����L�՗W�%WS�������0y�x�-$J��U�/K�n��g��[���~W_�nmB���늼��D���G�p'4N��\qwߒ�_*&ށf�ٳ����]��?ot�h"�M����"o"ߌ�y\N�i����2�N�qa��sx3�*�zո�([	��1v{W}����fzMO��u<3�����p�):���
:�@�f[D?�:'�-DM{ ��`1�~��R���' m'�H �
K�+=,�B
�n�-
�Y�áȚ�_W�6S	����2�G�ϯ)�4�&{��y�Q��捻K���7�������K�8ֹh%�
�p��*�OD!���>���S��e�Ybg�4�N g��z��ɯ��i?�i�h(���m�kĺ�6%�QUmf-5���'�L��:��/�a`��&ܤm�)����#��3�r,�@ַ��@��X�|nu����2`4��9§��P��A+I�
Rְ�+' �
�\���>Hd
+�Q6�=�#�k9
�

դ\��l�����_�{=c��2UZ���,HVg�t46�;,�=t�fK�ė��W���
Q�!o,ɒ1�O��f��;�9M����|�/�j�*0��
�(#���©�
J�S�W�3,+Y��^[v$�%&���ʜ�ul�=
+5�P?9E�V����#*�
�g#*?zB��\�$
q,-1lv>�#|�o��o���yIŎ0{�9]�֗I.�����`���x�u���
�"h�-%��>(��a]l�`���
9�lk[~�Yz�J�E�>6QN�S���YV�{�
r��
��� �M�!@�"�	T�0&������(^�G6�*
��O�I]x%M9����� 	i�ϧ�#�=��+}����W�N���w�h�<`Ku��O��
��EP��4\lC�
GS
��܃��14z_q9�U��feq`:i�6�z�I�ӗ5���H#7֝�����x�W �5
���o�n�BNa�*~���J��y��3}v�,r���JK4[�q}_0��@j��SA�0�#��}*
<��^/�]f'�y"�`�����fؙRs���ǖ��i��ҧ�F�i��p/e3������+zb���F]����f�d���J�u����S����?sC�����4��E����A��k��#!��
BL�[*�-�U߱�B��xpQ�� [...]
t_��)�_���懹t&e�_�Һ��g	�Tп���]VF�
X���pOM�o[��,���=Ͱ����

��[�y@����FX,`��j�E7
��
��N��`�Ǭ�$��k��}��"�5��
�b��}��]�
��^F4K.�7X�/��.u�����P=1�7b�i���s�.�����'�G������-{6�2�/ׇ��
+�^H
6r�uVKj1���M8F�K)���H��
ڶ�-١��!$��3�y0-�p^����ߨ��O_r���,���}�D(@r�*ಯ�r!���@v�Z�V�!<)}V
�+�T�)�<n-4Y���V�/���?�k��%�;9��,Vh2�����}P�m���V,}�
�/
+%D~|D׉i�
H/A)�&��*֥�ע�P$�R�1/M��N7�Z�r��/���cU��y�UL8[e��S

�SJI (sp�,�D�-�D%���16HП+<�d��8�v��������ʺY��e)O�Ȁ���� ���6 W�c%
���9=C���4��el
+�>�������AtcT�� +� x}=K���߅$t
2py/4�~�sR���
OFA����ŋ�^�Wc,'��I��1Oն��C
�dhA�%�g�K��%nc.�
�E��Q%5�^���S?`b��m�	C�
�%tS�u~=������
+]����w?p4`fmx?�"MOԷ8�l�%�/���.AU�c�g���M��|���t�Qu�L��X��n
�qX��6=�fS����D���d���	�j
+��i��S
+})bթ4� lR�JI�T��/����_�)�r;��'�O+���@�+-i t���&�
:��щh��L����Vk�S;kۇ7�sƄ�a~Et���j5�/�X�d��\��*R�h�����9z������ n�m��܁�7U/�/=�sT'�s��@#2���F�z���C��cV�W�a�=:{��­�[is����Jŝ�� b�!����T�]�G��
$�ή��J,GWݟ��%:�n���}c�Y� b���R��e!��S�͏jDB��4I9�H������υ3]ô
��K�� ���>V�Rf
���_�t��r�/�^��JDK%�
+���������	4�@�@�����M��F��'���u��I�ܘJ�����ر��ʞ��r[�

�%P� @���r0�Ιs𮴺�/�+o)��w�m��
m��`�*�y+̹��q�!�y���'H�_�Z�ɧ`VTB d*�le��8D4�W O
���E\���-9#����L�,[]�3�0Ó�1��@^�VM;��o��˼uV�xB�����@{:<ҡ�S�,��� ���U��S�N^���s��A
��%`;��P]��bP�K���"2�f�P(��ۇ�/L �-)�
�d.AtY�U-�^u�8|�:�OC	!=P#?Vy����ױw
��g0�Ră�!^8�F)	����N�r�c�H�22Pab���:�-�;g��wq/V�ۈ
3V�?<Fr���z������
�R;XN��8��z���rՒ�C���+l�>쵋?��3��;���#�U��s�ݣ�:����Z�O�[&�@!�v��=�R�1�)ĆZp�xG2x�2V̡�N�olXַ�J �1�<�]J����={��h�j�H��o2��橹��
�J&p����Ra#Ƌj_3���f_*Kr^ ��uӃ��u���6�A"$<gi �^r�RetntF$7���
�B�gр�
+�P�Q
���e�[�Y�%��Vװ
����
��.M���@���.�&G��ߠ\� 鵡?��Ɗ��X�
+� �8�s���qm�x�2���a{��x��[�Q �8gH��"�ny���K�eL��5�CtN|��4@���R�o&,}
�fι�m{�ʥs��g@z�G�ȹ
+X�!�'!����1of�B�_���g�����Y
=I����
��
+h�ռsQ�FS�(�Q�V�F����p}䲤��5bGˍ�ʤh����2B��'�{=�������W@`�{+nם֎��c��9�U%c�j�+�5��g�~}��Gx�n�6��Zc�eL
��(��
Xj�
i>�q���g�X;���C��C�����@Mm�lTz�HI�b�s�^���P�z��Y9oy�7��	�[H��3��S�c���u�8Y�`D.ZV.:�P�Mr��J�&����nz6CCo8㬅����r[3��_�id�6�C_��[���b���a�3�
+�1������!>i�|6��	���1`�|d�'o">9�,�fs���@q��8s
M��
�(��
+v��h��vA>���O
+\���SBH��ft*?>������Y�{������b���:D?߫
�-骶��y~
wW��-��lx��?�a�A�
+
fHhd��l5Jm��P�8tϼt����qH@{�!�Ktu~wk�ೋD��*:Y ��]�4�9
e���*��|�j��;������
h.�>Np>���k[碨�P�
��a����pc��]�b˵
+�\��JL0h"��3p�|�Yc�
�m�lO��%ϙ��W�0IP�7
 �7�pt
+�+���/�����f��M`�\�R��1�e1�
�x�֣�Ws>=\�N��#� 3��Z�yiK_���OD�UK�b/ە$ܴ��
�k�գI��8)����XF�3�D��(C��^��3ߊt��%0f���S��{"��5����SY_�Yݙηy�Vt
���%o�7�C��˯䲙
�C�0nߍr�_��40X�D
+nҝ2��0��j���ͺ ��]�t���9����ܻ@lu����N(����h�
)m��)B�#�90�c/o�#�[ط�A�G�ӉV�]u/�{;�ى�U��`
��;
��4���ቺ�
+�S,ÍAo��c��e
���*��
�W��`�B�i��O��({jFE�
E�
]
~I����E��:����g��|�(��*�l��
+h][/W�8ҝ��8!y�8��1��ѩ����Q�T����
t��9����
�f��%ƞ����E�!>��Z�5�
wQ��c
�����?��]��pB�v��^1�!�
�n,��w$L
����jn����s/ƛ�*yUd�|���o*�3�����FhY��#
zN*�N*��*���]�|DML��H;.�~E�_����
�}��D��p�e��nh�����n_��V��`&7�SsF8�e� ]E����8g�7.��
F,���s��=��I�`��j´�>@�Ol��a�hlw����m���z�$fj�vG߶��9�r���/�i*n���:���D2�gG��ͬ���k���0V��5��cb��L�
z�9����U�}��T�x�$m�e�h�EA0�S��Ҹ��٧�/�JE"4�_�1
n�`4!�&@��r�$;��S�6�g����H��a�v�5�q�AFۙ��0w��X
+�>A$B�љ
*Fo�����@lc
kKQ�r�EW}��(a�q�#�����V�ZH�K��ꈳb4���:���Sl�uj�������h�M���WS��tĤg1@��H���
.뙼�!`�=����"��	�����`�=z����aQC�z�#�l���ȶ ��z�I�t���h�l��_���&@��EZ����5��3��S5'���-nXʓ@��Y�6o�ی���Nc�kE�ə׎��6
��-�&v]

�ҥ����Q�K�z���
:����.�Օ��5v�m��
�Y�[���C��
?"��sg߮)&z`o�Ez�}��q�
+��|
UV�n"�,ˤ(]-Tɇ=���۱,��Q�
�k�k���������
��D
+5����w��L.d8��8R�aCCu��8Y��ާ�_�ȼ]ܞ�������ި+iJ]�'�ɚ�E�
�E�sV��h�P+ǿEf;3<�;�R7o{���
�x����V`7�]�g�}]I���,��Q��r���%��r���m�޾�]w���Q�������}��E����h7<��b����JPt��фn�������
�:Gu�v�ҹ�
���C�更 ^Ry�|�uϯ}eˠ�S��^h���&��
c6�O����
'C$���E�Ŷǻ�3�6~���n-
:���D��
\��BV�����w).��
դ���]�?j�4��O�O	�ӽz�e��ӄ�����y=c9��6�
P�{P����zp�˔���$��<�=�/,eGt���c��$�����[�������P��c�)����bx��U,
+��3���@B���g8�
j�� �V��a��㣡O������$ٝ!�U�����(�v
��0�4d2�Q� �Z�7VM�����8$�H`b�����=6��Z׳q8�?��j�c�|)�EP}>��5�,Z��a3�8�rƋl���:�
�]��}5�ʋ��3��"��������E<���
��e:�Ia�ڣC+"n�™�[Q*+��v��n��/)�$
+���5=��\���Y������dwg��A���,+�&#�e	dgr#��"��K��F*:�X�(P�
:.��>� 9B�)K^��j��
J�=�;��?�\�+c��ԊE�2y�ye�LL����rD�����L�t�{�Z{gM�0�j1�?�L.�#e��H��
�b}��-�L8�Q�V��{��yϴ
!�Pe1k��J:�|- y�X�Nj�� ɾ�8}P���nn:�7�T��Io�7I���vT���̠��[���F�����H�Z�T��"6-���Zfrߛa��q\_(�!���V��|��4ށ
hhk
��$�M�G�;��ڦ��a��?��(
X��x�ޥ 3������`���K��j��m���H��[��c.�}�w�3���/���.@*�7���<ךX��Ȩ�
sL��u�� ɓ��0"����G��$�6��
�)�N�ٽBa?Z'o�
,�z�8�8�MW���h���
A��7�!*`v>��"A�//_�KI
Ŏ��Vĺ��?N���7�^�%U99Թ�MQZ09z&'�t�k�
��
;u=�uS��X�Y?l�
�}����@�<E_��������aQO�8\~0�'
S]όw�U�Jɰi�jp��k0���l\љ�<�u
�ݻ�f;�Yj1{xw$х[7��TIAFT�(-����K:�����q�E�97u%�$
N�%��&T�!Z�yy|/�[*R�DTT
+
��^R��
�fS]���
���"�2����fe��.ݒع����"��tٳӋ�,Y݉��Q�>}���`��BF��� ���Pt
A�Z<&�9�2�̽JL��a��7
�$��^��
+�3}}s�>u��
�����<�xWUcR�����u��BC`�n�IcA��(��P�1�
��l�fA���Q(-���.���>��Dz�u�-��P+��v�o������u��
��(�٦RR�p��FԐ7�p/&����XTZU(�<�>X��U�AX�
��A��:a"�<䡕�>�#� u�A�3u�k���.������l9tV��:W�%߬��'̺�s��Ix=���s �PoLKMƃ��]n���q�Յ���NJZUz7����:���S{"���l�
ټ����W�Ӭ7���ⷌ�����ֲ�T�OޠH��A�guS}t9�����6�J�����-�A���ЏKp�ՆN��2 ��{/4(\e=G��sITNF���
���z���g�T�T
5��=��6|��o����j�9�{�'g2}]'�Ѝj7�����!�&�Dl~�\��
&6�4��=�=���,��*��^\�I	���!�h+�~{�D��>H ��Q�z��Ѝo0�����av|�X(�a�����8L_��7�Kh�lZ�1uKmk�ecX���K�$5����zҩ ��no��vn�v�r�$�U�H��r\���'Z5���Td�+*6����/&?]��
w�
t�M*FccF~�@�#}{�6�^W�+-ػ*6z��7���5�{�Ml$�}[
��l�70�XN_�. ����t<���>)��U�k��;І2���
��%ޤxU�x ^���Ƨ��aD���(�k��*q��>?�L�w`q�=I
$�L�+�8SQ݌���g|bƇ.�N�W�
+	ǫ�Ҿ���°
L-"\�W)~�k�
��
n������\X��#2�g"U�J�:�+Ͳ���!�Wn������o:5R4r���z������I�G�Qn��'�:�}�B1]�?�=A^0��|�݊���Z����CX��3�l�n�SB�`�1���S5�����;l+�&��2�����x��,��fU#�Є
�v,a��G+���g,(0e��#ǢT!�=��cz3B����EV�kl
fOn
Lt�&G�f�OZ����� �p�+�
g
�)�>�)�����D_LW�n��-
�2���g�o��?��"�l����KOU���z/��5�;gcK��G���Br
��f��;��	z ��	��8
?΍�<���VO����}�>��R�����b؞���i�ە�İ1tcF4?{u�HݝfJ��qO���P���*E�����0�"�����_��	��޶��K
�
La9�øN��1�F���bv/���t(��OICv�1 { ��ڝ��U���)���z��

+`��1��m�ѹ���8��ux)�~�eT;�!��3�����t����i����6/[f����Y�M�ͮ����7�)�]��~�zK飔u�h!�b|
+<{YHlc�;�F�wxY'��̕��sUb���-#JIhM�hV�7�AG
R�%�PU�v��G1ݙ�$h�І��~�0��>����x�ӈ�t���(�ƻ��)�����f��~����Ԑ'%�~ g��PE�Y!
�K�8 >���0"�KS&�� ��^�v+q	ε�k�I�4v��`'�e��#L�����1��sC��f��
+ï:cs�]�H&�.�
��+SDŽ�����uk�m�=�0��g�
|��e�
�4��$wB������O��w�(

���
�+�|��WP��Y
+ħ|k
+*��B�HײW���6Kn�Si�'�(E�J��'ibYf`�R;����hBUj�~��iK�j��n������3:
��ζ��W�4��z���ޯ�S:���#�uH
�e��lsn�� @��M��8�^p�u-��
:�$�wϏj�L�
+�ٙ�V4Yۆ}R�D�;��sǟ�p��Pl��:�������G�Ma��R����c�
䠊�
+k����)�{V�W���_M��Ėm���=!�
+��b/��Q��.��P
 �ȼ�/6ߒƢ�1`F��(H�"/���"Sq8��e���j�x�Q�)6cLV�ꮬW{ת~��wT��9r�0
�����c�w�p�%�
�M#%�0!�F�.�I|ӿ_;��8��x�wH����x�w��җ�Wv�X����E"�_��1��C��
+��X�����@�
�9;���O��>u&`��%0�~ް%0	�����*�]����ψ�H1(+
��Q�,����x�(]](��4I%i�U �d��wJ��W��.i�
r���Ѐ���N;kE�N���Y5�ׯ�W�+�����$N��أ�m;w�������W�~Y���*��:���"��g���t��ͳI���~Q
Vz�N��s?�
Ve����m/�m��QN�o�������R���9|s��xz��)�<�r a�'2w����S2qG!}�!�� �
!�{n;鬛U�,�_?8˺���	5�e&<�ի�kq�1q�=���Pi���8<�."�p�}�&MJ��預�r,L ��L4��J��h��uƗc��zX!����٩3$�.zQyWi��
+s`��p�u\a�:�vY촭w�8��~��'z��[�m��6♙����Z�z�,a�w���F`,����U6���j��
+#[5A'�Cb%�ɠj�
+��"�Z��@R��@�b��AAԉ�+�pZ�F3?H��=��BM��� u���Mc���@M	4�*O#��o���N�&ޗt��]�ϟ�x?)C��N'a"�ދ�TYsx�
�!<�:�ӫ��)zA-���L���\�V��nq0N}��^}
`b�4�f�`�}�	��s�dR��*{�;o5Ξ
���X�IaH9��}oP�j���g�D~����P��(,\[(kff�;�|�螉�S����'9i��K˱��wy�>y�cYW��S�x��u�g,�
��e,��ܐ�ٴR4��
������
!B�R�
�V^�;d���.I-B(r)�d}k�qq~�<*ZG�Nv
<5p�OI[��]��W�Vq�y0�Z�ʰQ�VRVy�b�w�c���w�(�:�b��u��A�I�z
�3oaJJ�t8�Ғ�ޘRVH<�����J0��`�(kY�i�"�&�4����c�ٗ\�BhGП�w7݊L|�
%,���s5{'�����0�L
+%�@�|A&��b�m���]�+x���E�����1�2o��)��)��<{����E�^ٰw�֬H1���^�*"* �����b��9�����\l���`=�$�;�Ƿ�_�?����0ۤ�vKS�_�<��
<z�a�"�8��&���#�aș�з���p�N��Cj�F���we���cL���#u2A��=T���5zT]o]L�ƥJ�D*
%|u�Tœ���o�����
+�f?Ln���B�VM�
�I�-�t(�X�6}O�7"<,r!��OM5AXH'���/����9���$�J��ND_꘿%�J=�,:
�H4�XYF&i�g�4�3�v̿�Ӟb���lh���\:��@��F2��<U_`�W9�n#���ҽ���ղ=X��7|��ՙ6����21�Q!�˷�M8Jc� W��G_���dC�;�IW���qI����%��F}�hƜ^�9�Ap��k��m�����
�K�I�q���)�x;
3k;oD�A��V0��O�Q-���b%�[*���e *��
��j���JCܛǍ �ȫ��1�f�A���g&/�wj_�{x,a�g)��
��V"
��
��V~���
�]�h�@�U
���QF��o��w�I>�I�fS�)�2���\���8�U�wE65��{�\x�(<{��`?�p
+���X�Z*;

0��A��
�O.>͠�_�.�-ơ�93�~OS�3!m?����qUQ� �z��*�ḑq��;��x����GN)aU��>hT �
�����V��J��/��m��'C6WV{hX/���a���KX�����a"D�'�k[$k˛h��M��1�δ#0c�bC
 ��Z��v�o<������?�@�S͏Dq�c'd�n�C��ą
A��NǪ��ڥv`ع��TYzmS��1x_8?kZ����[͉	xemlf$���{�,N9u�Mg����!?��u�&�7�Ƌ�#���H�x�*��u_v����:���X�s{;<�i8F��
��i;	W���n��YM�ʃ�"�<�&h��%�����M��
B/ˑgz��힠蕪��s1]�X�oJ��O��D���m
�`�X�!Ta����,A�a�QJ��z�%��I �^��CV��Z��6I��J�༙;"��Xu��R�Jߩ��laZ���nM�.&�ݑ
��$b(�['��viS�#cE�˒��.�����Y��
�.V������y
y4?�?���\���Y��	���~0WO���1s�"BM@�����j\�캎�l���J�Q?�"?��A0���� ��U�q�%���@P�v�;*{�I�f�"�$��y��5��˕>��,��l�t���;
��#���Q��jR��+
��3^Ş�r���F$画�?

l;���K
�<��WQ� J�L
XR�|�F
j0c�c� �+�tL��$�9LO9��R��%h�<ʼ:��3nD$Xt��21#P��23�qc�H0�e��&K{�;*�	���*�s�ڒ����
-���Rl����&i�?/��9�
�h���ْ��]r����
��=Vu��u<V<�nB�)
���=k�
�3����*"�j��>�
2ۦw�!���'�n$�e�5NuLQX
#'����c��
�@F����ޑ���w@&ُ�%�Bjx9���Q��]�7��G/2��iL��f�[��s�y�U�77���5�
+^��NFF.�j
}�.� F�*Z�&�X�r�g��\
&͐q^���FGƐ���
=�6�G��
dC�Kr4�^�<��=�}��
+HK�M
򎮑�>���)h7��^'�߷�<qi�I�״�D��؉����~\� �


��9�
7o at N
}��a�*��
�T���Xޠ�t���{����v�8��W\�
!��2���~����D���D������g�Tv�D>FHl�%�:xMAz��2���>
4�SNˍZ�)F|�������j�h/J��eP�<��R�
�NAӹ���A��ּ_���"RJ�-�r.I%I
#|����-�A�
�[��q�LT+����x&Ѵ{3&i8,7
���Ӌ�����A�Iy��jE��FK�`f���RUDZwr�����
�`؄Y�y���7A�3��
4܍-s���i{�mt�\o�U�)/2N�
O���X܊�c�����yK=�%����"Oޔ�z���lq�q}ŐiK�5�P���I��-�]t��
�W�����LJw�n�| �����X��s��nzj��ՙkz�QO	Q�{f���fw�����)��� [...]
��x�&��O�biFBuB|.��
,
���`�pu�j\��Qr|N}�N�~d��q�ա����jJ��'J��m�;��q�r�Q�p0���l�
c�1J�6'�n3(���40|�Q^�
+`��|8�&���|�n�xbc���"�Ԍ��J�kpy�k�������J8�Bj���Ơv��H�:0C�����%;)3�?���PA��
x4W�b��vR�`2�Rz�����8�9'Yi���"
�������}F-�
�׉�iU�O��Eٟ���k�$؂Q
	��
�}��
��j�.e�
�:�p
ª�
dA�iш�
�����K: �r�ط�O���K5
+�ʛ�
�9A��|^��)萸���ɔ/��J�,gki��s�쳛!C�Ì�Lw0/�yƄ�J���{�f��.��%��U!�X�d��sE�M%�R:Kٻ� ���qrǫ��6�]�p۶����+~��GZN?
�0U��M�4J�6ľ�v�~
�6H�V�Q#��1�a;�
�&M���3�
�� �kY
�}���
++P���{��f�$�L�g#C$
?�
�
��g�lE�b{ ����N0���0�{��
Y�Y`=�S�8Uq�����[H�E%}uo���9� �]��P�4�j$ڤg�
ӼZPX"�ˠ�!0~��C��2#���rc���X���I�b���U@�
���(��‚���+?� DfO�be��{%���mḳ�������]d��ڷGT�����l�W���-&�����S�g��������ZA�~܌
+ ���&,�� ����~�
q(��0��T͟��<�
!�iVԮ�s��<�V�_�$��_j�(
+7��M�}׎�7�6�Q�d<�zG���
�Ж���3� ﰖE�R l��=�(�\�����(Z�K�9y��%r��٦��P+�Ym���ɖ
��ølR�>�����,��"í��#��B�����l-��C^��:t�a��V�
+[U�����tLƊt��MXfK���5�W
+k��t��/�]��le�6��Y��_ڻނ{�i�����ΒY�t�h�Z��$ڦ
����U�#�A|A�{��M�ﺼ�/
M�?��ӸX�)*�TΙ9� �K� uݹ�5!	��vB��q fVcC�V�f�k��uB�z/���8��^��@�{o�bw�R �ax�#��
�#:V
gi���
y��oA|�GR��Sz�Uqw�`����y6{���	�����4�Zi�8j�!u�xU���S|����۽���K8�����n��:��~�{��ʟRۏM���~���|S�
��<�쩐��o~ED

�Bxq���ڌ�/�ĥ.	�4ѢW!첌T
+J�VQ�+Z�)�^HȜ�A8n�:�d�<�ۈ]+n�?��6������~꣰�Q�i�Z��C!
���F�¸��������J��
ޝqO��>��P76os�����A:�e
�������
iF.eȹKҗ���d)w��lZ��y�)����H%p�$L�k�J�5��'QHi(�l��~5I�4~��|�o��~������b;����ĵ�[z�`>LJ!��⅍#�I˴�����no��.n�}���aA�bQ��)Wvwj�3��j+�\;��W�����N�W>j�p�Zz�l���[Y��y�8=���~Zn �ϒJ4��F��e3�� 9�x���m/!q����z�� g�?�M&B�t�"n
}�J�3$�ӈ��7tl�o�
�'?�e��6�
Am���+�� ��
+Bų7�GN��zJHD?�@2t�g1�WH�}#+��ae��5$�K�TͨOQ6B�rZy�~��������볰�2i&+�Mȅ،>��km
\���70^�>�0n&sb�HA����P�[3���5�ʿwr�.��k���XY+"�Kn'Q��Ӵ6�9�l��k�m�18F
2_���`A���n!D����e@�%J���
�&�lD�eG�Oa�2�X�K���_jz�ۿ1�L���ӳ�=/M��V��w��
J����7VC �s<ѐ,(/@�S���"\�����6G���V���3P�9�/�H
�#*�N��
9k��,�?��xO�]�UBI
	fwh
2w��什1�4�jU0˞��e�3�z�.H(�D�R�F?���
+�*n�9"��W�r'�Fw�V���t���@1�HKܸN@?�tO��N?9'CQ¾������-� pt�F)��y
�
[�k��r��ϣx��'���g��V�#�3�o�
9<O[;�Q��b�.cfqVl<�Ӓ(��2��
���Q�{��ﺒ(7w$�(��q��#6��!�A��P�N+���ǟ)�`��X|Ώ
s�;s}O��͙��5����y�
����G � $��I�K;�Fb�v4E�p����g&�'����t�\��s�G+���
p!��}�W0p
�<�w�61%���,&�ɦ�
Ⱥ�g���;NV0x�" ��<����o�(�[�$d
p�E.�����o~&j�g��l�B'͖ ��w�O�i��<�� �q�KԒ/�Ư��,w�D{�da�7"�V⣠6릳OɞX�o�k	
�<l��ϩ�N)�Vq��h�Q?��:_�
+endstream
+endobj
+3438 0 obj <<
+/Type /FontDescriptor
+/FontName /RCLMIL+NimbusRomNo9L-ReguItal
+/Flags 4
+/FontBBox [-169 -270 1010 924]
+/Ascent 669
+/CapHeight 669
+/Descent -193
+/ItalicAngle -15
+/StemV 78
+/XHeight 441
+/CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/R/S/T/U/V/W/Z/a/b/c/colon/comma/d/e/f/fi/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero)
+/FontFile 3437 0 R
+>> endobj
+3371 0 obj <<
+/Type /Encoding
+/Differences [2/fi/fl 34/quotedbl 37/percent/ampersand/quoteright/parenleft/parenright/asterisk/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon 61/equal 64/at/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/bracketleft 93/bracketright 95/underscore/quoteleft/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z 147/quotedblleft/quotedblright/bullet/endash 169/copyright]
+>> endobj
+1209 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /LBWBDW+CMEX10
+/FontDescriptor 3388 0 R
+/FirstChar 80
+/LastChar 80
+/Widths 3368 0 R
+>> endobj
+395 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /EFRBIB+CMMI10
+/FontDescriptor 3390 0 R
+/FirstChar 46
+/LastChar 120
+/Widths 3379 0 R
+>> endobj
+1036 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /ZGGNQH+CMMI12
+/FontDescriptor 3392 0 R
+/FirstChar 60
+/LastChar 62
+/Widths 3374 0 R
+>> endobj
+1792 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /OMWOOP+CMMI6
+/FontDescriptor 3394 0 R
+/FirstChar 100
+/LastChar 117
+/Widths 3364 0 R
+>> endobj
+1210 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /PPNWOF+CMMI7
+/FontDescriptor 3396 0 R
+/FirstChar 100
+/LastChar 117
+/Widths 3367 0 R
+>> endobj
+2574 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /DGLWIM+CMMI9
+/FontDescriptor 3398 0 R
+/FirstChar 46
+/LastChar 120
+/Widths 3361 0 R
+>> endobj
+448 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /GYIKAE+CMR10
+/FontDescriptor 3400 0 R
+/FirstChar 40
+/LastChar 118
+/Widths 3376 0 R
+>> endobj
+2572 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UVIORO+CMR6
+/FontDescriptor 3402 0 R
+/FirstChar 97
+/LastChar 120
+/Widths 3363 0 R
+>> endobj
+1212 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /VWYYIV+CMR7
+/FontDescriptor 3404 0 R
+/FirstChar 48
+/LastChar 120
+/Widths 3365 0 R
+>> endobj
+1181 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /EBURFX+CMR9
+/FontDescriptor 3406 0 R
+/FirstChar 40
+/LastChar 118
+/Widths 3369 0 R
+>> endobj
+309 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /HQMTAG+CMSY10
+/FontDescriptor 3408 0 R
+/FirstChar 0
+/LastChar 54
+/Widths 3385 0 R
+>> endobj
+311 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /VYEUCT+CMSY6
+/FontDescriptor 3410 0 R
+/FirstChar 3
+/LastChar 123
+/Widths 3383 0 R
+>> endobj
+1211 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /ZQLTBN+CMSY7
+/FontDescriptor 3412 0 R
+/FirstChar 0
+/LastChar 48
+/Widths 3366 0 R
+>> endobj
+310 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /DFVRAV+CMSY8
+/FontDescriptor 3414 0 R
+/FirstChar 120
+/LastChar 123
+/Widths 3384 0 R
+>> endobj
+2573 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /JZJKNN+CMSY9
+/FontDescriptor 3416 0 R
+/FirstChar 6
+/LastChar 50
+/Widths 3362 0 R
+>> endobj
+1180 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /YGAXLK+CMTT9
+/FontDescriptor 3418 0 R
+/FirstChar 49
+/LastChar 109
+/Widths 3370 0 R
+>> endobj
+2678 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /OAKMXN+MSBM10
+/FontDescriptor 3420 0 R
+/FirstChar 81
+/LastChar 81
+/Widths 3360 0 R
+>> endobj
+334 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /OLGIQR+NimbusMonL-Regu
+/FontDescriptor 3422 0 R
+/FirstChar 34
+/LastChar 122
+/Widths 3380 0 R
+/Encoding 3371 0 R
+>> endobj
+520 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /PKMHPR+NimbusMonL-ReguObli
+/FontDescriptor 3424 0 R
+/FirstChar 39
+/LastChar 121
+/Widths 3375 0 R
+/Encoding 3371 0 R
+>> endobj
+436 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /HHESAH+NimbusSanL-BoldCond
+/FontDescriptor 3426 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 3378 0 R
+/Encoding 3371 0 R
+>> endobj
+1102 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /HJFXOA+NimbusSanL-BoldCondItal
+/FontDescriptor 3428 0 R
+/FirstChar 2
+/LastChar 121
+/Widths 3372 0 R
+/Encoding 3371 0 R
+>> endobj
+308 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /XJRPHX+NimbusSanL-Regu
+/FontDescriptor 3430 0 R
+/FirstChar 39
+/LastChar 121
+/Widths 3386 0 R
+/Encoding 3371 0 R
+>> endobj
+332 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UGGNXB+NimbusRomNo9L-Medi
+/FontDescriptor 3432 0 R
+/FirstChar 2
+/LastChar 150
+/Widths 3381 0 R
+/Encoding 3371 0 R
+>> endobj
+1094 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /JRLFVU+NimbusRomNo9L-MediItal
+/FontDescriptor 3434 0 R
+/FirstChar 97
+/LastChar 121
+/Widths 3373 0 R
+/Encoding 3371 0 R
+>> endobj
+312 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /UALYPC+NimbusRomNo9L-Regu
+/FontDescriptor 3436 0 R
+/FirstChar 2
+/LastChar 169
+/Widths 3382 0 R
+/Encoding 3371 0 R
+>> endobj
+438 0 obj <<
+/Type /Font
+/Subtype /Type1
+/BaseFont /RCLMIL+NimbusRomNo9L-ReguItal
+/FontDescriptor 3438 0 R
+/FirstChar 2
+/LastChar 122
+/Widths 3377 0 R
+/Encoding 3371 0 R
+>> endobj
+313 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3439 0 R
+/Kids [302 0 R 317 0 R 329 0 R 342 0 R 392 0 R 428 0 R]
+>> endobj
+440 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3439 0 R
+/Kids [434 0 R 446 0 R 455 0 R 461 0 R 467 0 R 475 0 R]
+>> endobj
+485 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3439 0 R
+/Kids [481 0 R 488 0 R 496 0 R 503 0 R 515 0 R 523 0 R]
+>> endobj
+532 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3439 0 R
+/Kids [529 0 R 535 0 R 540 0 R 546 0 R 563 0 R 597 0 R]
+>> endobj
+633 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3439 0 R
+/Kids [630 0 R 676 0 R 738 0 R 799 0 R 845 0 R 877 0 R]
+>> endobj
+906 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3439 0 R
+/Kids [901 0 R 934 0 R 964 0 R 988 0 R 1005 0 R 1024 0 R]
+>> endobj
+1063 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3440 0 R
+/Kids [1053 0 R 1090 0 R 1111 0 R 1136 0 R 1171 0 R 1205 0 R]
+>> endobj
+1246 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3440 0 R
+/Kids [1233 0 R 1255 0 R 1290 0 R 1312 0 R 1334 0 R 1369 0 R]
+>> endobj
+1402 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3440 0 R
+/Kids [1389 0 R 1413 0 R 1428 0 R 1445 0 R 1486 0 R 1513 0 R]
+>> endobj
+1560 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3440 0 R
+/Kids [1548 0 R 1586 0 R 1627 0 R 1663 0 R 1690 0 R 1737 0 R]
+>> endobj
+1801 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3440 0 R
+/Kids [1787 0 R 1818 0 R 1836 0 R 1859 0 R 1884 0 R 1901 0 R]
+>> endobj
+1941 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3440 0 R
+/Kids [1930 0 R 1955 0 R 1977 0 R 1998 0 R 2019 0 R 2070 0 R]
+>> endobj
+2121 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3441 0 R
+/Kids [2110 0 R 2131 0 R 2143 0 R 2166 0 R 2185 0 R 2201 0 R]
+>> endobj
+2250 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3441 0 R
+/Kids [2238 0 R 2282 0 R 2313 0 R 2345 0 R 2371 0 R 2410 0 R]
+>> endobj
+2493 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3441 0 R
+/Kids [2484 0 R 2568 0 R 2640 0 R 2675 0 R 2698 0 R 2717 0 R]
+>> endobj
+2757 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3441 0 R
+/Kids [2737 0 R 2763 0 R 2786 0 R 2813 0 R 2836 0 R 2858 0 R]
+>> endobj
+2897 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3441 0 R
+/Kids [2881 0 R 2905 0 R 2931 0 R 2955 0 R 2976 0 R 2997 0 R]
+>> endobj
+3035 0 obj <<
+/Type /Pages
+/Count 6
+/Parent 3441 0 R
+/Kids [3021 0 R 3045 0 R 3067 0 R 3128 0 R 3202 0 R 3302 0 R]
+>> endobj
+3359 0 obj <<
+/Type /Pages
+/Count 1
+/Parent 3442 0 R
+/Kids [3356 0 R]
+>> endobj
+3439 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 3443 0 R
+/Kids [313 0 R 440 0 R 485 0 R 532 0 R 633 0 R 906 0 R]
+>> endobj
+3440 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 3443 0 R
+/Kids [1063 0 R 1246 0 R 1402 0 R 1560 0 R 1801 0 R 1941 0 R]
+>> endobj
+3441 0 obj <<
+/Type /Pages
+/Count 36
+/Parent 3443 0 R
+/Kids [2121 0 R 2250 0 R 2493 0 R 2757 0 R 2897 0 R 3035 0 R]
+>> endobj
+3442 0 obj <<
+/Type /Pages
+/Count 1
+/Parent 3443 0 R
+/Kids [3359 0 R]
+>> endobj
+3443 0 obj <<
+/Type /Pages
+/Count 109
+/Kids [3439 0 R 3440 0 R 3441 0 R 3442 0 R]
+>> endobj
+3444 0 obj <<
+/Type /Outlines
+/First 3 0 R
+/Last 299 0 R
+/Count 11
+>> endobj
+299 0 obj <<
+/Title 300 0 R
+/A 297 0 R
+/Parent 3444 0 R
+/Prev 63 0 R
+>> endobj
+295 0 obj <<
+/Title 296 0 R
+/A 293 0 R
+/Parent 63 0 R
+/Prev 291 0 R
+>> endobj
+291 0 obj <<
+/Title 292 0 R
+/A 289 0 R
+/Parent 63 0 R
+/Prev 287 0 R
+/Next 295 0 R
+>> endobj
+287 0 obj <<
+/Title 288 0 R
+/A 285 0 R
+/Parent 63 0 R
+/Prev 283 0 R
+/Next 291 0 R
+>> endobj
+283 0 obj <<
+/Title 284 0 R
+/A 281 0 R
+/Parent 63 0 R
+/Prev 279 0 R
+/Next 287 0 R
+>> endobj
+279 0 obj <<
+/Title 280 0 R
+/A 277 0 R
+/Parent 63 0 R
+/Prev 275 0 R
+/Next 283 0 R
+>> endobj
+275 0 obj <<
+/Title 276 0 R
+/A 273 0 R
+/Parent 63 0 R
+/Prev 271 0 R
+/Next 279 0 R
+>> endobj
+271 0 obj <<
+/Title 272 0 R
+/A 269 0 R
+/Parent 63 0 R
+/Prev 267 0 R
+/Next 275 0 R
+>> endobj
+267 0 obj <<
+/Title 268 0 R
+/A 265 0 R
+/Parent 63 0 R
+/Prev 263 0 R
+/Next 271 0 R
+>> endobj
+263 0 obj <<
+/Title 264 0 R
+/A 261 0 R
+/Parent 63 0 R
+/Prev 259 0 R
+/Next 267 0 R
+>> endobj
+259 0 obj <<
+/Title 260 0 R
+/A 257 0 R
+/Parent 63 0 R
+/Prev 255 0 R
+/Next 263 0 R
+>> endobj
+255 0 obj <<
+/Title 256 0 R
+/A 253 0 R
+/Parent 63 0 R
+/Prev 251 0 R
+/Next 259 0 R
+>> endobj
+251 0 obj <<
+/Title 252 0 R
+/A 249 0 R
+/Parent 63 0 R
+/Prev 247 0 R
+/Next 255 0 R
+>> endobj
+247 0 obj <<
+/Title 248 0 R
+/A 245 0 R
+/Parent 63 0 R
+/Prev 243 0 R
+/Next 251 0 R
+>> endobj
+243 0 obj <<
+/Title 244 0 R
+/A 241 0 R
+/Parent 63 0 R
+/Prev 239 0 R
+/Next 247 0 R
+>> endobj
+239 0 obj <<
+/Title 240 0 R
+/A 237 0 R
+/Parent 63 0 R
+/Prev 235 0 R
+/Next 243 0 R
+>> endobj
+235 0 obj <<
+/Title 236 0 R
+/A 233 0 R
+/Parent 63 0 R
+/Prev 231 0 R
+/Next 239 0 R
+>> endobj
+231 0 obj <<
+/Title 232 0 R
+/A 229 0 R
+/Parent 63 0 R
+/Prev 227 0 R
+/Next 235 0 R
+>> endobj
+227 0 obj <<
+/Title 228 0 R
+/A 225 0 R
+/Parent 63 0 R
+/Prev 223 0 R
+/Next 231 0 R
+>> endobj
+223 0 obj <<
+/Title 224 0 R
+/A 221 0 R
+/Parent 63 0 R
+/Prev 219 0 R
+/Next 227 0 R
+>> endobj
+219 0 obj <<
+/Title 220 0 R
+/A 217 0 R
+/Parent 63 0 R
+/Prev 215 0 R
+/Next 223 0 R
+>> endobj
+215 0 obj <<
+/Title 216 0 R
+/A 213 0 R
+/Parent 63 0 R
+/Prev 211 0 R
+/Next 219 0 R
+>> endobj
+211 0 obj <<
+/Title 212 0 R
+/A 209 0 R
+/Parent 63 0 R
+/Prev 207 0 R
+/Next 215 0 R
+>> endobj
+207 0 obj <<
+/Title 208 0 R
+/A 205 0 R
+/Parent 63 0 R
+/Prev 203 0 R
+/Next 211 0 R
+>> endobj
+203 0 obj <<
+/Title 204 0 R
+/A 201 0 R
+/Parent 63 0 R
+/Prev 199 0 R
+/Next 207 0 R
+>> endobj
+199 0 obj <<
+/Title 200 0 R
+/A 197 0 R
+/Parent 63 0 R
+/Prev 195 0 R
+/Next 203 0 R
+>> endobj
+195 0 obj <<
+/Title 196 0 R
+/A 193 0 R
+/Parent 63 0 R
+/Prev 191 0 R
+/Next 199 0 R
+>> endobj
+191 0 obj <<
+/Title 192 0 R
+/A 189 0 R
+/Parent 63 0 R
+/Prev 187 0 R
+/Next 195 0 R
+>> endobj
+187 0 obj <<
+/Title 188 0 R
+/A 185 0 R
+/Parent 63 0 R
+/Prev 183 0 R
+/Next 191 0 R
+>> endobj
+183 0 obj <<
+/Title 184 0 R
+/A 181 0 R
+/Parent 63 0 R
+/Prev 179 0 R
+/Next 187 0 R
+>> endobj
+179 0 obj <<
+/Title 180 0 R
+/A 177 0 R
+/Parent 63 0 R
+/Prev 175 0 R
+/Next 183 0 R
+>> endobj
+175 0 obj <<
+/Title 176 0 R
+/A 173 0 R
+/Parent 63 0 R
+/Prev 171 0 R
+/Next 179 0 R
+>> endobj
+171 0 obj <<
+/Title 172 0 R
+/A 169 0 R
+/Parent 63 0 R
+/Prev 167 0 R
+/Next 175 0 R
+>> endobj
+167 0 obj <<
+/Title 168 0 R
+/A 165 0 R
+/Parent 63 0 R
+/Prev 163 0 R
+/Next 171 0 R
+>> endobj
+163 0 obj <<
+/Title 164 0 R
+/A 161 0 R
+/Parent 63 0 R
+/Prev 159 0 R
+/Next 167 0 R
+>> endobj
+159 0 obj <<
+/Title 160 0 R
+/A 157 0 R
+/Parent 63 0 R
+/Prev 155 0 R
+/Next 163 0 R
+>> endobj
+155 0 obj <<
+/Title 156 0 R
+/A 153 0 R
+/Parent 63 0 R
+/Prev 151 0 R
+/Next 159 0 R
+>> endobj
+151 0 obj <<
+/Title 152 0 R
+/A 149 0 R
+/Parent 63 0 R
+/Prev 147 0 R
+/Next 155 0 R
+>> endobj
+147 0 obj <<
+/Title 148 0 R
+/A 145 0 R
+/Parent 63 0 R
+/Prev 143 0 R
+/Next 151 0 R
+>> endobj
+143 0 obj <<
+/Title 144 0 R
+/A 141 0 R
+/Parent 63 0 R
+/Prev 139 0 R
+/Next 147 0 R
+>> endobj
+139 0 obj <<
+/Title 140 0 R
+/A 137 0 R
+/Parent 63 0 R
+/Prev 135 0 R
+/Next 143 0 R
+>> endobj
+135 0 obj <<
+/Title 136 0 R
+/A 133 0 R
+/Parent 63 0 R
+/Prev 131 0 R
+/Next 139 0 R
+>> endobj
+131 0 obj <<
+/Title 132 0 R
+/A 129 0 R
+/Parent 63 0 R
+/Prev 127 0 R
+/Next 135 0 R
+>> endobj
+127 0 obj <<
+/Title 128 0 R
+/A 125 0 R
+/Parent 63 0 R
+/Prev 123 0 R
+/Next 131 0 R
+>> endobj
+123 0 obj <<
+/Title 124 0 R
+/A 121 0 R
+/Parent 63 0 R
+/Prev 119 0 R
+/Next 127 0 R
+>> endobj
+119 0 obj <<
+/Title 120 0 R
+/A 117 0 R
+/Parent 63 0 R
+/Prev 115 0 R
+/Next 123 0 R
+>> endobj
+115 0 obj <<
+/Title 116 0 R
+/A 113 0 R
+/Parent 63 0 R
+/Prev 111 0 R
+/Next 119 0 R
+>> endobj
+111 0 obj <<
+/Title 112 0 R
+/A 109 0 R
+/Parent 63 0 R
+/Prev 107 0 R
+/Next 115 0 R
+>> endobj
+107 0 obj <<
+/Title 108 0 R
+/A 105 0 R
+/Parent 63 0 R
+/Prev 103 0 R
+/Next 111 0 R
+>> endobj
+103 0 obj <<
+/Title 104 0 R
+/A 101 0 R
+/Parent 63 0 R
+/Prev 99 0 R
+/Next 107 0 R
+>> endobj
+99 0 obj <<
+/Title 100 0 R
+/A 97 0 R
+/Parent 63 0 R
+/Prev 95 0 R
+/Next 103 0 R
+>> endobj
+95 0 obj <<
+/Title 96 0 R
+/A 93 0 R
+/Parent 63 0 R
+/Prev 91 0 R
+/Next 99 0 R
+>> endobj
+91 0 obj <<
+/Title 92 0 R
+/A 89 0 R
+/Parent 63 0 R
+/Prev 87 0 R
+/Next 95 0 R
+>> endobj
+87 0 obj <<
+/Title 88 0 R
+/A 85 0 R
+/Parent 63 0 R
+/Prev 83 0 R
+/Next 91 0 R
+>> endobj
+83 0 obj <<
+/Title 84 0 R
+/A 81 0 R
+/Parent 63 0 R
+/Prev 79 0 R
+/Next 87 0 R
+>> endobj
+79 0 obj <<
+/Title 80 0 R
+/A 77 0 R
+/Parent 63 0 R
+/Prev 75 0 R
+/Next 83 0 R
+>> endobj
+75 0 obj <<
+/Title 76 0 R
+/A 73 0 R
+/Parent 63 0 R
+/Prev 71 0 R
+/Next 79 0 R
+>> endobj
+71 0 obj <<
+/Title 72 0 R
+/A 69 0 R
+/Parent 63 0 R
+/Prev 67 0 R
+/Next 75 0 R
+>> endobj
+67 0 obj <<
+/Title 68 0 R
+/A 65 0 R
+/Parent 63 0 R
+/Next 71 0 R
+>> endobj
+63 0 obj <<
+/Title 64 0 R
+/A 61 0 R
+/Parent 3444 0 R
+/Prev 55 0 R
+/Next 299 0 R
+/First 67 0 R
+/Last 295 0 R
+/Count -58
+>> endobj
+59 0 obj <<
+/Title 60 0 R
+/A 57 0 R
+/Parent 55 0 R
+>> endobj
+55 0 obj <<
+/Title 56 0 R
+/A 53 0 R
+/Parent 3444 0 R
+/Prev 47 0 R
+/Next 63 0 R
+/First 59 0 R
+/Last 59 0 R
+/Count -1
+>> endobj
+51 0 obj <<
+/Title 52 0 R
+/A 49 0 R
+/Parent 47 0 R
+>> endobj
+47 0 obj <<
+/Title 48 0 R
+/A 45 0 R
+/Parent 3444 0 R
+/Prev 39 0 R
+/Next 55 0 R
+/First 51 0 R
+/Last 51 0 R
+/Count -1
+>> endobj
+43 0 obj <<
+/Title 44 0 R
+/A 41 0 R
+/Parent 39 0 R
+>> endobj
+39 0 obj <<
+/Title 40 0 R
+/A 37 0 R
+/Parent 3444 0 R
+/Prev 31 0 R
+/Next 47 0 R
+/First 43 0 R
+/Last 43 0 R
+/Count -1
+>> endobj
+35 0 obj <<
+/Title 36 0 R
+/A 33 0 R
+/Parent 31 0 R
+>> endobj
+31 0 obj <<
+/Title 32 0 R
+/A 29 0 R
+/Parent 3444 0 R
+/Prev 23 0 R
+/Next 39 0 R
+/First 35 0 R
+/Last 35 0 R
+/Count -1
+>> endobj
+27 0 obj <<
+/Title 28 0 R
+/A 25 0 R
+/Parent 23 0 R
+>> endobj
+23 0 obj <<
+/Title 24 0 R
+/A 21 0 R
+/Parent 3444 0 R
+/Prev 15 0 R
+/Next 31 0 R
+/First 27 0 R
+/Last 27 0 R
+/Count -1
+>> endobj
+19 0 obj <<
+/Title 20 0 R
+/A 17 0 R
+/Parent 15 0 R
+>> endobj
+15 0 obj <<
+/Title 16 0 R
+/A 13 0 R
+/Parent 3444 0 R
+/Prev 11 0 R
+/Next 23 0 R
+/First 19 0 R
+/Last 19 0 R
+/Count -1
+>> endobj
+11 0 obj <<
+/Title 12 0 R
+/A 9 0 R
+/Parent 3444 0 R
+/Prev 7 0 R
+/Next 15 0 R
+>> endobj
+7 0 obj <<
+/Title 8 0 R
+/A 5 0 R
+/Parent 3444 0 R
+/Prev 3 0 R
+/Next 11 0 R
+>> endobj
+3 0 obj <<
+/Title 4 0 R
+/A 1 0 R
+/Parent 3444 0 R
+/Next 7 0 R
+>> endobj
+3445 0 obj <<
+/Names [(Doc-Start) 307 0 R (GFDL) 526 0 R (GFDL_GFDL) 339 0 R (GPL) 450 0 R (GPL_GPL) 340 0 R (classparma__polyhedra__library_1_1Artificial__Parameter) 634 0 R]
+/Limits [(Doc-Start) (classparma__polyhedra__library_1_1Artificial__Parameter)]
+>> endobj
+3446 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) 635 0 R (classparma__polyhedra__library_1_1Artificial__Parameter__Sequence_a47b1b172706010e446aa8055c982a857) 1009 0 R (classparma__polyhedra__library_1_1Artificial__Parameter_a1ed95ba05855767fd9fd6bf04f9e9167) 993 0 R (classparma__polyhedra__library_1_1Artificial__Parameter_ac04b78a2c208b111ea763b7bbc01e20a) 996 0 R (classparma__polyhedra__library_1_1Artificial__Parameter_ac1ce31354ecf79ca6c6c819059ec7de6) 997 0 [...]
+/Limits [(classparma__polyhedra__library_1_1Artificial__Parameter__Sequence) (classparma__polyhedra__library_1_1Artificial__Parameter_acac3d9fa21c9924c62f2221831d7b873)]
+>> endobj
+3447 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Artificial__Parameter_ae44414ac09129205a7f718517caca304) 994 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4) 682 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_a8be0080275e869b6858313f3ce58879e) 1058 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ac0b40b5fd7fce9c2e70001fe21b04ecd) 1057 0 R (classparma__polyhedra__library_1_1By__Reference_3_01T_01_4_ad3af2e55a3f9bb1410625b2f98a371e1) 1059 0 R (cl [...]
+/Limits [(classparma__polyhedra__library_1_1Artificial__Parameter_ae44414ac09129205a7f718517caca304) (classparma__polyhedra__library_1_1C__Polyhedron)]
+>> endobj
+3448 0 obj <<
+/Names [(classparma__polyhedra__library_1_1C__Polyhedron_a0a28bc5d3066a6ffe552a90aa688fe46) 1103 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a2cd3747157a618a88e2c95bc45451f12) 1098 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a4980562fb3e164d31f6a0ce66b638ce3) 1093 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a5431caa9e7f5c824e9a6ac2e6d69fd87) 1074 0 R (classparma__polyhedra__library_1_1C__Polyhedron_a6eb50dda90cfae549d191f5124f2562d) 1095 0 R (classparma__polyhe [...]
+/Limits [(classparma__polyhedra__library_1_1C__Polyhedron_a0a28bc5d3066a6ffe552a90aa688fe46) (classparma__polyhedra__library_1_1C__Polyhedron_a848091b71fff6f0085950e64b6479e4a)]
+>> endobj
+3449 0 obj <<
+/Names [(classparma__polyhedra__library_1_1C__Polyhedron_a922faaab6e2cb023231b56b049bca0f4) 1104 0 R (classparma__polyhedra__library_1_1C__Polyhedron_aba7be77030b5b01a9e1049ce41bbfa77) 1073 0 R (classparma__polyhedra__library_1_1C__Polyhedron_ad4fd0a018fd96e10fddd740337f60ebd) 1062 0 R (classparma__polyhedra__library_1_1C__Polyhedron_ad51277b918f8fc2a6892b1a987f8f746) 1107 0 R (classparma__polyhedra__library_1_1C__Polyhedron_ae6b00d1beeeae893cca2817406d0039a) 1072 0 R (classparma__polyhe [...]
+/Limits [(classparma__polyhedra__library_1_1C__Polyhedron_a922faaab6e2cb023231b56b049bca0f4) (classparma__polyhedra__library_1_1C__Polyhedron_af495c3499ed2742d6b68bc6bc99224d7)]
+>> endobj
+3450 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Coefficient) 684 0 R (classparma__polyhedra__library_1_1Coefficient_a1ef0c686ebed5c06b004a0799f3b1599) 1150 0 R (classparma__polyhedra__library_1_1Coefficient_a22380e8edd12a8121b5af6a60eb05da2) 1140 0 R (classparma__polyhedra__library_1_1Coefficient_a27e2ee6c6e6f960cc523a3366249f5f9) 1141 0 R (classparma__polyhedra__library_1_1Coefficient_a2b3404ee14fc16f5592bb10a1a4bdd7e) 1147 0 R (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb1 [...]
+/Limits [(classparma__polyhedra__library_1_1Coefficient) (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb12fac766004b358c5)]
+>> endobj
+3451 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) 1144 0 R (classparma__polyhedra__library_1_1Coefficient_aebff23eb304cef5bcd9ac11ee5d7c7ed) 1145 0 R (classparma__polyhedra__library_1_1Coefficient_afd68df98e748af269b3588ca5504bb1d) 1143 0 R (classparma__polyhedra__library_1_1Congruence) 686 0 R (classparma__polyhedra__library_1_1Congruence__System) 687 0 R (classparma__polyhedra__library_1_1Congruence__System_a559e1395399115eb381a421c8916eb1d) 1215 0 R]
+/Limits [(classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) (classparma__polyhedra__library_1_1Congruence__System_a559e1395399115eb381a421c8916eb1d)]
+>> endobj
+3452 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Congruence__System_a6efa775d8084cb3611b1b6b512dc2827) 1216 0 R (classparma__polyhedra__library_1_1Congruence__System_ae287421ae1ceab78c861efb2803c1edb) 1214 0 R (classparma__polyhedra__library_1_1Congruence_a3c4dfe2a773355c5842dbe133a7c974e) 1183 0 R (classparma__polyhedra__library_1_1Congruence_a6f45bd1aa87e7b459ee0d93a65ff05db) 1188 0 R (classparma__polyhedra__library_1_1Congruence_a894f888629036722adcbc81268cab48a) 1184 0 R (classparma__polyh [...]
+/Limits [(classparma__polyhedra__library_1_1Congruence__System_a6efa775d8084cb3611b1b6b512dc2827) (classparma__polyhedra__library_1_1Congruence_a90cc7704ce2f0ee6c205bfa3877a7671)]
+>> endobj
+3453 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Congruence_adf1055ffa2127b453280f5491cb15ffb) 1179 0 R (classparma__polyhedra__library_1_1Congruence_af0873d79c213b1552008ea16229b58e5) 1186 0 R (classparma__polyhedra__library_1_1Congruence_af6656a7b76ac03bbfccba848d6a42dc2) 1185 0 R (classparma__polyhedra__library_1_1Constraint) 688 0 R (classparma__polyhedra__library_1_1Constraint__System) 452 0 R (classparma__polyhedra__library_1_1Constraint__System_a172718f103bd4533e3971e8e69f9f60c) 1244 0 R]
+/Limits [(classparma__polyhedra__library_1_1Congruence_adf1055ffa2127b453280f5491cb15ffb) (classparma__polyhedra__library_1_1Constraint__System_a172718f103bd4533e3971e8e69f9f60c)]
+>> endobj
+3454 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Constraint__System_a67b38d56d0f11bda997b393e7b5d7c5f) 1243 0 R (classparma__polyhedra__library_1_1Constraint__System_ace9427756858d751136f1e72309b9be0) 1242 0 R (classparma__polyhedra__library_1_1Constraint_a19ca194f097ddf860d1ad80961a5eda2) 1237 0 R (classparma__polyhedra__library_1_1Constraint_a2531a33c20c3cb27ea7fcf0a04339c2e) 1219 0 R (classparma__polyhedra__library_1_1Constraint_a5b54a0e76432b52a2259a02f31fc0b83) 1236 0 R (classparma__polyh [...]
+/Limits [(classparma__polyhedra__library_1_1Constraint__System_a67b38d56d0f11bda997b393e7b5d7c5f) (classparma__polyhedra__library_1_1Constraint_a6062c78f7cefbc808b99f35b72fcda8a)]
+>> endobj
+3455 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Constraint_a9fb052eb3479e107bde4cfd95599c787) 1220 0 R (classparma__polyhedra__library_1_1Constraint_abd74986494a6e574bb0499b3b7109379) 1238 0 R (classparma__polyhedra__library_1_1Domain__Error__Exception) 692 0 R (classparma__polyhedra__library_1_1Domain__Error__Exception_a18ac064d1fafb42b385e6b942df648f0) 1295 0 R (classparma__polyhedra__library_1_1Generator) 693 0 R (classparma__polyhedra__library_1_1Generator__System) 694 0 R]
+/Limits [(classparma__polyhedra__library_1_1Constraint_a9fb052eb3479e107bde4cfd95599c787) (classparma__polyhedra__library_1_1Generator__System)]
+>> endobj
+3456 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Generator__System_a379e7fec2e73df8beb7904b85d7645df) 1343 0 R (classparma__polyhedra__library_1_1Generator__System_a62ca7c2995414638d139847539631598) 1342 0 R (classparma__polyhedra__library_1_1Generator__System_ab8be81becce1bc803566f5b19e366799) 1341 0 R (classparma__polyhedra__library_1_1Generator_a3c40a54218985599831d143c5bb5972f) 1303 0 R (classparma__polyhedra__library_1_1Generator_a67b795731a54c5c3b470d44e10806ac5) 1300 0 R (classparma__po [...]
+/Limits [(classparma__polyhedra__library_1_1Generator__System_a379e7fec2e73df8beb7904b85d7645df) (classparma__polyhedra__library_1_1Generator_a6c93053ad6b6bbcaa9aee01b646bba06)]
+>> endobj
+3457 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) 1298 0 R (classparma__polyhedra__library_1_1Generator_a8fb4edb895a850c5ddf8646b31d92a07) 1324 0 R (classparma__polyhedra__library_1_1Generator_ab67f80234f60baee3584e955d4fa3f0a) 1305 0 R (classparma__polyhedra__library_1_1Generator_ac3e1a9737e2b459e439904f9817f4289) 1321 0 R (classparma__polyhedra__library_1_1Generator_ad2b2c058d1c2dfc8c14144caa50ee91d) 1304 0 R (classparma__polyhedra__library_1_1Gene [...]
+/Limits [(classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) (classparma__polyhedra__library_1_1Generator_ae1acaaf59811107a0571b1f65a41b012)]
+>> endobj
+3458 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Grid__Generator) 696 0 R (classparma__polyhedra__library_1_1Grid__Generator__System) 741 0 R (classparma__polyhedra__library_1_1Grid__Generator__System_a4c7c1b1005912277576320fd650d1e89) 1419 0 R (classparma__polyhedra__library_1_1Grid__Generator__System_a8f448359523682c0623804af48cc2dff) 1418 0 R (classparma__polyhedra__library_1_1Grid__Generator__System_afb407c2937347e7381fed31b31a46e98) 1417 0 R (classparma__polyhedra__library_1_1Grid__Genera [...]
+/Limits [(classparma__polyhedra__library_1_1Grid__Generator) (classparma__polyhedra__library_1_1Grid__Generator_a147ad6db2e9d13bee7450666cad83d7d)]
+>> endobj
+3459 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Grid__Generator_a45537abba3ff2661633cb4033fe15e0b) 1385 0 R (classparma__polyhedra__library_1_1Grid__Generator_a58e50b5ebd0b0f5b4d5e44690a939e34) 1378 0 R (classparma__polyhedra__library_1_1Grid__Generator_a61e7f56c96825c1dbd9b1753ead625b7) 1384 0 R (classparma__polyhedra__library_1_1Grid__Generator_a7440d17db8648a633c9b77c512bf8f9b) 1381 0 R (classparma__polyhedra__library_1_1Grid__Generator_a8b88040458f91e980a158487b14a359e) 1386 0 R (classpar [...]
+/Limits [(classparma__polyhedra__library_1_1Grid__Generator_a45537abba3ff2661633cb4033fe15e0b) (classparma__polyhedra__library_1_1Grid__Generator_ab557b1ec4f75e98b5b4155b932d7a6af)]
+>> endobj
+3460 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Grid__Generator_afb38d7eabfa00c8d068e8cdd4820d46c) 1380 0 R (classparma__polyhedra__library_1_1IO) 744 0 R (classparma__polyhedra__library_1_1IO_aedad05516ed695dabfa4fed118d41145) 1437 0 R (classparma__polyhedra__library_1_1Invalid__Argument__Exception) 743 0 R (classparma__polyhedra__library_1_1Invalid__Argument__Exception_aefc6c6941cd663b4715cc71e446d4fa0) 1432 0 R (classparma__polyhedra__library_1_1Length__Error__Exception) 745 0 R]
+/Limits [(classparma__polyhedra__library_1_1Grid__Generator_afb38d7eabfa00c8d068e8cdd4820d46c) (classparma__polyhedra__library_1_1Length__Error__Exception)]
+>> endobj
+3461 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Length__Error__Exception_a84966c712051f47e1dcee5490d5ca670) 1449 0 R (classparma__polyhedra__library_1_1Linear__Expression) 746 0 R (classparma__polyhedra__library_1_1Linear__Expression__Coefficient) 747 0 R (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a1109f21e2d8d35f3dae8ddc8074dd7cc) 1519 0 R (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_a733941c541eb74a6c925db946b39e46e) 1521 0 R (classparma__polyhe [...]
+/Limits [(classparma__polyhedra__library_1_1Length__Error__Exception_a84966c712051f47e1dcee5490d5ca670) (classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ad6ca74b77c4e7c632ddfdc6ab8f3567a)]
+>> endobj
+3462 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ae2a6394e34e787c14484f3d411e022ff) 1517 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference) 748 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2a702d0e6013ee746e60e4b3c53abfb9) 1555 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_a2e6d73507de036e41aa8e1cfc717835e) 1558 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_aa575e8597c3 [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Coefficient_ae2a6394e34e787c14484f3d411e022ff) (classparma__polyhedra__library_1_1Linear__Expression__Difference_aaaeb914f871ccb4e97fc4fd513364b94)]
+>> endobj
+3463 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) 1553 0 R (classparma__polyhedra__library_1_1Linear__Expression__Difference_af36458b7b549f4494a2554972244867b) 1552 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum) 749 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_a04d7bcdd3d8cd086fa28922403cbeb6e) 1595 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_a1af748b5b83815f826301969cee51712) [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) (classparma__polyhedra__library_1_1Linear__Expression__Sum_a6d0d4f5a1f45dd0c5ccb2abe003bb041)]
+>> endobj
+3464 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression__Sum_a75fb2490197b55a1474aff4ce0022598) 1591 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_aaf17ce2383d125a60b8283addae73c7c) 1596 0 R (classparma__polyhedra__library_1_1Linear__Expression__Sum_acd2297a09c09cc44bf66eaafb90e0d7c) 1592 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times) 750 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_a0e3334c609b7d72493ee150349098048) 1639 0 R  [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Sum_a75fb2490197b55a1474aff4ce0022598) (classparma__polyhedra__library_1_1Linear__Expression__Times_a2a5cc6cf6acdd7c5695af1ef807c40b2)]
+>> endobj
+3465 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression__Times_a84e0592d7a7e218f4c4c782f882f18cc) 1631 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_a8bddb181c1be9d2553b18871ab85e84f) 1633 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_aa37c50d4e586466d66070a61595399ec) 1635 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_abef3573de0c962f79637f379b089b0ad) 1638 0 R (classparma__polyhedra__library_1_1Linear__Expression__Times_ac3 [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Times_a84e0592d7a7e218f4c4c782f882f18cc) (classparma__polyhedra__library_1_1Linear__Expression__Times_aca857d6f0e8cef1c2a2b077cd6a513ef)]
+>> endobj
+3466 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) 751 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0b2d532ef24c4ccd4a4a04907d03f2af) 1667 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a0e57cbf0841e9af58ac2a52e89865a86) 1668 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_a48032da1e7c874083e027a065499bd5b) 1671 0 R (classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus_adb [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Unary__Minus) (classparma__polyhedra__library_1_1Linear__Expression__Variable)]
+>> endobj
+3467 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression__Variable_a5bb6231ba1b0357cce472468fc4733f2) 1696 0 R (classparma__polyhedra__library_1_1Linear__Expression__Variable_a820ba8207751c8764ab6a51eb1183a7c) 1694 0 R (classparma__polyhedra__library_1_1Linear__Expression__Variable_ad6f7c3aef257204c507d0a85539aa987) 1695 0 R (classparma__polyhedra__library_1_1Linear__Expression_a0c6bf4c112511ed41878554ca3c02977) 1490 0 R (classparma__polyhedra__library_1_1Linear__Expression_a2cbe4b9 [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Variable_a5bb6231ba1b0357cce472468fc4733f2) (classparma__polyhedra__library_1_1Linear__Expression_a3a962a357f4260b224518672b80ccdc6)]
+>> endobj
+3468 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Linear__Expression_aa4c34f9b1017a3b44afaa423b832722a) 1491 0 R (classparma__polyhedra__library_1_1Linear__Expression_ab9e90a38fb859d1dbe667efec83743d0) 1497 0 R (classparma__polyhedra__library_1_1Linear__Expression_ac622b43c176dfe1b92260b841192b305) 1494 0 R (classparma__polyhedra__library_1_1Linear__Expression_ad7fba193bb811d3dd21903c3fb5e2428) 1498 0 R (classparma__polyhedra__library_1_1Linear__Expression_aedb7a64c3a6bdff1793482110849e5d9) 149 [...]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression_aa4c34f9b1017a3b44afaa423b832722a) (classparma__polyhedra__library_1_1Linear__Expression_af6431ecb966a6e38dc55e7f4274b31db)]
+>> endobj
+3469 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Logic__Error__Exception) 753 0 R (classparma__polyhedra__library_1_1Logic__Error__Exception_a655c21143c2eb90c64487e6e4dcd140c) 1699 0 R (classparma__polyhedra__library_1_1MIP__Problem) 754 0 R (classparma__polyhedra__library_1_1MIP__Problem_a029ae33c5a3d2e301e08d77744d6b739) 1797 0 R (classparma__polyhedra__library_1_1MIP__Problem_a0a9d6f3a0eb496081b86efbb0ea0a011) 1803 0 R (classparma__polyhedra__library_1_1MIP__Problem_a10856aafcb2ba1f52e5158a [...]
+/Limits [(classparma__polyhedra__library_1_1Logic__Error__Exception) (classparma__polyhedra__library_1_1MIP__Problem_a10856aafcb2ba1f52e5158a96950d32c)]
+>> endobj
+3470 0 obj <<
+/Names [(classparma__polyhedra__library_1_1MIP__Problem_a163804d4b5d0f7361974963ef22f98ee) 1746 0 R (classparma__polyhedra__library_1_1MIP__Problem_a1a9c175a241fd2ea35c88ba74074e695) 1742 0 R (classparma__polyhedra__library_1_1MIP__Problem_a1dc4d783858f3eff8674c04502f4432f) 1793 0 R (classparma__polyhedra__library_1_1MIP__Problem_a259d72e4c1cc8fbf723b463475882c9e) 1743 0 R (classparma__polyhedra__library_1_1MIP__Problem_a3659575ce6ee121e2a2df2c347796fce) 1807 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a163804d4b5d0f7361974963ef22f98ee) (classparma__polyhedra__library_1_1MIP__Problem_a36ac8f2a9f570db98e652d333541ae5c)]
+>> endobj
+3471 0 obj <<
+/Names [(classparma__polyhedra__library_1_1MIP__Problem_a4155cebeafe8bc5e3d7d863e1a24abcb) 1751 0 R (classparma__polyhedra__library_1_1MIP__Problem_a42d572a34bcfa6f75a730215898de8c3) 1796 0 R (classparma__polyhedra__library_1_1MIP__Problem_a4b15258348ad1f31d1857eca9dd9bc68) 1749 0 R (classparma__polyhedra__library_1_1MIP__Problem_a535529376fbabac6dde098be2c0bc9d8) 1805 0 R (classparma__polyhedra__library_1_1MIP__Problem_a68cd1f4ad51eff8dcc8634ae7990b3e8) 1755 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a4155cebeafe8bc5e3d7d863e1a24abcb) (classparma__polyhedra__library_1_1MIP__Problem_a6cace6b1265203d0fff22021fd2a56a2)]
+>> endobj
+3472 0 obj <<
+/Names [(classparma__polyhedra__library_1_1MIP__Problem_a76aa40d264daa4af312ae293615ba3d6) 1798 0 R (classparma__polyhedra__library_1_1MIP__Problem_a77b86c1af3be2ba98179fe26fc5560de) 1753 0 R (classparma__polyhedra__library_1_1MIP__Problem_a81aa24851effbe4fade96c65e7c575d4) 1756 0 R (classparma__polyhedra__library_1_1MIP__Problem_a8c602e835a5fe866cd3d0838c42ac9e3) 1806 0 R (classparma__polyhedra__library_1_1MIP__Problem_a8e5ebed0862d7349443d391cb8aa9ab3) 1810 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a76aa40d264daa4af312ae293615ba3d6) (classparma__polyhedra__library_1_1MIP__Problem_a8eb4ecbc8176c3018d1d742f5abb8115)]
+>> endobj
+3473 0 obj <<
+/Names [(classparma__polyhedra__library_1_1MIP__Problem_a9971c2e55bbf3477c321cb1fed28c430) 1802 0 R (classparma__polyhedra__library_1_1MIP__Problem_abc1363206f93e6778c1e9d136f24c01b) 1747 0 R (classparma__polyhedra__library_1_1MIP__Problem_ae1928da791c8514b7e82e2d750ebdad8) 1752 0 R (classparma__polyhedra__library_1_1MIP__Problem_ae65e48247a4f2477e8c00f5088190bfc) 1794 0 R (classparma__polyhedra__library_1_1MIP__Problem_aed0b5ff233c2092ec5414bcf36747dd5) 1748 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1MIP__Problem_a9971c2e55bbf3477c321cb1fed28c430) (classparma__polyhedra__library_1_1MIP__Problem_af44c1d2698cf0080c2e7cdc4fc2b9634)]
+>> endobj
+3474 0 obj <<
+/Names [(classparma__polyhedra__library_1_1MIP__Problem_af933208cb9b9013073316c1107b3649d) 1804 0 R (classparma__polyhedra__library_1_1MIP__Problem_af95bf704d29d8b91d248d1d437ad703a) 1750 0 R (classparma__polyhedra__library_1_1MIP__Problem_afbd6f23017c162cd460d4b0ac42ae4c8) 1754 0 R (classparma__polyhedra__library_1_1Overflow__Error__Exception) 757 0 R (classparma__polyhedra__library_1_1Overflow__Error__Exception_a3c4ed48495c48bc67b46023bb0b62828) 1908 0 R (classparma__polyhedra__library [...]
+/Limits [(classparma__polyhedra__library_1_1MIP__Problem_af933208cb9b9013073316c1107b3649d) (classparma__polyhedra__library_1_1PIP__Decision__Node)]
+>> endobj
+3475 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) 2024 0 R (classparma__polyhedra__library_1_1PIP__Problem) 804 0 R (classparma__polyhedra__library_1_1PIP__Problem_a01868d21a17d9549b711240123d5b81c) 2086 0 R (classparma__polyhedra__library_1_1PIP__Problem_a28b832ea15d4a33b33f51554b5f54a43) 2080 0 R (classparma__polyhedra__library_1_1PIP__Problem_a29bc2f9d0a2c4c96011fe36312a53e2d) 2123 0 R (classparma__polyhedra__library_1_1PIP__Problem_a373 [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) (classparma__polyhedra__library_1_1PIP__Problem_a373a253b31500ca4f15cf2b22e3b9eea)]
+>> endobj
+3476 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Problem_a42e9887cb1bd2e0914862d448881d047) 2115 0 R (classparma__polyhedra__library_1_1PIP__Problem_a4c79cc34280a10e3ca9d2a2fdb8f52fa) 2076 0 R (classparma__polyhedra__library_1_1PIP__Problem_a5bc4c5bb38b21a01517358b417867797) 2093 0 R (classparma__polyhedra__library_1_1PIP__Problem_a5c952c2540fc4ea96e8aaa1109d6ea0c) 2124 0 R (classparma__polyhedra__library_1_1PIP__Problem_a6adb9a394696d907389f2fabc3d7f643) 2081 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Problem_a42e9887cb1bd2e0914862d448881d047) (classparma__polyhedra__library_1_1PIP__Problem_a77791a65ff33495b86466f4a672cd531)]
+>> endobj
+3477 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Problem_a777f48d40962e0a1f7ddcd691bde154d) 2094 0 R (classparma__polyhedra__library_1_1PIP__Problem_a7a934327db411e24b7c2a073983d2a3e) 2114 0 R (classparma__polyhedra__library_1_1PIP__Problem_a84f5ab2a93289e1436a1ea7ef58fb460) 2084 0 R (classparma__polyhedra__library_1_1PIP__Problem_a89335d3e61d877bf25e41e562bf2fb34) 2082 0 R (classparma__polyhedra__library_1_1PIP__Problem_a8959e3a2e2612143cb56991236663058) 2085 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Problem_a777f48d40962e0a1f7ddcd691bde154d) (classparma__polyhedra__library_1_1PIP__Problem_a9117ebcf4233e25be986d6b67ca78f1d)]
+>> endobj
+3478 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Problem_a925ebc675d3deed289aed0d97dafa81c) 2122 0 R (classparma__polyhedra__library_1_1PIP__Problem_a92ced4994293ff25212f86d55421a48a) 2113 0 R (classparma__polyhedra__library_1_1PIP__Problem_aa86001c9fa5a81f40582bac023132a68) 2083 0 R (classparma__polyhedra__library_1_1PIP__Problem_aaacb839f41a9e7355e1e1e5cc9ad0894) 2089 0 R (classparma__polyhedra__library_1_1PIP__Problem_ab3b703e4e468da3a5f49ad28905527e9) 2117 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Problem_a925ebc675d3deed289aed0d97dafa81c) (classparma__polyhedra__library_1_1PIP__Problem_ab75311edf7727278b2c6621e4cf08986)]
+>> endobj
+3479 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Problem_ac41bfa66bbd6a2c52616ea5d4a6270a0) 2125 0 R (classparma__polyhedra__library_1_1PIP__Problem_ac9e60b83b647eaf62c173ecf3539c536) 2079 0 R (classparma__polyhedra__library_1_1PIP__Problem_ad67204128201f54bc7e543a16e67e951) 2077 0 R (classparma__polyhedra__library_1_1PIP__Problem_ad7ae9489e4e3449bfedbafd36d929f55) 2091 0 R (classparma__polyhedra__library_1_1PIP__Problem_adbae3f77deab71eb8d31dc8e551bdeed) 2090 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Problem_ac41bfa66bbd6a2c52616ea5d4a6270a0) (classparma__polyhedra__library_1_1PIP__Problem_ae2e189679413b6058b03b13fc1b8dcfd)]
+>> endobj
+3480 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Problem_ae7dc52a107e3c90f03801ac327d35589) 2092 0 R (classparma__polyhedra__library_1_1PIP__Problem_aed3b733dc78567027867440a5774e70b) 2088 0 R (classparma__polyhedra__library_1_1PIP__Solution__Node) 808 0 R (classparma__polyhedra__library_1_1PIP__Solution__Node_ab532119425bcb15a8c6063d19f071c3c) 2208 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node) 809 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Problem_ae7dc52a107e3c90f03801ac327d35589) (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93)]
+>> endobj
+3481 0 obj <<
+/Names [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) 2247 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_a7c7056a9fa57d1dd08465dbb8a862b72) 2243 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_a8ad7732b0e38be9e8c42a93bffdedbcb) 2242 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_ac6acd7a5076267b606f39476b3b891e4) 2246 0 R (classparma__polyhedra__library_1_1PIP__Tree__Node_af248bcc6fc4a4dff80fd47032a49b33c) 2245 0 R (classpar [...]
+/Limits [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) (classparma__polyhedra__library_1_1PIP__Tree__Node_afe64e41fa2c3ef17fb78ea3ea4caa89e)]
+>> endobj
+3482 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) 758 0 R (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a0f022d23c55748a9e437e1625149bf5a) 1911 0 R (classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4_a35e4df2723c110fbdadbcde7fe9cfae0) 1912 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library) 441 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a08c3b1c1c4e916f10c85114ac888c040) 1940 0 R (classparma__polyhedra__library_1_1Par [...]
+/Limits [(classparma__polyhedra__library_1_1Pair_3_01K_00_01V_01_4) (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a0c349132b447b3e6a5234a23257f417d)]
+>> endobj
+3483 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a4e5e7fc32bfd0ae986d63ec82db62f6a) 1943 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a5223af806da56cfe9a7c6ed71b4a0604) 1969 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a65283b563ec02a47928cc176c738f78b) 1942 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a6b7d95f94c10fe3747eff2a3e05f9d32) 1936 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a7a [...]
+/Limits [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a4e5e7fc32bfd0ae986d63ec82db62f6a) (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a805ae2717e65749d104d71978ed97fa4)]
+>> endobj
+3484 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) 1959 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8876ac784666f054f546f48404cb27a) 1938 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_aa8ff36c02349f02bdf1d374823cb4590) 1958 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ab6bcd066e77a3dde5c6127ac6dfabfa7) 1939 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ac5 [...]
+/Limits [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_a903afb11ccb24f752fc0bf2b430b16c2) (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_ae763a3d0db8c57898dff5ba199ea87e5)]
+>> endobj
+3485 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_af46aeb04c5a5a83a60ddf1a280c8b648) 1947 0 R (classparma__polyhedra__library_1_1Parma__Polyhedra__Library_afb7d3612f1ec7e7432a4168ea245f0f9) 1968 0 R (classparma__polyhedra__library_1_1Partial__Function) 802 0 R (classparma__polyhedra__library_1_1Partial__Function_a054857677ca99c51342e420e9d5bad9f) 2012 0 R (classparma__polyhedra__library_1_1Partial__Function_a0861934c38d4b7e0432b6ba71a40df2d) 2005 0 R (classparma__polyh [...]
+/Limits [(classparma__polyhedra__library_1_1Parma__Polyhedra__Library_af46aeb04c5a5a83a60ddf1a280c8b648) (classparma__polyhedra__library_1_1Partial__Function_a52e000efba75d51e7891f8e9da8e4e1b)]
+>> endobj
+3486 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Partial__Function_a661ab4cd615864ae392638259f9c58da) 2007 0 R (classparma__polyhedra__library_1_1Partial__Function_a940d4cc630004e148b25a81010b12d61) 2002 0 R (classparma__polyhedra__library_1_1Partial__Function_aa348a444933ae006cd061eb2a01af5b7) 2010 0 R (classparma__polyhedra__library_1_1Partial__Function_ab8e3183f9373557491bf9d9cee30548d) 2003 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron) 810 0 R (classparma__polyh [...]
+/Limits [(classparma__polyhedra__library_1_1Partial__Function_a661ab4cd615864ae392638259f9c58da) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator)]
+>> endobj
+3487 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) 2322 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a12e689efd1655b4ec60adc26beb16a65) 2327 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a1b586c1f7e68ef2ad7a47bb83767a32f) 2328 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a22326363cf04596cec471dbe66e03653) 2 [...]
+/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a96c42895c3599ed91e187ea39f94672c)]
+>> endobj
+3488 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_acd3100605be3e85bc68685085a2572ae) 2321 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a20fc9fa06d5e6772b60c0d8c968716a5) 2297 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a3ae906e1904f2ac295800c2da5ad0eb7) 2292 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a49b8e7f8a6b1ed7aaa6e91729323de7e) 2291 0 R (classparma__polyhedra [...]
+/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_acd3100605be3e85bc68685085a2572ae) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a711a61f2016a1a60c7cce6dceb2bb94b)]
+>> endobj
+3489 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a8adda024ba9ada688f17592347ffa4a9) 2295 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_ad8b71c1b523782a16d5ced5b3103bd8c) 2294 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_adf86846ee255deb41ca850ac64c4b61c) 2288 0 R (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_af3095a51638dbd4f5f64ef0abae85829) 2289 0 R (classparma__polyhedra__library_ [...]
+/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron_a8adda024ba9ada688f17592347ffa4a9) (classparma__polyhedra__library_1_1Poly__Con__Relation)]
+>> endobj
+3490 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Poly__Con__Relation_a31e5a38eb5511d477ccd1b793fec470b) 2355 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_a4358da8086e7af078f42a62c817895e3) 2358 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_a44dd34b28b7e0ca0ea892e9259ea7103) 2357 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_ab038d193cd145f2bc59b501db605e320) 2356 0 R (classparma__polyhedra__library_1_1Poly__Con__Relation_adc93ada4ec022b8e6020c91412e0b0ef [...]
+/Limits [(classparma__polyhedra__library_1_1Poly__Con__Relation_a31e5a38eb5511d477ccd1b793fec470b) (classparma__polyhedra__library_1_1Poly__Con__Relation_ae9b4bcc84019980d7be4ace75e54c0b3)]
+>> endobj
+3491 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Poly__Con__Relation_afc62e3c93daf5e744e4b3e450c7c7270) 2359 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation) 813 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation_a29127d8da5f0b833c4a89dbe3d41be27) 2376 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation_a40a81d6ee69dc679f08c5e89a101dfbb) 2379 0 R (classparma__polyhedra__library_1_1Poly__Gen__Relation_adebb1fbe14ec8f0b88fb538b86f0873b) 2380 0 R (classparma__polyhedra__ [...]
+/Limits [(classparma__polyhedra__library_1_1Poly__Con__Relation_afc62e3c93daf5e744e4b3e450c7c7270) (classparma__polyhedra__library_1_1Poly__Gen__Relation_afe2f6db5c7f1a92104fe7efa0c301a45)]
+>> endobj
+3492 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron) 814 0 R (classparma__polyhedra__library_1_1Polyhedron_a00413902e11b669bca9a8c81438202ee) 2658 0 R (classparma__polyhedra__library_1_1Polyhedron_a0e578573084aafbf76c85db7dd1363be) 2651 0 R (classparma__polyhedra__library_1_1Polyhedron_a110353a7864529b85d5465ac1bce2670) 2497 0 R (classparma__polyhedra__library_1_1Polyhedron_a1217cb151cbdbbcf4391987b9e2d232c) 2434 0 R (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron) (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e32932e6ecc)]
+>> endobj
+3493 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) 2595 0 R (classparma__polyhedra__library_1_1Polyhedron_a1b75c266a974976557206ce451e45967) 2591 0 R (classparma__polyhedra__library_1_1Polyhedron_a1e5d8d199e0bcd20aeacd72b2fef10f6) 2505 0 R (classparma__polyhedra__library_1_1Polyhedron_a268b22472143daa3e8f2d0828d1ad565) 2662 0 R (classparma__polyhedra__library_1_1Polyhedron_a284af200f2e06dcfc079a58b3d4d6a59) 2491 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) (classparma__polyhedra__library_1_1Polyhedron_a2b74eef4fc5f2e35ba14f734f0e8e167)]
+>> endobj
+3494 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a34c73f38bc99dbcb38cc7214e1e0e82d) 2419 0 R (classparma__polyhedra__library_1_1Polyhedron_a3527c6d35935d9860c07b31970d6dfc4) 2424 0 R (classparma__polyhedra__library_1_1Polyhedron_a3797a521b54434e13ed2843ebd88a8c1) 2508 0 R (classparma__polyhedra__library_1_1Polyhedron_a3cdef8e8e717e8aae495db38ab2f3555) 2652 0 R (classparma__polyhedra__library_1_1Polyhedron_a3d3179300b5bf2b41a40b5b76650f8e7) 2492 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a34c73f38bc99dbcb38cc7214e1e0e82d) (classparma__polyhedra__library_1_1Polyhedron_a3d6404d09696f8b693b9260d267df2c3)]
+>> endobj
+3495 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a4211b10c19024d7056b4e36e4d2b7cff) 2416 0 R (classparma__polyhedra__library_1_1Polyhedron_a427ee580c9a357d0e154cd2520dbe33a) 2657 0 R (classparma__polyhedra__library_1_1Polyhedron_a4399e57484eec3301f8b88011c53c35b) 2507 0 R (classparma__polyhedra__library_1_1Polyhedron_a501e48144147e2563edc52dcd49503f9) 2589 0 R (classparma__polyhedra__library_1_1Polyhedron_a513cc77545233d96c437ba7e1d001557) 2421 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a4211b10c19024d7056b4e36e4d2b7cff) (classparma__polyhedra__library_1_1Polyhedron_a52ae035a37af93cc3115f3a45f4e032c)]
+>> endobj
+3496 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a56e3a5f9a94fb76a527fedea1bbd83cd) 2645 0 R (classparma__polyhedra__library_1_1Polyhedron_a58869dfc76ca4a5a51e1e130096cfc88) 2692 0 R (classparma__polyhedra__library_1_1Polyhedron_a5955d6b18f4135b382ca0db2479c11ac) 2592 0 R (classparma__polyhedra__library_1_1Polyhedron_a5c577b51724616ef96f58ce0f2fec482) 2488 0 R (classparma__polyhedra__library_1_1Polyhedron_a60ee53b704270f784fad7eab1a542bfd) 2415 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a56e3a5f9a94fb76a527fedea1bbd83cd) (classparma__polyhedra__library_1_1Polyhedron_a62737490fa8ee8763ee2ff8b54847670)]
+>> endobj
+3497 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a66510fe1afe13b5f7334057bc96efa36) 2582 0 R (classparma__polyhedra__library_1_1Polyhedron_a6be74fc6a3ef7d8e1c1939536af2a943) 2583 0 R (classparma__polyhedra__library_1_1Polyhedron_a6c51199902356b837c63915caaab7a40) 2571 0 R (classparma__polyhedra__library_1_1Polyhedron_a6e35f9362b9f7ed65be59ae07f1da622) 2585 0 R (classparma__polyhedra__library_1_1Polyhedron_a701a35ba2b5418869a471932535cf9e5) 2590 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a66510fe1afe13b5f7334057bc96efa36) (classparma__polyhedra__library_1_1Polyhedron_a73a395dac9898b73e0782a47f4537cd7)]
+>> endobj
+3498 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a7ce8a057ee2d4a20b8820da2bb6dc2af) 2425 0 R (classparma__polyhedra__library_1_1Polyhedron_a7e4588dc8f29c46edfb1fa34e6a9d424) 2496 0 R (classparma__polyhedra__library_1_1Polyhedron_a7f35fe17c4c48b15ddb66e52e110c2bd) 2647 0 R (classparma__polyhedra__library_1_1Polyhedron_a812e3b442d41612ca88f8905d6cb49bd) 2414 0 R (classparma__polyhedra__library_1_1Polyhedron_a81715f656d39c399cf4d63b72635194c) 2661 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a7ce8a057ee2d4a20b8820da2bb6dc2af) (classparma__polyhedra__library_1_1Polyhedron_a8561bc8f545197343c8cf1935e794af3)]
+>> endobj
+3499 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) 2655 0 R (classparma__polyhedra__library_1_1Polyhedron_a8a9706372c9b371938f04b68516bb407) 2504 0 R (classparma__polyhedra__library_1_1Polyhedron_a8bf0912e9b611d41ee76da66fd1bd28f) 2690 0 R (classparma__polyhedra__library_1_1Polyhedron_a8f50e6dcc51327c56d99dc964961d6a2) 2498 0 R (classparma__polyhedra__library_1_1Polyhedron_a920814c13d635e9a503551b0988c2958) 2594 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) (classparma__polyhedra__library_1_1Polyhedron_a945f11d66765e2f542f9c4fb654589d2)]
+>> endobj
+3500 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_a950e7082860fadc45452ffe241de4488) 2503 0 R (classparma__polyhedra__library_1_1Polyhedron_a95c109d667deed44698d16eb25efef9d) 2577 0 R (classparma__polyhedra__library_1_1Polyhedron_a99adfdf68b5bee7b3963a15c4183e136) 2588 0 R (classparma__polyhedra__library_1_1Polyhedron_a9a6e20494d2e7c618d4c6aeab45bac30) 2494 0 R (classparma__polyhedra__library_1_1Polyhedron_a9dd3a06d94e54ca59e0c41901d9f9a06) 2643 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a950e7082860fadc45452ffe241de4488) (classparma__polyhedra__library_1_1Polyhedron_a9f1fcbebed65fafcc7439ce24392b59a)]
+>> endobj
+3501 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_aa01e5f8c42361cc03aba32786c4f9e3d) 2578 0 R (classparma__polyhedra__library_1_1Polyhedron_aaec18d4d5bd29cd38e153b4602e027da) 2650 0 R (classparma__polyhedra__library_1_1Polyhedron_ab11bfde2a1ce71a607644a38cb914b13) 2653 0 R (classparma__polyhedra__library_1_1Polyhedron_ab6edbecd120074f2661ed2cd06ce1cd1) 2435 0 R (classparma__polyhedra__library_1_1Polyhedron_ab780403b7f3997c5f5703ea0218c2841) 2487 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_aa01e5f8c42361cc03aba32786c4f9e3d) (classparma__polyhedra__library_1_1Polyhedron_ab8ef27e25132c083ae1b59d3162fa21a)]
+>> endobj
+3502 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_abdf75082ed3ae874de8fa5cb0198e080) 2659 0 R (classparma__polyhedra__library_1_1Polyhedron_abf4b919c3b8d7dd958aab203fcabc4b4) 2490 0 R (classparma__polyhedra__library_1_1Polyhedron_abfd8a93992bbf17101c53d68a44d9986) 2500 0 R (classparma__polyhedra__library_1_1Polyhedron_ac034ebc28209bd38f90ba23323f65c41) 2649 0 R (classparma__polyhedra__library_1_1Polyhedron_ac2e30d8774b244ed1bd206f76e786745) 2423 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_abdf75082ed3ae874de8fa5cb0198e080) (classparma__polyhedra__library_1_1Polyhedron_ac76c332a5b267f6b6bd749cc3b9e192e)]
+>> endobj
+3503 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_acd5b7ab06d657819656175f7d6a0cd0d) 2584 0 R (classparma__polyhedra__library_1_1Polyhedron_acdf10439693c83932d0de9a5cf35b396) 2579 0 R (classparma__polyhedra__library_1_1Polyhedron_ad38a887658485f32f589a57a74e6a78c) 2646 0 R (classparma__polyhedra__library_1_1Polyhedron_ada449a9c1a600893585256666d6fe331) 2648 0 R (classparma__polyhedra__library_1_1Polyhedron_ae17f1279a841b6efc0efa6441878c025) 2417 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_acd5b7ab06d657819656175f7d6a0cd0d) (classparma__polyhedra__library_1_1Polyhedron_ae32bc538fedce99e602767b1065ad599)]
+>> endobj
+3504 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_ae899d1e624241d1328d6c6421f5485e6) 2593 0 R (classparma__polyhedra__library_1_1Polyhedron_aee40105531fe1008562584274189cf35) 2691 0 R (classparma__polyhedra__library_1_1Polyhedron_aef8d1e4a767f5ea79384588d0e19b83c) 2586 0 R (classparma__polyhedra__library_1_1Polyhedron_af04e7f91e1cfaf69dcee2df81c3d64c3) 2580 0 R (classparma__polyhedra__library_1_1Polyhedron_af26aee5944d076192d5f6a12086c28f7) 2581 0 R (classparma__polyhedra__library_1_ [...]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_ae899d1e624241d1328d6c6421f5485e6) (classparma__polyhedra__library_1_1Polyhedron_afba20cade6fa4fcd26b81086a02923e5)]
+>> endobj
+3505 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) 2418 0 R (classparma__polyhedra__library_1_1Polyhedron_afdef7f8fe0ba899b496aaa369780dfda) 2506 0 R (classparma__polyhedra__library_1_1Timeout__Exception) 816 0 R (classparma__polyhedra__library_1_1Timeout__Exception_a66765523c60cdb348393876561c5d0e7) 3034 0 R (classparma__polyhedra__library_1_1Variable) 817 0 R (classparma__polyhedra__library_1_1Variable_a008168f710b00996c0183f79c23031fb) 3055 0 R]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) (classparma__polyhedra__library_1_1Variable_a008168f710b00996c0183f79c23031fb)]
+>> endobj
+3506 0 obj <<
+/Names [(classparma__polyhedra__library_1_1Variable_a515c8c049d322413eade7a3f05721444) 3059 0 R (classparma__polyhedra__library_1_1Variable_a9fb15acabc414c238c79e7c4f211c185) 3050 0 R (classparma__polyhedra__library_1_1Variable_ab54edfb4d01886f38228f56771aa085d) 3051 0 R (classparma__polyhedra__library_1_1Variables__Set) 819 0 R (classparma__polyhedra__library_1_1Variables__Set_aa80c4fa3121e341ac6068c60394eb07d) 3072 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow) [...]
+/Limits [(classparma__polyhedra__library_1_1Variable_a515c8c049d322413eade7a3f05721444) (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow)]
+>> endobj
+3507 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a1834eabb1a60cd21454609bb6af2b70c) 1012 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a20f960ad44478ccbccc6ba807c88ec88) 1013 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation) 680 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Representation_a5989bf59e335673996e366dbea747064) 1028 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width [...]
+/Limits [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Overflow_a1834eabb1a60cd21454609bb6af2b70c) (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a0940a9ce95b204cbc7b0ba075e3802be)]
+>> endobj
+3508 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a239f39386ac001c6c20a50505e8bb671) 1034 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a26d3ec66128ed1a32ecf5905b0beae28) 1032 0 R (enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a6a6f001254ef8c3b3eddb432ca6e9dbe) 1033 0 R (enumparma__polyhedra__library_1_1Complexity__Class) 685 0 R (enumparma__polyhedra__library_1_1Complexity__Class_a00d82d93d2d0113f1ea5b615decb2849) 1176 0 R (en [...]
+/Limits [(enumparma__polyhedra__library_1_1Bounded__Integer__Type__Width_a239f39386ac001c6c20a50505e8bb671) (enumparma__polyhedra__library_1_1Complexity__Class_a5c1b244e9422e1c29c71844a9f896aee)]
+>> endobj
+3509 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Control__Parameter__Name) 689 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Name_a3d873e83cf77a02b55c7d6d6d245ed23) 1259 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value) 690 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value_a7483a53d677492ed42b591525243d243) 1264 0 R (enumparma__polyhedra__library_1_1Control__Parameter__Value_ac1791e52b930ea1fc3863866a26b1a81) 1262 0 R (enumparma__polyhedra__library_1_1Co [...]
+/Limits [(enumparma__polyhedra__library_1_1Control__Parameter__Name) (enumparma__polyhedra__library_1_1Control__Parameter__Value_ad6243026e52cac8f2b4ef458ff4b760f)]
+>> endobj
+3510 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Degenerate__Element) 691 0 R (enumparma__polyhedra__library_1_1Degenerate__Element_a9ff8417659bb4800d825f91fa8685aaf) 1267 0 R (enumparma__polyhedra__library_1_1Generator__Type) 695 0 R (enumparma__polyhedra__library_1_1Generator__Type_a2c6506f69be68e287d31aa3db68d664b) 1375 0 R (enumparma__polyhedra__library_1_1Generator__Type_a3b9f75c49b0c6f00923b8f7d827ca9ad) 1373 0 R (enumparma__polyhedra__library_1_1Generator__Type_aa8aee01f50041535fba84ef39 [...]
+/Limits [(enumparma__polyhedra__library_1_1Degenerate__Element) (enumparma__polyhedra__library_1_1Generator__Type_aa8aee01f50041535fba84ef399e5ee81)]
+>> endobj
+3511 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Grid__Generator__Type) 742 0 R (enumparma__polyhedra__library_1_1Grid__Generator__Type_a02ca1ef23d4c2b965198ea42d9d683a4) 1422 0 R (enumparma__polyhedra__library_1_1Grid__Generator__Type_a1a63d52277531ad7883e6679a90fdc67) 1423 0 R (enumparma__polyhedra__library_1_1MIP__Problem__Status) 755 0 R (enumparma__polyhedra__library_1_1MIP__Problem__Status_a417470c5917175d267ea3ec71df18027) 1893 0 R (enumparma__polyhedra__library_1_1MIP__Problem__Status_a [...]
+/Limits [(enumparma__polyhedra__library_1_1Grid__Generator__Type) (enumparma__polyhedra__library_1_1MIP__Problem__Status_af2bdcebf7178739216e2dc7f5c421c9c)]
+>> endobj
+3512 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Optimization__Mode) 756 0 R (enumparma__polyhedra__library_1_1Optimization__Mode_aed6d879ab6fa6e6dea28b6841058c848) 1905 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name) 805 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_a1676341382601ab9c96f035983f372d5) 2171 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Name_ab5cadae2d9d1e506769cafc7dd19c5b5) 2172 0 R (enumparm [...]
+/Limits [(enumparma__polyhedra__library_1_1Optimization__Mode) (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value)]
+>> endobj
+3513 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a46e366594cc5fa0e10c75a1b6c17df09) 2188 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a7d97a0adb78a51c7089586f7ee4cb6bd) 2176 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abc9126a51dec07227e4919899e44589b) 2177 0 R (enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_abd8921ad9d2cc32e7ee32de63704c1c8) 2189 0 R (enumparma__ [...]
+/Limits [(enumparma__polyhedra__library_1_1PIP__Problem__Control__Parameter__Value_a46e366594cc5fa0e10c75a1b6c17df09) (enumparma__polyhedra__library_1_1PIP__Problem__Status)]
+>> endobj
+3514 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1PIP__Problem__Status_a89f381f0a22cc6f22b445a4c1691db77) 2192 0 R (enumparma__polyhedra__library_1_1Relation__Symbol) 815 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_a95eb0b200e5754f1b18972012c1807d4) 3029 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_aaa76c2fe8629d0c3251374d87a0da4a4) 3027 0 R (enumparma__polyhedra__library_1_1Relation__Symbol_ab6fa928be2e09cfafd92a225199aa362) 3031 0 R (enumparma__polyhedra__library_1_1Relati [...]
+/Limits [(enumparma__polyhedra__library_1_1PIP__Problem__Status_a89f381f0a22cc6f22b445a4c1691db77) (enumparma__polyhedra__library_1_1Relation__Symbol_ac49c86d7db3259a07d9a2b293e573733)]
+>> endobj
+3515 0 obj <<
+/Names [(enumparma__polyhedra__library_1_1Relation__Symbol_ae25095de7466faeb9f7bf4c476f34cf0) 3030 0 R (group__PPL__Java__interface) 848 0 R (index) 437 0 R (interfaceparma__polyhedra__library_1_1Variable__Stringifier) 818 0 R (namespaceparma__polyhedra__library) 566 0 R (page.1) 306 0 R]
+/Limits [(enumparma__polyhedra__library_1_1Relation__Symbol_ae25095de7466faeb9f7bf4c476f34cf0) (page.1)]
+>> endobj
+3516 0 obj <<
+/Names [(page.10) 505 0 R (page.100) 3130 0 R (page.101) 3204 0 R (page.102) 3304 0 R (page.103) 3358 0 R (page.11) 517 0 R]
+/Limits [(page.10) (page.11)]
+>> endobj
+3517 0 obj <<
+/Names [(page.12) 525 0 R (page.13) 531 0 R (page.14) 537 0 R (page.15) 542 0 R (page.16) 548 0 R (page.17) 565 0 R]
+/Limits [(page.12) (page.17)]
+>> endobj
+3518 0 obj <<
+/Names [(page.18) 599 0 R (page.19) 632 0 R (page.2) 319 0 R (page.20) 678 0 R (page.21) 740 0 R (page.22) 801 0 R]
+/Limits [(page.18) (page.22)]
+>> endobj
+3519 0 obj <<
+/Names [(page.23) 847 0 R (page.24) 879 0 R (page.25) 903 0 R (page.26) 936 0 R (page.27) 966 0 R (page.28) 990 0 R]
+/Limits [(page.23) (page.28)]
+>> endobj
+3520 0 obj <<
+/Names [(page.29) 1007 0 R (page.3) 331 0 R (page.30) 1026 0 R (page.31) 1055 0 R (page.32) 1092 0 R (page.33) 1113 0 R]
+/Limits [(page.29) (page.33)]
+>> endobj
+3521 0 obj <<
+/Names [(page.34) 1138 0 R (page.35) 1173 0 R (page.36) 1207 0 R (page.37) 1235 0 R (page.38) 1257 0 R (page.39) 1292 0 R]
+/Limits [(page.34) (page.39)]
+>> endobj
+3522 0 obj <<
+/Names [(page.4) 344 0 R (page.40) 1314 0 R (page.41) 1336 0 R (page.42) 1371 0 R (page.43) 1391 0 R (page.44) 1415 0 R]
+/Limits [(page.4) (page.44)]
+>> endobj
+3523 0 obj <<
+/Names [(page.45) 1430 0 R (page.46) 1447 0 R (page.47) 1488 0 R (page.48) 1515 0 R (page.49) 1550 0 R (page.5) 469 0 R]
+/Limits [(page.45) (page.5)]
+>> endobj
+3524 0 obj <<
+/Names [(page.50) 1588 0 R (page.51) 1629 0 R (page.52) 1665 0 R (page.53) 1692 0 R (page.54) 1739 0 R (page.55) 1789 0 R]
+/Limits [(page.50) (page.55)]
+>> endobj
+3525 0 obj <<
+/Names [(page.56) 1820 0 R (page.57) 1838 0 R (page.58) 1861 0 R (page.59) 1886 0 R (page.6) 477 0 R (page.60) 1903 0 R]
+/Limits [(page.56) (page.60)]
+>> endobj
+3526 0 obj <<
+/Names [(page.61) 1932 0 R (page.62) 1957 0 R (page.63) 1979 0 R (page.64) 2000 0 R (page.65) 2021 0 R (page.66) 2072 0 R]
+/Limits [(page.61) (page.66)]
+>> endobj
+3527 0 obj <<
+/Names [(page.67) 2112 0 R (page.68) 2133 0 R (page.69) 2145 0 R (page.7) 483 0 R (page.70) 2168 0 R (page.71) 2187 0 R]
+/Limits [(page.67) (page.71)]
+>> endobj
+3528 0 obj <<
+/Names [(page.72) 2203 0 R (page.73) 2240 0 R (page.74) 2284 0 R (page.75) 2315 0 R (page.76) 2347 0 R (page.77) 2373 0 R]
+/Limits [(page.72) (page.77)]
+>> endobj
+3529 0 obj <<
+/Names [(page.78) 2412 0 R (page.79) 2486 0 R (page.8) 490 0 R (page.80) 2570 0 R (page.81) 2642 0 R (page.82) 2677 0 R]
+/Limits [(page.78) (page.82)]
+>> endobj
+3530 0 obj <<
+/Names [(page.83) 2700 0 R (page.84) 2719 0 R (page.85) 2739 0 R (page.86) 2765 0 R (page.87) 2788 0 R (page.88) 2815 0 R]
+/Limits [(page.83) (page.88)]
+>> endobj
+3531 0 obj <<
+/Names [(page.89) 2838 0 R (page.9) 498 0 R (page.90) 2860 0 R (page.91) 2883 0 R (page.92) 2907 0 R (page.93) 2933 0 R]
+/Limits [(page.89) (page.93)]
+>> endobj
+3532 0 obj <<
+/Names [(page.94) 2957 0 R (page.95) 2978 0 R (page.96) 2999 0 R (page.97) 3023 0 R (page.98) 3047 0 R (page.99) 3069 0 R]
+/Limits [(page.94) (page.99)]
+>> endobj
+3533 0 obj <<
+/Names [(page.i) 394 0 R (page.ii) 430 0 R (paragraph.10.18.2.1) 1317 0 R (paragraph.10.18.2.2) 1319 0 R (paragraph.10.18.2.3) 1322 0 R (paragraph.10.18.2.4) 1325 0 R]
+/Limits [(page.i) (paragraph.10.18.2.4)]
+>> endobj
+3534 0 obj <<
+/Names [(paragraph.10.18.2.5) 1338 0 R (paragraph.10.21.2.1) 1394 0 R (paragraph.10.21.2.2) 1396 0 R (paragraph.10.21.2.3) 1398 0 R (paragraph.10.21.2.4) 1400 0 R (paragraph.10.25.2.1) 1438 0 R]
+/Limits [(paragraph.10.18.2.5) (paragraph.10.25.2.1)]
+>> endobj
+3535 0 obj <<
+/Names [(paragraph.10.35.2.1) 1822 0 R (paragraph.10.35.2.2) 1825 0 R (paragraph.10.35.3.1) 1842 0 R (paragraph.10.35.3.10) 1873 0 R (paragraph.10.35.3.11) 1888 0 R (paragraph.10.35.3.12) 1890 0 R]
+/Limits [(paragraph.10.35.2.1) (paragraph.10.35.3.12)]
+>> endobj
+3536 0 obj <<
+/Names [(paragraph.10.35.3.2) 1843 0 R (paragraph.10.35.3.3) 1846 0 R (paragraph.10.35.3.4) 1849 0 R (paragraph.10.35.3.5) 1852 0 R (paragraph.10.35.3.6) 1864 0 R (paragraph.10.35.3.7) 1867 0 R]
+/Limits [(paragraph.10.35.3.2) (paragraph.10.35.3.7)]
+>> endobj
+3537 0 obj <<
+/Names [(paragraph.10.35.3.8) 1868 0 R (paragraph.10.35.3.9) 1869 0 R (paragraph.10.40.2.1) 1962 0 R (paragraph.10.40.2.2) 1963 0 R (paragraph.10.40.2.3) 1964 0 R (paragraph.10.40.2.4) 1965 0 R]
+/Limits [(paragraph.10.35.3.8) (paragraph.10.40.2.4)]
+>> endobj
+3538 0 obj <<
+/Names [(paragraph.10.40.2.5) 1967 0 R (paragraph.10.40.2.6) 1980 0 R (paragraph.10.40.2.7) 1981 0 R (paragraph.10.40.2.8) 1984 0 R (paragraph.10.41.2.1) 2011 0 R (paragraph.10.41.2.2) 2022 0 R]
+/Limits [(paragraph.10.40.2.5) (paragraph.10.41.2.2)]
+>> endobj
+3539 0 obj <<
+/Names [(paragraph.10.43.2.1) 2135 0 R (paragraph.10.43.2.2) 2138 0 R (paragraph.10.43.3.1) 2147 0 R (paragraph.10.43.3.2) 2148 0 R (paragraph.10.43.3.3) 2150 0 R (paragraph.10.43.3.4) 2153 0 R]
+/Limits [(paragraph.10.43.2.1) (paragraph.10.43.3.4)]
+>> endobj
+3540 0 obj <<
+/Names [(paragraph.10.43.3.5) 2156 0 R (paragraph.10.43.3.6) 2169 0 R (paragraph.10.47.2.1) 2209 0 R (paragraph.10.48.2.1) 2286 0 R (paragraph.10.49.2.1) 2319 0 R (paragraph.10.50.2.1) 2350 0 R]
+/Limits [(paragraph.10.43.3.5) (paragraph.10.50.2.1)]
+>> endobj
+3541 0 obj <<
+/Names [(paragraph.10.53.2.1) 2682 0 R (paragraph.10.53.2.10) 2743 0 R (paragraph.10.53.2.11) 2746 0 R (paragraph.10.53.2.12) 2749 0 R (paragraph.10.53.2.13) 2752 0 R (paragraph.10.53.2.14) 2755 0 R]
+/Limits [(paragraph.10.53.2.1) (paragraph.10.53.2.14)]
+>> endobj
+3542 0 obj <<
+/Names [(paragraph.10.53.2.15) 2756 0 R (paragraph.10.53.2.16) 2766 0 R (paragraph.10.53.2.17) 2770 0 R (paragraph.10.53.2.18) 2773 0 R (paragraph.10.53.2.19) 2777 0 R (paragraph.10.53.2.2) 2685 0 R]
+/Limits [(paragraph.10.53.2.15) (paragraph.10.53.2.2)]
+>> endobj
+3543 0 obj <<
+/Names [(paragraph.10.53.2.20) 2791 0 R (paragraph.10.53.2.21) 2794 0 R (paragraph.10.53.2.22) 2797 0 R (paragraph.10.53.2.23) 2801 0 R (paragraph.10.53.2.24) 2805 0 R (paragraph.10.53.2.25) 2818 0 R]
+/Limits [(paragraph.10.53.2.20) (paragraph.10.53.2.25)]
+>> endobj
+3544 0 obj <<
+/Names [(paragraph.10.53.2.26) 2821 0 R (paragraph.10.53.2.27) 2824 0 R (paragraph.10.53.2.28) 2827 0 R (paragraph.10.53.2.29) 2830 0 R (paragraph.10.53.2.3) 2688 0 R (paragraph.10.53.2.30) 2842 0 R]
+/Limits [(paragraph.10.53.2.26) (paragraph.10.53.2.30)]
+>> endobj
+3545 0 obj <<
+/Names [(paragraph.10.53.2.31) 2846 0 R (paragraph.10.53.2.32) 2850 0 R (paragraph.10.53.2.33) 2864 0 R (paragraph.10.53.2.34) 2869 0 R (paragraph.10.53.2.35) 2884 0 R (paragraph.10.53.2.36) 2888 0 R]
+/Limits [(paragraph.10.53.2.31) (paragraph.10.53.2.36)]
+>> endobj
+3546 0 obj <<
+/Names [(paragraph.10.53.2.37) 2892 0 R (paragraph.10.53.2.38) 2896 0 R (paragraph.10.53.2.39) 2911 0 R (paragraph.10.53.2.4) 2703 0 R (paragraph.10.53.2.40) 2915 0 R (paragraph.10.53.2.41) 2918 0 R]
+/Limits [(paragraph.10.53.2.37) (paragraph.10.53.2.41)]
+>> endobj
+3547 0 obj <<
+/Names [(paragraph.10.53.2.42) 2921 0 R (paragraph.10.53.2.43) 2936 0 R (paragraph.10.53.2.44) 2939 0 R (paragraph.10.53.2.45) 2943 0 R (paragraph.10.53.2.46) 2946 0 R (paragraph.10.53.2.47) 2961 0 R]
+/Limits [(paragraph.10.53.2.42) (paragraph.10.53.2.47)]
+>> endobj
+3548 0 obj <<
+/Names [(paragraph.10.53.2.48) 2965 0 R (paragraph.10.53.2.49) 2967 0 R (paragraph.10.53.2.5) 2707 0 R (paragraph.10.53.2.50) 2970 0 R (paragraph.10.53.2.51) 2982 0 R (paragraph.10.53.2.52) 2986 0 R]
+/Limits [(paragraph.10.53.2.48) (paragraph.10.53.2.52)]
+>> endobj
+3549 0 obj <<
+/Names [(paragraph.10.53.2.53) 2990 0 R (paragraph.10.53.2.54) 3002 0 R (paragraph.10.53.2.55) 3006 0 R (paragraph.10.53.2.56) 3010 0 R (paragraph.10.53.2.6) 2711 0 R (paragraph.10.53.2.7) 2723 0 R]
+/Limits [(paragraph.10.53.2.53) (paragraph.10.53.2.7)]
+>> endobj
+3550 0 obj <<
+/Names [(paragraph.10.53.2.8) 2727 0 R (paragraph.10.53.2.9) 2740 0 R (paragraph.10.56.2.1) 3056 0 R (paragraph.10.56.3.1) 3060 0 R (paragraph.10.7.2.1) 1101 0 R (paragraph.10.7.2.2) 1114 0 R]
+/Limits [(paragraph.10.53.2.8) (paragraph.10.7.2.2)]
+>> endobj
+3551 0 obj <<
+/Names [(paragraph.10.7.2.3) 1115 0 R (paragraph.10.7.2.4) 1116 0 R (paragraph.10.7.2.5) 1117 0 R (paragraph.10.7.2.6) 1118 0 R (paragraph.10.7.3.1) 1120 0 R (paragraph.10.7.3.2) 1123 0 R]
+/Limits [(paragraph.10.7.2.3) (paragraph.10.7.3.2)]
+>> endobj
+3552 0 obj <<
+/Names [(paragraph.10.8.2.1) 1151 0 R (section*.1) 439 0 R (section*.10) 478 0 R (section*.100) 2378 0 R (section*.101) 2413 0 R (section*.102) 2679 0 R]
+/Limits [(paragraph.10.8.2.1) (section*.102)]
+>> endobj
+3553 0 obj <<
+/Names [(section*.103) 3026 0 R (section*.104) 3033 0 R (section*.105) 3049 0 R (section*.106) 3052 0 R (section*.107) 3071 0 R (section*.108) 3131 0 R]
+/Limits [(section*.103) (section*.108)]
+>> endobj
+3554 0 obj <<
+/Names [(section*.11) 484 0 R (section*.12) 491 0 R (section*.13) 492 0 R (section*.14) 493 0 R (section*.15) 499 0 R (section*.16) 500 0 R]
+/Limits [(section*.11) (section*.16)]
+>> endobj
+3555 0 obj <<
+/Names [(section*.17) 506 0 R (section*.18) 507 0 R (section*.19) 508 0 R (section*.2) 451 0 R (section*.20) 509 0 R (section*.21) 518 0 R]
+/Limits [(section*.17) (section*.21)]
+>> endobj
+3556 0 obj <<
+/Names [(section*.22) 519 0 R (section*.23) 549 0 R (section*.24) 849 0 R (section*.25) 850 0 R (section*.26) 905 0 R (section*.27) 992 0 R]
+/Limits [(section*.22) (section*.27)]
+>> endobj
+3557 0 obj <<
+/Names [(section*.28) 1008 0 R (section*.29) 1011 0 R (section*.3) 457 0 R (section*.30) 1027 0 R (section*.31) 1030 0 R (section*.32) 1056 0 R]
+/Limits [(section*.28) (section*.32)]
+>> endobj
+3558 0 obj <<
+/Names [(section*.33) 1061 0 R (section*.34) 1096 0 R (section*.35) 1097 0 R (section*.36) 1139 0 R (section*.37) 1146 0 R (section*.38) 1174 0 R]
+/Limits [(section*.33) (section*.38)]
+>> endobj
+3559 0 obj <<
+/Names [(section*.39) 1178 0 R (section*.4) 458 0 R (section*.40) 1187 0 R (section*.41) 1213 0 R (section*.42) 1218 0 R (section*.43) 1241 0 R]
+/Limits [(section*.39) (section*.43)]
+>> endobj
+3560 0 obj <<
+/Names [(section*.44) 1258 0 R (section*.45) 1261 0 R (section*.46) 1266 0 R (section*.47) 1294 0 R (section*.48) 1297 0 R (section*.49) 1302 0 R]
+/Limits [(section*.44) (section*.49)]
+>> endobj
+3561 0 obj <<
+/Names [(section*.5) 463 0 R (section*.50) 1340 0 R (section*.51) 1372 0 R (section*.52) 1377 0 R (section*.53) 1382 0 R (section*.54) 1416 0 R]
+/Limits [(section*.5) (section*.54)]
+>> endobj
+3562 0 obj <<
+/Names [(section*.55) 1421 0 R (section*.56) 1431 0 R (section*.57) 1434 0 R (section*.58) 1448 0 R (section*.59) 1489 0 R (section*.6) 464 0 R]
+/Limits [(section*.55) (section*.6)]
+>> endobj
+3563 0 obj <<
+/Names [(section*.60) 1516 0 R (section*.61) 1520 0 R (section*.62) 1551 0 R (section*.63) 1556 0 R (section*.64) 1589 0 R (section*.65) 1594 0 R]
+/Limits [(section*.60) (section*.65)]
+>> endobj
+3564 0 obj <<
+/Names [(section*.66) 1630 0 R (section*.67) 1637 0 R (section*.68) 1666 0 R (section*.69) 1670 0 R (section*.7) 470 0 R (section*.70) 1693 0 R]
+/Limits [(section*.66) (section*.70)]
+>> endobj
+3565 0 obj <<
+/Names [(section*.71) 1698 0 R (section*.72) 1741 0 R (section*.73) 1795 0 R (section*.74) 1799 0 R (section*.75) 1892 0 R (section*.76) 1904 0 R]
+/Limits [(section*.71) (section*.76)]
+>> endobj
+3566 0 obj <<
+/Names [(section*.77) 1907 0 R (section*.78) 1910 0 R (section*.79) 1934 0 R (section*.8) 471 0 R (section*.80) 2001 0 R (section*.81) 2006 0 R]
+/Limits [(section*.77) (section*.81)]
+>> endobj
+3567 0 obj <<
+/Names [(section*.82) 2023 0 R (section*.83) 2025 0 R (section*.84) 2073 0 R (section*.85) 2118 0 R (section*.86) 2170 0 R (section*.87) 2174 0 R]
+/Limits [(section*.82) (section*.87)]
+>> endobj
+3568 0 obj <<
+/Names [(section*.88) 2191 0 R (section*.89) 2204 0 R (section*.9) 472 0 R (section*.90) 2205 0 R (section*.91) 2241 0 R (section*.92) 2248 0 R]
+/Limits [(section*.88) (section*.92)]
+>> endobj
+3569 0 obj <<
+/Names [(section*.93) 2287 0 R (section*.94) 2316 0 R (section*.95) 2320 0 R (section*.96) 2326 0 R (section*.97) 2351 0 R (section*.98) 2354 0 R]
+/Limits [(section*.93) (section*.98)]
+>> endobj
+3570 0 obj <<
+/Names [(section*.99) 2375 0 R (section.1) 2 0 R (section.10) 62 0 R (section.2) 6 0 R (section.3) 10 0 R (section.4) 14 0 R]
+/Limits [(section*.99) (section.4)]
+>> endobj
+3571 0 obj <<
+/Names [(section.5) 22 0 R (section.6) 30 0 R (section.7) 38 0 R (section.8) 46 0 R (section.9) 54 0 R (subsection.10.1) 66 0 R]
+/Limits [(section.5) (subsection.10.1)]
+>> endobj
+3572 0 obj <<
+/Names [(subsection.10.10) 102 0 R (subsection.10.11) 106 0 R (subsection.10.12) 110 0 R (subsection.10.13) 114 0 R (subsection.10.14) 118 0 R (subsection.10.15) 122 0 R]
+/Limits [(subsection.10.10) (subsection.10.15)]
+>> endobj
+3573 0 obj <<
+/Names [(subsection.10.16) 126 0 R (subsection.10.17) 130 0 R (subsection.10.18) 134 0 R (subsection.10.19) 138 0 R (subsection.10.2) 70 0 R (subsection.10.20) 142 0 R]
+/Limits [(subsection.10.16) (subsection.10.20)]
+>> endobj
+3574 0 obj <<
+/Names [(subsection.10.21) 146 0 R (subsection.10.22) 150 0 R (subsection.10.23) 154 0 R (subsection.10.24) 158 0 R (subsection.10.25) 162 0 R (subsection.10.26) 166 0 R]
+/Limits [(subsection.10.21) (subsection.10.26)]
+>> endobj
+3575 0 obj <<
+/Names [(subsection.10.27) 170 0 R (subsection.10.28) 174 0 R (subsection.10.29) 178 0 R (subsection.10.3) 74 0 R (subsection.10.30) 182 0 R (subsection.10.31) 186 0 R]
+/Limits [(subsection.10.27) (subsection.10.31)]
+>> endobj
+3576 0 obj <<
+/Names [(subsection.10.32) 190 0 R (subsection.10.33) 194 0 R (subsection.10.34) 198 0 R (subsection.10.35) 202 0 R (subsection.10.36) 206 0 R (subsection.10.37) 210 0 R]
+/Limits [(subsection.10.32) (subsection.10.37)]
+>> endobj
+3577 0 obj <<
+/Names [(subsection.10.38) 214 0 R (subsection.10.39) 218 0 R (subsection.10.4) 78 0 R (subsection.10.40) 222 0 R (subsection.10.41) 226 0 R (subsection.10.42) 230 0 R]
+/Limits [(subsection.10.38) (subsection.10.42)]
+>> endobj
+3578 0 obj <<
+/Names [(subsection.10.43) 234 0 R (subsection.10.44) 238 0 R (subsection.10.45) 242 0 R (subsection.10.46) 246 0 R (subsection.10.47) 250 0 R (subsection.10.48) 254 0 R]
+/Limits [(subsection.10.43) (subsection.10.48)]
+>> endobj
+3579 0 obj <<
+/Names [(subsection.10.49) 258 0 R (subsection.10.5) 82 0 R (subsection.10.50) 262 0 R (subsection.10.51) 266 0 R (subsection.10.52) 270 0 R (subsection.10.53) 274 0 R]
+/Limits [(subsection.10.49) (subsection.10.53)]
+>> endobj
+3580 0 obj <<
+/Names [(subsection.10.54) 278 0 R (subsection.10.55) 282 0 R (subsection.10.56) 286 0 R (subsection.10.57) 290 0 R (subsection.10.58) 294 0 R (subsection.10.6) 86 0 R]
+/Limits [(subsection.10.54) (subsection.10.6)]
+>> endobj
+3581 0 obj <<
+/Names [(subsection.10.7) 90 0 R (subsection.10.8) 94 0 R (subsection.10.9) 98 0 R (subsection.4.1) 18 0 R (subsection.5.1) 26 0 R (subsection.6.1) 34 0 R]
+/Limits [(subsection.10.7) (subsection.6.1)]
+>> endobj
+3582 0 obj <<
+/Names [(subsection.7.1) 42 0 R (subsection.8.1) 50 0 R (subsection.9.1) 58 0 R (subsubsection.10.1.1) 998 0 R (subsubsection.10.10.1) 1208 0 R (subsubsection.10.11.1) 1217 0 R]
+/Limits [(subsection.7.1) (subsubsection.10.11.1)]
+>> endobj
+3583 0 obj <<
+/Names [(subsubsection.10.12.1) 1240 0 R (subsubsection.10.13.1) 1245 0 R (subsubsection.10.14.1) 1260 0 R (subsubsection.10.15.1) 1265 0 R (subsubsection.10.16.1) 1293 0 R (subsubsection.10.17.1) 1296 0 R]
+/Limits [(subsubsection.10.12.1) (subsubsection.10.17.1)]
+>> endobj
+3584 0 obj <<
+/Names [(subsubsection.10.18.1) 1315 0 R (subsubsection.10.18.2) 1316 0 R (subsubsection.10.19.1) 1344 0 R (subsubsection.10.2.1) 1010 0 R (subsubsection.10.20.1) 1376 0 R (subsubsection.10.21.1) 1392 0 R]
+/Limits [(subsubsection.10.18.1) (subsubsection.10.21.1)]
+>> endobj
+3585 0 obj <<
+/Names [(subsubsection.10.21.2) 1393 0 R (subsubsection.10.22.1) 1420 0 R (subsubsection.10.23.1) 1424 0 R (subsubsection.10.24.1) 1433 0 R (subsubsection.10.25.1) 1435 0 R (subsubsection.10.25.2) 1436 0 R]
+/Limits [(subsubsection.10.21.2) (subsubsection.10.25.2)]
+>> endobj
+3586 0 obj <<
+/Names [(subsubsection.10.26.1) 1450 0 R (subsubsection.10.27.1) 1499 0 R (subsubsection.10.28.1) 1522 0 R (subsubsection.10.29.1) 1559 0 R (subsubsection.10.3.1) 1014 0 R (subsubsection.10.30.1) 1597 0 R]
+/Limits [(subsubsection.10.26.1) (subsubsection.10.30.1)]
+>> endobj
+3587 0 obj <<
+/Names [(subsubsection.10.31.1) 1640 0 R (subsubsection.10.32.1) 1672 0 R (subsubsection.10.33.1) 1697 0 R (subsubsection.10.34.1) 1740 0 R (subsubsection.10.35.1) 1800 0 R (subsubsection.10.35.2) 1821 0 R]
+/Limits [(subsubsection.10.31.1) (subsubsection.10.35.2)]
+>> endobj
+3588 0 obj <<
+/Names [(subsubsection.10.35.3) 1841 0 R (subsubsection.10.36.1) 1895 0 R (subsubsection.10.37.1) 1906 0 R (subsubsection.10.38.1) 1909 0 R (subsubsection.10.39.1) 1933 0 R (subsubsection.10.4.1) 1029 0 R]
+/Limits [(subsubsection.10.35.3) (subsubsection.10.4.1)]
+>> endobj
+3589 0 obj <<
+/Names [(subsubsection.10.40.1) 1960 0 R (subsubsection.10.40.2) 1961 0 R (subsubsection.10.41.1) 2008 0 R (subsubsection.10.41.2) 2009 0 R (subsubsection.10.42.1) 2026 0 R (subsubsection.10.43.1) 2120 0 R]
+/Limits [(subsubsection.10.40.1) (subsubsection.10.43.1)]
+>> endobj
+3590 0 obj <<
+/Names [(subsubsection.10.43.2) 2134 0 R (subsubsection.10.43.3) 2146 0 R (subsubsection.10.44.1) 2173 0 R (subsubsection.10.45.1) 2190 0 R (subsubsection.10.46.1) 2193 0 R (subsubsection.10.47.1) 2206 0 R]
+/Limits [(subsubsection.10.43.2) (subsubsection.10.47.1)]
+>> endobj
+3591 0 obj <<
+/Names [(subsubsection.10.47.2) 2207 0 R (subsubsection.10.48.1) 2249 0 R (subsubsection.10.48.2) 2285 0 R (subsubsection.10.49.1) 2317 0 R (subsubsection.10.49.2) 2318 0 R (subsubsection.10.5.1) 1035 0 R]
+/Limits [(subsubsection.10.47.2) (subsubsection.10.5.1)]
+>> endobj
+3592 0 obj <<
+/Names [(subsubsection.10.50.1) 2348 0 R (subsubsection.10.50.2) 2349 0 R (subsubsection.10.51.1) 2374 0 R (subsubsection.10.52.1) 2381 0 R (subsubsection.10.53.1) 2680 0 R (subsubsection.10.53.2) 2681 0 R]
+/Limits [(subsubsection.10.50.1) (subsubsection.10.53.2)]
+>> endobj
+3593 0 obj <<
+/Names [(subsubsection.10.54.1) 3032 0 R (subsubsection.10.55.1) 3048 0 R (subsubsection.10.56.1) 3053 0 R (subsubsection.10.56.2) 3054 0 R (subsubsection.10.56.3) 3058 0 R (subsubsection.10.57.1) 3070 0 R]
+/Limits [(subsubsection.10.54.1) (subsubsection.10.57.1)]
+>> endobj
+3594 0 obj <<
+/Names [(subsubsection.10.58.1) 298 0 R (subsubsection.10.6.1) 1060 0 R (subsubsection.10.7.1) 1099 0 R (subsubsection.10.7.2) 1100 0 R (subsubsection.10.7.3) 1119 0 R (subsubsection.10.8.1) 1148 0 R]
+/Limits [(subsubsection.10.58.1) (subsubsection.10.8.1)]
+>> endobj
+3595 0 obj <<
+/Names [(subsubsection.10.8.2) 1149 0 R (subsubsection.10.9.1) 1177 0 R (subsubsection.8.1.1) 904 0 R (subsubsection.9.1.1) 991 0 R (table.1) 1121 0 R (table.10) 1399 0 R]
+/Limits [(subsubsection.10.8.2) (table.10)]
+>> endobj
+3596 0 obj <<
+/Names [(table.100) 2940 0 R (table.101) 2941 0 R (table.102) 2944 0 R (table.103) 2958 0 R (table.104) 2959 0 R (table.105) 2962 0 R]
+/Limits [(table.100) (table.105)]
+>> endobj
+3597 0 obj <<
+/Names [(table.106) 2963 0 R (table.107) 2966 0 R (table.108) 2968 0 R (table.109) 2979 0 R (table.11) 1401 0 R (table.110) 2980 0 R]
+/Limits [(table.106) (table.110)]
+>> endobj
+3598 0 obj <<
+/Names [(table.111) 2983 0 R (table.112) 2984 0 R (table.113) 2987 0 R (table.114) 2988 0 R (table.115) 2991 0 R (table.116) 3000 0 R]
+/Limits [(table.111) (table.116)]
+>> endobj
+3599 0 obj <<
+/Names [(table.117) 3003 0 R (table.118) 3004 0 R (table.119) 3007 0 R (table.12) 1439 0 R (table.120) 3008 0 R (table.121) 3011 0 R]
+/Limits [(table.117) (table.121)]
+>> endobj
+3600 0 obj <<
+/Names [(table.122) 3024 0 R (table.123) 3057 0 R (table.13) 1823 0 R (table.14) 1824 0 R (table.15) 1826 0 R (table.16) 1839 0 R]
+/Limits [(table.122) (table.16)]
+>> endobj
+3601 0 obj <<
+/Names [(table.17) 1844 0 R (table.18) 1845 0 R (table.19) 1847 0 R (table.2) 1152 0 R (table.20) 1850 0 R (table.21) 1862 0 R]
+/Limits [(table.17) (table.21)]
+>> endobj
+3602 0 obj <<
+/Names [(table.22) 1865 0 R (table.23) 1870 0 R (table.24) 1871 0 R (table.25) 1887 0 R (table.26) 1889 0 R (table.27) 1891 0 R]
+/Limits [(table.22) (table.27)]
+>> endobj
+3603 0 obj <<
+/Names [(table.28) 1982 0 R (table.29) 1986 0 R (table.3) 1318 0 R (table.30) 1987 0 R (table.31) 2136 0 R (table.32) 2137 0 R]
+/Limits [(table.28) (table.32)]
+>> endobj
+3604 0 obj <<
+/Names [(table.33) 2149 0 R (table.34) 2151 0 R (table.35) 2154 0 R (table.36) 2210 0 R (table.37) 2683 0 R (table.38) 2686 0 R]
+/Limits [(table.33) (table.38)]
+>> endobj
+3605 0 obj <<
+/Names [(table.39) 2701 0 R (table.4) 1320 0 R (table.40) 2704 0 R (table.41) 2705 0 R (table.42) 2708 0 R (table.43) 2709 0 R]
+/Limits [(table.39) (table.43)]
+>> endobj
+3606 0 obj <<
+/Names [(table.44) 2720 0 R (table.45) 2721 0 R (table.46) 2724 0 R (table.47) 2725 0 R (table.48) 2728 0 R (table.49) 2741 0 R]
+/Limits [(table.44) (table.49)]
+>> endobj
+3607 0 obj <<
+/Names [(table.5) 1323 0 R (table.50) 2744 0 R (table.51) 2747 0 R (table.52) 2750 0 R (table.53) 2753 0 R (table.54) 2767 0 R]
+/Limits [(table.5) (table.54)]
+>> endobj
+3608 0 obj <<
+/Names [(table.55) 2768 0 R (table.56) 2771 0 R (table.57) 2774 0 R (table.58) 2775 0 R (table.59) 2778 0 R (table.6) 1337 0 R]
+/Limits [(table.55) (table.6)]
+>> endobj
+3609 0 obj <<
+/Names [(table.60) 2789 0 R (table.61) 2792 0 R (table.62) 2795 0 R (table.63) 2798 0 R (table.64) 2799 0 R (table.65) 2802 0 R]
+/Limits [(table.60) (table.65)]
+>> endobj
+3610 0 obj <<
+/Names [(table.66) 2803 0 R (table.67) 2816 0 R (table.68) 2819 0 R (table.69) 2822 0 R (table.7) 1339 0 R (table.70) 2825 0 R]
+/Limits [(table.66) (table.70)]
+>> endobj
+3611 0 obj <<
+/Names [(table.71) 2828 0 R (table.72) 2839 0 R (table.73) 2840 0 R (table.74) 2843 0 R (table.75) 2844 0 R (table.76) 2847 0 R]
+/Limits [(table.71) (table.76)]
+>> endobj
+3612 0 obj <<
+/Names [(table.77) 2848 0 R (table.78) 2861 0 R (table.79) 2862 0 R (table.8) 1395 0 R (table.80) 2865 0 R (table.81) 2866 0 R]
+/Limits [(table.77) (table.81)]
+>> endobj
+3613 0 obj <<
+/Names [(table.82) 2870 0 R (table.83) 2871 0 R (table.84) 2885 0 R (table.85) 2886 0 R (table.86) 2889 0 R (table.87) 2890 0 R]
+/Limits [(table.82) (table.87)]
+>> endobj
+3614 0 obj <<
+/Names [(table.88) 2893 0 R (table.89) 2894 0 R (table.9) 1397 0 R (table.90) 2908 0 R (table.91) 2909 0 R (table.92) 2912 0 R]
+/Limits [(table.88) (table.92)]
+>> endobj
+3615 0 obj <<
+/Names [(table.93) 2913 0 R (table.94) 2916 0 R (table.95) 2919 0 R (table.96) 2920 0 R (table.97) 2934 0 R (table.98) 2935 0 R]
+/Limits [(table.93) (table.98)]
+>> endobj
+3616 0 obj <<
+/Names [(table.99) 2937 0 R]
+/Limits [(table.99) (table.99)]
+>> endobj
+3617 0 obj <<
+/Kids [3445 0 R 3446 0 R 3447 0 R 3448 0 R 3449 0 R 3450 0 R]
+/Limits [(Doc-Start) (classparma__polyhedra__library_1_1Coefficient_a3f49d1a45b861fb12fac766004b358c5)]
+>> endobj
+3618 0 obj <<
+/Kids [3451 0 R 3452 0 R 3453 0 R 3454 0 R 3455 0 R 3456 0 R]
+/Limits [(classparma__polyhedra__library_1_1Coefficient_a88c2f2fc304b1e27f20f200efcde2a11) (classparma__polyhedra__library_1_1Generator_a6c93053ad6b6bbcaa9aee01b646bba06)]
+>> endobj
+3619 0 obj <<
+/Kids [3457 0 R 3458 0 R 3459 0 R 3460 0 R 3461 0 R 3462 0 R]
+/Limits [(classparma__polyhedra__library_1_1Generator_a7223763131fbe9f93528193576a7975c) (classparma__polyhedra__library_1_1Linear__Expression__Difference_aaaeb914f871ccb4e97fc4fd513364b94)]
+>> endobj
+3620 0 obj <<
+/Kids [3463 0 R 3464 0 R 3465 0 R 3466 0 R 3467 0 R 3468 0 R]
+/Limits [(classparma__polyhedra__library_1_1Linear__Expression__Difference_aba4e5801ccc48c5aca66c1e09ddb601e) (classparma__polyhedra__library_1_1Linear__Expression_af6431ecb966a6e38dc55e7f4274b31db)]
+>> endobj
+3621 0 obj <<
+/Kids [3469 0 R 3470 0 R 3471 0 R 3472 0 R 3473 0 R 3474 0 R]
+/Limits [(classparma__polyhedra__library_1_1Logic__Error__Exception) (classparma__polyhedra__library_1_1PIP__Decision__Node)]
+>> endobj
+3622 0 obj <<
+/Kids [3475 0 R 3476 0 R 3477 0 R 3478 0 R 3479 0 R 3480 0 R]
+/Limits [(classparma__polyhedra__library_1_1PIP__Decision__Node_a72e63bc7c8c5d3bf7a4a89376f32457e) (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93)]
+>> endobj
+3623 0 obj <<
+/Kids [3481 0 R 3482 0 R 3483 0 R 3484 0 R 3485 0 R 3486 0 R]
+/Limits [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) (classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator)]
+>> endobj
+3624 0 obj <<
+/Kids [3487 0 R 3488 0 R 3489 0 R 3490 0 R 3491 0 R 3492 0 R]
+/Limits [(classparma__polyhedra__library_1_1Pointset__Powerset__C__Polyhedron__Iterator_a0bcdabb3d2a28f20e10697676f42e490) (classparma__polyhedra__library_1_1Polyhedron_a1680eecb6021ebdb33388e32932e6ecc)]
+>> endobj
+3625 0 obj <<
+/Kids [3493 0 R 3494 0 R 3495 0 R 3496 0 R 3497 0 R 3498 0 R]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a18afe96aac90a2f8f635fb0e3722fcc3) (classparma__polyhedra__library_1_1Polyhedron_a8561bc8f545197343c8cf1935e794af3)]
+>> endobj
+3626 0 obj <<
+/Kids [3499 0 R 3500 0 R 3501 0 R 3502 0 R 3503 0 R 3504 0 R]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_a86d72df251b72aa131ecdad46fe9a860) (classparma__polyhedra__library_1_1Polyhedron_afba20cade6fa4fcd26b81086a02923e5)]
+>> endobj
+3627 0 obj <<
+/Kids [3505 0 R 3506 0 R 3507 0 R 3508 0 R 3509 0 R 3510 0 R]
+/Limits [(classparma__polyhedra__library_1_1Polyhedron_afd99082f48df543223c3152ca1fe600c) (enumparma__polyhedra__library_1_1Generator__Type_aa8aee01f50041535fba84ef399e5ee81)]
+>> endobj
+3628 0 obj <<
+/Kids [3511 0 R 3512 0 R 3513 0 R 3514 0 R 3515 0 R 3516 0 R]
+/Limits [(enumparma__polyhedra__library_1_1Grid__Generator__Type) (page.11)]
+>> endobj
+3629 0 obj <<
+/Kids [3517 0 R 3518 0 R 3519 0 R 3520 0 R 3521 0 R 3522 0 R]
+/Limits [(page.12) (page.44)]
+>> endobj
+3630 0 obj <<
+/Kids [3523 0 R 3524 0 R 3525 0 R 3526 0 R 3527 0 R 3528 0 R]
+/Limits [(page.45) (page.77)]
+>> endobj
+3631 0 obj <<
+/Kids [3529 0 R 3530 0 R 3531 0 R 3532 0 R 3533 0 R 3534 0 R]
+/Limits [(page.78) (paragraph.10.25.2.1)]
+>> endobj
+3632 0 obj <<
+/Kids [3535 0 R 3536 0 R 3537 0 R 3538 0 R 3539 0 R 3540 0 R]
+/Limits [(paragraph.10.35.2.1) (paragraph.10.50.2.1)]
+>> endobj
+3633 0 obj <<
+/Kids [3541 0 R 3542 0 R 3543 0 R 3544 0 R 3545 0 R 3546 0 R]
+/Limits [(paragraph.10.53.2.1) (paragraph.10.53.2.41)]
+>> endobj
+3634 0 obj <<
+/Kids [3547 0 R 3548 0 R 3549 0 R 3550 0 R 3551 0 R 3552 0 R]
+/Limits [(paragraph.10.53.2.42) (section*.102)]
+>> endobj
+3635 0 obj <<
+/Kids [3553 0 R 3554 0 R 3555 0 R 3556 0 R 3557 0 R 3558 0 R]
+/Limits [(section*.103) (section*.38)]
+>> endobj
+3636 0 obj <<
+/Kids [3559 0 R 3560 0 R 3561 0 R 3562 0 R 3563 0 R 3564 0 R]
+/Limits [(section*.39) (section*.70)]
+>> endobj
+3637 0 obj <<
+/Kids [3565 0 R 3566 0 R 3567 0 R 3568 0 R 3569 0 R 3570 0 R]
+/Limits [(section*.71) (section.4)]
+>> endobj
+3638 0 obj <<
+/Kids [3571 0 R 3572 0 R 3573 0 R 3574 0 R 3575 0 R 3576 0 R]
+/Limits [(section.5) (subsection.10.37)]
+>> endobj
+3639 0 obj <<
+/Kids [3577 0 R 3578 0 R 3579 0 R 3580 0 R 3581 0 R 3582 0 R]
+/Limits [(subsection.10.38) (subsubsection.10.11.1)]
+>> endobj
+3640 0 obj <<
+/Kids [3583 0 R 3584 0 R 3585 0 R 3586 0 R 3587 0 R 3588 0 R]
+/Limits [(subsubsection.10.12.1) (subsubsection.10.4.1)]
+>> endobj
+3641 0 obj <<
+/Kids [3589 0 R 3590 0 R 3591 0 R 3592 0 R 3593 0 R 3594 0 R]
+/Limits [(subsubsection.10.40.1) (subsubsection.10.8.1)]
+>> endobj
+3642 0 obj <<
+/Kids [3595 0 R 3596 0 R 3597 0 R 3598 0 R 3599 0 R 3600 0 R]
+/Limits [(subsubsection.10.8.2) (table.16)]
+>> endobj
+3643 0 obj <<
+/Kids [3601 0 R 3602 0 R 3603 0 R 3604 0 R 3605 0 R 3606 0 R]
+/Limits [(table.17) (table.49)]
+>> endobj
+3644 0 obj <<
+/Kids [3607 0 R 3608 0 R 3609 0 R 3610 0 R 3611 0 R 3612 0 R]
+/Limits [(table.5) (table.81)]
+>> endobj
+3645 0 obj <<
+/Kids [3613 0 R 3614 0 R 3615 0 R 3616 0 R]
+/Limits [(table.82) (table.99)]
+>> endobj
+3646 0 obj <<
+/Kids [3617 0 R 3618 0 R 3619 0 R 3620 0 R 3621 0 R 3622 0 R]
+/Limits [(Doc-Start) (classparma__polyhedra__library_1_1PIP__Tree__Node_a33dde59d655ee0ce0f7b7b97c7e57f93)]
+>> endobj
+3647 0 obj <<
+/Kids [3623 0 R 3624 0 R 3625 0 R 3626 0 R 3627 0 R 3628 0 R]
+/Limits [(classparma__polyhedra__library_1_1PIP__Tree__Node_a59f64bef2634e80385a906bfefe2acd5) (page.11)]
+>> endobj
+3648 0 obj <<
+/Kids [3629 0 R 3630 0 R 3631 0 R 3632 0 R 3633 0 R 3634 0 R]
+/Limits [(page.12) (section*.102)]
+>> endobj
+3649 0 obj <<
+/Kids [3635 0 R 3636 0 R 3637 0 R 3638 0 R 3639 0 R 3640 0 R]
+/Limits [(section*.103) (subsubsection.10.4.1)]
+>> endobj
+3650 0 obj <<
+/Kids [3641 0 R 3642 0 R 3643 0 R 3644 0 R 3645 0 R]
+/Limits [(subsubsection.10.40.1) (table.99)]
+>> endobj
+3651 0 obj <<
+/Kids [3646 0 R 3647 0 R 3648 0 R 3649 0 R 3650 0 R]
+/Limits [(Doc-Start) (table.99)]
+>> endobj
+3652 0 obj <<
+/Dests 3651 0 R
+>> endobj
+3653 0 obj <<
+/Type /Catalog
+/Pages 3443 0 R
+/Outlines 3444 0 R
+/Names 3652 0 R
+/PageMode/UseOutlines/PageLabels<</Nums[0<</S/D>>4<</S/r>>6<</S/D>>]>>
+/OpenAction 301 0 R
+>> endobj
+3654 0 obj <<
+/Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords()
+/CreationDate (D:20130404152447+02'00')
+/ModDate (D:20130404152447+02'00')
+/Trapped /False
+/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0)
+>> endobj
+xref
+0 3655
+0000000000 65535 f 
+0000000015 00000 n 
+0000059485 00000 n 
+0001002531 00000 n 
+0000000060 00000 n 
+0000000134 00000 n 
+0000063957 00000 n 
+0001002446 00000 n 
+0000000179 00000 n 
+0000000344 00000 n 
+0000102573 00000 n 
+0001002359 00000 n 
+0000000389 00000 n 
+0000000575 00000 n 
+0000122211 00000 n 
+0001002233 00000 n 
+0000000621 00000 n 
+0000000711 00000 n 
+0000122267 00000 n 
+0001002172 00000 n 
+0000000762 00000 n 
+0000000824 00000 n 
+0000122323 00000 n 
+0001002046 00000 n 
+0000000870 00000 n 
+0000000975 00000 n 
+0000122379 00000 n 
+0001001985 00000 n 
+0000001026 00000 n 
+0000001126 00000 n 
+0000122435 00000 n 
+0001001859 00000 n 
+0000001172 00000 n 
+0000001292 00000 n 
+0000122491 00000 n 
+0001001798 00000 n 
+0000001343 00000 n 
+0000001448 00000 n 
+0000135140 00000 n 
+0001001672 00000 n 
+0000001494 00000 n 
+0000001579 00000 n 
+0000135196 00000 n 
+0001001611 00000 n 
+0000001630 00000 n 
+0000001710 00000 n 
+0000162437 00000 n 
+0001001485 00000 n 
+0000001756 00000 n 
+0000001886 00000 n 
+0000168520 00000 n 
+0001001424 00000 n 
+0000001937 00000 n 
+0000002085 00000 n 
+0000181777 00000 n 
+0001001298 00000 n 
+0000002131 00000 n 
+0000002276 00000 n 
+0000181890 00000 n 
+0001001237 00000 n 
+0000002327 00000 n 
+0000002518 00000 n 
+0000202630 00000 n 
+0001001108 00000 n 
+0000002565 00000 n 
+0000002690 00000 n 
+0000202743 00000 n 
+0001001034 00000 n 
+0000002742 00000 n 
+0000003084 00000 n 
+0000206591 00000 n 
+0001000947 00000 n 
+0000003136 00000 n 
+0000003526 00000 n 
+0000206883 00000 n 
+0001000860 00000 n 
+0000003578 00000 n 
+0000003966 00000 n 
+0000210253 00000 n 
+0001000773 00000 n 
+0000004018 00000 n 
+0000004436 00000 n 
+0000210545 00000 n 
+0001000686 00000 n 
+0000004488 00000 n 
+0000004861 00000 n 
+0000211014 00000 n 
+0001000599 00000 n 
+0000004913 00000 n 
+0000005246 00000 n 
+0000219578 00000 n 
+0001000512 00000 n 
+0000005298 00000 n 
+0000005600 00000 n 
+0000235848 00000 n 
+0001000425 00000 n 
+0000005652 00000 n 
+0000005946 00000 n 
+0000242325 00000 n 
+0001000336 00000 n 
+0000005998 00000 n 
+0000006316 00000 n 
+0000242676 00000 n 
+0001000245 00000 n 
+0000006370 00000 n 
+0000006660 00000 n 
+0000248584 00000 n 
+0001000153 00000 n 
+0000006714 00000 n 
+0000007042 00000 n 
+0000248993 00000 n 
+0001000061 00000 n 
+0000007096 00000 n 
+0000007386 00000 n 
+0000254275 00000 n 
+0000999969 00000 n 
+0000007440 00000 n 
+0000007768 00000 n 
+0000257933 00000 n 
+0000999877 00000 n 
+0000007822 00000 n 
+0000008173 00000 n 
+0000258226 00000 n 
+0000999785 00000 n 
+0000008227 00000 n 
+0000008583 00000 n 
+0000258637 00000 n 
+0000999693 00000 n 
+0000008637 00000 n 
+0000008965 00000 n 
+0000264398 00000 n 
+0000999601 00000 n 
+0000009019 00000 n 
+0000009375 00000 n 
+0000264690 00000 n 
+0000999509 00000 n 
+0000009429 00000 n 
+0000009714 00000 n 
+0000273875 00000 n 
+0000999417 00000 n 
+0000009768 00000 n 
+0000010091 00000 n 
+0000274284 00000 n 
+0000999325 00000 n 
+0000010145 00000 n 
+0000010453 00000 n 
+0000281476 00000 n 
+0000999233 00000 n 
+0000010507 00000 n 
+0000010820 00000 n 
+0000285511 00000 n 
+0000999141 00000 n 
+0000010874 00000 n 
+0000011225 00000 n 
+0000289613 00000 n 
+0000999049 00000 n 
+0000011279 00000 n 
+0000011615 00000 n 
+0000289964 00000 n 
+0000998957 00000 n 
+0000011669 00000 n 
+0000012045 00000 n 
+0000293163 00000 n 
+0000998865 00000 n 
+0000012099 00000 n 
+0000012349 00000 n 
+0000300587 00000 n 
+0000998773 00000 n 
+0000012403 00000 n 
+0000012759 00000 n 
+0000300878 00000 n 
+0000998681 00000 n 
+0000012813 00000 n 
+0000013141 00000 n 
+0000309028 00000 n 
+0000998589 00000 n 
+0000013195 00000 n 
+0000013586 00000 n 
+0000317066 00000 n 
+0000998497 00000 n 
+0000013640 00000 n 
+0000014026 00000 n 
+0000326333 00000 n 
+0000998405 00000 n 
+0000014080 00000 n 
+0000014431 00000 n 
+0000335510 00000 n 
+0000998313 00000 n 
+0000014485 00000 n 
+0000014846 00000 n 
+0000353276 00000 n 
+0000998221 00000 n 
+0000014900 00000 n 
+0000015294 00000 n 
+0000353803 00000 n 
+0000998129 00000 n 
+0000015348 00000 n 
+0000015724 00000 n 
+0000361246 00000 n 
+0000998037 00000 n 
+0000015778 00000 n 
+0000016129 00000 n 
+0000369120 00000 n 
+0000997945 00000 n 
+0000016183 00000 n 
+0000016481 00000 n 
+0000401755 00000 n 
+0000997853 00000 n 
+0000016535 00000 n 
+0000016866 00000 n 
+0000402107 00000 n 
+0000997761 00000 n 
+0000016920 00000 n 
+0000017243 00000 n 
+0000405257 00000 n 
+0000997669 00000 n 
+0000017297 00000 n 
+0000017663 00000 n 
+0000405550 00000 n 
+0000997577 00000 n 
+0000017717 00000 n 
+0000018026 00000 n 
+0000410940 00000 n 
+0000997485 00000 n 
+0000018080 00000 n 
+0000018441 00000 n 
+0000427960 00000 n 
+0000997393 00000 n 
+0000018495 00000 n 
+0000018818 00000 n 
+0000435121 00000 n 
+0000997301 00000 n 
+0000018872 00000 n 
+0000019203 00000 n 
+0000435473 00000 n 
+0000997209 00000 n 
+0000019257 00000 n 
+0000019555 00000 n 
+0000465943 00000 n 
+0000997117 00000 n 
+0000019609 00000 n 
+0000020026 00000 n 
+0000466293 00000 n 
+0000997025 00000 n 
+0000020080 00000 n 
+0000020502 00000 n 
+0000469782 00000 n 
+0000996933 00000 n 
+0000020556 00000 n 
+0000020887 00000 n 
+0000470074 00000 n 
+0000996841 00000 n 
+0000020941 00000 n 
+0000021272 00000 n 
+0000477185 00000 n 
+0000996749 00000 n 
+0000021326 00000 n 
+0000021637 00000 n 
+0000495490 00000 n 
+0000996657 00000 n 
+0000021691 00000 n 
+0000022090 00000 n 
+0000502121 00000 n 
+0000996565 00000 n 
+0000022144 00000 n 
+0000022591 00000 n 
+0000508783 00000 n 
+0000996473 00000 n 
+0000022645 00000 n 
+0000022976 00000 n 
+0000512904 00000 n 
+0000996381 00000 n 
+0000023030 00000 n 
+0000023361 00000 n 
+0000513433 00000 n 
+0000996289 00000 n 
+0000023415 00000 n 
+0000023705 00000 n 
+0000656570 00000 n 
+0000996197 00000 n 
+0000023759 00000 n 
+0000024072 00000 n 
+0000657098 00000 n 
+0000996105 00000 n 
+0000024126 00000 n 
+0000024454 00000 n 
+0000661475 00000 n 
+0000996013 00000 n 
+0000024508 00000 n 
+0000024788 00000 n 
+0000665334 00000 n 
+0000995921 00000 n 
+0000024842 00000 n 
+0000025205 00000 n 
+0000665509 00000 n 
+0000995843 00000 n 
+0000025259 00000 n 
+0000025567 00000 n 
+0000665685 00000 n 
+0000995764 00000 n 
+0000025626 00000 n 
+0000025679 00000 n 
+0000027089 00000 n 
+0000027208 00000 n 
+0000030546 00000 n 
+0000025731 00000 n 
+0000030433 00000 n 
+0000030489 00000 n 
+0000991965 00000 n 
+0000990240 00000 n 
+0000990672 00000 n 
+0000990384 00000 n 
+0000992497 00000 n 
+0000992853 00000 n 
+0000030202 00000 n 
+0000030386 00000 n 
+0000030973 00000 n 
+0000030798 00000 n 
+0000030698 00000 n 
+0000030917 00000 n 
+0000038023 00000 n 
+0000038189 00000 n 
+0000038341 00000 n 
+0000038507 00000 n 
+0000038805 00000 n 
+0000032844 00000 n 
+0000038985 00000 n 
+0000035047 00000 n 
+0000039205 00000 n 
+0000032657 00000 n 
+0000031014 00000 n 
+0000039149 00000 n 
+0000992139 00000 n 
+0000038657 00000 n 
+0000991254 00000 n 
+0000034816 00000 n 
+0000035000 00000 n 
+0000037792 00000 n 
+0000037976 00000 n 
+0000102686 00000 n 
+0000064069 00000 n 
+0000039619 00000 n 
+0000039444 00000 n 
+0000039344 00000 n 
+0000039563 00000 n 
+0000041707 00000 n 
+0000041858 00000 n 
+0000042008 00000 n 
+0000042159 00000 n 
+0000042310 00000 n 
+0000042467 00000 n 
+0000042617 00000 n 
+0000042772 00000 n 
+0000042923 00000 n 
+0000043080 00000 n 
+0000043231 00000 n 
+0000043388 00000 n 
+0000043539 00000 n 
+0000043696 00000 n 
+0000043846 00000 n 
+0000044003 00000 n 
+0000044154 00000 n 
+0000044312 00000 n 
+0000044469 00000 n 
+0000044626 00000 n 
+0000044784 00000 n 
+0000044942 00000 n 
+0000045100 00000 n 
+0000045258 00000 n 
+0000045416 00000 n 
+0000045574 00000 n 
+0000045733 00000 n 
+0000045892 00000 n 
+0000046051 00000 n 
+0000046210 00000 n 
+0000046369 00000 n 
+0000046528 00000 n 
+0000046687 00000 n 
+0000046846 00000 n 
+0000047005 00000 n 
+0000047164 00000 n 
+0000047323 00000 n 
+0000047481 00000 n 
+0000047640 00000 n 
+0000047798 00000 n 
+0000047957 00000 n 
+0000048116 00000 n 
+0000048274 00000 n 
+0000048431 00000 n 
+0000050613 00000 n 
+0000048587 00000 n 
+0000048807 00000 n 
+0000041216 00000 n 
+0000039660 00000 n 
+0000048751 00000 n 
+0000988928 00000 n 
+0000050772 00000 n 
+0000050931 00000 n 
+0000051090 00000 n 
+0000051249 00000 n 
+0000051407 00000 n 
+0000051566 00000 n 
+0000051724 00000 n 
+0000051883 00000 n 
+0000052041 00000 n 
+0000052199 00000 n 
+0000052358 00000 n 
+0000052516 00000 n 
+0000052675 00000 n 
+0000052833 00000 n 
+0000052992 00000 n 
+0000053150 00000 n 
+0000053309 00000 n 
+0000053468 00000 n 
+0000053627 00000 n 
+0000053786 00000 n 
+0000053945 00000 n 
+0000054104 00000 n 
+0000054263 00000 n 
+0000054422 00000 n 
+0000054581 00000 n 
+0000054740 00000 n 
+0000054899 00000 n 
+0000055058 00000 n 
+0000055216 00000 n 
+0000055375 00000 n 
+0000055536 00000 n 
+0000055754 00000 n 
+0000050226 00000 n 
+0000048946 00000 n 
+0000055698 00000 n 
+0000059119 00000 n 
+0000059321 00000 n 
+0000059654 00000 n 
+0000058972 00000 n 
+0000055893 00000 n 
+0000991606 00000 n 
+0000059540 00000 n 
+0000992673 00000 n 
+0000059597 00000 n 
+0000992971 00000 n 
+0000410882 00000 n 
+0000063244 00000 n 
+0000063633 00000 n 
+0000063795 00000 n 
+0000064183 00000 n 
+0000063081 00000 n 
+0000059806 00000 n 
+0000989660 00000 n 
+0000063439 00000 n 
+0000064012 00000 n 
+0000064126 00000 n 
+0000254217 00000 n 
+0000067848 00000 n 
+0000068126 00000 n 
+0000067709 00000 n 
+0000064373 00000 n 
+0000068012 00000 n 
+0000068069 00000 n 
+0000071620 00000 n 
+0000071896 00000 n 
+0000071481 00000 n 
+0000068265 00000 n 
+0000071782 00000 n 
+0000071839 00000 n 
+0000075096 00000 n 
+0000075487 00000 n 
+0000074957 00000 n 
+0000072035 00000 n 
+0000075260 00000 n 
+0000075316 00000 n 
+0000075373 00000 n 
+0000075430 00000 n 
+0000079235 00000 n 
+0000079510 00000 n 
+0000079096 00000 n 
+0000075626 00000 n 
+0000079397 00000 n 
+0000079453 00000 n 
+0000083000 00000 n 
+0000083277 00000 n 
+0000082861 00000 n 
+0000079649 00000 n 
+0000083164 00000 n 
+0000083220 00000 n 
+0000993089 00000 n 
+0000086732 00000 n 
+0000087121 00000 n 
+0000086593 00000 n 
+0000083416 00000 n 
+0000086894 00000 n 
+0000086950 00000 n 
+0000087007 00000 n 
+0000087064 00000 n 
+0000090989 00000 n 
+0000091323 00000 n 
+0000090850 00000 n 
+0000087260 00000 n 
+0000091153 00000 n 
+0000091209 00000 n 
+0000091266 00000 n 
+0000094528 00000 n 
+0000094974 00000 n 
+0000094389 00000 n 
+0000091462 00000 n 
+0000094690 00000 n 
+0000094746 00000 n 
+0000094803 00000 n 
+0000094860 00000 n 
+0000094917 00000 n 
+0000097904 00000 n 
+0000098080 00000 n 
+0000102160 00000 n 
+0000098254 00000 n 
+0000098588 00000 n 
+0000097749 00000 n 
+0000095113 00000 n 
+0000098418 00000 n 
+0000098474 00000 n 
+0000098531 00000 n 
+0000991428 00000 n 
+0000102355 00000 n 
+0000102743 00000 n 
+0000102013 00000 n 
+0000098740 00000 n 
+0000102517 00000 n 
+0000102629 00000 n 
+0000106790 00000 n 
+0000107010 00000 n 
+0000106651 00000 n 
+0000102882 00000 n 
+0000106954 00000 n 
+0000993207 00000 n 
+0000110586 00000 n 
+0000110804 00000 n 
+0000110447 00000 n 
+0000107136 00000 n 
+0000110748 00000 n 
+0000114365 00000 n 
+0000114585 00000 n 
+0000114226 00000 n 
+0000110930 00000 n 
+0000114529 00000 n 
+0000118170 00000 n 
+0000118346 00000 n 
+0000118621 00000 n 
+0000118023 00000 n 
+0000114711 00000 n 
+0000118508 00000 n 
+0000118564 00000 n 
+0000120557 00000 n 
+0000120714 00000 n 
+0000120890 00000 n 
+0000121047 00000 n 
+0000121205 00000 n 
+0000121363 00000 n 
+0000121519 00000 n 
+0000121677 00000 n 
+0000121835 00000 n 
+0000124042 00000 n 
+0000124200 00000 n 
+0000121991 00000 n 
+0000122547 00000 n 
+0000120346 00000 n 
+0000118760 00000 n 
+0000122155 00000 n 
+0000181833 00000 n 
+0000124358 00000 n 
+0000124516 00000 n 
+0000124675 00000 n 
+0000124834 00000 n 
+0000124993 00000 n 
+0000125152 00000 n 
+0000125310 00000 n 
+0000125469 00000 n 
+0000125627 00000 n 
+0000125786 00000 n 
+0000125945 00000 n 
+0000126104 00000 n 
+0000126262 00000 n 
+0000126420 00000 n 
+0000126579 00000 n 
+0000126738 00000 n 
+0000126897 00000 n 
+0000127056 00000 n 
+0000127215 00000 n 
+0000127373 00000 n 
+0000127531 00000 n 
+0000127690 00000 n 
+0000127849 00000 n 
+0000128008 00000 n 
+0000128167 00000 n 
+0000128326 00000 n 
+0000128484 00000 n 
+0000130553 00000 n 
+0000128641 00000 n 
+0000128859 00000 n 
+0000123671 00000 n 
+0000122699 00000 n 
+0000128803 00000 n 
+0000130712 00000 n 
+0000130871 00000 n 
+0000131030 00000 n 
+0000131189 00000 n 
+0000131348 00000 n 
+0000131507 00000 n 
+0000131666 00000 n 
+0000131825 00000 n 
+0000131984 00000 n 
+0000132143 00000 n 
+0000132300 00000 n 
+0000132455 00000 n 
+0000132614 00000 n 
+0000132773 00000 n 
+0000132932 00000 n 
+0000133091 00000 n 
+0000133249 00000 n 
+0000133407 00000 n 
+0000133566 00000 n 
+0000133725 00000 n 
+0000133884 00000 n 
+0000134043 00000 n 
+0000134202 00000 n 
+0000134400 00000 n 
+0000134558 00000 n 
+0000134764 00000 n 
+0000137110 00000 n 
+0000137318 00000 n 
+0000134920 00000 n 
+0000135252 00000 n 
+0000130198 00000 n 
+0000128985 00000 n 
+0000135084 00000 n 
+0000993325 00000 n 
+0000202686 00000 n 
+0000206533 00000 n 
+0000137476 00000 n 
+0000137690 00000 n 
+0000137848 00000 n 
+0000138053 00000 n 
+0000138210 00000 n 
+0000138411 00000 n 
+0000138569 00000 n 
+0000138759 00000 n 
+0000138916 00000 n 
+0000139104 00000 n 
+0000139262 00000 n 
+0000139455 00000 n 
+0000139612 00000 n 
+0000139799 00000 n 
+0000139958 00000 n 
+0000140153 00000 n 
+0000140312 00000 n 
+0000140499 00000 n 
+0000140658 00000 n 
+0000140853 00000 n 
+0000141012 00000 n 
+0000141211 00000 n 
+0000141370 00000 n 
+0000141571 00000 n 
+0000141730 00000 n 
+0000141925 00000 n 
+0000142084 00000 n 
+0000142285 00000 n 
+0000142444 00000 n 
+0000142629 00000 n 
+0000142788 00000 n 
+0000142982 00000 n 
+0000143141 00000 n 
+0000143331 00000 n 
+0000143490 00000 n 
+0000143680 00000 n 
+0000145932 00000 n 
+0000146132 00000 n 
+0000143837 00000 n 
+0000144055 00000 n 
+0000136667 00000 n 
+0000135404 00000 n 
+0000143999 00000 n 
+0000206825 00000 n 
+0000207176 00000 n 
+0000210487 00000 n 
+0000210956 00000 n 
+0000219520 00000 n 
+0000235790 00000 n 
+0000242267 00000 n 
+0000242618 00000 n 
+0000248526 00000 n 
+0000248936 00000 n 
+0000254628 00000 n 
+0000258168 00000 n 
+0000258579 00000 n 
+0000264340 00000 n 
+0000264632 00000 n 
+0000273817 00000 n 
+0000274228 00000 n 
+0000281418 00000 n 
+0000146291 00000 n 
+0000146488 00000 n 
+0000146647 00000 n 
+0000146851 00000 n 
+0000147010 00000 n 
+0000147189 00000 n 
+0000147348 00000 n 
+0000147548 00000 n 
+0000147706 00000 n 
+0000147901 00000 n 
+0000148060 00000 n 
+0000148267 00000 n 
+0000148425 00000 n 
+0000148632 00000 n 
+0000148791 00000 n 
+0000148990 00000 n 
+0000149149 00000 n 
+0000149351 00000 n 
+0000149510 00000 n 
+0000149718 00000 n 
+0000149877 00000 n 
+0000150082 00000 n 
+0000150241 00000 n 
+0000150441 00000 n 
+0000150600 00000 n 
+0000150789 00000 n 
+0000150948 00000 n 
+0000151144 00000 n 
+0000151333 00000 n 
+0000151492 00000 n 
+0000151685 00000 n 
+0000151844 00000 n 
+0000152047 00000 n 
+0000152206 00000 n 
+0000152403 00000 n 
+0000152562 00000 n 
+0000152762 00000 n 
+0000155037 00000 n 
+0000155231 00000 n 
+0000152919 00000 n 
+0000153139 00000 n 
+0000145481 00000 n 
+0000144194 00000 n 
+0000153083 00000 n 
+0000285454 00000 n 
+0000289555 00000 n 
+0000289907 00000 n 
+0000293105 00000 n 
+0000293574 00000 n 
+0000300820 00000 n 
+0000308970 00000 n 
+0000317008 00000 n 
+0000326275 00000 n 
+0000335452 00000 n 
+0000345727 00000 n 
+0000353745 00000 n 
+0000361188 00000 n 
+0000369062 00000 n 
+0000401697 00000 n 
+0000402049 00000 n 
+0000405199 00000 n 
+0000405492 00000 n 
+0000155390 00000 n 
+0000155585 00000 n 
+0000155744 00000 n 
+0000155932 00000 n 
+0000156091 00000 n 
+0000156304 00000 n 
+0000156463 00000 n 
+0000156678 00000 n 
+0000156837 00000 n 
+0000157032 00000 n 
+0000157221 00000 n 
+0000157380 00000 n 
+0000157574 00000 n 
+0000157733 00000 n 
+0000157925 00000 n 
+0000158084 00000 n 
+0000158294 00000 n 
+0000158483 00000 n 
+0000158641 00000 n 
+0000158859 00000 n 
+0000159067 00000 n 
+0000159225 00000 n 
+0000159421 00000 n 
+0000159580 00000 n 
+0000159776 00000 n 
+0000159935 00000 n 
+0000160122 00000 n 
+0000160281 00000 n 
+0000160472 00000 n 
+0000160631 00000 n 
+0000160826 00000 n 
+0000160984 00000 n 
+0000161169 00000 n 
+0000161327 00000 n 
+0000161528 00000 n 
+0000161713 00000 n 
+0000161872 00000 n 
+0000162061 00000 n 
+0000162219 00000 n 
+0000162492 00000 n 
+0000154578 00000 n 
+0000153278 00000 n 
+0000162381 00000 n 
+0000427902 00000 n 
+0000435063 00000 n 
+0000435415 00000 n 
+0000465885 00000 n 
+0000466235 00000 n 
+0000469724 00000 n 
+0000470016 00000 n 
+0000477127 00000 n 
+0000495432 00000 n 
+0000502063 00000 n 
+0000508725 00000 n 
+0000512846 00000 n 
+0000513375 00000 n 
+0000656512 00000 n 
+0000657040 00000 n 
+0000661417 00000 n 
+0000665276 00000 n 
+0000665451 00000 n 
+0000164325 00000 n 
+0000164501 00000 n 
+0000164709 00000 n 
+0000164917 00000 n 
+0000165131 00000 n 
+0000165334 00000 n 
+0000165535 00000 n 
+0000165723 00000 n 
+0000165915 00000 n 
+0000166102 00000 n 
+0000166297 00000 n 
+0000166484 00000 n 
+0000166679 00000 n 
+0000166878 00000 n 
+0000167078 00000 n 
+0000167273 00000 n 
+0000167474 00000 n 
+0000167659 00000 n 
+0000167848 00000 n 
+0000168057 00000 n 
+0000170567 00000 n 
+0000170787 00000 n 
+0000170996 00000 n 
+0000168243 00000 n 
+0000168690 00000 n 
+0000164026 00000 n 
+0000162618 00000 n 
+0000168407 00000 n 
+0000168463 00000 n 
+0000168576 00000 n 
+0000168633 00000 n 
+0000171182 00000 n 
+0000171375 00000 n 
+0000171566 00000 n 
+0000171757 00000 n 
+0000171957 00000 n 
+0000172154 00000 n 
+0000172358 00000 n 
+0000172537 00000 n 
+0000172738 00000 n 
+0000172932 00000 n 
+0000173140 00000 n 
+0000173347 00000 n 
+0000173547 00000 n 
+0000173749 00000 n 
+0000173958 00000 n 
+0000174163 00000 n 
+0000174363 00000 n 
+0000174552 00000 n 
+0000174747 00000 n 
+0000174936 00000 n 
+0000175130 00000 n 
+0000175332 00000 n 
+0000177721 00000 n 
+0000177923 00000 n 
+0000175530 00000 n 
+0000175748 00000 n 
+0000170228 00000 n 
+0000168855 00000 n 
+0000175692 00000 n 
+0000178117 00000 n 
+0000178306 00000 n 
+0000178520 00000 n 
+0000178735 00000 n 
+0000178931 00000 n 
+0000179120 00000 n 
+0000179316 00000 n 
+0000179506 00000 n 
+0000179701 00000 n 
+0000179886 00000 n 
+0000180085 00000 n 
+0000180270 00000 n 
+0000180468 00000 n 
+0000180676 00000 n 
+0000180882 00000 n 
+0000181096 00000 n 
+0000181301 00000 n 
+0000183761 00000 n 
+0000183949 00000 n 
+0000181501 00000 n 
+0000182003 00000 n 
+0000177430 00000 n 
+0000175900 00000 n 
+0000181665 00000 n 
+0000181721 00000 n 
+0000181946 00000 n 
+0000993443 00000 n 
+0000184142 00000 n 
+0000184326 00000 n 
+0000184520 00000 n 
+0000184706 00000 n 
+0000184901 00000 n 
+0000185101 00000 n 
+0000185302 00000 n 
+0000185497 00000 n 
+0000185698 00000 n 
+0000185885 00000 n 
+0000186075 00000 n 
+0000186285 00000 n 
+0000186474 00000 n 
+0000186693 00000 n 
+0000186902 00000 n 
+0000187087 00000 n 
+0000187281 00000 n 
+0000187472 00000 n 
+0000187664 00000 n 
+0000187864 00000 n 
+0000188061 00000 n 
+0000188266 00000 n 
+0000188444 00000 n 
+0000190668 00000 n 
+0000190863 00000 n 
+0000188644 00000 n 
+0000188862 00000 n 
+0000183422 00000 n 
+0000182168 00000 n 
+0000188806 00000 n 
+0000191071 00000 n 
+0000191276 00000 n 
+0000191475 00000 n 
+0000191676 00000 n 
+0000191885 00000 n 
+0000192090 00000 n 
+0000192289 00000 n 
+0000192478 00000 n 
+0000192674 00000 n 
+0000192863 00000 n 
+0000193057 00000 n 
+0000193260 00000 n 
+0000193459 00000 n 
+0000193661 00000 n 
+0000193855 00000 n 
+0000194051 00000 n 
+0000194240 00000 n 
+0000194454 00000 n 
+0000194669 00000 n 
+0000194864 00000 n 
+0000195053 00000 n 
+0000195249 00000 n 
+0000195440 00000 n 
+0000198326 00000 n 
+0000198522 00000 n 
+0000195635 00000 n 
+0000195855 00000 n 
+0000190329 00000 n 
+0000189001 00000 n 
+0000195799 00000 n 
+0000198714 00000 n 
+0000198909 00000 n 
+0000199094 00000 n 
+0000199295 00000 n 
+0000199479 00000 n 
+0000199670 00000 n 
+0000199901 00000 n 
+0000200096 00000 n 
+0000200284 00000 n 
+0000200477 00000 n 
+0000200709 00000 n 
+0000200896 00000 n 
+0000201128 00000 n 
+0000201357 00000 n 
+0000201587 00000 n 
+0000201785 00000 n 
+0000201979 00000 n 
+0000202166 00000 n 
+0000205189 00000 n 
+0000202355 00000 n 
+0000203198 00000 n 
+0000198027 00000 n 
+0000196007 00000 n 
+0000202517 00000 n 
+0000202573 00000 n 
+0000202799 00000 n 
+0000202856 00000 n 
+0000202913 00000 n 
+0000202970 00000 n 
+0000203027 00000 n 
+0000203084 00000 n 
+0000203141 00000 n 
+0000205378 00000 n 
+0000205619 00000 n 
+0000205826 00000 n 
+0000206068 00000 n 
+0000206310 00000 n 
+0000207233 00000 n 
+0000205003 00000 n 
+0000203363 00000 n 
+0000206475 00000 n 
+0000206648 00000 n 
+0000206707 00000 n 
+0000206766 00000 n 
+0000206940 00000 n 
+0000206999 00000 n 
+0000207058 00000 n 
+0000207117 00000 n 
+0000208830 00000 n 
+0000209078 00000 n 
+0000209316 00000 n 
+0000209555 00000 n 
+0000209793 00000 n 
+0000216437 00000 n 
+0000216672 00000 n 
+0000210032 00000 n 
+0000211071 00000 n 
+0000208642 00000 n 
+0000207399 00000 n 
+0000210195 00000 n 
+0000210310 00000 n 
+0000210369 00000 n 
+0000210428 00000 n 
+0000210602 00000 n 
+0000210661 00000 n 
+0000210720 00000 n 
+0000210779 00000 n 
+0000210838 00000 n 
+0000210897 00000 n 
+0000989074 00000 n 
+0000216908 00000 n 
+0000212974 00000 n 
+0000216369 00000 n 
+0000217143 00000 n 
+0000217367 00000 n 
+0000217562 00000 n 
+0000217787 00000 n 
+0000217978 00000 n 
+0000218202 00000 n 
+0000218392 00000 n 
+0000218585 00000 n 
+0000218808 00000 n 
+0000222646 00000 n 
+0000222871 00000 n 
+0000219002 00000 n 
+0000219753 00000 n 
+0000212706 00000 n 
+0000211239 00000 n 
+0000219167 00000 n 
+0000219225 00000 n 
+0000219284 00000 n 
+0000219343 00000 n 
+0000219402 00000 n 
+0000219461 00000 n 
+0000219635 00000 n 
+0000219694 00000 n 
+0000993563 00000 n 
+0000213725 00000 n 
+0000213856 00000 n 
+0000214006 00000 n 
+0000214274 00000 n 
+0000214653 00000 n 
+0000214891 00000 n 
+0000214913 00000 n 
+0000216346 00000 n 
+0000226425 00000 n 
+0000226543 00000 n 
+0000230379 00000 n 
+0000223067 00000 n 
+0000223291 00000 n 
+0000223516 00000 n 
+0000223741 00000 n 
+0000223935 00000 n 
+0000224160 00000 n 
+0000224354 00000 n 
+0000224579 00000 n 
+0000224770 00000 n 
+0000224960 00000 n 
+0000225185 00000 n 
+0000225376 00000 n 
+0000225567 00000 n 
+0000225792 00000 n 
+0000226601 00000 n 
+0000222367 00000 n 
+0000219933 00000 n 
+0000225955 00000 n 
+0000226013 00000 n 
+0000992315 00000 n 
+0000226072 00000 n 
+0000226131 00000 n 
+0000226190 00000 n 
+0000226249 00000 n 
+0000226308 00000 n 
+0000226367 00000 n 
+0000226484 00000 n 
+0000991783 00000 n 
+0000230502 00000 n 
+0000230625 00000 n 
+0000230748 00000 n 
+0000230928 00000 n 
+0000231104 00000 n 
+0000229688 00000 n 
+0000230097 00000 n 
+0000231222 00000 n 
+0000229526 00000 n 
+0000226809 00000 n 
+0000230262 00000 n 
+0000230320 00000 n 
+0000230443 00000 n 
+0000230566 00000 n 
+0000230689 00000 n 
+0000230811 00000 n 
+0000230869 00000 n 
+0000230987 00000 n 
+0000231046 00000 n 
+0000229894 00000 n 
+0000231163 00000 n 
+0000233417 00000 n 
+0000233638 00000 n 
+0000233860 00000 n 
+0000234081 00000 n 
+0000234302 00000 n 
+0000234524 00000 n 
+0000234712 00000 n 
+0000234934 00000 n 
+0000235157 00000 n 
+0000235380 00000 n 
+0000235569 00000 n 
+0000236725 00000 n 
+0000233183 00000 n 
+0000231403 00000 n 
+0000235732 00000 n 
+0000235905 00000 n 
+0000235963 00000 n 
+0000236021 00000 n 
+0000236080 00000 n 
+0000236139 00000 n 
+0000236198 00000 n 
+0000236257 00000 n 
+0000236316 00000 n 
+0000236373 00000 n 
+0000236430 00000 n 
+0000236489 00000 n 
+0000236548 00000 n 
+0000236607 00000 n 
+0000236666 00000 n 
+0000238710 00000 n 
+0000238935 00000 n 
+0000239162 00000 n 
+0000239382 00000 n 
+0000239577 00000 n 
+0000239772 00000 n 
+0000239960 00000 n 
+0000240153 00000 n 
+0000240373 00000 n 
+0000240566 00000 n 
+0000240787 00000 n 
+0000240975 00000 n 
+0000241197 00000 n 
+0000241416 00000 n 
+0000241636 00000 n 
+0000241823 00000 n 
+0000242044 00000 n 
+0000243264 00000 n 
+0000238422 00000 n 
+0000236906 00000 n 
+0000242209 00000 n 
+0000242382 00000 n 
+0000242441 00000 n 
+0000242500 00000 n 
+0000242559 00000 n 
+0000242733 00000 n 
+0000242792 00000 n 
+0000990962 00000 n 
+0000990095 00000 n 
+0000242851 00000 n 
+0000242910 00000 n 
+0000242969 00000 n 
+0000243028 00000 n 
+0000243087 00000 n 
+0000243146 00000 n 
+0000243205 00000 n 
+0000245777 00000 n 
+0000245964 00000 n 
+0000246191 00000 n 
+0000246418 00000 n 
+0000246646 00000 n 
+0000246841 00000 n 
+0000247029 00000 n 
+0000247250 00000 n 
+0000247446 00000 n 
+0000247639 00000 n 
+0000247835 00000 n 
+0000248027 00000 n 
+0000251180 00000 n 
+0000251374 00000 n 
+0000248246 00000 n 
+0000249227 00000 n 
+0000245525 00000 n 
+0000243460 00000 n 
+0000248409 00000 n 
+0000248467 00000 n 
+0000988782 00000 n 
+0000989367 00000 n 
+0000990528 00000 n 
+0000989950 00000 n 
+0000248642 00000 n 
+0000248701 00000 n 
+0000248760 00000 n 
+0000248818 00000 n 
+0000248877 00000 n 
+0000249051 00000 n 
+0000249110 00000 n 
+0000249169 00000 n 
+0000251596 00000 n 
+0000251788 00000 n 
+0000252010 00000 n 
+0000252229 00000 n 
+0000252449 00000 n 
+0000252636 00000 n 
+0000252865 00000 n 
+0000253092 00000 n 
+0000253319 00000 n 
+0000253513 00000 n 
+0000253699 00000 n 
+0000254684 00000 n 
+0000250928 00000 n 
+0000249485 00000 n 
+0000253864 00000 n 
+0000253922 00000 n 
+0000253981 00000 n 
+0000254040 00000 n 
+0000254099 00000 n 
+0000254158 00000 n 
+0000254333 00000 n 
+0000254392 00000 n 
+0000254451 00000 n 
+0000254510 00000 n 
+0000254569 00000 n 
+0000993688 00000 n 
+0000256357 00000 n 
+0000256591 00000 n 
+0000256825 00000 n 
+0000257060 00000 n 
+0000257249 00000 n 
+0000257484 00000 n 
+0000257712 00000 n 
+0000258811 00000 n 
+0000256159 00000 n 
+0000254863 00000 n 
+0000257875 00000 n 
+0000257991 00000 n 
+0000258050 00000 n 
+0000258109 00000 n 
+0000258284 00000 n 
+0000258343 00000 n 
+0000258402 00000 n 
+0000258461 00000 n 
+0000258520 00000 n 
+0000258695 00000 n 
+0000258753 00000 n 
+0000260759 00000 n 
+0000260994 00000 n 
+0000261185 00000 n 
+0000261406 00000 n 
+0000261600 00000 n 
+0000261821 00000 n 
+0000262009 00000 n 
+0000262230 00000 n 
+0000262448 00000 n 
+0000262667 00000 n 
+0000262854 00000 n 
+0000263075 00000 n 
+0000263271 00000 n 
+0000263460 00000 n 
+0000263645 00000 n 
+0000263864 00000 n 
+0000267345 00000 n 
+0000267531 00000 n 
+0000267751 00000 n 
+0000267946 00000 n 
+0000264058 00000 n 
+0000265101 00000 n 
+0000260471 00000 n 
+0000258964 00000 n 
+0000264223 00000 n 
+0000264281 00000 n 
+0000264455 00000 n 
+0000264514 00000 n 
+0000264573 00000 n 
+0000264748 00000 n 
+0000264807 00000 n 
+0000264866 00000 n 
+0000264925 00000 n 
+0000264984 00000 n 
+0000265043 00000 n 
+0000273640 00000 n 
+0000269260 00000 n 
+0000269437 00000 n 
+0000268134 00000 n 
+0000268320 00000 n 
+0000268540 00000 n 
+0000268735 00000 n 
+0000268921 00000 n 
+0000269907 00000 n 
+0000267129 00000 n 
+0000265267 00000 n 
+0000269084 00000 n 
+0000269142 00000 n 
+0000269201 00000 n 
+0000269319 00000 n 
+0000269378 00000 n 
+0000269496 00000 n 
+0000269555 00000 n 
+0000269614 00000 n 
+0000269673 00000 n 
+0000269732 00000 n 
+0000269791 00000 n 
+0000269849 00000 n 
+0000272297 00000 n 
+0000272525 00000 n 
+0000272751 00000 n 
+0000272978 00000 n 
+0000273172 00000 n 
+0000276304 00000 n 
+0000273358 00000 n 
+0000274342 00000 n 
+0000272108 00000 n 
+0000270088 00000 n 
+0000273523 00000 n 
+0000273581 00000 n 
+0000273699 00000 n 
+0000273758 00000 n 
+0000273933 00000 n 
+0000273992 00000 n 
+0000274051 00000 n 
+0000274110 00000 n 
+0000274169 00000 n 
+0000276529 00000 n 
+0000276754 00000 n 
+0000276979 00000 n 
+0000277175 00000 n 
+0000277401 00000 n 
+0000277595 00000 n 
+0000277822 00000 n 
+0000278010 00000 n 
+0000278237 00000 n 
+0000278460 00000 n 
+0000278685 00000 n 
+0000278878 00000 n 
+0000279105 00000 n 
+0000279301 00000 n 
+0000279493 00000 n 
+0000279719 00000 n 
+0000279914 00000 n 
+0000280102 00000 n 
+0000280294 00000 n 
+0000280520 00000 n 
+0000280715 00000 n 
+0000284215 00000 n 
+0000280902 00000 n 
+0000281885 00000 n 
+0000275962 00000 n 
+0000274536 00000 n 
+0000281065 00000 n 
+0000281123 00000 n 
+0000281182 00000 n 
+0000281241 00000 n 
+0000281300 00000 n 
+0000281359 00000 n 
+0000281534 00000 n 
+0000281593 00000 n 
+0000281652 00000 n 
+0000281709 00000 n 
+0000281767 00000 n 
+0000281826 00000 n 
+0000285278 00000 n 
+0000284748 00000 n 
+0000284925 00000 n 
+0000285102 00000 n 
+0000284407 00000 n 
+0000285568 00000 n 
+0000284062 00000 n 
+0000282051 00000 n 
+0000284572 00000 n 
+0000284630 00000 n 
+0000284689 00000 n 
+0000284807 00000 n 
+0000284866 00000 n 
+0000284984 00000 n 
+0000285043 00000 n 
+0000285161 00000 n 
+0000285220 00000 n 
+0000285336 00000 n 
+0000285395 00000 n 
+0000993813 00000 n 
+0000287484 00000 n 
+0000287718 00000 n 
+0000287950 00000 n 
+0000288183 00000 n 
+0000288384 00000 n 
+0000288577 00000 n 
+0000288808 00000 n 
+0000292253 00000 n 
+0000289039 00000 n 
+0000290022 00000 n 
+0000287277 00000 n 
+0000285736 00000 n 
+0000289202 00000 n 
+0000289260 00000 n 
+0000289319 00000 n 
+0000289378 00000 n 
+0000289437 00000 n 
+0000289496 00000 n 
+0000289671 00000 n 
+0000289730 00000 n 
+0000289789 00000 n 
+0000289848 00000 n 
+0000292492 00000 n 
+0000292705 00000 n 
+0000293630 00000 n 
+0000292091 00000 n 
+0000290201 00000 n 
+0000292870 00000 n 
+0000292928 00000 n 
+0000292987 00000 n 
+0000293046 00000 n 
+0000293221 00000 n 
+0000293280 00000 n 
+0000293338 00000 n 
+0000293397 00000 n 
+0000293456 00000 n 
+0000293515 00000 n 
+0000300131 00000 n 
+0000295052 00000 n 
+0000300063 00000 n 
+0000300366 00000 n 
+0000300936 00000 n 
+0000294883 00000 n 
+0000293799 00000 n 
+0000300529 00000 n 
+0000300645 00000 n 
+0000300703 00000 n 
+0000300761 00000 n 
+0000296514 00000 n 
+0000296645 00000 n 
+0000296795 00000 n 
+0000297119 00000 n 
+0000297556 00000 n 
+0000297794 00000 n 
+0000297816 00000 n 
+0000300040 00000 n 
+0000303064 00000 n 
+0000303256 00000 n 
+0000303484 00000 n 
+0000303678 00000 n 
+0000303871 00000 n 
+0000304100 00000 n 
+0000304295 00000 n 
+0000304488 00000 n 
+0000304717 00000 n 
+0000304905 00000 n 
+0000305099 00000 n 
+0000305329 00000 n 
+0000305525 00000 n 
+0000305755 00000 n 
+0000305982 00000 n 
+0000306210 00000 n 
+0000306440 00000 n 
+0000306670 00000 n 
+0000306863 00000 n 
+0000307273 00000 n 
+0000307482 00000 n 
+0000307683 00000 n 
+0000307891 00000 n 
+0000310703 00000 n 
+0000314562 00000 n 
+0000308099 00000 n 
+0000309086 00000 n 
+0000302704 00000 n 
+0000301104 00000 n 
+0000308264 00000 n 
+0000308322 00000 n 
+0000308381 00000 n 
+0000308440 00000 n 
+0000308499 00000 n 
+0000308558 00000 n 
+0000308617 00000 n 
+0000308676 00000 n 
+0000308735 00000 n 
+0000308794 00000 n 
+0000308853 00000 n 
+0000308912 00000 n 
+0000307068 00000 n 
+0000314630 00000 n 
+0000314872 00000 n 
+0000315061 00000 n 
+0000315249 00000 n 
+0000315492 00000 n 
+0000315700 00000 n 
+0000315943 00000 n 
+0000316131 00000 n 
+0000318890 00000 n 
+0000322629 00000 n 
+0000316374 00000 n 
+0000317124 00000 n 
+0000310471 00000 n 
+0000309268 00000 n 
+0000316537 00000 n 
+0000316595 00000 n 
+0000316654 00000 n 
+0000316713 00000 n 
+0000316772 00000 n 
+0000316831 00000 n 
+0000316890 00000 n 
+0000316949 00000 n 
+0000311502 00000 n 
+0000311633 00000 n 
+0000311783 00000 n 
+0000312075 00000 n 
+0000312480 00000 n 
+0000312718 00000 n 
+0000312740 00000 n 
+0000314539 00000 n 
+0000322697 00000 n 
+0000322938 00000 n 
+0000323134 00000 n 
+0000323330 00000 n 
+0000323524 00000 n 
+0000323765 00000 n 
+0000323959 00000 n 
+0000324201 00000 n 
+0000324408 00000 n 
+0000324649 00000 n 
+0000324843 00000 n 
+0000325085 00000 n 
+0000325279 00000 n 
+0000328176 00000 n 
+0000331860 00000 n 
+0000325521 00000 n 
+0000326391 00000 n 
+0000318613 00000 n 
+0000317305 00000 n 
+0000325686 00000 n 
+0000325744 00000 n 
+0000325803 00000 n 
+0000325862 00000 n 
+0000325921 00000 n 
+0000325980 00000 n 
+0000326039 00000 n 
+0000326098 00000 n 
+0000326157 00000 n 
+0000326216 00000 n 
+0000993938 00000 n 
+0000319688 00000 n 
+0000319819 00000 n 
+0000319969 00000 n 
+0000320257 00000 n 
+0000320661 00000 n 
+0000320899 00000 n 
+0000320921 00000 n 
+0000322606 00000 n 
+0000331928 00000 n 
+0000332162 00000 n 
+0000332358 00000 n 
+0000332554 00000 n 
+0000332748 00000 n 
+0000332982 00000 n 
+0000333175 00000 n 
+0000333409 00000 n 
+0000333609 00000 n 
+0000333844 00000 n 
+0000334038 00000 n 
+0000334273 00000 n 
+0000334467 00000 n 
+0000337239 00000 n 
+0000340784 00000 n 
+0000334702 00000 n 
+0000335568 00000 n 
+0000327899 00000 n 
+0000326572 00000 n 
+0000334865 00000 n 
+0000334923 00000 n 
+0000334982 00000 n 
+0000335041 00000 n 
+0000335100 00000 n 
+0000335159 00000 n 
+0000335217 00000 n 
+0000335276 00000 n 
+0000335335 00000 n 
+0000335393 00000 n 
+0000328960 00000 n 
+0000329091 00000 n 
+0000329241 00000 n 
+0000329525 00000 n 
+0000329921 00000 n 
+0000330159 00000 n 
+0000330181 00000 n 
+0000331837 00000 n 
+0000340852 00000 n 
+0000341088 00000 n 
+0000341277 00000 n 
+0000341463 00000 n 
+0000341699 00000 n 
+0000341888 00000 n 
+0000342084 00000 n 
+0000342320 00000 n 
+0000342516 00000 n 
+0000342704 00000 n 
+0000342892 00000 n 
+0000343129 00000 n 
+0000343323 00000 n 
+0000343560 00000 n 
+0000343762 00000 n 
+0000343999 00000 n 
+0000344187 00000 n 
+0000344424 00000 n 
+0000344618 00000 n 
+0000344855 00000 n 
+0000345784 00000 n 
+0000336908 00000 n 
+0000335748 00000 n 
+0000345020 00000 n 
+0000345078 00000 n 
+0000345137 00000 n 
+0000345196 00000 n 
+0000345255 00000 n 
+0000345314 00000 n 
+0000345373 00000 n 
+0000345432 00000 n 
+0000345491 00000 n 
+0000345550 00000 n 
+0000345609 00000 n 
+0000345668 00000 n 
+0000338024 00000 n 
+0000338155 00000 n 
+0000338305 00000 n 
+0000338585 00000 n 
+0000338978 00000 n 
+0000339216 00000 n 
+0000339238 00000 n 
+0000340761 00000 n 
+0000347529 00000 n 
+0000351223 00000 n 
+0000351291 00000 n 
+0000351533 00000 n 
+0000351728 00000 n 
+0000351922 00000 n 
+0000352164 00000 n 
+0000352373 00000 n 
+0000352617 00000 n 
+0000352811 00000 n 
+0000355518 00000 n 
+0000359076 00000 n 
+0000353055 00000 n 
+0000353861 00000 n 
+0000347297 00000 n 
+0000345966 00000 n 
+0000353218 00000 n 
+0000353334 00000 n 
+0000353393 00000 n 
+0000353452 00000 n 
+0000353511 00000 n 
+0000353570 00000 n 
+0000353629 00000 n 
+0000353688 00000 n 
+0000348331 00000 n 
+0000348462 00000 n 
+0000348612 00000 n 
+0000348900 00000 n 
+0000349302 00000 n 
+0000349540 00000 n 
+0000349562 00000 n 
+0000351200 00000 n 
+0000359144 00000 n 
+0000359383 00000 n 
+0000359568 00000 n 
+0000359753 00000 n 
+0000359993 00000 n 
+0000360198 00000 n 
+0000360438 00000 n 
+0000360671 00000 n 
+0000361422 00000 n 
+0000355295 00000 n 
+0000354042 00000 n 
+0000360836 00000 n 
+0000360894 00000 n 
+0000360953 00000 n 
+0000361012 00000 n 
+0000361070 00000 n 
+0000361129 00000 n 
+0000361304 00000 n 
+0000361363 00000 n 
+0000356315 00000 n 
+0000356446 00000 n 
+0000356596 00000 n 
+0000356876 00000 n 
+0000357269 00000 n 
+0000357507 00000 n 
+0000357529 00000 n 
+0000359053 00000 n 
+0000363899 00000 n 
+0000364123 00000 n 
+0000364313 00000 n 
+0000364537 00000 n 
+0000364729 00000 n 
+0000364952 00000 n 
+0000365148 00000 n 
+0000365372 00000 n 
+0000365567 00000 n 
+0000365790 00000 n 
+0000365985 00000 n 
+0000366209 00000 n 
+0000366433 00000 n 
+0000366657 00000 n 
+0000366880 00000 n 
+0000367104 00000 n 
+0000367325 00000 n 
+0000367548 00000 n 
+0000367771 00000 n 
+0000367963 00000 n 
+0000368183 00000 n 
+0000368368 00000 n 
+0000368589 00000 n 
+0000372682 00000 n 
+0000372905 00000 n 
+0000373101 00000 n 
+0000373323 00000 n 
+0000368782 00000 n 
+0000369826 00000 n 
+0000363548 00000 n 
+0000361603 00000 n 
+0000368945 00000 n 
+0000369003 00000 n 
+0000369178 00000 n 
+0000369237 00000 n 
+0000369296 00000 n 
+0000369355 00000 n 
+0000369414 00000 n 
+0000369473 00000 n 
+0000369532 00000 n 
+0000369590 00000 n 
+0000369649 00000 n 
+0000369708 00000 n 
+0000369767 00000 n 
+0000390729 00000 n 
+0000390847 00000 n 
+0000391088 00000 n 
+0000391270 00000 n 
+0000391446 00000 n 
+0000373517 00000 n 
+0000373741 00000 n 
+0000373938 00000 n 
+0000374162 00000 n 
+0000374386 00000 n 
+0000374573 00000 n 
+0000374762 00000 n 
+0000375140 00000 n 
+0000375327 00000 n 
+0000375551 00000 n 
+0000375737 00000 n 
+0000375960 00000 n 
+0000376183 00000 n 
+0000376372 00000 n 
+0000376561 00000 n 
+0000376763 00000 n 
+0000376987 00000 n 
+0000377188 00000 n 
+0000377411 00000 n 
+0000377613 00000 n 
+0000377836 00000 n 
+0000378059 00000 n 
+0000378255 00000 n 
+0000378451 00000 n 
+0000378646 00000 n 
+0000378868 00000 n 
+0000379057 00000 n 
+0000379280 00000 n 
+0000379504 00000 n 
+0000380254 00000 n 
+0000372241 00000 n 
+0000369992 00000 n 
+0000379669 00000 n 
+0000379727 00000 n 
+0000374951 00000 n 
+0000989220 00000 n 
+0000379786 00000 n 
+0000379845 00000 n 
+0000379904 00000 n 
+0000379963 00000 n 
+0000380022 00000 n 
+0000380079 00000 n 
+0000380138 00000 n 
+0000380196 00000 n 
+0000994063 00000 n 
+0000396408 00000 n 
+0000396585 00000 n 
+0000396703 00000 n 
+0000396819 00000 n 
+0000397054 00000 n 
+0000401343 00000 n 
+0000401520 00000 n 
+0000384629 00000 n 
+0000384865 00000 n 
+0000383354 00000 n 
+0000383548 00000 n 
+0000383737 00000 n 
+0000383926 00000 n 
+0000384126 00000 n 
+0000384349 00000 n 
+0000385042 00000 n 
+0000383165 00000 n 
+0000380434 00000 n 
+0000384512 00000 n 
+0000384570 00000 n 
+0000384688 00000 n 
+0000384747 00000 n 
+0000384806 00000 n 
+0000384924 00000 n 
+0000384983 00000 n 
+0000388314 00000 n 
+0000388515 00000 n 
+0000388739 00000 n 
+0000389149 00000 n 
+0000389349 00000 n 
+0000389571 00000 n 
+0000389980 00000 n 
+0000390389 00000 n 
+0000391564 00000 n 
+0000388080 00000 n 
+0000385222 00000 n 
+0000390554 00000 n 
+0000390612 00000 n 
+0000388945 00000 n 
+0000390671 00000 n 
+0000390788 00000 n 
+0000390911 00000 n 
+0000390970 00000 n 
+0000391029 00000 n 
+0000391152 00000 n 
+0000391211 00000 n 
+0000389776 00000 n 
+0000391329 00000 n 
+0000391388 00000 n 
+0000390186 00000 n 
+0000391505 00000 n 
+0000394702 00000 n 
+0000395112 00000 n 
+0000395521 00000 n 
+0000395718 00000 n 
+0000396128 00000 n 
+0000397172 00000 n 
+0000394495 00000 n 
+0000391744 00000 n 
+0000396291 00000 n 
+0000396349 00000 n 
+0000394908 00000 n 
+0000396467 00000 n 
+0000396526 00000 n 
+0000395318 00000 n 
+0000396644 00000 n 
+0000396760 00000 n 
+0000396878 00000 n 
+0000396937 00000 n 
+0000396996 00000 n 
+0000395924 00000 n 
+0000397113 00000 n 
+0000399618 00000 n 
+0000399819 00000 n 
+0000400020 00000 n 
+0000400221 00000 n 
+0000400411 00000 n 
+0000400641 00000 n 
+0000400871 00000 n 
+0000403870 00000 n 
+0000401061 00000 n 
+0000402165 00000 n 
+0000399411 00000 n 
+0000397354 00000 n 
+0000401226 00000 n 
+0000401284 00000 n 
+0000401402 00000 n 
+0000401461 00000 n 
+0000401579 00000 n 
+0000401638 00000 n 
+0000401813 00000 n 
+0000401872 00000 n 
+0000401931 00000 n 
+0000401990 00000 n 
+0000404098 00000 n 
+0000404335 00000 n 
+0000404569 00000 n 
+0000404801 00000 n 
+0000405785 00000 n 
+0000403690 00000 n 
+0000402347 00000 n 
+0000404964 00000 n 
+0000405022 00000 n 
+0000405081 00000 n 
+0000405140 00000 n 
+0000405315 00000 n 
+0000405374 00000 n 
+0000405433 00000 n 
+0000405608 00000 n 
+0000405667 00000 n 
+0000405726 00000 n 
+0000407760 00000 n 
+0000407997 00000 n 
+0000408233 00000 n 
+0000408470 00000 n 
+0000408707 00000 n 
+0000408942 00000 n 
+0000409179 00000 n 
+0000409416 00000 n 
+0000409653 00000 n 
+0000409890 00000 n 
+0000410127 00000 n 
+0000410364 00000 n 
+0000414263 00000 n 
+0000414500 00000 n 
+0000414736 00000 n 
+0000410600 00000 n 
+0000411410 00000 n 
+0000407508 00000 n 
+0000405952 00000 n 
+0000410765 00000 n 
+0000410823 00000 n 
+0000410998 00000 n 
+0000411056 00000 n 
+0000411115 00000 n 
+0000411174 00000 n 
+0000411233 00000 n 
+0000411292 00000 n 
+0000411351 00000 n 
+0000994188 00000 n 
+0000416813 00000 n 
+0000416931 00000 n 
+0000417053 00000 n 
+0000417176 00000 n 
+0000417294 00000 n 
+0000417417 00000 n 
+0000414973 00000 n 
+0000415210 00000 n 
+0000415412 00000 n 
+0000415648 00000 n 
+0000416121 00000 n 
+0000416356 00000 n 
+0000417480 00000 n 
+0000414038 00000 n 
+0000411563 00000 n 
+0000416519 00000 n 
+0000416577 00000 n 
+0000416636 00000 n 
+0000416695 00000 n 
+0000416754 00000 n 
+0000416872 00000 n 
+0000416994 00000 n 
+0000417117 00000 n 
+0000417235 00000 n 
+0000415885 00000 n 
+0000417358 00000 n 
+0000423073 00000 n 
+0000423255 00000 n 
+0000421047 00000 n 
+0000421242 00000 n 
+0000421714 00000 n 
+0000421909 00000 n 
+0000422381 00000 n 
+0000422791 00000 n 
+0000423495 00000 n 
+0000420831 00000 n 
+0000417633 00000 n 
+0000422956 00000 n 
+0000423014 00000 n 
+0000423137 00000 n 
+0000423196 00000 n 
+0000421478 00000 n 
+0000423319 00000 n 
+0000422145 00000 n 
+0000423377 00000 n 
+0000423436 00000 n 
+0000422587 00000 n 
+0000426081 00000 n 
+0000426309 00000 n 
+0000426537 00000 n 
+0000426766 00000 n 
+0000426995 00000 n 
+0000427224 00000 n 
+0000427452 00000 n 
+0000427681 00000 n 
+0000428728 00000 n 
+0000425874 00000 n 
+0000423715 00000 n 
+0000427844 00000 n 
+0000428018 00000 n 
+0000428076 00000 n 
+0000428134 00000 n 
+0000428193 00000 n 
+0000428252 00000 n 
+0000428311 00000 n 
+0000428370 00000 n 
+0000428429 00000 n 
+0000428488 00000 n 
+0000428547 00000 n 
+0000428606 00000 n 
+0000428665 00000 n 
+0000430605 00000 n 
+0000434289 00000 n 
+0000434357 00000 n 
+0000434550 00000 n 
+0000434781 00000 n 
+0000435530 00000 n 
+0000430427 00000 n 
+0000428895 00000 n 
+0000434946 00000 n 
+0000435004 00000 n 
+0000435179 00000 n 
+0000435238 00000 n 
+0000435297 00000 n 
+0000435356 00000 n 
+0000431392 00000 n 
+0000431523 00000 n 
+0000431673 00000 n 
+0000431961 00000 n 
+0000432360 00000 n 
+0000432598 00000 n 
+0000432620 00000 n 
+0000434266 00000 n 
+0000438027 00000 n 
+0000438249 00000 n 
+0000438472 00000 n 
+0000438668 00000 n 
+0000438860 00000 n 
+0000439083 00000 n 
+0000439273 00000 n 
+0000439496 00000 n 
+0000439720 00000 n 
+0000439910 00000 n 
+0000440133 00000 n 
+0000440357 00000 n 
+0000440549 00000 n 
+0000440772 00000 n 
+0000440996 00000 n 
+0000441220 00000 n 
+0000441408 00000 n 
+0000441631 00000 n 
+0000441827 00000 n 
+0000442051 00000 n 
+0000442275 00000 n 
+0000442499 00000 n 
+0000442722 00000 n 
+0000442946 00000 n 
+0000443170 00000 n 
+0000443392 00000 n 
+0000443615 00000 n 
+0000443837 00000 n 
+0000444028 00000 n 
+0000448022 00000 n 
+0000448245 00000 n 
+0000448433 00000 n 
+0000448655 00000 n 
+0000444249 00000 n 
+0000445530 00000 n 
+0000437622 00000 n 
+0000435726 00000 n 
+0000444412 00000 n 
+0000444470 00000 n 
+0000444529 00000 n 
+0000444588 00000 n 
+0000444647 00000 n 
+0000444706 00000 n 
+0000444764 00000 n 
+0000444823 00000 n 
+0000444882 00000 n 
+0000444941 00000 n 
+0000445000 00000 n 
+0000445059 00000 n 
+0000445118 00000 n 
+0000445177 00000 n 
+0000445236 00000 n 
+0000445295 00000 n 
+0000445354 00000 n 
+0000445413 00000 n 
+0000445472 00000 n 
+0000456879 00000 n 
+0000457115 00000 n 
+0000461529 00000 n 
+0000461647 00000 n 
+0000448849 00000 n 
+0000449073 00000 n 
+0000449270 00000 n 
+0000449493 00000 n 
+0000449686 00000 n 
+0000449910 00000 n 
+0000450103 00000 n 
+0000450327 00000 n 
+0000450542 00000 n 
+0000450766 00000 n 
+0000451196 00000 n 
+0000451418 00000 n 
+0000451633 00000 n 
+0000451857 00000 n 
+0000452493 00000 n 
+0000447716 00000 n 
+0000445696 00000 n 
+0000452022 00000 n 
+0000452080 00000 n 
+0000452139 00000 n 
+0000452198 00000 n 
+0000450981 00000 n 
+0000452257 00000 n 
+0000452316 00000 n 
+0000452375 00000 n 
+0000452434 00000 n 
+0000994313 00000 n 
+0000461829 00000 n 
+0000462011 00000 n 
+0000462187 00000 n 
+0000465767 00000 n 
+0000455985 00000 n 
+0000456174 00000 n 
+0000456375 00000 n 
+0000456599 00000 n 
+0000457231 00000 n 
+0000455814 00000 n 
+0000452659 00000 n 
+0000456762 00000 n 
+0000456820 00000 n 
+0000456938 00000 n 
+0000456997 00000 n 
+0000457056 00000 n 
+0000457173 00000 n 
+0000460427 00000 n 
+0000460837 00000 n 
+0000461247 00000 n 
+0000462305 00000 n 
+0000460247 00000 n 
+0000457411 00000 n 
+0000461412 00000 n 
+0000461470 00000 n 
+0000461588 00000 n 
+0000461711 00000 n 
+0000461770 00000 n 
+0000461893 00000 n 
+0000461952 00000 n 
+0000460633 00000 n 
+0000462070 00000 n 
+0000462128 00000 n 
+0000461043 00000 n 
+0000462246 00000 n 
+0000464304 00000 n 
+0000464552 00000 n 
+0000464800 00000 n 
+0000465049 00000 n 
+0000465298 00000 n 
+0000468217 00000 n 
+0000468466 00000 n 
+0000465546 00000 n 
+0000466587 00000 n 
+0000464115 00000 n 
+0000462485 00000 n 
+0000465709 00000 n 
+0000465826 00000 n 
+0000466001 00000 n 
+0000466059 00000 n 
+0000466117 00000 n 
+0000466176 00000 n 
+0000466351 00000 n 
+0000466410 00000 n 
+0000466469 00000 n 
+0000466528 00000 n 
+0000468715 00000 n 
+0000468905 00000 n 
+0000469134 00000 n 
+0000472106 00000 n 
+0000475813 00000 n 
+0000469324 00000 n 
+0000470132 00000 n 
+0000468028 00000 n 
+0000466741 00000 n 
+0000469489 00000 n 
+0000469547 00000 n 
+0000469606 00000 n 
+0000469665 00000 n 
+0000469839 00000 n 
+0000469898 00000 n 
+0000469957 00000 n 
+0000475881 00000 n 
+0000476077 00000 n 
+0000476308 00000 n 
+0000479263 00000 n 
+0000483333 00000 n 
+0000476494 00000 n 
+0000477243 00000 n 
+0000471919 00000 n 
+0000470286 00000 n 
+0000476657 00000 n 
+0000476715 00000 n 
+0000476774 00000 n 
+0000476833 00000 n 
+0000476892 00000 n 
+0000476951 00000 n 
+0000477010 00000 n 
+0000477069 00000 n 
+0000472891 00000 n 
+0000473022 00000 n 
+0000473172 00000 n 
+0000473460 00000 n 
+0000473861 00000 n 
+0000474099 00000 n 
+0000474121 00000 n 
+0000475790 00000 n 
+0000483401 00000 n 
+0000483595 00000 n 
+0000483819 00000 n 
+0000484016 00000 n 
+0000484243 00000 n 
+0000484470 00000 n 
+0000484697 00000 n 
+0000484890 00000 n 
+0000485098 00000 n 
+0000485325 00000 n 
+0000485515 00000 n 
+0000485710 00000 n 
+0000485936 00000 n 
+0000486128 00000 n 
+0000486352 00000 n 
+0000486547 00000 n 
+0000490272 00000 n 
+0000486740 00000 n 
+0000487492 00000 n 
+0000478959 00000 n 
+0000477439 00000 n 
+0000486905 00000 n 
+0000486963 00000 n 
+0000487021 00000 n 
+0000487079 00000 n 
+0000487138 00000 n 
+0000487197 00000 n 
+0000487256 00000 n 
+0000487315 00000 n 
+0000487374 00000 n 
+0000487433 00000 n 
+0000994438 00000 n 
+0000480175 00000 n 
+0000480306 00000 n 
+0000480456 00000 n 
+0000480756 00000 n 
+0000481167 00000 n 
+0000481405 00000 n 
+0000481427 00000 n 
+0000483310 00000 n 
+0000495314 00000 n 
+0000490465 00000 n 
+0000490656 00000 n 
+0000490900 00000 n 
+0000491144 00000 n 
+0000491389 00000 n 
+0000491600 00000 n 
+0000491844 00000 n 
+0000492054 00000 n 
+0000492274 00000 n 
+0000492518 00000 n 
+0000492739 00000 n 
+0000492984 00000 n 
+0000493228 00000 n 
+0000493419 00000 n 
+0000493663 00000 n 
+0000493884 00000 n 
+0000494129 00000 n 
+0000494350 00000 n 
+0000494791 00000 n 
+0000498731 00000 n 
+0000495034 00000 n 
+0000496137 00000 n 
+0000489939 00000 n 
+0000487673 00000 n 
+0000495197 00000 n 
+0000495255 00000 n 
+0000495373 00000 n 
+0000495548 00000 n 
+0000495607 00000 n 
+0000495666 00000 n 
+0000495724 00000 n 
+0000495783 00000 n 
+0000495842 00000 n 
+0000495901 00000 n 
+0000495960 00000 n 
+0000496019 00000 n 
+0000494571 00000 n 
+0000496078 00000 n 
+0000501945 00000 n 
+0000498922 00000 n 
+0000499133 00000 n 
+0000499387 00000 n 
+0000499608 00000 n 
+0000499861 00000 n 
+0000500081 00000 n 
+0000500336 00000 n 
+0000500591 00000 n 
+0000500782 00000 n 
+0000501037 00000 n 
+0000501291 00000 n 
+0000505075 00000 n 
+0000501545 00000 n 
+0000502651 00000 n 
+0000498479 00000 n 
+0000496303 00000 n 
+0000501710 00000 n 
+0000501768 00000 n 
+0000501827 00000 n 
+0000501886 00000 n 
+0000502004 00000 n 
+0000502179 00000 n 
+0000502238 00000 n 
+0000502297 00000 n 
+0000502356 00000 n 
+0000502415 00000 n 
+0000502474 00000 n 
+0000502533 00000 n 
+0000502592 00000 n 
+0000508607 00000 n 
+0000505286 00000 n 
+0000505477 00000 n 
+0000505707 00000 n 
+0000505938 00000 n 
+0000506134 00000 n 
+0000506331 00000 n 
+0000506562 00000 n 
+0000506759 00000 n 
+0000506990 00000 n 
+0000507186 00000 n 
+0000507416 00000 n 
+0000507613 00000 n 
+0000507844 00000 n 
+0000508039 00000 n 
+0000508268 00000 n 
+0000509371 00000 n 
+0000504796 00000 n 
+0000502817 00000 n 
+0000508431 00000 n 
+0000508489 00000 n 
+0000508548 00000 n 
+0000508666 00000 n 
+0000508841 00000 n 
+0000508900 00000 n 
+0000508959 00000 n 
+0000509018 00000 n 
+0000509077 00000 n 
+0000509136 00000 n 
+0000509195 00000 n 
+0000509254 00000 n 
+0000509313 00000 n 
+0000511051 00000 n 
+0000511281 00000 n 
+0000511512 00000 n 
+0000511708 00000 n 
+0000511905 00000 n 
+0000512136 00000 n 
+0000512333 00000 n 
+0000515482 00000 n 
+0000518867 00000 n 
+0000512564 00000 n 
+0000513491 00000 n 
+0000510844 00000 n 
+0000509538 00000 n 
+0000512729 00000 n 
+0000512787 00000 n 
+0000512962 00000 n 
+0000513021 00000 n 
+0000513080 00000 n 
+0000513139 00000 n 
+0000513198 00000 n 
+0000513257 00000 n 
+0000513316 00000 n 
+0000518935 00000 n 
+0000519157 00000 n 
+0000519379 00000 n 
+0000519575 00000 n 
+0000519797 00000 n 
+0000519993 00000 n 
+0000520215 00000 n 
+0000520411 00000 n 
+0000520633 00000 n 
+0000520829 00000 n 
+0000521051 00000 n 
+0000521273 00000 n 
+0000521495 00000 n 
+0000521717 00000 n 
+0000521939 00000 n 
+0000522161 00000 n 
+0000522381 00000 n 
+0000522602 00000 n 
+0000522787 00000 n 
+0000523007 00000 n 
+0000527157 00000 n 
+0000527378 00000 n 
+0000527573 00000 n 
+0000527794 00000 n 
+0000527990 00000 n 
+0000528179 00000 n 
+0000523201 00000 n 
+0000524188 00000 n 
+0000515142 00000 n 
+0000513657 00000 n 
+0000523364 00000 n 
+0000523422 00000 n 
+0000523481 00000 n 
+0000523539 00000 n 
+0000523598 00000 n 
+0000523657 00000 n 
+0000523716 00000 n 
+0000523775 00000 n 
+0000523834 00000 n 
+0000523893 00000 n 
+0000523952 00000 n 
+0000524011 00000 n 
+0000524070 00000 n 
+0000524129 00000 n 
+0000516229 00000 n 
+0000516360 00000 n 
+0000516510 00000 n 
+0000516778 00000 n 
+0000517156 00000 n 
+0000517394 00000 n 
+0000517416 00000 n 
+0000518844 00000 n 
+0000572543 00000 n 
+0000572720 00000 n 
+0000528368 00000 n 
+0000528590 00000 n 
+0000528786 00000 n 
+0000528975 00000 n 
+0000529164 00000 n 
+0000529385 00000 n 
+0000529581 00000 n 
+0000529770 00000 n 
+0000529959 00000 n 
+0000530145 00000 n 
+0000530367 00000 n 
+0000530563 00000 n 
+0000530752 00000 n 
+0000530941 00000 n 
+0000531128 00000 n 
+0000531325 00000 n 
+0000531546 00000 n 
+0000531734 00000 n 
+0000531931 00000 n 
+0000532153 00000 n 
+0000532340 00000 n 
+0000532537 00000 n 
+0000532758 00000 n 
+0000532944 00000 n 
+0000533166 00000 n 
+0000533354 00000 n 
+0000533575 00000 n 
+0000533762 00000 n 
+0000533984 00000 n 
+0000534172 00000 n 
+0000534394 00000 n 
+0000534580 00000 n 
+0000534802 00000 n 
+0000535024 00000 n 
+0000535244 00000 n 
+0000535466 00000 n 
+0000535687 00000 n 
+0000535909 00000 n 
+0000536131 00000 n 
+0000536352 00000 n 
+0000536540 00000 n 
+0000536759 00000 n 
+0000541228 00000 n 
+0000541449 00000 n 
+0000541644 00000 n 
+0000541864 00000 n 
+0000536945 00000 n 
+0000537522 00000 n 
+0000526581 00000 n 
+0000524384 00000 n 
+0000537110 00000 n 
+0000537168 00000 n 
+0000537227 00000 n 
+0000537286 00000 n 
+0000537345 00000 n 
+0000537404 00000 n 
+0000537463 00000 n 
+0000994563 00000 n 
+0000572897 00000 n 
+0000577635 00000 n 
+0000577871 00000 n 
+0000578112 00000 n 
+0000583198 00000 n 
+0000583439 00000 n 
+0000588361 00000 n 
+0000588538 00000 n 
+0000588715 00000 n 
+0000588891 00000 n 
+0000589068 00000 n 
+0000589245 00000 n 
+0000589362 00000 n 
+0000593689 00000 n 
+0000593929 00000 n 
+0000542059 00000 n 
+0000542279 00000 n 
+0000542466 00000 n 
+0000542686 00000 n 
+0000542873 00000 n 
+0000543094 00000 n 
+0000543290 00000 n 
+0000543511 00000 n 
+0000543707 00000 n 
+0000543928 00000 n 
+0000544116 00000 n 
+0000544337 00000 n 
+0000544525 00000 n 
+0000544746 00000 n 
+0000544934 00000 n 
+0000545155 00000 n 
+0000545343 00000 n 
+0000545564 00000 n 
+0000545786 00000 n 
+0000545972 00000 n 
+0000546193 00000 n 
+0000546379 00000 n 
+0000546575 00000 n 
+0000546763 00000 n 
+0000546983 00000 n 
+0000547169 00000 n 
+0000547365 00000 n 
+0000547554 00000 n 
+0000547776 00000 n 
+0000547962 00000 n 
+0000548158 00000 n 
+0000548354 00000 n 
+0000548543 00000 n 
+0000548765 00000 n 
+0000548951 00000 n 
+0000549147 00000 n 
+0000549343 00000 n 
+0000549532 00000 n 
+0000549754 00000 n 
+0000549940 00000 n 
+0000550133 00000 n 
+0000550329 00000 n 
+0000550518 00000 n 
+0000550740 00000 n 
+0000550926 00000 n 
+0000551119 00000 n 
+0000551315 00000 n 
+0000551504 00000 n 
+0000551726 00000 n 
+0000551922 00000 n 
+0000552115 00000 n 
+0000552507 00000 n 
+0000552727 00000 n 
+0000552921 00000 n 
+0000553112 00000 n 
+0000557060 00000 n 
+0000557281 00000 n 
+0000553500 00000 n 
+0000553780 00000 n 
+0000540535 00000 n 
+0000537688 00000 n 
+0000553663 00000 n 
+0000553721 00000 n 
+0000989805 00000 n 
+0000990818 00000 n 
+0000989514 00000 n 
+0000552311 00000 n 
+0000553306 00000 n 
+0000594106 00000 n 
+0000594341 00000 n 
+0000599417 00000 n 
+0000599594 00000 n 
+0000599770 00000 n 
+0000600005 00000 n 
+0000600241 00000 n 
+0000605440 00000 n 
+0000605617 00000 n 
+0000605794 00000 n 
+0000605971 00000 n 
+0000606147 00000 n 
+0000611219 00000 n 
+0000611455 00000 n 
+0000611690 00000 n 
+0000617534 00000 n 
+0000617766 00000 n 
+0000618001 00000 n 
+0000623269 00000 n 
+0000557467 00000 n 
+0000557688 00000 n 
+0000557880 00000 n 
+0000558101 00000 n 
+0000558289 00000 n 
+0000558510 00000 n 
+0000558698 00000 n 
+0000558919 00000 n 
+0000559140 00000 n 
+0000559360 00000 n 
+0000559547 00000 n 
+0000559767 00000 n 
+0000559959 00000 n 
+0000560180 00000 n 
+0000560401 00000 n 
+0000560587 00000 n 
+0000560808 00000 n 
+0000561000 00000 n 
+0000561186 00000 n 
+0000561407 00000 n 
+0000561602 00000 n 
+0000561797 00000 n 
+0000562019 00000 n 
+0000562214 00000 n 
+0000562436 00000 n 
+0000562657 00000 n 
+0000562844 00000 n 
+0000563065 00000 n 
+0000563259 00000 n 
+0000563480 00000 n 
+0000563668 00000 n 
+0000563889 00000 n 
+0000564075 00000 n 
+0000564295 00000 n 
+0000564482 00000 n 
+0000564702 00000 n 
+0000568528 00000 n 
+0000568750 00000 n 
+0000568938 00000 n 
+0000569134 00000 n 
+0000569352 00000 n 
+0000569540 00000 n 
+0000564889 00000 n 
+0000565348 00000 n 
+0000556574 00000 n 
+0000554005 00000 n 
+0000565054 00000 n 
+0000565112 00000 n 
+0000565171 00000 n 
+0000565230 00000 n 
+0000565289 00000 n 
+0000623505 00000 n 
+0000623741 00000 n 
+0000628888 00000 n 
+0000629122 00000 n 
+0000629299 00000 n 
+0000629535 00000 n 
+0000634989 00000 n 
+0000635164 00000 n 
+0000635400 00000 n 
+0000635577 00000 n 
+0000640936 00000 n 
+0000641172 00000 n 
+0000641345 00000 n 
+0000641522 00000 n 
+0000646330 00000 n 
+0000646564 00000 n 
+0000569736 00000 n 
+0000569958 00000 n 
+0000570146 00000 n 
+0000570342 00000 n 
+0000570564 00000 n 
+0000570752 00000 n 
+0000570947 00000 n 
+0000571135 00000 n 
+0000571325 00000 n 
+0000571735 00000 n 
+0000572145 00000 n 
+0000573013 00000 n 
+0000568222 00000 n 
+0000565557 00000 n 
+0000572308 00000 n 
+0000991108 00000 n 
+0000572366 00000 n 
+0000572425 00000 n 
+0000572484 00000 n 
+0000572602 00000 n 
+0000572661 00000 n 
+0000571531 00000 n 
+0000572779 00000 n 
+0000572838 00000 n 
+0000571941 00000 n 
+0000572955 00000 n 
+0000646800 00000 n 
+0000651708 00000 n 
+0000651944 00000 n 
+0000652180 00000 n 
+0000576124 00000 n 
+0000576534 00000 n 
+0000576943 00000 n 
+0000577353 00000 n 
+0000578233 00000 n 
+0000575926 00000 n 
+0000573252 00000 n 
+0000577518 00000 n 
+0000577576 00000 n 
+0000576330 00000 n 
+0000577694 00000 n 
+0000577753 00000 n 
+0000577812 00000 n 
+0000576739 00000 n 
+0000577935 00000 n 
+0000577994 00000 n 
+0000578053 00000 n 
+0000577149 00000 n 
+0000578175 00000 n 
+0000581634 00000 n 
+0000582044 00000 n 
+0000582454 00000 n 
+0000582860 00000 n 
+0000583621 00000 n 
+0000581436 00000 n 
+0000578414 00000 n 
+0000583023 00000 n 
+0000583081 00000 n 
+0000583140 00000 n 
+0000581840 00000 n 
+0000583262 00000 n 
+0000583321 00000 n 
+0000583380 00000 n 
+0000582250 00000 n 
+0000583503 00000 n 
+0000583562 00000 n 
+0000582658 00000 n 
+0000586092 00000 n 
+0000586502 00000 n 
+0000586909 00000 n 
+0000587319 00000 n 
+0000587729 00000 n 
+0000588138 00000 n 
+0000589482 00000 n 
+0000585858 00000 n 
+0000583802 00000 n 
+0000588303 00000 n 
+0000588420 00000 n 
+0000588479 00000 n 
+0000586298 00000 n 
+0000588597 00000 n 
+0000588656 00000 n 
+0000586706 00000 n 
+0000588773 00000 n 
+0000588832 00000 n 
+0000587115 00000 n 
+0000588950 00000 n 
+0000589009 00000 n 
+0000587525 00000 n 
+0000589127 00000 n 
+0000589186 00000 n 
+0000587934 00000 n 
+0000589304 00000 n 
+0000589424 00000 n 
+0000994688 00000 n 
+0000592239 00000 n 
+0000592648 00000 n 
+0000593058 00000 n 
+0000593468 00000 n 
+0000594518 00000 n 
+0000592041 00000 n 
+0000589650 00000 n 
+0000593631 00000 n 
+0000593753 00000 n 
+0000593812 00000 n 
+0000593871 00000 n 
+0000592445 00000 n 
+0000593988 00000 n 
+0000594047 00000 n 
+0000592854 00000 n 
+0000594165 00000 n 
+0000594224 00000 n 
+0000594282 00000 n 
+0000593264 00000 n 
+0000594400 00000 n 
+0000594459 00000 n 
+0000597086 00000 n 
+0000597496 00000 n 
+0000597905 00000 n 
+0000598315 00000 n 
+0000598725 00000 n 
+0000599135 00000 n 
+0000600357 00000 n 
+0000596852 00000 n 
+0000594686 00000 n 
+0000599300 00000 n 
+0000599358 00000 n 
+0000597292 00000 n 
+0000599476 00000 n 
+0000599535 00000 n 
+0000597701 00000 n 
+0000599653 00000 n 
+0000599712 00000 n 
+0000598111 00000 n 
+0000599829 00000 n 
+0000599888 00000 n 
+0000599946 00000 n 
+0000598521 00000 n 
+0000600064 00000 n 
+0000600123 00000 n 
+0000600182 00000 n 
+0000598931 00000 n 
+0000600299 00000 n 
+0000603111 00000 n 
+0000603521 00000 n 
+0000603930 00000 n 
+0000604340 00000 n 
+0000604750 00000 n 
+0000605160 00000 n 
+0000606265 00000 n 
+0000602877 00000 n 
+0000600525 00000 n 
+0000605323 00000 n 
+0000605381 00000 n 
+0000603317 00000 n 
+0000605499 00000 n 
+0000605558 00000 n 
+0000603727 00000 n 
+0000605676 00000 n 
+0000605735 00000 n 
+0000604136 00000 n 
+0000605853 00000 n 
+0000605912 00000 n 
+0000604546 00000 n 
+0000606030 00000 n 
+0000606088 00000 n 
+0000604956 00000 n 
+0000606206 00000 n 
+0000609649 00000 n 
+0000610058 00000 n 
+0000610468 00000 n 
+0000610878 00000 n 
+0000611808 00000 n 
+0000609451 00000 n 
+0000606433 00000 n 
+0000611043 00000 n 
+0000611101 00000 n 
+0000611160 00000 n 
+0000609854 00000 n 
+0000611278 00000 n 
+0000611337 00000 n 
+0000611396 00000 n 
+0000610264 00000 n 
+0000611514 00000 n 
+0000611573 00000 n 
+0000611631 00000 n 
+0000610674 00000 n 
+0000611749 00000 n 
+0000615205 00000 n 
+0000615615 00000 n 
+0000616025 00000 n 
+0000616407 00000 n 
+0000616816 00000 n 
+0000617195 00000 n 
+0000618059 00000 n 
+0000614971 00000 n 
+0000612028 00000 n 
+0000617358 00000 n 
+0000617416 00000 n 
+0000617475 00000 n 
+0000615411 00000 n 
+0000617593 00000 n 
+0000617648 00000 n 
+0000617707 00000 n 
+0000615821 00000 n 
+0000616216 00000 n 
+0000617825 00000 n 
+0000617884 00000 n 
+0000617942 00000 n 
+0000616613 00000 n 
+0000617006 00000 n 
+0000621259 00000 n 
+0000621669 00000 n 
+0000621859 00000 n 
+0000622269 00000 n 
+0000622459 00000 n 
+0000622869 00000 n 
+0000623859 00000 n 
+0000621043 00000 n 
+0000618279 00000 n 
+0000623034 00000 n 
+0000623092 00000 n 
+0000623151 00000 n 
+0000623210 00000 n 
+0000621465 00000 n 
+0000623328 00000 n 
+0000623387 00000 n 
+0000623446 00000 n 
+0000622065 00000 n 
+0000623564 00000 n 
+0000623623 00000 n 
+0000623682 00000 n 
+0000622665 00000 n 
+0000623800 00000 n 
+0000994813 00000 n 
+0000626935 00000 n 
+0000627344 00000 n 
+0000627529 00000 n 
+0000627938 00000 n 
+0000628348 00000 n 
+0000628549 00000 n 
+0000629653 00000 n 
+0000626719 00000 n 
+0000624066 00000 n 
+0000628712 00000 n 
+0000628770 00000 n 
+0000628829 00000 n 
+0000627141 00000 n 
+0000628945 00000 n 
+0000629004 00000 n 
+0000629063 00000 n 
+0000627734 00000 n 
+0000629181 00000 n 
+0000629240 00000 n 
+0000628144 00000 n 
+0000629358 00000 n 
+0000629417 00000 n 
+0000629476 00000 n 
+0000629594 00000 n 
+0000632646 00000 n 
+0000632846 00000 n 
+0000633256 00000 n 
+0000633457 00000 n 
+0000633642 00000 n 
+0000634052 00000 n 
+0000634238 00000 n 
+0000634648 00000 n 
+0000635695 00000 n 
+0000632412 00000 n 
+0000629834 00000 n 
+0000634813 00000 n 
+0000634871 00000 n 
+0000634930 00000 n 
+0000635046 00000 n 
+0000635105 00000 n 
+0000633052 00000 n 
+0000635223 00000 n 
+0000635282 00000 n 
+0000635341 00000 n 
+0000633848 00000 n 
+0000635459 00000 n 
+0000635518 00000 n 
+0000634444 00000 n 
+0000635636 00000 n 
+0000638799 00000 n 
+0000639209 00000 n 
+0000639410 00000 n 
+0000639595 00000 n 
+0000640004 00000 n 
+0000640188 00000 n 
+0000640597 00000 n 
+0000641639 00000 n 
+0000638574 00000 n 
+0000635863 00000 n 
+0000640760 00000 n 
+0000640818 00000 n 
+0000640877 00000 n 
+0000639005 00000 n 
+0000640995 00000 n 
+0000641054 00000 n 
+0000641113 00000 n 
+0000639801 00000 n 
+0000641227 00000 n 
+0000641286 00000 n 
+0000641404 00000 n 
+0000641463 00000 n 
+0000640394 00000 n 
+0000641580 00000 n 
+0000644762 00000 n 
+0000645171 00000 n 
+0000645580 00000 n 
+0000645989 00000 n 
+0000646977 00000 n 
+0000644564 00000 n 
+0000641807 00000 n 
+0000646154 00000 n 
+0000646212 00000 n 
+0000646271 00000 n 
+0000644968 00000 n 
+0000646387 00000 n 
+0000646446 00000 n 
+0000646505 00000 n 
+0000645376 00000 n 
+0000646623 00000 n 
+0000646682 00000 n 
+0000646741 00000 n 
+0000645786 00000 n 
+0000646859 00000 n 
+0000646918 00000 n 
+0000650200 00000 n 
+0000650610 00000 n 
+0000651019 00000 n 
+0000651428 00000 n 
+0000652356 00000 n 
+0000650002 00000 n 
+0000647158 00000 n 
+0000651591 00000 n 
+0000651649 00000 n 
+0000650406 00000 n 
+0000651767 00000 n 
+0000651826 00000 n 
+0000651885 00000 n 
+0000650815 00000 n 
+0000652003 00000 n 
+0000652062 00000 n 
+0000652121 00000 n 
+0000651225 00000 n 
+0000652238 00000 n 
+0000652297 00000 n 
+0000654464 00000 n 
+0000654874 00000 n 
+0000655099 00000 n 
+0000655325 00000 n 
+0000655551 00000 n 
+0000655777 00000 n 
+0000656003 00000 n 
+0000656231 00000 n 
+0000657274 00000 n 
+0000654248 00000 n 
+0000652565 00000 n 
+0000656396 00000 n 
+0000656454 00000 n 
+0000654670 00000 n 
+0000656628 00000 n 
+0000656687 00000 n 
+0000656746 00000 n 
+0000656805 00000 n 
+0000656864 00000 n 
+0000656923 00000 n 
+0000656981 00000 n 
+0000657156 00000 n 
+0000657215 00000 n 
+0000994938 00000 n 
+0000659684 00000 n 
+0000659903 00000 n 
+0000660123 00000 n 
+0000660343 00000 n 
+0000660528 00000 n 
+0000660748 00000 n 
+0000660951 00000 n 
+0000661137 00000 n 
+0000662239 00000 n 
+0000659477 00000 n 
+0000657427 00000 n 
+0000661300 00000 n 
+0000661358 00000 n 
+0000661533 00000 n 
+0000661592 00000 n 
+0000661651 00000 n 
+0000661710 00000 n 
+0000661769 00000 n 
+0000661828 00000 n 
+0000661887 00000 n 
+0000661946 00000 n 
+0000662005 00000 n 
+0000662064 00000 n 
+0000662123 00000 n 
+0000662181 00000 n 
+0000664273 00000 n 
+0000664458 00000 n 
+0000664643 00000 n 
+0000664828 00000 n 
+0000665053 00000 n 
+0000665743 00000 n 
+0000664093 00000 n 
+0000662433 00000 n 
+0000665218 00000 n 
+0000665392 00000 n 
+0000665567 00000 n 
+0000665626 00000 n 
+0000667775 00000 n 
+0000667926 00000 n 
+0000668076 00000 n 
+0000668226 00000 n 
+0000668377 00000 n 
+0000668528 00000 n 
+0000668679 00000 n 
+0000668830 00000 n 
+0000668981 00000 n 
+0000669132 00000 n 
+0000669283 00000 n 
+0000669434 00000 n 
+0000669585 00000 n 
+0000669736 00000 n 
+0000669887 00000 n 
+0000670038 00000 n 
+0000670189 00000 n 
+0000670338 00000 n 
+0000670487 00000 n 
+0000670637 00000 n 
+0000670788 00000 n 
+0000670939 00000 n 
+0000671090 00000 n 
+0000671241 00000 n 
+0000671392 00000 n 
+0000671539 00000 n 
+0000671690 00000 n 
+0000671839 00000 n 
+0000671987 00000 n 
+0000672138 00000 n 
+0000672288 00000 n 
+0000672438 00000 n 
+0000672588 00000 n 
+0000672739 00000 n 
+0000672890 00000 n 
+0000673040 00000 n 
+0000673191 00000 n 
+0000673342 00000 n 
+0000673492 00000 n 
+0000673643 00000 n 
+0000673794 00000 n 
+0000673945 00000 n 
+0000674096 00000 n 
+0000674247 00000 n 
+0000674398 00000 n 
+0000674549 00000 n 
+0000674700 00000 n 
+0000674851 00000 n 
+0000675002 00000 n 
+0000675153 00000 n 
+0000675304 00000 n 
+0000675455 00000 n 
+0000678295 00000 n 
+0000675604 00000 n 
+0000675884 00000 n 
+0000667163 00000 n 
+0000665924 00000 n 
+0000675767 00000 n 
+0000675825 00000 n 
+0000678446 00000 n 
+0000678597 00000 n 
+0000678748 00000 n 
+0000678899 00000 n 
+0000679050 00000 n 
+0000679201 00000 n 
+0000679352 00000 n 
+0000679503 00000 n 
+0000679654 00000 n 
+0000679805 00000 n 
+0000679956 00000 n 
+0000680107 00000 n 
+0000680258 00000 n 
+0000680409 00000 n 
+0000680560 00000 n 
+0000680711 00000 n 
+0000680861 00000 n 
+0000681012 00000 n 
+0000681163 00000 n 
+0000681313 00000 n 
+0000681463 00000 n 
+0000681614 00000 n 
+0000681763 00000 n 
+0000681914 00000 n 
+0000682065 00000 n 
+0000682216 00000 n 
+0000682364 00000 n 
+0000682515 00000 n 
+0000682666 00000 n 
+0000682817 00000 n 
+0000682967 00000 n 
+0000683118 00000 n 
+0000683268 00000 n 
+0000683419 00000 n 
+0000683569 00000 n 
+0000683720 00000 n 
+0000683871 00000 n 
+0000684022 00000 n 
+0000684173 00000 n 
+0000684324 00000 n 
+0000684475 00000 n 
+0000684625 00000 n 
+0000684776 00000 n 
+0000684927 00000 n 
+0000685077 00000 n 
+0000685228 00000 n 
+0000685379 00000 n 
+0000685530 00000 n 
+0000685681 00000 n 
+0000685832 00000 n 
+0000685983 00000 n 
+0000686134 00000 n 
+0000686283 00000 n 
+0000686434 00000 n 
+0000686585 00000 n 
+0000686736 00000 n 
+0000686886 00000 n 
+0000687036 00000 n 
+0000687187 00000 n 
+0000687336 00000 n 
+0000687487 00000 n 
+0000687638 00000 n 
+0000687789 00000 n 
+0000687940 00000 n 
+0000688091 00000 n 
+0000688241 00000 n 
+0000688390 00000 n 
+0000691562 00000 n 
+0000688539 00000 n 
+0000688762 00000 n 
+0000677539 00000 n 
+0000676011 00000 n 
+0000688704 00000 n 
+0000691713 00000 n 
+0000691864 00000 n 
+0000692015 00000 n 
+0000692166 00000 n 
+0000692317 00000 n 
+0000692467 00000 n 
+0000692618 00000 n 
+0000692768 00000 n 
+0000692917 00000 n 
+0000693068 00000 n 
+0000693218 00000 n 
+0000693369 00000 n 
+0000693519 00000 n 
+0000693670 00000 n 
+0000693821 00000 n 
+0000693972 00000 n 
+0000694123 00000 n 
+0000694273 00000 n 
+0000694424 00000 n 
+0000694574 00000 n 
+0000694725 00000 n 
+0000694876 00000 n 
+0000695027 00000 n 
+0000695178 00000 n 
+0000695328 00000 n 
+0000695479 00000 n 
+0000695629 00000 n 
+0000695780 00000 n 
+0000695930 00000 n 
+0000696078 00000 n 
+0000696229 00000 n 
+0000696379 00000 n 
+0000696530 00000 n 
+0000696681 00000 n 
+0000696831 00000 n 
+0000696982 00000 n 
+0000697133 00000 n 
+0000697284 00000 n 
+0000697435 00000 n 
+0000697585 00000 n 
+0000697736 00000 n 
+0000697886 00000 n 
+0000698034 00000 n 
+0000698183 00000 n 
+0000698331 00000 n 
+0000698482 00000 n 
+0000698633 00000 n 
+0000698784 00000 n 
+0000698934 00000 n 
+0000699084 00000 n 
+0000699232 00000 n 
+0000699383 00000 n 
+0000699534 00000 n 
+0000699685 00000 n 
+0000699836 00000 n 
+0000699987 00000 n 
+0000700137 00000 n 
+0000700288 00000 n 
+0000700439 00000 n 
+0000700590 00000 n 
+0000700741 00000 n 
+0000700892 00000 n 
+0000701043 00000 n 
+0000701194 00000 n 
+0000701345 00000 n 
+0000701495 00000 n 
+0000701646 00000 n 
+0000701797 00000 n 
+0000701948 00000 n 
+0000702099 00000 n 
+0000702250 00000 n 
+0000702401 00000 n 
+0000702551 00000 n 
+0000702701 00000 n 
+0000702851 00000 n 
+0000703002 00000 n 
+0000703152 00000 n 
+0000703303 00000 n 
+0000703453 00000 n 
+0000703604 00000 n 
+0000703755 00000 n 
+0000703905 00000 n 
+0000704055 00000 n 
+0000704205 00000 n 
+0000704356 00000 n 
+0000704507 00000 n 
+0000704658 00000 n 
+0000704809 00000 n 
+0000704960 00000 n 
+0000705111 00000 n 
+0000705262 00000 n 
+0000705412 00000 n 
+0000705561 00000 n 
+0000707886 00000 n 
+0000708037 00000 n 
+0000705709 00000 n 
+0000705930 00000 n 
+0000690572 00000 n 
+0000688902 00000 n 
+0000705872 00000 n 
+0000708188 00000 n 
+0000708339 00000 n 
+0000708490 00000 n 
+0000708640 00000 n 
+0000708791 00000 n 
+0000708941 00000 n 
+0000709092 00000 n 
+0000709243 00000 n 
+0000709394 00000 n 
+0000709543 00000 n 
+0000709694 00000 n 
+0000709845 00000 n 
+0000709996 00000 n 
+0000710145 00000 n 
+0000710296 00000 n 
+0000710446 00000 n 
+0000710597 00000 n 
+0000710747 00000 n 
+0000710898 00000 n 
+0000711049 00000 n 
+0000711200 00000 n 
+0000711351 00000 n 
+0000711502 00000 n 
+0000711653 00000 n 
+0000711804 00000 n 
+0000711955 00000 n 
+0000712105 00000 n 
+0000712256 00000 n 
+0000712405 00000 n 
+0000712556 00000 n 
+0000712707 00000 n 
+0000712857 00000 n 
+0000713008 00000 n 
+0000713157 00000 n 
+0000713308 00000 n 
+0000713458 00000 n 
+0000713609 00000 n 
+0000713759 00000 n 
+0000713910 00000 n 
+0000714059 00000 n 
+0000714209 00000 n 
+0000714359 00000 n 
+0000714510 00000 n 
+0000714661 00000 n 
+0000714812 00000 n 
+0000714963 00000 n 
+0000715114 00000 n 
+0000715263 00000 n 
+0000715414 00000 n 
+0000715563 00000 n 
+0000715786 00000 n 
+0000707283 00000 n 
+0000706070 00000 n 
+0000715728 00000 n 
+0000995063 00000 n 
+0000715913 00000 n 
+0000715939 00000 n 
+0000716407 00000 n 
+0000716711 00000 n 
+0000716872 00000 n 
+0000716999 00000 n 
+0000717435 00000 n 
+0000717762 00000 n 
+0000717889 00000 n 
+0000717916 00000 n 
+0000718385 00000 n 
+0000988318 00000 n 
+0000718649 00000 n 
+0000719121 00000 n 
+0000719241 00000 n 
+0000719279 00000 n 
+0000719631 00000 n 
+0000720076 00000 n 
+0000720552 00000 n 
+0000721028 00000 n 
+0000721460 00000 n 
+0000721836 00000 n 
+0000722411 00000 n 
+0000723054 00000 n 
+0000723752 00000 n 
+0000723796 00000 n 
+0000724114 00000 n 
+0000724467 00000 n 
+0000731477 00000 n 
+0000731709 00000 n 
+0000741445 00000 n 
+0000741727 00000 n 
+0000748870 00000 n 
+0000749105 00000 n 
+0000757276 00000 n 
+0000757506 00000 n 
+0000766116 00000 n 
+0000766350 00000 n 
+0000774048 00000 n 
+0000774305 00000 n 
+0000786594 00000 n 
+0000786880 00000 n 
+0000796230 00000 n 
+0000796476 00000 n 
+0000806249 00000 n 
+0000806510 00000 n 
+0000816595 00000 n 
+0000816863 00000 n 
+0000824837 00000 n 
+0000825135 00000 n 
+0000833385 00000 n 
+0000833659 00000 n 
+0000840731 00000 n 
+0000840964 00000 n 
+0000848875 00000 n 
+0000849131 00000 n 
+0000856687 00000 n 
+0000856936 00000 n 
+0000864390 00000 n 
+0000864619 00000 n 
+0000867872 00000 n 
+0000868091 00000 n 
+0000884487 00000 n 
+0000884977 00000 n 
+0000895575 00000 n 
+0000895931 00000 n 
+0000909626 00000 n 
+0000910078 00000 n 
+0000918513 00000 n 
+0000918811 00000 n 
+0000926262 00000 n 
+0000926633 00000 n 
+0000943819 00000 n 
+0000944287 00000 n 
+0000949395 00000 n 
+0000949640 00000 n 
+0000970283 00000 n 
+0000970856 00000 n 
+0000987846 00000 n 
+0000995143 00000 n 
+0000995263 00000 n 
+0000995389 00000 n 
+0000995515 00000 n 
+0000995595 00000 n 
+0000995687 00000 n 
+0001002603 00000 n 
+0001002869 00000 n 
+0001003659 00000 n 
+0001004383 00000 n 
+0001005152 00000 n 
+0001005921 00000 n 
+0001006605 00000 n 
+0001007308 00000 n 
+0001008077 00000 n 
+0001008776 00000 n 
+0001009545 00000 n 
+0001010192 00000 n 
+0001010961 00000 n 
+0001011698 00000 n 
+0001012411 00000 n 
+0001013196 00000 n 
+0001013860 00000 n 
+0001014676 00000 n 
+0001015548 00000 n 
+0001016383 00000 n 
+0001017205 00000 n 
+0001018070 00000 n 
+0001018845 00000 n 
+0001019694 00000 n 
+0001020503 00000 n 
+0001021193 00000 n 
+0001021954 00000 n 
+0001022715 00000 n 
+0001023476 00000 n 
+0001024237 00000 n 
+0001024936 00000 n 
+0001025676 00000 n 
+0001026437 00000 n 
+0001027198 00000 n 
+0001027959 00000 n 
+0001028720 00000 n 
+0001029434 00000 n 
+0001030219 00000 n 
+0001030968 00000 n 
+0001031833 00000 n 
+0001032698 00000 n 
+0001033488 00000 n 
+0001034253 00000 n 
+0001035262 00000 n 
+0001036211 00000 n 
+0001037043 00000 n 
+0001037860 00000 n 
+0001038642 00000 n 
+0001039318 00000 n 
+0001040063 00000 n 
+0001040808 00000 n 
+0001041553 00000 n 
+0001042298 00000 n 
+0001043043 00000 n 
+0001043788 00000 n 
+0001044533 00000 n 
+0001045278 00000 n 
+0001046023 00000 n 
+0001046768 00000 n 
+0001047513 00000 n 
+0001048258 00000 n 
+0001048943 00000 n 
+0001049626 00000 n 
+0001050472 00000 n 
+0001051278 00000 n 
+0001052028 00000 n 
+0001052713 00000 n 
+0001053430 00000 n 
+0001054160 00000 n 
+0001055022 00000 n 
+0001055780 00000 n 
+0001056199 00000 n 
+0001056378 00000 n 
+0001056549 00000 n 
+0001056719 00000 n 
+0001056890 00000 n 
+0001057065 00000 n 
+0001057242 00000 n 
+0001057416 00000 n 
+0001057590 00000 n 
+0001057767 00000 n 
+0001057942 00000 n 
+0001058119 00000 n 
+0001058294 00000 n 
+0001058471 00000 n 
+0001058646 00000 n 
+0001058823 00000 n 
+0001058998 00000 n 
+0001059175 00000 n 
+0001059408 00000 n 
+0001059681 00000 n 
+0001059958 00000 n 
+0001060231 00000 n 
+0001060504 00000 n 
+0001060777 00000 n 
+0001061050 00000 n 
+0001061323 00000 n 
+0001061602 00000 n 
+0001061881 00000 n 
+0001062162 00000 n 
+0001062442 00000 n 
+0001062723 00000 n 
+0001063003 00000 n 
+0001063284 00000 n 
+0001063564 00000 n 
+0001063842 00000 n 
+0001064112 00000 n 
+0001064377 00000 n 
+0001064601 00000 n 
+0001064818 00000 n 
+0001065021 00000 n 
+0001065223 00000 n 
+0001065426 00000 n 
+0001065633 00000 n 
+0001065842 00000 n 
+0001066049 00000 n 
+0001066258 00000 n 
+0001066464 00000 n 
+0001066670 00000 n 
+0001066879 00000 n 
+0001067086 00000 n 
+0001067295 00000 n 
+0001067502 00000 n 
+0001067711 00000 n 
+0001067918 00000 n 
+0001068127 00000 n 
+0001068313 00000 n 
+0001068506 00000 n 
+0001068749 00000 n 
+0001068990 00000 n 
+0001069233 00000 n 
+0001069474 00000 n 
+0001069717 00000 n 
+0001069958 00000 n 
+0001070201 00000 n 
+0001070442 00000 n 
+0001070682 00000 n 
+0001070907 00000 n 
+0001071160 00000 n 
+0001071449 00000 n 
+0001071737 00000 n 
+0001072026 00000 n 
+0001072314 00000 n 
+0001072603 00000 n 
+0001072890 00000 n 
+0001073179 00000 n 
+0001073468 00000 n 
+0001073755 00000 n 
+0001074044 00000 n 
+0001074333 00000 n 
+0001074615 00000 n 
+0001074855 00000 n 
+0001075048 00000 n 
+0001075240 00000 n 
+0001075433 00000 n 
+0001075625 00000 n 
+0001075813 00000 n 
+0001075997 00000 n 
+0001076182 00000 n 
+0001076366 00000 n 
+0001076551 00000 n 
+0001076735 00000 n 
+0001076920 00000 n 
+0001077103 00000 n 
+0001077286 00000 n 
+0001077471 00000 n 
+0001077655 00000 n 
+0001077840 00000 n 
+0001078024 00000 n 
+0001078209 00000 n 
+0001078393 00000 n 
+0001078578 00000 n 
+0001078663 00000 n 
+0001078853 00000 n 
+0001079111 00000 n 
+0001079388 00000 n 
+0001079674 00000 n 
+0001079886 00000 n 
+0001080158 00000 n 
+0001080420 00000 n 
+0001080711 00000 n 
+0001080969 00000 n 
+0001081227 00000 n 
+0001081489 00000 n 
+0001081652 00000 n 
+0001081768 00000 n 
+0001081884 00000 n 
+0001082012 00000 n 
+0001082152 00000 n 
+0001082293 00000 n 
+0001082427 00000 n 
+0001082552 00000 n 
+0001082676 00000 n 
+0001082798 00000 n 
+0001082925 00000 n 
+0001083064 00000 n 
+0001083207 00000 n 
+0001083350 00000 n 
+0001083480 00000 n 
+0001083598 00000 n 
+0001083715 00000 n 
+0001083815 00000 n 
+0001084009 00000 n 
+0001084201 00000 n 
+0001084322 00000 n 
+0001084456 00000 n 
+0001084578 00000 n 
+0001084688 00000 n 
+0001084728 00000 n 
+0001084909 00000 n 
+trailer
+<< /Size 3655
+/Root 3653 0 R
+/Info 3654 0 R
+/ID [<D2E5930D13FE1576333F82D6854EBC5C> <D2E5930D13FE1576333F82D6854EBC5C>] >>
+startxref
+1085236
+%%EOF
diff --git a/doc/ppl-user-java-interface-1.1pre8.ps.gz b/doc/ppl-user-java-interface-1.1pre8.ps.gz
new file mode 100644
index 0000000..ba34928
Binary files /dev/null and b/doc/ppl-user-java-interface-1.1pre8.ps.gz differ
diff --git a/doc/ppl-user-ocaml-interface-1.0-html.tar.gz b/doc/ppl-user-ocaml-interface-1.0-html.tar.gz
deleted file mode 100644
index fa11cd5..0000000
Binary files a/doc/ppl-user-ocaml-interface-1.0-html.tar.gz and /dev/null differ
diff --git a/doc/ppl-user-ocaml-interface-1.0.pdf b/doc/ppl-user-ocaml-interface-1.0.pdf
deleted file mode 100644
index dbf586d..0000000
Binary files a/doc/ppl-user-ocaml-interface-1.0.pdf and /dev/null differ
diff --git a/doc/ppl-user-ocaml-interface-1.0.ps.gz b/doc/ppl-user-ocaml-interface-1.0.ps.gz
deleted file mode 100644
index 334c189..0000000
Binary files a/doc/ppl-user-ocaml-interface-1.0.ps.gz and /dev/null differ
diff --git a/doc/ppl-user-ocaml-interface-1.1pre8-html.tar.gz b/doc/ppl-user-ocaml-interface-1.1pre8-html.tar.gz
new file mode 100644
index 0000000..086f38b
Binary files /dev/null and b/doc/ppl-user-ocaml-interface-1.1pre8-html.tar.gz differ
diff --git a/doc/ppl-user-ocaml-interface-1.1pre8.pdf b/doc/ppl-user-ocaml-interface-1.1pre8.pdf
new file mode 100644
index 0000000..8913ead
Binary files /dev/null and b/doc/ppl-user-ocaml-interface-1.1pre8.pdf differ
diff --git a/doc/ppl-user-ocaml-interface-1.1pre8.ps.gz b/doc/ppl-user-ocaml-interface-1.1pre8.ps.gz
new file mode 100644
index 0000000..eec4a13
Binary files /dev/null and b/doc/ppl-user-ocaml-interface-1.1pre8.ps.gz differ
diff --git a/doc/ppl-user-prolog-interface-1.0-html.tar.gz b/doc/ppl-user-prolog-interface-1.0-html.tar.gz
deleted file mode 100644
index 5da2d5f..0000000
Binary files a/doc/ppl-user-prolog-interface-1.0-html.tar.gz and /dev/null differ
diff --git a/doc/ppl-user-prolog-interface-1.0.pdf b/doc/ppl-user-prolog-interface-1.0.pdf
deleted file mode 100644
index f265b89..0000000
Binary files a/doc/ppl-user-prolog-interface-1.0.pdf and /dev/null differ
diff --git a/doc/ppl-user-prolog-interface-1.0.ps.gz b/doc/ppl-user-prolog-interface-1.0.ps.gz
deleted file mode 100644
index 32c9c59..0000000
Binary files a/doc/ppl-user-prolog-interface-1.0.ps.gz and /dev/null differ
diff --git a/doc/ppl-user-prolog-interface-1.1pre8-html.tar.gz b/doc/ppl-user-prolog-interface-1.1pre8-html.tar.gz
new file mode 100644
index 0000000..09592a9
Binary files /dev/null and b/doc/ppl-user-prolog-interface-1.1pre8-html.tar.gz differ
diff --git a/doc/ppl-user-prolog-interface-1.1pre8.pdf b/doc/ppl-user-prolog-interface-1.1pre8.pdf
new file mode 100644
index 0000000..3ff9071
Binary files /dev/null and b/doc/ppl-user-prolog-interface-1.1pre8.pdf differ
diff --git a/doc/ppl-user-prolog-interface-1.1pre8.ps.gz b/doc/ppl-user-prolog-interface-1.1pre8.ps.gz
new file mode 100644
index 0000000..a3ce203
Binary files /dev/null and b/doc/ppl-user-prolog-interface-1.1pre8.ps.gz differ
diff --git a/doc/ppl.bib b/doc/ppl.bib
index 1f79be3..0d73b78 100644
--- a/doc/ppl.bib
+++ b/doc/ppl.bib
@@ -1,7 +1,7 @@
 A bibliography of papers that were consulted and/or written
 for the design and implementation of the Parma Polyhedra Library.
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara AT cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This BibTeX database is made available under the Open Data Commons
 Attribution License (ODC-By) v1.0, which is reproduced below for your
@@ -1787,7 +1787,7 @@ Summarizing:
               The result is an efficient automatic tool for approximate,
               but conservative, verification of reachability properties
               of these systems.",
-  URL = "http://www-verimag.imag.fr/PEOPLE/Nicolas.Halbwachs/hybrid.html"
+  URL = "http://www-verimag.imag.fr/~halbwach/hybrid.html"
 }
 
 @Manual{HalbwachsKP95,
@@ -1848,7 +1848,7 @@ Summarizing:
               sufficient precision is obtained. We consider the
               standard abstract convex-hull operator and a novel
               abstract extrapolation operator.",
-  URL = "http://www-cad.eecs.berkeley.edu/HomePages/tah/Publications/abstract-interpretation_strategies_for_hybrid_automata.html"
+  URL = "http://pub.ist.ac.at/~tah/Publications/abstract-interpretation_strategies_for_hybrid_automata.html"
 }
 
 @InProceedings{HenzingerPW01,
@@ -1874,7 +1874,7 @@ Summarizing:
               to address some of the tool's shortcomings. We evaluate
               these extensions, and conclude with some desiderata for
               verification tools for hybrid systems.",
-  URL = "http://www-cad.eecs.berkeley.edu/HomePages/tah/Publications/some_lessons_from_the_hytech_experience.html"
+  URL = "http://pub.ist.ac.at/~tah/Publications/some_lessons_from_the_hytech_experience.html"
 }
 
 @TechReport{HuelsbergenHL90,
diff --git a/doc/ppl.sty b/doc/ppl.sty
index 0d24812..369a0bc 100644
--- a/doc/ppl.sty
+++ b/doc/ppl.sty
@@ -1,6 +1,6 @@
 %% LaTeX package providing macros for typesetting the PPL manuals.
 %% Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-%% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+%% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %%
 %% This file is part of the Parma Polyhedra Library (PPL).
 %%
diff --git a/doc/ppl_citations.bib b/doc/ppl_citations.bib
index 0e8e854..f89c823 100644
--- a/doc/ppl_citations.bib
+++ b/doc/ppl_citations.bib
@@ -1,7 +1,7 @@
 A bibliography of papers that cite the Parma Polyhedra Library
 and/or the works that defined the theory upon which it is based.
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara AT cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This BibTeX database is made available under the Open Data Commons
 Attribution License (ODC-By) v1.0, which is reproduced below for your
@@ -56,7 +56,7 @@ Summarizing:
 @Article{AlbertACGPZ12,
   Author = "E. Albert and P. Arenas and S. Genaim and G. Puebla
             and D. Zanardini",
-  Title = "Cost analysis of object-oriented bytecode programs",
+  Title = "Cost Analysis of Object-Oriented Bytecode Programs",
   Journal = "Theoretical Computer Science",
   Volume = 413,
   Number = 1,
@@ -285,6 +285,25 @@ Summarizing:
               programs."
 }
 
+ at Article{AmatoPS12,
+  Author = "G. Amato and M. Parton and F. Scozzari",
+  Title = "Discovering Invariants via Simple Component Analysis",
+  Journal = "Journal of Symbolic Computation",
+  Volume = 47,
+  Number = 12,
+  Year = 2012,
+  Pages = "1533--1560",
+  Abstract = "We propose a new technique combining dynamic and static
+              analysis of programs to find linear invariants. We use a
+              statistical tool, called simple component analysis, to
+              analyze partial execution traces of a given program. We
+              get a new coordinate system in the vector space of
+              program variables, which is used to specialize numerical
+              abstract domains. As an application, we instantiate our
+              technique to interval analysis of simple imperative
+              programs and show some experimental evaluations."
+}
+
 @Inproceedings{AmatoS12,
   Author = "G. Amato and F. Scozzari",
   Title = "Random: R-Based Analyzer for Numerical Domains",
@@ -511,7 +530,7 @@ Summarizing:
   Institution = "Departament de Llenguatges i Sistemes Inform{\`a}tics,
                  Universitat Polit{\`e}cnica de Catalunya, Barcelona, Spain",
   Year = 2005,
-  Note = "Available at \url{http://www.lsi.upc.es/dept/techreps/techreps.html}"
+  Note = "Available at \url{http://www.lsi.upc.edu/dept/techreps/techreps.html}"
 }
 
 @Incollection{BandaG09,
@@ -2172,7 +2191,7 @@ Summarizing:
   Title = "Software Model Checking",
   Journal = "ACM Computing Surveys",
   Volume = 41,
-  Nnumber = 4,
+  Number = 4,
   Year = 2009,
   Pages = "1--54",
   Publisher = "ACM Press",
diff --git a/doc/user-language-interface.tex b/doc/user-language-interface.tex
index 7a8bfea..df64139 100644
--- a/doc/user-language-interface.tex
+++ b/doc/user-language-interface.tex
@@ -1,5 +1,5 @@
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This document describes the Parma Polyhedra Library (PPL).
 %
@@ -118,7 +118,7 @@ Abramo Bagnara\thanks{abramo.bagnara at bugseng.com,
 
 \newpage
 Copyright \copyright\ 2001--2010 Roberto Bagnara (bagnara at cs.unipr.it) \\
-Copyright \copyright\ 2010--2012 BUGSENG srl (http://bugseng.com)
+Copyright \copyright\ 2010--2013 BUGSENG srl (http://bugseng.com)
 
 
 This document describes the Parma Polyhedra Library (PPL).
diff --git a/doc/user.tex b/doc/user.tex
index 3d5a3dc..32469b7 100644
--- a/doc/user.tex
+++ b/doc/user.tex
@@ -1,5 +1,5 @@
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This document describes the Parma Polyhedra Library (PPL).
 %
@@ -117,7 +117,7 @@ Abramo Bagnara\thanks{abramo.bagnara at bugseng.com,
 
 \newpage
 Copyright \copyright\ 2001--2010 Roberto Bagnara (bagnara at cs.unipr.it) \\
-Copyright \copyright\ 2010--2012 BUGSENG srl (http://bugseng.com)
+Copyright \copyright\ 2010--2013 BUGSENG srl (http://bugseng.com)
 
 
 This document describes the Parma Polyhedra Library (PPL).
diff --git a/instchk.hh b/instchk.hh
index bf96d43..93702b0 100644
--- a/instchk.hh
+++ b/instchk.hh
@@ -1,7 +1,7 @@
 /* Fake declarations to test the validity of the arguments of the
    --enabled-instantiations option defined in configure.ac.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/C/C_interface.dox b/interfaces/C/C_interface.dox
index c044bad..5351b21 100644
--- a/interfaces/C/C_interface.dox
+++ b/interfaces/C/C_interface.dox
@@ -1,6 +1,6 @@
 /* Doxumentation for the C language interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -254,7 +254,7 @@ ppl_assign_NNC_Polyhedron_from_NNC_Polyhedron
 */
 int
 ppl_new_C_Polyhedron_from_NNC_Polyhedron(ppl_Polyhedron_t* pph,
-					 ppl_const_Polyhedron_t ph);
+                                         ppl_const_Polyhedron_t ph);
 
 /*! \relates ppl_Polyhedron_tag \brief
   Builds a C polyhedron that approximates NNC_Polyhedron \p ph,
@@ -277,7 +277,7 @@ ppl_new_C_Polyhedron_from_NNC_Polyhedron_with_complexity
 */
 int
 ppl_new_NNC_Polyhedron_from_C_Polyhedron(ppl_Polyhedron_t* pph,
-					 ppl_const_Polyhedron_t ph);
+                                         ppl_const_Polyhedron_t ph);
 
 /*! \relates ppl_Polyhedron_tag \brief
   Builds an NNC polyhedron that approximates C_Polyhedron \p ph,
diff --git a/interfaces/C/Makefile.am b/interfaces/C/Makefile.am
index a900889..407ac02 100644
--- a/interfaces/C/Makefile.am
+++ b/interfaces/C/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -88,7 +88,7 @@ ppl_c.h: ppl_c_header.h ppl_c_version.h ppl_c_domains.h Makefile $(top_builddir)
 else !HAVE_PERL
 
 ppl_c.h:	ppl_c.h.dist
-	cp -f $< $@
+	cp -f ppl_c.h.dist $@
 
 endif !HAVE_PERL
 
@@ -140,8 +140,8 @@ AM_CPPFLAGS = \
 lib_LTLIBRARIES = libppl_c.la
 
 libppl_c_la_SOURCES = \
-ppl_c_implementation_common.defs.hh \
-ppl_c_implementation_common.inlines.hh \
+ppl_c_implementation_common_defs.hh \
+ppl_c_implementation_common_inlines.hh \
 ppl_c_implementation_common.cc
 
 nodist_libppl_c_la_SOURCES =
diff --git a/interfaces/C/Makefile.in b/interfaces/C/Makefile.in
index e016e2d..46d93d8 100644
--- a/interfaces/C/Makefile.in
+++ b/interfaces/C/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/C
 DIST_COMMON = $(include_HEADERS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in $(srcdir)/ppl_c_version.h.in
+	$(srcdir)/Makefile.in $(srcdir)/ppl_c_version.h.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -129,9 +146,22 @@ libppl_c_la_OBJECTS = $(am_libppl_c_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_c_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(libppl_c_la_LDFLAGS) $(LDFLAGS) -o $@
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -144,17 +174,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -163,17 +192,16 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_c_la_SOURCES) $(nodist_libppl_c_la_SOURCES) \
 	$(nodist_EXTRA_libppl_c_la_SOURCES)
 DIST_SOURCES = $(libppl_c_la_SOURCES)
@@ -184,6 +212,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 HEADERS = $(include_HEADERS) $(nodist_noinst_HEADERS)
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
@@ -486,8 +519,8 @@ AM_CPPFLAGS = \
 
 lib_LTLIBRARIES = libppl_c.la
 libppl_c_la_SOURCES = \
-ppl_c_implementation_common.defs.hh \
-ppl_c_implementation_common.inlines.hh \
+ppl_c_implementation_common_defs.hh \
+ppl_c_implementation_common_inlines.hh \
 ppl_c_implementation_common.cc
 
 nodist_libppl_c_la_SOURCES = 
@@ -635,7 +668,6 @@ ppl_c_version.h: $(top_builddir)/config.status $(srcdir)/ppl_c_version.h.in
 	cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@
 install-libLTLIBRARIES: $(lib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)"
 	@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -643,6 +675,8 @@ install-libLTLIBRARIES: $(lib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
 	}
@@ -658,12 +692,14 @@ uninstall-libLTLIBRARIES:
 
 clean-libLTLIBRARIES:
 	-test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES)
-	@list='$(lib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(lib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_c.la: $(libppl_c_la_OBJECTS) $(libppl_c_la_DEPENDENCIES) $(EXTRA_libppl_c_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_c_la_LINK) -rpath $(libdir) $(libppl_c_la_OBJECTS) $(libppl_c_la_LIBADD) $(LIBS)
 
@@ -774,8 +810,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-includeHEADERS: $(include_HEADERS)
 	@$(NORMAL_INSTALL)
-	test -z "$(includedir)" || $(MKDIR_P) "$(DESTDIR)$(includedir)"
 	@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(includedir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(includedir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -792,12 +831,12 @@ uninstall-includeHEADERS:
 	dir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -807,7 +846,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -821,37 +864,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -860,6 +872,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -923,6 +939,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -958,13 +988,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -1103,24 +1130,24 @@ ps-am:
 uninstall-am: uninstall-includeHEADERS uninstall-libLTLIBRARIES
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all check \
-	ctags-recursive install install-am install-strip \
-	tags-recursive
+	cscopelist-recursive ctags-recursive install install-am \
+	install-strip tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-generic \
-	clean-libLTLIBRARIES clean-libtool ctags ctags-recursive \
-	dist-hook distclean distclean-compile distclean-generic \
-	distclean-libtool distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am \
-	install-includeHEADERS install-info install-info-am \
-	install-libLTLIBRARIES install-man install-pdf install-pdf-am \
-	install-ps install-ps-am install-strip installcheck \
-	installcheck-am installdirs installdirs-am maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-compile \
-	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
-	tags tags-recursive uninstall uninstall-am \
+	clean-libLTLIBRARIES clean-libtool cscopelist \
+	cscopelist-recursive ctags ctags-recursive dist-hook distclean \
+	distclean-compile distclean-generic distclean-libtool \
+	distclean-tags distdir dvi dvi-am html html-am info info-am \
+	install install-am install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-includeHEADERS install-info \
+	install-info-am install-libLTLIBRARIES install-man install-pdf \
+	install-pdf-am install-ps install-ps-am install-strip \
+	installcheck installcheck-am installdirs installdirs-am \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
+	pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \
 	uninstall-includeHEADERS uninstall-libLTLIBRARIES
 
 
@@ -1130,7 +1157,7 @@ uninstall-am: uninstall-includeHEADERS uninstall-libLTLIBRARIES
 @HAVE_PERL_TRUE@		$(top_srcdir)/interfaces/C/ppl_c_header.h >$@
 
 @HAVE_PERL_FALSE at ppl_c.h:	ppl_c.h.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f ppl_c.h.dist $@
 
 # ppl_c.h is not distributed.
 # ppl_c.h.dist, which is distributed, is a copy of ppl_c.h.
diff --git a/interfaces/C/ppl_c.h.dist b/interfaces/C/ppl_c.h.dist
index 2ccb2be..ba74a00 100644
--- a/interfaces/C/ppl_c.h.dist
+++ b/interfaces/C/ppl_c.h.dist
@@ -1,6 +1,6 @@
 /* This is the header file of the C interface of the Parma Polyhedra Library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -259,7 +259,7 @@ ppl_set_irrational_precision PPL_PROTO((unsigned p));
   PPL_VERSION_BETA is zero, <CODE>M "." m "." r "pre" b</CODE> if
   neither PPL_VERSION_REVISION nor PPL_VERSION_BETA are zero.
 */
-#define PPL_VERSION "1.0"
+#define PPL_VERSION "1.1pre8"
 
 /*! \brief
   The major number of the PPL version.
@@ -271,7 +271,7 @@ ppl_set_irrational_precision PPL_PROTO((unsigned p));
   The minor number of the PPL version.
   \ingroup Version
 */
-#define PPL_VERSION_MINOR 0
+#define PPL_VERSION_MINOR 1
 
 /*! \brief
   The revision number of the PPL version.
@@ -284,7 +284,7 @@ ppl_set_irrational_precision PPL_PROTO((unsigned p));
   releases and nonzero for development snapshots.
   \ingroup Version
 */
-#define PPL_VERSION_BETA 0
+#define PPL_VERSION_BETA 8
 
 /*! \brief
   Returns the major number of the PPL version.
@@ -397,7 +397,7 @@ enum ppl_enum_error_code {
 */
 int
 ppl_set_error_handler PPL_PROTO((void (*h)(enum ppl_enum_error_code code,
-					   const char* description)));
+                                           const char* description)));
 
 /*@}*/ /* Error */
 
@@ -580,9 +580,9 @@ ppl_io_get_variable_output_function(ppl_io_variable_output_function_type** pp);
 */
 char*
 ppl_io_wrap_string(const char* src,
-		   unsigned indent_depth,
-		   unsigned preferred_first_line_length,
-		   unsigned preferred_line_length);
+                   unsigned indent_depth,
+                   unsigned preferred_first_line_length,
+                   unsigned preferred_line_length);
 
 /*@}*/ /* Datatypes */
 
@@ -885,7 +885,7 @@ ppl_new_Coefficient_from_mpz_t PPL_PROTO((ppl_Coefficient_t* pc, mpz_t z));
 */
 int
 ppl_new_Coefficient_from_Coefficient PPL_PROTO((ppl_Coefficient_t* pc,
-						ppl_const_Coefficient_t c));
+                                                ppl_const_Coefficient_t c));
 
 /*! \relates ppl_Coefficient_tag \brief
   Assign to \p dst the value given by the GMP integer \p z.
@@ -1048,8 +1048,8 @@ PPL_PROTO((ppl_const_Linear_Expression_t le, ppl_dimension_type* m));
 */
 int
 ppl_Linear_Expression_coefficient PPL_PROTO((ppl_const_Linear_Expression_t le,
-					     ppl_dimension_type var,
-					     ppl_Coefficient_t n));
+                                             ppl_dimension_type var,
+                                             ppl_Coefficient_t n));
 
 /*! \relates ppl_Linear_Expression_tag \brief
   Copies into \p n the inhomogeneous term of linear expression \p le.
@@ -1093,8 +1093,8 @@ PPL_PROTO((ppl_const_Linear_Expression_t le));
 int
 ppl_Linear_Expression_add_to_coefficient
 PPL_PROTO((ppl_Linear_Expression_t le,
-	   ppl_dimension_type var,
-	   ppl_const_Coefficient_t n));
+           ppl_dimension_type var,
+           ppl_const_Coefficient_t n));
 
 /*! \relates ppl_Linear_Expression_tag \brief
   Adds \p n to the inhomogeneous term of the linear expression \p le.
@@ -1154,8 +1154,8 @@ enum ppl_enum_Constraint_Type {
 */
 int
 ppl_new_Constraint PPL_PROTO((ppl_Constraint_t* pc,
-			      ppl_const_Linear_Expression_t le,
-			      enum ppl_enum_Constraint_Type rel));
+                              ppl_const_Linear_Expression_t le,
+                              enum ppl_enum_Constraint_Type rel));
 
 /*! \relates ppl_Constraint_tag \brief
   Creates the unsatisfiable (zero-dimension space) constraint \f$0 = 1\f$
@@ -1178,14 +1178,14 @@ ppl_new_Constraint_zero_dim_positivity PPL_PROTO((ppl_Constraint_t* pc));
 */
 int
 ppl_new_Constraint_from_Constraint PPL_PROTO((ppl_Constraint_t* pc,
-					      ppl_const_Constraint_t c));
+                                              ppl_const_Constraint_t c));
 
 /*! \relates ppl_Constraint_tag \brief
   Assigns a copy of the constraint \p src to \p dst.
 */
 int
 ppl_assign_Constraint_from_Constraint PPL_PROTO((ppl_Constraint_t dst,
-						 ppl_const_Constraint_t src));
+                                                 ppl_const_Constraint_t src));
 
 /*! \relates ppl_Constraint_tag \brief
   Invalidates the handle \p c: this makes sure the corresponding
@@ -1204,7 +1204,7 @@ ppl_delete_Constraint PPL_PROTO((ppl_const_Constraint_t c));
 */
 int
 ppl_Constraint_space_dimension PPL_PROTO((ppl_const_Constraint_t c,
-					  ppl_dimension_type* m));
+                                          ppl_dimension_type* m));
 
 /*! \relates ppl_Constraint_tag \brief
   Returns the type of constraint \p c.
@@ -1218,15 +1218,15 @@ ppl_Constraint_type PPL_PROTO((ppl_const_Constraint_t c));
 */
 int
 ppl_Constraint_coefficient PPL_PROTO((ppl_const_Constraint_t c,
-				      ppl_dimension_type var,
-				      ppl_Coefficient_t n));
+                                      ppl_dimension_type var,
+                                      ppl_Coefficient_t n));
 
 /*! \relates ppl_Constraint_tag \brief
   Copies into \p n the inhomogeneous term of constraint \p c.
 */
 int
 ppl_Constraint_inhomogeneous_term PPL_PROTO((ppl_const_Constraint_t c,
-					     ppl_Coefficient_t n));
+                                             ppl_Coefficient_t n));
 
 /*! \relates ppl_Constraint_tag \brief
   Returns a positive integer if \p c is well formed, i.e., if it
@@ -1325,7 +1325,7 @@ PPL_PROTO((ppl_const_Constraint_System_t cs));
 int
 ppl_Constraint_System_begin
 PPL_PROTO((ppl_const_Constraint_System_t cs,
-	   ppl_Constraint_System_const_iterator_t cit));
+           ppl_Constraint_System_const_iterator_t cit));
 
 /*! \relates ppl_Constraint_System_tag \brief
   Assigns to \p cit a const iterator "pointing" past the end of the
@@ -1334,7 +1334,7 @@ PPL_PROTO((ppl_const_Constraint_System_t cs,
 int
 ppl_Constraint_System_end
 PPL_PROTO((ppl_const_Constraint_System_t cs,
-	   ppl_Constraint_System_const_iterator_t cit));
+           ppl_Constraint_System_const_iterator_t cit));
 
 /*! \relates ppl_Constraint_System_tag \brief
   Returns a positive integer if \p cs is well formed, i.e., if it
@@ -1362,7 +1362,7 @@ ppl_Constraint_System_clear PPL_PROTO((ppl_Constraint_System_t cs));
 */
 int
 ppl_Constraint_System_insert_Constraint PPL_PROTO((ppl_Constraint_System_t cs,
-						   ppl_const_Constraint_t c));
+                                                   ppl_const_Constraint_t c));
 
 /*@}*/ /* Functions that May Modify the Constraint System */
 
@@ -1387,7 +1387,7 @@ PPL_PROTO((ppl_Constraint_System_const_iterator_t* pcit));
 int
 ppl_new_Constraint_System_const_iterator_from_Constraint_System_const_iterator
 PPL_PROTO((ppl_Constraint_System_const_iterator_t* pcit,
-	   ppl_const_Constraint_System_const_iterator_t cit));
+           ppl_const_Constraint_System_const_iterator_t cit));
 
 /*! \relates ppl_Constraint_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -1395,7 +1395,7 @@ PPL_PROTO((ppl_Constraint_System_const_iterator_t* pcit,
 int
 ppl_assign_Constraint_System_const_iterator_from_Constraint_System_const_iterator
 PPL_PROTO((ppl_Constraint_System_const_iterator_t dst,
-	   ppl_const_Constraint_System_const_iterator_t src));
+           ppl_const_Constraint_System_const_iterator_t src));
 
 /*! \relates ppl_Constraint_System_const_iterator_tag \brief
   Invalidates the handle \p cit: this makes sure the corresponding
@@ -1417,7 +1417,7 @@ PPL_PROTO((ppl_const_Constraint_System_const_iterator_t cit));
 int
 ppl_Constraint_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Constraint_System_const_iterator_t cit,
-	   ppl_const_Constraint_t* pc));
+           ppl_const_Constraint_t* pc));
 
 /*! \relates ppl_Constraint_System_const_iterator_tag \brief
   Increment \p cit so that it "points" to the next constraint.
@@ -1433,7 +1433,7 @@ PPL_PROTO((ppl_Constraint_System_const_iterator_t cit));
 int
 ppl_Constraint_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Constraint_System_const_iterator_t x,
-	   ppl_const_Constraint_System_const_iterator_t y));
+           ppl_const_Constraint_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -1465,9 +1465,9 @@ enum ppl_enum_Generator_Type {
 */
 int
 ppl_new_Generator PPL_PROTO((ppl_Generator_t* pg,
-			     ppl_const_Linear_Expression_t le,
-			     enum ppl_enum_Generator_Type t,
-			     ppl_const_Coefficient_t d));
+                             ppl_const_Linear_Expression_t le,
+                             enum ppl_enum_Generator_Type t,
+                             ppl_const_Coefficient_t d));
 
 /*! \relates ppl_Generator_tag \brief
   Creates the point that is the origin of the zero-dimensional space
@@ -1491,14 +1491,14 @@ ppl_new_Generator_zero_dim_closure_point PPL_PROTO((ppl_Generator_t* pg));
 */
 int
 ppl_new_Generator_from_Generator PPL_PROTO((ppl_Generator_t* pg,
-					    ppl_const_Generator_t g));
+                                            ppl_const_Generator_t g));
 
 /*! \relates ppl_Generator_tag \brief
   Assigns a copy of the generator \p src to \p dst.
 */
 int
 ppl_assign_Generator_from_Generator PPL_PROTO((ppl_Generator_t dst,
-					       ppl_const_Generator_t src));
+                                               ppl_const_Generator_t src));
 
 /*! \relates ppl_Generator_tag \brief
   Invalidates the handle \p g: this makes sure the corresponding
@@ -1517,7 +1517,7 @@ ppl_delete_Generator PPL_PROTO((ppl_const_Generator_t g));
 */
 int
 ppl_Generator_space_dimension PPL_PROTO((ppl_const_Generator_t g,
-					 ppl_dimension_type* m));
+                                         ppl_dimension_type* m));
 
 /*! \relates ppl_Generator_tag \brief
   Returns the type of generator \p g.
@@ -1530,15 +1530,15 @@ ppl_Generator_type PPL_PROTO((ppl_const_Generator_t g));
 */
 int
 ppl_Generator_coefficient PPL_PROTO((ppl_const_Generator_t g,
-				     ppl_dimension_type var,
-				     ppl_Coefficient_t n));
+                                     ppl_dimension_type var,
+                                     ppl_Coefficient_t n));
 
 /*! \relates ppl_Generator_tag \brief
   If \p g is a point or a closure point assigns its divisor to \p n.
 */
 int
 ppl_Generator_divisor PPL_PROTO((ppl_const_Generator_t g,
-				 ppl_Coefficient_t n));
+                                 ppl_Coefficient_t n));
 
 /*! \relates ppl_Generator_tag \brief
   Returns a positive integer if \p g is well formed, i.e., if it
@@ -1579,7 +1579,7 @@ PPL_PROTO((ppl_Generator_System_t* pgs));
 */
 int
 ppl_new_Generator_System_from_Generator PPL_PROTO((ppl_Generator_System_t* pgs,
-						   ppl_const_Generator_t g));
+                                                   ppl_const_Generator_t g));
 
 /*! \relates ppl_Generator_System_tag \brief
   Builds a generator system that is a copy of \p gs; writes a handle
@@ -1630,7 +1630,7 @@ PPL_PROTO((ppl_const_Generator_System_t gs));
 int
 ppl_Generator_System_begin
 PPL_PROTO((ppl_const_Generator_System_t gs,
-	   ppl_Generator_System_const_iterator_t git));
+           ppl_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Generator_System_tag \brief
   Assigns to \p git a const iterator "pointing" past the end of the
@@ -1639,7 +1639,7 @@ PPL_PROTO((ppl_const_Generator_System_t gs,
 int
 ppl_Generator_System_end
 PPL_PROTO((ppl_const_Generator_System_t gs,
-	   ppl_Generator_System_const_iterator_t git));
+           ppl_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Generator_System_tag \brief
   Returns a positive integer if \p gs is well formed, i.e., if it
@@ -1667,7 +1667,7 @@ ppl_Generator_System_clear PPL_PROTO((ppl_Generator_System_t gs));
 */
 int
 ppl_Generator_System_insert_Generator PPL_PROTO((ppl_Generator_System_t gs,
-						 ppl_const_Generator_t g));
+                                                 ppl_const_Generator_t g));
 
 /*@}*/ /* Functions that May Modify the Generator System */
 
@@ -1692,7 +1692,7 @@ PPL_PROTO((ppl_Generator_System_const_iterator_t* pgit));
 int
 ppl_new_Generator_System_const_iterator_from_Generator_System_const_iterator
 PPL_PROTO((ppl_Generator_System_const_iterator_t* pgit,
-	   ppl_const_Generator_System_const_iterator_t git));
+           ppl_const_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Generator_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -1700,7 +1700,7 @@ PPL_PROTO((ppl_Generator_System_const_iterator_t* pgit,
 int
 ppl_assign_Generator_System_const_iterator_from_Generator_System_const_iterator
 PPL_PROTO((ppl_Generator_System_const_iterator_t dst,
-	   ppl_const_Generator_System_const_iterator_t src));
+           ppl_const_Generator_System_const_iterator_t src));
 
 /*! \relates ppl_Generator_System_const_iterator_tag \brief
   Invalidates the handle \p git: this makes sure the corresponding
@@ -1722,7 +1722,7 @@ PPL_PROTO((ppl_const_Generator_System_const_iterator_t git));
 int
 ppl_Generator_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Generator_System_const_iterator_t git,
-	   ppl_const_Generator_t* pg));
+           ppl_const_Generator_t* pg));
 
 /*! \relates ppl_Generator_System_const_iterator_tag \brief
   Increment \p git so that it "points" to the next generator.
@@ -1738,7 +1738,7 @@ PPL_PROTO((ppl_Generator_System_const_iterator_t git));
 int
 ppl_Generator_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Generator_System_const_iterator_t x,
-	   ppl_const_Generator_System_const_iterator_t y));
+           ppl_const_Generator_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -1753,8 +1753,8 @@ PPL_PROTO((ppl_const_Generator_System_const_iterator_t x,
 */
 int
 ppl_new_Congruence PPL_PROTO((ppl_Congruence_t* pc,
-			      ppl_const_Linear_Expression_t le,
-			      ppl_const_Coefficient_t m));
+                              ppl_const_Linear_Expression_t le,
+                              ppl_const_Coefficient_t m));
 
 /*! \relates ppl_Congruence_tag \brief
   Creates the unsatisfiable (zero-dimension space) congruence
@@ -1777,14 +1777,14 @@ ppl_new_Congruence_zero_dim_integrality PPL_PROTO((ppl_Congruence_t* pc));
 */
 int
 ppl_new_Congruence_from_Congruence PPL_PROTO((ppl_Congruence_t* pc,
-					      ppl_const_Congruence_t c));
+                                              ppl_const_Congruence_t c));
 
 /*! \relates ppl_Congruence_tag \brief
   Assigns a copy of the congruence \p src to \p dst.
 */
 int
 ppl_assign_Congruence_from_Congruence PPL_PROTO((ppl_Congruence_t dst,
-						 ppl_const_Congruence_t src));
+                                                 ppl_const_Congruence_t src));
 
 /*! \relates ppl_Congruence_tag \brief
   Invalidates the handle \p c: this makes sure the corresponding
@@ -1803,7 +1803,7 @@ ppl_delete_Congruence PPL_PROTO((ppl_const_Congruence_t c));
 */
 int
 ppl_Congruence_space_dimension PPL_PROTO((ppl_const_Congruence_t c,
-					  ppl_dimension_type* m));
+                                          ppl_dimension_type* m));
 
 /*! \relates ppl_Congruence_tag \brief
   Copies into \p n the coefficient of variable \p var in
@@ -1811,22 +1811,22 @@ ppl_Congruence_space_dimension PPL_PROTO((ppl_const_Congruence_t c,
 */
 int
 ppl_Congruence_coefficient PPL_PROTO((ppl_const_Congruence_t c,
-				      ppl_dimension_type var,
-				      ppl_Coefficient_t n));
+                                      ppl_dimension_type var,
+                                      ppl_Coefficient_t n));
 
 /*! \relates ppl_Congruence_tag \brief
   Copies into \p n the inhomogeneous term of congruence \p c.
 */
 int
 ppl_Congruence_inhomogeneous_term PPL_PROTO((ppl_const_Congruence_t c,
-					     ppl_Coefficient_t n));
+                                             ppl_Coefficient_t n));
 
 /*! \relates ppl_Congruence_tag \brief
   Copies into \p m the modulus of congruence \p c.
 */
 int
 ppl_Congruence_modulus PPL_PROTO((ppl_const_Congruence_t c,
-				  ppl_Coefficient_t m));
+                                  ppl_Coefficient_t m));
 
 /*! \relates ppl_Congruence_tag \brief
   Returns a positive integer if \p c is well formed, i.e., if it
@@ -1917,7 +1917,7 @@ PPL_PROTO((ppl_const_Congruence_System_t cs));
 int
 ppl_Congruence_System_begin
 PPL_PROTO((ppl_const_Congruence_System_t cs,
-	   ppl_Congruence_System_const_iterator_t cit));
+           ppl_Congruence_System_const_iterator_t cit));
 
 /*! \relates ppl_Congruence_System_tag \brief
   Assigns to \p cit a const iterator "pointing" past the end of the
@@ -1926,7 +1926,7 @@ PPL_PROTO((ppl_const_Congruence_System_t cs,
 int
 ppl_Congruence_System_end
 PPL_PROTO((ppl_const_Congruence_System_t cs,
-	   ppl_Congruence_System_const_iterator_t cit));
+           ppl_Congruence_System_const_iterator_t cit));
 
 /*! \relates ppl_Congruence_System_tag \brief
   Returns a positive integer if \p cs is well formed, i.e., if it
@@ -1954,7 +1954,7 @@ ppl_Congruence_System_clear PPL_PROTO((ppl_Congruence_System_t cs));
 */
 int
 ppl_Congruence_System_insert_Congruence PPL_PROTO((ppl_Congruence_System_t cs,
-						   ppl_const_Congruence_t c));
+                                                   ppl_const_Congruence_t c));
 
 /*@}*/ /* Functions that May Modify the Congruence System */
 
@@ -1979,7 +1979,7 @@ PPL_PROTO((ppl_Congruence_System_const_iterator_t* pcit));
 int
 ppl_new_Congruence_System_const_iterator_from_Congruence_System_const_iterator
 PPL_PROTO((ppl_Congruence_System_const_iterator_t* pcit,
-	   ppl_const_Congruence_System_const_iterator_t cit));
+           ppl_const_Congruence_System_const_iterator_t cit));
 
 /*! \relates ppl_Congruence_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -1987,7 +1987,7 @@ PPL_PROTO((ppl_Congruence_System_const_iterator_t* pcit,
 int
 ppl_assign_Congruence_System_const_iterator_from_Congruence_System_const_iterator
 PPL_PROTO((ppl_Congruence_System_const_iterator_t dst,
-	   ppl_const_Congruence_System_const_iterator_t src));
+           ppl_const_Congruence_System_const_iterator_t src));
 
 /*! \relates ppl_Congruence_System_const_iterator_tag \brief
   Invalidates the handle \p cit: this makes sure the corresponding
@@ -2009,7 +2009,7 @@ PPL_PROTO((ppl_const_Congruence_System_const_iterator_t cit));
 int
 ppl_Congruence_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Congruence_System_const_iterator_t cit,
-	   ppl_const_Congruence_t* pc));
+           ppl_const_Congruence_t* pc));
 
 /*! \relates ppl_Congruence_System_const_iterator_tag \brief
   Increment \p cit so that it "points" to the next congruence.
@@ -2025,7 +2025,7 @@ PPL_PROTO((ppl_Congruence_System_const_iterator_t cit));
 int
 ppl_Congruence_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Congruence_System_const_iterator_t x,
-	   ppl_const_Congruence_System_const_iterator_t y));
+           ppl_const_Congruence_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -2055,9 +2055,9 @@ enum ppl_enum_Grid_Generator_Type {
 */
 int
 ppl_new_Grid_Generator PPL_PROTO((ppl_Grid_Generator_t* pg,
-				  ppl_const_Linear_Expression_t le,
-				  enum ppl_enum_Grid_Generator_Type t,
-				  ppl_const_Coefficient_t d));
+                                  ppl_const_Linear_Expression_t le,
+                                  enum ppl_enum_Grid_Generator_Type t,
+                                  ppl_const_Coefficient_t d));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Creates the point that is the origin of the zero-dimensional space
@@ -2081,7 +2081,7 @@ PPL_PROTO((ppl_Grid_Generator_t* pg, ppl_const_Grid_Generator_t g));
 int
 ppl_assign_Grid_Generator_from_Grid_Generator
 PPL_PROTO((ppl_Grid_Generator_t dst,
-	   ppl_const_Grid_Generator_t src));
+           ppl_const_Grid_Generator_t src));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Invalidates the handle \p g: this makes sure the corresponding
@@ -2100,7 +2100,7 @@ ppl_delete_Grid_Generator PPL_PROTO((ppl_const_Grid_Generator_t g));
 */
 int
 ppl_Grid_Generator_space_dimension PPL_PROTO((ppl_const_Grid_Generator_t g,
-					      ppl_dimension_type* m));
+                                              ppl_dimension_type* m));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Returns the type of grid generator \p g.
@@ -2114,15 +2114,15 @@ ppl_Grid_Generator_type PPL_PROTO((ppl_const_Grid_Generator_t g));
 */
 int
 ppl_Grid_Generator_coefficient PPL_PROTO((ppl_const_Grid_Generator_t g,
-					  ppl_dimension_type var,
-					  ppl_Coefficient_t n));
+                                          ppl_dimension_type var,
+                                          ppl_Coefficient_t n));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   If \p g is a point or a parameter assigns its divisor to \p n.
 */
 int
 ppl_Grid_Generator_divisor PPL_PROTO((ppl_const_Grid_Generator_t g,
-				      ppl_Coefficient_t n));
+                                      ppl_Coefficient_t n));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Returns a positive integer if \p g is well formed, i.e., if it
@@ -2164,7 +2164,7 @@ PPL_PROTO((ppl_Grid_Generator_System_t* pgs));
 int
 ppl_new_Grid_Generator_System_from_Grid_Generator
 PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
-	   ppl_const_Grid_Generator_t g));
+           ppl_const_Grid_Generator_t g));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Builds a grid generator system that is a copy of \p gs; writes a handle
@@ -2173,7 +2173,7 @@ PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
 int
 ppl_new_Grid_Generator_System_from_Grid_Generator_System
 PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
-	   ppl_const_Grid_Generator_System_t gs));
+           ppl_const_Grid_Generator_System_t gs));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Assigns a copy of the grid generator system \p src to \p dst.
@@ -2181,7 +2181,7 @@ PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
 int
 ppl_assign_Grid_Generator_System_from_Grid_Generator_System
 PPL_PROTO((ppl_Grid_Generator_System_t dst,
-	   ppl_const_Grid_Generator_System_t src));
+           ppl_const_Grid_Generator_System_t src));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Invalidates the handle \p gs: this makes sure the corresponding
@@ -2218,7 +2218,7 @@ PPL_PROTO((ppl_const_Grid_Generator_System_t gs));
 int
 ppl_Grid_Generator_System_begin
 PPL_PROTO((ppl_const_Grid_Generator_System_t gs,
-	   ppl_Grid_Generator_System_const_iterator_t git));
+           ppl_Grid_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Assigns to \p git a const iterator "pointing" past the end of the
@@ -2227,7 +2227,7 @@ PPL_PROTO((ppl_const_Grid_Generator_System_t gs,
 int
 ppl_Grid_Generator_System_end
 PPL_PROTO((ppl_const_Grid_Generator_System_t gs,
-	   ppl_Grid_Generator_System_const_iterator_t git));
+           ppl_Grid_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Returns a positive integer if \p gs is well formed, i.e., if it
@@ -2256,7 +2256,7 @@ ppl_Grid_Generator_System_clear PPL_PROTO((ppl_Grid_Generator_System_t gs));
 int
 ppl_Grid_Generator_System_insert_Grid_Generator
 PPL_PROTO((ppl_Grid_Generator_System_t gs,
-	   ppl_const_Grid_Generator_t g));
+           ppl_const_Grid_Generator_t g));
 
 /*@}*/ /* Functions that May Modify the Grid Generator System */
 
@@ -2281,7 +2281,7 @@ PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t* pgit));
 int
 ppl_new_Grid_Generator_System_const_iterator_from_Grid_Generator_System_const_iterator
 PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t* pgit,
-	   ppl_const_Grid_Generator_System_const_iterator_t git));
+           ppl_const_Grid_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Grid_Generator_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -2289,7 +2289,7 @@ PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t* pgit,
 int
 ppl_assign_Grid_Generator_System_const_iterator_from_Grid_Generator_System_const_iterator
 PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t dst,
-	   ppl_const_Grid_Generator_System_const_iterator_t src));
+           ppl_const_Grid_Generator_System_const_iterator_t src));
 
 /*! \relates ppl_Grid_Generator_System_const_iterator_tag \brief
   Invalidates the handle \p git: this makes sure the corresponding
@@ -2311,7 +2311,7 @@ PPL_PROTO((ppl_const_Grid_Generator_System_const_iterator_t git));
 int
 ppl_Grid_Generator_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Grid_Generator_System_const_iterator_t git,
-	   ppl_const_Grid_Generator_t* pg));
+           ppl_const_Grid_Generator_t* pg));
 
 /*! \relates ppl_Grid_Generator_System_const_iterator_tag \brief
   Increment \p git so that it "points" to the next grid generator.
@@ -2327,7 +2327,7 @@ PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t git));
 int
 ppl_Grid_Generator_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Grid_Generator_System_const_iterator_t x,
-	   ppl_const_Grid_Generator_System_const_iterator_t y));
+           ppl_const_Grid_Generator_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -2552,7 +2552,7 @@ extern int PPL_PIP_PROBLEM_CONTROL_PARAMETER_PIVOT_ROW_STRATEGY_MAX_COLUMN;
 */
 int
 ppl_new_MIP_Problem_from_space_dimension PPL_PROTO((ppl_MIP_Problem_t* pmip,
-						    ppl_dimension_type d));
+                                                    ppl_dimension_type d));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Builds a MIP problem of space dimension \p d having feasible region \p cs,
@@ -2561,10 +2561,10 @@ ppl_new_MIP_Problem_from_space_dimension PPL_PROTO((ppl_MIP_Problem_t* pmip,
 */
 int
 ppl_new_MIP_Problem PPL_PROTO((ppl_MIP_Problem_t* pmip,
-			       ppl_dimension_type d,
-			       ppl_const_Constraint_System_t cs,
-			       ppl_const_Linear_Expression_t le,
-			       int m));
+                               ppl_dimension_type d,
+                               ppl_const_Constraint_System_t cs,
+                               ppl_const_Linear_Expression_t le,
+                               int m));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Builds a MIP problem that is a copy of \p mip; writes a handle
@@ -2622,7 +2622,7 @@ PPL_PROTO((ppl_const_MIP_Problem_t mip, ppl_dimension_type ds[]));
 */
 int
 ppl_MIP_Problem_number_of_constraints PPL_PROTO((ppl_const_MIP_Problem_t mip,
-						 ppl_dimension_type* m));
+                                                 ppl_dimension_type* m));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes at address \p pc a const handle to the \p i-th constraint
@@ -2630,8 +2630,8 @@ ppl_MIP_Problem_number_of_constraints PPL_PROTO((ppl_const_MIP_Problem_t mip,
 */
 int
 ppl_MIP_Problem_constraint_at_index PPL_PROTO((ppl_const_MIP_Problem_t mip,
-					       ppl_dimension_type i,
-					       ppl_const_Constraint_t* pc));
+                                               ppl_dimension_type i,
+                                               ppl_const_Constraint_t* pc));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes a const handle to the linear expression defining the
@@ -2689,7 +2689,7 @@ PPL_PROTO((ppl_MIP_Problem_t mip, ppl_dimension_type ds[], size_t n));
 */
 int
 ppl_MIP_Problem_add_constraint PPL_PROTO((ppl_MIP_Problem_t mip,
-					  ppl_const_Constraint_t c));
+                                          ppl_const_Constraint_t c));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Modifies the feasible region of the MIP problem \p mip by adding a copy
@@ -2697,7 +2697,7 @@ ppl_MIP_Problem_add_constraint PPL_PROTO((ppl_MIP_Problem_t mip,
 */
 int
 ppl_MIP_Problem_add_constraints PPL_PROTO((ppl_MIP_Problem_t mip,
-					   ppl_const_Constraint_System_t cs));
+                                           ppl_const_Constraint_System_t cs));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Sets the objective function of the MIP problem \p mip to a copy of \p le.
@@ -2711,7 +2711,7 @@ PPL_PROTO((ppl_MIP_Problem_t mip, ppl_const_Linear_Expression_t le));
 */
 int
 ppl_MIP_Problem_set_optimization_mode PPL_PROTO((ppl_MIP_Problem_t mip,
-						 int mode));
+                                                 int mode));
 
 /*@}*/ /* Functions that May Modify the MIP_Problem */
 
@@ -2757,7 +2757,7 @@ ppl_MIP_Problem_solve PPL_PROTO((ppl_const_MIP_Problem_t mip));
 int
 ppl_MIP_Problem_evaluate_objective_function
 PPL_PROTO((ppl_const_MIP_Problem_t mip, ppl_const_Generator_t g,
-	   ppl_Coefficient_t num, ppl_Coefficient_t den));
+           ppl_Coefficient_t num, ppl_Coefficient_t den));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes a const handle to a feasible point for the MIP problem \p mip
@@ -2765,7 +2765,7 @@ PPL_PROTO((ppl_const_MIP_Problem_t mip, ppl_const_Generator_t g,
 */
 int
 ppl_MIP_Problem_feasible_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
-					  ppl_const_Generator_t* pg));
+                                          ppl_const_Generator_t* pg));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes a const handle to an optimizing point for the MIP problem \p mip
@@ -2773,7 +2773,7 @@ ppl_MIP_Problem_feasible_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
 */
 int
 ppl_MIP_Problem_optimizing_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
-					    ppl_const_Generator_t* pg));
+                                            ppl_const_Generator_t* pg));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Returns the optimal value for \p mip.
@@ -2790,7 +2790,7 @@ ppl_MIP_Problem_optimizing_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
 int
 ppl_MIP_Problem_optimal_value
 PPL_PROTO((ppl_const_MIP_Problem_t mip,
-	   ppl_Coefficient_t num, ppl_Coefficient_t den));
+           ppl_Coefficient_t num, ppl_Coefficient_t den));
 
 /*@}*/ /* Computing the Solution of the MIP_Problem */
 
@@ -2837,7 +2837,7 @@ PPL_PROTO((ppl_const_MIP_Problem_t mip, size_t* sz));
 */
 int
 ppl_new_PIP_Problem_from_space_dimension PPL_PROTO((ppl_PIP_Problem_t* ppip,
-						    ppl_dimension_type d));
+                                                    ppl_dimension_type d));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Builds a PIP problem that is a copy of \p pip; writes a handle
@@ -2921,7 +2921,7 @@ PPL_PROTO((ppl_const_PIP_Problem_t pip, ppl_dimension_type* pd));
 */
 int
 ppl_PIP_Problem_number_of_constraints PPL_PROTO((ppl_const_PIP_Problem_t pip,
-						 ppl_dimension_type* m));
+                                                 ppl_dimension_type* m));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Writes at address \p pc a const handle to the \p i-th constraint
@@ -2929,8 +2929,8 @@ ppl_PIP_Problem_number_of_constraints PPL_PROTO((ppl_const_PIP_Problem_t pip,
 */
 int
 ppl_PIP_Problem_constraint_at_index PPL_PROTO((ppl_const_PIP_Problem_t pip,
-					       ppl_dimension_type i,
-					       ppl_const_Constraint_t* pc));
+                                               ppl_dimension_type i,
+                                               ppl_const_Constraint_t* pc));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Writes into \p *sz the size in bytes of the memory occupied by \p pip.
@@ -3013,7 +3013,7 @@ PPL_PROTO((ppl_PIP_Problem_t pip, ppl_dimension_type d));
 */
 int
 ppl_PIP_Problem_add_constraint PPL_PROTO((ppl_PIP_Problem_t pip,
-					  ppl_const_Constraint_t c));
+                                          ppl_const_Constraint_t c));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Modifies the feasible region of the PIP problem \p pip by adding a copy
@@ -3021,7 +3021,7 @@ ppl_PIP_Problem_add_constraint PPL_PROTO((ppl_PIP_Problem_t pip,
 */
 int
 ppl_PIP_Problem_add_constraints PPL_PROTO((ppl_PIP_Problem_t pip,
-					   ppl_const_Constraint_System_t cs));
+                                           ppl_const_Constraint_System_t cs));
 
 /*@}*/ /* Functions that May Modify the PIP_Problem */
 
@@ -3235,7 +3235,7 @@ PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t* papit));
 int
 ppl_new_Artificial_Parameter_Sequence_const_iterator_from_Artificial_Parameter_Sequence_const_iterator
 PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t* papit,
-	   ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit));
+           ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit));
 
 /*! \relates ppl_Artificial_Parameter_Sequence_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -3243,7 +3243,7 @@ PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t* papit,
 int
 ppl_assign_Artificial_Parameter_Sequence_const_iterator_from_Artificial_Parameter_Sequence_const_iterator
 PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t dst,
-	   ppl_const_Artificial_Parameter_Sequence_const_iterator_t src));
+           ppl_const_Artificial_Parameter_Sequence_const_iterator_t src));
 
 /*! \relates ppl_Artificial_Parameter_Sequence_const_iterator_tag \brief
   Invalidates the handle \p apit: this makes sure the corresponding
@@ -3265,7 +3265,7 @@ PPL_PROTO((ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit));
 int
 ppl_Artificial_Parameter_Sequence_const_iterator_dereference
 PPL_PROTO((ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit,
-	   ppl_const_Artificial_Parameter_t* pap));
+           ppl_const_Artificial_Parameter_t* pap));
 
 /*! \relates ppl_Artificial_Parameter_Sequence_const_iterator_tag \brief
   Increment \p apit so that it "points" to the next artificial parameter.
@@ -3281,7 +3281,7 @@ PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t apit));
 int
 ppl_Artificial_Parameter_Sequence_const_iterator_equal_test
 PPL_PROTO((ppl_const_Artificial_Parameter_Sequence_const_iterator_t x,
-	   ppl_const_Artificial_Parameter_Sequence_const_iterator_t y));
+           ppl_const_Artificial_Parameter_Sequence_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
diff --git a/interfaces/C/ppl_c_header.h b/interfaces/C/ppl_c_header.h
index 9c95f3f..71ba536 100644
--- a/interfaces/C/ppl_c_header.h
+++ b/interfaces/C/ppl_c_header.h
@@ -1,6 +1,6 @@
 /* This is the header file of the C interface of the Parma Polyhedra Library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -354,7 +354,7 @@ enum ppl_enum_error_code {
 */
 int
 ppl_set_error_handler PPL_PROTO((void (*h)(enum ppl_enum_error_code code,
-					   const char* description)));
+                                           const char* description)));
 
 /*@}*/ /* Error */
 
@@ -537,9 +537,9 @@ ppl_io_get_variable_output_function(ppl_io_variable_output_function_type** pp);
 */
 char*
 ppl_io_wrap_string(const char* src,
-		   unsigned indent_depth,
-		   unsigned preferred_first_line_length,
-		   unsigned preferred_line_length);
+                   unsigned indent_depth,
+                   unsigned preferred_first_line_length,
+                   unsigned preferred_line_length);
 
 /*@}*/ /* Datatypes */
 
@@ -842,7 +842,7 @@ ppl_new_Coefficient_from_mpz_t PPL_PROTO((ppl_Coefficient_t* pc, mpz_t z));
 */
 int
 ppl_new_Coefficient_from_Coefficient PPL_PROTO((ppl_Coefficient_t* pc,
-						ppl_const_Coefficient_t c));
+                                                ppl_const_Coefficient_t c));
 
 /*! \relates ppl_Coefficient_tag \brief
   Assign to \p dst the value given by the GMP integer \p z.
@@ -1005,8 +1005,8 @@ PPL_PROTO((ppl_const_Linear_Expression_t le, ppl_dimension_type* m));
 */
 int
 ppl_Linear_Expression_coefficient PPL_PROTO((ppl_const_Linear_Expression_t le,
-					     ppl_dimension_type var,
-					     ppl_Coefficient_t n));
+                                             ppl_dimension_type var,
+                                             ppl_Coefficient_t n));
 
 /*! \relates ppl_Linear_Expression_tag \brief
   Copies into \p n the inhomogeneous term of linear expression \p le.
@@ -1050,8 +1050,8 @@ PPL_PROTO((ppl_const_Linear_Expression_t le));
 int
 ppl_Linear_Expression_add_to_coefficient
 PPL_PROTO((ppl_Linear_Expression_t le,
-	   ppl_dimension_type var,
-	   ppl_const_Coefficient_t n));
+           ppl_dimension_type var,
+           ppl_const_Coefficient_t n));
 
 /*! \relates ppl_Linear_Expression_tag \brief
   Adds \p n to the inhomogeneous term of the linear expression \p le.
@@ -1111,8 +1111,8 @@ enum ppl_enum_Constraint_Type {
 */
 int
 ppl_new_Constraint PPL_PROTO((ppl_Constraint_t* pc,
-			      ppl_const_Linear_Expression_t le,
-			      enum ppl_enum_Constraint_Type rel));
+                              ppl_const_Linear_Expression_t le,
+                              enum ppl_enum_Constraint_Type rel));
 
 /*! \relates ppl_Constraint_tag \brief
   Creates the unsatisfiable (zero-dimension space) constraint \f$0 = 1\f$
@@ -1135,14 +1135,14 @@ ppl_new_Constraint_zero_dim_positivity PPL_PROTO((ppl_Constraint_t* pc));
 */
 int
 ppl_new_Constraint_from_Constraint PPL_PROTO((ppl_Constraint_t* pc,
-					      ppl_const_Constraint_t c));
+                                              ppl_const_Constraint_t c));
 
 /*! \relates ppl_Constraint_tag \brief
   Assigns a copy of the constraint \p src to \p dst.
 */
 int
 ppl_assign_Constraint_from_Constraint PPL_PROTO((ppl_Constraint_t dst,
-						 ppl_const_Constraint_t src));
+                                                 ppl_const_Constraint_t src));
 
 /*! \relates ppl_Constraint_tag \brief
   Invalidates the handle \p c: this makes sure the corresponding
@@ -1161,7 +1161,7 @@ ppl_delete_Constraint PPL_PROTO((ppl_const_Constraint_t c));
 */
 int
 ppl_Constraint_space_dimension PPL_PROTO((ppl_const_Constraint_t c,
-					  ppl_dimension_type* m));
+                                          ppl_dimension_type* m));
 
 /*! \relates ppl_Constraint_tag \brief
   Returns the type of constraint \p c.
@@ -1175,15 +1175,15 @@ ppl_Constraint_type PPL_PROTO((ppl_const_Constraint_t c));
 */
 int
 ppl_Constraint_coefficient PPL_PROTO((ppl_const_Constraint_t c,
-				      ppl_dimension_type var,
-				      ppl_Coefficient_t n));
+                                      ppl_dimension_type var,
+                                      ppl_Coefficient_t n));
 
 /*! \relates ppl_Constraint_tag \brief
   Copies into \p n the inhomogeneous term of constraint \p c.
 */
 int
 ppl_Constraint_inhomogeneous_term PPL_PROTO((ppl_const_Constraint_t c,
-					     ppl_Coefficient_t n));
+                                             ppl_Coefficient_t n));
 
 /*! \relates ppl_Constraint_tag \brief
   Returns a positive integer if \p c is well formed, i.e., if it
@@ -1282,7 +1282,7 @@ PPL_PROTO((ppl_const_Constraint_System_t cs));
 int
 ppl_Constraint_System_begin
 PPL_PROTO((ppl_const_Constraint_System_t cs,
-	   ppl_Constraint_System_const_iterator_t cit));
+           ppl_Constraint_System_const_iterator_t cit));
 
 /*! \relates ppl_Constraint_System_tag \brief
   Assigns to \p cit a const iterator "pointing" past the end of the
@@ -1291,7 +1291,7 @@ PPL_PROTO((ppl_const_Constraint_System_t cs,
 int
 ppl_Constraint_System_end
 PPL_PROTO((ppl_const_Constraint_System_t cs,
-	   ppl_Constraint_System_const_iterator_t cit));
+           ppl_Constraint_System_const_iterator_t cit));
 
 /*! \relates ppl_Constraint_System_tag \brief
   Returns a positive integer if \p cs is well formed, i.e., if it
@@ -1319,7 +1319,7 @@ ppl_Constraint_System_clear PPL_PROTO((ppl_Constraint_System_t cs));
 */
 int
 ppl_Constraint_System_insert_Constraint PPL_PROTO((ppl_Constraint_System_t cs,
-						   ppl_const_Constraint_t c));
+                                                   ppl_const_Constraint_t c));
 
 /*@}*/ /* Functions that May Modify the Constraint System */
 
@@ -1344,7 +1344,7 @@ PPL_PROTO((ppl_Constraint_System_const_iterator_t* pcit));
 int
 ppl_new_Constraint_System_const_iterator_from_Constraint_System_const_iterator
 PPL_PROTO((ppl_Constraint_System_const_iterator_t* pcit,
-	   ppl_const_Constraint_System_const_iterator_t cit));
+           ppl_const_Constraint_System_const_iterator_t cit));
 
 /*! \relates ppl_Constraint_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -1352,7 +1352,7 @@ PPL_PROTO((ppl_Constraint_System_const_iterator_t* pcit,
 int
 ppl_assign_Constraint_System_const_iterator_from_Constraint_System_const_iterator
 PPL_PROTO((ppl_Constraint_System_const_iterator_t dst,
-	   ppl_const_Constraint_System_const_iterator_t src));
+           ppl_const_Constraint_System_const_iterator_t src));
 
 /*! \relates ppl_Constraint_System_const_iterator_tag \brief
   Invalidates the handle \p cit: this makes sure the corresponding
@@ -1374,7 +1374,7 @@ PPL_PROTO((ppl_const_Constraint_System_const_iterator_t cit));
 int
 ppl_Constraint_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Constraint_System_const_iterator_t cit,
-	   ppl_const_Constraint_t* pc));
+           ppl_const_Constraint_t* pc));
 
 /*! \relates ppl_Constraint_System_const_iterator_tag \brief
   Increment \p cit so that it "points" to the next constraint.
@@ -1390,7 +1390,7 @@ PPL_PROTO((ppl_Constraint_System_const_iterator_t cit));
 int
 ppl_Constraint_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Constraint_System_const_iterator_t x,
-	   ppl_const_Constraint_System_const_iterator_t y));
+           ppl_const_Constraint_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -1422,9 +1422,9 @@ enum ppl_enum_Generator_Type {
 */
 int
 ppl_new_Generator PPL_PROTO((ppl_Generator_t* pg,
-			     ppl_const_Linear_Expression_t le,
-			     enum ppl_enum_Generator_Type t,
-			     ppl_const_Coefficient_t d));
+                             ppl_const_Linear_Expression_t le,
+                             enum ppl_enum_Generator_Type t,
+                             ppl_const_Coefficient_t d));
 
 /*! \relates ppl_Generator_tag \brief
   Creates the point that is the origin of the zero-dimensional space
@@ -1448,14 +1448,14 @@ ppl_new_Generator_zero_dim_closure_point PPL_PROTO((ppl_Generator_t* pg));
 */
 int
 ppl_new_Generator_from_Generator PPL_PROTO((ppl_Generator_t* pg,
-					    ppl_const_Generator_t g));
+                                            ppl_const_Generator_t g));
 
 /*! \relates ppl_Generator_tag \brief
   Assigns a copy of the generator \p src to \p dst.
 */
 int
 ppl_assign_Generator_from_Generator PPL_PROTO((ppl_Generator_t dst,
-					       ppl_const_Generator_t src));
+                                               ppl_const_Generator_t src));
 
 /*! \relates ppl_Generator_tag \brief
   Invalidates the handle \p g: this makes sure the corresponding
@@ -1474,7 +1474,7 @@ ppl_delete_Generator PPL_PROTO((ppl_const_Generator_t g));
 */
 int
 ppl_Generator_space_dimension PPL_PROTO((ppl_const_Generator_t g,
-					 ppl_dimension_type* m));
+                                         ppl_dimension_type* m));
 
 /*! \relates ppl_Generator_tag \brief
   Returns the type of generator \p g.
@@ -1487,15 +1487,15 @@ ppl_Generator_type PPL_PROTO((ppl_const_Generator_t g));
 */
 int
 ppl_Generator_coefficient PPL_PROTO((ppl_const_Generator_t g,
-				     ppl_dimension_type var,
-				     ppl_Coefficient_t n));
+                                     ppl_dimension_type var,
+                                     ppl_Coefficient_t n));
 
 /*! \relates ppl_Generator_tag \brief
   If \p g is a point or a closure point assigns its divisor to \p n.
 */
 int
 ppl_Generator_divisor PPL_PROTO((ppl_const_Generator_t g,
-				 ppl_Coefficient_t n));
+                                 ppl_Coefficient_t n));
 
 /*! \relates ppl_Generator_tag \brief
   Returns a positive integer if \p g is well formed, i.e., if it
@@ -1536,7 +1536,7 @@ PPL_PROTO((ppl_Generator_System_t* pgs));
 */
 int
 ppl_new_Generator_System_from_Generator PPL_PROTO((ppl_Generator_System_t* pgs,
-						   ppl_const_Generator_t g));
+                                                   ppl_const_Generator_t g));
 
 /*! \relates ppl_Generator_System_tag \brief
   Builds a generator system that is a copy of \p gs; writes a handle
@@ -1587,7 +1587,7 @@ PPL_PROTO((ppl_const_Generator_System_t gs));
 int
 ppl_Generator_System_begin
 PPL_PROTO((ppl_const_Generator_System_t gs,
-	   ppl_Generator_System_const_iterator_t git));
+           ppl_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Generator_System_tag \brief
   Assigns to \p git a const iterator "pointing" past the end of the
@@ -1596,7 +1596,7 @@ PPL_PROTO((ppl_const_Generator_System_t gs,
 int
 ppl_Generator_System_end
 PPL_PROTO((ppl_const_Generator_System_t gs,
-	   ppl_Generator_System_const_iterator_t git));
+           ppl_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Generator_System_tag \brief
   Returns a positive integer if \p gs is well formed, i.e., if it
@@ -1624,7 +1624,7 @@ ppl_Generator_System_clear PPL_PROTO((ppl_Generator_System_t gs));
 */
 int
 ppl_Generator_System_insert_Generator PPL_PROTO((ppl_Generator_System_t gs,
-						 ppl_const_Generator_t g));
+                                                 ppl_const_Generator_t g));
 
 /*@}*/ /* Functions that May Modify the Generator System */
 
@@ -1649,7 +1649,7 @@ PPL_PROTO((ppl_Generator_System_const_iterator_t* pgit));
 int
 ppl_new_Generator_System_const_iterator_from_Generator_System_const_iterator
 PPL_PROTO((ppl_Generator_System_const_iterator_t* pgit,
-	   ppl_const_Generator_System_const_iterator_t git));
+           ppl_const_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Generator_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -1657,7 +1657,7 @@ PPL_PROTO((ppl_Generator_System_const_iterator_t* pgit,
 int
 ppl_assign_Generator_System_const_iterator_from_Generator_System_const_iterator
 PPL_PROTO((ppl_Generator_System_const_iterator_t dst,
-	   ppl_const_Generator_System_const_iterator_t src));
+           ppl_const_Generator_System_const_iterator_t src));
 
 /*! \relates ppl_Generator_System_const_iterator_tag \brief
   Invalidates the handle \p git: this makes sure the corresponding
@@ -1679,7 +1679,7 @@ PPL_PROTO((ppl_const_Generator_System_const_iterator_t git));
 int
 ppl_Generator_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Generator_System_const_iterator_t git,
-	   ppl_const_Generator_t* pg));
+           ppl_const_Generator_t* pg));
 
 /*! \relates ppl_Generator_System_const_iterator_tag \brief
   Increment \p git so that it "points" to the next generator.
@@ -1695,7 +1695,7 @@ PPL_PROTO((ppl_Generator_System_const_iterator_t git));
 int
 ppl_Generator_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Generator_System_const_iterator_t x,
-	   ppl_const_Generator_System_const_iterator_t y));
+           ppl_const_Generator_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -1710,8 +1710,8 @@ PPL_PROTO((ppl_const_Generator_System_const_iterator_t x,
 */
 int
 ppl_new_Congruence PPL_PROTO((ppl_Congruence_t* pc,
-			      ppl_const_Linear_Expression_t le,
-			      ppl_const_Coefficient_t m));
+                              ppl_const_Linear_Expression_t le,
+                              ppl_const_Coefficient_t m));
 
 /*! \relates ppl_Congruence_tag \brief
   Creates the unsatisfiable (zero-dimension space) congruence
@@ -1734,14 +1734,14 @@ ppl_new_Congruence_zero_dim_integrality PPL_PROTO((ppl_Congruence_t* pc));
 */
 int
 ppl_new_Congruence_from_Congruence PPL_PROTO((ppl_Congruence_t* pc,
-					      ppl_const_Congruence_t c));
+                                              ppl_const_Congruence_t c));
 
 /*! \relates ppl_Congruence_tag \brief
   Assigns a copy of the congruence \p src to \p dst.
 */
 int
 ppl_assign_Congruence_from_Congruence PPL_PROTO((ppl_Congruence_t dst,
-						 ppl_const_Congruence_t src));
+                                                 ppl_const_Congruence_t src));
 
 /*! \relates ppl_Congruence_tag \brief
   Invalidates the handle \p c: this makes sure the corresponding
@@ -1760,7 +1760,7 @@ ppl_delete_Congruence PPL_PROTO((ppl_const_Congruence_t c));
 */
 int
 ppl_Congruence_space_dimension PPL_PROTO((ppl_const_Congruence_t c,
-					  ppl_dimension_type* m));
+                                          ppl_dimension_type* m));
 
 /*! \relates ppl_Congruence_tag \brief
   Copies into \p n the coefficient of variable \p var in
@@ -1768,22 +1768,22 @@ ppl_Congruence_space_dimension PPL_PROTO((ppl_const_Congruence_t c,
 */
 int
 ppl_Congruence_coefficient PPL_PROTO((ppl_const_Congruence_t c,
-				      ppl_dimension_type var,
-				      ppl_Coefficient_t n));
+                                      ppl_dimension_type var,
+                                      ppl_Coefficient_t n));
 
 /*! \relates ppl_Congruence_tag \brief
   Copies into \p n the inhomogeneous term of congruence \p c.
 */
 int
 ppl_Congruence_inhomogeneous_term PPL_PROTO((ppl_const_Congruence_t c,
-					     ppl_Coefficient_t n));
+                                             ppl_Coefficient_t n));
 
 /*! \relates ppl_Congruence_tag \brief
   Copies into \p m the modulus of congruence \p c.
 */
 int
 ppl_Congruence_modulus PPL_PROTO((ppl_const_Congruence_t c,
-				  ppl_Coefficient_t m));
+                                  ppl_Coefficient_t m));
 
 /*! \relates ppl_Congruence_tag \brief
   Returns a positive integer if \p c is well formed, i.e., if it
@@ -1874,7 +1874,7 @@ PPL_PROTO((ppl_const_Congruence_System_t cs));
 int
 ppl_Congruence_System_begin
 PPL_PROTO((ppl_const_Congruence_System_t cs,
-	   ppl_Congruence_System_const_iterator_t cit));
+           ppl_Congruence_System_const_iterator_t cit));
 
 /*! \relates ppl_Congruence_System_tag \brief
   Assigns to \p cit a const iterator "pointing" past the end of the
@@ -1883,7 +1883,7 @@ PPL_PROTO((ppl_const_Congruence_System_t cs,
 int
 ppl_Congruence_System_end
 PPL_PROTO((ppl_const_Congruence_System_t cs,
-	   ppl_Congruence_System_const_iterator_t cit));
+           ppl_Congruence_System_const_iterator_t cit));
 
 /*! \relates ppl_Congruence_System_tag \brief
   Returns a positive integer if \p cs is well formed, i.e., if it
@@ -1911,7 +1911,7 @@ ppl_Congruence_System_clear PPL_PROTO((ppl_Congruence_System_t cs));
 */
 int
 ppl_Congruence_System_insert_Congruence PPL_PROTO((ppl_Congruence_System_t cs,
-						   ppl_const_Congruence_t c));
+                                                   ppl_const_Congruence_t c));
 
 /*@}*/ /* Functions that May Modify the Congruence System */
 
@@ -1936,7 +1936,7 @@ PPL_PROTO((ppl_Congruence_System_const_iterator_t* pcit));
 int
 ppl_new_Congruence_System_const_iterator_from_Congruence_System_const_iterator
 PPL_PROTO((ppl_Congruence_System_const_iterator_t* pcit,
-	   ppl_const_Congruence_System_const_iterator_t cit));
+           ppl_const_Congruence_System_const_iterator_t cit));
 
 /*! \relates ppl_Congruence_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -1944,7 +1944,7 @@ PPL_PROTO((ppl_Congruence_System_const_iterator_t* pcit,
 int
 ppl_assign_Congruence_System_const_iterator_from_Congruence_System_const_iterator
 PPL_PROTO((ppl_Congruence_System_const_iterator_t dst,
-	   ppl_const_Congruence_System_const_iterator_t src));
+           ppl_const_Congruence_System_const_iterator_t src));
 
 /*! \relates ppl_Congruence_System_const_iterator_tag \brief
   Invalidates the handle \p cit: this makes sure the corresponding
@@ -1966,7 +1966,7 @@ PPL_PROTO((ppl_const_Congruence_System_const_iterator_t cit));
 int
 ppl_Congruence_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Congruence_System_const_iterator_t cit,
-	   ppl_const_Congruence_t* pc));
+           ppl_const_Congruence_t* pc));
 
 /*! \relates ppl_Congruence_System_const_iterator_tag \brief
   Increment \p cit so that it "points" to the next congruence.
@@ -1982,7 +1982,7 @@ PPL_PROTO((ppl_Congruence_System_const_iterator_t cit));
 int
 ppl_Congruence_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Congruence_System_const_iterator_t x,
-	   ppl_const_Congruence_System_const_iterator_t y));
+           ppl_const_Congruence_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -2012,9 +2012,9 @@ enum ppl_enum_Grid_Generator_Type {
 */
 int
 ppl_new_Grid_Generator PPL_PROTO((ppl_Grid_Generator_t* pg,
-				  ppl_const_Linear_Expression_t le,
-				  enum ppl_enum_Grid_Generator_Type t,
-				  ppl_const_Coefficient_t d));
+                                  ppl_const_Linear_Expression_t le,
+                                  enum ppl_enum_Grid_Generator_Type t,
+                                  ppl_const_Coefficient_t d));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Creates the point that is the origin of the zero-dimensional space
@@ -2038,7 +2038,7 @@ PPL_PROTO((ppl_Grid_Generator_t* pg, ppl_const_Grid_Generator_t g));
 int
 ppl_assign_Grid_Generator_from_Grid_Generator
 PPL_PROTO((ppl_Grid_Generator_t dst,
-	   ppl_const_Grid_Generator_t src));
+           ppl_const_Grid_Generator_t src));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Invalidates the handle \p g: this makes sure the corresponding
@@ -2057,7 +2057,7 @@ ppl_delete_Grid_Generator PPL_PROTO((ppl_const_Grid_Generator_t g));
 */
 int
 ppl_Grid_Generator_space_dimension PPL_PROTO((ppl_const_Grid_Generator_t g,
-					      ppl_dimension_type* m));
+                                              ppl_dimension_type* m));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Returns the type of grid generator \p g.
@@ -2071,15 +2071,15 @@ ppl_Grid_Generator_type PPL_PROTO((ppl_const_Grid_Generator_t g));
 */
 int
 ppl_Grid_Generator_coefficient PPL_PROTO((ppl_const_Grid_Generator_t g,
-					  ppl_dimension_type var,
-					  ppl_Coefficient_t n));
+                                          ppl_dimension_type var,
+                                          ppl_Coefficient_t n));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   If \p g is a point or a parameter assigns its divisor to \p n.
 */
 int
 ppl_Grid_Generator_divisor PPL_PROTO((ppl_const_Grid_Generator_t g,
-				      ppl_Coefficient_t n));
+                                      ppl_Coefficient_t n));
 
 /*! \relates ppl_Grid_Generator_tag \brief
   Returns a positive integer if \p g is well formed, i.e., if it
@@ -2121,7 +2121,7 @@ PPL_PROTO((ppl_Grid_Generator_System_t* pgs));
 int
 ppl_new_Grid_Generator_System_from_Grid_Generator
 PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
-	   ppl_const_Grid_Generator_t g));
+           ppl_const_Grid_Generator_t g));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Builds a grid generator system that is a copy of \p gs; writes a handle
@@ -2130,7 +2130,7 @@ PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
 int
 ppl_new_Grid_Generator_System_from_Grid_Generator_System
 PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
-	   ppl_const_Grid_Generator_System_t gs));
+           ppl_const_Grid_Generator_System_t gs));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Assigns a copy of the grid generator system \p src to \p dst.
@@ -2138,7 +2138,7 @@ PPL_PROTO((ppl_Grid_Generator_System_t* pgs,
 int
 ppl_assign_Grid_Generator_System_from_Grid_Generator_System
 PPL_PROTO((ppl_Grid_Generator_System_t dst,
-	   ppl_const_Grid_Generator_System_t src));
+           ppl_const_Grid_Generator_System_t src));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Invalidates the handle \p gs: this makes sure the corresponding
@@ -2175,7 +2175,7 @@ PPL_PROTO((ppl_const_Grid_Generator_System_t gs));
 int
 ppl_Grid_Generator_System_begin
 PPL_PROTO((ppl_const_Grid_Generator_System_t gs,
-	   ppl_Grid_Generator_System_const_iterator_t git));
+           ppl_Grid_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Assigns to \p git a const iterator "pointing" past the end of the
@@ -2184,7 +2184,7 @@ PPL_PROTO((ppl_const_Grid_Generator_System_t gs,
 int
 ppl_Grid_Generator_System_end
 PPL_PROTO((ppl_const_Grid_Generator_System_t gs,
-	   ppl_Grid_Generator_System_const_iterator_t git));
+           ppl_Grid_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Grid_Generator_System_tag \brief
   Returns a positive integer if \p gs is well formed, i.e., if it
@@ -2213,7 +2213,7 @@ ppl_Grid_Generator_System_clear PPL_PROTO((ppl_Grid_Generator_System_t gs));
 int
 ppl_Grid_Generator_System_insert_Grid_Generator
 PPL_PROTO((ppl_Grid_Generator_System_t gs,
-	   ppl_const_Grid_Generator_t g));
+           ppl_const_Grid_Generator_t g));
 
 /*@}*/ /* Functions that May Modify the Grid Generator System */
 
@@ -2238,7 +2238,7 @@ PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t* pgit));
 int
 ppl_new_Grid_Generator_System_const_iterator_from_Grid_Generator_System_const_iterator
 PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t* pgit,
-	   ppl_const_Grid_Generator_System_const_iterator_t git));
+           ppl_const_Grid_Generator_System_const_iterator_t git));
 
 /*! \relates ppl_Grid_Generator_System_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -2246,7 +2246,7 @@ PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t* pgit,
 int
 ppl_assign_Grid_Generator_System_const_iterator_from_Grid_Generator_System_const_iterator
 PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t dst,
-	   ppl_const_Grid_Generator_System_const_iterator_t src));
+           ppl_const_Grid_Generator_System_const_iterator_t src));
 
 /*! \relates ppl_Grid_Generator_System_const_iterator_tag \brief
   Invalidates the handle \p git: this makes sure the corresponding
@@ -2268,7 +2268,7 @@ PPL_PROTO((ppl_const_Grid_Generator_System_const_iterator_t git));
 int
 ppl_Grid_Generator_System_const_iterator_dereference
 PPL_PROTO((ppl_const_Grid_Generator_System_const_iterator_t git,
-	   ppl_const_Grid_Generator_t* pg));
+           ppl_const_Grid_Generator_t* pg));
 
 /*! \relates ppl_Grid_Generator_System_const_iterator_tag \brief
   Increment \p git so that it "points" to the next grid generator.
@@ -2284,7 +2284,7 @@ PPL_PROTO((ppl_Grid_Generator_System_const_iterator_t git));
 int
 ppl_Grid_Generator_System_const_iterator_equal_test
 PPL_PROTO((ppl_const_Grid_Generator_System_const_iterator_t x,
-	   ppl_const_Grid_Generator_System_const_iterator_t y));
+           ppl_const_Grid_Generator_System_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
@@ -2509,7 +2509,7 @@ extern int PPL_PIP_PROBLEM_CONTROL_PARAMETER_PIVOT_ROW_STRATEGY_MAX_COLUMN;
 */
 int
 ppl_new_MIP_Problem_from_space_dimension PPL_PROTO((ppl_MIP_Problem_t* pmip,
-						    ppl_dimension_type d));
+                                                    ppl_dimension_type d));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Builds a MIP problem of space dimension \p d having feasible region \p cs,
@@ -2518,10 +2518,10 @@ ppl_new_MIP_Problem_from_space_dimension PPL_PROTO((ppl_MIP_Problem_t* pmip,
 */
 int
 ppl_new_MIP_Problem PPL_PROTO((ppl_MIP_Problem_t* pmip,
-			       ppl_dimension_type d,
-			       ppl_const_Constraint_System_t cs,
-			       ppl_const_Linear_Expression_t le,
-			       int m));
+                               ppl_dimension_type d,
+                               ppl_const_Constraint_System_t cs,
+                               ppl_const_Linear_Expression_t le,
+                               int m));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Builds a MIP problem that is a copy of \p mip; writes a handle
@@ -2579,7 +2579,7 @@ PPL_PROTO((ppl_const_MIP_Problem_t mip, ppl_dimension_type ds[]));
 */
 int
 ppl_MIP_Problem_number_of_constraints PPL_PROTO((ppl_const_MIP_Problem_t mip,
-						 ppl_dimension_type* m));
+                                                 ppl_dimension_type* m));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes at address \p pc a const handle to the \p i-th constraint
@@ -2587,8 +2587,8 @@ ppl_MIP_Problem_number_of_constraints PPL_PROTO((ppl_const_MIP_Problem_t mip,
 */
 int
 ppl_MIP_Problem_constraint_at_index PPL_PROTO((ppl_const_MIP_Problem_t mip,
-					       ppl_dimension_type i,
-					       ppl_const_Constraint_t* pc));
+                                               ppl_dimension_type i,
+                                               ppl_const_Constraint_t* pc));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes a const handle to the linear expression defining the
@@ -2646,7 +2646,7 @@ PPL_PROTO((ppl_MIP_Problem_t mip, ppl_dimension_type ds[], size_t n));
 */
 int
 ppl_MIP_Problem_add_constraint PPL_PROTO((ppl_MIP_Problem_t mip,
-					  ppl_const_Constraint_t c));
+                                          ppl_const_Constraint_t c));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Modifies the feasible region of the MIP problem \p mip by adding a copy
@@ -2654,7 +2654,7 @@ ppl_MIP_Problem_add_constraint PPL_PROTO((ppl_MIP_Problem_t mip,
 */
 int
 ppl_MIP_Problem_add_constraints PPL_PROTO((ppl_MIP_Problem_t mip,
-					   ppl_const_Constraint_System_t cs));
+                                           ppl_const_Constraint_System_t cs));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Sets the objective function of the MIP problem \p mip to a copy of \p le.
@@ -2668,7 +2668,7 @@ PPL_PROTO((ppl_MIP_Problem_t mip, ppl_const_Linear_Expression_t le));
 */
 int
 ppl_MIP_Problem_set_optimization_mode PPL_PROTO((ppl_MIP_Problem_t mip,
-						 int mode));
+                                                 int mode));
 
 /*@}*/ /* Functions that May Modify the MIP_Problem */
 
@@ -2714,7 +2714,7 @@ ppl_MIP_Problem_solve PPL_PROTO((ppl_const_MIP_Problem_t mip));
 int
 ppl_MIP_Problem_evaluate_objective_function
 PPL_PROTO((ppl_const_MIP_Problem_t mip, ppl_const_Generator_t g,
-	   ppl_Coefficient_t num, ppl_Coefficient_t den));
+           ppl_Coefficient_t num, ppl_Coefficient_t den));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes a const handle to a feasible point for the MIP problem \p mip
@@ -2722,7 +2722,7 @@ PPL_PROTO((ppl_const_MIP_Problem_t mip, ppl_const_Generator_t g,
 */
 int
 ppl_MIP_Problem_feasible_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
-					  ppl_const_Generator_t* pg));
+                                          ppl_const_Generator_t* pg));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Writes a const handle to an optimizing point for the MIP problem \p mip
@@ -2730,7 +2730,7 @@ ppl_MIP_Problem_feasible_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
 */
 int
 ppl_MIP_Problem_optimizing_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
-					    ppl_const_Generator_t* pg));
+                                            ppl_const_Generator_t* pg));
 
 /*! \relates ppl_MIP_Problem_tag \brief
   Returns the optimal value for \p mip.
@@ -2747,7 +2747,7 @@ ppl_MIP_Problem_optimizing_point PPL_PROTO((ppl_const_MIP_Problem_t mip,
 int
 ppl_MIP_Problem_optimal_value
 PPL_PROTO((ppl_const_MIP_Problem_t mip,
-	   ppl_Coefficient_t num, ppl_Coefficient_t den));
+           ppl_Coefficient_t num, ppl_Coefficient_t den));
 
 /*@}*/ /* Computing the Solution of the MIP_Problem */
 
@@ -2794,7 +2794,7 @@ PPL_PROTO((ppl_const_MIP_Problem_t mip, size_t* sz));
 */
 int
 ppl_new_PIP_Problem_from_space_dimension PPL_PROTO((ppl_PIP_Problem_t* ppip,
-						    ppl_dimension_type d));
+                                                    ppl_dimension_type d));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Builds a PIP problem that is a copy of \p pip; writes a handle
@@ -2878,7 +2878,7 @@ PPL_PROTO((ppl_const_PIP_Problem_t pip, ppl_dimension_type* pd));
 */
 int
 ppl_PIP_Problem_number_of_constraints PPL_PROTO((ppl_const_PIP_Problem_t pip,
-						 ppl_dimension_type* m));
+                                                 ppl_dimension_type* m));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Writes at address \p pc a const handle to the \p i-th constraint
@@ -2886,8 +2886,8 @@ ppl_PIP_Problem_number_of_constraints PPL_PROTO((ppl_const_PIP_Problem_t pip,
 */
 int
 ppl_PIP_Problem_constraint_at_index PPL_PROTO((ppl_const_PIP_Problem_t pip,
-					       ppl_dimension_type i,
-					       ppl_const_Constraint_t* pc));
+                                               ppl_dimension_type i,
+                                               ppl_const_Constraint_t* pc));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Writes into \p *sz the size in bytes of the memory occupied by \p pip.
@@ -2970,7 +2970,7 @@ PPL_PROTO((ppl_PIP_Problem_t pip, ppl_dimension_type d));
 */
 int
 ppl_PIP_Problem_add_constraint PPL_PROTO((ppl_PIP_Problem_t pip,
-					  ppl_const_Constraint_t c));
+                                          ppl_const_Constraint_t c));
 
 /*! \relates ppl_PIP_Problem_tag \brief
   Modifies the feasible region of the PIP problem \p pip by adding a copy
@@ -2978,7 +2978,7 @@ ppl_PIP_Problem_add_constraint PPL_PROTO((ppl_PIP_Problem_t pip,
 */
 int
 ppl_PIP_Problem_add_constraints PPL_PROTO((ppl_PIP_Problem_t pip,
-					   ppl_const_Constraint_System_t cs));
+                                           ppl_const_Constraint_System_t cs));
 
 /*@}*/ /* Functions that May Modify the PIP_Problem */
 
@@ -3192,7 +3192,7 @@ PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t* papit));
 int
 ppl_new_Artificial_Parameter_Sequence_const_iterator_from_Artificial_Parameter_Sequence_const_iterator
 PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t* papit,
-	   ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit));
+           ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit));
 
 /*! \relates ppl_Artificial_Parameter_Sequence_const_iterator_tag \brief
   Assigns a copy of the const iterator \p src to \p dst.
@@ -3200,7 +3200,7 @@ PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t* papit,
 int
 ppl_assign_Artificial_Parameter_Sequence_const_iterator_from_Artificial_Parameter_Sequence_const_iterator
 PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t dst,
-	   ppl_const_Artificial_Parameter_Sequence_const_iterator_t src));
+           ppl_const_Artificial_Parameter_Sequence_const_iterator_t src));
 
 /*! \relates ppl_Artificial_Parameter_Sequence_const_iterator_tag \brief
   Invalidates the handle \p apit: this makes sure the corresponding
@@ -3222,7 +3222,7 @@ PPL_PROTO((ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit));
 int
 ppl_Artificial_Parameter_Sequence_const_iterator_dereference
 PPL_PROTO((ppl_const_Artificial_Parameter_Sequence_const_iterator_t apit,
-	   ppl_const_Artificial_Parameter_t* pap));
+           ppl_const_Artificial_Parameter_t* pap));
 
 /*! \relates ppl_Artificial_Parameter_Sequence_const_iterator_tag \brief
   Increment \p apit so that it "points" to the next artificial parameter.
@@ -3238,7 +3238,7 @@ PPL_PROTO((ppl_Artificial_Parameter_Sequence_const_iterator_t apit));
 int
 ppl_Artificial_Parameter_Sequence_const_iterator_equal_test
 PPL_PROTO((ppl_const_Artificial_Parameter_Sequence_const_iterator_t x,
-	   ppl_const_Artificial_Parameter_Sequence_const_iterator_t y));
+           ppl_const_Artificial_Parameter_Sequence_const_iterator_t y));
 
 /*@}*/ /* Dereferencing, Incrementing and Equality Testing */
 
diff --git a/interfaces/C/ppl_c_implementation_common.cc b/interfaces/C/ppl_c_implementation_common.cc
index b884410..85b027a 100644
--- a/interfaces/C/ppl_c_implementation_common.cc
+++ b/interfaces/C/ppl_c_implementation_common.cc
@@ -1,6 +1,6 @@
 /* Implementation of the C interface: variables and non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,7 +23,7 @@ site: http://bugseng.com/products/ppl/ . */
 
 /* Interface for Coefficient. */
 
-#include "ppl_c_implementation_common.defs.hh"
+#include "ppl_c_implementation_common_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -378,7 +378,7 @@ CATCH_ALL
 
 int
 ppl_new_Coefficient_from_Coefficient(ppl_Coefficient_t* pc,
-				     ppl_const_Coefficient_t c) try {
+                                     ppl_const_Coefficient_t c) try {
   const Coefficient& cc = *to_const(c);
   *pc = to_nonconst(new Coefficient(cc));
   return 0;
@@ -409,7 +409,7 @@ CATCH_ALL
 
 int
 ppl_assign_Coefficient_from_Coefficient(ppl_Coefficient_t dst,
-					ppl_const_Coefficient_t src) try {
+                                        ppl_const_Coefficient_t src) try {
   const Coefficient& ssrc = *to_const(src);
   Coefficient& ddst = *to_nonconst(dst);
   ddst = ssrc;
@@ -433,8 +433,8 @@ int
 ppl_Coefficient_min(mpz_t min) try {
   if (std::numeric_limits<Coefficient>::is_bounded) {
     assign_r(reinterpret_mpz_class(min),
-	     std::numeric_limits<Coefficient>::min(),
-	     ROUND_NOT_NEEDED);
+             std::numeric_limits<Coefficient>::min(),
+             ROUND_NOT_NEEDED);
     return 1;
   }
   else
@@ -446,8 +446,8 @@ int
 ppl_Coefficient_max(mpz_t max) try {
   if (std::numeric_limits<Coefficient>::is_bounded) {
     assign_r(reinterpret_mpz_class(max),
-	     std::numeric_limits<Coefficient>::max(),
-	     ROUND_NOT_NEEDED);
+             std::numeric_limits<Coefficient>::max(),
+             ROUND_NOT_NEEDED);
     return 1;
   }
   else
@@ -466,10 +466,10 @@ CATCH_ALL
 
 int
 ppl_new_Linear_Expression_with_dimension(ppl_Linear_Expression_t* ple,
-					 ppl_dimension_type d) try {
+                                         ppl_dimension_type d) try {
   *ple = to_nonconst(d == 0
-		     ? new Linear_Expression(0)
-		     : new Linear_Expression(0*Variable(d-1)));
+                     ? new Linear_Expression(0)
+                     : new Linear_Expression(0*Variable(d-1)));
   return 0;
 }
 CATCH_ALL
@@ -502,8 +502,8 @@ CATCH_ALL
 
 int
 ppl_Linear_Expression_add_to_coefficient(ppl_Linear_Expression_t le,
-					 ppl_dimension_type var,
-					 ppl_const_Coefficient_t n) try {
+                                         ppl_dimension_type var,
+                                         ppl_const_Coefficient_t n) try {
   Linear_Expression& lle = *to_nonconst(le);
   const Coefficient& nn = *to_const(n);
   add_mul_assign(lle, nn, Variable(var));
@@ -513,7 +513,7 @@ CATCH_ALL
 
 int
 ppl_Linear_Expression_add_to_inhomogeneous(ppl_Linear_Expression_t le,
-					   ppl_const_Coefficient_t n) try {
+                                           ppl_const_Coefficient_t n) try {
   Linear_Expression& lle = *to_nonconst(le);
   const Coefficient& nn = *to_const(n);
   lle += nn;
@@ -543,7 +543,7 @@ CATCH_ALL
 
 int
 ppl_multiply_Linear_Expression_by_Coefficient(ppl_Linear_Expression_t le,
-					      ppl_const_Coefficient_t n) try {
+                                              ppl_const_Coefficient_t n) try {
   Linear_Expression& lle = *to_nonconst(le);
   const Coefficient& nn = *to_const(n);
   lle *= nn;
@@ -553,7 +553,7 @@ CATCH_ALL
 
 int
 ppl_Linear_Expression_space_dimension(ppl_const_Linear_Expression_t le,
-				      ppl_dimension_type* m) try {
+                                      ppl_dimension_type* m) try {
   *m = to_const(le)->space_dimension();
   return 0;
 }
@@ -561,8 +561,8 @@ CATCH_ALL
 
 int
 ppl_Linear_Expression_coefficient(ppl_const_Linear_Expression_t le,
-				  ppl_dimension_type var,
-				  ppl_Coefficient_t n) try {
+                                  ppl_dimension_type var,
+                                  ppl_Coefficient_t n) try {
   const Linear_Expression& lle = *to_const(le);
   Coefficient& nn = *to_nonconst(n);
   nn = lle.coefficient(Variable(var));
@@ -572,7 +572,7 @@ CATCH_ALL
 
 int
 ppl_Linear_Expression_inhomogeneous_term(ppl_const_Linear_Expression_t le,
-					 ppl_Coefficient_t n) try {
+                                         ppl_Coefficient_t n) try {
   const Linear_Expression& lle = *to_const(le);
   Coefficient& nn = *to_nonconst(n);
   nn = lle.inhomogeneous_term();
@@ -603,8 +603,8 @@ CATCH_ALL
 
 int
 ppl_new_Constraint(ppl_Constraint_t* pc,
-		   ppl_const_Linear_Expression_t le,
-		   enum ppl_enum_Constraint_Type t) try {
+                   ppl_const_Linear_Expression_t le,
+                   enum ppl_enum_Constraint_Type t) try {
   Constraint* ppc;
   const Linear_Expression& lle = *to_const(le);
   switch (t) {
@@ -625,7 +625,7 @@ ppl_new_Constraint(ppl_Constraint_t* pc,
     break;
   default:
     throw std::invalid_argument("ppl_new_Constraint(pc, le, t): "
-				"t invalid");
+                                "t invalid");
   }
   *pc = to_nonconst(ppc);
   return 0;
@@ -648,7 +648,7 @@ CATCH_ALL
 
 int
 ppl_new_Constraint_from_Constraint(ppl_Constraint_t* pc,
-				   ppl_const_Constraint_t c) try {
+                                   ppl_const_Constraint_t c) try {
   const Constraint& cc = *to_const(c);
   *pc = to_nonconst(new Constraint(cc));
   return 0;
@@ -664,7 +664,7 @@ CATCH_ALL
 
 int
 ppl_assign_Constraint_from_Constraint(ppl_Constraint_t dst,
-				      ppl_const_Constraint_t src) try {
+                                      ppl_const_Constraint_t src) try {
   const Constraint& ssrc = *to_const(src);
   Constraint& ddst = *to_nonconst(dst);
   ddst = ssrc;
@@ -674,7 +674,7 @@ CATCH_ALL
 
 int
 ppl_Constraint_space_dimension(ppl_const_Constraint_t c,
-			       ppl_dimension_type* m) try {
+                               ppl_dimension_type* m) try {
   *m = to_const(c)->space_dimension();
   return 0;
 }
@@ -696,8 +696,8 @@ CATCH_ALL
 
 int
 ppl_Constraint_coefficient(ppl_const_Constraint_t c,
-			   ppl_dimension_type var,
-			   ppl_Coefficient_t n) try {
+                           ppl_dimension_type var,
+                           ppl_Coefficient_t n) try {
   const Constraint& cc = *to_const(c);
   Coefficient& nn = *to_nonconst(n);
   nn = cc.coefficient(Variable(var));
@@ -707,7 +707,7 @@ CATCH_ALL
 
 int
 ppl_Constraint_inhomogeneous_term(ppl_const_Constraint_t c,
-				  ppl_Coefficient_t n) try {
+                                  ppl_Coefficient_t n) try {
   const Constraint& cc = *to_const(c);
   Coefficient& nn = *to_nonconst(n);
   nn = cc.inhomogeneous_term();
@@ -723,9 +723,9 @@ CATCH_ALL
 
 int
 ppl_new_Linear_Expression_from_Constraint(ppl_Linear_Expression_t* ple,
-					  ppl_const_Constraint_t c) try {
+                                          ppl_const_Constraint_t c) try {
   const Constraint& cc = *to_const(c);
-  *ple = to_nonconst(new Linear_Expression(cc));
+  *ple = to_nonconst(new Linear_Expression(cc.expression()));
   return 0;
 }
 CATCH_ALL
@@ -742,7 +742,7 @@ CATCH_ALL
 int
 ppl_new_Constraint_System_zero_dim_empty(ppl_Constraint_System_t* pcs) try {
   *pcs = to_nonconst(new
-		     Constraint_System(Constraint_System::zero_dim_empty()));
+                     Constraint_System(Constraint_System::zero_dim_empty()));
   return 0;
 }
 CATCH_ALL
@@ -750,7 +750,7 @@ CATCH_ALL
 
 int
 ppl_new_Constraint_System_from_Constraint(ppl_Constraint_System_t* pcs,
-					  ppl_const_Constraint_t c) try {
+                                          ppl_const_Constraint_t c) try {
   const Constraint& cc = *to_const(c);
   *pcs = to_nonconst(new Constraint_System(cc));
   return 0;
@@ -785,7 +785,7 @@ CATCH_ALL
 
 int
 ppl_Constraint_System_space_dimension(ppl_const_Constraint_System_t cs,
-				      ppl_dimension_type* m) try {
+                                      ppl_dimension_type* m) try {
   *m = to_const(cs)->space_dimension();
   return 0;
 }
@@ -816,7 +816,7 @@ CATCH_ALL
 
 int
 ppl_Constraint_System_insert_Constraint(ppl_Constraint_System_t cs,
-					ppl_const_Constraint_t c) try {
+                                        ppl_const_Constraint_t c) try {
   const Constraint& cc = *to_const(c);
   Constraint_System& ccs = *to_nonconst(cs);
   ccs.insert(cc);
@@ -871,7 +871,7 @@ CATCH_ALL
 
 int
 ppl_Constraint_System_begin(ppl_const_Constraint_System_t cs,
-			    ppl_Constraint_System_const_iterator_t cit) try {
+                            ppl_Constraint_System_const_iterator_t cit) try {
   const Constraint_System& ccs = *to_const(cs);
   Constraint_System::const_iterator& ccit = *to_nonconst(cit);
   ccit = ccs.begin();
@@ -881,7 +881,7 @@ CATCH_ALL
 
 int
 ppl_Constraint_System_end(ppl_const_Constraint_System_t cs,
-			  ppl_Constraint_System_const_iterator_t cit) try {
+                          ppl_Constraint_System_const_iterator_t cit) try {
   const Constraint_System& ccs = *to_const(cs);
   Constraint_System::const_iterator& ccit = *to_nonconst(cit);
   ccit = ccs.end();
@@ -923,9 +923,9 @@ CATCH_ALL
 
 int
 ppl_new_Generator(ppl_Generator_t* pg,
-		  ppl_const_Linear_Expression_t le,
-		  enum ppl_enum_Generator_Type t,
-		  ppl_const_Coefficient_t d) try {
+                  ppl_const_Linear_Expression_t le,
+                  enum ppl_enum_Generator_Type t,
+                  ppl_const_Coefficient_t d) try {
   Generator* ppg;
   const Linear_Expression& lle = *to_const(le);
   const Coefficient& dd = *to_const(d);
@@ -966,7 +966,7 @@ CATCH_ALL
 
 int
 ppl_new_Generator_from_Generator(ppl_Generator_t* pg,
-				 ppl_const_Generator_t g) try {
+                                 ppl_const_Generator_t g) try {
   const Generator& gg = *to_const(g);
   *pg = to_nonconst(new Generator(gg));
   return 0;
@@ -982,7 +982,7 @@ CATCH_ALL
 
 int
 ppl_assign_Generator_from_Generator(ppl_Generator_t dst,
-				      ppl_const_Generator_t src) try {
+                                      ppl_const_Generator_t src) try {
   const Generator& ssrc = *to_const(src);
   Generator& ddst = *to_nonconst(dst);
   ddst = ssrc;
@@ -992,7 +992,7 @@ CATCH_ALL
 
 int
 ppl_Generator_space_dimension(ppl_const_Generator_t g,
-			      ppl_dimension_type* m) try {
+                              ppl_dimension_type* m) try {
   *m = to_const(g)->space_dimension();
   return 0;
 }
@@ -1016,8 +1016,8 @@ CATCH_ALL
 
 int
 ppl_Generator_coefficient(ppl_const_Generator_t g,
-			  ppl_dimension_type var,
-			  ppl_Coefficient_t n) try {
+                          ppl_dimension_type var,
+                          ppl_Coefficient_t n) try {
   const Generator& gg = *to_const(g);
   Coefficient& nn = *to_nonconst(n);
   nn = gg.coefficient(Variable(var));
@@ -1027,7 +1027,7 @@ CATCH_ALL
 
 int
 ppl_Generator_divisor(ppl_const_Generator_t g,
-		      ppl_Coefficient_t n) try {
+                      ppl_Coefficient_t n) try {
   const Generator& gg = *to_const(g);
   Coefficient& nn = *to_nonconst(n);
   nn = gg.divisor();
@@ -1043,9 +1043,9 @@ CATCH_ALL
 
 int
 ppl_new_Linear_Expression_from_Generator(ppl_Linear_Expression_t* ple,
-					 ppl_const_Generator_t g) try {
+                                         ppl_const_Generator_t g) try {
   const Generator& gg = *to_const(g);
-  *ple = to_nonconst(new Linear_Expression(gg));
+  *ple = to_nonconst(new Linear_Expression(gg.expression()));
   return 0;
 }
 CATCH_ALL
@@ -1068,7 +1068,7 @@ CATCH_ALL
 
 int
 ppl_new_Generator_System_from_Generator(ppl_Generator_System_t* pgs,
-			      ppl_const_Generator_t g) try {
+                              ppl_const_Generator_t g) try {
   const Generator& gg = *to_const(g);
   *pgs = to_nonconst(new Generator_System(gg));
   return 0;
@@ -1103,7 +1103,7 @@ CATCH_ALL
 
 int
 ppl_Generator_System_space_dimension(ppl_const_Generator_System_t gs,
-				     ppl_dimension_type* m) try {
+                                     ppl_dimension_type* m) try {
   *m = to_const(gs)->space_dimension();
   return 0;
 }
@@ -1126,7 +1126,7 @@ CATCH_ALL
 
 int
 ppl_Generator_System_insert_Generator(ppl_Generator_System_t gs,
-				      ppl_const_Generator_t g) try {
+                                      ppl_const_Generator_t g) try {
   const Generator& gg = *to_const(g);
   Generator_System& ggs = *to_nonconst(gs);
   ggs.insert(gg);
@@ -1180,7 +1180,7 @@ CATCH_ALL
 
 int
 ppl_Generator_System_begin(ppl_const_Generator_System_t gs,
-			   ppl_Generator_System_const_iterator_t git) try {
+                           ppl_Generator_System_const_iterator_t git) try {
   const Generator_System& ggs = *to_const(gs);
   Generator_System::const_iterator& ggit = *to_nonconst(git);
   ggit = ggs.begin();
@@ -1190,7 +1190,7 @@ CATCH_ALL
 
 int
 ppl_Generator_System_end(ppl_const_Generator_System_t gs,
-			 ppl_Generator_System_const_iterator_t git) try {
+                         ppl_Generator_System_const_iterator_t git) try {
   const Generator_System& ggs = *to_const(gs);
   Generator_System::const_iterator& ggit = *to_nonconst(git);
   ggit = ggs.end();
@@ -1232,8 +1232,8 @@ CATCH_ALL
 
 int
 ppl_new_Congruence(ppl_Congruence_t* pc,
-		   ppl_const_Linear_Expression_t le,
-		   ppl_const_Coefficient_t m) try {
+                   ppl_const_Linear_Expression_t le,
+                   ppl_const_Coefficient_t m) try {
   Congruence* ppc;
   const Linear_Expression& lle = *to_const(le);
   const Coefficient& mm = *to_const(m);
@@ -1259,7 +1259,7 @@ CATCH_ALL
 
 int
 ppl_new_Congruence_from_Congruence(ppl_Congruence_t* pc,
-				   ppl_const_Congruence_t c) try {
+                                   ppl_const_Congruence_t c) try {
   const Congruence& cc = *to_const(c);
   *pc = to_nonconst(new Congruence(cc));
   return 0;
@@ -1275,7 +1275,7 @@ CATCH_ALL
 
 int
 ppl_assign_Congruence_from_Congruence(ppl_Congruence_t dst,
-				      ppl_const_Congruence_t src) try {
+                                      ppl_const_Congruence_t src) try {
   const Congruence& ssrc = *to_const(src);
   Congruence& ddst = *to_nonconst(dst);
   ddst = ssrc;
@@ -1285,7 +1285,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_space_dimension(ppl_const_Congruence_t c,
-			       ppl_dimension_type* m) try {
+                               ppl_dimension_type* m) try {
   *m = to_const(c)->space_dimension();
   return 0;
 }
@@ -1293,8 +1293,8 @@ CATCH_ALL
 
 int
 ppl_Congruence_coefficient(ppl_const_Congruence_t c,
-			   ppl_dimension_type var,
-			   ppl_Coefficient_t n) try {
+                           ppl_dimension_type var,
+                           ppl_Coefficient_t n) try {
   const Congruence& cc = *to_const(c);
   Coefficient& nn = *to_nonconst(n);
   nn = cc.coefficient(Variable(var));
@@ -1304,7 +1304,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_inhomogeneous_term(ppl_const_Congruence_t c,
-				  ppl_Coefficient_t n) try {
+                                  ppl_Coefficient_t n) try {
   const Congruence& cc = *to_const(c);
   Coefficient& nn = *to_nonconst(n);
   nn = cc.inhomogeneous_term();
@@ -1314,7 +1314,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_modulus(ppl_const_Congruence_t c,
-		       ppl_Coefficient_t m) try {
+                       ppl_Coefficient_t m) try {
   const Congruence& cc = *to_const(c);
   Coefficient& mm = *to_nonconst(m);
   mm = cc.modulus();
@@ -1330,9 +1330,9 @@ CATCH_ALL
 
 int
 ppl_new_Linear_Expression_from_Congruence(ppl_Linear_Expression_t* ple,
-					  ppl_const_Congruence_t c) try {
+                                          ppl_const_Congruence_t c) try {
   const Congruence& cc = *to_const(c);
-  *ple = to_nonconst(new Linear_Expression(cc));
+  *ple = to_nonconst(new Linear_Expression(cc.expression()));
   return 0;
 }
 CATCH_ALL
@@ -1349,7 +1349,7 @@ CATCH_ALL
 int
 ppl_new_Congruence_System_zero_dim_empty(ppl_Congruence_System_t* pcs) try {
   *pcs = to_nonconst(new
-		     Congruence_System(Congruence_System::zero_dim_empty()));
+                     Congruence_System(Congruence_System::zero_dim_empty()));
   return 0;
 }
 CATCH_ALL
@@ -1357,7 +1357,7 @@ CATCH_ALL
 
 int
 ppl_new_Congruence_System_from_Congruence(ppl_Congruence_System_t* pcs,
-					  ppl_const_Congruence_t c) try {
+                                          ppl_const_Congruence_t c) try {
   const Congruence& cc = *to_const(c);
   *pcs = to_nonconst(new Congruence_System(cc));
   return 0;
@@ -1392,7 +1392,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_System_space_dimension(ppl_const_Congruence_System_t cs,
-				      ppl_dimension_type* m) try {
+                                      ppl_dimension_type* m) try {
   *m = to_const(cs)->space_dimension();
   return 0;
 }
@@ -1415,7 +1415,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_System_insert_Congruence(ppl_Congruence_System_t cs,
-					ppl_const_Congruence_t c) try {
+                                        ppl_const_Congruence_t c) try {
   const Congruence& cc = *to_const(c);
   Congruence_System& ccs = *to_nonconst(cs);
   ccs.insert(cc);
@@ -1470,7 +1470,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_System_begin(ppl_const_Congruence_System_t cs,
-			    ppl_Congruence_System_const_iterator_t cit) try {
+                            ppl_Congruence_System_const_iterator_t cit) try {
   const Congruence_System& ccs = *to_const(cs);
   Congruence_System::const_iterator& ccit = *to_nonconst(cit);
   ccit = ccs.begin();
@@ -1480,7 +1480,7 @@ CATCH_ALL
 
 int
 ppl_Congruence_System_end(ppl_const_Congruence_System_t cs,
-			  ppl_Congruence_System_const_iterator_t cit) try {
+                          ppl_Congruence_System_const_iterator_t cit) try {
   const Congruence_System& ccs = *to_const(cs);
   Congruence_System::const_iterator& ccit = *to_nonconst(cit);
   ccit = ccs.end();
@@ -1522,9 +1522,9 @@ CATCH_ALL
 
 int
 ppl_new_Grid_Generator(ppl_Grid_Generator_t* pg,
-		       ppl_const_Linear_Expression_t le,
-		       enum ppl_enum_Grid_Generator_Type t,
-		       ppl_const_Coefficient_t d) try {
+                       ppl_const_Linear_Expression_t le,
+                       enum ppl_enum_Grid_Generator_Type t,
+                       ppl_const_Coefficient_t d) try {
   Grid_Generator* ppg;
   const Linear_Expression& lle = *to_const(le);
   const Coefficient& dd = *to_const(d);
@@ -1540,7 +1540,7 @@ ppl_new_Grid_Generator(ppl_Grid_Generator_t* pg,
     break;
   default:
     throw std::invalid_argument("ppl_new_Grid_Generator(pg, le, t, d): "
-				"t invalid");
+                                "t invalid");
   }
   *pg = to_nonconst(ppg);
   return 0;
@@ -1556,7 +1556,7 @@ CATCH_ALL
 
 int
 ppl_new_Grid_Generator_from_Grid_Generator(ppl_Grid_Generator_t* pg,
-					   ppl_const_Grid_Generator_t g) try {
+                                           ppl_const_Grid_Generator_t g) try {
   const Grid_Generator& gg = *to_const(g);
   *pg = to_nonconst(new Grid_Generator(gg));
   return 0;
@@ -1583,7 +1583,7 @@ CATCH_ALL
 
 int
 ppl_Grid_Generator_space_dimension(ppl_const_Grid_Generator_t g,
-				   ppl_dimension_type* m) try {
+                                   ppl_dimension_type* m) try {
   *m = to_const(g)->space_dimension();
   return 0;
 }
@@ -1605,8 +1605,8 @@ CATCH_ALL
 
 int
 ppl_Grid_Generator_coefficient(ppl_const_Grid_Generator_t g,
-			       ppl_dimension_type var,
-			       ppl_Coefficient_t n) try {
+                               ppl_dimension_type var,
+                               ppl_Coefficient_t n) try {
   const Grid_Generator& gg = *to_const(g);
   Coefficient& nn = *to_nonconst(n);
   nn = gg.coefficient(Variable(var));
@@ -1616,7 +1616,7 @@ CATCH_ALL
 
 int
 ppl_Grid_Generator_divisor(ppl_const_Grid_Generator_t g,
-			   ppl_Coefficient_t n) try {
+                           ppl_Coefficient_t n) try {
   const Grid_Generator& gg = *to_const(g);
   Coefficient& nn = *to_nonconst(n);
   nn = gg.divisor();
@@ -1696,7 +1696,7 @@ CATCH_ALL
 
 int
 ppl_Grid_Generator_System_space_dimension(ppl_const_Grid_Generator_System_t gs,
-					  ppl_dimension_type* m) try {
+                                          ppl_dimension_type* m) try {
   *m = to_const(gs)->space_dimension();
   return 0;
 }
@@ -1835,9 +1835,9 @@ CATCH_ALL
 
 int
 ppl_new_MIP_Problem(ppl_MIP_Problem_t* pmip,
-		    ppl_dimension_type d,
-		    ppl_const_Constraint_System_t cs,
-		    ppl_const_Linear_Expression_t le, int m) try {
+                    ppl_dimension_type d,
+                    ppl_const_Constraint_System_t cs,
+                    ppl_const_Linear_Expression_t le, int m) try {
   const Constraint_System& ccs = *to_const(cs);
   const Linear_Expression& lle = *to_const(le);
   Optimization_Mode mm = (m == PPL_OPTIMIZATION_MODE_MINIMIZATION)
@@ -1849,7 +1849,7 @@ CATCH_ALL
 
 int
 ppl_new_MIP_Problem_from_MIP_Problem(ppl_MIP_Problem_t* pmip,
-				     ppl_const_MIP_Problem_t mip) try {
+                                     ppl_const_MIP_Problem_t mip) try {
   const MIP_Problem& mmip = *to_const(mip);
   *pmip = to_nonconst(new MIP_Problem(mmip));
   return 0;
@@ -1865,7 +1865,7 @@ CATCH_ALL
 
 int
 ppl_assign_MIP_Problem_from_MIP_Problem(ppl_MIP_Problem_t dst,
-					ppl_const_MIP_Problem_t src) try {
+                                        ppl_const_MIP_Problem_t src) try {
   const MIP_Problem& ssrc = *to_const(src);
   MIP_Problem& ddst = *to_nonconst(dst);
   ddst = ssrc;
@@ -1875,7 +1875,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_space_dimension(ppl_const_MIP_Problem_t mip,
-				ppl_dimension_type* m) try {
+                                ppl_dimension_type* m) try {
   *m = to_const(mip)->space_dimension();
   return 0;
 }
@@ -1883,7 +1883,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_number_of_integer_space_dimensions(ppl_const_MIP_Problem_t mip,
-						   ppl_dimension_type* m) try {
+                                                   ppl_dimension_type* m) try {
   const MIP_Problem& mmip = *to_const(mip);
   *m = mmip.integer_space_dimensions().size();
   return 0;
@@ -1892,11 +1892,11 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_integer_space_dimensions(ppl_const_MIP_Problem_t mip,
-					 ppl_dimension_type ds[]) try {
+                                         ppl_dimension_type ds[]) try {
   const Variables_Set& vars = to_const(mip)->integer_space_dimensions();
   ppl_dimension_type* ds_i = ds;
   for (Variables_Set::const_iterator v_iter = vars.begin(),
-	 v_end = vars.end(); v_iter != v_end; ++v_iter, ++ds_i)
+         v_end = vars.end(); v_iter != v_end; ++v_iter, ++ds_i)
     *ds_i = *v_iter;
   return 0;
 }
@@ -1904,7 +1904,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_number_of_constraints(ppl_const_MIP_Problem_t mip,
-				      ppl_dimension_type* m) try {
+                                      ppl_dimension_type* m) try {
   const MIP_Problem& mmip = *to_const(mip);
   *m = static_cast<ppl_dimension_type>(mmip.constraints_end() - mmip.constraints_begin());
   return 0;
@@ -1913,8 +1913,8 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_constraint_at_index(ppl_const_MIP_Problem_t mip,
-				    ppl_dimension_type i,
-				    ppl_const_Constraint_t* pc) try {
+                                    ppl_dimension_type i,
+                                    ppl_const_Constraint_t* pc) try {
 #ifndef NDEBUG
   ppl_dimension_type num_constraints;
   ppl_MIP_Problem_number_of_constraints(mip, &num_constraints);
@@ -1929,7 +1929,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_objective_function(ppl_const_MIP_Problem_t mip,
-				   ppl_const_Linear_Expression_t* ple) try {
+                                   ppl_const_Linear_Expression_t* ple) try {
   const Linear_Expression& le = to_const(mip)->objective_function();
   *ple = to_const(&le);
   return 0;
@@ -1951,7 +1951,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_add_space_dimensions_and_embed(ppl_MIP_Problem_t mip,
-					       ppl_dimension_type d) try {
+                                               ppl_dimension_type d) try {
   MIP_Problem& mmip = *to_nonconst(mip);
   mmip.add_space_dimensions_and_embed(d);
   return 0;
@@ -1960,8 +1960,8 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_add_to_integer_space_dimensions(ppl_MIP_Problem_t mip,
-					        ppl_dimension_type ds[],
-					        size_t n) try {
+                                                ppl_dimension_type ds[],
+                                                size_t n) try {
   MIP_Problem& mmip = *to_nonconst(mip);
   Variables_Set vars;
   for (ppl_dimension_type i = n; i-- > 0; )
@@ -1973,7 +1973,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_add_constraint(ppl_MIP_Problem_t mip,
-			       ppl_const_Constraint_t c) try {
+                               ppl_const_Constraint_t c) try {
   const Constraint& cc = *to_const(c);
   MIP_Problem& mmip = *to_nonconst(mip);
   mmip.add_constraint(cc);
@@ -1983,7 +1983,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_add_constraints(ppl_MIP_Problem_t mip,
-				ppl_const_Constraint_System_t cs) try {
+                                ppl_const_Constraint_System_t cs) try {
   const Constraint_System& ccs = *to_const(cs);
   MIP_Problem& mmip = *to_nonconst(mip);
   mmip.add_constraints(ccs);
@@ -1993,7 +1993,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_set_objective_function(ppl_MIP_Problem_t mip,
-				       ppl_const_Linear_Expression_t le) try {
+                                       ppl_const_Linear_Expression_t le) try {
   const Linear_Expression& lle = *to_const(le);
   MIP_Problem& mmip = *to_nonconst(mip);
   mmip.set_objective_function(lle);
@@ -2025,9 +2025,9 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_evaluate_objective_function(ppl_const_MIP_Problem_t mip,
-					    ppl_const_Generator_t g,
-					    ppl_Coefficient_t num,
-					    ppl_Coefficient_t den) try {
+                                            ppl_const_Generator_t g,
+                                            ppl_Coefficient_t num,
+                                            ppl_Coefficient_t den) try {
   const MIP_Problem& mmip = *to_const(mip);
   const Generator& gg = *to_const(g);
   Coefficient& nnum = *to_nonconst(num);
@@ -2039,7 +2039,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_feasible_point(ppl_const_MIP_Problem_t mip,
-			       ppl_const_Generator_t* pg) try {
+                               ppl_const_Generator_t* pg) try {
   const Generator& g = to_const(mip)->feasible_point();
   *pg = to_const(&g);
   return 0;
@@ -2048,7 +2048,7 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_optimizing_point(ppl_const_MIP_Problem_t mip,
-				 ppl_const_Generator_t* pg) try {
+                                 ppl_const_Generator_t* pg) try {
   const Generator& g = to_const(mip)->optimizing_point();
   *pg = to_const(&g);
   return 0;
@@ -2057,8 +2057,8 @@ CATCH_ALL
 
 int
 ppl_MIP_Problem_optimal_value(ppl_const_MIP_Problem_t mip,
-			      ppl_Coefficient_t num,
-			      ppl_Coefficient_t den) try {
+                              ppl_Coefficient_t num,
+                              ppl_Coefficient_t den) try {
   Coefficient& nnum = *to_nonconst(num);
   Coefficient& dden = *to_nonconst(den);
   to_const(mip)->optimal_value(nnum, dden);
@@ -2117,7 +2117,7 @@ CATCH_ALL
 
 int
 ppl_new_PIP_Problem_from_PIP_Problem(ppl_PIP_Problem_t* dpip,
-				     ppl_const_PIP_Problem_t pip) try {
+                                     ppl_const_PIP_Problem_t pip) try {
   const PIP_Problem& spip = *to_const(pip);
   *dpip = to_nonconst(new PIP_Problem(spip));
   return 0;
@@ -2143,7 +2143,7 @@ CATCH_ALL
 
 int
 ppl_assign_PIP_Problem_from_PIP_Problem(ppl_PIP_Problem_t dst,
-					ppl_const_PIP_Problem_t src) try {
+                                        ppl_const_PIP_Problem_t src) try {
   const PIP_Problem& ssrc = *to_const(src);
   PIP_Problem& ddst = *to_nonconst(dst);
   ddst = ssrc;
@@ -2160,7 +2160,7 @@ CATCH_ALL
 
 int
 ppl_PIP_Problem_space_dimension(ppl_const_PIP_Problem_t pip,
-				ppl_dimension_type* m) try {
+                                ppl_dimension_type* m) try {
   *m = to_const(pip)->space_dimension();
   return 0;
 }
@@ -2181,7 +2181,7 @@ ppl_PIP_Problem_parameter_space_dimensions(ppl_const_PIP_Problem_t pip,
   const Variables_Set& vars = to_const(pip)->parameter_space_dimensions();
   ppl_dimension_type* ds_i = ds;
   for (Variables_Set::const_iterator v_iter = vars.begin(),
-	 v_end = vars.end(); v_iter != v_end; ++v_iter, ++ds_i)
+         v_end = vars.end(); v_iter != v_end; ++v_iter, ++ds_i)
     *ds_i = *v_iter;
   return 0;
 }
@@ -2189,7 +2189,7 @@ CATCH_ALL
 
 int
 ppl_PIP_Problem_number_of_constraints(ppl_const_PIP_Problem_t pip,
-				      ppl_dimension_type* m) try {
+                                      ppl_dimension_type* m) try {
   const PIP_Problem& ppip = *to_const(pip);
   *m = static_cast<ppl_dimension_type>(ppip.constraints_end() - ppip.constraints_begin());
   return 0;
@@ -2198,8 +2198,8 @@ CATCH_ALL
 
 int
 ppl_PIP_Problem_constraint_at_index(ppl_const_PIP_Problem_t pip,
-				    ppl_dimension_type i,
-				    ppl_const_Constraint_t* pc) try {
+                                    ppl_dimension_type i,
+                                    ppl_const_Constraint_t* pc) try {
 #ifndef NDEBUG
   ppl_dimension_type num_constraints;
   ppl_PIP_Problem_number_of_constraints(pip, &num_constraints);
@@ -2219,8 +2219,8 @@ ppl_PIP_Problem_clear(ppl_PIP_Problem_t pip) try {
 CATCH_ALL
 int
 ppl_PIP_Problem_add_space_dimensions_and_embed(ppl_PIP_Problem_t pip,
-					       ppl_dimension_type pip_vars,
-					       ppl_dimension_type pip_params)
+                                               ppl_dimension_type pip_vars,
+                                               ppl_dimension_type pip_params)
   try {
   PIP_Problem& spip = *to_nonconst(pip);
   spip.add_space_dimensions_and_embed(pip_vars,pip_params);
@@ -2229,8 +2229,8 @@ ppl_PIP_Problem_add_space_dimensions_and_embed(ppl_PIP_Problem_t pip,
 CATCH_ALL
 int
 ppl_PIP_Problem_add_to_parameter_space_dimensions(ppl_PIP_Problem_t pip,
-					          ppl_dimension_type ds[],
-					          size_t n) try {
+                                                  ppl_dimension_type ds[],
+                                                  size_t n) try {
   PIP_Problem& ppip = *to_nonconst(pip);
   Variables_Set vars;
   for (ppl_dimension_type i = n; i-- > 0; )
@@ -2241,7 +2241,7 @@ ppl_PIP_Problem_add_to_parameter_space_dimensions(ppl_PIP_Problem_t pip,
 CATCH_ALL
 int
 ppl_PIP_Problem_add_constraint(ppl_PIP_Problem_t pip,
-			       ppl_const_Constraint_t c) try {
+                               ppl_const_Constraint_t c) try {
   const Constraint& cc = *to_const(c);
   PIP_Problem& ppip = *to_nonconst(pip);
   ppip.add_constraint(cc);
@@ -2251,7 +2251,7 @@ CATCH_ALL
 
 int
 ppl_PIP_Problem_add_constraints(ppl_PIP_Problem_t pip,
-				ppl_const_Constraint_System_t cs) try {
+                                ppl_const_Constraint_System_t cs) try {
   const Constraint_System& ccs = *to_const(cs);
   PIP_Problem& ppip = *to_nonconst(pip);
   ppip.add_constraints(ccs);
@@ -2376,7 +2376,7 @@ CATCH_ALL
 
 int
 ppl_PIP_Tree_Node_number_of_artificials(ppl_const_PIP_Tree_Node_t pip_tree,
-					ppl_dimension_type* m) try {
+                                        ppl_dimension_type* m) try {
   const PIP_Tree_Node& node = *to_const(pip_tree);
   *m = node.art_parameter_count();
   return 0;
@@ -2616,13 +2616,13 @@ DEFINE_OUTPUT_FUNCTIONS(Artificial_Parameter)
 
 char*
 ppl_io_wrap_string(const char* src,
-		   unsigned indent_depth,
-		   unsigned preferred_first_line_length,
-		   unsigned preferred_line_length) {
+                   unsigned indent_depth,
+                   unsigned preferred_first_line_length,
+                   unsigned preferred_line_length) {
   using namespace IO_Operators;
   return strdup(wrap_string(src, indent_depth,
-			    preferred_first_line_length,
-			    preferred_line_length).c_str());
+                            preferred_first_line_length,
+                            preferred_line_length).c_str());
 }
 
 int
diff --git a/interfaces/C/ppl_c_implementation_common.defs.hh b/interfaces/C/ppl_c_implementation_common.defs.hh
deleted file mode 100644
index fe5156a..0000000
--- a/interfaces/C/ppl_c_implementation_common.defs.hh
+++ /dev/null
@@ -1,259 +0,0 @@
-/* Implementation of the C interface: declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_c_implementation_common_defs_hh
-#define PPL_ppl_c_implementation_common_defs_hh 1
-
-#define PPL_NO_AUTOMATIC_INITIALIZATION
-#include "ppl.hh"
-#include "ppl_c.h"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace C {
-
-extern "C" typedef void
-(*error_handler_type)(enum ppl_enum_error_code code, const char* description);
-
-extern error_handler_type user_error_handler;
-
-void notify_error(enum ppl_enum_error_code code, const char* description);
-
-Relation_Symbol relation_symbol(enum ppl_enum_Constraint_Type t);
-
-Bounded_Integer_Type_Width
-bounded_integer_type_width(enum ppl_enum_Bounded_Integer_Type_Width w);
-
-Bounded_Integer_Type_Representation
-bounded_integer_type_representation(enum ppl_enum_Bounded_Integer_Type_Representation r);
-
-/*! \brief
-  A class to wrap an array of fixed length into a partial function interface
-  suitable for the map_space_dimension() methods.
-*/
-class Array_Partial_Function_Wrapper {
-public:
-  /*! \brief
-    Construct a partial function wrapping the first \p n positions of
-    \p v.
-  */
-  Array_Partial_Function_Wrapper(dimension_type* v, size_t n);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty codomain (i.e., it is always undefined).
-  */
-  bool has_empty_codomain() const;
-
-  /*! \brief
-    Returns the maximum value that belongs to the codomain
-    of the partial function.
-  */
-  dimension_type max_in_codomain() const;
-
-  /*! \brief
-    Assigns to \p j the value associated to \p i by \p *this, if any.
-
-    Let \f$f\f$ be the function represented by \p *this and \f$k\f$ be
-    the value of \p i.  If \f$f\f$ is defined in \f$k\f$, then
-    \f$f(k)\f$ is assigned to \p j and <CODE>true</CODE> is returned.
-    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
-    returned.
-  */
-  bool maps(dimension_type i, dimension_type& j) const;
-
-private:
-  //! Holds the vector implementing the map.
-  dimension_type* vec;
-
-  //! Holds the size of \p vec.
-  size_t vec_size;
-
-  //! Cache for computing the maximum dimension in the codomain.
-  mutable dimension_type max_in_codomain_;
-
-  //! Cache for computing emptiness:
-  //! -1 if we still don't know, 0 if not empty, 1 if empty.
-  mutable int empty;
-};
-
-class timeout_exception : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-void reset_timeout();
-
-class deterministic_timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-void reset_deterministic_timeout();
-
-} // namespace C
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-
-#define CATCH_STD_EXCEPTION(exception, code) \
-catch (const std::exception& e) {	     \
-  notify_error(code, e.what()); \
-  return code; \
-}
-
-#define CATCH_ALL \
-CATCH_STD_EXCEPTION(bad_alloc, PPL_ERROR_OUT_OF_MEMORY) \
-CATCH_STD_EXCEPTION(invalid_argument, PPL_ERROR_INVALID_ARGUMENT) \
-CATCH_STD_EXCEPTION(domain_error, PPL_ERROR_DOMAIN_ERROR) \
-CATCH_STD_EXCEPTION(length_error, PPL_ERROR_LENGTH_ERROR) \
-CATCH_STD_EXCEPTION(logic_error, PPL_ERROR_LOGIC_ERROR) \
-CATCH_STD_EXCEPTION(overflow_error, PPL_ARITHMETIC_OVERFLOW) \
-CATCH_STD_EXCEPTION(runtime_error, PPL_ERROR_INTERNAL_ERROR) \
-CATCH_STD_EXCEPTION(exception, PPL_ERROR_UNKNOWN_STANDARD_EXCEPTION) \
-catch (timeout_exception&) { \
-  reset_timeout(); \
-  notify_error(PPL_TIMEOUT_EXCEPTION, "PPL timeout expired"); \
-  return PPL_TIMEOUT_EXCEPTION; \
-} \
-catch (deterministic_timeout_exception&) { \
-  reset_deterministic_timeout(); \
-  notify_error(PPL_TIMEOUT_EXCEPTION, "PPL deterministic timeout expired"); \
-  return PPL_TIMEOUT_EXCEPTION; \
-} \
-catch (...) { \
-  notify_error(PPL_ERROR_UNEXPECTED_ERROR, \
-	       "completely unexpected error: a bug in the PPL"); \
-  return PPL_ERROR_UNEXPECTED_ERROR; \
-}
-
-#define DECLARE_CONVERSIONS(Type, CPP_Type)             \
-  inline const CPP_Type*                                \
-  to_const(ppl_const_##Type##_t x) {                    \
-    return reinterpret_cast<const CPP_Type*>(x);        \
-  }                                                     \
-                                                        \
-  inline CPP_Type*                                      \
-  to_nonconst(ppl_##Type##_t x) {                       \
-    return reinterpret_cast<CPP_Type*>(x);              \
-  }                                                     \
-                                                        \
-  inline ppl_const_##Type##_t                           \
-  to_const(const CPP_Type* x) {                         \
-    return reinterpret_cast<ppl_const_##Type##_t>(x);   \
-  }                                                     \
-                                                        \
-  inline ppl_##Type##_t                                 \
-  to_nonconst(CPP_Type* x) {                            \
-    return reinterpret_cast<ppl_##Type##_t>(x);         \
-  }
-
-#define DEFINE_PRINT_FUNCTIONS(Type)                                    \
-  int                                                                   \
-  ppl_io_print_##Type(ppl_const_##Type##_t x) try {                     \
-    using namespace IO_Operators;                                       \
-    stdiobuf sb(stdout);                                                \
-    std::ostream os(&sb);                                               \
-    os << *to_const(x);                                                 \
-    if (!os)                                                            \
-      return PPL_STDIO_ERROR;                                           \
-    return 0;                                                           \
-  }                                                                     \
-  CATCH_ALL                                                             \
-                                                                        \
-  int                                                                   \
-  ppl_io_fprint_##Type(FILE* file, ppl_const_##Type##_t x) try {        \
-    using namespace IO_Operators;                                       \
-    stdiobuf sb(file);                                                  \
-    std::ostream os(&sb);                                               \
-    os << *to_const(x);                                                 \
-    if (!os)                                                            \
-      return PPL_STDIO_ERROR;                                           \
-    return 0;                                                           \
-  }                                                                     \
-  CATCH_ALL                                                             \
-                                                                        \
-  int                                                                   \
-  ppl_io_asprint_##Type(char** strp, ppl_const_##Type##_t x) try {      \
-    using namespace IO_Operators;                                       \
-    std::ostringstream os;                                              \
-    os << *to_const(x);                                                 \
-    if (!os)                                                            \
-      return PPL_STDIO_ERROR;                                           \
-    *strp = strdup(os.str().c_str());                                   \
-    if (*strp == 0)                                                     \
-      return PPL_ERROR_OUT_OF_MEMORY;                                   \
-    return 0;                                                           \
-  }                                                                     \
-  CATCH_ALL
-
-#define DEFINE_ASCII_DUMP_FUNCTIONS(Type)                               \
-  int                                                                   \
-  ppl_##Type##_ascii_dump(ppl_const_##Type##_t x, FILE* file) try {     \
-    stdiobuf sb(file);                                                  \
-    std::ostream os(&sb);                                               \
-    to_const(x)->ascii_dump(os);                                        \
-    if (!os)                                                            \
-      return PPL_STDIO_ERROR;                                           \
-    return 0;                                                           \
-  }                                                                     \
-  CATCH_ALL
-
-#define DEFINE_ASCII_LOAD_FUNCTIONS(Type)                               \
-  int                                                                   \
-  ppl_##Type##_ascii_load(ppl_##Type##_t x, FILE* file) try {           \
-    stdiobuf sb(file);                                                  \
-    std::istream is(&sb);                                               \
-    if (!to_nonconst(x)->ascii_load(is))                                \
-      return PPL_STDIO_ERROR;                                           \
-    return 0;                                                           \
-  }                                                                     \
-  CATCH_ALL
-
-#define DEFINE_ASCII_DUMP_LOAD_FUNCTIONS(Type)  \
-  DEFINE_ASCII_DUMP_FUNCTIONS(Type)             \
-  DEFINE_ASCII_LOAD_FUNCTIONS(Type)
-
-#define DEFINE_OUTPUT_FUNCTIONS(Type)           \
-  DEFINE_PRINT_FUNCTIONS(Type)                  \
-  DEFINE_ASCII_DUMP_LOAD_FUNCTIONS(Type)
-
-#include "ppl_c_implementation_common.inlines.hh"
-
-#endif // !defined(PPL_ppl_c_implementation_common_defs_hh)
diff --git a/interfaces/C/ppl_c_implementation_common.inlines.hh b/interfaces/C/ppl_c_implementation_common.inlines.hh
deleted file mode 100644
index 3e3e8f0..0000000
--- a/interfaces/C/ppl_c_implementation_common.inlines.hh
+++ /dev/null
@@ -1,214 +0,0 @@
-/* Implementation of the C interface: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_c_implementation_common_inlines_hh
-#define PPL_ppl_c_implementation_common_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace C {
-
-// FIXME: this same function is used also in the OCaml interface.
-// It should be placed in some common header file in the interfaces
-// directory.
-//! Reinterpret an mpz_t as mpz_class.
-inline mpz_class&
-reinterpret_mpz_class(mpz_t n) {
-  return reinterpret_cast<mpz_class&>(*n);
-}
-
-DECLARE_CONVERSIONS(Coefficient, Coefficient)
-
-DECLARE_CONVERSIONS(Linear_Expression, Linear_Expression)
-
-DECLARE_CONVERSIONS(Constraint, Constraint)
-
-DECLARE_CONVERSIONS(Constraint_System, Constraint_System)
-
-DECLARE_CONVERSIONS(Constraint_System_const_iterator,
-                    Constraint_System_const_iterator)
-
-DECLARE_CONVERSIONS(Generator, Generator)
-
-DECLARE_CONVERSIONS(Generator_System, Generator_System)
-
-DECLARE_CONVERSIONS(Generator_System_const_iterator,
-                    Generator_System_const_iterator)
-
-DECLARE_CONVERSIONS(Congruence, Congruence)
-
-DECLARE_CONVERSIONS(Congruence_System, Congruence_System)
-
-typedef Congruence_System::const_iterator Congruence_System_const_iterator;
-DECLARE_CONVERSIONS(Congruence_System_const_iterator,
-                    Congruence_System_const_iterator)
-
-DECLARE_CONVERSIONS(Grid_Generator, Grid_Generator)
-
-DECLARE_CONVERSIONS(Grid_Generator_System, Grid_Generator_System)
-
-typedef Grid_Generator_System::const_iterator
-Grid_Generator_System_const_iterator;
-DECLARE_CONVERSIONS(Grid_Generator_System_const_iterator,
-                    Grid_Generator_System_const_iterator)
-
-typedef PIP_Tree_Node::Artificial_Parameter
-Artificial_Parameter;
-DECLARE_CONVERSIONS(Artificial_Parameter, Artificial_Parameter)
-
-typedef PIP_Tree_Node::Artificial_Parameter_Sequence
-Artificial_Parameter_Sequence;
-DECLARE_CONVERSIONS(Artificial_Parameter_Sequence,
-                    Artificial_Parameter_Sequence)
-
-typedef PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
-Artificial_Parameter_Sequence_const_iterator;
-DECLARE_CONVERSIONS(Artificial_Parameter_Sequence_const_iterator,
-                    Artificial_Parameter_Sequence_const_iterator)
-
-DECLARE_CONVERSIONS(MIP_Problem, MIP_Problem)
-
-DECLARE_CONVERSIONS(PIP_Problem, PIP_Problem)
-
-DECLARE_CONVERSIONS(PIP_Tree_Node, PIP_Tree_Node)
-
-DECLARE_CONVERSIONS(PIP_Decision_Node, PIP_Decision_Node)
-
-DECLARE_CONVERSIONS(PIP_Solution_Node, PIP_Solution_Node)
-
-inline Relation_Symbol
-relation_symbol(enum ppl_enum_Constraint_Type t) {
-  switch (t) {
-  case PPL_CONSTRAINT_TYPE_LESS_THAN:
-    return LESS_THAN;
-  case PPL_CONSTRAINT_TYPE_LESS_OR_EQUAL:
-    return LESS_OR_EQUAL;
-  case PPL_CONSTRAINT_TYPE_EQUAL:
-    return EQUAL;
-  case PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL:
-    return GREATER_OR_EQUAL;
-  case PPL_CONSTRAINT_TYPE_GREATER_THAN:
-    return GREATER_THAN;
-  default:
-    return static_cast<Relation_Symbol>(t);
-  }
-}
-
-inline Bounded_Integer_Type_Width
-bounded_integer_type_width(enum ppl_enum_Bounded_Integer_Type_Width w) {
-  switch (w) {
-  case PPL_BITS_8:
-    return BITS_8;
-  case PPL_BITS_16:
-    return BITS_16;
-  case PPL_BITS_32:
-    return BITS_32;
-  case PPL_BITS_64:
-    return BITS_64;
-  case PPL_BITS_128:
-    return BITS_128;
-  default:
-    return static_cast<Bounded_Integer_Type_Width>(w);
-  }
-}
-
-inline Bounded_Integer_Type_Representation
-bounded_integer_type_representation(enum ppl_enum_Bounded_Integer_Type_Representation r) {
-  switch (r) {
-  case PPL_UNSIGNED:
-    return UNSIGNED;
-  case PPL_SIGNED_2_COMPLEMENT:
-    return SIGNED_2_COMPLEMENT;
-  default:
-    return static_cast<Bounded_Integer_Type_Representation>(r);
-  }
-}
-
-inline Bounded_Integer_Type_Overflow
-bounded_integer_type_overflow(enum ppl_enum_Bounded_Integer_Type_Overflow o) {
-  switch (o) {
-  case PPL_OVERFLOW_WRAPS:
-    return OVERFLOW_WRAPS;
-  case PPL_OVERFLOW_UNDEFINED:
-    return OVERFLOW_UNDEFINED;
-  case PPL_OVERFLOW_IMPOSSIBLE:
-    return OVERFLOW_IMPOSSIBLE;
-  default:
-    return static_cast<Bounded_Integer_Type_Overflow>(o);
-  }
-}
-
-inline
-Array_Partial_Function_Wrapper
-::Array_Partial_Function_Wrapper(dimension_type* v, size_t n)
-  : vec(v), vec_size(n), max_in_codomain_(not_a_dimension()), empty(-1) {
-}
-
-inline bool
-Array_Partial_Function_Wrapper::has_empty_codomain() const {
-  if (empty < 0) {
-    empty = 1;
-    for (size_t i = vec_size; i-- > 0; )
-      if (vec[i] != not_a_dimension()) {
-        empty = 0;
-        break;
-      }
-  }
-  return (empty != 0);
-}
-
-inline dimension_type
-Array_Partial_Function_Wrapper::max_in_codomain() const {
-  if (max_in_codomain_ == not_a_dimension()) {
-    for (size_t i = vec_size; i-- > 0; ) {
-      dimension_type vec_i = vec[i];
-      if (vec_i != not_a_dimension()
-          && (max_in_codomain_ == not_a_dimension()
-              || vec_i > max_in_codomain_))
-        max_in_codomain_ = vec_i;
-    }
-  }
-  return max_in_codomain_;
-}
-
-inline bool
-Array_Partial_Function_Wrapper::maps(dimension_type i,
-                                     dimension_type& j) const {
-  if (i >= vec_size)
-    return false;
-  dimension_type vec_i = vec[i];
-  if (vec_i == not_a_dimension())
-    return false;
-  j = vec_i;
-  return true;
-}
-
-} // namespace C
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_ppl_c_implementation_common_inlines_hh)
diff --git a/interfaces/C/ppl_c_implementation_common_defs.hh b/interfaces/C/ppl_c_implementation_common_defs.hh
new file mode 100644
index 0000000..cc4d36e
--- /dev/null
+++ b/interfaces/C/ppl_c_implementation_common_defs.hh
@@ -0,0 +1,259 @@
+/* Implementation of the C interface: declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_c_implementation_common_defs_hh
+#define PPL_ppl_c_implementation_common_defs_hh 1
+
+#define PPL_NO_AUTOMATIC_INITIALIZATION
+#include "ppl.hh"
+#include "ppl_c.h"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace C {
+
+extern "C" typedef void
+(*error_handler_type)(enum ppl_enum_error_code code, const char* description);
+
+extern error_handler_type user_error_handler;
+
+void notify_error(enum ppl_enum_error_code code, const char* description);
+
+Relation_Symbol relation_symbol(enum ppl_enum_Constraint_Type t);
+
+Bounded_Integer_Type_Width
+bounded_integer_type_width(enum ppl_enum_Bounded_Integer_Type_Width w);
+
+Bounded_Integer_Type_Representation
+bounded_integer_type_representation(enum ppl_enum_Bounded_Integer_Type_Representation r);
+
+/*! \brief
+  A class to wrap an array of fixed length into a partial function interface
+  suitable for the map_space_dimension() methods.
+*/
+class Array_Partial_Function_Wrapper {
+public:
+  /*! \brief
+    Construct a partial function wrapping the first \p n positions of
+    \p v.
+  */
+  Array_Partial_Function_Wrapper(dimension_type* v, size_t n);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty codomain (i.e., it is always undefined).
+  */
+  bool has_empty_codomain() const;
+
+  /*! \brief
+    Returns the maximum value that belongs to the codomain
+    of the partial function.
+  */
+  dimension_type max_in_codomain() const;
+
+  /*! \brief
+    Assigns to \p j the value associated to \p i by \p *this, if any.
+
+    Let \f$f\f$ be the function represented by \p *this and \f$k\f$ be
+    the value of \p i.  If \f$f\f$ is defined in \f$k\f$, then
+    \f$f(k)\f$ is assigned to \p j and <CODE>true</CODE> is returned.
+    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
+    returned.
+  */
+  bool maps(dimension_type i, dimension_type& j) const;
+
+private:
+  //! Holds the vector implementing the map.
+  dimension_type* vec;
+
+  //! Holds the size of \p vec.
+  size_t vec_size;
+
+  //! Cache for computing the maximum dimension in the codomain.
+  mutable dimension_type max_in_codomain_;
+
+  //! Cache for computing emptiness:
+  //! -1 if we still don't know, 0 if not empty, 1 if empty.
+  mutable int empty;
+};
+
+class timeout_exception : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+void reset_timeout();
+
+class deterministic_timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+void reset_deterministic_timeout();
+
+} // namespace C
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+
+#define CATCH_STD_EXCEPTION(exception, code) \
+catch (const std::exception& e) {            \
+  notify_error(code, e.what()); \
+  return code; \
+}
+
+#define CATCH_ALL \
+CATCH_STD_EXCEPTION(bad_alloc, PPL_ERROR_OUT_OF_MEMORY) \
+CATCH_STD_EXCEPTION(invalid_argument, PPL_ERROR_INVALID_ARGUMENT) \
+CATCH_STD_EXCEPTION(domain_error, PPL_ERROR_DOMAIN_ERROR) \
+CATCH_STD_EXCEPTION(length_error, PPL_ERROR_LENGTH_ERROR) \
+CATCH_STD_EXCEPTION(logic_error, PPL_ERROR_LOGIC_ERROR) \
+CATCH_STD_EXCEPTION(overflow_error, PPL_ARITHMETIC_OVERFLOW) \
+CATCH_STD_EXCEPTION(runtime_error, PPL_ERROR_INTERNAL_ERROR) \
+CATCH_STD_EXCEPTION(exception, PPL_ERROR_UNKNOWN_STANDARD_EXCEPTION) \
+catch (timeout_exception&) { \
+  reset_timeout(); \
+  notify_error(PPL_TIMEOUT_EXCEPTION, "PPL timeout expired"); \
+  return PPL_TIMEOUT_EXCEPTION; \
+} \
+catch (deterministic_timeout_exception&) { \
+  reset_deterministic_timeout(); \
+  notify_error(PPL_TIMEOUT_EXCEPTION, "PPL deterministic timeout expired"); \
+  return PPL_TIMEOUT_EXCEPTION; \
+} \
+catch (...) { \
+  notify_error(PPL_ERROR_UNEXPECTED_ERROR, \
+               "completely unexpected error: a bug in the PPL"); \
+  return PPL_ERROR_UNEXPECTED_ERROR; \
+}
+
+#define DECLARE_CONVERSIONS(Type, CPP_Type)             \
+  inline const CPP_Type*                                \
+  to_const(ppl_const_##Type##_t x) {                    \
+    return reinterpret_cast<const CPP_Type*>(x);        \
+  }                                                     \
+                                                        \
+  inline CPP_Type*                                      \
+  to_nonconst(ppl_##Type##_t x) {                       \
+    return reinterpret_cast<CPP_Type*>(x);              \
+  }                                                     \
+                                                        \
+  inline ppl_const_##Type##_t                           \
+  to_const(const CPP_Type* x) {                         \
+    return reinterpret_cast<ppl_const_##Type##_t>(x);   \
+  }                                                     \
+                                                        \
+  inline ppl_##Type##_t                                 \
+  to_nonconst(CPP_Type* x) {                            \
+    return reinterpret_cast<ppl_##Type##_t>(x);         \
+  }
+
+#define DEFINE_PRINT_FUNCTIONS(Type)                                    \
+  int                                                                   \
+  ppl_io_print_##Type(ppl_const_##Type##_t x) try {                     \
+    using namespace IO_Operators;                                       \
+    stdiobuf sb(stdout);                                                \
+    std::ostream os(&sb);                                               \
+    os << *to_const(x);                                                 \
+    if (!os)                                                            \
+      return PPL_STDIO_ERROR;                                           \
+    return 0;                                                           \
+  }                                                                     \
+  CATCH_ALL                                                             \
+                                                                        \
+  int                                                                   \
+  ppl_io_fprint_##Type(FILE* file, ppl_const_##Type##_t x) try {        \
+    using namespace IO_Operators;                                       \
+    stdiobuf sb(file);                                                  \
+    std::ostream os(&sb);                                               \
+    os << *to_const(x);                                                 \
+    if (!os)                                                            \
+      return PPL_STDIO_ERROR;                                           \
+    return 0;                                                           \
+  }                                                                     \
+  CATCH_ALL                                                             \
+                                                                        \
+  int                                                                   \
+  ppl_io_asprint_##Type(char** strp, ppl_const_##Type##_t x) try {      \
+    using namespace IO_Operators;                                       \
+    std::ostringstream os;                                              \
+    os << *to_const(x);                                                 \
+    if (!os)                                                            \
+      return PPL_STDIO_ERROR;                                           \
+    *strp = strdup(os.str().c_str());                                   \
+    if (*strp == 0)                                                     \
+      return PPL_ERROR_OUT_OF_MEMORY;                                   \
+    return 0;                                                           \
+  }                                                                     \
+  CATCH_ALL
+
+#define DEFINE_ASCII_DUMP_FUNCTIONS(Type)                               \
+  int                                                                   \
+  ppl_##Type##_ascii_dump(ppl_const_##Type##_t x, FILE* file) try {     \
+    stdiobuf sb(file);                                                  \
+    std::ostream os(&sb);                                               \
+    to_const(x)->ascii_dump(os);                                        \
+    if (!os)                                                            \
+      return PPL_STDIO_ERROR;                                           \
+    return 0;                                                           \
+  }                                                                     \
+  CATCH_ALL
+
+#define DEFINE_ASCII_LOAD_FUNCTIONS(Type)                               \
+  int                                                                   \
+  ppl_##Type##_ascii_load(ppl_##Type##_t x, FILE* file) try {           \
+    stdiobuf sb(file);                                                  \
+    std::istream is(&sb);                                               \
+    if (!to_nonconst(x)->ascii_load(is))                                \
+      return PPL_STDIO_ERROR;                                           \
+    return 0;                                                           \
+  }                                                                     \
+  CATCH_ALL
+
+#define DEFINE_ASCII_DUMP_LOAD_FUNCTIONS(Type)  \
+  DEFINE_ASCII_DUMP_FUNCTIONS(Type)             \
+  DEFINE_ASCII_LOAD_FUNCTIONS(Type)
+
+#define DEFINE_OUTPUT_FUNCTIONS(Type)           \
+  DEFINE_PRINT_FUNCTIONS(Type)                  \
+  DEFINE_ASCII_DUMP_LOAD_FUNCTIONS(Type)
+
+#include "ppl_c_implementation_common_inlines.hh"
+
+#endif // !defined(PPL_ppl_c_implementation_common_defs_hh)
diff --git a/interfaces/C/ppl_c_implementation_common_inlines.hh b/interfaces/C/ppl_c_implementation_common_inlines.hh
new file mode 100644
index 0000000..35af8d3
--- /dev/null
+++ b/interfaces/C/ppl_c_implementation_common_inlines.hh
@@ -0,0 +1,214 @@
+/* Implementation of the C interface: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_c_implementation_common_inlines_hh
+#define PPL_ppl_c_implementation_common_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace C {
+
+// FIXME: this same function is used also in the OCaml interface.
+// It should be placed in some common header file in the interfaces
+// directory.
+//! Reinterpret an mpz_t as mpz_class.
+inline mpz_class&
+reinterpret_mpz_class(mpz_t n) {
+  return reinterpret_cast<mpz_class&>(*n);
+}
+
+DECLARE_CONVERSIONS(Coefficient, Coefficient)
+
+DECLARE_CONVERSIONS(Linear_Expression, Linear_Expression)
+
+DECLARE_CONVERSIONS(Constraint, Constraint)
+
+DECLARE_CONVERSIONS(Constraint_System, Constraint_System)
+
+DECLARE_CONVERSIONS(Constraint_System_const_iterator,
+                    Constraint_System_const_iterator)
+
+DECLARE_CONVERSIONS(Generator, Generator)
+
+DECLARE_CONVERSIONS(Generator_System, Generator_System)
+
+DECLARE_CONVERSIONS(Generator_System_const_iterator,
+                    Generator_System_const_iterator)
+
+DECLARE_CONVERSIONS(Congruence, Congruence)
+
+DECLARE_CONVERSIONS(Congruence_System, Congruence_System)
+
+typedef Congruence_System::const_iterator Congruence_System_const_iterator;
+DECLARE_CONVERSIONS(Congruence_System_const_iterator,
+                    Congruence_System_const_iterator)
+
+DECLARE_CONVERSIONS(Grid_Generator, Grid_Generator)
+
+DECLARE_CONVERSIONS(Grid_Generator_System, Grid_Generator_System)
+
+typedef Grid_Generator_System::const_iterator
+Grid_Generator_System_const_iterator;
+DECLARE_CONVERSIONS(Grid_Generator_System_const_iterator,
+                    Grid_Generator_System_const_iterator)
+
+typedef PIP_Tree_Node::Artificial_Parameter
+Artificial_Parameter;
+DECLARE_CONVERSIONS(Artificial_Parameter, Artificial_Parameter)
+
+typedef PIP_Tree_Node::Artificial_Parameter_Sequence
+Artificial_Parameter_Sequence;
+DECLARE_CONVERSIONS(Artificial_Parameter_Sequence,
+                    Artificial_Parameter_Sequence)
+
+typedef PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
+Artificial_Parameter_Sequence_const_iterator;
+DECLARE_CONVERSIONS(Artificial_Parameter_Sequence_const_iterator,
+                    Artificial_Parameter_Sequence_const_iterator)
+
+DECLARE_CONVERSIONS(MIP_Problem, MIP_Problem)
+
+DECLARE_CONVERSIONS(PIP_Problem, PIP_Problem)
+
+DECLARE_CONVERSIONS(PIP_Tree_Node, PIP_Tree_Node)
+
+DECLARE_CONVERSIONS(PIP_Decision_Node, PIP_Decision_Node)
+
+DECLARE_CONVERSIONS(PIP_Solution_Node, PIP_Solution_Node)
+
+inline Relation_Symbol
+relation_symbol(enum ppl_enum_Constraint_Type t) {
+  switch (t) {
+  case PPL_CONSTRAINT_TYPE_LESS_THAN:
+    return LESS_THAN;
+  case PPL_CONSTRAINT_TYPE_LESS_OR_EQUAL:
+    return LESS_OR_EQUAL;
+  case PPL_CONSTRAINT_TYPE_EQUAL:
+    return EQUAL;
+  case PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL:
+    return GREATER_OR_EQUAL;
+  case PPL_CONSTRAINT_TYPE_GREATER_THAN:
+    return GREATER_THAN;
+  default:
+    return static_cast<Relation_Symbol>(t);
+  }
+}
+
+inline Bounded_Integer_Type_Width
+bounded_integer_type_width(enum ppl_enum_Bounded_Integer_Type_Width w) {
+  switch (w) {
+  case PPL_BITS_8:
+    return BITS_8;
+  case PPL_BITS_16:
+    return BITS_16;
+  case PPL_BITS_32:
+    return BITS_32;
+  case PPL_BITS_64:
+    return BITS_64;
+  case PPL_BITS_128:
+    return BITS_128;
+  default:
+    return static_cast<Bounded_Integer_Type_Width>(w);
+  }
+}
+
+inline Bounded_Integer_Type_Representation
+bounded_integer_type_representation(enum ppl_enum_Bounded_Integer_Type_Representation r) {
+  switch (r) {
+  case PPL_UNSIGNED:
+    return UNSIGNED;
+  case PPL_SIGNED_2_COMPLEMENT:
+    return SIGNED_2_COMPLEMENT;
+  default:
+    return static_cast<Bounded_Integer_Type_Representation>(r);
+  }
+}
+
+inline Bounded_Integer_Type_Overflow
+bounded_integer_type_overflow(enum ppl_enum_Bounded_Integer_Type_Overflow o) {
+  switch (o) {
+  case PPL_OVERFLOW_WRAPS:
+    return OVERFLOW_WRAPS;
+  case PPL_OVERFLOW_UNDEFINED:
+    return OVERFLOW_UNDEFINED;
+  case PPL_OVERFLOW_IMPOSSIBLE:
+    return OVERFLOW_IMPOSSIBLE;
+  default:
+    return static_cast<Bounded_Integer_Type_Overflow>(o);
+  }
+}
+
+inline
+Array_Partial_Function_Wrapper
+::Array_Partial_Function_Wrapper(dimension_type* v, size_t n)
+  : vec(v), vec_size(n), max_in_codomain_(not_a_dimension()), empty(-1) {
+}
+
+inline bool
+Array_Partial_Function_Wrapper::has_empty_codomain() const {
+  if (empty < 0) {
+    empty = 1;
+    for (size_t i = vec_size; i-- > 0; )
+      if (vec[i] != not_a_dimension()) {
+        empty = 0;
+        break;
+      }
+  }
+  return (empty != 0);
+}
+
+inline dimension_type
+Array_Partial_Function_Wrapper::max_in_codomain() const {
+  if (max_in_codomain_ == not_a_dimension()) {
+    for (size_t i = vec_size; i-- > 0; ) {
+      dimension_type vec_i = vec[i];
+      if (vec_i != not_a_dimension()
+          && (max_in_codomain_ == not_a_dimension()
+              || vec_i > max_in_codomain_))
+        max_in_codomain_ = vec_i;
+    }
+  }
+  return max_in_codomain_;
+}
+
+inline bool
+Array_Partial_Function_Wrapper::maps(dimension_type i,
+                                     dimension_type& j) const {
+  if (i >= vec_size)
+    return false;
+  dimension_type vec_i = vec[i];
+  if (vec_i == not_a_dimension())
+    return false;
+  j = vec_i;
+  return true;
+}
+
+} // namespace C
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_ppl_c_implementation_common_inlines_hh)
diff --git a/interfaces/C/ppl_c_version.h.in b/interfaces/C/ppl_c_version.h.in
index c53254f..f3db745 100644
--- a/interfaces/C/ppl_c_version.h.in
+++ b/interfaces/C/ppl_c_version.h.in
@@ -1,6 +1,6 @@
 /* Header file providing version information for the C interface.  -*- C -*-
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/C/ppl_interface_generator_c_cc_code.m4 b/interfaces/C/ppl_interface_generator_c_cc_code.m4
index 829482a..f337995 100644
--- a/interfaces/C/ppl_interface_generator_c_cc_code.m4
+++ b/interfaces/C/ppl_interface_generator_c_cc_code.m4
@@ -6,7 +6,7 @@ files ppl_c_DOMAIN.cc for each interface domain DOMAIN
 in ppl_interface instantiations.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -41,7 +41,7 @@ ppl_new_ at TOPOLOGY@@CLASS at _from_space_dimension
 (ppl_ at CLASS@_t* pph,
  ppl_dimension_type d,
  int empty) try {
-  Degenerate_Element e = (empty != 0) ? EMPTY : UNIVERSE;
+  const Degenerate_Element e = (empty != 0) ? EMPTY : UNIVERSE;
   *pph = to_nonconst(new @TOPOLOGY@@CPP_CLASS@(d, e));
   return 0;
 }
@@ -227,7 +227,7 @@ ppl_ at CLASS@_ at MAXMIN@
   Coefficient& ssup_n = *to_nonconst(sup_n);
   Coefficient& ssup_d = *to_nonconst(sup_d);
   bool optimum;
-  bool ok = pph. at MAXMIN@(lle, ssup_n, ssup_d, optimum);
+  const bool ok = pph. at MAXMIN@(lle, ssup_n, ssup_d, optimum);
   if (ok)
     *poptimum = optimum ? 1 : 0;
   return ok ? 1 : 0;
@@ -251,7 +251,7 @@ ppl_ at CLASS@_ at MAXMIN@_with_point
   Coefficient& ssup_d = *to_nonconst(sup_d);
   Generator& ppoint = *to_nonconst(point);
   bool optimum;
-  bool ok = pph. at MAXMIN@(lle, ssup_n, ssup_d, optimum, ppoint);
+  const bool ok = pph. at MAXMIN@(lle, ssup_n, ssup_d, optimum, ppoint);
   if (ok)
     *poptimum = optimum ? 1 : 0;
   return ok ? 1 : 0;
@@ -272,7 +272,7 @@ ppl_ at CLASS@_has_ at UPPERLOWER@_bound
   Coefficient& eext_n = *to_nonconst(ext_n);
   Coefficient& eext_d = *to_nonconst(ext_d);
   bool closed;
-  bool bounded
+  const bool bounded
     = pps.has_ at UPPERLOWER@_bound(Variable(var), eext_n, eext_d, closed);
   if (bounded)
     *pclosed = closed ? 1 : 0;
@@ -386,7 +386,7 @@ ppl_ at CLASS@_constrains
 (ppl_ at CLASS@_t ph,
  ppl_dimension_type var
 ) try {
-  @CPP_CLASS@& pph = *to_nonconst(ph);
+  const @CPP_CLASS@& pph = *to_const(ph);
   return pph.constrains(Variable(var)) ? 1 : 0;
 }
 CATCH_ALL
@@ -845,7 +845,7 @@ ppl_ at CLASS@_map_space_dimensions
  ppl_dimension_type maps[],
  size_t n) try {
   @CPP_CLASS@& pph = *to_nonconst(ph);
-  Array_Partial_Function_Wrapper function(maps, n);
+  const Array_Partial_Function_Wrapper function(maps, n);
   pph.map_space_dimensions(function);
   return 0;
 }
@@ -1288,7 +1288,7 @@ ppl_one_affine_ranking_function_ at TERMINATION_ID@_ at TOPOLOGY@@CLASS@
   const @TOPOLOGY@@CPP_CLASS@& ppset
     = *static_cast<const @TOPOLOGY@@CPP_CLASS@*>(to_const(pset));
   Generator& ppoint = *to_nonconst(point);
-  bool ok = one_affine_ranking_function_ at TERMINATION_ID@(ppset, ppoint);
+  const bool ok = one_affine_ranking_function_ at TERMINATION_ID@(ppset, ppoint);
   return ok ? 1 : 0;
 }
 CATCH_ALL
@@ -1306,9 +1306,9 @@ ppl_one_affine_ranking_function_ at TERMINATION_ID@_ at TOPOLOGY@@CLASS at _2
   const @TOPOLOGY@@CPP_CLASS@& ppset_after
     = *static_cast<const @TOPOLOGY@@CPP_CLASS@*>(to_const(pset_after));
   Generator& ppoint = *to_nonconst(point);
-  bool ok = one_affine_ranking_function_ at TERMINATION_ID@_2(ppset_before,
-                                                           ppset_after,
-                                                           ppoint);
+  const bool ok = one_affine_ranking_function_ at TERMINATION_ID@_2(ppset_before,
+                                                                 ppset_after,
+                                                                 ppoint);
   return ok ? 1 : 0;
 }
 CATCH_ALL
@@ -1402,8 +1402,8 @@ ppl_ at CLASS@_wrap_assign
   Variables_Set vars;
   for (ppl_dimension_type i = n; i-- > 0; )
     vars.insert(ds[i]);
-  const Constraint_System* ccs = to_const(*pcs);
-  bool b = (wrap_individually != 0);
+  const Constraint_System* const ccs = to_const(*pcs);
+  const bool b = (wrap_individually != 0);
   pph.wrap_assign(vars,
                   bounded_integer_type_width(w),
                   bounded_integer_type_representation(r),
diff --git a/interfaces/C/ppl_interface_generator_c_cc_files.m4 b/interfaces/C/ppl_interface_generator_c_cc_files.m4
index c4344e9..7e5e135 100644
--- a/interfaces/C/ppl_interface_generator_c_cc_files.m4
+++ b/interfaces/C/ppl_interface_generator_c_cc_files.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_c_cc
 dnl using the code in ppl_interface_generator_c_cc_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -46,7 +46,7 @@ ___BEGIN_OF_FILE___ ppl_c_`'m4_current_interface`'.cc << ___END_OF_FILE___
 m4_include(`ppl_interface_generator_copyright')`'dnl
 */
 
-`#'include "ppl_c_implementation_common.defs.hh"
+`#'include "ppl_c_implementation_common_defs.hh"
 `#'include "interfaced_boxes.hh"
 `#'include "ppl_c_implementation_domains.hh"
 
diff --git a/interfaces/C/ppl_interface_generator_c_h.m4 b/interfaces/C/ppl_interface_generator_c_h.m4
index d011835..98d61c8 100644
--- a/interfaces/C/ppl_interface_generator_c_h.m4
+++ b/interfaces/C/ppl_interface_generator_c_h.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_c_domains.h
 dnl using the code in ppl_interface_generator_c_h_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/C/ppl_interface_generator_c_h_code.m4 b/interfaces/C/ppl_interface_generator_c_h_code.m4
index b2c6ebb..b95b6ce 100644
--- a/interfaces/C/ppl_interface_generator_c_h_code.m4
+++ b/interfaces/C/ppl_interface_generator_c_h_code.m4
@@ -5,7 +5,7 @@ This m4 file contains the program header code for generating the
 files ppl_c_domains.h.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/C/ppl_interface_generator_c_hh_files.m4 b/interfaces/C/ppl_interface_generator_c_hh_files.m4
index df69534..36b95bd 100644
--- a/interfaces/C/ppl_interface_generator_c_hh_files.m4
+++ b/interfaces/C/ppl_interface_generator_c_hh_files.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_c_h
 dnl using the code in ppl_interface_generator_c_h_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/C/ppl_interface_generator_c_procedure_generators.m4 b/interfaces/C/ppl_interface_generator_c_procedure_generators.m4
index 1e8931a..7b021ad 100644
--- a/interfaces/C/ppl_interface_generator_c_procedure_generators.m4
+++ b/interfaces/C/ppl_interface_generator_c_procedure_generators.m4
@@ -5,7 +5,7 @@ dnl for the C interface; this includes:
 dnl - the list in the imported file and any C specific procedures.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/C/tests/Makefile.am b/interfaces/C/tests/Makefile.am
index 2e6b1dd..9933502 100644
--- a/interfaces/C/tests/Makefile.am
+++ b/interfaces/C/tests/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/C/tests/Makefile.in b/interfaces/C/tests/Makefile.in
index c285085..7aeefd5 100644
--- a/interfaces/C/tests/Makefile.in
+++ b/interfaces/C/tests/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -63,7 +79,8 @@ XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1) $(am__EXEEXT_2)
 subdir = interfaces/C/tests
 DIST_COMMON = $(noinst_HEADERS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -99,10 +116,8 @@ CONFIG_CLEAN_VPATH_FILES =
 ARFLAGS = cru
 AM_V_AR = $(am__v_AR_ at AM_V@)
 am__v_AR_ = $(am__v_AR_ at AM_DEFAULT_V@)
-am__v_AR_0 = @echo "  AR    " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_AR_0 = @echo "  AR      " $@;
+am__v_AR_1 = 
 libppl_c_tests_a_AR = $(AR) $(ARFLAGS)
 libppl_c_tests_a_LIBADD =
 am_libppl_c_tests_a_OBJECTS = libppl_c_tests_a-ppl_c_test.$(OBJEXT)
@@ -119,6 +134,7 @@ formatted_output_DEPENDENCIES = libppl_c_tests.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_pip_test_OBJECTS = pip_test.$(OBJEXT)
 pip_test_OBJECTS = $(am_pip_test_OBJECTS)
 pip_test_LDADD = $(LDADD)
@@ -134,6 +150,18 @@ weightwatch1_OBJECTS = $(am_weightwatch1_OBJECTS)
 weightwatch1_LDADD = $(LDADD)
 weightwatch1_DEPENDENCIES = libppl_c_tests.a \
 	$(top_builddir)/interfaces/C/libppl_c.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -146,14 +174,16 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
 	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
 LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
@@ -162,17 +192,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(libppl_c_tests_a_SOURCES) \
 	$(nodist_EXTRA_libppl_c_tests_a_SOURCES) \
 	$(formatted_output_SOURCES) \
@@ -183,11 +212,18 @@ SOURCES = $(libppl_c_tests_a_SOURCES) \
 DIST_SOURCES = $(libppl_c_tests_a_SOURCES) $(formatted_output_SOURCES) \
 	$(pip_test_SOURCES) $(watchdog1_SOURCES) \
 	$(weightwatch1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 HEADERS = $(noinst_HEADERS)
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -665,6 +701,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -678,7 +728,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -902,7 +952,7 @@ uninstall-am:
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
 	clean-checkLIBRARIES clean-checkPROGRAMS clean-generic \
-	clean-libtool ctags distclean distclean-compile \
+	clean-libtool cscopelist ctags distclean distclean-compile \
 	distclean-generic distclean-libtool distclean-tags distdir dvi \
 	dvi-am html html-am info info-am install install-am \
 	install-data install-data-am install-dvi install-dvi-am \
diff --git a/interfaces/C/tests/formatted_output.c b/interfaces/C/tests/formatted_output.c
index 5e3884b..34ee030 100644
--- a/interfaces/C/tests/formatted_output.c
+++ b/interfaces/C/tests/formatted_output.c
@@ -1,6 +1,6 @@
 /* Test the use of C++ output facilities from C code.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/C/tests/pip_test.c b/interfaces/C/tests/pip_test.c
index f5c0537..6d72200 100644
--- a/interfaces/C/tests/pip_test.c
+++ b/interfaces/C/tests/pip_test.c
@@ -1,6 +1,6 @@
 /* Test the use of the PPL PIP solver from C code.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -48,7 +48,7 @@ fatal(const char* format, ...) {
 
 static void
 error_handler(enum ppl_enum_error_code code,
-	      const char* description) {
+              const char* description) {
   fatal("PPL error code %d: %s", code, description);
 }
 
diff --git a/interfaces/C/tests/ppl_c_test.cc b/interfaces/C/tests/ppl_c_test.cc
index 06e9cd3..759208d 100644
--- a/interfaces/C/tests/ppl_c_test.cc
+++ b/interfaces/C/tests/ppl_c_test.cc
@@ -1,7 +1,7 @@
 /* Implementation of utility functions used in test programs
    of the C interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/C/tests/ppl_c_test.h b/interfaces/C/tests/ppl_c_test.h
index 8d296df..b6bd8af 100644
--- a/interfaces/C/tests/ppl_c_test.h
+++ b/interfaces/C/tests/ppl_c_test.h
@@ -1,6 +1,6 @@
 /* Header file for C test programs.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/C/tests/print_to_buffer.c b/interfaces/C/tests/print_to_buffer.c
index 569d270..88dde25 100644
--- a/interfaces/C/tests/print_to_buffer.c
+++ b/interfaces/C/tests/print_to_buffer.c
@@ -1,6 +1,6 @@
 /* Definitions of print_ppl_*_to_buffer() functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -28,19 +28,19 @@ site: http://bugseng.com/products/ppl/ . */
 
 #define DEFINE_PRINT_TO_BUFFER(Type)                                    \
 char*                                                                   \
- print_ppl_##Type##_to_buffer(ppl_const_##Type##_t p,			\
-			      unsigned indent_depth,			\
-			      unsigned preferred_first_line_length,	\
-			      unsigned preferred_line_length) {		\
-  char *buf, *ret;							\
-  int r = ppl_io_asprint_##Type(&buf, p);				\
-  if (r != 0)								\
-    return 0;								\
-  ret = ppl_io_wrap_string(buf, indent_depth,				\
-			   preferred_first_line_length,			\
-			   preferred_line_length);			\
-  free(buf);								\
-  return ret;								\
+ print_ppl_##Type##_to_buffer(ppl_const_##Type##_t p,                   \
+                              unsigned indent_depth,                    \
+                              unsigned preferred_first_line_length,     \
+                              unsigned preferred_line_length) {         \
+  char *buf, *ret;                                                      \
+  int r = ppl_io_asprint_##Type(&buf, p);                               \
+  if (r != 0)                                                           \
+    return 0;                                                           \
+  ret = ppl_io_wrap_string(buf, indent_depth,                           \
+                           preferred_first_line_length,                 \
+                           preferred_line_length);                      \
+  free(buf);                                                            \
+  return ret;                                                           \
 }
 
 DEFINE_PRINT_TO_BUFFER(Coefficient)
diff --git a/interfaces/C/tests/print_to_buffer.h b/interfaces/C/tests/print_to_buffer.h
index ed6756c..15512ad 100644
--- a/interfaces/C/tests/print_to_buffer.h
+++ b/interfaces/C/tests/print_to_buffer.h
@@ -1,6 +1,6 @@
 /* Declarations of print_ppl_*_to_buffer() functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -34,12 +34,12 @@ site: http://bugseng.com/products/ppl/ . */
   `preferred_first_line_length' and `preferred_line_length',
   respectively.
 */
-#define DECLARE_PRINT_TO_BUFFER(Type)					\
+#define DECLARE_PRINT_TO_BUFFER(Type)                                   \
 char*                                                                   \
-print_ppl_##Type##_to_buffer(ppl_const_##Type##_t p,			\
-			     unsigned indent_depth,			\
-			     unsigned preferred_first_line_length,	\
-			     unsigned preferred_line_length);
+print_ppl_##Type##_to_buffer(ppl_const_##Type##_t p,                    \
+                             unsigned indent_depth,                     \
+                             unsigned preferred_first_line_length,      \
+                             unsigned preferred_line_length);
 
 #ifdef __cplusplus
 extern "C" {
diff --git a/interfaces/C/tests/watchdog1.c b/interfaces/C/tests/watchdog1.c
index ee06a05..fd429e8 100644
--- a/interfaces/C/tests/watchdog1.c
+++ b/interfaces/C/tests/watchdog1.c
@@ -1,6 +1,6 @@
 /* Test the timeout facility of the PPL C interface library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -47,7 +47,7 @@ fatal(const char* format, ...) {
 
 static void
 error_handler(enum ppl_enum_error_code code,
-	      const char* description) {
+              const char* description) {
   if (check_noisy() || check_very_noisy())
     fprintf(stderr, "PPL error code %d: %s\n", code, description);
 #if !PPL_WATCHDOG_OBJECTS_ARE_SUPPORTED
diff --git a/interfaces/C/tests/weightwatch1.c b/interfaces/C/tests/weightwatch1.c
index 2378e38..92cfa69 100644
--- a/interfaces/C/tests/weightwatch1.c
+++ b/interfaces/C/tests/weightwatch1.c
@@ -1,6 +1,6 @@
 /* Test the deterministic timeout facility of the PPL C interface library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -47,7 +47,7 @@ fatal(const char* format, ...) {
 
 static void
 error_handler(enum ppl_enum_error_code code,
-	      const char* description) {
+              const char* description) {
   if (check_noisy() || check_very_noisy())
     fprintf(stderr, "PPL error code %d: %s\n", code, description);
 }
diff --git a/interfaces/Java/Makefile.am b/interfaces/Java/Makefile.am
index 15d64ae..204bafe 100644
--- a/interfaces/Java/Makefile.am
+++ b/interfaces/Java/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Java/Makefile.in b/interfaces/Java/Makefile.in
index e734665..510f5fb 100644
--- a/interfaces/Java/Makefile.in
+++ b/interfaces/Java/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -58,7 +74,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Java
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -91,12 +108,18 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -106,6 +129,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -417,8 +445,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-jarDATA: $(jar_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(jardir)" || $(MKDIR_P) "$(DESTDIR)$(jardir)"
 	@list='$(jar_DATA)'; test -n "$(jardir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(jardir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(jardir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -435,12 +466,12 @@ uninstall-jarDATA:
 	dir='$(DESTDIR)$(jardir)'; $(am__uninstall_files_from_dir)
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -450,7 +481,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -464,37 +499,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -503,6 +507,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -566,6 +574,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -601,13 +623,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -732,22 +751,24 @@ ps-am:
 
 uninstall-am: uninstall-jarDATA
 
-.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) ctags-recursive \
-	install-am install-strip tags-recursive
+.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) \
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-generic clean-libtool \
-	ctags ctags-recursive distclean distclean-generic \
-	distclean-libtool distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-jarDATA install-man install-pdf \
-	install-pdf-am install-ps install-ps-am install-strip \
-	installcheck installcheck-am installdirs installdirs-am \
-	maintainer-clean maintainer-clean-generic mostlyclean \
-	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
-	tags tags-recursive uninstall uninstall-am uninstall-jarDATA
+	cscopelist cscopelist-recursive ctags ctags-recursive \
+	distclean distclean-generic distclean-libtool distclean-tags \
+	distdir dvi dvi-am html html-am info info-am install \
+	install-am install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-jarDATA \
+	install-man install-pdf install-pdf-am install-ps \
+	install-ps-am install-strip installcheck installcheck-am \
+	installdirs installdirs-am maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-generic \
+	mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \
+	uninstall uninstall-am uninstall-jarDATA
 
 
 ppl_java.jar: parma_polyhedra_library/java_classes.stamp
diff --git a/interfaces/Java/README.java b/interfaces/Java/README.java
index abe3fb1..48a6ee5 100644
--- a/interfaces/Java/README.java
+++ b/interfaces/Java/README.java
@@ -1,5 +1,5 @@
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is free software; as a special exception the author gives
 # unlimited permission to copy and/or distribute it, with or without
diff --git a/interfaces/Java/jni/Makefile.am b/interfaces/Java/jni/Makefile.am
index cc20998..33a9d0e 100644
--- a/interfaces/Java/jni/Makefile.am
+++ b/interfaces/Java/jni/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -93,8 +93,8 @@ endif !HOST_OS_MINGW
 endif !HOST_OS_DARWIN
 
 libppl_java_la_SOURCES = \
-ppl_java_common.defs.hh \
-ppl_java_common.inlines.hh \
+ppl_java_common_defs.hh \
+ppl_java_common_inlines.hh \
 ppl_java_common.cc \
 ppl_java_globals.cc
 
diff --git a/interfaces/Java/jni/Makefile.in b/interfaces/Java/jni/Makefile.in
index 86858ce..f8fc8c8 100644
--- a/interfaces/Java/jni/Makefile.in
+++ b/interfaces/Java/jni/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -58,7 +74,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Java/jni
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -125,10 +142,23 @@ libppl_java_la_OBJECTS = $(am_libppl_java_la_OBJECTS)
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_java_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \
 	$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \
 	$(AM_CXXFLAGS) $(CXXFLAGS) $(libppl_java_la_LDFLAGS) \
 	$(LDFLAGS) -o $@
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -141,17 +171,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -160,20 +189,24 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_java_la_SOURCES) \
 	$(nodist_EXTRA_libppl_java_la_SOURCES)
 DIST_SOURCES = $(libppl_java_la_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
@@ -418,8 +451,8 @@ AM_LIBTOOLFLAGS = --tag=disable-static
 @HOST_OS_DARWIN_TRUE at -shrext .jnilib
 
 libppl_java_la_SOURCES = \
-ppl_java_common.defs.hh \
-ppl_java_common.inlines.hh \
+ppl_java_common_defs.hh \
+ppl_java_common_inlines.hh \
 ppl_java_common.cc \
 ppl_java_globals.cc
 
@@ -549,7 +582,6 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkglibdir)" || $(MKDIR_P) "$(DESTDIR)$(pkglibdir)"
 	@list='$(pkglib_LTLIBRARIES)'; test -n "$(pkglibdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -557,6 +589,8 @@ install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkglibdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkglibdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pkglibdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(pkglibdir)"; \
 	}
@@ -572,12 +606,14 @@ uninstall-pkglibLTLIBRARIES:
 
 clean-pkglibLTLIBRARIES:
 	-test -z "$(pkglib_LTLIBRARIES)" || rm -f $(pkglib_LTLIBRARIES)
-	@list='$(pkglib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(pkglib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_java.la: $(libppl_java_la_OBJECTS) $(libppl_java_la_DEPENDENCIES) $(EXTRA_libppl_java_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_java_la_LINK) -rpath $(pkglibdir) $(libppl_java_la_OBJECTS) $(libppl_java_la_LIBADD) $(LIBS)
 
@@ -738,6 +774,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -886,18 +936,19 @@ uninstall-am: uninstall-pkglibLTLIBRARIES
 .MAKE: all check install install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
-	clean-libtool clean-pkglibLTLIBRARIES ctags distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-data install-data-am install-dvi \
-	install-dvi-am install-exec install-exec-am install-html \
-	install-html-am install-info install-info-am install-man \
-	install-pdf install-pdf-am install-pkglibLTLIBRARIES \
-	install-ps install-ps-am install-strip installcheck \
-	installcheck-am installdirs maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-compile \
-	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
-	tags uninstall uninstall-am uninstall-pkglibLTLIBRARIES
+	clean-libtool clean-pkglibLTLIBRARIES cscopelist ctags \
+	distclean distclean-compile distclean-generic \
+	distclean-libtool distclean-tags distdir dvi dvi-am html \
+	html-am info info-am install install-am install-data \
+	install-data-am install-dvi install-dvi-am install-exec \
+	install-exec-am install-html install-html-am install-info \
+	install-info-am install-man install-pdf install-pdf-am \
+	install-pkglibLTLIBRARIES install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
+	pdf pdf-am ps ps-am tags uninstall uninstall-am \
+	uninstall-pkglibLTLIBRARIES
 
 
 ppl_java_implementation_domains.cc.stamp: $(interface_generator_dependencies)
diff --git a/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4 b/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4
index a06df38..99d35a2 100644
--- a/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4
+++ b/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 This m4 file contains the code for generating ppl_java_<CLASS_NAME>.cc
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -1171,7 +1171,7 @@ CATCH_ALL
 
 m4_define(`ppl_ at CLASS@_drop_some_non_integer_points_code',
 `dnl
-JNIEXPORT void JNICALL Java_parma_1polyhedra_1library_ at 1CLASS@_drop_1some_1non_1integer_1points
+JNIEXPORT void JNICALL Java_parma_1polyhedra_1library_ at 1CLASS@_drop_1some_1non_1integer_1points__Lparma_1polyhedra_1library_Complexity_1Class_2
 (JNIEnv* env, jobject j_this, jobject j_complexity) try {
   @CPP_CLASS@* this_ptr
     = reinterpret_cast<@CPP_CLASS@*>(get_ptr(env, j_this));
@@ -1200,7 +1200,7 @@ CATCH_ALL
 
 m4_define(`ppl_ at CLASS@_drop_some_non_integer_points_2_code',
 `dnl
-JNIEXPORT void JNICALL Java_parma_1polyhedra_1library_ at 1CLASS@_drop_1some_1non_1integer_1points_12
+JNIEXPORT void JNICALL Java_parma_1polyhedra_1library_ at 1CLASS@_drop_1some_1non_1integer_1points__Lparma_1polyhedra_1library_Variables_1Set_2Lparma_1polyhedra_1library_Complexity_1Class_2
 (JNIEnv* env, jobject j_this, jobject j_v_set, jobject j_complexity) try {
   @CPP_CLASS@* this_ptr
     = reinterpret_cast<@CPP_CLASS@*>(get_ptr(env, j_this));
diff --git a/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_files.m4 b/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_files.m4
index fac0061..6b1486d 100644
--- a/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_files.m4
+++ b/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_files.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file parma_polyhedra_library_classes.cc
 dnl using the code in ppl_interface_generator_java_classes_cc_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -49,7 +49,7 @@ ___BEGIN_OF_FILE___ ppl_java_Termination.cc << ___END_OF_FILE___
 m4_include(`ppl_interface_generator_copyright')`'dnl
 */
 
-`#'include "ppl_java_common.defs.hh"
+`#'include "ppl_java_common_defs.hh"
 `#'include "parma_polyhedra_library_Termination.h"
 `#'include "parma_polyhedra_library_C_Polyhedron.h"
 `#'include "parma_polyhedra_library_NNC_Polyhedron.h"
@@ -66,7 +66,7 @@ ___BEGIN_OF_FILE___ ppl_java_`'m4_current_interface`'.cc << ___END_OF_FILE___
 m4_include(`ppl_interface_generator_copyright')`'dnl
 */
 
-`#'include "ppl_java_common.defs.hh"
+`#'include "ppl_java_common_defs.hh"
 `#'include "parma_polyhedra_library_`'m4_current_interface`'.h"
 m4_ifelse(m4_current_interface, Polyhedron,
 `#'include "parma_polyhedra_library_C_Polyhedron.h"
diff --git a/interfaces/Java/jni/ppl_java_common.cc b/interfaces/Java/jni/ppl_java_common.cc
index b3447c3..faea99b 100644
--- a/interfaces/Java/jni/ppl_java_common.cc
+++ b/interfaces/Java/jni/ppl_java_common.cc
@@ -1,6 +1,6 @@
 /* PPL Java interface common routines implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -21,7 +21,7 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-#include "ppl_java_common.defs.hh"
+#include "ppl_java_common_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -34,6 +34,8 @@ Java_Class_Cache cached_classes;
 Java_FMID_Cache cached_FMIDs;
 
 Java_Class_Cache::Java_Class_Cache() {
+  // Java Virtual Machine pointer.
+  jvm = NULL;
   // Non-PPL classes.
   Boolean = NULL;
   Integer = NULL;
@@ -75,6 +77,7 @@ Java_Class_Cache::Java_Class_Cache() {
   PPL_Object = NULL;
   Relation_Symbol = NULL;
   Variable = NULL;
+  Variable_Stringifier = NULL;
   Variables_Set = NULL;
 }
 
@@ -93,6 +96,8 @@ Java_Class_Cache::init_cache(JNIEnv* env, jclass& field, const char* name) {
 void
 Java_Class_Cache::init_cache(JNIEnv* env) {
   assert(env != NULL);
+  // Java Virtual Machine pointer.
+  env->GetJavaVM(&jvm);
   // Non-PPL classes.
   init_cache(env, Boolean, "java/lang/Boolean");
   init_cache(env, Integer, "java/lang/Integer");
@@ -155,6 +160,8 @@ Java_Class_Cache::init_cache(JNIEnv* env) {
   init_cache(env, PPL_Object, "parma_polyhedra_library/PPL_Object");
   init_cache(env, Relation_Symbol, "parma_polyhedra_library/Relation_Symbol");
   init_cache(env, Variable, "parma_polyhedra_library/Variable");
+  // NOTE: initialization of concrete Variable_Stringifier is responsibility
+  // of static (native) method Variable.setStringifier.
   init_cache(env, Variables_Set, "parma_polyhedra_library/Variables_Set");
 }
 
@@ -170,6 +177,8 @@ Java_Class_Cache::clear_cache(JNIEnv* env, jclass& field) {
 void
 Java_Class_Cache::clear_cache(JNIEnv* env) {
   assert(env != NULL);
+  // Clearing the JVM pointer.
+  jvm = NULL;
   // Non-PPL classes.
   clear_cache(env, Boolean);
   clear_cache(env, Integer);
@@ -209,6 +218,7 @@ Java_Class_Cache::clear_cache(JNIEnv* env) {
   clear_cache(env, PPL_Object);
   clear_cache(env, Relation_Symbol);
   clear_cache(env, Variable);
+  clear_cache(env, Variable_Stringifier);
   clear_cache(env, Variables_Set);
 }
 
@@ -334,7 +344,7 @@ build_java_poly_gen_relation(JNIEnv* env, Poly_Gen_Relation& r) {
     }
   }
   jobject ret = env->NewObject(cached_classes.Poly_Gen_Relation,
-			       cached_FMIDs.Poly_Gen_Relation_init_ID,
+                               cached_FMIDs.Poly_Gen_Relation_init_ID,
                                j_value);
   CHECK_RESULT_THROW(env, ret);
   return ret;
@@ -362,7 +372,7 @@ build_java_poly_con_relation(JNIEnv* env, Poly_Con_Relation& r) {
     }
   }
   jobject ret = env->NewObject(cached_classes.Poly_Con_Relation,
-			       cached_FMIDs.Poly_Con_Relation_init_ID,
+                               cached_FMIDs.Poly_Con_Relation_init_ID,
                                j_value);
   CHECK_RESULT_THROW(env, ret);
   return ret;
@@ -469,7 +479,7 @@ build_java_variables_set(JNIEnv* env, const Variables_Set& v_set) {
                                 cached_FMIDs.Variables_Set_init_ID);
   CHECK_RESULT_THROW(env, j_vs);
   for (Variables_Set::const_iterator v_begin = v_set.begin(),
-	 v_end = v_set.end(); v_begin != v_end; ++v_begin) {
+         v_end = v_set.end(); v_begin != v_end; ++v_begin) {
     Variable var(*v_begin);
     jobject j_variable = build_java_variable(env, var);
     env->CallBooleanMethod(j_vs,
@@ -549,6 +559,8 @@ build_cxx_relsym(JNIEnv* env, jobject j_relsym) {
     return GREATER_OR_EQUAL;
   case 4:
     return GREATER_THAN;
+  case 5:
+    return NOT_EQUAL;
   default:
     PPL_JAVA_UNEXPECTED;
   }
@@ -643,11 +655,11 @@ build_java_control_parameter_name
   CHECK_RESULT_ASSERT(env, j_cp_name_class);
   jfieldID cp_name_pricing_get_id
     = env->GetStaticFieldID(j_cp_name_class, "PRICING",
-			    "Lparma_polyhedra_library/Control_Parameter_Name;");
+                            "Lparma_polyhedra_library/Control_Parameter_Name;");
   CHECK_RESULT_ASSERT(env, cp_name_pricing_get_id);
   if (cp_name == MIP_Problem::PRICING)
     return env->GetStaticObjectField(j_cp_name_class,
-				     cp_name_pricing_get_id);
+                                     cp_name_pricing_get_id);
   else
     PPL_UNREACHABLE;
 }
@@ -726,19 +738,19 @@ build_java_pip_problem_control_parameter_name
   CHECK_RESULT_ASSERT(env, j_cp_name_class);
   jfieldID cp_name_cutting_strategy_get_id
     = env->GetStaticFieldID(j_cp_name_class, "CUTTING_STRATEGY",
-			    "Lparma_polyhedra_library/PIP_Problem_Control_Parameter_Name;");
+                            "Lparma_polyhedra_library/PIP_Problem_Control_Parameter_Name;");
   CHECK_RESULT_ASSERT(env, cp_name_cutting_strategy_get_id);
   jfieldID cp_name_pivot_row_strategy_get_id
     = env->GetStaticFieldID(j_cp_name_class, "PIVOT_ROW_STRATEGY",
-			    "Lparma_polyhedra_library/PIP_Problem_Control_Parameter_Name;");
+                            "Lparma_polyhedra_library/PIP_Problem_Control_Parameter_Name;");
   CHECK_RESULT_ASSERT(env, cp_name_pivot_row_strategy_get_id);
   switch (cp_name) {
   case PIP_Problem::CUTTING_STRATEGY:
     return env->GetStaticObjectField(j_cp_name_class,
-				     cp_name_cutting_strategy_get_id);
+                                     cp_name_cutting_strategy_get_id);
   case PIP_Problem::PIVOT_ROW_STRATEGY:
     return env->GetStaticObjectField(j_cp_name_class,
-				     cp_name_pivot_row_strategy_get_id);
+                                     cp_name_pivot_row_strategy_get_id);
   default:
     PPL_UNREACHABLE;
   }
@@ -838,7 +850,7 @@ build_cxx_linear_expression(JNIEnv* env, jobject j_le) {
   if (env->IsAssignableFrom(current_class,
                             cached_classes.Linear_Expression_Variable)) {
     jmethodID mID = cached_FMIDs.Linear_Expression_Variable_var_id_ID;
-    jint var_id = env->CallIntMethod(j_le, mID);
+    jlong var_id = env->CallLongMethod(j_le, mID);
     return Linear_Expression(Variable(var_id));
   }
   // LE_Coefficient
@@ -1025,7 +1037,7 @@ build_java_constraint(JNIEnv* env, const Constraint& c) {
     = env->GetStaticObjectField(cached_classes.Relation_Symbol, fID);
   jobject ret = env->NewObject(cached_classes.Constraint,
                                cached_FMIDs.Constraint_init_ID,
-			       lhs, relation, rhs);
+                               lhs, relation, rhs);
   CHECK_RESULT_THROW(env, ret);
   return ret;
 }
@@ -1038,7 +1050,7 @@ build_java_congruence(JNIEnv* env, const Congruence& cg) {
     = build_java_linear_expression_coefficient(env, -cg.inhomogeneous_term());
   jobject ret = env->NewObject(cached_classes.Congruence,
                                cached_FMIDs.Congruence_init_ID,
-			       j_lhs, j_rhs, j_mod);
+                               j_lhs, j_rhs, j_mod);
   CHECK_RESULT_THROW(env, ret);
   return ret;
 }
@@ -1050,12 +1062,12 @@ build_java_generator(JNIEnv* env, const Generator& g) {
   switch (g.type()) {
   case Generator::LINE:
     ret = env->CallStaticObjectMethod(cached_classes.Generator,
-				      cached_FMIDs.Generator_line_ID,
+                                      cached_FMIDs.Generator_line_ID,
                                       j_g_le);
     break;
   case Generator::RAY:
     ret = env->CallStaticObjectMethod(cached_classes.Generator,
-				      cached_FMIDs.Generator_ray_ID,
+                                      cached_FMIDs.Generator_ray_ID,
                                       j_g_le);
     break;
   case Generator::POINT:
@@ -1090,7 +1102,7 @@ build_java_grid_generator(JNIEnv* env, const Grid_Generator& g) {
   switch (g.type()) {
   case Grid_Generator::LINE:
     ret = env->CallStaticObjectMethod(cached_classes.Grid_Generator,
-				      cached_FMIDs.Grid_Generator_grid_line_ID,
+                                      cached_FMIDs.Grid_Generator_grid_line_ID,
                                       j_g_le);
     break;
   case Grid_Generator::PARAMETER:
@@ -1124,7 +1136,7 @@ build_java_constraint_system(JNIEnv* env, const Constraint_System& cs) {
                                 cached_FMIDs.Constraint_System_init_ID);
   CHECK_RESULT_THROW(env, j_cs);
   for (Constraint_System::const_iterator v_begin = cs.begin(),
-	 v_end = cs.end(); v_begin != v_end; ++v_begin) {
+         v_end = cs.end(); v_begin != v_end; ++v_begin) {
     jobject j_constraint = build_java_constraint(env, *v_begin);
     env->CallBooleanMethod(j_cs,
                            cached_FMIDs.Constraint_System_add_ID,
@@ -1140,7 +1152,7 @@ build_java_generator_system(JNIEnv* env, const Generator_System& gs) {
                                 cached_FMIDs.Generator_System_init_ID);
   CHECK_RESULT_THROW(env, j_gs);
   for (Generator_System::const_iterator v_begin = gs.begin(),
-	 v_end = gs.end(); v_begin != v_end; ++v_begin) {
+         v_end = gs.end(); v_begin != v_end; ++v_begin) {
     jobject j_generator = build_java_generator(env, *v_begin);
     env->CallBooleanMethod(j_gs,
                            cached_FMIDs.Generator_System_add_ID,
@@ -1152,12 +1164,12 @@ build_java_generator_system(JNIEnv* env, const Generator_System& gs) {
 
 jobject
 build_java_grid_generator_system(JNIEnv* env,
-				 const Grid_Generator_System& gs) {
+                                 const Grid_Generator_System& gs) {
   jobject j_gs = env->NewObject(cached_classes.Grid_Generator_System,
                                 cached_FMIDs.Grid_Generator_System_init_ID);
   CHECK_RESULT_THROW(env, j_gs);
   for (Grid_Generator_System::const_iterator v_begin = gs.begin(),
-	 v_end = gs.end(); v_begin != v_end; ++v_begin) {
+         v_end = gs.end(); v_begin != v_end; ++v_begin) {
     jobject j_generator = build_java_grid_generator(env, *v_begin);
     env->CallBooleanMethod(j_gs,
                            cached_FMIDs.Grid_Generator_System_add_ID,
@@ -1173,7 +1185,7 @@ build_java_congruence_system(JNIEnv* env, const Congruence_System& cgs) {
                                  cached_FMIDs.Congruence_System_init_ID);
   CHECK_RESULT_THROW(env, j_cgs);
   for (Congruence_System::const_iterator v_begin = cgs.begin(),
-	 v_end = cgs.end(); v_begin != v_end; ++v_begin) {
+         v_end = cgs.end(); v_begin != v_end; ++v_begin) {
     jobject j_congruence = build_java_congruence(env,*v_begin);
     env->CallBooleanMethod(j_cgs,
                            cached_FMIDs.Congruence_System_add_ID,
@@ -1190,11 +1202,45 @@ build_java_artificial_parameter
   jobject j_den = build_java_coeff(env, art.denominator());
   jobject ret = env->NewObject(cached_classes.Artificial_Parameter,
                                cached_FMIDs.Artificial_Parameter_init_ID,
-			       j_le, j_den);
+                               j_le, j_den);
   CHECK_RESULT_THROW(env, ret);
   return ret;
 }
 
+void
+Java_Variable_output_function(std::ostream& s, Variable v) {
+  // Use cached Java Virtual Machine pointer to retrieve JNI env.
+  JavaVM* jvm = cached_classes.jvm;
+  JNIEnv *env = 0;
+  jvm->AttachCurrentThread((void **)&env, NULL);
+  CHECK_EXCEPTION_ASSERT(env);
+  // Retrieve stringifier object.
+  jclass var_class = cached_classes.Variable;
+  jfieldID fID = cached_FMIDs.Variable_stringifier_ID;
+  jobject stringifier = env->GetStaticObjectField(var_class, fID);
+  CHECK_RESULT_THROW(env, stringifier);
+  // Use it to get the Java string for the variable.
+  jmethodID mID = cached_FMIDs.Variable_Stringifier_stringify_ID;
+#ifndef NDEBUG
+  {
+    // Dynamically retrieve stringifier class and use it to compute
+    // the corresponding method ID, so as to compare it with cached one.
+    jclass dyn_class = env->GetObjectClass(stringifier);
+    jmethodID dyn_mID = env->GetMethodID(dyn_class, "stringify",
+                                         "(J)Ljava/lang/String;");
+    CHECK_RESULT_ASSERT(env, mID == dyn_mID);
+  }
+#endif // #ifndef NDEBUG
+  jstring bi_string
+    = (jstring) env->CallObjectMethod(stringifier, mID, v.id());
+  CHECK_EXCEPTION_THROW(env);
+  // Convert the string and print it on C++ stream.
+  const char* nativeString = env->GetStringUTFChars(bi_string, 0);
+  CHECK_RESULT_THROW(env, nativeString);
+  s << nativeString;
+  env->ReleaseStringUTFChars(bi_string, nativeString);
+}
+
 } // namespace Java
 
 } // namespace Interfaces
diff --git a/interfaces/Java/jni/ppl_java_common.defs.hh b/interfaces/Java/jni/ppl_java_common.defs.hh
deleted file mode 100644
index 990d4f8..0000000
--- a/interfaces/Java/jni/ppl_java_common.defs.hh
+++ /dev/null
@@ -1,883 +0,0 @@
-/* Domain-independent part of the Java interface: declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_java_common_defs_hh
-#define PPL_ppl_java_common_defs_hh 1
-
-#define PPL_NO_AUTOMATIC_INITIALIZATION
-#include "ppl.hh"
-
-#include <jni.h>
-#include "interfaced_boxes.hh"
-#include "marked_pointers.hh"
-
-#define PPL_JAVA_UNEXPECTED \
-  throw std::runtime_error("PPL Java interface internal error")
-
-#define CATCH_ALL \
-  catch(const Java_ExceptionOccurred& e) { \
-  } \
-  catch(const std::overflow_error& e) { \
-    handle_exception(env, e); \
-  } \
-  catch(const std::length_error& e) { \
-    handle_exception(env, e); \
-  } \
-  catch (const std::bad_alloc& e) { \
-    handle_exception(env, e); \
-  } \
-  catch (const std::domain_error& e) { \
-    handle_exception(env, e); \
-  } \
- catch (const std::invalid_argument& e) { \
-    handle_exception(env, e); \
-  } \
- catch(const std::logic_error& e) { \
-    handle_exception(env, e); \
-  } \
-  catch (const std::exception& e) { \
-    handle_exception(env, e); \
-  } \
-  catch (const timeout_exception& e) { \
-    handle_exception(env, e); \
-  } \
-  catch (const deterministic_timeout_exception& e) { \
-    handle_exception(env, e); \
-  } \
-  catch (...) { \
-    handle_exception(env); \
-  }
-
-#define CHECK_EXCEPTION_ASSERT(env)      \
-  assert(!env->ExceptionOccurred())
-#define CHECK_EXCEPTION_THROW(env)       \
-  do {                                   \
-    if (env->ExceptionOccurred())        \
-      throw Java_ExceptionOccurred();    \
-  } while (0)
-#define CHECK_EXCEPTION_RETURN(env, val) \
-  do {                                   \
-    if (env->ExceptionOccurred())        \
-      return val;                        \
-  } while (0)
-#define CHECK_EXCEPTION_RETURN_VOID(env) \
-  do {                                   \
-    if (env->ExceptionOccurred())        \
-      return;                            \
-  } while (0)
-#define CHECK_RESULT_ABORT(env, cond)	 \
-  do {                                   \
-    if (!(cond))			 \
-      abort();                           \
-  } while (0)
-#define CHECK_RESULT_ASSERT(env, cond)   \
-  assert(cond)
-#define CHECK_RESULT_THROW(env, cond)    \
-  do {                                   \
-    if (!(cond))			 \
-      throw Java_ExceptionOccurred();    \
-  } while (0)
-#define CHECK_RESULT_RETURN(env, cond, val)   \
-  do {                                        \
-    if (!(cond))			      \
-      return val;                             \
-  } while (0)
-#define CHECK_RESULT_RETURN_VOID(env, cond)   \
-  do {                                        \
-    if (!(cond))			      \
-      return;                                 \
-  } while (0)
-
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace Java {
-
-struct Java_ExceptionOccurred : public std::exception {
-};
-
-class timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-class deterministic_timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-extern Parma_Polyhedra_Library::Watchdog* p_timeout_object;
-
-typedef
-Parma_Polyhedra_Library::Threshold_Watcher
-<Parma_Polyhedra_Library::Weightwatch_Traits> Weightwatch;
-
-extern Weightwatch* p_deterministic_timeout_object;
-
-void reset_timeout();
-
-void reset_deterministic_timeout();
-
-void
-handle_exception(JNIEnv* env, const std::logic_error& e);
-
-void
-handle_exception(JNIEnv* env, const std::invalid_argument& e);
-
-void
-handle_exception(JNIEnv* env, const std::domain_error& e);
-
-void
-handle_exception(JNIEnv* env, const std::overflow_error& e);
-
-void
-handle_exception(JNIEnv* env, const std::length_error& e);
-
-void
-handle_exception(JNIEnv* env, const std::bad_alloc&);
-
-void
-handle_exception(JNIEnv* env, const std::exception& e);
-
-void
-handle_exception(JNIEnv* env, const timeout_exception& e);
-
-void
-handle_exception(JNIEnv* env, const deterministic_timeout_exception& e);
-
-void
-handle_exception(JNIEnv* env);
-
-//! A cache for global references to Java classes.
-/*!
-  The cache is loaded by \c Parma_Polyhedra_Library.initialize_library();
-  It is cleared by \c Parma_Polyhedra_Library.finalize_library().
-*/
-class Java_Class_Cache {
-public:
-  // Non-PPL types.
-  jclass Boolean;
-  jclass Integer;
-  jclass Long;
-  jclass Iterator;
-  // PPL types.
-  jclass Artificial_Parameter;
-  jclass Artificial_Parameter_Sequence;
-  jclass Bounded_Integer_Type_Overflow;
-  jclass Bounded_Integer_Type_Representation;
-  jclass Bounded_Integer_Type_Width;
-  jclass By_Reference;
-  jclass Coefficient;
-  jclass Congruence;
-  jclass Constraint;
-  jclass Generator;
-  jclass Grid_Generator;
-  jclass Generator_Type;
-  jclass Grid_Generator_Type;
-  jclass Constraint_System;
-  jclass Congruence_System;
-  jclass Generator_System;
-  jclass Grid_Generator_System;
-  jclass Linear_Expression;
-  jclass Linear_Expression_Coefficient;
-  jclass Linear_Expression_Difference;
-  jclass Linear_Expression_Sum;
-  jclass Linear_Expression_Times;
-  jclass Linear_Expression_Unary_Minus;
-  jclass Linear_Expression_Variable;
-  jclass MIP_Problem_Status;
-  jclass Optimization_Mode;
-  jclass Pair;
-  jclass PIP_Problem_Control_Parameter_Name;
-  jclass PIP_Problem_Control_Parameter_Value;
-  jclass PIP_Problem_Status;
-  jclass Poly_Con_Relation;
-  jclass Poly_Gen_Relation;
-  jclass PPL_Object;
-  jclass Relation_Symbol;
-  jclass Variable;
-  jclass Variables_Set;
-
-  //! Default constructor.
-  Java_Class_Cache();
-
-  //! Initializes all cache fields.
-  void init_cache(JNIEnv* env);
-
-  //! Resets all fields to \c NULL.
-  void clear_cache(JNIEnv* env);
-
-private:
-  //! Sets \p field to a global reference to Java class called \p name.
-  void init_cache(JNIEnv* env, jclass& field, const char* name);
-
-  //! Resets \p field to \c NULL, deleting the global reference (if any).
-  void clear_cache(JNIEnv* env, jclass& field);
-
-  // Private and not implemented: copy construction not allowed.
-  Java_Class_Cache(const Java_Class_Cache&);
-  // Private and not implemented: copy assignment not allowed.
-  Java_Class_Cache& operator=(const Java_Class_Cache&);
-};
-
-//! A cache for field and method IDs of Java classes.
-/*!
-  The IDs for fields and methods of PPL Java classes are automatically
-  by the static initializer of the corresponding Java class.
-  The static initializers of some PPL Java class also stores the IDs
-  for fields and methods of non-PPL classes (e.g., Boolean, Long, etc.).
-*/
-struct Java_FMID_Cache {
-  // Non-PPL type method IDs: stored when loading Coefficient.
-  jmethodID Boolean_valueOf_ID;
-  jmethodID Boolean_boolValue_ID;
-  jmethodID Integer_valueOf_ID;
-  jmethodID Integer_intValue_ID;
-  jmethodID Long_valueOf_ID;
-  jmethodID Long_longValue_ID;
-
-  // PPL type field and method IDs.
-  // Artificial_Parameter.
-  jfieldID Artificial_Parameter_le_ID;
-  jfieldID Artificial_Parameter_den_ID;
-  jmethodID Artificial_Parameter_init_ID;
-  jmethodID Artificial_Parameter_Sequence_init_ID;
-  jmethodID Artificial_Parameter_Sequence_add_ID;
-  // Bounded_Integer_Type_Overflow.
-  jfieldID Bounded_Integer_Type_Overflow_OVERFLOW_WRAPS_ID;
-  jfieldID Bounded_Integer_Type_Overflow_OVERFLOW_UNDEFINED_ID;
-  jfieldID Bounded_Integer_Type_Overflow_OVERFLOW_IMPOSSIBLE_ID;
-  jmethodID Bounded_Integer_Type_Overflow_ordinal_ID;
-  // Bounded_Integer_Type_Representation.
-  jfieldID Bounded_Integer_Type_Representation_UNSIGNED_ID;
-  jfieldID Bounded_Integer_Type_Representation_SIGNED_2_COMPLEMENT_ID;
-  jmethodID Bounded_Integer_Type_Representation_ordinal_ID;
-  // Bounded_Integer_Type_Width.
-  jfieldID Bounded_Integer_Type_Width_BITS_8_ID;
-  jfieldID Bounded_Integer_Type_Width_BITS_16_ID;
-  jfieldID Bounded_Integer_Type_Width_BITS_32_ID;
-  jfieldID Bounded_Integer_Type_Width_BITS_64_ID;
-  jfieldID Bounded_Integer_Type_Width_BITS_128_ID;
-  jmethodID Bounded_Integer_Type_Width_ordinal_ID;
-  // By_Reference.
-  jfieldID By_Reference_obj_ID;
-  jmethodID By_Reference_init_ID;
-  // Coefficient.
-  jfieldID Coefficient_value_ID;
-  jmethodID Coefficient_init_from_String_ID;
-  jmethodID Coefficient_toString_ID;
-  // Complexity_Class.
-  jmethodID Complexity_Class_ordinal_ID;
-  // Congruence.
-  jfieldID Congruence_mod_ID;
-  jfieldID Congruence_lhs_ID;
-  jfieldID Congruence_rhs_ID;
-  jmethodID Congruence_init_ID;
-  // Constraint.
-  jfieldID Constraint_lhs_ID;
-  jfieldID Constraint_rhs_ID;
-  jfieldID Constraint_kind_ID;
-  jmethodID Constraint_init_ID;
-  // Degenerate_Element.
-  jmethodID Degenerate_Element_ordinal_ID;
-  // Generator.
-  jfieldID Generator_gt_ID;
-  jfieldID Generator_le_ID;
-  jfieldID Generator_div_ID;
-  jmethodID Generator_line_ID;
-  jmethodID Generator_ray_ID;
-  jmethodID Generator_point_ID;
-  jmethodID Generator_closure_point_ID;
-  // Grid_Generator.
-  jfieldID Grid_Generator_gt_ID;
-  jfieldID Grid_Generator_le_ID;
-  jfieldID Grid_Generator_div_ID;
-  jmethodID Grid_Generator_grid_line_ID;
-  jmethodID Grid_Generator_parameter_ID;
-  jmethodID Grid_Generator_grid_point_ID;
-  // (Grid_) Generator_Type.
-  jmethodID Generator_Type_ordinal_ID;
-  jmethodID Grid_Generator_Type_ordinal_ID;
-  // Systems of Constraint, Congruence, Generator and Grid_Generator.
-  jmethodID Constraint_System_init_ID;
-  jmethodID Constraint_System_add_ID;
-  jmethodID Congruence_System_init_ID;
-  jmethodID Congruence_System_add_ID;
-  jmethodID Generator_System_init_ID;
-  jmethodID Generator_System_add_ID;
-  jmethodID Grid_Generator_System_init_ID;
-  jmethodID Grid_Generator_System_add_ID;
-  // System_Iterator: stored when loading Constraint_System.
-  jmethodID System_iterator_ID;
-  jmethodID System_Iterator_has_next_ID;
-  jmethodID System_Iterator_next_ID;
-  // Linear_Expression.
-  jmethodID Linear_Expression_sum_ID;
-  jmethodID Linear_Expression_times_ID;
-  // Classes extending Linear_Expression.
-  jfieldID Linear_Expression_Coefficient_coeff_ID;
-  jmethodID Linear_Expression_Coefficient_init_ID;
-  jfieldID Linear_Expression_Difference_lhs_ID;
-  jfieldID Linear_Expression_Difference_rhs_ID;
-  jfieldID Linear_Expression_Sum_lhs_ID;
-  jfieldID Linear_Expression_Sum_rhs_ID;
-  jfieldID Linear_Expression_Times_coeff_ID;
-  jfieldID Linear_Expression_Times_lin_expr_ID;
-  jmethodID Linear_Expression_Times_init_from_coeff_var_ID;
-  jfieldID Linear_Expression_Unary_Minus_arg_ID;
-  jmethodID Linear_Expression_Variable_init_ID;
-  jmethodID Linear_Expression_Variable_var_id_ID;
-  // MIP_Problem_Status.
-  jfieldID MIP_Problem_Status_UNFEASIBLE_MIP_PROBLEM_ID;
-  jfieldID MIP_Problem_Status_UNBOUNDED_MIP_PROBLEM_ID;
-  jfieldID MIP_Problem_Status_OPTIMIZED_MIP_PROBLEM_ID;
-  jmethodID MIP_Problem_Status_ordinal_ID;
-  // Optmization_Mode.
-  jfieldID Optimization_Mode_MAXIMIZATION_ID;
-  jfieldID Optimization_Mode_MINIMIZATION_ID;
-  jmethodID Optimization_Mode_ordinal_ID;
-  // PIP_Problem_Control_Parameter_Name.
-  jfieldID PIP_Problem_Control_Parameter_Name_CUTTING_STRATEGY_ID;
-  jfieldID PIP_Problem_Control_Parameter_Name_PIVOT_ROW_STRATEGY;
-  jmethodID PIP_Problem_Control_Parameter_Name_ordinal_ID;
-  // PIP_Problem_Control_Parameter_Value.
-  jfieldID PIP_Problem_Control_Parameter_Value_CUTTING_STRATEGY_FIRST_ID;
-  jfieldID PIP_Problem_Control_Parameter_Value_CUTTING_STRATEGY_DEEPEST_ID;
-  jfieldID PIP_Problem_Control_Parameter_Value_CUTTING_STRATEGY_ALL_ID;
-  jfieldID PIP_Problem_Control_Parameter_Value_PIVOT_ROW_STRATEGY_FIRST_ID;
-  jfieldID PIP_Problem_Control_Parameter_Value_PIVOT_ROW_STRATEGY_MAX_COLUMN_ID;
-  jmethodID PIP_Problem_Control_Parameter_Value_ordinal_ID;
-  // PIP_Problem_Status.
-  jfieldID PIP_Problem_Status_UNFEASIBLE_PIP_PROBLEM_ID;
-  jfieldID PIP_Problem_Status_OPTIMIZED_PIP_PROBLEM_ID;
-  jmethodID PIP_Problem_Status_ordinal_ID;
-  // Pair.
-  jfieldID Pair_first_ID;
-  jfieldID Pair_second_ID;
-  // Poly_Con_Relation and Poly_Gen_Relation.
-  jmethodID Poly_Con_Relation_init_ID;
-  jmethodID Poly_Gen_Relation_init_ID;
-  // PPL_Object.
-  jfieldID PPL_Object_ptr_ID;
-  // Relation_Symbol.
-  jfieldID Relation_Symbol_EQUAL_ID;
-  jfieldID Relation_Symbol_GREATER_OR_EQUAL_ID;
-  jfieldID Relation_Symbol_GREATER_THAN_ID;
-  jmethodID Relation_Symbol_ordinal_ID;
-  // Variable.
-  jfieldID Variable_varid_ID;
-  jmethodID Variable_init_ID;
-  // Variables_Set.
-  jmethodID Variables_Set_init_ID;
-  jmethodID Variables_Set_add_ID;
-  jmethodID Variables_Set_iterator_ID;
-  // Iterators on Variables_Set.
-  jmethodID Variables_Set_Iterator_has_next_ID;
-  jmethodID Variables_Set_Iterator_next_ID;
-};
-
-//! The cached class references.
-extern Java_Class_Cache cached_classes;
-
-//! The field and method ID cache.
-extern Java_FMID_Cache cached_FMIDs;
-
-
-/*! \brief
-  Builds an unsigned C++ number from the Java native number \p value.
-
-  \param value
-  The Java native number of type V to be converted.
-
-  \exception std::invalid_argument
-  Thrown if \p value is negative.
-*/
-template <typename U, typename V>
-U
-jtype_to_unsigned(const V& value);
-
-//! Builds a Java Boolean from C++ bool \p value.
-jobject
-bool_to_j_boolean_class(JNIEnv* env, const bool value);
-
-//! Returns the Java int stored in Java Integer \p j_integer.
-jint
-j_integer_to_j_int(JNIEnv* env, jobject j_integer);
-
-//! Builds a Java Integer from Java int \p value.
-jobject
-j_int_to_j_integer(JNIEnv* env, jint value);
-
-//! Returns the Java long stored in Java Long \p j_long.
-jlong
-j_long_class_to_j_long(JNIEnv* env, jobject j_long);
-
-//! Builds a Java Long from Java long \p value.
-jobject
-j_long_to_j_long_class(JNIEnv* env, jlong value);
-
-/*! \brief
-  Returns \c true if and only if the Java object \p ppl_object
-  refers to a C++ object.
-*/
-bool
-is_java_marked(JNIEnv* env, jobject ppl_object);
-
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Poly_Gen_Relation
-  from C++ Poly_Gen_Relation \p r.
-*/
-jobject
-build_java_poly_gen_relation(JNIEnv* env, Poly_Gen_Relation& r);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Poly_Con_Relation
-  from C++ Poly_Con_Relation \p r.
-*/
-jobject
-build_java_poly_con_relation(JNIEnv* env, Poly_Con_Relation& r);
-
-/*! \brief
-  Builds a C++ Variables_Set
-  from Java parma_polyhedra_library::Variables_Set \p v_set.
-*/
-Variables_Set
-build_cxx_variables_set(JNIEnv* env, jobject v_set);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Variables_Set
-  from C++ Variables_Set \p v_set.
-*/
-jobject
-build_java_variables_set(JNIEnv* env, const Variables_Set& v_set);
-
-/*! \brief
-  Builds a C++ Relation_Symbol
-  from Java parma_polyhedra_library::Relation_Symbol \p j_relsym.
-*/
-Relation_Symbol
-build_cxx_relsym(JNIEnv* env, jobject j_relsym);
-
-/*! \brief
-  Builds a C++ Bounded_Integer_Type_Overflow
-  from Java parma_polyhedra_library::Bounded_Integer_Type_Overflow
-  \p j_bounded_overflow.
-*/
-Bounded_Integer_Type_Overflow
-build_cxx_bounded_overflow(JNIEnv* env, jobject j_bounded_overflow);
-
-/*! \brief
-  Builds a C++ Bounded_Integer_Type_Width
-  from Java parma_polyhedra_library::Bounded_Integer_Type_Width
-  \p j_bounded_width.
-*/
-Bounded_Integer_Type_Width
-build_cxx_bounded_width(JNIEnv* env, jobject j_bounded_width);
-
-/*! \brief
-  Builds a C++ Bounded_Integer_Type_Representation
-  from Java parma_polyhedra_library::Bounded_Integer_Type_Representation
-  \p j_bounded_rep.
-*/
-Bounded_Integer_Type_Representation
-build_cxx_bounded_rep(JNIEnv* env, jobject j_bounded_rep);
-
-/*! \brief
-  Builds a C++ Optimization_Mode
-  from Java parma_polyhedra_library::Optimization_Mode \p j_opt_mode.
-*/
-Optimization_Mode
-build_cxx_optimization_mode(JNIEnv* env, jobject j_opt_mode);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Optimization_Mode
-  from C++ Optimization_Mode \p opt_mode.
-*/
-jobject
-build_java_optimization_mode(JNIEnv* env, const Optimization_Mode& opt_mode);
-
-/*! \brief
-  Builds a C++ MIP_Problem::Control_Parameter_Name
-  from Java parma_polyhedra_library::Control_Parameter_Name \p j_cp_name.
-*/
-MIP_Problem::Control_Parameter_Name
-build_cxx_control_parameter_name(JNIEnv* env, jobject j_cp_name);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Control_Parameter_Name
-  from C++ MIP_Problem::Control_Parameter_Name \p cp_name.
-*/
-jobject
-build_java_control_parameter_name
-(JNIEnv* env, const MIP_Problem::Control_Parameter_Name& cp_name);
-
-/*! \brief
-  Builds a C++ MIP_Problem::Control_Parameter_Value
-  from Java parma_polyhedra_library::Control_Parameter_Value \p j_cp_value.
-*/
-MIP_Problem::Control_Parameter_Value
-build_cxx_control_parameter_value(JNIEnv* env, jobject j_cp_value);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Control_Parameter_Value
-  from C++ MIP_Problem::Control_Parameter_Value \p cp_value.
-*/
-jobject
-build_java_control_parameter_value
-(JNIEnv* env, const MIP_Problem::Control_Parameter_Value& cp_value);
-
-/*! \brief
-  Builds a C++ PIP_Problem::Control_Parameter_Name
-  from Java parma_polyhedra_library::PIP_Problem_Control_Parameter_Name
-  \p j_cp_name.
-*/
-PIP_Problem::Control_Parameter_Name
-build_cxx_pip_problem_control_parameter_name(JNIEnv* env, jobject j_cp_name);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::PIP_Problem_Control_Parameter_Name
-  from C++ PIP_Problem::Control_Parameter_Name \p cp_name.
-*/
-jobject
-build_java_pip_problem_control_parameter_name
-(JNIEnv* env, const PIP_Problem::Control_Parameter_Name& cp_name);
-
-/*! \brief
-  Builds a C++ PIP_Problem::Control_Parameter_Value
-  from Java parma_polyhedra_library::PIP_Problem_Control_Parameter_Value
-  \p j_cp_value.
-*/
-PIP_Problem::Control_Parameter_Value
-build_cxx_pip_problem_control_parameter_value(JNIEnv* env, jobject j_cp_value);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Control_Parameter_Value
-  from C++ PIP_Problem::Control_Parameter_Value \p cp_value.
-*/
-jobject
-build_java_pip_problem_control_parameter_value
-(JNIEnv* env, const PIP_Problem::Control_Parameter_Value& cp_value);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::MIP_Problem_Status
-  from C++ MIP_Problem_Status \p mip_status.
-*/
-jobject
-build_java_mip_status(JNIEnv* env, const MIP_Problem_Status& mip_status);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::PIP_Problem_Status
-  from C++ PIP_Problem_Status \p pip_status.
-*/
-jobject
-build_java_pip_status(JNIEnv* env, const PIP_Problem_Status& pip_status);
-
-/*! \brief
-  Builds a C++ Variable
-  from Java parma_polyhedra_library::Variable \p j_var.
-*/
-Variable
-build_cxx_variable(JNIEnv* env, jobject j_var);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Variable
-  from C++ Variable \p var.
-*/
-jobject
-build_java_variable(JNIEnv* env, const Variable var);
-
-/*! \brief
-  Builds a C++ Coefficient
-  from Java parma_polyhedra_library::Coefficient \p j_coeff.
-*/
-Coefficient
-build_cxx_coeff(JNIEnv* env, jobject j_coeff);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Coefficient
-  from C++ Coefficient \p ppl_coeff.
-*/
-jobject
-build_java_coeff(JNIEnv* env, const Coefficient& ppl_coeff);
-
-/*! \brief
-  Builds a C++ Constraint
-  from Java parma_polyhedra_library::Constraint \p j_constraint.
-*/
-Constraint
-build_cxx_constraint(JNIEnv* env, jobject j_constraint);
-
-/*! \brief
-  Builds a C++ Artificial_Parameter
-  from Java parma_polyhedra_library::Artificial_Parameter
-  \p j_artificial_parameter.
-*/
-PIP_Tree_Node::Artificial_Parameter
-build_cxx_artificial_parameter(JNIEnv* env, jobject j_ap);
-
-/*! \brief
-  Builds a C++ Linear_Expression
-  from Java parma_polyhedra_library::Linear_Expression \p j_le.
-*/
-Linear_Expression
-build_cxx_linear_expression(JNIEnv* env, jobject j_le);
-
-/*! \brief
-  Builds a C++ Congruence
-  from Java parma_polyhedra_library::Congruence \p j_cg.
-*/
-Congruence
-build_cxx_congruence(JNIEnv* env, jobject j_cg);
-
-/*! \brief
-  Builds a C++ Generator
-  from Java parma_polyhedra_library::Generator \p j_g.
-*/
-Generator
-build_cxx_generator(JNIEnv* env, jobject j_g);
-
-/*! \brief
-  Builds a C++ Grid_Generator
-  from Java parma_polyhedra_library::Grid_Generator \p j_g.
-*/
-Grid_Generator
-build_cxx_grid_generator(JNIEnv* env, jobject j_g);
-
-/*! \brief
-  Builds a C++ Grid_Generator_System
-  from Java parma_polyhedra_library::Grid_Generator_System \p j_gs.
-*/
-Grid_Generator_System
-build_cxx_grid_generator_system(JNIEnv* env, jobject j_gs);
-
-/*! \brief
-  Builds a C++ Constraint_System
-  from Java parma_polyhedra_library::Constraint_System \p j_cs.
-*/
-Constraint_System
-build_cxx_constraint_system(JNIEnv* env, jobject j_cs);
-
-/*! \brief
-  Builds a C++ Artificial_Parameter
-  from Java parma_polyhedra_library::Artificial_Parameter \p j_art_param.
-*/
-PIP_Tree_Node::Artificial_Parameter
-build_cxx_artificial_parameter(JNIEnv* env, jobject j_art_param);
-
-/*! \brief
-  Builds a C++ Artificial_Parameter_Sequence
-  from Java parma_polyhedra_library::Artificial_Parameter_Sequence \p j_aps.
-*/
-PIP_Tree_Node::Artificial_Parameter_Sequence
-build_cxx_artificial_parameter_sequence(JNIEnv* env, jobject j_aps);
-
-/*! \brief
-  Builds a C++ Generator_System
-  from Java parma_polyhedra_library::Generator_System \p j_gs.
-*/
-Generator_System
-build_cxx_generator_system(JNIEnv* env, jobject j_gs);
-
-/*! \brief
-  Builds a C++ Congruence_System
-  from Java parma_polyhedra_library::Congruence_System \p j_cgs.
-*/
-Congruence_System
-build_cxx_congruence_system(JNIEnv* env, jobject j_cgs);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Constraint
-  from C++ Constraint \p c.
-*/
-jobject
-build_java_constraint(JNIEnv* env, const Constraint& c);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Artificial_Parameter
-  from C++ Artificial_Parameter \p ap.
-*/
-jobject
-build_java_artificial_parameter(JNIEnv* env,
-                                const PIP_Tree_Node::Artificial_Parameter& ap);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Congruence
-  from C++ Congruence \p cg.
-*/
-jobject
-build_java_congruence(JNIEnv* env, const Congruence& cg);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Generator
-  from C++ Generator \p g.
-*/
-jobject
-build_java_generator(JNIEnv* env, const Generator& g);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Grid_Generator
-  from C++ Grid_Generator \p g.
-*/
-jobject
-build_java_grid_generator(JNIEnv* env, const Grid_Generator& g);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Constraint_System
-  from C++ Constraint_System \p cs.
-*/
-jobject
-build_java_constraint_system(JNIEnv* env, const Constraint_System& cs);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Artificial_Parameter_Sequence
-  from C++ Artificial_Parameter_Sequence \p aps.
-*/
-jobject
-build_java_artificial_parameter_sequence
-(JNIEnv* env, const PIP_Tree_Node::Artificial_Parameter_Sequence& aps);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Grid_Generator_System
-  from C++ Grid_Generator_System \p gs.
-*/
-jobject
-build_java_grid_generator_system(JNIEnv* env, const Grid_Generator_System& gs);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Generator_System
-  from C++ Generator_System \p gs.
-*/
-jobject
-build_java_generator_system(JNIEnv* env, const Generator_System& gs);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Congruence_System
-  from C++ Congruence_System \p cgs.
-*/
-jobject
-build_java_congruence_system(JNIEnv* env, const Congruence_System& cgs);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Linear_Expression_Coefficient
-  from C++ Coefficient \p coeff.
-*/
-jobject
-build_java_linear_expression_coefficient(JNIEnv* env, const Coefficient& coeff);
-
-/*! \brief
-  Sets Java parma_polyhedra_library::Generator \p dst
-  to have the same value as \p src.
-*/
-void
-set_generator(JNIEnv* env, jobject dst, jobject src);
-
-/*! \brief
-  Sets Java Coefficient \p dst to have the same value as \p src.
-*/
-void
-set_coefficient(JNIEnv* env, jobject dst, jobject src);
-
-/*! \brief
-  Modifies parma_polyhedra_library::By_Reference object \p by_ref_dst
-  so that it references object \p src.
-*/
-void
-set_by_reference(JNIEnv* env, jobject by_ref_dst, jobject src);
-
-/*! \brief
-  Returns the object referenced by
-  parma_polyhedra_library::By_Reference object \p by_reference.
-*/
-jobject
-get_by_reference(JNIEnv* env, jobject by_reference);
-
-
-/*! \brief
-  Assigns \p src to one of the fields of
-  parma_polyhedra_library::Pair object \p dst_pair.
-
-  If \p arg is 0, the first element of \p dst_pair is overwritten;
-  if \p arg is 1, the second element of \p dst_pair is overwritten.
-
-  \exception std::runtime_error
-  Thrown if \p arg is neither 0 nor 1.
-*/
-void
-set_pair_element(JNIEnv* env, jobject dst_pair, int arg, jobject src);
-
-/*! \brief
-  Returns one of the fields of the
-  parma_polyhedra_library::Pair object \p pair.
-
-  If \p arg is 0, the first element of \p pair is returned;
-  if \p arg is 1, the second element of \p pair is returned.
-
-  \exception std::runtime_error
-  Thrown if \p arg is neither 0 nor 1.
-*/
-jobject
-get_pair_element(JNIEnv* env, int arg, jobject pair);
-
-//! Returns a pointer to the C++ object wrapped by \p ppl_object.
-void*
-get_ptr(JNIEnv* env, jobject ppl_object);
-
-//! Sets the pointer of the underlying C++ object in the Java object.
-template <typename T>
-void
-set_ptr(JNIEnv* env, jobject ppl_object,
-	const T* address, bool to_be_marked = false);
-
-/*! \brief
-  Builds a Java parma_polyhedra_library::Linear_Expression
-  from the C++ constraint/congruence \p r.
-*/
-template <typename R>
-jobject
-build_linear_expression(JNIEnv* env, const R& r);
-
-} // namespace Java
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-
-#include "ppl_java_common.inlines.hh"
-
-#endif // !defined(PPL_ppl_prolog_common_defs_hh)
diff --git a/interfaces/Java/jni/ppl_java_common.inlines.hh b/interfaces/Java/jni/ppl_java_common.inlines.hh
deleted file mode 100644
index aab7cc1..0000000
--- a/interfaces/Java/jni/ppl_java_common.inlines.hh
+++ /dev/null
@@ -1,245 +0,0 @@
-/* Domain-independent part of the Java interface: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_java_common_inlines_hh
-#define PPL_ppl_java_common_inlines_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace Java {
-
-template <typename U, typename V>
-U
-jtype_to_unsigned(const V& value) {
-  if (value < 0)
-    throw std::invalid_argument("not an unsigned integer.");
-
-  if (sizeof(U) < sizeof(V)) {
-    if (value > static_cast<V>(std::numeric_limits<U>::max()))
-      throw std::invalid_argument("unsigned integer out of range.");
-  }
-
-  return value;
-}
-
-template <typename T>
-inline void
-set_ptr(JNIEnv* env, jobject ppl_object,
-	const T* address, bool to_be_marked) {
-  const T* ptr = (to_be_marked ? mark(address) : address);
-  jlong pointer_value = reinterpret_cast<jlong>(ptr);
-  assert(reinterpret_cast<const T*>(pointer_value) == ptr);
-  env->SetLongField(ppl_object, cached_FMIDs.PPL_Object_ptr_ID, pointer_value);
-}
-
-inline void*
-get_ptr(JNIEnv* env, jobject ppl_object) {
-  jlong pointer_value
-    = env->GetLongField(ppl_object, cached_FMIDs.PPL_Object_ptr_ID);
-  void* ptr = reinterpret_cast<void*>(pointer_value);
-  assert(reinterpret_cast<jlong>(ptr) == pointer_value);
-  return unmark(ptr);
-}
-
-inline bool
-is_java_marked(JNIEnv* env, jobject ppl_object) {
-  jlong pointer_value
-    = env->GetLongField(ppl_object, cached_FMIDs.PPL_Object_ptr_ID);
-  const void* ptr = reinterpret_cast<const void*>(pointer_value);
-  assert(reinterpret_cast<jlong>(ptr) == pointer_value);
-  return marked(ptr);
-}
-
-inline void
-set_coefficient(JNIEnv* env, jobject dst, jobject src) {
-  jobject src_bi
-    = env->GetObjectField(src, cached_FMIDs.Coefficient_value_ID);
-  env->SetObjectField(dst, cached_FMIDs.Coefficient_value_ID, src_bi);
-}
-
-inline void
-set_by_reference(JNIEnv* env, jobject by_ref_dst, jobject src) {
-  env->SetObjectField(by_ref_dst,
-                      cached_FMIDs.By_Reference_obj_ID,
-                      src);
-}
-
-inline jobject
-get_by_reference(JNIEnv* env, jobject by_reference) {
-  return env->GetObjectField(by_reference, cached_FMIDs.By_Reference_obj_ID);
-}
-
-template <typename R>
-jobject
-build_linear_expression(JNIEnv* env, const R& r) {
-  jobject j_ret;
-  PPL_DIRTY_TEMP_COEFFICIENT(coefficient);
-  dimension_type varid = 0;
-  dimension_type space_dimension = r.space_dimension();
-  while (varid < space_dimension
- 	 && (coefficient = r.coefficient(Variable(varid))) == 0)
-    ++varid;
-  if (varid >= space_dimension) {
-    jobject j_coefficient_zero = build_java_coeff(env, Coefficient(0));
-    j_ret = env->NewObject(cached_classes.Linear_Expression_Coefficient,
-                           cached_FMIDs.Linear_Expression_Coefficient_init_ID,
-                           j_coefficient_zero);
-    CHECK_RESULT_THROW(env, j_ret);
-  }
-  else {
-    jmethodID coeff_var_init_ID
-      = cached_FMIDs.Linear_Expression_Times_init_from_coeff_var_ID;
-    jobject j_coefficient = build_java_coeff(env, coefficient);
-    jobject j_variable = build_java_variable(env, Variable(varid));
-    jclass j_le_times_class = cached_classes.Linear_Expression_Times;
-    jobject j_coeff_var = env->NewObject(j_le_times_class,
-                                         coeff_var_init_ID,
-                                         j_coefficient, j_variable);
-    CHECK_EXCEPTION_THROW(env);
-    j_ret = j_coeff_var;
-    while (true) {
-      ++varid;
-      while (varid < space_dimension
-	     && (coefficient = r.coefficient(Variable(varid))) == 0)
-	++varid;
-      if (varid >= space_dimension)
-	break;
-      else {
- 	j_coefficient = build_java_coeff(env, coefficient);
-        j_variable = build_java_variable(env, Variable(varid));
-        j_coeff_var = env->NewObject(j_le_times_class,
-                                     coeff_var_init_ID,
-                                     j_coefficient, j_variable);
-	CHECK_EXCEPTION_THROW(env);
-        j_ret = env->CallObjectMethod(j_ret,
-                                      cached_FMIDs.Linear_Expression_sum_ID,
-                                      j_coeff_var);
-	CHECK_EXCEPTION_THROW(env);
-      }
-    }
-  }
-  return j_ret;
-}
-
-inline Variable
-build_cxx_variable(JNIEnv* env, jobject j_var) {
-  return Variable(env->GetIntField(j_var, cached_FMIDs.Variable_varid_ID));
-}
-
-inline jobject
-build_java_variable(JNIEnv* env, const Variable var) {
-  jobject ret = env->NewObject(cached_classes.Variable,
-                               cached_FMIDs.Variable_init_ID,
-			       var.id());
-  CHECK_RESULT_THROW(env, ret);
-  return ret;
-}
-
-inline Coefficient
-build_cxx_coeff(JNIEnv* env, jobject j_coeff) {
-  jstring bi_string
-    = (jstring) env->CallObjectMethod(j_coeff,
-                                      cached_FMIDs.Coefficient_toString_ID);
-  CHECK_EXCEPTION_THROW(env);
-  const char *nativeString = env->GetStringUTFChars(bi_string, 0);
-  CHECK_RESULT_THROW(env, nativeString);
-  PPL_DIRTY_TEMP_COEFFICIENT(ppl_coeff);
-  ppl_coeff = Coefficient(nativeString);
-  env->ReleaseStringUTFChars(bi_string, nativeString);
-  return ppl_coeff;
-}
-
-inline jobject
-build_java_coeff(JNIEnv* env, const Coefficient& ppl_coeff) {
-  std::ostringstream s;
-  s << ppl_coeff;
-  std::string str = s.str();
-  jstring coeff_string = env->NewStringUTF(str.c_str());
-  CHECK_RESULT_THROW(env, coeff_string);
-  jobject ret = env->NewObject(cached_classes.Coefficient,
-                               cached_FMIDs.Coefficient_init_from_String_ID,
-                               coeff_string);
-  CHECK_RESULT_THROW(env, ret);
-  return ret;
-}
-
-template <typename System, typename Elem_Builder>
-System
-build_cxx_system(JNIEnv* env, jobject j_iterable, Elem_Builder build_cxx_elem) {
-  // Get the iterator.
-  jobject j_iter
-    = env->CallObjectMethod(j_iterable, cached_FMIDs.System_iterator_ID);
-  CHECK_EXCEPTION_THROW(env);
-  // Get the iterator method IDs.
-  jmethodID has_next_mID = cached_FMIDs.System_Iterator_has_next_ID;
-  jmethodID next_mID = cached_FMIDs.System_Iterator_next_ID;
-  // Initialize an empty system.
-  System cxx_sys;
-  jobject j_element;
-  jboolean has_next_value = env->CallBooleanMethod(j_iter, has_next_mID);
-  CHECK_EXCEPTION_ASSERT(env);
-  while (has_next_value) {
-    j_element = env->CallObjectMethod(j_iter, next_mID);
-    CHECK_EXCEPTION_ASSERT(env);
-    cxx_sys.insert(build_cxx_elem(env, j_element));
-    has_next_value = env->CallBooleanMethod(j_iter, has_next_mID);
-    CHECK_EXCEPTION_ASSERT(env);
-  }
-  return cxx_sys;
-}
-
-inline Congruence_System
-build_cxx_congruence_system(JNIEnv* env, jobject j_iterable) {
-  return
-    build_cxx_system<Congruence_System>(env, j_iterable, build_cxx_congruence);
-}
-
-inline Constraint_System
-build_cxx_constraint_system(JNIEnv* env, jobject j_iterable) {
-  return
-    build_cxx_system<Constraint_System>(env, j_iterable, build_cxx_constraint);
-}
-
-inline Generator_System
-build_cxx_generator_system(JNIEnv* env, jobject j_iterable) {
-  return
-    build_cxx_system<Generator_System>(env, j_iterable, build_cxx_generator);
-}
-
-inline Grid_Generator_System
-build_cxx_grid_generator_system(JNIEnv* env, jobject j_iterable) {
-  return build_cxx_system<Grid_Generator_System> (env, j_iterable,
-                                                  build_cxx_grid_generator);
-}
-
-} // namespace Java
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_ppl_java_common_inlines_hh)
diff --git a/interfaces/Java/jni/ppl_java_common_defs.hh b/interfaces/Java/jni/ppl_java_common_defs.hh
new file mode 100644
index 0000000..fb33500
--- /dev/null
+++ b/interfaces/Java/jni/ppl_java_common_defs.hh
@@ -0,0 +1,899 @@
+/* Domain-independent part of the Java interface: declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_java_common_defs_hh
+#define PPL_ppl_java_common_defs_hh 1
+
+#define PPL_NO_AUTOMATIC_INITIALIZATION
+#include "ppl.hh"
+
+#include <jni.h>
+#include "interfaced_boxes.hh"
+#include "marked_pointers.hh"
+
+#define PPL_JAVA_UNEXPECTED \
+  throw std::runtime_error("PPL Java interface internal error")
+
+#define CATCH_ALL \
+  catch(const Java_ExceptionOccurred& e) { \
+  } \
+  catch(const std::overflow_error& e) { \
+    handle_exception(env, e); \
+  } \
+  catch(const std::length_error& e) { \
+    handle_exception(env, e); \
+  } \
+  catch (const std::bad_alloc& e) { \
+    handle_exception(env, e); \
+  } \
+  catch (const std::domain_error& e) { \
+    handle_exception(env, e); \
+  } \
+ catch (const std::invalid_argument& e) { \
+    handle_exception(env, e); \
+  } \
+ catch(const std::logic_error& e) { \
+    handle_exception(env, e); \
+  } \
+  catch (const std::exception& e) { \
+    handle_exception(env, e); \
+  } \
+  catch (const timeout_exception& e) { \
+    handle_exception(env, e); \
+  } \
+  catch (const deterministic_timeout_exception& e) { \
+    handle_exception(env, e); \
+  } \
+  catch (...) { \
+    handle_exception(env); \
+  }
+
+#define CHECK_EXCEPTION_ASSERT(env)      \
+  assert(!env->ExceptionOccurred())
+#define CHECK_EXCEPTION_THROW(env)       \
+  do {                                   \
+    if (env->ExceptionOccurred())        \
+      throw Java_ExceptionOccurred();    \
+  } while (0)
+#define CHECK_EXCEPTION_RETURN(env, val) \
+  do {                                   \
+    if (env->ExceptionOccurred())        \
+      return val;                        \
+  } while (0)
+#define CHECK_EXCEPTION_RETURN_VOID(env) \
+  do {                                   \
+    if (env->ExceptionOccurred())        \
+      return;                            \
+  } while (0)
+#define CHECK_RESULT_ABORT(env, cond)    \
+  do {                                   \
+    if (!(cond))                         \
+      abort();                           \
+  } while (0)
+#define CHECK_RESULT_ASSERT(env, cond)   \
+  assert(cond)
+#define CHECK_RESULT_THROW(env, cond)    \
+  do {                                   \
+    if (!(cond))                         \
+      throw Java_ExceptionOccurred();    \
+  } while (0)
+#define CHECK_RESULT_RETURN(env, cond, val)   \
+  do {                                        \
+    if (!(cond))                              \
+      return val;                             \
+  } while (0)
+#define CHECK_RESULT_RETURN_VOID(env, cond)   \
+  do {                                        \
+    if (!(cond))                              \
+      return;                                 \
+  } while (0)
+
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace Java {
+
+struct Java_ExceptionOccurred : public std::exception {
+};
+
+class timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+class deterministic_timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+extern Parma_Polyhedra_Library::Watchdog* p_timeout_object;
+
+typedef
+Parma_Polyhedra_Library::Threshold_Watcher
+<Parma_Polyhedra_Library::Weightwatch_Traits> Weightwatch;
+
+extern Weightwatch* p_deterministic_timeout_object;
+
+void reset_timeout();
+
+void reset_deterministic_timeout();
+
+void
+handle_exception(JNIEnv* env, const std::logic_error& e);
+
+void
+handle_exception(JNIEnv* env, const std::invalid_argument& e);
+
+void
+handle_exception(JNIEnv* env, const std::domain_error& e);
+
+void
+handle_exception(JNIEnv* env, const std::overflow_error& e);
+
+void
+handle_exception(JNIEnv* env, const std::length_error& e);
+
+void
+handle_exception(JNIEnv* env, const std::bad_alloc&);
+
+void
+handle_exception(JNIEnv* env, const std::exception& e);
+
+void
+handle_exception(JNIEnv* env, const timeout_exception& e);
+
+void
+handle_exception(JNIEnv* env, const deterministic_timeout_exception& e);
+
+void
+handle_exception(JNIEnv* env);
+
+//! A cache for global references to Java classes.
+/*!
+  The cache is loaded by \c Parma_Polyhedra_Library.initialize_library();
+  It is cleared by \c Parma_Polyhedra_Library.finalize_library().
+*/
+class Java_Class_Cache {
+public:
+  // The Java VM pointer (not a class, but sometimes needed).
+  JavaVM* jvm;
+  // Non-PPL types.
+  jclass Boolean;
+  jclass Integer;
+  jclass Long;
+  jclass Iterator;
+  // PPL types.
+  jclass Artificial_Parameter;
+  jclass Artificial_Parameter_Sequence;
+  jclass Bounded_Integer_Type_Overflow;
+  jclass Bounded_Integer_Type_Representation;
+  jclass Bounded_Integer_Type_Width;
+  jclass By_Reference;
+  jclass Coefficient;
+  jclass Congruence;
+  jclass Constraint;
+  jclass Generator;
+  jclass Grid_Generator;
+  jclass Generator_Type;
+  jclass Grid_Generator_Type;
+  jclass Constraint_System;
+  jclass Congruence_System;
+  jclass Generator_System;
+  jclass Grid_Generator_System;
+  jclass Linear_Expression;
+  jclass Linear_Expression_Coefficient;
+  jclass Linear_Expression_Difference;
+  jclass Linear_Expression_Sum;
+  jclass Linear_Expression_Times;
+  jclass Linear_Expression_Unary_Minus;
+  jclass Linear_Expression_Variable;
+  jclass MIP_Problem_Status;
+  jclass Optimization_Mode;
+  jclass Pair;
+  jclass PIP_Problem_Control_Parameter_Name;
+  jclass PIP_Problem_Control_Parameter_Value;
+  jclass PIP_Problem_Status;
+  jclass Poly_Con_Relation;
+  jclass Poly_Gen_Relation;
+  jclass PPL_Object;
+  jclass Relation_Symbol;
+  jclass Variable;
+  jclass Variable_Stringifier;
+  jclass Variables_Set;
+
+  //! Default constructor.
+  Java_Class_Cache();
+
+  //! Initializes all cache fields.
+  void init_cache(JNIEnv* env);
+
+  //! Resets all fields to \c NULL.
+  void clear_cache(JNIEnv* env);
+
+private:
+  //! Sets \p field to a global reference to Java class called \p name.
+  void init_cache(JNIEnv* env, jclass& field, const char* name);
+
+  //! Resets \p field to \c NULL, deleting the global reference (if any).
+  void clear_cache(JNIEnv* env, jclass& field);
+
+  // Private and not implemented: copy construction not allowed.
+  Java_Class_Cache(const Java_Class_Cache&);
+  // Private and not implemented: copy assignment not allowed.
+  Java_Class_Cache& operator=(const Java_Class_Cache&);
+};
+
+//! A cache for field and method IDs of Java classes.
+/*!
+  The IDs for fields and methods of PPL Java classes are automatically
+  by the static initializer of the corresponding Java class.
+  The static initializers of some PPL Java class also stores the IDs
+  for fields and methods of non-PPL classes (e.g., Boolean, Long, etc.).
+*/
+struct Java_FMID_Cache {
+  // Non-PPL type method IDs: stored when loading Coefficient.
+  jmethodID Boolean_valueOf_ID;
+  jmethodID Boolean_boolValue_ID;
+  jmethodID Integer_valueOf_ID;
+  jmethodID Integer_intValue_ID;
+  jmethodID Long_valueOf_ID;
+  jmethodID Long_longValue_ID;
+
+  // PPL type field and method IDs.
+  // Artificial_Parameter.
+  jfieldID Artificial_Parameter_le_ID;
+  jfieldID Artificial_Parameter_den_ID;
+  jmethodID Artificial_Parameter_init_ID;
+  jmethodID Artificial_Parameter_Sequence_init_ID;
+  jmethodID Artificial_Parameter_Sequence_add_ID;
+  // Bounded_Integer_Type_Overflow.
+  jfieldID Bounded_Integer_Type_Overflow_OVERFLOW_WRAPS_ID;
+  jfieldID Bounded_Integer_Type_Overflow_OVERFLOW_UNDEFINED_ID;
+  jfieldID Bounded_Integer_Type_Overflow_OVERFLOW_IMPOSSIBLE_ID;
+  jmethodID Bounded_Integer_Type_Overflow_ordinal_ID;
+  // Bounded_Integer_Type_Representation.
+  jfieldID Bounded_Integer_Type_Representation_UNSIGNED_ID;
+  jfieldID Bounded_Integer_Type_Representation_SIGNED_2_COMPLEMENT_ID;
+  jmethodID Bounded_Integer_Type_Representation_ordinal_ID;
+  // Bounded_Integer_Type_Width.
+  jfieldID Bounded_Integer_Type_Width_BITS_8_ID;
+  jfieldID Bounded_Integer_Type_Width_BITS_16_ID;
+  jfieldID Bounded_Integer_Type_Width_BITS_32_ID;
+  jfieldID Bounded_Integer_Type_Width_BITS_64_ID;
+  jfieldID Bounded_Integer_Type_Width_BITS_128_ID;
+  jmethodID Bounded_Integer_Type_Width_ordinal_ID;
+  // By_Reference.
+  jfieldID By_Reference_obj_ID;
+  jmethodID By_Reference_init_ID;
+  // Coefficient.
+  jfieldID Coefficient_value_ID;
+  jmethodID Coefficient_init_from_String_ID;
+  jmethodID Coefficient_toString_ID;
+  // Complexity_Class.
+  jmethodID Complexity_Class_ordinal_ID;
+  // Congruence.
+  jfieldID Congruence_mod_ID;
+  jfieldID Congruence_lhs_ID;
+  jfieldID Congruence_rhs_ID;
+  jmethodID Congruence_init_ID;
+  // Constraint.
+  jfieldID Constraint_lhs_ID;
+  jfieldID Constraint_rhs_ID;
+  jfieldID Constraint_kind_ID;
+  jmethodID Constraint_init_ID;
+  // Degenerate_Element.
+  jmethodID Degenerate_Element_ordinal_ID;
+  // Generator.
+  jfieldID Generator_gt_ID;
+  jfieldID Generator_le_ID;
+  jfieldID Generator_div_ID;
+  jmethodID Generator_line_ID;
+  jmethodID Generator_ray_ID;
+  jmethodID Generator_point_ID;
+  jmethodID Generator_closure_point_ID;
+  // Grid_Generator.
+  jfieldID Grid_Generator_gt_ID;
+  jfieldID Grid_Generator_le_ID;
+  jfieldID Grid_Generator_div_ID;
+  jmethodID Grid_Generator_grid_line_ID;
+  jmethodID Grid_Generator_parameter_ID;
+  jmethodID Grid_Generator_grid_point_ID;
+  // (Grid_) Generator_Type.
+  jmethodID Generator_Type_ordinal_ID;
+  jmethodID Grid_Generator_Type_ordinal_ID;
+  // Systems of Constraint, Congruence, Generator and Grid_Generator.
+  jmethodID Constraint_System_init_ID;
+  jmethodID Constraint_System_add_ID;
+  jmethodID Congruence_System_init_ID;
+  jmethodID Congruence_System_add_ID;
+  jmethodID Generator_System_init_ID;
+  jmethodID Generator_System_add_ID;
+  jmethodID Grid_Generator_System_init_ID;
+  jmethodID Grid_Generator_System_add_ID;
+  // System_Iterator: stored when loading Constraint_System.
+  jmethodID System_iterator_ID;
+  jmethodID System_Iterator_has_next_ID;
+  jmethodID System_Iterator_next_ID;
+  // Linear_Expression.
+  jmethodID Linear_Expression_sum_ID;
+  jmethodID Linear_Expression_times_ID;
+  // Classes extending Linear_Expression.
+  jfieldID Linear_Expression_Coefficient_coeff_ID;
+  jmethodID Linear_Expression_Coefficient_init_ID;
+  jfieldID Linear_Expression_Difference_lhs_ID;
+  jfieldID Linear_Expression_Difference_rhs_ID;
+  jfieldID Linear_Expression_Sum_lhs_ID;
+  jfieldID Linear_Expression_Sum_rhs_ID;
+  jfieldID Linear_Expression_Times_coeff_ID;
+  jfieldID Linear_Expression_Times_lin_expr_ID;
+  jmethodID Linear_Expression_Times_init_from_coeff_var_ID;
+  jfieldID Linear_Expression_Unary_Minus_arg_ID;
+  jmethodID Linear_Expression_Variable_init_ID;
+  jmethodID Linear_Expression_Variable_var_id_ID;
+  // MIP_Problem_Status.
+  jfieldID MIP_Problem_Status_UNFEASIBLE_MIP_PROBLEM_ID;
+  jfieldID MIP_Problem_Status_UNBOUNDED_MIP_PROBLEM_ID;
+  jfieldID MIP_Problem_Status_OPTIMIZED_MIP_PROBLEM_ID;
+  jmethodID MIP_Problem_Status_ordinal_ID;
+  // Optmization_Mode.
+  jfieldID Optimization_Mode_MAXIMIZATION_ID;
+  jfieldID Optimization_Mode_MINIMIZATION_ID;
+  jmethodID Optimization_Mode_ordinal_ID;
+  // PIP_Problem_Control_Parameter_Name.
+  jfieldID PIP_Problem_Control_Parameter_Name_CUTTING_STRATEGY_ID;
+  jfieldID PIP_Problem_Control_Parameter_Name_PIVOT_ROW_STRATEGY;
+  jmethodID PIP_Problem_Control_Parameter_Name_ordinal_ID;
+  // PIP_Problem_Control_Parameter_Value.
+  jfieldID PIP_Problem_Control_Parameter_Value_CUTTING_STRATEGY_FIRST_ID;
+  jfieldID PIP_Problem_Control_Parameter_Value_CUTTING_STRATEGY_DEEPEST_ID;
+  jfieldID PIP_Problem_Control_Parameter_Value_CUTTING_STRATEGY_ALL_ID;
+  jfieldID PIP_Problem_Control_Parameter_Value_PIVOT_ROW_STRATEGY_FIRST_ID;
+  jfieldID PIP_Problem_Control_Parameter_Value_PIVOT_ROW_STRATEGY_MAX_COLUMN_ID;
+  jmethodID PIP_Problem_Control_Parameter_Value_ordinal_ID;
+  // PIP_Problem_Status.
+  jfieldID PIP_Problem_Status_UNFEASIBLE_PIP_PROBLEM_ID;
+  jfieldID PIP_Problem_Status_OPTIMIZED_PIP_PROBLEM_ID;
+  jmethodID PIP_Problem_Status_ordinal_ID;
+  // Pair.
+  jfieldID Pair_first_ID;
+  jfieldID Pair_second_ID;
+  // Poly_Con_Relation and Poly_Gen_Relation.
+  jmethodID Poly_Con_Relation_init_ID;
+  jmethodID Poly_Gen_Relation_init_ID;
+  // PPL_Object.
+  jfieldID PPL_Object_ptr_ID;
+  // Relation_Symbol.
+  jfieldID Relation_Symbol_EQUAL_ID;
+  jfieldID Relation_Symbol_GREATER_OR_EQUAL_ID;
+  jfieldID Relation_Symbol_GREATER_THAN_ID;
+  jmethodID Relation_Symbol_ordinal_ID;
+  // Variable.
+  jfieldID Variable_varid_ID;
+  jfieldID Variable_stringifier_ID;
+  jmethodID Variable_init_ID;
+  // Variable_Stringifier.
+  jmethodID Variable_Stringifier_stringify_ID;
+  // Variables_Set.
+  jmethodID Variables_Set_init_ID;
+  jmethodID Variables_Set_add_ID;
+  jmethodID Variables_Set_iterator_ID;
+  // Iterators on Variables_Set.
+  jmethodID Variables_Set_Iterator_has_next_ID;
+  jmethodID Variables_Set_Iterator_next_ID;
+};
+
+//! The cached class references.
+extern Java_Class_Cache cached_classes;
+
+//! The field and method ID cache.
+extern Java_FMID_Cache cached_FMIDs;
+
+
+/*! \brief
+  Builds an unsigned C++ number from the Java native number \p value.
+
+  \param value
+  The Java native number of type V to be converted.
+
+  \exception std::invalid_argument
+  Thrown if \p value is negative.
+*/
+template <typename U, typename V>
+U
+jtype_to_unsigned(const V& value);
+
+//! Builds a Java Boolean from C++ bool \p value.
+jobject
+bool_to_j_boolean_class(JNIEnv* env, const bool value);
+
+//! Returns the Java int stored in Java Integer \p j_integer.
+jint
+j_integer_to_j_int(JNIEnv* env, jobject j_integer);
+
+//! Builds a Java Integer from Java int \p value.
+jobject
+j_int_to_j_integer(JNIEnv* env, jint value);
+
+//! Returns the Java long stored in Java Long \p j_long.
+jlong
+j_long_class_to_j_long(JNIEnv* env, jobject j_long);
+
+//! Builds a Java Long from Java long \p value.
+jobject
+j_long_to_j_long_class(JNIEnv* env, jlong value);
+
+/*! \brief
+  Returns \c true if and only if the Java object \p ppl_object
+  refers to a C++ object.
+*/
+bool
+is_java_marked(JNIEnv* env, jobject ppl_object);
+
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Poly_Gen_Relation
+  from C++ Poly_Gen_Relation \p r.
+*/
+jobject
+build_java_poly_gen_relation(JNIEnv* env, Poly_Gen_Relation& r);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Poly_Con_Relation
+  from C++ Poly_Con_Relation \p r.
+*/
+jobject
+build_java_poly_con_relation(JNIEnv* env, Poly_Con_Relation& r);
+
+/*! \brief
+  Builds a C++ Variables_Set
+  from Java parma_polyhedra_library::Variables_Set \p v_set.
+*/
+Variables_Set
+build_cxx_variables_set(JNIEnv* env, jobject v_set);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Variables_Set
+  from C++ Variables_Set \p v_set.
+*/
+jobject
+build_java_variables_set(JNIEnv* env, const Variables_Set& v_set);
+
+/*! \brief
+  Builds a C++ Relation_Symbol
+  from Java parma_polyhedra_library::Relation_Symbol \p j_relsym.
+*/
+Relation_Symbol
+build_cxx_relsym(JNIEnv* env, jobject j_relsym);
+
+/*! \brief
+  Builds a C++ Bounded_Integer_Type_Overflow
+  from Java parma_polyhedra_library::Bounded_Integer_Type_Overflow
+  \p j_bounded_overflow.
+*/
+Bounded_Integer_Type_Overflow
+build_cxx_bounded_overflow(JNIEnv* env, jobject j_bounded_overflow);
+
+/*! \brief
+  Builds a C++ Bounded_Integer_Type_Width
+  from Java parma_polyhedra_library::Bounded_Integer_Type_Width
+  \p j_bounded_width.
+*/
+Bounded_Integer_Type_Width
+build_cxx_bounded_width(JNIEnv* env, jobject j_bounded_width);
+
+/*! \brief
+  Builds a C++ Bounded_Integer_Type_Representation
+  from Java parma_polyhedra_library::Bounded_Integer_Type_Representation
+  \p j_bounded_rep.
+*/
+Bounded_Integer_Type_Representation
+build_cxx_bounded_rep(JNIEnv* env, jobject j_bounded_rep);
+
+/*! \brief
+  Builds a C++ Optimization_Mode
+  from Java parma_polyhedra_library::Optimization_Mode \p j_opt_mode.
+*/
+Optimization_Mode
+build_cxx_optimization_mode(JNIEnv* env, jobject j_opt_mode);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Optimization_Mode
+  from C++ Optimization_Mode \p opt_mode.
+*/
+jobject
+build_java_optimization_mode(JNIEnv* env, const Optimization_Mode& opt_mode);
+
+/*! \brief
+  Builds a C++ MIP_Problem::Control_Parameter_Name
+  from Java parma_polyhedra_library::Control_Parameter_Name \p j_cp_name.
+*/
+MIP_Problem::Control_Parameter_Name
+build_cxx_control_parameter_name(JNIEnv* env, jobject j_cp_name);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Control_Parameter_Name
+  from C++ MIP_Problem::Control_Parameter_Name \p cp_name.
+*/
+jobject
+build_java_control_parameter_name
+(JNIEnv* env, const MIP_Problem::Control_Parameter_Name& cp_name);
+
+/*! \brief
+  Builds a C++ MIP_Problem::Control_Parameter_Value
+  from Java parma_polyhedra_library::Control_Parameter_Value \p j_cp_value.
+*/
+MIP_Problem::Control_Parameter_Value
+build_cxx_control_parameter_value(JNIEnv* env, jobject j_cp_value);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Control_Parameter_Value
+  from C++ MIP_Problem::Control_Parameter_Value \p cp_value.
+*/
+jobject
+build_java_control_parameter_value
+(JNIEnv* env, const MIP_Problem::Control_Parameter_Value& cp_value);
+
+/*! \brief
+  Builds a C++ PIP_Problem::Control_Parameter_Name
+  from Java parma_polyhedra_library::PIP_Problem_Control_Parameter_Name
+  \p j_cp_name.
+*/
+PIP_Problem::Control_Parameter_Name
+build_cxx_pip_problem_control_parameter_name(JNIEnv* env, jobject j_cp_name);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::PIP_Problem_Control_Parameter_Name
+  from C++ PIP_Problem::Control_Parameter_Name \p cp_name.
+*/
+jobject
+build_java_pip_problem_control_parameter_name
+(JNIEnv* env, const PIP_Problem::Control_Parameter_Name& cp_name);
+
+/*! \brief
+  Builds a C++ PIP_Problem::Control_Parameter_Value
+  from Java parma_polyhedra_library::PIP_Problem_Control_Parameter_Value
+  \p j_cp_value.
+*/
+PIP_Problem::Control_Parameter_Value
+build_cxx_pip_problem_control_parameter_value(JNIEnv* env, jobject j_cp_value);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Control_Parameter_Value
+  from C++ PIP_Problem::Control_Parameter_Value \p cp_value.
+*/
+jobject
+build_java_pip_problem_control_parameter_value
+(JNIEnv* env, const PIP_Problem::Control_Parameter_Value& cp_value);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::MIP_Problem_Status
+  from C++ MIP_Problem_Status \p mip_status.
+*/
+jobject
+build_java_mip_status(JNIEnv* env, const MIP_Problem_Status& mip_status);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::PIP_Problem_Status
+  from C++ PIP_Problem_Status \p pip_status.
+*/
+jobject
+build_java_pip_status(JNIEnv* env, const PIP_Problem_Status& pip_status);
+
+/*! \brief
+  Builds a C++ Variable
+  from Java parma_polyhedra_library::Variable \p j_var.
+*/
+Variable
+build_cxx_variable(JNIEnv* env, jobject j_var);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Variable
+  from C++ Variable \p var.
+*/
+jobject
+build_java_variable(JNIEnv* env, const Variable var);
+
+/*! \brief
+  The customizable variable output function for Java interface.
+
+  Customization is obtained by providing an object implementing interface
+  <CODE>Variable_Stringifier</CODE> and attaching it to class
+  <CODE>Variable</CODE> using static method <CODE>setStringifier</CODE>.
+*/
+void
+Java_Variable_output_function(std::ostream& s, Variable v);
+
+/*! \brief
+  Builds a C++ Coefficient
+  from Java parma_polyhedra_library::Coefficient \p j_coeff.
+*/
+Coefficient
+build_cxx_coeff(JNIEnv* env, jobject j_coeff);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Coefficient
+  from C++ Coefficient \p ppl_coeff.
+*/
+jobject
+build_java_coeff(JNIEnv* env, const Coefficient& ppl_coeff);
+
+/*! \brief
+  Builds a C++ Constraint
+  from Java parma_polyhedra_library::Constraint \p j_constraint.
+*/
+Constraint
+build_cxx_constraint(JNIEnv* env, jobject j_constraint);
+
+/*! \brief
+  Builds a C++ Artificial_Parameter
+  from Java parma_polyhedra_library::Artificial_Parameter
+  \p j_artificial_parameter.
+*/
+PIP_Tree_Node::Artificial_Parameter
+build_cxx_artificial_parameter(JNIEnv* env, jobject j_ap);
+
+/*! \brief
+  Builds a C++ Linear_Expression
+  from Java parma_polyhedra_library::Linear_Expression \p j_le.
+*/
+Linear_Expression
+build_cxx_linear_expression(JNIEnv* env, jobject j_le);
+
+/*! \brief
+  Builds a C++ Congruence
+  from Java parma_polyhedra_library::Congruence \p j_cg.
+*/
+Congruence
+build_cxx_congruence(JNIEnv* env, jobject j_cg);
+
+/*! \brief
+  Builds a C++ Generator
+  from Java parma_polyhedra_library::Generator \p j_g.
+*/
+Generator
+build_cxx_generator(JNIEnv* env, jobject j_g);
+
+/*! \brief
+  Builds a C++ Grid_Generator
+  from Java parma_polyhedra_library::Grid_Generator \p j_g.
+*/
+Grid_Generator
+build_cxx_grid_generator(JNIEnv* env, jobject j_g);
+
+/*! \brief
+  Builds a C++ Grid_Generator_System
+  from Java parma_polyhedra_library::Grid_Generator_System \p j_gs.
+*/
+Grid_Generator_System
+build_cxx_grid_generator_system(JNIEnv* env, jobject j_gs);
+
+/*! \brief
+  Builds a C++ Constraint_System
+  from Java parma_polyhedra_library::Constraint_System \p j_cs.
+*/
+Constraint_System
+build_cxx_constraint_system(JNIEnv* env, jobject j_cs);
+
+/*! \brief
+  Builds a C++ Artificial_Parameter
+  from Java parma_polyhedra_library::Artificial_Parameter \p j_art_param.
+*/
+PIP_Tree_Node::Artificial_Parameter
+build_cxx_artificial_parameter(JNIEnv* env, jobject j_art_param);
+
+/*! \brief
+  Builds a C++ Artificial_Parameter_Sequence
+  from Java parma_polyhedra_library::Artificial_Parameter_Sequence \p j_aps.
+*/
+PIP_Tree_Node::Artificial_Parameter_Sequence
+build_cxx_artificial_parameter_sequence(JNIEnv* env, jobject j_aps);
+
+/*! \brief
+  Builds a C++ Generator_System
+  from Java parma_polyhedra_library::Generator_System \p j_gs.
+*/
+Generator_System
+build_cxx_generator_system(JNIEnv* env, jobject j_gs);
+
+/*! \brief
+  Builds a C++ Congruence_System
+  from Java parma_polyhedra_library::Congruence_System \p j_cgs.
+*/
+Congruence_System
+build_cxx_congruence_system(JNIEnv* env, jobject j_cgs);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Constraint
+  from C++ Constraint \p c.
+*/
+jobject
+build_java_constraint(JNIEnv* env, const Constraint& c);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Artificial_Parameter
+  from C++ Artificial_Parameter \p ap.
+*/
+jobject
+build_java_artificial_parameter(JNIEnv* env,
+                                const PIP_Tree_Node::Artificial_Parameter& ap);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Congruence
+  from C++ Congruence \p cg.
+*/
+jobject
+build_java_congruence(JNIEnv* env, const Congruence& cg);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Generator
+  from C++ Generator \p g.
+*/
+jobject
+build_java_generator(JNIEnv* env, const Generator& g);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Grid_Generator
+  from C++ Grid_Generator \p g.
+*/
+jobject
+build_java_grid_generator(JNIEnv* env, const Grid_Generator& g);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Constraint_System
+  from C++ Constraint_System \p cs.
+*/
+jobject
+build_java_constraint_system(JNIEnv* env, const Constraint_System& cs);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Artificial_Parameter_Sequence
+  from C++ Artificial_Parameter_Sequence \p aps.
+*/
+jobject
+build_java_artificial_parameter_sequence
+(JNIEnv* env, const PIP_Tree_Node::Artificial_Parameter_Sequence& aps);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Grid_Generator_System
+  from C++ Grid_Generator_System \p gs.
+*/
+jobject
+build_java_grid_generator_system(JNIEnv* env, const Grid_Generator_System& gs);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Generator_System
+  from C++ Generator_System \p gs.
+*/
+jobject
+build_java_generator_system(JNIEnv* env, const Generator_System& gs);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Congruence_System
+  from C++ Congruence_System \p cgs.
+*/
+jobject
+build_java_congruence_system(JNIEnv* env, const Congruence_System& cgs);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Linear_Expression_Coefficient
+  from C++ Coefficient \p coeff.
+*/
+jobject
+build_java_linear_expression_coefficient(JNIEnv* env, const Coefficient& coeff);
+
+/*! \brief
+  Sets Java parma_polyhedra_library::Generator \p dst
+  to have the same value as \p src.
+*/
+void
+set_generator(JNIEnv* env, jobject dst, jobject src);
+
+/*! \brief
+  Sets Java Coefficient \p dst to have the same value as \p src.
+*/
+void
+set_coefficient(JNIEnv* env, jobject dst, jobject src);
+
+/*! \brief
+  Modifies parma_polyhedra_library::By_Reference object \p by_ref_dst
+  so that it references object \p src.
+*/
+void
+set_by_reference(JNIEnv* env, jobject by_ref_dst, jobject src);
+
+/*! \brief
+  Returns the object referenced by
+  parma_polyhedra_library::By_Reference object \p by_reference.
+*/
+jobject
+get_by_reference(JNIEnv* env, jobject by_reference);
+
+
+/*! \brief
+  Assigns \p src to one of the fields of
+  parma_polyhedra_library::Pair object \p dst_pair.
+
+  If \p arg is 0, the first element of \p dst_pair is overwritten;
+  if \p arg is 1, the second element of \p dst_pair is overwritten.
+
+  \exception std::runtime_error
+  Thrown if \p arg is neither 0 nor 1.
+*/
+void
+set_pair_element(JNIEnv* env, jobject dst_pair, int arg, jobject src);
+
+/*! \brief
+  Returns one of the fields of the
+  parma_polyhedra_library::Pair object \p pair.
+
+  If \p arg is 0, the first element of \p pair is returned;
+  if \p arg is 1, the second element of \p pair is returned.
+
+  \exception std::runtime_error
+  Thrown if \p arg is neither 0 nor 1.
+*/
+jobject
+get_pair_element(JNIEnv* env, int arg, jobject pair);
+
+//! Returns a pointer to the C++ object wrapped by \p ppl_object.
+void*
+get_ptr(JNIEnv* env, jobject ppl_object);
+
+//! Sets the pointer of the underlying C++ object in the Java object.
+template <typename T>
+void
+set_ptr(JNIEnv* env, jobject ppl_object,
+        const T* address, bool to_be_marked = false);
+
+/*! \brief
+  Builds a Java parma_polyhedra_library::Linear_Expression
+  from the C++ constraint/congruence \p r.
+*/
+template <typename R>
+jobject
+build_linear_expression(JNIEnv* env, const R& r);
+
+} // namespace Java
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+
+#include "ppl_java_common_inlines.hh"
+
+#endif // !defined(PPL_ppl_prolog_common_defs_hh)
diff --git a/interfaces/Java/jni/ppl_java_common_inlines.hh b/interfaces/Java/jni/ppl_java_common_inlines.hh
new file mode 100644
index 0000000..3f3c8f0
--- /dev/null
+++ b/interfaces/Java/jni/ppl_java_common_inlines.hh
@@ -0,0 +1,245 @@
+/* Domain-independent part of the Java interface: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_java_common_inlines_hh
+#define PPL_ppl_java_common_inlines_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace Java {
+
+template <typename U, typename V>
+U
+jtype_to_unsigned(const V& value) {
+  if (value < 0)
+    throw std::invalid_argument("not an unsigned integer.");
+
+  if (sizeof(U) < sizeof(V)) {
+    if (value > static_cast<V>(std::numeric_limits<U>::max()))
+      throw std::invalid_argument("unsigned integer out of range.");
+  }
+
+  return value;
+}
+
+template <typename T>
+inline void
+set_ptr(JNIEnv* env, jobject ppl_object,
+        const T* address, bool to_be_marked) {
+  const T* ptr = (to_be_marked ? mark(address) : address);
+  jlong pointer_value = reinterpret_cast<jlong>(ptr);
+  assert(reinterpret_cast<const T*>(pointer_value) == ptr);
+  env->SetLongField(ppl_object, cached_FMIDs.PPL_Object_ptr_ID, pointer_value);
+}
+
+inline void*
+get_ptr(JNIEnv* env, jobject ppl_object) {
+  jlong pointer_value
+    = env->GetLongField(ppl_object, cached_FMIDs.PPL_Object_ptr_ID);
+  void* ptr = reinterpret_cast<void*>(pointer_value);
+  assert(reinterpret_cast<jlong>(ptr) == pointer_value);
+  return unmark(ptr);
+}
+
+inline bool
+is_java_marked(JNIEnv* env, jobject ppl_object) {
+  jlong pointer_value
+    = env->GetLongField(ppl_object, cached_FMIDs.PPL_Object_ptr_ID);
+  const void* ptr = reinterpret_cast<const void*>(pointer_value);
+  assert(reinterpret_cast<jlong>(ptr) == pointer_value);
+  return marked(ptr);
+}
+
+inline void
+set_coefficient(JNIEnv* env, jobject dst, jobject src) {
+  jobject src_bi
+    = env->GetObjectField(src, cached_FMIDs.Coefficient_value_ID);
+  env->SetObjectField(dst, cached_FMIDs.Coefficient_value_ID, src_bi);
+}
+
+inline void
+set_by_reference(JNIEnv* env, jobject by_ref_dst, jobject src) {
+  env->SetObjectField(by_ref_dst,
+                      cached_FMIDs.By_Reference_obj_ID,
+                      src);
+}
+
+inline jobject
+get_by_reference(JNIEnv* env, jobject by_reference) {
+  return env->GetObjectField(by_reference, cached_FMIDs.By_Reference_obj_ID);
+}
+
+template <typename R>
+jobject
+build_linear_expression(JNIEnv* env, const R& r) {
+  jobject j_ret;
+  PPL_DIRTY_TEMP_COEFFICIENT(coefficient);
+  dimension_type varid = 0;
+  dimension_type space_dimension = r.space_dimension();
+  while (varid < space_dimension
+         && (coefficient = r.coefficient(Variable(varid))) == 0)
+    ++varid;
+  if (varid >= space_dimension) {
+    jobject j_coefficient_zero = build_java_coeff(env, Coefficient(0));
+    j_ret = env->NewObject(cached_classes.Linear_Expression_Coefficient,
+                           cached_FMIDs.Linear_Expression_Coefficient_init_ID,
+                           j_coefficient_zero);
+    CHECK_RESULT_THROW(env, j_ret);
+  }
+  else {
+    jmethodID coeff_var_init_ID
+      = cached_FMIDs.Linear_Expression_Times_init_from_coeff_var_ID;
+    jobject j_coefficient = build_java_coeff(env, coefficient);
+    jobject j_variable = build_java_variable(env, Variable(varid));
+    jclass j_le_times_class = cached_classes.Linear_Expression_Times;
+    jobject j_coeff_var = env->NewObject(j_le_times_class,
+                                         coeff_var_init_ID,
+                                         j_coefficient, j_variable);
+    CHECK_EXCEPTION_THROW(env);
+    j_ret = j_coeff_var;
+    while (true) {
+      ++varid;
+      while (varid < space_dimension
+             && (coefficient = r.coefficient(Variable(varid))) == 0)
+        ++varid;
+      if (varid >= space_dimension)
+        break;
+      else {
+        j_coefficient = build_java_coeff(env, coefficient);
+        j_variable = build_java_variable(env, Variable(varid));
+        j_coeff_var = env->NewObject(j_le_times_class,
+                                     coeff_var_init_ID,
+                                     j_coefficient, j_variable);
+        CHECK_EXCEPTION_THROW(env);
+        j_ret = env->CallObjectMethod(j_ret,
+                                      cached_FMIDs.Linear_Expression_sum_ID,
+                                      j_coeff_var);
+        CHECK_EXCEPTION_THROW(env);
+      }
+    }
+  }
+  return j_ret;
+}
+
+inline Variable
+build_cxx_variable(JNIEnv* env, jobject j_var) {
+  return Variable(env->GetIntField(j_var, cached_FMIDs.Variable_varid_ID));
+}
+
+inline jobject
+build_java_variable(JNIEnv* env, const Variable var) {
+  jobject ret = env->NewObject(cached_classes.Variable,
+                               cached_FMIDs.Variable_init_ID,
+                               var.id());
+  CHECK_RESULT_THROW(env, ret);
+  return ret;
+}
+
+inline Coefficient
+build_cxx_coeff(JNIEnv* env, jobject j_coeff) {
+  jstring bi_string
+    = (jstring) env->CallObjectMethod(j_coeff,
+                                      cached_FMIDs.Coefficient_toString_ID);
+  CHECK_EXCEPTION_THROW(env);
+  const char *nativeString = env->GetStringUTFChars(bi_string, 0);
+  CHECK_RESULT_THROW(env, nativeString);
+  PPL_DIRTY_TEMP_COEFFICIENT(ppl_coeff);
+  ppl_coeff = Coefficient(nativeString);
+  env->ReleaseStringUTFChars(bi_string, nativeString);
+  return ppl_coeff;
+}
+
+inline jobject
+build_java_coeff(JNIEnv* env, const Coefficient& ppl_coeff) {
+  std::ostringstream s;
+  s << ppl_coeff;
+  std::string str = s.str();
+  jstring coeff_string = env->NewStringUTF(str.c_str());
+  CHECK_RESULT_THROW(env, coeff_string);
+  jobject ret = env->NewObject(cached_classes.Coefficient,
+                               cached_FMIDs.Coefficient_init_from_String_ID,
+                               coeff_string);
+  CHECK_RESULT_THROW(env, ret);
+  return ret;
+}
+
+template <typename System, typename Elem_Builder>
+System
+build_cxx_system(JNIEnv* env, jobject j_iterable, Elem_Builder build_cxx_elem) {
+  // Get the iterator.
+  jobject j_iter
+    = env->CallObjectMethod(j_iterable, cached_FMIDs.System_iterator_ID);
+  CHECK_EXCEPTION_THROW(env);
+  // Get the iterator method IDs.
+  jmethodID has_next_mID = cached_FMIDs.System_Iterator_has_next_ID;
+  jmethodID next_mID = cached_FMIDs.System_Iterator_next_ID;
+  // Initialize an empty system.
+  System cxx_sys;
+  jobject j_element;
+  jboolean has_next_value = env->CallBooleanMethod(j_iter, has_next_mID);
+  CHECK_EXCEPTION_ASSERT(env);
+  while (has_next_value) {
+    j_element = env->CallObjectMethod(j_iter, next_mID);
+    CHECK_EXCEPTION_ASSERT(env);
+    cxx_sys.insert(build_cxx_elem(env, j_element));
+    has_next_value = env->CallBooleanMethod(j_iter, has_next_mID);
+    CHECK_EXCEPTION_ASSERT(env);
+  }
+  return cxx_sys;
+}
+
+inline Congruence_System
+build_cxx_congruence_system(JNIEnv* env, jobject j_iterable) {
+  return
+    build_cxx_system<Congruence_System>(env, j_iterable, build_cxx_congruence);
+}
+
+inline Constraint_System
+build_cxx_constraint_system(JNIEnv* env, jobject j_iterable) {
+  return
+    build_cxx_system<Constraint_System>(env, j_iterable, build_cxx_constraint);
+}
+
+inline Generator_System
+build_cxx_generator_system(JNIEnv* env, jobject j_iterable) {
+  return
+    build_cxx_system<Generator_System>(env, j_iterable, build_cxx_generator);
+}
+
+inline Grid_Generator_System
+build_cxx_grid_generator_system(JNIEnv* env, jobject j_iterable) {
+  return build_cxx_system<Grid_Generator_System> (env, j_iterable,
+                                                  build_cxx_grid_generator);
+}
+
+} // namespace Java
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_ppl_java_common_inlines_hh)
diff --git a/interfaces/Java/jni/ppl_java_globals.cc b/interfaces/Java/jni/ppl_java_globals.cc
index 47b679a..7ee4ce7 100644
--- a/interfaces/Java/jni/ppl_java_globals.cc
+++ b/interfaces/Java/jni/ppl_java_globals.cc
@@ -1,6 +1,6 @@
 /* PPL Java interface: domain-independent functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -21,7 +21,7 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-#include "ppl_java_common.defs.hh"
+#include "ppl_java_common_defs.hh"
 #include "parma_polyhedra_library_Artificial_Parameter.h"
 #include "parma_polyhedra_library_Artificial_Parameter_Sequence.h"
 #include "parma_polyhedra_library_Bounded_Integer_Type_Overflow.h"
@@ -388,7 +388,7 @@ Java_parma_1polyhedra_1library_Linear_1Expression_1Coefficient_initIDs
   cached_FMIDs.Linear_Expression_Coefficient_coeff_ID = fID;
   jmethodID mID;
   mID = env->GetMethodID(j_le_coeff_class, "<init>",
-			 "(Lparma_polyhedra_library/Coefficient;)V");
+                         "(Lparma_polyhedra_library/Coefficient;)V");
   CHECK_RESULT_ASSERT(env, mID);
   cached_FMIDs.Linear_Expression_Coefficient_init_ID = mID;
 }
@@ -456,10 +456,10 @@ Java_parma_1polyhedra_1library_Linear_1Expression_1Variable_initIDs
 (JNIEnv* env, jclass j_le_var_class) {
   jmethodID mID;
   mID = env->GetMethodID(j_le_var_class, "<init>",
-			 "(Lparma_polyhedra_library/Variable;)V");
+                         "(Lparma_polyhedra_library/Variable;)V");
   CHECK_RESULT_ASSERT(env, mID);
   cached_FMIDs.Linear_Expression_Variable_init_ID = mID;
-  mID = env->GetMethodID(j_le_var_class, "var_id", "()I");
+  mID = env->GetMethodID(j_le_var_class, "var_id", "()J");
   CHECK_RESULT_ASSERT(env, mID);
   cached_FMIDs.Linear_Expression_Variable_var_id_ID = mID;
 }
@@ -675,10 +675,14 @@ Java_parma_1polyhedra_1library_Bounded_1Integer_1Type_1Width_initIDs
 JNIEXPORT void JNICALL
 Java_parma_1polyhedra_1library_Variable_initIDs
 (JNIEnv* env, jclass j_variable_class) {
-  jfieldID fID = env->GetFieldID(j_variable_class, "varid", "I");
+  jfieldID fID = env->GetFieldID(j_variable_class, "varid", "J");
   CHECK_RESULT_ASSERT(env, fID);
   cached_FMIDs.Variable_varid_ID = fID;
-  jmethodID mID = env->GetMethodID(j_variable_class, "<init>", "(I)V");
+  fID = env->GetStaticFieldID(j_variable_class, "stringifier",
+                              "Lparma_polyhedra_library/Variable_Stringifier;");
+  CHECK_RESULT_ASSERT(env, fID);
+  cached_FMIDs.Variable_stringifier_ID = fID;
+  jmethodID mID = env->GetMethodID(j_variable_class, "<init>", "(J)V");
   CHECK_RESULT_ASSERT(env, mID);
   cached_FMIDs.Variable_init_ID = mID;
 }
@@ -966,7 +970,7 @@ Java_parma_1polyhedra_1library_MIP_1Problem_constraints
     MIP_Problem* mip
       = reinterpret_cast<MIP_Problem*>(get_ptr(env, j_this_mip_problem));
     for (MIP_Problem::const_iterator cs_it = mip->constraints_begin(),
-	   cs_end = mip->constraints_end(); cs_it != cs_end; ++cs_it) {
+           cs_end = mip->constraints_end(); cs_it != cs_end; ++cs_it) {
       jobject j_constraint = build_java_constraint(env, *cs_it);
       env->CallBooleanMethod(j_cs,
                              cached_FMIDs.Constraint_System_add_ID,
@@ -1252,6 +1256,44 @@ Java_parma_1polyhedra_1library_MIP_1Problem_ascii_1dump
 }
 
 JNIEXPORT jstring JNICALL
+Java_parma_1polyhedra_1library_Variable_toString
+(JNIEnv* env, jobject j_this) {
+  using namespace Parma_Polyhedra_Library::IO_Operators;
+  Variable ppl_var = build_cxx_variable(env, j_this);
+  std::ostringstream s;
+  s << ppl_var;
+  return env->NewStringUTF(s.str().c_str());
+}
+
+JNIEXPORT void JNICALL
+Java_parma_1polyhedra_1library_Variable_setStringifier
+(JNIEnv* env, jclass j_variable_class, jobject j_stringifier) {
+  // Store j_stringifier in the corresponding static field.
+  env->SetStaticObjectField(j_variable_class,
+                            cached_FMIDs.Variable_stringifier_ID,
+                            j_stringifier);
+  if (j_stringifier == NULL) {
+    // No stringifier object: reset cache values.
+    cached_classes.Variable_Stringifier = NULL;
+    cached_FMIDs.Variable_Stringifier_stringify_ID = NULL;
+    // Reset default C++ output function.
+    Variable::set_output_function(&Variable::default_output_function);
+  }
+  else {
+    // Update cache with values computed for concrete class.
+    jclass vs_class = env->GetObjectClass(j_stringifier);
+    CHECK_RESULT_ASSERT(env, vs_class);
+    cached_classes.Variable_Stringifier = vs_class;
+    jmethodID mID = env->GetMethodID(vs_class, "stringify",
+                                     "(J)Ljava/lang/String;");
+    CHECK_RESULT_ASSERT(env, mID);
+    cached_FMIDs.Variable_Stringifier_stringify_ID = mID;
+    // Set C++ output function to the Java wrapper.
+    Variable::set_output_function(&Java_Variable_output_function);
+  }
+}
+
+JNIEXPORT jstring JNICALL
 Java_parma_1polyhedra_1library_Linear_1Expression_toString
 (JNIEnv* env, jobject j_this) {
   using namespace Parma_Polyhedra_Library::IO_Operators;
diff --git a/interfaces/Java/parma_polyhedra_library/Artificial_Parameter.java b/interfaces/Java/parma_polyhedra_library/Artificial_Parameter.java
index a76585c..2fb8b28 100644
--- a/interfaces/Java/parma_polyhedra_library/Artificial_Parameter.java
+++ b/interfaces/Java/parma_polyhedra_library/Artificial_Parameter.java
@@ -1,6 +1,6 @@
 /* Artificial_Parameter Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,9 +24,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 /*!
   An Artificial_Parameter object represents the result
   of the integer division of a Linear_Expression (on the other
@@ -59,22 +56,22 @@ public class Artificial_Parameter {
       and a denominator.
     */
     public Artificial_Parameter(Linear_Expression e, Coefficient d) {
-	le = e.clone();
-	den = new Coefficient(d);
+        le = e.clone();
+        den = new Coefficient(d);
     }
 
     /*! \brief
       Returns the linear expression in artificial parameter \p this.
     */
     public Linear_Expression linear_expression() {
-	return le;
+        return le;
     }
 
     /*! \brief
       Returns the denominator in artificial parameter \p this.
     */
     public Coefficient denominator() {
-	return den;
+        return den;
     }
 
     //! Returns an ascii formatted internal representation of \p this.
diff --git a/interfaces/Java/parma_polyhedra_library/Artificial_Parameter_Sequence.java b/interfaces/Java/parma_polyhedra_library/Artificial_Parameter_Sequence.java
index 94c2768..ec8dca6 100644
--- a/interfaces/Java/parma_polyhedra_library/Artificial_Parameter_Sequence.java
+++ b/interfaces/Java/parma_polyhedra_library/Artificial_Parameter_Sequence.java
@@ -1,6 +1,6 @@
 /* Artificial_Parameter_Sequence Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,16 +23,13 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A sequence of artificial parameters.
 /*! \ingroup PPL_Java_interface
     An object of the class Artificial_Parameter_Sequence is a
     sequence of artificial parameters.
 */
 public class Artificial_Parameter_Sequence
-  extends java.util.Vector<Artificial_Parameter> {
+  extends java.util.ArrayList<Artificial_Parameter> {
 
     //! Default constructor: builds an empty sequence of artificial parameters.
     public Artificial_Parameter_Sequence() {
diff --git a/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Overflow.java b/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Overflow.java
index 75c24cb..40fd8f1 100644
--- a/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Overflow.java
+++ b/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Overflow.java
@@ -1,6 +1,6 @@
 /* Bounded_Integer_Type_Overflow enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Representation.java b/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Representation.java
index 9b63758..16a37b8 100644
--- a/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Representation.java
+++ b/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Representation.java
@@ -1,6 +1,6 @@
 /* Bounded_Integer_Type_Representation enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Width.java b/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Width.java
index 37dd4f5..3587f3f 100644
--- a/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Width.java
+++ b/interfaces/Java/parma_polyhedra_library/Bounded_Integer_Type_Width.java
@@ -1,6 +1,6 @@
 /* Bounded_Integer_Type_Width enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/By_Reference.java b/interfaces/Java/parma_polyhedra_library/By_Reference.java
index 22e9347..0390b6b 100644
--- a/interfaces/Java/parma_polyhedra_library/By_Reference.java
+++ b/interfaces/Java/parma_polyhedra_library/By_Reference.java
@@ -1,6 +1,6 @@
 /* By_Reference Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -31,17 +31,17 @@ public class By_Reference<T> {
 
     //! Builds an object encapsulating \p object_value.
     public By_Reference(T object_value) {
-	obj = object_value;
+        obj = object_value;
     }
 
     //! Set an object to value \p object_value.
     public void set(T y) {
-	obj = y;
+        obj = y;
     }
 
     //! Returns the value held by \p this.
     public T get() {
-	return obj;
+        return obj;
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Coefficient.java b/interfaces/Java/parma_polyhedra_library/Coefficient.java
index 82ae8b5..34a3f4b 100644
--- a/interfaces/Java/parma_polyhedra_library/Coefficient.java
+++ b/interfaces/Java/parma_polyhedra_library/Coefficient.java
@@ -1,6 +1,6 @@
 /* Coefficient Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -43,12 +43,12 @@ public class Coefficient {
 
     //! Builds a coefficient valued \p l.
     public Coefficient(long l) {
-	value = BigInteger.valueOf(l);
+        value = BigInteger.valueOf(l);
     }
 
     //! Builds a coefficient valued \p bi.
     public Coefficient(BigInteger bi) {
-	value = bi;
+        value = bi;
     }
 
     //! Builds a coefficient from the decimal representation in \p s.
@@ -57,22 +57,22 @@ public class Coefficient {
       Thrown if \p s does not contain a valid decimal representation.
     */
     public Coefficient(String s) {
-	value = new BigInteger(s);
+        value = new BigInteger(s);
     }
 
     //! Builds a copy of \p c.
     public Coefficient(Coefficient c) {
-	value = c.value;
+        value = c.value;
     }
 
     //! Returns a String representation of \p this.
     public String toString() {
-	return value.toString();
+        return value.toString();
     }
 
     //! Returns the value held by \p this.
     public BigInteger getBigInteger() {
-	return value;
+        return value;
     }
 
     //! Returns the number of bits of PPL coefficients; 0 if unbounded.
diff --git a/interfaces/Java/parma_polyhedra_library/Complexity_Class.java b/interfaces/Java/parma_polyhedra_library/Complexity_Class.java
index ee8e62c..406497d 100644
--- a/interfaces/Java/parma_polyhedra_library/Complexity_Class.java
+++ b/interfaces/Java/parma_polyhedra_library/Complexity_Class.java
@@ -1,6 +1,6 @@
 /* Complexity_Class enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Congruence.java b/interfaces/Java/parma_polyhedra_library/Congruence.java
index 0c9d201..35a29bc 100644
--- a/interfaces/Java/parma_polyhedra_library/Congruence.java
+++ b/interfaces/Java/parma_polyhedra_library/Congruence.java
@@ -1,6 +1,6 @@
 /* Congruence Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,9 +23,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A linear congruence.
 /*! \ingroup PPL_Java_interface
   An object of the class Congruence is an object represeting a congruence:
@@ -55,25 +52,25 @@ public class Congruence {
       \f$\mathtt{e1} = \mathtt{e2} \pmod{\mathtt{m}}\f$.
     */
     public Congruence(Linear_Expression e1, Linear_Expression e2,
-		      Coefficient m) {
-	mod = new Coefficient(m);
-	lhs = e1.clone();
-	rhs = e2.clone();
+                      Coefficient m) {
+        mod = new Coefficient(m);
+        lhs = e1.clone();
+        rhs = e2.clone();
     }
 
     //! Returns the left hand side of \p this.
     public Linear_Expression left_hand_side() {
-	return lhs;
+        return lhs;
     }
 
     //! Returns the right hand side of \p this.
     public Linear_Expression right_hand_side() {
-	return rhs;
+        return rhs;
     }
 
     //! Returns the relation symbol of \p this.
     public Coefficient modulus() {
-	return mod;
+        return mod;
     }
 
     //! Returns an ascii formatted internal representation of \p this.
diff --git a/interfaces/Java/parma_polyhedra_library/Congruence_System.java b/interfaces/Java/parma_polyhedra_library/Congruence_System.java
index e69150f..f7f43be 100644
--- a/interfaces/Java/parma_polyhedra_library/Congruence_System.java
+++ b/interfaces/Java/parma_polyhedra_library/Congruence_System.java
@@ -1,6 +1,6 @@
 /* Congruence_System Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,15 +23,12 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A system of congruences.
 /*! \ingroup PPL_Java_interface
     An object of the class Congruence_System is a system of congruences,
     i.e., a multiset of objects of the class Congruence.
 */
-public class Congruence_System extends java.util.Vector<Congruence> {
+public class Congruence_System extends java.util.ArrayList<Congruence> {
     //! Default constructor: builds an empty system of congruences.
     public Congruence_System() {
     }
diff --git a/interfaces/Java/parma_polyhedra_library/Constraint.java b/interfaces/Java/parma_polyhedra_library/Constraint.java
index d0f3105..d1862ee 100644
--- a/interfaces/Java/parma_polyhedra_library/Constraint.java
+++ b/interfaces/Java/parma_polyhedra_library/Constraint.java
@@ -1,6 +1,6 @@
 /* Constraint Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,9 +23,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A linear equality or inequality.
 /*! \ingroup PPL_Java_interface
   An object of the class Constraint is either:
@@ -50,24 +47,24 @@ public class Constraint {
     */
     public Constraint(Linear_Expression le1, Relation_Symbol rel_sym,
                       Linear_Expression le2) {
-	lhs = le1.clone();
-	rhs = le2.clone();
-	kind = rel_sym;
+        lhs = le1.clone();
+        rhs = le2.clone();
+        kind = rel_sym;
     }
 
     //! Returns the left hand side of \p this.
     public Linear_Expression left_hand_side() {
-	return lhs;
+        return lhs;
     }
 
     //! Returns the right hand side of \p this.
     public Linear_Expression right_hand_side() {
-	return rhs;
+        return rhs;
     }
 
     //! Returns the relation symbol of \p this.
     public Relation_Symbol kind() {
-	return kind;
+        return kind;
     }
 
     //! Returns an ascii formatted internal representation of \p this.
diff --git a/interfaces/Java/parma_polyhedra_library/Constraint_System.java b/interfaces/Java/parma_polyhedra_library/Constraint_System.java
index c4376e0..cff9954 100644
--- a/interfaces/Java/parma_polyhedra_library/Constraint_System.java
+++ b/interfaces/Java/parma_polyhedra_library/Constraint_System.java
@@ -1,6 +1,6 @@
 /* Constraint_System Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,15 +23,12 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A system of constraints.
 /*! \ingroup PPL_Java_interface
     An object of the class Constraint_System is a system of constraints,
     i.e., a multiset of objects of the class Constraint.
 */
-public class Constraint_System extends java.util.Vector<Constraint> {
+public class Constraint_System extends java.util.ArrayList<Constraint> {
 
     //! Default constructor: builds an empty system of constraints.
     public Constraint_System() {
diff --git a/interfaces/Java/parma_polyhedra_library/Control_Parameter_Name.java b/interfaces/Java/parma_polyhedra_library/Control_Parameter_Name.java
index 32af5dc..dcf0aad 100644
--- a/interfaces/Java/parma_polyhedra_library/Control_Parameter_Name.java
+++ b/interfaces/Java/parma_polyhedra_library/Control_Parameter_Name.java
@@ -1,6 +1,6 @@
 /* MIP_Problem Control_Parameter_Name enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Control_Parameter_Value.java b/interfaces/Java/parma_polyhedra_library/Control_Parameter_Value.java
index ce406bc..da1ffb3 100644
--- a/interfaces/Java/parma_polyhedra_library/Control_Parameter_Value.java
+++ b/interfaces/Java/parma_polyhedra_library/Control_Parameter_Value.java
@@ -1,6 +1,6 @@
 /* MIP_Problem's Control_Parameter_Value enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Degenerate_Element.java b/interfaces/Java/parma_polyhedra_library/Degenerate_Element.java
index 333a43d..5d0da10 100644
--- a/interfaces/Java/parma_polyhedra_library/Degenerate_Element.java
+++ b/interfaces/Java/parma_polyhedra_library/Degenerate_Element.java
@@ -1,6 +1,6 @@
 /* Degenerate_Element enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Domain_Error_Exception.java b/interfaces/Java/parma_polyhedra_library/Domain_Error_Exception.java
index ace6a27..8d07af3 100644
--- a/interfaces/Java/parma_polyhedra_library/Domain_Error_Exception.java
+++ b/interfaces/Java/parma_polyhedra_library/Domain_Error_Exception.java
@@ -1,6 +1,6 @@
 /* Domain_Error_Exception Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Fake_Class_for_Doxygen.java b/interfaces/Java/parma_polyhedra_library/Fake_Class_for_Doxygen.java
index 38db0b1..87dd72d 100644
--- a/interfaces/Java/parma_polyhedra_library/Fake_Class_for_Doxygen.java
+++ b/interfaces/Java/parma_polyhedra_library/Fake_Class_for_Doxygen.java
@@ -1,6 +1,6 @@
 /* Doxumentation for the Java interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -145,8 +145,8 @@ public class Polyhedron extends PPL_Object {
       and \p maximum are left untouched.
     */
     public native boolean maximize(Linear_Expression expr,
-				   Coefficient sup_n, Coefficient sup_d,
-				   By_Reference<Boolean> maximum);
+                                   Coefficient sup_n, Coefficient sup_d,
+                                   By_Reference<Boolean> maximum);
 
     /*! \brief
       Returns \c true if and only if \p this is not empty
@@ -173,8 +173,8 @@ public class Polyhedron extends PPL_Object {
       and \p minimum are left untouched.
     */
     public native boolean minimize(Linear_Expression expr,
-				   Coefficient inf_n, Coefficient inf_d,
-				   By_Reference<Boolean> minimum);
+                                   Coefficient inf_n, Coefficient inf_d,
+                                   By_Reference<Boolean> minimum);
 
     /*! \brief
       Returns \c true if and only if \p this is not empty
@@ -205,9 +205,9 @@ public class Polyhedron extends PPL_Object {
       and \p g are left untouched.
     */
     public native boolean maximize(Linear_Expression expr,
-				   Coefficient sup_n, Coefficient sup_d,
-				   By_Reference<Boolean> maximum,
-				   Generator g);
+                                   Coefficient sup_n, Coefficient sup_d,
+                                   By_Reference<Boolean> maximum,
+                                   Generator g);
 
     /*! \brief
       Returns \c true if and only if \p this is not empty
@@ -238,9 +238,9 @@ public class Polyhedron extends PPL_Object {
       and \p g are left untouched.
     */
     public native boolean minimize(Linear_Expression expr,
-				   Coefficient inf_n, Coefficient inf_d,
-				   By_Reference<Boolean> minimum,
-				   Generator g);
+                                   Coefficient inf_n, Coefficient inf_d,
+                                   By_Reference<Boolean> minimum,
+                                   Generator g);
 
     /*! \brief
       Returns the relations holding between the polyhedron \p this
@@ -499,7 +499,7 @@ public class Polyhedron extends PPL_Object {
       \p this.
     */
     public native void affine_image(Variable var, Linear_Expression expr,
-				    Coefficient denominator);
+                                    Coefficient denominator);
 
     /*! \brief
       Assigns to \p this the
@@ -551,9 +551,9 @@ public class Polyhedron extends PPL_Object {
       dimension of \p this.
     */
     public native void bounded_affine_image(Variable var,
-					    Linear_Expression lb_expr,
-					    Linear_Expression ub_expr,
-					    Coefficient denominator);
+                                            Linear_Expression lb_expr,
+                                            Linear_Expression ub_expr,
+                                            Coefficient denominator);
 
     /*! \brief
       Assigns to \p this the preimage of \p this with respect to the
@@ -814,7 +814,7 @@ public class Polyhedron extends PPL_Object {
       \p this.
     */
     public native void remove_higher_space_dimensions(long
-						      new_dimension);
+                                                      new_dimension);
 
     //! Creates \p m copies of the space dimension corresponding to \p var.
     /*!
@@ -849,7 +849,7 @@ public class Polyhedron extends PPL_Object {
       Also thrown if \p dest is contained in \p vars.
     */
     public native void fold_space_dimensions(Variables_Set vars,
-					     Variable dest);
+                                             Variable dest);
 
     /*! \brief
       Remaps the dimensions of the vector space according to
@@ -966,9 +966,9 @@ public class Polyhedron extends PPL_Object {
       dimension-incompatible.
     */
     public native
-	void limited_BHRZ03_extrapolation_assign(Polyhedron y,
-						 Constraint_System cs,
-						 By_Reference<Integer> tp);
+        void limited_BHRZ03_extrapolation_assign(Polyhedron y,
+                                                 Constraint_System cs,
+                                                 By_Reference<Integer> tp);
 
     /*! \brief
       Improves the result of the \extref{H79_widening, H79-widening}
@@ -991,7 +991,7 @@ public class Polyhedron extends PPL_Object {
       dimension-incompatible.
     */
     public native
-	void limited_H79_extrapolation_assign(Polyhedron y,
+        void limited_H79_extrapolation_assign(Polyhedron y,
                                               Constraint_System cs,
                                               By_Reference<Integer> tp);
 
@@ -1018,9 +1018,9 @@ public class Polyhedron extends PPL_Object {
       dimension-incompatible.
     */
     public native
-	void bounded_BHRZ03_extrapolation_assign(Polyhedron y,
-						 Constraint_System cs,
-						 By_Reference<Integer> tp);
+        void bounded_BHRZ03_extrapolation_assign(Polyhedron y,
+                                                 Constraint_System cs,
+                                                 By_Reference<Integer> tp);
 
     /*! \brief
       Improves the result of the \extref{H79_widening, H79-widening}
@@ -1045,7 +1045,7 @@ public class Polyhedron extends PPL_Object {
       dimension-incompatible.
     */
     public native
-	void bounded_H79_extrapolation_assign(Polyhedron y,
+        void bounded_H79_extrapolation_assign(Polyhedron y,
                                               Constraint_System cs,
                                               By_Reference<Integer> tp);
 
diff --git a/interfaces/Java/parma_polyhedra_library/Generator.java b/interfaces/Java/parma_polyhedra_library/Generator.java
index 468b959..6001ad7 100644
--- a/interfaces/Java/parma_polyhedra_library/Generator.java
+++ b/interfaces/Java/parma_polyhedra_library/Generator.java
@@ -1,6 +1,6 @@
 /* Generator Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,10 +23,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
-import java.util.*;
 import javax.management.RuntimeErrorException;
 
 //! A line, ray, point or closure point.
@@ -52,7 +48,7 @@ public class Generator {
       stealing the coefficients from \p e.
     */
     private Generator(Linear_Expression e, Generator_Type g_type) {
-	le = e.clone();
+        le = e.clone();
         gt = g_type;
     }
 
@@ -65,7 +61,7 @@ public class Generator {
         if (d.getBigInteger().equals(java.math.BigInteger.ZERO)) {
             Error cause = new Error("parma_polyhedra_library.Generator::"
                                     + "Generator(e, d):\n"
-				    + "the divisor can not be zero.");
+                                    + "the divisor can not be zero.");
             throw new RuntimeErrorException(cause);
         }
         Generator g = new Generator(e, Generator_Type.CLOSURE_POINT);
@@ -90,9 +86,9 @@ public class Generator {
     */
     public static Generator point(Linear_Expression e, Coefficient d) {
         if (d.getBigInteger().equals(java.math.BigInteger.ZERO)) {
-	    Error cause = new Error("parma_polyhedra_library.Generator::"
+            Error cause = new Error("parma_polyhedra_library.Generator::"
                                     + "Generator(e, d):\n"
-				    + "the divisor can not be zero.");
+                                    + "the divisor can not be zero.");
             throw new RuntimeErrorException(cause);
         }
 
@@ -128,12 +124,12 @@ public class Generator {
     */
     public Coefficient divisor() {
         if (this.gt == Generator_Type.POINT
-	    || this.gt == Generator_Type.CLOSURE_POINT)
-	    return div;
-	Error cause = new Error("parma_polyhedra_library.Generator::divisor:\n"
-				+ "this is neither a point"
-				+ " nor a closure point.");
-	throw new RuntimeErrorException(cause);
+            || this.gt == Generator_Type.CLOSURE_POINT)
+            return div;
+        Error cause = new Error("parma_polyhedra_library.Generator::divisor:\n"
+                                + "this is neither a point"
+                                + " nor a closure point.");
+        throw new RuntimeErrorException(cause);
     }
 
     //! Returns an ascii formatted internal representation of \p this.
diff --git a/interfaces/Java/parma_polyhedra_library/Generator_System.java b/interfaces/Java/parma_polyhedra_library/Generator_System.java
index 9f59757..7175f2d 100644
--- a/interfaces/Java/parma_polyhedra_library/Generator_System.java
+++ b/interfaces/Java/parma_polyhedra_library/Generator_System.java
@@ -1,6 +1,6 @@
 /* Generator_System Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,16 +23,13 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A system of generators.
 /*! \ingroup PPL_Java_interface
     An object of the class Generator_System is a system of generators,
     i.e., a multiset of objects of the class Generator
     (lines, rays, points and closure points).
 */
-public class Generator_System extends java.util.Vector<Generator> {
+public class Generator_System extends java.util.ArrayList<Generator> {
 
     //! Default constructor: builds an empty system of generators.
     public Generator_System() {
diff --git a/interfaces/Java/parma_polyhedra_library/Generator_Type.java b/interfaces/Java/parma_polyhedra_library/Generator_Type.java
index fcf1786..7e2342d 100644
--- a/interfaces/Java/parma_polyhedra_library/Generator_Type.java
+++ b/interfaces/Java/parma_polyhedra_library/Generator_Type.java
@@ -1,6 +1,6 @@
 /* Generator_Type enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Grid_Generator.java b/interfaces/Java/parma_polyhedra_library/Grid_Generator.java
index d02b5c1..3caad9e 100644
--- a/interfaces/Java/parma_polyhedra_library/Grid_Generator.java
+++ b/interfaces/Java/parma_polyhedra_library/Grid_Generator.java
@@ -1,6 +1,6 @@
 /* Grid Generator Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,8 +23,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
 import javax.management.RuntimeErrorException;
 
 //! A grid line, parameter or grid point.
@@ -49,10 +47,10 @@ public class Grid_Generator {
     private Coefficient div;
 
     private Grid_Generator(Linear_Expression e, Coefficient d,
-			   Grid_Generator_Type generator_type) {
-	le = e.clone();
-	div = new Coefficient(d);
-	gt = generator_type;
+                           Grid_Generator_Type generator_type) {
+        le = e.clone();
+        div = new Coefficient(d);
+        gt = generator_type;
     }
 
     //! Returns the line of direction \p e.
@@ -62,8 +60,8 @@ public class Grid_Generator {
       the vector space.
     */
     public static Grid_Generator grid_line(Linear_Expression e) {
-	return new Grid_Generator(e, new Coefficient(0),
-				  Grid_Generator_Type.LINE);
+        return new Grid_Generator(e, new Coefficient(0),
+                                  Grid_Generator_Type.LINE);
     }
 
     //! Returns the parameter at \p e / \p d.
@@ -72,8 +70,8 @@ public class Grid_Generator {
       Thrown if \p d is zero.
     */
     public static Grid_Generator parameter(Linear_Expression e,
-					   Coefficient d) {
-	return new Grid_Generator(e, d, Grid_Generator_Type.PARAMETER);
+                                           Coefficient d) {
+        return new Grid_Generator(e, d, Grid_Generator_Type.PARAMETER);
     }
 
     //! Returns the point at \p e / \p d.
@@ -82,8 +80,8 @@ public class Grid_Generator {
       Thrown if \p d is zero.
     */
     public static Grid_Generator grid_point(Linear_Expression e,
-					    Coefficient d) {
-	return new Grid_Generator(e, d, Grid_Generator_Type.POINT);
+                                            Coefficient d) {
+        return new Grid_Generator(e, d, Grid_Generator_Type.POINT);
     }
 
     //! Returns the generator type.
@@ -103,12 +101,12 @@ public class Grid_Generator {
     */
     public Coefficient divisor() {
         if (this.gt != Grid_Generator_Type.LINE)
-	    return div;
-	Error cause = new Error("parma_polyhedra_library."
+            return div;
+        Error cause = new Error("parma_polyhedra_library."
                                 + "Grid_Generator::divisor:\n"
-				+ "this is neither a grid point"
-				+ " nor a parameter.");
-	throw new RuntimeErrorException(cause);
+                                + "this is neither a grid point"
+                                + " nor a parameter.");
+        throw new RuntimeErrorException(cause);
     }
 
     //! Returns an ascii formatted internal representation of \p this.
diff --git a/interfaces/Java/parma_polyhedra_library/Grid_Generator_System.java b/interfaces/Java/parma_polyhedra_library/Grid_Generator_System.java
index 128209a..d9cb51f 100644
--- a/interfaces/Java/parma_polyhedra_library/Grid_Generator_System.java
+++ b/interfaces/Java/parma_polyhedra_library/Grid_Generator_System.java
@@ -1,6 +1,6 @@
 /* Grid Generator_System Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,15 +24,13 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A system of grid generators.
 /*! \ingroup PPL_Java_interface
     An object of the class Grid_Generator_System is a system of grid
     generators, i.e., a multiset of objects of the class Grid_Generator.
 */
-public class Grid_Generator_System extends java.util.Vector<Grid_Generator> {
+public class Grid_Generator_System
+    extends java.util.ArrayList<Grid_Generator> {
 
     //! Default constructor: builds an empty system of grid generators.
     public Grid_Generator_System() {
diff --git a/interfaces/Java/parma_polyhedra_library/Grid_Generator_Type.java b/interfaces/Java/parma_polyhedra_library/Grid_Generator_Type.java
index 045bbd6..2efdca2 100644
--- a/interfaces/Java/parma_polyhedra_library/Grid_Generator_Type.java
+++ b/interfaces/Java/parma_polyhedra_library/Grid_Generator_Type.java
@@ -1,6 +1,6 @@
 /* Grid_Generator_Type enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/IO.java b/interfaces/Java/parma_polyhedra_library/IO.java
index 06e32b8..12b868b 100644
--- a/interfaces/Java/parma_polyhedra_library/IO.java
+++ b/interfaces/Java/parma_polyhedra_library/IO.java
@@ -1,6 +1,6 @@
 /* IO Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -44,5 +44,5 @@ public class IO {
       The wrapped string.
     */
     public static native String wrap_string(String str, int indent_depth,
-					    int preferred_first_line_length, int preferred_line_length);
+                                            int preferred_first_line_length, int preferred_line_length);
 }
diff --git a/interfaces/Java/parma_polyhedra_library/Invalid_Argument_Exception.java b/interfaces/Java/parma_polyhedra_library/Invalid_Argument_Exception.java
index 2ae39c4..abc803a 100644
--- a/interfaces/Java/parma_polyhedra_library/Invalid_Argument_Exception.java
+++ b/interfaces/Java/parma_polyhedra_library/Invalid_Argument_Exception.java
@@ -1,6 +1,6 @@
 /* Invalid_Argument_Exception Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Length_Error_Exception.java b/interfaces/Java/parma_polyhedra_library/Length_Error_Exception.java
index e0a8033..85170da 100644
--- a/interfaces/Java/parma_polyhedra_library/Length_Error_Exception.java
+++ b/interfaces/Java/parma_polyhedra_library/Length_Error_Exception.java
@@ -1,6 +1,6 @@
 /* Length_Error_Exception Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression.java
index cddd765..4f224cd 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression.java
@@ -1,6 +1,6 @@
 /* Linear_Expression Java declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,9 +23,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A linear expression.
 /*! \ingroup PPL_Java_interface
   An object of the class Linear_Expression represents a linear expression
@@ -37,22 +34,22 @@ public abstract class Linear_Expression implements Cloneable {
 
     //! Returns the sum of \p this and \p y.
     public Linear_Expression sum(Linear_Expression y) {
-	return new Linear_Expression_Sum(this, y);
+        return new Linear_Expression_Sum(this, y);
     }
 
     //! Returns the difference of \p this and \p y.
     public Linear_Expression subtract(Linear_Expression y) {
-	return new Linear_Expression_Difference(this, y);
+        return new Linear_Expression_Difference(this, y);
     }
 
     //! Returns the product of \p this times \p c.
     public Linear_Expression times(Coefficient c) {
-	return new Linear_Expression_Times(this, c);
+        return new Linear_Expression_Times(this, c);
     }
 
     //! Returns the negation of \p this.
     public Linear_Expression unary_minus() {
-	return new Linear_Expression_Unary_Minus(this);
+        return new Linear_Expression_Unary_Minus(this);
     }
 
     //! Returns a copy of the linear expression.
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Coefficient.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Coefficient.java
index bb18da8..aa0f9f5 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Coefficient.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Coefficient.java
@@ -1,6 +1,6 @@
 /* Linear_Expression_Coefficient class definition and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -33,17 +33,17 @@ public class Linear_Expression_Coefficient
 
     //! Builds the object corresponding to a copy of the coefficient \p c.
     public Linear_Expression_Coefficient(Coefficient c) {
-	coeff = new Coefficient(c);
+        coeff = new Coefficient(c);
     }
 
     //! Returns coefficient representing the linear expression.
     public Coefficient argument() {
-	return coeff;
+        return coeff;
     }
 
     //! Builds a copy of this.
     public Linear_Expression_Coefficient clone() {
-	return new Linear_Expression_Coefficient(coeff);
+        return new Linear_Expression_Coefficient(coeff);
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Difference.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Difference.java
index e30c4b2..614bb02 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Difference.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Difference.java
@@ -1,6 +1,6 @@
 /* Linear_Expression_Difference class definition and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -39,24 +39,24 @@ public class Linear_Expression_Difference
       \p y.
     */
     public Linear_Expression_Difference(Linear_Expression x,
-					Linear_Expression y) {
+                                        Linear_Expression y) {
         lhs = x.clone();
         rhs = y.clone();
     }
 
     //! Returns the left hand side of \p this.
     public Linear_Expression left_hand_side() {
-	return lhs;
+        return lhs;
     }
 
     //! Returns the left hand side of \p this.
     public Linear_Expression right_hand_side() {
-	return rhs;
+        return rhs;
     }
 
     //! Builds a copy of this.
     public Linear_Expression_Difference clone() {
-	return new Linear_Expression_Difference(lhs, rhs);
+        return new Linear_Expression_Difference(lhs, rhs);
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Sum.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Sum.java
index 2940fb3..70f3930 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Sum.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Sum.java
@@ -1,6 +1,6 @@
 /* Linear_Expression_Sum class definition and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -42,17 +42,17 @@ public class Linear_Expression_Sum
 
     //! Returns the left hand side of \p this.
     public Linear_Expression left_hand_side() {
-	return lhs;
+        return lhs;
     }
 
     //! Returns the right hand side of \p this.
     public Linear_Expression right_hand_side() {
-	return rhs;
+        return rhs;
     }
 
     //! Builds a copy of this.
     public Linear_Expression_Sum clone() {
-	return new Linear_Expression_Sum(lhs, rhs);
+        return new Linear_Expression_Sum(lhs, rhs);
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Times.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Times.java
index f6fe741..3cc64f6 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Times.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Times.java
@@ -1,6 +1,6 @@
 /* Linear_Expression_Times class definition and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -36,35 +36,35 @@ public class Linear_Expression_Times
 
     //! Builds an object cloning the input arguments.
     public Linear_Expression_Times(Coefficient c, Variable v) {
-	coeff = new Coefficient(c);
-	lin_expr = new Linear_Expression_Variable(v);
+        coeff = new Coefficient(c);
+        lin_expr = new Linear_Expression_Variable(v);
     }
 
     //! Builds an object cloning the input arguments.
     public Linear_Expression_Times(Coefficient c, Linear_Expression l) {
-	coeff = new Coefficient(c);
-	lin_expr = l.clone();
+        coeff = new Coefficient(c);
+        lin_expr = l.clone();
     }
 
     //! Builds an object cloning the input arguments.
     public Linear_Expression_Times(Linear_Expression l, Coefficient c) {
-	coeff = new Coefficient(c);
-	lin_expr = l.clone();
+        coeff = new Coefficient(c);
+        lin_expr = l.clone();
     }
 
     //! Returns the coefficient of \p this.
     public Coefficient coefficient() {
-	return coeff;
+        return coeff;
     }
 
     //! Returns the linear expression subobject of \p this.
     public Linear_Expression linear_expression() {
-	return lin_expr;
+        return lin_expr;
     }
 
     //! Builds a copy of this.
     public Linear_Expression_Times clone() {
-	return new Linear_Expression_Times(coeff, lin_expr);
+        return new Linear_Expression_Times(coeff, lin_expr);
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Unary_Minus.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Unary_Minus.java
index 4c045b1..dae5a35 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Unary_Minus.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Unary_Minus.java
@@ -1,6 +1,6 @@
 /* Linear_Expression_Unary_Minus class definition and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -33,12 +33,12 @@ public class Linear_Expression_Unary_Minus
 
     //! Builds an object that represents the negation of the copy \p x.
     public Linear_Expression_Unary_Minus(Linear_Expression x) {
-	arg = x.clone();
+        arg = x.clone();
     }
 
     //! Returns the value that \p this negates.
     public Linear_Expression argument() {
-	return arg;
+        return arg;
     }
 
     //! Builds a copy of this.
diff --git a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Variable.java b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Variable.java
index 80811a6..b2afb29 100644
--- a/interfaces/Java/parma_polyhedra_library/Linear_Expression_Variable.java
+++ b/interfaces/Java/parma_polyhedra_library/Linear_Expression_Variable.java
@@ -1,6 +1,6 @@
 /* Linear_Expression_Variable class definition and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -32,7 +32,7 @@ extends Linear_Expression {
 
     //! Builds the object associated to the copy of \p v.
     public Linear_Expression_Variable(Variable v) {
-	arg = new Variable(v.id());
+        arg = new Variable(v.id());
     }
 
     //! Returns the variable representing the linear expression.
@@ -42,10 +42,10 @@ extends Linear_Expression {
 
     //! Builds a copy of this.
     public Linear_Expression_Variable clone() {
-	return new Linear_Expression_Variable(arg);
+        return new Linear_Expression_Variable(arg);
     }
 
-    private int var_id() {
+    private long var_id() {
         return arg.id();
     }
 
diff --git a/interfaces/Java/parma_polyhedra_library/Logic_Error_Exception.java b/interfaces/Java/parma_polyhedra_library/Logic_Error_Exception.java
index 1376bd3..3fc2cc1 100644
--- a/interfaces/Java/parma_polyhedra_library/Logic_Error_Exception.java
+++ b/interfaces/Java/parma_polyhedra_library/Logic_Error_Exception.java
@@ -1,6 +1,6 @@
 /* Logic_Error_Exception Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/MIP_Problem.java b/interfaces/Java/parma_polyhedra_library/MIP_Problem.java
index 86aa387..13c2159 100644
--- a/interfaces/Java/parma_polyhedra_library/MIP_Problem.java
+++ b/interfaces/Java/parma_polyhedra_library/MIP_Problem.java
@@ -1,6 +1,6 @@
 /* MIP_Problem Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,9 +24,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A Mixed Integer (linear) Programming problem.
 /*! \ingroup PPL_Java_interface
   An object of this class encodes a mixed integer (linear) programming problem.
@@ -72,7 +69,7 @@ public class MIP_Problem extends PPL_Object {
       Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
     */
     public MIP_Problem(long dim) {
-	build_cpp_object(dim);
+        build_cpp_object(dim);
     }
 
     /*! \brief
@@ -102,12 +99,12 @@ public class MIP_Problem extends PPL_Object {
     */
     public MIP_Problem(long dim, Constraint_System cs, Linear_Expression obj,
                        Optimization_Mode mode) {
-	build_cpp_object(dim, cs, obj, mode);
+        build_cpp_object(dim, cs, obj, mode);
     }
 
     //! Builds a copy of \p y.
     public MIP_Problem(MIP_Problem y) {
-	build_cpp_object(y);
+        build_cpp_object(y);
     }
 
     /*! \brief
@@ -265,8 +262,8 @@ public class MIP_Problem extends PPL_Object {
       or if the generator \p evaluating_point is not a point.
     */
     public native void evaluate_objective_function(Generator evaluating_point,
-						   Coefficient num,
-						   Coefficient den);
+                                                   Coefficient num,
+                                                   Coefficient den);
 
     //! Returns a feasible point for \p this, if it exists.
     /*!
@@ -316,9 +313,9 @@ public class MIP_Problem extends PPL_Object {
 
     //! Builds the underlying C++ object.
     private native void build_cpp_object(long dim,
-					 Constraint_System cs,
-					 Linear_Expression obj,
-					 Optimization_Mode mode);
+                                         Constraint_System cs,
+                                         Linear_Expression obj,
+                                         Optimization_Mode mode);
 
     //! Builds the underlying C++ object.
     private native void build_cpp_object(MIP_Problem y);
diff --git a/interfaces/Java/parma_polyhedra_library/MIP_Problem_Status.java b/interfaces/Java/parma_polyhedra_library/MIP_Problem_Status.java
index 803278c..810d8be 100644
--- a/interfaces/Java/parma_polyhedra_library/MIP_Problem_Status.java
+++ b/interfaces/Java/parma_polyhedra_library/MIP_Problem_Status.java
@@ -1,6 +1,6 @@
 /* MIP_Problem_Status enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Makefile.am b/interfaces/Java/parma_polyhedra_library/Makefile.am
index 7031ed5..90a4801 100644
--- a/interfaces/Java/parma_polyhedra_library/Makefile.am
+++ b/interfaces/Java/parma_polyhedra_library/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -186,6 +186,7 @@ $(srcdir)/PPL_Object.java \
 $(srcdir)/Relation_Symbol.java \
 $(srcdir)/Timeout_Exception.java \
 $(srcdir)/Variable.java \
+$(srcdir)/Variable_Stringifier.java \
 $(srcdir)/Variables_Set.java
 
 # NOTE: do _NOT_ add Fake_Class_for_Doxygen.java to this list.
diff --git a/interfaces/Java/parma_polyhedra_library/Makefile.in b/interfaces/Java/parma_polyhedra_library/Makefile.in
index 3273a1c..e5d7b71 100644
--- a/interfaces/Java/parma_polyhedra_library/Makefile.in
+++ b/interfaces/Java/parma_polyhedra_library/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -57,7 +73,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Java/parma_polyhedra_library
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -90,14 +107,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -454,6 +482,7 @@ $(srcdir)/PPL_Object.java \
 $(srcdir)/Relation_Symbol.java \
 $(srcdir)/Timeout_Exception.java \
 $(srcdir)/Variable.java \
+$(srcdir)/Variable_Stringifier.java \
 $(srcdir)/Variables_Set.java
 
 
@@ -594,6 +623,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
diff --git a/interfaces/Java/parma_polyhedra_library/Optimization_Mode.java b/interfaces/Java/parma_polyhedra_library/Optimization_Mode.java
index 95a31ff..a5ef51f 100644
--- a/interfaces/Java/parma_polyhedra_library/Optimization_Mode.java
+++ b/interfaces/Java/parma_polyhedra_library/Optimization_Mode.java
@@ -1,6 +1,6 @@
 /* Optimization_Mode enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Overflow_Error_Exception.java b/interfaces/Java/parma_polyhedra_library/Overflow_Error_Exception.java
index 532656c..b66bf15 100644
--- a/interfaces/Java/parma_polyhedra_library/Overflow_Error_Exception.java
+++ b/interfaces/Java/parma_polyhedra_library/Overflow_Error_Exception.java
@@ -1,6 +1,6 @@
 /* Overflow_Error_Exception Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Decision_Node.java b/interfaces/Java/parma_polyhedra_library/PIP_Decision_Node.java
index 8861f87..ad6f6c9 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Decision_Node.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Decision_Node.java
@@ -1,6 +1,6 @@
 /* PIP_Decision_Node Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,9 +24,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! An internal node of the PIP solution tree.
 public class PIP_Decision_Node extends PIP_Tree_Node {
 
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Problem.java b/interfaces/Java/parma_polyhedra_library/PIP_Problem.java
index ce7bd87..9a0df31 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Problem.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Problem.java
@@ -1,6 +1,6 @@
 /* PIP_Problem Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,9 +24,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A Parametric Integer Programming problem.
 /*! \ingroup PPL_Java_interface
   An object of this class encodes a parametric integer (linear)
@@ -111,7 +108,7 @@ public class PIP_Problem extends PPL_Object {
     Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
   */
     public PIP_Problem(long dim) {
-	build_cpp_object(dim);
+        build_cpp_object(dim);
     }
 
   //! Builds a PIP problem from a sequence of constraints.
@@ -121,12 +118,12 @@ public class PIP_Problem extends PPL_Object {
     parameters.
   */
    public PIP_Problem(long dim, Constraint_System cs, Variables_Set params) {
-	build_cpp_object(dim, cs, params);
+        build_cpp_object(dim, cs, params);
     }
 
     //! Builds a copy of \p y.
     public PIP_Problem(PIP_Problem y) {
-	build_cpp_object(y);
+        build_cpp_object(y);
     }
 
     /*! \brief
@@ -318,7 +315,7 @@ public class PIP_Problem extends PPL_Object {
 
     //! Builds the underlying C++ object.
     private native void build_cpp_object(long dim,
-					 Constraint_System cs,
+                                         Constraint_System cs,
                                          Variables_Set vars);
 
     //! Builds the underlying C++ object.
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Name.java b/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Name.java
index 6049759..2a2d2df 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Name.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Name.java
@@ -1,6 +1,6 @@
 /* PIP_Problem PIP_Problem_Control_Parameter_Name enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Value.java b/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Value.java
index b63f4d0..44fa3f7 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Value.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Problem_Control_Parameter_Value.java
@@ -1,6 +1,6 @@
 /* PIP_Problem PIP_Problem_Control_Parameter_Value enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Problem_Status.java b/interfaces/Java/parma_polyhedra_library/PIP_Problem_Status.java
index e904446..ae2b022 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Problem_Status.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Problem_Status.java
@@ -1,6 +1,6 @@
 /* PIP_Problem_Status enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Solution_Node.java b/interfaces/Java/parma_polyhedra_library/PIP_Solution_Node.java
index 5e35320..958cfa2 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Solution_Node.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Solution_Node.java
@@ -1,6 +1,6 @@
 /* PIP_Solution_Node Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,9 +24,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A leaf node of the PIP solution tree.
 public class PIP_Solution_Node extends PIP_Tree_Node {
 
diff --git a/interfaces/Java/parma_polyhedra_library/PIP_Tree_Node.java b/interfaces/Java/parma_polyhedra_library/PIP_Tree_Node.java
index 1deba93..1addb94 100644
--- a/interfaces/Java/parma_polyhedra_library/PIP_Tree_Node.java
+++ b/interfaces/Java/parma_polyhedra_library/PIP_Tree_Node.java
@@ -1,6 +1,6 @@
 /* PIP_Tree_Node Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,9 +24,6 @@ site: http://bugseng.com/products/ppl/ . */
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 //! A node of the PIP solution tree.
 /*!
   This is the base class for the nodes of the binary trees representing
diff --git a/interfaces/Java/parma_polyhedra_library/PPL_Object.java b/interfaces/Java/parma_polyhedra_library/PPL_Object.java
index 071eed9..1aa23e4 100644
--- a/interfaces/Java/parma_polyhedra_library/PPL_Object.java
+++ b/interfaces/Java/parma_polyhedra_library/PPL_Object.java
@@ -1,6 +1,6 @@
 /* PPL_Object Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -36,7 +36,7 @@ public class PPL_Object {
 
     //! Builds an object that points to `null'.
     protected PPL_Object() {
-	ptr = 0;
+        ptr = 0;
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Pair.java b/interfaces/Java/parma_polyhedra_library/Pair.java
index 499347e..c3f986f 100644
--- a/interfaces/Java/parma_polyhedra_library/Pair.java
+++ b/interfaces/Java/parma_polyhedra_library/Pair.java
@@ -1,6 +1,6 @@
 /* Pair Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -37,12 +37,12 @@ public class Pair<K, V>  {
 
     //! Returns the object of type K.
     public K getFirst() {
-	return first;
+        return first;
     }
 
     //! Returns the object of type V.
     public V getSecond() {
-	return second;
+        return second;
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Parma_Polyhedra_Library.java b/interfaces/Java/parma_polyhedra_library/Parma_Polyhedra_Library.java
index 2e222b3..b2b34f0 100644
--- a/interfaces/Java/parma_polyhedra_library/Parma_Polyhedra_Library.java
+++ b/interfaces/Java/parma_polyhedra_library/Parma_Polyhedra_Library.java
@@ -1,6 +1,6 @@
 /* Parma_Polyhedra_Library Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -105,7 +105,7 @@ site: http://bugseng.com/products/ppl/ . */
 
   - In the following, any of the above numerical
     abstract domains  is called a PPL <EM>domain</EM>
-    and any element of a PPL domain is called a <EM>PPL object</EM>.
+    and any element of a PPL domain is called a PPL <EM>object</EM>.
 
   - A Java program can create a new object for a PPL domain by
     using the constructors for the class corresponding to the domain.
@@ -129,6 +129,22 @@ site: http://bugseng.com/products/ppl/ . */
     \extref{representation, Representations of Convex Polyhedra}
     of the main PPL user manual.
 
+  - A <EM>system</EM> of constraints (i.e., an instance of class
+    <CODE>parma_polyhedra_library.Constraint_System</CODE>)
+    is implemented by extending class <CODE>java.util.ArrayList</CODE>
+    (note: <CODE>java.util.Vector</CODE> was used up to version 1.0.)
+    As a consequence, it is possible to iterate over the constraints
+    in the system by using corresponding inherited methods. Similarly,
+    it is possible to modify a system of constraints by using methods
+    such as <CODE>add</CODE>; be warned, however, that the constraint
+    system obtained from a PPL object is a <EM>copy</EM> of the (C++)
+    data structure used in the object itself: any modification will not
+    directly affect the original PPL object; clearly, the modified
+    constraint system can be used with appropriate methods to,
+    e.g., build a new PPL object or modify an existing one.
+    The same observations apply to systems of congruences and
+    systems of (grid) generators.
+
 */ /* \mainpage */
 
 /*! \brief The PPL Java interface package.
diff --git a/interfaces/Java/parma_polyhedra_library/Partial_Function.java b/interfaces/Java/parma_polyhedra_library/Partial_Function.java
index 7219baf..c8e926d 100644
--- a/interfaces/Java/parma_polyhedra_library/Partial_Function.java
+++ b/interfaces/Java/parma_polyhedra_library/Partial_Function.java
@@ -1,6 +1,6 @@
 /* Partial_Function Java interface declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -34,7 +34,7 @@ public class Partial_Function extends PPL_Object {
       Builds the empty map.
     */
     public Partial_Function() {
-	build_cpp_object();
+        build_cpp_object();
     }
 
     /*! \brief
diff --git a/interfaces/Java/parma_polyhedra_library/Poly_Con_Relation.java b/interfaces/Java/parma_polyhedra_library/Poly_Con_Relation.java
index 39a0bb7..e1dc9fd 100644
--- a/interfaces/Java/parma_polyhedra_library/Poly_Con_Relation.java
+++ b/interfaces/Java/parma_polyhedra_library/Poly_Con_Relation.java
@@ -1,6 +1,6 @@
 /* Poly_Con_Relation Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -41,12 +41,12 @@ public class Poly_Con_Relation {
 
     //! Constructs from a integer value.
     public Poly_Con_Relation(int val) {
-	mask_value = val;
+        mask_value = val;
     }
 
     //! The assertion that says nothing.
     public static Poly_Con_Relation nothing() {
-	return new Poly_Con_Relation(Poly_Con_Relation.NOTHING);
+        return new Poly_Con_Relation(Poly_Con_Relation.NOTHING);
     }
 
     /*! \brief
@@ -54,7 +54,7 @@ public class Poly_Con_Relation {
       the constraint are disjoint.
     */
     public static Poly_Con_Relation is_disjoint() {
-	return new  Poly_Con_Relation(Poly_Con_Relation.IS_DISJOINT);
+        return new  Poly_Con_Relation(Poly_Con_Relation.IS_DISJOINT);
     }
 
     /*! \brief
@@ -62,7 +62,7 @@ public class Poly_Con_Relation {
       the constraint, but it is not included in it.
     */
     public static Poly_Con_Relation strictly_intersects() {
-	return new Poly_Con_Relation(Poly_Con_Relation.STRICTLY_INTERSECTS);
+        return new Poly_Con_Relation(Poly_Con_Relation.STRICTLY_INTERSECTS);
     }
 
     /*! \brief
@@ -70,7 +70,7 @@ public class Poly_Con_Relation {
       the constraint.
     */
     public static Poly_Con_Relation is_included() {
-	return new Poly_Con_Relation(Poly_Con_Relation.IS_INCLUDED);
+        return new Poly_Con_Relation(Poly_Con_Relation.IS_INCLUDED);
     }
 
     /*! \brief
@@ -78,12 +78,12 @@ public class Poly_Con_Relation {
       the constraint.
     */
     public static Poly_Con_Relation saturates() {
-	return new Poly_Con_Relation(Poly_Con_Relation.SATURATES);
+        return new Poly_Con_Relation(Poly_Con_Relation.SATURATES);
     }
 
     //! True if and only if \p this implies \p y.
     public boolean implies(Poly_Con_Relation y) {
-	return (this.mask_value & y.mask_value) ==  y.mask_value;
+        return (this.mask_value & y.mask_value) ==  y.mask_value;
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Poly_Gen_Relation.java b/interfaces/Java/parma_polyhedra_library/Poly_Gen_Relation.java
index a99d1ed..1ae906d 100644
--- a/interfaces/Java/parma_polyhedra_library/Poly_Gen_Relation.java
+++ b/interfaces/Java/parma_polyhedra_library/Poly_Gen_Relation.java
@@ -1,6 +1,6 @@
 /* Poly_Gen_Relation Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -38,22 +38,22 @@ public class Poly_Gen_Relation {
 
     //! Constructs from a integer value.
     public Poly_Gen_Relation(int val) {
-	mask_value = val;
+        mask_value = val;
     }
 
     //! The assertion that says nothing.
     public static Poly_Gen_Relation nothing() {
-	return new Poly_Gen_Relation(Poly_Gen_Relation.NOTHING);
+        return new Poly_Gen_Relation(Poly_Gen_Relation.NOTHING);
     }
 
     //! Adding the generator would not change the polyhedron.
     public static Poly_Gen_Relation subsumes() {
-	return new  Poly_Gen_Relation(Poly_Gen_Relation.SUBSUMES);
+        return new  Poly_Gen_Relation(Poly_Gen_Relation.SUBSUMES);
     }
 
     //! True if and only if \p this implies \p y.
     public boolean implies(Poly_Gen_Relation y) {
-	return (this.mask_value & y.mask_value) ==  y.mask_value;
+        return (this.mask_value & y.mask_value) ==  y.mask_value;
     }
 
     private static native void initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Relation_Symbol.java b/interfaces/Java/parma_polyhedra_library/Relation_Symbol.java
index b3de214..f696016 100644
--- a/interfaces/Java/parma_polyhedra_library/Relation_Symbol.java
+++ b/interfaces/Java/parma_polyhedra_library/Relation_Symbol.java
@@ -1,6 +1,6 @@
 /* Relation_Symbol enum declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -35,7 +35,9 @@ public enum Relation_Symbol {
     //! Greater than or equal to.
     GREATER_OR_EQUAL,
     //! Greater than.
-    GREATER_THAN;
+    GREATER_THAN,
+    //! Not equal to.
+    NOT_EQUAL;
 
     private static native void initIDs();
     static {
diff --git a/interfaces/Java/parma_polyhedra_library/Timeout_Exception.java b/interfaces/Java/parma_polyhedra_library/Timeout_Exception.java
index 848d9ff..a5da527 100644
--- a/interfaces/Java/parma_polyhedra_library/Timeout_Exception.java
+++ b/interfaces/Java/parma_polyhedra_library/Timeout_Exception.java
@@ -1,6 +1,6 @@
 /* Timeout_Exception Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/Variable.java b/interfaces/Java/parma_polyhedra_library/Variable.java
index 7d1d66f..2ebe8ac 100644
--- a/interfaces/Java/parma_polyhedra_library/Variable.java
+++ b/interfaces/Java/parma_polyhedra_library/Variable.java
@@ -1,6 +1,6 @@
 /* Variable Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -37,37 +37,57 @@ import javax.management.RuntimeErrorException;
 */
 public class Variable implements Comparable<Variable> {
     //! The index of the Cartesian axis.
-    private int varid;
+    private long varid;
 
     //! Builds the variable corresponding to the Cartesian axis of index \p i.
     /*!
       \exception RuntimeErrorException
       Thrown if <CODE>i</CODE> is has negative value.
     */
-    public Variable(int i) {
-	if (i < 0)
-	    throw new
-		RuntimeErrorException(new Error("parma_polyhedra_library.Variable::"
-						+ "Variable:"
-						+ " an index variable"
-						+ " cannot be negative."));
-	varid = i;
+    public Variable(long i) {
+        if (i < 0)
+            throw new
+                RuntimeErrorException(new Error("parma_polyhedra_library.Variable::"
+                                                + "Variable:"
+                                                + " an index variable"
+                                                + " cannot be negative."));
+        varid = i;
     }
 
     //! Returns the index of the Cartesian axis associated to \p this.
-    public int id() {
-	return varid;
+    public long id() {
+        return varid;
     }
 
-  /*! \brief
-    Returns a negative number if \p this comes first than \p v,
-    a zero if \p this equals \p v, a positive number if
-   if \p this comes first than \p v.
-   */
+    /*! \brief
+      Returns a negative number if \p this is smaller than \p v,
+      a zero if \p this equals \p v, a positive number if \p v
+      is greater than \p v.
+    */
     public int compareTo(Variable v) {
-        return varid - v.varid;
+        if (varid < v.varid)
+            return -1;
+        else if (varid == v.varid)
+            return 0;
+        else
+            return 1;
     }
 
+    //! Optional customization provider for \c toString.
+    private static Variable_Stringifier stringifier;
+
+    /*! \brief
+      Sets the variable stringifier object.
+
+      A variable stringifier object provides customization for the
+      \c toString method; if no variable stringifier object is set
+      (or if it is set to a null refeerence value), the PPL default
+      variable output function will be used.
+    */
+    public static native void setStringifier(Variable_Stringifier vs);
+
+    public native String toString();
+
     private static native void initIDs();
     static {
         initIDs();
diff --git a/interfaces/Java/parma_polyhedra_library/Variable_Stringifier.java b/interfaces/Java/parma_polyhedra_library/Variable_Stringifier.java
new file mode 100644
index 0000000..5349c98
--- /dev/null
+++ b/interfaces/Java/parma_polyhedra_library/Variable_Stringifier.java
@@ -0,0 +1,33 @@
+/* Variable_Stringifier Java interface.
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+package parma_polyhedra_library;
+
+//! An interface for objects converting a Variable id to a string.
+/*! \ingroup PPL_Java_interface
+  If customized variable output is required, the user should implement
+  this interface and pass a corresponding instance to Variable's static
+  method \c setStringifier.
+*/
+public interface Variable_Stringifier {
+    public String stringify(long var_id);
+}
diff --git a/interfaces/Java/parma_polyhedra_library/Variables_Set.java b/interfaces/Java/parma_polyhedra_library/Variables_Set.java
index a4c1861..8140a1e 100644
--- a/interfaces/Java/parma_polyhedra_library/Variables_Set.java
+++ b/interfaces/Java/parma_polyhedra_library/Variables_Set.java
@@ -1,6 +1,6 @@
 /* Variables_Set Java class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java.m4 b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java.m4
index dda8588..3f7424f 100644
--- a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java.m4
+++ b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the files <CLASS_NAME>.java
 dnl using the code in ppl_interface_generator_java_classes_java_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -61,9 +61,6 @@ m4_include(`ppl_interface_generator_copyright')`'dnl
 
 package parma_polyhedra_library;
 
-import java.io.Writer;
-import java.io.IOException;
-
 /*! \brief
   Java class interfacing C++ m4_this_cplusplus_class
   \ingroup PPL_java_interface
diff --git a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4
index cb86f1f..3f71d75 100644
--- a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4
+++ b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 This m4 file contains the code for generating files <CLASS_NAME>.java
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -538,7 +538,7 @@ m4_define(`ppl_ at CLASS@_drop_some_non_integer_points_code',
 ___END_OF_FILE___
 ___BEGIN_OF_FILE___ @CLASS at .java << ___END_OF_FILE___
     public native void drop_some_non_integer_points
-      (Integer complexity_threshold);
+      (Complexity_Class complexity);
 
 ')
 
@@ -546,8 +546,8 @@ m4_define(`ppl_ at CLASS@_drop_some_non_integer_points_2_code',
 `dnl
 ___END_OF_FILE___
 ___BEGIN_OF_FILE___ @CLASS at .java << ___END_OF_FILE___
-    public native void drop_some_non_integer_points_2
-      (Variables_Set vars, Integer complexity_threshold);
+    public native void drop_some_non_integer_points
+      (Variables_Set vars, Complexity_Class complexity);
 
 ')
 
diff --git a/interfaces/Java/ppl_interface_generator_java_procedure_generators.m4 b/interfaces/Java/ppl_interface_generator_java_procedure_generators.m4
index b81340a..a05b5ae 100644
--- a/interfaces/Java/ppl_interface_generator_java_procedure_generators.m4
+++ b/interfaces/Java/ppl_interface_generator_java_procedure_generators.m4
@@ -5,7 +5,7 @@ dnl for the Java interface; this includes:
 dnl - the list in the imported file and any Java specific methods.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Java/tests/C_Polyhedron_test1.java b/interfaces/Java/tests/C_Polyhedron_test1.java
index e902668..674d4aa 100644
--- a/interfaces/Java/tests/C_Polyhedron_test1.java
+++ b/interfaces/Java/tests/C_Polyhedron_test1.java
@@ -1,7 +1,7 @@
 /* Test C_Polyhedron Java test class of the Parma Polyhedra Library Java
    interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,87 +22,105 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.math.BigInteger;
-import java.util.Iterator;
-import java.util.Vector;
 import parma_polyhedra_library.*;
 
 public class C_Polyhedron_test1 {
-static {
-    try {
-        System.loadLibrary("ppl_java");
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
     }
-    catch (UnsatisfiedLinkError  e) {
-        System.out.println("Unable to load the library");
-        System.out.println(e.getMessage());
-        System.exit(-1);
-    }
-}
 
     // This code tests the method `map_space_dimension(pfunc)'.
     public static boolean test01() {
-	Partial_Function partial_function = new Partial_Function();
-	partial_function.insert(0, 2);
-	partial_function.insert(2, 0);
-	partial_function.insert(1, 1);
-	Variable A = new Variable(0);
-	Variable B = new Variable(1);
-	Variable C = new Variable(2);
-	Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
-	Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
-	Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
-	Linear_Expression_Sum le_a_plus_b
+        Partial_Function partial_function = new Partial_Function();
+        partial_function.insert(0, 2);
+        partial_function.insert(2, 0);
+        partial_function.insert(1, 1);
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Variable C = new Variable(2);
+        Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
+        Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Linear_Expression_Sum le_a_plus_b
             = new Linear_Expression_Sum(le_a, le_b);
-	Linear_Expression_Sum le_a_plus_c
+        Linear_Expression_Sum le_a_plus_c
             = new Linear_Expression_Sum(le_a, le_c);
-	Linear_Expression_Sum le_c_plus_b
+        Linear_Expression_Sum le_c_plus_b
             = new Linear_Expression_Sum(le_c, le_b);
-	Linear_Expression_Sum le_c_plus_a
+        Linear_Expression_Sum le_c_plus_a
             = new Linear_Expression_Sum(le_c, le_a);
-	Linear_Expression_Coefficient le_two
-	    = new Linear_Expression_Coefficient(new Coefficient(2));
-	Linear_Expression_Times le_2c
-	    = new Linear_Expression_Times(le_c, new Coefficient(2));
-	Linear_Expression_Times le_2a
-	    = new Linear_Expression_Times(le_a, new Coefficient(2));
-
-	Generator_System gs = new Generator_System();
-	gs.add(Generator.point(le_2c, new Coefficient(1)));
-	gs.add(Generator.line(le_a_plus_b));
-	gs.add(Generator.ray(le_a_plus_c));
-
-	C_Polyhedron poly1 = new C_Polyhedron(gs);
-	poly1.map_space_dimensions(partial_function);
-
-	Generator_System known_gs = new Generator_System();
-	known_gs.add(Generator.point(le_2a, new Coefficient(1)));
-	known_gs.add(Generator.line(le_c_plus_b));
-	known_gs.add(Generator.ray(le_c_plus_a));
-
-	C_Polyhedron known_result = new C_Polyhedron(known_gs);
-	return known_result.equals(poly1);
+        Linear_Expression_Coefficient le_two
+            = new Linear_Expression_Coefficient(new Coefficient(2));
+        Linear_Expression_Times le_2c
+            = new Linear_Expression_Times(le_c, new Coefficient(2));
+        Linear_Expression_Times le_2a
+            = new Linear_Expression_Times(le_a, new Coefficient(2));
+
+        Generator_System gs = new Generator_System();
+        gs.add(Generator.point(le_2c, new Coefficient(1)));
+        gs.add(Generator.line(le_a_plus_b));
+        gs.add(Generator.ray(le_a_plus_c));
+
+        C_Polyhedron poly1 = new C_Polyhedron(gs);
+        poly1.map_space_dimensions(partial_function);
+
+        Generator_System known_gs = new Generator_System();
+        known_gs.add(Generator.point(le_2a, new Coefficient(1)));
+        known_gs.add(Generator.line(le_c_plus_b));
+        known_gs.add(Generator.ray(le_c_plus_a));
+
+        C_Polyhedron known_result = new C_Polyhedron(known_gs);
+        return known_result.equals(poly1);
     }
 
 
     public static boolean test02() {
-	// Test if `minimized_constraints' returns an empty Constraint_System
-	// if the Polyhedron is built from universe with a dimension greater
-	// than zero.
-	Variable X = new Variable(0);
-	Variable Y = new Variable(1);
-	Variable Z = new Variable(2);
-	C_Polyhedron ph = new C_Polyhedron(3, Degenerate_Element.UNIVERSE);
-	Constraint_System cs = ph.minimized_constraints();
-	return cs.isEmpty();
+        // Test if `minimized_constraints' returns an empty Constraint_System
+        // if the Polyhedron is built from universe with a dimension greater
+        // than zero.
+        Variable X = new Variable(0);
+        Variable Y = new Variable(1);
+        Variable Z = new Variable(2);
+        C_Polyhedron ph = new C_Polyhedron(3, Degenerate_Element.UNIVERSE);
+        Constraint_System cs = ph.minimized_constraints();
+        return cs.isEmpty();
+    }
+
+    public static boolean test03() {
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Generator_System gs = new Generator_System();
+        gs.add(Generator.point(new Linear_Expression_Variable(A),
+                               new Coefficient(2)));
+        gs.add(Generator.point(new Linear_Expression_Variable(B),
+                               new Coefficient(2)));
+        C_Polyhedron ph = new C_Polyhedron(gs);
+        Variables_Set var_set = new Variables_Set();
+        var_set.add(B);
+        ph.drop_some_non_integer_points(var_set,
+                                        Complexity_Class.ANY_COMPLEXITY);
+        Generator_System gs_out = ph.minimized_generators();
+        boolean ok = (gs_out.size() == 1);
+        ph.drop_some_non_integer_points(Complexity_Class.ANY_COMPLEXITY);
+        gs_out = ph.minimized_generators();
+        ok = ok && gs_out.isEmpty();
+        return ok;
     }
 
     public static void main(String[] args) {
         Parma_Polyhedra_Library.initialize_library();
-	boolean test_result_ok =
-	    Test_Executor.executeTests(C_Polyhedron_test1.class);
+        boolean test_result_ok =
+            Test_Executor.executeTests(C_Polyhedron_test1.class);
         Parma_Polyhedra_Library.finalize_library();
-	if (!test_result_ok)
-	    System.exit(1);
-	System.exit(0);
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
     }
 }
diff --git a/interfaces/Java/tests/Custom_Variable_Stringifier.java b/interfaces/Java/tests/Custom_Variable_Stringifier.java
new file mode 100644
index 0000000..899107c
--- /dev/null
+++ b/interfaces/Java/tests/Custom_Variable_Stringifier.java
@@ -0,0 +1,29 @@
+/* A class providing customized variable output for Java.
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+import parma_polyhedra_library.*;
+
+public class Custom_Variable_Stringifier implements Variable_Stringifier {
+    public String stringify(long var_id) {
+        return "Var_" + var_id;
+    }
+}
diff --git a/interfaces/Java/tests/MIP_Problem_test1.java b/interfaces/Java/tests/MIP_Problem_test1.java
index e687338..23019be 100644
--- a/interfaces/Java/tests/MIP_Problem_test1.java
+++ b/interfaces/Java/tests/MIP_Problem_test1.java
@@ -1,7 +1,7 @@
 /* Test MIP_Problem Java test class of the Parma Polyhedra Library Java
    interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,49 +22,45 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.math.BigInteger;
-import java.util.Iterator;
-import java.util.Vector;
 import parma_polyhedra_library.*;
 
-
 public class MIP_Problem_test1 {
-static {
-    try {
-        System.loadLibrary("ppl_java");
-    }
-    catch (UnsatisfiedLinkError  e) {
-        System.out.println("Unable to load the library");
-        System.out.println(e.getMessage());
-        System.exit(-1);
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
     }
-}
 
     // This code tests the MIP_Problem methods.
     public static boolean test01() {
-	Variable A = new Variable(0);
-	Variable B = new Variable(1);
-	Variable C = new Variable(2);
-	Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
-	Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
-	Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Variable C = new Variable(2);
+        Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
+        Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_3 = new Coefficient(3);
         Coefficient coeff_5 = new Coefficient(5);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
-	Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
+        Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
 
-	// Constraint declarations.
-	Constraint c_a_geq_1
+        // Constraint declarations.
+        Constraint c_a_geq_1
           = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_a_leq_5
+        Constraint c_a_leq_5
           = new Constraint(le_a, Relation_Symbol.LESS_OR_EQUAL, le_5);
-	Constraint c_b_geq_3
+        Constraint c_b_geq_3
           = new Constraint(le_b, Relation_Symbol.GREATER_OR_EQUAL, le_3);
-	Constraint constraint1 = c_a_geq_1;
-	Constraint constraint2 = c_b_geq_3;
-	Constraint_System constraints1 = new Constraint_System();
+        Constraint constraint1 = c_a_geq_1;
+        Constraint constraint2 = c_b_geq_3;
+        Constraint_System constraints1 = new Constraint_System();
         constraints1.add(constraint1);
         C_Polyhedron ph1 = new C_Polyhedron(3, Degenerate_Element.UNIVERSE);
         ph1.add_constraints(constraints1);
@@ -72,7 +68,7 @@ static {
         ph2.add_constraints(constraints1);
         ph2.add_constraint(constraint2);
 
-	MIP_Problem mip1
+        MIP_Problem mip1
           = new MIP_Problem(3, constraints1, le_a,
                            Optimization_Mode.MAXIMIZATION);
         Constraint_System mip1_constraints = mip1.constraints();
@@ -108,36 +104,36 @@ static {
         mip3_ph.add_constraints(mip3_constraints);
         ok = ok && mip3_ph.equals(ph2);
 
-	return ok;
+        return ok;
     }
 
     // This code tests more MIP_Problem methods.
     public static boolean test02() {
-	Variable A = new Variable(0);
-	Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Variable A = new Variable(0);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
         Coefficient coeff_0 = new Coefficient(0);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_5 = new Coefficient(5);
         Coefficient coeff_8 = new Coefficient(8);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
-	Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
+        Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
 
-	// Constraint declarations.
-	Constraint c_a_geq_1
+        // Constraint declarations.
+        Constraint c_a_geq_1
           = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_a_leq_5
+        Constraint c_a_leq_5
           = new Constraint(le_a, Relation_Symbol.LESS_OR_EQUAL, le_5);
-	Constraint c_a_eq_8
+        Constraint c_a_eq_8
           = new Constraint(le_a, Relation_Symbol.EQUAL, le_8);
-	Constraint constraint1 = c_a_geq_1;
-	Constraint_System constraints1 = new Constraint_System();
+        Constraint constraint1 = c_a_geq_1;
+        Constraint_System constraints1 = new Constraint_System();
         constraints1.add(constraint1);
 
         Variables_Set var_set_A = new Variables_Set();
         var_set_A.add(A);
 
-	MIP_Problem mip1
+        MIP_Problem mip1
           = new MIP_Problem(1, constraints1, le_a,
                            Optimization_Mode.MAXIMIZATION);
         Constraint_System mip1_constraints = mip1.constraints();
@@ -159,16 +155,16 @@ static {
 
         MIP_Problem_Status mip1_status;
         mip1_status = mip1.solve();
-	ok = ok && (mip1_status == MIP_Problem_Status.UNBOUNDED_MIP_PROBLEM);
+        ok = ok && (mip1_status == MIP_Problem_Status.UNBOUNDED_MIP_PROBLEM);
 
         MIP_Problem_Status mip2_status;
         mip1.add_constraint(c_a_leq_5);
         mip2_status = mip1.solve();
-	ok = ok && (mip2_status == MIP_Problem_Status.OPTIMIZED_MIP_PROBLEM);
+        ok = ok && (mip2_status == MIP_Problem_Status.OPTIMIZED_MIP_PROBLEM);
         if (!ok)
           return false;
 
-	MIP_Problem mip3
+        MIP_Problem mip3
           = new MIP_Problem(1, constraints1, le_a,
                            Optimization_Mode.MAXIMIZATION);
         MIP_Problem_Status mip3_status;
@@ -178,11 +174,11 @@ static {
         Constraint_System cs = mip3.constraints();
         mip3_status = mip3.solve();
         ok = !mip3.is_satisfiable();
-	ok = ok && (mip3_status == MIP_Problem_Status.UNFEASIBLE_MIP_PROBLEM);
+        ok = ok && (mip3_status == MIP_Problem_Status.UNFEASIBLE_MIP_PROBLEM);
         if (!ok)
           return false;
 
-	Generator g1 = Generator.point(le_a, coeff_1);
+        Generator g1 = Generator.point(le_a, coeff_1);
         Coefficient num = coeff_1;
         Coefficient den = coeff_1;
         mip1.evaluate_objective_function(g1, num, den);
@@ -190,12 +186,12 @@ static {
         if (!ok)
           return false;
 
-	Linear_Expression le_5a = le_a.times(coeff_5);
+        Linear_Expression le_5a = le_a.times(coeff_5);
 
         Generator f_point = mip1.feasible_point();
         C_Polyhedron f_ph = new C_Polyhedron(1, Degenerate_Element.EMPTY);
         f_ph.add_generator(f_point);
-	Generator expected_f_point = Generator.point(le_5a, coeff_1);
+        Generator expected_f_point = Generator.point(le_5a, coeff_1);
         C_Polyhedron expected_f_ph
           = new C_Polyhedron(1, Degenerate_Element.EMPTY);
         expected_f_ph.add_generator(expected_f_point);
@@ -204,7 +200,7 @@ static {
         Generator o_point = mip1.optimizing_point();
         C_Polyhedron o_ph = new C_Polyhedron(1, Degenerate_Element.EMPTY);
         o_ph.add_generator(o_point);
-	Generator expected_o_point = Generator.point(le_5a, coeff_1);
+        Generator expected_o_point = Generator.point(le_5a, coeff_1);
         C_Polyhedron expected_o_ph
           = new C_Polyhedron(1, Degenerate_Element.EMPTY);
         expected_o_ph.add_generator(expected_o_point);
@@ -220,9 +216,9 @@ static {
         // ok = (le_ov_num == le_5 && le_ov_den == le_1);
         C_Polyhedron ov_ph
           = new C_Polyhedron(1, Degenerate_Element.EMPTY);
-	Constraint c_a_leq_ov_num
+        Constraint c_a_leq_ov_num
           = new Constraint(le_a, Relation_Symbol.LESS_OR_EQUAL, le_ov_num);
-	Constraint c_a_geq_ov_num
+        Constraint c_a_geq_ov_num
           = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_ov_den);
         ov_ph.add_constraint(c_a_leq_ov_num);
         C_Polyhedron expected_ov_ph
@@ -263,16 +259,16 @@ static {
           && (cp_value3
                 == Control_Parameter_Value.PRICING_TEXTBOOK);
 
-	return ok && mip1.OK();
+        return ok && mip1.OK();
     }
 
     public static void main(String[] args) {
         Parma_Polyhedra_Library.initialize_library();
-	boolean test_result_ok =
-	    Test_Executor.executeTests(MIP_Problem_test1.class);
+        boolean test_result_ok =
+            Test_Executor.executeTests(MIP_Problem_test1.class);
         Parma_Polyhedra_Library.finalize_library();
-	if (!test_result_ok)
-	    System.exit(1);
-	System.exit(0);
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
     }
 }
diff --git a/interfaces/Java/tests/Makefile.am b/interfaces/Java/tests/Makefile.am
index 99c9f2d..990b0ed 100644
--- a/interfaces/Java/tests/Makefile.am
+++ b/interfaces/Java/tests/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -49,7 +49,9 @@ PIP_Problem_test1.java \
 Parma_Polyhedra_Library_test1.java \
 Parma_Polyhedra_Library_test2.java \
 PPL_Test.java \
-ppl_java_tests_common
+ppl_java_tests_common \
+Custom_Variable_Stringifier.java \
+Variable_Output_test1.java
 
 if ENABLE_SHARED
 
@@ -62,6 +64,8 @@ MIP_Problem_test1.java \
 PIP_Problem_test1.java \
 Parma_Polyhedra_Library_test1.java \
 Parma_Polyhedra_Library_test2.java \
+Custom_Variable_Stringifier.java \
+Variable_Output_test1.java \
 PPL_Test.java
 
 CLASSPATH = ../ppl_java.jar:.
@@ -88,6 +92,7 @@ check-local: ppl_java_generated_tests.java
 	$(java_test_environment) PIP_Problem_test1
 	$(java_test_environment) Parma_Polyhedra_Library_test1
 	$(java_test_environment) Parma_Polyhedra_Library_test2
+	$(java_test_environment) Variable_Output_test1
 
 CLEANFILES = \
 ppl_java_generated_tests.java
diff --git a/interfaces/Java/tests/Makefile.in b/interfaces/Java/tests/Makefile.in
index dbf0352..50e1b70 100644
--- a/interfaces/Java/tests/Makefile.in
+++ b/interfaces/Java/tests/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -57,7 +73,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Java/tests
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -90,14 +107,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 CLASSPATH_ENV = CLASSPATH=$(JAVAROOT):$(srcdir)/$(JAVAROOT)$${CLASSPATH:+":$$CLASSPATH"}
 am__java_sources = $(check_JAVA)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
@@ -321,7 +349,9 @@ PIP_Problem_test1.java \
 Parma_Polyhedra_Library_test1.java \
 Parma_Polyhedra_Library_test2.java \
 PPL_Test.java \
-ppl_java_tests_common
+ppl_java_tests_common \
+Custom_Variable_Stringifier.java \
+Variable_Output_test1.java
 
 @ENABLE_SHARED_TRUE at check_JAVA = \
 @ENABLE_SHARED_TRUE at ppl_java_generated_tests.java \
@@ -332,6 +362,8 @@ ppl_java_tests_common
 @ENABLE_SHARED_TRUE at PIP_Problem_test1.java \
 @ENABLE_SHARED_TRUE at Parma_Polyhedra_Library_test1.java \
 @ENABLE_SHARED_TRUE at Parma_Polyhedra_Library_test2.java \
+ at ENABLE_SHARED_TRUE@Custom_Variable_Stringifier.java \
+ at ENABLE_SHARED_TRUE@Variable_Output_test1.java \
 @ENABLE_SHARED_TRUE at PPL_Test.java
 
 @ENABLE_SHARED_TRUE at CLASSPATH = ../ppl_java.jar:.
@@ -404,6 +436,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
@@ -568,6 +602,7 @@ uninstall-am:
 @ENABLE_SHARED_TRUE@	$(java_test_environment) PIP_Problem_test1
 @ENABLE_SHARED_TRUE@	$(java_test_environment) Parma_Polyhedra_Library_test1
 @ENABLE_SHARED_TRUE@	$(java_test_environment) Parma_Polyhedra_Library_test2
+ at ENABLE_SHARED_TRUE@	$(java_test_environment) Variable_Output_test1
 
 $(top_builddir)/interfaces/ppl_interface_instantiations.m4:
 	$(MAKE) $(AM_MAKEFLAGS) -C $(top_builddir)/interfaces ppl_interface_instantiations.m4
diff --git a/interfaces/Java/tests/NNC_Polyhedron_test1.java b/interfaces/Java/tests/NNC_Polyhedron_test1.java
index c032638..d55220e 100644
--- a/interfaces/Java/tests/NNC_Polyhedron_test1.java
+++ b/interfaces/Java/tests/NNC_Polyhedron_test1.java
@@ -1,7 +1,7 @@
 /* Test NNC_Polyhedron Java test class of the Parma Polyhedra Library Java
    interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,106 +22,102 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.math.BigInteger;
-import java.util.Iterator;
-import java.util.Vector;
 import parma_polyhedra_library.*;
 
-
 public class NNC_Polyhedron_test1 {
-static {
-    try {
-        System.loadLibrary("ppl_java");
-    }
-    catch (UnsatisfiedLinkError  e) {
-        System.out.println("Unable to load the library");
-        System.out.println(e.getMessage());
-        System.exit(-1);
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
     }
-}
 
     public static boolean test01() {
-	Variable X = new Variable(0);
-	Variable Y = new Variable(1);
-	Variable Z = new Variable(2);
-	NNC_Polyhedron ph = new NNC_Polyhedron(3, Degenerate_Element.UNIVERSE);
-	Linear_Expression le_X = new Linear_Expression_Variable(X);
-	Linear_Expression le_Y = new Linear_Expression_Variable(Y);
-	Linear_Expression le_Z = new Linear_Expression_Variable(Z);
-	Linear_Expression le_2Y = le_Y.times(new Coefficient(2));
-	Linear_Expression le_5Z = le_Z.times(new Coefficient(5));
-	Linear_Expression le_7
-	    = new Linear_Expression_Coefficient(new Coefficient(7));
-	Linear_Expression le_5
-	    = new Linear_Expression_Coefficient(new Coefficient(5));
-	Linear_Expression lhs1 = le_X.sum(le_2Y.sum(le_5Z));
-	NNC_Polyhedron ph1
+        Variable X = new Variable(0);
+        Variable Y = new Variable(1);
+        Variable Z = new Variable(2);
+        NNC_Polyhedron ph = new NNC_Polyhedron(3, Degenerate_Element.UNIVERSE);
+        Linear_Expression le_X = new Linear_Expression_Variable(X);
+        Linear_Expression le_Y = new Linear_Expression_Variable(Y);
+        Linear_Expression le_Z = new Linear_Expression_Variable(Z);
+        Linear_Expression le_2Y = le_Y.times(new Coefficient(2));
+        Linear_Expression le_5Z = le_Z.times(new Coefficient(5));
+        Linear_Expression le_7
+            = new Linear_Expression_Coefficient(new Coefficient(7));
+        Linear_Expression le_5
+            = new Linear_Expression_Coefficient(new Coefficient(5));
+        Linear_Expression lhs1 = le_X.sum(le_2Y.sum(le_5Z));
+        NNC_Polyhedron ph1
             = new NNC_Polyhedron(3, Degenerate_Element.UNIVERSE);
-	ph1.add_constraint(new Constraint(lhs1,
+        ph1.add_constraint(new Constraint(lhs1,
                                           Relation_Symbol.GREATER_OR_EQUAL,
                                           le_7));
-	ph1.add_constraint(new Constraint(le_X,
+        ph1.add_constraint(new Constraint(le_X,
                                           Relation_Symbol.LESS_THAN,
-					  le_5Z));
-	PPL_Test.println_if_noisy(ph1.constraints().toString());
+                                          le_5Z));
+        PPL_Test.println_if_noisy(ph1.constraints().toString());
         Constraint c = new Constraint(le_5Z,
                                       Relation_Symbol.GREATER_THAN,
                                       le_X);
         Poly_Con_Relation rel = ph1.relation_with(c);
-	return rel.implies(Poly_Con_Relation.is_included());
+        return rel.implies(Poly_Con_Relation.is_included());
     }
 
     public static boolean test02() {
-	// Test if `minimized_constraints' returns an empty Constraint_System
-	// if the Polyhedron is built from universe with a dimension greater
-	// than zero.
-	Variable X = new Variable(0);
-	Variable Y = new Variable(1);
-	Variable Z = new Variable(2);
-	NNC_Polyhedron ph = new NNC_Polyhedron(3, Degenerate_Element.UNIVERSE);
-	Constraint_System cs = ph.minimized_constraints();
-	return cs.isEmpty();
+        // Test if `minimized_constraints' returns an empty Constraint_System
+        // if the Polyhedron is built from universe with a dimension greater
+        // than zero.
+        Variable X = new Variable(0);
+        Variable Y = new Variable(1);
+        Variable Z = new Variable(2);
+        NNC_Polyhedron ph = new NNC_Polyhedron(3, Degenerate_Element.UNIVERSE);
+        Constraint_System cs = ph.minimized_constraints();
+        return cs.isEmpty();
     }
 
     public static boolean test03() {
-	// Test termination methods.
-	Variable X1 = new Variable(0);
-	Variable X2 = new Variable(1);
-	Variable XP1 = new Variable(2);
-	Variable XP2 = new Variable(3);
-	NNC_Polyhedron ph = new NNC_Polyhedron(4, Degenerate_Element.UNIVERSE);
+        // Test termination methods.
+        Variable X1 = new Variable(0);
+        Variable X2 = new Variable(1);
+        Variable XP1 = new Variable(2);
+        Variable XP2 = new Variable(3);
+        NNC_Polyhedron ph = new NNC_Polyhedron(4, Degenerate_Element.UNIVERSE);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_0 = new Coefficient(0);
-	Linear_Expression le_X1 = new Linear_Expression_Variable(X1);
-	Linear_Expression le_X2 = new Linear_Expression_Variable(X2);
-	Linear_Expression le_XP1 = new Linear_Expression_Variable(XP1);
-	Linear_Expression le_XP2 = new Linear_Expression_Variable(XP2);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_0 = new Linear_Expression_Coefficient(coeff_0);
-	Linear_Expression le_X1_difference_XP1 = le_X1.sum(le_XP1);
-	Constraint c_XP2_eq_1
+        Linear_Expression le_X1 = new Linear_Expression_Variable(X1);
+        Linear_Expression le_X2 = new Linear_Expression_Variable(X2);
+        Linear_Expression le_XP1 = new Linear_Expression_Variable(XP1);
+        Linear_Expression le_XP2 = new Linear_Expression_Variable(XP2);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_0 = new Linear_Expression_Coefficient(coeff_0);
+        Linear_Expression le_X1_difference_XP1 = le_X1.sum(le_XP1);
+        Constraint c_XP2_eq_1
           = new Constraint(le_XP2, Relation_Symbol.EQUAL, le_1);
-	Constraint c_X1_geq_1
+        Constraint c_X1_geq_1
           = new Constraint(le_X1, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_X1_minus_XP1_geq_1
+        Constraint c_X1_minus_XP1_geq_1
           = new Constraint(le_X1_difference_XP1, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_X2_leq_0
+        Constraint c_X2_leq_0
           = new Constraint(le_X2, Relation_Symbol.LESS_OR_EQUAL, le_0);
-	ph.add_constraint(c_XP2_eq_1);
-	ph.add_constraint(c_X1_geq_1);
-	ph.add_constraint(c_X1_minus_XP1_geq_1);
-	ph.add_constraint(c_X2_leq_0);
-	return Termination.termination_test_MS_NNC_Polyhedron(ph);
+        ph.add_constraint(c_XP2_eq_1);
+        ph.add_constraint(c_X1_geq_1);
+        ph.add_constraint(c_X1_minus_XP1_geq_1);
+        ph.add_constraint(c_X2_leq_0);
+        return Termination.termination_test_MS_NNC_Polyhedron(ph);
     }
 
     public static void main(String[] args) {
         Parma_Polyhedra_Library.initialize_library();
-	boolean test_result_ok =
-	    Test_Executor.executeTests(NNC_Polyhedron_test1.class);
+        boolean test_result_ok =
+            Test_Executor.executeTests(NNC_Polyhedron_test1.class);
         Parma_Polyhedra_Library.finalize_library();
-	if (!test_result_ok)
-	    System.exit(1);
-	System.exit(0);
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
     }
 
 }
diff --git a/interfaces/Java/tests/PIP_Problem_test1.java b/interfaces/Java/tests/PIP_Problem_test1.java
index 64bf3be..bde8178 100644
--- a/interfaces/Java/tests/PIP_Problem_test1.java
+++ b/interfaces/Java/tests/PIP_Problem_test1.java
@@ -1,7 +1,7 @@
 /* Test PIP_Problem Java test class of the Parma Polyhedra Library Java
    interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,55 +22,51 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.math.BigInteger;
-import java.util.Iterator;
-import java.util.Vector;
 import parma_polyhedra_library.*;
 
-
 public class PIP_Problem_test1 {
-static {
-    try {
-        System.loadLibrary("ppl_java");
-    }
-    catch (UnsatisfiedLinkError  e) {
-        System.out.println("Unable to load the library");
-        System.out.println(e.getMessage());
-        System.exit(-1);
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
     }
-}
 
     // This code tests the PIP_Problem methods.
     public static boolean test01() {
-	Variable A = new Variable(0);
-	Variable B = new Variable(1);
-	Variable C = new Variable(2);
-	Variable D = new Variable(3);
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Variable C = new Variable(2);
+        Variable D = new Variable(3);
         Variables_Set var_set_D = new Variables_Set();
         var_set_D.add(D);
-	Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
-	Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
-	Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
-	Linear_Expression_Variable le_d = new Linear_Expression_Variable(D);
+        Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
+        Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Linear_Expression_Variable le_d = new Linear_Expression_Variable(D);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_3 = new Coefficient(3);
         Coefficient coeff_5 = new Coefficient(5);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
-	Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
+        Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
 
-	// Constraint declarations.
-	Constraint c_a_geq_1
+        // Constraint declarations.
+        Constraint c_a_geq_1
           = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_a_leq_5
+        Constraint c_a_leq_5
           = new Constraint(le_a, Relation_Symbol.LESS_OR_EQUAL, le_5);
-	Constraint c_b_geq_3
+        Constraint c_b_geq_3
           = new Constraint(le_b, Relation_Symbol.GREATER_OR_EQUAL, le_3);
-	Constraint c_d_leq_1
+        Constraint c_d_leq_1
           = new Constraint(le_d, Relation_Symbol.LESS_OR_EQUAL, le_1);
-	Constraint constraint1 = c_a_geq_1;
-	Constraint constraint2 = c_b_geq_3;
-	Constraint_System constraints1 = new Constraint_System();
+        Constraint constraint1 = c_a_geq_1;
+        Constraint constraint2 = c_b_geq_3;
+        Constraint_System constraints1 = new Constraint_System();
         constraints1.add(constraint1);
         C_Polyhedron ph1 = new C_Polyhedron(3, Degenerate_Element.UNIVERSE);
         ph1.add_constraints(constraints1);
@@ -78,7 +74,7 @@ static {
         ph2.add_constraints(constraints1);
         ph2.add_constraint(constraint2);
 
-	PIP_Problem pip1 = new PIP_Problem(3);
+        PIP_Problem pip1 = new PIP_Problem(3);
         pip1.add_constraints(constraints1);
         Constraint pip1_c1 = pip1.constraint_at_index(0);
         long pip1_dim = pip1.space_dimension();
@@ -96,8 +92,8 @@ static {
         pip3.add_constraint(constraint2);
         ok = ok && (pip3.space_dimension() == 4);
 
-	Constraint constraint4 = c_d_leq_1;
-	Constraint_System constraints4 = new Constraint_System();
+        Constraint constraint4 = c_d_leq_1;
+        Constraint_System constraints4 = new Constraint_System();
         constraints4.add(constraint1);
         constraints4.add(constraint4);
         PIP_Problem pip4 = new PIP_Problem(4, constraints4, var_set_D);
@@ -105,37 +101,37 @@ static {
              && (pip4.space_dimension() == 4)
              && (pip4.number_of_parameter_space_dimensions() == 1);
 
-	return ok;
+        return ok;
     }
 
     // This code tests more PIP_Problem methods.
     public static boolean test02() {
-	Variable A = new Variable(0);
-	Variable B = new Variable(1);
-	Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
         Coefficient coeff_0 = new Coefficient(0);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_5 = new Coefficient(5);
         Coefficient coeff_8 = new Coefficient(8);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
-	Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
+        Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
 
-	// Constraint declarations.
-	Constraint c_a_geq_1
+        // Constraint declarations.
+        Constraint c_a_geq_1
           = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_a_leq_5
+        Constraint c_a_leq_5
           = new Constraint(le_a, Relation_Symbol.LESS_OR_EQUAL, le_5);
-	Constraint c_a_eq_8
+        Constraint c_a_eq_8
           = new Constraint(le_a, Relation_Symbol.EQUAL, le_8);
-	Constraint constraint1 = c_a_geq_1;
-	Constraint_System constraints1 = new Constraint_System();
+        Constraint constraint1 = c_a_geq_1;
+        Constraint_System constraints1 = new Constraint_System();
         constraints1.add(constraint1);
 
         Variables_Set var_set_B = new Variables_Set();
         var_set_B.add(B);
 
-	PIP_Problem pip1 = new PIP_Problem(2);
+        PIP_Problem pip1 = new PIP_Problem(2);
         pip1.add_constraints(constraints1);
          long pip1_dim = pip1.space_dimension();
         pip1.add_to_parameter_space_dimensions(var_set_B);
@@ -149,12 +145,12 @@ static {
 
         PIP_Problem_Status pip1_status;
         pip1_status = pip1.solve();
-	ok = ok && (pip1_status == PIP_Problem_Status.OPTIMIZED_PIP_PROBLEM);
+        ok = ok && (pip1_status == PIP_Problem_Status.OPTIMIZED_PIP_PROBLEM);
 
         PIP_Problem_Status pip2_status;
         pip1.add_constraint(c_a_leq_5);
         pip2_status = pip1.solve();
-	ok = ok && (pip2_status == PIP_Problem_Status.OPTIMIZED_PIP_PROBLEM);
+        ok = ok && (pip2_status == PIP_Problem_Status.OPTIMIZED_PIP_PROBLEM);
         if (!ok)
           return false;
 
@@ -199,49 +195,49 @@ static {
           && (cp_value4
                 == PIP_Problem_Control_Parameter_Value.CUTTING_STRATEGY_ALL);
 
-	return ok && pip1.OK();
+        return ok && pip1.OK();
     }
 
 
     // This code tests PIP_Tree and its methods.
     public static boolean test03() {
-	Variable A = new Variable(0);
-	Variable B = new Variable(1);
-	Variable C = new Variable(2);
-	Variable D = new Variable(3);
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Variable C = new Variable(2);
+        Variable D = new Variable(3);
         Variables_Set var_set_D = new Variables_Set();
         var_set_D.add(D);
-	Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
-	Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
-	Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
-	Linear_Expression_Variable le_d = new Linear_Expression_Variable(D);
+        Linear_Expression_Variable le_b = new Linear_Expression_Variable(B);
+        Linear_Expression_Variable le_c = new Linear_Expression_Variable(C);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Linear_Expression_Variable le_d = new Linear_Expression_Variable(D);
         Coefficient coeff_0 = new Coefficient(0);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_3 = new Coefficient(3);
         Coefficient coeff_5 = new Coefficient(5);
         Coefficient coeff_8 = new Coefficient(8);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
-	Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
-	Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
+        Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
+        Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
 
-	// Constraint declarations.
-	Constraint c_a_geq_1
+        // Constraint declarations.
+        Constraint c_a_geq_1
           = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_1);
-	Constraint c_a_leq_5
+        Constraint c_a_leq_5
           = new Constraint(le_a, Relation_Symbol.LESS_OR_EQUAL, le_5);
-	Constraint c_a_eq_8
+        Constraint c_a_eq_8
           = new Constraint(le_a, Relation_Symbol.EQUAL, le_8);
-	Constraint c_d_leq_1
+        Constraint c_d_leq_1
           = new Constraint(le_d, Relation_Symbol.LESS_OR_EQUAL, le_1);
-	Constraint constraint1 = c_a_geq_1;
-	Constraint_System constraints1 = new Constraint_System();
+        Constraint constraint1 = c_a_geq_1;
+        Constraint_System constraints1 = new Constraint_System();
         constraints1.add(constraint1);
 
         Variables_Set var_set_B = new Variables_Set();
         var_set_B.add(B);
 
-	PIP_Problem pip1 = new PIP_Problem(2);
+        PIP_Problem pip1 = new PIP_Problem(2);
         pip1.add_constraints(constraints1);
         long pip1_dim = pip1.space_dimension();
         pip1.add_to_parameter_space_dimensions(var_set_B);
@@ -274,8 +270,8 @@ static {
         PPL_Test.println_if_noisy(IO.wrap_string(ptree1.toString(), 4, 64, 60));
         PPL_Test.println_if_noisy();
 
-	Constraint constraint2 = c_d_leq_1;
-	Constraint_System constraints2 = new Constraint_System();
+        Constraint constraint2 = c_d_leq_1;
+        Constraint_System constraints2 = new Constraint_System();
         constraints2.add(constraint1);
         constraints2.add(constraint2);
         PIP_Problem pip2 = new PIP_Problem(4, constraints2, var_set_D);
@@ -302,17 +298,17 @@ static {
 
    // This code is based on test02 in pipproblem1.cc.
     public static boolean test04() {
-	Variable I = new Variable(0);
-	Variable J = new Variable(1);
-	Variable N = new Variable(2);
-	Variable M = new Variable(3);
+        Variable I = new Variable(0);
+        Variable J = new Variable(1);
+        Variable N = new Variable(2);
+        Variable M = new Variable(3);
         Variables_Set params = new Variables_Set();
         params.add(N);
         params.add(M);
-	Linear_Expression_Variable le_i = new Linear_Expression_Variable(I);
-	Linear_Expression_Variable le_j = new Linear_Expression_Variable(J);
-	Linear_Expression_Variable le_n = new Linear_Expression_Variable(N);
-	Linear_Expression_Variable le_m = new Linear_Expression_Variable(M);
+        Linear_Expression_Variable le_i = new Linear_Expression_Variable(I);
+        Linear_Expression_Variable le_j = new Linear_Expression_Variable(J);
+        Linear_Expression_Variable le_n = new Linear_Expression_Variable(N);
+        Linear_Expression_Variable le_m = new Linear_Expression_Variable(M);
         Coefficient coeff_0 = new Coefficient(0);
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_2 = new Coefficient(2);
@@ -321,42 +317,42 @@ static {
         Coefficient coeff_7 = new Coefficient(7);
         Coefficient coeff_8 = new Coefficient(8);
         Coefficient coeff_10 = new Coefficient(10);
-	Linear_Expression le_0 = new Linear_Expression_Coefficient(coeff_0);
-	Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
-	Linear_Expression le_2 = new Linear_Expression_Coefficient(coeff_2);
-	Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
-	Linear_Expression le_4 = new Linear_Expression_Coefficient(coeff_4);
-	Linear_Expression le_7 = new Linear_Expression_Coefficient(coeff_7);
-	Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
-	Linear_Expression le_10 = new Linear_Expression_Coefficient(coeff_10);
-	Linear_Expression le_2i = le_i.times(coeff_2);
-	Linear_Expression le_3j = le_j.times(coeff_3);
-	Linear_Expression le_2i_plus_3j = le_2i.sum(le_3j);
-	Linear_Expression le_4i = le_i.times(coeff_4);
-	Linear_Expression le_4i_diff_j = le_4i.subtract(le_j);
-	Linear_Expression le_m_diff_j = le_m.subtract(le_j);
-	Linear_Expression le_n_diff_i = le_n.subtract(le_i);
-
-	// Constraint declarations.
-	Constraint c_1
+        Linear_Expression le_0 = new Linear_Expression_Coefficient(coeff_0);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Linear_Expression le_2 = new Linear_Expression_Coefficient(coeff_2);
+        Linear_Expression le_3 = new Linear_Expression_Coefficient(coeff_3);
+        Linear_Expression le_4 = new Linear_Expression_Coefficient(coeff_4);
+        Linear_Expression le_7 = new Linear_Expression_Coefficient(coeff_7);
+        Linear_Expression le_8 = new Linear_Expression_Coefficient(coeff_8);
+        Linear_Expression le_10 = new Linear_Expression_Coefficient(coeff_10);
+        Linear_Expression le_2i = le_i.times(coeff_2);
+        Linear_Expression le_3j = le_j.times(coeff_3);
+        Linear_Expression le_2i_plus_3j = le_2i.sum(le_3j);
+        Linear_Expression le_4i = le_i.times(coeff_4);
+        Linear_Expression le_4i_diff_j = le_4i.subtract(le_j);
+        Linear_Expression le_m_diff_j = le_m.subtract(le_j);
+        Linear_Expression le_n_diff_i = le_n.subtract(le_i);
+
+        // Constraint declarations.
+        Constraint c_1
           = new Constraint(le_2i_plus_3j, Relation_Symbol.GREATER_OR_EQUAL,
                            le_8);
-	Constraint c_2
+        Constraint c_2
           = new Constraint(le_4i_diff_j, Relation_Symbol.GREATER_OR_EQUAL,
                            le_4);
-	Constraint c_3
+        Constraint c_3
           = new Constraint(le_m_diff_j, Relation_Symbol.GREATER_OR_EQUAL,
                            le_0);
-	Constraint c_4
+        Constraint c_4
           = new Constraint(le_n_diff_i, Relation_Symbol.GREATER_OR_EQUAL,
                            le_0);
-	Constraint_System cs = new Constraint_System();
+        Constraint_System cs = new Constraint_System();
         cs.add(c_1);
         cs.add(c_2);
         cs.add(c_3);
         cs.add(c_4);
 
-	PIP_Problem pip = new PIP_Problem(4, cs, params);
+        PIP_Problem pip = new PIP_Problem(4, cs, params);
 
         // Known to overflow if PPL uses 8-bits checked integers.
         try {
@@ -392,7 +388,7 @@ static {
         Constraint_System cs1 = root.constraints();
         if (cs1.size() != 1)
           return false;
-        Constraint c = cs.firstElement();
+        Constraint c = cs.get(0);
         Linear_Expression le_left = c.left_hand_side();
         Linear_Expression le_right = c.right_hand_side();
         Relation_Symbol relsym = c.kind();
@@ -417,7 +413,7 @@ static {
         Constraint_System cs2 = t_child.constraints();
         if (cs2.size() != 1)
           return false;
-        Constraint c2 = cs2.firstElement();
+        Constraint c2 = cs2.get(0);
         Linear_Expression le_left2 = c2.left_hand_side();
         Linear_Expression le_right2 = c2.right_hand_side();
         Relation_Symbol relsym2 = c2.kind();
@@ -448,7 +444,7 @@ static {
         // Check artificial parameter.
         if (t_f_child.number_of_artificials() != 1)
           return false;
-        Artificial_Parameter ap = t_f_child.artificials().firstElement();
+        Artificial_Parameter ap = t_f_child.artificials().get(0);
         Linear_Expression ap_le = ap.linear_expression();
         Coefficient ap_den = ap.denominator();
 
@@ -462,7 +458,7 @@ static {
         Constraint_System cs4 = t_f_child.constraints();
         if (cs4.size() != 1)
           return false;
-        Constraint c4 = cs4.firstElement();
+        Constraint c4 = cs4.get(0);
         if (c4.kind() != Relation_Symbol.GREATER_OR_EQUAL)
           return false;
         // Check parametric values.
@@ -474,11 +470,11 @@ static {
 
     public static void main(String[] args) {
         Parma_Polyhedra_Library.initialize_library();
-	boolean test_result_ok =
-	    Test_Executor.executeTests(PIP_Problem_test1.class);
+        boolean test_result_ok =
+            Test_Executor.executeTests(PIP_Problem_test1.class);
         Parma_Polyhedra_Library.finalize_library();
-	if (!test_result_ok)
-	    System.exit(1);
-	System.exit(0);
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
     }
 }
diff --git a/interfaces/Java/tests/PPL_Test.java b/interfaces/Java/tests/PPL_Test.java
index 81eab9b..370ed97 100644
--- a/interfaces/Java/tests/PPL_Test.java
+++ b/interfaces/Java/tests/PPL_Test.java
@@ -1,6 +1,6 @@
 /* Test helper class of the Parma Polyhedra Library Java interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -21,8 +21,6 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.util.Map;
-
 public class PPL_Test {
 
     static boolean NOISY = false;
diff --git a/interfaces/Java/tests/Parma_Polyhedra_Library_test1.java b/interfaces/Java/tests/Parma_Polyhedra_Library_test1.java
index 2042bac..a66f757 100644
--- a/interfaces/Java/tests/Parma_Polyhedra_Library_test1.java
+++ b/interfaces/Java/tests/Parma_Polyhedra_Library_test1.java
@@ -1,7 +1,7 @@
 /* Parma_Polyhedra_Library Java test class of the
    Parma Polyhedra Library Java interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,23 +22,19 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.math.BigInteger;
-import java.util.Iterator;
-import java.util.Vector;
 import parma_polyhedra_library.*;
 
-
 public class Parma_Polyhedra_Library_test1 {
-static {
-    try {
-        System.loadLibrary("ppl_java");
-    }
-    catch (UnsatisfiedLinkError  e) {
-        System.out.println("Unable to load the library");
-        System.out.println(e.getMessage());
-        System.exit(-1);
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
     }
-}
 
     // This code tests the Parma_Polyhedra_Library methods.
     public static boolean test01() {
@@ -66,11 +62,11 @@ static {
 
     public static void main(String[] args) {
         Parma_Polyhedra_Library.initialize_library();
-	boolean test_result_ok =
-	    Test_Executor.executeTests(Parma_Polyhedra_Library_test1.class);
+        boolean test_result_ok =
+            Test_Executor.executeTests(Parma_Polyhedra_Library_test1.class);
         Parma_Polyhedra_Library.finalize_library();
-	if (!test_result_ok)
-	    System.exit(1);
-	System.exit(0);
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
     }
 }
diff --git a/interfaces/Java/tests/Parma_Polyhedra_Library_test2.java b/interfaces/Java/tests/Parma_Polyhedra_Library_test2.java
index e1733da..0f2af4e 100644
--- a/interfaces/Java/tests/Parma_Polyhedra_Library_test2.java
+++ b/interfaces/Java/tests/Parma_Polyhedra_Library_test2.java
@@ -1,7 +1,7 @@
 /* Parma_Polyhedra_Library Java test class of the
    Parma Polyhedra Library Java interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -25,16 +25,16 @@ site: http://bugseng.com/products/ppl/ . */
 import parma_polyhedra_library.*;
 
 public class Parma_Polyhedra_Library_test2 {
-static {
-    try {
-        System.loadLibrary("ppl_java");
-    }
-    catch (UnsatisfiedLinkError  e) {
-        System.out.println("Unable to load the library");
-        System.out.println(e.getMessage());
-        System.exit(-1);
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
     }
-}
 
     // This code tests the timeout functions.
     public static boolean test01() {
@@ -53,12 +53,12 @@ static {
 
     public static void main(String[] args) {
         Parma_Polyhedra_Library.initialize_library();
-	boolean test_result_ok =
-	    Test_Executor.executeTests(Parma_Polyhedra_Library_test2.class);
+        boolean test_result_ok =
+            Test_Executor.executeTests(Parma_Polyhedra_Library_test2.class);
         Parma_Polyhedra_Library.finalize_library();
-	if (!test_result_ok)
-	    System.exit(1);
-	System.exit(0);
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
     }
 
     private static void open_hypercube(int dimension, Polyhedron ph) {
diff --git a/interfaces/Java/tests/Test_Executor.java b/interfaces/Java/tests/Test_Executor.java
index 30895a7..1f533fa 100644
--- a/interfaces/Java/tests/Test_Executor.java
+++ b/interfaces/Java/tests/Test_Executor.java
@@ -1,6 +1,6 @@
 /* Test helper class of the Parma Polyhedra Library Java interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -39,27 +39,27 @@ public class Test_Executor {
     */
     public static boolean executeTests(Class c) {
         PPL_Test.initialize();
-	boolean global_test_result_ok = true;
-	System.out.println("Checking " + c.getName());
-	Method methods[] = c.getDeclaredMethods();
+        boolean global_test_result_ok = true;
+        System.out.println("Checking " + c.getName());
+        Method methods[] = c.getDeclaredMethods();
         Object[] no_args = new Object[0];
-	for (Method currentMethod:methods) {
-	    try {
-		if (currentMethod.getName().startsWith("test")) {
-		    System.out.println("Executing " + currentMethod.getName());
-		    boolean ok = (Boolean) currentMethod.invoke(null, no_args);
-		    if (!ok) {
-			global_test_result_ok = false;
-			System.out.println(currentMethod.getName() + " failed");
-		    }
-		}
-	    }
-	    catch (Exception e) {
+        for (Method currentMethod:methods) {
+            try {
+                if (currentMethod.getName().startsWith("test")) {
+                    System.out.println("Executing " + currentMethod.getName());
+                    boolean ok = (Boolean) currentMethod.invoke(null, no_args);
+                    if (!ok) {
+                        global_test_result_ok = false;
+                        System.out.println(currentMethod.getName() + " failed");
+                    }
+                }
+            }
+            catch (Exception e) {
                 System.out.println("Unexpected exception caught.");
                 System.out.println(e.getMessage());
-		return false;
-	    }
-	}
-	return global_test_result_ok;
+                return false;
+            }
+        }
+        return global_test_result_ok;
     }
 }
diff --git a/interfaces/Java/tests/Variable_Output_test1.java b/interfaces/Java/tests/Variable_Output_test1.java
new file mode 100644
index 0000000..ad26dd8
--- /dev/null
+++ b/interfaces/Java/tests/Variable_Output_test1.java
@@ -0,0 +1,94 @@
+/* Test customization of variable output in Java.
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+import parma_polyhedra_library.*;
+
+public class Variable_Output_test1 {
+    static {
+        try {
+            System.loadLibrary("ppl_java");
+        }
+        catch (UnsatisfiedLinkError  e) {
+            System.out.println("Unable to load the library");
+            System.out.println(e.getMessage());
+            System.exit(-1);
+        }
+    }
+
+    public static boolean test01() {
+        Variable A = new Variable(0);
+        Variable B = new Variable(1);
+        Variable C = new Variable(2);
+        Linear_Expression_Variable le_a = new Linear_Expression_Variable(A);
+        Coefficient coeff_1 = new Coefficient(1);
+        Linear_Expression le_1 = new Linear_Expression_Coefficient(coeff_1);
+        Constraint con
+          = new Constraint(le_a, Relation_Symbol.GREATER_OR_EQUAL, le_1);
+        C_Polyhedron ph = new C_Polyhedron(1, Degenerate_Element.UNIVERSE);
+        ph.add_constraint(con);
+        boolean ok = false;
+
+        // Printing with default output function.
+        ok = (A.toString().equals("A") &&
+              B.toString().equals("B") &&
+              C.toString().equals("C") &&
+              con.toString().equals("A >= 1") &&
+              ph.toString().equals("A >= 1"));
+        if (!ok)
+          return false;
+
+        // Changing output function to custom one.
+        Variable_Stringifier vs = new Custom_Variable_Stringifier();
+        Variable.setStringifier(vs);
+
+        ok = (A.toString().equals("Var_0") &&
+              B.toString().equals("Var_1") &&
+              C.toString().equals("Var_2") &&
+              con.toString().equals("Var_0 >= 1") &&
+              ph.toString().equals("Var_0 >= 1"));
+        if (!ok)
+            return false;
+
+        // Restoring default output function.
+        Variable.setStringifier(null);
+
+        ok = (A.toString().equals("A") &&
+              B.toString().equals("B") &&
+              C.toString().equals("C") &&
+              con.toString().equals("A >= 1") &&
+              ph.toString().equals("A >= 1"));
+        if (!ok)
+          return false;
+
+        return ok;
+    }
+
+    public static void main(String[] args) {
+        Parma_Polyhedra_Library.initialize_library();
+        boolean test_result_ok =
+            Test_Executor.executeTests(Variable_Output_test1.class);
+        Parma_Polyhedra_Library.finalize_library();
+        if (!test_result_ok)
+            System.exit(1);
+        System.exit(0);
+    }
+}
diff --git a/interfaces/Java/tests/ppl_interface_generator_java_test_java.m4 b/interfaces/Java/tests/ppl_interface_generator_java_test_java.m4
index f464b25..b5fbcf2 100644
--- a/interfaces/Java/tests/ppl_interface_generator_java_test_java.m4
+++ b/interfaces/Java/tests/ppl_interface_generator_java_test_java.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_java_classes_test.java
 dnl using the code in ppl_interface_generator_java_test_code.m4.
 dnl
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Java/tests/ppl_interface_generator_java_test_java_code.m4 b/interfaces/Java/tests/ppl_interface_generator_java_test_java_code.m4
index 51c17ad..d166ed0 100644
--- a/interfaces/Java/tests/ppl_interface_generator_java_test_java_code.m4
+++ b/interfaces/Java/tests/ppl_interface_generator_java_test_java_code.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 This m4 file contains the code for generating ppl_java_generated_tests.java
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Java/tests/ppl_java_tests_common b/interfaces/Java/tests/ppl_java_tests_common
index b94acc2..5c1c32c 100644
--- a/interfaces/Java/tests/ppl_java_tests_common
+++ b/interfaces/Java/tests/ppl_java_tests_common
@@ -1,6 +1,6 @@
 /* Common code for the PPL Java interface tests.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -21,9 +21,6 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-import java.math.BigInteger;
-import java.util.Iterator;
-import java.util.Vector;
 import parma_polyhedra_library.*;
 
 public class ppl_java_generated_tests {
@@ -74,107 +71,107 @@ public class ppl_java_generated_tests {
         // Initialize output variables.
         PPL_Test.initialize();
 
-	// Coefficient declaration.
-	coeff_0 = new Coefficient("0");
+        // Coefficient declaration.
+        coeff_0 = new Coefficient("0");
         Coefficient coeff_1 = new Coefficient(1);
         Coefficient coeff_2 = new Coefficient(2);
         Coefficient coeff_4 = new Coefficient(4);
-	coeff_5 = new Coefficient("5");
+        coeff_5 = new Coefficient("5");
         Coefficient coeff_10 = new Coefficient("10");
 
-	// Variable declarations.
-	Variable A = new Variable(0);
-	Variable C = new Variable(2);
-	var_C = C;
+        // Variable declarations.
+        Variable A = new Variable(0);
+        Variable C = new Variable(2);
+        var_C = C;
         var_set_A = new Variables_Set();
         var_set_A.add(A);
 
-	// Linear_Expression declarations.
-	Linear_Expression le_0 = new Linear_Expression_Coefficient(coeff_0);
-	Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
-	le_A = new Linear_Expression_Variable(A);
-	Linear_Expression le_2A = le_A.times(coeff_2);
-	Linear_Expression le_C = new Linear_Expression_Variable(C);
-	Linear_Expression le_2A_plus_C = le_2A.sum(le_C);
-	Linear_Expression le_40A_plus_10C = le_2A_plus_C.times(coeff_10);
+        // Linear_Expression declarations.
+        Linear_Expression le_0 = new Linear_Expression_Coefficient(coeff_0);
+        Linear_Expression le_5 = new Linear_Expression_Coefficient(coeff_5);
+        le_A = new Linear_Expression_Variable(A);
+        Linear_Expression le_2A = le_A.times(coeff_2);
+        Linear_Expression le_C = new Linear_Expression_Variable(C);
+        Linear_Expression le_2A_plus_C = le_2A.sum(le_C);
+        Linear_Expression le_40A_plus_10C = le_2A_plus_C.times(coeff_10);
 
-	PPL_Test.print_if_noisy("Printing a linear expression (2A + C): ");
+        PPL_Test.print_if_noisy("Printing a linear expression (2A + C): ");
         PPL_Test.println_if_noisy(le_2A_plus_C.toString());
 
-	// Constraint declarations.
-	Constraint c_5_geq_0
+        // Constraint declarations.
+        Constraint c_5_geq_0
           = new Constraint(le_5, Relation_Symbol.GREATER_OR_EQUAL, le_0);
-	constraint1 = c_5_geq_0;
-	Constraint c_C_eq_5
+        constraint1 = c_5_geq_0;
+        Constraint c_C_eq_5
           = new Constraint(le_C, Relation_Symbol.EQUAL, le_5);
-	Constraint c_2A_eq_5
+        Constraint c_2A_eq_5
           = new Constraint(le_2A, Relation_Symbol.EQUAL, le_5);
-	Constraint c_2A_plus_C_eq_2A
+        Constraint c_2A_plus_C_eq_2A
           = new Constraint(le_2A_plus_C, Relation_Symbol.EQUAL, le_2A);
-	Constraint c_2A_plus_C_geq_5
+        Constraint c_2A_plus_C_geq_5
           = new Constraint(le_2A_plus_C,
-		           Relation_Symbol.GREATER_OR_EQUAL,
-			   le_5);
-	PPL_Test.print_if_noisy("Printing a constraint (2A + C >= 5): ");
-	PPL_Test.println_if_noisy(c_2A_plus_C_geq_5.toString());
-
-	Congruence cg_2A_eq_5 = new Congruence(le_2A, le_5, coeff_0);
-	Congruence cg_C_eq_5 = new Congruence(le_C, le_5, coeff_0);
-	Congruence cg_C_int = new Congruence(le_C, le_0, coeff_1);
-	congruence1 = cg_2A_eq_5;
-	PPL_Test.print_if_noisy("Printing a congruence (2A == 5): ");
+                           Relation_Symbol.GREATER_OR_EQUAL,
+                           le_5);
+        PPL_Test.print_if_noisy("Printing a constraint (2A + C >= 5): ");
+        PPL_Test.println_if_noisy(c_2A_plus_C_geq_5.toString());
+
+        Congruence cg_2A_eq_5 = new Congruence(le_2A, le_5, coeff_0);
+        Congruence cg_C_eq_5 = new Congruence(le_C, le_5, coeff_0);
+        Congruence cg_C_int = new Congruence(le_C, le_0, coeff_1);
+        congruence1 = cg_2A_eq_5;
+        PPL_Test.print_if_noisy("Printing a congruence (2A == 5): ");
         PPL_Test.println_if_noisy(cg_2A_eq_5.toString());
 
-	// Constraint_System declarations.
-	constraints1 = new Constraint_System();
-	constraints1.add(c_5_geq_0);
-	constraints1.add(c_C_eq_5);
-	PPL_Test.print_if_noisy("Printing a constraint system (C == 5):");
-	PPL_Test.println_if_noisy(constraints1.toString());
-
-	constraints2 = new Constraint_System();
-	constraints2.add(c_2A_plus_C_eq_2A);
-	constraints2.add(c_2A_eq_5);
-
-	congruences1 = new Congruence_System();
-	congruences1.add(cg_2A_eq_5);
-	congruences1.add(cg_C_eq_5);
-	PPL_Test.print_if_noisy("Printing a congruence system: ");
-	PPL_Test.println_if_noisy(congruences1.toString());
-
-	congruences2 = new Congruence_System();
-	congruences2.add(cg_C_int);
-
-	// Generator declarations.
-	Generator g1 = Generator.point(le_40A_plus_10C, coeff_1);
-	generator1 = g1;
-	Generator g2 = Generator.point(le_40A_plus_10C, coeff_2);
-	Generator g4 = Generator.point(le_A, coeff_4);
-	PPL_Test.print_if_noisy("Printing a generator (p(40A + 10C)):");
-	PPL_Test.println_if_noisy(g1.toString());
+        // Constraint_System declarations.
+        constraints1 = new Constraint_System();
+        constraints1.add(c_5_geq_0);
+        constraints1.add(c_C_eq_5);
+        PPL_Test.print_if_noisy("Printing a constraint system (C == 5):");
+        PPL_Test.println_if_noisy(constraints1.toString());
+
+        constraints2 = new Constraint_System();
+        constraints2.add(c_2A_plus_C_eq_2A);
+        constraints2.add(c_2A_eq_5);
+
+        congruences1 = new Congruence_System();
+        congruences1.add(cg_2A_eq_5);
+        congruences1.add(cg_C_eq_5);
+        PPL_Test.print_if_noisy("Printing a congruence system: ");
+        PPL_Test.println_if_noisy(congruences1.toString());
+
+        congruences2 = new Congruence_System();
+        congruences2.add(cg_C_int);
+
+        // Generator declarations.
+        Generator g1 = Generator.point(le_40A_plus_10C, coeff_1);
+        generator1 = g1;
+        Generator g2 = Generator.point(le_40A_plus_10C, coeff_2);
+        Generator g4 = Generator.point(le_A, coeff_4);
+        PPL_Test.print_if_noisy("Printing a generator (p(40A + 10C)):");
+        PPL_Test.println_if_noisy(g1.toString());
 
         // Generator_System declaration.
         generators1 = new Generator_System();
         generators1.add(g1);
         generators1.add(g2);
         generators1.add(g4);
-	PPL_Test.print_if_noisy("Printing a generator system: ");
-	PPL_Test.println_if_noisy(generators1.toString());
+        PPL_Test.print_if_noisy("Printing a generator system: ");
+        PPL_Test.println_if_noisy(generators1.toString());
 
-	// Grid_Generator declarations.
-	Grid_Generator gg1
+        // Grid_Generator declarations.
+        Grid_Generator gg1
           = Grid_Generator.grid_point(le_40A_plus_10C, coeff_1);
-	grid_generator1 = gg1;
-	Grid_Generator gg2
+        grid_generator1 = gg1;
+        Grid_Generator gg2
           = Grid_Generator.grid_point(le_40A_plus_10C, coeff_2);
- 	Grid_Generator gg4
+        Grid_Generator gg4
           = Grid_Generator.grid_point(le_A, coeff_4);
 
-	// Grid_Generator_System declaration.
-	grid_generators1 = new Grid_Generator_System();
-	grid_generators1.add(gg1);
-	grid_generators1.add(gg2);
-	grid_generators1.add(gg4);
+        // Grid_Generator_System declaration.
+        grid_generators1 = new Grid_Generator_System();
+        grid_generators1.add(gg1);
+        grid_generators1.add(gg2);
+        grid_generators1.add(gg4);
 
         bool_by_ref1 = new By_Reference<Boolean>(true);
         bool_by_ref2 = new By_Reference<Boolean>(true);
@@ -183,9 +180,9 @@ public class ppl_java_generated_tests {
         zero_by_ref1 = new By_Reference<Integer>(0);
 
         partial_function = new Partial_Function();
-	partial_function.insert(0, 2);
-	partial_function.insert(2, 0);
-	partial_function.insert(1, 1);
+        partial_function.insert(0, 2);
+        partial_function.insert(2, 0);
+        partial_function.insert(1, 1);
     }
 
     // Helper method.
diff --git a/interfaces/Makefile.am b/interfaces/Makefile.am
index 3811fd7..c467f3d 100644
--- a/interfaces/Makefile.am
+++ b/interfaces/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Makefile.in b/interfaces/Makefile.in
index 498d7b3..ad5e8d6 100644
--- a/interfaces/Makefile.in
+++ b/interfaces/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,7 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces
 DIST_COMMON = $(noinst_HEADERS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -92,12 +108,18 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -107,6 +129,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 HEADERS = $(noinst_HEADERS)
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
@@ -401,12 +428,12 @@ clean-libtool:
 	-rm -rf .libs _libs
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -416,7 +443,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -430,37 +461,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -469,6 +469,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -532,6 +536,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -567,13 +585,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -699,22 +714,22 @@ ps-am:
 uninstall-am:
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all check \
-	ctags-recursive install install-am install-strip \
-	tags-recursive
+	cscopelist-recursive ctags-recursive install install-am \
+	install-strip tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-generic clean-libtool \
-	ctags ctags-recursive distclean distclean-generic \
-	distclean-libtool distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-pdf install-pdf-am \
-	install-ps install-ps-am install-strip installcheck \
-	installcheck-am installdirs installdirs-am maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-generic \
-	mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \
-	uninstall uninstall-am
+	cscopelist cscopelist-recursive ctags ctags-recursive \
+	distclean distclean-generic distclean-libtool distclean-tags \
+	distdir dvi dvi-am html html-am info info-am install \
+	install-am install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-man \
+	install-pdf install-pdf-am install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	installdirs-am maintainer-clean maintainer-clean-generic \
+	mostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \
+	ps ps-am tags tags-recursive uninstall uninstall-am
 
 
 ppl_interface_instantiations.m4: Makefile
diff --git a/interfaces/OCaml/Makefile.am b/interfaces/OCaml/Makefile.am
index f7dd04f..b5e05ac 100644
--- a/interfaces/OCaml/Makefile.am
+++ b/interfaces/OCaml/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -72,8 +72,8 @@ ppl_ocaml_domains_cc_files.stamp
 pkglib_LIBRARIES = libppl_ocaml.a
 
 libppl_ocaml_a_SOURCES = \
-ppl_ocaml_common.defs.hh \
-ppl_ocaml_common.inlines.hh \
+ppl_ocaml_common_defs.hh \
+ppl_ocaml_common_inlines.hh \
 ppl_ocaml_common.cc
 
 nodist_EXTRA_libppl_ocaml_a_SOURCES = \
@@ -216,16 +216,16 @@ ppl_ocaml.o: ppl_ocaml.cmx
 	fi
 
 ppl_ocaml.cmi: ppl_ocaml.mli
-	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) $<
+	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) ppl_ocaml.mli
 
 ppl_ocaml_globals.cmo: ppl_ocaml_globals.ml ppl_ocaml_globals.cmi
 	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) \
-		$(srcdir)/ppl_ocaml_globals.ml
+	    $(srcdir)/ppl_ocaml_globals.ml
 
 ppl_ocaml_globals.cmx: \
 	ppl_ocaml_globals.ml ppl_ocaml_globals.cmi
 	$(OCAMLOPT_ENV) $(OCAMLOPT) -o $@ -c $(OCAMLOPT_COMPILE_FLAGS) \
-		$(srcdir)/ppl_ocaml_globals.ml
+	    $(srcdir)/ppl_ocaml_globals.ml
 
 ppl_ocaml_globals.o: ppl_ocaml_globals.cmx
 	@if test -f $@; then :; else \
@@ -234,20 +234,21 @@ ppl_ocaml_globals.o: ppl_ocaml_globals.cmx
 	fi
 
 ppl_ocaml_globals.cmi: ppl_ocaml_globals.mli
-	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) $<
+	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) \
+	    $(srcdir)/ppl_ocaml_globals.mli
 
 ppl_ocaml.ml: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_ml.m4 > $@
+	    $(srcdir)/ppl_interface_generator_ocaml_ml.m4 > $@
 
 ppl_ocaml.mli: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_mli.m4 > $@
+	    $(srcdir)/ppl_interface_generator_ocaml_mli.m4 > $@
 
 ppl_ocaml_domains_cc_files.stamp: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_cc_files.m4 \
-                > ppl_ocaml_cc_blob
+	    $(srcdir)/ppl_interface_generator_ocaml_cc_files.m4 \
+		> ppl_ocaml_cc_blob
 	$(top_srcdir)/utils/cm_cleaner.sh ./ppl_ocaml_cc_blob
 	$(top_srcdir)/utils/cm_splitter.sh ./ppl_ocaml_cc_blob
 	rm -f ppl_ocaml_cc_blob
@@ -255,8 +256,8 @@ ppl_ocaml_domains_cc_files.stamp: $(interface_generator_dependencies)
 
 ppl_ocaml_domains.hh: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_hh_files.m4 \
-                > ppl_ocaml_hh_blob
+	    $(srcdir)/ppl_interface_generator_ocaml_hh_files.m4 \
+		> ppl_ocaml_hh_blob
 	$(top_srcdir)/utils/cm_cleaner.sh ./ppl_ocaml_hh_blob
 	$(top_srcdir)/utils/cm_splitter.sh ./ppl_ocaml_hh_blob
 	rm -f ppl_ocaml_hh_blob
diff --git a/interfaces/OCaml/Makefile.in b/interfaces/OCaml/Makefile.in
index d417a32..fc29078 100644
--- a/interfaces/OCaml/Makefile.in
+++ b/interfaces/OCaml/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/OCaml
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -124,13 +141,23 @@ LIBRARIES = $(pkglib_LIBRARIES)
 ARFLAGS = cru
 AM_V_AR = $(am__v_AR_ at AM_V@)
 am__v_AR_ = $(am__v_AR_ at AM_DEFAULT_V@)
-am__v_AR_0 = @echo "  AR    " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_AR_0 = @echo "  AR      " $@;
+am__v_AR_1 = 
 libppl_ocaml_a_AR = $(AR) $(ARFLAGS)
 am_libppl_ocaml_a_OBJECTS = ppl_ocaml_common.$(OBJEXT)
 libppl_ocaml_a_OBJECTS = $(am_libppl_ocaml_a_OBJECTS)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -140,20 +167,23 @@ CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \
 	$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -162,17 +192,16 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_ocaml_a_SOURCES) \
 	$(nodist_EXTRA_libppl_ocaml_a_SOURCES)
 DIST_SOURCES = $(libppl_ocaml_a_SOURCES)
@@ -183,6 +212,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(ocaml_DATA)
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
@@ -448,8 +482,8 @@ ppl_ocaml_domains_cc_files.stamp
 
 pkglib_LIBRARIES = libppl_ocaml.a
 libppl_ocaml_a_SOURCES = \
-ppl_ocaml_common.defs.hh \
-ppl_ocaml_common.inlines.hh \
+ppl_ocaml_common_defs.hh \
+ppl_ocaml_common_inlines.hh \
 ppl_ocaml_common.cc
 
 nodist_EXTRA_libppl_ocaml_a_SOURCES = \
@@ -614,7 +648,6 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-pkglibLIBRARIES: $(pkglib_LIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkglibdir)" || $(MKDIR_P) "$(DESTDIR)$(pkglibdir)"
 	@list='$(pkglib_LIBRARIES)'; test -n "$(pkglibdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -622,6 +655,8 @@ install-pkglibLIBRARIES: $(pkglib_LIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkglibdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkglibdir)" || exit 1; \
 	  echo " $(INSTALL_DATA) $$list2 '$(DESTDIR)$(pkglibdir)'"; \
 	  $(INSTALL_DATA) $$list2 "$(DESTDIR)$(pkglibdir)" || exit $$?; }
 	@$(POST_INSTALL)
@@ -754,8 +789,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-ocamlDATA: $(ocaml_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(ocamldir)" || $(MKDIR_P) "$(DESTDIR)$(ocamldir)"
 	@list='$(ocaml_DATA)'; test -n "$(ocamldir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(ocamldir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(ocamldir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -772,12 +810,12 @@ uninstall-ocamlDATA:
 	dir='$(DESTDIR)$(ocamldir)'; $(am__uninstall_files_from_dir)
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -787,7 +825,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -801,37 +843,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -840,6 +851,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -903,6 +918,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -938,13 +967,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -1079,24 +1105,25 @@ ps-am:
 uninstall-am: uninstall-ocamlDATA uninstall-pkglibLIBRARIES
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all check \
-	ctags-recursive install install-am install-strip \
-	tags-recursive
+	cscopelist-recursive ctags-recursive install install-am \
+	install-strip tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-generic clean-libtool \
-	clean-pkglibLIBRARIES ctags ctags-recursive distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-data install-data-am install-dvi \
-	install-dvi-am install-exec install-exec-am install-html \
-	install-html-am install-info install-info-am install-man \
-	install-ocamlDATA install-pdf install-pdf-am \
-	install-pkglibLIBRARIES install-ps install-ps-am install-strip \
-	installcheck installcheck-am installdirs installdirs-am \
-	maintainer-clean maintainer-clean-generic mostlyclean \
-	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
-	pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am \
-	uninstall-ocamlDATA uninstall-pkglibLIBRARIES
+	clean-pkglibLIBRARIES cscopelist cscopelist-recursive ctags \
+	ctags-recursive distclean distclean-compile distclean-generic \
+	distclean-libtool distclean-tags distdir dvi dvi-am html \
+	html-am info info-am install install-am install-data \
+	install-data-am install-dvi install-dvi-am install-exec \
+	install-exec-am install-html install-html-am install-info \
+	install-info-am install-man install-ocamlDATA install-pdf \
+	install-pdf-am install-pkglibLIBRARIES install-ps \
+	install-ps-am install-strip installcheck installcheck-am \
+	installdirs installdirs-am maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-compile \
+	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags tags-recursive uninstall uninstall-am uninstall-ocamlDATA \
+	uninstall-pkglibLIBRARIES
 
 
 ppl_ocaml.cma: ppl_ocaml_globals.cmo ppl_ocaml.cmo libppl_ocaml.a
@@ -1133,16 +1160,16 @@ ppl_ocaml.o: ppl_ocaml.cmx
 	fi
 
 ppl_ocaml.cmi: ppl_ocaml.mli
-	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) $<
+	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) ppl_ocaml.mli
 
 ppl_ocaml_globals.cmo: ppl_ocaml_globals.ml ppl_ocaml_globals.cmi
 	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) \
-		$(srcdir)/ppl_ocaml_globals.ml
+	    $(srcdir)/ppl_ocaml_globals.ml
 
 ppl_ocaml_globals.cmx: \
 	ppl_ocaml_globals.ml ppl_ocaml_globals.cmi
 	$(OCAMLOPT_ENV) $(OCAMLOPT) -o $@ -c $(OCAMLOPT_COMPILE_FLAGS) \
-		$(srcdir)/ppl_ocaml_globals.ml
+	    $(srcdir)/ppl_ocaml_globals.ml
 
 ppl_ocaml_globals.o: ppl_ocaml_globals.cmx
 	@if test -f $@; then :; else \
@@ -1151,20 +1178,21 @@ ppl_ocaml_globals.o: ppl_ocaml_globals.cmx
 	fi
 
 ppl_ocaml_globals.cmi: ppl_ocaml_globals.mli
-	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) $<
+	$(OCAMLC_ENV) $(OCAMLC) -o $@ -c $(OCAMLC_COMPILE_FLAGS) \
+	    $(srcdir)/ppl_ocaml_globals.mli
 
 ppl_ocaml.ml: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_ml.m4 > $@
+	    $(srcdir)/ppl_interface_generator_ocaml_ml.m4 > $@
 
 ppl_ocaml.mli: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_mli.m4 > $@
+	    $(srcdir)/ppl_interface_generator_ocaml_mli.m4 > $@
 
 ppl_ocaml_domains_cc_files.stamp: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_cc_files.m4 \
-                > ppl_ocaml_cc_blob
+	    $(srcdir)/ppl_interface_generator_ocaml_cc_files.m4 \
+		> ppl_ocaml_cc_blob
 	$(top_srcdir)/utils/cm_cleaner.sh ./ppl_ocaml_cc_blob
 	$(top_srcdir)/utils/cm_splitter.sh ./ppl_ocaml_cc_blob
 	rm -f ppl_ocaml_cc_blob
@@ -1172,8 +1200,8 @@ ppl_ocaml_domains_cc_files.stamp: $(interface_generator_dependencies)
 
 ppl_ocaml_domains.hh: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I.. -I$(srcdir) -I$(srcdir)/.. \
-           $(srcdir)/ppl_interface_generator_ocaml_hh_files.m4 \
-                > ppl_ocaml_hh_blob
+	    $(srcdir)/ppl_interface_generator_ocaml_hh_files.m4 \
+		> ppl_ocaml_hh_blob
 	$(top_srcdir)/utils/cm_cleaner.sh ./ppl_ocaml_hh_blob
 	$(top_srcdir)/utils/cm_splitter.sh ./ppl_ocaml_hh_blob
 	rm -f ppl_ocaml_hh_blob
diff --git a/interfaces/OCaml/OCaml_interface.dox b/interfaces/OCaml/OCaml_interface.dox
index 8cb9c6f..56ceff4 100644
--- a/interfaces/OCaml/OCaml_interface.dox
+++ b/interfaces/OCaml/OCaml_interface.dox
@@ -1,6 +1,6 @@
 /* Documentation for the OCaml interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/OCaml/README.ocaml b/interfaces/OCaml/README.ocaml
index 6b3cc52..b88415d 100644
--- a/interfaces/OCaml/README.ocaml
+++ b/interfaces/OCaml/README.ocaml
@@ -1,5 +1,5 @@
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is free software; as a special exception the author gives
 # unlimited permission to copy and/or distribute it, with or without
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_cc_code.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_cc_code.m4
index f5d4ae0..f07f513 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_cc_code.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_cc_code.m4
@@ -6,7 +6,7 @@ files ppl_ocaml_DOMAIN.cc for each interface domain DOMAIN
 in ppl_interface instantiations.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -67,8 +67,8 @@ extern "C"
 CAMLprim value
 ppl_new_ at TOPOLOGY@@CLASS at _from_space_dimension(value d, value caml_de) try {
   CAMLparam2(d, caml_de);
-  dimension_type dd = value_to_ppl_dimension(d);
-  Degenerate_Element ppl_de = build_ppl_Degenerate_Element(caml_de);
+  const dimension_type dd = value_to_ppl_dimension(d);
+  const Degenerate_Element ppl_de = build_ppl_Degenerate_Element(caml_de);
   @TOPOLOGY@@CPP_CLASS@& ppl_value = *new @TOPOLOGY@@CPP_CLASS@(dd, ppl_de);
   CAMLreturn(unregistered_value_p_ at CLASS@(ppl_value));
 }
@@ -255,7 +255,7 @@ CAMLprim value
 ppl_ at CLASS@_ at BINOP@(value ph1, value ph2) try {
   CAMLparam2(ph1, ph2);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   pph1. at BINOP@(pph2);
   CAMLreturn(Val_unit);
 }
@@ -270,7 +270,7 @@ CAMLprim value
 ppl_ at CLASS@_simplify_using_context_assign(value ph1, value ph2) try {
   CAMLparam2(ph1, ph2);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   CAMLreturn(Val_bool(pph1.simplify_using_context_assign(pph2)));
 }
 CATCH_ALL
@@ -284,7 +284,7 @@ CAMLprim value
 ppl_ at CLASS@_add_space_dimensions_ at EMBEDPROJECT@
 (value ph, value d) try {
   CAMLparam2(ph, d);
-  dimension_type dd = value_to_ppl_dimension(d);
+  const dimension_type dd = value_to_ppl_dimension(d);
   @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
   pph.add_space_dimensions_and_embed(dd);
   CAMLreturn(Val_unit);
@@ -313,7 +313,7 @@ extern "C"
 CAMLprim value
 ppl_ at CLASS@_remove_higher_space_dimensions(value ph, value d) try {
   CAMLparam2(ph, d);
-  dimension_type dd = value_to_ppl_dimension(d);
+  const dimension_type dd = value_to_ppl_dimension(d);
   @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
   pph.remove_higher_space_dimensions(dd);
   CAMLreturn(Val_unit);
@@ -329,7 +329,7 @@ CAMLprim value
 ppl_ at CLASS@_fold_space_dimensions
 (value ph, value caml_vset, value caml_dim) try {
   CAMLparam1(ph);
-  dimension_type ppl_dim = Int_val(caml_dim);
+  const dimension_type ppl_dim = Int_val(caml_dim);
   @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
   Variables_Set ppl_vset;
   if (Int_val(caml_vset) == 0)
@@ -358,8 +358,8 @@ ppl_ at CLASS@_map_space_dimensions(value ph, value caml_mapped_dims) try {
   Partial_Function pfunc;
   while (caml_mapped_dims != Val_emptylist) {
     head = Field(caml_mapped_dims, 0);
-    dimension_type domain_dim = value_to_ppl_dimension(Field(head, 0));
-    dimension_type codomain_dim = value_to_ppl_dimension(Field(head, 1));
+    const dimension_type domain_dim = value_to_ppl_dimension(Field(head, 0));
+    const dimension_type codomain_dim = value_to_ppl_dimension(Field(head, 1));
     pfunc.insert(domain_dim, codomain_dim);
     caml_mapped_dims = Field(caml_mapped_dims, 1);
   }
@@ -378,8 +378,8 @@ CAMLprim value
 ppl_ at CLASS@_expand_space_dimension
 (value ph, value var_index, value m) try {
   CAMLparam3(ph, var_index, m);
-  Variable var = build_ppl_Variable(var_index);
-  dimension_type c_m = value_to_ppl_dimension(m);
+  const Variable var = build_ppl_Variable(var_index);
+  const dimension_type c_m = value_to_ppl_dimension(m);
   @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
   pph.expand_space_dimension(var, c_m);
   CAMLreturn(Val_unit);
@@ -396,7 +396,7 @@ ppl_ at CLASS@_drop_some_non_integer_points
 (value ph, value caml_cc) try {
   CAMLparam1(ph);
   @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
-  Complexity_Class ppl_cc = build_ppl_Complexity_Class(caml_cc);
+  const Complexity_Class ppl_cc = build_ppl_Complexity_Class(caml_cc);
   pph.drop_some_non_integer_points(ppl_cc);
   CAMLreturn(Val_unit);
 }
@@ -421,7 +421,7 @@ ppl_ at CLASS@_drop_some_non_integer_points_2
       break;
     caml_vset = Field(caml_vset, 1);
   }
-  Complexity_Class ppl_cc = build_ppl_Complexity_Class(caml_cc);
+  const Complexity_Class ppl_cc = build_ppl_Complexity_Class(caml_cc);
   pph.drop_some_non_integer_points(ppl_vset, ppl_cc);
   CAMLreturn(Val_unit);
 }
@@ -625,7 +625,7 @@ CAMLprim value
 ppl_ at CLASS@_ at WIDEN@_widening_assign(value ph1, value ph2) try {
   CAMLparam2(ph1, ph2);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   pph1. at WIDEN@_widening_assign(pph2);
   CAMLreturn(Val_unit);
 }
@@ -642,7 +642,7 @@ ppl_ at CLASS@_ at WIDEN@_widening_assign_with_tokens
 (value ph1, value ph2, value tokens) try {
   CAMLparam3(ph1, ph2, tokens);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   unsigned u_tokens = value_to_unsigned<unsigned>(tokens);
   pph1. at WIDEN@_widening_assign(pph2, &u_tokens);
   CAMLreturn(Val_long(u_tokens));
@@ -658,7 +658,7 @@ CAMLprim value
 ppl_ at CLASS@_widening_assign(value ph1, value ph2) try {
   CAMLparam2(ph1, ph2);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   pph1.widening_assign(pph2);
   CAMLreturn(Val_unit);
 }
@@ -674,7 +674,7 @@ ppl_ at CLASS@_widening_assign_with_tokens
 (value ph1, value ph2, value tokens) try {
   CAMLparam3(ph1, ph2, tokens);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   unsigned u_tokens = value_to_unsigned<unsigned>(tokens);
   pph1.widening_assign(pph2, &u_tokens);
   CAMLreturn(Val_long(u_tokens));
@@ -691,8 +691,8 @@ ppl_ at CLASS@_ at LIMITEDBOUNDED@_ at WIDENEXPN@_extrapolation_assign_with_tokens
 (value ph1, value ph2, value caml_cs, value tokens) try {
   CAMLparam4(ph1, ph2, caml_cs, tokens);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
-  @!CONSTRAINER at _System ppl_cs = build_ppl_@!CONSTRAINER at _System(caml_cs);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @!CONSTRAINER at _System ppl_cs = build_ppl_@!CONSTRAINER at _System(caml_cs);
   unsigned u_tokens = value_to_unsigned<unsigned>(tokens);
   pph1. at LIMITEDBOUNDED@_ at WIDENEXPN@_extrapolation_assign(pph2, ppl_cs,
 							 &u_tokens);
@@ -711,8 +711,8 @@ ppl_ at CLASS@_ at LIMITEDBOUNDED@_ at WIDENEXPN@_extrapolation_assign(value ph1,
 						   value caml_cs) try {
   CAMLparam3(ph1, ph2, caml_cs);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
-  @!CONSTRAINER at _System ppl_cs = build_ppl_@!CONSTRAINER at _System(caml_cs);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @!CONSTRAINER at _System ppl_cs = build_ppl_@!CONSTRAINER at _System(caml_cs);
   pph1. at LIMITEDBOUNDED@_ at WIDENEXPN@_extrapolation_assign(pph2, ppl_cs);
   CAMLreturn(Val_unit);
 }
@@ -839,7 +839,7 @@ extern "C"
 CAMLprim value
 ppl_ at CLASS@_ at MEMBYTES@(value ph) try {
   CAMLparam1(ph);
-  @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
+  const @CPP_CLASS@& pph = *p_ at CLASS@_val(ph);
   CAMLreturn(Val_long(pph. at MEMBYTES@()));
 }
 CATCH_ALL
@@ -867,8 +867,8 @@ extern "C"
 CAMLprim value
 ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND@(value ph) try {
   CAMLparam1(ph);
-  @B_FRIEND@& pph = *(reinterpret_cast<@B_FRIEND@*>( p_ at A_FRIEND@_val(ph)));
-  @CPP_CLASS@& ppl_value
+  @B_FRIEND@& pph = *(reinterpret_cast<@B_FRIEND@*>(p_ at A_FRIEND@_val(ph)));
+  const @CPP_CLASS@& ppl_value
     = *(reinterpret_cast<@CPP_CLASS@*>(new @TOPOLOGY@@CPP_CLASS@(pph)));
   CAMLreturn(unregistered_value_p_ at CLASS@(ppl_value));
 }
@@ -883,7 +883,7 @@ CAMLprim value
 ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND at _with_complexity(value ph, value caml_cc) try {
   CAMLparam1(ph);
   @B_FRIEND@& pph = *(reinterpret_cast<@B_FRIEND@*>( p_ at A_FRIEND@_val(ph)));
-  Complexity_Class ppl_cc = build_ppl_Complexity_Class(caml_cc);
+  const Complexity_Class ppl_cc = build_ppl_Complexity_Class(caml_cc);
   @CPP_CLASS@& ppl_value
     = *(reinterpret_cast<@CPP_CLASS@*>(new @TOPOLOGY@@CPP_CLASS@(pph, ppl_cc)));
   CAMLreturn(unregistered_value_p_ at CLASS@(ppl_value));
@@ -959,7 +959,7 @@ ppl_ at CLASS@_ at EXTRAPOLATION@_extrapolation_assign_with_tokens
 (value ph1, value ph2, value tokens) try {
   CAMLparam3(ph1, ph2, tokens);
   @CPP_CLASS@& pph1 = *p_ at CLASS@_val(ph1);
-  @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
+  const @CPP_CLASS@& pph2 = *p_ at CLASS@_val(ph2);
   unsigned u_tokens = value_to_unsigned<unsigned>(tokens);
   pph1. at EXTRAPOLATION@_extrapolation_assign(pph2, &u_tokens);
   CAMLreturn(Val_long(u_tokens));
@@ -1491,9 +1491,9 @@ ppl_ at CLASS@_wrap_assign_native
   }
   build_ppl_bounded_integer_type_representation(rep);
   build_ppl_bounded_integer_type_overflow(oflow);
-  Constraint_System ppl_cs = build_ppl_Constraint_System(cs);
-  unsigned ppl_complexity = value_to_unsigned<unsigned>(complexity);
-  bool ppl_wrap_ind = Bool_val(wrap_ind);
+  const Constraint_System ppl_cs = build_ppl_Constraint_System(cs);
+  const unsigned ppl_complexity = value_to_unsigned<unsigned>(complexity);
+  const bool ppl_wrap_ind = Bool_val(wrap_ind);
   pph.wrap_assign(ppl_vset,
                   build_ppl_bounded_integer_type_width(width),
                   build_ppl_bounded_integer_type_representation(rep),
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_cc_files.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_cc_files.m4
index 178f4d0..a8d2204 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_cc_files.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_cc_files.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_ocaml.cc
 dnl using the code in ppl_interface_generator_ocaml_cc_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_hh_code.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_hh_code.m4
index 94cc9e9..cc6a57c 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_hh_code.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_hh_code.m4
@@ -1,7 +1,7 @@
 dnl Used by ppl_interfaces_generator_ocaml_hh_files.m4
 dnl for generating the access code for the OCaml interface.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_hh_files.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_hh_files.m4
index 5a98205..c39ae9f 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_hh_files.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_hh_files.m4
@@ -7,7 +7,7 @@ dnl in ppl_interface instantiations.m4 using the code in
 dnl ppl_interface_generator_ocaml_hh_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -58,7 +58,7 @@ ___BEGIN_OF_FILE___ ppl_ocaml_domains.hh << ___END_OF_FILE___
 m4_include(`ppl_interface_generator_copyright')`'dnl
 */
 
-`#'include "ppl_ocaml_common.defs.hh"
+`#'include "ppl_ocaml_common_defs.hh"
 m4_all_code
 ___END_OF_FILE___
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_ml.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_ml.m4
index 9317a54..7546b40 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_ml.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_ml.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_ocaml.ml
 dnl using the code in ppl_interface_generator_ocaml_ml_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_ml_code.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_ml_code.m4
index 9dfb5b1..472f86f 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_ml_code.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_ml_code.m4
@@ -4,7 +4,7 @@ sm4_divert(-1)
 This m4 file contains the program code for generating ppl_ocaml.ml
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_mli.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_mli.m4
index ff71553..9208bde 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_mli.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_mli.m4
@@ -5,7 +5,7 @@ dnl This m4 file generates the file ppl_ocaml.mli
 dnl using the code in ppl_interface_generator_ocaml_mli_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_mli_code.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_mli_code.m4
index b357840..cb33cb6 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_mli_code.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_mli_code.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 This m4 file contains the program code for generating ppl_ocaml.mli
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_interface_generator_ocaml_procedure_generators.m4 b/interfaces/OCaml/ppl_interface_generator_ocaml_procedure_generators.m4
index 29866b7..47dfada 100644
--- a/interfaces/OCaml/ppl_interface_generator_ocaml_procedure_generators.m4
+++ b/interfaces/OCaml/ppl_interface_generator_ocaml_procedure_generators.m4
@@ -5,7 +5,7 @@ dnl for the OCaml interface; this includes:
 dnl - the list in the imported file and any OCaml specific procedures.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/ppl_ocaml_common.cc b/interfaces/OCaml/ppl_ocaml_common.cc
index 889dda1..3e39178 100644
--- a/interfaces/OCaml/ppl_ocaml_common.cc
+++ b/interfaces/OCaml/ppl_ocaml_common.cc
@@ -1,6 +1,6 @@
 /* Domain-independent part of the OCaml interface: non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -21,7 +21,7 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-#include "ppl_ocaml_common.defs.hh"
+#include "ppl_ocaml_common_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -360,7 +360,7 @@ get_linear_expression(const R& r) {
   dimension_type varid = 0;
   PPL_DIRTY_TEMP_COEFFICIENT(coeff);
   while (varid < space_dimension
-	 && (coeff = r.coefficient(Variable(varid))) == 0)
+         && (coeff = r.coefficient(Variable(varid))) == 0)
     ++varid;
   if (varid >= space_dimension) {
     zero_mpz = unregistered_value_p_zero_mpz();
@@ -379,21 +379,21 @@ get_linear_expression(const R& r) {
     while (true) {
       ++varid;
       while (varid < space_dimension
-	     && (coeff = r.coefficient(Variable(varid))) == 0)
-	++varid;
+             && (coeff = r.coefficient(Variable(varid))) == 0)
+        ++varid;
       if (varid >= space_dimension)
-	CAMLreturn(term1);
+        CAMLreturn(term1);
       else {
-	ml_le_var2 = caml_alloc(1,0);
-	Store_field(ml_le_var2, 0, ppl_dimension_to_value(varid));
-	term2 = caml_alloc(2,6);
-	ppl_coeff = r.coefficient(Variable(varid));
-	Store_field(term2, 0, build_ocaml_coefficient(ppl_coeff));
-	Store_field(term2, 1, ml_le_var2);
-	sum = caml_alloc(2,4);
-	Store_field(sum, 0, term1);
-	Store_field(sum, 1, term2);
-	term1 = sum;
+        ml_le_var2 = caml_alloc(1,0);
+        Store_field(ml_le_var2, 0, ppl_dimension_to_value(varid));
+        term2 = caml_alloc(2,6);
+        ppl_coeff = r.coefficient(Variable(varid));
+        Store_field(term2, 0, build_ocaml_coefficient(ppl_coeff));
+        Store_field(term2, 1, ml_le_var2);
+        sum = caml_alloc(2,4);
+        Store_field(sum, 0, term1);
+        Store_field(sum, 1, term2);
+        term1 = sum;
       }
     }
   }
@@ -513,7 +513,7 @@ build_ocaml_congruence_system(const Congruence_System& ppl_cgs) {
   CAMLlocal2(result, new_tail);
   result = Val_emptylist;
   for (Congruence_System::const_iterator v_begin = ppl_cgs.begin(),
-  	 v_end = ppl_cgs.end(); v_begin != v_end; ++v_begin) {
+         v_end = ppl_cgs.end(); v_begin != v_end; ++v_begin) {
     new_tail = caml_alloc_tuple(2);
     Store_field(new_tail, 0, build_ocaml_congruence(*v_begin));
     Store_field(new_tail, 1, result);
@@ -528,7 +528,7 @@ build_ocaml_constraint_system(const Constraint_System& ppl_cs) {
   CAMLlocal2(result, new_tail);
   result = Val_emptylist;
   for (Constraint_System::const_iterator v_begin = ppl_cs.begin(),
-  	 v_end = ppl_cs.end(); v_begin != v_end; ++v_begin) {
+         v_end = ppl_cs.end(); v_begin != v_end; ++v_begin) {
     new_tail = caml_alloc_tuple(2);
     Store_field(new_tail, 0, build_ocaml_constraint(*v_begin));
     Store_field(new_tail, 1, result);
@@ -543,7 +543,7 @@ build_ocaml_generator_system(const Generator_System& ppl_gs) {
   CAMLlocal2(result, new_tail);
   result = Val_emptylist;
   for (Generator_System::const_iterator v_begin = ppl_gs.begin(),
-  	 v_end = ppl_gs.end(); v_begin != v_end; ++v_begin) {
+         v_end = ppl_gs.end(); v_begin != v_end; ++v_begin) {
     new_tail = caml_alloc_tuple(2);
     Store_field(new_tail, 0, build_ocaml_generator(*v_begin));
     Store_field(new_tail, 1, result);
@@ -558,7 +558,7 @@ build_ocaml_grid_generator_system(const Grid_Generator_System& ppl_ggs) {
   CAMLlocal2(result, new_tail);
   result = Val_emptylist;
   for (Grid_Generator_System::const_iterator v_begin = ppl_ggs.begin(),
-  	 v_end = ppl_ggs.end(); v_begin != v_end; ++v_begin) {
+         v_end = ppl_ggs.end(); v_begin != v_end; ++v_begin) {
     new_tail = caml_alloc_tuple(2);
     Store_field(new_tail, 0, build_ocaml_grid_generator(*v_begin));
     Store_field(new_tail, 1, result);
@@ -645,13 +645,13 @@ build_ppl_Generator(value g) {
     // Point
     mpz_class z(mpz_ptr_val(Field(g, 1)));
     return Generator::point(build_ppl_Linear_Expression(Field(g, 0)),
-			    Coefficient(z));
+                            Coefficient(z));
   }
   case 3: {
     // Closure_point
     mpz_class z(mpz_ptr_val(Field(g, 1)));
     return Generator::closure_point(build_ppl_Linear_Expression(Field(g, 0)),
-				    Coefficient(z));
+                                    Coefficient(z));
   }
   default:
     throw std::invalid_argument("PPL OCaml interface invalid argument:\n"
@@ -669,13 +669,13 @@ build_ppl_Grid_Generator(value gg) {
      // Parameter
      mpz_class z(mpz_ptr_val(Field(gg, 1)));
      return parameter(build_ppl_Linear_Expression(Field(gg, 0)),
-		      Coefficient(z));
+                      Coefficient(z));
    }
    case 2: {
      // Point
      mpz_class z(mpz_ptr_val(Field(gg, 1)));
      return grid_point(build_ppl_Linear_Expression(Field(gg, 0)),
-		       Coefficient(z));
+                       Coefficient(z));
    }
   default:
     // We should not be here!
@@ -833,7 +833,7 @@ extern "C"
 CAMLprim value
 ppl_new_MIP_Problem_from_space_dimension(value d) try {
   CAMLparam1(d);
-  dimension_type dd = value_to_ppl_dimension(d);
+  const dimension_type dd = value_to_ppl_dimension(d);
   MIP_Problem& ppl_mip = *new MIP_Problem(dd);
   CAMLreturn(unregistered_value_p_MIP_Problem(ppl_mip));
 }
@@ -842,13 +842,13 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_new_MIP_Problem(value d, value caml_cs, value caml_cost,
-		    value caml_opt_mode) try {
+                    value caml_opt_mode) try {
   CAMLparam4(d, caml_cs, caml_cost, caml_opt_mode);
-  dimension_type dd = value_to_ppl_dimension(d);
-  Constraint_System ppl_cs = build_ppl_Constraint_System(caml_cs);
-  Linear_Expression ppl_cost = build_ppl_Linear_Expression(caml_cost);
-  Optimization_Mode ppl_opt_mode = build_ppl_opt_mode(caml_opt_mode);
-  MIP_Problem& ppl_mip = *new MIP_Problem(dd, ppl_cs, ppl_cost,	ppl_opt_mode);
+  const dimension_type dd = value_to_ppl_dimension(d);
+  const Constraint_System ppl_cs = build_ppl_Constraint_System(caml_cs);
+  const Linear_Expression ppl_cost = build_ppl_Linear_Expression(caml_cost);
+  const Optimization_Mode ppl_opt_mode = build_ppl_opt_mode(caml_opt_mode);
+  MIP_Problem& ppl_mip = *new MIP_Problem(dd, ppl_cs, ppl_cost, ppl_opt_mode);
   CAMLreturn(unregistered_value_p_MIP_Problem(ppl_mip));
 }
 CATCH_ALL
@@ -890,7 +890,7 @@ ppl_MIP_Problem_constraints(value caml_mip) try {
   const MIP_Problem& ppl_mip = *p_MIP_Problem_val(caml_mip);
   Constraint_System cs;
   for (MIP_Problem::const_iterator cs_it = ppl_mip.constraints_begin(),
-	 cs_end = ppl_mip.constraints_end(); cs_it != cs_end; ++cs_it) {
+         cs_end = ppl_mip.constraints_end(); cs_it != cs_end; ++cs_it) {
     cs.insert(*cs_it);
   }
   CAMLreturn(build_ocaml_constraint_system(cs));
@@ -901,7 +901,7 @@ extern "C"
 CAMLprim value
 ppl_MIP_Problem_add_space_dimensions_and_embed(value caml_mip, value dim) try {
   CAMLparam2(caml_mip, dim);
-  dimension_type ppl_dim = value_to_ppl_dimension(dim);
+  const dimension_type ppl_dim = value_to_ppl_dimension(dim);
   MIP_Problem& ppl_mip = *p_MIP_Problem_val(caml_mip);
   ppl_mip.add_space_dimensions_and_embed(ppl_dim);
   CAMLreturn(Val_unit);
@@ -911,7 +911,7 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_MIP_Problem_add_to_integer_space_dimensions(value caml_mip,
-						value caml_ivars) try {
+                                                value caml_ivars) try {
   CAMLparam2(caml_mip, caml_ivars);
   MIP_Problem& ppl_mip = *p_MIP_Problem_val(caml_mip);
   ppl_mip.add_to_integer_space_dimensions(build_ppl_Variables_Set(caml_ivars));
@@ -922,7 +922,7 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_MIP_Problem_add_constraint(value caml_mip,
-			       value caml_constraint) try {
+                               value caml_constraint) try {
   CAMLparam2(caml_mip, caml_constraint);
   MIP_Problem& ppl_mip = *p_MIP_Problem_val(caml_mip);
   ppl_mip.add_constraint(build_ppl_Constraint(caml_constraint));
@@ -944,7 +944,7 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_MIP_Problem_set_objective_function(value caml_mip,
-				       value caml_cost) try {
+                                       value caml_cost) try {
   CAMLparam2(caml_mip, caml_cost);
   MIP_Problem& ppl_mip = *p_MIP_Problem_val(caml_mip);
   ppl_mip.set_objective_function(build_ppl_Linear_Expression(caml_cost));
@@ -1067,7 +1067,7 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_MIP_Problem_evaluate_objective_function(value caml_mip,
-					    value caml_generator) try {
+                                            value caml_generator) try {
   CAMLparam2(caml_mip, caml_generator);
   CAMLlocal1(caml_return_value);
   Generator g = build_ppl_Generator(caml_generator);
@@ -1157,7 +1157,7 @@ extern "C"
 CAMLprim value
 ppl_new_PIP_Problem_from_space_dimension(value d) try {
   CAMLparam1(d);
-  dimension_type dd = value_to_ppl_dimension(d);
+  const dimension_type dd = value_to_ppl_dimension(d);
   PIP_Problem& ppl_pip = *new PIP_Problem(dd);
   CAMLreturn(unregistered_value_p_PIP_Problem(ppl_pip));
 }
@@ -1167,8 +1167,8 @@ extern "C"
 CAMLprim value
 ppl_new_PIP_Problem(value d, value caml_cs, value caml_vset) try {
   CAMLparam3(d, caml_cs, caml_vset);
-  dimension_type dd = value_to_ppl_dimension(d);
-  Constraint_System ppl_cs = build_ppl_Constraint_System(caml_cs);
+  const dimension_type dd = value_to_ppl_dimension(d);
+  const Constraint_System ppl_cs = build_ppl_Constraint_System(caml_cs);
   Variables_Set ppl_vset;
   if (Int_val(caml_vset) == 0)
     CAMLreturn(Val_unit);
@@ -1190,7 +1190,7 @@ CAMLprim value
 ppl_PIP_Problem_space_dimension(value pip) try {
   CAMLparam1(pip);
   const PIP_Problem& ppip = *p_PIP_Problem_val(pip);
-  dimension_type d = ppip.space_dimension();
+  const dimension_type d = ppip.space_dimension();
   CAMLreturn(ppl_dimension_to_value(d));
 }
 CATCH_ALL
@@ -1221,7 +1221,7 @@ ppl_PIP_Problem_constraints(value caml_pip) try {
   const PIP_Problem& ppl_pip = *p_PIP_Problem_val(caml_pip);
   Constraint_System cs;
   for (PIP_Problem::const_iterator cs_it = ppl_pip.constraints_begin(),
-	 cs_end = ppl_pip.constraints_end(); cs_it != cs_end; ++cs_it) {
+         cs_end = ppl_pip.constraints_end(); cs_it != cs_end; ++cs_it) {
     cs.insert(*cs_it);
   }
   CAMLreturn(build_ocaml_constraint_system(cs));
@@ -1244,7 +1244,7 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_PIP_Problem_add_to_parameter_space_dimensions(value caml_pip,
-						  value caml_ivars) try {
+                                                  value caml_ivars) try {
   CAMLparam2(caml_pip, caml_ivars);
   PIP_Problem& ppl_pip = *p_PIP_Problem_val(caml_pip);
   ppl_pip.add_to_parameter_space_dimensions
@@ -1256,7 +1256,7 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_PIP_Problem_add_constraint(value caml_pip,
-			       value caml_constraint) try {
+                               value caml_constraint) try {
   CAMLparam2(caml_pip, caml_constraint);
   PIP_Problem& ppl_pip = *p_PIP_Problem_val(caml_pip);
   ppl_pip.add_constraint(build_ppl_Constraint(caml_constraint));
@@ -1278,9 +1278,9 @@ CATCH_ALL
 extern "C"
 CAMLprim value
 ppl_PIP_Problem_set_big_parameter_dimension(value caml_pip,
-				            value caml_dim) try {
+                                            value caml_dim) try {
   CAMLparam2(caml_pip, caml_dim);
-  dimension_type ppl_dim = value_to_ppl_dimension(caml_dim);
+  const dimension_type ppl_dim = value_to_ppl_dimension(caml_dim);
   PIP_Problem& ppl_pip = *p_PIP_Problem_val(caml_pip);
   ppl_pip.set_big_parameter_dimension(ppl_dim);
   CAMLreturn(Val_unit);
@@ -1505,7 +1505,7 @@ ppl_PIP_Tree_Node_artificials(value caml_node) try {
                                 "node is bottom.");
   for (PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
          v_begin = ppl_node->art_parameter_begin(),
-  	 v_end = ppl_node->art_parameter_end(); v_begin != v_end; ++v_begin) {
+         v_end = ppl_node->art_parameter_end(); v_begin != v_end; ++v_begin) {
     new_tail = caml_alloc_tuple(2);
     Store_field(new_tail, 0, build_ocaml_artificial_parameter(*v_begin));
     Store_field(new_tail, 1, result);
diff --git a/interfaces/OCaml/ppl_ocaml_common.defs.hh b/interfaces/OCaml/ppl_ocaml_common.defs.hh
deleted file mode 100644
index 17377fe..0000000
--- a/interfaces/OCaml/ppl_ocaml_common.defs.hh
+++ /dev/null
@@ -1,234 +0,0 @@
-/* Domain-independent part of the OCaml interface: declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_ocaml_common_defs_hh
-#define PPL_ppl_ocaml_common_defs_hh 1
-
-#include "ppl.hh"
-#include "interfaced_boxes.hh"
-#include "marked_pointers.hh"
-
-// Note: throw exception if the error is at the OCaml interface level.
-#define PPL_OCAML_UNEXPECTED \
-  throw std::runtime_error("PPL OCaml interface internal error")
-#define PPL_OCAML_UNEXPECTED_MSG(msg) \
-  throw std::runtime_error("PPL OCaml interface internal error:\n" msg)
-
-
-// OCaml include files.
-extern "C" {
-
-#define CAML_NAME_SPACE
-#include "caml/mlvalues.h"
-#include "caml/memory.h"
-#include "caml/custom.h"
-#include "caml/fail.h"
-#include "caml/callback.h"
-#include "caml/alloc.h"
-#undef CAML_NAME_SPACE
-
-} // extern "C"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace OCaml {
-
-template <typename U_Int>
-U_Int value_to_unsigned(value v);
-
-value
-ppl_dimension_to_value(dimension_type dim);
-
-dimension_type
-value_to_ppl_dimension(value dim);
-
-Variable
-build_ppl_Variable(value var);
-
-Degenerate_Element
-build_ppl_Degenerate_Element(value de);
-
-Complexity_Class
-build_ppl_Complexity_Class(value cc);
-
-Relation_Symbol
-build_ppl_relsym(value caml_relsym);
-
-Bounded_Integer_Type_Overflow
-build_ppl_bounded_integer_type_overflow(value caml_oflow);
-
-Bounded_Integer_Type_Representation
-build_ppl_bounded_integer_type_representation(value caml_rep);
-
-Bounded_Integer_Type_Width
-build_ppl_bounded_integer_type_width(value caml_width);
-
-Coefficient
-build_ppl_Coefficient(value coeff);
-
-Variable
-build_ppl_Variable(value caml_var);
-
-Variables_Set
-build_ppl_Variables_Set(value caml_vset);
-
-Linear_Expression
-build_ppl_Linear_Expression(value e);
-
-Constraint
-build_ppl_Constraint(value c);
-
-Congruence
-build_ppl_Congruence(value c);
-
-Generator
-build_ppl_Generator(value g);
-
-Grid_Generator
-build_ppl_Grid_Generator(value gg);
-
-Constraint_System
-build_ppl_Constraint_System(value cl);
-
-Congruence_System
-build_ppl_Congruence_System(value cgl);
-
-Generator_System
-build_ppl_Generator_System(value gl);
-
-Grid_Generator_System
-build_ppl_Grid_Generator_System(value ggs);
-
-value
-build_ocaml_poly_con_relation(Poly_Con_Relation& r);
-
-value
-build_ocaml_poly_gen_relation(Poly_Gen_Relation& r);
-
-value
-build_ocaml_coefficient(const Coefficient& c);
-
-value
-build_ocaml_constraint(const Constraint& c);
-
-value
-build_ocaml_congruence(const Congruence& cg);
-
-value
-build_ocaml_generator(const Generator& g);
-
-value
-build_ocaml_constraint_system(const Constraint_System& cs);
-
-value
-build_ocaml_congruence_system(const Congruence_System& cgs);
-
-value
-build_ocaml_grid_generator(const Grid_Generator& gg);
-
-value
-build_ocaml_generator_system(const Generator_System& gs);
-
-value
-build_ocaml_grid_generator_system(const Grid_Generator_System& ggs);
-
-class timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-class deterministic_timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-void reset_timeout();
-
-void reset_deterministic_timeout();
-
-} // namespace OCaml
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-#define CATCH_ALL							\
-catch(std::bad_alloc&) {						\
-  caml_raise_out_of_memory();						\
-}									\
-catch(std::invalid_argument& e) {					\
-  caml_invalid_argument(const_cast<char*>(e.what()));			\
-}									\
-catch(std::overflow_error& e) {					        \
-  caml_raise_with_string(*caml_named_value("PPL_arithmetic_overflow"),  \
-                         (const_cast<char*>(e.what())));		\
-}									\
-catch(std::domain_error& e) {					\
-  caml_raise_with_string(*caml_named_value("PPL_domain_error"),  \
-                         (const_cast<char*>(e.what())));		\
-}									\
-catch(std::length_error& e) {					\
-  caml_raise_with_string(*caml_named_value("PPL_length_error"),  \
-                         (const_cast<char*>(e.what())));		\
-}									\
-catch(std::logic_error& e) {						\
-  caml_raise_with_string(*caml_named_value("PPL_logic_error"),		\
-                         (const_cast<char*>(e.what())));		\
-}									\
-catch(std::runtime_error& e) {                                          \
-  caml_raise_with_string(*caml_named_value("PPL_internal_error"),	\
-                         (const_cast<char*>(e.what())));		\
-}									\
-catch(std::exception& e) {						\
-  caml_raise_with_string(*caml_named_value("PPL_unknown_standard_exception"), \
-                         (const_cast<char*>(e.what())));		\
-}									\
-catch(timeout_exception&) {                                             \
-  reset_timeout();                                                      \
-  caml_raise_constant(*caml_named_value("PPL_timeout_exception"));      \
-}                                                                       \
-catch(deterministic_timeout_exception&) {                               \
-  reset_deterministic_timeout();                                        \
-  caml_raise_constant(*caml_named_value("PPL_timeout_exception"));      \
-}                                                                       \
-catch(...) {								\
-  caml_raise_constant(*caml_named_value("PPL_unexpected_error"));	\
-}
-
-#include "ppl_ocaml_common.inlines.hh"
-
-#endif // !defined(PPL_ppl_prolog_common_defs_hh)
diff --git a/interfaces/OCaml/ppl_ocaml_common.inlines.hh b/interfaces/OCaml/ppl_ocaml_common.inlines.hh
deleted file mode 100644
index f9054e5..0000000
--- a/interfaces/OCaml/ppl_ocaml_common.inlines.hh
+++ /dev/null
@@ -1,82 +0,0 @@
-/* Domain-independent part of the OCaml interface: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_ocaml_common_inlines_hh
-#define PPL_ppl_ocaml_common_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace OCaml {
-
-template <typename U_Int>
-U_Int
-value_to_unsigned(value v) {
-  // FIXME: check the following at compile time.
-  assert(std::numeric_limits<U_Int>::is_integer
-         && !std::numeric_limits<U_Int>::is_signed);
-  if (!Is_long(v)) {
-    const char* what = "PPL OCaml interface invalid argument error:\n"
-      "argument is not an integer (expecting a non-negative integer).";
-    throw std::invalid_argument(what);
-  }
-  intnat vv = Long_val(v);
-  if (vv < 0) {
-    const char* what = "PPL OCaml interface invalid argument error:\n"
-      "argument is negative (expecting a non-negative integer).";
-    throw std::invalid_argument(what);
-  }
-  const uintnat u_max = std::numeric_limits<U_Int>::max();
-  if (static_cast<uintnat>(vv) > u_max) {
-    const char* what = "PPL OCaml interface invalid argument:\n"
-      "argument value is too big (expecting a smaller non-negative integer).";
-    throw std::invalid_argument(what);
-  }
-  return static_cast<U_Int>(vv);
-}
-
-inline dimension_type
-value_to_ppl_dimension(value v) {
-  return value_to_unsigned<dimension_type>(v);
-}
-
-inline value
-ppl_dimension_to_value(dimension_type dim) {
-  // FIXME: what if this assertion fails?
-  assert(static_cast<uintnat>(dim) <= static_cast<uintnat>(Max_long));
-  return Val_long(dim);
-}
-
-inline Variable
-build_ppl_Variable(value caml_var) {
-  return Variable(value_to_ppl_dimension(caml_var));
-}
-
-} // namespace OCaml
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_ppl_ocaml_common_inlines_hh)
diff --git a/interfaces/OCaml/ppl_ocaml_common_defs.hh b/interfaces/OCaml/ppl_ocaml_common_defs.hh
new file mode 100644
index 0000000..c6cde29
--- /dev/null
+++ b/interfaces/OCaml/ppl_ocaml_common_defs.hh
@@ -0,0 +1,234 @@
+/* Domain-independent part of the OCaml interface: declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_ocaml_common_defs_hh
+#define PPL_ppl_ocaml_common_defs_hh 1
+
+#include "ppl.hh"
+#include "interfaced_boxes.hh"
+#include "marked_pointers.hh"
+
+// Note: throw exception if the error is at the OCaml interface level.
+#define PPL_OCAML_UNEXPECTED \
+  throw std::runtime_error("PPL OCaml interface internal error")
+#define PPL_OCAML_UNEXPECTED_MSG(msg) \
+  throw std::runtime_error("PPL OCaml interface internal error:\n" msg)
+
+
+// OCaml include files.
+extern "C" {
+
+#define CAML_NAME_SPACE
+#include "caml/mlvalues.h"
+#include "caml/memory.h"
+#include "caml/custom.h"
+#include "caml/fail.h"
+#include "caml/callback.h"
+#include "caml/alloc.h"
+#undef CAML_NAME_SPACE
+
+} // extern "C"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace OCaml {
+
+template <typename U_Int>
+U_Int value_to_unsigned(value v);
+
+value
+ppl_dimension_to_value(dimension_type dim);
+
+dimension_type
+value_to_ppl_dimension(value dim);
+
+Variable
+build_ppl_Variable(value var);
+
+Degenerate_Element
+build_ppl_Degenerate_Element(value de);
+
+Complexity_Class
+build_ppl_Complexity_Class(value cc);
+
+Relation_Symbol
+build_ppl_relsym(value caml_relsym);
+
+Bounded_Integer_Type_Overflow
+build_ppl_bounded_integer_type_overflow(value caml_oflow);
+
+Bounded_Integer_Type_Representation
+build_ppl_bounded_integer_type_representation(value caml_rep);
+
+Bounded_Integer_Type_Width
+build_ppl_bounded_integer_type_width(value caml_width);
+
+Coefficient
+build_ppl_Coefficient(value coeff);
+
+Variable
+build_ppl_Variable(value caml_var);
+
+Variables_Set
+build_ppl_Variables_Set(value caml_vset);
+
+Linear_Expression
+build_ppl_Linear_Expression(value e);
+
+Constraint
+build_ppl_Constraint(value c);
+
+Congruence
+build_ppl_Congruence(value c);
+
+Generator
+build_ppl_Generator(value g);
+
+Grid_Generator
+build_ppl_Grid_Generator(value gg);
+
+Constraint_System
+build_ppl_Constraint_System(value cl);
+
+Congruence_System
+build_ppl_Congruence_System(value cgl);
+
+Generator_System
+build_ppl_Generator_System(value gl);
+
+Grid_Generator_System
+build_ppl_Grid_Generator_System(value ggs);
+
+value
+build_ocaml_poly_con_relation(Poly_Con_Relation& r);
+
+value
+build_ocaml_poly_gen_relation(Poly_Gen_Relation& r);
+
+value
+build_ocaml_coefficient(const Coefficient& c);
+
+value
+build_ocaml_constraint(const Constraint& c);
+
+value
+build_ocaml_congruence(const Congruence& cg);
+
+value
+build_ocaml_generator(const Generator& g);
+
+value
+build_ocaml_constraint_system(const Constraint_System& cs);
+
+value
+build_ocaml_congruence_system(const Congruence_System& cgs);
+
+value
+build_ocaml_grid_generator(const Grid_Generator& gg);
+
+value
+build_ocaml_generator_system(const Generator_System& gs);
+
+value
+build_ocaml_grid_generator_system(const Grid_Generator_System& ggs);
+
+class timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+class deterministic_timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+void reset_timeout();
+
+void reset_deterministic_timeout();
+
+} // namespace OCaml
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+#define CATCH_ALL                                                       \
+catch(std::bad_alloc&) {                                                \
+  caml_raise_out_of_memory();                                           \
+}                                                                       \
+catch(std::invalid_argument& e) {                                       \
+  caml_invalid_argument(const_cast<char*>(e.what()));                   \
+}                                                                       \
+catch(std::overflow_error& e) {                                         \
+  caml_raise_with_string(*caml_named_value("PPL_arithmetic_overflow"),  \
+                         (const_cast<char*>(e.what())));                \
+}                                                                       \
+catch(std::domain_error& e) {                                   \
+  caml_raise_with_string(*caml_named_value("PPL_domain_error"),  \
+                         (const_cast<char*>(e.what())));                \
+}                                                                       \
+catch(std::length_error& e) {                                   \
+  caml_raise_with_string(*caml_named_value("PPL_length_error"),  \
+                         (const_cast<char*>(e.what())));                \
+}                                                                       \
+catch(std::logic_error& e) {                                            \
+  caml_raise_with_string(*caml_named_value("PPL_logic_error"),          \
+                         (const_cast<char*>(e.what())));                \
+}                                                                       \
+catch(std::runtime_error& e) {                                          \
+  caml_raise_with_string(*caml_named_value("PPL_internal_error"),       \
+                         (const_cast<char*>(e.what())));                \
+}                                                                       \
+catch(std::exception& e) {                                              \
+  caml_raise_with_string(*caml_named_value("PPL_unknown_standard_exception"), \
+                         (const_cast<char*>(e.what())));                \
+}                                                                       \
+catch(timeout_exception&) {                                             \
+  reset_timeout();                                                      \
+  caml_raise_constant(*caml_named_value("PPL_timeout_exception"));      \
+}                                                                       \
+catch(deterministic_timeout_exception&) {                               \
+  reset_deterministic_timeout();                                        \
+  caml_raise_constant(*caml_named_value("PPL_timeout_exception"));      \
+}                                                                       \
+catch(...) {                                                            \
+  caml_raise_constant(*caml_named_value("PPL_unexpected_error"));       \
+}
+
+#include "ppl_ocaml_common_inlines.hh"
+
+#endif // !defined(PPL_ppl_prolog_common_defs_hh)
diff --git a/interfaces/OCaml/ppl_ocaml_common_inlines.hh b/interfaces/OCaml/ppl_ocaml_common_inlines.hh
new file mode 100644
index 0000000..ddfd0b5
--- /dev/null
+++ b/interfaces/OCaml/ppl_ocaml_common_inlines.hh
@@ -0,0 +1,82 @@
+/* Domain-independent part of the OCaml interface: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_ocaml_common_inlines_hh
+#define PPL_ppl_ocaml_common_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace OCaml {
+
+template <typename U_Int>
+U_Int
+value_to_unsigned(value v) {
+  // FIXME: check the following at compile time.
+  assert(std::numeric_limits<U_Int>::is_integer
+         && !std::numeric_limits<U_Int>::is_signed);
+  if (!Is_long(v)) {
+    const char* what = "PPL OCaml interface invalid argument error:\n"
+      "argument is not an integer (expecting a non-negative integer).";
+    throw std::invalid_argument(what);
+  }
+  intnat vv = Long_val(v);
+  if (vv < 0) {
+    const char* what = "PPL OCaml interface invalid argument error:\n"
+      "argument is negative (expecting a non-negative integer).";
+    throw std::invalid_argument(what);
+  }
+  const uintnat u_max = std::numeric_limits<U_Int>::max();
+  if (static_cast<uintnat>(vv) > u_max) {
+    const char* what = "PPL OCaml interface invalid argument:\n"
+      "argument value is too big (expecting a smaller non-negative integer).";
+    throw std::invalid_argument(what);
+  }
+  return static_cast<U_Int>(vv);
+}
+
+inline dimension_type
+value_to_ppl_dimension(value v) {
+  return value_to_unsigned<dimension_type>(v);
+}
+
+inline value
+ppl_dimension_to_value(dimension_type dim) {
+  // FIXME: what if this assertion fails?
+  assert(static_cast<uintnat>(dim) <= static_cast<uintnat>(Max_long));
+  return Val_long(dim);
+}
+
+inline Variable
+build_ppl_Variable(value caml_var) {
+  return Variable(value_to_ppl_dimension(caml_var));
+}
+
+} // namespace OCaml
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_ppl_ocaml_common_inlines_hh)
diff --git a/interfaces/OCaml/ppl_ocaml_globals.ml b/interfaces/OCaml/ppl_ocaml_globals.ml
index 11e1d8b..1dd95b5 100644
--- a/interfaces/OCaml/ppl_ocaml_globals.ml
+++ b/interfaces/OCaml/ppl_ocaml_globals.ml
@@ -1,6 +1,6 @@
 (* OCaml interface: domain-independent functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/OCaml/ppl_ocaml_globals.mli b/interfaces/OCaml/ppl_ocaml_globals.mli
index 427e28b..f387e41 100644
--- a/interfaces/OCaml/ppl_ocaml_globals.mli
+++ b/interfaces/OCaml/ppl_ocaml_globals.mli
@@ -1,6 +1,6 @@
 (* OCaml interface: module inteface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/OCaml/tests/Makefile.am b/interfaces/OCaml/tests/Makefile.am
index 3f23f07..20e0034 100644
--- a/interfaces/OCaml/tests/Makefile.am
+++ b/interfaces/OCaml/tests/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -114,7 +114,7 @@ test1$(EXEEXT): test1.cmo ../ppl_ocaml.cma
 	$(OCAMLC_ENV) $(OCAMLC) -o $@ \
 		-cc "$(CXX)" $(OCAMLC_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLC_LINK_FLAGS) \
-		ppl_ocaml.cma $<
+		ppl_ocaml.cma test1.cmo
 
 test1_opt_SOURCES = test1.ml
 
@@ -122,7 +122,7 @@ test1_opt$(EXEEXT): test1.cmx ../ppl_ocaml.cmxa
 	$(OCAMLOPT_ENV) $(OCAMLOPT) -o $@ \
 		-cc "$(CXX)" $(OCAMLOPT_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLOPT_LINK_FLAGS) \
-		ppl_ocaml.cmxa $<
+		ppl_ocaml.cmxa test1.cmx
 
 
 nodist_ppl_ocaml_generated_test_SOURCES = ppl_ocaml_generated_test.ml
@@ -140,14 +140,14 @@ ppl_ocaml_generated_test.cmo ../ppl_ocaml.cma
 	$(OCAMLC_ENV) $(OCAMLC) -o $@ \
 		-cc "$(CXX)" $(OCAMLC_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLC_LINK_FLAGS) \
-		ppl_ocaml.cma $<
+		ppl_ocaml.cma ppl_ocaml_generated_test.cmo
 
 ppl_ocaml_generated_test_opt$(EXEEXT): \
 ppl_ocaml_generated_test.cmx ../ppl_ocaml.cmxa
 	$(OCAMLOPT_ENV) $(OCAMLOPT) -o $@ \
 		-cc "$(CXX)" $(OCAMLOPT_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLOPT_LINK_FLAGS) \
-		ppl_ocaml.cmxa $<
+		ppl_ocaml.cmxa ppl_ocaml_generated_test.cmx
 
 MOSTLYCLEANFILES = \
 test1.cmi \
diff --git a/interfaces/OCaml/tests/Makefile.in b/interfaces/OCaml/tests/Makefile.in
index 87d65f7..e45fe4c 100644
--- a/interfaces/OCaml/tests/Makefile.in
+++ b/interfaces/OCaml/tests/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,8 @@ host_triplet = @host@
 TESTS = $(am__EXEEXT_1) $(am__EXEEXT_2)
 check_PROGRAMS = $(am__EXEEXT_3)
 subdir = interfaces/OCaml/tests
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -104,6 +121,7 @@ ppl_ocaml_generated_test_LDADD = $(LDADD)
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 nodist_ppl_ocaml_generated_test_opt_OBJECTS =
 ppl_ocaml_generated_test_opt_OBJECTS =  \
 	$(nodist_ppl_ocaml_generated_test_opt_OBJECTS)
@@ -114,6 +132,18 @@ test1_LDADD = $(LDADD)
 am_test1_opt_OBJECTS =
 test1_opt_OBJECTS = $(am_test1_opt_OBJECTS)
 test1_opt_LDADD = $(LDADD)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
@@ -123,26 +153,29 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(nodist_ppl_ocaml_generated_test_SOURCES) \
 	$(nodist_ppl_ocaml_generated_test_opt_SOURCES) \
 	$(test1_SOURCES) $(test1_opt_SOURCES)
 DIST_SOURCES = $(test1_SOURCES) $(test1_opt_SOURCES)
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -468,6 +501,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 check-TESTS: $(TESTS)
 	@failed=0; all=0; xfail=0; xpass=0; skip=0; \
@@ -479,7 +514,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -724,13 +759,13 @@ test1$(EXEEXT): test1.cmo ../ppl_ocaml.cma
 	$(OCAMLC_ENV) $(OCAMLC) -o $@ \
 		-cc "$(CXX)" $(OCAMLC_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLC_LINK_FLAGS) \
-		ppl_ocaml.cma $<
+		ppl_ocaml.cma test1.cmo
 
 test1_opt$(EXEEXT): test1.cmx ../ppl_ocaml.cmxa
 	$(OCAMLOPT_ENV) $(OCAMLOPT) -o $@ \
 		-cc "$(CXX)" $(OCAMLOPT_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLOPT_LINK_FLAGS) \
-		ppl_ocaml.cmxa $<
+		ppl_ocaml.cmxa test1.cmx
 
 ppl_ocaml_generated_test.ml: $(interface_generator_dependencies)
 	$(M4) --prefix-builtin -I../.. \
@@ -743,14 +778,14 @@ ppl_ocaml_generated_test.cmo ../ppl_ocaml.cma
 	$(OCAMLC_ENV) $(OCAMLC) -o $@ \
 		-cc "$(CXX)" $(OCAMLC_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLC_LINK_FLAGS) \
-		ppl_ocaml.cma $<
+		ppl_ocaml.cma ppl_ocaml_generated_test.cmo
 
 ppl_ocaml_generated_test_opt$(EXEEXT): \
 ppl_ocaml_generated_test.cmx ../ppl_ocaml.cmxa
 	$(OCAMLOPT_ENV) $(OCAMLOPT) -o $@ \
 		-cc "$(CXX)" $(OCAMLOPT_COMPILE_FLAGS) \
 		$(BUILT_PPL_FLAGS) $(OCAMLOPT_LINK_FLAGS) \
-		ppl_ocaml.cmxa $<
+		ppl_ocaml.cmxa ppl_ocaml_generated_test.cmx
 
 ../ppl_ocaml.cma:
 	$(MAKE) $(AM_MAKEFLAGS) -C .. ppl_ocaml.cma
diff --git a/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml.m4 b/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml.m4
index ac6213c..74cf925 100644
--- a/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml.m4
+++ b/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml.m4
@@ -1,7 +1,7 @@
 m4_define(`dnl', `m4_dnl')`'dnl
 m4_divert(-1)
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml_code.m4 b/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml_code.m4
index 6670594..56b4280 100644
--- a/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml_code.m4
+++ b/interfaces/OCaml/tests/ppl_interface_generator_ocaml_test_ml_code.m4
@@ -1,5 +1,5 @@
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/OCaml/tests/ppl_ocaml_tests_common b/interfaces/OCaml/tests/ppl_ocaml_tests_common
index d5e98cc..01efb26 100644
--- a/interfaces/OCaml/tests/ppl_ocaml_tests_common
+++ b/interfaces/OCaml/tests/ppl_ocaml_tests_common
@@ -1,6 +1,6 @@
 (* Common part of the OCaml generated tests.  -*- Tuareg -*-
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/OCaml/tests/test1.ml b/interfaces/OCaml/tests/test1.ml
index 42ed551..184b4f1 100644
--- a/interfaces/OCaml/tests/test1.ml
+++ b/interfaces/OCaml/tests/test1.ml
@@ -1,6 +1,6 @@
 (* Simple program testing the PPL OCaml interface on a few random things.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/Ciao/Makefile.am b/interfaces/Prolog/Ciao/Makefile.am
index bb60f1b..b228713 100644
--- a/interfaces/Prolog/Ciao/Makefile.am
+++ b/interfaces/Prolog/Ciao/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Prolog/Ciao/Makefile.in b/interfaces/Prolog/Ciao/Makefile.in
index 990bc06..6e6ac93 100644
--- a/interfaces/Prolog/Ciao/Makefile.in
+++ b/interfaces/Prolog/Ciao/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Prolog/Ciao
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -131,11 +148,24 @@ libppl_ciao_la_OBJECTS = $(am_libppl_ciao_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_ciao_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \
 	$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \
 	$(AM_CXXFLAGS) $(CXXFLAGS) $(libppl_ciao_la_LDFLAGS) \
 	$(LDFLAGS) -o $@
 @ENABLE_SHARED_TRUE at am_libppl_ciao_la_rpath = -rpath $(pkglibdir)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -148,17 +178,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -167,20 +196,24 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_ciao_la_SOURCES) $(nodist_libppl_ciao_la_SOURCES) \
 	$(nodist_EXTRA_libppl_ciao_la_SOURCES)
 DIST_SOURCES = $(am__libppl_ciao_la_SOURCES_DIST)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(pkgdata_DATA)
 ETAGS = etags
 CTAGS = ctags
@@ -573,7 +606,6 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkglibdir)" || $(MKDIR_P) "$(DESTDIR)$(pkglibdir)"
 	@list='$(pkglib_LTLIBRARIES)'; test -n "$(pkglibdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -581,6 +613,8 @@ install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkglibdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkglibdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pkglibdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(pkglibdir)"; \
 	}
@@ -596,12 +630,14 @@ uninstall-pkglibLTLIBRARIES:
 
 clean-pkglibLTLIBRARIES:
 	-test -z "$(pkglib_LTLIBRARIES)" || rm -f $(pkglib_LTLIBRARIES)
-	@list='$(pkglib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(pkglib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_ciao.la: $(libppl_ciao_la_OBJECTS) $(libppl_ciao_la_DEPENDENCIES) $(EXTRA_libppl_ciao_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_ciao_la_LINK) $(am_libppl_ciao_la_rpath) $(libppl_ciao_la_OBJECTS) $(libppl_ciao_la_LIBADD) $(LIBS)
 
@@ -1249,8 +1285,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-pkgdataDATA: $(pkgdata_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkgdatadir)" || $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)"
 	@list='$(pkgdata_DATA)'; test -n "$(pkgdatadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgdatadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1315,6 +1354,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1463,8 +1516,8 @@ uninstall-am: uninstall-pkgdataDATA uninstall-pkglibLTLIBRARIES
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-am check-local clean \
-	clean-generic clean-libtool clean-pkglibLTLIBRARIES ctags \
-	distclean distclean-compile distclean-generic \
+	clean-generic clean-libtool clean-pkglibLTLIBRARIES cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/interfaces/Prolog/Ciao/README.ciao b/interfaces/Prolog/Ciao/README.ciao
index 9ed8610..5814d90 100644
--- a/interfaces/Prolog/Ciao/README.ciao
+++ b/interfaces/Prolog/Ciao/README.ciao
@@ -1,5 +1,5 @@
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is free software; as a special exception the author gives
 # unlimited permission to copy and/or distribute it, with or without
diff --git a/interfaces/Prolog/Ciao/ciao_cfli.hh b/interfaces/Prolog/Ciao/ciao_cfli.hh
index 9cf3d39..d9b48cb 100644
--- a/interfaces/Prolog/Ciao/ciao_cfli.hh
+++ b/interfaces/Prolog/Ciao/ciao_cfli.hh
@@ -1,6 +1,6 @@
 /* Ciao Prolog Common Foreign Language Interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -121,7 +121,7 @@ Prolog_atom_from_string(const char* s) {
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1) {
+                          Prolog_term_ref a1) {
   Prolog_term_ref args[1];
   args[0] = a1;
   t = ciao_structure_a(f, 1, args);
@@ -134,7 +134,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2) {
+                          Prolog_term_ref a1, Prolog_term_ref a2) {
   Prolog_term_ref args[2];
   args[0] = a1;
   args[1] = a2;
@@ -148,8 +148,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3) {
   Prolog_term_ref args[3];
   args[0] = a1;
   args[1] = a2;
@@ -164,8 +164,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4) {
   Prolog_term_ref args[4];
   args[0] = a1;
   args[1] = a2;
@@ -180,7 +180,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_cons(Prolog_term_ref& c,
-		      Prolog_term_ref h, Prolog_term_ref t) {
+                      Prolog_term_ref h, Prolog_term_ref t) {
   c = ciao_list(h, t);
   return 1;
 }
diff --git a/interfaces/Prolog/Ciao/ciao_clpq.pl b/interfaces/Prolog/Ciao/ciao_clpq.pl
index 1ed9b61..3b4f15f 100644
--- a/interfaces/Prolog/Ciao/ciao_clpq.pl
+++ b/interfaces/Prolog/Ciao/ciao_clpq.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the toy PPL/CIAO-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -28,21 +28,22 @@ site: http://bugseng.com/products/ppl/ . */
 :- use_module(library(prolog_sys)).
 :- use_module(library(read)).
 :- use_module(library(write)).
-:- use_module(ppl_ciao, [
-	ppl_initialize/0,
-	ppl_finalize/0,
-	ppl_new_C_Polyhedron_from_space_dimension/3,
-	ppl_new_NNC_Polyhedron_from_space_dimension/3,
-	ppl_new_C_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_C_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_delete_Polyhedron/1,
-	ppl_Polyhedron_space_dimension/2,
-	ppl_Polyhedron_get_constraints/2,
-	ppl_Polyhedron_add_space_dimensions_and_embed/2,
-	ppl_Polyhedron_remove_higher_space_dimensions/2
-]).
+:- use_module(ppl_ciao,
+              [
+               ppl_initialize/0,
+               ppl_finalize/0,
+               ppl_new_C_Polyhedron_from_space_dimension/3,
+               ppl_new_NNC_Polyhedron_from_space_dimension/3,
+               ppl_new_C_Polyhedron_from_C_Polyhedron/2,
+               ppl_new_C_Polyhedron_from_NNC_Polyhedron/2,
+               ppl_new_NNC_Polyhedron_from_C_Polyhedron/2,
+               ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
+               ppl_delete_Polyhedron/1,
+               ppl_Polyhedron_space_dimension/2,
+               ppl_Polyhedron_get_constraints/2,
+               ppl_Polyhedron_add_space_dimensions_and_embed/2,
+               ppl_Polyhedron_remove_higher_space_dimensions/2
+              ]).
 
 :- set_prolog_flag(multi_arity_warnings, off).
 
diff --git a/interfaces/Prolog/Ciao/ciao_clpq2.pl b/interfaces/Prolog/Ciao/ciao_clpq2.pl
index 3f8a646..a3cae5a 100644
--- a/interfaces/Prolog/Ciao/ciao_clpq2.pl
+++ b/interfaces/Prolog/Ciao/ciao_clpq2.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the 2nd toy PPL/CIAO-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -31,18 +31,18 @@ site: http://bugseng.com/products/ppl/ . */
 :- use_module(library(sort)).
 :- use_module(library(write)).
 :- use_module(ppl_ciao, [
-	ppl_initialize/0,
-	ppl_finalize/0,
-	ppl_new_C_Polyhedron_from_space_dimension/3,
-	ppl_new_NNC_Polyhedron_from_space_dimension/3,
-	ppl_new_C_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_delete_Polyhedron/1,
-	ppl_Polyhedron_space_dimension/2,
-	ppl_Polyhedron_get_constraints/2,
-	ppl_Polyhedron_add_space_dimensions_and_embed/2,
-	ppl_Polyhedron_remove_space_dimensions/2,
-	ppl_Polyhedron_remove_higher_space_dimensions/2
+        ppl_initialize/0,
+        ppl_finalize/0,
+        ppl_new_C_Polyhedron_from_space_dimension/3,
+        ppl_new_NNC_Polyhedron_from_space_dimension/3,
+        ppl_new_C_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
+        ppl_delete_Polyhedron/1,
+        ppl_Polyhedron_space_dimension/2,
+        ppl_Polyhedron_get_constraints/2,
+        ppl_Polyhedron_add_space_dimensions_and_embed/2,
+        ppl_Polyhedron_remove_space_dimensions/2,
+        ppl_Polyhedron_remove_higher_space_dimensions/2
 ]).
 
 :- set_prolog_flag(multi_arity_warnings, off).
diff --git a/interfaces/Prolog/Ciao/ciao_efli.cc b/interfaces/Prolog/Ciao/ciao_efli.cc
index 5282cf1..437edf0 100644
--- a/interfaces/Prolog/Ciao/ciao_efli.cc
+++ b/interfaces/Prolog/Ciao/ciao_efli.cc
@@ -1,6 +1,6 @@
 /* Ciao Prolog extended foreign language interface: definitions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ciao_efli.hh"
-#include "ppl_prolog_common.defs.hh"
+#include "ppl_prolog_common_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
diff --git a/interfaces/Prolog/Ciao/ciao_efli.hh b/interfaces/Prolog/Ciao/ciao_efli.hh
index bc61f25..267796e 100644
--- a/interfaces/Prolog/Ciao/ciao_efli.hh
+++ b/interfaces/Prolog/Ciao/ciao_efli.hh
@@ -1,6 +1,6 @@
 /* Ciao Prolog extended foreign language interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/Ciao/ciao_pl_check.pl b/interfaces/Prolog/Ciao/ciao_pl_check.pl
index a6d7bae..5590465 100644
--- a/interfaces/Prolog/Ciao/ciao_pl_check.pl
+++ b/interfaces/Prolog/Ciao/ciao_pl_check.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the toy PPL/CIAO-Prolog predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -29,104 +29,104 @@ site: http://bugseng.com/products/ppl/ . */
 :- use_module(library(read)).
 :- use_module(library(write)).
 :- use_module(ppl_ciao, [
-	ppl_version_major/1,
-	ppl_version_minor/1,
-	ppl_version_revision/1,
-	ppl_version_beta/1,
-	ppl_version/1,
-	ppl_banner/1,
-	ppl_max_space_dimension/1,
-	ppl_Coefficient_is_bounded/0,
-	ppl_Coefficient_max/1,
-	ppl_Coefficient_min/1,
-	ppl_initialize/0,
-	ppl_finalize/0,
-	ppl_set_timeout_exception_atom/1,
-	ppl_timeout_exception_atom/1,
-	ppl_set_timeout/1,
-	ppl_reset_timeout/0,
+        ppl_version_major/1,
+        ppl_version_minor/1,
+        ppl_version_revision/1,
+        ppl_version_beta/1,
+        ppl_version/1,
+        ppl_banner/1,
+        ppl_max_space_dimension/1,
+        ppl_Coefficient_is_bounded/0,
+        ppl_Coefficient_max/1,
+        ppl_Coefficient_min/1,
+        ppl_initialize/0,
+        ppl_finalize/0,
+        ppl_set_timeout_exception_atom/1,
+        ppl_timeout_exception_atom/1,
+        ppl_set_timeout/1,
+        ppl_reset_timeout/0,
         ppl_set_rounding_for_PPL/0,
         ppl_restore_pre_PPL_rounding/0,
-	ppl_new_C_Polyhedron_from_space_dimension/3,
-	ppl_new_NNC_Polyhedron_from_space_dimension/3,
-	ppl_new_C_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_C_Polyhedron_from_space_dimension/3,
+        ppl_new_NNC_Polyhedron_from_space_dimension/3,
+        ppl_new_C_Polyhedron_from_C_Polyhedron/2,
         ppl_new_C_Polyhedron_from_C_Polyhedron_with_complexity/3,
         ppl_new_C_Polyhedron_from_NNC_Polyhedron/2,
         ppl_new_C_Polyhedron_from_NNC_Polyhedron_with_complexity/3,
-	ppl_new_NNC_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_C_Polyhedron/2,
         ppl_new_NNC_Polyhedron_from_C_Polyhedron_with_complexity/3,
-	ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
         ppl_new_NNC_Polyhedron_from_NNC_Polyhedron_with_complexity/3,
-	ppl_new_C_Polyhedron_from_constraints/2,
-	ppl_new_NNC_Polyhedron_from_constraints/2,
-	ppl_new_C_Polyhedron_from_generators/2,
-	ppl_new_NNC_Polyhedron_from_generators/2,
-	ppl_Polyhedron_swap/2,
-	ppl_delete_Polyhedron/1,
-	ppl_Polyhedron_space_dimension/2,
-	ppl_Polyhedron_affine_dimension/2,
-	ppl_Polyhedron_get_constraints/2,
-	ppl_Polyhedron_get_minimized_constraints/2,
-	ppl_Polyhedron_get_generators/2,
-	ppl_Polyhedron_get_minimized_generators/2,
-	ppl_Polyhedron_relation_with_constraint/3,
-	ppl_Polyhedron_relation_with_generator/3,
-	ppl_Polyhedron_is_empty/1,
-	ppl_Polyhedron_is_universe/1,
-	ppl_Polyhedron_is_bounded/1,
-	ppl_Polyhedron_contains_integer_point/1,
-	ppl_Polyhedron_bounds_from_above/2,
-	ppl_Polyhedron_bounds_from_below/2,
-	ppl_Polyhedron_maximize/5,
-	ppl_Polyhedron_maximize_with_point/6,
-	ppl_Polyhedron_minimize/5,
-	ppl_Polyhedron_minimize_with_point/6,
+        ppl_new_C_Polyhedron_from_constraints/2,
+        ppl_new_NNC_Polyhedron_from_constraints/2,
+        ppl_new_C_Polyhedron_from_generators/2,
+        ppl_new_NNC_Polyhedron_from_generators/2,
+        ppl_Polyhedron_swap/2,
+        ppl_delete_Polyhedron/1,
+        ppl_Polyhedron_space_dimension/2,
+        ppl_Polyhedron_affine_dimension/2,
+        ppl_Polyhedron_get_constraints/2,
+        ppl_Polyhedron_get_minimized_constraints/2,
+        ppl_Polyhedron_get_generators/2,
+        ppl_Polyhedron_get_minimized_generators/2,
+        ppl_Polyhedron_relation_with_constraint/3,
+        ppl_Polyhedron_relation_with_generator/3,
+        ppl_Polyhedron_is_empty/1,
+        ppl_Polyhedron_is_universe/1,
+        ppl_Polyhedron_is_bounded/1,
+        ppl_Polyhedron_contains_integer_point/1,
+        ppl_Polyhedron_bounds_from_above/2,
+        ppl_Polyhedron_bounds_from_below/2,
+        ppl_Polyhedron_maximize/5,
+        ppl_Polyhedron_maximize_with_point/6,
+        ppl_Polyhedron_minimize/5,
+        ppl_Polyhedron_minimize_with_point/6,
         ppl_Polyhedron_is_topologically_closed/1,
-	ppl_Polyhedron_contains_Polyhedron/2,
-	ppl_Polyhedron_strictly_contains_Polyhedron/2,
-	ppl_Polyhedron_is_disjoint_from_Polyhedron/2,
+        ppl_Polyhedron_contains_Polyhedron/2,
+        ppl_Polyhedron_strictly_contains_Polyhedron/2,
+        ppl_Polyhedron_is_disjoint_from_Polyhedron/2,
         ppl_Polyhedron_equals_Polyhedron/2,
-	ppl_Polyhedron_OK/1,
-	ppl_Polyhedron_add_constraint/2,
-	ppl_Polyhedron_add_generator/2,
-	ppl_Polyhedron_add_constraints/2,
-	ppl_Polyhedron_add_generators/2,
-	ppl_Polyhedron_intersection_assign/2,
-	ppl_Polyhedron_poly_hull_assign/2,
-	ppl_Polyhedron_poly_difference_assign/2,
-	ppl_Polyhedron_affine_image/4,
-	ppl_Polyhedron_affine_preimage/4,
-	ppl_Polyhedron_bounded_affine_image/5,
-	ppl_Polyhedron_bounded_affine_preimage/5,
-	ppl_Polyhedron_generalized_affine_image/5,
-	ppl_Polyhedron_generalized_affine_preimage/5,
-	ppl_Polyhedron_generalized_affine_image_lhs_rhs/4,
-	ppl_Polyhedron_generalized_affine_preimage_lhs_rhs/4,
-	ppl_Polyhedron_time_elapse_assign/2,
+        ppl_Polyhedron_OK/1,
+        ppl_Polyhedron_add_constraint/2,
+        ppl_Polyhedron_add_generator/2,
+        ppl_Polyhedron_add_constraints/2,
+        ppl_Polyhedron_add_generators/2,
+        ppl_Polyhedron_intersection_assign/2,
+        ppl_Polyhedron_poly_hull_assign/2,
+        ppl_Polyhedron_poly_difference_assign/2,
+        ppl_Polyhedron_affine_image/4,
+        ppl_Polyhedron_affine_preimage/4,
+        ppl_Polyhedron_bounded_affine_image/5,
+        ppl_Polyhedron_bounded_affine_preimage/5,
+        ppl_Polyhedron_generalized_affine_image/5,
+        ppl_Polyhedron_generalized_affine_preimage/5,
+        ppl_Polyhedron_generalized_affine_image_lhs_rhs/4,
+        ppl_Polyhedron_generalized_affine_preimage_lhs_rhs/4,
+        ppl_Polyhedron_time_elapse_assign/2,
         ppl_Polyhedron_topological_closure_assign/1,
         ppl_Polyhedron_constrains/2,
         ppl_Polyhedron_unconstrain_space_dimension/2,
         ppl_Polyhedron_unconstrain_space_dimensions/2,
-	ppl_Polyhedron_BHRZ03_widening_assign_with_tokens/4,
-	ppl_Polyhedron_BHRZ03_widening_assign/2,
-	ppl_Polyhedron_limited_BHRZ03_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_limited_BHRZ03_extrapolation_assign/3,
-	ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign/3,
-	ppl_Polyhedron_H79_widening_assign_with_tokens/4,
-	ppl_Polyhedron_H79_widening_assign/2,
-	ppl_Polyhedron_limited_H79_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_limited_H79_extrapolation_assign/3,
-	ppl_Polyhedron_bounded_H79_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_bounded_H79_extrapolation_assign/3,
-	ppl_Polyhedron_add_space_dimensions_and_project/2,
-	ppl_Polyhedron_add_space_dimensions_and_embed/2,
-	ppl_Polyhedron_concatenate_assign/2,
-	ppl_Polyhedron_remove_space_dimensions/2,
-	ppl_Polyhedron_remove_higher_space_dimensions/2,
-	ppl_Polyhedron_expand_space_dimension/3,
-	ppl_Polyhedron_fold_space_dimensions/3,
-	ppl_Polyhedron_map_space_dimensions/2,
+        ppl_Polyhedron_BHRZ03_widening_assign_with_tokens/4,
+        ppl_Polyhedron_BHRZ03_widening_assign/2,
+        ppl_Polyhedron_limited_BHRZ03_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_limited_BHRZ03_extrapolation_assign/3,
+        ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign/3,
+        ppl_Polyhedron_H79_widening_assign_with_tokens/4,
+        ppl_Polyhedron_H79_widening_assign/2,
+        ppl_Polyhedron_limited_H79_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_limited_H79_extrapolation_assign/3,
+        ppl_Polyhedron_bounded_H79_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_bounded_H79_extrapolation_assign/3,
+        ppl_Polyhedron_add_space_dimensions_and_project/2,
+        ppl_Polyhedron_add_space_dimensions_and_embed/2,
+        ppl_Polyhedron_concatenate_assign/2,
+        ppl_Polyhedron_remove_space_dimensions/2,
+        ppl_Polyhedron_remove_higher_space_dimensions/2,
+        ppl_Polyhedron_expand_space_dimension/3,
+        ppl_Polyhedron_fold_space_dimensions/3,
+        ppl_Polyhedron_map_space_dimensions/2,
         ppl_new_MIP_Problem_from_space_dimension/2,
         ppl_new_MIP_Problem/5,
         ppl_new_MIP_Problem_from_MIP_Problem/2,
diff --git a/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_pl.m4 b/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_pl.m4
index f52cdb5..33368bc 100644
--- a/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_pl.m4
+++ b/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_pl.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 dnl This m4 file generates the file ppl_ciao.pl.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_prolog_generated_test_pl.m4 b/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_prolog_generated_test_pl.m4
index 89a85f9..ce52953 100644
--- a/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_prolog_generated_test_pl.m4
+++ b/interfaces/Prolog/Ciao/ppl_interface_generator_ciao_prolog_generated_test_pl.m4
@@ -5,7 +5,7 @@ dnl This m4 file defines macros needed for generating
 dnl the Ciao dependent code for ciao_prolog_generated_test.pl.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/Ciao/ppl_prolog_sysdep.hh b/interfaces/Prolog/Ciao/ppl_prolog_sysdep.hh
index 558b295..a6b53a2 100644
--- a/interfaces/Prolog/Ciao/ppl_prolog_sysdep.hh
+++ b/interfaces/Prolog/Ciao/ppl_prolog_sysdep.hh
@@ -1,6 +1,6 @@
 /* System-dependent part of the Prolog interfaces: stub for Ciao Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/GNU/Makefile.am b/interfaces/Prolog/GNU/Makefile.am
index ad51958..41d09d4 100644
--- a/interfaces/Prolog/GNU/Makefile.am
+++ b/interfaces/Prolog/GNU/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Prolog/GNU/Makefile.in b/interfaces/Prolog/GNU/Makefile.in
index dab27f5..1e485a7 100644
--- a/interfaces/Prolog/GNU/Makefile.in
+++ b/interfaces/Prolog/GNU/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -41,6 +40,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -61,7 +77,8 @@ build_triplet = @build@
 host_triplet = @host@
 bin_PROGRAMS = ppl_gprolog$(EXEEXT)
 subdir = interfaces/Prolog/GNU
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -131,6 +148,7 @@ libppl_gprolog_la_OBJECTS = $(am_libppl_gprolog_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_gprolog_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \
 	$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \
 	$(AM_CXXFLAGS) $(CXXFLAGS) $(libppl_gprolog_la_LDFLAGS) \
@@ -139,6 +157,18 @@ PROGRAMS = $(bin_PROGRAMS)
 am_ppl_gprolog_OBJECTS =
 ppl_gprolog_OBJECTS = $(am_ppl_gprolog_OBJECTS)
 ppl_gprolog_LDADD = $(LDADD)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -151,17 +181,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -170,22 +199,26 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_gprolog_la_SOURCES) \
 	$(nodist_libppl_gprolog_la_SOURCES) \
 	$(nodist_EXTRA_libppl_gprolog_la_SOURCES) \
 	$(ppl_gprolog_SOURCES)
 DIST_SOURCES = $(libppl_gprolog_la_SOURCES) $(ppl_gprolog_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(pkgdata_DATA)
 ETAGS = etags
 CTAGS = ctags
@@ -586,7 +619,6 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkglibdir)" || $(MKDIR_P) "$(DESTDIR)$(pkglibdir)"
 	@list='$(pkglib_LTLIBRARIES)'; test -n "$(pkglibdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -594,6 +626,8 @@ install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkglibdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkglibdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pkglibdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(pkglibdir)"; \
 	}
@@ -609,18 +643,23 @@ uninstall-pkglibLTLIBRARIES:
 
 clean-pkglibLTLIBRARIES:
 	-test -z "$(pkglib_LTLIBRARIES)" || rm -f $(pkglib_LTLIBRARIES)
-	@list='$(pkglib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(pkglib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_gprolog.la: $(libppl_gprolog_la_OBJECTS) $(libppl_gprolog_la_DEPENDENCIES) $(EXTRA_libppl_gprolog_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_gprolog_la_LINK) -rpath $(pkglibdir) $(libppl_gprolog_la_OBJECTS) $(libppl_gprolog_la_LIBADD) $(LIBS)
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -1305,8 +1344,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-pkgdataDATA: $(pkgdata_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkgdatadir)" || $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)"
 	@list='$(pkgdata_DATA)'; test -n "$(pkgdatadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgdatadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1371,6 +1413,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1520,19 +1576,19 @@ uninstall-am: uninstall-binPROGRAMS uninstall-pkgdataDATA \
 
 .PHONY: CTAGS GTAGS all all-am check check-am check-local clean \
 	clean-binPROGRAMS clean-generic clean-libtool \
-	clean-pkglibLTLIBRARIES ctags distclean distclean-compile \
-	distclean-generic distclean-libtool distclean-tags distdir dvi \
-	dvi-am html html-am info info-am install install-am \
-	install-binPROGRAMS install-data install-data-am install-dvi \
-	install-dvi-am install-exec install-exec-am install-html \
-	install-html-am install-info install-info-am install-man \
-	install-pdf install-pdf-am install-pkgdataDATA \
-	install-pkglibLTLIBRARIES install-ps install-ps-am \
-	install-strip installcheck installcheck-am installdirs \
-	maintainer-clean maintainer-clean-generic mostlyclean \
-	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
-	pdf pdf-am ps ps-am tags uninstall uninstall-am \
-	uninstall-binPROGRAMS uninstall-pkgdataDATA \
+	clean-pkglibLTLIBRARIES cscopelist ctags distclean \
+	distclean-compile distclean-generic distclean-libtool \
+	distclean-tags distdir dvi dvi-am html html-am info info-am \
+	install install-am install-binPROGRAMS install-data \
+	install-data-am install-dvi install-dvi-am install-exec \
+	install-exec-am install-html install-html-am install-info \
+	install-info-am install-man install-pdf install-pdf-am \
+	install-pkgdataDATA install-pkglibLTLIBRARIES install-ps \
+	install-ps-am install-strip installcheck installcheck-am \
+	installdirs maintainer-clean maintainer-clean-generic \
+	mostlyclean mostlyclean-compile mostlyclean-generic \
+	mostlyclean-libtool pdf pdf-am ps ps-am tags uninstall \
+	uninstall-am uninstall-binPROGRAMS uninstall-pkgdataDATA \
 	uninstall-pkglibLTLIBRARIES
 
 
diff --git a/interfaces/Prolog/GNU/README.gprolog b/interfaces/Prolog/GNU/README.gprolog
index 5ce3af5..96e9ff4 100644
--- a/interfaces/Prolog/GNU/README.gprolog
+++ b/interfaces/Prolog/GNU/README.gprolog
@@ -1,5 +1,5 @@
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is free software; as a special exception the author gives
 # unlimited permission to copy and/or distribute it, with or without
diff --git a/interfaces/Prolog/GNU/gnu_pl_check.pl b/interfaces/Prolog/GNU/gnu_pl_check.pl
index 95ed0a6..f38db5e 100644
--- a/interfaces/Prolog/GNU/gnu_pl_check.pl
+++ b/interfaces/Prolog/GNU/gnu_pl_check.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the PPL/GNU-Prolog predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -28,9 +28,9 @@ main :-
     open(obtained_pchk, write, Stream),
     set_output(Stream),
     (check_all ->
-	write('OK')
+        write('OK')
     ;
-	write('FAILURE')
+        write('FAILURE')
     ),
     nl,
     close(Stream),
diff --git a/interfaces/Prolog/GNU/gnu_prolog_generated_test.pl b/interfaces/Prolog/GNU/gnu_prolog_generated_test.pl
index 54d65d0..b4504c7 100644
--- a/interfaces/Prolog/GNU/gnu_prolog_generated_test.pl
+++ b/interfaces/Prolog/GNU/gnu_prolog_generated_test.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the PPL/GNU-Prolog predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -28,9 +28,9 @@ main :-
     open(obtained_pgt, write, Stream),
     set_output(Stream),
     (check_all ->
-	write('OK')
+        write('OK')
     ;
-	write('FAILURE')
+        write('FAILURE')
     ),
     nl,
     close(Stream),
diff --git a/interfaces/Prolog/GNU/gp_clpq.pl b/interfaces/Prolog/GNU/gp_clpq.pl
index 2c93c01..bd863aa 100644
--- a/interfaces/Prolog/GNU/gp_clpq.pl
+++ b/interfaces/Prolog/GNU/gp_clpq.pl
@@ -1,6 +1,6 @@
 /* Main program for the toy PPL/GNU-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/GNU/gprolog_cfli.hh b/interfaces/Prolog/GNU/gprolog_cfli.hh
index 975acd6..451d201 100644
--- a/interfaces/Prolog/GNU/gprolog_cfli.hh
+++ b/interfaces/Prolog/GNU/gprolog_cfli.hh
@@ -1,6 +1,6 @@
 /* GNU Prolog Common Foreign Language Interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -184,7 +184,7 @@ Prolog_atom_from_string(const char* s) {
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1) {
+                          Prolog_term_ref a1) {
   Prolog_term_ref args[1];
   args[0] = a1;
   t = Mk_Compound(f, 1, args);
@@ -197,7 +197,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2) {
+                          Prolog_term_ref a1, Prolog_term_ref a2) {
   Prolog_term_ref args[2];
   args[0] = a1;
   args[1] = a2;
@@ -211,8 +211,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3) {
   Prolog_term_ref args[3];
   args[0] = a1;
   args[1] = a2;
@@ -227,8 +227,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4) {
   Prolog_term_ref args[4];
   args[0] = a1;
   args[1] = a2;
@@ -243,7 +243,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_cons(Prolog_term_ref& c,
-		      Prolog_term_ref h, Prolog_term_ref t) {
+                      Prolog_term_ref h, Prolog_term_ref t) {
   Prolog_term_ref args[2];
   args[0] = h;
   args[1] = t;
diff --git a/interfaces/Prolog/GNU/gprolog_efli.cc b/interfaces/Prolog/GNU/gprolog_efli.cc
index b2ee0f8..a9bd184 100644
--- a/interfaces/Prolog/GNU/gprolog_efli.cc
+++ b/interfaces/Prolog/GNU/gprolog_efli.cc
@@ -1,6 +1,6 @@
 /* GNU Prolog extended foreign language interface: definitions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "gprolog_efli.hh"
-#include "ppl_prolog_common.defs.hh"
+#include "ppl_prolog_common_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
diff --git a/interfaces/Prolog/GNU/gprolog_efli.hh b/interfaces/Prolog/GNU/gprolog_efli.hh
index e8c883e..88f8d3c 100644
--- a/interfaces/Prolog/GNU/gprolog_efli.hh
+++ b/interfaces/Prolog/GNU/gprolog_efli.hh
@@ -1,6 +1,6 @@
 /* GNU Prolog extended foreign language interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/GNU/ppl_interface_generator_gprolog_pl.m4 b/interfaces/Prolog/GNU/ppl_interface_generator_gprolog_pl.m4
index 7420b0c..34a11bb 100644
--- a/interfaces/Prolog/GNU/ppl_interface_generator_gprolog_pl.m4
+++ b/interfaces/Prolog/GNU/ppl_interface_generator_gprolog_pl.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 dnl This m4 file generates the file ppl_gprolog.pl.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/GNU/ppl_prolog_sysdep.hh b/interfaces/Prolog/GNU/ppl_prolog_sysdep.hh
index 7bc2dda..b0e1fe9 100644
--- a/interfaces/Prolog/GNU/ppl_prolog_sysdep.hh
+++ b/interfaces/Prolog/GNU/ppl_prolog_sysdep.hh
@@ -1,6 +1,6 @@
 /* System-dependent part of the Prolog interfaces: stub for GNU Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/Makefile.am b/interfaces/Prolog/Makefile.am
index f057fce..9548c15 100644
--- a/interfaces/Prolog/Makefile.am
+++ b/interfaces/Prolog/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -69,8 +69,8 @@ ppl_interface_generator_prolog_dox_code.m4
 
 EXTRA_DIST = \
 $(interface_generator_files) \
-ppl_prolog_common.defs.hh \
-ppl_prolog_common.inlines.hh \
+ppl_prolog_common_defs.hh \
+ppl_prolog_common_inlines.hh \
 ppl_prolog_common.cc \
 Prolog_configured_interface.dox \
 $(interface_generator_dox_files) \
diff --git a/interfaces/Prolog/Makefile.in b/interfaces/Prolog/Makefile.in
index 2955e81..47daf5d 100644
--- a/interfaces/Prolog/Makefile.in
+++ b/interfaces/Prolog/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -58,7 +74,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Prolog
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -91,12 +108,18 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -106,6 +129,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(nodist_noinst_DATA)
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
@@ -362,8 +390,8 @@ ppl_interface_generator_prolog_dox_code.m4
 
 EXTRA_DIST = \
 $(interface_generator_files) \
-ppl_prolog_common.defs.hh \
-ppl_prolog_common.inlines.hh \
+ppl_prolog_common_defs.hh \
+ppl_prolog_common_inlines.hh \
 ppl_prolog_common.cc \
 Prolog_configured_interface.dox \
 $(interface_generator_dox_files) \
@@ -444,12 +472,12 @@ clean-libtool:
 	-rm -rf .libs _libs
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -459,7 +487,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -473,37 +505,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -512,6 +513,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -575,6 +580,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -610,13 +629,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -742,22 +758,22 @@ ps-am:
 uninstall-am:
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all check \
-	ctags-recursive install install-am install-strip \
-	tags-recursive
+	cscopelist-recursive ctags-recursive install install-am \
+	install-strip tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-generic clean-libtool \
-	ctags ctags-recursive distclean distclean-generic \
-	distclean-libtool distclean-tags distdir dvi dvi-am html \
-	html-am info info-am install install-am install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-pdf install-pdf-am \
-	install-ps install-ps-am install-strip installcheck \
-	installcheck-am installdirs installdirs-am maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-generic \
-	mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \
-	uninstall uninstall-am
+	cscopelist cscopelist-recursive ctags ctags-recursive \
+	distclean distclean-generic distclean-libtool distclean-tags \
+	distdir dvi dvi-am html html-am info info-am install \
+	install-am install-data install-data-am install-dvi \
+	install-dvi-am install-exec install-exec-am install-html \
+	install-html-am install-info install-info-am install-man \
+	install-pdf install-pdf-am install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	installdirs-am maintainer-clean maintainer-clean-generic \
+	mostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \
+	ps ps-am tags tags-recursive uninstall uninstall-am
 
 
 Prolog_configured_domains.dox: \
diff --git a/interfaces/Prolog/Prolog_configured_interface.dox b/interfaces/Prolog/Prolog_configured_interface.dox
index 1480f17..87df134 100644
--- a/interfaces/Prolog/Prolog_configured_interface.dox
+++ b/interfaces/Prolog/Prolog_configured_interface.dox
@@ -1,6 +1,6 @@
 /* Configuration Dependent Documentation for Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/Prolog_interface.dox b/interfaces/Prolog/Prolog_interface.dox
index 11aeaa4..e2830d2 100644
--- a/interfaces/Prolog/Prolog_interface.dox
+++ b/interfaces/Prolog/Prolog_interface.dox
@@ -1,6 +1,6 @@
 /* Configuration Independent Documentation for Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/Prolog_interface_compilation.dox b/interfaces/Prolog/Prolog_interface_compilation.dox
index d8a2dd5..ce3509c 100644
--- a/interfaces/Prolog/Prolog_interface_compilation.dox
+++ b/interfaces/Prolog/Prolog_interface_compilation.dox
@@ -1,5 +1,5 @@
 // Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-// Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+// Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 //
 // This document describes the Parma Polyhedra Library (PPL).
 //
diff --git a/interfaces/Prolog/Prolog_interface_sysdep.dox b/interfaces/Prolog/Prolog_interface_sysdep.dox
index 2472e0a..a565ba7 100644
--- a/interfaces/Prolog/Prolog_interface_sysdep.dox
+++ b/interfaces/Prolog/Prolog_interface_sysdep.dox
@@ -1,6 +1,6 @@
 /* System-Dependent Documentation for Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/Prolog_interface_sysindep.dox b/interfaces/Prolog/Prolog_interface_sysindep.dox
index 482525f..0edc71d 100644
--- a/interfaces/Prolog/Prolog_interface_sysindep.dox
+++ b/interfaces/Prolog/Prolog_interface_sysindep.dox
@@ -1,6 +1,6 @@
 /* Configuration Independent Documentation for Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -163,56 +163,56 @@ The PPL predicates provided by the Prolog interface are specified below.
 The specification uses the following grammar rules:
 \code
 
- Number      --> unsigned integer	ranging from 0 to an upper bound
-					depending on the actual Prolog system.
+ Number      --> unsigned integer       ranging from 0 to an upper bound
+                                        depending on the actual Prolog system.
 
- C_int       --> Number | - Number	C integer
+ C_int       --> Number | - Number      C integer
 
- C_unsigned  --> Number			C unsigned integer
+ C_unsigned  --> Number                 C unsigned integer
 
- Coeff       --> Number			used in linear expressions;
-					the upper bound will depend on how
-					the PPL has been configured
+ Coeff       --> Number                 used in linear expressions;
+                                        the upper bound will depend on how
+                                        the PPL has been configured
 
  Dimension_Type
-             --> Number			used for the number of affine and
-					space dimensions and the names of
- 					the dimensions;
-					the upper bound will depend on
-					the maximum number of dimensions
-					allowed by the PPL
-					(see ppl_max_space_dimensions/1)
+             --> Number                 used for the number of affine and
+                                        space dimensions and the names of
+                                        the dimensions;
+                                        the upper bound will depend on
+                                        the maximum number of dimensions
+                                        allowed by the PPL
+                                        (see ppl_max_space_dimensions/1)
 
  Boolean     --> true | false
 
- Handle      --> Prolog term		used to identify a Polyhedron
+ Handle      --> Prolog term            used to identify a Polyhedron
 
- Topology    --> c | nnc		Polyhedral kind;
-					c is closed and nnc is NNC
+ Topology    --> c | nnc                Polyhedral kind;
+                                        c is closed and nnc is NNC
 
- VarId       --> Dimension_Type 	variable identifier
+ VarId       --> Dimension_Type         variable identifier
 
- PPL_Var     --> '$VAR'(VarId)		PPL variable
+ PPL_Var     --> '$VAR'(VarId)          PPL variable
 
- Lin_Expr    --> PPL_Var		PPL variable
+ Lin_Expr    --> PPL_Var                PPL variable
             | Coeff
-            | Lin_Expr			unary plus
-            | - Lin_Expr		unary minus
-            | Lin_Expr + Lin_Expr	addition
-            | Lin_Expr - Lin_Expr	subtraction
-            | Coeff * Lin_Expr	        multiplication
-            | Lin_Expr * Coeff	        multiplication
-
- Relation_Symbol --> =			equals
-            | =< 			less than or equal
-            | >=			greater than or equal
-            | < 			strictly less than
-            | > 			strictly greater than
+            | Lin_Expr                  unary plus
+            | - Lin_Expr                unary minus
+            | Lin_Expr + Lin_Expr       addition
+            | Lin_Expr - Lin_Expr       subtraction
+            | Coeff * Lin_Expr          multiplication
+            | Lin_Expr * Coeff          multiplication
+
+ Relation_Symbol --> =                  equals
+            | =<                        less than or equal
+            | >=                        greater than or equal
+            | <                         strictly less than
+            | >                         strictly greater than
 
  Constraint  --> Lin_Expr Relation_Symbol Lin_Expr
-					constraint
+                                        constraint
 
- Constraint_System			list of constraints
+ Constraint_System                      list of constraints
              --> []
             | [Constraint | Constraint_System]
 
@@ -222,63 +222,63 @@ The specification uses the following grammar rules:
             | (Lin_Expr =:= Lin_Expr) / Modulus
                                         congruence with modulo Modulus
 
- Congruence_System			list of congruences
+ Congruence_System                      list of congruences
              --> []
             | [Congruence | Congruence_System]
 
- Generator_Denominator --> Coeff	must be non-zero
-	    | - Coeff
+ Generator_Denominator --> Coeff        must be non-zero
+            | - Coeff
 
- Generator   --> point(Lin_Expr)	point
+ Generator   --> point(Lin_Expr)        point
             | point(Lin_Expr, Generator_Denominator)
-					point
-            | closure_point(Lin_Expr)	closure point
+                                        point
+            | closure_point(Lin_Expr)   closure point
             | closure_point(Lin_Expr, Generator_Denominator)
-					closure point
-            | ray(Lin_Expr)		ray
-            | line(Lin_Expr)		line
+                                        closure point
+            | ray(Lin_Expr)             ray
+            | line(Lin_Expr)            line
 
- Generator_System			list of generators
+ Generator_System                       list of generators
              --> []
-	    | [Generator | Generator_System]
+            | [Generator | Generator_System]
 
  Grid_Generator
-             --> grid_point(Lin_Expr)	grid point
+             --> grid_point(Lin_Expr)   grid point
             | grid_point(Lin_Expr, Generator_Denominator)
-					grid point
-            | parameter(Lin_Expr)	parameter
+                                        grid point
+            | parameter(Lin_Expr)       parameter
             | parameter(Lin_Expr, Generator_Denominator)
                                         parameter
             | grid_line(Lin_Expr)       grid line
 
- Grid_Generator_System			list of grid generators
+ Grid_Generator_System                  list of grid generators
              --> []
-	    | [Grid_Generator | Grid_Generator_System]
+            | [Grid_Generator | Grid_Generator_System]
 
  Artificial_Parameter  --> Lin_Expr / Coeff
 
  Artificial_Parameter_List --> []
-	    | [Artificial_Parameter | Artificial_Parameter_List]
+            | [Artificial_Parameter | Artificial_Parameter_List]
 
  Atom        --> Prolog atom
 
- Universe_or_Empty			PPL object
+ Universe_or_Empty                      PPL object
              --> universe | empty
 
  Poly_Relation --> is_disjoint          with a constraint or congruence
-	    | strictly_intersects	with a constraint or congruence
-	    | is_included		with a constraint or congruence
-	    | saturates			with a constraint or congruence
-            | subsumes			with a (grid) generator
+            | strictly_intersects       with a constraint or congruence
+            | is_included               with a constraint or congruence
+            | saturates                 with a constraint or congruence
+            | subsumes                  with a (grid) generator
 
  Relation_List --> []
-	    | [Poly_Relation | Relation_List]
+            | [Poly_Relation | Relation_List]
 
  Complexity  --> polynomial | simplex | any
 
  Vars_Pair   --> PPL_Var - PPL_Var      map relation
 
- P_Func      --> []    			list of map relations
+ P_Func      --> []                     list of map relations
             | [Vars_Pair | P_Func].
 
  Width  --> bits_8 | bits_16 | bits_32 | bits_64 | bits_128
@@ -307,7 +307,7 @@ The specification uses the following grammar rules:
             | pivot_row_strategy_first
             | pivot_row_strategy_max_column
 
- Vars_List   --> []    			list of PPL variables
+ Vars_List   --> []                     list of PPL variables
             | [PPL_Var | Vars_List].
 \endcode
 
diff --git a/interfaces/Prolog/Prolog_interface_sysindep_domains.dox b/interfaces/Prolog/Prolog_interface_sysindep_domains.dox
index a16eb14..a6b488f 100644
--- a/interfaces/Prolog/Prolog_interface_sysindep_domains.dox
+++ b/interfaces/Prolog/Prolog_interface_sysindep_domains.dox
@@ -1,6 +1,6 @@
 /* Configuration Independent Documentation for Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SICStus/Makefile.am b/interfaces/Prolog/SICStus/Makefile.am
index 7469919..fe651b2 100644
--- a/interfaces/Prolog/SICStus/Makefile.am
+++ b/interfaces/Prolog/SICStus/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -72,7 +72,7 @@ ppl_sicstus.so: ppl_sicstus.pl $(top_builddir)/src/libppl.la libppl_sicstus.la
 
 install-data-local: ppl_sicstus.so
 	$(LIBTOOL) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) \
-		$< $(DESTDIR)$(pkglibdir)/$<
+	    ppl_sicstus.so $(DESTDIR)$(pkglibdir)/ppl_sicstus.so
 
 else !ENABLE_SHARED
 
diff --git a/interfaces/Prolog/SICStus/Makefile.in b/interfaces/Prolog/SICStus/Makefile.in
index 1d73c98..ccc44ab 100644
--- a/interfaces/Prolog/SICStus/Makefile.in
+++ b/interfaces/Prolog/SICStus/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -41,6 +40,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -61,7 +77,8 @@ build_triplet = @build@
 host_triplet = @host@
 bin_PROGRAMS = ppl_sicstus$(EXEEXT)
 subdir = interfaces/Prolog/SICStus
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -103,6 +120,7 @@ libppl_sicstus_la_OBJECTS = $(am_libppl_sicstus_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_sicstus_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \
 	$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \
 	$(AM_CXXFLAGS) $(CXXFLAGS) $(libppl_sicstus_la_LDFLAGS) \
@@ -112,6 +130,18 @@ PROGRAMS = $(bin_PROGRAMS)
 am_ppl_sicstus_OBJECTS =
 ppl_sicstus_OBJECTS = $(am_ppl_sicstus_OBJECTS)
 ppl_sicstus_LDADD = $(LDADD)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -124,17 +154,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -143,22 +172,26 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_sicstus_la_SOURCES) \
 	$(nodist_libppl_sicstus_la_SOURCES) \
 	$(nodist_EXTRA_libppl_sicstus_la_SOURCES) \
 	$(ppl_sicstus_SOURCES)
 DIST_SOURCES = $(libppl_sicstus_la_SOURCES) $(ppl_sicstus_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -579,18 +612,23 @@ $(am__aclocal_m4_deps):
 
 clean-noinstLTLIBRARIES:
 	-test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES)
-	@list='$(noinst_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(noinst_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_sicstus.la: $(libppl_sicstus_la_OBJECTS) $(libppl_sicstus_la_DEPENDENCIES) $(EXTRA_libppl_sicstus_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_sicstus_la_LINK)  $(libppl_sicstus_la_OBJECTS) $(libppl_sicstus_la_LIBADD) $(LIBS)
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -1276,8 +1314,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-pkgdataDATA: $(pkgdata_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkgdatadir)" || $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)"
 	@list='$(pkgdata_DATA)'; test -n "$(pkgdatadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgdatadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1342,6 +1383,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1491,19 +1546,19 @@ uninstall-am: uninstall-binPROGRAMS uninstall-pkgdataDATA
 
 .PHONY: CTAGS GTAGS all all-am check check-am check-local clean \
 	clean-binPROGRAMS clean-generic clean-libtool \
-	clean-noinstLTLIBRARIES ctags distclean distclean-compile \
-	distclean-generic distclean-libtool distclean-tags distdir dvi \
-	dvi-am html html-am info info-am install install-am \
-	install-binPROGRAMS install-data install-data-am \
-	install-data-local install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-pdf install-pdf-am \
-	install-pkgdataDATA install-ps install-ps-am install-strip \
-	installcheck installcheck-am installdirs maintainer-clean \
-	maintainer-clean-generic mostlyclean mostlyclean-compile \
-	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
-	tags uninstall uninstall-am uninstall-binPROGRAMS \
-	uninstall-pkgdataDATA
+	clean-noinstLTLIBRARIES cscopelist ctags distclean \
+	distclean-compile distclean-generic distclean-libtool \
+	distclean-tags distdir dvi dvi-am html html-am info info-am \
+	install install-am install-binPROGRAMS install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-pkgdataDATA install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
+	pdf pdf-am ps ps-am tags uninstall uninstall-am \
+	uninstall-binPROGRAMS uninstall-pkgdataDATA
 
 
 ppl_sicstus_sd.cc: $(interface_generator_dependencies)
@@ -1521,7 +1576,7 @@ ppl_sicstus_sd.cc: $(interface_generator_dependencies)
 
 @ENABLE_SHARED_TRUE at install-data-local: ppl_sicstus.so
 @ENABLE_SHARED_TRUE@	$(LIBTOOL) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) \
- at ENABLE_SHARED_TRUE@		$< $(DESTDIR)$(pkglibdir)/$<
+ at ENABLE_SHARED_TRUE@	    ppl_sicstus.so $(DESTDIR)$(pkglibdir)/ppl_sicstus.so
 
 ppl_sicstus$(EXEEXT): ppl_sicstus.s.o $(top_builddir)/src/libppl.la
 	$(LIBTOOL) --mode=link --tag=CXX \
diff --git a/interfaces/Prolog/SICStus/ppl_interface_generator_sicstus_sd_cc.m4 b/interfaces/Prolog/SICStus/ppl_interface_generator_sicstus_sd_cc.m4
index 0bb5c5a..fe06db1 100644
--- a/interfaces/Prolog/SICStus/ppl_interface_generator_sicstus_sd_cc.m4
+++ b/interfaces/Prolog/SICStus/ppl_interface_generator_sicstus_sd_cc.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 dnl This m4 file generates the file ppl_sicstus_sd.cc.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/SICStus/ppl_prolog_sysdep.hh b/interfaces/Prolog/SICStus/ppl_prolog_sysdep.hh
index 8e0409c..996977e 100644
--- a/interfaces/Prolog/SICStus/ppl_prolog_sysdep.hh
+++ b/interfaces/Prolog/SICStus/ppl_prolog_sysdep.hh
@@ -1,6 +1,6 @@
 /* System-dependent part of the Prolog interfaces: stub for SICStus Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SICStus/ppl_sicstus.pl b/interfaces/Prolog/SICStus/ppl_sicstus.pl
index 19be8a0..0f43913 100644
--- a/interfaces/Prolog/SICStus/ppl_sicstus.pl
+++ b/interfaces/Prolog/SICStus/ppl_sicstus.pl
@@ -1,6 +1,6 @@
 /* Loader for the SICStus Prolog interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,8 +23,8 @@ site: http://bugseng.com/products/ppl/ . */
 
 foreign_resource(ppl_sicstus,
 [
-	init(ppl_sicstus_init),
-	deinit(ppl_sicstus_deinit)
+        init(ppl_sicstus_init),
+        deinit(ppl_sicstus_deinit)
 ]).
 
 :- load_foreign_resource(ppl_sicstus).
diff --git a/interfaces/Prolog/SICStus/sicstus_cfli.cc b/interfaces/Prolog/SICStus/sicstus_cfli.cc
index e97aa45..0ad4b28 100644
--- a/interfaces/Prolog/SICStus/sicstus_cfli.cc
+++ b/interfaces/Prolog/SICStus/sicstus_cfli.cc
@@ -1,6 +1,6 @@
 /* SICStus Prolog Common Foreign Language Interface: implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SICStus/sicstus_cfli.h b/interfaces/Prolog/SICStus/sicstus_cfli.h
index 5ba53a3..0ec2027 100644
--- a/interfaces/Prolog/SICStus/sicstus_cfli.h
+++ b/interfaces/Prolog/SICStus/sicstus_cfli.h
@@ -1,6 +1,6 @@
 /* SICStus Prolog Common Foreign Language Interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -82,25 +82,25 @@ Prolog_atom_from_string(const char* s);
 
 PCFLI_DECLSPEC int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1);
+                          Prolog_term_ref a1);
 
 PCFLI_DECLSPEC int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2);
+                          Prolog_term_ref a1, Prolog_term_ref a2);
 
 PCFLI_DECLSPEC int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3);
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3);
 
 PCFLI_DECLSPEC int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4);
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4);
 
 PCFLI_DECLSPEC int
 Prolog_construct_cons(Prolog_term_ref c,
-		      Prolog_term_ref h, Prolog_term_ref t);
+                      Prolog_term_ref h, Prolog_term_ref t);
 
 PCFLI_DECLSPEC void
 Prolog_raise_exception(Prolog_term_ref t);
@@ -134,7 +134,7 @@ Prolog_get_atom_name(Prolog_term_ref t, Prolog_atom& name);
 
 PCFLI_DECLSPEC int
 Prolog_get_compound_name_arity(Prolog_term_ref t,
-			       Prolog_atom& name, int& arity);
+                               Prolog_atom& name, int& arity);
 
 PCFLI_DECLSPEC int
 Prolog_get_arg(int i, Prolog_term_ref t, Prolog_term_ref a);
diff --git a/interfaces/Prolog/SICStus/sicstus_cfli.ic b/interfaces/Prolog/SICStus/sicstus_cfli.ic
index 5dfe493..56101c9 100644
--- a/interfaces/Prolog/SICStus/sicstus_cfli.ic
+++ b/interfaces/Prolog/SICStus/sicstus_cfli.ic
@@ -1,6 +1,6 @@
 /* SICStus Common Foreign Language Interface: definitions. -*- C -*-
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -122,7 +122,7 @@ Prolog_atom_from_string(const char* s) {
 */
 PCFLI_EXTERN_INLINE int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1) {
+                          Prolog_term_ref a1) {
   return SP_cons_functor(t, f, 1, a1);
 }
 
@@ -132,7 +132,7 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 PCFLI_EXTERN_INLINE int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2) {
+                          Prolog_term_ref a1, Prolog_term_ref a2) {
   return SP_cons_functor(t, f, 2, a1, a2);
 }
 
@@ -142,8 +142,8 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 PCFLI_EXTERN_INLINE int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3) {
   return SP_cons_functor(t, f, 3, a1, a2, a3);
 }
 
@@ -153,8 +153,8 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 PCFLI_EXTERN_INLINE int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4) {
   return SP_cons_functor(t, f, 4, a1, a2, a3, a4);
 }
 
@@ -163,7 +163,7 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 PCFLI_EXTERN_INLINE int
 Prolog_construct_cons(Prolog_term_ref c,
-		      Prolog_term_ref h, Prolog_term_ref t) {
+                      Prolog_term_ref h, Prolog_term_ref t) {
   return SP_cons_list(c, h, t);
 }
 
diff --git a/interfaces/Prolog/SICStus/sicstus_efli.cc b/interfaces/Prolog/SICStus/sicstus_efli.cc
index c9a3e73..39d6827 100644
--- a/interfaces/Prolog/SICStus/sicstus_efli.cc
+++ b/interfaces/Prolog/SICStus/sicstus_efli.cc
@@ -1,6 +1,6 @@
 /* SICStus Prolog extended foreign language interface: definitions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SICStus/sicstus_efli.hh b/interfaces/Prolog/SICStus/sicstus_efli.hh
index d8a0ba1..df4bc32 100644
--- a/interfaces/Prolog/SICStus/sicstus_efli.hh
+++ b/interfaces/Prolog/SICStus/sicstus_efli.hh
@@ -1,6 +1,6 @@
 /* SICStus Prolog extended foreign language interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SICStus/sp_clpq.pl b/interfaces/Prolog/SICStus/sp_clpq.pl
index 1fa96d9..abfcfa0 100644
--- a/interfaces/Prolog/SICStus/sp_clpq.pl
+++ b/interfaces/Prolog/SICStus/sp_clpq.pl
@@ -1,6 +1,6 @@
 /* Main program for the toy PPL/SICStus-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,21 +24,21 @@ site: http://bugseng.com/products/ppl/ . */
 :- ensure_loaded('ppl_sicstus.pl').
 
 version_dependent_declarations :-
-	prolog_flag(version, V),
-	atom_codes(V, VList),
-	VList = [_S, _I, _C, _S, _t, _u, _s, _, N|_],
-	(N is "4" ->
-	    true
-	;
-	    set_prolog_flag(language, iso),
-	    use_module(library(lists), [append/3, member/2])
-	).
+        prolog_flag(version, V),
+        atom_codes(V, VList),
+        VList = [_S, _I, _C, _S, _t, _u, _s, _, N|_],
+        (N is "4" ->
+            true
+        ;
+            set_prolog_flag(language, iso),
+            use_module(library(lists), [append/3, member/2])
+        ).
 
 eat_eol :-
-	get_code(user_input, _EOL).
+        get_code(user_input, _EOL).
 
 main(CLPQ) :-
-	version_dependent_declarations,
-	ensure_loaded(CLPQ),
-	set_prolog_flag(fileerrors, off),
-	common_main.
+        version_dependent_declarations,
+        ensure_loaded(CLPQ),
+        set_prolog_flag(fileerrors, off),
+        common_main.
diff --git a/interfaces/Prolog/SICStus/sp_pl_check.pl b/interfaces/Prolog/SICStus/sp_pl_check.pl
index 305be92..73f6ff3 100644
--- a/interfaces/Prolog/SICStus/sp_pl_check.pl
+++ b/interfaces/Prolog/SICStus/sp_pl_check.pl
@@ -1,6 +1,6 @@
 /* Main program for the toy PPL/SICStus-Prolog CLP(Q) predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -26,24 +26,24 @@ prolog_system('SICStus').
 :- ensure_loaded('ppl_sicstus.pl').
 
 version_dependent_declarations :-
-	prolog_flag(version, V),
-	atom_codes(V, VList),
-	VList = [_S, _I, _C, _S, _t, _u, _s, _, N|_],
-	(N is "4" ->
-	    true
-	;
-	    set_prolog_flag(language, iso),
-	    use_module(library(lists), [append/3, member/2])
-	).
+        prolog_flag(version, V),
+        atom_codes(V, VList),
+        VList = [_S, _I, _C, _S, _t, _u, _s, _, N|_],
+        (N is "4" ->
+            true
+        ;
+            set_prolog_flag(language, iso),
+            use_module(library(lists), [append/3, member/2])
+        ).
 
 main :-
-	version_dependent_declarations,
-	ensure_loaded('pl_check.pl'),
-	set_prolog_flag(fileerrors, off),
-	(check_all ->
-	    write('OK')
-	;
-	    write('FAILURE')
-	),
-	nl,
-	halt.
+        version_dependent_declarations,
+        ensure_loaded('pl_check.pl'),
+        set_prolog_flag(fileerrors, off),
+        (check_all ->
+            write('OK')
+        ;
+            write('FAILURE')
+        ),
+        nl,
+        halt.
diff --git a/interfaces/Prolog/SICStus/sp_prolog_generated_test.pl b/interfaces/Prolog/SICStus/sp_prolog_generated_test.pl
index 683b3e1..56171e8 100644
--- a/interfaces/Prolog/SICStus/sp_prolog_generated_test.pl
+++ b/interfaces/Prolog/SICStus/sp_prolog_generated_test.pl
@@ -1,6 +1,6 @@
 /* Main program for the PPL/SICStus-Prolog generated tests.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -26,24 +26,24 @@ prolog_system('SICStus').
 :- ensure_loaded('ppl_sicstus.pl').
 
 version_dependent_declarations :-
-	prolog_flag(version, V),
-	atom_codes(V, VList),
-	VList = [_S, _I, _C, _S, _t, _u, _s, _, N|_],
-	(N is "4" ->
-	    true
-	;
-	    set_prolog_flag(language, iso),
-	    use_module(library(lists), [append/3, member/2])
-	).
+        prolog_flag(version, V),
+        atom_codes(V, VList),
+        VList = [_S, _I, _C, _S, _t, _u, _s, _, N|_],
+        (N is "4" ->
+            true
+        ;
+            set_prolog_flag(language, iso),
+            use_module(library(lists), [append/3, member/2])
+        ).
 
 main :-
-	version_dependent_declarations,
+        version_dependent_declarations,
         ensure_loaded('ppl_prolog_generated_test_main.pl'),
-	set_prolog_flag(fileerrors, off),
-	(check_all ->
-	    write('OK')
-	;
-	    write('FAILURE')
-	),
-	nl,
-	halt.
+        set_prolog_flag(fileerrors, off),
+        (check_all ->
+            write('OK')
+        ;
+            write('FAILURE')
+        ),
+        nl,
+        halt.
diff --git a/interfaces/Prolog/SWI/Makefile.am b/interfaces/Prolog/SWI/Makefile.am
index f517ca3..26d08c8 100644
--- a/interfaces/Prolog/SWI/Makefile.am
+++ b/interfaces/Prolog/SWI/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Prolog/SWI/Makefile.in b/interfaces/Prolog/SWI/Makefile.in
index ecec6f8..749b404 100644
--- a/interfaces/Prolog/SWI/Makefile.in
+++ b/interfaces/Prolog/SWI/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -41,6 +40,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -62,7 +78,8 @@ host_triplet = @host@
 check_PROGRAMS = ppl_pl$(EXEEXT) pl_clpq$(EXEEXT) pl_clpq2$(EXEEXT)
 @ENABLE_SHARED_FALSE at bin_PROGRAMS = ppl_pl$(EXEEXT)
 subdir = interfaces/Prolog/SWI
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -134,6 +151,7 @@ libppl_swiprolog_la_OBJECTS = $(am_libppl_swiprolog_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_swiprolog_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \
 	$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \
 	$(AM_CXXFLAGS) $(CXXFLAGS) $(libppl_swiprolog_la_LDFLAGS) \
@@ -148,6 +166,18 @@ pl_clpq2_LDADD = $(LDADD)
 am_ppl_pl_OBJECTS = ppl_pl.$(OBJEXT)
 ppl_pl_OBJECTS = $(am_ppl_pl_OBJECTS)
 ppl_pl_LDADD = $(LDADD)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -160,17 +190,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -179,23 +208,27 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_swiprolog_la_SOURCES) \
 	$(nodist_libppl_swiprolog_la_SOURCES) \
 	$(nodist_EXTRA_libppl_swiprolog_la_SOURCES) $(pl_clpq_SOURCES) \
 	$(pl_clpq2_SOURCES) $(ppl_pl_SOURCES)
 DIST_SOURCES = $(libppl_swiprolog_la_SOURCES) $(pl_clpq_SOURCES) \
 	$(pl_clpq2_SOURCES) $(ppl_pl_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(pkgdata_DATA)
 ETAGS = etags
 CTAGS = ctags
@@ -612,7 +645,6 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkglibdir)" || $(MKDIR_P) "$(DESTDIR)$(pkglibdir)"
 	@list='$(pkglib_LTLIBRARIES)'; test -n "$(pkglibdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -620,6 +652,8 @@ install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkglibdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkglibdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pkglibdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(pkglibdir)"; \
 	}
@@ -635,18 +669,23 @@ uninstall-pkglibLTLIBRARIES:
 
 clean-pkglibLTLIBRARIES:
 	-test -z "$(pkglib_LTLIBRARIES)" || rm -f $(pkglib_LTLIBRARIES)
-	@list='$(pkglib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(pkglib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_swiprolog.la: $(libppl_swiprolog_la_OBJECTS) $(libppl_swiprolog_la_DEPENDENCIES) $(EXTRA_libppl_swiprolog_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_swiprolog_la_LINK) -rpath $(pkglibdir) $(libppl_swiprolog_la_OBJECTS) $(libppl_swiprolog_la_LIBADD) $(LIBS)
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -1343,8 +1382,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-pkgdataDATA: $(pkgdata_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkgdatadir)" || $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)"
 	@list='$(pkgdata_DATA)'; test -n "$(pkgdatadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgdatadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1409,6 +1451,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1559,20 +1615,20 @@ uninstall-am: uninstall-binPROGRAMS uninstall-pkgdataDATA \
 
 .PHONY: CTAGS GTAGS all all-am check check-am check-local clean \
 	clean-binPROGRAMS clean-checkPROGRAMS clean-generic \
-	clean-libtool clean-pkglibLTLIBRARIES ctags distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-binPROGRAMS install-data \
-	install-data-am install-dvi install-dvi-am install-exec \
-	install-exec-am install-html install-html-am install-info \
-	install-info-am install-man install-pdf install-pdf-am \
-	install-pkgdataDATA install-pkglibLTLIBRARIES install-ps \
-	install-ps-am install-strip installcheck installcheck-am \
-	installdirs maintainer-clean maintainer-clean-generic \
-	mostlyclean mostlyclean-compile mostlyclean-generic \
-	mostlyclean-libtool pdf pdf-am ps ps-am tags uninstall \
-	uninstall-am uninstall-binPROGRAMS uninstall-pkgdataDATA \
-	uninstall-pkglibLTLIBRARIES
+	clean-libtool clean-pkglibLTLIBRARIES cscopelist ctags \
+	distclean distclean-compile distclean-generic \
+	distclean-libtool distclean-tags distdir dvi dvi-am html \
+	html-am info info-am install install-am install-binPROGRAMS \
+	install-data install-data-am install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-pkgdataDATA install-pkglibLTLIBRARIES \
+	install-ps install-ps-am install-strip installcheck \
+	installcheck-am installdirs maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-compile \
+	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags uninstall uninstall-am uninstall-binPROGRAMS \
+	uninstall-pkgdataDATA uninstall-pkglibLTLIBRARIES
 
 
 ppl_swiprolog.cc: $(interface_generator_dependencies)
diff --git a/interfaces/Prolog/SWI/README.swiprolog b/interfaces/Prolog/SWI/README.swiprolog
index 867b39b..d3c5a7c 100644
--- a/interfaces/Prolog/SWI/README.swiprolog
+++ b/interfaces/Prolog/SWI/README.swiprolog
@@ -1,5 +1,5 @@
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is free software; as a special exception the author gives
 # unlimited permission to copy and/or distribute it, with or without
diff --git a/interfaces/Prolog/SWI/pl_clpq.cc b/interfaces/Prolog/SWI/pl_clpq.cc
index 42e8283..04fd85c 100644
--- a/interfaces/Prolog/SWI/pl_clpq.cc
+++ b/interfaces/Prolog/SWI/pl_clpq.cc
@@ -1,6 +1,6 @@
 /* C++ main program for the toy PPL/SWI-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/pl_clpq.pl b/interfaces/Prolog/SWI/pl_clpq.pl
index 55f692e..246ddfe 100644
--- a/interfaces/Prolog/SWI/pl_clpq.pl
+++ b/interfaces/Prolog/SWI/pl_clpq.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the toy PPL/SWI-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/ppl_interface_generator_swiprolog_cc.m4 b/interfaces/Prolog/SWI/ppl_interface_generator_swiprolog_cc.m4
index 049e46f..fa71c76 100644
--- a/interfaces/Prolog/SWI/ppl_interface_generator_swiprolog_cc.m4
+++ b/interfaces/Prolog/SWI/ppl_interface_generator_swiprolog_cc.m4
@@ -3,7 +3,7 @@ m4_divert(-1)
 
 dnl This m4 file generates the file ppl_swiprolog.cc.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/SWI/ppl_pl.cc b/interfaces/Prolog/SWI/ppl_pl.cc
index 98fd7fa..a2d279a 100644
--- a/interfaces/Prolog/SWI/ppl_pl.cc
+++ b/interfaces/Prolog/SWI/ppl_pl.cc
@@ -1,6 +1,6 @@
 /* Main program for SWI-Prolog with the PPL statically linked.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/ppl_prolog_sysdep.hh b/interfaces/Prolog/SWI/ppl_prolog_sysdep.hh
index 477e69e..0830c7d 100644
--- a/interfaces/Prolog/SWI/ppl_prolog_sysdep.hh
+++ b/interfaces/Prolog/SWI/ppl_prolog_sysdep.hh
@@ -1,6 +1,6 @@
 /* System-dependent part of the Prolog interfaces: stub for SWI Prolog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/ppl_swiprolog.pl b/interfaces/Prolog/SWI/ppl_swiprolog.pl
index d4ce1a6..4c19beb 100644
--- a/interfaces/Prolog/SWI/ppl_swiprolog.pl
+++ b/interfaces/Prolog/SWI/ppl_swiprolog.pl
@@ -1,6 +1,6 @@
 /* Loader for the SWI-Prolog interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/swi_cfli.hh b/interfaces/Prolog/SWI/swi_cfli.hh
index 414d1f4..4fe3071 100644
--- a/interfaces/Prolog/SWI/swi_cfli.hh
+++ b/interfaces/Prolog/SWI/swi_cfli.hh
@@ -1,6 +1,6 @@
 /* SWI-Prolog Common Foreign Language Interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -171,7 +171,7 @@ Prolog_atom_from_string(const char* s) {
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1) {
+                          Prolog_term_ref a1) {
 #if PLVERSION >= 50800
   return PL_cons_functor(t, PL_new_functor(f, 1), a1);
 #else
@@ -186,7 +186,7 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2) {
+                          Prolog_term_ref a1, Prolog_term_ref a2) {
 #if PLVERSION >= 50800
   return PL_cons_functor(t, PL_new_functor(f, 2), a1, a2);
 #else
@@ -201,8 +201,8 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3) {
 #if PLVERSION >= 50800
   return PL_cons_functor(t, PL_new_functor(f, 3), a1, a2, a3);
 #else
@@ -217,8 +217,8 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4) {
 #if PLVERSION >= 50800
   return PL_cons_functor(t, PL_new_functor(f, 4), a1, a2, a3, a4);
 #else
@@ -232,7 +232,7 @@ Prolog_construct_compound(Prolog_term_ref t, Prolog_atom f,
 */
 inline int
 Prolog_construct_cons(Prolog_term_ref c,
-		      Prolog_term_ref h, Prolog_term_ref t) {
+                      Prolog_term_ref h, Prolog_term_ref t) {
 #if PLVERSION >= 50800
   return PL_cons_list(c, h, t);
 #else
diff --git a/interfaces/Prolog/SWI/swi_efli.cc b/interfaces/Prolog/SWI/swi_efli.cc
index a1e0f8b..9ba49ca 100644
--- a/interfaces/Prolog/SWI/swi_efli.cc
+++ b/interfaces/Prolog/SWI/swi_efli.cc
@@ -1,6 +1,6 @@
 /* SWI-Prolog extended foreign language interface: definitions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/swi_efli.hh b/interfaces/Prolog/SWI/swi_efli.hh
index 060de2f..037f3ac 100644
--- a/interfaces/Prolog/SWI/swi_efli.hh
+++ b/interfaces/Prolog/SWI/swi_efli.hh
@@ -1,6 +1,6 @@
 /* SWI-Prolog extended foreign language interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/SWI/swi_pl_check.pl b/interfaces/Prolog/SWI/swi_pl_check.pl
index ddb3667..c64957a 100644
--- a/interfaces/Prolog/SWI/swi_pl_check.pl
+++ b/interfaces/Prolog/SWI/swi_pl_check.pl
@@ -1,6 +1,6 @@
 /* Main program for the PPL/SWI-Prolog checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -30,9 +30,9 @@ main :-
     open(obtained_pchk, write, Stream),
     set_output(Stream),
     (check_all ->
-	write('OK')
+        write('OK')
     ;
-	write('FAILURE')
+        write('FAILURE')
     ),
     nl,
     close(Stream),
diff --git a/interfaces/Prolog/SWI/swi_prolog_generated_test.pl b/interfaces/Prolog/SWI/swi_prolog_generated_test.pl
index c1e95db..79484ad 100644
--- a/interfaces/Prolog/SWI/swi_prolog_generated_test.pl
+++ b/interfaces/Prolog/SWI/swi_prolog_generated_test.pl
@@ -1,6 +1,6 @@
 /* Main program for the PPL/SWI-Prolog generated tests.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -38,9 +38,9 @@ main :-
     open(obtained_pgt, write, Stream),
     set_output(Stream),
     (check_all ->
-	write('OK')
+        write('OK')
     ;
-	write('FAILURE')
+        write('FAILURE')
     ),
     nl,
     close(Stream),
diff --git a/interfaces/Prolog/XSB/Makefile.am b/interfaces/Prolog/XSB/Makefile.am
index 105d351..862766f 100644
--- a/interfaces/Prolog/XSB/Makefile.am
+++ b/interfaces/Prolog/XSB/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Prolog/XSB/Makefile.in b/interfaces/Prolog/XSB/Makefile.in
index 91f960c..f315baa 100644
--- a/interfaces/Prolog/XSB/Makefile.in
+++ b/interfaces/Prolog/XSB/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Prolog/XSB
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -100,10 +117,23 @@ libppl_xsb_la_OBJECTS = $(am_libppl_xsb_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_xsb_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \
 	$(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \
 	$(AM_CXXFLAGS) $(CXXFLAGS) $(libppl_xsb_la_LDFLAGS) $(LDFLAGS) \
 	-o $@
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -116,17 +146,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -135,20 +164,24 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_xsb_la_SOURCES) $(nodist_libppl_xsb_la_SOURCES) \
 	$(nodist_EXTRA_libppl_xsb_la_SOURCES)
 DIST_SOURCES = $(libppl_xsb_la_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -578,12 +611,14 @@ $(am__aclocal_m4_deps):
 
 clean-noinstLTLIBRARIES:
 	-test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES)
-	@list='$(noinst_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(noinst_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl_xsb.la: $(libppl_xsb_la_OBJECTS) $(libppl_xsb_la_DEPENDENCIES) $(EXTRA_libppl_xsb_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_xsb_la_LINK)  $(libppl_xsb_la_OBJECTS) $(libppl_xsb_la_LIBADD) $(LIBS)
 
@@ -1231,8 +1266,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-pkgdataDATA: $(pkgdata_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkgdatadir)" || $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)"
 	@list='$(pkgdata_DATA)'; test -n "$(pkgdatadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgdatadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1297,6 +1335,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1447,8 +1499,8 @@ uninstall-am: uninstall-pkgdataDATA
 .MAKE: all check check-am install install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-am check-local clean \
-	clean-generic clean-libtool clean-noinstLTLIBRARIES ctags \
-	distclean distclean-compile distclean-generic \
+	clean-generic clean-libtool clean-noinstLTLIBRARIES cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_H.m4 b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_H.m4
index 4950fa1..b346f41 100644
--- a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_H.m4
+++ b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_H.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 dnl This m4 file generates the file ppl_xsb.H.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_cc.m4 b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_cc.m4
index 7a86d27..e97d8cb 100644
--- a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_cc.m4
+++ b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_cc.m4
@@ -3,7 +3,7 @@ m4_divert(-1)
 
 dnl This m4 file generates the file ppl_xsb.cc.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_hh.m4 b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_hh.m4
index 88d3042..2465c68 100644
--- a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_hh.m4
+++ b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_hh.m4
@@ -3,7 +3,7 @@ m4_divert(-1)
 
 dnl This m4 file generates the file ppl_xsb.cc.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_prolog_generated_test_P.m4 b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_prolog_generated_test_P.m4
index dd926f6..1e4dedd 100644
--- a/interfaces/Prolog/XSB/ppl_interface_generator_xsb_prolog_generated_test_P.m4
+++ b/interfaces/Prolog/XSB/ppl_interface_generator_xsb_prolog_generated_test_P.m4
@@ -5,7 +5,7 @@ dnl This m4 file defines macros needed for generating
 dnl the XSB dependent code for xsb_prolog_generated_test.pl.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/XSB/ppl_prolog_sysdep.hh b/interfaces/Prolog/XSB/ppl_prolog_sysdep.hh
index 08a5af1..83eede1 100644
--- a/interfaces/Prolog/XSB/ppl_prolog_sysdep.hh
+++ b/interfaces/Prolog/XSB/ppl_prolog_sysdep.hh
@@ -1,6 +1,6 @@
 /* System-dependent part of the Prolog interfaces: stub for XSB.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/XSB/xsb_cfli.hh b/interfaces/Prolog/XSB/xsb_cfli.hh
index 434baba..fa6c8f0 100644
--- a/interfaces/Prolog/XSB/xsb_cfli.hh
+++ b/interfaces/Prolog/XSB/xsb_cfli.hh
@@ -1,6 +1,6 @@
 /* XSB Prolog Common Foreign Language Interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -134,7 +134,7 @@ Prolog_atom_from_string(const char* s) {
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1) {
+                          Prolog_term_ref a1) {
   prolog_term new_compound = p2p_new();
   c2p_functor(f, 1, new_compound);
   p2p_unify(p2p_arg(new_compound, 1), a1);
@@ -148,7 +148,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2) {
+                          Prolog_term_ref a1, Prolog_term_ref a2) {
   prolog_term new_compound = p2p_new();
   c2p_functor(f, 2, new_compound);
   p2p_unify(p2p_arg(new_compound, 1), a1);
@@ -163,8 +163,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3) {
   prolog_term new_compound = p2p_new();
   c2p_functor(f, 3, new_compound);
   p2p_unify(p2p_arg(new_compound, 1), a1);
@@ -180,8 +180,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4) {
   prolog_term new_compound = p2p_new();
   c2p_functor(f, 4, new_compound);
   p2p_unify(p2p_arg(new_compound, 1), a1);
@@ -197,7 +197,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_cons(Prolog_term_ref& c,
-		      Prolog_term_ref h, Prolog_term_ref t) {
+                      Prolog_term_ref h, Prolog_term_ref t) {
   prolog_term new_cons = p2p_new();
   c2p_list(new_cons);
   p2p_unify(p2p_car(new_cons), h);
diff --git a/interfaces/Prolog/XSB/xsb_clpq.P b/interfaces/Prolog/XSB/xsb_clpq.P
index d4d7ac7..dd0e452 100644
--- a/interfaces/Prolog/XSB/xsb_clpq.P
+++ b/interfaces/Prolog/XSB/xsb_clpq.P
@@ -1,6 +1,6 @@
 /* Prolog main program for the toy PPL/XSB-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,19 +27,19 @@ site: http://bugseng.com/products/ppl/ . */
 
 :- import append/3, length/2, member/2 from basics.
 :- import
-	ppl_initialize/0,
-	ppl_finalize/0,
-	ppl_new_C_Polyhedron_from_space_dimension/3,
-	ppl_new_NNC_Polyhedron_from_space_dimension/3,
-	ppl_new_C_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_delete_Polyhedron/1,
+        ppl_initialize/0,
+        ppl_finalize/0,
+        ppl_new_C_Polyhedron_from_space_dimension/3,
+        ppl_new_NNC_Polyhedron_from_space_dimension/3,
+        ppl_new_C_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
+        ppl_delete_Polyhedron/1,
         ppl_Polyhedron_is_empty/1,
-	ppl_Polyhedron_space_dimension/2,
+        ppl_Polyhedron_space_dimension/2,
         ppl_Polyhedron_add_constraints/2,
-	ppl_Polyhedron_get_constraints/2,
-	ppl_Polyhedron_add_space_dimensions_and_embed/2,
-	ppl_Polyhedron_remove_higher_space_dimensions/2
+        ppl_Polyhedron_get_constraints/2,
+        ppl_Polyhedron_add_space_dimensions_and_embed/2,
+        ppl_Polyhedron_remove_higher_space_dimensions/2
    from ppl_xsb.
 
 :- [ppl_xsb].
diff --git a/interfaces/Prolog/XSB/xsb_clpq2.P b/interfaces/Prolog/XSB/xsb_clpq2.P
index cc6da7f..4218630 100644
--- a/interfaces/Prolog/XSB/xsb_clpq2.P
+++ b/interfaces/Prolog/XSB/xsb_clpq2.P
@@ -1,6 +1,6 @@
 /* Prolog main program for the toy PPL/XSB-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,20 +27,20 @@ site: http://bugseng.com/products/ppl/ . */
 
 :- import append/3, length/2, member/2 from basics.
 :- import
-	ppl_initialize/0,
-	ppl_finalize/0,
-	ppl_new_C_Polyhedron_from_space_dimension/3,
-	ppl_new_NNC_Polyhedron_from_space_dimension/3,
-	ppl_new_C_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_delete_Polyhedron/1,
+        ppl_initialize/0,
+        ppl_finalize/0,
+        ppl_new_C_Polyhedron_from_space_dimension/3,
+        ppl_new_NNC_Polyhedron_from_space_dimension/3,
+        ppl_new_C_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
+        ppl_delete_Polyhedron/1,
         ppl_Polyhedron_is_empty/1,
-	ppl_Polyhedron_space_dimension/2,
+        ppl_Polyhedron_space_dimension/2,
         ppl_Polyhedron_add_constraints/2,
-	ppl_Polyhedron_get_constraints/2,
-	ppl_Polyhedron_add_space_dimensions_and_embed/2,
-	ppl_Polyhedron_remove_space_dimensions/2,
-	ppl_Polyhedron_remove_higher_space_dimensions/2
+        ppl_Polyhedron_get_constraints/2,
+        ppl_Polyhedron_add_space_dimensions_and_embed/2,
+        ppl_Polyhedron_remove_space_dimensions/2,
+        ppl_Polyhedron_remove_higher_space_dimensions/2
    from ppl_xsb.
 
 :- [ppl_xsb].
diff --git a/interfaces/Prolog/XSB/xsb_efli.cc b/interfaces/Prolog/XSB/xsb_efli.cc
index e17dd25..689eb90 100644
--- a/interfaces/Prolog/XSB/xsb_efli.cc
+++ b/interfaces/Prolog/XSB/xsb_efli.cc
@@ -1,6 +1,6 @@
 /* XSB extended foreign language interface: definitions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "xsb_efli.hh"
-#include "ppl_prolog_common.defs.hh"
+#include "ppl_prolog_common_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
diff --git a/interfaces/Prolog/XSB/xsb_efli.hh b/interfaces/Prolog/XSB/xsb_efli.hh
index efa79a4..5dc4336 100644
--- a/interfaces/Prolog/XSB/xsb_efli.hh
+++ b/interfaces/Prolog/XSB/xsb_efli.hh
@@ -1,6 +1,6 @@
 /* XSB extended foreign language interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/XSB/xsb_pl_check.P b/interfaces/Prolog/XSB/xsb_pl_check.P
index 0426c72..76b13e9 100644
--- a/interfaces/Prolog/XSB/xsb_pl_check.P
+++ b/interfaces/Prolog/XSB/xsb_pl_check.P
@@ -1,6 +1,6 @@
 /* Prolog main program for the PPL/XSB-Prolog predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,112 +27,112 @@ site: http://bugseng.com/products/ppl/ . */
 
 :- import append/3, length/2, member/2 from basics.
 :- import
-	ppl_version_major/1,
-	ppl_version_minor/1,
-	ppl_version_revision/1,
-	ppl_version_beta/1,
-	ppl_version/1,
-	ppl_banner/1,
-	ppl_max_space_dimension/1,
+        ppl_version_major/1,
+        ppl_version_minor/1,
+        ppl_version_revision/1,
+        ppl_version_beta/1,
+        ppl_version/1,
+        ppl_banner/1,
+        ppl_max_space_dimension/1,
         ppl_Coefficient_bits/1,
-	ppl_Coefficient_is_bounded/0,
-	ppl_Coefficient_max/1,
-	ppl_Coefficient_min/1,
-	ppl_initialize/0,
-	ppl_finalize/0,
+        ppl_Coefficient_is_bounded/0,
+        ppl_Coefficient_max/1,
+        ppl_Coefficient_min/1,
+        ppl_initialize/0,
+        ppl_finalize/0,
         ppl_set_irrational_precision/1,
         ppl_irrational_precision/1,
-	ppl_set_timeout_exception_atom/1,
-	ppl_timeout_exception_atom/1,
-	ppl_set_timeout/1,
-	ppl_reset_timeout/0,
+        ppl_set_timeout_exception_atom/1,
+        ppl_timeout_exception_atom/1,
+        ppl_set_timeout/1,
+        ppl_reset_timeout/0,
         ppl_set_rounding_for_PPL/0,
         ppl_restore_pre_PPL_rounding/0,
-	ppl_new_C_Polyhedron_from_space_dimension/3,
-	ppl_new_NNC_Polyhedron_from_space_dimension/3,
-	ppl_new_C_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_C_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_C_Polyhedron/2,
-	ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
-	ppl_new_C_Polyhedron_from_constraints/2,
-	ppl_new_NNC_Polyhedron_from_constraints/2,
-	ppl_new_C_Polyhedron_from_generators/2,
-	ppl_new_NNC_Polyhedron_from_generators/2,
+        ppl_new_C_Polyhedron_from_space_dimension/3,
+        ppl_new_NNC_Polyhedron_from_space_dimension/3,
+        ppl_new_C_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_C_Polyhedron_from_NNC_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_C_Polyhedron/2,
+        ppl_new_NNC_Polyhedron_from_NNC_Polyhedron/2,
+        ppl_new_C_Polyhedron_from_constraints/2,
+        ppl_new_NNC_Polyhedron_from_constraints/2,
+        ppl_new_C_Polyhedron_from_generators/2,
+        ppl_new_NNC_Polyhedron_from_generators/2,
         ppl_C_Polyhedron_upper_bound_assign_if_exact/2,
         ppl_NNC_Polyhedron_upper_bound_assign_if_exact/2,
-	ppl_Polyhedron_swap/2,
-	ppl_delete_Polyhedron/1,
-	ppl_Polyhedron_space_dimension/2,
-	ppl_Polyhedron_affine_dimension/2,
-	ppl_Polyhedron_get_constraints/2,
-	ppl_Polyhedron_get_minimized_constraints/2,
-	ppl_Polyhedron_get_generators/2,
-	ppl_Polyhedron_get_minimized_generators/2,
-	ppl_Polyhedron_relation_with_constraint/3,
-	ppl_Polyhedron_relation_with_generator/3,
-	ppl_Polyhedron_is_empty/1,
-	ppl_Polyhedron_is_universe/1,
-	ppl_Polyhedron_is_bounded/1,
-	ppl_Polyhedron_contains_integer_point/1,
-	ppl_Polyhedron_bounds_from_above/2,
-	ppl_Polyhedron_bounds_from_below/2,
-	ppl_Polyhedron_maximize/5,
-	ppl_Polyhedron_maximize_with_point/6,
-	ppl_Polyhedron_minimize/5,
-	ppl_Polyhedron_minimize_with_point/6,
+        ppl_Polyhedron_swap/2,
+        ppl_delete_Polyhedron/1,
+        ppl_Polyhedron_space_dimension/2,
+        ppl_Polyhedron_affine_dimension/2,
+        ppl_Polyhedron_get_constraints/2,
+        ppl_Polyhedron_get_minimized_constraints/2,
+        ppl_Polyhedron_get_generators/2,
+        ppl_Polyhedron_get_minimized_generators/2,
+        ppl_Polyhedron_relation_with_constraint/3,
+        ppl_Polyhedron_relation_with_generator/3,
+        ppl_Polyhedron_is_empty/1,
+        ppl_Polyhedron_is_universe/1,
+        ppl_Polyhedron_is_bounded/1,
+        ppl_Polyhedron_contains_integer_point/1,
+        ppl_Polyhedron_bounds_from_above/2,
+        ppl_Polyhedron_bounds_from_below/2,
+        ppl_Polyhedron_maximize/5,
+        ppl_Polyhedron_maximize_with_point/6,
+        ppl_Polyhedron_minimize/5,
+        ppl_Polyhedron_minimize_with_point/6,
         ppl_Polyhedron_is_topologically_closed/1,
-	ppl_Polyhedron_contains_Polyhedron/2,
-	ppl_Polyhedron_strictly_contains_Polyhedron/2,
-	ppl_Polyhedron_is_disjoint_from_Polyhedron/2,
+        ppl_Polyhedron_contains_Polyhedron/2,
+        ppl_Polyhedron_strictly_contains_Polyhedron/2,
+        ppl_Polyhedron_is_disjoint_from_Polyhedron/2,
         ppl_Polyhedron_equals_Polyhedron/2,
-	ppl_Polyhedron_OK/1,
-	ppl_Polyhedron_add_constraint/2,
-	ppl_Polyhedron_add_generator/2,
-	ppl_Polyhedron_add_constraints/2,
-	ppl_Polyhedron_add_generators/2,
-	ppl_Polyhedron_intersection_assign/2,
-	ppl_Polyhedron_poly_hull_assign/2,
-	ppl_Polyhedron_poly_difference_assign/2,
-	ppl_Polyhedron_affine_image/4,
-	ppl_Polyhedron_affine_preimage/4,
-	ppl_Polyhedron_bounded_affine_image/5,
-	ppl_Polyhedron_bounded_affine_preimage/5,
-	ppl_Polyhedron_generalized_affine_image/5,
-	ppl_Polyhedron_generalized_affine_preimage/5,
-	ppl_Polyhedron_generalized_affine_image_lhs_rhs/4,
-	ppl_Polyhedron_generalized_affine_preimage_lhs_rhs/4,
-	ppl_Polyhedron_time_elapse_assign/2,
+        ppl_Polyhedron_OK/1,
+        ppl_Polyhedron_add_constraint/2,
+        ppl_Polyhedron_add_generator/2,
+        ppl_Polyhedron_add_constraints/2,
+        ppl_Polyhedron_add_generators/2,
+        ppl_Polyhedron_intersection_assign/2,
+        ppl_Polyhedron_poly_hull_assign/2,
+        ppl_Polyhedron_poly_difference_assign/2,
+        ppl_Polyhedron_affine_image/4,
+        ppl_Polyhedron_affine_preimage/4,
+        ppl_Polyhedron_bounded_affine_image/5,
+        ppl_Polyhedron_bounded_affine_preimage/5,
+        ppl_Polyhedron_generalized_affine_image/5,
+        ppl_Polyhedron_generalized_affine_preimage/5,
+        ppl_Polyhedron_generalized_affine_image_lhs_rhs/4,
+        ppl_Polyhedron_generalized_affine_preimage_lhs_rhs/4,
+        ppl_Polyhedron_time_elapse_assign/2,
         ppl_Polyhedron_topological_closure_assign/1,
-	ppl_Polyhedron_BHRZ03_widening_assign_with_tokens/4,
-	ppl_Polyhedron_BHRZ03_widening_assign/2,
-	ppl_Polyhedron_limited_BHRZ03_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_limited_BHRZ03_extrapolation_assign/3,
-	ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign/3,
-	ppl_Polyhedron_H79_widening_assign_with_tokens/4,
-	ppl_Polyhedron_H79_widening_assign/2,
-	ppl_Polyhedron_limited_H79_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_limited_H79_extrapolation_assign/3,
-	ppl_Polyhedron_bounded_H79_extrapolation_assign_with_tokens/5,
-	ppl_Polyhedron_bounded_H79_extrapolation_assign/3,
-	ppl_Polyhedron_add_space_dimensions_and_project/2,
-	ppl_Polyhedron_add_space_dimensions_and_embed/2,
-	ppl_Polyhedron_concatenate_assign/2,
-	ppl_Polyhedron_remove_space_dimensions/2,
-	ppl_Polyhedron_remove_higher_space_dimensions/2,
-	ppl_Polyhedron_expand_space_dimension/3,
-	ppl_Polyhedron_fold_space_dimensions/3,
-	ppl_Polyhedron_map_space_dimensions/2,
+        ppl_Polyhedron_BHRZ03_widening_assign_with_tokens/4,
+        ppl_Polyhedron_BHRZ03_widening_assign/2,
+        ppl_Polyhedron_limited_BHRZ03_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_limited_BHRZ03_extrapolation_assign/3,
+        ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_bounded_BHRZ03_extrapolation_assign/3,
+        ppl_Polyhedron_H79_widening_assign_with_tokens/4,
+        ppl_Polyhedron_H79_widening_assign/2,
+        ppl_Polyhedron_limited_H79_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_limited_H79_extrapolation_assign/3,
+        ppl_Polyhedron_bounded_H79_extrapolation_assign_with_tokens/5,
+        ppl_Polyhedron_bounded_H79_extrapolation_assign/3,
+        ppl_Polyhedron_add_space_dimensions_and_project/2,
+        ppl_Polyhedron_add_space_dimensions_and_embed/2,
+        ppl_Polyhedron_concatenate_assign/2,
+        ppl_Polyhedron_remove_space_dimensions/2,
+        ppl_Polyhedron_remove_higher_space_dimensions/2,
+        ppl_Polyhedron_expand_space_dimension/3,
+        ppl_Polyhedron_fold_space_dimensions/3,
+        ppl_Polyhedron_map_space_dimensions/2,
         ppl_Polyhedron_constrains/2,
         ppl_Polyhedron_unconstrain_space_dimension/2,
         ppl_Polyhedron_unconstrain_space_dimensions/2,
         ppl_termination_test_C_Polyhedron_MS/1,
         ppl_termination_test_C_Polyhedron_PR/1,
-	ppl_new_MIP_Problem_from_space_dimension/2,
-	ppl_new_MIP_Problem/5,
-	ppl_new_MIP_Problem_from_MIP_Problem/2,
-	ppl_MIP_Problem_swap/2,
-	ppl_delete_MIP_Problem/1,
+        ppl_new_MIP_Problem_from_space_dimension/2,
+        ppl_new_MIP_Problem/5,
+        ppl_new_MIP_Problem_from_MIP_Problem/2,
+        ppl_MIP_Problem_swap/2,
+        ppl_delete_MIP_Problem/1,
         ppl_MIP_Problem_space_dimension/2,
         ppl_MIP_Problem_integer_space_dimensions/2,
         ppl_MIP_Problem_constraints/2,
diff --git a/interfaces/Prolog/YAP/Makefile.am b/interfaces/Prolog/YAP/Makefile.am
index c79ad45..69cfe19 100644
--- a/interfaces/Prolog/YAP/Makefile.am
+++ b/interfaces/Prolog/YAP/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Prolog/YAP/Makefile.in b/interfaces/Prolog/YAP/Makefile.in
index 8f710d4..02ee103 100644
--- a/interfaces/Prolog/YAP/Makefile.in
+++ b/interfaces/Prolog/YAP/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Prolog/YAP
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -132,10 +149,23 @@ ppl_yap_la_OBJECTS = $(am_ppl_yap_la_OBJECTS) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 ppl_yap_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(ppl_yap_la_LDFLAGS) $(LDFLAGS) -o $@
 @ENABLE_SHARED_TRUE at am_ppl_yap_la_rpath = -rpath $(pkglibdir)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -148,17 +178,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -167,20 +196,24 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(ppl_yap_la_SOURCES) $(nodist_ppl_yap_la_SOURCES) \
 	$(nodist_EXTRA_ppl_yap_la_SOURCES)
 DIST_SOURCES = $(am__ppl_yap_la_SOURCES_DIST)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DATA = $(pkgdata_DATA)
 ETAGS = etags
 CTAGS = ctags
@@ -577,7 +610,6 @@ $(ACLOCAL_M4):  $(am__aclocal_m4_deps)
 $(am__aclocal_m4_deps):
 install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkglibdir)" || $(MKDIR_P) "$(DESTDIR)$(pkglibdir)"
 	@list='$(pkglib_LTLIBRARIES)'; test -n "$(pkglibdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -585,6 +617,8 @@ install-pkglibLTLIBRARIES: $(pkglib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkglibdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkglibdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(pkglibdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(pkglibdir)"; \
 	}
@@ -600,12 +634,14 @@ uninstall-pkglibLTLIBRARIES:
 
 clean-pkglibLTLIBRARIES:
 	-test -z "$(pkglib_LTLIBRARIES)" || rm -f $(pkglib_LTLIBRARIES)
-	@list='$(pkglib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(pkglib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 ppl_yap.la: $(ppl_yap_la_OBJECTS) $(ppl_yap_la_DEPENDENCIES) $(EXTRA_ppl_yap_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(ppl_yap_la_LINK) $(am_ppl_yap_la_rpath) $(ppl_yap_la_OBJECTS) $(ppl_yap_la_LIBADD) $(LIBS)
 
@@ -1254,8 +1290,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-pkgdataDATA: $(pkgdata_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(pkgdatadir)" || $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)"
 	@list='$(pkgdata_DATA)'; test -n "$(pkgdatadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgdatadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgdatadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1320,6 +1359,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1468,8 +1521,8 @@ uninstall-am: uninstall-pkgdataDATA uninstall-pkglibLTLIBRARIES
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-am check-local clean \
-	clean-generic clean-libtool clean-pkglibLTLIBRARIES ctags \
-	distclean distclean-compile distclean-generic \
+	clean-generic clean-libtool clean-pkglibLTLIBRARIES cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/interfaces/Prolog/YAP/README.yap b/interfaces/Prolog/YAP/README.yap
index db5ea39..01c9fda 100644
--- a/interfaces/Prolog/YAP/README.yap
+++ b/interfaces/Prolog/YAP/README.yap
@@ -1,5 +1,5 @@
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is free software; as a special exception the author gives
 # unlimited permission to copy and/or distribute it, with or without
diff --git a/interfaces/Prolog/YAP/ppl_interface_generator_yap_cc.m4 b/interfaces/Prolog/YAP/ppl_interface_generator_yap_cc.m4
index 5acee83..3141f40 100644
--- a/interfaces/Prolog/YAP/ppl_interface_generator_yap_cc.m4
+++ b/interfaces/Prolog/YAP/ppl_interface_generator_yap_cc.m4
@@ -3,7 +3,7 @@ m4_divert(-1)
 
 dnl This m4 file generates the file ppl_yap.cc.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/YAP/ppl_prolog_sysdep.hh b/interfaces/Prolog/YAP/ppl_prolog_sysdep.hh
index d114c59..82b0ffb 100644
--- a/interfaces/Prolog/YAP/ppl_prolog_sysdep.hh
+++ b/interfaces/Prolog/YAP/ppl_prolog_sysdep.hh
@@ -1,6 +1,6 @@
 /* System-dependent part of the Prolog interfaces: stub for YAP.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/YAP/ppl_yap.pl b/interfaces/Prolog/YAP/ppl_yap.pl
index e309bd5..9cfdcad 100644
--- a/interfaces/Prolog/YAP/ppl_yap.pl
+++ b/interfaces/Prolog/YAP/ppl_yap.pl
@@ -1,6 +1,6 @@
 /* Loader for the YAP Prolog interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/YAP/yap_cfli.hh b/interfaces/Prolog/YAP/yap_cfli.hh
index 7730b7c..d0dbbc2 100644
--- a/interfaces/Prolog/YAP/yap_cfli.hh
+++ b/interfaces/Prolog/YAP/yap_cfli.hh
@@ -1,6 +1,6 @@
 /* YAP Prolog Common Foreign Language Interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -128,7 +128,7 @@ Prolog_atom_from_string(const char* s) {
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1) {
+                          Prolog_term_ref a1) {
   YAP_Term args[1];
   args[0] = a1;
   t = YAP_MkApplTerm(YAP_MkFunctor(f, 1), 1, args);
@@ -141,7 +141,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2) {
+                          Prolog_term_ref a1, Prolog_term_ref a2) {
   YAP_Term args[2];
   args[0] = a1;
   args[1] = a2;
@@ -155,8 +155,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3) {
   YAP_Term args[3];
   args[0] = a1;
   args[1] = a2;
@@ -171,8 +171,8 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
-			  Prolog_term_ref a1, Prolog_term_ref a2,
-			  Prolog_term_ref a3, Prolog_term_ref a4) {
+                          Prolog_term_ref a1, Prolog_term_ref a2,
+                          Prolog_term_ref a3, Prolog_term_ref a4) {
   YAP_Term args[4];
   args[0] = a1;
   args[1] = a2;
@@ -187,7 +187,7 @@ Prolog_construct_compound(Prolog_term_ref& t, Prolog_atom f,
 */
 inline int
 Prolog_construct_cons(Prolog_term_ref& c,
-		      Prolog_term_ref h, Prolog_term_ref t) {
+                      Prolog_term_ref h, Prolog_term_ref t) {
   c = YAP_MkPairTerm(h, t);
   return 1;
 }
@@ -264,7 +264,7 @@ Prolog_get_long(Prolog_term_ref t, long* lp) {
     }
     YAP_BigNumOfTerm(t, tmp_mpz_t);
     if (mpz_cmp_si(tmp_mpz_t, LONG_MIN) >= 0
-	&& mpz_cmp_si(tmp_mpz_t, LONG_MAX) <= 0)
+        && mpz_cmp_si(tmp_mpz_t, LONG_MAX) <= 0)
       *lp = mpz_get_si(tmp_mpz_t);
     else
       return 0;
diff --git a/interfaces/Prolog/YAP/yap_clpq.pl b/interfaces/Prolog/YAP/yap_clpq.pl
index 30e142a..c72793c 100644
--- a/interfaces/Prolog/YAP/yap_clpq.pl
+++ b/interfaces/Prolog/YAP/yap_clpq.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the toy PPL/YAP-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/YAP/yap_clpq2.pl b/interfaces/Prolog/YAP/yap_clpq2.pl
index f150104..e582fe3 100644
--- a/interfaces/Prolog/YAP/yap_clpq2.pl
+++ b/interfaces/Prolog/YAP/yap_clpq2.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the 2nd toy PPL/YAP-Prolog CLP(Q) interpreter.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/YAP/yap_efli.cc b/interfaces/Prolog/YAP/yap_efli.cc
index 9277440..196f815 100644
--- a/interfaces/Prolog/YAP/yap_efli.cc
+++ b/interfaces/Prolog/YAP/yap_efli.cc
@@ -1,6 +1,6 @@
 /* YAP extended foreign language interface: definitions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/YAP/yap_efli.hh b/interfaces/Prolog/YAP/yap_efli.hh
index b6dbba6..98fb20d 100644
--- a/interfaces/Prolog/YAP/yap_efli.hh
+++ b/interfaces/Prolog/YAP/yap_efli.hh
@@ -1,6 +1,6 @@
 /* YAP extended foreign language interface: declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/Prolog/YAP/yap_pl_check.pl b/interfaces/Prolog/YAP/yap_pl_check.pl
index 302f807..40adbb8 100644
--- a/interfaces/Prolog/YAP/yap_pl_check.pl
+++ b/interfaces/Prolog/YAP/yap_pl_check.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the PPL/YAP-Prolog predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -28,8 +28,8 @@ prolog_system('YAP').
 
 main :-
     (check_all ->
-	write('OK')
+        write('OK')
     ;
-	write('FAILURE')
+        write('FAILURE')
     ),
     nl.
diff --git a/interfaces/Prolog/YAP/yap_prolog_generated_test.pl b/interfaces/Prolog/YAP/yap_prolog_generated_test.pl
index 3bc6d01..af68b4b 100644
--- a/interfaces/Prolog/YAP/yap_prolog_generated_test.pl
+++ b/interfaces/Prolog/YAP/yap_prolog_generated_test.pl
@@ -1,6 +1,6 @@
 /* Prolog main program for the PPL/YAP-Prolog predicate checker.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -29,8 +29,8 @@ prolog_system('YAP').
 
 main :-
     (check_all ->
-	write('OK')
+        write('OK')
     ;
-	write('FAILURE')
+        write('FAILURE')
     ),
     nl.
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_cc_code.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_cc_code.m4
index a9d64f0..a7f739c 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_cc_code.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_cc_code.m4
@@ -6,7 +6,7 @@ files ppl_prolog_DOMAIN.cc for each interface domain DOMAIN
 in ppl_interface instantiations.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -62,18 +62,18 @@ ppl_new_ at TOPOLOGY@@CLASS at _from_space_dimension(Prolog_term_ref t_nd,
 
   m4_define(`ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND at _code',
 `extern "C" Prolog_foreign_return_type
-ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND@(
-                     Prolog_term_ref t_ph_source, Prolog_term_ref t_ph)
+ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND@
+(Prolog_term_ref t_ph_source, Prolog_term_ref t_ph)
 {
-  static const char* where =
-                   "ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND@/2";
+  static const char* where
+    = "ppl_new_ at TOPOLOGY@@CLASS at _from_@FRIEND@/2";
   try {
     @TOPOLOGY@@CPP_CLASS@* ph;
-    const @B_FRIEND@* ph_source
-        = static_cast<const @B_FRIEND@*>
+    const @B_FRIEND@* const ph_source
+      = static_cast<const @B_FRIEND@*>
         (term_to_handle<@B_FRIEND@ >(t_ph_source, where));
     PPL_CHECK(ph_source);
-        ph = new @TOPOLOGY@@CPP_CLASS@(*ph_source);
+    ph = new @TOPOLOGY@@CPP_CLASS@(*ph_source);
     Prolog_term_ref tmp = Prolog_new_term_ref();
     Prolog_put_address(tmp, ph);
     if (Prolog_unify(t_ph, tmp)) {
@@ -217,7 +217,8 @@ m4_define(`ppl_ at CLASS@_get_ at CLASS_REPRESENT@s_code',
                                    Prolog_term_ref t_glist) {
   static const char* where = "ppl_ at CLASS@_get_ at CLASS_REPRESENT@s/2";
   try {
-    const @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
+    const @CPP_CLASS@* const ph
+      = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
 
     Prolog_term_ref tail = Prolog_new_term_ref();
@@ -241,7 +242,8 @@ m4_define(`ppl_ at CLASS@_get_minimized_ at CLASS_REPRESENT@s_code',
                                              Prolog_term_ref t_glist) {
   static const char* where = "ppl_ at CLASS@_get_minimized_ at CLASS_REPRESENT@s/2";
   try {
-    const @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
+    const @CPP_CLASS@* const ph
+      = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
 
     Prolog_term_ref tail = Prolog_new_term_ref();
@@ -703,7 +705,8 @@ m4_define(`ppl_ at CLASS@_ at HAS_PROPERTY@_code',
   ppl_ at CLASS@_ at HAS_PROPERTY@(Prolog_term_ref t_ph) {
   static const char* where = "ppl_ at CLASS@_ at HAS_PROPERTY@/1";
   try {
-    const @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
+    const @CPP_CLASS@* const ph
+      = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
     if (ph->@HAS_PROPERTY@())
       return PROLOG_SUCCESS;
@@ -793,7 +796,7 @@ m4_define(`ppl_ at CLASS@_bounds_from_ at ABOVEBELOW@_code',
   try {
     @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
-    Linear_Expression l = build_linear_expression(t_expr, where);
+    const Linear_Expression l = build_linear_expression(t_expr, where);
     if (ph->bounds_from_ at ABOVEBELOW@(l))
       return PROLOG_SUCCESS;
   }
@@ -838,7 +841,8 @@ m4_define(`ppl_ at CLASS@_ at MAXMIN@_code',
                        Prolog_term_ref t_maxmin) {
   static const char* where = "ppl_ at CLASS@_ at MAXMIN@/5";
   try {
-    const @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
+    const @CPP_CLASS@* const ph
+      = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
     const Linear_Expression le = build_linear_expression(t_le_expr, where);
     PPL_DIRTY_TEMP_COEFFICIENT(n);
@@ -846,7 +850,7 @@ m4_define(`ppl_ at CLASS@_ at MAXMIN@_code',
     bool maxmin;
     if (ph->@MAXMIN@(le, n, d, maxmin)) {
       Prolog_term_ref t = Prolog_new_term_ref();
-      Prolog_atom a = (maxmin ? a_true : a_false);
+      const Prolog_atom a = (maxmin ? a_true : a_false);
       Prolog_put_atom(t, a);
       if (Prolog_unify_Coefficient(t_n, n)
           && Prolog_unify_Coefficient(t_d, d)
@@ -860,14 +864,15 @@ m4_define(`ppl_ at CLASS@_ at MAXMIN@_code',
 ')
 
 m4_define(`ppl_ at CLASS@_ at MAXMIN@_with_point_code',
-  `extern "C" Prolog_foreign_return_type
-  ppl_ at CLASS@_ at MAXMIN@_with_point(Prolog_term_ref t_ph,
-                                  Prolog_term_ref t_le_expr,
-                                  Prolog_term_ref t_n, Prolog_term_ref t_d,
-                                  Prolog_term_ref t_maxmin, Prolog_term_ref t_g) {
+`extern "C" Prolog_foreign_return_type
+ppl_ at CLASS@_ at MAXMIN@_with_point
+(Prolog_term_ref t_ph,
+ Prolog_term_ref t_le_expr,
+ Prolog_term_ref t_n, Prolog_term_ref t_d,
+ Prolog_term_ref t_maxmin, Prolog_term_ref t_g) {
   static const char* where = "ppl_ at CLASS@_ at MAXMIN@_with_point/6";
   try {
-    const @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
+    const @CPP_CLASS@* const ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
     const Linear_Expression le = build_linear_expression(t_le_expr, where);
     PPL_DIRTY_TEMP_COEFFICIENT(n);
@@ -876,7 +881,7 @@ m4_define(`ppl_ at CLASS@_ at MAXMIN@_with_point_code',
     Generator g(point());
     if (ph->@MAXMIN@(le, n, d, maxmin, g)) {
       Prolog_term_ref t = Prolog_new_term_ref();
-      Prolog_atom a = (maxmin ? a_true : a_false);
+      const Prolog_atom a = (maxmin ? a_true : a_false);
       Prolog_put_atom(t, a);
       if (Prolog_unify_Coefficient(t_n, n)
           && Prolog_unify_Coefficient(t_d, d)
@@ -930,7 +935,7 @@ m4_define(`ppl_ at CLASS@_OK_code',
   ppl_ at CLASS@_OK(Prolog_term_ref t_ph) {
   static const char* where = "ppl_ at CLASS@_OK/1";
   try {
-    const @CPP_CLASS@* ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
+    const @CPP_CLASS@* const ph = term_to_handle<@CPP_CLASS@ >(t_ph, where);
     PPL_CHECK(ph);
     if (ph->OK())
       return PROLOG_SUCCESS;
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_cc_files.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_cc_files.m4
index e57071b..8068595 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_cc_files.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_cc_files.m4
@@ -7,7 +7,7 @@ dnl in ppl_interface instantiations.m4 using the code in
 dnl ppl_interface_generator_prolog_cc_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -47,7 +47,7 @@ m4_include(`ppl_interface_generator_copyright')`'dnl
 */
 
 #include "ppl_prolog_sysdep.hh"
-#include "ppl_prolog_common.defs.hh"
+#include "ppl_prolog_common_defs.hh"
 
 ')
 
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_dox.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_dox.m4
index ca7f938..2d1523c 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_dox.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_dox.m4
@@ -4,7 +4,7 @@ m4_divert(-1)
 dnl This m4 file generates the file Prolog_configured_domains.dox
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_dox_code.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_dox_code.m4
index 994e48e..fdc7c4b 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_dox_code.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_dox_code.m4
@@ -3,7 +3,7 @@ m4_divert(-1)
 dnl This m4 file contains the program code for generating Prolog_interface.dox
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_hh_code.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_hh_code.m4
index 1183769..e0066fa 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_hh_code.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_hh_code.m4
@@ -6,7 +6,7 @@ dnl files ppl_prolog_DOMAIN.hh for each interface domain DOMAIN
 dnl in ppl_interface instantiations.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_hh_files.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_hh_files.m4
index 256abc2..2212ad8 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_hh_files.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_hh_files.m4
@@ -7,7 +7,7 @@ dnl in ppl_interface instantiations.m4 using the code in
 dnl ppl_interface_generator_prolog_hh_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -61,7 +61,7 @@ m4_undefine(`m4_current_interface')`'dnl
 
 m4_divert`'dnl
 
-`#'include "ppl_prolog_common.defs.hh"`'dnl
+`#'include "ppl_prolog_common_defs.hh"`'dnl
 dnl
 dnl Generate the non-fixed part of the file.
 m4_all_code`'dnl
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_procedure_generators.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_procedure_generators.m4
index 364335e..ed54e60 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_procedure_generators.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_procedure_generators.m4
@@ -7,7 +7,7 @@ dnl   ppl_interface_generator_common_procedure_generators.m4;
 dnl - the list of library predicates needed for the system dependent files.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/ppl_interface_generator_prolog_systems.m4 b/interfaces/Prolog/ppl_interface_generator_prolog_systems.m4
index 9329f14..eb7476c 100644
--- a/interfaces/Prolog/ppl_interface_generator_prolog_systems.m4
+++ b/interfaces/Prolog/ppl_interface_generator_prolog_systems.m4
@@ -5,7 +5,7 @@ dnl This m4 file defines macros needed for generating
 dnl the Prolog system-dependent code files.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/ppl_prolog_common.cc b/interfaces/Prolog/ppl_prolog_common.cc
index 9ed2fd7..d0dc23f 100644
--- a/interfaces/Prolog/ppl_prolog_common.cc
+++ b/interfaces/Prolog/ppl_prolog_common.cc
@@ -1,6 +1,6 @@
 /* Common part of the Prolog interfaces: variables and non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -21,7 +21,7 @@ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
 For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
-#include "ppl_prolog_common.defs.hh"
+#include "ppl_prolog_common_defs.hh"
 #include <exception>
 #include <stdexcept>
 #include <sstream>
@@ -316,19 +316,19 @@ handle_exception(const Prolog_unsigned_out_of_range& e) {
   Prolog_term_ref max = Prolog_new_term_ref();
   Prolog_put_ulong(max, e.max());
   Prolog_construct_compound(max,
-			    Prolog_atom_from_string("unsigned_integer"
-						    "_less_or_equal"),
-			    max);
+                            Prolog_atom_from_string("unsigned_integer"
+                                                    "_less_or_equal"),
+                            max);
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_construct_compound(expected, a_expected, max);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -339,15 +339,15 @@ handle_exception(const not_unsigned_integer& e) {
 
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_construct_compound(expected, a_expected,
-			    Prolog_atom_term_from_string("unsigned_integer"));
+                            Prolog_atom_term_from_string("unsigned_integer"));
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -358,16 +358,16 @@ handle_exception(const non_linear& e) {
 
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_construct_compound(expected, a_expected,
-			    Prolog_atom_term_from_string
-			    ("linear_expression_or_constraint"));
+                            Prolog_atom_term_from_string
+                            ("linear_expression_or_constraint"));
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -375,20 +375,20 @@ void
 handle_exception(const not_a_variable& e) {
   Prolog_term_ref found = Prolog_new_term_ref();
   Prolog_construct_compound(found, a_found,
-			    e.term());
+                            e.term());
 
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_construct_compound(expected, a_expected,
-			    Prolog_atom_term_from_string
-			    ("$VAR(unsigned_integer)"));
+                            Prolog_atom_term_from_string
+                            ("$VAR(unsigned_integer)"));
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -399,15 +399,15 @@ handle_exception(const not_an_integer& e) {
 
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_construct_compound(expected, a_expected,
-			    Prolog_atom_term_from_string("integer"));
+                            Prolog_atom_term_from_string("integer"));
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -418,15 +418,15 @@ handle_exception(const ppl_handle_mismatch& e) {
 
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_construct_compound(expected, a_expected,
-			    Prolog_atom_term_from_string("handle"));
+                            Prolog_atom_term_from_string("handle"));
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -438,17 +438,17 @@ handle_exception(const not_an_optimization_mode& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("max"), expected);
+                        Prolog_atom_term_from_string("max"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("min"), expected);
+                        Prolog_atom_term_from_string("min"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -460,19 +460,19 @@ handle_exception(const not_a_complexity_class& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("polynomial"), expected);
+                        Prolog_atom_term_from_string("polynomial"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("simplex"), expected);
+                        Prolog_atom_term_from_string("simplex"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("any"), expected);
+                        Prolog_atom_term_from_string("any"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -484,14 +484,14 @@ void
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pricing"), expected);
+                        Prolog_atom_term_from_string("pricing"), expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -503,21 +503,21 @@ void
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pricing_steepest_edge_float"),
+                        Prolog_atom_term_from_string("pricing_steepest_edge_float"),
                         expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pricing_steepest_edge_exact"),
+                        Prolog_atom_term_from_string("pricing_steepest_edge_exact"),
                         expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pricing_textbook"),
+                        Prolog_atom_term_from_string("pricing_textbook"),
                         expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -529,18 +529,18 @@ void
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("cutting_strategy"),
+                        Prolog_atom_term_from_string("cutting_strategy"),
                         expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pivot_row_strategy"),
+                        Prolog_atom_term_from_string("pivot_row_strategy"),
                         expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -552,26 +552,26 @@ void
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("cutting_strategy_first"),
+                        Prolog_atom_term_from_string("cutting_strategy_first"),
                         expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("cutting_strategy_deepest"),
+                        Prolog_atom_term_from_string("cutting_strategy_deepest"),
                         expected);
    Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("cutting_strategy_all"),
+                        Prolog_atom_term_from_string("cutting_strategy_all"),
                         expected);
    Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pivot_row_strategy_first"),
+                        Prolog_atom_term_from_string("pivot_row_strategy_first"),
                         expected);
     Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("pivot_row_strategy_max_column"),
+                        Prolog_atom_term_from_string("pivot_row_strategy_max_column"),
                         expected);
  Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -583,17 +583,17 @@ handle_exception(const not_universe_or_empty& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("universe"), expected);
+                        Prolog_atom_term_from_string("universe"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("empty"), expected);
+                        Prolog_atom_term_from_string("empty"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -605,17 +605,17 @@ handle_exception(const not_a_boolean& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("true"), expected);
+                        Prolog_atom_term_from_string("true"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("false"), expected);
+                        Prolog_atom_term_from_string("false"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -627,23 +627,23 @@ handle_exception(const not_a_bounded_integer_type_width& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("bits_8"), expected);
+                        Prolog_atom_term_from_string("bits_8"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("bits_16"), expected);
+                        Prolog_atom_term_from_string("bits_16"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("bits_32"), expected);
+                        Prolog_atom_term_from_string("bits_32"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("bits_64"), expected);
+                        Prolog_atom_term_from_string("bits_64"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("bits_128"), expected);
+                        Prolog_atom_term_from_string("bits_128"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -655,18 +655,18 @@ handle_exception(const not_a_bounded_integer_type_representation& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("unsigned"), expected);
+                        Prolog_atom_term_from_string("unsigned"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("signed_2_complement"),
+                        Prolog_atom_term_from_string("signed_2_complement"),
                         expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -678,22 +678,22 @@ handle_exception(const not_a_bounded_integer_type_overflow& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("overflow_wraps"),
+                        Prolog_atom_term_from_string("overflow_wraps"),
                         expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("overflow_undefined"),
+                        Prolog_atom_term_from_string("overflow_undefined"),
                         expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("overflow_impossible"),
+                        Prolog_atom_term_from_string("overflow_impossible"),
                         expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -705,23 +705,23 @@ handle_exception(const not_a_relation& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("="), expected);
+                        Prolog_atom_term_from_string("="), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string(">="), expected);
+                        Prolog_atom_term_from_string(">="), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("=<"), expected);
+                        Prolog_atom_term_from_string("=<"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string(">"), expected);
+                        Prolog_atom_term_from_string(">"), expected);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string("<"), expected);
+                        Prolog_atom_term_from_string("<"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -733,16 +733,16 @@ handle_exception(const not_a_nil_terminated_list& e) {
   Prolog_term_ref expected = Prolog_new_term_ref();
   Prolog_put_atom(expected, a_nil);
   Prolog_construct_cons(expected,
-			Prolog_atom_term_from_string
+                        Prolog_atom_term_from_string
                         ("Prolog_list"), expected);
   Prolog_construct_compound(expected, a_expected, expected);
 
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string(e.where()));
+                            Prolog_atom_term_from_string(e.where()));
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			    found, expected, where);
+                            found, expected, where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -750,15 +750,15 @@ void
 handle_exception(const PPL_integer_out_of_range& e) {
   Prolog_term_ref where = Prolog_new_term_ref();
   Prolog_construct_compound(where, a_where,
-			    Prolog_atom_term_from_string("Coefficient_to_integer_term"));
+                            Prolog_atom_term_from_string("Coefficient_to_integer_term"));
 
   Prolog_term_ref exception_term = Prolog_new_term_ref();
   std::ostringstream s;
   s << e.value();
   std::string str = s.str();
   Prolog_construct_compound(exception_term, a_ppl_representation_error,
-			    Prolog_atom_term_from_string(str.c_str()),
-			    where);
+                            Prolog_atom_term_from_string(str.c_str()),
+                            where);
   Prolog_raise_exception(exception_term);
 }
 
@@ -773,7 +773,7 @@ void
 handle_exception(const std::overflow_error& e) {
   Prolog_term_ref et = Prolog_new_term_ref();
   Prolog_construct_compound(et, a_ppl_overflow_error,
-			    Prolog_atom_term_from_string(e.what()));
+                            Prolog_atom_term_from_string(e.what()));
   Prolog_raise_exception(et);
 }
 
@@ -781,7 +781,7 @@ void
 handle_exception(const std::domain_error& e) {
   Prolog_term_ref et = Prolog_new_term_ref();
   Prolog_construct_compound(et, a_ppl_domain_error,
-			    Prolog_atom_term_from_string(e.what()));
+                            Prolog_atom_term_from_string(e.what()));
   Prolog_raise_exception(et);
 }
 
@@ -789,7 +789,7 @@ void
 handle_exception(const std::length_error& e) {
   Prolog_term_ref et = Prolog_new_term_ref();
   Prolog_construct_compound(et, a_ppl_length_error,
-			    Prolog_atom_term_from_string(e.what()));
+                            Prolog_atom_term_from_string(e.what()));
   Prolog_raise_exception(et);
 }
 
@@ -797,7 +797,7 @@ void
 handle_exception(const std::invalid_argument& e) {
   Prolog_term_ref et = Prolog_new_term_ref();
   Prolog_construct_compound(et, a_ppl_invalid_argument,
-			    Prolog_atom_term_from_string(e.what()));
+                            Prolog_atom_term_from_string(e.what()));
   Prolog_raise_exception(et);
 }
 
@@ -805,7 +805,7 @@ void
 handle_exception(const std::logic_error& e) {
   Prolog_term_ref et = Prolog_new_term_ref();
   Prolog_construct_compound(et, a_ppl_logic_error,
-			    Prolog_atom_term_from_string(e.what()));
+                            Prolog_atom_term_from_string(e.what()));
   Prolog_raise_exception(et);
 }
 
@@ -890,7 +890,7 @@ term_to_boolean(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_true || name == a_false))
+        && (name == a_true || name == a_false))
       return name;
   }
   throw not_a_boolean(t, where);
@@ -901,7 +901,7 @@ term_to_universe_or_empty(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_universe || name == a_empty))
+        && (name == a_universe || name == a_empty))
       return name;
   }
   throw not_universe_or_empty(t, where);
@@ -947,53 +947,53 @@ build_linear_expression(Prolog_term_ref t, const char* where) {
     switch (arity) {
     case 1:
       {
-	Prolog_term_ref arg = Prolog_new_term_ref();
-	Prolog_get_arg(1, t, arg);
-	if (functor == a_minus)
-	  // Unary minus.
-	  return -build_linear_expression(arg, where);
-	else if (functor == a_dollar_VAR)
-	  // Variable.
-	  return Variable(term_to_unsigned<dimension_type>(arg, where));
+        Prolog_term_ref arg = Prolog_new_term_ref();
+        Prolog_get_arg(1, t, arg);
+        if (functor == a_minus)
+          // Unary minus.
+          return -build_linear_expression(arg, where);
+        else if (functor == a_dollar_VAR)
+          // Variable.
+          return Variable(term_to_unsigned<dimension_type>(arg, where));
       }
       break;
     case 2:
       {
-	Prolog_term_ref arg1 = Prolog_new_term_ref();
-	Prolog_term_ref arg2 = Prolog_new_term_ref();
-	Prolog_get_arg(1, t, arg1);
-	Prolog_get_arg(2, t, arg2);
-	if (functor == a_plus)
-	  // Plus.
-	  if (Prolog_is_integer(arg1))
-	    return integer_term_to_Coefficient(arg1)
-	      + build_linear_expression(arg2, where);
-	  else if (Prolog_is_integer(arg2))
-	    return build_linear_expression(arg1, where)
-	      + integer_term_to_Coefficient(arg2);
-	  else
-	    return build_linear_expression(arg1, where)
-	      + build_linear_expression(arg2, where);
-	else if (functor == a_minus)
-	  // Minus.
-	  if (Prolog_is_integer(arg1))
-	    return integer_term_to_Coefficient(arg1)
-	      - build_linear_expression(arg2, where);
-	  else if (Prolog_is_integer(arg2))
-	    return build_linear_expression(arg1, where)
-	      - integer_term_to_Coefficient(arg2);
-	  else
-	    return build_linear_expression(arg1, where)
-	      - build_linear_expression(arg2, where);
-	else if (functor == a_asterisk) {
-	  // Times.
-	  if (Prolog_is_integer(arg1))
-	    return integer_term_to_Coefficient(arg1)
-	      * build_linear_expression(arg2, where);
-	  else if (Prolog_is_integer(arg2))
-	    return build_linear_expression(arg1, where)
-	      * integer_term_to_Coefficient(arg2);
-	}
+        Prolog_term_ref arg1 = Prolog_new_term_ref();
+        Prolog_term_ref arg2 = Prolog_new_term_ref();
+        Prolog_get_arg(1, t, arg1);
+        Prolog_get_arg(2, t, arg2);
+        if (functor == a_plus)
+          // Plus.
+          if (Prolog_is_integer(arg1))
+            return integer_term_to_Coefficient(arg1)
+              + build_linear_expression(arg2, where);
+          else if (Prolog_is_integer(arg2))
+            return build_linear_expression(arg1, where)
+              + integer_term_to_Coefficient(arg2);
+          else
+            return build_linear_expression(arg1, where)
+              + build_linear_expression(arg2, where);
+        else if (functor == a_minus)
+          // Minus.
+          if (Prolog_is_integer(arg1))
+            return integer_term_to_Coefficient(arg1)
+              - build_linear_expression(arg2, where);
+          else if (Prolog_is_integer(arg2))
+            return build_linear_expression(arg1, where)
+              - integer_term_to_Coefficient(arg2);
+          else
+            return build_linear_expression(arg1, where)
+              - build_linear_expression(arg2, where);
+        else if (functor == a_asterisk) {
+          // Times.
+          if (Prolog_is_integer(arg1))
+            return integer_term_to_Coefficient(arg1)
+              * build_linear_expression(arg2, where);
+          else if (Prolog_is_integer(arg2))
+            return build_linear_expression(arg1, where)
+              * integer_term_to_Coefficient(arg2);
+        }
       }
     }
   }
@@ -1013,60 +1013,60 @@ build_constraint(Prolog_term_ref t, const char* where) {
       Prolog_get_arg(1, t, arg1);
       Prolog_get_arg(2, t, arg2);
       if (functor == a_equal)
-	// =
-	if (Prolog_is_integer(arg1))
-	  return integer_term_to_Coefficient(arg1)
-	    == build_linear_expression(arg2, where);
-	else if (Prolog_is_integer(arg2))
-	  return build_linear_expression(arg1, where)
-	    == integer_term_to_Coefficient(arg2);
-	else
-	  return build_linear_expression(arg1, where)
-	    == build_linear_expression(arg2, where);
+        // =
+        if (Prolog_is_integer(arg1))
+          return integer_term_to_Coefficient(arg1)
+            == build_linear_expression(arg2, where);
+        else if (Prolog_is_integer(arg2))
+          return build_linear_expression(arg1, where)
+            == integer_term_to_Coefficient(arg2);
+        else
+          return build_linear_expression(arg1, where)
+            == build_linear_expression(arg2, where);
       else if (functor == a_equal_less_than)
-	// =<
-	if (Prolog_is_integer(arg1))
-	  return integer_term_to_Coefficient(arg1)
-	    <= build_linear_expression(arg2, where);
-	else if (Prolog_is_integer(arg2))
-	  return build_linear_expression(arg1, where)
-	    <= integer_term_to_Coefficient(arg2);
-	else
-	  return build_linear_expression(arg1, where)
-	    <= build_linear_expression(arg2, where);
+        // =<
+        if (Prolog_is_integer(arg1))
+          return integer_term_to_Coefficient(arg1)
+            <= build_linear_expression(arg2, where);
+        else if (Prolog_is_integer(arg2))
+          return build_linear_expression(arg1, where)
+            <= integer_term_to_Coefficient(arg2);
+        else
+          return build_linear_expression(arg1, where)
+            <= build_linear_expression(arg2, where);
       else if (functor == a_greater_than_equal)
-	// >=
-	if (Prolog_is_integer(arg1))
-	  return integer_term_to_Coefficient(arg1)
-	    >= build_linear_expression(arg2, where);
-	else if (Prolog_is_integer(arg2))
-	  return build_linear_expression(arg1, where)
-	    >= integer_term_to_Coefficient(arg2);
-	else
-	  return build_linear_expression(arg1, where)
-	    >= build_linear_expression(arg2, where);
+        // >=
+        if (Prolog_is_integer(arg1))
+          return integer_term_to_Coefficient(arg1)
+            >= build_linear_expression(arg2, where);
+        else if (Prolog_is_integer(arg2))
+          return build_linear_expression(arg1, where)
+            >= integer_term_to_Coefficient(arg2);
+        else
+          return build_linear_expression(arg1, where)
+            >= build_linear_expression(arg2, where);
       else if (functor == a_less_than)
-	// <
-	if (Prolog_is_integer(arg1))
-	  return integer_term_to_Coefficient(arg1)
-	    < build_linear_expression(arg2, where);
-	else if (Prolog_is_integer(arg2))
-	  return build_linear_expression(arg1, where)
-	    < integer_term_to_Coefficient(arg2);
-	else
-	  return build_linear_expression(arg1, where)
-	    < build_linear_expression(arg2, where);
+        // <
+        if (Prolog_is_integer(arg1))
+          return integer_term_to_Coefficient(arg1)
+            < build_linear_expression(arg2, where);
+        else if (Prolog_is_integer(arg2))
+          return build_linear_expression(arg1, where)
+            < integer_term_to_Coefficient(arg2);
+        else
+          return build_linear_expression(arg1, where)
+            < build_linear_expression(arg2, where);
       else if (functor == a_greater_than) {
-	// >
-	if (Prolog_is_integer(arg1))
-	  return integer_term_to_Coefficient(arg1)
-	    > build_linear_expression(arg2, where);
-	else if (Prolog_is_integer(arg2))
-	  return build_linear_expression(arg1, where)
-	    > integer_term_to_Coefficient(arg2);
-	else
-	  return build_linear_expression(arg1, where)
-	    > build_linear_expression(arg2, where);
+        // >
+        if (Prolog_is_integer(arg1))
+          return integer_term_to_Coefficient(arg1)
+            > build_linear_expression(arg2, where);
+        else if (Prolog_is_integer(arg2))
+          return build_linear_expression(arg1, where)
+            > integer_term_to_Coefficient(arg2);
+        else
+          return build_linear_expression(arg1, where)
+            > build_linear_expression(arg2, where);
       }
     }
   }
@@ -1087,51 +1087,51 @@ build_congruence(Prolog_term_ref t, const char* where) {
       Prolog_get_arg(2, t, arg2);
       if (functor == a_modulo) {
         // /
-	if (Prolog_is_integer(arg2)) {
+        if (Prolog_is_integer(arg2)) {
           Prolog_atom functor1;
           int arity1;
           Prolog_get_compound_name_arity(arg1, &functor1, &arity1);
           if (arity1 == 2) {
             if (functor1 == a_is_congruent_to) {
-      	      // =:=
+              // =:=
               Prolog_term_ref arg11 = Prolog_new_term_ref();
               Prolog_term_ref arg12 = Prolog_new_term_ref();
               Prolog_get_arg(1, arg1, arg11);
               Prolog_get_arg(2, arg1, arg12);
               if (Prolog_is_integer(arg12))
-	        return (build_linear_expression(arg11, where)
-			%= integer_term_to_Coefficient(arg12))
-		  / integer_term_to_Coefficient(arg2);
-	      else
-	        return (build_linear_expression(arg11, where)
-			%= build_linear_expression(arg12, where))
-		  / integer_term_to_Coefficient(arg2);
-	    }
-	  }
-	}
+                return (build_linear_expression(arg11, where)
+                        %= integer_term_to_Coefficient(arg12))
+                  / integer_term_to_Coefficient(arg2);
+              else
+                return (build_linear_expression(arg11, where)
+                        %= build_linear_expression(arg12, where))
+                  / integer_term_to_Coefficient(arg2);
+            }
+          }
+        }
       }
       else
         if (functor == a_is_congruent_to)
-      	  // =:=
+          // =:=
           if (Prolog_is_integer(arg2))
-	    return build_linear_expression(arg1, where)
-	      %= integer_term_to_Coefficient(arg2);
-	  else
-	    return build_linear_expression(arg1, where)
-	      %= build_linear_expression(arg2, where);
-	else
+            return build_linear_expression(arg1, where)
+              %= integer_term_to_Coefficient(arg2);
+          else
+            return build_linear_expression(arg1, where)
+              %= build_linear_expression(arg2, where);
+        else
           if (functor == a_equal) {
-	    // =
-	    if (Prolog_is_integer(arg1))
-	      return (build_linear_expression(arg2, where)
-		      %= integer_term_to_Coefficient(arg1)) / 0;
-	    else if (Prolog_is_integer(arg2))
-	      return (build_linear_expression(arg1, where)
-		      %= integer_term_to_Coefficient(arg2)) / 0;
-	    else
-	      return (build_linear_expression(arg1, where)
-		      %= build_linear_expression(arg2, where)) / 0;
-	  }
+            // =
+            if (Prolog_is_integer(arg1))
+              return (build_linear_expression(arg2, where)
+                      %= integer_term_to_Coefficient(arg1)) / 0;
+            else if (Prolog_is_integer(arg2))
+              return (build_linear_expression(arg1, where)
+                      %= integer_term_to_Coefficient(arg2)) / 0;
+            else
+              return (build_linear_expression(arg1, where)
+                      %= build_linear_expression(arg2, where)) / 0;
+          }
     }
   }
   // Invalid.
@@ -1148,13 +1148,13 @@ build_generator(Prolog_term_ref t, const char* where) {
       Prolog_term_ref arg = Prolog_new_term_ref();
       Prolog_get_arg(1, t, arg);
       if (functor == a_line)
-	return Generator::line(build_linear_expression(arg, where));
+        return Generator::line(build_linear_expression(arg, where));
       else if (functor == a_ray)
-	return Generator::ray(build_linear_expression(arg, where));
+        return Generator::ray(build_linear_expression(arg, where));
       else if (functor == a_point)
-	return Generator::point(build_linear_expression(arg, where));
+        return Generator::point(build_linear_expression(arg, where));
       else if (functor == a_closure_point)
-	return Generator::closure_point(build_linear_expression(arg, where));
+        return Generator::closure_point(build_linear_expression(arg, where));
     }
     else if (arity == 2) {
       Prolog_term_ref arg1 = Prolog_new_term_ref();
@@ -1163,11 +1163,11 @@ build_generator(Prolog_term_ref t, const char* where) {
       Prolog_get_arg(2, t, arg2);
       if (Prolog_is_integer(arg2)) {
         if (functor == a_point)
-	  return Generator::point(build_linear_expression(arg1, where),
-				  integer_term_to_Coefficient(arg2));
+          return Generator::point(build_linear_expression(arg1, where),
+                                  integer_term_to_Coefficient(arg2));
         else if (functor == a_closure_point)
-	  return Generator::closure_point(build_linear_expression(arg1, where),
-					  integer_term_to_Coefficient(arg2));
+          return Generator::closure_point(build_linear_expression(arg1, where),
+                                          integer_term_to_Coefficient(arg2));
       }
     }
   }
@@ -1185,11 +1185,11 @@ build_grid_generator(Prolog_term_ref t, const char* where) {
       Prolog_term_ref arg = Prolog_new_term_ref();
       Prolog_get_arg(1, t, arg);
       if (functor == a_grid_line)
-	return Grid_Generator::grid_line(build_linear_expression(arg, where));
+        return Grid_Generator::grid_line(build_linear_expression(arg, where));
       else if (functor == a_parameter)
-	return Grid_Generator::parameter(build_linear_expression(arg, where));
+        return Grid_Generator::parameter(build_linear_expression(arg, where));
       else if (functor == a_grid_point)
-	return Grid_Generator::grid_point(build_linear_expression(arg, where));
+        return Grid_Generator::grid_point(build_linear_expression(arg, where));
     }
     else if (arity == 2) {
       Prolog_term_ref arg1 = Prolog_new_term_ref();
@@ -1198,13 +1198,13 @@ build_grid_generator(Prolog_term_ref t, const char* where) {
       Prolog_get_arg(2, t, arg2);
       if (Prolog_is_integer(arg2)) {
         if (functor == a_grid_point)
-	  return Grid_Generator::grid_point(build_linear_expression(arg1,
-								    where),
-					    integer_term_to_Coefficient(arg2));
+          return Grid_Generator::grid_point(build_linear_expression(arg1,
+                                                                    where),
+                                            integer_term_to_Coefficient(arg2));
         else if (functor == a_parameter)
-	  return Grid_Generator::parameter(build_linear_expression(arg1,
-								   where),
-					  integer_term_to_Coefficient(arg2));
+          return Grid_Generator::parameter(build_linear_expression(arg1,
+                                                                   where),
+                                          integer_term_to_Coefficient(arg2));
       }
     }
   }
@@ -1220,31 +1220,31 @@ get_homogeneous_expression(const R& r) {
   dimension_type varid = 0;
   dimension_type space_dimension = r.space_dimension();
   while (varid < space_dimension
-	 && (coefficient = r.coefficient(Variable(varid))) == 0)
+         && (coefficient = r.coefficient(Variable(varid))) == 0)
     ++varid;
   if (varid >= space_dimension) {
     Prolog_put_long(so_far, 0);
   }
   else {
     Prolog_construct_compound(so_far, a_asterisk,
-			      Coefficient_to_integer_term(coefficient),
-			      variable_term(varid));
+                              Coefficient_to_integer_term(coefficient),
+                              variable_term(varid));
     while (true) {
       ++varid;
       while (varid < space_dimension
-	     && (coefficient = r.coefficient(Variable(varid))) == 0)
-	++varid;
+             && (coefficient = r.coefficient(Variable(varid))) == 0)
+        ++varid;
       if (varid >= space_dimension)
-	break;
+        break;
       else {
-	Prolog_term_ref addendum = Prolog_new_term_ref();
-	Prolog_construct_compound(addendum, a_asterisk,
-				  Coefficient_to_integer_term(coefficient),
-				  variable_term(varid));
-	Prolog_term_ref new_so_far = Prolog_new_term_ref();
-	Prolog_construct_compound(new_so_far, a_plus,
-				  so_far, addendum);
-	so_far = new_so_far;
+        Prolog_term_ref addendum = Prolog_new_term_ref();
+        Prolog_construct_compound(addendum, a_asterisk,
+                                  Coefficient_to_integer_term(coefficient),
+                                  variable_term(varid));
+        Prolog_term_ref new_so_far = Prolog_new_term_ref();
+        Prolog_construct_compound(new_so_far, a_plus,
+                                  so_far, addendum);
+        so_far = new_so_far;
       }
     }
   }
@@ -1329,12 +1329,12 @@ generator_term(const Generator& g) {
       constructor = a_point;
       const Coefficient& divisor = g.divisor();
       if (divisor == 1)
-	break;
+        break;
       else {
-	Prolog_construct_compound(t, constructor,
-				  get_homogeneous_expression(g),
-				  Coefficient_to_integer_term(divisor));
-	return t;
+        Prolog_construct_compound(t, constructor,
+                                  get_homogeneous_expression(g),
+                                  Coefficient_to_integer_term(divisor));
+        return t;
       }
     }
   case Generator::CLOSURE_POINT:
@@ -1342,12 +1342,12 @@ generator_term(const Generator& g) {
       constructor = a_closure_point;
       const Coefficient& divisor = g.divisor();
       if (divisor == 1)
-	break;
+        break;
       else {
-	Prolog_construct_compound(t, constructor,
-				  get_homogeneous_expression(g),
-				  Coefficient_to_integer_term(divisor));
-	return t;
+        Prolog_construct_compound(t, constructor,
+                                  get_homogeneous_expression(g),
+                                  Coefficient_to_integer_term(divisor));
+        return t;
       }
     }
   default:
@@ -1370,12 +1370,12 @@ grid_generator_term(const Grid_Generator& g) {
       constructor = a_parameter;
       const Coefficient& divisor = g.divisor();
       if (divisor == 1)
-	break;
+        break;
       else {
-	Prolog_construct_compound(t, constructor,
-				  get_homogeneous_expression(g),
-				  Coefficient_to_integer_term(divisor));
-	return t;
+        Prolog_construct_compound(t, constructor,
+                                  get_homogeneous_expression(g),
+                                  Coefficient_to_integer_term(divisor));
+        return t;
       }
     }
   case Grid_Generator::POINT:
@@ -1383,12 +1383,12 @@ grid_generator_term(const Grid_Generator& g) {
       constructor = a_grid_point;
       const Coefficient& divisor = g.divisor();
       if (divisor == 1)
-	break;
+        break;
       else {
-	Prolog_construct_compound(t, constructor,
-				  get_homogeneous_expression(g),
-				  Coefficient_to_integer_term(divisor));
-	return t;
+        Prolog_construct_compound(t, constructor,
+                                  get_homogeneous_expression(g),
+                                  Coefficient_to_integer_term(divisor));
+        return t;
       }
     }
   default:
@@ -1417,7 +1417,7 @@ term_to_Variable(Prolog_term_ref t, const char* where) {
       Prolog_term_ref arg = Prolog_new_term_ref();
       Prolog_get_arg(1, t, arg);
       return
-	Variable(term_to_unsigned<dimension_type>(arg, "term_to_Variable"));
+        Variable(term_to_unsigned<dimension_type>(arg, "term_to_Variable"));
     }
   }
   throw not_a_variable(t, where);
@@ -1436,7 +1436,7 @@ term_to_bounded_integer_type_width(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_bits_8 || name == a_bits_16
+        && (name == a_bits_8 || name == a_bits_16
             || name == a_bits_32 || name == a_bits_64
             || name == a_bits_128))
       return name;
@@ -1450,7 +1450,7 @@ term_to_bounded_integer_type_representation(Prolog_term_ref t,
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_unsigned || name == a_signed_2_complement))
+        && (name == a_unsigned || name == a_signed_2_complement))
       return name;
   }
   throw not_a_bounded_integer_type_representation(t, where);
@@ -1462,7 +1462,7 @@ term_to_bounded_integer_type_overflow(Prolog_term_ref t,
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_overflow_wraps
+        && (name == a_overflow_wraps
             || name == a_overflow_undefined
             || name == a_overflow_impossible))
       return name;
@@ -1475,7 +1475,7 @@ term_to_optimization_mode(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_max || name == a_min))
+        && (name == a_max || name == a_min))
       return name;
   }
   throw not_an_optimization_mode(t, where);
@@ -1486,7 +1486,7 @@ term_to_control_parameter_name(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_pricing || name == a_cutting_strategy))
+        && (name == a_pricing || name == a_cutting_strategy))
       return name;
   }
   throw not_a_control_parameter_name(t, where);
@@ -1497,7 +1497,7 @@ term_to_pip_problem_control_parameter_name(Prolog_term_ref t, const char* where)
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_cutting_strategy || name == a_pivot_row_strategy))
+        && (name == a_cutting_strategy || name == a_pivot_row_strategy))
       return name;
   }
   throw not_a_pip_problem_control_parameter_name(t, where);
@@ -1508,7 +1508,7 @@ term_to_control_parameter_value(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_pricing_steepest_edge_float
+        && (name == a_pricing_steepest_edge_float
             || name == a_pricing_steepest_edge_exact
             || name == a_pricing_textbook
             || name == a_cutting_strategy_first
@@ -1524,7 +1524,7 @@ term_to_pip_problem_control_parameter_value(Prolog_term_ref t,
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_cutting_strategy_first
+        && (name == a_cutting_strategy_first
             || name == a_cutting_strategy_deepest
             || name == a_cutting_strategy_all
             || name == a_pivot_row_strategy_first
@@ -1557,8 +1557,8 @@ max_representable_dimension(dimension_type d) {
 
 bool
 term_to_boundary(Prolog_term_ref t_b, Boundary_Kind kind,
-		 bool& finite, bool& closed,
-		 Coefficient& n, Coefficient& d) {
+                 bool& finite, bool& closed,
+                 Coefficient& n, Coefficient& d) {
   if (!Prolog_is_compound(t_b))
     return false;
 
@@ -1621,11 +1621,11 @@ term_to_relation(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_equal
-	    || name == a_greater_than_equal
-	    || name == a_equal_less_than
-	    || name == a_greater_than
-	    || name == a_less_than))
+        && (name == a_equal
+            || name == a_greater_than_equal
+            || name == a_equal_less_than
+            || name == a_greater_than
+            || name == a_less_than))
       return name;
   }
   throw not_a_relation(t, where);
@@ -1661,8 +1661,8 @@ rational_term(const Rational_Box::interval_type::boundary_type& q) {
     Prolog_put_Coefficient(t, numerator);
   else
     Prolog_construct_compound(t, a_slash,
-			      Coefficient_to_integer_term(numerator),
-			      Coefficient_to_integer_term(denominator));
+                              Coefficient_to_integer_term(numerator),
+                              Coefficient_to_integer_term(denominator));
   return t;
 }
 
@@ -1702,7 +1702,7 @@ term_to_complexity_class(Prolog_term_ref t, const char* where) {
   if (Prolog_is_atom(t)) {
     Prolog_atom name;
     if (Prolog_get_atom_name(t, &name)
-	&& (name == a_polynomial || name == a_simplex || name == a_any))
+        && (name == a_polynomial || name == a_simplex || name == a_any))
       return name;
   }
   throw not_a_complexity_class(t, where);
@@ -1864,8 +1864,8 @@ ppl_set_timeout_exception_atom(Prolog_term_ref t_tea) {
     if (Prolog_is_atom(t_tea)) {
       Prolog_atom tea;
       if (Prolog_get_atom_name(t_tea, &tea)) {
-	timeout_exception_atom = tea;
-	return PROLOG_SUCCESS;
+        timeout_exception_atom = tea;
+        return PROLOG_SUCCESS;
       }
     }
     Prolog_term_ref found = Prolog_new_term_ref();
@@ -1873,16 +1873,16 @@ ppl_set_timeout_exception_atom(Prolog_term_ref t_tea) {
 
     Prolog_term_ref expected = Prolog_new_term_ref();
     Prolog_construct_compound(expected, a_expected,
-			      Prolog_atom_term_from_string("atom"));
+                              Prolog_atom_term_from_string("atom"));
 
     Prolog_term_ref where = Prolog_new_term_ref();
     Prolog_construct_compound(where, a_where,
-			      Prolog_atom_term_from_string
-			      ("ppl_set_timeout_exception_atom"));
+                              Prolog_atom_term_from_string
+                              ("ppl_set_timeout_exception_atom"));
 
     Prolog_term_ref exception_term = Prolog_new_term_ref();
     Prolog_construct_compound(exception_term, a_ppl_invalid_argument,
-			      found, expected, where);
+                              found, expected, where);
     Prolog_raise_exception(exception_term);
     return PROLOG_FAILURE;
   }
@@ -1979,9 +1979,9 @@ ppl_Coefficient_min(Prolog_term_ref t_min) {
       PPL_DIRTY_TEMP_COEFFICIENT(min);
       min = std::numeric_limits<Coefficient>::min();
       if (Prolog_has_unbounded_integers
-	  || (min >= Prolog_min_integer && min <= Prolog_min_integer))
-	return Prolog_unify_Coefficient(t_min, min)
-	  ? PROLOG_SUCCESS : PROLOG_FAILURE;
+          || (min >= Prolog_min_integer && min <= Prolog_min_integer))
+        return Prolog_unify_Coefficient(t_min, min)
+          ? PROLOG_SUCCESS : PROLOG_FAILURE;
     }
   }
   CATCH_ALL;
@@ -1994,9 +1994,9 @@ ppl_Coefficient_max(Prolog_term_ref t_max) {
       PPL_DIRTY_TEMP_COEFFICIENT(max);
       max = std::numeric_limits<Coefficient>::max();
       if (Prolog_has_unbounded_integers
-	  || (max >= Prolog_min_integer && max <= Prolog_min_integer))
-	return Prolog_unify_Coefficient(t_max, max)
-	  ? PROLOG_SUCCESS : PROLOG_FAILURE;
+          || (max >= Prolog_min_integer && max <= Prolog_min_integer))
+        return Prolog_unify_Coefficient(t_max, max)
+          ? PROLOG_SUCCESS : PROLOG_FAILURE;
     }
   }
   CATCH_ALL;
@@ -2023,10 +2023,10 @@ ppl_new_MIP_Problem_from_space_dimension
 
 extern "C" Prolog_foreign_return_type
 ppl_new_MIP_Problem(Prolog_term_ref t_nd,
-		    Prolog_term_ref t_clist,
-		    Prolog_term_ref t_le_expr,
-		    Prolog_term_ref t_opt,
-		    Prolog_term_ref t_mip) {
+                    Prolog_term_ref t_clist,
+                    Prolog_term_ref t_le_expr,
+                    Prolog_term_ref t_opt,
+                    Prolog_term_ref t_mip) {
   static const char* where = "ppl_new_MIP_Problem/5";
   try {
     Constraint_System cs;
@@ -2044,7 +2044,7 @@ ppl_new_MIP_Problem(Prolog_term_ref t_nd,
 
     MIP_Problem* mip
       = new MIP_Problem(term_to_unsigned<dimension_type>(t_nd, where),
-			cs, le, mode);
+                        cs, le, mode);
     Prolog_term_ref tmp = Prolog_new_term_ref();
     Prolog_put_address(tmp, mip);
     if (Prolog_unify(t_mip, tmp)) {
@@ -2059,7 +2059,7 @@ ppl_new_MIP_Problem(Prolog_term_ref t_nd,
 
 extern "C" Prolog_foreign_return_type
 ppl_new_MIP_Problem_from_MIP_Problem(Prolog_term_ref t_mip_source,
-				     Prolog_term_ref t_mip) {
+                                     Prolog_term_ref t_mip) {
   static const char* where = "ppl_new_MIP_Problem_from_MIP_Problem/2";
   try {
     const MIP_Problem* mip_source
@@ -2119,7 +2119,7 @@ ppl_MIP_Problem_space_dimension(Prolog_term_ref t_mip, Prolog_term_ref t_sd) {
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_integer_space_dimensions(Prolog_term_ref t_mip,
-					 Prolog_term_ref t_vlist) {
+                                         Prolog_term_ref t_vlist) {
   static const char* where = "ppl_MIP_Problem_integer_space_dimensions/2";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2130,7 +2130,7 @@ ppl_MIP_Problem_integer_space_dimensions(Prolog_term_ref t_mip,
     const Variables_Set& i_vars = mip->integer_space_dimensions();
 
     for (Variables_Set::const_iterator i = i_vars.begin(),
-	   i_end = i_vars.end(); i != i_end; ++i)
+           i_end = i_vars.end(); i != i_end; ++i)
       Prolog_construct_cons(tail, variable_term(*i), tail);
 
     if (Prolog_unify(t_vlist, tail))
@@ -2141,7 +2141,7 @@ ppl_MIP_Problem_integer_space_dimensions(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_constraints(Prolog_term_ref t_mip,
-			    Prolog_term_ref t_clist) {
+                            Prolog_term_ref t_clist) {
   static const char* where = "ppl_MIP_Problem_constraints/2";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2150,7 +2150,7 @@ ppl_MIP_Problem_constraints(Prolog_term_ref t_mip,
     Prolog_term_ref tail = Prolog_new_term_ref();
     Prolog_put_atom(tail, a_nil);
     for (MIP_Problem::const_iterator i = mip->constraints_begin(),
-	   i_end = mip->constraints_end(); i != i_end; ++i)
+           i_end = mip->constraints_end(); i != i_end; ++i)
       Prolog_construct_cons(tail, constraint_term(*i), tail);
 
     if (Prolog_unify(t_clist, tail))
@@ -2161,7 +2161,7 @@ ppl_MIP_Problem_constraints(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_objective_function(Prolog_term_ref t_mip,
-				   Prolog_term_ref t_le_expr) {
+                                   Prolog_term_ref t_le_expr) {
   static const char* where = "ppl_MIP_Problem_objective_function/2";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2178,7 +2178,7 @@ ppl_MIP_Problem_objective_function(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_optimization_mode(Prolog_term_ref t_mip,
-				  Prolog_term_ref t_opt) {
+                                  Prolog_term_ref t_opt) {
   static const char* where = "ppl_MIP_Problem_optimization_mode/2";
   try {
     MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2223,7 +2223,7 @@ ppl_MIP_Problem_add_space_dimensions_and_embed
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_add_to_integer_space_dimensions(Prolog_term_ref t_mip,
-						Prolog_term_ref t_vlist) {
+                                                Prolog_term_ref t_vlist) {
   static const char* where
     = "ppl_MIP_Problem_add_to_integer_space_dimensions/2";
   try {
@@ -2260,7 +2260,7 @@ ppl_MIP_Problem_add_constraint(Prolog_term_ref t_mip, Prolog_term_ref t_c) {
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_add_constraints(Prolog_term_ref t_mip,
-				Prolog_term_ref t_clist) {
+                                Prolog_term_ref t_clist) {
   static const char* where = "ppl_MIP_Problem_add_constraints/2";
   try {
     MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2284,7 +2284,7 @@ ppl_MIP_Problem_add_constraints(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_set_objective_function(Prolog_term_ref t_mip,
-				       Prolog_term_ref t_le_expr) {
+                                       Prolog_term_ref t_le_expr) {
   static const char* where = "ppl_MIP_Problem_set_objective_function/2";
   try {
     MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2297,7 +2297,7 @@ ppl_MIP_Problem_set_objective_function(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_set_optimization_mode(Prolog_term_ref t_mip,
-				      Prolog_term_ref t_opt) {
+                                      Prolog_term_ref t_opt) {
   static const char* where = "ppl_MIP_Problem_set_optimization_mode/2";
   try {
     MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2313,7 +2313,7 @@ ppl_MIP_Problem_set_optimization_mode(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_set_control_parameter(Prolog_term_ref t_mip,
-				      Prolog_term_ref t_cp_value) {
+                                      Prolog_term_ref t_cp_value) {
   static const char* where = "ppl_MIP_Problem_set_control_parameter/2";
   try {
     MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2413,7 +2413,7 @@ ppl_MIP_Problem_solve(Prolog_term_ref t_mip, Prolog_term_ref t_status) {
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_feasible_point(Prolog_term_ref t_mip,
-			       Prolog_term_ref t_g) {
+                               Prolog_term_ref t_g) {
   static const char* where = "ppl_MIP_Problem_feasible_point/2";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2427,7 +2427,7 @@ ppl_MIP_Problem_feasible_point(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_optimizing_point(Prolog_term_ref t_mip,
-				 Prolog_term_ref t_g) {
+                                 Prolog_term_ref t_g) {
   static const char* where = "ppl_MIP_Problem_optimizing_point/2";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2441,8 +2441,8 @@ ppl_MIP_Problem_optimizing_point(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_optimal_value(Prolog_term_ref t_mip,
-			      Prolog_term_ref t_n,
-			      Prolog_term_ref t_d) {
+                              Prolog_term_ref t_n,
+                              Prolog_term_ref t_d) {
   static const char* where = "ppl_MIP_Problem_optimal_value/3";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2451,7 +2451,7 @@ ppl_MIP_Problem_optimal_value(Prolog_term_ref t_mip,
     PPL_DIRTY_TEMP_COEFFICIENT(d);
     mip->optimal_value(n, d);
     if (Prolog_unify_Coefficient(t_n, n)
-	&& Prolog_unify_Coefficient(t_d, d))
+        && Prolog_unify_Coefficient(t_d, d))
       return PROLOG_SUCCESS;
   }
   CATCH_ALL;
@@ -2459,9 +2459,9 @@ ppl_MIP_Problem_optimal_value(Prolog_term_ref t_mip,
 
 extern "C" Prolog_foreign_return_type
 ppl_MIP_Problem_evaluate_objective_function(Prolog_term_ref t_mip,
-					    Prolog_term_ref t_g,
-					    Prolog_term_ref t_n,
-					    Prolog_term_ref t_d) {
+                                            Prolog_term_ref t_g,
+                                            Prolog_term_ref t_n,
+                                            Prolog_term_ref t_d) {
   static const char* where = "ppl_MIP_Problem_evaluate_objective_function/4";
   try {
     const MIP_Problem* mip = term_to_handle<MIP_Problem>(t_mip, where);
@@ -2470,7 +2470,7 @@ ppl_MIP_Problem_evaluate_objective_function(Prolog_term_ref t_mip,
     PPL_DIRTY_TEMP_COEFFICIENT(d);
     mip->evaluate_objective_function(build_generator(t_g, where), n, d);
     if (Prolog_unify_Coefficient(t_n, n)
-	&& Prolog_unify_Coefficient(t_d, d))
+        && Prolog_unify_Coefficient(t_d, d))
       return PROLOG_SUCCESS;
   }
   CATCH_ALL;
@@ -2560,7 +2560,7 @@ ppl_new_PIP_Problem(Prolog_term_ref t_dim,
 
 extern "C" Prolog_foreign_return_type
 ppl_new_PIP_Problem_from_PIP_Problem(Prolog_term_ref t_pip_source,
-				     Prolog_term_ref t_pip) {
+                                     Prolog_term_ref t_pip) {
   static const char* where = "ppl_new_PIP_Problem_from_PIP_Problem/2";
   try {
     const PIP_Problem* pip_source
@@ -2631,7 +2631,7 @@ ppl_PIP_Problem_parameter_space_dimensions(Prolog_term_ref t_pip,
     const Variables_Set& params = pip->parameter_space_dimensions();
 
     for (Variables_Set::const_iterator i = params.begin(),
-	   i_end = params.end(); i != i_end; ++i)
+           i_end = params.end(); i != i_end; ++i)
       Prolog_construct_cons(tail, variable_term(*i), tail);
 
     if (Prolog_unify(t_vlist, tail))
@@ -2642,7 +2642,7 @@ ppl_PIP_Problem_parameter_space_dimensions(Prolog_term_ref t_pip,
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Problem_constraints(Prolog_term_ref t_pip,
-			    Prolog_term_ref t_clist) {
+                            Prolog_term_ref t_clist) {
   static const char* where = "ppl_PIP_Problem_constraints/2";
   try {
     const PIP_Problem* pip = term_to_handle<PIP_Problem>(t_pip, where);
@@ -2651,7 +2651,7 @@ ppl_PIP_Problem_constraints(Prolog_term_ref t_pip,
     Prolog_term_ref tail = Prolog_new_term_ref();
     Prolog_put_atom(tail, a_nil);
     for (PIP_Problem::const_iterator i = pip->constraints_begin(),
-	   i_end = pip->constraints_end(); i != i_end; ++i)
+           i_end = pip->constraints_end(); i != i_end; ++i)
       Prolog_construct_cons(tail, constraint_term(*i), tail);
 
     if (Prolog_unify(t_clist, tail))
@@ -2729,7 +2729,7 @@ ppl_PIP_Problem_add_constraint(Prolog_term_ref t_pip, Prolog_term_ref t_c) {
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Problem_add_constraints(Prolog_term_ref t_pip,
-				Prolog_term_ref t_clist) {
+                                Prolog_term_ref t_clist) {
   static const char* where = "ppl_PIP_Problem_add_constraints/2";
   try {
     PIP_Problem* pip = term_to_handle<PIP_Problem>(t_pip, where);
@@ -2808,7 +2808,7 @@ ppl_PIP_Problem_get_control_parameter(Prolog_term_ref t_pip,
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Problem_set_control_parameter(Prolog_term_ref t_pip,
-				      Prolog_term_ref t_cp_value) {
+                                      Prolog_term_ref t_cp_value) {
   static const char* where = "ppl_PIP_Problem_set_control_parameter/2";
   try {
     PIP_Problem* pip = term_to_handle<PIP_Problem>(t_pip, where);
@@ -2962,7 +2962,7 @@ ppl_PIP_Problem_ascii_dump(Prolog_term_ref t_pip) {
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Tree_Node_constraints(Prolog_term_ref t_pip,
-			      Prolog_term_ref t_cs) {
+                              Prolog_term_ref t_cs) {
   static const char* where = "ppl_PIP_Tree_Node_constraints/2";
   try {
     const PIP_Tree_Node* pip = term_to_handle<PIP_Tree_Node>(t_pip, where);
@@ -3048,8 +3048,8 @@ ppl_PIP_Tree_Node_artificials(Prolog_term_ref t_tree_node,
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Tree_Node_parametric_values(Prolog_term_ref t_pip,
-			                    Prolog_term_ref t_var,
-			                    Prolog_term_ref t_le) {
+                                            Prolog_term_ref t_var,
+                                            Prolog_term_ref t_le) {
   static const char* where = "ppl_PIP_Solution_Node_get_parametric_values/3";
   try {
     const PIP_Solution_Node* pip
@@ -3064,7 +3064,7 @@ ppl_PIP_Tree_Node_parametric_values(Prolog_term_ref t_pip,
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Tree_Node_true_child(Prolog_term_ref t_pip,
-			             Prolog_term_ref t_ptree) {
+                                     Prolog_term_ref t_ptree) {
   static const char* where = "ppl_PIP_Decision_Node_get_true_child/2";
   try {
     const PIP_Decision_Node* pip
@@ -3084,7 +3084,7 @@ ppl_PIP_Tree_Node_true_child(Prolog_term_ref t_pip,
 
 extern "C" Prolog_foreign_return_type
 ppl_PIP_Tree_Node_false_child(Prolog_term_ref t_pip,
-			              Prolog_term_ref t_ptree) {
+                                      Prolog_term_ref t_ptree) {
   static const char* where = "ppl_PIP_Decision_Node_get_false_child/2";
   try {
     const PIP_Decision_Node* pip
diff --git a/interfaces/Prolog/ppl_prolog_common.defs.hh b/interfaces/Prolog/ppl_prolog_common.defs.hh
deleted file mode 100644
index baf7400..0000000
--- a/interfaces/Prolog/ppl_prolog_common.defs.hh
+++ /dev/null
@@ -1,1084 +0,0 @@
-/* Common part of the Prolog interfaces: declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_prolog_common_defs_hh
-#define PPL_ppl_prolog_common_defs_hh 1
-
-#define PPL_NO_AUTOMATIC_INITIALIZATION
-#include "ppl.hh"
-#include "ppl_prolog_sysdep.hh"
-#include "interfaced_boxes.hh"
-#include <set>
-#include <vector>
-#include <exception>
-#include <stdexcept>
-#include <iostream>
-
-#ifndef PROLOG_TRACK_ALLOCATION
-#define PROLOG_TRACK_ALLOCATION 0
-#endif
-#ifndef NOISY_PROLOG_TRACK_ALLOCATION
-#define NOISY_PROLOG_TRACK_ALLOCATION 0
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interfaces {
-
-namespace Prolog {
-
-#if PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
-
-class Allocation_Tracker {
-public:
-  //! Construct an allocation tracker with no registered objects.
-  Allocation_Tracker();
-
-  /*! \brief
-    Register an object whose deletion is under the Prolog programmer
-    responsibility.
-  */
-  template <typename T>
-  void insert(const T* p);
-
-  /*! \brief
-    Register an object whose deletion is under the PPL library
-    responsibility.
-  */
-  template <typename T>
-  void weak_insert(const T* p);
-
-  //! Check whether the object was correctly registered.
-  template <typename T>
-  void check(const T* p) const;
-
-  /*! \brief
-    Unregister an object whose deletion is under the Prolog programmer
-    responsibility.
-  */
-  template <typename T>
-  void remove(const T* p);
-
-  /*! \brief
-    Destroy the allocation tracker: an error message will be output
-    if there still are registered objects whose deletion was under
-    the Prolog programmer responsibility.
-  */
-  ~Allocation_Tracker();
-
-private:
-  //! The type for recording a set of pointers to PPL library objects.
-  typedef std::set<const void*, std::less<const void*> > Set;
-
-  /*! \brief
-    A set of pointers to objects whose deallocation is under the
-    rensponsibility of the Prolog programmer: they should be deallocated
-    before the termination of the program.
-  */
-  Set s;
-
-  /*! \brief
-    A set of pointers to objects whose deallocation is under the
-    rensponsibility of the PPL library: they should not be deallocated
-    by the Prolog programmer.
-  */
-  Set weak_s;
-};
-
-extern Allocation_Tracker allocation_tracker;
-
-#define PPL_REGISTER(x)                       \
-  Parma_Polyhedra_Library::Interfaces::Prolog \
-  ::allocation_tracker.insert(x)
-#define PPL_WEAK_REGISTER(x)                    \
-  Parma_Polyhedra_Library::Interfaces::Prolog   \
-  ::allocation_tracker.weak_insert(x)
-#define PPL_UNREGISTER(x)                       \
-  Parma_Polyhedra_Library::Interfaces::Prolog   \
-  ::allocation_tracker.remove(x)
-#define PPL_CHECK(x)                            \
-  Parma_Polyhedra_Library::Interfaces::Prolog   \
-  ::allocation_tracker.check(x)
-
-#else // !PROLOG_TRACK_ALLOCATION && !NOISY_PROLOG_TRACK_ALLOCATION
-
-#define PPL_REGISTER(x)
-#define PPL_WEAK_REGISTER(x)
-#define PPL_UNREGISTER(x)
-#define PPL_CHECK(x)
-
-#endif // !PROLOG_TRACK_ALLOCATION && !NOISY_PROLOG_TRACK_ALLOCATION
-
-class internal_exception {
-private:
-  Prolog_term_ref t;
-  const char* w;
-
-public:
-  internal_exception(Prolog_term_ref term, const char* where)
-    : t(term),
-      w(where) {
-  }
-
-  virtual ~internal_exception() {
-  }
-
-  virtual Prolog_term_ref term() const {
-    return t;
-  }
-
-  virtual const char* where() const {
-    return w;
-  }
-};
-
-class Prolog_unsigned_out_of_range : public internal_exception {
-private:
-  unsigned long m;
-
-public:
-  Prolog_unsigned_out_of_range(Prolog_term_ref term,
-			       const char* where,
-			       unsigned long max)
-    : internal_exception(term, where),
-      m(max) {
-  }
-
-  unsigned long max() const {
-    return m;
-  }
-};
-
-class non_linear : public internal_exception {
-public:
-  non_linear(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_an_integer : public internal_exception {
-public:
-  not_an_integer(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_unsigned_integer : public internal_exception {
-public:
-  not_unsigned_integer(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_boolean : public internal_exception {
-public:
-  not_a_boolean(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_variable : public internal_exception {
-public:
-  not_a_variable(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_an_optimization_mode : public internal_exception {
-public:
-  not_an_optimization_mode(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_bounded_integer_type_width : public internal_exception {
-public:
-  not_a_bounded_integer_type_width(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_bounded_integer_type_representation : public internal_exception {
-public:
-  not_a_bounded_integer_type_representation(Prolog_term_ref term,
-                                            const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_bounded_integer_type_overflow : public internal_exception {
-public:
-  not_a_bounded_integer_type_overflow(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_complexity_class : public internal_exception {
-public:
-  not_a_complexity_class(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_control_parameter_name : public internal_exception {
-public:
-  not_a_control_parameter_name(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_control_parameter_value : public internal_exception {
-public:
-  not_a_control_parameter_value(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_pip_problem_control_parameter_name : public internal_exception {
-public:
-  not_a_pip_problem_control_parameter_name(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_pip_problem_control_parameter_value : public internal_exception {
-public:
-  not_a_pip_problem_control_parameter_value(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_universe_or_empty : public internal_exception {
-public:
-  not_universe_or_empty(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_relation : public internal_exception {
-public:
-  not_a_relation(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class not_a_nil_terminated_list : public internal_exception {
-public:
-  not_a_nil_terminated_list(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class PPL_integer_out_of_range {
-private:
-  Parma_Polyhedra_Library::Coefficient n;
-
-public:
-  PPL_integer_out_of_range(const Parma_Polyhedra_Library::Coefficient& value)
-    : n(value) {
-  }
-
-  const Parma_Polyhedra_Library::Coefficient value() const {
-    return n;
-  }
-};
-
-class ppl_handle_mismatch : public internal_exception {
-public:
-  ppl_handle_mismatch(Prolog_term_ref term, const char* where)
-    : internal_exception(term, where) {
-  }
-};
-
-class unknown_interface_error {
-private:
-  const char* w;
-
-public:
-  unknown_interface_error(const char* s)
-    : w(s) {
-  }
-
-  const char* where() const {
-    return w;
-  }
-};
-
-// For Prolog lists.
-extern Prolog_atom a_nil;
-
-// For variables.
-extern Prolog_atom a_dollar_VAR;
-
-// For linear expressions.
-extern Prolog_atom a_plus;
-extern Prolog_atom a_minus;
-extern Prolog_atom a_asterisk;
-
-// To represent rational numbers as fractions.
-extern Prolog_atom a_slash;
-
-// For constraints.
-extern Prolog_atom a_less_than;
-extern Prolog_atom a_equal_less_than;
-extern Prolog_atom a_equal;
-extern Prolog_atom a_greater_than_equal;
-extern Prolog_atom a_greater_than;
-
-// For congruences.
-extern Prolog_atom a_is_congruent_to;
-extern Prolog_atom a_modulo;
-
-// For generators.
-extern Prolog_atom a_line;
-extern Prolog_atom a_ray;
-extern Prolog_atom a_point;
-extern Prolog_atom a_closure_point;
-
-// For grid_generators.
-extern Prolog_atom a_grid_line;
-extern Prolog_atom a_parameter;
-extern Prolog_atom a_grid_point;
-
-// For the relation between a polyhedron and a constraint.
-extern Prolog_atom a_is_disjoint;
-extern Prolog_atom a_strictly_intersects;
-extern Prolog_atom a_is_included;
-extern Prolog_atom a_saturates;
-
-// For the relation between a polyhedron and a generator.
-extern Prolog_atom a_subsumes;
-
-// Denotes a closed interval boundary.
-extern Prolog_atom a_c;
-
-// Denotes the empty set such as the empty interval or polyhedron.
-extern Prolog_atom a_empty;
-
-// Denotes an open interval boundary.
-extern Prolog_atom a_o;
-
-// Denotes the constructor that turns two boundaries into a proper interval.
-extern Prolog_atom a_i;
-
-// Denote the -infinity and +infinity interval boundaries.
-extern Prolog_atom a_minf;
-extern Prolog_atom a_pinf;
-
-// Denote complexity classes.
-extern Prolog_atom a_polynomial;
-extern Prolog_atom a_simplex;
-extern Prolog_atom a_any;
-
-// Denote possible widths of bounded integer types.
-extern Prolog_atom a_bits_8;
-extern Prolog_atom a_bits_16;
-extern Prolog_atom a_bits_32;
-extern Prolog_atom a_bits_64;
-extern Prolog_atom a_bits_128;
-
-// Denote possible representations of bounded integer types.
-extern Prolog_atom a_unsigned;
-extern Prolog_atom a_signed_2_complement;
-
-// Denote possible overflow behavior of bounded integer types.
-extern Prolog_atom a_overflow_wraps;
-extern Prolog_atom a_overflow_undefined;
-extern Prolog_atom a_overflow_impossible;
-
-// Boolean constants.
-extern Prolog_atom a_true;
-extern Prolog_atom a_false;
-
-
-struct Prolog_Interface_Atom {
-  Prolog_atom* p_atom;
-  const char* name;
-};
-
-extern const Prolog_Interface_Atom prolog_interface_atoms[];
-
-void
-handle_exception(const Prolog_unsigned_out_of_range& e);
-
-void
-handle_exception(const not_unsigned_integer& e);
-
-void
-handle_exception(const not_a_boolean& e);
-
-void
-handle_exception(const non_linear& e);
-
-void
-handle_exception(const not_a_variable& e);
-
-void
-handle_exception(const not_an_integer& e);
-
-void
-handle_exception(const ppl_handle_mismatch& e);
-
-void
-handle_exception(const not_an_optimization_mode& e);
-
-void
-handle_exception(const not_a_complexity_class& e);
-
-void
-handle_exception(const not_a_bounded_integer_type_width& e);
-
-void
-handle_exception(const not_a_bounded_integer_type_representation& e);
-
-void
-handle_exception(const not_a_bounded_integer_type_overflow& e);
-
-void
-handle_exception(const not_a_control_parameter_name& e);
-
-void
-handle_exception(const not_a_control_parameter_value& e);
-
-void
-handle_exception(const not_a_pip_problem_control_parameter_name& e);
-
-void
-handle_exception(const not_a_pip_problem_control_parameter_value& e);
-
-void
-handle_exception(const not_universe_or_empty& e);
-
-void
-handle_exception(const not_a_relation& e);
-
-void
-handle_exception(const not_a_nil_terminated_list& e);
-
-void
-handle_exception(const PPL_integer_out_of_range& e);
-
-void
-handle_exception(const unknown_interface_error& e);
-
-void
-handle_exception(const std::overflow_error& e);
-
-void
-handle_exception(const std::domain_error& e);
-
-void
-handle_exception(const std::length_error& e);
-
-void
-handle_exception(const std::invalid_argument& e);
-
-void
-handle_exception(const std::logic_error& e);
-
-void
-handle_exception(const std::bad_alloc&);
-
-void
-handle_exception(const std::exception& e);
-
-void
-handle_exception();
-
-class timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-void
-handle_exception(const timeout_exception&);
-
-class deterministic_timeout_exception
-  : public Parma_Polyhedra_Library::Throwable {
-public:
-  void throw_me() const {
-    throw *this;
-  }
-  int priority() const {
-    return 0;
-  }
-};
-
-void
-handle_exception(const deterministic_timeout_exception&);
-
-#define CATCH_ALL \
-  catch (const Prolog_unsigned_out_of_range& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_unsigned_integer& e) { \
-    handle_exception(e); \
-  } \
-  catch (const non_linear& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_variable& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_an_integer& e) { \
-    handle_exception(e); \
-  } \
-  catch (const ppl_handle_mismatch& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_an_optimization_mode& e) {	\
-    handle_exception(e); \
-  } \
-  catch (const not_a_complexity_class& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_bounded_integer_type_width& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_bounded_integer_type_representation& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_bounded_integer_type_overflow& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_control_parameter_name& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_control_parameter_value& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_pip_problem_control_parameter_name& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_pip_problem_control_parameter_value& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_universe_or_empty& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_relation& e) { \
-    handle_exception(e); \
-  } \
-  catch (const not_a_nil_terminated_list& e) { \
-    handle_exception(e); \
-  } \
-  catch (const PPL_integer_out_of_range& e) { \
-    handle_exception(e); \
-  } \
-  catch (const unknown_interface_error& e) { \
-    handle_exception(e); \
-  } \
-  catch (const timeout_exception& e) { \
-    handle_exception(e); \
-  } \
-  catch (const deterministic_timeout_exception& e) { \
-    handle_exception(e); \
-  } \
-  catch(const std::overflow_error& e) { \
-    handle_exception(e); \
-  } \
-  catch(const std::domain_error& e) { \
-    handle_exception(e); \
-  } \
-  catch(const std::length_error& e) { \
-    handle_exception(e); \
-  } \
-  catch(const std::invalid_argument& e) { \
-    handle_exception(e); \
-  } \
-  catch (const std::logic_error& e) { \
-    handle_exception(e); \
-  } \
-  catch (const std::bad_alloc& e) { \
-    handle_exception(e); \
-  } \
-  catch (const std::exception& e) { \
-    handle_exception(e); \
-  } \
-  catch (...) { \
-    handle_exception(); \
-  } \
-  return PROLOG_FAILURE
-
-
-Prolog_term_ref
-variable_term(dimension_type varid);
-
-template <typename U>
-U
-term_to_unsigned(Prolog_term_ref t, const char* where) {
-  using namespace Parma_Polyhedra_Library;
-  using namespace Parma_Polyhedra_Library::Interfaces::Prolog;
-  if (!Prolog_is_integer(t))
-    throw not_unsigned_integer(t, where);
-
-  U d = 0;
-  long l;
-  if (Prolog_get_long(t, &l))
-    if (l < 0)
-      throw not_unsigned_integer(t, where);
-    else if (static_cast<unsigned long>(l) > std::numeric_limits<U>::max())
-      throw Prolog_unsigned_out_of_range(t, where,
-					 std::numeric_limits<U>::max());
-    else
-      d = l;
-  else {
-    PPL_DIRTY_TEMP_COEFFICIENT(v);
-    Prolog_get_Coefficient(t, v);
-    if (v < 0)
-      throw not_unsigned_integer(t, where);
-    Result r = assign_r(d, raw_value(v), ROUND_IGNORE);
-    if (result_overflow(r))
-      throw Prolog_unsigned_out_of_range(t, where,
-					 std::numeric_limits<U>::max());
-  }
-  return d;
-}
-
-Prolog_atom
-term_to_boolean(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_universe_or_empty(Prolog_term_ref t, const char* where);
-
-Prolog_term_ref
-interval_term(const Parma_Polyhedra_Library::Rational_Box::interval_type& i);
-
-Prolog_atom
-term_to_complexity_class(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_bounded_integer_type_width(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_bounded_integer_type_representation(Prolog_term_ref t,
-                                            const char* where);
-
-Prolog_atom
-term_to_bounded_integer_type_overflow(Prolog_term_ref t, const char* where);
-
-template <typename T>
-T*
-term_to_handle(Prolog_term_ref t, const char* where) {
-  if (Prolog_is_address(t)) {
-    void* p;
-    if (Prolog_get_address(t, &p))
-      return static_cast<T*>(p);
-  }
-  throw ppl_handle_mismatch(t, where);
-}
-
-enum Boundary_Kind {
-  LOWER_BOUNDARY,
-  UPPER_BOUNDARY
-};
-
-bool
-term_to_boundary(Prolog_term_ref t_b, Boundary_Kind kind,
-		 bool& finite, bool& closed,
-		 Parma_Polyhedra_Library::Coefficient& n, Parma_Polyhedra_Library::Coefficient& d);
-
-Parma_Polyhedra_Library::Relation_Symbol
-term_to_relation_symbol(Prolog_term_ref t_r, const char* where);
-
-Parma_Polyhedra_Library::Coefficient
-integer_term_to_Coefficient(Prolog_term_ref t);
-
-Prolog_term_ref
-Coefficient_to_integer_term(const Parma_Polyhedra_Library::Coefficient& n);
-
-bool
-unify_long(Prolog_term_ref t, long l);
-
-bool
-unify_ulong(Prolog_term_ref t, unsigned long l);
-
-Parma_Polyhedra_Library::Linear_Expression
-build_linear_expression(Prolog_term_ref t, const char* where);
-
-Parma_Polyhedra_Library::Constraint
-build_constraint(Prolog_term_ref t, const char* where);
-
-Parma_Polyhedra_Library::Congruence
-build_congruence(Prolog_term_ref t, const char* where);
-
-Parma_Polyhedra_Library::Generator
-build_generator(Prolog_term_ref t, const char* where);
-
-Parma_Polyhedra_Library::Grid_Generator
-build_grid_generator(Prolog_term_ref t, const char* where);
-
-Prolog_term_ref
-get_linear_expression(const Parma_Polyhedra_Library::Linear_Expression& le);
-
-Prolog_term_ref
-constraint_term(const Parma_Polyhedra_Library::Constraint& c);
-
-Prolog_term_ref
-congruence_term(const Parma_Polyhedra_Library::Congruence& cg);
-
-Prolog_term_ref
-generator_term(const Parma_Polyhedra_Library::Generator& g);
-
-Prolog_term_ref
-grid_generator_term(const Parma_Polyhedra_Library::Grid_Generator& g);
-
-Parma_Polyhedra_Library::Variable
-term_to_Variable(Prolog_term_ref t, const char* where);
-
-Parma_Polyhedra_Library::Coefficient
-term_to_Coefficient(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_optimization_mode(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_control_parameter_name(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_control_parameter_value(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_pip_problem_control_parameter_name(Prolog_term_ref t, const char* where);
-
-Prolog_atom
-term_to_pip_problem_control_parameter_value(Prolog_term_ref t, const char* where);
-
-void
-check_nil_terminating(Prolog_term_ref t, const char* where);
-
-} // namespace Prolog
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-extern "C" Prolog_foreign_return_type
-ppl_version_major(Prolog_term_ref t_v);
-
-extern "C" Prolog_foreign_return_type
-ppl_version_minor(Prolog_term_ref t_v);
-
-extern "C" Prolog_foreign_return_type
-ppl_version_revision(Prolog_term_ref t_v);
-
-extern "C" Prolog_foreign_return_type
-ppl_version_beta(Prolog_term_ref t_v);
-
-extern "C" Prolog_foreign_return_type
-ppl_version(Prolog_term_ref t_v);
-
-extern "C" Prolog_foreign_return_type
-ppl_banner(Prolog_term_ref t_b);
-
-extern "C" Prolog_foreign_return_type
-ppl_max_space_dimension(Prolog_term_ref t_msd);
-
-extern "C" Prolog_foreign_return_type
-ppl_initialize();
-
-extern "C" Prolog_foreign_return_type
-ppl_finalize();
-
-extern "C" Prolog_foreign_return_type
-ppl_set_rounding_for_PPL();
-
-extern "C" Prolog_foreign_return_type
-ppl_restore_pre_PPL_rounding();
-
-extern "C" Prolog_foreign_return_type
-ppl_irrational_precision(Prolog_term_ref t_p);
-
-extern "C" Prolog_foreign_return_type
-ppl_set_irrational_precision(Prolog_term_ref t_p);
-
-extern "C" Prolog_foreign_return_type
-ppl_set_timeout_exception_atom(Prolog_term_ref t_tea);
-
-extern "C" Prolog_foreign_return_type
-ppl_timeout_exception_atom(Prolog_term_ref t);
-
-extern "C" Prolog_foreign_return_type
-ppl_set_timeout(Prolog_term_ref t_csecs);
-
-extern "C" Prolog_foreign_return_type
-ppl_reset_timeout();
-
-extern "C" Prolog_foreign_return_type
-ppl_set_deterministic_timeout(Prolog_term_ref t_unscaled_weight,
-                              Prolog_term_ref t_scale);
-
-extern "C" Prolog_foreign_return_type
-ppl_reset_deterministic_timeout();
-
-extern "C" Prolog_foreign_return_type
-ppl_Coefficient_bits(Prolog_term_ref t_bits);
-
-extern "C" Prolog_foreign_return_type
-ppl_Coefficient_is_bounded();
-
-extern "C" Prolog_foreign_return_type
-ppl_Coefficient_min(Prolog_term_ref t_min);
-
-extern "C" Prolog_foreign_return_type
-ppl_Coefficient_max(Prolog_term_ref t_max);
-
-extern "C" Prolog_foreign_return_type
-ppl_new_MIP_Problem_from_space_dimension
-(Prolog_term_ref t_nd, Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_new_MIP_Problem(Prolog_term_ref t_nd,
-		    Prolog_term_ref t_clist,
-		    Prolog_term_ref t_le_expr,
-		    Prolog_term_ref t_opt,
-		    Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_new_MIP_Problem_from_MIP_Problem(Prolog_term_ref t_mip_source,
-				     Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_swap(Prolog_term_ref t_lhs, Prolog_term_ref t_rhs);
-
-extern "C" Prolog_foreign_return_type
-ppl_delete_MIP_Problem(Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_space_dimension(Prolog_term_ref t_mip, Prolog_term_ref t_sd);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_integer_space_dimensions(Prolog_term_ref t_mip,
-					 Prolog_term_ref t_vlist);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_constraints(Prolog_term_ref t_mip,
-			    Prolog_term_ref t_clist);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_objective_function(Prolog_term_ref t_mip,
-				   Prolog_term_ref t_le_expr);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_optimization_mode(Prolog_term_ref t_mip,
-				  Prolog_term_ref t_opt);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_get_control_parameter(Prolog_term_ref t_mip,
-                                      Prolog_term_ref t_cp_name,
-                                      Prolog_term_ref t_cp_value);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_clear(Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_add_space_dimensions_and_embed
-(Prolog_term_ref t_mip, Prolog_term_ref t_nnd);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_add_to_integer_space_dimensions(Prolog_term_ref t_mip,
-						Prolog_term_ref t_vlist);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_add_constraint(Prolog_term_ref t_mip, Prolog_term_ref t_c);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_add_constraints(Prolog_term_ref t_mip,
-				Prolog_term_ref t_clist);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_set_objective_function(Prolog_term_ref t_mip,
-				       Prolog_term_ref t_le_expr);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_set_optimization_mode(Prolog_term_ref t_mip,
-				      Prolog_term_ref t_opt);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_set_control_parameter(Prolog_term_ref t_mip,
-                                      Prolog_term_ref t_cp_value);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_is_satisfiable(Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_solve(Prolog_term_ref t_mip, Prolog_term_ref t_status);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_feasible_point(Prolog_term_ref t_mip,
-			       Prolog_term_ref t_g);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_optimizing_point(Prolog_term_ref t_mip,
-				 Prolog_term_ref t_g);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_optimal_value(Prolog_term_ref t_mip,
-			      Prolog_term_ref t_n,
-			      Prolog_term_ref t_d);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_evaluate_objective_function(Prolog_term_ref t_mip,
-					    Prolog_term_ref t_g,
-					    Prolog_term_ref t_n,
-					    Prolog_term_ref t_d);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_OK(Prolog_term_ref t_mip);
-
-extern "C" Prolog_foreign_return_type
-ppl_MIP_Problem_ascii_dump(Prolog_term_ref t_mip);
-
-
-extern "C" Prolog_foreign_return_type
-ppl_new_PIP_Problem_from_space_dimension(Prolog_term_ref t_nd,
-                                         Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_new_PIP_Problem_from_PIP_Problem(Prolog_term_ref t_pip_source,
-				     Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_new_PIP_Problem(Prolog_term_ref t_dim,
-		    Prolog_term_ref t_cs,
-		    Prolog_term_ref t_params,
-		    Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_swap(Prolog_term_ref t_lhs, Prolog_term_ref t_rhs);
-
-extern "C" Prolog_foreign_return_type
-ppl_delete_PIP_Problem(Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_space_dimension(Prolog_term_ref t_pip, Prolog_term_ref t_sd);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_parameter_space_dimensions(Prolog_term_ref t_pip,
-                                           Prolog_term_ref t_vlist);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_constraints(Prolog_term_ref t_pip, Prolog_term_ref t_cs);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_get_control_parameter(Prolog_term_ref t_pip,
-                                      Prolog_term_ref t_cp_name,
-                                      Prolog_term_ref t_cp_value);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_clear(Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_add_space_dimensions_and_embed
-(Prolog_term_ref t_pip,
- Prolog_term_ref t_num_vars,
- Prolog_term_ref t_num_params);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_add_to_parameter_space_dimensions(Prolog_term_ref t_pip,
-                                                  Prolog_term_ref t_vlist);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_add_constraint(Prolog_term_ref t_pip, Prolog_term_ref t_c);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_add_constraints(Prolog_term_ref t_pip,
-				Prolog_term_ref t_clist);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_set_control_parameter(Prolog_term_ref t_pip,
-                                      Prolog_term_ref t_cp_value);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_is_satisfiable(Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_solve(Prolog_term_ref t_pip, Prolog_term_ref t_status);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_solution(Prolog_term_ref t_pip,
-                         Prolog_term_ref t_pip_tree);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_optimizing_solution(Prolog_term_ref t_pip,
-                                    Prolog_term_ref t_pip_tree);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_has_big_parameter_dimension(Prolog_term_ref t_pip,
-                                            Prolog_term_ref t_d);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_set_big_parameter_dimension(Prolog_term_ref t_pip,
-                                            Prolog_term_ref t_d);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_OK(Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Problem_ascii_dump(Prolog_term_ref t_pip);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_constraints(Prolog_term_ref t_tree_node,
-                              Prolog_term_ref t_clist);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_is_solution(Prolog_term_ref t_tree_node);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_is_decision(Prolog_term_ref t_tree_node);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_is_bottom(Prolog_term_ref t_tree_node);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_artificials(Prolog_term_ref t_tree_node,
-                              Prolog_term_ref t_artlist);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_OK(Prolog_term_ref t_pip_tree);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_parametric_values(Prolog_term_ref t_pip_sol,
-                                    Prolog_term_ref t_var,
-                                    Prolog_term_ref t_pvalue_list);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_true_child(Prolog_term_ref t_pip_dec,
-                             Prolog_term_ref t_pip_tree);
-
-extern "C" Prolog_foreign_return_type
-ppl_PIP_Tree_Node_false_child(Prolog_term_ref t_pip_dec,
-                              Prolog_term_ref t_pip_tree);
-
-using namespace Parma_Polyhedra_Library;
-using namespace Parma_Polyhedra_Library::Interfaces::Prolog;
-
-#include "ppl_prolog_common.inlines.hh"
-
-#endif // !defined(PPL_ppl_prolog_common_defs_hh)
diff --git a/interfaces/Prolog/ppl_prolog_common.inlines.hh b/interfaces/Prolog/ppl_prolog_common.inlines.hh
deleted file mode 100644
index f0aeeb0..0000000
--- a/interfaces/Prolog/ppl_prolog_common.inlines.hh
+++ /dev/null
@@ -1,88 +0,0 @@
-/* Common part of the Prolog interfaces: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_ppl_prolog_common_inlines_hh
-#define PPL_ppl_prolog_common_inlines_hh 1
-
-#if PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
-
-#include <typeinfo>
-#include <iomanip>
-
-template <typename T>
-void
-Allocation_Tracker::insert(const T* p) {
-#if NOISY_PROLOG_TRACK_ALLOCATION
-  std::cerr << "inserting " << typeid(*p).name()
-            << " at " << std::hex << (void*) p << std::endl;
-#endif
-  std::pair<Set::iterator, bool> stat = s.insert(p);
-  if (!stat.second) {
-    std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
-                 " two objects at the same address at the same time?!"
-              << std::endl;
-    abort();
-  }
-}
-
-template <typename T>
-void
-Allocation_Tracker::weak_insert(const T* p) {
-#if NOISY_PROLOG_TRACK_ALLOCATION
-  std::cerr << "inserting weak " << typeid(*p).name()
-            << " at " << std::hex << (void*) p << std::endl;
-#endif
-  weak_s.insert(p);
-}
-
-template <typename T>
-void
-Allocation_Tracker::remove(const T* p) {
-#if NOISY_PROLOG_TRACK_ALLOCATION
-  std::cerr << "removing " << typeid(*p).name()
-            << " at " << std::hex << (void*) p << std::endl;
-#endif
-  if (s.erase(p) != 1) {
-    std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
-                 " attempt to deallocate a nonexistent polyhedron."
-              << std::endl;
-    abort();
-  }
-}
-
-template <typename T>
-void
-Allocation_Tracker::check(const T* p) const {
-  if (s.find(p) == s.end()
-      && weak_s.find(p) == weak_s.end()) {
-    std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
-                  " attempt to access a nonexistent "
-              << typeid(*p).name()
-              << " at " << std::hex << (void*) p << std::endl;
-    abort();
-  }
-}
-
-#endif // PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
-
-#endif // !defined(PPL_ppl_prolog_common_inlines_hh)
diff --git a/interfaces/Prolog/ppl_prolog_common_defs.hh b/interfaces/Prolog/ppl_prolog_common_defs.hh
new file mode 100644
index 0000000..3f85ef2
--- /dev/null
+++ b/interfaces/Prolog/ppl_prolog_common_defs.hh
@@ -0,0 +1,1084 @@
+/* Common part of the Prolog interfaces: declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_prolog_common_defs_hh
+#define PPL_ppl_prolog_common_defs_hh 1
+
+#define PPL_NO_AUTOMATIC_INITIALIZATION
+#include "ppl.hh"
+#include "ppl_prolog_sysdep.hh"
+#include "interfaced_boxes.hh"
+#include <set>
+#include <vector>
+#include <exception>
+#include <stdexcept>
+#include <iostream>
+
+#ifndef PROLOG_TRACK_ALLOCATION
+#define PROLOG_TRACK_ALLOCATION 0
+#endif
+#ifndef NOISY_PROLOG_TRACK_ALLOCATION
+#define NOISY_PROLOG_TRACK_ALLOCATION 0
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interfaces {
+
+namespace Prolog {
+
+#if PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
+
+class Allocation_Tracker {
+public:
+  //! Construct an allocation tracker with no registered objects.
+  Allocation_Tracker();
+
+  /*! \brief
+    Register an object whose deletion is under the Prolog programmer
+    responsibility.
+  */
+  template <typename T>
+  void insert(const T* p);
+
+  /*! \brief
+    Register an object whose deletion is under the PPL library
+    responsibility.
+  */
+  template <typename T>
+  void weak_insert(const T* p);
+
+  //! Check whether the object was correctly registered.
+  template <typename T>
+  void check(const T* p) const;
+
+  /*! \brief
+    Unregister an object whose deletion is under the Prolog programmer
+    responsibility.
+  */
+  template <typename T>
+  void remove(const T* p);
+
+  /*! \brief
+    Destroy the allocation tracker: an error message will be output
+    if there still are registered objects whose deletion was under
+    the Prolog programmer responsibility.
+  */
+  ~Allocation_Tracker();
+
+private:
+  //! The type for recording a set of pointers to PPL library objects.
+  typedef std::set<const void*, std::less<const void*> > Set;
+
+  /*! \brief
+    A set of pointers to objects whose deallocation is under the
+    rensponsibility of the Prolog programmer: they should be deallocated
+    before the termination of the program.
+  */
+  Set s;
+
+  /*! \brief
+    A set of pointers to objects whose deallocation is under the
+    rensponsibility of the PPL library: they should not be deallocated
+    by the Prolog programmer.
+  */
+  Set weak_s;
+};
+
+extern Allocation_Tracker allocation_tracker;
+
+#define PPL_REGISTER(x)                       \
+  Parma_Polyhedra_Library::Interfaces::Prolog \
+  ::allocation_tracker.insert(x)
+#define PPL_WEAK_REGISTER(x)                    \
+  Parma_Polyhedra_Library::Interfaces::Prolog   \
+  ::allocation_tracker.weak_insert(x)
+#define PPL_UNREGISTER(x)                       \
+  Parma_Polyhedra_Library::Interfaces::Prolog   \
+  ::allocation_tracker.remove(x)
+#define PPL_CHECK(x)                            \
+  Parma_Polyhedra_Library::Interfaces::Prolog   \
+  ::allocation_tracker.check(x)
+
+#else // !PROLOG_TRACK_ALLOCATION && !NOISY_PROLOG_TRACK_ALLOCATION
+
+#define PPL_REGISTER(x)
+#define PPL_WEAK_REGISTER(x)
+#define PPL_UNREGISTER(x)
+#define PPL_CHECK(x)
+
+#endif // !PROLOG_TRACK_ALLOCATION && !NOISY_PROLOG_TRACK_ALLOCATION
+
+class internal_exception {
+private:
+  Prolog_term_ref t;
+  const char* w;
+
+public:
+  internal_exception(Prolog_term_ref term, const char* where)
+    : t(term),
+      w(where) {
+  }
+
+  virtual ~internal_exception() {
+  }
+
+  virtual Prolog_term_ref term() const {
+    return t;
+  }
+
+  virtual const char* where() const {
+    return w;
+  }
+};
+
+class Prolog_unsigned_out_of_range : public internal_exception {
+private:
+  unsigned long m;
+
+public:
+  Prolog_unsigned_out_of_range(Prolog_term_ref term,
+                               const char* where,
+                               unsigned long max)
+    : internal_exception(term, where),
+      m(max) {
+  }
+
+  unsigned long max() const {
+    return m;
+  }
+};
+
+class non_linear : public internal_exception {
+public:
+  non_linear(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_an_integer : public internal_exception {
+public:
+  not_an_integer(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_unsigned_integer : public internal_exception {
+public:
+  not_unsigned_integer(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_boolean : public internal_exception {
+public:
+  not_a_boolean(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_variable : public internal_exception {
+public:
+  not_a_variable(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_an_optimization_mode : public internal_exception {
+public:
+  not_an_optimization_mode(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_bounded_integer_type_width : public internal_exception {
+public:
+  not_a_bounded_integer_type_width(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_bounded_integer_type_representation : public internal_exception {
+public:
+  not_a_bounded_integer_type_representation(Prolog_term_ref term,
+                                            const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_bounded_integer_type_overflow : public internal_exception {
+public:
+  not_a_bounded_integer_type_overflow(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_complexity_class : public internal_exception {
+public:
+  not_a_complexity_class(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_control_parameter_name : public internal_exception {
+public:
+  not_a_control_parameter_name(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_control_parameter_value : public internal_exception {
+public:
+  not_a_control_parameter_value(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_pip_problem_control_parameter_name : public internal_exception {
+public:
+  not_a_pip_problem_control_parameter_name(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_pip_problem_control_parameter_value : public internal_exception {
+public:
+  not_a_pip_problem_control_parameter_value(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_universe_or_empty : public internal_exception {
+public:
+  not_universe_or_empty(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_relation : public internal_exception {
+public:
+  not_a_relation(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class not_a_nil_terminated_list : public internal_exception {
+public:
+  not_a_nil_terminated_list(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class PPL_integer_out_of_range {
+private:
+  Parma_Polyhedra_Library::Coefficient n;
+
+public:
+  PPL_integer_out_of_range(const Parma_Polyhedra_Library::Coefficient& value)
+    : n(value) {
+  }
+
+  const Parma_Polyhedra_Library::Coefficient value() const {
+    return n;
+  }
+};
+
+class ppl_handle_mismatch : public internal_exception {
+public:
+  ppl_handle_mismatch(Prolog_term_ref term, const char* where)
+    : internal_exception(term, where) {
+  }
+};
+
+class unknown_interface_error {
+private:
+  const char* w;
+
+public:
+  unknown_interface_error(const char* s)
+    : w(s) {
+  }
+
+  const char* where() const {
+    return w;
+  }
+};
+
+// For Prolog lists.
+extern Prolog_atom a_nil;
+
+// For variables.
+extern Prolog_atom a_dollar_VAR;
+
+// For linear expressions.
+extern Prolog_atom a_plus;
+extern Prolog_atom a_minus;
+extern Prolog_atom a_asterisk;
+
+// To represent rational numbers as fractions.
+extern Prolog_atom a_slash;
+
+// For constraints.
+extern Prolog_atom a_less_than;
+extern Prolog_atom a_equal_less_than;
+extern Prolog_atom a_equal;
+extern Prolog_atom a_greater_than_equal;
+extern Prolog_atom a_greater_than;
+
+// For congruences.
+extern Prolog_atom a_is_congruent_to;
+extern Prolog_atom a_modulo;
+
+// For generators.
+extern Prolog_atom a_line;
+extern Prolog_atom a_ray;
+extern Prolog_atom a_point;
+extern Prolog_atom a_closure_point;
+
+// For grid_generators.
+extern Prolog_atom a_grid_line;
+extern Prolog_atom a_parameter;
+extern Prolog_atom a_grid_point;
+
+// For the relation between a polyhedron and a constraint.
+extern Prolog_atom a_is_disjoint;
+extern Prolog_atom a_strictly_intersects;
+extern Prolog_atom a_is_included;
+extern Prolog_atom a_saturates;
+
+// For the relation between a polyhedron and a generator.
+extern Prolog_atom a_subsumes;
+
+// Denotes a closed interval boundary.
+extern Prolog_atom a_c;
+
+// Denotes the empty set such as the empty interval or polyhedron.
+extern Prolog_atom a_empty;
+
+// Denotes an open interval boundary.
+extern Prolog_atom a_o;
+
+// Denotes the constructor that turns two boundaries into a proper interval.
+extern Prolog_atom a_i;
+
+// Denote the -infinity and +infinity interval boundaries.
+extern Prolog_atom a_minf;
+extern Prolog_atom a_pinf;
+
+// Denote complexity classes.
+extern Prolog_atom a_polynomial;
+extern Prolog_atom a_simplex;
+extern Prolog_atom a_any;
+
+// Denote possible widths of bounded integer types.
+extern Prolog_atom a_bits_8;
+extern Prolog_atom a_bits_16;
+extern Prolog_atom a_bits_32;
+extern Prolog_atom a_bits_64;
+extern Prolog_atom a_bits_128;
+
+// Denote possible representations of bounded integer types.
+extern Prolog_atom a_unsigned;
+extern Prolog_atom a_signed_2_complement;
+
+// Denote possible overflow behavior of bounded integer types.
+extern Prolog_atom a_overflow_wraps;
+extern Prolog_atom a_overflow_undefined;
+extern Prolog_atom a_overflow_impossible;
+
+// Boolean constants.
+extern Prolog_atom a_true;
+extern Prolog_atom a_false;
+
+
+struct Prolog_Interface_Atom {
+  Prolog_atom* p_atom;
+  const char* name;
+};
+
+extern const Prolog_Interface_Atom prolog_interface_atoms[];
+
+void
+handle_exception(const Prolog_unsigned_out_of_range& e);
+
+void
+handle_exception(const not_unsigned_integer& e);
+
+void
+handle_exception(const not_a_boolean& e);
+
+void
+handle_exception(const non_linear& e);
+
+void
+handle_exception(const not_a_variable& e);
+
+void
+handle_exception(const not_an_integer& e);
+
+void
+handle_exception(const ppl_handle_mismatch& e);
+
+void
+handle_exception(const not_an_optimization_mode& e);
+
+void
+handle_exception(const not_a_complexity_class& e);
+
+void
+handle_exception(const not_a_bounded_integer_type_width& e);
+
+void
+handle_exception(const not_a_bounded_integer_type_representation& e);
+
+void
+handle_exception(const not_a_bounded_integer_type_overflow& e);
+
+void
+handle_exception(const not_a_control_parameter_name& e);
+
+void
+handle_exception(const not_a_control_parameter_value& e);
+
+void
+handle_exception(const not_a_pip_problem_control_parameter_name& e);
+
+void
+handle_exception(const not_a_pip_problem_control_parameter_value& e);
+
+void
+handle_exception(const not_universe_or_empty& e);
+
+void
+handle_exception(const not_a_relation& e);
+
+void
+handle_exception(const not_a_nil_terminated_list& e);
+
+void
+handle_exception(const PPL_integer_out_of_range& e);
+
+void
+handle_exception(const unknown_interface_error& e);
+
+void
+handle_exception(const std::overflow_error& e);
+
+void
+handle_exception(const std::domain_error& e);
+
+void
+handle_exception(const std::length_error& e);
+
+void
+handle_exception(const std::invalid_argument& e);
+
+void
+handle_exception(const std::logic_error& e);
+
+void
+handle_exception(const std::bad_alloc&);
+
+void
+handle_exception(const std::exception& e);
+
+void
+handle_exception();
+
+class timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+void
+handle_exception(const timeout_exception&);
+
+class deterministic_timeout_exception
+  : public Parma_Polyhedra_Library::Throwable {
+public:
+  void throw_me() const {
+    throw *this;
+  }
+  int priority() const {
+    return 0;
+  }
+};
+
+void
+handle_exception(const deterministic_timeout_exception&);
+
+#define CATCH_ALL \
+  catch (const Prolog_unsigned_out_of_range& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_unsigned_integer& e) { \
+    handle_exception(e); \
+  } \
+  catch (const non_linear& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_variable& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_an_integer& e) { \
+    handle_exception(e); \
+  } \
+  catch (const ppl_handle_mismatch& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_an_optimization_mode& e) {   \
+    handle_exception(e); \
+  } \
+  catch (const not_a_complexity_class& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_bounded_integer_type_width& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_bounded_integer_type_representation& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_bounded_integer_type_overflow& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_control_parameter_name& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_control_parameter_value& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_pip_problem_control_parameter_name& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_pip_problem_control_parameter_value& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_universe_or_empty& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_relation& e) { \
+    handle_exception(e); \
+  } \
+  catch (const not_a_nil_terminated_list& e) { \
+    handle_exception(e); \
+  } \
+  catch (const PPL_integer_out_of_range& e) { \
+    handle_exception(e); \
+  } \
+  catch (const unknown_interface_error& e) { \
+    handle_exception(e); \
+  } \
+  catch (const timeout_exception& e) { \
+    handle_exception(e); \
+  } \
+  catch (const deterministic_timeout_exception& e) { \
+    handle_exception(e); \
+  } \
+  catch(const std::overflow_error& e) { \
+    handle_exception(e); \
+  } \
+  catch(const std::domain_error& e) { \
+    handle_exception(e); \
+  } \
+  catch(const std::length_error& e) { \
+    handle_exception(e); \
+  } \
+  catch(const std::invalid_argument& e) { \
+    handle_exception(e); \
+  } \
+  catch (const std::logic_error& e) { \
+    handle_exception(e); \
+  } \
+  catch (const std::bad_alloc& e) { \
+    handle_exception(e); \
+  } \
+  catch (const std::exception& e) { \
+    handle_exception(e); \
+  } \
+  catch (...) { \
+    handle_exception(); \
+  } \
+  return PROLOG_FAILURE
+
+
+Prolog_term_ref
+variable_term(dimension_type varid);
+
+template <typename U>
+U
+term_to_unsigned(Prolog_term_ref t, const char* where) {
+  using namespace Parma_Polyhedra_Library;
+  using namespace Parma_Polyhedra_Library::Interfaces::Prolog;
+  if (!Prolog_is_integer(t))
+    throw not_unsigned_integer(t, where);
+
+  U d = 0;
+  long l;
+  if (Prolog_get_long(t, &l))
+    if (l < 0)
+      throw not_unsigned_integer(t, where);
+    else if (static_cast<unsigned long>(l) > std::numeric_limits<U>::max())
+      throw Prolog_unsigned_out_of_range(t, where,
+                                         std::numeric_limits<U>::max());
+    else
+      d = l;
+  else {
+    PPL_DIRTY_TEMP_COEFFICIENT(v);
+    Prolog_get_Coefficient(t, v);
+    if (v < 0)
+      throw not_unsigned_integer(t, where);
+    Result r = assign_r(d, raw_value(v), ROUND_IGNORE);
+    if (result_overflow(r))
+      throw Prolog_unsigned_out_of_range(t, where,
+                                         std::numeric_limits<U>::max());
+  }
+  return d;
+}
+
+Prolog_atom
+term_to_boolean(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_universe_or_empty(Prolog_term_ref t, const char* where);
+
+Prolog_term_ref
+interval_term(const Parma_Polyhedra_Library::Rational_Box::interval_type& i);
+
+Prolog_atom
+term_to_complexity_class(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_bounded_integer_type_width(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_bounded_integer_type_representation(Prolog_term_ref t,
+                                            const char* where);
+
+Prolog_atom
+term_to_bounded_integer_type_overflow(Prolog_term_ref t, const char* where);
+
+template <typename T>
+T*
+term_to_handle(Prolog_term_ref t, const char* where) {
+  if (Prolog_is_address(t)) {
+    void* p;
+    if (Prolog_get_address(t, &p))
+      return static_cast<T*>(p);
+  }
+  throw ppl_handle_mismatch(t, where);
+}
+
+enum Boundary_Kind {
+  LOWER_BOUNDARY,
+  UPPER_BOUNDARY
+};
+
+bool
+term_to_boundary(Prolog_term_ref t_b, Boundary_Kind kind,
+                 bool& finite, bool& closed,
+                 Parma_Polyhedra_Library::Coefficient& n, Parma_Polyhedra_Library::Coefficient& d);
+
+Parma_Polyhedra_Library::Relation_Symbol
+term_to_relation_symbol(Prolog_term_ref t_r, const char* where);
+
+Parma_Polyhedra_Library::Coefficient
+integer_term_to_Coefficient(Prolog_term_ref t);
+
+Prolog_term_ref
+Coefficient_to_integer_term(const Parma_Polyhedra_Library::Coefficient& n);
+
+bool
+unify_long(Prolog_term_ref t, long l);
+
+bool
+unify_ulong(Prolog_term_ref t, unsigned long l);
+
+Parma_Polyhedra_Library::Linear_Expression
+build_linear_expression(Prolog_term_ref t, const char* where);
+
+Parma_Polyhedra_Library::Constraint
+build_constraint(Prolog_term_ref t, const char* where);
+
+Parma_Polyhedra_Library::Congruence
+build_congruence(Prolog_term_ref t, const char* where);
+
+Parma_Polyhedra_Library::Generator
+build_generator(Prolog_term_ref t, const char* where);
+
+Parma_Polyhedra_Library::Grid_Generator
+build_grid_generator(Prolog_term_ref t, const char* where);
+
+Prolog_term_ref
+get_linear_expression(const Parma_Polyhedra_Library::Linear_Expression& le);
+
+Prolog_term_ref
+constraint_term(const Parma_Polyhedra_Library::Constraint& c);
+
+Prolog_term_ref
+congruence_term(const Parma_Polyhedra_Library::Congruence& cg);
+
+Prolog_term_ref
+generator_term(const Parma_Polyhedra_Library::Generator& g);
+
+Prolog_term_ref
+grid_generator_term(const Parma_Polyhedra_Library::Grid_Generator& g);
+
+Parma_Polyhedra_Library::Variable
+term_to_Variable(Prolog_term_ref t, const char* where);
+
+Parma_Polyhedra_Library::Coefficient
+term_to_Coefficient(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_optimization_mode(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_control_parameter_name(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_control_parameter_value(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_pip_problem_control_parameter_name(Prolog_term_ref t, const char* where);
+
+Prolog_atom
+term_to_pip_problem_control_parameter_value(Prolog_term_ref t, const char* where);
+
+void
+check_nil_terminating(Prolog_term_ref t, const char* where);
+
+} // namespace Prolog
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+extern "C" Prolog_foreign_return_type
+ppl_version_major(Prolog_term_ref t_v);
+
+extern "C" Prolog_foreign_return_type
+ppl_version_minor(Prolog_term_ref t_v);
+
+extern "C" Prolog_foreign_return_type
+ppl_version_revision(Prolog_term_ref t_v);
+
+extern "C" Prolog_foreign_return_type
+ppl_version_beta(Prolog_term_ref t_v);
+
+extern "C" Prolog_foreign_return_type
+ppl_version(Prolog_term_ref t_v);
+
+extern "C" Prolog_foreign_return_type
+ppl_banner(Prolog_term_ref t_b);
+
+extern "C" Prolog_foreign_return_type
+ppl_max_space_dimension(Prolog_term_ref t_msd);
+
+extern "C" Prolog_foreign_return_type
+ppl_initialize();
+
+extern "C" Prolog_foreign_return_type
+ppl_finalize();
+
+extern "C" Prolog_foreign_return_type
+ppl_set_rounding_for_PPL();
+
+extern "C" Prolog_foreign_return_type
+ppl_restore_pre_PPL_rounding();
+
+extern "C" Prolog_foreign_return_type
+ppl_irrational_precision(Prolog_term_ref t_p);
+
+extern "C" Prolog_foreign_return_type
+ppl_set_irrational_precision(Prolog_term_ref t_p);
+
+extern "C" Prolog_foreign_return_type
+ppl_set_timeout_exception_atom(Prolog_term_ref t_tea);
+
+extern "C" Prolog_foreign_return_type
+ppl_timeout_exception_atom(Prolog_term_ref t);
+
+extern "C" Prolog_foreign_return_type
+ppl_set_timeout(Prolog_term_ref t_csecs);
+
+extern "C" Prolog_foreign_return_type
+ppl_reset_timeout();
+
+extern "C" Prolog_foreign_return_type
+ppl_set_deterministic_timeout(Prolog_term_ref t_unscaled_weight,
+                              Prolog_term_ref t_scale);
+
+extern "C" Prolog_foreign_return_type
+ppl_reset_deterministic_timeout();
+
+extern "C" Prolog_foreign_return_type
+ppl_Coefficient_bits(Prolog_term_ref t_bits);
+
+extern "C" Prolog_foreign_return_type
+ppl_Coefficient_is_bounded();
+
+extern "C" Prolog_foreign_return_type
+ppl_Coefficient_min(Prolog_term_ref t_min);
+
+extern "C" Prolog_foreign_return_type
+ppl_Coefficient_max(Prolog_term_ref t_max);
+
+extern "C" Prolog_foreign_return_type
+ppl_new_MIP_Problem_from_space_dimension
+(Prolog_term_ref t_nd, Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_new_MIP_Problem(Prolog_term_ref t_nd,
+                    Prolog_term_ref t_clist,
+                    Prolog_term_ref t_le_expr,
+                    Prolog_term_ref t_opt,
+                    Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_new_MIP_Problem_from_MIP_Problem(Prolog_term_ref t_mip_source,
+                                     Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_swap(Prolog_term_ref t_lhs, Prolog_term_ref t_rhs);
+
+extern "C" Prolog_foreign_return_type
+ppl_delete_MIP_Problem(Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_space_dimension(Prolog_term_ref t_mip, Prolog_term_ref t_sd);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_integer_space_dimensions(Prolog_term_ref t_mip,
+                                         Prolog_term_ref t_vlist);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_constraints(Prolog_term_ref t_mip,
+                            Prolog_term_ref t_clist);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_objective_function(Prolog_term_ref t_mip,
+                                   Prolog_term_ref t_le_expr);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_optimization_mode(Prolog_term_ref t_mip,
+                                  Prolog_term_ref t_opt);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_get_control_parameter(Prolog_term_ref t_mip,
+                                      Prolog_term_ref t_cp_name,
+                                      Prolog_term_ref t_cp_value);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_clear(Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_add_space_dimensions_and_embed
+(Prolog_term_ref t_mip, Prolog_term_ref t_nnd);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_add_to_integer_space_dimensions(Prolog_term_ref t_mip,
+                                                Prolog_term_ref t_vlist);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_add_constraint(Prolog_term_ref t_mip, Prolog_term_ref t_c);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_add_constraints(Prolog_term_ref t_mip,
+                                Prolog_term_ref t_clist);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_set_objective_function(Prolog_term_ref t_mip,
+                                       Prolog_term_ref t_le_expr);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_set_optimization_mode(Prolog_term_ref t_mip,
+                                      Prolog_term_ref t_opt);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_set_control_parameter(Prolog_term_ref t_mip,
+                                      Prolog_term_ref t_cp_value);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_is_satisfiable(Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_solve(Prolog_term_ref t_mip, Prolog_term_ref t_status);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_feasible_point(Prolog_term_ref t_mip,
+                               Prolog_term_ref t_g);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_optimizing_point(Prolog_term_ref t_mip,
+                                 Prolog_term_ref t_g);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_optimal_value(Prolog_term_ref t_mip,
+                              Prolog_term_ref t_n,
+                              Prolog_term_ref t_d);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_evaluate_objective_function(Prolog_term_ref t_mip,
+                                            Prolog_term_ref t_g,
+                                            Prolog_term_ref t_n,
+                                            Prolog_term_ref t_d);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_OK(Prolog_term_ref t_mip);
+
+extern "C" Prolog_foreign_return_type
+ppl_MIP_Problem_ascii_dump(Prolog_term_ref t_mip);
+
+
+extern "C" Prolog_foreign_return_type
+ppl_new_PIP_Problem_from_space_dimension(Prolog_term_ref t_nd,
+                                         Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_new_PIP_Problem_from_PIP_Problem(Prolog_term_ref t_pip_source,
+                                     Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_new_PIP_Problem(Prolog_term_ref t_dim,
+                    Prolog_term_ref t_cs,
+                    Prolog_term_ref t_params,
+                    Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_swap(Prolog_term_ref t_lhs, Prolog_term_ref t_rhs);
+
+extern "C" Prolog_foreign_return_type
+ppl_delete_PIP_Problem(Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_space_dimension(Prolog_term_ref t_pip, Prolog_term_ref t_sd);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_parameter_space_dimensions(Prolog_term_ref t_pip,
+                                           Prolog_term_ref t_vlist);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_constraints(Prolog_term_ref t_pip, Prolog_term_ref t_cs);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_get_control_parameter(Prolog_term_ref t_pip,
+                                      Prolog_term_ref t_cp_name,
+                                      Prolog_term_ref t_cp_value);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_clear(Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_add_space_dimensions_and_embed
+(Prolog_term_ref t_pip,
+ Prolog_term_ref t_num_vars,
+ Prolog_term_ref t_num_params);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_add_to_parameter_space_dimensions(Prolog_term_ref t_pip,
+                                                  Prolog_term_ref t_vlist);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_add_constraint(Prolog_term_ref t_pip, Prolog_term_ref t_c);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_add_constraints(Prolog_term_ref t_pip,
+                                Prolog_term_ref t_clist);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_set_control_parameter(Prolog_term_ref t_pip,
+                                      Prolog_term_ref t_cp_value);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_is_satisfiable(Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_solve(Prolog_term_ref t_pip, Prolog_term_ref t_status);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_solution(Prolog_term_ref t_pip,
+                         Prolog_term_ref t_pip_tree);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_optimizing_solution(Prolog_term_ref t_pip,
+                                    Prolog_term_ref t_pip_tree);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_has_big_parameter_dimension(Prolog_term_ref t_pip,
+                                            Prolog_term_ref t_d);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_set_big_parameter_dimension(Prolog_term_ref t_pip,
+                                            Prolog_term_ref t_d);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_OK(Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Problem_ascii_dump(Prolog_term_ref t_pip);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_constraints(Prolog_term_ref t_tree_node,
+                              Prolog_term_ref t_clist);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_is_solution(Prolog_term_ref t_tree_node);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_is_decision(Prolog_term_ref t_tree_node);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_is_bottom(Prolog_term_ref t_tree_node);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_artificials(Prolog_term_ref t_tree_node,
+                              Prolog_term_ref t_artlist);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_OK(Prolog_term_ref t_pip_tree);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_parametric_values(Prolog_term_ref t_pip_sol,
+                                    Prolog_term_ref t_var,
+                                    Prolog_term_ref t_pvalue_list);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_true_child(Prolog_term_ref t_pip_dec,
+                             Prolog_term_ref t_pip_tree);
+
+extern "C" Prolog_foreign_return_type
+ppl_PIP_Tree_Node_false_child(Prolog_term_ref t_pip_dec,
+                              Prolog_term_ref t_pip_tree);
+
+using namespace Parma_Polyhedra_Library;
+using namespace Parma_Polyhedra_Library::Interfaces::Prolog;
+
+#include "ppl_prolog_common_inlines.hh"
+
+#endif // !defined(PPL_ppl_prolog_common_defs_hh)
diff --git a/interfaces/Prolog/ppl_prolog_common_inlines.hh b/interfaces/Prolog/ppl_prolog_common_inlines.hh
new file mode 100644
index 0000000..e759bb4
--- /dev/null
+++ b/interfaces/Prolog/ppl_prolog_common_inlines.hh
@@ -0,0 +1,88 @@
+/* Common part of the Prolog interfaces: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_ppl_prolog_common_inlines_hh
+#define PPL_ppl_prolog_common_inlines_hh 1
+
+#if PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
+
+#include <typeinfo>
+#include <iomanip>
+
+template <typename T>
+void
+Allocation_Tracker::insert(const T* p) {
+#if NOISY_PROLOG_TRACK_ALLOCATION
+  std::cerr << "inserting " << typeid(*p).name()
+            << " at " << std::hex << (void*) p << std::endl;
+#endif
+  std::pair<Set::iterator, bool> stat = s.insert(p);
+  if (!stat.second) {
+    std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
+                 " two objects at the same address at the same time?!"
+              << std::endl;
+    abort();
+  }
+}
+
+template <typename T>
+void
+Allocation_Tracker::weak_insert(const T* p) {
+#if NOISY_PROLOG_TRACK_ALLOCATION
+  std::cerr << "inserting weak " << typeid(*p).name()
+            << " at " << std::hex << (void*) p << std::endl;
+#endif
+  weak_s.insert(p);
+}
+
+template <typename T>
+void
+Allocation_Tracker::remove(const T* p) {
+#if NOISY_PROLOG_TRACK_ALLOCATION
+  std::cerr << "removing " << typeid(*p).name()
+            << " at " << std::hex << (void*) p << std::endl;
+#endif
+  if (s.erase(p) != 1) {
+    std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
+                 " attempt to deallocate a nonexistent polyhedron."
+              << std::endl;
+    abort();
+  }
+}
+
+template <typename T>
+void
+Allocation_Tracker::check(const T* p) const {
+  if (s.find(p) == s.end()
+      && weak_s.find(p) == weak_s.end()) {
+    std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
+                  " attempt to access a nonexistent "
+              << typeid(*p).name()
+              << " at " << std::hex << (void*) p << std::endl;
+    abort();
+  }
+}
+
+#endif // PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
+
+#endif // !defined(PPL_ppl_prolog_common_inlines_hh)
diff --git a/interfaces/Prolog/tests/Makefile.am b/interfaces/Prolog/tests/Makefile.am
index df2f4eb..dc574e6 100644
--- a/interfaces/Prolog/tests/Makefile.am
+++ b/interfaces/Prolog/tests/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/interfaces/Prolog/tests/Makefile.in b/interfaces/Prolog/tests/Makefile.in
index a89bb99..53ace2d 100644
--- a/interfaces/Prolog/tests/Makefile.in
+++ b/interfaces/Prolog/tests/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -57,7 +73,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = interfaces/Prolog/tests
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -90,14 +107,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -385,6 +413,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
diff --git a/interfaces/Prolog/tests/clpq.pl b/interfaces/Prolog/tests/clpq.pl
index b97f422..776dba3 100644
--- a/interfaces/Prolog/tests/clpq.pl
+++ b/interfaces/Prolog/tests/clpq.pl
@@ -2,7 +2,7 @@
 % for testing the Parma Polyhedra Library and its Prolog interface.
 %
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This file is part of the Parma Polyhedra Library (PPL).
 %
@@ -45,9 +45,9 @@ solve(Goals, Variable_Names) :-
     ppl_new_C_Polyhedron_from_space_dimension(Dims, universe, Polyhedron),
     % Try to reduce `Goals' to the empty continuation.
     (solve(Goals, true, Polyhedron) ->
-	Failed = no
+        Failed = no
     ;
-	Failed = yes
+        Failed = yes
     ),
     % On failure, cleanup must occur anyway.
     % The one who creates the polyhedron must delete it.
@@ -116,9 +116,9 @@ solve(Atom, Goals, Polyhedron) :-
 
     % Try to solve the body augmented with the parameter passing equations.
     (solve(PP_Constraints, (Body, Goals), Poly_Copy) ->
-	Failed = no
+        Failed = no
     ;
-	Failed = yes
+        Failed = yes
     ),
     % Our copy must be thrown anyway.
     ppl_delete_Polyhedron(Poly_Copy),
@@ -129,18 +129,18 @@ parameter_passing(Atom, Head, PP_Constraints) :-
     Atom =.. [_|Actuals],
     Head =.. [_|Formals],
     (Actuals == [] ->
-	PP_Constraints = true
+        PP_Constraints = true
     ;
-	build_pp_constraints(Actuals, Formals, Equations),
-	PP_Constraints = ({ Equations })
+        build_pp_constraints(Actuals, Formals, Equations),
+        PP_Constraints = ({ Equations })
     ).
 
 build_pp_constraints([A|Actuals], [F|Formals], Equations) :-
     (Actuals == [] ->
-	Equations = (A = F)
+        Equations = (A = F)
     ;
-	Equations = ((A = F), More_Equations),
-	build_pp_constraints(Actuals, Formals, More_Equations)
+        Equations = ((A = F), More_Equations),
+        build_pp_constraints(Actuals, Formals, More_Equations)
     ).
 
 select_clause(Atom, Head, Body) :-
@@ -265,8 +265,8 @@ main_loop :-
   % get rid of it.
   eat_eol,
   catch(do_command(Command, VN),
-	Exception,
-	(print_exception_term(Exception), main_loop_no)).
+        Exception,
+        (print_exception_term(Exception), main_loop_no)).
 
 print_exception_term(ppl_overflow_error(Cause)) :-
   nl,
@@ -795,7 +795,7 @@ POSSIBILITY OF SUCH DAMAGES.\n').
 common_main :-
   write('\
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>\n\
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)\n\
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)\n\
 this program is free software, covered by the GNU General Public License,\n\
 and you are welcome to change it and/or distribute copies of it\n\
 under certain conditions.\n\
diff --git a/interfaces/Prolog/tests/clpq2.pl b/interfaces/Prolog/tests/clpq2.pl
index 2a7ae82..be5b062 100644
--- a/interfaces/Prolog/tests/clpq2.pl
+++ b/interfaces/Prolog/tests/clpq2.pl
@@ -2,7 +2,7 @@
 % for testing the Parma Polyhedra Library and its Prolog interface.
 %
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This file is part of the Parma Polyhedra Library (PPL).
 %
@@ -348,8 +348,8 @@ main_loop :-
   read_term(Command, [variable_names(VN)]),
   eat_eol,
   catch(do_command(Command, VN),
-	Exception,
-	(print_exception_term(Exception), main_loop_no)).
+        Exception,
+        (print_exception_term(Exception), main_loop_no)).
 
 print_exception_term(ppl_overflow_error(Cause)) :-
   nl,
@@ -1112,7 +1112,7 @@ POSSIBILITY OF SUCH DAMAGES.\n').
 common_main :-
   write('\
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>\n\
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)\n\
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)\n\
 this program is free software, covered by the GNU General Public License,\n\
 and you are welcome to change it and/or distribute copies of it\n\
 under certain conditions.\n\
diff --git a/interfaces/Prolog/tests/expected_clpq2_int16 b/interfaces/Prolog/tests/expected_clpq2_int16
index 97834f0..e9a54c1 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int16
+++ b/interfaces/Prolog/tests/expected_clpq2_int16
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int16_a b/interfaces/Prolog/tests/expected_clpq2_int16_a
index a29bc3a..f6ffe89 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int16_a
+++ b/interfaces/Prolog/tests/expected_clpq2_int16_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int32 b/interfaces/Prolog/tests/expected_clpq2_int32
index 7505ea6..fe5dbcc 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int32
+++ b/interfaces/Prolog/tests/expected_clpq2_int32
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int32_a b/interfaces/Prolog/tests/expected_clpq2_int32_a
index ca82946..8342abe 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int32_a
+++ b/interfaces/Prolog/tests/expected_clpq2_int32_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int64 b/interfaces/Prolog/tests/expected_clpq2_int64
index 7505ea6..fe5dbcc 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int64
+++ b/interfaces/Prolog/tests/expected_clpq2_int64
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int64_a b/interfaces/Prolog/tests/expected_clpq2_int64_a
index 7505ea6..fe5dbcc 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int64_a
+++ b/interfaces/Prolog/tests/expected_clpq2_int64_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int8 b/interfaces/Prolog/tests/expected_clpq2_int8
index 8696719..58a46aa 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int8
+++ b/interfaces/Prolog/tests/expected_clpq2_int8
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_int8_a b/interfaces/Prolog/tests/expected_clpq2_int8_a
index 8696719..58a46aa 100644
--- a/interfaces/Prolog/tests/expected_clpq2_int8_a
+++ b/interfaces/Prolog/tests/expected_clpq2_int8_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_mpz b/interfaces/Prolog/tests/expected_clpq2_mpz
index 7505ea6..fe5dbcc 100644
--- a/interfaces/Prolog/tests/expected_clpq2_mpz
+++ b/interfaces/Prolog/tests/expected_clpq2_mpz
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq2_mpz_a b/interfaces/Prolog/tests/expected_clpq2_mpz_a
index 7505ea6..fe5dbcc 100644
--- a/interfaces/Prolog/tests/expected_clpq2_mpz_a
+++ b/interfaces/Prolog/tests/expected_clpq2_mpz_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int16 b/interfaces/Prolog/tests/expected_clpq_int16
index 029dfb2..1c4f9a1 100644
--- a/interfaces/Prolog/tests/expected_clpq_int16
+++ b/interfaces/Prolog/tests/expected_clpq_int16
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int16_a b/interfaces/Prolog/tests/expected_clpq_int16_a
index 029dfb2..1c4f9a1 100644
--- a/interfaces/Prolog/tests/expected_clpq_int16_a
+++ b/interfaces/Prolog/tests/expected_clpq_int16_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int32 b/interfaces/Prolog/tests/expected_clpq_int32
index dc31695..4f4a21c 100644
--- a/interfaces/Prolog/tests/expected_clpq_int32
+++ b/interfaces/Prolog/tests/expected_clpq_int32
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int32_a b/interfaces/Prolog/tests/expected_clpq_int32_a
index dc31695..4f4a21c 100644
--- a/interfaces/Prolog/tests/expected_clpq_int32_a
+++ b/interfaces/Prolog/tests/expected_clpq_int32_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int64 b/interfaces/Prolog/tests/expected_clpq_int64
index dc31695..4f4a21c 100644
--- a/interfaces/Prolog/tests/expected_clpq_int64
+++ b/interfaces/Prolog/tests/expected_clpq_int64
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int64_a b/interfaces/Prolog/tests/expected_clpq_int64_a
index dc31695..4f4a21c 100644
--- a/interfaces/Prolog/tests/expected_clpq_int64_a
+++ b/interfaces/Prolog/tests/expected_clpq_int64_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int8 b/interfaces/Prolog/tests/expected_clpq_int8
index 11395d8..d3a38b7 100644
--- a/interfaces/Prolog/tests/expected_clpq_int8
+++ b/interfaces/Prolog/tests/expected_clpq_int8
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_int8_a b/interfaces/Prolog/tests/expected_clpq_int8_a
index 11395d8..d3a38b7 100644
--- a/interfaces/Prolog/tests/expected_clpq_int8_a
+++ b/interfaces/Prolog/tests/expected_clpq_int8_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_mpz b/interfaces/Prolog/tests/expected_clpq_mpz
index dc31695..4f4a21c 100644
--- a/interfaces/Prolog/tests/expected_clpq_mpz
+++ b/interfaces/Prolog/tests/expected_clpq_mpz
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/expected_clpq_mpz_a b/interfaces/Prolog/tests/expected_clpq_mpz_a
index dc31695..4f4a21c 100644
--- a/interfaces/Prolog/tests/expected_clpq_mpz_a
+++ b/interfaces/Prolog/tests/expected_clpq_mpz_a
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 this program is free software, covered by the GNU General Public License,
 and you are welcome to change it and/or distribute copies of it
 under certain conditions.
diff --git a/interfaces/Prolog/tests/pl_check.pl b/interfaces/Prolog/tests/pl_check.pl
index 4235caa..6f1cd84 100644
--- a/interfaces/Prolog/tests/pl_check.pl
+++ b/interfaces/Prolog/tests/pl_check.pl
@@ -1,6 +1,6 @@
 /* Various tests on the Prolog interface.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -101,20 +101,20 @@ run_fail(Group) :-
 % the exception was thrown and then it fails.
 
 run_exception(Group, Exception) :-
-	group_predicates(Group, Predicates),
-	(Exception = ppl_overflow_error(_) ->
-	    Kind = 'Overflow exception'
-	;
-	    Kind = 'Exception'
-	),
+        group_predicates(Group, Predicates),
+        (Exception = ppl_overflow_error(_) ->
+            Kind = 'Overflow exception'
+        ;
+            Kind = 'Exception'
+        ),
         prolog_system(System),
- 	display_message([Kind, 'occurred while performing test ', Group,
+        display_message([Kind, 'occurred while performing test ', Group,
                         'which checks predicates ', nl, Predicates]),
         display_message(['Prolog interface checks failed on', System,
                   'Prolog.']),
-	print_exception_term(Exception),
-	% Do fail for all but overflow exceptions.
-	Exception = ppl_overflow_error(_).
+        print_exception_term(Exception),
+        % Do fail for all but overflow exceptions.
+        Exception = ppl_overflow_error(_).
 
 % run_one/1
 % Runs the named group of tests.
@@ -1835,7 +1835,7 @@ termination_test :-
                                              -A + C >= 0,
                                              -B + D >= 1,
                                              B >= 0],
-					    P2),
+                                            P2),
   ppl_termination_test_NNC_Polyhedron_MS(P2),
   ppl_termination_test_NNC_Polyhedron_PR(P2),
   !,
diff --git a/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl.m4 b/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl.m4
index a4dff11..4dd1b2d 100644
--- a/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl.m4
+++ b/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl.m4
@@ -6,7 +6,7 @@ dnl ppl_prolog_generated_test_<CLASS_NAME>.pl using the code in
 dnl ppl_interface_generator_prolog_generated_test_pl_code.m4.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl_code.m4 b/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl_code.m4
index 1ae5385..60b940c 100644
--- a/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl_code.m4
+++ b/interfaces/Prolog/tests/ppl_interface_generator_prolog_generated_test_pl_code.m4
@@ -6,7 +6,7 @@ dnl the generated Prolog interface predicates
 dnl and the main file ppl_prolog_generated_test_main.pl.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/Prolog/tests/ppl_prolog_generated_test_common.pl b/interfaces/Prolog/tests/ppl_prolog_generated_test_common.pl
index 6a0a5dc..985f2cf 100644
--- a/interfaces/Prolog/tests/ppl_prolog_generated_test_common.pl
+++ b/interfaces/Prolog/tests/ppl_prolog_generated_test_common.pl
@@ -1,6 +1,6 @@
 % Extra test code for the generated tests for the Prolog interfaces.
 % Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-% Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+% Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 %
 % This file is part of the Parma Polyhedra Library (PPL).
 %
diff --git a/interfaces/Prolog/tests/smm.clpq b/interfaces/Prolog/tests/smm.clpq
index bdfd2ff..d6c608b 100644
--- a/interfaces/Prolog/tests/smm.clpq
+++ b/interfaces/Prolog/tests/smm.clpq
@@ -10,22 +10,22 @@
 %     M O N E Y
 
 solve(S, E, N, D, M, O, R, Y) :-
-	constraints(S, E, N, D, M, O, R, Y).
+        constraints(S, E, N, D, M, O, R, Y).
 
 constraints(S, E, N, D, M, O, R, Y) :-
 {
-	S >= 0, E >= 0, N >= 0, D >= 0, M >= 0, O >= 0, R >= 0, Y >= 0,
-	S =< 9, E =< 9, N =< 9, D =< 9, M =< 9, O =< 9, R =< 9, Y =< 9,
-	S >= 1, M >= 1,
-	C1 >= 0, C2 >= 0, C3 >= 0, C4 >= 0,
-	C1 =< 1, C2 =< 1, C3 =< 1, C4 =< 1,
-	M = C1,
-	C2 + S + M = O + C1 * 10,
-	C3 + E + O = N + 10 * C2,
-	C4 + N + R = E + 10 * C3,
-	D + E = Y + 10*C4
+        S >= 0, E >= 0, N >= 0, D >= 0, M >= 0, O >= 0, R >= 0, Y >= 0,
+        S =< 9, E =< 9, N =< 9, D =< 9, M =< 9, O =< 9, R =< 9, Y =< 9,
+        S >= 1, M >= 1,
+        C1 >= 0, C2 >= 0, C3 >= 0, C4 >= 0,
+        C1 =< 1, C2 =< 1, C3 =< 1, C4 =< 1,
+        M = C1,
+        C2 + S + M = O + C1 * 10,
+        C3 + E + O = N + 10 * C2,
+        C4 + N + R = E + 10 * C3,
+        D + E = Y + 10*C4
 },
-	bit(C1), bit(C2), bit(C3), bit(C4).
+        bit(C1), bit(C2), bit(C3), bit(C4).
 
 bit(0).
 bit(1).
diff --git a/interfaces/interfaced_boxes.hh b/interfaces/interfaced_boxes.hh
index 4a85668..7293f5b 100644
--- a/interfaces/interfaced_boxes.hh
+++ b/interfaces/interfaced_boxes.hh
@@ -1,7 +1,7 @@
 /* Declarations for the Box instantiations offered by the non-templatic
    language interfaces.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/marked_pointers.hh b/interfaces/marked_pointers.hh
index 82c97d9..86a365d 100644
--- a/interfaces/marked_pointers.hh
+++ b/interfaces/marked_pointers.hh
@@ -1,7 +1,7 @@
 /* Implementation of marked pointers for use in some PPL non-templatic
    language interfaces.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/interfaces/ppl_interface_generator_common.m4 b/interfaces/ppl_interface_generator_common.m4
index 5442747..8b3cd1a 100644
--- a/interfaces/ppl_interface_generator_common.m4
+++ b/interfaces/ppl_interface_generator_common.m4
@@ -5,7 +5,7 @@ dnl - application independent helper macros used here and by other m4 files.
 dnl - defining the main code generation macro m4_all_code.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/ppl_interface_generator_common_dat.m4 b/interfaces/ppl_interface_generator_common_dat.m4
index 099795a..d887eb8 100644
--- a/interfaces/ppl_interface_generator_common_dat.m4
+++ b/interfaces/ppl_interface_generator_common_dat.m4
@@ -6,7 +6,7 @@ dnl - the control of the procedures to be generated for each class;
 dnl - the replacements for the patterns in the code files.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/ppl_interface_generator_common_procedure_generators.m4 b/interfaces/ppl_interface_generator_common_procedure_generators.m4
index 2e89423..47f5282 100644
--- a/interfaces/ppl_interface_generator_common_procedure_generators.m4
+++ b/interfaces/ppl_interface_generator_common_procedure_generators.m4
@@ -4,7 +4,7 @@ dnl This m4 file defines the list of the procedures generated
 dnl that are independent of the interface being generated.
 
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/interfaces/ppl_interface_generator_copyright b/interfaces/ppl_interface_generator_copyright
index 8f392fb..ec4176b 100644
--- a/interfaces/ppl_interface_generator_copyright
+++ b/interfaces/ppl_interface_generator_copyright
@@ -1,5 +1,5 @@
 `   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/m4/Makefile.am b/m4/Makefile.am
index f09ad18..397ae4a 100644
--- a/m4/Makefile.am
+++ b/m4/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/m4/Makefile.in b/m4/Makefile.in
index 1a6bad5..d9ea992 100644
--- a/m4/Makefile.in
+++ b/m4/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -58,7 +74,8 @@ POST_UNINSTALL = :
 build_triplet = @build@
 host_triplet = @host@
 subdir = m4
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -91,14 +108,25 @@ mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
 CONFIG_HEADER = $(top_builddir)/config.h
 CONFIG_CLEAN_FILES =
 CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
 AM_V_GEN = $(am__v_GEN_ at AM_V@)
 am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
 AM_V_at = $(am__v_at_ at AM_V@)
 am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
 am__v_at_0 = @
+am__v_at_1 = 
 SOURCES =
 DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
 am__vpath_adj = case $$p in \
     $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
@@ -400,8 +428,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-m4dataDATA: $(m4data_DATA)
 	@$(NORMAL_INSTALL)
-	test -z "$(m4datadir)" || $(MKDIR_P) "$(DESTDIR)$(m4datadir)"
 	@list='$(m4data_DATA)'; test -n "$(m4datadir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(m4datadir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(m4datadir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -422,6 +453,8 @@ TAGS:
 ctags: CTAGS
 CTAGS:
 
+cscope cscopelist:
+
 
 distdir: $(DISTFILES)
 	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
diff --git a/m4/ac_check_ciao.m4 b/m4/ac_check_ciao.m4
index 6d070b5..265596c 100644
--- a/m4/ac_check_ciao.m4
+++ b/m4/ac_check_ciao.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the existence and usability of Ciao-Prolog.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_check_fpu_control.m4 b/m4/ac_check_fpu_control.m4
index 1541051..806d2f0 100644
--- a/m4/ac_check_fpu_control.m4
+++ b/m4/ac_check_fpu_control.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the possibility to control the FPU.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_check_gmp.m4 b/m4/ac_check_gmp.m4
index 5ceb585..39b6513 100644
--- a/m4/ac_check_gmp.m4
+++ b/m4/ac_check_gmp.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the existence and usability of GMP.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_check_sicstus_prolog.m4 b/m4/ac_check_sicstus_prolog.m4
index d74438d..764e9d7 100644
--- a/m4/ac_check_sicstus_prolog.m4
+++ b/m4/ac_check_sicstus_prolog.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the existence and usability of SICStus Prolog.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_check_swi_prolog.m4 b/m4/ac_check_swi_prolog.m4
index 8ea56fd..e6df9b0 100644
--- a/m4/ac_check_swi_prolog.m4
+++ b/m4/ac_check_swi_prolog.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the existence and usability of SWI-Prolog.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_check_xsb_prolog.m4 b/m4/ac_check_xsb_prolog.m4
index c40335a..c0ff9ad 100644
--- a/m4/ac_check_xsb_prolog.m4
+++ b/m4/ac_check_xsb_prolog.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the existence and usability of XSB Prolog.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_check_yap.m4 b/m4/ac_check_yap.m4
index 0b87156..e95665c 100644
--- a/m4/ac_check_yap.m4
+++ b/m4/ac_check_yap.m4
@@ -1,6 +1,6 @@
 dnl A function to check for the existence and usability of YAP Prolog.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_attribute_weak.m4 b/m4/ac_cxx_attribute_weak.m4
index e29c033..34e6596 100644
--- a/m4/ac_cxx_attribute_weak.m4
+++ b/m4/ac_cxx_attribute_weak.m4
@@ -1,7 +1,7 @@
 dnl A function to check whether the C++ compiler supports the function
 dnl __attribute__ ((weak)).
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_double_binary_format.m4 b/m4/ac_cxx_double_binary_format.m4
index 3f06137..83c8ec7 100644
--- a/m4/ac_cxx_double_binary_format.m4
+++ b/m4/ac_cxx_double_binary_format.m4
@@ -1,6 +1,6 @@
 dnl A function to detect the binary format used by C++ doubles.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_float_binary_format.m4 b/m4/ac_cxx_float_binary_format.m4
index ea6ad69..8427bcc 100644
--- a/m4/ac_cxx_float_binary_format.m4
+++ b/m4/ac_cxx_float_binary_format.m4
@@ -1,6 +1,6 @@
 dnl A function to detect the binary format used by C++ floats.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_ieee_inexact_flag.m4 b/m4/ac_cxx_ieee_inexact_flag.m4
index 433c7ea..e05bfb6 100644
--- a/m4/ac_cxx_ieee_inexact_flag.m4
+++ b/m4/ac_cxx_ieee_inexact_flag.m4
@@ -1,7 +1,7 @@
 dnl A function to check whether the IEEE inexact flag is supported and
 dnl available to C++ programs.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_limit_memory.m4 b/m4/ac_cxx_limit_memory.m4
index df4b450..fcf8ec8 100644
--- a/m4/ac_cxx_limit_memory.m4
+++ b/m4/ac_cxx_limit_memory.m4
@@ -1,7 +1,7 @@
 dnl A function to check whether it is possible to limit the memory
 dnl available to processes using setrlimit().
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_long_double_binary_format.m4 b/m4/ac_cxx_long_double_binary_format.m4
index 588d4b3..bc6cc49 100644
--- a/m4/ac_cxx_long_double_binary_format.m4
+++ b/m4/ac_cxx_long_double_binary_format.m4
@@ -1,6 +1,6 @@
 dnl A function to detect the binary format used by C++ long doubles.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -314,7 +314,30 @@ fi
 
 AC_MSG_RESULT($ac_cxx_long_double_binary_format)
 
-if test x"$ac_cxx_long_double_binary_format" = x"unknown" || test $ac_cv_can_control_fpu = 0
+AC_MSG_CHECKING([whether std::floor(long double) is buggy])
+AC_RUN_IFELSE([AC_LANG_SOURCE([[#include <cmath>
+#include <cstdlib>
+
+long double x = 13311002825915415087.0L;
+
+int main() {
+  long double y = std::floor(x);
+  if (x != y)
+    return 1;
+  else
+    return 0;
+}
+  ]])],
+  ac_std_floor_long_double_is_buggy=no
+  AC_MSG_RESULT(no),
+  ac_std_floor_long_double_is_buggy=yes
+  AC_MSG_RESULT(yes),
+  ac_std_floor_long_double_is_buggy=no
+  AC_MSG_RESULT([assuming is not]))
+
+if test x"$ac_cxx_long_double_binary_format" = x"unknown" \
+|| test $ac_cv_can_control_fpu = 0 \
+|| test x"$ac_std_floor_long_double_is_buggy" = x"yes"
 then
   ac_supported_long_double=0
 else
diff --git a/m4/ac_cxx_plain_char_is_signed.m4 b/m4/ac_cxx_plain_char_is_signed.m4
index 2328975..81b6fed 100644
--- a/m4/ac_cxx_plain_char_is_signed.m4
+++ b/m4/ac_cxx_plain_char_is_signed.m4
@@ -1,6 +1,6 @@
 dnl A function to check whether the plain char type is signed.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_proper_long_double.m4 b/m4/ac_cxx_proper_long_double.m4
index 23a4b6d..17432aa 100644
--- a/m4/ac_cxx_proper_long_double.m4
+++ b/m4/ac_cxx_proper_long_double.m4
@@ -1,7 +1,7 @@
 dnl A function to check whether the C++ compiler provides long double
 dnl numbers that have bigger range or precision than double.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_cxx_zero_length_arrays.m4 b/m4/ac_cxx_zero_length_arrays.m4
index 116d24d..33d5a98 100644
--- a/m4/ac_cxx_zero_length_arrays.m4
+++ b/m4/ac_cxx_zero_length_arrays.m4
@@ -1,6 +1,6 @@
 dnl A function to check whether the C++ compiler supports zero-length arrays.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ac_prog_jar.m4 b/m4/ac_prog_jar.m4
index 1cdbb02..7e0f9b2 100644
--- a/m4/ac_prog_jar.m4
+++ b/m4/ac_prog_jar.m4
@@ -36,7 +36,7 @@
 #
 #   Copyright (C) 2000      Egon Willighagen <e.willighagen at science.ru.nl>
 #   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-#   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+#   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 #   Copying and distribution of this file, with or without
 #   modification, are permitted in any medium without royalty provided
diff --git a/m4/ac_prog_java.m4 b/m4/ac_prog_java.m4
index cd405f3..5205c79 100644
--- a/m4/ac_prog_java.m4
+++ b/m4/ac_prog_java.m4
@@ -23,7 +23,7 @@
 #
 #   Copyright (C) 2000      Stephane Bortzmeyer <bortzmeyer at pasteur.fr>
 #   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-#   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+#   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 #   This program is free software; you can redistribute it and/or
 #   modify it under the terms of the GNU General Public License as
diff --git a/m4/ac_prog_javac.m4 b/m4/ac_prog_javac.m4
index 9d2a584..7a9a9b6 100644
--- a/m4/ac_prog_javac.m4
+++ b/m4/ac_prog_javac.m4
@@ -1,6 +1,6 @@
 dnl A function to check whether the Java compiler supports enums.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
@@ -98,7 +98,7 @@ AC_PROVIDE([$0])dnl
 #
 #   Copyright (c) 2000      Stephane Bortzmeyer <bortzmeyer at pasteur.fr>
 #   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-#   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+#   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 #   This program is free software; you can redistribute it and/or
 #   modify it under the terms of the GNU General Public License as
diff --git a/m4/ac_prog_javah.m4 b/m4/ac_prog_javah.m4
index 04241cf..0525349 100644
--- a/m4/ac_prog_javah.m4
+++ b/m4/ac_prog_javah.m4
@@ -18,7 +18,7 @@
 #
 #   Copyright (C) 2002      Luc Maisonobe <luc at spaceroots.org>
 #   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-#   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+#   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 #   Copying and distribution of this file, with or without
 #   modification, are permitted in any medium without royalty provided
diff --git a/m4/ac_text_md5sum.m4 b/m4/ac_text_md5sum.m4
index 9156dc9..d1c77d7 100644
--- a/m4/ac_text_md5sum.m4
+++ b/m4/ac_text_md5sum.m4
@@ -1,6 +1,6 @@
 dnl A function to set the command for computing the MD5 checksum of text files.
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ppl.m4 b/m4/ppl.m4
index e3ec23b..6259ce4 100644
--- a/m4/ppl.m4
+++ b/m4/ppl.m4
@@ -2,7 +2,7 @@ dnl A function to test for the existence and usability of particular
 dnl versions of the PPL, defining macros containing the required paths.
 dnl Copyright (C) 1997 Owen Taylor
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/m4/ppl_c.m4 b/m4/ppl_c.m4
index 69277b3..8680612 100644
--- a/m4/ppl_c.m4
+++ b/m4/ppl_c.m4
@@ -3,7 +3,7 @@ dnl versions of the C interface of the PPL, defining macros containing
 dnl the required paths.
 dnl Copyright (C) 1997 Owen Taylor
 dnl Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-dnl Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+dnl Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 dnl
 dnl This file is part of the Parma Polyhedra Library (PPL).
 dnl
diff --git a/ppl-config.h.in b/ppl-config.h.in
index b8f71c0..e69de29 100644
--- a/ppl-config.h.in
+++ b/ppl-config.h.in
@@ -1,411 +0,0 @@
-/* config.h.in.  Generated from configure.ac by autoheader.  */
-
-
-/* BEGIN ppl-config.h */
-
-#ifndef PPL_ppl_config_h
-#define PPL_ppl_config_h 1
-
-/* Unique (nonzero) code for the IEEE 754 Single Precision
-   floating point format.  */
-#define PPL_FLOAT_IEEE754_SINGLE 1
-
-/* Unique (nonzero) code for the IEEE 754 Double Precision
-   floating point format.  */
-#define PPL_FLOAT_IEEE754_DOUBLE 2
-
-/* Unique (nonzero) code for the IEEE 754 Quad Precision
-   floating point format.  */
-#define PPL_FLOAT_IEEE754_QUAD 3
-
-/* Unique (nonzero) code for the Intel Double-Extended
-   floating point format.  */
-#define PPL_FLOAT_INTEL_DOUBLE_EXTENDED 4
-
-
-/* Define if building universal (internal helper macro) */
-#undef AC_APPLE_UNIVERSAL_BUILD
-
-/* Define to 1 if you have the declaration of `ffs', and to 0 if you don't. */
-#undef PPL_HAVE_DECL_FFS
-
-/* Define to 1 if you have the declaration of `fma', and to 0 if you don't. */
-#undef PPL_HAVE_DECL_FMA
-
-/* Define to 1 if you have the declaration of `fmaf', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_FMAF
-
-/* Define to 1 if you have the declaration of `fmal', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_FMAL
-
-/* Define to 1 if you have the declaration of `getenv', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_GETENV
-
-/* Define to 1 if you have the declaration of `getrusage', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_GETRUSAGE
-
-/* Define to 1 if you have the declaration of `rintf', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_RINTF
-
-/* Define to 1 if you have the declaration of `rintl', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_RINTL
-
-/* Define to 1 if you have the declaration of `RLIMIT_AS', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_RLIMIT_AS
-
-/* Define to 1 if you have the declaration of `RLIMIT_DATA', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_RLIMIT_DATA
-
-/* Define to 1 if you have the declaration of `RLIMIT_RSS', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_RLIMIT_RSS
-
-/* Define to 1 if you have the declaration of `RLIMIT_VMEM', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_RLIMIT_VMEM
-
-/* Define to 1 if you have the declaration of `setitimer', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_SETITIMER
-
-/* Define to 1 if you have the declaration of `setrlimit', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_SETRLIMIT
-
-/* Define to 1 if you have the declaration of `sigaction', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_SIGACTION
-
-/* Define to 1 if you have the declaration of `strtod', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_STRTOD
-
-/* Define to 1 if you have the declaration of `strtof', and to 0 if you don't.
-   */
-#undef PPL_HAVE_DECL_STRTOF
-
-/* Define to 1 if you have the declaration of `strtold', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_STRTOLD
-
-/* Define to 1 if you have the declaration of `strtoll', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_STRTOLL
-
-/* Define to 1 if you have the declaration of `strtoull', and to 0 if you
-   don't. */
-#undef PPL_HAVE_DECL_STRTOULL
-
-/* Define to 1 if you have the <dlfcn.h> header file. */
-#undef PPL_HAVE_DLFCN_H
-
-/* Define to 1 if you have the <fenv.h> header file. */
-#undef PPL_HAVE_FENV_H
-
-/* Define to 1 if you have the <getopt.h> header file. */
-#undef PPL_HAVE_GETOPT_H
-
-/* Define to 1 if you have the <glpk/glpk.h> header file. */
-#undef PPL_HAVE_GLPK_GLPK_H
-
-/* Define to 1 if you have the <glpk.h> header file. */
-#undef PPL_HAVE_GLPK_H
-
-/* Define to 1 if you have the <ieeefp.h> header file. */
-#undef PPL_HAVE_IEEEFP_H
-
-/* Define to 1 if you have the <inttypes.h> header file. */
-#undef PPL_HAVE_INTTYPES_H
-
-/* Define to 1 if the system has the type `int_fast16_t'. */
-#undef PPL_HAVE_INT_FAST16_T
-
-/* Define to 1 if the system has the type `int_fast32_t'. */
-#undef PPL_HAVE_INT_FAST32_T
-
-/* Define to 1 if the system has the type `int_fast64_t'. */
-#undef PPL_HAVE_INT_FAST64_T
-
-/* Define to 1 if you have the <memory.h> header file. */
-#undef PPL_HAVE_MEMORY_H
-
-/* Define to 1 if the system has the type `siginfo_t'. */
-#undef PPL_HAVE_SIGINFO_T
-
-/* Define to 1 if you have the <signal.h> header file. */
-#undef PPL_HAVE_SIGNAL_H
-
-/* Define to 1 if you have the <stdint.h> header file. */
-#undef PPL_HAVE_STDINT_H
-
-/* Define to 1 if you have the <stdlib.h> header file. */
-#undef PPL_HAVE_STDLIB_H
-
-/* Define to 1 if you have the <strings.h> header file. */
-#undef PPL_HAVE_STRINGS_H
-
-/* Define to 1 if you have the <string.h> header file. */
-#undef PPL_HAVE_STRING_H
-
-/* Define to 1 if you have the <sys/resource.h> header file. */
-#undef PPL_HAVE_SYS_RESOURCE_H
-
-/* Define to 1 if you have the <sys/stat.h> header file. */
-#undef PPL_HAVE_SYS_STAT_H
-
-/* Define to 1 if you have the <sys/time.h> header file. */
-#undef PPL_HAVE_SYS_TIME_H
-
-/* Define to 1 if you have the <sys/types.h> header file. */
-#undef PPL_HAVE_SYS_TYPES_H
-
-/* Define to 1 if the system has the type `timeval'. */
-#undef PPL_HAVE_TIMEVAL
-
-/* Define to 1 if typeof works with your compiler. */
-#undef PPL_HAVE_TYPEOF
-
-/* Define to 1 if the system has the type `uintptr_t'. */
-#undef PPL_HAVE_UINTPTR_T
-
-/* Define to 1 if the system has the type `uint_fast16_t'. */
-#undef PPL_HAVE_UINT_FAST16_T
-
-/* Define to 1 if the system has the type `uint_fast32_t'. */
-#undef PPL_HAVE_UINT_FAST32_T
-
-/* Define to 1 if the system has the type `uint_fast64_t'. */
-#undef PPL_HAVE_UINT_FAST64_T
-
-/* Define to 1 if you have the <unistd.h> header file. */
-#undef PPL_HAVE_UNISTD_H
-
-/* Define to 1 if `_mp_alloc' is a member of `__mpz_struct'. */
-#undef PPL_HAVE___MPZ_STRUCT__MP_ALLOC
-
-/* Define to 1 if `_mp_d' is a member of `__mpz_struct'. */
-#undef PPL_HAVE___MPZ_STRUCT__MP_D
-
-/* Define to 1 if `_mp_size' is a member of `__mpz_struct'. */
-#undef PPL_HAVE___MPZ_STRUCT__MP_SIZE
-
-/* Define to the sub-directory in which libtool stores uninstalled libraries.
-   */
-#undef LT_OBJDIR
-
-/* Define to the address where bug reports for this package should be sent. */
-#undef PPL_PACKAGE_BUGREPORT
-
-/* Define to the full name of this package. */
-#undef PPL_PACKAGE_NAME
-
-/* Define to the full name and version of this package. */
-#undef PPL_PACKAGE_STRING
-
-/* Define to the one symbol short name of this package. */
-#undef PPL_PACKAGE_TARNAME
-
-/* Define to the home page for this package. */
-#undef PACKAGE_URL
-
-/* Define to the version of this package. */
-#undef PPL_PACKAGE_VERSION
-
-/* ABI-breaking extra assertions are enabled when this is defined. */
-#undef PPL_ABI_BREAKING_EXTRA_DEBUG
-
-/* Not zero if the FPU can be controlled. */
-#undef PPL_CAN_CONTROL_FPU
-
-/* Defined if the integral type to be used for coefficients is a checked one.
-   */
-#undef PPL_CHECKED_INTEGERS
-
-/* The number of bits of coefficients; 0 if unbounded. */
-#undef PPL_COEFFICIENT_BITS
-
-/* The integral type used to represent coefficients. */
-#undef PPL_COEFFICIENT_TYPE
-
-/* This contains the options with which `configure' was invoked. */
-#undef PPL_CONFIGURE_OPTIONS
-
-/* The unique code of the binary format of C++ doubles, if supported;
-   undefined otherwise. */
-#undef PPL_CXX_DOUBLE_BINARY_FORMAT
-
-/* The binary format of C++ floats, if supported; undefined otherwise. */
-#undef PPL_CXX_FLOAT_BINARY_FORMAT
-
-/* The unique code of the binary format of C++ long doubles, if supported;
-   undefined otherwise. */
-#undef PPL_CXX_LONG_DOUBLE_BINARY_FORMAT
-
-/* Not zero if the the plain char type is signed. */
-#undef PPL_CXX_PLAIN_CHAR_IS_SIGNED
-
-/* Not zero if the C++ compiler provides long double numbers that have bigger
-   range or precision than double. */
-#undef PPL_CXX_PROVIDES_PROPER_LONG_DOUBLE
-
-/* Not zero if the C++ compiler supports __attribute__ ((weak)). */
-#undef PPL_CXX_SUPPORTS_ATTRIBUTE_WEAK
-
-/* Not zero if the the IEEE inexact flag is supported in C++. */
-#undef PPL_CXX_SUPPORTS_IEEE_INEXACT_FLAG
-
-/* Not zero if it is possible to limit memory using setrlimit(). */
-#undef PPL_CXX_SUPPORTS_LIMITING_MEMORY
-
-/* Not zero if the C++ compiler supports zero_length arrays. */
-#undef PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-
-/* Defined if floating point arithmetic may use the 387 unit. */
-#undef PPL_FPMATH_MAY_USE_387
-
-/* Defined if floating point arithmetic may use the SSE instruction set. */
-#undef PPL_FPMATH_MAY_USE_SSE
-
-/* Defined if GLPK provides glp_term_hook(). */
-#undef PPL_GLPK_HAS_GLP_TERM_HOOK
-
-/* Defined if GLPK provides glp_term_out(). */
-#undef PPL_GLPK_HAS_GLP_TERM_OUT
-
-/* Defined if GLPK provides lib_set_print_hook(). */
-#undef PPL_GLPK_HAS_LIB_SET_PRINT_HOOK
-
-/* Defined if GLPK provides _glp_lib_print_hook(). */
-#undef PPL_GLPK_HAS__GLP_LIB_PRINT_HOOK
-
-/* Defined if the integral type to be used for coefficients is GMP's one. */
-#undef PPL_GMP_INTEGERS
-
-/* Not zero if GMP has been compiled with support for exceptions. */
-#undef PPL_GMP_SUPPORTS_EXCEPTIONS
-
-/* Defined if the integral type to be used for coefficients is a native one.
-   */
-#undef PPL_NATIVE_INTEGERS
-
-/* Assertions are disabled when this is defined. */
-#undef PPL_NDEBUG
-
-/* Not zero if doubles are supported. */
-#undef PPL_SUPPORTED_DOUBLE
-
-/* Not zero if floats are supported. */
-#undef PPL_SUPPORTED_FLOAT
-
-/* Not zero if long doubles are supported. */
-#undef PPL_SUPPORTED_LONG_DOUBLE
-
-/* The size of `char', as computed by sizeof. */
-#undef PPL_SIZEOF_CHAR
-
-/* The size of `double', as computed by sizeof. */
-#undef PPL_SIZEOF_DOUBLE
-
-/* The size of `float', as computed by sizeof. */
-#undef PPL_SIZEOF_FLOAT
-
-/* The size of `fp', as computed by sizeof. */
-#undef PPL_SIZEOF_FP
-
-/* The size of `int', as computed by sizeof. */
-#undef PPL_SIZEOF_INT
-
-/* The size of `int*', as computed by sizeof. */
-#undef PPL_SIZEOF_INTP
-
-/* The size of `long', as computed by sizeof. */
-#undef PPL_SIZEOF_LONG
-
-/* The size of `long double', as computed by sizeof. */
-#undef PPL_SIZEOF_LONG_DOUBLE
-
-/* The size of `long long', as computed by sizeof. */
-#undef PPL_SIZEOF_LONG_LONG
-
-/* The size of `mp_limb_t', as computed by sizeof. */
-#undef PPL_SIZEOF_MP_LIMB_T
-
-/* The size of `short', as computed by sizeof. */
-#undef PPL_SIZEOF_SHORT
-
-/* The size of `size_t', as computed by sizeof. */
-#undef PPL_SIZEOF_SIZE_T
-
-/* Define to 1 if you have the ANSI C header files. */
-#undef PPL_STDC_HEADERS
-
-/* Define PPL_WORDS_BIGENDIAN to 1 if your processor stores words with the most
-   significant byte first (like Motorola and SPARC, unlike Intel). */
-#if defined AC_APPLE_UNIVERSAL_BUILD
-# if defined __BIG_ENDIAN__
-#  define PPL_WORDS_BIGENDIAN 1
-# endif
-#else
-# ifndef PPL_WORDS_BIGENDIAN
-#  undef PPL_WORDS_BIGENDIAN
-# endif
-#endif
-
-/* When defined and libstdc++ is used, it is used in debug mode. */
-#undef _GLIBCXX_DEBUG
-
-/* When defined and libstdc++ is used, it is used in pedantic debug mode. */
-#undef _GLIBCXX_DEBUG_PEDANTIC
-
-/* Define to empty if `const' does not conform to ANSI C. */
-#undef const
-
-/* Define to `__inline__' or `__inline' if that's what the C compiler
-   calls it, or to nothing if 'inline' is not supported under any name.  */
-#ifndef __cplusplus
-#undef inline
-#endif
-
-/* Define to __typeof__ if your compiler spells it that way. */
-#undef typeof
-
-/* Define to the type of an unsigned integer type wide enough to hold a
-   pointer, if such a type exists, and if the system does not define it. */
-#undef uintptr_t
-
-
-#if defined(PPL_NDEBUG) && !defined(NDEBUG)
-# define NDEBUG PPL_NDEBUG
-#endif
-
-/* In order for the definition of `int64_t' to be seen by Comeau C/C++,
-   we must make sure <stdint.h> is included before <sys/types.hh> is
-   (even indirectly) included.  Moreover we need to define
-   __STDC_LIMIT_MACROS before the first inclusion of <stdint.h>
-   in order to have the macros defined also in C++.  */
-
-#ifdef PPL_HAVE_STDINT_H
-# ifndef __STDC_LIMIT_MACROS
-#  define __STDC_LIMIT_MACROS 1
-# endif
-# include <stdint.h>
-#endif
-
-#ifdef PPL_HAVE_INTTYPES_H
-# include <inttypes.h>
-#endif
-
-#define PPL_U(x) x
-
-#endif /* !defined(PPL_ppl_config_h) */
-
-/* END ppl-config.h */
-
diff --git a/src/BDS_Status.idefs.hh b/src/BDS_Status.idefs.hh
deleted file mode 100644
index cfe2580..0000000
--- a/src/BDS_Status.idefs.hh
+++ /dev/null
@@ -1,117 +0,0 @@
-/* BD_Shape<T>::Status class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BDS_Status_idefs_hh
-#define PPL_BDS_Status_idefs_hh 1
-
-#ifndef PPL_IN_BD_Shape_CLASS
-#error "Do not include BDS_Status.idefs.hh directly; use BD_Shape.defs.hh instead"
-#endif
-
-//! A conjunctive assertion about a BD_Shape<T> object.
-/*! \ingroup PPL_CXX_interface
-  The assertions supported are:
-  - <EM>zero-dim universe</EM>: the BDS is the zero-dimensional
-    vector space \f$\Rset^0 = \{\cdot\}\f$;
-  - <EM>empty</EM>: the BDS is the empty set;
-  - <EM>shortest-path closed</EM>: the BDS is represented by a shortest-path
-    closed system of bounded differences, so that all the constraints are
-    as tight as possible;
-  - <EM>shortest-path reduced</EM>: the BDS is represented by a shortest-path
-    closed system of bounded differences and each constraint in such a system
-    is marked as being either redundant or non-redundant.
-
-  Not all the conjunctions of these elementary assertions constitute
-  a legal Status.  In fact:
-  - <EM>zero-dim universe</EM> excludes any other assertion;
-  - <EM>empty</EM>: excludes any other assertion;
-  - <EM>shortest-path reduced</EM> implies <EM>shortest-path closed</EM>.
-*/
-class Status {
-public:
-  //! By default Status is the <EM>zero-dim universe</EM> assertion.
-  Status();
-
-  //! \name Test, remove or add an individual assertion from the conjunction.
-  //@{
-  bool test_zero_dim_univ() const;
-  void reset_zero_dim_univ();
-  void set_zero_dim_univ();
-
-  bool test_empty() const;
-  void reset_empty();
-  void set_empty();
-
-  bool test_shortest_path_closed() const;
-  void reset_shortest_path_closed();
-  void set_shortest_path_closed();
-
-  bool test_shortest_path_reduced() const;
-  void reset_shortest_path_reduced();
-  void set_shortest_path_reduced();
-  //@}
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-private:
-  //! Status is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bit-masks for the individual assertions.
-  //@{
-  static const flags_t ZERO_DIM_UNIV         = 0U;
-  static const flags_t EMPTY                 = 1U << 0;
-  static const flags_t SHORTEST_PATH_CLOSED  = 1U << 1;
-  static const flags_t SHORTEST_PATH_REDUCED = 1U << 2;
-  //@}
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! Construct from a bit-mask.
-  Status(flags_t mask);
-
-  //! Check whether <EM>all</EM> bits in \p mask are set.
-  bool test_all(flags_t mask) const;
-
-  //! Check whether <EM>at least one</EM> bit in \p mask is set.
-  bool test_any(flags_t mask) const;
-
-  //! Set the bits in \p mask.
-  void set(flags_t mask);
-
-  //! Reset the bits in \p mask.
-  void reset(flags_t mask);
-};
-
-#endif // !defined(PPL_BDS_Status_idefs_hh)
diff --git a/src/BDS_Status.inlines.hh b/src/BDS_Status.inlines.hh
deleted file mode 100644
index 9ba7aed..0000000
--- a/src/BDS_Status.inlines.hh
+++ /dev/null
@@ -1,268 +0,0 @@
-/* BD_Shape<T>::Status class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BDS_Status_inlines_hh
-#define PPL_BDS_Status_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline
-BD_Shape<T>::Status::Status(flags_t mask)
-  : flags(mask) {
-}
-
-template <typename T>
-inline
-BD_Shape<T>::Status::Status()
-  : flags(ZERO_DIM_UNIV) {
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::Status::test_all(flags_t mask) const {
-  return (flags & mask) == mask;
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::Status::test_any(flags_t mask) const {
-  return (flags & mask) != 0;
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::set(flags_t mask) {
-  flags |= mask;
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::reset(flags_t mask) {
-  flags &= ~mask;
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::Status::test_zero_dim_univ() const {
-  return flags == ZERO_DIM_UNIV;
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::reset_zero_dim_univ() {
-  // This is a no-op if the current status is not zero-dim.
-  if (flags == ZERO_DIM_UNIV)
-    // In the zero-dim space, if it is not the universe it is empty.
-    flags = EMPTY;
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::set_zero_dim_univ() {
-  // Zero-dim universe is incompatible with anything else.
-  flags = ZERO_DIM_UNIV;
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::Status::test_empty() const {
-  return test_any(EMPTY);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::reset_empty() {
-  reset(EMPTY);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::set_empty() {
-  flags = EMPTY;
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::Status::test_shortest_path_closed() const {
-  return test_any(SHORTEST_PATH_CLOSED);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::reset_shortest_path_closed() {
-  // A system is reduced only if it is also closed.
-  reset(SHORTEST_PATH_CLOSED | SHORTEST_PATH_REDUCED);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::set_shortest_path_closed() {
-  set(SHORTEST_PATH_CLOSED);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::Status::test_shortest_path_reduced() const {
-  return test_any(SHORTEST_PATH_REDUCED);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::reset_shortest_path_reduced() {
-  reset(SHORTEST_PATH_REDUCED);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::Status::set_shortest_path_reduced() {
-  PPL_ASSERT(test_shortest_path_closed());
-  set(SHORTEST_PATH_REDUCED);
-}
-
-template <typename T>
-bool
-BD_Shape<T>::Status::OK() const {
-  if (test_zero_dim_univ())
-    // Zero-dim universe is OK.
-    return true;
-
-  if (test_empty()) {
-    Status copy = *this;
-    copy.reset_empty();
-    if (copy.test_zero_dim_univ())
-      return true;
-    else {
-#ifndef NDEBUG
-      std::cerr << "The empty flag is incompatible with any other one."
-		<< std::endl;
-#endif
-      return false;
-    }
-  }
-
-  // Shortest-path reduction implies shortest-path closure.
-  if (test_shortest_path_reduced()) {
-    if (test_shortest_path_closed())
-      return true;
-    else {
-#ifndef NDEBUG
-      std::cerr << "The shortest-path reduction flag should also imply "
-		<< "the closure flag."
-		<< std::endl;
-#endif
-      return false;
-    }
-  }
-
-  // Any other case is OK.
-  return true;
-}
-
-
-namespace Implementation {
-
-namespace BD_Shapes {
-
-// These are the keywords that indicate the individual assertions.
-const std::string zero_dim_univ = "ZE";
-const std::string empty = "EM";
-const std::string sp_closed = "SPC";
-const std::string sp_reduced = "SPR";
-const char yes = '+';
-const char no = '-';
-const char separator = ' ';
-
-/*! \relates Parma_Polyhedra_Library::BD_Shape::Status
-  Reads a keyword and its associated on/off flag from \p s.
-  Returns <CODE>true</CODE> if the operation is successful,
-  returns <CODE>false</CODE> otherwise.
-  When successful, \p positive is set to <CODE>true</CODE> if the flag
-  is on; it is set to <CODE>false</CODE> otherwise.
-*/
-inline bool
-get_field(std::istream& s, const std::string& keyword, bool& positive) {
-  std::string str;
-  if (!(s >> str)
-      || (str[0] != yes && str[0] != no)
-      || str.substr(1) != keyword)
-    return false;
-  positive = (str[0] == yes);
-  return true;
-}
-
-} // namespace BD_Shapes
-
-} // namespace Implementation
-
-template <typename T>
-void
-BD_Shape<T>::Status::ascii_dump(std::ostream& s) const {
-  using namespace Implementation::BD_Shapes;
-  s << (test_zero_dim_univ() ? yes : no) << zero_dim_univ << separator
-    << (test_empty() ? yes : no) << empty << separator
-    << separator
-    << (test_shortest_path_closed() ? yes : no) << sp_closed << separator
-    << (test_shortest_path_reduced() ? yes : no) << sp_reduced << separator;
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(T, BD_Shape<T>::Status)
-
-template <typename T>
-bool
-BD_Shape<T>::Status::ascii_load(std::istream& s) {
-  using namespace Implementation::BD_Shapes;
-  PPL_UNINITIALIZED(bool, positive);
-
-  if (!get_field(s, zero_dim_univ, positive))
-    return false;
-  if (positive)
-    set_zero_dim_univ();
-
-  if (!get_field(s, empty, positive))
-    return false;
-  if (positive)
-    set_empty();
-
-  if (!get_field(s, sp_closed, positive))
-    return false;
-  if (positive)
-    set_shortest_path_closed();
-  else
-    reset_shortest_path_closed();
-
-  if (!get_field(s, sp_reduced, positive))
-    return false;
-  if (positive)
-    set_shortest_path_reduced();
-  else
-    reset_shortest_path_reduced();
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_BDS_Status_inlines_hh)
diff --git a/src/BDS_Status_idefs.hh b/src/BDS_Status_idefs.hh
new file mode 100644
index 0000000..c2a609e
--- /dev/null
+++ b/src/BDS_Status_idefs.hh
@@ -0,0 +1,117 @@
+/* BD_Shape<T>::Status class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BDS_Status_idefs_hh
+#define PPL_BDS_Status_idefs_hh 1
+
+#ifndef PPL_IN_BD_Shape_CLASS
+#error "Do not include BDS_Status_idefs.hh directly; use BD_Shape_defs.hh instead"
+#endif
+
+//! A conjunctive assertion about a BD_Shape<T> object.
+/*! \ingroup PPL_CXX_interface
+  The assertions supported are:
+  - <EM>zero-dim universe</EM>: the BDS is the zero-dimensional
+    vector space \f$\Rset^0 = \{\cdot\}\f$;
+  - <EM>empty</EM>: the BDS is the empty set;
+  - <EM>shortest-path closed</EM>: the BDS is represented by a shortest-path
+    closed system of bounded differences, so that all the constraints are
+    as tight as possible;
+  - <EM>shortest-path reduced</EM>: the BDS is represented by a shortest-path
+    closed system of bounded differences and each constraint in such a system
+    is marked as being either redundant or non-redundant.
+
+  Not all the conjunctions of these elementary assertions constitute
+  a legal Status.  In fact:
+  - <EM>zero-dim universe</EM> excludes any other assertion;
+  - <EM>empty</EM>: excludes any other assertion;
+  - <EM>shortest-path reduced</EM> implies <EM>shortest-path closed</EM>.
+*/
+class Status {
+public:
+  //! By default Status is the <EM>zero-dim universe</EM> assertion.
+  Status();
+
+  //! \name Test, remove or add an individual assertion from the conjunction.
+  //@{
+  bool test_zero_dim_univ() const;
+  void reset_zero_dim_univ();
+  void set_zero_dim_univ();
+
+  bool test_empty() const;
+  void reset_empty();
+  void set_empty();
+
+  bool test_shortest_path_closed() const;
+  void reset_shortest_path_closed();
+  void set_shortest_path_closed();
+
+  bool test_shortest_path_reduced() const;
+  void reset_shortest_path_reduced();
+  void set_shortest_path_reduced();
+  //@}
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+private:
+  //! Status is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bit-masks for the individual assertions.
+  //@{
+  static const flags_t ZERO_DIM_UNIV         = 0U;
+  static const flags_t EMPTY                 = 1U << 0;
+  static const flags_t SHORTEST_PATH_CLOSED  = 1U << 1;
+  static const flags_t SHORTEST_PATH_REDUCED = 1U << 2;
+  //@}
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! Construct from a bit-mask.
+  Status(flags_t mask);
+
+  //! Check whether <EM>all</EM> bits in \p mask are set.
+  bool test_all(flags_t mask) const;
+
+  //! Check whether <EM>at least one</EM> bit in \p mask is set.
+  bool test_any(flags_t mask) const;
+
+  //! Set the bits in \p mask.
+  void set(flags_t mask);
+
+  //! Reset the bits in \p mask.
+  void reset(flags_t mask);
+};
+
+#endif // !defined(PPL_BDS_Status_idefs_hh)
diff --git a/src/BDS_Status_inlines.hh b/src/BDS_Status_inlines.hh
new file mode 100644
index 0000000..8cf9130
--- /dev/null
+++ b/src/BDS_Status_inlines.hh
@@ -0,0 +1,268 @@
+/* BD_Shape<T>::Status class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BDS_Status_inlines_hh
+#define PPL_BDS_Status_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+BD_Shape<T>::Status::Status(flags_t mask)
+  : flags(mask) {
+}
+
+template <typename T>
+inline
+BD_Shape<T>::Status::Status()
+  : flags(ZERO_DIM_UNIV) {
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::Status::test_all(flags_t mask) const {
+  return (flags & mask) == mask;
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::Status::test_any(flags_t mask) const {
+  return (flags & mask) != 0;
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::set(flags_t mask) {
+  flags |= mask;
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::reset(flags_t mask) {
+  flags &= ~mask;
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::Status::test_zero_dim_univ() const {
+  return flags == ZERO_DIM_UNIV;
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::reset_zero_dim_univ() {
+  // This is a no-op if the current status is not zero-dim.
+  if (flags == ZERO_DIM_UNIV)
+    // In the zero-dim space, if it is not the universe it is empty.
+    flags = EMPTY;
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::set_zero_dim_univ() {
+  // Zero-dim universe is incompatible with anything else.
+  flags = ZERO_DIM_UNIV;
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::Status::test_empty() const {
+  return test_any(EMPTY);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::reset_empty() {
+  reset(EMPTY);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::set_empty() {
+  flags = EMPTY;
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::Status::test_shortest_path_closed() const {
+  return test_any(SHORTEST_PATH_CLOSED);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::reset_shortest_path_closed() {
+  // A system is reduced only if it is also closed.
+  reset(SHORTEST_PATH_CLOSED | SHORTEST_PATH_REDUCED);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::set_shortest_path_closed() {
+  set(SHORTEST_PATH_CLOSED);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::Status::test_shortest_path_reduced() const {
+  return test_any(SHORTEST_PATH_REDUCED);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::reset_shortest_path_reduced() {
+  reset(SHORTEST_PATH_REDUCED);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::Status::set_shortest_path_reduced() {
+  PPL_ASSERT(test_shortest_path_closed());
+  set(SHORTEST_PATH_REDUCED);
+}
+
+template <typename T>
+bool
+BD_Shape<T>::Status::OK() const {
+  if (test_zero_dim_univ())
+    // Zero-dim universe is OK.
+    return true;
+
+  if (test_empty()) {
+    Status copy = *this;
+    copy.reset_empty();
+    if (copy.test_zero_dim_univ())
+      return true;
+    else {
+#ifndef NDEBUG
+      std::cerr << "The empty flag is incompatible with any other one."
+                << std::endl;
+#endif
+      return false;
+    }
+  }
+
+  // Shortest-path reduction implies shortest-path closure.
+  if (test_shortest_path_reduced()) {
+    if (test_shortest_path_closed())
+      return true;
+    else {
+#ifndef NDEBUG
+      std::cerr << "The shortest-path reduction flag should also imply "
+                << "the closure flag."
+                << std::endl;
+#endif
+      return false;
+    }
+  }
+
+  // Any other case is OK.
+  return true;
+}
+
+
+namespace Implementation {
+
+namespace BD_Shapes {
+
+// These are the keywords that indicate the individual assertions.
+const std::string zero_dim_univ = "ZE";
+const std::string empty = "EM";
+const std::string sp_closed = "SPC";
+const std::string sp_reduced = "SPR";
+const char yes = '+';
+const char no = '-';
+const char separator = ' ';
+
+/*! \relates Parma_Polyhedra_Library::BD_Shape::Status
+  Reads a keyword and its associated on/off flag from \p s.
+  Returns <CODE>true</CODE> if the operation is successful,
+  returns <CODE>false</CODE> otherwise.
+  When successful, \p positive is set to <CODE>true</CODE> if the flag
+  is on; it is set to <CODE>false</CODE> otherwise.
+*/
+inline bool
+get_field(std::istream& s, const std::string& keyword, bool& positive) {
+  std::string str;
+  if (!(s >> str)
+      || (str[0] != yes && str[0] != no)
+      || str.substr(1) != keyword)
+    return false;
+  positive = (str[0] == yes);
+  return true;
+}
+
+} // namespace BD_Shapes
+
+} // namespace Implementation
+
+template <typename T>
+void
+BD_Shape<T>::Status::ascii_dump(std::ostream& s) const {
+  using namespace Implementation::BD_Shapes;
+  s << (test_zero_dim_univ() ? yes : no) << zero_dim_univ << separator
+    << (test_empty() ? yes : no) << empty << separator
+    << separator
+    << (test_shortest_path_closed() ? yes : no) << sp_closed << separator
+    << (test_shortest_path_reduced() ? yes : no) << sp_reduced << separator;
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(T, BD_Shape<T>::Status)
+
+template <typename T>
+bool
+BD_Shape<T>::Status::ascii_load(std::istream& s) {
+  using namespace Implementation::BD_Shapes;
+  PPL_UNINITIALIZED(bool, positive);
+
+  if (!get_field(s, zero_dim_univ, positive))
+    return false;
+  if (positive)
+    set_zero_dim_univ();
+
+  if (!get_field(s, empty, positive))
+    return false;
+  if (positive)
+    set_empty();
+
+  if (!get_field(s, sp_closed, positive))
+    return false;
+  if (positive)
+    set_shortest_path_closed();
+  else
+    reset_shortest_path_closed();
+
+  if (!get_field(s, sp_reduced, positive))
+    return false;
+  if (positive)
+    set_shortest_path_reduced();
+  else
+    reset_shortest_path_reduced();
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_BDS_Status_inlines_hh)
diff --git a/src/BD_Shape.cc b/src/BD_Shape.cc
index ab9932e..f772fcd 100644
--- a/src/BD_Shape.cc
+++ b/src/BD_Shape.cc
@@ -1,6 +1,6 @@
 /* BD_Shape class implementation: non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "BD_Shape.defs.hh"
+#include "BD_Shape_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
@@ -80,7 +80,7 @@ PPL::BD_Shape_Helpers::extract_bounded_difference(const Constraint& c,
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 void
 PPL::compute_leader_indices(const std::vector<dimension_type>& predecessor,
-			    std::vector<dimension_type>& indices) {
+                            std::vector<dimension_type>& indices) {
   // The vector `indices' contains one entry for each equivalence
   // class, storing the index of the corresponding leader in
   // increasing order: it is used to avoid repeated tests for leadership.
diff --git a/src/BD_Shape.defs.hh b/src/BD_Shape.defs.hh
deleted file mode 100644
index 64b882e..0000000
--- a/src/BD_Shape.defs.hh
+++ /dev/null
@@ -1,2367 +0,0 @@
-/* BD_Shape class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BD_Shape_defs_hh
-#define PPL_BD_Shape_defs_hh 1
-
-#include "BD_Shape.types.hh"
-#include "globals.defs.hh"
-#include "Constraint.types.hh"
-#include "Generator.types.hh"
-#include "Congruence.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint_System.types.hh"
-#include "Generator_System.types.hh"
-#include "Congruence_System.types.hh"
-#include "Poly_Con_Relation.types.hh"
-#include "Poly_Gen_Relation.types.hh"
-#include "Polyhedron.types.hh"
-#include "Box.types.hh"
-#include "Grid.types.hh"
-#include "Octagonal_Shape.types.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.types.hh"
-#include "DB_Matrix.defs.hh"
-#include "DB_Row.defs.hh"
-#include "Checked_Number.defs.hh"
-#include "WRD_coefficient_types.defs.hh"
-#include "Bit_Matrix.defs.hh"
-#include "Coefficient.defs.hh"
-#include "Interval.types.hh"
-#include "Linear_Form.types.hh"
-#include <cstddef>
-#include <iosfwd>
-#include <vector>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::BD_Shape
-  Writes a textual representation of \p bds on \p s:
-  <CODE>false</CODE> is written if \p bds is an empty polyhedron;
-  <CODE>true</CODE> is written if \p bds is the universe polyhedron;
-  a system of constraints defining \p bds is written otherwise,
-  all constraints separated by ", ".
-*/
-template <typename T>
-std::ostream&
-operator<<(std::ostream& s, const BD_Shape<T>& bds);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates BD_Shape */
-template <typename T>
-void swap(BD_Shape<T>& x, BD_Shape<T>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are the same BDS.
-/*! \relates BD_Shape
-  Note that \p x and \p y may be dimension-incompatible shapes:
-  in this case, the value <CODE>false</CODE> is returned.
-*/
-template <typename T>
-bool operator==(const BD_Shape<T>& x, const BD_Shape<T>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are not the same BDS.
-/*! \relates BD_Shape
-  Note that \p x and \p y may be dimension-incompatible shapes:
-  in this case, the value <CODE>true</CODE> is returned.
-*/
-template <typename T>
-bool operator!=(const BD_Shape<T>& x, const BD_Shape<T>& y);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const BD_Shape<T>& x,
-                                 const BD_Shape<T>& y,
-                                 Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const BD_Shape<T>& x,
-                                 const BD_Shape<T>& y,
-                                 Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const BD_Shape<T>& x,
-                                 const BD_Shape<T>& y,
-                                 Rounding_Dir dir,
-                                 Temp& tmp0,
-                                 Temp& tmp1,
-                                 Temp& tmp2);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const BD_Shape<T>& x,
-                               const BD_Shape<T>& y,
-                               Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const BD_Shape<T>& x,
-                               const BD_Shape<T>& y,
-                               Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const BD_Shape<T>& x,
-                               const BD_Shape<T>& y,
-                               Rounding_Dir dir,
-                               Temp& tmp0,
-                               Temp& tmp1,
-                               Temp& tmp2);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const BD_Shape<T>& x,
-                                const BD_Shape<T>& y,
-                                Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const BD_Shape<T>& x,
-                                const BD_Shape<T>& y,
-                                Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates BD_Shape
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const BD_Shape<T>& x,
-                                const BD_Shape<T>& y,
-                                Rounding_Dir dir,
-                                Temp& tmp0,
-                                Temp& tmp1,
-                                Temp& tmp2);
-
-// This class contains some helper functions that need to be friends of
-// Linear_Expression.
-class BD_Shape_Helpers {
-public:
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! Decodes the constraint \p c as a bounded difference.
-  /*! \relates BD_Shape
-    \return
-    <CODE>true</CODE> if the constraint \p c is a
-    \ref Bounded_Difference_Shapes "bounded difference";
-    <CODE>false</CODE> otherwise.
-
-    \param c
-    The constraint to be decoded.
-
-    \param c_num_vars
-    If <CODE>true</CODE> is returned, then it will be set to the number
-    of variables having a non-zero coefficient. The only legal values
-    will therefore be 0, 1 and 2.
-
-    \param c_first_var
-    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
-    then it will be set to the index of the first variable having
-    a non-zero coefficient in \p c.
-
-    \param c_second_var
-    If <CODE>true</CODE> is returned and if \p c_num_vars is set to 2,
-    then it will be set to the index of the second variable having
-    a non-zero coefficient in \p c. If \p c_num_vars is set to 1, this must be
-    0.
-
-    \param c_coeff
-    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
-    then it will be set to the value of the first non-zero coefficient
-    in \p c.
-  */
-  #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  static bool extract_bounded_difference(const Constraint& c,
-                                         dimension_type& c_num_vars,
-                                         dimension_type& c_first_var,
-                                         dimension_type& c_second_var,
-                                         Coefficient& c_coeff);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Extracts leader indices from the predecessor relation.
-/*! \relates BD_Shape */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void compute_leader_indices(const std::vector<dimension_type>& predecessor,
-                            std::vector<dimension_type>& indices);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A bounded difference shape.
-/*! \ingroup PPL_CXX_interface
-  The class template BD_Shape<T> allows for the efficient representation
-  of a restricted kind of <EM>topologically closed</EM> convex polyhedra
-  called <EM>bounded difference shapes</EM> (BDSs, for short).
-  The name comes from the fact that the closed affine half-spaces that
-  characterize the polyhedron can be expressed by constraints of the form
-  \f$\pm x_i \leq k\f$ or \f$x_i - x_j \leq k\f$, where the inhomogeneous
-  term \f$k\f$ is a rational number.
-
-  Based on the class template type parameter \p T, a family of extended
-  numbers is built and used to approximate the inhomogeneous term of
-  bounded differences. These extended numbers provide a representation
-  for the value \f$+\infty\f$, as well as <EM>rounding-aware</EM>
-  implementations for several arithmetic functions.
-  The value of the type parameter \p T may be one of the following:
-    - a bounded precision integer type (e.g., \c int32_t or \c int64_t);
-    - a bounded precision floating point type (e.g., \c float or \c double);
-    - an unbounded integer or rational type, as provided by GMP
-      (i.e., \c mpz_class or \c mpq_class).
-
-  The user interface for BDSs is meant to be as similar as possible to
-  the one developed for the polyhedron class C_Polyhedron.
-
-  The domain of BD shapes <EM>optimally supports</EM>:
-    - tautological and inconsistent constraints and congruences;
-    - bounded difference constraints;
-    - non-proper congruences (i.e., equalities) that are expressible
-      as bounded-difference constraints.
-
-  Depending on the method, using a constraint or congruence that is not
-  optimally supported by the domain will either raise an exception or
-  result in a (possibly non-optimal) upward approximation.
-
-  A constraint is a bounded difference if it has the form
-    \f[
-      a_i x_i - a_j x_j \relsym b
-    \f]
-  where \f$\mathord{\relsym} \in \{ \leq, =, \geq \}\f$ and
-  \f$a_i\f$, \f$a_j\f$, \f$b\f$ are integer coefficients such that
-  \f$a_i = 0\f$, or \f$a_j = 0\f$, or \f$a_i = a_j\f$.
-  The user is warned that the above bounded difference Constraint object
-  will be mapped into a \e correct and \e optimal approximation that,
-  depending on the expressive power of the chosen template argument \p T,
-  may loose some precision. Also note that strict constraints are not
-  bounded differences.
-
-  For instance, a Constraint object encoding \f$3x - 3y \leq 1\f$ will be
-  approximated by:
-    - \f$x - y \leq 1\f$,
-      if \p T is a (bounded or unbounded) integer type;
-    - \f$x - y \leq \frac{1}{3}\f$,
-      if \p T is the unbounded rational type \c mpq_class;
-    - \f$x - y \leq k\f$, where \f$k > \frac{1}{3}\f$,
-      if \p T is a floating point type (having no exact representation
-      for \f$\frac{1}{3}\f$).
-
-  On the other hand, depending from the context, a Constraint object
-  encoding \f$3x - y \leq 1\f$ will be either upward approximated
-  (e.g., by safely ignoring it) or it will cause an exception.
-
-  In the following examples it is assumed that the type argument \p T
-  is one of the possible instances listed above and that variables
-  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE> are defined
-  (where they are used) as follows:
-  \code
-    Variable x(0);
-    Variable y(1);
-    Variable z(2);
-  \endcode
-
-  \par Example 1
-  The following code builds a BDS corresponding to a cube in \f$\Rset^3\f$,
-  given as a system of constraints:
-  \code
-    Constraint_System cs;
-    cs.insert(x >= 0);
-    cs.insert(x <= 1);
-    cs.insert(y >= 0);
-    cs.insert(y <= 1);
-    cs.insert(z >= 0);
-    cs.insert(z <= 1);
-    BD_Shape<T> bd(cs);
-  \endcode
-  Since only those constraints having the syntactic form of a
-  <EM>bounded difference</EM> are optimally supported, the following code
-  will throw an exception (caused by constraints 7, 8 and 9):
-  \code
-    Constraint_System cs;
-    cs.insert(x >= 0);
-    cs.insert(x <= 1);
-    cs.insert(y >= 0);
-    cs.insert(y <= 1);
-    cs.insert(z >= 0);
-    cs.insert(z <= 1);
-    cs.insert(x + y <= 0);      // 7
-    cs.insert(x - z + x >= 0);  // 8
-    cs.insert(3*z - y <= 1);    // 9
-    BD_Shape<T> bd(cs);
-  \endcode
-*/
-template <typename T>
-class Parma_Polyhedra_Library::BD_Shape {
-private:
-  /*! \brief
-    The (extended) numeric type of the inhomogeneous term of
-    the inequalities defining a BDS.
-  */
-#ifndef NDEBUG
-  typedef Checked_Number<T, Debug_WRD_Extended_Number_Policy> N;
-#else
-  typedef Checked_Number<T, WRD_Extended_Number_Policy> N;
-#endif
-
-public:
-  //! The numeric base type upon which bounded differences are built.
-  typedef T coefficient_type_base;
-
-  /*! \brief
-    The (extended) numeric type of the inhomogeneous term of the
-    inequalities defining a BDS.
-  */
-  typedef N coefficient_type;
-
-  //! Returns the maximum space dimension that a BDS can handle.
-  static dimension_type max_space_dimension();
-
-  /*! \brief
-    Returns \c false indicating that this domain cannot recycle constraints.
-  */
-  static bool can_recycle_constraint_systems();
-
-  /*! \brief
-    Returns \c false indicating that this domain cannot recycle congruences.
-  */
-  static bool can_recycle_congruence_systems();
-
-  //! \name Constructors, Assignment, Swap and Destructor
-  //@{
-
-  //! Builds a universe or empty BDS of the specified space dimension.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the BDS;
-
-    \param kind
-    Specifies whether the universe or the empty BDS has to be built.
-  */
-  explicit BD_Shape(dimension_type num_dimensions = 0,
-                    Degenerate_Element kind = UNIVERSE);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  BD_Shape(const BD_Shape& y,
-           Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a conservative, upward approximation of \p y.
-  /*!
-    The complexity argument is ignored.
-  */
-  template <typename U>
-  explicit BD_Shape(const BD_Shape<U>& y,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a BDS from the system of constraints \p cs.
-  /*!
-    The BDS inherits the space dimension of \p cs.
-
-    \param cs
-    A system of BD constraints.
-
-    \exception std::invalid_argument
-    Thrown if \p cs contains a constraint which is not optimally supported
-    by the BD shape domain.
-  */
-  explicit BD_Shape(const Constraint_System& cs);
-
-  //! Builds a BDS from a system of congruences.
-  /*!
-    The BDS inherits the space dimension of \p cgs
-
-    \param cgs
-    A system of congruences.
-
-    \exception std::invalid_argument
-    Thrown if \p cgs contains congruences which are not optimally
-    supported by the BD shape domain.
-  */
-  explicit BD_Shape(const Congruence_System& cgs);
-
-  //! Builds a BDS from the system of generators \p gs.
-  /*!
-    Builds the smallest BDS containing the polyhedron defined by \p gs.
-    The BDS inherits the space dimension of \p gs.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-  */
-  explicit BD_Shape(const Generator_System& gs);
-
-  //! Builds a BDS from the polyhedron \p ph.
-  /*!
-    Builds a BDS containing \p ph using algorithms whose complexity
-    does not exceed the one specified by \p complexity.  If
-    \p complexity is \p ANY_COMPLEXITY, then the BDS built is the
-    smallest one containing \p ph.
-  */
-  explicit BD_Shape(const Polyhedron& ph,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a BDS out of a box.
-  /*!
-    The BDS inherits the space dimension of the box.
-    The built BDS is the most precise BDS that includes the box.
-
-    \param box
-    The box representing the BDS to be built.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename Interval>
-  explicit BD_Shape(const Box<Interval>& box,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a BDS out of a grid.
-  /*!
-    The BDS inherits the space dimension of the grid.
-    The built BDS is the most precise BDS that includes the grid.
-
-    \param grid
-    The grid used to build the BDS.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p grid exceeds the maximum
-    allowed space dimension.
-  */
-  explicit BD_Shape(const Grid& grid,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a BDS from an octagonal shape.
-  /*!
-    The BDS inherits the space dimension of the octagonal shape.
-    The built BDS is the most precise BDS that includes the octagonal shape.
-
-    \param os
-    The octagonal shape used to build the BDS.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p os exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename U>
-  explicit BD_Shape(const Octagonal_Shape<U>& os,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator
-    (\p *this and \p y can be dimension-incompatible).
-  */
-  BD_Shape& operator=(const BD_Shape& y);
-
-  /*! \brief
-    Swaps \p *this with \p y
-    (\p *this and \p y can be dimension-incompatible).
-  */
-  void m_swap(BD_Shape& y);
-
-  //! Destructor.
-  ~BD_Shape();
-
-  //@} Constructors, Assignment, Swap and Destructor
-
-  //! \name Member Functions that Do Not Modify the BD_Shape
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
-    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
-    of \p *this.
-  */
-  dimension_type affine_dimension() const;
-
-  //! Returns a system of constraints defining \p *this.
-  Constraint_System constraints() const;
-
-  //! Returns a minimized system of constraints defining \p *this.
-  Constraint_System minimized_constraints() const;
-
-  //! Returns a system of (equality) congruences satisfied by \p *this.
-  Congruence_System congruences() const;
-
-  /*! \brief
-    Returns a minimal system of (equality) congruences
-    satisfied by \p *this with the same affine dimension as \p *this.
-  */
-  Congruence_System minimized_congruences() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from above in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from below in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
-    and \p maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value;
-
-    \param g
-    When maximization succeeds, will be assigned the point or
-    closure point where \p expr reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p g are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-                Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value;
-
-    \param g
-    When minimization succeeds, will be assigned a point or
-    closure point where \p expr reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p g are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-                Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if there exist a
-    unique value \p val such that \p *this
-    saturates the equality <CODE>expr = val</CODE>.
-
-    \param expr
-    The linear expression for which the frequency is needed;
-
-    \param freq_n
-    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
-    Present for interface compatibility with class Grid, where
-    the \ref Grid_Frequency "frequency" can have a non-zero value;
-
-    \param freq_d
-    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
-
-    \param val_n
-    The numerator of \p val;
-
-    \param val_d
-    The denominator of \p val;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
-    \p val_n and \p val_d are left untouched.
-  */
-  bool frequency(const Linear_Expression& expr,
-                 Coefficient& freq_n, Coefficient& freq_d,
-                 Coefficient& val_n, Coefficient& val_d) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool contains(const BD_Shape& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool strictly_contains(const BD_Shape& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool is_disjoint_from(const BD_Shape& y) const;
-
-  //! Returns the relations holding between \p *this and the constraint \p c.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  //! Returns the relations holding between \p *this and the congruence \p cg.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  //! Returns the relations holding between \p *this and the generator \p g.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  Poly_Gen_Relation relation_with(const Generator& g) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is an empty BDS.
-  bool is_empty() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a universe BDS.
-  bool is_universe() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
-  bool is_discrete() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a topologically closed subset of the vector space.
-  */
-  bool is_topologically_closed() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a bounded BDS.
-  bool is_bounded() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains at least one integer point.
-  */
-  bool contains_integer_point() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  bool constrains(Variable var) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this satisfies
-    all its invariants.
-  */
-  bool OK() const;
-
-  //@} Member Functions that Do Not Modify the BD_Shape
-
-  //! \name Space-Dimension Preserving Member Functions that May Modify the BD_Shape
-  //@{
-
-  /*! \brief
-    Adds a copy of constraint \p c to the system of bounded differences
-    defining \p *this.
-
-    \param c
-    The constraint to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible,
-    or \p c is not optimally supported by the BD shape domain.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds a copy of congruence \p cg to the system of congruences of \p *this.
-
-    \param cg
-    The congruence to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible,
-    or \p cg is not optimally supported by the BD shape domain.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of bounded differences
-    defining \p *this.
-
-    \param  cs
-    The constraints that will be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible,
-    or \p cs contains a constraint which is not optimally supported
-    by the BD shape domain.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of constraints
-    of \p *this.
-
-    \param cs
-    The constraint system to be added to \p *this.  The constraints in
-    \p cs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible,
-    or \p cs contains a constraint which is not optimally supported
-    by the BD shape domain.
-
-    \warning
-    The only assumption that can be made on \p cs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_constraints(Constraint_System& cs);
-
-  /*! \brief
-    Adds to \p *this constraints equivalent to the congruences in \p cgs.
-
-    \param cgs
-    Contains the congruences that will be added to the system of
-    constraints of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    or \p cgs contains a congruence which is not optimally supported
-    by the BD shape domain.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Adds to \p *this constraints equivalent to the congruences in \p cgs.
-
-    \param cgs
-    Contains the congruences that will be added to the system of
-    constraints of \p *this. Its elements may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    or \p cgs contains a congruence which is not optimally supported
-    by the BD shape domain.
-
-    \warning
-    The only assumption that can be made on \p cgs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_congruences(Congruence_System& cgs);
-
-  /*! \brief
-    Uses a copy of constraint \p c to refine the system of bounded differences
-    defining \p *this.
-
-    \param c
-    The constraint. If it is not a bounded difference, it will be ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  /*! \brief
-    Uses a copy of congruence \p cg to refine the system of
-    bounded differences  of \p *this.
-
-    \param cg
-    The congruence. If it is not a bounded difference equality, it
-    will be ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
-  /*! \brief
-    Uses a copy of the constraints in \p cs to refine the system of
-    bounded differences defining \p *this.
-
-    \param  cs
-    The constraint system to be used. Constraints that are not bounded
-    differences are ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Uses a copy of the congruences in \p cgs to refine the system of
-    bounded differences defining \p *this.
-
-    \param  cgs
-    The congruence system to be used. Congruences that are not bounded
-    difference equalities are ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Refines the system of BD_Shape constraints defining \p *this using
-    the constraint expressed by \p left \f$\leq\f$ \p right.
-
-    \param left
-    The linear form on intervals with floating point boundaries that
-    is at the left of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param right
-    The linear form on intervals with floating point boundaries that
-    is at the right of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \exception std::invalid_argument
-    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
-
-    This function is used in abstract interpretation to model a filter
-    that is generated by a comparison of two expressions that are correctly
-    approximated by \p left and \p right respectively.
-  */
-  template <typename Interval_Info>
-  void refine_with_linear_form_inequality(
-                   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
-
-  /*! \brief
-    Refines the system of BD_Shape constraints defining \p *this using
-    the constraint expressed by \p left \f$\relsym\f$ \p right, where
-    \f$\relsym\f$ is the relation symbol specified by \p relsym.
-
-    \param left
-    The linear form on intervals with floating point boundaries that
-    is at the left of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param right
-    The linear form on intervals with floating point boundaries that
-    is at the right of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param relsym
-    The relation symbol.
-
-    \exception std::invalid_argument
-    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
-
-    \exception std::runtime_error
-    Thrown if \p relsym is not a valid relation symbol.
-
-    This function is used in abstract interpretation to model a filter
-    that is generated by a comparison of two expressions that are correctly
-    approximated by \p left and \p right respectively.
-  */
-  template <typename Interval_Info>
-  void generalized_refine_with_linear_form_inequality(
-                   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right,
-                   Relation_Symbol relsym);
-
-  //! Applies to \p dest the interval constraints embedded in \p *this.
-  /*!
-    \param dest
-    The object to which the constraints will be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest.
-
-    The template type parameter U must provide the following methods.
-    \code
-      dimension_type space_dimension() const
-    \endcode
-    returns the space dimension of the object.
-    \code
-      void set_empty()
-    \endcode
-    sets the object to an empty object.
-    \code
-      bool restrict_lower(dimension_type dim, const T& lb)
-    \endcode
-    restricts the object by applying the lower bound \p lb to the space
-    dimension \p dim and returns <CODE>false</CODE> if and only if the
-    object becomes empty.
-    \code
-      bool restrict_upper(dimension_type dim, const T& ub)
-    \endcode
-    restricts the object by applying the upper bound \p ub to the space
-    dimension \p dim and returns <CODE>false</CODE> if and only if the
-    object becomes empty.
-  */
-  template <typename U>
-  void export_interval_constraints(U& dest) const;
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  //! Assigns to \p *this the intersection of \p *this and \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void intersection_assign(const BD_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this the smallest BDS containing the union
-    of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void upper_bound_assign(const BD_Shape& y);
-
-  /*! \brief
-    If the upper bound of \p *this and \p y is exact, it is assigned
-    to \p *this and <CODE>true</CODE> is returned,
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool upper_bound_assign_if_exact(const BD_Shape& y);
-
-  /*! \brief
-    If the \e integer upper bound of \p *this and \p y is exact,
-    it is assigned to \p *this and <CODE>true</CODE> is returned;
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \note
-    The integer upper bound of two rational BDS is the smallest rational
-    BDS containing all the integral points of the two arguments.
-    This method requires that the coefficient type parameter \c T is
-    an integral type.
-  */
-  bool integer_upper_bound_assign_if_exact(const BD_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this the smallest BD shape containing
-    the set difference of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void difference_assign(const BD_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this a \ref Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-    If \c false is returned, then the intersection is empty.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool simplify_using_context_assign(const BD_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine image"
-    of \p *this under the function mapping variable \p var into the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned.
-
-    \param expr
-    The numerator of the affine expression.
-
-    \param denominator
-    The denominator of the affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension of \p *this.
-  */
-  void affine_image(Variable var,
-                    const Linear_Expression& expr,
-                    Coefficient_traits::const_reference denominator
-                    = Coefficient_one());
-
-  // FIXME: To be completed.
-  /*! \brief
-    Assigns to \p *this the \ref affine_form_relation "affine form image"
-    of \p *this under the function mapping variable \p var into the
-    affine expression(s) specified by \p lf.
-
-    \param var
-    The variable to which the affine expression is assigned.
-
-    \param lf
-    The linear form on intervals with floating point coefficients that
-    defines the affine expression. ALL of its coefficients MUST be bounded.
-
-    \exception std::invalid_argument
-    Thrown if \p lf and \p *this are dimension-incompatible or if \p var
-    is not a dimension of \p *this.
-  */
-  template <typename Interval_Info>
-  void affine_form_image(Variable var,
-                        const Linear_Form<Interval<T, Interval_Info> >& lf);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine preimage"
-    of \p *this under the function mapping variable \p var into the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is substituted.
-
-    \param expr
-    The numerator of the affine expression.
-
-    \param denominator
-    The denominator of the affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension of \p *this.
-  */
-  void affine_preimage(Variable var,
-                       const Linear_Expression& expr,
-                       Coefficient_traits::const_reference denominator
-                       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine transfer function.
-
-    \param relsym
-    The relation symbol.
-
-    \param expr
-    The numerator of the right hand side affine expression.
-
-    \param denominator
-    The denominator of the right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension
-    of \p *this or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_image(Variable var,
-                                Relation_Symbol relsym,
-                                const Linear_Expression& expr,
-                                Coefficient_traits::const_reference denominator
-                                = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression.
-
-    \param relsym
-    The relation symbol.
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_image(const Linear_Expression& lhs,
-                                Relation_Symbol relsym,
-                                const Linear_Expression& rhs);
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine transfer function.
-
-    \param relsym
-    The relation symbol.
-
-    \param expr
-    The numerator of the right hand side affine expression.
-
-    \param denominator
-    The denominator of the right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension
-    of \p *this or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_preimage(Variable var,
-                                   Relation_Symbol relsym,
-                                   const Linear_Expression& expr,
-                                   Coefficient_traits::const_reference
-                                   denominator = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression.
-
-    \param relsym
-    The relation symbol.
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_preimage(const Linear_Expression& lhs,
-                                   Relation_Symbol relsym,
-                                   const Linear_Expression& rhs);
-
-  /*!
-    \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-                            const Linear_Expression& lb_expr,
-                            const Linear_Expression& ub_expr,
-                            Coefficient_traits::const_reference denominator
-                            = Coefficient_one());
-
-  /*!
-    \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-                               const Linear_Expression& lb_expr,
-                               const Linear_Expression& ub_expr,
-                               Coefficient_traits::const_reference denominator
-                               = Coefficient_one());
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void time_elapse_assign(const BD_Shape& y);
-
-  /*! \brief
-    \ref Wrapping_Operator "Wraps" the specified dimensions of the
-    vector space.
-
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be wrapped.
-
-    \param w
-    The width of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param r
-    The representation of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param o
-    The overflow behavior of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param cs_p
-    Possibly null pointer to a constraint system whose variables
-    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
-    variables not in \p vars, the behavior is undefined.
-    When non-null, the pointed-to constraint system is assumed to
-    represent the conditional or looping construct guard with respect
-    to which wrapping is performed.  Since wrapping requires the
-    computation of upper bounds and due to non-distributivity of
-    constraint refinement over upper bounds, passing a constraint
-    system in this way can be more precise than refining the result of
-    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
-
-    \param complexity_threshold
-    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
-    higher values result in possibly improved precision.
-
-    \param wrap_individually
-    <CODE>true</CODE> if the dimensions should be wrapped individually
-    (something that results in much greater efficiency to the detriment of
-    precision).
-
-    \exception std::invalid_argument
-    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
-    \p vars, or if \p *this is dimension-incompatible \p vars or with
-    <CODE>*cs_p</CODE>.
-  */
-  void wrap_assign(const Variables_Set& vars,
-                   Bounded_Integer_Type_Width w,
-                   Bounded_Integer_Type_Representation r,
-                   Bounded_Integer_Type_Overflow o,
-                   const Constraint_System* cs_p = 0,
-                   unsigned complexity_threshold = 16,
-                   bool wrap_individually = true);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void CC76_extrapolation_assign(const BD_Shape& y, unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param first
-    An iterator referencing the first stop-point.
-
-    \param last
-    An iterator referencing one past the last stop-point.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  template <typename Iterator>
-  void CC76_extrapolation_assign(const BD_Shape& y,
-                                 Iterator first, Iterator last,
-                                 unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref BHMZ05_widening "BHMZ05-widening" of \p *this and \p y.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void BHMZ05_widening_assign(const BD_Shape& y, unsigned* tp = 0);
-
-  /*! \brief
-    Improves the result of the \ref BHMZ05_widening "BHMZ05-widening"
-    computation by also enforcing those constraints in \p cs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param cs
-    The system of constraints used to improve the widened BDS.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
-    if \p cs contains a strict inequality.
-  */
-  void limited_BHMZ05_extrapolation_assign(const BD_Shape& y,
-                                           const Constraint_System& cs,
-                                           unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of restoring in \p y the constraints
-    of \p *this that were lost by
-    \ref CC76_extrapolation "CC76-extrapolation" applications.
-
-    \param y
-    A BDS that <EM>must</EM> contain \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \note
-    As was the case for widening operators, the argument \p y is meant to
-    denote the value computed in the previous iteration step, whereas
-    \p *this denotes the value computed in the current iteration step
-    (in the <EM>decreasing</EM> iteration sequence). Hence, the call
-    <CODE>x.CC76_narrowing_assign(y)</CODE> will assign to \p x
-    the result of the computation \f$\mathtt{y} \Delta \mathtt{x}\f$.
-  */
-  void CC76_narrowing_assign(const BD_Shape& y);
-
-  /*! \brief
-    Improves the result of the \ref CC76_extrapolation "CC76-extrapolation"
-    computation by also enforcing those constraints in \p cs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param cs
-    The system of constraints used to improve the widened BDS.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
-    if \p cs contains a strict inequality.
-  */
-  void limited_CC76_extrapolation_assign(const BD_Shape& y,
-                                         const Constraint_System& cs,
-                                         unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref H79_widening "H79-widening" between \p *this and \p y.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void H79_widening_assign(const BD_Shape& y, unsigned* tp = 0);
-
-  //! Same as H79_widening_assign(y, tp).
-  void widening_assign(const BD_Shape& y, unsigned* tp = 0);
-
-  /*! \brief
-    Improves the result of the \ref H79_widening "H79-widening"
-    computation by also enforcing those constraints in \p cs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    A BDS that <EM>must</EM> be contained in \p *this.
-
-    \param cs
-    The system of constraints used to improve the widened BDS.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are dimension-incompatible.
-  */
-  void limited_H79_extrapolation_assign(const BD_Shape& y,
-                                        const Constraint_System& cs,
-                                        unsigned* tp = 0);
-
-  //@} Space-Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  //! Adds \p m new dimensions and embeds the old BDS into the new space.
-  /*!
-    \param m
-    The number of dimensions to add.
-
-    The new dimensions will be those having the highest indexes in the new
-    BDS, which is defined by a system of bounded differences in which the
-    variables running through the new dimensions are unconstrained.
-    For instance, when starting from the BDS \f$\cB \sseq \Rset^2\f$
-    and adding a third dimension, the result will be the BDS
-    \f[
-      \bigl\{\,
-        (x, y, z)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cB
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Adds \p m new dimensions to the BDS and does not embed it in
-    the new vector space.
-
-    \param m
-    The number of dimensions to add.
-
-    The new dimensions will be those having the highest indexes in the
-    new BDS, which is defined by a system of bounded differences in
-    which the variables running through the new dimensions are all
-    constrained to be equal to 0.
-    For instance, when starting from the BDS \f$\cB \sseq \Rset^2\f$
-    and adding a third dimension, the result will be the BDS
-    \f[
-      \bigl\{\,
-        (x, y, 0)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cB
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  /*! \brief
-    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
-    of \p *this and \p y, taken in this order.
-
-    \exception std::length_error
-    Thrown if the concatenation would cause the vector space
-    to exceed dimension <CODE>max_space_dimension()</CODE>.
-  */
-  void concatenate_assign(const BD_Shape& y);
-
-  //! Removes all the specified dimensions.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the dimensions to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the Variable
-    objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher dimensions so that the resulting space
-    will have dimension \p new_dimension.
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimension is greater than the space dimension
-    of \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
-
-    \param pfunc
-    The partial function specifying the destiny of each dimension.
-
-    The template type parameter Partial_Function must provide
-    the following methods.
-    \code
-      bool has_empty_codomain() const
-    \endcode
-    returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty co-domain (i.e., it is always undefined).
-    The <CODE>has_empty_codomain()</CODE> method will always be called
-    before the methods below.  However, if
-    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
-    of the functions below will be called.
-    \code
-      dimension_type max_in_codomain() const
-    \endcode
-    returns the maximum value that belongs to the co-domain
-    of the partial function.
-    \code
-      bool maps(dimension_type i, dimension_type& j) const
-    \endcode
-    Let \f$f\f$ be the represented function and \f$k\f$ be the value
-    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
-    assigned to \p j and <CODE>true</CODE> is returned.
-    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
-    returned.
-
-    The result is undefined if \p pfunc does not encode a partial
-    function with the properties described in the
-    \ref Mapping_the_Dimensions_of_the_Vector_Space
-    "specification of the mapping operator".
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref expand_space_dimension "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.
-    Also thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are \ref fold_space_dimensions "folded"
-    into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //! Refines \p store with the constraints defining \p *this.
-  /*!
-    \param store
-    The interval floating point abstract store to refine.
-  */
-  template <typename Interval_Info>
-  void refine_fp_interval_abstract_store(Box<Interval<T, Interval_Info> >&
-                                         store) const;
-
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If \p x and \p y are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  friend bool operator==<T>(const BD_Shape<T>& x, const BD_Shape<T>& y);
-
-  template <typename Temp, typename To, typename U>
-  friend bool Parma_Polyhedra_Library::rectilinear_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const BD_Shape<U>& x, const BD_Shape<U>& y, const Rounding_Dir dir,
-   Temp& tmp0, Temp& tmp1, Temp& tmp2);
-  template <typename Temp, typename To, typename U>
-  friend bool Parma_Polyhedra_Library::euclidean_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const BD_Shape<U>& x, const BD_Shape<U>& y, const Rounding_Dir dir,
-   Temp& tmp0, Temp& tmp1, Temp& tmp2);
-  template <typename Temp, typename To, typename U>
-  friend bool Parma_Polyhedra_Library::l_infinity_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const BD_Shape<U>& x, const BD_Shape<U>& y, const Rounding_Dir dir,
-   Temp& tmp0, Temp& tmp1, Temp& tmp2);
-
-private:
-  template <typename U> friend class Parma_Polyhedra_Library::BD_Shape;
-  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
-
-  //! The matrix representing the system of bounded differences.
-  DB_Matrix<N> dbm;
-
-#define PPL_IN_BD_Shape_CLASS
-#include "BDS_Status.idefs.hh"
-#undef PPL_IN_BD_Shape_CLASS
-
-  //! The status flags to keep track of the internal state.
-  Status status;
-
-  //! A matrix indicating which constraints are redundant.
-  Bit_Matrix redundancy_dbm;
-
-  //! Returns <CODE>true</CODE> if the BDS is the zero-dimensional universe.
-  bool marked_zero_dim_univ() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the BDS is known to be empty.
-
-    The return value <CODE>false</CODE> does not necessarily
-    implies that \p *this is non-empty.
-  */
-  bool marked_empty() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the system of bounded differences
-    is known to be shortest-path closed.
-
-    The return value <CODE>false</CODE> does not necessarily
-    implies that <CODE>this->dbm</CODE> is not shortest-path closed.
-  */
-  bool marked_shortest_path_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the system of bounded differences
-    is known to be shortest-path reduced.
-
-    The return value <CODE>false</CODE> does not necessarily
-    implies that <CODE>this->dbm</CODE> is not shortest-path reduced.
-  */
-  bool marked_shortest_path_reduced() const;
-
-  //! Turns \p *this into an empty BDS.
-  void set_empty();
-
-  //! Turns \p *this into an zero-dimensional universe BDS.
-  void set_zero_dim_univ();
-
-  //! Marks \p *this as shortest-path closed.
-  void set_shortest_path_closed();
-
-  //! Marks \p *this as shortest-path closed.
-  void set_shortest_path_reduced();
-
-  //! Marks \p *this as possibly not shortest-path closed.
-  void reset_shortest_path_closed();
-
-  //! Marks \p *this as possibly not shortest-path reduced.
-  void reset_shortest_path_reduced();
-
-  //! Assigns to <CODE>this->dbm</CODE> its shortest-path closure.
-  void shortest_path_closure_assign() const;
-
-  /*! \brief
-    Assigns to <CODE>this->dbm</CODE> its shortest-path closure and
-    records into <CODE>this->redundancy_dbm</CODE> which of the entries
-    in <CODE>this->dbm</CODE> are redundant.
-  */
-  void shortest_path_reduction_assign() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if <CODE>this->dbm</CODE>
-    is shortest-path closed and <CODE>this->redundancy_dbm</CODE>
-    correctly flags the redundant entries in <CODE>this->dbm</CODE>.
-  */
-  bool is_shortest_path_reduced() const;
-
-  /*! \brief
-    Incrementally computes shortest-path closure, assuming that only
-    constraints affecting variable \p var need to be considered.
-
-    \note
-    It is assumed that \c *this, which was shortest-path closed,
-    has only been modified by adding constraints affecting variable
-    \p var. If this assumption is not satisfied, i.e., if a non-redundant
-    constraint not affecting variable \p var has been added, the behavior
-    is undefined.
-  */
-  void incremental_shortest_path_closure_assign(Variable var) const;
-
-  //! Checks if and how \p expr is bounded in \p *this.
-  /*!
-    Returns <CODE>true</CODE> if and only if \p from_above is
-    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
-    or \p from_above is <CODE>false</CODE> and \p expr is bounded
-    from below in \p *this.
-
-    \param expr
-    The linear expression to test;
-
-    \param from_above
-    <CODE>true</CODE> if and only if the boundedness of interest is
-    "from above".
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds(const Linear_Expression& expr, bool from_above) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p
-    *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p * this;
-
-    \param g
-    When maximization or minimization succeeds, will be assigned
-    a point or closure point where \p expr reaches the
-    corresponding extremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p g are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-               bool maximize,
-               Coefficient& ext_n, Coefficient& ext_d, bool& included,
-               Generator& g) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p
-    *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p * this;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p point are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-               bool maximize,
-               Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
-
-  /*! \brief
-    If the upper bound of \p *this and \p y is exact it is assigned
-    to \p *this and \c true is returned, otherwise \c false is returned.
-
-    Current implementation is based on a variant of Algorithm 4.1 in
-      A. Bemporad, K. Fukuda, and F. D. Torrisi
-      <em>Convexity Recognition of the Union of Polyhedra</em>
-      Technical Report AUT00-13, ETH Zurich, 2000
-    tailored to the special case of BD shapes.
-
-    \note
-    It is assumed that \p *this and \p y are dimension-compatible;
-    if the assumption does not hold, the behavior is undefined.
-  */
-  bool BFT00_upper_bound_assign_if_exact(const BD_Shape& y);
-
-  /*! \brief
-    If the upper bound of \p *this and \p y is exact it is assigned
-    to \p *this and \c true is returned, otherwise \c false is returned.
-
-    Implementation for the rational (resp., integer) case is based on
-    Theorem 5.2 (resp. Theorem 5.3) of \ref BHZ09b "[BHZ09b]".
-    The Boolean template parameter \c integer_upper_bound allows for
-    choosing between the rational and integer upper bound algorithms.
-
-    \note
-    It is assumed that \p *this and \p y are dimension-compatible;
-    if the assumption does not hold, the behavior is undefined.
-
-    \note
-    The integer case is only enabled if T is an integer data type.
-  */
-  template <bool integer_upper_bound>
-  bool BHZ09_upper_bound_assign_if_exact(const BD_Shape& y);
-
-  /*! \brief
-    Uses the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be added. Non BD constraints are ignored.
-
-    \warning
-    If \p c and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Constraint& c);
-
-  /*! \brief
-    Uses the congruence \p cg to refine \p *this.
-
-    \param cg
-    The congruence to be added.
-    Nontrivial proper congruences are ignored.
-    Non BD equalities are ignored.
-
-    \warning
-    If \p cg and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Congruence& cg);
-
-  //! Adds the constraint <CODE>dbm[i][j] \<= k</CODE>.
-  void add_dbm_constraint(dimension_type i, dimension_type j, const N& k);
-
-  //! Adds the constraint <CODE>dbm[i][j] \<= numer/denom</CODE>.
-  void add_dbm_constraint(dimension_type i, dimension_type j,
-                          Coefficient_traits::const_reference numer,
-                          Coefficient_traits::const_reference denom);
-
-  /*! \brief
-    Adds to the BDS the constraint
-    \f$\mathrm{var} \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$.
-
-    Note that the coefficient of \p var in \p expr is null.
-  */
-  void refine(Variable var, Relation_Symbol relsym,
-              const Linear_Expression& expr,
-              Coefficient_traits::const_reference denominator
-              = Coefficient_one());
-
-  //! Removes all the constraints on row/column \p v.
-  void forget_all_dbm_constraints(dimension_type v);
-  //! Removes all binary constraints on row/column \p v.
-  void forget_binary_dbm_constraints(dimension_type v);
-
-  //! An helper function for the computation of affine relations.
-  /*!
-    For each dbm index \p u (less than or equal to \p last_v and different
-    from \p v), deduce constraints of the form <CODE>v - u \<= c</CODE>,
-    starting from \p ub_v which is an upper bound for \p v.
-
-    The shortest-path closure is able to deduce the constraint
-    <CODE>v - u \<= ub_v - lb_u</CODE>. We can be more precise if variable
-    \p u played an active role in the computation of the upper bound for
-    \p v, i.e., if the corresponding coefficient
-    <CODE>q == sc_expr[u]/sc_denom</CODE> is greater than zero. In particular:
-      - if <CODE>q \>= 1</CODE>, then <CODE>v - u \<= ub_v - ub_u</CODE>;
-      - if <CODE>0 \< q \< 1</CODE>, then
-        <CODE>v - u \<= ub_v - (q*ub_u + (1-q)*lb_u)</CODE>.
-  */
-  void deduce_v_minus_u_bounds(dimension_type v,
-                               dimension_type last_v,
-                               const Linear_Expression& sc_expr,
-                               Coefficient_traits::const_reference sc_denom,
-                               const N& ub_v);
-
-  /* \brief
-    Auxiliary function for \ref affine_form_relation "affine form image" that
-    handle the general case: \f$l \equal c\f$
-  */
-  template <typename Interval_Info>
-  void inhomogeneous_affine_form_image(const dimension_type& var_id,
-				                       const Interval<T, Interval_Info>& b);
-
-  /* \brief
-    Auxiliary function for \ref affine_form_relation "affine form image" that
-    handle the general case: \f$l \equal ax + c\f$
-  */
-  template <typename Interval_Info>
-  void one_variable_affine_form_image(const dimension_type& var_id,
-                               const Interval<T, Interval_Info>& b,
-                               const Interval<T, Interval_Info>& w_coeff,
-                               const dimension_type& w_id,
-                               const dimension_type& space_dim);
-
-  /* \brief
-    Auxiliary function for \ref affine_form_relation "affine form image" that
-    handle the general case: \f$l \equal ax + by + c\f$
-  */
-  template <typename Interval_Info>
-  void two_variables_affine_form_image(const dimension_type& var_id,
-                 const Linear_Form<Interval<T,Interval_Info> >& lf,
-                                   const dimension_type& space_dim);
-
-  /* \brief
-    Auxiliary function for refine with linear form that handle
-    the general case: \f$l \equal ax + c\f$
-  */
-  template <typename Interval_Info>
-  void left_inhomogeneous_refine(const dimension_type& right_t,
-				 const dimension_type& right_w_id,
-		   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
-
-  /* \brief
-    Auxiliary function for refine with linear form that handle
-    the general case: \f$ax +b \equal cy + d\f$
-  */
-  template <typename Interval_Info>
-  void left_one_var_refine(const dimension_type& left_w_id,
-			   const dimension_type& right_t,
-			   const dimension_type& right_w_id,
-		   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
-
-/* \brief
-    Auxiliary function for refine with linear form that handle
-    the general case.
-  */
-  template <typename Interval_Info>
-  void general_refine(const dimension_type& left_w_id,
-			   const dimension_type& right_w_id,
-		   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
-
-  template <typename Interval_Info>
-  void linear_form_upper_bound(const Linear_Form<Interval<T, Interval_Info> >&
-                               lf,
-                               N& result) const;
-
-  //! An helper function for the computation of affine relations.
-  /*!
-    For each dbm index \p u (less than or equal to \p last_v and different
-    from \p v), deduce constraints of the form <CODE>u - v \<= c</CODE>,
-    starting from \p minus_lb_v which is a lower bound for \p v.
-
-    The shortest-path closure is able to deduce the constraint
-    <CODE>u - v \<= ub_u - lb_v</CODE>. We can be more precise if variable
-    \p u played an active role in the computation of the lower bound for
-    \p v, i.e., if the corresponding coefficient
-    <CODE>q == sc_expr[u]/sc_denom</CODE> is greater than zero.
-    In particular:
-      - if <CODE>q \>= 1</CODE>, then <CODE>u - v \<= lb_u - lb_v</CODE>;
-      - if <CODE>0 \< q \< 1</CODE>, then
-        <CODE>u - v \<= (q*lb_u + (1-q)*ub_u) - lb_v</CODE>.
-  */
-  void deduce_u_minus_v_bounds(dimension_type v,
-                               dimension_type last_v,
-                               const Linear_Expression& sc_expr,
-                               Coefficient_traits::const_reference sc_denom,
-                               const N& minus_lb_v);
-
-  /*! \brief
-    Adds to \p limiting_shape the bounded differences in \p cs
-    that are satisfied by \p *this.
-  */
-  void get_limiting_shape(const Constraint_System& cs,
-                          BD_Shape& limiting_shape) const;
-
-  //! Compute the (zero-equivalence classes) predecessor relation.
-  /*!
-    It is assumed that the BDS is not empty and shortest-path closed.
-  */
-  void compute_predecessors(std::vector<dimension_type>& predecessor) const;
-
-  //! Compute the leaders of zero-equivalence classes.
-  /*!
-    It is assumed that the BDS is not empty and shortest-path closed.
-  */
-  void compute_leaders(std::vector<dimension_type>& leaders) const;
-
-  void drop_some_non_integer_points_helper(N& elem);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators
-  ::operator<<<>(std::ostream& s, const BD_Shape<T>& c);
-
-  //! \name Exception Throwers
-  //@{
-  void throw_dimension_incompatible(const char* method,
-                                    const BD_Shape& y) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    dimension_type required_dim) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const Constraint& c) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const Congruence& cg) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const Generator& g) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const char* le_name,
-                                    const Linear_Expression& le) const;
-
-  template<typename Interval_Info>
-  void
-  throw_dimension_incompatible(const char* method,
-                               const char* lf_name,
-                               const Linear_Form<Interval<T, Interval_Info> >&
-                               lf) const;
-
-  static void throw_expression_too_complex(const char* method,
-                                           const Linear_Expression& le);
-
-  static void throw_invalid_argument(const char* method, const char* reason);
-  //@} // Exception Throwers
-};
-
-#include "BDS_Status.inlines.hh"
-#include "BD_Shape.inlines.hh"
-#include "BD_Shape.templates.hh"
-
-#endif // !defined(PPL_BD_Shape_defs_hh)
diff --git a/src/BD_Shape.inlines.hh b/src/BD_Shape.inlines.hh
deleted file mode 100644
index cfbd4df..0000000
--- a/src/BD_Shape.inlines.hh
+++ /dev/null
@@ -1,910 +0,0 @@
-/* BD_Shape class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BD_Shape_inlines_hh
-#define PPL_BD_Shape_inlines_hh 1
-
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "C_Polyhedron.defs.hh"
-#include "Grid.defs.hh"
-#include "Octagonal_Shape.defs.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "Temp.defs.hh"
-#include "meta_programming.hh"
-#include "wrap_assign.hh"
-#include "assert.hh"
-#include <vector>
-#include <iostream>
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline dimension_type
-BD_Shape<T>::max_space_dimension() {
-  // One dimension is reserved to have a value of type dimension_type
-  // that does not represent a legal dimension.
-  return std::min(DB_Matrix<N>::max_num_rows() - 1,
-		  DB_Matrix<N>::max_num_columns() - 1);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::marked_zero_dim_univ() const {
-  return status.test_zero_dim_univ();
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::marked_empty() const {
-  return status.test_empty();
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::marked_shortest_path_closed() const {
-  return status.test_shortest_path_closed();
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::marked_shortest_path_reduced() const {
-  return status.test_shortest_path_reduced();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::set_zero_dim_univ() {
-  status.set_zero_dim_univ();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::set_empty() {
-  status.set_empty();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::set_shortest_path_closed() {
-  status.set_shortest_path_closed();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::set_shortest_path_reduced() {
-  status.set_shortest_path_reduced();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::reset_shortest_path_closed() {
-  status.reset_shortest_path_closed();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::reset_shortest_path_reduced() {
-  status.reset_shortest_path_reduced();
-}
-
-template <typename T>
-inline
-BD_Shape<T>::BD_Shape(const dimension_type num_dimensions,
-		      const Degenerate_Element kind)
-  : dbm(num_dimensions + 1), status(), redundancy_dbm() {
-  if (kind == EMPTY)
-    set_empty();
-  else {
-    if (num_dimensions > 0)
-      // A (non zero-dim) universe BDS is closed.
-      set_shortest_path_closed();
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline
-BD_Shape<T>::BD_Shape(const BD_Shape& y, Complexity_Class)
-  : dbm(y.dbm), status(y.status), redundancy_dbm() {
-  if (y.marked_shortest_path_reduced())
-    redundancy_dbm = y.redundancy_dbm;
-}
-
-template <typename T>
-template <typename U>
-inline
-BD_Shape<T>::BD_Shape(const BD_Shape<U>& y, Complexity_Class)
-  // For maximum precision, enforce shortest-path closure
-  // before copying the DB matrix.
-  : dbm((y.shortest_path_closure_assign(), y.dbm)),
-    status(),
-    redundancy_dbm() {
-  // TODO: handle flags properly, possibly taking special cases into account.
-  if (y.marked_empty())
-    set_empty();
-  else if (y.marked_zero_dim_univ())
-    set_zero_dim_univ();
-}
-
-template <typename T>
-inline Congruence_System
-BD_Shape<T>::congruences() const {
-  return minimized_congruences();
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::add_constraints(const Constraint_System& cs) {
-  for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
-    add_constraint(*i);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::add_recycled_constraints(Constraint_System& cs) {
-  add_constraints(cs);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::add_congruences(const Congruence_System& cgs) {
-  for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i)
-    add_congruence(*i);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::add_recycled_congruences(Congruence_System& cgs) {
-  add_congruences(cgs);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::refine_with_constraint(const Constraint& c) {
-  const dimension_type c_space_dim = c.space_dimension();
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dimension())
-    throw_dimension_incompatible("refine_with_constraint(c)", c);
-
-  if (!marked_empty())
-    refine_no_check(c);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::refine_with_constraints(const Constraint_System& cs) {
-  // Dimension-compatibility check.
-  if (cs.space_dimension() > space_dimension())
-    throw_invalid_argument("refine_with_constraints(cs)",
-                           "cs and *this are space-dimension incompatible");
-
-  for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
-    refine_no_check(*i);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::refine_with_congruence(const Congruence& cg) {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  // Dimension-compatibility check.
-  if (cg_space_dim > space_dimension())
-    throw_dimension_incompatible("refine_with_congruence(cg)", cg);
-
-  if (!marked_empty())
-    refine_no_check(cg);
-}
-
-template <typename T>
-void
-BD_Shape<T>::refine_with_congruences(const Congruence_System& cgs) {
-  // Dimension-compatibility check.
-  if (cgs.space_dimension() > space_dimension())
-    throw_invalid_argument("refine_with_congruences(cgs)",
-                           "cgs and *this are space-dimension incompatible");
-
-  for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
-    refine_no_check(*i);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::refine_no_check(const Congruence& cg) {
-  PPL_ASSERT(!marked_empty());
-  PPL_ASSERT(cg.space_dimension() <= space_dimension());
-
-  if (cg.is_proper_congruence()) {
-    if (cg.is_inconsistent())
-      set_empty();
-    // Other proper congruences are just ignored.
-    return;
-  }
-
-  PPL_ASSERT(cg.is_equality());
-  Constraint c(cg);
-  refine_no_check(c);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::can_recycle_constraint_systems() {
-  return false;
-}
-
-
-template <typename T>
-inline bool
-BD_Shape<T>::can_recycle_congruence_systems() {
-  return false;
-}
-
-template <typename T>
-inline
-BD_Shape<T>::BD_Shape(const Constraint_System& cs)
-  : dbm(cs.space_dimension() + 1), status(), redundancy_dbm() {
-  if (cs.space_dimension() > 0)
-    // A (non zero-dim) universe BDS is shortest-path closed.
-    set_shortest_path_closed();
-  add_constraints(cs);
-}
-
-template <typename T>
-template <typename Interval>
-inline
-BD_Shape<T>::BD_Shape(const Box<Interval>& box,
-                      Complexity_Class)
-  : dbm(box.space_dimension() + 1), status(), redundancy_dbm() {
-  // Check emptiness for maximum precision.
-  if (box.is_empty())
-    set_empty();
-  else if (box.space_dimension() > 0) {
-    // A (non zero-dim) universe BDS is shortest-path closed.
-    set_shortest_path_closed();
-    refine_with_constraints(box.constraints());
-  }
-}
-
-template <typename T>
-inline
-BD_Shape<T>::BD_Shape(const Grid& grid,
-                      Complexity_Class)
-  : dbm(grid.space_dimension() + 1), status(), redundancy_dbm() {
-  if (grid.space_dimension() > 0)
-    // A (non zero-dim) universe BDS is shortest-path closed.
-    set_shortest_path_closed();
-  // Taking minimized congruences ensures maximum precision.
-  refine_with_congruences(grid.minimized_congruences());
-}
-
-template <typename T>
-template <typename U>
-inline
-BD_Shape<T>::BD_Shape(const Octagonal_Shape<U>& os,
-                      Complexity_Class)
-  : dbm(os.space_dimension() + 1), status(), redundancy_dbm() {
-  // Check for emptiness for maximum precision.
-  if (os.is_empty())
-    set_empty();
-  else if (os.space_dimension() > 0) {
-    // A (non zero-dim) universe BDS is shortest-path closed.
-    set_shortest_path_closed();
-    refine_with_constraints(os.constraints());
-    // After refining, shortest-path closure is possibly lost
-    // (even when `os' was strongly closed: recall that U
-    // is possibly different from T).
-  }
-}
-
-template <typename T>
-inline BD_Shape<T>&
-BD_Shape<T>::operator=(const BD_Shape& y) {
-  dbm = y.dbm;
-  status = y.status;
-  if (y.marked_shortest_path_reduced())
-    redundancy_dbm = y.redundancy_dbm;
-  return *this;
-}
-
-template <typename T>
-inline
-BD_Shape<T>::~BD_Shape() {
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::m_swap(BD_Shape& y) {
-  using std::swap;
-  swap(dbm, y.dbm);
-  swap(status, y.status);
-  swap(redundancy_dbm, y.redundancy_dbm);
-}
-
-template <typename T>
-inline dimension_type
-BD_Shape<T>::space_dimension() const {
-  return dbm.num_rows() - 1;
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::is_empty() const {
-  shortest_path_closure_assign();
-  return marked_empty();
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::bounds_from_above(const Linear_Expression& expr) const {
-  return bounds(expr, true);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::bounds_from_below(const Linear_Expression& expr) const {
-  return bounds(expr, false);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::maximize(const Linear_Expression& expr,
-		      Coefficient& sup_n, Coefficient& sup_d,
-		      bool& maximum) const {
-  return max_min(expr, true, sup_n, sup_d, maximum);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::maximize(const Linear_Expression& expr,
-		      Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		      Generator& g) const {
-  return max_min(expr, true, sup_n, sup_d, maximum, g);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::minimize(const Linear_Expression& expr,
-		      Coefficient& inf_n, Coefficient& inf_d,
-		      bool& minimum) const {
-  return max_min(expr, false, inf_n, inf_d, minimum);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::minimize(const Linear_Expression& expr,
-		      Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		      Generator& g) const {
-  return max_min(expr, false, inf_n, inf_d, minimum, g);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::is_topologically_closed() const {
-  return true;
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::is_discrete() const {
-  return affine_dimension() == 0;
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::topological_closure_assign() {
-}
-
-/*! \relates BD_Shape */
-template <typename T>
-inline bool
-operator==(const BD_Shape<T>& x, const BD_Shape<T>& y) {
-  const dimension_type x_space_dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  // Zero-dim BDSs are equal if and only if they are both empty or universe.
-  if (x_space_dim == 0) {
-    if (x.marked_empty())
-      return y.marked_empty();
-    else
-      return !y.marked_empty();
-  }
-
-  // The exact equivalence test requires shortest-path closure.
-  x.shortest_path_closure_assign();
-  y.shortest_path_closure_assign();
-
-  // If one of two BDSs is empty, then they are equal
-  // if and only if the other BDS is empty too.
-  if (x.marked_empty())
-    return y.marked_empty();
-  if (y.marked_empty())
-    return false;
-  // Check for syntactic equivalence of the two (shortest-path closed)
-  // systems of bounded differences.
-  return x.dbm == y.dbm;
-}
-
-/*! \relates BD_Shape */
-template <typename T>
-inline bool
-operator!=(const BD_Shape<T>& x, const BD_Shape<T>& y) {
-  return !(x == y);
-}
-
-/*! \relates BD_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const BD_Shape<T>& x,
-			    const BD_Shape<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
-  const dimension_type x_space_dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  // Zero-dim BDSs are equal if and only if they are both empty or universe.
-  if (x_space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires shortest-path closure.
-  x.shortest_path_closure_assign();
-  y.shortest_path_closure_assign();
-
-  // If one of two BDSs is empty, then they are equal if and only if
-  // the other BDS is empty too.
-  if (x.marked_empty() ||  y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  return rectilinear_distance_assign(r, x.dbm, y.dbm, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates BD_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const BD_Shape<T>& x,
-			    const BD_Shape<T>& y,
-			    const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates BD_Shape */
-template <typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const BD_Shape<T>& x,
-			    const BD_Shape<T>& y,
-			    const Rounding_Dir dir) {
-  return rectilinear_distance_assign<To, To, T>(r, x, y, dir);
-}
-
-/*! \relates BD_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const BD_Shape<T>& x,
-			  const BD_Shape<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
-  const dimension_type x_space_dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  // Zero-dim BDSs are equal if and only if they are both empty or universe.
-  if (x_space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires shortest-path closure.
-  x.shortest_path_closure_assign();
-  y.shortest_path_closure_assign();
-
-  // If one of two BDSs is empty, then they are equal if and only if
-  // the other BDS is empty too.
-  if (x.marked_empty() ||  y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  return euclidean_distance_assign(r, x.dbm, y.dbm, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates BD_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const BD_Shape<T>& x,
-			  const BD_Shape<T>& y,
-			  const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates BD_Shape */
-template <typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const BD_Shape<T>& x,
-			  const BD_Shape<T>& y,
-			  const Rounding_Dir dir) {
-  return euclidean_distance_assign<To, To, T>(r, x, y, dir);
-}
-
-/*! \relates BD_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const BD_Shape<T>& x,
-			   const BD_Shape<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
-  const dimension_type x_space_dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  // Zero-dim BDSs are equal if and only if they are both empty or universe.
-  if (x_space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires shortest-path closure.
-  x.shortest_path_closure_assign();
-  y.shortest_path_closure_assign();
-
-  // If one of two BDSs is empty, then they are equal if and only if
-  // the other BDS is empty too.
-  if (x.marked_empty() ||  y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  return l_infinity_distance_assign(r, x.dbm, y.dbm, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates BD_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const BD_Shape<T>& x,
-			   const BD_Shape<T>& y,
-			   const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates BD_Shape */
-template <typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const BD_Shape<T>& x,
-			   const BD_Shape<T>& y,
-			   const Rounding_Dir dir) {
-  return l_infinity_distance_assign<To, To, T>(r, x, y, dir);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::add_dbm_constraint(const dimension_type i,
-				const dimension_type j,
-				const N& k) {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(i <= space_dimension() && j <= space_dimension() && i != j);
-  N& dbm_ij = dbm[i][j];
-  if (dbm_ij > k) {
-    dbm_ij = k;
-    if (marked_shortest_path_closed())
-      reset_shortest_path_closed();
-  }
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::add_dbm_constraint(const dimension_type i,
-				const dimension_type j,
-				Coefficient_traits::const_reference numer,
-				Coefficient_traits::const_reference denom) {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(i <= space_dimension() && j <= space_dimension() && i != j);
-  PPL_ASSERT(denom != 0);
-  PPL_DIRTY_TEMP(N, k);
-  div_round_up(k, numer, denom);
-  add_dbm_constraint(i, j, k);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::time_elapse_assign(const BD_Shape& y) {
-  // Dimension-compatibility check.
-  if (space_dimension() != y.space_dimension())
-    throw_dimension_incompatible("time_elapse_assign(y)", y);
-  // Compute time-elapse on polyhedra.
-  // TODO: provide a direct implementation.
-  C_Polyhedron ph_x(constraints());
-  C_Polyhedron ph_y(y.constraints());
-  ph_x.time_elapse_assign(ph_y);
-  BD_Shape<T> x(ph_x);
-  m_swap(x);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::strictly_contains(const BD_Shape& y) const {
-  const BD_Shape<T>& x = *this;
-  return x.contains(y) && !y.contains(x);
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::upper_bound_assign_if_exact(const BD_Shape& y) {
-  if (space_dimension() != y.space_dimension())
-    throw_dimension_incompatible("upper_bound_assign_if_exact(y)", y);
-#if 0
-  return BFT00_upper_bound_assign_if_exact(y);
-#else
-  const bool integer_upper_bound = false;
-  return BHZ09_upper_bound_assign_if_exact<integer_upper_bound>(y);
-#endif
-}
-
-template <typename T>
-inline bool
-BD_Shape<T>::integer_upper_bound_assign_if_exact(const BD_Shape& y) {
-  PPL_COMPILE_TIME_CHECK(std::numeric_limits<T>::is_integer,
-                         "BD_Shape<T>::integer_upper_bound_assign_if_exact(y):"
-                         " T in not an integer datatype.");
-  if (space_dimension() != y.space_dimension())
-    throw_dimension_incompatible("integer_upper_bound_assign_if_exact(y)", y);
-  const bool integer_upper_bound = true;
-  return BHZ09_upper_bound_assign_if_exact<integer_upper_bound>(y);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>
-::remove_higher_space_dimensions(const dimension_type new_dimension) {
-  // Dimension-compatibility check: the variable having
-  // maximum index is the one occurring last in the set.
-  const dimension_type space_dim = space_dimension();
-  if (new_dimension > space_dim)
-    throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
-				 new_dimension);
-
-  // The removal of no dimensions from any BDS is a no-op.
-  // Note that this case also captures the only legal removal of
-  // dimensions from a zero-dim space BDS.
-  if (new_dimension == space_dim) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Shortest-path closure is necessary as in remove_space_dimensions().
-  shortest_path_closure_assign();
-  dbm.resize_no_copy(new_dimension + 1);
-
-  // Shortest-path closure is maintained.
-  // TODO: see whether or not reduction can be (efficiently!) maintained too.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-
-  // If we removed _all_ dimensions from a non-empty BDS,
-  // the zero-dim universe BDS has been obtained.
-  if (new_dimension == 0 && !marked_empty())
-    set_zero_dim_univ();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::wrap_assign(const Variables_Set& vars,
-                         Bounded_Integer_Type_Width w,
-                         Bounded_Integer_Type_Representation r,
-                         Bounded_Integer_Type_Overflow o,
-                         const Constraint_System* cs_p,
-                         unsigned complexity_threshold,
-                         bool wrap_individually) {
-  Implementation::wrap_assign(*this,
-                              vars, w, r, o, cs_p,
-                              complexity_threshold, wrap_individually,
-                              "BD_Shape");
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::CC76_extrapolation_assign(const BD_Shape& y, unsigned* tp) {
-  static N stop_points[] = {
-    N(-2, ROUND_UP),
-    N(-1, ROUND_UP),
-    N( 0, ROUND_UP),
-    N( 1, ROUND_UP),
-    N( 2, ROUND_UP)
-  };
-  CC76_extrapolation_assign(y,
-			    stop_points,
-			    stop_points
-			    + sizeof(stop_points)/sizeof(stop_points[0]),
-			    tp);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::H79_widening_assign(const BD_Shape& y, unsigned* tp) {
-  // Compute the H79 widening on polyhedra.
-  // TODO: provide a direct implementation.
-  C_Polyhedron ph_x(constraints());
-  C_Polyhedron ph_y(y.constraints());
-  ph_x.H79_widening_assign(ph_y, tp);
-  BD_Shape x(ph_x);
-  m_swap(x);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::widening_assign(const BD_Shape& y, unsigned* tp) {
-  H79_widening_assign(y, tp);
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::limited_H79_extrapolation_assign(const BD_Shape& y,
-					      const Constraint_System& cs,
-					      unsigned* tp) {
-  // Compute the limited H79 extrapolation on polyhedra.
-  // TODO: provide a direct implementation.
-  C_Polyhedron ph_x(constraints());
-  C_Polyhedron ph_y(y.constraints());
-  ph_x.limited_H79_extrapolation_assign(ph_y, cs, tp);
-  BD_Shape x(ph_x);
-  m_swap(x);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline memory_size_type
-BD_Shape<T>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename T>
-inline int32_t
-BD_Shape<T>::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-template <typename T>
-template <typename Interval_Info>
-inline void
-BD_Shape<T>::generalized_refine_with_linear_form_inequality(
-	     const Linear_Form<Interval<T, Interval_Info> >& left,
-	     const Linear_Form<Interval<T, Interval_Info> >& right,
-             const Relation_Symbol relsym) {
-  switch (relsym) {
-  case EQUAL:
-    // TODO: see if we can handle this case more efficiently.
-    refine_with_linear_form_inequality(left, right);
-    refine_with_linear_form_inequality(right, left);
-    break;
-  case LESS_THAN:
-  case LESS_OR_EQUAL:
-    refine_with_linear_form_inequality(left, right);
-    break;
-  case GREATER_THAN:
-  case GREATER_OR_EQUAL:
-    refine_with_linear_form_inequality(right, left);
-    break;
-  case NOT_EQUAL:
-    break;
-  default:
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename T>
-template <typename Interval_Info>
-inline void
-BD_Shape<T>
-::refine_fp_interval_abstract_store(Box<Interval<T, Interval_Info> >&
-                                    store) const {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-                     "BD_Shape<T>::refine_fp_interval_abstract_store:"
-                     " T not a floating point type.");
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-  store.intersection_assign(Box<FP_Interval_Type>(*this));
-}
-
-template <typename T>
-inline void
-BD_Shape<T>::drop_some_non_integer_points_helper(N& elem) {
-  if (!is_integer(elem)) {
-    Result r = floor_assign_r(elem, elem, ROUND_DOWN);
-    PPL_USED(r);
-    PPL_ASSERT(r == V_EQ);
-    reset_shortest_path_closed();
-  }
-}
-
-/*! \relates BD_Shape */
-template <typename T>
-inline void
-swap(BD_Shape<T>& x, BD_Shape<T>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_BD_Shape_inlines_hh)
diff --git a/src/BD_Shape.templates.hh b/src/BD_Shape.templates.hh
deleted file mode 100644
index f14bae4..0000000
--- a/src/BD_Shape.templates.hh
+++ /dev/null
@@ -1,6781 +0,0 @@
-/* BD_Shape class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BD_Shape_templates_hh
-#define PPL_BD_Shape_templates_hh 1
-
-#include "Generator_System.defs.hh"
-#include "Generator_System.inlines.hh"
-#include "Congruence_System.inlines.hh"
-#include "Congruence_System.defs.hh"
-#include "Interval.defs.hh"
-#include "Linear_Form.defs.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "MIP_Problem.defs.hh"
-#include "Variables_Set.defs.hh"
-#include "Bit_Row.defs.hh"
-#include "Temp.defs.hh"
-#include "assert.hh"
-#include <vector>
-#include <deque>
-#include <iostream>
-#include <sstream>
-#include <stdexcept>
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-BD_Shape<T>::BD_Shape(const Congruence_System& cgs)
-  : dbm(cgs.space_dimension() + 1),
-    status(),
-    redundancy_dbm() {
-  add_congruences(cgs);
-}
-
-template <typename T>
-BD_Shape<T>::BD_Shape(const Generator_System& gs)
-  : dbm(gs.space_dimension() + 1), status(), redundancy_dbm() {
-  const Generator_System::const_iterator gs_begin = gs.begin();
-  const Generator_System::const_iterator gs_end = gs.end();
-  if (gs_begin == gs_end) {
-    // An empty generator system defines the empty BD shape.
-    set_empty();
-    return;
-  }
-
-  const dimension_type space_dim = space_dimension();
-  DB_Row<N>& dbm_0 = dbm[0];
-  PPL_DIRTY_TEMP(N, tmp);
-
-  bool dbm_initialized = false;
-  bool point_seen = false;
-  // Going through all the points and closure points.
-  for (Generator_System::const_iterator gs_i = gs_begin;
-       gs_i != gs_end; ++gs_i) {
-    const Generator& g = *gs_i;
-    switch (g.type()) {
-    case Generator::POINT:
-      point_seen = true;
-      // Intentionally fall through.
-    case Generator::CLOSURE_POINT:
-      if (!dbm_initialized) {
-        // When handling the first (closure) point, we initialize the DBM.
-        dbm_initialized = true;
-        const Coefficient& d = g.divisor();
-        // TODO: Check if the following loop can be optimized used
-        // Generator::Expression::const_iterator.
-        for (dimension_type i = space_dim; i > 0; --i) {
-          const Coefficient& g_i = g.expression().get(Variable(i - 1));
-          DB_Row<N>& dbm_i = dbm[i];
-          for (dimension_type j = space_dim; j > 0; --j)
-            if (i != j)
-              div_round_up(dbm_i[j], g.expression().get(Variable(j - 1)) - g_i, d);
-          div_round_up(dbm_i[0], -g_i, d);
-        }
-        for (dimension_type j = space_dim; j > 0; --j)
-          div_round_up(dbm_0[j], g.expression().get(Variable(j - 1)), d);
-        // Note: no need to initialize the first element of the main diagonal.
-      }
-      else {
-        // This is not the first point: the DBM already contains
-        // valid values and we must compute maxima.
-        const Coefficient& d = g.divisor();
-        // TODO: Check if the following loop can be optimized used
-        // Generator::Expression::const_iterator.
-        for (dimension_type i = space_dim; i > 0; --i) {
-          const Coefficient& g_i = g.expression().get(Variable(i - 1));
-          DB_Row<N>& dbm_i = dbm[i];
-          // The loop correctly handles the case when i == j.
-          for (dimension_type j = space_dim; j > 0; --j) {
-            div_round_up(tmp, g.expression().get(Variable(j - 1)) - g_i, d);
-            max_assign(dbm_i[j], tmp);
-          }
-          div_round_up(tmp, -g_i, d);
-          max_assign(dbm_i[0], tmp);
-        }
-        for (dimension_type j = space_dim; j > 0; --j) {
-          div_round_up(tmp, g.expression().get(Variable(j - 1)), d);
-          max_assign(dbm_0[j], tmp);
-        }
-      }
-      break;
-    default:
-      // Lines and rays temporarily ignored.
-      break;
-    }
-  }
-
-  if (!point_seen)
-    // The generator system is not empty, but contains no points.
-    throw_invalid_argument("BD_Shape(gs)",
-                           "the non-empty generator system gs "
-                           "contains no points.");
-
-  // Going through all the lines and rays.
-  for (Generator_System::const_iterator gs_i = gs_begin;
-       gs_i != gs_end; ++gs_i) {
-    const Generator& g = *gs_i;
-    switch (g.type()) {
-    case Generator::LINE:
-      // TODO: Check if the following loop can be optimized used
-      // Generator::Expression::const_iterator.
-      for (dimension_type i = space_dim; i > 0; --i) {
-        const Coefficient& g_i = g.expression().get(Variable(i - 1));
-        DB_Row<N>& dbm_i = dbm[i];
-        // The loop correctly handles the case when i == j.
-        for (dimension_type j = space_dim; j > 0; --j)
-          if (g_i != g.expression().get(Variable(j - 1)))
-            assign_r(dbm_i[j], PLUS_INFINITY, ROUND_NOT_NEEDED);
-        if (g_i != 0)
-          assign_r(dbm_i[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
-      }
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
-            i_end = g.expression().end(); i != i_end; ++i)
-        assign_r(dbm_0[i.variable().space_dimension()],
-                 PLUS_INFINITY, ROUND_NOT_NEEDED);
-      break;
-    case Generator::RAY:
-      // TODO: Check if the following loop can be optimized used
-      // Generator::Expression::const_iterator.
-      for (dimension_type i = space_dim; i > 0; --i) {
-        const Coefficient& g_i = g.expression().get(Variable(i - 1));
-        DB_Row<N>& dbm_i = dbm[i];
-        // The loop correctly handles the case when i == j.
-        for (dimension_type j = space_dim; j > 0; --j)
-          if (g_i < g.expression().get(Variable(j - 1)))
-            assign_r(dbm_i[j], PLUS_INFINITY, ROUND_NOT_NEEDED);
-        if (g_i < 0)
-          assign_r(dbm_i[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
-      }
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
-            i_end = g.expression().end(); i != i_end; ++i)
-        if (*i > 0)
-          assign_r(dbm_0[i.variable().space_dimension()],
-                   PLUS_INFINITY, ROUND_NOT_NEEDED);
-      break;
-    default:
-      // Points and closure points already dealt with.
-      break;
-    }
-  }
-  set_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-BD_Shape<T>::BD_Shape(const Polyhedron& ph, const Complexity_Class complexity)
-  : dbm(), status(), redundancy_dbm() {
-  const dimension_type num_dimensions = ph.space_dimension();
-
-  if (ph.marked_empty()) {
-    *this = BD_Shape<T>(num_dimensions, EMPTY);
-    return;
-  }
-
-  if (num_dimensions == 0) {
-    *this = BD_Shape<T>(num_dimensions, UNIVERSE);
-    return;
-  }
-
-  // Build from generators when we do not care about complexity
-  // or when the process has polynomial complexity.
-  if (complexity == ANY_COMPLEXITY
-      || (!ph.has_pending_constraints() && ph.generators_are_up_to_date())) {
-    *this = BD_Shape<T>(ph.generators());
-    return;
-  }
-
-  // We cannot afford exponential complexity, we do not have a complete set
-  // of generators for the polyhedron, and the polyhedron is not trivially
-  // empty or zero-dimensional.  Constraints, however, are up to date.
-  PPL_ASSERT(ph.constraints_are_up_to_date());
-
-  if (!ph.has_something_pending() && ph.constraints_are_minimized()) {
-    // If the constraint system of the polyhedron is minimized,
-    // the test `is_universe()' has polynomial complexity.
-    if (ph.is_universe()) {
-      *this = BD_Shape<T>(num_dimensions, UNIVERSE);
-      return;
-    }
-  }
-
-  // See if there is at least one inconsistent constraint in `ph.con_sys'.
-  for (Constraint_System::const_iterator i = ph.con_sys.begin(),
-         cs_end = ph.con_sys.end(); i != cs_end; ++i)
-    if (i->is_inconsistent()) {
-      *this = BD_Shape<T>(num_dimensions, EMPTY);
-      return;
-    }
-
-  // If `complexity' allows it, use simplex to derive the exact (modulo
-  // the fact that our BDSs are topologically closed) variable bounds.
-  if (complexity == SIMPLEX_COMPLEXITY) {
-    MIP_Problem lp(num_dimensions);
-    lp.set_optimization_mode(MAXIMIZATION);
-
-    const Constraint_System& ph_cs = ph.constraints();
-    if (!ph_cs.has_strict_inequalities())
-      lp.add_constraints(ph_cs);
-    else
-      // Adding to `lp' a topologically closed version of `ph_cs'.
-      for (Constraint_System::const_iterator i = ph_cs.begin(),
-             ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
-        const Constraint& c = *i;
-        if (c.is_strict_inequality())
-          lp.add_constraint(Linear_Expression(c) >= 0);
-        else
-          lp.add_constraint(c);
-      }
-
-    // Check for unsatisfiability.
-    if (!lp.is_satisfiable()) {
-      *this = BD_Shape<T>(num_dimensions, EMPTY);
-      return;
-    }
-
-    // Start with a universe BDS that will be refined by the simplex.
-    *this = BD_Shape<T>(num_dimensions, UNIVERSE);
-    // Get all the upper bounds.
-    Generator g(point());
-    PPL_DIRTY_TEMP_COEFFICIENT(numer);
-    PPL_DIRTY_TEMP_COEFFICIENT(denom);
-    for (dimension_type i = 1; i <= num_dimensions; ++i) {
-      Variable x(i-1);
-      // Evaluate optimal upper bound for `x <= ub'.
-      lp.set_objective_function(x);
-      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-        g = lp.optimizing_point();
-        lp.evaluate_objective_function(g, numer, denom);
-        div_round_up(dbm[0][i], numer, denom);
-      }
-      // Evaluate optimal upper bound for `x - y <= ub'.
-      for (dimension_type j = 1; j <= num_dimensions; ++j) {
-        if (i == j)
-          continue;
-        Variable y(j-1);
-        lp.set_objective_function(x - y);
-        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-          g = lp.optimizing_point();
-          lp.evaluate_objective_function(g, numer, denom);
-          div_round_up(dbm[j][i], numer, denom);
-        }
-      }
-      // Evaluate optimal upper bound for `-x <= ub'.
-      lp.set_objective_function(-x);
-      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-        g = lp.optimizing_point();
-        lp.evaluate_objective_function(g, numer, denom);
-        div_round_up(dbm[i][0], numer, denom);
-      }
-    }
-    set_shortest_path_closed();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Extract easy-to-find bounds from constraints.
-  PPL_ASSERT(complexity == POLYNOMIAL_COMPLEXITY);
-  *this = BD_Shape<T>(num_dimensions, UNIVERSE);
-  refine_with_constraints(ph.constraints());
-}
-
-template <typename T>
-dimension_type
-BD_Shape<T>::affine_dimension() const {
-  const dimension_type space_dim = space_dimension();
-  // A zero-space-dim shape always has affine dimension zero.
-  if (space_dim == 0)
-    return 0;
-
-  // Shortest-path closure is necessary to detect emptiness
-  // and all (possibly implicit) equalities.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return 0;
-
-  // The vector `predecessor' is used to represent equivalence classes:
-  // `predecessor[i] == i' if and only if `i' is the leader of its
-  // equivalence class (i.e., the minimum index in the class).
-  std::vector<dimension_type> predecessor;
-  compute_predecessors(predecessor);
-
-  // Due to the fictitious variable `0', the affine dimension is one
-  // less the number of equivalence classes.
-  dimension_type affine_dim = 0;
-  // Note: disregard the first equivalence class.
-  for (dimension_type i = 1; i <= space_dim; ++i)
-    if (predecessor[i] == i)
-      ++affine_dim;
-
-  return affine_dim;
-}
-
-template <typename T>
-Congruence_System
-BD_Shape<T>::minimized_congruences() const {
-  // Shortest-path closure is necessary to detect emptiness
-  // and all (possibly implicit) equalities.
-  shortest_path_closure_assign();
-
-  const dimension_type space_dim = space_dimension();
-  Congruence_System cgs(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cgs = Congruence_System::zero_dim_empty();
-    return cgs;
-  }
-
-  if (marked_empty()) {
-    cgs.insert(Congruence::zero_dim_false());
-    return cgs;
-  }
-
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-
-  // Compute leader information.
-  std::vector<dimension_type> leaders;
-  compute_leaders(leaders);
-
-  // Go through the non-leaders to generate equality constraints.
-  const DB_Row<N>& dbm_0 = dbm[0];
-  for (dimension_type i = 1; i <= space_dim; ++i) {
-    const dimension_type leader = leaders[i];
-    if (i != leader) {
-      // Generate the constraint relating `i' and its leader.
-      if (leader == 0) {
-        // A unary equality has to be generated.
-        PPL_ASSERT(!is_plus_infinity(dbm_0[i]));
-        numer_denom(dbm_0[i], numer, denom);
-        cgs.insert(denom*Variable(i-1) == numer);
-      }
-      else {
-        // A binary equality has to be generated.
-        PPL_ASSERT(!is_plus_infinity(dbm[i][leader]));
-        numer_denom(dbm[i][leader], numer, denom);
-        cgs.insert(denom*Variable(leader-1) - denom*Variable(i-1) == numer);
-      }
-    }
-  }
-  return cgs;
-}
-
-template <typename T>
-void
-BD_Shape<T>::add_constraint(const Constraint& c) {
-  // Dimension-compatibility check.
-  if (c.space_dimension() > space_dimension())
-    throw_dimension_incompatible("add_constraint(c)", c);
-
-  // Get rid of strict inequalities.
-  if (c.is_strict_inequality()) {
-    if (c.is_inconsistent()) {
-      set_empty();
-      return;
-    }
-    if (c.is_tautological())
-      return;
-    // Nontrivial strict inequalities are not allowed.
-    throw_invalid_argument("add_constraint(c)",
-                           "strict inequalities are not allowed");
-  }
-
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  // Constraints that are not bounded differences are not allowed.
-  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff))
-    throw_invalid_argument("add_constraint(c)",
-                           "c is not a bounded difference constraint");
-
-  const Coefficient& inhomo = c.inhomogeneous_term();
-  if (num_vars == 0) {
-    // Dealing with a trivial constraint (not a strict inequality).
-    if (inhomo < 0
-        || (inhomo != 0 && c.is_equality()))
-      set_empty();
-    return;
-  }
-
-  // Select the cell to be modified for the "<=" part of the constraint,
-  // and set `coeff' to the absolute value of itself.
-  const bool negative = (coeff < 0);
-  if (negative)
-    neg_assign(coeff);
-
-  bool changed = false;
-  N& x = negative ? dbm[i][j] : dbm[j][i];
-  // Compute the bound for `x', rounding towards plus infinity.
-  PPL_DIRTY_TEMP(N, d);
-  div_round_up(d, inhomo, coeff);
-  if (x > d) {
-    x = d;
-    changed = true;
-  }
-
-  if (c.is_equality()) {
-    N& y = negative ? dbm[j][i] : dbm[i][j];
-    // Also compute the bound for `y', rounding towards plus infinity.
-    PPL_DIRTY_TEMP_COEFFICIENT(minus_c_term);
-    neg_assign(minus_c_term, inhomo);
-    div_round_up(d, minus_c_term, coeff);
-    if (y > d) {
-      y = d;
-      changed = true;
-    }
-  }
-
-  // In general, adding a constraint does not preserve the shortest-path
-  // closure or reduction of the bounded difference shape.
-  if (changed && marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::add_congruence(const Congruence& cg) {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  // Dimension-compatibility check:
-  // the dimension of `cg' can not be greater than space_dim.
-  if (space_dimension() < cg_space_dim)
-    throw_dimension_incompatible("add_congruence(cg)", cg);
-
-  // Handle the case of proper congruences first.
-  if (cg.is_proper_congruence()) {
-    if (cg.is_tautological())
-      return;
-    if (cg.is_inconsistent()) {
-      set_empty();
-      return;
-    }
-    // Non-trivial and proper congruences are not allowed.
-    throw_invalid_argument("add_congruence(cg)",
-                           "cg is a non-trivial, proper congruence");
-  }
-
-  PPL_ASSERT(cg.is_equality());
-  Constraint c(cg);
-  add_constraint(c);
-}
-
-template <typename T>
-void
-BD_Shape<T>::refine_no_check(const Constraint& c) {
-  PPL_ASSERT(!marked_empty());
-  PPL_ASSERT(c.space_dimension() <= space_dimension());
-
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  // Constraints that are not bounded differences are ignored.
-  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff))
-    return;
-
-  const Coefficient& inhomo = c.inhomogeneous_term();
-  if (num_vars == 0) {
-    // Dealing with a trivial constraint (might be a strict inequality).
-    if (inhomo < 0
-        || (c.is_equality() && inhomo != 0)
-        || (c.is_strict_inequality() && inhomo == 0))
-      set_empty();
-    return;
-  }
-
-  // Select the cell to be modified for the "<=" part of the constraint,
-  // and set `coeff' to the absolute value of itself.
-  const bool negative = (coeff < 0);
-  N& x = negative ? dbm[i][j] : dbm[j][i];
-  N& y = negative ? dbm[j][i] : dbm[i][j];
-  if (negative)
-    neg_assign(coeff);
-
-  bool changed = false;
-  // Compute the bound for `x', rounding towards plus infinity.
-  PPL_DIRTY_TEMP(N, d);
-  div_round_up(d, inhomo, coeff);
-  if (x > d) {
-    x = d;
-    changed = true;
-  }
-
-  if (c.is_equality()) {
-    // Also compute the bound for `y', rounding towards plus infinity.
-    PPL_DIRTY_TEMP_COEFFICIENT(minus_c_term);
-    neg_assign(minus_c_term, inhomo);
-    div_round_up(d, minus_c_term, coeff);
-    if (y > d) {
-      y = d;
-      changed = true;
-    }
-  }
-
-  // In general, adding a constraint does not preserve the shortest-path
-  // closure or reduction of the bounded difference shape.
-  if (changed && marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::concatenate_assign(const BD_Shape& y) {
-  BD_Shape& x = *this;
-
-  const dimension_type x_space_dim = x.space_dimension();
-  const dimension_type y_space_dim = y.space_dimension();
-
-  // If `y' is an empty 0-dim space bounded difference shape,
-  // let `*this' become empty.
-  if (y_space_dim == 0 && y.marked_empty()) {
-    set_empty();
-    return;
-  }
-
-  // If `x' is an empty 0-dim space BDS, then it is sufficient to adjust
-  // the dimension of the vector space.
-  if (x_space_dim == 0 && marked_empty()) {
-    dbm.grow(y_space_dim + 1);
-    PPL_ASSERT(OK());
-    return;
-  }
-  // First we increase the space dimension of `x' by adding
-  // `y.space_dimension()' new dimensions.
-  // The matrix for the new system of constraints is obtained
-  // by leaving the old system of constraints in the upper left-hand side
-  // and placing the constraints of `y' in the lower right-hand side,
-  // except the constraints as `y(i) >= cost' or `y(i) <= cost', that are
-  // placed in the right position on the new matrix.
-  add_space_dimensions_and_embed(y_space_dim);
-  const dimension_type new_space_dim = x_space_dim + y_space_dim;
-  for (dimension_type i = x_space_dim + 1; i <= new_space_dim; ++i) {
-    DB_Row<N>& dbm_i = dbm[i];
-    dbm_i[0] = y.dbm[i - x_space_dim][0];
-    dbm[0][i] = y.dbm[0][i - x_space_dim];
-    for (dimension_type j = x_space_dim + 1; j <= new_space_dim; ++j)
-      dbm_i[j] = y.dbm[i - x_space_dim][j - x_space_dim];
-  }
-
-  if (marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-bool
-BD_Shape<T>::contains(const BD_Shape& y) const {
-  const BD_Shape<T>& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    throw_dimension_incompatible("contains(y)", y);
-
-  if (x_space_dim == 0) {
-    // The zero-dimensional empty shape only contains another
-    // zero-dimensional empty shape.
-    // The zero-dimensional universe shape contains any other
-    // zero-dimensional shape.
-    return marked_empty() ? y.marked_empty() : true;
-  }
-
-  /*
-    The `y' bounded difference shape must be closed.  As an example,
-    consider the case where in `*this' we have the constraints
-
-    x1 - x2 <= 1,
-    x1      <= 3,
-    x2      <= 2,
-
-    and in `y' the constraints are
-
-    x1 - x2 <= 0,
-    x2      <= 1.
-
-    Without closure the (erroneous) analysis of the inhomogeneous terms
-    would conclude containment does not hold.  Closing `y' results into
-    the "discovery" of the implicit constraint
-
-    x1      <= 1,
-
-    at which point the inhomogeneous terms can be examined to determine
-    that containment does hold.
-  */
-  y.shortest_path_closure_assign();
-  // An empty shape is contained in any other dimension-compatible shapes.
-  if (y.marked_empty())
-    return true;
-
-  // If `x' is empty it can not contain `y' (which is not empty).
-  if (x.is_empty())
-    return false;
-
-  // `*this' contains `y' if and only if every cell of `dbm'
-  // is greater than or equal to the correspondent one of `y.dbm'.
-  for (dimension_type i = x_space_dim + 1; i-- > 0; ) {
-    const DB_Row<N>& x_dbm_i = x.dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    for (dimension_type j = x_space_dim + 1; j-- > 0; )
-      if (x_dbm_i[j] < y_dbm_i[j])
-        return false;
-  }
-  return true;
-}
-
-template <typename T>
-bool
-BD_Shape<T>::is_disjoint_from(const BD_Shape& y) const {
-  const dimension_type space_dim = space_dimension();
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("is_disjoint_from(y)", y);
-
-  // If one of the two bounded difference shape is empty,
-  // then the two bounded difference shape are disjoint.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return true;
-  y.shortest_path_closure_assign();
-  if (y.marked_empty())
-    return true;
-
-  // Two BDSs are disjoint when their intersection is empty.
-  // That is if and only if there exists at least a bounded difference
-  // such that the upper bound of the bounded difference in the first
-  // BD_Shape is strictly less than the lower bound of
-  // the corresponding bounded difference in the second BD_Shape
-  // or vice versa.
-  // For example: let be
-  // in `*this':    -a_j_i <= v_j - v_i <= a_i_j;
-  // and in `y':    -b_j_i <= v_j - v_i <= b_i_j;
-  // `*this' and `y' are disjoint if
-  // 1.) a_i_j < -b_j_i or
-  // 2.) b_i_j < -a_j_i.
-  PPL_DIRTY_TEMP(N, tmp);
-  for (dimension_type i = space_dim+1; i-- > 0; ) {
-    const DB_Row<N>& x_i = dbm[i];
-    for (dimension_type j = space_dim+1; j-- > 0; ) {
-      neg_assign_r(tmp, y.dbm[j][i], ROUND_UP);
-      if (x_i[j] < tmp)
-        return true;
-    }
-  }
-
-  return false;
-}
-
-template <typename T>
-bool
-BD_Shape<T>::is_universe() const {
-  if (marked_empty())
-    return false;
-
-  const dimension_type space_dim = space_dimension();
-  // If the BDS is non-empty and zero-dimensional,
-  // then it is necessarily the universe BDS.
-  if (space_dim == 0)
-    return true;
-
-  // A bounded difference shape defining the universe BDS can only
-  // contain trivial constraints.
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    const DB_Row<N>& dbm_i = dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; )
-      if (!is_plus_infinity(dbm_i[j]))
-        return false;
-  }
-  return true;
-}
-
-template <typename T>
-bool
-BD_Shape<T>::is_bounded() const {
-  shortest_path_closure_assign();
-  const dimension_type space_dim = space_dimension();
-  // A zero-dimensional or empty BDS is bounded.
-  if (marked_empty() || space_dim == 0)
-    return true;
-
-  // A bounded difference shape defining the bounded BDS never can
-  // contain trivial constraints.
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    const DB_Row<N>& dbm_i = dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; )
-      if (i != j)
-        if (is_plus_infinity(dbm_i[j]))
-          return false;
-  }
-
-  return true;
-}
-
-template <typename T>
-bool
-BD_Shape<T>::contains_integer_point() const {
-  // Force shortest-path closure.
-  if (is_empty())
-    return false;
-
-  const dimension_type space_dim = space_dimension();
-  if (space_dim == 0)
-    return true;
-
-  // A non-empty BD_Shape defined by integer constraints
-  // necessarily contains an integer point.
-  if (std::numeric_limits<T>::is_integer)
-    return true;
-
-  // Build an integer BD_Shape z with bounds at least as tight as
-  // those in *this and then recheck for emptiness.
-  BD_Shape<mpz_class> bds_z(space_dim);
-  typedef BD_Shape<mpz_class>::N Z;
-  bds_z.reset_shortest_path_closed();
-  PPL_DIRTY_TEMP(N, tmp);
-  bool all_integers = true;
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<Z>& z_i = bds_z.dbm[i];
-    const DB_Row<N>& dbm_i = dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; ) {
-      const N& dbm_i_j = dbm_i[j];
-      if (is_plus_infinity(dbm_i_j))
-        continue;
-      if (is_integer(dbm_i_j))
-        assign_r(z_i[j], dbm_i_j, ROUND_NOT_NEEDED);
-      else {
-        all_integers = false;
-        Z& z_i_j = z_i[j];
-        // Copy dbm_i_j into z_i_j, but rounding downwards.
-        neg_assign_r(tmp, dbm_i_j, ROUND_NOT_NEEDED);
-        assign_r(z_i_j, tmp, ROUND_UP);
-        neg_assign_r(z_i_j, z_i_j, ROUND_NOT_NEEDED);
-      }
-    }
-  }
-  return all_integers || !bds_z.is_empty();
-}
-
-template <typename T>
-bool
-BD_Shape<T>::frequency(const Linear_Expression& expr,
-                       Coefficient& freq_n, Coefficient& freq_d,
-                       Coefficient& val_n, Coefficient& val_d) const {
-  dimension_type space_dim = space_dimension();
-  // The dimension of `expr' must be at most the dimension of *this.
-  if (space_dim < expr.space_dimension())
-    throw_dimension_incompatible("frequency(e, ...)", "e", expr);
-
-  // Check if `expr' has a constant value.
-  // If it is constant, set the frequency `freq_n' to 0
-  // and return true. Otherwise the values for \p expr
-  // are not discrete so return false.
-
-  // Space dimension is 0: if empty, then return false;
-  // otherwise the frequency is 0 and the value is the inhomogeneous term.
-  if (space_dim == 0) {
-    if (is_empty())
-      return false;
-    freq_n = 0;
-    freq_d = 1;
-    val_n = expr.inhomogeneous_term();
-    val_d = 1;
-    return true;
-  }
-
-  shortest_path_closure_assign();
-  // For an empty BD shape, we simply return false.
-  if (marked_empty())
-    return false;
-
-  // The BD shape has at least 1 dimension and is not empty.
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  PPL_DIRTY_TEMP(N, tmp);
-  Linear_Expression le = expr;
-  // Boolean to keep track of a variable `v' in expression `le'.
-  // If we can replace `v' by an expression using variables other
-  // than `v' and are already in `le', then this is set to true.
-
-  PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
-  val_denom = 1;
-
-  // TODO: This loop can be optimized more, if needed, exploiting the
-  // (possible) sparseness of le.
-  for (dimension_type i = dbm.num_rows(); i-- > 1; ) {
-    const Variable v(i-1);
-    coeff = le.coefficient(v);
-    if (coeff == 0)
-      continue;
-
-    const DB_Row<N>& dbm_i = dbm[i];
-    // Check if `v' is constant in the BD shape.
-    assign_r(tmp, dbm_i[0], ROUND_NOT_NEEDED);
-    if (is_additive_inverse(dbm[0][i], tmp)) {
-      // If `v' is constant, replace it in `le' by the value.
-      numer_denom(tmp, numer, denom);
-      sub_mul_assign(le, coeff, v);
-      le *= denom;
-      le -= numer*coeff;
-      val_denom *= denom;
-      continue;
-    }
-    // Check the bounded differences with the other dimensions that
-    // have non-zero coefficient in `le'.
-    else {
-      bool constant_v = false;
-      for (Linear_Expression::const_iterator j = le.begin(),
-            j_end = le.lower_bound(Variable(i - 1)); j != j_end; ++j) {
-        const Variable vj = j.variable();
-        const dimension_type j_dim = vj.space_dimension();
-        assign_r(tmp, dbm_i[j_dim], ROUND_NOT_NEEDED);
-        if (is_additive_inverse(dbm[j_dim][i], tmp)) {
-          // The coefficient for `vj' in `le' is not 0
-          // and the difference with `v' in the BD shape is constant.
-          // So apply this equality to eliminate `v' in `le'.
-          numer_denom(tmp, numer, denom);
-          // Modifying le invalidates the iterators, but it's not a problem
-          // since we are going to exit the loop.
-          sub_mul_assign(le, coeff, v);
-          add_mul_assign(le, coeff, vj);
-          le *= denom;
-          le -= numer*coeff;
-          val_denom *= denom;
-          constant_v = true;
-          break;
-        }
-      }
-      if (!constant_v)
-        // The expression `expr' is not constant.
-        return false;
-    }
-  }
-
-  // The expression `expr' is constant.
-  freq_n = 0;
-  freq_d = 1;
-
-  // Reduce `val_n' and `val_d'.
-  normalize2(le.inhomogeneous_term(), val_denom, val_n, val_d);
-  return true;
-}
-
-template <typename T>
-bool
-BD_Shape<T>::constrains(const Variable var) const {
-  // `var' should be one of the dimensions of the BD shape.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dimension() < var_space_dim)
-    throw_dimension_incompatible("constrains(v)", "v", var);
-
-  shortest_path_closure_assign();
-  // A BD shape known to be empty constrains all variables.
-  // (Note: do not force emptiness check _yet_)
-  if (marked_empty())
-    return true;
-
-  // Check whether `var' is syntactically constrained.
-  const DB_Row<N>& dbm_v = dbm[var_space_dim];
-  for (dimension_type i = dbm.num_rows(); i-- > 0; ) {
-    if (!is_plus_infinity(dbm_v[i])
-        || !is_plus_infinity(dbm[i][var_space_dim]))
-      return true;
-  }
-
-  // `var' is not syntactically constrained:
-  // now force an emptiness check.
-  return is_empty();
-}
-
-template <typename T>
-void
-BD_Shape<T>
-::compute_predecessors(std::vector<dimension_type>& predecessor) const {
-  PPL_ASSERT(!marked_empty() && marked_shortest_path_closed());
-  PPL_ASSERT(predecessor.size() == 0);
-  // Variables are ordered according to their index.
-  // The vector `predecessor' is used to indicate which variable
-  // immediately precedes a given one in the corresponding equivalence class.
-  // The `leader' of an equivalence class is the element having minimum
-  // index: leaders are their own predecessors.
-  const dimension_type predecessor_size = dbm.num_rows();
-  // Initially, each variable is leader of its own zero-equivalence class.
-  predecessor.reserve(predecessor_size);
-  for (dimension_type i = 0; i < predecessor_size; ++i)
-    predecessor.push_back(i);
-  // Now compute actual predecessors.
-  for (dimension_type i = predecessor_size; i-- > 1; )
-    if (i == predecessor[i]) {
-      const DB_Row<N>& dbm_i = dbm[i];
-      for (dimension_type j = i; j-- > 0; )
-        if (j == predecessor[j]
-            && is_additive_inverse(dbm[j][i], dbm_i[j])) {
-          // Choose as predecessor the variable having the smaller index.
-          predecessor[i] = j;
-          break;
-        }
-    }
-}
-
-template <typename T>
-void
-BD_Shape<T>::compute_leaders(std::vector<dimension_type>& leaders) const {
-  PPL_ASSERT(!marked_empty() && marked_shortest_path_closed());
-  PPL_ASSERT(leaders.size() == 0);
-  // Compute predecessor information.
-  compute_predecessors(leaders);
-  // Flatten the predecessor chains so as to obtain leaders.
-  PPL_ASSERT(leaders[0] == 0);
-  for (dimension_type i = 1, l_size = leaders.size(); i != l_size; ++i) {
-    const dimension_type leaders_i = leaders[i];
-    PPL_ASSERT(leaders_i <= i);
-    if (leaders_i != i) {
-      const dimension_type leaders_leaders_i = leaders[leaders_i];
-      PPL_ASSERT(leaders_leaders_i == leaders[leaders_leaders_i]);
-      leaders[i] = leaders_leaders_i;
-    }
-  }
-}
-
-template <typename T>
-bool
-BD_Shape<T>::is_shortest_path_reduced() const {
-  // If the BDS is empty, it is also reduced.
-  if (marked_empty())
-    return true;
-
-  const dimension_type space_dim = space_dimension();
-  // Zero-dimensional BDSs are necessarily reduced.
-  if (space_dim == 0)
-    return true;
-
-  // A shortest-path reduced dbm is just a dbm with an indication of
-  // those constraints that are redundant. If there is no indication
-  // of the redundant constraints, then it cannot be reduced.
-  if (!marked_shortest_path_reduced())
-    return false;
-
-  const BD_Shape x_copy = *this;
-  x_copy.shortest_path_closure_assign();
-  // If we just discovered emptiness, it cannot be reduced.
-  if (x_copy.marked_empty())
-    return false;
-
-  // The vector `leader' is used to indicate which variables are equivalent.
-  std::vector<dimension_type> leader(space_dim + 1);
-
-  // We store the leader.
-  for (dimension_type i = space_dim + 1; i-- > 0; )
-    leader[i] = i;
-
-  // Step 1: we store really the leader with the corrected value.
-  // We search for the equivalent or zero-equivalent variables.
-  // The variable(i-1) and variable(j-1) are equivalent if and only if
-  // m_i_j == -(m_j_i).
-  for (dimension_type i = 0; i < space_dim; ++i) {
-    const DB_Row<N>& x_copy_dbm_i = x_copy.dbm[i];
-    for (dimension_type j = i + 1; j <= space_dim; ++j)
-      if (is_additive_inverse(x_copy.dbm[j][i], x_copy_dbm_i[j]))
-        // Two equivalent variables have got the same leader
-        // (the smaller variable).
-        leader[j] = leader[i];
-  }
-
-  // Step 2: we check if there are redundant constraints in the zero_cycle
-  // free bounded difference shape, considering only the leaders.
-  // A constraint `c' is redundant, when there are two constraints such that
-  // their sum is the same constraint with the inhomogeneous term
-  // less than or equal to the `c' one.
-  PPL_DIRTY_TEMP(N, c);
-  for (dimension_type k = 0; k <= space_dim; ++k)
-    if (leader[k] == k) {
-      const DB_Row<N>& x_k = x_copy.dbm[k];
-      for (dimension_type i = 0; i <= space_dim; ++i)
-        if (leader[i] == i) {
-          const DB_Row<N>& x_i = x_copy.dbm[i];
-          const Bit_Row& redundancy_i = redundancy_dbm[i];
-          const N& x_i_k = x_i[k];
-          for (dimension_type j = 0; j <= space_dim; ++j)
-            if (leader[j] == j) {
-              const N& x_i_j = x_i[j];
-              if (!is_plus_infinity(x_i_j)) {
-                add_assign_r(c, x_i_k, x_k[j], ROUND_UP);
-                if (x_i_j >= c && !redundancy_i[j])
-                  return false;
-              }
-            }
-        }
-    }
-
-  // The vector `var_conn' is used to check if there is a single cycle
-  // that connected all zero-equivalent variables between them.
-  // The value `space_dim + 1' is used to indicate that the equivalence
-  // class contains a single variable.
-  std::vector<dimension_type> var_conn(space_dim + 1);
-  for (dimension_type i = space_dim + 1; i-- > 0; )
-    var_conn[i] = space_dim + 1;
-
-  // Step 3: we store really the `var_conn' with the right value, putting
-  // the variable with the selected variable is connected:
-  // we check the row of each variable:
-  // a- each leader could be connected with only zero-equivalent one,
-  // b- each non-leader with only another zero-equivalent one.
-  for (dimension_type i = 0; i <= space_dim; ++i) {
-    // It count with how many variables the selected variable is
-    // connected.
-    dimension_type t = 0;
-    dimension_type leader_i = leader[i];
-    // Case a: leader.
-    if (leader_i == i) {
-      for (dimension_type j = 0; j <= space_dim; ++j) {
-        dimension_type leader_j = leader[j];
-        // Only the connectedness with equivalent variables
-        // is considered.
-        if (j != leader_j)
-          if (!redundancy_dbm[i][j]) {
-            if (t == 1)
-              // Two non-leaders cannot be connected with the same leader.
-              return false;
-            else
-              if (leader_j != i)
-                // The variables are not in the same equivalence class.
-                return false;
-              else {
-                ++t;
-                var_conn[i] = j;
-              }
-          }
-      }
-    }
-    // Case b: non-leader.
-    else {
-      for (dimension_type j = 0; j <= space_dim; ++j) {
-        if (!redundancy_dbm[i][j]) {
-          dimension_type leader_j = leader[j];
-          if (leader_i != leader_j)
-            // The variables are not in the same equivalence class.
-            return false;
-          else {
-            if (t == 1)
-              // The variables cannot be connected with the same leader.
-              return false;
-            else {
-              ++t;
-              var_conn[i] = j;
-            }
-          }
-          // A non-leader must be connected with
-          // another variable.
-          if (t == 0)
-            return false;
-        }
-      }
-    }
-  }
-
-  // The vector `just_checked' is used to check if
-  // a variable is already checked.
-  std::vector<bool> just_checked(space_dim + 1);
-  for (dimension_type i = space_dim + 1; i-- > 0; )
-    just_checked[i] = false;
-
-  // Step 4: we check if there are single cycles that
-  // connected all the zero-equivalent variables between them.
-  for (dimension_type i = 0; i <= space_dim; ++i) {
-    // We do not re-check the already considered single cycles.
-    if (!just_checked[i]) {
-      dimension_type v_con = var_conn[i];
-      // We consider only the equivalence classes with
-      // 2 or plus variables.
-      if (v_con != space_dim + 1) {
-        // There is a single cycle if taken a variable,
-        // we return to this same variable.
-        while (v_con != i) {
-          just_checked[v_con] = true;
-          v_con = var_conn[v_con];
-          // If we re-pass to an already considered variable,
-          // then we haven't a single cycle.
-          if (just_checked[v_con])
-            return false;
-        }
-      }
-    }
-    just_checked[i] = true;
-  }
-
-  // The system bounded differences is just reduced.
-  return true;
-}
-
-template <typename T>
-bool
-BD_Shape<T>::bounds(const Linear_Expression& expr,
-                    const bool from_above) const {
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  const dimension_type space_dim = space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((from_above
-                                  ? "bounds_from_above(e)"
-                                  : "bounds_from_below(e)"), "e", expr);
-
-  shortest_path_closure_assign();
-  // A zero-dimensional or empty BDS bounds everything.
-  if (space_dim == 0 || marked_empty())
-    return true;
-
-  // The constraint `c' is used to check if `expr' is a difference
-  // bounded and, in this case, to select the cell.
-  const Constraint& c = from_above ? expr <= 0 : expr >= 0;
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  // Check if `c' is a BD constraint.
-  if (BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
-    if (num_vars == 0)
-      // Dealing with a trivial constraint.
-      return true;
-    // Select the cell to be checked.
-    const N& x = (coeff < 0) ? dbm[i][j] : dbm[j][i];
-    return !is_plus_infinity(x);
-  }
-  else {
-    // Not a DB constraint: use the MIP solver.
-    Optimization_Mode mode_bounds
-      = from_above ? MAXIMIZATION : MINIMIZATION;
-    MIP_Problem mip(space_dim, constraints(), expr, mode_bounds);
-    // Problem is known to be feasible.
-    return mip.solve() == OPTIMIZED_MIP_PROBLEM;
-  }
-}
-
-template <typename T>
-bool
-BD_Shape<T>::max_min(const Linear_Expression& expr,
-                     const bool maximize,
-                     Coefficient& ext_n, Coefficient& ext_d,
-                     bool& included) const {
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((maximize
-                                  ? "maximize(e, ...)"
-                                  : "minimize(e, ...)"), "e", expr);
-  // Deal with zero-dim BDS first.
-  if (space_dim == 0) {
-    if (marked_empty())
-      return false;
-    else {
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      return true;
-    }
-  }
-
-  shortest_path_closure_assign();
-  // For an empty BDS we simply return false.
-  if (marked_empty())
-    return false;
-
-  // The constraint `c' is used to check if `expr' is a difference
-  // bounded and, in this case, to select the cell.
-  const Constraint& c = maximize ? expr <= 0 : expr >= 0;
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  // Check if `c' is a BD constraint.
-  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
-    Optimization_Mode mode_max_min
-      = maximize ? MAXIMIZATION : MINIMIZATION;
-    MIP_Problem mip(space_dim, constraints(), expr, mode_max_min);
-    if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
-      mip.optimal_value(ext_n, ext_d);
-      included = true;
-      return true;
-    }
-    else
-      // Here`expr' is unbounded in `*this'.
-      return false;
-  }
-  else {
-    // Here `expr' is a bounded difference.
-    if (num_vars == 0) {
-      // Dealing with a trivial expression.
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      return true;
-    }
-
-    // Select the cell to be checked.
-    const N& x = (coeff < 0) ? dbm[i][j] : dbm[j][i];
-    if (!is_plus_infinity(x)) {
-      // Compute the maximize/minimize of `expr'.
-      PPL_DIRTY_TEMP(N, d);
-      const Coefficient& b = expr.inhomogeneous_term();
-      PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-      neg_assign(minus_b, b);
-      const Coefficient& sc_b = maximize ? b : minus_b;
-      assign_r(d, sc_b, ROUND_UP);
-      // Set `coeff_expr' to the absolute value of coefficient of
-      // a variable in `expr'.
-      PPL_DIRTY_TEMP(N, coeff_expr);
-      PPL_ASSERT(i != 0);
-      const Coefficient& coeff_i = expr.get(Variable(i - 1));
-      const int sign_i = sgn(coeff_i);
-      if (sign_i > 0)
-        assign_r(coeff_expr, coeff_i, ROUND_UP);
-      else {
-        PPL_DIRTY_TEMP_COEFFICIENT(minus_coeff_i);
-        neg_assign(minus_coeff_i, coeff_i);
-        assign_r(coeff_expr, minus_coeff_i, ROUND_UP);
-      }
-      // Approximating the maximum/minimum of `expr'.
-      add_mul_assign_r(d, coeff_expr, x, ROUND_UP);
-      numer_denom(d, ext_n, ext_d);
-      if (!maximize)
-        neg_assign(ext_n);
-      included = true;
-      return true;
-    }
-
-    // `expr' is unbounded.
-    return false;
-  }
-}
-
-template <typename T>
-bool
-BD_Shape<T>::max_min(const Linear_Expression& expr,
-                     const bool maximize,
-                     Coefficient& ext_n, Coefficient& ext_d,
-                     bool& included,
-                     Generator& g) const {
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((maximize
-                                  ? "maximize(e, ...)"
-                                  : "minimize(e, ...)"), "e", expr);
-  // Deal with zero-dim BDS first.
-  if (space_dim == 0) {
-    if (marked_empty())
-      return false;
-    else {
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      g = point();
-      return true;
-    }
-  }
-
-  shortest_path_closure_assign();
-  // For an empty BDS we simply return false.
-  if (marked_empty())
-    return false;
-
-  Optimization_Mode mode_max_min
-    = maximize ? MAXIMIZATION : MINIMIZATION;
-  MIP_Problem mip(space_dim, constraints(), expr, mode_max_min);
-  if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
-    g = mip.optimizing_point();
-    mip.evaluate_objective_function(g, ext_n, ext_d);
-    included = true;
-    return true;
-  }
-  // Here `expr' is unbounded in `*this'.
-  return false;
-}
-
-template <typename T>
-Poly_Con_Relation
-BD_Shape<T>::relation_with(const Congruence& cg) const {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (cg.space_dimension() > space_dim)
-    throw_dimension_incompatible("relation_with(cg)", cg);
-
-  // If the congruence is an equality, find the relation with
-  // the equivalent equality constraint.
-  if (cg.is_equality()) {
-    Constraint c(cg);
-    return relation_with(c);
-  }
-
-  shortest_path_closure_assign();
-
-  if (marked_empty())
-    return Poly_Con_Relation::saturates()
-      && Poly_Con_Relation::is_included()
-      && Poly_Con_Relation::is_disjoint();
-
-  if (space_dim == 0) {
-    if (cg.is_inconsistent())
-      return Poly_Con_Relation::is_disjoint();
-    else
-      return Poly_Con_Relation::saturates()
-        && Poly_Con_Relation::is_included();
-  }
-
-  // Find the lower bound for a hyperplane with direction
-  // defined by the congruence.
-  Linear_Expression le = Linear_Expression(cg);
-  PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
-  bool min_included;
-  bool bounded_below = minimize(le, min_numer, min_denom, min_included);
-
-  // If there is no lower bound, then some of the hyperplanes defined by
-  // the congruence will strictly intersect the shape.
-  if (!bounded_below)
-    return Poly_Con_Relation::strictly_intersects();
-
-  // TODO: Consider adding a max_and_min() method, performing both
-  // maximization and minimization so as to possibly exploit
-  // incrementality of the MIP solver.
-
-  // Find the upper bound for a hyperplane with direction
-  // defined by the congruence.
-  PPL_DIRTY_TEMP_COEFFICIENT(max_numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(max_denom);
-  bool max_included;
-  bool bounded_above = maximize(le, max_numer, max_denom, max_included);
-
-  // If there is no upper bound, then some of the hyperplanes defined by
-  // the congruence will strictly intersect the shape.
-  if (!bounded_above)
-    return Poly_Con_Relation::strictly_intersects();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(signed_distance);
-
-  // Find the position value for the hyperplane that satisfies the congruence
-  // and is above the lower bound for the shape.
-  PPL_DIRTY_TEMP_COEFFICIENT(min_value);
-  min_value = min_numer / min_denom;
-  const Coefficient& modulus = cg.modulus();
-  signed_distance = min_value % modulus;
-  min_value -= signed_distance;
-  if (min_value * min_denom < min_numer)
-    min_value += modulus;
-
-  // Find the position value for the hyperplane that satisfies the congruence
-  // and is below the upper bound for the shape.
-  PPL_DIRTY_TEMP_COEFFICIENT(max_value);
-  max_value = max_numer / max_denom;
-  signed_distance = max_value % modulus;
-  max_value += signed_distance;
-  if (max_value * max_denom > max_numer)
-    max_value -= modulus;
-
-  // If the upper bound value is less than the lower bound value,
-  // then there is an empty intersection with the congruence;
-  // otherwise it will strictly intersect.
-  if (max_value < min_value)
-    return Poly_Con_Relation::is_disjoint();
-  else
-    return Poly_Con_Relation::strictly_intersects();
-}
-
-
-template <typename T>
-Poly_Con_Relation
-BD_Shape<T>::relation_with(const Constraint& c) const {
-  const dimension_type c_space_dim = c.space_dimension();
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dim)
-    throw_dimension_incompatible("relation_with(c)", c);
-
-  shortest_path_closure_assign();
-
-  if (marked_empty())
-    return Poly_Con_Relation::saturates()
-      && Poly_Con_Relation::is_included()
-      && Poly_Con_Relation::is_disjoint();
-
-  if (space_dim == 0) {
-    if ((c.is_equality() && c.inhomogeneous_term() != 0)
-        || (c.is_inequality() && c.inhomogeneous_term() < 0))
-      return Poly_Con_Relation::is_disjoint();
-    else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
-      // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
-      // thus, the zero-dimensional point also saturates it.
-      return Poly_Con_Relation::saturates()
-        && Poly_Con_Relation::is_disjoint();
-    else if (c.is_equality() || c.inhomogeneous_term() == 0)
-      return Poly_Con_Relation::saturates()
-        && Poly_Con_Relation::is_included();
-    else
-      // The zero-dimensional point saturates
-      // neither the positivity constraint 1 >= 0,
-      // nor the strict positivity constraint 1 > 0.
-      return Poly_Con_Relation::is_included();
-  }
-
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
-    // Constraints that are not bounded differences.
-    // Use maximize() and minimize() to do much of the work.
-
-    // Find the linear expression for the constraint and use that to
-    // find if the expression is bounded from above or below and if it
-    // is, find the maximum and minimum values.
-    Linear_Expression le(c);
-    le.set_inhomogeneous_term(Coefficient_zero());
-
-    PPL_DIRTY_TEMP(Coefficient, max_numer);
-    PPL_DIRTY_TEMP(Coefficient, max_denom);
-    bool max_included;
-    PPL_DIRTY_TEMP(Coefficient, min_numer);
-    PPL_DIRTY_TEMP(Coefficient, min_denom);
-    bool min_included;
-    bool bounded_above = maximize(le, max_numer, max_denom, max_included);
-    bool bounded_below = minimize(le, min_numer, min_denom, min_included);
-    if (!bounded_above) {
-      if (!bounded_below)
-        return Poly_Con_Relation::strictly_intersects();
-      min_numer += c.inhomogeneous_term() * min_denom;
-      switch (sgn(min_numer)) {
-      case 1:
-        if (c.is_equality())
-          return Poly_Con_Relation::is_disjoint();
-        return Poly_Con_Relation::is_included();
-      case 0:
-        if (c.is_strict_inequality() || c.is_equality())
-          return Poly_Con_Relation::strictly_intersects();
-        return Poly_Con_Relation::is_included();
-      case -1:
-        return Poly_Con_Relation::strictly_intersects();
-      }
-    }
-    if (!bounded_below) {
-      max_numer += c.inhomogeneous_term() * max_denom;
-      switch (sgn(max_numer)) {
-      case 1:
-        return Poly_Con_Relation::strictly_intersects();
-      case 0:
-        if (c.is_strict_inequality())
-          return Poly_Con_Relation::is_disjoint();
-        return Poly_Con_Relation::strictly_intersects();
-      case -1:
-        return Poly_Con_Relation::is_disjoint();
-      }
-    }
-    else {
-      max_numer += c.inhomogeneous_term() * max_denom;
-      min_numer += c.inhomogeneous_term() * min_denom;
-      switch (sgn(max_numer)) {
-      case 1:
-        switch (sgn(min_numer)) {
-        case 1:
-          if (c.is_equality())
-            return Poly_Con_Relation::is_disjoint();
-          return Poly_Con_Relation::is_included();
-        case 0:
-          if (c.is_equality())
-            return Poly_Con_Relation::strictly_intersects();
-          if (c.is_strict_inequality())
-            return Poly_Con_Relation::strictly_intersects();
-          return Poly_Con_Relation::is_included();
-        case -1:
-          return Poly_Con_Relation::strictly_intersects();
-        }
-        PPL_UNREACHABLE;
-        break;
-      case 0:
-        if (min_numer == 0) {
-          if (c.is_strict_inequality())
-            return Poly_Con_Relation::is_disjoint()
-              && Poly_Con_Relation::saturates();
-          return Poly_Con_Relation::is_included()
-            && Poly_Con_Relation::saturates();
-        }
-        if (c.is_strict_inequality())
-          return Poly_Con_Relation::is_disjoint();
-        return Poly_Con_Relation::strictly_intersects();
-      case -1:
-        return Poly_Con_Relation::is_disjoint();
-      }
-    }
-  }
-
-  // Constraints that are bounded differences.
-  if (num_vars == 0) {
-    // Dealing with a trivial constraint.
-    switch (sgn(c.inhomogeneous_term())) {
-    case -1:
-      return Poly_Con_Relation::is_disjoint();
-    case 0:
-      if (c.is_strict_inequality())
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_disjoint();
-      else
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_included();
-    case 1:
-      if (c.is_equality())
-        return Poly_Con_Relation::is_disjoint();
-      else
-        return Poly_Con_Relation::is_included();
-    }
-  }
-
-  // Select the cell to be checked for the "<=" part of the constraint,
-  // and set `coeff' to the absolute value of itself.
-  const bool negative = (coeff < 0);
-  const N& x = negative ? dbm[i][j] : dbm[j][i];
-  const N& y = negative ? dbm[j][i] : dbm[i][j];
-  if (negative)
-    neg_assign(coeff);
-  // Deduce the relation/s of the constraint `c' of the form
-  // `coeff*v - coeff*u </<=/== c.inhomogeneous_term()'
-  // with the respectively constraints in `*this'
-  // `-y <= v - u <= x'.
-  // Let `d == c.inhomogeneous_term()/coeff'
-  // and `d1 == -c.inhomogeneous_term()/coeff'.
-  // The following variables of mpq_class type are used to be precise
-  // when the bds is defined by integer constraints.
-  PPL_DIRTY_TEMP(mpq_class, q_x);
-  PPL_DIRTY_TEMP(mpq_class, q_y);
-  PPL_DIRTY_TEMP(mpq_class, d);
-  PPL_DIRTY_TEMP(mpq_class, d1);
-  PPL_DIRTY_TEMP(mpq_class, c_denom);
-  PPL_DIRTY_TEMP(mpq_class, q_denom);
-  assign_r(c_denom, coeff, ROUND_NOT_NEEDED);
-  assign_r(d, c.inhomogeneous_term(), ROUND_NOT_NEEDED);
-  neg_assign_r(d1, d, ROUND_NOT_NEEDED);
-  div_assign_r(d, d, c_denom, ROUND_NOT_NEEDED);
-  div_assign_r(d1, d1, c_denom, ROUND_NOT_NEEDED);
-
-  if (is_plus_infinity(x)) {
-    if (!is_plus_infinity(y)) {
-      // `*this' is in the following form:
-      // `-y <= v - u'.
-      // In this case `*this' is disjoint from `c' if
-      // `-y > d' (`-y >= d' if c is a strict equality), i.e. if
-      // `y < d1' (`y <= d1' if c is a strict equality).
-      PPL_DIRTY_TEMP_COEFFICIENT(numer);
-      PPL_DIRTY_TEMP_COEFFICIENT(denom);
-      numer_denom(y, numer, denom);
-      assign_r(q_denom, denom, ROUND_NOT_NEEDED);
-      assign_r(q_y, numer, ROUND_NOT_NEEDED);
-      div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
-      if (q_y < d1)
-        return Poly_Con_Relation::is_disjoint();
-      if (q_y == d1 && c.is_strict_inequality())
-        return Poly_Con_Relation::is_disjoint();
-    }
-
-    // In all other cases `*this' intersects `c'.
-    return Poly_Con_Relation::strictly_intersects();
-  }
-
-  // Here `x' is not plus-infinity.
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  numer_denom(x, numer, denom);
-  assign_r(q_denom, denom, ROUND_NOT_NEEDED);
-  assign_r(q_x, numer, ROUND_NOT_NEEDED);
-  div_assign_r(q_x, q_x, q_denom, ROUND_NOT_NEEDED);
-
-  if (!is_plus_infinity(y)) {
-    numer_denom(y, numer, denom);
-    assign_r(q_denom, denom, ROUND_NOT_NEEDED);
-    assign_r(q_y, numer, ROUND_NOT_NEEDED);
-    div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
-    if (q_x == d && q_y == d1) {
-      if (c.is_strict_inequality())
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_disjoint();
-      else
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_included();
-    }
-    // `*this' is disjoint from `c' when
-    // `-y > d' (`-y >= d' if c is a strict equality), i.e. if
-    // `y < d1' (`y <= d1' if c is a strict equality).
-    if (q_y < d1)
-      return Poly_Con_Relation::is_disjoint();
-    if (q_y == d1 && c.is_strict_inequality())
-      return Poly_Con_Relation::is_disjoint();
-  }
-
-  // Here `y' can be also plus-infinity.
-  // If `c' is an equality, `*this' is disjoint from `c' if
-  // `x < d'.
-  if (d > q_x) {
-    if (c.is_equality())
-      return Poly_Con_Relation::is_disjoint();
-    else
-      return Poly_Con_Relation::is_included();
-  }
-
-  if (d == q_x && c.is_nonstrict_inequality())
-    return Poly_Con_Relation::is_included();
-
-  // In all other cases `*this' intersects `c'.
-  return Poly_Con_Relation::strictly_intersects();
-}
-
-template <typename T>
-Poly_Gen_Relation
-BD_Shape<T>::relation_with(const Generator& g) const {
-  const dimension_type space_dim = space_dimension();
-  const dimension_type g_space_dim = g.space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim < g_space_dim)
-    throw_dimension_incompatible("relation_with(g)", g);
-
-  shortest_path_closure_assign();
-  // The empty BDS cannot subsume a generator.
-  if (marked_empty())
-    return Poly_Gen_Relation::nothing();
-
-  // A universe BDS in a zero-dimensional space subsumes
-  // all the generators of a zero-dimensional space.
-  if (space_dim == 0)
-    return Poly_Gen_Relation::subsumes();
-
-  const bool is_line = g.is_line();
-  const bool is_line_or_ray = g.is_line_or_ray();
-
-  // The relation between the BDS and the given generator is obtained
-  // checking if the generator satisfies all the constraints in the BDS.
-  // To check if the generator satisfies all the constraints it's enough
-  // studying the sign of the scalar product between the generator and
-  // all the constraints in the BDS.
-
-  // Allocation of temporaries done once and for all.
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  PPL_DIRTY_TEMP_COEFFICIENT(product);
-  // We find in `*this' all the constraints.
-  // TODO: This loop can be optimized more, if needed.
-  for (dimension_type i = 0; i <= space_dim; ++i) {
-    const Coefficient& g_coeff_y = (i > g_space_dim || i == 0)
-      ? Coefficient_zero() : g.coefficient(Variable(i-1));
-    const DB_Row<N>& dbm_i = dbm[i];
-    for (dimension_type j = i + 1; j <= space_dim; ++j) {
-      const Coefficient& g_coeff_x = (j > g_space_dim)
-        ? Coefficient_zero() : g.coefficient(Variable(j-1));
-      const N& dbm_ij = dbm_i[j];
-      const N& dbm_ji = dbm[j][i];
-      if (is_additive_inverse(dbm_ji, dbm_ij)) {
-        // We have one equality constraint: denom*x - denom*y = numer.
-        // Compute the scalar product.
-        numer_denom(dbm_ij, numer, denom);
-        product = g_coeff_y;
-        product -= g_coeff_x;
-        product *= denom;
-        if (!is_line_or_ray)
-          add_mul_assign(product, numer, g.divisor());
-        if (product != 0)
-          return Poly_Gen_Relation::nothing();
-      }
-      else {
-        // We have 0, 1 or 2 binary inequality constraint/s.
-        if (!is_plus_infinity(dbm_ij)) {
-          // We have the binary inequality constraint:
-          // denom*x - denom*y <= numer.
-          // Compute the scalar product.
-          numer_denom(dbm_ij, numer, denom);
-          product = g_coeff_y;
-          product -= g_coeff_x;
-          product *= denom;
-          if (!is_line_or_ray)
-            add_mul_assign(product, numer, g.divisor());
-          if (is_line) {
-            if (product != 0)
-              // Lines must saturate all constraints.
-              return Poly_Gen_Relation::nothing();
-          }
-          else
-            // `g' is either a ray, a point or a closure point.
-            if (product < 0)
-              return Poly_Gen_Relation::nothing();
-        }
-
-        if (!is_plus_infinity(dbm_ji)) {
-          // We have the binary inequality constraint: denom*y - denom*x <= b.
-          // Compute the scalar product.
-          numer_denom(dbm_ji, numer, denom);
-          product = 0;
-          add_mul_assign(product, denom, g_coeff_x);
-          add_mul_assign(product, -denom, g_coeff_y);
-          if (!is_line_or_ray)
-            add_mul_assign(product, numer, g.divisor());
-          if (is_line) {
-            if (product != 0)
-              // Lines must saturate all constraints.
-              return Poly_Gen_Relation::nothing();
-          }
-          else
-            // `g' is either a ray, a point or a closure point.
-            if (product < 0)
-              return Poly_Gen_Relation::nothing();
-        }
-      }
-    }
-  }
-
-  // The generator satisfies all the constraints.
-  return Poly_Gen_Relation::subsumes();
-}
-
-template <typename T>
-void
-BD_Shape<T>::shortest_path_closure_assign() const {
-  // Do something only if necessary.
-  if (marked_empty() || marked_shortest_path_closed())
-    return;
-  const dimension_type num_dimensions = space_dimension();
-  // Zero-dimensional BDSs are necessarily shortest-path closed.
-  if (num_dimensions == 0)
-    return;
-
-  // Even though the BDS will not change, its internal representation
-  // is going to be modified by the Floyd-Warshall algorithm.
-  BD_Shape& x = const_cast<BD_Shape<T>&>(*this);
-
-  // Fill the main diagonal with zeros.
-  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
-    PPL_ASSERT(is_plus_infinity(x.dbm[h][h]));
-    assign_r(x.dbm[h][h], 0, ROUND_NOT_NEEDED);
-  }
-
-  PPL_DIRTY_TEMP(N, sum);
-  for (dimension_type k = num_dimensions + 1; k-- > 0; ) {
-    const DB_Row<N>& x_dbm_k = x.dbm[k];
-    for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
-      DB_Row<N>& x_dbm_i = x.dbm[i];
-      const N& x_dbm_i_k = x_dbm_i[k];
-      if (!is_plus_infinity(x_dbm_i_k))
-        for (dimension_type j = num_dimensions + 1; j-- > 0; ) {
-          const N& x_dbm_k_j = x_dbm_k[j];
-          if (!is_plus_infinity(x_dbm_k_j)) {
-            // Rounding upward for correctness.
-            add_assign_r(sum, x_dbm_i_k, x_dbm_k_j, ROUND_UP);
-            min_assign(x_dbm_i[j], sum);
-          }
-        }
-    }
-  }
-
-  // Check for emptiness: the BDS is empty if and only if there is a
-  // negative value on the main diagonal of `dbm'.
-  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
-    N& x_dbm_hh = x.dbm[h][h];
-    if (sgn(x_dbm_hh) < 0) {
-      x.set_empty();
-      return;
-    }
-    else {
-      PPL_ASSERT(sgn(x_dbm_hh) == 0);
-      // Restore PLUS_INFINITY on the main diagonal.
-      assign_r(x_dbm_hh, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-
-  // The BDS is not empty and it is now shortest-path closed.
-  x.set_shortest_path_closed();
-}
-
-template <typename T>
-void
-BD_Shape<T>::incremental_shortest_path_closure_assign(Variable var) const {
-  // Do something only if necessary.
-  if (marked_empty() || marked_shortest_path_closed())
-    return;
-  const dimension_type num_dimensions = space_dimension();
-  PPL_ASSERT(var.id() < num_dimensions);
-
-  // Even though the BDS will not change, its internal representation
-  // is going to be modified by the incremental Floyd-Warshall algorithm.
-  BD_Shape& x = const_cast<BD_Shape&>(*this);
-
-  // Fill the main diagonal with zeros.
-  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
-    PPL_ASSERT(is_plus_infinity(x.dbm[h][h]));
-    assign_r(x.dbm[h][h], 0, ROUND_NOT_NEEDED);
-  }
-
-  // Using the incremental Floyd-Warshall algorithm.
-  PPL_DIRTY_TEMP(N, sum);
-  const dimension_type v = var.id() + 1;
-  DB_Row<N>& x_v = x.dbm[v];
-  // Step 1: Improve all constraints on variable `var'.
-  for (dimension_type k = num_dimensions + 1; k-- > 0; ) {
-    DB_Row<N>& x_k = x.dbm[k];
-    const N& x_v_k = x_v[k];
-    const N& x_k_v = x_k[v];
-    const bool x_v_k_finite = !is_plus_infinity(x_v_k);
-    const bool x_k_v_finite = !is_plus_infinity(x_k_v);
-    // Specialize inner loop based on finiteness info.
-    if (x_v_k_finite) {
-      if (x_k_v_finite) {
-        // Here both x_v_k and x_k_v are finite.
-        for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
-          DB_Row<N>& x_i = x.dbm[i];
-          const N& x_i_k = x_i[k];
-          if (!is_plus_infinity(x_i_k)) {
-            add_assign_r(sum, x_i_k, x_k_v, ROUND_UP);
-            min_assign(x_i[v], sum);
-          }
-          const N& x_k_i = x_k[i];
-          if (!is_plus_infinity(x_k_i)) {
-            add_assign_r(sum, x_v_k, x_k_i, ROUND_UP);
-            min_assign(x_v[i], sum);
-          }
-        }
-      }
-      else {
-        // Here x_v_k is finite, but x_k_v is not.
-        for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
-          const N& x_k_i = x_k[i];
-          if (!is_plus_infinity(x_k_i)) {
-            add_assign_r(sum, x_v_k, x_k_i, ROUND_UP);
-            min_assign(x_v[i], sum);
-          }
-        }
-      }
-    }
-    else if (x_k_v_finite) {
-      // Here x_v_k is infinite, but x_k_v is finite.
-      for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
-        DB_Row<N>& x_i = x.dbm[i];
-        const N& x_i_k = x_i[k];
-        if (!is_plus_infinity(x_i_k)) {
-          add_assign_r(sum, x_i_k, x_k_v, ROUND_UP);
-          min_assign(x_i[v], sum);
-        }
-      }
-    }
-    else
-      // Here both x_v_k and x_k_v are infinite.
-      continue;
-  }
-
-  // Step 2: improve the other bounds by using the precise bounds
-  // for the constraints on `var'.
-  for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
-    DB_Row<N>& x_i = x.dbm[i];
-    const N& x_i_v = x_i[v];
-    if (!is_plus_infinity(x_i_v)) {
-      for (dimension_type j = num_dimensions + 1; j-- > 0; ) {
-        const N& x_v_j = x_v[j];
-        if (!is_plus_infinity(x_v_j)) {
-          add_assign_r(sum, x_i_v, x_v_j, ROUND_UP);
-          min_assign(x_i[j], sum);
-        }
-      }
-    }
-  }
-
-  // Check for emptiness: the BDS is empty if and only if there is a
-  // negative value on the main diagonal of `dbm'.
-  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
-    N& x_dbm_hh = x.dbm[h][h];
-    if (sgn(x_dbm_hh) < 0) {
-      x.set_empty();
-      return;
-    }
-    else {
-      PPL_ASSERT(sgn(x_dbm_hh) == 0);
-      // Restore PLUS_INFINITY on the main diagonal.
-      assign_r(x_dbm_hh, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-
-  // The BDS is not empty and it is now shortest-path closed.
-  x.set_shortest_path_closed();
-}
-
-template <typename T>
-void
-BD_Shape<T>::shortest_path_reduction_assign() const {
-  // Do something only if necessary.
-  if (marked_shortest_path_reduced())
-    return;
-
-  const dimension_type space_dim = space_dimension();
-  // Zero-dimensional BDSs are necessarily reduced.
-  if (space_dim == 0)
-    return;
-
-  // First find the tightest constraints for this BDS.
-  shortest_path_closure_assign();
-
-  // If `*this' is empty, then there is nothing to reduce.
-  if (marked_empty())
-    return;
-
-  // Step 1: compute zero-equivalence classes.
-  // Variables corresponding to indices `i' and `j' are zero-equivalent
-  // if they lie on a zero-weight loop; since the matrix is shortest-path
-  // closed, this happens if and only if dbm[i][j] == -dbm[j][i].
-  std::vector<dimension_type> predecessor;
-  compute_predecessors(predecessor);
-  std::vector<dimension_type> leaders;
-  compute_leader_indices(predecessor, leaders);
-  const dimension_type num_leaders = leaders.size();
-
-  Bit_Matrix redundancy(space_dim + 1, space_dim + 1);
-  // Init all constraints to be redundant.
-  // TODO: provide an appropriate method to set multiple bits.
-  Bit_Row& red_0 = redundancy[0];
-  for (dimension_type j = space_dim + 1; j-- > 0; )
-    red_0.set(j);
-  for (dimension_type i = space_dim + 1; i-- > 0; )
-    redundancy[i] = red_0;
-
-  // Step 2: flag non-redundant constraints in the (zero-cycle-free)
-  // subsystem of bounded differences having only leaders as variables.
-  PPL_DIRTY_TEMP(N, c);
-  for (dimension_type l_i = 0; l_i < num_leaders; ++l_i) {
-    const dimension_type i = leaders[l_i];
-    const DB_Row<N>& dbm_i = dbm[i];
-    Bit_Row& redundancy_i = redundancy[i];
-    for (dimension_type l_j = 0; l_j < num_leaders; ++l_j) {
-      const dimension_type j = leaders[l_j];
-      if (redundancy_i[j]) {
-        const N& dbm_i_j = dbm_i[j];
-        redundancy_i.clear(j);
-        for (dimension_type l_k = 0; l_k < num_leaders; ++l_k) {
-          const dimension_type k = leaders[l_k];
-          add_assign_r(c, dbm_i[k], dbm[k][j], ROUND_UP);
-          if (dbm_i_j >= c) {
-            redundancy_i.set(j);
-            break;
-          }
-        }
-      }
-    }
-  }
-
-  // Step 3: flag non-redundant constraints in zero-equivalence classes.
-  // Each equivalence class must have a single 0-cycle connecting
-  // all the equivalent variables in increasing order.
-  std::deque<bool> dealt_with(space_dim + 1, false);
-  for (dimension_type i = space_dim + 1; i-- > 0; )
-    // We only need to deal with non-singleton zero-equivalence classes
-    // that haven't already been dealt with.
-    if (i != predecessor[i] && !dealt_with[i]) {
-      dimension_type j = i;
-      while (true) {
-        const dimension_type predecessor_j = predecessor[j];
-        if (j == predecessor_j) {
-          // We finally found the leader of `i'.
-          PPL_ASSERT(redundancy[i][j]);
-          redundancy[i].clear(j);
-          // Here we dealt with `j' (i.e., `predecessor_j'), but it is useless
-          // to update `dealt_with' because `j' is a leader.
-          break;
-        }
-        // We haven't found the leader of `i' yet.
-        PPL_ASSERT(redundancy[predecessor_j][j]);
-        redundancy[predecessor_j].clear(j);
-        dealt_with[predecessor_j] = true;
-        j = predecessor_j;
-      }
-    }
-
-  // Even though shortest-path reduction is not going to change the BDS,
-  // it might change its internal representation.
-  BD_Shape<T>& x = const_cast<BD_Shape<T>&>(*this);
-  using std::swap;
-  swap(x.redundancy_dbm, redundancy);
-  x.set_shortest_path_reduced();
-
-  PPL_ASSERT(is_shortest_path_reduced());
-}
-
-template <typename T>
-void
-BD_Shape<T>::upper_bound_assign(const BD_Shape& y) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("upper_bound_assign(y)", y);
-
-  // The upper bound of a BD shape `bd' with an empty shape is `bd'.
-  y.shortest_path_closure_assign();
-  if (y.marked_empty())
-    return;
-  shortest_path_closure_assign();
-  if (marked_empty()) {
-    *this = y;
-    return;
-  }
-
-  // The bds-hull consists in constructing `*this' with the maximum
-  // elements selected from `*this' and `y'.
-  PPL_ASSERT(space_dim == 0 || marked_shortest_path_closed());
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; ) {
-      N& dbm_ij = dbm_i[j];
-      const N& y_dbm_ij = y_dbm_i[j];
-      if (dbm_ij < y_dbm_ij)
-        dbm_ij = y_dbm_ij;
-    }
-  }
-  // Shortest-path closure is maintained (if it was holding).
-  // TODO: see whether reduction can be (efficiently!) maintained too.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-bool
-BD_Shape<T>::BFT00_upper_bound_assign_if_exact(const BD_Shape& y) {
-  // Declare a const reference to *this (to avoid accidental modifications).
-  const BD_Shape& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-
-  // Private method: the caller must ensure the following.
-  PPL_ASSERT(x_space_dim == y.space_dimension());
-
-  // The zero-dim case is trivial.
-  if (x_space_dim == 0) {
-    upper_bound_assign(y);
-    return true;
-  }
-  // If `x' or `y' is (known to be) empty, the upper bound is exact.
-  if (x.marked_empty()) {
-    *this = y;
-    return true;
-  }
-  else if (y.is_empty())
-    return true;
-  else if (x.is_empty()) {
-    *this = y;
-    return true;
-  }
-
-  // Here both `x' and `y' are known to be non-empty.
-  // Implementation based on Algorithm 4.1 (page 6) in [BemporadFT00TR],
-  // tailored to the special case of BD shapes.
-
-  Variable epsilon(x_space_dim);
-  Linear_Expression zero_expr;
-  zero_expr.set_space_dimension(x_space_dim + 1);
-  Linear_Expression db_expr;
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-
-  // Step 1: compute the constraint system for the envelope env(x,y)
-  // and put into x_cs_removed and y_cs_removed those non-redundant
-  // constraints that are not in the constraint system for env(x,y).
-  // While at it, also add the additional space dimension (epsilon).
-  Constraint_System env_cs;
-  Constraint_System x_cs_removed;
-  Constraint_System y_cs_removed;
-  x.shortest_path_reduction_assign();
-  y.shortest_path_reduction_assign();
-  for (dimension_type i = x_space_dim + 1; i-- > 0; ) {
-    const Bit_Row& x_red_i = x.redundancy_dbm[i];
-    const Bit_Row& y_red_i = y.redundancy_dbm[i];
-    const DB_Row<N>& x_dbm_i = x.dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    for (dimension_type j = x_space_dim + 1; j-- > 0; ) {
-      if (x_red_i[j] && y_red_i[j])
-        continue;
-      if (!x_red_i[j]) {
-        const N& x_dbm_ij = x_dbm_i[j];
-        PPL_ASSERT(!is_plus_infinity(x_dbm_ij));
-        numer_denom(x_dbm_ij, numer, denom);
-        // Build skeleton DB constraint (having the right space dimension).
-        db_expr = zero_expr;
-        if (i > 0)
-          db_expr += Variable(i-1);
-        if (j > 0)
-          db_expr -= Variable(j-1);
-        if (denom != 1)
-          db_expr *= denom;
-        db_expr += numer;
-        if (x_dbm_ij >= y_dbm_i[j])
-          env_cs.insert(db_expr >= 0);
-        else {
-          db_expr += epsilon;
-          x_cs_removed.insert(db_expr == 0);
-        }
-      }
-      if (!y_red_i[j]) {
-        const N& y_dbm_ij = y_dbm_i[j];
-        const N& x_dbm_ij = x_dbm_i[j];
-        PPL_ASSERT(!is_plus_infinity(y_dbm_ij));
-        numer_denom(y_dbm_ij, numer, denom);
-        // Build skeleton DB constraint (having the right space dimension).
-        db_expr = zero_expr;
-        if (i > 0)
-          db_expr += Variable(i-1);
-        if (j > 0)
-          db_expr -= Variable(j-1);
-        if (denom != 1)
-          db_expr *= denom;
-        db_expr += numer;
-        if (y_dbm_ij >= x_dbm_ij) {
-          // Check if same constraint was added when considering x_dbm_ij.
-          if (!x_red_i[j] && x_dbm_ij == y_dbm_ij)
-            continue;
-          env_cs.insert(db_expr >= 0);
-        }
-        else {
-          db_expr += epsilon;
-          y_cs_removed.insert(db_expr == 0);
-        }
-      }
-    }
-  }
-
-  if (x_cs_removed.empty())
-    // No constraint of x was removed: y is included in x.
-    return true;
-  if (y_cs_removed.empty()) {
-    // No constraint of y was removed: x is included in y.
-    *this = y;
-    return true;
-  }
-
-  // In preparation to Step 4: build the common part of LP problems,
-  // i.e., the constraints corresponding to env(x,y),
-  // where the additional space dimension (epsilon) has to be maximized.
-  MIP_Problem env_lp(x_space_dim + 1, env_cs, epsilon, MAXIMIZATION);
-  // Pre-solve `env_lp' to later exploit incrementality.
-  env_lp.solve();
-  PPL_ASSERT(env_lp.solve() != UNFEASIBLE_MIP_PROBLEM);
-
-  // Implementing loop in Steps 3-6.
-  for (Constraint_System::const_iterator i = x_cs_removed.begin(),
-         i_end = x_cs_removed.end(); i != i_end; ++i) {
-    MIP_Problem lp_i(env_lp);
-    lp_i.add_constraint(*i);
-    // Pre-solve to exploit incrementality.
-    if (lp_i.solve() == UNFEASIBLE_MIP_PROBLEM)
-      continue;
-    for (Constraint_System::const_iterator j = y_cs_removed.begin(),
-           j_end = y_cs_removed.end(); j != j_end; ++j) {
-      MIP_Problem lp_ij(lp_i);
-      lp_ij.add_constraint(*j);
-      // Solve and check for a positive optimal value.
-      switch (lp_ij.solve()) {
-      case UNFEASIBLE_MIP_PROBLEM:
-        // CHECKME: is the following actually impossible?
-        PPL_UNREACHABLE;
-        return false;
-      case UNBOUNDED_MIP_PROBLEM:
-        return false;
-      case OPTIMIZED_MIP_PROBLEM:
-        lp_ij.optimal_value(numer, denom);
-        if (numer > 0)
-          return false;
-        break;
-      }
-    }
-  }
-
-  // The upper bound of x and y is indeed exact.
-  upper_bound_assign(y);
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename T>
-template <bool integer_upper_bound>
-bool
-BD_Shape<T>::BHZ09_upper_bound_assign_if_exact(const BD_Shape& y) {
-  PPL_COMPILE_TIME_CHECK(!integer_upper_bound
-                         || std::numeric_limits<T>::is_integer,
-                         "BD_Shape<T>::BHZ09_upper_bound_assign_if_exact(y):"
-                         " instantiating for integer upper bound,"
-                         " but T in not an integer datatype.");
-
-  // FIXME, CHECKME: what about inexact computations?
-  // Declare a const reference to *this (to avoid accidental modifications).
-  const BD_Shape& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-
-  // Private method: the caller must ensure the following.
-  PPL_ASSERT(x_space_dim == y.space_dimension());
-
-  // The zero-dim case is trivial.
-  if (x_space_dim == 0) {
-    upper_bound_assign(y);
-    return true;
-  }
-  // If `x' or `y' is (known to be) empty, the upper bound is exact.
-  if (x.marked_empty()) {
-    *this = y;
-    return true;
-  }
-  else if (y.is_empty())
-    return true;
-  else if (x.is_empty()) {
-    *this = y;
-    return true;
-  }
-
-  // Here both `x' and `y' are known to be non-empty.
-  x.shortest_path_reduction_assign();
-  y.shortest_path_reduction_assign();
-  PPL_ASSERT(x.marked_shortest_path_closed());
-  PPL_ASSERT(y.marked_shortest_path_closed());
-  // Pre-compute the upper bound of `x' and `y'.
-  BD_Shape<T> ub(x);
-  ub.upper_bound_assign(y);
-
-  PPL_DIRTY_TEMP(N, lhs);
-  PPL_DIRTY_TEMP(N, rhs);
-  PPL_DIRTY_TEMP(N, temp_zero);
-  assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
-  PPL_DIRTY_TEMP(N, temp_one);
-  if (integer_upper_bound)
-    assign_r(temp_one, 1, ROUND_NOT_NEEDED);
-
-  for (dimension_type i = x_space_dim + 1; i-- > 0; ) {
-    const DB_Row<N>& x_i = x.dbm[i];
-    const Bit_Row& x_red_i = x.redundancy_dbm[i];
-    const DB_Row<N>& y_i = y.dbm[i];
-    const DB_Row<N>& ub_i = ub.dbm[i];
-    for (dimension_type j = x_space_dim + 1; j-- > 0; ) {
-      // Check redundancy of x_i_j.
-      if (x_red_i[j])
-        continue;
-      // By non-redundancy, we know that i != j.
-      PPL_ASSERT(i != j);
-      const N& x_i_j = x_i[j];
-      if (x_i_j < y_i[j]) {
-        for (dimension_type k = x_space_dim + 1; k-- > 0; ) {
-          const DB_Row<N>& x_k = x.dbm[k];
-          const DB_Row<N>& y_k = y.dbm[k];
-          const Bit_Row& y_red_k = y.redundancy_dbm[k];
-          const DB_Row<N>& ub_k = ub.dbm[k];
-          const N& ub_k_j = (k == j) ? temp_zero : ub_k[j];
-          for (dimension_type ell = x_space_dim + 1; ell-- > 0; ) {
-            // Check redundancy of y_k_ell.
-            if (y_red_k[ell])
-              continue;
-            // By non-redundancy, we know that k != ell.
-            PPL_ASSERT(k != ell);
-            const N& y_k_ell = y_k[ell];
-            if (y_k_ell < x_k[ell]) {
-              // The first condition in BHZ09 theorem holds;
-              // now check for the second condition.
-              add_assign_r(lhs, x_i_j, y_k_ell, ROUND_UP);
-              const N& ub_i_ell = (i == ell) ? temp_zero : ub_i[ell];
-              add_assign_r(rhs, ub_i_ell, ub_k_j, ROUND_UP);
-              if (integer_upper_bound) {
-                // Note: adding 1 rather than 2 (as in Theorem 5.3)
-                // so as to later test for < rather than <=.
-                add_assign_r(lhs, lhs, temp_one, ROUND_NOT_NEEDED);
-              }
-              // Testing for < in both the rational and integer case.
-              if (lhs < rhs)
-                return false;
-            }
-          }
-        }
-      }
-    }
-  }
-  // The upper bound of x and y is indeed exact.
-  m_swap(ub);
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename T>
-void
-BD_Shape<T>::difference_assign(const BD_Shape& y) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("difference_assign(y)", y);
-
-  BD_Shape new_bd_shape(space_dim, EMPTY);
-
-  BD_Shape& x = *this;
-
-  x.shortest_path_closure_assign();
-  // The difference of an empty bounded difference shape
-  // and of a bounded difference shape `p' is empty.
-  if (x.marked_empty())
-    return;
-  y.shortest_path_closure_assign();
-  // The difference of a bounded difference shape `p'
-  // and an empty bounded difference shape is `p'.
-  if (y.marked_empty())
-    return;
-
-  // If both bounded difference shapes are zero-dimensional,
-  // then at this point they are necessarily universe system of
-  // bounded differences, so that their difference is empty.
-  if (space_dim == 0) {
-    x.set_empty();
-    return;
-  }
-
-  // TODO: This is just an executable specification.
-  //       Have to find a more efficient method.
-  if (y.contains(x)) {
-    x.set_empty();
-    return;
-  }
-
-  // We take a constraint of the system y at the time and we
-  // consider its complementary. Then we intersect the union
-  // of these complementary constraints with the system x.
-  const Constraint_System& y_cs = y.constraints();
-  for (Constraint_System::const_iterator i = y_cs.begin(),
-         y_cs_end = y_cs.end(); i != y_cs_end; ++i) {
-    const Constraint& c = *i;
-    // If the bounded difference shape `x' is included
-    // in the bounded difference shape defined by `c',
-    // then `c' _must_ be skipped, as adding its complement to `x'
-    // would result in the empty bounded difference shape,
-    // and as we would obtain a result that is less precise
-    // than the bds-difference.
-    if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
-      continue;
-    BD_Shape z = x;
-    const Linear_Expression e = Linear_Expression(c);
-    z.add_constraint(e <= 0);
-    if (!z.is_empty())
-      new_bd_shape.upper_bound_assign(z);
-    if (c.is_equality()) {
-      z = x;
-      z.add_constraint(e >= 0);
-      if (!z.is_empty())
-        new_bd_shape.upper_bound_assign(z);
-    }
-  }
-  *this = new_bd_shape;
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-bool
-BD_Shape<T>::simplify_using_context_assign(const BD_Shape& y) {
-  BD_Shape& x = *this;
-  const dimension_type dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (dim != y.space_dimension())
-    throw_dimension_incompatible("simplify_using_context_assign(y)", y);
-
-  // Filter away the zero-dimensional case.
-  if (dim == 0) {
-    if (y.marked_empty()) {
-      x.set_zero_dim_univ();
-      return false;
-    }
-    else
-      return !x.marked_empty();
-  }
-
-  // Filter away the case where `x' contains `y'
-  // (this subsumes the case when `y' is empty).
-  y.shortest_path_closure_assign();
-  if (x.contains(y)) {
-    BD_Shape<T> res(dim, UNIVERSE);
-    x.m_swap(res);
-    return false;
-  }
-
-  // Filter away the case where `x' is empty.
-  x.shortest_path_closure_assign();
-  if (x.marked_empty()) {
-    // Search for a constraint of `y' that is not a tautology.
-    dimension_type i;
-    dimension_type j;
-    // Prefer unary constraints.
-    i = 0;
-    const DB_Row<N>& y_dbm_0 = y.dbm[0];
-    for (j = 1; j <= dim; ++j) {
-      if (!is_plus_infinity(y_dbm_0[j]))
-        // FIXME: if N is a float or bounded integer type, then
-        // we also need to check that we are actually able to construct
-        // a constraint inconsistent with respect to this one.
-        goto found;
-    }
-    j = 0;
-    for (i = 1; i <= dim; ++i) {
-      if (!is_plus_infinity(y.dbm[i][0]))
-        // FIXME: if N is a float or bounded integer type, then
-        // we also need to check that we are actually able to construct
-        // a constraint inconsistent with respect to this one.
-        goto found;
-    }
-    // Then search binary constraints.
-    for (i = 1; i <= dim; ++i) {
-      const DB_Row<N>& y_dbm_i = y.dbm[i];
-      for (j = 1; j <= dim; ++j)
-        if (!is_plus_infinity(y_dbm_i[j]))
-          // FIXME: if N is a float or bounded integer type, then
-          // we also need to check that we are actually able to construct
-          // a constraint inconsistent with respect to this one.
-          goto found;
-    }
-    // Not found: we were not able to build a constraint contradicting
-    // one of the constraints in `y': `x' cannot be enlarged.
-    return false;
-
-  found:
-    // Found: build a new BDS contradicting the constraint found.
-    PPL_ASSERT(i <= dim && j <= dim && (i > 0 || j > 0));
-    BD_Shape<T> res(dim, UNIVERSE);
-    PPL_DIRTY_TEMP(N, tmp);
-    assign_r(tmp, 1, ROUND_UP);
-    add_assign_r(tmp, tmp, y.dbm[i][j], ROUND_UP);
-    PPL_ASSERT(!is_plus_infinity(tmp));
-    // CHECKME: round down is really meant.
-    neg_assign_r(res.dbm[j][i], tmp, ROUND_DOWN);
-    x.m_swap(res);
-    return false;
-  }
-
-  // Here `x' and `y' are not empty and shortest-path closed;
-  // also, `x' does not contain `y'.
-  // Let `target' be the intersection of `x' and `y'.
-  BD_Shape<T> target = x;
-  target.intersection_assign(y);
-  const bool bool_result = !target.is_empty();
-
-  // Compute a reduced dbm for `x' and ...
-  x.shortest_path_reduction_assign();
-  // ... count the non-redundant constraints.
-  dimension_type x_num_non_redundant = (dim+1)*(dim+1);
-  for (dimension_type i = dim + 1; i-- > 0; )
-    x_num_non_redundant -= x.redundancy_dbm[i].count_ones();
-  PPL_ASSERT(x_num_non_redundant > 0);
-
-  // Let `yy' be a copy of `y': we will keep adding to `yy'
-  // the non-redundant constraints of `x',
-  // stopping as soon as `yy' becomes equal to `target'.
-  BD_Shape<T> yy = y;
-
-  // The constraints added to `yy' will be recorded in `res' ...
-  BD_Shape<T> res(dim, UNIVERSE);
-  // ... and we will count them too.
-  dimension_type res_num_non_redundant = 0;
-
-  // Compute leader information for `x'.
-  std::vector<dimension_type> x_leaders;
-  x.compute_leaders(x_leaders);
-
-  // First go through the unary equality constraints.
-  const DB_Row<N>& x_dbm_0 = x.dbm[0];
-  DB_Row<N>& yy_dbm_0 = yy.dbm[0];
-  DB_Row<N>& res_dbm_0 = res.dbm[0];
-  for (dimension_type j = 1; j <= dim; ++j) {
-    // Unary equality constraints are encoded in entries dbm_0j and dbm_j0
-    // provided index j has special variable index 0 as its leader.
-    if (x_leaders[j] != 0)
-      continue;
-    PPL_ASSERT(!is_plus_infinity(x_dbm_0[j]));
-    if (x_dbm_0[j] < yy_dbm_0[j]) {
-      res_dbm_0[j] = x_dbm_0[j];
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy_dbm_0[j] = x_dbm_0[j];
-      yy.reset_shortest_path_closed();
-    }
-    PPL_ASSERT(!is_plus_infinity(x.dbm[j][0]));
-    if (x.dbm[j][0] < yy.dbm[j][0]) {
-      res.dbm[j][0] = x.dbm[j][0];
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy.dbm[j][0] = x.dbm[j][0];
-      yy.reset_shortest_path_closed();
-    }
-    // Restore shortest-path closure, if it was lost.
-    if (!yy.marked_shortest_path_closed()) {
-      Variable var_j(j-1);
-      yy.incremental_shortest_path_closure_assign(var_j);
-      if (target.contains(yy)) {
-        // Target reached: swap `x' and `res' if needed.
-        if (res_num_non_redundant < x_num_non_redundant) {
-          res.reset_shortest_path_closed();
-          x.m_swap(res);
-        }
-        return bool_result;
-      }
-    }
-  }
-
-  // Go through the binary equality constraints.
-  // Note: no need to consider the case i == 1.
-  for (dimension_type i = 2; i <= dim; ++i) {
-    const dimension_type j = x_leaders[i];
-    if (j == i || j == 0)
-      continue;
-    PPL_ASSERT(!is_plus_infinity(x.dbm[i][j]));
-    if (x.dbm[i][j] < yy.dbm[i][j]) {
-      res.dbm[i][j] = x.dbm[i][j];
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy.dbm[i][j] = x.dbm[i][j];
-      yy.reset_shortest_path_closed();
-    }
-    PPL_ASSERT(!is_plus_infinity(x.dbm[j][i]));
-    if (x.dbm[j][i] < yy.dbm[j][i]) {
-      res.dbm[j][i] = x.dbm[j][i];
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy.dbm[j][i] = x.dbm[j][i];
-      yy.reset_shortest_path_closed();
-    }
-    // Restore shortest-path closure, if it was lost.
-    if (!yy.marked_shortest_path_closed()) {
-      Variable var_j(j-1);
-      yy.incremental_shortest_path_closure_assign(var_j);
-      if (target.contains(yy)) {
-        // Target reached: swap `x' and `res' if needed.
-        if (res_num_non_redundant < x_num_non_redundant) {
-          res.reset_shortest_path_closed();
-          x.m_swap(res);
-        }
-        return bool_result;
-      }
-    }
-  }
-
-  // Finally go through the (proper) inequality constraints:
-  // both indices i and j should be leaders.
-  for (dimension_type i = 0; i <= dim; ++i) {
-    if (i != x_leaders[i])
-      continue;
-    const DB_Row<N>& x_dbm_i = x.dbm[i];
-    const Bit_Row& x_redundancy_dbm_i = x.redundancy_dbm[i];
-    DB_Row<N>& yy_dbm_i = yy.dbm[i];
-    DB_Row<N>& res_dbm_i = res.dbm[i];
-    for (dimension_type j = 0; j <= dim; ++j) {
-      if (j != x_leaders[j] || x_redundancy_dbm_i[j])
-        continue;
-      N& yy_dbm_ij = yy_dbm_i[j];
-      const N& x_dbm_ij = x_dbm_i[j];
-      if (x_dbm_ij < yy_dbm_ij) {
-        res_dbm_i[j] = x_dbm_ij;
-        ++res_num_non_redundant;
-        // Tighten context `yy' using the newly added constraint.
-        yy_dbm_ij = x_dbm_ij;
-        yy.reset_shortest_path_closed();
-        PPL_ASSERT(i > 0 || j > 0);
-        Variable var(((i > 0) ? i : j) - 1);
-        yy.incremental_shortest_path_closure_assign(var);
-        if (target.contains(yy)) {
-          // Target reached: swap `x' and `res' if needed.
-          if (res_num_non_redundant < x_num_non_redundant) {
-            res.reset_shortest_path_closed();
-            x.m_swap(res);
-          }
-          return bool_result;
-        }
-      }
-    }
-  }
-  // This point should be unreachable.
-  PPL_UNREACHABLE;
-  return false;
-}
-
-template <typename T>
-void
-BD_Shape<T>::add_space_dimensions_and_embed(const dimension_type m) {
-  // Adding no dimensions is a no-op.
-  if (m == 0)
-    return;
-
-  const dimension_type space_dim = space_dimension();
-  const dimension_type new_space_dim = space_dim + m;
-  const bool was_zero_dim_univ = (!marked_empty() && space_dim == 0);
-
-  // To embed an n-dimension space BDS in a (n+m)-dimension space,
-  // we just add `m' rows and columns in the bounded difference shape,
-  // initialized to PLUS_INFINITY.
-  dbm.grow(new_space_dim + 1);
-
-  // Shortest-path closure is maintained (if it was holding).
-  // TODO: see whether reduction can be (efficiently!) maintained too.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-
-  // If `*this' was the zero-dim space universe BDS,
-  // the we can set the shortest-path closure flag.
-  if (was_zero_dim_univ)
-    set_shortest_path_closed();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::add_space_dimensions_and_project(const dimension_type m) {
-  // Adding no dimensions is a no-op.
-  if (m == 0)
-    return;
-
-  const dimension_type space_dim = space_dimension();
-
-  // If `*this' was zero-dimensional, then we add `m' rows and columns.
-  // If it also was non-empty, then we zero all the added elements
-  // and set the flag for shortest-path closure.
-  if (space_dim == 0) {
-    dbm.grow(m + 1);
-    if (!marked_empty()) {
-      for (dimension_type i = m + 1; i-- > 0; ) {
-        DB_Row<N>& dbm_i = dbm[i];
-        for (dimension_type j = m + 1; j-- > 0; )
-          if (i != j)
-            assign_r(dbm_i[j], 0, ROUND_NOT_NEEDED);
-      }
-      set_shortest_path_closed();
-    }
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // To project an n-dimension space bounded difference shape
-  // in a (n+m)-dimension space, we add `m' rows and columns.
-  // In the first row and column of the matrix we add `zero' from
-  // the (n+1)-th position to the end.
-  const dimension_type new_space_dim = space_dim + m;
-  dbm.grow(new_space_dim + 1);
-
-  // Bottom of the matrix and first row.
-  DB_Row<N>& dbm_0 = dbm[0];
-  for (dimension_type i = space_dim + 1; i <= new_space_dim; ++i) {
-    assign_r(dbm[i][0], 0, ROUND_NOT_NEEDED);
-    assign_r(dbm_0[i], 0, ROUND_NOT_NEEDED);
-  }
-
-  if (marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::remove_space_dimensions(const Variables_Set& vars) {
-  // The removal of no dimensions from any BDS is a no-op.
-  // Note that this case also captures the only legal removal of
-  // space dimensions from a BDS in a 0-dim space.
-  if (vars.empty()) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  const dimension_type old_space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (old_space_dim < min_space_dim)
-    throw_dimension_incompatible("remove_space_dimensions(vs)", min_space_dim);
-
-  // Shortest-path closure is necessary to keep precision.
-  shortest_path_closure_assign();
-
-  // When removing _all_ dimensions from a BDS, we obtain the
-  // zero-dimensional BDS.
-  const dimension_type new_space_dim = old_space_dim - vars.size();
-  if (new_space_dim == 0) {
-    dbm.resize_no_copy(1);
-    if (!marked_empty())
-      // We set the zero_dim_univ flag.
-      set_zero_dim_univ();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Handle the case of an empty BD_Shape.
-  if (marked_empty()) {
-    dbm.resize_no_copy(new_space_dim + 1);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Shortest-path closure is maintained.
-  // TODO: see whether reduction can be (efficiently!) maintained too.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-
-  // For each variable to remove, we fill the corresponding column and
-  // row by shifting respectively left and above those
-  // columns and rows, that will not be removed.
-  Variables_Set::const_iterator vsi = vars.begin();
-  Variables_Set::const_iterator vsi_end = vars.end();
-  dimension_type dst = *vsi + 1;
-  dimension_type src = dst + 1;
-  for (++vsi; vsi != vsi_end; ++vsi) {
-    const dimension_type vsi_next = *vsi + 1;
-    // All other columns and rows are moved respectively to the left
-    // and above.
-    while (src < vsi_next) {
-      using std::swap;
-      swap(dbm[dst], dbm[src]);
-      for (dimension_type i = old_space_dim + 1; i-- > 0; ) {
-        DB_Row<N>& dbm_i = dbm[i];
-        assign_or_swap(dbm_i[dst], dbm_i[src]);
-      }
-      ++dst;
-      ++src;
-    }
-    ++src;
-  }
-
-  // Moving the remaining rows and columns.
-  while (src <= old_space_dim) {
-    using std::swap;
-    swap(dbm[dst], dbm[src]);
-    for (dimension_type i = old_space_dim + 1; i-- > 0; ) {
-      DB_Row<N>& dbm_i = dbm[i];
-      assign_or_swap(dbm_i[dst], dbm_i[src]);
-    }
-    ++src;
-    ++dst;
-  }
-
-  // Update the space dimension.
-  dbm.resize_no_copy(new_space_dim + 1);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Partial_Function>
-void
-BD_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
-  const dimension_type space_dim = space_dimension();
-  // TODO: this implementation is just an executable specification.
-  if (space_dim == 0)
-    return;
-
-  if (pfunc.has_empty_codomain()) {
-    // All dimensions vanish: the BDS becomes zero_dimensional.
-    remove_higher_space_dimensions(0);
-    return;
-  }
-
-  const dimension_type new_space_dim = pfunc.max_in_codomain() + 1;
-  // If we are going to actually reduce the space dimension,
-  // then shortest-path closure is required to keep precision.
-  if (new_space_dim < space_dim)
-    shortest_path_closure_assign();
-
-  // If the BDS is empty, then it is sufficient to adjust the
-  // space dimension of the bounded difference shape.
-  if (marked_empty()) {
-    remove_higher_space_dimensions(new_space_dim);
-    return;
-  }
-
-  // Shortest-path closure is maintained (if it was holding).
-  // TODO: see whether reduction can be (efficiently!) maintained too.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-
-  // We create a new matrix with the new space dimension.
-  DB_Matrix<N> x(new_space_dim+1);
-  // First of all we must map the unary constraints, because
-  // there is the fictitious variable `zero', that can't be mapped
-  // at all.
-  DB_Row<N>& dbm_0 = dbm[0];
-  DB_Row<N>& x_0 = x[0];
-  for (dimension_type j = 1; j <= space_dim; ++j) {
-    dimension_type new_j;
-    if (pfunc.maps(j - 1, new_j)) {
-      assign_or_swap(x_0[new_j + 1], dbm_0[j]);
-      assign_or_swap(x[new_j + 1][0], dbm[j][0]);
-    }
-  }
-  // Now we map the binary constraints, exchanging the indexes.
-  for (dimension_type i = 1; i <= space_dim; ++i) {
-    dimension_type new_i;
-    if (pfunc.maps(i - 1, new_i)) {
-      DB_Row<N>& dbm_i = dbm[i];
-      ++new_i;
-      DB_Row<N>& x_new_i = x[new_i];
-      for (dimension_type j = i+1; j <= space_dim; ++j) {
-        dimension_type new_j;
-        if (pfunc.maps(j - 1, new_j)) {
-          ++new_j;
-          assign_or_swap(x_new_i[new_j], dbm_i[j]);
-          assign_or_swap(x[new_j][new_i], dbm[j][i]);
-        }
-      }
-    }
-  }
-
-  using std::swap;
-  swap(dbm, x);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::intersection_assign(const BD_Shape& y) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("intersection_assign(y)", y);
-
-  // If one of the two bounded difference shapes is empty,
-  // the intersection is empty.
-  if (marked_empty())
-    return;
-  if (y.marked_empty()) {
-    set_empty();
-    return;
-  }
-
-  // If both bounded difference shapes are zero-dimensional,
-  // then at this point they are necessarily non-empty,
-  // so that their intersection is non-empty too.
-  if (space_dim == 0)
-    return;
-
-  // To intersect two bounded difference shapes we compare
-  // the constraints and we choose the less values.
-  bool changed = false;
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; ) {
-      N& dbm_ij = dbm_i[j];
-      const N& y_dbm_ij = y_dbm_i[j];
-      if (dbm_ij > y_dbm_ij) {
-        dbm_ij = y_dbm_ij;
-        changed = true;
-      }
-    }
-  }
-
-  if (changed && marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Iterator>
-void
-BD_Shape<T>::CC76_extrapolation_assign(const BD_Shape& y,
-                                       Iterator first, Iterator last,
-                                       unsigned* tp) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("CC76_extrapolation_assign(y)", y);
-
-  // We assume that `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If both bounded difference shapes are zero-dimensional,
-  // since `*this' contains `y', we simply return `*this'.
-  if (space_dim == 0)
-    return;
-
-  shortest_path_closure_assign();
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  y.shortest_path_closure_assign();
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  // If there are tokens available, work on a temporary copy.
-  if (tp != 0 && *tp > 0) {
-    BD_Shape<T> x_tmp(*this);
-    x_tmp.CC76_extrapolation_assign(y, first, last, 0);
-    // If the widening was not precise, use one of the available tokens.
-    if (!contains(x_tmp))
-      --(*tp);
-    return;
-  }
-
-  // Compare each constraint in `y' to the corresponding one in `*this'.
-  // The constraint in `*this' is kept as is if it is stronger than or
-  // equal to the constraint in `y'; otherwise, the inhomogeneous term
-  // of the constraint in `*this' is further compared with elements taken
-  // from a sorted container (the stop-points, provided by the user), and
-  // is replaced by the first entry, if any, which is greater than or equal
-  // to the inhomogeneous term. If no such entry exists, the constraint
-  // is removed altogether.
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; ) {
-      N& dbm_ij = dbm_i[j];
-      const N& y_dbm_ij = y_dbm_i[j];
-      if (y_dbm_ij < dbm_ij) {
-        Iterator k = std::lower_bound(first, last, dbm_ij);
-        if (k != last) {
-          if (dbm_ij < *k)
-            assign_r(dbm_ij, *k, ROUND_UP);
-        }
-        else
-          assign_r(dbm_ij, PLUS_INFINITY, ROUND_NOT_NEEDED);
-      }
-    }
-  }
-  reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::get_limiting_shape(const Constraint_System& cs,
-                                BD_Shape& limiting_shape) const {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(cs.space_dimension() <= space_dimension());
-
-  shortest_path_closure_assign();
-  bool changed = false;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_c_term);
-  PPL_DIRTY_TEMP(N, d);
-  PPL_DIRTY_TEMP(N, d1);
-  for (Constraint_System::const_iterator cs_i = cs.begin(),
-         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
-    const Constraint& c = *cs_i;
-    dimension_type num_vars = 0;
-    dimension_type i = 0;
-    dimension_type j = 0;
-    // Constraints that are not bounded differences are ignored.
-    if (BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
-      // Select the cell to be modified for the "<=" part of the constraint,
-      // and set `coeff' to the absolute value of itself.
-      const bool negative = (coeff < 0);
-      const N& x = negative ? dbm[i][j] : dbm[j][i];
-      const N& y = negative ? dbm[j][i] : dbm[i][j];
-      DB_Matrix<N>& ls_dbm = limiting_shape.dbm;
-      if (negative)
-        neg_assign(coeff);
-      // Compute the bound for `x', rounding towards plus infinity.
-      div_round_up(d, c.inhomogeneous_term(), coeff);
-      if (x <= d) {
-        if (c.is_inequality()) {
-          N& ls_x = negative ? ls_dbm[i][j] : ls_dbm[j][i];
-          if (ls_x > d) {
-            ls_x = d;
-            changed = true;
-          }
-	}
-        else {
-          // Compute the bound for `y', rounding towards plus infinity.
-          neg_assign(minus_c_term, c.inhomogeneous_term());
-          div_round_up(d1, minus_c_term, coeff);
-          if (y <= d1) {
-            N& ls_x = negative ? ls_dbm[i][j] : ls_dbm[j][i];
-            N& ls_y = negative ? ls_dbm[j][i] : ls_dbm[i][j];
-	    if ((ls_x >= d && ls_y > d1) || (ls_x > d && ls_y >= d1)) {
-	      ls_x = d;
-	      ls_y = d1;
-	      changed = true;
-            }
-          }
-        }
-      }
-    }
-  }
-
-  // In general, adding a constraint does not preserve the shortest-path
-  // closure of the bounded difference shape.
-  if (changed && limiting_shape.marked_shortest_path_closed())
-    limiting_shape.reset_shortest_path_closed();
-}
-
-template <typename T>
-void
-BD_Shape<T>::limited_CC76_extrapolation_assign(const BD_Shape& y,
-                                               const Constraint_System& cs,
-                                               unsigned* tp) {
-  // Dimension-compatibility check.
-  const dimension_type space_dim = space_dimension();
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)",
-                                 y);
-
-  // `cs' must be dimension-compatible with the two systems
-  // of bounded differences.
-  const dimension_type cs_space_dim = cs.space_dimension();
-  if (space_dim < cs_space_dim)
-    throw_invalid_argument("limited_CC76_extrapolation_assign(y, cs)",
-                           "cs is space_dimension incompatible");
-
-  // Strict inequalities not allowed.
-  if (cs.has_strict_inequalities())
-    throw_invalid_argument("limited_CC76_extrapolation_assign(y, cs)",
-                           "cs has strict inequalities");
-
-  // The limited CC76-extrapolation between two systems of bounded
-  // differences in a zero-dimensional space is a system of bounded
-  // differences in a zero-dimensional space, too.
-  if (space_dim == 0)
-    return;
-
-  // We assume that `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  BD_Shape<T> limiting_shape(space_dim, UNIVERSE);
-  get_limiting_shape(cs, limiting_shape);
-  CC76_extrapolation_assign(y, tp);
-  intersection_assign(limiting_shape);
-}
-
-template <typename T>
-void
-BD_Shape<T>::BHMZ05_widening_assign(const BD_Shape& y, unsigned* tp) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("BHMZ05_widening_assign(y)", y);
-
-  // We assume that `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // Compute the affine dimension of `y'.
-  const dimension_type y_affine_dim = y.affine_dimension();
-  // If the affine dimension of `y' is zero, then either `y' is
-  // zero-dimensional, or it is empty, or it is a singleton.
-  // In all cases, due to the inclusion hypothesis, the result is `*this'.
-  if (y_affine_dim == 0)
-    return;
-
-  // If the affine dimension has changed, due to the inclusion hypothesis,
-  // the result is `*this'.
-  const dimension_type x_affine_dim = affine_dimension();
-  PPL_ASSERT(x_affine_dim >= y_affine_dim);
-  if (x_affine_dim != y_affine_dim)
-    return;
-
-  // If there are tokens available, work on a temporary copy.
-  if (tp != 0 && *tp > 0) {
-    BD_Shape<T> x_tmp(*this);
-    x_tmp.BHMZ05_widening_assign(y, 0);
-    // If the widening was not precise, use one of the available tokens.
-    if (!contains(x_tmp))
-      --(*tp);
-    return;
-  }
-
-  // Here no token is available.
-  PPL_ASSERT(marked_shortest_path_closed() && y.marked_shortest_path_closed());
-  // Minimize `y'.
-  y.shortest_path_reduction_assign();
-
-  // Extrapolate unstable bounds, taking into account redundancy in `y'.
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    const Bit_Row& y_redundancy_i = y.redundancy_dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; ) {
-      N& dbm_ij = dbm_i[j];
-      // Note: in the following line the use of `!=' (as opposed to
-      // the use of `<' that would seem -but is not- equivalent) is
-      // intentional.
-      if (y_redundancy_i[j] || y_dbm_i[j] != dbm_ij)
-        assign_r(dbm_ij, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-  // NOTE: this will also reset the shortest-path reduction flag,
-  // even though the dbm is still in reduced form. However, the
-  // current implementation invariant requires that any reduced dbm
-  // is closed too.
-  reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::limited_BHMZ05_extrapolation_assign(const BD_Shape& y,
-                                                 const Constraint_System& cs,
-                                                 unsigned* tp) {
-  // Dimension-compatibility check.
-  const dimension_type space_dim = space_dimension();
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("limited_BHMZ05_extrapolation_assign(y, cs)",
-                                 y);
-  // `cs' must be dimension-compatible with the two systems
-  // of bounded differences.
-  const dimension_type cs_space_dim = cs.space_dimension();
-  if (space_dim < cs_space_dim)
-    throw_invalid_argument("limited_BHMZ05_extrapolation_assign(y, cs)",
-                           "cs is space-dimension incompatible");
-
-  // Strict inequalities are not allowed.
-  if (cs.has_strict_inequalities())
-    throw_invalid_argument("limited_BHMZ05_extrapolation_assign(y, cs)",
-                           "cs has strict inequalities");
-
-  // The limited BHMZ05-extrapolation between two systems of bounded
-  // differences in a zero-dimensional space is a system of bounded
-  // differences in a zero-dimensional space, too.
-  if (space_dim == 0)
-    return;
-
-  // We assume that `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  BD_Shape<T> limiting_shape(space_dim, UNIVERSE);
-  get_limiting_shape(cs, limiting_shape);
-  BHMZ05_widening_assign(y, tp);
-  intersection_assign(limiting_shape);
-}
-
-template <typename T>
-void
-BD_Shape<T>::CC76_narrowing_assign(const BD_Shape& y) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("CC76_narrowing_assign(y)", y);
-
-  // We assume that `*this' is contained in or equal to `y'.
-  PPL_EXPECT_HEAVY(copy_contains(y, *this));
-
-  // If both bounded difference shapes are zero-dimensional,
-  // since `y' contains `*this', we simply return `*this'.
-  if (space_dim == 0)
-    return;
-
-  y.shortest_path_closure_assign();
-  // If `y' is empty, since `y' contains `this', `*this' is empty too.
-  if (y.marked_empty())
-    return;
-  shortest_path_closure_assign();
-  // If `*this' is empty, we return.
-  if (marked_empty())
-    return;
-
-  // Replace each constraint in `*this' by the corresponding constraint
-  // in `y' if the corresponding inhomogeneous terms are both finite.
-  bool changed = false;
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    const DB_Row<N>& y_dbm_i = y.dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; ) {
-      N& dbm_ij = dbm_i[j];
-      const N& y_dbm_ij = y_dbm_i[j];
-      if (!is_plus_infinity(dbm_ij)
-          && !is_plus_infinity(y_dbm_ij)
-          && dbm_ij != y_dbm_ij) {
-        dbm_ij = y_dbm_ij;
-        changed = true;
-      }
-    }
-  }
-  if (changed && marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>
-::deduce_v_minus_u_bounds(const dimension_type v,
-                          const dimension_type last_v,
-                          const Linear_Expression& sc_expr,
-                          Coefficient_traits::const_reference sc_denom,
-                          const N& ub_v) {
-  PPL_ASSERT(sc_denom > 0);
-  PPL_ASSERT(!is_plus_infinity(ub_v));
-  // Deduce constraints of the form `v - u', where `u != v'.
-  // Note: the shortest-path closure is able to deduce the constraint
-  // `v - u <= ub_v - lb_u'. We can be more precise if variable `u'
-  // played an active role in the computation of the upper bound for `v',
-  // i.e., if the corresponding coefficient `q == expr_u/denom' is
-  // greater than zero. In particular:
-  // if `q >= 1',    then `v - u <= ub_v - ub_u';
-  // if `0 < q < 1', then `v - u <= ub_v - (q*ub_u + (1-q)*lb_u)'.
-  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
-  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
-  const DB_Row<N>& dbm_0 = dbm[0];
-  // Speculative allocation of temporaries to be used in the following loop.
-  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
-  PPL_DIRTY_TEMP(mpq_class, q);
-  PPL_DIRTY_TEMP(mpq_class, ub_u);
-  PPL_DIRTY_TEMP(N, up_approx);
-  for (Linear_Expression::const_iterator u = sc_expr.begin(),
-        u_end = sc_expr.lower_bound(Variable(last_v)); u != u_end; ++u) {
-    const dimension_type u_dim = u.variable().space_dimension();
-    if (u_dim == v)
-      continue;
-    const Coefficient& expr_u = *u;
-    if (expr_u < 0)
-      continue;
-    PPL_ASSERT(expr_u > 0);
-    if (expr_u >= sc_denom)
-      // Deducing `v - u <= ub_v - ub_u'.
-      sub_assign_r(dbm[u_dim][v], ub_v, dbm_0[u_dim], ROUND_UP);
-    else {
-      DB_Row<N>& dbm_u = dbm[u_dim];
-      const N& dbm_u0 = dbm_u[0];
-      if (!is_plus_infinity(dbm_u0)) {
-        // Let `ub_u' and `lb_u' be the known upper and lower bound
-        // for `u', respectively. Letting `q = expr_u/sc_denom' be the
-        // rational coefficient of `u' in `sc_expr/sc_denom',
-        // the upper bound for `v - u' is computed as
-        // `ub_v - (q * ub_u + (1-q) * lb_u)', i.e.,
-        // `ub_v + (-lb_u) - q * (ub_u + (-lb_u))'.
-        assign_r(minus_lb_u, dbm_u0, ROUND_NOT_NEEDED);
-        assign_r(q, expr_u, ROUND_NOT_NEEDED);
-        div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
-        assign_r(ub_u, dbm_0[u_dim], ROUND_NOT_NEEDED);
-        // Compute `ub_u - lb_u'.
-        add_assign_r(ub_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
-        // Compute `(-lb_u) - q * (ub_u - lb_u)'.
-        sub_mul_assign_r(minus_lb_u, q, ub_u, ROUND_NOT_NEEDED);
-        assign_r(up_approx, minus_lb_u, ROUND_UP);
-        // Deducing `v - u <= ub_v - (q * ub_u + (1-q) * lb_u)'.
-        add_assign_r(dbm_u[v], ub_v, up_approx, ROUND_UP);
-      }
-    }
-  }
-}
-
-template <typename T>
-void
-BD_Shape<T>
-::deduce_u_minus_v_bounds(const dimension_type v,
-                          const dimension_type last_v,
-                          const Linear_Expression& sc_expr,
-                          Coefficient_traits::const_reference sc_denom,
-                          const N& minus_lb_v) {
-  PPL_ASSERT(sc_denom > 0);
-  PPL_ASSERT(!is_plus_infinity(minus_lb_v));
-  // Deduce constraints of the form `u - v', where `u != v'.
-  // Note: the shortest-path closure is able to deduce the constraint
-  // `u - v <= ub_u - lb_v'. We can be more precise if variable `u'
-  // played an active role in the computation of the lower bound for `v',
-  // i.e., if the corresponding coefficient `q == expr_u/denom' is
-  // greater than zero. In particular:
-  // if `q >= 1',    then `u - v <= lb_u - lb_v';
-  // if `0 < q < 1', then `u - v <= (q*lb_u + (1-q)*ub_u) - lb_v'.
-  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
-  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
-  DB_Row<N>& dbm_0 = dbm[0];
-  DB_Row<N>& dbm_v = dbm[v];
-  // Speculative allocation of temporaries to be used in the following loop.
-  PPL_DIRTY_TEMP(mpq_class, ub_u);
-  PPL_DIRTY_TEMP(mpq_class, q);
-  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
-  PPL_DIRTY_TEMP(N, up_approx);
-  // No need to consider indices greater than `last_v'.
-  for (Linear_Expression::const_iterator u = sc_expr.begin(),
-        u_end = sc_expr.lower_bound(Variable(last_v)); u != u_end; ++u) {
-    const Variable u_var = u.variable();
-    const dimension_type u_dim = u_var.space_dimension();
-    if (u_var.space_dimension() == v)
-      continue;
-    const Coefficient& expr_u = *u;
-    if (expr_u < 0)
-      continue;
-    PPL_ASSERT(expr_u > 0);
-    if (expr_u >= sc_denom)
-      // Deducing `u - v <= lb_u - lb_v',
-      // i.e., `u - v <= (-lb_v) - (-lb_u)'.
-      sub_assign_r(dbm_v[u_dim], minus_lb_v, dbm[u_dim][0], ROUND_UP);
-    else {
-      const N& dbm_0u = dbm_0[u_dim];
-      if (!is_plus_infinity(dbm_0u)) {
-        // Let `ub_u' and `lb_u' be the known upper and lower bound
-        // for `u', respectively. Letting `q = expr_u/sc_denom' be the
-        // rational coefficient of `u' in `sc_expr/sc_denom',
-        // the upper bound for `u - v' is computed as
-        // `(q * lb_u + (1-q) * ub_u) - lb_v', i.e.,
-        // `ub_u - q * (ub_u + (-lb_u)) + minus_lb_v'.
-        assign_r(ub_u, dbm_0u, ROUND_NOT_NEEDED);
-        assign_r(q, expr_u, ROUND_NOT_NEEDED);
-        div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
-        assign_r(minus_lb_u, dbm[u_dim][0], ROUND_NOT_NEEDED);
-        // Compute `ub_u - lb_u'.
-        add_assign_r(minus_lb_u, minus_lb_u, ub_u, ROUND_NOT_NEEDED);
-        // Compute `ub_u - q * (ub_u - lb_u)'.
-        sub_mul_assign_r(ub_u, q, minus_lb_u, ROUND_NOT_NEEDED);
-        assign_r(up_approx, ub_u, ROUND_UP);
-        // Deducing `u - v <= (q*lb_u + (1-q)*ub_u) - lb_v'.
-        add_assign_r(dbm_v[u_dim], up_approx, minus_lb_v, ROUND_UP);
-      }
-    }
-  }
-}
-
-template <typename T>
-void
-BD_Shape<T>::forget_all_dbm_constraints(const dimension_type v) {
-  PPL_ASSERT(0 < v && v <= dbm.num_rows());
-  DB_Row<N>& dbm_v = dbm[v];
-  for (dimension_type i = dbm.num_rows(); i-- > 0; ) {
-    assign_r(dbm_v[i], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    assign_r(dbm[i][v], PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-}
-
-template <typename T>
-void
-BD_Shape<T>::forget_binary_dbm_constraints(const dimension_type v) {
-  PPL_ASSERT(0 < v && v <= dbm.num_rows());
-  DB_Row<N>& dbm_v = dbm[v];
-  for (dimension_type i = dbm.num_rows()-1; i > 0; --i) {
-    assign_r(dbm_v[i], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    assign_r(dbm[i][v], PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-}
-
-template <typename T>
-void
-BD_Shape<T>::unconstrain(const Variable var) {
-  // Dimension-compatibility check.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dimension() < var_space_dim)
-    throw_dimension_incompatible("unconstrain(var)", var_space_dim);
-
-  // Shortest-path closure is necessary to detect emptiness
-  // and all (possibly implicit) constraints.
-  shortest_path_closure_assign();
-
-  // If the shape is empty, this is a no-op.
-  if (marked_empty())
-    return;
-
-  forget_all_dbm_constraints(var_space_dim);
-  // Shortest-path closure is preserved, but not reduction.
-  reset_shortest_path_reduced();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::unconstrain(const Variables_Set& vars) {
-  // The cylindrification with respect to no dimensions is a no-op.
-  // This case captures the only legal cylindrification in a 0-dim space.
-  if (vars.empty())
-    return;
-
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dimension() < min_space_dim)
-    throw_dimension_incompatible("unconstrain(vs)", min_space_dim);
-
-  // Shortest-path closure is necessary to detect emptiness
-  // and all (possibly implicit) constraints.
-  shortest_path_closure_assign();
-
-  // If the shape is empty, this is a no-op.
-  if (marked_empty())
-    return;
-
-  for (Variables_Set::const_iterator vsi = vars.begin(),
-         vsi_end = vars.end(); vsi != vsi_end; ++vsi)
-    forget_all_dbm_constraints(*vsi + 1);
-  // Shortest-path closure is preserved, but not reduction.
-  reset_shortest_path_reduced();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::refine(const Variable var,
-                    const Relation_Symbol relsym,
-                    const Linear_Expression& expr,
-                    Coefficient_traits::const_reference denominator) {
-  PPL_ASSERT(denominator != 0);
-  PPL_ASSERT(space_dimension() >= expr.space_dimension());
-  const dimension_type v = var.id() + 1;
-  PPL_ASSERT(v <= space_dimension());
-  PPL_ASSERT(expr.coefficient(var) == 0);
-  PPL_ASSERT(relsym != LESS_THAN && relsym != GREATER_THAN);
-
-  const Coefficient& b = expr.inhomogeneous_term();
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Index of the last non-zero coefficient in `expr', if any.
-  dimension_type w = expr.last_nonzero();
-
-  if (w != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w))
-      ++t;
-  }
-
-  // Since we are only able to record bounded differences, we can
-  // precisely deal with the case of a single variable only if its
-  // coefficient (taking into account the denominator) is 1.
-  // If this is not the case, we fall back to the general case
-  // so as to over-approximate the constraint.
-  if (t == 1 && expr.get(Variable(w - 1)) != denominator)
-    t = 2;
-
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*w + b, where `w != v' and `a == denominator';
-  // - If t == 2, the `expr' is of the general form.
-  const DB_Row<N>& dbm_0 = dbm[0];
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign(minus_denom, denominator);
-
-  if (t == 0) {
-    // Case 1: expr == b.
-    switch (relsym) {
-    case EQUAL:
-      // Add the constraint `var == b/denominator'.
-      add_dbm_constraint(0, v, b, denominator);
-      add_dbm_constraint(v, 0, b, minus_denom);
-      break;
-    case LESS_OR_EQUAL:
-      // Add the constraint `var <= b/denominator'.
-      add_dbm_constraint(0, v, b, denominator);
-      break;
-    case GREATER_OR_EQUAL:
-      // Add the constraint `var >= b/denominator',
-      // i.e., `-var <= -b/denominator',
-      add_dbm_constraint(v, 0, b, minus_denom);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-    return;
-  }
-
-  if (t == 1) {
-    // Case 2: expr == a*w + b, w != v, a == denominator.
-    PPL_ASSERT(expr.get(Variable(w - 1)) == denominator);
-    PPL_DIRTY_TEMP(N, d);
-    switch (relsym) {
-    case EQUAL:
-      // Add the new constraint `v - w <= b/denominator'.
-      div_round_up(d, b, denominator);
-      add_dbm_constraint(w, v, d);
-      // Add the new constraint `v - w >= b/denominator',
-      // i.e., `w - v <= -b/denominator'.
-      div_round_up(d, b, minus_denom);
-      add_dbm_constraint(v, w, d);
-      break;
-    case LESS_OR_EQUAL:
-      // Add the new constraint `v - w <= b/denominator'.
-      div_round_up(d, b, denominator);
-      add_dbm_constraint(w, v, d);
-      break;
-    case GREATER_OR_EQUAL:
-      // Add the new constraint `v - w >= b/denominator',
-      // i.e., `w - v <= -b/denominator'.
-      div_round_up(d, b, minus_denom);
-      add_dbm_constraint(v, w, d);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-    return;
-  }
-
-  // Here t == 2, so that either
-  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2, or
-  // expr == a*w + b, w != v and a != denominator.
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign(minus_b, b);
-  const Coefficient& sc_b = is_sc ? b : minus_b;
-  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -expr;
-  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, sum);
-  // Indices of the variables that are unbounded in `this->dbm'.
-  PPL_UNINITIALIZED(dimension_type, pinf_index);
-  // Number of unbounded variables found.
-  dimension_type pinf_count = 0;
-
-  // Speculative allocation of temporaries that are used in most
-  // of the computational traces starting from this point (also loops).
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-  PPL_DIRTY_TEMP(N, coeff_i);
-
-  switch (relsym) {
-  case EQUAL:
-    {
-      PPL_DIRTY_TEMP(N, neg_sum);
-      // Indices of the variables that are unbounded in `this->dbm'.
-      PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
-      // Number of unbounded variables found.
-      dimension_type neg_pinf_count = 0;
-
-      // Compute an upper approximation for `expr' into `sum',
-      // taking into account the sign of `denominator'.
-
-      // Approximate the inhomogeneous term.
-      assign_r(sum, sc_b, ROUND_UP);
-      assign_r(neg_sum, minus_sc_b, ROUND_UP);
-
-      // Approximate the homogeneous part of `sc_expr'.
-      // Note: indices above `w' can be disregarded, as they all have
-      // a zero coefficient in `expr'.
-      for (Linear_Expression::const_iterator i = sc_expr.begin(),
-            i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-        const dimension_type i_dim = i.variable().space_dimension();
-        const Coefficient& sc_i = *i;
-        const int sign_i = sgn(sc_i);
-        PPL_ASSERT(sign_i != 0);
-        if (sign_i > 0) {
-          assign_r(coeff_i, sc_i, ROUND_UP);
-          // Approximating `sc_expr'.
-          if (pinf_count <= 1) {
-            const N& approx_i = dbm_0[i_dim];
-            if (!is_plus_infinity(approx_i))
-              add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-            else {
-              ++pinf_count;
-              pinf_index = i_dim;
-            }
-          }
-          // Approximating `-sc_expr'.
-          if (neg_pinf_count <= 1) {
-            const N& approx_minus_i = dbm[i_dim][0];
-            if (!is_plus_infinity(approx_minus_i))
-              add_mul_assign_r(neg_sum, coeff_i, approx_minus_i, ROUND_UP);
-            else {
-              ++neg_pinf_count;
-              neg_pinf_index = i_dim;
-            }
-          }
-        }
-        else {
-          PPL_ASSERT(sign_i < 0);
-          neg_assign(minus_sc_i, sc_i);
-          // Note: using temporary named `coeff_i' to store -coeff_i.
-          assign_r(coeff_i, minus_sc_i, ROUND_UP);
-          // Approximating `sc_expr'.
-          if (pinf_count <= 1) {
-            const N& approx_minus_i = dbm[i_dim][0];
-            if (!is_plus_infinity(approx_minus_i))
-              add_mul_assign_r(sum, coeff_i, approx_minus_i, ROUND_UP);
-            else {
-              ++pinf_count;
-              pinf_index = i_dim;
-            }
-          }
-          // Approximating `-sc_expr'.
-          if (neg_pinf_count <= 1) {
-            const N& approx_i = dbm_0[i_dim];
-            if (!is_plus_infinity(approx_i))
-              add_mul_assign_r(neg_sum, coeff_i, approx_i, ROUND_UP);
-            else {
-              ++neg_pinf_count;
-              neg_pinf_index = i_dim;
-            }
-          }
-        }
-      }
-      // Return immediately if no approximation could be computed.
-      if (pinf_count > 1 && neg_pinf_count > 1) {
-        PPL_ASSERT(OK());
-        return;
-      }
-
-      // In the following, shortest-path closure will be definitely lost.
-      reset_shortest_path_closed();
-
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-
-      // Exploit the upper approximation, if possible.
-      if (pinf_count <= 1) {
-        // Compute quotient (if needed).
-        if (down_sc_denom != 1)
-          div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-        // Add the upper bound constraint, if meaningful.
-        if (pinf_count == 0) {
-          // Add the constraint `v <= sum'.
-          dbm[0][v] = sum;
-          // Deduce constraints of the form `v - u', where `u != v'.
-          deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, sum);
-        }
-        else
-          // Here `pinf_count == 1'.
-          if (pinf_index != v
-              && sc_expr.get(Variable(pinf_index - 1)) == sc_denom)
-            // Add the constraint `v - pinf_index <= sum'.
-            dbm[pinf_index][v] = sum;
-      }
-
-      // Exploit the lower approximation, if possible.
-      if (neg_pinf_count <= 1) {
-        // Compute quotient (if needed).
-        if (down_sc_denom != 1)
-          div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
-        // Add the lower bound constraint, if meaningful.
-        if (neg_pinf_count == 0) {
-          // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-          DB_Row<N>& dbm_v = dbm[v];
-          dbm_v[0] = neg_sum;
-          // Deduce constraints of the form `u - v', where `u != v'.
-          deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, neg_sum);
-        }
-        else
-          // Here `neg_pinf_count == 1'.
-          if (neg_pinf_index != v
-              && sc_expr.get(Variable(neg_pinf_index - 1)) == sc_denom)
-            // Add the constraint `v - neg_pinf_index >= -neg_sum',
-            // i.e., `neg_pinf_index - v <= neg_sum'.
-            dbm[v][neg_pinf_index] = neg_sum;
-      }
-    }
-    break;
-
-  case LESS_OR_EQUAL:
-    // Compute an upper approximation for `expr' into `sum',
-    // taking into account the sign of `denominator'.
-
-    // Approximate the inhomogeneous term.
-    assign_r(sum, sc_b, ROUND_UP);
-
-    // Approximate the homogeneous part of `sc_expr'.
-    // Note: indices above `w' can be disregarded, as they all have
-    // a zero coefficient in `expr'.
-    for (Linear_Expression::const_iterator i = sc_expr.begin(),
-          i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-      const Coefficient& sc_i = *i;
-      const dimension_type i_dim = i.variable().space_dimension();
-      const int sign_i = sgn(sc_i);
-      PPL_ASSERT(sign_i != 0);
-      // Choose carefully: we are approximating `sc_expr'.
-      const N& approx_i = (sign_i > 0) ? dbm_0[i_dim] : dbm[i_dim][0];
-      if (is_plus_infinity(approx_i)) {
-        if (++pinf_count > 1)
-          break;
-        pinf_index = i_dim;
-        continue;
-      }
-      if (sign_i > 0)
-        assign_r(coeff_i, sc_i, ROUND_UP);
-      else {
-        neg_assign(minus_sc_i, sc_i);
-        assign_r(coeff_i, minus_sc_i, ROUND_UP);
-      }
-      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-    }
-
-    // Divide by the (sign corrected) denominator (if needed).
-    if (sc_denom != 1) {
-      // Before computing the quotient, the denominator should be
-      // approximated towards zero. Since `sc_denom' is known to be
-      // positive, this amounts to rounding downwards, which is achieved
-      // by rounding upwards `minus_sc - denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-    }
-
-    if (pinf_count == 0) {
-      // Add the constraint `v <= sum'.
-      add_dbm_constraint(0, v, sum);
-      // Deduce constraints of the form `v - u', where `u != v'.
-      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, sum);
-    }
-    else if (pinf_count == 1)
-      if (expr.get(Variable(pinf_index - 1)) == denominator)
-        // Add the constraint `v - pinf_index <= sum'.
-        add_dbm_constraint(pinf_index, v, sum);
-    break;
-
-  case GREATER_OR_EQUAL:
-    // Compute an upper approximation for `-sc_expr' into `sum'.
-    // Note: approximating `-sc_expr' from above and then negating the
-    // result is the same as approximating `sc_expr' from below.
-
-    // Approximate the inhomogeneous term.
-    assign_r(sum, minus_sc_b, ROUND_UP);
-
-    // Approximate the homogeneous part of `-sc_expr'.
-    for (Linear_Expression::const_iterator i = sc_expr.begin(),
-          i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-      const Coefficient& sc_i = *i;
-      const dimension_type i_dim = i.variable().space_dimension();
-      const int sign_i = sgn(sc_i);
-      PPL_ASSERT(sign_i != 0);
-      // Choose carefully: we are approximating `-sc_expr'.
-      const N& approx_i = (sign_i > 0) ? dbm[i_dim][0] : dbm_0[i_dim];
-      if (is_plus_infinity(approx_i)) {
-        if (++pinf_count > 1)
-          break;
-        pinf_index = i_dim;
-        continue;
-      }
-      if (sign_i > 0)
-        assign_r(coeff_i, sc_i, ROUND_UP);
-      else {
-        neg_assign(minus_sc_i, sc_i);
-        assign_r(coeff_i, minus_sc_i, ROUND_UP);
-      }
-      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-    }
-
-    // Divide by the (sign corrected) denominator (if needed).
-    if (sc_denom != 1) {
-      // Before computing the quotient, the denominator should be
-      // approximated towards zero. Since `sc_denom' is known to be positive,
-      // this amounts to rounding downwards, which is achieved by rounding
-      // upwards `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-    }
-
-    if (pinf_count == 0) {
-      // Add the constraint `v >= -sum', i.e., `-v <= sum'.
-      add_dbm_constraint(v, 0, sum);
-      // Deduce constraints of the form `u - v', where `u != v'.
-      deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, sum);
-    }
-    else if (pinf_count == 1)
-      if (pinf_index != v
-          && expr.get(Variable(pinf_index - 1)) == denominator)
-        // Add the constraint `v - pinf_index >= -sum',
-        // i.e., `pinf_index - v <= sum'.
-        add_dbm_constraint(v, pinf_index, sum);
-    break;
-
-  default:
-    // We already dealt with the other cases.
-    PPL_UNREACHABLE;
-    break;
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::affine_image(const Variable var,
-                          const Linear_Expression& expr,
-                          Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("affine_image(v, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("affine_image(v, e, d)", "e", expr);
-
-  // `var' should be one of the dimensions of the shape.
-  const dimension_type v = var.id() + 1;
-  if (v > space_dim)
-    throw_dimension_incompatible("affine_image(v, e, d)", var.id());
-
-  // The image of an empty BDS is empty too.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  const Coefficient& b = expr.inhomogeneous_term();
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Index of the last non-zero coefficient in `expr', if any.
-  dimension_type w = expr.last_nonzero();
-
-  if (w != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w))
-      ++t;
-  }
-
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `expr' is of the general form.
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign(minus_denom, denominator);
-
-  if (t == 0) {
-    // Case 1: expr == b.
-    // Remove all constraints on `var'.
-    forget_all_dbm_constraints(v);
-    // Shortest-path closure is preserved, but not reduction.
-    if (marked_shortest_path_reduced())
-      reset_shortest_path_reduced();
-    // Add the constraint `var == b/denominator'.
-    add_dbm_constraint(0, v, b, denominator);
-    add_dbm_constraint(v, 0, b, minus_denom);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // Value of the one and only non-zero coefficient in `expr'.
-    const Coefficient& a = expr.get(Variable(w - 1));
-    if (a == denominator || a == minus_denom) {
-      // Case 2: expr == a*w + b, with a == +/- denominator.
-      if (w == v) {
-        // `expr' is of the form: a*v + b.
-        if (a == denominator) {
-          if (b == 0)
-            // The transformation is the identity function.
-            return;
-          else {
-            // Translate all the constraints on `var',
-            // adding or subtracting the value `b/denominator'.
-            PPL_DIRTY_TEMP(N, d);
-            div_round_up(d, b, denominator);
-            PPL_DIRTY_TEMP(N, c);
-            div_round_up(c, b, minus_denom);
-            DB_Row<N>& dbm_v = dbm[v];
-            for (dimension_type i = space_dim + 1; i-- > 0; ) {
-              N& dbm_vi = dbm_v[i];
-              add_assign_r(dbm_vi, dbm_vi, c, ROUND_UP);
-              N& dbm_iv = dbm[i][v];
-              add_assign_r(dbm_iv, dbm_iv, d, ROUND_UP);
-            }
-            // Both shortest-path closure and reduction are preserved.
-          }
-        }
-        else {
-          // Here `a == -denominator'.
-          // Remove the binary constraints on `var'.
-          forget_binary_dbm_constraints(v);
-          // Swap the unary constraints on `var'.
-          using std::swap;
-          swap(dbm[v][0], dbm[0][v]);
-          // Shortest-path closure is not preserved.
-          reset_shortest_path_closed();
-          if (b != 0) {
-            // Translate the unary constraints on `var',
-            // adding or subtracting the value `b/denominator'.
-            PPL_DIRTY_TEMP(N, c);
-            div_round_up(c, b, minus_denom);
-            N& dbm_v0 = dbm[v][0];
-            add_assign_r(dbm_v0, dbm_v0, c, ROUND_UP);
-            PPL_DIRTY_TEMP(N, d);
-            div_round_up(d, b, denominator);
-            N& dbm_0v = dbm[0][v];
-            add_assign_r(dbm_0v, dbm_0v, d, ROUND_UP);
-          }
-        }
-      }
-      else {
-        // Here `w != v', so that `expr' is of the form
-        // +/-denominator * w + b.
-        // Remove all constraints on `var'.
-        forget_all_dbm_constraints(v);
-        // Shortest-path closure is preserved, but not reduction.
-        if (marked_shortest_path_reduced())
-          reset_shortest_path_reduced();
-        if (a == denominator) {
-          // Add the new constraint `v - w == b/denominator'.
-          add_dbm_constraint(w, v, b, denominator);
-          add_dbm_constraint(v, w, b, minus_denom);
-        }
-        else {
-          // Here a == -denominator, so that we should be adding
-          // the constraint `v + w == b/denominator'.
-          // Approximate it by computing lower and upper bounds for `w'.
-          const N& dbm_w0 = dbm[w][0];
-          if (!is_plus_infinity(dbm_w0)) {
-            // Add the constraint `v <= b/denominator - lower_w'.
-            PPL_DIRTY_TEMP(N, d);
-            div_round_up(d, b, denominator);
-            add_assign_r(dbm[0][v], d, dbm_w0, ROUND_UP);
-            reset_shortest_path_closed();
-          }
-          const N& dbm_0w = dbm[0][w];
-          if (!is_plus_infinity(dbm_0w)) {
-            // Add the constraint `v >= b/denominator - upper_w'.
-            PPL_DIRTY_TEMP(N, c);
-            div_round_up(c, b, minus_denom);
-            add_assign_r(dbm[v][0], dbm_0w, c, ROUND_UP);
-            reset_shortest_path_closed();
-          }
-        }
-      }
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t == 1, expr == a*w + b, but a <> +/- denominator.
-  // We will remove all the constraints on `var' and add back
-  // constraints providing upper and lower bounds for `var'.
-
-  // Compute upper approximations for `expr' and `-expr'
-  // into `pos_sum' and `neg_sum', respectively, taking into account
-  // the sign of `denominator'.
-  // Note: approximating `-expr' from above and then negating the
-  // result is the same as approximating `expr' from below.
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign(minus_b, b);
-  const Coefficient& sc_b = is_sc ? b : minus_b;
-  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -expr;
-  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, pos_sum);
-  PPL_DIRTY_TEMP(N, neg_sum);
-  // Indices of the variables that are unbounded in `this->dbm'.
-  PPL_UNINITIALIZED(dimension_type, pos_pinf_index);
-  PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
-  // Number of unbounded variables found.
-  dimension_type pos_pinf_count = 0;
-  dimension_type neg_pinf_count = 0;
-
-  // Approximate the inhomogeneous term.
-  assign_r(pos_sum, sc_b, ROUND_UP);
-  assign_r(neg_sum, minus_sc_b, ROUND_UP);
-
-  // Approximate the homogeneous part of `sc_expr'.
-  const DB_Row<N>& dbm_0 = dbm[0];
-  // Speculative allocation of temporaries to be used in the following loop.
-  PPL_DIRTY_TEMP(N, coeff_i);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-
-  // Note: indices above `w' can be disregarded, as they all have
-  // a zero coefficient in `sc_expr'.
-  for (Linear_Expression::const_iterator i = sc_expr.begin(),
-        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-    const Coefficient& sc_i = *i;
-    const dimension_type i_dim = i.variable().space_dimension();
-    const int sign_i = sgn(sc_i);
-    if (sign_i > 0) {
-      assign_r(coeff_i, sc_i, ROUND_UP);
-      // Approximating `sc_expr'.
-      if (pos_pinf_count <= 1) {
-        const N& up_approx_i = dbm_0[i_dim];
-        if (!is_plus_infinity(up_approx_i))
-          add_mul_assign_r(pos_sum, coeff_i, up_approx_i, ROUND_UP);
-        else {
-          ++pos_pinf_count;
-          pos_pinf_index = i_dim;
-        }
-      }
-      // Approximating `-sc_expr'.
-      if (neg_pinf_count <= 1) {
-        const N& up_approx_minus_i = dbm[i_dim][0];
-        if (!is_plus_infinity(up_approx_minus_i))
-          add_mul_assign_r(neg_sum, coeff_i, up_approx_minus_i, ROUND_UP);
-        else {
-          ++neg_pinf_count;
-          neg_pinf_index = i_dim;
-        }
-      }
-    }
-    else {
-      PPL_ASSERT(sign_i < 0);
-      neg_assign(minus_sc_i, sc_i);
-      // Note: using temporary named `coeff_i' to store -coeff_i.
-      assign_r(coeff_i, minus_sc_i, ROUND_UP);
-      // Approximating `sc_expr'.
-      if (pos_pinf_count <= 1) {
-        const N& up_approx_minus_i = dbm[i_dim][0];
-        if (!is_plus_infinity(up_approx_minus_i))
-          add_mul_assign_r(pos_sum, coeff_i, up_approx_minus_i, ROUND_UP);
-        else {
-          ++pos_pinf_count;
-          pos_pinf_index = i_dim;
-        }
-      }
-      // Approximating `-sc_expr'.
-      if (neg_pinf_count <= 1) {
-        const N& up_approx_i = dbm_0[i_dim];
-        if (!is_plus_infinity(up_approx_i))
-          add_mul_assign_r(neg_sum, coeff_i, up_approx_i, ROUND_UP);
-        else {
-          ++neg_pinf_count;
-          neg_pinf_index = i_dim;
-        }
-      }
-    }
-  }
-
-  // Remove all constraints on 'v'.
-  forget_all_dbm_constraints(v);
-  // Shortest-path closure is maintained, but not reduction.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-  // Return immediately if no approximation could be computed.
-  if (pos_pinf_count > 1 && neg_pinf_count > 1) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // In the following, shortest-path closure will be definitely lost.
-  reset_shortest_path_closed();
-
-  // Exploit the upper approximation, if possible.
-  if (pos_pinf_count <= 1) {
-    // Compute quotient (if needed).
-    if (sc_denom != 1) {
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(pos_sum, pos_sum, down_sc_denom, ROUND_UP);
-    }
-    // Add the upper bound constraint, if meaningful.
-    if (pos_pinf_count == 0) {
-      // Add the constraint `v <= pos_sum'.
-      dbm[0][v] = pos_sum;
-      // Deduce constraints of the form `v - u', where `u != v'.
-      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, pos_sum);
-    }
-    else
-      // Here `pos_pinf_count == 1'.
-      if (pos_pinf_index != v
-          && sc_expr.get(Variable(pos_pinf_index - 1)) == sc_denom)
-        // Add the constraint `v - pos_pinf_index <= pos_sum'.
-        dbm[pos_pinf_index][v] = pos_sum;
-  }
-
-  // Exploit the lower approximation, if possible.
-  if (neg_pinf_count <= 1) {
-    // Compute quotient (if needed).
-    if (sc_denom != 1) {
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
-    }
-    // Add the lower bound constraint, if meaningful.
-    if (neg_pinf_count == 0) {
-      // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-      DB_Row<N>& dbm_v = dbm[v];
-      dbm_v[0] = neg_sum;
-      // Deduce constraints of the form `u - v', where `u != v'.
-      deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, neg_sum);
-    }
-    else
-      // Here `neg_pinf_count == 1'.
-      if (neg_pinf_index != v
-          && sc_expr.get(Variable(neg_pinf_index - 1)) == sc_denom)
-        // Add the constraint `v - neg_pinf_index >= -neg_sum',
-        // i.e., `neg_pinf_index - v <= neg_sum'.
-        dbm[v][neg_pinf_index] = neg_sum;
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-BD_Shape<T>::affine_form_image(const Variable var,
-                    const Linear_Form< Interval<T, Interval_Info> >& lf) {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-		    "BD_Shape<T>::affine_form_image(Variable, Linear_Form):"
-                    " T not a floating point type.");
-
-  // Dimension-compatibility checks.
-  // The dimension of `lf' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type lf_space_dim = lf.space_dimension();
-  if (space_dim < lf_space_dim)
-    throw_dimension_incompatible("affine_form_image(var_id, l)", "l", lf);
-
-  // `var' should be one of the dimensions of the shape.
-  const dimension_type var_id = var.id() + 1;
-  if (space_dim < var_id)
-    throw_dimension_incompatible("affine_form_image(var_id, l)", var.id());
-
-  // The image of an empty BDS is empty too.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lf': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Index of the last non-zero coefficient in `lf', if any.
-  dimension_type w_id = 0;
-  // Get information about the number of non-zero coefficients in `lf'.
-  for (dimension_type i = lf_space_dim; i-- > 0; )
-    if (lf.coefficient(Variable(i)) != 0) {
-      if (t++ == 1)
-        break;
-      else
-        w_id = i + 1;
-    }
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-  const FP_Interval_Type& b = lf.inhomogeneous_term();
-
-  // Now we know the form of `lf':
-  // - If t == 0, then lf == b, with `b' a constant;
-  // - If t == 1, then lf == a*w + b, where `w' can be `v' or another
-  //   variable;
-  // - If t == 2, the linear form 'lf' is of the general form.
-
-  if (t == 0) {
-    inhomogeneous_affine_form_image(var_id, b);
-    PPL_ASSERT(OK());
-    return;
-  }
-  else if (t == 1) {
-    const FP_Interval_Type& w_coeff = lf.coefficient(Variable(w_id - 1));
-    if (w_coeff == 1 || w_coeff == -1) {
-      one_variable_affine_form_image(var_id, b, w_coeff, w_id, space_dim);
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-  two_variables_affine_form_image(var_id, lf, space_dim);
-  PPL_ASSERT(OK());
-}
-
-// Case 1: var = b, where b = [-b_mlb, b_ub]
-template <typename T>
-template <typename Interval_Info>
-void
-BD_Shape<T>
-::inhomogeneous_affine_form_image(const dimension_type& var_id,
-                                  const Interval<T, Interval_Info>& b) {
-  PPL_DIRTY_TEMP(N, b_ub);
-  assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
-  PPL_DIRTY_TEMP(N, b_mlb);
-  neg_assign_r(b_mlb, b.lower(), ROUND_NOT_NEEDED);
-
-  // Remove all constraints on `var'.
-  forget_all_dbm_constraints(var_id);
-  // Shortest-path closure is preserved, but not reduction.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-    // Add the constraint `var >= lb && var <= ub'.
-    add_dbm_constraint(0, var_id, b_ub);
-    add_dbm_constraint(var_id, 0, b_mlb);
-    return;
-}
-
-// case 2: var = (+/-1) * w + [-b_mlb, b_ub], where `w' can be `var'
-// or another variable.
-template <typename T>
-template <typename Interval_Info>
-void BD_Shape<T>
-::one_variable_affine_form_image(const dimension_type& var_id,
-			    const Interval<T, Interval_Info>& b,
-			    const Interval<T, Interval_Info>& w_coeff,
-			    const dimension_type& w_id,
-			    const dimension_type& space_dim) {
-
-  PPL_DIRTY_TEMP(N, b_ub);
-  assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
-  PPL_DIRTY_TEMP(N, b_mlb);
-  neg_assign_r(b_mlb, b.lower(), ROUND_NOT_NEEDED);
-
-  // True if `w_coeff' is in [1, 1].
-  bool is_w_coeff_one = (w_coeff == 1);
-
-  if (w_id == var_id) {
-    // True if `b' is in [b_mlb, b_ub] and that is [0, 0].
-    bool is_b_zero = (b_mlb == 0 && b_ub == 0);
-    // Here `lf' is of the form: [+/-1, +/-1] * v + b.
-    if (is_w_coeff_one) {
-      if (is_b_zero)
-        // The transformation is the identity function.
-        return;
-      else {
-        // Translate all the constraints on `var' by adding the value
-        // `b_ub' or subtracting the value `b_mlb'.
-        DB_Row<N>& dbm_v = dbm[var_id];
-        for (dimension_type i = space_dim + 1; i-- > 0; ) {
-          N& dbm_vi = dbm_v[i];
-          add_assign_r(dbm_vi, dbm_vi, b_mlb, ROUND_UP);
-          N& dbm_iv = dbm[i][var_id];
-          add_assign_r(dbm_iv, dbm_iv, b_ub, ROUND_UP);
-        }
-        // Both shortest-path closure and reduction are preserved.
-      }
-    }
-    else {
-      // Here `w_coeff = [-1, -1].
-      // Remove the binary constraints on `var'.
-      forget_binary_dbm_constraints(var_id);
-      using std::swap;
-      swap(dbm[var_id][0], dbm[0][var_id]);
-      // Shortest-path closure is not preserved.
-      reset_shortest_path_closed();
-      if (!is_b_zero) {
-        // Translate the unary constraints on `var' by adding the value
-        // `b_ub' or subtracting the value `b_mlb'.
-        N& dbm_v0 = dbm[var_id][0];
-        add_assign_r(dbm_v0, dbm_v0, b_mlb, ROUND_UP);
-        N& dbm_0v = dbm[0][var_id];
-        add_assign_r(dbm_0v, dbm_0v, b_ub, ROUND_UP);
-      }
-    }
-  }
-  else {
-    // Here `w != var', so that `lf' is of the form
-    // [+/-1, +/-1] * w + b.
-    // Remove all constraints on `var'.
-    forget_all_dbm_constraints(var_id);
-    // Shortest-path closure is preserved, but not reduction.
-    if (marked_shortest_path_reduced())
-      reset_shortest_path_reduced();
-    if (is_w_coeff_one) {
-      // Add the new constraints `var - w >= b_mlb'
-      // `and var - w <= b_ub'.
-      add_dbm_constraint(w_id, var_id, b_ub);
-      add_dbm_constraint(var_id, w_id, b_mlb);
-    }
-    else {
-      // We have to add the constraint `v + w == b', over-approximating it
-      // by computing lower and upper bounds for `w'.
-      const N& mlb_w = dbm[w_id][0];
-      if (!is_plus_infinity(mlb_w)) {
-        // Add the constraint `v <= ub - lb_w'.
-        add_assign_r(dbm[0][var_id], b_ub, mlb_w, ROUND_UP);
-        reset_shortest_path_closed();
-      }
-      const N& ub_w = dbm[0][w_id];
-      if (!is_plus_infinity(ub_w)) {
-        // Add the constraint `v >= lb - ub_w'.
-        add_assign_r(dbm[var_id][0], ub_w, b_mlb, ROUND_UP);
-        reset_shortest_path_closed();
-      }
-    }
-  }
-  return;
-}
-
-// General case.
-// Either t == 2, so that
-// lf == i_1*x_1 + i_2*x_2 + ... + i_n*x_n + b, where n >= 2,
-// or t == 1, lf == i*w + b, but i <> [+/-1, +/-1].
-template <typename T>
-template <typename Interval_Info>
-void BD_Shape<T>
-::two_variables_affine_form_image(const dimension_type& var_id,
-           const Linear_Form< Interval<T, Interval_Info> >& lf,
-                             const dimension_type& space_dim) {
-  // Shortest-path closure is maintained, but not reduction.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-
-  reset_shortest_path_closed();
-
-  Linear_Form< Interval<T, Interval_Info> > minus_lf(lf);
-  minus_lf.negate();
-
-  // Declare temporaries outside the loop.
-  PPL_DIRTY_TEMP(N, upper_bound);
-
-  // Update binary constraints on var FIRST.
-  for (dimension_type curr_var = 1; curr_var < var_id; ++curr_var) {
-    Variable current(curr_var - 1);
-    linear_form_upper_bound(lf - current, upper_bound);
-    assign_r(dbm[curr_var][var_id], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(minus_lf + current, upper_bound);
-    assign_r(dbm[var_id][curr_var], upper_bound, ROUND_NOT_NEEDED);
-  }
-  for (dimension_type curr_var = var_id + 1; curr_var <= space_dim;
-                                                      ++curr_var) {
-    Variable current(curr_var - 1);
-    linear_form_upper_bound(lf - current, upper_bound);
-    assign_r(dbm[curr_var][var_id], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(minus_lf + current, upper_bound);
-    assign_r(dbm[var_id][curr_var], upper_bound, ROUND_NOT_NEEDED);
-  }
-  // Finally, update unary constraints on var.
-  PPL_DIRTY_TEMP(N, lf_ub);
-  linear_form_upper_bound(lf, lf_ub);
-  PPL_DIRTY_TEMP(N, minus_lf_ub);
-  linear_form_upper_bound(minus_lf, minus_lf_ub);
-  assign_r(dbm[0][var_id], lf_ub, ROUND_NOT_NEEDED);
-  assign_r(dbm[var_id][0], minus_lf_ub, ROUND_NOT_NEEDED);
-}
-
-template <typename T>
-template <typename Interval_Info>
-void BD_Shape<T>::refine_with_linear_form_inequality(
-                   const Linear_Form< Interval<T, Interval_Info> >& left,
-                   const Linear_Form< Interval<T, Interval_Info> >& right) {
-    // Check that T is a floating point type.
-    PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-		    "Octagonal_Shape<T>::refine_with_linear_form_inequality:"
-		    " T not a floating point type.");
-
-    //We assume that the analyzer will not try to apply an unreachable filter.
-    PPL_ASSERT(!marked_empty());
-
-    // Dimension-compatibility checks.
-    // The dimensions of `left' and `right' should not be greater than the
-    // dimension of `*this'.
-    const dimension_type left_space_dim = left.space_dimension();
-    const dimension_type space_dim = space_dimension();
-    if (space_dim < left_space_dim)
-      throw_dimension_incompatible(
-          "refine_with_linear_form_inequality(left, right)", "left", left);
-
-    const dimension_type right_space_dim = right.space_dimension();
-    if (space_dim < right_space_dim)
-      throw_dimension_incompatible(
-          "refine_with_linear_form_inequality(left, right)", "right", right);
-
-  // Number of non-zero coefficients in `left': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type left_t = 0;
-  // Variable-index of the last non-zero coefficient in `left', if any.
-  dimension_type left_w_id = 0;
-  // Number of non-zero coefficients in `right': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type right_t = 0;
-  // Variable-index of the last non-zero coefficient in `right', if any.
-  dimension_type right_w_id = 0;
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-  // Get information about the number of non-zero coefficients in `left'.
-  for (dimension_type i = left_space_dim; i-- > 0; )
-    if (left.coefficient(Variable(i)) != 0) {
-      if (left_t++ == 1)
-        break;
-      else
-        left_w_id = i;
-    }
-
-  // Get information about the number of non-zero coefficients in `right'.
-  for (dimension_type i = right_space_dim; i-- > 0; )
-    if (right.coefficient(Variable(i)) != 0) {
-      if (right_t++ == 1)
-        break;
-      else
-        right_w_id = i;
-    }
-
-  const FP_Interval_Type& left_w_coeff =
-          left.coefficient(Variable(left_w_id));
-  const FP_Interval_Type& right_w_coeff =
-          right.coefficient(Variable(right_w_id));
-
-  if (left_t == 0) {
-    if (right_t == 0) {
-      // The constraint involves constants only. Ignore it: it is up to
-      // the analyzer to handle it.
-      PPL_ASSERT(OK());
-      return;
-    }
-    else if (right_w_coeff == 1 || right_w_coeff == -1) {
-      left_inhomogeneous_refine(right_t, right_w_id, left, right);
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-  else if (left_t == 1) {
-    if (left_w_coeff == 1 || left_w_coeff == -1) {
-      if (right_t == 0 || (right_w_coeff == 1 || right_w_coeff == -1)) {
-	left_one_var_refine(left_w_id, right_t, right_w_id, left, right);
-	PPL_ASSERT(OK());
-	return;
-      }
-    }
-  }
-
-  // General case.
-  general_refine(left_w_id, right_w_id, left, right);
-  PPL_ASSERT(OK());
-} // end of refine_with_linear_form_inequality
-
-template <typename T>
-template <typename U>
-void
-BD_Shape<T>
-::export_interval_constraints(U& dest) const {
-  const dimension_type space_dim = space_dimension();
-  if (space_dim > dest.space_dimension())
-    throw std::invalid_argument(
-               "BD_Shape<T>::export_interval_constraints");
-
-  // Expose all the interval constraints.
-  shortest_path_closure_assign();
-
-  if (marked_empty()) {
-    dest.set_empty();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  PPL_DIRTY_TEMP(N, tmp);
-  const DB_Row<N>& dbm_0 = dbm[0];
-  for (dimension_type i = space_dim; i-- > 0; ) {
-    // Set the upper bound.
-    const N& u = dbm_0[i+1];
-    if (!is_plus_infinity(u))
-      if (!dest.restrict_upper(i, u.raw_value()))
-        return;
-
-    // Set the lower bound.
-    const N& negated_l = dbm[i+1][0];
-    if (!is_plus_infinity(negated_l)) {
-      neg_assign_r(tmp, negated_l, ROUND_DOWN);
-      if (!dest.restrict_lower(i, tmp.raw_value()))
-        return;
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-BD_Shape<T>::left_inhomogeneous_refine(const dimension_type& right_t,
-				       const dimension_type& right_w_id,
-		    const Linear_Form< Interval<T, Interval_Info> >& left,
-		    const Linear_Form< Interval<T, Interval_Info> >& right) {
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-  if (right_t == 1) {
-    // The constraint has the form [a-, a+] <= [b-, b+] + [c-, c+] * x.
-    // Reduce it to the constraint +/-x <= b+ - a- if [c-, c+] = +/-[1, 1].
-      const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
-      if (right_w_coeff == 1) {
-        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_b = right.inhomogeneous_term();
-        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
-                     ROUND_UP);
-        add_dbm_constraint(right_w_id+1, 0, b_plus_minus_a_minus);
-        return;
-      }
-
-      if (right_w_coeff == -1) {
-        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_b = right.inhomogeneous_term();
-        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
-                     ROUND_UP);
-        add_dbm_constraint(0, right_w_id+1, b_plus_minus_a_minus);
-        return;
-      }
-    }
-} // end of left_inhomogeneous_refine
-
-
-template <typename T>
-template <typename Interval_Info>
-void
-BD_Shape<T>
-::left_one_var_refine(const dimension_type& left_w_id,
-		      const dimension_type& right_t,
-		      const dimension_type& right_w_id,
-	        const Linear_Form< Interval<T, Interval_Info> >& left,
-		const Linear_Form< Interval<T, Interval_Info> >& right) {
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-    if (right_t == 0) {
-      // The constraint has the form [b-, b+] + [c-, c+] * x <= [a-, a+]
-      // Reduce it to the constraint +/-x <= a+ - b- if [c-, c+] = +/-[1, 1].
-      const FP_Interval_Type& left_w_coeff =
-	left.coefficient(Variable(left_w_id));
-
-      if (left_w_coeff == 1) {
-        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-        const FP_Interval_Type& left_b = left.inhomogeneous_term();
-        const FP_Interval_Type& right_a = right.inhomogeneous_term();
-        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                     ROUND_UP);
-        add_dbm_constraint(0, left_w_id+1, a_plus_minus_b_minus);
-        return;
-      }
-
-      if (left_w_coeff == -1) {
-        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-        const FP_Interval_Type& left_b = left.inhomogeneous_term();
-        const FP_Interval_Type& right_a = right.inhomogeneous_term();
-        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                     ROUND_UP);
-        add_dbm_constraint(left_w_id+1, 0, a_plus_minus_b_minus);
-        return;
-      }
-    }
-    else if (right_t == 1) {
-      // The constraint has the form
-      // [a-, a+] + [b-, b+] * x <= [c-, c+] + [d-, d+] * y.
-      // Reduce it to the constraint +/-x +/-y <= c+ - a-
-      // if [b-, b+] = +/-[1, 1] and [d-, d+] = +/-[1, 1].
-      const FP_Interval_Type& left_w_coeff =
-                              left.coefficient(Variable(left_w_id));
-
-      const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
-
-      bool is_left_coeff_one = (left_w_coeff == 1);
-      bool is_left_coeff_minus_one = (left_w_coeff == -1);
-      bool is_right_coeff_one = (right_w_coeff == 1);
-      bool is_right_coeff_minus_one = (right_w_coeff == -1);
-      if (left_w_id == right_w_id) {
-        if ((is_left_coeff_one && is_right_coeff_one)
-            ||
-            (is_left_coeff_minus_one && is_right_coeff_minus_one)) {
-          // Here we have an identity or a constants-only constraint.
-          return;
-        }
-        if (is_left_coeff_one && is_right_coeff_minus_one) {
-          // We fall back to a previous case.
-          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-          const FP_Interval_Type& left_b = left.inhomogeneous_term();
-          const FP_Interval_Type& right_a = right.inhomogeneous_term();
-          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                       ROUND_UP);
-          div_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
-                            ROUND_UP);
-          add_dbm_constraint(0, left_w_id + 1, a_plus_minus_b_minus);
-          return;
-        }
-        if (is_left_coeff_minus_one && is_right_coeff_one) {
-          // We fall back to a previous case.
-	  PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-          const FP_Interval_Type& left_b = left.inhomogeneous_term();
-          const FP_Interval_Type& right_a = right.inhomogeneous_term();
-          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                       ROUND_UP);
-          div_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
-                            ROUND_UP);
-          add_dbm_constraint(right_w_id + 1, 0, a_plus_minus_b_minus);
-          return;
-        }
-      }
-      else if (is_left_coeff_minus_one && is_right_coeff_one) {
-        // over-approximate (if is it possible) the inequality
-        // -B + [b1, b2] <= A + [a1, a2] by adding the constraints
-        // -B <= upper_bound(A) + (a2 - b1) and
-        // -A <= upper_bound(B) + (a2 - b1)
-        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-        const FP_Interval_Type& left_b = left.inhomogeneous_term();
-        const FP_Interval_Type& right_a = right.inhomogeneous_term();
-        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                       ROUND_UP);
-        PPL_DIRTY_TEMP(N, ub);
-        ub = dbm[0][right_w_id + 1];
-        if (!is_plus_infinity(ub)) {
-          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
-          add_dbm_constraint(left_w_id + 1, 0, ub);
-        }
-        ub = dbm[0][left_w_id + 1];
-        if (!is_plus_infinity(ub)) {
-          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
-          add_dbm_constraint(right_w_id + 1, 0, ub);
-        }
-        return;
-      }
-      if (is_left_coeff_one && is_right_coeff_minus_one) {
-        // over-approximate (if is it possible) the inequality
-        // B + [b1, b2] <= -A + [a1, a2] by adding the constraints
-        // B <= upper_bound(-A) + (a2 - b1) and
-        // A <= upper_bound(-B) + (a2 - b1)
-        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-        const FP_Interval_Type& left_b = left.inhomogeneous_term();
-        const FP_Interval_Type& right_a = right.inhomogeneous_term();
-        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                       ROUND_UP);
-        PPL_DIRTY_TEMP(N, ub);
-        ub = dbm[right_w_id + 1][0];
-        if (!is_plus_infinity(ub)) {
-          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
-          add_dbm_constraint(0, left_w_id + 1, ub);
-        }
-        ub = dbm[left_w_id + 1][0];
-        if (!is_plus_infinity(ub)) {
-          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
-          add_dbm_constraint(0, right_w_id + 1, ub);
-        }
-	    return;
-      }
-      if (is_left_coeff_one && is_right_coeff_one) {
-	PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-	const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_c = right.inhomogeneous_term();
-        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
-                     ROUND_UP);
-        add_dbm_constraint(right_w_id+1, left_w_id+1, c_plus_minus_a_minus);
-	return;
-      }
-      if (is_left_coeff_minus_one && is_right_coeff_minus_one) {
-        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_c = right.inhomogeneous_term();
-        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
-                     ROUND_UP);
-        add_dbm_constraint(left_w_id+1, right_w_id+1, c_plus_minus_a_minus);
-        return;
-      }
-    }
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-BD_Shape<T>
-::general_refine(const dimension_type& left_w_id,
-		 const dimension_type& right_w_id,
-		 const Linear_Form< Interval<T, Interval_Info> >& left,
-		 const Linear_Form< Interval<T, Interval_Info> >& right) {
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-  Linear_Form<FP_Interval_Type> right_minus_left(right);
-  right_minus_left -= left;
-
-  // Declare temporaries outside of the loop.
-  PPL_DIRTY_TEMP(N, low_coeff);
-  PPL_DIRTY_TEMP(N, high_coeff);
-  PPL_DIRTY_TEMP(N, upper_bound);
-
-  dimension_type max_w_id = std::max(left_w_id, right_w_id);
-
-  for (dimension_type first_v = 0; first_v < max_w_id; ++first_v) {
-    for (dimension_type second_v = first_v+1;
-         second_v <= max_w_id; ++second_v) {
-      const FP_Interval_Type& lfv_coefficient =
-	left.coefficient(Variable(first_v));
-      const FP_Interval_Type& lsv_coefficient =
-	left.coefficient(Variable(second_v));
-      const FP_Interval_Type& rfv_coefficient =
-	right.coefficient(Variable(first_v));
-      const FP_Interval_Type& rsv_coefficient =
-	right.coefficient(Variable(second_v));
-      // We update the constraints only when both variables appear in at
-      // least one argument.
-      bool do_update = false;
-      assign_r(low_coeff, lfv_coefficient.lower(), ROUND_NOT_NEEDED);
-      assign_r(high_coeff, lfv_coefficient.upper(), ROUND_NOT_NEEDED);
-      if (low_coeff != 0 || high_coeff != 0) {
-        assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
-        assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
-        if (low_coeff != 0 || high_coeff != 0)
-          do_update = true;
-        else {
-          assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
-          assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
-          if (low_coeff != 0 || high_coeff != 0)
-            do_update = true;
-        }
-      }
-      else {
-        assign_r(low_coeff, rfv_coefficient.lower(), ROUND_NOT_NEEDED);
-        assign_r(high_coeff, rfv_coefficient.upper(), ROUND_NOT_NEEDED);
-        if (low_coeff != 0 || high_coeff != 0) {
-          assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
-          assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
-          if (low_coeff != 0 || high_coeff != 0)
-            do_update = true;
-          else {
-            assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
-            assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
-            if (low_coeff != 0 || high_coeff != 0)
-              do_update = true;
-          }
-        }
-      }
-
-      if (do_update) {
-        Variable first(first_v);
-        Variable second(second_v);
-        dimension_type n_first_var = first_v +1 ;
-        dimension_type n_second_var = second_v + 1;
-        linear_form_upper_bound(right_minus_left - first + second,
-                                upper_bound);
-        add_dbm_constraint(n_first_var, n_second_var, upper_bound);
-        linear_form_upper_bound(right_minus_left + first - second,
-                                upper_bound);
-        add_dbm_constraint(n_second_var, n_first_var, upper_bound);
-      }
-    }
-  }
-
-  // Finally, update the unary constraints.
-  for (dimension_type v = 0; v < max_w_id; ++v) {
-    const FP_Interval_Type& lv_coefficient =
-      left.coefficient(Variable(v));
-    const FP_Interval_Type& rv_coefficient =
-      right.coefficient(Variable(v));
-    // We update the constraints only if v appears in at least one of the
-    // two arguments.
-    bool do_update = false;
-    assign_r(low_coeff, lv_coefficient.lower(), ROUND_NOT_NEEDED);
-    assign_r(high_coeff, lv_coefficient.upper(), ROUND_NOT_NEEDED);
-    if (low_coeff != 0 || high_coeff != 0)
-      do_update = true;
-    else {
-      assign_r(low_coeff, rv_coefficient.lower(), ROUND_NOT_NEEDED);
-      assign_r(high_coeff, rv_coefficient.upper(), ROUND_NOT_NEEDED);
-      if (low_coeff != 0 || high_coeff != 0)
-        do_update = true;
-    }
-
-    if (do_update) {
-      Variable var(v);
-      dimension_type n_var = v + 1;
-      linear_form_upper_bound(right_minus_left + var, upper_bound);
-      add_dbm_constraint(0, n_var, upper_bound);
-      linear_form_upper_bound(right_minus_left - var, upper_bound);
-      add_dbm_constraint(n_var, 0, upper_bound);
-    }
-  }
-
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-BD_Shape<T>::
-linear_form_upper_bound(const Linear_Form< Interval<T, Interval_Info> >& lf,
-			N& result) const {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-                     "BD_Shape<T>::linear_form_upper_bound:"
-                     " T not a floating point type.");
-
-  const dimension_type lf_space_dimension = lf.space_dimension();
-  PPL_ASSERT(lf_space_dimension <= space_dimension());
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-  PPL_DIRTY_TEMP(N, curr_lb);
-  PPL_DIRTY_TEMP(N, curr_ub);
-  PPL_DIRTY_TEMP(N, curr_var_ub);
-  PPL_DIRTY_TEMP(N, curr_minus_var_ub);
-
-  PPL_DIRTY_TEMP(N, first_comparison_term);
-  PPL_DIRTY_TEMP(N, second_comparison_term);
-
-  PPL_DIRTY_TEMP(N, negator);
-
-  assign_r(result, lf.inhomogeneous_term().upper(), ROUND_NOT_NEEDED);
-
-  for (dimension_type curr_var = 0, n_var = 0; curr_var < lf_space_dimension;
-       ++curr_var) {
-    n_var = curr_var + 1;
-    const FP_Interval_Type& curr_coefficient =
-                            lf.coefficient(Variable(curr_var));
-    assign_r(curr_lb, curr_coefficient.lower(), ROUND_NOT_NEEDED);
-    assign_r(curr_ub, curr_coefficient.upper(), ROUND_NOT_NEEDED);
-    if (curr_lb != 0 || curr_ub != 0) {
-      assign_r(curr_var_ub, dbm[0][n_var], ROUND_NOT_NEEDED);
-      neg_assign_r(curr_minus_var_ub, dbm[n_var][0], ROUND_NOT_NEEDED);
-      // Optimize the most commons cases: curr = +/-[1, 1].
-      if (curr_lb == 1 && curr_ub == 1) {
-        add_assign_r(result, result, std::max(curr_var_ub, curr_minus_var_ub),
-                     ROUND_UP);
-      }
-      else if (curr_lb == -1 && curr_ub == -1) {
-        neg_assign_r(negator, std::min(curr_var_ub, curr_minus_var_ub),
-                     ROUND_NOT_NEEDED);
-        add_assign_r(result, result, negator, ROUND_UP);
-      }
-      else {
-        // Next addend will be the maximum of four quantities.
-        assign_r(first_comparison_term, 0, ROUND_NOT_NEEDED);
-        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-        add_mul_assign_r(first_comparison_term, curr_var_ub, curr_ub,
-                         ROUND_UP);
-        add_mul_assign_r(second_comparison_term, curr_var_ub, curr_lb,
-                         ROUND_UP);
-        assign_r(first_comparison_term, std::max(first_comparison_term,
-                                                 second_comparison_term),
-                 ROUND_NOT_NEEDED);
-        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_ub,
-                         ROUND_UP);
-        assign_r(first_comparison_term, std::max(first_comparison_term,
-                                                 second_comparison_term),
-                 ROUND_NOT_NEEDED);
-        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_lb,
-                         ROUND_UP);
-        assign_r(first_comparison_term, std::max(first_comparison_term,
-                                                 second_comparison_term),
-                 ROUND_NOT_NEEDED);
-
-        add_assign_r(result, result, first_comparison_term, ROUND_UP);
-      }
-    }
-  }
-}
-
-template <typename T>
-void
-BD_Shape<T>::affine_preimage(const Variable var,
-                             const Linear_Expression& expr,
-                             Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("affine_preimage(v, e, d)", "e", expr);
-
-  // `var' should be one of the dimensions of
-  // the bounded difference shapes.
-  const dimension_type v = var.id() + 1;
-  if (v > space_dim)
-    throw_dimension_incompatible("affine_preimage(v, e, d)", var.id());
-
-  // The image of an empty BDS is empty too.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  const Coefficient& b = expr.inhomogeneous_term();
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Index of the last non-zero coefficient in `expr', if any.
-  dimension_type j = expr.last_nonzero();
-
-  if (j != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, j))
-      ++t;
-  }
-
-  // Now we know the form of `expr':
-  // - If t == 0, then expr = b, with `b' a constant;
-  // - If t == 1, then expr = a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t > 1, the `expr' is of the general form.
-  if (t == 0) {
-    // Case 1: expr = n; remove all constraints on `var'.
-    forget_all_dbm_constraints(v);
-    // Shortest-path closure is preserved, but not reduction.
-    if (marked_shortest_path_reduced())
-      reset_shortest_path_reduced();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // Value of the one and only non-zero coefficient in `expr'.
-    const Coefficient& a = expr.get(Variable(j - 1));
-    if (a == denominator || a == -denominator) {
-      // Case 2: expr = a*w + b, with a = +/- denominator.
-      if (j == var.space_dimension())
-        // Apply affine_image() on the inverse of this transformation.
-        affine_image(var, denominator*var - b, a);
-      else {
-        // `expr == a*w + b', where `w != v'.
-        // Remove all constraints on `var'.
-        forget_all_dbm_constraints(v);
-        // Shortest-path closure is preserved, but not reduction.
-        if (marked_shortest_path_reduced())
-          reset_shortest_path_reduced();
-        PPL_ASSERT(OK());
-      }
-      return;
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr = a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t = 1, expr = a*w + b, but a <> +/- denominator.
-  const Coefficient& expr_v = expr.coefficient(var);
-  if (expr_v != 0) {
-    // The transformation is invertible.
-    Linear_Expression inverse((expr_v + denominator)*var);
-    inverse -= expr;
-    affine_image(var, inverse, expr_v);
-  }
-  else {
-    // Transformation not invertible: all constraints on `var' are lost.
-    forget_all_dbm_constraints(v);
-    // Shortest-path closure is preserved, but not reduction.
-    if (marked_shortest_path_reduced())
-      reset_shortest_path_reduced();
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>
-::bounded_affine_image(const Variable var,
-                       const Linear_Expression& lb_expr,
-                       const Linear_Expression& ub_expr,
-                       Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // `var' should be one of the dimensions of the BD_Shape.
-  const dimension_type bds_space_dim = space_dimension();
-  const dimension_type v = var.id() + 1;
-  if (v > bds_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-                                 "v", var);
-  // The dimension of `lb_expr' and `ub_expr' should not be
-  // greater than the dimension of `*this'.
-  const dimension_type lb_space_dim = lb_expr.space_dimension();
-  if (bds_space_dim < lb_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-                                 "lb", lb_expr);
-  const dimension_type ub_space_dim = ub_expr.space_dimension();
-  if (bds_space_dim < ub_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-                                 "ub", ub_expr);
-
-  // Any image of an empty BDS is empty.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  const Coefficient& b = ub_expr.inhomogeneous_term();
-  // Number of non-zero coefficients in `ub_expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Index of the last non-zero coefficient in `ub_expr', if any.
-  dimension_type w = ub_expr.last_nonzero();
-
-  if (w != 0) {
-    ++t;
-    if (!ub_expr.all_zeroes(1, w))
-      ++t;
-  }
-
-  // Now we know the form of `ub_expr':
-  // - If t == 0, then ub_expr == b, with `b' a constant;
-  // - If t == 1, then ub_expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `ub_expr' is of the general form.
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign(minus_denom, denominator);
-
-  if (t == 0) {
-    // Case 1: ub_expr == b.
-    generalized_affine_image(var,
-                             GREATER_OR_EQUAL,
-                             lb_expr,
-                             denominator);
-    // Add the constraint `var <= b/denominator'.
-    add_dbm_constraint(0, v, b, denominator);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // Value of the one and only non-zero coefficient in `ub_expr'.
-    const Coefficient& a = ub_expr.get(Variable(w - 1));
-    if (a == denominator || a == minus_denom) {
-      // Case 2: expr == a*w + b, with a == +/- denominator.
-      if (w == v) {
-        // Here `var' occurs in `ub_expr'.
-        // To ease the computation, we add an additional dimension.
-        const Variable new_var(bds_space_dim);
-        add_space_dimensions_and_embed(1);
-        // Constrain the new dimension to be equal to `ub_expr'.
-        affine_image(new_var, ub_expr, denominator);
-        // NOTE: enforce shortest-path closure for precision.
-        shortest_path_closure_assign();
-        PPL_ASSERT(!marked_empty());
-        // Apply the affine lower bound.
-        generalized_affine_image(var,
-                                 GREATER_OR_EQUAL,
-                                 lb_expr,
-                                 denominator);
-        // Now apply the affine upper bound, as recorded in `new_var'.
-        add_constraint(var <= new_var);
-        // Remove the temporarily added dimension.
-        remove_higher_space_dimensions(bds_space_dim);
-        return;
-      }
-      else {
-        // Here `w != v', so that `expr' is of the form
-        // +/-denominator * w + b.
-        // Apply the affine lower bound.
-        generalized_affine_image(var,
-                                 GREATER_OR_EQUAL,
-                                 lb_expr,
-                                 denominator);
-        if (a == denominator) {
-          // Add the new constraint `v - w == b/denominator'.
-          add_dbm_constraint(w, v, b, denominator);
-        }
-        else {
-          // Here a == -denominator, so that we should be adding
-          // the constraint `v + w == b/denominator'.
-          // Approximate it by computing lower and upper bounds for `w'.
-          const N& dbm_w0 = dbm[w][0];
-          if (!is_plus_infinity(dbm_w0)) {
-            // Add the constraint `v <= b/denominator - lower_w'.
-            PPL_DIRTY_TEMP(N, d);
-            div_round_up(d, b, denominator);
-            add_assign_r(dbm[0][v], d, dbm_w0, ROUND_UP);
-            reset_shortest_path_closed();
-          }
-        }
-        PPL_ASSERT(OK());
-        return;
-      }
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // ub_expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t == 1, ub_expr == a*w + b, but a <> +/- denominator.
-  // We will remove all the constraints on `var' and add back
-  // constraints providing upper and lower bounds for `var'.
-
-  // Compute upper approximations for `ub_expr' into `pos_sum'
-  // taking into account the sign of `denominator'.
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign(minus_b, b);
-  const Coefficient& sc_b = is_sc ? b : minus_b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -ub_expr;
-  const Linear_Expression& sc_expr = is_sc ? ub_expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, pos_sum);
-  // Index of the variable that are unbounded in `this->dbm'.
-  PPL_UNINITIALIZED(dimension_type, pos_pinf_index);
-  // Number of unbounded variables found.
-  dimension_type pos_pinf_count = 0;
-
-  // Approximate the inhomogeneous term.
-  assign_r(pos_sum, sc_b, ROUND_UP);
-
-  // Approximate the homogeneous part of `sc_expr'.
-  const DB_Row<N>& dbm_0 = dbm[0];
-  // Speculative allocation of temporaries to be used in the following loop.
-  PPL_DIRTY_TEMP(N, coeff_i);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-  // Note: indices above `w' can be disregarded, as they all have
-  // a zero coefficient in `sc_expr'.
-  for (Linear_Expression::const_iterator i = sc_expr.begin(),
-        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-    const Coefficient& sc_i = *i;
-    const dimension_type i_dim = i.variable().space_dimension();
-    const int sign_i = sgn(sc_i);
-    if (sign_i > 0) {
-      assign_r(coeff_i, sc_i, ROUND_UP);
-      // Approximating `sc_expr'.
-      if (pos_pinf_count <= 1) {
-        const N& up_approx_i = dbm_0[i_dim];
-        if (!is_plus_infinity(up_approx_i))
-          add_mul_assign_r(pos_sum, coeff_i, up_approx_i, ROUND_UP);
-        else {
-          ++pos_pinf_count;
-          pos_pinf_index = i_dim;
-        }
-      }
-    }
-    else {
-      PPL_ASSERT(sign_i < 0);
-      neg_assign(minus_sc_i, sc_i);
-      // Note: using temporary named `coeff_i' to store -coeff_i.
-      assign_r(coeff_i, minus_sc_i, ROUND_UP);
-      // Approximating `sc_expr'.
-      if (pos_pinf_count <= 1) {
-        const N& up_approx_minus_i = dbm[i_dim][0];
-        if (!is_plus_infinity(up_approx_minus_i))
-          add_mul_assign_r(pos_sum, coeff_i, up_approx_minus_i, ROUND_UP);
-        else {
-          ++pos_pinf_count;
-          pos_pinf_index = i_dim;
-        }
-      }
-    }
-  }
-  // Apply the affine lower bound.
-  generalized_affine_image(var,
-                           GREATER_OR_EQUAL,
-                           lb_expr,
-                           denominator);
-  // Return immediately if no approximation could be computed.
-  if (pos_pinf_count > 1) {
-    return;
-  }
-
-  // In the following, shortest-path closure will be definitely lost.
-  reset_shortest_path_closed();
-
-  // Exploit the upper approximation, if possible.
-  if (pos_pinf_count <= 1) {
-    // Compute quotient (if needed).
-    if (sc_denom != 1) {
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(pos_sum, pos_sum, down_sc_denom, ROUND_UP);
-    }
-    // Add the upper bound constraint, if meaningful.
-    if (pos_pinf_count == 0) {
-      // Add the constraint `v <= pos_sum'.
-      dbm[0][v] = pos_sum;
-      // Deduce constraints of the form `v - u', where `u != v'.
-      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, pos_sum);
-    }
-    else
-      // Here `pos_pinf_count == 1'.
-      if (pos_pinf_index != v
-          && sc_expr.get(Variable(pos_pinf_index - 1)) == sc_denom)
-        // Add the constraint `v - pos_pinf_index <= pos_sum'.
-        dbm[pos_pinf_index][v] = pos_sum;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>
-::bounded_affine_preimage(const Variable var,
-                          const Linear_Expression& lb_expr,
-                          const Linear_Expression& ub_expr,
-                          Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // `var' should be one of the dimensions of the BD_Shape.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type v = var.id() + 1;
-  if (v > space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-                                 "v", var);
-  // The dimension of `lb_expr' and `ub_expr' should not be
-  // greater than the dimension of `*this'.
-  const dimension_type lb_space_dim = lb_expr.space_dimension();
-  if (space_dim < lb_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-                                 "lb", lb_expr);
-  const dimension_type ub_space_dim = ub_expr.space_dimension();
-  if (space_dim < ub_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-                                 "ub", ub_expr);
-
-  // Any preimage of an empty BDS is empty.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  if (ub_expr.coefficient(var) == 0) {
-    refine(var, LESS_OR_EQUAL, ub_expr, denominator);
-    generalized_affine_preimage(var, GREATER_OR_EQUAL,
-                                lb_expr, denominator);
-    return;
-  }
-  if (lb_expr.coefficient(var) == 0) {
-    refine(var, GREATER_OR_EQUAL, lb_expr, denominator);
-    generalized_affine_preimage(var, LESS_OR_EQUAL,
-                                ub_expr, denominator);
-    return;
-  }
-
-  const Coefficient& lb_expr_v = lb_expr.coefficient(var);
-  // Here `var' occurs in `lb_expr' and `ub_expr'.
-  // To ease the computation, we add an additional dimension.
-  const Variable new_var(space_dim);
-  add_space_dimensions_and_embed(1);
-  const Linear_Expression lb_inverse
-    = lb_expr - (lb_expr_v + denominator)*var;
-  PPL_DIRTY_TEMP_COEFFICIENT(lb_inverse_denom);
-  neg_assign(lb_inverse_denom, lb_expr_v);
-  affine_image(new_var, lb_inverse, lb_inverse_denom);
-  shortest_path_closure_assign();
-  PPL_ASSERT(!marked_empty());
-  generalized_affine_preimage(var, LESS_OR_EQUAL,
-                              ub_expr, denominator);
-  if (sgn(denominator) == sgn(lb_inverse_denom))
-    add_constraint(var >= new_var);
-  else
-    add_constraint(var <= new_var);
-  // Remove the temporarily added dimension.
-  remove_higher_space_dimensions(space_dim);
-}
-
-template <typename T>
-void
-BD_Shape<T>::generalized_affine_image(const Variable var,
-                                      const Relation_Symbol relsym,
-                                      const Linear_Expression& expr,
-                                      Coefficient_traits::const_reference
-                                      denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-                                 "e", expr);
-
-  // `var' should be one of the dimensions of the BDS.
-  const dimension_type v = var.id() + 1;
-  if (v > space_dim)
-    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-                                 var.id());
-
-  // The relation symbol cannot be a strict relation symbol.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-                           "r is the disequality relation symbol");
-
-  if (relsym == EQUAL) {
-    // The relation symbol is "=":
-    // this is just an affine image computation.
-    affine_image(var, expr, denominator);
-    return;
-  }
-
-  // The image of an empty BDS is empty too.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  const Coefficient& b = expr.inhomogeneous_term();
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Index of the last non-zero coefficient in `expr', if any.
-  dimension_type w = expr.last_nonzero();
-
-  if (w != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w))
-      ++t;
-  }
-
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `expr' is of the general form.
-  DB_Row<N>& dbm_0 = dbm[0];
-  DB_Row<N>& dbm_v = dbm[v];
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign(minus_denom, denominator);
-
-  if (t == 0) {
-    // Case 1: expr == b.
-    // Remove all constraints on `var'.
-    forget_all_dbm_constraints(v);
-    // Both shortest-path closure and reduction are lost.
-    reset_shortest_path_closed();
-    switch (relsym) {
-    case LESS_OR_EQUAL:
-      // Add the constraint `var <= b/denominator'.
-      add_dbm_constraint(0, v, b, denominator);
-      break;
-    case GREATER_OR_EQUAL:
-      // Add the constraint `var >= b/denominator',
-      // i.e., `-var <= -b/denominator',
-      add_dbm_constraint(v, 0, b, minus_denom);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // Value of the one and only non-zero coefficient in `expr'.
-    const Coefficient& a = expr.get(Variable(w - 1));
-    if (a == denominator || a == minus_denom) {
-      // Case 2: expr == a*w + b, with a == +/- denominator.
-      PPL_DIRTY_TEMP(N, d);
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        div_round_up(d, b, denominator);
-        if (w == v) {
-          // `expr' is of the form: a*v + b.
-          // Shortest-path closure and reduction are not preserved.
-          reset_shortest_path_closed();
-          if (a == denominator) {
-            // Translate each constraint `v - w <= dbm_wv'
-            // into the constraint `v - w <= dbm_wv + b/denominator';
-            // forget each constraint `w - v <= dbm_vw'.
-            for (dimension_type i = space_dim + 1; i-- > 0; ) {
-              N& dbm_iv = dbm[i][v];
-              add_assign_r(dbm_iv, dbm_iv, d, ROUND_UP);
-              assign_r(dbm_v[i], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            }
-          }
-          else {
-            // Here `a == -denominator'.
-            // Translate the constraint `0 - v <= dbm_v0'
-            // into the constraint `0 - v <= dbm_v0 + b/denominator'.
-            N& dbm_v0 = dbm_v[0];
-            add_assign_r(dbm_0[v], dbm_v0, d, ROUND_UP);
-            // Forget all the other constraints on `v'.
-            assign_r(dbm_v0, PLUS_INFINITY, ROUND_NOT_NEEDED);
-            forget_binary_dbm_constraints(v);
-          }
-        }
-        else {
-          // Here `w != v', so that `expr' is of the form
-          // +/-denominator * w + b, with `w != v'.
-          // Remove all constraints on `v'.
-          forget_all_dbm_constraints(v);
-          // Shortest-path closure is preserved, but not reduction.
-          if (marked_shortest_path_reduced())
-            reset_shortest_path_reduced();
-          if (a == denominator)
-            // Add the new constraint `v - w <= b/denominator'.
-            add_dbm_constraint(w, v, d);
-          else {
-            // Here a == -denominator, so that we should be adding
-            // the constraint `v <= b/denominator - w'.
-            // Approximate it by computing a lower bound for `w'.
-            const N& dbm_w0 = dbm[w][0];
-            if (!is_plus_infinity(dbm_w0)) {
-              // Add the constraint `v <= b/denominator - lb_w'.
-              add_assign_r(dbm_0[v], d, dbm_w0, ROUND_UP);
-              // Shortest-path closure is not preserved.
-              reset_shortest_path_closed();
-            }
-          }
-        }
-        break;
-
-      case GREATER_OR_EQUAL:
-        div_round_up(d, b, minus_denom);
-        if (w == v) {
-          // `expr' is of the form: a*w + b.
-          // Shortest-path closure and reduction are not preserved.
-          reset_shortest_path_closed();
-          if (a == denominator) {
-            // Translate each constraint `w - v <= dbm_vw'
-            // into the constraint `w - v <= dbm_vw - b/denominator';
-            // forget each constraint `v - w <= dbm_wv'.
-            for (dimension_type i = space_dim + 1; i-- > 0; ) {
-              N& dbm_vi = dbm_v[i];
-              add_assign_r(dbm_vi, dbm_vi, d, ROUND_UP);
-              assign_r(dbm[i][v], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            }
-          }
-          else {
-            // Here `a == -denominator'.
-            // Translate the constraint `0 - v <= dbm_v0'
-            // into the constraint `0 - v <= dbm_0v - b/denominator'.
-            N& dbm_0v = dbm_0[v];
-            add_assign_r(dbm_v[0], dbm_0v, d, ROUND_UP);
-            // Forget all the other constraints on `v'.
-            assign_r(dbm_0v, PLUS_INFINITY, ROUND_NOT_NEEDED);
-            forget_binary_dbm_constraints(v);
-          }
-        }
-        else {
-          // Here `w != v', so that `expr' is of the form
-          // +/-denominator * w + b, with `w != v'.
-          // Remove all constraints on `v'.
-          forget_all_dbm_constraints(v);
-          // Shortest-path closure is preserved, but not reduction.
-          if (marked_shortest_path_reduced())
-            reset_shortest_path_reduced();
-          if (a == denominator)
-            // Add the new constraint `v - w >= b/denominator',
-            // i.e., `w - v <= -b/denominator'.
-            add_dbm_constraint(v, w, d);
-          else {
-            // Here a == -denominator, so that we should be adding
-            // the constraint `v >= -w + b/denominator',
-            // i.e., `-v <= w - b/denominator'.
-            // Approximate it by computing an upper bound for `w'.
-            const N& dbm_0w = dbm_0[w];
-            if (!is_plus_infinity(dbm_0w)) {
-              // Add the constraint `-v <= ub_w - b/denominator'.
-              add_assign_r(dbm_v[0], dbm_0w, d, ROUND_UP);
-              // Shortest-path closure is not preserved.
-              reset_shortest_path_closed();
-            }
-          }
-        }
-        break;
-
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t == 1, expr == a*w + b, but a <> +/- denominator.
-  // We will remove all the constraints on `v' and add back
-  // a constraint providing an upper or a lower bound for `v'
-  // (depending on `relsym').
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign(minus_b, b);
-  const Coefficient& sc_b = is_sc ? b : minus_b;
-  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -expr;
-  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, sum);
-  // Index of variable that is unbounded in `this->dbm'.
-  PPL_UNINITIALIZED(dimension_type, pinf_index);
-  // Number of unbounded variables found.
-  dimension_type pinf_count = 0;
-
-  // Speculative allocation of temporaries to be used in the following loops.
-  PPL_DIRTY_TEMP(N, coeff_i);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-
-  switch (relsym) {
-  case LESS_OR_EQUAL:
-    // Compute an upper approximation for `sc_expr' into `sum'.
-
-    // Approximate the inhomogeneous term.
-    assign_r(sum, sc_b, ROUND_UP);
-    // Approximate the homogeneous part of `sc_expr'.
-    // Note: indices above `w' can be disregarded, as they all have
-    // a zero coefficient in `sc_expr'.
-    PPL_ASSERT(w != 0);
-    for (Linear_Expression::const_iterator i = sc_expr.begin(),
-        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-      const Coefficient& sc_i = *i;
-      const dimension_type i_dim = i.variable().space_dimension();
-      const int sign_i = sgn(sc_i);
-      PPL_ASSERT(sign_i != 0);
-      // Choose carefully: we are approximating `sc_expr'.
-      const N& approx_i = (sign_i > 0) ? dbm_0[i_dim] : dbm[i_dim][0];
-      if (is_plus_infinity(approx_i)) {
-        if (++pinf_count > 1)
-          break;
-        pinf_index = i_dim;
-        continue;
-      }
-      if (sign_i > 0)
-        assign_r(coeff_i, sc_i, ROUND_UP);
-      else {
-        neg_assign(minus_sc_i, sc_i);
-        assign_r(coeff_i, minus_sc_i, ROUND_UP);
-      }
-      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-    }
-
-    // Remove all constraints on `v'.
-    forget_all_dbm_constraints(v);
-    // Shortest-path closure is preserved, but not reduction.
-    if (marked_shortest_path_reduced())
-      reset_shortest_path_reduced();
-    // Return immediately if no approximation could be computed.
-    if (pinf_count > 1) {
-      PPL_ASSERT(OK());
-      return;
-    }
-
-    // Divide by the (sign corrected) denominator (if needed).
-    if (sc_denom != 1) {
-      // Before computing the quotient, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-    }
-
-    if (pinf_count == 0) {
-      // Add the constraint `v <= sum'.
-      add_dbm_constraint(0, v, sum);
-      // Deduce constraints of the form `v - u', where `u != v'.
-      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, sum);
-    }
-    else if (pinf_count == 1)
-      if (pinf_index != v && expr.get(Variable(pinf_index - 1)) == denominator)
-        // Add the constraint `v - pinf_index <= sum'.
-        add_dbm_constraint(pinf_index, v, sum);
-    break;
-
-  case GREATER_OR_EQUAL:
-    // Compute an upper approximation for `-sc_expr' into `sum'.
-    // Note: approximating `-sc_expr' from above and then negating the
-    // result is the same as approximating `sc_expr' from below.
-
-    // Approximate the inhomogeneous term.
-    assign_r(sum, minus_sc_b, ROUND_UP);
-    // Approximate the homogeneous part of `-sc_expr'.
-    for (Linear_Expression::const_iterator i = sc_expr.begin(),
-        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
-      const Coefficient& sc_i = *i;
-      const int sign_i = sgn(sc_i);
-      PPL_ASSERT(sign_i != 0);
-      const dimension_type i_dim = i.variable().space_dimension();
-      // Choose carefully: we are approximating `-sc_expr'.
-      const N& approx_i = (sign_i > 0) ? dbm[i_dim][0] : dbm_0[i_dim];
-      if (is_plus_infinity(approx_i)) {
-        if (++pinf_count > 1)
-          break;
-        pinf_index = i_dim;
-        continue;
-      }
-      if (sign_i > 0)
-        assign_r(coeff_i, sc_i, ROUND_UP);
-      else {
-        neg_assign(minus_sc_i, sc_i);
-        assign_r(coeff_i, minus_sc_i, ROUND_UP);
-      }
-      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-    }
-
-    // Remove all constraints on `var'.
-    forget_all_dbm_constraints(v);
-    // Shortest-path closure is preserved, but not reduction.
-    if (marked_shortest_path_reduced())
-      reset_shortest_path_reduced();
-    // Return immediately if no approximation could be computed.
-    if (pinf_count > 1) {
-      PPL_ASSERT(OK());
-      return;
-    }
-
-    // Divide by the (sign corrected) denominator (if needed).
-    if (sc_denom != 1) {
-      // Before computing the quotient, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-    }
-
-    if (pinf_count == 0) {
-      // Add the constraint `v >= -sum', i.e., `-v <= sum'.
-      add_dbm_constraint(v, 0, sum);
-      // Deduce constraints of the form `u - v', where `u != v'.
-      deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, sum);
-    }
-    else if (pinf_count == 1)
-      if (pinf_index != v && expr.get(Variable(pinf_index - 1)) == denominator)
-        // Add the constraint `v - pinf_index >= -sum',
-        // i.e., `pinf_index - v <= sum'.
-        add_dbm_constraint(v, pinf_index, sum);
-    break;
-
-  default:
-    // We already dealt with the other cases.
-    PPL_UNREACHABLE;
-    break;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::generalized_affine_image(const Linear_Expression& lhs,
-                                      const Relation_Symbol relsym,
-                                      const Linear_Expression& rhs) {
-  // Dimension-compatibility checks.
-  // The dimension of `lhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type lhs_space_dim = lhs.space_dimension();
-  if (space_dim < lhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-                                 "e1", lhs);
-
-  // The dimension of `rhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type rhs_space_dim = rhs.space_dimension();
-  if (space_dim < rhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-                                 "e2", rhs);
-
-  // Strict relation symbols are not admitted for BDSs.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-                           "r is the disequality relation symbol");
-
-  // The image of an empty BDS is empty.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lhs': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t_lhs = 0;
-  // Index of the last non-zero coefficient in `lhs', if any.
-  dimension_type j_lhs = lhs.last_nonzero();
-
-  if (j_lhs != 0) {
-    ++t_lhs;
-    if (!lhs.all_zeroes(1, j_lhs))
-      ++t_lhs;
-    --j_lhs;
-  }
-
-  const Coefficient& b_lhs = lhs.inhomogeneous_term();
-
-  if (t_lhs == 0) {
-    // `lhs' is a constant.
-    // In principle, it is sufficient to add the constraint `lhs relsym rhs'.
-    // Note that this constraint is a bounded difference if `t_rhs <= 1'
-    // or `t_rhs > 1' and `rhs == a*v - a*w + b_rhs'. If `rhs' is of a
-    // more general form, it will be simply ignored.
-    // TODO: if it is not a bounded difference, should we compute
-    // approximations for this constraint?
-    switch (relsym) {
-    case LESS_OR_EQUAL:
-      refine_no_check(lhs <= rhs);
-      break;
-    case EQUAL:
-      refine_no_check(lhs == rhs);
-      break;
-    case GREATER_OR_EQUAL:
-      refine_no_check(lhs >= rhs);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-  }
-  else if (t_lhs == 1) {
-    // Here `lhs == a_lhs * v + b_lhs'.
-    // Independently from the form of `rhs', we can exploit the
-    // method computing generalized affine images for a single variable.
-    Variable v(j_lhs);
-    // Compute a sign-corrected relation symbol.
-    const Coefficient& denom = lhs.coefficient(v);
-    Relation_Symbol new_relsym = relsym;
-    if (denom < 0) {
-      if (relsym == LESS_OR_EQUAL)
-        new_relsym = GREATER_OR_EQUAL;
-      else if (relsym == GREATER_OR_EQUAL)
-        new_relsym = LESS_OR_EQUAL;
-    }
-    Linear_Expression expr = rhs - b_lhs;
-    generalized_affine_image(v, new_relsym, expr, denom);
-  }
-  else {
-    // Here `lhs' is of the general form, having at least two variables.
-    // Compute the set of variables occurring in `lhs'.
-    std::vector<Variable> lhs_vars;
-    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
-          i != i_end; ++i)
-      lhs_vars.push_back(i.variable());
-
-    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
-    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
-      // `lhs' and `rhs' variables are disjoint.
-      // Existentially quantify all variables in the lhs.
-      for (dimension_type i = lhs_vars.size(); i-- > 0; )
-        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
-      // Constrain the left hand side expression so that it is related to
-      // the right hand side expression as dictated by `relsym'.
-      // TODO: if the following constraint is NOT a bounded difference,
-      // it will be simply ignored. Should we compute approximations for it?
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(lhs <= rhs);
-        break;
-      case EQUAL:
-        refine_no_check(lhs == rhs);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(lhs >= rhs);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-    }
-    else {
-      // Some variables in `lhs' also occur in `rhs'.
-
-#if 1 // Simplified computation (see the TODO note below).
-
-      for (dimension_type i = lhs_vars.size(); i-- > 0; )
-        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
-
-#else // Currently unnecessarily complex computation.
-
-      // More accurate computation that is worth doing only if
-      // the following TODO note is accurately dealt with.
-
-      // To ease the computation, we add an additional dimension.
-      const Variable new_var(space_dim);
-      add_space_dimensions_and_embed(1);
-      // Constrain the new dimension to be equal to `rhs'.
-      // NOTE: calling affine_image() instead of refine_no_check()
-      // ensures some approximation is tried even when the constraint
-      // is not a bounded difference.
-      affine_image(new_var, rhs);
-      // Existentially quantify all variables in the lhs.
-      // NOTE: enforce shortest-path closure for precision.
-      shortest_path_closure_assign();
-      PPL_ASSERT(!marked_empty());
-      for (dimension_type i = lhs_vars.size(); i-- > 0; )
-        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
-      // Constrain the new dimension so that it is related to
-      // the left hand side as dictated by `relsym'.
-      // TODO: each one of the following constraints is definitely NOT
-      // a bounded differences (since it has 3 variables at least).
-      // Thus, the method refine_no_check() will simply ignore it.
-      // Should we compute approximations for this constraint?
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(lhs <= new_var);
-        break;
-      case EQUAL:
-        refine_no_check(lhs == new_var);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(lhs >= new_var);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-      // Remove the temporarily added dimension.
-      remove_higher_space_dimensions(space_dim-1);
-#endif // Currently unnecessarily complex computation.
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::generalized_affine_preimage(const Variable var,
-                                         const Relation_Symbol relsym,
-                                         const Linear_Expression& expr,
-                                         Coefficient_traits::const_reference
-                                         denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-                                 "e", expr);
-
-  // `var' should be one of the dimensions of the BDS.
-  const dimension_type v = var.id() + 1;
-  if (v > space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-                                 var.id());
-
-  // The relation symbol cannot be a strict relation symbol.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "r is the disequality relation symbol");
-
-  if (relsym == EQUAL) {
-    // The relation symbol is "=":
-    // this is just an affine preimage computation.
-    affine_preimage(var, expr, denominator);
-    return;
-  }
-
-  // The preimage of an empty BDS is empty too.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  // Check whether the preimage of this affine relation can be easily
-  // computed as the image of its inverse relation.
-  const Coefficient& expr_v = expr.coefficient(var);
-  if (expr_v != 0) {
-    const Relation_Symbol reversed_relsym = (relsym == LESS_OR_EQUAL)
-      ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
-    const Linear_Expression inverse
-      = expr - (expr_v + denominator)*var;
-    PPL_DIRTY_TEMP_COEFFICIENT(inverse_denom);
-    neg_assign(inverse_denom, expr_v);
-    const Relation_Symbol inverse_relsym
-      = (sgn(denominator) == sgn(inverse_denom)) ? relsym : reversed_relsym;
-    generalized_affine_image(var, inverse_relsym, inverse, inverse_denom);
-    return;
-  }
-
-  refine(var, relsym, expr, denominator);
-  // If the shrunk BD_Shape is empty, its preimage is empty too; ...
-  if (is_empty())
-    return;
-  // ...  otherwise, since the relation was not invertible,
-  // we just forget all constraints on `v'.
-  forget_all_dbm_constraints(v);
-  // Shortest-path closure is preserved, but not reduction.
-  if (marked_shortest_path_reduced())
-    reset_shortest_path_reduced();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::generalized_affine_preimage(const Linear_Expression& lhs,
-                                         const Relation_Symbol relsym,
-                                         const Linear_Expression& rhs) {
-  // Dimension-compatibility checks.
-  // The dimension of `lhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type bds_space_dim = space_dimension();
-  const dimension_type lhs_space_dim = lhs.space_dimension();
-  if (bds_space_dim < lhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
-                                 "e1", lhs);
-
-  // The dimension of `rhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type rhs_space_dim = rhs.space_dimension();
-  if (bds_space_dim < rhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
-                                 "e2", rhs);
-
-  // Strict relation symbols are not admitted for BDSs.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
-                           "r is the disequality relation symbol");
-
-  // The preimage of an empty BDS is empty.
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lhs': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t_lhs = 0;
-  // Index of the last non-zero coefficient in `lhs', if any.
-  dimension_type j_lhs = lhs.last_nonzero();
-
-  if (j_lhs != 0) {
-    ++t_lhs;
-    if (!lhs.all_zeroes(1, j_lhs))
-      ++t_lhs;
-    --j_lhs;
-  }
-
-  const Coefficient& b_lhs = lhs.inhomogeneous_term();
-
-  if (t_lhs == 0) {
-    // `lhs' is a constant.
-    // In this case, preimage and image happen to be the same.
-    generalized_affine_image(lhs, relsym, rhs);
-    return;
-  }
-  else if (t_lhs == 1) {
-    // Here `lhs == a_lhs * v + b_lhs'.
-    // Independently from the form of `rhs', we can exploit the
-    // method computing generalized affine preimages for a single variable.
-    Variable v(j_lhs);
-    // Compute a sign-corrected relation symbol.
-    const Coefficient& denom = lhs.coefficient(v);
-    Relation_Symbol new_relsym = relsym;
-    if (denom < 0) {
-      if (relsym == LESS_OR_EQUAL)
-        new_relsym = GREATER_OR_EQUAL;
-      else if (relsym == GREATER_OR_EQUAL)
-        new_relsym = LESS_OR_EQUAL;
-    }
-    Linear_Expression expr = rhs - b_lhs;
-    generalized_affine_preimage(v, new_relsym, expr, denom);
-  }
-  else {
-    // Here `lhs' is of the general form, having at least two variables.
-    // Compute the set of variables occurring in `lhs'.
-    std::vector<Variable> lhs_vars;
-    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
-          i != i_end; ++i)
-      lhs_vars.push_back(i.variable());
-
-    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
-    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
-      // `lhs' and `rhs' variables are disjoint.
-
-      // Constrain the left hand side expression so that it is related to
-      // the right hand side expression as dictated by `relsym'.
-      // TODO: if the following constraint is NOT a bounded difference,
-      // it will be simply ignored. Should we compute approximations for it?
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(lhs <= rhs);
-        break;
-      case EQUAL:
-        refine_no_check(lhs == rhs);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(lhs >= rhs);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-
-      // If the shrunk BD_Shape is empty, its preimage is empty too; ...
-      if (is_empty())
-        return;
-      // Existentially quantify all variables in the lhs.
-      for (dimension_type i = lhs_vars.size(); i-- > 0; )
-        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
-    }
-    else {
-
-      // Some variables in `lhs' also occur in `rhs'.
-      // To ease the computation, we add an additional dimension.
-      const Variable new_var(bds_space_dim);
-      add_space_dimensions_and_embed(1);
-      // Constrain the new dimension to be equal to `lhs'.
-      // NOTE: calling affine_image() instead of refine_no_check()
-      // ensures some approximation is tried even when the constraint
-      // is not a bounded difference.
-      affine_image(new_var, lhs);
-      // Existentiallly quantify all variables in the lhs.
-      // NOTE: enforce shortest-path closure for precision.
-      shortest_path_closure_assign();
-      PPL_ASSERT(!marked_empty());
-      for (dimension_type i = lhs_vars.size(); i-- > 0; )
-        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
-      // Constrain the new dimension so that it is related to
-      // the left hand side as dictated by `relsym'.
-      // Note: if `rhs == a_rhs*v + b_rhs' where `a_rhs' is in {0, 1},
-      // then one of the following constraints will be added,
-      // since it is a bounded difference. Else the method
-      // refine_no_check() will ignore it, because the
-      // constraint is NOT a bounded difference.
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(new_var <= rhs);
-        break;
-      case EQUAL:
-        refine_no_check(new_var == rhs);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(new_var >= rhs);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-      // Remove the temporarily added dimension.
-      remove_higher_space_dimensions(bds_space_dim);
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-Constraint_System
-BD_Shape<T>::constraints() const {
-  const dimension_type space_dim = space_dimension();
-  Constraint_System cs;
-  cs.set_space_dimension(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cs = Constraint_System::zero_dim_empty();
-    return cs;
-  }
-
-  if (marked_empty()) {
-    cs.insert(Constraint::zero_dim_false());
-    return cs;
-  }
-
-  if (marked_shortest_path_reduced()) {
-    // Disregard redundant constraints.
-    cs = minimized_constraints();
-    return cs;
-  }
-
-  PPL_DIRTY_TEMP_COEFFICIENT(a);
-  PPL_DIRTY_TEMP_COEFFICIENT(b);
-  // Go through all the unary constraints in `dbm'.
-  const DB_Row<N>& dbm_0 = dbm[0];
-  for (dimension_type j = 1; j <= space_dim; ++j) {
-    const Variable x(j-1);
-    const N& dbm_0j = dbm_0[j];
-    const N& dbm_j0 = dbm[j][0];
-    if (is_additive_inverse(dbm_j0, dbm_0j)) {
-      // We have a unary equality constraint.
-      numer_denom(dbm_0j, b, a);
-      cs.insert(a*x == b);
-    }
-    else {
-      // We have 0, 1 or 2 unary inequality constraints.
-      if (!is_plus_infinity(dbm_0j)) {
-        numer_denom(dbm_0j, b, a);
-        cs.insert(a*x <= b);
-      }
-      if (!is_plus_infinity(dbm_j0)) {
-        numer_denom(dbm_j0, b, a);
-        cs.insert(-a*x <= b);
-      }
-    }
-  }
-
-  // Go through all the binary constraints in `dbm'.
-  for (dimension_type i = 1; i <= space_dim; ++i) {
-    const Variable y(i-1);
-    const DB_Row<N>& dbm_i = dbm[i];
-    for (dimension_type j = i + 1; j <= space_dim; ++j) {
-      const Variable x(j-1);
-      const N& dbm_ij = dbm_i[j];
-      const N& dbm_ji = dbm[j][i];
-      if (is_additive_inverse(dbm_ji, dbm_ij)) {
-        // We have a binary equality constraint.
-        numer_denom(dbm_ij, b, a);
-        cs.insert(a*x - a*y == b);
-      }
-      else {
-        // We have 0, 1 or 2 binary inequality constraints.
-        if (!is_plus_infinity(dbm_ij)) {
-          numer_denom(dbm_ij, b, a);
-          cs.insert(a*x - a*y <= b);
-        }
-        if (!is_plus_infinity(dbm_ji)) {
-          numer_denom(dbm_ji, b, a);
-          cs.insert(a*y - a*x <= b);
-        }
-      }
-    }
-  }
-  return cs;
-}
-
-template <typename T>
-Constraint_System
-BD_Shape<T>::minimized_constraints() const {
-  shortest_path_reduction_assign();
-  const dimension_type space_dim = space_dimension();
-  Constraint_System cs;
-  cs.set_space_dimension(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cs = Constraint_System::zero_dim_empty();
-    return cs;
-  }
-
-  if (marked_empty()) {
-    cs.insert(Constraint::zero_dim_false());
-    return cs;
-  }
-
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-
-  // Compute leader information.
-  std::vector<dimension_type> leaders;
-  compute_leaders(leaders);
-  std::vector<dimension_type> leader_indices;
-  compute_leader_indices(leaders, leader_indices);
-  const dimension_type num_leaders = leader_indices.size();
-
-  // Go through the non-leaders to generate equality constraints.
-  const DB_Row<N>& dbm_0 = dbm[0];
-  for (dimension_type i = 1; i <= space_dim; ++i) {
-    const dimension_type leader = leaders[i];
-    if (i != leader) {
-      // Generate the constraint relating `i' and its leader.
-      if (leader == 0) {
-        // A unary equality has to be generated.
-        PPL_ASSERT(!is_plus_infinity(dbm_0[i]));
-        numer_denom(dbm_0[i], numer, denom);
-        cs.insert(denom*Variable(i-1) == numer);
-      }
-      else {
-        // A binary equality has to be generated.
-        PPL_ASSERT(!is_plus_infinity(dbm[i][leader]));
-        numer_denom(dbm[i][leader], numer, denom);
-        cs.insert(denom*Variable(leader-1) - denom*Variable(i-1) == numer);
-      }
-    }
-  }
-
-  // Go through the leaders to generate inequality constraints.
-  // First generate all the unary inequalities.
-  const Bit_Row& red_0 = redundancy_dbm[0];
-  for (dimension_type l_i = 1; l_i < num_leaders; ++l_i) {
-    const dimension_type i = leader_indices[l_i];
-    if (!red_0[i]) {
-      numer_denom(dbm_0[i], numer, denom);
-      cs.insert(denom*Variable(i-1) <= numer);
-    }
-    if (!redundancy_dbm[i][0]) {
-      numer_denom(dbm[i][0], numer, denom);
-      cs.insert(-denom*Variable(i-1) <= numer);
-    }
-  }
-  // Then generate all the binary inequalities.
-  for (dimension_type l_i = 1; l_i < num_leaders; ++l_i) {
-    const dimension_type i = leader_indices[l_i];
-    const DB_Row<N>& dbm_i = dbm[i];
-    const Bit_Row& red_i = redundancy_dbm[i];
-    for (dimension_type l_j = l_i + 1; l_j < num_leaders; ++l_j) {
-      const dimension_type j = leader_indices[l_j];
-      if (!red_i[j]) {
-        numer_denom(dbm_i[j], numer, denom);
-        cs.insert(denom*Variable(j-1) - denom*Variable(i-1) <= numer);
-      }
-      if (!redundancy_dbm[j][i]) {
-        numer_denom(dbm[j][i], numer, denom);
-        cs.insert(denom*Variable(i-1) - denom*Variable(j-1) <= numer);
-      }
-    }
-  }
-  return cs;
-}
-
-template <typename T>
-void
-BD_Shape<T>::expand_space_dimension(Variable var, dimension_type m) {
-  dimension_type old_dim = space_dimension();
-  // `var' should be one of the dimensions of the vector space.
-  if (var.space_dimension() > old_dim)
-    throw_dimension_incompatible("expand_space_dimension(v, m)", "v", var);
-
-  // The space dimension of the resulting BDS should not
-  // overflow the maximum allowed space dimension.
-  if (m > max_space_dimension() - space_dimension())
-    throw_invalid_argument("expand_dimension(v, m)",
-                           "adding m new space dimensions exceeds "
-                           "the maximum allowed space dimension");
-
-  // Nothing to do, if no dimensions must be added.
-  if (m == 0)
-    return;
-
-  // Add the required new dimensions.
-  add_space_dimensions_and_embed(m);
-
-  // For each constraints involving variable `var', we add a
-  // similar constraint with the new variable substituted for
-  // variable `var'.
-  const dimension_type v_id = var.id() + 1;
-  const DB_Row<N>& dbm_v = dbm[v_id];
-  for (dimension_type i = old_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    const N& dbm_i_v = dbm[i][v_id];
-    const N& dbm_v_i = dbm_v[i];
-    for (dimension_type j = old_dim+1; j < old_dim+m+1; ++j) {
-      dbm_i[j] = dbm_i_v;
-      dbm[j][i] = dbm_v_i;
-    }
-  }
-  // In general, adding a constraint does not preserve the shortest-path
-  // closure or reduction of the bounded difference shape.
-  if (marked_shortest_path_closed())
-    reset_shortest_path_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
-                                   Variable dest) {
-  const dimension_type space_dim = space_dimension();
-  // `dest' should be one of the dimensions of the BDS.
-  if (dest.space_dimension() > space_dim)
-    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-                                 "v", dest);
-
-  // The folding of no dimensions is a no-op.
-  if (vars.empty())
-    return;
-
-  // All variables in `vars' should be dimensions of the BDS.
-  if (vars.space_dimension() > space_dim)
-    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-                                 vars.space_dimension());
-
-  // Moreover, `dest.id()' should not occur in `vars'.
-  if (vars.find(dest.id()) != vars.end())
-    throw_invalid_argument("fold_space_dimensions(vs, v)",
-                           "v should not occur in vs");
-
-  shortest_path_closure_assign();
-  if (!marked_empty()) {
-    // Recompute the elements of the row and the column corresponding
-    // to variable `dest' by taking the join of their value with the
-    // value of the corresponding elements in the row and column of the
-    // variable `vars'.
-    const dimension_type v_id = dest.id() + 1;
-    DB_Row<N>& dbm_v = dbm[v_id];
-    for (Variables_Set::const_iterator i = vars.begin(),
-           vs_end = vars.end(); i != vs_end; ++i) {
-      const dimension_type to_be_folded_id = *i + 1;
-      const DB_Row<N>& dbm_to_be_folded_id = dbm[to_be_folded_id];
-      for (dimension_type j = space_dim + 1; j-- > 0; ) {
-        max_assign(dbm[j][v_id], dbm[j][to_be_folded_id]);
-        max_assign(dbm_v[j], dbm_to_be_folded_id[j]);
-      }
-    }
-  }
-  remove_space_dimensions(vars);
-}
-
-template <typename T>
-void
-BD_Shape<T>::drop_some_non_integer_points(Complexity_Class) {
-  if (std::numeric_limits<T>::is_integer)
-    return;
-
-  const dimension_type space_dim = space_dimension();
-  shortest_path_closure_assign();
-  if (space_dim == 0 || marked_empty())
-    return;
-
-  for (dimension_type i = space_dim + 1; i-- > 0; ) {
-    DB_Row<N>& dbm_i = dbm[i];
-    for (dimension_type j = space_dim + 1; j-- > 0; )
-      if (i != j)
-        drop_some_non_integer_points_helper(dbm_i[j]);
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-BD_Shape<T>::drop_some_non_integer_points(const Variables_Set& vars,
-                                          Complexity_Class) {
-  // Dimension-compatibility check.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dim < min_space_dim)
-    throw_dimension_incompatible("drop_some_non_integer_points(vs, cmpl)",
-                                 min_space_dim);
-
-  if (std::numeric_limits<T>::is_integer || min_space_dim == 0)
-    return;
-
-  shortest_path_closure_assign();
-  if (marked_empty())
-    return;
-
-  const Variables_Set::const_iterator v_begin = vars.begin();
-  const Variables_Set::const_iterator v_end = vars.end();
-  PPL_ASSERT(v_begin != v_end);
-  // Unary constraints on a variable occurring in `vars'.
-  DB_Row<N>& dbm_0 = dbm[0];
-  for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
-    const dimension_type i = *v_i + 1;
-    drop_some_non_integer_points_helper(dbm_0[i]);
-    drop_some_non_integer_points_helper(dbm[i][0]);
-  }
-
-  // Binary constraints where both variables occur in `vars'.
-  for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
-    const dimension_type i = *v_i + 1;
-    DB_Row<N>& dbm_i = dbm[i];
-    for (Variables_Set::const_iterator v_j = v_begin; v_j != v_end; ++v_j) {
-      const dimension_type j = *v_j + 1;
-      if (i != j)
-        drop_some_non_integer_points_helper(dbm_i[j]);
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-/*! \relates Parma_Polyhedra_Library::BD_Shape */
-template <typename T>
-std::ostream&
-IO_Operators::operator<<(std::ostream& s, const BD_Shape<T>& bds) {
-  typedef typename BD_Shape<T>::coefficient_type N;
-  if (bds.is_universe())
-    s << "true";
-  else {
-    // We control empty bounded difference shape.
-    dimension_type n = bds.space_dimension();
-    if (bds.marked_empty())
-      s << "false";
-    else {
-      PPL_DIRTY_TEMP(N, v);
-      bool first = true;
-      for (dimension_type i = 0; i <= n; ++i)
-        for (dimension_type j = i + 1; j <= n; ++j) {
-          const N& c_i_j = bds.dbm[i][j];
-          const N& c_j_i = bds.dbm[j][i];
-          if (is_additive_inverse(c_j_i, c_i_j)) {
-            // We will print an equality.
-            if (first)
-              first = false;
-            else
-              s << ", ";
-            if (i == 0) {
-              // We have got a equality constraint with one variable.
-              s << Variable(j - 1);
-              s << " = " << c_i_j;
-            }
-            else {
-              // We have got a equality constraint with two variables.
-              if (sgn(c_i_j) >= 0) {
-                s << Variable(j - 1);
-                s << " - ";
-                s << Variable(i - 1);
-                s << " = " << c_i_j;
-              }
-              else {
-                s << Variable(i - 1);
-                s << " - ";
-                s << Variable(j - 1);
-                s << " = " << c_j_i;
-              }
-            }
-          }
-          else {
-            // We will print a non-strict inequality.
-            if (!is_plus_infinity(c_j_i)) {
-              if (first)
-                first = false;
-              else
-                s << ", ";
-              if (i == 0) {
-                // We have got a constraint with only one variable.
-                s << Variable(j - 1);
-                neg_assign_r(v, c_j_i, ROUND_DOWN);
-                s << " >= " << v;
-              }
-              else {
-                // We have got a constraint with two variables.
-                if (sgn(c_j_i) >= 0) {
-                  s << Variable(i - 1);
-                  s << " - ";
-                  s << Variable(j - 1);
-                  s << " <= " << c_j_i;
-                }
-                else {
-                  s << Variable(j - 1);
-                  s << " - ";
-                  s << Variable(i - 1);
-                  neg_assign_r(v, c_j_i, ROUND_DOWN);
-                  s << " >= " << v;
-                }
-              }
-            }
-            if (!is_plus_infinity(c_i_j)) {
-              if (first)
-                first = false;
-              else
-                s << ", ";
-              if (i == 0) {
-                // We have got a constraint with only one variable.
-                s << Variable(j - 1);
-                s << " <= " << c_i_j;
-              }
-              else {
-                // We have got a constraint with two variables.
-                if (sgn(c_i_j) >= 0) {
-                  s << Variable(j - 1);
-                  s << " - ";
-                  s << Variable(i - 1);
-                  s << " <= " << c_i_j;
-                }
-                else {
-                  s << Variable(i - 1);
-                  s << " - ";
-                  s << Variable(j - 1);
-                  neg_assign_r(v, c_i_j, ROUND_DOWN);
-                  s << " >= " << v;
-                }
-              }
-            }
-          }
-        }
-    }
-  }
-  return s;
-}
-
-template <typename T>
-void
-BD_Shape<T>::ascii_dump(std::ostream& s) const {
-  status.ascii_dump(s);
-  s << "\n";
-  dbm.ascii_dump(s);
-  s << "\n";
-  redundancy_dbm.ascii_dump(s);
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, BD_Shape<T>)
-
-template <typename T>
-bool
-BD_Shape<T>::ascii_load(std::istream& s) {
-  if (!status.ascii_load(s))
-    return false;
-  if (!dbm.ascii_load(s))
-    return false;
-  if (!redundancy_dbm.ascii_load(s))
-    return false;
-  return true;
-}
-
-template <typename T>
-memory_size_type
-BD_Shape<T>::external_memory_in_bytes() const {
-  return dbm.external_memory_in_bytes()
-    + redundancy_dbm.external_memory_in_bytes();
-}
-
-template <typename T>
-bool
-BD_Shape<T>::OK() const {
-  // Check whether the difference-bound matrix is well-formed.
-  if (!dbm.OK())
-    return false;
-
-  // Check whether the status information is legal.
-  if (!status.OK())
-    return false;
-
-  // An empty BDS is OK.
-  if (marked_empty())
-    return true;
-
-  // MINUS_INFINITY cannot occur at all.
-  for (dimension_type i = dbm.num_rows(); i-- > 0; )
-    for (dimension_type j = dbm.num_rows(); j-- > 0; )
-      if (is_minus_infinity(dbm[i][j])) {
-#ifndef NDEBUG
-        using namespace Parma_Polyhedra_Library::IO_Operators;
-        std::cerr << "BD_Shape::dbm[" << i << "][" << j << "] = "
-                  << dbm[i][j] << "!"
-                  << std::endl;
-#endif
-        return false;
-      }
-
-  // On the main diagonal only PLUS_INFINITY can occur.
-  for (dimension_type i = dbm.num_rows(); i-- > 0; )
-    if (!is_plus_infinity(dbm[i][i])) {
-#ifndef NDEBUG
-      using namespace Parma_Polyhedra_Library::IO_Operators;
-      std::cerr << "BD_Shape::dbm[" << i << "][" << i << "] = "
-                << dbm[i][i] << "!  (+inf was expected.)"
-                << std::endl;
-#endif
-      return false;
-    }
-
-  // Check whether the shortest-path closure information is legal.
-  if (marked_shortest_path_closed()) {
-    BD_Shape x = *this;
-    x.reset_shortest_path_closed();
-    x.shortest_path_closure_assign();
-    if (x.dbm != dbm) {
-#ifndef NDEBUG
-      std::cerr << "BD_Shape is marked as closed but it is not!"
-                << std::endl;
-#endif
-      return false;
-    }
-  }
-
-  // The following tests might result in false alarms when using floating
-  // point coefficients: they are only meaningful if the coefficient type
-  // base is exact (since otherwise shortest-path closure is approximated).
-  if (std::numeric_limits<coefficient_type_base>::is_exact) {
-
-    // Check whether the shortest-path reduction information is legal.
-    if (marked_shortest_path_reduced()) {
-      // A non-redundant constraint cannot be equal to PLUS_INFINITY.
-      for (dimension_type i = dbm.num_rows(); i-- > 0; )
-        for (dimension_type j = dbm.num_rows(); j-- > 0; )
-          if (!redundancy_dbm[i][j] && is_plus_infinity(dbm[i][j])) {
-#ifndef NDEBUG
-            using namespace Parma_Polyhedra_Library::IO_Operators;
-            std::cerr << "BD_Shape::dbm[" << i << "][" << j << "] = "
-                      << dbm[i][j] << " is marked as non-redundant!"
-                      << std::endl;
-#endif
-            return false;
-          }
-
-      BD_Shape x = *this;
-      x.reset_shortest_path_reduced();
-      x.shortest_path_reduction_assign();
-      if (x.redundancy_dbm != redundancy_dbm) {
-#ifndef NDEBUG
-        std::cerr << "BD_Shape is marked as reduced but it is not!"
-                  << std::endl;
-#endif
-        return false;
-      }
-    }
-  }
-
-  // All checks passed.
-  return true;
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          const BD_Shape& y) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", y->space_dimension() == " << y.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          dimension_type required_dim) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", required dimension == " << required_dim << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          const Constraint& c) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", c->space_dimension == " << c.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          const Congruence& cg) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", cg->space_dimension == " << cg.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          const Generator& g) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", g->space_dimension == " << g.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_expression_too_complex(const char* method,
-                                          const Linear_Expression& le) {
-  using namespace IO_Operators;
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << le << " is too complex.";
-  throw std::invalid_argument(s.str());
-}
-
-
-template <typename T>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          const char* le_name,
-                                          const Linear_Expression& le) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", " << le_name << "->space_dimension() == "
-    << le.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-template<typename Interval_Info>
-void
-BD_Shape<T>::throw_dimension_incompatible(const char* method,
-                                          const char* lf_name,
-                                          const Linear_Form< Interval<T,
-					  Interval_Info> >& lf) const {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", " << lf_name << "->space_dimension() == "
-    << lf.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-BD_Shape<T>::throw_invalid_argument(const char* method, const char* reason) {
-  std::ostringstream s;
-  s << "PPL::BD_Shape::" << method << ":" << std::endl
-    << reason << ".";
-  throw std::invalid_argument(s.str());
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_BD_Shape_templates_hh)
diff --git a/src/BD_Shape.types.hh b/src/BD_Shape.types.hh
deleted file mode 100644
index 5dc0f96..0000000
--- a/src/BD_Shape.types.hh
+++ /dev/null
@@ -1,25 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_BD_Shape_types_hh
-#define PPL_BD_Shape_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-class BD_Shape;
-
-class BD_Shape_Helpers;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_BD_Shape_types_hh)
diff --git a/src/BD_Shape_defs.hh b/src/BD_Shape_defs.hh
new file mode 100644
index 0000000..0bfe836
--- /dev/null
+++ b/src/BD_Shape_defs.hh
@@ -0,0 +1,2371 @@
+/* BD_Shape class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BD_Shape_defs_hh
+#define PPL_BD_Shape_defs_hh 1
+
+#include "BD_Shape_types.hh"
+#include "globals_defs.hh"
+#include "Constraint_types.hh"
+#include "Generator_types.hh"
+#include "Congruence_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_System_types.hh"
+#include "Congruence_System_types.hh"
+#include "Poly_Con_Relation_types.hh"
+#include "Poly_Gen_Relation_types.hh"
+#include "Polyhedron_types.hh"
+#include "Box_types.hh"
+#include "Grid_types.hh"
+#include "Octagonal_Shape_types.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_types.hh"
+#include "DB_Matrix_defs.hh"
+#include "DB_Row_defs.hh"
+#include "Checked_Number_defs.hh"
+#include "WRD_coefficient_types_defs.hh"
+#include "Bit_Matrix_defs.hh"
+#include "Coefficient_defs.hh"
+#include "Interval_types.hh"
+#include "Linear_Form_types.hh"
+#include <cstddef>
+#include <iosfwd>
+#include <vector>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::BD_Shape
+  Writes a textual representation of \p bds on \p s:
+  <CODE>false</CODE> is written if \p bds is an empty polyhedron;
+  <CODE>true</CODE> is written if \p bds is the universe polyhedron;
+  a system of constraints defining \p bds is written otherwise,
+  all constraints separated by ", ".
+*/
+template <typename T>
+std::ostream&
+operator<<(std::ostream& s, const BD_Shape<T>& bds);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates BD_Shape */
+template <typename T>
+void swap(BD_Shape<T>& x, BD_Shape<T>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are the same BDS.
+/*! \relates BD_Shape
+  Note that \p x and \p y may be dimension-incompatible shapes:
+  in this case, the value <CODE>false</CODE> is returned.
+*/
+template <typename T>
+bool operator==(const BD_Shape<T>& x, const BD_Shape<T>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are not the same BDS.
+/*! \relates BD_Shape
+  Note that \p x and \p y may be dimension-incompatible shapes:
+  in this case, the value <CODE>true</CODE> is returned.
+*/
+template <typename T>
+bool operator!=(const BD_Shape<T>& x, const BD_Shape<T>& y);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const BD_Shape<T>& x,
+                                 const BD_Shape<T>& y,
+                                 Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const BD_Shape<T>& x,
+                                 const BD_Shape<T>& y,
+                                 Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const BD_Shape<T>& x,
+                                 const BD_Shape<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const BD_Shape<T>& x,
+                               const BD_Shape<T>& y,
+                               Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const BD_Shape<T>& x,
+                               const BD_Shape<T>& y,
+                               Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const BD_Shape<T>& x,
+                               const BD_Shape<T>& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const BD_Shape<T>& x,
+                                const BD_Shape<T>& y,
+                                Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const BD_Shape<T>& x,
+                                const BD_Shape<T>& y,
+                                Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates BD_Shape
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const BD_Shape<T>& x,
+                                const BD_Shape<T>& y,
+                                Rounding_Dir dir,
+                                Temp& tmp0,
+                                Temp& tmp1,
+                                Temp& tmp2);
+
+// This class contains some helper functions that need to be friends of
+// Linear_Expression.
+class BD_Shape_Helpers {
+public:
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! Decodes the constraint \p c as a bounded difference.
+  /*! \relates BD_Shape
+    \return
+    <CODE>true</CODE> if the constraint \p c is a
+    \ref Bounded_Difference_Shapes "bounded difference";
+    <CODE>false</CODE> otherwise.
+
+    \param c
+    The constraint to be decoded.
+
+    \param c_num_vars
+    If <CODE>true</CODE> is returned, then it will be set to the number
+    of variables having a non-zero coefficient. The only legal values
+    will therefore be 0, 1 and 2.
+
+    \param c_first_var
+    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
+    then it will be set to the index of the first variable having
+    a non-zero coefficient in \p c.
+
+    \param c_second_var
+    If <CODE>true</CODE> is returned and if \p c_num_vars is set to 2,
+    then it will be set to the index of the second variable having
+    a non-zero coefficient in \p c. If \p c_num_vars is set to 1, this must be
+    0.
+
+    \param c_coeff
+    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
+    then it will be set to the value of the first non-zero coefficient
+    in \p c.
+  */
+  #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  static bool extract_bounded_difference(const Constraint& c,
+                                         dimension_type& c_num_vars,
+                                         dimension_type& c_first_var,
+                                         dimension_type& c_second_var,
+                                         Coefficient& c_coeff);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Extracts leader indices from the predecessor relation.
+/*! \relates BD_Shape */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void compute_leader_indices(const std::vector<dimension_type>& predecessor,
+                            std::vector<dimension_type>& indices);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A bounded difference shape.
+/*! \ingroup PPL_CXX_interface
+  The class template BD_Shape<T> allows for the efficient representation
+  of a restricted kind of <EM>topologically closed</EM> convex polyhedra
+  called <EM>bounded difference shapes</EM> (BDSs, for short).
+  The name comes from the fact that the closed affine half-spaces that
+  characterize the polyhedron can be expressed by constraints of the form
+  \f$\pm x_i \leq k\f$ or \f$x_i - x_j \leq k\f$, where the inhomogeneous
+  term \f$k\f$ is a rational number.
+
+  Based on the class template type parameter \p T, a family of extended
+  numbers is built and used to approximate the inhomogeneous term of
+  bounded differences. These extended numbers provide a representation
+  for the value \f$+\infty\f$, as well as <EM>rounding-aware</EM>
+  implementations for several arithmetic functions.
+  The value of the type parameter \p T may be one of the following:
+    - a bounded precision integer type (e.g., \c int32_t or \c int64_t);
+    - a bounded precision floating point type (e.g., \c float or \c double);
+    - an unbounded integer or rational type, as provided by GMP
+      (i.e., \c mpz_class or \c mpq_class).
+
+  The user interface for BDSs is meant to be as similar as possible to
+  the one developed for the polyhedron class C_Polyhedron.
+
+  The domain of BD shapes <EM>optimally supports</EM>:
+    - tautological and inconsistent constraints and congruences;
+    - bounded difference constraints;
+    - non-proper congruences (i.e., equalities) that are expressible
+      as bounded-difference constraints.
+
+  Depending on the method, using a constraint or congruence that is not
+  optimally supported by the domain will either raise an exception or
+  result in a (possibly non-optimal) upward approximation.
+
+  A constraint is a bounded difference if it has the form
+    \f[
+      a_i x_i - a_j x_j \relsym b
+    \f]
+  where \f$\mathord{\relsym} \in \{ \leq, =, \geq \}\f$ and
+  \f$a_i\f$, \f$a_j\f$, \f$b\f$ are integer coefficients such that
+  \f$a_i = 0\f$, or \f$a_j = 0\f$, or \f$a_i = a_j\f$.
+  The user is warned that the above bounded difference Constraint object
+  will be mapped into a \e correct and \e optimal approximation that,
+  depending on the expressive power of the chosen template argument \p T,
+  may loose some precision. Also note that strict constraints are not
+  bounded differences.
+
+  For instance, a Constraint object encoding \f$3x - 3y \leq 1\f$ will be
+  approximated by:
+    - \f$x - y \leq 1\f$,
+      if \p T is a (bounded or unbounded) integer type;
+    - \f$x - y \leq \frac{1}{3}\f$,
+      if \p T is the unbounded rational type \c mpq_class;
+    - \f$x - y \leq k\f$, where \f$k > \frac{1}{3}\f$,
+      if \p T is a floating point type (having no exact representation
+      for \f$\frac{1}{3}\f$).
+
+  On the other hand, depending from the context, a Constraint object
+  encoding \f$3x - y \leq 1\f$ will be either upward approximated
+  (e.g., by safely ignoring it) or it will cause an exception.
+
+  In the following examples it is assumed that the type argument \p T
+  is one of the possible instances listed above and that variables
+  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE> are defined
+  (where they are used) as follows:
+  \code
+    Variable x(0);
+    Variable y(1);
+    Variable z(2);
+  \endcode
+
+  \par Example 1
+  The following code builds a BDS corresponding to a cube in \f$\Rset^3\f$,
+  given as a system of constraints:
+  \code
+    Constraint_System cs;
+    cs.insert(x >= 0);
+    cs.insert(x <= 1);
+    cs.insert(y >= 0);
+    cs.insert(y <= 1);
+    cs.insert(z >= 0);
+    cs.insert(z <= 1);
+    BD_Shape<T> bd(cs);
+  \endcode
+  Since only those constraints having the syntactic form of a
+  <EM>bounded difference</EM> are optimally supported, the following code
+  will throw an exception (caused by constraints 7, 8 and 9):
+  \code
+    Constraint_System cs;
+    cs.insert(x >= 0);
+    cs.insert(x <= 1);
+    cs.insert(y >= 0);
+    cs.insert(y <= 1);
+    cs.insert(z >= 0);
+    cs.insert(z <= 1);
+    cs.insert(x + y <= 0);      // 7
+    cs.insert(x - z + x >= 0);  // 8
+    cs.insert(3*z - y <= 1);    // 9
+    BD_Shape<T> bd(cs);
+  \endcode
+*/
+template <typename T>
+class Parma_Polyhedra_Library::BD_Shape {
+private:
+  /*! \brief
+    The (extended) numeric type of the inhomogeneous term of
+    the inequalities defining a BDS.
+  */
+#ifndef NDEBUG
+  typedef Checked_Number<T, Debug_WRD_Extended_Number_Policy> N;
+#else
+  typedef Checked_Number<T, WRD_Extended_Number_Policy> N;
+#endif
+
+public:
+  //! The numeric base type upon which bounded differences are built.
+  typedef T coefficient_type_base;
+
+  /*! \brief
+    The (extended) numeric type of the inhomogeneous term of the
+    inequalities defining a BDS.
+  */
+  typedef N coefficient_type;
+
+  //! Returns the maximum space dimension that a BDS can handle.
+  static dimension_type max_space_dimension();
+
+  /*! \brief
+    Returns \c false indicating that this domain cannot recycle constraints.
+  */
+  static bool can_recycle_constraint_systems();
+
+  /*! \brief
+    Returns \c false indicating that this domain cannot recycle congruences.
+  */
+  static bool can_recycle_congruence_systems();
+
+  //! \name Constructors, Assignment, Swap and Destructor
+  //@{
+
+  //! Builds a universe or empty BDS of the specified space dimension.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the BDS;
+
+    \param kind
+    Specifies whether the universe or the empty BDS has to be built.
+  */
+  explicit BD_Shape(dimension_type num_dimensions = 0,
+                    Degenerate_Element kind = UNIVERSE);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  BD_Shape(const BD_Shape& y,
+           Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a conservative, upward approximation of \p y.
+  /*!
+    The complexity argument is ignored.
+  */
+  template <typename U>
+  explicit BD_Shape(const BD_Shape<U>& y,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a BDS from the system of constraints \p cs.
+  /*!
+    The BDS inherits the space dimension of \p cs.
+
+    \param cs
+    A system of BD constraints.
+
+    \exception std::invalid_argument
+    Thrown if \p cs contains a constraint which is not optimally supported
+    by the BD shape domain.
+  */
+  explicit BD_Shape(const Constraint_System& cs);
+
+  //! Builds a BDS from a system of congruences.
+  /*!
+    The BDS inherits the space dimension of \p cgs
+
+    \param cgs
+    A system of congruences.
+
+    \exception std::invalid_argument
+    Thrown if \p cgs contains congruences which are not optimally
+    supported by the BD shape domain.
+  */
+  explicit BD_Shape(const Congruence_System& cgs);
+
+  //! Builds a BDS from the system of generators \p gs.
+  /*!
+    Builds the smallest BDS containing the polyhedron defined by \p gs.
+    The BDS inherits the space dimension of \p gs.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+  */
+  explicit BD_Shape(const Generator_System& gs);
+
+  //! Builds a BDS from the polyhedron \p ph.
+  /*!
+    Builds a BDS containing \p ph using algorithms whose complexity
+    does not exceed the one specified by \p complexity.  If
+    \p complexity is \p ANY_COMPLEXITY, then the BDS built is the
+    smallest one containing \p ph.
+  */
+  explicit BD_Shape(const Polyhedron& ph,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a BDS out of a box.
+  /*!
+    The BDS inherits the space dimension of the box.
+    The built BDS is the most precise BDS that includes the box.
+
+    \param box
+    The box representing the BDS to be built.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename Interval>
+  explicit BD_Shape(const Box<Interval>& box,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a BDS out of a grid.
+  /*!
+    The BDS inherits the space dimension of the grid.
+    The built BDS is the most precise BDS that includes the grid.
+
+    \param grid
+    The grid used to build the BDS.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p grid exceeds the maximum
+    allowed space dimension.
+  */
+  explicit BD_Shape(const Grid& grid,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a BDS from an octagonal shape.
+  /*!
+    The BDS inherits the space dimension of the octagonal shape.
+    The built BDS is the most precise BDS that includes the octagonal shape.
+
+    \param os
+    The octagonal shape used to build the BDS.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p os exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename U>
+  explicit BD_Shape(const Octagonal_Shape<U>& os,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator
+    (\p *this and \p y can be dimension-incompatible).
+  */
+  BD_Shape& operator=(const BD_Shape& y);
+
+  /*! \brief
+    Swaps \p *this with \p y
+    (\p *this and \p y can be dimension-incompatible).
+  */
+  void m_swap(BD_Shape& y);
+
+  //! Destructor.
+  ~BD_Shape();
+
+  //@} Constructors, Assignment, Swap and Destructor
+
+  //! \name Member Functions that Do Not Modify the BD_Shape
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
+    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
+    of \p *this.
+  */
+  dimension_type affine_dimension() const;
+
+  //! Returns a system of constraints defining \p *this.
+  Constraint_System constraints() const;
+
+  //! Returns a minimized system of constraints defining \p *this.
+  Constraint_System minimized_constraints() const;
+
+  //! Returns a system of (equality) congruences satisfied by \p *this.
+  Congruence_System congruences() const;
+
+  /*! \brief
+    Returns a minimal system of (equality) congruences
+    satisfied by \p *this with the same affine dimension as \p *this.
+  */
+  Congruence_System minimized_congruences() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from above in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from below in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
+    and \p maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value;
+
+    \param g
+    When maximization succeeds, will be assigned the point or
+    closure point where \p expr reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p g are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value;
+
+    \param g
+    When minimization succeeds, will be assigned a point or
+    closure point where \p expr reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p g are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if there exist a
+    unique value \p val such that \p *this
+    saturates the equality <CODE>expr = val</CODE>.
+
+    \param expr
+    The linear expression for which the frequency is needed;
+
+    \param freq_n
+    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
+    Present for interface compatibility with class Grid, where
+    the \ref Grid_Frequency "frequency" can have a non-zero value;
+
+    \param freq_d
+    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
+
+    \param val_n
+    The numerator of \p val;
+
+    \param val_d
+    The denominator of \p val;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
+    \p val_n and \p val_d are left untouched.
+  */
+  bool frequency(const Linear_Expression& expr,
+                 Coefficient& freq_n, Coefficient& freq_d,
+                 Coefficient& val_n, Coefficient& val_d) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool contains(const BD_Shape& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool strictly_contains(const BD_Shape& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool is_disjoint_from(const BD_Shape& y) const;
+
+  //! Returns the relations holding between \p *this and the constraint \p c.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  //! Returns the relations holding between \p *this and the congruence \p cg.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  //! Returns the relations holding between \p *this and the generator \p g.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  Poly_Gen_Relation relation_with(const Generator& g) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is an empty BDS.
+  bool is_empty() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a universe BDS.
+  bool is_universe() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
+  bool is_discrete() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a topologically closed subset of the vector space.
+  */
+  bool is_topologically_closed() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a bounded BDS.
+  bool is_bounded() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains at least one integer point.
+  */
+  bool contains_integer_point() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  bool constrains(Variable var) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this satisfies
+    all its invariants.
+  */
+  bool OK() const;
+
+  //@} Member Functions that Do Not Modify the BD_Shape
+
+  //! \name Space-Dimension Preserving Member Functions that May Modify the BD_Shape
+  //@{
+
+  /*! \brief
+    Adds a copy of constraint \p c to the system of bounded differences
+    defining \p *this.
+
+    \param c
+    The constraint to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible,
+    or \p c is not optimally supported by the BD shape domain.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds a copy of congruence \p cg to the system of congruences of \p *this.
+
+    \param cg
+    The congruence to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible,
+    or \p cg is not optimally supported by the BD shape domain.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of bounded differences
+    defining \p *this.
+
+    \param  cs
+    The constraints that will be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible,
+    or \p cs contains a constraint which is not optimally supported
+    by the BD shape domain.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of constraints
+    of \p *this.
+
+    \param cs
+    The constraint system to be added to \p *this.  The constraints in
+    \p cs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible,
+    or \p cs contains a constraint which is not optimally supported
+    by the BD shape domain.
+
+    \warning
+    The only assumption that can be made on \p cs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_constraints(Constraint_System& cs);
+
+  /*! \brief
+    Adds to \p *this constraints equivalent to the congruences in \p cgs.
+
+    \param cgs
+    Contains the congruences that will be added to the system of
+    constraints of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    or \p cgs contains a congruence which is not optimally supported
+    by the BD shape domain.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Adds to \p *this constraints equivalent to the congruences in \p cgs.
+
+    \param cgs
+    Contains the congruences that will be added to the system of
+    constraints of \p *this. Its elements may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    or \p cgs contains a congruence which is not optimally supported
+    by the BD shape domain.
+
+    \warning
+    The only assumption that can be made on \p cgs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_congruences(Congruence_System& cgs);
+
+  /*! \brief
+    Uses a copy of constraint \p c to refine the system of bounded differences
+    defining \p *this.
+
+    \param c
+    The constraint. If it is not a bounded difference, it will be ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  /*! \brief
+    Uses a copy of congruence \p cg to refine the system of
+    bounded differences  of \p *this.
+
+    \param cg
+    The congruence. If it is not a bounded difference equality, it
+    will be ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+  /*! \brief
+    Uses a copy of the constraints in \p cs to refine the system of
+    bounded differences defining \p *this.
+
+    \param  cs
+    The constraint system to be used. Constraints that are not bounded
+    differences are ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Uses a copy of the congruences in \p cgs to refine the system of
+    bounded differences defining \p *this.
+
+    \param  cgs
+    The congruence system to be used. Congruences that are not bounded
+    difference equalities are ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Refines the system of BD_Shape constraints defining \p *this using
+    the constraint expressed by \p left \f$\leq\f$ \p right.
+
+    \param left
+    The linear form on intervals with floating point boundaries that
+    is at the left of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param right
+    The linear form on intervals with floating point boundaries that
+    is at the right of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \exception std::invalid_argument
+    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
+
+    This function is used in abstract interpretation to model a filter
+    that is generated by a comparison of two expressions that are correctly
+    approximated by \p left and \p right respectively.
+  */
+  template <typename Interval_Info>
+  void refine_with_linear_form_inequality(
+                   const Linear_Form<Interval<T, Interval_Info> >& left,
+                   const Linear_Form<Interval<T, Interval_Info> >& right);
+
+  /*! \brief
+    Refines the system of BD_Shape constraints defining \p *this using
+    the constraint expressed by \p left \f$\relsym\f$ \p right, where
+    \f$\relsym\f$ is the relation symbol specified by \p relsym.
+
+    \param left
+    The linear form on intervals with floating point boundaries that
+    is at the left of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param right
+    The linear form on intervals with floating point boundaries that
+    is at the right of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param relsym
+    The relation symbol.
+
+    \exception std::invalid_argument
+    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
+
+    \exception std::runtime_error
+    Thrown if \p relsym is not a valid relation symbol.
+
+    This function is used in abstract interpretation to model a filter
+    that is generated by a comparison of two expressions that are correctly
+    approximated by \p left and \p right respectively.
+  */
+  template <typename Interval_Info>
+  void generalized_refine_with_linear_form_inequality(
+                   const Linear_Form<Interval<T, Interval_Info> >& left,
+                   const Linear_Form<Interval<T, Interval_Info> >& right,
+                   Relation_Symbol relsym);
+
+  //! Applies to \p dest the interval constraints embedded in \p *this.
+  /*!
+    \param dest
+    The object to which the constraints will be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest.
+
+    The template type parameter U must provide the following methods.
+    \code
+      dimension_type space_dimension() const
+    \endcode
+    returns the space dimension of the object.
+    \code
+      void set_empty()
+    \endcode
+    sets the object to an empty object.
+    \code
+      bool restrict_lower(dimension_type dim, const T& lb)
+    \endcode
+    restricts the object by applying the lower bound \p lb to the space
+    dimension \p dim and returns <CODE>false</CODE> if and only if the
+    object becomes empty.
+    \code
+      bool restrict_upper(dimension_type dim, const T& ub)
+    \endcode
+    restricts the object by applying the upper bound \p ub to the space
+    dimension \p dim and returns <CODE>false</CODE> if and only if the
+    object becomes empty.
+  */
+  template <typename U>
+  void export_interval_constraints(U& dest) const;
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  //! Assigns to \p *this the intersection of \p *this and \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void intersection_assign(const BD_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this the smallest BDS containing the union
+    of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void upper_bound_assign(const BD_Shape& y);
+
+  /*! \brief
+    If the upper bound of \p *this and \p y is exact, it is assigned
+    to \p *this and <CODE>true</CODE> is returned,
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool upper_bound_assign_if_exact(const BD_Shape& y);
+
+  /*! \brief
+    If the \e integer upper bound of \p *this and \p y is exact,
+    it is assigned to \p *this and <CODE>true</CODE> is returned;
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \note
+    The integer upper bound of two rational BDS is the smallest rational
+    BDS containing all the integral points of the two arguments.
+    This method requires that the coefficient type parameter \c T is
+    an integral type.
+  */
+  bool integer_upper_bound_assign_if_exact(const BD_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this the smallest BD shape containing
+    the set difference of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void difference_assign(const BD_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this a \ref Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+    If \c false is returned, then the intersection is empty.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool simplify_using_context_assign(const BD_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine image"
+    of \p *this under the function mapping variable \p var into the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned.
+
+    \param expr
+    The numerator of the affine expression.
+
+    \param denominator
+    The denominator of the affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension of \p *this.
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                    = Coefficient_one());
+
+  // FIXME: To be completed.
+  /*! \brief
+    Assigns to \p *this the \ref affine_form_relation "affine form image"
+    of \p *this under the function mapping variable \p var into the
+    affine expression(s) specified by \p lf.
+
+    \param var
+    The variable to which the affine expression is assigned.
+
+    \param lf
+    The linear form on intervals with floating point coefficients that
+    defines the affine expression. ALL of its coefficients MUST be bounded.
+
+    \exception std::invalid_argument
+    Thrown if \p lf and \p *this are dimension-incompatible or if \p var
+    is not a dimension of \p *this.
+  */
+  template <typename Interval_Info>
+  void affine_form_image(Variable var,
+                        const Linear_Form<Interval<T, Interval_Info> >& lf);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine preimage"
+    of \p *this under the function mapping variable \p var into the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is substituted.
+
+    \param expr
+    The numerator of the affine expression.
+
+    \param denominator
+    The denominator of the affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension of \p *this.
+  */
+  void affine_preimage(Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                       = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine transfer function.
+
+    \param relsym
+    The relation symbol.
+
+    \param expr
+    The numerator of the right hand side affine expression.
+
+    \param denominator
+    The denominator of the right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension
+    of \p *this or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_image(Variable var,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression.
+
+    \param relsym
+    The relation symbol.
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_image(const Linear_Expression& lhs,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine transfer function.
+
+    \param relsym
+    The relation symbol.
+
+    \param expr
+    The numerator of the right hand side affine expression.
+
+    \param denominator
+    The denominator of the right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension
+    of \p *this or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_preimage(Variable var,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& expr,
+                                   Coefficient_traits::const_reference
+                                   denominator = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression.
+
+    \param relsym
+    The relation symbol.
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_preimage(const Linear_Expression& lhs,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
+
+  /*!
+    \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+  /*!
+    \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void time_elapse_assign(const BD_Shape& y);
+
+  /*! \brief
+    \ref Wrapping_Operator "Wraps" the specified dimensions of the
+    vector space.
+
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be wrapped.
+
+    \param w
+    The width of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param r
+    The representation of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param o
+    The overflow behavior of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param cs_p
+    Possibly null pointer to a constraint system whose variables
+    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
+    variables not in \p vars, the behavior is undefined.
+    When non-null, the pointed-to constraint system is assumed to
+    represent the conditional or looping construct guard with respect
+    to which wrapping is performed.  Since wrapping requires the
+    computation of upper bounds and due to non-distributivity of
+    constraint refinement over upper bounds, passing a constraint
+    system in this way can be more precise than refining the result of
+    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
+
+    \param complexity_threshold
+    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
+    higher values result in possibly improved precision.
+
+    \param wrap_individually
+    <CODE>true</CODE> if the dimensions should be wrapped individually
+    (something that results in much greater efficiency to the detriment of
+    precision).
+
+    \exception std::invalid_argument
+    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
+    \p vars, or if \p *this is dimension-incompatible \p vars or with
+    <CODE>*cs_p</CODE>.
+  */
+  void wrap_assign(const Variables_Set& vars,
+                   Bounded_Integer_Type_Width w,
+                   Bounded_Integer_Type_Representation r,
+                   Bounded_Integer_Type_Overflow o,
+                   const Constraint_System* cs_p = 0,
+                   unsigned complexity_threshold = 16,
+                   bool wrap_individually = true);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void CC76_extrapolation_assign(const BD_Shape& y, unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param first
+    An iterator referencing the first stop-point.
+
+    \param last
+    An iterator referencing one past the last stop-point.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  template <typename Iterator>
+  void CC76_extrapolation_assign(const BD_Shape& y,
+                                 Iterator first, Iterator last,
+                                 unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref BHMZ05_widening "BHMZ05-widening" of \p *this and \p y.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void BHMZ05_widening_assign(const BD_Shape& y, unsigned* tp = 0);
+
+  /*! \brief
+    Improves the result of the \ref BHMZ05_widening "BHMZ05-widening"
+    computation by also enforcing those constraints in \p cs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param cs
+    The system of constraints used to improve the widened BDS.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
+    if \p cs contains a strict inequality.
+  */
+  void limited_BHMZ05_extrapolation_assign(const BD_Shape& y,
+                                           const Constraint_System& cs,
+                                           unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of restoring in \p y the constraints
+    of \p *this that were lost by
+    \ref CC76_extrapolation "CC76-extrapolation" applications.
+
+    \param y
+    A BDS that <EM>must</EM> contain \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \note
+    As was the case for widening operators, the argument \p y is meant to
+    denote the value computed in the previous iteration step, whereas
+    \p *this denotes the value computed in the current iteration step
+    (in the <EM>decreasing</EM> iteration sequence). Hence, the call
+    <CODE>x.CC76_narrowing_assign(y)</CODE> will assign to \p x
+    the result of the computation \f$\mathtt{y} \Delta \mathtt{x}\f$.
+  */
+  void CC76_narrowing_assign(const BD_Shape& y);
+
+  /*! \brief
+    Improves the result of the \ref CC76_extrapolation "CC76-extrapolation"
+    computation by also enforcing those constraints in \p cs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param cs
+    The system of constraints used to improve the widened BDS.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
+    if \p cs contains a strict inequality.
+  */
+  void limited_CC76_extrapolation_assign(const BD_Shape& y,
+                                         const Constraint_System& cs,
+                                         unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref H79_widening "H79-widening" between \p *this and \p y.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void H79_widening_assign(const BD_Shape& y, unsigned* tp = 0);
+
+  //! Same as H79_widening_assign(y, tp).
+  void widening_assign(const BD_Shape& y, unsigned* tp = 0);
+
+  /*! \brief
+    Improves the result of the \ref H79_widening "H79-widening"
+    computation by also enforcing those constraints in \p cs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    A BDS that <EM>must</EM> be contained in \p *this.
+
+    \param cs
+    The system of constraints used to improve the widened BDS.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are dimension-incompatible.
+  */
+  void limited_H79_extrapolation_assign(const BD_Shape& y,
+                                        const Constraint_System& cs,
+                                        unsigned* tp = 0);
+
+  //@} Space-Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  //! Adds \p m new dimensions and embeds the old BDS into the new space.
+  /*!
+    \param m
+    The number of dimensions to add.
+
+    The new dimensions will be those having the highest indexes in the new
+    BDS, which is defined by a system of bounded differences in which the
+    variables running through the new dimensions are unconstrained.
+    For instance, when starting from the BDS \f$\cB \sseq \Rset^2\f$
+    and adding a third dimension, the result will be the BDS
+    \f[
+      \bigl\{\,
+        (x, y, z)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cB
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Adds \p m new dimensions to the BDS and does not embed it in
+    the new vector space.
+
+    \param m
+    The number of dimensions to add.
+
+    The new dimensions will be those having the highest indexes in the
+    new BDS, which is defined by a system of bounded differences in
+    which the variables running through the new dimensions are all
+    constrained to be equal to 0.
+    For instance, when starting from the BDS \f$\cB \sseq \Rset^2\f$
+    and adding a third dimension, the result will be the BDS
+    \f[
+      \bigl\{\,
+        (x, y, 0)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cB
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  /*! \brief
+    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
+    of \p *this and \p y, taken in this order.
+
+    \exception std::length_error
+    Thrown if the concatenation would cause the vector space
+    to exceed dimension <CODE>max_space_dimension()</CODE>.
+  */
+  void concatenate_assign(const BD_Shape& y);
+
+  //! Removes all the specified dimensions.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the dimensions to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the Variable
+    objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher dimensions so that the resulting space
+    will have dimension \p new_dimension.
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimension is greater than the space dimension
+    of \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
+
+    \param pfunc
+    The partial function specifying the destiny of each dimension.
+
+    The template type parameter Partial_Function must provide
+    the following methods.
+    \code
+      bool has_empty_codomain() const
+    \endcode
+    returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty co-domain (i.e., it is always undefined).
+    The <CODE>has_empty_codomain()</CODE> method will always be called
+    before the methods below.  However, if
+    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
+    of the functions below will be called.
+    \code
+      dimension_type max_in_codomain() const
+    \endcode
+    returns the maximum value that belongs to the co-domain
+    of the partial function.
+    \code
+      bool maps(dimension_type i, dimension_type& j) const
+    \endcode
+    Let \f$f\f$ be the represented function and \f$k\f$ be the value
+    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
+    assigned to \p j and <CODE>true</CODE> is returned.
+    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
+    returned.
+
+    The result is undefined if \p pfunc does not encode a partial
+    function with the properties described in the
+    \ref Mapping_the_Dimensions_of_the_Vector_Space
+    "specification of the mapping operator".
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref expand_space_dimension "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.
+    Also thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are \ref fold_space_dimensions "folded"
+    into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //! Refines \p store with the constraints defining \p *this.
+  /*!
+    \param store
+    The interval floating point abstract store to refine.
+  */
+  template <typename Interval_Info>
+  void refine_fp_interval_abstract_store(Box<Interval<T, Interval_Info> >&
+                                         store) const;
+
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If \p x and \p y are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  friend bool operator==<T>(const BD_Shape<T>& x, const BD_Shape<T>& y);
+
+  template <typename Temp, typename To, typename U>
+  friend bool Parma_Polyhedra_Library::rectilinear_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const BD_Shape<U>& x, const BD_Shape<U>& y, const Rounding_Dir dir,
+   Temp& tmp0, Temp& tmp1, Temp& tmp2);
+  template <typename Temp, typename To, typename U>
+  friend bool Parma_Polyhedra_Library::euclidean_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const BD_Shape<U>& x, const BD_Shape<U>& y, const Rounding_Dir dir,
+   Temp& tmp0, Temp& tmp1, Temp& tmp2);
+  template <typename Temp, typename To, typename U>
+  friend bool Parma_Polyhedra_Library::l_infinity_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const BD_Shape<U>& x, const BD_Shape<U>& y, const Rounding_Dir dir,
+   Temp& tmp0, Temp& tmp1, Temp& tmp2);
+
+private:
+  template <typename U> friend class Parma_Polyhedra_Library::BD_Shape;
+  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
+
+  //! The matrix representing the system of bounded differences.
+  DB_Matrix<N> dbm;
+
+#define PPL_IN_BD_Shape_CLASS
+#include "BDS_Status_idefs.hh"
+#undef PPL_IN_BD_Shape_CLASS
+
+  //! The status flags to keep track of the internal state.
+  Status status;
+
+  //! A matrix indicating which constraints are redundant.
+  Bit_Matrix redundancy_dbm;
+
+  //! Returns <CODE>true</CODE> if the BDS is the zero-dimensional universe.
+  bool marked_zero_dim_univ() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the BDS is known to be empty.
+
+    The return value <CODE>false</CODE> does not necessarily
+    implies that \p *this is non-empty.
+  */
+  bool marked_empty() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the system of bounded differences
+    is known to be shortest-path closed.
+
+    The return value <CODE>false</CODE> does not necessarily
+    implies that <CODE>this->dbm</CODE> is not shortest-path closed.
+  */
+  bool marked_shortest_path_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the system of bounded differences
+    is known to be shortest-path reduced.
+
+    The return value <CODE>false</CODE> does not necessarily
+    implies that <CODE>this->dbm</CODE> is not shortest-path reduced.
+  */
+  bool marked_shortest_path_reduced() const;
+
+  //! Turns \p *this into an empty BDS.
+  void set_empty();
+
+  //! Turns \p *this into an zero-dimensional universe BDS.
+  void set_zero_dim_univ();
+
+  //! Marks \p *this as shortest-path closed.
+  void set_shortest_path_closed();
+
+  //! Marks \p *this as shortest-path closed.
+  void set_shortest_path_reduced();
+
+  //! Marks \p *this as possibly not shortest-path closed.
+  void reset_shortest_path_closed();
+
+  //! Marks \p *this as possibly not shortest-path reduced.
+  void reset_shortest_path_reduced();
+
+  //! Assigns to <CODE>this->dbm</CODE> its shortest-path closure.
+  void shortest_path_closure_assign() const;
+
+  /*! \brief
+    Assigns to <CODE>this->dbm</CODE> its shortest-path closure and
+    records into <CODE>this->redundancy_dbm</CODE> which of the entries
+    in <CODE>this->dbm</CODE> are redundant.
+  */
+  void shortest_path_reduction_assign() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if <CODE>this->dbm</CODE>
+    is shortest-path closed and <CODE>this->redundancy_dbm</CODE>
+    correctly flags the redundant entries in <CODE>this->dbm</CODE>.
+  */
+  bool is_shortest_path_reduced() const;
+
+  /*! \brief
+    Incrementally computes shortest-path closure, assuming that only
+    constraints affecting variable \p var need to be considered.
+
+    \note
+    It is assumed that \c *this, which was shortest-path closed,
+    has only been modified by adding constraints affecting variable
+    \p var. If this assumption is not satisfied, i.e., if a non-redundant
+    constraint not affecting variable \p var has been added, the behavior
+    is undefined.
+  */
+  void incremental_shortest_path_closure_assign(Variable var) const;
+
+  //! Checks if and how \p expr is bounded in \p *this.
+  /*!
+    Returns <CODE>true</CODE> if and only if \p from_above is
+    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
+    or \p from_above is <CODE>false</CODE> and \p expr is bounded
+    from below in \p *this.
+
+    \param expr
+    The linear expression to test;
+
+    \param from_above
+    <CODE>true</CODE> if and only if the boundedness of interest is
+    "from above".
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds(const Linear_Expression& expr, bool from_above) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p
+    *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p * this;
+
+    \param g
+    When maximization or minimization succeeds, will be assigned
+    a point or closure point where \p expr reaches the
+    corresponding extremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p g are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator& g) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p
+    *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p * this;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p point are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
+
+  /*! \brief
+    If the upper bound of \p *this and \p y is exact it is assigned
+    to \p *this and \c true is returned, otherwise \c false is returned.
+
+    Current implementation is based on a variant of Algorithm 4.1 in
+      A. Bemporad, K. Fukuda, and F. D. Torrisi
+      <em>Convexity Recognition of the Union of Polyhedra</em>
+      Technical Report AUT00-13, ETH Zurich, 2000
+    tailored to the special case of BD shapes.
+
+    \note
+    It is assumed that \p *this and \p y are dimension-compatible;
+    if the assumption does not hold, the behavior is undefined.
+  */
+  bool BFT00_upper_bound_assign_if_exact(const BD_Shape& y);
+
+  /*! \brief
+    If the upper bound of \p *this and \p y is exact it is assigned
+    to \p *this and \c true is returned, otherwise \c false is returned.
+
+    Implementation for the rational (resp., integer) case is based on
+    Theorem 5.2 (resp. Theorem 5.3) of \ref BHZ09b "[BHZ09b]".
+    The Boolean template parameter \c integer_upper_bound allows for
+    choosing between the rational and integer upper bound algorithms.
+
+    \note
+    It is assumed that \p *this and \p y are dimension-compatible;
+    if the assumption does not hold, the behavior is undefined.
+
+    \note
+    The integer case is only enabled if T is an integer data type.
+  */
+  template <bool integer_upper_bound>
+  bool BHZ09_upper_bound_assign_if_exact(const BD_Shape& y);
+
+  /*! \brief
+    Uses the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be added. Non BD constraints are ignored.
+
+    \warning
+    If \p c and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Constraint& c);
+
+  /*! \brief
+    Uses the congruence \p cg to refine \p *this.
+
+    \param cg
+    The congruence to be added.
+    Nontrivial proper congruences are ignored.
+    Non BD equalities are ignored.
+
+    \warning
+    If \p cg and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Congruence& cg);
+
+  //! Adds the constraint <CODE>dbm[i][j] \<= k</CODE>.
+  void add_dbm_constraint(dimension_type i, dimension_type j, const N& k);
+
+  //! Adds the constraint <CODE>dbm[i][j] \<= numer/denom</CODE>.
+  void add_dbm_constraint(dimension_type i, dimension_type j,
+                          Coefficient_traits::const_reference numer,
+                          Coefficient_traits::const_reference denom);
+
+  /*! \brief
+    Adds to the BDS the constraint
+    \f$\mathrm{var} \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$.
+
+    Note that the coefficient of \p var in \p expr is null.
+  */
+  void refine(Variable var, Relation_Symbol relsym,
+              const Linear_Expression& expr,
+              Coefficient_traits::const_reference denominator
+              = Coefficient_one());
+
+  //! Removes all the constraints on row/column \p v.
+  void forget_all_dbm_constraints(dimension_type v);
+  //! Removes all binary constraints on row/column \p v.
+  void forget_binary_dbm_constraints(dimension_type v);
+
+  //! An helper function for the computation of affine relations.
+  /*!
+    For each dbm index \p u (less than or equal to \p last_v and different
+    from \p v), deduce constraints of the form <CODE>v - u \<= c</CODE>,
+    starting from \p ub_v which is an upper bound for \p v.
+
+    The shortest-path closure is able to deduce the constraint
+    <CODE>v - u \<= ub_v - lb_u</CODE>. We can be more precise if variable
+    \p u played an active role in the computation of the upper bound for
+    \p v, i.e., if the corresponding coefficient
+    <CODE>q == sc_expr[u]/sc_denom</CODE> is greater than zero. In particular:
+      - if <CODE>q \>= 1</CODE>, then <CODE>v - u \<= ub_v - ub_u</CODE>;
+      - if <CODE>0 \< q \< 1</CODE>, then
+        <CODE>v - u \<= ub_v - (q*ub_u + (1-q)*lb_u)</CODE>.
+  */
+  void deduce_v_minus_u_bounds(dimension_type v,
+                               dimension_type last_v,
+                               const Linear_Expression& sc_expr,
+                               Coefficient_traits::const_reference sc_denom,
+                               const N& ub_v);
+
+  /*! \brief
+    Auxiliary function for \ref affine_form_relation "affine form image" that
+    handle the general case: \f$l = c\f$
+  */
+  template <typename Interval_Info>
+  void inhomogeneous_affine_form_image(const dimension_type& var_id,
+                                       const Interval<T, Interval_Info>& b);
+
+  /*! \brief
+    Auxiliary function for \ref affine_form_relation "affine form
+    image" that handle the general case: \f$l = ax + c\f$
+  */
+  template <typename Interval_Info>
+  void one_variable_affine_form_image
+  (const dimension_type& var_id,
+   const Interval<T, Interval_Info>& b,
+   const Interval<T, Interval_Info>& w_coeff,
+   const dimension_type& w_id,
+   const dimension_type& space_dim);
+
+  /*! \brief
+    Auxiliary function for \ref affine_form_relation "affine form image" that
+    handle the general case: \f$l = ax + by + c\f$
+  */
+  template <typename Interval_Info>
+  void two_variables_affine_form_image
+  (const dimension_type& var_id,
+   const Linear_Form<Interval<T,Interval_Info> >& lf,
+   const dimension_type& space_dim);
+
+  /*! \brief
+    Auxiliary function for refine with linear form that handle
+    the general case: \f$l = ax + c\f$
+  */
+  template <typename Interval_Info>
+  void left_inhomogeneous_refine
+  (const dimension_type& right_t,
+   const dimension_type& right_w_id,
+   const Linear_Form<Interval<T, Interval_Info> >& left,
+   const Linear_Form<Interval<T, Interval_Info> >& right);
+
+  /*! \brief
+    Auxiliary function for refine with linear form that handle
+    the general case: \f$ax + b = cy + d\f$
+  */
+  template <typename Interval_Info>
+  void left_one_var_refine
+  (const dimension_type& left_w_id,
+   const dimension_type& right_t,
+   const dimension_type& right_w_id,
+   const Linear_Form<Interval<T, Interval_Info> >& left,
+   const Linear_Form<Interval<T, Interval_Info> >& right);
+
+  /*! \brief
+    Auxiliary function for refine with linear form that handle
+    the general case.
+  */
+  template <typename Interval_Info>
+  void general_refine(const dimension_type& left_w_id,
+                      const dimension_type& right_w_id,
+                      const Linear_Form<Interval<T, Interval_Info> >& left,
+                      const Linear_Form<Interval<T, Interval_Info> >& right);
+
+  template <typename Interval_Info>
+  void linear_form_upper_bound(const Linear_Form<Interval<T, Interval_Info> >&
+                               lf,
+                               N& result) const;
+
+  //! An helper function for the computation of affine relations.
+  /*!
+    For each dbm index \p u (less than or equal to \p last_v and different
+    from \p v), deduce constraints of the form <CODE>u - v \<= c</CODE>,
+    starting from \p minus_lb_v which is a lower bound for \p v.
+
+    The shortest-path closure is able to deduce the constraint
+    <CODE>u - v \<= ub_u - lb_v</CODE>. We can be more precise if variable
+    \p u played an active role in the computation of the lower bound for
+    \p v, i.e., if the corresponding coefficient
+    <CODE>q == sc_expr[u]/sc_denom</CODE> is greater than zero.
+    In particular:
+      - if <CODE>q \>= 1</CODE>, then <CODE>u - v \<= lb_u - lb_v</CODE>;
+      - if <CODE>0 \< q \< 1</CODE>, then
+        <CODE>u - v \<= (q*lb_u + (1-q)*ub_u) - lb_v</CODE>.
+  */
+  void deduce_u_minus_v_bounds(dimension_type v,
+                               dimension_type last_v,
+                               const Linear_Expression& sc_expr,
+                               Coefficient_traits::const_reference sc_denom,
+                               const N& minus_lb_v);
+
+  /*! \brief
+    Adds to \p limiting_shape the bounded differences in \p cs
+    that are satisfied by \p *this.
+  */
+  void get_limiting_shape(const Constraint_System& cs,
+                          BD_Shape& limiting_shape) const;
+
+  //! Compute the (zero-equivalence classes) predecessor relation.
+  /*!
+    It is assumed that the BDS is not empty and shortest-path closed.
+  */
+  void compute_predecessors(std::vector<dimension_type>& predecessor) const;
+
+  //! Compute the leaders of zero-equivalence classes.
+  /*!
+    It is assumed that the BDS is not empty and shortest-path closed.
+  */
+  void compute_leaders(std::vector<dimension_type>& leaders) const;
+
+  void drop_some_non_integer_points_helper(N& elem);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators
+  ::operator<<<>(std::ostream& s, const BD_Shape<T>& c);
+
+  //! \name Exception Throwers
+  //@{
+  void throw_dimension_incompatible(const char* method,
+                                    const BD_Shape& y) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    dimension_type required_dim) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Constraint& c) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Congruence& cg) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Generator& g) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
+
+  template<typename Interval_Info>
+  void
+  throw_dimension_incompatible(const char* method,
+                               const char* lf_name,
+                               const Linear_Form<Interval<T, Interval_Info> >&
+                               lf) const;
+
+  static void throw_expression_too_complex(const char* method,
+                                           const Linear_Expression& le);
+
+  static void throw_invalid_argument(const char* method, const char* reason);
+  //@} // Exception Throwers
+};
+
+#include "BDS_Status_inlines.hh"
+#include "BD_Shape_inlines.hh"
+#include "BD_Shape_templates.hh"
+
+#endif // !defined(PPL_BD_Shape_defs_hh)
diff --git a/src/BD_Shape_inlines.hh b/src/BD_Shape_inlines.hh
new file mode 100644
index 0000000..d3b7022
--- /dev/null
+++ b/src/BD_Shape_inlines.hh
@@ -0,0 +1,910 @@
+/* BD_Shape class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BD_Shape_inlines_hh
+#define PPL_BD_Shape_inlines_hh 1
+
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "C_Polyhedron_defs.hh"
+#include "Grid_defs.hh"
+#include "Octagonal_Shape_defs.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "Temp_defs.hh"
+#include "meta_programming.hh"
+#include "wrap_assign.hh"
+#include "assert.hh"
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline dimension_type
+BD_Shape<T>::max_space_dimension() {
+  // One dimension is reserved to have a value of type dimension_type
+  // that does not represent a legal dimension.
+  return std::min(DB_Matrix<N>::max_num_rows() - 1,
+                  DB_Matrix<N>::max_num_columns() - 1);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::marked_zero_dim_univ() const {
+  return status.test_zero_dim_univ();
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::marked_empty() const {
+  return status.test_empty();
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::marked_shortest_path_closed() const {
+  return status.test_shortest_path_closed();
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::marked_shortest_path_reduced() const {
+  return status.test_shortest_path_reduced();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::set_zero_dim_univ() {
+  status.set_zero_dim_univ();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::set_empty() {
+  status.set_empty();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::set_shortest_path_closed() {
+  status.set_shortest_path_closed();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::set_shortest_path_reduced() {
+  status.set_shortest_path_reduced();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::reset_shortest_path_closed() {
+  status.reset_shortest_path_closed();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::reset_shortest_path_reduced() {
+  status.reset_shortest_path_reduced();
+}
+
+template <typename T>
+inline
+BD_Shape<T>::BD_Shape(const dimension_type num_dimensions,
+                      const Degenerate_Element kind)
+  : dbm(num_dimensions + 1), status(), redundancy_dbm() {
+  if (kind == EMPTY)
+    set_empty();
+  else {
+    if (num_dimensions > 0)
+      // A (non zero-dim) universe BDS is closed.
+      set_shortest_path_closed();
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline
+BD_Shape<T>::BD_Shape(const BD_Shape& y, Complexity_Class)
+  : dbm(y.dbm), status(y.status), redundancy_dbm() {
+  if (y.marked_shortest_path_reduced())
+    redundancy_dbm = y.redundancy_dbm;
+}
+
+template <typename T>
+template <typename U>
+inline
+BD_Shape<T>::BD_Shape(const BD_Shape<U>& y, Complexity_Class)
+  // For maximum precision, enforce shortest-path closure
+  // before copying the DB matrix.
+  : dbm((y.shortest_path_closure_assign(), y.dbm)),
+    status(),
+    redundancy_dbm() {
+  // TODO: handle flags properly, possibly taking special cases into account.
+  if (y.marked_empty())
+    set_empty();
+  else if (y.marked_zero_dim_univ())
+    set_zero_dim_univ();
+}
+
+template <typename T>
+inline Congruence_System
+BD_Shape<T>::congruences() const {
+  return minimized_congruences();
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::add_constraints(const Constraint_System& cs) {
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); i != cs_end; ++i)
+    add_constraint(*i);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::add_recycled_constraints(Constraint_System& cs) {
+  add_constraints(cs);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::add_congruences(const Congruence_System& cgs) {
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); i != cgs_end; ++i)
+    add_congruence(*i);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::add_recycled_congruences(Congruence_System& cgs) {
+  add_congruences(cgs);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::refine_with_constraint(const Constraint& c) {
+  const dimension_type c_space_dim = c.space_dimension();
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dimension())
+    throw_dimension_incompatible("refine_with_constraint(c)", c);
+
+  if (!marked_empty())
+    refine_no_check(c);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::refine_with_constraints(const Constraint_System& cs) {
+  // Dimension-compatibility check.
+  if (cs.space_dimension() > space_dimension())
+    throw_invalid_argument("refine_with_constraints(cs)",
+                           "cs and *this are space-dimension incompatible");
+
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+    refine_no_check(*i);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::refine_with_congruence(const Congruence& cg) {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  // Dimension-compatibility check.
+  if (cg_space_dim > space_dimension())
+    throw_dimension_incompatible("refine_with_congruence(cg)", cg);
+
+  if (!marked_empty())
+    refine_no_check(cg);
+}
+
+template <typename T>
+void
+BD_Shape<T>::refine_with_congruences(const Congruence_System& cgs) {
+  // Dimension-compatibility check.
+  if (cgs.space_dimension() > space_dimension())
+    throw_invalid_argument("refine_with_congruences(cgs)",
+                           "cgs and *this are space-dimension incompatible");
+
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
+    refine_no_check(*i);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::refine_no_check(const Congruence& cg) {
+  PPL_ASSERT(!marked_empty());
+  PPL_ASSERT(cg.space_dimension() <= space_dimension());
+
+  if (cg.is_proper_congruence()) {
+    if (cg.is_inconsistent())
+      set_empty();
+    // Other proper congruences are just ignored.
+    return;
+  }
+
+  PPL_ASSERT(cg.is_equality());
+  Constraint c(cg);
+  refine_no_check(c);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::can_recycle_constraint_systems() {
+  return false;
+}
+
+
+template <typename T>
+inline bool
+BD_Shape<T>::can_recycle_congruence_systems() {
+  return false;
+}
+
+template <typename T>
+inline
+BD_Shape<T>::BD_Shape(const Constraint_System& cs)
+  : dbm(cs.space_dimension() + 1), status(), redundancy_dbm() {
+  if (cs.space_dimension() > 0)
+    // A (non zero-dim) universe BDS is shortest-path closed.
+    set_shortest_path_closed();
+  add_constraints(cs);
+}
+
+template <typename T>
+template <typename Interval>
+inline
+BD_Shape<T>::BD_Shape(const Box<Interval>& box,
+                      Complexity_Class)
+  : dbm(box.space_dimension() + 1), status(), redundancy_dbm() {
+  // Check emptiness for maximum precision.
+  if (box.is_empty())
+    set_empty();
+  else if (box.space_dimension() > 0) {
+    // A (non zero-dim) universe BDS is shortest-path closed.
+    set_shortest_path_closed();
+    refine_with_constraints(box.constraints());
+  }
+}
+
+template <typename T>
+inline
+BD_Shape<T>::BD_Shape(const Grid& grid,
+                      Complexity_Class)
+  : dbm(grid.space_dimension() + 1), status(), redundancy_dbm() {
+  if (grid.space_dimension() > 0)
+    // A (non zero-dim) universe BDS is shortest-path closed.
+    set_shortest_path_closed();
+  // Taking minimized congruences ensures maximum precision.
+  refine_with_congruences(grid.minimized_congruences());
+}
+
+template <typename T>
+template <typename U>
+inline
+BD_Shape<T>::BD_Shape(const Octagonal_Shape<U>& os,
+                      Complexity_Class)
+  : dbm(os.space_dimension() + 1), status(), redundancy_dbm() {
+  // Check for emptiness for maximum precision.
+  if (os.is_empty())
+    set_empty();
+  else if (os.space_dimension() > 0) {
+    // A (non zero-dim) universe BDS is shortest-path closed.
+    set_shortest_path_closed();
+    refine_with_constraints(os.constraints());
+    // After refining, shortest-path closure is possibly lost
+    // (even when `os' was strongly closed: recall that U
+    // is possibly different from T).
+  }
+}
+
+template <typename T>
+inline BD_Shape<T>&
+BD_Shape<T>::operator=(const BD_Shape& y) {
+  dbm = y.dbm;
+  status = y.status;
+  if (y.marked_shortest_path_reduced())
+    redundancy_dbm = y.redundancy_dbm;
+  return *this;
+}
+
+template <typename T>
+inline
+BD_Shape<T>::~BD_Shape() {
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::m_swap(BD_Shape& y) {
+  using std::swap;
+  swap(dbm, y.dbm);
+  swap(status, y.status);
+  swap(redundancy_dbm, y.redundancy_dbm);
+}
+
+template <typename T>
+inline dimension_type
+BD_Shape<T>::space_dimension() const {
+  return dbm.num_rows() - 1;
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::is_empty() const {
+  shortest_path_closure_assign();
+  return marked_empty();
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::bounds_from_above(const Linear_Expression& expr) const {
+  return bounds(expr, true);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::bounds_from_below(const Linear_Expression& expr) const {
+  return bounds(expr, false);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::maximize(const Linear_Expression& expr,
+                      Coefficient& sup_n, Coefficient& sup_d,
+                      bool& maximum) const {
+  return max_min(expr, true, sup_n, sup_d, maximum);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::maximize(const Linear_Expression& expr,
+                      Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                      Generator& g) const {
+  return max_min(expr, true, sup_n, sup_d, maximum, g);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::minimize(const Linear_Expression& expr,
+                      Coefficient& inf_n, Coefficient& inf_d,
+                      bool& minimum) const {
+  return max_min(expr, false, inf_n, inf_d, minimum);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::minimize(const Linear_Expression& expr,
+                      Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                      Generator& g) const {
+  return max_min(expr, false, inf_n, inf_d, minimum, g);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::is_topologically_closed() const {
+  return true;
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::is_discrete() const {
+  return affine_dimension() == 0;
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::topological_closure_assign() {
+}
+
+/*! \relates BD_Shape */
+template <typename T>
+inline bool
+operator==(const BD_Shape<T>& x, const BD_Shape<T>& y) {
+  const dimension_type x_space_dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  // Zero-dim BDSs are equal if and only if they are both empty or universe.
+  if (x_space_dim == 0) {
+    if (x.marked_empty())
+      return y.marked_empty();
+    else
+      return !y.marked_empty();
+  }
+
+  // The exact equivalence test requires shortest-path closure.
+  x.shortest_path_closure_assign();
+  y.shortest_path_closure_assign();
+
+  // If one of two BDSs is empty, then they are equal
+  // if and only if the other BDS is empty too.
+  if (x.marked_empty())
+    return y.marked_empty();
+  if (y.marked_empty())
+    return false;
+  // Check for syntactic equivalence of the two (shortest-path closed)
+  // systems of bounded differences.
+  return x.dbm == y.dbm;
+}
+
+/*! \relates BD_Shape */
+template <typename T>
+inline bool
+operator!=(const BD_Shape<T>& x, const BD_Shape<T>& y) {
+  return !(x == y);
+}
+
+/*! \relates BD_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const BD_Shape<T>& x,
+                            const BD_Shape<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
+  const dimension_type x_space_dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  // Zero-dim BDSs are equal if and only if they are both empty or universe.
+  if (x_space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires shortest-path closure.
+  x.shortest_path_closure_assign();
+  y.shortest_path_closure_assign();
+
+  // If one of two BDSs is empty, then they are equal if and only if
+  // the other BDS is empty too.
+  if (x.marked_empty() ||  y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  return rectilinear_distance_assign(r, x.dbm, y.dbm, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates BD_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const BD_Shape<T>& x,
+                            const BD_Shape<T>& y,
+                            const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates BD_Shape */
+template <typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const BD_Shape<T>& x,
+                            const BD_Shape<T>& y,
+                            const Rounding_Dir dir) {
+  return rectilinear_distance_assign<To, To, T>(r, x, y, dir);
+}
+
+/*! \relates BD_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const BD_Shape<T>& x,
+                          const BD_Shape<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
+  const dimension_type x_space_dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  // Zero-dim BDSs are equal if and only if they are both empty or universe.
+  if (x_space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires shortest-path closure.
+  x.shortest_path_closure_assign();
+  y.shortest_path_closure_assign();
+
+  // If one of two BDSs is empty, then they are equal if and only if
+  // the other BDS is empty too.
+  if (x.marked_empty() ||  y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  return euclidean_distance_assign(r, x.dbm, y.dbm, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates BD_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const BD_Shape<T>& x,
+                          const BD_Shape<T>& y,
+                          const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates BD_Shape */
+template <typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const BD_Shape<T>& x,
+                          const BD_Shape<T>& y,
+                          const Rounding_Dir dir) {
+  return euclidean_distance_assign<To, To, T>(r, x, y, dir);
+}
+
+/*! \relates BD_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const BD_Shape<T>& x,
+                           const BD_Shape<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
+  const dimension_type x_space_dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  // Zero-dim BDSs are equal if and only if they are both empty or universe.
+  if (x_space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires shortest-path closure.
+  x.shortest_path_closure_assign();
+  y.shortest_path_closure_assign();
+
+  // If one of two BDSs is empty, then they are equal if and only if
+  // the other BDS is empty too.
+  if (x.marked_empty() ||  y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  return l_infinity_distance_assign(r, x.dbm, y.dbm, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates BD_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const BD_Shape<T>& x,
+                           const BD_Shape<T>& y,
+                           const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates BD_Shape */
+template <typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const BD_Shape<T>& x,
+                           const BD_Shape<T>& y,
+                           const Rounding_Dir dir) {
+  return l_infinity_distance_assign<To, To, T>(r, x, y, dir);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::add_dbm_constraint(const dimension_type i,
+                                const dimension_type j,
+                                const N& k) {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(i <= space_dimension() && j <= space_dimension() && i != j);
+  N& dbm_ij = dbm[i][j];
+  if (dbm_ij > k) {
+    dbm_ij = k;
+    if (marked_shortest_path_closed())
+      reset_shortest_path_closed();
+  }
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::add_dbm_constraint(const dimension_type i,
+                                const dimension_type j,
+                                Coefficient_traits::const_reference numer,
+                                Coefficient_traits::const_reference denom) {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(i <= space_dimension() && j <= space_dimension() && i != j);
+  PPL_ASSERT(denom != 0);
+  PPL_DIRTY_TEMP(N, k);
+  div_round_up(k, numer, denom);
+  add_dbm_constraint(i, j, k);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::time_elapse_assign(const BD_Shape& y) {
+  // Dimension-compatibility check.
+  if (space_dimension() != y.space_dimension())
+    throw_dimension_incompatible("time_elapse_assign(y)", y);
+  // Compute time-elapse on polyhedra.
+  // TODO: provide a direct implementation.
+  C_Polyhedron ph_x(constraints());
+  C_Polyhedron ph_y(y.constraints());
+  ph_x.time_elapse_assign(ph_y);
+  BD_Shape<T> x(ph_x);
+  m_swap(x);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::strictly_contains(const BD_Shape& y) const {
+  const BD_Shape<T>& x = *this;
+  return x.contains(y) && !y.contains(x);
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::upper_bound_assign_if_exact(const BD_Shape& y) {
+  if (space_dimension() != y.space_dimension())
+    throw_dimension_incompatible("upper_bound_assign_if_exact(y)", y);
+#if 0
+  return BFT00_upper_bound_assign_if_exact(y);
+#else
+  const bool integer_upper_bound = false;
+  return BHZ09_upper_bound_assign_if_exact<integer_upper_bound>(y);
+#endif
+}
+
+template <typename T>
+inline bool
+BD_Shape<T>::integer_upper_bound_assign_if_exact(const BD_Shape& y) {
+  PPL_COMPILE_TIME_CHECK(std::numeric_limits<T>::is_integer,
+                         "BD_Shape<T>::integer_upper_bound_assign_if_exact(y):"
+                         " T in not an integer datatype.");
+  if (space_dimension() != y.space_dimension())
+    throw_dimension_incompatible("integer_upper_bound_assign_if_exact(y)", y);
+  const bool integer_upper_bound = true;
+  return BHZ09_upper_bound_assign_if_exact<integer_upper_bound>(y);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>
+::remove_higher_space_dimensions(const dimension_type new_dimension) {
+  // Dimension-compatibility check: the variable having
+  // maximum index is the one occurring last in the set.
+  const dimension_type space_dim = space_dimension();
+  if (new_dimension > space_dim)
+    throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
+                                 new_dimension);
+
+  // The removal of no dimensions from any BDS is a no-op.
+  // Note that this case also captures the only legal removal of
+  // dimensions from a zero-dim space BDS.
+  if (new_dimension == space_dim) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Shortest-path closure is necessary as in remove_space_dimensions().
+  shortest_path_closure_assign();
+  dbm.resize_no_copy(new_dimension + 1);
+
+  // Shortest-path closure is maintained.
+  // TODO: see whether or not reduction can be (efficiently!) maintained too.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+
+  // If we removed _all_ dimensions from a non-empty BDS,
+  // the zero-dim universe BDS has been obtained.
+  if (new_dimension == 0 && !marked_empty())
+    set_zero_dim_univ();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::wrap_assign(const Variables_Set& vars,
+                         Bounded_Integer_Type_Width w,
+                         Bounded_Integer_Type_Representation r,
+                         Bounded_Integer_Type_Overflow o,
+                         const Constraint_System* cs_p,
+                         unsigned complexity_threshold,
+                         bool wrap_individually) {
+  Implementation::wrap_assign(*this,
+                              vars, w, r, o, cs_p,
+                              complexity_threshold, wrap_individually,
+                              "BD_Shape");
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::CC76_extrapolation_assign(const BD_Shape& y, unsigned* tp) {
+  static N stop_points[] = {
+    N(-2, ROUND_UP),
+    N(-1, ROUND_UP),
+    N( 0, ROUND_UP),
+    N( 1, ROUND_UP),
+    N( 2, ROUND_UP)
+  };
+  CC76_extrapolation_assign(y,
+                            stop_points,
+                            stop_points
+                            + sizeof(stop_points)/sizeof(stop_points[0]),
+                            tp);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::H79_widening_assign(const BD_Shape& y, unsigned* tp) {
+  // Compute the H79 widening on polyhedra.
+  // TODO: provide a direct implementation.
+  C_Polyhedron ph_x(constraints());
+  C_Polyhedron ph_y(y.constraints());
+  ph_x.H79_widening_assign(ph_y, tp);
+  BD_Shape x(ph_x);
+  m_swap(x);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::widening_assign(const BD_Shape& y, unsigned* tp) {
+  H79_widening_assign(y, tp);
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::limited_H79_extrapolation_assign(const BD_Shape& y,
+                                              const Constraint_System& cs,
+                                              unsigned* tp) {
+  // Compute the limited H79 extrapolation on polyhedra.
+  // TODO: provide a direct implementation.
+  C_Polyhedron ph_x(constraints());
+  C_Polyhedron ph_y(y.constraints());
+  ph_x.limited_H79_extrapolation_assign(ph_y, cs, tp);
+  BD_Shape x(ph_x);
+  m_swap(x);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline memory_size_type
+BD_Shape<T>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename T>
+inline int32_t
+BD_Shape<T>::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+template <typename T>
+template <typename Interval_Info>
+inline void
+BD_Shape<T>::generalized_refine_with_linear_form_inequality(
+             const Linear_Form<Interval<T, Interval_Info> >& left,
+             const Linear_Form<Interval<T, Interval_Info> >& right,
+             const Relation_Symbol relsym) {
+  switch (relsym) {
+  case EQUAL:
+    // TODO: see if we can handle this case more efficiently.
+    refine_with_linear_form_inequality(left, right);
+    refine_with_linear_form_inequality(right, left);
+    break;
+  case LESS_THAN:
+  case LESS_OR_EQUAL:
+    refine_with_linear_form_inequality(left, right);
+    break;
+  case GREATER_THAN:
+  case GREATER_OR_EQUAL:
+    refine_with_linear_form_inequality(right, left);
+    break;
+  case NOT_EQUAL:
+    break;
+  default:
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename T>
+template <typename Interval_Info>
+inline void
+BD_Shape<T>
+::refine_fp_interval_abstract_store(Box<Interval<T, Interval_Info> >&
+                                    store) const {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                     "BD_Shape<T>::refine_fp_interval_abstract_store:"
+                     " T not a floating point type.");
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+  store.intersection_assign(Box<FP_Interval_Type>(*this));
+}
+
+template <typename T>
+inline void
+BD_Shape<T>::drop_some_non_integer_points_helper(N& elem) {
+  if (!is_integer(elem)) {
+    Result r = floor_assign_r(elem, elem, ROUND_DOWN);
+    PPL_USED(r);
+    PPL_ASSERT(r == V_EQ);
+    reset_shortest_path_closed();
+  }
+}
+
+/*! \relates BD_Shape */
+template <typename T>
+inline void
+swap(BD_Shape<T>& x, BD_Shape<T>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_BD_Shape_inlines_hh)
diff --git a/src/BD_Shape_templates.hh b/src/BD_Shape_templates.hh
new file mode 100644
index 0000000..3a175c2
--- /dev/null
+++ b/src/BD_Shape_templates.hh
@@ -0,0 +1,6789 @@
+/* BD_Shape class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BD_Shape_templates_hh
+#define PPL_BD_Shape_templates_hh 1
+
+#include "Generator_System_defs.hh"
+#include "Generator_System_inlines.hh"
+#include "Congruence_System_inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Interval_defs.hh"
+#include "Linear_Form_defs.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "MIP_Problem_defs.hh"
+#include "Variables_Set_defs.hh"
+#include "Bit_Row_defs.hh"
+#include "Temp_defs.hh"
+#include "assert.hh"
+#include <vector>
+#include <deque>
+#include <iostream>
+#include <sstream>
+#include <stdexcept>
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+BD_Shape<T>::BD_Shape(const Congruence_System& cgs)
+  : dbm(cgs.space_dimension() + 1),
+    status(),
+    redundancy_dbm() {
+  add_congruences(cgs);
+}
+
+template <typename T>
+BD_Shape<T>::BD_Shape(const Generator_System& gs)
+  : dbm(gs.space_dimension() + 1), status(), redundancy_dbm() {
+  const Generator_System::const_iterator gs_begin = gs.begin();
+  const Generator_System::const_iterator gs_end = gs.end();
+  if (gs_begin == gs_end) {
+    // An empty generator system defines the empty BD shape.
+    set_empty();
+    return;
+  }
+
+  const dimension_type space_dim = space_dimension();
+  DB_Row<N>& dbm_0 = dbm[0];
+  PPL_DIRTY_TEMP(N, tmp);
+
+  bool dbm_initialized = false;
+  bool point_seen = false;
+  // Going through all the points and closure points.
+  for (Generator_System::const_iterator gs_i = gs_begin;
+       gs_i != gs_end; ++gs_i) {
+    const Generator& g = *gs_i;
+    switch (g.type()) {
+    case Generator::POINT:
+      point_seen = true;
+      // Intentionally fall through.
+    case Generator::CLOSURE_POINT:
+      if (!dbm_initialized) {
+        // When handling the first (closure) point, we initialize the DBM.
+        dbm_initialized = true;
+        const Coefficient& d = g.divisor();
+        // TODO: Check if the following loop can be optimized used
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i > 0; --i) {
+          const Coefficient& g_i = g.expression().get(Variable(i - 1));
+          DB_Row<N>& dbm_i = dbm[i];
+          for (dimension_type j = space_dim; j > 0; --j)
+            if (i != j) {
+              const Coefficient& g_j = g.expression().get(Variable(j - 1));
+              div_round_up(dbm_i[j], g_j - g_i, d);
+            }
+          div_round_up(dbm_i[0], -g_i, d);
+        }
+        for (dimension_type j = space_dim; j > 0; --j) {
+          const Coefficient& g_j = g.expression().get(Variable(j - 1));
+          div_round_up(dbm_0[j], g_j, d);
+        }
+        // Note: no need to initialize the first element of the main diagonal.
+      }
+      else {
+        // This is not the first point: the DBM already contains
+        // valid values and we must compute maxima.
+        const Coefficient& d = g.divisor();
+        // TODO: Check if the following loop can be optimized used
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i > 0; --i) {
+          const Coefficient& g_i = g.expression().get(Variable(i - 1));
+          DB_Row<N>& dbm_i = dbm[i];
+          // The loop correctly handles the case when i == j.
+          for (dimension_type j = space_dim; j > 0; --j) {
+            const Coefficient& g_j = g.expression().get(Variable(j - 1));
+            div_round_up(tmp, g_j - g_i, d);
+            max_assign(dbm_i[j], tmp);
+          }
+          div_round_up(tmp, -g_i, d);
+          max_assign(dbm_i[0], tmp);
+        }
+        for (dimension_type j = space_dim; j > 0; --j) {
+          const Coefficient& g_j = g.expression().get(Variable(j - 1));
+          div_round_up(tmp, g_j, d);
+          max_assign(dbm_0[j], tmp);
+        }
+      }
+      break;
+    default:
+      // Lines and rays temporarily ignored.
+      break;
+    }
+  }
+
+  if (!point_seen)
+    // The generator system is not empty, but contains no points.
+    throw_invalid_argument("BD_Shape(gs)",
+                           "the non-empty generator system gs "
+                           "contains no points.");
+
+  // Going through all the lines and rays.
+  for (Generator_System::const_iterator gs_i = gs_begin;
+       gs_i != gs_end; ++gs_i) {
+    const Generator& g = *gs_i;
+    switch (g.type()) {
+    case Generator::LINE:
+      // TODO: Check if the following loop can be optimized used
+      // Generator::expr_type::const_iterator.
+      for (dimension_type i = space_dim; i > 0; --i) {
+        const Coefficient& g_i = g.expression().get(Variable(i - 1));
+        DB_Row<N>& dbm_i = dbm[i];
+        // The loop correctly handles the case when i == j.
+        for (dimension_type j = space_dim; j > 0; --j)
+          if (g_i != g.expression().get(Variable(j - 1)))
+            assign_r(dbm_i[j], PLUS_INFINITY, ROUND_NOT_NEEDED);
+        if (g_i != 0)
+          assign_r(dbm_i[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
+      }
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
+            i_end = g.expression().end(); i != i_end; ++i)
+        assign_r(dbm_0[i.variable().space_dimension()],
+                 PLUS_INFINITY, ROUND_NOT_NEEDED);
+      break;
+    case Generator::RAY:
+      // TODO: Check if the following loop can be optimized used
+      // Generator::expr_type::const_iterator.
+      for (dimension_type i = space_dim; i > 0; --i) {
+        const Coefficient& g_i = g.expression().get(Variable(i - 1));
+        DB_Row<N>& dbm_i = dbm[i];
+        // The loop correctly handles the case when i == j.
+        for (dimension_type j = space_dim; j > 0; --j)
+          if (g_i < g.expression().get(Variable(j - 1)))
+            assign_r(dbm_i[j], PLUS_INFINITY, ROUND_NOT_NEEDED);
+        if (g_i < 0)
+          assign_r(dbm_i[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
+      }
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
+            i_end = g.expression().end(); i != i_end; ++i)
+        if (*i > 0)
+          assign_r(dbm_0[i.variable().space_dimension()],
+                   PLUS_INFINITY, ROUND_NOT_NEEDED);
+      break;
+    default:
+      // Points and closure points already dealt with.
+      break;
+    }
+  }
+  set_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+BD_Shape<T>::BD_Shape(const Polyhedron& ph, const Complexity_Class complexity)
+  : dbm(), status(), redundancy_dbm() {
+  const dimension_type num_dimensions = ph.space_dimension();
+
+  if (ph.marked_empty()) {
+    *this = BD_Shape<T>(num_dimensions, EMPTY);
+    return;
+  }
+
+  if (num_dimensions == 0) {
+    *this = BD_Shape<T>(num_dimensions, UNIVERSE);
+    return;
+  }
+
+  // Build from generators when we do not care about complexity
+  // or when the process has polynomial complexity.
+  if (complexity == ANY_COMPLEXITY
+      || (!ph.has_pending_constraints() && ph.generators_are_up_to_date())) {
+    *this = BD_Shape<T>(ph.generators());
+    return;
+  }
+
+  // We cannot afford exponential complexity, we do not have a complete set
+  // of generators for the polyhedron, and the polyhedron is not trivially
+  // empty or zero-dimensional.  Constraints, however, are up to date.
+  PPL_ASSERT(ph.constraints_are_up_to_date());
+
+  if (!ph.has_something_pending() && ph.constraints_are_minimized()) {
+    // If the constraint system of the polyhedron is minimized,
+    // the test `is_universe()' has polynomial complexity.
+    if (ph.is_universe()) {
+      *this = BD_Shape<T>(num_dimensions, UNIVERSE);
+      return;
+    }
+  }
+
+  // See if there is at least one inconsistent constraint in `ph.con_sys'.
+  for (Constraint_System::const_iterator i = ph.con_sys.begin(),
+         cs_end = ph.con_sys.end(); i != cs_end; ++i)
+    if (i->is_inconsistent()) {
+      *this = BD_Shape<T>(num_dimensions, EMPTY);
+      return;
+    }
+
+  // If `complexity' allows it, use simplex to derive the exact (modulo
+  // the fact that our BDSs are topologically closed) variable bounds.
+  if (complexity == SIMPLEX_COMPLEXITY) {
+    MIP_Problem lp(num_dimensions);
+    lp.set_optimization_mode(MAXIMIZATION);
+
+    const Constraint_System& ph_cs = ph.constraints();
+    if (!ph_cs.has_strict_inequalities())
+      lp.add_constraints(ph_cs);
+    else
+      // Adding to `lp' a topologically closed version of `ph_cs'.
+      for (Constraint_System::const_iterator i = ph_cs.begin(),
+             ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
+        const Constraint& c = *i;
+        if (c.is_strict_inequality()) {
+          Linear_Expression expr(c.expression());
+          lp.add_constraint(expr >= 0);
+        }
+        else
+          lp.add_constraint(c);
+      }
+
+    // Check for unsatisfiability.
+    if (!lp.is_satisfiable()) {
+      *this = BD_Shape<T>(num_dimensions, EMPTY);
+      return;
+    }
+
+    // Start with a universe BDS that will be refined by the simplex.
+    *this = BD_Shape<T>(num_dimensions, UNIVERSE);
+    // Get all the upper bounds.
+    Generator g(point());
+    PPL_DIRTY_TEMP_COEFFICIENT(numer);
+    PPL_DIRTY_TEMP_COEFFICIENT(denom);
+    for (dimension_type i = 1; i <= num_dimensions; ++i) {
+      Variable x(i-1);
+      // Evaluate optimal upper bound for `x <= ub'.
+      lp.set_objective_function(x);
+      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, numer, denom);
+        div_round_up(dbm[0][i], numer, denom);
+      }
+      // Evaluate optimal upper bound for `x - y <= ub'.
+      for (dimension_type j = 1; j <= num_dimensions; ++j) {
+        if (i == j)
+          continue;
+        Variable y(j-1);
+        lp.set_objective_function(x - y);
+        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+          g = lp.optimizing_point();
+          lp.evaluate_objective_function(g, numer, denom);
+          div_round_up(dbm[j][i], numer, denom);
+        }
+      }
+      // Evaluate optimal upper bound for `-x <= ub'.
+      lp.set_objective_function(-x);
+      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, numer, denom);
+        div_round_up(dbm[i][0], numer, denom);
+      }
+    }
+    set_shortest_path_closed();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Extract easy-to-find bounds from constraints.
+  PPL_ASSERT(complexity == POLYNOMIAL_COMPLEXITY);
+  *this = BD_Shape<T>(num_dimensions, UNIVERSE);
+  refine_with_constraints(ph.constraints());
+}
+
+template <typename T>
+dimension_type
+BD_Shape<T>::affine_dimension() const {
+  const dimension_type space_dim = space_dimension();
+  // A zero-space-dim shape always has affine dimension zero.
+  if (space_dim == 0)
+    return 0;
+
+  // Shortest-path closure is necessary to detect emptiness
+  // and all (possibly implicit) equalities.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return 0;
+
+  // The vector `predecessor' is used to represent equivalence classes:
+  // `predecessor[i] == i' if and only if `i' is the leader of its
+  // equivalence class (i.e., the minimum index in the class).
+  std::vector<dimension_type> predecessor;
+  compute_predecessors(predecessor);
+
+  // Due to the fictitious variable `0', the affine dimension is one
+  // less the number of equivalence classes.
+  dimension_type affine_dim = 0;
+  // Note: disregard the first equivalence class.
+  for (dimension_type i = 1; i <= space_dim; ++i)
+    if (predecessor[i] == i)
+      ++affine_dim;
+
+  return affine_dim;
+}
+
+template <typename T>
+Congruence_System
+BD_Shape<T>::minimized_congruences() const {
+  // Shortest-path closure is necessary to detect emptiness
+  // and all (possibly implicit) equalities.
+  shortest_path_closure_assign();
+
+  const dimension_type space_dim = space_dimension();
+  Congruence_System cgs(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cgs = Congruence_System::zero_dim_empty();
+    return cgs;
+  }
+
+  if (marked_empty()) {
+    cgs.insert(Congruence::zero_dim_false());
+    return cgs;
+  }
+
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+
+  // Compute leader information.
+  std::vector<dimension_type> leaders;
+  compute_leaders(leaders);
+
+  // Go through the non-leaders to generate equality constraints.
+  const DB_Row<N>& dbm_0 = dbm[0];
+  for (dimension_type i = 1; i <= space_dim; ++i) {
+    const dimension_type leader = leaders[i];
+    if (i != leader) {
+      // Generate the constraint relating `i' and its leader.
+      if (leader == 0) {
+        // A unary equality has to be generated.
+        PPL_ASSERT(!is_plus_infinity(dbm_0[i]));
+        numer_denom(dbm_0[i], numer, denom);
+        cgs.insert(denom*Variable(i-1) == numer);
+      }
+      else {
+        // A binary equality has to be generated.
+        PPL_ASSERT(!is_plus_infinity(dbm[i][leader]));
+        numer_denom(dbm[i][leader], numer, denom);
+        cgs.insert(denom*Variable(leader-1) - denom*Variable(i-1) == numer);
+      }
+    }
+  }
+  return cgs;
+}
+
+template <typename T>
+void
+BD_Shape<T>::add_constraint(const Constraint& c) {
+  // Dimension-compatibility check.
+  if (c.space_dimension() > space_dimension())
+    throw_dimension_incompatible("add_constraint(c)", c);
+
+  // Get rid of strict inequalities.
+  if (c.is_strict_inequality()) {
+    if (c.is_inconsistent()) {
+      set_empty();
+      return;
+    }
+    if (c.is_tautological())
+      return;
+    // Nontrivial strict inequalities are not allowed.
+    throw_invalid_argument("add_constraint(c)",
+                           "strict inequalities are not allowed");
+  }
+
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  // Constraints that are not bounded differences are not allowed.
+  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff))
+    throw_invalid_argument("add_constraint(c)",
+                           "c is not a bounded difference constraint");
+
+  const Coefficient& inhomo = c.inhomogeneous_term();
+  if (num_vars == 0) {
+    // Dealing with a trivial constraint (not a strict inequality).
+    if (inhomo < 0
+        || (inhomo != 0 && c.is_equality()))
+      set_empty();
+    return;
+  }
+
+  // Select the cell to be modified for the "<=" part of the constraint,
+  // and set `coeff' to the absolute value of itself.
+  const bool negative = (coeff < 0);
+  if (negative)
+    neg_assign(coeff);
+
+  bool changed = false;
+  N& x = negative ? dbm[i][j] : dbm[j][i];
+  // Compute the bound for `x', rounding towards plus infinity.
+  PPL_DIRTY_TEMP(N, d);
+  div_round_up(d, inhomo, coeff);
+  if (x > d) {
+    x = d;
+    changed = true;
+  }
+
+  if (c.is_equality()) {
+    N& y = negative ? dbm[j][i] : dbm[i][j];
+    // Also compute the bound for `y', rounding towards plus infinity.
+    PPL_DIRTY_TEMP_COEFFICIENT(minus_c_term);
+    neg_assign(minus_c_term, inhomo);
+    div_round_up(d, minus_c_term, coeff);
+    if (y > d) {
+      y = d;
+      changed = true;
+    }
+  }
+
+  // In general, adding a constraint does not preserve the shortest-path
+  // closure or reduction of the bounded difference shape.
+  if (changed && marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::add_congruence(const Congruence& cg) {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  // Dimension-compatibility check:
+  // the dimension of `cg' can not be greater than space_dim.
+  if (space_dimension() < cg_space_dim)
+    throw_dimension_incompatible("add_congruence(cg)", cg);
+
+  // Handle the case of proper congruences first.
+  if (cg.is_proper_congruence()) {
+    if (cg.is_tautological())
+      return;
+    if (cg.is_inconsistent()) {
+      set_empty();
+      return;
+    }
+    // Non-trivial and proper congruences are not allowed.
+    throw_invalid_argument("add_congruence(cg)",
+                           "cg is a non-trivial, proper congruence");
+  }
+
+  PPL_ASSERT(cg.is_equality());
+  Constraint c(cg);
+  add_constraint(c);
+}
+
+template <typename T>
+void
+BD_Shape<T>::refine_no_check(const Constraint& c) {
+  PPL_ASSERT(!marked_empty());
+  PPL_ASSERT(c.space_dimension() <= space_dimension());
+
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  // Constraints that are not bounded differences are ignored.
+  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff))
+    return;
+
+  const Coefficient& inhomo = c.inhomogeneous_term();
+  if (num_vars == 0) {
+    // Dealing with a trivial constraint (might be a strict inequality).
+    if (inhomo < 0
+        || (c.is_equality() && inhomo != 0)
+        || (c.is_strict_inequality() && inhomo == 0))
+      set_empty();
+    return;
+  }
+
+  // Select the cell to be modified for the "<=" part of the constraint,
+  // and set `coeff' to the absolute value of itself.
+  const bool negative = (coeff < 0);
+  N& x = negative ? dbm[i][j] : dbm[j][i];
+  N& y = negative ? dbm[j][i] : dbm[i][j];
+  if (negative)
+    neg_assign(coeff);
+
+  bool changed = false;
+  // Compute the bound for `x', rounding towards plus infinity.
+  PPL_DIRTY_TEMP(N, d);
+  div_round_up(d, inhomo, coeff);
+  if (x > d) {
+    x = d;
+    changed = true;
+  }
+
+  if (c.is_equality()) {
+    // Also compute the bound for `y', rounding towards plus infinity.
+    PPL_DIRTY_TEMP_COEFFICIENT(minus_c_term);
+    neg_assign(minus_c_term, inhomo);
+    div_round_up(d, minus_c_term, coeff);
+    if (y > d) {
+      y = d;
+      changed = true;
+    }
+  }
+
+  // In general, adding a constraint does not preserve the shortest-path
+  // closure or reduction of the bounded difference shape.
+  if (changed && marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::concatenate_assign(const BD_Shape& y) {
+  BD_Shape& x = *this;
+
+  const dimension_type x_space_dim = x.space_dimension();
+  const dimension_type y_space_dim = y.space_dimension();
+
+  // If `y' is an empty 0-dim space bounded difference shape,
+  // let `*this' become empty.
+  if (y_space_dim == 0 && y.marked_empty()) {
+    set_empty();
+    return;
+  }
+
+  // If `x' is an empty 0-dim space BDS, then it is sufficient to adjust
+  // the dimension of the vector space.
+  if (x_space_dim == 0 && marked_empty()) {
+    dbm.grow(y_space_dim + 1);
+    PPL_ASSERT(OK());
+    return;
+  }
+  // First we increase the space dimension of `x' by adding
+  // `y.space_dimension()' new dimensions.
+  // The matrix for the new system of constraints is obtained
+  // by leaving the old system of constraints in the upper left-hand side
+  // and placing the constraints of `y' in the lower right-hand side,
+  // except the constraints as `y(i) >= cost' or `y(i) <= cost', that are
+  // placed in the right position on the new matrix.
+  add_space_dimensions_and_embed(y_space_dim);
+  const dimension_type new_space_dim = x_space_dim + y_space_dim;
+  for (dimension_type i = x_space_dim + 1; i <= new_space_dim; ++i) {
+    DB_Row<N>& dbm_i = dbm[i];
+    dbm_i[0] = y.dbm[i - x_space_dim][0];
+    dbm[0][i] = y.dbm[0][i - x_space_dim];
+    for (dimension_type j = x_space_dim + 1; j <= new_space_dim; ++j)
+      dbm_i[j] = y.dbm[i - x_space_dim][j - x_space_dim];
+  }
+
+  if (marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+bool
+BD_Shape<T>::contains(const BD_Shape& y) const {
+  const BD_Shape<T>& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    throw_dimension_incompatible("contains(y)", y);
+
+  if (x_space_dim == 0) {
+    // The zero-dimensional empty shape only contains another
+    // zero-dimensional empty shape.
+    // The zero-dimensional universe shape contains any other
+    // zero-dimensional shape.
+    return marked_empty() ? y.marked_empty() : true;
+  }
+
+  /*
+    The `y' bounded difference shape must be closed.  As an example,
+    consider the case where in `*this' we have the constraints
+
+    x1 - x2 <= 1,
+    x1      <= 3,
+    x2      <= 2,
+
+    and in `y' the constraints are
+
+    x1 - x2 <= 0,
+    x2      <= 1.
+
+    Without closure the (erroneous) analysis of the inhomogeneous terms
+    would conclude containment does not hold.  Closing `y' results into
+    the "discovery" of the implicit constraint
+
+    x1      <= 1,
+
+    at which point the inhomogeneous terms can be examined to determine
+    that containment does hold.
+  */
+  y.shortest_path_closure_assign();
+  // An empty shape is contained in any other dimension-compatible shapes.
+  if (y.marked_empty())
+    return true;
+
+  // If `x' is empty it can not contain `y' (which is not empty).
+  if (x.is_empty())
+    return false;
+
+  // `*this' contains `y' if and only if every cell of `dbm'
+  // is greater than or equal to the correspondent one of `y.dbm'.
+  for (dimension_type i = x_space_dim + 1; i-- > 0; ) {
+    const DB_Row<N>& x_dbm_i = x.dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    for (dimension_type j = x_space_dim + 1; j-- > 0; )
+      if (x_dbm_i[j] < y_dbm_i[j])
+        return false;
+  }
+  return true;
+}
+
+template <typename T>
+bool
+BD_Shape<T>::is_disjoint_from(const BD_Shape& y) const {
+  const dimension_type space_dim = space_dimension();
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("is_disjoint_from(y)", y);
+
+  // If one of the two bounded difference shape is empty,
+  // then the two bounded difference shape are disjoint.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return true;
+  y.shortest_path_closure_assign();
+  if (y.marked_empty())
+    return true;
+
+  // Two BDSs are disjoint when their intersection is empty.
+  // That is if and only if there exists at least a bounded difference
+  // such that the upper bound of the bounded difference in the first
+  // BD_Shape is strictly less than the lower bound of
+  // the corresponding bounded difference in the second BD_Shape
+  // or vice versa.
+  // For example: let be
+  // in `*this':    -a_j_i <= v_j - v_i <= a_i_j;
+  // and in `y':    -b_j_i <= v_j - v_i <= b_i_j;
+  // `*this' and `y' are disjoint if
+  // 1.) a_i_j < -b_j_i or
+  // 2.) b_i_j < -a_j_i.
+  PPL_DIRTY_TEMP(N, tmp);
+  for (dimension_type i = space_dim+1; i-- > 0; ) {
+    const DB_Row<N>& x_i = dbm[i];
+    for (dimension_type j = space_dim+1; j-- > 0; ) {
+      neg_assign_r(tmp, y.dbm[j][i], ROUND_UP);
+      if (x_i[j] < tmp)
+        return true;
+    }
+  }
+
+  return false;
+}
+
+template <typename T>
+bool
+BD_Shape<T>::is_universe() const {
+  if (marked_empty())
+    return false;
+
+  const dimension_type space_dim = space_dimension();
+  // If the BDS is non-empty and zero-dimensional,
+  // then it is necessarily the universe BDS.
+  if (space_dim == 0)
+    return true;
+
+  // A bounded difference shape defining the universe BDS can only
+  // contain trivial constraints.
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    const DB_Row<N>& dbm_i = dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; )
+      if (!is_plus_infinity(dbm_i[j]))
+        return false;
+  }
+  return true;
+}
+
+template <typename T>
+bool
+BD_Shape<T>::is_bounded() const {
+  shortest_path_closure_assign();
+  const dimension_type space_dim = space_dimension();
+  // A zero-dimensional or empty BDS is bounded.
+  if (marked_empty() || space_dim == 0)
+    return true;
+
+  // A bounded difference shape defining the bounded BDS never can
+  // contain trivial constraints.
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    const DB_Row<N>& dbm_i = dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; )
+      if (i != j)
+        if (is_plus_infinity(dbm_i[j]))
+          return false;
+  }
+
+  return true;
+}
+
+template <typename T>
+bool
+BD_Shape<T>::contains_integer_point() const {
+  // Force shortest-path closure.
+  if (is_empty())
+    return false;
+
+  const dimension_type space_dim = space_dimension();
+  if (space_dim == 0)
+    return true;
+
+  // A non-empty BD_Shape defined by integer constraints
+  // necessarily contains an integer point.
+  if (std::numeric_limits<T>::is_integer)
+    return true;
+
+  // Build an integer BD_Shape z with bounds at least as tight as
+  // those in *this and then recheck for emptiness.
+  BD_Shape<mpz_class> bds_z(space_dim);
+  typedef BD_Shape<mpz_class>::N Z;
+  bds_z.reset_shortest_path_closed();
+  PPL_DIRTY_TEMP(N, tmp);
+  bool all_integers = true;
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<Z>& z_i = bds_z.dbm[i];
+    const DB_Row<N>& dbm_i = dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; ) {
+      const N& dbm_i_j = dbm_i[j];
+      if (is_plus_infinity(dbm_i_j))
+        continue;
+      if (is_integer(dbm_i_j))
+        assign_r(z_i[j], dbm_i_j, ROUND_NOT_NEEDED);
+      else {
+        all_integers = false;
+        Z& z_i_j = z_i[j];
+        // Copy dbm_i_j into z_i_j, but rounding downwards.
+        neg_assign_r(tmp, dbm_i_j, ROUND_NOT_NEEDED);
+        assign_r(z_i_j, tmp, ROUND_UP);
+        neg_assign_r(z_i_j, z_i_j, ROUND_NOT_NEEDED);
+      }
+    }
+  }
+  return all_integers || !bds_z.is_empty();
+}
+
+template <typename T>
+bool
+BD_Shape<T>::frequency(const Linear_Expression& expr,
+                       Coefficient& freq_n, Coefficient& freq_d,
+                       Coefficient& val_n, Coefficient& val_d) const {
+  dimension_type space_dim = space_dimension();
+  // The dimension of `expr' must be at most the dimension of *this.
+  if (space_dim < expr.space_dimension())
+    throw_dimension_incompatible("frequency(e, ...)", "e", expr);
+
+  // Check if `expr' has a constant value.
+  // If it is constant, set the frequency `freq_n' to 0
+  // and return true. Otherwise the values for \p expr
+  // are not discrete so return false.
+
+  // Space dimension is 0: if empty, then return false;
+  // otherwise the frequency is 0 and the value is the inhomogeneous term.
+  if (space_dim == 0) {
+    if (is_empty())
+      return false;
+    freq_n = 0;
+    freq_d = 1;
+    val_n = expr.inhomogeneous_term();
+    val_d = 1;
+    return true;
+  }
+
+  shortest_path_closure_assign();
+  // For an empty BD shape, we simply return false.
+  if (marked_empty())
+    return false;
+
+  // The BD shape has at least 1 dimension and is not empty.
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  PPL_DIRTY_TEMP(N, tmp);
+  Linear_Expression le = expr;
+  // Boolean to keep track of a variable `v' in expression `le'.
+  // If we can replace `v' by an expression using variables other
+  // than `v' and are already in `le', then this is set to true.
+
+  PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
+  val_denom = 1;
+
+  // TODO: This loop can be optimized more, if needed, exploiting the
+  // (possible) sparseness of le.
+  for (dimension_type i = dbm.num_rows(); i-- > 1; ) {
+    const Variable v(i-1);
+    coeff = le.coefficient(v);
+    if (coeff == 0)
+      continue;
+
+    const DB_Row<N>& dbm_i = dbm[i];
+    // Check if `v' is constant in the BD shape.
+    assign_r(tmp, dbm_i[0], ROUND_NOT_NEEDED);
+    if (is_additive_inverse(dbm[0][i], tmp)) {
+      // If `v' is constant, replace it in `le' by the value.
+      numer_denom(tmp, numer, denom);
+      sub_mul_assign(le, coeff, v);
+      le *= denom;
+      le -= numer*coeff;
+      val_denom *= denom;
+      continue;
+    }
+    // Check the bounded differences with the other dimensions that
+    // have non-zero coefficient in `le'.
+    else {
+      bool constant_v = false;
+      for (Linear_Expression::const_iterator j = le.begin(),
+            j_end = le.lower_bound(Variable(i - 1)); j != j_end; ++j) {
+        const Variable vj = j.variable();
+        const dimension_type j_dim = vj.space_dimension();
+        assign_r(tmp, dbm_i[j_dim], ROUND_NOT_NEEDED);
+        if (is_additive_inverse(dbm[j_dim][i], tmp)) {
+          // The coefficient for `vj' in `le' is not 0
+          // and the difference with `v' in the BD shape is constant.
+          // So apply this equality to eliminate `v' in `le'.
+          numer_denom(tmp, numer, denom);
+          // Modifying le invalidates the iterators, but it's not a problem
+          // since we are going to exit the loop.
+          sub_mul_assign(le, coeff, v);
+          add_mul_assign(le, coeff, vj);
+          le *= denom;
+          le -= numer*coeff;
+          val_denom *= denom;
+          constant_v = true;
+          break;
+        }
+      }
+      if (!constant_v)
+        // The expression `expr' is not constant.
+        return false;
+    }
+  }
+
+  // The expression `expr' is constant.
+  freq_n = 0;
+  freq_d = 1;
+
+  // Reduce `val_n' and `val_d'.
+  normalize2(le.inhomogeneous_term(), val_denom, val_n, val_d);
+  return true;
+}
+
+template <typename T>
+bool
+BD_Shape<T>::constrains(const Variable var) const {
+  // `var' should be one of the dimensions of the BD shape.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dimension() < var_space_dim)
+    throw_dimension_incompatible("constrains(v)", "v", var);
+
+  shortest_path_closure_assign();
+  // A BD shape known to be empty constrains all variables.
+  // (Note: do not force emptiness check _yet_)
+  if (marked_empty())
+    return true;
+
+  // Check whether `var' is syntactically constrained.
+  const DB_Row<N>& dbm_v = dbm[var_space_dim];
+  for (dimension_type i = dbm.num_rows(); i-- > 0; ) {
+    if (!is_plus_infinity(dbm_v[i])
+        || !is_plus_infinity(dbm[i][var_space_dim]))
+      return true;
+  }
+
+  // `var' is not syntactically constrained:
+  // now force an emptiness check.
+  return is_empty();
+}
+
+template <typename T>
+void
+BD_Shape<T>
+::compute_predecessors(std::vector<dimension_type>& predecessor) const {
+  PPL_ASSERT(!marked_empty() && marked_shortest_path_closed());
+  PPL_ASSERT(predecessor.size() == 0);
+  // Variables are ordered according to their index.
+  // The vector `predecessor' is used to indicate which variable
+  // immediately precedes a given one in the corresponding equivalence class.
+  // The `leader' of an equivalence class is the element having minimum
+  // index: leaders are their own predecessors.
+  const dimension_type predecessor_size = dbm.num_rows();
+  // Initially, each variable is leader of its own zero-equivalence class.
+  predecessor.reserve(predecessor_size);
+  for (dimension_type i = 0; i < predecessor_size; ++i)
+    predecessor.push_back(i);
+  // Now compute actual predecessors.
+  for (dimension_type i = predecessor_size; i-- > 1; )
+    if (i == predecessor[i]) {
+      const DB_Row<N>& dbm_i = dbm[i];
+      for (dimension_type j = i; j-- > 0; )
+        if (j == predecessor[j]
+            && is_additive_inverse(dbm[j][i], dbm_i[j])) {
+          // Choose as predecessor the variable having the smaller index.
+          predecessor[i] = j;
+          break;
+        }
+    }
+}
+
+template <typename T>
+void
+BD_Shape<T>::compute_leaders(std::vector<dimension_type>& leaders) const {
+  PPL_ASSERT(!marked_empty() && marked_shortest_path_closed());
+  PPL_ASSERT(leaders.size() == 0);
+  // Compute predecessor information.
+  compute_predecessors(leaders);
+  // Flatten the predecessor chains so as to obtain leaders.
+  PPL_ASSERT(leaders[0] == 0);
+  for (dimension_type i = 1, l_size = leaders.size(); i != l_size; ++i) {
+    const dimension_type leaders_i = leaders[i];
+    PPL_ASSERT(leaders_i <= i);
+    if (leaders_i != i) {
+      const dimension_type leaders_leaders_i = leaders[leaders_i];
+      PPL_ASSERT(leaders_leaders_i == leaders[leaders_leaders_i]);
+      leaders[i] = leaders_leaders_i;
+    }
+  }
+}
+
+template <typename T>
+bool
+BD_Shape<T>::is_shortest_path_reduced() const {
+  // If the BDS is empty, it is also reduced.
+  if (marked_empty())
+    return true;
+
+  const dimension_type space_dim = space_dimension();
+  // Zero-dimensional BDSs are necessarily reduced.
+  if (space_dim == 0)
+    return true;
+
+  // A shortest-path reduced dbm is just a dbm with an indication of
+  // those constraints that are redundant. If there is no indication
+  // of the redundant constraints, then it cannot be reduced.
+  if (!marked_shortest_path_reduced())
+    return false;
+
+  const BD_Shape x_copy = *this;
+  x_copy.shortest_path_closure_assign();
+  // If we just discovered emptiness, it cannot be reduced.
+  if (x_copy.marked_empty())
+    return false;
+
+  // The vector `leader' is used to indicate which variables are equivalent.
+  std::vector<dimension_type> leader(space_dim + 1);
+
+  // We store the leader.
+  for (dimension_type i = space_dim + 1; i-- > 0; )
+    leader[i] = i;
+
+  // Step 1: we store really the leader with the corrected value.
+  // We search for the equivalent or zero-equivalent variables.
+  // The variable(i-1) and variable(j-1) are equivalent if and only if
+  // m_i_j == -(m_j_i).
+  for (dimension_type i = 0; i < space_dim; ++i) {
+    const DB_Row<N>& x_copy_dbm_i = x_copy.dbm[i];
+    for (dimension_type j = i + 1; j <= space_dim; ++j)
+      if (is_additive_inverse(x_copy.dbm[j][i], x_copy_dbm_i[j]))
+        // Two equivalent variables have got the same leader
+        // (the smaller variable).
+        leader[j] = leader[i];
+  }
+
+  // Step 2: we check if there are redundant constraints in the zero_cycle
+  // free bounded difference shape, considering only the leaders.
+  // A constraint `c' is redundant, when there are two constraints such that
+  // their sum is the same constraint with the inhomogeneous term
+  // less than or equal to the `c' one.
+  PPL_DIRTY_TEMP(N, c);
+  for (dimension_type k = 0; k <= space_dim; ++k)
+    if (leader[k] == k) {
+      const DB_Row<N>& x_k = x_copy.dbm[k];
+      for (dimension_type i = 0; i <= space_dim; ++i)
+        if (leader[i] == i) {
+          const DB_Row<N>& x_i = x_copy.dbm[i];
+          const Bit_Row& redundancy_i = redundancy_dbm[i];
+          const N& x_i_k = x_i[k];
+          for (dimension_type j = 0; j <= space_dim; ++j)
+            if (leader[j] == j) {
+              const N& x_i_j = x_i[j];
+              if (!is_plus_infinity(x_i_j)) {
+                add_assign_r(c, x_i_k, x_k[j], ROUND_UP);
+                if (x_i_j >= c && !redundancy_i[j])
+                  return false;
+              }
+            }
+        }
+    }
+
+  // The vector `var_conn' is used to check if there is a single cycle
+  // that connected all zero-equivalent variables between them.
+  // The value `space_dim + 1' is used to indicate that the equivalence
+  // class contains a single variable.
+  std::vector<dimension_type> var_conn(space_dim + 1);
+  for (dimension_type i = space_dim + 1; i-- > 0; )
+    var_conn[i] = space_dim + 1;
+
+  // Step 3: we store really the `var_conn' with the right value, putting
+  // the variable with the selected variable is connected:
+  // we check the row of each variable:
+  // a- each leader could be connected with only zero-equivalent one,
+  // b- each non-leader with only another zero-equivalent one.
+  for (dimension_type i = 0; i <= space_dim; ++i) {
+    // It count with how many variables the selected variable is
+    // connected.
+    dimension_type t = 0;
+    dimension_type leader_i = leader[i];
+    // Case a: leader.
+    if (leader_i == i) {
+      for (dimension_type j = 0; j <= space_dim; ++j) {
+        dimension_type leader_j = leader[j];
+        // Only the connectedness with equivalent variables
+        // is considered.
+        if (j != leader_j)
+          if (!redundancy_dbm[i][j]) {
+            if (t == 1)
+              // Two non-leaders cannot be connected with the same leader.
+              return false;
+            else
+              if (leader_j != i)
+                // The variables are not in the same equivalence class.
+                return false;
+              else {
+                ++t;
+                var_conn[i] = j;
+              }
+          }
+      }
+    }
+    // Case b: non-leader.
+    else {
+      for (dimension_type j = 0; j <= space_dim; ++j) {
+        if (!redundancy_dbm[i][j]) {
+          dimension_type leader_j = leader[j];
+          if (leader_i != leader_j)
+            // The variables are not in the same equivalence class.
+            return false;
+          else {
+            if (t == 1)
+              // The variables cannot be connected with the same leader.
+              return false;
+            else {
+              ++t;
+              var_conn[i] = j;
+            }
+          }
+          // A non-leader must be connected with
+          // another variable.
+          if (t == 0)
+            return false;
+        }
+      }
+    }
+  }
+
+  // The vector `just_checked' is used to check if
+  // a variable is already checked.
+  std::vector<bool> just_checked(space_dim + 1);
+  for (dimension_type i = space_dim + 1; i-- > 0; )
+    just_checked[i] = false;
+
+  // Step 4: we check if there are single cycles that
+  // connected all the zero-equivalent variables between them.
+  for (dimension_type i = 0; i <= space_dim; ++i) {
+    // We do not re-check the already considered single cycles.
+    if (!just_checked[i]) {
+      dimension_type v_con = var_conn[i];
+      // We consider only the equivalence classes with
+      // 2 or plus variables.
+      if (v_con != space_dim + 1) {
+        // There is a single cycle if taken a variable,
+        // we return to this same variable.
+        while (v_con != i) {
+          just_checked[v_con] = true;
+          v_con = var_conn[v_con];
+          // If we re-pass to an already considered variable,
+          // then we haven't a single cycle.
+          if (just_checked[v_con])
+            return false;
+        }
+      }
+    }
+    just_checked[i] = true;
+  }
+
+  // The system bounded differences is just reduced.
+  return true;
+}
+
+template <typename T>
+bool
+BD_Shape<T>::bounds(const Linear_Expression& expr,
+                    const bool from_above) const {
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  const dimension_type space_dim = space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((from_above
+                                  ? "bounds_from_above(e)"
+                                  : "bounds_from_below(e)"), "e", expr);
+
+  shortest_path_closure_assign();
+  // A zero-dimensional or empty BDS bounds everything.
+  if (space_dim == 0 || marked_empty())
+    return true;
+
+  // The constraint `c' is used to check if `expr' is a difference
+  // bounded and, in this case, to select the cell.
+  const Constraint& c = from_above ? expr <= 0 : expr >= 0;
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  // Check if `c' is a BD constraint.
+  if (BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
+    if (num_vars == 0)
+      // Dealing with a trivial constraint.
+      return true;
+    // Select the cell to be checked.
+    const N& x = (coeff < 0) ? dbm[i][j] : dbm[j][i];
+    return !is_plus_infinity(x);
+  }
+  else {
+    // Not a DB constraint: use the MIP solver.
+    Optimization_Mode mode_bounds
+      = from_above ? MAXIMIZATION : MINIMIZATION;
+    MIP_Problem mip(space_dim, constraints(), expr, mode_bounds);
+    // Problem is known to be feasible.
+    return mip.solve() == OPTIMIZED_MIP_PROBLEM;
+  }
+}
+
+template <typename T>
+bool
+BD_Shape<T>::max_min(const Linear_Expression& expr,
+                     const bool maximize,
+                     Coefficient& ext_n, Coefficient& ext_d,
+                     bool& included) const {
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((maximize
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
+  // Deal with zero-dim BDS first.
+  if (space_dim == 0) {
+    if (marked_empty())
+      return false;
+    else {
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      return true;
+    }
+  }
+
+  shortest_path_closure_assign();
+  // For an empty BDS we simply return false.
+  if (marked_empty())
+    return false;
+
+  // The constraint `c' is used to check if `expr' is a difference
+  // bounded and, in this case, to select the cell.
+  const Constraint& c = maximize ? expr <= 0 : expr >= 0;
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  // Check if `c' is a BD constraint.
+  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
+    Optimization_Mode mode_max_min
+      = maximize ? MAXIMIZATION : MINIMIZATION;
+    MIP_Problem mip(space_dim, constraints(), expr, mode_max_min);
+    if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
+      mip.optimal_value(ext_n, ext_d);
+      included = true;
+      return true;
+    }
+    else
+      // Here`expr' is unbounded in `*this'.
+      return false;
+  }
+  else {
+    // Here `expr' is a bounded difference.
+    if (num_vars == 0) {
+      // Dealing with a trivial expression.
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      return true;
+    }
+
+    // Select the cell to be checked.
+    const N& x = (coeff < 0) ? dbm[i][j] : dbm[j][i];
+    if (!is_plus_infinity(x)) {
+      // Compute the maximize/minimize of `expr'.
+      PPL_DIRTY_TEMP(N, d);
+      const Coefficient& b = expr.inhomogeneous_term();
+      PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+      neg_assign(minus_b, b);
+      const Coefficient& sc_b = maximize ? b : minus_b;
+      assign_r(d, sc_b, ROUND_UP);
+      // Set `coeff_expr' to the absolute value of coefficient of
+      // a variable in `expr'.
+      PPL_DIRTY_TEMP(N, coeff_expr);
+      PPL_ASSERT(i != 0);
+      const Coefficient& coeff_i = expr.get(Variable(i - 1));
+      const int sign_i = sgn(coeff_i);
+      if (sign_i > 0)
+        assign_r(coeff_expr, coeff_i, ROUND_UP);
+      else {
+        PPL_DIRTY_TEMP_COEFFICIENT(minus_coeff_i);
+        neg_assign(minus_coeff_i, coeff_i);
+        assign_r(coeff_expr, minus_coeff_i, ROUND_UP);
+      }
+      // Approximating the maximum/minimum of `expr'.
+      add_mul_assign_r(d, coeff_expr, x, ROUND_UP);
+      numer_denom(d, ext_n, ext_d);
+      if (!maximize)
+        neg_assign(ext_n);
+      included = true;
+      return true;
+    }
+
+    // `expr' is unbounded.
+    return false;
+  }
+}
+
+template <typename T>
+bool
+BD_Shape<T>::max_min(const Linear_Expression& expr,
+                     const bool maximize,
+                     Coefficient& ext_n, Coefficient& ext_d,
+                     bool& included,
+                     Generator& g) const {
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((maximize
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
+  // Deal with zero-dim BDS first.
+  if (space_dim == 0) {
+    if (marked_empty())
+      return false;
+    else {
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      g = point();
+      return true;
+    }
+  }
+
+  shortest_path_closure_assign();
+  // For an empty BDS we simply return false.
+  if (marked_empty())
+    return false;
+
+  Optimization_Mode mode_max_min
+    = maximize ? MAXIMIZATION : MINIMIZATION;
+  MIP_Problem mip(space_dim, constraints(), expr, mode_max_min);
+  if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
+    g = mip.optimizing_point();
+    mip.evaluate_objective_function(g, ext_n, ext_d);
+    included = true;
+    return true;
+  }
+  // Here `expr' is unbounded in `*this'.
+  return false;
+}
+
+template <typename T>
+Poly_Con_Relation
+BD_Shape<T>::relation_with(const Congruence& cg) const {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (cg.space_dimension() > space_dim)
+    throw_dimension_incompatible("relation_with(cg)", cg);
+
+  // If the congruence is an equality, find the relation with
+  // the equivalent equality constraint.
+  if (cg.is_equality()) {
+    Constraint c(cg);
+    return relation_with(c);
+  }
+
+  shortest_path_closure_assign();
+
+  if (marked_empty())
+    return Poly_Con_Relation::saturates()
+      && Poly_Con_Relation::is_included()
+      && Poly_Con_Relation::is_disjoint();
+
+  if (space_dim == 0) {
+    if (cg.is_inconsistent())
+      return Poly_Con_Relation::is_disjoint();
+    else
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_included();
+  }
+
+  // Find the lower bound for a hyperplane with direction
+  // defined by the congruence.
+  Linear_Expression le = Linear_Expression(cg.expression());
+  PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
+  bool min_included;
+  bool bounded_below = minimize(le, min_numer, min_denom, min_included);
+
+  // If there is no lower bound, then some of the hyperplanes defined by
+  // the congruence will strictly intersect the shape.
+  if (!bounded_below)
+    return Poly_Con_Relation::strictly_intersects();
+
+  // TODO: Consider adding a max_and_min() method, performing both
+  // maximization and minimization so as to possibly exploit
+  // incrementality of the MIP solver.
+
+  // Find the upper bound for a hyperplane with direction
+  // defined by the congruence.
+  PPL_DIRTY_TEMP_COEFFICIENT(max_numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(max_denom);
+  bool max_included;
+  bool bounded_above = maximize(le, max_numer, max_denom, max_included);
+
+  // If there is no upper bound, then some of the hyperplanes defined by
+  // the congruence will strictly intersect the shape.
+  if (!bounded_above)
+    return Poly_Con_Relation::strictly_intersects();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(signed_distance);
+
+  // Find the position value for the hyperplane that satisfies the congruence
+  // and is above the lower bound for the shape.
+  PPL_DIRTY_TEMP_COEFFICIENT(min_value);
+  min_value = min_numer / min_denom;
+  const Coefficient& modulus = cg.modulus();
+  signed_distance = min_value % modulus;
+  min_value -= signed_distance;
+  if (min_value * min_denom < min_numer)
+    min_value += modulus;
+
+  // Find the position value for the hyperplane that satisfies the congruence
+  // and is below the upper bound for the shape.
+  PPL_DIRTY_TEMP_COEFFICIENT(max_value);
+  max_value = max_numer / max_denom;
+  signed_distance = max_value % modulus;
+  max_value += signed_distance;
+  if (max_value * max_denom > max_numer)
+    max_value -= modulus;
+
+  // If the upper bound value is less than the lower bound value,
+  // then there is an empty intersection with the congruence;
+  // otherwise it will strictly intersect.
+  if (max_value < min_value)
+    return Poly_Con_Relation::is_disjoint();
+  else
+    return Poly_Con_Relation::strictly_intersects();
+}
+
+
+template <typename T>
+Poly_Con_Relation
+BD_Shape<T>::relation_with(const Constraint& c) const {
+  const dimension_type c_space_dim = c.space_dimension();
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dim)
+    throw_dimension_incompatible("relation_with(c)", c);
+
+  shortest_path_closure_assign();
+
+  if (marked_empty())
+    return Poly_Con_Relation::saturates()
+      && Poly_Con_Relation::is_included()
+      && Poly_Con_Relation::is_disjoint();
+
+  if (space_dim == 0) {
+    if ((c.is_equality() && c.inhomogeneous_term() != 0)
+        || (c.is_inequality() && c.inhomogeneous_term() < 0))
+      return Poly_Con_Relation::is_disjoint();
+    else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
+      // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
+      // thus, the zero-dimensional point also saturates it.
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_disjoint();
+    else if (c.is_equality() || c.inhomogeneous_term() == 0)
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_included();
+    else
+      // The zero-dimensional point saturates
+      // neither the positivity constraint 1 >= 0,
+      // nor the strict positivity constraint 1 > 0.
+      return Poly_Con_Relation::is_included();
+  }
+
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  if (!BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
+    // Constraints that are not bounded differences.
+    // Use maximize() and minimize() to do much of the work.
+
+    // Find the linear expression for the constraint and use that to
+    // find if the expression is bounded from above or below and if it
+    // is, find the maximum and minimum values.
+    Linear_Expression le(c.expression());
+    le.set_inhomogeneous_term(Coefficient_zero());
+
+    PPL_DIRTY_TEMP(Coefficient, max_numer);
+    PPL_DIRTY_TEMP(Coefficient, max_denom);
+    bool max_included;
+    PPL_DIRTY_TEMP(Coefficient, min_numer);
+    PPL_DIRTY_TEMP(Coefficient, min_denom);
+    bool min_included;
+    bool bounded_above = maximize(le, max_numer, max_denom, max_included);
+    bool bounded_below = minimize(le, min_numer, min_denom, min_included);
+    if (!bounded_above) {
+      if (!bounded_below)
+        return Poly_Con_Relation::strictly_intersects();
+      min_numer += c.inhomogeneous_term() * min_denom;
+      switch (sgn(min_numer)) {
+      case 1:
+        if (c.is_equality())
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_included();
+      case 0:
+        if (c.is_strict_inequality() || c.is_equality())
+          return Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::is_included();
+      case -1:
+        return Poly_Con_Relation::strictly_intersects();
+      }
+    }
+    if (!bounded_below) {
+      max_numer += c.inhomogeneous_term() * max_denom;
+      switch (sgn(max_numer)) {
+      case 1:
+        return Poly_Con_Relation::strictly_intersects();
+      case 0:
+        if (c.is_strict_inequality())
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      }
+    }
+    else {
+      max_numer += c.inhomogeneous_term() * max_denom;
+      min_numer += c.inhomogeneous_term() * min_denom;
+      switch (sgn(max_numer)) {
+      case 1:
+        switch (sgn(min_numer)) {
+        case 1:
+          if (c.is_equality())
+            return Poly_Con_Relation::is_disjoint();
+          return Poly_Con_Relation::is_included();
+        case 0:
+          if (c.is_equality())
+            return Poly_Con_Relation::strictly_intersects();
+          if (c.is_strict_inequality())
+            return Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_included();
+        case -1:
+          return Poly_Con_Relation::strictly_intersects();
+        }
+        PPL_UNREACHABLE;
+        break;
+      case 0:
+        if (min_numer == 0) {
+          if (c.is_strict_inequality())
+            return Poly_Con_Relation::is_disjoint()
+              && Poly_Con_Relation::saturates();
+          return Poly_Con_Relation::is_included()
+            && Poly_Con_Relation::saturates();
+        }
+        if (c.is_strict_inequality())
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      }
+    }
+  }
+
+  // Constraints that are bounded differences.
+  if (num_vars == 0) {
+    // Dealing with a trivial constraint.
+    switch (sgn(c.inhomogeneous_term())) {
+    case -1:
+      return Poly_Con_Relation::is_disjoint();
+    case 0:
+      if (c.is_strict_inequality())
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_disjoint();
+      else
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_included();
+    case 1:
+      if (c.is_equality())
+        return Poly_Con_Relation::is_disjoint();
+      else
+        return Poly_Con_Relation::is_included();
+    }
+  }
+
+  // Select the cell to be checked for the "<=" part of the constraint,
+  // and set `coeff' to the absolute value of itself.
+  const bool negative = (coeff < 0);
+  const N& x = negative ? dbm[i][j] : dbm[j][i];
+  const N& y = negative ? dbm[j][i] : dbm[i][j];
+  if (negative)
+    neg_assign(coeff);
+  // Deduce the relation/s of the constraint `c' of the form
+  // `coeff*v - coeff*u </<=/== c.inhomogeneous_term()'
+  // with the respectively constraints in `*this'
+  // `-y <= v - u <= x'.
+  // Let `d == c.inhomogeneous_term()/coeff'
+  // and `d1 == -c.inhomogeneous_term()/coeff'.
+  // The following variables of mpq_class type are used to be precise
+  // when the bds is defined by integer constraints.
+  PPL_DIRTY_TEMP(mpq_class, q_x);
+  PPL_DIRTY_TEMP(mpq_class, q_y);
+  PPL_DIRTY_TEMP(mpq_class, d);
+  PPL_DIRTY_TEMP(mpq_class, d1);
+  PPL_DIRTY_TEMP(mpq_class, c_denom);
+  PPL_DIRTY_TEMP(mpq_class, q_denom);
+  assign_r(c_denom, coeff, ROUND_NOT_NEEDED);
+  assign_r(d, c.inhomogeneous_term(), ROUND_NOT_NEEDED);
+  neg_assign_r(d1, d, ROUND_NOT_NEEDED);
+  div_assign_r(d, d, c_denom, ROUND_NOT_NEEDED);
+  div_assign_r(d1, d1, c_denom, ROUND_NOT_NEEDED);
+
+  if (is_plus_infinity(x)) {
+    if (!is_plus_infinity(y)) {
+      // `*this' is in the following form:
+      // `-y <= v - u'.
+      // In this case `*this' is disjoint from `c' if
+      // `-y > d' (`-y >= d' if c is a strict equality), i.e. if
+      // `y < d1' (`y <= d1' if c is a strict equality).
+      PPL_DIRTY_TEMP_COEFFICIENT(numer);
+      PPL_DIRTY_TEMP_COEFFICIENT(denom);
+      numer_denom(y, numer, denom);
+      assign_r(q_denom, denom, ROUND_NOT_NEEDED);
+      assign_r(q_y, numer, ROUND_NOT_NEEDED);
+      div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
+      if (q_y < d1)
+        return Poly_Con_Relation::is_disjoint();
+      if (q_y == d1 && c.is_strict_inequality())
+        return Poly_Con_Relation::is_disjoint();
+    }
+
+    // In all other cases `*this' intersects `c'.
+    return Poly_Con_Relation::strictly_intersects();
+  }
+
+  // Here `x' is not plus-infinity.
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  numer_denom(x, numer, denom);
+  assign_r(q_denom, denom, ROUND_NOT_NEEDED);
+  assign_r(q_x, numer, ROUND_NOT_NEEDED);
+  div_assign_r(q_x, q_x, q_denom, ROUND_NOT_NEEDED);
+
+  if (!is_plus_infinity(y)) {
+    numer_denom(y, numer, denom);
+    assign_r(q_denom, denom, ROUND_NOT_NEEDED);
+    assign_r(q_y, numer, ROUND_NOT_NEEDED);
+    div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
+    if (q_x == d && q_y == d1) {
+      if (c.is_strict_inequality())
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_disjoint();
+      else
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_included();
+    }
+    // `*this' is disjoint from `c' when
+    // `-y > d' (`-y >= d' if c is a strict equality), i.e. if
+    // `y < d1' (`y <= d1' if c is a strict equality).
+    if (q_y < d1)
+      return Poly_Con_Relation::is_disjoint();
+    if (q_y == d1 && c.is_strict_inequality())
+      return Poly_Con_Relation::is_disjoint();
+  }
+
+  // Here `y' can be also plus-infinity.
+  // If `c' is an equality, `*this' is disjoint from `c' if
+  // `x < d'.
+  if (d > q_x) {
+    if (c.is_equality())
+      return Poly_Con_Relation::is_disjoint();
+    else
+      return Poly_Con_Relation::is_included();
+  }
+
+  if (d == q_x && c.is_nonstrict_inequality())
+    return Poly_Con_Relation::is_included();
+
+  // In all other cases `*this' intersects `c'.
+  return Poly_Con_Relation::strictly_intersects();
+}
+
+template <typename T>
+Poly_Gen_Relation
+BD_Shape<T>::relation_with(const Generator& g) const {
+  const dimension_type space_dim = space_dimension();
+  const dimension_type g_space_dim = g.space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim < g_space_dim)
+    throw_dimension_incompatible("relation_with(g)", g);
+
+  shortest_path_closure_assign();
+  // The empty BDS cannot subsume a generator.
+  if (marked_empty())
+    return Poly_Gen_Relation::nothing();
+
+  // A universe BDS in a zero-dimensional space subsumes
+  // all the generators of a zero-dimensional space.
+  if (space_dim == 0)
+    return Poly_Gen_Relation::subsumes();
+
+  const bool is_line = g.is_line();
+  const bool is_line_or_ray = g.is_line_or_ray();
+
+  // The relation between the BDS and the given generator is obtained
+  // checking if the generator satisfies all the constraints in the BDS.
+  // To check if the generator satisfies all the constraints it's enough
+  // studying the sign of the scalar product between the generator and
+  // all the constraints in the BDS.
+
+  // Allocation of temporaries done once and for all.
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  PPL_DIRTY_TEMP_COEFFICIENT(product);
+  // We find in `*this' all the constraints.
+  // TODO: This loop can be optimized more, if needed.
+  for (dimension_type i = 0; i <= space_dim; ++i) {
+    const Coefficient& g_coeff_y = (i > g_space_dim || i == 0)
+      ? Coefficient_zero() : g.coefficient(Variable(i-1));
+    const DB_Row<N>& dbm_i = dbm[i];
+    for (dimension_type j = i + 1; j <= space_dim; ++j) {
+      const Coefficient& g_coeff_x = (j > g_space_dim)
+        ? Coefficient_zero() : g.coefficient(Variable(j-1));
+      const N& dbm_ij = dbm_i[j];
+      const N& dbm_ji = dbm[j][i];
+      if (is_additive_inverse(dbm_ji, dbm_ij)) {
+        // We have one equality constraint: denom*x - denom*y = numer.
+        // Compute the scalar product.
+        numer_denom(dbm_ij, numer, denom);
+        product = g_coeff_y;
+        product -= g_coeff_x;
+        product *= denom;
+        if (!is_line_or_ray)
+          add_mul_assign(product, numer, g.divisor());
+        if (product != 0)
+          return Poly_Gen_Relation::nothing();
+      }
+      else {
+        // We have 0, 1 or 2 binary inequality constraint/s.
+        if (!is_plus_infinity(dbm_ij)) {
+          // We have the binary inequality constraint:
+          // denom*x - denom*y <= numer.
+          // Compute the scalar product.
+          numer_denom(dbm_ij, numer, denom);
+          product = g_coeff_y;
+          product -= g_coeff_x;
+          product *= denom;
+          if (!is_line_or_ray)
+            add_mul_assign(product, numer, g.divisor());
+          if (is_line) {
+            if (product != 0)
+              // Lines must saturate all constraints.
+              return Poly_Gen_Relation::nothing();
+          }
+          else
+            // `g' is either a ray, a point or a closure point.
+            if (product < 0)
+              return Poly_Gen_Relation::nothing();
+        }
+
+        if (!is_plus_infinity(dbm_ji)) {
+          // We have the binary inequality constraint: denom*y - denom*x <= b.
+          // Compute the scalar product.
+          numer_denom(dbm_ji, numer, denom);
+          product = 0;
+          add_mul_assign(product, denom, g_coeff_x);
+          add_mul_assign(product, -denom, g_coeff_y);
+          if (!is_line_or_ray)
+            add_mul_assign(product, numer, g.divisor());
+          if (is_line) {
+            if (product != 0)
+              // Lines must saturate all constraints.
+              return Poly_Gen_Relation::nothing();
+          }
+          else
+            // `g' is either a ray, a point or a closure point.
+            if (product < 0)
+              return Poly_Gen_Relation::nothing();
+        }
+      }
+    }
+  }
+
+  // The generator satisfies all the constraints.
+  return Poly_Gen_Relation::subsumes();
+}
+
+template <typename T>
+void
+BD_Shape<T>::shortest_path_closure_assign() const {
+  // Do something only if necessary.
+  if (marked_empty() || marked_shortest_path_closed())
+    return;
+  const dimension_type num_dimensions = space_dimension();
+  // Zero-dimensional BDSs are necessarily shortest-path closed.
+  if (num_dimensions == 0)
+    return;
+
+  // Even though the BDS will not change, its internal representation
+  // is going to be modified by the Floyd-Warshall algorithm.
+  BD_Shape& x = const_cast<BD_Shape<T>&>(*this);
+
+  // Fill the main diagonal with zeros.
+  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
+    PPL_ASSERT(is_plus_infinity(x.dbm[h][h]));
+    assign_r(x.dbm[h][h], 0, ROUND_NOT_NEEDED);
+  }
+
+  PPL_DIRTY_TEMP(N, sum);
+  for (dimension_type k = num_dimensions + 1; k-- > 0; ) {
+    const DB_Row<N>& x_dbm_k = x.dbm[k];
+    for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
+      DB_Row<N>& x_dbm_i = x.dbm[i];
+      const N& x_dbm_i_k = x_dbm_i[k];
+      if (!is_plus_infinity(x_dbm_i_k))
+        for (dimension_type j = num_dimensions + 1; j-- > 0; ) {
+          const N& x_dbm_k_j = x_dbm_k[j];
+          if (!is_plus_infinity(x_dbm_k_j)) {
+            // Rounding upward for correctness.
+            add_assign_r(sum, x_dbm_i_k, x_dbm_k_j, ROUND_UP);
+            min_assign(x_dbm_i[j], sum);
+          }
+        }
+    }
+  }
+
+  // Check for emptiness: the BDS is empty if and only if there is a
+  // negative value on the main diagonal of `dbm'.
+  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
+    N& x_dbm_hh = x.dbm[h][h];
+    if (sgn(x_dbm_hh) < 0) {
+      x.set_empty();
+      return;
+    }
+    else {
+      PPL_ASSERT(sgn(x_dbm_hh) == 0);
+      // Restore PLUS_INFINITY on the main diagonal.
+      assign_r(x_dbm_hh, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+
+  // The BDS is not empty and it is now shortest-path closed.
+  x.set_shortest_path_closed();
+}
+
+template <typename T>
+void
+BD_Shape<T>::incremental_shortest_path_closure_assign(Variable var) const {
+  // Do something only if necessary.
+  if (marked_empty() || marked_shortest_path_closed())
+    return;
+  const dimension_type num_dimensions = space_dimension();
+  PPL_ASSERT(var.id() < num_dimensions);
+
+  // Even though the BDS will not change, its internal representation
+  // is going to be modified by the incremental Floyd-Warshall algorithm.
+  BD_Shape& x = const_cast<BD_Shape&>(*this);
+
+  // Fill the main diagonal with zeros.
+  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
+    PPL_ASSERT(is_plus_infinity(x.dbm[h][h]));
+    assign_r(x.dbm[h][h], 0, ROUND_NOT_NEEDED);
+  }
+
+  // Using the incremental Floyd-Warshall algorithm.
+  PPL_DIRTY_TEMP(N, sum);
+  const dimension_type v = var.id() + 1;
+  DB_Row<N>& x_v = x.dbm[v];
+  // Step 1: Improve all constraints on variable `var'.
+  for (dimension_type k = num_dimensions + 1; k-- > 0; ) {
+    DB_Row<N>& x_k = x.dbm[k];
+    const N& x_v_k = x_v[k];
+    const N& x_k_v = x_k[v];
+    const bool x_v_k_finite = !is_plus_infinity(x_v_k);
+    const bool x_k_v_finite = !is_plus_infinity(x_k_v);
+    // Specialize inner loop based on finiteness info.
+    if (x_v_k_finite) {
+      if (x_k_v_finite) {
+        // Here both x_v_k and x_k_v are finite.
+        for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
+          DB_Row<N>& x_i = x.dbm[i];
+          const N& x_i_k = x_i[k];
+          if (!is_plus_infinity(x_i_k)) {
+            add_assign_r(sum, x_i_k, x_k_v, ROUND_UP);
+            min_assign(x_i[v], sum);
+          }
+          const N& x_k_i = x_k[i];
+          if (!is_plus_infinity(x_k_i)) {
+            add_assign_r(sum, x_v_k, x_k_i, ROUND_UP);
+            min_assign(x_v[i], sum);
+          }
+        }
+      }
+      else {
+        // Here x_v_k is finite, but x_k_v is not.
+        for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
+          const N& x_k_i = x_k[i];
+          if (!is_plus_infinity(x_k_i)) {
+            add_assign_r(sum, x_v_k, x_k_i, ROUND_UP);
+            min_assign(x_v[i], sum);
+          }
+        }
+      }
+    }
+    else if (x_k_v_finite) {
+      // Here x_v_k is infinite, but x_k_v is finite.
+      for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
+        DB_Row<N>& x_i = x.dbm[i];
+        const N& x_i_k = x_i[k];
+        if (!is_plus_infinity(x_i_k)) {
+          add_assign_r(sum, x_i_k, x_k_v, ROUND_UP);
+          min_assign(x_i[v], sum);
+        }
+      }
+    }
+    else
+      // Here both x_v_k and x_k_v are infinite.
+      continue;
+  }
+
+  // Step 2: improve the other bounds by using the precise bounds
+  // for the constraints on `var'.
+  for (dimension_type i = num_dimensions + 1; i-- > 0; ) {
+    DB_Row<N>& x_i = x.dbm[i];
+    const N& x_i_v = x_i[v];
+    if (!is_plus_infinity(x_i_v)) {
+      for (dimension_type j = num_dimensions + 1; j-- > 0; ) {
+        const N& x_v_j = x_v[j];
+        if (!is_plus_infinity(x_v_j)) {
+          add_assign_r(sum, x_i_v, x_v_j, ROUND_UP);
+          min_assign(x_i[j], sum);
+        }
+      }
+    }
+  }
+
+  // Check for emptiness: the BDS is empty if and only if there is a
+  // negative value on the main diagonal of `dbm'.
+  for (dimension_type h = num_dimensions + 1; h-- > 0; ) {
+    N& x_dbm_hh = x.dbm[h][h];
+    if (sgn(x_dbm_hh) < 0) {
+      x.set_empty();
+      return;
+    }
+    else {
+      PPL_ASSERT(sgn(x_dbm_hh) == 0);
+      // Restore PLUS_INFINITY on the main diagonal.
+      assign_r(x_dbm_hh, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+
+  // The BDS is not empty and it is now shortest-path closed.
+  x.set_shortest_path_closed();
+}
+
+template <typename T>
+void
+BD_Shape<T>::shortest_path_reduction_assign() const {
+  // Do something only if necessary.
+  if (marked_shortest_path_reduced())
+    return;
+
+  const dimension_type space_dim = space_dimension();
+  // Zero-dimensional BDSs are necessarily reduced.
+  if (space_dim == 0)
+    return;
+
+  // First find the tightest constraints for this BDS.
+  shortest_path_closure_assign();
+
+  // If `*this' is empty, then there is nothing to reduce.
+  if (marked_empty())
+    return;
+
+  // Step 1: compute zero-equivalence classes.
+  // Variables corresponding to indices `i' and `j' are zero-equivalent
+  // if they lie on a zero-weight loop; since the matrix is shortest-path
+  // closed, this happens if and only if dbm[i][j] == -dbm[j][i].
+  std::vector<dimension_type> predecessor;
+  compute_predecessors(predecessor);
+  std::vector<dimension_type> leaders;
+  compute_leader_indices(predecessor, leaders);
+  const dimension_type num_leaders = leaders.size();
+
+  Bit_Matrix redundancy(space_dim + 1, space_dim + 1);
+  // Init all constraints to be redundant.
+  // TODO: provide an appropriate method to set multiple bits.
+  Bit_Row& red_0 = redundancy[0];
+  for (dimension_type j = space_dim + 1; j-- > 0; )
+    red_0.set(j);
+  for (dimension_type i = space_dim + 1; i-- > 0; )
+    redundancy[i] = red_0;
+
+  // Step 2: flag non-redundant constraints in the (zero-cycle-free)
+  // subsystem of bounded differences having only leaders as variables.
+  PPL_DIRTY_TEMP(N, c);
+  for (dimension_type l_i = 0; l_i < num_leaders; ++l_i) {
+    const dimension_type i = leaders[l_i];
+    const DB_Row<N>& dbm_i = dbm[i];
+    Bit_Row& redundancy_i = redundancy[i];
+    for (dimension_type l_j = 0; l_j < num_leaders; ++l_j) {
+      const dimension_type j = leaders[l_j];
+      if (redundancy_i[j]) {
+        const N& dbm_i_j = dbm_i[j];
+        redundancy_i.clear(j);
+        for (dimension_type l_k = 0; l_k < num_leaders; ++l_k) {
+          const dimension_type k = leaders[l_k];
+          add_assign_r(c, dbm_i[k], dbm[k][j], ROUND_UP);
+          if (dbm_i_j >= c) {
+            redundancy_i.set(j);
+            break;
+          }
+        }
+      }
+    }
+  }
+
+  // Step 3: flag non-redundant constraints in zero-equivalence classes.
+  // Each equivalence class must have a single 0-cycle connecting
+  // all the equivalent variables in increasing order.
+  std::deque<bool> dealt_with(space_dim + 1, false);
+  for (dimension_type i = space_dim + 1; i-- > 0; )
+    // We only need to deal with non-singleton zero-equivalence classes
+    // that haven't already been dealt with.
+    if (i != predecessor[i] && !dealt_with[i]) {
+      dimension_type j = i;
+      while (true) {
+        const dimension_type predecessor_j = predecessor[j];
+        if (j == predecessor_j) {
+          // We finally found the leader of `i'.
+          PPL_ASSERT(redundancy[i][j]);
+          redundancy[i].clear(j);
+          // Here we dealt with `j' (i.e., `predecessor_j'), but it is useless
+          // to update `dealt_with' because `j' is a leader.
+          break;
+        }
+        // We haven't found the leader of `i' yet.
+        PPL_ASSERT(redundancy[predecessor_j][j]);
+        redundancy[predecessor_j].clear(j);
+        dealt_with[predecessor_j] = true;
+        j = predecessor_j;
+      }
+    }
+
+  // Even though shortest-path reduction is not going to change the BDS,
+  // it might change its internal representation.
+  BD_Shape<T>& x = const_cast<BD_Shape<T>&>(*this);
+  using std::swap;
+  swap(x.redundancy_dbm, redundancy);
+  x.set_shortest_path_reduced();
+
+  PPL_ASSERT(is_shortest_path_reduced());
+}
+
+template <typename T>
+void
+BD_Shape<T>::upper_bound_assign(const BD_Shape& y) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("upper_bound_assign(y)", y);
+
+  // The upper bound of a BD shape `bd' with an empty shape is `bd'.
+  y.shortest_path_closure_assign();
+  if (y.marked_empty())
+    return;
+  shortest_path_closure_assign();
+  if (marked_empty()) {
+    *this = y;
+    return;
+  }
+
+  // The bds-hull consists in constructing `*this' with the maximum
+  // elements selected from `*this' and `y'.
+  PPL_ASSERT(space_dim == 0 || marked_shortest_path_closed());
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; ) {
+      N& dbm_ij = dbm_i[j];
+      const N& y_dbm_ij = y_dbm_i[j];
+      if (dbm_ij < y_dbm_ij)
+        dbm_ij = y_dbm_ij;
+    }
+  }
+  // Shortest-path closure is maintained (if it was holding).
+  // TODO: see whether reduction can be (efficiently!) maintained too.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+bool
+BD_Shape<T>::BFT00_upper_bound_assign_if_exact(const BD_Shape& y) {
+  // Declare a const reference to *this (to avoid accidental modifications).
+  const BD_Shape& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+
+  // Private method: the caller must ensure the following.
+  PPL_ASSERT(x_space_dim == y.space_dimension());
+
+  // The zero-dim case is trivial.
+  if (x_space_dim == 0) {
+    upper_bound_assign(y);
+    return true;
+  }
+  // If `x' or `y' is (known to be) empty, the upper bound is exact.
+  if (x.marked_empty()) {
+    *this = y;
+    return true;
+  }
+  else if (y.is_empty())
+    return true;
+  else if (x.is_empty()) {
+    *this = y;
+    return true;
+  }
+
+  // Here both `x' and `y' are known to be non-empty.
+  // Implementation based on Algorithm 4.1 (page 6) in [BemporadFT00TR],
+  // tailored to the special case of BD shapes.
+
+  Variable epsilon(x_space_dim);
+  Linear_Expression zero_expr;
+  zero_expr.set_space_dimension(x_space_dim + 1);
+  Linear_Expression db_expr;
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+
+  // Step 1: compute the constraint system for the envelope env(x,y)
+  // and put into x_cs_removed and y_cs_removed those non-redundant
+  // constraints that are not in the constraint system for env(x,y).
+  // While at it, also add the additional space dimension (epsilon).
+  Constraint_System env_cs;
+  Constraint_System x_cs_removed;
+  Constraint_System y_cs_removed;
+  x.shortest_path_reduction_assign();
+  y.shortest_path_reduction_assign();
+  for (dimension_type i = x_space_dim + 1; i-- > 0; ) {
+    const Bit_Row& x_red_i = x.redundancy_dbm[i];
+    const Bit_Row& y_red_i = y.redundancy_dbm[i];
+    const DB_Row<N>& x_dbm_i = x.dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    for (dimension_type j = x_space_dim + 1; j-- > 0; ) {
+      if (x_red_i[j] && y_red_i[j])
+        continue;
+      if (!x_red_i[j]) {
+        const N& x_dbm_ij = x_dbm_i[j];
+        PPL_ASSERT(!is_plus_infinity(x_dbm_ij));
+        numer_denom(x_dbm_ij, numer, denom);
+        // Build skeleton DB constraint (having the right space dimension).
+        db_expr = zero_expr;
+        if (i > 0)
+          db_expr += Variable(i-1);
+        if (j > 0)
+          db_expr -= Variable(j-1);
+        if (denom != 1)
+          db_expr *= denom;
+        db_expr += numer;
+        if (x_dbm_ij >= y_dbm_i[j])
+          env_cs.insert(db_expr >= 0);
+        else {
+          db_expr += epsilon;
+          x_cs_removed.insert(db_expr == 0);
+        }
+      }
+      if (!y_red_i[j]) {
+        const N& y_dbm_ij = y_dbm_i[j];
+        const N& x_dbm_ij = x_dbm_i[j];
+        PPL_ASSERT(!is_plus_infinity(y_dbm_ij));
+        numer_denom(y_dbm_ij, numer, denom);
+        // Build skeleton DB constraint (having the right space dimension).
+        db_expr = zero_expr;
+        if (i > 0)
+          db_expr += Variable(i-1);
+        if (j > 0)
+          db_expr -= Variable(j-1);
+        if (denom != 1)
+          db_expr *= denom;
+        db_expr += numer;
+        if (y_dbm_ij >= x_dbm_ij) {
+          // Check if same constraint was added when considering x_dbm_ij.
+          if (!x_red_i[j] && x_dbm_ij == y_dbm_ij)
+            continue;
+          env_cs.insert(db_expr >= 0);
+        }
+        else {
+          db_expr += epsilon;
+          y_cs_removed.insert(db_expr == 0);
+        }
+      }
+    }
+  }
+
+  if (x_cs_removed.empty())
+    // No constraint of x was removed: y is included in x.
+    return true;
+  if (y_cs_removed.empty()) {
+    // No constraint of y was removed: x is included in y.
+    *this = y;
+    return true;
+  }
+
+  // In preparation to Step 4: build the common part of LP problems,
+  // i.e., the constraints corresponding to env(x,y),
+  // where the additional space dimension (epsilon) has to be maximized.
+  MIP_Problem env_lp(x_space_dim + 1, env_cs, epsilon, MAXIMIZATION);
+  // Pre-solve `env_lp' to later exploit incrementality.
+  env_lp.solve();
+  PPL_ASSERT(env_lp.solve() != UNFEASIBLE_MIP_PROBLEM);
+
+  // Implementing loop in Steps 3-6.
+  for (Constraint_System::const_iterator i = x_cs_removed.begin(),
+         i_end = x_cs_removed.end(); i != i_end; ++i) {
+    MIP_Problem lp_i(env_lp);
+    lp_i.add_constraint(*i);
+    // Pre-solve to exploit incrementality.
+    if (lp_i.solve() == UNFEASIBLE_MIP_PROBLEM)
+      continue;
+    for (Constraint_System::const_iterator j = y_cs_removed.begin(),
+           j_end = y_cs_removed.end(); j != j_end; ++j) {
+      MIP_Problem lp_ij(lp_i);
+      lp_ij.add_constraint(*j);
+      // Solve and check for a positive optimal value.
+      switch (lp_ij.solve()) {
+      case UNFEASIBLE_MIP_PROBLEM:
+        // CHECKME: is the following actually impossible?
+        PPL_UNREACHABLE;
+        return false;
+      case UNBOUNDED_MIP_PROBLEM:
+        return false;
+      case OPTIMIZED_MIP_PROBLEM:
+        lp_ij.optimal_value(numer, denom);
+        if (numer > 0)
+          return false;
+        break;
+      }
+    }
+  }
+
+  // The upper bound of x and y is indeed exact.
+  upper_bound_assign(y);
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename T>
+template <bool integer_upper_bound>
+bool
+BD_Shape<T>::BHZ09_upper_bound_assign_if_exact(const BD_Shape& y) {
+  PPL_COMPILE_TIME_CHECK(!integer_upper_bound
+                         || std::numeric_limits<T>::is_integer,
+                         "BD_Shape<T>::BHZ09_upper_bound_assign_if_exact(y):"
+                         " instantiating for integer upper bound,"
+                         " but T in not an integer datatype.");
+
+  // FIXME, CHECKME: what about inexact computations?
+  // Declare a const reference to *this (to avoid accidental modifications).
+  const BD_Shape& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+
+  // Private method: the caller must ensure the following.
+  PPL_ASSERT(x_space_dim == y.space_dimension());
+
+  // The zero-dim case is trivial.
+  if (x_space_dim == 0) {
+    upper_bound_assign(y);
+    return true;
+  }
+  // If `x' or `y' is (known to be) empty, the upper bound is exact.
+  if (x.marked_empty()) {
+    *this = y;
+    return true;
+  }
+  else if (y.is_empty())
+    return true;
+  else if (x.is_empty()) {
+    *this = y;
+    return true;
+  }
+
+  // Here both `x' and `y' are known to be non-empty.
+  x.shortest_path_reduction_assign();
+  y.shortest_path_reduction_assign();
+  PPL_ASSERT(x.marked_shortest_path_closed());
+  PPL_ASSERT(y.marked_shortest_path_closed());
+  // Pre-compute the upper bound of `x' and `y'.
+  BD_Shape<T> ub(x);
+  ub.upper_bound_assign(y);
+
+  PPL_DIRTY_TEMP(N, lhs);
+  PPL_DIRTY_TEMP(N, rhs);
+  PPL_DIRTY_TEMP(N, temp_zero);
+  assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
+  PPL_DIRTY_TEMP(N, temp_one);
+  if (integer_upper_bound)
+    assign_r(temp_one, 1, ROUND_NOT_NEEDED);
+
+  for (dimension_type i = x_space_dim + 1; i-- > 0; ) {
+    const DB_Row<N>& x_i = x.dbm[i];
+    const Bit_Row& x_red_i = x.redundancy_dbm[i];
+    const DB_Row<N>& y_i = y.dbm[i];
+    const DB_Row<N>& ub_i = ub.dbm[i];
+    for (dimension_type j = x_space_dim + 1; j-- > 0; ) {
+      // Check redundancy of x_i_j.
+      if (x_red_i[j])
+        continue;
+      // By non-redundancy, we know that i != j.
+      PPL_ASSERT(i != j);
+      const N& x_i_j = x_i[j];
+      if (x_i_j < y_i[j]) {
+        for (dimension_type k = x_space_dim + 1; k-- > 0; ) {
+          const DB_Row<N>& x_k = x.dbm[k];
+          const DB_Row<N>& y_k = y.dbm[k];
+          const Bit_Row& y_red_k = y.redundancy_dbm[k];
+          const DB_Row<N>& ub_k = ub.dbm[k];
+          const N& ub_k_j = (k == j) ? temp_zero : ub_k[j];
+          for (dimension_type ell = x_space_dim + 1; ell-- > 0; ) {
+            // Check redundancy of y_k_ell.
+            if (y_red_k[ell])
+              continue;
+            // By non-redundancy, we know that k != ell.
+            PPL_ASSERT(k != ell);
+            const N& y_k_ell = y_k[ell];
+            if (y_k_ell < x_k[ell]) {
+              // The first condition in BHZ09 theorem holds;
+              // now check for the second condition.
+              add_assign_r(lhs, x_i_j, y_k_ell, ROUND_UP);
+              const N& ub_i_ell = (i == ell) ? temp_zero : ub_i[ell];
+              add_assign_r(rhs, ub_i_ell, ub_k_j, ROUND_UP);
+              if (integer_upper_bound) {
+                // Note: adding 1 rather than 2 (as in Theorem 5.3)
+                // so as to later test for < rather than <=.
+                add_assign_r(lhs, lhs, temp_one, ROUND_NOT_NEEDED);
+              }
+              // Testing for < in both the rational and integer case.
+              if (lhs < rhs)
+                return false;
+            }
+          }
+        }
+      }
+    }
+  }
+  // The upper bound of x and y is indeed exact.
+  m_swap(ub);
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename T>
+void
+BD_Shape<T>::difference_assign(const BD_Shape& y) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("difference_assign(y)", y);
+
+  BD_Shape new_bd_shape(space_dim, EMPTY);
+
+  BD_Shape& x = *this;
+
+  x.shortest_path_closure_assign();
+  // The difference of an empty bounded difference shape
+  // and of a bounded difference shape `p' is empty.
+  if (x.marked_empty())
+    return;
+  y.shortest_path_closure_assign();
+  // The difference of a bounded difference shape `p'
+  // and an empty bounded difference shape is `p'.
+  if (y.marked_empty())
+    return;
+
+  // If both bounded difference shapes are zero-dimensional,
+  // then at this point they are necessarily universe system of
+  // bounded differences, so that their difference is empty.
+  if (space_dim == 0) {
+    x.set_empty();
+    return;
+  }
+
+  // TODO: This is just an executable specification.
+  //       Have to find a more efficient method.
+  if (y.contains(x)) {
+    x.set_empty();
+    return;
+  }
+
+  // We take a constraint of the system y at the time and we
+  // consider its complementary. Then we intersect the union
+  // of these complementary constraints with the system x.
+  const Constraint_System& y_cs = y.constraints();
+  for (Constraint_System::const_iterator i = y_cs.begin(),
+         y_cs_end = y_cs.end(); i != y_cs_end; ++i) {
+    const Constraint& c = *i;
+    // If the bounded difference shape `x' is included
+    // in the bounded difference shape defined by `c',
+    // then `c' _must_ be skipped, as adding its complement to `x'
+    // would result in the empty bounded difference shape,
+    // and as we would obtain a result that is less precise
+    // than the bds-difference.
+    if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
+      continue;
+    BD_Shape z = x;
+    const Linear_Expression e(c.expression());
+    z.add_constraint(e <= 0);
+    if (!z.is_empty())
+      new_bd_shape.upper_bound_assign(z);
+    if (c.is_equality()) {
+      z = x;
+      z.add_constraint(e >= 0);
+      if (!z.is_empty())
+        new_bd_shape.upper_bound_assign(z);
+    }
+  }
+  *this = new_bd_shape;
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+bool
+BD_Shape<T>::simplify_using_context_assign(const BD_Shape& y) {
+  BD_Shape& x = *this;
+  const dimension_type dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (dim != y.space_dimension())
+    throw_dimension_incompatible("simplify_using_context_assign(y)", y);
+
+  // Filter away the zero-dimensional case.
+  if (dim == 0) {
+    if (y.marked_empty()) {
+      x.set_zero_dim_univ();
+      return false;
+    }
+    else
+      return !x.marked_empty();
+  }
+
+  // Filter away the case where `x' contains `y'
+  // (this subsumes the case when `y' is empty).
+  y.shortest_path_closure_assign();
+  if (x.contains(y)) {
+    BD_Shape<T> res(dim, UNIVERSE);
+    x.m_swap(res);
+    return false;
+  }
+
+  // Filter away the case where `x' is empty.
+  x.shortest_path_closure_assign();
+  if (x.marked_empty()) {
+    // Search for a constraint of `y' that is not a tautology.
+    dimension_type i;
+    dimension_type j;
+    // Prefer unary constraints.
+    i = 0;
+    const DB_Row<N>& y_dbm_0 = y.dbm[0];
+    for (j = 1; j <= dim; ++j) {
+      if (!is_plus_infinity(y_dbm_0[j]))
+        // FIXME: if N is a float or bounded integer type, then
+        // we also need to check that we are actually able to construct
+        // a constraint inconsistent with respect to this one.
+        goto found;
+    }
+    j = 0;
+    for (i = 1; i <= dim; ++i) {
+      if (!is_plus_infinity(y.dbm[i][0]))
+        // FIXME: if N is a float or bounded integer type, then
+        // we also need to check that we are actually able to construct
+        // a constraint inconsistent with respect to this one.
+        goto found;
+    }
+    // Then search binary constraints.
+    for (i = 1; i <= dim; ++i) {
+      const DB_Row<N>& y_dbm_i = y.dbm[i];
+      for (j = 1; j <= dim; ++j)
+        if (!is_plus_infinity(y_dbm_i[j]))
+          // FIXME: if N is a float or bounded integer type, then
+          // we also need to check that we are actually able to construct
+          // a constraint inconsistent with respect to this one.
+          goto found;
+    }
+    // Not found: we were not able to build a constraint contradicting
+    // one of the constraints in `y': `x' cannot be enlarged.
+    return false;
+
+  found:
+    // Found: build a new BDS contradicting the constraint found.
+    PPL_ASSERT(i <= dim && j <= dim && (i > 0 || j > 0));
+    BD_Shape<T> res(dim, UNIVERSE);
+    PPL_DIRTY_TEMP(N, tmp);
+    assign_r(tmp, 1, ROUND_UP);
+    add_assign_r(tmp, tmp, y.dbm[i][j], ROUND_UP);
+    PPL_ASSERT(!is_plus_infinity(tmp));
+    // CHECKME: round down is really meant.
+    neg_assign_r(res.dbm[j][i], tmp, ROUND_DOWN);
+    x.m_swap(res);
+    return false;
+  }
+
+  // Here `x' and `y' are not empty and shortest-path closed;
+  // also, `x' does not contain `y'.
+  // Let `target' be the intersection of `x' and `y'.
+  BD_Shape<T> target = x;
+  target.intersection_assign(y);
+  const bool bool_result = !target.is_empty();
+
+  // Compute a reduced dbm for `x' and ...
+  x.shortest_path_reduction_assign();
+  // ... count the non-redundant constraints.
+  dimension_type x_num_non_redundant = (dim+1)*(dim+1);
+  for (dimension_type i = dim + 1; i-- > 0; )
+    x_num_non_redundant -= x.redundancy_dbm[i].count_ones();
+  PPL_ASSERT(x_num_non_redundant > 0);
+
+  // Let `yy' be a copy of `y': we will keep adding to `yy'
+  // the non-redundant constraints of `x',
+  // stopping as soon as `yy' becomes equal to `target'.
+  BD_Shape<T> yy = y;
+
+  // The constraints added to `yy' will be recorded in `res' ...
+  BD_Shape<T> res(dim, UNIVERSE);
+  // ... and we will count them too.
+  dimension_type res_num_non_redundant = 0;
+
+  // Compute leader information for `x'.
+  std::vector<dimension_type> x_leaders;
+  x.compute_leaders(x_leaders);
+
+  // First go through the unary equality constraints.
+  const DB_Row<N>& x_dbm_0 = x.dbm[0];
+  DB_Row<N>& yy_dbm_0 = yy.dbm[0];
+  DB_Row<N>& res_dbm_0 = res.dbm[0];
+  for (dimension_type j = 1; j <= dim; ++j) {
+    // Unary equality constraints are encoded in entries dbm_0j and dbm_j0
+    // provided index j has special variable index 0 as its leader.
+    if (x_leaders[j] != 0)
+      continue;
+    PPL_ASSERT(!is_plus_infinity(x_dbm_0[j]));
+    if (x_dbm_0[j] < yy_dbm_0[j]) {
+      res_dbm_0[j] = x_dbm_0[j];
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy_dbm_0[j] = x_dbm_0[j];
+      yy.reset_shortest_path_closed();
+    }
+    PPL_ASSERT(!is_plus_infinity(x.dbm[j][0]));
+    if (x.dbm[j][0] < yy.dbm[j][0]) {
+      res.dbm[j][0] = x.dbm[j][0];
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy.dbm[j][0] = x.dbm[j][0];
+      yy.reset_shortest_path_closed();
+    }
+    // Restore shortest-path closure, if it was lost.
+    if (!yy.marked_shortest_path_closed()) {
+      Variable var_j(j-1);
+      yy.incremental_shortest_path_closure_assign(var_j);
+      if (target.contains(yy)) {
+        // Target reached: swap `x' and `res' if needed.
+        if (res_num_non_redundant < x_num_non_redundant) {
+          res.reset_shortest_path_closed();
+          x.m_swap(res);
+        }
+        return bool_result;
+      }
+    }
+  }
+
+  // Go through the binary equality constraints.
+  // Note: no need to consider the case i == 1.
+  for (dimension_type i = 2; i <= dim; ++i) {
+    const dimension_type j = x_leaders[i];
+    if (j == i || j == 0)
+      continue;
+    PPL_ASSERT(!is_plus_infinity(x.dbm[i][j]));
+    if (x.dbm[i][j] < yy.dbm[i][j]) {
+      res.dbm[i][j] = x.dbm[i][j];
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy.dbm[i][j] = x.dbm[i][j];
+      yy.reset_shortest_path_closed();
+    }
+    PPL_ASSERT(!is_plus_infinity(x.dbm[j][i]));
+    if (x.dbm[j][i] < yy.dbm[j][i]) {
+      res.dbm[j][i] = x.dbm[j][i];
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy.dbm[j][i] = x.dbm[j][i];
+      yy.reset_shortest_path_closed();
+    }
+    // Restore shortest-path closure, if it was lost.
+    if (!yy.marked_shortest_path_closed()) {
+      Variable var_j(j-1);
+      yy.incremental_shortest_path_closure_assign(var_j);
+      if (target.contains(yy)) {
+        // Target reached: swap `x' and `res' if needed.
+        if (res_num_non_redundant < x_num_non_redundant) {
+          res.reset_shortest_path_closed();
+          x.m_swap(res);
+        }
+        return bool_result;
+      }
+    }
+  }
+
+  // Finally go through the (proper) inequality constraints:
+  // both indices i and j should be leaders.
+  for (dimension_type i = 0; i <= dim; ++i) {
+    if (i != x_leaders[i])
+      continue;
+    const DB_Row<N>& x_dbm_i = x.dbm[i];
+    const Bit_Row& x_redundancy_dbm_i = x.redundancy_dbm[i];
+    DB_Row<N>& yy_dbm_i = yy.dbm[i];
+    DB_Row<N>& res_dbm_i = res.dbm[i];
+    for (dimension_type j = 0; j <= dim; ++j) {
+      if (j != x_leaders[j] || x_redundancy_dbm_i[j])
+        continue;
+      N& yy_dbm_ij = yy_dbm_i[j];
+      const N& x_dbm_ij = x_dbm_i[j];
+      if (x_dbm_ij < yy_dbm_ij) {
+        res_dbm_i[j] = x_dbm_ij;
+        ++res_num_non_redundant;
+        // Tighten context `yy' using the newly added constraint.
+        yy_dbm_ij = x_dbm_ij;
+        yy.reset_shortest_path_closed();
+        PPL_ASSERT(i > 0 || j > 0);
+        Variable var(((i > 0) ? i : j) - 1);
+        yy.incremental_shortest_path_closure_assign(var);
+        if (target.contains(yy)) {
+          // Target reached: swap `x' and `res' if needed.
+          if (res_num_non_redundant < x_num_non_redundant) {
+            res.reset_shortest_path_closed();
+            x.m_swap(res);
+          }
+          return bool_result;
+        }
+      }
+    }
+  }
+  // This point should be unreachable.
+  PPL_UNREACHABLE;
+  return false;
+}
+
+template <typename T>
+void
+BD_Shape<T>::add_space_dimensions_and_embed(const dimension_type m) {
+  // Adding no dimensions is a no-op.
+  if (m == 0)
+    return;
+
+  const dimension_type space_dim = space_dimension();
+  const dimension_type new_space_dim = space_dim + m;
+  const bool was_zero_dim_univ = (!marked_empty() && space_dim == 0);
+
+  // To embed an n-dimension space BDS in a (n+m)-dimension space,
+  // we just add `m' rows and columns in the bounded difference shape,
+  // initialized to PLUS_INFINITY.
+  dbm.grow(new_space_dim + 1);
+
+  // Shortest-path closure is maintained (if it was holding).
+  // TODO: see whether reduction can be (efficiently!) maintained too.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+
+  // If `*this' was the zero-dim space universe BDS,
+  // the we can set the shortest-path closure flag.
+  if (was_zero_dim_univ)
+    set_shortest_path_closed();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::add_space_dimensions_and_project(const dimension_type m) {
+  // Adding no dimensions is a no-op.
+  if (m == 0)
+    return;
+
+  const dimension_type space_dim = space_dimension();
+
+  // If `*this' was zero-dimensional, then we add `m' rows and columns.
+  // If it also was non-empty, then we zero all the added elements
+  // and set the flag for shortest-path closure.
+  if (space_dim == 0) {
+    dbm.grow(m + 1);
+    if (!marked_empty()) {
+      for (dimension_type i = m + 1; i-- > 0; ) {
+        DB_Row<N>& dbm_i = dbm[i];
+        for (dimension_type j = m + 1; j-- > 0; )
+          if (i != j)
+            assign_r(dbm_i[j], 0, ROUND_NOT_NEEDED);
+      }
+      set_shortest_path_closed();
+    }
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // To project an n-dimension space bounded difference shape
+  // in a (n+m)-dimension space, we add `m' rows and columns.
+  // In the first row and column of the matrix we add `zero' from
+  // the (n+1)-th position to the end.
+  const dimension_type new_space_dim = space_dim + m;
+  dbm.grow(new_space_dim + 1);
+
+  // Bottom of the matrix and first row.
+  DB_Row<N>& dbm_0 = dbm[0];
+  for (dimension_type i = space_dim + 1; i <= new_space_dim; ++i) {
+    assign_r(dbm[i][0], 0, ROUND_NOT_NEEDED);
+    assign_r(dbm_0[i], 0, ROUND_NOT_NEEDED);
+  }
+
+  if (marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::remove_space_dimensions(const Variables_Set& vars) {
+  // The removal of no dimensions from any BDS is a no-op.
+  // Note that this case also captures the only legal removal of
+  // space dimensions from a BDS in a 0-dim space.
+  if (vars.empty()) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  const dimension_type old_space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (old_space_dim < min_space_dim)
+    throw_dimension_incompatible("remove_space_dimensions(vs)", min_space_dim);
+
+  // Shortest-path closure is necessary to keep precision.
+  shortest_path_closure_assign();
+
+  // When removing _all_ dimensions from a BDS, we obtain the
+  // zero-dimensional BDS.
+  const dimension_type new_space_dim = old_space_dim - vars.size();
+  if (new_space_dim == 0) {
+    dbm.resize_no_copy(1);
+    if (!marked_empty())
+      // We set the zero_dim_univ flag.
+      set_zero_dim_univ();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Handle the case of an empty BD_Shape.
+  if (marked_empty()) {
+    dbm.resize_no_copy(new_space_dim + 1);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Shortest-path closure is maintained.
+  // TODO: see whether reduction can be (efficiently!) maintained too.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+
+  // For each variable to remove, we fill the corresponding column and
+  // row by shifting respectively left and above those
+  // columns and rows, that will not be removed.
+  Variables_Set::const_iterator vsi = vars.begin();
+  Variables_Set::const_iterator vsi_end = vars.end();
+  dimension_type dst = *vsi + 1;
+  dimension_type src = dst + 1;
+  for (++vsi; vsi != vsi_end; ++vsi) {
+    const dimension_type vsi_next = *vsi + 1;
+    // All other columns and rows are moved respectively to the left
+    // and above.
+    while (src < vsi_next) {
+      using std::swap;
+      swap(dbm[dst], dbm[src]);
+      for (dimension_type i = old_space_dim + 1; i-- > 0; ) {
+        DB_Row<N>& dbm_i = dbm[i];
+        assign_or_swap(dbm_i[dst], dbm_i[src]);
+      }
+      ++dst;
+      ++src;
+    }
+    ++src;
+  }
+
+  // Moving the remaining rows and columns.
+  while (src <= old_space_dim) {
+    using std::swap;
+    swap(dbm[dst], dbm[src]);
+    for (dimension_type i = old_space_dim + 1; i-- > 0; ) {
+      DB_Row<N>& dbm_i = dbm[i];
+      assign_or_swap(dbm_i[dst], dbm_i[src]);
+    }
+    ++src;
+    ++dst;
+  }
+
+  // Update the space dimension.
+  dbm.resize_no_copy(new_space_dim + 1);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Partial_Function>
+void
+BD_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
+  const dimension_type space_dim = space_dimension();
+  // TODO: this implementation is just an executable specification.
+  if (space_dim == 0)
+    return;
+
+  if (pfunc.has_empty_codomain()) {
+    // All dimensions vanish: the BDS becomes zero_dimensional.
+    remove_higher_space_dimensions(0);
+    return;
+  }
+
+  const dimension_type new_space_dim = pfunc.max_in_codomain() + 1;
+  // If we are going to actually reduce the space dimension,
+  // then shortest-path closure is required to keep precision.
+  if (new_space_dim < space_dim)
+    shortest_path_closure_assign();
+
+  // If the BDS is empty, then it is sufficient to adjust the
+  // space dimension of the bounded difference shape.
+  if (marked_empty()) {
+    remove_higher_space_dimensions(new_space_dim);
+    return;
+  }
+
+  // Shortest-path closure is maintained (if it was holding).
+  // TODO: see whether reduction can be (efficiently!) maintained too.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+
+  // We create a new matrix with the new space dimension.
+  DB_Matrix<N> x(new_space_dim+1);
+  // First of all we must map the unary constraints, because
+  // there is the fictitious variable `zero', that can't be mapped
+  // at all.
+  DB_Row<N>& dbm_0 = dbm[0];
+  DB_Row<N>& x_0 = x[0];
+  for (dimension_type j = 1; j <= space_dim; ++j) {
+    dimension_type new_j;
+    if (pfunc.maps(j - 1, new_j)) {
+      assign_or_swap(x_0[new_j + 1], dbm_0[j]);
+      assign_or_swap(x[new_j + 1][0], dbm[j][0]);
+    }
+  }
+  // Now we map the binary constraints, exchanging the indexes.
+  for (dimension_type i = 1; i <= space_dim; ++i) {
+    dimension_type new_i;
+    if (pfunc.maps(i - 1, new_i)) {
+      DB_Row<N>& dbm_i = dbm[i];
+      ++new_i;
+      DB_Row<N>& x_new_i = x[new_i];
+      for (dimension_type j = i+1; j <= space_dim; ++j) {
+        dimension_type new_j;
+        if (pfunc.maps(j - 1, new_j)) {
+          ++new_j;
+          assign_or_swap(x_new_i[new_j], dbm_i[j]);
+          assign_or_swap(x[new_j][new_i], dbm[j][i]);
+        }
+      }
+    }
+  }
+
+  using std::swap;
+  swap(dbm, x);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::intersection_assign(const BD_Shape& y) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("intersection_assign(y)", y);
+
+  // If one of the two bounded difference shapes is empty,
+  // the intersection is empty.
+  if (marked_empty())
+    return;
+  if (y.marked_empty()) {
+    set_empty();
+    return;
+  }
+
+  // If both bounded difference shapes are zero-dimensional,
+  // then at this point they are necessarily non-empty,
+  // so that their intersection is non-empty too.
+  if (space_dim == 0)
+    return;
+
+  // To intersect two bounded difference shapes we compare
+  // the constraints and we choose the less values.
+  bool changed = false;
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; ) {
+      N& dbm_ij = dbm_i[j];
+      const N& y_dbm_ij = y_dbm_i[j];
+      if (dbm_ij > y_dbm_ij) {
+        dbm_ij = y_dbm_ij;
+        changed = true;
+      }
+    }
+  }
+
+  if (changed && marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Iterator>
+void
+BD_Shape<T>::CC76_extrapolation_assign(const BD_Shape& y,
+                                       Iterator first, Iterator last,
+                                       unsigned* tp) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("CC76_extrapolation_assign(y)", y);
+
+  // We assume that `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If both bounded difference shapes are zero-dimensional,
+  // since `*this' contains `y', we simply return `*this'.
+  if (space_dim == 0)
+    return;
+
+  shortest_path_closure_assign();
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  y.shortest_path_closure_assign();
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  // If there are tokens available, work on a temporary copy.
+  if (tp != 0 && *tp > 0) {
+    BD_Shape<T> x_tmp(*this);
+    x_tmp.CC76_extrapolation_assign(y, first, last, 0);
+    // If the widening was not precise, use one of the available tokens.
+    if (!contains(x_tmp))
+      --(*tp);
+    return;
+  }
+
+  // Compare each constraint in `y' to the corresponding one in `*this'.
+  // The constraint in `*this' is kept as is if it is stronger than or
+  // equal to the constraint in `y'; otherwise, the inhomogeneous term
+  // of the constraint in `*this' is further compared with elements taken
+  // from a sorted container (the stop-points, provided by the user), and
+  // is replaced by the first entry, if any, which is greater than or equal
+  // to the inhomogeneous term. If no such entry exists, the constraint
+  // is removed altogether.
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; ) {
+      N& dbm_ij = dbm_i[j];
+      const N& y_dbm_ij = y_dbm_i[j];
+      if (y_dbm_ij < dbm_ij) {
+        Iterator k = std::lower_bound(first, last, dbm_ij);
+        if (k != last) {
+          if (dbm_ij < *k)
+            assign_r(dbm_ij, *k, ROUND_UP);
+        }
+        else
+          assign_r(dbm_ij, PLUS_INFINITY, ROUND_NOT_NEEDED);
+      }
+    }
+  }
+  reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::get_limiting_shape(const Constraint_System& cs,
+                                BD_Shape& limiting_shape) const {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(cs.space_dimension() <= space_dimension());
+
+  shortest_path_closure_assign();
+  bool changed = false;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_c_term);
+  PPL_DIRTY_TEMP(N, d);
+  PPL_DIRTY_TEMP(N, d1);
+  for (Constraint_System::const_iterator cs_i = cs.begin(),
+         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
+    const Constraint& c = *cs_i;
+    dimension_type num_vars = 0;
+    dimension_type i = 0;
+    dimension_type j = 0;
+    // Constraints that are not bounded differences are ignored.
+    if (BD_Shape_Helpers::extract_bounded_difference(c, num_vars, i, j, coeff)) {
+      // Select the cell to be modified for the "<=" part of the constraint,
+      // and set `coeff' to the absolute value of itself.
+      const bool negative = (coeff < 0);
+      const N& x = negative ? dbm[i][j] : dbm[j][i];
+      const N& y = negative ? dbm[j][i] : dbm[i][j];
+      DB_Matrix<N>& ls_dbm = limiting_shape.dbm;
+      if (negative)
+        neg_assign(coeff);
+      // Compute the bound for `x', rounding towards plus infinity.
+      div_round_up(d, c.inhomogeneous_term(), coeff);
+      if (x <= d) {
+        if (c.is_inequality()) {
+          N& ls_x = negative ? ls_dbm[i][j] : ls_dbm[j][i];
+          if (ls_x > d) {
+            ls_x = d;
+            changed = true;
+          }
+        }
+        else {
+          // Compute the bound for `y', rounding towards plus infinity.
+          neg_assign(minus_c_term, c.inhomogeneous_term());
+          div_round_up(d1, minus_c_term, coeff);
+          if (y <= d1) {
+            N& ls_x = negative ? ls_dbm[i][j] : ls_dbm[j][i];
+            N& ls_y = negative ? ls_dbm[j][i] : ls_dbm[i][j];
+            if ((ls_x >= d && ls_y > d1) || (ls_x > d && ls_y >= d1)) {
+              ls_x = d;
+              ls_y = d1;
+              changed = true;
+            }
+          }
+        }
+      }
+    }
+  }
+
+  // In general, adding a constraint does not preserve the shortest-path
+  // closure of the bounded difference shape.
+  if (changed && limiting_shape.marked_shortest_path_closed())
+    limiting_shape.reset_shortest_path_closed();
+}
+
+template <typename T>
+void
+BD_Shape<T>::limited_CC76_extrapolation_assign(const BD_Shape& y,
+                                               const Constraint_System& cs,
+                                               unsigned* tp) {
+  // Dimension-compatibility check.
+  const dimension_type space_dim = space_dimension();
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)",
+                                 y);
+
+  // `cs' must be dimension-compatible with the two systems
+  // of bounded differences.
+  const dimension_type cs_space_dim = cs.space_dimension();
+  if (space_dim < cs_space_dim)
+    throw_invalid_argument("limited_CC76_extrapolation_assign(y, cs)",
+                           "cs is space_dimension incompatible");
+
+  // Strict inequalities not allowed.
+  if (cs.has_strict_inequalities())
+    throw_invalid_argument("limited_CC76_extrapolation_assign(y, cs)",
+                           "cs has strict inequalities");
+
+  // The limited CC76-extrapolation between two systems of bounded
+  // differences in a zero-dimensional space is a system of bounded
+  // differences in a zero-dimensional space, too.
+  if (space_dim == 0)
+    return;
+
+  // We assume that `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  BD_Shape<T> limiting_shape(space_dim, UNIVERSE);
+  get_limiting_shape(cs, limiting_shape);
+  CC76_extrapolation_assign(y, tp);
+  intersection_assign(limiting_shape);
+}
+
+template <typename T>
+void
+BD_Shape<T>::BHMZ05_widening_assign(const BD_Shape& y, unsigned* tp) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("BHMZ05_widening_assign(y)", y);
+
+  // We assume that `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // Compute the affine dimension of `y'.
+  const dimension_type y_affine_dim = y.affine_dimension();
+  // If the affine dimension of `y' is zero, then either `y' is
+  // zero-dimensional, or it is empty, or it is a singleton.
+  // In all cases, due to the inclusion hypothesis, the result is `*this'.
+  if (y_affine_dim == 0)
+    return;
+
+  // If the affine dimension has changed, due to the inclusion hypothesis,
+  // the result is `*this'.
+  const dimension_type x_affine_dim = affine_dimension();
+  PPL_ASSERT(x_affine_dim >= y_affine_dim);
+  if (x_affine_dim != y_affine_dim)
+    return;
+
+  // If there are tokens available, work on a temporary copy.
+  if (tp != 0 && *tp > 0) {
+    BD_Shape<T> x_tmp(*this);
+    x_tmp.BHMZ05_widening_assign(y, 0);
+    // If the widening was not precise, use one of the available tokens.
+    if (!contains(x_tmp))
+      --(*tp);
+    return;
+  }
+
+  // Here no token is available.
+  PPL_ASSERT(marked_shortest_path_closed() && y.marked_shortest_path_closed());
+  // Minimize `y'.
+  y.shortest_path_reduction_assign();
+
+  // Extrapolate unstable bounds, taking into account redundancy in `y'.
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    const Bit_Row& y_redundancy_i = y.redundancy_dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; ) {
+      N& dbm_ij = dbm_i[j];
+      // Note: in the following line the use of `!=' (as opposed to
+      // the use of `<' that would seem -but is not- equivalent) is
+      // intentional.
+      if (y_redundancy_i[j] || y_dbm_i[j] != dbm_ij)
+        assign_r(dbm_ij, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+  // NOTE: this will also reset the shortest-path reduction flag,
+  // even though the dbm is still in reduced form. However, the
+  // current implementation invariant requires that any reduced dbm
+  // is closed too.
+  reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::limited_BHMZ05_extrapolation_assign(const BD_Shape& y,
+                                                 const Constraint_System& cs,
+                                                 unsigned* tp) {
+  // Dimension-compatibility check.
+  const dimension_type space_dim = space_dimension();
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("limited_BHMZ05_extrapolation_assign(y, cs)",
+                                 y);
+  // `cs' must be dimension-compatible with the two systems
+  // of bounded differences.
+  const dimension_type cs_space_dim = cs.space_dimension();
+  if (space_dim < cs_space_dim)
+    throw_invalid_argument("limited_BHMZ05_extrapolation_assign(y, cs)",
+                           "cs is space-dimension incompatible");
+
+  // Strict inequalities are not allowed.
+  if (cs.has_strict_inequalities())
+    throw_invalid_argument("limited_BHMZ05_extrapolation_assign(y, cs)",
+                           "cs has strict inequalities");
+
+  // The limited BHMZ05-extrapolation between two systems of bounded
+  // differences in a zero-dimensional space is a system of bounded
+  // differences in a zero-dimensional space, too.
+  if (space_dim == 0)
+    return;
+
+  // We assume that `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  BD_Shape<T> limiting_shape(space_dim, UNIVERSE);
+  get_limiting_shape(cs, limiting_shape);
+  BHMZ05_widening_assign(y, tp);
+  intersection_assign(limiting_shape);
+}
+
+template <typename T>
+void
+BD_Shape<T>::CC76_narrowing_assign(const BD_Shape& y) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("CC76_narrowing_assign(y)", y);
+
+  // We assume that `*this' is contained in or equal to `y'.
+  PPL_EXPECT_HEAVY(copy_contains(y, *this));
+
+  // If both bounded difference shapes are zero-dimensional,
+  // since `y' contains `*this', we simply return `*this'.
+  if (space_dim == 0)
+    return;
+
+  y.shortest_path_closure_assign();
+  // If `y' is empty, since `y' contains `this', `*this' is empty too.
+  if (y.marked_empty())
+    return;
+  shortest_path_closure_assign();
+  // If `*this' is empty, we return.
+  if (marked_empty())
+    return;
+
+  // Replace each constraint in `*this' by the corresponding constraint
+  // in `y' if the corresponding inhomogeneous terms are both finite.
+  bool changed = false;
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    const DB_Row<N>& y_dbm_i = y.dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; ) {
+      N& dbm_ij = dbm_i[j];
+      const N& y_dbm_ij = y_dbm_i[j];
+      if (!is_plus_infinity(dbm_ij)
+          && !is_plus_infinity(y_dbm_ij)
+          && dbm_ij != y_dbm_ij) {
+        dbm_ij = y_dbm_ij;
+        changed = true;
+      }
+    }
+  }
+  if (changed && marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>
+::deduce_v_minus_u_bounds(const dimension_type v,
+                          const dimension_type last_v,
+                          const Linear_Expression& sc_expr,
+                          Coefficient_traits::const_reference sc_denom,
+                          const N& ub_v) {
+  PPL_ASSERT(sc_denom > 0);
+  PPL_ASSERT(!is_plus_infinity(ub_v));
+  // Deduce constraints of the form `v - u', where `u != v'.
+  // Note: the shortest-path closure is able to deduce the constraint
+  // `v - u <= ub_v - lb_u'. We can be more precise if variable `u'
+  // played an active role in the computation of the upper bound for `v',
+  // i.e., if the corresponding coefficient `q == expr_u/denom' is
+  // greater than zero. In particular:
+  // if `q >= 1',    then `v - u <= ub_v - ub_u';
+  // if `0 < q < 1', then `v - u <= ub_v - (q*ub_u + (1-q)*lb_u)'.
+  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
+  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
+  const DB_Row<N>& dbm_0 = dbm[0];
+  // Speculative allocation of temporaries to be used in the following loop.
+  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
+  PPL_DIRTY_TEMP(mpq_class, q);
+  PPL_DIRTY_TEMP(mpq_class, ub_u);
+  PPL_DIRTY_TEMP(N, up_approx);
+  for (Linear_Expression::const_iterator u = sc_expr.begin(),
+        u_end = sc_expr.lower_bound(Variable(last_v)); u != u_end; ++u) {
+    const dimension_type u_dim = u.variable().space_dimension();
+    if (u_dim == v)
+      continue;
+    const Coefficient& expr_u = *u;
+    if (expr_u < 0)
+      continue;
+    PPL_ASSERT(expr_u > 0);
+    if (expr_u >= sc_denom)
+      // Deducing `v - u <= ub_v - ub_u'.
+      sub_assign_r(dbm[u_dim][v], ub_v, dbm_0[u_dim], ROUND_UP);
+    else {
+      DB_Row<N>& dbm_u = dbm[u_dim];
+      const N& dbm_u0 = dbm_u[0];
+      if (!is_plus_infinity(dbm_u0)) {
+        // Let `ub_u' and `lb_u' be the known upper and lower bound
+        // for `u', respectively. Letting `q = expr_u/sc_denom' be the
+        // rational coefficient of `u' in `sc_expr/sc_denom',
+        // the upper bound for `v - u' is computed as
+        // `ub_v - (q * ub_u + (1-q) * lb_u)', i.e.,
+        // `ub_v + (-lb_u) - q * (ub_u + (-lb_u))'.
+        assign_r(minus_lb_u, dbm_u0, ROUND_NOT_NEEDED);
+        assign_r(q, expr_u, ROUND_NOT_NEEDED);
+        div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
+        assign_r(ub_u, dbm_0[u_dim], ROUND_NOT_NEEDED);
+        // Compute `ub_u - lb_u'.
+        add_assign_r(ub_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
+        // Compute `(-lb_u) - q * (ub_u - lb_u)'.
+        sub_mul_assign_r(minus_lb_u, q, ub_u, ROUND_NOT_NEEDED);
+        assign_r(up_approx, minus_lb_u, ROUND_UP);
+        // Deducing `v - u <= ub_v - (q * ub_u + (1-q) * lb_u)'.
+        add_assign_r(dbm_u[v], ub_v, up_approx, ROUND_UP);
+      }
+    }
+  }
+}
+
+template <typename T>
+void
+BD_Shape<T>
+::deduce_u_minus_v_bounds(const dimension_type v,
+                          const dimension_type last_v,
+                          const Linear_Expression& sc_expr,
+                          Coefficient_traits::const_reference sc_denom,
+                          const N& minus_lb_v) {
+  PPL_ASSERT(sc_denom > 0);
+  PPL_ASSERT(!is_plus_infinity(minus_lb_v));
+  // Deduce constraints of the form `u - v', where `u != v'.
+  // Note: the shortest-path closure is able to deduce the constraint
+  // `u - v <= ub_u - lb_v'. We can be more precise if variable `u'
+  // played an active role in the computation of the lower bound for `v',
+  // i.e., if the corresponding coefficient `q == expr_u/denom' is
+  // greater than zero. In particular:
+  // if `q >= 1',    then `u - v <= lb_u - lb_v';
+  // if `0 < q < 1', then `u - v <= (q*lb_u + (1-q)*ub_u) - lb_v'.
+  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
+  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
+  DB_Row<N>& dbm_0 = dbm[0];
+  DB_Row<N>& dbm_v = dbm[v];
+  // Speculative allocation of temporaries to be used in the following loop.
+  PPL_DIRTY_TEMP(mpq_class, ub_u);
+  PPL_DIRTY_TEMP(mpq_class, q);
+  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
+  PPL_DIRTY_TEMP(N, up_approx);
+  // No need to consider indices greater than `last_v'.
+  for (Linear_Expression::const_iterator u = sc_expr.begin(),
+        u_end = sc_expr.lower_bound(Variable(last_v)); u != u_end; ++u) {
+    const Variable u_var = u.variable();
+    const dimension_type u_dim = u_var.space_dimension();
+    if (u_var.space_dimension() == v)
+      continue;
+    const Coefficient& expr_u = *u;
+    if (expr_u < 0)
+      continue;
+    PPL_ASSERT(expr_u > 0);
+    if (expr_u >= sc_denom)
+      // Deducing `u - v <= lb_u - lb_v',
+      // i.e., `u - v <= (-lb_v) - (-lb_u)'.
+      sub_assign_r(dbm_v[u_dim], minus_lb_v, dbm[u_dim][0], ROUND_UP);
+    else {
+      const N& dbm_0u = dbm_0[u_dim];
+      if (!is_plus_infinity(dbm_0u)) {
+        // Let `ub_u' and `lb_u' be the known upper and lower bound
+        // for `u', respectively. Letting `q = expr_u/sc_denom' be the
+        // rational coefficient of `u' in `sc_expr/sc_denom',
+        // the upper bound for `u - v' is computed as
+        // `(q * lb_u + (1-q) * ub_u) - lb_v', i.e.,
+        // `ub_u - q * (ub_u + (-lb_u)) + minus_lb_v'.
+        assign_r(ub_u, dbm_0u, ROUND_NOT_NEEDED);
+        assign_r(q, expr_u, ROUND_NOT_NEEDED);
+        div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
+        assign_r(minus_lb_u, dbm[u_dim][0], ROUND_NOT_NEEDED);
+        // Compute `ub_u - lb_u'.
+        add_assign_r(minus_lb_u, minus_lb_u, ub_u, ROUND_NOT_NEEDED);
+        // Compute `ub_u - q * (ub_u - lb_u)'.
+        sub_mul_assign_r(ub_u, q, minus_lb_u, ROUND_NOT_NEEDED);
+        assign_r(up_approx, ub_u, ROUND_UP);
+        // Deducing `u - v <= (q*lb_u + (1-q)*ub_u) - lb_v'.
+        add_assign_r(dbm_v[u_dim], up_approx, minus_lb_v, ROUND_UP);
+      }
+    }
+  }
+}
+
+template <typename T>
+void
+BD_Shape<T>::forget_all_dbm_constraints(const dimension_type v) {
+  PPL_ASSERT(0 < v && v <= dbm.num_rows());
+  DB_Row<N>& dbm_v = dbm[v];
+  for (dimension_type i = dbm.num_rows(); i-- > 0; ) {
+    assign_r(dbm_v[i], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    assign_r(dbm[i][v], PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+}
+
+template <typename T>
+void
+BD_Shape<T>::forget_binary_dbm_constraints(const dimension_type v) {
+  PPL_ASSERT(0 < v && v <= dbm.num_rows());
+  DB_Row<N>& dbm_v = dbm[v];
+  for (dimension_type i = dbm.num_rows()-1; i > 0; --i) {
+    assign_r(dbm_v[i], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    assign_r(dbm[i][v], PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+}
+
+template <typename T>
+void
+BD_Shape<T>::unconstrain(const Variable var) {
+  // Dimension-compatibility check.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dimension() < var_space_dim)
+    throw_dimension_incompatible("unconstrain(var)", var_space_dim);
+
+  // Shortest-path closure is necessary to detect emptiness
+  // and all (possibly implicit) constraints.
+  shortest_path_closure_assign();
+
+  // If the shape is empty, this is a no-op.
+  if (marked_empty())
+    return;
+
+  forget_all_dbm_constraints(var_space_dim);
+  // Shortest-path closure is preserved, but not reduction.
+  reset_shortest_path_reduced();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::unconstrain(const Variables_Set& vars) {
+  // The cylindrification with respect to no dimensions is a no-op.
+  // This case captures the only legal cylindrification in a 0-dim space.
+  if (vars.empty())
+    return;
+
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dimension() < min_space_dim)
+    throw_dimension_incompatible("unconstrain(vs)", min_space_dim);
+
+  // Shortest-path closure is necessary to detect emptiness
+  // and all (possibly implicit) constraints.
+  shortest_path_closure_assign();
+
+  // If the shape is empty, this is a no-op.
+  if (marked_empty())
+    return;
+
+  for (Variables_Set::const_iterator vsi = vars.begin(),
+         vsi_end = vars.end(); vsi != vsi_end; ++vsi)
+    forget_all_dbm_constraints(*vsi + 1);
+  // Shortest-path closure is preserved, but not reduction.
+  reset_shortest_path_reduced();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::refine(const Variable var,
+                    const Relation_Symbol relsym,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator) {
+  PPL_ASSERT(denominator != 0);
+  PPL_ASSERT(space_dimension() >= expr.space_dimension());
+  const dimension_type v = var.id() + 1;
+  PPL_ASSERT(v <= space_dimension());
+  PPL_ASSERT(expr.coefficient(var) == 0);
+  PPL_ASSERT(relsym != LESS_THAN && relsym != GREATER_THAN);
+
+  const Coefficient& b = expr.inhomogeneous_term();
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Index of the last non-zero coefficient in `expr', if any.
+  dimension_type w = expr.last_nonzero();
+
+  if (w != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w))
+      ++t;
+  }
+
+  // Since we are only able to record bounded differences, we can
+  // precisely deal with the case of a single variable only if its
+  // coefficient (taking into account the denominator) is 1.
+  // If this is not the case, we fall back to the general case
+  // so as to over-approximate the constraint.
+  if (t == 1 && expr.get(Variable(w - 1)) != denominator)
+    t = 2;
+
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*w + b, where `w != v' and `a == denominator';
+  // - If t == 2, the `expr' is of the general form.
+  const DB_Row<N>& dbm_0 = dbm[0];
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign(minus_denom, denominator);
+
+  if (t == 0) {
+    // Case 1: expr == b.
+    switch (relsym) {
+    case EQUAL:
+      // Add the constraint `var == b/denominator'.
+      add_dbm_constraint(0, v, b, denominator);
+      add_dbm_constraint(v, 0, b, minus_denom);
+      break;
+    case LESS_OR_EQUAL:
+      // Add the constraint `var <= b/denominator'.
+      add_dbm_constraint(0, v, b, denominator);
+      break;
+    case GREATER_OR_EQUAL:
+      // Add the constraint `var >= b/denominator',
+      // i.e., `-var <= -b/denominator',
+      add_dbm_constraint(v, 0, b, minus_denom);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+    return;
+  }
+
+  if (t == 1) {
+    // Case 2: expr == a*w + b, w != v, a == denominator.
+    PPL_ASSERT(expr.get(Variable(w - 1)) == denominator);
+    PPL_DIRTY_TEMP(N, d);
+    switch (relsym) {
+    case EQUAL:
+      // Add the new constraint `v - w <= b/denominator'.
+      div_round_up(d, b, denominator);
+      add_dbm_constraint(w, v, d);
+      // Add the new constraint `v - w >= b/denominator',
+      // i.e., `w - v <= -b/denominator'.
+      div_round_up(d, b, minus_denom);
+      add_dbm_constraint(v, w, d);
+      break;
+    case LESS_OR_EQUAL:
+      // Add the new constraint `v - w <= b/denominator'.
+      div_round_up(d, b, denominator);
+      add_dbm_constraint(w, v, d);
+      break;
+    case GREATER_OR_EQUAL:
+      // Add the new constraint `v - w >= b/denominator',
+      // i.e., `w - v <= -b/denominator'.
+      div_round_up(d, b, minus_denom);
+      add_dbm_constraint(v, w, d);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+    return;
+  }
+
+  // Here t == 2, so that either
+  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2, or
+  // expr == a*w + b, w != v and a != denominator.
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign(minus_b, b);
+  const Coefficient& sc_b = is_sc ? b : minus_b;
+  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -expr;
+  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, sum);
+  // Indices of the variables that are unbounded in `this->dbm'.
+  PPL_UNINITIALIZED(dimension_type, pinf_index);
+  // Number of unbounded variables found.
+  dimension_type pinf_count = 0;
+
+  // Speculative allocation of temporaries that are used in most
+  // of the computational traces starting from this point (also loops).
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+  PPL_DIRTY_TEMP(N, coeff_i);
+
+  switch (relsym) {
+  case EQUAL:
+    {
+      PPL_DIRTY_TEMP(N, neg_sum);
+      // Indices of the variables that are unbounded in `this->dbm'.
+      PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
+      // Number of unbounded variables found.
+      dimension_type neg_pinf_count = 0;
+
+      // Compute an upper approximation for `expr' into `sum',
+      // taking into account the sign of `denominator'.
+
+      // Approximate the inhomogeneous term.
+      assign_r(sum, sc_b, ROUND_UP);
+      assign_r(neg_sum, minus_sc_b, ROUND_UP);
+
+      // Approximate the homogeneous part of `sc_expr'.
+      // Note: indices above `w' can be disregarded, as they all have
+      // a zero coefficient in `expr'.
+      for (Linear_Expression::const_iterator i = sc_expr.begin(),
+            i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+        const dimension_type i_dim = i.variable().space_dimension();
+        const Coefficient& sc_i = *i;
+        const int sign_i = sgn(sc_i);
+        PPL_ASSERT(sign_i != 0);
+        if (sign_i > 0) {
+          assign_r(coeff_i, sc_i, ROUND_UP);
+          // Approximating `sc_expr'.
+          if (pinf_count <= 1) {
+            const N& approx_i = dbm_0[i_dim];
+            if (!is_plus_infinity(approx_i))
+              add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+            else {
+              ++pinf_count;
+              pinf_index = i_dim;
+            }
+          }
+          // Approximating `-sc_expr'.
+          if (neg_pinf_count <= 1) {
+            const N& approx_minus_i = dbm[i_dim][0];
+            if (!is_plus_infinity(approx_minus_i))
+              add_mul_assign_r(neg_sum, coeff_i, approx_minus_i, ROUND_UP);
+            else {
+              ++neg_pinf_count;
+              neg_pinf_index = i_dim;
+            }
+          }
+        }
+        else {
+          PPL_ASSERT(sign_i < 0);
+          neg_assign(minus_sc_i, sc_i);
+          // Note: using temporary named `coeff_i' to store -coeff_i.
+          assign_r(coeff_i, minus_sc_i, ROUND_UP);
+          // Approximating `sc_expr'.
+          if (pinf_count <= 1) {
+            const N& approx_minus_i = dbm[i_dim][0];
+            if (!is_plus_infinity(approx_minus_i))
+              add_mul_assign_r(sum, coeff_i, approx_minus_i, ROUND_UP);
+            else {
+              ++pinf_count;
+              pinf_index = i_dim;
+            }
+          }
+          // Approximating `-sc_expr'.
+          if (neg_pinf_count <= 1) {
+            const N& approx_i = dbm_0[i_dim];
+            if (!is_plus_infinity(approx_i))
+              add_mul_assign_r(neg_sum, coeff_i, approx_i, ROUND_UP);
+            else {
+              ++neg_pinf_count;
+              neg_pinf_index = i_dim;
+            }
+          }
+        }
+      }
+      // Return immediately if no approximation could be computed.
+      if (pinf_count > 1 && neg_pinf_count > 1) {
+        PPL_ASSERT(OK());
+        return;
+      }
+
+      // In the following, shortest-path closure will be definitely lost.
+      reset_shortest_path_closed();
+
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+
+      // Exploit the upper approximation, if possible.
+      if (pinf_count <= 1) {
+        // Compute quotient (if needed).
+        if (down_sc_denom != 1)
+          div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+        // Add the upper bound constraint, if meaningful.
+        if (pinf_count == 0) {
+          // Add the constraint `v <= sum'.
+          dbm[0][v] = sum;
+          // Deduce constraints of the form `v - u', where `u != v'.
+          deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, sum);
+        }
+        else
+          // Here `pinf_count == 1'.
+          if (pinf_index != v
+              && sc_expr.get(Variable(pinf_index - 1)) == sc_denom)
+            // Add the constraint `v - pinf_index <= sum'.
+            dbm[pinf_index][v] = sum;
+      }
+
+      // Exploit the lower approximation, if possible.
+      if (neg_pinf_count <= 1) {
+        // Compute quotient (if needed).
+        if (down_sc_denom != 1)
+          div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
+        // Add the lower bound constraint, if meaningful.
+        if (neg_pinf_count == 0) {
+          // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+          DB_Row<N>& dbm_v = dbm[v];
+          dbm_v[0] = neg_sum;
+          // Deduce constraints of the form `u - v', where `u != v'.
+          deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, neg_sum);
+        }
+        else
+          // Here `neg_pinf_count == 1'.
+          if (neg_pinf_index != v
+              && sc_expr.get(Variable(neg_pinf_index - 1)) == sc_denom)
+            // Add the constraint `v - neg_pinf_index >= -neg_sum',
+            // i.e., `neg_pinf_index - v <= neg_sum'.
+            dbm[v][neg_pinf_index] = neg_sum;
+      }
+    }
+    break;
+
+  case LESS_OR_EQUAL:
+    // Compute an upper approximation for `expr' into `sum',
+    // taking into account the sign of `denominator'.
+
+    // Approximate the inhomogeneous term.
+    assign_r(sum, sc_b, ROUND_UP);
+
+    // Approximate the homogeneous part of `sc_expr'.
+    // Note: indices above `w' can be disregarded, as they all have
+    // a zero coefficient in `expr'.
+    for (Linear_Expression::const_iterator i = sc_expr.begin(),
+          i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+      const Coefficient& sc_i = *i;
+      const dimension_type i_dim = i.variable().space_dimension();
+      const int sign_i = sgn(sc_i);
+      PPL_ASSERT(sign_i != 0);
+      // Choose carefully: we are approximating `sc_expr'.
+      const N& approx_i = (sign_i > 0) ? dbm_0[i_dim] : dbm[i_dim][0];
+      if (is_plus_infinity(approx_i)) {
+        if (++pinf_count > 1)
+          break;
+        pinf_index = i_dim;
+        continue;
+      }
+      if (sign_i > 0)
+        assign_r(coeff_i, sc_i, ROUND_UP);
+      else {
+        neg_assign(minus_sc_i, sc_i);
+        assign_r(coeff_i, minus_sc_i, ROUND_UP);
+      }
+      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+    }
+
+    // Divide by the (sign corrected) denominator (if needed).
+    if (sc_denom != 1) {
+      // Before computing the quotient, the denominator should be
+      // approximated towards zero. Since `sc_denom' is known to be
+      // positive, this amounts to rounding downwards, which is achieved
+      // by rounding upwards `minus_sc - denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+    }
+
+    if (pinf_count == 0) {
+      // Add the constraint `v <= sum'.
+      add_dbm_constraint(0, v, sum);
+      // Deduce constraints of the form `v - u', where `u != v'.
+      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, sum);
+    }
+    else if (pinf_count == 1)
+      if (expr.get(Variable(pinf_index - 1)) == denominator)
+        // Add the constraint `v - pinf_index <= sum'.
+        add_dbm_constraint(pinf_index, v, sum);
+    break;
+
+  case GREATER_OR_EQUAL:
+    // Compute an upper approximation for `-sc_expr' into `sum'.
+    // Note: approximating `-sc_expr' from above and then negating the
+    // result is the same as approximating `sc_expr' from below.
+
+    // Approximate the inhomogeneous term.
+    assign_r(sum, minus_sc_b, ROUND_UP);
+
+    // Approximate the homogeneous part of `-sc_expr'.
+    for (Linear_Expression::const_iterator i = sc_expr.begin(),
+          i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+      const Coefficient& sc_i = *i;
+      const dimension_type i_dim = i.variable().space_dimension();
+      const int sign_i = sgn(sc_i);
+      PPL_ASSERT(sign_i != 0);
+      // Choose carefully: we are approximating `-sc_expr'.
+      const N& approx_i = (sign_i > 0) ? dbm[i_dim][0] : dbm_0[i_dim];
+      if (is_plus_infinity(approx_i)) {
+        if (++pinf_count > 1)
+          break;
+        pinf_index = i_dim;
+        continue;
+      }
+      if (sign_i > 0)
+        assign_r(coeff_i, sc_i, ROUND_UP);
+      else {
+        neg_assign(minus_sc_i, sc_i);
+        assign_r(coeff_i, minus_sc_i, ROUND_UP);
+      }
+      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+    }
+
+    // Divide by the (sign corrected) denominator (if needed).
+    if (sc_denom != 1) {
+      // Before computing the quotient, the denominator should be
+      // approximated towards zero. Since `sc_denom' is known to be positive,
+      // this amounts to rounding downwards, which is achieved by rounding
+      // upwards `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+    }
+
+    if (pinf_count == 0) {
+      // Add the constraint `v >= -sum', i.e., `-v <= sum'.
+      add_dbm_constraint(v, 0, sum);
+      // Deduce constraints of the form `u - v', where `u != v'.
+      deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, sum);
+    }
+    else if (pinf_count == 1)
+      if (pinf_index != v
+          && expr.get(Variable(pinf_index - 1)) == denominator)
+        // Add the constraint `v - pinf_index >= -sum',
+        // i.e., `pinf_index - v <= sum'.
+        add_dbm_constraint(v, pinf_index, sum);
+    break;
+
+  default:
+    // We already dealt with the other cases.
+    PPL_UNREACHABLE;
+    break;
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::affine_image(const Variable var,
+                          const Linear_Expression& expr,
+                          Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("affine_image(v, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("affine_image(v, e, d)", "e", expr);
+
+  // `var' should be one of the dimensions of the shape.
+  const dimension_type v = var.id() + 1;
+  if (v > space_dim)
+    throw_dimension_incompatible("affine_image(v, e, d)", var.id());
+
+  // The image of an empty BDS is empty too.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  const Coefficient& b = expr.inhomogeneous_term();
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Index of the last non-zero coefficient in `expr', if any.
+  dimension_type w = expr.last_nonzero();
+
+  if (w != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w))
+      ++t;
+  }
+
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `expr' is of the general form.
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign(minus_denom, denominator);
+
+  if (t == 0) {
+    // Case 1: expr == b.
+    // Remove all constraints on `var'.
+    forget_all_dbm_constraints(v);
+    // Shortest-path closure is preserved, but not reduction.
+    if (marked_shortest_path_reduced())
+      reset_shortest_path_reduced();
+    // Add the constraint `var == b/denominator'.
+    add_dbm_constraint(0, v, b, denominator);
+    add_dbm_constraint(v, 0, b, minus_denom);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // Value of the one and only non-zero coefficient in `expr'.
+    const Coefficient& a = expr.get(Variable(w - 1));
+    if (a == denominator || a == minus_denom) {
+      // Case 2: expr == a*w + b, with a == +/- denominator.
+      if (w == v) {
+        // `expr' is of the form: a*v + b.
+        if (a == denominator) {
+          if (b == 0)
+            // The transformation is the identity function.
+            return;
+          else {
+            // Translate all the constraints on `var',
+            // adding or subtracting the value `b/denominator'.
+            PPL_DIRTY_TEMP(N, d);
+            div_round_up(d, b, denominator);
+            PPL_DIRTY_TEMP(N, c);
+            div_round_up(c, b, minus_denom);
+            DB_Row<N>& dbm_v = dbm[v];
+            for (dimension_type i = space_dim + 1; i-- > 0; ) {
+              N& dbm_vi = dbm_v[i];
+              add_assign_r(dbm_vi, dbm_vi, c, ROUND_UP);
+              N& dbm_iv = dbm[i][v];
+              add_assign_r(dbm_iv, dbm_iv, d, ROUND_UP);
+            }
+            // Both shortest-path closure and reduction are preserved.
+          }
+        }
+        else {
+          // Here `a == -denominator'.
+          // Remove the binary constraints on `var'.
+          forget_binary_dbm_constraints(v);
+          // Swap the unary constraints on `var'.
+          using std::swap;
+          swap(dbm[v][0], dbm[0][v]);
+          // Shortest-path closure is not preserved.
+          reset_shortest_path_closed();
+          if (b != 0) {
+            // Translate the unary constraints on `var',
+            // adding or subtracting the value `b/denominator'.
+            PPL_DIRTY_TEMP(N, c);
+            div_round_up(c, b, minus_denom);
+            N& dbm_v0 = dbm[v][0];
+            add_assign_r(dbm_v0, dbm_v0, c, ROUND_UP);
+            PPL_DIRTY_TEMP(N, d);
+            div_round_up(d, b, denominator);
+            N& dbm_0v = dbm[0][v];
+            add_assign_r(dbm_0v, dbm_0v, d, ROUND_UP);
+          }
+        }
+      }
+      else {
+        // Here `w != v', so that `expr' is of the form
+        // +/-denominator * w + b.
+        // Remove all constraints on `var'.
+        forget_all_dbm_constraints(v);
+        // Shortest-path closure is preserved, but not reduction.
+        if (marked_shortest_path_reduced())
+          reset_shortest_path_reduced();
+        if (a == denominator) {
+          // Add the new constraint `v - w == b/denominator'.
+          add_dbm_constraint(w, v, b, denominator);
+          add_dbm_constraint(v, w, b, minus_denom);
+        }
+        else {
+          // Here a == -denominator, so that we should be adding
+          // the constraint `v + w == b/denominator'.
+          // Approximate it by computing lower and upper bounds for `w'.
+          const N& dbm_w0 = dbm[w][0];
+          if (!is_plus_infinity(dbm_w0)) {
+            // Add the constraint `v <= b/denominator - lower_w'.
+            PPL_DIRTY_TEMP(N, d);
+            div_round_up(d, b, denominator);
+            add_assign_r(dbm[0][v], d, dbm_w0, ROUND_UP);
+            reset_shortest_path_closed();
+          }
+          const N& dbm_0w = dbm[0][w];
+          if (!is_plus_infinity(dbm_0w)) {
+            // Add the constraint `v >= b/denominator - upper_w'.
+            PPL_DIRTY_TEMP(N, c);
+            div_round_up(c, b, minus_denom);
+            add_assign_r(dbm[v][0], dbm_0w, c, ROUND_UP);
+            reset_shortest_path_closed();
+          }
+        }
+      }
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t == 1, expr == a*w + b, but a <> +/- denominator.
+  // We will remove all the constraints on `var' and add back
+  // constraints providing upper and lower bounds for `var'.
+
+  // Compute upper approximations for `expr' and `-expr'
+  // into `pos_sum' and `neg_sum', respectively, taking into account
+  // the sign of `denominator'.
+  // Note: approximating `-expr' from above and then negating the
+  // result is the same as approximating `expr' from below.
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign(minus_b, b);
+  const Coefficient& sc_b = is_sc ? b : minus_b;
+  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -expr;
+  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, pos_sum);
+  PPL_DIRTY_TEMP(N, neg_sum);
+  // Indices of the variables that are unbounded in `this->dbm'.
+  PPL_UNINITIALIZED(dimension_type, pos_pinf_index);
+  PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
+  // Number of unbounded variables found.
+  dimension_type pos_pinf_count = 0;
+  dimension_type neg_pinf_count = 0;
+
+  // Approximate the inhomogeneous term.
+  assign_r(pos_sum, sc_b, ROUND_UP);
+  assign_r(neg_sum, minus_sc_b, ROUND_UP);
+
+  // Approximate the homogeneous part of `sc_expr'.
+  const DB_Row<N>& dbm_0 = dbm[0];
+  // Speculative allocation of temporaries to be used in the following loop.
+  PPL_DIRTY_TEMP(N, coeff_i);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+
+  // Note: indices above `w' can be disregarded, as they all have
+  // a zero coefficient in `sc_expr'.
+  for (Linear_Expression::const_iterator i = sc_expr.begin(),
+        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+    const Coefficient& sc_i = *i;
+    const dimension_type i_dim = i.variable().space_dimension();
+    const int sign_i = sgn(sc_i);
+    if (sign_i > 0) {
+      assign_r(coeff_i, sc_i, ROUND_UP);
+      // Approximating `sc_expr'.
+      if (pos_pinf_count <= 1) {
+        const N& up_approx_i = dbm_0[i_dim];
+        if (!is_plus_infinity(up_approx_i))
+          add_mul_assign_r(pos_sum, coeff_i, up_approx_i, ROUND_UP);
+        else {
+          ++pos_pinf_count;
+          pos_pinf_index = i_dim;
+        }
+      }
+      // Approximating `-sc_expr'.
+      if (neg_pinf_count <= 1) {
+        const N& up_approx_minus_i = dbm[i_dim][0];
+        if (!is_plus_infinity(up_approx_minus_i))
+          add_mul_assign_r(neg_sum, coeff_i, up_approx_minus_i, ROUND_UP);
+        else {
+          ++neg_pinf_count;
+          neg_pinf_index = i_dim;
+        }
+      }
+    }
+    else {
+      PPL_ASSERT(sign_i < 0);
+      neg_assign(minus_sc_i, sc_i);
+      // Note: using temporary named `coeff_i' to store -coeff_i.
+      assign_r(coeff_i, minus_sc_i, ROUND_UP);
+      // Approximating `sc_expr'.
+      if (pos_pinf_count <= 1) {
+        const N& up_approx_minus_i = dbm[i_dim][0];
+        if (!is_plus_infinity(up_approx_minus_i))
+          add_mul_assign_r(pos_sum, coeff_i, up_approx_minus_i, ROUND_UP);
+        else {
+          ++pos_pinf_count;
+          pos_pinf_index = i_dim;
+        }
+      }
+      // Approximating `-sc_expr'.
+      if (neg_pinf_count <= 1) {
+        const N& up_approx_i = dbm_0[i_dim];
+        if (!is_plus_infinity(up_approx_i))
+          add_mul_assign_r(neg_sum, coeff_i, up_approx_i, ROUND_UP);
+        else {
+          ++neg_pinf_count;
+          neg_pinf_index = i_dim;
+        }
+      }
+    }
+  }
+
+  // Remove all constraints on 'v'.
+  forget_all_dbm_constraints(v);
+  // Shortest-path closure is maintained, but not reduction.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+  // Return immediately if no approximation could be computed.
+  if (pos_pinf_count > 1 && neg_pinf_count > 1) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // In the following, shortest-path closure will be definitely lost.
+  reset_shortest_path_closed();
+
+  // Exploit the upper approximation, if possible.
+  if (pos_pinf_count <= 1) {
+    // Compute quotient (if needed).
+    if (sc_denom != 1) {
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(pos_sum, pos_sum, down_sc_denom, ROUND_UP);
+    }
+    // Add the upper bound constraint, if meaningful.
+    if (pos_pinf_count == 0) {
+      // Add the constraint `v <= pos_sum'.
+      dbm[0][v] = pos_sum;
+      // Deduce constraints of the form `v - u', where `u != v'.
+      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, pos_sum);
+    }
+    else
+      // Here `pos_pinf_count == 1'.
+      if (pos_pinf_index != v
+          && sc_expr.get(Variable(pos_pinf_index - 1)) == sc_denom)
+        // Add the constraint `v - pos_pinf_index <= pos_sum'.
+        dbm[pos_pinf_index][v] = pos_sum;
+  }
+
+  // Exploit the lower approximation, if possible.
+  if (neg_pinf_count <= 1) {
+    // Compute quotient (if needed).
+    if (sc_denom != 1) {
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
+    }
+    // Add the lower bound constraint, if meaningful.
+    if (neg_pinf_count == 0) {
+      // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+      DB_Row<N>& dbm_v = dbm[v];
+      dbm_v[0] = neg_sum;
+      // Deduce constraints of the form `u - v', where `u != v'.
+      deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, neg_sum);
+    }
+    else
+      // Here `neg_pinf_count == 1'.
+      if (neg_pinf_index != v
+          && sc_expr.get(Variable(neg_pinf_index - 1)) == sc_denom)
+        // Add the constraint `v - neg_pinf_index >= -neg_sum',
+        // i.e., `neg_pinf_index - v <= neg_sum'.
+        dbm[v][neg_pinf_index] = neg_sum;
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+BD_Shape<T>::affine_form_image(const Variable var,
+                    const Linear_Form< Interval<T, Interval_Info> >& lf) {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                    "BD_Shape<T>::affine_form_image(Variable, Linear_Form):"
+                    " T not a floating point type.");
+
+  // Dimension-compatibility checks.
+  // The dimension of `lf' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type lf_space_dim = lf.space_dimension();
+  if (space_dim < lf_space_dim)
+    throw_dimension_incompatible("affine_form_image(var_id, l)", "l", lf);
+
+  // `var' should be one of the dimensions of the shape.
+  const dimension_type var_id = var.id() + 1;
+  if (space_dim < var_id)
+    throw_dimension_incompatible("affine_form_image(var_id, l)", var.id());
+
+  // The image of an empty BDS is empty too.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lf': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Index of the last non-zero coefficient in `lf', if any.
+  dimension_type w_id = 0;
+  // Get information about the number of non-zero coefficients in `lf'.
+  for (dimension_type i = lf_space_dim; i-- > 0; )
+    if (lf.coefficient(Variable(i)) != 0) {
+      if (t++ == 1)
+        break;
+      else
+        w_id = i + 1;
+    }
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+  const FP_Interval_Type& b = lf.inhomogeneous_term();
+
+  // Now we know the form of `lf':
+  // - If t == 0, then lf == b, with `b' a constant;
+  // - If t == 1, then lf == a*w + b, where `w' can be `v' or another
+  //   variable;
+  // - If t == 2, the linear form 'lf' is of the general form.
+
+  if (t == 0) {
+    inhomogeneous_affine_form_image(var_id, b);
+    PPL_ASSERT(OK());
+    return;
+  }
+  else if (t == 1) {
+    const FP_Interval_Type& w_coeff = lf.coefficient(Variable(w_id - 1));
+    if (w_coeff == 1 || w_coeff == -1) {
+      one_variable_affine_form_image(var_id, b, w_coeff, w_id, space_dim);
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+  two_variables_affine_form_image(var_id, lf, space_dim);
+  PPL_ASSERT(OK());
+}
+
+// Case 1: var = b, where b = [-b_mlb, b_ub]
+template <typename T>
+template <typename Interval_Info>
+void
+BD_Shape<T>
+::inhomogeneous_affine_form_image(const dimension_type& var_id,
+                                  const Interval<T, Interval_Info>& b) {
+  PPL_DIRTY_TEMP(N, b_ub);
+  assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
+  PPL_DIRTY_TEMP(N, b_mlb);
+  neg_assign_r(b_mlb, b.lower(), ROUND_NOT_NEEDED);
+
+  // Remove all constraints on `var'.
+  forget_all_dbm_constraints(var_id);
+  // Shortest-path closure is preserved, but not reduction.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+    // Add the constraint `var >= lb && var <= ub'.
+    add_dbm_constraint(0, var_id, b_ub);
+    add_dbm_constraint(var_id, 0, b_mlb);
+    return;
+}
+
+// case 2: var = (+/-1) * w + [-b_mlb, b_ub], where `w' can be `var'
+// or another variable.
+template <typename T>
+template <typename Interval_Info>
+void BD_Shape<T>
+::one_variable_affine_form_image(const dimension_type& var_id,
+                            const Interval<T, Interval_Info>& b,
+                            const Interval<T, Interval_Info>& w_coeff,
+                            const dimension_type& w_id,
+                            const dimension_type& space_dim) {
+
+  PPL_DIRTY_TEMP(N, b_ub);
+  assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
+  PPL_DIRTY_TEMP(N, b_mlb);
+  neg_assign_r(b_mlb, b.lower(), ROUND_NOT_NEEDED);
+
+  // True if `w_coeff' is in [1, 1].
+  bool is_w_coeff_one = (w_coeff == 1);
+
+  if (w_id == var_id) {
+    // True if `b' is in [b_mlb, b_ub] and that is [0, 0].
+    bool is_b_zero = (b_mlb == 0 && b_ub == 0);
+    // Here `lf' is of the form: [+/-1, +/-1] * v + b.
+    if (is_w_coeff_one) {
+      if (is_b_zero)
+        // The transformation is the identity function.
+        return;
+      else {
+        // Translate all the constraints on `var' by adding the value
+        // `b_ub' or subtracting the value `b_mlb'.
+        DB_Row<N>& dbm_v = dbm[var_id];
+        for (dimension_type i = space_dim + 1; i-- > 0; ) {
+          N& dbm_vi = dbm_v[i];
+          add_assign_r(dbm_vi, dbm_vi, b_mlb, ROUND_UP);
+          N& dbm_iv = dbm[i][var_id];
+          add_assign_r(dbm_iv, dbm_iv, b_ub, ROUND_UP);
+        }
+        // Both shortest-path closure and reduction are preserved.
+      }
+    }
+    else {
+      // Here `w_coeff = [-1, -1].
+      // Remove the binary constraints on `var'.
+      forget_binary_dbm_constraints(var_id);
+      using std::swap;
+      swap(dbm[var_id][0], dbm[0][var_id]);
+      // Shortest-path closure is not preserved.
+      reset_shortest_path_closed();
+      if (!is_b_zero) {
+        // Translate the unary constraints on `var' by adding the value
+        // `b_ub' or subtracting the value `b_mlb'.
+        N& dbm_v0 = dbm[var_id][0];
+        add_assign_r(dbm_v0, dbm_v0, b_mlb, ROUND_UP);
+        N& dbm_0v = dbm[0][var_id];
+        add_assign_r(dbm_0v, dbm_0v, b_ub, ROUND_UP);
+      }
+    }
+  }
+  else {
+    // Here `w != var', so that `lf' is of the form
+    // [+/-1, +/-1] * w + b.
+    // Remove all constraints on `var'.
+    forget_all_dbm_constraints(var_id);
+    // Shortest-path closure is preserved, but not reduction.
+    if (marked_shortest_path_reduced())
+      reset_shortest_path_reduced();
+    if (is_w_coeff_one) {
+      // Add the new constraints `var - w >= b_mlb'
+      // `and var - w <= b_ub'.
+      add_dbm_constraint(w_id, var_id, b_ub);
+      add_dbm_constraint(var_id, w_id, b_mlb);
+    }
+    else {
+      // We have to add the constraint `v + w == b', over-approximating it
+      // by computing lower and upper bounds for `w'.
+      const N& mlb_w = dbm[w_id][0];
+      if (!is_plus_infinity(mlb_w)) {
+        // Add the constraint `v <= ub - lb_w'.
+        add_assign_r(dbm[0][var_id], b_ub, mlb_w, ROUND_UP);
+        reset_shortest_path_closed();
+      }
+      const N& ub_w = dbm[0][w_id];
+      if (!is_plus_infinity(ub_w)) {
+        // Add the constraint `v >= lb - ub_w'.
+        add_assign_r(dbm[var_id][0], ub_w, b_mlb, ROUND_UP);
+        reset_shortest_path_closed();
+      }
+    }
+  }
+  return;
+}
+
+// General case.
+// Either t == 2, so that
+// lf == i_1*x_1 + i_2*x_2 + ... + i_n*x_n + b, where n >= 2,
+// or t == 1, lf == i*w + b, but i <> [+/-1, +/-1].
+template <typename T>
+template <typename Interval_Info>
+void BD_Shape<T>
+::two_variables_affine_form_image(const dimension_type& var_id,
+           const Linear_Form< Interval<T, Interval_Info> >& lf,
+                             const dimension_type& space_dim) {
+  // Shortest-path closure is maintained, but not reduction.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+
+  reset_shortest_path_closed();
+
+  Linear_Form< Interval<T, Interval_Info> > minus_lf(lf);
+  minus_lf.negate();
+
+  // Declare temporaries outside the loop.
+  PPL_DIRTY_TEMP(N, upper_bound);
+
+  // Update binary constraints on var FIRST.
+  for (dimension_type curr_var = 1; curr_var < var_id; ++curr_var) {
+    Variable current(curr_var - 1);
+    linear_form_upper_bound(lf - current, upper_bound);
+    assign_r(dbm[curr_var][var_id], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(minus_lf + current, upper_bound);
+    assign_r(dbm[var_id][curr_var], upper_bound, ROUND_NOT_NEEDED);
+  }
+  for (dimension_type curr_var = var_id + 1; curr_var <= space_dim;
+                                                      ++curr_var) {
+    Variable current(curr_var - 1);
+    linear_form_upper_bound(lf - current, upper_bound);
+    assign_r(dbm[curr_var][var_id], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(minus_lf + current, upper_bound);
+    assign_r(dbm[var_id][curr_var], upper_bound, ROUND_NOT_NEEDED);
+  }
+  // Finally, update unary constraints on var.
+  PPL_DIRTY_TEMP(N, lf_ub);
+  linear_form_upper_bound(lf, lf_ub);
+  PPL_DIRTY_TEMP(N, minus_lf_ub);
+  linear_form_upper_bound(minus_lf, minus_lf_ub);
+  assign_r(dbm[0][var_id], lf_ub, ROUND_NOT_NEEDED);
+  assign_r(dbm[var_id][0], minus_lf_ub, ROUND_NOT_NEEDED);
+}
+
+template <typename T>
+template <typename Interval_Info>
+void BD_Shape<T>::refine_with_linear_form_inequality(
+                   const Linear_Form< Interval<T, Interval_Info> >& left,
+                   const Linear_Form< Interval<T, Interval_Info> >& right) {
+    // Check that T is a floating point type.
+    PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                    "Octagonal_Shape<T>::refine_with_linear_form_inequality:"
+                    " T not a floating point type.");
+
+    //We assume that the analyzer will not try to apply an unreachable filter.
+    PPL_ASSERT(!marked_empty());
+
+    // Dimension-compatibility checks.
+    // The dimensions of `left' and `right' should not be greater than the
+    // dimension of `*this'.
+    const dimension_type left_space_dim = left.space_dimension();
+    const dimension_type space_dim = space_dimension();
+    if (space_dim < left_space_dim)
+      throw_dimension_incompatible(
+          "refine_with_linear_form_inequality(left, right)", "left", left);
+
+    const dimension_type right_space_dim = right.space_dimension();
+    if (space_dim < right_space_dim)
+      throw_dimension_incompatible(
+          "refine_with_linear_form_inequality(left, right)", "right", right);
+
+  // Number of non-zero coefficients in `left': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type left_t = 0;
+  // Variable-index of the last non-zero coefficient in `left', if any.
+  dimension_type left_w_id = 0;
+  // Number of non-zero coefficients in `right': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type right_t = 0;
+  // Variable-index of the last non-zero coefficient in `right', if any.
+  dimension_type right_w_id = 0;
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+  // Get information about the number of non-zero coefficients in `left'.
+  for (dimension_type i = left_space_dim; i-- > 0; )
+    if (left.coefficient(Variable(i)) != 0) {
+      if (left_t++ == 1)
+        break;
+      else
+        left_w_id = i;
+    }
+
+  // Get information about the number of non-zero coefficients in `right'.
+  for (dimension_type i = right_space_dim; i-- > 0; )
+    if (right.coefficient(Variable(i)) != 0) {
+      if (right_t++ == 1)
+        break;
+      else
+        right_w_id = i;
+    }
+
+  const FP_Interval_Type& left_w_coeff =
+          left.coefficient(Variable(left_w_id));
+  const FP_Interval_Type& right_w_coeff =
+          right.coefficient(Variable(right_w_id));
+
+  if (left_t == 0) {
+    if (right_t == 0) {
+      // The constraint involves constants only. Ignore it: it is up to
+      // the analyzer to handle it.
+      PPL_ASSERT(OK());
+      return;
+    }
+    else if (right_w_coeff == 1 || right_w_coeff == -1) {
+      left_inhomogeneous_refine(right_t, right_w_id, left, right);
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+  else if (left_t == 1) {
+    if (left_w_coeff == 1 || left_w_coeff == -1) {
+      if (right_t == 0 || (right_w_coeff == 1 || right_w_coeff == -1)) {
+        left_one_var_refine(left_w_id, right_t, right_w_id, left, right);
+        PPL_ASSERT(OK());
+        return;
+      }
+    }
+  }
+
+  // General case.
+  general_refine(left_w_id, right_w_id, left, right);
+  PPL_ASSERT(OK());
+} // end of refine_with_linear_form_inequality
+
+template <typename T>
+template <typename U>
+void
+BD_Shape<T>
+::export_interval_constraints(U& dest) const {
+  const dimension_type space_dim = space_dimension();
+  if (space_dim > dest.space_dimension())
+    throw std::invalid_argument(
+               "BD_Shape<T>::export_interval_constraints");
+
+  // Expose all the interval constraints.
+  shortest_path_closure_assign();
+
+  if (marked_empty()) {
+    dest.set_empty();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  PPL_DIRTY_TEMP(N, tmp);
+  const DB_Row<N>& dbm_0 = dbm[0];
+  for (dimension_type i = space_dim; i-- > 0; ) {
+    // Set the upper bound.
+    const N& u = dbm_0[i+1];
+    if (!is_plus_infinity(u))
+      if (!dest.restrict_upper(i, u.raw_value()))
+        return;
+
+    // Set the lower bound.
+    const N& negated_l = dbm[i+1][0];
+    if (!is_plus_infinity(negated_l)) {
+      neg_assign_r(tmp, negated_l, ROUND_DOWN);
+      if (!dest.restrict_lower(i, tmp.raw_value()))
+        return;
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+BD_Shape<T>::left_inhomogeneous_refine(const dimension_type& right_t,
+                                       const dimension_type& right_w_id,
+                    const Linear_Form< Interval<T, Interval_Info> >& left,
+                    const Linear_Form< Interval<T, Interval_Info> >& right) {
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+  if (right_t == 1) {
+    // The constraint has the form [a-, a+] <= [b-, b+] + [c-, c+] * x.
+    // Reduce it to the constraint +/-x <= b+ - a- if [c-, c+] = +/-[1, 1].
+      const FP_Interval_Type& right_w_coeff =
+                              right.coefficient(Variable(right_w_id));
+      if (right_w_coeff == 1) {
+        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_b = right.inhomogeneous_term();
+        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
+                     ROUND_UP);
+        add_dbm_constraint(right_w_id+1, 0, b_plus_minus_a_minus);
+        return;
+      }
+
+      if (right_w_coeff == -1) {
+        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_b = right.inhomogeneous_term();
+        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
+                     ROUND_UP);
+        add_dbm_constraint(0, right_w_id+1, b_plus_minus_a_minus);
+        return;
+      }
+    }
+} // end of left_inhomogeneous_refine
+
+
+template <typename T>
+template <typename Interval_Info>
+void
+BD_Shape<T>
+::left_one_var_refine(const dimension_type& left_w_id,
+                      const dimension_type& right_t,
+                      const dimension_type& right_w_id,
+                const Linear_Form< Interval<T, Interval_Info> >& left,
+                const Linear_Form< Interval<T, Interval_Info> >& right) {
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+    if (right_t == 0) {
+      // The constraint has the form [b-, b+] + [c-, c+] * x <= [a-, a+]
+      // Reduce it to the constraint +/-x <= a+ - b- if [c-, c+] = +/-[1, 1].
+      const FP_Interval_Type& left_w_coeff =
+        left.coefficient(Variable(left_w_id));
+
+      if (left_w_coeff == 1) {
+        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+        const FP_Interval_Type& left_b = left.inhomogeneous_term();
+        const FP_Interval_Type& right_a = right.inhomogeneous_term();
+        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                     ROUND_UP);
+        add_dbm_constraint(0, left_w_id+1, a_plus_minus_b_minus);
+        return;
+      }
+
+      if (left_w_coeff == -1) {
+        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+        const FP_Interval_Type& left_b = left.inhomogeneous_term();
+        const FP_Interval_Type& right_a = right.inhomogeneous_term();
+        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                     ROUND_UP);
+        add_dbm_constraint(left_w_id+1, 0, a_plus_minus_b_minus);
+        return;
+      }
+    }
+    else if (right_t == 1) {
+      // The constraint has the form
+      // [a-, a+] + [b-, b+] * x <= [c-, c+] + [d-, d+] * y.
+      // Reduce it to the constraint +/-x +/-y <= c+ - a-
+      // if [b-, b+] = +/-[1, 1] and [d-, d+] = +/-[1, 1].
+      const FP_Interval_Type& left_w_coeff =
+                              left.coefficient(Variable(left_w_id));
+
+      const FP_Interval_Type& right_w_coeff =
+                              right.coefficient(Variable(right_w_id));
+
+      bool is_left_coeff_one = (left_w_coeff == 1);
+      bool is_left_coeff_minus_one = (left_w_coeff == -1);
+      bool is_right_coeff_one = (right_w_coeff == 1);
+      bool is_right_coeff_minus_one = (right_w_coeff == -1);
+      if (left_w_id == right_w_id) {
+        if ((is_left_coeff_one && is_right_coeff_one)
+            ||
+            (is_left_coeff_minus_one && is_right_coeff_minus_one)) {
+          // Here we have an identity or a constants-only constraint.
+          return;
+        }
+        if (is_left_coeff_one && is_right_coeff_minus_one) {
+          // We fall back to a previous case.
+          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+          const FP_Interval_Type& left_b = left.inhomogeneous_term();
+          const FP_Interval_Type& right_a = right.inhomogeneous_term();
+          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                       ROUND_UP);
+          div_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
+                            ROUND_UP);
+          add_dbm_constraint(0, left_w_id + 1, a_plus_minus_b_minus);
+          return;
+        }
+        if (is_left_coeff_minus_one && is_right_coeff_one) {
+          // We fall back to a previous case.
+          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+          const FP_Interval_Type& left_b = left.inhomogeneous_term();
+          const FP_Interval_Type& right_a = right.inhomogeneous_term();
+          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                       ROUND_UP);
+          div_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
+                            ROUND_UP);
+          add_dbm_constraint(right_w_id + 1, 0, a_plus_minus_b_minus);
+          return;
+        }
+      }
+      else if (is_left_coeff_minus_one && is_right_coeff_one) {
+        // over-approximate (if is it possible) the inequality
+        // -B + [b1, b2] <= A + [a1, a2] by adding the constraints
+        // -B <= upper_bound(A) + (a2 - b1) and
+        // -A <= upper_bound(B) + (a2 - b1)
+        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+        const FP_Interval_Type& left_b = left.inhomogeneous_term();
+        const FP_Interval_Type& right_a = right.inhomogeneous_term();
+        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                       ROUND_UP);
+        PPL_DIRTY_TEMP(N, ub);
+        ub = dbm[0][right_w_id + 1];
+        if (!is_plus_infinity(ub)) {
+          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
+          add_dbm_constraint(left_w_id + 1, 0, ub);
+        }
+        ub = dbm[0][left_w_id + 1];
+        if (!is_plus_infinity(ub)) {
+          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
+          add_dbm_constraint(right_w_id + 1, 0, ub);
+        }
+        return;
+      }
+      if (is_left_coeff_one && is_right_coeff_minus_one) {
+        // over-approximate (if is it possible) the inequality
+        // B + [b1, b2] <= -A + [a1, a2] by adding the constraints
+        // B <= upper_bound(-A) + (a2 - b1) and
+        // A <= upper_bound(-B) + (a2 - b1)
+        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+        const FP_Interval_Type& left_b = left.inhomogeneous_term();
+        const FP_Interval_Type& right_a = right.inhomogeneous_term();
+        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                       ROUND_UP);
+        PPL_DIRTY_TEMP(N, ub);
+        ub = dbm[right_w_id + 1][0];
+        if (!is_plus_infinity(ub)) {
+          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
+          add_dbm_constraint(0, left_w_id + 1, ub);
+        }
+        ub = dbm[left_w_id + 1][0];
+        if (!is_plus_infinity(ub)) {
+          add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
+          add_dbm_constraint(0, right_w_id + 1, ub);
+        }
+            return;
+      }
+      if (is_left_coeff_one && is_right_coeff_one) {
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_c = right.inhomogeneous_term();
+        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
+                     ROUND_UP);
+        add_dbm_constraint(right_w_id+1, left_w_id+1, c_plus_minus_a_minus);
+        return;
+      }
+      if (is_left_coeff_minus_one && is_right_coeff_minus_one) {
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_c = right.inhomogeneous_term();
+        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
+                     ROUND_UP);
+        add_dbm_constraint(left_w_id+1, right_w_id+1, c_plus_minus_a_minus);
+        return;
+      }
+    }
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+BD_Shape<T>
+::general_refine(const dimension_type& left_w_id,
+                 const dimension_type& right_w_id,
+                 const Linear_Form< Interval<T, Interval_Info> >& left,
+                 const Linear_Form< Interval<T, Interval_Info> >& right) {
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+  Linear_Form<FP_Interval_Type> right_minus_left(right);
+  right_minus_left -= left;
+
+  // Declare temporaries outside of the loop.
+  PPL_DIRTY_TEMP(N, low_coeff);
+  PPL_DIRTY_TEMP(N, high_coeff);
+  PPL_DIRTY_TEMP(N, upper_bound);
+
+  dimension_type max_w_id = std::max(left_w_id, right_w_id);
+
+  for (dimension_type first_v = 0; first_v < max_w_id; ++first_v) {
+    for (dimension_type second_v = first_v+1;
+         second_v <= max_w_id; ++second_v) {
+      const FP_Interval_Type& lfv_coefficient =
+        left.coefficient(Variable(first_v));
+      const FP_Interval_Type& lsv_coefficient =
+        left.coefficient(Variable(second_v));
+      const FP_Interval_Type& rfv_coefficient =
+        right.coefficient(Variable(first_v));
+      const FP_Interval_Type& rsv_coefficient =
+        right.coefficient(Variable(second_v));
+      // We update the constraints only when both variables appear in at
+      // least one argument.
+      bool do_update = false;
+      assign_r(low_coeff, lfv_coefficient.lower(), ROUND_NOT_NEEDED);
+      assign_r(high_coeff, lfv_coefficient.upper(), ROUND_NOT_NEEDED);
+      if (low_coeff != 0 || high_coeff != 0) {
+        assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
+        assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
+        if (low_coeff != 0 || high_coeff != 0)
+          do_update = true;
+        else {
+          assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
+          assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
+          if (low_coeff != 0 || high_coeff != 0)
+            do_update = true;
+        }
+      }
+      else {
+        assign_r(low_coeff, rfv_coefficient.lower(), ROUND_NOT_NEEDED);
+        assign_r(high_coeff, rfv_coefficient.upper(), ROUND_NOT_NEEDED);
+        if (low_coeff != 0 || high_coeff != 0) {
+          assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
+          assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
+          if (low_coeff != 0 || high_coeff != 0)
+            do_update = true;
+          else {
+            assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
+            assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
+            if (low_coeff != 0 || high_coeff != 0)
+              do_update = true;
+          }
+        }
+      }
+
+      if (do_update) {
+        Variable first(first_v);
+        Variable second(second_v);
+        dimension_type n_first_var = first_v +1 ;
+        dimension_type n_second_var = second_v + 1;
+        linear_form_upper_bound(right_minus_left - first + second,
+                                upper_bound);
+        add_dbm_constraint(n_first_var, n_second_var, upper_bound);
+        linear_form_upper_bound(right_minus_left + first - second,
+                                upper_bound);
+        add_dbm_constraint(n_second_var, n_first_var, upper_bound);
+      }
+    }
+  }
+
+  // Finally, update the unary constraints.
+  for (dimension_type v = 0; v < max_w_id; ++v) {
+    const FP_Interval_Type& lv_coefficient =
+      left.coefficient(Variable(v));
+    const FP_Interval_Type& rv_coefficient =
+      right.coefficient(Variable(v));
+    // We update the constraints only if v appears in at least one of the
+    // two arguments.
+    bool do_update = false;
+    assign_r(low_coeff, lv_coefficient.lower(), ROUND_NOT_NEEDED);
+    assign_r(high_coeff, lv_coefficient.upper(), ROUND_NOT_NEEDED);
+    if (low_coeff != 0 || high_coeff != 0)
+      do_update = true;
+    else {
+      assign_r(low_coeff, rv_coefficient.lower(), ROUND_NOT_NEEDED);
+      assign_r(high_coeff, rv_coefficient.upper(), ROUND_NOT_NEEDED);
+      if (low_coeff != 0 || high_coeff != 0)
+        do_update = true;
+    }
+
+    if (do_update) {
+      Variable var(v);
+      dimension_type n_var = v + 1;
+      linear_form_upper_bound(right_minus_left + var, upper_bound);
+      add_dbm_constraint(0, n_var, upper_bound);
+      linear_form_upper_bound(right_minus_left - var, upper_bound);
+      add_dbm_constraint(n_var, 0, upper_bound);
+    }
+  }
+
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+BD_Shape<T>::
+linear_form_upper_bound(const Linear_Form< Interval<T, Interval_Info> >& lf,
+                        N& result) const {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                     "BD_Shape<T>::linear_form_upper_bound:"
+                     " T not a floating point type.");
+
+  const dimension_type lf_space_dimension = lf.space_dimension();
+  PPL_ASSERT(lf_space_dimension <= space_dimension());
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+  PPL_DIRTY_TEMP(N, curr_lb);
+  PPL_DIRTY_TEMP(N, curr_ub);
+  PPL_DIRTY_TEMP(N, curr_var_ub);
+  PPL_DIRTY_TEMP(N, curr_minus_var_ub);
+
+  PPL_DIRTY_TEMP(N, first_comparison_term);
+  PPL_DIRTY_TEMP(N, second_comparison_term);
+
+  PPL_DIRTY_TEMP(N, negator);
+
+  assign_r(result, lf.inhomogeneous_term().upper(), ROUND_NOT_NEEDED);
+
+  for (dimension_type curr_var = 0, n_var = 0; curr_var < lf_space_dimension;
+       ++curr_var) {
+    n_var = curr_var + 1;
+    const FP_Interval_Type&
+      curr_coefficient = lf.coefficient(Variable(curr_var));
+    assign_r(curr_lb, curr_coefficient.lower(), ROUND_NOT_NEEDED);
+    assign_r(curr_ub, curr_coefficient.upper(), ROUND_NOT_NEEDED);
+    if (curr_lb != 0 || curr_ub != 0) {
+      assign_r(curr_var_ub, dbm[0][n_var], ROUND_NOT_NEEDED);
+      neg_assign_r(curr_minus_var_ub, dbm[n_var][0], ROUND_NOT_NEEDED);
+      // Optimize the most commons cases: curr = +/-[1, 1].
+      if (curr_lb == 1 && curr_ub == 1) {
+        add_assign_r(result, result, std::max(curr_var_ub, curr_minus_var_ub),
+                     ROUND_UP);
+      }
+      else if (curr_lb == -1 && curr_ub == -1) {
+        neg_assign_r(negator, std::min(curr_var_ub, curr_minus_var_ub),
+                     ROUND_NOT_NEEDED);
+        add_assign_r(result, result, negator, ROUND_UP);
+      }
+      else {
+        // Next addend will be the maximum of four quantities.
+        assign_r(first_comparison_term, 0, ROUND_NOT_NEEDED);
+        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+        add_mul_assign_r(first_comparison_term, curr_var_ub, curr_ub,
+                         ROUND_UP);
+        add_mul_assign_r(second_comparison_term, curr_var_ub, curr_lb,
+                         ROUND_UP);
+        assign_r(first_comparison_term, std::max(first_comparison_term,
+                                                 second_comparison_term),
+                 ROUND_NOT_NEEDED);
+        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_ub,
+                         ROUND_UP);
+        assign_r(first_comparison_term, std::max(first_comparison_term,
+                                                 second_comparison_term),
+                 ROUND_NOT_NEEDED);
+        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_lb,
+                         ROUND_UP);
+        assign_r(first_comparison_term, std::max(first_comparison_term,
+                                                 second_comparison_term),
+                 ROUND_NOT_NEEDED);
+
+        add_assign_r(result, result, first_comparison_term, ROUND_UP);
+      }
+    }
+  }
+}
+
+template <typename T>
+void
+BD_Shape<T>::affine_preimage(const Variable var,
+                             const Linear_Expression& expr,
+                             Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("affine_preimage(v, e, d)", "e", expr);
+
+  // `var' should be one of the dimensions of
+  // the bounded difference shapes.
+  const dimension_type v = var.id() + 1;
+  if (v > space_dim)
+    throw_dimension_incompatible("affine_preimage(v, e, d)", var.id());
+
+  // The image of an empty BDS is empty too.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  const Coefficient& b = expr.inhomogeneous_term();
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Index of the last non-zero coefficient in `expr', if any.
+  dimension_type j = expr.last_nonzero();
+
+  if (j != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, j))
+      ++t;
+  }
+
+  // Now we know the form of `expr':
+  // - If t == 0, then expr = b, with `b' a constant;
+  // - If t == 1, then expr = a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t > 1, the `expr' is of the general form.
+  if (t == 0) {
+    // Case 1: expr = n; remove all constraints on `var'.
+    forget_all_dbm_constraints(v);
+    // Shortest-path closure is preserved, but not reduction.
+    if (marked_shortest_path_reduced())
+      reset_shortest_path_reduced();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // Value of the one and only non-zero coefficient in `expr'.
+    const Coefficient& a = expr.get(Variable(j - 1));
+    if (a == denominator || a == -denominator) {
+      // Case 2: expr = a*w + b, with a = +/- denominator.
+      if (j == var.space_dimension())
+        // Apply affine_image() on the inverse of this transformation.
+        affine_image(var, denominator*var - b, a);
+      else {
+        // `expr == a*w + b', where `w != v'.
+        // Remove all constraints on `var'.
+        forget_all_dbm_constraints(v);
+        // Shortest-path closure is preserved, but not reduction.
+        if (marked_shortest_path_reduced())
+          reset_shortest_path_reduced();
+        PPL_ASSERT(OK());
+      }
+      return;
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr = a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t = 1, expr = a*w + b, but a <> +/- denominator.
+  const Coefficient& expr_v = expr.coefficient(var);
+  if (expr_v != 0) {
+    // The transformation is invertible.
+    Linear_Expression inverse((expr_v + denominator)*var);
+    inverse -= expr;
+    affine_image(var, inverse, expr_v);
+  }
+  else {
+    // Transformation not invertible: all constraints on `var' are lost.
+    forget_all_dbm_constraints(v);
+    // Shortest-path closure is preserved, but not reduction.
+    if (marked_shortest_path_reduced())
+      reset_shortest_path_reduced();
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>
+::bounded_affine_image(const Variable var,
+                       const Linear_Expression& lb_expr,
+                       const Linear_Expression& ub_expr,
+                       Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // `var' should be one of the dimensions of the BD_Shape.
+  const dimension_type bds_space_dim = space_dimension();
+  const dimension_type v = var.id() + 1;
+  if (v > bds_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "v", var);
+  // The dimension of `lb_expr' and `ub_expr' should not be
+  // greater than the dimension of `*this'.
+  const dimension_type lb_space_dim = lb_expr.space_dimension();
+  if (bds_space_dim < lb_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "lb", lb_expr);
+  const dimension_type ub_space_dim = ub_expr.space_dimension();
+  if (bds_space_dim < ub_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "ub", ub_expr);
+
+  // Any image of an empty BDS is empty.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  const Coefficient& b = ub_expr.inhomogeneous_term();
+  // Number of non-zero coefficients in `ub_expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Index of the last non-zero coefficient in `ub_expr', if any.
+  dimension_type w = ub_expr.last_nonzero();
+
+  if (w != 0) {
+    ++t;
+    if (!ub_expr.all_zeroes(1, w))
+      ++t;
+  }
+
+  // Now we know the form of `ub_expr':
+  // - If t == 0, then ub_expr == b, with `b' a constant;
+  // - If t == 1, then ub_expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `ub_expr' is of the general form.
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign(minus_denom, denominator);
+
+  if (t == 0) {
+    // Case 1: ub_expr == b.
+    generalized_affine_image(var,
+                             GREATER_OR_EQUAL,
+                             lb_expr,
+                             denominator);
+    // Add the constraint `var <= b/denominator'.
+    add_dbm_constraint(0, v, b, denominator);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // Value of the one and only non-zero coefficient in `ub_expr'.
+    const Coefficient& a = ub_expr.get(Variable(w - 1));
+    if (a == denominator || a == minus_denom) {
+      // Case 2: expr == a*w + b, with a == +/- denominator.
+      if (w == v) {
+        // Here `var' occurs in `ub_expr'.
+        // To ease the computation, we add an additional dimension.
+        const Variable new_var(bds_space_dim);
+        add_space_dimensions_and_embed(1);
+        // Constrain the new dimension to be equal to `ub_expr'.
+        affine_image(new_var, ub_expr, denominator);
+        // NOTE: enforce shortest-path closure for precision.
+        shortest_path_closure_assign();
+        PPL_ASSERT(!marked_empty());
+        // Apply the affine lower bound.
+        generalized_affine_image(var,
+                                 GREATER_OR_EQUAL,
+                                 lb_expr,
+                                 denominator);
+        // Now apply the affine upper bound, as recorded in `new_var'.
+        add_constraint(var <= new_var);
+        // Remove the temporarily added dimension.
+        remove_higher_space_dimensions(bds_space_dim);
+        return;
+      }
+      else {
+        // Here `w != v', so that `expr' is of the form
+        // +/-denominator * w + b.
+        // Apply the affine lower bound.
+        generalized_affine_image(var,
+                                 GREATER_OR_EQUAL,
+                                 lb_expr,
+                                 denominator);
+        if (a == denominator) {
+          // Add the new constraint `v - w == b/denominator'.
+          add_dbm_constraint(w, v, b, denominator);
+        }
+        else {
+          // Here a == -denominator, so that we should be adding
+          // the constraint `v + w == b/denominator'.
+          // Approximate it by computing lower and upper bounds for `w'.
+          const N& dbm_w0 = dbm[w][0];
+          if (!is_plus_infinity(dbm_w0)) {
+            // Add the constraint `v <= b/denominator - lower_w'.
+            PPL_DIRTY_TEMP(N, d);
+            div_round_up(d, b, denominator);
+            add_assign_r(dbm[0][v], d, dbm_w0, ROUND_UP);
+            reset_shortest_path_closed();
+          }
+        }
+        PPL_ASSERT(OK());
+        return;
+      }
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // ub_expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t == 1, ub_expr == a*w + b, but a <> +/- denominator.
+  // We will remove all the constraints on `var' and add back
+  // constraints providing upper and lower bounds for `var'.
+
+  // Compute upper approximations for `ub_expr' into `pos_sum'
+  // taking into account the sign of `denominator'.
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign(minus_b, b);
+  const Coefficient& sc_b = is_sc ? b : minus_b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -ub_expr;
+  const Linear_Expression& sc_expr = is_sc ? ub_expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, pos_sum);
+  // Index of the variable that are unbounded in `this->dbm'.
+  PPL_UNINITIALIZED(dimension_type, pos_pinf_index);
+  // Number of unbounded variables found.
+  dimension_type pos_pinf_count = 0;
+
+  // Approximate the inhomogeneous term.
+  assign_r(pos_sum, sc_b, ROUND_UP);
+
+  // Approximate the homogeneous part of `sc_expr'.
+  const DB_Row<N>& dbm_0 = dbm[0];
+  // Speculative allocation of temporaries to be used in the following loop.
+  PPL_DIRTY_TEMP(N, coeff_i);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+  // Note: indices above `w' can be disregarded, as they all have
+  // a zero coefficient in `sc_expr'.
+  for (Linear_Expression::const_iterator i = sc_expr.begin(),
+        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+    const Coefficient& sc_i = *i;
+    const dimension_type i_dim = i.variable().space_dimension();
+    const int sign_i = sgn(sc_i);
+    if (sign_i > 0) {
+      assign_r(coeff_i, sc_i, ROUND_UP);
+      // Approximating `sc_expr'.
+      if (pos_pinf_count <= 1) {
+        const N& up_approx_i = dbm_0[i_dim];
+        if (!is_plus_infinity(up_approx_i))
+          add_mul_assign_r(pos_sum, coeff_i, up_approx_i, ROUND_UP);
+        else {
+          ++pos_pinf_count;
+          pos_pinf_index = i_dim;
+        }
+      }
+    }
+    else {
+      PPL_ASSERT(sign_i < 0);
+      neg_assign(minus_sc_i, sc_i);
+      // Note: using temporary named `coeff_i' to store -coeff_i.
+      assign_r(coeff_i, minus_sc_i, ROUND_UP);
+      // Approximating `sc_expr'.
+      if (pos_pinf_count <= 1) {
+        const N& up_approx_minus_i = dbm[i_dim][0];
+        if (!is_plus_infinity(up_approx_minus_i))
+          add_mul_assign_r(pos_sum, coeff_i, up_approx_minus_i, ROUND_UP);
+        else {
+          ++pos_pinf_count;
+          pos_pinf_index = i_dim;
+        }
+      }
+    }
+  }
+  // Apply the affine lower bound.
+  generalized_affine_image(var,
+                           GREATER_OR_EQUAL,
+                           lb_expr,
+                           denominator);
+  // Return immediately if no approximation could be computed.
+  if (pos_pinf_count > 1) {
+    return;
+  }
+
+  // In the following, shortest-path closure will be definitely lost.
+  reset_shortest_path_closed();
+
+  // Exploit the upper approximation, if possible.
+  if (pos_pinf_count <= 1) {
+    // Compute quotient (if needed).
+    if (sc_denom != 1) {
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(pos_sum, pos_sum, down_sc_denom, ROUND_UP);
+    }
+    // Add the upper bound constraint, if meaningful.
+    if (pos_pinf_count == 0) {
+      // Add the constraint `v <= pos_sum'.
+      dbm[0][v] = pos_sum;
+      // Deduce constraints of the form `v - u', where `u != v'.
+      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, pos_sum);
+    }
+    else
+      // Here `pos_pinf_count == 1'.
+      if (pos_pinf_index != v
+          && sc_expr.get(Variable(pos_pinf_index - 1)) == sc_denom)
+        // Add the constraint `v - pos_pinf_index <= pos_sum'.
+        dbm[pos_pinf_index][v] = pos_sum;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>
+::bounded_affine_preimage(const Variable var,
+                          const Linear_Expression& lb_expr,
+                          const Linear_Expression& ub_expr,
+                          Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // `var' should be one of the dimensions of the BD_Shape.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type v = var.id() + 1;
+  if (v > space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "v", var);
+  // The dimension of `lb_expr' and `ub_expr' should not be
+  // greater than the dimension of `*this'.
+  const dimension_type lb_space_dim = lb_expr.space_dimension();
+  if (space_dim < lb_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "lb", lb_expr);
+  const dimension_type ub_space_dim = ub_expr.space_dimension();
+  if (space_dim < ub_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "ub", ub_expr);
+
+  // Any preimage of an empty BDS is empty.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  if (ub_expr.coefficient(var) == 0) {
+    refine(var, LESS_OR_EQUAL, ub_expr, denominator);
+    generalized_affine_preimage(var, GREATER_OR_EQUAL,
+                                lb_expr, denominator);
+    return;
+  }
+  if (lb_expr.coefficient(var) == 0) {
+    refine(var, GREATER_OR_EQUAL, lb_expr, denominator);
+    generalized_affine_preimage(var, LESS_OR_EQUAL,
+                                ub_expr, denominator);
+    return;
+  }
+
+  const Coefficient& lb_expr_v = lb_expr.coefficient(var);
+  // Here `var' occurs in `lb_expr' and `ub_expr'.
+  // To ease the computation, we add an additional dimension.
+  const Variable new_var(space_dim);
+  add_space_dimensions_and_embed(1);
+  const Linear_Expression lb_inverse
+    = lb_expr - (lb_expr_v + denominator)*var;
+  PPL_DIRTY_TEMP_COEFFICIENT(lb_inverse_denom);
+  neg_assign(lb_inverse_denom, lb_expr_v);
+  affine_image(new_var, lb_inverse, lb_inverse_denom);
+  shortest_path_closure_assign();
+  PPL_ASSERT(!marked_empty());
+  generalized_affine_preimage(var, LESS_OR_EQUAL,
+                              ub_expr, denominator);
+  if (sgn(denominator) == sgn(lb_inverse_denom))
+    add_constraint(var >= new_var);
+  else
+    add_constraint(var <= new_var);
+  // Remove the temporarily added dimension.
+  remove_higher_space_dimensions(space_dim);
+}
+
+template <typename T>
+void
+BD_Shape<T>::generalized_affine_image(const Variable var,
+                                      const Relation_Symbol relsym,
+                                      const Linear_Expression& expr,
+                                      Coefficient_traits::const_reference
+                                      denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
+                                 "e", expr);
+
+  // `var' should be one of the dimensions of the BDS.
+  const dimension_type v = var.id() + 1;
+  if (v > space_dim)
+    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
+                                 var.id());
+
+  // The relation symbol cannot be a strict relation symbol.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
+                           "r is the disequality relation symbol");
+
+  if (relsym == EQUAL) {
+    // The relation symbol is "=":
+    // this is just an affine image computation.
+    affine_image(var, expr, denominator);
+    return;
+  }
+
+  // The image of an empty BDS is empty too.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  const Coefficient& b = expr.inhomogeneous_term();
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Index of the last non-zero coefficient in `expr', if any.
+  dimension_type w = expr.last_nonzero();
+
+  if (w != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w))
+      ++t;
+  }
+
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `expr' is of the general form.
+  DB_Row<N>& dbm_0 = dbm[0];
+  DB_Row<N>& dbm_v = dbm[v];
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign(minus_denom, denominator);
+
+  if (t == 0) {
+    // Case 1: expr == b.
+    // Remove all constraints on `var'.
+    forget_all_dbm_constraints(v);
+    // Both shortest-path closure and reduction are lost.
+    reset_shortest_path_closed();
+    switch (relsym) {
+    case LESS_OR_EQUAL:
+      // Add the constraint `var <= b/denominator'.
+      add_dbm_constraint(0, v, b, denominator);
+      break;
+    case GREATER_OR_EQUAL:
+      // Add the constraint `var >= b/denominator',
+      // i.e., `-var <= -b/denominator',
+      add_dbm_constraint(v, 0, b, minus_denom);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // Value of the one and only non-zero coefficient in `expr'.
+    const Coefficient& a = expr.get(Variable(w - 1));
+    if (a == denominator || a == minus_denom) {
+      // Case 2: expr == a*w + b, with a == +/- denominator.
+      PPL_DIRTY_TEMP(N, d);
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        div_round_up(d, b, denominator);
+        if (w == v) {
+          // `expr' is of the form: a*v + b.
+          // Shortest-path closure and reduction are not preserved.
+          reset_shortest_path_closed();
+          if (a == denominator) {
+            // Translate each constraint `v - w <= dbm_wv'
+            // into the constraint `v - w <= dbm_wv + b/denominator';
+            // forget each constraint `w - v <= dbm_vw'.
+            for (dimension_type i = space_dim + 1; i-- > 0; ) {
+              N& dbm_iv = dbm[i][v];
+              add_assign_r(dbm_iv, dbm_iv, d, ROUND_UP);
+              assign_r(dbm_v[i], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            }
+          }
+          else {
+            // Here `a == -denominator'.
+            // Translate the constraint `0 - v <= dbm_v0'
+            // into the constraint `0 - v <= dbm_v0 + b/denominator'.
+            N& dbm_v0 = dbm_v[0];
+            add_assign_r(dbm_0[v], dbm_v0, d, ROUND_UP);
+            // Forget all the other constraints on `v'.
+            assign_r(dbm_v0, PLUS_INFINITY, ROUND_NOT_NEEDED);
+            forget_binary_dbm_constraints(v);
+          }
+        }
+        else {
+          // Here `w != v', so that `expr' is of the form
+          // +/-denominator * w + b, with `w != v'.
+          // Remove all constraints on `v'.
+          forget_all_dbm_constraints(v);
+          // Shortest-path closure is preserved, but not reduction.
+          if (marked_shortest_path_reduced())
+            reset_shortest_path_reduced();
+          if (a == denominator)
+            // Add the new constraint `v - w <= b/denominator'.
+            add_dbm_constraint(w, v, d);
+          else {
+            // Here a == -denominator, so that we should be adding
+            // the constraint `v <= b/denominator - w'.
+            // Approximate it by computing a lower bound for `w'.
+            const N& dbm_w0 = dbm[w][0];
+            if (!is_plus_infinity(dbm_w0)) {
+              // Add the constraint `v <= b/denominator - lb_w'.
+              add_assign_r(dbm_0[v], d, dbm_w0, ROUND_UP);
+              // Shortest-path closure is not preserved.
+              reset_shortest_path_closed();
+            }
+          }
+        }
+        break;
+
+      case GREATER_OR_EQUAL:
+        div_round_up(d, b, minus_denom);
+        if (w == v) {
+          // `expr' is of the form: a*w + b.
+          // Shortest-path closure and reduction are not preserved.
+          reset_shortest_path_closed();
+          if (a == denominator) {
+            // Translate each constraint `w - v <= dbm_vw'
+            // into the constraint `w - v <= dbm_vw - b/denominator';
+            // forget each constraint `v - w <= dbm_wv'.
+            for (dimension_type i = space_dim + 1; i-- > 0; ) {
+              N& dbm_vi = dbm_v[i];
+              add_assign_r(dbm_vi, dbm_vi, d, ROUND_UP);
+              assign_r(dbm[i][v], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            }
+          }
+          else {
+            // Here `a == -denominator'.
+            // Translate the constraint `0 - v <= dbm_v0'
+            // into the constraint `0 - v <= dbm_0v - b/denominator'.
+            N& dbm_0v = dbm_0[v];
+            add_assign_r(dbm_v[0], dbm_0v, d, ROUND_UP);
+            // Forget all the other constraints on `v'.
+            assign_r(dbm_0v, PLUS_INFINITY, ROUND_NOT_NEEDED);
+            forget_binary_dbm_constraints(v);
+          }
+        }
+        else {
+          // Here `w != v', so that `expr' is of the form
+          // +/-denominator * w + b, with `w != v'.
+          // Remove all constraints on `v'.
+          forget_all_dbm_constraints(v);
+          // Shortest-path closure is preserved, but not reduction.
+          if (marked_shortest_path_reduced())
+            reset_shortest_path_reduced();
+          if (a == denominator)
+            // Add the new constraint `v - w >= b/denominator',
+            // i.e., `w - v <= -b/denominator'.
+            add_dbm_constraint(v, w, d);
+          else {
+            // Here a == -denominator, so that we should be adding
+            // the constraint `v >= -w + b/denominator',
+            // i.e., `-v <= w - b/denominator'.
+            // Approximate it by computing an upper bound for `w'.
+            const N& dbm_0w = dbm_0[w];
+            if (!is_plus_infinity(dbm_0w)) {
+              // Add the constraint `-v <= ub_w - b/denominator'.
+              add_assign_r(dbm_v[0], dbm_0w, d, ROUND_UP);
+              // Shortest-path closure is not preserved.
+              reset_shortest_path_closed();
+            }
+          }
+        }
+        break;
+
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t == 1, expr == a*w + b, but a <> +/- denominator.
+  // We will remove all the constraints on `v' and add back
+  // a constraint providing an upper or a lower bound for `v'
+  // (depending on `relsym').
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign(minus_b, b);
+  const Coefficient& sc_b = is_sc ? b : minus_b;
+  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -expr;
+  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, sum);
+  // Index of variable that is unbounded in `this->dbm'.
+  PPL_UNINITIALIZED(dimension_type, pinf_index);
+  // Number of unbounded variables found.
+  dimension_type pinf_count = 0;
+
+  // Speculative allocation of temporaries to be used in the following loops.
+  PPL_DIRTY_TEMP(N, coeff_i);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+
+  switch (relsym) {
+  case LESS_OR_EQUAL:
+    // Compute an upper approximation for `sc_expr' into `sum'.
+
+    // Approximate the inhomogeneous term.
+    assign_r(sum, sc_b, ROUND_UP);
+    // Approximate the homogeneous part of `sc_expr'.
+    // Note: indices above `w' can be disregarded, as they all have
+    // a zero coefficient in `sc_expr'.
+    PPL_ASSERT(w != 0);
+    for (Linear_Expression::const_iterator i = sc_expr.begin(),
+        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+      const Coefficient& sc_i = *i;
+      const dimension_type i_dim = i.variable().space_dimension();
+      const int sign_i = sgn(sc_i);
+      PPL_ASSERT(sign_i != 0);
+      // Choose carefully: we are approximating `sc_expr'.
+      const N& approx_i = (sign_i > 0) ? dbm_0[i_dim] : dbm[i_dim][0];
+      if (is_plus_infinity(approx_i)) {
+        if (++pinf_count > 1)
+          break;
+        pinf_index = i_dim;
+        continue;
+      }
+      if (sign_i > 0)
+        assign_r(coeff_i, sc_i, ROUND_UP);
+      else {
+        neg_assign(minus_sc_i, sc_i);
+        assign_r(coeff_i, minus_sc_i, ROUND_UP);
+      }
+      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+    }
+
+    // Remove all constraints on `v'.
+    forget_all_dbm_constraints(v);
+    // Shortest-path closure is preserved, but not reduction.
+    if (marked_shortest_path_reduced())
+      reset_shortest_path_reduced();
+    // Return immediately if no approximation could be computed.
+    if (pinf_count > 1) {
+      PPL_ASSERT(OK());
+      return;
+    }
+
+    // Divide by the (sign corrected) denominator (if needed).
+    if (sc_denom != 1) {
+      // Before computing the quotient, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+    }
+
+    if (pinf_count == 0) {
+      // Add the constraint `v <= sum'.
+      add_dbm_constraint(0, v, sum);
+      // Deduce constraints of the form `v - u', where `u != v'.
+      deduce_v_minus_u_bounds(v, w, sc_expr, sc_denom, sum);
+    }
+    else if (pinf_count == 1)
+      if (pinf_index != v && expr.get(Variable(pinf_index - 1)) == denominator)
+        // Add the constraint `v - pinf_index <= sum'.
+        add_dbm_constraint(pinf_index, v, sum);
+    break;
+
+  case GREATER_OR_EQUAL:
+    // Compute an upper approximation for `-sc_expr' into `sum'.
+    // Note: approximating `-sc_expr' from above and then negating the
+    // result is the same as approximating `sc_expr' from below.
+
+    // Approximate the inhomogeneous term.
+    assign_r(sum, minus_sc_b, ROUND_UP);
+    // Approximate the homogeneous part of `-sc_expr'.
+    for (Linear_Expression::const_iterator i = sc_expr.begin(),
+        i_end = sc_expr.lower_bound(Variable(w)); i != i_end; ++i) {
+      const Coefficient& sc_i = *i;
+      const int sign_i = sgn(sc_i);
+      PPL_ASSERT(sign_i != 0);
+      const dimension_type i_dim = i.variable().space_dimension();
+      // Choose carefully: we are approximating `-sc_expr'.
+      const N& approx_i = (sign_i > 0) ? dbm[i_dim][0] : dbm_0[i_dim];
+      if (is_plus_infinity(approx_i)) {
+        if (++pinf_count > 1)
+          break;
+        pinf_index = i_dim;
+        continue;
+      }
+      if (sign_i > 0)
+        assign_r(coeff_i, sc_i, ROUND_UP);
+      else {
+        neg_assign(minus_sc_i, sc_i);
+        assign_r(coeff_i, minus_sc_i, ROUND_UP);
+      }
+      add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+    }
+
+    // Remove all constraints on `var'.
+    forget_all_dbm_constraints(v);
+    // Shortest-path closure is preserved, but not reduction.
+    if (marked_shortest_path_reduced())
+      reset_shortest_path_reduced();
+    // Return immediately if no approximation could be computed.
+    if (pinf_count > 1) {
+      PPL_ASSERT(OK());
+      return;
+    }
+
+    // Divide by the (sign corrected) denominator (if needed).
+    if (sc_denom != 1) {
+      // Before computing the quotient, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+    }
+
+    if (pinf_count == 0) {
+      // Add the constraint `v >= -sum', i.e., `-v <= sum'.
+      add_dbm_constraint(v, 0, sum);
+      // Deduce constraints of the form `u - v', where `u != v'.
+      deduce_u_minus_v_bounds(v, w, sc_expr, sc_denom, sum);
+    }
+    else if (pinf_count == 1)
+      if (pinf_index != v && expr.get(Variable(pinf_index - 1)) == denominator)
+        // Add the constraint `v - pinf_index >= -sum',
+        // i.e., `pinf_index - v <= sum'.
+        add_dbm_constraint(v, pinf_index, sum);
+    break;
+
+  default:
+    // We already dealt with the other cases.
+    PPL_UNREACHABLE;
+    break;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::generalized_affine_image(const Linear_Expression& lhs,
+                                      const Relation_Symbol relsym,
+                                      const Linear_Expression& rhs) {
+  // Dimension-compatibility checks.
+  // The dimension of `lhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type lhs_space_dim = lhs.space_dimension();
+  if (space_dim < lhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e1", lhs);
+
+  // The dimension of `rhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type rhs_space_dim = rhs.space_dimension();
+  if (space_dim < rhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e2", rhs);
+
+  // Strict relation symbols are not admitted for BDSs.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
+                           "r is the disequality relation symbol");
+
+  // The image of an empty BDS is empty.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lhs': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t_lhs = 0;
+  // Index of the last non-zero coefficient in `lhs', if any.
+  dimension_type j_lhs = lhs.last_nonzero();
+
+  if (j_lhs != 0) {
+    ++t_lhs;
+    if (!lhs.all_zeroes(1, j_lhs))
+      ++t_lhs;
+    --j_lhs;
+  }
+
+  const Coefficient& b_lhs = lhs.inhomogeneous_term();
+
+  if (t_lhs == 0) {
+    // `lhs' is a constant.
+    // In principle, it is sufficient to add the constraint `lhs relsym rhs'.
+    // Note that this constraint is a bounded difference if `t_rhs <= 1'
+    // or `t_rhs > 1' and `rhs == a*v - a*w + b_rhs'. If `rhs' is of a
+    // more general form, it will be simply ignored.
+    // TODO: if it is not a bounded difference, should we compute
+    // approximations for this constraint?
+    switch (relsym) {
+    case LESS_OR_EQUAL:
+      refine_no_check(lhs <= rhs);
+      break;
+    case EQUAL:
+      refine_no_check(lhs == rhs);
+      break;
+    case GREATER_OR_EQUAL:
+      refine_no_check(lhs >= rhs);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+  }
+  else if (t_lhs == 1) {
+    // Here `lhs == a_lhs * v + b_lhs'.
+    // Independently from the form of `rhs', we can exploit the
+    // method computing generalized affine images for a single variable.
+    Variable v(j_lhs);
+    // Compute a sign-corrected relation symbol.
+    const Coefficient& denom = lhs.coefficient(v);
+    Relation_Symbol new_relsym = relsym;
+    if (denom < 0) {
+      if (relsym == LESS_OR_EQUAL)
+        new_relsym = GREATER_OR_EQUAL;
+      else if (relsym == GREATER_OR_EQUAL)
+        new_relsym = LESS_OR_EQUAL;
+    }
+    Linear_Expression expr = rhs - b_lhs;
+    generalized_affine_image(v, new_relsym, expr, denom);
+  }
+  else {
+    // Here `lhs' is of the general form, having at least two variables.
+    // Compute the set of variables occurring in `lhs'.
+    std::vector<Variable> lhs_vars;
+    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
+          i != i_end; ++i)
+      lhs_vars.push_back(i.variable());
+
+    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
+    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
+      // `lhs' and `rhs' variables are disjoint.
+      // Existentially quantify all variables in the lhs.
+      for (dimension_type i = lhs_vars.size(); i-- > 0; )
+        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
+      // Constrain the left hand side expression so that it is related to
+      // the right hand side expression as dictated by `relsym'.
+      // TODO: if the following constraint is NOT a bounded difference,
+      // it will be simply ignored. Should we compute approximations for it?
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(lhs <= rhs);
+        break;
+      case EQUAL:
+        refine_no_check(lhs == rhs);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(lhs >= rhs);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+    }
+    else {
+      // Some variables in `lhs' also occur in `rhs'.
+
+#if 1 // Simplified computation (see the TODO note below).
+
+      for (dimension_type i = lhs_vars.size(); i-- > 0; )
+        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
+
+#else // Currently unnecessarily complex computation.
+
+      // More accurate computation that is worth doing only if
+      // the following TODO note is accurately dealt with.
+
+      // To ease the computation, we add an additional dimension.
+      const Variable new_var(space_dim);
+      add_space_dimensions_and_embed(1);
+      // Constrain the new dimension to be equal to `rhs'.
+      // NOTE: calling affine_image() instead of refine_no_check()
+      // ensures some approximation is tried even when the constraint
+      // is not a bounded difference.
+      affine_image(new_var, rhs);
+      // Existentially quantify all variables in the lhs.
+      // NOTE: enforce shortest-path closure for precision.
+      shortest_path_closure_assign();
+      PPL_ASSERT(!marked_empty());
+      for (dimension_type i = lhs_vars.size(); i-- > 0; )
+        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
+      // Constrain the new dimension so that it is related to
+      // the left hand side as dictated by `relsym'.
+      // TODO: each one of the following constraints is definitely NOT
+      // a bounded differences (since it has 3 variables at least).
+      // Thus, the method refine_no_check() will simply ignore it.
+      // Should we compute approximations for this constraint?
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(lhs <= new_var);
+        break;
+      case EQUAL:
+        refine_no_check(lhs == new_var);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(lhs >= new_var);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+      // Remove the temporarily added dimension.
+      remove_higher_space_dimensions(space_dim-1);
+#endif // Currently unnecessarily complex computation.
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::generalized_affine_preimage(const Variable var,
+                                         const Relation_Symbol relsym,
+                                         const Linear_Expression& expr,
+                                         Coefficient_traits::const_reference
+                                         denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
+                                 "e", expr);
+
+  // `var' should be one of the dimensions of the BDS.
+  const dimension_type v = var.id() + 1;
+  if (v > space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
+                                 var.id());
+
+  // The relation symbol cannot be a strict relation symbol.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "r is the disequality relation symbol");
+
+  if (relsym == EQUAL) {
+    // The relation symbol is "=":
+    // this is just an affine preimage computation.
+    affine_preimage(var, expr, denominator);
+    return;
+  }
+
+  // The preimage of an empty BDS is empty too.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  // Check whether the preimage of this affine relation can be easily
+  // computed as the image of its inverse relation.
+  const Coefficient& expr_v = expr.coefficient(var);
+  if (expr_v != 0) {
+    const Relation_Symbol reversed_relsym = (relsym == LESS_OR_EQUAL)
+      ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
+    const Linear_Expression inverse
+      = expr - (expr_v + denominator)*var;
+    PPL_DIRTY_TEMP_COEFFICIENT(inverse_denom);
+    neg_assign(inverse_denom, expr_v);
+    const Relation_Symbol inverse_relsym
+      = (sgn(denominator) == sgn(inverse_denom)) ? relsym : reversed_relsym;
+    generalized_affine_image(var, inverse_relsym, inverse, inverse_denom);
+    return;
+  }
+
+  refine(var, relsym, expr, denominator);
+  // If the shrunk BD_Shape is empty, its preimage is empty too; ...
+  if (is_empty())
+    return;
+  // ...  otherwise, since the relation was not invertible,
+  // we just forget all constraints on `v'.
+  forget_all_dbm_constraints(v);
+  // Shortest-path closure is preserved, but not reduction.
+  if (marked_shortest_path_reduced())
+    reset_shortest_path_reduced();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::generalized_affine_preimage(const Linear_Expression& lhs,
+                                         const Relation_Symbol relsym,
+                                         const Linear_Expression& rhs) {
+  // Dimension-compatibility checks.
+  // The dimension of `lhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type bds_space_dim = space_dimension();
+  const dimension_type lhs_space_dim = lhs.space_dimension();
+  if (bds_space_dim < lhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
+                                 "e1", lhs);
+
+  // The dimension of `rhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type rhs_space_dim = rhs.space_dimension();
+  if (bds_space_dim < rhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
+                                 "e2", rhs);
+
+  // Strict relation symbols are not admitted for BDSs.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
+                           "r is the disequality relation symbol");
+
+  // The preimage of an empty BDS is empty.
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lhs': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t_lhs = 0;
+  // Index of the last non-zero coefficient in `lhs', if any.
+  dimension_type j_lhs = lhs.last_nonzero();
+
+  if (j_lhs != 0) {
+    ++t_lhs;
+    if (!lhs.all_zeroes(1, j_lhs))
+      ++t_lhs;
+    --j_lhs;
+  }
+
+  const Coefficient& b_lhs = lhs.inhomogeneous_term();
+
+  if (t_lhs == 0) {
+    // `lhs' is a constant.
+    // In this case, preimage and image happen to be the same.
+    generalized_affine_image(lhs, relsym, rhs);
+    return;
+  }
+  else if (t_lhs == 1) {
+    // Here `lhs == a_lhs * v + b_lhs'.
+    // Independently from the form of `rhs', we can exploit the
+    // method computing generalized affine preimages for a single variable.
+    Variable v(j_lhs);
+    // Compute a sign-corrected relation symbol.
+    const Coefficient& denom = lhs.coefficient(v);
+    Relation_Symbol new_relsym = relsym;
+    if (denom < 0) {
+      if (relsym == LESS_OR_EQUAL)
+        new_relsym = GREATER_OR_EQUAL;
+      else if (relsym == GREATER_OR_EQUAL)
+        new_relsym = LESS_OR_EQUAL;
+    }
+    Linear_Expression expr = rhs - b_lhs;
+    generalized_affine_preimage(v, new_relsym, expr, denom);
+  }
+  else {
+    // Here `lhs' is of the general form, having at least two variables.
+    // Compute the set of variables occurring in `lhs'.
+    std::vector<Variable> lhs_vars;
+    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
+          i != i_end; ++i)
+      lhs_vars.push_back(i.variable());
+
+    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
+    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
+      // `lhs' and `rhs' variables are disjoint.
+
+      // Constrain the left hand side expression so that it is related to
+      // the right hand side expression as dictated by `relsym'.
+      // TODO: if the following constraint is NOT a bounded difference,
+      // it will be simply ignored. Should we compute approximations for it?
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(lhs <= rhs);
+        break;
+      case EQUAL:
+        refine_no_check(lhs == rhs);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(lhs >= rhs);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+
+      // If the shrunk BD_Shape is empty, its preimage is empty too; ...
+      if (is_empty())
+        return;
+      // Existentially quantify all variables in the lhs.
+      for (dimension_type i = lhs_vars.size(); i-- > 0; )
+        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
+    }
+    else {
+
+      // Some variables in `lhs' also occur in `rhs'.
+      // To ease the computation, we add an additional dimension.
+      const Variable new_var(bds_space_dim);
+      add_space_dimensions_and_embed(1);
+      // Constrain the new dimension to be equal to `lhs'.
+      // NOTE: calling affine_image() instead of refine_no_check()
+      // ensures some approximation is tried even when the constraint
+      // is not a bounded difference.
+      affine_image(new_var, lhs);
+      // Existentiallly quantify all variables in the lhs.
+      // NOTE: enforce shortest-path closure for precision.
+      shortest_path_closure_assign();
+      PPL_ASSERT(!marked_empty());
+      for (dimension_type i = lhs_vars.size(); i-- > 0; )
+        forget_all_dbm_constraints(lhs_vars[i].id() + 1);
+      // Constrain the new dimension so that it is related to
+      // the left hand side as dictated by `relsym'.
+      // Note: if `rhs == a_rhs*v + b_rhs' where `a_rhs' is in {0, 1},
+      // then one of the following constraints will be added,
+      // since it is a bounded difference. Else the method
+      // refine_no_check() will ignore it, because the
+      // constraint is NOT a bounded difference.
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(new_var <= rhs);
+        break;
+      case EQUAL:
+        refine_no_check(new_var == rhs);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(new_var >= rhs);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+      // Remove the temporarily added dimension.
+      remove_higher_space_dimensions(bds_space_dim);
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+Constraint_System
+BD_Shape<T>::constraints() const {
+  const dimension_type space_dim = space_dimension();
+  Constraint_System cs;
+  cs.set_space_dimension(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cs = Constraint_System::zero_dim_empty();
+    return cs;
+  }
+
+  if (marked_empty()) {
+    cs.insert(Constraint::zero_dim_false());
+    return cs;
+  }
+
+  if (marked_shortest_path_reduced()) {
+    // Disregard redundant constraints.
+    cs = minimized_constraints();
+    return cs;
+  }
+
+  PPL_DIRTY_TEMP_COEFFICIENT(a);
+  PPL_DIRTY_TEMP_COEFFICIENT(b);
+  // Go through all the unary constraints in `dbm'.
+  const DB_Row<N>& dbm_0 = dbm[0];
+  for (dimension_type j = 1; j <= space_dim; ++j) {
+    const Variable x(j-1);
+    const N& dbm_0j = dbm_0[j];
+    const N& dbm_j0 = dbm[j][0];
+    if (is_additive_inverse(dbm_j0, dbm_0j)) {
+      // We have a unary equality constraint.
+      numer_denom(dbm_0j, b, a);
+      cs.insert(a*x == b);
+    }
+    else {
+      // We have 0, 1 or 2 unary inequality constraints.
+      if (!is_plus_infinity(dbm_0j)) {
+        numer_denom(dbm_0j, b, a);
+        cs.insert(a*x <= b);
+      }
+      if (!is_plus_infinity(dbm_j0)) {
+        numer_denom(dbm_j0, b, a);
+        cs.insert(-a*x <= b);
+      }
+    }
+  }
+
+  // Go through all the binary constraints in `dbm'.
+  for (dimension_type i = 1; i <= space_dim; ++i) {
+    const Variable y(i-1);
+    const DB_Row<N>& dbm_i = dbm[i];
+    for (dimension_type j = i + 1; j <= space_dim; ++j) {
+      const Variable x(j-1);
+      const N& dbm_ij = dbm_i[j];
+      const N& dbm_ji = dbm[j][i];
+      if (is_additive_inverse(dbm_ji, dbm_ij)) {
+        // We have a binary equality constraint.
+        numer_denom(dbm_ij, b, a);
+        cs.insert(a*x - a*y == b);
+      }
+      else {
+        // We have 0, 1 or 2 binary inequality constraints.
+        if (!is_plus_infinity(dbm_ij)) {
+          numer_denom(dbm_ij, b, a);
+          cs.insert(a*x - a*y <= b);
+        }
+        if (!is_plus_infinity(dbm_ji)) {
+          numer_denom(dbm_ji, b, a);
+          cs.insert(a*y - a*x <= b);
+        }
+      }
+    }
+  }
+  return cs;
+}
+
+template <typename T>
+Constraint_System
+BD_Shape<T>::minimized_constraints() const {
+  shortest_path_reduction_assign();
+  const dimension_type space_dim = space_dimension();
+  Constraint_System cs;
+  cs.set_space_dimension(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cs = Constraint_System::zero_dim_empty();
+    return cs;
+  }
+
+  if (marked_empty()) {
+    cs.insert(Constraint::zero_dim_false());
+    return cs;
+  }
+
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+
+  // Compute leader information.
+  std::vector<dimension_type> leaders;
+  compute_leaders(leaders);
+  std::vector<dimension_type> leader_indices;
+  compute_leader_indices(leaders, leader_indices);
+  const dimension_type num_leaders = leader_indices.size();
+
+  // Go through the non-leaders to generate equality constraints.
+  const DB_Row<N>& dbm_0 = dbm[0];
+  for (dimension_type i = 1; i <= space_dim; ++i) {
+    const dimension_type leader = leaders[i];
+    if (i != leader) {
+      // Generate the constraint relating `i' and its leader.
+      if (leader == 0) {
+        // A unary equality has to be generated.
+        PPL_ASSERT(!is_plus_infinity(dbm_0[i]));
+        numer_denom(dbm_0[i], numer, denom);
+        cs.insert(denom*Variable(i-1) == numer);
+      }
+      else {
+        // A binary equality has to be generated.
+        PPL_ASSERT(!is_plus_infinity(dbm[i][leader]));
+        numer_denom(dbm[i][leader], numer, denom);
+        cs.insert(denom*Variable(leader-1) - denom*Variable(i-1) == numer);
+      }
+    }
+  }
+
+  // Go through the leaders to generate inequality constraints.
+  // First generate all the unary inequalities.
+  const Bit_Row& red_0 = redundancy_dbm[0];
+  for (dimension_type l_i = 1; l_i < num_leaders; ++l_i) {
+    const dimension_type i = leader_indices[l_i];
+    if (!red_0[i]) {
+      numer_denom(dbm_0[i], numer, denom);
+      cs.insert(denom*Variable(i-1) <= numer);
+    }
+    if (!redundancy_dbm[i][0]) {
+      numer_denom(dbm[i][0], numer, denom);
+      cs.insert(-denom*Variable(i-1) <= numer);
+    }
+  }
+  // Then generate all the binary inequalities.
+  for (dimension_type l_i = 1; l_i < num_leaders; ++l_i) {
+    const dimension_type i = leader_indices[l_i];
+    const DB_Row<N>& dbm_i = dbm[i];
+    const Bit_Row& red_i = redundancy_dbm[i];
+    for (dimension_type l_j = l_i + 1; l_j < num_leaders; ++l_j) {
+      const dimension_type j = leader_indices[l_j];
+      if (!red_i[j]) {
+        numer_denom(dbm_i[j], numer, denom);
+        cs.insert(denom*Variable(j-1) - denom*Variable(i-1) <= numer);
+      }
+      if (!redundancy_dbm[j][i]) {
+        numer_denom(dbm[j][i], numer, denom);
+        cs.insert(denom*Variable(i-1) - denom*Variable(j-1) <= numer);
+      }
+    }
+  }
+  return cs;
+}
+
+template <typename T>
+void
+BD_Shape<T>::expand_space_dimension(Variable var, dimension_type m) {
+  dimension_type old_dim = space_dimension();
+  // `var' should be one of the dimensions of the vector space.
+  if (var.space_dimension() > old_dim)
+    throw_dimension_incompatible("expand_space_dimension(v, m)", "v", var);
+
+  // The space dimension of the resulting BDS should not
+  // overflow the maximum allowed space dimension.
+  if (m > max_space_dimension() - space_dimension())
+    throw_invalid_argument("expand_dimension(v, m)",
+                           "adding m new space dimensions exceeds "
+                           "the maximum allowed space dimension");
+
+  // Nothing to do, if no dimensions must be added.
+  if (m == 0)
+    return;
+
+  // Add the required new dimensions.
+  add_space_dimensions_and_embed(m);
+
+  // For each constraints involving variable `var', we add a
+  // similar constraint with the new variable substituted for
+  // variable `var'.
+  const dimension_type v_id = var.id() + 1;
+  const DB_Row<N>& dbm_v = dbm[v_id];
+  for (dimension_type i = old_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    const N& dbm_i_v = dbm[i][v_id];
+    const N& dbm_v_i = dbm_v[i];
+    for (dimension_type j = old_dim+1; j < old_dim+m+1; ++j) {
+      dbm_i[j] = dbm_i_v;
+      dbm[j][i] = dbm_v_i;
+    }
+  }
+  // In general, adding a constraint does not preserve the shortest-path
+  // closure or reduction of the bounded difference shape.
+  if (marked_shortest_path_closed())
+    reset_shortest_path_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
+                                   Variable dest) {
+  const dimension_type space_dim = space_dimension();
+  // `dest' should be one of the dimensions of the BDS.
+  if (dest.space_dimension() > space_dim)
+    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
+                                 "v", dest);
+
+  // The folding of no dimensions is a no-op.
+  if (vars.empty())
+    return;
+
+  // All variables in `vars' should be dimensions of the BDS.
+  if (vars.space_dimension() > space_dim)
+    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
+                                 vars.space_dimension());
+
+  // Moreover, `dest.id()' should not occur in `vars'.
+  if (vars.find(dest.id()) != vars.end())
+    throw_invalid_argument("fold_space_dimensions(vs, v)",
+                           "v should not occur in vs");
+
+  shortest_path_closure_assign();
+  if (!marked_empty()) {
+    // Recompute the elements of the row and the column corresponding
+    // to variable `dest' by taking the join of their value with the
+    // value of the corresponding elements in the row and column of the
+    // variable `vars'.
+    const dimension_type v_id = dest.id() + 1;
+    DB_Row<N>& dbm_v = dbm[v_id];
+    for (Variables_Set::const_iterator i = vars.begin(),
+           vs_end = vars.end(); i != vs_end; ++i) {
+      const dimension_type to_be_folded_id = *i + 1;
+      const DB_Row<N>& dbm_to_be_folded_id = dbm[to_be_folded_id];
+      for (dimension_type j = space_dim + 1; j-- > 0; ) {
+        max_assign(dbm[j][v_id], dbm[j][to_be_folded_id]);
+        max_assign(dbm_v[j], dbm_to_be_folded_id[j]);
+      }
+    }
+  }
+  remove_space_dimensions(vars);
+}
+
+template <typename T>
+void
+BD_Shape<T>::drop_some_non_integer_points(Complexity_Class) {
+  if (std::numeric_limits<T>::is_integer)
+    return;
+
+  const dimension_type space_dim = space_dimension();
+  shortest_path_closure_assign();
+  if (space_dim == 0 || marked_empty())
+    return;
+
+  for (dimension_type i = space_dim + 1; i-- > 0; ) {
+    DB_Row<N>& dbm_i = dbm[i];
+    for (dimension_type j = space_dim + 1; j-- > 0; )
+      if (i != j)
+        drop_some_non_integer_points_helper(dbm_i[j]);
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+BD_Shape<T>::drop_some_non_integer_points(const Variables_Set& vars,
+                                          Complexity_Class) {
+  // Dimension-compatibility check.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dim < min_space_dim)
+    throw_dimension_incompatible("drop_some_non_integer_points(vs, cmpl)",
+                                 min_space_dim);
+
+  if (std::numeric_limits<T>::is_integer || min_space_dim == 0)
+    return;
+
+  shortest_path_closure_assign();
+  if (marked_empty())
+    return;
+
+  const Variables_Set::const_iterator v_begin = vars.begin();
+  const Variables_Set::const_iterator v_end = vars.end();
+  PPL_ASSERT(v_begin != v_end);
+  // Unary constraints on a variable occurring in `vars'.
+  DB_Row<N>& dbm_0 = dbm[0];
+  for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
+    const dimension_type i = *v_i + 1;
+    drop_some_non_integer_points_helper(dbm_0[i]);
+    drop_some_non_integer_points_helper(dbm[i][0]);
+  }
+
+  // Binary constraints where both variables occur in `vars'.
+  for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
+    const dimension_type i = *v_i + 1;
+    DB_Row<N>& dbm_i = dbm[i];
+    for (Variables_Set::const_iterator v_j = v_begin; v_j != v_end; ++v_j) {
+      const dimension_type j = *v_j + 1;
+      if (i != j)
+        drop_some_non_integer_points_helper(dbm_i[j]);
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+/*! \relates Parma_Polyhedra_Library::BD_Shape */
+template <typename T>
+std::ostream&
+IO_Operators::operator<<(std::ostream& s, const BD_Shape<T>& bds) {
+  typedef typename BD_Shape<T>::coefficient_type N;
+  if (bds.is_universe())
+    s << "true";
+  else {
+    // We control empty bounded difference shape.
+    dimension_type n = bds.space_dimension();
+    if (bds.marked_empty())
+      s << "false";
+    else {
+      PPL_DIRTY_TEMP(N, v);
+      bool first = true;
+      for (dimension_type i = 0; i <= n; ++i)
+        for (dimension_type j = i + 1; j <= n; ++j) {
+          const N& c_i_j = bds.dbm[i][j];
+          const N& c_j_i = bds.dbm[j][i];
+          if (is_additive_inverse(c_j_i, c_i_j)) {
+            // We will print an equality.
+            if (first)
+              first = false;
+            else
+              s << ", ";
+            if (i == 0) {
+              // We have got a equality constraint with one variable.
+              s << Variable(j - 1);
+              s << " = " << c_i_j;
+            }
+            else {
+              // We have got a equality constraint with two variables.
+              if (sgn(c_i_j) >= 0) {
+                s << Variable(j - 1);
+                s << " - ";
+                s << Variable(i - 1);
+                s << " = " << c_i_j;
+              }
+              else {
+                s << Variable(i - 1);
+                s << " - ";
+                s << Variable(j - 1);
+                s << " = " << c_j_i;
+              }
+            }
+          }
+          else {
+            // We will print a non-strict inequality.
+            if (!is_plus_infinity(c_j_i)) {
+              if (first)
+                first = false;
+              else
+                s << ", ";
+              if (i == 0) {
+                // We have got a constraint with only one variable.
+                s << Variable(j - 1);
+                neg_assign_r(v, c_j_i, ROUND_DOWN);
+                s << " >= " << v;
+              }
+              else {
+                // We have got a constraint with two variables.
+                if (sgn(c_j_i) >= 0) {
+                  s << Variable(i - 1);
+                  s << " - ";
+                  s << Variable(j - 1);
+                  s << " <= " << c_j_i;
+                }
+                else {
+                  s << Variable(j - 1);
+                  s << " - ";
+                  s << Variable(i - 1);
+                  neg_assign_r(v, c_j_i, ROUND_DOWN);
+                  s << " >= " << v;
+                }
+              }
+            }
+            if (!is_plus_infinity(c_i_j)) {
+              if (first)
+                first = false;
+              else
+                s << ", ";
+              if (i == 0) {
+                // We have got a constraint with only one variable.
+                s << Variable(j - 1);
+                s << " <= " << c_i_j;
+              }
+              else {
+                // We have got a constraint with two variables.
+                if (sgn(c_i_j) >= 0) {
+                  s << Variable(j - 1);
+                  s << " - ";
+                  s << Variable(i - 1);
+                  s << " <= " << c_i_j;
+                }
+                else {
+                  s << Variable(i - 1);
+                  s << " - ";
+                  s << Variable(j - 1);
+                  neg_assign_r(v, c_i_j, ROUND_DOWN);
+                  s << " >= " << v;
+                }
+              }
+            }
+          }
+        }
+    }
+  }
+  return s;
+}
+
+template <typename T>
+void
+BD_Shape<T>::ascii_dump(std::ostream& s) const {
+  status.ascii_dump(s);
+  s << "\n";
+  dbm.ascii_dump(s);
+  s << "\n";
+  redundancy_dbm.ascii_dump(s);
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, BD_Shape<T>)
+
+template <typename T>
+bool
+BD_Shape<T>::ascii_load(std::istream& s) {
+  if (!status.ascii_load(s))
+    return false;
+  if (!dbm.ascii_load(s))
+    return false;
+  if (!redundancy_dbm.ascii_load(s))
+    return false;
+  return true;
+}
+
+template <typename T>
+memory_size_type
+BD_Shape<T>::external_memory_in_bytes() const {
+  return dbm.external_memory_in_bytes()
+    + redundancy_dbm.external_memory_in_bytes();
+}
+
+template <typename T>
+bool
+BD_Shape<T>::OK() const {
+  // Check whether the difference-bound matrix is well-formed.
+  if (!dbm.OK())
+    return false;
+
+  // Check whether the status information is legal.
+  if (!status.OK())
+    return false;
+
+  // An empty BDS is OK.
+  if (marked_empty())
+    return true;
+
+  // MINUS_INFINITY cannot occur at all.
+  for (dimension_type i = dbm.num_rows(); i-- > 0; )
+    for (dimension_type j = dbm.num_rows(); j-- > 0; )
+      if (is_minus_infinity(dbm[i][j])) {
+#ifndef NDEBUG
+        using namespace Parma_Polyhedra_Library::IO_Operators;
+        std::cerr << "BD_Shape::dbm[" << i << "][" << j << "] = "
+                  << dbm[i][j] << "!"
+                  << std::endl;
+#endif
+        return false;
+      }
+
+  // On the main diagonal only PLUS_INFINITY can occur.
+  for (dimension_type i = dbm.num_rows(); i-- > 0; )
+    if (!is_plus_infinity(dbm[i][i])) {
+#ifndef NDEBUG
+      using namespace Parma_Polyhedra_Library::IO_Operators;
+      std::cerr << "BD_Shape::dbm[" << i << "][" << i << "] = "
+                << dbm[i][i] << "!  (+inf was expected.)"
+                << std::endl;
+#endif
+      return false;
+    }
+
+  // Check whether the shortest-path closure information is legal.
+  if (marked_shortest_path_closed()) {
+    BD_Shape x = *this;
+    x.reset_shortest_path_closed();
+    x.shortest_path_closure_assign();
+    if (x.dbm != dbm) {
+#ifndef NDEBUG
+      std::cerr << "BD_Shape is marked as closed but it is not!"
+                << std::endl;
+#endif
+      return false;
+    }
+  }
+
+  // The following tests might result in false alarms when using floating
+  // point coefficients: they are only meaningful if the coefficient type
+  // base is exact (since otherwise shortest-path closure is approximated).
+  if (std::numeric_limits<coefficient_type_base>::is_exact) {
+
+    // Check whether the shortest-path reduction information is legal.
+    if (marked_shortest_path_reduced()) {
+      // A non-redundant constraint cannot be equal to PLUS_INFINITY.
+      for (dimension_type i = dbm.num_rows(); i-- > 0; )
+        for (dimension_type j = dbm.num_rows(); j-- > 0; )
+          if (!redundancy_dbm[i][j] && is_plus_infinity(dbm[i][j])) {
+#ifndef NDEBUG
+            using namespace Parma_Polyhedra_Library::IO_Operators;
+            std::cerr << "BD_Shape::dbm[" << i << "][" << j << "] = "
+                      << dbm[i][j] << " is marked as non-redundant!"
+                      << std::endl;
+#endif
+            return false;
+          }
+
+      BD_Shape x = *this;
+      x.reset_shortest_path_reduced();
+      x.shortest_path_reduction_assign();
+      if (x.redundancy_dbm != redundancy_dbm) {
+#ifndef NDEBUG
+        std::cerr << "BD_Shape is marked as reduced but it is not!"
+                  << std::endl;
+#endif
+        return false;
+      }
+    }
+  }
+
+  // All checks passed.
+  return true;
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          const BD_Shape& y) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", y->space_dimension() == " << y.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          dimension_type required_dim) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", required dimension == " << required_dim << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          const Constraint& c) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", c->space_dimension == " << c.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          const Congruence& cg) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", cg->space_dimension == " << cg.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          const Generator& g) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", g->space_dimension == " << g.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_expression_too_complex(const char* method,
+                                          const Linear_Expression& le) {
+  using namespace IO_Operators;
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << le << " is too complex.";
+  throw std::invalid_argument(s.str());
+}
+
+
+template <typename T>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          const char* le_name,
+                                          const Linear_Expression& le) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", " << le_name << "->space_dimension() == "
+    << le.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+template<typename Interval_Info>
+void
+BD_Shape<T>::throw_dimension_incompatible(const char* method,
+                                          const char* lf_name,
+                                          const Linear_Form< Interval<T,
+                                          Interval_Info> >& lf) const {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", " << lf_name << "->space_dimension() == "
+    << lf.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+BD_Shape<T>::throw_invalid_argument(const char* method, const char* reason) {
+  std::ostringstream s;
+  s << "PPL::BD_Shape::" << method << ":" << std::endl
+    << reason << ".";
+  throw std::invalid_argument(s.str());
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_BD_Shape_templates_hh)
diff --git a/src/BD_Shape_types.hh b/src/BD_Shape_types.hh
new file mode 100644
index 0000000..5209605
--- /dev/null
+++ b/src/BD_Shape_types.hh
@@ -0,0 +1,25 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_BD_Shape_types_hh
+#define PPL_BD_Shape_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class BD_Shape;
+
+class BD_Shape_Helpers;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_BD_Shape_types_hh)
diff --git a/src/BHRZ03_Certificate.cc b/src/BHRZ03_Certificate.cc
index 8bfc3c8..b640ff7 100644
--- a/src/BHRZ03_Certificate.cc
+++ b/src/BHRZ03_Certificate.cc
@@ -1,6 +1,6 @@
 /* BHRZ03_Certificate class implementation (non-inline member functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "BHRZ03_Certificate.defs.hh"
-#include "Polyhedron.defs.hh"
+#include "BHRZ03_Certificate_defs.hh"
+#include "Polyhedron_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -51,7 +51,7 @@ PPL::BHRZ03_Certificate::BHRZ03_Certificate(const Polyhedron& ph)
   PPL_ASSERT(num_constraints == 0);
   const Constraint_System& cs = ph.minimized_constraints();
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
+         cs_end = cs.end(); i != cs_end; ++i) {
     ++num_constraints;
     if (i->is_equality())
       --affine_dim;
@@ -61,7 +61,7 @@ PPL::BHRZ03_Certificate::BHRZ03_Certificate(const Polyhedron& ph)
   PPL_ASSERT(num_points == 0);
   const Generator_System& gs = ph.minimized_generators();
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     switch (i->type()) {
     case Generator::POINT:
       // Intentionally fall through.
@@ -140,7 +140,7 @@ PPL::BHRZ03_Certificate::compare(const Polyhedron& ph) const {
   dimension_type ph_num_constraints = 0;
   const Constraint_System& cs = ph.minimized_constraints();
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
+         cs_end = cs.end(); i != cs_end; ++i) {
     ++ph_num_constraints;
     if (i->is_equality())
       --ph_affine_dim;
@@ -169,7 +169,7 @@ PPL::BHRZ03_Certificate::compare(const Polyhedron& ph) const {
   dimension_type ph_num_points = 0;
   const Generator_System& gs = ph.minimized_generators();
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     switch (i->type()) {
     case Generator::POINT:
       // Intentionally fall through.
@@ -219,7 +219,7 @@ PPL::BHRZ03_Certificate::compare(const Polyhedron& ph) const {
   // compute information about rays.
   std::vector<dimension_type> ph_num_rays_null_coord(ph.space_dim, 0);
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     if (i->is_ray())
       ++ph_num_rays_null_coord[i->expression().num_zeroes(1, space_dim + 1)];
 
@@ -246,9 +246,9 @@ PPL::BHRZ03_Certificate::OK() const {
   if (affine_dim > space_dim) {
 #ifndef NDEBUG
     cerr << "In the BHRZ03 certificate about a non-empty polyhedron:"
-	 << endl
-	 << "the affine dimension is greater than the space dimension!"
-	 << endl;
+         << endl
+         << "the affine dimension is greater than the space dimension!"
+         << endl;
 #endif
     return false;
   }
@@ -256,10 +256,10 @@ PPL::BHRZ03_Certificate::OK() const {
   if (lin_space_dim > affine_dim) {
 #ifndef NDEBUG
     cerr << "In the BHRZ03 certificate about a non-empty polyhedron:"
-	 << endl
-	 << "the lineality space dimension is greater than "
-	 << "the affine dimension!"
-	 << endl;
+         << endl
+         << "the lineality space dimension is greater than "
+         << "the affine dimension!"
+         << endl;
 #endif
     return false;
   }
@@ -267,15 +267,15 @@ PPL::BHRZ03_Certificate::OK() const {
   if (num_constraints < space_dim - affine_dim) {
 #ifndef NDEBUG
     cerr << "In the BHRZ03 certificate about a non-empty polyhedron:"
-	 << endl
-	 << "in a vector space of dimension `n',"
-	 << "any polyhedron of affine dimension `k'" << endl
-	 << "should have `n-k' non-redundant constraints at least."
-	 << endl
-	 << "Here space_dim = " << space_dim << ", "
-	 << "affine_dim = " << affine_dim << ", "
-	 << "but num_constraints = " << num_constraints << "!"
-	 << endl;
+         << endl
+         << "in a vector space of dimension `n',"
+         << "any polyhedron of affine dimension `k'" << endl
+         << "should have `n-k' non-redundant constraints at least."
+         << endl
+         << "Here space_dim = " << space_dim << ", "
+         << "affine_dim = " << affine_dim << ", "
+         << "but num_constraints = " << num_constraints << "!"
+         << endl;
 #endif
     return false;
   }
@@ -283,9 +283,9 @@ PPL::BHRZ03_Certificate::OK() const {
   if (num_points == 0) {
 #ifndef NDEBUG
     cerr << "In the BHRZ03 certificate about a non-empty polyhedron:"
-	 << endl
-	 << "the generator system has no points!"
-	 << endl;
+         << endl
+         << "the generator system has no points!"
+         << endl;
 #endif
     return false;
   }
@@ -295,9 +295,9 @@ PPL::BHRZ03_Certificate::OK() const {
     if (num_constraints > 0) {
 #ifndef NDEBUG
       cerr << "In the BHRZ03 certificate about a non-empty polyhedron:"
-	   << endl
-	   << "a universe polyhedron has non-redundant constraints!"
-	   << endl;
+           << endl
+           << "a universe polyhedron has non-redundant constraints!"
+           << endl;
 #endif
       return false;
     }
@@ -305,9 +305,9 @@ PPL::BHRZ03_Certificate::OK() const {
     if (num_points != 1) {
 #ifndef NDEBUG
       cerr << "In the BHRZ03 certificate about a non-empty polyhedron:"
-	   << endl
-	   << "a universe polyhedron has more than one non-redundant point!"
-	   << endl;
+           << endl
+           << "a universe polyhedron has more than one non-redundant point!"
+           << endl;
 #endif
       return false;
     }
diff --git a/src/BHRZ03_Certificate.defs.hh b/src/BHRZ03_Certificate.defs.hh
deleted file mode 100644
index 3378dd2..0000000
--- a/src/BHRZ03_Certificate.defs.hh
+++ /dev/null
@@ -1,118 +0,0 @@
-/* BHRZ03_Certificate class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BHRZ03_Certificate_defs_hh
-#define PPL_BHRZ03_Certificate_defs_hh 1
-
-#include "BHRZ03_Certificate.types.hh"
-#include "Polyhedron.types.hh"
-#include "globals.defs.hh"
-#include "assert.hh"
-#include <vector>
-
-//! The convergence certificate for the BHRZ03 widening operator.
-/*! \ingroup PPL_CXX_interface
-  Convergence certificates are used to instantiate the BHZ03 framework
-  so as to define widening operators for the finite powerset domain.
-
-  \note
-  Each convergence certificate has to be used together with a
-  compatible widening operator. In particular, BHRZ03_Certificate
-  can certify the convergence of both the BHRZ03 and the H79 widenings.
-*/
-class Parma_Polyhedra_Library::BHRZ03_Certificate {
-public:
-  //! Default constructor.
-  BHRZ03_Certificate();
-
-  //! Constructor: computes the certificate for \p ph.
-  BHRZ03_Certificate(const Polyhedron& ph);
-
-  //! Copy constructor.
-  BHRZ03_Certificate(const BHRZ03_Certificate& y);
-
-  //! Destructor.
-  ~BHRZ03_Certificate();
-
-  //! The comparison function for certificates.
-  /*!
-    \return
-    \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether \p *this
-    is smaller than, equal to, or greater than \p y, respectively.
-
-    Compares \p *this with \p y, using a total ordering which is a
-    refinement of the limited growth ordering relation for the
-    BHRZ03 widening.
-  */
-  int compare(const BHRZ03_Certificate& y) const;
-
-  //! Compares \p *this with the certificate for polyhedron \p ph.
-  int compare(const Polyhedron& ph) const;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the certificate for
-    polyhedron \p ph is strictly smaller than \p *this.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool is_stabilizing(const Polyhedron& ph) const;
-
-  //! A total ordering on BHRZ03 certificates.
-  /*! \ingroup PPL_CXX_interface
-    This binary predicate defines a total ordering on BHRZ03 certificates
-    which is used when storing information about sets of polyhedra.
-  */
-  struct Compare {
-    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
-    bool operator()(const BHRZ03_Certificate& x,
-		    const BHRZ03_Certificate& y) const;
-  };
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! Check if gathered information is meaningful.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool OK() const;
-
-private:
-  //! Affine dimension of the polyhedron.
-  dimension_type affine_dim;
-  //! Dimension of the lineality space of the polyhedron.
-  dimension_type lin_space_dim;
-  //! Cardinality of a non-redundant constraint system for the polyhedron.
-  dimension_type num_constraints;
-  /*! \brief
-    Number of non-redundant points in a generator system
-    for the polyhedron.
-  */
-  dimension_type num_points;
-  /*! \brief
-    A vector containing, for each index `0 <= i < space_dim',
-    the number of non-redundant rays in a generator system of the
-    polyhedron having exactly `i' null coordinates.
-  */
-  std::vector<dimension_type> num_rays_null_coord;
-};
-
-#include "BHRZ03_Certificate.inlines.hh"
-
-#endif // !defined(PPL_BHRZ03_Certificate_defs_hh)
diff --git a/src/BHRZ03_Certificate.inlines.hh b/src/BHRZ03_Certificate.inlines.hh
deleted file mode 100644
index 0087bec..0000000
--- a/src/BHRZ03_Certificate.inlines.hh
+++ /dev/null
@@ -1,63 +0,0 @@
-/* BHRZ03_Certificate class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_BHRZ03_Certificate_inlines_hh
-#define PPL_BHRZ03_Certificate_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-BHRZ03_Certificate::BHRZ03_Certificate()
-  : affine_dim(0), lin_space_dim(0), num_constraints(0), num_points(1),
-    num_rays_null_coord() {
-  // This is the certificate for a zero-dim universe polyhedron.
-  PPL_ASSERT(OK());
-}
-
-inline
-BHRZ03_Certificate::BHRZ03_Certificate(const BHRZ03_Certificate& y)
-  : affine_dim(y.affine_dim), lin_space_dim(y.lin_space_dim),
-    num_constraints(y.num_constraints), num_points(y.num_points),
-    num_rays_null_coord(y.num_rays_null_coord) {
-}
-
-inline
-BHRZ03_Certificate::~BHRZ03_Certificate() {
-}
-
-inline bool
-BHRZ03_Certificate::is_stabilizing(const Polyhedron& ph) const {
-  return compare(ph) == 1;
-}
-
-inline bool
-BHRZ03_Certificate::Compare::operator()(const BHRZ03_Certificate& x,
-					const BHRZ03_Certificate& y) const {
-  // For an efficient evaluation of the multiset ordering based
-  // on this LGO relation, we want larger elements to come first.
-  return x.compare(y) == 1;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_BHRZ03_Certificate_inlines_hh)
diff --git a/src/BHRZ03_Certificate.types.hh b/src/BHRZ03_Certificate.types.hh
deleted file mode 100644
index fd2b31d..0000000
--- a/src/BHRZ03_Certificate.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_BHRZ03_Certificate_types_hh
-#define PPL_BHRZ03_Certificate_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class BHRZ03_Certificate;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_BHRZ03_Certificate_types_hh)
diff --git a/src/BHRZ03_Certificate_defs.hh b/src/BHRZ03_Certificate_defs.hh
new file mode 100644
index 0000000..433f5d6
--- /dev/null
+++ b/src/BHRZ03_Certificate_defs.hh
@@ -0,0 +1,118 @@
+/* BHRZ03_Certificate class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BHRZ03_Certificate_defs_hh
+#define PPL_BHRZ03_Certificate_defs_hh 1
+
+#include "BHRZ03_Certificate_types.hh"
+#include "Polyhedron_types.hh"
+#include "globals_defs.hh"
+#include "assert.hh"
+#include <vector>
+
+//! The convergence certificate for the BHRZ03 widening operator.
+/*! \ingroup PPL_CXX_interface
+  Convergence certificates are used to instantiate the BHZ03 framework
+  so as to define widening operators for the finite powerset domain.
+
+  \note
+  Each convergence certificate has to be used together with a
+  compatible widening operator. In particular, BHRZ03_Certificate
+  can certify the convergence of both the BHRZ03 and the H79 widenings.
+*/
+class Parma_Polyhedra_Library::BHRZ03_Certificate {
+public:
+  //! Default constructor.
+  BHRZ03_Certificate();
+
+  //! Constructor: computes the certificate for \p ph.
+  BHRZ03_Certificate(const Polyhedron& ph);
+
+  //! Copy constructor.
+  BHRZ03_Certificate(const BHRZ03_Certificate& y);
+
+  //! Destructor.
+  ~BHRZ03_Certificate();
+
+  //! The comparison function for certificates.
+  /*!
+    \return
+    \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether \p *this
+    is smaller than, equal to, or greater than \p y, respectively.
+
+    Compares \p *this with \p y, using a total ordering which is a
+    refinement of the limited growth ordering relation for the
+    BHRZ03 widening.
+  */
+  int compare(const BHRZ03_Certificate& y) const;
+
+  //! Compares \p *this with the certificate for polyhedron \p ph.
+  int compare(const Polyhedron& ph) const;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the certificate for
+    polyhedron \p ph is strictly smaller than \p *this.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool is_stabilizing(const Polyhedron& ph) const;
+
+  //! A total ordering on BHRZ03 certificates.
+  /*! \ingroup PPL_CXX_interface
+    This binary predicate defines a total ordering on BHRZ03 certificates
+    which is used when storing information about sets of polyhedra.
+  */
+  struct Compare {
+    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
+    bool operator()(const BHRZ03_Certificate& x,
+                    const BHRZ03_Certificate& y) const;
+  };
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! Check if gathered information is meaningful.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool OK() const;
+
+private:
+  //! Affine dimension of the polyhedron.
+  dimension_type affine_dim;
+  //! Dimension of the lineality space of the polyhedron.
+  dimension_type lin_space_dim;
+  //! Cardinality of a non-redundant constraint system for the polyhedron.
+  dimension_type num_constraints;
+  /*! \brief
+    Number of non-redundant points in a generator system
+    for the polyhedron.
+  */
+  dimension_type num_points;
+  /*! \brief
+    A vector containing, for each index `0 <= i < space_dim',
+    the number of non-redundant rays in a generator system of the
+    polyhedron having exactly `i' null coordinates.
+  */
+  std::vector<dimension_type> num_rays_null_coord;
+};
+
+#include "BHRZ03_Certificate_inlines.hh"
+
+#endif // !defined(PPL_BHRZ03_Certificate_defs_hh)
diff --git a/src/BHRZ03_Certificate_inlines.hh b/src/BHRZ03_Certificate_inlines.hh
new file mode 100644
index 0000000..6d17f7e
--- /dev/null
+++ b/src/BHRZ03_Certificate_inlines.hh
@@ -0,0 +1,63 @@
+/* BHRZ03_Certificate class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_BHRZ03_Certificate_inlines_hh
+#define PPL_BHRZ03_Certificate_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+BHRZ03_Certificate::BHRZ03_Certificate()
+  : affine_dim(0), lin_space_dim(0), num_constraints(0), num_points(1),
+    num_rays_null_coord() {
+  // This is the certificate for a zero-dim universe polyhedron.
+  PPL_ASSERT(OK());
+}
+
+inline
+BHRZ03_Certificate::BHRZ03_Certificate(const BHRZ03_Certificate& y)
+  : affine_dim(y.affine_dim), lin_space_dim(y.lin_space_dim),
+    num_constraints(y.num_constraints), num_points(y.num_points),
+    num_rays_null_coord(y.num_rays_null_coord) {
+}
+
+inline
+BHRZ03_Certificate::~BHRZ03_Certificate() {
+}
+
+inline bool
+BHRZ03_Certificate::is_stabilizing(const Polyhedron& ph) const {
+  return compare(ph) == 1;
+}
+
+inline bool
+BHRZ03_Certificate::Compare::operator()(const BHRZ03_Certificate& x,
+                                        const BHRZ03_Certificate& y) const {
+  // For an efficient evaluation of the multiset ordering based
+  // on this LGO relation, we want larger elements to come first.
+  return x.compare(y) == 1;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_BHRZ03_Certificate_inlines_hh)
diff --git a/src/BHRZ03_Certificate_types.hh b/src/BHRZ03_Certificate_types.hh
new file mode 100644
index 0000000..f025348
--- /dev/null
+++ b/src/BHRZ03_Certificate_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_BHRZ03_Certificate_types_hh
+#define PPL_BHRZ03_Certificate_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class BHRZ03_Certificate;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_BHRZ03_Certificate_types_hh)
diff --git a/src/Bit_Matrix.cc b/src/Bit_Matrix.cc
index 2309436..85eedf0 100644
--- a/src/Bit_Matrix.cc
+++ b/src/Bit_Matrix.cc
@@ -1,6 +1,6 @@
 /* Bit_Matrix class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,10 +22,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Bit_Matrix.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "globals.defs.hh"
-#include "swapping_sort.templates.hh"
+#include "Bit_Matrix_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "globals_defs.hh"
+#include "swapping_sort_templates.hh"
 #include "C_Integer.hh"
 #include <iostream>
 #include <string>
@@ -124,7 +124,7 @@ PPL::Bit_Matrix::transpose_assign(const Bit_Matrix& y) {
 
 void
 PPL::Bit_Matrix::resize(dimension_type new_n_rows,
-		       dimension_type new_n_columns) {
+                        dimension_type new_n_columns) {
   PPL_ASSERT(OK());
   const dimension_type old_num_rows = num_rows();
   if (new_n_columns < row_size) {
@@ -143,7 +143,7 @@ PPL::Bit_Matrix::resize(dimension_type new_n_rows,
       new_rows.insert(new_rows.end(), new_n_rows, Bit_Row());
       // Steal the old rows.
       for (dimension_type i = old_num_rows; i-- > 0; )
-	new_rows[i].m_swap(rows[i]);
+        new_rows[i].m_swap(rows[i]);
       // Put the new vector into place.
       using std::swap;
       swap(rows, new_rows);
@@ -192,11 +192,11 @@ PPL::Bit_Matrix::ascii_load(std::istream& s) {
     for (dimension_type j = 0; j < num_columns(); ++j) {
       int bit;
       if (!(s >> bit))
-	return false;
+        return false;
       if (bit != 0)
-	x[i].set(j);
+        x[i].set(j);
       else
-	x[i].clear(j);
+        x[i].clear(j);
     }
 
   // Check invariants.
@@ -228,10 +228,10 @@ PPL::Bit_Matrix::OK() const {
              && row.last() >= row_size) {
 #ifndef NDEBUG
       cerr << "Bit_Matrix[" << i << "] is a row with too many bits!"
-	   << endl
-	   << "(row_size == " << row_size
-	   << ", row.last() == " << row.last() << ")"
-	   << endl;
+           << endl
+           << "(row_size == " << row_size
+           << ", row.last() == " << row.last() << ")"
+           << endl;
 #endif
       return false;
     }
diff --git a/src/Bit_Matrix.defs.hh b/src/Bit_Matrix.defs.hh
deleted file mode 100644
index 419efbd..0000000
--- a/src/Bit_Matrix.defs.hh
+++ /dev/null
@@ -1,187 +0,0 @@
-/* Bit_Matrix class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Bit_Matrix_defs_hh
-#define PPL_Bit_Matrix_defs_hh 1
-
-#include "Bit_Matrix.types.hh"
-#include "Linear_System.types.hh"
-#include "Bit_Row.defs.hh"
-#include <vector>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates Bit_Matrix */
-void swap(Bit_Matrix& x, Bit_Matrix& y);
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-} // namespace Parma_Polyhedra_Library
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A matrix of bits.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Bit_Matrix {
-public:
-  //! Default constructor.
-  Bit_Matrix();
-
-  //! Construct a bit matrix with \p n_rows rows and \p n_columns columns.
-  Bit_Matrix(dimension_type n_rows, dimension_type n_columns);
-
-  //! Copy constructor.
-  Bit_Matrix(const Bit_Matrix& y);
-
-  //! Destructor.
-  ~Bit_Matrix();
-
-  //! Assignment operator.
-  Bit_Matrix& operator=(const Bit_Matrix& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Bit_Matrix& y);
-
-  //! Subscript operator.
-  Bit_Row& operator[](dimension_type k);
-
-  //! Constant subscript operator.
-  const Bit_Row& operator[](dimension_type k) const;
-
-  //! Clears the matrix deallocating all its rows.
-  void clear();
-
-  //! Transposes the matrix.
-  void transpose();
-
-  //! Makes \p *this a transposed copy of \p y.
-  void transpose_assign(const Bit_Matrix& y);
-
-  //! Returns the maximum number of rows of a Bit_Matrix.
-  static dimension_type max_num_rows();
-
-  //! Returns the number of columns of \p *this.
-  dimension_type num_columns() const;
-
-  //! Returns the number of rows of \p *this.
-  dimension_type num_rows() const;
-
-  //! Sorts the rows and removes duplicates.
-  void sort_rows();
-
-  //! Looks for \p row in \p *this, which is assumed to be sorted.
-  /*!
-    \return
-    <CODE>true</CODE> if \p row belongs to \p *this, false otherwise.
-
-    \param row
-    The row that will be searched for in the matrix.
-
-    Given a sorted bit matrix (this ensures better efficiency),
-    tells whether it contains the given row.
-  */
-  bool sorted_contains(const Bit_Row& row) const;
-
-  //! Adds \p row to \p *this.
-  /*!
-    \param row
-    The row whose implementation will be recycled.
-
-    The only thing that can be done with \p row upon return is destruction.
-  */
-  void add_recycled_row(Bit_Row& row);
-
-  //! Removes the last \p n rows.
-  void remove_trailing_rows(dimension_type n);
-
-  //! Removes the last \p n columns.
-  /*!
-    The last \p n columns of the matrix are all made of zeros.
-    If such an assumption is not met, the behavior is undefined.
-  */
-  void remove_trailing_columns(dimension_type n);
-
-  //! Resizes the matrix copying the old contents.
-  void resize(dimension_type new_n_rows, dimension_type new_n_columns);
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-#ifndef NDEBUG
-  //! Checks whether \p *this is sorted. It does NOT check for duplicates.
-  bool check_sorted() const;
-#endif
-
-private:
-  //! Contains the rows of the matrix.
-  std::vector<Bit_Row> rows;
-
-  //! Size of the initialized part of each row.
-  dimension_type row_size;
-
-  //! Ordering predicate (used when implementing the sort algorithm).
-  /*! \ingroup PPL_CXX_interface */
-  struct Bit_Row_Less_Than {
-    bool operator()(const Bit_Row& x, const Bit_Row& y) const;
-  };
-
-  template <typename Row>
-  friend class Parma_Polyhedra_Library::Linear_System;
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-/*! \relates Bit_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator==(const Bit_Matrix& x, const Bit_Matrix& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are not equal.
-/*! \relates Bit_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator!=(const Bit_Matrix& x, const Bit_Matrix& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Bit_Matrix.inlines.hh"
-
-#endif // !defined(PPL_Bit_Matrix_defs_hh)
diff --git a/src/Bit_Matrix.inlines.hh b/src/Bit_Matrix.inlines.hh
deleted file mode 100644
index 39f614f..0000000
--- a/src/Bit_Matrix.inlines.hh
+++ /dev/null
@@ -1,149 +0,0 @@
-/* Bit_Matrix class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Bit_Matrix_inlines_hh
-#define PPL_Bit_Matrix_inlines_hh 1
-
-#include <algorithm>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Bit_Matrix::Bit_Matrix()
-  : rows(),
-    row_size(0) {
-}
-
-inline dimension_type
-Bit_Matrix::max_num_rows() {
-  return std::vector<Bit_Row>().max_size();
-}
-
-inline
-Bit_Matrix::Bit_Matrix(const dimension_type n_rows,
-		       const dimension_type n_columns)
-  : rows(n_rows),
-    row_size(n_columns) {
-}
-
-inline
-Bit_Matrix::Bit_Matrix(const Bit_Matrix& y)
-  : rows(y.rows),
-    row_size(y.row_size) {
-}
-
-inline
-Bit_Matrix::~Bit_Matrix() {
-}
-
-inline void
-Bit_Matrix::remove_trailing_rows(const dimension_type n) {
-  // The number of rows to be erased cannot be greater
-  // than the actual number of the rows of the matrix.
-  PPL_ASSERT(n <= rows.size());
-  if (n != 0)
-    rows.resize(rows.size() - n);
-  PPL_ASSERT(OK());
-}
-
-inline void
-Bit_Matrix::remove_trailing_columns(const dimension_type n) {
-  // The number of columns to be erased cannot be greater
-  // than the actual number of the columns of the matrix.
-  PPL_ASSERT(n <= row_size);
-  row_size -= n;
-  PPL_ASSERT(OK());
-}
-
-inline void
-Bit_Matrix::m_swap(Bit_Matrix& y) {
-  using std::swap;
-  swap(row_size, y.row_size);
-  swap(rows, y.rows);
-}
-
-inline Bit_Row&
-Bit_Matrix::operator[](const dimension_type k) {
-  PPL_ASSERT(k < rows.size());
-  return rows[k];
-}
-
-inline const Bit_Row&
-Bit_Matrix::operator[](const dimension_type k) const {
-  PPL_ASSERT(k < rows.size());
-  return rows[k];
-}
-
-inline dimension_type
-Bit_Matrix::num_columns() const {
-  return row_size;
-}
-
-inline dimension_type
-Bit_Matrix::num_rows() const {
-  return rows.size();
-}
-
-inline void
-Bit_Matrix::clear() {
-  // Clear `rows' and minimize its capacity.
-  std::vector<Bit_Row> tmp;
-  using std::swap;
-  swap(tmp, rows);
-  row_size = 0;
-}
-
-inline memory_size_type
-Bit_Matrix::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline bool
-Bit_Matrix::Bit_Row_Less_Than::
-operator()(const Bit_Row& x, const Bit_Row& y) const {
-  return compare(x, y) < 0;
-}
-
-inline bool
-Bit_Matrix::sorted_contains(const Bit_Row& row) const {
-  PPL_ASSERT(check_sorted());
-  return std::binary_search(rows.begin(), rows.end(), row,
-			    Bit_Row_Less_Than());
-}
-
-/*! \relates Bit_Matrix */
-inline bool
-operator!=(const Bit_Matrix& x, const Bit_Matrix& y) {
-  return !(x == y);
-}
-
-/*! \relates Bit_Matrix */
-inline void
-swap(Bit_Matrix& x, Bit_Matrix& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Bit_Matrix_inlines_hh)
diff --git a/src/Bit_Matrix.types.hh b/src/Bit_Matrix.types.hh
deleted file mode 100644
index 9186e8f..0000000
--- a/src/Bit_Matrix.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Bit_Matrix_types_hh
-#define PPL_Bit_Matrix_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Bit_Matrix;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Bit_Matrix_types_hh)
diff --git a/src/Bit_Matrix_defs.hh b/src/Bit_Matrix_defs.hh
new file mode 100644
index 0000000..d2b67ee
--- /dev/null
+++ b/src/Bit_Matrix_defs.hh
@@ -0,0 +1,187 @@
+/* Bit_Matrix class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Bit_Matrix_defs_hh
+#define PPL_Bit_Matrix_defs_hh 1
+
+#include "Bit_Matrix_types.hh"
+#include "Linear_System_types.hh"
+#include "Bit_Row_defs.hh"
+#include <vector>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates Bit_Matrix */
+void swap(Bit_Matrix& x, Bit_Matrix& y);
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+} // namespace Parma_Polyhedra_Library
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A matrix of bits.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Bit_Matrix {
+public:
+  //! Default constructor.
+  Bit_Matrix();
+
+  //! Construct a bit matrix with \p n_rows rows and \p n_columns columns.
+  Bit_Matrix(dimension_type n_rows, dimension_type n_columns);
+
+  //! Copy constructor.
+  Bit_Matrix(const Bit_Matrix& y);
+
+  //! Destructor.
+  ~Bit_Matrix();
+
+  //! Assignment operator.
+  Bit_Matrix& operator=(const Bit_Matrix& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Bit_Matrix& y);
+
+  //! Subscript operator.
+  Bit_Row& operator[](dimension_type k);
+
+  //! Constant subscript operator.
+  const Bit_Row& operator[](dimension_type k) const;
+
+  //! Clears the matrix deallocating all its rows.
+  void clear();
+
+  //! Transposes the matrix.
+  void transpose();
+
+  //! Makes \p *this a transposed copy of \p y.
+  void transpose_assign(const Bit_Matrix& y);
+
+  //! Returns the maximum number of rows of a Bit_Matrix.
+  static dimension_type max_num_rows();
+
+  //! Returns the number of columns of \p *this.
+  dimension_type num_columns() const;
+
+  //! Returns the number of rows of \p *this.
+  dimension_type num_rows() const;
+
+  //! Sorts the rows and removes duplicates.
+  void sort_rows();
+
+  //! Looks for \p row in \p *this, which is assumed to be sorted.
+  /*!
+    \return
+    <CODE>true</CODE> if \p row belongs to \p *this, false otherwise.
+
+    \param row
+    The row that will be searched for in the matrix.
+
+    Given a sorted bit matrix (this ensures better efficiency),
+    tells whether it contains the given row.
+  */
+  bool sorted_contains(const Bit_Row& row) const;
+
+  //! Adds \p row to \p *this.
+  /*!
+    \param row
+    The row whose implementation will be recycled.
+
+    The only thing that can be done with \p row upon return is destruction.
+  */
+  void add_recycled_row(Bit_Row& row);
+
+  //! Removes the last \p n rows.
+  void remove_trailing_rows(dimension_type n);
+
+  //! Removes the last \p n columns.
+  /*!
+    The last \p n columns of the matrix are all made of zeros.
+    If such an assumption is not met, the behavior is undefined.
+  */
+  void remove_trailing_columns(dimension_type n);
+
+  //! Resizes the matrix copying the old contents.
+  void resize(dimension_type new_n_rows, dimension_type new_n_columns);
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+#ifndef NDEBUG
+  //! Checks whether \p *this is sorted. It does NOT check for duplicates.
+  bool check_sorted() const;
+#endif
+
+private:
+  //! Contains the rows of the matrix.
+  std::vector<Bit_Row> rows;
+
+  //! Size of the initialized part of each row.
+  dimension_type row_size;
+
+  //! Ordering predicate (used when implementing the sort algorithm).
+  /*! \ingroup PPL_CXX_interface */
+  struct Bit_Row_Less_Than {
+    bool operator()(const Bit_Row& x, const Bit_Row& y) const;
+  };
+
+  template <typename Row>
+  friend class Parma_Polyhedra_Library::Linear_System;
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+/*! \relates Bit_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator==(const Bit_Matrix& x, const Bit_Matrix& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are not equal.
+/*! \relates Bit_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator!=(const Bit_Matrix& x, const Bit_Matrix& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Bit_Matrix_inlines.hh"
+
+#endif // !defined(PPL_Bit_Matrix_defs_hh)
diff --git a/src/Bit_Matrix_inlines.hh b/src/Bit_Matrix_inlines.hh
new file mode 100644
index 0000000..a5e2f96
--- /dev/null
+++ b/src/Bit_Matrix_inlines.hh
@@ -0,0 +1,149 @@
+/* Bit_Matrix class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Bit_Matrix_inlines_hh
+#define PPL_Bit_Matrix_inlines_hh 1
+
+#include <algorithm>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Bit_Matrix::Bit_Matrix()
+  : rows(),
+    row_size(0) {
+}
+
+inline dimension_type
+Bit_Matrix::max_num_rows() {
+  return std::vector<Bit_Row>().max_size();
+}
+
+inline
+Bit_Matrix::Bit_Matrix(const dimension_type n_rows,
+                       const dimension_type n_columns)
+  : rows(n_rows),
+    row_size(n_columns) {
+}
+
+inline
+Bit_Matrix::Bit_Matrix(const Bit_Matrix& y)
+  : rows(y.rows),
+    row_size(y.row_size) {
+}
+
+inline
+Bit_Matrix::~Bit_Matrix() {
+}
+
+inline void
+Bit_Matrix::remove_trailing_rows(const dimension_type n) {
+  // The number of rows to be erased cannot be greater
+  // than the actual number of the rows of the matrix.
+  PPL_ASSERT(n <= rows.size());
+  if (n != 0)
+    rows.resize(rows.size() - n);
+  PPL_ASSERT(OK());
+}
+
+inline void
+Bit_Matrix::remove_trailing_columns(const dimension_type n) {
+  // The number of columns to be erased cannot be greater
+  // than the actual number of the columns of the matrix.
+  PPL_ASSERT(n <= row_size);
+  row_size -= n;
+  PPL_ASSERT(OK());
+}
+
+inline void
+Bit_Matrix::m_swap(Bit_Matrix& y) {
+  using std::swap;
+  swap(row_size, y.row_size);
+  swap(rows, y.rows);
+}
+
+inline Bit_Row&
+Bit_Matrix::operator[](const dimension_type k) {
+  PPL_ASSERT(k < rows.size());
+  return rows[k];
+}
+
+inline const Bit_Row&
+Bit_Matrix::operator[](const dimension_type k) const {
+  PPL_ASSERT(k < rows.size());
+  return rows[k];
+}
+
+inline dimension_type
+Bit_Matrix::num_columns() const {
+  return row_size;
+}
+
+inline dimension_type
+Bit_Matrix::num_rows() const {
+  return rows.size();
+}
+
+inline void
+Bit_Matrix::clear() {
+  // Clear `rows' and minimize its capacity.
+  std::vector<Bit_Row> tmp;
+  using std::swap;
+  swap(tmp, rows);
+  row_size = 0;
+}
+
+inline memory_size_type
+Bit_Matrix::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline bool
+Bit_Matrix::Bit_Row_Less_Than::
+operator()(const Bit_Row& x, const Bit_Row& y) const {
+  return compare(x, y) < 0;
+}
+
+inline bool
+Bit_Matrix::sorted_contains(const Bit_Row& row) const {
+  PPL_ASSERT(check_sorted());
+  return std::binary_search(rows.begin(), rows.end(), row,
+                            Bit_Row_Less_Than());
+}
+
+/*! \relates Bit_Matrix */
+inline bool
+operator!=(const Bit_Matrix& x, const Bit_Matrix& y) {
+  return !(x == y);
+}
+
+/*! \relates Bit_Matrix */
+inline void
+swap(Bit_Matrix& x, Bit_Matrix& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Bit_Matrix_inlines_hh)
diff --git a/src/Bit_Matrix_types.hh b/src/Bit_Matrix_types.hh
new file mode 100644
index 0000000..11bfb42
--- /dev/null
+++ b/src/Bit_Matrix_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Bit_Matrix_types_hh
+#define PPL_Bit_Matrix_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Bit_Matrix;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Bit_Matrix_types_hh)
diff --git a/src/Bit_Row.cc b/src/Bit_Row.cc
index d250197..aabeb21 100644
--- a/src/Bit_Row.cc
+++ b/src/Bit_Row.cc
@@ -1,6 +1,6 @@
 /* Bit_Row class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Bit_Row.defs.hh"
+#include "Bit_Row_defs.hh"
 #include "assert.hh"
 #include "C_Integer.hh"
 
@@ -143,11 +143,11 @@ PPL::Bit_Row::operator[](const unsigned long k) const {
   const mp_size_t vec_size = vec->_mp_size;
   PPL_ASSERT(vec_size >= 0);
 
-  unsigned long i = k / static_cast<unsigned long>(GMP_NUMB_BITS);
+  const unsigned long i = k / static_cast<unsigned long>(GMP_NUMB_BITS);
   if (i >= static_cast<unsigned long>(vec_size))
     return false;
 
-  mp_limb_t limb = *(vec->_mp_d + i);
+  const mp_limb_t limb = *(vec->_mp_d + i);
   return ((limb >> (k % static_cast<unsigned long>(GMP_NUMB_BITS))) & 1U) != 0;
 }
 
@@ -190,7 +190,7 @@ bool
 PPL::subset_or_equal(const Bit_Row& x, const Bit_Row& y) {
   mp_size_t x_size = x.vec->_mp_size;
   PPL_ASSERT(x_size >= 0);
-  mp_size_t y_size = y.vec->_mp_size;
+  const mp_size_t y_size = y.vec->_mp_size;
   PPL_ASSERT(y_size >= 0);
   if (x_size > y_size)
     return false;
@@ -209,10 +209,10 @@ PPL::subset_or_equal(const Bit_Row& x, const Bit_Row& y) {
 /*! \relates Parma_Polyhedra_Library::Bit_Row */
 bool
 PPL::subset_or_equal(const Bit_Row& x, const Bit_Row& y,
-		     bool& strict_subset) {
+                     bool& strict_subset) {
   mp_size_t x_size = x.vec->_mp_size;
   PPL_ASSERT(x_size >= 0);
-  mp_size_t y_size = y.vec->_mp_size;
+  const mp_size_t y_size = y.vec->_mp_size;
   PPL_ASSERT(y_size >= 0);
   if (x_size > y_size)
     return false;
@@ -226,7 +226,7 @@ PPL::subset_or_equal(const Bit_Row& x, const Bit_Row& y,
       xl = *xp;
       yl = *yp;
       if ((xl & ~yl) != 0)
-	return false;
+        return false;
     strict_subset_next:
       ++xp;
       ++yp;
@@ -238,10 +238,10 @@ PPL::subset_or_equal(const Bit_Row& x, const Bit_Row& y,
       xl = *xp;
       yl = *yp;
       if (xl != yl) {
-	if ((xl & ~yl) != 0)
-	  return false;
-	strict_subset = true;
-	goto strict_subset_next;
+        if ((xl & ~yl) != 0)
+          return false;
+        strict_subset = true;
+        goto strict_subset_next;
       }
       ++xp;
       ++yp;
@@ -256,7 +256,7 @@ bool
 PPL::strict_subset(const Bit_Row& x, const Bit_Row& y) {
   mp_size_t x_size = x.vec->_mp_size;
   PPL_ASSERT(x_size >= 0);
-  mp_size_t y_size = y.vec->_mp_size;
+  const mp_size_t y_size = y.vec->_mp_size;
   PPL_ASSERT(y_size >= 0);
   if (x_size > y_size)
     return false;
diff --git a/src/Bit_Row.defs.hh b/src/Bit_Row.defs.hh
deleted file mode 100644
index c9fbec3..0000000
--- a/src/Bit_Row.defs.hh
+++ /dev/null
@@ -1,214 +0,0 @@
-/* Bit_Row class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Bit_Row_defs_hh
-#define PPL_Bit_Row_defs_hh 1
-
-#include "Bit_Row.types.hh"
-#include "globals.types.hh"
-#include <iosfwd>
-#include <gmpxx.h>
-#include <vector>
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates Bit_Row */
-void swap(Bit_Row& x, Bit_Row& y);
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps objects referred by \p x and \p y.
-/*! \relates Bit_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void
-iter_swap(std::vector<Bit_Row>::iterator x,
-          std::vector<Bit_Row>::iterator y);
-
-// Put them in the namespace here to declare them friends later.
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-/*! \relates Bit_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator==(const Bit_Row& x, const Bit_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are not equal.
-/*! \relates Bit_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator!=(const Bit_Row& x, const Bit_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The basic comparison function.
-/*! \relates Bit_Row
-  Compares \p x with \p y starting from the least significant bits.
-  The ordering is total and has the following property: if \p x and \p y
-  are two rows seen as sets of naturals, if \p x is a strict subset
-  of \p y, then \p x comes before \p y.
-
-  Returns
-  - -1 if \p x comes before \p y in the ordering;
-  -  0 if \p x and \p y are equal;
-  -  1 if \p x comes after \p y in the ordering.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-int compare(const Bit_Row& x, const Bit_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Set-theoretic inclusion test.
-/*! \relates Bit_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool subset_or_equal(const Bit_Row& x, const Bit_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Set-theoretic inclusion test: sets \p strict_subset to a Boolean
-  indicating whether the inclusion is strict or not.
-
-  \relates Bit_Row
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool subset_or_equal(const Bit_Row& x, const Bit_Row& y,
-		     bool& strict_subset);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Set-theoretic strict inclusion test.
-/*! \relates Bit_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool strict_subset(const Bit_Row& x, const Bit_Row& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A row in a matrix of bits.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Bit_Row {
-public:
-  //! Default constructor.
-  Bit_Row();
-
-  //! Copy constructor.
-  Bit_Row(const Bit_Row& y);
-
-  //! Set-union constructor.
-  /*!
-    Constructs an object containing the set-union of \p y and \p z.
-  */
-  Bit_Row(const Bit_Row& y, const Bit_Row& z);
-
-  //! Destructor.
-  ~Bit_Row();
-
-  //! Assignment operator.
-  Bit_Row& operator=(const Bit_Row& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Bit_Row& y);
-
-  //! Returns the truth value corresponding to the bit in position \p k.
-  bool operator[](unsigned long k) const;
-
-  //! Sets the bit in position \p k.
-  void set(unsigned long k);
-
-  //! Sets bits up to position \p k (excluded).
-  void set_until(unsigned long k);
-
-  //! Clears the bit in position \p k.
-  void clear(unsigned long k);
-
-  //! Clears bits from position \p k (included) onward.
-  void clear_from(unsigned long k);
-
-  //! Clears all the bits of the row.
-  void clear();
-
-  //! Assigns to \p *this the set-theoretic union of \p x and \p y.
-  void union_assign(const Bit_Row& x, const Bit_Row& y);
-
-  //! Assigns to \p *this the set-theoretic intersection of \p x and \p y.
-  void intersection_assign(const Bit_Row& x, const Bit_Row& y);
-
-  //! Assigns to \p *this the set-theoretic difference of \p x and \p y.
-  void difference_assign(const Bit_Row& x, const Bit_Row& y);
-
-
-  friend int compare(const Bit_Row& x, const Bit_Row& y);
-  friend bool operator==(const Bit_Row& x, const Bit_Row& y);
-  friend bool operator!=(const Bit_Row& x, const Bit_Row& y);
-  friend bool subset_or_equal(const Bit_Row& x, const Bit_Row& y);
-  friend bool subset_or_equal(const Bit_Row& x, const Bit_Row& y,
-			      bool& strict_subset);
-  friend bool strict_subset(const Bit_Row& x, const Bit_Row& y);
-
-  //! Returns the index of the first set bit or ULONG_MAX if no bit is set.
-  unsigned long first() const;
-
-  /*! \brief
-    Returns the index of the first set bit after \p position
-    or ULONG_MAX if no bit after \p position is set.
-  */
-  unsigned long next(unsigned long position) const;
-
-  //! Returns the index of the last set bit or ULONG_MAX if no bit is set.
-  unsigned long last() const;
-
-  /*! \brief
-    Returns the index of the first set bit before \p position
-    or ULONG_MAX if no bits before \p position is set.
-  */
-  unsigned long prev(unsigned long position) const;
-
-  //! Returns the number of set bits in the row.
-  unsigned long count_ones() const;
-
-  //! Returns <CODE>true</CODE> if no bit is set in the row.
-  bool empty() const;
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied
-  bool OK() const;
-
-private:
-  //! Bit-vector representing the row.
-  mpz_t vec;
-
-  //! Assigns to \p *this the union of \p y and \p z.
-  /*!
-    The size of \p y must be be less than or equal to the size of \p z.
-    Upon entry, \p vec must have allocated enough space to contain the result.
-  */
-  void union_helper(const Bit_Row& y, const Bit_Row& z);
-};
-
-#include "Bit_Row.inlines.hh"
-
-#endif // !defined(PPL_Bit_Row_defs_hh)
diff --git a/src/Bit_Row.inlines.hh b/src/Bit_Row.inlines.hh
deleted file mode 100644
index fb10b91..0000000
--- a/src/Bit_Row.inlines.hh
+++ /dev/null
@@ -1,236 +0,0 @@
-/* Bit_Row class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Bit_Row_inlines_hh
-#define PPL_Bit_Row_inlines_hh 1
-
-#include "compiler.hh"
-#include "globals.defs.hh"
-#include "assert.hh"
-
-// For the declaration of ffs(3).
-#if defined(PPL_HAVE_STRINGS_H)
-# include <strings.h>
-#elif defined(PPL_HAVE_STRING_H)
-# include <string.h>
-#endif
-
-#define PPL_BITS_PER_GMP_LIMB sizeof_to_bits(PPL_SIZEOF_MP_LIMB_T)
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Bit_Row::Bit_Row() {
-  mpz_init(vec);
-}
-
-inline
-Bit_Row::Bit_Row(const Bit_Row& y) {
-  mpz_init_set(vec, y.vec);
-}
-
-inline
-Bit_Row::Bit_Row(const Bit_Row& y, const Bit_Row& z) {
-  const mp_size_t y_size = y.vec->_mp_size;
-  PPL_ASSERT(y_size >= 0);
-  const mp_size_t z_size = z.vec->_mp_size;
-  PPL_ASSERT(z_size >= 0);
-  if (y_size < z_size) {
-    PPL_ASSERT(static_cast<unsigned long>(z_size)
-               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
-    mpz_init2(vec, static_cast<unsigned long>(z_size) * PPL_BITS_PER_GMP_LIMB);
-    union_helper(y, z);
-  }
-  else {
-    PPL_ASSERT(static_cast<unsigned long>(y_size)
-               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
-    mpz_init2(vec, static_cast<unsigned long>(y_size) * PPL_BITS_PER_GMP_LIMB);
-    union_helper(z, y);
-  }
-}
-
-inline
-Bit_Row::~Bit_Row() {
-  mpz_clear(vec);
-}
-
-inline Bit_Row&
-Bit_Row::operator=(const Bit_Row& y) {
-  mpz_set(vec, y.vec);
-  return *this;
-}
-
-inline void
-Bit_Row::set(const unsigned long k) {
-  mpz_setbit(vec, k);
-}
-
-inline void
-Bit_Row::clear(const unsigned long k) {
-  mpz_clrbit(vec, k);
-}
-
-inline void
-Bit_Row::clear_from(const unsigned long k) {
-  mpz_tdiv_r_2exp(vec, vec, k);
-}
-
-inline unsigned long
-Bit_Row::count_ones() const {
-  mp_size_t x_size = vec->_mp_size;
-  PPL_ASSERT(x_size >= 0);
-  return (x_size == 0) ? 0 : mpn_popcount(vec->_mp_d, x_size);
-}
-
-inline bool
-Bit_Row::empty() const {
-  return mpz_sgn(vec) == 0;
-}
-
-inline void
-Bit_Row::m_swap(Bit_Row& y) {
-  mpz_swap(vec, y.vec);
-}
-
-inline void
-Bit_Row::clear() {
-  mpz_set_ui(vec, 0UL);
-}
-
-inline memory_size_type
-Bit_Row::external_memory_in_bytes() const {
-  return static_cast<memory_size_type>(vec[0]._mp_alloc) * PPL_SIZEOF_MP_LIMB_T;
-}
-
-inline memory_size_type
-Bit_Row::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline void
-Bit_Row::union_assign(const Bit_Row& x, const Bit_Row& y) {
-  const mp_size_t x_size = x.vec->_mp_size;
-  PPL_ASSERT(x_size >= 0);
-  const mp_size_t y_size = y.vec->_mp_size;
-  PPL_ASSERT(y_size >= 0);
-  if (x_size < y_size) {
-    PPL_ASSERT(static_cast<unsigned long>(y_size)
-               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
-    mpz_realloc2(vec, static_cast<unsigned long>(y_size) * PPL_BITS_PER_GMP_LIMB);
-    union_helper(x, y);
-  }
-  else {
-    PPL_ASSERT(static_cast<unsigned long>(x_size)
-               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
-    mpz_realloc2(vec, static_cast<unsigned long>(x_size) * PPL_BITS_PER_GMP_LIMB);
-    union_helper(y, x);
-  }
-}
-
-inline void
-Bit_Row::intersection_assign(const Bit_Row& x, const Bit_Row& y) {
-  mpz_and(vec, x.vec, y.vec);
-}
-
-inline void
-Bit_Row::difference_assign(const Bit_Row& x, const Bit_Row& y) {
-  PPL_DIRTY_TEMP(mpz_class, complement_y);
-  mpz_com(complement_y.get_mpz_t(), y.vec);
-  mpz_and(vec, x.vec, complement_y.get_mpz_t());
-}
-
-namespace Implementation {
-
-/*! \brief
-  Assuming \p u is nonzero, returns the index of the first set bit in \p u.
-*/
-inline unsigned int
-first_one(unsigned int u) {
-  return ctz(u);
-}
-
-/*! \brief
-  Assuming \p ul is nonzero, returns the index of the first set bit in
-  \p ul.
-*/
-inline unsigned int
-first_one(unsigned long ul) {
-  return ctz(ul);
-}
-
-/*! \brief
-  Assuming \p ull is nonzero, returns the index of the first set bit in
-  \p ull.
-*/
-inline unsigned int
-first_one(unsigned long long ull) {
-  return ctz(ull);
-}
-
-/*! \brief
-  Assuming \p u is nonzero, returns the index of the last set bit in \p u.
-*/
-inline unsigned int
-last_one(unsigned int u) {
-  return static_cast<unsigned int>(sizeof_to_bits(sizeof(u)))
-    - 1U - clz(u);
-}
-
-/*! \brief
-  Assuming \p ul is nonzero, returns the index of the last set bit in
-  \p ul.
-*/
-inline unsigned int
-last_one(unsigned long ul) {
-  return static_cast<unsigned int>(sizeof_to_bits(sizeof(ul)))
-    - 1U - clz(ul);
-}
-
-/*! \brief
-  Assuming \p ull is nonzero, returns the index of the last set bit in
-  \p ull.
-*/
-inline unsigned int
-last_one(unsigned long long ull) {
-  return static_cast<unsigned int>(sizeof_to_bits(sizeof(ull)))
-    - 1U - clz(ull);
-}
-
-} // namespace Implementation
-
-/*! \relates Bit_Row */
-inline void
-swap(Bit_Row& x, Bit_Row& y) {
-  x.m_swap(y);
-}
-
-/*! \relates Bit_Row */
-inline void
-iter_swap(std::vector<Bit_Row>::iterator x,
-          std::vector<Bit_Row>::iterator y) {
-  swap(*x, *y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Bit_Row_inlines_hh)
diff --git a/src/Bit_Row.types.hh b/src/Bit_Row.types.hh
deleted file mode 100644
index a38b48d..0000000
--- a/src/Bit_Row.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Bit_Row_types_hh
-#define PPL_Bit_Row_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Bit_Row;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Bit_Row_types_hh)
diff --git a/src/Bit_Row_defs.hh b/src/Bit_Row_defs.hh
new file mode 100644
index 0000000..d51f39a
--- /dev/null
+++ b/src/Bit_Row_defs.hh
@@ -0,0 +1,214 @@
+/* Bit_Row class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Bit_Row_defs_hh
+#define PPL_Bit_Row_defs_hh 1
+
+#include "Bit_Row_types.hh"
+#include "globals_types.hh"
+#include <iosfwd>
+#include <gmpxx.h>
+#include <vector>
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates Bit_Row */
+void swap(Bit_Row& x, Bit_Row& y);
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps objects referred by \p x and \p y.
+/*! \relates Bit_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void
+iter_swap(std::vector<Bit_Row>::iterator x,
+          std::vector<Bit_Row>::iterator y);
+
+// Put them in the namespace here to declare them friends later.
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+/*! \relates Bit_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator==(const Bit_Row& x, const Bit_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are not equal.
+/*! \relates Bit_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator!=(const Bit_Row& x, const Bit_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The basic comparison function.
+/*! \relates Bit_Row
+  Compares \p x with \p y starting from the least significant bits.
+  The ordering is total and has the following property: if \p x and \p y
+  are two rows seen as sets of naturals, if \p x is a strict subset
+  of \p y, then \p x comes before \p y.
+
+  Returns
+  - -1 if \p x comes before \p y in the ordering;
+  -  0 if \p x and \p y are equal;
+  -  1 if \p x comes after \p y in the ordering.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+int compare(const Bit_Row& x, const Bit_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Set-theoretic inclusion test.
+/*! \relates Bit_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool subset_or_equal(const Bit_Row& x, const Bit_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Set-theoretic inclusion test: sets \p strict_subset to a Boolean
+  indicating whether the inclusion is strict or not.
+
+  \relates Bit_Row
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool subset_or_equal(const Bit_Row& x, const Bit_Row& y,
+                     bool& strict_subset);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Set-theoretic strict inclusion test.
+/*! \relates Bit_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool strict_subset(const Bit_Row& x, const Bit_Row& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A row in a matrix of bits.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Bit_Row {
+public:
+  //! Default constructor.
+  Bit_Row();
+
+  //! Copy constructor.
+  Bit_Row(const Bit_Row& y);
+
+  //! Set-union constructor.
+  /*!
+    Constructs an object containing the set-union of \p y and \p z.
+  */
+  Bit_Row(const Bit_Row& y, const Bit_Row& z);
+
+  //! Destructor.
+  ~Bit_Row();
+
+  //! Assignment operator.
+  Bit_Row& operator=(const Bit_Row& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Bit_Row& y);
+
+  //! Returns the truth value corresponding to the bit in position \p k.
+  bool operator[](unsigned long k) const;
+
+  //! Sets the bit in position \p k.
+  void set(unsigned long k);
+
+  //! Sets bits up to position \p k (excluded).
+  void set_until(unsigned long k);
+
+  //! Clears the bit in position \p k.
+  void clear(unsigned long k);
+
+  //! Clears bits from position \p k (included) onward.
+  void clear_from(unsigned long k);
+
+  //! Clears all the bits of the row.
+  void clear();
+
+  //! Assigns to \p *this the set-theoretic union of \p x and \p y.
+  void union_assign(const Bit_Row& x, const Bit_Row& y);
+
+  //! Assigns to \p *this the set-theoretic intersection of \p x and \p y.
+  void intersection_assign(const Bit_Row& x, const Bit_Row& y);
+
+  //! Assigns to \p *this the set-theoretic difference of \p x and \p y.
+  void difference_assign(const Bit_Row& x, const Bit_Row& y);
+
+
+  friend int compare(const Bit_Row& x, const Bit_Row& y);
+  friend bool operator==(const Bit_Row& x, const Bit_Row& y);
+  friend bool operator!=(const Bit_Row& x, const Bit_Row& y);
+  friend bool subset_or_equal(const Bit_Row& x, const Bit_Row& y);
+  friend bool subset_or_equal(const Bit_Row& x, const Bit_Row& y,
+                              bool& strict_subset);
+  friend bool strict_subset(const Bit_Row& x, const Bit_Row& y);
+
+  //! Returns the index of the first set bit or ULONG_MAX if no bit is set.
+  unsigned long first() const;
+
+  /*! \brief
+    Returns the index of the first set bit after \p position
+    or ULONG_MAX if no bit after \p position is set.
+  */
+  unsigned long next(unsigned long position) const;
+
+  //! Returns the index of the last set bit or ULONG_MAX if no bit is set.
+  unsigned long last() const;
+
+  /*! \brief
+    Returns the index of the first set bit before \p position
+    or ULONG_MAX if no bits before \p position is set.
+  */
+  unsigned long prev(unsigned long position) const;
+
+  //! Returns the number of set bits in the row.
+  unsigned long count_ones() const;
+
+  //! Returns <CODE>true</CODE> if no bit is set in the row.
+  bool empty() const;
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied
+  bool OK() const;
+
+private:
+  //! Bit-vector representing the row.
+  mpz_t vec;
+
+  //! Assigns to \p *this the union of \p y and \p z.
+  /*!
+    The size of \p y must be be less than or equal to the size of \p z.
+    Upon entry, \p vec must have allocated enough space to contain the result.
+  */
+  void union_helper(const Bit_Row& y, const Bit_Row& z);
+};
+
+#include "Bit_Row_inlines.hh"
+
+#endif // !defined(PPL_Bit_Row_defs_hh)
diff --git a/src/Bit_Row_inlines.hh b/src/Bit_Row_inlines.hh
new file mode 100644
index 0000000..ccb700b
--- /dev/null
+++ b/src/Bit_Row_inlines.hh
@@ -0,0 +1,236 @@
+/* Bit_Row class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Bit_Row_inlines_hh
+#define PPL_Bit_Row_inlines_hh 1
+
+#include "compiler.hh"
+#include "globals_defs.hh"
+#include "assert.hh"
+
+// For the declaration of ffs(3).
+#if defined(PPL_HAVE_STRINGS_H)
+# include <strings.h>
+#elif defined(PPL_HAVE_STRING_H)
+# include <string.h>
+#endif
+
+#define PPL_BITS_PER_GMP_LIMB sizeof_to_bits(PPL_SIZEOF_MP_LIMB_T)
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Bit_Row::Bit_Row() {
+  mpz_init(vec);
+}
+
+inline
+Bit_Row::Bit_Row(const Bit_Row& y) {
+  mpz_init_set(vec, y.vec);
+}
+
+inline
+Bit_Row::Bit_Row(const Bit_Row& y, const Bit_Row& z) {
+  const mp_size_t y_size = y.vec->_mp_size;
+  PPL_ASSERT(y_size >= 0);
+  const mp_size_t z_size = z.vec->_mp_size;
+  PPL_ASSERT(z_size >= 0);
+  if (y_size < z_size) {
+    PPL_ASSERT(static_cast<unsigned long>(z_size)
+               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
+    mpz_init2(vec, static_cast<unsigned long>(z_size) * PPL_BITS_PER_GMP_LIMB);
+    union_helper(y, z);
+  }
+  else {
+    PPL_ASSERT(static_cast<unsigned long>(y_size)
+               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
+    mpz_init2(vec, static_cast<unsigned long>(y_size) * PPL_BITS_PER_GMP_LIMB);
+    union_helper(z, y);
+  }
+}
+
+inline
+Bit_Row::~Bit_Row() {
+  mpz_clear(vec);
+}
+
+inline Bit_Row&
+Bit_Row::operator=(const Bit_Row& y) {
+  mpz_set(vec, y.vec);
+  return *this;
+}
+
+inline void
+Bit_Row::set(const unsigned long k) {
+  mpz_setbit(vec, k);
+}
+
+inline void
+Bit_Row::clear(const unsigned long k) {
+  mpz_clrbit(vec, k);
+}
+
+inline void
+Bit_Row::clear_from(const unsigned long k) {
+  mpz_tdiv_r_2exp(vec, vec, k);
+}
+
+inline unsigned long
+Bit_Row::count_ones() const {
+  const mp_size_t x_size = vec->_mp_size;
+  PPL_ASSERT(x_size >= 0);
+  return (x_size == 0) ? 0 : mpn_popcount(vec->_mp_d, x_size);
+}
+
+inline bool
+Bit_Row::empty() const {
+  return mpz_sgn(vec) == 0;
+}
+
+inline void
+Bit_Row::m_swap(Bit_Row& y) {
+  mpz_swap(vec, y.vec);
+}
+
+inline void
+Bit_Row::clear() {
+  mpz_set_ui(vec, 0UL);
+}
+
+inline memory_size_type
+Bit_Row::external_memory_in_bytes() const {
+  return static_cast<memory_size_type>(vec[0]._mp_alloc) * PPL_SIZEOF_MP_LIMB_T;
+}
+
+inline memory_size_type
+Bit_Row::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline void
+Bit_Row::union_assign(const Bit_Row& x, const Bit_Row& y) {
+  const mp_size_t x_size = x.vec->_mp_size;
+  PPL_ASSERT(x_size >= 0);
+  const mp_size_t y_size = y.vec->_mp_size;
+  PPL_ASSERT(y_size >= 0);
+  if (x_size < y_size) {
+    PPL_ASSERT(static_cast<unsigned long>(y_size)
+               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
+    mpz_realloc2(vec, static_cast<unsigned long>(y_size) * PPL_BITS_PER_GMP_LIMB);
+    union_helper(x, y);
+  }
+  else {
+    PPL_ASSERT(static_cast<unsigned long>(x_size)
+               <= C_Integer<unsigned long>::max / PPL_BITS_PER_GMP_LIMB);
+    mpz_realloc2(vec, static_cast<unsigned long>(x_size) * PPL_BITS_PER_GMP_LIMB);
+    union_helper(y, x);
+  }
+}
+
+inline void
+Bit_Row::intersection_assign(const Bit_Row& x, const Bit_Row& y) {
+  mpz_and(vec, x.vec, y.vec);
+}
+
+inline void
+Bit_Row::difference_assign(const Bit_Row& x, const Bit_Row& y) {
+  PPL_DIRTY_TEMP(mpz_class, complement_y);
+  mpz_com(complement_y.get_mpz_t(), y.vec);
+  mpz_and(vec, x.vec, complement_y.get_mpz_t());
+}
+
+namespace Implementation {
+
+/*! \brief
+  Assuming \p u is nonzero, returns the index of the first set bit in \p u.
+*/
+inline unsigned int
+first_one(unsigned int u) {
+  return ctz(u);
+}
+
+/*! \brief
+  Assuming \p ul is nonzero, returns the index of the first set bit in
+  \p ul.
+*/
+inline unsigned int
+first_one(unsigned long ul) {
+  return ctz(ul);
+}
+
+/*! \brief
+  Assuming \p ull is nonzero, returns the index of the first set bit in
+  \p ull.
+*/
+inline unsigned int
+first_one(unsigned long long ull) {
+  return ctz(ull);
+}
+
+/*! \brief
+  Assuming \p u is nonzero, returns the index of the last set bit in \p u.
+*/
+inline unsigned int
+last_one(unsigned int u) {
+  return static_cast<unsigned int>(sizeof_to_bits(sizeof(u)))
+    - 1U - clz(u);
+}
+
+/*! \brief
+  Assuming \p ul is nonzero, returns the index of the last set bit in
+  \p ul.
+*/
+inline unsigned int
+last_one(unsigned long ul) {
+  return static_cast<unsigned int>(sizeof_to_bits(sizeof(ul)))
+    - 1U - clz(ul);
+}
+
+/*! \brief
+  Assuming \p ull is nonzero, returns the index of the last set bit in
+  \p ull.
+*/
+inline unsigned int
+last_one(unsigned long long ull) {
+  return static_cast<unsigned int>(sizeof_to_bits(sizeof(ull)))
+    - 1U - clz(ull);
+}
+
+} // namespace Implementation
+
+/*! \relates Bit_Row */
+inline void
+swap(Bit_Row& x, Bit_Row& y) {
+  x.m_swap(y);
+}
+
+/*! \relates Bit_Row */
+inline void
+iter_swap(std::vector<Bit_Row>::iterator x,
+          std::vector<Bit_Row>::iterator y) {
+  swap(*x, *y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Bit_Row_inlines_hh)
diff --git a/src/Bit_Row_types.hh b/src/Bit_Row_types.hh
new file mode 100644
index 0000000..7206d43
--- /dev/null
+++ b/src/Bit_Row_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Bit_Row_types_hh
+#define PPL_Bit_Row_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Bit_Row;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Bit_Row_types_hh)
diff --git a/src/Boundary.defs.hh b/src/Boundary.defs.hh
deleted file mode 100644
index 082b633..0000000
--- a/src/Boundary.defs.hh
+++ /dev/null
@@ -1,738 +0,0 @@
-/* Interval boundary functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Boundary_defs_hh
-#define PPL_Boundary_defs_hh 1
-
-#include "Checked_Number.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Boundary_NS {
-
-struct Property {
-  enum Type {
-    SPECIAL_,
-    OPEN_,
-  };
-  typedef bool Value;
-  static const Value default_value = true;
-  static const Value unsupported_value = false;
-  Property(Type t)
-    : type(t) {
-  }
-  Type type;
-};
-
-static const Property SPECIAL(Property::SPECIAL_);
-static const Property OPEN(Property::OPEN_);
-
-enum Boundary_Type {
-  LOWER = ROUND_DOWN,
-  UPPER = ROUND_UP
-};
-
-inline Rounding_Dir
-round_dir_check(Boundary_Type t, bool check = false) {
-  if (check)
-    return static_cast<Rounding_Dir>(t) | ROUND_STRICT_RELATION;
-  else
-    return static_cast<Rounding_Dir>(t);
-}
-
-template <typename T, typename Info>
-inline Result
-special_set_boundary_infinity(Boundary_Type type, T&, Info& info) {
-  PPL_ASSERT(Info::store_special);
-  info.set_boundary_property(type, SPECIAL);
-  return V_EQ;
-}
-
-template <typename T, typename Info>
-inline bool
-special_is_open(Boundary_Type, const T&, const Info&) {
-  return !Info::may_contain_infinity;
-}
-
-template <typename T, typename Info>
-inline bool
-normal_is_open(Boundary_Type type, const T& x, const Info& info) {
-  if (Info::store_open)
-    return info.get_boundary_property(type, OPEN);
-  else
-    return !Info::store_special && !Info::may_contain_infinity
-      && normal_is_boundary_infinity(type, x, info);
-}
-
-template <typename T, typename Info>
-inline bool
-is_open(Boundary_Type type, const T& x, const Info& info) {
-  if (Info::store_open)
-    return info.get_boundary_property(type, OPEN);
-  else
-    return !Info::may_contain_infinity
-      && is_boundary_infinity(type, x, info);
-}
-
-template <typename T, typename Info>
-inline Result
-set_unbounded(Boundary_Type type, T& x, Info& info) {
-  PPL_COMPILE_TIME_CHECK(Info::store_special
-                         || std::numeric_limits<T>::is_bounded
-                         || std::numeric_limits<T>::has_infinity,
-                         "unbounded is not representable");
-  Result r;
-  if (Info::store_special)
-    r = special_set_boundary_infinity(type, x, info);
-  else if (type == LOWER)
-    r = assign_r(x, MINUS_INFINITY, ROUND_UP);
-  else
-    r = assign_r(x, PLUS_INFINITY, ROUND_DOWN);
-  if (result_relation(r) == VR_EQ && !Info::may_contain_infinity)
-    info.set_boundary_property(type, OPEN);
-  return r;
-}
-
-template <typename T, typename Info>
-inline Result
-set_minus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
-  /*
-  PPL_COMPILE_TIME_CHECK(Info::store_special
-                         || std::numeric_limits<T>::has_infinity,
-                         "minus infinity is not representable");
-  */
-  if (open) {
-    PPL_ASSERT(type == LOWER);
-  }
-  else {
-    PPL_ASSERT(Info::may_contain_infinity);
-  }
-  Result r;
-  if (Info::store_special) {
-    PPL_ASSERT(type == LOWER);
-    r = special_set_boundary_infinity(type, x, info);
-  }
-  else {
-    r = assign_r(x, MINUS_INFINITY, round_dir_check(type));
-    PPL_ASSERT(result_representable(r));
-  }
-  if (open || result_relation(r) != VR_EQ)
-    info.set_boundary_property(type, OPEN);
-  return r;
-}
-
-template <typename T, typename Info>
-inline Result
-set_plus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
-  /*
-  PPL_COMPILE_TIME_CHECK(Info::store_special
-                         || std::numeric_limits<T>::has_infinity,
-                         "minus infinity is not representable");
-  */
-  if (open) {
-    PPL_ASSERT(type == UPPER);
-  }
-  else {
-    PPL_ASSERT(Info::may_contain_infinity);
-  }
-  Result r;
-  if (Info::store_special) {
-    PPL_ASSERT(type == UPPER);
-    r = special_set_boundary_infinity(type, x, info);
-  }
-  else {
-    r = assign_r(x, PLUS_INFINITY, round_dir_check(type));
-    PPL_ASSERT(result_representable(r));
-  }
-  if (open || result_relation(r) != VR_EQ)
-    info.set_boundary_property(type, OPEN);
-  return r;
-}
-
-template <typename T, typename Info>
-inline Result
-set_boundary_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
-  PPL_ASSERT(open || Info::may_contain_infinity);
-  Result r;
-  if (Info::store_special)
-    r = special_set_boundary_infinity(type, x, info);
-  else if (type == LOWER)
-    r = assign_r(x, MINUS_INFINITY, round_dir_check(type));
-  else
-    r = assign_r(x, PLUS_INFINITY, round_dir_check(type));
-  PPL_ASSERT(result_representable(r));
-  if (open)
-    info.set_boundary_property(type, OPEN);
-  return r;
-}
-
-template <typename T, typename Info>
-inline bool
-is_domain_inf(Boundary_Type type, const T& x, const Info& info) {
-  if (Info::store_special && type == LOWER)
-    return info.get_boundary_property(type, SPECIAL);
-  else if (std::numeric_limits<T>::has_infinity)
-    return Parma_Polyhedra_Library::is_minus_infinity(x);
-  else if (std::numeric_limits<T>::is_bounded)
-    return x == std::numeric_limits<T>::min();
-  else
-    return false;
-}
-
-template <typename T, typename Info>
-inline bool
-is_domain_sup(Boundary_Type type, const T& x, const Info& info) {
-  if (Info::store_special && type == UPPER)
-    return info.get_boundary_property(type, SPECIAL);
-  else if (std::numeric_limits<T>::has_infinity)
-    return Parma_Polyhedra_Library::is_plus_infinity(x);
-  else if (std::numeric_limits<T>::is_bounded)
-      return x == std::numeric_limits<T>::max();
-  else
-    return false;
-}
-
-template <typename T, typename Info>
-inline bool
-normal_is_boundary_infinity(Boundary_Type type, const T& x, const Info&) {
-  if (!std::numeric_limits<T>::has_infinity)
-    return false;
-  if (type == LOWER)
-    return Parma_Polyhedra_Library::is_minus_infinity(x);
-  else
-    return Parma_Polyhedra_Library::is_plus_infinity(x);
-}
-
-template <typename T, typename Info>
-inline bool
-is_boundary_infinity(Boundary_Type type, const T& x, const Info& info) {
-  if (Info::store_special)
-    return info.get_boundary_property(type, SPECIAL);
-  else
-    return normal_is_boundary_infinity(type, x, info);
-}
-
-template <typename T, typename Info>
-inline bool
-normal_is_reverse_infinity(Boundary_Type type, const T& x, const Info&) {
-  if (!Info::may_contain_infinity)
-    return false;
-  else if (type == LOWER)
-    return Parma_Polyhedra_Library::is_plus_infinity(x);
-  else
-    return Parma_Polyhedra_Library::is_minus_infinity(x);
-}
-
-template <typename T, typename Info>
-inline bool
-is_minus_infinity(Boundary_Type type, const T& x, const Info& info) {
-  if (type == LOWER) {
-    if (Info::store_special)
-      return info.get_boundary_property(type, SPECIAL);
-    else
-      return normal_is_boundary_infinity(type, x, info);
-  }
-  else
-    return !Info::store_special && normal_is_reverse_infinity(type, x, info);
-}
-
-template <typename T, typename Info>
-inline bool
-is_plus_infinity(Boundary_Type type, const T& x, const Info& info) {
-  if (type == UPPER) {
-    if (Info::store_special)
-      return info.get_boundary_property(type, SPECIAL);
-    else
-      return normal_is_boundary_infinity(type, x, info);
-  }
-  else
-    return !Info::store_special && normal_is_reverse_infinity(type, x, info);
-}
-
-template <typename T, typename Info>
-inline bool
-is_reverse_infinity(Boundary_Type type, const T& x, const Info& info) {
-  return normal_is_reverse_infinity(type, x, info);
-}
-
-template <typename T, typename Info>
-inline int
-infinity_sign(Boundary_Type type, const T& x, const Info& info) {
-  if (is_boundary_infinity(type, x, info))
-    return (type == LOWER) ? -1 : 1;
-  else if (is_reverse_infinity(type, x, info))
-    return (type == UPPER) ? -1 : 1;
-  else
-    return 0;
-}
-
-template <typename T, typename Info>
-inline bool
-is_boundary_infinity_closed(Boundary_Type type, const T& x, const Info& info) {
-  return Info::may_contain_infinity
-    && !info.get_boundary_property(type, OPEN)
-    && is_boundary_infinity(type, x, info);
-}
-
-template <typename Info>
-inline bool
-boundary_infinity_is_open(Boundary_Type type, const Info& info) {
-  return !Info::may_contain_infinity
-    || info.get_boundary_property(type, OPEN);
-}
-
-template <typename T, typename Info>
-inline int
-sgn_b(Boundary_Type type, const T& x, const Info& info) {
-  if (info.get_boundary_property(type, SPECIAL))
-    return (type == LOWER) ? -1 : 1;
-  else
-    // The following Parma_Polyhedra_Library:: qualification is to work
-    // around a bug of GCC 4.0.x.
-    return Parma_Polyhedra_Library::sgn(x);
-}
-
-template <typename T, typename Info>
-inline int
-sgn(Boundary_Type type, const T& x, const Info& info) {
-  int sign = sgn_b(type, x, info);
-  if (x == 0 && info.get_boundary_property(type, OPEN))
-    return (type == LOWER) ? -1 : 1;
-  else
-    return sign;
-}
-
-template <typename T1, typename Info1, typename T2, typename Info2>
-inline bool
-eq(Boundary_Type type1, const T1& x1, const Info1& info1,
-   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  if (type1 == type2) {
-    if (is_open(type1, x1, info1)
-	!= is_open(type2, x2, info2))
-      return false;
-  }
-  else if (is_open(type1, x1, info1)
-	   || is_open(type2, x2, info2))
-    return false;
-  if (is_minus_infinity(type1, x1, info1))
-    return is_minus_infinity(type2, x2, info2);
-  else if (is_plus_infinity(type1, x1, info1))
-    return is_plus_infinity(type2, x2, info2);
-  else if (is_minus_infinity(type2, x2, info2)
-           || is_plus_infinity(type2, x2, info2))
-    return false;
-  else
-    return equal(x1, x2);
-}
-
-template <typename T1, typename Info1, typename T2, typename Info2>
-inline bool
-lt(Boundary_Type type1, const T1& x1, const Info1& info1,
-   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  if (is_open(type1, x1, info1)) {
-    if (type1 == UPPER
-	&& (type2 == LOWER
-	    || !is_open(type2, x2, info2)))
-      goto le;
-  }
-  else if (type2 == LOWER
-	   && is_open(type2, x2, info2)) {
-  le:
-    if (is_minus_infinity(type1, x1, info1)
-	|| is_plus_infinity(type2, x2, info2))
-      return true;
-    if (is_plus_infinity(type1, x1, info1)
-	|| is_minus_infinity(type2, x2, info2))
-      return false;
-    else
-      return less_or_equal(x1, x2);
-  }
-  if (is_plus_infinity(type1, x1, info1)
-      || is_minus_infinity(type2, x2, info2))
-    return false;
-  if (is_minus_infinity(type1, x1, info1)
-      || is_plus_infinity(type2, x2, info2))
-    return true;
-  else
-    return less_than(x1, x2);
-}
-
-template <typename T1, typename Info1, typename T2, typename Info2>
-inline bool
-gt(Boundary_Type type1, const T1& x1, const Info1& info1,
-   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  return lt(type2, x2, info2, type1, x1, info1);
-}
-
-template <typename T1, typename Info1, typename T2, typename Info2>
-inline bool
-le(Boundary_Type type1, const T1& x1, const Info1& info1,
-   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  return !gt(type1, x1, info1, type2, x2, info2);
-}
-
-template <typename T1, typename Info1, typename T2, typename Info2>
-inline bool
-ge(Boundary_Type type1, const T1& x1, const Info1& info1,
-   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  return !lt(type1, x1, info1, type2, x2, info2);
-}
-
-template <typename T, typename Info>
-inline Result
-adjust_boundary(Boundary_Type type, T& x, Info& info,
-		bool open, Result r) {
-  r = result_relation_class(r);
-  if (type == LOWER) {
-    switch (r) {
-    case V_GT_MINUS_INFINITY:
-      open = true;
-      /* Fall through */
-    case V_EQ_MINUS_INFINITY:
-      if (!Info::store_special)
-	return r;
-      if (open)
-	info.set_boundary_property(type, OPEN);
-      return special_set_boundary_infinity(type, x, info);
-    case V_GT:
-      open = true;
-      /* Fall through */
-    case V_GE:
-    case V_EQ:
-      if (open)
-        info.set_boundary_property(type, OPEN);
-      return r;
-    default:
-      PPL_UNREACHABLE;
-      return V_NAN;
-    }
-  }
-  else {
-    switch (r) {
-    case V_LT_PLUS_INFINITY:
-      open = true;
-      /* Fall through */
-    case V_EQ_PLUS_INFINITY:
-      if (!Info::store_special)
-	return r;
-      if (open)
-	info.set_boundary_property(type, OPEN);
-      return special_set_boundary_infinity(type, x, info);
-    case V_LT:
-      open = true;
-      /* Fall through */
-    case V_LE:
-    case V_EQ:
-      if (open)
-        info.set_boundary_property(type, OPEN);
-      return r;
-    default:
-      PPL_UNREACHABLE;
-      return V_NAN;
-    }
-  }
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-complement(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
-  PPL_ASSERT(to_type != type);
-  bool should_shrink;
-  if (info.get_boundary_property(type, SPECIAL)) {
-    should_shrink = !special_is_open(type, x, info);
-    if (type == LOWER)
-      return set_minus_infinity(to_type, to, to_info, should_shrink);
-    else
-      return set_plus_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = !normal_is_open(type, x, info);
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = assign_r(to, x, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-assign(Boundary_Type to_type, To& to, To_Info& to_info,
-       Boundary_Type type, const T& x, const Info& info,
-       bool should_shrink = false) {
-  PPL_ASSERT(to_type == type);
-  if (info.get_boundary_property(type, SPECIAL)) {
-    should_shrink = (should_shrink || special_is_open(type, x, info));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = (should_shrink || normal_is_open(type, x, info));
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = assign_r(to, x, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
-  if (lt(type, x, info, to_type, to, to_info)) {
-    to_info.clear_boundary_properties(to_type);
-    return assign(to_type, to, to_info, type, x, info);
-  }
-  return V_EQ;
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  if (lt(type1, x1, info1, type2, x2, info2))
-    return assign(to_type, to, to_info, type1, x1, info1);
-  else
-    return assign(to_type, to, to_info, type2, x2, info2);
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
-  if (gt(type, x, info, to_type, to, to_info)) {
-    to_info.clear_boundary_properties(to_type);
-    return assign(to_type, to, to_info, type, x, info);
-  }
-  return V_EQ;
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  if (gt(type1, x1, info1, type2, x2, info2))
-    return assign(to_type, to, to_info, type1, x1, info1);
-  else
-    return assign(to_type, to, to_info, type2, x2, info2);
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-neg_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
-  PPL_ASSERT(to_type != type);
-  bool should_shrink;
-  if (info.get_boundary_property(type, SPECIAL)) {
-    should_shrink = special_is_open(type, x, info);
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = normal_is_open(type, x, info);
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = neg_assign_r(to, x, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-add_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  PPL_ASSERT(type1 == type2);
-  bool should_shrink;
-  if (is_boundary_infinity(type1, x1, info1)) {
-    should_shrink = (boundary_infinity_is_open(type1, info1)
-                     && !is_boundary_infinity_closed(type2, x2, info2));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  else if (is_boundary_infinity(type2, x2, info2)) {
-    should_shrink = (boundary_infinity_is_open(type2, info2)
-                     && !is_boundary_infinity_closed(type1, x1, info1));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = (normal_is_open(type1, x1, info1)
-                   || normal_is_open(type2, x2, info2));
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  // FIXME: extended handling is not needed
-  Result r = add_assign_r(to, x1, x2, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-sub_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  PPL_ASSERT(type1 != type2);
-  bool should_shrink;
-  if (is_boundary_infinity(type1, x1, info1)) {
-    should_shrink = (boundary_infinity_is_open(type1, info1)
-                     && !is_boundary_infinity_closed(type2, x2, info2));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  else if (is_boundary_infinity(type2, x2, info2)) {
-    should_shrink = (boundary_infinity_is_open(type2, info2)
-                     && !is_boundary_infinity_closed(type1, x1, info1));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = (normal_is_open(type1, x1, info1)
-                   || normal_is_open(type2, x2, info2));
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  // FIXME: extended handling is not needed
-  Result r = sub_assign_r(to, x1, x2, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-mul_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  bool should_shrink;
-  if (is_boundary_infinity(type1, x1, info1)) {
-    should_shrink = (boundary_infinity_is_open(type1, info1)
-                     && !is_boundary_infinity_closed(type2, x2, info2));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  else if (is_boundary_infinity(type2, x2, info2)) {
-    should_shrink = (boundary_infinity_is_open(type2, info2)
-                     && !is_boundary_infinity_closed(type1, x1, info1));
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = (normal_is_open(type1, x1, info1)
-                   || normal_is_open(type2, x2, info2));
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  PPL_ASSERT(x1 != Constant<0>::value && x2 != Constant<0>::value);
-  // FIXME: extended handling is not needed
-  Result r = mul_assign_r(to, x1, x2, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info>
-inline Result
-set_zero(Boundary_Type to_type, To& to, To_Info& to_info, bool should_shrink) {
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = assign_r(to, Constant<0>::value, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-mul_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
-	     Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
-	     Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
-  bool should_shrink;
-  if (x1s != 0) {
-    if (x2s != 0)
-      return mul_assign(to_type, to, to_info,
-			type1, x1, info1,
-			type2, x2, info2);
-    else
-      should_shrink = info2.get_boundary_property(type2, OPEN);
-  }
-  else {
-    should_shrink = (info1.get_boundary_property(type1, OPEN)
-                     && (x2s != 0 || info2.get_boundary_property(type2, OPEN)));
-  }
-  return set_zero(to_type, to, to_info, should_shrink);
-}
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-div_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
-  bool should_shrink;
-  if (is_boundary_infinity(type1, x1, info1)) {
-    should_shrink = boundary_infinity_is_open(type1, info1);
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  else if (is_boundary_infinity(type2, x2, info2)) {
-    should_shrink = boundary_infinity_is_open(type2, info2);
-    return set_zero(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = (normal_is_open(type1, x1, info1)
-                   || normal_is_open(type2, x2, info2));
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  PPL_ASSERT(x1 != Constant<0>::value && x2 != Constant<0>::value);
-  // FIXME: extended handling is not needed
-  Result r = div_assign_r(to, x1, x2, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-
-template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
-inline Result
-div_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
-	     Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
-	     Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
-  if (x1s != 0) {
-    if (x2s != 0)
-      return div_assign(to_type, to, to_info,
-			type1, x1, info1,
-			type2, x2, info2);
-    else {
-      return set_boundary_infinity(to_type, to, to_info, true);
-    }
-  }
-  else {
-    bool should_shrink = info1.get_boundary_property(type1, OPEN)
-      && !is_boundary_infinity_closed(type2, x2, info2);
-    return set_zero(to_type, to, to_info, should_shrink);
-  }
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-umod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-		 Boundary_Type type, const T& x, const Info& info,
-		 unsigned int exp) {
-  PPL_ASSERT(to_type == type);
-  bool should_shrink;
-  if (is_boundary_infinity(type, x, info)) {
-    should_shrink = boundary_infinity_is_open(type, info);
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = normal_is_open(type, x, info);
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = umod_2exp_assign_r(to, x, exp, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-template <typename To, typename To_Info, typename T, typename Info>
-inline Result
-smod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-		 Boundary_Type type, const T& x, const Info& info,
-		 unsigned int exp) {
-  PPL_ASSERT(to_type == type);
-  bool should_shrink;
-  if (is_boundary_infinity(type, x, info)) {
-    should_shrink = boundary_infinity_is_open(type, info);
-    return set_boundary_infinity(to_type, to, to_info, should_shrink);
-  }
-  should_shrink = normal_is_open(type, x, info);
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = smod_2exp_assign_r(to, x, exp, round_dir_check(to_type, check));
-  return adjust_boundary(to_type, to, to_info, should_shrink, r);
-}
-
-} // namespace Boundary_NS
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Boundary_defs_hh)
diff --git a/src/Boundary_defs.hh b/src/Boundary_defs.hh
new file mode 100644
index 0000000..b00fe51
--- /dev/null
+++ b/src/Boundary_defs.hh
@@ -0,0 +1,729 @@
+/* Interval boundary functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Boundary_defs_hh
+#define PPL_Boundary_defs_hh 1
+
+#include "Checked_Number_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Boundary_NS {
+
+struct Property {
+  enum Type {
+    SPECIAL_,
+    OPEN_,
+  };
+  typedef bool Value;
+  static const Value default_value = true;
+  static const Value unsupported_value = false;
+  Property(Type t)
+    : type(t) {
+  }
+  Type type;
+};
+
+static const Property SPECIAL(Property::SPECIAL_);
+static const Property OPEN(Property::OPEN_);
+
+enum Boundary_Type {
+  LOWER = ROUND_DOWN,
+  UPPER = ROUND_UP
+};
+
+inline Rounding_Dir
+round_dir_check(Boundary_Type t, bool check = false) {
+  if (check)
+    return static_cast<Rounding_Dir>(t) | ROUND_STRICT_RELATION;
+  else
+    return static_cast<Rounding_Dir>(t);
+}
+
+template <typename T, typename Info>
+inline Result
+special_set_boundary_infinity(Boundary_Type type, T&, Info& info) {
+  PPL_ASSERT(Info::store_special);
+  info.set_boundary_property(type, SPECIAL);
+  return V_EQ;
+}
+
+template <typename T, typename Info>
+inline bool
+special_is_open(Boundary_Type, const T&, const Info&) {
+  return !Info::may_contain_infinity;
+}
+
+template <typename T, typename Info>
+inline bool
+normal_is_open(Boundary_Type type, const T& x, const Info& info) {
+  if (Info::store_open)
+    return info.get_boundary_property(type, OPEN);
+  else
+    return !Info::store_special && !Info::may_contain_infinity
+      && normal_is_boundary_infinity(type, x, info);
+}
+
+template <typename T, typename Info>
+inline bool
+is_open(Boundary_Type type, const T& x, const Info& info) {
+  if (Info::store_open)
+    return info.get_boundary_property(type, OPEN);
+  else
+    return !Info::may_contain_infinity
+      && is_boundary_infinity(type, x, info);
+}
+
+template <typename T, typename Info>
+inline Result
+set_unbounded(Boundary_Type type, T& x, Info& info) {
+  PPL_COMPILE_TIME_CHECK(Info::store_special
+                         || std::numeric_limits<T>::is_bounded
+                         || std::numeric_limits<T>::has_infinity,
+                         "unbounded is not representable");
+  Result r;
+  if (Info::store_special)
+    r = special_set_boundary_infinity(type, x, info);
+  else if (type == LOWER)
+    r = assign_r(x, MINUS_INFINITY, ROUND_UP);
+  else
+    r = assign_r(x, PLUS_INFINITY, ROUND_DOWN);
+  if (result_relation(r) == VR_EQ && !Info::may_contain_infinity)
+    info.set_boundary_property(type, OPEN);
+  return r;
+}
+
+template <typename T, typename Info>
+inline Result
+set_minus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
+  if (open) {
+    PPL_ASSERT(type == LOWER);
+  }
+  else {
+    PPL_ASSERT(Info::may_contain_infinity);
+  }
+  Result r;
+  if (Info::store_special) {
+    PPL_ASSERT(type == LOWER);
+    r = special_set_boundary_infinity(type, x, info);
+  }
+  else {
+    r = assign_r(x, MINUS_INFINITY, round_dir_check(type));
+    PPL_ASSERT(result_representable(r));
+  }
+  if (open || result_relation(r) != VR_EQ)
+    info.set_boundary_property(type, OPEN);
+  return r;
+}
+
+template <typename T, typename Info>
+inline Result
+set_plus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
+  if (open) {
+    PPL_ASSERT(type == UPPER);
+  }
+  else {
+    PPL_ASSERT(Info::may_contain_infinity);
+  }
+  Result r;
+  if (Info::store_special) {
+    PPL_ASSERT(type == UPPER);
+    r = special_set_boundary_infinity(type, x, info);
+  }
+  else {
+    r = assign_r(x, PLUS_INFINITY, round_dir_check(type));
+    PPL_ASSERT(result_representable(r));
+  }
+  if (open || result_relation(r) != VR_EQ)
+    info.set_boundary_property(type, OPEN);
+  return r;
+}
+
+template <typename T, typename Info>
+inline Result
+set_boundary_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
+  PPL_ASSERT(open || Info::may_contain_infinity);
+  Result r;
+  if (Info::store_special)
+    r = special_set_boundary_infinity(type, x, info);
+  else if (type == LOWER)
+    r = assign_r(x, MINUS_INFINITY, round_dir_check(type));
+  else
+    r = assign_r(x, PLUS_INFINITY, round_dir_check(type));
+  PPL_ASSERT(result_representable(r));
+  if (open)
+    info.set_boundary_property(type, OPEN);
+  return r;
+}
+
+template <typename T, typename Info>
+inline bool
+is_domain_inf(Boundary_Type type, const T& x, const Info& info) {
+  if (Info::store_special && type == LOWER)
+    return info.get_boundary_property(type, SPECIAL);
+  else if (std::numeric_limits<T>::has_infinity)
+    return Parma_Polyhedra_Library::is_minus_infinity(x);
+  else if (std::numeric_limits<T>::is_bounded)
+    return x == std::numeric_limits<T>::min();
+  else
+    return false;
+}
+
+template <typename T, typename Info>
+inline bool
+is_domain_sup(Boundary_Type type, const T& x, const Info& info) {
+  if (Info::store_special && type == UPPER)
+    return info.get_boundary_property(type, SPECIAL);
+  else if (std::numeric_limits<T>::has_infinity)
+    return Parma_Polyhedra_Library::is_plus_infinity(x);
+  else if (std::numeric_limits<T>::is_bounded)
+      return x == std::numeric_limits<T>::max();
+  else
+    return false;
+}
+
+template <typename T, typename Info>
+inline bool
+normal_is_boundary_infinity(Boundary_Type type, const T& x, const Info&) {
+  if (!std::numeric_limits<T>::has_infinity)
+    return false;
+  if (type == LOWER)
+    return Parma_Polyhedra_Library::is_minus_infinity(x);
+  else
+    return Parma_Polyhedra_Library::is_plus_infinity(x);
+}
+
+template <typename T, typename Info>
+inline bool
+is_boundary_infinity(Boundary_Type type, const T& x, const Info& info) {
+  if (Info::store_special)
+    return info.get_boundary_property(type, SPECIAL);
+  else
+    return normal_is_boundary_infinity(type, x, info);
+}
+
+template <typename T, typename Info>
+inline bool
+normal_is_reverse_infinity(Boundary_Type type, const T& x, const Info&) {
+  if (!Info::may_contain_infinity)
+    return false;
+  else if (type == LOWER)
+    return Parma_Polyhedra_Library::is_plus_infinity(x);
+  else
+    return Parma_Polyhedra_Library::is_minus_infinity(x);
+}
+
+template <typename T, typename Info>
+inline bool
+is_minus_infinity(Boundary_Type type, const T& x, const Info& info) {
+  if (type == LOWER) {
+    if (Info::store_special)
+      return info.get_boundary_property(type, SPECIAL);
+    else
+      return normal_is_boundary_infinity(type, x, info);
+  }
+  else
+    return !Info::store_special && normal_is_reverse_infinity(type, x, info);
+}
+
+template <typename T, typename Info>
+inline bool
+is_plus_infinity(Boundary_Type type, const T& x, const Info& info) {
+  if (type == UPPER) {
+    if (Info::store_special)
+      return info.get_boundary_property(type, SPECIAL);
+    else
+      return normal_is_boundary_infinity(type, x, info);
+  }
+  else
+    return !Info::store_special && normal_is_reverse_infinity(type, x, info);
+}
+
+template <typename T, typename Info>
+inline bool
+is_reverse_infinity(Boundary_Type type, const T& x, const Info& info) {
+  return normal_is_reverse_infinity(type, x, info);
+}
+
+template <typename T, typename Info>
+inline int
+infinity_sign(Boundary_Type type, const T& x, const Info& info) {
+  if (is_boundary_infinity(type, x, info))
+    return (type == LOWER) ? -1 : 1;
+  else if (is_reverse_infinity(type, x, info))
+    return (type == UPPER) ? -1 : 1;
+  else
+    return 0;
+}
+
+template <typename T, typename Info>
+inline bool
+is_boundary_infinity_closed(Boundary_Type type, const T& x, const Info& info) {
+  return Info::may_contain_infinity
+    && !info.get_boundary_property(type, OPEN)
+    && is_boundary_infinity(type, x, info);
+}
+
+template <typename Info>
+inline bool
+boundary_infinity_is_open(Boundary_Type type, const Info& info) {
+  return !Info::may_contain_infinity
+    || info.get_boundary_property(type, OPEN);
+}
+
+template <typename T, typename Info>
+inline int
+sgn_b(Boundary_Type type, const T& x, const Info& info) {
+  if (info.get_boundary_property(type, SPECIAL))
+    return (type == LOWER) ? -1 : 1;
+  else
+    // The following Parma_Polyhedra_Library:: qualification is to work
+    // around a bug of GCC 4.0.x.
+    return Parma_Polyhedra_Library::sgn(x);
+}
+
+template <typename T, typename Info>
+inline int
+sgn(Boundary_Type type, const T& x, const Info& info) {
+  int sign = sgn_b(type, x, info);
+  if (x == 0 && info.get_boundary_property(type, OPEN))
+    return (type == LOWER) ? -1 : 1;
+  else
+    return sign;
+}
+
+template <typename T1, typename Info1, typename T2, typename Info2>
+inline bool
+eq(Boundary_Type type1, const T1& x1, const Info1& info1,
+   Boundary_Type type2, const T2& x2, const Info2& info2) {
+  if (type1 == type2) {
+    if (is_open(type1, x1, info1)
+        != is_open(type2, x2, info2))
+      return false;
+  }
+  else if (is_open(type1, x1, info1)
+           || is_open(type2, x2, info2))
+    return false;
+  if (is_minus_infinity(type1, x1, info1))
+    return is_minus_infinity(type2, x2, info2);
+  else if (is_plus_infinity(type1, x1, info1))
+    return is_plus_infinity(type2, x2, info2);
+  else if (is_minus_infinity(type2, x2, info2)
+           || is_plus_infinity(type2, x2, info2))
+    return false;
+  else
+    return equal(x1, x2);
+}
+
+template <typename T1, typename Info1, typename T2, typename Info2>
+inline bool
+lt(Boundary_Type type1, const T1& x1, const Info1& info1,
+   Boundary_Type type2, const T2& x2, const Info2& info2) {
+  if (is_open(type1, x1, info1)) {
+    if (type1 == UPPER
+        && (type2 == LOWER
+            || !is_open(type2, x2, info2)))
+      goto le;
+  }
+  else if (type2 == LOWER
+           && is_open(type2, x2, info2)) {
+  le:
+    if (is_minus_infinity(type1, x1, info1)
+        || is_plus_infinity(type2, x2, info2))
+      return true;
+    if (is_plus_infinity(type1, x1, info1)
+        || is_minus_infinity(type2, x2, info2))
+      return false;
+    else
+      return less_or_equal(x1, x2);
+  }
+  if (is_plus_infinity(type1, x1, info1)
+      || is_minus_infinity(type2, x2, info2))
+    return false;
+  if (is_minus_infinity(type1, x1, info1)
+      || is_plus_infinity(type2, x2, info2))
+    return true;
+  else
+    return less_than(x1, x2);
+}
+
+template <typename T1, typename Info1, typename T2, typename Info2>
+inline bool
+gt(Boundary_Type type1, const T1& x1, const Info1& info1,
+   Boundary_Type type2, const T2& x2, const Info2& info2) {
+  return lt(type2, x2, info2, type1, x1, info1);
+}
+
+template <typename T1, typename Info1, typename T2, typename Info2>
+inline bool
+le(Boundary_Type type1, const T1& x1, const Info1& info1,
+   Boundary_Type type2, const T2& x2, const Info2& info2) {
+  return !gt(type1, x1, info1, type2, x2, info2);
+}
+
+template <typename T1, typename Info1, typename T2, typename Info2>
+inline bool
+ge(Boundary_Type type1, const T1& x1, const Info1& info1,
+   Boundary_Type type2, const T2& x2, const Info2& info2) {
+  return !lt(type1, x1, info1, type2, x2, info2);
+}
+
+template <typename T, typename Info>
+inline Result
+adjust_boundary(Boundary_Type type, T& x, Info& info,
+                bool open, Result r) {
+  r = result_relation_class(r);
+  if (type == LOWER) {
+    switch (r) {
+    case V_GT_MINUS_INFINITY:
+      open = true;
+      /* Fall through */
+    case V_EQ_MINUS_INFINITY:
+      if (!Info::store_special)
+        return r;
+      if (open)
+        info.set_boundary_property(type, OPEN);
+      return special_set_boundary_infinity(type, x, info);
+    case V_GT:
+      open = true;
+      /* Fall through */
+    case V_GE:
+    case V_EQ:
+      if (open)
+        info.set_boundary_property(type, OPEN);
+      return r;
+    default:
+      PPL_UNREACHABLE;
+      return V_NAN;
+    }
+  }
+  else {
+    switch (r) {
+    case V_LT_PLUS_INFINITY:
+      open = true;
+      /* Fall through */
+    case V_EQ_PLUS_INFINITY:
+      if (!Info::store_special)
+        return r;
+      if (open)
+        info.set_boundary_property(type, OPEN);
+      return special_set_boundary_infinity(type, x, info);
+    case V_LT:
+      open = true;
+      /* Fall through */
+    case V_LE:
+    case V_EQ:
+      if (open)
+        info.set_boundary_property(type, OPEN);
+      return r;
+    default:
+      PPL_UNREACHABLE;
+      return V_NAN;
+    }
+  }
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+complement(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type, const T& x, const Info& info) {
+  PPL_ASSERT(to_type != type);
+  bool should_shrink;
+  if (info.get_boundary_property(type, SPECIAL)) {
+    should_shrink = !special_is_open(type, x, info);
+    if (type == LOWER)
+      return set_minus_infinity(to_type, to, to_info, should_shrink);
+    else
+      return set_plus_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = !normal_is_open(type, x, info);
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  Result r = assign_r(to, x, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+assign(Boundary_Type to_type, To& to, To_Info& to_info,
+       Boundary_Type type, const T& x, const Info& info,
+       bool should_shrink = false) {
+  PPL_ASSERT(to_type == type);
+  if (info.get_boundary_property(type, SPECIAL)) {
+    should_shrink = (should_shrink || special_is_open(type, x, info));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = (should_shrink || normal_is_open(type, x, info));
+  const bool check
+    = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  const Result r = assign_r(to, x, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type, const T& x, const Info& info) {
+  if (lt(type, x, info, to_type, to, to_info)) {
+    to_info.clear_boundary_properties(to_type);
+    return assign(to_type, to, to_info, type, x, info);
+  }
+  return V_EQ;
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
+  if (lt(type1, x1, info1, type2, x2, info2))
+    return assign(to_type, to, to_info, type1, x1, info1);
+  else
+    return assign(to_type, to, to_info, type2, x2, info2);
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type, const T& x, const Info& info) {
+  if (gt(type, x, info, to_type, to, to_info)) {
+    to_info.clear_boundary_properties(to_type);
+    return assign(to_type, to, to_info, type, x, info);
+  }
+  return V_EQ;
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
+  if (gt(type1, x1, info1, type2, x2, info2))
+    return assign(to_type, to, to_info, type1, x1, info1);
+  else
+    return assign(to_type, to, to_info, type2, x2, info2);
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+neg_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type, const T& x, const Info& info) {
+  PPL_ASSERT(to_type != type);
+  bool should_shrink;
+  if (info.get_boundary_property(type, SPECIAL)) {
+    should_shrink = special_is_open(type, x, info);
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = normal_is_open(type, x, info);
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  Result r = neg_assign_r(to, x, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+add_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
+  PPL_ASSERT(type1 == type2);
+  bool should_shrink;
+  if (is_boundary_infinity(type1, x1, info1)) {
+    should_shrink = (boundary_infinity_is_open(type1, info1)
+                     && !is_boundary_infinity_closed(type2, x2, info2));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  else if (is_boundary_infinity(type2, x2, info2)) {
+    should_shrink = (boundary_infinity_is_open(type2, info2)
+                     && !is_boundary_infinity_closed(type1, x1, info1));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = (normal_is_open(type1, x1, info1)
+                   || normal_is_open(type2, x2, info2));
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  // FIXME: extended handling is not needed
+  Result r = add_assign_r(to, x1, x2, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+sub_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
+  PPL_ASSERT(type1 != type2);
+  bool should_shrink;
+  if (is_boundary_infinity(type1, x1, info1)) {
+    should_shrink = (boundary_infinity_is_open(type1, info1)
+                     && !is_boundary_infinity_closed(type2, x2, info2));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  else if (is_boundary_infinity(type2, x2, info2)) {
+    should_shrink = (boundary_infinity_is_open(type2, info2)
+                     && !is_boundary_infinity_closed(type1, x1, info1));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = (normal_is_open(type1, x1, info1)
+                   || normal_is_open(type2, x2, info2));
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  // FIXME: extended handling is not needed
+  Result r = sub_assign_r(to, x1, x2, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+mul_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
+  bool should_shrink;
+  if (is_boundary_infinity(type1, x1, info1)) {
+    should_shrink = (boundary_infinity_is_open(type1, info1)
+                     && !is_boundary_infinity_closed(type2, x2, info2));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  else if (is_boundary_infinity(type2, x2, info2)) {
+    should_shrink = (boundary_infinity_is_open(type2, info2)
+                     && !is_boundary_infinity_closed(type1, x1, info1));
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = (normal_is_open(type1, x1, info1)
+                   || normal_is_open(type2, x2, info2));
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  PPL_ASSERT(x1 != Constant<0>::value && x2 != Constant<0>::value);
+  // FIXME: extended handling is not needed
+  Result r = mul_assign_r(to, x1, x2, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info>
+inline Result
+set_zero(Boundary_Type to_type, To& to, To_Info& to_info, bool should_shrink) {
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  Result r = assign_r(to, Constant<0>::value, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+mul_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
+             Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
+             Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
+  bool should_shrink;
+  if (x1s != 0) {
+    if (x2s != 0)
+      return mul_assign(to_type, to, to_info,
+                        type1, x1, info1,
+                        type2, x2, info2);
+    else
+      should_shrink = info2.get_boundary_property(type2, OPEN);
+  }
+  else {
+    should_shrink = (info1.get_boundary_property(type1, OPEN)
+                     && (x2s != 0 || info2.get_boundary_property(type2, OPEN)));
+  }
+  return set_zero(to_type, to, to_info, should_shrink);
+}
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+div_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
+  bool should_shrink;
+  if (is_boundary_infinity(type1, x1, info1)) {
+    should_shrink = boundary_infinity_is_open(type1, info1);
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  else if (is_boundary_infinity(type2, x2, info2)) {
+    should_shrink = boundary_infinity_is_open(type2, info2);
+    return set_zero(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = (normal_is_open(type1, x1, info1)
+                   || normal_is_open(type2, x2, info2));
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  PPL_ASSERT(x1 != Constant<0>::value && x2 != Constant<0>::value);
+  // FIXME: extended handling is not needed
+  Result r = div_assign_r(to, x1, x2, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+
+template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
+inline Result
+div_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
+             Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
+             Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
+  if (x1s != 0) {
+    if (x2s != 0)
+      return div_assign(to_type, to, to_info,
+                        type1, x1, info1,
+                        type2, x2, info2);
+    else {
+      return set_boundary_infinity(to_type, to, to_info, true);
+    }
+  }
+  else {
+    bool should_shrink = info1.get_boundary_property(type1, OPEN)
+      && !is_boundary_infinity_closed(type2, x2, info2);
+    return set_zero(to_type, to, to_info, should_shrink);
+  }
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+umod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+                 Boundary_Type type, const T& x, const Info& info,
+                 unsigned int exp) {
+  PPL_ASSERT(to_type == type);
+  bool should_shrink;
+  if (is_boundary_infinity(type, x, info)) {
+    should_shrink = boundary_infinity_is_open(type, info);
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = normal_is_open(type, x, info);
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  Result r = umod_2exp_assign_r(to, x, exp, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+template <typename To, typename To_Info, typename T, typename Info>
+inline Result
+smod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
+                 Boundary_Type type, const T& x, const Info& info,
+                 unsigned int exp) {
+  PPL_ASSERT(to_type == type);
+  bool should_shrink;
+  if (is_boundary_infinity(type, x, info)) {
+    should_shrink = boundary_infinity_is_open(type, info);
+    return set_boundary_infinity(to_type, to, to_info, should_shrink);
+  }
+  should_shrink = normal_is_open(type, x, info);
+  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  Result r = smod_2exp_assign_r(to, x, exp, round_dir_check(to_type, check));
+  return adjust_boundary(to_type, to, to_info, should_shrink, r);
+}
+
+} // namespace Boundary_NS
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Boundary_defs_hh)
diff --git a/src/Box.cc b/src/Box.cc
index aaa1462..07ca2ab 100644
--- a/src/Box.cc
+++ b/src/Box.cc
@@ -1,6 +1,6 @@
 /* Box class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Box.defs.hh"
+#include "Box_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
diff --git a/src/Box.defs.hh b/src/Box.defs.hh
deleted file mode 100644
index c8d667f..0000000
--- a/src/Box.defs.hh
+++ /dev/null
@@ -1,2286 +0,0 @@
-/* Box class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Box_defs_hh
-#define PPL_Box_defs_hh 1
-
-#include "Box.types.hh"
-#include "globals.types.hh"
-#include "Coefficient.defs.hh"
-#include "Variable.types.hh"
-#include "Variables_Set.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint.types.hh"
-#include "Constraint.defs.hh"
-#include "Constraint_System.types.hh"
-#include "Generator.types.hh"
-#include "Generator_System.types.hh"
-#include "Congruence.types.hh"
-#include "Congruence_System.types.hh"
-#include "BD_Shape.types.hh"
-#include "Octagonal_Shape.types.hh"
-#include "Poly_Con_Relation.types.hh"
-#include "Poly_Gen_Relation.types.hh"
-#include "Polyhedron.types.hh"
-#include "Grid.types.hh"
-#include "Partially_Reduced_Product.types.hh"
-#include "intervals.defs.hh"
-#include "Interval.types.hh"
-#include "Linear_Form.types.hh"
-#include <vector>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-struct Interval_Base;
-
-//! Swaps \p x with \p y.
-/*! \relates Box */
-template <typename ITV>
-void swap(Box<ITV>& x, Box<ITV>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are the same box.
-/*! \relates Box
-  Note that \p x and \p y may be dimension-incompatible boxes:
-  in this case, the value <CODE>false</CODE> is returned.
-*/
-template <typename ITV>
-bool operator==(const Box<ITV>& x, const Box<ITV>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are not the same box.
-/*! \relates Box
-  Note that \p x and \p y may be dimension-incompatible boxes:
-  in this case, the value <CODE>true</CODE> is returned.
-*/
-template <typename ITV>
-bool operator!=(const Box<ITV>& x, const Box<ITV>& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Box */
-template <typename ITV>
-std::ostream& operator<<(std::ostream& s, const Box<ITV>& box);
-
-} // namespace IO_Operators
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Box
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename ITV>
-bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Box
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename ITV>
-bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Box
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename ITV>
-bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Box
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename ITV>
-bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Box
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename ITV>
-bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Box
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename ITV>
-bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Box
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename ITV>
-bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Box
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename ITV>
-bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Box
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename ITV>
-bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Box
-  Helper function for computing distances.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Specialization,
-	  typename Temp, typename To, typename ITV>
-bool
-l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const Box<ITV>& x, const Box<ITV>& y,
-		    Rounding_Dir dir,
-		    Temp& tmp0, Temp& tmp1, Temp& tmp2);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A not necessarily closed, iso-oriented hyperrectangle.
-/*! \ingroup PPL_CXX_interface
-  A Box object represents the smash product of \f$n\f$
-  not necessarily closed and possibly unbounded intervals
-  represented by objects of class \p ITV,
-  where \f$n\f$ is the space dimension of the box.
-
-  An <EM>interval constraint</EM> (resp., <EM>interval congruence</EM>)
-  is a syntactic constraint (resp., congruence) that only mentions
-  a single space dimension.
-
-  The Box domain <EM>optimally supports</EM>:
-    - tautological and inconsistent constraints and congruences;
-    - the interval constraints that are optimally supported by
-      the template argument class \c ITV;
-    - the interval congruences that are optimally supported by
-      the template argument class \c ITV.
-
-  Depending on the method, using a constraint or congruence that is not
-  optimally supported by the domain will either raise an exception or
-  result in a (possibly non-optimal) upward approximation.
-
-  The user interface for the Box domain is meant to be as similar
-  as possible to the one developed for the polyhedron class C_Polyhedron.
-*/
-template <typename ITV>
-class Parma_Polyhedra_Library::Box {
-public:
-  //! The type of intervals used to implement the box.
-  typedef ITV interval_type;
-
-  //! Returns the maximum space dimension that a Box can handle.
-  static dimension_type max_space_dimension();
-
-  /*! \brief
-    Returns false indicating that this domain does not recycle constraints
-  */
-  static bool can_recycle_constraint_systems();
-
-  /*! \brief
-    Returns false indicating that this domain does not recycle congruences
-  */
-  static bool can_recycle_congruence_systems();
-
-  //! \name Constructors, Assignment, Swap and Destructor
-  //@{
-
-  //! Builds a universe or empty box of the specified space dimension.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the box;
-
-    \param kind
-    Specifies whether the universe or the empty box has to be built.
-  */
-  explicit Box(dimension_type num_dimensions = 0,
-	       Degenerate_Element kind = UNIVERSE);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  Box(const Box& y,
-      Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a conservative, upward approximation of \p y.
-  /*!
-    The complexity argument is ignored.
-  */
-  template <typename Other_ITV>
-  explicit Box(const Box<Other_ITV>& y,
-               Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a box from the system of constraints \p cs.
-  /*!
-    The box inherits the space dimension of \p cs.
-
-    \param cs
-    A system of constraints: constraints that are not
-    \ref intervals "interval constraints"
-    are ignored (even though they may have contributed
-    to the space dimension).
-  */
-  explicit Box(const Constraint_System& cs);
-
-  //! Builds a box recycling a system of constraints \p cs.
-  /*!
-    The box inherits the space dimension of \p cs.
-
-    \param cs
-    A system of constraints: constraints that are not
-    \ref intervals "interval constraints"
-    are ignored (even though they may have contributed
-    to the space dimension).
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-  */
-  Box(const Constraint_System& cs, Recycle_Input dummy);
-
-  //! Builds a box from the system of generators \p gs.
-  /*!
-    Builds the smallest box containing the polyhedron defined by \p gs.
-    The box inherits the space dimension of \p gs.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-  */
-  explicit Box(const Generator_System& gs);
-
-  //! Builds a box recycling the system of generators \p gs.
-  /*!
-    Builds the smallest box containing the polyhedron defined by \p gs.
-    The box inherits the space dimension of \p gs.
-
-    \param gs
-    The generator system describing the polyhedron to be approximated.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-  */
-  Box(const Generator_System& gs, Recycle_Input dummy);
-
-  /*!
-    Builds the smallest box containing the grid defined by a
-    system of congruences \p cgs.
-    The box inherits the space dimension of \p cgs.
-
-    \param cgs
-    A system of congruences: congruences that are not
-    non-relational equality constraints are ignored
-    (though they may have contributed to the space dimension).
-  */
-  explicit Box(const Congruence_System& cgs);
-
-  /*!
-    Builds the smallest box containing the grid defined by a
-    system of congruences \p cgs, recycling \p cgs.
-    The box inherits the space dimension of \p cgs.
-
-    \param cgs
-    A system of congruences: congruences that are not
-    non-relational equality constraints are ignored
-    (though they will contribute to the space dimension).
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-  */
-  Box(const Congruence_System& cgs, Recycle_Input dummy);
-
-  //! Builds a box containing the BDS \p bds.
-  /*!
-    Builds the smallest box containing \p bds using a polynomial algorithm.
-    The \p complexity argument is ignored.
-  */
-  template <typename T>
-  explicit Box(const BD_Shape<T>& bds,
-	       Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
-
-  //! Builds a box containing the octagonal shape \p oct.
-  /*!
-    Builds the smallest box containing \p oct using a polynomial algorithm.
-    The \p complexity argument is ignored.
-  */
-  template <typename T>
-  explicit Box(const Octagonal_Shape<T>& oct,
-	       Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
-
-  //! Builds a box containing the polyhedron \p ph.
-  /*!
-    Builds a box containing \p ph using algorithms whose complexity
-    does not exceed the one specified by \p complexity.  If
-    \p complexity is \p ANY_COMPLEXITY, then the built box is the
-    smallest one containing \p ph.
-  */
-  explicit Box(const Polyhedron& ph,
-	       Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a box containing the grid \p gr.
-  /*!
-    Builds the smallest box containing \p gr using a polynomial algorithm.
-    The \p complexity argument is ignored.
-  */
-  explicit Box(const Grid& gr,
-	       Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
-
-  //! Builds a box containing the partially reduced product \p dp.
-  /*!
-    Builds a box containing \p ph using algorithms whose complexity
-    does not exceed the one specified by \p complexity.
-  */
-  template <typename D1, typename D2, typename R>
-  explicit Box(const Partially_Reduced_Product<D1, D2, R>& dp,
-	       Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator
-    (\p *this and \p y can be dimension-incompatible).
-  */
-  Box& operator=(const Box& y);
-
-  /*! \brief
-    Swaps \p *this with \p y
-    (\p *this and \p y can be dimension-incompatible).
-  */
-  void m_swap(Box& y);
-
-  //@} Constructors, Assignment, Swap and Destructor
-
-  //! \name Member Functions that Do Not Modify the Box
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
-    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
-    of \p *this.
-  */
-  dimension_type affine_dimension() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is an empty box.
-  bool is_empty() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a universe box.
-  bool is_universe() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a topologically closed subset of the vector space.
-  */
-  bool is_topologically_closed() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
-  bool is_discrete() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a bounded box.
-  bool is_bounded() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains at least one integer point.
-  */
-  bool contains_integer_point() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  bool constrains(Variable var) const;
-
-  //! Returns the relations holding between \p *this and the constraint \p c.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  //! Returns the relations holding between \p *this and the congruence \p cg.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p cg are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  //! Returns the relations holding between \p *this and the generator \p g.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  Poly_Gen_Relation relation_with(const Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from above in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from below in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
-    and \p maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value;
-
-    \param g
-    When maximization succeeds, will be assigned the point or
-    closure point where \p expr reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p g are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value;
-
-    \param g
-    When minimization succeeds, will be assigned a point or
-    closure point where \p expr reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p g are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if there exist a
-    unique value \p val such that \p *this
-    saturates the equality <CODE>expr = val</CODE>.
-
-    \param expr
-    The linear expression for which the frequency is needed;
-
-    \param freq_n
-    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
-    Present for interface compatibility with class Grid, where
-    the \ref Grid_Frequency "frequency" can have a non-zero value;
-
-    \param freq_d
-    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
-
-    \param val_n
-    The numerator of \p val;
-
-    \param val_d
-    The denominator of \p val;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
-    \p val_n and \p val_d are left untouched.
-  */
-  bool frequency(const Linear_Expression& expr,
-                 Coefficient& freq_n, Coefficient& freq_d,
-                 Coefficient& val_n, Coefficient& val_d) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this contains \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are dimension-incompatible.
-  */
-  bool contains(const Box& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are dimension-incompatible.
-  */
-  bool strictly_contains(const Box& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
-
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are dimension-incompatible.
-  */
-  bool is_disjoint_from(const Box& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this satisfies
-    all its invariants.
-  */
-  bool OK() const;
-
-  //@} Member Functions that Do Not Modify the Box
-
-  //! \name Space-Dimension Preserving Member Functions that May Modify the Box
-  //@{
-
-  /*! \brief
-    Adds a copy of constraint \p c to the system of constraints
-    defining \p *this.
-
-    \param c
-    The constraint to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible,
-    or \p c is not optimally supported by the Box domain.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of constraints
-    defining \p *this.
-
-    \param  cs
-    The constraints to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible,
-    or \p cs contains a constraint which is not optimally supported
-    by the box domain.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of constraints
-    defining \p *this.
-
-    \param  cs
-    The constraints to be added. They may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible,
-    or \p cs contains a constraint which is not optimally supported
-    by the box domain.
-
-    \warning
-    The only assumption that can be made on \p cs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_constraints(Constraint_System& cs);
-
-  /*! \brief
-    Adds to \p *this a constraint equivalent to the congruence \p cg.
-
-    \param cg
-    The congruence to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible,
-    or \p cg is not optimally supported by the box domain.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Adds to \p *this constraints equivalent to the congruences in \p cgs.
-
-    \param cgs
-    The congruences to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    or \p cgs contains a congruence which is not optimally supported
-    by the box domain.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Adds to \p *this constraints equivalent to the congruences in \p cgs.
-
-    \param cgs
-    The congruence system to be added to \p *this.  The congruences in
-    \p cgs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    or \p cgs contains a congruence which is not optimally supported
-    by the box domain.
-
-    \warning
-    The only assumption that can be made on \p cgs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_congruences(Congruence_System& cgs);
-
-  /*! \brief
-    Use the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  /*! \brief
-    Use the constraints in \p cs to refine \p *this.
-
-    \param  cs
-    The constraints to be used for refinement.
-    To avoid termination problems, each constraint in \p cs
-    will be used for a single refinement step.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-
-    \note
-    The user is warned that the accuracy of this refinement operator
-    depends on the order of evaluation of the constraints in \p cs,
-    which is in general unpredictable. If a fine control on such an
-    order is needed, the user should consider calling the method
-    <code>refine_with_constraint(const Constraint& c)</code> inside
-    an appropriate looping construct.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Use the congruence \p cg to refine \p *this.
-
-    \param cg
-    The congruence to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
-  /*! \brief
-    Use the congruences in \p cgs to refine \p *this.
-
-    \param  cgs
-    The congruences to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Use the constraint \p c for constraint propagation on \p *this.
-
-    \param c
-    The constraint to be used for constraint propagation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible.
-  */
-  void propagate_constraint(const Constraint& c);
-
-  /*! \brief
-    Use the constraints in \p cs for constraint propagation on \p *this.
-
-    \param cs
-    The constraints to be used for constraint propagation.
-
-    \param max_iterations
-    The maximum number of propagation steps for each constraint in
-    \p cs.  If zero (the default), the number of propagation steps
-    will be unbounded, possibly resulting in an infinite loop.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-
-    \warning
-    This method may lead to non-termination if \p max_iterations is 0.
-  */
-  void propagate_constraints(const Constraint_System& cs,
-                             dimension_type max_iterations = 0);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  //! Assigns to \p *this the intersection of \p *this and \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void intersection_assign(const Box& y);
-
-  /*! \brief
-    Assigns to \p *this the smallest box containing the union
-    of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void upper_bound_assign(const Box& y);
-
-  /*! \brief
-    If the upper bound of \p *this and \p y is exact, it is assigned
-    to \p *this and <CODE>true</CODE> is returned,
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool upper_bound_assign_if_exact(const Box& y);
-
-  /*! \brief
-    Assigns to \p *this the difference of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void difference_assign(const Box& y);
-
-  /*! \brief
-    Assigns to \p *this a \ref Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-    If \c false is returned, then the intersection is empty.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool simplify_using_context_assign(const Box& y);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine image"
-    of \p *this under the function mapping variable \p var to the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of
-    \p *this.
-  */
-  void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
-
-  // FIXME: To be completed.
-  /*! \brief
-    Assigns to \p *this the \ref affine_form_relation "affine form image"
-    of \p *this under the function mapping variable \p var into the
-    affine expression(s) specified by \p lf.
-
-    \param var
-    The variable to which the affine expression is assigned.
-
-    \param lf
-    The linear form on intervals with floating point boundaries that
-    defines the affine expression(s). ALL of its coefficients MUST be bounded.
-
-    \exception std::invalid_argument
-    Thrown if \p lf and \p *this are dimension-incompatible or if \p var
-    is not a dimension of \p *this.
-
-    This function is used in abstract interpretation to model an assignment
-    of a value that is correctly overapproximated by \p lf to the
-    floating point variable represented by \p var.
-  */
-  void affine_form_image(Variable var,
-                         const Linear_Form<ITV>& lf);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine preimage"
-    of \p *this under the function mapping variable \p var to the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is substituted;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this.
-  */
-  void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this.
-  */
-  void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				  = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this.
-  */
-  void
-  generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs.
-  */
-  void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs.
-  */
-  void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void time_elapse_assign(const Box& y);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  /*! \brief
-    \ref Wrapping_Operator "Wraps" the specified dimensions of the
-    vector space.
-
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be wrapped.
-
-    \param w
-    The width of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param r
-    The representation of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param o
-    The overflow behavior of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param cs_p
-    Possibly null pointer to a constraint system.  When non-null,
-    the pointed-to constraint system is assumed to represent the
-    conditional or looping construct guard with respect to which
-    wrapping is performed.  Since wrapping requires the computation
-    of upper bounds and due to non-distributivity of constraint
-    refinement over upper bounds, passing a constraint system in this
-    way can be more precise than refining the result of the wrapping
-    operation with the constraints in <CODE>*cs_p</CODE>.
-
-    \param complexity_threshold
-    A precision parameter which is ignored for the Box domain.
-
-    \param wrap_individually
-    A precision parameter which is ignored for the Box domain.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars or with <CODE>*cs_p</CODE>.
-  */
-  void wrap_assign(const Variables_Set& vars,
-                   Bounded_Integer_Type_Width w,
-                   Bounded_Integer_Type_Representation r,
-                   Bounded_Integer_Type_Overflow o,
-                   const Constraint_System* cs_p = 0,
-                   unsigned complexity_threshold = 16,
-                   bool wrap_individually = true);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref CC76_extrapolation "CC76-widening" between \p *this and \p y.
-
-    \param y
-    A box that <EM>must</EM> be contained in \p *this.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  template <typename T>
-  typename Enable_If<Is_Same<T, Box>::value
-                     && Is_Same_Or_Derived<Interval_Base, ITV>::value,
-                     void>::type
-  CC76_widening_assign(const T& y, unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref CC76_extrapolation "CC76-widening" between \p *this and \p y.
-
-    \param y
-    A box that <EM>must</EM> be contained in \p *this.
-
-    \param first
-    An iterator that points to the first stop-point.
-
-    \param last
-    An iterator that points one past the last stop-point.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  template <typename T, typename Iterator>
-  typename Enable_If<Is_Same<T, Box>::value
-                     && Is_Same_Or_Derived<Interval_Base, ITV>::value,
-                     void>::type
-  CC76_widening_assign(const T& y,
-		       Iterator first, Iterator last);
-
-  //! Same as CC76_widening_assign(y, tp).
-  void widening_assign(const Box& y, unsigned* tp = 0);
-
-  /*! \brief
-    Improves the result of the \ref CC76_extrapolation "CC76-extrapolation"
-    computation by also enforcing those constraints in \p cs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    A box that <EM>must</EM> be contained in \p *this.
-
-    \param cs
-    The system of constraints used to improve the widened box.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
-    if \p cs contains a strict inequality.
-  */
-  void limited_CC76_extrapolation_assign(const Box& y,
-					 const Constraint_System& cs,
-					 unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of restoring in \p y the constraints
-    of \p *this that were lost by
-    \ref CC76_extrapolation "CC76-extrapolation" applications.
-
-    \param y
-    A Box that <EM>must</EM> contain \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \note
-    As was the case for widening operators, the argument \p y is meant to
-    denote the value computed in the previous iteration step, whereas
-    \p *this denotes the value computed in the current iteration step
-    (in the <EM>decreasing</EM> iteration sequence). Hence, the call
-    <CODE>x.CC76_narrowing_assign(y)</CODE> will assign to \p x
-    the result of the computation \f$\mathtt{y} \Delta \mathtt{x}\f$.
-  */
-  template <typename T>
-  typename Enable_If<Is_Same<T, Box>::value
-                     && Is_Same_Or_Derived<Interval_Base, ITV>::value,
-                     void>::type
-  CC76_narrowing_assign(const T& y);
-
-  //@} Space-Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  //! Adds \p m new dimensions and embeds the old box into the new space.
-  /*!
-    \param m
-    The number of dimensions to add.
-
-    The new dimensions will be those having the highest indexes in the new
-    box, which is defined by a system of interval constraints in which the
-    variables running through the new dimensions are unconstrained.
-    For instance, when starting from the box \f$\cB \sseq \Rset^2\f$
-    and adding a third dimension, the result will be the box
-    \f[
-      \bigl\{\,
-        (x, y, z)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cB
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Adds \p m new dimensions to the box and does not embed it in
-    the new vector space.
-
-    \param m
-    The number of dimensions to add.
-
-    The new dimensions will be those having the highest indexes in the
-    new box, which is defined by a system of bounded differences in
-    which the variables running through the new dimensions are all
-    constrained to be equal to 0.
-    For instance, when starting from the box \f$\cB \sseq \Rset^2\f$
-    and adding a third dimension, the result will be the box
-    \f[
-      \bigl\{\,
-        (x, y, 0)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cB
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  /*! \brief
-    Seeing a box as a set of tuples (its points),
-    assigns to \p *this all the tuples that can be obtained by concatenating,
-    in the order given, a tuple of \p *this with a tuple of \p y.
-
-    Let \f$B \sseq \Rset^n\f$ and \f$D \sseq \Rset^m\f$ be the boxes
-    corresponding, on entry, to \p *this and \p y, respectively.
-    Upon successful completion, \p *this will represent the box
-    \f$R \sseq \Rset^{n+m}\f$ such that
-    \f[
-      R \defeq
-          \Bigl\{\,
-            (x_1, \ldots, x_n, y_1, \ldots, y_m)^\transpose
-          \Bigm|
-            (x_1, \ldots, x_n)^\transpose \in B,
-            (y_1, \ldots, y_m)^\transpose \in D
-          \,\Bigl\}.
-    \f]
-    Another way of seeing it is as follows: first increases the space
-    dimension of \p *this by adding \p y.space_dimension() new
-    dimensions; then adds to the system of constraints of \p *this a
-    renamed-apart version of the constraints of \p y.
-  */
-  void concatenate_assign(const Box& y);
-
-  //! Removes all the specified dimensions.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the dimensions to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the Variable
-    objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher dimensions so that the resulting space
-    will have dimension \p new_dimension.
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimension is greater than the space dimension
-    of \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
-
-    \param pfunc
-    The partial function specifying the destiny of each dimension.
-
-    The template type parameter Partial_Function must provide
-    the following methods.
-    \code
-      bool has_empty_codomain() const
-    \endcode
-    returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty co-domain (i.e., it is always undefined).
-    The <CODE>has_empty_codomain()</CODE> method will always be called
-    before the methods below.  However, if
-    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
-    of the functions below will be called.
-    \code
-      dimension_type max_in_codomain() const
-    \endcode
-    returns the maximum value that belongs to the co-domain
-    of the partial function.
-    \code
-      bool maps(dimension_type i, dimension_type& j) const
-    \endcode
-    Let \f$f\f$ be the represented function and \f$k\f$ be the value
-    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
-    assigned to \p j and <CODE>true</CODE> is returned.
-    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
-    returned.
-
-    The result is undefined if \p pfunc does not encode a partial
-    function with the properties described in the
-    \ref Mapping_the_Dimensions_of_the_Vector_Space
-    "specification of the mapping operator".
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref expand_space_dimension "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.
-    Also thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are \ref fold_space_dimensions "folded"
-    into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-  /*! \brief
-    Returns a reference the interval that bounds \p var.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  const ITV& get_interval(Variable var) const;
-
-  /*! \brief
-    Sets to \p i the interval that bounds \p var.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void set_interval(Variable var, const ITV& i);
-
-  /*! \brief
-    If the space dimension of \p var is unbounded below, return
-    <CODE>false</CODE>. Otherwise return <CODE>true</CODE> and set
-    \p n, \p d and \p closed accordingly.
-
-    \note
-    It is assumed that <CODE>*this</CODE> is a non-empty box
-    having space dimension greater than or equal to that of \p var.
-    An undefined behavior is obtained if this assumption is not met.
-    \if Include_Implementation_Details
-    To be more precise, if <CODE>*this</CODE> is an <EM>empty</EM> box
-    (having space dimension greater than or equal to that of \p var)
-    such that <CODE>!marked_empty()</CODE> holds, then the method can be
-    called without incurring in undefined behavior: it will return
-    <EM>unspecified</EM> boundary values that, if queried systematically
-    on all space dimensions, will encode the box emptiness.
-    \endif
-
-    Let \f$I\f$ be the interval corresponding to variable \p var
-    in the non-empty box <CODE>*this</CODE>.
-    If \f$I\f$ is not bounded from below, simply return <CODE>false</CODE>
-    (leaving all other parameters unchanged).
-    Otherwise, set \p n, \p d and \p closed as follows:
-     - \p n and \p d are assigned the integers \f$n\f$ and \f$d\f$ such
-       that the fraction \f$n/d\f$ corresponds to the greatest lower bound
-       of \f$I\f$. The fraction \f$n/d\f$ is in canonical form, meaning
-       that \f$n\f$ and \f$d\f$ have no common factors, \f$d\f$ is positive,
-       and if \f$n\f$ is zero then \f$d\f$ is one;
-     - \p closed is set to <CODE>true</CODE> if and only if the lower
-       boundary of \f$I\f$ is closed (i.e., it is included in the interval).
-  */
-  bool has_lower_bound(Variable var,
-		       Coefficient& n, Coefficient& d, bool& closed) const;
-
-  /*! \brief
-    If the space dimension of \p var is unbounded above, return
-    <CODE>false</CODE>. Otherwise return <CODE>true</CODE> and set
-    \p n, \p d and \p closed accordingly.
-
-    \note
-    It is assumed that <CODE>*this</CODE> is a non-empty box
-    having space dimension greater than or equal to that of \p var.
-    An undefined behavior is obtained if this assumption is not met.
-    \if Include_Implementation_Details
-    To be more precise, if <CODE>*this</CODE> is an <EM>empty</EM> box
-    (having space dimension greater than or equal to that of \p var)
-    such that <CODE>!marked_empty()</CODE> holds, then the method can be
-    called without incurring in undefined behavior: it will return
-    <EM>unspecified</EM> boundary values that, if queried systematically
-    on all space dimensions, will encode the box emptiness.
-    \endif
-
-    Let \f$I\f$ be the interval corresponding to variable \p var
-    in the non-empty box <CODE>*this</CODE>.
-    If \f$I\f$ is not bounded from above, simply return <CODE>false</CODE>
-    (leaving all other parameters unchanged).
-    Otherwise, set \p n, \p d and \p closed as follows:
-     - \p n and \p d are assigned the integers \f$n\f$ and \f$d\f$ such
-       that the fraction \f$n/d\f$ corresponds to the least upper bound
-       of \f$I\f$. The fraction \f$n/d\f$ is in canonical form, meaning
-       that \f$n\f$ and \f$d\f$ have no common factors, \f$d\f$ is positive,
-       and if \f$n\f$ is zero then \f$d\f$ is one;
-     - \p closed is set to <CODE>true</CODE> if and only if the upper
-       boundary of \f$I\f$ is closed (i.e., it is included in the interval).
-  */
-  bool has_upper_bound(Variable var,
-                       Coefficient& n, Coefficient& d, bool& closed) const;
-
-  //! Returns a system of constraints defining \p *this.
-  Constraint_System constraints() const;
-
-  //! Returns a minimized system of constraints defining \p *this.
-  Constraint_System minimized_constraints() const;
-
-  //! Returns a system of congruences approximating \p *this.
-  Congruence_System congruences() const;
-
-  //! Returns a minimized system of congruences approximating \p *this.
-  Congruence_System minimized_congruences() const;
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If <CODE>x</CODE> and <CODE>y</CODE> are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool ascii_load(std::istream& s);
-
-private:
-  template <typename Other_ITV>
-  friend class Parma_Polyhedra_Library::Box;
-
-  friend bool
-  operator==<ITV>(const Box<ITV>& x, const Box<ITV>& y);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library
-  ::IO_Operators::operator<<<>(std::ostream& s, const Box<ITV>& box);
-
-  template <typename Specialization, typename Temp, typename To, typename I>
-  friend bool Parma_Polyhedra_Library::l_m_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const Box<I>& x, const Box<I>& y, const Rounding_Dir dir,
-   Temp& tmp0, Temp& tmp1, Temp& tmp2);
-
-  //! The type of sequence used to implement the box.
-  typedef std::vector<ITV> Sequence;
-
-  /*! \brief
-    The type of intervals used by inner computations when trying to limit
-    the cumulative effect of approximation errors.
-  */
-  typedef ITV Tmp_Interval_Type;
-
-  //! A sequence of intervals, one for each dimension of the vector space.
-  Sequence seq;
-
-#define PPL_IN_Box_CLASS
-#include "Box_Status.idefs.hh"
-#undef PPL_IN_Box_CLASS
-
-  //! The status flags to keep track of the internal state.
-  Status status;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the box is known to be empty.
-
-    The return value <CODE>false</CODE> does not necessarily
-    implies that \p *this is non-empty.
-  */
-  bool marked_empty() const;
-
-public:
-  //! Causes the box to become empty, i.e., to represent the empty set.
-  void set_empty();
-
-private:
-  //! Marks \p *this as definitely not empty.
-  void set_nonempty();
-
-  //! Asserts the validity of the empty flag of \p *this.
-  void set_empty_up_to_date();
-
-  //! Invalidates empty flag of \p *this.
-  void reset_empty_up_to_date();
-
-  /*! \brief
-    Checks the hard way whether \p *this is an empty box:
-    returns <CODE>true</CODE> if and only if it is so.
-  */
-  bool check_empty() const;
-
-   /*! \brief
-     Returns a reference the interval that bounds
-     the box on the <CODE>k</CODE>-th space dimension.
-   */
-  const ITV& operator[](dimension_type k) const;
-
-  /*! \brief
-    WRITE ME.
-  */
-  static I_Result
-  refine_interval_no_check(ITV& itv,
-                           Constraint::Type type,
-                           Coefficient_traits::const_reference numer,
-                           Coefficient_traits::const_reference denom);
-
-  /*! \brief
-    WRITE ME.
-  */
-  void
-  add_interval_constraint_no_check(dimension_type var_id,
-                                   Constraint::Type type,
-                                   Coefficient_traits::const_reference numer,
-                                   Coefficient_traits::const_reference denom);
-
-  /*! \brief
-    WRITE ME.
-  */
-  void add_constraint_no_check(const Constraint& c);
-
-  /*! \brief
-    WRITE ME.
-  */
-  void add_constraints_no_check(const Constraint_System& cs);
-
-  /*! \brief
-    WRITE ME.
-  */
-  void add_congruence_no_check(const Congruence& cg);
-
-  /*! \brief
-    WRITE ME.
-  */
-  void add_congruences_no_check(const Congruence_System& cgs);
-
-  /*! \brief
-    Uses the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be used for the refinement.
-
-    \warning
-    If \p c and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Constraint& c);
-
-  /*! \brief
-    Uses the constraints in \p cs to refine \p *this.
-
-    \param cs
-    The constraints to be used for the refinement.
-    To avoid termination problems, each constraint in \p cs
-    will be used for a single refinement step.
-
-    \warning
-    If \p cs and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Constraint_System& cs);
-
-  /*! \brief
-    Uses the congruence \p cg to refine \p *this.
-
-    \param cg
-    The congruence to be added.
-    Nontrivial proper congruences are ignored.
-
-    \warning
-    If \p cg and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Congruence& cg);
-
-  /*! \brief
-    Uses the congruences in \p cgs to refine \p *this.
-
-    \param cgs
-    The congruences to be added.
-    Nontrivial proper congruences are ignored.
-
-    \warning
-    If \p cgs and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Congruence_System& cgs);
-
-  /*! \brief
-    Propagates the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be propagated.
-
-    \warning
-    If \p c and \p *this are dimension-incompatible,
-    the behavior is undefined.
-
-    \warning
-    This method may lead to non-termination.
-
-    \if Include_Implementation_Details
-
-    For any expression \f$e\f$, we denote by
-    \f$\left\uparrow e \right\uparrow\f$ (resp., \f$\left\downarrow e
-    \right\downarrow\f$) the result of any computation that is
-    guaranteed to yield an upper (resp., lower) approximation of
-    \f$e\f$.  So there exists \f$\epsilon \in \Rset\f$ with
-    \f$\epsilon \geq 0\f$ such that
-    \f$\left\uparrow e \right\uparrow = e + \epsilon\f$.
-    If \f$\epsilon = 0\f$ we say that the computation of
-    \f$\left\uparrow e \right\uparrow\f$ is <EM>exact</EM>;
-    we say it is <EM>inexact</EM> otherwise.
-    Similarly for \f$\left\downarrow e \right\downarrow\f$.
-
-    Consider a constraint of the general form
-    \f[
-      z + \sum_{i \in I}{a_ix_i} \relsym 0,
-    \f]
-    where \f$z \in \Zset\f$, \f$I\f$ is a set of indices,
-    \f$a_i \in \Zset\f$ with \f$a_i \neq 0\f$ for each \f$i \in I\f$, and
-    \f$\mathord{\relsym} \in \{ \mathord{\geq}, \mathord{>}, \mathord{=} \}\f$.
-    The set \f$I\f$ is subdivided into the disjoint sets \f$P\f$ and \f$N\f$
-    such that, for each \f$i \in I\f$, \f$a_i > 0\f$ if \f$i \in P\f$ and
-    \f$a_i < 0\f$ if \f$i \in N\f$.
-    Suppose that, for each \f$i \in P \union N\f$ a variation interval
-    \f$\chi_i \sseq \Rset\f$ is known for \f$x_i\f$ and that the infimum
-    and the supremum of \f$\chi_i\f$ are denoted, respectively,
-    by \f$\chi_i^\mathrm{l}\f$ and \f$\chi_i^\mathrm{u}\f$, where
-    \f$\chi_i^\mathrm{l}, \chi_i^\mathrm{u} \in \Rset \union \{ -\infty, +\infty \}\f$.
-
-    For each \f$k \in P\f$, we have
-    \f[
-      x_k
-        \relsym
-          \frac{1}{a_k}
-            \Biggl(
-              - z
-              - \sum_{i \in N}{a_ix_i}
-              - \sum_{\genfrac{}{}{0pt}{}
-                              {\scriptstyle i \in P}
-                              {\scriptstyle i \neq k}}{a_ix_i}
-            \Biggr).
-    \f]
-    Thus, if \f$\chi_i^\mathrm{l} \in \Rset\f$ for each \f$i \in N\f$ and
-    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in P \setdiff \{ k \}\f$,
-    we have
-    \f[
-      x_k
-        \geq
-          \Biggl\downarrow
-          \frac{1}{a_k}
-            \Biggl(
-              - z
-              - \sum_{i \in N}{a_i\chi_i^\mathrm{l}}
-              - \sum_{\genfrac{}{}{0pt}{}
-                              {\scriptstyle i \in P}
-                              {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{u}}
-            \Biggr)
-          \Biggr\downarrow
-    \f]
-    and, if \f$\mathord{\relsym} \in \{ \mathord{=} \}\f$,
-    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in N\f$ and
-    \f$\chi_i^\mathrm{l} \in \Rset\f$ for each \f$P \setdiff \{ k \}\f$,
-    \f[
-      x_k
-        \leq
-          \Biggl\uparrow
-          \frac{1}{a_k}
-            \Biggl(
-              - z
-              - \sum_{i \in N}{a_i\chi_i^\mathrm{u}}
-              - \sum_{\genfrac{}{}{0pt}{}
-                              {\scriptstyle i \in P}
-                              {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{l}}
-            \Biggr)
-          \Biggl\uparrow.
-    \f]
-    In the first inequality, the relation is strict if
-    \f$\mathord{\relsym} \in \{ \mathord{>} \}\f$, or if
-    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some \f$i \in N\f$, or if
-    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some
-    \f$i \in P \setdiff \{ k \}\f$, or if the computation is inexact.
-    In the second inequality, the relation is strict if
-    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some \f$i \in N\f$, or if
-    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some
-    \f$i \in P \setdiff \{ k \}\f$, or if the computation is inexact.
-
-    For each \f$k \in N\f$, we have
-    \f[
-      \frac{1}{a_k}
-        \Biggl(
-          - z
-          - \sum_{\genfrac{}{}{0pt}{}
-                          {\scriptstyle i \in N}
-                          {\scriptstyle i \neq k}}{a_ix_i}
-          - \sum_{i \in P}{a_ix_i}
-        \Biggr)
-          \relsym
-            x_k.
-    \f]
-    Thus, if
-    \f$\chi_i^\mathrm{l} \in \Rset\f$
-    for each \f$i \in N \setdiff \{ k \}\f$ and
-    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in P\f$,
-    we have
-    \f[
-      \Biggl\uparrow
-      \frac{1}{a_k}
-        \Biggl(
-          - z
-          - \sum_{\genfrac{}{}{0pt}{}
-                          {\scriptstyle i \in N}
-                          {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{l}}
-          - \sum_{i \in P}{a_i\chi_i^\mathrm{u}}
-        \Biggr)
-      \Biggl\uparrow
-        \geq
-          x_k
-    \f]
-    and, if \f$\mathord{\relsym} \in \{ \mathord{=} \}\f$,
-    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in N \setdiff \{ k \}\f$
-    and \f$\chi_i^\mathrm{l} \in \Rset\f$ for each \f$i \in P\f$,
-    \f[
-      \Biggl\downarrow
-      \frac{1}{a_k}
-        \Biggl(
-          - z
-          - \sum_{\genfrac{}{}{0pt}{}
-                          {\scriptstyle i \in N}
-                          {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{u}}
-          - \sum_{i \in P}{a_i\chi_i^\mathrm{l}}
-        \Biggr)
-      \Biggl\downarrow
-        \leq
-          x_k.
-    \f]
-    In the first inequality, the relation is strict if
-    \f$\mathord{\relsym} \in \{ \mathord{>} \}\f$, or if
-    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some \f$i \in P\f$, or if
-    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some
-    \f$i \in N \setdiff \{ k \}\f$, or if the computation is inexact.
-    In the second inequality, the relation is strict if
-    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some \f$i \in P\f$, or if
-    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some
-    \f$i \in N \setdiff \{ k \}\f$, or if the computation is inexact.
-    \endif
-  */
-  void propagate_constraint_no_check(const Constraint& c);
-
-  /*! \brief
-    Propagates the constraints in \p cs to refine \p *this.
-
-    \param  cs
-    The constraints to be propagated.
-
-    \param max_iterations
-    The maximum number of propagation steps for each constraint in \p cs.
-    If zero, the number of propagation steps will be unbounded, possibly
-    resulting in an infinite loop.
-
-    \warning
-    If \p cs and \p *this are dimension-incompatible,
-    the behavior is undefined.
-
-    \warning
-    This method may lead to non-termination if \p max_iterations is 0.
-  */
-  void propagate_constraints_no_check(const Constraint_System& cs,
-                                      dimension_type max_iterations);
-
-  //! Checks if and how \p expr is bounded in \p *this.
-  /*!
-    Returns <CODE>true</CODE> if and only if \p from_above is
-    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
-    or \p from_above is <CODE>false</CODE> and \p expr is bounded
-    from below in \p *this.
-
-    \param expr
-    The linear expression to test;
-
-    \param from_above
-    <CODE>true</CODE> if and only if the boundedness of interest is
-    "from above".
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds(const Linear_Expression& expr, bool from_above) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p *this;
-
-    \param g
-    When maximization or minimization succeeds, will be assigned
-    a point or closure point where \p expr reaches the
-    corresponding extremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p g are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-	       bool maximize,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included,
-	       Generator& g) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p * this;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p point are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-	       bool maximize,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
-
-  /*! \brief
-    Adds to \p limiting_box the interval constraints in \p cs
-    that are satisfied by \p *this.
-  */
-  void get_limiting_box(const Constraint_System& cs,
-                        Box& limiting_box) const;
-
-  //! \name Exception Throwers
-  //@{
-  void throw_dimension_incompatible(const char* method,
-				    const Box& y) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    dimension_type required_dim) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const Constraint& c) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const Congruence& cg) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const Constraint_System& cs) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const Congruence_System& cgs) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const Generator& g) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const char* le_name,
-				    const Linear_Expression& le) const;
-
-  template <typename C>
-  void throw_dimension_incompatible(const char* method,
-                                    const char* lf_name,
-                                    const Linear_Form<C>& lf) const;
-
-  static void throw_constraint_incompatible(const char* method);
-
-  static void throw_expression_too_complex(const char* method,
-					   const Linear_Expression& le);
-
-  static void throw_invalid_argument(const char* method, const char* reason);
-  //@} // Exception Throwers
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Returns the relations holding between an interval and
-  an interval constraint.
-
-  \param i
-  The interval;
-
-  \param constraint_type
-  The constraint type;
-
-  \param numer
-  The numerator of the constraint bound;
-
-  \param denom
-  The denominator of the constraint bound
-
-  The interval constraint has the form
-  <CODE>denom * Variable(0) relsym numer</CODE>
-  where relsym is  <CODE>==</CODE>,  <CODE>></CODE> or  <CODE>>=</CODE>
-  depending on the <CODE>constraint_type</CODE>.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename ITV>
-Poly_Con_Relation
-interval_relation(const ITV& i,
-                  const Constraint::Type constraint_type,
-                  Coefficient_traits::const_reference numer,
-                  Coefficient_traits::const_reference denom = 1);
-
-class Box_Helpers {
-public:
-  // This is declared here so that Linear_Expression needs to be friend of
-  // Box_Helpers only, and doesn't need to be friend of this, too.
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! Decodes the constraint \p c as an interval constraint.
-  /*! \relates Box
-    \return
-    <CODE>true</CODE> if the constraint \p c is an
-    \ref intervals "interval constraint";
-    <CODE>false</CODE> otherwise.
-
-    \param c
-    The constraint to be decoded.
-
-    \param c_num_vars
-    If <CODE>true</CODE> is returned, then it will be set to the number
-    of variables having a non-zero coefficient. The only legal values
-    will therefore be 0 and 1.
-
-    \param c_only_var
-    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
-    then it will be set to the index of the only variable having
-    a non-zero coefficient in \p c.
-  */
-  #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  static bool extract_interval_constraint(const Constraint& c,
-                                          dimension_type& c_num_vars,
-                                          dimension_type& c_only_var);
-
-  // This is declared here so that Linear_Expression needs to be friend of
-  // Box_Helpers only, and doesn't need to be friend of this, too.
-  static bool extract_interval_congruence(const Congruence& cg,
-                                          dimension_type& cg_num_vars,
-                                          dimension_type& cg_only_var);
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Box_Status.inlines.hh"
-#include "Box.inlines.hh"
-#include "Box.templates.hh"
-
-#endif // !defined(PPL_Box_defs_hh)
diff --git a/src/Box.inlines.hh b/src/Box.inlines.hh
deleted file mode 100644
index a77db58..0000000
--- a/src/Box.inlines.hh
+++ /dev/null
@@ -1,692 +0,0 @@
-/* Box class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Box_inlines_hh
-#define PPL_Box_inlines_hh 1
-
-#include "Boundary.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
-#include "distances.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename ITV>
-inline bool
-Box<ITV>::marked_empty() const {
-  return status.test_empty_up_to_date() && status.test_empty();
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::set_empty() {
-  status.set_empty();
-  status.set_empty_up_to_date();
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::set_nonempty() {
-  status.reset_empty();
-  status.set_empty_up_to_date();
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::set_empty_up_to_date() {
-  status.set_empty_up_to_date();
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::reset_empty_up_to_date() {
-  return status.reset_empty_up_to_date();
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Box(const Box& y, Complexity_Class)
-  : seq(y.seq), status(y.status) {
-}
-
-template <typename ITV>
-inline Box<ITV>&
-Box<ITV>::operator=(const Box& y) {
-  seq = y.seq;
-  status = y.status;
-  return *this;
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::m_swap(Box& y) {
-  Box& x = *this;
-  using std::swap;
-  swap(x.seq, y.seq);
-  swap(x.status, y.status);
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Box(const Constraint_System& cs, Recycle_Input) {
-  // Recycling is useless: just delegate.
-  Box<ITV> tmp(cs);
-  this->m_swap(tmp);
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Box(const Generator_System& gs, Recycle_Input) {
-  // Recycling is useless: just delegate.
-  Box<ITV> tmp(gs);
-  this->m_swap(tmp);
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Box(const Congruence_System& cgs, Recycle_Input) {
-  // Recycling is useless: just delegate.
-  Box<ITV> tmp(cgs);
-  this->m_swap(tmp);
-}
-
-template <typename ITV>
-inline memory_size_type
-Box<ITV>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename ITV>
-inline dimension_type
-Box<ITV>::space_dimension() const {
-  return seq.size();
-}
-
-template <typename ITV>
-inline dimension_type
-Box<ITV>::max_space_dimension() {
-  // One dimension is reserved to have a value of type dimension_type
-  // that does not represent a legal dimension.
-  return Sequence().max_size() - 1;
-}
-
-template <typename ITV>
-inline int32_t
-Box<ITV>::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-template <typename ITV>
-inline const ITV&
-Box<ITV>::operator[](const dimension_type k) const {
-  PPL_ASSERT(k < seq.size());
-  return seq[k];
-}
-
-template <typename ITV>
-inline const ITV&
-Box<ITV>::get_interval(const Variable var) const {
-  if (space_dimension() < var.space_dimension())
-    throw_dimension_incompatible("get_interval(v)", "v", var);
-
-  if (is_empty()) {
-    static ITV empty_interval(EMPTY);
-    return empty_interval;
-  }
-
-  return seq[var.id()];
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::set_interval(const Variable var, const ITV& i) {
-  const dimension_type space_dim = space_dimension();
-  if (space_dim < var.space_dimension())
-    throw_dimension_incompatible("set_interval(v, i)", "v", var);
-
-  if (is_empty() && space_dim >= 2)
-    // If the box is empty, and has dimension >= 2, setting only one
-    // interval will not make it non-empty.
-    return;
-
-  seq[var.id()] = i;
-  reset_empty_up_to_date();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::is_empty() const {
-  return marked_empty() || check_empty();
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::bounds_from_above(const Linear_Expression& expr) const {
-  return bounds(expr, true);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::bounds_from_below(const Linear_Expression& expr) const {
-  return bounds(expr, false);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::maximize(const Linear_Expression& expr,
-                   Coefficient& sup_n, Coefficient& sup_d,
-                   bool& maximum) const {
-  return max_min(expr, true, sup_n, sup_d, maximum);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::maximize(const Linear_Expression& expr,
-                   Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-                   Generator& g) const {
-  return max_min(expr, true, sup_n, sup_d, maximum, g);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::minimize(const Linear_Expression& expr,
-                   Coefficient& inf_n, Coefficient& inf_d,
-                   bool& minimum) const {
-  return max_min(expr, false, inf_n, inf_d, minimum);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::minimize(const Linear_Expression& expr,
-                   Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-                   Generator& g) const {
-  return max_min(expr, false, inf_n, inf_d, minimum, g);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::strictly_contains(const Box& y) const {
-  const Box& x = *this;
-  return x.contains(y) && !y.contains(x);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::expand_space_dimension(const Variable var,
-                                 const dimension_type m) {
-  const dimension_type space_dim = space_dimension();
-  // `var' should be one of the dimensions of the vector space.
-  if (var.space_dimension() > space_dim)
-    throw_dimension_incompatible("expand_space_dimension(v, m)", "v", var);
-
-  // The space dimension of the resulting Box should not
-  // overflow the maximum allowed space dimension.
-  if (m > max_space_dimension() - space_dim)
-    throw_invalid_argument("expand_dimension(v, m)",
-                           "adding m new space dimensions exceeds "
-                           "the maximum allowed space dimension");
-
-  // To expand the space dimension corresponding to variable `var',
-  // we append to the box `m' copies of the corresponding interval.
-  seq.insert(seq.end(), m, seq[var.id()]);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-inline bool
-operator!=(const Box<ITV>& x, const Box<ITV>& y) {
-  return !(x == y);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::has_lower_bound(const Variable var,
-                          Coefficient& n, Coefficient& d, bool& closed) const {
-  // NOTE: assertion !is_empty() would be wrong;
-  // see the calls in method Box<ITV>::constraints().
-  PPL_ASSERT(!marked_empty());
-  const dimension_type k = var.id();
-  PPL_ASSERT(k < seq.size());
-  const ITV& seq_k = seq[k];
-
-  if (seq_k.lower_is_boundary_infinity())
-    return false;
-
-  closed = !seq_k.lower_is_open();
-
-  PPL_DIRTY_TEMP(mpq_class, lr);
-  assign_r(lr, seq_k.lower(), ROUND_NOT_NEEDED);
-  n = lr.get_num();
-  d = lr.get_den();
-
-  return true;
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::has_upper_bound(const Variable var,
-                          Coefficient& n, Coefficient& d, bool& closed) const {
-  // NOTE: assertion !is_empty() would be wrong;
-  // see the calls in method Box<ITV>::constraints().
-  PPL_ASSERT(!marked_empty());
-  const dimension_type k = var.id();
-  PPL_ASSERT(k < seq.size());
-  const ITV& seq_k = seq[k];
-
-  if (seq_k.upper_is_boundary_infinity())
-    return false;
-
-  closed = !seq_k.upper_is_open();
-
-  PPL_DIRTY_TEMP(mpq_class, ur);
-  assign_r(ur, seq_k.upper(), ROUND_NOT_NEEDED);
-  n = ur.get_num();
-  d = ur.get_den();
-
-  return true;
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::add_constraint(const Constraint& c) {
-  const dimension_type c_space_dim = c.space_dimension();
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dimension())
-    throw_dimension_incompatible("add_constraint(c)", c);
-
-  add_constraint_no_check(c);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::add_constraints(const Constraint_System& cs) {
-  // Dimension-compatibility check.
-  if (cs.space_dimension() > space_dimension())
-    throw_dimension_incompatible("add_constraints(cs)", cs);
-
-  add_constraints_no_check(cs);
-}
-
-template <typename T>
-inline void
-Box<T>::add_recycled_constraints(Constraint_System& cs) {
-  add_constraints(cs);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::add_congruence(const Congruence& cg) {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  // Dimension-compatibility check.
-  if (cg_space_dim > space_dimension())
-    throw_dimension_incompatible("add_congruence(cg)", cg);
-
-  add_congruence_no_check(cg);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::add_congruences(const Congruence_System& cgs) {
-  if (cgs.space_dimension() > space_dimension())
-    throw_dimension_incompatible("add_congruences(cgs)", cgs);
-  add_congruences_no_check(cgs);
-}
-
-template <typename T>
-inline void
-Box<T>::add_recycled_congruences(Congruence_System& cgs) {
-  add_congruences(cgs);
-}
-
-template <typename T>
-inline bool
-Box<T>::can_recycle_constraint_systems() {
-  return false;
-}
-
-template <typename T>
-inline bool
-Box<T>::can_recycle_congruence_systems() {
-  return false;
-}
-
-template <typename T>
-inline void
-Box<T>::widening_assign(const Box& y, unsigned* tp) {
-  CC76_widening_assign(y, tp);
-}
-
-template <typename ITV>
-inline Congruence_System
-Box<ITV>::minimized_congruences() const {
-  // Only equalities can be congruences and these are already minimized.
-  return congruences();
-}
-
-template <typename ITV>
-inline I_Result
-Box<ITV>
-::refine_interval_no_check(ITV& itv,
-                           const Constraint::Type type,
-                           Coefficient_traits::const_reference numer,
-                           Coefficient_traits::const_reference denom) {
-  PPL_ASSERT(denom != 0);
-  // The interval constraint is of the form
-  // `var + numer / denom rel 0',
-  // where `rel' is either the relation `==', `>=', or `>'.
-  // For the purpose of refining the interval, this is
-  // (morally) turned into `var rel -numer/denom'.
-  PPL_DIRTY_TEMP(mpq_class, q);
-  assign_r(q.get_num(), numer, ROUND_NOT_NEEDED);
-  assign_r(q.get_den(), denom, ROUND_NOT_NEEDED);
-  q.canonicalize();
-  // Turn `numer/denom' into `-numer/denom'.
-  q = -q;
-
-  Relation_Symbol rel_sym;
-  switch (type) {
-  case Constraint::EQUALITY:
-    rel_sym = EQUAL;
-    break;
-  case Constraint::NONSTRICT_INEQUALITY:
-    rel_sym = (denom > 0) ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
-    break;
-  case Constraint::STRICT_INEQUALITY:
-    rel_sym = (denom > 0) ? GREATER_THAN : LESS_THAN;
-    break;
-  default:
-    // Silence compiler warning.
-    PPL_UNREACHABLE;
-    return I_ANY;
-  }
-  I_Result res = itv.add_constraint(i_constraint(rel_sym, q));
-  PPL_ASSERT(itv.OK());
-  return res;
-}
-
-template <typename ITV>
-inline void
-Box<ITV>
-::add_interval_constraint_no_check(const dimension_type var_id,
-                                   const Constraint::Type type,
-                                   Coefficient_traits::const_reference numer,
-                                   Coefficient_traits::const_reference denom) {
-  PPL_ASSERT(!marked_empty());
-  PPL_ASSERT(var_id < space_dimension());
-  PPL_ASSERT(denom != 0);
-  refine_interval_no_check(seq[var_id], type, numer, denom);
-  // FIXME: do check the value returned and set `empty' and
-  // `empty_up_to_date' as appropriate.
-  // This has to be done after reimplementation of intervals.
-  reset_empty_up_to_date();
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::refine_with_constraint(const Constraint& c) {
-  const dimension_type c_space_dim = c.space_dimension();
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dimension())
-    throw_dimension_incompatible("refine_with_constraint(c)", c);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  refine_no_check(c);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::refine_with_constraints(const Constraint_System& cs) {
-  // Dimension-compatibility check.
-  if (cs.space_dimension() > space_dimension())
-    throw_dimension_incompatible("refine_with_constraints(cs)", cs);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  refine_no_check(cs);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::refine_with_congruence(const Congruence& cg) {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  // Dimension-compatibility check.
-  if (cg_space_dim > space_dimension())
-    throw_dimension_incompatible("refine_with_congruence(cg)", cg);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  refine_no_check(cg);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::refine_with_congruences(const Congruence_System& cgs) {
-  // Dimension-compatibility check.
-  if (cgs.space_dimension() > space_dimension())
-    throw_dimension_incompatible("refine_with_congruences(cgs)", cgs);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  refine_no_check(cgs);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::propagate_constraint(const Constraint& c) {
-  const dimension_type c_space_dim = c.space_dimension();
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dimension())
-    throw_dimension_incompatible("propagate_constraint(c)", c);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  propagate_constraint_no_check(c);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::propagate_constraints(const Constraint_System& cs,
-                                const dimension_type max_iterations) {
-  // Dimension-compatibility check.
-  if (cs.space_dimension() > space_dimension())
-    throw_dimension_incompatible("propagate_constraints(cs)", cs);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  propagate_constraints_no_check(cs, max_iterations);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::unconstrain(const Variable var) {
-  const dimension_type var_id = var.id();
-  // Dimension-compatibility check.
-  if (space_dimension() < var_id + 1)
-    throw_dimension_incompatible("unconstrain(var)", var_id + 1);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  // Here the box might still be empty (but we haven't detected it yet):
-  // check emptiness of the interval for `var' before cylindrification.
-  ITV& seq_var = seq[var_id];
-  if (seq_var.is_empty())
-    set_empty();
-  else
-    seq_var.assign(UNIVERSE);
-
-  PPL_ASSERT(OK());
-}
-
-/*! \relates Box */
-template <typename Temp, typename To, typename ITV>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
-  return l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >
-    (r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Box */
-template <typename Temp, typename To, typename ITV>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Box */
-template <typename To, typename ITV>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    const Rounding_Dir dir) {
-  // FIXME: the following qualification is only to work around a bug
-  // in the Intel C/C++ compiler version 10.1.x.
-  return Parma_Polyhedra_Library
-    ::rectilinear_distance_assign<To, To, ITV>(r, x, y, dir);
-}
-
-/*! \relates Box */
-template <typename Temp, typename To, typename ITV>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
-  return l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >
-    (r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Box */
-template <typename Temp, typename To, typename ITV>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Box */
-template <typename To, typename ITV>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  const Rounding_Dir dir) {
-  // FIXME: the following qualification is only to work around a bug
-  // in the Intel C/C++ compiler version 10.1.x.
-  return Parma_Polyhedra_Library
-    ::euclidean_distance_assign<To, To, ITV>(r, x, y, dir);
-}
-
-/*! \relates Box */
-template <typename Temp, typename To, typename ITV>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
-  return l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >
-    (r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Box */
-template <typename Temp, typename To, typename ITV>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Box */
-template <typename To, typename ITV>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   const Rounding_Dir dir) {
-  // FIXME: the following qualification is only to work around a bug
-  // in the Intel C/C++ compiler version 10.1.x.
-  return Parma_Polyhedra_Library
-    ::l_infinity_distance_assign<To, To, ITV>(r, x, y, dir);
-}
-
-/*! \relates Box */
-template <typename ITV>
-inline void
-swap(Box<ITV>& x, Box<ITV>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Box_inlines_hh)
diff --git a/src/Box.templates.hh b/src/Box.templates.hh
deleted file mode 100644
index 17fa8be..0000000
--- a/src/Box.templates.hh
+++ /dev/null
@@ -1,4285 +0,0 @@
-/* Box class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Box_templates_hh
-#define PPL_Box_templates_hh 1
-
-#include "Variables_Set.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Generator_System.defs.hh"
-#include "Generator_System.inlines.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "Polyhedron.defs.hh"
-#include "Grid.defs.hh"
-#include "Interval.defs.hh"
-#include "Linear_Form.defs.hh"
-#include "BD_Shape.defs.hh"
-#include "Octagonal_Shape.defs.hh"
-#include "MIP_Problem.defs.hh"
-#include "Rational_Interval.hh"
-#include <vector>
-#include <map>
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename ITV>
-inline
-Box<ITV>::Box(dimension_type num_dimensions, Degenerate_Element kind)
-  : seq(check_space_dimension_overflow(num_dimensions,
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(n, k)",
-                                       "n exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  // In a box that is marked empty the intervals are completely
-  // meaningless: we exploit this by avoiding their initialization.
-  if (kind == UNIVERSE) {
-    for (dimension_type i = num_dimensions; i-- > 0; )
-      seq[i].assign(UNIVERSE);
-    set_empty_up_to_date();
-  }
-  else
-    set_empty();
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Box(const Constraint_System& cs)
-  : seq(check_space_dimension_overflow(cs.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(cs)",
-                                       "cs exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  // FIXME: check whether we can avoid the double initialization.
-  for (dimension_type i = cs.space_dimension(); i-- > 0; )
-    seq[i].assign(UNIVERSE);
-  add_constraints_no_check(cs);
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Box(const Congruence_System& cgs)
-  : seq(check_space_dimension_overflow(cgs.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(cgs)",
-                                       "cgs exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  // FIXME: check whether we can avoid the double initialization.
-  for (dimension_type i = cgs.space_dimension(); i-- > 0; )
-    seq[i].assign(UNIVERSE);
-  add_congruences_no_check(cgs);
-}
-
-template <typename ITV>
-template <typename Other_ITV>
-inline
-Box<ITV>::Box(const Box<Other_ITV>& y, Complexity_Class)
-  : seq(y.space_dimension()),
-    // FIXME: why the following does not work?
-    // status(y.status) {
-    status() {
-  // FIXME: remove when the above is fixed.
-  if (y.marked_empty())
-    set_empty();
-
-  if (!y.marked_empty())
-    for (dimension_type k = y.space_dimension(); k-- > 0; )
-      seq[k].assign(y.seq[k]);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-Box<ITV>::Box(const Generator_System& gs)
-  : seq(check_space_dimension_overflow(gs.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(gs)",
-                                       "gs exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  const Generator_System::const_iterator gs_begin = gs.begin();
-  const Generator_System::const_iterator gs_end = gs.end();
-  if (gs_begin == gs_end) {
-    // An empty generator system defines the empty box.
-    set_empty();
-    return;
-  }
-
-  // The empty flag will be meaningful, whatever happens from now on.
-  set_empty_up_to_date();
-
-  const dimension_type space_dim = space_dimension();
-  PPL_DIRTY_TEMP(mpq_class, q);
-  bool point_seen = false;
-  // Going through all the points.
-  for (Generator_System::const_iterator
-	 gs_i = gs_begin; gs_i != gs_end; ++gs_i) {
-    const Generator& g = *gs_i;
-    if (g.is_point()) {
-      const Coefficient& d = g.divisor();
-      if (point_seen) {
-	// This is not the first point: `seq' already contains valid values.
-	// TODO: If the variables in the expression that have coefficient 0
-        // have no effect on seq[i], this loop can be optimized using
-        // Generator::Expression::const_iterator.
-	for (dimension_type i = space_dim; i-- > 0; ) {
-	  assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-	  assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
-	  q.canonicalize();
-	  PPL_DIRTY_TEMP(ITV, iq);
-	  iq.build(i_constraint(EQUAL, q));
-	  seq[i].join_assign(iq);
-	}
-      }
-      else {
-	// This is the first point seen: initialize `seq'.
-	point_seen = true;
-        // TODO: If the variables in the expression that have coefficient 0
-        // have no effect on seq[i], this loop can be optimized using
-        // Generator::Expression::const_iterator.
-	for (dimension_type i = space_dim; i-- > 0; ) {
-	  assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-	  assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
-	  q.canonicalize();
-	  seq[i].build(i_constraint(EQUAL, q));
-	}
-      }
-    }
-  }
-
-  if (!point_seen)
-    // The generator system is not empty, but contains no points.
-    throw std::invalid_argument("PPL::Box<ITV>::Box(gs):\n"
-				"the non-empty generator system gs "
-				"contains no points.");
-
-  // Going through all the lines, rays and closure points.
-  ITV q_interval;
-  for (Generator_System::const_iterator gs_i = gs_begin;
-       gs_i != gs_end; ++gs_i) {
-    const Generator& g = *gs_i;
-    switch (g.type()) {
-    case Generator::LINE:
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
-              i_end = g.expression().end();
-              i != i_end; ++i)
-	  seq[i.variable().id()].assign(UNIVERSE);
-      break;
-    case Generator::RAY:
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
-              i_end = g.expression().end();
-              i != i_end; ++i)
-	switch (sgn(*i)) {
-	case 1:
-	  seq[i.variable().id()].upper_extend();
-	  break;
-	case -1:
-	  seq[i.variable().id()].lower_extend();
-	  break;
-	default:
-          PPL_UNREACHABLE;
-	  break;
-	}
-      break;
-    case Generator::CLOSURE_POINT:
-      {
-	const Coefficient& d = g.divisor();
-        // TODO: If the variables in the expression that have coefficient 0
-        // have no effect on seq[i], this loop can be optimized using
-        // Generator::Expression::const_iterator.
-	for (dimension_type i = space_dim; i-- > 0; ) {
-	  assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-	  assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
-	  q.canonicalize();
-	  ITV& seq_i = seq[i];
-	  seq_i.lower_extend(i_constraint(GREATER_THAN, q));
-	  seq_i.upper_extend(i_constraint(LESS_THAN, q));
-	}
-      }
-      break;
-    default:
-      // Points already dealt with.
-      break;
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-template <typename T>
-Box<ITV>::Box(const BD_Shape<T>& bds, Complexity_Class)
-  : seq(check_space_dimension_overflow(bds.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(bds)",
-                                       "bds exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  // Expose all the interval constraints.
-  bds.shortest_path_closure_assign();
-  if (bds.marked_empty()) {
-    set_empty();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // The empty flag will be meaningful, whatever happens from now on.
-  set_empty_up_to_date();
-
-  const dimension_type space_dim = space_dimension();
-  if (space_dim == 0) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  typedef typename BD_Shape<T>::coefficient_type Coeff;
-  PPL_DIRTY_TEMP(Coeff, tmp);
-  const DB_Row<Coeff>& dbm_0 = bds.dbm[0];
-  for (dimension_type i = space_dim; i-- > 0; ) {
-    I_Constraint<Coeff> lower;
-    I_Constraint<Coeff> upper;
-    ITV& seq_i = seq[i];
-
-    // Set the upper bound.
-    const Coeff& u = dbm_0[i+1];
-    if (!is_plus_infinity(u))
-      upper.set(LESS_OR_EQUAL, u, true);
-
-    // Set the lower bound.
-    const Coeff& negated_l = bds.dbm[i+1][0];
-    if (!is_plus_infinity(negated_l)) {
-      neg_assign_r(tmp, negated_l, ROUND_DOWN);
-      lower.set(GREATER_OR_EQUAL, tmp);
-    }
-
-    seq_i.build(lower, upper);
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-template <typename T>
-Box<ITV>::Box(const Octagonal_Shape<T>& oct, Complexity_Class)
-  : seq(check_space_dimension_overflow(oct.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(oct)",
-                                       "oct exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  // Expose all the interval constraints.
-  oct.strong_closure_assign();
-  if (oct.marked_empty()) {
-    set_empty();
-    return;
-  }
-
-  // The empty flag will be meaningful, whatever happens from now on.
-  set_empty_up_to_date();
-
-  const dimension_type space_dim = space_dimension();
-  if (space_dim == 0)
-    return;
-
-  PPL_DIRTY_TEMP(mpq_class, lower_bound);
-  PPL_DIRTY_TEMP(mpq_class, upper_bound);
-  for (dimension_type i = space_dim; i-- > 0; ) {
-    typedef typename Octagonal_Shape<T>::coefficient_type Coeff;
-    I_Constraint<mpq_class> lower;
-    I_Constraint<mpq_class> upper;
-    ITV& seq_i = seq[i];
-    const dimension_type ii = 2*i;
-    const dimension_type cii = ii + 1;
-
-    // Set the upper bound.
-    const Coeff& twice_ub = oct.matrix[cii][ii];
-    if (!is_plus_infinity(twice_ub)) {
-      assign_r(upper_bound, twice_ub, ROUND_NOT_NEEDED);
-      div_2exp_assign_r(upper_bound, upper_bound, 1, ROUND_NOT_NEEDED);
-      upper.set(LESS_OR_EQUAL, upper_bound);
-    }
-
-    // Set the lower bound.
-    const Coeff& twice_lb = oct.matrix[ii][cii];
-    if (!is_plus_infinity(twice_lb)) {
-      assign_r(lower_bound, twice_lb, ROUND_NOT_NEEDED);
-      neg_assign_r(lower_bound, lower_bound, ROUND_NOT_NEEDED);
-      div_2exp_assign_r(lower_bound, lower_bound, 1, ROUND_NOT_NEEDED);
-      lower.set(GREATER_OR_EQUAL, lower_bound);
-    }
-    seq_i.build(lower, upper);
-  }
-}
-
-template <typename ITV>
-Box<ITV>::Box(const Polyhedron& ph, Complexity_Class complexity)
-  : seq(check_space_dimension_overflow(ph.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(ph)",
-                                       "ph exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-  // The empty flag will be meaningful, whatever happens from now on.
-  set_empty_up_to_date();
-
-  // We do not need to bother about `complexity' if:
-  // a) the polyhedron is already marked empty; or ...
-  if (ph.marked_empty()) {
-    set_empty();
-    return;
-  }
-
-  // b) the polyhedron is zero-dimensional; or ...
-  const dimension_type space_dim = ph.space_dimension();
-  if (space_dim == 0)
-    return;
-
-  // c) the polyhedron is already described by a generator system.
-  if (ph.generators_are_up_to_date() && !ph.has_pending_constraints()) {
-    Box tmp(ph.generators());
-    m_swap(tmp);
-    return;
-  }
-
-  // Here generators are not up-to-date or there are pending constraints.
-  PPL_ASSERT(ph.constraints_are_up_to_date());
-
-  if (complexity == POLYNOMIAL_COMPLEXITY) {
-    // FIXME: is there a way to avoid this initialization?
-    for (dimension_type i = space_dim; i-- > 0; )
-      seq[i].assign(UNIVERSE);
-    // Get a simplified version of the constraints.
-    Constraint_System cs = ph.simplified_constraints();
-    // Propagate easy-to-find bounds from the constraints,
-    // allowing for a limited number of iterations.
-    // FIXME: 20 is just a wild guess.
-    const dimension_type max_iterations = 20;
-    propagate_constraints_no_check(cs, max_iterations);
-  }
-  else if (complexity == SIMPLEX_COMPLEXITY) {
-    MIP_Problem lp(space_dim);
-    const Constraint_System& ph_cs = ph.constraints();
-    if (!ph_cs.has_strict_inequalities())
-      lp.add_constraints(ph_cs);
-    else
-      // Adding to `lp' a topologically closed version of `ph_cs'.
-      for (Constraint_System::const_iterator i = ph_cs.begin(),
-	     ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
-	const Constraint& c = *i;
-	if (c.is_strict_inequality())
-	  lp.add_constraint(Linear_Expression(c) >= 0);
-	else
-	  lp.add_constraint(c);
-      }
-    // Check for unsatisfiability.
-    if (!lp.is_satisfiable()) {
-      set_empty();
-      return;
-    }
-    // Get all the bounds for the space dimensions.
-    Generator g(point());
-    PPL_DIRTY_TEMP(mpq_class, lower_bound);
-    PPL_DIRTY_TEMP(mpq_class, upper_bound);
-    PPL_DIRTY_TEMP(Coefficient, bound_numer);
-    PPL_DIRTY_TEMP(Coefficient, bound_denom);
-    for (dimension_type i = space_dim; i-- > 0; ) {
-      I_Constraint<mpq_class> lower;
-      I_Constraint<mpq_class> upper;
-      ITV& seq_i = seq[i];
-      lp.set_objective_function(Variable(i));
-      // Evaluate upper bound.
-      lp.set_optimization_mode(MAXIMIZATION);
-      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-	g = lp.optimizing_point();
-	lp.evaluate_objective_function(g, bound_numer, bound_denom);
-	assign_r(upper_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
-	assign_r(upper_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
-	PPL_ASSERT(is_canonical(upper_bound));
-	upper.set(LESS_OR_EQUAL, upper_bound);
-      }
-      // Evaluate optimal lower bound.
-      lp.set_optimization_mode(MINIMIZATION);
-      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-	g = lp.optimizing_point();
-	lp.evaluate_objective_function(g, bound_numer, bound_denom);
-	assign_r(lower_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
-	assign_r(lower_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
-	PPL_ASSERT(is_canonical(lower_bound));
-	lower.set(GREATER_OR_EQUAL, lower_bound);
-      }
-      seq_i.build(lower, upper);
-    }
-  }
-  else {
-    PPL_ASSERT(complexity == ANY_COMPLEXITY);
-    if (ph.is_empty())
-      set_empty();
-    else {
-      Box tmp(ph.generators());
-      m_swap(tmp);
-    }
-  }
-}
-
-template <typename ITV>
-Box<ITV>::Box(const Grid& gr, Complexity_Class)
-  : seq(check_space_dimension_overflow(gr.space_dimension(),
-                                       max_space_dimension(),
-                                       "PPL::Box::",
-                                       "Box(gr)",
-                                       "gr exceeds the maximum "
-                                       "allowed space dimension")),
-    status() {
-
-  if (gr.marked_empty()) {
-    set_empty();
-    return;
-  }
-
-  // The empty flag will be meaningful, whatever happens from now on.
-  set_empty_up_to_date();
-
-  const dimension_type space_dim = gr.space_dimension();
-
-  if (space_dim == 0)
-    return;
-
-  if (!gr.generators_are_up_to_date() && !gr.update_generators()) {
-    // Updating found the grid empty.
-    set_empty();
-    return;
-  }
-
-  PPL_ASSERT(!gr.gen_sys.empty());
-
-  // For each dimension that is bounded by the grid, set both bounds
-  // of the interval to the value of the associated coefficient in a
-  // generator point.
-  PPL_DIRTY_TEMP(mpq_class, bound);
-  PPL_DIRTY_TEMP(Coefficient, bound_numer);
-  PPL_DIRTY_TEMP(Coefficient, bound_denom);
-  for (dimension_type i = space_dim; i-- > 0; ) {
-    ITV& seq_i = seq[i];
-    Variable var(i);
-    bool max;
-    if (gr.maximize(var, bound_numer, bound_denom, max)) {
-      assign_r(bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
-      assign_r(bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
-      bound.canonicalize();
-      seq_i.build(i_constraint(EQUAL, bound));
-    }
-    else
-      seq_i.assign(UNIVERSE);
-  }
-}
-
-template <typename ITV>
-template <typename D1, typename D2, typename R>
-Box<ITV>::Box(const Partially_Reduced_Product<D1, D2, R>& dp,
-              Complexity_Class complexity)
-  : seq(), status() {
-  check_space_dimension_overflow(dp.space_dimension(),
-                                 max_space_dimension(),
-                                 "PPL::Box::",
-                                 "Box(dp)",
-                                 "dp exceeds the maximum "
-                                 "allowed space dimension");
-  Box tmp1(dp.domain1(), complexity);
-  Box tmp2(dp.domain2(), complexity);
-  tmp1.intersection_assign(tmp2);
-  m_swap(tmp1);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::add_space_dimensions_and_embed(const dimension_type m) {
-  // Adding no dimensions is a no-op.
-  if (m == 0)
-    return;
-  check_space_dimension_overflow(m, max_space_dimension() - space_dimension(),
-                                 "PPL::Box::",
-                                 "add_space_dimensions_and_embed(m)",
-                                 "adding m new space dimensions exceeds "
-                                 "the maximum allowed space dimension");
-  // To embed an n-dimension space box in a (n+m)-dimension space,
-  // we just add `m' new universe elements to the sequence.
-  seq.insert(seq.end(), m, ITV(UNIVERSE));
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::add_space_dimensions_and_project(const dimension_type m) {
-  // Adding no dimensions is a no-op.
-  if (m == 0)
-    return;
-  check_space_dimension_overflow(m, max_space_dimension() - space_dimension(),
-                                 "PPL::Box::",
-                                 "add_space_dimensions_and_project(m)",
-                                 "adding m new space dimensions exceeds "
-                                 "the maximum allowed space dimension");
-  // Add `m' new zero elements to the sequence.
-  seq.insert(seq.end(), m, ITV(0));
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-bool
-operator==(const Box<ITV>& x, const Box<ITV>& y) {
-  const dimension_type x_space_dim = x.space_dimension();
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  if (x.is_empty())
-    return y.is_empty();
-
-  if (y.is_empty())
-    return x.is_empty();
-
-  for (dimension_type k = x_space_dim; k-- > 0; )
-    if (x.seq[k] != y.seq[k])
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::bounds(const Linear_Expression& expr, const bool from_above) const {
-  // `expr' should be dimension-compatible with `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  const dimension_type space_dim = space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((from_above
-				  ? "bounds_from_above(e)"
-				  : "bounds_from_below(e)"), "e", expr);
-  // A zero-dimensional or empty Box bounds everything.
-  if (space_dim == 0 || is_empty())
-    return true;
-
-  const int from_above_sign = from_above ? 1 : -1;
-  // TODO: This loop can be optimized more, if needed, exploiting the
-  // (possible) sparseness of expr.
-  for (Linear_Expression::const_iterator i = expr.begin(),
-          i_end = expr.end(); i != i_end; ++i) {
-    const Variable v = i.variable();
-    switch (sgn(*i) * from_above_sign) {
-    case 1:
-      if (seq[v.id()].upper_is_boundary_infinity())
-	return false;
-      break;
-    case 0:
-      PPL_UNREACHABLE;
-      break;
-    case -1:
-      if (seq[v.id()].lower_is_boundary_infinity())
-	return false;
-      break;
-    }
-  }
-  return true;
-}
-
-template <typename ITV>
-Poly_Con_Relation
-interval_relation(const ITV& i,
-		  const Constraint::Type constraint_type,
-		  Coefficient_traits::const_reference numer,
-		  Coefficient_traits::const_reference denom) {
-
-  if (i.is_universe())
-    return Poly_Con_Relation::strictly_intersects();
-
-  PPL_DIRTY_TEMP(mpq_class, bound);
-  assign_r(bound.get_num(), numer, ROUND_NOT_NEEDED);
-  assign_r(bound.get_den(), denom, ROUND_NOT_NEEDED);
-  bound.canonicalize();
-  neg_assign_r(bound, bound, ROUND_NOT_NEEDED);
-  const bool is_lower_bound = (denom > 0);
-
-  PPL_DIRTY_TEMP(mpq_class, bound_diff);
-  if (constraint_type == Constraint::EQUALITY) {
-    if (i.lower_is_boundary_infinity()) {
-      PPL_ASSERT(!i.upper_is_boundary_infinity());
-      assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-      switch (sgn(bound_diff)) {
-      case 1:
-	return Poly_Con_Relation::strictly_intersects();
-      case 0:
-	return i.upper_is_open()
-	  ? Poly_Con_Relation::is_disjoint()
-	  : Poly_Con_Relation::strictly_intersects();
-      case -1:
-	return Poly_Con_Relation::is_disjoint();
-      }
-    }
-    else {
-      assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
-      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-      switch (sgn(bound_diff)) {
-      case 1:
-	return Poly_Con_Relation::is_disjoint();
-      case 0:
-	if (i.lower_is_open())
-	  return Poly_Con_Relation::is_disjoint();
-        if (i.is_singleton())
-          return Poly_Con_Relation::is_included()
-            && Poly_Con_Relation::saturates();
-        return Poly_Con_Relation::strictly_intersects();
-      case -1:
-	if (i.upper_is_boundary_infinity())
-	  return Poly_Con_Relation::strictly_intersects();
-	else {
-	  assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-	  sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-	  switch (sgn(bound_diff)) {
-	  case 1:
-	    return Poly_Con_Relation::strictly_intersects();
-	  case 0:
-	    if (i.upper_is_open())
-	      return Poly_Con_Relation::is_disjoint();
-	    else
-	      return Poly_Con_Relation::strictly_intersects();
-	  case -1:
-	    return Poly_Con_Relation::is_disjoint();
-	  }
-	}
-      }
-    }
-  }
-
-  PPL_ASSERT(constraint_type != Constraint::EQUALITY);
-  if (is_lower_bound) {
-    if (i.lower_is_boundary_infinity()) {
-      PPL_ASSERT(!i.upper_is_boundary_infinity());
-      assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-      switch (sgn(bound_diff)) {
-      case 1:
-	return Poly_Con_Relation::strictly_intersects();
-      case 0:
-	if (constraint_type == Constraint::STRICT_INEQUALITY
-	    || i.upper_is_open())
-	  return Poly_Con_Relation::is_disjoint();
-	else
-	  return Poly_Con_Relation::strictly_intersects();
-      case -1:
-	return Poly_Con_Relation::is_disjoint();
-      }
-    }
-    else {
-      assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
-      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-      switch (sgn(bound_diff)) {
-      case 1:
-	return Poly_Con_Relation::is_included();
-      case 0:
-	if (constraint_type == Constraint::NONSTRICT_INEQUALITY
-	    || i.lower_is_open()) {
-	  Poly_Con_Relation result = Poly_Con_Relation::is_included();
-	  if (i.is_singleton())
-	    result = result && Poly_Con_Relation::saturates();
-	  return result;
-	}
-	else {
-	  PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
-		 && !i.lower_is_open());
-	  if (i.is_singleton())
-	    return Poly_Con_Relation::is_disjoint()
-	      && Poly_Con_Relation::saturates();
-	  else
-	    return Poly_Con_Relation::strictly_intersects();
-	}
-      case -1:
-	if (i.upper_is_boundary_infinity())
-	  return Poly_Con_Relation::strictly_intersects();
-	else {
-	  assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-	  sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-	  switch (sgn(bound_diff)) {
-	  case 1:
-	    return Poly_Con_Relation::strictly_intersects();
-	  case 0:
-	    if (constraint_type == Constraint::STRICT_INEQUALITY
-		|| i.upper_is_open())
-	      return Poly_Con_Relation::is_disjoint();
-	    else
-	      return Poly_Con_Relation::strictly_intersects();
-	  case -1:
-	    return Poly_Con_Relation::is_disjoint();
-	  }
-	}
-      }
-    }
-  }
-  else {
-    // `c' is an upper bound.
-    if (i.upper_is_boundary_infinity())
-      return Poly_Con_Relation::strictly_intersects();
-    else {
-      assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-      switch (sgn(bound_diff)) {
-      case -1:
-	return Poly_Con_Relation::is_included();
-      case 0:
-	if (constraint_type == Constraint::NONSTRICT_INEQUALITY
-	    || i.upper_is_open()) {
-	  Poly_Con_Relation result = Poly_Con_Relation::is_included();
-	  if (i.is_singleton())
-	    result = result && Poly_Con_Relation::saturates();
-	  return result;
-	}
-	else {
-	  PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
-		 && !i.upper_is_open());
-	  if (i.is_singleton())
-	    return Poly_Con_Relation::is_disjoint()
-	      && Poly_Con_Relation::saturates();
-	  else
-	    return Poly_Con_Relation::strictly_intersects();
-	}
-      case 1:
-	if (i.lower_is_boundary_infinity())
-	  return Poly_Con_Relation::strictly_intersects();
-	else {
-	  assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
-	  sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-	  switch (sgn(bound_diff)) {
-	  case -1:
-	    return Poly_Con_Relation::strictly_intersects();
-	  case 0:
-	    if (constraint_type == Constraint::STRICT_INEQUALITY
-		|| i.lower_is_open())
-	      return Poly_Con_Relation::is_disjoint();
-	    else
-	      return Poly_Con_Relation::strictly_intersects();
-	  case 1:
-	    return Poly_Con_Relation::is_disjoint();
-	  }
-	}
-      }
-    }
-  }
-
-  // Quiet a compiler warning: this program point is unreachable.
-  PPL_UNREACHABLE;
-  return Poly_Con_Relation::nothing();
-}
-
-template <typename ITV>
-Poly_Con_Relation
-Box<ITV>::relation_with(const Congruence& cg) const {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (cg_space_dim > space_dim)
-    throw_dimension_incompatible("relation_with(cg)", cg);
-
-  if (is_empty())
-    return Poly_Con_Relation::saturates()
-      && Poly_Con_Relation::is_included()
-      && Poly_Con_Relation::is_disjoint();
-
-  if (space_dim == 0) {
-    if (cg.is_inconsistent())
-      return Poly_Con_Relation::is_disjoint();
-    else
-      return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
-  }
-
-  if (cg.is_equality()) {
-    const Constraint c(cg);
-    return relation_with(c);
-  }
-
-  PPL_DIRTY_TEMP(Rational_Interval, r);
-  PPL_DIRTY_TEMP(Rational_Interval, t);
-  PPL_DIRTY_TEMP(mpq_class, m);
-  r = 0;
-  for (Congruence::Expression::const_iterator i = cg.expression().begin(),
-      i_end = cg.expression().end(); i != i_end; ++i) {
-    const Coefficient& cg_i = *i;
-    const Variable v = i.variable();
-    assign_r(m, cg_i, ROUND_NOT_NEEDED);
-    // FIXME: an add_mul_assign() method would come handy here.
-    t.build(seq[v.id()].lower_constraint(), seq[v.id()].upper_constraint());
-    t *= m;
-    r += t;
-  }
-
-  if (r.lower_is_boundary_infinity() || r.upper_is_boundary_infinity())
-    return Poly_Con_Relation::strictly_intersects();
-
-
-  // Find the value that satisfies the congruence and is
-  // nearest to the lower bound such that the point lies on or above it.
-
-  PPL_DIRTY_TEMP_COEFFICIENT(lower);
-  PPL_DIRTY_TEMP_COEFFICIENT(mod);
-  PPL_DIRTY_TEMP_COEFFICIENT(v);
-  mod = cg.modulus();
-  v = cg.inhomogeneous_term() % mod;
-  assign_r(lower, r.lower(), ROUND_DOWN);
-  v -= ((lower / mod) * mod);
-  if (v + lower > 0)
-    v -= mod;
-  return interval_relation(r, Constraint::EQUALITY, v);
-}
-
-template <typename ITV>
-Poly_Con_Relation
-Box<ITV>::relation_with(const Constraint& c) const {
-  const dimension_type c_space_dim = c.space_dimension();
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dim)
-    throw_dimension_incompatible("relation_with(c)", c);
-
-  if (is_empty())
-    return Poly_Con_Relation::saturates()
-      && Poly_Con_Relation::is_included()
-      && Poly_Con_Relation::is_disjoint();
-
-  if (space_dim == 0) {
-    if ((c.is_equality() && c.inhomogeneous_term() != 0)
-	|| (c.is_inequality() && c.inhomogeneous_term() < 0))
-      return Poly_Con_Relation::is_disjoint();
-    else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
-      // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
-      // thus, the zero-dimensional point also saturates it.
-      return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_disjoint();
-    else if (c.is_equality() || c.inhomogeneous_term() == 0)
-      return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
-    else
-      // The zero-dimensional point saturates
-      // neither the positivity constraint 1 >= 0,
-      // nor the strict positivity constraint 1 > 0.
-      return Poly_Con_Relation::is_included();
-  }
-
-  dimension_type c_num_vars = 0;
-  dimension_type c_only_var = 0;
-
-  if (Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var))
-    if (c_num_vars == 0)
-      // c is a trivial constraint.
-      switch (sgn(c.inhomogeneous_term())) {
-      case -1:
-	return Poly_Con_Relation::is_disjoint();
-      case 0:
-	if (c.is_strict_inequality())
-	  return Poly_Con_Relation::saturates()
-	    && Poly_Con_Relation::is_disjoint();
-	else
-	  return Poly_Con_Relation::saturates()
-	    && Poly_Con_Relation::is_included();
-      case 1:
-	return Poly_Con_Relation::is_included();
-      }
-    else {
-      // c is an interval constraint.
-      return interval_relation(seq[c_only_var],
-			       c.type(),
-			       c.inhomogeneous_term(),
-			       c.coefficient(Variable(c_only_var)));
-    }
-  else {
-    // Deal with a non-trivial and non-interval constraint.
-    PPL_DIRTY_TEMP(Rational_Interval, r);
-    PPL_DIRTY_TEMP(Rational_Interval, t);
-    PPL_DIRTY_TEMP(mpq_class, m);
-    r = 0;
-    const Constraint::Expression& e = c.expression();
-    for (Constraint::Expression::const_iterator i = e.begin(), i_end = e.end();
-          i != i_end; ++i) {
-      assign_r(m, *i, ROUND_NOT_NEEDED);
-      const Variable v = i.variable();
-      // FIXME: an add_mul_assign() method would come handy here.
-      t.build(seq[v.id()].lower_constraint(), seq[v.id()].upper_constraint());
-      t *= m;
-      r += t;
-    }
-    return interval_relation(r,
-			     c.type(),
-			     c.inhomogeneous_term());
-  }
-
-  // Quiet a compiler warning: this program point is unreachable.
-  PPL_UNREACHABLE;
-  return Poly_Con_Relation::nothing();
-}
-
-template <typename ITV>
-Poly_Gen_Relation
-Box<ITV>::relation_with(const Generator& g) const {
-  const dimension_type space_dim = space_dimension();
-  const dimension_type g_space_dim = g.space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim < g_space_dim)
-    throw_dimension_incompatible("relation_with(g)", g);
-
-  // The empty box cannot subsume a generator.
-  if (is_empty())
-    return Poly_Gen_Relation::nothing();
-
-  // A universe box in a zero-dimensional space subsumes
-  // all the generators of a zero-dimensional space.
-  if (space_dim == 0)
-    return Poly_Gen_Relation::subsumes();
-
-  if (g.is_line_or_ray()) {
-    if (g.is_line()) {
-      const Generator::Expression& e = g.expression();
-      for (Generator::Expression::const_iterator i = e.begin(), i_end = e.end();
-           i != i_end; ++i)
-	if (!seq[i.variable().id()].is_universe())
-	  return Poly_Gen_Relation::nothing();
-      return Poly_Gen_Relation::subsumes();
-    }
-    else {
-      PPL_ASSERT(g.is_ray());
-      const Generator::Expression& e = g.expression();
-      for (Generator::Expression::const_iterator i = e.begin(), i_end = e.end();
-           i != i_end; ++i) {
-        const Variable v = i.variable();
-	switch (sgn(*i)) {
-	case 1:
-	  if (!seq[v.id()].upper_is_boundary_infinity())
-	    return Poly_Gen_Relation::nothing();
-	  break;
-	case 0:
-          PPL_UNREACHABLE;
-	  break;
-	case -1:
-	  if (!seq[v.id()].lower_is_boundary_infinity())
-	    return Poly_Gen_Relation::nothing();
-	  break;
-	}
-      }
-      return Poly_Gen_Relation::subsumes();
-    }
-  }
-
-  // Here `g' is a point or closure point.
-  const Coefficient& g_divisor = g.divisor();
-  PPL_DIRTY_TEMP(mpq_class, g_coord);
-  PPL_DIRTY_TEMP(mpq_class, bound);
-  // TODO: If the variables in the expression that have coefficient 0
-  // have no effect on seq[i], this loop can be optimized using
-  // Generator::Expression::const_iterator.
-  for (dimension_type i = g_space_dim; i-- > 0; ) {
-    const ITV& seq_i = seq[i];
-    if (seq_i.is_universe())
-      continue;
-    assign_r(g_coord.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-    assign_r(g_coord.get_den(), g_divisor, ROUND_NOT_NEEDED);
-    g_coord.canonicalize();
-    // Check lower bound.
-    if (!seq_i.lower_is_boundary_infinity()) {
-      assign_r(bound, seq_i.lower(), ROUND_NOT_NEEDED);
-      if (g_coord <= bound) {
-	if (seq_i.lower_is_open()) {
-	  if (g.is_point() || g_coord != bound)
-	    return Poly_Gen_Relation::nothing();
-	}
-	else if (g_coord != bound)
-	  return Poly_Gen_Relation::nothing();
-      }
-    }
-    // Check upper bound.
-    if (!seq_i.upper_is_boundary_infinity()) {
-      assign_r(bound, seq_i.upper(), ROUND_NOT_NEEDED);
-      if (g_coord >= bound) {
-	if (seq_i.upper_is_open()) {
-	  if (g.is_point() || g_coord != bound)
-	    return Poly_Gen_Relation::nothing();
-	}
-	else if (g_coord != bound)
-	  return Poly_Gen_Relation::nothing();
-      }
-    }
-  }
-  return Poly_Gen_Relation::subsumes();
-}
-
-
-template <typename ITV>
-bool
-Box<ITV>::max_min(const Linear_Expression& expr,
-                  const bool maximize,
-                  Coefficient& ext_n, Coefficient& ext_d,
-                  bool& included) const {
-  // `expr' should be dimension-compatible with `*this'.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((maximize
-				  ? "maximize(e, ...)"
-				  : "minimize(e, ...)"), "e", expr);
-  // Deal with zero-dim Box first.
-  if (space_dim == 0) {
-    if (marked_empty())
-      return false;
-    else {
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      return true;
-    }
-  }
-
-  // For an empty Box we simply return false.
-  if (is_empty())
-    return false;
-
-  PPL_DIRTY_TEMP(mpq_class, result);
-  assign_r(result, expr.inhomogeneous_term(), ROUND_NOT_NEEDED);
-  bool is_included = true;
-  const int maximize_sign = maximize ? 1 : -1;
-  PPL_DIRTY_TEMP(mpq_class, bound_i);
-  PPL_DIRTY_TEMP(mpq_class, expr_i);
-  for (Linear_Expression::const_iterator i = expr.begin(),
-          i_end = expr.end(); i != i_end; ++i) {
-    const ITV& seq_i = seq[i.variable().id()];
-    assign_r(expr_i, *i, ROUND_NOT_NEEDED);
-    switch (sgn(expr_i) * maximize_sign) {
-    case 1:
-      if (seq_i.upper_is_boundary_infinity())
-	return false;
-      assign_r(bound_i, seq_i.upper(), ROUND_NOT_NEEDED);
-      add_mul_assign_r(result, bound_i, expr_i, ROUND_NOT_NEEDED);
-      if (seq_i.upper_is_open())
-	is_included = false;
-      break;
-    case 0:
-      PPL_UNREACHABLE;
-      break;
-    case -1:
-      if (seq_i.lower_is_boundary_infinity())
-	return false;
-      assign_r(bound_i, seq_i.lower(), ROUND_NOT_NEEDED);
-      add_mul_assign_r(result, bound_i, expr_i, ROUND_NOT_NEEDED);
-      if (seq_i.lower_is_open())
-	is_included = false;
-      break;
-    }
-  }
-  // Extract output info.
-  PPL_ASSERT(is_canonical(result));
-  ext_n = result.get_num();
-  ext_d = result.get_den();
-  included = is_included;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::max_min(const Linear_Expression& expr,
-                  const bool maximize,
-                  Coefficient& ext_n, Coefficient& ext_d,
-                  bool& included,
-                  Generator& g) const {
-  if (!max_min(expr, maximize, ext_n, ext_d, included))
-    return false;
-
-  // Compute generator `g'.
-  Linear_Expression g_expr;
-  PPL_DIRTY_TEMP(Coefficient, g_divisor);
-  g_divisor = 1;
-  const int maximize_sign = maximize ? 1 : -1;
-  PPL_DIRTY_TEMP(mpq_class, g_coord);
-  PPL_DIRTY_TEMP(Coefficient, numer);
-  PPL_DIRTY_TEMP(Coefficient, denom);
-  PPL_DIRTY_TEMP(Coefficient, lcm);
-  PPL_DIRTY_TEMP(Coefficient, factor);
-  // TODO: Check if the following loop can be optimized to exploit the
-  // (possible) sparseness of expr.
-  for (dimension_type i = space_dimension(); i-- > 0; ) {
-    const ITV& seq_i = seq[i];
-    switch (sgn(expr.coefficient(Variable(i))) * maximize_sign) {
-    case 1:
-      assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
-      break;
-    case 0:
-      // If 0 belongs to the interval, choose it
-      // (and directly proceed to the next iteration).
-      // FIXME: name qualification issue.
-      if (seq_i.contains(0))
-	continue;
-      if (!seq_i.lower_is_boundary_infinity())
-	if (seq_i.lower_is_open())
-	  if (!seq_i.upper_is_boundary_infinity())
-	    if (seq_i.upper_is_open()) {
-	      // Bounded and open interval: compute middle point.
-	      assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
-	      PPL_DIRTY_TEMP(mpq_class, q_seq_i_upper);
-	      assign_r(q_seq_i_upper, seq_i.upper(), ROUND_NOT_NEEDED);
-	      g_coord += q_seq_i_upper;
-	      g_coord /= 2;
-	    }
-	    else
-	      // The upper bound is in the interval.
-	      assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
-	  else {
-	    // Lower is open, upper is unbounded.
-	    assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
-	    ++g_coord;
-	  }
-	else
-	  // The lower bound is in the interval.
-	  assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
-      else {
-	// Lower is unbounded, hence upper is bounded
-	// (since we know that 0 does not belong to the interval).
-	PPL_ASSERT(!seq_i.upper_is_boundary_infinity());
-	assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
-	if (seq_i.upper_is_open())
-	  --g_coord;
-      }
-      break;
-    case -1:
-      assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
-      break;
-    }
-    // Add g_coord * Variable(i) to the generator.
-    assign_r(denom, g_coord.get_den(), ROUND_NOT_NEEDED);
-    lcm_assign(lcm, g_divisor, denom);
-    exact_div_assign(factor, lcm, g_divisor);
-    g_expr *= factor;
-    exact_div_assign(factor, lcm, denom);
-    assign_r(numer, g_coord.get_num(), ROUND_NOT_NEEDED);
-    numer *= factor;
-    g_expr += numer * Variable(i);
-    g_divisor = lcm;
-  }
-  g = Generator::point(g_expr, g_divisor);
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::contains(const Box& y) const {
-  const Box& x = *this;
-  // Dimension-compatibility check.
-  if (x.space_dimension() != y.space_dimension())
-    x.throw_dimension_incompatible("contains(y)", y);
-
-  // If `y' is empty, then `x' contains `y'.
-  if (y.is_empty())
-    return true;
-
-  // If `x' is empty, then `x' cannot contain `y'.
-  if (x.is_empty())
-    return false;
-
-  for (dimension_type k = x.seq.size(); k-- > 0; )
-    // FIXME: fix this name qualification issue.
-    if (!x.seq[k].contains(y.seq[k]))
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::is_disjoint_from(const Box& y) const {
-  const Box& x = *this;
-  // Dimension-compatibility check.
-  if (x.space_dimension() != y.space_dimension())
-    x.throw_dimension_incompatible("is_disjoint_from(y)", y);
-
-  // If any of `x' or `y' is marked empty, then they are disjoint.
-  // Note: no need to use `is_empty', as the following loop is anyway correct.
-  if (x.marked_empty() || y.marked_empty())
-    return true;
-
-  for (dimension_type k = x.seq.size(); k-- > 0; )
-    // FIXME: fix this name qualification issue.
-    if (x.seq[k].is_disjoint_from(y.seq[k]))
-      return true;
-  return false;
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::upper_bound_assign_if_exact(const Box& y) {
-  Box& x = *this;
-
-  // Dimension-compatibility check.
-  if (x.space_dimension() != y.space_dimension())
-    x.throw_dimension_incompatible("upper_bound_assign_if_exact(y)", y);
-
-  // The lub of a box with an empty box is equal to the first box.
-  if (y.is_empty())
-    return true;
-  if (x.is_empty()) {
-    x = y;
-    return true;
-  }
-
-  bool x_j_does_not_contain_y_j = false;
-  bool y_j_does_not_contain_x_j = false;
-
-  for (dimension_type i = x.seq.size(); i-- > 0; ) {
-    const ITV& x_seq_i = x.seq[i];
-    const ITV& y_seq_i = y.seq[i];
-
-    if (!x_seq_i.can_be_exactly_joined_to(y_seq_i))
-      return false;
-
-    // Note: the use of `y_i_does_not_contain_x_i' is needed
-    // because we want to temporarily preserve the old value
-    // of `y_j_does_not_contain_x_j'.
-    bool y_i_does_not_contain_x_i = !y_seq_i.contains(x_seq_i);
-    if (y_i_does_not_contain_x_i && x_j_does_not_contain_y_j)
-      return false;
-    if (!x_seq_i.contains(y_seq_i)) {
-      if (y_j_does_not_contain_x_j)
-        return false;
-      else
-        x_j_does_not_contain_y_j = true;
-    }
-    if (y_i_does_not_contain_x_i)
-      y_j_does_not_contain_x_j = true;
-  }
-
-  // The upper bound is exact: compute it into *this.
-  for (dimension_type k = x.seq.size(); k-- > 0; )
-    x.seq[k].join_assign(y.seq[k]);
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::OK() const {
-  if (status.test_empty_up_to_date() && !status.test_empty()) {
-    Box tmp = *this;
-    tmp.reset_empty_up_to_date();
-    if (tmp.check_empty()) {
-#ifndef NDEBUG
-      std::cerr << "The box is empty, but it is marked as non-empty."
-		<< std::endl;
-#endif // NDEBUG
-      return false;
-    }
-  }
-
-  // A box that is not marked empty must have meaningful intervals.
-  if (!marked_empty()) {
-    for (dimension_type k = seq.size(); k-- > 0; )
-      if (!seq[k].OK())
-	return false;
-  }
-
-  return true;
-}
-
-template <typename ITV>
-dimension_type
-Box<ITV>::affine_dimension() const {
-  dimension_type d = space_dimension();
-  // A zero-space-dim box always has affine dimension zero.
-  if (d == 0)
-    return 0;
-
-  // An empty box has affine dimension zero.
-  if (is_empty())
-    return 0;
-
-  for (dimension_type k = d; k-- > 0; )
-    if (seq[k].is_singleton())
-      --d;
-
-  return d;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::check_empty() const {
-  PPL_ASSERT(!marked_empty());
-  Box<ITV>& x = const_cast<Box<ITV>&>(*this);
-  for (dimension_type k = seq.size(); k-- > 0; )
-    if (seq[k].is_empty()) {
-      x.set_empty();
-      return true;
-    }
-  x.set_nonempty();
-  return false;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::is_universe() const {
-  if (marked_empty())
-    return false;
-  for (dimension_type k = seq.size(); k-- > 0; )
-    if (!seq[k].is_universe())
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::is_topologically_closed() const {
-  if (ITV::is_always_topologically_closed() || is_empty())
-    return true;
-
-  for (dimension_type k = seq.size(); k-- > 0; )
-    if (!seq[k].is_topologically_closed())
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::is_discrete() const {
-  if (is_empty())
-    return true;
-  for (dimension_type k = seq.size(); k-- > 0; )
-    if (!seq[k].is_singleton())
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::is_bounded() const {
-  if (is_empty())
-    return true;
-  for (dimension_type k = seq.size(); k-- > 0; )
-    if (!seq[k].is_bounded())
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::contains_integer_point() const {
-  if (marked_empty())
-    return false;
-  for (dimension_type k = seq.size(); k-- > 0; )
-    if (!seq[k].contains_integer_point())
-      return false;
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::frequency(const Linear_Expression& expr,
-                  Coefficient& freq_n, Coefficient& freq_d,
-                  Coefficient& val_n, Coefficient& val_d) const {
-  dimension_type space_dim = space_dimension();
-  // The dimension of `expr' must be at most the dimension of *this.
-  if (space_dim < expr.space_dimension())
-    throw_dimension_incompatible("frequency(e, ...)", "e", expr);
-
-  // Check if `expr' has a constant value.
-  // If it is constant, set the frequency `freq_n' to 0
-  // and return true. Otherwise the values for \p expr
-  // are not discrete so return false.
-
-  // Space dimension is 0: if empty, then return false;
-  // otherwise the frequency is 0 and the value is the inhomogeneous term.
-  if (space_dim == 0) {
-    if (is_empty())
-      return false;
-    freq_n = 0;
-    freq_d = 1;
-    val_n = expr.inhomogeneous_term();
-    val_d = 1;
-    return true;
-  }
-
-  // For an empty Box, we simply return false.
-  if (is_empty())
-    return false;
-
-  // The Box has at least 1 dimension and is not empty.
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  PPL_DIRTY_TEMP(mpq_class, tmp);
-  Coefficient c = expr.inhomogeneous_term();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
-  val_denom = 1;
-
-  for (Linear_Expression::const_iterator i = expr.begin(), i_end = expr.end();
-       i != i_end; ++i) {
-    const ITV& seq_i = seq[i.variable().id()];
-    // Check if `v' is constant in the BD shape.
-    if (seq_i.is_singleton()) {
-      // If `v' is constant, replace it in `le' by the value.
-      assign_r(tmp, seq_i.lower(), ROUND_NOT_NEEDED);
-      numer = tmp.get_num();
-      denom = tmp.get_den();
-      c *= denom;
-      c += numer * val_denom * (*i);
-      val_denom *= denom;
-      continue;
-    }
-    // The expression `expr' is not constant.
-    return false;
-  }
-
-  // The expression `expr' is constant.
-  freq_n = 0;
-  freq_d = 1;
-
-  // Reduce `val_n' and `val_d'.
-  normalize2(c, val_denom, val_n, val_d);
-  return true;
-}
-
-template <typename ITV>
-bool
-Box<ITV>::constrains(Variable var) const {
-  // `var' should be one of the dimensions of the polyhedron.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dimension() < var_space_dim)
-    throw_dimension_incompatible("constrains(v)", "v", var);
-
-  if (marked_empty() || !seq[var_space_dim-1].is_universe())
-    return true;
-  // Now force an emptiness check.
-  return is_empty();
-}
-
-template <typename ITV>
-void
-Box<ITV>::unconstrain(const Variables_Set& vars) {
-  // The cylindrification with respect to no dimensions is a no-op.
-  // This case also captures the only legal cylindrification
-  // of a box in a 0-dim space.
-  if (vars.empty())
-    return;
-
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dimension() < min_space_dim)
-    throw_dimension_incompatible("unconstrain(vs)", min_space_dim);
-
-  // If the box is already empty, there is nothing left to do.
-  if (marked_empty())
-    return;
-
-  // Here the box might still be empty (but we haven't detected it yet):
-  // check emptiness of the interval for each of the variables in
-  // `vars' before cylindrification.
-  for (Variables_Set::const_iterator vsi = vars.begin(),
-         vsi_end = vars.end(); vsi != vsi_end; ++vsi) {
-    ITV& seq_vsi = seq[*vsi];
-    if (!seq_vsi.is_empty())
-      seq_vsi.assign(UNIVERSE);
-    else {
-      set_empty();
-      break;
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::topological_closure_assign() {
-  if (ITV::is_always_topologically_closed() || is_empty())
-    return;
-
-  for (dimension_type k = seq.size(); k-- > 0; )
-    seq[k].topological_closure_assign();
-}
-
-template <typename ITV>
-void
-Box<ITV>::wrap_assign(const Variables_Set& vars,
-                      Bounded_Integer_Type_Width w,
-                      Bounded_Integer_Type_Representation r,
-                      Bounded_Integer_Type_Overflow o,
-                      const Constraint_System* cs_p,
-                      unsigned complexity_threshold,
-                      bool wrap_individually) {
-#if 0 // Generic implementation commented out.
-  Implementation::wrap_assign(*this,
-                              vars, w, r, o, cs_p,
-                              complexity_threshold, wrap_individually,
-                              "Box");
-#else // Specialized implementation.
-  PPL_USED(wrap_individually);
-  PPL_USED(complexity_threshold);
-  Box& x = *this;
-
-  // Dimension-compatibility check for `*cs_p', if any.
-  const dimension_type vars_space_dim = vars.space_dimension();
-  if (cs_p != 0 && cs_p->space_dimension() > vars_space_dim) {
-    std::ostringstream s;
-    s << "PPL::Box<ITV>::wrap_assign(vars, w, r, o, cs_p, ...):"
-      << std::endl
-      << "vars.space_dimension() == " << vars_space_dim
-      << ", cs_p->space_dimension() == " << cs_p->space_dimension() << ".";
-    throw std::invalid_argument(s.str());
-  }
-
-  // Wrapping no variable only requires refining with *cs_p, if any.
-  if (vars.empty()) {
-    if (cs_p != 0)
-      refine_with_constraints(*cs_p);
-    return;
-  }
-
-  // Dimension-compatibility check for `vars'.
-  const dimension_type space_dim = x.space_dimension();
-  if (space_dim < vars_space_dim) {
-    std::ostringstream s;
-    s << "PPL::Box<ITV>::wrap_assign(vars, ...):"
-      << std::endl
-      << "this->space_dimension() == " << space_dim
-      << ", required space dimension == " << vars_space_dim << ".";
-    throw std::invalid_argument(s.str());
-  }
-
-  // Wrapping an empty polyhedron is a no-op.
-  if (x.is_empty())
-    return;
-
-  // FIXME: temporarily (ab-) using Coefficient.
-  // Set `min_value' and `max_value' to the minimum and maximum values
-  // a variable of width `w' and signedness `s' can take.
-  PPL_DIRTY_TEMP_COEFFICIENT(min_value);
-  PPL_DIRTY_TEMP_COEFFICIENT(max_value);
-  if (r == UNSIGNED) {
-    min_value = 0;
-    mul_2exp_assign(max_value, Coefficient_one(), w);
-    --max_value;
-  }
-  else {
-    PPL_ASSERT(r == SIGNED_2_COMPLEMENT);
-    mul_2exp_assign(max_value, Coefficient_one(), w-1);
-    neg_assign(min_value, max_value);
-    --max_value;
-  }
-
-  // FIXME: Build the (integer) quadrant interval.
-  PPL_DIRTY_TEMP(ITV, integer_quadrant_itv);
-  PPL_DIRTY_TEMP(ITV, rational_quadrant_itv);
-  {
-    I_Constraint<Coefficient> lower = i_constraint(GREATER_OR_EQUAL, min_value);
-    I_Constraint<Coefficient> upper = i_constraint(LESS_OR_EQUAL, max_value);
-    integer_quadrant_itv.build(lower, upper);
-    // The rational quadrant is only needed if overflow is undefined.
-    if (o == OVERFLOW_UNDEFINED) {
-      ++max_value;
-      upper = i_constraint(LESS_THAN, max_value);
-      rational_quadrant_itv.build(lower, upper);
-    }
-  }
-
-  const Variables_Set::const_iterator vs_end = vars.end();
-
-  if (cs_p == 0) {
-    // No constraint refinement is needed here.
-    switch (o) {
-    case OVERFLOW_WRAPS:
-      for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i)
-        x.seq[*i].wrap_assign(w, r, integer_quadrant_itv);
-      reset_empty_up_to_date();
-      break;
-    case OVERFLOW_UNDEFINED:
-      for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i) {
-        ITV& x_seq_v = x.seq[*i];
-        if (!rational_quadrant_itv.contains(x_seq_v)) {
-          x_seq_v.assign(integer_quadrant_itv);
-        }
-      }
-      break;
-    case OVERFLOW_IMPOSSIBLE:
-      for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i)
-        x.seq[*i].intersect_assign(integer_quadrant_itv);
-      reset_empty_up_to_date();
-      break;
-    }
-    PPL_ASSERT(x.OK());
-    return;
-  }
-
-  PPL_ASSERT(cs_p != 0);
-  const Constraint_System& cs = *cs_p;
-  // A map associating interval constraints to variable indexes.
-  typedef std::map<dimension_type, std::vector<const Constraint*> > map_type;
-  map_type var_cs_map;
-  for (Constraint_System::const_iterator i = cs.begin(),
-         i_end = cs.end(); i != i_end; ++i) {
-    const Constraint& c = *i;
-    dimension_type c_num_vars = 0;
-    dimension_type c_only_var = 0;
-    if (Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var)) {
-      if (c_num_vars == 1) {
-        // An interval constraint on variable index `c_only_var'.
-        PPL_ASSERT(c_only_var < space_dim);
-        // We do care about c if c_only_var is going to be wrapped.
-        if (vars.find(c_only_var) != vs_end)
-          var_cs_map[c_only_var].push_back(&c);
-      }
-      else {
-        PPL_ASSERT(c_num_vars == 0);
-        // Note: tautologies have been filtered out by iterators.
-        PPL_ASSERT(c.is_inconsistent());
-        x.set_empty();
-        return;
-      }
-    }
-  }
-
-  PPL_DIRTY_TEMP(ITV, refinement_itv);
-  const map_type::const_iterator var_cs_map_end = var_cs_map.end();
-  // Loop through the variable indexes in `vars'.
-  for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i) {
-    const dimension_type v = *i;
-    refinement_itv = integer_quadrant_itv;
-    // Look for the refinement constraints for space dimension index `v'.
-    map_type::const_iterator var_cs_map_iter = var_cs_map.find(v);
-    if (var_cs_map_iter != var_cs_map_end) {
-      // Refine interval for variable `v'.
-      const map_type::mapped_type& var_cs = var_cs_map_iter->second;
-      for (dimension_type j = var_cs.size(); j-- > 0; ) {
-        const Constraint& c = *var_cs[j];
-        refine_interval_no_check(refinement_itv,
-                                 c.type(),
-                                 c.inhomogeneous_term(),
-                                 c.coefficient(Variable(v)));
-      }
-    }
-    // Wrap space dimension index `v'.
-    ITV& x_seq_v = x.seq[v];
-    switch (o) {
-    case OVERFLOW_WRAPS:
-      x_seq_v.wrap_assign(w, r, refinement_itv);
-      break;
-    case OVERFLOW_UNDEFINED:
-      if (!rational_quadrant_itv.contains(x_seq_v))
-        x_seq_v.assign(UNIVERSE);
-      break;
-    case OVERFLOW_IMPOSSIBLE:
-      x_seq_v.intersect_assign(refinement_itv);
-      break;
-    }
-  }
-  PPL_ASSERT(x.OK());
-#endif
-}
-
-template <typename ITV>
-void
-Box<ITV>::drop_some_non_integer_points(Complexity_Class) {
-  if (std::numeric_limits<typename ITV::boundary_type>::is_integer
-      && !ITV::info_type::store_open)
-    return;
-
-  if (marked_empty())
-    return;
-
-  for (dimension_type k = seq.size(); k-- > 0; )
-    seq[k].drop_some_non_integer_points();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::drop_some_non_integer_points(const Variables_Set& vars,
-                                       Complexity_Class) {
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dimension() < min_space_dim)
-    throw_dimension_incompatible("drop_some_non_integer_points(vs, cmpl)",
-                                 min_space_dim);
-
-  if (std::numeric_limits<typename ITV::boundary_type>::is_integer
-      && !ITV::info_type::store_open)
-    return;
-
-  if (marked_empty())
-    return;
-
-  for (Variables_Set::const_iterator v_i = vars.begin(),
-         v_end = vars.end(); v_i != v_end; ++v_i)
-    seq[*v_i].drop_some_non_integer_points();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::intersection_assign(const Box& y) {
-  Box& x = *this;
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    x.throw_dimension_incompatible("intersection_assign(y)", y);
-
-  // If one of the two boxes is empty, the intersection is empty.
-  if (x.marked_empty())
-    return;
-  if (y.marked_empty()) {
-    x.set_empty();
-    return;
-  }
-
-  // If both boxes are zero-dimensional, then at this point they are
-  // necessarily non-empty, so that their intersection is non-empty too.
-  if (space_dim == 0)
-    return;
-
-  // FIXME: here we may conditionally exploit a capability of the
-  // underlying interval to eagerly detect empty results.
-  reset_empty_up_to_date();
-
-  for (dimension_type k = space_dim; k-- > 0; )
-    x.seq[k].intersect_assign(y.seq[k]);
-
-  PPL_ASSERT(x.OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::upper_bound_assign(const Box& y) {
-  Box& x = *this;
-
-  // Dimension-compatibility check.
-  if (x.space_dimension() != y.space_dimension())
-    x.throw_dimension_incompatible("upper_bound_assign(y)", y);
-
-  // The lub of a box with an empty box is equal to the first box.
-  if (y.is_empty())
-    return;
-  if (x.is_empty()) {
-    x = y;
-    return;
-  }
-
-  for (dimension_type k = x.seq.size(); k-- > 0; )
-    x.seq[k].join_assign(y.seq[k]);
-
-  PPL_ASSERT(x.OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::concatenate_assign(const Box& y) {
-  Box& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-  const dimension_type y_space_dim = y.space_dimension();
-
-  // If `y' is marked empty, the result will be empty too.
-  if (y.marked_empty())
-    x.set_empty();
-
-  // If `y' is a 0-dim space box, there is nothing left to do.
-  if (y_space_dim == 0)
-    return;
-  // The resulting space dimension must be at most the maximum.
-  check_space_dimension_overflow(y.space_dimension(),
-                                 max_space_dimension() - space_dimension(),
-                                 "PPL::Box::",
-                                 "concatenate_assign(y)",
-                                 "concatenation exceeds the maximum "
-                                 "allowed space dimension");
-  // Here `y_space_dim > 0', so that a non-trivial concatenation will occur:
-  // make sure that reallocation will occur once at most.
-  x.seq.reserve(x_space_dim + y_space_dim);
-
-  // If `x' is marked empty, then it is sufficient to adjust
-  // the dimension of the vector space.
-  if (x.marked_empty()) {
-    x.seq.insert(x.seq.end(), y_space_dim, ITV(EMPTY));
-    PPL_ASSERT(x.OK());
-    return;
-  }
-
-  // Here neither `x' nor `y' are marked empty: concatenate them.
-  std::copy(y.seq.begin(), y.seq.end(),
-	    std::back_insert_iterator<Sequence>(x.seq));
-  // Update the `empty_up_to_date' flag.
-  if (!y.status.test_empty_up_to_date())
-    reset_empty_up_to_date();
-
-  PPL_ASSERT(x.OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::difference_assign(const Box& y) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("difference_assign(y)", y);
-
-  Box& x = *this;
-  if (x.is_empty() || y.is_empty())
-    return;
-
-  switch (space_dim) {
-  case 0:
-    // If `x' is zero-dimensional, then at this point both `x' and `y'
-    // are the universe box, so that their difference is empty.
-    x.set_empty();
-    break;
-
-  case 1:
-    x.seq[0].difference_assign(y.seq[0]);
-    if (x.seq[0].is_empty())
-      x.set_empty();
-    break;
-
-  default:
-    {
-      dimension_type index_non_contained = space_dim;
-      dimension_type number_non_contained = 0;
-      for (dimension_type i = space_dim; i-- > 0; )
-        if (!y.seq[i].contains(x.seq[i])) {
-          if (++number_non_contained == 1)
-            index_non_contained = i;
-          else
-            break;
-        }
-
-      switch (number_non_contained) {
-      case 0:
-        // `y' covers `x': the difference is empty.
-        x.set_empty();
-        break;
-      case 1:
-        x.seq[index_non_contained]
-          .difference_assign(y.seq[index_non_contained]);
-        if (x.seq[index_non_contained].is_empty())
-          x.set_empty();
-        break;
-      default:
-        // Nothing to do: the difference is `x'.
-        break;
-      }
-    }
-    break;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-bool
-Box<ITV>::simplify_using_context_assign(const Box& y) {
-  Box& x = *this;
-  const dimension_type num_dims = x.space_dimension();
-  // Dimension-compatibility check.
-  if (num_dims != y.space_dimension())
-    x.throw_dimension_incompatible("simplify_using_context_assign(y)", y);
-
-  // Filter away the zero-dimensional case.
-  if (num_dims == 0) {
-    if (y.marked_empty()) {
-      x.set_nonempty();
-      return false;
-    }
-    else
-      return !x.marked_empty();
-  }
-
-  // Filter away the case when `y' is empty.
-  if (y.is_empty()) {
-    for (dimension_type i = num_dims; i-- > 0; )
-      x.seq[i].assign(UNIVERSE);
-    x.set_nonempty();
-    return false;
-  }
-
-  if (x.is_empty()) {
-    // Find in `y' a non-universe interval, if any.
-    for (dimension_type i = 0; i < num_dims; ++i) {
-      if (y.seq[i].is_universe())
-        x.seq[i].assign(UNIVERSE);
-      else {
-        // Set x.seq[i] so as to contradict y.seq[i], if possible.
-        ITV& seq_i = x.seq[i];
-        seq_i.empty_intersection_assign(y.seq[i]);
-        if (seq_i.is_empty()) {
-          // We were not able to assign to `seq_i' a non-empty interval:
-          // reset `seq_i' to the universe interval and keep searching.
-          seq_i.assign(UNIVERSE);
-          continue;
-        }
-        // We assigned to `seq_i' a non-empty interval:
-        // set the other intervals to universe and return.
-        for (++i; i < num_dims; ++i)
-          x.seq[i].assign(UNIVERSE);
-        x.set_nonempty();
-        PPL_ASSERT(x.OK());
-        return false;
-      }
-    }
-    // All intervals in `y' are universe or could not be contradicted:
-    // simplification can leave the empty box `x' as is.
-    PPL_ASSERT(x.OK() && x.is_empty());
-    return false;
-  }
-
-  // Loop index `i' is intentionally going upwards.
-  for (dimension_type i = 0; i < num_dims; ++i) {
-    if (!x.seq[i].simplify_using_context_assign(y.seq[i])) {
-      PPL_ASSERT(!x.seq[i].is_empty());
-      // The intersection of `x' and `y' is empty due to the i-th interval:
-      // reset other intervals to UNIVERSE.
-      for (dimension_type j = num_dims; j-- > i; )
-        x.seq[j].assign(UNIVERSE);
-      for (dimension_type j = i; j-- > 0; )
-        x.seq[j].assign(UNIVERSE);
-      PPL_ASSERT(x.OK());
-      return false;
-    }
-  }
-  PPL_ASSERT(x.OK());
-  return true;
-}
-
-template <typename ITV>
-void
-Box<ITV>::time_elapse_assign(const Box& y) {
-  Box& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    x.throw_dimension_incompatible("time_elapse_assign(y)", y);
-
-  // Dealing with the zero-dimensional case.
-  if (x_space_dim == 0) {
-    if (y.marked_empty())
-      x.set_empty();
-    return;
-  }
-
-  // If either one of `x' or `y' is empty, the result is empty too.
-  // Note: if possible, avoid cost of checking for emptiness.
-  if (x.marked_empty() || y.marked_empty()
-      || x.is_empty() || y.is_empty()) {
-    x.set_empty();
-    return;
-  }
-
-  for (dimension_type i = x_space_dim; i-- > 0; ) {
-    ITV& x_seq_i = x.seq[i];
-    const ITV& y_seq_i = y.seq[i];
-    if (!x_seq_i.lower_is_boundary_infinity())
-      if (y_seq_i.lower_is_boundary_infinity() || y_seq_i.lower() < 0)
-	x_seq_i.lower_extend();
-    if (!x_seq_i.upper_is_boundary_infinity())
-      if (y_seq_i.upper_is_boundary_infinity() || y_seq_i.upper() > 0)
-	x_seq_i.upper_extend();
-  }
-  PPL_ASSERT(x.OK());
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::remove_space_dimensions(const Variables_Set& vars) {
-  // The removal of no dimensions from any box is a no-op.
-  // Note that this case also captures the only legal removal of
-  // space dimensions from a box in a zero-dimensional space.
-  if (vars.empty()) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  const dimension_type old_space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  const dimension_type vsi_space_dim = vars.space_dimension();
-  if (old_space_dim < vsi_space_dim)
-    throw_dimension_incompatible("remove_space_dimensions(vs)",
-				 vsi_space_dim);
-
-  const dimension_type new_space_dim = old_space_dim - vars.size();
-
-  // If the box is empty (this must be detected), then resizing is all
-  // what is needed.  If it is not empty and we are removing _all_ the
-  // dimensions then, again, resizing suffices.
-  if (is_empty() || new_space_dim == 0) {
-    seq.resize(new_space_dim);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // For each variable to be removed, we fill the corresponding interval
-  // by shifting left those intervals that will not be removed.
-  Variables_Set::const_iterator vsi = vars.begin();
-  Variables_Set::const_iterator vsi_end = vars.end();
-  dimension_type dst = *vsi;
-  dimension_type src = dst + 1;
-  for (++vsi; vsi != vsi_end; ++vsi) {
-    const dimension_type vsi_next = *vsi;
-    // All intervals in between are moved to the left.
-    while (src < vsi_next)
-      swap(seq[dst++], seq[src++]);
-    ++src;
-  }
-  // Moving the remaining intervals.
-  while (src < old_space_dim)
-    swap(seq[dst++], seq[src++]);
-
-  PPL_ASSERT(dst == new_space_dim);
-  seq.resize(new_space_dim);
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::remove_higher_space_dimensions(const dimension_type new_dimension) {
-  // Dimension-compatibility check: the variable having
-  // maximum index is the one occurring last in the set.
-  const dimension_type space_dim = space_dimension();
-  if (new_dimension > space_dim)
-    throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
-				 new_dimension);
-
-  // The removal of no dimensions from any box is a no-op.
-  // Note that this case also captures the only legal removal of
-  // dimensions from a zero-dim space box.
-  if (new_dimension == space_dim) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  seq.resize(new_dimension);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-template <typename Partial_Function>
-void
-Box<ITV>::map_space_dimensions(const Partial_Function& pfunc) {
-  const dimension_type space_dim = space_dimension();
-  if (space_dim == 0)
-    return;
-
-  if (pfunc.has_empty_codomain()) {
-    // All dimensions vanish: the box becomes zero_dimensional.
-    remove_higher_space_dimensions(0);
-    return;
-  }
-
-  const dimension_type new_space_dim = pfunc.max_in_codomain() + 1;
-  // If the box is empty, then simply adjust the space dimension.
-  if (is_empty()) {
-    remove_higher_space_dimensions(new_space_dim);
-    return;
-  }
-
-  // We create a new Box with the new space dimension.
-  Box<ITV> tmp(new_space_dim);
-  // Map the intervals, exchanging the indexes.
-  for (dimension_type i = 0; i < space_dim; ++i) {
-    dimension_type new_i;
-    if (pfunc.maps(i, new_i))
-      swap(seq[i], tmp.seq[new_i]);
-  }
-  m_swap(tmp);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::fold_space_dimensions(const Variables_Set& vars,
-                                const Variable dest) {
-  const dimension_type space_dim = space_dimension();
-  // `dest' should be one of the dimensions of the box.
-  if (dest.space_dimension() > space_dim)
-    throw_dimension_incompatible("fold_space_dimensions(vs, v)", "v", dest);
-
-  // The folding of no dimensions is a no-op.
-  if (vars.empty())
-    return;
-
-  // All variables in `vars' should be dimensions of the box.
-  if (vars.space_dimension() > space_dim)
-    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-				 vars.space_dimension());
-
-  // Moreover, `dest.id()' should not occur in `vars'.
-  if (vars.find(dest.id()) != vars.end())
-    throw_invalid_argument("fold_space_dimensions(vs, v)",
-                           "v should not occur in vs");
-
-  // Note: the check for emptiness is needed for correctness.
-  if (!is_empty()) {
-    // Join the interval corresponding to variable `dest' with the intervals
-    // corresponding to the variables in `vars'.
-    ITV& seq_v = seq[dest.id()];
-    for (Variables_Set::const_iterator i = vars.begin(),
-	   vs_end = vars.end(); i != vs_end; ++i)
-      seq_v.join_assign(seq[*i]);
-  }
-  remove_space_dimensions(vars);
-}
-
-template <typename ITV>
-void
-Box<ITV>::add_constraint_no_check(const Constraint& c) {
-  PPL_ASSERT(c.space_dimension() <= space_dimension());
-
-  dimension_type c_num_vars = 0;
-  dimension_type c_only_var = 0;
-  // Throw an exception if c is not an interval constraints.
-  if (!Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var))
-    throw_invalid_argument("add_constraint(c)",
-                           "c is not an interval constraint");
-
-  // Throw an exception if c is a nontrivial strict constraint
-  // and ITV does not support open boundaries.
-  if (c.is_strict_inequality() && c_num_vars != 0
-      && ITV::is_always_topologically_closed())
-    throw_invalid_argument("add_constraint(c)",
-                           "c is a nontrivial strict constraint");
-
-  // Avoid doing useless work if the box is known to be empty.
-  if (marked_empty())
-    return;
-
-  const Coefficient& n = c.inhomogeneous_term();
-  if (c_num_vars == 0) {
-    // Dealing with a trivial constraint.
-    if (n < 0
-        || (c.is_equality() && n != 0)
-	|| (c.is_strict_inequality() && n == 0))
-      set_empty();
-    return;
-  }
-
-  PPL_ASSERT(c_num_vars == 1);
-  const Coefficient& d = c.coefficient(Variable(c_only_var));
-  add_interval_constraint_no_check(c_only_var, c.type(), n, d);
-}
-
-template <typename ITV>
-void
-Box<ITV>::add_constraints_no_check(const Constraint_System& cs) {
-  PPL_ASSERT(cs.space_dimension() <= space_dimension());
-  // Note: even when the box is known to be empty, we need to go
-  // through all the constraints to fulfill the method's contract
-  // for what concerns exception throwing.
-  for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
-    add_constraint_no_check(*i);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::add_congruence_no_check(const Congruence& cg) {
-  PPL_ASSERT(cg.space_dimension() <= space_dimension());
-
-  // Set aside the case of proper congruences.
-  if (cg.is_proper_congruence()) {
-    if (cg.is_inconsistent()) {
-      set_empty();
-      return;
-    }
-    else if (cg.is_tautological())
-      return;
-    else
-      throw_invalid_argument("add_congruence(cg)",
-                             "cg is a nontrivial proper congruence");
-  }
-
-  PPL_ASSERT(cg.is_equality());
-  dimension_type cg_num_vars = 0;
-  dimension_type cg_only_var = 0;
-  // Throw an exception if c is not an interval congruence.
-  if (!Box_Helpers::extract_interval_congruence(cg, cg_num_vars, cg_only_var))
-    throw_invalid_argument("add_congruence(cg)",
-                           "cg is not an interval congruence");
-
-  // Avoid doing useless work if the box is known to be empty.
-  if (marked_empty())
-    return;
-
-  const Coefficient& n = cg.inhomogeneous_term();
-  if (cg_num_vars == 0) {
-    // Dealing with a trivial equality congruence.
-    if (n != 0)
-      set_empty();
-    return;
-  }
-
-  PPL_ASSERT(cg_num_vars == 1);
-  const Coefficient& d = cg.coefficient(Variable(cg_only_var));
-  add_interval_constraint_no_check(cg_only_var, Constraint::EQUALITY, n, d);
-}
-
-template <typename ITV>
-void
-Box<ITV>::add_congruences_no_check(const Congruence_System& cgs) {
-  PPL_ASSERT(cgs.space_dimension() <= space_dimension());
-  // Note: even when the box is known to be empty, we need to go
-  // through all the congruences to fulfill the method's contract
-  // for what concerns exception throwing.
-  for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i)
-    add_congruence_no_check(*i);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::refine_no_check(const Constraint& c) {
-  PPL_ASSERT(c.space_dimension() <= space_dimension());
-  PPL_ASSERT(!marked_empty());
-
-  dimension_type c_num_vars = 0;
-  dimension_type c_only_var = 0;
-  // Non-interval constraints are approximated.
-  if (!Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var)) {
-    propagate_constraint_no_check(c);
-    return;
-  }
-
-  const Coefficient& n = c.inhomogeneous_term();
-  if (c_num_vars == 0) {
-    // Dealing with a trivial constraint.
-    if (n < 0
-        || (c.is_equality() && n != 0)
-        || (c.is_strict_inequality() && n == 0))
-      set_empty();
-    return;
-  }
-
-  PPL_ASSERT(c_num_vars == 1);
-  const Coefficient& d = c.coefficient(Variable(c_only_var));
-  add_interval_constraint_no_check(c_only_var, c.type(), n, d);
-}
-
-template <typename ITV>
-void
-Box<ITV>::refine_no_check(const Constraint_System& cs) {
-  PPL_ASSERT(cs.space_dimension() <= space_dimension());
-  for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
-    refine_no_check(*i);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::refine_no_check(const Congruence& cg) {
-  PPL_ASSERT(!marked_empty());
-
-  PPL_ASSERT(cg.space_dimension() <= space_dimension());
-
-  if (cg.is_proper_congruence()) {
-    // A proper congruences is also an interval constraint
-    // if and only if it is trivial.
-    if (cg.is_inconsistent())
-      set_empty();
-    return;
-  }
-
-  PPL_ASSERT(cg.is_equality());
-  Constraint c(cg);
-  refine_no_check(c);
-}
-
-template <typename ITV>
-void
-Box<ITV>::refine_no_check(const Congruence_System& cgs) {
-  PPL_ASSERT(cgs.space_dimension() <= space_dimension());
-  for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
-    refine_no_check(*i);
-  PPL_ASSERT(OK());
-}
-
-#if 1 // Alternative implementations for propagate_constraint_no_check.
-namespace Implementation {
-
-namespace Boxes {
-
-inline bool
-propagate_constraint_check_result(Result r, Ternary& open) {
-  r = result_relation_class(r);
-  switch (r) {
-  case V_GT_MINUS_INFINITY:
-  case V_LT_PLUS_INFINITY:
-    return true;
-  case V_LT:
-  case V_GT:
-    open = T_YES;
-    return false;
-  case V_LE:
-  case V_GE:
-    if (open == T_NO)
-      open = T_MAYBE;
-    return false;
-  case V_EQ:
-    return false;
-  default:
-    PPL_UNREACHABLE;
-    return true;
-  }
-}
-
-} // namespace Boxes
-
-} // namespace Implementation
-
-
-template <typename ITV>
-void
-Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
-  using namespace Implementation::Boxes;
-
-  PPL_ASSERT(c.space_dimension() <= space_dimension());
-
-  typedef
-    typename Select_Temp_Boundary_Type<typename ITV::boundary_type>::type
-    Temp_Boundary_Type;
-
-  const dimension_type c_space_dim = c.space_dimension();
-  const Constraint::Type c_type = c.type();
-  const Coefficient& c_inhomogeneous_term = c.inhomogeneous_term();
-
-  // Find a space dimension having a non-zero coefficient (if any).
-  dimension_type last_k = c.expression().last_nonzero(1, c_space_dim + 1);
-  if (last_k == c_space_dim + 1) {
-    // Constraint c is trivial: check if it is inconsistent.
-    if (c_inhomogeneous_term < 0
-        || (c_inhomogeneous_term == 0
-            && c_type != Constraint::NONSTRICT_INEQUALITY))
-      set_empty();
-    return;
-  }
-
-  // Here constraint c is non-trivial.
-  PPL_ASSERT(last_k <= c_space_dim);
-  Temp_Boundary_Type t_bound;
-  Temp_Boundary_Type t_a;
-  Temp_Boundary_Type t_x;
-  Ternary open;
-  const Constraint::Expression& c_e = c.expression();
-  for (Constraint::Expression::const_iterator k = c_e.begin(),
-         k_end = c_e.lower_bound(Variable(last_k)); k != k_end; ++k) {
-    const Coefficient& a_k = *k;
-    const Variable k_var = k.variable();
-    int sgn_a_k = sgn(a_k);
-    if (sgn_a_k == 0)
-      continue;
-    Result r;
-    if (sgn_a_k > 0) {
-      open = (c_type == Constraint::STRICT_INEQUALITY) ? T_YES : T_NO;
-      if (open == T_NO)
-	maybe_reset_fpu_inexact<Temp_Boundary_Type>();
-      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
-      r = neg_assign_r(t_bound, t_bound, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
-            i_end = c_e.lower_bound(Variable(last_k)); i != i_end; ++i) {
-        const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.lower_is_boundary_infinity())
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.upper_is_boundary_infinity())
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	}
-      }
-      r = assign_r(t_a, a_k, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
-      r = div_assign_r(t_bound, t_bound, t_a, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
-
-      // Refine the lower bound of `seq[k]' with `t_bound'.
-      if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
-      {
-        Relation_Symbol rel = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
-        seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
-      }
-      reset_empty_up_to_date();
-    maybe_refine_upper_1:
-      if (c_type != Constraint::EQUALITY)
-	continue;
-      open = T_NO;
-      maybe_reset_fpu_inexact<Temp_Boundary_Type>();
-      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      r = neg_assign_r(t_bound, t_bound, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
-            i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
-        const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.upper_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.lower_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
-      }
-      r = assign_r(t_a, a_k, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      r = div_assign_r(t_bound, t_bound, t_a, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-
-      // Refine the upper bound of seq[k] with t_bound.
-      if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
-      Relation_Symbol rel = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
-      seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
-      reset_empty_up_to_date();
-    }
-    else {
-      PPL_ASSERT(sgn_a_k < 0);
-      open = (c_type == Constraint::STRICT_INEQUALITY) ? T_YES : T_NO;
-      if (open == T_NO)
-	maybe_reset_fpu_inexact<Temp_Boundary_Type>();
-      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
-      r = neg_assign_r(t_bound, t_bound, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
-            i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
-        const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.lower_is_boundary_infinity())
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.upper_is_boundary_infinity())
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	}
-      }
-      r = assign_r(t_a, a_k, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
-      r = div_assign_r(t_bound, t_bound, t_a, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
-
-      // Refine the upper bound of seq[k] with t_bound.
-      if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
-      {
-        Relation_Symbol rel = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
-        seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
-      }
-      reset_empty_up_to_date();
-    maybe_refine_upper_2:
-      if (c_type != Constraint::EQUALITY)
-	continue;
-      open = T_NO;
-      maybe_reset_fpu_inexact<Temp_Boundary_Type>();
-      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      r = neg_assign_r(t_bound, t_bound, ROUND_UP);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
-            i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
-        const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.upper_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.lower_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
-      }
-      r = assign_r(t_a, a_k, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      r = div_assign_r(t_bound, t_bound, t_a, ROUND_DOWN);
-      if (propagate_constraint_check_result(r, open))
-	goto next_k;
-
-      // Refine the lower bound of seq[k] with t_bound.
-      if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
-      Relation_Symbol rel = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
-      seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
-      reset_empty_up_to_date();
-    }
-  next_k:
-    ;
-  }
-}
-
-#else // Alternative implementations for propagate_constraint_no_check.
-
-template <typename ITV>
-void
-Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
-  PPL_ASSERT(c.space_dimension() <= space_dimension());
-
-  dimension_type c_space_dim = c.space_dimension();
-  ITV k[c_space_dim];
-  ITV p[c_space_dim];
-  for (Constraint::Expression::const_iterator i = c_e.begin(),
-        i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
-    const Variable i_var = i.variable();
-    k[i_var.id()] = *i;
-    ITV& p_i = p[i_var.id()];
-    p_i = seq[i_var.id()];
-    p_i.mul_assign(p_i, k[i_var.id()]);
-  }
-  const Coefficient& inhomogeneous_term = c.inhomogeneous_term();
-  for (Constraint::Expression::const_iterator i = c_e.begin(),
-        i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
-    const Variable i_var = i.variable();
-    int sgn_coefficient_i = sgn(*i);
-    ITV q(inhomogeneous_term);
-    for (Constraint::Expression::const_iterator j = c_e.begin(),
-          j_end = c_e.lower_bound(Variable(c_space_dim)); j != j_end; ++j) {
-      const Variable j_var = j.variable();
-      if (i_var == j_var)
-	continue;
-      q.add_assign(q, p[j_var.id()]);
-    }
-    q.div_assign(q, k[i_var.id()]);
-    q.neg_assign(q);
-    Relation_Symbol rel;
-    switch (c.type()) {
-    case Constraint::EQUALITY:
-      rel = EQUAL;
-      break;
-    case Constraint::NONSTRICT_INEQUALITY:
-      rel = (sgn_coefficient_i > 0) ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
-      break;
-    case Constraint::STRICT_INEQUALITY:
-      rel = (sgn_coefficient_i > 0) ? GREATER_THAN : LESS_THAN;
-      break;
-    }
-    seq[i_var.id()].add_constraint(i_constraint(rel, q));
-    // FIXME: could/should we exploit the return value of add_constraint
-    //        in case it is available?
-    // FIXME: should we instead be lazy and do not even bother about
-    //        the possibility the interval becomes empty apart from setting
-    //        empty_up_to_date = false?
-    if (seq[i_var.id()].is_empty()) {
-      set_empty();
-      break;
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-#endif // Alternative implementations for propagate_constraint_no_check.
-
-template <typename ITV>
-void
-Box<ITV>
-::propagate_constraints_no_check(const Constraint_System& cs,
-                                 const dimension_type max_iterations) {
-  const dimension_type space_dim = space_dimension();
-  PPL_ASSERT(cs.space_dimension() <= space_dim);
-
-  const Constraint_System::const_iterator cs_begin = cs.begin();
-  const Constraint_System::const_iterator cs_end = cs.end();
-  const dimension_type propagation_weight
-    = Implementation::num_constraints(cs) * space_dim;
-
-  Sequence copy;
-  bool changed;
-  dimension_type num_iterations = 0;
-  do {
-    WEIGHT_BEGIN();
-    ++num_iterations;
-    copy = seq;
-    for (Constraint_System::const_iterator i = cs_begin; i != cs_end; ++i)
-      propagate_constraint_no_check(*i);
-
-    WEIGHT_ADD_MUL(40, propagation_weight);
-    // Check if the client has requested abandoning all expensive
-    // computations.  If so, the exception specified by the client
-    // is thrown now.
-    maybe_abandon();
-
-    // NOTE: if max_iterations == 0 (i.e., no iteration limit is set)
-    // the following test will anyway trigger on wrap around.
-    if (num_iterations == max_iterations)
-      break;
-
-    changed = (copy != seq);
-  } while (changed);
-}
-
-template <typename ITV>
-void
-Box<ITV>::affine_image(const Variable var,
-                       const Linear_Expression& expr,
-                       Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("affine_image(v, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("affine_image(v, e, d)", "e", expr);
-  // `var' should be one of the dimensions of the polyhedron.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dim < var_space_dim)
-    throw_dimension_incompatible("affine_image(v, e, d)", "v", var);
-
-  if (is_empty())
-    return;
-
-  Tmp_Interval_Type expr_value, temp0, temp1;
-  expr_value.assign(expr.inhomogeneous_term());
-  for (Linear_Expression::const_iterator i = expr.begin(),
-          i_end = expr.end(); i != i_end; ++i) {
-    temp0.assign(*i);
-    temp1.assign(seq[i.variable().id()]);
-    temp0.mul_assign(temp0, temp1);
-    expr_value.add_assign(expr_value, temp0);
-  }
-  if (denominator != 1) {
-    temp0.assign(denominator);
-    expr_value.div_assign(expr_value, temp0);
-  }
-  seq[var.id()].assign(expr_value);
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::affine_form_image(const Variable var,
-                            const Linear_Form<ITV>& lf) {
-
-  // Check that ITV has a floating point boundary type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<typename ITV::boundary_type>
-            ::is_exact, "Box<ITV>::affine_form_image(Variable, Linear_Form):"
-                        "ITV has not a floating point boundary type.");
-
-  // Dimension-compatibility checks.
-  const dimension_type space_dim = space_dimension();
-  const dimension_type lf_space_dim = lf.space_dimension();
-  if (space_dim < lf_space_dim)
-    throw_dimension_incompatible("affine_form_image(var, lf)", "lf", lf);
-  // `var' should be one of the dimensions of the polyhedron.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dim < var_space_dim)
-    throw_dimension_incompatible("affine_form_image(var, lf)", "var", var);
-
-  if (is_empty())
-    return;
-
-  // Intervalization of 'lf'.
-  ITV result = lf.inhomogeneous_term();
-  for (dimension_type i = 0; i < lf_space_dim; ++i) {
-    ITV current_addend = lf.coefficient(Variable(i));
-    const ITV& curr_int = seq[i];
-    current_addend *= curr_int;
-    result += current_addend;
-  }
-
-  seq[var.id()].assign(result);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::affine_preimage(const Variable var,
-                          const Linear_Expression& expr,
-                          Coefficient_traits::const_reference
-                          denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  const dimension_type x_space_dim = space_dimension();
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (x_space_dim < expr_space_dim)
-    throw_dimension_incompatible("affine_preimage(v, e, d)", "e", expr);
-  // `var' should be one of the dimensions of the polyhedron.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (x_space_dim < var_space_dim)
-    throw_dimension_incompatible("affine_preimage(v, e, d)", "v", var);
-
-  if (is_empty())
-    return;
-
-  const Coefficient& expr_v = expr.coefficient(var);
-  const bool invertible = (expr_v != 0);
-  if (!invertible) {
-    Tmp_Interval_Type expr_value, temp0, temp1;
-    expr_value.assign(expr.inhomogeneous_term());
-    for (Linear_Expression::const_iterator i = expr.begin(),
-            i_end = expr.end(); i != i_end; ++i) {
-      temp0.assign(*i);
-      temp1.assign(seq[i.variable().id()]);
-      temp0.mul_assign(temp0, temp1);
-      expr_value.add_assign(expr_value, temp0);
-    }
-    if (denominator != 1) {
-      temp0.assign(denominator);
-      expr_value.div_assign(expr_value, temp0);
-    }
-    ITV& x_seq_v = seq[var.id()];
-    expr_value.intersect_assign(x_seq_v);
-    if (expr_value.is_empty())
-      set_empty();
-    else
-      x_seq_v.assign(UNIVERSE);
-  }
-  else {
-    // The affine transformation is invertible.
-    // CHECKME: for efficiency, would it be meaningful to avoid
-    // the computation of inverse by partially evaluating the call
-    // to affine_image?
-    Linear_Expression inverse;
-    inverse -= expr;
-    inverse += (expr_v + denominator) * var;
-    affine_image(var, inverse, expr_v);
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>
-::bounded_affine_image(const Variable var,
-                       const Linear_Expression& lb_expr,
-                       const Linear_Expression& ub_expr,
-                       Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  const dimension_type space_dim = space_dimension();
-  // The dimension of `lb_expr' and `ub_expr' should not be
-  // greater than the dimension of `*this'.
-  const dimension_type lb_space_dim = lb_expr.space_dimension();
-  if (space_dim < lb_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "lb", lb_expr);
-  const dimension_type ub_space_dim = ub_expr.space_dimension();
-  if (space_dim < ub_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "ub", ub_expr);
-    // `var' should be one of the dimensions of the box.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dim < var_space_dim)
-    throw_dimension_incompatible("affine_image(v, e, d)", "v", var);
-
-  // Any image of an empty box is empty.
-  if (is_empty())
-    return;
-
-  // Add the constraint implied by the `lb_expr' and `ub_expr'.
-  if (denominator > 0)
-    refine_with_constraint(lb_expr <= ub_expr);
-  else
-    refine_with_constraint(lb_expr >= ub_expr);
-
-  // Check whether `var' occurs in `lb_expr' and/or `ub_expr'.
-  if (lb_expr.coefficient(var) == 0) {
-    // Here `var' can only occur in `ub_expr'.
-    generalized_affine_image(var,
-			     LESS_OR_EQUAL,
-			     ub_expr,
-			     denominator);
-    if (denominator > 0)
-      refine_with_constraint(lb_expr <= denominator*var);
-    else
-      refine_with_constraint(denominator*var <= lb_expr);
-  }
-  else if (ub_expr.coefficient(var) == 0) {
-    // Here `var' can only occur in `lb_expr'.
-    generalized_affine_image(var,
-			     GREATER_OR_EQUAL,
-			     lb_expr,
-			     denominator);
-    if (denominator > 0)
-      refine_with_constraint(denominator*var <= ub_expr);
-    else
-      refine_with_constraint(ub_expr <= denominator*var);
-  }
-  else {
-    // Here `var' occurs in both `lb_expr' and `ub_expr'.  As boxes
-    // can only use the non-relational constraints, we find the
-    // maximum/minimum values `ub_expr' and `lb_expr' obtain with the
-    // box and use these instead of the `ub-expr' and `lb-expr'.
-    PPL_DIRTY_TEMP(Coefficient, max_numer);
-    PPL_DIRTY_TEMP(Coefficient, max_denom);
-    bool max_included;
-    PPL_DIRTY_TEMP(Coefficient, min_numer);
-    PPL_DIRTY_TEMP(Coefficient, min_denom);
-    bool min_included;
-    ITV& seq_v = seq[var.id()];
-    if (maximize(ub_expr, max_numer, max_denom, max_included)) {
-      if (minimize(lb_expr, min_numer, min_denom, min_included)) {
-	// The `ub_expr' has a maximum value and the `lb_expr'
-	// has a minimum value for the box.
-	// Set the bounds for `var' using the minimum for `lb_expr'.
-	min_denom *= denominator;
-	PPL_DIRTY_TEMP(mpq_class, q1);
-	PPL_DIRTY_TEMP(mpq_class, q2);
-	assign_r(q1.get_num(), min_numer, ROUND_NOT_NEEDED);
-	assign_r(q1.get_den(), min_denom, ROUND_NOT_NEEDED);
-	q1.canonicalize();
-	// Now make the maximum of lb_expr the upper bound.  If the
-	// maximum is not at a box point, then inequality is strict.
-	max_denom *= denominator;
-	assign_r(q2.get_num(), max_numer, ROUND_NOT_NEEDED);
-	assign_r(q2.get_den(), max_denom, ROUND_NOT_NEEDED);
-	q2.canonicalize();
-
-        if (denominator > 0) {
-          Relation_Symbol gr = min_included ? GREATER_OR_EQUAL : GREATER_THAN;
-          Relation_Symbol lr = max_included ? LESS_OR_EQUAL : LESS_THAN;
-          seq_v.build(i_constraint(gr, q1), i_constraint(lr, q2));
-        }
-	else {
-          Relation_Symbol gr = max_included ? GREATER_OR_EQUAL : GREATER_THAN;
-          Relation_Symbol lr = min_included ? LESS_OR_EQUAL : LESS_THAN;
-          seq_v.build(i_constraint(gr, q2), i_constraint(lr, q1));
-        }
-      }
-      else {
-	// The `ub_expr' has a maximum value but the `lb_expr'
-	// has no minimum value for the box.
-	// Set the bounds for `var' using the maximum for `lb_expr'.
-	PPL_DIRTY_TEMP(mpq_class, q);
-	max_denom *= denominator;
-	assign_r(q.get_num(), max_numer, ROUND_NOT_NEEDED);
-	assign_r(q.get_den(), max_denom, ROUND_NOT_NEEDED);
-	q.canonicalize();
-        Relation_Symbol rel = (denominator > 0)
-          ? (max_included ? LESS_OR_EQUAL : LESS_THAN)
-          : (max_included ? GREATER_OR_EQUAL : GREATER_THAN);
-        seq_v.build(i_constraint(rel, q));
-      }
-    }
-    else if (minimize(lb_expr, min_numer, min_denom, min_included)) {
-	// The `ub_expr' has no maximum value but the `lb_expr'
-	// has a minimum value for the box.
-	// Set the bounds for `var' using the minimum for `lb_expr'.
-	min_denom *= denominator;
-	PPL_DIRTY_TEMP(mpq_class, q);
-	assign_r(q.get_num(), min_numer, ROUND_NOT_NEEDED);
-	assign_r(q.get_den(), min_denom, ROUND_NOT_NEEDED);
-	q.canonicalize();
-
-        Relation_Symbol rel = (denominator > 0)
-          ? (min_included ? GREATER_OR_EQUAL : GREATER_THAN)
-          : (min_included ? LESS_OR_EQUAL : LESS_THAN);
-        seq_v.build(i_constraint(rel, q));
-    }
-    else {
-      // The `ub_expr' has no maximum value and the `lb_expr'
-      // has no minimum value for the box.
-      // So we set the bounds to be unbounded.
-      seq_v.assign(UNIVERSE);
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>
-::bounded_affine_preimage(const Variable var,
-                          const Linear_Expression& lb_expr,
-                          const Linear_Expression& ub_expr,
-                          Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  const dimension_type space_dim = space_dimension();
-  if (denominator == 0)
-    throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // `var' should be one of the dimensions of the polyhedron.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dim < var_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "v", var);
-  // The dimension of `lb_expr' and `ub_expr' should not be
-  // greater than the dimension of `*this'.
-  const dimension_type lb_space_dim = lb_expr.space_dimension();
-  if (space_dim < lb_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "lb", lb_expr);
-  const dimension_type ub_space_dim = ub_expr.space_dimension();
-  if (space_dim < ub_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "ub", ub_expr);
-
-  // Any preimage of an empty polyhedron is empty.
-  if (marked_empty())
-    return;
-
-  const bool negative_denom = (denominator < 0);
-  const Coefficient& lb_var_coeff = lb_expr.coefficient(var);
-  const Coefficient& ub_var_coeff = ub_expr.coefficient(var);
-
-  // If the implied constraint between `ub_expr and `lb_expr' is
-  // independent of `var', then impose it now.
-  if (lb_var_coeff == ub_var_coeff) {
-    if (negative_denom)
-      refine_with_constraint(lb_expr >= ub_expr);
-    else
-      refine_with_constraint(lb_expr <= ub_expr);
-  }
-
-  ITV& seq_var = seq[var.id()];
-  if (!seq_var.is_universe()) {
-    // We want to work with a positive denominator,
-    // so the sign and its (unsigned) value are separated.
-    PPL_DIRTY_TEMP_COEFFICIENT(pos_denominator);
-    pos_denominator = denominator;
-    if (negative_denom)
-      neg_assign(pos_denominator, pos_denominator);
-    // Store all the information about the upper and lower bounds
-    // for `var' before making this interval unbounded.
-    bool open_lower = seq_var.lower_is_open();
-    bool unbounded_lower = seq_var.lower_is_boundary_infinity();
-    PPL_DIRTY_TEMP(mpq_class, q_seq_var_lower);
-    PPL_DIRTY_TEMP(Coefficient, numer_lower);
-    PPL_DIRTY_TEMP(Coefficient, denom_lower);
-    if (!unbounded_lower) {
-      assign_r(q_seq_var_lower, seq_var.lower(), ROUND_NOT_NEEDED);
-      assign_r(numer_lower, q_seq_var_lower.get_num(), ROUND_NOT_NEEDED);
-      assign_r(denom_lower, q_seq_var_lower.get_den(), ROUND_NOT_NEEDED);
-      if (negative_denom)
-        neg_assign(denom_lower, denom_lower);
-      numer_lower *= pos_denominator;
-      seq_var.lower_extend();
-    }
-    bool open_upper = seq_var.upper_is_open();
-    bool unbounded_upper = seq_var.upper_is_boundary_infinity();
-    PPL_DIRTY_TEMP(mpq_class, q_seq_var_upper);
-    PPL_DIRTY_TEMP(Coefficient, numer_upper);
-    PPL_DIRTY_TEMP(Coefficient, denom_upper);
-    if (!unbounded_upper) {
-      assign_r(q_seq_var_upper, seq_var.upper(), ROUND_NOT_NEEDED);
-      assign_r(numer_upper, q_seq_var_upper.get_num(), ROUND_NOT_NEEDED);
-      assign_r(denom_upper, q_seq_var_upper.get_den(), ROUND_NOT_NEEDED);
-      if (negative_denom)
-        neg_assign(denom_upper, denom_upper);
-      numer_upper *= pos_denominator;
-      seq_var.upper_extend();
-    }
-
-    if (!unbounded_lower) {
-      // `lb_expr' is revised by removing the `var' component,
-      // multiplying by `-' denominator of the lower bound for `var',
-      // and adding the lower bound for `var' to the inhomogeneous term.
-      Linear_Expression revised_lb_expr(ub_expr);
-      revised_lb_expr -= ub_var_coeff * var;
-      PPL_DIRTY_TEMP(Coefficient, d);
-      neg_assign(d, denom_lower);
-      revised_lb_expr *= d;
-      revised_lb_expr += numer_lower;
-
-      // Find the minimum value for the revised lower bound expression
-      // and use this to refine the appropriate bound.
-      bool included;
-      PPL_DIRTY_TEMP(Coefficient, denom);
-      if (minimize(revised_lb_expr, numer_lower, denom, included)) {
-        denom_lower *= (denom * ub_var_coeff);
-        PPL_DIRTY_TEMP(mpq_class, q);
-        assign_r(q.get_num(), numer_lower, ROUND_NOT_NEEDED);
-        assign_r(q.get_den(), denom_lower, ROUND_NOT_NEEDED);
-        q.canonicalize();
-        if (!included)
-          open_lower = true;
-        Relation_Symbol rel;
-        if ((ub_var_coeff >= 0) ? !negative_denom : negative_denom)
-          rel = open_lower ? GREATER_THAN : GREATER_OR_EQUAL;
-        else
-          rel = open_lower ? LESS_THAN : LESS_OR_EQUAL;
-        seq_var.add_constraint(i_constraint(rel, q));
-        if (seq_var.is_empty()) {
-          set_empty();
-          return;
-        }
-      }
-    }
-
-    if (!unbounded_upper) {
-      // `ub_expr' is revised by removing the `var' component,
-      // multiplying by `-' denominator of the upper bound for `var',
-      // and adding the upper bound for `var' to the inhomogeneous term.
-      Linear_Expression revised_ub_expr(lb_expr);
-      revised_ub_expr -= lb_var_coeff * var;
-      PPL_DIRTY_TEMP(Coefficient, d);
-      neg_assign(d, denom_upper);
-      revised_ub_expr *= d;
-      revised_ub_expr += numer_upper;
-
-      // Find the maximum value for the revised upper bound expression
-      // and use this to refine the appropriate bound.
-      bool included;
-      PPL_DIRTY_TEMP(Coefficient, denom);
-      if (maximize(revised_ub_expr, numer_upper, denom, included)) {
-        denom_upper *= (denom * lb_var_coeff);
-        PPL_DIRTY_TEMP(mpq_class, q);
-        assign_r(q.get_num(), numer_upper, ROUND_NOT_NEEDED);
-        assign_r(q.get_den(), denom_upper, ROUND_NOT_NEEDED);
-        q.canonicalize();
-        if (!included)
-          open_upper = true;
-        Relation_Symbol rel;
-        if ((lb_var_coeff >= 0) ? !negative_denom : negative_denom)
-          rel = open_upper ? LESS_THAN : LESS_OR_EQUAL;
-        else
-          rel = open_upper ? GREATER_THAN : GREATER_OR_EQUAL;
-        seq_var.add_constraint(i_constraint(rel, q));
-        if (seq_var.is_empty()) {
-          set_empty();
-          return;
-        }
-      }
-    }
-  }
-
-  // If the implied constraint between `ub_expr and `lb_expr' is
-  // dependent on `var', then impose on the new box.
-  if (lb_var_coeff != ub_var_coeff) {
-    if (denominator > 0)
-      refine_with_constraint(lb_expr <= ub_expr);
-    else
-      refine_with_constraint(lb_expr >= ub_expr);
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>
-::generalized_affine_image(const Variable var,
-                           const Relation_Symbol relsym,
-                           const Linear_Expression& expr,
-                           Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  const dimension_type space_dim = space_dimension();
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  if (space_dim < expr.space_dimension())
-    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-				 "e", expr);
-  // `var' should be one of the dimensions of the box.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dim < var_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-				 "v", var);
-
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-                           "r is the disequality relation symbol");
-
-  // First compute the affine image.
-  affine_image(var, expr, denominator);
-
-  if (relsym == EQUAL)
-    // The affine relation is indeed an affine function.
-    return;
-
-  // Any image of an empty box is empty.
-  if (is_empty())
-    return;
-
-  ITV& seq_var = seq[var.id()];
-  switch (relsym) {
-  case LESS_OR_EQUAL:
-    seq_var.lower_extend();
-    break;
-  case LESS_THAN:
-    seq_var.lower_extend();
-    if (!seq_var.upper_is_boundary_infinity())
-      seq_var.remove_sup();
-    break;
-  case GREATER_OR_EQUAL:
-    seq_var.upper_extend();
-    break;
-  case GREATER_THAN:
-    seq_var.upper_extend();
-    if (!seq_var.lower_is_boundary_infinity())
-      seq_var.remove_inf();
-    break;
-  default:
-    // The EQUAL and NOT_EQUAL cases have been already dealt with.
-    PPL_UNREACHABLE;
-    break;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>
-::generalized_affine_preimage(const Variable var,
-                              const Relation_Symbol relsym,
-                              const Linear_Expression& expr,
-                              Coefficient_traits::const_reference denominator)
-{
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "d == 0");
-
-  // Dimension-compatibility checks.
-  const dimension_type space_dim = space_dimension();
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  if (space_dim < expr.space_dimension())
-    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-				 "e", expr);
-  // `var' should be one of the dimensions of the box.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dim < var_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-				 "v", var);
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "r is the disequality relation symbol");
-
-  // Check whether the affine relation is indeed an affine function.
-  if (relsym == EQUAL) {
-    affine_preimage(var, expr, denominator);
-    return;
-  }
-
-  // Compute the reversed relation symbol to simplify later coding.
-  Relation_Symbol reversed_relsym;
-  switch (relsym) {
-  case LESS_THAN:
-    reversed_relsym = GREATER_THAN;
-    break;
-  case LESS_OR_EQUAL:
-    reversed_relsym = GREATER_OR_EQUAL;
-    break;
-  case GREATER_OR_EQUAL:
-    reversed_relsym = LESS_OR_EQUAL;
-    break;
-  case GREATER_THAN:
-    reversed_relsym = LESS_THAN;
-    break;
-  default:
-    // The EQUAL and NOT_EQUAL cases have been already dealt with.
-    PPL_UNREACHABLE;
-    break;
-  }
-
-  // Check whether the preimage of this affine relation can be easily
-  // computed as the image of its inverse relation.
-  const Coefficient& var_coefficient = expr.coefficient(var);
-  if (var_coefficient != 0) {
-    Linear_Expression inverse_expr
-      = expr - (denominator + var_coefficient) * var;
-    PPL_DIRTY_TEMP_COEFFICIENT(inverse_denominator);
-    neg_assign(inverse_denominator, var_coefficient);
-    Relation_Symbol inverse_relsym
-      = (sgn(denominator) == sgn(inverse_denominator))
-      ? relsym
-      : reversed_relsym;
-    generalized_affine_image(var, inverse_relsym, inverse_expr,
-			     inverse_denominator);
-    return;
-  }
-
-  // Here `var_coefficient == 0', so that the preimage cannot
-  // be easily computed by inverting the affine relation.
-  // Shrink the box by adding the constraint induced
-  // by the affine relation.
-  // First, compute the maximum and minimum value reached by
-  // `denominator*var' on the box as we need to use non-relational
-  // expressions.
-  PPL_DIRTY_TEMP(Coefficient, max_numer);
-  PPL_DIRTY_TEMP(Coefficient, max_denom);
-  bool max_included;
-  bool bound_above = maximize(denominator*var, max_numer, max_denom, max_included);
-  PPL_DIRTY_TEMP(Coefficient, min_numer);
-  PPL_DIRTY_TEMP(Coefficient, min_denom);
-  bool min_included;
-  bool bound_below = minimize(denominator*var, min_numer, min_denom, min_included);
-  // Use the correct relation symbol
-  const Relation_Symbol corrected_relsym
-    = (denominator > 0) ? relsym : reversed_relsym;
-  // Revise the expression to take into account the denominator of the
-  // maximum/minimum value for `var'.
-  Linear_Expression revised_expr;
-  PPL_DIRTY_TEMP_COEFFICIENT(d);
-  if (corrected_relsym == LESS_THAN || corrected_relsym == LESS_OR_EQUAL) {
-    if (bound_below) {
-      revised_expr = expr;
-      revised_expr.set_inhomogeneous_term(Coefficient_zero());
-      revised_expr *= d;
-    }
-  }
-  else {
-    if (bound_above) {
-      revised_expr = expr;
-      revised_expr.set_inhomogeneous_term(Coefficient_zero());
-      revised_expr *= max_denom;
-    }
-  }
-
-  switch (corrected_relsym) {
-  case LESS_THAN:
-    if (bound_below)
-      refine_with_constraint(min_numer < revised_expr);
-    break;
-  case LESS_OR_EQUAL:
-    if (bound_below)
-      (min_included)
-        ? refine_with_constraint(min_numer <= revised_expr)
-        : refine_with_constraint(min_numer < revised_expr);
-    break;
-  case GREATER_OR_EQUAL:
-    if (bound_above)
-      (max_included)
-        ? refine_with_constraint(max_numer >= revised_expr)
-        : refine_with_constraint(max_numer > revised_expr);
-    break;
-  case GREATER_THAN:
-    if (bound_above)
-      refine_with_constraint(max_numer > revised_expr);
-    break;
-  default:
-    // The EQUAL and NOT_EQUAL cases have been already dealt with.
-    PPL_UNREACHABLE;
-    break;
-  }
-  // If the shrunk box is empty, its preimage is empty too.
-  if (is_empty())
-    return;
-  ITV& seq_v = seq[var.id()];
-  seq_v.assign(UNIVERSE);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>
-::generalized_affine_image(const Linear_Expression& lhs,
-                           const Relation_Symbol relsym,
-                           const Linear_Expression& rhs) {
-  // Dimension-compatibility checks.
-  // The dimension of `lhs' should not be greater than the dimension
-  // of `*this'.
-  dimension_type lhs_space_dim = lhs.space_dimension();
-  const dimension_type space_dim = space_dimension();
-  if (space_dim < lhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e1", lhs);
-  // The dimension of `rhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type rhs_space_dim = rhs.space_dimension();
-  if (space_dim < rhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e2", rhs);
-
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-                           "r is the disequality relation symbol");
-
-  // Any image of an empty box is empty.
-  if (marked_empty())
-    return;
-
-  // Compute the maximum and minimum value reached by the rhs on the box.
-  PPL_DIRTY_TEMP(Coefficient, max_numer);
-  PPL_DIRTY_TEMP(Coefficient, max_denom);
-  bool max_included;
-  bool max_rhs = maximize(rhs, max_numer, max_denom, max_included);
-  PPL_DIRTY_TEMP(Coefficient, min_numer);
-  PPL_DIRTY_TEMP(Coefficient, min_denom);
-  bool min_included;
-  bool min_rhs = minimize(rhs, min_numer, min_denom, min_included);
-
-  // Check whether there is 0, 1 or more than one variable in the lhs
-  // and record the variable with the highest dimension; set the box
-  // intervals to be unbounded for all other dimensions with non-zero
-  // coefficients in the lhs.
-  bool has_var = false;
-  dimension_type has_var_id = lhs.last_nonzero();
-
-  if (has_var_id != 0) {
-    has_var = true;
-    --has_var_id;
-    dimension_type other_var = lhs.first_nonzero(1, has_var_id + 1);
-    --other_var;
-    if (other_var != has_var_id) {
-      // There is more than one dimension with non-zero coefficient, so
-      // we cannot have any information about the dimensions in the lhs.
-      ITV& seq_var = seq[has_var_id];
-      seq_var.assign(UNIVERSE);
-      // Since all but the highest dimension with non-zero coefficient
-      // in the lhs have been set unbounded, it remains to set the
-      // highest dimension in the lhs unbounded.
-      ITV& seq_i = seq[other_var];
-      seq_i.assign(UNIVERSE);
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-
-  if (has_var) {
-    // There is exactly one dimension with non-zero coefficient.
-    ITV& seq_var = seq[has_var_id];
-
-    // Compute the new bounds for this dimension defined by the rhs
-    // expression.
-    const Coefficient& inhomo = lhs.inhomogeneous_term();
-    const Coefficient& coeff = lhs.coefficient(Variable(has_var_id));
-    PPL_DIRTY_TEMP(mpq_class, q_max);
-    PPL_DIRTY_TEMP(mpq_class, q_min);
-    if (max_rhs) {
-      max_numer -= inhomo * max_denom;
-      max_denom *= coeff;
-      assign_r(q_max.get_num(), max_numer, ROUND_NOT_NEEDED);
-      assign_r(q_max.get_den(), max_denom, ROUND_NOT_NEEDED);
-      q_max.canonicalize();
-    }
-    if (min_rhs) {
-      min_numer -= inhomo * min_denom;
-      min_denom *= coeff;
-      assign_r(q_min.get_num(), min_numer, ROUND_NOT_NEEDED);
-      assign_r(q_min.get_den(), min_denom, ROUND_NOT_NEEDED);
-      q_min.canonicalize();
-    }
-
-    // The choice as to which bounds should be set depends on the sign
-    // of the coefficient of the dimension `has_var_id' in the lhs.
-    if (coeff > 0)
-      // The coefficient of the dimension in the lhs is positive.
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        if (max_rhs) {
-          Relation_Symbol rel = max_included ? LESS_OR_EQUAL : LESS_THAN;
-          seq_var.build(i_constraint(rel, q_max));
-        }
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      case LESS_THAN:
-        if (max_rhs)
-          seq_var.build(i_constraint(LESS_THAN, q_max));
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      case EQUAL:
-	{
-	  I_Constraint<mpq_class> l;
-	  I_Constraint<mpq_class> u;
-	  if (max_rhs)
-	    u.set(max_included ? LESS_OR_EQUAL : LESS_THAN, q_max);
-	  if (min_rhs)
-	    l.set(min_included ? GREATER_OR_EQUAL : GREATER_THAN, q_min);
-	  seq_var.build(l, u);
-          break;
-	}
-      case GREATER_OR_EQUAL:
-        if (min_rhs) {
-          Relation_Symbol rel = min_included ? GREATER_OR_EQUAL : GREATER_THAN;
-          seq_var.build(i_constraint(rel, q_min));
-        }
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      case GREATER_THAN:
-        if (min_rhs)
-          seq_var.build(i_constraint(GREATER_THAN, q_min));
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      default:
-        // The NOT_EQUAL case has been already dealt with.
-        PPL_UNREACHABLE;
-        break;
-      }
-    else
-      // The coefficient of the dimension in the lhs is negative.
-      switch (relsym) {
-      case GREATER_OR_EQUAL:
-        if (min_rhs) {
-          Relation_Symbol rel = min_included ? LESS_OR_EQUAL : LESS_THAN;
-          seq_var.build(i_constraint(rel, q_min));
-        }
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      case GREATER_THAN:
-        if (min_rhs)
-          seq_var.build(i_constraint(LESS_THAN, q_min));
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      case EQUAL:
-	{
-	  I_Constraint<mpq_class> l;
-	  I_Constraint<mpq_class> u;
-	  if (max_rhs)
-	    l.set(max_included ? GREATER_OR_EQUAL : GREATER_THAN, q_max);
-	  if (min_rhs)
-	    u.set(min_included ? LESS_OR_EQUAL : LESS_THAN, q_min);
-	  seq_var.build(l, u);
-          break;
-	}
-      case LESS_OR_EQUAL:
-        if (max_rhs) {
-          Relation_Symbol rel = max_included ? GREATER_OR_EQUAL : GREATER_THAN;
-          seq_var.build(i_constraint(rel, q_max));
-        }
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      case LESS_THAN:
-        if (max_rhs)
-          seq_var.build(i_constraint(GREATER_THAN, q_max));
-        else
-          seq_var.assign(UNIVERSE);
-        break;
-      default:
-        // The NOT_EQUAL case has been already dealt with.
-        PPL_UNREACHABLE;
-        break;
-      }
-  }
-
-  else {
-    // The lhs is a constant value, so we just need to add the
-    // appropriate constraint.
-    const Coefficient& inhomo = lhs.inhomogeneous_term();
-    switch (relsym) {
-    case LESS_THAN:
-      refine_with_constraint(inhomo < rhs);
-      break;
-    case LESS_OR_EQUAL:
-      refine_with_constraint(inhomo <= rhs);
-      break;
-    case EQUAL:
-      refine_with_constraint(inhomo == rhs);
-      break;
-    case GREATER_OR_EQUAL:
-      refine_with_constraint(inhomo >= rhs);
-      break;
-    case GREATER_THAN:
-      refine_with_constraint(inhomo > rhs);
-      break;
-    default:
-      // The NOT_EQUAL case has been already dealt with.
-      PPL_UNREACHABLE;
-      break;
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-void
-Box<ITV>::generalized_affine_preimage(const Linear_Expression& lhs,
-                                      const Relation_Symbol relsym,
-                                      const Linear_Expression& rhs) {
-  // Dimension-compatibility checks.
-  // The dimension of `lhs' should not be greater than the dimension
-  // of `*this'.
-  dimension_type lhs_space_dim = lhs.space_dimension();
-  const dimension_type space_dim = space_dimension();
-  if (space_dim < lhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e1", lhs);
-  // The dimension of `rhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type rhs_space_dim = rhs.space_dimension();
-  if (space_dim < rhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e2", rhs);
-
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-                           "r is the disequality relation symbol");
-
-  // Any image of an empty box is empty.
-  if (marked_empty())
-    return;
-
-  // For any dimension occurring in the lhs, swap and change the sign
-  // of this component for the rhs and lhs.  Then use these in a call
-  // to generalized_affine_image/3.
-  Linear_Expression revised_lhs = lhs;
-  Linear_Expression revised_rhs = rhs;
-  for (Linear_Expression::const_iterator i = lhs.begin(),
-         i_end = lhs.end(); i != i_end; ++i) {
-    const Variable var = i.variable();
-    PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-    tmp = *i;
-    tmp += rhs.coefficient(var);
-    sub_mul_assign(revised_rhs, tmp, var);
-    sub_mul_assign(revised_lhs, tmp, var);
-  }
-  generalized_affine_image(revised_lhs, relsym, revised_rhs);
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-template <typename T, typename Iterator>
-typename Enable_If<Is_Same<T, Box<ITV> >::value
-                   && Is_Same_Or_Derived<Interval_Base, ITV>::value,
-                   void>::type
-Box<ITV>::CC76_widening_assign(const T& y, Iterator first, Iterator last) {
-  if (y.is_empty())
-    return;
-
-  for (dimension_type i = seq.size(); i-- > 0; )
-    seq[i].CC76_widening_assign(y.seq[i], first, last);
-
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-template <typename T>
-typename Enable_If<Is_Same<T, Box<ITV> >::value
-                   && Is_Same_Or_Derived<Interval_Base, ITV>::value,
-                   void>::type
-Box<ITV>::CC76_widening_assign(const T& y, unsigned* tp) {
-  static typename ITV::boundary_type stop_points[] = {
-    typename ITV::boundary_type(-2),
-    typename ITV::boundary_type(-1),
-    typename ITV::boundary_type(0),
-    typename ITV::boundary_type(1),
-    typename ITV::boundary_type(2)
-  };
-
-  Box& x = *this;
-  // If there are tokens available, work on a temporary copy.
-  if (tp != 0 && *tp > 0) {
-    Box<ITV> x_tmp(x);
-    x_tmp.CC76_widening_assign(y, 0);
-    // If the widening was not precise, use one of the available tokens.
-    if (!x.contains(x_tmp))
-      --(*tp);
-    return;
-  }
-  x.CC76_widening_assign(y,
-			 stop_points,
-			 stop_points
-			 + sizeof(stop_points)/sizeof(stop_points[0]));
-}
-
-template <typename ITV>
-void
-Box<ITV>::get_limiting_box(const Constraint_System& cs,
-                           Box& limiting_box) const {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(cs.space_dimension() <= space_dimension());
-
-  for (Constraint_System::const_iterator cs_i = cs.begin(),
-         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
-    const Constraint& c = *cs_i;
-    dimension_type c_num_vars = 0;
-    dimension_type c_only_var = 0;
-    // Constraints that are not interval constraints are ignored.
-    if (!Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var))
-      continue;
-    // Trivial constraints are ignored.
-    if (c_num_vars != 0) {
-      // c is a non-trivial interval constraint.
-      // add interval constraint to limiting box
-      const Coefficient& n = c.inhomogeneous_term();
-      const Coefficient& d = c.coefficient(Variable(c_only_var));
-      if (interval_relation(seq[c_only_var], c.type(), n, d)
-          == Poly_Con_Relation::is_included())
-        limiting_box.add_interval_constraint_no_check(c_only_var, c.type(),
-                                                      n, d);
-    }
-  }
-}
-
-template <typename ITV>
-void
-Box<ITV>::limited_CC76_extrapolation_assign(const Box& y,
-                                            const Constraint_System& cs,
-                                            unsigned* tp) {
-  Box& x = *this;
-  const dimension_type space_dim = x.space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)",
-                                 y);
-  // `cs' must be dimension-compatible with the two boxes.
-  const dimension_type cs_space_dim = cs.space_dimension();
-  if (space_dim < cs_space_dim)
-    throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");
-
-  // The limited CC76-extrapolation between two boxes in a
-  // zero-dimensional space is also a zero-dimensional box
-  if (space_dim == 0)
-    return;
-
-  // Assume `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  // Build a limiting box using all the constraints in cs
-  // that are satisfied by *this.
-  Box limiting_box(space_dim, UNIVERSE);
-  get_limiting_box(cs, limiting_box);
-
-  x.CC76_widening_assign(y, tp);
-
-  // Intersect the widened box with the limiting box.
-  intersection_assign(limiting_box);
-}
-
-template <typename ITV>
-template <typename T>
-typename Enable_If<Is_Same<T, Box<ITV> >::value
-                   && Is_Same_Or_Derived<Interval_Base, ITV>::value,
-                   void>::type
-Box<ITV>::CC76_narrowing_assign(const T& y) {
-  const dimension_type space_dim = space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dimension())
-    throw_dimension_incompatible("CC76_narrowing_assign(y)", y);
-
-  // Assume `*this' is contained in or equal to `y'.
-  PPL_EXPECT_HEAVY(copy_contains(y, *this));
-
-  // If both boxes are zero-dimensional,
-  // since `y' contains `*this', we simply return `*this'.
-  if (space_dim == 0)
-    return;
-
-  // If `y' is empty, since `y' contains `this', `*this' is empty too.
-  if (y.is_empty())
-    return;
-  // If `*this' is empty, we return.
-  if (is_empty())
-    return;
-
-  // Replace each constraint in `*this' by the corresponding constraint
-  // in `y' if the corresponding inhomogeneous terms are both finite.
-  for (dimension_type i = space_dim; i-- > 0; ) {
-    ITV& x_i = seq[i];
-    const ITV& y_i = y.seq[i];
-    if (!x_i.lower_is_boundary_infinity()
-	&& !y_i.lower_is_boundary_infinity()
-	&& x_i.lower() != y_i.lower())
-      x_i.lower() = y_i.lower();
-    if (!x_i.upper_is_boundary_infinity()
-	&& !y_i.upper_is_boundary_infinity()
-	&& x_i.upper() != y_i.upper())
-      x_i.upper() = y_i.upper();
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename ITV>
-Constraint_System
-Box<ITV>::constraints() const {
-  const dimension_type space_dim = space_dimension();
-  Constraint_System cs;
-  cs.set_space_dimension(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cs = Constraint_System::zero_dim_empty();
-    return cs;
-  }
-
-  if (marked_empty()) {
-    cs.insert(Constraint::zero_dim_false());
-    return cs;
-  }
-
-  for (dimension_type k = 0; k < space_dim; ++k) {
-    const Variable v_k = Variable(k);
-    PPL_DIRTY_TEMP(Coefficient, n);
-    PPL_DIRTY_TEMP(Coefficient, d);
-    bool closed = false;
-    if (has_lower_bound(v_k, n, d, closed)) {
-      if (closed)
-        cs.insert(d * v_k >= n);
-      else
-        cs.insert(d * v_k > n);
-    }
-    if (has_upper_bound(v_k, n, d, closed)) {
-      if (closed)
-        cs.insert(d * v_k <= n);
-      else
-        cs.insert(d * v_k < n);
-    }
-  }
-  return cs;
-}
-
-template <typename ITV>
-Constraint_System
-Box<ITV>::minimized_constraints() const {
-  const dimension_type space_dim = space_dimension();
-  Constraint_System cs;
-  cs.set_space_dimension(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cs = Constraint_System::zero_dim_empty();
-    return cs;
-  }
-
-  // Make sure emptiness is detected.
-  if (is_empty()) {
-    cs.insert(Constraint::zero_dim_false());
-    return cs;
-  }
-
-  for (dimension_type k = 0; k < space_dim; ++k) {
-    const Variable v_k = Variable(k);
-    PPL_DIRTY_TEMP(Coefficient, n);
-    PPL_DIRTY_TEMP(Coefficient, d);
-    bool closed = false;
-    if (has_lower_bound(v_k, n, d, closed)) {
-      if (closed)
-        // Make sure equality constraints are detected.
-        if (seq[k].is_singleton()) {
-          cs.insert(d * v_k == n);
-          continue;
-        }
-        else
-          cs.insert(d * v_k >= n);
-      else
-        cs.insert(d * v_k > n);
-    }
-    if (has_upper_bound(v_k, n, d, closed)) {
-      if (closed)
-        cs.insert(d * v_k <= n);
-      else
-        cs.insert(d * v_k < n);
-    }
-  }
-  return cs;
-}
-
-template <typename ITV>
-Congruence_System
-Box<ITV>::congruences() const {
-  const dimension_type space_dim = space_dimension();
-  Congruence_System cgs(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cgs = Congruence_System::zero_dim_empty();
-    return cgs;
-  }
-
-  // Make sure emptiness is detected.
-  if (is_empty()) {
-    cgs.insert(Congruence::zero_dim_false());
-    return cgs;
-  }
-
-  for (dimension_type k = 0; k < space_dim; ++k) {
-    const Variable v_k = Variable(k);
-    PPL_DIRTY_TEMP(Coefficient, n);
-    PPL_DIRTY_TEMP(Coefficient, d);
-    bool closed = false;
-    if (has_lower_bound(v_k, n, d, closed) && closed)
-      // Make sure equality congruences are detected.
-      if (seq[k].is_singleton())
-        cgs.insert((d * v_k %= n) / 0);
-  }
-  return cgs;
-}
-
-template <typename ITV>
-memory_size_type
-Box<ITV>::external_memory_in_bytes() const {
-  memory_size_type n = seq.capacity() * sizeof(ITV);
-  for (dimension_type k = seq.size(); k-- > 0; )
-    n += seq[k].external_memory_in_bytes();
-  return n;
-}
-
-/*! \relates Parma_Polyhedra_Library::Box */
-template <typename ITV>
-std::ostream&
-IO_Operators::operator<<(std::ostream& s, const Box<ITV>& box) {
-  if (box.is_empty())
-    s << "false";
-  else if (box.is_universe())
-    s << "true";
-  else
-    for (dimension_type k = 0,
-	   space_dim = box.space_dimension(); k < space_dim; ) {
-      s << Variable(k) << " in " << box[k];
-      ++k;
-      if (k < space_dim)
-	s << ", ";
-      else
-	break;
-    }
-  return s;
-}
-
-template <typename ITV>
-void
-Box<ITV>::ascii_dump(std::ostream& s) const {
-  const char separator = ' ';
-  status.ascii_dump(s);
-  const dimension_type space_dim = space_dimension();
-  s << "space_dim" << separator << space_dim;
-  s << "\n";
-  for (dimension_type i = 0; i < space_dim;  ++i)
-    seq[i].ascii_dump(s);
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(ITV, Box<ITV>)
-
-template <typename ITV>
-bool
-Box<ITV>::ascii_load(std::istream& s) {
-  if (!status.ascii_load(s))
-    return false;
-
-  std::string str;
-  dimension_type space_dim;
-  if (!(s >> str) || str != "space_dim")
-    return false;
-  if (!(s >> space_dim))
-    return false;
-
-  seq.clear();
-  ITV seq_i;
-  for (dimension_type i = 0; i < space_dim;  ++i) {
-    if (seq_i.ascii_load(s))
-      seq.push_back(seq_i);
-    else
-      return false;
-  }
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const Box& y) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << this->space_dimension()
-    << ", y->space_dimension() == " << y.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>
-::throw_dimension_incompatible(const char* method,
-			       dimension_type required_dim) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", required dimension == " << required_dim << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const Constraint& c) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", c->space_dimension == " << c.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const Congruence& cg) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", cg->space_dimension == " << cg.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const Constraint_System& cs) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", cs->space_dimension == " << cs.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const Congruence_System& cgs) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", cgs->space_dimension == " << cgs.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const Generator& g) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", g->space_dimension == " << g.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_constraint_incompatible(const char* method) {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "the constraint is incompatible.";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_expression_too_complex(const char* method,
-                                       const Linear_Expression& le) {
-  using namespace IO_Operators;
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << le << " is too complex.";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const char* le_name,
-                                       const Linear_Expression& le) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << "this->space_dimension() == " << space_dimension()
-    << ", " << le_name << "->space_dimension() == "
-    << le.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-template <typename C>
-void
-Box<ITV>::throw_dimension_incompatible(const char* method,
-                                       const char* lf_name,
-                                       const Linear_Form<C>& lf) const {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", " << lf_name << "->space_dimension() == "
-    << lf.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename ITV>
-void
-Box<ITV>::throw_invalid_argument(const char* method, const char* reason) {
-  std::ostringstream s;
-  s << "PPL::Box::" << method << ":" << std::endl
-    << reason;
-  throw std::invalid_argument(s.str());
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Box */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Specialization,
-	  typename Temp, typename To, typename ITV>
-bool
-l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const Box<ITV>& x, const Box<ITV>& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0, Temp& tmp1, Temp& tmp2) {
-  const dimension_type x_space_dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  // Zero-dim boxes are equal if and only if they are both empty or universe.
-  if (x_space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires a check for emptiness.
-  (void) x.is_empty();
-  (void) y.is_empty();
-  // If one of two boxes is empty, then they are equal if and only if
-  // the other box is empty too.
-  if (x.marked_empty() || y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty()) {
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-      return true;
-    }
-    else
-      goto pinf;
-  }
-
-  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
-  for (dimension_type i = x_space_dim; i-- > 0; ) {
-    const ITV& x_i = x.seq[i];
-    const ITV& y_i = y.seq[i];
-    // Dealing with the lower bounds.
-    if (x_i.lower_is_boundary_infinity()) {
-      if (!y_i.lower_is_boundary_infinity())
-	goto pinf;
-    }
-    else if (y_i.lower_is_boundary_infinity())
-      goto pinf;
-    else {
-      const Temp* tmp1p;
-      const Temp* tmp2p;
-      if (x_i.lower() > y_i.lower()) {
-	maybe_assign(tmp1p, tmp1, x_i.lower(), dir);
-	maybe_assign(tmp2p, tmp2, y_i.lower(), inverse(dir));
-      }
-      else {
-	maybe_assign(tmp1p, tmp1, y_i.lower(), dir);
-	maybe_assign(tmp2p, tmp2, x_i.lower(), inverse(dir));
-      }
-      sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
-      PPL_ASSERT(sgn(tmp1) >= 0);
-      Specialization::combine(tmp0, tmp1, dir);
-    }
-    // Dealing with the lower bounds.
-    if (x_i.upper_is_boundary_infinity())
-      if (y_i.upper_is_boundary_infinity())
-	continue;
-      else
-	goto pinf;
-    else if (y_i.upper_is_boundary_infinity())
-      goto pinf;
-    else {
-      const Temp* tmp1p;
-      const Temp* tmp2p;
-      if (x_i.upper() > y_i.upper()) {
-	maybe_assign(tmp1p, tmp1, x_i.upper(), dir);
-	maybe_assign(tmp2p, tmp2, y_i.upper(), inverse(dir));
-      }
-      else {
-	maybe_assign(tmp1p, tmp1, y_i.upper(), dir);
-	maybe_assign(tmp2p, tmp2, x_i.upper(), inverse(dir));
-      }
-      sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
-      PPL_ASSERT(sgn(tmp1) >= 0);
-      Specialization::combine(tmp0, tmp1, dir);
-    }
-  }
-  Specialization::finalize(tmp0, dir);
-  assign_r(r, tmp0, dir);
-  return true;
-
- pinf:
-  assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Box_templates_hh)
diff --git a/src/Box.types.hh b/src/Box.types.hh
deleted file mode 100644
index 298b6cd..0000000
--- a/src/Box.types.hh
+++ /dev/null
@@ -1,25 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Box_types_hh
-#define PPL_Box_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Interval>
-class Box;
-
-class Box_Helpers;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Box_types_hh)
diff --git a/src/Box_Status.idefs.hh b/src/Box_Status.idefs.hh
deleted file mode 100644
index c0dc5e6..0000000
--- a/src/Box_Status.idefs.hh
+++ /dev/null
@@ -1,115 +0,0 @@
-/* Box<ITV>::Status class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Box_Status_idefs_hh
-#define PPL_Box_Status_idefs_hh 1
-
-#ifndef PPL_IN_Box_CLASS
-#error "Do not include Box_Status.idefs.hh directly; use Box.defs.hh instead"
-#endif
-
-//! A conjunctive assertion about a Box<ITV> object.
-/*! \ingroup PPL_CXX_interface
-  The assertions supported are:
-  - <EM>empty up-to-date</EM>: the empty flag is meaningful;
-  - <EM>empty</EM>: the box is the empty set.
-  - <EM>universe</EM>: the box is universe \f$n\f$-dimensional vector space
-     \f$\Rset^n\f$.
-
-  Not all the conjunctions of these elementary assertions constitute
-  a legal Status.  In fact:
-  - <EM>empty up-to-date</EM> and <EM>empty</EM> excludes <EM>universe</EM>.
-*/
-class Status;
-
-class Status {
-public:
-  //! By default Status is the empty set of assertion.
-  Status();
-
-  //! Ordinary copy constructor.
-  Status(const Status& y);
-
-  //! Copy constructor from a box of different type.
-  template <typename Other_ITV>
-  Status(const typename Box<Other_ITV>::Status& y);
-
-  //! \name Test, remove or add an individual assertion from the conjunction.
-  //@{
-  bool test_empty_up_to_date() const;
-  void reset_empty_up_to_date();
-  void set_empty_up_to_date();
-
-  bool test_empty() const;
-  void reset_empty();
-  void set_empty();
-
-  bool test_universe() const;
-  void reset_universe();
-  void set_universe();
-  //@}
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-private:
-  //! Status is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bit-masks for the individual assertions.
-  //@{
-  static const flags_t NONE             = 0U;
-  static const flags_t EMPTY_UP_TO_DATE = 1U << 0;
-  static const flags_t EMPTY            = 1U << 1;
-  static const flags_t UNIVERSE         = 1U << 2;
-  //@}
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! Construct from a bit-mask.
-  Status(flags_t mask);
-
-  //! Check whether <EM>all</EM> bits in \p mask are set.
-  bool test_all(flags_t mask) const;
-
-  //! Check whether <EM>at least one</EM> bit in \p mask is set.
-  bool test_any(flags_t mask) const;
-
-  //! Set the bits in \p mask.
-  void set(flags_t mask);
-
-  //! Reset the bits in \p mask.
-  void reset(flags_t mask);
-};
-
-#endif // !defined(PPL_Box_Status_idefs_hh)
diff --git a/src/Box_Status.inlines.hh b/src/Box_Status.inlines.hh
deleted file mode 100644
index 0153073..0000000
--- a/src/Box_Status.inlines.hh
+++ /dev/null
@@ -1,228 +0,0 @@
-/* Box<ITV>::Status class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Box_Status_inlines_hh
-#define PPL_Box_Status_inlines_hh 1
-
-#include <string>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename ITV>
-inline
-Box<ITV>::Status::Status(flags_t mask)
-  : flags(mask) {
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Status::Status(const Status& y)
-  : flags(y.flags) {
-}
-
-template <typename ITV>
-template <typename Other_ITV>
-inline
-Box<ITV>::Status::Status(const typename Box<Other_ITV>::Status& y)
-  : flags(y.flags) {
-}
-
-template <typename ITV>
-inline
-Box<ITV>::Status::Status()
-  : flags(NONE) {
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::Status::test_all(flags_t mask) const {
-  return (flags & mask) == mask;
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::Status::test_any(flags_t mask) const {
-  return (flags & mask) != 0;
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::set(flags_t mask) {
-  flags |= mask;
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::reset(flags_t mask) {
-  flags &= ~mask;
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::Status::test_empty_up_to_date() const {
-  return test_any(EMPTY_UP_TO_DATE);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::reset_empty_up_to_date() {
-  reset(EMPTY_UP_TO_DATE);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::set_empty_up_to_date() {
-  set(EMPTY_UP_TO_DATE);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::Status::test_empty() const {
-  return test_any(EMPTY);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::reset_empty() {
-  reset(EMPTY);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::set_empty() {
-  set(EMPTY);
-}
-
-template <typename ITV>
-inline bool
-Box<ITV>::Status::test_universe() const {
-  return test_any(UNIVERSE);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::reset_universe() {
-  reset(UNIVERSE);
-}
-
-template <typename ITV>
-inline void
-Box<ITV>::Status::set_universe() {
-  set(UNIVERSE);
-}
-
-template <typename ITV>
-bool
-Box<ITV>::Status::OK() const {
-  if (test_empty_up_to_date()
-      && test_empty()
-      && test_universe()) {
-#ifndef NDEBUG
-    std::cerr
-      << "The status asserts emptiness and universality at the same time."
-      << std::endl;
-#endif
-    return false;
-  }
-
-  // Any other case is OK.
-  return true;
-}
-
-
-namespace Implementation {
-
-namespace Boxes {
-
-// These are the keywords that indicate the individual assertions.
-const std::string empty_up_to_date = "EUP";
-const std::string empty = "EM";
-const std::string universe = "UN";
-const char yes = '+';
-const char no = '-';
-const char separator = ' ';
-
-/*! \relates Parma_Polyhedra_Library::Box::Status
-  Reads a keyword and its associated on/off flag from \p s.
-  Returns <CODE>true</CODE> if the operation is successful,
-  returns <CODE>false</CODE> otherwise.
-  When successful, \p positive is set to <CODE>true</CODE> if the flag
-  is on; it is set to <CODE>false</CODE> otherwise.
-*/
-inline bool
-get_field(std::istream& s, const std::string& keyword, bool& positive) {
-  std::string str;
-  if (!(s >> str)
-      || (str[0] != yes && str[0] != no)
-      || str.substr(1) != keyword)
-    return false;
-  positive = (str[0] == yes);
-  return true;
-}
-
-} // namespace Boxes
-
-} // namespace Implementation
-
-template <typename ITV>
-void
-Box<ITV>::Status::ascii_dump(std::ostream& s) const {
-  using namespace Implementation::Boxes;
-  s << (test_empty_up_to_date() ? yes : no) << empty_up_to_date << separator
-    << (test_empty() ? yes : no) << empty << separator
-    << (test_universe() ? yes : no) << universe << separator;
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(ITV, Box<ITV>::Status)
-
-template <typename ITV>
-bool
-Box<ITV>::Status::ascii_load(std::istream& s) {
-  using namespace Implementation::Boxes;
-  PPL_UNINITIALIZED(bool, positive);
-
-  if (!get_field(s, Implementation::Boxes::empty_up_to_date, positive))
-    return false;
-  if (positive)
-    set_empty_up_to_date();
-
-  if (!get_field(s, Implementation::Boxes::empty, positive))
-    return false;
-  if (positive)
-    set_empty();
-
-  if (!get_field(s, universe, positive))
-    return false;
-  if (positive)
-    set_universe();
-  else
-    reset_universe();
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Box_Status_inlines_hh)
diff --git a/src/Box_Status_idefs.hh b/src/Box_Status_idefs.hh
new file mode 100644
index 0000000..8ec9fcd
--- /dev/null
+++ b/src/Box_Status_idefs.hh
@@ -0,0 +1,115 @@
+/* Box<ITV>::Status class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Box_Status_idefs_hh
+#define PPL_Box_Status_idefs_hh 1
+
+#ifndef PPL_IN_Box_CLASS
+#error "Do not include Box_Status_idefs.hh directly; use Box_defs.hh instead"
+#endif
+
+//! A conjunctive assertion about a Box<ITV> object.
+/*! \ingroup PPL_CXX_interface
+  The assertions supported are:
+  - <EM>empty up-to-date</EM>: the empty flag is meaningful;
+  - <EM>empty</EM>: the box is the empty set.
+  - <EM>universe</EM>: the box is universe \f$n\f$-dimensional vector space
+     \f$\Rset^n\f$.
+
+  Not all the conjunctions of these elementary assertions constitute
+  a legal Status.  In fact:
+  - <EM>empty up-to-date</EM> and <EM>empty</EM> excludes <EM>universe</EM>.
+*/
+class Status;
+
+class Status {
+public:
+  //! By default Status is the empty set of assertion.
+  Status();
+
+  //! Ordinary copy constructor.
+  Status(const Status& y);
+
+  //! Copy constructor from a box of different type.
+  template <typename Other_ITV>
+  Status(const typename Box<Other_ITV>::Status& y);
+
+  //! \name Test, remove or add an individual assertion from the conjunction.
+  //@{
+  bool test_empty_up_to_date() const;
+  void reset_empty_up_to_date();
+  void set_empty_up_to_date();
+
+  bool test_empty() const;
+  void reset_empty();
+  void set_empty();
+
+  bool test_universe() const;
+  void reset_universe();
+  void set_universe();
+  //@}
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+private:
+  //! Status is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bit-masks for the individual assertions.
+  //@{
+  static const flags_t NONE             = 0U;
+  static const flags_t EMPTY_UP_TO_DATE = 1U << 0;
+  static const flags_t EMPTY            = 1U << 1;
+  static const flags_t UNIVERSE         = 1U << 2;
+  //@}
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! Construct from a bit-mask.
+  Status(flags_t mask);
+
+  //! Check whether <EM>all</EM> bits in \p mask are set.
+  bool test_all(flags_t mask) const;
+
+  //! Check whether <EM>at least one</EM> bit in \p mask is set.
+  bool test_any(flags_t mask) const;
+
+  //! Set the bits in \p mask.
+  void set(flags_t mask);
+
+  //! Reset the bits in \p mask.
+  void reset(flags_t mask);
+};
+
+#endif // !defined(PPL_Box_Status_idefs_hh)
diff --git a/src/Box_Status_inlines.hh b/src/Box_Status_inlines.hh
new file mode 100644
index 0000000..84d89c3
--- /dev/null
+++ b/src/Box_Status_inlines.hh
@@ -0,0 +1,228 @@
+/* Box<ITV>::Status class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Box_Status_inlines_hh
+#define PPL_Box_Status_inlines_hh 1
+
+#include <string>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename ITV>
+inline
+Box<ITV>::Status::Status(flags_t mask)
+  : flags(mask) {
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Status::Status(const Status& y)
+  : flags(y.flags) {
+}
+
+template <typename ITV>
+template <typename Other_ITV>
+inline
+Box<ITV>::Status::Status(const typename Box<Other_ITV>::Status& y)
+  : flags(y.flags) {
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Status::Status()
+  : flags(NONE) {
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::Status::test_all(flags_t mask) const {
+  return (flags & mask) == mask;
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::Status::test_any(flags_t mask) const {
+  return (flags & mask) != 0;
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::set(flags_t mask) {
+  flags |= mask;
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::reset(flags_t mask) {
+  flags &= ~mask;
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::Status::test_empty_up_to_date() const {
+  return test_any(EMPTY_UP_TO_DATE);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::reset_empty_up_to_date() {
+  reset(EMPTY_UP_TO_DATE);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::set_empty_up_to_date() {
+  set(EMPTY_UP_TO_DATE);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::Status::test_empty() const {
+  return test_any(EMPTY);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::reset_empty() {
+  reset(EMPTY);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::set_empty() {
+  set(EMPTY);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::Status::test_universe() const {
+  return test_any(UNIVERSE);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::reset_universe() {
+  reset(UNIVERSE);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::Status::set_universe() {
+  set(UNIVERSE);
+}
+
+template <typename ITV>
+bool
+Box<ITV>::Status::OK() const {
+  if (test_empty_up_to_date()
+      && test_empty()
+      && test_universe()) {
+#ifndef NDEBUG
+    std::cerr
+      << "The status asserts emptiness and universality at the same time."
+      << std::endl;
+#endif
+    return false;
+  }
+
+  // Any other case is OK.
+  return true;
+}
+
+
+namespace Implementation {
+
+namespace Boxes {
+
+// These are the keywords that indicate the individual assertions.
+const std::string empty_up_to_date = "EUP";
+const std::string empty = "EM";
+const std::string universe = "UN";
+const char yes = '+';
+const char no = '-';
+const char separator = ' ';
+
+/*! \relates Parma_Polyhedra_Library::Box::Status
+  Reads a keyword and its associated on/off flag from \p s.
+  Returns <CODE>true</CODE> if the operation is successful,
+  returns <CODE>false</CODE> otherwise.
+  When successful, \p positive is set to <CODE>true</CODE> if the flag
+  is on; it is set to <CODE>false</CODE> otherwise.
+*/
+inline bool
+get_field(std::istream& s, const std::string& keyword, bool& positive) {
+  std::string str;
+  if (!(s >> str)
+      || (str[0] != yes && str[0] != no)
+      || str.substr(1) != keyword)
+    return false;
+  positive = (str[0] == yes);
+  return true;
+}
+
+} // namespace Boxes
+
+} // namespace Implementation
+
+template <typename ITV>
+void
+Box<ITV>::Status::ascii_dump(std::ostream& s) const {
+  using namespace Implementation::Boxes;
+  s << (test_empty_up_to_date() ? yes : no) << empty_up_to_date << separator
+    << (test_empty() ? yes : no) << empty << separator
+    << (test_universe() ? yes : no) << universe << separator;
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(ITV, Box<ITV>::Status)
+
+template <typename ITV>
+bool
+Box<ITV>::Status::ascii_load(std::istream& s) {
+  using namespace Implementation::Boxes;
+  PPL_UNINITIALIZED(bool, positive);
+
+  if (!get_field(s, Implementation::Boxes::empty_up_to_date, positive))
+    return false;
+  if (positive)
+    set_empty_up_to_date();
+
+  if (!get_field(s, Implementation::Boxes::empty, positive))
+    return false;
+  if (positive)
+    set_empty();
+
+  if (!get_field(s, universe, positive))
+    return false;
+  if (positive)
+    set_universe();
+  else
+    reset_universe();
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Box_Status_inlines_hh)
diff --git a/src/Box_defs.hh b/src/Box_defs.hh
new file mode 100644
index 0000000..2b83268
--- /dev/null
+++ b/src/Box_defs.hh
@@ -0,0 +1,2286 @@
+/* Box class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Box_defs_hh
+#define PPL_Box_defs_hh 1
+
+#include "Box_types.hh"
+#include "globals_types.hh"
+#include "Coefficient_defs.hh"
+#include "Variable_types.hh"
+#include "Variables_Set_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_types.hh"
+#include "Constraint_defs.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_types.hh"
+#include "Generator_System_types.hh"
+#include "Congruence_types.hh"
+#include "Congruence_System_types.hh"
+#include "BD_Shape_types.hh"
+#include "Octagonal_Shape_types.hh"
+#include "Poly_Con_Relation_types.hh"
+#include "Poly_Gen_Relation_types.hh"
+#include "Polyhedron_types.hh"
+#include "Grid_types.hh"
+#include "Partially_Reduced_Product_types.hh"
+#include "intervals_defs.hh"
+#include "Interval_types.hh"
+#include "Linear_Form_types.hh"
+#include <vector>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+struct Interval_Base;
+
+//! Swaps \p x with \p y.
+/*! \relates Box */
+template <typename ITV>
+void swap(Box<ITV>& x, Box<ITV>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are the same box.
+/*! \relates Box
+  Note that \p x and \p y may be dimension-incompatible boxes:
+  in this case, the value <CODE>false</CODE> is returned.
+*/
+template <typename ITV>
+bool operator==(const Box<ITV>& x, const Box<ITV>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are not the same box.
+/*! \relates Box
+  Note that \p x and \p y may be dimension-incompatible boxes:
+  in this case, the value <CODE>true</CODE> is returned.
+*/
+template <typename ITV>
+bool operator!=(const Box<ITV>& x, const Box<ITV>& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Box */
+template <typename ITV>
+std::ostream& operator<<(std::ostream& s, const Box<ITV>& box);
+
+} // namespace IO_Operators
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Box
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename ITV>
+bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Box
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename ITV>
+bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Box
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename ITV>
+bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Box
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename ITV>
+bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Box
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename ITV>
+bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Box
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename ITV>
+bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Box
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename ITV>
+bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Box
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename ITV>
+bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Box
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename ITV>
+bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Box
+  Helper function for computing distances.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Specialization,
+          typename Temp, typename To, typename ITV>
+bool
+l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                    const Box<ITV>& x, const Box<ITV>& y,
+                    Rounding_Dir dir,
+                    Temp& tmp0, Temp& tmp1, Temp& tmp2);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A not necessarily closed, iso-oriented hyperrectangle.
+/*! \ingroup PPL_CXX_interface
+  A Box object represents the smash product of \f$n\f$
+  not necessarily closed and possibly unbounded intervals
+  represented by objects of class \p ITV,
+  where \f$n\f$ is the space dimension of the box.
+
+  An <EM>interval constraint</EM> (resp., <EM>interval congruence</EM>)
+  is a syntactic constraint (resp., congruence) that only mentions
+  a single space dimension.
+
+  The Box domain <EM>optimally supports</EM>:
+    - tautological and inconsistent constraints and congruences;
+    - the interval constraints that are optimally supported by
+      the template argument class \c ITV;
+    - the interval congruences that are optimally supported by
+      the template argument class \c ITV.
+
+  Depending on the method, using a constraint or congruence that is not
+  optimally supported by the domain will either raise an exception or
+  result in a (possibly non-optimal) upward approximation.
+
+  The user interface for the Box domain is meant to be as similar
+  as possible to the one developed for the polyhedron class C_Polyhedron.
+*/
+template <typename ITV>
+class Parma_Polyhedra_Library::Box {
+public:
+  //! The type of intervals used to implement the box.
+  typedef ITV interval_type;
+
+  //! Returns the maximum space dimension that a Box can handle.
+  static dimension_type max_space_dimension();
+
+  /*! \brief
+    Returns false indicating that this domain does not recycle constraints
+  */
+  static bool can_recycle_constraint_systems();
+
+  /*! \brief
+    Returns false indicating that this domain does not recycle congruences
+  */
+  static bool can_recycle_congruence_systems();
+
+  //! \name Constructors, Assignment, Swap and Destructor
+  //@{
+
+  //! Builds a universe or empty box of the specified space dimension.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the box;
+
+    \param kind
+    Specifies whether the universe or the empty box has to be built.
+  */
+  explicit Box(dimension_type num_dimensions = 0,
+               Degenerate_Element kind = UNIVERSE);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  Box(const Box& y,
+      Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a conservative, upward approximation of \p y.
+  /*!
+    The complexity argument is ignored.
+  */
+  template <typename Other_ITV>
+  explicit Box(const Box<Other_ITV>& y,
+               Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a box from the system of constraints \p cs.
+  /*!
+    The box inherits the space dimension of \p cs.
+
+    \param cs
+    A system of constraints: constraints that are not
+    \ref intervals "interval constraints"
+    are ignored (even though they may have contributed
+    to the space dimension).
+  */
+  explicit Box(const Constraint_System& cs);
+
+  //! Builds a box recycling a system of constraints \p cs.
+  /*!
+    The box inherits the space dimension of \p cs.
+
+    \param cs
+    A system of constraints: constraints that are not
+    \ref intervals "interval constraints"
+    are ignored (even though they may have contributed
+    to the space dimension).
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+  */
+  Box(const Constraint_System& cs, Recycle_Input dummy);
+
+  //! Builds a box from the system of generators \p gs.
+  /*!
+    Builds the smallest box containing the polyhedron defined by \p gs.
+    The box inherits the space dimension of \p gs.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+  */
+  explicit Box(const Generator_System& gs);
+
+  //! Builds a box recycling the system of generators \p gs.
+  /*!
+    Builds the smallest box containing the polyhedron defined by \p gs.
+    The box inherits the space dimension of \p gs.
+
+    \param gs
+    The generator system describing the polyhedron to be approximated.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+  */
+  Box(const Generator_System& gs, Recycle_Input dummy);
+
+  /*!
+    Builds the smallest box containing the grid defined by a
+    system of congruences \p cgs.
+    The box inherits the space dimension of \p cgs.
+
+    \param cgs
+    A system of congruences: congruences that are not
+    non-relational equality constraints are ignored
+    (though they may have contributed to the space dimension).
+  */
+  explicit Box(const Congruence_System& cgs);
+
+  /*!
+    Builds the smallest box containing the grid defined by a
+    system of congruences \p cgs, recycling \p cgs.
+    The box inherits the space dimension of \p cgs.
+
+    \param cgs
+    A system of congruences: congruences that are not
+    non-relational equality constraints are ignored
+    (though they will contribute to the space dimension).
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+  */
+  Box(const Congruence_System& cgs, Recycle_Input dummy);
+
+  //! Builds a box containing the BDS \p bds.
+  /*!
+    Builds the smallest box containing \p bds using a polynomial algorithm.
+    The \p complexity argument is ignored.
+  */
+  template <typename T>
+  explicit Box(const BD_Shape<T>& bds,
+               Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
+
+  //! Builds a box containing the octagonal shape \p oct.
+  /*!
+    Builds the smallest box containing \p oct using a polynomial algorithm.
+    The \p complexity argument is ignored.
+  */
+  template <typename T>
+  explicit Box(const Octagonal_Shape<T>& oct,
+               Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
+
+  //! Builds a box containing the polyhedron \p ph.
+  /*!
+    Builds a box containing \p ph using algorithms whose complexity
+    does not exceed the one specified by \p complexity.  If
+    \p complexity is \p ANY_COMPLEXITY, then the built box is the
+    smallest one containing \p ph.
+  */
+  explicit Box(const Polyhedron& ph,
+               Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a box containing the grid \p gr.
+  /*!
+    Builds the smallest box containing \p gr using a polynomial algorithm.
+    The \p complexity argument is ignored.
+  */
+  explicit Box(const Grid& gr,
+               Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
+
+  //! Builds a box containing the partially reduced product \p dp.
+  /*!
+    Builds a box containing \p ph using algorithms whose complexity
+    does not exceed the one specified by \p complexity.
+  */
+  template <typename D1, typename D2, typename R>
+  explicit Box(const Partially_Reduced_Product<D1, D2, R>& dp,
+               Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator
+    (\p *this and \p y can be dimension-incompatible).
+  */
+  Box& operator=(const Box& y);
+
+  /*! \brief
+    Swaps \p *this with \p y
+    (\p *this and \p y can be dimension-incompatible).
+  */
+  void m_swap(Box& y);
+
+  //@} Constructors, Assignment, Swap and Destructor
+
+  //! \name Member Functions that Do Not Modify the Box
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
+    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
+    of \p *this.
+  */
+  dimension_type affine_dimension() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is an empty box.
+  bool is_empty() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a universe box.
+  bool is_universe() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a topologically closed subset of the vector space.
+  */
+  bool is_topologically_closed() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
+  bool is_discrete() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a bounded box.
+  bool is_bounded() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains at least one integer point.
+  */
+  bool contains_integer_point() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  bool constrains(Variable var) const;
+
+  //! Returns the relations holding between \p *this and the constraint \p c.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  //! Returns the relations holding between \p *this and the congruence \p cg.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p cg are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  //! Returns the relations holding between \p *this and the generator \p g.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  Poly_Gen_Relation relation_with(const Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from above in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from below in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
+    and \p maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value;
+
+    \param g
+    When maximization succeeds, will be assigned the point or
+    closure point where \p expr reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p g are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value;
+
+    \param g
+    When minimization succeeds, will be assigned a point or
+    closure point where \p expr reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p g are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if there exist a
+    unique value \p val such that \p *this
+    saturates the equality <CODE>expr = val</CODE>.
+
+    \param expr
+    The linear expression for which the frequency is needed;
+
+    \param freq_n
+    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
+    Present for interface compatibility with class Grid, where
+    the \ref Grid_Frequency "frequency" can have a non-zero value;
+
+    \param freq_d
+    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
+
+    \param val_n
+    The numerator of \p val;
+
+    \param val_d
+    The denominator of \p val;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
+    \p val_n and \p val_d are left untouched.
+  */
+  bool frequency(const Linear_Expression& expr,
+                 Coefficient& freq_n, Coefficient& freq_d,
+                 Coefficient& val_n, Coefficient& val_d) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this contains \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are dimension-incompatible.
+  */
+  bool contains(const Box& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are dimension-incompatible.
+  */
+  bool strictly_contains(const Box& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
+
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are dimension-incompatible.
+  */
+  bool is_disjoint_from(const Box& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this satisfies
+    all its invariants.
+  */
+  bool OK() const;
+
+  //@} Member Functions that Do Not Modify the Box
+
+  //! \name Space-Dimension Preserving Member Functions that May Modify the Box
+  //@{
+
+  /*! \brief
+    Adds a copy of constraint \p c to the system of constraints
+    defining \p *this.
+
+    \param c
+    The constraint to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible,
+    or \p c is not optimally supported by the Box domain.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of constraints
+    defining \p *this.
+
+    \param  cs
+    The constraints to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible,
+    or \p cs contains a constraint which is not optimally supported
+    by the box domain.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of constraints
+    defining \p *this.
+
+    \param  cs
+    The constraints to be added. They may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible,
+    or \p cs contains a constraint which is not optimally supported
+    by the box domain.
+
+    \warning
+    The only assumption that can be made on \p cs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_constraints(Constraint_System& cs);
+
+  /*! \brief
+    Adds to \p *this a constraint equivalent to the congruence \p cg.
+
+    \param cg
+    The congruence to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible,
+    or \p cg is not optimally supported by the box domain.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Adds to \p *this constraints equivalent to the congruences in \p cgs.
+
+    \param cgs
+    The congruences to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    or \p cgs contains a congruence which is not optimally supported
+    by the box domain.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Adds to \p *this constraints equivalent to the congruences in \p cgs.
+
+    \param cgs
+    The congruence system to be added to \p *this.  The congruences in
+    \p cgs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    or \p cgs contains a congruence which is not optimally supported
+    by the box domain.
+
+    \warning
+    The only assumption that can be made on \p cgs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_congruences(Congruence_System& cgs);
+
+  /*! \brief
+    Use the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  /*! \brief
+    Use the constraints in \p cs to refine \p *this.
+
+    \param  cs
+    The constraints to be used for refinement.
+    To avoid termination problems, each constraint in \p cs
+    will be used for a single refinement step.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+
+    \note
+    The user is warned that the accuracy of this refinement operator
+    depends on the order of evaluation of the constraints in \p cs,
+    which is in general unpredictable. If a fine control on such an
+    order is needed, the user should consider calling the method
+    <code>refine_with_constraint(const Constraint& c)</code> inside
+    an appropriate looping construct.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Use the congruence \p cg to refine \p *this.
+
+    \param cg
+    The congruence to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+  /*! \brief
+    Use the congruences in \p cgs to refine \p *this.
+
+    \param  cgs
+    The congruences to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Use the constraint \p c for constraint propagation on \p *this.
+
+    \param c
+    The constraint to be used for constraint propagation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible.
+  */
+  void propagate_constraint(const Constraint& c);
+
+  /*! \brief
+    Use the constraints in \p cs for constraint propagation on \p *this.
+
+    \param cs
+    The constraints to be used for constraint propagation.
+
+    \param max_iterations
+    The maximum number of propagation steps for each constraint in
+    \p cs.  If zero (the default), the number of propagation steps
+    will be unbounded, possibly resulting in an infinite loop.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+
+    \warning
+    This method may lead to non-termination if \p max_iterations is 0.
+  */
+  void propagate_constraints(const Constraint_System& cs,
+                             dimension_type max_iterations = 0);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  //! Assigns to \p *this the intersection of \p *this and \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void intersection_assign(const Box& y);
+
+  /*! \brief
+    Assigns to \p *this the smallest box containing the union
+    of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void upper_bound_assign(const Box& y);
+
+  /*! \brief
+    If the upper bound of \p *this and \p y is exact, it is assigned
+    to \p *this and <CODE>true</CODE> is returned,
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool upper_bound_assign_if_exact(const Box& y);
+
+  /*! \brief
+    Assigns to \p *this the difference of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void difference_assign(const Box& y);
+
+  /*! \brief
+    Assigns to \p *this a \ref Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+    If \c false is returned, then the intersection is empty.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool simplify_using_context_assign(const Box& y);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine image"
+    of \p *this under the function mapping variable \p var to the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of
+    \p *this.
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
+
+  // FIXME: To be completed.
+  /*! \brief
+    Assigns to \p *this the \ref affine_form_relation "affine form image"
+    of \p *this under the function mapping variable \p var into the
+    affine expression(s) specified by \p lf.
+
+    \param var
+    The variable to which the affine expression is assigned.
+
+    \param lf
+    The linear form on intervals with floating point boundaries that
+    defines the affine expression(s). ALL of its coefficients MUST be bounded.
+
+    \exception std::invalid_argument
+    Thrown if \p lf and \p *this are dimension-incompatible or if \p var
+    is not a dimension of \p *this.
+
+    This function is used in abstract interpretation to model an assignment
+    of a value that is correctly overapproximated by \p lf to the
+    floating point variable represented by \p var.
+  */
+  void affine_form_image(Variable var,
+                         const Linear_Form<ITV>& lf);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine preimage"
+    of \p *this under the function mapping variable \p var to the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is substituted;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this.
+  */
+  void affine_preimage(Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this.
+  */
+  void generalized_affine_image(Variable var,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                  = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this.
+  */
+  void
+  generalized_affine_preimage(Variable var,
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs.
+  */
+  void generalized_affine_image(const Linear_Expression& lhs,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs.
+  */
+  void generalized_affine_preimage(const Linear_Expression& lhs,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void time_elapse_assign(const Box& y);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  /*! \brief
+    \ref Wrapping_Operator "Wraps" the specified dimensions of the
+    vector space.
+
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be wrapped.
+
+    \param w
+    The width of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param r
+    The representation of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param o
+    The overflow behavior of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param cs_p
+    Possibly null pointer to a constraint system.  When non-null,
+    the pointed-to constraint system is assumed to represent the
+    conditional or looping construct guard with respect to which
+    wrapping is performed.  Since wrapping requires the computation
+    of upper bounds and due to non-distributivity of constraint
+    refinement over upper bounds, passing a constraint system in this
+    way can be more precise than refining the result of the wrapping
+    operation with the constraints in <CODE>*cs_p</CODE>.
+
+    \param complexity_threshold
+    A precision parameter which is ignored for the Box domain.
+
+    \param wrap_individually
+    A precision parameter which is ignored for the Box domain.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars or with <CODE>*cs_p</CODE>.
+  */
+  void wrap_assign(const Variables_Set& vars,
+                   Bounded_Integer_Type_Width w,
+                   Bounded_Integer_Type_Representation r,
+                   Bounded_Integer_Type_Overflow o,
+                   const Constraint_System* cs_p = 0,
+                   unsigned complexity_threshold = 16,
+                   bool wrap_individually = true);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref CC76_extrapolation "CC76-widening" between \p *this and \p y.
+
+    \param y
+    A box that <EM>must</EM> be contained in \p *this.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  template <typename T>
+  typename Enable_If<Is_Same<T, Box>::value
+                     && Is_Same_Or_Derived<Interval_Base, ITV>::value,
+                     void>::type
+  CC76_widening_assign(const T& y, unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref CC76_extrapolation "CC76-widening" between \p *this and \p y.
+
+    \param y
+    A box that <EM>must</EM> be contained in \p *this.
+
+    \param first
+    An iterator that points to the first stop-point.
+
+    \param last
+    An iterator that points one past the last stop-point.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  template <typename T, typename Iterator>
+  typename Enable_If<Is_Same<T, Box>::value
+                     && Is_Same_Or_Derived<Interval_Base, ITV>::value,
+                     void>::type
+  CC76_widening_assign(const T& y,
+                       Iterator first, Iterator last);
+
+  //! Same as CC76_widening_assign(y, tp).
+  void widening_assign(const Box& y, unsigned* tp = 0);
+
+  /*! \brief
+    Improves the result of the \ref CC76_extrapolation "CC76-extrapolation"
+    computation by also enforcing those constraints in \p cs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    A box that <EM>must</EM> be contained in \p *this.
+
+    \param cs
+    The system of constraints used to improve the widened box.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
+    if \p cs contains a strict inequality.
+  */
+  void limited_CC76_extrapolation_assign(const Box& y,
+                                         const Constraint_System& cs,
+                                         unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of restoring in \p y the constraints
+    of \p *this that were lost by
+    \ref CC76_extrapolation "CC76-extrapolation" applications.
+
+    \param y
+    A Box that <EM>must</EM> contain \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \note
+    As was the case for widening operators, the argument \p y is meant to
+    denote the value computed in the previous iteration step, whereas
+    \p *this denotes the value computed in the current iteration step
+    (in the <EM>decreasing</EM> iteration sequence). Hence, the call
+    <CODE>x.CC76_narrowing_assign(y)</CODE> will assign to \p x
+    the result of the computation \f$\mathtt{y} \Delta \mathtt{x}\f$.
+  */
+  template <typename T>
+  typename Enable_If<Is_Same<T, Box>::value
+                     && Is_Same_Or_Derived<Interval_Base, ITV>::value,
+                     void>::type
+  CC76_narrowing_assign(const T& y);
+
+  //@} Space-Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  //! Adds \p m new dimensions and embeds the old box into the new space.
+  /*!
+    \param m
+    The number of dimensions to add.
+
+    The new dimensions will be those having the highest indexes in the new
+    box, which is defined by a system of interval constraints in which the
+    variables running through the new dimensions are unconstrained.
+    For instance, when starting from the box \f$\cB \sseq \Rset^2\f$
+    and adding a third dimension, the result will be the box
+    \f[
+      \bigl\{\,
+        (x, y, z)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cB
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Adds \p m new dimensions to the box and does not embed it in
+    the new vector space.
+
+    \param m
+    The number of dimensions to add.
+
+    The new dimensions will be those having the highest indexes in the
+    new box, which is defined by a system of bounded differences in
+    which the variables running through the new dimensions are all
+    constrained to be equal to 0.
+    For instance, when starting from the box \f$\cB \sseq \Rset^2\f$
+    and adding a third dimension, the result will be the box
+    \f[
+      \bigl\{\,
+        (x, y, 0)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cB
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  /*! \brief
+    Seeing a box as a set of tuples (its points),
+    assigns to \p *this all the tuples that can be obtained by concatenating,
+    in the order given, a tuple of \p *this with a tuple of \p y.
+
+    Let \f$B \sseq \Rset^n\f$ and \f$D \sseq \Rset^m\f$ be the boxes
+    corresponding, on entry, to \p *this and \p y, respectively.
+    Upon successful completion, \p *this will represent the box
+    \f$R \sseq \Rset^{n+m}\f$ such that
+    \f[
+      R \defeq
+          \Bigl\{\,
+            (x_1, \ldots, x_n, y_1, \ldots, y_m)^\transpose
+          \Bigm|
+            (x_1, \ldots, x_n)^\transpose \in B,
+            (y_1, \ldots, y_m)^\transpose \in D
+          \,\Bigl\}.
+    \f]
+    Another way of seeing it is as follows: first increases the space
+    dimension of \p *this by adding \p y.space_dimension() new
+    dimensions; then adds to the system of constraints of \p *this a
+    renamed-apart version of the constraints of \p y.
+  */
+  void concatenate_assign(const Box& y);
+
+  //! Removes all the specified dimensions.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the dimensions to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the Variable
+    objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher dimensions so that the resulting space
+    will have dimension \p new_dimension.
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimension is greater than the space dimension
+    of \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
+
+    \param pfunc
+    The partial function specifying the destiny of each dimension.
+
+    The template type parameter Partial_Function must provide
+    the following methods.
+    \code
+      bool has_empty_codomain() const
+    \endcode
+    returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty co-domain (i.e., it is always undefined).
+    The <CODE>has_empty_codomain()</CODE> method will always be called
+    before the methods below.  However, if
+    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
+    of the functions below will be called.
+    \code
+      dimension_type max_in_codomain() const
+    \endcode
+    returns the maximum value that belongs to the co-domain
+    of the partial function.
+    \code
+      bool maps(dimension_type i, dimension_type& j) const
+    \endcode
+    Let \f$f\f$ be the represented function and \f$k\f$ be the value
+    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
+    assigned to \p j and <CODE>true</CODE> is returned.
+    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
+    returned.
+
+    The result is undefined if \p pfunc does not encode a partial
+    function with the properties described in the
+    \ref Mapping_the_Dimensions_of_the_Vector_Space
+    "specification of the mapping operator".
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref expand_space_dimension "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.
+    Also thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are \ref fold_space_dimensions "folded"
+    into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+  /*! \brief
+    Returns a reference the interval that bounds \p var.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  const ITV& get_interval(Variable var) const;
+
+  /*! \brief
+    Sets to \p i the interval that bounds \p var.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void set_interval(Variable var, const ITV& i);
+
+  /*! \brief
+    If the space dimension of \p var is unbounded below, return
+    <CODE>false</CODE>. Otherwise return <CODE>true</CODE> and set
+    \p n, \p d and \p closed accordingly.
+
+    \note
+    It is assumed that <CODE>*this</CODE> is a non-empty box
+    having space dimension greater than or equal to that of \p var.
+    An undefined behavior is obtained if this assumption is not met.
+    \if Include_Implementation_Details
+    To be more precise, if <CODE>*this</CODE> is an <EM>empty</EM> box
+    (having space dimension greater than or equal to that of \p var)
+    such that <CODE>!marked_empty()</CODE> holds, then the method can be
+    called without incurring in undefined behavior: it will return
+    <EM>unspecified</EM> boundary values that, if queried systematically
+    on all space dimensions, will encode the box emptiness.
+    \endif
+
+    Let \f$I\f$ be the interval corresponding to variable \p var
+    in the non-empty box <CODE>*this</CODE>.
+    If \f$I\f$ is not bounded from below, simply return <CODE>false</CODE>
+    (leaving all other parameters unchanged).
+    Otherwise, set \p n, \p d and \p closed as follows:
+     - \p n and \p d are assigned the integers \f$n\f$ and \f$d\f$ such
+       that the fraction \f$n/d\f$ corresponds to the greatest lower bound
+       of \f$I\f$. The fraction \f$n/d\f$ is in canonical form, meaning
+       that \f$n\f$ and \f$d\f$ have no common factors, \f$d\f$ is positive,
+       and if \f$n\f$ is zero then \f$d\f$ is one;
+     - \p closed is set to <CODE>true</CODE> if and only if the lower
+       boundary of \f$I\f$ is closed (i.e., it is included in the interval).
+  */
+  bool has_lower_bound(Variable var,
+                       Coefficient& n, Coefficient& d, bool& closed) const;
+
+  /*! \brief
+    If the space dimension of \p var is unbounded above, return
+    <CODE>false</CODE>. Otherwise return <CODE>true</CODE> and set
+    \p n, \p d and \p closed accordingly.
+
+    \note
+    It is assumed that <CODE>*this</CODE> is a non-empty box
+    having space dimension greater than or equal to that of \p var.
+    An undefined behavior is obtained if this assumption is not met.
+    \if Include_Implementation_Details
+    To be more precise, if <CODE>*this</CODE> is an <EM>empty</EM> box
+    (having space dimension greater than or equal to that of \p var)
+    such that <CODE>!marked_empty()</CODE> holds, then the method can be
+    called without incurring in undefined behavior: it will return
+    <EM>unspecified</EM> boundary values that, if queried systematically
+    on all space dimensions, will encode the box emptiness.
+    \endif
+
+    Let \f$I\f$ be the interval corresponding to variable \p var
+    in the non-empty box <CODE>*this</CODE>.
+    If \f$I\f$ is not bounded from above, simply return <CODE>false</CODE>
+    (leaving all other parameters unchanged).
+    Otherwise, set \p n, \p d and \p closed as follows:
+     - \p n and \p d are assigned the integers \f$n\f$ and \f$d\f$ such
+       that the fraction \f$n/d\f$ corresponds to the least upper bound
+       of \f$I\f$. The fraction \f$n/d\f$ is in canonical form, meaning
+       that \f$n\f$ and \f$d\f$ have no common factors, \f$d\f$ is positive,
+       and if \f$n\f$ is zero then \f$d\f$ is one;
+     - \p closed is set to <CODE>true</CODE> if and only if the upper
+       boundary of \f$I\f$ is closed (i.e., it is included in the interval).
+  */
+  bool has_upper_bound(Variable var,
+                       Coefficient& n, Coefficient& d, bool& closed) const;
+
+  //! Returns a system of constraints defining \p *this.
+  Constraint_System constraints() const;
+
+  //! Returns a minimized system of constraints defining \p *this.
+  Constraint_System minimized_constraints() const;
+
+  //! Returns a system of congruences approximating \p *this.
+  Congruence_System congruences() const;
+
+  //! Returns a minimized system of congruences approximating \p *this.
+  Congruence_System minimized_congruences() const;
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If <CODE>x</CODE> and <CODE>y</CODE> are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool ascii_load(std::istream& s);
+
+private:
+  template <typename Other_ITV>
+  friend class Parma_Polyhedra_Library::Box;
+
+  friend bool
+  operator==<ITV>(const Box<ITV>& x, const Box<ITV>& y);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library
+  ::IO_Operators::operator<<<>(std::ostream& s, const Box<ITV>& box);
+
+  template <typename Specialization, typename Temp, typename To, typename I>
+  friend bool Parma_Polyhedra_Library::l_m_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const Box<I>& x, const Box<I>& y, const Rounding_Dir dir,
+   Temp& tmp0, Temp& tmp1, Temp& tmp2);
+
+  //! The type of sequence used to implement the box.
+  typedef std::vector<ITV> Sequence;
+
+  /*! \brief
+    The type of intervals used by inner computations when trying to limit
+    the cumulative effect of approximation errors.
+  */
+  typedef ITV Tmp_Interval_Type;
+
+  //! A sequence of intervals, one for each dimension of the vector space.
+  Sequence seq;
+
+#define PPL_IN_Box_CLASS
+#include "Box_Status_idefs.hh"
+#undef PPL_IN_Box_CLASS
+
+  //! The status flags to keep track of the internal state.
+  Status status;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the box is known to be empty.
+
+    The return value <CODE>false</CODE> does not necessarily
+    implies that \p *this is non-empty.
+  */
+  bool marked_empty() const;
+
+public:
+  //! Causes the box to become empty, i.e., to represent the empty set.
+  void set_empty();
+
+private:
+  //! Marks \p *this as definitely not empty.
+  void set_nonempty();
+
+  //! Asserts the validity of the empty flag of \p *this.
+  void set_empty_up_to_date();
+
+  //! Invalidates empty flag of \p *this.
+  void reset_empty_up_to_date();
+
+  /*! \brief
+    Checks the hard way whether \p *this is an empty box:
+    returns <CODE>true</CODE> if and only if it is so.
+  */
+  bool check_empty() const;
+
+   /*! \brief
+     Returns a reference the interval that bounds
+     the box on the <CODE>k</CODE>-th space dimension.
+   */
+  const ITV& operator[](dimension_type k) const;
+
+  /*! \brief
+    WRITE ME.
+  */
+  static I_Result
+  refine_interval_no_check(ITV& itv,
+                           Constraint::Type type,
+                           Coefficient_traits::const_reference numer,
+                           Coefficient_traits::const_reference denom);
+
+  /*! \brief
+    WRITE ME.
+  */
+  void
+  add_interval_constraint_no_check(dimension_type var_id,
+                                   Constraint::Type type,
+                                   Coefficient_traits::const_reference numer,
+                                   Coefficient_traits::const_reference denom);
+
+  /*! \brief
+    WRITE ME.
+  */
+  void add_constraint_no_check(const Constraint& c);
+
+  /*! \brief
+    WRITE ME.
+  */
+  void add_constraints_no_check(const Constraint_System& cs);
+
+  /*! \brief
+    WRITE ME.
+  */
+  void add_congruence_no_check(const Congruence& cg);
+
+  /*! \brief
+    WRITE ME.
+  */
+  void add_congruences_no_check(const Congruence_System& cgs);
+
+  /*! \brief
+    Uses the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be used for the refinement.
+
+    \warning
+    If \p c and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Constraint& c);
+
+  /*! \brief
+    Uses the constraints in \p cs to refine \p *this.
+
+    \param cs
+    The constraints to be used for the refinement.
+    To avoid termination problems, each constraint in \p cs
+    will be used for a single refinement step.
+
+    \warning
+    If \p cs and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Constraint_System& cs);
+
+  /*! \brief
+    Uses the congruence \p cg to refine \p *this.
+
+    \param cg
+    The congruence to be added.
+    Nontrivial proper congruences are ignored.
+
+    \warning
+    If \p cg and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Congruence& cg);
+
+  /*! \brief
+    Uses the congruences in \p cgs to refine \p *this.
+
+    \param cgs
+    The congruences to be added.
+    Nontrivial proper congruences are ignored.
+
+    \warning
+    If \p cgs and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Congruence_System& cgs);
+
+  /*! \brief
+    Propagates the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be propagated.
+
+    \warning
+    If \p c and \p *this are dimension-incompatible,
+    the behavior is undefined.
+
+    \warning
+    This method may lead to non-termination.
+
+    \if Include_Implementation_Details
+
+    For any expression \f$e\f$, we denote by
+    \f$\left\uparrow e \right\uparrow\f$ (resp., \f$\left\downarrow e
+    \right\downarrow\f$) the result of any computation that is
+    guaranteed to yield an upper (resp., lower) approximation of
+    \f$e\f$.  So there exists \f$\epsilon \in \Rset\f$ with
+    \f$\epsilon \geq 0\f$ such that
+    \f$\left\uparrow e \right\uparrow = e + \epsilon\f$.
+    If \f$\epsilon = 0\f$ we say that the computation of
+    \f$\left\uparrow e \right\uparrow\f$ is <EM>exact</EM>;
+    we say it is <EM>inexact</EM> otherwise.
+    Similarly for \f$\left\downarrow e \right\downarrow\f$.
+
+    Consider a constraint of the general form
+    \f[
+      z + \sum_{i \in I}{a_ix_i} \relsym 0,
+    \f]
+    where \f$z \in \Zset\f$, \f$I\f$ is a set of indices,
+    \f$a_i \in \Zset\f$ with \f$a_i \neq 0\f$ for each \f$i \in I\f$, and
+    \f$\mathord{\relsym} \in \{ \mathord{\geq}, \mathord{>}, \mathord{=} \}\f$.
+    The set \f$I\f$ is subdivided into the disjoint sets \f$P\f$ and \f$N\f$
+    such that, for each \f$i \in I\f$, \f$a_i > 0\f$ if \f$i \in P\f$ and
+    \f$a_i < 0\f$ if \f$i \in N\f$.
+    Suppose that, for each \f$i \in P \union N\f$ a variation interval
+    \f$\chi_i \sseq \Rset\f$ is known for \f$x_i\f$ and that the infimum
+    and the supremum of \f$\chi_i\f$ are denoted, respectively,
+    by \f$\chi_i^\mathrm{l}\f$ and \f$\chi_i^\mathrm{u}\f$, where
+    \f$\chi_i^\mathrm{l}, \chi_i^\mathrm{u} \in \Rset \union \{ -\infty, +\infty \}\f$.
+
+    For each \f$k \in P\f$, we have
+    \f[
+      x_k
+        \relsym
+          \frac{1}{a_k}
+            \Biggl(
+              - z
+              - \sum_{i \in N}{a_ix_i}
+              - \sum_{\genfrac{}{}{0pt}{}
+                              {\scriptstyle i \in P}
+                              {\scriptstyle i \neq k}}{a_ix_i}
+            \Biggr).
+    \f]
+    Thus, if \f$\chi_i^\mathrm{l} \in \Rset\f$ for each \f$i \in N\f$ and
+    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in P \setdiff \{ k \}\f$,
+    we have
+    \f[
+      x_k
+        \geq
+          \Biggl\downarrow
+          \frac{1}{a_k}
+            \Biggl(
+              - z
+              - \sum_{i \in N}{a_i\chi_i^\mathrm{l}}
+              - \sum_{\genfrac{}{}{0pt}{}
+                              {\scriptstyle i \in P}
+                              {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{u}}
+            \Biggr)
+          \Biggr\downarrow
+    \f]
+    and, if \f$\mathord{\relsym} \in \{ \mathord{=} \}\f$,
+    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in N\f$ and
+    \f$\chi_i^\mathrm{l} \in \Rset\f$ for each \f$P \setdiff \{ k \}\f$,
+    \f[
+      x_k
+        \leq
+          \Biggl\uparrow
+          \frac{1}{a_k}
+            \Biggl(
+              - z
+              - \sum_{i \in N}{a_i\chi_i^\mathrm{u}}
+              - \sum_{\genfrac{}{}{0pt}{}
+                              {\scriptstyle i \in P}
+                              {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{l}}
+            \Biggr)
+          \Biggl\uparrow.
+    \f]
+    In the first inequality, the relation is strict if
+    \f$\mathord{\relsym} \in \{ \mathord{>} \}\f$, or if
+    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some \f$i \in N\f$, or if
+    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some
+    \f$i \in P \setdiff \{ k \}\f$, or if the computation is inexact.
+    In the second inequality, the relation is strict if
+    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some \f$i \in N\f$, or if
+    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some
+    \f$i \in P \setdiff \{ k \}\f$, or if the computation is inexact.
+
+    For each \f$k \in N\f$, we have
+    \f[
+      \frac{1}{a_k}
+        \Biggl(
+          - z
+          - \sum_{\genfrac{}{}{0pt}{}
+                          {\scriptstyle i \in N}
+                          {\scriptstyle i \neq k}}{a_ix_i}
+          - \sum_{i \in P}{a_ix_i}
+        \Biggr)
+          \relsym
+            x_k.
+    \f]
+    Thus, if
+    \f$\chi_i^\mathrm{l} \in \Rset\f$
+    for each \f$i \in N \setdiff \{ k \}\f$ and
+    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in P\f$,
+    we have
+    \f[
+      \Biggl\uparrow
+      \frac{1}{a_k}
+        \Biggl(
+          - z
+          - \sum_{\genfrac{}{}{0pt}{}
+                          {\scriptstyle i \in N}
+                          {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{l}}
+          - \sum_{i \in P}{a_i\chi_i^\mathrm{u}}
+        \Biggr)
+      \Biggl\uparrow
+        \geq
+          x_k
+    \f]
+    and, if \f$\mathord{\relsym} \in \{ \mathord{=} \}\f$,
+    \f$\chi_i^\mathrm{u} \in \Rset\f$ for each \f$i \in N \setdiff \{ k \}\f$
+    and \f$\chi_i^\mathrm{l} \in \Rset\f$ for each \f$i \in P\f$,
+    \f[
+      \Biggl\downarrow
+      \frac{1}{a_k}
+        \Biggl(
+          - z
+          - \sum_{\genfrac{}{}{0pt}{}
+                          {\scriptstyle i \in N}
+                          {\scriptstyle i \neq k}}{a_i\chi_i^\mathrm{u}}
+          - \sum_{i \in P}{a_i\chi_i^\mathrm{l}}
+        \Biggr)
+      \Biggl\downarrow
+        \leq
+          x_k.
+    \f]
+    In the first inequality, the relation is strict if
+    \f$\mathord{\relsym} \in \{ \mathord{>} \}\f$, or if
+    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some \f$i \in P\f$, or if
+    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some
+    \f$i \in N \setdiff \{ k \}\f$, or if the computation is inexact.
+    In the second inequality, the relation is strict if
+    \f$\chi_i^\mathrm{l} \notin \chi_i\f$ for some \f$i \in P\f$, or if
+    \f$\chi_i^\mathrm{u} \notin \chi_i\f$ for some
+    \f$i \in N \setdiff \{ k \}\f$, or if the computation is inexact.
+    \endif
+  */
+  void propagate_constraint_no_check(const Constraint& c);
+
+  /*! \brief
+    Propagates the constraints in \p cs to refine \p *this.
+
+    \param  cs
+    The constraints to be propagated.
+
+    \param max_iterations
+    The maximum number of propagation steps for each constraint in \p cs.
+    If zero, the number of propagation steps will be unbounded, possibly
+    resulting in an infinite loop.
+
+    \warning
+    If \p cs and \p *this are dimension-incompatible,
+    the behavior is undefined.
+
+    \warning
+    This method may lead to non-termination if \p max_iterations is 0.
+  */
+  void propagate_constraints_no_check(const Constraint_System& cs,
+                                      dimension_type max_iterations);
+
+  //! Checks if and how \p expr is bounded in \p *this.
+  /*!
+    Returns <CODE>true</CODE> if and only if \p from_above is
+    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
+    or \p from_above is <CODE>false</CODE> and \p expr is bounded
+    from below in \p *this.
+
+    \param expr
+    The linear expression to test;
+
+    \param from_above
+    <CODE>true</CODE> if and only if the boundedness of interest is
+    "from above".
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds(const Linear_Expression& expr, bool from_above) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p *this;
+
+    \param g
+    When maximization or minimization succeeds, will be assigned
+    a point or closure point where \p expr reaches the
+    corresponding extremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p g are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator& g) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p * this;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p point are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
+
+  /*! \brief
+    Adds to \p limiting_box the interval constraints in \p cs
+    that are satisfied by \p *this.
+  */
+  void get_limiting_box(const Constraint_System& cs,
+                        Box& limiting_box) const;
+
+  //! \name Exception Throwers
+  //@{
+  void throw_dimension_incompatible(const char* method,
+                                    const Box& y) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    dimension_type required_dim) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Constraint& c) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Congruence& cg) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Constraint_System& cs) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Congruence_System& cgs) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Generator& g) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
+
+  template <typename C>
+  void throw_dimension_incompatible(const char* method,
+                                    const char* lf_name,
+                                    const Linear_Form<C>& lf) const;
+
+  static void throw_constraint_incompatible(const char* method);
+
+  static void throw_expression_too_complex(const char* method,
+                                           const Linear_Expression& le);
+
+  static void throw_invalid_argument(const char* method, const char* reason);
+  //@} // Exception Throwers
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Returns the relations holding between an interval and
+  an interval constraint.
+
+  \param i
+  The interval;
+
+  \param constraint_type
+  The constraint type;
+
+  \param numer
+  The numerator of the constraint bound;
+
+  \param denom
+  The denominator of the constraint bound
+
+  The interval constraint has the form
+  <CODE>denom * Variable(0) relsym numer</CODE>
+  where relsym is  <CODE>==</CODE>,  <CODE>></CODE> or  <CODE>>=</CODE>
+  depending on the <CODE>constraint_type</CODE>.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename ITV>
+Poly_Con_Relation
+interval_relation(const ITV& i,
+                  const Constraint::Type constraint_type,
+                  Coefficient_traits::const_reference numer,
+                  Coefficient_traits::const_reference denom = 1);
+
+class Box_Helpers {
+public:
+  // This is declared here so that Linear_Expression needs to be friend of
+  // Box_Helpers only, and doesn't need to be friend of this, too.
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! Decodes the constraint \p c as an interval constraint.
+  /*! \relates Box
+    \return
+    <CODE>true</CODE> if the constraint \p c is an
+    \ref intervals "interval constraint";
+    <CODE>false</CODE> otherwise.
+
+    \param c
+    The constraint to be decoded.
+
+    \param c_num_vars
+    If <CODE>true</CODE> is returned, then it will be set to the number
+    of variables having a non-zero coefficient. The only legal values
+    will therefore be 0 and 1.
+
+    \param c_only_var
+    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
+    then it will be set to the index of the only variable having
+    a non-zero coefficient in \p c.
+  */
+  #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  static bool extract_interval_constraint(const Constraint& c,
+                                          dimension_type& c_num_vars,
+                                          dimension_type& c_only_var);
+
+  // This is declared here so that Linear_Expression needs to be friend of
+  // Box_Helpers only, and doesn't need to be friend of this, too.
+  static bool extract_interval_congruence(const Congruence& cg,
+                                          dimension_type& cg_num_vars,
+                                          dimension_type& cg_only_var);
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Box_Status_inlines.hh"
+#include "Box_inlines.hh"
+#include "Box_templates.hh"
+
+#endif // !defined(PPL_Box_defs_hh)
diff --git a/src/Box_inlines.hh b/src/Box_inlines.hh
new file mode 100644
index 0000000..84aa99a
--- /dev/null
+++ b/src/Box_inlines.hh
@@ -0,0 +1,692 @@
+/* Box class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Box_inlines_hh
+#define PPL_Box_inlines_hh 1
+
+#include "Boundary_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
+#include "distances_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename ITV>
+inline bool
+Box<ITV>::marked_empty() const {
+  return status.test_empty_up_to_date() && status.test_empty();
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::set_empty() {
+  status.set_empty();
+  status.set_empty_up_to_date();
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::set_nonempty() {
+  status.reset_empty();
+  status.set_empty_up_to_date();
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::set_empty_up_to_date() {
+  status.set_empty_up_to_date();
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::reset_empty_up_to_date() {
+  return status.reset_empty_up_to_date();
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Box(const Box& y, Complexity_Class)
+  : seq(y.seq), status(y.status) {
+}
+
+template <typename ITV>
+inline Box<ITV>&
+Box<ITV>::operator=(const Box& y) {
+  seq = y.seq;
+  status = y.status;
+  return *this;
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::m_swap(Box& y) {
+  Box& x = *this;
+  using std::swap;
+  swap(x.seq, y.seq);
+  swap(x.status, y.status);
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Box(const Constraint_System& cs, Recycle_Input) {
+  // Recycling is useless: just delegate.
+  Box<ITV> tmp(cs);
+  this->m_swap(tmp);
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Box(const Generator_System& gs, Recycle_Input) {
+  // Recycling is useless: just delegate.
+  Box<ITV> tmp(gs);
+  this->m_swap(tmp);
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Box(const Congruence_System& cgs, Recycle_Input) {
+  // Recycling is useless: just delegate.
+  Box<ITV> tmp(cgs);
+  this->m_swap(tmp);
+}
+
+template <typename ITV>
+inline memory_size_type
+Box<ITV>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename ITV>
+inline dimension_type
+Box<ITV>::space_dimension() const {
+  return seq.size();
+}
+
+template <typename ITV>
+inline dimension_type
+Box<ITV>::max_space_dimension() {
+  // One dimension is reserved to have a value of type dimension_type
+  // that does not represent a legal dimension.
+  return Sequence().max_size() - 1;
+}
+
+template <typename ITV>
+inline int32_t
+Box<ITV>::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+template <typename ITV>
+inline const ITV&
+Box<ITV>::operator[](const dimension_type k) const {
+  PPL_ASSERT(k < seq.size());
+  return seq[k];
+}
+
+template <typename ITV>
+inline const ITV&
+Box<ITV>::get_interval(const Variable var) const {
+  if (space_dimension() < var.space_dimension())
+    throw_dimension_incompatible("get_interval(v)", "v", var);
+
+  if (is_empty()) {
+    static ITV empty_interval(EMPTY);
+    return empty_interval;
+  }
+
+  return seq[var.id()];
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::set_interval(const Variable var, const ITV& i) {
+  const dimension_type space_dim = space_dimension();
+  if (space_dim < var.space_dimension())
+    throw_dimension_incompatible("set_interval(v, i)", "v", var);
+
+  if (is_empty() && space_dim >= 2)
+    // If the box is empty, and has dimension >= 2, setting only one
+    // interval will not make it non-empty.
+    return;
+
+  seq[var.id()] = i;
+  reset_empty_up_to_date();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::is_empty() const {
+  return marked_empty() || check_empty();
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::bounds_from_above(const Linear_Expression& expr) const {
+  return bounds(expr, true);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::bounds_from_below(const Linear_Expression& expr) const {
+  return bounds(expr, false);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::maximize(const Linear_Expression& expr,
+                   Coefficient& sup_n, Coefficient& sup_d,
+                   bool& maximum) const {
+  return max_min(expr, true, sup_n, sup_d, maximum);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::maximize(const Linear_Expression& expr,
+                   Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                   Generator& g) const {
+  return max_min(expr, true, sup_n, sup_d, maximum, g);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::minimize(const Linear_Expression& expr,
+                   Coefficient& inf_n, Coefficient& inf_d,
+                   bool& minimum) const {
+  return max_min(expr, false, inf_n, inf_d, minimum);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::minimize(const Linear_Expression& expr,
+                   Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                   Generator& g) const {
+  return max_min(expr, false, inf_n, inf_d, minimum, g);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::strictly_contains(const Box& y) const {
+  const Box& x = *this;
+  return x.contains(y) && !y.contains(x);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::expand_space_dimension(const Variable var,
+                                 const dimension_type m) {
+  const dimension_type space_dim = space_dimension();
+  // `var' should be one of the dimensions of the vector space.
+  if (var.space_dimension() > space_dim)
+    throw_dimension_incompatible("expand_space_dimension(v, m)", "v", var);
+
+  // The space dimension of the resulting Box should not
+  // overflow the maximum allowed space dimension.
+  if (m > max_space_dimension() - space_dim)
+    throw_invalid_argument("expand_dimension(v, m)",
+                           "adding m new space dimensions exceeds "
+                           "the maximum allowed space dimension");
+
+  // To expand the space dimension corresponding to variable `var',
+  // we append to the box `m' copies of the corresponding interval.
+  seq.insert(seq.end(), m, seq[var.id()]);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+inline bool
+operator!=(const Box<ITV>& x, const Box<ITV>& y) {
+  return !(x == y);
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::has_lower_bound(const Variable var,
+                          Coefficient& n, Coefficient& d, bool& closed) const {
+  // NOTE: assertion !is_empty() would be wrong;
+  // see the calls in method Box<ITV>::constraints().
+  PPL_ASSERT(!marked_empty());
+  const dimension_type k = var.id();
+  PPL_ASSERT(k < seq.size());
+  const ITV& seq_k = seq[k];
+
+  if (seq_k.lower_is_boundary_infinity())
+    return false;
+
+  closed = !seq_k.lower_is_open();
+
+  PPL_DIRTY_TEMP(mpq_class, lr);
+  assign_r(lr, seq_k.lower(), ROUND_NOT_NEEDED);
+  n = lr.get_num();
+  d = lr.get_den();
+
+  return true;
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::has_upper_bound(const Variable var,
+                          Coefficient& n, Coefficient& d, bool& closed) const {
+  // NOTE: assertion !is_empty() would be wrong;
+  // see the calls in method Box<ITV>::constraints().
+  PPL_ASSERT(!marked_empty());
+  const dimension_type k = var.id();
+  PPL_ASSERT(k < seq.size());
+  const ITV& seq_k = seq[k];
+
+  if (seq_k.upper_is_boundary_infinity())
+    return false;
+
+  closed = !seq_k.upper_is_open();
+
+  PPL_DIRTY_TEMP(mpq_class, ur);
+  assign_r(ur, seq_k.upper(), ROUND_NOT_NEEDED);
+  n = ur.get_num();
+  d = ur.get_den();
+
+  return true;
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::add_constraint(const Constraint& c) {
+  const dimension_type c_space_dim = c.space_dimension();
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dimension())
+    throw_dimension_incompatible("add_constraint(c)", c);
+
+  add_constraint_no_check(c);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::add_constraints(const Constraint_System& cs) {
+  // Dimension-compatibility check.
+  if (cs.space_dimension() > space_dimension())
+    throw_dimension_incompatible("add_constraints(cs)", cs);
+
+  add_constraints_no_check(cs);
+}
+
+template <typename T>
+inline void
+Box<T>::add_recycled_constraints(Constraint_System& cs) {
+  add_constraints(cs);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::add_congruence(const Congruence& cg) {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  // Dimension-compatibility check.
+  if (cg_space_dim > space_dimension())
+    throw_dimension_incompatible("add_congruence(cg)", cg);
+
+  add_congruence_no_check(cg);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::add_congruences(const Congruence_System& cgs) {
+  if (cgs.space_dimension() > space_dimension())
+    throw_dimension_incompatible("add_congruences(cgs)", cgs);
+  add_congruences_no_check(cgs);
+}
+
+template <typename T>
+inline void
+Box<T>::add_recycled_congruences(Congruence_System& cgs) {
+  add_congruences(cgs);
+}
+
+template <typename T>
+inline bool
+Box<T>::can_recycle_constraint_systems() {
+  return false;
+}
+
+template <typename T>
+inline bool
+Box<T>::can_recycle_congruence_systems() {
+  return false;
+}
+
+template <typename T>
+inline void
+Box<T>::widening_assign(const Box& y, unsigned* tp) {
+  CC76_widening_assign(y, tp);
+}
+
+template <typename ITV>
+inline Congruence_System
+Box<ITV>::minimized_congruences() const {
+  // Only equalities can be congruences and these are already minimized.
+  return congruences();
+}
+
+template <typename ITV>
+inline I_Result
+Box<ITV>
+::refine_interval_no_check(ITV& itv,
+                           const Constraint::Type type,
+                           Coefficient_traits::const_reference numer,
+                           Coefficient_traits::const_reference denom) {
+  PPL_ASSERT(denom != 0);
+  // The interval constraint is of the form
+  // `var + numer / denom rel 0',
+  // where `rel' is either the relation `==', `>=', or `>'.
+  // For the purpose of refining the interval, this is
+  // (morally) turned into `var rel -numer/denom'.
+  PPL_DIRTY_TEMP(mpq_class, q);
+  assign_r(q.get_num(), numer, ROUND_NOT_NEEDED);
+  assign_r(q.get_den(), denom, ROUND_NOT_NEEDED);
+  q.canonicalize();
+  // Turn `numer/denom' into `-numer/denom'.
+  q = -q;
+
+  Relation_Symbol rel_sym;
+  switch (type) {
+  case Constraint::EQUALITY:
+    rel_sym = EQUAL;
+    break;
+  case Constraint::NONSTRICT_INEQUALITY:
+    rel_sym = (denom > 0) ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
+    break;
+  case Constraint::STRICT_INEQUALITY:
+    rel_sym = (denom > 0) ? GREATER_THAN : LESS_THAN;
+    break;
+  default:
+    // Silence compiler warning.
+    PPL_UNREACHABLE;
+    return I_ANY;
+  }
+  I_Result res = itv.add_constraint(i_constraint(rel_sym, q));
+  PPL_ASSERT(itv.OK());
+  return res;
+}
+
+template <typename ITV>
+inline void
+Box<ITV>
+::add_interval_constraint_no_check(const dimension_type var_id,
+                                   const Constraint::Type type,
+                                   Coefficient_traits::const_reference numer,
+                                   Coefficient_traits::const_reference denom) {
+  PPL_ASSERT(!marked_empty());
+  PPL_ASSERT(var_id < space_dimension());
+  PPL_ASSERT(denom != 0);
+  refine_interval_no_check(seq[var_id], type, numer, denom);
+  // FIXME: do check the value returned and set `empty' and
+  // `empty_up_to_date' as appropriate.
+  // This has to be done after reimplementation of intervals.
+  reset_empty_up_to_date();
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::refine_with_constraint(const Constraint& c) {
+  const dimension_type c_space_dim = c.space_dimension();
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dimension())
+    throw_dimension_incompatible("refine_with_constraint(c)", c);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  refine_no_check(c);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::refine_with_constraints(const Constraint_System& cs) {
+  // Dimension-compatibility check.
+  if (cs.space_dimension() > space_dimension())
+    throw_dimension_incompatible("refine_with_constraints(cs)", cs);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  refine_no_check(cs);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::refine_with_congruence(const Congruence& cg) {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  // Dimension-compatibility check.
+  if (cg_space_dim > space_dimension())
+    throw_dimension_incompatible("refine_with_congruence(cg)", cg);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  refine_no_check(cg);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::refine_with_congruences(const Congruence_System& cgs) {
+  // Dimension-compatibility check.
+  if (cgs.space_dimension() > space_dimension())
+    throw_dimension_incompatible("refine_with_congruences(cgs)", cgs);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  refine_no_check(cgs);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::propagate_constraint(const Constraint& c) {
+  const dimension_type c_space_dim = c.space_dimension();
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dimension())
+    throw_dimension_incompatible("propagate_constraint(c)", c);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  propagate_constraint_no_check(c);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::propagate_constraints(const Constraint_System& cs,
+                                const dimension_type max_iterations) {
+  // Dimension-compatibility check.
+  if (cs.space_dimension() > space_dimension())
+    throw_dimension_incompatible("propagate_constraints(cs)", cs);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  propagate_constraints_no_check(cs, max_iterations);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::unconstrain(const Variable var) {
+  const dimension_type var_id = var.id();
+  // Dimension-compatibility check.
+  if (space_dimension() < var_id + 1)
+    throw_dimension_incompatible("unconstrain(var)", var_id + 1);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  // Here the box might still be empty (but we haven't detected it yet):
+  // check emptiness of the interval for `var' before cylindrification.
+  ITV& seq_var = seq[var_id];
+  if (seq_var.is_empty())
+    set_empty();
+  else
+    seq_var.assign(UNIVERSE);
+
+  PPL_ASSERT(OK());
+}
+
+/*! \relates Box */
+template <typename Temp, typename To, typename ITV>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
+  return l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >
+    (r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Box */
+template <typename Temp, typename To, typename ITV>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Box */
+template <typename To, typename ITV>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            const Rounding_Dir dir) {
+  // FIXME: the following qualification is only to work around a bug
+  // in the Intel C/C++ compiler version 10.1.x.
+  return Parma_Polyhedra_Library
+    ::rectilinear_distance_assign<To, To, ITV>(r, x, y, dir);
+}
+
+/*! \relates Box */
+template <typename Temp, typename To, typename ITV>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
+  return l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >
+    (r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Box */
+template <typename Temp, typename To, typename ITV>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Box */
+template <typename To, typename ITV>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          const Rounding_Dir dir) {
+  // FIXME: the following qualification is only to work around a bug
+  // in the Intel C/C++ compiler version 10.1.x.
+  return Parma_Polyhedra_Library
+    ::euclidean_distance_assign<To, To, ITV>(r, x, y, dir);
+}
+
+/*! \relates Box */
+template <typename Temp, typename To, typename ITV>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
+  return l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >
+    (r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Box */
+template <typename Temp, typename To, typename ITV>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Box */
+template <typename To, typename ITV>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           const Rounding_Dir dir) {
+  // FIXME: the following qualification is only to work around a bug
+  // in the Intel C/C++ compiler version 10.1.x.
+  return Parma_Polyhedra_Library
+    ::l_infinity_distance_assign<To, To, ITV>(r, x, y, dir);
+}
+
+/*! \relates Box */
+template <typename ITV>
+inline void
+swap(Box<ITV>& x, Box<ITV>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Box_inlines_hh)
diff --git a/src/Box_templates.hh b/src/Box_templates.hh
new file mode 100644
index 0000000..227dd65
--- /dev/null
+++ b/src/Box_templates.hh
@@ -0,0 +1,4295 @@
+/* Box class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Box_templates_hh
+#define PPL_Box_templates_hh 1
+
+#include "Variables_Set_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Generator_System_defs.hh"
+#include "Generator_System_inlines.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "Polyhedron_defs.hh"
+#include "Grid_defs.hh"
+#include "Interval_defs.hh"
+#include "Linear_Form_defs.hh"
+#include "BD_Shape_defs.hh"
+#include "Octagonal_Shape_defs.hh"
+#include "MIP_Problem_defs.hh"
+#include "Rational_Interval.hh"
+#include <vector>
+#include <map>
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename ITV>
+inline
+Box<ITV>::Box(dimension_type num_dimensions, Degenerate_Element kind)
+  : seq(check_space_dimension_overflow(num_dimensions,
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(n, k)",
+                                       "n exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  // In a box that is marked empty the intervals are completely
+  // meaningless: we exploit this by avoiding their initialization.
+  if (kind == UNIVERSE) {
+    for (dimension_type i = num_dimensions; i-- > 0; )
+      seq[i].assign(UNIVERSE);
+    set_empty_up_to_date();
+  }
+  else
+    set_empty();
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Box(const Constraint_System& cs)
+  : seq(check_space_dimension_overflow(cs.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(cs)",
+                                       "cs exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  // FIXME: check whether we can avoid the double initialization.
+  for (dimension_type i = cs.space_dimension(); i-- > 0; )
+    seq[i].assign(UNIVERSE);
+  add_constraints_no_check(cs);
+}
+
+template <typename ITV>
+inline
+Box<ITV>::Box(const Congruence_System& cgs)
+  : seq(check_space_dimension_overflow(cgs.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(cgs)",
+                                       "cgs exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  // FIXME: check whether we can avoid the double initialization.
+  for (dimension_type i = cgs.space_dimension(); i-- > 0; )
+    seq[i].assign(UNIVERSE);
+  add_congruences_no_check(cgs);
+}
+
+template <typename ITV>
+template <typename Other_ITV>
+inline
+Box<ITV>::Box(const Box<Other_ITV>& y, Complexity_Class)
+  : seq(y.space_dimension()),
+    // FIXME: why the following does not work?
+    // status(y.status) {
+    status() {
+  // FIXME: remove when the above is fixed.
+  if (y.marked_empty())
+    set_empty();
+
+  if (!y.marked_empty())
+    for (dimension_type k = y.space_dimension(); k-- > 0; )
+      seq[k].assign(y.seq[k]);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+Box<ITV>::Box(const Generator_System& gs)
+  : seq(check_space_dimension_overflow(gs.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(gs)",
+                                       "gs exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  const Generator_System::const_iterator gs_begin = gs.begin();
+  const Generator_System::const_iterator gs_end = gs.end();
+  if (gs_begin == gs_end) {
+    // An empty generator system defines the empty box.
+    set_empty();
+    return;
+  }
+
+  // The empty flag will be meaningful, whatever happens from now on.
+  set_empty_up_to_date();
+
+  const dimension_type space_dim = space_dimension();
+  PPL_DIRTY_TEMP(mpq_class, q);
+  bool point_seen = false;
+  // Going through all the points.
+  for (Generator_System::const_iterator
+         gs_i = gs_begin; gs_i != gs_end; ++gs_i) {
+    const Generator& g = *gs_i;
+    if (g.is_point()) {
+      const Coefficient& d = g.divisor();
+      if (point_seen) {
+        // This is not the first point: `seq' already contains valid values.
+        // TODO: If the variables in the expression that have coefficient 0
+        // have no effect on seq[i], this loop can be optimized using
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i-- > 0; ) {
+          assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+          assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
+          q.canonicalize();
+          PPL_DIRTY_TEMP(ITV, iq);
+          iq.build(i_constraint(EQUAL, q));
+          seq[i].join_assign(iq);
+        }
+      }
+      else {
+        // This is the first point seen: initialize `seq'.
+        point_seen = true;
+        // TODO: If the variables in the expression that have coefficient 0
+        // have no effect on seq[i], this loop can be optimized using
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i-- > 0; ) {
+          assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+          assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
+          q.canonicalize();
+          seq[i].build(i_constraint(EQUAL, q));
+        }
+      }
+    }
+  }
+
+  if (!point_seen)
+    // The generator system is not empty, but contains no points.
+    throw std::invalid_argument("PPL::Box<ITV>::Box(gs):\n"
+                                "the non-empty generator system gs "
+                                "contains no points.");
+
+  // Going through all the lines, rays and closure points.
+  for (Generator_System::const_iterator gs_i = gs_begin;
+       gs_i != gs_end; ++gs_i) {
+    const Generator& g = *gs_i;
+    switch (g.type()) {
+    case Generator::LINE:
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
+              i_end = g.expression().end();
+              i != i_end; ++i)
+          seq[i.variable().id()].assign(UNIVERSE);
+      break;
+    case Generator::RAY:
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
+              i_end = g.expression().end();
+              i != i_end; ++i)
+        switch (sgn(*i)) {
+        case 1:
+          seq[i.variable().id()].upper_extend();
+          break;
+        case -1:
+          seq[i.variable().id()].lower_extend();
+          break;
+        default:
+          PPL_UNREACHABLE;
+          break;
+        }
+      break;
+    case Generator::CLOSURE_POINT:
+      {
+        const Coefficient& d = g.divisor();
+        // TODO: If the variables in the expression that have coefficient 0
+        // have no effect on seq[i], this loop can be optimized using
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i-- > 0; ) {
+          assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+          assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
+          q.canonicalize();
+          ITV& seq_i = seq[i];
+          seq_i.lower_extend(i_constraint(GREATER_THAN, q));
+          seq_i.upper_extend(i_constraint(LESS_THAN, q));
+        }
+      }
+      break;
+    default:
+      // Points already dealt with.
+      break;
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+template <typename T>
+Box<ITV>::Box(const BD_Shape<T>& bds, Complexity_Class)
+  : seq(check_space_dimension_overflow(bds.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(bds)",
+                                       "bds exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  // Expose all the interval constraints.
+  bds.shortest_path_closure_assign();
+  if (bds.marked_empty()) {
+    set_empty();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // The empty flag will be meaningful, whatever happens from now on.
+  set_empty_up_to_date();
+
+  const dimension_type space_dim = space_dimension();
+  if (space_dim == 0) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  typedef typename BD_Shape<T>::coefficient_type Coeff;
+  PPL_DIRTY_TEMP(Coeff, tmp);
+  const DB_Row<Coeff>& dbm_0 = bds.dbm[0];
+  for (dimension_type i = space_dim; i-- > 0; ) {
+    I_Constraint<Coeff> lower;
+    I_Constraint<Coeff> upper;
+    ITV& seq_i = seq[i];
+
+    // Set the upper bound.
+    const Coeff& u = dbm_0[i+1];
+    if (!is_plus_infinity(u))
+      upper.set(LESS_OR_EQUAL, u, true);
+
+    // Set the lower bound.
+    const Coeff& negated_l = bds.dbm[i+1][0];
+    if (!is_plus_infinity(negated_l)) {
+      neg_assign_r(tmp, negated_l, ROUND_DOWN);
+      lower.set(GREATER_OR_EQUAL, tmp);
+    }
+
+    seq_i.build(lower, upper);
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+template <typename T>
+Box<ITV>::Box(const Octagonal_Shape<T>& oct, Complexity_Class)
+  : seq(check_space_dimension_overflow(oct.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(oct)",
+                                       "oct exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  // Expose all the interval constraints.
+  oct.strong_closure_assign();
+  if (oct.marked_empty()) {
+    set_empty();
+    return;
+  }
+
+  // The empty flag will be meaningful, whatever happens from now on.
+  set_empty_up_to_date();
+
+  const dimension_type space_dim = space_dimension();
+  if (space_dim == 0)
+    return;
+
+  PPL_DIRTY_TEMP(mpq_class, lower_bound);
+  PPL_DIRTY_TEMP(mpq_class, upper_bound);
+  for (dimension_type i = space_dim; i-- > 0; ) {
+    typedef typename Octagonal_Shape<T>::coefficient_type Coeff;
+    I_Constraint<mpq_class> lower;
+    I_Constraint<mpq_class> upper;
+    ITV& seq_i = seq[i];
+    const dimension_type ii = 2*i;
+    const dimension_type cii = ii + 1;
+
+    // Set the upper bound.
+    const Coeff& twice_ub = oct.matrix[cii][ii];
+    if (!is_plus_infinity(twice_ub)) {
+      assign_r(upper_bound, twice_ub, ROUND_NOT_NEEDED);
+      div_2exp_assign_r(upper_bound, upper_bound, 1, ROUND_NOT_NEEDED);
+      upper.set(LESS_OR_EQUAL, upper_bound);
+    }
+
+    // Set the lower bound.
+    const Coeff& twice_lb = oct.matrix[ii][cii];
+    if (!is_plus_infinity(twice_lb)) {
+      assign_r(lower_bound, twice_lb, ROUND_NOT_NEEDED);
+      neg_assign_r(lower_bound, lower_bound, ROUND_NOT_NEEDED);
+      div_2exp_assign_r(lower_bound, lower_bound, 1, ROUND_NOT_NEEDED);
+      lower.set(GREATER_OR_EQUAL, lower_bound);
+    }
+    seq_i.build(lower, upper);
+  }
+}
+
+template <typename ITV>
+Box<ITV>::Box(const Polyhedron& ph, Complexity_Class complexity)
+  : seq(check_space_dimension_overflow(ph.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(ph)",
+                                       "ph exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+  // The empty flag will be meaningful, whatever happens from now on.
+  set_empty_up_to_date();
+
+  // We do not need to bother about `complexity' if:
+  // a) the polyhedron is already marked empty; or ...
+  if (ph.marked_empty()) {
+    set_empty();
+    return;
+  }
+
+  // b) the polyhedron is zero-dimensional; or ...
+  const dimension_type space_dim = ph.space_dimension();
+  if (space_dim == 0)
+    return;
+
+  // c) the polyhedron is already described by a generator system.
+  if (ph.generators_are_up_to_date() && !ph.has_pending_constraints()) {
+    Box tmp(ph.generators());
+    m_swap(tmp);
+    return;
+  }
+
+  // Here generators are not up-to-date or there are pending constraints.
+  PPL_ASSERT(ph.constraints_are_up_to_date());
+
+  if (complexity == POLYNOMIAL_COMPLEXITY) {
+    // FIXME: is there a way to avoid this initialization?
+    for (dimension_type i = space_dim; i-- > 0; )
+      seq[i].assign(UNIVERSE);
+    // Get a simplified version of the constraints.
+    const Constraint_System cs = ph.simplified_constraints();
+    // Propagate easy-to-find bounds from the constraints,
+    // allowing for a limited number of iterations.
+    // FIXME: 20 is just a wild guess.
+    const dimension_type max_iterations = 20;
+    propagate_constraints_no_check(cs, max_iterations);
+  }
+  else if (complexity == SIMPLEX_COMPLEXITY) {
+    MIP_Problem lp(space_dim);
+    const Constraint_System& ph_cs = ph.constraints();
+    if (!ph_cs.has_strict_inequalities())
+      lp.add_constraints(ph_cs);
+    else
+      // Adding to `lp' a topologically closed version of `ph_cs'.
+      for (Constraint_System::const_iterator i = ph_cs.begin(),
+             ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
+        const Constraint& c = *i;
+        if (c.is_strict_inequality()) {
+          const Linear_Expression expr(c.expression());
+          lp.add_constraint(expr >= 0);
+        }
+        else
+          lp.add_constraint(c);
+      }
+    // Check for unsatisfiability.
+    if (!lp.is_satisfiable()) {
+      set_empty();
+      return;
+    }
+    // Get all the bounds for the space dimensions.
+    Generator g(point());
+    PPL_DIRTY_TEMP(mpq_class, lower_bound);
+    PPL_DIRTY_TEMP(mpq_class, upper_bound);
+    PPL_DIRTY_TEMP(Coefficient, bound_numer);
+    PPL_DIRTY_TEMP(Coefficient, bound_denom);
+    for (dimension_type i = space_dim; i-- > 0; ) {
+      I_Constraint<mpq_class> lower;
+      I_Constraint<mpq_class> upper;
+      ITV& seq_i = seq[i];
+      lp.set_objective_function(Variable(i));
+      // Evaluate upper bound.
+      lp.set_optimization_mode(MAXIMIZATION);
+      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, bound_numer, bound_denom);
+        assign_r(upper_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
+        assign_r(upper_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
+        PPL_ASSERT(is_canonical(upper_bound));
+        upper.set(LESS_OR_EQUAL, upper_bound);
+      }
+      // Evaluate optimal lower bound.
+      lp.set_optimization_mode(MINIMIZATION);
+      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, bound_numer, bound_denom);
+        assign_r(lower_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
+        assign_r(lower_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
+        PPL_ASSERT(is_canonical(lower_bound));
+        lower.set(GREATER_OR_EQUAL, lower_bound);
+      }
+      seq_i.build(lower, upper);
+    }
+  }
+  else {
+    PPL_ASSERT(complexity == ANY_COMPLEXITY);
+    if (ph.is_empty())
+      set_empty();
+    else {
+      Box tmp(ph.generators());
+      m_swap(tmp);
+    }
+  }
+}
+
+template <typename ITV>
+Box<ITV>::Box(const Grid& gr, Complexity_Class)
+  : seq(check_space_dimension_overflow(gr.space_dimension(),
+                                       max_space_dimension(),
+                                       "PPL::Box::",
+                                       "Box(gr)",
+                                       "gr exceeds the maximum "
+                                       "allowed space dimension")),
+    status() {
+
+  if (gr.marked_empty()) {
+    set_empty();
+    return;
+  }
+
+  // The empty flag will be meaningful, whatever happens from now on.
+  set_empty_up_to_date();
+
+  const dimension_type space_dim = gr.space_dimension();
+
+  if (space_dim == 0)
+    return;
+
+  if (!gr.generators_are_up_to_date() && !gr.update_generators()) {
+    // Updating found the grid empty.
+    set_empty();
+    return;
+  }
+
+  PPL_ASSERT(!gr.gen_sys.empty());
+
+  // For each dimension that is bounded by the grid, set both bounds
+  // of the interval to the value of the associated coefficient in a
+  // generator point.
+  PPL_DIRTY_TEMP(mpq_class, bound);
+  PPL_DIRTY_TEMP(Coefficient, bound_numer);
+  PPL_DIRTY_TEMP(Coefficient, bound_denom);
+  for (dimension_type i = space_dim; i-- > 0; ) {
+    ITV& seq_i = seq[i];
+    Variable var(i);
+    bool max;
+    if (gr.maximize(var, bound_numer, bound_denom, max)) {
+      assign_r(bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
+      assign_r(bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
+      bound.canonicalize();
+      seq_i.build(i_constraint(EQUAL, bound));
+    }
+    else
+      seq_i.assign(UNIVERSE);
+  }
+}
+
+template <typename ITV>
+template <typename D1, typename D2, typename R>
+Box<ITV>::Box(const Partially_Reduced_Product<D1, D2, R>& dp,
+              Complexity_Class complexity)
+  : seq(), status() {
+  check_space_dimension_overflow(dp.space_dimension(),
+                                 max_space_dimension(),
+                                 "PPL::Box::",
+                                 "Box(dp)",
+                                 "dp exceeds the maximum "
+                                 "allowed space dimension");
+  Box tmp1(dp.domain1(), complexity);
+  Box tmp2(dp.domain2(), complexity);
+  tmp1.intersection_assign(tmp2);
+  m_swap(tmp1);
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::add_space_dimensions_and_embed(const dimension_type m) {
+  // Adding no dimensions is a no-op.
+  if (m == 0)
+    return;
+  check_space_dimension_overflow(m, max_space_dimension() - space_dimension(),
+                                 "PPL::Box::",
+                                 "add_space_dimensions_and_embed(m)",
+                                 "adding m new space dimensions exceeds "
+                                 "the maximum allowed space dimension");
+  // To embed an n-dimension space box in a (n+m)-dimension space,
+  // we just add `m' new universe elements to the sequence.
+  seq.insert(seq.end(), m, ITV(UNIVERSE));
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::add_space_dimensions_and_project(const dimension_type m) {
+  // Adding no dimensions is a no-op.
+  if (m == 0)
+    return;
+  check_space_dimension_overflow(m, max_space_dimension() - space_dimension(),
+                                 "PPL::Box::",
+                                 "add_space_dimensions_and_project(m)",
+                                 "adding m new space dimensions exceeds "
+                                 "the maximum allowed space dimension");
+  // Add `m' new zero elements to the sequence.
+  seq.insert(seq.end(), m, ITV(0));
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+bool
+operator==(const Box<ITV>& x, const Box<ITV>& y) {
+  const dimension_type x_space_dim = x.space_dimension();
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  if (x.is_empty())
+    return y.is_empty();
+
+  if (y.is_empty())
+    return x.is_empty();
+
+  for (dimension_type k = x_space_dim; k-- > 0; )
+    if (x.seq[k] != y.seq[k])
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::bounds(const Linear_Expression& expr, const bool from_above) const {
+  // `expr' should be dimension-compatible with `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  const dimension_type space_dim = space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((from_above
+                                  ? "bounds_from_above(e)"
+                                  : "bounds_from_below(e)"), "e", expr);
+  // A zero-dimensional or empty Box bounds everything.
+  if (space_dim == 0 || is_empty())
+    return true;
+
+  const int from_above_sign = from_above ? 1 : -1;
+  // TODO: This loop can be optimized more, if needed, exploiting the
+  // (possible) sparseness of expr.
+  for (Linear_Expression::const_iterator i = expr.begin(),
+          i_end = expr.end(); i != i_end; ++i) {
+    const Variable v = i.variable();
+    switch (sgn(*i) * from_above_sign) {
+    case 1:
+      if (seq[v.id()].upper_is_boundary_infinity())
+        return false;
+      break;
+    case 0:
+      PPL_UNREACHABLE;
+      break;
+    case -1:
+      if (seq[v.id()].lower_is_boundary_infinity())
+        return false;
+      break;
+    }
+  }
+  return true;
+}
+
+template <typename ITV>
+Poly_Con_Relation
+interval_relation(const ITV& i,
+                  const Constraint::Type constraint_type,
+                  Coefficient_traits::const_reference numer,
+                  Coefficient_traits::const_reference denom) {
+
+  if (i.is_universe())
+    return Poly_Con_Relation::strictly_intersects();
+
+  PPL_DIRTY_TEMP(mpq_class, bound);
+  assign_r(bound.get_num(), numer, ROUND_NOT_NEEDED);
+  assign_r(bound.get_den(), denom, ROUND_NOT_NEEDED);
+  bound.canonicalize();
+  neg_assign_r(bound, bound, ROUND_NOT_NEEDED);
+  const bool is_lower_bound = (denom > 0);
+
+  PPL_DIRTY_TEMP(mpq_class, bound_diff);
+  if (constraint_type == Constraint::EQUALITY) {
+    if (i.lower_is_boundary_infinity()) {
+      PPL_ASSERT(!i.upper_is_boundary_infinity());
+      assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+      switch (sgn(bound_diff)) {
+      case 1:
+        return Poly_Con_Relation::strictly_intersects();
+      case 0:
+        return i.upper_is_open()
+          ? Poly_Con_Relation::is_disjoint()
+          : Poly_Con_Relation::strictly_intersects();
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      }
+    }
+    else {
+      assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
+      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+      switch (sgn(bound_diff)) {
+      case 1:
+        return Poly_Con_Relation::is_disjoint();
+      case 0:
+        if (i.lower_is_open())
+          return Poly_Con_Relation::is_disjoint();
+        if (i.is_singleton())
+          return Poly_Con_Relation::is_included()
+            && Poly_Con_Relation::saturates();
+        return Poly_Con_Relation::strictly_intersects();
+      case -1:
+        if (i.upper_is_boundary_infinity())
+          return Poly_Con_Relation::strictly_intersects();
+        else {
+          assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+          sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+          switch (sgn(bound_diff)) {
+          case 1:
+            return Poly_Con_Relation::strictly_intersects();
+          case 0:
+            if (i.upper_is_open())
+              return Poly_Con_Relation::is_disjoint();
+            else
+              return Poly_Con_Relation::strictly_intersects();
+          case -1:
+            return Poly_Con_Relation::is_disjoint();
+          }
+        }
+      }
+    }
+  }
+
+  PPL_ASSERT(constraint_type != Constraint::EQUALITY);
+  if (is_lower_bound) {
+    if (i.lower_is_boundary_infinity()) {
+      PPL_ASSERT(!i.upper_is_boundary_infinity());
+      assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+      switch (sgn(bound_diff)) {
+      case 1:
+        return Poly_Con_Relation::strictly_intersects();
+      case 0:
+        if (constraint_type == Constraint::STRICT_INEQUALITY
+            || i.upper_is_open())
+          return Poly_Con_Relation::is_disjoint();
+        else
+          return Poly_Con_Relation::strictly_intersects();
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      }
+    }
+    else {
+      assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
+      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+      switch (sgn(bound_diff)) {
+      case 1:
+        return Poly_Con_Relation::is_included();
+      case 0:
+        if (constraint_type == Constraint::NONSTRICT_INEQUALITY
+            || i.lower_is_open()) {
+          Poly_Con_Relation result = Poly_Con_Relation::is_included();
+          if (i.is_singleton())
+            result = result && Poly_Con_Relation::saturates();
+          return result;
+        }
+        else {
+          PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
+                 && !i.lower_is_open());
+          if (i.is_singleton())
+            return Poly_Con_Relation::is_disjoint()
+              && Poly_Con_Relation::saturates();
+          else
+            return Poly_Con_Relation::strictly_intersects();
+        }
+      case -1:
+        if (i.upper_is_boundary_infinity())
+          return Poly_Con_Relation::strictly_intersects();
+        else {
+          assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+          sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+          switch (sgn(bound_diff)) {
+          case 1:
+            return Poly_Con_Relation::strictly_intersects();
+          case 0:
+            if (constraint_type == Constraint::STRICT_INEQUALITY
+                || i.upper_is_open())
+              return Poly_Con_Relation::is_disjoint();
+            else
+              return Poly_Con_Relation::strictly_intersects();
+          case -1:
+            return Poly_Con_Relation::is_disjoint();
+          }
+        }
+      }
+    }
+  }
+  else {
+    // `c' is an upper bound.
+    if (i.upper_is_boundary_infinity())
+      return Poly_Con_Relation::strictly_intersects();
+    else {
+      assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+      sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+      switch (sgn(bound_diff)) {
+      case -1:
+        return Poly_Con_Relation::is_included();
+      case 0:
+        if (constraint_type == Constraint::NONSTRICT_INEQUALITY
+            || i.upper_is_open()) {
+          Poly_Con_Relation result = Poly_Con_Relation::is_included();
+          if (i.is_singleton())
+            result = result && Poly_Con_Relation::saturates();
+          return result;
+        }
+        else {
+          PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
+                 && !i.upper_is_open());
+          if (i.is_singleton())
+            return Poly_Con_Relation::is_disjoint()
+              && Poly_Con_Relation::saturates();
+          else
+            return Poly_Con_Relation::strictly_intersects();
+        }
+      case 1:
+        if (i.lower_is_boundary_infinity())
+          return Poly_Con_Relation::strictly_intersects();
+        else {
+          assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
+          sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+          switch (sgn(bound_diff)) {
+          case -1:
+            return Poly_Con_Relation::strictly_intersects();
+          case 0:
+            if (constraint_type == Constraint::STRICT_INEQUALITY
+                || i.lower_is_open())
+              return Poly_Con_Relation::is_disjoint();
+            else
+              return Poly_Con_Relation::strictly_intersects();
+          case 1:
+            return Poly_Con_Relation::is_disjoint();
+          }
+        }
+      }
+    }
+  }
+
+  // Quiet a compiler warning: this program point is unreachable.
+  PPL_UNREACHABLE;
+  return Poly_Con_Relation::nothing();
+}
+
+template <typename ITV>
+Poly_Con_Relation
+Box<ITV>::relation_with(const Congruence& cg) const {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (cg_space_dim > space_dim)
+    throw_dimension_incompatible("relation_with(cg)", cg);
+
+  if (is_empty())
+    return Poly_Con_Relation::saturates()
+      && Poly_Con_Relation::is_included()
+      && Poly_Con_Relation::is_disjoint();
+
+  if (space_dim == 0) {
+    if (cg.is_inconsistent())
+      return Poly_Con_Relation::is_disjoint();
+    else
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_included();
+  }
+
+  if (cg.is_equality()) {
+    const Constraint c(cg);
+    return relation_with(c);
+  }
+
+  PPL_DIRTY_TEMP(Rational_Interval, r);
+  PPL_DIRTY_TEMP(Rational_Interval, t);
+  PPL_DIRTY_TEMP(mpq_class, m);
+  r = 0;
+  for (Congruence::expr_type::const_iterator i = cg.expression().begin(),
+      i_end = cg.expression().end(); i != i_end; ++i) {
+    const Coefficient& cg_i = *i;
+    const Variable v = i.variable();
+    assign_r(m, cg_i, ROUND_NOT_NEEDED);
+    // FIXME: an add_mul_assign() method would come handy here.
+    t.build(seq[v.id()].lower_constraint(), seq[v.id()].upper_constraint());
+    t *= m;
+    r += t;
+  }
+
+  if (r.lower_is_boundary_infinity() || r.upper_is_boundary_infinity())
+    return Poly_Con_Relation::strictly_intersects();
+
+
+  // Find the value that satisfies the congruence and is
+  // nearest to the lower bound such that the point lies on or above it.
+
+  PPL_DIRTY_TEMP_COEFFICIENT(lower);
+  PPL_DIRTY_TEMP_COEFFICIENT(mod);
+  PPL_DIRTY_TEMP_COEFFICIENT(v);
+  mod = cg.modulus();
+  v = cg.inhomogeneous_term() % mod;
+  assign_r(lower, r.lower(), ROUND_DOWN);
+  v -= ((lower / mod) * mod);
+  if (v + lower > 0)
+    v -= mod;
+  return interval_relation(r, Constraint::EQUALITY, v);
+}
+
+template <typename ITV>
+Poly_Con_Relation
+Box<ITV>::relation_with(const Constraint& c) const {
+  const dimension_type c_space_dim = c.space_dimension();
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dim)
+    throw_dimension_incompatible("relation_with(c)", c);
+
+  if (is_empty())
+    return Poly_Con_Relation::saturates()
+      && Poly_Con_Relation::is_included()
+      && Poly_Con_Relation::is_disjoint();
+
+  if (space_dim == 0) {
+    if ((c.is_equality() && c.inhomogeneous_term() != 0)
+        || (c.is_inequality() && c.inhomogeneous_term() < 0))
+      return Poly_Con_Relation::is_disjoint();
+    else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
+      // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
+      // thus, the zero-dimensional point also saturates it.
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_disjoint();
+    else if (c.is_equality() || c.inhomogeneous_term() == 0)
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_included();
+    else
+      // The zero-dimensional point saturates
+      // neither the positivity constraint 1 >= 0,
+      // nor the strict positivity constraint 1 > 0.
+      return Poly_Con_Relation::is_included();
+  }
+
+  dimension_type c_num_vars = 0;
+  dimension_type c_only_var = 0;
+
+  if (Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var))
+    if (c_num_vars == 0)
+      // c is a trivial constraint.
+      switch (sgn(c.inhomogeneous_term())) {
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      case 0:
+        if (c.is_strict_inequality())
+          return Poly_Con_Relation::saturates()
+            && Poly_Con_Relation::is_disjoint();
+        else
+          return Poly_Con_Relation::saturates()
+            && Poly_Con_Relation::is_included();
+      case 1:
+        return Poly_Con_Relation::is_included();
+      }
+    else {
+      // c is an interval constraint.
+      return interval_relation(seq[c_only_var],
+                               c.type(),
+                               c.inhomogeneous_term(),
+                               c.coefficient(Variable(c_only_var)));
+    }
+  else {
+    // Deal with a non-trivial and non-interval constraint.
+    PPL_DIRTY_TEMP(Rational_Interval, r);
+    PPL_DIRTY_TEMP(Rational_Interval, t);
+    PPL_DIRTY_TEMP(mpq_class, m);
+    r = 0;
+    const Constraint::expr_type& e = c.expression();
+    for (Constraint::expr_type::const_iterator i = e.begin(), i_end = e.end();
+          i != i_end; ++i) {
+      assign_r(m, *i, ROUND_NOT_NEEDED);
+      const Variable v = i.variable();
+      // FIXME: an add_mul_assign() method would come handy here.
+      t.build(seq[v.id()].lower_constraint(), seq[v.id()].upper_constraint());
+      t *= m;
+      r += t;
+    }
+    return interval_relation(r,
+                             c.type(),
+                             c.inhomogeneous_term());
+  }
+
+  // Quiet a compiler warning: this program point is unreachable.
+  PPL_UNREACHABLE;
+  return Poly_Con_Relation::nothing();
+}
+
+template <typename ITV>
+Poly_Gen_Relation
+Box<ITV>::relation_with(const Generator& g) const {
+  const dimension_type space_dim = space_dimension();
+  const dimension_type g_space_dim = g.space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim < g_space_dim)
+    throw_dimension_incompatible("relation_with(g)", g);
+
+  // The empty box cannot subsume a generator.
+  if (is_empty())
+    return Poly_Gen_Relation::nothing();
+
+  // A universe box in a zero-dimensional space subsumes
+  // all the generators of a zero-dimensional space.
+  if (space_dim == 0)
+    return Poly_Gen_Relation::subsumes();
+
+  if (g.is_line_or_ray()) {
+    if (g.is_line()) {
+      const Generator::expr_type& e = g.expression();
+      for (Generator::expr_type::const_iterator i = e.begin(), i_end = e.end();
+           i != i_end; ++i)
+        if (!seq[i.variable().id()].is_universe())
+          return Poly_Gen_Relation::nothing();
+      return Poly_Gen_Relation::subsumes();
+    }
+    else {
+      PPL_ASSERT(g.is_ray());
+      const Generator::expr_type& e = g.expression();
+      for (Generator::expr_type::const_iterator i = e.begin(), i_end = e.end();
+           i != i_end; ++i) {
+        const Variable v = i.variable();
+        switch (sgn(*i)) {
+        case 1:
+          if (!seq[v.id()].upper_is_boundary_infinity())
+            return Poly_Gen_Relation::nothing();
+          break;
+        case 0:
+          PPL_UNREACHABLE;
+          break;
+        case -1:
+          if (!seq[v.id()].lower_is_boundary_infinity())
+            return Poly_Gen_Relation::nothing();
+          break;
+        }
+      }
+      return Poly_Gen_Relation::subsumes();
+    }
+  }
+
+  // Here `g' is a point or closure point.
+  const Coefficient& g_divisor = g.divisor();
+  PPL_DIRTY_TEMP(mpq_class, g_coord);
+  PPL_DIRTY_TEMP(mpq_class, bound);
+  // TODO: If the variables in the expression that have coefficient 0
+  // have no effect on seq[i], this loop can be optimized using
+  // Generator::expr_type::const_iterator.
+  for (dimension_type i = g_space_dim; i-- > 0; ) {
+    const ITV& seq_i = seq[i];
+    if (seq_i.is_universe())
+      continue;
+    assign_r(g_coord.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+    assign_r(g_coord.get_den(), g_divisor, ROUND_NOT_NEEDED);
+    g_coord.canonicalize();
+    // Check lower bound.
+    if (!seq_i.lower_is_boundary_infinity()) {
+      assign_r(bound, seq_i.lower(), ROUND_NOT_NEEDED);
+      if (g_coord <= bound) {
+        if (seq_i.lower_is_open()) {
+          if (g.is_point() || g_coord != bound)
+            return Poly_Gen_Relation::nothing();
+        }
+        else if (g_coord != bound)
+          return Poly_Gen_Relation::nothing();
+      }
+    }
+    // Check upper bound.
+    if (!seq_i.upper_is_boundary_infinity()) {
+      assign_r(bound, seq_i.upper(), ROUND_NOT_NEEDED);
+      if (g_coord >= bound) {
+        if (seq_i.upper_is_open()) {
+          if (g.is_point() || g_coord != bound)
+            return Poly_Gen_Relation::nothing();
+        }
+        else if (g_coord != bound)
+          return Poly_Gen_Relation::nothing();
+      }
+    }
+  }
+  return Poly_Gen_Relation::subsumes();
+}
+
+
+template <typename ITV>
+bool
+Box<ITV>::max_min(const Linear_Expression& expr,
+                  const bool maximize,
+                  Coefficient& ext_n, Coefficient& ext_d,
+                  bool& included) const {
+  // `expr' should be dimension-compatible with `*this'.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((maximize
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
+  // Deal with zero-dim Box first.
+  if (space_dim == 0) {
+    if (marked_empty())
+      return false;
+    else {
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      return true;
+    }
+  }
+
+  // For an empty Box we simply return false.
+  if (is_empty())
+    return false;
+
+  PPL_DIRTY_TEMP(mpq_class, result);
+  assign_r(result, expr.inhomogeneous_term(), ROUND_NOT_NEEDED);
+  bool is_included = true;
+  const int maximize_sign = maximize ? 1 : -1;
+  PPL_DIRTY_TEMP(mpq_class, bound_i);
+  PPL_DIRTY_TEMP(mpq_class, expr_i);
+  for (Linear_Expression::const_iterator i = expr.begin(),
+          i_end = expr.end(); i != i_end; ++i) {
+    const ITV& seq_i = seq[i.variable().id()];
+    assign_r(expr_i, *i, ROUND_NOT_NEEDED);
+    switch (sgn(expr_i) * maximize_sign) {
+    case 1:
+      if (seq_i.upper_is_boundary_infinity())
+        return false;
+      assign_r(bound_i, seq_i.upper(), ROUND_NOT_NEEDED);
+      add_mul_assign_r(result, bound_i, expr_i, ROUND_NOT_NEEDED);
+      if (seq_i.upper_is_open())
+        is_included = false;
+      break;
+    case 0:
+      PPL_UNREACHABLE;
+      break;
+    case -1:
+      if (seq_i.lower_is_boundary_infinity())
+        return false;
+      assign_r(bound_i, seq_i.lower(), ROUND_NOT_NEEDED);
+      add_mul_assign_r(result, bound_i, expr_i, ROUND_NOT_NEEDED);
+      if (seq_i.lower_is_open())
+        is_included = false;
+      break;
+    }
+  }
+  // Extract output info.
+  PPL_ASSERT(is_canonical(result));
+  ext_n = result.get_num();
+  ext_d = result.get_den();
+  included = is_included;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::max_min(const Linear_Expression& expr,
+                  const bool maximize,
+                  Coefficient& ext_n, Coefficient& ext_d,
+                  bool& included,
+                  Generator& g) const {
+  if (!max_min(expr, maximize, ext_n, ext_d, included))
+    return false;
+
+  // Compute generator `g'.
+  Linear_Expression g_expr;
+  PPL_DIRTY_TEMP(Coefficient, g_divisor);
+  g_divisor = 1;
+  const int maximize_sign = maximize ? 1 : -1;
+  PPL_DIRTY_TEMP(mpq_class, g_coord);
+  PPL_DIRTY_TEMP(Coefficient, numer);
+  PPL_DIRTY_TEMP(Coefficient, denom);
+  PPL_DIRTY_TEMP(Coefficient, lcm);
+  PPL_DIRTY_TEMP(Coefficient, factor);
+  // TODO: Check if the following loop can be optimized to exploit the
+  // (possible) sparseness of expr.
+  for (dimension_type i = space_dimension(); i-- > 0; ) {
+    const ITV& seq_i = seq[i];
+    switch (sgn(expr.coefficient(Variable(i))) * maximize_sign) {
+    case 1:
+      assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
+      break;
+    case 0:
+      // If 0 belongs to the interval, choose it
+      // (and directly proceed to the next iteration).
+      // FIXME: name qualification issue.
+      if (seq_i.contains(0))
+        continue;
+      if (!seq_i.lower_is_boundary_infinity())
+        if (seq_i.lower_is_open())
+          if (!seq_i.upper_is_boundary_infinity())
+            if (seq_i.upper_is_open()) {
+              // Bounded and open interval: compute middle point.
+              assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+              PPL_DIRTY_TEMP(mpq_class, q_seq_i_upper);
+              assign_r(q_seq_i_upper, seq_i.upper(), ROUND_NOT_NEEDED);
+              g_coord += q_seq_i_upper;
+              g_coord /= 2;
+            }
+            else
+              // The upper bound is in the interval.
+              assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
+          else {
+            // Lower is open, upper is unbounded.
+            assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+            ++g_coord;
+          }
+        else
+          // The lower bound is in the interval.
+          assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+      else {
+        // Lower is unbounded, hence upper is bounded
+        // (since we know that 0 does not belong to the interval).
+        PPL_ASSERT(!seq_i.upper_is_boundary_infinity());
+        assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
+        if (seq_i.upper_is_open())
+          --g_coord;
+      }
+      break;
+    case -1:
+      assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+      break;
+    }
+    // Add g_coord * Variable(i) to the generator.
+    assign_r(denom, g_coord.get_den(), ROUND_NOT_NEEDED);
+    lcm_assign(lcm, g_divisor, denom);
+    exact_div_assign(factor, lcm, g_divisor);
+    g_expr *= factor;
+    exact_div_assign(factor, lcm, denom);
+    assign_r(numer, g_coord.get_num(), ROUND_NOT_NEEDED);
+    numer *= factor;
+    g_expr += numer * Variable(i);
+    g_divisor = lcm;
+  }
+  g = Generator::point(g_expr, g_divisor);
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::contains(const Box& y) const {
+  const Box& x = *this;
+  // Dimension-compatibility check.
+  if (x.space_dimension() != y.space_dimension())
+    x.throw_dimension_incompatible("contains(y)", y);
+
+  // If `y' is empty, then `x' contains `y'.
+  if (y.is_empty())
+    return true;
+
+  // If `x' is empty, then `x' cannot contain `y'.
+  if (x.is_empty())
+    return false;
+
+  for (dimension_type k = x.seq.size(); k-- > 0; )
+    // FIXME: fix this name qualification issue.
+    if (!x.seq[k].contains(y.seq[k]))
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::is_disjoint_from(const Box& y) const {
+  const Box& x = *this;
+  // Dimension-compatibility check.
+  if (x.space_dimension() != y.space_dimension())
+    x.throw_dimension_incompatible("is_disjoint_from(y)", y);
+
+  // If any of `x' or `y' is marked empty, then they are disjoint.
+  // Note: no need to use `is_empty', as the following loop is anyway correct.
+  if (x.marked_empty() || y.marked_empty())
+    return true;
+
+  for (dimension_type k = x.seq.size(); k-- > 0; )
+    // FIXME: fix this name qualification issue.
+    if (x.seq[k].is_disjoint_from(y.seq[k]))
+      return true;
+  return false;
+}
+
+template <typename ITV>
+inline bool
+Box<ITV>::upper_bound_assign_if_exact(const Box& y) {
+  Box& x = *this;
+
+  // Dimension-compatibility check.
+  if (x.space_dimension() != y.space_dimension())
+    x.throw_dimension_incompatible("upper_bound_assign_if_exact(y)", y);
+
+  // The lub of a box with an empty box is equal to the first box.
+  if (y.is_empty())
+    return true;
+  if (x.is_empty()) {
+    x = y;
+    return true;
+  }
+
+  bool x_j_does_not_contain_y_j = false;
+  bool y_j_does_not_contain_x_j = false;
+
+  for (dimension_type i = x.seq.size(); i-- > 0; ) {
+    const ITV& x_seq_i = x.seq[i];
+    const ITV& y_seq_i = y.seq[i];
+
+    if (!x_seq_i.can_be_exactly_joined_to(y_seq_i))
+      return false;
+
+    // Note: the use of `y_i_does_not_contain_x_i' is needed
+    // because we want to temporarily preserve the old value
+    // of `y_j_does_not_contain_x_j'.
+    bool y_i_does_not_contain_x_i = !y_seq_i.contains(x_seq_i);
+    if (y_i_does_not_contain_x_i && x_j_does_not_contain_y_j)
+      return false;
+    if (!x_seq_i.contains(y_seq_i)) {
+      if (y_j_does_not_contain_x_j)
+        return false;
+      else
+        x_j_does_not_contain_y_j = true;
+    }
+    if (y_i_does_not_contain_x_i)
+      y_j_does_not_contain_x_j = true;
+  }
+
+  // The upper bound is exact: compute it into *this.
+  for (dimension_type k = x.seq.size(); k-- > 0; )
+    x.seq[k].join_assign(y.seq[k]);
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::OK() const {
+  if (status.test_empty_up_to_date() && !status.test_empty()) {
+    Box tmp = *this;
+    tmp.reset_empty_up_to_date();
+    if (tmp.check_empty()) {
+#ifndef NDEBUG
+      std::cerr << "The box is empty, but it is marked as non-empty."
+                << std::endl;
+#endif // NDEBUG
+      return false;
+    }
+  }
+
+  // A box that is not marked empty must have meaningful intervals.
+  if (!marked_empty()) {
+    for (dimension_type k = seq.size(); k-- > 0; )
+      if (!seq[k].OK())
+        return false;
+  }
+
+  return true;
+}
+
+template <typename ITV>
+dimension_type
+Box<ITV>::affine_dimension() const {
+  dimension_type d = space_dimension();
+  // A zero-space-dim box always has affine dimension zero.
+  if (d == 0)
+    return 0;
+
+  // An empty box has affine dimension zero.
+  if (is_empty())
+    return 0;
+
+  for (dimension_type k = d; k-- > 0; )
+    if (seq[k].is_singleton())
+      --d;
+
+  return d;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::check_empty() const {
+  PPL_ASSERT(!marked_empty());
+  Box<ITV>& x = const_cast<Box<ITV>&>(*this);
+  for (dimension_type k = seq.size(); k-- > 0; )
+    if (seq[k].is_empty()) {
+      x.set_empty();
+      return true;
+    }
+  x.set_nonempty();
+  return false;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::is_universe() const {
+  if (marked_empty())
+    return false;
+  for (dimension_type k = seq.size(); k-- > 0; )
+    if (!seq[k].is_universe())
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::is_topologically_closed() const {
+  if (ITV::is_always_topologically_closed() || is_empty())
+    return true;
+
+  for (dimension_type k = seq.size(); k-- > 0; )
+    if (!seq[k].is_topologically_closed())
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::is_discrete() const {
+  if (is_empty())
+    return true;
+  for (dimension_type k = seq.size(); k-- > 0; )
+    if (!seq[k].is_singleton())
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::is_bounded() const {
+  if (is_empty())
+    return true;
+  for (dimension_type k = seq.size(); k-- > 0; )
+    if (!seq[k].is_bounded())
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::contains_integer_point() const {
+  if (marked_empty())
+    return false;
+  for (dimension_type k = seq.size(); k-- > 0; )
+    if (!seq[k].contains_integer_point())
+      return false;
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::frequency(const Linear_Expression& expr,
+                  Coefficient& freq_n, Coefficient& freq_d,
+                  Coefficient& val_n, Coefficient& val_d) const {
+  dimension_type space_dim = space_dimension();
+  // The dimension of `expr' must be at most the dimension of *this.
+  if (space_dim < expr.space_dimension())
+    throw_dimension_incompatible("frequency(e, ...)", "e", expr);
+
+  // Check if `expr' has a constant value.
+  // If it is constant, set the frequency `freq_n' to 0
+  // and return true. Otherwise the values for \p expr
+  // are not discrete so return false.
+
+  // Space dimension is 0: if empty, then return false;
+  // otherwise the frequency is 0 and the value is the inhomogeneous term.
+  if (space_dim == 0) {
+    if (is_empty())
+      return false;
+    freq_n = 0;
+    freq_d = 1;
+    val_n = expr.inhomogeneous_term();
+    val_d = 1;
+    return true;
+  }
+
+  // For an empty Box, we simply return false.
+  if (is_empty())
+    return false;
+
+  // The Box has at least 1 dimension and is not empty.
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  PPL_DIRTY_TEMP(mpq_class, tmp);
+  Coefficient c = expr.inhomogeneous_term();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
+  val_denom = 1;
+
+  for (Linear_Expression::const_iterator i = expr.begin(), i_end = expr.end();
+       i != i_end; ++i) {
+    const ITV& seq_i = seq[i.variable().id()];
+    // Check if `v' is constant in the BD shape.
+    if (seq_i.is_singleton()) {
+      // If `v' is constant, replace it in `le' by the value.
+      assign_r(tmp, seq_i.lower(), ROUND_NOT_NEEDED);
+      numer = tmp.get_num();
+      denom = tmp.get_den();
+      c *= denom;
+      c += numer * val_denom * (*i);
+      val_denom *= denom;
+      continue;
+    }
+    // The expression `expr' is not constant.
+    return false;
+  }
+
+  // The expression `expr' is constant.
+  freq_n = 0;
+  freq_d = 1;
+
+  // Reduce `val_n' and `val_d'.
+  normalize2(c, val_denom, val_n, val_d);
+  return true;
+}
+
+template <typename ITV>
+bool
+Box<ITV>::constrains(Variable var) const {
+  // `var' should be one of the dimensions of the polyhedron.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dimension() < var_space_dim)
+    throw_dimension_incompatible("constrains(v)", "v", var);
+
+  if (marked_empty() || !seq[var_space_dim-1].is_universe())
+    return true;
+  // Now force an emptiness check.
+  return is_empty();
+}
+
+template <typename ITV>
+void
+Box<ITV>::unconstrain(const Variables_Set& vars) {
+  // The cylindrification with respect to no dimensions is a no-op.
+  // This case also captures the only legal cylindrification
+  // of a box in a 0-dim space.
+  if (vars.empty())
+    return;
+
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dimension() < min_space_dim)
+    throw_dimension_incompatible("unconstrain(vs)", min_space_dim);
+
+  // If the box is already empty, there is nothing left to do.
+  if (marked_empty())
+    return;
+
+  // Here the box might still be empty (but we haven't detected it yet):
+  // check emptiness of the interval for each of the variables in
+  // `vars' before cylindrification.
+  for (Variables_Set::const_iterator vsi = vars.begin(),
+         vsi_end = vars.end(); vsi != vsi_end; ++vsi) {
+    ITV& seq_vsi = seq[*vsi];
+    if (!seq_vsi.is_empty())
+      seq_vsi.assign(UNIVERSE);
+    else {
+      set_empty();
+      break;
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::topological_closure_assign() {
+  if (ITV::is_always_topologically_closed() || is_empty())
+    return;
+
+  for (dimension_type k = seq.size(); k-- > 0; )
+    seq[k].topological_closure_assign();
+}
+
+template <typename ITV>
+void
+Box<ITV>::wrap_assign(const Variables_Set& vars,
+                      Bounded_Integer_Type_Width w,
+                      Bounded_Integer_Type_Representation r,
+                      Bounded_Integer_Type_Overflow o,
+                      const Constraint_System* cs_p,
+                      unsigned complexity_threshold,
+                      bool wrap_individually) {
+#if 0 // Generic implementation commented out.
+  Implementation::wrap_assign(*this,
+                              vars, w, r, o, cs_p,
+                              complexity_threshold, wrap_individually,
+                              "Box");
+#else // Specialized implementation.
+  PPL_USED(wrap_individually);
+  PPL_USED(complexity_threshold);
+  Box& x = *this;
+
+  // Dimension-compatibility check for `*cs_p', if any.
+  const dimension_type vars_space_dim = vars.space_dimension();
+  if (cs_p != 0 && cs_p->space_dimension() > vars_space_dim) {
+    std::ostringstream s;
+    s << "PPL::Box<ITV>::wrap_assign(vars, w, r, o, cs_p, ...):"
+      << std::endl
+      << "vars.space_dimension() == " << vars_space_dim
+      << ", cs_p->space_dimension() == " << cs_p->space_dimension() << ".";
+    throw std::invalid_argument(s.str());
+  }
+
+  // Wrapping no variable only requires refining with *cs_p, if any.
+  if (vars.empty()) {
+    if (cs_p != 0)
+      refine_with_constraints(*cs_p);
+    return;
+  }
+
+  // Dimension-compatibility check for `vars'.
+  const dimension_type space_dim = x.space_dimension();
+  if (space_dim < vars_space_dim) {
+    std::ostringstream s;
+    s << "PPL::Box<ITV>::wrap_assign(vars, ...):"
+      << std::endl
+      << "this->space_dimension() == " << space_dim
+      << ", required space dimension == " << vars_space_dim << ".";
+    throw std::invalid_argument(s.str());
+  }
+
+  // Wrapping an empty polyhedron is a no-op.
+  if (x.is_empty())
+    return;
+
+  // FIXME: temporarily (ab-) using Coefficient.
+  // Set `min_value' and `max_value' to the minimum and maximum values
+  // a variable of width `w' and signedness `s' can take.
+  PPL_DIRTY_TEMP_COEFFICIENT(min_value);
+  PPL_DIRTY_TEMP_COEFFICIENT(max_value);
+  if (r == UNSIGNED) {
+    min_value = 0;
+    mul_2exp_assign(max_value, Coefficient_one(), w);
+    --max_value;
+  }
+  else {
+    PPL_ASSERT(r == SIGNED_2_COMPLEMENT);
+    mul_2exp_assign(max_value, Coefficient_one(), w-1);
+    neg_assign(min_value, max_value);
+    --max_value;
+  }
+
+  // FIXME: Build the (integer) quadrant interval.
+  PPL_DIRTY_TEMP(ITV, integer_quadrant_itv);
+  PPL_DIRTY_TEMP(ITV, rational_quadrant_itv);
+  {
+    I_Constraint<Coefficient> lower = i_constraint(GREATER_OR_EQUAL, min_value);
+    I_Constraint<Coefficient> upper = i_constraint(LESS_OR_EQUAL, max_value);
+    integer_quadrant_itv.build(lower, upper);
+    // The rational quadrant is only needed if overflow is undefined.
+    if (o == OVERFLOW_UNDEFINED) {
+      ++max_value;
+      upper = i_constraint(LESS_THAN, max_value);
+      rational_quadrant_itv.build(lower, upper);
+    }
+  }
+
+  const Variables_Set::const_iterator vs_end = vars.end();
+
+  if (cs_p == 0) {
+    // No constraint refinement is needed here.
+    switch (o) {
+    case OVERFLOW_WRAPS:
+      for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i)
+        x.seq[*i].wrap_assign(w, r, integer_quadrant_itv);
+      reset_empty_up_to_date();
+      break;
+    case OVERFLOW_UNDEFINED:
+      for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i) {
+        ITV& x_seq_v = x.seq[*i];
+        if (!rational_quadrant_itv.contains(x_seq_v)) {
+          x_seq_v.assign(integer_quadrant_itv);
+        }
+      }
+      break;
+    case OVERFLOW_IMPOSSIBLE:
+      for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i)
+        x.seq[*i].intersect_assign(integer_quadrant_itv);
+      reset_empty_up_to_date();
+      break;
+    }
+    PPL_ASSERT(x.OK());
+    return;
+  }
+
+  PPL_ASSERT(cs_p != 0);
+  const Constraint_System& cs = *cs_p;
+  // A map associating interval constraints to variable indexes.
+  typedef std::map<dimension_type, std::vector<const Constraint*> > map_type;
+  map_type var_cs_map;
+  for (Constraint_System::const_iterator i = cs.begin(),
+         i_end = cs.end(); i != i_end; ++i) {
+    const Constraint& c = *i;
+    dimension_type c_num_vars = 0;
+    dimension_type c_only_var = 0;
+    if (Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var)) {
+      if (c_num_vars == 1) {
+        // An interval constraint on variable index `c_only_var'.
+        PPL_ASSERT(c_only_var < space_dim);
+        // We do care about c if c_only_var is going to be wrapped.
+        if (vars.find(c_only_var) != vs_end)
+          var_cs_map[c_only_var].push_back(&c);
+      }
+      else {
+        PPL_ASSERT(c_num_vars == 0);
+        // Note: tautologies have been filtered out by iterators.
+        PPL_ASSERT(c.is_inconsistent());
+        x.set_empty();
+        return;
+      }
+    }
+  }
+
+  PPL_DIRTY_TEMP(ITV, refinement_itv);
+  const map_type::const_iterator var_cs_map_end = var_cs_map.end();
+  // Loop through the variable indexes in `vars'.
+  for (Variables_Set::const_iterator i = vars.begin(); i != vs_end; ++i) {
+    const dimension_type v = *i;
+    refinement_itv = integer_quadrant_itv;
+    // Look for the refinement constraints for space dimension index `v'.
+    map_type::const_iterator var_cs_map_iter = var_cs_map.find(v);
+    if (var_cs_map_iter != var_cs_map_end) {
+      // Refine interval for variable `v'.
+      const map_type::mapped_type& var_cs = var_cs_map_iter->second;
+      for (dimension_type j = var_cs.size(); j-- > 0; ) {
+        const Constraint& c = *var_cs[j];
+        refine_interval_no_check(refinement_itv,
+                                 c.type(),
+                                 c.inhomogeneous_term(),
+                                 c.coefficient(Variable(v)));
+      }
+    }
+    // Wrap space dimension index `v'.
+    ITV& x_seq_v = x.seq[v];
+    switch (o) {
+    case OVERFLOW_WRAPS:
+      x_seq_v.wrap_assign(w, r, refinement_itv);
+      break;
+    case OVERFLOW_UNDEFINED:
+      if (!rational_quadrant_itv.contains(x_seq_v))
+        x_seq_v.assign(UNIVERSE);
+      break;
+    case OVERFLOW_IMPOSSIBLE:
+      x_seq_v.intersect_assign(refinement_itv);
+      break;
+    }
+  }
+  PPL_ASSERT(x.OK());
+#endif
+}
+
+template <typename ITV>
+void
+Box<ITV>::drop_some_non_integer_points(Complexity_Class) {
+  if (std::numeric_limits<typename ITV::boundary_type>::is_integer
+      && !ITV::info_type::store_open)
+    return;
+
+  if (marked_empty())
+    return;
+
+  for (dimension_type k = seq.size(); k-- > 0; )
+    seq[k].drop_some_non_integer_points();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::drop_some_non_integer_points(const Variables_Set& vars,
+                                       Complexity_Class) {
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dimension() < min_space_dim)
+    throw_dimension_incompatible("drop_some_non_integer_points(vs, cmpl)",
+                                 min_space_dim);
+
+  if (std::numeric_limits<typename ITV::boundary_type>::is_integer
+      && !ITV::info_type::store_open)
+    return;
+
+  if (marked_empty())
+    return;
+
+  for (Variables_Set::const_iterator v_i = vars.begin(),
+         v_end = vars.end(); v_i != v_end; ++v_i)
+    seq[*v_i].drop_some_non_integer_points();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::intersection_assign(const Box& y) {
+  Box& x = *this;
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    x.throw_dimension_incompatible("intersection_assign(y)", y);
+
+  // If one of the two boxes is empty, the intersection is empty.
+  if (x.marked_empty())
+    return;
+  if (y.marked_empty()) {
+    x.set_empty();
+    return;
+  }
+
+  // If both boxes are zero-dimensional, then at this point they are
+  // necessarily non-empty, so that their intersection is non-empty too.
+  if (space_dim == 0)
+    return;
+
+  // FIXME: here we may conditionally exploit a capability of the
+  // underlying interval to eagerly detect empty results.
+  reset_empty_up_to_date();
+
+  for (dimension_type k = space_dim; k-- > 0; )
+    x.seq[k].intersect_assign(y.seq[k]);
+
+  PPL_ASSERT(x.OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::upper_bound_assign(const Box& y) {
+  Box& x = *this;
+
+  // Dimension-compatibility check.
+  if (x.space_dimension() != y.space_dimension())
+    x.throw_dimension_incompatible("upper_bound_assign(y)", y);
+
+  // The lub of a box with an empty box is equal to the first box.
+  if (y.is_empty())
+    return;
+  if (x.is_empty()) {
+    x = y;
+    return;
+  }
+
+  for (dimension_type k = x.seq.size(); k-- > 0; )
+    x.seq[k].join_assign(y.seq[k]);
+
+  PPL_ASSERT(x.OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::concatenate_assign(const Box& y) {
+  Box& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+  const dimension_type y_space_dim = y.space_dimension();
+
+  // If `y' is marked empty, the result will be empty too.
+  if (y.marked_empty())
+    x.set_empty();
+
+  // If `y' is a 0-dim space box, there is nothing left to do.
+  if (y_space_dim == 0)
+    return;
+  // The resulting space dimension must be at most the maximum.
+  check_space_dimension_overflow(y.space_dimension(),
+                                 max_space_dimension() - space_dimension(),
+                                 "PPL::Box::",
+                                 "concatenate_assign(y)",
+                                 "concatenation exceeds the maximum "
+                                 "allowed space dimension");
+  // Here `y_space_dim > 0', so that a non-trivial concatenation will occur:
+  // make sure that reallocation will occur once at most.
+  x.seq.reserve(x_space_dim + y_space_dim);
+
+  // If `x' is marked empty, then it is sufficient to adjust
+  // the dimension of the vector space.
+  if (x.marked_empty()) {
+    x.seq.insert(x.seq.end(), y_space_dim, ITV(EMPTY));
+    PPL_ASSERT(x.OK());
+    return;
+  }
+
+  // Here neither `x' nor `y' are marked empty: concatenate them.
+  std::copy(y.seq.begin(), y.seq.end(),
+            std::back_insert_iterator<Sequence>(x.seq));
+  // Update the `empty_up_to_date' flag.
+  if (!y.status.test_empty_up_to_date())
+    reset_empty_up_to_date();
+
+  PPL_ASSERT(x.OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::difference_assign(const Box& y) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("difference_assign(y)", y);
+
+  Box& x = *this;
+  if (x.is_empty() || y.is_empty())
+    return;
+
+  switch (space_dim) {
+  case 0:
+    // If `x' is zero-dimensional, then at this point both `x' and `y'
+    // are the universe box, so that their difference is empty.
+    x.set_empty();
+    break;
+
+  case 1:
+    x.seq[0].difference_assign(y.seq[0]);
+    if (x.seq[0].is_empty())
+      x.set_empty();
+    break;
+
+  default:
+    {
+      dimension_type index_non_contained = space_dim;
+      dimension_type number_non_contained = 0;
+      for (dimension_type i = space_dim; i-- > 0; )
+        if (!y.seq[i].contains(x.seq[i])) {
+          if (++number_non_contained == 1)
+            index_non_contained = i;
+          else
+            break;
+        }
+
+      switch (number_non_contained) {
+      case 0:
+        // `y' covers `x': the difference is empty.
+        x.set_empty();
+        break;
+      case 1:
+        x.seq[index_non_contained]
+          .difference_assign(y.seq[index_non_contained]);
+        if (x.seq[index_non_contained].is_empty())
+          x.set_empty();
+        break;
+      default:
+        // Nothing to do: the difference is `x'.
+        break;
+      }
+    }
+    break;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+bool
+Box<ITV>::simplify_using_context_assign(const Box& y) {
+  Box& x = *this;
+  const dimension_type num_dims = x.space_dimension();
+  // Dimension-compatibility check.
+  if (num_dims != y.space_dimension())
+    x.throw_dimension_incompatible("simplify_using_context_assign(y)", y);
+
+  // Filter away the zero-dimensional case.
+  if (num_dims == 0) {
+    if (y.marked_empty()) {
+      x.set_nonempty();
+      return false;
+    }
+    else
+      return !x.marked_empty();
+  }
+
+  // Filter away the case when `y' is empty.
+  if (y.is_empty()) {
+    for (dimension_type i = num_dims; i-- > 0; )
+      x.seq[i].assign(UNIVERSE);
+    x.set_nonempty();
+    return false;
+  }
+
+  if (x.is_empty()) {
+    // Find in `y' a non-universe interval, if any.
+    for (dimension_type i = 0; i < num_dims; ++i) {
+      if (y.seq[i].is_universe())
+        x.seq[i].assign(UNIVERSE);
+      else {
+        // Set x.seq[i] so as to contradict y.seq[i], if possible.
+        ITV& seq_i = x.seq[i];
+        seq_i.empty_intersection_assign(y.seq[i]);
+        if (seq_i.is_empty()) {
+          // We were not able to assign to `seq_i' a non-empty interval:
+          // reset `seq_i' to the universe interval and keep searching.
+          seq_i.assign(UNIVERSE);
+          continue;
+        }
+        // We assigned to `seq_i' a non-empty interval:
+        // set the other intervals to universe and return.
+        for (++i; i < num_dims; ++i)
+          x.seq[i].assign(UNIVERSE);
+        x.set_nonempty();
+        PPL_ASSERT(x.OK());
+        return false;
+      }
+    }
+    // All intervals in `y' are universe or could not be contradicted:
+    // simplification can leave the empty box `x' as is.
+    PPL_ASSERT(x.OK() && x.is_empty());
+    return false;
+  }
+
+  // Loop index `i' is intentionally going upwards.
+  for (dimension_type i = 0; i < num_dims; ++i) {
+    if (!x.seq[i].simplify_using_context_assign(y.seq[i])) {
+      PPL_ASSERT(!x.seq[i].is_empty());
+      // The intersection of `x' and `y' is empty due to the i-th interval:
+      // reset other intervals to UNIVERSE.
+      for (dimension_type j = num_dims; j-- > i; )
+        x.seq[j].assign(UNIVERSE);
+      for (dimension_type j = i; j-- > 0; )
+        x.seq[j].assign(UNIVERSE);
+      PPL_ASSERT(x.OK());
+      return false;
+    }
+  }
+  PPL_ASSERT(x.OK());
+  return true;
+}
+
+template <typename ITV>
+void
+Box<ITV>::time_elapse_assign(const Box& y) {
+  Box& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    x.throw_dimension_incompatible("time_elapse_assign(y)", y);
+
+  // Dealing with the zero-dimensional case.
+  if (x_space_dim == 0) {
+    if (y.marked_empty())
+      x.set_empty();
+    return;
+  }
+
+  // If either one of `x' or `y' is empty, the result is empty too.
+  // Note: if possible, avoid cost of checking for emptiness.
+  if (x.marked_empty() || y.marked_empty()
+      || x.is_empty() || y.is_empty()) {
+    x.set_empty();
+    return;
+  }
+
+  for (dimension_type i = x_space_dim; i-- > 0; ) {
+    ITV& x_seq_i = x.seq[i];
+    const ITV& y_seq_i = y.seq[i];
+    if (!x_seq_i.lower_is_boundary_infinity())
+      if (y_seq_i.lower_is_boundary_infinity() || y_seq_i.lower() < 0)
+        x_seq_i.lower_extend();
+    if (!x_seq_i.upper_is_boundary_infinity())
+      if (y_seq_i.upper_is_boundary_infinity() || y_seq_i.upper() > 0)
+        x_seq_i.upper_extend();
+  }
+  PPL_ASSERT(x.OK());
+}
+
+template <typename ITV>
+inline void
+Box<ITV>::remove_space_dimensions(const Variables_Set& vars) {
+  // The removal of no dimensions from any box is a no-op.
+  // Note that this case also captures the only legal removal of
+  // space dimensions from a box in a zero-dimensional space.
+  if (vars.empty()) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  const dimension_type old_space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  const dimension_type vsi_space_dim = vars.space_dimension();
+  if (old_space_dim < vsi_space_dim)
+    throw_dimension_incompatible("remove_space_dimensions(vs)",
+                                 vsi_space_dim);
+
+  const dimension_type new_space_dim = old_space_dim - vars.size();
+
+  // If the box is empty (this must be detected), then resizing is all
+  // what is needed.  If it is not empty and we are removing _all_ the
+  // dimensions then, again, resizing suffices.
+  if (is_empty() || new_space_dim == 0) {
+    seq.resize(new_space_dim);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // For each variable to be removed, we fill the corresponding interval
+  // by shifting left those intervals that will not be removed.
+  Variables_Set::const_iterator vsi = vars.begin();
+  Variables_Set::const_iterator vsi_end = vars.end();
+  dimension_type dst = *vsi;
+  dimension_type src = dst + 1;
+  for (++vsi; vsi != vsi_end; ++vsi) {
+    const dimension_type vsi_next = *vsi;
+    // All intervals in between are moved to the left.
+    while (src < vsi_next)
+      swap(seq[dst++], seq[src++]);
+    ++src;
+  }
+  // Moving the remaining intervals.
+  while (src < old_space_dim)
+    swap(seq[dst++], seq[src++]);
+
+  PPL_ASSERT(dst == new_space_dim);
+  seq.resize(new_space_dim);
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::remove_higher_space_dimensions(const dimension_type new_dimension) {
+  // Dimension-compatibility check: the variable having
+  // maximum index is the one occurring last in the set.
+  const dimension_type space_dim = space_dimension();
+  if (new_dimension > space_dim)
+    throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
+                                 new_dimension);
+
+  // The removal of no dimensions from any box is a no-op.
+  // Note that this case also captures the only legal removal of
+  // dimensions from a zero-dim space box.
+  if (new_dimension == space_dim) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  seq.resize(new_dimension);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+template <typename Partial_Function>
+void
+Box<ITV>::map_space_dimensions(const Partial_Function& pfunc) {
+  const dimension_type space_dim = space_dimension();
+  if (space_dim == 0)
+    return;
+
+  if (pfunc.has_empty_codomain()) {
+    // All dimensions vanish: the box becomes zero_dimensional.
+    remove_higher_space_dimensions(0);
+    return;
+  }
+
+  const dimension_type new_space_dim = pfunc.max_in_codomain() + 1;
+  // If the box is empty, then simply adjust the space dimension.
+  if (is_empty()) {
+    remove_higher_space_dimensions(new_space_dim);
+    return;
+  }
+
+  // We create a new Box with the new space dimension.
+  Box<ITV> tmp(new_space_dim);
+  // Map the intervals, exchanging the indexes.
+  for (dimension_type i = 0; i < space_dim; ++i) {
+    dimension_type new_i;
+    if (pfunc.maps(i, new_i))
+      swap(seq[i], tmp.seq[new_i]);
+  }
+  m_swap(tmp);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::fold_space_dimensions(const Variables_Set& vars,
+                                const Variable dest) {
+  const dimension_type space_dim = space_dimension();
+  // `dest' should be one of the dimensions of the box.
+  if (dest.space_dimension() > space_dim)
+    throw_dimension_incompatible("fold_space_dimensions(vs, v)", "v", dest);
+
+  // The folding of no dimensions is a no-op.
+  if (vars.empty())
+    return;
+
+  // All variables in `vars' should be dimensions of the box.
+  if (vars.space_dimension() > space_dim)
+    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
+                                 vars.space_dimension());
+
+  // Moreover, `dest.id()' should not occur in `vars'.
+  if (vars.find(dest.id()) != vars.end())
+    throw_invalid_argument("fold_space_dimensions(vs, v)",
+                           "v should not occur in vs");
+
+  // Note: the check for emptiness is needed for correctness.
+  if (!is_empty()) {
+    // Join the interval corresponding to variable `dest' with the intervals
+    // corresponding to the variables in `vars'.
+    ITV& seq_v = seq[dest.id()];
+    for (Variables_Set::const_iterator i = vars.begin(),
+           vs_end = vars.end(); i != vs_end; ++i)
+      seq_v.join_assign(seq[*i]);
+  }
+  remove_space_dimensions(vars);
+}
+
+template <typename ITV>
+void
+Box<ITV>::add_constraint_no_check(const Constraint& c) {
+  PPL_ASSERT(c.space_dimension() <= space_dimension());
+
+  dimension_type c_num_vars = 0;
+  dimension_type c_only_var = 0;
+  // Throw an exception if c is not an interval constraints.
+  if (!Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var))
+    throw_invalid_argument("add_constraint(c)",
+                           "c is not an interval constraint");
+
+  // Throw an exception if c is a nontrivial strict constraint
+  // and ITV does not support open boundaries.
+  if (c.is_strict_inequality() && c_num_vars != 0
+      && ITV::is_always_topologically_closed())
+    throw_invalid_argument("add_constraint(c)",
+                           "c is a nontrivial strict constraint");
+
+  // Avoid doing useless work if the box is known to be empty.
+  if (marked_empty())
+    return;
+
+  const Coefficient& n = c.inhomogeneous_term();
+  if (c_num_vars == 0) {
+    // Dealing with a trivial constraint.
+    if (n < 0
+        || (c.is_equality() && n != 0)
+        || (c.is_strict_inequality() && n == 0))
+      set_empty();
+    return;
+  }
+
+  PPL_ASSERT(c_num_vars == 1);
+  const Coefficient& d = c.coefficient(Variable(c_only_var));
+  add_interval_constraint_no_check(c_only_var, c.type(), n, d);
+}
+
+template <typename ITV>
+void
+Box<ITV>::add_constraints_no_check(const Constraint_System& cs) {
+  PPL_ASSERT(cs.space_dimension() <= space_dimension());
+  // Note: even when the box is known to be empty, we need to go
+  // through all the constraints to fulfill the method's contract
+  // for what concerns exception throwing.
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); i != cs_end; ++i)
+    add_constraint_no_check(*i);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::add_congruence_no_check(const Congruence& cg) {
+  PPL_ASSERT(cg.space_dimension() <= space_dimension());
+
+  // Set aside the case of proper congruences.
+  if (cg.is_proper_congruence()) {
+    if (cg.is_inconsistent()) {
+      set_empty();
+      return;
+    }
+    else if (cg.is_tautological())
+      return;
+    else
+      throw_invalid_argument("add_congruence(cg)",
+                             "cg is a nontrivial proper congruence");
+  }
+
+  PPL_ASSERT(cg.is_equality());
+  dimension_type cg_num_vars = 0;
+  dimension_type cg_only_var = 0;
+  // Throw an exception if c is not an interval congruence.
+  if (!Box_Helpers::extract_interval_congruence(cg, cg_num_vars, cg_only_var))
+    throw_invalid_argument("add_congruence(cg)",
+                           "cg is not an interval congruence");
+
+  // Avoid doing useless work if the box is known to be empty.
+  if (marked_empty())
+    return;
+
+  const Coefficient& n = cg.inhomogeneous_term();
+  if (cg_num_vars == 0) {
+    // Dealing with a trivial equality congruence.
+    if (n != 0)
+      set_empty();
+    return;
+  }
+
+  PPL_ASSERT(cg_num_vars == 1);
+  const Coefficient& d = cg.coefficient(Variable(cg_only_var));
+  add_interval_constraint_no_check(cg_only_var, Constraint::EQUALITY, n, d);
+}
+
+template <typename ITV>
+void
+Box<ITV>::add_congruences_no_check(const Congruence_System& cgs) {
+  PPL_ASSERT(cgs.space_dimension() <= space_dimension());
+  // Note: even when the box is known to be empty, we need to go
+  // through all the congruences to fulfill the method's contract
+  // for what concerns exception throwing.
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); i != cgs_end; ++i)
+    add_congruence_no_check(*i);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::refine_no_check(const Constraint& c) {
+  PPL_ASSERT(c.space_dimension() <= space_dimension());
+  PPL_ASSERT(!marked_empty());
+
+  dimension_type c_num_vars = 0;
+  dimension_type c_only_var = 0;
+  // Non-interval constraints are approximated.
+  if (!Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var)) {
+    propagate_constraint_no_check(c);
+    return;
+  }
+
+  const Coefficient& n = c.inhomogeneous_term();
+  if (c_num_vars == 0) {
+    // Dealing with a trivial constraint.
+    if (n < 0
+        || (c.is_equality() && n != 0)
+        || (c.is_strict_inequality() && n == 0))
+      set_empty();
+    return;
+  }
+
+  PPL_ASSERT(c_num_vars == 1);
+  const Coefficient& d = c.coefficient(Variable(c_only_var));
+  add_interval_constraint_no_check(c_only_var, c.type(), n, d);
+}
+
+template <typename ITV>
+void
+Box<ITV>::refine_no_check(const Constraint_System& cs) {
+  PPL_ASSERT(cs.space_dimension() <= space_dimension());
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+    refine_no_check(*i);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::refine_no_check(const Congruence& cg) {
+  PPL_ASSERT(!marked_empty());
+
+  PPL_ASSERT(cg.space_dimension() <= space_dimension());
+
+  if (cg.is_proper_congruence()) {
+    // A proper congruences is also an interval constraint
+    // if and only if it is trivial.
+    if (cg.is_inconsistent())
+      set_empty();
+    return;
+  }
+
+  PPL_ASSERT(cg.is_equality());
+  Constraint c(cg);
+  refine_no_check(c);
+}
+
+template <typename ITV>
+void
+Box<ITV>::refine_no_check(const Congruence_System& cgs) {
+  PPL_ASSERT(cgs.space_dimension() <= space_dimension());
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
+    refine_no_check(*i);
+  PPL_ASSERT(OK());
+}
+
+#if 1 // Alternative implementations for propagate_constraint_no_check.
+namespace Implementation {
+
+namespace Boxes {
+
+inline bool
+propagate_constraint_check_result(Result r, Ternary& open) {
+  r = result_relation_class(r);
+  switch (r) {
+  case V_GT_MINUS_INFINITY:
+  case V_LT_PLUS_INFINITY:
+    return true;
+  case V_LT:
+  case V_GT:
+    open = T_YES;
+    return false;
+  case V_LE:
+  case V_GE:
+    if (open == T_NO)
+      open = T_MAYBE;
+    return false;
+  case V_EQ:
+    return false;
+  default:
+    PPL_UNREACHABLE;
+    return true;
+  }
+}
+
+} // namespace Boxes
+
+} // namespace Implementation
+
+
+template <typename ITV>
+void
+Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
+  using namespace Implementation::Boxes;
+
+  PPL_ASSERT(c.space_dimension() <= space_dimension());
+
+  typedef
+    typename Select_Temp_Boundary_Type<typename ITV::boundary_type>::type
+    Temp_Boundary_Type;
+
+  const dimension_type c_space_dim = c.space_dimension();
+  const Constraint::Type c_type = c.type();
+  const Coefficient& c_inhomogeneous_term = c.inhomogeneous_term();
+
+  // Find a space dimension having a non-zero coefficient (if any).
+  const dimension_type last_k
+    = c.expression().last_nonzero(1, c_space_dim + 1);
+  if (last_k == c_space_dim + 1) {
+    // Constraint c is trivial: check if it is inconsistent.
+    if (c_inhomogeneous_term < 0
+        || (c_inhomogeneous_term == 0
+            && c_type != Constraint::NONSTRICT_INEQUALITY))
+      set_empty();
+    return;
+  }
+
+  // Here constraint c is non-trivial.
+  PPL_ASSERT(last_k <= c_space_dim);
+  Temp_Boundary_Type t_bound;
+  Temp_Boundary_Type t_a;
+  Temp_Boundary_Type t_x;
+  Ternary open;
+  const Constraint::expr_type c_e = c.expression();
+  for (Constraint::expr_type::const_iterator k = c_e.begin(),
+         k_end = c_e.lower_bound(Variable(last_k)); k != k_end; ++k) {
+    const Coefficient& a_k = *k;
+    const Variable k_var = k.variable();
+    const int sgn_a_k = sgn(a_k);
+    if (sgn_a_k == 0)
+      continue;
+    Result r;
+    if (sgn_a_k > 0) {
+      open = (c_type == Constraint::STRICT_INEQUALITY) ? T_YES : T_NO;
+      if (open == T_NO)
+        maybe_reset_fpu_inexact<Temp_Boundary_Type>();
+      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_1;
+      r = neg_assign_r(t_bound, t_bound, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_1;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
+            i_end = c_e.lower_bound(Variable(last_k)); i != i_end; ++i) {
+        const Variable i_var = i.variable();
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.lower_is_boundary_infinity())
+            goto maybe_refine_upper_1;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.upper_is_boundary_infinity())
+            goto maybe_refine_upper_1;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+        }
+      }
+      r = assign_r(t_a, a_k, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_1;
+      r = div_assign_r(t_bound, t_bound, t_a, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_1;
+
+      // Refine the lower bound of `seq[k]' with `t_bound'.
+      if (open == T_MAYBE
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
+      {
+        const Relation_Symbol rel
+          = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
+        seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
+      }
+      reset_empty_up_to_date();
+    maybe_refine_upper_1:
+      if (c_type != Constraint::EQUALITY)
+        continue;
+      open = T_NO;
+      maybe_reset_fpu_inexact<Temp_Boundary_Type>();
+      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+      r = neg_assign_r(t_bound, t_bound, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
+            i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
+        const Variable i_var = i.variable();
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.upper_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.lower_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
+      }
+      r = assign_r(t_a, a_k, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+      r = div_assign_r(t_bound, t_bound, t_a, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+
+      // Refine the upper bound of seq[k] with t_bound.
+      if (open == T_MAYBE
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
+      const Relation_Symbol rel
+        = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
+      seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
+      reset_empty_up_to_date();
+    }
+    else {
+      PPL_ASSERT(sgn_a_k < 0);
+      open = (c_type == Constraint::STRICT_INEQUALITY) ? T_YES : T_NO;
+      if (open == T_NO)
+        maybe_reset_fpu_inexact<Temp_Boundary_Type>();
+      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_2;
+      r = neg_assign_r(t_bound, t_bound, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_2;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
+            i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
+        const Variable i_var = i.variable();
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.lower_is_boundary_infinity())
+            goto maybe_refine_upper_2;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.upper_is_boundary_infinity())
+            goto maybe_refine_upper_2;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+        }
+      }
+      r = assign_r(t_a, a_k, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_2;
+      r = div_assign_r(t_bound, t_bound, t_a, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto maybe_refine_upper_2;
+
+      // Refine the upper bound of seq[k] with t_bound.
+      if (open == T_MAYBE
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
+      {
+        const Relation_Symbol rel
+          = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
+        seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
+      }
+      reset_empty_up_to_date();
+    maybe_refine_upper_2:
+      if (c_type != Constraint::EQUALITY)
+        continue;
+      open = T_NO;
+      maybe_reset_fpu_inexact<Temp_Boundary_Type>();
+      r = assign_r(t_bound, c_inhomogeneous_term, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+      r = neg_assign_r(t_bound, t_bound, ROUND_UP);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
+            i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
+        const Variable i_var = i.variable();
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.upper_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.lower_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
+      }
+      r = assign_r(t_a, a_k, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+      r = div_assign_r(t_bound, t_bound, t_a, ROUND_DOWN);
+      if (propagate_constraint_check_result(r, open))
+        goto next_k;
+
+      // Refine the lower bound of seq[k] with t_bound.
+      if (open == T_MAYBE
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
+      const Relation_Symbol rel
+        = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
+      seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
+      reset_empty_up_to_date();
+    }
+  next_k:
+    ;
+  }
+}
+
+#else // Alternative implementations for propagate_constraint_no_check.
+
+template <typename ITV>
+void
+Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
+  PPL_ASSERT(c.space_dimension() <= space_dimension());
+
+  dimension_type c_space_dim = c.space_dimension();
+  ITV k[c_space_dim];
+  ITV p[c_space_dim];
+  for (Constraint::expr_type::const_iterator i = c_e.begin(),
+        i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
+    const Variable i_var = i.variable();
+    k[i_var.id()] = *i;
+    ITV& p_i = p[i_var.id()];
+    p_i = seq[i_var.id()];
+    p_i.mul_assign(p_i, k[i_var.id()]);
+  }
+  const Coefficient& inhomogeneous_term = c.inhomogeneous_term();
+  for (Constraint::expr_type::const_iterator i = c_e.begin(),
+        i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
+    const Variable i_var = i.variable();
+    int sgn_coefficient_i = sgn(*i);
+    ITV q(inhomogeneous_term);
+    for (Constraint::expr_type::const_iterator j = c_e.begin(),
+          j_end = c_e.lower_bound(Variable(c_space_dim)); j != j_end; ++j) {
+      const Variable j_var = j.variable();
+      if (i_var == j_var)
+        continue;
+      q.add_assign(q, p[j_var.id()]);
+    }
+    q.div_assign(q, k[i_var.id()]);
+    q.neg_assign(q);
+    Relation_Symbol rel;
+    switch (c.type()) {
+    case Constraint::EQUALITY:
+      rel = EQUAL;
+      break;
+    case Constraint::NONSTRICT_INEQUALITY:
+      rel = (sgn_coefficient_i > 0) ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
+      break;
+    case Constraint::STRICT_INEQUALITY:
+      rel = (sgn_coefficient_i > 0) ? GREATER_THAN : LESS_THAN;
+      break;
+    }
+    seq[i_var.id()].add_constraint(i_constraint(rel, q));
+    // FIXME: could/should we exploit the return value of add_constraint
+    //        in case it is available?
+    // FIXME: should we instead be lazy and do not even bother about
+    //        the possibility the interval becomes empty apart from setting
+    //        empty_up_to_date = false?
+    if (seq[i_var.id()].is_empty()) {
+      set_empty();
+      break;
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+#endif // Alternative implementations for propagate_constraint_no_check.
+
+template <typename ITV>
+void
+Box<ITV>
+::propagate_constraints_no_check(const Constraint_System& cs,
+                                 const dimension_type max_iterations) {
+  const dimension_type space_dim = space_dimension();
+  PPL_ASSERT(cs.space_dimension() <= space_dim);
+
+  const Constraint_System::const_iterator cs_begin = cs.begin();
+  const Constraint_System::const_iterator cs_end = cs.end();
+  const dimension_type propagation_weight
+    = Implementation::num_constraints(cs) * space_dim;
+
+  Sequence copy;
+  bool changed;
+  dimension_type num_iterations = 0;
+  do {
+    WEIGHT_BEGIN();
+    ++num_iterations;
+    copy = seq;
+    for (Constraint_System::const_iterator i = cs_begin; i != cs_end; ++i)
+      propagate_constraint_no_check(*i);
+
+    WEIGHT_ADD_MUL(40, propagation_weight);
+    // Check if the client has requested abandoning all expensive
+    // computations.  If so, the exception specified by the client
+    // is thrown now.
+    maybe_abandon();
+
+    // NOTE: if max_iterations == 0 (i.e., no iteration limit is set)
+    // the following test will anyway trigger on wrap around.
+    if (num_iterations == max_iterations)
+      break;
+
+    changed = (copy != seq);
+  } while (changed);
+}
+
+template <typename ITV>
+void
+Box<ITV>::affine_image(const Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("affine_image(v, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("affine_image(v, e, d)", "e", expr);
+  // `var' should be one of the dimensions of the polyhedron.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dim < var_space_dim)
+    throw_dimension_incompatible("affine_image(v, e, d)", "v", var);
+
+  if (is_empty())
+    return;
+
+  Tmp_Interval_Type expr_value;
+  Tmp_Interval_Type temp0;
+  Tmp_Interval_Type temp1;
+  expr_value.assign(expr.inhomogeneous_term());
+  for (Linear_Expression::const_iterator i = expr.begin(),
+          i_end = expr.end(); i != i_end; ++i) {
+    temp0.assign(*i);
+    temp1.assign(seq[i.variable().id()]);
+    temp0.mul_assign(temp0, temp1);
+    expr_value.add_assign(expr_value, temp0);
+  }
+  if (denominator != 1) {
+    temp0.assign(denominator);
+    expr_value.div_assign(expr_value, temp0);
+  }
+  seq[var.id()].assign(expr_value);
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::affine_form_image(const Variable var,
+                            const Linear_Form<ITV>& lf) {
+
+  // Check that ITV has a floating point boundary type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<typename ITV::boundary_type>
+            ::is_exact, "Box<ITV>::affine_form_image(Variable, Linear_Form):"
+                        "ITV has not a floating point boundary type.");
+
+  // Dimension-compatibility checks.
+  const dimension_type space_dim = space_dimension();
+  const dimension_type lf_space_dim = lf.space_dimension();
+  if (space_dim < lf_space_dim)
+    throw_dimension_incompatible("affine_form_image(var, lf)", "lf", lf);
+  // `var' should be one of the dimensions of the polyhedron.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dim < var_space_dim)
+    throw_dimension_incompatible("affine_form_image(var, lf)", "var", var);
+
+  if (is_empty())
+    return;
+
+  // Intervalization of 'lf'.
+  ITV result = lf.inhomogeneous_term();
+  for (dimension_type i = 0; i < lf_space_dim; ++i) {
+    ITV current_addend = lf.coefficient(Variable(i));
+    const ITV& curr_int = seq[i];
+    current_addend *= curr_int;
+    result += current_addend;
+  }
+
+  seq[var.id()].assign(result);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::affine_preimage(const Variable var,
+                          const Linear_Expression& expr,
+                          Coefficient_traits::const_reference
+                          denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  const dimension_type x_space_dim = space_dimension();
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (x_space_dim < expr_space_dim)
+    throw_dimension_incompatible("affine_preimage(v, e, d)", "e", expr);
+  // `var' should be one of the dimensions of the polyhedron.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (x_space_dim < var_space_dim)
+    throw_dimension_incompatible("affine_preimage(v, e, d)", "v", var);
+
+  if (is_empty())
+    return;
+
+  const Coefficient& expr_v = expr.coefficient(var);
+  const bool invertible = (expr_v != 0);
+  if (!invertible) {
+    Tmp_Interval_Type expr_value;
+    Tmp_Interval_Type temp0;
+    Tmp_Interval_Type temp1;
+    expr_value.assign(expr.inhomogeneous_term());
+    for (Linear_Expression::const_iterator i = expr.begin(),
+            i_end = expr.end(); i != i_end; ++i) {
+      temp0.assign(*i);
+      temp1.assign(seq[i.variable().id()]);
+      temp0.mul_assign(temp0, temp1);
+      expr_value.add_assign(expr_value, temp0);
+    }
+    if (denominator != 1) {
+      temp0.assign(denominator);
+      expr_value.div_assign(expr_value, temp0);
+    }
+    ITV& x_seq_v = seq[var.id()];
+    expr_value.intersect_assign(x_seq_v);
+    if (expr_value.is_empty())
+      set_empty();
+    else
+      x_seq_v.assign(UNIVERSE);
+  }
+  else {
+    // The affine transformation is invertible.
+    // CHECKME: for efficiency, would it be meaningful to avoid
+    // the computation of inverse by partially evaluating the call
+    // to affine_image?
+    Linear_Expression inverse;
+    inverse -= expr;
+    inverse += (expr_v + denominator) * var;
+    affine_image(var, inverse, expr_v);
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>
+::bounded_affine_image(const Variable var,
+                       const Linear_Expression& lb_expr,
+                       const Linear_Expression& ub_expr,
+                       Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  const dimension_type space_dim = space_dimension();
+  // The dimension of `lb_expr' and `ub_expr' should not be
+  // greater than the dimension of `*this'.
+  const dimension_type lb_space_dim = lb_expr.space_dimension();
+  if (space_dim < lb_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "lb", lb_expr);
+  const dimension_type ub_space_dim = ub_expr.space_dimension();
+  if (space_dim < ub_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "ub", ub_expr);
+    // `var' should be one of the dimensions of the box.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dim < var_space_dim)
+    throw_dimension_incompatible("affine_image(v, e, d)", "v", var);
+
+  // Any image of an empty box is empty.
+  if (is_empty())
+    return;
+
+  // Add the constraint implied by the `lb_expr' and `ub_expr'.
+  if (denominator > 0)
+    refine_with_constraint(lb_expr <= ub_expr);
+  else
+    refine_with_constraint(lb_expr >= ub_expr);
+
+  // Check whether `var' occurs in `lb_expr' and/or `ub_expr'.
+  if (lb_expr.coefficient(var) == 0) {
+    // Here `var' can only occur in `ub_expr'.
+    generalized_affine_image(var,
+                             LESS_OR_EQUAL,
+                             ub_expr,
+                             denominator);
+    if (denominator > 0)
+      refine_with_constraint(lb_expr <= denominator*var);
+    else
+      refine_with_constraint(denominator*var <= lb_expr);
+  }
+  else if (ub_expr.coefficient(var) == 0) {
+    // Here `var' can only occur in `lb_expr'.
+    generalized_affine_image(var,
+                             GREATER_OR_EQUAL,
+                             lb_expr,
+                             denominator);
+    if (denominator > 0)
+      refine_with_constraint(denominator*var <= ub_expr);
+    else
+      refine_with_constraint(ub_expr <= denominator*var);
+  }
+  else {
+    // Here `var' occurs in both `lb_expr' and `ub_expr'.  As boxes
+    // can only use the non-relational constraints, we find the
+    // maximum/minimum values `ub_expr' and `lb_expr' obtain with the
+    // box and use these instead of the `ub-expr' and `lb-expr'.
+    PPL_DIRTY_TEMP(Coefficient, max_numer);
+    PPL_DIRTY_TEMP(Coefficient, max_denom);
+    bool max_included;
+    PPL_DIRTY_TEMP(Coefficient, min_numer);
+    PPL_DIRTY_TEMP(Coefficient, min_denom);
+    bool min_included;
+    ITV& seq_v = seq[var.id()];
+    if (maximize(ub_expr, max_numer, max_denom, max_included)) {
+      if (minimize(lb_expr, min_numer, min_denom, min_included)) {
+        // The `ub_expr' has a maximum value and the `lb_expr'
+        // has a minimum value for the box.
+        // Set the bounds for `var' using the minimum for `lb_expr'.
+        min_denom *= denominator;
+        PPL_DIRTY_TEMP(mpq_class, q1);
+        PPL_DIRTY_TEMP(mpq_class, q2);
+        assign_r(q1.get_num(), min_numer, ROUND_NOT_NEEDED);
+        assign_r(q1.get_den(), min_denom, ROUND_NOT_NEEDED);
+        q1.canonicalize();
+        // Now make the maximum of lb_expr the upper bound.  If the
+        // maximum is not at a box point, then inequality is strict.
+        max_denom *= denominator;
+        assign_r(q2.get_num(), max_numer, ROUND_NOT_NEEDED);
+        assign_r(q2.get_den(), max_denom, ROUND_NOT_NEEDED);
+        q2.canonicalize();
+
+        if (denominator > 0) {
+          Relation_Symbol gr = min_included ? GREATER_OR_EQUAL : GREATER_THAN;
+          Relation_Symbol lr = max_included ? LESS_OR_EQUAL : LESS_THAN;
+          seq_v.build(i_constraint(gr, q1), i_constraint(lr, q2));
+        }
+        else {
+          Relation_Symbol gr = max_included ? GREATER_OR_EQUAL : GREATER_THAN;
+          Relation_Symbol lr = min_included ? LESS_OR_EQUAL : LESS_THAN;
+          seq_v.build(i_constraint(gr, q2), i_constraint(lr, q1));
+        }
+      }
+      else {
+        // The `ub_expr' has a maximum value but the `lb_expr'
+        // has no minimum value for the box.
+        // Set the bounds for `var' using the maximum for `lb_expr'.
+        PPL_DIRTY_TEMP(mpq_class, q);
+        max_denom *= denominator;
+        assign_r(q.get_num(), max_numer, ROUND_NOT_NEEDED);
+        assign_r(q.get_den(), max_denom, ROUND_NOT_NEEDED);
+        q.canonicalize();
+        Relation_Symbol rel = (denominator > 0)
+          ? (max_included ? LESS_OR_EQUAL : LESS_THAN)
+          : (max_included ? GREATER_OR_EQUAL : GREATER_THAN);
+        seq_v.build(i_constraint(rel, q));
+      }
+    }
+    else if (minimize(lb_expr, min_numer, min_denom, min_included)) {
+        // The `ub_expr' has no maximum value but the `lb_expr'
+        // has a minimum value for the box.
+        // Set the bounds for `var' using the minimum for `lb_expr'.
+        min_denom *= denominator;
+        PPL_DIRTY_TEMP(mpq_class, q);
+        assign_r(q.get_num(), min_numer, ROUND_NOT_NEEDED);
+        assign_r(q.get_den(), min_denom, ROUND_NOT_NEEDED);
+        q.canonicalize();
+
+        Relation_Symbol rel = (denominator > 0)
+          ? (min_included ? GREATER_OR_EQUAL : GREATER_THAN)
+          : (min_included ? LESS_OR_EQUAL : LESS_THAN);
+        seq_v.build(i_constraint(rel, q));
+    }
+    else {
+      // The `ub_expr' has no maximum value and the `lb_expr'
+      // has no minimum value for the box.
+      // So we set the bounds to be unbounded.
+      seq_v.assign(UNIVERSE);
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>
+::bounded_affine_preimage(const Variable var,
+                          const Linear_Expression& lb_expr,
+                          const Linear_Expression& ub_expr,
+                          Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  const dimension_type space_dim = space_dimension();
+  if (denominator == 0)
+    throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // `var' should be one of the dimensions of the polyhedron.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dim < var_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "v", var);
+  // The dimension of `lb_expr' and `ub_expr' should not be
+  // greater than the dimension of `*this'.
+  const dimension_type lb_space_dim = lb_expr.space_dimension();
+  if (space_dim < lb_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "lb", lb_expr);
+  const dimension_type ub_space_dim = ub_expr.space_dimension();
+  if (space_dim < ub_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "ub", ub_expr);
+
+  // Any preimage of an empty polyhedron is empty.
+  if (marked_empty())
+    return;
+
+  const bool negative_denom = (denominator < 0);
+  const Coefficient& lb_var_coeff = lb_expr.coefficient(var);
+  const Coefficient& ub_var_coeff = ub_expr.coefficient(var);
+
+  // If the implied constraint between `ub_expr and `lb_expr' is
+  // independent of `var', then impose it now.
+  if (lb_var_coeff == ub_var_coeff) {
+    if (negative_denom)
+      refine_with_constraint(lb_expr >= ub_expr);
+    else
+      refine_with_constraint(lb_expr <= ub_expr);
+  }
+
+  ITV& seq_var = seq[var.id()];
+  if (!seq_var.is_universe()) {
+    // We want to work with a positive denominator,
+    // so the sign and its (unsigned) value are separated.
+    PPL_DIRTY_TEMP_COEFFICIENT(pos_denominator);
+    pos_denominator = denominator;
+    if (negative_denom)
+      neg_assign(pos_denominator, pos_denominator);
+    // Store all the information about the upper and lower bounds
+    // for `var' before making this interval unbounded.
+    bool open_lower = seq_var.lower_is_open();
+    bool unbounded_lower = seq_var.lower_is_boundary_infinity();
+    PPL_DIRTY_TEMP(mpq_class, q_seq_var_lower);
+    PPL_DIRTY_TEMP(Coefficient, numer_lower);
+    PPL_DIRTY_TEMP(Coefficient, denom_lower);
+    if (!unbounded_lower) {
+      assign_r(q_seq_var_lower, seq_var.lower(), ROUND_NOT_NEEDED);
+      assign_r(numer_lower, q_seq_var_lower.get_num(), ROUND_NOT_NEEDED);
+      assign_r(denom_lower, q_seq_var_lower.get_den(), ROUND_NOT_NEEDED);
+      if (negative_denom)
+        neg_assign(denom_lower, denom_lower);
+      numer_lower *= pos_denominator;
+      seq_var.lower_extend();
+    }
+    bool open_upper = seq_var.upper_is_open();
+    bool unbounded_upper = seq_var.upper_is_boundary_infinity();
+    PPL_DIRTY_TEMP(mpq_class, q_seq_var_upper);
+    PPL_DIRTY_TEMP(Coefficient, numer_upper);
+    PPL_DIRTY_TEMP(Coefficient, denom_upper);
+    if (!unbounded_upper) {
+      assign_r(q_seq_var_upper, seq_var.upper(), ROUND_NOT_NEEDED);
+      assign_r(numer_upper, q_seq_var_upper.get_num(), ROUND_NOT_NEEDED);
+      assign_r(denom_upper, q_seq_var_upper.get_den(), ROUND_NOT_NEEDED);
+      if (negative_denom)
+        neg_assign(denom_upper, denom_upper);
+      numer_upper *= pos_denominator;
+      seq_var.upper_extend();
+    }
+
+    if (!unbounded_lower) {
+      // `lb_expr' is revised by removing the `var' component,
+      // multiplying by `-' denominator of the lower bound for `var',
+      // and adding the lower bound for `var' to the inhomogeneous term.
+      Linear_Expression revised_lb_expr(ub_expr);
+      revised_lb_expr -= ub_var_coeff * var;
+      PPL_DIRTY_TEMP(Coefficient, d);
+      neg_assign(d, denom_lower);
+      revised_lb_expr *= d;
+      revised_lb_expr += numer_lower;
+
+      // Find the minimum value for the revised lower bound expression
+      // and use this to refine the appropriate bound.
+      bool included;
+      PPL_DIRTY_TEMP(Coefficient, denom);
+      if (minimize(revised_lb_expr, numer_lower, denom, included)) {
+        denom_lower *= (denom * ub_var_coeff);
+        PPL_DIRTY_TEMP(mpq_class, q);
+        assign_r(q.get_num(), numer_lower, ROUND_NOT_NEEDED);
+        assign_r(q.get_den(), denom_lower, ROUND_NOT_NEEDED);
+        q.canonicalize();
+        if (!included)
+          open_lower = true;
+        Relation_Symbol rel;
+        if ((ub_var_coeff >= 0) ? !negative_denom : negative_denom)
+          rel = open_lower ? GREATER_THAN : GREATER_OR_EQUAL;
+        else
+          rel = open_lower ? LESS_THAN : LESS_OR_EQUAL;
+        seq_var.add_constraint(i_constraint(rel, q));
+        if (seq_var.is_empty()) {
+          set_empty();
+          return;
+        }
+      }
+    }
+
+    if (!unbounded_upper) {
+      // `ub_expr' is revised by removing the `var' component,
+      // multiplying by `-' denominator of the upper bound for `var',
+      // and adding the upper bound for `var' to the inhomogeneous term.
+      Linear_Expression revised_ub_expr(lb_expr);
+      revised_ub_expr -= lb_var_coeff * var;
+      PPL_DIRTY_TEMP(Coefficient, d);
+      neg_assign(d, denom_upper);
+      revised_ub_expr *= d;
+      revised_ub_expr += numer_upper;
+
+      // Find the maximum value for the revised upper bound expression
+      // and use this to refine the appropriate bound.
+      bool included;
+      PPL_DIRTY_TEMP(Coefficient, denom);
+      if (maximize(revised_ub_expr, numer_upper, denom, included)) {
+        denom_upper *= (denom * lb_var_coeff);
+        PPL_DIRTY_TEMP(mpq_class, q);
+        assign_r(q.get_num(), numer_upper, ROUND_NOT_NEEDED);
+        assign_r(q.get_den(), denom_upper, ROUND_NOT_NEEDED);
+        q.canonicalize();
+        if (!included)
+          open_upper = true;
+        Relation_Symbol rel;
+        if ((lb_var_coeff >= 0) ? !negative_denom : negative_denom)
+          rel = open_upper ? LESS_THAN : LESS_OR_EQUAL;
+        else
+          rel = open_upper ? GREATER_THAN : GREATER_OR_EQUAL;
+        seq_var.add_constraint(i_constraint(rel, q));
+        if (seq_var.is_empty()) {
+          set_empty();
+          return;
+        }
+      }
+    }
+  }
+
+  // If the implied constraint between `ub_expr and `lb_expr' is
+  // dependent on `var', then impose on the new box.
+  if (lb_var_coeff != ub_var_coeff) {
+    if (denominator > 0)
+      refine_with_constraint(lb_expr <= ub_expr);
+    else
+      refine_with_constraint(lb_expr >= ub_expr);
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>
+::generalized_affine_image(const Variable var,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  const dimension_type space_dim = space_dimension();
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  if (space_dim < expr.space_dimension())
+    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
+                                 "e", expr);
+  // `var' should be one of the dimensions of the box.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dim < var_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
+                                 "v", var);
+
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
+                           "r is the disequality relation symbol");
+
+  // First compute the affine image.
+  affine_image(var, expr, denominator);
+
+  if (relsym == EQUAL)
+    // The affine relation is indeed an affine function.
+    return;
+
+  // Any image of an empty box is empty.
+  if (is_empty())
+    return;
+
+  ITV& seq_var = seq[var.id()];
+  switch (relsym) {
+  case LESS_OR_EQUAL:
+    seq_var.lower_extend();
+    break;
+  case LESS_THAN:
+    seq_var.lower_extend();
+    if (!seq_var.upper_is_boundary_infinity())
+      seq_var.remove_sup();
+    break;
+  case GREATER_OR_EQUAL:
+    seq_var.upper_extend();
+    break;
+  case GREATER_THAN:
+    seq_var.upper_extend();
+    if (!seq_var.lower_is_boundary_infinity())
+      seq_var.remove_inf();
+    break;
+  default:
+    // The EQUAL and NOT_EQUAL cases have been already dealt with.
+    PPL_UNREACHABLE;
+    break;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>
+::generalized_affine_preimage(const Variable var,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator)
+{
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "d == 0");
+
+  // Dimension-compatibility checks.
+  const dimension_type space_dim = space_dimension();
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  if (space_dim < expr.space_dimension())
+    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
+                                 "e", expr);
+  // `var' should be one of the dimensions of the box.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dim < var_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
+                                 "v", var);
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "r is the disequality relation symbol");
+
+  // Check whether the affine relation is indeed an affine function.
+  if (relsym == EQUAL) {
+    affine_preimage(var, expr, denominator);
+    return;
+  }
+
+  // Compute the reversed relation symbol to simplify later coding.
+  Relation_Symbol reversed_relsym;
+  switch (relsym) {
+  case LESS_THAN:
+    reversed_relsym = GREATER_THAN;
+    break;
+  case LESS_OR_EQUAL:
+    reversed_relsym = GREATER_OR_EQUAL;
+    break;
+  case GREATER_OR_EQUAL:
+    reversed_relsym = LESS_OR_EQUAL;
+    break;
+  case GREATER_THAN:
+    reversed_relsym = LESS_THAN;
+    break;
+  default:
+    // The EQUAL and NOT_EQUAL cases have been already dealt with.
+    PPL_UNREACHABLE;
+    break;
+  }
+
+  // Check whether the preimage of this affine relation can be easily
+  // computed as the image of its inverse relation.
+  const Coefficient& var_coefficient = expr.coefficient(var);
+  if (var_coefficient != 0) {
+    Linear_Expression inverse_expr
+      = expr - (denominator + var_coefficient) * var;
+    PPL_DIRTY_TEMP_COEFFICIENT(inverse_denominator);
+    neg_assign(inverse_denominator, var_coefficient);
+    Relation_Symbol inverse_relsym
+      = (sgn(denominator) == sgn(inverse_denominator))
+      ? relsym
+      : reversed_relsym;
+    generalized_affine_image(var, inverse_relsym, inverse_expr,
+                             inverse_denominator);
+    return;
+  }
+
+  // Here `var_coefficient == 0', so that the preimage cannot
+  // be easily computed by inverting the affine relation.
+  // Shrink the box by adding the constraint induced
+  // by the affine relation.
+  // First, compute the maximum and minimum value reached by
+  // `denominator*var' on the box as we need to use non-relational
+  // expressions.
+  PPL_DIRTY_TEMP(Coefficient, max_numer);
+  PPL_DIRTY_TEMP(Coefficient, max_denom);
+  bool max_included;
+  bool bound_above = maximize(denominator*var, max_numer, max_denom, max_included);
+  PPL_DIRTY_TEMP(Coefficient, min_numer);
+  PPL_DIRTY_TEMP(Coefficient, min_denom);
+  bool min_included;
+  bool bound_below = minimize(denominator*var, min_numer, min_denom, min_included);
+  // Use the correct relation symbol
+  const Relation_Symbol corrected_relsym
+    = (denominator > 0) ? relsym : reversed_relsym;
+  // Revise the expression to take into account the denominator of the
+  // maximum/minimum value for `var'.
+  Linear_Expression revised_expr;
+  PPL_DIRTY_TEMP_COEFFICIENT(d);
+  if (corrected_relsym == LESS_THAN || corrected_relsym == LESS_OR_EQUAL) {
+    if (bound_below) {
+      revised_expr = expr;
+      revised_expr.set_inhomogeneous_term(Coefficient_zero());
+      revised_expr *= d;
+    }
+  }
+  else {
+    if (bound_above) {
+      revised_expr = expr;
+      revised_expr.set_inhomogeneous_term(Coefficient_zero());
+      revised_expr *= max_denom;
+    }
+  }
+
+  switch (corrected_relsym) {
+  case LESS_THAN:
+    if (bound_below)
+      refine_with_constraint(min_numer < revised_expr);
+    break;
+  case LESS_OR_EQUAL:
+    if (bound_below)
+      (min_included)
+        ? refine_with_constraint(min_numer <= revised_expr)
+        : refine_with_constraint(min_numer < revised_expr);
+    break;
+  case GREATER_OR_EQUAL:
+    if (bound_above)
+      (max_included)
+        ? refine_with_constraint(max_numer >= revised_expr)
+        : refine_with_constraint(max_numer > revised_expr);
+    break;
+  case GREATER_THAN:
+    if (bound_above)
+      refine_with_constraint(max_numer > revised_expr);
+    break;
+  default:
+    // The EQUAL and NOT_EQUAL cases have been already dealt with.
+    PPL_UNREACHABLE;
+    break;
+  }
+  // If the shrunk box is empty, its preimage is empty too.
+  if (is_empty())
+    return;
+  ITV& seq_v = seq[var.id()];
+  seq_v.assign(UNIVERSE);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>
+::generalized_affine_image(const Linear_Expression& lhs,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& rhs) {
+  // Dimension-compatibility checks.
+  // The dimension of `lhs' should not be greater than the dimension
+  // of `*this'.
+  dimension_type lhs_space_dim = lhs.space_dimension();
+  const dimension_type space_dim = space_dimension();
+  if (space_dim < lhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e1", lhs);
+  // The dimension of `rhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type rhs_space_dim = rhs.space_dimension();
+  if (space_dim < rhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e2", rhs);
+
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
+                           "r is the disequality relation symbol");
+
+  // Any image of an empty box is empty.
+  if (marked_empty())
+    return;
+
+  // Compute the maximum and minimum value reached by the rhs on the box.
+  PPL_DIRTY_TEMP(Coefficient, max_numer);
+  PPL_DIRTY_TEMP(Coefficient, max_denom);
+  bool max_included;
+  bool max_rhs = maximize(rhs, max_numer, max_denom, max_included);
+  PPL_DIRTY_TEMP(Coefficient, min_numer);
+  PPL_DIRTY_TEMP(Coefficient, min_denom);
+  bool min_included;
+  bool min_rhs = minimize(rhs, min_numer, min_denom, min_included);
+
+  // Check whether there is 0, 1 or more than one variable in the lhs
+  // and record the variable with the highest dimension; set the box
+  // intervals to be unbounded for all other dimensions with non-zero
+  // coefficients in the lhs.
+  bool has_var = false;
+  dimension_type has_var_id = lhs.last_nonzero();
+
+  if (has_var_id != 0) {
+    has_var = true;
+    --has_var_id;
+    dimension_type other_var = lhs.first_nonzero(1, has_var_id + 1);
+    --other_var;
+    if (other_var != has_var_id) {
+      // There is more than one dimension with non-zero coefficient, so
+      // we cannot have any information about the dimensions in the lhs.
+      ITV& seq_var = seq[has_var_id];
+      seq_var.assign(UNIVERSE);
+      // Since all but the highest dimension with non-zero coefficient
+      // in the lhs have been set unbounded, it remains to set the
+      // highest dimension in the lhs unbounded.
+      ITV& seq_i = seq[other_var];
+      seq_i.assign(UNIVERSE);
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+
+  if (has_var) {
+    // There is exactly one dimension with non-zero coefficient.
+    ITV& seq_var = seq[has_var_id];
+
+    // Compute the new bounds for this dimension defined by the rhs
+    // expression.
+    const Coefficient& inhomo = lhs.inhomogeneous_term();
+    const Coefficient& coeff = lhs.coefficient(Variable(has_var_id));
+    PPL_DIRTY_TEMP(mpq_class, q_max);
+    PPL_DIRTY_TEMP(mpq_class, q_min);
+    if (max_rhs) {
+      max_numer -= inhomo * max_denom;
+      max_denom *= coeff;
+      assign_r(q_max.get_num(), max_numer, ROUND_NOT_NEEDED);
+      assign_r(q_max.get_den(), max_denom, ROUND_NOT_NEEDED);
+      q_max.canonicalize();
+    }
+    if (min_rhs) {
+      min_numer -= inhomo * min_denom;
+      min_denom *= coeff;
+      assign_r(q_min.get_num(), min_numer, ROUND_NOT_NEEDED);
+      assign_r(q_min.get_den(), min_denom, ROUND_NOT_NEEDED);
+      q_min.canonicalize();
+    }
+
+    // The choice as to which bounds should be set depends on the sign
+    // of the coefficient of the dimension `has_var_id' in the lhs.
+    if (coeff > 0)
+      // The coefficient of the dimension in the lhs is positive.
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        if (max_rhs) {
+          Relation_Symbol rel = max_included ? LESS_OR_EQUAL : LESS_THAN;
+          seq_var.build(i_constraint(rel, q_max));
+        }
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      case LESS_THAN:
+        if (max_rhs)
+          seq_var.build(i_constraint(LESS_THAN, q_max));
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      case EQUAL:
+        {
+          I_Constraint<mpq_class> l;
+          I_Constraint<mpq_class> u;
+          if (max_rhs)
+            u.set(max_included ? LESS_OR_EQUAL : LESS_THAN, q_max);
+          if (min_rhs)
+            l.set(min_included ? GREATER_OR_EQUAL : GREATER_THAN, q_min);
+          seq_var.build(l, u);
+          break;
+        }
+      case GREATER_OR_EQUAL:
+        if (min_rhs) {
+          Relation_Symbol rel = min_included ? GREATER_OR_EQUAL : GREATER_THAN;
+          seq_var.build(i_constraint(rel, q_min));
+        }
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      case GREATER_THAN:
+        if (min_rhs)
+          seq_var.build(i_constraint(GREATER_THAN, q_min));
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      default:
+        // The NOT_EQUAL case has been already dealt with.
+        PPL_UNREACHABLE;
+        break;
+      }
+    else
+      // The coefficient of the dimension in the lhs is negative.
+      switch (relsym) {
+      case GREATER_OR_EQUAL:
+        if (min_rhs) {
+          Relation_Symbol rel = min_included ? LESS_OR_EQUAL : LESS_THAN;
+          seq_var.build(i_constraint(rel, q_min));
+        }
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      case GREATER_THAN:
+        if (min_rhs)
+          seq_var.build(i_constraint(LESS_THAN, q_min));
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      case EQUAL:
+        {
+          I_Constraint<mpq_class> l;
+          I_Constraint<mpq_class> u;
+          if (max_rhs)
+            l.set(max_included ? GREATER_OR_EQUAL : GREATER_THAN, q_max);
+          if (min_rhs)
+            u.set(min_included ? LESS_OR_EQUAL : LESS_THAN, q_min);
+          seq_var.build(l, u);
+          break;
+        }
+      case LESS_OR_EQUAL:
+        if (max_rhs) {
+          Relation_Symbol rel = max_included ? GREATER_OR_EQUAL : GREATER_THAN;
+          seq_var.build(i_constraint(rel, q_max));
+        }
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      case LESS_THAN:
+        if (max_rhs)
+          seq_var.build(i_constraint(GREATER_THAN, q_max));
+        else
+          seq_var.assign(UNIVERSE);
+        break;
+      default:
+        // The NOT_EQUAL case has been already dealt with.
+        PPL_UNREACHABLE;
+        break;
+      }
+  }
+
+  else {
+    // The lhs is a constant value, so we just need to add the
+    // appropriate constraint.
+    const Coefficient& inhomo = lhs.inhomogeneous_term();
+    switch (relsym) {
+    case LESS_THAN:
+      refine_with_constraint(inhomo < rhs);
+      break;
+    case LESS_OR_EQUAL:
+      refine_with_constraint(inhomo <= rhs);
+      break;
+    case EQUAL:
+      refine_with_constraint(inhomo == rhs);
+      break;
+    case GREATER_OR_EQUAL:
+      refine_with_constraint(inhomo >= rhs);
+      break;
+    case GREATER_THAN:
+      refine_with_constraint(inhomo > rhs);
+      break;
+    default:
+      // The NOT_EQUAL case has been already dealt with.
+      PPL_UNREACHABLE;
+      break;
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+void
+Box<ITV>::generalized_affine_preimage(const Linear_Expression& lhs,
+                                      const Relation_Symbol relsym,
+                                      const Linear_Expression& rhs) {
+  // Dimension-compatibility checks.
+  // The dimension of `lhs' should not be greater than the dimension
+  // of `*this'.
+  dimension_type lhs_space_dim = lhs.space_dimension();
+  const dimension_type space_dim = space_dimension();
+  if (space_dim < lhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e1", lhs);
+  // The dimension of `rhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type rhs_space_dim = rhs.space_dimension();
+  if (space_dim < rhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e2", rhs);
+
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
+                           "r is the disequality relation symbol");
+
+  // Any image of an empty box is empty.
+  if (marked_empty())
+    return;
+
+  // For any dimension occurring in the lhs, swap and change the sign
+  // of this component for the rhs and lhs.  Then use these in a call
+  // to generalized_affine_image/3.
+  Linear_Expression revised_lhs = lhs;
+  Linear_Expression revised_rhs = rhs;
+  for (Linear_Expression::const_iterator i = lhs.begin(),
+         i_end = lhs.end(); i != i_end; ++i) {
+    const Variable var = i.variable();
+    PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+    tmp = *i;
+    tmp += rhs.coefficient(var);
+    sub_mul_assign(revised_rhs, tmp, var);
+    sub_mul_assign(revised_lhs, tmp, var);
+  }
+  generalized_affine_image(revised_lhs, relsym, revised_rhs);
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+template <typename T, typename Iterator>
+typename Enable_If<Is_Same<T, Box<ITV> >::value
+                   && Is_Same_Or_Derived<Interval_Base, ITV>::value,
+                   void>::type
+Box<ITV>::CC76_widening_assign(const T& y, Iterator first, Iterator last) {
+  if (y.is_empty())
+    return;
+
+  for (dimension_type i = seq.size(); i-- > 0; )
+    seq[i].CC76_widening_assign(y.seq[i], first, last);
+
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+template <typename T>
+typename Enable_If<Is_Same<T, Box<ITV> >::value
+                   && Is_Same_Or_Derived<Interval_Base, ITV>::value,
+                   void>::type
+Box<ITV>::CC76_widening_assign(const T& y, unsigned* tp) {
+  static typename ITV::boundary_type stop_points[] = {
+    typename ITV::boundary_type(-2),
+    typename ITV::boundary_type(-1),
+    typename ITV::boundary_type(0),
+    typename ITV::boundary_type(1),
+    typename ITV::boundary_type(2)
+  };
+
+  Box& x = *this;
+  // If there are tokens available, work on a temporary copy.
+  if (tp != 0 && *tp > 0) {
+    Box<ITV> x_tmp(x);
+    x_tmp.CC76_widening_assign(y, 0);
+    // If the widening was not precise, use one of the available tokens.
+    if (!x.contains(x_tmp))
+      --(*tp);
+    return;
+  }
+  x.CC76_widening_assign(y,
+                         stop_points,
+                         stop_points
+                         + sizeof(stop_points)/sizeof(stop_points[0]));
+}
+
+template <typename ITV>
+void
+Box<ITV>::get_limiting_box(const Constraint_System& cs,
+                           Box& limiting_box) const {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(cs.space_dimension() <= space_dimension());
+
+  for (Constraint_System::const_iterator cs_i = cs.begin(),
+         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
+    const Constraint& c = *cs_i;
+    dimension_type c_num_vars = 0;
+    dimension_type c_only_var = 0;
+    // Constraints that are not interval constraints are ignored.
+    if (!Box_Helpers::extract_interval_constraint(c, c_num_vars, c_only_var))
+      continue;
+    // Trivial constraints are ignored.
+    if (c_num_vars != 0) {
+      // c is a non-trivial interval constraint.
+      // add interval constraint to limiting box
+      const Coefficient& n = c.inhomogeneous_term();
+      const Coefficient& d = c.coefficient(Variable(c_only_var));
+      if (interval_relation(seq[c_only_var], c.type(), n, d)
+          == Poly_Con_Relation::is_included())
+        limiting_box.add_interval_constraint_no_check(c_only_var, c.type(),
+                                                      n, d);
+    }
+  }
+}
+
+template <typename ITV>
+void
+Box<ITV>::limited_CC76_extrapolation_assign(const Box& y,
+                                            const Constraint_System& cs,
+                                            unsigned* tp) {
+  Box& x = *this;
+  const dimension_type space_dim = x.space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)",
+                                 y);
+  // `cs' must be dimension-compatible with the two boxes.
+  const dimension_type cs_space_dim = cs.space_dimension();
+  if (space_dim < cs_space_dim)
+    throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");
+
+  // The limited CC76-extrapolation between two boxes in a
+  // zero-dimensional space is also a zero-dimensional box
+  if (space_dim == 0)
+    return;
+
+  // Assume `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  // Build a limiting box using all the constraints in cs
+  // that are satisfied by *this.
+  Box limiting_box(space_dim, UNIVERSE);
+  get_limiting_box(cs, limiting_box);
+
+  x.CC76_widening_assign(y, tp);
+
+  // Intersect the widened box with the limiting box.
+  intersection_assign(limiting_box);
+}
+
+template <typename ITV>
+template <typename T>
+typename Enable_If<Is_Same<T, Box<ITV> >::value
+                   && Is_Same_Or_Derived<Interval_Base, ITV>::value,
+                   void>::type
+Box<ITV>::CC76_narrowing_assign(const T& y) {
+  const dimension_type space_dim = space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dimension())
+    throw_dimension_incompatible("CC76_narrowing_assign(y)", y);
+
+  // Assume `*this' is contained in or equal to `y'.
+  PPL_EXPECT_HEAVY(copy_contains(y, *this));
+
+  // If both boxes are zero-dimensional,
+  // since `y' contains `*this', we simply return `*this'.
+  if (space_dim == 0)
+    return;
+
+  // If `y' is empty, since `y' contains `this', `*this' is empty too.
+  if (y.is_empty())
+    return;
+  // If `*this' is empty, we return.
+  if (is_empty())
+    return;
+
+  // Replace each constraint in `*this' by the corresponding constraint
+  // in `y' if the corresponding inhomogeneous terms are both finite.
+  for (dimension_type i = space_dim; i-- > 0; ) {
+    ITV& x_i = seq[i];
+    const ITV& y_i = y.seq[i];
+    if (!x_i.lower_is_boundary_infinity()
+        && !y_i.lower_is_boundary_infinity()
+        && x_i.lower() != y_i.lower())
+      x_i.lower() = y_i.lower();
+    if (!x_i.upper_is_boundary_infinity()
+        && !y_i.upper_is_boundary_infinity()
+        && x_i.upper() != y_i.upper())
+      x_i.upper() = y_i.upper();
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename ITV>
+Constraint_System
+Box<ITV>::constraints() const {
+  const dimension_type space_dim = space_dimension();
+  Constraint_System cs;
+  cs.set_space_dimension(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cs = Constraint_System::zero_dim_empty();
+    return cs;
+  }
+
+  if (marked_empty()) {
+    cs.insert(Constraint::zero_dim_false());
+    return cs;
+  }
+
+  for (dimension_type k = 0; k < space_dim; ++k) {
+    const Variable v_k = Variable(k);
+    PPL_DIRTY_TEMP(Coefficient, n);
+    PPL_DIRTY_TEMP(Coefficient, d);
+    bool closed = false;
+    if (has_lower_bound(v_k, n, d, closed)) {
+      if (closed)
+        cs.insert(d * v_k >= n);
+      else
+        cs.insert(d * v_k > n);
+    }
+    if (has_upper_bound(v_k, n, d, closed)) {
+      if (closed)
+        cs.insert(d * v_k <= n);
+      else
+        cs.insert(d * v_k < n);
+    }
+  }
+  return cs;
+}
+
+template <typename ITV>
+Constraint_System
+Box<ITV>::minimized_constraints() const {
+  const dimension_type space_dim = space_dimension();
+  Constraint_System cs;
+  cs.set_space_dimension(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cs = Constraint_System::zero_dim_empty();
+    return cs;
+  }
+
+  // Make sure emptiness is detected.
+  if (is_empty()) {
+    cs.insert(Constraint::zero_dim_false());
+    return cs;
+  }
+
+  for (dimension_type k = 0; k < space_dim; ++k) {
+    const Variable v_k = Variable(k);
+    PPL_DIRTY_TEMP(Coefficient, n);
+    PPL_DIRTY_TEMP(Coefficient, d);
+    bool closed = false;
+    if (has_lower_bound(v_k, n, d, closed)) {
+      if (closed)
+        // Make sure equality constraints are detected.
+        if (seq[k].is_singleton()) {
+          cs.insert(d * v_k == n);
+          continue;
+        }
+        else
+          cs.insert(d * v_k >= n);
+      else
+        cs.insert(d * v_k > n);
+    }
+    if (has_upper_bound(v_k, n, d, closed)) {
+      if (closed)
+        cs.insert(d * v_k <= n);
+      else
+        cs.insert(d * v_k < n);
+    }
+  }
+  return cs;
+}
+
+template <typename ITV>
+Congruence_System
+Box<ITV>::congruences() const {
+  const dimension_type space_dim = space_dimension();
+  Congruence_System cgs(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cgs = Congruence_System::zero_dim_empty();
+    return cgs;
+  }
+
+  // Make sure emptiness is detected.
+  if (is_empty()) {
+    cgs.insert(Congruence::zero_dim_false());
+    return cgs;
+  }
+
+  for (dimension_type k = 0; k < space_dim; ++k) {
+    const Variable v_k = Variable(k);
+    PPL_DIRTY_TEMP(Coefficient, n);
+    PPL_DIRTY_TEMP(Coefficient, d);
+    bool closed = false;
+    if (has_lower_bound(v_k, n, d, closed) && closed)
+      // Make sure equality congruences are detected.
+      if (seq[k].is_singleton())
+        cgs.insert((d * v_k %= n) / 0);
+  }
+  return cgs;
+}
+
+template <typename ITV>
+memory_size_type
+Box<ITV>::external_memory_in_bytes() const {
+  memory_size_type n = seq.capacity() * sizeof(ITV);
+  for (dimension_type k = seq.size(); k-- > 0; )
+    n += seq[k].external_memory_in_bytes();
+  return n;
+}
+
+/*! \relates Parma_Polyhedra_Library::Box */
+template <typename ITV>
+std::ostream&
+IO_Operators::operator<<(std::ostream& s, const Box<ITV>& box) {
+  if (box.is_empty())
+    s << "false";
+  else if (box.is_universe())
+    s << "true";
+  else
+    for (dimension_type k = 0,
+           space_dim = box.space_dimension(); k < space_dim; ) {
+      s << Variable(k) << " in " << box[k];
+      ++k;
+      if (k < space_dim)
+        s << ", ";
+      else
+        break;
+    }
+  return s;
+}
+
+template <typename ITV>
+void
+Box<ITV>::ascii_dump(std::ostream& s) const {
+  const char separator = ' ';
+  status.ascii_dump(s);
+  const dimension_type space_dim = space_dimension();
+  s << "space_dim" << separator << space_dim;
+  s << "\n";
+  for (dimension_type i = 0; i < space_dim;  ++i)
+    seq[i].ascii_dump(s);
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(ITV, Box<ITV>)
+
+template <typename ITV>
+bool
+Box<ITV>::ascii_load(std::istream& s) {
+  if (!status.ascii_load(s))
+    return false;
+
+  std::string str;
+  dimension_type space_dim;
+  if (!(s >> str) || str != "space_dim")
+    return false;
+  if (!(s >> space_dim))
+    return false;
+
+  seq.clear();
+  ITV seq_i;
+  for (dimension_type i = 0; i < space_dim;  ++i) {
+    if (seq_i.ascii_load(s))
+      seq.push_back(seq_i);
+    else
+      return false;
+  }
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const Box& y) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << this->space_dimension()
+    << ", y->space_dimension() == " << y.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>
+::throw_dimension_incompatible(const char* method,
+                               dimension_type required_dim) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", required dimension == " << required_dim << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const Constraint& c) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", c->space_dimension == " << c.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const Congruence& cg) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", cg->space_dimension == " << cg.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const Constraint_System& cs) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", cs->space_dimension == " << cs.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const Congruence_System& cgs) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", cgs->space_dimension == " << cgs.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const Generator& g) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", g->space_dimension == " << g.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_constraint_incompatible(const char* method) {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "the constraint is incompatible.";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_expression_too_complex(const char* method,
+                                       const Linear_Expression& le) {
+  using namespace IO_Operators;
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << le << " is too complex.";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const char* le_name,
+                                       const Linear_Expression& le) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << "this->space_dimension() == " << space_dimension()
+    << ", " << le_name << "->space_dimension() == "
+    << le.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+template <typename C>
+void
+Box<ITV>::throw_dimension_incompatible(const char* method,
+                                       const char* lf_name,
+                                       const Linear_Form<C>& lf) const {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", " << lf_name << "->space_dimension() == "
+    << lf.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename ITV>
+void
+Box<ITV>::throw_invalid_argument(const char* method, const char* reason) {
+  std::ostringstream s;
+  s << "PPL::Box::" << method << ":" << std::endl
+    << reason;
+  throw std::invalid_argument(s.str());
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Box */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Specialization,
+          typename Temp, typename To, typename ITV>
+bool
+l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                    const Box<ITV>& x, const Box<ITV>& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0, Temp& tmp1, Temp& tmp2) {
+  const dimension_type x_space_dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  // Zero-dim boxes are equal if and only if they are both empty or universe.
+  if (x_space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires a check for emptiness.
+  (void) x.is_empty();
+  (void) y.is_empty();
+  // If one of two boxes is empty, then they are equal if and only if
+  // the other box is empty too.
+  if (x.marked_empty() || y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty()) {
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+      return true;
+    }
+    else
+      goto pinf;
+  }
+
+  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
+  for (dimension_type i = x_space_dim; i-- > 0; ) {
+    const ITV& x_i = x.seq[i];
+    const ITV& y_i = y.seq[i];
+    // Dealing with the lower bounds.
+    if (x_i.lower_is_boundary_infinity()) {
+      if (!y_i.lower_is_boundary_infinity())
+        goto pinf;
+    }
+    else if (y_i.lower_is_boundary_infinity())
+      goto pinf;
+    else {
+      const Temp* tmp1p;
+      const Temp* tmp2p;
+      if (x_i.lower() > y_i.lower()) {
+        maybe_assign(tmp1p, tmp1, x_i.lower(), dir);
+        maybe_assign(tmp2p, tmp2, y_i.lower(), inverse(dir));
+      }
+      else {
+        maybe_assign(tmp1p, tmp1, y_i.lower(), dir);
+        maybe_assign(tmp2p, tmp2, x_i.lower(), inverse(dir));
+      }
+      sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
+      PPL_ASSERT(sgn(tmp1) >= 0);
+      Specialization::combine(tmp0, tmp1, dir);
+    }
+    // Dealing with the lower bounds.
+    if (x_i.upper_is_boundary_infinity())
+      if (y_i.upper_is_boundary_infinity())
+        continue;
+      else
+        goto pinf;
+    else if (y_i.upper_is_boundary_infinity())
+      goto pinf;
+    else {
+      const Temp* tmp1p;
+      const Temp* tmp2p;
+      if (x_i.upper() > y_i.upper()) {
+        maybe_assign(tmp1p, tmp1, x_i.upper(), dir);
+        maybe_assign(tmp2p, tmp2, y_i.upper(), inverse(dir));
+      }
+      else {
+        maybe_assign(tmp1p, tmp1, y_i.upper(), dir);
+        maybe_assign(tmp2p, tmp2, x_i.upper(), inverse(dir));
+      }
+      sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
+      PPL_ASSERT(sgn(tmp1) >= 0);
+      Specialization::combine(tmp0, tmp1, dir);
+    }
+  }
+  Specialization::finalize(tmp0, dir);
+  assign_r(r, tmp0, dir);
+  return true;
+
+ pinf:
+  assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Box_templates_hh)
diff --git a/src/Box_types.hh b/src/Box_types.hh
new file mode 100644
index 0000000..3383e02
--- /dev/null
+++ b/src/Box_types.hh
@@ -0,0 +1,25 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Box_types_hh
+#define PPL_Box_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Interval>
+class Box;
+
+class Box_Helpers;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Box_types_hh)
diff --git a/src/CO_Tree.cc b/src/CO_Tree.cc
index 1f57df3..a7e5ecd 100644
--- a/src/CO_Tree.cc
+++ b/src/CO_Tree.cc
@@ -1,6 +1,6 @@
 /* CO_Tree class implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "CO_Tree.defs.hh"
+#include "CO_Tree_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
@@ -63,7 +63,8 @@ PPL::CO_Tree::insert(iterator itr, dimension_type key1) {
     --candidate2_index;
     while (indexes[candidate2_index] == unused_index)
       --candidate2_index;
-  } else {
+  }
+  else {
     ++candidate2_index;
     while (indexes[candidate2_index] == unused_index)
       ++candidate2_index;
@@ -91,7 +92,8 @@ PPL::CO_Tree::insert(iterator itr, dimension_type key1) {
     // candidate1_node.
     return iterator(insert_precise(key1, Coefficient_zero(),
                                    candidate1_node));
-  } else {
+  }
+  else {
     PPL_ASSERT(candidate1_node.depth() < candidate2_node.depth());
     // candidate2_node is deeper in the tree than candidate1_node, so use
     // candidate2_node.
@@ -126,7 +128,8 @@ PPL::CO_Tree::insert(iterator itr, dimension_type key1,
     --candidate2_index;
     while (indexes[candidate2_index] == unused_index)
       --candidate2_index;
-  } else {
+  }
+  else {
     ++candidate2_index;
     while (indexes[candidate2_index] == unused_index)
       ++candidate2_index;
@@ -150,7 +153,8 @@ PPL::CO_Tree::insert(iterator itr, dimension_type key1,
     // candidate1_node is deeper in the tree than candidate2_node, so
     // use candidate1_node.
     return iterator(insert_precise(key1, data1, candidate1_node));
-  } else {
+  }
+  else {
     PPL_ASSERT(candidate1_node.depth() < candidate2_node.depth());
     // candidate2_node is deeper in the tree than candidate1_node, so
     // use candidate2_node.
@@ -163,9 +167,9 @@ PPL::CO_Tree::erase_element_and_shift_left(dimension_type key) {
   iterator itr = erase(key);
   if (itr == end())
     return;
-  dimension_type i = dfs_index(itr);
+  const dimension_type i = dfs_index(itr);
   dimension_type* p = indexes + i;
-  dimension_type* p_end = indexes + (reserved_size + 1);
+  const dimension_type* const p_end = indexes + (reserved_size + 1);
   for ( ; p != p_end; ++p)
     if (*p != unused_index)
       --(*p);
@@ -214,7 +218,8 @@ PPL::CO_Tree::bisect_in(dimension_type first, dimension_type last,
 
       last = half;
 
-    } else {
+    }
+    else {
 
       ++new_half;
       while (indexes[new_half] == unused_index)
@@ -259,7 +264,8 @@ PPL::CO_Tree::bisect_near(dimension_type hint, dimension_type key) const {
         // The searched element is in (hint,new_hint) and both indexes point
         // to valid elements.
         break;
-      } else
+      }
+      else
         new_hint = hint - offset;
 
       PPL_ASSERT(new_hint > 0);
@@ -286,7 +292,8 @@ PPL::CO_Tree::bisect_near(dimension_type hint, dimension_type key) const {
       offset *= 2;
     }
 
-  } else {
+  }
+  else {
     // The searched element is after `hint'.
     while (true) {
 
@@ -301,7 +308,8 @@ PPL::CO_Tree::bisect_near(dimension_type hint, dimension_type key) const {
         // The searched element is in (hint,new_hint) and both indexes point
         // to valid elements.
         break;
-      } else
+      }
+      else
         new_hint = hint + offset;
 
       PPL_ASSERT(new_hint > 0);
@@ -357,54 +365,69 @@ PPL::CO_Tree::insert_precise(dimension_type key1,
   PPL_ASSERT(!empty());
 
 #ifndef NDEBUG
+  // Check that `itr' is a correct hint.
   tree_iterator itr2(*this);
   itr2.go_down_searching_key(key1);
   PPL_ASSERT(itr == itr2);
 #endif
 
   if (itr.index() == key1) {
+    // Replacement, rather than insertion.
     *itr = data1;
     PPL_ASSERT(OK());
     return itr;
   }
 
-  if (data <= &data1 && &data1 < data + (reserved_size + 1)) {
-    // data1 is a coefficient of this row.
-    // Avoid invalidating it.
-    data_type x = data1;
+  // Proper insertion: check if it would invalidate `data1'.
+  const bool invalidating
+    = (data <= &data1) && (&data1 < data + (reserved_size + 1));
+
+  if (!invalidating)
+    return insert_precise_aux(key1, data1, itr);
+
+  // `data1' could be invalidated by the insert, because it is
+  // a coefficient of this row. Avoid the issue by copying it.
+  data_type data1_copy = data1;
 
 #ifndef NDEBUG
-    dimension_type i = &data1 - data;
-    dimension_type key2 = indexes[i];
-    PPL_ASSERT(key2 != unused_index);
-    // This is true since key1 is not in the tree.
-    PPL_ASSERT(key2 != key1);
+  dimension_type i = &data1 - data;
+  dimension_type key2 = indexes[i];
+  PPL_ASSERT(key2 != unused_index);
+  // This is true since `key1' is not in the tree.
+  PPL_ASSERT(key2 != key1);
 #endif
 
-    // Insert a dummy coefficient.
-    // NOTE: This may invalidate data1, because it may reallocate the tree
-    // and/or move coefficients during rebalancing).
-    itr = insert_precise(key1, Coefficient_zero(), itr);
+  // Insert a dummy coefficient.
+  // NOTE: this may invalidate `data1', because it may reallocate the tree
+  // and/or move coefficients during rebalancing.
+  itr = insert_precise_aux(key1, Coefficient_zero(), itr);
 
-    PPL_ASSERT(itr.index() == key1);
+  PPL_ASSERT(itr.index() == key1);
 
-    using std::swap;
+  // Swap the correct coefficient in place.
+  using std::swap;
+  swap(*itr, data1_copy);
 
-    // Swap the correct coefficient in place.
-    swap(*itr, x);
+  PPL_ASSERT(OK());
+  return itr;
+}
 
-    PPL_ASSERT(OK());
-    return itr;
-  }
+PPL::CO_Tree::tree_iterator
+PPL::CO_Tree::insert_precise_aux(dimension_type key1,
+                                 data_type_const_reference data1,
+                                 tree_iterator itr) {
+  PPL_ASSERT(key1 != unused_index);
+  PPL_ASSERT(!empty());
+  // This is a proper insert.
+  PPL_ASSERT(itr.index() != key1);
+  // `data1' is not going to be invalidated.
+  PPL_ASSERT(!(data <= &data1 && &data1 < data + (reserved_size + 1)));
 
   if (is_greater_than_ratio(size_ + 1, reserved_size, max_density_percent)) {
-
     rebuild_bigger_tree();
-
-    // itr was invalidated by the rebuild operation
+    // `itr' was invalidated by the rebuild operation
     itr.get_root();
     itr.go_down_searching_key(key1);
-
     PPL_ASSERT(itr.index() != key1);
   }
 
@@ -423,13 +446,10 @@ PPL::CO_Tree::insert_precise(dimension_type key1,
     new (&(*itr)) data_type(data1);
     // Set the index only if the construction was successful.
     itr.index() = key1;
-
-  } else {
-
+  }
+  else {
     itr = rebalance(itr, key1, data1);
-
     itr.go_down_searching_key(key1);
-
     PPL_ASSERT(itr.index() == key1);
   }
   PPL_ASSERT(OK());
@@ -536,17 +556,16 @@ PPL::CO_Tree::erase(tree_iterator itr) {
 }
 
 void
-PPL::CO_Tree::init(dimension_type reserved_size1) {
-  if (reserved_size1 == 0) {
-    indexes = NULL;
-    data = NULL;
-    size_ = 0;
-    reserved_size = 0;
-    max_depth = 0;
-  }
-  else {
-    init(0);
-    const dimension_type new_max_depth = integer_log2(reserved_size1) + 1;
+PPL::CO_Tree::init(dimension_type n) {
+  indexes = NULL;
+  data = NULL;
+  size_ = 0;
+  reserved_size = 0;
+  max_depth = 0;
+
+  if (n > 0) {
+    const dimension_type max_d = integer_log2(n) + 1;
+    const height_t new_max_depth = static_cast<height_t>(max_d);
     const dimension_type new_reserved_size
       = (static_cast<dimension_type>(1) << new_max_depth) - 1;
     // If this throws, *this will be the empty tree.
@@ -631,11 +650,12 @@ PPL::CO_Tree::structure_OK() const {
     if (itr.index() != unused_index)
       return false;
 
-  } else {
+  }
+  else {
     // This const_cast could be removed by adding a const_tree_iterator,
     // but it would add much code duplication without a real need.
     tree_iterator itr(*const_cast<CO_Tree*>(this));
-    dimension_type real_size = count_used_in_subtree(itr);
+    const dimension_type real_size = count_used_in_subtree(itr);
     if (real_size != size_)
       // There are \p real_size elements in the tree that are reachable by the
       // root, but size is \p size.
@@ -734,9 +754,9 @@ PPL::CO_Tree::rebuild_bigger_tree() {
     return;
   }
 
-  dimension_type new_reserved_size = reserved_size*2 + 1;
+  const dimension_type new_reserved_size = reserved_size*2 + 1;
 
-  dimension_type* new_indexes = new dimension_type[new_reserved_size + 2];
+  dimension_type* const new_indexes = new dimension_type[new_reserved_size + 2];
 
   data_type* new_data;
 
@@ -787,7 +807,7 @@ PPL::CO_Tree::rebalance(tree_iterator itr, dimension_type key,
   }
   PPL_ASSERT(itr.index() == unused_index || itr.is_leaf());
   height_t itr_depth_minus_1 = itr.depth() - 1;
-  height_t height = max_depth - itr_depth_minus_1;
+  const height_t height = max_depth - itr_depth_minus_1;
   dimension_type subtree_size;
   dimension_type subtree_reserved_size = (static_cast<dimension_type>(1)
                                           << height) - 1;
@@ -813,7 +833,7 @@ PPL::CO_Tree::rebalance(tree_iterator itr, dimension_type key,
     // The density in the tree is correct, so the while condition is always
     // false for the root.
     PPL_ASSERT(itr_depth_minus_1 != 0);
-    bool is_right_brother = itr.is_right_child();
+    const bool is_right_brother = itr.is_right_child();
     itr.get_parent();
     if (is_right_brother)
       itr.get_left_child();
@@ -833,10 +853,10 @@ PPL::CO_Tree::rebalance(tree_iterator itr, dimension_type key,
 
   // Step 1: compact elements of this subtree in the rightmost end, from right
   //         to left.
-  dimension_type last_index_in_subtree
+  const dimension_type last_index_in_subtree
     = itr.dfs_index() + itr.get_offset() - 1;
 
-  dimension_type first_unused
+  const dimension_type first_unused
     = compact_elements_in_the_rightmost_end(last_index_in_subtree,
                                             subtree_size, key, value,
                                             !deleting);
@@ -894,7 +914,8 @@ PPL::CO_Tree
           --first_unused_data;
         }
         break;
-      } else {
+      }
+      else {
         if (last_index_in_subtree != first_unused_index) {
           PPL_ASSERT(first_unused_index != indexes);
           PPL_ASSERT(last_index_in_subtree != indexes);
@@ -933,7 +954,7 @@ PPL::CO_Tree
     --subtree_size;
   }
 
-  ptrdiff_t distance = first_unused_index - indexes;
+  const ptrdiff_t distance = first_unused_index - indexes;
   PPL_ASSERT(distance >= 0);
   return static_cast<dimension_type>(distance);
 }
@@ -990,7 +1011,8 @@ PPL::CO_Tree::redistribute_elements_in_subtree(
         new (&(data[top_i])) data_type(value);
         // Set the index only if the construction was successful.
         indexes[top_i] = key;
-      } else {
+      }
+      else {
         if (last_used != top_i) {
           PPL_ASSERT(indexes[top_i] == unused_index);
           indexes[top_i] = indexes[last_used];
@@ -999,7 +1021,8 @@ PPL::CO_Tree::redistribute_elements_in_subtree(
         }
         ++last_used;
       }
-    } else {
+    }
+    else {
       PPL_ASSERT(stack_first_empty + 2
                  < stack + sizeof(stack)/sizeof(stack[0]));
 
@@ -1108,7 +1131,8 @@ PPL::CO_Tree::move_data_from(CO_Tree& tree) {
 
     if (top_n == 0) {
       --stack_first_empty;
-    } else {
+    }
+    else {
       if (top_n == 1) {
         PPL_ASSERT(root.index() == unused_index);
         PPL_ASSERT(tree.indexes[source_index] != unused_index);
@@ -1120,7 +1144,8 @@ PPL::CO_Tree::move_data_from(CO_Tree& tree) {
         while (tree.indexes[source_index] == unused_index)
           ++source_index;
         --stack_first_empty;
-      } else {
+      }
+      else {
         PPL_ASSERT(stack_first_empty + 3 < sizeof(stack)/sizeof(stack[0]));
 
         const dimension_type half = (top_n + 1) / 2;
@@ -1156,7 +1181,8 @@ PPL::CO_Tree::copy_data_from(const CO_Tree& x) {
       if (x.indexes[i] != unused_index) {
         indexes[i] = x.indexes[i];
         new (&(data[i])) data_type(x.data[i]);
-      } else {
+      }
+      else {
         PPL_ASSERT(indexes[i] == unused_index);
       }
   } catch (...) {
@@ -1194,7 +1220,8 @@ PPL::CO_Tree::count_used_in_subtree(tree_iterator itr) {
 
   PPL_ASSERT(root_index > (k - 1));
 
-  dimension_type* current_index = &(itr.tree.indexes[root_index - (k - 1)]);
+  const dimension_type* current_index
+    = &(itr.tree.indexes[root_index - (k - 1)]);
 
   for (dimension_type j = 2*k - 1; j > 0; --j, ++current_index)
     if (*current_index != unused_index)
@@ -1211,12 +1238,14 @@ PPL::CO_Tree::const_iterator::OK() const {
       return false;
     if (current_data != 0)
       return false;
-  } else
+  }
+  else
     if (tree->reserved_size == 0) {
       if (current_index != 1 + static_cast<dimension_type*>(0)
           || current_data != 1 + static_cast<data_type*>(0))
         return false;
-    } else {
+    }
+    else {
       if (current_index <= &(tree->indexes[0]))
         return false;
       if (current_index > &(tree->indexes[tree->reserved_size + 1]))
@@ -1242,12 +1271,14 @@ PPL::CO_Tree::iterator::OK() const {
       return false;
     if (current_data != 0)
       return false;
-  } else
+  }
+  else
     if (tree->reserved_size == 0) {
       if (current_index != 1 + static_cast<dimension_type*>(0)
           || current_data != 1 + static_cast<data_type*>(0))
         return false;
-    } else {
+    }
+    else {
       if (current_index <= &(tree->indexes[0]))
         return false;
       if (current_index > &(tree->indexes[tree->reserved_size + 1]))
@@ -1271,7 +1302,7 @@ PPL::CO_Tree::tree_iterator::OK() const {
     return false;
 
   // This assumes two's complement encoding.
-  dimension_type correct_offset = i & -i;
+  const dimension_type correct_offset = i & -i;
 
   if (offset != correct_offset)
     return false;
@@ -1294,7 +1325,8 @@ PPL::CO_Tree::tree_iterator::go_down_searching_key(dimension_type key) {
         get_parent();
         break;
       }
-    } else {
+    }
+    else {
       get_right_child();
       if (index() == unused_index) {
         get_parent();
diff --git a/src/CO_Tree.defs.hh b/src/CO_Tree.defs.hh
deleted file mode 100644
index d02b467..0000000
--- a/src/CO_Tree.defs.hh
+++ /dev/null
@@ -1,1548 +0,0 @@
-/* CO_Tree class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_CO_Tree_defs_hh
-#define PPL_CO_Tree_defs_hh 1
-
-#include "CO_Tree.types.hh"
-
-#include "Coefficient.defs.hh"
-#include <memory>
-
-#ifndef PPL_CO_TREE_EXTRA_DEBUG
-#ifdef PPL_ABI_BREAKING_EXTRA_DEBUG
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*!
-  \brief
-  Enables extra debugging information for class CO_Tree.
-
-  \ingroup PPL_CXX_interface
-  When <CODE>PPL_CO_TREE_EXTRA_DEBUG</CODE> evaluates to <CODE>true</CODE>,
-  each CO_Tree iterator and const_iterator carries a pointer to the associated
-  tree; this enables extra consistency checks to be performed.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define PPL_CO_TREE_EXTRA_DEBUG 1
-#else // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
-#define PPL_CO_TREE_EXTRA_DEBUG 0
-#endif // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
-#endif // !defined(PPL_CO_TREE_EXTRA_DEBUG)
-
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A cache-oblivious binary search tree of pairs.
-/*! \ingroup PPL_CXX_interface
-  This class implements a binary search tree with keys of dimension_type type
-  and data of Coefficient type, laid out in a dynamically-sized array.
-
-  The array-based layout saves calls to new/delete (to insert \f$n\f$ elements
-  only \f$O(\log n)\f$ allocations are performed) and, more importantly, is
-  much more cache-friendly than a standard (pointer-based) tree, because the
-  elements are stored sequentially in memory (leaving some holes to allow
-  fast insertion of new elements).
-  The downside of this representation is that all iterators are invalidated
-  when an element is added or removed, because the array could have been
-  enlarged or shrunk. This is partially addressed by providing references to
-  internal end iterators that are updated when needed.
-
-  B-trees are cache-friendly too, but the cache size is fixed (usually at
-  compile-time). This raises two problems: firstly the cache size must be
-  known in advance and those data structures do not perform well with other
-  cache sizes and, secondly, even if the cache size is known, the
-  optimizations target only one level of cache. This kind of data structures
-  are called cache aware. This implementation, instead, is cache oblivious:
-  it performs well with every cache size, and thus exploits all of the
-  available caches.
-
-  Assuming \p n is the number of elements in the tree and \p B is the number
-  of (dimension_type, Coefficient) pairs that fit in a cache line, the
-  time and cache misses complexities are the following:
-
-  - Insertions/Queries/Deletions: \f$O(\log^2 n)\f$ time,
-                                  \f$O(\log \frac{n}{B}))\f$ cache misses.
-  - Tree traversal from begin() to end(), using an %iterator: \f$O(n)\f$ time,
-         \f$O(\frac{n}{B})\f$  cache misses.
-  - Queries with a hint: \f$O(\log k)\f$ time and \f$O(\log \frac{k}{B})\f$
-    cache misses, where k is the distance between the given %iterator and the
-    searched element (or the position where it would have been).
-
-  The binary search tree is embedded in a (slightly bigger) complete tree,
-  that is enlarged and shrunk when needed. The complete tree is laid out
-  in an in-order DFS layout in two arrays: one for the keys and one for the
-  associated data.
-  The indexes and values are stored in different arrays to reduce
-  cache-misses during key queries.
-
-  The tree can store up to \f$(-(dimension_type)1)/100\f$ elements.
-  This limit allows faster density computations, but can be removed if needed.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class CO_Tree {
-
-public:
-  class const_iterator;
-  class iterator;
-
-private:
-  //! This is used for node heights and depths in the tree.
-  typedef unsigned height_t;
-
-  PPL_COMPILE_TIME_CHECK(C_Integer<height_t>::max
-                         >= sizeof_to_bits(sizeof(dimension_type)),
-                         "height_t is too small to store depths.");
-
-  class tree_iterator;
-
-  // This must be declared here, because it is a friend of const_iterator.
-  //! Returns the index of the current element in the DFS layout of the
-  //! complete tree.
-  /*!
-    \return the index of the current element in the DFS layout of the complete
-            tree.
-
-    \param itr the iterator that points to the desired element.
-  */
-  dimension_type dfs_index(const_iterator itr) const;
-
-  // This must be declared here, because it is a friend of iterator.
-  //! Returns the index of the current element in the DFS layout of the
-  //! complete tree.
-  /*!
-    \return the index of the current element in the DFS layout of the complete
-            tree.
-
-    \param itr the iterator that points to the desired element.
-  */
-  dimension_type dfs_index(iterator itr) const;
-
-public:
-
-  //! The type of the data elements associated with keys.
-  /*!
-    If this is changed, occurrences of Coefficient_zero() in the CO_Tree
-    implementation have to be replaced with constants of the correct type.
-  */
-  typedef Coefficient data_type;
-  typedef Coefficient_traits::const_reference data_type_const_reference;
-
-  //! A const %iterator on the tree elements, ordered by key.
-  /*!
-    Iterator increment and decrement operations are \f$O(1)\f$ time.
-    These iterators are invalidated by operations that add or remove elements
-    from the tree.
-  */
-  class const_iterator {
-  private:
-  public:
-
-    typedef std::bidirectional_iterator_tag iterator_category;
-    typedef const data_type value_type;
-    typedef ptrdiff_t difference_type;
-    typedef value_type* pointer;
-    typedef data_type_const_reference reference;
-
-    //! Constructs an invalid const_iterator.
-    /*!
-      This constructor takes \f$O(1)\f$ time.
-    */
-    explicit const_iterator();
-
-    //! Constructs an %iterator pointing to the first element of the tree.
-    /*!
-      \param tree
-      The tree that the new %iterator will point to.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    explicit const_iterator(const CO_Tree& tree);
-
-    //! Constructs a const_iterator pointing to the i-th node of the tree.
-    /*!
-      \param tree
-      The tree that the new %iterator will point to.
-
-      \param i
-      The index of the element in \p tree to which the %iterator will point
-      to.
-
-      The i-th node must be a node with a value or end().
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    const_iterator(const CO_Tree& tree, dimension_type i);
-
-    //! The copy constructor.
-    /*!
-      \param itr
-      The %iterator that will be copied.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    const_iterator(const const_iterator& itr);
-
-    //! Converts an iterator into a const_iterator.
-    /*!
-      \param itr
-      The iterator that will be converted into a const_iterator.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    const_iterator(const iterator& itr);
-
-    //! Swaps itr with *this.
-    /*!
-      \param itr
-      The %iterator that will be swapped with *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    void m_swap(const_iterator& itr);
-
-    //! Assigns \p itr to *this .
-    /*!
-      \param itr
-      The %iterator that will be assigned into *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator& operator=(const const_iterator& itr);
-
-    //! Assigns \p itr to *this .
-    /*!
-      \param itr
-      The %iterator that will be assigned into *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator& operator=(const iterator& itr);
-
-    //! Navigates to the next element.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator& operator++();
-
-    //! Navigates to the previous element.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator& operator--();
-
-    //! Navigates to the next element.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator operator++(int);
-
-    //! Navigates to the previous element.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator operator--(int);
-
-    //! Returns the current element.
-    data_type_const_reference operator*() const;
-
-    //! Returns the index of the element pointed to by \c *this.
-    /*!
-      \returns the index of the element pointed to by \c *this.
-    */
-    dimension_type index() const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    bool operator==(const const_iterator& x) const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    bool operator!=(const const_iterator& x) const;
-
-  private:
-    //! Checks the internal invariants, in debug mode only.
-    bool OK() const;
-
-    //! A pointer to the corresponding element of the tree's indexes[] array.
-    const dimension_type* current_index;
-
-    //! A pointer to the corresponding element of the tree's data[] array.
-    const data_type* current_data;
-
-#if PPL_CO_TREE_EXTRA_DEBUG
-    //! A pointer to the corresponding tree, used for debug purposes only.
-    const CO_Tree* tree;
-#endif
-
-    friend dimension_type CO_Tree::dfs_index(const_iterator itr) const;
-  };
-
-  //! An %iterator on the tree elements, ordered by key.
-  /*!
-    Iterator increment and decrement operations are \f$O(1)\f$ time.
-    These iterators are invalidated by operations that add or remove elements
-    from the tree.
-  */
-  class iterator {
-  public:
-
-    typedef std::bidirectional_iterator_tag iterator_category;
-    typedef data_type value_type;
-    typedef ptrdiff_t difference_type;
-    typedef value_type* pointer;
-    typedef value_type& reference;
-
-    //! Constructs an invalid iterator.
-    /*!
-      This constructor takes \f$O(1)\f$ time.
-    */
-    iterator();
-
-    //! Constructs an %iterator pointing to first element of the tree.
-    /*!
-      \param tree
-      The tree to which the new %iterator will point to.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    explicit iterator(CO_Tree& tree);
-
-    //! Constructs an %iterator pointing to the i-th node.
-    /*!
-      \param tree
-      The tree to which the new %iterator will point to.
-
-      \param i
-      The index of the element in \p tree to which the new %iterator will
-      point to.
-
-      The i-th node must be a node with a value or end().
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    iterator(CO_Tree& tree, dimension_type i);
-
-    //! The constructor from a tree_iterator.
-    /*!
-      \param itr
-      The tree_iterator that will be converted into an iterator.
-
-      This is meant for use by CO_Tree only.
-      This is not private to avoid the friend declaration.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    explicit iterator(const tree_iterator& itr);
-
-    //! The copy constructor.
-    /*!
-      \param itr
-      The %iterator that will be copied.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    iterator(const iterator& itr);
-
-    //! Swaps itr with *this.
-    /*!
-      \param itr
-      The %iterator that will be swapped with *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    void m_swap(iterator& itr);
-
-    //! Assigns \p itr to *this .
-    /*!
-      \param itr
-      The %iterator that will be assigned into *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    iterator& operator=(const iterator& itr);
-
-    //! Assigns \p itr to *this .
-    /*!
-      \param itr
-      The %iterator that will be assigned into *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    iterator& operator=(const tree_iterator& itr);
-
-    //! Navigates to the next element in the tree.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    iterator& operator++();
-
-    //! Navigates to the previous element in the tree.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    iterator& operator--();
-
-    //! Navigates to the next element in the tree.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    iterator operator++(int);
-
-    //! Navigates to the previous element in the tree.
-    /*!
-      This method takes \f$O(1)\f$ time.
-    */
-    iterator operator--(int);
-
-    //! Returns the current element.
-    data_type& operator*();
-
-    //! Returns the current element.
-    data_type_const_reference operator*() const;
-
-    //! Returns the index of the element pointed to by \c *this.
-    /*!
-      \returns the index of the element pointed to by \c *this.
-    */
-    dimension_type index() const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    bool operator==(const iterator& x) const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    bool operator!=(const iterator& x) const;
-
-  private:
-    //! Checks the internal invariants, in debug mode only.
-    bool OK() const;
-
-    //! A pointer to the corresponding element of the tree's indexes[] array.
-    const dimension_type* current_index;
-
-    //! A pointer to the corresponding element of the tree's data[] array.
-    data_type* current_data;
-
-#if PPL_CO_TREE_EXTRA_DEBUG
-    //! A pointer to the corresponding tree, used for debug purposes only.
-    CO_Tree* tree;
-#endif
-
-    friend const_iterator& const_iterator::operator=(const iterator&);
-    friend dimension_type CO_Tree::dfs_index(iterator itr) const;
-  };
-
-  //! Constructs an empty tree.
-  /*!
-    This constructor takes \f$O(1)\f$ time.
-  */
-  CO_Tree();
-
-  //! The copy constructor.
-  /*!
-    \param y
-    The tree that will be copied.
-
-    This constructor takes \f$O(n)\f$ time.
-  */
-  CO_Tree(const CO_Tree& y);
-
-  //! A constructor from a sequence of \p n elements.
-  /*!
-    \param i
-    An iterator that points to the first element of the sequence.
-
-    \param n
-    The number of elements in the [i, i_end) sequence.
-
-    i must be an input iterator on a sequence of data_type elements,
-    sorted by index.
-    Objects of Iterator type must have an index() method that returns the
-    index with which the element pointed to by the iterator must be inserted.
-
-    This constructor takes \f$O(n)\f$ time, so it is more efficient than
-    the construction of an empty tree followed by n insertions, that would
-    take \f$O(n*\log^2 n)\f$ time.
-  */
-  template <typename Iterator>
-  CO_Tree(Iterator i, dimension_type n);
-
-  //! The assignment operator.
-  /*!
-    \param y
-    The tree that will be assigned to *this.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  CO_Tree& operator=(const CO_Tree& y);
-
-  //! Removes all elements from the tree.
-  /*!
-    This method takes \f$O(n)\f$ time.
-  */
-  void clear();
-
-  //! The destructor.
-  /*!
-    This destructor takes \f$O(n)\f$ time.
-  */
-  ~CO_Tree();
-
-  //! Returns \p true if the tree has no elements.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  bool empty() const;
-
-  //! Returns the number of elements stored in the tree.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  dimension_type size() const;
-
-  //! Returns the size() of the largest possible CO_Tree.
-  static dimension_type max_size();
-
-  //! Dumps the tree to stdout, for debugging purposes.
-  void dump_tree() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  /*!
-    This method takes \f$O(n)\f$ time.
-  */
-  dimension_type external_memory_in_bytes() const;
-
-  //! Inserts an element in the tree.
-  /*!
-    \returns
-    An %iterator that points to the inserted pair.
-
-    \param key
-    The key that will be inserted into the tree, associated with the default
-    data.
-
-    If such a pair already exists, an %iterator pointing to that pair is
-    returned.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log n)\f$ time if the element already exists, and
-    \f$O(\log^2 n)\f$ amortized time otherwise.
-  */
-  iterator insert(dimension_type key);
-
-  //! Inserts an element in the tree.
-  /*!
-    \returns
-    An %iterator that points to the inserted element.
-
-    \param key
-    The key that will be inserted into the tree..
-
-    \param data
-    The data that will be inserted into the tree.
-
-    If an element with the specified key already exists, its associated data
-    is set to \p data and an %iterator pointing to that pair is returned.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log n)\f$ time if the element already exists, and
-    \f$O(\log^2 n)\f$ amortized time otherwise.amortized
-  */
-  iterator insert(dimension_type key, data_type_const_reference data);
-
-  //! Inserts an element in the tree.
-  /*!
-    \return
-    An %iterator that points to the inserted element.
-
-    \param itr
-    The %iterator used as hint
-
-    \param key
-    The key that will be inserted into the tree, associated with the default
-    data.
-
-    This will be faster if \p itr points near to the place where the new
-    element will be inserted (or where is already stored).
-    However, the value of \p itr does not affect the result of this
-    method, as long it is a valid %iterator for this tree. \p itr may even be
-    end().
-
-    If an element with the specified key already exists, an %iterator pointing
-    to that pair is returned.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log n)\f$ time if the element already exists, and
-    \f$O(\log^2 n)\f$ amortized time otherwise.
-  */
-  iterator insert(iterator itr, dimension_type key);
-
-  //! Inserts an element in the tree.
-  /*!
-    \return
-    An iterator that points to the inserted element.
-
-    \param itr
-    The iterator used as hint
-
-    \param key
-    The key that will be inserted into the tree.
-
-    \param data
-    The data that will be inserted into the tree.
-
-    This will be faster if \p itr points near to the place where the new
-    element will be inserted (or where is already stored).
-    However, the value of \p itr does not affect the result of this
-    method, as long it is a valid iterator for this tree. \p itr may even be
-    end().
-
-    If an element with the specified key already exists, its associated data
-    is set to \p data and an iterator pointing to that pair is returned.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log n)\f$ time if the element already exists,
-    and \f$O(\log^2 n)\f$ amortized time otherwise.
-  */
-  iterator insert(iterator itr, dimension_type key,
-                  data_type_const_reference data);
-
-  //! Erases the element with key \p key from the tree.
-  /*!
-    This operation invalidates existing iterators.
-
-    \returns an iterator to the next element (or end() if there are no
-             elements with key greater than \p key ).
-
-    \param key
-    The key of the element that will be erased from the tree.
-
-    This method takes \f$O(\log n)\f$ time if the element already exists,
-    and \f$O(\log^2 n)\f$ amortized time otherwise.
-  */
-  iterator erase(dimension_type key);
-
-  //! Erases the element pointed to by \p itr from the tree.
-  /*!
-    This operation invalidates existing iterators.
-
-    \returns an iterator to the next element (or end() if there are no
-             elements with key greater than \p key ).
-
-    \param itr
-    An iterator pointing to the element that will be erased from the tree.
-
-    This method takes \f$O(\log n)\f$ time if the element already exists, and
-    \f$O(\log^2 n)\f$ amortized time otherwise.
-  */
-  iterator erase(iterator itr);
-
-  /*!
-    \brief Removes the element with key \p key (if it exists) and decrements
-           by 1 all elements' keys that were greater than \p key.
-
-    \param key
-    The key of the element that will be erased from the tree.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(k+\log^2 n)\f$ expected time, where k is the number
-    of elements with keys greater than \p key.
-  */
-  void erase_element_and_shift_left(dimension_type key);
-
-  //! Adds \p n to all keys greater than or equal to \p key.
-  /*!
-    \param key
-    The key of the first element whose key will be increased.
-
-    \param n
-    Specifies how much the keys will be increased.
-
-    This method takes \f$O(k+\log n)\f$ expected time, where k is the number
-    of elements with keys greater than or equal to \p key.
-  */
-  void increase_keys_from(dimension_type key, dimension_type n);
-
-  //! Sets to \p i the key of *itr. Assumes that i<=itr.index() and that there
-  //! are no elements with keys in [i,itr.index()).
-  /*!
-    All existing iterators remain valid.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void fast_shift(dimension_type i, iterator itr);
-
-  //! Swaps x with *this.
-  /*!
-    \param x
-    The tree that will be swapped with *this.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void m_swap(CO_Tree& x);
-
-  //! Returns an iterator that points at the first element.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  iterator begin();
-
-  //! Returns an iterator that points after the last element.
-  /*!
-    This method always returns a reference to the same internal %iterator,
-    that is updated at each operation that modifies the structure.
-    Client code can keep a const reference to that %iterator instead of
-    keep updating a local %iterator.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  const iterator& end();
-
-  //! Equivalent to cbegin().
-  const_iterator begin() const;
-
-  //! Equivalent to cend().
-  const const_iterator& end() const;
-
-  //! Returns a const_iterator that points at the first element.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  const_iterator cbegin() const;
-
-  //! Returns a const_iterator that points after the last element.
-  /*!
-    This method always returns a reference to the same internal %iterator,
-    that is updated at each operation that modifies the structure.
-    Client code can keep a const reference to that %iterator instead of
-    keep updating a local %iterator.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  const const_iterator& cend() const;
-
-  //! Searches an element with key \p key using bisection.
-  /*!
-    \param key
-    The key that will be searched for.
-
-    If the element is found, an %iterator pointing to that element is
-    returned; otherwise, the returned %iterator refers to the immediately
-    preceding or succeeding value.
-    If the tree is empty, end() is returned.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  iterator bisect(dimension_type key);
-
-  //! Searches an element with key \p key using bisection.
-  /*!
-    \param key
-    The key that will be searched for.
-
-    If the element is found, an %iterator pointing to that element is
-    returned; otherwise, the returned %iterator refers to the immediately
-    preceding or succeeding value.
-    If the tree is empty, end() is returned.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  const_iterator bisect(dimension_type key) const;
-
-  //! Searches an element with key \p key in [first, last] using bisection.
-  /*!
-    \param first
-    An %iterator pointing to the first element in the range.
-    It must not be end().
-
-    \param last
-    An %iterator pointing to the last element in the range.
-    Note that this is included in the search.
-    It must not be end().
-
-    \param key
-    The key that will be searched for.
-
-    \return
-    If the specified key is found, an %iterator pointing to that element is
-    returned; otherwise, the returned %iterator refers to the immediately
-    preceding or succeeding value.
-    If the tree is empty, end() is returned.
-
-    This method takes \f$O(\log(last - first + 1))\f$ time.
-  */
-  iterator bisect_in(iterator first, iterator last, dimension_type key);
-
-  //! Searches an element with key \p key in [first, last] using bisection.
-  /*!
-    \param first
-    An %iterator pointing to the first element in the range.
-    It must not be end().
-
-    \param last
-    An %iterator pointing to the last element in the range.
-    Note that this is included in the search.
-    It must not be end().
-
-    \param key
-    The key that will be searched for.
-
-    \return
-    If the specified key is found, an %iterator pointing to that element is
-    returned; otherwise, the returned %iterator refers to the immediately
-    preceding or succeeding value.
-    If the tree is empty, end() is returned.
-
-    This method takes \f$O(\log(last - first + 1))\f$ time.
-  */
-  const_iterator bisect_in(const_iterator first, const_iterator last,
-                           dimension_type key) const;
-
-  //! Searches an element with key \p key near \p hint.
-  /*!
-    \param hint
-    An %iterator used as a hint.
-
-    \param key
-    The key that will be searched for.
-
-    If the element is found, the returned %iterator points to that element;
-    otherwise, it points to the immediately preceding or succeeding value.
-    If the tree is empty, end() is returned.
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this tree. \p itr may even be end().
-
-    This method takes \f$O(\log n)\f$ time. If the distance between the
-    returned position and \p hint is \f$O(1)\f$ it takes \f$O(1)\f$ time.
-  */
-  iterator bisect_near(iterator hint, dimension_type key);
-
-  //! Searches an element with key \p key near \p hint.
-  /*!
-    \param hint
-    An %iterator used as a hint.
-
-    \param key
-    The key that will be searched for.
-
-    If the element is found, the returned %iterator points to that element;
-    otherwise, it points to the immediately preceding or succeeding value.
-    If the tree is empty, end() is returned.
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this tree. \p itr may even be end().
-
-    This method takes \f$O(\log n)\f$ time. If the distance between the
-    returned position and \p hint is \f$O(1)\f$ it takes \f$O(1)\f$ time.
-  */
-  const_iterator bisect_near(const_iterator hint, dimension_type key) const;
-
-private:
-
-  //! Searches an element with key \p key in [first, last] using bisection.
-  /*!
-    \param first
-    The index of the first element in the range.
-    It must be the index of an element with a value.
-
-    \param last
-    The index of the last element in the range.
-    It must be the index of an element with a value.
-    Note that this is included in the search.
-
-    \param key
-    The key that will be searched for.
-
-    \return
-    If the element is found, the index of that element is returned; otherwise,
-    the returned index refers to the immediately preceding or succeeding
-    value.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  dimension_type bisect_in(dimension_type first, dimension_type last,
-                           dimension_type key) const;
-
-  //! Searches an element with key \p key near \p hint.
-  /*!
-    \param hint
-    An index used as a hint.
-    It must be the index of an element with a value.
-
-    \param key
-    The key that will be searched for.
-
-    \return
-    If the element is found, the index of that element is returned; otherwise,
-    the returned index refers to the immediately preceding or succeeding
-    value.
-
-    This uses a binary progression and then a bisection, so this method is
-    \f$O(\log n)\f$, and it is \f$O(1)\f$ if the distance between the returned
-    position and \p hint is \f$O(1)\f$.
-
-    This method takes \f$O(\log n)\f$ time. If the distance between the
-    returned position and \p hint is \f$O(1)\f$ it takes \f$O(1)\f$ time.
-  */
-  dimension_type bisect_near(dimension_type hint, dimension_type key) const;
-
-  //! Inserts an element in the tree.
-  /*!
-    If there is already an element with key \p key in the tree, its
-    associated data is set to \p data.
-
-    This operation invalidates existing iterators.
-
-    \return
-    An %iterator that points to the inserted element.
-
-    \param key
-    The key that will be inserted into the tree.
-
-    \param data
-    The data that will be associated with \p key.
-
-    \param itr
-    It must point to the element in the tree with key \p key or, if no such
-    element exists, it must point to the node that would be his parent.
-
-    This method takes \f$O(1)\f$ time if the element already exists, and
-    \f$O(\log^2 n)\f$ amortized time otherwise.
-  */
-  tree_iterator insert_precise(dimension_type key,
-                               data_type_const_reference data,
-                               tree_iterator itr);
-
-  //! Inserts an element in the tree.
-  /*!
-
-    \param key
-    The key that will be inserted into the tree.
-
-    \param data
-    The data that will be associated with \p key.
-
-    The tree must be empty.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void insert_in_empty_tree(dimension_type key,
-                            data_type_const_reference data);
-
-  //! Erases from the tree the element pointed to by \p itr .
-  /*!
-    This operation invalidates existing iterators.
-
-    \returns
-    An %iterator to the next element (or end() if there are no elements with
-    key greater than \p key ).
-
-    \param itr
-    An %iterator pointing to the element that will be erased.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  iterator erase(tree_iterator itr);
-
-  //! Initializes a tree with reserved size at least \p n .
-  /*!
-    \param n
-    A lower bound on the tree's desired reserved size.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void init(dimension_type n);
-
-  //! Deallocates the tree's dynamic arrays.
-  /*!
-    After this call, the tree fields are uninitialized, so init() must be
-    called again before using the tree.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void destroy();
-
-  //! Checks the internal invariants, but not the densities.
-  bool structure_OK() const;
-
-  //! Checks the internal invariants.
-  bool OK() const;
-
-  //! Returns the floor of the base-2 logarithm of \p n .
-  /*!
-    \param n
-    It must be greater than zero.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  static unsigned integer_log2(dimension_type n);
-
-  //! Compares the fractions numer/denom with ratio/100.
-  /*!
-    \returns Returns true if the fraction numer/denom is less
-    than the fraction ratio/100.
-
-    \param ratio
-    It must be less than or equal to 100.
-
-    \param numer
-    The numerator of the fraction.
-
-    \param denom
-    The denominator of the fraction.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  static bool is_less_than_ratio(dimension_type numer, dimension_type denom,
-                                 dimension_type ratio);
-
-  //! Compares the fractions numer/denom with ratio/100.
-  /*!
-    \returns
-    Returns true if the fraction numer/denom is greater than the fraction
-    ratio/100.
-
-    \param ratio
-    It must be less than or equal to 100.
-
-    \param numer
-    The numerator of the fraction.
-
-    \param denom
-    The denominator of the fraction.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  static bool is_greater_than_ratio(dimension_type numer, dimension_type denom,
-                                    dimension_type ratio);
-
-  //! Dumps the subtree rooted at \p itr to stdout, for debugging purposes.
-  /*!
-    \param itr
-    A tree_iterator pointing to the root of the desired subtree.
-  */
-  static void dump_subtree(tree_iterator itr);
-
-  //! Increases the tree's reserved size.
-  /*!
-    This is called when the density is about to exceed the maximum density
-    (specified by max_density_percent).
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void rebuild_bigger_tree();
-
-  //! Decreases the tree's reserved size.
-  /*!
-    This is called when the density is about to become less than the minimum
-    allowed density (specified by min_density_percent).
-
-    \p reserved_size must be greater than 3 (otherwise the tree can just be
-    cleared).
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void rebuild_smaller_tree();
-
-  //! Re-initializes the cached iterators.
-  /*!
-    This method must be called when the indexes[] and data[] vector are
-    reallocated.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void refresh_cached_iterators();
-
-  //! Rebalances the tree.
-  /*!
-    For insertions, it adds the pair (key, value) in the process.
-
-    This operation invalidates existing iterators that point to nodes in the
-    rebalanced subtree.
-
-    \returns an %iterator pointing to the root of the subtree that was
-             rebalanced.
-
-    \param itr
-    It points to the node where the new element has to be inserted or where an
-    element has just been deleted.
-
-    \param key
-    The index that will be inserted in the tree (for insertions only).
-
-    \param value
-    The value that will be inserted in the tree (for insertions only).
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  tree_iterator rebalance(tree_iterator itr, dimension_type key,
-                          data_type_const_reference value);
-
-  //! Moves all elements of a subtree to the rightmost end.
-  /*!
-    \returns
-    The index of the rightmost unused node in the subtree after the process.
-
-    \param last_in_subtree
-    It is the index of the last element in the subtree.
-
-    \param subtree_size
-    It is the number of valid elements in the subtree.
-    It must be greater than zero.
-
-    \param key
-    The key that may be added to the tree if add_element is \c true.
-
-    \param value
-    The value that may be added to the tree if add_element is \c true.
-
-    \param add_element
-    If it is true, it tries to add an element with key \p key and value
-    \p value in the process (but it may not).
-
-    This method takes \f$O(k)\f$ time, where k is \p subtree_size.
-  */
-  dimension_type compact_elements_in_the_rightmost_end(
-    dimension_type last_in_subtree, dimension_type subtree_size,
-    dimension_type key, data_type_const_reference value,
-    bool add_element);
-
-  //! Redistributes the elements in the subtree rooted at \p root_index.
-  /*!
-    The subtree's elements must be compacted to the rightmost end.
-
-    \param root_index
-    The index of the subtree's root node.
-
-    \param subtree_size
-    It is the number of used elements in the subtree.
-    It must be greater than zero.
-
-    \param last_used
-    It points to the leftmost element with a value in the subtree.
-
-    \param add_element
-    If it is true, this method adds an element with the specified key and
-    value in the process.
-
-    \param key
-    The key that will be added to the tree if \p add_element is \c true.
-
-    \param value
-    The data that will be added to the tree if \p add_element is \c true.
-
-    This method takes \f$O(k)\f$ time, where k is \p subtree_size.
-  */
-  void redistribute_elements_in_subtree(dimension_type root_index,
-                                        dimension_type subtree_size,
-                                        dimension_type last_used,
-                                        dimension_type key,
-                                        data_type_const_reference value,
-                                        bool add_element);
-
-  //! Moves all data in the tree \p tree into *this.
-  /*!
-    \param tree
-    The tree from which the element will be moved into *this.
-
-    *this must be empty and big enough to contain all of tree's data without
-    exceeding max_density.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void move_data_from(CO_Tree& tree);
-
-  //! Copies all data in the tree \p tree into *this.
-  /*!
-    \param tree
-    The tree from which the element will be copied into *this.
-
-    *this must be empty and must have the same reserved size of \p tree.
-    this->OK() may return false before this method is called, but
-    this->structure_OK() must return true.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void copy_data_from(const CO_Tree& tree);
-
-  //! Counts the number of used elements in the subtree rooted at itr.
-  /*!
-    \param itr
-    An %iterator pointing to the root of the desired subtree.
-
-    This method takes \f$O(k)\f$ time, where k is the number of elements in
-    the subtree.
-  */
-  static dimension_type count_used_in_subtree(tree_iterator itr);
-
-  //! Moves the value of \p from in \p to .
-  /*!
-    \param from
-    It must be a valid value.
-
-    \param to
-    It must be a non-constructed chunk of memory.
-
-    After the move, \p from becomes a non-constructed chunk of memory and
-    \p to gets the value previously stored by \p from.
-
-    The implementation of this method assumes that data_type values do not
-    keep pointers to themselves nor to their fields.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  static void move_data_element(data_type& to, data_type& from);
-
-  //! The maximum density of used nodes.
-  /*!
-    This must be greater than or equal to 50 and lower than 100.
-  */
-  static const dimension_type max_density_percent = 91;
-
-  //! The minimum density of used nodes.
-  /*!
-    Must be strictly lower than the half of max_density_percent.
-  */
-  static const dimension_type min_density_percent = 38;
-
-  //! The minimum density at the leaves' depth.
-  /*!
-    Must be greater than zero and strictly lower than min_density_percent.
-
-    Increasing the value is safe but leads to time inefficiencies
-    (measured against ppl_lpsol on 24 August 2010), because it forces trees to
-    be more balanced, increasing the cost of rebalancing.
-  */
-  static const dimension_type min_leaf_density_percent = 1;
-
-  //! An index used as a marker for unused nodes in the tree.
-  /*!
-    This must not be used as a key.
-  */
-  static const dimension_type unused_index = C_Integer<dimension_type>::max;
-
-  //! The %iterator returned by end().
-  /*!
-    It is updated when needed, to keep it valid.
-  */
-  iterator cached_end;
-
-  //! The %iterator returned by the const version of end().
-  /*!
-    It is updated when needed, to keep it valid.
-  */
-  const_iterator cached_const_end;
-
-  //! The depth of the leaves in the complete tree.
-  height_t max_depth;
-
-  //! The vector that contains the keys in the tree.
-  /*!
-    If an element of this vector is \p unused_index , it means that that
-    element and the corresponding element of data[] are not used.
-
-    Its size is reserved_size + 2, because the first and the last elements
-    are used as markers for iterators.
-  */
-  dimension_type* indexes;
-
-  //! The allocator used to allocate/deallocate data.
-  std::allocator<data_type> data_allocator;
-
-  //! The vector that contains the data of the keys in the tree.
-  /*!
-    If index[i] is \p unused_index, data[i] is unused.
-    Otherwise, data[i] contains the data associated to the indexes[i] key.
-
-    Its size is reserved_size + 1, because the first element is not used (to
-    allow using the same index in both indexes[] and data[] instead of
-    adding 1 to access data[]).
-  */
-  data_type* data;
-
-  //! The number of nodes in the complete tree.
-  /*!
-    It is one less than a power of 2.
-    If this is 0, data and indexes are set to NULL.
-  */
-  dimension_type reserved_size;
-
-  //! The number of values stored in the tree.
-  dimension_type size_;
-};
-
-class CO_Tree::tree_iterator {
-
-public:
-
-  /*!
-    \brief Constructs a tree_iterator pointing at the root node of the
-           specified tree
-
-    \param tree
-    The tree to which the new %iterator will point to.
-    It must not be empty.
-  */
-  explicit tree_iterator(CO_Tree& tree);
-
-  //! Constructs a tree_iterator pointing at the specified node of the tree.
-  /*!
-    \param tree
-    The tree to which the new %iterator will point to.
-    It must not be empty.
-
-    \param i
-    The index of the element in \p tree to which the new %iterator will point
-    to.
-  */
-  tree_iterator(CO_Tree& tree, dimension_type i);
-
-  //! Constructs a tree_iterator from an iterator.
-  /*!
-    \param itr
-    The iterator that will be converted into a tree_iterator.
-    It must not be end().
-
-    \param tree
-    The tree to which the new %iterator will point to.
-    It must not be empty.
-  */
-  tree_iterator(const iterator& itr, CO_Tree& tree);
-
-  //! The assignment operator.
-  /*!
-    \param itr
-    The %iterator that will be assigned into *this.
-  */
-  tree_iterator& operator=(const tree_iterator& itr);
-
-  //! The assignment operator from an iterator.
-  /*!
-    \param itr
-    The iterator that will be assigned into *this.
-  */
-  tree_iterator& operator=(const iterator& itr);
-
-  //! Compares *this with \p itr.
-  /*!
-    \param itr
-    The %iterator that will compared with *this.
-  */
-  bool operator==(const tree_iterator& itr) const;
-
-  //! Compares *this with \p itr.
-  /*!
-    \param itr
-    The %iterator that will compared with *this.
-  */
-  bool operator!=(const tree_iterator& itr) const;
-
-  //! Makes the %iterator point to the root of \p tree.
-  /*!
-    The values of all fields (beside tree) are overwritten.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void get_root();
-
-  //! Makes the %iterator point to the left child of the current node.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  void get_left_child();
-
-  //! Makes the %iterator point to the right child of the current node.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  void get_right_child();
-
-  //! Makes the %iterator point to the parent of the current node.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  void get_parent();
-
-  /*!
-    \brief Searches for an element with key \p key in the subtree rooted at
-           \p *this.
-
-    \param key
-    The searched for key.
-
-    After this method, *this points to the found node (if it exists) or to
-    the node that would be his parent (otherwise).
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  void go_down_searching_key(dimension_type key);
-
-  /*!
-    \brief Follows left children with a value, until it arrives at a leaf or at
-           a node with no value.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void follow_left_children_with_value();
-
-  /*!
-    \brief Follows right children with a value, until it arrives at a leaf or at
-           a node with no value.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void follow_right_children_with_value();
-
-  //! Returns true if the pointed node is the root node.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  bool is_root() const;
-
-  //! Returns true if the pointed node has a parent and is its right child.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  bool is_right_child() const;
-
-  //! Returns true if the pointed node is a leaf of the complete tree.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  bool is_leaf() const;
-
-  //! Returns the key and value of the current node.
-  data_type& operator*();
-
-  //! Returns the key and value of the current node.
-  Coefficient_traits::const_reference operator*() const;
-
-  //! Returns a reference to the index of the element pointed to by \c *this.
-  /*!
-    \returns a reference to the index of the element pointed to by \c *this.
-  */
-  dimension_type& index();
-
-  //! Returns the index of the element pointed to by \c *this.
-  /*!
-    \returns the index of the element pointed to by \c *this.
-  */
-  dimension_type index() const;
-
-  //! Returns the index of the node pointed to by \c *this.
-  /*!
-    \returns the key of the node pointed to by \c *this, or unused_index if
-             the current node does not contain a valid element.
-  */
-  dimension_type key() const;
-
-  //! The tree containing the element pointed to by this %iterator.
-  CO_Tree& tree;
-
-  /*!
-    \brief Returns the index of the current node in the DFS layout of the
-           complete tree.
-  */
-  dimension_type dfs_index() const;
-
-  /*!
-    \brief Returns 2^h, with h the height of the current node in the tree,
-           counting from 0.
-
-    Thus leaves have offset 1.
-    This is faster than depth(), so it is useful to compare node depths.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  dimension_type get_offset() const;
-
-  //! Returns the depth of the current node in the complete tree.
-  /*!
-    This method takes \f$O(\log n)\f$ time.
-  */
-  height_t depth() const;
-
-private:
-  //! Checks the internal invariant.
-  bool OK() const;
-
-  //! The index of the current node in the DFS layout of the complete tree.
-  dimension_type i;
-
-  /*!
-    \brief This is 2^h, with h the height of the current node in the tree,
-           counting from 0.
-
-    Thus leaves have offset 1.
-    This is equal to (i & -i), and is only stored to increase performance.
-  */
-  dimension_type offset;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates CO_Tree */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(CO_Tree& x, CO_Tree& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates CO_Tree::const_iterator */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(CO_Tree::const_iterator& x, CO_Tree::const_iterator& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates CO_Tree::iterator */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(CO_Tree::iterator& x, CO_Tree::iterator& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "CO_Tree.inlines.hh"
-#include "CO_Tree.templates.hh"
-
-#endif // !defined(PPL_CO_Tree_defs_hh)
diff --git a/src/CO_Tree.inlines.hh b/src/CO_Tree.inlines.hh
deleted file mode 100644
index 4722204..0000000
--- a/src/CO_Tree.inlines.hh
+++ /dev/null
@@ -1,864 +0,0 @@
-/* CO_Tree class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_CO_Tree_inlines_hh
-#define PPL_CO_Tree_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline dimension_type
-CO_Tree::dfs_index(const_iterator itr) const {
-  PPL_ASSERT(itr.current_index != 0);
-  PPL_ASSERT(itr.current_index >= indexes + 1);
-  PPL_ASSERT(itr.current_index <= indexes + reserved_size);
-  const ptrdiff_t index = itr.current_index - indexes;
-  return static_cast<dimension_type>(index);
-}
-
-inline dimension_type
-CO_Tree::dfs_index(iterator itr) const {
-  PPL_ASSERT(itr.current_index != 0);
-  PPL_ASSERT(itr.current_index >= indexes + 1);
-  PPL_ASSERT(itr.current_index <= indexes + reserved_size);
-  const ptrdiff_t index = itr.current_index - indexes;
-  return static_cast<dimension_type>(index);
-}
-
-inline
-CO_Tree::CO_Tree() {
-  init(0);
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::CO_Tree(const CO_Tree& y) {
-  PPL_ASSERT(y.OK());
-  data_allocator = y.data_allocator;
-  init(y.reserved_size);
-  copy_data_from(y);
-}
-
-inline CO_Tree&
-CO_Tree::operator=(const CO_Tree& y) {
-  if (this != &y) {
-    destroy();
-    data_allocator = y.data_allocator;
-    init(y.reserved_size);
-    copy_data_from(y);
-  }
-  return *this;
-}
-
-inline void
-CO_Tree::clear() {
-  *this = CO_Tree();
-}
-
-inline
-CO_Tree::~CO_Tree() {
-
-  destroy();
-}
-
-inline bool
-CO_Tree::empty() const {
-  return size_ == 0;
-}
-
-inline dimension_type
-CO_Tree::size() const {
-  return size_;
-}
-
-inline dimension_type
-CO_Tree::max_size() {
-  return C_Integer<dimension_type>::max/100;
-}
-
-inline void
-CO_Tree::dump_tree() const {
-  if (empty())
-    std::cout << "(empty tree)" << std::endl;
-  else
-    dump_subtree(tree_iterator(*const_cast<CO_Tree*>(this)));
-}
-
-inline CO_Tree::iterator
-CO_Tree::insert(const dimension_type key) {
-  if (empty())
-    return insert(key, Coefficient_zero());
-  else {
-    tree_iterator itr(*this);
-    itr.go_down_searching_key(key);
-    if (itr.index() == key)
-      return iterator(itr);
-    else
-      return iterator(insert_precise(key, Coefficient_zero(), itr));
-  }
-}
-
-inline CO_Tree::iterator
-CO_Tree::insert(dimension_type key, data_type_const_reference data1) {
-  if (empty()) {
-    insert_in_empty_tree(key, data1);
-    tree_iterator itr(*this);
-    PPL_ASSERT(itr.index() != unused_index);
-    return iterator(itr);
-  } else {
-    tree_iterator itr(*this);
-    itr.go_down_searching_key(key);
-    return iterator(insert_precise(key, data1, itr));
-  }
-}
-
-inline CO_Tree::iterator
-CO_Tree::erase(dimension_type key) {
-  PPL_ASSERT(key != unused_index);
-
-  if (empty())
-    return end();
-
-  tree_iterator itr(*this);
-  itr.go_down_searching_key(key);
-
-  if (itr.index() == key)
-    return erase(itr);
-
-  iterator result(itr);
-  if (result.index() < key)
-    ++result;
-
-  PPL_ASSERT(result == end() || result.index() > key);
-#ifndef NDEBUG
-  iterator last = end();
-  --last;
-  PPL_ASSERT((result == end()) == (last.index() < key));
-#endif
-
-  return result;
-}
-
-inline CO_Tree::iterator
-CO_Tree::erase(iterator itr) {
-  PPL_ASSERT(itr != end());
-  return erase(tree_iterator(itr, *this));
-}
-
-inline void
-CO_Tree::m_swap(CO_Tree& x) {
-  using std::swap;
-  swap(max_depth, x.max_depth);
-  swap(indexes, x.indexes);
-  swap(data_allocator, x.data_allocator);
-  swap(data, x.data);
-  swap(reserved_size, x.reserved_size);
-  swap(size_, x.size_);
-  // Cached iterators have been invalidated by the swap,
-  // they must be refreshed here.
-  refresh_cached_iterators();
-  x.refresh_cached_iterators();
-  PPL_ASSERT(structure_OK());
-  PPL_ASSERT(x.structure_OK());
-}
-
-inline CO_Tree::iterator
-CO_Tree::begin() {
-  return iterator(*this);
-}
-
-inline const CO_Tree::iterator&
-CO_Tree::end() {
-  return cached_end;
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::begin() const {
-  return const_iterator(*this);
-}
-
-inline const CO_Tree::const_iterator&
-CO_Tree::end() const {
-  return cached_const_end;
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::cbegin() const {
-  return const_iterator(*this);
-}
-
-inline const CO_Tree::const_iterator&
-CO_Tree::cend() const {
-  return cached_const_end;
-}
-
-inline CO_Tree::iterator
-CO_Tree::bisect(dimension_type key) {
-  if (empty())
-    return end();
-  iterator last = end();
-  --last;
-  return bisect_in(begin(), last, key);
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::bisect(dimension_type key) const {
-  if (empty())
-    return end();
-  const_iterator last = end();
-  --last;
-  return bisect_in(begin(), last, key);
-}
-
-inline CO_Tree::iterator
-CO_Tree::bisect_in(iterator first, iterator last, dimension_type key) {
-  PPL_ASSERT(first != end());
-  PPL_ASSERT(last != end());
-  dimension_type index = bisect_in(dfs_index(first), dfs_index(last), key);
-  return iterator(*this, index);
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::bisect_in(const_iterator first, const_iterator last,
-                   dimension_type key) const {
-  PPL_ASSERT(first != end());
-  PPL_ASSERT(last != end());
-  dimension_type index = bisect_in(dfs_index(first), dfs_index(last), key);
-  return const_iterator(*this, index);
-}
-
-inline CO_Tree::iterator
-CO_Tree::bisect_near(iterator hint, dimension_type key) {
-  if (hint == end())
-    return bisect(key);
-  dimension_type index = bisect_near(dfs_index(hint), key);
-  return iterator(*this, index);
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::bisect_near(const_iterator hint, dimension_type key) const {
-  if (hint == end())
-    return bisect(key);
-  dimension_type index = bisect_near(dfs_index(hint), key);
-  return const_iterator(*this, index);
-}
-
-inline void
-CO_Tree::fast_shift(dimension_type i, iterator itr) {
-  PPL_ASSERT(itr != end());
-  PPL_ASSERT(i <= itr.index());
-  indexes[dfs_index(itr)] = i;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::insert_in_empty_tree(dimension_type key,
-                              data_type_const_reference data1) {
-  PPL_ASSERT(empty());
-  rebuild_bigger_tree();
-  tree_iterator itr(*this);
-  PPL_ASSERT(itr.index() == unused_index);
-  new (&(*itr)) data_type(data1);
-  // Set the index afterwards, so that if the constructor above throws
-  // the tree's structure is consistent.
-  itr.index() = key;
-  ++size_;
-
-  PPL_ASSERT(OK());
-}
-
-inline bool
-CO_Tree::is_less_than_ratio(dimension_type numer, dimension_type denom,
-                            dimension_type ratio) {
-  PPL_ASSERT(ratio <= 100);
-  // If these are true, no overflows are possible.
-  PPL_ASSERT(denom <= unused_index/100);
-  PPL_ASSERT(numer <= unused_index/100);
-  return 100*numer < ratio*denom;
-}
-
-inline bool
-CO_Tree::is_greater_than_ratio(dimension_type numer, dimension_type denom,
-                               dimension_type ratio) {
-  PPL_ASSERT(ratio <= 100);
-  // If these are true, no overflows are possible.
-  PPL_ASSERT(denom <= unused_index/100);
-  PPL_ASSERT(numer <= unused_index/100);
-  return 100*numer > ratio*denom;
-}
-
-inline void
-CO_Tree::rebuild_smaller_tree() {
-  PPL_ASSERT(reserved_size > 3);
-  CO_Tree new_tree;
-  new_tree.init(reserved_size / 2);
-  new_tree.move_data_from(*this);
-  m_swap(new_tree);
-  PPL_ASSERT(new_tree.structure_OK());
-  PPL_ASSERT(structure_OK());
-}
-
-inline void
-CO_Tree::refresh_cached_iterators() {
-  cached_end = iterator(*this, reserved_size + 1);
-  cached_const_end = const_iterator(*this, reserved_size + 1);
-}
-
-inline void
-CO_Tree::move_data_element(data_type& to, data_type& from) {
-  // The following code is equivalent (but slower):
-  //
-  // <CODE>
-  //   new (&to) data_type(from);
-  //   from.~data_type();
-  // </CODE>
-  std::memcpy(&to, &from, sizeof(data_type));
-}
-
-
-inline
-CO_Tree::const_iterator::const_iterator()
-  : current_index(0), current_data(0) {
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = 0;
-#endif
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::const_iterator::const_iterator(const CO_Tree& tree1)
-  : current_index(&(tree1.indexes[1])), current_data(&(tree1.data[1])) {
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = &tree1;
-#endif
-  if (!tree1.empty())
-    while (*current_index == unused_index) {
-      ++current_index;
-      ++current_data;
-    }
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::const_iterator::const_iterator(const CO_Tree& tree1,
-                                        dimension_type i)
-  : current_index(&(tree1.indexes[i])), current_data(&(tree1.data[i])) {
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = &tree1;
-#endif
-  PPL_ASSERT(i != 0);
-  PPL_ASSERT(i <= tree1.reserved_size + 1);
-  PPL_ASSERT(tree1.empty() || tree1.indexes[i] != unused_index);
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::const_iterator::const_iterator(const const_iterator& itr2) {
-  (*this) = itr2;
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::const_iterator::const_iterator(const iterator& itr2) {
-  (*this) = itr2;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::const_iterator::m_swap(const_iterator& itr) {
-  using std::swap;
-  swap(current_data, itr.current_data);
-  swap(current_index, itr.current_index);
-#if PPL_CO_TREE_EXTRA_DEBUG
-  swap(tree, itr.tree);
-#endif
-  PPL_ASSERT(OK());
-  PPL_ASSERT(itr.OK());
-}
-
-inline CO_Tree::const_iterator&
-CO_Tree::const_iterator::operator=(const const_iterator& itr2) {
-  current_index = itr2.current_index;
-  current_data = itr2.current_data;
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = itr2.tree;
-#endif
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::const_iterator&
-CO_Tree::const_iterator::operator=(const iterator& itr2) {
-  current_index = itr2.current_index;
-  current_data = itr2.current_data;
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = itr2.tree;
-#endif
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::const_iterator&
-CO_Tree::const_iterator::operator++() {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  ++current_index;
-  ++current_data;
-  while (*current_index == unused_index) {
-    ++current_index;
-    ++current_data;
-  }
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::const_iterator&
-CO_Tree::const_iterator::operator--() {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  --current_index;
-  --current_data;
-  while (*current_index == unused_index) {
-    --current_index;
-    --current_data;
-  }
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::const_iterator::operator++(int) {
-  const_iterator itr(*this);
-  ++(*this);
-  return itr;
-}
-
-inline CO_Tree::const_iterator
-CO_Tree::const_iterator::operator--(int) {
-  const_iterator itr(*this);
-  --(*this);
-  return itr;
-}
-
-inline Coefficient_traits::const_reference
-CO_Tree::const_iterator::operator*() const {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  PPL_ASSERT(OK());
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  return *current_data;
-}
-
-inline dimension_type
-CO_Tree::const_iterator::index() const {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  PPL_ASSERT(OK());
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  return *current_index;
-}
-
-inline bool
-CO_Tree::const_iterator::operator==(const const_iterator& x) const {
-  PPL_ASSERT((current_index == x.current_index)
-             == (current_data == x.current_data));
-  PPL_ASSERT(OK());
-  return (current_index == x.current_index);
-}
-
-inline bool
-CO_Tree::const_iterator::operator!=(const const_iterator& x) const {
-  return !(*this == x);
-}
-
-
-inline
-CO_Tree::iterator::iterator()
-  : current_index(0), current_data(0) {
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = 0;
-#endif
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::iterator::iterator(CO_Tree& tree1)
-  : current_index(&(tree1.indexes[1])), current_data(&(tree1.data[1])) {
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = &tree1;
-#endif
-  if (!tree1.empty())
-    while (*current_index == unused_index) {
-      ++current_index;
-      ++current_data;
-    }
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::iterator::iterator(CO_Tree& tree1, dimension_type i)
-  : current_index(&(tree1.indexes[i])), current_data(&(tree1.data[i])) {
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = &tree1;
-#endif
-  PPL_ASSERT(i != 0);
-  PPL_ASSERT(i <= tree1.reserved_size + 1);
-  PPL_ASSERT(tree1.empty() || tree1.indexes[i] != unused_index);
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::iterator::iterator(const tree_iterator& itr) {
-  *this = itr;
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::iterator::iterator(const iterator& itr2) {
-  (*this) = itr2;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::iterator::m_swap(iterator& itr) {
-  using std::swap;
-  swap(current_data, itr.current_data);
-  swap(current_index, itr.current_index);
-#if PPL_CO_TREE_EXTRA_DEBUG
-  swap(tree, itr.tree);
-#endif
-  PPL_ASSERT(OK());
-  PPL_ASSERT(itr.OK());
-}
-
-inline CO_Tree::iterator&
-CO_Tree::iterator::operator=(const tree_iterator& itr) {
-  current_index = &(itr.tree.indexes[itr.dfs_index()]);
-  current_data = &(itr.tree.data[itr.dfs_index()]);
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = &(itr.tree);
-#endif
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::iterator&
-CO_Tree::iterator::operator=(const iterator& itr2) {
-  current_index = itr2.current_index;
-  current_data = itr2.current_data;
-#if PPL_CO_TREE_EXTRA_DEBUG
-  tree = itr2.tree;
-#endif
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::iterator&
-CO_Tree::iterator::operator++() {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  ++current_index;
-  ++current_data;
-  while (*current_index == unused_index) {
-    ++current_index;
-    ++current_data;
-  }
-
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::iterator&
-CO_Tree::iterator::operator--() {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  --current_index;
-  --current_data;
-  while (*current_index == unused_index) {
-    --current_index;
-    --current_data;
-  }
-
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline CO_Tree::iterator
-CO_Tree::iterator::operator++(int) {
-  iterator itr(*this);
-  ++(*this);
-  return itr;
-}
-
-inline CO_Tree::iterator
-CO_Tree::iterator::operator--(int) {
-  iterator itr(*this);
-  --(*this);
-  return itr;
-}
-
-inline CO_Tree::data_type&
-CO_Tree::iterator::operator*() {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  PPL_ASSERT(OK());
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  return *current_data;
-}
-
-inline Coefficient_traits::const_reference
-CO_Tree::iterator::operator*() const {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  PPL_ASSERT(OK());
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  return *current_data;
-}
-
-inline dimension_type
-CO_Tree::iterator::index() const {
-  PPL_ASSERT(current_index != 0);
-  PPL_ASSERT(current_data != 0);
-  PPL_ASSERT(OK());
-#if PPL_CO_TREE_EXTRA_DEBUG
-  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
-#endif
-  return *current_index;
-}
-
-inline bool
-CO_Tree::iterator::operator==(const iterator& x) const {
-  PPL_ASSERT((current_index == x.current_index)
-             == (current_data == x.current_data));
-  PPL_ASSERT(OK());
-  return (current_index == x.current_index);
-}
-
-inline bool
-CO_Tree::iterator::operator!=(const iterator& x) const {
-  return !(*this == x);
-}
-
-
-inline
-CO_Tree::tree_iterator::tree_iterator(CO_Tree& tree1)
-  : tree(tree1) {
-  PPL_ASSERT(tree.reserved_size != 0);
-  get_root();
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::tree_iterator::tree_iterator(CO_Tree& tree1, dimension_type i1)
-  : tree(tree1) {
-  PPL_ASSERT(tree.reserved_size != 0);
-  PPL_ASSERT(i1 <= tree.reserved_size + 1);
-  i = i1;
-  offset = least_significant_one_mask(i);
-  PPL_ASSERT(OK());
-}
-
-inline
-CO_Tree::tree_iterator::tree_iterator(const iterator& itr, CO_Tree& tree1)
-  : tree(tree1) {
-  PPL_ASSERT(tree.reserved_size != 0);
-  *this = itr;
-  PPL_ASSERT(OK());
-}
-
-inline CO_Tree::tree_iterator&
-CO_Tree::tree_iterator::operator=(const tree_iterator& itr) {
-  PPL_ASSERT(&tree == &(itr.tree));
-  i = itr.i;
-  offset = itr.offset;
-  return *this;
-}
-
-inline CO_Tree::tree_iterator&
-CO_Tree::tree_iterator::operator=(const iterator& itr) {
-  PPL_ASSERT(itr != tree.end());
-  i = tree.dfs_index(itr);
-  offset = least_significant_one_mask(i);
-  return *this;
-}
-
-inline bool
-CO_Tree::tree_iterator::operator==(const tree_iterator& itr) const {
-  return i == itr.i;
-}
-
-inline bool
-CO_Tree::tree_iterator::operator!=(const tree_iterator& itr) const {
-  return !(*this == itr);
-}
-
-inline void
-CO_Tree::tree_iterator::get_root() {
-  i = tree.reserved_size / 2 + 1;
-  offset = i;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::tree_iterator::get_left_child() {
-  PPL_ASSERT(offset != 0);
-  PPL_ASSERT(offset != 1);
-  offset /= 2;
-  i -= offset;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::tree_iterator::get_right_child() {
-  PPL_ASSERT(offset != 0);
-  PPL_ASSERT(offset != 1);
-  offset /= 2;
-  i += offset;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::tree_iterator::get_parent() {
-  PPL_ASSERT(!is_root());
-  PPL_ASSERT(offset != 0);
-  i &= ~offset;
-  offset *= 2;
-  i |= offset;
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::tree_iterator::follow_left_children_with_value() {
-  PPL_ASSERT(index() != unused_index);
-  dimension_type* p = tree.indexes;
-  p += i;
-  p -= (offset - 1);
-  while (*p == unused_index)
-    ++p;
-  ptrdiff_t distance = p - tree.indexes;
-  PPL_ASSERT(distance >= 0);
-  i = static_cast<dimension_type>(distance);
-  offset = least_significant_one_mask(i);
-  PPL_ASSERT(OK());
-}
-
-inline void
-CO_Tree::tree_iterator::follow_right_children_with_value() {
-  PPL_ASSERT(index() != unused_index);
-  dimension_type* p = tree.indexes;
-  p += i;
-  p += (offset - 1);
-  while (*p == unused_index)
-    --p;
-  ptrdiff_t distance = p - tree.indexes;
-  PPL_ASSERT(distance >= 0);
-  i = static_cast<dimension_type>(distance);
-  offset = least_significant_one_mask(i);
-  PPL_ASSERT(OK());
-}
-
-inline bool
-CO_Tree::tree_iterator::is_root() const {
-  // This is implied by OK(), it is here for reference only.
-  PPL_ASSERT(offset <= (tree.reserved_size / 2 + 1));
-  return offset == (tree.reserved_size / 2 + 1);
-}
-
-inline bool
-CO_Tree::tree_iterator::is_right_child() const {
-  if (is_root())
-    return false;
-  return (i & (2*offset)) != 0;
-}
-
-inline bool
-CO_Tree::tree_iterator::is_leaf() const {
-  return offset == 1;
-}
-
-inline CO_Tree::data_type&
-CO_Tree::tree_iterator::operator*() {
-  return tree.data[i];
-}
-
-inline Coefficient_traits::const_reference
-CO_Tree::tree_iterator::operator*() const {
-  return tree.data[i];
-}
-
-inline dimension_type&
-CO_Tree::tree_iterator::index() {
-  return tree.indexes[i];
-}
-
-inline dimension_type
-CO_Tree::tree_iterator::index() const {
-  return tree.indexes[i];
-}
-
-inline dimension_type
-CO_Tree::tree_iterator::dfs_index() const {
-  return i;
-}
-
-inline dimension_type
-CO_Tree::tree_iterator::get_offset() const {
-  return offset;
-}
-
-inline CO_Tree::height_t
-CO_Tree::tree_iterator::depth() const {
-  return integer_log2((tree.reserved_size + 1) / offset);
-}
-
-inline void
-swap(CO_Tree& x, CO_Tree& y) {
-  x.m_swap(y);
-}
-
-inline void
-swap(CO_Tree::const_iterator& x, CO_Tree::const_iterator& y) {
-  x.m_swap(y);
-}
-
-inline void
-swap(CO_Tree::iterator& x, CO_Tree::iterator& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_CO_Tree_inlines_hh)
diff --git a/src/CO_Tree.templates.hh b/src/CO_Tree.templates.hh
deleted file mode 100644
index a498adf..0000000
--- a/src/CO_Tree.templates.hh
+++ /dev/null
@@ -1,139 +0,0 @@
-/* CO_Tree class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_CO_Tree_templates_hh
-#define PPL_CO_Tree_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Iterator>
-CO_Tree::CO_Tree(Iterator i, dimension_type n) {
-
-  if (n == 0) {
-    init(0);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  dimension_type new_max_depth = integer_log2(n) + 1;
-  reserved_size = (static_cast<dimension_type>(1) << new_max_depth) - 1;
-
-  if (is_greater_than_ratio(n, reserved_size, max_density_percent)
-      && reserved_size != 3)
-    reserved_size = reserved_size*2 + 1;
-
-  init(reserved_size);
-
-  tree_iterator root(*this);
-
-  // This is static and with static allocation, to improve performance.
-  // sizeof_to_bits(sizeof(dimension_type)) is the maximum k such that
-  // 2^k-1 is a dimension_type, so it is the maximum tree height.
-  // For each node level, the stack may contain up to 4 elements: two elements
-  // with operation 0, one element with operation 2 and one element
-  // with operation 3. An additional element with operation 1 can be at the
-  // top of the tree.
-  static std::pair<dimension_type, signed char>
-    stack[4U * sizeof_to_bits(sizeof(dimension_type)) + 1U];
-
-  dimension_type stack_first_empty = 0;
-
-  // A pair (n, operation) in the stack means:
-  //
-  // * Go to the parent, if operation is 0.
-  // * Go to the left child, then fill the current tree with n elements, if
-  //   operation is 1.
-  // * Go to the right child, then fill the current tree with n elements, if
-  //   operation is 2.
-  // * Fill the current tree with n elements, if operation is 3.
-
-  stack[0].first = n;
-  stack[0].second = 3;
-  ++stack_first_empty;
-
-  while (stack_first_empty != 0) {
-
-    // Implement
-    //
-    // <CODE>
-    //   top_n         = stack.top().first;
-    //   top_operation = stack.top().second;
-    // </CODE>
-    const dimension_type top_n = stack[stack_first_empty - 1].first;
-    const signed char top_operation = stack[stack_first_empty - 1].second;
-
-    switch (top_operation) {
-
-    case 0:
-      root.get_parent();
-      --stack_first_empty;
-      continue;
-
-    case 1:
-      root.get_left_child();
-      break;
-
-    case 2:
-      root.get_right_child();
-      break;
-#ifndef NDEBUG
-    case 3:
-      break;
-
-    default:
-      // We should not be here
-      PPL_UNREACHABLE;
-#endif
-    }
-
-    // We now visit the current tree
-
-    if (top_n == 0) {
-      --stack_first_empty;
-    } else {
-      if (top_n == 1) {
-        PPL_ASSERT(root.index() == unused_index);
-        root.index() = i.index();
-        new (&(*root)) data_type(*i);
-        ++i;
-        --stack_first_empty;
-      } else {
-        PPL_ASSERT(stack_first_empty + 3 < sizeof(stack)/sizeof(stack[0]));
-
-        const dimension_type half = (top_n + 1) / 2;
-        stack[stack_first_empty - 1].second = 0;
-        stack[stack_first_empty    ] = std::make_pair(top_n - half, 2);
-        stack[stack_first_empty + 1] = std::make_pair(1, 3);
-        stack[stack_first_empty + 2].second = 0;
-        stack[stack_first_empty + 3] = std::make_pair(half - 1, 1);
-        stack_first_empty += 4;
-      }
-    }
-  }
-  size_ = n;
-  PPL_ASSERT(OK());
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_CO_Tree_templates_hh)
diff --git a/src/CO_Tree.types.hh b/src/CO_Tree.types.hh
deleted file mode 100644
index b7157a0..0000000
--- a/src/CO_Tree.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_CO_Tree_types_hh
-#define PPL_CO_Tree_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class CO_Tree;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_CO_Tree_types_hh)
diff --git a/src/CO_Tree_defs.hh b/src/CO_Tree_defs.hh
new file mode 100644
index 0000000..223e390
--- /dev/null
+++ b/src/CO_Tree_defs.hh
@@ -0,0 +1,1559 @@
+/* CO_Tree class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_CO_Tree_defs_hh
+#define PPL_CO_Tree_defs_hh 1
+
+#include "CO_Tree_types.hh"
+
+#include "Coefficient_defs.hh"
+#include <memory>
+
+#ifndef PPL_CO_TREE_EXTRA_DEBUG
+#ifdef PPL_ABI_BREAKING_EXTRA_DEBUG
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*!
+  \brief
+  Enables extra debugging information for class CO_Tree.
+
+  \ingroup PPL_CXX_interface
+  When <CODE>PPL_CO_TREE_EXTRA_DEBUG</CODE> evaluates to <CODE>true</CODE>,
+  each CO_Tree iterator and const_iterator carries a pointer to the associated
+  tree; this enables extra consistency checks to be performed.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+#define PPL_CO_TREE_EXTRA_DEBUG 1
+#else // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
+#define PPL_CO_TREE_EXTRA_DEBUG 0
+#endif // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
+#endif // !defined(PPL_CO_TREE_EXTRA_DEBUG)
+
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A cache-oblivious binary search tree of pairs.
+/*! \ingroup PPL_CXX_interface
+  This class implements a binary search tree with keys of dimension_type type
+  and data of Coefficient type, laid out in a dynamically-sized array.
+
+  The array-based layout saves calls to new/delete (to insert \f$n\f$ elements
+  only \f$O(\log n)\f$ allocations are performed) and, more importantly, is
+  much more cache-friendly than a standard (pointer-based) tree, because the
+  elements are stored sequentially in memory (leaving some holes to allow
+  fast insertion of new elements).
+  The downside of this representation is that all iterators are invalidated
+  when an element is added or removed, because the array could have been
+  enlarged or shrunk. This is partially addressed by providing references to
+  internal end iterators that are updated when needed.
+
+  B-trees are cache-friendly too, but the cache size is fixed (usually at
+  compile-time). This raises two problems: firstly the cache size must be
+  known in advance and those data structures do not perform well with other
+  cache sizes and, secondly, even if the cache size is known, the
+  optimizations target only one level of cache. This kind of data structures
+  are called cache aware. This implementation, instead, is cache oblivious:
+  it performs well with every cache size, and thus exploits all of the
+  available caches.
+
+  Assuming \p n is the number of elements in the tree and \p B is the number
+  of (dimension_type, Coefficient) pairs that fit in a cache line, the
+  time and cache misses complexities are the following:
+
+  - Insertions/Queries/Deletions: \f$O(\log^2 n)\f$ time,
+                                  \f$O(\log \frac{n}{B}))\f$ cache misses.
+  - Tree traversal from begin() to end(), using an %iterator: \f$O(n)\f$ time,
+         \f$O(\frac{n}{B})\f$  cache misses.
+  - Queries with a hint: \f$O(\log k)\f$ time and \f$O(\log \frac{k}{B})\f$
+    cache misses, where k is the distance between the given %iterator and the
+    searched element (or the position where it would have been).
+
+  The binary search tree is embedded in a (slightly bigger) complete tree,
+  that is enlarged and shrunk when needed. The complete tree is laid out
+  in an in-order DFS layout in two arrays: one for the keys and one for the
+  associated data.
+  The indexes and values are stored in different arrays to reduce
+  cache-misses during key queries.
+
+  The tree can store up to \f$(-(dimension_type)1)/100\f$ elements.
+  This limit allows faster density computations, but can be removed if needed.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class CO_Tree {
+
+public:
+  class const_iterator;
+  class iterator;
+
+private:
+  //! This is used for node heights and depths in the tree.
+  typedef unsigned height_t;
+
+  PPL_COMPILE_TIME_CHECK(C_Integer<height_t>::max
+                         >= sizeof_to_bits(sizeof(dimension_type)),
+                         "height_t is too small to store depths.");
+
+  class tree_iterator;
+
+  // This must be declared here, because it is a friend of const_iterator.
+  //! Returns the index of the current element in the DFS layout of the
+  //! complete tree.
+  /*!
+    \return the index of the current element in the DFS layout of the complete
+            tree.
+
+    \param itr the iterator that points to the desired element.
+  */
+  dimension_type dfs_index(const_iterator itr) const;
+
+  // This must be declared here, because it is a friend of iterator.
+  //! Returns the index of the current element in the DFS layout of the
+  //! complete tree.
+  /*!
+    \return the index of the current element in the DFS layout of the complete
+            tree.
+
+    \param itr the iterator that points to the desired element.
+  */
+  dimension_type dfs_index(iterator itr) const;
+
+public:
+
+  //! The type of the data elements associated with keys.
+  /*!
+    If this is changed, occurrences of Coefficient_zero() in the CO_Tree
+    implementation have to be replaced with constants of the correct type.
+  */
+  typedef Coefficient data_type;
+  typedef Coefficient_traits::const_reference data_type_const_reference;
+
+  //! A const %iterator on the tree elements, ordered by key.
+  /*!
+    Iterator increment and decrement operations are \f$O(1)\f$ time.
+    These iterators are invalidated by operations that add or remove elements
+    from the tree.
+  */
+  class const_iterator {
+  private:
+  public:
+
+    typedef std::bidirectional_iterator_tag iterator_category;
+    typedef const data_type value_type;
+    typedef ptrdiff_t difference_type;
+    typedef value_type* pointer;
+    typedef data_type_const_reference reference;
+
+    //! Constructs an invalid const_iterator.
+    /*!
+      This constructor takes \f$O(1)\f$ time.
+    */
+    explicit const_iterator();
+
+    //! Constructs an %iterator pointing to the first element of the tree.
+    /*!
+      \param tree
+      The tree that the new %iterator will point to.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    explicit const_iterator(const CO_Tree& tree);
+
+    //! Constructs a const_iterator pointing to the i-th node of the tree.
+    /*!
+      \param tree
+      The tree that the new %iterator will point to.
+
+      \param i
+      The index of the element in \p tree to which the %iterator will point
+      to.
+
+      The i-th node must be a node with a value or end().
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    const_iterator(const CO_Tree& tree, dimension_type i);
+
+    //! The copy constructor.
+    /*!
+      \param itr
+      The %iterator that will be copied.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    const_iterator(const const_iterator& itr);
+
+    //! Converts an iterator into a const_iterator.
+    /*!
+      \param itr
+      The iterator that will be converted into a const_iterator.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    const_iterator(const iterator& itr);
+
+    //! Swaps itr with *this.
+    /*!
+      \param itr
+      The %iterator that will be swapped with *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    void m_swap(const_iterator& itr);
+
+    //! Assigns \p itr to *this .
+    /*!
+      \param itr
+      The %iterator that will be assigned into *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator& operator=(const const_iterator& itr);
+
+    //! Assigns \p itr to *this .
+    /*!
+      \param itr
+      The %iterator that will be assigned into *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator& operator=(const iterator& itr);
+
+    //! Navigates to the next element.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator& operator++();
+
+    //! Navigates to the previous element.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator& operator--();
+
+    //! Navigates to the next element.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator operator++(int);
+
+    //! Navigates to the previous element.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator operator--(int);
+
+    //! Returns the current element.
+    data_type_const_reference operator*() const;
+
+    //! Returns the index of the element pointed to by \c *this.
+    /*!
+      \returns the index of the element pointed to by \c *this.
+    */
+    dimension_type index() const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    bool operator==(const const_iterator& x) const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    bool operator!=(const const_iterator& x) const;
+
+  private:
+    //! Checks the internal invariants, in debug mode only.
+    bool OK() const;
+
+    //! A pointer to the corresponding element of the tree's indexes[] array.
+    const dimension_type* current_index;
+
+    //! A pointer to the corresponding element of the tree's data[] array.
+    const data_type* current_data;
+
+#if PPL_CO_TREE_EXTRA_DEBUG
+    //! A pointer to the corresponding tree, used for debug purposes only.
+    const CO_Tree* tree;
+#endif
+
+    friend dimension_type CO_Tree::dfs_index(const_iterator itr) const;
+  };
+
+  //! An %iterator on the tree elements, ordered by key.
+  /*!
+    Iterator increment and decrement operations are \f$O(1)\f$ time.
+    These iterators are invalidated by operations that add or remove elements
+    from the tree.
+  */
+  class iterator {
+  public:
+
+    typedef std::bidirectional_iterator_tag iterator_category;
+    typedef data_type value_type;
+    typedef ptrdiff_t difference_type;
+    typedef value_type* pointer;
+    typedef value_type& reference;
+
+    //! Constructs an invalid iterator.
+    /*!
+      This constructor takes \f$O(1)\f$ time.
+    */
+    iterator();
+
+    //! Constructs an %iterator pointing to first element of the tree.
+    /*!
+      \param tree
+      The tree to which the new %iterator will point to.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    explicit iterator(CO_Tree& tree);
+
+    //! Constructs an %iterator pointing to the i-th node.
+    /*!
+      \param tree
+      The tree to which the new %iterator will point to.
+
+      \param i
+      The index of the element in \p tree to which the new %iterator will
+      point to.
+
+      The i-th node must be a node with a value or end().
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    iterator(CO_Tree& tree, dimension_type i);
+
+    //! The constructor from a tree_iterator.
+    /*!
+      \param itr
+      The tree_iterator that will be converted into an iterator.
+
+      This is meant for use by CO_Tree only.
+      This is not private to avoid the friend declaration.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    explicit iterator(const tree_iterator& itr);
+
+    //! The copy constructor.
+    /*!
+      \param itr
+      The %iterator that will be copied.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    iterator(const iterator& itr);
+
+    //! Swaps itr with *this.
+    /*!
+      \param itr
+      The %iterator that will be swapped with *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    void m_swap(iterator& itr);
+
+    //! Assigns \p itr to *this .
+    /*!
+      \param itr
+      The %iterator that will be assigned into *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    iterator& operator=(const iterator& itr);
+
+    //! Assigns \p itr to *this .
+    /*!
+      \param itr
+      The %iterator that will be assigned into *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    iterator& operator=(const tree_iterator& itr);
+
+    //! Navigates to the next element in the tree.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    iterator& operator++();
+
+    //! Navigates to the previous element in the tree.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    iterator& operator--();
+
+    //! Navigates to the next element in the tree.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    iterator operator++(int);
+
+    //! Navigates to the previous element in the tree.
+    /*!
+      This method takes \f$O(1)\f$ time.
+    */
+    iterator operator--(int);
+
+    //! Returns the current element.
+    data_type& operator*();
+
+    //! Returns the current element.
+    data_type_const_reference operator*() const;
+
+    //! Returns the index of the element pointed to by \c *this.
+    /*!
+      \returns the index of the element pointed to by \c *this.
+    */
+    dimension_type index() const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    bool operator==(const iterator& x) const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    bool operator!=(const iterator& x) const;
+
+  private:
+    //! Checks the internal invariants, in debug mode only.
+    bool OK() const;
+
+    //! A pointer to the corresponding element of the tree's indexes[] array.
+    const dimension_type* current_index;
+
+    //! A pointer to the corresponding element of the tree's data[] array.
+    data_type* current_data;
+
+#if PPL_CO_TREE_EXTRA_DEBUG
+    //! A pointer to the corresponding tree, used for debug purposes only.
+    CO_Tree* tree;
+#endif
+
+    friend const_iterator& const_iterator::operator=(const iterator&);
+    friend dimension_type CO_Tree::dfs_index(iterator itr) const;
+  };
+
+  //! Constructs an empty tree.
+  /*!
+    This constructor takes \f$O(1)\f$ time.
+  */
+  CO_Tree();
+
+  //! The copy constructor.
+  /*!
+    \param y
+    The tree that will be copied.
+
+    This constructor takes \f$O(n)\f$ time.
+  */
+  CO_Tree(const CO_Tree& y);
+
+  //! A constructor from a sequence of \p n elements.
+  /*!
+    \param i
+    An iterator that points to the first element of the sequence.
+
+    \param n
+    The number of elements in the [i, i_end) sequence.
+
+    i must be an input iterator on a sequence of data_type elements,
+    sorted by index.
+    Objects of Iterator type must have an index() method that returns the
+    index with which the element pointed to by the iterator must be inserted.
+
+    This constructor takes \f$O(n)\f$ time, so it is more efficient than
+    the construction of an empty tree followed by n insertions, that would
+    take \f$O(n*\log^2 n)\f$ time.
+  */
+  template <typename Iterator>
+  CO_Tree(Iterator i, dimension_type n);
+
+  //! The assignment operator.
+  /*!
+    \param y
+    The tree that will be assigned to *this.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  CO_Tree& operator=(const CO_Tree& y);
+
+  //! Removes all elements from the tree.
+  /*!
+    This method takes \f$O(n)\f$ time.
+  */
+  void clear();
+
+  //! The destructor.
+  /*!
+    This destructor takes \f$O(n)\f$ time.
+  */
+  ~CO_Tree();
+
+  //! Returns \p true if the tree has no elements.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  bool empty() const;
+
+  //! Returns the number of elements stored in the tree.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  dimension_type size() const;
+
+  //! Returns the size() of the largest possible CO_Tree.
+  static dimension_type max_size();
+
+  //! Dumps the tree to stdout, for debugging purposes.
+  void dump_tree() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  /*!
+    This method takes \f$O(n)\f$ time.
+  */
+  dimension_type external_memory_in_bytes() const;
+
+  //! Inserts an element in the tree.
+  /*!
+    \returns
+    An %iterator that points to the inserted pair.
+
+    \param key
+    The key that will be inserted into the tree, associated with the default
+    data.
+
+    If such a pair already exists, an %iterator pointing to that pair is
+    returned.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log n)\f$ time if the element already exists, and
+    \f$O(\log^2 n)\f$ amortized time otherwise.
+  */
+  iterator insert(dimension_type key);
+
+  //! Inserts an element in the tree.
+  /*!
+    \returns
+    An %iterator that points to the inserted element.
+
+    \param key
+    The key that will be inserted into the tree..
+
+    \param data
+    The data that will be inserted into the tree.
+
+    If an element with the specified key already exists, its associated data
+    is set to \p data and an %iterator pointing to that pair is returned.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log n)\f$ time if the element already exists, and
+    \f$O(\log^2 n)\f$ amortized time otherwise.amortized
+  */
+  iterator insert(dimension_type key, data_type_const_reference data);
+
+  //! Inserts an element in the tree.
+  /*!
+    \return
+    An %iterator that points to the inserted element.
+
+    \param itr
+    The %iterator used as hint
+
+    \param key
+    The key that will be inserted into the tree, associated with the default
+    data.
+
+    This will be faster if \p itr points near to the place where the new
+    element will be inserted (or where is already stored).
+    However, the value of \p itr does not affect the result of this
+    method, as long it is a valid %iterator for this tree. \p itr may even be
+    end().
+
+    If an element with the specified key already exists, an %iterator pointing
+    to that pair is returned.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log n)\f$ time if the element already exists, and
+    \f$O(\log^2 n)\f$ amortized time otherwise.
+  */
+  iterator insert(iterator itr, dimension_type key);
+
+  //! Inserts an element in the tree.
+  /*!
+    \return
+    An iterator that points to the inserted element.
+
+    \param itr
+    The iterator used as hint
+
+    \param key
+    The key that will be inserted into the tree.
+
+    \param data
+    The data that will be inserted into the tree.
+
+    This will be faster if \p itr points near to the place where the new
+    element will be inserted (or where is already stored).
+    However, the value of \p itr does not affect the result of this
+    method, as long it is a valid iterator for this tree. \p itr may even be
+    end().
+
+    If an element with the specified key already exists, its associated data
+    is set to \p data and an iterator pointing to that pair is returned.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log n)\f$ time if the element already exists,
+    and \f$O(\log^2 n)\f$ amortized time otherwise.
+  */
+  iterator insert(iterator itr, dimension_type key,
+                  data_type_const_reference data);
+
+  //! Erases the element with key \p key from the tree.
+  /*!
+    This operation invalidates existing iterators.
+
+    \returns an iterator to the next element (or end() if there are no
+             elements with key greater than \p key ).
+
+    \param key
+    The key of the element that will be erased from the tree.
+
+    This method takes \f$O(\log n)\f$ time if the element already exists,
+    and \f$O(\log^2 n)\f$ amortized time otherwise.
+  */
+  iterator erase(dimension_type key);
+
+  //! Erases the element pointed to by \p itr from the tree.
+  /*!
+    This operation invalidates existing iterators.
+
+    \returns an iterator to the next element (or end() if there are no
+             elements with key greater than \p key ).
+
+    \param itr
+    An iterator pointing to the element that will be erased from the tree.
+
+    This method takes \f$O(\log n)\f$ time if the element already exists, and
+    \f$O(\log^2 n)\f$ amortized time otherwise.
+  */
+  iterator erase(iterator itr);
+
+  /*!
+    \brief Removes the element with key \p key (if it exists) and decrements
+           by 1 all elements' keys that were greater than \p key.
+
+    \param key
+    The key of the element that will be erased from the tree.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(k+\log^2 n)\f$ expected time, where k is the number
+    of elements with keys greater than \p key.
+  */
+  void erase_element_and_shift_left(dimension_type key);
+
+  //! Adds \p n to all keys greater than or equal to \p key.
+  /*!
+    \param key
+    The key of the first element whose key will be increased.
+
+    \param n
+    Specifies how much the keys will be increased.
+
+    This method takes \f$O(k+\log n)\f$ expected time, where k is the number
+    of elements with keys greater than or equal to \p key.
+  */
+  void increase_keys_from(dimension_type key, dimension_type n);
+
+  //! Sets to \p i the key of *itr. Assumes that i<=itr.index() and that there
+  //! are no elements with keys in [i,itr.index()).
+  /*!
+    All existing iterators remain valid.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void fast_shift(dimension_type i, iterator itr);
+
+  //! Swaps x with *this.
+  /*!
+    \param x
+    The tree that will be swapped with *this.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void m_swap(CO_Tree& x);
+
+  //! Returns an iterator that points at the first element.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  iterator begin();
+
+  //! Returns an iterator that points after the last element.
+  /*!
+    This method always returns a reference to the same internal %iterator,
+    that is updated at each operation that modifies the structure.
+    Client code can keep a const reference to that %iterator instead of
+    keep updating a local %iterator.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  const iterator& end();
+
+  //! Equivalent to cbegin().
+  const_iterator begin() const;
+
+  //! Equivalent to cend().
+  const const_iterator& end() const;
+
+  //! Returns a const_iterator that points at the first element.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  const_iterator cbegin() const;
+
+  //! Returns a const_iterator that points after the last element.
+  /*!
+    This method always returns a reference to the same internal %iterator,
+    that is updated at each operation that modifies the structure.
+    Client code can keep a const reference to that %iterator instead of
+    keep updating a local %iterator.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  const const_iterator& cend() const;
+
+  //! Searches an element with key \p key using bisection.
+  /*!
+    \param key
+    The key that will be searched for.
+
+    If the element is found, an %iterator pointing to that element is
+    returned; otherwise, the returned %iterator refers to the immediately
+    preceding or succeeding value.
+    If the tree is empty, end() is returned.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  iterator bisect(dimension_type key);
+
+  //! Searches an element with key \p key using bisection.
+  /*!
+    \param key
+    The key that will be searched for.
+
+    If the element is found, an %iterator pointing to that element is
+    returned; otherwise, the returned %iterator refers to the immediately
+    preceding or succeeding value.
+    If the tree is empty, end() is returned.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  const_iterator bisect(dimension_type key) const;
+
+  //! Searches an element with key \p key in [first, last] using bisection.
+  /*!
+    \param first
+    An %iterator pointing to the first element in the range.
+    It must not be end().
+
+    \param last
+    An %iterator pointing to the last element in the range.
+    Note that this is included in the search.
+    It must not be end().
+
+    \param key
+    The key that will be searched for.
+
+    \return
+    If the specified key is found, an %iterator pointing to that element is
+    returned; otherwise, the returned %iterator refers to the immediately
+    preceding or succeeding value.
+    If the tree is empty, end() is returned.
+
+    This method takes \f$O(\log(last - first + 1))\f$ time.
+  */
+  iterator bisect_in(iterator first, iterator last, dimension_type key);
+
+  //! Searches an element with key \p key in [first, last] using bisection.
+  /*!
+    \param first
+    An %iterator pointing to the first element in the range.
+    It must not be end().
+
+    \param last
+    An %iterator pointing to the last element in the range.
+    Note that this is included in the search.
+    It must not be end().
+
+    \param key
+    The key that will be searched for.
+
+    \return
+    If the specified key is found, an %iterator pointing to that element is
+    returned; otherwise, the returned %iterator refers to the immediately
+    preceding or succeeding value.
+    If the tree is empty, end() is returned.
+
+    This method takes \f$O(\log(last - first + 1))\f$ time.
+  */
+  const_iterator bisect_in(const_iterator first, const_iterator last,
+                           dimension_type key) const;
+
+  //! Searches an element with key \p key near \p hint.
+  /*!
+    \param hint
+    An %iterator used as a hint.
+
+    \param key
+    The key that will be searched for.
+
+    If the element is found, the returned %iterator points to that element;
+    otherwise, it points to the immediately preceding or succeeding value.
+    If the tree is empty, end() is returned.
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this tree. \p itr may even be end().
+
+    This method takes \f$O(\log n)\f$ time. If the distance between the
+    returned position and \p hint is \f$O(1)\f$ it takes \f$O(1)\f$ time.
+  */
+  iterator bisect_near(iterator hint, dimension_type key);
+
+  //! Searches an element with key \p key near \p hint.
+  /*!
+    \param hint
+    An %iterator used as a hint.
+
+    \param key
+    The key that will be searched for.
+
+    If the element is found, the returned %iterator points to that element;
+    otherwise, it points to the immediately preceding or succeeding value.
+    If the tree is empty, end() is returned.
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this tree. \p itr may even be end().
+
+    This method takes \f$O(\log n)\f$ time. If the distance between the
+    returned position and \p hint is \f$O(1)\f$ it takes \f$O(1)\f$ time.
+  */
+  const_iterator bisect_near(const_iterator hint, dimension_type key) const;
+
+private:
+
+  //! Searches an element with key \p key in [first, last] using bisection.
+  /*!
+    \param first
+    The index of the first element in the range.
+    It must be the index of an element with a value.
+
+    \param last
+    The index of the last element in the range.
+    It must be the index of an element with a value.
+    Note that this is included in the search.
+
+    \param key
+    The key that will be searched for.
+
+    \return
+    If the element is found, the index of that element is returned; otherwise,
+    the returned index refers to the immediately preceding or succeeding
+    value.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  dimension_type bisect_in(dimension_type first, dimension_type last,
+                           dimension_type key) const;
+
+  //! Searches an element with key \p key near \p hint.
+  /*!
+    \param hint
+    An index used as a hint.
+    It must be the index of an element with a value.
+
+    \param key
+    The key that will be searched for.
+
+    \return
+    If the element is found, the index of that element is returned; otherwise,
+    the returned index refers to the immediately preceding or succeeding
+    value.
+
+    This uses a binary progression and then a bisection, so this method is
+    \f$O(\log n)\f$, and it is \f$O(1)\f$ if the distance between the returned
+    position and \p hint is \f$O(1)\f$.
+
+    This method takes \f$O(\log n)\f$ time. If the distance between the
+    returned position and \p hint is \f$O(1)\f$ it takes \f$O(1)\f$ time.
+  */
+  dimension_type bisect_near(dimension_type hint, dimension_type key) const;
+
+  //! Inserts an element in the tree.
+  /*!
+    If there is already an element with key \p key in the tree, its
+    associated data is set to \p data.
+
+    This operation invalidates existing iterators.
+
+    \return
+    An %iterator that points to the inserted element.
+
+    \param key
+    The key that will be inserted into the tree.
+
+    \param data
+    The data that will be associated with \p key.
+
+    \param itr
+    It must point to the element in the tree with key \p key or, if no such
+    element exists, it must point to the node that would be his parent.
+
+    This method takes \f$O(1)\f$ time if the element already exists, and
+    \f$O(\log^2 n)\f$ amortized time otherwise.
+  */
+  tree_iterator insert_precise(dimension_type key,
+                               data_type_const_reference data,
+                               tree_iterator itr);
+
+  //! Helper for \c insert_precise.
+  /*!
+    This helper method takes the same arguments as \c insert_precise,
+    but besides assuming that \p itr is a correct hint, it also assumes
+    that \p key and \p data are not in the tree; namely, a proper
+    insertion has to be done and the insertion can not invalidate \p data.
+  */
+  tree_iterator insert_precise_aux(dimension_type key,
+                                   data_type_const_reference data,
+                                   tree_iterator itr);
+
+  //! Inserts an element in the tree.
+  /*!
+
+    \param key
+    The key that will be inserted into the tree.
+
+    \param data
+    The data that will be associated with \p key.
+
+    The tree must be empty.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void insert_in_empty_tree(dimension_type key,
+                            data_type_const_reference data);
+
+  //! Erases from the tree the element pointed to by \p itr .
+  /*!
+    This operation invalidates existing iterators.
+
+    \returns
+    An %iterator to the next element (or end() if there are no elements with
+    key greater than \p key ).
+
+    \param itr
+    An %iterator pointing to the element that will be erased.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  iterator erase(tree_iterator itr);
+
+  //! Initializes a tree with reserved size at least \p n .
+  /*!
+    \param n
+    A lower bound on the tree's desired reserved size.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void init(dimension_type n);
+
+  //! Deallocates the tree's dynamic arrays.
+  /*!
+    After this call, the tree fields are uninitialized, so init() must be
+    called again before using the tree.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void destroy();
+
+  //! Checks the internal invariants, but not the densities.
+  bool structure_OK() const;
+
+  //! Checks the internal invariants.
+  bool OK() const;
+
+  //! Returns the floor of the base-2 logarithm of \p n .
+  /*!
+    \param n
+    It must be greater than zero.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  static unsigned integer_log2(dimension_type n);
+
+  //! Compares the fractions numer/denom with ratio/100.
+  /*!
+    \returns Returns true if the fraction numer/denom is less
+    than the fraction ratio/100.
+
+    \param ratio
+    It must be less than or equal to 100.
+
+    \param numer
+    The numerator of the fraction.
+
+    \param denom
+    The denominator of the fraction.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  static bool is_less_than_ratio(dimension_type numer, dimension_type denom,
+                                 dimension_type ratio);
+
+  //! Compares the fractions numer/denom with ratio/100.
+  /*!
+    \returns
+    Returns true if the fraction numer/denom is greater than the fraction
+    ratio/100.
+
+    \param ratio
+    It must be less than or equal to 100.
+
+    \param numer
+    The numerator of the fraction.
+
+    \param denom
+    The denominator of the fraction.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  static bool is_greater_than_ratio(dimension_type numer, dimension_type denom,
+                                    dimension_type ratio);
+
+  //! Dumps the subtree rooted at \p itr to stdout, for debugging purposes.
+  /*!
+    \param itr
+    A tree_iterator pointing to the root of the desired subtree.
+  */
+  static void dump_subtree(tree_iterator itr);
+
+  //! Increases the tree's reserved size.
+  /*!
+    This is called when the density is about to exceed the maximum density
+    (specified by max_density_percent).
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void rebuild_bigger_tree();
+
+  //! Decreases the tree's reserved size.
+  /*!
+    This is called when the density is about to become less than the minimum
+    allowed density (specified by min_density_percent).
+
+    \p reserved_size must be greater than 3 (otherwise the tree can just be
+    cleared).
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void rebuild_smaller_tree();
+
+  //! Re-initializes the cached iterators.
+  /*!
+    This method must be called when the indexes[] and data[] vector are
+    reallocated.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void refresh_cached_iterators();
+
+  //! Rebalances the tree.
+  /*!
+    For insertions, it adds the pair (key, value) in the process.
+
+    This operation invalidates existing iterators that point to nodes in the
+    rebalanced subtree.
+
+    \returns an %iterator pointing to the root of the subtree that was
+             rebalanced.
+
+    \param itr
+    It points to the node where the new element has to be inserted or where an
+    element has just been deleted.
+
+    \param key
+    The index that will be inserted in the tree (for insertions only).
+
+    \param value
+    The value that will be inserted in the tree (for insertions only).
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  tree_iterator rebalance(tree_iterator itr, dimension_type key,
+                          data_type_const_reference value);
+
+  //! Moves all elements of a subtree to the rightmost end.
+  /*!
+    \returns
+    The index of the rightmost unused node in the subtree after the process.
+
+    \param last_in_subtree
+    It is the index of the last element in the subtree.
+
+    \param subtree_size
+    It is the number of valid elements in the subtree.
+    It must be greater than zero.
+
+    \param key
+    The key that may be added to the tree if add_element is \c true.
+
+    \param value
+    The value that may be added to the tree if add_element is \c true.
+
+    \param add_element
+    If it is true, it tries to add an element with key \p key and value
+    \p value in the process (but it may not).
+
+    This method takes \f$O(k)\f$ time, where k is \p subtree_size.
+  */
+  dimension_type compact_elements_in_the_rightmost_end(
+    dimension_type last_in_subtree, dimension_type subtree_size,
+    dimension_type key, data_type_const_reference value,
+    bool add_element);
+
+  //! Redistributes the elements in the subtree rooted at \p root_index.
+  /*!
+    The subtree's elements must be compacted to the rightmost end.
+
+    \param root_index
+    The index of the subtree's root node.
+
+    \param subtree_size
+    It is the number of used elements in the subtree.
+    It must be greater than zero.
+
+    \param last_used
+    It points to the leftmost element with a value in the subtree.
+
+    \param add_element
+    If it is true, this method adds an element with the specified key and
+    value in the process.
+
+    \param key
+    The key that will be added to the tree if \p add_element is \c true.
+
+    \param value
+    The data that will be added to the tree if \p add_element is \c true.
+
+    This method takes \f$O(k)\f$ time, where k is \p subtree_size.
+  */
+  void redistribute_elements_in_subtree(dimension_type root_index,
+                                        dimension_type subtree_size,
+                                        dimension_type last_used,
+                                        dimension_type key,
+                                        data_type_const_reference value,
+                                        bool add_element);
+
+  //! Moves all data in the tree \p tree into *this.
+  /*!
+    \param tree
+    The tree from which the element will be moved into *this.
+
+    *this must be empty and big enough to contain all of tree's data without
+    exceeding max_density.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void move_data_from(CO_Tree& tree);
+
+  //! Copies all data in the tree \p tree into *this.
+  /*!
+    \param tree
+    The tree from which the element will be copied into *this.
+
+    *this must be empty and must have the same reserved size of \p tree.
+    this->OK() may return false before this method is called, but
+    this->structure_OK() must return true.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void copy_data_from(const CO_Tree& tree);
+
+  //! Counts the number of used elements in the subtree rooted at itr.
+  /*!
+    \param itr
+    An %iterator pointing to the root of the desired subtree.
+
+    This method takes \f$O(k)\f$ time, where k is the number of elements in
+    the subtree.
+  */
+  static dimension_type count_used_in_subtree(tree_iterator itr);
+
+  //! Moves the value of \p from in \p to .
+  /*!
+    \param from
+    It must be a valid value.
+
+    \param to
+    It must be a non-constructed chunk of memory.
+
+    After the move, \p from becomes a non-constructed chunk of memory and
+    \p to gets the value previously stored by \p from.
+
+    The implementation of this method assumes that data_type values do not
+    keep pointers to themselves nor to their fields.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  static void move_data_element(data_type& to, data_type& from);
+
+  //! The maximum density of used nodes.
+  /*!
+    This must be greater than or equal to 50 and lower than 100.
+  */
+  static const dimension_type max_density_percent = 91;
+
+  //! The minimum density of used nodes.
+  /*!
+    Must be strictly lower than the half of max_density_percent.
+  */
+  static const dimension_type min_density_percent = 38;
+
+  //! The minimum density at the leaves' depth.
+  /*!
+    Must be greater than zero and strictly lower than min_density_percent.
+
+    Increasing the value is safe but leads to time inefficiencies
+    (measured against ppl_lpsol on 24 August 2010), because it forces trees to
+    be more balanced, increasing the cost of rebalancing.
+  */
+  static const dimension_type min_leaf_density_percent = 1;
+
+  //! An index used as a marker for unused nodes in the tree.
+  /*!
+    This must not be used as a key.
+  */
+  static const dimension_type unused_index = C_Integer<dimension_type>::max;
+
+  //! The %iterator returned by end().
+  /*!
+    It is updated when needed, to keep it valid.
+  */
+  iterator cached_end;
+
+  //! The %iterator returned by the const version of end().
+  /*!
+    It is updated when needed, to keep it valid.
+  */
+  const_iterator cached_const_end;
+
+  //! The depth of the leaves in the complete tree.
+  height_t max_depth;
+
+  //! The vector that contains the keys in the tree.
+  /*!
+    If an element of this vector is \p unused_index , it means that that
+    element and the corresponding element of data[] are not used.
+
+    Its size is reserved_size + 2, because the first and the last elements
+    are used as markers for iterators.
+  */
+  dimension_type* indexes;
+
+  //! The allocator used to allocate/deallocate data.
+  std::allocator<data_type> data_allocator;
+
+  //! The vector that contains the data of the keys in the tree.
+  /*!
+    If index[i] is \p unused_index, data[i] is unused.
+    Otherwise, data[i] contains the data associated to the indexes[i] key.
+
+    Its size is reserved_size + 1, because the first element is not used (to
+    allow using the same index in both indexes[] and data[] instead of
+    adding 1 to access data[]).
+  */
+  data_type* data;
+
+  //! The number of nodes in the complete tree.
+  /*!
+    It is one less than a power of 2.
+    If this is 0, data and indexes are set to NULL.
+  */
+  dimension_type reserved_size;
+
+  //! The number of values stored in the tree.
+  dimension_type size_;
+};
+
+class CO_Tree::tree_iterator {
+
+public:
+
+  /*!
+    \brief Constructs a tree_iterator pointing at the root node of the
+           specified tree
+
+    \param tree
+    The tree to which the new %iterator will point to.
+    It must not be empty.
+  */
+  explicit tree_iterator(CO_Tree& tree);
+
+  //! Constructs a tree_iterator pointing at the specified node of the tree.
+  /*!
+    \param tree
+    The tree to which the new %iterator will point to.
+    It must not be empty.
+
+    \param i
+    The index of the element in \p tree to which the new %iterator will point
+    to.
+  */
+  tree_iterator(CO_Tree& tree, dimension_type i);
+
+  //! Constructs a tree_iterator from an iterator.
+  /*!
+    \param itr
+    The iterator that will be converted into a tree_iterator.
+    It must not be end().
+
+    \param tree
+    The tree to which the new %iterator will point to.
+    It must not be empty.
+  */
+  tree_iterator(const iterator& itr, CO_Tree& tree);
+
+  //! The assignment operator.
+  /*!
+    \param itr
+    The %iterator that will be assigned into *this.
+  */
+  tree_iterator& operator=(const tree_iterator& itr);
+
+  //! The assignment operator from an iterator.
+  /*!
+    \param itr
+    The iterator that will be assigned into *this.
+  */
+  tree_iterator& operator=(const iterator& itr);
+
+  //! Compares *this with \p itr.
+  /*!
+    \param itr
+    The %iterator that will compared with *this.
+  */
+  bool operator==(const tree_iterator& itr) const;
+
+  //! Compares *this with \p itr.
+  /*!
+    \param itr
+    The %iterator that will compared with *this.
+  */
+  bool operator!=(const tree_iterator& itr) const;
+
+  //! Makes the %iterator point to the root of \p tree.
+  /*!
+    The values of all fields (beside tree) are overwritten.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void get_root();
+
+  //! Makes the %iterator point to the left child of the current node.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  void get_left_child();
+
+  //! Makes the %iterator point to the right child of the current node.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  void get_right_child();
+
+  //! Makes the %iterator point to the parent of the current node.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  void get_parent();
+
+  /*!
+    \brief Searches for an element with key \p key in the subtree rooted at
+           \p *this.
+
+    \param key
+    The searched for key.
+
+    After this method, *this points to the found node (if it exists) or to
+    the node that would be his parent (otherwise).
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  void go_down_searching_key(dimension_type key);
+
+  /*!
+    \brief Follows left children with a value, until it arrives at a leaf or at
+           a node with no value.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void follow_left_children_with_value();
+
+  /*!
+    \brief Follows right children with a value, until it arrives at a leaf or at
+           a node with no value.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void follow_right_children_with_value();
+
+  //! Returns true if the pointed node is the root node.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  bool is_root() const;
+
+  //! Returns true if the pointed node has a parent and is its right child.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  bool is_right_child() const;
+
+  //! Returns true if the pointed node is a leaf of the complete tree.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  bool is_leaf() const;
+
+  //! Returns the key and value of the current node.
+  data_type& operator*();
+
+  //! Returns the key and value of the current node.
+  Coefficient_traits::const_reference operator*() const;
+
+  //! Returns a reference to the index of the element pointed to by \c *this.
+  /*!
+    \returns a reference to the index of the element pointed to by \c *this.
+  */
+  dimension_type& index();
+
+  //! Returns the index of the element pointed to by \c *this.
+  /*!
+    \returns the index of the element pointed to by \c *this.
+  */
+  dimension_type index() const;
+
+  //! Returns the index of the node pointed to by \c *this.
+  /*!
+    \returns the key of the node pointed to by \c *this, or unused_index if
+             the current node does not contain a valid element.
+  */
+  dimension_type key() const;
+
+  //! The tree containing the element pointed to by this %iterator.
+  CO_Tree& tree;
+
+  /*!
+    \brief Returns the index of the current node in the DFS layout of the
+           complete tree.
+  */
+  dimension_type dfs_index() const;
+
+  /*!
+    \brief Returns 2^h, with h the height of the current node in the tree,
+           counting from 0.
+
+    Thus leaves have offset 1.
+    This is faster than depth(), so it is useful to compare node depths.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  dimension_type get_offset() const;
+
+  //! Returns the depth of the current node in the complete tree.
+  /*!
+    This method takes \f$O(\log n)\f$ time.
+  */
+  height_t depth() const;
+
+private:
+  //! Checks the internal invariant.
+  bool OK() const;
+
+  //! The index of the current node in the DFS layout of the complete tree.
+  dimension_type i;
+
+  /*!
+    \brief This is 2^h, with h the height of the current node in the tree,
+           counting from 0.
+
+    Thus leaves have offset 1.
+    This is equal to (i & -i), and is only stored to increase performance.
+  */
+  dimension_type offset;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates CO_Tree */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(CO_Tree& x, CO_Tree& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates CO_Tree::const_iterator */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(CO_Tree::const_iterator& x, CO_Tree::const_iterator& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates CO_Tree::iterator */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(CO_Tree::iterator& x, CO_Tree::iterator& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "CO_Tree_inlines.hh"
+#include "CO_Tree_templates.hh"
+
+#endif // !defined(PPL_CO_Tree_defs_hh)
diff --git a/src/CO_Tree_inlines.hh b/src/CO_Tree_inlines.hh
new file mode 100644
index 0000000..64bde57
--- /dev/null
+++ b/src/CO_Tree_inlines.hh
@@ -0,0 +1,868 @@
+/* CO_Tree class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_CO_Tree_inlines_hh
+#define PPL_CO_Tree_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline dimension_type
+CO_Tree::dfs_index(const_iterator itr) const {
+  PPL_ASSERT(itr.current_index != 0);
+  PPL_ASSERT(itr.current_index >= indexes + 1);
+  PPL_ASSERT(itr.current_index <= indexes + reserved_size);
+  const ptrdiff_t index = itr.current_index - indexes;
+  return static_cast<dimension_type>(index);
+}
+
+inline dimension_type
+CO_Tree::dfs_index(iterator itr) const {
+  PPL_ASSERT(itr.current_index != 0);
+  PPL_ASSERT(itr.current_index >= indexes + 1);
+  PPL_ASSERT(itr.current_index <= indexes + reserved_size);
+  const ptrdiff_t index = itr.current_index - indexes;
+  return static_cast<dimension_type>(index);
+}
+
+inline
+CO_Tree::CO_Tree() {
+  init(0);
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::CO_Tree(const CO_Tree& y) {
+  PPL_ASSERT(y.OK());
+  data_allocator = y.data_allocator;
+  init(y.reserved_size);
+  copy_data_from(y);
+}
+
+inline CO_Tree&
+CO_Tree::operator=(const CO_Tree& y) {
+  if (this != &y) {
+    destroy();
+    data_allocator = y.data_allocator;
+    init(y.reserved_size);
+    copy_data_from(y);
+  }
+  return *this;
+}
+
+inline void
+CO_Tree::clear() {
+  *this = CO_Tree();
+}
+
+inline
+CO_Tree::~CO_Tree() {
+
+  destroy();
+}
+
+inline bool
+CO_Tree::empty() const {
+  return size_ == 0;
+}
+
+inline dimension_type
+CO_Tree::size() const {
+  return size_;
+}
+
+inline dimension_type
+CO_Tree::max_size() {
+  return C_Integer<dimension_type>::max/100;
+}
+
+inline void
+CO_Tree::dump_tree() const {
+  if (empty())
+    std::cout << "(empty tree)" << std::endl;
+  else
+    dump_subtree(tree_iterator(*const_cast<CO_Tree*>(this)));
+}
+
+inline CO_Tree::iterator
+CO_Tree::insert(const dimension_type key) {
+  if (empty())
+    return insert(key, Coefficient_zero());
+  else {
+    tree_iterator itr(*this);
+    itr.go_down_searching_key(key);
+    if (itr.index() == key)
+      return iterator(itr);
+    else
+      return iterator(insert_precise(key, Coefficient_zero(), itr));
+  }
+}
+
+inline CO_Tree::iterator
+CO_Tree::insert(dimension_type key, data_type_const_reference data1) {
+  if (empty()) {
+    insert_in_empty_tree(key, data1);
+    tree_iterator itr(*this);
+    PPL_ASSERT(itr.index() != unused_index);
+    return iterator(itr);
+  }
+  else {
+    tree_iterator itr(*this);
+    itr.go_down_searching_key(key);
+    return iterator(insert_precise(key, data1, itr));
+  }
+}
+
+inline CO_Tree::iterator
+CO_Tree::erase(dimension_type key) {
+  PPL_ASSERT(key != unused_index);
+
+  if (empty())
+    return end();
+
+  tree_iterator itr(*this);
+  itr.go_down_searching_key(key);
+
+  if (itr.index() == key)
+    return erase(itr);
+
+  iterator result(itr);
+  if (result.index() < key)
+    ++result;
+
+  PPL_ASSERT(result == end() || result.index() > key);
+#ifndef NDEBUG
+  iterator last = end();
+  --last;
+  PPL_ASSERT((result == end()) == (last.index() < key));
+#endif
+
+  return result;
+}
+
+inline CO_Tree::iterator
+CO_Tree::erase(iterator itr) {
+  PPL_ASSERT(itr != end());
+  return erase(tree_iterator(itr, *this));
+}
+
+inline void
+CO_Tree::m_swap(CO_Tree& x) {
+  using std::swap;
+  swap(max_depth, x.max_depth);
+  swap(indexes, x.indexes);
+  swap(data_allocator, x.data_allocator);
+  swap(data, x.data);
+  swap(reserved_size, x.reserved_size);
+  swap(size_, x.size_);
+  // Cached iterators have been invalidated by the swap,
+  // they must be refreshed here.
+  refresh_cached_iterators();
+  x.refresh_cached_iterators();
+  PPL_ASSERT(structure_OK());
+  PPL_ASSERT(x.structure_OK());
+}
+
+inline CO_Tree::iterator
+CO_Tree::begin() {
+  return iterator(*this);
+}
+
+inline const CO_Tree::iterator&
+CO_Tree::end() {
+  return cached_end;
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::begin() const {
+  return const_iterator(*this);
+}
+
+inline const CO_Tree::const_iterator&
+CO_Tree::end() const {
+  return cached_const_end;
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::cbegin() const {
+  return const_iterator(*this);
+}
+
+inline const CO_Tree::const_iterator&
+CO_Tree::cend() const {
+  return cached_const_end;
+}
+
+inline CO_Tree::iterator
+CO_Tree::bisect(dimension_type key) {
+  if (empty())
+    return end();
+  iterator last = end();
+  --last;
+  return bisect_in(begin(), last, key);
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::bisect(dimension_type key) const {
+  if (empty())
+    return end();
+  const_iterator last = end();
+  --last;
+  return bisect_in(begin(), last, key);
+}
+
+inline CO_Tree::iterator
+CO_Tree::bisect_in(iterator first, iterator last, dimension_type key) {
+  PPL_ASSERT(first != end());
+  PPL_ASSERT(last != end());
+  const dimension_type index
+    = bisect_in(dfs_index(first), dfs_index(last), key);
+  return iterator(*this, index);
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::bisect_in(const_iterator first, const_iterator last,
+                   dimension_type key) const {
+  PPL_ASSERT(first != end());
+  PPL_ASSERT(last != end());
+  const dimension_type index
+    = bisect_in(dfs_index(first), dfs_index(last), key);
+  return const_iterator(*this, index);
+}
+
+inline CO_Tree::iterator
+CO_Tree::bisect_near(iterator hint, dimension_type key) {
+  if (hint == end())
+    return bisect(key);
+  const dimension_type index
+    = bisect_near(dfs_index(hint), key);
+  return iterator(*this, index);
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::bisect_near(const_iterator hint, dimension_type key) const {
+  if (hint == end())
+    return bisect(key);
+  const dimension_type index = bisect_near(dfs_index(hint), key);
+  return const_iterator(*this, index);
+}
+
+inline void
+CO_Tree::fast_shift(dimension_type i, iterator itr) {
+  PPL_ASSERT(itr != end());
+  PPL_ASSERT(i <= itr.index());
+  indexes[dfs_index(itr)] = i;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::insert_in_empty_tree(dimension_type key,
+                              data_type_const_reference data1) {
+  PPL_ASSERT(empty());
+  rebuild_bigger_tree();
+  tree_iterator itr(*this);
+  PPL_ASSERT(itr.index() == unused_index);
+  new (&(*itr)) data_type(data1);
+  // Set the index afterwards, so that if the constructor above throws
+  // the tree's structure is consistent.
+  itr.index() = key;
+  ++size_;
+
+  PPL_ASSERT(OK());
+}
+
+inline bool
+CO_Tree::is_less_than_ratio(dimension_type numer, dimension_type denom,
+                            dimension_type ratio) {
+  PPL_ASSERT(ratio <= 100);
+  // If these are true, no overflows are possible.
+  PPL_ASSERT(denom <= unused_index/100);
+  PPL_ASSERT(numer <= unused_index/100);
+  return 100*numer < ratio*denom;
+}
+
+inline bool
+CO_Tree::is_greater_than_ratio(dimension_type numer, dimension_type denom,
+                               dimension_type ratio) {
+  PPL_ASSERT(ratio <= 100);
+  // If these are true, no overflows are possible.
+  PPL_ASSERT(denom <= unused_index/100);
+  PPL_ASSERT(numer <= unused_index/100);
+  return 100*numer > ratio*denom;
+}
+
+inline void
+CO_Tree::rebuild_smaller_tree() {
+  PPL_ASSERT(reserved_size > 3);
+  CO_Tree new_tree;
+  new_tree.init(reserved_size / 2);
+  new_tree.move_data_from(*this);
+  m_swap(new_tree);
+  PPL_ASSERT(new_tree.structure_OK());
+  PPL_ASSERT(structure_OK());
+}
+
+inline void
+CO_Tree::refresh_cached_iterators() {
+  cached_end = iterator(*this, reserved_size + 1);
+  cached_const_end = const_iterator(*this, reserved_size + 1);
+}
+
+inline void
+CO_Tree::move_data_element(data_type& to, data_type& from) {
+  // The following code is equivalent (but slower):
+  //
+  // <CODE>
+  //   new (&to) data_type(from);
+  //   from.~data_type();
+  // </CODE>
+  std::memcpy(&to, &from, sizeof(data_type));
+}
+
+
+inline
+CO_Tree::const_iterator::const_iterator()
+  : current_index(0), current_data(0) {
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = 0;
+#endif
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::const_iterator::const_iterator(const CO_Tree& tree1)
+  : current_index(&(tree1.indexes[1])), current_data(&(tree1.data[1])) {
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = &tree1;
+#endif
+  if (!tree1.empty())
+    while (*current_index == unused_index) {
+      ++current_index;
+      ++current_data;
+    }
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::const_iterator::const_iterator(const CO_Tree& tree1,
+                                        dimension_type i)
+  : current_index(&(tree1.indexes[i])), current_data(&(tree1.data[i])) {
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = &tree1;
+#endif
+  PPL_ASSERT(i != 0);
+  PPL_ASSERT(i <= tree1.reserved_size + 1);
+  PPL_ASSERT(tree1.empty() || tree1.indexes[i] != unused_index);
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::const_iterator::const_iterator(const const_iterator& itr2) {
+  (*this) = itr2;
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::const_iterator::const_iterator(const iterator& itr2) {
+  (*this) = itr2;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::const_iterator::m_swap(const_iterator& itr) {
+  using std::swap;
+  swap(current_data, itr.current_data);
+  swap(current_index, itr.current_index);
+#if PPL_CO_TREE_EXTRA_DEBUG
+  swap(tree, itr.tree);
+#endif
+  PPL_ASSERT(OK());
+  PPL_ASSERT(itr.OK());
+}
+
+inline CO_Tree::const_iterator&
+CO_Tree::const_iterator::operator=(const const_iterator& itr2) {
+  current_index = itr2.current_index;
+  current_data = itr2.current_data;
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = itr2.tree;
+#endif
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::const_iterator&
+CO_Tree::const_iterator::operator=(const iterator& itr2) {
+  current_index = itr2.current_index;
+  current_data = itr2.current_data;
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = itr2.tree;
+#endif
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::const_iterator&
+CO_Tree::const_iterator::operator++() {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  ++current_index;
+  ++current_data;
+  while (*current_index == unused_index) {
+    ++current_index;
+    ++current_data;
+  }
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::const_iterator&
+CO_Tree::const_iterator::operator--() {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  --current_index;
+  --current_data;
+  while (*current_index == unused_index) {
+    --current_index;
+    --current_data;
+  }
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::const_iterator::operator++(int) {
+  const_iterator itr(*this);
+  ++(*this);
+  return itr;
+}
+
+inline CO_Tree::const_iterator
+CO_Tree::const_iterator::operator--(int) {
+  const_iterator itr(*this);
+  --(*this);
+  return itr;
+}
+
+inline Coefficient_traits::const_reference
+CO_Tree::const_iterator::operator*() const {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  PPL_ASSERT(OK());
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  return *current_data;
+}
+
+inline dimension_type
+CO_Tree::const_iterator::index() const {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  PPL_ASSERT(OK());
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  return *current_index;
+}
+
+inline bool
+CO_Tree::const_iterator::operator==(const const_iterator& x) const {
+  PPL_ASSERT((current_index == x.current_index)
+             == (current_data == x.current_data));
+  PPL_ASSERT(OK());
+  return (current_index == x.current_index);
+}
+
+inline bool
+CO_Tree::const_iterator::operator!=(const const_iterator& x) const {
+  return !(*this == x);
+}
+
+
+inline
+CO_Tree::iterator::iterator()
+  : current_index(0), current_data(0) {
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = 0;
+#endif
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::iterator::iterator(CO_Tree& tree1)
+  : current_index(&(tree1.indexes[1])), current_data(&(tree1.data[1])) {
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = &tree1;
+#endif
+  if (!tree1.empty())
+    while (*current_index == unused_index) {
+      ++current_index;
+      ++current_data;
+    }
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::iterator::iterator(CO_Tree& tree1, dimension_type i)
+  : current_index(&(tree1.indexes[i])), current_data(&(tree1.data[i])) {
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = &tree1;
+#endif
+  PPL_ASSERT(i != 0);
+  PPL_ASSERT(i <= tree1.reserved_size + 1);
+  PPL_ASSERT(tree1.empty() || tree1.indexes[i] != unused_index);
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::iterator::iterator(const tree_iterator& itr) {
+  *this = itr;
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::iterator::iterator(const iterator& itr2) {
+  (*this) = itr2;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::iterator::m_swap(iterator& itr) {
+  using std::swap;
+  swap(current_data, itr.current_data);
+  swap(current_index, itr.current_index);
+#if PPL_CO_TREE_EXTRA_DEBUG
+  swap(tree, itr.tree);
+#endif
+  PPL_ASSERT(OK());
+  PPL_ASSERT(itr.OK());
+}
+
+inline CO_Tree::iterator&
+CO_Tree::iterator::operator=(const tree_iterator& itr) {
+  current_index = &(itr.tree.indexes[itr.dfs_index()]);
+  current_data = &(itr.tree.data[itr.dfs_index()]);
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = &(itr.tree);
+#endif
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::iterator&
+CO_Tree::iterator::operator=(const iterator& itr2) {
+  current_index = itr2.current_index;
+  current_data = itr2.current_data;
+#if PPL_CO_TREE_EXTRA_DEBUG
+  tree = itr2.tree;
+#endif
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::iterator&
+CO_Tree::iterator::operator++() {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  ++current_index;
+  ++current_data;
+  while (*current_index == unused_index) {
+    ++current_index;
+    ++current_data;
+  }
+
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::iterator&
+CO_Tree::iterator::operator--() {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  --current_index;
+  --current_data;
+  while (*current_index == unused_index) {
+    --current_index;
+    --current_data;
+  }
+
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline CO_Tree::iterator
+CO_Tree::iterator::operator++(int) {
+  iterator itr(*this);
+  ++(*this);
+  return itr;
+}
+
+inline CO_Tree::iterator
+CO_Tree::iterator::operator--(int) {
+  iterator itr(*this);
+  --(*this);
+  return itr;
+}
+
+inline CO_Tree::data_type&
+CO_Tree::iterator::operator*() {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  PPL_ASSERT(OK());
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  return *current_data;
+}
+
+inline Coefficient_traits::const_reference
+CO_Tree::iterator::operator*() const {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  PPL_ASSERT(OK());
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  return *current_data;
+}
+
+inline dimension_type
+CO_Tree::iterator::index() const {
+  PPL_ASSERT(current_index != 0);
+  PPL_ASSERT(current_data != 0);
+  PPL_ASSERT(OK());
+#if PPL_CO_TREE_EXTRA_DEBUG
+  PPL_ASSERT(current_index != &(tree->indexes[tree->reserved_size + 1]));
+#endif
+  return *current_index;
+}
+
+inline bool
+CO_Tree::iterator::operator==(const iterator& x) const {
+  PPL_ASSERT((current_index == x.current_index)
+             == (current_data == x.current_data));
+  PPL_ASSERT(OK());
+  return (current_index == x.current_index);
+}
+
+inline bool
+CO_Tree::iterator::operator!=(const iterator& x) const {
+  return !(*this == x);
+}
+
+
+inline
+CO_Tree::tree_iterator::tree_iterator(CO_Tree& tree1)
+  : tree(tree1) {
+  PPL_ASSERT(tree.reserved_size != 0);
+  get_root();
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::tree_iterator::tree_iterator(CO_Tree& tree1, dimension_type i1)
+  : tree(tree1) {
+  PPL_ASSERT(tree.reserved_size != 0);
+  PPL_ASSERT(i1 <= tree.reserved_size + 1);
+  i = i1;
+  offset = least_significant_one_mask(i);
+  PPL_ASSERT(OK());
+}
+
+inline
+CO_Tree::tree_iterator::tree_iterator(const iterator& itr, CO_Tree& tree1)
+  : tree(tree1) {
+  PPL_ASSERT(tree.reserved_size != 0);
+  *this = itr;
+  PPL_ASSERT(OK());
+}
+
+inline CO_Tree::tree_iterator&
+CO_Tree::tree_iterator::operator=(const tree_iterator& itr) {
+  PPL_ASSERT(&tree == &(itr.tree));
+  i = itr.i;
+  offset = itr.offset;
+  return *this;
+}
+
+inline CO_Tree::tree_iterator&
+CO_Tree::tree_iterator::operator=(const iterator& itr) {
+  PPL_ASSERT(itr != tree.end());
+  i = tree.dfs_index(itr);
+  offset = least_significant_one_mask(i);
+  return *this;
+}
+
+inline bool
+CO_Tree::tree_iterator::operator==(const tree_iterator& itr) const {
+  return i == itr.i;
+}
+
+inline bool
+CO_Tree::tree_iterator::operator!=(const tree_iterator& itr) const {
+  return !(*this == itr);
+}
+
+inline void
+CO_Tree::tree_iterator::get_root() {
+  i = tree.reserved_size / 2 + 1;
+  offset = i;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::tree_iterator::get_left_child() {
+  PPL_ASSERT(offset != 0);
+  PPL_ASSERT(offset != 1);
+  offset /= 2;
+  i -= offset;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::tree_iterator::get_right_child() {
+  PPL_ASSERT(offset != 0);
+  PPL_ASSERT(offset != 1);
+  offset /= 2;
+  i += offset;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::tree_iterator::get_parent() {
+  PPL_ASSERT(!is_root());
+  PPL_ASSERT(offset != 0);
+  i &= ~offset;
+  offset *= 2;
+  i |= offset;
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::tree_iterator::follow_left_children_with_value() {
+  PPL_ASSERT(index() != unused_index);
+  const dimension_type* p = tree.indexes;
+  p += i;
+  p -= (offset - 1);
+  while (*p == unused_index)
+    ++p;
+  const ptrdiff_t distance = p - tree.indexes;
+  PPL_ASSERT(distance >= 0);
+  i = static_cast<dimension_type>(distance);
+  offset = least_significant_one_mask(i);
+  PPL_ASSERT(OK());
+}
+
+inline void
+CO_Tree::tree_iterator::follow_right_children_with_value() {
+  PPL_ASSERT(index() != unused_index);
+  const dimension_type* p = tree.indexes;
+  p += i;
+  p += (offset - 1);
+  while (*p == unused_index)
+    --p;
+  const ptrdiff_t distance = p - tree.indexes;
+  PPL_ASSERT(distance >= 0);
+  i = static_cast<dimension_type>(distance);
+  offset = least_significant_one_mask(i);
+  PPL_ASSERT(OK());
+}
+
+inline bool
+CO_Tree::tree_iterator::is_root() const {
+  // This is implied by OK(), it is here for reference only.
+  PPL_ASSERT(offset <= (tree.reserved_size / 2 + 1));
+  return offset == (tree.reserved_size / 2 + 1);
+}
+
+inline bool
+CO_Tree::tree_iterator::is_right_child() const {
+  if (is_root())
+    return false;
+  return (i & (2*offset)) != 0;
+}
+
+inline bool
+CO_Tree::tree_iterator::is_leaf() const {
+  return offset == 1;
+}
+
+inline CO_Tree::data_type&
+CO_Tree::tree_iterator::operator*() {
+  return tree.data[i];
+}
+
+inline Coefficient_traits::const_reference
+CO_Tree::tree_iterator::operator*() const {
+  return tree.data[i];
+}
+
+inline dimension_type&
+CO_Tree::tree_iterator::index() {
+  return tree.indexes[i];
+}
+
+inline dimension_type
+CO_Tree::tree_iterator::index() const {
+  return tree.indexes[i];
+}
+
+inline dimension_type
+CO_Tree::tree_iterator::dfs_index() const {
+  return i;
+}
+
+inline dimension_type
+CO_Tree::tree_iterator::get_offset() const {
+  return offset;
+}
+
+inline CO_Tree::height_t
+CO_Tree::tree_iterator::depth() const {
+  return integer_log2((tree.reserved_size + 1) / offset);
+}
+
+inline void
+swap(CO_Tree& x, CO_Tree& y) {
+  x.m_swap(y);
+}
+
+inline void
+swap(CO_Tree::const_iterator& x, CO_Tree::const_iterator& y) {
+  x.m_swap(y);
+}
+
+inline void
+swap(CO_Tree::iterator& x, CO_Tree::iterator& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_CO_Tree_inlines_hh)
diff --git a/src/CO_Tree_templates.hh b/src/CO_Tree_templates.hh
new file mode 100644
index 0000000..41957f8
--- /dev/null
+++ b/src/CO_Tree_templates.hh
@@ -0,0 +1,141 @@
+/* CO_Tree class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_CO_Tree_templates_hh
+#define PPL_CO_Tree_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Iterator>
+CO_Tree::CO_Tree(Iterator i, dimension_type n) {
+
+  if (n == 0) {
+    init(0);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  const dimension_type new_max_depth = integer_log2(n) + 1;
+  reserved_size = (static_cast<dimension_type>(1) << new_max_depth) - 1;
+
+  if (is_greater_than_ratio(n, reserved_size, max_density_percent)
+      && reserved_size != 3)
+    reserved_size = reserved_size*2 + 1;
+
+  init(reserved_size);
+
+  tree_iterator root(*this);
+
+  // This is static and with static allocation, to improve performance.
+  // sizeof_to_bits(sizeof(dimension_type)) is the maximum k such that
+  // 2^k-1 is a dimension_type, so it is the maximum tree height.
+  // For each node level, the stack may contain up to 4 elements: two elements
+  // with operation 0, one element with operation 2 and one element
+  // with operation 3. An additional element with operation 1 can be at the
+  // top of the tree.
+  static std::pair<dimension_type, signed char>
+    stack[4U * sizeof_to_bits(sizeof(dimension_type)) + 1U];
+
+  dimension_type stack_first_empty = 0;
+
+  // A pair (n, operation) in the stack means:
+  //
+  // * Go to the parent, if operation is 0.
+  // * Go to the left child, then fill the current tree with n elements, if
+  //   operation is 1.
+  // * Go to the right child, then fill the current tree with n elements, if
+  //   operation is 2.
+  // * Fill the current tree with n elements, if operation is 3.
+
+  stack[0].first = n;
+  stack[0].second = 3;
+  ++stack_first_empty;
+
+  while (stack_first_empty != 0) {
+
+    // Implement
+    //
+    // <CODE>
+    //   top_n         = stack.top().first;
+    //   top_operation = stack.top().second;
+    // </CODE>
+    const dimension_type top_n = stack[stack_first_empty - 1].first;
+    const signed char top_operation = stack[stack_first_empty - 1].second;
+
+    switch (top_operation) {
+
+    case 0:
+      root.get_parent();
+      --stack_first_empty;
+      continue;
+
+    case 1:
+      root.get_left_child();
+      break;
+
+    case 2:
+      root.get_right_child();
+      break;
+#ifndef NDEBUG
+    case 3:
+      break;
+
+    default:
+      // We should not be here
+      PPL_UNREACHABLE;
+#endif
+    }
+
+    // We now visit the current tree
+
+    if (top_n == 0) {
+      --stack_first_empty;
+    }
+    else {
+      if (top_n == 1) {
+        PPL_ASSERT(root.index() == unused_index);
+        root.index() = i.index();
+        new (&(*root)) data_type(*i);
+        ++i;
+        --stack_first_empty;
+      }
+      else {
+        PPL_ASSERT(stack_first_empty + 3 < sizeof(stack)/sizeof(stack[0]));
+
+        const dimension_type half = (top_n + 1) / 2;
+        stack[stack_first_empty - 1].second = 0;
+        stack[stack_first_empty    ] = std::make_pair(top_n - half, 2);
+        stack[stack_first_empty + 1] = std::make_pair(1, 3);
+        stack[stack_first_empty + 2].second = 0;
+        stack[stack_first_empty + 3] = std::make_pair(half - 1, 1);
+        stack_first_empty += 4;
+      }
+    }
+  }
+  size_ = n;
+  PPL_ASSERT(OK());
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_CO_Tree_templates_hh)
diff --git a/src/CO_Tree_types.hh b/src/CO_Tree_types.hh
new file mode 100644
index 0000000..c9b36f2
--- /dev/null
+++ b/src/CO_Tree_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_CO_Tree_types_hh
+#define PPL_CO_Tree_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class CO_Tree;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_CO_Tree_types_hh)
diff --git a/src/C_Integer.hh b/src/C_Integer.hh
index 4777e0a..a026f86 100644
--- a/src/C_Integer.hh
+++ b/src/C_Integer.hh
@@ -1,6 +1,6 @@
 /* C integers info.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -84,29 +84,35 @@ struct C_Integer<char> : public True {
 
 template <>
 struct C_Integer<signed char> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef void smaller_type;
   typedef void smaller_signed_type;
   typedef void smaller_unsigned_type;
   typedef unsigned char other_type;
-  static const signed char min = SCHAR_MIN;
-  static const signed char max = SCHAR_MAX;
+  static const signed char min = static_cast<signed char>(SCHAR_MIN);
+  static const signed char max = static_cast<signed char>(SCHAR_MAX);
 };
 
 template <>
 struct C_Integer<signed short> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed char smaller_type;
   typedef signed char smaller_signed_type;
   typedef unsigned char smaller_unsigned_type;
   typedef unsigned short other_type;
-  static const signed short min = SHRT_MIN;
-  static const signed short max = SHRT_MAX;
+  static const signed short min = static_cast<signed short>(SHRT_MIN);
+  static const signed short max = static_cast<signed short>(SHRT_MAX);
 };
 
 template <>
 struct C_Integer<signed int> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed short smaller_type;
   typedef signed short smaller_signed_type;
   typedef unsigned short smaller_unsigned_type;
@@ -117,7 +123,9 @@ struct C_Integer<signed int> : public True {
 
 template <>
 struct C_Integer<signed long> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed int smaller_type;
   typedef signed int smaller_signed_type;
   typedef unsigned int smaller_unsigned_type;
@@ -128,7 +136,9 @@ struct C_Integer<signed long> : public True {
 
 template <>
 struct C_Integer<signed long long> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed long smaller_type;
   typedef signed long smaller_signed_type;
   typedef unsigned long smaller_unsigned_type;
@@ -139,57 +149,67 @@ struct C_Integer<signed long long> : public True {
 
 template <>
 struct C_Integer<unsigned char> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef void smaller_type;
   typedef void smaller_signed_type;
   typedef void smaller_unsigned_type;
   typedef signed char other_type;
-  static const unsigned char min = 0U;
-  static const unsigned char max = static_cast<unsigned char>(~0U);
+  static const unsigned char min = static_cast<unsigned char>(0U);
+  static const unsigned char max = static_cast<unsigned char>(UCHAR_MAX);
 };
 
 template <>
 struct C_Integer<unsigned short> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned char smaller_type;
   typedef signed char smaller_signed_type;
   typedef unsigned char smaller_unsigned_type;
   typedef signed short other_type;
-  static const unsigned short min = 0U;
-  static const unsigned short max = static_cast<unsigned short>(~0U);
+  static const unsigned short min = static_cast<unsigned short>(0U);
+  static const unsigned short max = static_cast<unsigned short>(USHRT_MAX);
 };
 
 template <>
 struct C_Integer<unsigned int> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned short smaller_type;
   typedef signed short smaller_signed_type;
   typedef unsigned short smaller_unsigned_type;
   typedef signed int other_type;
   static const unsigned int min = 0U;
-  static const unsigned int max = ~0U;
+  static const unsigned int max = UINT_MAX;
 };
 
 template <>
 struct C_Integer<unsigned long> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned int smaller_type;
   typedef signed int smaller_signed_type;
   typedef unsigned int smaller_unsigned_type;
   typedef signed long other_type;
   static const unsigned long min = 0UL;
-  static const unsigned long max = ~0UL;
+  static const unsigned long max = ULONG_MAX;
 };
 
 template <>
 struct C_Integer<unsigned long long> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned long smaller_type;
   typedef signed long smaller_signed_type;
   typedef unsigned long smaller_unsigned_type;
   typedef signed long long other_type;
   static const unsigned long long min = 0ULL;
-  static const unsigned long long max = ~0ULL;
+  static const unsigned long long max = ULLONG_MAX;
 };
 
 } // namespace Parma_Polyhedra_Library
diff --git a/src/C_Polyhedron.cc b/src/C_Polyhedron.cc
index 32bb65d..20cfa14 100644
--- a/src/C_Polyhedron.cc
+++ b/src/C_Polyhedron.cc
@@ -1,6 +1,6 @@
 /* C_Polyhedron class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,9 +22,9 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include "Grid.defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Grid_defs.hh"
 #include "algorithms.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
@@ -33,9 +33,14 @@ PPL::C_Polyhedron::C_Polyhedron(const NNC_Polyhedron& y, Complexity_Class)
   : Polyhedron(NECESSARILY_CLOSED, y.space_dimension(), UNIVERSE) {
   const Constraint_System& cs = y.constraints();
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
+         cs_end = cs.end(); i != cs_end; ++i) {
     const Constraint& c = *i;
-    add_constraint(c.is_strict_inequality() ? (Linear_Expression(c) >= 0) : c);
+    if (c.is_strict_inequality()) {
+      const Linear_Expression expr(c.expression());
+      add_constraint(expr >= 0);
+    }
+    else
+      add_constraint(c);
   }
   PPL_ASSERT_HEAVY(OK());
 }
@@ -48,7 +53,7 @@ PPL::C_Polyhedron::C_Polyhedron(const Congruence_System& cgs)
                                               "the space dimension of cgs "
                                               "exceeds the maximum allowed "
                                               "space dimension"),
-	       UNIVERSE) {
+               UNIVERSE) {
   add_congruences(cgs);
 }
 
@@ -60,7 +65,7 @@ PPL::C_Polyhedron::C_Polyhedron(Congruence_System& cgs, Recycle_Input)
                                               "the space dimension of cgs "
                                               "exceeds the maximum allowed "
                                               "space dimension"),
-	       UNIVERSE) {
+               UNIVERSE) {
   add_congruences(cgs);
 }
 
@@ -72,7 +77,7 @@ PPL::C_Polyhedron::C_Polyhedron(const Grid& grid, Complexity_Class)
                                               "the space dimension of grid "
                                               "exceeds the maximum allowed "
                                               "space dimension"),
-	       UNIVERSE) {
+               UNIVERSE) {
   add_constraints(grid.constraints());
 }
 
diff --git a/src/C_Polyhedron.defs.hh b/src/C_Polyhedron.defs.hh
deleted file mode 100644
index e18579e..0000000
--- a/src/C_Polyhedron.defs.hh
+++ /dev/null
@@ -1,280 +0,0 @@
-/* C_Polyhedron class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_C_Polyhedron_defs_hh
-#define PPL_C_Polyhedron_defs_hh 1
-
-#include "C_Polyhedron.types.hh"
-#include "NNC_Polyhedron.types.hh"
-#include "Polyhedron.defs.hh"
-#include "Grid.types.hh"
-#include "BD_Shape.types.hh"
-#include "Octagonal_Shape.types.hh"
-
-//! A closed convex polyhedron.
-/*! \ingroup PPL_CXX_interface
-    An object of the class C_Polyhedron represents a
-    <EM>topologically closed</EM> convex polyhedron
-    in the vector space \f$\Rset^n\f$.
-
-    When building a closed polyhedron starting from
-    a system of constraints, an exception is thrown if the system
-    contains a <EM>strict inequality</EM> constraint.
-    Similarly, an exception is thrown when building a closed polyhedron
-    starting from a system of generators containing a <EM>closure point</EM>.
-
-    \note
-    Such an exception will be obtained even if the system of
-    constraints (resp., generators) actually defines
-    a topologically closed subset of the vector space, i.e.,
-    even if all the strict inequalities (resp., closure points)
-    in the system happen to be redundant with respect to the
-    system obtained by removing all the strict inequality constraints
-    (resp., all the closure points).
-    In contrast, when building a closed polyhedron starting from
-    an object of the class NNC_Polyhedron,
-    the precise topological closure test will be performed.
-*/
-
-class Parma_Polyhedra_Library::C_Polyhedron : public Polyhedron {
-public:
-  //! Builds either the universe or the empty C polyhedron.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the C polyhedron;
-
-    \param kind
-    Specifies whether a universe or an empty C polyhedron should be built.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space dimension.
-
-    Both parameters are optional:
-    by default, a 0-dimension space universe C polyhedron is built.
-  */
-  explicit C_Polyhedron(dimension_type num_dimensions = 0,
-			Degenerate_Element kind = UNIVERSE);
-
-  //! Builds a C polyhedron from a system of constraints.
-  /*!
-    The polyhedron inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints defining the polyhedron.
-
-    \exception std::invalid_argument
-    Thrown if the system of constraints contains strict inequalities.
-  */
-  explicit C_Polyhedron(const Constraint_System& cs);
-
-  //! Builds a C polyhedron recycling a system of constraints.
-  /*!
-    The polyhedron inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the system of constraints contains strict inequalities.
-  */
-  C_Polyhedron(Constraint_System& cs, Recycle_Input dummy);
-
-  //! Builds a C polyhedron from a system of generators.
-  /*!
-    The polyhedron inherits the space dimension of the generator system.
-
-    \param gs
-    The system of generators defining the polyhedron.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points,
-    or if it contains closure points.
-  */
-  explicit C_Polyhedron(const Generator_System& gs);
-
-  //! Builds a C polyhedron recycling a system of generators.
-  /*!
-    The polyhedron inherits the space dimension of the generator system.
-
-    \param gs
-    The system of generators defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points,
-    or if it contains closure points.
-  */
-  C_Polyhedron(Generator_System& gs, Recycle_Input dummy);
-
-  //! Builds a C polyhedron from a system of congruences.
-  /*!
-    The polyhedron inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences defining the polyhedron.
-  */
-  explicit C_Polyhedron(const Congruence_System& cgs);
-
-  //! Builds a C polyhedron recycling a system of congruences.
-  /*!
-    The polyhedron inherits the space dimension of the congruence
-    system.
-
-    \param cgs
-    The system of congruences defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-  */
-  C_Polyhedron(Congruence_System& cgs, Recycle_Input dummy);
-
-  /*! \brief
-    Builds a C polyhedron representing the topological closure
-    of the NNC polyhedron \p y.
-
-    \param y
-    The NNC polyhedron to be used;
-
-    \param complexity
-    This argument is ignored.
-  */
-  explicit C_Polyhedron(const NNC_Polyhedron& y,
-                        Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a C polyhedron out of a box.
-  /*!
-    The polyhedron inherits the space dimension of the box
-    and is the most precise that includes the box.
-    The algorithm used has polynomial complexity.
-
-    \param box
-    The box representing the polyhedron to be approximated;
-
-    \param complexity
-    This argument is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum allowed
-    space dimension.
-  */
-  template <typename Interval>
-  explicit C_Polyhedron(const Box<Interval>& box,
-                        Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a C polyhedron out of a BD shape.
-  /*!
-    The polyhedron inherits the space dimension of the BDS and is
-    the most precise that includes the BDS.
-
-    \param bd
-    The BDS used to build the polyhedron.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-  */
-  template <typename U>
-  explicit C_Polyhedron(const BD_Shape<U>& bd,
-                        Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a C polyhedron out of an octagonal shape.
-  /*!
-    The polyhedron inherits the space dimension of the octagonal shape
-    and is the most precise that includes the octagonal shape.
-
-    \param os
-    The octagonal shape used to build the polyhedron.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-  */
-  template <typename U>
-  explicit C_Polyhedron(const Octagonal_Shape<U>& os,
-                        Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a C polyhedron out of a grid.
-  /*!
-    The polyhedron inherits the space dimension of the grid
-    and is the most precise that includes the grid.
-
-    \param grid
-    The grid used to build the polyhedron.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-  */
-  explicit C_Polyhedron(const Grid& grid,
-                        Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  C_Polyhedron(const C_Polyhedron& y,
-               Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator.
-    (\p *this and \p y can be dimension-incompatible.)
-  */
-  C_Polyhedron& operator=(const C_Polyhedron& y);
-
-  //! Assigns to \p *this the topological closure of the NNC polyhedron \p y.
-  C_Polyhedron& operator=(const NNC_Polyhedron& y);
-
-  //! Destructor.
-  ~C_Polyhedron();
-
-  /*! \brief
-    If the poly-hull of \p *this and \p y is exact it is assigned
-    to \p *this and <CODE>true</CODE> is returned,
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool poly_hull_assign_if_exact(const C_Polyhedron& y);
-
-  //! Same as poly_hull_assign_if_exact(y).
-  bool upper_bound_assign_if_exact(const C_Polyhedron& y);
-};
-
-#include "C_Polyhedron.inlines.hh"
-
-#endif // !defined(PPL_C_Polyhedron_defs_hh)
diff --git a/src/C_Polyhedron.inlines.hh b/src/C_Polyhedron.inlines.hh
deleted file mode 100644
index 6c9d876..0000000
--- a/src/C_Polyhedron.inlines.hh
+++ /dev/null
@@ -1,154 +0,0 @@
-/* C_Polyhedron class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_C_Polyhedron_inlines_hh
-#define PPL_C_Polyhedron_inlines_hh 1
-
-#include <algorithm>
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-inline
-C_Polyhedron::~C_Polyhedron() {
-}
-
-inline
-C_Polyhedron::C_Polyhedron(dimension_type num_dimensions,
-			   Degenerate_Element kind)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_space_dimension_overflow(num_dimensions,
-                                              NECESSARILY_CLOSED,
-                                              "C_Polyhedron(n, k)",
-                                              "n exceeds the maximum "
-                                              "allowed space dimension"),
-	       kind) {
-}
-
-inline
-C_Polyhedron::C_Polyhedron(const Constraint_System& cs)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(cs, NECESSARILY_CLOSED,
-                                                  "C_Polyhedron(cs)",
-                                                  "the space dimension of cs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension")) {
-}
-
-inline
-C_Polyhedron::C_Polyhedron(Constraint_System& cs, Recycle_Input)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(cs, NECESSARILY_CLOSED,
-                                                  "C_Polyhedron(cs, recycle)",
-                                                  "the space dimension of cs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension"),
-	       Recycle_Input()) {
-}
-
-inline
-C_Polyhedron::C_Polyhedron(const Generator_System& gs)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(gs, NECESSARILY_CLOSED,
-                                                  "C_Polyhedron(gs)",
-                                                  "the space dimension of gs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension")) {
-}
-
-inline
-C_Polyhedron::C_Polyhedron(Generator_System& gs, Recycle_Input)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(gs, NECESSARILY_CLOSED,
-                                                  "C_Polyhedron(gs, recycle)",
-                                                  "the space dimension of gs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension"),
-	       Recycle_Input()) {
-}
-
-template <typename Interval>
-inline
-C_Polyhedron::C_Polyhedron(const Box<Interval>& box, Complexity_Class)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(box, NECESSARILY_CLOSED,
-                                                  "C_Polyhedron(box)",
-                                                  "the space dimension of box "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension")) {
-}
-
-template <typename U>
-inline
-C_Polyhedron::C_Polyhedron(const BD_Shape<U>& bd, Complexity_Class)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_space_dimension_overflow(bd.space_dimension(),
-                                              NECESSARILY_CLOSED,
-                                              "C_Polyhedron(bd)",
-                                              "the space dimension of bd "
-                                              "exceeds the maximum allowed "
-                                              "space dimension"),
-               UNIVERSE) {
-  add_constraints(bd.constraints());
-}
-
-template <typename U>
-inline
-C_Polyhedron::C_Polyhedron(const Octagonal_Shape<U>& os, Complexity_Class)
-  : Polyhedron(NECESSARILY_CLOSED,
-               check_space_dimension_overflow(os.space_dimension(),
-                                              NECESSARILY_CLOSED,
-                                              "C_Polyhedron(os)",
-                                              "the space dimension of os "
-                                              "exceeds the maximum allowed "
-                                              "space dimension"),
-               UNIVERSE) {
-  add_constraints(os.constraints());
-}
-
-inline
-C_Polyhedron::C_Polyhedron(const C_Polyhedron& y, Complexity_Class)
-  : Polyhedron(y) {
-}
-
-inline C_Polyhedron&
-C_Polyhedron::operator=(const C_Polyhedron& y) {
-  Polyhedron::operator=(y);
-  return *this;
-}
-
-inline C_Polyhedron&
-C_Polyhedron::operator=(const NNC_Polyhedron& y) {
-  C_Polyhedron c_y(y);
-  m_swap(c_y);
-  return *this;
-}
-
-inline bool
-C_Polyhedron::upper_bound_assign_if_exact(const C_Polyhedron& y) {
-  return poly_hull_assign_if_exact(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_C_Polyhedron_inlines_hh)
diff --git a/src/C_Polyhedron.types.hh b/src/C_Polyhedron.types.hh
deleted file mode 100644
index e4c1638..0000000
--- a/src/C_Polyhedron.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_C_Polyhedron_types_hh
-#define PPL_C_Polyhedron_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class C_Polyhedron;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_C_Polyhedron_types_hh)
diff --git a/src/C_Polyhedron_defs.hh b/src/C_Polyhedron_defs.hh
new file mode 100644
index 0000000..022c7df
--- /dev/null
+++ b/src/C_Polyhedron_defs.hh
@@ -0,0 +1,280 @@
+/* C_Polyhedron class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_C_Polyhedron_defs_hh
+#define PPL_C_Polyhedron_defs_hh 1
+
+#include "C_Polyhedron_types.hh"
+#include "NNC_Polyhedron_types.hh"
+#include "Polyhedron_defs.hh"
+#include "Grid_types.hh"
+#include "BD_Shape_types.hh"
+#include "Octagonal_Shape_types.hh"
+
+//! A closed convex polyhedron.
+/*! \ingroup PPL_CXX_interface
+    An object of the class C_Polyhedron represents a
+    <EM>topologically closed</EM> convex polyhedron
+    in the vector space \f$\Rset^n\f$.
+
+    When building a closed polyhedron starting from
+    a system of constraints, an exception is thrown if the system
+    contains a <EM>strict inequality</EM> constraint.
+    Similarly, an exception is thrown when building a closed polyhedron
+    starting from a system of generators containing a <EM>closure point</EM>.
+
+    \note
+    Such an exception will be obtained even if the system of
+    constraints (resp., generators) actually defines
+    a topologically closed subset of the vector space, i.e.,
+    even if all the strict inequalities (resp., closure points)
+    in the system happen to be redundant with respect to the
+    system obtained by removing all the strict inequality constraints
+    (resp., all the closure points).
+    In contrast, when building a closed polyhedron starting from
+    an object of the class NNC_Polyhedron,
+    the precise topological closure test will be performed.
+*/
+
+class Parma_Polyhedra_Library::C_Polyhedron : public Polyhedron {
+public:
+  //! Builds either the universe or the empty C polyhedron.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the C polyhedron;
+
+    \param kind
+    Specifies whether a universe or an empty C polyhedron should be built.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space dimension.
+
+    Both parameters are optional:
+    by default, a 0-dimension space universe C polyhedron is built.
+  */
+  explicit C_Polyhedron(dimension_type num_dimensions = 0,
+                        Degenerate_Element kind = UNIVERSE);
+
+  //! Builds a C polyhedron from a system of constraints.
+  /*!
+    The polyhedron inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints defining the polyhedron.
+
+    \exception std::invalid_argument
+    Thrown if the system of constraints contains strict inequalities.
+  */
+  explicit C_Polyhedron(const Constraint_System& cs);
+
+  //! Builds a C polyhedron recycling a system of constraints.
+  /*!
+    The polyhedron inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the system of constraints contains strict inequalities.
+  */
+  C_Polyhedron(Constraint_System& cs, Recycle_Input dummy);
+
+  //! Builds a C polyhedron from a system of generators.
+  /*!
+    The polyhedron inherits the space dimension of the generator system.
+
+    \param gs
+    The system of generators defining the polyhedron.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points,
+    or if it contains closure points.
+  */
+  explicit C_Polyhedron(const Generator_System& gs);
+
+  //! Builds a C polyhedron recycling a system of generators.
+  /*!
+    The polyhedron inherits the space dimension of the generator system.
+
+    \param gs
+    The system of generators defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points,
+    or if it contains closure points.
+  */
+  C_Polyhedron(Generator_System& gs, Recycle_Input dummy);
+
+  //! Builds a C polyhedron from a system of congruences.
+  /*!
+    The polyhedron inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences defining the polyhedron.
+  */
+  explicit C_Polyhedron(const Congruence_System& cgs);
+
+  //! Builds a C polyhedron recycling a system of congruences.
+  /*!
+    The polyhedron inherits the space dimension of the congruence
+    system.
+
+    \param cgs
+    The system of congruences defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+  */
+  C_Polyhedron(Congruence_System& cgs, Recycle_Input dummy);
+
+  /*! \brief
+    Builds a C polyhedron representing the topological closure
+    of the NNC polyhedron \p y.
+
+    \param y
+    The NNC polyhedron to be used;
+
+    \param complexity
+    This argument is ignored.
+  */
+  explicit C_Polyhedron(const NNC_Polyhedron& y,
+                        Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a C polyhedron out of a box.
+  /*!
+    The polyhedron inherits the space dimension of the box
+    and is the most precise that includes the box.
+    The algorithm used has polynomial complexity.
+
+    \param box
+    The box representing the polyhedron to be approximated;
+
+    \param complexity
+    This argument is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum allowed
+    space dimension.
+  */
+  template <typename Interval>
+  explicit C_Polyhedron(const Box<Interval>& box,
+                        Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a C polyhedron out of a BD shape.
+  /*!
+    The polyhedron inherits the space dimension of the BDS and is
+    the most precise that includes the BDS.
+
+    \param bd
+    The BDS used to build the polyhedron.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+  */
+  template <typename U>
+  explicit C_Polyhedron(const BD_Shape<U>& bd,
+                        Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a C polyhedron out of an octagonal shape.
+  /*!
+    The polyhedron inherits the space dimension of the octagonal shape
+    and is the most precise that includes the octagonal shape.
+
+    \param os
+    The octagonal shape used to build the polyhedron.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+  */
+  template <typename U>
+  explicit C_Polyhedron(const Octagonal_Shape<U>& os,
+                        Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a C polyhedron out of a grid.
+  /*!
+    The polyhedron inherits the space dimension of the grid
+    and is the most precise that includes the grid.
+
+    \param grid
+    The grid used to build the polyhedron.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+  */
+  explicit C_Polyhedron(const Grid& grid,
+                        Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  C_Polyhedron(const C_Polyhedron& y,
+               Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator.
+    (\p *this and \p y can be dimension-incompatible.)
+  */
+  C_Polyhedron& operator=(const C_Polyhedron& y);
+
+  //! Assigns to \p *this the topological closure of the NNC polyhedron \p y.
+  C_Polyhedron& operator=(const NNC_Polyhedron& y);
+
+  //! Destructor.
+  ~C_Polyhedron();
+
+  /*! \brief
+    If the poly-hull of \p *this and \p y is exact it is assigned
+    to \p *this and <CODE>true</CODE> is returned,
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool poly_hull_assign_if_exact(const C_Polyhedron& y);
+
+  //! Same as poly_hull_assign_if_exact(y).
+  bool upper_bound_assign_if_exact(const C_Polyhedron& y);
+};
+
+#include "C_Polyhedron_inlines.hh"
+
+#endif // !defined(PPL_C_Polyhedron_defs_hh)
diff --git a/src/C_Polyhedron_inlines.hh b/src/C_Polyhedron_inlines.hh
new file mode 100644
index 0000000..944fbd8
--- /dev/null
+++ b/src/C_Polyhedron_inlines.hh
@@ -0,0 +1,154 @@
+/* C_Polyhedron class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_C_Polyhedron_inlines_hh
+#define PPL_C_Polyhedron_inlines_hh 1
+
+#include <algorithm>
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+inline
+C_Polyhedron::~C_Polyhedron() {
+}
+
+inline
+C_Polyhedron::C_Polyhedron(dimension_type num_dimensions,
+                           Degenerate_Element kind)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_space_dimension_overflow(num_dimensions,
+                                              NECESSARILY_CLOSED,
+                                              "C_Polyhedron(n, k)",
+                                              "n exceeds the maximum "
+                                              "allowed space dimension"),
+               kind) {
+}
+
+inline
+C_Polyhedron::C_Polyhedron(const Constraint_System& cs)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(cs, NECESSARILY_CLOSED,
+                                                  "C_Polyhedron(cs)",
+                                                  "the space dimension of cs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension")) {
+}
+
+inline
+C_Polyhedron::C_Polyhedron(Constraint_System& cs, Recycle_Input)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(cs, NECESSARILY_CLOSED,
+                                                  "C_Polyhedron(cs, recycle)",
+                                                  "the space dimension of cs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension"),
+               Recycle_Input()) {
+}
+
+inline
+C_Polyhedron::C_Polyhedron(const Generator_System& gs)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(gs, NECESSARILY_CLOSED,
+                                                  "C_Polyhedron(gs)",
+                                                  "the space dimension of gs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension")) {
+}
+
+inline
+C_Polyhedron::C_Polyhedron(Generator_System& gs, Recycle_Input)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(gs, NECESSARILY_CLOSED,
+                                                  "C_Polyhedron(gs, recycle)",
+                                                  "the space dimension of gs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension"),
+               Recycle_Input()) {
+}
+
+template <typename Interval>
+inline
+C_Polyhedron::C_Polyhedron(const Box<Interval>& box, Complexity_Class)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(box, NECESSARILY_CLOSED,
+                                                  "C_Polyhedron(box)",
+                                                  "the space dimension of box "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension")) {
+}
+
+template <typename U>
+inline
+C_Polyhedron::C_Polyhedron(const BD_Shape<U>& bd, Complexity_Class)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_space_dimension_overflow(bd.space_dimension(),
+                                              NECESSARILY_CLOSED,
+                                              "C_Polyhedron(bd)",
+                                              "the space dimension of bd "
+                                              "exceeds the maximum allowed "
+                                              "space dimension"),
+               UNIVERSE) {
+  add_constraints(bd.constraints());
+}
+
+template <typename U>
+inline
+C_Polyhedron::C_Polyhedron(const Octagonal_Shape<U>& os, Complexity_Class)
+  : Polyhedron(NECESSARILY_CLOSED,
+               check_space_dimension_overflow(os.space_dimension(),
+                                              NECESSARILY_CLOSED,
+                                              "C_Polyhedron(os)",
+                                              "the space dimension of os "
+                                              "exceeds the maximum allowed "
+                                              "space dimension"),
+               UNIVERSE) {
+  add_constraints(os.constraints());
+}
+
+inline
+C_Polyhedron::C_Polyhedron(const C_Polyhedron& y, Complexity_Class)
+  : Polyhedron(y) {
+}
+
+inline C_Polyhedron&
+C_Polyhedron::operator=(const C_Polyhedron& y) {
+  Polyhedron::operator=(y);
+  return *this;
+}
+
+inline C_Polyhedron&
+C_Polyhedron::operator=(const NNC_Polyhedron& y) {
+  C_Polyhedron c_y(y);
+  m_swap(c_y);
+  return *this;
+}
+
+inline bool
+C_Polyhedron::upper_bound_assign_if_exact(const C_Polyhedron& y) {
+  return poly_hull_assign_if_exact(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_C_Polyhedron_inlines_hh)
diff --git a/src/C_Polyhedron_types.hh b/src/C_Polyhedron_types.hh
new file mode 100644
index 0000000..96d84ca
--- /dev/null
+++ b/src/C_Polyhedron_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_C_Polyhedron_types_hh
+#define PPL_C_Polyhedron_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class C_Polyhedron;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_C_Polyhedron_types_hh)
diff --git a/src/Cast_Floating_Point_Expression.defs.hh b/src/Cast_Floating_Point_Expression.defs.hh
deleted file mode 100644
index bb51861..0000000
--- a/src/Cast_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,182 +0,0 @@
-/* Declarations for the Cast_Floating_Point_Expression class and
-   its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Cast_Floating_Point_Expression_defs_hh
-#define PPL_Cast_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Cast_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Cast_Floating_Point_Expression */
-template<typename FP_Interval_Type, typename FP_Format>
-void
-swap(Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Cast Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of floating-point cast expressions
-
-  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
-  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
-  be two linear forms and \f$\aslf\f$ a sound abstract operator on linear
-  forms such that:
-
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v \right)
-  \aslf
-  \left(i' + \sum_{v \in \cV}i'_{v}v \right)
-  =
-  \left(i \asifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v} \right)v.
-  \f]
-
-  Given a floating point expression \f$e\f$ and a composite abstract store
-  \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right \rrbracket\f$,
-  we construct the interval linear form
-  \f$\linexprenv{cast(e)}{\rho^{\#}}{\rho^{\#}_l}\f$ as follows:
-  \f[
-  \linexprenv{cast(e)}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}
-  \aslf
-  \varepsilon_{\mathbf{f}}\left(\linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}
-  \right)
-  \aslf
-  mf_{\mathbf{f}}[-1, 1]
-  \f]
-  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
-  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
-  on \f$l\f$ and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
-  <CODE>Floating_Point_Expression::absolute_error</CODE>.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Cast_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Builds a cast floating point expression with the value
-    expressed by \p expr.
-  */
-  Cast_Floating_Point_Expression(
-    Floating_Point_Expression<FP_Interval_Type, FP_Format>* const expr);
-
-  //! Destructor.
-  ~Cast_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    See the class description for an explanation of how \p result is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Cast_Floating_Point_Expression& y);
-
-private:
-
-  //! Pointer to the casted expression.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* expr;
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Cast_Floating_Point_Expression(
-			  const Cast_Floating_Point_Expression& y);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited assignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAIL
-  Cast_Floating_Point_Expression& operator=(
-		          const Cast_Floating_Point_Expression& y);
-
-}; // class Cast_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Cast_Floating_Point_Expression.inlines.hh"
-
-#endif // !defined(PPL_Cast_Floating_Point_Expression_defs_hh)
diff --git a/src/Cast_Floating_Point_Expression.inlines.hh b/src/Cast_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 8fea3cf..0000000
--- a/src/Cast_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,64 +0,0 @@
-/* Cast_Floating_Point_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Cast_Floating_Point_Expression_inlines_hh
-#define PPL_Cast_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-Cast_Floating_Point_Expression(
-Floating_Point_Expression<FP_Interval_Type, FP_Format>* const e)
-  : expr(e) {
-  assert(e != 0);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-~Cast_Floating_Point_Expression() {
-  delete expr;
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Cast_Floating_Point_Expression& y) {
-  swap(expr, y.expr);
-}
-
-/*! \relates Cast_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Cast_Floating_Point_Expression_inlines_hh)
diff --git a/src/Cast_Floating_Point_Expression.templates.hh b/src/Cast_Floating_Point_Expression.templates.hh
deleted file mode 100644
index 7210ee5..0000000
--- a/src/Cast_Floating_Point_Expression.templates.hh
+++ /dev/null
@@ -1,46 +0,0 @@
-/* Cast_Floating_Point_Expression class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Cast_Floating_Point_Expression_templates_hh
-#define PPL_Cast_Floating_Point_Expression_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-bool Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store& int_store,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  if (!expr->linearize(int_store, lf_store, result))
-    return false;
-  FP_Linear_Form rel_error;
-  relative_error(result, rel_error);
-  result += rel_error;
-  result += this->absolute_error;
-  return !this->overflows(result);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Cast_Floating_Point_Expression_templates_hh)
diff --git a/src/Cast_Floating_Point_Expression.types.hh b/src/Cast_Floating_Point_Expression.types.hh
deleted file mode 100644
index 066761f..0000000
--- a/src/Cast_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Cast_Floating_Point_Expression_types_hh
-#define PPL_Cast_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Cast_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Cast_Floating_Point_Expression_types_hh)
diff --git a/src/Cast_Floating_Point_Expression_defs.hh b/src/Cast_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..ab6b0e8
--- /dev/null
+++ b/src/Cast_Floating_Point_Expression_defs.hh
@@ -0,0 +1,182 @@
+/* Declarations for the Cast_Floating_Point_Expression class and
+   its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Cast_Floating_Point_Expression_defs_hh
+#define PPL_Cast_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Cast_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Cast_Floating_Point_Expression */
+template<typename FP_Interval_Type, typename FP_Format>
+void
+swap(Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Cast Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of floating-point cast expressions
+
+  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
+  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
+  be two linear forms and \f$\aslf\f$ a sound abstract operator on linear
+  forms such that:
+
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v \right)
+  \aslf
+  \left(i' + \sum_{v \in \cV}i'_{v}v \right)
+  =
+  \left(i \asifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v} \right)v.
+  \f]
+
+  Given a floating point expression \f$e\f$ and a composite abstract store
+  \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right \rrbracket\f$,
+  we construct the interval linear form
+  \f$\linexprenv{cast(e)}{\rho^{\#}}{\rho^{\#}_l}\f$ as follows:
+  \f[
+  \linexprenv{cast(e)}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}
+  \aslf
+  \varepsilon_{\mathbf{f}}\left(\linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}
+  \right)
+  \aslf
+  mf_{\mathbf{f}}[-1, 1]
+  \f]
+  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
+  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
+  on \f$l\f$ and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
+  <CODE>Floating_Point_Expression::absolute_error</CODE>.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Cast_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Builds a cast floating point expression with the value
+    expressed by \p expr.
+  */
+  Cast_Floating_Point_Expression(
+    Floating_Point_Expression<FP_Interval_Type, FP_Format>* const expr);
+
+  //! Destructor.
+  ~Cast_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    See the class description for an explanation of how \p result is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Cast_Floating_Point_Expression& y);
+
+private:
+
+  //! Pointer to the casted expression.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* expr;
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Cast_Floating_Point_Expression(
+                          const Cast_Floating_Point_Expression& y);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited assignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAIL
+  Cast_Floating_Point_Expression& operator=(
+                          const Cast_Floating_Point_Expression& y);
+
+}; // class Cast_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Cast_Floating_Point_Expression_inlines.hh"
+
+#endif // !defined(PPL_Cast_Floating_Point_Expression_defs_hh)
diff --git a/src/Cast_Floating_Point_Expression_inlines.hh b/src/Cast_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..333fe74
--- /dev/null
+++ b/src/Cast_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,64 @@
+/* Cast_Floating_Point_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Cast_Floating_Point_Expression_inlines_hh
+#define PPL_Cast_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+Cast_Floating_Point_Expression(
+Floating_Point_Expression<FP_Interval_Type, FP_Format>* const e)
+  : expr(e) {
+  assert(e != 0);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+~Cast_Floating_Point_Expression() {
+  delete expr;
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Cast_Floating_Point_Expression& y) {
+  swap(expr, y.expr);
+}
+
+/*! \relates Cast_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Cast_Floating_Point_Expression_inlines_hh)
diff --git a/src/Cast_Floating_Point_Expression_templates.hh b/src/Cast_Floating_Point_Expression_templates.hh
new file mode 100644
index 0000000..695a981
--- /dev/null
+++ b/src/Cast_Floating_Point_Expression_templates.hh
@@ -0,0 +1,46 @@
+/* Cast_Floating_Point_Expression class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Cast_Floating_Point_Expression_templates_hh
+#define PPL_Cast_Floating_Point_Expression_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+bool Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store& int_store,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  if (!expr->linearize(int_store, lf_store, result))
+    return false;
+  FP_Linear_Form rel_error;
+  relative_error(result, rel_error);
+  result += rel_error;
+  result += this->absolute_error;
+  return !this->overflows(result);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Cast_Floating_Point_Expression_templates_hh)
diff --git a/src/Cast_Floating_Point_Expression_types.hh b/src/Cast_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..8fa18a6
--- /dev/null
+++ b/src/Cast_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Cast_Floating_Point_Expression_types_hh
+#define PPL_Cast_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Cast_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Cast_Floating_Point_Expression_types_hh)
diff --git a/src/Checked_Number.cc b/src/Checked_Number.cc
index a5ec0c1..df0fc17 100644
--- a/src/Checked_Number.cc
+++ b/src/Checked_Number.cc
@@ -1,6 +1,6 @@
 /* Checked_Number class implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Checked_Number.defs.hh"
+#include "Checked_Number_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -37,18 +37,18 @@ throw_result_exception(Result r) {
     throw std::logic_error("Exact result is less than computed one.");
   case V_LE:
     throw std::logic_error("Exact result is less than or equal to "
-			   "computed one.");
+                           "computed one.");
   case V_GT:
     throw std::logic_error("Exact result is greater than computed one.");
   case V_GE:
     throw std::logic_error("Exact result is greater than or equal to "
-			   "computed one.");
+                           "computed one.");
   case V_NE:
     throw std::logic_error("Exact result is less than or greater than "
-			   "computed one.");
+                           "computed one.");
   case V_LGE:
     throw std::logic_error("Exact result is less than, greater than or "
-			   "equal to computed one.");
+                           "equal to computed one.");
   case V_EQ_MINUS_INFINITY:
     throw std::overflow_error("Minus infinity.");
   case V_GT_MINUS_INFINITY:
diff --git a/src/Checked_Number.defs.hh b/src/Checked_Number.defs.hh
deleted file mode 100644
index c24286a..0000000
--- a/src/Checked_Number.defs.hh
+++ /dev/null
@@ -1,1068 +0,0 @@
-/* Checked_Number class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Checked_Number_defs_hh
-#define PPL_Checked_Number_defs_hh 1
-
-#include "Checked_Number.types.hh"
-#include "checked.defs.hh"
-#include "meta_programming.hh"
-#include "Slow_Copy.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct Extended_Number_Policy {
-  const_bool_nodef(check_overflow, true);
-  const_bool_nodef(check_inf_add_inf, false);
-  const_bool_nodef(check_inf_sub_inf, false);
-  const_bool_nodef(check_inf_mul_zero, false);
-  const_bool_nodef(check_div_zero, false);
-  const_bool_nodef(check_inf_div_inf, false);
-  const_bool_nodef(check_inf_mod, false);
-  const_bool_nodef(check_sqrt_neg, false);
-  const_bool_nodef(has_nan, true);
-  const_bool_nodef(has_infinity, true);
-
-  // `convertible' is intentionally not defined: the compile time
-  // error on conversions is the expected behavior.
-
-  const_bool_nodef(fpu_check_inexact, true);
-  const_bool_nodef(fpu_check_nan_result, true);
-
-  // ROUND_DEFAULT_CONSTRUCTOR is intentionally not defined.
-  // ROUND_DEFAULT_OPERATOR is intentionally not defined.
-  // ROUND_DEFAULT_FUNCTION is intentionally not defined.
-  // ROUND_DEFAULT_INPUT is intentionally not defined.
-  // ROUND_DEFAULT_OUTPUT is intentionally not defined.
-
-  static void handle_result(Result r);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A policy checking for overflows.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-struct Check_Overflow_Policy {
-  const_bool_nodef(check_overflow, true);
-  const_bool_nodef(check_inf_add_inf, false);
-  const_bool_nodef(check_inf_sub_inf, false);
-  const_bool_nodef(check_inf_mul_zero, false);
-  const_bool_nodef(check_div_zero, false);
-  const_bool_nodef(check_inf_div_inf, false);
-  const_bool_nodef(check_inf_mod, false);
-  const_bool_nodef(check_sqrt_neg, false);
-  const_bool_nodef(has_nan, std::numeric_limits<T>::has_quiet_NaN);
-  const_bool_nodef(has_infinity, std::numeric_limits<T>::has_infinity);
-  const_bool_nodef(convertible, true);
-  const_bool_nodef(fpu_check_inexact, true);
-  const_bool_nodef(fpu_check_nan_result, true);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename Enable = void>
-struct Native_Checked_From_Wrapper;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-struct Native_Checked_From_Wrapper<T, typename Enable_If<Is_Native<T>::value>::type> {
-  typedef Checked_Number_Transparent_Policy<T> Policy;
-  static const T& raw_value(const T& v) {
-    return v;
-  }
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename P>
-struct Native_Checked_From_Wrapper<Checked_Number<T, P> > {
-  typedef P Policy;
-  static const T& raw_value(const Checked_Number<T, P>& v) {
-    return v.raw_value();
-  }
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename Enable = void>
-struct Native_Checked_To_Wrapper;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-struct Native_Checked_To_Wrapper<T, typename Enable_If<Is_Native<T>::value>::type> {
-  typedef Check_Overflow_Policy<T> Policy;
-  static T& raw_value(T& v) {
-    return v;
-  }
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename P>
-struct Native_Checked_To_Wrapper<Checked_Number<T, P> > {
-  typedef P Policy;
-  static T& raw_value(Checked_Number<T, P>& v) {
-    return v.raw_value();
-  }
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-struct Is_Checked : public False { };
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename P>
-struct Is_Checked<Checked_Number<T, P> > : public True { };
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-struct Is_Native_Or_Checked
-  : public Bool<Is_Native<T>::value || Is_Checked<T>::value> { };
-
-//! A wrapper for numeric types implementing a given policy.
-/*! \ingroup PPL_CXX_interface
-  The wrapper and related functions implement an interface which is common
-  to all kinds of coefficient types, therefore allowing for a uniform
-  coding style. This class also implements the policy encoded by the
-  second template parameter. The default policy is to perform the detection
-  of overflow errors.
-*/
-template <typename T, typename Policy>
-class Checked_Number {
-public:
-
-  //! \name Constructors
-  //@{
-
-  //! Default constructor.
-  Checked_Number();
-
-  //! Copy constructor.
-  Checked_Number(const Checked_Number& y);
-
-  //! Direct initialization from a Checked_Number and rounding mode.
-  template <typename From, typename From_Policy>
-  Checked_Number(const Checked_Number<From, From_Policy>& y, Rounding_Dir dir);
-
-  //! Direct initialization from a plain char and rounding mode.
-  Checked_Number(char y, Rounding_Dir dir);
-
-  //! Direct initialization from a signed char and rounding mode.
-  Checked_Number(signed char y, Rounding_Dir dir);
-
-  //! Direct initialization from a signed short and rounding mode.
-  Checked_Number(signed short y, Rounding_Dir dir);
-
-  //! Direct initialization from a signed int and rounding mode.
-  Checked_Number(signed int y, Rounding_Dir dir);
-
-  //! Direct initialization from a signed long and rounding mode.
-  Checked_Number(signed long y, Rounding_Dir dir);
-
-  //! Direct initialization from a signed long long and rounding mode.
-  Checked_Number(signed long long y, Rounding_Dir dir);
-
-  //! Direct initialization from an unsigned char and rounding mode.
-  Checked_Number(unsigned char y, Rounding_Dir dir);
-
-  //! Direct initialization from an unsigned short and rounding mode.
-  Checked_Number(unsigned short y, Rounding_Dir dir);
-
-  //! Direct initialization from an unsigned int and rounding mode.
-  Checked_Number(unsigned int y, Rounding_Dir dir);
-
-  //! Direct initialization from an unsigned long and rounding mode.
-  Checked_Number(unsigned long y, Rounding_Dir dir);
-
-  //! Direct initialization from an unsigned long long and rounding mode.
-  Checked_Number(unsigned long long y, Rounding_Dir dir);
-
-#if PPL_SUPPORTED_FLOAT
-  //! Direct initialization from a float and rounding mode.
-  Checked_Number(float y, Rounding_Dir dir);
-#endif
-
-#if PPL_SUPPORTED_DOUBLE
-  //! Direct initialization from a double and rounding mode.
-  Checked_Number(double y, Rounding_Dir dir);
-#endif
-
-#if PPL_SUPPORTED_LONG_DOUBLE
-  //! Direct initialization from a long double and rounding mode.
-  Checked_Number(long double y, Rounding_Dir dir);
-#endif
-
-  //! Direct initialization from a rational and rounding mode.
-  Checked_Number(const mpq_class& y, Rounding_Dir dir);
-
-  //! Direct initialization from an unbounded integer and rounding mode.
-  Checked_Number(const mpz_class& y, Rounding_Dir dir);
-
-  //! Direct initialization from a C string and rounding mode.
-  Checked_Number(const char* y, Rounding_Dir dir);
-
-  //! Direct initialization from special and rounding mode.
-  template <typename From>
-  Checked_Number(const From&, Rounding_Dir dir, typename Enable_If<Is_Special<From>::value, bool>::type ignored = false);
-
-  //! Direct initialization from a Checked_Number, default rounding mode.
-  template <typename From, typename From_Policy>
-  explicit Checked_Number(const Checked_Number<From, From_Policy>& y);
-
-  //! Direct initialization from a plain char, default rounding mode.
-  Checked_Number(char y);
-
-  //! Direct initialization from a signed char, default rounding mode.
-  Checked_Number(signed char y);
-
-  //! Direct initialization from a signed short, default rounding mode.
-  Checked_Number(signed short y);
-
-  //! Direct initialization from a signed int, default rounding mode.
-  Checked_Number(signed int y);
-
-  //! Direct initialization from a signed long, default rounding mode.
-  Checked_Number(signed long y);
-
-  //! Direct initialization from a signed long long, default rounding mode.
-  Checked_Number(signed long long y);
-
-  //! Direct initialization from an unsigned char, default rounding mode.
-  Checked_Number(unsigned char y);
-
-  //! Direct initialization from an unsigned short, default rounding mode.
-  Checked_Number(unsigned short y);
-
-  //! Direct initialization from an unsigned int, default rounding mode.
-  Checked_Number(unsigned int y);
-
-  //! Direct initialization from an unsigned long, default rounding mode.
-  Checked_Number(unsigned long y);
-
-  //! Direct initialization from an unsigned long long, default rounding mode.
-  Checked_Number(unsigned long long y);
-
-  //! Direct initialization from a float, default rounding mode.
-  Checked_Number(float y);
-
-  //! Direct initialization from a double, default rounding mode.
-  Checked_Number(double y);
-
-  //! Direct initialization from a long double, default rounding mode.
-  Checked_Number(long double y);
-
-  //! Direct initialization from a rational, default rounding mode.
-  Checked_Number(const mpq_class& y);
-
-  //! Direct initialization from an unbounded integer, default rounding mode.
-  Checked_Number(const mpz_class& y);
-
-  //! Direct initialization from a C string, default rounding mode.
-  Checked_Number(const char* y);
-
-  //! Direct initialization from special, default rounding mode
-  template <typename From>
-  Checked_Number(const From&, typename Enable_If<Is_Special<From>::value, bool>::type ignored = false);
-
-
-  //@} // Constructors
-
-  //! \name Accessors and Conversions
-  //@{
-
-  //! Conversion operator: returns a copy of the underlying numeric value.
-  operator T() const;
-
-  //! Returns a reference to the underlying numeric value.
-  T& raw_value();
-
-  //! Returns a const reference to the underlying numeric value.
-  const T& raw_value() const;
-
-  //@} // Accessors and Conversions
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //! Classifies *this.
-  /*!
-    Returns the appropriate Result characterizing:
-    - whether \p *this is NaN,
-      if \p nan is <CODE>true</CODE>;
-    - whether \p *this is a (positive or negative) infinity,
-      if \p inf is <CODE>true</CODE>;
-    - the sign of \p *this,
-      if \p sign is <CODE>true</CODE>.
-  */
-  Result classify(bool nan = true, bool inf = true, bool sign = true) const;
-
-  //! \name Assignment Operators
-  //@{
-
-  //! Assignment operator.
-  Checked_Number& operator=(const Checked_Number& y);
-
-  //! Assignment operator.
-  template <typename From>
-  Checked_Number& operator=(const From& y);
-
-  //! Add and assign operator.
-  template <typename From_Policy>
-  Checked_Number& operator+=(const Checked_Number<T, From_Policy>& y);
-
-  //! Add and assign operator.
-  Checked_Number& operator+=(const T& y);
-
-  //! Add and assign operator.
-  template <typename From>
-  typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
-  operator+=(const From& y);
-
-  //! Subtract and assign operator.
-  template <typename From_Policy>
-  Checked_Number& operator-=(const Checked_Number<T, From_Policy>& y);
-
-  //! Subtract and assign operator.
-  Checked_Number& operator-=(const T& y);
-
-  //! Subtract and assign operator.
-  template <typename From>
-  typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
-  operator-=(const From& y);
-
-  //! Multiply and assign operator.
-  template <typename From_Policy>
-  Checked_Number& operator*=(const Checked_Number<T, From_Policy>& y);
-
-  //! Multiply and assign operator.
-  Checked_Number& operator*=(const T& y);
-
-  //! Multiply and assign operator.
-  template <typename From>
-  typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
-  operator*=(const From& y);
-
-  //! Divide and assign operator.
-  template <typename From_Policy>
-  Checked_Number& operator/=(const Checked_Number<T, From_Policy>& y);
-
-  //! Divide and assign operator.
-  Checked_Number& operator/=(const T& y);
-
-  //! Divide and assign operator.
-  template <typename From>
-  typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
-  operator/=(const From& y);
-
-  //! Compute remainder and assign operator.
-  template <typename From_Policy>
-  Checked_Number& operator%=(const Checked_Number<T, From_Policy>& y);
-
-  //! Compute remainder and assign operator.
-  Checked_Number& operator%=(const T& y);
-
-  //! Compute remainder and assign operator.
-  template <typename From>
-  typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>& >::type
-  operator%=(const From& y);
-
-  //@} // Assignment Operators
-
-
-  //! \name Increment and Decrement Operators
-  //@{
-
-  //! Pre-increment operator.
-  Checked_Number& operator++();
-
-  //! Post-increment operator.
-  Checked_Number  operator++(int);
-
-  //! Pre-decrement operator.
-  Checked_Number& operator--();
-
-  //! Post-decrement operator.
-  Checked_Number  operator--(int);
-
-  //@} // Increment and Decrement Operators
-
-private:
-  //! The underlying numeric value.
-  T v;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename P>
-struct Slow_Copy<Checked_Number<T, P> > : public Bool<Slow_Copy<T>::value> {};
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_not_a_number(const T& x);
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_minus_infinity(const T& x);
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_plus_infinity(const T& x);
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, int>::type
-infinity_sign(const T& x);
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_integer(const T& x);
-
-/*! \relates Checked_Number */
-template <typename To, typename From>
-typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
-construct(To& to, const From& x, Rounding_Dir dir);
-
-/*! \relates Checked_Number */
-template <typename To, typename From>
-typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
-assign_r(To& to, const From& x, Rounding_Dir dir);
-
-/*! \relates Checked_Number */
-template <typename To>
-typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
-assign_r(To& to, const char* x, Rounding_Dir dir);
-
-/*! \relates Checked_Number */
-template <typename To, typename To_Policy>
-typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
-assign_r(To& to, char* x, Rounding_Dir dir);
-
-#define PPL_DECLARE_FUNC1_A(name) \
-template <typename To, typename From> \
-typename Enable_If<Is_Native_Or_Checked<To>::value \
-                   && Is_Native_Or_Checked<From>::value, \
-                   Result>::type \
- PPL_U(name)(To& to, const From& x, Rounding_Dir dir);
-
-PPL_DECLARE_FUNC1_A(assign_r)
-PPL_DECLARE_FUNC1_A(floor_assign_r)
-PPL_DECLARE_FUNC1_A(ceil_assign_r)
-PPL_DECLARE_FUNC1_A(trunc_assign_r)
-PPL_DECLARE_FUNC1_A(neg_assign_r)
-PPL_DECLARE_FUNC1_A(abs_assign_r)
-PPL_DECLARE_FUNC1_A(sqrt_assign_r)
-
-#undef PPL_DECLARE_FUNC1_A
-
-#define PPL_DECLARE_FUNC1_B(name) \
-template <typename To, typename From> \
-typename Enable_If<Is_Native_Or_Checked<To>::value \
-                   && Is_Native_Or_Checked<From>::value, \
-                   Result>::type \
- PPL_U(name)(To& to, const From& x, unsigned int exp, Rounding_Dir dir);
-
-PPL_DECLARE_FUNC1_B(add_2exp_assign_r)
-PPL_DECLARE_FUNC1_B(sub_2exp_assign_r)
-PPL_DECLARE_FUNC1_B(mul_2exp_assign_r)
-PPL_DECLARE_FUNC1_B(div_2exp_assign_r)
-PPL_DECLARE_FUNC1_B(smod_2exp_assign_r)
-PPL_DECLARE_FUNC1_B(umod_2exp_assign_r)
-
-#undef PPL_DECLARE_FUNC1_B
-
-#define PPL_DECLARE_FUNC2(name) \
-template <typename To, typename From1, typename From2> \
-typename Enable_If<Is_Native_Or_Checked<To>::value \
-                   && Is_Native_Or_Checked<From1>::value \
-                   && Is_Native_Or_Checked<From2>::value, \
-                   Result>::type \
- PPL_U(name)(To& to, const From1& x, const From2& y, Rounding_Dir dir);
-
-PPL_DECLARE_FUNC2(add_assign_r)
-PPL_DECLARE_FUNC2(sub_assign_r)
-PPL_DECLARE_FUNC2(mul_assign_r)
-PPL_DECLARE_FUNC2(div_assign_r)
-PPL_DECLARE_FUNC2(idiv_assign_r)
-PPL_DECLARE_FUNC2(rem_assign_r)
-PPL_DECLARE_FUNC2(gcd_assign_r)
-PPL_DECLARE_FUNC2(lcm_assign_r)
-PPL_DECLARE_FUNC2(add_mul_assign_r)
-PPL_DECLARE_FUNC2(sub_mul_assign_r)
-
-#undef PPL_DECLARE_FUNC2
-
-#define PPL_DECLARE_FUNC4(name) \
-template <typename To1, typename To2, typename To3, \
-	  typename From1, typename From2> \
-typename Enable_If<Is_Native_Or_Checked<To1>::value \
-                   && Is_Native_Or_Checked<To2>::value \
-                   && Is_Native_Or_Checked<To3>::value \
-                   && Is_Native_Or_Checked<From1>::value \
-		   && Is_Native_Or_Checked<From2>::value, \
-                   Result>::type \
- PPL_U(name)(To1& to, To2& s, To3& t,     \
-     const From1& x, const From2& y, \
-     Rounding_Dir dir);
-
-PPL_DECLARE_FUNC4(gcdext_assign_r)
-
-#undef PPL_DECLARE_FUNC4
-
-//! \name Accessor Functions
-//@{
-
-//@} // Accessor Functions
-
-//! \name Memory Size Inspection Functions
-//@{
-
-//! Returns the total size in bytes of the memory occupied by \p x.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-memory_size_type
-total_memory_in_bytes(const Checked_Number<T, Policy>& x);
-
-//! Returns the size in bytes of the memory managed by \p x.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-memory_size_type
-external_memory_in_bytes(const Checked_Number<T, Policy>& x);
-
-//@} // Memory Size Inspection Functions
-
-//! \name Arithmetic Operators
-//@{
-
-//! Unary plus operator.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-Checked_Number<T, Policy>
-operator+(const Checked_Number<T, Policy>& x);
-
-//! Unary minus operator.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-Checked_Number<T, Policy>
-operator-(const Checked_Number<T, Policy>& x);
-
-//! Assigns to \p x largest integral value not greater than \p x.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-floor_assign(Checked_Number<T, Policy>& x);
-
-//! Assigns to \p x largest integral value not greater than \p y.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-floor_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
-
-//! Assigns to \p x smallest integral value not less than \p x.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-ceil_assign(Checked_Number<T, Policy>& x);
-
-//! Assigns to \p x smallest integral value not less than \p y.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-ceil_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
-
-//! Round \p x to the nearest integer not larger in absolute value.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-trunc_assign(Checked_Number<T, Policy>& x);
-
-//! Assigns to \p x the value of \p y rounded to the nearest integer not larger in absolute value.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-trunc_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
-
-//! Assigns to \p x its negation.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-neg_assign(Checked_Number<T, Policy>& x);
-
-//! Assigns to \p x the negation of \p y.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-neg_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
-
-//! Assigns to \p x its absolute value.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-abs_assign(Checked_Number<T, Policy>& x);
-
-//! Assigns to \p x the absolute value of \p y.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-abs_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
-
-//! Assigns to \p x the value <CODE>x + y * z</CODE>.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-add_mul_assign(Checked_Number<T, Policy>& x,
-	       const Checked_Number<T, Policy>& y,
-	       const Checked_Number<T, Policy>& z);
-
-//! Assigns to \p x the value <CODE>x - y * z</CODE>.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-sub_mul_assign(Checked_Number<T, Policy>& x,
-	       const Checked_Number<T, Policy>& y,
-	       const Checked_Number<T, Policy>& z);
-
-//! Assigns to \p x the greatest common divisor of \p y and \p z.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-gcd_assign(Checked_Number<T, Policy>& x,
-	   const Checked_Number<T, Policy>& y,
-	   const Checked_Number<T, Policy>& z);
-
-/*! \brief
-  Assigns to \p x the greatest common divisor of \p y and \p z,
-  setting \p s and \p t such that s*y + t*z = x = gcd(y, z).
-*/
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-gcdext_assign(Checked_Number<T, Policy>& x,
-	      Checked_Number<T, Policy>& s,
-	      Checked_Number<T, Policy>& t,
-	      const Checked_Number<T, Policy>& y,
-	      const Checked_Number<T, Policy>& z);
-
-//! Assigns to \p x the least common multiple of \p y and \p z.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-lcm_assign(Checked_Number<T, Policy>& x,
-	   const Checked_Number<T, Policy>& y,
-	   const Checked_Number<T, Policy>& z);
-
-//! Assigns to \p x the value \f$ y \cdot 2^\mathtt{exp} \f$.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-mul_2exp_assign(Checked_Number<T, Policy>& x,
-                const Checked_Number<T, Policy>& y,
-                unsigned int exp);
-
-//! Assigns to \p x the value \f$ y / 2^\mathtt{exp} \f$.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void
-div_2exp_assign(Checked_Number<T, Policy>& x,
-                const Checked_Number<T, Policy>& y,
-                unsigned int exp);
-
-/*! \brief
-  If \p z divides \p y, assigns to \p x the quotient of the integer
-  division of \p y and \p z.
-
-  \relates Checked_Number
-  The behavior is undefined if \p z does not divide \p y.
-*/
-template <typename T, typename Policy>
-void
-exact_div_assign(Checked_Number<T, Policy>& x,
-		 const Checked_Number<T, Policy>& y,
-		 const Checked_Number<T, Policy>& z);
-
-//! Assigns to \p x the integer square root of \p y.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void sqrt_assign(Checked_Number<T, Policy>& x,
-		 const Checked_Number<T, Policy>& y);
-
-//@} // Arithmetic Operators
-
-
-//! \name Relational Operators and Comparison Functions
-//@{
-
-//! Equality operator.
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline
-typename Enable_If<Is_Native_Or_Checked<T1>::value
-                   && Is_Native_Or_Checked<T2>::value
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
-operator==(const T1& x, const T2& y);
-
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
-equal(const T1& x, const T2& y);
-
-//! Disequality operator.
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline
-typename Enable_If<Is_Native_Or_Checked<T1>::value
-                   && Is_Native_Or_Checked<T2>::value
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
-operator!=(const T1& x, const T2& y);
-
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
-not_equal(const T1& x, const T2& y);
-
-//! Greater than or equal to operator.
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline
-typename Enable_If<Is_Native_Or_Checked<T1>::value
-                   && Is_Native_Or_Checked<T2>::value
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
-operator>=(const T1& x, const T2& y);
-
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
-greater_or_equal(const T1& x, const T2& y);
-
-//! Greater than operator.
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline
-typename Enable_If<Is_Native_Or_Checked<T1>::value
-                   && Is_Native_Or_Checked<T2>::value
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
-operator>(const T1& x, const T2& y);
-
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
-greater_than(const T1& x, const T2& y);
-
-//! Less than or equal to operator.
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline
-typename Enable_If<Is_Native_Or_Checked<T1>::value
-                   && Is_Native_Or_Checked<T2>::value
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
-operator<=(const T1& x, const T2& y);
-
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
-less_or_equal(const T1& x, const T2& y);
-
-//! Less than operator.
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline
-typename Enable_If<Is_Native_Or_Checked<T1>::value
-                   && Is_Native_Or_Checked<T2>::value
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
-operator<(const T1& x, const T2& y);
-
-/*! \relates Checked_Number */
-template <typename T1, typename T2>
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
-less_than(const T1& x, const T2& y);
-
-/*! \brief
-  Returns \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether the value
-  of \p x is negative, zero or positive, respectively.
-
-  \relates Checked_Number
-*/
-template <typename From>
-inline typename Enable_If<Is_Native_Or_Checked<From>::value, int>::type \
-sgn(const From& x);
-
-/*! \brief
-  Returns a negative, zero or positive value depending on whether
-  \p x is lower than, equal to or greater than \p y, respectively.
-
-  \relates Checked_Number
-*/
-template <typename From1, typename From2>
-inline typename Enable_If<Is_Native_Or_Checked<From1>::value
-                          && Is_Native_Or_Checked<From2>::value,
-                          int>::type
-cmp(const From1& x, const From2& y);
-
-//@} // Relational Operators and Comparison Functions
-
-//! \name Input-Output Operators
-//@{
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
-output(std::ostream& os,
-       const T& x,
-       const Numeric_Format& format,
-       Rounding_Dir dir);
-
-//! Output operator.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-std::ostream&
-operator<<(std::ostream& os, const Checked_Number<T, Policy>& x);
-
-//! Ascii dump for native or checked.
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
-ascii_dump(std::ostream& s, const T& t);
-
-//! Input function.
-/*!
-  \relates Checked_Number
-
-  \param is
-  Input stream to read from;
-
-  \param x
-  Number (possibly extended) to assign to in case of successful reading;
-
-  \param dir
-  Rounding mode to be applied.
-
-  \return
-  Result of the input operation.  Success, success with imprecision,
-  overflow, parsing error: all possibilities are taken into account,
-  checked for, and properly reported.
-
-  This function attempts reading a (possibly extended) number from the given
-  stream \p is, possibly rounding as specified by \p dir, assigning the result
-  to \p x upon success, and returning the appropriate Result.
-
-  The input syntax allows the specification of:
-  - plain base-10 integer numbers as <CODE>34976098</CODE>,
-    <CODE>-77</CODE> and <CODE>+13</CODE>;
-  - base-10 integer numbers in scientific notation as <CODE>15e2</CODE>
-    and <CODE>15*^2</CODE> (both meaning \f$15 \cdot 10^2 = 1500\f$),
-    <CODE>9200e-2</CODE> and <CODE>-18*^+11111111111111111</CODE>;
-  - base-10 rational numbers in fraction notation as
-    <CODE>15/3</CODE> and <CODE>15/-3</CODE>;
-  - base-10 rational numbers in fraction/scientific notation as
-    <CODE>15/30e-1</CODE> (meaning \f$5\f$) and <CODE>15*^-3/29e2</CODE>
-    (meaning \f$3/580000\f$);
-  - base-10 rational numbers in floating point notation as
-    <CODE>71.3</CODE> (meaning \f$713/10\f$) and
-    <CODE>-0.123456</CODE> (meaning \f$-1929/15625\f$);
-  - base-10 rational numbers in floating point scientific notation as
-    <CODE>2.2e-1</CODE> (meaning \f$11/50\f$) and <CODE>-2.20001*^+3</CODE>
-    (meaning \f$-220001/100\f$);
-  - integers and rationals (in fractional, floating point and scientific
-    notations) specified by using Mathematica-style bases, in the range
-    from 2 to 36, as
-    <CODE>2^^11</CODE> (meaning \f$3\f$),
-    <CODE>36^^z</CODE> (meaning \f$35\f$),
-    <CODE>36^^xyz</CODE> (meaning \f$44027\f$),
-    <CODE>2^^11.1</CODE> (meaning \f$7/2\f$),
-    <CODE>10^^2e3</CODE> (meaning \f$2000\f$),
-    <CODE>8^^2e3</CODE> (meaning \f$1024\f$),
-    <CODE>8^^2.1e3</CODE> (meaning \f$1088\f$),
-    <CODE>8^^20402543.120347e7</CODE> (meaning \f$9073863231288\f$),
-    <CODE>8^^2.1</CODE> (meaning \f$17/8\f$);
-    note that the base and the exponent are always written as plain
-    base-10 integer numbers; also, when an ambiguity may arise, the
-    character <CODE>e</CODE> is interpreted as a digit, so that
-    <CODE>16^^1e2</CODE> (meaning \f$482\f$) is different from
-    <CODE>16^^1*^2</CODE> (meaning \f$256\f$);
-  - the C-style hexadecimal prefix <CODE>0x</CODE> is interpreted as
-    the Mathematica-style prefix <CODE>16^^</CODE>;
-  - the C-style binary exponent indicator <CODE>p</CODE> can only be used
-    when base 16 has been specified; if used, the exponent will be
-    applied to base 2 (instead of base 16, as is the case when the
-    indicator <CODE>e</CODE> is used);
-  - special values like <CODE>inf</CODE> and <CODE>+inf</CODE>
-    (meaning \f$+\infty\f$), <CODE>-inf</CODE> (meaning \f$-\infty\f$),
-    and <CODE>nan</CODE> (meaning "not a number").
-
-  The rationale behind the accepted syntax can be summarized as follows:
-  - if the syntax is accepted by Mathematica, then this function
-    accepts it with the same semantics;
-  - if the syntax is acceptable as standard C++ integer or floating point
-    literal (except for octal notation and type suffixes, which are not
-    supported), then this function accepts it with the same semantics;
-  - natural extensions of the above are accepted with the natural
-    extensions of the semantics;
-  - special values are accepted.
-
-  Valid syntax is more formally and completely specified by the
-  following grammar, with the additional provisos that everything is
-  <EM>case insensitive</EM>, that the syntactic category
-  <CODE>BDIGIT</CODE> is further restricted by the current base
-  and that for all bases above 14, any <CODE>e</CODE> is always
-  interpreted as a digit and never as a delimiter for the exponent part
-  (if such a delimiter is desired, it has to be written as <CODE>*^</CODE>).
-
-\code
-number	: NAN					INF	: 'inf'
-	| SIGN INF					;
-	| INF
-	| num					NAN	: 'nan'
-	| num DIV num					;
-	;
-						SIGN	: '-'
-num     : u_num						| '+'
-        | SIGN u_num					;
-
-u_num	: u_num1				EXP	: 'e'
-	| HEX u_num1					| 'p'
-	| base BASE u_num1				| '*^'
-	;                                               ;
-						POINT	: '.'
-u_num1	: mantissa					;
-	| mantissa EXP exponent
-	;					DIV	: '/'
-							;
-mantissa: bdigits
-        | POINT bdigits				MINUS	: '-'
-	| bdigits POINT					;
-	| bdigits POINT bdigits
-	;					PLUS	: '+'
-						;
-exponent: SIGN digits
-	| digits				HEX	: '0x'
-	;					;
-
-bdigits : BDIGIT				BASE	: '^^'
-	| bdigits BDIGIT				;
-	;
-						DIGIT   : '0' .. '9'
-digits  : DIGIT						;
-	| digits DIGIT
-	;					BDIGIT  : '0' .. '9'
-							| 'a' .. 'z'
-							;
-\endcode
-*/
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
-input(T& x, std::istream& is, Rounding_Dir dir);
-
-//! Input operator.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-std::istream&
-operator>>(std::istream& is, Checked_Number<T, Policy>& x);
-
-//! Ascii load for native or checked.
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-ascii_load(std::ostream& s, T& t);
-
-//@} // Input-Output Operators
-
-void throw_result_exception(Result r);
-
-template <typename T>
-T
-plus_infinity();
-
-template <typename T>
-T
-minus_infinity();
-
-template <typename T>
-T
-not_a_number();
-
-//! Swaps \p x with \p y.
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-void swap(Checked_Number<T, Policy>& x, Checked_Number<T, Policy>& y);
-
-template <typename T, typename Policy>
-struct FPU_Related<Checked_Number<T, Policy> > : public FPU_Related<T> {};
-
-template <typename T>
-void maybe_reset_fpu_inexact();
-
-template <typename T>
-int maybe_check_fpu_inexact();
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Checked_Number.inlines.hh"
-#include "Checked_Number.templates.hh"
-
-#endif // !defined(PPL_Checked_Number_defs_hh)
diff --git a/src/Checked_Number.inlines.hh b/src/Checked_Number.inlines.hh
deleted file mode 100644
index be81531..0000000
--- a/src/Checked_Number.inlines.hh
+++ /dev/null
@@ -1,848 +0,0 @@
-/* Checked_Number class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Checked_Number_inlines_hh
-#define PPL_Checked_Number_inlines_hh 1
-
-#include "globals.defs.hh"
-#include <stdexcept>
-#include <sstream>
-
-namespace Parma_Polyhedra_Library {
-
-#ifndef NDEBUG
-#define DEBUG_ROUND_NOT_NEEDED
-#endif
-
-inline Rounding_Dir
-rounding_dir(Rounding_Dir dir) {
-  if (dir == ROUND_NOT_NEEDED) {
-#ifdef DEBUG_ROUND_NOT_NEEDED
-    return ROUND_CHECK;
-#endif
-  }
-  return dir;
-}
-
-inline Result
-check_result(Result r, Rounding_Dir dir) {
-  if (dir == ROUND_NOT_NEEDED) {
-#ifdef DEBUG_ROUND_NOT_NEEDED
-    PPL_ASSERT(result_relation(r) == VR_EQ);
-#endif
-    return r;
-  }
-  return r;
-}
-
-
-template <typename T>
-inline void
-Checked_Number_Transparent_Policy<T>::handle_result(Result) {
-}
-
-inline void
-Extended_Number_Policy::handle_result(Result r) {
-  if (result_class(r) == VC_NAN)
-    throw_result_exception(r);
-}
-
-template <typename T, typename Policy>
-inline
-Checked_Number<T, Policy>::Checked_Number()
- : v(0) {
-}
-
-template <typename T, typename Policy>
-inline
-Checked_Number<T, Policy>::Checked_Number(const Checked_Number& y) {
-  // TODO: avoid default construction of value member.
-  Checked::copy<Policy, Policy>(v, y.raw_value());
-}
-
-template <typename T, typename Policy>
-template <typename From, typename From_Policy>
-inline
-Checked_Number<T, Policy>
-::Checked_Number(const Checked_Number<From, From_Policy>& y,
-		 Rounding_Dir dir) {
-  // TODO: avoid default construction of value member.
-  Policy::handle_result(check_result(Checked::assign_ext<Policy, From_Policy>
-				     (v,
-				      y.raw_value(),
-				      rounding_dir(dir)),
-				     dir)
-			);
-}
-
-template <typename T, typename Policy>
-template <typename From, typename From_Policy>
-inline
-Checked_Number<T, Policy>
-::Checked_Number(const Checked_Number<From, From_Policy>& y) {
-  // TODO: avoid default construction of value member.
-  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
-  Policy::handle_result(check_result(Checked::assign_ext<Policy, From_Policy>
-				     (v,
-				      y.raw_value(),
-				      rounding_dir(dir)),
-				     dir));
-}
-
-// TODO: avoid default construction of value member.
-#define PPL_DEFINE_CTOR(type) \
-template <typename T, typename Policy> \
-inline \
-Checked_Number<T, Policy>::Checked_Number(const type y, Rounding_Dir dir) { \
-  Policy::handle_result							\
-    (check_result(Checked::assign_ext<Policy,                           \
-                                      Checked_Number_Transparent_Policy<PPL_U(type)> > \
-		  (v, y, rounding_dir(dir)),				\
-		  dir));						\
-}									\
-template <typename T, typename Policy>					\
-inline									\
-Checked_Number<T, Policy>::Checked_Number(const type y) {		\
-  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;			\
-  Policy::handle_result							\
-    (check_result(Checked::assign_ext<Policy,                           \
-                                      Checked_Number_Transparent_Policy<PPL_U(type)> > \
-		  (v, y, rounding_dir(dir)),				\
-		  dir));						\
-}
-
-PPL_DEFINE_CTOR(char)
-PPL_DEFINE_CTOR(signed char)
-PPL_DEFINE_CTOR(signed short)
-PPL_DEFINE_CTOR(signed int)
-PPL_DEFINE_CTOR(signed long)
-PPL_DEFINE_CTOR(signed long long)
-PPL_DEFINE_CTOR(unsigned char)
-PPL_DEFINE_CTOR(unsigned short)
-PPL_DEFINE_CTOR(unsigned int)
-PPL_DEFINE_CTOR(unsigned long)
-PPL_DEFINE_CTOR(unsigned long long)
-#if PPL_SUPPORTED_FLOAT
-PPL_DEFINE_CTOR(float)
-#endif
-#if PPL_SUPPORTED_DOUBLE
-PPL_DEFINE_CTOR(double)
-#endif
-#if PPL_SUPPORTED_LONG_DOUBLE
-PPL_DEFINE_CTOR(long double)
-#endif
-PPL_DEFINE_CTOR(mpq_class&)
-PPL_DEFINE_CTOR(mpz_class&)
-
-#undef PPL_DEFINE_CTOR
-
-
-template <typename T, typename Policy>
-inline
-Checked_Number<T, Policy>::Checked_Number(const char* y, Rounding_Dir dir) {
-  std::istringstream s(y);
-  Policy::handle_result(check_result(Checked::input<Policy>(v,
-							    s,
-							    rounding_dir(dir)),
-				     dir));
-}
-
-template <typename T, typename Policy>
-inline
-Checked_Number<T, Policy>::Checked_Number(const char* y) {
-  std::istringstream s(y);
-  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
-  Policy::handle_result(check_result(Checked::input<Policy>(v,
-							    s,
-							    rounding_dir(dir)),
-				     dir));
-}
-
-template <typename T, typename Policy>
-template <typename From>
-inline
-Checked_Number<T, Policy>
-::Checked_Number(const From&,
-                 Rounding_Dir dir,
-                 typename Enable_If<Is_Special<From>::value, bool>::type) {
-  Policy::handle_result(check_result(Checked::assign_special<Policy>(v,
-                                                                     From::vclass,
-                                                                     rounding_dir(dir)),
-                                     dir));
-}
-
-template <typename T, typename Policy>
-template <typename From>
-inline
-Checked_Number<T, Policy>::Checked_Number(const From&, typename Enable_If<Is_Special<From>::value, bool>::type) {
-  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
-  Policy::handle_result(check_result(Checked::assign_special<Policy>(v,
-							    From::vclass,
-							    rounding_dir(dir)),
-				     dir));
-}
-
-template <typename To, typename From>
-inline typename Enable_If<Is_Native_Or_Checked<To>::value
-                          && Is_Special<From>::value, Result>::type
-assign_r(To& to, const From&, Rounding_Dir dir) {
-  return check_result(Checked::assign_special<typename Native_Checked_To_Wrapper<To>
-		      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
-				From::vclass,
-				rounding_dir(dir)),
-		      dir);
-}
-
-template <typename To, typename From>
-inline typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
-construct(To& to, const From&, Rounding_Dir dir) {
-  return check_result(Checked::construct_special<typename Native_Checked_To_Wrapper<To>
-		      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
-				From::vclass,
-				rounding_dir(dir)),
-		      dir);
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_minus_infinity(const T& x) {
-  return Checked::is_minf<typename Native_Checked_From_Wrapper<T>
-    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_plus_infinity(const T& x) {
-  return Checked::is_pinf<typename Native_Checked_From_Wrapper<T>
-    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, int>::type
-infinity_sign(const T& x) {
-  return is_minus_infinity(x) ? -1 : (is_plus_infinity(x) ? 1 : 0);
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_not_a_number(const T& x) {
-  return Checked::is_nan<typename Native_Checked_From_Wrapper<T>
-    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_integer(const T& x) {
-  return Checked::is_int<typename Native_Checked_From_Wrapper<T>
-    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
-}
-
-template <typename T, typename Policy>
-inline
-Checked_Number<T, Policy>::operator T() const {
-  if (Policy::convertible)
-    return v;
-}
-
-template <typename T, typename Policy>
-inline T&
-Checked_Number<T, Policy>::raw_value() {
-  return v;
-}
-
-template <typename T, typename Policy>
-inline const T&
-Checked_Number<T, Policy>::raw_value() const {
-  return v;
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline const T&
-raw_value(const Checked_Number<T, Policy>& x) {
-  return x.raw_value();
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline T&
-raw_value(Checked_Number<T, Policy>& x) {
-  return x.raw_value();
-}
-
-template <typename T, typename Policy>
-inline bool
-Checked_Number<T, Policy>::OK() const {
-  return true;
-}
-
-template <typename T, typename Policy>
-inline Result
-Checked_Number<T, Policy>::classify(bool nan, bool inf, bool sign) const {
-  return Checked::classify<Policy>(v, nan, inf, sign);
-}
-
-template <typename T, typename Policy>
-inline bool
-is_not_a_number(const Checked_Number<T, Policy>& x) {
-  return Checked::is_nan<Policy>(x.raw_value());
-}
-
-template <typename T, typename Policy>
-inline bool
-is_minus_infinity(const Checked_Number<T, Policy>& x) {
-  return Checked::is_minf<Policy>(x.raw_value());
-}
-
-template <typename T, typename Policy>
-inline bool
-is_plus_infinity(const Checked_Number<T, Policy>& x) {
-  return Checked::is_pinf<Policy>(x.raw_value());
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline memory_size_type
-total_memory_in_bytes(const Checked_Number<T, Policy>& x) {
-  return total_memory_in_bytes(x.raw_value());
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline memory_size_type
-external_memory_in_bytes(const Checked_Number<T, Policy>& x) {
-  return external_memory_in_bytes(x.raw_value());
-}
-
-
-/*! \relates Checked_Number */
-template <typename To>
-inline typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
-assign_r(To& to, const char* x, Rounding_Dir dir) {
-  std::istringstream s(x);
-  return check_result(Checked::input<typename Native_Checked_To_Wrapper<To>
-		      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
-				s,
-				rounding_dir(dir)),
-		      dir);
-}
-
-#define PPL_DEFINE_FUNC1_A(name, func) \
-template <typename To, typename From>					\
-inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
-                          && Is_Native_Or_Checked<From>::value,         \
-                          Result>::type                                 \
- PPL_U(name)(To& to, const From& x, Rounding_Dir dir) {                 \
-  return								\
-    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>	\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From>		\
-		 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
-			   Native_Checked_From_Wrapper<From>::raw_value(x), \
-			   rounding_dir(dir)), dir);			\
-}
-
-PPL_DEFINE_FUNC1_A(construct, construct_ext)
-PPL_DEFINE_FUNC1_A(assign_r, assign_ext)
-PPL_DEFINE_FUNC1_A(floor_assign_r, floor_ext)
-PPL_DEFINE_FUNC1_A(ceil_assign_r, ceil_ext)
-PPL_DEFINE_FUNC1_A(trunc_assign_r, trunc_ext)
-PPL_DEFINE_FUNC1_A(neg_assign_r, neg_ext)
-PPL_DEFINE_FUNC1_A(abs_assign_r, abs_ext)
-PPL_DEFINE_FUNC1_A(sqrt_assign_r, sqrt_ext)
-
-#undef PPL_DEFINE_FUNC1_A
-
-#define PPL_DEFINE_FUNC1_B(name, func) \
-template <typename To, typename From>					\
-inline typename Enable_If<Is_Native_Or_Checked<To>::value		\
-                          && Is_Native_Or_Checked<From>::value,         \
-                          Result>::type					\
- PPL_U(name)(To& to, const From& x, unsigned int exp, Rounding_Dir dir) { \
-  return								\
-    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>	\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From>		\
-		 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
-			   Native_Checked_From_Wrapper<From>::raw_value(x), \
-			   exp,						\
-			   rounding_dir(dir)),				\
-		 dir);							\
-}
-
-PPL_DEFINE_FUNC1_B(add_2exp_assign_r, add_2exp_ext)
-PPL_DEFINE_FUNC1_B(sub_2exp_assign_r, sub_2exp_ext)
-PPL_DEFINE_FUNC1_B(mul_2exp_assign_r, mul_2exp_ext)
-PPL_DEFINE_FUNC1_B(div_2exp_assign_r, div_2exp_ext)
-PPL_DEFINE_FUNC1_B(smod_2exp_assign_r, smod_2exp_ext)
-PPL_DEFINE_FUNC1_B(umod_2exp_assign_r, umod_2exp_ext)
-
-#undef PPL_DEFINE_FUNC1_B
-
-#define PPL_DEFINE_FUNC2(name, func) \
-template <typename To, typename From1, typename From2>			\
-inline typename Enable_If<Is_Native_Or_Checked<To>::value		\
-                          && Is_Native_Or_Checked<From1>::value         \
-                          && Is_Native_Or_Checked<From2>::value,        \
-                          Result>::type					\
- PPL_U(name)(To& to, const From1& x, const From2& y, Rounding_Dir dir) { \
-  return								\
-    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>	\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From1>		\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From2>		\
-		 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
-			   Native_Checked_From_Wrapper<From1>::raw_value(x), \
-			   Native_Checked_From_Wrapper<From2>::raw_value(y), \
-			   rounding_dir(dir)),				\
-		 dir);							\
-}
-
-PPL_DEFINE_FUNC2(add_assign_r, add_ext)
-PPL_DEFINE_FUNC2(sub_assign_r, sub_ext)
-PPL_DEFINE_FUNC2(mul_assign_r, mul_ext)
-PPL_DEFINE_FUNC2(div_assign_r, div_ext)
-PPL_DEFINE_FUNC2(idiv_assign_r, idiv_ext)
-PPL_DEFINE_FUNC2(rem_assign_r, rem_ext)
-PPL_DEFINE_FUNC2(gcd_assign_r, gcd_ext)
-PPL_DEFINE_FUNC2(lcm_assign_r, lcm_ext)
-PPL_DEFINE_FUNC2(add_mul_assign_r, add_mul_ext)
-PPL_DEFINE_FUNC2(sub_mul_assign_r, sub_mul_ext)
-
-#undef PPL_DEFINE_FUNC2
-
-#define PPL_DEFINE_FUNC4(name, func)                                    \
-template <typename To1,							\
-          typename To2,							\
-	  typename To3,							\
-          typename From1,						\
-          typename From2>						\
-inline typename Enable_If<Is_Native_Or_Checked<To1>::value		\
-                          && Is_Native_Or_Checked<To2>::value           \
-                          && Is_Native_Or_Checked<To3>::value           \
-                          && Is_Native_Or_Checked<From1>::value         \
-                          && Is_Native_Or_Checked<From2>::value,        \
-                          Result>::type					\
- PPL_U(name)(To1& to, To2& s, To3& t, const From1& x, const From2& y,   \
-     Rounding_Dir dir) {						\
-  return								\
-    check_result							\
-    (Checked::func<typename Native_Checked_To_Wrapper<To1>::Policy,	\
-                   typename Native_Checked_To_Wrapper<To2>::Policy,	\
-                   typename Native_Checked_To_Wrapper<To3>::Policy,	\
-                   typename Native_Checked_From_Wrapper<From1>::Policy,	\
-                   typename Native_Checked_From_Wrapper<From2>::Policy>	\
-     (Native_Checked_To_Wrapper<To1>::raw_value(to),			\
-      Native_Checked_To_Wrapper<To2>::raw_value(s),			\
-      Native_Checked_To_Wrapper<To3>::raw_value(t),			\
-      Native_Checked_From_Wrapper<From1>::raw_value(x),			\
-      Native_Checked_From_Wrapper<From2>::raw_value(y),			\
-      rounding_dir(dir)),						\
-     dir);								\
-}
-
-PPL_DEFINE_FUNC4(gcdext_assign_r, gcdext_ext)
-
-#undef PPL_DEFINE_PPL_DEFINE_FUNC4
-
-#define PPL_DEFINE_INCREMENT(f, fun) \
-template <typename T, typename Policy> \
-inline Checked_Number<T, Policy>& \
-Checked_Number<T, Policy>::f() { \
-  Policy::handle_result((fun)(*this, *this, T(1),             \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
-  return *this; \
-} \
-template <typename T, typename Policy> \
-inline Checked_Number<T, Policy> \
-Checked_Number<T, Policy>::f(int) {\
-  T r = v;\
-  Policy::handle_result((fun)(*this, *this, T(1),             \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
-  return r;\
-}
-
-PPL_DEFINE_INCREMENT(operator ++, add_assign_r)
-PPL_DEFINE_INCREMENT(operator --, sub_assign_r)
-
-#undef PPL_DEFINE_INCREMENT
-
-template <typename T, typename Policy>
-inline Checked_Number<T, Policy>&
-Checked_Number<T, Policy>::operator=(const Checked_Number<T, Policy>& y) {
-  Checked::copy<Policy, Policy>(v, y.raw_value());
-  return *this;
-}
-template <typename T, typename Policy>
-template <typename From>
-inline Checked_Number<T, Policy>&
-Checked_Number<T, Policy>::operator=(const From& y) {
-  Policy::handle_result(assign_r(*this, y, Policy::ROUND_DEFAULT_OPERATOR));
-  return *this;
-}
-
-#define PPL_DEFINE_BINARY_OP_ASSIGN(f, fun) \
-template <typename T, typename Policy> \
-template <typename From_Policy> \
-inline Checked_Number<T, Policy>& \
-Checked_Number<T, Policy>::f(const Checked_Number<T, From_Policy>& y) { \
-  Policy::handle_result((fun)(*this, *this, y,                          \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
-  return *this; \
-} \
-template <typename T, typename Policy> \
-inline Checked_Number<T, Policy>& \
-Checked_Number<T, Policy>::f(const T& y) { \
-  Policy::handle_result((fun)(*this, *this, y,                \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
-  return *this; \
-} \
-template <typename T, typename Policy> \
-template <typename From> \
-inline typename Enable_If<Is_Native_Or_Checked<From>::value, \
-                          Checked_Number<T, Policy>& >::type \
-Checked_Number<T, Policy>::f(const From& y) { \
-  Checked_Number<T, Policy> cy(y); \
-  Policy::handle_result((fun)(*this, *this, cy,               \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
-  return *this; \
-}
-
-PPL_DEFINE_BINARY_OP_ASSIGN(operator +=, add_assign_r)
-PPL_DEFINE_BINARY_OP_ASSIGN(operator -=, sub_assign_r)
-PPL_DEFINE_BINARY_OP_ASSIGN(operator *=, mul_assign_r)
-PPL_DEFINE_BINARY_OP_ASSIGN(operator /=, div_assign_r)
-PPL_DEFINE_BINARY_OP_ASSIGN(operator %=, rem_assign_r)
-
-#undef PPL_DEFINE_BINARY_OP_ASSIGN
-
-#define PPL_DEFINE_BINARY_OP(f, fun) \
-template <typename T, typename Policy> \
-inline Checked_Number<T, Policy> \
- PPL_U(f)(const Checked_Number<T, Policy>& x,   \
-         const Checked_Number<T, Policy>& y) {  \
-  Checked_Number<T, Policy> r; \
-  Policy::handle_result((fun)(r, x, y, Policy::ROUND_DEFAULT_OPERATOR)); \
-  return r; \
-} \
-template <typename Type, typename T, typename Policy>	\
-inline \
-typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
- PPL_U(f)(const Type& x, const Checked_Number<T, Policy>& y) {          \
-  Checked_Number<T, Policy> r(x); \
-  Policy::handle_result((fun)(r, r, y, Policy::ROUND_DEFAULT_OPERATOR)); \
-  return r; \
-} \
-template <typename T, typename Policy, typename Type>	\
-inline \
-typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
- PPL_U(f)(const Checked_Number<T, Policy>& x, const Type& y) {          \
-  Checked_Number<T, Policy> r(y); \
-  Policy::handle_result((fun)(r, x, r, Policy::ROUND_DEFAULT_OPERATOR)); \
-  return r; \
-}
-
-PPL_DEFINE_BINARY_OP(operator +, add_assign_r)
-PPL_DEFINE_BINARY_OP(operator -, sub_assign_r)
-PPL_DEFINE_BINARY_OP(operator *, mul_assign_r)
-PPL_DEFINE_BINARY_OP(operator /, div_assign_r)
-PPL_DEFINE_BINARY_OP(operator %, rem_assign_r)
-
-#undef PPL_DEFINE_BINARY_OP
-
-#define PPL_DEFINE_COMPARE_OP(f, fun)                                   \
-template <typename T1, typename T2>					\
-inline									\
-typename Enable_If<Is_Native_Or_Checked<T1>::value                      \
-                   && Is_Native_Or_Checked<T2>::value                   \
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),	\
-		   bool>::type						\
- PPL_U(f)(const T1& x, const T2& y) {                                   \
-  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy,	\
-    		      typename Native_Checked_From_Wrapper<T2>::Policy>	\
-    (Native_Checked_From_Wrapper<T1>::raw_value(x),			\
-     Native_Checked_From_Wrapper<T2>::raw_value(y));			\
-}
-
-PPL_DEFINE_COMPARE_OP(operator ==, eq_ext)
-PPL_DEFINE_COMPARE_OP(operator !=, ne_ext)
-PPL_DEFINE_COMPARE_OP(operator >=, ge_ext)
-PPL_DEFINE_COMPARE_OP(operator >, gt_ext)
-PPL_DEFINE_COMPARE_OP(operator <=, le_ext)
-PPL_DEFINE_COMPARE_OP(operator <, lt_ext)
-
-#undef PPL_DEFINE_COMPARE_OP
-
-#define PPL_DEFINE_COMPARE(f, fun)                                      \
-template <typename T1, typename T2>					\
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value		\
-			  && Is_Native_Or_Checked<T2>::value,		\
-                          bool>::type					\
- PPL_U(f)(const T1& x, const T2& y) {                                   \
-  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy,	\
-    		      typename Native_Checked_From_Wrapper<T2>::Policy>	\
-    (Native_Checked_From_Wrapper<T1>::raw_value(x),			\
-     Native_Checked_From_Wrapper<T2>::raw_value(y));			\
-}
-
-PPL_DEFINE_COMPARE(equal, eq_ext)
-PPL_DEFINE_COMPARE(not_equal, ne_ext)
-PPL_DEFINE_COMPARE(greater_or_equal, ge_ext)
-PPL_DEFINE_COMPARE(greater_than, gt_ext)
-PPL_DEFINE_COMPARE(less_or_equal, le_ext)
-PPL_DEFINE_COMPARE(less_than, lt_ext)
-
-#undef PPL_DEFINE_COMPARE
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline Checked_Number<T, Policy>
-operator+(const Checked_Number<T, Policy>& x) {
-  return x;
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline Checked_Number<T, Policy>
-operator-(const Checked_Number<T, Policy>& x) {
-  Checked_Number<T, Policy> r;
-  Policy::handle_result(neg_assign_r(r, x, Policy::ROUND_DEFAULT_OPERATOR));
-  return r;
-}
-
-#define PPL_DEFINE_ASSIGN_FUN2_1(f, fun) \
-template <typename T, typename Policy> \
-inline void \
- PPL_U(f)(Checked_Number<T, Policy>& x) {                               \
-  Policy::handle_result((fun)(x, x, Policy::ROUND_DEFAULT_FUNCTION));	\
-}
-
-#define PPL_DEFINE_ASSIGN_FUN2_2(f, fun) \
-template <typename T, typename Policy> \
-inline void \
- PPL_U(f)(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y) { \
-  Policy::handle_result((fun)(x, y, Policy::ROUND_DEFAULT_FUNCTION)); \
-}
-
-#define PPL_DEFINE_ASSIGN_FUN3_3(f, fun) \
-template <typename T, typename Policy> \
-inline void \
- PPL_U(f)(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y, \
-  const Checked_Number<T, Policy>& z) { \
-  Policy::handle_result((fun)(x, y, z, Policy::ROUND_DEFAULT_FUNCTION)); \
-}
-
-#define PPL_DEFINE_ASSIGN_FUN5_5(f, fun)					\
-template <typename T, typename Policy>					\
-inline void								\
- PPL_U(f)(Checked_Number<T, Policy>& x,                                 \
-  Checked_Number<T, Policy>& s, Checked_Number<T, Policy>& t,		\
-  const Checked_Number<T, Policy>& y,					\
-  const Checked_Number<T, Policy>& z) {					\
-  Policy::handle_result((fun)(x, s, t, y, z, Policy::ROUND_DEFAULT_FUNCTION)); \
-}
-
-PPL_DEFINE_ASSIGN_FUN2_2(sqrt_assign, sqrt_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN2_1(floor_assign, floor_assign_r)
-PPL_DEFINE_ASSIGN_FUN2_2(floor_assign, floor_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN2_1(ceil_assign, ceil_assign_r)
-PPL_DEFINE_ASSIGN_FUN2_2(ceil_assign, ceil_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN2_1(trunc_assign, trunc_assign_r)
-PPL_DEFINE_ASSIGN_FUN2_2(trunc_assign, trunc_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN2_1(neg_assign, neg_assign_r)
-PPL_DEFINE_ASSIGN_FUN2_2(neg_assign, neg_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN2_1(abs_assign, abs_assign_r)
-PPL_DEFINE_ASSIGN_FUN2_2(abs_assign, abs_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN3_3(add_mul_assign, add_mul_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN3_3(sub_mul_assign, sub_mul_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN3_3(rem_assign, rem_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN3_3(gcd_assign, gcd_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN5_5(gcdext_assign, gcdext_assign_r)
-
-PPL_DEFINE_ASSIGN_FUN3_3(lcm_assign, lcm_assign_r)
-
-#undef PPL_DEFINE_ASSIGN_FUN2_1
-#undef PPL_DEFINE_ASSIGN_FUN2_2
-#undef PPL_DEFINE_ASSIGN_FUN3_2
-#undef PPL_DEFINE_ASSIGN_FUN3_3
-#undef PPL_DEFINE_ASSIGN_FUN5_5
-
-#define PPL_DEFINE_ASSIGN_2EXP(f, fun)					\
-template <typename T, typename Policy>                                  \
-inline void								\
- PPL_U(f)(Checked_Number<T, Policy>& x,                                 \
-          const Checked_Number<T, Policy>& y, unsigned int exp) {       \
-  Policy::handle_result((fun)(x, y, exp, Policy::ROUND_DEFAULT_FUNCTION)); \
-}
-
-PPL_DEFINE_ASSIGN_2EXP(mul_2exp_assign, mul_2exp_assign_r)
-PPL_DEFINE_ASSIGN_2EXP(div_2exp_assign, div_2exp_assign_r)
-
-template <typename T, typename Policy>
-inline void
-exact_div_assign(Checked_Number<T, Policy>& x,
-		 const Checked_Number<T, Policy>& y,
-		 const Checked_Number<T, Policy>& z) {
-  Policy::handle_result(div_assign_r(x, y, z, ROUND_NOT_NEEDED));
-}
-
-/*! \relates Checked_Number */
-template <typename From>
-inline typename Enable_If<Is_Native_Or_Checked<From>::value, int>::type
-sgn(const From& x) {
-  Result_Relation r = Checked::sgn_ext<typename Native_Checked_From_Wrapper<From>::Policy>(Native_Checked_From_Wrapper<From>::raw_value(x));
-  switch (r) {
-  case VR_LT:
-    return -1;
-  case VR_EQ:
-    return 0;
-  case VR_GT:
-    return 1;
-  default:
-    throw(0);
-  }
-}
-
-/*! \relates Checked_Number */
-template <typename From1, typename From2>
-inline typename Enable_If<Is_Native_Or_Checked<From1>::value
-                          && Is_Native_Or_Checked<From2>::value,
-                          int>::type
-cmp(const From1& x, const From2& y) {
-  Result_Relation r
-    = Checked::cmp_ext<typename Native_Checked_From_Wrapper<From1>::Policy,
-                       typename Native_Checked_From_Wrapper<From2>::Policy>
-                 (Native_Checked_From_Wrapper<From1>::raw_value(x),
-		  Native_Checked_From_Wrapper<From2>::raw_value(y));
-  switch (r) {
-  case VR_LT:
-    return -1;
-  case VR_EQ:
-    return 0;
-  case VR_GT:
-    return 1;
-  default:
-    throw(0);
-  }
-}
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
-output(std::ostream& os, const T& x,
-       const Numeric_Format& format, Rounding_Dir dir) {
-  return check_result(Checked::output_ext<typename Native_Checked_From_Wrapper<T>::Policy>
-		      (os,
-		       Native_Checked_From_Wrapper<T>::raw_value(x),
-		       format,
-		       rounding_dir(dir)),
-		      dir);
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline std::ostream&
-operator<<(std::ostream& os, const Checked_Number<T, Policy>& x) {
-  Policy::handle_result(output(os, x, Numeric_Format(), ROUND_IGNORE));
-  return os;
-}
-
-/*! \relates Checked_Number */
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
-input(T& x, std::istream& is, Rounding_Dir dir) {
-  return check_result(Checked::input_ext<typename Native_Checked_To_Wrapper<T>::Policy>
-		      (Native_Checked_To_Wrapper<T>::raw_value(x),
-		       is,
-		       rounding_dir(dir)),
-		      dir);
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline std::istream& operator>>(std::istream& is,
-				Checked_Number<T, Policy>& x) {
-  Result r = input(x, is, Policy::ROUND_DEFAULT_INPUT);
-  if (r == V_CVT_STR_UNK)
-    is.setstate(std::ios::failbit);
-  else
-    Policy::handle_result(r);
-  return is;
-}
-
-template <typename T>
-inline T
-plus_infinity() {
-  return PLUS_INFINITY;
-}
-
-template <typename T>
-inline T
-minus_infinity() {
-  return MINUS_INFINITY;
-}
-
-template <typename T>
-inline T
-not_a_number() {
-  return NOT_A_NUMBER;
-}
-
-/*! \relates Checked_Number */
-template <typename T, typename Policy>
-inline void
-swap(Checked_Number<T, Policy>& x, Checked_Number<T, Policy>& y) {
-  using std::swap;
-  swap(x.raw_value(), y.raw_value());
-}
-
-template <typename T>
-inline void
-maybe_reset_fpu_inexact() {
-  if (FPU_Related<T>::value)
-    return fpu_reset_inexact();
-}
-
-template <typename T>
-inline int
-maybe_check_fpu_inexact() {
-  if (FPU_Related<T>::value)
-    return fpu_check_inexact();
-  else
-    return 0;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Checked_Number_inlines_hh)
diff --git a/src/Checked_Number.templates.hh b/src/Checked_Number.templates.hh
deleted file mode 100644
index 5c6c596..0000000
--- a/src/Checked_Number.templates.hh
+++ /dev/null
@@ -1,149 +0,0 @@
-/* Checked_Number class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Checked_Number_templates_hh
-#define PPL_Checked_Number_templates_hh 1
-
-#include "assert.hh"
-#include <iomanip>
-#include <limits>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
-ascii_dump(std::ostream& s, const T& t) {
-  if (std::numeric_limits<T>::is_exact)
-    // An exact data type: pretty printer is accurate.
-    s << t;
-  else {
-    // An inexact data type (probably floating point):
-    // first dump its hexadecimal representation ...
-    const std::ios::fmtflags old_flags = s.setf(std::ios::hex,
-                                                std::ios::basefield);
-    const unsigned char* p = reinterpret_cast<const unsigned char*>(&t);
-    for (unsigned i = 0; i < sizeof(T); ++i) {
-      s << std::setw(2) << std::setfill('0') << static_cast<unsigned>(p[i]);
-    }
-    s.flags(old_flags);
-    // ... and then pretty print it for readability.
-    s << " (" << t << ")";
-  }
-}
-
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-ascii_load(std::istream& s, T& t) {
-  if (std::numeric_limits<T>::is_exact) {
-    // An exact data type: input from pretty printed version is accurate.
-    s >> t;
-    return !s.fail();
-  }
-  else {
-    // An inexact data type (probably floating point):
-    // first load its hexadecimal representation ...
-    std::string str;
-    if (!(s >> str) || str.size() != 2*sizeof(T))
-      return false;
-    unsigned char* p = reinterpret_cast<unsigned char*>(&t);
-    // CHECKME: any (portable) simpler way?
-    for (unsigned i = 0; i < sizeof(T); ++i) {
-      unsigned byte_value = 0;
-      for (unsigned j = 0; j < 2; ++j) {
-        byte_value <<= 4;
-        unsigned half_byte_value;
-        // Interpret single hex character.
-        switch (str[2*i + j]) {
-        case '0':
-          half_byte_value = 0;
-          break;
-        case '1':
-          half_byte_value = 1;
-          break;
-        case '2':
-          half_byte_value = 2;
-          break;
-        case '3':
-          half_byte_value = 3;
-          break;
-        case '4':
-          half_byte_value = 4;
-          break;
-        case '5':
-          half_byte_value = 5;
-          break;
-        case '6':
-          half_byte_value = 6;
-          break;
-        case '7':
-          half_byte_value = 7;
-          break;
-        case '8':
-          half_byte_value = 8;
-          break;
-        case '9':
-          half_byte_value = 9;
-          break;
-        case 'A':
-        case 'a':
-          half_byte_value = 10;
-          break;
-        case 'B':
-        case 'b':
-          half_byte_value = 11;
-          break;
-        case 'C':
-        case 'c':
-          half_byte_value = 12;
-          break;
-        case 'D':
-        case 'd':
-          half_byte_value = 13;
-          break;
-        case 'E':
-        case 'e':
-          half_byte_value = 14;
-          break;
-        case 'F':
-        case 'f':
-          half_byte_value = 15;
-          break;
-        default:
-          return false;
-        }
-        byte_value += half_byte_value;
-      }
-      PPL_ASSERT(byte_value <= 255);
-      p[i] = static_cast<unsigned char>(byte_value);
-    }
-    // ... then read and discard pretty printed value.
-    if (!(s >> str))
-      return false;
-    const std::string::size_type sz = str.size();
-    return sz > 2 && str[0] == '(' && str[sz-1] == ')';
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Checked_Number_templates_hh)
diff --git a/src/Checked_Number.types.hh b/src/Checked_Number.types.hh
deleted file mode 100644
index b8db511..0000000
--- a/src/Checked_Number.types.hh
+++ /dev/null
@@ -1,27 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Checked_Number_types_hh
-#define PPL_Checked_Number_types_hh 1
-
-#include "Coefficient_traits_template.hh"
-
-namespace Parma_Polyhedra_Library {
-
-struct Extended_Number_Policy;
-
-template <typename T, typename Policy>
-class Checked_Number;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Checked_Number_types_hh)
diff --git a/src/Checked_Number_defs.hh b/src/Checked_Number_defs.hh
new file mode 100644
index 0000000..1ee1f6d
--- /dev/null
+++ b/src/Checked_Number_defs.hh
@@ -0,0 +1,1068 @@
+/* Checked_Number class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Checked_Number_defs_hh
+#define PPL_Checked_Number_defs_hh 1
+
+#include "Checked_Number_types.hh"
+#include "checked_defs.hh"
+#include "meta_programming.hh"
+#include "Slow_Copy.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct Extended_Number_Policy {
+  const_bool_nodef(check_overflow, true);
+  const_bool_nodef(check_inf_add_inf, false);
+  const_bool_nodef(check_inf_sub_inf, false);
+  const_bool_nodef(check_inf_mul_zero, false);
+  const_bool_nodef(check_div_zero, false);
+  const_bool_nodef(check_inf_div_inf, false);
+  const_bool_nodef(check_inf_mod, false);
+  const_bool_nodef(check_sqrt_neg, false);
+  const_bool_nodef(has_nan, true);
+  const_bool_nodef(has_infinity, true);
+
+  // `convertible' is intentionally not defined: the compile time
+  // error on conversions is the expected behavior.
+
+  const_bool_nodef(fpu_check_inexact, true);
+  const_bool_nodef(fpu_check_nan_result, true);
+
+  // ROUND_DEFAULT_CONSTRUCTOR is intentionally not defined.
+  // ROUND_DEFAULT_OPERATOR is intentionally not defined.
+  // ROUND_DEFAULT_FUNCTION is intentionally not defined.
+  // ROUND_DEFAULT_INPUT is intentionally not defined.
+  // ROUND_DEFAULT_OUTPUT is intentionally not defined.
+
+  static void handle_result(Result r);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A policy checking for overflows.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+struct Check_Overflow_Policy {
+  const_bool_nodef(check_overflow, true);
+  const_bool_nodef(check_inf_add_inf, false);
+  const_bool_nodef(check_inf_sub_inf, false);
+  const_bool_nodef(check_inf_mul_zero, false);
+  const_bool_nodef(check_div_zero, false);
+  const_bool_nodef(check_inf_div_inf, false);
+  const_bool_nodef(check_inf_mod, false);
+  const_bool_nodef(check_sqrt_neg, false);
+  const_bool_nodef(has_nan, std::numeric_limits<T>::has_quiet_NaN);
+  const_bool_nodef(has_infinity, std::numeric_limits<T>::has_infinity);
+  const_bool_nodef(convertible, true);
+  const_bool_nodef(fpu_check_inexact, true);
+  const_bool_nodef(fpu_check_nan_result, true);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename Enable = void>
+struct Native_Checked_From_Wrapper;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+struct Native_Checked_From_Wrapper<T, typename Enable_If<Is_Native<T>::value>::type> {
+  typedef Checked_Number_Transparent_Policy<T> Policy;
+  static const T& raw_value(const T& v) {
+    return v;
+  }
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename P>
+struct Native_Checked_From_Wrapper<Checked_Number<T, P> > {
+  typedef P Policy;
+  static const T& raw_value(const Checked_Number<T, P>& v) {
+    return v.raw_value();
+  }
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename Enable = void>
+struct Native_Checked_To_Wrapper;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+struct Native_Checked_To_Wrapper<T, typename Enable_If<Is_Native<T>::value>::type> {
+  typedef Check_Overflow_Policy<T> Policy;
+  static T& raw_value(T& v) {
+    return v;
+  }
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename P>
+struct Native_Checked_To_Wrapper<Checked_Number<T, P> > {
+  typedef P Policy;
+  static T& raw_value(Checked_Number<T, P>& v) {
+    return v.raw_value();
+  }
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+struct Is_Checked : public False { };
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename P>
+struct Is_Checked<Checked_Number<T, P> > : public True { };
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+struct Is_Native_Or_Checked
+  : public Bool<Is_Native<T>::value || Is_Checked<T>::value> { };
+
+//! A wrapper for numeric types implementing a given policy.
+/*! \ingroup PPL_CXX_interface
+  The wrapper and related functions implement an interface which is common
+  to all kinds of coefficient types, therefore allowing for a uniform
+  coding style. This class also implements the policy encoded by the
+  second template parameter. The default policy is to perform the detection
+  of overflow errors.
+*/
+template <typename T, typename Policy>
+class Checked_Number {
+public:
+
+  //! \name Constructors
+  //@{
+
+  //! Default constructor.
+  Checked_Number();
+
+  //! Copy constructor.
+  Checked_Number(const Checked_Number& y);
+
+  //! Direct initialization from a Checked_Number and rounding mode.
+  template <typename From, typename From_Policy>
+  Checked_Number(const Checked_Number<From, From_Policy>& y, Rounding_Dir dir);
+
+  //! Direct initialization from a plain char and rounding mode.
+  Checked_Number(char y, Rounding_Dir dir);
+
+  //! Direct initialization from a signed char and rounding mode.
+  Checked_Number(signed char y, Rounding_Dir dir);
+
+  //! Direct initialization from a signed short and rounding mode.
+  Checked_Number(signed short y, Rounding_Dir dir);
+
+  //! Direct initialization from a signed int and rounding mode.
+  Checked_Number(signed int y, Rounding_Dir dir);
+
+  //! Direct initialization from a signed long and rounding mode.
+  Checked_Number(signed long y, Rounding_Dir dir);
+
+  //! Direct initialization from a signed long long and rounding mode.
+  Checked_Number(signed long long y, Rounding_Dir dir);
+
+  //! Direct initialization from an unsigned char and rounding mode.
+  Checked_Number(unsigned char y, Rounding_Dir dir);
+
+  //! Direct initialization from an unsigned short and rounding mode.
+  Checked_Number(unsigned short y, Rounding_Dir dir);
+
+  //! Direct initialization from an unsigned int and rounding mode.
+  Checked_Number(unsigned int y, Rounding_Dir dir);
+
+  //! Direct initialization from an unsigned long and rounding mode.
+  Checked_Number(unsigned long y, Rounding_Dir dir);
+
+  //! Direct initialization from an unsigned long long and rounding mode.
+  Checked_Number(unsigned long long y, Rounding_Dir dir);
+
+#if PPL_SUPPORTED_FLOAT
+  //! Direct initialization from a float and rounding mode.
+  Checked_Number(float y, Rounding_Dir dir);
+#endif
+
+#if PPL_SUPPORTED_DOUBLE
+  //! Direct initialization from a double and rounding mode.
+  Checked_Number(double y, Rounding_Dir dir);
+#endif
+
+#if PPL_SUPPORTED_LONG_DOUBLE
+  //! Direct initialization from a long double and rounding mode.
+  Checked_Number(long double y, Rounding_Dir dir);
+#endif
+
+  //! Direct initialization from a rational and rounding mode.
+  Checked_Number(const mpq_class& y, Rounding_Dir dir);
+
+  //! Direct initialization from an unbounded integer and rounding mode.
+  Checked_Number(const mpz_class& y, Rounding_Dir dir);
+
+  //! Direct initialization from a C string and rounding mode.
+  Checked_Number(const char* y, Rounding_Dir dir);
+
+  //! Direct initialization from special and rounding mode.
+  template <typename From>
+  Checked_Number(const From&, Rounding_Dir dir, typename Enable_If<Is_Special<From>::value, bool>::type ignored = false);
+
+  //! Direct initialization from a Checked_Number, default rounding mode.
+  template <typename From, typename From_Policy>
+  explicit Checked_Number(const Checked_Number<From, From_Policy>& y);
+
+  //! Direct initialization from a plain char, default rounding mode.
+  Checked_Number(char y);
+
+  //! Direct initialization from a signed char, default rounding mode.
+  Checked_Number(signed char y);
+
+  //! Direct initialization from a signed short, default rounding mode.
+  Checked_Number(signed short y);
+
+  //! Direct initialization from a signed int, default rounding mode.
+  Checked_Number(signed int y);
+
+  //! Direct initialization from a signed long, default rounding mode.
+  Checked_Number(signed long y);
+
+  //! Direct initialization from a signed long long, default rounding mode.
+  Checked_Number(signed long long y);
+
+  //! Direct initialization from an unsigned char, default rounding mode.
+  Checked_Number(unsigned char y);
+
+  //! Direct initialization from an unsigned short, default rounding mode.
+  Checked_Number(unsigned short y);
+
+  //! Direct initialization from an unsigned int, default rounding mode.
+  Checked_Number(unsigned int y);
+
+  //! Direct initialization from an unsigned long, default rounding mode.
+  Checked_Number(unsigned long y);
+
+  //! Direct initialization from an unsigned long long, default rounding mode.
+  Checked_Number(unsigned long long y);
+
+  //! Direct initialization from a float, default rounding mode.
+  Checked_Number(float y);
+
+  //! Direct initialization from a double, default rounding mode.
+  Checked_Number(double y);
+
+  //! Direct initialization from a long double, default rounding mode.
+  Checked_Number(long double y);
+
+  //! Direct initialization from a rational, default rounding mode.
+  Checked_Number(const mpq_class& y);
+
+  //! Direct initialization from an unbounded integer, default rounding mode.
+  Checked_Number(const mpz_class& y);
+
+  //! Direct initialization from a C string, default rounding mode.
+  Checked_Number(const char* y);
+
+  //! Direct initialization from special, default rounding mode
+  template <typename From>
+  Checked_Number(const From&, typename Enable_If<Is_Special<From>::value, bool>::type ignored = false);
+
+
+  //@} // Constructors
+
+  //! \name Accessors and Conversions
+  //@{
+
+  //! Conversion operator: returns a copy of the underlying numeric value.
+  operator T() const;
+
+  //! Returns a reference to the underlying numeric value.
+  T& raw_value();
+
+  //! Returns a const reference to the underlying numeric value.
+  const T& raw_value() const;
+
+  //@} // Accessors and Conversions
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //! Classifies *this.
+  /*!
+    Returns the appropriate Result characterizing:
+    - whether \p *this is NaN,
+      if \p nan is <CODE>true</CODE>;
+    - whether \p *this is a (positive or negative) infinity,
+      if \p inf is <CODE>true</CODE>;
+    - the sign of \p *this,
+      if \p sign is <CODE>true</CODE>.
+  */
+  Result classify(bool nan = true, bool inf = true, bool sign = true) const;
+
+  //! \name Assignment Operators
+  //@{
+
+  //! Assignment operator.
+  Checked_Number& operator=(const Checked_Number& y);
+
+  //! Assignment operator.
+  template <typename From>
+  Checked_Number& operator=(const From& y);
+
+  //! Add and assign operator.
+  template <typename From_Policy>
+  Checked_Number& operator+=(const Checked_Number<T, From_Policy>& y);
+
+  //! Add and assign operator.
+  Checked_Number& operator+=(const T& y);
+
+  //! Add and assign operator.
+  template <typename From>
+  typename Enable_If<Is_Native_Or_Checked<From>::value,
+                     Checked_Number<T, Policy>&>::type
+  operator+=(const From& y);
+
+  //! Subtract and assign operator.
+  template <typename From_Policy>
+  Checked_Number& operator-=(const Checked_Number<T, From_Policy>& y);
+
+  //! Subtract and assign operator.
+  Checked_Number& operator-=(const T& y);
+
+  //! Subtract and assign operator.
+  template <typename From>
+  typename Enable_If<Is_Native_Or_Checked<From>::value,
+                     Checked_Number<T, Policy>&>::type
+  operator-=(const From& y);
+
+  //! Multiply and assign operator.
+  template <typename From_Policy>
+  Checked_Number& operator*=(const Checked_Number<T, From_Policy>& y);
+
+  //! Multiply and assign operator.
+  Checked_Number& operator*=(const T& y);
+
+  //! Multiply and assign operator.
+  template <typename From>
+  typename Enable_If<Is_Native_Or_Checked<From>::value,
+                     Checked_Number<T, Policy>&>::type
+  operator*=(const From& y);
+
+  //! Divide and assign operator.
+  template <typename From_Policy>
+  Checked_Number& operator/=(const Checked_Number<T, From_Policy>& y);
+
+  //! Divide and assign operator.
+  Checked_Number& operator/=(const T& y);
+
+  //! Divide and assign operator.
+  template <typename From>
+  typename Enable_If<Is_Native_Or_Checked<From>::value,
+                     Checked_Number<T, Policy>&>::type
+  operator/=(const From& y);
+
+  //! Compute remainder and assign operator.
+  template <typename From_Policy>
+  Checked_Number& operator%=(const Checked_Number<T, From_Policy>& y);
+
+  //! Compute remainder and assign operator.
+  Checked_Number& operator%=(const T& y);
+
+  //! Compute remainder and assign operator.
+  template <typename From>
+  typename Enable_If<Is_Native_Or_Checked<From>::value,
+                     Checked_Number<T, Policy>& >::type
+  operator%=(const From& y);
+
+  //@} // Assignment Operators
+
+
+  //! \name Increment and Decrement Operators
+  //@{
+
+  //! Pre-increment operator.
+  Checked_Number& operator++();
+
+  //! Post-increment operator.
+  Checked_Number  operator++(int);
+
+  //! Pre-decrement operator.
+  Checked_Number& operator--();
+
+  //! Post-decrement operator.
+  Checked_Number  operator--(int);
+
+  //@} // Increment and Decrement Operators
+
+private:
+  //! The underlying numeric value.
+  T v;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename P>
+struct Slow_Copy<Checked_Number<T, P> > : public Bool<Slow_Copy<T>::value> {};
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_not_a_number(const T& x);
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_minus_infinity(const T& x);
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_plus_infinity(const T& x);
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, int>::type
+infinity_sign(const T& x);
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_integer(const T& x);
+
+/*! \relates Checked_Number */
+template <typename To, typename From>
+typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
+construct(To& to, const From& x, Rounding_Dir dir);
+
+/*! \relates Checked_Number */
+template <typename To, typename From>
+typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
+assign_r(To& to, const From& x, Rounding_Dir dir);
+
+/*! \relates Checked_Number */
+template <typename To>
+typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
+assign_r(To& to, const char* x, Rounding_Dir dir);
+
+/*! \relates Checked_Number */
+template <typename To, typename To_Policy>
+typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
+assign_r(To& to, char* x, Rounding_Dir dir);
+
+#define PPL_DECLARE_FUNC1_A(name) \
+template <typename To, typename From> \
+typename Enable_If<Is_Native_Or_Checked<To>::value \
+                   && Is_Native_Or_Checked<From>::value, \
+                   Result>::type \
+ PPL_U(name)(To& to, const From& x, Rounding_Dir dir);
+
+PPL_DECLARE_FUNC1_A(assign_r)
+PPL_DECLARE_FUNC1_A(floor_assign_r)
+PPL_DECLARE_FUNC1_A(ceil_assign_r)
+PPL_DECLARE_FUNC1_A(trunc_assign_r)
+PPL_DECLARE_FUNC1_A(neg_assign_r)
+PPL_DECLARE_FUNC1_A(abs_assign_r)
+PPL_DECLARE_FUNC1_A(sqrt_assign_r)
+
+#undef PPL_DECLARE_FUNC1_A
+
+#define PPL_DECLARE_FUNC1_B(name) \
+template <typename To, typename From> \
+typename Enable_If<Is_Native_Or_Checked<To>::value \
+                   && Is_Native_Or_Checked<From>::value, \
+                   Result>::type \
+ PPL_U(name)(To& to, const From& x, unsigned int exp, Rounding_Dir dir);
+
+PPL_DECLARE_FUNC1_B(add_2exp_assign_r)
+PPL_DECLARE_FUNC1_B(sub_2exp_assign_r)
+PPL_DECLARE_FUNC1_B(mul_2exp_assign_r)
+PPL_DECLARE_FUNC1_B(div_2exp_assign_r)
+PPL_DECLARE_FUNC1_B(smod_2exp_assign_r)
+PPL_DECLARE_FUNC1_B(umod_2exp_assign_r)
+
+#undef PPL_DECLARE_FUNC1_B
+
+#define PPL_DECLARE_FUNC2(name) \
+template <typename To, typename From1, typename From2> \
+typename Enable_If<Is_Native_Or_Checked<To>::value \
+                   && Is_Native_Or_Checked<From1>::value \
+                   && Is_Native_Or_Checked<From2>::value, \
+                   Result>::type \
+ PPL_U(name)(To& to, const From1& x, const From2& y, Rounding_Dir dir);
+
+PPL_DECLARE_FUNC2(add_assign_r)
+PPL_DECLARE_FUNC2(sub_assign_r)
+PPL_DECLARE_FUNC2(mul_assign_r)
+PPL_DECLARE_FUNC2(div_assign_r)
+PPL_DECLARE_FUNC2(idiv_assign_r)
+PPL_DECLARE_FUNC2(rem_assign_r)
+PPL_DECLARE_FUNC2(gcd_assign_r)
+PPL_DECLARE_FUNC2(lcm_assign_r)
+PPL_DECLARE_FUNC2(add_mul_assign_r)
+PPL_DECLARE_FUNC2(sub_mul_assign_r)
+
+#undef PPL_DECLARE_FUNC2
+
+#define PPL_DECLARE_FUNC4(name) \
+template <typename To1, typename To2, typename To3, \
+          typename From1, typename From2> \
+typename Enable_If<Is_Native_Or_Checked<To1>::value \
+                   && Is_Native_Or_Checked<To2>::value \
+                   && Is_Native_Or_Checked<To3>::value \
+                   && Is_Native_Or_Checked<From1>::value \
+                   && Is_Native_Or_Checked<From2>::value, \
+                   Result>::type \
+ PPL_U(name)(To1& to, To2& s, To3& t,     \
+     const From1& x, const From2& y, \
+     Rounding_Dir dir);
+
+PPL_DECLARE_FUNC4(gcdext_assign_r)
+
+#undef PPL_DECLARE_FUNC4
+
+//! \name Accessor Functions
+//@{
+
+//@} // Accessor Functions
+
+//! \name Memory Size Inspection Functions
+//@{
+
+//! Returns the total size in bytes of the memory occupied by \p x.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+memory_size_type
+total_memory_in_bytes(const Checked_Number<T, Policy>& x);
+
+//! Returns the size in bytes of the memory managed by \p x.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+memory_size_type
+external_memory_in_bytes(const Checked_Number<T, Policy>& x);
+
+//@} // Memory Size Inspection Functions
+
+//! \name Arithmetic Operators
+//@{
+
+//! Unary plus operator.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+Checked_Number<T, Policy>
+operator+(const Checked_Number<T, Policy>& x);
+
+//! Unary minus operator.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+Checked_Number<T, Policy>
+operator-(const Checked_Number<T, Policy>& x);
+
+//! Assigns to \p x largest integral value not greater than \p x.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+floor_assign(Checked_Number<T, Policy>& x);
+
+//! Assigns to \p x largest integral value not greater than \p y.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+floor_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
+
+//! Assigns to \p x smallest integral value not less than \p x.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+ceil_assign(Checked_Number<T, Policy>& x);
+
+//! Assigns to \p x smallest integral value not less than \p y.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+ceil_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
+
+//! Round \p x to the nearest integer not larger in absolute value.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+trunc_assign(Checked_Number<T, Policy>& x);
+
+//! Assigns to \p x the value of \p y rounded to the nearest integer not larger in absolute value.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+trunc_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
+
+//! Assigns to \p x its negation.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+neg_assign(Checked_Number<T, Policy>& x);
+
+//! Assigns to \p x the negation of \p y.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+neg_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
+
+//! Assigns to \p x its absolute value.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+abs_assign(Checked_Number<T, Policy>& x);
+
+//! Assigns to \p x the absolute value of \p y.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+abs_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
+
+//! Assigns to \p x the value <CODE>x + y * z</CODE>.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+add_mul_assign(Checked_Number<T, Policy>& x,
+               const Checked_Number<T, Policy>& y,
+               const Checked_Number<T, Policy>& z);
+
+//! Assigns to \p x the value <CODE>x - y * z</CODE>.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+sub_mul_assign(Checked_Number<T, Policy>& x,
+               const Checked_Number<T, Policy>& y,
+               const Checked_Number<T, Policy>& z);
+
+//! Assigns to \p x the greatest common divisor of \p y and \p z.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+gcd_assign(Checked_Number<T, Policy>& x,
+           const Checked_Number<T, Policy>& y,
+           const Checked_Number<T, Policy>& z);
+
+/*! \brief
+  Assigns to \p x the greatest common divisor of \p y and \p z,
+  setting \p s and \p t such that s*y + t*z = x = gcd(y, z).
+*/
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+gcdext_assign(Checked_Number<T, Policy>& x,
+              Checked_Number<T, Policy>& s,
+              Checked_Number<T, Policy>& t,
+              const Checked_Number<T, Policy>& y,
+              const Checked_Number<T, Policy>& z);
+
+//! Assigns to \p x the least common multiple of \p y and \p z.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+lcm_assign(Checked_Number<T, Policy>& x,
+           const Checked_Number<T, Policy>& y,
+           const Checked_Number<T, Policy>& z);
+
+//! Assigns to \p x the value \f$ y \cdot 2^\mathtt{exp} \f$.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+mul_2exp_assign(Checked_Number<T, Policy>& x,
+                const Checked_Number<T, Policy>& y,
+                unsigned int exp);
+
+//! Assigns to \p x the value \f$ y / 2^\mathtt{exp} \f$.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void
+div_2exp_assign(Checked_Number<T, Policy>& x,
+                const Checked_Number<T, Policy>& y,
+                unsigned int exp);
+
+/*! \brief
+  If \p z divides \p y, assigns to \p x the quotient of the integer
+  division of \p y and \p z.
+
+  \relates Checked_Number
+  The behavior is undefined if \p z does not divide \p y.
+*/
+template <typename T, typename Policy>
+void
+exact_div_assign(Checked_Number<T, Policy>& x,
+                 const Checked_Number<T, Policy>& y,
+                 const Checked_Number<T, Policy>& z);
+
+//! Assigns to \p x the integer square root of \p y.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void sqrt_assign(Checked_Number<T, Policy>& x,
+                 const Checked_Number<T, Policy>& y);
+
+//@} // Arithmetic Operators
+
+
+//! \name Relational Operators and Comparison Functions
+//@{
+
+//! Equality operator.
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline
+typename Enable_If<Is_Native_Or_Checked<T1>::value
+                   && Is_Native_Or_Checked<T2>::value
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
+                   bool>::type
+operator==(const T1& x, const T2& y);
+
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
+equal(const T1& x, const T2& y);
+
+//! Disequality operator.
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline
+typename Enable_If<Is_Native_Or_Checked<T1>::value
+                   && Is_Native_Or_Checked<T2>::value
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
+                   bool>::type
+operator!=(const T1& x, const T2& y);
+
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
+not_equal(const T1& x, const T2& y);
+
+//! Greater than or equal to operator.
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline
+typename Enable_If<Is_Native_Or_Checked<T1>::value
+                   && Is_Native_Or_Checked<T2>::value
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
+                   bool>::type
+operator>=(const T1& x, const T2& y);
+
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
+greater_or_equal(const T1& x, const T2& y);
+
+//! Greater than operator.
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline
+typename Enable_If<Is_Native_Or_Checked<T1>::value
+                   && Is_Native_Or_Checked<T2>::value
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
+                   bool>::type
+operator>(const T1& x, const T2& y);
+
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
+greater_than(const T1& x, const T2& y);
+
+//! Less than or equal to operator.
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline
+typename Enable_If<Is_Native_Or_Checked<T1>::value
+                   && Is_Native_Or_Checked<T2>::value
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
+                   bool>::type
+operator<=(const T1& x, const T2& y);
+
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
+less_or_equal(const T1& x, const T2& y);
+
+//! Less than operator.
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline
+typename Enable_If<Is_Native_Or_Checked<T1>::value
+                   && Is_Native_Or_Checked<T2>::value
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),
+                   bool>::type
+operator<(const T1& x, const T2& y);
+
+/*! \relates Checked_Number */
+template <typename T1, typename T2>
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
+less_than(const T1& x, const T2& y);
+
+/*! \brief
+  Returns \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether the value
+  of \p x is negative, zero or positive, respectively.
+
+  \relates Checked_Number
+*/
+template <typename From>
+inline typename Enable_If<Is_Native_Or_Checked<From>::value, int>::type \
+sgn(const From& x);
+
+/*! \brief
+  Returns a negative, zero or positive value depending on whether
+  \p x is lower than, equal to or greater than \p y, respectively.
+
+  \relates Checked_Number
+*/
+template <typename From1, typename From2>
+inline typename Enable_If<Is_Native_Or_Checked<From1>::value
+                          && Is_Native_Or_Checked<From2>::value,
+                          int>::type
+cmp(const From1& x, const From2& y);
+
+//@} // Relational Operators and Comparison Functions
+
+//! \name Input-Output Operators
+//@{
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
+output(std::ostream& os,
+       const T& x,
+       const Numeric_Format& format,
+       Rounding_Dir dir);
+
+//! Output operator.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+std::ostream&
+operator<<(std::ostream& os, const Checked_Number<T, Policy>& x);
+
+//! Ascii dump for native or checked.
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
+ascii_dump(std::ostream& s, const T& t);
+
+//! Input function.
+/*!
+  \relates Checked_Number
+
+  \param is
+  Input stream to read from;
+
+  \param x
+  Number (possibly extended) to assign to in case of successful reading;
+
+  \param dir
+  Rounding mode to be applied.
+
+  \return
+  Result of the input operation.  Success, success with imprecision,
+  overflow, parsing error: all possibilities are taken into account,
+  checked for, and properly reported.
+
+  This function attempts reading a (possibly extended) number from the given
+  stream \p is, possibly rounding as specified by \p dir, assigning the result
+  to \p x upon success, and returning the appropriate Result.
+
+  The input syntax allows the specification of:
+  - plain base-10 integer numbers as <CODE>34976098</CODE>,
+    <CODE>-77</CODE> and <CODE>+13</CODE>;
+  - base-10 integer numbers in scientific notation as <CODE>15e2</CODE>
+    and <CODE>15*^2</CODE> (both meaning \f$15 \cdot 10^2 = 1500\f$),
+    <CODE>9200e-2</CODE> and <CODE>-18*^+11111111111111111</CODE>;
+  - base-10 rational numbers in fraction notation as
+    <CODE>15/3</CODE> and <CODE>15/-3</CODE>;
+  - base-10 rational numbers in fraction/scientific notation as
+    <CODE>15/30e-1</CODE> (meaning \f$5\f$) and <CODE>15*^-3/29e2</CODE>
+    (meaning \f$3/580000\f$);
+  - base-10 rational numbers in floating point notation as
+    <CODE>71.3</CODE> (meaning \f$713/10\f$) and
+    <CODE>-0.123456</CODE> (meaning \f$-1929/15625\f$);
+  - base-10 rational numbers in floating point scientific notation as
+    <CODE>2.2e-1</CODE> (meaning \f$11/50\f$) and <CODE>-2.20001*^+3</CODE>
+    (meaning \f$-220001/100\f$);
+  - integers and rationals (in fractional, floating point and scientific
+    notations) specified by using Mathematica-style bases, in the range
+    from 2 to 36, as
+    <CODE>2^^11</CODE> (meaning \f$3\f$),
+    <CODE>36^^z</CODE> (meaning \f$35\f$),
+    <CODE>36^^xyz</CODE> (meaning \f$44027\f$),
+    <CODE>2^^11.1</CODE> (meaning \f$7/2\f$),
+    <CODE>10^^2e3</CODE> (meaning \f$2000\f$),
+    <CODE>8^^2e3</CODE> (meaning \f$1024\f$),
+    <CODE>8^^2.1e3</CODE> (meaning \f$1088\f$),
+    <CODE>8^^20402543.120347e7</CODE> (meaning \f$9073863231288\f$),
+    <CODE>8^^2.1</CODE> (meaning \f$17/8\f$);
+    note that the base and the exponent are always written as plain
+    base-10 integer numbers; also, when an ambiguity may arise, the
+    character <CODE>e</CODE> is interpreted as a digit, so that
+    <CODE>16^^1e2</CODE> (meaning \f$482\f$) is different from
+    <CODE>16^^1*^2</CODE> (meaning \f$256\f$);
+  - the C-style hexadecimal prefix <CODE>0x</CODE> is interpreted as
+    the Mathematica-style prefix <CODE>16^^</CODE>;
+  - the C-style binary exponent indicator <CODE>p</CODE> can only be used
+    when base 16 has been specified; if used, the exponent will be
+    applied to base 2 (instead of base 16, as is the case when the
+    indicator <CODE>e</CODE> is used);
+  - special values like <CODE>inf</CODE> and <CODE>+inf</CODE>
+    (meaning \f$+\infty\f$), <CODE>-inf</CODE> (meaning \f$-\infty\f$),
+    and <CODE>nan</CODE> (meaning "not a number").
+
+  The rationale behind the accepted syntax can be summarized as follows:
+  - if the syntax is accepted by Mathematica, then this function
+    accepts it with the same semantics;
+  - if the syntax is acceptable as standard C++ integer or floating point
+    literal (except for octal notation and type suffixes, which are not
+    supported), then this function accepts it with the same semantics;
+  - natural extensions of the above are accepted with the natural
+    extensions of the semantics;
+  - special values are accepted.
+
+  Valid syntax is more formally and completely specified by the
+  following grammar, with the additional provisos that everything is
+  <EM>case insensitive</EM>, that the syntactic category
+  <CODE>BDIGIT</CODE> is further restricted by the current base
+  and that for all bases above 14, any <CODE>e</CODE> is always
+  interpreted as a digit and never as a delimiter for the exponent part
+  (if such a delimiter is desired, it has to be written as <CODE>*^</CODE>).
+
+\code
+number  : NAN                                   INF     : 'inf'
+        | SIGN INF                                      ;
+        | INF
+        | num                                   NAN     : 'nan'
+        | num DIV num                                   ;
+        ;
+                                                SIGN    : '-'
+num     : u_num                                         | '+'
+        | SIGN u_num                                    ;
+
+u_num   : u_num1                                EXP     : 'e'
+        | HEX u_num1                                    | 'p'
+        | base BASE u_num1                              | '*^'
+        ;                                               ;
+                                                POINT   : '.'
+u_num1  : mantissa                                      ;
+        | mantissa EXP exponent
+        ;                                       DIV     : '/'
+                                                        ;
+mantissa: bdigits
+        | POINT bdigits                         MINUS   : '-'
+        | bdigits POINT                                 ;
+        | bdigits POINT bdigits
+        ;                                       PLUS    : '+'
+                                                ;
+exponent: SIGN digits
+        | digits                                HEX     : '0x'
+        ;                                       ;
+
+bdigits : BDIGIT                                BASE    : '^^'
+        | bdigits BDIGIT                                ;
+        ;
+                                                DIGIT   : '0' .. '9'
+digits  : DIGIT                                         ;
+        | digits DIGIT
+        ;                                       BDIGIT  : '0' .. '9'
+                                                        | 'a' .. 'z'
+                                                        ;
+\endcode
+*/
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
+input(T& x, std::istream& is, Rounding_Dir dir);
+
+//! Input operator.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+std::istream&
+operator>>(std::istream& is, Checked_Number<T, Policy>& x);
+
+//! Ascii load for native or checked.
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+ascii_load(std::ostream& s, T& t);
+
+//@} // Input-Output Operators
+
+void throw_result_exception(Result r);
+
+template <typename T>
+T
+plus_infinity();
+
+template <typename T>
+T
+minus_infinity();
+
+template <typename T>
+T
+not_a_number();
+
+//! Swaps \p x with \p y.
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+void swap(Checked_Number<T, Policy>& x, Checked_Number<T, Policy>& y);
+
+template <typename T, typename Policy>
+struct FPU_Related<Checked_Number<T, Policy> > : public FPU_Related<T> {};
+
+template <typename T>
+void maybe_reset_fpu_inexact();
+
+template <typename T>
+int maybe_check_fpu_inexact();
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Checked_Number_inlines.hh"
+#include "Checked_Number_templates.hh"
+
+#endif // !defined(PPL_Checked_Number_defs_hh)
diff --git a/src/Checked_Number_inlines.hh b/src/Checked_Number_inlines.hh
new file mode 100644
index 0000000..233ae28
--- /dev/null
+++ b/src/Checked_Number_inlines.hh
@@ -0,0 +1,848 @@
+/* Checked_Number class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Checked_Number_inlines_hh
+#define PPL_Checked_Number_inlines_hh 1
+
+#include "globals_defs.hh"
+#include <stdexcept>
+#include <sstream>
+
+namespace Parma_Polyhedra_Library {
+
+#ifndef NDEBUG
+#define DEBUG_ROUND_NOT_NEEDED
+#endif
+
+inline Rounding_Dir
+rounding_dir(Rounding_Dir dir) {
+  if (dir == ROUND_NOT_NEEDED) {
+#ifdef DEBUG_ROUND_NOT_NEEDED
+    return ROUND_CHECK;
+#endif
+  }
+  return dir;
+}
+
+inline Result
+check_result(Result r, Rounding_Dir dir) {
+  if (dir == ROUND_NOT_NEEDED) {
+#ifdef DEBUG_ROUND_NOT_NEEDED
+    PPL_ASSERT(result_relation(r) == VR_EQ);
+#endif
+    return r;
+  }
+  return r;
+}
+
+
+template <typename T>
+inline void
+Checked_Number_Transparent_Policy<T>::handle_result(Result) {
+}
+
+inline void
+Extended_Number_Policy::handle_result(Result r) {
+  if (result_class(r) == VC_NAN)
+    throw_result_exception(r);
+}
+
+template <typename T, typename Policy>
+inline
+Checked_Number<T, Policy>::Checked_Number()
+ : v(0) {
+}
+
+template <typename T, typename Policy>
+inline
+Checked_Number<T, Policy>::Checked_Number(const Checked_Number& y) {
+  // TODO: avoid default construction of value member.
+  Checked::copy<Policy, Policy>(v, y.raw_value());
+}
+
+template <typename T, typename Policy>
+template <typename From, typename From_Policy>
+inline
+Checked_Number<T, Policy>
+::Checked_Number(const Checked_Number<From, From_Policy>& y,
+                 Rounding_Dir dir) {
+  // TODO: avoid default construction of value member.
+  Policy::handle_result(check_result(Checked::assign_ext<Policy, From_Policy>
+                                     (v,
+                                      y.raw_value(),
+                                      rounding_dir(dir)),
+                                     dir)
+                        );
+}
+
+template <typename T, typename Policy>
+template <typename From, typename From_Policy>
+inline
+Checked_Number<T, Policy>
+::Checked_Number(const Checked_Number<From, From_Policy>& y) {
+  // TODO: avoid default construction of value member.
+  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
+  Policy::handle_result(check_result(Checked::assign_ext<Policy, From_Policy>
+                                     (v,
+                                      y.raw_value(),
+                                      rounding_dir(dir)),
+                                     dir));
+}
+
+// TODO: avoid default construction of value member.
+#define PPL_DEFINE_CTOR(type) \
+template <typename T, typename Policy> \
+inline \
+Checked_Number<T, Policy>::Checked_Number(const type y, Rounding_Dir dir) { \
+  Policy::handle_result                                                 \
+    (check_result(Checked::assign_ext<Policy,                           \
+                                      Checked_Number_Transparent_Policy<PPL_U(type)> > \
+                  (v, y, rounding_dir(dir)),                            \
+                  dir));                                                \
+}                                                                       \
+template <typename T, typename Policy>                                  \
+inline                                                                  \
+Checked_Number<T, Policy>::Checked_Number(const type y) {               \
+  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;                 \
+  Policy::handle_result                                                 \
+    (check_result(Checked::assign_ext<Policy,                           \
+                                      Checked_Number_Transparent_Policy<PPL_U(type)> > \
+                  (v, y, rounding_dir(dir)),                            \
+                  dir));                                                \
+}
+
+PPL_DEFINE_CTOR(char)
+PPL_DEFINE_CTOR(signed char)
+PPL_DEFINE_CTOR(signed short)
+PPL_DEFINE_CTOR(signed int)
+PPL_DEFINE_CTOR(signed long)
+PPL_DEFINE_CTOR(signed long long)
+PPL_DEFINE_CTOR(unsigned char)
+PPL_DEFINE_CTOR(unsigned short)
+PPL_DEFINE_CTOR(unsigned int)
+PPL_DEFINE_CTOR(unsigned long)
+PPL_DEFINE_CTOR(unsigned long long)
+#if PPL_SUPPORTED_FLOAT
+PPL_DEFINE_CTOR(float)
+#endif
+#if PPL_SUPPORTED_DOUBLE
+PPL_DEFINE_CTOR(double)
+#endif
+#if PPL_SUPPORTED_LONG_DOUBLE
+PPL_DEFINE_CTOR(long double)
+#endif
+PPL_DEFINE_CTOR(mpq_class&)
+PPL_DEFINE_CTOR(mpz_class&)
+
+#undef PPL_DEFINE_CTOR
+
+
+template <typename T, typename Policy>
+inline
+Checked_Number<T, Policy>::Checked_Number(const char* y, Rounding_Dir dir) {
+  std::istringstream s(y);
+  Policy::handle_result(check_result(Checked::input<Policy>(v,
+                                                            s,
+                                                            rounding_dir(dir)),
+                                     dir));
+}
+
+template <typename T, typename Policy>
+inline
+Checked_Number<T, Policy>::Checked_Number(const char* y) {
+  std::istringstream s(y);
+  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
+  Policy::handle_result(check_result(Checked::input<Policy>(v,
+                                                            s,
+                                                            rounding_dir(dir)),
+                                     dir));
+}
+
+template <typename T, typename Policy>
+template <typename From>
+inline
+Checked_Number<T, Policy>
+::Checked_Number(const From&,
+                 Rounding_Dir dir,
+                 typename Enable_If<Is_Special<From>::value, bool>::type) {
+  Policy::handle_result(check_result(Checked::assign_special<Policy>(v,
+                                                                     From::vclass,
+                                                                     rounding_dir(dir)),
+                                     dir));
+}
+
+template <typename T, typename Policy>
+template <typename From>
+inline
+Checked_Number<T, Policy>::Checked_Number(const From&, typename Enable_If<Is_Special<From>::value, bool>::type) {
+  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
+  Policy::handle_result(check_result(Checked::assign_special<Policy>(v,
+                                                            From::vclass,
+                                                            rounding_dir(dir)),
+                                     dir));
+}
+
+template <typename To, typename From>
+inline typename Enable_If<Is_Native_Or_Checked<To>::value
+                          && Is_Special<From>::value, Result>::type
+assign_r(To& to, const From&, Rounding_Dir dir) {
+  return check_result(Checked::assign_special<typename Native_Checked_To_Wrapper<To>
+                      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
+                                From::vclass,
+                                rounding_dir(dir)),
+                      dir);
+}
+
+template <typename To, typename From>
+inline typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
+construct(To& to, const From&, Rounding_Dir dir) {
+  return check_result(Checked::construct_special<typename Native_Checked_To_Wrapper<To>
+                      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
+                                From::vclass,
+                                rounding_dir(dir)),
+                      dir);
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_minus_infinity(const T& x) {
+  return Checked::is_minf<typename Native_Checked_From_Wrapper<T>
+    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_plus_infinity(const T& x) {
+  return Checked::is_pinf<typename Native_Checked_From_Wrapper<T>
+    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, int>::type
+infinity_sign(const T& x) {
+  return is_minus_infinity(x) ? -1 : (is_plus_infinity(x) ? 1 : 0);
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_not_a_number(const T& x) {
+  return Checked::is_nan<typename Native_Checked_From_Wrapper<T>
+    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_integer(const T& x) {
+  return Checked::is_int<typename Native_Checked_From_Wrapper<T>
+    ::Policy>(Native_Checked_From_Wrapper<T>::raw_value(x));
+}
+
+template <typename T, typename Policy>
+inline
+Checked_Number<T, Policy>::operator T() const {
+  if (Policy::convertible)
+    return v;
+}
+
+template <typename T, typename Policy>
+inline T&
+Checked_Number<T, Policy>::raw_value() {
+  return v;
+}
+
+template <typename T, typename Policy>
+inline const T&
+Checked_Number<T, Policy>::raw_value() const {
+  return v;
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline const T&
+raw_value(const Checked_Number<T, Policy>& x) {
+  return x.raw_value();
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline T&
+raw_value(Checked_Number<T, Policy>& x) {
+  return x.raw_value();
+}
+
+template <typename T, typename Policy>
+inline bool
+Checked_Number<T, Policy>::OK() const {
+  return true;
+}
+
+template <typename T, typename Policy>
+inline Result
+Checked_Number<T, Policy>::classify(bool nan, bool inf, bool sign) const {
+  return Checked::classify<Policy>(v, nan, inf, sign);
+}
+
+template <typename T, typename Policy>
+inline bool
+is_not_a_number(const Checked_Number<T, Policy>& x) {
+  return Checked::is_nan<Policy>(x.raw_value());
+}
+
+template <typename T, typename Policy>
+inline bool
+is_minus_infinity(const Checked_Number<T, Policy>& x) {
+  return Checked::is_minf<Policy>(x.raw_value());
+}
+
+template <typename T, typename Policy>
+inline bool
+is_plus_infinity(const Checked_Number<T, Policy>& x) {
+  return Checked::is_pinf<Policy>(x.raw_value());
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline memory_size_type
+total_memory_in_bytes(const Checked_Number<T, Policy>& x) {
+  return total_memory_in_bytes(x.raw_value());
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline memory_size_type
+external_memory_in_bytes(const Checked_Number<T, Policy>& x) {
+  return external_memory_in_bytes(x.raw_value());
+}
+
+
+/*! \relates Checked_Number */
+template <typename To>
+inline typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
+assign_r(To& to, const char* x, Rounding_Dir dir) {
+  std::istringstream s(x);
+  return check_result(Checked::input<typename Native_Checked_To_Wrapper<To>
+                      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
+                                s,
+                                rounding_dir(dir)),
+                      dir);
+}
+
+#define PPL_DEFINE_FUNC1_A(name, func) \
+template <typename To, typename From>                                   \
+inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
+                          && Is_Native_Or_Checked<From>::value,         \
+                          Result>::type                                 \
+ PPL_U(name)(To& to, const From& x, Rounding_Dir dir) {                 \
+  return                                                                \
+    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>   \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From>             \
+                 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
+                           Native_Checked_From_Wrapper<From>::raw_value(x), \
+                           rounding_dir(dir)), dir);                    \
+}
+
+PPL_DEFINE_FUNC1_A(construct, construct_ext)
+PPL_DEFINE_FUNC1_A(assign_r, assign_ext)
+PPL_DEFINE_FUNC1_A(floor_assign_r, floor_ext)
+PPL_DEFINE_FUNC1_A(ceil_assign_r, ceil_ext)
+PPL_DEFINE_FUNC1_A(trunc_assign_r, trunc_ext)
+PPL_DEFINE_FUNC1_A(neg_assign_r, neg_ext)
+PPL_DEFINE_FUNC1_A(abs_assign_r, abs_ext)
+PPL_DEFINE_FUNC1_A(sqrt_assign_r, sqrt_ext)
+
+#undef PPL_DEFINE_FUNC1_A
+
+#define PPL_DEFINE_FUNC1_B(name, func) \
+template <typename To, typename From>                                   \
+inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
+                          && Is_Native_Or_Checked<From>::value,         \
+                          Result>::type                                 \
+ PPL_U(name)(To& to, const From& x, unsigned int exp, Rounding_Dir dir) { \
+  return                                                                \
+    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>   \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From>             \
+                 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
+                           Native_Checked_From_Wrapper<From>::raw_value(x), \
+                           exp,                                         \
+                           rounding_dir(dir)),                          \
+                 dir);                                                  \
+}
+
+PPL_DEFINE_FUNC1_B(add_2exp_assign_r, add_2exp_ext)
+PPL_DEFINE_FUNC1_B(sub_2exp_assign_r, sub_2exp_ext)
+PPL_DEFINE_FUNC1_B(mul_2exp_assign_r, mul_2exp_ext)
+PPL_DEFINE_FUNC1_B(div_2exp_assign_r, div_2exp_ext)
+PPL_DEFINE_FUNC1_B(smod_2exp_assign_r, smod_2exp_ext)
+PPL_DEFINE_FUNC1_B(umod_2exp_assign_r, umod_2exp_ext)
+
+#undef PPL_DEFINE_FUNC1_B
+
+#define PPL_DEFINE_FUNC2(name, func) \
+template <typename To, typename From1, typename From2>                  \
+inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
+                          && Is_Native_Or_Checked<From1>::value         \
+                          && Is_Native_Or_Checked<From2>::value,        \
+                          Result>::type                                 \
+ PPL_U(name)(To& to, const From1& x, const From2& y, Rounding_Dir dir) { \
+  return                                                                \
+    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>   \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From1>            \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From2>            \
+                 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
+                           Native_Checked_From_Wrapper<From1>::raw_value(x), \
+                           Native_Checked_From_Wrapper<From2>::raw_value(y), \
+                           rounding_dir(dir)),                          \
+                 dir);                                                  \
+}
+
+PPL_DEFINE_FUNC2(add_assign_r, add_ext)
+PPL_DEFINE_FUNC2(sub_assign_r, sub_ext)
+PPL_DEFINE_FUNC2(mul_assign_r, mul_ext)
+PPL_DEFINE_FUNC2(div_assign_r, div_ext)
+PPL_DEFINE_FUNC2(idiv_assign_r, idiv_ext)
+PPL_DEFINE_FUNC2(rem_assign_r, rem_ext)
+PPL_DEFINE_FUNC2(gcd_assign_r, gcd_ext)
+PPL_DEFINE_FUNC2(lcm_assign_r, lcm_ext)
+PPL_DEFINE_FUNC2(add_mul_assign_r, add_mul_ext)
+PPL_DEFINE_FUNC2(sub_mul_assign_r, sub_mul_ext)
+
+#undef PPL_DEFINE_FUNC2
+
+#define PPL_DEFINE_FUNC4(name, func)                                    \
+template <typename To1,                                                 \
+          typename To2,                                                 \
+          typename To3,                                                 \
+          typename From1,                                               \
+          typename From2>                                               \
+inline typename Enable_If<Is_Native_Or_Checked<To1>::value              \
+                          && Is_Native_Or_Checked<To2>::value           \
+                          && Is_Native_Or_Checked<To3>::value           \
+                          && Is_Native_Or_Checked<From1>::value         \
+                          && Is_Native_Or_Checked<From2>::value,        \
+                          Result>::type                                 \
+ PPL_U(name)(To1& to, To2& s, To3& t, const From1& x, const From2& y,   \
+     Rounding_Dir dir) {                                                \
+  return                                                                \
+    check_result                                                        \
+    (Checked::func<typename Native_Checked_To_Wrapper<To1>::Policy,     \
+                   typename Native_Checked_To_Wrapper<To2>::Policy,     \
+                   typename Native_Checked_To_Wrapper<To3>::Policy,     \
+                   typename Native_Checked_From_Wrapper<From1>::Policy, \
+                   typename Native_Checked_From_Wrapper<From2>::Policy> \
+     (Native_Checked_To_Wrapper<To1>::raw_value(to),                    \
+      Native_Checked_To_Wrapper<To2>::raw_value(s),                     \
+      Native_Checked_To_Wrapper<To3>::raw_value(t),                     \
+      Native_Checked_From_Wrapper<From1>::raw_value(x),                 \
+      Native_Checked_From_Wrapper<From2>::raw_value(y),                 \
+      rounding_dir(dir)),                                               \
+     dir);                                                              \
+}
+
+PPL_DEFINE_FUNC4(gcdext_assign_r, gcdext_ext)
+
+#undef PPL_DEFINE_PPL_DEFINE_FUNC4
+
+#define PPL_DEFINE_INCREMENT(f, fun) \
+template <typename T, typename Policy> \
+inline Checked_Number<T, Policy>& \
+Checked_Number<T, Policy>::f() { \
+  Policy::handle_result((fun)(*this, *this, T(1),             \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
+  return *this; \
+} \
+template <typename T, typename Policy> \
+inline Checked_Number<T, Policy> \
+Checked_Number<T, Policy>::f(int) {\
+  T r = v;\
+  Policy::handle_result((fun)(*this, *this, T(1),             \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
+  return r;\
+}
+
+PPL_DEFINE_INCREMENT(operator ++, add_assign_r)
+PPL_DEFINE_INCREMENT(operator --, sub_assign_r)
+
+#undef PPL_DEFINE_INCREMENT
+
+template <typename T, typename Policy>
+inline Checked_Number<T, Policy>&
+Checked_Number<T, Policy>::operator=(const Checked_Number<T, Policy>& y) {
+  Checked::copy<Policy, Policy>(v, y.raw_value());
+  return *this;
+}
+template <typename T, typename Policy>
+template <typename From>
+inline Checked_Number<T, Policy>&
+Checked_Number<T, Policy>::operator=(const From& y) {
+  Policy::handle_result(assign_r(*this, y, Policy::ROUND_DEFAULT_OPERATOR));
+  return *this;
+}
+
+#define PPL_DEFINE_BINARY_OP_ASSIGN(f, fun) \
+template <typename T, typename Policy> \
+template <typename From_Policy> \
+inline Checked_Number<T, Policy>& \
+Checked_Number<T, Policy>::f(const Checked_Number<T, From_Policy>& y) { \
+  Policy::handle_result((fun)(*this, *this, y,                          \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
+  return *this; \
+} \
+template <typename T, typename Policy> \
+inline Checked_Number<T, Policy>& \
+Checked_Number<T, Policy>::f(const T& y) { \
+  Policy::handle_result((fun)(*this, *this, y,                \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
+  return *this; \
+} \
+template <typename T, typename Policy> \
+template <typename From> \
+inline typename Enable_If<Is_Native_Or_Checked<From>::value, \
+                          Checked_Number<T, Policy>& >::type \
+Checked_Number<T, Policy>::f(const From& y) { \
+  Checked_Number<T, Policy> cy(y); \
+  Policy::handle_result((fun)(*this, *this, cy,               \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
+  return *this; \
+}
+
+PPL_DEFINE_BINARY_OP_ASSIGN(operator +=, add_assign_r)
+PPL_DEFINE_BINARY_OP_ASSIGN(operator -=, sub_assign_r)
+PPL_DEFINE_BINARY_OP_ASSIGN(operator *=, mul_assign_r)
+PPL_DEFINE_BINARY_OP_ASSIGN(operator /=, div_assign_r)
+PPL_DEFINE_BINARY_OP_ASSIGN(operator %=, rem_assign_r)
+
+#undef PPL_DEFINE_BINARY_OP_ASSIGN
+
+#define PPL_DEFINE_BINARY_OP(f, fun) \
+template <typename T, typename Policy> \
+inline Checked_Number<T, Policy> \
+ PPL_U(f)(const Checked_Number<T, Policy>& x,   \
+         const Checked_Number<T, Policy>& y) {  \
+  Checked_Number<T, Policy> r; \
+  Policy::handle_result((fun)(r, x, y, Policy::ROUND_DEFAULT_OPERATOR)); \
+  return r; \
+} \
+template <typename Type, typename T, typename Policy>   \
+inline \
+typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
+ PPL_U(f)(const Type& x, const Checked_Number<T, Policy>& y) {          \
+  Checked_Number<T, Policy> r(x); \
+  Policy::handle_result((fun)(r, r, y, Policy::ROUND_DEFAULT_OPERATOR)); \
+  return r; \
+} \
+template <typename T, typename Policy, typename Type>   \
+inline \
+typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
+ PPL_U(f)(const Checked_Number<T, Policy>& x, const Type& y) {          \
+  Checked_Number<T, Policy> r(y); \
+  Policy::handle_result((fun)(r, x, r, Policy::ROUND_DEFAULT_OPERATOR)); \
+  return r; \
+}
+
+PPL_DEFINE_BINARY_OP(operator +, add_assign_r)
+PPL_DEFINE_BINARY_OP(operator -, sub_assign_r)
+PPL_DEFINE_BINARY_OP(operator *, mul_assign_r)
+PPL_DEFINE_BINARY_OP(operator /, div_assign_r)
+PPL_DEFINE_BINARY_OP(operator %, rem_assign_r)
+
+#undef PPL_DEFINE_BINARY_OP
+
+#define PPL_DEFINE_COMPARE_OP(f, fun)                                   \
+template <typename T1, typename T2>                                     \
+inline                                                                  \
+typename Enable_If<Is_Native_Or_Checked<T1>::value                      \
+                   && Is_Native_Or_Checked<T2>::value                   \
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value), \
+                   bool>::type                                          \
+ PPL_U(f)(const T1& x, const T2& y) {                                   \
+  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy, \
+                      typename Native_Checked_From_Wrapper<T2>::Policy> \
+    (Native_Checked_From_Wrapper<T1>::raw_value(x),                     \
+     Native_Checked_From_Wrapper<T2>::raw_value(y));                    \
+}
+
+PPL_DEFINE_COMPARE_OP(operator ==, eq_ext)
+PPL_DEFINE_COMPARE_OP(operator !=, ne_ext)
+PPL_DEFINE_COMPARE_OP(operator >=, ge_ext)
+PPL_DEFINE_COMPARE_OP(operator >, gt_ext)
+PPL_DEFINE_COMPARE_OP(operator <=, le_ext)
+PPL_DEFINE_COMPARE_OP(operator <, lt_ext)
+
+#undef PPL_DEFINE_COMPARE_OP
+
+#define PPL_DEFINE_COMPARE(f, fun)                                      \
+template <typename T1, typename T2>                                     \
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value               \
+                          && Is_Native_Or_Checked<T2>::value,           \
+                          bool>::type                                   \
+ PPL_U(f)(const T1& x, const T2& y) {                                   \
+  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy, \
+                      typename Native_Checked_From_Wrapper<T2>::Policy> \
+    (Native_Checked_From_Wrapper<T1>::raw_value(x),                     \
+     Native_Checked_From_Wrapper<T2>::raw_value(y));                    \
+}
+
+PPL_DEFINE_COMPARE(equal, eq_ext)
+PPL_DEFINE_COMPARE(not_equal, ne_ext)
+PPL_DEFINE_COMPARE(greater_or_equal, ge_ext)
+PPL_DEFINE_COMPARE(greater_than, gt_ext)
+PPL_DEFINE_COMPARE(less_or_equal, le_ext)
+PPL_DEFINE_COMPARE(less_than, lt_ext)
+
+#undef PPL_DEFINE_COMPARE
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline Checked_Number<T, Policy>
+operator+(const Checked_Number<T, Policy>& x) {
+  return x;
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline Checked_Number<T, Policy>
+operator-(const Checked_Number<T, Policy>& x) {
+  Checked_Number<T, Policy> r;
+  Policy::handle_result(neg_assign_r(r, x, Policy::ROUND_DEFAULT_OPERATOR));
+  return r;
+}
+
+#define PPL_DEFINE_ASSIGN_FUN2_1(f, fun) \
+template <typename T, typename Policy> \
+inline void \
+ PPL_U(f)(Checked_Number<T, Policy>& x) {                               \
+  Policy::handle_result((fun)(x, x, Policy::ROUND_DEFAULT_FUNCTION));   \
+}
+
+#define PPL_DEFINE_ASSIGN_FUN2_2(f, fun) \
+template <typename T, typename Policy> \
+inline void \
+ PPL_U(f)(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y) { \
+  Policy::handle_result((fun)(x, y, Policy::ROUND_DEFAULT_FUNCTION)); \
+}
+
+#define PPL_DEFINE_ASSIGN_FUN3_3(f, fun) \
+template <typename T, typename Policy> \
+inline void \
+ PPL_U(f)(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y, \
+  const Checked_Number<T, Policy>& z) { \
+  Policy::handle_result((fun)(x, y, z, Policy::ROUND_DEFAULT_FUNCTION)); \
+}
+
+#define PPL_DEFINE_ASSIGN_FUN5_5(f, fun)                                        \
+template <typename T, typename Policy>                                  \
+inline void                                                             \
+ PPL_U(f)(Checked_Number<T, Policy>& x,                                 \
+  Checked_Number<T, Policy>& s, Checked_Number<T, Policy>& t,           \
+  const Checked_Number<T, Policy>& y,                                   \
+  const Checked_Number<T, Policy>& z) {                                 \
+  Policy::handle_result((fun)(x, s, t, y, z, Policy::ROUND_DEFAULT_FUNCTION)); \
+}
+
+PPL_DEFINE_ASSIGN_FUN2_2(sqrt_assign, sqrt_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN2_1(floor_assign, floor_assign_r)
+PPL_DEFINE_ASSIGN_FUN2_2(floor_assign, floor_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN2_1(ceil_assign, ceil_assign_r)
+PPL_DEFINE_ASSIGN_FUN2_2(ceil_assign, ceil_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN2_1(trunc_assign, trunc_assign_r)
+PPL_DEFINE_ASSIGN_FUN2_2(trunc_assign, trunc_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN2_1(neg_assign, neg_assign_r)
+PPL_DEFINE_ASSIGN_FUN2_2(neg_assign, neg_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN2_1(abs_assign, abs_assign_r)
+PPL_DEFINE_ASSIGN_FUN2_2(abs_assign, abs_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN3_3(add_mul_assign, add_mul_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN3_3(sub_mul_assign, sub_mul_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN3_3(rem_assign, rem_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN3_3(gcd_assign, gcd_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN5_5(gcdext_assign, gcdext_assign_r)
+
+PPL_DEFINE_ASSIGN_FUN3_3(lcm_assign, lcm_assign_r)
+
+#undef PPL_DEFINE_ASSIGN_FUN2_1
+#undef PPL_DEFINE_ASSIGN_FUN2_2
+#undef PPL_DEFINE_ASSIGN_FUN3_2
+#undef PPL_DEFINE_ASSIGN_FUN3_3
+#undef PPL_DEFINE_ASSIGN_FUN5_5
+
+#define PPL_DEFINE_ASSIGN_2EXP(f, fun)                                  \
+template <typename T, typename Policy>                                  \
+inline void                                                             \
+ PPL_U(f)(Checked_Number<T, Policy>& x,                                 \
+          const Checked_Number<T, Policy>& y, unsigned int exp) {       \
+  Policy::handle_result((fun)(x, y, exp, Policy::ROUND_DEFAULT_FUNCTION)); \
+}
+
+PPL_DEFINE_ASSIGN_2EXP(mul_2exp_assign, mul_2exp_assign_r)
+PPL_DEFINE_ASSIGN_2EXP(div_2exp_assign, div_2exp_assign_r)
+
+template <typename T, typename Policy>
+inline void
+exact_div_assign(Checked_Number<T, Policy>& x,
+                 const Checked_Number<T, Policy>& y,
+                 const Checked_Number<T, Policy>& z) {
+  Policy::handle_result(div_assign_r(x, y, z, ROUND_NOT_NEEDED));
+}
+
+/*! \relates Checked_Number */
+template <typename From>
+inline typename Enable_If<Is_Native_Or_Checked<From>::value, int>::type
+sgn(const From& x) {
+  Result_Relation r = Checked::sgn_ext<typename Native_Checked_From_Wrapper<From>::Policy>(Native_Checked_From_Wrapper<From>::raw_value(x));
+  switch (r) {
+  case VR_LT:
+    return -1;
+  case VR_EQ:
+    return 0;
+  case VR_GT:
+    return 1;
+  default:
+    throw(0);
+  }
+}
+
+/*! \relates Checked_Number */
+template <typename From1, typename From2>
+inline typename Enable_If<Is_Native_Or_Checked<From1>::value
+                          && Is_Native_Or_Checked<From2>::value,
+                          int>::type
+cmp(const From1& x, const From2& y) {
+  Result_Relation r
+    = Checked::cmp_ext<typename Native_Checked_From_Wrapper<From1>::Policy,
+                       typename Native_Checked_From_Wrapper<From2>::Policy>
+                 (Native_Checked_From_Wrapper<From1>::raw_value(x),
+                  Native_Checked_From_Wrapper<From2>::raw_value(y));
+  switch (r) {
+  case VR_LT:
+    return -1;
+  case VR_EQ:
+    return 0;
+  case VR_GT:
+    return 1;
+  default:
+    throw(0);
+  }
+}
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
+output(std::ostream& os, const T& x,
+       const Numeric_Format& format, Rounding_Dir dir) {
+  return check_result(Checked::output_ext<typename Native_Checked_From_Wrapper<T>::Policy>
+                      (os,
+                       Native_Checked_From_Wrapper<T>::raw_value(x),
+                       format,
+                       rounding_dir(dir)),
+                      dir);
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline std::ostream&
+operator<<(std::ostream& os, const Checked_Number<T, Policy>& x) {
+  Policy::handle_result(output(os, x, Numeric_Format(), ROUND_IGNORE));
+  return os;
+}
+
+/*! \relates Checked_Number */
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
+input(T& x, std::istream& is, Rounding_Dir dir) {
+  return check_result(Checked::input_ext<typename Native_Checked_To_Wrapper<T>::Policy>
+                      (Native_Checked_To_Wrapper<T>::raw_value(x),
+                       is,
+                       rounding_dir(dir)),
+                      dir);
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline std::istream& operator>>(std::istream& is,
+                                Checked_Number<T, Policy>& x) {
+  Result r = input(x, is, Policy::ROUND_DEFAULT_INPUT);
+  if (r == V_CVT_STR_UNK)
+    is.setstate(std::ios::failbit);
+  else
+    Policy::handle_result(r);
+  return is;
+}
+
+template <typename T>
+inline T
+plus_infinity() {
+  return PLUS_INFINITY;
+}
+
+template <typename T>
+inline T
+minus_infinity() {
+  return MINUS_INFINITY;
+}
+
+template <typename T>
+inline T
+not_a_number() {
+  return NOT_A_NUMBER;
+}
+
+/*! \relates Checked_Number */
+template <typename T, typename Policy>
+inline void
+swap(Checked_Number<T, Policy>& x, Checked_Number<T, Policy>& y) {
+  using std::swap;
+  swap(x.raw_value(), y.raw_value());
+}
+
+template <typename T>
+inline void
+maybe_reset_fpu_inexact() {
+  if (FPU_Related<T>::value)
+    return fpu_reset_inexact();
+}
+
+template <typename T>
+inline int
+maybe_check_fpu_inexact() {
+  if (FPU_Related<T>::value)
+    return fpu_check_inexact();
+  else
+    return 0;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Checked_Number_inlines_hh)
diff --git a/src/Checked_Number_templates.hh b/src/Checked_Number_templates.hh
new file mode 100644
index 0000000..48a5a3e
--- /dev/null
+++ b/src/Checked_Number_templates.hh
@@ -0,0 +1,149 @@
+/* Checked_Number class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Checked_Number_templates_hh
+#define PPL_Checked_Number_templates_hh 1
+
+#include "assert.hh"
+#include <iomanip>
+#include <limits>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
+ascii_dump(std::ostream& s, const T& t) {
+  if (std::numeric_limits<T>::is_exact)
+    // An exact data type: pretty printer is accurate.
+    s << t;
+  else {
+    // An inexact data type (probably floating point):
+    // first dump its hexadecimal representation ...
+    const std::ios::fmtflags old_flags = s.setf(std::ios::hex,
+                                                std::ios::basefield);
+    const unsigned char* p = reinterpret_cast<const unsigned char*>(&t);
+    for (unsigned i = 0; i < sizeof(T); ++i) {
+      s << std::setw(2) << std::setfill('0') << static_cast<unsigned>(p[i]);
+    }
+    s.flags(old_flags);
+    // ... and then pretty print it for readability.
+    s << " (" << t << ")";
+  }
+}
+
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+ascii_load(std::istream& s, T& t) {
+  if (std::numeric_limits<T>::is_exact) {
+    // An exact data type: input from pretty printed version is accurate.
+    s >> t;
+    return !s.fail();
+  }
+  else {
+    // An inexact data type (probably floating point):
+    // first load its hexadecimal representation ...
+    std::string str;
+    if (!(s >> str) || str.size() != 2*sizeof(T))
+      return false;
+    unsigned char* p = reinterpret_cast<unsigned char*>(&t);
+    // CHECKME: any (portable) simpler way?
+    for (unsigned i = 0; i < sizeof(T); ++i) {
+      unsigned byte_value = 0;
+      for (unsigned j = 0; j < 2; ++j) {
+        byte_value <<= 4;
+        unsigned half_byte_value;
+        // Interpret single hex character.
+        switch (str[2*i + j]) {
+        case '0':
+          half_byte_value = 0;
+          break;
+        case '1':
+          half_byte_value = 1;
+          break;
+        case '2':
+          half_byte_value = 2;
+          break;
+        case '3':
+          half_byte_value = 3;
+          break;
+        case '4':
+          half_byte_value = 4;
+          break;
+        case '5':
+          half_byte_value = 5;
+          break;
+        case '6':
+          half_byte_value = 6;
+          break;
+        case '7':
+          half_byte_value = 7;
+          break;
+        case '8':
+          half_byte_value = 8;
+          break;
+        case '9':
+          half_byte_value = 9;
+          break;
+        case 'A':
+        case 'a':
+          half_byte_value = 10;
+          break;
+        case 'B':
+        case 'b':
+          half_byte_value = 11;
+          break;
+        case 'C':
+        case 'c':
+          half_byte_value = 12;
+          break;
+        case 'D':
+        case 'd':
+          half_byte_value = 13;
+          break;
+        case 'E':
+        case 'e':
+          half_byte_value = 14;
+          break;
+        case 'F':
+        case 'f':
+          half_byte_value = 15;
+          break;
+        default:
+          return false;
+        }
+        byte_value += half_byte_value;
+      }
+      PPL_ASSERT(byte_value <= 255);
+      p[i] = static_cast<unsigned char>(byte_value);
+    }
+    // ... then read and discard pretty printed value.
+    if (!(s >> str))
+      return false;
+    const std::string::size_type sz = str.size();
+    return sz > 2 && str[0] == '(' && str[sz-1] == ')';
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Checked_Number_templates_hh)
diff --git a/src/Checked_Number_types.hh b/src/Checked_Number_types.hh
new file mode 100644
index 0000000..b404b87
--- /dev/null
+++ b/src/Checked_Number_types.hh
@@ -0,0 +1,27 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Checked_Number_types_hh
+#define PPL_Checked_Number_types_hh 1
+
+#include "Coefficient_traits_template.hh"
+
+namespace Parma_Polyhedra_Library {
+
+struct Extended_Number_Policy;
+
+template <typename T, typename Policy>
+class Checked_Number;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Checked_Number_types_hh)
diff --git a/src/Coefficient.cc b/src/Coefficient.cc
index 0d2c1fa..593b344 100644
--- a/src/Coefficient.cc
+++ b/src/Coefficient.cc
@@ -1,6 +1,6 @@
 /* Coefficient class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Coefficient.defs.hh"
+#include "Coefficient_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
diff --git a/src/Coefficient.defs.hh b/src/Coefficient.defs.hh
deleted file mode 100644
index 993bcd1..0000000
--- a/src/Coefficient.defs.hh
+++ /dev/null
@@ -1,61 +0,0 @@
-/* Coefficient class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Coefficient_defs_hh
-#define PPL_Coefficient_defs_hh 1
-
-#include "Coefficient.types.hh"
-#include <iosfwd>
-
-#if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
-#include "Checked_Number.defs.hh"
-#include "checked_int.inlines.hh"
-#endif
-
-#ifdef PPL_GMP_INTEGERS
-#include "GMP_Integer.defs.hh"
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Initializes the Coefficient constants.
-#endif
-void Coefficient_constants_initialize();
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Finalizes the Coefficient constants.
-#endif
-void Coefficient_constants_finalize();
-
-//! Returns a const reference to a Coefficient with value 0.
-Coefficient_traits::const_reference Coefficient_zero();
-
-//! Returns a const reference to a Coefficient with value 1.
-Coefficient_traits::const_reference Coefficient_one();
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Coefficient.inlines.hh"
-
-#endif // !defined(PPL_Coefficient_defs_hh)
diff --git a/src/Coefficient.inlines.hh b/src/Coefficient.inlines.hh
deleted file mode 100644
index 8c9dda6..0000000
--- a/src/Coefficient.inlines.hh
+++ /dev/null
@@ -1,72 +0,0 @@
-/* Coefficient class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Coefficient_inlines_hh
-#define PPL_Coefficient_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_CHECKED_INTEGERS
-inline void
-Bounded_Integer_Coefficient_Policy::handle_result(Result r) {
-  // Note that the input functions can return VC_NAN.
-  if (result_overflow(r) || result_class(r) == VC_NAN)
-    throw_result_exception(r);
-}
-#endif // PPL_CHECKED_INTEGERS
-
-
-#if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
-inline Coefficient_traits::const_reference
-Coefficient_zero() {
-  // FIXME: is there a way to avoid this static variable?
-  static Coefficient zero(0);
-  return zero;
-}
-
-inline Coefficient_traits::const_reference
-Coefficient_one() {
-  // FIXME: is there a way to avoid this static variable?
-  static Coefficient one(1);
-  return one;
-}
-#endif // defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
-
-#ifdef PPL_GMP_INTEGERS
-inline Coefficient_traits::const_reference
-Coefficient_zero() {
-  extern const Coefficient* Coefficient_zero_p;
-  return *Coefficient_zero_p;
-}
-
-inline Coefficient_traits::const_reference
-Coefficient_one() {
-  extern const Coefficient* Coefficient_one_p;
-  PPL_ASSERT(*Coefficient_one_p != 0);
-  return *Coefficient_one_p;
-}
-#endif // PPL_GMP_INTEGERS
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Coefficient_inlines_hh)
diff --git a/src/Coefficient.types.hh b/src/Coefficient.types.hh
deleted file mode 100644
index 062f3a1..0000000
--- a/src/Coefficient.types.hh
+++ /dev/null
@@ -1,182 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Coefficient_types_hh
-#define PPL_Coefficient_types_hh 1
-
-#include "Checked_Number.defs.hh"
-
-#ifdef PPL_GMP_INTEGERS
-#include "GMP_Integer.types.hh"
-#endif
-
-#if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
-
-namespace Parma_Polyhedra_Library {
-
-//! A policy for checked bounded integer coefficients.
-/*! \ingroup PPL_CXX_interface */
-struct Bounded_Integer_Coefficient_Policy {
-  //! Check for overflowed result.
-  const_bool_nodef(check_overflow, true);
-
-  //! Do not check for attempts to add infinities with different sign.
-  const_bool_nodef(check_inf_add_inf, false);
-
-  //! Do not check for attempts to subtract infinities with same sign.
-  const_bool_nodef(check_inf_sub_inf, false);
-
-  //! Do not check for attempts to multiply infinities by zero.
-  const_bool_nodef(check_inf_mul_zero, false);
-
-  //! Do not check for attempts to divide by zero.
-  const_bool_nodef(check_div_zero, false);
-
-  //! Do not check for attempts to divide infinities.
-  const_bool_nodef(check_inf_div_inf, false);
-
-  //! Do not check for attempts to compute remainder of infinities.
-  const_bool_nodef(check_inf_mod, false);
-
-  //! Do not checks for attempts to take the square root of a negative number.
-  const_bool_nodef(check_sqrt_neg, false);
-
-  //! Do not handle not-a-number special value.
-  const_bool_nodef(has_nan, false);
-
-  //! Do not handle infinity special values.
-  const_bool_nodef(has_infinity, false);
-
-  /*! \brief
-    The checked number can always be safely converted to the
-    underlying type \p T and vice-versa.
-  */
-  const_bool_nodef(convertible, true);
-
-  //! Do not honor requests to check for FPU inexact results.
-  const_bool_nodef(fpu_check_inexact, false);
-
-  //! Do not make extra checks to detect FPU NaN results.
-  const_bool_nodef(fpu_check_nan_result, true);
-
-  /*! \brief
-    For constructors, by default use the same rounding used by
-    underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_CONSTRUCTOR = ROUND_NATIVE;
-
-  /*! \brief
-    For overloaded operators (operator+(), operator-(), ...), by
-    default use the same rounding used by the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_OPERATOR = ROUND_NATIVE;
-
-  /*! \brief
-    For input functions, by default use the same rounding used by
-    the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_INPUT = ROUND_NATIVE;
-
-  /*! \brief
-    For output functions, by default use the same rounding used by
-    the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_OUTPUT = ROUND_NATIVE;
-
-  /*! \brief
-    For all other functions, by default use the same rounding used by
-    the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_FUNCTION = ROUND_NATIVE;
-
-  /*! \brief
-    Handles \p r: called by all constructors, operators and functions that
-    do not return a Result value.
-  */
-  static void handle_result(Result r);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Coefficient traits specialization for 8 bits checked integers.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Policy>
-struct Coefficient_traits_template<Checked_Number<int8_t, Policy> > {
-  //! The type used for references to const 8 bit checked integers.
-  typedef Checked_Number<int8_t, Policy> const_reference;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Coefficient traits specialization for 16 bits checked integers.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Policy>
-struct Coefficient_traits_template<Checked_Number<int16_t, Policy> > {
-  //! The type used for references to const 16 bit checked integers.
-  typedef Checked_Number<int16_t, Policy> const_reference;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Coefficient traits specialization for 32 bits checked integers.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Policy>
-struct Coefficient_traits_template<Checked_Number<int32_t, Policy> > {
-  //! The type used for references to const 32 bit checked integers.
-  typedef Checked_Number<int32_t, Policy> const_reference;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Coefficient traits specialization for 64 bits checked integers.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Policy>
-struct Coefficient_traits_template<Checked_Number<int64_t, Policy> > {
-  //! The type used for references to const 64 bit checked integers.
-  typedef const Checked_Number<int64_t, Policy>& const_reference;
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
-
-namespace Parma_Polyhedra_Library {
-
-//! An alias for easily naming the type of PPL coefficients.
-/*! \ingroup PPL_CXX_interface
-  Objects of type Coefficient are used to implement the integral valued
-  coefficients occurring in linear expressions, constraints, generators,
-  intervals, bounding boxes and so on.  Depending on the chosen
-  configuration options (see file <CODE>README.configure</CODE>),
-  a Coefficient may actually be:
-    - The GMP_Integer type, which in turn is an alias for the
-      <CODE>mpz_class</CODE> type implemented by the C++ interface
-      of the GMP library (this is the default configuration).
-    - An instance of the Checked_Number class template: with the policy
-      Bounded_Integer_Coefficient_Policy, this implements overflow
-      detection on top of a native integral type (available template
-      instances include checked integers having 8, 16, 32 or 64 bits);
-      with the Checked_Number_Transparent_Policy, this is a wrapper
-      for native integral types with no overflow detection
-      (available template instances are as above).
-*/
-typedef PPL_COEFFICIENT_TYPE Coefficient;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! An alias for easily naming the coefficient traits.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-typedef Coefficient_traits_template<Coefficient> Coefficient_traits;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Coefficient_types_hh)
diff --git a/src/Coefficient_defs.hh b/src/Coefficient_defs.hh
new file mode 100644
index 0000000..a5733b2
--- /dev/null
+++ b/src/Coefficient_defs.hh
@@ -0,0 +1,61 @@
+/* Coefficient class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Coefficient_defs_hh
+#define PPL_Coefficient_defs_hh 1
+
+#include "Coefficient_types.hh"
+#include <iosfwd>
+
+#if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
+#include "Checked_Number_defs.hh"
+#include "checked_int_inlines.hh"
+#endif
+
+#ifdef PPL_GMP_INTEGERS
+#include "GMP_Integer_defs.hh"
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Initializes the Coefficient constants.
+#endif
+void Coefficient_constants_initialize();
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Finalizes the Coefficient constants.
+#endif
+void Coefficient_constants_finalize();
+
+//! Returns a const reference to a Coefficient with value 0.
+Coefficient_traits::const_reference Coefficient_zero();
+
+//! Returns a const reference to a Coefficient with value 1.
+Coefficient_traits::const_reference Coefficient_one();
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Coefficient_inlines.hh"
+
+#endif // !defined(PPL_Coefficient_defs_hh)
diff --git a/src/Coefficient_inlines.hh b/src/Coefficient_inlines.hh
new file mode 100644
index 0000000..d10c36e
--- /dev/null
+++ b/src/Coefficient_inlines.hh
@@ -0,0 +1,72 @@
+/* Coefficient class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Coefficient_inlines_hh
+#define PPL_Coefficient_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_CHECKED_INTEGERS
+inline void
+Bounded_Integer_Coefficient_Policy::handle_result(Result r) {
+  // Note that the input functions can return VC_NAN.
+  if (result_overflow(r) || result_class(r) == VC_NAN)
+    throw_result_exception(r);
+}
+#endif // PPL_CHECKED_INTEGERS
+
+
+#if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
+inline Coefficient_traits::const_reference
+Coefficient_zero() {
+  // FIXME: is there a way to avoid this static variable?
+  static Coefficient zero(0);
+  return zero;
+}
+
+inline Coefficient_traits::const_reference
+Coefficient_one() {
+  // FIXME: is there a way to avoid this static variable?
+  static Coefficient one(1);
+  return one;
+}
+#endif // defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
+
+#ifdef PPL_GMP_INTEGERS
+inline Coefficient_traits::const_reference
+Coefficient_zero() {
+  extern const Coefficient* Coefficient_zero_p;
+  return *Coefficient_zero_p;
+}
+
+inline Coefficient_traits::const_reference
+Coefficient_one() {
+  extern const Coefficient* Coefficient_one_p;
+  PPL_ASSERT(*Coefficient_one_p != 0);
+  return *Coefficient_one_p;
+}
+#endif // PPL_GMP_INTEGERS
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Coefficient_inlines_hh)
diff --git a/src/Coefficient_traits_template.hh b/src/Coefficient_traits_template.hh
index 921711d..2117477 100644
--- a/src/Coefficient_traits_template.hh
+++ b/src/Coefficient_traits_template.hh
@@ -1,6 +1,6 @@
 /* Coefficient_traits_template class declaration.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/Coefficient_types.hh b/src/Coefficient_types.hh
new file mode 100644
index 0000000..731a45a
--- /dev/null
+++ b/src/Coefficient_types.hh
@@ -0,0 +1,182 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Coefficient_types_hh
+#define PPL_Coefficient_types_hh 1
+
+#include "Checked_Number_defs.hh"
+
+#ifdef PPL_GMP_INTEGERS
+#include "GMP_Integer_types.hh"
+#endif
+
+#if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
+
+namespace Parma_Polyhedra_Library {
+
+//! A policy for checked bounded integer coefficients.
+/*! \ingroup PPL_CXX_interface */
+struct Bounded_Integer_Coefficient_Policy {
+  //! Check for overflowed result.
+  const_bool_nodef(check_overflow, true);
+
+  //! Do not check for attempts to add infinities with different sign.
+  const_bool_nodef(check_inf_add_inf, false);
+
+  //! Do not check for attempts to subtract infinities with same sign.
+  const_bool_nodef(check_inf_sub_inf, false);
+
+  //! Do not check for attempts to multiply infinities by zero.
+  const_bool_nodef(check_inf_mul_zero, false);
+
+  //! Do not check for attempts to divide by zero.
+  const_bool_nodef(check_div_zero, false);
+
+  //! Do not check for attempts to divide infinities.
+  const_bool_nodef(check_inf_div_inf, false);
+
+  //! Do not check for attempts to compute remainder of infinities.
+  const_bool_nodef(check_inf_mod, false);
+
+  //! Do not checks for attempts to take the square root of a negative number.
+  const_bool_nodef(check_sqrt_neg, false);
+
+  //! Do not handle not-a-number special value.
+  const_bool_nodef(has_nan, false);
+
+  //! Do not handle infinity special values.
+  const_bool_nodef(has_infinity, false);
+
+  /*! \brief
+    The checked number can always be safely converted to the
+    underlying type \p T and vice-versa.
+  */
+  const_bool_nodef(convertible, true);
+
+  //! Do not honor requests to check for FPU inexact results.
+  const_bool_nodef(fpu_check_inexact, false);
+
+  //! Do not make extra checks to detect FPU NaN results.
+  const_bool_nodef(fpu_check_nan_result, true);
+
+  /*! \brief
+    For constructors, by default use the same rounding used by
+    underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_CONSTRUCTOR = ROUND_NATIVE;
+
+  /*! \brief
+    For overloaded operators (operator+(), operator-(), ...), by
+    default use the same rounding used by the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_OPERATOR = ROUND_NATIVE;
+
+  /*! \brief
+    For input functions, by default use the same rounding used by
+    the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_INPUT = ROUND_NATIVE;
+
+  /*! \brief
+    For output functions, by default use the same rounding used by
+    the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_OUTPUT = ROUND_NATIVE;
+
+  /*! \brief
+    For all other functions, by default use the same rounding used by
+    the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_FUNCTION = ROUND_NATIVE;
+
+  /*! \brief
+    Handles \p r: called by all constructors, operators and functions that
+    do not return a Result value.
+  */
+  static void handle_result(Result r);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Coefficient traits specialization for 8 bits checked integers.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Policy>
+struct Coefficient_traits_template<Checked_Number<int8_t, Policy> > {
+  //! The type used for references to const 8 bit checked integers.
+  typedef Checked_Number<int8_t, Policy> const_reference;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Coefficient traits specialization for 16 bits checked integers.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Policy>
+struct Coefficient_traits_template<Checked_Number<int16_t, Policy> > {
+  //! The type used for references to const 16 bit checked integers.
+  typedef Checked_Number<int16_t, Policy> const_reference;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Coefficient traits specialization for 32 bits checked integers.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Policy>
+struct Coefficient_traits_template<Checked_Number<int32_t, Policy> > {
+  //! The type used for references to const 32 bit checked integers.
+  typedef Checked_Number<int32_t, Policy> const_reference;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Coefficient traits specialization for 64 bits checked integers.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Policy>
+struct Coefficient_traits_template<Checked_Number<int64_t, Policy> > {
+  //! The type used for references to const 64 bit checked integers.
+  typedef const Checked_Number<int64_t, Policy>& const_reference;
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
+
+namespace Parma_Polyhedra_Library {
+
+//! An alias for easily naming the type of PPL coefficients.
+/*! \ingroup PPL_CXX_interface
+  Objects of type Coefficient are used to implement the integral valued
+  coefficients occurring in linear expressions, constraints, generators,
+  intervals, bounding boxes and so on.  Depending on the chosen
+  configuration options (see file <CODE>README.configure</CODE>),
+  a Coefficient may actually be:
+    - The GMP_Integer type, which in turn is an alias for the
+      <CODE>mpz_class</CODE> type implemented by the C++ interface
+      of the GMP library (this is the default configuration).
+    - An instance of the Checked_Number class template: with the policy
+      Bounded_Integer_Coefficient_Policy, this implements overflow
+      detection on top of a native integral type (available template
+      instances include checked integers having 8, 16, 32 or 64 bits);
+      with the Checked_Number_Transparent_Policy, this is a wrapper
+      for native integral types with no overflow detection
+      (available template instances are as above).
+*/
+typedef PPL_COEFFICIENT_TYPE Coefficient;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An alias for easily naming the coefficient traits.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+typedef Coefficient_traits_template<Coefficient> Coefficient_traits;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Coefficient_types_hh)
diff --git a/src/Concrete_Expression.cc b/src/Concrete_Expression.cc
index 85c4529..5c25d66 100644
--- a/src/Concrete_Expression.cc
+++ b/src/Concrete_Expression.cc
@@ -1,6 +1,6 @@
 /* Concrete_Expression class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Concrete_Expression.defs.hh"
+#include "Concrete_Expression_defs.hh"
 #include <iostream>
 
 namespace PPL = Parma_Polyhedra_Library;
diff --git a/src/Concrete_Expression.defs.hh b/src/Concrete_Expression.defs.hh
deleted file mode 100644
index 0f30e57..0000000
--- a/src/Concrete_Expression.defs.hh
+++ /dev/null
@@ -1,201 +0,0 @@
-/* Concrete_Expression class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Concrete_Expression_defs_hh
-#define PPL_Concrete_Expression_defs_hh 1
-
-#include "Concrete_Expression.types.hh"
-#include "globals.defs.hh"
-#include "Interval.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-//! The type of a concrete expression.
-class Concrete_Expression_Type {
-public:
-  /*! \brief
-    Returns the bounded integer type corresponding to \p width,
-    \p representation and \p overflow.
-  */
-  static Concrete_Expression_Type
-  bounded_integer(Bounded_Integer_Type_Width width,
-                  Bounded_Integer_Type_Representation representation,
-                  Bounded_Integer_Type_Overflow overflow);
-
-  /*! \brief
-    Returns the floating point type corresponding to \p format.
-  */
-  static Concrete_Expression_Type
-  floating_point(Floating_Point_Format format);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is a bounded
-    integer type.
-  */
-  bool is_bounded_integer() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is a floating
-    point type.
-  */
-  bool is_floating_point() const;
-
-  /*! \brief
-    Returns the width in bits of the bounded integer type encoded by
-    \p *this.
-
-    The behavior is undefined if \p *this does not encode a bounded
-    integer type.
-  */
-  Bounded_Integer_Type_Width bounded_integer_type_width() const;
-
-  /*! \brief
-    Returns the representation of the bounded integer type encoded by
-    \p *this.
-
-    The behavior is undefined if \p *this does not encode a bounded
-    integer type.
-  */
-  Bounded_Integer_Type_Representation
-  bounded_integer_type_representation() const;
-
-  /*! \brief
-    Returns the overflow behavior of the bounded integer type encoded by
-    \p *this.
-
-    The behavior is undefined if \p *this does not encode a bounded
-    integer type.
-  */
-  Bounded_Integer_Type_Overflow
-  bounded_integer_type_overflow() const;
-
-  /*! \brief
-    Returns the format of the floating point type encoded by \p *this.
-
-    The behavior is undefined if \p *this does not encode a floating
-    point type.
-  */
-  Floating_Point_Format floating_point_format() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-private:
-  //! A 32-bit word encoding the type.
-  struct Implementation {
-    bool bounded_integer:1;
-    unsigned int bounded_integer_type_width:23;
-    unsigned int bounded_integer_type_representation:2;
-    unsigned int bounded_integer_type_overflow:2;
-    unsigned int floating_point_format:4;
-  };
-
-  //! Constructor from \p implementation.
-  Concrete_Expression_Type(Implementation implementation);
-
-  //! The encoding of \p *this.
-  Implementation impl;
-};
-
-//! Base class for all concrete expressions.
-template <typename Target>
-class Concrete_Expression_Common {
-public:
-  //! Returns the type of \* this.
-  Concrete_Expression_Type type() const;
-
-  //! Returns the kind of \* this.
-  Concrete_Expression_Kind kind() const;
-
-  //! Tests if \p *this has the same kind as <CODE>Derived<Target></CODE>.
-  template <template <typename T> class Derived>
-  bool is() const;
-
-  /*! \brief
-    Returns a pointer to \p *this converted to type
-    <CODE>Derived<Target>*</CODE>.
-  */
-  template <template <typename T> class Derived>
-  Derived<Target>* as();
-
-  /*! \brief
-    Returns a pointer to \p *this converted to type
-    <CODE>const Derived<Target>*</CODE>.
-  */
-  template <template <typename T> class Derived>
-  const Derived<Target>* as() const;
-
-};
-
-//! Base class for binary operator applied to two concrete expressions.
-template <typename Target>
-class Binary_Operator_Common {
-public:
-  //! Returns a constant identifying the operator of \p *this.
-  Concrete_Expression_BOP binary_operator() const;
-
-  //! Returns the left-hand side of \p *this.
-  const Concrete_Expression<Target>* left_hand_side() const;
-
-  //! Returns the right-hand side of \p *this.
-  const Concrete_Expression<Target>* right_hand_side() const;
-};
-
-//! Base class for unary operator applied to one concrete expression.
-template <typename Target>
-class Unary_Operator_Common {
-public:
-  //! Returns a constant identifying the operator of \p *this.
-  Concrete_Expression_UOP unary_operator() const;
-
-  //! Returns the argument \p *this.
-  const Concrete_Expression<Target>* argument() const;
-};
-
-//! Base class for cast operator concrete expressions.
-template <typename Target>
-class Cast_Operator_Common {
-  //! Returns the casted expression.
-  const Concrete_Expression<Target>* argument() const;
-};
-
-//! Base class for integer constant concrete expressions.
-template <typename Target>
-class Integer_Constant_Common {
-};
-
-//! Base class for floating-point constant concrete expression.
-template <typename Target>
-class Floating_Point_Constant_Common {
-};
-
-//! Base class for references to some approximable.
-template <typename Target>
-class Approximable_Reference_Common {
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Concrete_Expression.inlines.hh"
-
-#endif // !defined(PPL_Concrete_Expression_defs_hh)
diff --git a/src/Concrete_Expression.inlines.hh b/src/Concrete_Expression.inlines.hh
deleted file mode 100644
index bb2a29d..0000000
--- a/src/Concrete_Expression.inlines.hh
+++ /dev/null
@@ -1,123 +0,0 @@
-/* Concrete_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Concrete_Expression_inlines_hh
-#define PPL_Concrete_Expression_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Concrete_Expression_Type
-::Concrete_Expression_Type(Implementation implementation)
-  : impl(implementation) {
-}
-
-inline Concrete_Expression_Type
-Concrete_Expression_Type
-::bounded_integer(const Bounded_Integer_Type_Width width,
-                  const Bounded_Integer_Type_Representation representation,
-                  const Bounded_Integer_Type_Overflow overflow) {
-  Implementation impl;
-  impl.bounded_integer = true;
-  impl.bounded_integer_type_width = width;
-  impl.bounded_integer_type_representation = representation;
-  impl.bounded_integer_type_overflow = overflow;
-  // Arbitrary choice to ensure determinism.
-  impl.floating_point_format = IEEE754_HALF;
-  return Concrete_Expression_Type(impl);
-}
-
-inline Concrete_Expression_Type
-Concrete_Expression_Type
-::floating_point(const Floating_Point_Format format) {
-  Implementation impl;
-  impl.bounded_integer = false;
-  impl.floating_point_format = format;
-  // Arbitrary choices to ensure determinism.
-  impl.bounded_integer_type_width = BITS_128;
-  impl.bounded_integer_type_representation =  SIGNED_2_COMPLEMENT;
-  impl.bounded_integer_type_overflow = OVERFLOW_IMPOSSIBLE;
-  return Concrete_Expression_Type(impl);
-}
-
-inline bool
-Concrete_Expression_Type::is_bounded_integer() const {
-  return impl.bounded_integer;
-}
-
-inline bool
-Concrete_Expression_Type::is_floating_point() const {
-  return !impl.bounded_integer;
-}
-
-inline Bounded_Integer_Type_Width
-Concrete_Expression_Type::bounded_integer_type_width() const {
-  unsigned int u = impl.bounded_integer_type_width;
-  return static_cast<Bounded_Integer_Type_Width>(u);
-}
-
-inline Bounded_Integer_Type_Representation
-Concrete_Expression_Type::bounded_integer_type_representation() const {
-  unsigned int u = impl.bounded_integer_type_representation;
-  return static_cast<Bounded_Integer_Type_Representation>(u);
-}
-
-inline Bounded_Integer_Type_Overflow
-Concrete_Expression_Type::bounded_integer_type_overflow() const {
-  unsigned int u = impl.bounded_integer_type_overflow;
-  return static_cast<Bounded_Integer_Type_Overflow>(u);
-}
-
-inline Floating_Point_Format
-Concrete_Expression_Type::floating_point_format() const {
-  unsigned int u = impl.floating_point_format;
-  return static_cast<Floating_Point_Format>(u);
-}
-
-template <typename Target>
-template <template <typename T> class Derived>
-inline bool
-Concrete_Expression_Common<Target>::is() const {
-  return static_cast<const Concrete_Expression<Target>*>(this)->kind() ==
-         Derived<Target>::KIND;
-}
-
-template <typename Target>
-template <template <typename T> class Derived>
-inline Derived<Target>*
-Concrete_Expression_Common<Target>::as() {
-  PPL_ASSERT(is<Derived>());
-  return static_cast<Derived<Target>*>(this);
-}
-
-template <typename Target>
-template <template <typename T> class Derived>
-inline const Derived<Target>*
-Concrete_Expression_Common<Target>::as() const {
-  PPL_ASSERT(is<Derived>());
-  return static_cast<const Derived<Target>*>(this);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Concrete_Expression_inlines_hh)
diff --git a/src/Concrete_Expression.types.hh b/src/Concrete_Expression.types.hh
deleted file mode 100644
index ecf9fde..0000000
--- a/src/Concrete_Expression.types.hh
+++ /dev/null
@@ -1,98 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Concrete_Expression_types_hh
-#define PPL_Concrete_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-/*
-  NOTE: Doxygen seems to ignore documentation blocks attached to
-  template class declarations that are not provided with a definition.
-  This justifies (here below) the explicit use of Doxygen command \class.
-*/
-
-/*! \brief \class Parma_Polyhedra_Library::Concrete_Expression
-  The base class of all concrete expressions.
-*/
-template <typename Target>
-class Concrete_Expression;
-
-/*! \brief \class Parma_Polyhedra_Library::Binary_Operator
-  A binary operator applied to two concrete expressions.
-*/
-template <typename Target>
-class Binary_Operator;
-
-/*! \brief \class Parma_Polyhedra_Library::Unary_Operator
-  A unary operator applied to one concrete expression.
-*/
-template <typename Target>
-class Unary_Operator;
-
-/*! \brief \class Parma_Polyhedra_Library::Cast_Operator
-  A cast operator converting one concrete expression to some type.
-*/
-template <typename Target>
-class Cast_Operator;
-
-/*! \brief \class Parma_Polyhedra_Library::Integer_Constant
-  An integer constant concrete expression.
-*/
-template <typename Target>
-class Integer_Constant;
-
-/*! \brief \class Parma_Polyhedra_Library::Floating_Point_Constant
-  A floating-point constant concrete expression.
-*/
-template <typename Target>
-class Floating_Point_Constant;
-
-/*! \brief \class Parma_Polyhedra_Library::Approximable_Reference
-  A concrete expression representing a reference to some approximable.
-*/
-template <typename Target>
-class Approximable_Reference;
-
-class Concrete_Expression_Type;
-
-/*! \brief
-  Encodes the kind of concrete expression.
-
-  The values should be defined by the particular instance
-  and uniquely identify one of: Binary_Operator, Unary_Operator,
-  Cast_Operator, Integer_Constant, Floating_Point_Constant, or
-  Approximable_Reference.  For example, the Binary_Operator kind
-  integer constant should be defined by an instance as the member
-  <CODE>Binary_Operator<T>::KIND</CODE>
-*/
-typedef int Concrete_Expression_Kind;
-
-/*! \brief
-  Encodes a binary operator of concrete expressions.
-
-  The values should be uniquely defined by the particular instance and
-  named: ADD, SUB, MUL, DIV, REM, BAND, BOR, BXOR, LSHIFT, RSHIFT.
-*/
-typedef int Concrete_Expression_BOP;
-
-/*! \brief
-  Encodes a unary operator of concrete expressions.
-
-  The values should be uniquely defined by the particular instance and
-  named: PLUS, MINUS, BNOT.
-*/
-typedef int Concrete_Expression_UOP;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Concrete_Expression_types_hh)
diff --git a/src/Concrete_Expression_defs.hh b/src/Concrete_Expression_defs.hh
new file mode 100644
index 0000000..d59e1c9
--- /dev/null
+++ b/src/Concrete_Expression_defs.hh
@@ -0,0 +1,201 @@
+/* Concrete_Expression class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Concrete_Expression_defs_hh
+#define PPL_Concrete_Expression_defs_hh 1
+
+#include "Concrete_Expression_types.hh"
+#include "globals_defs.hh"
+#include "Interval_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+//! The type of a concrete expression.
+class Concrete_Expression_Type {
+public:
+  /*! \brief
+    Returns the bounded integer type corresponding to \p width,
+    \p representation and \p overflow.
+  */
+  static Concrete_Expression_Type
+  bounded_integer(Bounded_Integer_Type_Width width,
+                  Bounded_Integer_Type_Representation representation,
+                  Bounded_Integer_Type_Overflow overflow);
+
+  /*! \brief
+    Returns the floating point type corresponding to \p format.
+  */
+  static Concrete_Expression_Type
+  floating_point(Floating_Point_Format format);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is a bounded
+    integer type.
+  */
+  bool is_bounded_integer() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is a floating
+    point type.
+  */
+  bool is_floating_point() const;
+
+  /*! \brief
+    Returns the width in bits of the bounded integer type encoded by
+    \p *this.
+
+    The behavior is undefined if \p *this does not encode a bounded
+    integer type.
+  */
+  Bounded_Integer_Type_Width bounded_integer_type_width() const;
+
+  /*! \brief
+    Returns the representation of the bounded integer type encoded by
+    \p *this.
+
+    The behavior is undefined if \p *this does not encode a bounded
+    integer type.
+  */
+  Bounded_Integer_Type_Representation
+  bounded_integer_type_representation() const;
+
+  /*! \brief
+    Returns the overflow behavior of the bounded integer type encoded by
+    \p *this.
+
+    The behavior is undefined if \p *this does not encode a bounded
+    integer type.
+  */
+  Bounded_Integer_Type_Overflow
+  bounded_integer_type_overflow() const;
+
+  /*! \brief
+    Returns the format of the floating point type encoded by \p *this.
+
+    The behavior is undefined if \p *this does not encode a floating
+    point type.
+  */
+  Floating_Point_Format floating_point_format() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+private:
+  //! A 32-bit word encoding the type.
+  struct Implementation {
+    bool bounded_integer:1;
+    unsigned int bounded_integer_type_width:23;
+    unsigned int bounded_integer_type_representation:2;
+    unsigned int bounded_integer_type_overflow:2;
+    unsigned int floating_point_format:4;
+  };
+
+  //! Constructor from \p implementation.
+  Concrete_Expression_Type(Implementation implementation);
+
+  //! The encoding of \p *this.
+  Implementation impl;
+};
+
+//! Base class for all concrete expressions.
+template <typename Target>
+class Concrete_Expression_Common {
+public:
+  //! Returns the type of \* this.
+  Concrete_Expression_Type type() const;
+
+  //! Returns the kind of \* this.
+  Concrete_Expression_Kind kind() const;
+
+  //! Tests if \p *this has the same kind as <CODE>Derived\<Target\></CODE>.
+  template <template <typename T> class Derived>
+  bool is() const;
+
+  /*! \brief
+    Returns a pointer to \p *this converted to type
+    <CODE>Derived\<Target\>*</CODE>.
+  */
+  template <template <typename T> class Derived>
+  Derived<Target>* as();
+
+  /*! \brief
+    Returns a pointer to \p *this converted to type
+    <CODE>const Derived\<Target\>*</CODE>.
+  */
+  template <template <typename T> class Derived>
+  const Derived<Target>* as() const;
+
+};
+
+//! Base class for binary operator applied to two concrete expressions.
+template <typename Target>
+class Binary_Operator_Common {
+public:
+  //! Returns a constant identifying the operator of \p *this.
+  Concrete_Expression_BOP binary_operator() const;
+
+  //! Returns the left-hand side of \p *this.
+  const Concrete_Expression<Target>* left_hand_side() const;
+
+  //! Returns the right-hand side of \p *this.
+  const Concrete_Expression<Target>* right_hand_side() const;
+};
+
+//! Base class for unary operator applied to one concrete expression.
+template <typename Target>
+class Unary_Operator_Common {
+public:
+  //! Returns a constant identifying the operator of \p *this.
+  Concrete_Expression_UOP unary_operator() const;
+
+  //! Returns the argument \p *this.
+  const Concrete_Expression<Target>* argument() const;
+};
+
+//! Base class for cast operator concrete expressions.
+template <typename Target>
+class Cast_Operator_Common {
+  //! Returns the casted expression.
+  const Concrete_Expression<Target>* argument() const;
+};
+
+//! Base class for integer constant concrete expressions.
+template <typename Target>
+class Integer_Constant_Common {
+};
+
+//! Base class for floating-point constant concrete expression.
+template <typename Target>
+class Floating_Point_Constant_Common {
+};
+
+//! Base class for references to some approximable.
+template <typename Target>
+class Approximable_Reference_Common {
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Concrete_Expression_inlines.hh"
+
+#endif // !defined(PPL_Concrete_Expression_defs_hh)
diff --git a/src/Concrete_Expression_inlines.hh b/src/Concrete_Expression_inlines.hh
new file mode 100644
index 0000000..e6963e6
--- /dev/null
+++ b/src/Concrete_Expression_inlines.hh
@@ -0,0 +1,123 @@
+/* Concrete_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Concrete_Expression_inlines_hh
+#define PPL_Concrete_Expression_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Concrete_Expression_Type
+::Concrete_Expression_Type(Implementation implementation)
+  : impl(implementation) {
+}
+
+inline Concrete_Expression_Type
+Concrete_Expression_Type
+::bounded_integer(const Bounded_Integer_Type_Width width,
+                  const Bounded_Integer_Type_Representation representation,
+                  const Bounded_Integer_Type_Overflow overflow) {
+  Implementation impl;
+  impl.bounded_integer = true;
+  impl.bounded_integer_type_width = width;
+  impl.bounded_integer_type_representation = representation;
+  impl.bounded_integer_type_overflow = overflow;
+  // Arbitrary choice to ensure determinism.
+  impl.floating_point_format = IEEE754_HALF;
+  return Concrete_Expression_Type(impl);
+}
+
+inline Concrete_Expression_Type
+Concrete_Expression_Type
+::floating_point(const Floating_Point_Format format) {
+  Implementation impl;
+  impl.bounded_integer = false;
+  impl.floating_point_format = format;
+  // Arbitrary choices to ensure determinism.
+  impl.bounded_integer_type_width = BITS_128;
+  impl.bounded_integer_type_representation =  SIGNED_2_COMPLEMENT;
+  impl.bounded_integer_type_overflow = OVERFLOW_IMPOSSIBLE;
+  return Concrete_Expression_Type(impl);
+}
+
+inline bool
+Concrete_Expression_Type::is_bounded_integer() const {
+  return impl.bounded_integer;
+}
+
+inline bool
+Concrete_Expression_Type::is_floating_point() const {
+  return !impl.bounded_integer;
+}
+
+inline Bounded_Integer_Type_Width
+Concrete_Expression_Type::bounded_integer_type_width() const {
+  const unsigned int u = impl.bounded_integer_type_width;
+  return static_cast<Bounded_Integer_Type_Width>(u);
+}
+
+inline Bounded_Integer_Type_Representation
+Concrete_Expression_Type::bounded_integer_type_representation() const {
+  const unsigned int u = impl.bounded_integer_type_representation;
+  return static_cast<Bounded_Integer_Type_Representation>(u);
+}
+
+inline Bounded_Integer_Type_Overflow
+Concrete_Expression_Type::bounded_integer_type_overflow() const {
+  const unsigned int u = impl.bounded_integer_type_overflow;
+  return static_cast<Bounded_Integer_Type_Overflow>(u);
+}
+
+inline Floating_Point_Format
+Concrete_Expression_Type::floating_point_format() const {
+  const unsigned int u = impl.floating_point_format;
+  return static_cast<Floating_Point_Format>(u);
+}
+
+template <typename Target>
+template <template <typename T> class Derived>
+inline bool
+Concrete_Expression_Common<Target>::is() const {
+  return static_cast<const Concrete_Expression<Target>*>(this)->kind() ==
+         Derived<Target>::KIND;
+}
+
+template <typename Target>
+template <template <typename T> class Derived>
+inline Derived<Target>*
+Concrete_Expression_Common<Target>::as() {
+  PPL_ASSERT(is<Derived>());
+  return static_cast<Derived<Target>*>(this);
+}
+
+template <typename Target>
+template <template <typename T> class Derived>
+inline const Derived<Target>*
+Concrete_Expression_Common<Target>::as() const {
+  PPL_ASSERT(is<Derived>());
+  return static_cast<const Derived<Target>*>(this);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Concrete_Expression_inlines_hh)
diff --git a/src/Concrete_Expression_types.hh b/src/Concrete_Expression_types.hh
new file mode 100644
index 0000000..ea0f68e
--- /dev/null
+++ b/src/Concrete_Expression_types.hh
@@ -0,0 +1,98 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Concrete_Expression_types_hh
+#define PPL_Concrete_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+/*
+  NOTE: Doxygen seems to ignore documentation blocks attached to
+  template class declarations that are not provided with a definition.
+  This justifies (here below) the explicit use of Doxygen command \class.
+*/
+
+/*! \brief The base class of all concrete expressions.
+  \class Parma_Polyhedra_Library::Concrete_Expression
+*/
+template <typename Target>
+class Concrete_Expression;
+
+/*! \brief A binary operator applied to two concrete expressions.
+  \class Parma_Polyhedra_Library::Binary_Operator
+*/
+template <typename Target>
+class Binary_Operator;
+
+/*! \brief A unary operator applied to one concrete expression.
+  \class Parma_Polyhedra_Library::Unary_Operator
+*/
+template <typename Target>
+class Unary_Operator;
+
+/*! \brief A cast operator converting one concrete expression to some type.
+  \class Parma_Polyhedra_Library::Cast_Operator
+*/
+template <typename Target>
+class Cast_Operator;
+
+/*! \brief An integer constant concrete expression.
+  \class Parma_Polyhedra_Library::Integer_Constant
+*/
+template <typename Target>
+class Integer_Constant;
+
+/*! \brief A floating-point constant concrete expression.
+  \class Parma_Polyhedra_Library::Floating_Point_Constant
+*/
+template <typename Target>
+class Floating_Point_Constant;
+
+/*! \brief A concrete expression representing a reference to some approximable.
+  \class Parma_Polyhedra_Library::Approximable_Reference
+*/
+template <typename Target>
+class Approximable_Reference;
+
+class Concrete_Expression_Type;
+
+/*! \brief
+  Encodes the kind of concrete expression.
+
+  The values should be defined by the particular instance
+  and uniquely identify one of: Binary_Operator, Unary_Operator,
+  Cast_Operator, Integer_Constant, Floating_Point_Constant, or
+  Approximable_Reference.  For example, the Binary_Operator kind
+  integer constant should be defined by an instance as the member
+  <CODE>Binary_Operator\<T\>::%KIND</CODE>.
+*/
+typedef int Concrete_Expression_Kind;
+
+/*! \brief
+  Encodes a binary operator of concrete expressions.
+
+  The values should be uniquely defined by the particular instance and
+  named: ADD, SUB, MUL, DIV, REM, BAND, BOR, BXOR, LSHIFT, RSHIFT.
+*/
+typedef int Concrete_Expression_BOP;
+
+/*! \brief
+  Encodes a unary operator of concrete expressions.
+
+  The values should be uniquely defined by the particular instance and
+  named: PLUS, MINUS, BNOT.
+*/
+typedef int Concrete_Expression_UOP;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Concrete_Expression_types_hh)
diff --git a/src/Congruence.cc b/src/Congruence.cc
index 54d3026..a8ad80b 100644
--- a/src/Congruence.cc
+++ b/src/Congruence.cc
@@ -1,6 +1,6 @@
 /* Congruence class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,9 +22,9 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Congruence.defs.hh"
-#include "Variable.defs.hh"
-#include "Constraint.defs.hh"
+#include "Congruence_defs.hh"
+#include "Variable_defs.hh"
+#include "Constraint_defs.hh"
 #include "assert.hh"
 #include <iostream>
 #include <sstream>
@@ -128,7 +128,7 @@ PPL::Congruence
 
 PPL::Congruence
 PPL::Congruence::create(const Linear_Expression& e1,
-			const Linear_Expression& e2,
+                        const Linear_Expression& e2,
                         Representation r) {
   Linear_Expression e(e1,
                       std::max(e1.space_dimension(), e2.space_dimension()),
@@ -139,7 +139,7 @@ PPL::Congruence::create(const Linear_Expression& e1,
 
 void
 PPL::Congruence::throw_invalid_argument(const char* method,
-					const char* message) const {
+                                        const char* message) const {
   std::ostringstream s;
   s << "PPL::Congruence::" << method << ":" << std::endl
     << message;
@@ -148,12 +148,12 @@ PPL::Congruence::throw_invalid_argument(const char* method,
 
 void
 PPL::Congruence::throw_dimension_incompatible(const char* method,
-					      const char* v_name,
-					      const Variable v) const {
+                                              const char* v_name,
+                                              const Variable v) const {
   std::ostringstream s;
   s << "this->space_dimension() == " << space_dimension() << ", "
     << v_name << ".space_dimension() == " << v.space_dimension() << ".";
-  std::string str = s.str();
+  const std::string str = s.str();
   throw_invalid_argument(method, str.c_str());
 }
 
@@ -163,8 +163,9 @@ PPL::IO_Operators::operator<<(std::ostream& s, const Congruence& c) {
   const dimension_type num_variables = c.space_dimension();
   PPL_DIRTY_TEMP_COEFFICIENT(cv);
   bool first = true;
-  for (Congruence::Expression::const_iterator i = c.expression().begin(),
-        i_end = c.expression().lower_bound(Variable(num_variables)); i != i_end; ++i) {
+  const Congruence::expr_type c_e = c.expression();
+  for (Congruence::expr_type::const_iterator i = c_e.begin(),
+        i_end = c_e.lower_bound(Variable(num_variables)); i != i_end; ++i) {
     cv = *i;
     if (!first) {
       if (cv > 0)
@@ -235,7 +236,7 @@ PPL::Congruence::OK() const {
   if (modulus() < 0) {
 #ifndef NDEBUG
     std::cerr << "Congruence has a negative modulus " << modulus() << "."
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
diff --git a/src/Congruence.defs.hh b/src/Congruence.defs.hh
deleted file mode 100644
index 79f0124..0000000
--- a/src/Congruence.defs.hh
+++ /dev/null
@@ -1,504 +0,0 @@
-/* Congruence class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Congruence_defs_hh
-#define PPL_Congruence_defs_hh 1
-
-#include "Congruence.types.hh"
-
-#include "Coefficient.defs.hh"
-#include "Variable.defs.hh"
-
-#include "Constraint.types.hh"
-#include "Grid.types.hh"
-#include "Linear_Expression.defs.hh"
-
-#include <iosfwd>
-#include <vector>
-
-// These are declared here because they are friend of Congruence.
-namespace Parma_Polyhedra_Library {
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equivalent.
-/*! \relates Congruence */
-bool
-operator==(const Congruence& x, const Congruence& y);
-
-//! Returns <CODE>false</CODE> if and only if \p x and \p y are equivalent.
-/*! \relates Congruence */
-bool
-operator!=(const Congruence& x, const Congruence& y);
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! A linear congruence.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Congruence is a congruence:
-  - \f$\cg = \sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod m\f$
-
-  where \f$n\f$ is the dimension of the space,
-  \f$a_i\f$ is the integer coefficient of variable \f$x_i\f$,
-  \f$b\f$ is the integer inhomogeneous term and \f$m\f$ is the integer modulus;
-  if \f$m = 0\f$, then \f$\cg\f$ represents the equality congruence
-  \f$\sum_{i=0}^{n-1} a_i x_i + b = 0\f$
-  and, if \f$m \neq 0\f$, then the congruence \f$\cg\f$ is
-  said to be a proper congruence.
-
-  \par How to build a congruence
-  Congruences \f$\pmod{1}\f$ are typically built by
-  applying the congruence symbol `<CODE>\%=</CODE>'
-  to a pair of linear expressions.
-  Congruences with modulus \p m
-  are typically constructed by building a congruence \f$\pmod{1}\f$
-  using the given pair of linear expressions
-  and then adding the modulus \p m
-  using the modulus symbol is `<CODE>/</CODE>'.
-
-  The space dimension of a congruence is defined as the maximum
-  space dimension of the arguments of its constructor.
-
-  \par
-  In the following examples it is assumed that variables
-  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
-  are defined as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable z(2);
-  \endcode
-
-  \par Example 1
-  The following code builds the equality congruence
-  \f$3x + 5y - z = 0\f$, having space dimension \f$3\f$:
-  \code
-  Congruence eq_cg((3*x + 5*y - z %= 0) / 0);
-  \endcode
-  The following code builds the congruence
-  \f$4x = 2y - 13 \pmod{1}\f$, having space dimension \f$2\f$:
-  \code
-  Congruence mod1_cg(4*x %= 2*y - 13);
-  \endcode
-  The following code builds the congruence
-  \f$4x = 2y - 13 \pmod{2}\f$, having space dimension \f$2\f$:
-  \code
-  Congruence mod2_cg((4*x %= 2*y - 13) / 2);
-  \endcode
-  An unsatisfiable congruence on the zero-dimension space \f$\Rset^0\f$
-  can be specified as follows:
-  \code
-  Congruence false_cg = Congruence::zero_dim_false();
-  \endcode
-  Equivalent, but more involved ways are the following:
-  \code
-  Congruence false_cg1((Linear_Expression::zero() %= 1) / 0);
-  Congruence false_cg2((Linear_Expression::zero() %= 1) / 2);
-  \endcode
-  In contrast, the following code defines an unsatisfiable congruence
-  having space dimension \f$3\f$:
-  \code
-  Congruence false_cg3((0*z %= 1) / 0);
-  \endcode
-
-  \par How to inspect a congruence
-  Several methods are provided to examine a congruence and extract
-  all the encoded information: its space dimension, its modulus
-  and the value of its integer coefficients.
-
-  \par Example 2
-  The following code shows how it is possible to access the modulus
-  as well as each of the coefficients.
-  Given a congruence with linear expression \p e and modulus \p m
-  (in this case \f$x - 5y + 3z = 4 \pmod{5}\f$), we construct a new
-  congruence with the same modulus \p m but where the linear
-  expression is \f$2 e\f$ (\f$2x - 10y + 6z = 8 \pmod{5}\f$).
-  \code
-  Congruence cg1((x - 5*y + 3*z %= 4) / 5);
-  cout << "Congruence cg1: " << cg1 << endl;
-  const Coefficient& m = cg1.modulus();
-  if (m == 0)
-    cout << "Congruence cg1 is an equality." << endl;
-  else {
-    Linear_Expression e;
-    for (dimension_type i = cg1.space_dimension(); i-- > 0; )
-      e += 2 * cg1.coefficient(Variable(i)) * Variable(i);
-      e += 2 * cg1.inhomogeneous_term();
-    Congruence cg2((e %= 0) / m);
-    cout << "Congruence cg2: " << cg2 << endl;
-  }
-  \endcode
-  The actual output could be the following:
-  \code
-  Congruence cg1: A - 5*B + 3*C %= 4 / 5
-  Congruence cg2: 2*A - 10*B + 6*C %= 8 / 5
-  \endcode
-  Note that, in general, the particular output obtained can be
-  syntactically different from the (semantically equivalent)
-  congruence considered.
-*/
-class Parma_Polyhedra_Library::Congruence {
-public:
-
-  //! The representation used for new Congruences.
-  /*!
-    \note The copy constructor and the copy constructor with specified size
-          use the representation of the original object, so that it is
-          indistinguishable from the original object.
-  */
-  static const Representation default_representation = SPARSE;
-
-  //! Constructs the 0 = 0 congruence with space dimension \p 0 .
-  explicit Congruence(Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  /*!
-    \note The new Congruence will have the same representation as `cg',
-          not default_representation, so that they are indistinguishable.
-  */
-  Congruence(const Congruence& cg);
-
-  //! Copy constructor with specified representation.
-  Congruence(const Congruence& cg, Representation r);
-
-  //! Copy-constructs (modulo 0) from equality constraint \p c.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p c is an inequality.
-  */
-  explicit Congruence(const Constraint& c,
-                      Representation r = default_representation);
-
-  //! Destructor.
-  ~Congruence();
-
-  //! Assignment operator.
-  Congruence& operator=(const Congruence& y);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Congruence can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  void permute_space_dimensions(const std::vector<Variable>& cycles);
-
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Linear_Expression Expression;
-
-  const Expression& expression() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  /*!
-    \exception std::invalid_argument thrown if the index of \p v
-    is greater than or equal to the space dimension of \p *this.
-  */
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Returns a const reference to the modulus of \p *this.
-  Coefficient_traits::const_reference modulus() const;
-
-  //! Sets the modulus of \p *this to \p m .
-  //! If \p m is 0, the congruence becomes an equality.
-  void set_modulus(Coefficient_traits::const_reference m);
-
-  //! Multiplies all the coefficients, including the modulus, by \p factor .
-  void scale(Coefficient_traits::const_reference factor);
-
-  // TODO: Document this.
-  void affine_preimage(Variable v,
-                       const Linear_Expression& expr,
-                       Coefficient_traits::const_reference denominator);
-
-  //! Multiplies \p k into the modulus of \p *this.
-  /*!
-    If called with \p *this representing the congruence \f$ e_1 = e_2
-    \pmod{m}\f$, then it returns with *this representing
-    the congruence \f$ e_1 = e_2 \pmod{mk}\f$.
-  */
-  Congruence&
-  operator/=(Coefficient_traits::const_reference k);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is a tautology
-    (i.e., an always true congruence).
-
-    A tautological congruence has one the following two forms:
-    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + 0 == 0\f$; or
-    - a proper congruence: \f$\sum_{i=0}^{n-1} 0 x_i + b \%= 0 / m\f$,
-      where \f$b = 0 \pmod{m}\f$.
-  */
-  bool is_tautological() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is inconsistent (i.e., an always false congruence).
-
-    An inconsistent congruence has one of the following two forms:
-    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + b == 0\f$
-      where \f$b \neq 0\f$; or
-    - a proper congruence: \f$\sum_{i=0}^{n-1} 0 x_i + b \%= 0 / m\f$,
-      where \f$b \neq 0 \pmod{m}\f$.
-  */
-  bool is_inconsistent() const;
-
-  //! Returns <CODE>true</CODE> if the modulus is greater than zero.
-  /*!
-    A congruence with a modulus of 0 is a linear equality.
-  */
-  bool is_proper_congruence() const;
-
-  //! Returns <CODE>true</CODE> if \p *this is an equality.
-  /*!
-    A modulus of zero denotes a linear equality.
-  */
-  bool is_equality() const;
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  /*! \brief
-    Returns a reference to the true (zero-dimension space) congruence
-    \f$0 = 1 \pmod{1}\f$, also known as the <EM>integrality
-    congruence</EM>.
-  */
-  static const Congruence& zero_dim_integrality();
-
-  /*! \brief
-    Returns a reference to the false (zero-dimension space) congruence
-    \f$0 = 1 \pmod{0}\f$.
-  */
-  static const Congruence& zero_dim_false();
-
-  //! Returns the congruence \f$e1 = e2 \pmod{1}\f$.
-  static Congruence
-  create(const Linear_Expression& e1, const Linear_Expression& e2,
-         Representation r = default_representation);
-
-  //! Returns the congruence \f$e = n \pmod{1}\f$.
-  static Congruence
-  create(const Linear_Expression& e, Coefficient_traits::const_reference n,
-         Representation r = default_representation);
-
-  //! Returns the congruence \f$n = e \pmod{1}\f$.
-  static Congruence
-  create(Coefficient_traits::const_reference n, const Linear_Expression& e,
-         Representation r = default_representation);
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation of the internal
-    representation of \p *this.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Congruence& y);
-
-  //! Copy-constructs with the specified space dimension.
-  /*!
-    \note The new Congruence will have the same representation as `cg',
-          not default_representation, for consistency with the copy
-          constructor.
-  */
-  Congruence(const Congruence& cg, dimension_type new_space_dimension);
-
-  //! Copy-constructs with the specified space dimension and representation.
-  Congruence(const Congruence& cg, dimension_type new_space_dimension,
-             Representation r);
-
-  //! Copy-constructs from a constraint, with the specified space dimension
-  //! and (optional) representation.
-  Congruence(const Constraint& cg, dimension_type new_space_dimension,
-             Representation r = default_representation);
-
-  //! Constructs from Linear_Expression \p le, using modulus \p m.
-  /*!
-    Builds a congruence with modulus \p m, stealing the coefficients
-    from \p le.
-
-    \note The new Congruence will have the same representation as `le'.
-
-    \param le
-    The Linear_Expression holding the coefficients.
-
-    \param m
-    The modulus for the congruence, which must be zero or greater.
-  */
-  Congruence(Linear_Expression& le,
-             Coefficient_traits::const_reference m, Recycle_Input);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Sets the space dimension by \p n , adding or removing coefficients as
-  //! needed.
-  void set_space_dimension(dimension_type n);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Normalizes the signs.
-  /*!
-    The signs of the coefficients and the inhomogeneous term are
-    normalized, leaving the first non-zero homogeneous coefficient
-    positive.
-  */
-  void sign_normalize();
-
-  //! Normalizes signs and the inhomogeneous term.
-  /*!
-    Applies sign_normalize, then reduces the inhomogeneous term to the
-    smallest possible positive number.
-  */
-  void normalize();
-
-  //! Calls normalize, then divides out common factors.
-  /*!
-    Strongly normalized Congruences have equivalent semantics if and
-    only if they have the same syntax (as output by operator<<).
-  */
-  void strong_normalize();
-
-private:
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the false (zero-dimension space) congruence \f$0 = 1 \pmod{0}\f$.
-  */
-  static const Congruence* zero_dim_false_p;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the true (zero-dimension space) congruence \f$0 = 1 \pmod{1}\f$,
-    also known as the <EM>integrality congruence</EM>.
-  */
-  static const Congruence* zero_dim_integrality_p;
-
-  Linear_Expression expr;
-
-  Coefficient modulus_;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if \p *this is equal to \p cg in
-    dimension \p v.
-  */
-  bool is_equal_at_dimension(Variable v,
-                             const Congruence& cg) const;
-
-  /*! \brief
-    Throws a <CODE>std::invalid_argument</CODE> exception containing
-    error message \p message.
-  */
-  void
-  throw_invalid_argument(const char* method, const char* message) const;
-
-  /*! \brief
-    Throws a <CODE>std::invalid_argument</CODE> exception containing
-    the appropriate error message.
-  */
-  void
-  throw_dimension_incompatible(const char* method,
-			       const char* v_name,
-			       Variable v) const;
-
-  friend bool
-  operator==(const Congruence& x, const Congruence& y);
-
-  friend bool
-  operator!=(const Congruence& x, const Congruence& y);
-
-  friend class Grid;
-};
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operators.
-
-/*! \relates Parma_Polyhedra_Library::Congruence */
-std::ostream&
-operator<<(std::ostream& s, const Congruence& c);
-
-} // namespace IO_Operators
-
-//! Returns the congruence \f$e1 = e2 \pmod{1}\f$.
-/*! \relates Congruence */
-Congruence
-operator%=(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the congruence \f$e = n \pmod{1}\f$.
-/*! \relates Congruence */
-Congruence
-operator%=(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns a copy of \p cg, multiplying \p k into the copy's modulus.
-/*!
-    If \p cg represents the congruence \f$ e_1 = e_2
-    \pmod{m}\f$, then the result represents the
-    congruence \f$ e_1 = e_2 \pmod{mk}\f$.
-  \relates Congruence
-*/
-Congruence
-operator/(const Congruence& cg, Coefficient_traits::const_reference k);
-
-//! Creates a congruence from \p c, with \p m as the modulus.
-/*! \relates Congruence */
-Congruence
-operator/(const Constraint& c, Coefficient_traits::const_reference m);
-
-/*! \relates Congruence */
-void
-swap(Congruence& x, Congruence& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Congruence.inlines.hh"
-
-#endif // !defined(PPL_Congruence_defs_hh)
diff --git a/src/Congruence.inlines.hh b/src/Congruence.inlines.hh
deleted file mode 100644
index b8f8136..0000000
--- a/src/Congruence.inlines.hh
+++ /dev/null
@@ -1,281 +0,0 @@
-/* Congruence class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Congruence_inlines_hh
-#define PPL_Congruence_inlines_hh 1
-
-#include <sstream>
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Congruence::Congruence(Representation r)
-  : expr(r) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Congruence::Congruence(const Congruence& cg)
-  : expr(cg.expr), modulus_(cg.modulus_) {
-}
-
-inline
-Congruence::Congruence(const Congruence& cg, Representation r)
-  : expr(cg.expr, r), modulus_(cg.modulus_) {
-}
-
-inline
-Congruence::Congruence(const Congruence& cg,
-                       dimension_type new_space_dimension)
-  : expr(cg.expr, new_space_dimension), modulus_(cg.modulus_) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Congruence::Congruence(const Congruence& cg,
-                       dimension_type new_space_dimension,
-                       Representation r)
-  : expr(cg.expr, new_space_dimension, r), modulus_(cg.modulus_) {
-  PPL_ASSERT(OK());
-}
-
-inline Representation
-Congruence::representation() const {
-  return expr.representation();
-}
-
-inline void
-Congruence::set_representation(Representation r) {
-  expr.set_representation(r);
-}
-
-inline const Congruence::Expression&
-Congruence::expression() const {
-  return expr;
-}
-
-inline void
-Congruence::set_space_dimension(dimension_type n) {
-  expr.set_space_dimension(n);
-  PPL_ASSERT(OK());
-}
-
-inline void
-Congruence::shift_space_dimensions(Variable v, dimension_type n) {
-  expr.shift_space_dimensions(v, n);
-}
-
-inline
-Congruence::~Congruence() {
-}
-
-inline
-Congruence::Congruence(Linear_Expression& le,
-		       Coefficient_traits::const_reference m,
-                       Recycle_Input)
-  : modulus_(m) {
-  PPL_ASSERT(m >= 0);
-  swap(expr, le);
-
-  PPL_ASSERT(OK());
-}
-
-inline Congruence
-Congruence::create(const Linear_Expression& e,
-		   Coefficient_traits::const_reference n,
-                   Representation r) {
-  Linear_Expression diff(e, r);
-  diff -= n;
-  Congruence cg(diff, 1, Recycle_Input());
-  return cg;
-}
-
-inline Congruence
-Congruence::create(Coefficient_traits::const_reference n,
-		   const Linear_Expression& e,
-                   Representation r) {
-  Linear_Expression diff(e, r);
-  diff -= n;
-  Congruence cg(diff, 1, Recycle_Input());
-  return cg;
-}
-
-/*! \relates Parma_Polyhedra_Library::Congruence */
-inline Congruence
-operator%=(const Linear_Expression& e1, const Linear_Expression& e2) {
-  return Congruence::create(e1, e2);
-}
-
-/*! \relates Parma_Polyhedra_Library::Congruence */
-inline Congruence
-operator%=(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  return Congruence::create(e, n);
-}
-
-/*! \relates Parma_Polyhedra_Library::Congruence */
-inline Congruence
-operator/(const Congruence& cg, Coefficient_traits::const_reference k) {
-  Congruence ret = cg;
-  ret /= k;
-  return ret;
-}
-
-inline const Congruence&
-Congruence::zero_dim_integrality() {
-  return *zero_dim_integrality_p;
-}
-
-inline const Congruence&
-Congruence::zero_dim_false() {
-  return *zero_dim_false_p;
-}
-
-inline Congruence&
-Congruence::operator=(const Congruence& y) {
-  Congruence tmp = y;
-  swap(*this, tmp);
-  return *this;
-}
-
-/*! \relates Congruence */
-inline Congruence
-operator/(const Constraint& c, Coefficient_traits::const_reference m) {
-  Congruence ret(c);
-  ret /= m;
-  return ret;
-}
-
-inline Congruence&
-Congruence::operator/=(Coefficient_traits::const_reference k) {
-  if (k >= 0)
-    modulus_ *= k;
-  else
-    modulus_ *= -k;
-  return *this;
-}
-
-/*! \relates Congruence */
-inline bool
-operator==(const Congruence& x, const Congruence& y) {
-  if (x.space_dimension() != y.space_dimension())
-    return false;
-  Congruence x_temp(x);
-  Congruence y_temp(y);
-  x_temp.strong_normalize();
-  y_temp.strong_normalize();
-  return x_temp.expr.is_equal_to(y_temp.expr)
-    && x_temp.modulus() == y_temp.modulus();
-}
-
-/*! \relates Congruence */
-inline bool
-operator!=(const Congruence& x, const Congruence& y) {
-  return !(x == y);
-}
-
-inline dimension_type
-Congruence::max_space_dimension() {
-  return Linear_Expression::max_space_dimension();
-}
-
-inline dimension_type
-Congruence::space_dimension() const {
-  return expr.space_dimension();
-}
-
-inline Coefficient_traits::const_reference
-Congruence::coefficient(const Variable v) const {
-  if (v.space_dimension() > space_dimension())
-    throw_dimension_incompatible("coefficient(v)", "v", v);
-  return expr.coefficient(v);
-}
-
-inline void
-Congruence::permute_space_dimensions(const std::vector<Variable>& cycles) {
-  expr.permute_space_dimensions(cycles);
-}
-
-inline Coefficient_traits::const_reference
-Congruence::inhomogeneous_term() const {
-  return expr.inhomogeneous_term();
-}
-
-inline Coefficient_traits::const_reference
-Congruence::modulus() const {
-  return modulus_;
-}
-
-inline void
-Congruence::set_modulus(Coefficient_traits::const_reference m) {
-  modulus_ = m;
-  PPL_ASSERT(OK());
-}
-
-inline bool
-Congruence::is_proper_congruence() const {
-  return modulus() > 0;
-}
-
-inline bool
-Congruence::is_equality() const {
-  return modulus() == 0;
-}
-
-inline bool
-Congruence::is_equal_at_dimension(Variable v,
-				  const Congruence& cg) const {
-  return coefficient(v) * cg.modulus() == cg.coefficient(v) * modulus();
-}
-
-inline memory_size_type
-Congruence::external_memory_in_bytes() const {
-  return expr.external_memory_in_bytes()
-         + Parma_Polyhedra_Library::external_memory_in_bytes(modulus_);
-}
-
-inline memory_size_type
-Congruence::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-inline void
-Congruence::m_swap(Congruence& y) {
-  using std::swap;
-  swap(expr, y.expr);
-  swap(modulus_, y.modulus_);
-}
-
-inline void
-Congruence::swap_space_dimensions(Variable v1, Variable v2) {
-  expr.swap_space_dimensions(v1, v2);
-}
-
-/*! \relates Congruence */
-inline void
-swap(Congruence& x, Congruence& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Congruence_inlines_hh)
diff --git a/src/Congruence.types.hh b/src/Congruence.types.hh
deleted file mode 100644
index 37060e2..0000000
--- a/src/Congruence.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Congruence_types_hh
-#define PPL_Congruence_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Congruence;
-
-}
-
-#endif // !defined(PPL_Congruence_types_hh)
diff --git a/src/Congruence_System.cc b/src/Congruence_System.cc
index 9776bc3..f4edb8f 100644
--- a/src/Congruence_System.cc
+++ b/src/Congruence_System.cc
@@ -1,6 +1,6 @@
 /* Congruence_System class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,14 +22,14 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Congruence.defs.hh"
-#include "Grid_Generator.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Congruence_defs.hh"
+#include "Grid_Generator_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
 #include "assert.hh"
 #include <string>
 #include <vector>
@@ -44,7 +44,7 @@ PPL::Congruence_System::Congruence_System(const Constraint_System& cs,
     space_dimension_(cs.space_dimension()),
     representation_(r) {
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     if (i->is_equality())
       insert(*i);
 }
@@ -173,7 +173,7 @@ PPL::Congruence_System::insert(const Congruence_System& y) {
 
 void
 PPL::Congruence_System::normalize_moduli() {
-  Congruence_System& cgs = *this;
+  const Congruence_System& cgs = *this;
   dimension_type row = cgs.num_rows();
   if (row > 0) {
     // Calculate the LCM of all the moduli.
@@ -183,16 +183,16 @@ PPL::Congruence_System::normalize_moduli() {
       --row;
       lcm = cgs[row].modulus();
       if (lcm > 0)
-	break;
+        break;
       if (row == 0)
-	// All rows are equalities.
-	return;
+        // All rows are equalities.
+        return;
     }
     while (row > 0) {
       --row;
       const Coefficient& modulus = cgs[row].modulus();
       if (modulus > 0)
-	lcm_assign(lcm, lcm, modulus);
+        lcm_assign(lcm, lcm, modulus);
     }
 
     // Represent every row using the LCM as the modulus.
@@ -200,7 +200,7 @@ PPL::Congruence_System::normalize_moduli() {
     for (row = num_rows(); row-- > 0; ) {
       const Coefficient& modulus = cgs[row].modulus();
       if (modulus <= 0 || modulus == lcm)
-	continue;
+        continue;
       exact_div_assign(factor, lcm, modulus);
       rows[row].scale(factor);
     }
@@ -263,7 +263,7 @@ satisfies_all_congruences(const Grid_Generator& g) const {
       const Congruence& cg = cgs[i];
       Scalar_Products::assign(sp, g, cg);
       if (sp != 0)
-	return false;
+        return false;
     }
   else {
     const Coefficient& divisor = g.divisor();
@@ -271,11 +271,11 @@ satisfies_all_congruences(const Grid_Generator& g) const {
       const Congruence& cg = cgs[i];
       Scalar_Products::assign(sp, g, cg);
       if (cg.is_equality()) {
-	if (sp != 0)
-	  return false;
+        if (sp != 0)
+          return false;
       }
       else if (sp % (cg.modulus() * divisor) != 0)
-	return false;
+        return false;
     }
   }
   return true;
@@ -300,8 +300,8 @@ PPL::Congruence_System::has_a_free_dimension() const {
 void
 PPL::Congruence_System::
 affine_preimage(Variable v,
-		const Linear_Expression& expr,
-		Coefficient_traits::const_reference denominator) {
+                const Linear_Expression& expr,
+                Coefficient_traits::const_reference denominator) {
   PPL_ASSERT(v.space_dimension() <= space_dimension());
   PPL_ASSERT(expr.space_dimension() <= space_dimension());
   PPL_ASSERT(denominator > 0);
@@ -313,8 +313,8 @@ affine_preimage(Variable v,
 void
 PPL::Congruence_System::ascii_dump(std::ostream& s) const {
   const Congruence_System& x = *this;
-  dimension_type x_num_rows = x.num_rows();
-  dimension_type x_space_dim = x.space_dimension();
+  const dimension_type x_num_rows = x.num_rows();
+  const dimension_type x_space_dim = x.space_dimension();
   s << x_num_rows << " x " << x_space_dim << " ";
   Parma_Polyhedra_Library::ascii_dump(s, representation());
   s << std::endl;
@@ -418,8 +418,9 @@ PPL::operator==(const Congruence_System& x, const Congruence_System& y) {
 }
 
 void
-PPL::Congruence_System::add_unit_rows_and_space_dimensions(dimension_type dims) {
-  dimension_type old_num_rows = num_rows();
+PPL::Congruence_System
+::add_unit_rows_and_space_dimensions(dimension_type dims) {
+  const dimension_type old_num_rows = num_rows();
   set_space_dimension(space_dimension() + dims);
 
   rows.resize(rows.size() + dims);
@@ -448,11 +449,11 @@ PPL::Congruence_System::concatenate(const Congruence_System& y) {
   // TODO: this implementation is just an executable specification.
   Congruence_System cgs = y;
 
-  dimension_type added_rows = cgs.num_rows();
-  dimension_type added_columns = cgs.space_dimension();
+  const dimension_type added_rows = cgs.num_rows();
+  const dimension_type added_columns = cgs.space_dimension();
 
-  dimension_type old_num_rows = num_rows();
-  dimension_type old_space_dim = space_dimension();
+  const dimension_type old_num_rows = num_rows();
+  const dimension_type old_space_dim = space_dimension();
 
   set_space_dimension(space_dimension() + added_columns);
 
diff --git a/src/Congruence_System.defs.hh b/src/Congruence_System.defs.hh
deleted file mode 100644
index caa7dac..0000000
--- a/src/Congruence_System.defs.hh
+++ /dev/null
@@ -1,544 +0,0 @@
-/* Congruence_System class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Congruence_System_defs_hh
-#define PPL_Congruence_System_defs_hh 1
-
-#include "Congruence_System.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint.types.hh"
-#include "Congruence.types.hh"
-#include "Grid_Generator.types.hh"
-#include "Swapping_Vector.defs.hh"
-#include "Congruence.defs.hh"
-#include "Constraint_System.types.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-/*! \relates Congruence_System */
-bool
-operator==(const Congruence_System& x, const Congruence_System& y);
-
-}
-
-//! A system of congruences.
-/*! \ingroup PPL_CXX_interface
-    An object of the class Congruence_System is a system of congruences,
-    i.e., a multiset of objects of the class Congruence.
-    When inserting congruences in a system, space dimensions are
-    automatically adjusted so that all the congruences in the system
-    are defined on the same vector space.
-
-    \par
-    In all the examples it is assumed that variables
-    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
-    \code
-  Variable x(0);
-  Variable y(1);
-    \endcode
-
-    \par Example 1
-    The following code builds a system of congruences corresponding to
-    an integer grid in \f$\Rset^2\f$:
-    \code
-  Congruence_System cgs;
-  cgs.insert(x %= 0);
-  cgs.insert(y %= 0);
-    \endcode
-    Note that:
-    the congruence system is created with space dimension zero;
-    the first and second congruence insertions increase the space
-    dimension to \f$1\f$ and \f$2\f$, respectively.
-
-    \par Example 2
-    By adding to the congruence system of the previous example,
-    the congruence \f$x + y = 1 \pmod{2}\f$:
-    \code
-  cgs.insert((x + y %= 1) / 2);
-    \endcode
-    we obtain the grid containing just those integral
-    points where the sum of the \p x and \p y values is odd.
-
-    \par Example 3
-    The following code builds a system of congruences corresponding to
-    the grid in \f$\Zset^2\f$ containing just the integral points on
-    the \p x axis:
-    \code
-  Congruence_System cgs;
-  cgs.insert(x %= 0);
-  cgs.insert((y %= 0) / 0);
-    \endcode
-
-    \note
-    After inserting a multiset of congruences in a congruence system,
-    there are no guarantees that an <EM>exact</EM> copy of them
-    can be retrieved:
-    in general, only an <EM>equivalent</EM> congruence system
-    will be available, where original congruences may have been
-    reordered, removed (if they are trivial, duplicate or
-    implied by other congruences), linearly combined, etc.
-*/
-class Parma_Polyhedra_Library::Congruence_System {
-public:
-
-  typedef Congruence row_type;
-
-  static const Representation default_representation = SPARSE;
-
-  //! Default constructor: builds an empty system of congruences.
-  explicit Congruence_System(Representation r = default_representation);
-
-  //! Builds an empty (i.e. zero rows) system of dimension \p d.
-  explicit Congruence_System(dimension_type d,
-                             Representation r = default_representation);
-
-  //! Builds the singleton system containing only congruence \p cg.
-  explicit Congruence_System(const Congruence& cg,
-                             Representation r = default_representation);
-
-  /*! \brief
-    If \p c represents the constraint \f$ e_1 = e_2 \f$, builds the
-    singleton system containing only constraint \f$ e_1 = e_2
-    \pmod{0}\f$.
-
-    \exception std::invalid_argument
-    Thrown if \p c is not an equality constraint.
-  */
-  explicit Congruence_System(const Constraint& c,
-                             Representation r = default_representation);
-
-  //! Builds a system containing copies of any equalities in \p cs.
-  explicit Congruence_System(const Constraint_System& cs,
-                             Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  /*!
-    \note
-    The new Congruence_System will have the same Representation as `cgs'
-    so that it's indistinguishable from `cgs'.
-  */
-  Congruence_System(const Congruence_System& cgs);
-
-  //! Copy constructor with specified representation.
-  Congruence_System(const Congruence_System& cgs, Representation r);
-
-  //! Destructor.
-  ~Congruence_System();
-
-  //! Assignment operator.
-  Congruence_System& operator=(const Congruence_System& y);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Congruence_System can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is exactly equal
-    to \p y.
-  */
-  bool is_equal_to(const Congruence_System& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this contains one or
-    more linear equalities.
-  */
-  bool has_linear_equalities() const;
-
-  //! Removes all the congruences and sets the space dimension to 0.
-  void clear();
-
-  /*! \brief
-    Inserts in \p *this a copy of the congruence \p cg, increasing the
-    number of space dimensions if needed.
-
-    The copy of \p cg will be strongly normalized after being
-    inserted.
-  */
-  void insert(const Congruence& cg);
-
-  /*! \brief
-    Inserts in \p *this the congruence \p cg, stealing its contents and
-    increasing the number of space dimensions if needed.
-
-    \p cg will be strongly normalized.
-  */
-  void insert(Congruence& cg, Recycle_Input);
-
-  /*! \brief
-    Inserts in \p *this a copy of the equality constraint \p c, seen
-    as a modulo 0 congruence, increasing the number of space
-    dimensions if needed.
-
-    The modulo 0 congruence will be strongly normalized after being
-    inserted.
-
-    \exception std::invalid_argument
-    Thrown if \p c is a relational constraint.
-  */
-  void insert(const Constraint& c);
-
-  // TODO: Consider adding a insert(cg, Recycle_Input).
-
-  /*! \brief
-    Inserts in \p *this a copy of the congruences in \p y,
-    increasing the number of space dimensions if needed.
-
-    The inserted copies will be strongly normalized.
-  */
-  void insert(const Congruence_System& y);
-
-  /*! \brief
-    Inserts into \p *this the congruences in \p cgs, increasing the
-    number of space dimensions if needed.
-  */
-  void insert(Congruence_System& cgs, Recycle_Input);
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  //! Returns the system containing only Congruence::zero_dim_false().
-  static const Congruence_System& zero_dim_empty();
-
-  //! An iterator over a system of congruences.
-  /*! \ingroup PPL_CXX_interface
-    A const_iterator is used to provide read-only access
-    to each congruence contained in an object of Congruence_System.
-
-    \par Example
-    The following code prints the system of congruences
-    defining the grid <CODE>gr</CODE>:
-    \code
-  const Congruence_System& cgs = gr.congruences();
-  for (Congruence_System::const_iterator i = cgs.begin(),
-         cgs_end = cgs.end(); i != cgs_end; ++i)
-    cout << *i << endl;
-    \endcode
-  */
-  class const_iterator
-    : public std::iterator<std::forward_iterator_tag,
-			   Congruence,
-			   ptrdiff_t,
-			   const Congruence*,
-			   const Congruence&> {
-  public:
-    //! Default constructor.
-    const_iterator();
-
-    //! Ordinary copy constructor.
-    const_iterator(const const_iterator& y);
-
-    //! Destructor.
-    ~const_iterator();
-
-    //! Assignment operator.
-    const_iterator& operator=(const const_iterator& y);
-
-    //! Dereference operator.
-    const Congruence& operator*() const;
-
-    //! Indirect member selector.
-    const Congruence* operator->() const;
-
-    //! Prefix increment operator.
-    const_iterator& operator++();
-
-    //! Postfix increment operator.
-    const_iterator operator++(int);
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this and \p y are
-      identical.
-    */
-    bool operator==(const const_iterator& y) const;
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this and \p y are
-      different.
-    */
-    bool operator!=(const const_iterator& y) const;
-
-  private:
-    friend class Congruence_System;
-
-    //! The const iterator over the vector of congruences.
-    Swapping_Vector<Congruence>::const_iterator i;
-
-    //! A const pointer to the vector of congruences.
-    const Swapping_Vector<Congruence>* csp;
-
-    //! Constructor.
-    const_iterator(const Swapping_Vector<Congruence>::const_iterator& iter,
-		   const Congruence_System& cgs);
-
-    //! \p *this skips to the next non-trivial congruence.
-    void skip_forward();
-  };
-
-  //! Returns <CODE>true</CODE> if and only if \p *this has no congruences.
-  bool empty() const;
-
-  /*! \brief
-    Returns the const_iterator pointing to the first congruence, if \p
-    *this is not empty; otherwise, returns the past-the-end
-    const_iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const_iterator.
-  const_iterator end() const;
-
-  //! Checks if all the invariants are satisfied.
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*!
-    Returns <CODE>true</CODE> if and only if all rows have space dimension
-    space_dimension_, each row in the system is a valid Congruence and the
-    space dimension is consistent with the number of congruences.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Returns the number of equalities.
-  dimension_type num_equalities() const;
-
-  //! Returns the number of proper congruences.
-  dimension_type num_proper_congruences() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Congruence_System& y);
-
-  /*! \brief
-    Adds \p dims rows and \p dims space dimensions to the matrix,
-    initializing the added rows as in the unit congruence system.
-
-    \param dims
-    The number of rows and space dimensions to be added: must be strictly
-    positive.
-
-    Turns the \f$r \times c\f$ matrix \f$A\f$ into the \f$(r+dims) \times
-    (c+dims)\f$ matrix
-    \f$\bigl(\genfrac{}{}{0pt}{}{0}{A} \genfrac{}{}{0pt}{}{B}{A}\bigr)\f$
-    where \f$B\f$ is the \f$dims \times dims\f$ unit matrix of the form
-    \f$\bigl(\genfrac{}{}{0pt}{}{0}{1} \genfrac{}{}{0pt}{}{1}{0}\bigr)\f$.
-    The matrix is expanded avoiding reallocation whenever possible.
-  */
-  void add_unit_rows_and_space_dimensions(dimension_type dims);
-
-  //! Permutes the space dimensions of the system.
-  /*!
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    columns must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Swaps the columns having indexes \p i and \p j.
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Sets the number of space dimensions to \p new_space_dim.
-  /*!
-    If \p new_space_dim is lower than the current space dimension, the
-    coefficients referring to the removed space dimensions are lost.
-  */
-  bool set_space_dimension(dimension_type new_space_dim);
-
-  // Note: the following method is protected to allow tests/Grid/congruences2
-  // to call it using a derived class.
-protected:
-  //! Returns <CODE>true</CODE> if \p g satisfies all the congruences.
-  bool satisfies_all_congruences(const Grid_Generator& g) const;
-
-private:
-  //! Returns the number of rows in the system.
-  dimension_type num_rows() const;
-
-  //! Returns \c true if num_rows()==0.
-  bool has_no_rows() const;
-
-  //! Returns a constant reference to the \p k- th congruence of the system.
-  const Congruence& operator[](dimension_type k) const;
-
-  //! Adjusts all expressions to have the same moduli.
-  void normalize_moduli();
-
-  /*! \brief
-    Substitutes a given column of coefficients by a given affine
-    expression.
-
-    \param v
-    Index of the column to which the affine transformation is
-    substituted;
-
-    \param expr
-    The numerator of the affine transformation:
-    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
-
-    \param denominator
-    The denominator of the affine transformation.
-
-    We allow affine transformations (see the Section \ref
-    rational_grid_operations) to have rational
-    coefficients. Since the coefficients of linear expressions are
-    integers we also provide an integer \p denominator that will
-    be used as denominator of the affine transformation.  The
-    denominator is required to be a positive integer and its default value
-    is 1.
-
-    The affine transformation substitutes the matrix of congruences
-    by a new matrix whose elements \f${a'}_{ij}\f$ are built from
-    the old one \f$a_{ij}\f$ as follows:
-    \f[
-      {a'}_{ij} =
-        \begin{cases}
-          a_{ij} * \mathrm{denominator} + a_{iv} * \mathrm{expr}[j]
-            \quad \text{for } j \neq v; \\
-          \mathrm{expr}[v] * a_{iv}
-            \quad \text{for } j = v.
-        \end{cases}
-    \f]
-
-    \p expr is a constant parameter and unaltered by this computation.
-  */
-  void affine_preimage(Variable v,
-                       const Linear_Expression& expr,
-                       Coefficient_traits::const_reference denominator);
-
-  // TODO: Consider making this private.
-  /*! \brief
-    Concatenates copies of the congruences from \p y onto \p *this.
-
-    \param y
-    The congruence system to append to \p this.  The number of rows in
-    \p y must be strictly positive.
-
-    The matrix for the new system of congruences is obtained by
-    leaving the old system in the upper left-hand side and placing the
-    congruences of \p y in the lower right-hand side, and padding
-    with zeroes.
-  */
-  void concatenate(const Congruence_System& y);
-
-  /*! \brief
-    Inserts in \p *this the congruence \p cg, stealing its contents and
-    increasing the number of space dimensions if needed.
-
-    This method inserts \p cg in the given form, instead of first strong
-    normalizing \p cg as \ref insert would do.
-  */
-  void insert_verbatim(Congruence& cg, Recycle_Input);
-
-  //! Makes the system shrink by removing the rows in [first,last).
-  /*!
-    If \p keep_sorted is <CODE>true</CODE>, the ordering of the remaining rows
-    will be preserved.
-  */
-  void remove_rows(dimension_type first, dimension_type last,
-                   bool keep_sorted);
-
-  void remove_trailing_rows(dimension_type n);
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the singleton system containing only Congruence::zero_dim_false().
-  */
-  static const Congruence_System* zero_dim_empty_p;
-
-  Swapping_Vector<Congruence> rows;
-
-  dimension_type space_dimension_;
-
-  Representation representation_;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if any of the dimensions in
-    \p *this is free of constraint.
-
-    Any equality or proper congruence affecting a dimension constrains
-    that dimension.
-
-    This method assumes the system is in minimal form.
-  */
-  bool has_a_free_dimension() const;
-
-  friend class Grid;
-
-  friend bool
-  operator==(const Congruence_System& x, const Congruence_System& y);
-};
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Congruence_System
-  Writes <CODE>true</CODE> if \p cgs is empty.  Otherwise, writes on
-  \p s the congruences of \p cgs, all in one row and separated by ", ".
-*/
-std::ostream&
-operator<<(std::ostream& s, const Congruence_System& cgs);
-
-} // namespace IO_Operators
-
-/*! \relates Congruence_System */
-void
-swap(Congruence_System& x, Congruence_System& y);
-
-} // namespace Parma_Polyhedra_Library
-
-// Congruence_System.inlines.hh is not included here on purpose.
-
-#endif // !defined(PPL_Congruence_System_defs_hh)
diff --git a/src/Congruence_System.inlines.hh b/src/Congruence_System.inlines.hh
deleted file mode 100644
index 8d1432d..0000000
--- a/src/Congruence_System.inlines.hh
+++ /dev/null
@@ -1,272 +0,0 @@
-/* Congruence_System class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Congruence_System_inlines_hh
-#define PPL_Congruence_System_inlines_hh 1
-
-#include "Congruence.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline const Congruence&
-Congruence_System::operator[](const dimension_type k) const {
-  return rows[k];
-}
-
-inline dimension_type
-Congruence_System::num_rows() const {
-  return rows.size();
-}
-
-inline bool
-Congruence_System::has_no_rows() const {
-  return num_rows() == 0;
-}
-
-inline void
-Congruence_System::remove_trailing_rows(dimension_type n) {
-  PPL_ASSERT(num_rows() >= n);
-  rows.resize(num_rows() - n);
-}
-
-inline void
-Congruence_System::insert(const Congruence& cg) {
-  Congruence tmp = cg;
-  insert(tmp, Recycle_Input());
-}
-
-inline void
-Congruence_System::insert(Congruence& cg, Recycle_Input) {
-  PPL_ASSERT(cg.OK());
-  cg.strong_normalize();
-  PPL_ASSERT(cg.OK());
-  insert_verbatim(cg, Recycle_Input());
-  PPL_ASSERT(OK());
-}
-
-inline
-Congruence_System::Congruence_System(Representation r)
-  : rows(),
-    space_dimension_(0),
-    representation_(r) {
-}
-
-inline
-Congruence_System::Congruence_System(const Congruence& cg, Representation r)
-  : rows(),
-    space_dimension_(0),
-    representation_(r) {
-  insert(cg);
-}
-
-inline
-Congruence_System::Congruence_System(const Constraint& c, Representation r)
-  : rows(),
-    space_dimension_(0),
-    representation_(r) {
-  insert(c);
-}
-
-inline
-Congruence_System::Congruence_System(const Congruence_System& cgs)
-  : rows(cgs.rows),
-    space_dimension_(cgs.space_dimension_),
-    representation_(cgs.representation_) {
-}
-
-inline
-Congruence_System::Congruence_System(const Congruence_System& cgs,
-                                     Representation r)
-  : rows(cgs.rows),
-    space_dimension_(cgs.space_dimension_),
-    representation_(r) {
-  if (cgs.representation() != r) {
-    for (dimension_type i = 0; i < num_rows(); ++i)
-      rows[i].set_representation(representation());
-  }
-}
-
-inline
-Congruence_System::Congruence_System(const dimension_type d, Representation r)
-  : rows(),
-    space_dimension_(d),
-    representation_(r) {
-}
-
-inline
-Congruence_System::~Congruence_System() {
-}
-
-inline Congruence_System&
-Congruence_System::operator=(const Congruence_System& y) {
-  Congruence_System tmp = y;
-  swap(*this, tmp);
-  return *this;
-}
-
-inline Representation
-Congruence_System::representation() const {
-  return representation_;
-}
-
-inline void
-Congruence_System::set_representation(Representation r) {
-  if (representation_ == r)
-    return;
-  representation_ = r;
-  for (dimension_type i = 0; i < num_rows(); ++i)
-    rows[i].set_representation(r);
-  PPL_ASSERT(OK());
-}
-
-inline dimension_type
-Congruence_System::max_space_dimension() {
-  return Congruence::max_space_dimension();
-}
-
-inline dimension_type
-Congruence_System::space_dimension() const {
-  return space_dimension_;
-}
-
-inline void
-Congruence_System::clear() {
-  rows.clear();
-  space_dimension_ = 0;
-}
-
-inline const Congruence_System&
-Congruence_System::zero_dim_empty() {
-  PPL_ASSERT(zero_dim_empty_p != 0);
-  return *zero_dim_empty_p;
-}
-
-inline
-Congruence_System::const_iterator::const_iterator()
-  : i(), csp(0) {
-}
-
-inline
-Congruence_System::const_iterator::const_iterator(const const_iterator& y)
-  : i(y.i), csp(y.csp) {
-}
-
-inline
-Congruence_System::const_iterator::~const_iterator() {
-}
-
-inline Congruence_System::const_iterator&
-Congruence_System::const_iterator::operator=(const const_iterator& y) {
-  i = y.i;
-  csp = y.csp;
-  return *this;
-}
-
-inline const Congruence&
-Congruence_System::const_iterator::operator*() const {
-  return *i;
-}
-
-inline const Congruence*
-Congruence_System::const_iterator::operator->() const {
-  return i.operator->();
-}
-
-inline Congruence_System::const_iterator&
-Congruence_System::const_iterator::operator++() {
-  ++i;
-  skip_forward();
-  return *this;
-}
-
-inline Congruence_System::const_iterator
-Congruence_System::const_iterator::operator++(int) {
-  const const_iterator tmp = *this;
-  operator++();
-  return tmp;
-}
-
-inline bool
-Congruence_System::const_iterator::operator==(const const_iterator& y) const {
-  return i == y.i;
-}
-
-inline bool
-Congruence_System::const_iterator::operator!=(const const_iterator& y) const {
-  return i != y.i;
-}
-
-inline
-Congruence_System::const_iterator::
-const_iterator(const Swapping_Vector<Congruence>::const_iterator& iter,
-	       const Congruence_System& cgs)
-  : i(iter), csp(&cgs.rows) {
-}
-
-inline Congruence_System::const_iterator
-Congruence_System::begin() const {
-  const_iterator i(rows.begin(), *this);
-  i.skip_forward();
-  return i;
-}
-
-inline Congruence_System::const_iterator
-Congruence_System::end() const {
-  const const_iterator i(rows.end(), *this);
-  return i;
-}
-
-inline bool
-Congruence_System::empty() const {
-  return begin() == end();
-}
-
-inline void
-Congruence_System::m_swap(Congruence_System& y) {
-  using std::swap;
-  swap(rows, y.rows);
-  swap(space_dimension_, y.space_dimension_);
-  swap(representation_, y.representation_);
-  PPL_ASSERT(OK());
-  PPL_ASSERT(y.OK());
-}
-
-inline memory_size_type
-Congruence_System::external_memory_in_bytes() const {
-  return rows.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Congruence_System::total_memory_in_bytes() const {
-  return rows.external_memory_in_bytes() + sizeof(*this);
-}
-
-/*! \relates Congruence_System */
-inline void
-swap(Congruence_System& x, Congruence_System& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Congruence_System_inlines_hh)
diff --git a/src/Congruence_System.types.hh b/src/Congruence_System.types.hh
deleted file mode 100644
index e2526f9..0000000
--- a/src/Congruence_System.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Congruence_System_types_hh
-#define PPL_Congruence_System_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Congruence_System;
-
-}
-
-#endif // !defined(PPL_Congruence_System_types_hh)
diff --git a/src/Congruence_System_defs.hh b/src/Congruence_System_defs.hh
new file mode 100644
index 0000000..18296dc
--- /dev/null
+++ b/src/Congruence_System_defs.hh
@@ -0,0 +1,544 @@
+/* Congruence_System class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Congruence_System_defs_hh
+#define PPL_Congruence_System_defs_hh 1
+
+#include "Congruence_System_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_types.hh"
+#include "Congruence_types.hh"
+#include "Grid_Generator_types.hh"
+#include "Swapping_Vector_defs.hh"
+#include "Congruence_defs.hh"
+#include "Constraint_System_types.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+/*! \relates Congruence_System */
+bool
+operator==(const Congruence_System& x, const Congruence_System& y);
+
+}
+
+//! A system of congruences.
+/*! \ingroup PPL_CXX_interface
+    An object of the class Congruence_System is a system of congruences,
+    i.e., a multiset of objects of the class Congruence.
+    When inserting congruences in a system, space dimensions are
+    automatically adjusted so that all the congruences in the system
+    are defined on the same vector space.
+
+    \par
+    In all the examples it is assumed that variables
+    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
+    \code
+  Variable x(0);
+  Variable y(1);
+    \endcode
+
+    \par Example 1
+    The following code builds a system of congruences corresponding to
+    an integer grid in \f$\Rset^2\f$:
+    \code
+  Congruence_System cgs;
+  cgs.insert(x %= 0);
+  cgs.insert(y %= 0);
+    \endcode
+    Note that:
+    the congruence system is created with space dimension zero;
+    the first and second congruence insertions increase the space
+    dimension to \f$1\f$ and \f$2\f$, respectively.
+
+    \par Example 2
+    By adding to the congruence system of the previous example,
+    the congruence \f$x + y = 1 \pmod{2}\f$:
+    \code
+  cgs.insert((x + y %= 1) / 2);
+    \endcode
+    we obtain the grid containing just those integral
+    points where the sum of the \p x and \p y values is odd.
+
+    \par Example 3
+    The following code builds a system of congruences corresponding to
+    the grid in \f$\Zset^2\f$ containing just the integral points on
+    the \p x axis:
+    \code
+  Congruence_System cgs;
+  cgs.insert(x %= 0);
+  cgs.insert((y %= 0) / 0);
+    \endcode
+
+    \note
+    After inserting a multiset of congruences in a congruence system,
+    there are no guarantees that an <EM>exact</EM> copy of them
+    can be retrieved:
+    in general, only an <EM>equivalent</EM> congruence system
+    will be available, where original congruences may have been
+    reordered, removed (if they are trivial, duplicate or
+    implied by other congruences), linearly combined, etc.
+*/
+class Parma_Polyhedra_Library::Congruence_System {
+public:
+
+  typedef Congruence row_type;
+
+  static const Representation default_representation = SPARSE;
+
+  //! Default constructor: builds an empty system of congruences.
+  explicit Congruence_System(Representation r = default_representation);
+
+  //! Builds an empty (i.e. zero rows) system of dimension \p d.
+  explicit Congruence_System(dimension_type d,
+                             Representation r = default_representation);
+
+  //! Builds the singleton system containing only congruence \p cg.
+  explicit Congruence_System(const Congruence& cg,
+                             Representation r = default_representation);
+
+  /*! \brief
+    If \p c represents the constraint \f$ e_1 = e_2 \f$, builds the
+    singleton system containing only constraint \f$ e_1 = e_2
+    \pmod{0}\f$.
+
+    \exception std::invalid_argument
+    Thrown if \p c is not an equality constraint.
+  */
+  explicit Congruence_System(const Constraint& c,
+                             Representation r = default_representation);
+
+  //! Builds a system containing copies of any equalities in \p cs.
+  explicit Congruence_System(const Constraint_System& cs,
+                             Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  /*!
+    \note
+    The new Congruence_System will have the same Representation as `cgs'
+    so that it's indistinguishable from `cgs'.
+  */
+  Congruence_System(const Congruence_System& cgs);
+
+  //! Copy constructor with specified representation.
+  Congruence_System(const Congruence_System& cgs, Representation r);
+
+  //! Destructor.
+  ~Congruence_System();
+
+  //! Assignment operator.
+  Congruence_System& operator=(const Congruence_System& y);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Congruence_System can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is exactly equal
+    to \p y.
+  */
+  bool is_equal_to(const Congruence_System& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this contains one or
+    more linear equalities.
+  */
+  bool has_linear_equalities() const;
+
+  //! Removes all the congruences and sets the space dimension to 0.
+  void clear();
+
+  /*! \brief
+    Inserts in \p *this a copy of the congruence \p cg, increasing the
+    number of space dimensions if needed.
+
+    The copy of \p cg will be strongly normalized after being
+    inserted.
+  */
+  void insert(const Congruence& cg);
+
+  /*! \brief
+    Inserts in \p *this the congruence \p cg, stealing its contents and
+    increasing the number of space dimensions if needed.
+
+    \p cg will be strongly normalized.
+  */
+  void insert(Congruence& cg, Recycle_Input);
+
+  /*! \brief
+    Inserts in \p *this a copy of the equality constraint \p c, seen
+    as a modulo 0 congruence, increasing the number of space
+    dimensions if needed.
+
+    The modulo 0 congruence will be strongly normalized after being
+    inserted.
+
+    \exception std::invalid_argument
+    Thrown if \p c is a relational constraint.
+  */
+  void insert(const Constraint& c);
+
+  // TODO: Consider adding a insert(cg, Recycle_Input).
+
+  /*! \brief
+    Inserts in \p *this a copy of the congruences in \p y,
+    increasing the number of space dimensions if needed.
+
+    The inserted copies will be strongly normalized.
+  */
+  void insert(const Congruence_System& y);
+
+  /*! \brief
+    Inserts into \p *this the congruences in \p cgs, increasing the
+    number of space dimensions if needed.
+  */
+  void insert(Congruence_System& cgs, Recycle_Input);
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  //! Returns the system containing only Congruence::zero_dim_false().
+  static const Congruence_System& zero_dim_empty();
+
+  //! An iterator over a system of congruences.
+  /*! \ingroup PPL_CXX_interface
+    A const_iterator is used to provide read-only access
+    to each congruence contained in an object of Congruence_System.
+
+    \par Example
+    The following code prints the system of congruences
+    defining the grid <CODE>gr</CODE>:
+    \code
+  const Congruence_System& cgs = gr.congruences();
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); i != cgs_end; ++i)
+    cout << *i << endl;
+    \endcode
+  */
+  class const_iterator
+    : public std::iterator<std::forward_iterator_tag,
+                           Congruence,
+                           ptrdiff_t,
+                           const Congruence*,
+                           const Congruence&> {
+  public:
+    //! Default constructor.
+    const_iterator();
+
+    //! Ordinary copy constructor.
+    const_iterator(const const_iterator& y);
+
+    //! Destructor.
+    ~const_iterator();
+
+    //! Assignment operator.
+    const_iterator& operator=(const const_iterator& y);
+
+    //! Dereference operator.
+    const Congruence& operator*() const;
+
+    //! Indirect member selector.
+    const Congruence* operator->() const;
+
+    //! Prefix increment operator.
+    const_iterator& operator++();
+
+    //! Postfix increment operator.
+    const_iterator operator++(int);
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this and \p y are
+      identical.
+    */
+    bool operator==(const const_iterator& y) const;
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this and \p y are
+      different.
+    */
+    bool operator!=(const const_iterator& y) const;
+
+  private:
+    friend class Congruence_System;
+
+    //! The const iterator over the vector of congruences.
+    Swapping_Vector<Congruence>::const_iterator i;
+
+    //! A const pointer to the vector of congruences.
+    const Swapping_Vector<Congruence>* csp;
+
+    //! Constructor.
+    const_iterator(const Swapping_Vector<Congruence>::const_iterator& iter,
+                   const Congruence_System& cgs);
+
+    //! \p *this skips to the next non-trivial congruence.
+    void skip_forward();
+  };
+
+  //! Returns <CODE>true</CODE> if and only if \p *this has no congruences.
+  bool empty() const;
+
+  /*! \brief
+    Returns the const_iterator pointing to the first congruence, if \p
+    *this is not empty; otherwise, returns the past-the-end
+    const_iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const_iterator.
+  const_iterator end() const;
+
+  //! Checks if all the invariants are satisfied.
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*!
+    Returns <CODE>true</CODE> if and only if all rows have space dimension
+    space_dimension_, each row in the system is a valid Congruence and the
+    space dimension is consistent with the number of congruences.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Returns the number of equalities.
+  dimension_type num_equalities() const;
+
+  //! Returns the number of proper congruences.
+  dimension_type num_proper_congruences() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Congruence_System& y);
+
+  /*! \brief
+    Adds \p dims rows and \p dims space dimensions to the matrix,
+    initializing the added rows as in the unit congruence system.
+
+    \param dims
+    The number of rows and space dimensions to be added: must be strictly
+    positive.
+
+    Turns the \f$r \times c\f$ matrix \f$A\f$ into the \f$(r+dims) \times
+    (c+dims)\f$ matrix
+    \f$\bigl(\genfrac{}{}{0pt}{}{0}{A} \genfrac{}{}{0pt}{}{B}{A}\bigr)\f$
+    where \f$B\f$ is the \f$dims \times dims\f$ unit matrix of the form
+    \f$\bigl(\genfrac{}{}{0pt}{}{0}{1} \genfrac{}{}{0pt}{}{1}{0}\bigr)\f$.
+    The matrix is expanded avoiding reallocation whenever possible.
+  */
+  void add_unit_rows_and_space_dimensions(dimension_type dims);
+
+  //! Permutes the space dimensions of the system.
+  /*!
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    columns must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Swaps the columns having indexes \p i and \p j.
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Sets the number of space dimensions to \p new_space_dim.
+  /*!
+    If \p new_space_dim is lower than the current space dimension, the
+    coefficients referring to the removed space dimensions are lost.
+  */
+  bool set_space_dimension(dimension_type new_space_dim);
+
+  // Note: the following method is protected to allow tests/Grid/congruences2
+  // to call it using a derived class.
+protected:
+  //! Returns <CODE>true</CODE> if \p g satisfies all the congruences.
+  bool satisfies_all_congruences(const Grid_Generator& g) const;
+
+private:
+  //! Returns the number of rows in the system.
+  dimension_type num_rows() const;
+
+  //! Returns \c true if num_rows()==0.
+  bool has_no_rows() const;
+
+  //! Returns a constant reference to the \p k- th congruence of the system.
+  const Congruence& operator[](dimension_type k) const;
+
+  //! Adjusts all expressions to have the same moduli.
+  void normalize_moduli();
+
+  /*! \brief
+    Substitutes a given column of coefficients by a given affine
+    expression.
+
+    \param v
+    Index of the column to which the affine transformation is
+    substituted;
+
+    \param expr
+    The numerator of the affine transformation:
+    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
+
+    \param denominator
+    The denominator of the affine transformation.
+
+    We allow affine transformations (see the Section \ref
+    rational_grid_operations) to have rational
+    coefficients. Since the coefficients of linear expressions are
+    integers we also provide an integer \p denominator that will
+    be used as denominator of the affine transformation.  The
+    denominator is required to be a positive integer and its default value
+    is 1.
+
+    The affine transformation substitutes the matrix of congruences
+    by a new matrix whose elements \f${a'}_{ij}\f$ are built from
+    the old one \f$a_{ij}\f$ as follows:
+    \f[
+      {a'}_{ij} =
+        \begin{cases}
+          a_{ij} * \mathrm{denominator} + a_{iv} * \mathrm{expr}[j]
+            \quad \text{for } j \neq v; \\
+          \mathrm{expr}[v] * a_{iv}
+            \quad \text{for } j = v.
+        \end{cases}
+    \f]
+
+    \p expr is a constant parameter and unaltered by this computation.
+  */
+  void affine_preimage(Variable v,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator);
+
+  // TODO: Consider making this private.
+  /*! \brief
+    Concatenates copies of the congruences from \p y onto \p *this.
+
+    \param y
+    The congruence system to append to \p this.  The number of rows in
+    \p y must be strictly positive.
+
+    The matrix for the new system of congruences is obtained by
+    leaving the old system in the upper left-hand side and placing the
+    congruences of \p y in the lower right-hand side, and padding
+    with zeroes.
+  */
+  void concatenate(const Congruence_System& y);
+
+  /*! \brief
+    Inserts in \p *this the congruence \p cg, stealing its contents and
+    increasing the number of space dimensions if needed.
+
+    This method inserts \p cg in the given form, instead of first strong
+    normalizing \p cg as \ref insert would do.
+  */
+  void insert_verbatim(Congruence& cg, Recycle_Input);
+
+  //! Makes the system shrink by removing the rows in [first,last).
+  /*!
+    If \p keep_sorted is <CODE>true</CODE>, the ordering of the remaining rows
+    will be preserved.
+  */
+  void remove_rows(dimension_type first, dimension_type last,
+                   bool keep_sorted);
+
+  void remove_trailing_rows(dimension_type n);
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the singleton system containing only Congruence::zero_dim_false().
+  */
+  static const Congruence_System* zero_dim_empty_p;
+
+  Swapping_Vector<Congruence> rows;
+
+  dimension_type space_dimension_;
+
+  Representation representation_;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if any of the dimensions in
+    \p *this is free of constraint.
+
+    Any equality or proper congruence affecting a dimension constrains
+    that dimension.
+
+    This method assumes the system is in minimal form.
+  */
+  bool has_a_free_dimension() const;
+
+  friend class Grid;
+
+  friend bool
+  operator==(const Congruence_System& x, const Congruence_System& y);
+};
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Congruence_System
+  Writes <CODE>true</CODE> if \p cgs is empty.  Otherwise, writes on
+  \p s the congruences of \p cgs, all in one row and separated by ", ".
+*/
+std::ostream&
+operator<<(std::ostream& s, const Congruence_System& cgs);
+
+} // namespace IO_Operators
+
+/*! \relates Congruence_System */
+void
+swap(Congruence_System& x, Congruence_System& y);
+
+} // namespace Parma_Polyhedra_Library
+
+// Congruence_System_inlines.hh is not included here on purpose.
+
+#endif // !defined(PPL_Congruence_System_defs_hh)
diff --git a/src/Congruence_System_inlines.hh b/src/Congruence_System_inlines.hh
new file mode 100644
index 0000000..c63fb1f
--- /dev/null
+++ b/src/Congruence_System_inlines.hh
@@ -0,0 +1,272 @@
+/* Congruence_System class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Congruence_System_inlines_hh
+#define PPL_Congruence_System_inlines_hh 1
+
+#include "Congruence_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline const Congruence&
+Congruence_System::operator[](const dimension_type k) const {
+  return rows[k];
+}
+
+inline dimension_type
+Congruence_System::num_rows() const {
+  return rows.size();
+}
+
+inline bool
+Congruence_System::has_no_rows() const {
+  return num_rows() == 0;
+}
+
+inline void
+Congruence_System::remove_trailing_rows(dimension_type n) {
+  PPL_ASSERT(num_rows() >= n);
+  rows.resize(num_rows() - n);
+}
+
+inline void
+Congruence_System::insert(const Congruence& cg) {
+  Congruence tmp = cg;
+  insert(tmp, Recycle_Input());
+}
+
+inline void
+Congruence_System::insert(Congruence& cg, Recycle_Input) {
+  PPL_ASSERT(cg.OK());
+  cg.strong_normalize();
+  PPL_ASSERT(cg.OK());
+  insert_verbatim(cg, Recycle_Input());
+  PPL_ASSERT(OK());
+}
+
+inline
+Congruence_System::Congruence_System(Representation r)
+  : rows(),
+    space_dimension_(0),
+    representation_(r) {
+}
+
+inline
+Congruence_System::Congruence_System(const Congruence& cg, Representation r)
+  : rows(),
+    space_dimension_(0),
+    representation_(r) {
+  insert(cg);
+}
+
+inline
+Congruence_System::Congruence_System(const Constraint& c, Representation r)
+  : rows(),
+    space_dimension_(0),
+    representation_(r) {
+  insert(c);
+}
+
+inline
+Congruence_System::Congruence_System(const Congruence_System& cgs)
+  : rows(cgs.rows),
+    space_dimension_(cgs.space_dimension_),
+    representation_(cgs.representation_) {
+}
+
+inline
+Congruence_System::Congruence_System(const Congruence_System& cgs,
+                                     Representation r)
+  : rows(cgs.rows),
+    space_dimension_(cgs.space_dimension_),
+    representation_(r) {
+  if (cgs.representation() != r) {
+    for (dimension_type i = 0; i < num_rows(); ++i)
+      rows[i].set_representation(representation());
+  }
+}
+
+inline
+Congruence_System::Congruence_System(const dimension_type d, Representation r)
+  : rows(),
+    space_dimension_(d),
+    representation_(r) {
+}
+
+inline
+Congruence_System::~Congruence_System() {
+}
+
+inline Congruence_System&
+Congruence_System::operator=(const Congruence_System& y) {
+  Congruence_System tmp = y;
+  swap(*this, tmp);
+  return *this;
+}
+
+inline Representation
+Congruence_System::representation() const {
+  return representation_;
+}
+
+inline void
+Congruence_System::set_representation(Representation r) {
+  if (representation_ == r)
+    return;
+  representation_ = r;
+  for (dimension_type i = 0; i < num_rows(); ++i)
+    rows[i].set_representation(r);
+  PPL_ASSERT(OK());
+}
+
+inline dimension_type
+Congruence_System::max_space_dimension() {
+  return Congruence::max_space_dimension();
+}
+
+inline dimension_type
+Congruence_System::space_dimension() const {
+  return space_dimension_;
+}
+
+inline void
+Congruence_System::clear() {
+  rows.clear();
+  space_dimension_ = 0;
+}
+
+inline const Congruence_System&
+Congruence_System::zero_dim_empty() {
+  PPL_ASSERT(zero_dim_empty_p != 0);
+  return *zero_dim_empty_p;
+}
+
+inline
+Congruence_System::const_iterator::const_iterator()
+  : i(), csp(0) {
+}
+
+inline
+Congruence_System::const_iterator::const_iterator(const const_iterator& y)
+  : i(y.i), csp(y.csp) {
+}
+
+inline
+Congruence_System::const_iterator::~const_iterator() {
+}
+
+inline Congruence_System::const_iterator&
+Congruence_System::const_iterator::operator=(const const_iterator& y) {
+  i = y.i;
+  csp = y.csp;
+  return *this;
+}
+
+inline const Congruence&
+Congruence_System::const_iterator::operator*() const {
+  return *i;
+}
+
+inline const Congruence*
+Congruence_System::const_iterator::operator->() const {
+  return i.operator->();
+}
+
+inline Congruence_System::const_iterator&
+Congruence_System::const_iterator::operator++() {
+  ++i;
+  skip_forward();
+  return *this;
+}
+
+inline Congruence_System::const_iterator
+Congruence_System::const_iterator::operator++(int) {
+  const const_iterator tmp = *this;
+  operator++();
+  return tmp;
+}
+
+inline bool
+Congruence_System::const_iterator::operator==(const const_iterator& y) const {
+  return i == y.i;
+}
+
+inline bool
+Congruence_System::const_iterator::operator!=(const const_iterator& y) const {
+  return i != y.i;
+}
+
+inline
+Congruence_System::const_iterator::
+const_iterator(const Swapping_Vector<Congruence>::const_iterator& iter,
+               const Congruence_System& cgs)
+  : i(iter), csp(&cgs.rows) {
+}
+
+inline Congruence_System::const_iterator
+Congruence_System::begin() const {
+  const_iterator i(rows.begin(), *this);
+  i.skip_forward();
+  return i;
+}
+
+inline Congruence_System::const_iterator
+Congruence_System::end() const {
+  const const_iterator i(rows.end(), *this);
+  return i;
+}
+
+inline bool
+Congruence_System::empty() const {
+  return begin() == end();
+}
+
+inline void
+Congruence_System::m_swap(Congruence_System& y) {
+  using std::swap;
+  swap(rows, y.rows);
+  swap(space_dimension_, y.space_dimension_);
+  swap(representation_, y.representation_);
+  PPL_ASSERT(OK());
+  PPL_ASSERT(y.OK());
+}
+
+inline memory_size_type
+Congruence_System::external_memory_in_bytes() const {
+  return rows.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Congruence_System::total_memory_in_bytes() const {
+  return rows.external_memory_in_bytes() + sizeof(*this);
+}
+
+/*! \relates Congruence_System */
+inline void
+swap(Congruence_System& x, Congruence_System& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Congruence_System_inlines_hh)
diff --git a/src/Congruence_System_types.hh b/src/Congruence_System_types.hh
new file mode 100644
index 0000000..0e3e919
--- /dev/null
+++ b/src/Congruence_System_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Congruence_System_types_hh
+#define PPL_Congruence_System_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Congruence_System;
+
+}
+
+#endif // !defined(PPL_Congruence_System_types_hh)
diff --git a/src/Congruence_defs.hh b/src/Congruence_defs.hh
new file mode 100644
index 0000000..92e0045
--- /dev/null
+++ b/src/Congruence_defs.hh
@@ -0,0 +1,506 @@
+/* Congruence class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Congruence_defs_hh
+#define PPL_Congruence_defs_hh 1
+
+#include "Congruence_types.hh"
+
+#include "Coefficient_defs.hh"
+#include "Variable_defs.hh"
+
+#include "Constraint_types.hh"
+#include "Grid_types.hh"
+#include "Scalar_Products_types.hh"
+#include "Linear_Expression_defs.hh"
+#include "Expression_Adapter_defs.hh"
+
+#include <iosfwd>
+#include <vector>
+
+// These are declared here because they are friend of Congruence.
+namespace Parma_Polyhedra_Library {
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equivalent.
+/*! \relates Congruence */
+bool
+operator==(const Congruence& x, const Congruence& y);
+
+//! Returns <CODE>false</CODE> if and only if \p x and \p y are equivalent.
+/*! \relates Congruence */
+bool
+operator!=(const Congruence& x, const Congruence& y);
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! A linear congruence.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Congruence is a congruence:
+  - \f$\cg = \sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod m\f$
+
+  where \f$n\f$ is the dimension of the space,
+  \f$a_i\f$ is the integer coefficient of variable \f$x_i\f$,
+  \f$b\f$ is the integer inhomogeneous term and \f$m\f$ is the integer modulus;
+  if \f$m = 0\f$, then \f$\cg\f$ represents the equality congruence
+  \f$\sum_{i=0}^{n-1} a_i x_i + b = 0\f$
+  and, if \f$m \neq 0\f$, then the congruence \f$\cg\f$ is
+  said to be a proper congruence.
+
+  \par How to build a congruence
+  Congruences \f$\pmod{1}\f$ are typically built by
+  applying the congruence symbol `<CODE>\%=</CODE>'
+  to a pair of linear expressions.
+  Congruences with modulus \p m
+  are typically constructed by building a congruence \f$\pmod{1}\f$
+  using the given pair of linear expressions
+  and then adding the modulus \p m
+  using the modulus symbol is `<CODE>/</CODE>'.
+
+  The space dimension of a congruence is defined as the maximum
+  space dimension of the arguments of its constructor.
+
+  \par
+  In the following examples it is assumed that variables
+  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
+  are defined as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable z(2);
+  \endcode
+
+  \par Example 1
+  The following code builds the equality congruence
+  \f$3x + 5y - z = 0\f$, having space dimension \f$3\f$:
+  \code
+  Congruence eq_cg((3*x + 5*y - z %= 0) / 0);
+  \endcode
+  The following code builds the congruence
+  \f$4x = 2y - 13 \pmod{1}\f$, having space dimension \f$2\f$:
+  \code
+  Congruence mod1_cg(4*x %= 2*y - 13);
+  \endcode
+  The following code builds the congruence
+  \f$4x = 2y - 13 \pmod{2}\f$, having space dimension \f$2\f$:
+  \code
+  Congruence mod2_cg((4*x %= 2*y - 13) / 2);
+  \endcode
+  An unsatisfiable congruence on the zero-dimension space \f$\Rset^0\f$
+  can be specified as follows:
+  \code
+  Congruence false_cg = Congruence::zero_dim_false();
+  \endcode
+  Equivalent, but more involved ways are the following:
+  \code
+  Congruence false_cg1((Linear_Expression::zero() %= 1) / 0);
+  Congruence false_cg2((Linear_Expression::zero() %= 1) / 2);
+  \endcode
+  In contrast, the following code defines an unsatisfiable congruence
+  having space dimension \f$3\f$:
+  \code
+  Congruence false_cg3((0*z %= 1) / 0);
+  \endcode
+
+  \par How to inspect a congruence
+  Several methods are provided to examine a congruence and extract
+  all the encoded information: its space dimension, its modulus
+  and the value of its integer coefficients.
+
+  \par Example 2
+  The following code shows how it is possible to access the modulus
+  as well as each of the coefficients.
+  Given a congruence with linear expression \p e and modulus \p m
+  (in this case \f$x - 5y + 3z = 4 \pmod{5}\f$), we construct a new
+  congruence with the same modulus \p m but where the linear
+  expression is \f$2 e\f$ (\f$2x - 10y + 6z = 8 \pmod{5}\f$).
+  \code
+  Congruence cg1((x - 5*y + 3*z %= 4) / 5);
+  cout << "Congruence cg1: " << cg1 << endl;
+  const Coefficient& m = cg1.modulus();
+  if (m == 0)
+    cout << "Congruence cg1 is an equality." << endl;
+  else {
+    Linear_Expression e;
+    for (dimension_type i = cg1.space_dimension(); i-- > 0; )
+      e += 2 * cg1.coefficient(Variable(i)) * Variable(i);
+      e += 2 * cg1.inhomogeneous_term();
+    Congruence cg2((e %= 0) / m);
+    cout << "Congruence cg2: " << cg2 << endl;
+  }
+  \endcode
+  The actual output could be the following:
+  \code
+  Congruence cg1: A - 5*B + 3*C %= 4 / 5
+  Congruence cg2: 2*A - 10*B + 6*C %= 8 / 5
+  \endcode
+  Note that, in general, the particular output obtained can be
+  syntactically different from the (semantically equivalent)
+  congruence considered.
+*/
+class Parma_Polyhedra_Library::Congruence {
+public:
+
+  //! The representation used for new Congruences.
+  /*!
+    \note The copy constructor and the copy constructor with specified size
+          use the representation of the original object, so that it is
+          indistinguishable from the original object.
+  */
+  static const Representation default_representation = SPARSE;
+
+  //! Constructs the 0 = 0 congruence with space dimension \p 0 .
+  explicit Congruence(Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  /*!
+    \note The new Congruence will have the same representation as `cg',
+          not default_representation, so that they are indistinguishable.
+  */
+  Congruence(const Congruence& cg);
+
+  //! Copy constructor with specified representation.
+  Congruence(const Congruence& cg, Representation r);
+
+  //! Copy-constructs (modulo 0) from equality constraint \p c.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p c is an inequality.
+  */
+  explicit Congruence(const Constraint& c,
+                      Representation r = default_representation);
+
+  //! Destructor.
+  ~Congruence();
+
+  //! Assignment operator.
+  Congruence& operator=(const Congruence& y);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Congruence can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  void permute_space_dimensions(const std::vector<Variable>& cycles);
+
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Adapter_Transparent<Linear_Expression> expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  /*!
+    \exception std::invalid_argument thrown if the index of \p v
+    is greater than or equal to the space dimension of \p *this.
+  */
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns the inhomogeneous term of \p *this.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Returns a const reference to the modulus of \p *this.
+  Coefficient_traits::const_reference modulus() const;
+
+  //! Sets the modulus of \p *this to \p m .
+  //! If \p m is 0, the congruence becomes an equality.
+  void set_modulus(Coefficient_traits::const_reference m);
+
+  //! Multiplies all the coefficients, including the modulus, by \p factor .
+  void scale(Coefficient_traits::const_reference factor);
+
+  // TODO: Document this.
+  void affine_preimage(Variable v,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator);
+
+  //! Multiplies \p k into the modulus of \p *this.
+  /*!
+    If called with \p *this representing the congruence \f$ e_1 = e_2
+    \pmod{m}\f$, then it returns with *this representing
+    the congruence \f$ e_1 = e_2 \pmod{mk}\f$.
+  */
+  Congruence&
+  operator/=(Coefficient_traits::const_reference k);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is a tautology
+    (i.e., an always true congruence).
+
+    A tautological congruence has one the following two forms:
+    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + 0 == 0\f$; or
+    - a proper congruence: \f$\sum_{i=0}^{n-1} 0 x_i + b \%= 0 / m\f$,
+      where \f$b = 0 \pmod{m}\f$.
+  */
+  bool is_tautological() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is inconsistent (i.e., an always false congruence).
+
+    An inconsistent congruence has one of the following two forms:
+    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + b == 0\f$
+      where \f$b \neq 0\f$; or
+    - a proper congruence: \f$\sum_{i=0}^{n-1} 0 x_i + b \%= 0 / m\f$,
+      where \f$b \neq 0 \pmod{m}\f$.
+  */
+  bool is_inconsistent() const;
+
+  //! Returns <CODE>true</CODE> if the modulus is greater than zero.
+  /*!
+    A congruence with a modulus of 0 is a linear equality.
+  */
+  bool is_proper_congruence() const;
+
+  //! Returns <CODE>true</CODE> if \p *this is an equality.
+  /*!
+    A modulus of zero denotes a linear equality.
+  */
+  bool is_equality() const;
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  /*! \brief
+    Returns a reference to the true (zero-dimension space) congruence
+    \f$0 = 1 \pmod{1}\f$, also known as the <EM>integrality
+    congruence</EM>.
+  */
+  static const Congruence& zero_dim_integrality();
+
+  /*! \brief
+    Returns a reference to the false (zero-dimension space) congruence
+    \f$0 = 1 \pmod{0}\f$.
+  */
+  static const Congruence& zero_dim_false();
+
+  //! Returns the congruence \f$e1 = e2 \pmod{1}\f$.
+  static Congruence
+  create(const Linear_Expression& e1, const Linear_Expression& e2,
+         Representation r = default_representation);
+
+  //! Returns the congruence \f$e = n \pmod{1}\f$.
+  static Congruence
+  create(const Linear_Expression& e, Coefficient_traits::const_reference n,
+         Representation r = default_representation);
+
+  //! Returns the congruence \f$n = e \pmod{1}\f$.
+  static Congruence
+  create(Coefficient_traits::const_reference n, const Linear_Expression& e,
+         Representation r = default_representation);
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation of the internal
+    representation of \p *this.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Congruence& y);
+
+  //! Copy-constructs with the specified space dimension.
+  /*!
+    \note The new Congruence will have the same representation as `cg',
+          not default_representation, for consistency with the copy
+          constructor.
+  */
+  Congruence(const Congruence& cg, dimension_type new_space_dimension);
+
+  //! Copy-constructs with the specified space dimension and representation.
+  Congruence(const Congruence& cg, dimension_type new_space_dimension,
+             Representation r);
+
+  //! Copy-constructs from a constraint, with the specified space dimension
+  //! and (optional) representation.
+  Congruence(const Constraint& cg, dimension_type new_space_dimension,
+             Representation r = default_representation);
+
+  //! Constructs from Linear_Expression \p le, using modulus \p m.
+  /*!
+    Builds a congruence with modulus \p m, stealing the coefficients
+    from \p le.
+
+    \note The new Congruence will have the same representation as `le'.
+
+    \param le
+    The Linear_Expression holding the coefficients.
+
+    \param m
+    The modulus for the congruence, which must be zero or greater.
+  */
+  Congruence(Linear_Expression& le,
+             Coefficient_traits::const_reference m, Recycle_Input);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Sets the space dimension by \p n , adding or removing coefficients as
+  //! needed.
+  void set_space_dimension(dimension_type n);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Normalizes the signs.
+  /*!
+    The signs of the coefficients and the inhomogeneous term are
+    normalized, leaving the first non-zero homogeneous coefficient
+    positive.
+  */
+  void sign_normalize();
+
+  //! Normalizes signs and the inhomogeneous term.
+  /*!
+    Applies sign_normalize, then reduces the inhomogeneous term to the
+    smallest possible positive number.
+  */
+  void normalize();
+
+  //! Calls normalize, then divides out common factors.
+  /*!
+    Strongly normalized Congruences have equivalent semantics if and
+    only if they have the same syntax (as output by operator<<).
+  */
+  void strong_normalize();
+
+private:
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the false (zero-dimension space) congruence \f$0 = 1 \pmod{0}\f$.
+  */
+  static const Congruence* zero_dim_false_p;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the true (zero-dimension space) congruence \f$0 = 1 \pmod{1}\f$,
+    also known as the <EM>integrality congruence</EM>.
+  */
+  static const Congruence* zero_dim_integrality_p;
+
+  Linear_Expression expr;
+
+  Coefficient modulus_;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if \p *this is equal to \p cg in
+    dimension \p v.
+  */
+  bool is_equal_at_dimension(Variable v,
+                             const Congruence& cg) const;
+
+  /*! \brief
+    Throws a <CODE>std::invalid_argument</CODE> exception containing
+    error message \p message.
+  */
+  void
+  throw_invalid_argument(const char* method, const char* message) const;
+
+  /*! \brief
+    Throws a <CODE>std::invalid_argument</CODE> exception containing
+    the appropriate error message.
+  */
+  void
+  throw_dimension_incompatible(const char* method,
+                               const char* v_name,
+                               Variable v) const;
+
+  friend bool
+  operator==(const Congruence& x, const Congruence& y);
+
+  friend bool
+  operator!=(const Congruence& x, const Congruence& y);
+
+  friend class Scalar_Products;
+  friend class Grid;
+};
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operators.
+
+/*! \relates Parma_Polyhedra_Library::Congruence */
+std::ostream&
+operator<<(std::ostream& s, const Congruence& c);
+
+} // namespace IO_Operators
+
+//! Returns the congruence \f$e1 = e2 \pmod{1}\f$.
+/*! \relates Congruence */
+Congruence
+operator%=(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the congruence \f$e = n \pmod{1}\f$.
+/*! \relates Congruence */
+Congruence
+operator%=(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns a copy of \p cg, multiplying \p k into the copy's modulus.
+/*!
+    If \p cg represents the congruence \f$ e_1 = e_2
+    \pmod{m}\f$, then the result represents the
+    congruence \f$ e_1 = e_2 \pmod{mk}\f$.
+  \relates Congruence
+*/
+Congruence
+operator/(const Congruence& cg, Coefficient_traits::const_reference k);
+
+//! Creates a congruence from \p c, with \p m as the modulus.
+/*! \relates Congruence */
+Congruence
+operator/(const Constraint& c, Coefficient_traits::const_reference m);
+
+/*! \relates Congruence */
+void
+swap(Congruence& x, Congruence& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Congruence_inlines.hh"
+
+#endif // !defined(PPL_Congruence_defs_hh)
diff --git a/src/Congruence_inlines.hh b/src/Congruence_inlines.hh
new file mode 100644
index 0000000..77e7246
--- /dev/null
+++ b/src/Congruence_inlines.hh
@@ -0,0 +1,281 @@
+/* Congruence class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Congruence_inlines_hh
+#define PPL_Congruence_inlines_hh 1
+
+#include <sstream>
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Congruence::Congruence(Representation r)
+  : expr(r) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Congruence::Congruence(const Congruence& cg)
+  : expr(cg.expr), modulus_(cg.modulus_) {
+}
+
+inline
+Congruence::Congruence(const Congruence& cg, Representation r)
+  : expr(cg.expr, r), modulus_(cg.modulus_) {
+}
+
+inline
+Congruence::Congruence(const Congruence& cg,
+                       dimension_type new_space_dimension)
+  : expr(cg.expr, new_space_dimension), modulus_(cg.modulus_) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Congruence::Congruence(const Congruence& cg,
+                       dimension_type new_space_dimension,
+                       Representation r)
+  : expr(cg.expr, new_space_dimension, r), modulus_(cg.modulus_) {
+  PPL_ASSERT(OK());
+}
+
+inline Representation
+Congruence::representation() const {
+  return expr.representation();
+}
+
+inline void
+Congruence::set_representation(Representation r) {
+  expr.set_representation(r);
+}
+
+inline Congruence::expr_type
+Congruence::expression() const {
+  return expr_type(expr);
+}
+
+inline void
+Congruence::set_space_dimension(dimension_type n) {
+  expr.set_space_dimension(n);
+  PPL_ASSERT(OK());
+}
+
+inline void
+Congruence::shift_space_dimensions(Variable v, dimension_type n) {
+  expr.shift_space_dimensions(v, n);
+}
+
+inline
+Congruence::~Congruence() {
+}
+
+inline
+Congruence::Congruence(Linear_Expression& le,
+                       Coefficient_traits::const_reference m,
+                       Recycle_Input)
+  : modulus_(m) {
+  PPL_ASSERT(m >= 0);
+  swap(expr, le);
+
+  PPL_ASSERT(OK());
+}
+
+inline Congruence
+Congruence::create(const Linear_Expression& e,
+                   Coefficient_traits::const_reference n,
+                   Representation r) {
+  Linear_Expression diff(e, r);
+  diff -= n;
+  const Congruence cg(diff, 1, Recycle_Input());
+  return cg;
+}
+
+inline Congruence
+Congruence::create(Coefficient_traits::const_reference n,
+                   const Linear_Expression& e,
+                   Representation r) {
+  Linear_Expression diff(e, r);
+  diff -= n;
+  const Congruence cg(diff, 1, Recycle_Input());
+  return cg;
+}
+
+/*! \relates Parma_Polyhedra_Library::Congruence */
+inline Congruence
+operator%=(const Linear_Expression& e1, const Linear_Expression& e2) {
+  return Congruence::create(e1, e2);
+}
+
+/*! \relates Parma_Polyhedra_Library::Congruence */
+inline Congruence
+operator%=(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  return Congruence::create(e, n);
+}
+
+/*! \relates Parma_Polyhedra_Library::Congruence */
+inline Congruence
+operator/(const Congruence& cg, Coefficient_traits::const_reference k) {
+  Congruence ret = cg;
+  ret /= k;
+  return ret;
+}
+
+inline const Congruence&
+Congruence::zero_dim_integrality() {
+  return *zero_dim_integrality_p;
+}
+
+inline const Congruence&
+Congruence::zero_dim_false() {
+  return *zero_dim_false_p;
+}
+
+inline Congruence&
+Congruence::operator=(const Congruence& y) {
+  Congruence tmp = y;
+  swap(*this, tmp);
+  return *this;
+}
+
+/*! \relates Congruence */
+inline Congruence
+operator/(const Constraint& c, Coefficient_traits::const_reference m) {
+  Congruence ret(c);
+  ret /= m;
+  return ret;
+}
+
+inline Congruence&
+Congruence::operator/=(Coefficient_traits::const_reference k) {
+  if (k >= 0)
+    modulus_ *= k;
+  else
+    modulus_ *= -k;
+  return *this;
+}
+
+/*! \relates Congruence */
+inline bool
+operator==(const Congruence& x, const Congruence& y) {
+  if (x.space_dimension() != y.space_dimension())
+    return false;
+  Congruence x_temp(x);
+  Congruence y_temp(y);
+  x_temp.strong_normalize();
+  y_temp.strong_normalize();
+  return x_temp.expr.is_equal_to(y_temp.expr)
+    && x_temp.modulus() == y_temp.modulus();
+}
+
+/*! \relates Congruence */
+inline bool
+operator!=(const Congruence& x, const Congruence& y) {
+  return !(x == y);
+}
+
+inline dimension_type
+Congruence::max_space_dimension() {
+  return Linear_Expression::max_space_dimension();
+}
+
+inline dimension_type
+Congruence::space_dimension() const {
+  return expr.space_dimension();
+}
+
+inline Coefficient_traits::const_reference
+Congruence::coefficient(const Variable v) const {
+  if (v.space_dimension() > space_dimension())
+    throw_dimension_incompatible("coefficient(v)", "v", v);
+  return expr.coefficient(v);
+}
+
+inline void
+Congruence::permute_space_dimensions(const std::vector<Variable>& cycles) {
+  expr.permute_space_dimensions(cycles);
+}
+
+inline Coefficient_traits::const_reference
+Congruence::inhomogeneous_term() const {
+  return expr.inhomogeneous_term();
+}
+
+inline Coefficient_traits::const_reference
+Congruence::modulus() const {
+  return modulus_;
+}
+
+inline void
+Congruence::set_modulus(Coefficient_traits::const_reference m) {
+  modulus_ = m;
+  PPL_ASSERT(OK());
+}
+
+inline bool
+Congruence::is_proper_congruence() const {
+  return modulus() > 0;
+}
+
+inline bool
+Congruence::is_equality() const {
+  return modulus() == 0;
+}
+
+inline bool
+Congruence::is_equal_at_dimension(Variable v,
+                                  const Congruence& cg) const {
+  return coefficient(v) * cg.modulus() == cg.coefficient(v) * modulus();
+}
+
+inline memory_size_type
+Congruence::external_memory_in_bytes() const {
+  return expr.external_memory_in_bytes()
+         + Parma_Polyhedra_Library::external_memory_in_bytes(modulus_);
+}
+
+inline memory_size_type
+Congruence::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+inline void
+Congruence::m_swap(Congruence& y) {
+  using std::swap;
+  swap(expr, y.expr);
+  swap(modulus_, y.modulus_);
+}
+
+inline void
+Congruence::swap_space_dimensions(Variable v1, Variable v2) {
+  expr.swap_space_dimensions(v1, v2);
+}
+
+/*! \relates Congruence */
+inline void
+swap(Congruence& x, Congruence& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Congruence_inlines_hh)
diff --git a/src/Congruence_types.hh b/src/Congruence_types.hh
new file mode 100644
index 0000000..5cc5e09
--- /dev/null
+++ b/src/Congruence_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Congruence_types_hh
+#define PPL_Congruence_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Congruence;
+
+}
+
+#endif // !defined(PPL_Congruence_types_hh)
diff --git a/src/Constant_Floating_Point_Expression.defs.hh b/src/Constant_Floating_Point_Expression.defs.hh
deleted file mode 100644
index 7dfa8b4..0000000
--- a/src/Constant_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,173 +0,0 @@
-/* Declarations for the Constant_Floating_Point_Expression class and
-   its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Constant_Floating_Point_Expression_defs_hh
-#define PPL_Constant_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Constant_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Constant_Floating_Point_Expression */
-template<typename FP_Interval_Type, typename FP_Format>
-void swap(Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-          Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Constant Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of floating-point constant expressions
-
-  The linearization of a constant floating point expression results in a
-  linear form consisting of only the inhomogeneous term
-  \f$[l, u]\f$, where \f$l\f$ and \f$u\f$ are the lower
-  and upper bounds of the constant value given to the class constructor.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Constant_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with two parameters: builds the constant floating point
-    expression from a \p lower_bound and an \p upper_bound of its
-    value in the concrete domain.
-  */
-  Constant_Floating_Point_Expression(const boundary_type lower_bound,
-                                     const boundary_type upper_bound);
-
-  /*! \brief
-    Builds a constant floating point expression with the value
-    expressed by the string \p str_value.
-  */
-  Constant_Floating_Point_Expression(const char* str_value);
-
-  //! Destructor.
-  ~Constant_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    See the class description for an explanation of how \p result is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Constant_Floating_Point_Expression& y);
-
-private:
-
-  FP_Interval_Type value;
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Constant_Floating_Point_Expression(
-			  const Constant_Floating_Point_Expression& y);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited assignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAIL
-  Constant_Floating_Point_Expression& operator=(
-		          const Constant_Floating_Point_Expression& y);
-
-}; // class Constant_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Constant_Floating_Point_Expression.inlines.hh"
-
-#endif // !defined(PPL_Constant_Floating_Point_Expression_defs_hh)
diff --git a/src/Constant_Floating_Point_Expression.inlines.hh b/src/Constant_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index ca210e4..0000000
--- a/src/Constant_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,80 +0,0 @@
-/* Constant_Floating_Point_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Constant_Floating_Point_Expression_inlines_hh
-#define PPL_Constant_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-Constant_Floating_Point_Expression(const char* str_value)
-  : value(str_value) {}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-Constant_Floating_Point_Expression(const boundary_type lb,
-                                   const boundary_type ub) {
-  assert(lb <= ub);
-  value.build(i_constraint(GREATER_OR_EQUAL, lb),
-              i_constraint(LESS_OR_EQUAL, ub));
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-~Constant_Floating_Point_Expression() {}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Constant_Floating_Point_Expression& y) {
-  using std::swap;
-  swap(value, y.value);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline bool
-Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store&,
-            const FP_Linear_Form_Abstract_Store&,
-            FP_Linear_Form& result) const {
-  result = FP_Linear_Form(value);
-  return true;
-}
-
-/*! \relates Constant_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Constant_Floating_Point_Expression_inlines_hh)
diff --git a/src/Constant_Floating_Point_Expression.types.hh b/src/Constant_Floating_Point_Expression.types.hh
deleted file mode 100644
index a75f369..0000000
--- a/src/Constant_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Constant_Floating_Point_Expression_types_hh
-#define PPL_Constant_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Constant_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Constant_Floating_Point_Expression_types_hh)
diff --git a/src/Constant_Floating_Point_Expression_defs.hh b/src/Constant_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..26906dd
--- /dev/null
+++ b/src/Constant_Floating_Point_Expression_defs.hh
@@ -0,0 +1,173 @@
+/* Declarations for the Constant_Floating_Point_Expression class and
+   its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Constant_Floating_Point_Expression_defs_hh
+#define PPL_Constant_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Constant_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Constant_Floating_Point_Expression */
+template<typename FP_Interval_Type, typename FP_Format>
+void swap(Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+          Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Constant Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of floating-point constant expressions
+
+  The linearization of a constant floating point expression results in a
+  linear form consisting of only the inhomogeneous term
+  \f$[l, u]\f$, where \f$l\f$ and \f$u\f$ are the lower
+  and upper bounds of the constant value given to the class constructor.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Constant_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::boundary_type from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with two parameters: builds the constant floating point
+    expression from a \p lower_bound and an \p upper_bound of its
+    value in the concrete domain.
+  */
+  Constant_Floating_Point_Expression(const boundary_type lower_bound,
+                                     const boundary_type upper_bound);
+
+  /*! \brief
+    Builds a constant floating point expression with the value
+    expressed by the string \p str_value.
+  */
+  Constant_Floating_Point_Expression(const char* str_value);
+
+  //! Destructor.
+  ~Constant_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    See the class description for an explanation of how \p result is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Constant_Floating_Point_Expression& y);
+
+private:
+
+  FP_Interval_Type value;
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Constant_Floating_Point_Expression(
+                          const Constant_Floating_Point_Expression& y);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited assignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAIL
+  Constant_Floating_Point_Expression& operator=(
+                          const Constant_Floating_Point_Expression& y);
+
+}; // class Constant_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Constant_Floating_Point_Expression_inlines.hh"
+
+#endif // !defined(PPL_Constant_Floating_Point_Expression_defs_hh)
diff --git a/src/Constant_Floating_Point_Expression_inlines.hh b/src/Constant_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..5e138d2
--- /dev/null
+++ b/src/Constant_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,80 @@
+/* Constant_Floating_Point_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Constant_Floating_Point_Expression_inlines_hh
+#define PPL_Constant_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+Constant_Floating_Point_Expression(const char* str_value)
+  : value(str_value) {}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+Constant_Floating_Point_Expression(const boundary_type lb,
+                                   const boundary_type ub) {
+  assert(lb <= ub);
+  value.build(i_constraint(GREATER_OR_EQUAL, lb),
+              i_constraint(LESS_OR_EQUAL, ub));
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+~Constant_Floating_Point_Expression() {}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Constant_Floating_Point_Expression& y) {
+  using std::swap;
+  swap(value, y.value);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline bool
+Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store&,
+            const FP_Linear_Form_Abstract_Store&,
+            FP_Linear_Form& result) const {
+  result = FP_Linear_Form(value);
+  return true;
+}
+
+/*! \relates Constant_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Constant_Floating_Point_Expression_inlines_hh)
diff --git a/src/Constant_Floating_Point_Expression_types.hh b/src/Constant_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..72ab45f
--- /dev/null
+++ b/src/Constant_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Constant_Floating_Point_Expression_types_hh
+#define PPL_Constant_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Constant_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Constant_Floating_Point_Expression_types_hh)
diff --git a/src/Constraint.cc b/src/Constraint.cc
index 1aa9faa..f1e5b44 100644
--- a/src/Constraint.cc
+++ b/src/Constraint.cc
@@ -1,6 +1,6 @@
 /* Constraint class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,11 +22,11 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Constraint.defs.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.defs.hh"
-#include "Congruence.defs.hh"
-#include "math_utilities.defs.hh"
+#include "Constraint_defs.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_defs.hh"
+#include "Congruence_defs.hh"
+#include "math_utilities_defs.hh"
 
 #include <iostream>
 #include <sstream>
@@ -36,7 +36,7 @@ namespace PPL = Parma_Polyhedra_Library;
 
 void
 PPL::Constraint::throw_invalid_argument(const char* method,
-					const char* message) const {
+                                        const char* message) const {
   std::ostringstream s;
   s << "PPL::Constraint::" << method << ":" << std::endl
     << message;
@@ -45,8 +45,8 @@ PPL::Constraint::throw_invalid_argument(const char* method,
 
 void
 PPL::Constraint::throw_dimension_incompatible(const char* method,
-					      const char* name_var,
-					      const Variable v) const {
+                                              const char* name_var,
+                                              const Variable v) const {
   std::ostringstream s;
   s << "PPL::Constraint::" << method << ":" << std::endl
     << "this->space_dimension() == " << space_dimension() << ", "
@@ -64,8 +64,7 @@ PPL::Constraint::construct_epsilon_geq_zero() {
 }
 
 PPL::Constraint::Constraint(const Congruence& cg, Representation r)
-  : expr(cg, r),
-    wrapped_expr(expr, false),
+  : expr(cg.expression(), r),
     kind_(LINE_OR_EQUALITY),
     topology_(NECESSARILY_CLOSED) {
   if (!cg.is_equality())
@@ -116,21 +115,21 @@ PPL::Constraint::is_tautological() const {
       // The constraint is NOT necessarily closed.
       const int eps_sign = sgn(epsilon_coefficient());
       if (eps_sign > 0)
-	// We have found the constraint epsilon >= 0.
-	return true;
+        // We have found the constraint epsilon >= 0.
+        return true;
       if (eps_sign == 0)
-	// One of the `true' dimensions has a non-zero coefficient.
-	return false;
+        // One of the `true' dimensions has a non-zero coefficient.
+        return false;
       else {
-	// Here the epsilon coefficient is negative: strict inequality.
-	if (expr.inhomogeneous_term() <= 0)
-	  // A strict inequality such as `lhs - k > 0',
-	  // where k is a non negative integer, cannot be trivially true.
-	  return false;
-	// Checking for another non-zero coefficient.
+        // Here the epsilon coefficient is negative: strict inequality.
+        if (expr.inhomogeneous_term() <= 0)
+          // A strict inequality such as `lhs - k > 0',
+          // where k is a non negative integer, cannot be trivially true.
+          return false;
+        // Checking for another non-zero coefficient.
         // If the check succeeds, we have the inequality `k > 0',
         // where k is a positive integer.
-        return wrapped_expr.all_homogeneous_terms_are_zero();
+        return expression().all_homogeneous_terms_are_zero();
       }
     }
 }
@@ -151,20 +150,20 @@ PPL::Constraint::is_inconsistent() const {
     else {
       // The constraint is NOT necessarily closed.
       if (epsilon_coefficient() >= 0)
-	// If positive, we have found the constraint epsilon >= 0.
-	// If zero, one of the `true' dimensions has a non-zero coefficient.
-	// In both cases, it is not trivially false.
-	return false;
+        // If positive, we have found the constraint epsilon >= 0.
+        // If zero, one of the `true' dimensions has a non-zero coefficient.
+        // In both cases, it is not trivially false.
+        return false;
       else {
-	// Here the epsilon coefficient is negative: strict inequality.
-	if (expr.inhomogeneous_term() > 0)
-	  // A strict inequality such as `lhs + k > 0',
-	  // where k is a positive integer, cannot be trivially false.
-	  return false;
+        // Here the epsilon coefficient is negative: strict inequality.
+        if (expr.inhomogeneous_term() > 0)
+          // A strict inequality such as `lhs + k > 0',
+          // where k is a positive integer, cannot be trivially false.
+          return false;
         // Checking for another non-zero coefficient.
         // If the check succeeds, we have the inequality `k > 0',
         // where k is a positive integer.
-        return wrapped_expr.all_homogeneous_terms_are_zero();
+        return expression().all_homogeneous_terms_are_zero();
       }
     }
 }
@@ -208,8 +207,8 @@ PPL::Constraint::is_equivalent_to(const Constraint& y) const {
     // different strict inequalities may actually encode the same
     // topologically open half-space.
     // First, drop the epsilon-coefficient ...
-    Linear_Expression x_expr(x);
-    Linear_Expression y_expr(y);
+    Linear_Expression x_expr(x.expression());
+    Linear_Expression y_expr(y.expression());
     // ... then, re-normalize ...
     x_expr.normalize();
     y_expr.normalize();
@@ -332,12 +331,14 @@ PPL::Constraint::ascii_load(std::istream& s) {
     // TODO: Avoid the mark_as_*() methods if possible.
     if (topology() == NECESSARILY_CLOSED)
       mark_as_not_necessarily_closed();
-  } else
+  }
+  else
     if (str2 == "(C)") {
       // TODO: Avoid the mark_as_*() methods if possible.
       if (topology() == NOT_NECESSARILY_CLOSED)
         mark_as_necessarily_closed();
-    } else
+    }
+    else
       return false;
 
   // Checking for equality of actual and declared types.
@@ -364,8 +365,8 @@ std::ostream&
 PPL::IO_Operators::operator<<(std::ostream& s, const Constraint& c) {
   PPL_DIRTY_TEMP_COEFFICIENT(cv);
   bool first = true;
-  for (Constraint::Expression::const_iterator i = c.expression().begin(),
-        i_end = c.expression().end(); i != i_end; ++i) {
+  for (Constraint::expr_type::const_iterator i = c.expression().begin(),
+         i_end = c.expression().end(); i != i_end; ++i) {
     cv = *i;
     if (!first) {
       if (cv > 0)
@@ -428,8 +429,8 @@ PPL::Constraint::OK() const {
   if (is_not_necessarily_closed() && expr.space_dimension() == 0) {
 #ifndef NDEBUG
     std::cerr << "Constraint has fewer coefficients than the minimum "
-	      << "allowed by its topology."
-	      << std::endl;
+              << "allowed by its topology."
+              << std::endl;
 #endif
     return false;
   }
@@ -438,7 +439,7 @@ PPL::Constraint::OK() const {
       && epsilon_coefficient() != 0) {
 #ifndef NDEBUG
     std::cerr << "Illegal constraint: an equality cannot be strict."
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
@@ -449,7 +450,7 @@ PPL::Constraint::OK() const {
   if (tmp != *this) {
 #ifndef NDEBUG
     std::cerr << "Constraint is not strongly normalized as it should be."
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
diff --git a/src/Constraint.defs.hh b/src/Constraint.defs.hh
deleted file mode 100644
index 4795bc2..0000000
--- a/src/Constraint.defs.hh
+++ /dev/null
@@ -1,842 +0,0 @@
-/* Constraint class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Constraint_defs_hh
-#define PPL_Constraint_defs_hh 1
-
-#include "Constraint.types.hh"
-
-#include "Congruence.types.hh"
-#include "Variables_Set.types.hh"
-#include "Polyhedron.types.hh"
-#include "termination.types.hh"
-#include "Octagonal_Shape.types.hh"
-#include "Grid.types.hh"
-
-#include "Linear_Expression.defs.hh"
-#include "Variable.defs.hh"
-#include "Topology.types.hh"
-#include "Expression_Hide_Last.defs.hh"
-
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-//! Returns the constraint \p e1 \< \p e2.
-/*! \relates Constraint */
-Constraint
-operator<(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the constraint \p v1 \< \p v2.
-/*! \relates Constraint */
-Constraint
-operator<(Variable v1, Variable v2);
-
-//! Returns the constraint \p e \< \p n.
-/*! \relates Constraint */
-Constraint
-operator<(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the constraint \p n \< \p e.
-/*! \relates Constraint */
-Constraint
-operator<(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the constraint \p e1 \> \p e2.
-/*! \relates Constraint */
-Constraint
-operator>(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the constraint \p v1 \> \p v2.
-/*! \relates Constraint */
-Constraint
-operator>(Variable v1, Variable v2);
-
-//! Returns the constraint \p e \> \p n.
-/*! \relates Constraint */
-Constraint
-operator>(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the constraint \p n \> \p e.
-/*! \relates Constraint */
-Constraint
-operator>(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the constraint \p e1 = \p e2.
-/*! \relates Constraint */
-Constraint
-operator==(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the constraint \p v1 = \p v2.
-/*! \relates Constraint */
-Constraint
-operator==(Variable v1, Variable v2);
-
-//! Returns the constraint \p e = \p n.
-/*! \relates Constraint */
-Constraint
-operator==(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the constraint \p n = \p e.
-/*! \relates Constraint */
-Constraint
-operator==(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the constraint \p e1 \<= \p e2.
-/*! \relates Constraint */
-Constraint
-operator<=(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the constraint \p v1 \<= \p v2.
-/*! \relates Constraint */
-Constraint
-operator<=(Variable v1, Variable v2);
-
-//! Returns the constraint \p e \<= \p n.
-/*! \relates Constraint */
-Constraint
-operator<=(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the constraint \p n \<= \p e.
-/*! \relates Constraint */
-Constraint
-operator<=(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the constraint \p e1 \>= \p e2.
-/*! \relates Constraint */
-Constraint
-operator>=(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the constraint \p v1 \>= \p v2.
-/*! \relates Constraint */
-Constraint
-operator>=(Variable v1, Variable v2);
-
-//! Returns the constraint \p e \>= \p n.
-/*! \relates Constraint */
-Constraint
-operator>=(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the constraint \p n \>= \p e.
-/*! \relates Constraint */
-Constraint
-operator>=(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The basic comparison function.
-/*! \relates Constraint
-  \return
-  The returned absolute value can be \f$0\f$, \f$1\f$ or \f$2\f$.
-
-  \param x
-  A row of coefficients;
-
-  \param y
-  Another row.
-
-  Compares \p x and \p y, where \p x and \p y may be of different size,
-  in which case the "missing" coefficients are assumed to be zero.
-  The comparison is such that:
-  -# equalities are smaller than inequalities;
-  -# lines are smaller than points and rays;
-  -# the ordering is lexicographic;
-  -# the positions compared are, in decreasing order of significance,
-     1, 2, ..., \p size(), 0;
-  -# the result is negative, zero, or positive if x is smaller than,
-     equal to, or greater than y, respectively;
-  -# when \p x and \p y are different, the absolute value of the
-     result is 1 if the difference is due to the coefficient in
-     position 0; it is 2 otherwise.
-
-  When \p x and \p y represent the hyper-planes associated
-  to two equality or inequality constraints, the coefficient
-  at 0 is the known term.
-  In this case, the return value can be characterized as follows:
-  - -2, if \p x is smaller than \p y and they are \e not parallel;
-  - -1, if \p x is smaller than \p y and they \e are parallel;
-  -  0, if \p x and y are equal;
-  - +1, if \p y is smaller than \p x and they \e are parallel;
-  - +2, if \p y is smaller than \p x and they are \e not parallel.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-int compare(const Constraint& x, const Constraint& y);
-
-}
-
-//! A linear equality or inequality.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Constraint is either:
-  - an equality: \f$\sum_{i=0}^{n-1} a_i x_i + b = 0\f$;
-  - a non-strict inequality: \f$\sum_{i=0}^{n-1} a_i x_i + b \geq 0\f$; or
-  - a strict inequality: \f$\sum_{i=0}^{n-1} a_i x_i + b > 0\f$;
-
-  where \f$n\f$ is the dimension of the space,
-  \f$a_i\f$ is the integer coefficient of variable \f$x_i\f$
-  and \f$b\f$ is the integer inhomogeneous term.
-
-  \par How to build a constraint
-  Constraints are typically built by applying a relation symbol
-  to a pair of linear expressions.
-  Available relation symbols are equality (<CODE>==</CODE>),
-  non-strict inequalities (<CODE>\>=</CODE> and <CODE>\<=</CODE>) and
-  strict inequalities (<CODE>\<</CODE> and <CODE>\></CODE>).
-  The space dimension of a constraint is defined as the maximum
-  space dimension of the arguments of its constructor.
-
-  \par
-  In the following examples it is assumed that variables
-  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
-  are defined as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable z(2);
-  \endcode
-
-  \par Example 1
-  The following code builds the equality constraint
-  \f$3x + 5y - z = 0\f$, having space dimension \f$3\f$:
-  \code
-  Constraint eq_c(3*x + 5*y - z == 0);
-  \endcode
-  The following code builds the (non-strict) inequality constraint
-  \f$4x \geq 2y - 13\f$, having space dimension \f$2\f$:
-  \code
-  Constraint ineq_c(4*x >= 2*y - 13);
-  \endcode
-  The corresponding strict inequality constraint
-  \f$4x > 2y - 13\f$ is obtained as follows:
-  \code
-  Constraint strict_ineq_c(4*x > 2*y - 13);
-  \endcode
-  An unsatisfiable constraint on the zero-dimension space \f$\Rset^0\f$
-  can be specified as follows:
-  \code
-  Constraint false_c = Constraint::zero_dim_false();
-  \endcode
-  Equivalent, but more involved ways are the following:
-  \code
-  Constraint false_c1(Linear_Expression::zero() == 1);
-  Constraint false_c2(Linear_Expression::zero() >= 1);
-  Constraint false_c3(Linear_Expression::zero() > 0);
-  \endcode
-  In contrast, the following code defines an unsatisfiable constraint
-  having space dimension \f$3\f$:
-  \code
-  Constraint false_c(0*z == 1);
-  \endcode
-
-  \par How to inspect a constraint
-  Several methods are provided to examine a constraint and extract
-  all the encoded information: its space dimension, its type
-  (equality, non-strict inequality, strict inequality) and
-  the value of its integer coefficients.
-
-  \par Example 2
-  The following code shows how it is possible to access each single
-  coefficient of a constraint. Given an inequality constraint
-  (in this case \f$x - 5y + 3z \leq 4\f$), we construct a new constraint
-  corresponding to its complement (thus, in this case we want to obtain
-  the strict inequality constraint \f$x - 5y + 3z > 4\f$).
-  \code
-  Constraint c1(x - 5*y + 3*z <= 4);
-  cout << "Constraint c1: " << c1 << endl;
-  if (c1.is_equality())
-    cout << "Constraint c1 is not an inequality." << endl;
-  else {
-    Linear_Expression e;
-    for (dimension_type i = c1.space_dimension(); i-- > 0; )
-      e += c1.coefficient(Variable(i)) * Variable(i);
-    e += c1.inhomogeneous_term();
-    Constraint c2 = c1.is_strict_inequality() ? (e <= 0) : (e < 0);
-    cout << "Complement c2: " << c2 << endl;
-  }
-  \endcode
-  The actual output is the following:
-  \code
-  Constraint c1: -A + 5*B - 3*C >= -4
-  Complement c2: A - 5*B + 3*C > 4
-  \endcode
-  Note that, in general, the particular output obtained can be
-  syntactically different from the (semantically equivalent)
-  constraint considered.
-*/
-class Parma_Polyhedra_Library::Constraint {
-public:
-
-  //! The constraint type.
-  enum Type {
-    /*! The constraint is an equality. */
-    EQUALITY,
-    /*! The constraint is a non-strict inequality. */
-    NONSTRICT_INEQUALITY,
-    /*! The constraint is a strict inequality. */
-    STRICT_INEQUALITY
-  };
-
-  //! The representation used for new Constraints.
-  /*!
-    \note The copy constructor and the copy constructor with specified size
-          use the representation of the original object, so that it is
-          indistinguishable from the original object.
-  */
-  static const Representation default_representation = SPARSE;
-
-  //! Constructs the \f$0<=0\f$ constraint.
-  explicit Constraint(Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  /*!
-    \note The new Constraint will have the same representation as `c',
-          not default_representation, so that they are indistinguishable.
-  */
-  Constraint(const Constraint& c);
-
-  //! Copy constructor with given size.
-  /*!
-    \note The new Constraint will have the same representation as `c',
-          not default_representation, so that they are indistinguishable.
-  */
-  Constraint(const Constraint& c, dimension_type space_dim);
-
-  //! Copy constructor with given representation.
-  Constraint(const Constraint& c, Representation r);
-
-  //! Copy constructor with given size and representation.
-  Constraint(const Constraint& c, dimension_type space_dim,
-             Representation r);
-
-  //! Copy-constructs from equality congruence \p cg.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p cg is a proper congruence.
-  */
-  explicit Constraint(const Congruence& cg,
-                      Representation r = default_representation);
-
-  //! Destructor.
-  ~Constraint();
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Assignment operator.
-  Constraint& operator=(const Constraint& c);
-
-  //! Returns the maximum space dimension a Constraint can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Sets the dimension of the vector space enclosing \p *this to
-  //! \p space_dim .
-  void set_space_dimension(dimension_type space_dim);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Removes all the specified dimensions from the constraint.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-
-    Always returns \p true. The return value is needed for compatibility with
-    the Generator class.
-  */
-  bool remove_space_dimensions(const Variables_Set& vars);
-
-  //! Permutes the space dimensions of the constraint.
-  /*
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Returns the constraint type of \p *this.
-  Type type() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is an equality constraint.
-  */
-  bool is_equality() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is an inequality constraint (either strict or non-strict).
-  */
-  bool is_inequality() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is a non-strict inequality constraint.
-  */
-  bool is_nonstrict_inequality() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is a strict inequality constraint.
-  */
-  bool is_strict_inequality() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  /*!
-    \exception std::invalid_argument thrown if the index of \p v
-    is greater than or equal to the space dimension of \p *this.
-  */
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  //! The unsatisfiable (zero-dimension space) constraint \f$0 = 1\f$.
-  static const Constraint& zero_dim_false();
-
-  /*! \brief
-    The true (zero-dimension space) constraint \f$0 \leq 1\f$,
-    also known as <EM>positivity constraint</EM>.
-  */
-  static const Constraint& zero_dim_positivity();
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is a tautology (i.e., an always true constraint).
-
-    A tautology can have either one of the following forms:
-    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + 0 = 0\f$; or
-    - a non-strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b \geq 0\f$,
-      where \f$b \geq 0\f$; or
-    - a strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b > 0\f$,
-      where \f$b > 0\f$.
-  */
-  bool is_tautological() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this is inconsistent (i.e., an always false constraint).
-
-    An inconsistent constraint can have either one of the following forms:
-    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + b = 0\f$,
-      where \f$b \neq 0\f$; or
-    - a non-strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b \geq 0\f$,
-      where \f$b < 0\f$; or
-    - a strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b > 0\f$,
-      where \f$b \leq 0\f$.
-  */
-  bool is_inconsistent() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y
-    are equivalent constraints.
-
-    Constraints having different space dimensions are not equivalent.
-    Note that constraints having different types may nonetheless be
-    equivalent, if they both are tautologies or inconsistent.
-  */
-  bool is_equivalent_to(const Constraint& y) const;
-
-  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
-  /*!
-    This is faster than is_equivalent_to(), but it may return `false' even
-    for equivalent constraints.
-  */
-  bool is_equal_to(const Constraint& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Constraint& y);
-
-  //! Returns the zero-dimension space constraint \f$\epsilon \geq 0\f$.
-  static const Constraint& epsilon_geq_zero();
-
-  /*! \brief
-    The zero-dimension space constraint \f$\epsilon \leq 1\f$
-    (used to implement NNC polyhedra).
-  */
-  static const Constraint& epsilon_leq_one();
-
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Expression_Hide_Last<Linear_Expression> Expression;
-
-  //! Allows user code to read the constraint's expression (but note that the
-  //! return type is not Linear_Expression, not all operations are allowed).
-  const Expression& expression() const;
-
-private:
-
-  //! The possible kinds of Constraint objects.
-  enum Kind {
-    LINE_OR_EQUALITY = 0,
-    RAY_OR_POINT_OR_INEQUALITY = 1
-  };
-
-  Linear_Expression expr;
-
-  Expression wrapped_expr;
-
-  Kind kind_;
-
-  Topology topology_;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the unsatisfiable (zero-dimension space) constraint \f$0 = 1\f$.
-  */
-  static const Constraint* zero_dim_false_p;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the true (zero-dimension space) constraint \f$0 \leq 1\f$, also
-    known as <EM>positivity constraint</EM>.
-  */
-  static const Constraint* zero_dim_positivity_p;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the zero-dimension space constraint \f$\epsilon \geq 0\f$.
-  */
-  static const Constraint* epsilon_geq_zero_p;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the zero-dimension space constraint \f$\epsilon \leq 1\f$
-    (used to implement NNC polyhedra).
-  */
-  static const Constraint* epsilon_leq_one_p;
-
-  //! Constructs the \f$0<0\f$ constraint.
-  Constraint(dimension_type space_dim, Kind kind, Topology topology,
-             Representation r = default_representation);
-
-  /*! \brief
-    Builds a constraint of kind \p kind and topology \p topology,
-    stealing the coefficients from \p e.
-
-    \note The new Constraint will have the same representation as `e'.
-  */
-  Constraint(Linear_Expression& e, Kind kind, Topology topology);
-
-  /*! \brief
-    Builds a constraint of type \p type and topology \p topology,
-    stealing the coefficients from \p e.
-
-    \note The new Constraint will have the same representation as `e'.
-  */
-  Constraint(Linear_Expression& e, Type type, Topology topology);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row
-    represents a line or an equality.
-  */
-  bool is_line_or_equality() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row
-    represents a ray, a point or an inequality.
-  */
-  bool is_ray_or_point_or_inequality() const;
-
-  //! Sets to \p LINE_OR_EQUALITY the kind of \p *this row.
-  void set_is_line_or_equality();
-
-  //! Sets to \p RAY_OR_POINT_OR_INEQUALITY the kind of \p *this row.
-  void set_is_ray_or_point_or_inequality();
-
-  //! \name Flags inspection methods
-  //@{
-  //! Returns the topological kind of \p *this.
-  Topology topology() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the topology
-    of \p *this row is not necessarily closed.
-  */
-  bool is_not_necessarily_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the topology
-    of \p *this row is necessarily closed.
-  */
-  bool is_necessarily_closed() const;
-  //@} // Flags inspection methods
-
-  //! \name Flags coercion methods
-  //@{
-
-  // TODO: Consider setting the epsilon dimension in this method.
-  //! Sets to \p x the topological kind of \p *this row.
-  void set_topology(Topology x);
-
-  //! Sets to \p NECESSARILY_CLOSED the topological kind of \p *this row.
-  void set_necessarily_closed();
-
-  //! Sets to \p NOT_NECESSARILY_CLOSED the topological kind of \p *this row.
-  void set_not_necessarily_closed();
-  //@} // Flags coercion methods
-
-  //! Sets the dimension of the vector space enclosing \p *this to
-  //! \p space_dim .
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  /*!
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid objects.
-  */
-  void set_space_dimension_no_ok(dimension_type space_dim);
-
-  /*! \brief
-    Throws a <CODE>std::invalid_argument</CODE> exception containing
-    error message \p message.
-  */
-  void
-  throw_invalid_argument(const char* method, const char* message) const;
-
-  /*! \brief
-    Throws a <CODE>std::invalid_argument</CODE> exception
-    containing the appropriate error message.
-  */
-  void
-  throw_dimension_incompatible(const char* method,
-			       const char* name_var,
-			       Variable v) const;
-
-  //! Returns the epsilon coefficient. The constraint must be NNC.
-  Coefficient_traits::const_reference epsilon_coefficient() const;
-
-  //! Sets the epsilon coefficient to \p n. The constraint must be NNC.
-  void set_epsilon_coefficient(Coefficient_traits::const_reference n);
-
-  //! Marks the epsilon dimension as a standard dimension.
-  /*!
-    The row topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is increased by 1.
-  */
-  void mark_as_necessarily_closed();
-
-  //! Marks the last dimension as the epsilon dimension.
-  /*!
-    The row topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is decreased by 1.
-  */
-  void mark_as_not_necessarily_closed();
-
-  //! Sets the constraint type to <CODE>EQUALITY</CODE>.
-  void set_is_equality();
-
-  //! Sets the constraint to be an inequality.
-  /*!
-    Whether the constraint type will become <CODE>NONSTRICT_INEQUALITY</CODE>
-    or <CODE>STRICT_INEQUALITY</CODE> depends on the topology and the value
-    of the low-level coefficients of the constraint.
-  */
-  void set_is_inequality();
-
-  //! Linearly combines \p *this with \p y so that i-th coefficient is 0.
-  /*!
-    \param y
-    The Constraint that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting Constraint to \p *this and normalizes it.
-  */
-  void linear_combine(const Constraint& y, dimension_type i);
-
-  /*! \brief
-    Normalizes the sign of the coefficients so that the first non-zero
-    (homogeneous) coefficient of a line-or-equality is positive.
-  */
-  void sign_normalize();
-
-  /*! \brief
-    Strong normalization: ensures that different Constraint objects
-    represent different hyperplanes or hyperspaces.
-
-    Applies both Constraint::normalize() and Constraint::sign_normalize().
-  */
-  void strong_normalize();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the coefficients are
-    strongly normalized.
-  */
-  bool check_strong_normalized() const;
-
-  /*! \brief
-    Builds a new copy of the zero-dimension space constraint
-    \f$\epsilon \geq 0\f$ (used to implement NNC polyhedra).
-  */
-  static Constraint construct_epsilon_geq_zero();
-
-  friend int
-  compare(const Constraint& x, const Constraint& y);
-
-  friend class Linear_System<Constraint>;
-  friend class Constraint_System;
-  friend class Polyhedron;
-  friend class Scalar_Products;
-  friend class Topology_Adjusted_Scalar_Product_Sign;
-  friend class Termination_Helpers;
-  friend class Grid;
-  template <typename T>
-  friend class Octagonal_Shape;
-
-  friend Constraint
-  operator<(const Linear_Expression& e1, const Linear_Expression& e2);
-
-  friend Constraint
-  operator<(Variable v1, Variable v2);
-
-  friend Constraint
-  operator<(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Constraint
-  operator<(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-  friend Constraint
-  operator>(const Linear_Expression& e1, const Linear_Expression& e2);
-
-  friend Constraint
-  operator>(Variable v1, Variable v2);
-
-  friend Constraint
-  operator>(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Constraint
-  operator>(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-  friend Constraint
-  operator==(const Linear_Expression& e1, const Linear_Expression& e2);
-
-  friend Constraint
-  operator==(Variable v1, Variable v2);
-
-  friend Constraint
-  operator==(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Constraint
-  operator==(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-  friend Constraint
-  operator<=(const Linear_Expression& e1, const Linear_Expression& e2);
-
-  friend Constraint
-  operator<=(Variable v1, Variable v2);
-
-  friend Constraint
-  operator<=(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Constraint
-  operator<=(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-  friend Constraint
-  operator>=(const Linear_Expression& e1, const Linear_Expression& e2);
-
-  friend Constraint
-  operator>=(Variable v1, Variable v2);
-
-  friend Constraint
-  operator>=(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Constraint
-  operator>=(Coefficient_traits::const_reference n, const Linear_Expression& e);
-};
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Constraint */
-std::ostream& operator<<(std::ostream& s, const Constraint& c);
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Constraint */
-std::ostream& operator<<(std::ostream& s, const Constraint::Type& t);
-
-} // namespace IO_Operators
-
-//! Returns <CODE>true</CODE> if and only if \p x is equivalent to \p y.
-/*! \relates Constraint */
-bool
-operator==(const Constraint& x, const Constraint& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x is not equivalent to \p y.
-/*! \relates Constraint */
-bool
-operator!=(const Constraint& x, const Constraint& y);
-
-/*! \relates Constraint */
-void swap(Constraint& x, Constraint& y);
-
-} // namespace Parma_Polyhedra_Library
-
-
-#include "Constraint.inlines.hh"
-
-#endif // !defined(PPL_Constraint_defs_hh)
diff --git a/src/Constraint.inlines.hh b/src/Constraint.inlines.hh
deleted file mode 100644
index 68823ca..0000000
--- a/src/Constraint.inlines.hh
+++ /dev/null
@@ -1,588 +0,0 @@
-/* Constraint class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Constraint_inlines_hh
-#define PPL_Constraint_inlines_hh 1
-
-#include "Linear_Expression.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline bool
-Constraint::is_necessarily_closed() const {
-  return (topology_ == NECESSARILY_CLOSED);
-}
-
-inline bool
-Constraint::is_not_necessarily_closed() const {
-  return !is_necessarily_closed();
-}
-
-inline dimension_type
-Constraint::space_dimension() const {
-  return wrapped_expr.space_dimension();
-}
-
-inline void
-Constraint::shift_space_dimensions(Variable v, dimension_type n) {
-  expr.shift_space_dimensions(v, n);
-}
-
-inline bool
-Constraint::is_line_or_equality() const {
-  return (kind_ == LINE_OR_EQUALITY);
-}
-
-inline bool
-Constraint::is_ray_or_point_or_inequality() const {
-  return (kind_ == RAY_OR_POINT_OR_INEQUALITY);
-}
-
-inline Topology
-Constraint::topology() const {
-  return topology_;
-}
-
-inline void
-Constraint::set_is_line_or_equality() {
-  kind_ = LINE_OR_EQUALITY;
-}
-
-inline void
-Constraint::set_is_ray_or_point_or_inequality() {
-  kind_ = RAY_OR_POINT_OR_INEQUALITY;
-}
-
-inline void
-Constraint::set_topology(Topology x) {
-  if (topology() == x)
-    return;
-  if (topology() == NECESSARILY_CLOSED) {
-    // Add a column for the epsilon dimension.
-    expr.set_space_dimension(expr.space_dimension() + 1);
-    wrapped_expr.set_hide_last(true);
-  } else {
-    PPL_ASSERT(expr.space_dimension() != 0);
-    expr.set_space_dimension(expr.space_dimension() - 1);
-    wrapped_expr.set_hide_last(false);
-  }
-  topology_ = x;
-}
-
-inline void
-Constraint::mark_as_necessarily_closed() {
-  PPL_ASSERT(is_not_necessarily_closed());
-  topology_ = NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(false);
-}
-
-inline void
-Constraint::mark_as_not_necessarily_closed() {
-  PPL_ASSERT(is_necessarily_closed());
-  topology_ = NOT_NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(true);
-}
-
-inline void
-Constraint::set_necessarily_closed() {
-  set_topology(NECESSARILY_CLOSED);
-}
-
-inline void
-Constraint::set_not_necessarily_closed() {
-  set_topology(NOT_NECESSARILY_CLOSED);
-}
-
-inline
-Constraint::Constraint(Representation r)
-  : expr(r),
-    wrapped_expr(expr, false),
-    kind_(RAY_OR_POINT_OR_INEQUALITY),
-    topology_(NECESSARILY_CLOSED) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::Constraint(dimension_type space_dim, Kind kind, Topology topology,
-                       Representation r)
-  : expr(r),
-    wrapped_expr(expr, topology == NOT_NECESSARILY_CLOSED),
-    kind_(kind),
-    topology_(topology) {
-  expr.set_space_dimension(space_dim + 1);
-  PPL_ASSERT(space_dimension() == space_dim);
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::Constraint(Linear_Expression& e, Kind kind, Topology topology)
-  : wrapped_expr(expr, topology == NOT_NECESSARILY_CLOSED),
-    kind_(kind),
-    topology_(topology) {
-  PPL_ASSERT(kind != RAY_OR_POINT_OR_INEQUALITY || topology == NOT_NECESSARILY_CLOSED);
-  swap(expr, e);
-  if (topology == NOT_NECESSARILY_CLOSED)
-    // Add the epsilon dimension.
-    expr.set_space_dimension(expr.space_dimension() + 1);
-  strong_normalize();
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::Constraint(Linear_Expression& e, Type type, Topology topology)
-  : wrapped_expr(expr, topology == NOT_NECESSARILY_CLOSED),
-    topology_(topology) {
-  PPL_ASSERT(type != STRICT_INEQUALITY || topology == NOT_NECESSARILY_CLOSED);
-  swap(expr, e);
-  if (topology == NOT_NECESSARILY_CLOSED)
-    expr.set_space_dimension(expr.space_dimension() + 1);
-  if (type == EQUALITY)
-    kind_ = LINE_OR_EQUALITY;
-  else
-    kind_ = RAY_OR_POINT_OR_INEQUALITY;
-  strong_normalize();
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::Constraint(const Constraint& c)
-  : expr(c.expr),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
-    kind_(c.kind_),
-    topology_(c.topology_) {
-  // NOTE: This does not call PPL_ASSERT(OK()) because this is called by OK().
-}
-
-inline
-Constraint::Constraint(const Constraint& c, Representation r)
-  : expr(c.expr, r),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
-    kind_(c.kind_),
-    topology_(c.topology_) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::Constraint(const Constraint& c, const dimension_type space_dim)
-  : expr(c.expr, c.is_necessarily_closed() ? space_dim : (space_dim + 1)),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
-    kind_(c.kind_), topology_(c.topology_) {
-  PPL_ASSERT(space_dimension() == space_dim);
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::Constraint(const Constraint& c, const dimension_type space_dim,
-                       Representation r)
-  : expr(c.expr, c.is_necessarily_closed() ? space_dim : (space_dim + 1), r),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
-    kind_(c.kind_), topology_(c.topology_) {
-  PPL_ASSERT(space_dimension() == space_dim);
-  PPL_ASSERT(OK());
-}
-
-inline
-Constraint::~Constraint() {
-}
-
-inline Constraint&
-Constraint::operator=(const Constraint& c) {
-  Constraint tmp = c;
-  swap(*this, tmp);
-
-  return *this;
-}
-
-inline const Constraint::Expression&
-Constraint::expression() const {
-  return wrapped_expr;
-}
-
-inline Representation
-Constraint::representation() const {
-  return expr.representation();
-}
-
-inline void
-Constraint::set_representation(Representation r) {
-  expr.set_representation(r);
-}
-
-inline dimension_type
-Constraint::max_space_dimension() {
-  return Linear_Expression::max_space_dimension();
-}
-
-inline void
-Constraint::set_space_dimension_no_ok(dimension_type space_dim) {
-  const dimension_type old_expr_space_dim = expr.space_dimension();
-  if (topology() == NECESSARILY_CLOSED) {
-    expr.set_space_dimension(space_dim);
-  } else {
-    const dimension_type old_space_dim = space_dimension();
-    if (space_dim > old_space_dim) {
-      expr.set_space_dimension(space_dim + 1);
-      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-    } else {
-      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-      expr.set_space_dimension(space_dim + 1);
-    }
-  }
-  PPL_ASSERT(space_dimension() == space_dim);
-  if (expr.space_dimension() < old_expr_space_dim)
-    strong_normalize();
-}
-
-inline void
-Constraint::set_space_dimension(dimension_type space_dim) {
-  set_space_dimension_no_ok(space_dim);
-  PPL_ASSERT(OK());
-}
-
-inline bool
-Constraint::remove_space_dimensions(const Variables_Set& vars) {
-  expr.remove_space_dimensions(vars);
-  return true;
-}
-
-inline bool
-Constraint::is_equality() const {
-  return is_line_or_equality();
-}
-
-inline bool
-Constraint::is_inequality() const {
-  return is_ray_or_point_or_inequality();
-}
-
-inline Constraint::Type
-Constraint::type() const {
-  if (is_equality())
-    return EQUALITY;
-  if (is_necessarily_closed())
-    return NONSTRICT_INEQUALITY;
-  if (epsilon_coefficient() < 0)
-    return STRICT_INEQUALITY;
-  else
-    return NONSTRICT_INEQUALITY;
-}
-
-inline bool
-Constraint::is_nonstrict_inequality() const {
-  return type() == NONSTRICT_INEQUALITY;
-}
-
-inline bool
-Constraint::is_strict_inequality() const {
-  return type() == STRICT_INEQUALITY;
-}
-
-inline void
-Constraint::set_is_equality() {
-  set_is_line_or_equality();
-}
-
-inline void
-Constraint::set_is_inequality() {
-  set_is_ray_or_point_or_inequality();
-}
-
-inline Coefficient_traits::const_reference
-Constraint::coefficient(const Variable v) const {
-  if (v.space_dimension() > space_dimension())
-    throw_dimension_incompatible("coefficient(v)", "v", v);
-  return expr.coefficient(v);
-}
-
-inline Coefficient_traits::const_reference
-Constraint::inhomogeneous_term() const {
-  return expr.inhomogeneous_term();
-}
-
-inline memory_size_type
-Constraint::external_memory_in_bytes() const {
-  return expr.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Constraint::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline void
-Constraint::strong_normalize() {
-  expr.normalize();
-  sign_normalize();
-}
-
-/*! \relates Constraint */
-inline bool
-operator==(const Constraint& x, const Constraint& y) {
-  return x.is_equivalent_to(y);
-}
-
-/*! \relates Constraint */
-inline bool
-operator!=(const Constraint& x, const Constraint& y) {
-  return !x.is_equivalent_to(y);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator==(const Linear_Expression& e1, const Linear_Expression& e2) {
-  Linear_Expression diff(e1,
-                         std::max(e1.space_dimension(), e2.space_dimension()),
-                         Constraint::default_representation);
-  diff -= e2;
-  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator==(Variable v1, Variable v2) {
-  if (v1.space_dimension() > v2.space_dimension())
-    swap(v1, v2);
-  PPL_ASSERT(v1.space_dimension() <= v2.space_dimension());
-
-  Linear_Expression diff(v1, Constraint::default_representation);
-  diff -= v2;
-  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>=(const Linear_Expression& e1, const Linear_Expression& e2) {
-  Linear_Expression diff(e1,
-                         std::max(e1.space_dimension(), e2.space_dimension()),
-                         Constraint::default_representation);
-  diff -= e2;
-  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>=(const Variable v1, const Variable v2) {
-  Linear_Expression diff(Constraint::default_representation);
-  diff.set_space_dimension(std::max(v1.space_dimension(),
-                                    v2.space_dimension()));
-  diff += v1;
-  diff -= v2;
-  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>(const Linear_Expression& e1, const Linear_Expression& e2) {
-  Linear_Expression diff(e1, Constraint::default_representation);
-  diff -= e2;
-  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
-
-  // NOTE: this also enforces normalization.
-  c.set_epsilon_coefficient(-1);
-  PPL_ASSERT(c.OK());
-
-  return c;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>(const Variable v1, const Variable v2) {
-  Linear_Expression diff(Constraint::default_representation);
-  diff.set_space_dimension(std::max(v1.space_dimension(),
-                                    v2.space_dimension()));
-  diff += v1;
-  diff -= v2;
-  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
-
-  c.set_epsilon_coefficient(-1);
-  PPL_ASSERT(c.OK());
-
-  return c;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator==(Coefficient_traits::const_reference n, const Linear_Expression& e) {
-  Linear_Expression diff(e, Constraint::default_representation);
-  neg_assign(diff);
-  diff += n;
-  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>=(Coefficient_traits::const_reference n, const Linear_Expression& e) {
-  Linear_Expression diff(e, Constraint::default_representation);
-  neg_assign(diff);
-  diff += n;
-  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>(Coefficient_traits::const_reference n, const Linear_Expression& e) {
-  Linear_Expression diff(e, Constraint::default_representation);
-  neg_assign(diff);
-  diff += n;
-  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
-
-  // NOTE: this also enforces normalization.
-  c.set_epsilon_coefficient(-1);
-  PPL_ASSERT(c.OK());
-
-  return c;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator==(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  Linear_Expression diff(e, Constraint::default_representation);
-  diff -= n;
-  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>=(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  Linear_Expression diff(e, Constraint::default_representation);
-  diff -= n;
-  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator>(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  Linear_Expression diff(e, Constraint::default_representation);
-  diff -= n;
-  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
-
-  // NOTE: this also enforces normalization.
-  c.set_epsilon_coefficient(-1);
-  PPL_ASSERT(c.OK());
-
-  return c;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<=(const Linear_Expression& e1, const Linear_Expression& e2) {
-  return e2 >= e1;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<=(const Variable v1, const Variable v2) {
-  return v2 >= v1;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<=(Coefficient_traits::const_reference n, const Linear_Expression& e) {
-  return e >= n;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<=(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  return n >= e;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<(const Linear_Expression& e1, const Linear_Expression& e2) {
-  return e2 > e1;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<(const Variable v1, const Variable v2) {
-  return v2 > v1;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<(Coefficient_traits::const_reference n, const Linear_Expression& e) {
-  return e > n;
-}
-
-/*! \relates Constraint */
-inline Constraint
-operator<(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  return n > e;
-}
-
-inline const Constraint&
-Constraint::zero_dim_false() {
-  PPL_ASSERT(zero_dim_false_p != 0);
-  return *zero_dim_false_p;
-}
-
-inline const Constraint&
-Constraint::zero_dim_positivity() {
-  PPL_ASSERT(zero_dim_positivity_p != 0);
-  return *zero_dim_positivity_p;
-}
-
-inline const Constraint&
-Constraint::epsilon_geq_zero() {
-  PPL_ASSERT(epsilon_geq_zero_p != 0);
-  return *epsilon_geq_zero_p;
-}
-
-inline const Constraint&
-Constraint::epsilon_leq_one() {
-  PPL_ASSERT(epsilon_leq_one_p != 0);
-  return *epsilon_leq_one_p;
-}
-
-inline void
-Constraint::m_swap(Constraint& y) {
-  using std::swap;
-  swap(expr, y.expr);
-  swap(kind_, y.kind_);
-  swap(topology_, y.topology_);
-  wrapped_expr.set_hide_last(is_not_necessarily_closed());
-  y.wrapped_expr.set_hide_last(y.is_not_necessarily_closed());
-}
-
-inline Coefficient_traits::const_reference
-Constraint::epsilon_coefficient() const {
-  PPL_ASSERT(is_not_necessarily_closed());
-  return expr.coefficient(Variable(expr.space_dimension() - 1));
-}
-
-inline void
-Constraint::set_epsilon_coefficient(Coefficient_traits::const_reference n) {
-  PPL_ASSERT(is_not_necessarily_closed());
-  expr.set_coefficient(Variable(expr.space_dimension() - 1), n);
-}
-
-/*! \relates Constraint */
-inline void
-swap(Constraint& x, Constraint& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Constraint_inlines_hh)
diff --git a/src/Constraint.types.hh b/src/Constraint.types.hh
deleted file mode 100644
index b272e2c..0000000
--- a/src/Constraint.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Constraint_types_hh
-#define PPL_Constraint_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Constraint;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Constraint_types_hh)
diff --git a/src/Constraint_System.cc b/src/Constraint_System.cc
index 8150a9e..03cef66 100644
--- a/src/Constraint_System.cc
+++ b/src/Constraint_System.cc
@@ -1,6 +1,6 @@
 /* Constraint_System class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,13 +22,13 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Generator.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Generator_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
 #include "assert.hh"
 #include <string>
 #include <vector>
@@ -41,7 +41,7 @@ PPL::Constraint_System::Constraint_System(const Congruence_System& cgs,
                                           Representation r)
   : sys(NECESSARILY_CLOSED, cgs.space_dimension(), r) {
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i)
+         cgs_end = cgs.end(); i != cgs_end; ++i)
     if (i->is_equality()) {
       Constraint tmp(*i);
       insert(tmp, Recycle_Input());
@@ -52,7 +52,7 @@ PPL::Constraint_System::Constraint_System(const Congruence_System& cgs,
 bool
 PPL::Constraint_System::
 adjust_topology_and_space_dimension(const Topology new_topology,
-				    const dimension_type new_space_dim) {
+                                    const dimension_type new_space_dim) {
   PPL_ASSERT(space_dimension() <= new_space_dim);
 
   if (sys.topology() == NOT_NECESSARILY_CLOSED
@@ -68,7 +68,7 @@ adjust_topology_and_space_dimension(const Topology new_topology,
     // If they are present, we erase these rows, so that the
     // epsilon column will only contain zeroes: as a consequence,
     // we just decrement the number of columns to be added.
-    bool was_sorted = sys.is_sorted();
+    const bool was_sorted = sys.is_sorted();
 
     // Note that num_rows() is *not* constant, because it is decreased by
     // remove_row().
@@ -176,7 +176,7 @@ PPL::Constraint_System::num_inequalities() const {
   else
     for (dimension_type i = sys.num_rows(); i-- > 0 ; )
       if (cs[i].is_inequality())
-	++n;
+        ++n;
   return n;
 }
 
@@ -202,30 +202,30 @@ PPL::Constraint_System::satisfies_all_constraints(const Generator& g) const {
   // Setting `sps' to the appropriate scalar product sign operator.
   // This also avoids problems when having _legal_ topology mismatches
   // (which could also cause a mismatch in the number of columns).
-  Topology_Adjusted_Scalar_Product_Sign sps(g);
+  const Topology_Adjusted_Scalar_Product_Sign sps(g);
 
   if (sys.is_necessarily_closed()) {
     if (g.is_line()) {
       // Lines must saturate all constraints.
       for (dimension_type i = sys.num_rows(); i-- > 0; )
-	if (sps(g, sys[i]) != 0)
-	  return false;
+        if (sps(g, sys[i]) != 0)
+          return false;
     }
     else
       // `g' is either a ray, a point or a closure point.
       for (dimension_type i = sys.num_rows(); i-- > 0; ) {
         const Constraint& c = sys[i];
-	const int sp_sign = sps(g, c);
-	if (c.is_inequality()) {
-	  // As `cs' is necessarily closed,
-	  // `c' is a non-strict inequality.
-	  if (sp_sign < 0)
-	    return false;
-	}
-	else
-	  // `c' is an equality.
-	  if (sp_sign != 0)
-	    return false;
+        const int sp_sign = sps(g, c);
+        if (c.is_inequality()) {
+          // As `cs' is necessarily closed,
+          // `c' is a non-strict inequality.
+          if (sp_sign < 0)
+            return false;
+        }
+        else
+          // `c' is an equality.
+          if (sp_sign != 0)
+            return false;
       }
   }
   else
@@ -235,8 +235,8 @@ PPL::Constraint_System::satisfies_all_constraints(const Generator& g) const {
     case Generator::LINE:
       // Lines must saturate all constraints.
       for (dimension_type i = sys.num_rows(); i-- > 0; )
-	if (sps(g, sys[i]) != 0)
-	  return false;
+        if (sps(g, sys[i]) != 0)
+          return false;
 
       break;
 
@@ -245,21 +245,21 @@ PPL::Constraint_System::satisfies_all_constraints(const Generator& g) const {
       // when dealing with a strict inequality.
       for (dimension_type i = sys.num_rows(); i-- > 0; ) {
         const Constraint& c = sys[i];
-	const int sp_sign = sps(g, c);
-	switch (c.type()) {
-	case Constraint::EQUALITY:
-	  if (sp_sign != 0)
-	    return false;
-	  break;
-	case Constraint::NONSTRICT_INEQUALITY:
-	  if (sp_sign < 0)
-	    return false;
-	  break;
-	case Constraint::STRICT_INEQUALITY:
-	  if (sp_sign <= 0)
-	    return false;
-	  break;
-	}
+        const int sp_sign = sps(g, c);
+        switch (c.type()) {
+        case Constraint::EQUALITY:
+          if (sp_sign != 0)
+            return false;
+          break;
+        case Constraint::NONSTRICT_INEQUALITY:
+          if (sp_sign < 0)
+            return false;
+          break;
+        case Constraint::STRICT_INEQUALITY:
+          if (sp_sign <= 0)
+            return false;
+          break;
+        }
       }
       break;
 
@@ -268,16 +268,16 @@ PPL::Constraint_System::satisfies_all_constraints(const Generator& g) const {
     case Generator::CLOSURE_POINT:
       for (dimension_type i = sys.num_rows(); i-- > 0; ) {
         const Constraint& c = sys[i];
-	const int sp_sign = sps(g, c);
-	if (c.is_inequality()) {
-	  // Constraint `c' is either a strict or a non-strict inequality.
-	  if (sp_sign < 0)
-	    return false;
-	}
-	else
-	  // Constraint `c' is an equality.
-	  if (sp_sign != 0)
-	    return false;
+        const int sp_sign = sps(g, c);
+        if (c.is_inequality()) {
+          // Constraint `c' is either a strict or a non-strict inequality.
+          if (sp_sign < 0)
+            return false;
+        }
+        else
+          // Constraint `c' is an equality.
+          if (sp_sign != 0)
+            return false;
       }
       break;
     }
@@ -290,8 +290,8 @@ PPL::Constraint_System::satisfies_all_constraints(const Generator& g) const {
 void
 PPL::Constraint_System
 ::affine_preimage(const Variable v,
-		  const Linear_Expression& expr,
-		  Coefficient_traits::const_reference denominator) {
+                  const Linear_Expression& expr,
+                  Coefficient_traits::const_reference denominator) {
   PPL_ASSERT(v.space_dimension() <= sys.space_dimension());
   PPL_ASSERT(expr.space_dimension() <= sys.space_dimension());
   PPL_ASSERT(denominator > 0);
@@ -306,7 +306,7 @@ PPL::Constraint_System
     Constraint& row = sys.rows[i];
     Coefficient_traits::const_reference row_v = row.coefficient(v);
     if (row_v != 0) {
-      Coefficient c = row_v;
+      const Coefficient c = row_v;
       if (denominator != 1)
         row.expr *= denominator;
       row.expr.linear_combine(expr, 1, c, 0, expr.space_dimension() + 1);
@@ -374,7 +374,7 @@ PPL::IO_Operators::operator<<(std::ostream& s, const Constraint_System& cs) {
       s << *i;
       ++i;
       if (i != cs_end)
-	s << ", ";
+        s << ", ";
     }
   }
   return s;
diff --git a/src/Constraint_System.defs.hh b/src/Constraint_System.defs.hh
deleted file mode 100644
index 0c5d973..0000000
--- a/src/Constraint_System.defs.hh
+++ /dev/null
@@ -1,687 +0,0 @@
-/* Constraint_System class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Constraint_System_defs_hh
-#define PPL_Constraint_System_defs_hh 1
-
-#include "Constraint_System.types.hh"
-
-#include "Linear_System.defs.hh"
-#include "Constraint.defs.hh"
-
-#include "Linear_Expression.types.hh"
-#include "Generator.types.hh"
-#include "Constraint.types.hh"
-#include "Congruence_System.types.hh"
-#include "Polyhedron.types.hh"
-#include "termination.types.hh"
-#include <iterator>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Constraint_System
-  Writes <CODE>true</CODE> if \p cs is empty.  Otherwise, writes on
-  \p s the constraints of \p cs, all in one row and separated by ", ".
-*/
-std::ostream& operator<<(std::ostream& s, const Constraint_System& cs);
-
-} // namespace IO_Operators
-
-// TODO: Consider removing this.
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates Constraint_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator==(const Constraint_System& x, const Constraint_System& y);
-
-// TODO: Consider removing this.
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Constraint_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator!=(const Constraint_System& x, const Constraint_System& y);
-
-/*! \relates Constraint_System */
-void
-swap(Constraint_System& x, Constraint_System& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A system of constraints.
-/*! \ingroup PPL_CXX_interface
-    An object of the class Constraint_System is a system of constraints,
-    i.e., a multiset of objects of the class Constraint.
-    When inserting constraints in a system, space dimensions are
-    automatically adjusted so that all the constraints in the system
-    are defined on the same vector space.
-
-    \par
-    In all the examples it is assumed that variables
-    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
-    \code
-  Variable x(0);
-  Variable y(1);
-    \endcode
-
-    \par Example 1
-    The following code builds a system of constraints corresponding to
-    a square in \f$\Rset^2\f$:
-    \code
-  Constraint_System cs;
-  cs.insert(x >= 0);
-  cs.insert(x <= 3);
-  cs.insert(y >= 0);
-  cs.insert(y <= 3);
-    \endcode
-    Note that:
-    the constraint system is created with space dimension zero;
-    the first and third constraint insertions increase the space
-    dimension to \f$1\f$ and \f$2\f$, respectively.
-
-    \par Example 2
-    By adding four strict inequalities to the constraint system
-    of the previous example, we can remove just the four
-    vertices from the square defined above.
-    \code
-  cs.insert(x + y > 0);
-  cs.insert(x + y < 6);
-  cs.insert(x - y < 3);
-  cs.insert(y - x < 3);
-    \endcode
-
-    \par Example 3
-    The following code builds a system of constraints corresponding to
-    a half-strip in \f$\Rset^2\f$:
-    \code
-  Constraint_System cs;
-  cs.insert(x >= 0);
-  cs.insert(x - y <= 0);
-  cs.insert(x - y + 1 >= 0);
-    \endcode
-
-    \note
-    After inserting a multiset of constraints in a constraint system,
-    there are no guarantees that an <EM>exact</EM> copy of them
-    can be retrieved:
-    in general, only an <EM>equivalent</EM> constraint system
-    will be available, where original constraints may have been
-    reordered, removed (if they are trivial, duplicate or
-    implied by other constraints), linearly combined, etc.
-*/
-class Parma_Polyhedra_Library::Constraint_System {
-public:
-  typedef Constraint row_type;
-
-  static const Representation default_representation = SPARSE;
-
-  //! Default constructor: builds an empty system of constraints.
-  explicit Constraint_System(Representation r = default_representation);
-
-  //! Builds the singleton system containing only constraint \p c.
-  explicit Constraint_System(const Constraint& c,
-                             Representation r = default_representation);
-
-  //! Builds a system containing copies of any equalities in \p cgs.
-  explicit Constraint_System(const Congruence_System& cgs,
-                             Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  /*!
-    \note The copy will have the same representation as `cs', to make it
-          indistinguishable from `cs'.
-  */
-  Constraint_System(const Constraint_System& cs);
-
-  //! Copy constructor with specified representation.
-  Constraint_System(const Constraint_System& cs, Representation r);
-
-  //! Destructor.
-  ~Constraint_System();
-
-  //! Assignment operator.
-  Constraint_System& operator=(const Constraint_System& y);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Constraint_System can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  void set_space_dimension(dimension_type space_dim);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains one or more equality constraints.
-  */
-  bool has_equalities() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains one or more strict inequality constraints.
-  */
-  bool has_strict_inequalities() const;
-
-  /*! \brief
-    Inserts in \p *this a copy of the constraint \p c,
-    increasing the number of space dimensions if needed.
-  */
-  void insert(const Constraint& c);
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  /*! \brief
-    Returns the singleton system containing only Constraint::zero_dim_false().
-  */
-  static const Constraint_System& zero_dim_empty();
-
-  typedef Constraint_System_const_iterator const_iterator;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this has no constraints.
-  bool empty() const;
-
-  /*! \brief
-    Removes all the constraints from the constraint system
-    and sets its space dimension to 0.
-  */
-  void clear();
-
-  /*! \brief
-    Returns the const_iterator pointing to the first constraint,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const_iterator.
-  const_iterator end() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Constraint_System& y);
-
-private:
-  Linear_System<Constraint> sys;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the singleton system containing only Constraint::zero_dim_false().
-  */
-  static const Constraint_System* zero_dim_empty_p;
-
-  friend class Constraint_System_const_iterator;
-
-  friend bool operator==(const Constraint_System& x,
-                         const Constraint_System& y);
-
-  //! Builds an empty system of constraints having the specified topology.
-  explicit Constraint_System(Topology topol,
-                             Representation r = default_representation);
-
-  /*! \brief
-    Builds a system of constraints on a \p space_dim dimensional space. If
-    \p topol is <CODE>NOT_NECESSARILY_CLOSED</CODE> the \f$\epsilon\f$
-    dimension is added.
-  */
-  Constraint_System(Topology topol, dimension_type space_dim,
-                    Representation r = default_representation);
-
-  //! Returns the number of equality constraints.
-  dimension_type num_equalities() const;
-
-  //! Returns the number of inequality constraints.
-  dimension_type num_inequalities() const;
-
-  /*! \brief
-    Applies Gaussian elimination and back-substitution so as
-    to provide a partial simplification of the system of constraints.
-
-    It is assumed that the system has no pending constraints.
-  */
-  void simplify();
-
-  /*! \brief
-    Adjusts \p *this so that it matches \p new_topology and
-    \p new_space_dim (adding or removing columns if needed).
-    Returns <CODE>false</CODE> if and only if \p topol is
-    equal to <CODE>NECESSARILY_CLOSED</CODE> and \p *this
-    contains strict inequalities.
-  */
-  bool adjust_topology_and_space_dimension(Topology new_topology,
-                                           dimension_type new_space_dim);
-
-  //! Returns a constant reference to the \p k- th constraint of the system.
-  const Constraint& operator[](dimension_type k) const;
-
-  //! Returns <CODE>true</CODE> if \p g satisfies all the constraints.
-  bool satisfies_all_constraints(const Generator& g) const;
-
-  //! Substitutes a given column of coefficients by a given affine expression.
-  /*!
-    \param v
-    The variable to which the affine transformation is substituted.
-
-    \param expr
-    The numerator of the affine transformation:
-    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
-
-    \param denominator
-    The denominator of the affine transformation.
-
-    We want to allow affine transformations
-    (see Section \ref Images_and_Preimages_of_Affine_Transfer_Relations)
-    having any rational coefficients. Since the coefficients of the
-    constraints are integers we must also provide an integer \p
-    denominator that will be used as denominator of the affine
-    transformation.
-    The denominator is required to be a positive integer.
-
-    The affine transformation substitutes the matrix of constraints
-    by a new matrix whose elements \f${a'}_{ij}\f$ are built from
-    the old one \f$a_{ij}\f$ as follows:
-    \f[
-      {a'}_{ij} =
-        \begin{cases}
-          a_{ij} * \mathrm{denominator} + a_{iv} * \mathrm{expr}[j]
-            \quad \text{for } j \neq v; \\
-          \mathrm{expr}[v] * a_{iv}
-            \quad \text{for } j = v.
-        \end{cases}
-    \f]
-
-    \p expr is a constant parameter and unaltered by this computation.
-  */
-  void affine_preimage(Variable v,
-                       const Linear_Expression& expr,
-                       Coefficient_traits::const_reference denominator);
-
-  /*! \brief
-    Inserts in \p *this a copy of the constraint \p c,
-    increasing the number of space dimensions if needed.
-    It is a pending constraint.
-  */
-  void insert_pending(const Constraint& c);
-
-  //! Adds low-level constraints to the constraint system.
-  void add_low_level_constraints();
-
-  //! Returns the system topology.
-  Topology topology() const;
-
-  dimension_type num_rows() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    the system topology is <CODE>NECESSARILY_CLOSED</CODE>.
-  */
-  bool is_necessarily_closed() const;
-
-  //! Returns the number of rows that are in the pending part of the system.
-  dimension_type num_pending_rows() const;
-
-  //! Returns the index of the first pending row.
-  dimension_type first_pending_row() const;
-
-  //! Returns the value of the sortedness flag.
-  bool is_sorted() const;
-
-  //! Sets the index to indicate that the system has no pending rows.
-  void unset_pending_rows();
-
-  //! Sets the index of the first pending row to \p i.
-  void set_index_first_pending_row(dimension_type i);
-
-  //! Sets the sortedness flag of the system to \p b.
-  void set_sorted(bool b);
-
-  //! Makes the system shrink by removing its i-th row.
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(n).
-
-    Otherwise, this method just swaps the i-th row with the last and then
-    removes it, so it costs O(1).
-  */
-  void remove_row(dimension_type i, bool keep_sorted = false);
-
-  //! Removes the specified rows. The row ordering of remaining rows is
-  //! preserved.
-  /*!
-    \param indexes specifies a list of row indexes.
-                   It must be sorted.
-  */
-  void remove_rows(const std::vector<dimension_type>& indexes);
-
-  //! Makes the system shrink by removing the rows in [first,last).
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(num_rows()).
-
-    Otherwise, this method just swaps the rows with the last ones and then
-    removes them, so it costs O(last - first).
-  */
-  void remove_rows(dimension_type first, dimension_type last,
-                   bool keep_sorted = false);
-
-  //! Makes the system shrink by removing its \p n trailing rows.
-  void remove_trailing_rows(dimension_type n);
-
-  //! Removes all the specified dimensions from the constraint system.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Permutes the space dimensions of the matrix.
-  /*
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    columns must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  bool has_no_rows() const;
-
-  //! Strongly normalizes the system.
-  void strong_normalize();
-
-  /*! \brief
-    Sorts the non-pending rows (in growing order) and eliminates
-    duplicated ones.
-  */
-  void sort_rows();
-
-  /*! \brief
-    Adds the given row to the pending part of the system, stealing its
-    contents and automatically resizing the system or the row, if needed.
-  */
-  void insert_pending(Constraint& r, Recycle_Input);
-
-  //! Adds the rows of `y' to the pending part of `*this', stealing them from
-  //! `y'.
-  void insert_pending(Constraint_System& r, Recycle_Input);
-
-  /*! \brief
-    Adds \p r to the system, stealing its contents and
-    automatically resizing the system or the row, if needed.
-  */
-  void insert(Constraint& r, Recycle_Input);
-
-  //! Adds to \p *this a the rows of `y', stealing them from `y'.
-  /*!
-    It is assumed that \p *this has no pending rows.
-  */
-  void insert(Constraint_System& r, Recycle_Input);
-
-  //! Adds a copy of the rows of `y' to the pending part of `*this'.
-  void insert_pending(const Constraint_System& r);
-
-  /*! \brief
-    Assigns to \p *this the result of merging its rows with
-    those of \p y, obtaining a sorted system.
-
-    Duplicated rows will occur only once in the result.
-    On entry, both systems are assumed to be sorted and have
-    no pending rows.
-  */
-  void merge_rows_assign(const Constraint_System& y);
-
-  //! Adds to \p *this a copy of  the rows of \p y.
-  /*!
-    It is assumed that \p *this has no pending rows.
-  */
-  void insert(const Constraint_System& y);
-
-  //! Marks the epsilon dimension as a standard dimension.
-  /*!
-    The system topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is increased by 1.
-  */
-  void mark_as_necessarily_closed();
-
-  //! Marks the last dimension as the epsilon dimension.
-  /*!
-    The system topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is decreased by 1.
-  */
-  void mark_as_not_necessarily_closed();
-
-  //! Minimizes the subsystem of equations contained in \p *this.
-  /*!
-    This method works only on the equalities of the system:
-    the system is required to be partially sorted, so that
-    all the equalities are grouped at its top; it is assumed that
-    the number of equalities is exactly \p n_lines_or_equalities.
-    The method finds a minimal system for the equalities and
-    returns its rank, i.e., the number of linearly independent equalities.
-    The result is an upper triangular subsystem of equalities:
-    for each equality, the pivot is chosen starting from
-    the right-most columns.
-  */
-  dimension_type gauss(dimension_type n_lines_or_equalities);
-
-  /*! \brief
-    Back-substitutes the coefficients to reduce
-    the complexity of the system.
-
-    Takes an upper triangular system having \p n_lines_or_equalities rows.
-    For each row, starting from the one having the minimum number of
-    coefficients different from zero, computes the expression of an element
-    as a function of the remaining ones and then substitutes this expression
-    in all the other rows.
-  */
-  void back_substitute(dimension_type n_lines_or_equalities);
-
-  //! Full assignment operator: pending rows are copied as pending.
-  void assign_with_pending(const Constraint_System& y);
-
-  /*! \brief
-    Sorts the pending rows and eliminates those that also occur
-    in the non-pending part of the system.
-  */
-  void sort_pending_and_remove_duplicates();
-
-  /*! \brief
-    Sorts the system, removing duplicates, keeping the saturation
-    matrix consistent.
-
-    \param sat
-    Bit matrix with rows corresponding to the rows of \p *this.
-  */
-  void sort_and_remove_with_sat(Bit_Matrix& sat);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is sorted,
-    without checking for duplicates.
-  */
-  bool check_sorted() const;
-
-  /*! \brief
-    Returns the number of rows in the system
-    that represent either lines or equalities.
-  */
-  dimension_type num_lines_or_equalities() const;
-
-  //! Adds \p n rows and space dimensions to the system.
-  /*!
-    \param n
-    The number of rows and space dimensions to be added: must be strictly
-    positive.
-
-    Turns the system \f$M \in \Rset^r \times \Rset^c\f$ into
-    the system \f$N \in \Rset^{r+n} \times \Rset^{c+n}\f$
-    such that
-    \f$N = \bigl(\genfrac{}{}{0pt}{}{0}{M}\genfrac{}{}{0pt}{}{J}{o}\bigr)\f$,
-    where \f$J\f$ is the specular image
-    of the \f$n \times n\f$ identity matrix.
-  */
-  void add_universe_rows_and_space_dimensions(dimension_type n);
-
-  friend class Polyhedron;
-  friend class Termination_Helpers;
-};
-
-//! An iterator over a system of constraints.
-/*! \ingroup PPL_CXX_interface
-  A const_iterator is used to provide read-only access
-  to each constraint contained in a Constraint_System object.
-
-  \par Example
-  The following code prints the system of constraints
-  defining the polyhedron <CODE>ph</CODE>:
-  \code
-const Constraint_System& cs = ph.constraints();
-for (Constraint_System::const_iterator i = cs.begin(),
-        cs_end = cs.end(); i != cs_end; ++i)
-  cout << *i << endl;
-  \endcode
-*/
-// NOTE: This is not an inner class of Constraint_System, so Constraint can
-// declare that this class is his friend without including this file
-// (the .types.hh file suffices).
-class Parma_Polyhedra_Library::Constraint_System_const_iterator
-  : public std::iterator<std::forward_iterator_tag,
-                         Constraint,
-                         ptrdiff_t,
-                         const Constraint*,
-                         const Constraint&> {
-public:
-  //! Default constructor.
-  Constraint_System_const_iterator();
-
-  //! Ordinary copy constructor.
-  Constraint_System_const_iterator(const Constraint_System_const_iterator& y);
-
-  //! Destructor.
-  ~Constraint_System_const_iterator();
-
-  //! Assignment operator.
-  Constraint_System_const_iterator&
-  operator=(const Constraint_System_const_iterator& y);
-
-  //! Dereference operator.
-  const Constraint& operator*() const;
-
-  //! Indirect member selector.
-  const Constraint* operator->() const;
-
-  //! Prefix increment operator.
-  Constraint_System_const_iterator& operator++();
-
-  //! Postfix increment operator.
-  Constraint_System_const_iterator operator++(int);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are identical.
-  */
-  bool operator==(const Constraint_System_const_iterator& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are different.
-  */
-  bool operator!=(const Constraint_System_const_iterator& y) const;
-
-private:
-  friend class Constraint_System;
-
-  //! The const iterator over the matrix of constraints.
-  Linear_System<Constraint>::const_iterator i;
-
-  //! A const pointer to the matrix of constraints.
-  const Linear_System<Constraint>* csp;
-
-  //! Constructor.
-  Constraint_System_const_iterator(const Linear_System<Constraint>
-                                   ::const_iterator& iter,
-                                   const Constraint_System& cs);
-
-  //! \p *this skips to the next non-trivial constraint.
-  void skip_forward();
-};
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Helper returning number of constraints in system.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-dimension_type
-num_constraints(const Constraint_System& cs);
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-// Constraint_System.inlines.hh is not included here on purpose.
-
-#endif // !defined(PPL_Constraint_System_defs_hh)
diff --git a/src/Constraint_System.inlines.hh b/src/Constraint_System.inlines.hh
deleted file mode 100644
index 120970c..0000000
--- a/src/Constraint_System.inlines.hh
+++ /dev/null
@@ -1,439 +0,0 @@
-/* Constraint_System class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Constraint_System_inlines_hh
-#define PPL_Constraint_System_inlines_hh 1
-
-#include "Constraint.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Constraint_System::Constraint_System(Representation r)
-  : sys(NECESSARILY_CLOSED, r) {
-}
-
-inline
-Constraint_System::Constraint_System(const Constraint& c, Representation r)
-  : sys(c.topology(), r) {
-  sys.insert(c);
-}
-
-inline
-Constraint_System::Constraint_System(const Constraint_System& cs)
-  : sys(cs.sys) {
-}
-
-inline
-Constraint_System::Constraint_System(const Constraint_System& cs,
-                                     Representation r)
-  : sys(cs.sys, r) {
-}
-
-inline
-Constraint_System::Constraint_System(const Topology topol, Representation r)
-  : sys(topol, r) {
-}
-
-inline
-Constraint_System::Constraint_System(const Topology topol,
-				     const dimension_type space_dim,
-                                     Representation r)
-  : sys(topol, space_dim, r) {
-}
-
-inline
-Constraint_System::~Constraint_System() {
-}
-
-inline Constraint_System&
-Constraint_System::operator=(const Constraint_System& y) {
-  Constraint_System tmp = y;
-  swap(*this, tmp);
-  return *this;
-}
-
-inline const Constraint&
-Constraint_System::operator[](const dimension_type k) const {
-  return sys[k];
-}
-
-inline Representation
-Constraint_System::representation() const {
-  return sys.representation();
-}
-
-inline void
-Constraint_System::set_representation(Representation r) {
-  sys.set_representation(r);
-}
-
-inline dimension_type
-Constraint_System::max_space_dimension() {
-  return Linear_System<Constraint>::max_space_dimension();
-}
-
-inline dimension_type
-Constraint_System::space_dimension() const {
-  return sys.space_dimension();
-}
-
-inline void
-Constraint_System::set_space_dimension(dimension_type space_dim) {
-  return sys.set_space_dimension(space_dim);
-}
-
-inline void
-Constraint_System::clear() {
-  sys.clear();
-}
-
-inline const Constraint_System&
-Constraint_System::zero_dim_empty() {
-  PPL_ASSERT(zero_dim_empty_p != 0);
-  return *zero_dim_empty_p;
-}
-
-inline
-Constraint_System_const_iterator::Constraint_System_const_iterator()
-  : i(), csp(0) {
-}
-
-inline
-Constraint_System_const_iterator::Constraint_System_const_iterator(const Constraint_System_const_iterator& y)
-  : i(y.i), csp(y.csp) {
-}
-
-inline
-Constraint_System_const_iterator::~Constraint_System_const_iterator() {
-}
-
-inline Constraint_System_const_iterator&
-Constraint_System_const_iterator::operator=(const Constraint_System_const_iterator& y) {
-  i = y.i;
-  csp = y.csp;
-  return *this;
-}
-
-inline const Constraint&
-Constraint_System_const_iterator::operator*() const {
-  return *i;
-}
-
-inline const Constraint*
-Constraint_System_const_iterator::operator->() const {
-  return i.operator->();
-}
-
-inline Constraint_System_const_iterator&
-Constraint_System_const_iterator::operator++() {
-  ++i;
-  skip_forward();
-  return *this;
-}
-
-inline Constraint_System_const_iterator
-Constraint_System_const_iterator::operator++(int) {
-  const Constraint_System_const_iterator tmp = *this;
-  operator++();
-  return tmp;
-}
-
-inline bool
-Constraint_System_const_iterator::operator==(const Constraint_System_const_iterator& y) const {
-  return i == y.i;
-}
-
-inline bool
-Constraint_System_const_iterator::operator!=(const Constraint_System_const_iterator& y) const {
-  return i != y.i;
-}
-
-inline
-Constraint_System_const_iterator::
-Constraint_System_const_iterator(const Linear_System<Constraint>::const_iterator& iter,
-	       const Constraint_System& cs)
-  : i(iter), csp(&cs.sys) {
-}
-
-inline Constraint_System_const_iterator
-Constraint_System::begin() const {
-  const_iterator i(sys.begin(), *this);
-  i.skip_forward();
-  return i;
-}
-
-inline Constraint_System_const_iterator
-Constraint_System::end() const {
-  const Constraint_System_const_iterator i(sys.end(), *this);
-  return i;
-}
-
-inline bool
-Constraint_System::empty() const {
-  return begin() == end();
-}
-
-inline void
-Constraint_System::add_low_level_constraints() {
-  if (sys.is_necessarily_closed())
-    // The positivity constraint.
-    insert(Constraint::zero_dim_positivity());
-  else {
-    // Add the epsilon constraints.
-    insert(Constraint::epsilon_leq_one());
-    insert(Constraint::epsilon_geq_zero());
-  }
-}
-
-inline void
-Constraint_System::m_swap(Constraint_System& y) {
-  swap(sys, y.sys);
-}
-
-inline memory_size_type
-Constraint_System::external_memory_in_bytes() const {
-  return sys.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Constraint_System::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-inline void
-Constraint_System::simplify() {
-  sys.simplify();
-}
-
-inline Topology
-Constraint_System::topology() const {
-  return sys.topology();
-}
-
-inline dimension_type
-Constraint_System::num_rows() const {
-  return sys.num_rows();
-}
-
-inline bool
-Constraint_System::is_necessarily_closed() const {
-  return sys.is_necessarily_closed();
-}
-
-inline dimension_type
-Constraint_System::num_pending_rows() const {
-  return sys.num_pending_rows();
-}
-
-inline dimension_type
-Constraint_System::first_pending_row() const {
-  return sys.first_pending_row();
-}
-
-inline bool
-Constraint_System::is_sorted() const {
-  return sys.is_sorted();
-}
-
-inline void
-Constraint_System::unset_pending_rows() {
-  sys.unset_pending_rows();
-}
-
-inline void
-Constraint_System::set_index_first_pending_row(dimension_type i) {
-  sys.set_index_first_pending_row(i);
-}
-
-inline void
-Constraint_System::set_sorted(bool b) {
-  sys.set_sorted(b);
-}
-
-inline void
-Constraint_System::remove_row(dimension_type i, bool keep_sorted) {
-  sys.remove_row(i, keep_sorted);
-}
-
-inline void
-Constraint_System::remove_rows(dimension_type first, dimension_type last,
-                               bool keep_sorted) {
-  sys.remove_rows(first, last, keep_sorted);
-}
-
-inline void
-Constraint_System::remove_rows(const std::vector<dimension_type>& indexes) {
-  sys.remove_rows(indexes);
-}
-
-inline void
-Constraint_System::remove_trailing_rows(dimension_type n) {
-  sys.remove_trailing_rows(n);
-}
-
-inline void
-Constraint_System
-::remove_space_dimensions(const Variables_Set& vars) {
-  sys.remove_space_dimensions(vars);
-}
-
-inline void
-Constraint_System
-::shift_space_dimensions(Variable v, dimension_type n) {
-  sys.shift_space_dimensions(v, n);
-}
-
-inline void
-Constraint_System
-::permute_space_dimensions(const std::vector<Variable>& cycle) {
-  sys.permute_space_dimensions(cycle);
-}
-
-inline void
-Constraint_System
-::swap_space_dimensions(Variable v1, Variable v2) {
-  sys.swap_space_dimensions(v1, v2);
-}
-
-inline bool
-Constraint_System::has_no_rows() const {
-  return sys.has_no_rows();
-}
-
-inline void
-Constraint_System::strong_normalize() {
-  sys.strong_normalize();
-}
-
-inline void
-Constraint_System::sort_rows() {
-  sys.sort_rows();
-}
-
-inline void
-Constraint_System::insert_pending(Constraint_System& r, Recycle_Input) {
-  sys.insert_pending(r.sys, Recycle_Input());
-}
-
-inline void
-Constraint_System::insert(Constraint_System& r, Recycle_Input) {
-  sys.insert(r.sys, Recycle_Input());
-}
-
-inline void
-Constraint_System::insert_pending(const Constraint_System& r) {
-  sys.insert_pending(r.sys);
-}
-
-inline void
-Constraint_System::merge_rows_assign(const Constraint_System& y) {
-  sys.merge_rows_assign(y.sys);
-}
-
-inline void
-Constraint_System::insert(const Constraint_System& y) {
-  sys.insert(y.sys);
-}
-
-inline void
-Constraint_System::mark_as_necessarily_closed() {
-  sys.mark_as_necessarily_closed();
-}
-
-inline void
-Constraint_System::mark_as_not_necessarily_closed() {
-  sys.mark_as_not_necessarily_closed();
-}
-
-inline dimension_type
-Constraint_System::gauss(dimension_type n_lines_or_equalities) {
-  return sys.gauss(n_lines_or_equalities);
-}
-
-inline void
-Constraint_System::back_substitute(dimension_type n_lines_or_equalities) {
-  sys.back_substitute(n_lines_or_equalities);
-}
-
-inline void
-Constraint_System::assign_with_pending(const Constraint_System& y) {
-  sys.assign_with_pending(y.sys);
-}
-
-inline void
-Constraint_System::sort_pending_and_remove_duplicates() {
-  sys.sort_pending_and_remove_duplicates();
-}
-
-inline void
-Constraint_System::sort_and_remove_with_sat(Bit_Matrix& sat) {
-  sys.sort_and_remove_with_sat(sat);
-}
-
-inline bool
-Constraint_System::check_sorted() const {
-  return sys.check_sorted();
-}
-
-inline dimension_type
-Constraint_System::num_lines_or_equalities() const {
-  return sys.num_lines_or_equalities();
-}
-
-inline void
-Constraint_System::add_universe_rows_and_space_dimensions(dimension_type n) {
-  sys.add_universe_rows_and_space_dimensions(n);
-}
-
-inline bool
-operator==(const Constraint_System& x, const Constraint_System& y) {
-  return x.sys == y.sys;
-}
-
-inline bool
-operator!=(const Constraint_System& x, const Constraint_System& y) {
-  return !(x == y);
-}
-
-/*! \relates Constraint_System */
-inline void
-swap(Constraint_System& x, Constraint_System& y) {
-  x.m_swap(y);
-}
-
-namespace Implementation {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Parma_Polyhedra_Library::Constraint_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-inline dimension_type
-num_constraints(const Constraint_System& cs) {
-  return static_cast<dimension_type>(std::distance(cs.begin(), cs.end()));
-}
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Constraint_System_inlines_hh)
diff --git a/src/Constraint_System.types.hh b/src/Constraint_System.types.hh
deleted file mode 100644
index f990cbf..0000000
--- a/src/Constraint_System.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Constraint_System_types_hh
-#define PPL_Constraint_System_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Constraint_System;
-class Constraint_System_const_iterator;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Constraint_System_types_hh)
diff --git a/src/Constraint_System_defs.hh b/src/Constraint_System_defs.hh
new file mode 100644
index 0000000..5a26a2d
--- /dev/null
+++ b/src/Constraint_System_defs.hh
@@ -0,0 +1,687 @@
+/* Constraint_System class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Constraint_System_defs_hh
+#define PPL_Constraint_System_defs_hh 1
+
+#include "Constraint_System_types.hh"
+
+#include "Linear_System_defs.hh"
+#include "Constraint_defs.hh"
+
+#include "Linear_Expression_types.hh"
+#include "Generator_types.hh"
+#include "Constraint_types.hh"
+#include "Congruence_System_types.hh"
+#include "Polyhedron_types.hh"
+#include "termination_types.hh"
+#include <iterator>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Constraint_System
+  Writes <CODE>true</CODE> if \p cs is empty.  Otherwise, writes on
+  \p s the constraints of \p cs, all in one row and separated by ", ".
+*/
+std::ostream& operator<<(std::ostream& s, const Constraint_System& cs);
+
+} // namespace IO_Operators
+
+// TODO: Consider removing this.
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates Constraint_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator==(const Constraint_System& x, const Constraint_System& y);
+
+// TODO: Consider removing this.
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Constraint_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator!=(const Constraint_System& x, const Constraint_System& y);
+
+/*! \relates Constraint_System */
+void
+swap(Constraint_System& x, Constraint_System& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A system of constraints.
+/*! \ingroup PPL_CXX_interface
+    An object of the class Constraint_System is a system of constraints,
+    i.e., a multiset of objects of the class Constraint.
+    When inserting constraints in a system, space dimensions are
+    automatically adjusted so that all the constraints in the system
+    are defined on the same vector space.
+
+    \par
+    In all the examples it is assumed that variables
+    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
+    \code
+  Variable x(0);
+  Variable y(1);
+    \endcode
+
+    \par Example 1
+    The following code builds a system of constraints corresponding to
+    a square in \f$\Rset^2\f$:
+    \code
+  Constraint_System cs;
+  cs.insert(x >= 0);
+  cs.insert(x <= 3);
+  cs.insert(y >= 0);
+  cs.insert(y <= 3);
+    \endcode
+    Note that:
+    the constraint system is created with space dimension zero;
+    the first and third constraint insertions increase the space
+    dimension to \f$1\f$ and \f$2\f$, respectively.
+
+    \par Example 2
+    By adding four strict inequalities to the constraint system
+    of the previous example, we can remove just the four
+    vertices from the square defined above.
+    \code
+  cs.insert(x + y > 0);
+  cs.insert(x + y < 6);
+  cs.insert(x - y < 3);
+  cs.insert(y - x < 3);
+    \endcode
+
+    \par Example 3
+    The following code builds a system of constraints corresponding to
+    a half-strip in \f$\Rset^2\f$:
+    \code
+  Constraint_System cs;
+  cs.insert(x >= 0);
+  cs.insert(x - y <= 0);
+  cs.insert(x - y + 1 >= 0);
+    \endcode
+
+    \note
+    After inserting a multiset of constraints in a constraint system,
+    there are no guarantees that an <EM>exact</EM> copy of them
+    can be retrieved:
+    in general, only an <EM>equivalent</EM> constraint system
+    will be available, where original constraints may have been
+    reordered, removed (if they are trivial, duplicate or
+    implied by other constraints), linearly combined, etc.
+*/
+class Parma_Polyhedra_Library::Constraint_System {
+public:
+  typedef Constraint row_type;
+
+  static const Representation default_representation = SPARSE;
+
+  //! Default constructor: builds an empty system of constraints.
+  explicit Constraint_System(Representation r = default_representation);
+
+  //! Builds the singleton system containing only constraint \p c.
+  explicit Constraint_System(const Constraint& c,
+                             Representation r = default_representation);
+
+  //! Builds a system containing copies of any equalities in \p cgs.
+  explicit Constraint_System(const Congruence_System& cgs,
+                             Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  /*!
+    \note The copy will have the same representation as `cs', to make it
+          indistinguishable from `cs'.
+  */
+  Constraint_System(const Constraint_System& cs);
+
+  //! Copy constructor with specified representation.
+  Constraint_System(const Constraint_System& cs, Representation r);
+
+  //! Destructor.
+  ~Constraint_System();
+
+  //! Assignment operator.
+  Constraint_System& operator=(const Constraint_System& y);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Constraint_System can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  void set_space_dimension(dimension_type space_dim);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains one or more equality constraints.
+  */
+  bool has_equalities() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains one or more strict inequality constraints.
+  */
+  bool has_strict_inequalities() const;
+
+  /*! \brief
+    Inserts in \p *this a copy of the constraint \p c,
+    increasing the number of space dimensions if needed.
+  */
+  void insert(const Constraint& c);
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  /*! \brief
+    Returns the singleton system containing only Constraint::zero_dim_false().
+  */
+  static const Constraint_System& zero_dim_empty();
+
+  typedef Constraint_System_const_iterator const_iterator;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this has no constraints.
+  bool empty() const;
+
+  /*! \brief
+    Removes all the constraints from the constraint system
+    and sets its space dimension to 0.
+  */
+  void clear();
+
+  /*! \brief
+    Returns the const_iterator pointing to the first constraint,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const_iterator.
+  const_iterator end() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Constraint_System& y);
+
+private:
+  Linear_System<Constraint> sys;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the singleton system containing only Constraint::zero_dim_false().
+  */
+  static const Constraint_System* zero_dim_empty_p;
+
+  friend class Constraint_System_const_iterator;
+
+  friend bool operator==(const Constraint_System& x,
+                         const Constraint_System& y);
+
+  //! Builds an empty system of constraints having the specified topology.
+  explicit Constraint_System(Topology topol,
+                             Representation r = default_representation);
+
+  /*! \brief
+    Builds a system of constraints on a \p space_dim dimensional space. If
+    \p topol is <CODE>NOT_NECESSARILY_CLOSED</CODE> the \f$\epsilon\f$
+    dimension is added.
+  */
+  Constraint_System(Topology topol, dimension_type space_dim,
+                    Representation r = default_representation);
+
+  //! Returns the number of equality constraints.
+  dimension_type num_equalities() const;
+
+  //! Returns the number of inequality constraints.
+  dimension_type num_inequalities() const;
+
+  /*! \brief
+    Applies Gaussian elimination and back-substitution so as
+    to provide a partial simplification of the system of constraints.
+
+    It is assumed that the system has no pending constraints.
+  */
+  void simplify();
+
+  /*! \brief
+    Adjusts \p *this so that it matches \p new_topology and
+    \p new_space_dim (adding or removing columns if needed).
+    Returns <CODE>false</CODE> if and only if \p topol is
+    equal to <CODE>NECESSARILY_CLOSED</CODE> and \p *this
+    contains strict inequalities.
+  */
+  bool adjust_topology_and_space_dimension(Topology new_topology,
+                                           dimension_type new_space_dim);
+
+  //! Returns a constant reference to the \p k- th constraint of the system.
+  const Constraint& operator[](dimension_type k) const;
+
+  //! Returns <CODE>true</CODE> if \p g satisfies all the constraints.
+  bool satisfies_all_constraints(const Generator& g) const;
+
+  //! Substitutes a given column of coefficients by a given affine expression.
+  /*!
+    \param v
+    The variable to which the affine transformation is substituted.
+
+    \param expr
+    The numerator of the affine transformation:
+    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
+
+    \param denominator
+    The denominator of the affine transformation.
+
+    We want to allow affine transformations
+    (see Section \ref Images_and_Preimages_of_Affine_Transfer_Relations)
+    having any rational coefficients. Since the coefficients of the
+    constraints are integers we must also provide an integer \p
+    denominator that will be used as denominator of the affine
+    transformation.
+    The denominator is required to be a positive integer.
+
+    The affine transformation substitutes the matrix of constraints
+    by a new matrix whose elements \f${a'}_{ij}\f$ are built from
+    the old one \f$a_{ij}\f$ as follows:
+    \f[
+      {a'}_{ij} =
+        \begin{cases}
+          a_{ij} * \mathrm{denominator} + a_{iv} * \mathrm{expr}[j]
+            \quad \text{for } j \neq v; \\
+          \mathrm{expr}[v] * a_{iv}
+            \quad \text{for } j = v.
+        \end{cases}
+    \f]
+
+    \p expr is a constant parameter and unaltered by this computation.
+  */
+  void affine_preimage(Variable v,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator);
+
+  /*! \brief
+    Inserts in \p *this a copy of the constraint \p c,
+    increasing the number of space dimensions if needed.
+    It is a pending constraint.
+  */
+  void insert_pending(const Constraint& c);
+
+  //! Adds low-level constraints to the constraint system.
+  void add_low_level_constraints();
+
+  //! Returns the system topology.
+  Topology topology() const;
+
+  dimension_type num_rows() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    the system topology is <CODE>NECESSARILY_CLOSED</CODE>.
+  */
+  bool is_necessarily_closed() const;
+
+  //! Returns the number of rows that are in the pending part of the system.
+  dimension_type num_pending_rows() const;
+
+  //! Returns the index of the first pending row.
+  dimension_type first_pending_row() const;
+
+  //! Returns the value of the sortedness flag.
+  bool is_sorted() const;
+
+  //! Sets the index to indicate that the system has no pending rows.
+  void unset_pending_rows();
+
+  //! Sets the index of the first pending row to \p i.
+  void set_index_first_pending_row(dimension_type i);
+
+  //! Sets the sortedness flag of the system to \p b.
+  void set_sorted(bool b);
+
+  //! Makes the system shrink by removing its i-th row.
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(n).
+
+    Otherwise, this method just swaps the i-th row with the last and then
+    removes it, so it costs O(1).
+  */
+  void remove_row(dimension_type i, bool keep_sorted = false);
+
+  //! Removes the specified rows. The row ordering of remaining rows is
+  //! preserved.
+  /*!
+    \param indexes specifies a list of row indexes.
+                   It must be sorted.
+  */
+  void remove_rows(const std::vector<dimension_type>& indexes);
+
+  //! Makes the system shrink by removing the rows in [first,last).
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(num_rows()).
+
+    Otherwise, this method just swaps the rows with the last ones and then
+    removes them, so it costs O(last - first).
+  */
+  void remove_rows(dimension_type first, dimension_type last,
+                   bool keep_sorted = false);
+
+  //! Makes the system shrink by removing its \p n trailing rows.
+  void remove_trailing_rows(dimension_type n);
+
+  //! Removes all the specified dimensions from the constraint system.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Permutes the space dimensions of the matrix.
+  /*
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    columns must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  bool has_no_rows() const;
+
+  //! Strongly normalizes the system.
+  void strong_normalize();
+
+  /*! \brief
+    Sorts the non-pending rows (in growing order) and eliminates
+    duplicated ones.
+  */
+  void sort_rows();
+
+  /*! \brief
+    Adds the given row to the pending part of the system, stealing its
+    contents and automatically resizing the system or the row, if needed.
+  */
+  void insert_pending(Constraint& r, Recycle_Input);
+
+  //! Adds the rows of `y' to the pending part of `*this', stealing them from
+  //! `y'.
+  void insert_pending(Constraint_System& r, Recycle_Input);
+
+  /*! \brief
+    Adds \p r to the system, stealing its contents and
+    automatically resizing the system or the row, if needed.
+  */
+  void insert(Constraint& r, Recycle_Input);
+
+  //! Adds to \p *this a the rows of `y', stealing them from `y'.
+  /*!
+    It is assumed that \p *this has no pending rows.
+  */
+  void insert(Constraint_System& r, Recycle_Input);
+
+  //! Adds a copy of the rows of `y' to the pending part of `*this'.
+  void insert_pending(const Constraint_System& r);
+
+  /*! \brief
+    Assigns to \p *this the result of merging its rows with
+    those of \p y, obtaining a sorted system.
+
+    Duplicated rows will occur only once in the result.
+    On entry, both systems are assumed to be sorted and have
+    no pending rows.
+  */
+  void merge_rows_assign(const Constraint_System& y);
+
+  //! Adds to \p *this a copy of  the rows of \p y.
+  /*!
+    It is assumed that \p *this has no pending rows.
+  */
+  void insert(const Constraint_System& y);
+
+  //! Marks the epsilon dimension as a standard dimension.
+  /*!
+    The system topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is increased by 1.
+  */
+  void mark_as_necessarily_closed();
+
+  //! Marks the last dimension as the epsilon dimension.
+  /*!
+    The system topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is decreased by 1.
+  */
+  void mark_as_not_necessarily_closed();
+
+  //! Minimizes the subsystem of equations contained in \p *this.
+  /*!
+    This method works only on the equalities of the system:
+    the system is required to be partially sorted, so that
+    all the equalities are grouped at its top; it is assumed that
+    the number of equalities is exactly \p n_lines_or_equalities.
+    The method finds a minimal system for the equalities and
+    returns its rank, i.e., the number of linearly independent equalities.
+    The result is an upper triangular subsystem of equalities:
+    for each equality, the pivot is chosen starting from
+    the right-most columns.
+  */
+  dimension_type gauss(dimension_type n_lines_or_equalities);
+
+  /*! \brief
+    Back-substitutes the coefficients to reduce
+    the complexity of the system.
+
+    Takes an upper triangular system having \p n_lines_or_equalities rows.
+    For each row, starting from the one having the minimum number of
+    coefficients different from zero, computes the expression of an element
+    as a function of the remaining ones and then substitutes this expression
+    in all the other rows.
+  */
+  void back_substitute(dimension_type n_lines_or_equalities);
+
+  //! Full assignment operator: pending rows are copied as pending.
+  void assign_with_pending(const Constraint_System& y);
+
+  /*! \brief
+    Sorts the pending rows and eliminates those that also occur
+    in the non-pending part of the system.
+  */
+  void sort_pending_and_remove_duplicates();
+
+  /*! \brief
+    Sorts the system, removing duplicates, keeping the saturation
+    matrix consistent.
+
+    \param sat
+    Bit matrix with rows corresponding to the rows of \p *this.
+  */
+  void sort_and_remove_with_sat(Bit_Matrix& sat);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is sorted,
+    without checking for duplicates.
+  */
+  bool check_sorted() const;
+
+  /*! \brief
+    Returns the number of rows in the system
+    that represent either lines or equalities.
+  */
+  dimension_type num_lines_or_equalities() const;
+
+  //! Adds \p n rows and space dimensions to the system.
+  /*!
+    \param n
+    The number of rows and space dimensions to be added: must be strictly
+    positive.
+
+    Turns the system \f$M \in \Rset^r \times \Rset^c\f$ into
+    the system \f$N \in \Rset^{r+n} \times \Rset^{c+n}\f$
+    such that
+    \f$N = \bigl(\genfrac{}{}{0pt}{}{0}{M}\genfrac{}{}{0pt}{}{J}{o}\bigr)\f$,
+    where \f$J\f$ is the specular image
+    of the \f$n \times n\f$ identity matrix.
+  */
+  void add_universe_rows_and_space_dimensions(dimension_type n);
+
+  friend class Polyhedron;
+  friend class Termination_Helpers;
+};
+
+//! An iterator over a system of constraints.
+/*! \ingroup PPL_CXX_interface
+  A const_iterator is used to provide read-only access
+  to each constraint contained in a Constraint_System object.
+
+  \par Example
+  The following code prints the system of constraints
+  defining the polyhedron <CODE>ph</CODE>:
+  \code
+const Constraint_System& cs = ph.constraints();
+for (Constraint_System::const_iterator i = cs.begin(),
+        cs_end = cs.end(); i != cs_end; ++i)
+  cout << *i << endl;
+  \endcode
+*/
+// NOTE: This is not an inner class of Constraint_System, so Constraint can
+// declare that this class is his friend without including this file
+// (the .types.hh file suffices).
+class Parma_Polyhedra_Library::Constraint_System_const_iterator
+  : public std::iterator<std::forward_iterator_tag,
+                         Constraint,
+                         ptrdiff_t,
+                         const Constraint*,
+                         const Constraint&> {
+public:
+  //! Default constructor.
+  Constraint_System_const_iterator();
+
+  //! Ordinary copy constructor.
+  Constraint_System_const_iterator(const Constraint_System_const_iterator& y);
+
+  //! Destructor.
+  ~Constraint_System_const_iterator();
+
+  //! Assignment operator.
+  Constraint_System_const_iterator&
+  operator=(const Constraint_System_const_iterator& y);
+
+  //! Dereference operator.
+  const Constraint& operator*() const;
+
+  //! Indirect member selector.
+  const Constraint* operator->() const;
+
+  //! Prefix increment operator.
+  Constraint_System_const_iterator& operator++();
+
+  //! Postfix increment operator.
+  Constraint_System_const_iterator operator++(int);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are identical.
+  */
+  bool operator==(const Constraint_System_const_iterator& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are different.
+  */
+  bool operator!=(const Constraint_System_const_iterator& y) const;
+
+private:
+  friend class Constraint_System;
+
+  //! The const iterator over the matrix of constraints.
+  Linear_System<Constraint>::const_iterator i;
+
+  //! A const pointer to the matrix of constraints.
+  const Linear_System<Constraint>* csp;
+
+  //! Constructor.
+  Constraint_System_const_iterator(const Linear_System<Constraint>
+                                   ::const_iterator& iter,
+                                   const Constraint_System& cs);
+
+  //! \p *this skips to the next non-trivial constraint.
+  void skip_forward();
+};
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Helper returning number of constraints in system.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+dimension_type
+num_constraints(const Constraint_System& cs);
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+// Constraint_System_inlines.hh is not included here on purpose.
+
+#endif // !defined(PPL_Constraint_System_defs_hh)
diff --git a/src/Constraint_System_inlines.hh b/src/Constraint_System_inlines.hh
new file mode 100644
index 0000000..7a23d6b
--- /dev/null
+++ b/src/Constraint_System_inlines.hh
@@ -0,0 +1,439 @@
+/* Constraint_System class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Constraint_System_inlines_hh
+#define PPL_Constraint_System_inlines_hh 1
+
+#include "Constraint_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Constraint_System::Constraint_System(Representation r)
+  : sys(NECESSARILY_CLOSED, r) {
+}
+
+inline
+Constraint_System::Constraint_System(const Constraint& c, Representation r)
+  : sys(c.topology(), r) {
+  sys.insert(c);
+}
+
+inline
+Constraint_System::Constraint_System(const Constraint_System& cs)
+  : sys(cs.sys) {
+}
+
+inline
+Constraint_System::Constraint_System(const Constraint_System& cs,
+                                     Representation r)
+  : sys(cs.sys, r) {
+}
+
+inline
+Constraint_System::Constraint_System(const Topology topol, Representation r)
+  : sys(topol, r) {
+}
+
+inline
+Constraint_System::Constraint_System(const Topology topol,
+                                     const dimension_type space_dim,
+                                     Representation r)
+  : sys(topol, space_dim, r) {
+}
+
+inline
+Constraint_System::~Constraint_System() {
+}
+
+inline Constraint_System&
+Constraint_System::operator=(const Constraint_System& y) {
+  Constraint_System tmp = y;
+  swap(*this, tmp);
+  return *this;
+}
+
+inline const Constraint&
+Constraint_System::operator[](const dimension_type k) const {
+  return sys[k];
+}
+
+inline Representation
+Constraint_System::representation() const {
+  return sys.representation();
+}
+
+inline void
+Constraint_System::set_representation(Representation r) {
+  sys.set_representation(r);
+}
+
+inline dimension_type
+Constraint_System::max_space_dimension() {
+  return Linear_System<Constraint>::max_space_dimension();
+}
+
+inline dimension_type
+Constraint_System::space_dimension() const {
+  return sys.space_dimension();
+}
+
+inline void
+Constraint_System::set_space_dimension(dimension_type space_dim) {
+  return sys.set_space_dimension(space_dim);
+}
+
+inline void
+Constraint_System::clear() {
+  sys.clear();
+}
+
+inline const Constraint_System&
+Constraint_System::zero_dim_empty() {
+  PPL_ASSERT(zero_dim_empty_p != 0);
+  return *zero_dim_empty_p;
+}
+
+inline
+Constraint_System_const_iterator::Constraint_System_const_iterator()
+  : i(), csp(0) {
+}
+
+inline
+Constraint_System_const_iterator::Constraint_System_const_iterator(const Constraint_System_const_iterator& y)
+  : i(y.i), csp(y.csp) {
+}
+
+inline
+Constraint_System_const_iterator::~Constraint_System_const_iterator() {
+}
+
+inline Constraint_System_const_iterator&
+Constraint_System_const_iterator::operator=(const Constraint_System_const_iterator& y) {
+  i = y.i;
+  csp = y.csp;
+  return *this;
+}
+
+inline const Constraint&
+Constraint_System_const_iterator::operator*() const {
+  return *i;
+}
+
+inline const Constraint*
+Constraint_System_const_iterator::operator->() const {
+  return i.operator->();
+}
+
+inline Constraint_System_const_iterator&
+Constraint_System_const_iterator::operator++() {
+  ++i;
+  skip_forward();
+  return *this;
+}
+
+inline Constraint_System_const_iterator
+Constraint_System_const_iterator::operator++(int) {
+  const Constraint_System_const_iterator tmp = *this;
+  operator++();
+  return tmp;
+}
+
+inline bool
+Constraint_System_const_iterator::operator==(const Constraint_System_const_iterator& y) const {
+  return i == y.i;
+}
+
+inline bool
+Constraint_System_const_iterator::operator!=(const Constraint_System_const_iterator& y) const {
+  return i != y.i;
+}
+
+inline
+Constraint_System_const_iterator::
+Constraint_System_const_iterator(const Linear_System<Constraint>::const_iterator& iter,
+               const Constraint_System& cs)
+  : i(iter), csp(&cs.sys) {
+}
+
+inline Constraint_System_const_iterator
+Constraint_System::begin() const {
+  const_iterator i(sys.begin(), *this);
+  i.skip_forward();
+  return i;
+}
+
+inline Constraint_System_const_iterator
+Constraint_System::end() const {
+  const Constraint_System_const_iterator i(sys.end(), *this);
+  return i;
+}
+
+inline bool
+Constraint_System::empty() const {
+  return begin() == end();
+}
+
+inline void
+Constraint_System::add_low_level_constraints() {
+  if (sys.is_necessarily_closed())
+    // The positivity constraint.
+    insert(Constraint::zero_dim_positivity());
+  else {
+    // Add the epsilon constraints.
+    insert(Constraint::epsilon_leq_one());
+    insert(Constraint::epsilon_geq_zero());
+  }
+}
+
+inline void
+Constraint_System::m_swap(Constraint_System& y) {
+  swap(sys, y.sys);
+}
+
+inline memory_size_type
+Constraint_System::external_memory_in_bytes() const {
+  return sys.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Constraint_System::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+inline void
+Constraint_System::simplify() {
+  sys.simplify();
+}
+
+inline Topology
+Constraint_System::topology() const {
+  return sys.topology();
+}
+
+inline dimension_type
+Constraint_System::num_rows() const {
+  return sys.num_rows();
+}
+
+inline bool
+Constraint_System::is_necessarily_closed() const {
+  return sys.is_necessarily_closed();
+}
+
+inline dimension_type
+Constraint_System::num_pending_rows() const {
+  return sys.num_pending_rows();
+}
+
+inline dimension_type
+Constraint_System::first_pending_row() const {
+  return sys.first_pending_row();
+}
+
+inline bool
+Constraint_System::is_sorted() const {
+  return sys.is_sorted();
+}
+
+inline void
+Constraint_System::unset_pending_rows() {
+  sys.unset_pending_rows();
+}
+
+inline void
+Constraint_System::set_index_first_pending_row(dimension_type i) {
+  sys.set_index_first_pending_row(i);
+}
+
+inline void
+Constraint_System::set_sorted(bool b) {
+  sys.set_sorted(b);
+}
+
+inline void
+Constraint_System::remove_row(dimension_type i, bool keep_sorted) {
+  sys.remove_row(i, keep_sorted);
+}
+
+inline void
+Constraint_System::remove_rows(dimension_type first, dimension_type last,
+                               bool keep_sorted) {
+  sys.remove_rows(first, last, keep_sorted);
+}
+
+inline void
+Constraint_System::remove_rows(const std::vector<dimension_type>& indexes) {
+  sys.remove_rows(indexes);
+}
+
+inline void
+Constraint_System::remove_trailing_rows(dimension_type n) {
+  sys.remove_trailing_rows(n);
+}
+
+inline void
+Constraint_System
+::remove_space_dimensions(const Variables_Set& vars) {
+  sys.remove_space_dimensions(vars);
+}
+
+inline void
+Constraint_System
+::shift_space_dimensions(Variable v, dimension_type n) {
+  sys.shift_space_dimensions(v, n);
+}
+
+inline void
+Constraint_System
+::permute_space_dimensions(const std::vector<Variable>& cycle) {
+  sys.permute_space_dimensions(cycle);
+}
+
+inline void
+Constraint_System
+::swap_space_dimensions(Variable v1, Variable v2) {
+  sys.swap_space_dimensions(v1, v2);
+}
+
+inline bool
+Constraint_System::has_no_rows() const {
+  return sys.has_no_rows();
+}
+
+inline void
+Constraint_System::strong_normalize() {
+  sys.strong_normalize();
+}
+
+inline void
+Constraint_System::sort_rows() {
+  sys.sort_rows();
+}
+
+inline void
+Constraint_System::insert_pending(Constraint_System& r, Recycle_Input) {
+  sys.insert_pending(r.sys, Recycle_Input());
+}
+
+inline void
+Constraint_System::insert(Constraint_System& r, Recycle_Input) {
+  sys.insert(r.sys, Recycle_Input());
+}
+
+inline void
+Constraint_System::insert_pending(const Constraint_System& r) {
+  sys.insert_pending(r.sys);
+}
+
+inline void
+Constraint_System::merge_rows_assign(const Constraint_System& y) {
+  sys.merge_rows_assign(y.sys);
+}
+
+inline void
+Constraint_System::insert(const Constraint_System& y) {
+  sys.insert(y.sys);
+}
+
+inline void
+Constraint_System::mark_as_necessarily_closed() {
+  sys.mark_as_necessarily_closed();
+}
+
+inline void
+Constraint_System::mark_as_not_necessarily_closed() {
+  sys.mark_as_not_necessarily_closed();
+}
+
+inline dimension_type
+Constraint_System::gauss(dimension_type n_lines_or_equalities) {
+  return sys.gauss(n_lines_or_equalities);
+}
+
+inline void
+Constraint_System::back_substitute(dimension_type n_lines_or_equalities) {
+  sys.back_substitute(n_lines_or_equalities);
+}
+
+inline void
+Constraint_System::assign_with_pending(const Constraint_System& y) {
+  sys.assign_with_pending(y.sys);
+}
+
+inline void
+Constraint_System::sort_pending_and_remove_duplicates() {
+  sys.sort_pending_and_remove_duplicates();
+}
+
+inline void
+Constraint_System::sort_and_remove_with_sat(Bit_Matrix& sat) {
+  sys.sort_and_remove_with_sat(sat);
+}
+
+inline bool
+Constraint_System::check_sorted() const {
+  return sys.check_sorted();
+}
+
+inline dimension_type
+Constraint_System::num_lines_or_equalities() const {
+  return sys.num_lines_or_equalities();
+}
+
+inline void
+Constraint_System::add_universe_rows_and_space_dimensions(dimension_type n) {
+  sys.add_universe_rows_and_space_dimensions(n);
+}
+
+inline bool
+operator==(const Constraint_System& x, const Constraint_System& y) {
+  return x.sys == y.sys;
+}
+
+inline bool
+operator!=(const Constraint_System& x, const Constraint_System& y) {
+  return !(x == y);
+}
+
+/*! \relates Constraint_System */
+inline void
+swap(Constraint_System& x, Constraint_System& y) {
+  x.m_swap(y);
+}
+
+namespace Implementation {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Parma_Polyhedra_Library::Constraint_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+inline dimension_type
+num_constraints(const Constraint_System& cs) {
+  return static_cast<dimension_type>(std::distance(cs.begin(), cs.end()));
+}
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Constraint_System_inlines_hh)
diff --git a/src/Constraint_System_types.hh b/src/Constraint_System_types.hh
new file mode 100644
index 0000000..7e947e8
--- /dev/null
+++ b/src/Constraint_System_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Constraint_System_types_hh
+#define PPL_Constraint_System_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Constraint_System;
+class Constraint_System_const_iterator;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Constraint_System_types_hh)
diff --git a/src/Constraint_defs.hh b/src/Constraint_defs.hh
new file mode 100644
index 0000000..aedfa5b
--- /dev/null
+++ b/src/Constraint_defs.hh
@@ -0,0 +1,836 @@
+/* Constraint class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Constraint_defs_hh
+#define PPL_Constraint_defs_hh 1
+
+#include "Constraint_types.hh"
+
+#include "Congruence_types.hh"
+#include "Variables_Set_types.hh"
+#include "Polyhedron_types.hh"
+#include "termination_types.hh"
+#include "Octagonal_Shape_types.hh"
+#include "Grid_types.hh"
+
+#include "Linear_Expression_defs.hh"
+#include "Variable_defs.hh"
+#include "Topology_types.hh"
+#include "Expression_Hide_Last_defs.hh"
+
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+//! Returns the constraint \p e1 \< \p e2.
+/*! \relates Constraint */
+Constraint
+operator<(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the constraint \p v1 \< \p v2.
+/*! \relates Constraint */
+Constraint
+operator<(Variable v1, Variable v2);
+
+//! Returns the constraint \p e \< \p n.
+/*! \relates Constraint */
+Constraint
+operator<(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the constraint \p n \< \p e.
+/*! \relates Constraint */
+Constraint
+operator<(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the constraint \p e1 \> \p e2.
+/*! \relates Constraint */
+Constraint
+operator>(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the constraint \p v1 \> \p v2.
+/*! \relates Constraint */
+Constraint
+operator>(Variable v1, Variable v2);
+
+//! Returns the constraint \p e \> \p n.
+/*! \relates Constraint */
+Constraint
+operator>(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the constraint \p n \> \p e.
+/*! \relates Constraint */
+Constraint
+operator>(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the constraint \p e1 = \p e2.
+/*! \relates Constraint */
+Constraint
+operator==(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the constraint \p v1 = \p v2.
+/*! \relates Constraint */
+Constraint
+operator==(Variable v1, Variable v2);
+
+//! Returns the constraint \p e = \p n.
+/*! \relates Constraint */
+Constraint
+operator==(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the constraint \p n = \p e.
+/*! \relates Constraint */
+Constraint
+operator==(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the constraint \p e1 \<= \p e2.
+/*! \relates Constraint */
+Constraint
+operator<=(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the constraint \p v1 \<= \p v2.
+/*! \relates Constraint */
+Constraint
+operator<=(Variable v1, Variable v2);
+
+//! Returns the constraint \p e \<= \p n.
+/*! \relates Constraint */
+Constraint
+operator<=(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the constraint \p n \<= \p e.
+/*! \relates Constraint */
+Constraint
+operator<=(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the constraint \p e1 \>= \p e2.
+/*! \relates Constraint */
+Constraint
+operator>=(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the constraint \p v1 \>= \p v2.
+/*! \relates Constraint */
+Constraint
+operator>=(Variable v1, Variable v2);
+
+//! Returns the constraint \p e \>= \p n.
+/*! \relates Constraint */
+Constraint
+operator>=(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the constraint \p n \>= \p e.
+/*! \relates Constraint */
+Constraint
+operator>=(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The basic comparison function.
+/*! \relates Constraint
+  \return
+  The returned absolute value can be \f$0\f$, \f$1\f$ or \f$2\f$.
+
+  \param x
+  A row of coefficients;
+
+  \param y
+  Another row.
+
+  Compares \p x and \p y, where \p x and \p y may be of different size,
+  in which case the "missing" coefficients are assumed to be zero.
+  The comparison is such that:
+  -# equalities are smaller than inequalities;
+  -# lines are smaller than points and rays;
+  -# the ordering is lexicographic;
+  -# the positions compared are, in decreasing order of significance,
+     1, 2, ..., \p size(), 0;
+  -# the result is negative, zero, or positive if x is smaller than,
+     equal to, or greater than y, respectively;
+  -# when \p x and \p y are different, the absolute value of the
+     result is 1 if the difference is due to the coefficient in
+     position 0; it is 2 otherwise.
+
+  When \p x and \p y represent the hyper-planes associated
+  to two equality or inequality constraints, the coefficient
+  at 0 is the known term.
+  In this case, the return value can be characterized as follows:
+  - -2, if \p x is smaller than \p y and they are \e not parallel;
+  - -1, if \p x is smaller than \p y and they \e are parallel;
+  -  0, if \p x and y are equal;
+  - +1, if \p y is smaller than \p x and they \e are parallel;
+  - +2, if \p y is smaller than \p x and they are \e not parallel.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+int compare(const Constraint& x, const Constraint& y);
+
+}
+
+//! A linear equality or inequality.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Constraint is either:
+  - an equality: \f$\sum_{i=0}^{n-1} a_i x_i + b = 0\f$;
+  - a non-strict inequality: \f$\sum_{i=0}^{n-1} a_i x_i + b \geq 0\f$; or
+  - a strict inequality: \f$\sum_{i=0}^{n-1} a_i x_i + b > 0\f$;
+
+  where \f$n\f$ is the dimension of the space,
+  \f$a_i\f$ is the integer coefficient of variable \f$x_i\f$
+  and \f$b\f$ is the integer inhomogeneous term.
+
+  \par How to build a constraint
+  Constraints are typically built by applying a relation symbol
+  to a pair of linear expressions.
+  Available relation symbols are equality (<CODE>==</CODE>),
+  non-strict inequalities (<CODE>\>=</CODE> and <CODE>\<=</CODE>) and
+  strict inequalities (<CODE>\<</CODE> and <CODE>\></CODE>).
+  The space dimension of a constraint is defined as the maximum
+  space dimension of the arguments of its constructor.
+
+  \par
+  In the following examples it is assumed that variables
+  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
+  are defined as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable z(2);
+  \endcode
+
+  \par Example 1
+  The following code builds the equality constraint
+  \f$3x + 5y - z = 0\f$, having space dimension \f$3\f$:
+  \code
+  Constraint eq_c(3*x + 5*y - z == 0);
+  \endcode
+  The following code builds the (non-strict) inequality constraint
+  \f$4x \geq 2y - 13\f$, having space dimension \f$2\f$:
+  \code
+  Constraint ineq_c(4*x >= 2*y - 13);
+  \endcode
+  The corresponding strict inequality constraint
+  \f$4x > 2y - 13\f$ is obtained as follows:
+  \code
+  Constraint strict_ineq_c(4*x > 2*y - 13);
+  \endcode
+  An unsatisfiable constraint on the zero-dimension space \f$\Rset^0\f$
+  can be specified as follows:
+  \code
+  Constraint false_c = Constraint::zero_dim_false();
+  \endcode
+  Equivalent, but more involved ways are the following:
+  \code
+  Constraint false_c1(Linear_Expression::zero() == 1);
+  Constraint false_c2(Linear_Expression::zero() >= 1);
+  Constraint false_c3(Linear_Expression::zero() > 0);
+  \endcode
+  In contrast, the following code defines an unsatisfiable constraint
+  having space dimension \f$3\f$:
+  \code
+  Constraint false_c(0*z == 1);
+  \endcode
+
+  \par How to inspect a constraint
+  Several methods are provided to examine a constraint and extract
+  all the encoded information: its space dimension, its type
+  (equality, non-strict inequality, strict inequality) and
+  the value of its integer coefficients.
+
+  \par Example 2
+  The following code shows how it is possible to access each single
+  coefficient of a constraint. Given an inequality constraint
+  (in this case \f$x - 5y + 3z \leq 4\f$), we construct a new constraint
+  corresponding to its complement (thus, in this case we want to obtain
+  the strict inequality constraint \f$x - 5y + 3z > 4\f$).
+  \code
+  Constraint c1(x - 5*y + 3*z <= 4);
+  cout << "Constraint c1: " << c1 << endl;
+  if (c1.is_equality())
+    cout << "Constraint c1 is not an inequality." << endl;
+  else {
+    Linear_Expression e;
+    for (dimension_type i = c1.space_dimension(); i-- > 0; )
+      e += c1.coefficient(Variable(i)) * Variable(i);
+    e += c1.inhomogeneous_term();
+    Constraint c2 = c1.is_strict_inequality() ? (e <= 0) : (e < 0);
+    cout << "Complement c2: " << c2 << endl;
+  }
+  \endcode
+  The actual output is the following:
+  \code
+  Constraint c1: -A + 5*B - 3*C >= -4
+  Complement c2: A - 5*B + 3*C > 4
+  \endcode
+  Note that, in general, the particular output obtained can be
+  syntactically different from the (semantically equivalent)
+  constraint considered.
+*/
+class Parma_Polyhedra_Library::Constraint {
+public:
+
+  //! The constraint type.
+  enum Type {
+    /*! The constraint is an equality. */
+    EQUALITY,
+    /*! The constraint is a non-strict inequality. */
+    NONSTRICT_INEQUALITY,
+    /*! The constraint is a strict inequality. */
+    STRICT_INEQUALITY
+  };
+
+  //! The representation used for new Constraints.
+  /*!
+    \note The copy constructor and the copy constructor with specified size
+          use the representation of the original object, so that it is
+          indistinguishable from the original object.
+  */
+  static const Representation default_representation = SPARSE;
+
+  //! Constructs the \f$0<=0\f$ constraint.
+  explicit Constraint(Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  /*!
+    \note The new Constraint will have the same representation as `c',
+          not default_representation, so that they are indistinguishable.
+  */
+  Constraint(const Constraint& c);
+
+  //! Copy constructor with given size.
+  /*!
+    \note The new Constraint will have the same representation as `c',
+          not default_representation, so that they are indistinguishable.
+  */
+  Constraint(const Constraint& c, dimension_type space_dim);
+
+  //! Copy constructor with given representation.
+  Constraint(const Constraint& c, Representation r);
+
+  //! Copy constructor with given size and representation.
+  Constraint(const Constraint& c, dimension_type space_dim,
+             Representation r);
+
+  //! Copy-constructs from equality congruence \p cg.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p cg is a proper congruence.
+  */
+  explicit Constraint(const Congruence& cg,
+                      Representation r = default_representation);
+
+  //! Destructor.
+  ~Constraint();
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Assignment operator.
+  Constraint& operator=(const Constraint& c);
+
+  //! Returns the maximum space dimension a Constraint can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Sets the dimension of the vector space enclosing \p *this to
+  //! \p space_dim .
+  void set_space_dimension(dimension_type space_dim);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Removes all the specified dimensions from the constraint.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+
+    Always returns \p true. The return value is needed for compatibility with
+    the Generator class.
+  */
+  bool remove_space_dimensions(const Variables_Set& vars);
+
+  //! Permutes the space dimensions of the constraint.
+  /*
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Returns the constraint type of \p *this.
+  Type type() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is an equality constraint.
+  */
+  bool is_equality() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is an inequality constraint (either strict or non-strict).
+  */
+  bool is_inequality() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is a non-strict inequality constraint.
+  */
+  bool is_nonstrict_inequality() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is a strict inequality constraint.
+  */
+  bool is_strict_inequality() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  /*!
+    \exception std::invalid_argument thrown if the index of \p v
+    is greater than or equal to the space dimension of \p *this.
+  */
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns the inhomogeneous term of \p *this.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  //! The unsatisfiable (zero-dimension space) constraint \f$0 = 1\f$.
+  static const Constraint& zero_dim_false();
+
+  /*! \brief
+    The true (zero-dimension space) constraint \f$0 \leq 1\f$,
+    also known as <EM>positivity constraint</EM>.
+  */
+  static const Constraint& zero_dim_positivity();
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is a tautology (i.e., an always true constraint).
+
+    A tautology can have either one of the following forms:
+    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + 0 = 0\f$; or
+    - a non-strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b \geq 0\f$,
+      where \f$b \geq 0\f$; or
+    - a strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b > 0\f$,
+      where \f$b > 0\f$.
+  */
+  bool is_tautological() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this is inconsistent (i.e., an always false constraint).
+
+    An inconsistent constraint can have either one of the following forms:
+    - an equality: \f$\sum_{i=0}^{n-1} 0 x_i + b = 0\f$,
+      where \f$b \neq 0\f$; or
+    - a non-strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b \geq 0\f$,
+      where \f$b < 0\f$; or
+    - a strict inequality: \f$\sum_{i=0}^{n-1} 0 x_i + b > 0\f$,
+      where \f$b \leq 0\f$.
+  */
+  bool is_inconsistent() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y
+    are equivalent constraints.
+
+    Constraints having different space dimensions are not equivalent.
+    Note that constraints having different types may nonetheless be
+    equivalent, if they both are tautologies or inconsistent.
+  */
+  bool is_equivalent_to(const Constraint& y) const;
+
+  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
+  /*!
+    This is faster than is_equivalent_to(), but it may return `false' even
+    for equivalent constraints.
+  */
+  bool is_equal_to(const Constraint& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Constraint& y);
+
+  //! Returns the zero-dimension space constraint \f$\epsilon \geq 0\f$.
+  static const Constraint& epsilon_geq_zero();
+
+  /*! \brief
+    The zero-dimension space constraint \f$\epsilon \leq 1\f$
+    (used to implement NNC polyhedra).
+  */
+  static const Constraint& epsilon_leq_one();
+
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Hide_Last<Linear_Expression> expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
+
+private:
+
+  //! The possible kinds of Constraint objects.
+  enum Kind {
+    LINE_OR_EQUALITY = 0,
+    RAY_OR_POINT_OR_INEQUALITY = 1
+  };
+
+  Linear_Expression expr;
+
+  Kind kind_;
+
+  Topology topology_;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the unsatisfiable (zero-dimension space) constraint \f$0 = 1\f$.
+  */
+  static const Constraint* zero_dim_false_p;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the true (zero-dimension space) constraint \f$0 \leq 1\f$, also
+    known as <EM>positivity constraint</EM>.
+  */
+  static const Constraint* zero_dim_positivity_p;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the zero-dimension space constraint \f$\epsilon \geq 0\f$.
+  */
+  static const Constraint* epsilon_geq_zero_p;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the zero-dimension space constraint \f$\epsilon \leq 1\f$
+    (used to implement NNC polyhedra).
+  */
+  static const Constraint* epsilon_leq_one_p;
+
+  //! Constructs the \f$0<0\f$ constraint.
+  Constraint(dimension_type space_dim, Kind kind, Topology topology,
+             Representation r = default_representation);
+
+  /*! \brief
+    Builds a constraint of kind \p kind and topology \p topology,
+    stealing the coefficients from \p e.
+
+    \note The new Constraint will have the same representation as `e'.
+  */
+  Constraint(Linear_Expression& e, Kind kind, Topology topology);
+
+  /*! \brief
+    Builds a constraint of type \p type and topology \p topology,
+    stealing the coefficients from \p e.
+
+    \note The new Constraint will have the same representation as `e'.
+  */
+  Constraint(Linear_Expression& e, Type type, Topology topology);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row
+    represents a line or an equality.
+  */
+  bool is_line_or_equality() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row
+    represents a ray, a point or an inequality.
+  */
+  bool is_ray_or_point_or_inequality() const;
+
+  //! Sets to \p LINE_OR_EQUALITY the kind of \p *this row.
+  void set_is_line_or_equality();
+
+  //! Sets to \p RAY_OR_POINT_OR_INEQUALITY the kind of \p *this row.
+  void set_is_ray_or_point_or_inequality();
+
+  //! \name Flags inspection methods
+  //@{
+  //! Returns the topological kind of \p *this.
+  Topology topology() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the topology
+    of \p *this row is not necessarily closed.
+  */
+  bool is_not_necessarily_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the topology
+    of \p *this row is necessarily closed.
+  */
+  bool is_necessarily_closed() const;
+  //@} // Flags inspection methods
+
+  //! \name Flags coercion methods
+  //@{
+
+  // TODO: Consider setting the epsilon dimension in this method.
+  //! Sets to \p x the topological kind of \p *this row.
+  void set_topology(Topology x);
+
+  //! Sets to \p NECESSARILY_CLOSED the topological kind of \p *this row.
+  void set_necessarily_closed();
+
+  //! Sets to \p NOT_NECESSARILY_CLOSED the topological kind of \p *this row.
+  void set_not_necessarily_closed();
+  //@} // Flags coercion methods
+
+  //! Sets the dimension of the vector space enclosing \p *this to
+  //! \p space_dim .
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  /*!
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid objects.
+  */
+  void set_space_dimension_no_ok(dimension_type space_dim);
+
+  /*! \brief
+    Throws a <CODE>std::invalid_argument</CODE> exception containing
+    error message \p message.
+  */
+  void
+  throw_invalid_argument(const char* method, const char* message) const;
+
+  /*! \brief
+    Throws a <CODE>std::invalid_argument</CODE> exception
+    containing the appropriate error message.
+  */
+  void
+  throw_dimension_incompatible(const char* method,
+                               const char* name_var,
+                               Variable v) const;
+
+  //! Returns the epsilon coefficient. The constraint must be NNC.
+  Coefficient_traits::const_reference epsilon_coefficient() const;
+
+  //! Sets the epsilon coefficient to \p n. The constraint must be NNC.
+  void set_epsilon_coefficient(Coefficient_traits::const_reference n);
+
+  //! Marks the epsilon dimension as a standard dimension.
+  /*!
+    The row topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is increased by 1.
+  */
+  void mark_as_necessarily_closed();
+
+  //! Marks the last dimension as the epsilon dimension.
+  /*!
+    The row topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is decreased by 1.
+  */
+  void mark_as_not_necessarily_closed();
+
+  //! Sets the constraint type to <CODE>EQUALITY</CODE>.
+  void set_is_equality();
+
+  //! Sets the constraint to be an inequality.
+  /*!
+    Whether the constraint type will become <CODE>NONSTRICT_INEQUALITY</CODE>
+    or <CODE>STRICT_INEQUALITY</CODE> depends on the topology and the value
+    of the low-level coefficients of the constraint.
+  */
+  void set_is_inequality();
+
+  //! Linearly combines \p *this with \p y so that i-th coefficient is 0.
+  /*!
+    \param y
+    The Constraint that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting Constraint to \p *this and normalizes it.
+  */
+  void linear_combine(const Constraint& y, dimension_type i);
+
+  /*! \brief
+    Normalizes the sign of the coefficients so that the first non-zero
+    (homogeneous) coefficient of a line-or-equality is positive.
+  */
+  void sign_normalize();
+
+  /*! \brief
+    Strong normalization: ensures that different Constraint objects
+    represent different hyperplanes or hyperspaces.
+
+    Applies both Constraint::normalize() and Constraint::sign_normalize().
+  */
+  void strong_normalize();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the coefficients are
+    strongly normalized.
+  */
+  bool check_strong_normalized() const;
+
+  /*! \brief
+    Builds a new copy of the zero-dimension space constraint
+    \f$\epsilon \geq 0\f$ (used to implement NNC polyhedra).
+  */
+  static Constraint construct_epsilon_geq_zero();
+
+  friend int
+  compare(const Constraint& x, const Constraint& y);
+
+  friend class Linear_System<Constraint>;
+  friend class Constraint_System;
+  friend class Polyhedron;
+  friend class Scalar_Products;
+  friend class Topology_Adjusted_Scalar_Product_Sign;
+  friend class Termination_Helpers;
+  friend class Grid;
+  template <typename T>
+  friend class Octagonal_Shape;
+
+  friend Constraint
+  operator<(const Linear_Expression& e1, const Linear_Expression& e2);
+
+  friend Constraint
+  operator<(Variable v1, Variable v2);
+
+  friend Constraint
+  operator<(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Constraint
+  operator<(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+  friend Constraint
+  operator>(const Linear_Expression& e1, const Linear_Expression& e2);
+
+  friend Constraint
+  operator>(Variable v1, Variable v2);
+
+  friend Constraint
+  operator>(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Constraint
+  operator>(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+  friend Constraint
+  operator==(const Linear_Expression& e1, const Linear_Expression& e2);
+
+  friend Constraint
+  operator==(Variable v1, Variable v2);
+
+  friend Constraint
+  operator==(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Constraint
+  operator==(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+  friend Constraint
+  operator<=(const Linear_Expression& e1, const Linear_Expression& e2);
+
+  friend Constraint
+  operator<=(Variable v1, Variable v2);
+
+  friend Constraint
+  operator<=(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Constraint
+  operator<=(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+  friend Constraint
+  operator>=(const Linear_Expression& e1, const Linear_Expression& e2);
+
+  friend Constraint
+  operator>=(Variable v1, Variable v2);
+
+  friend Constraint
+  operator>=(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Constraint
+  operator>=(Coefficient_traits::const_reference n, const Linear_Expression& e);
+};
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Constraint */
+std::ostream& operator<<(std::ostream& s, const Constraint& c);
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Constraint */
+std::ostream& operator<<(std::ostream& s, const Constraint::Type& t);
+
+} // namespace IO_Operators
+
+//! Returns <CODE>true</CODE> if and only if \p x is equivalent to \p y.
+/*! \relates Constraint */
+bool
+operator==(const Constraint& x, const Constraint& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x is not equivalent to \p y.
+/*! \relates Constraint */
+bool
+operator!=(const Constraint& x, const Constraint& y);
+
+/*! \relates Constraint */
+void swap(Constraint& x, Constraint& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Constraint_inlines.hh"
+
+#endif // !defined(PPL_Constraint_defs_hh)
diff --git a/src/Constraint_inlines.hh b/src/Constraint_inlines.hh
new file mode 100644
index 0000000..2a077f4
--- /dev/null
+++ b/src/Constraint_inlines.hh
@@ -0,0 +1,577 @@
+/* Constraint class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Constraint_inlines_hh
+#define PPL_Constraint_inlines_hh 1
+
+#include "Linear_Expression_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline bool
+Constraint::is_necessarily_closed() const {
+  return (topology_ == NECESSARILY_CLOSED);
+}
+
+inline bool
+Constraint::is_not_necessarily_closed() const {
+  return !is_necessarily_closed();
+}
+
+inline Constraint::expr_type
+Constraint::expression() const {
+  return expr_type(expr, is_not_necessarily_closed());
+}
+
+inline dimension_type
+Constraint::space_dimension() const {
+  return expression().space_dimension();
+}
+
+inline void
+Constraint::shift_space_dimensions(Variable v, dimension_type n) {
+  expr.shift_space_dimensions(v, n);
+}
+
+inline bool
+Constraint::is_line_or_equality() const {
+  return (kind_ == LINE_OR_EQUALITY);
+}
+
+inline bool
+Constraint::is_ray_or_point_or_inequality() const {
+  return (kind_ == RAY_OR_POINT_OR_INEQUALITY);
+}
+
+inline Topology
+Constraint::topology() const {
+  return topology_;
+}
+
+inline void
+Constraint::set_is_line_or_equality() {
+  kind_ = LINE_OR_EQUALITY;
+}
+
+inline void
+Constraint::set_is_ray_or_point_or_inequality() {
+  kind_ = RAY_OR_POINT_OR_INEQUALITY;
+}
+
+inline void
+Constraint::set_topology(Topology x) {
+  if (topology() == x)
+    return;
+  if (topology() == NECESSARILY_CLOSED) {
+    // Add a column for the epsilon dimension.
+    expr.set_space_dimension(expr.space_dimension() + 1);
+  }
+  else {
+    PPL_ASSERT(expr.space_dimension() != 0);
+    expr.set_space_dimension(expr.space_dimension() - 1);
+  }
+  topology_ = x;
+}
+
+inline void
+Constraint::mark_as_necessarily_closed() {
+  PPL_ASSERT(is_not_necessarily_closed());
+  topology_ = NECESSARILY_CLOSED;
+}
+
+inline void
+Constraint::mark_as_not_necessarily_closed() {
+  PPL_ASSERT(is_necessarily_closed());
+  topology_ = NOT_NECESSARILY_CLOSED;
+}
+
+inline void
+Constraint::set_necessarily_closed() {
+  set_topology(NECESSARILY_CLOSED);
+}
+
+inline void
+Constraint::set_not_necessarily_closed() {
+  set_topology(NOT_NECESSARILY_CLOSED);
+}
+
+inline
+Constraint::Constraint(Representation r)
+  : expr(r),
+    kind_(RAY_OR_POINT_OR_INEQUALITY),
+    topology_(NECESSARILY_CLOSED) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::Constraint(dimension_type space_dim, Kind kind, Topology topology,
+                       Representation r)
+  : expr(r),
+    kind_(kind),
+    topology_(topology) {
+  expr.set_space_dimension(space_dim + 1);
+  PPL_ASSERT(space_dimension() == space_dim);
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::Constraint(Linear_Expression& e, Kind kind, Topology topology)
+  : kind_(kind),
+    topology_(topology) {
+  PPL_ASSERT(kind != RAY_OR_POINT_OR_INEQUALITY || topology == NOT_NECESSARILY_CLOSED);
+  swap(expr, e);
+  if (topology == NOT_NECESSARILY_CLOSED)
+    // Add the epsilon dimension.
+    expr.set_space_dimension(expr.space_dimension() + 1);
+  strong_normalize();
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::Constraint(Linear_Expression& e, Type type, Topology topology)
+  : topology_(topology) {
+  PPL_ASSERT(type != STRICT_INEQUALITY || topology == NOT_NECESSARILY_CLOSED);
+  swap(expr, e);
+  if (topology == NOT_NECESSARILY_CLOSED)
+    expr.set_space_dimension(expr.space_dimension() + 1);
+  if (type == EQUALITY)
+    kind_ = LINE_OR_EQUALITY;
+  else
+    kind_ = RAY_OR_POINT_OR_INEQUALITY;
+  strong_normalize();
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::Constraint(const Constraint& c)
+  : expr(c.expr),
+    kind_(c.kind_),
+    topology_(c.topology_) {
+  // NOTE: This does not call PPL_ASSERT(OK()) because this is called by OK().
+}
+
+inline
+Constraint::Constraint(const Constraint& c, Representation r)
+  : expr(c.expr, r),
+    kind_(c.kind_),
+    topology_(c.topology_) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::Constraint(const Constraint& c, const dimension_type space_dim)
+  : expr(c.expr, c.is_necessarily_closed() ? space_dim : (space_dim + 1)),
+    kind_(c.kind_), topology_(c.topology_) {
+  PPL_ASSERT(space_dimension() == space_dim);
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::Constraint(const Constraint& c, const dimension_type space_dim,
+                       Representation r)
+  : expr(c.expr, c.is_necessarily_closed() ? space_dim : (space_dim + 1), r),
+    kind_(c.kind_), topology_(c.topology_) {
+  PPL_ASSERT(space_dimension() == space_dim);
+  PPL_ASSERT(OK());
+}
+
+inline
+Constraint::~Constraint() {
+}
+
+inline Constraint&
+Constraint::operator=(const Constraint& c) {
+  Constraint tmp = c;
+  swap(*this, tmp);
+
+  return *this;
+}
+
+inline Representation
+Constraint::representation() const {
+  return expr.representation();
+}
+
+inline void
+Constraint::set_representation(Representation r) {
+  expr.set_representation(r);
+}
+
+inline dimension_type
+Constraint::max_space_dimension() {
+  return Linear_Expression::max_space_dimension();
+}
+
+inline void
+Constraint::set_space_dimension_no_ok(dimension_type space_dim) {
+  const dimension_type old_expr_space_dim = expr.space_dimension();
+  if (topology() == NECESSARILY_CLOSED) {
+    expr.set_space_dimension(space_dim);
+  }
+  else {
+    const dimension_type old_space_dim = space_dimension();
+    if (space_dim > old_space_dim) {
+      expr.set_space_dimension(space_dim + 1);
+      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
+    }
+    else {
+      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
+      expr.set_space_dimension(space_dim + 1);
+    }
+  }
+  PPL_ASSERT(space_dimension() == space_dim);
+  if (expr.space_dimension() < old_expr_space_dim)
+    strong_normalize();
+}
+
+inline void
+Constraint::set_space_dimension(dimension_type space_dim) {
+  set_space_dimension_no_ok(space_dim);
+  PPL_ASSERT(OK());
+}
+
+inline bool
+Constraint::remove_space_dimensions(const Variables_Set& vars) {
+  expr.remove_space_dimensions(vars);
+  return true;
+}
+
+inline bool
+Constraint::is_equality() const {
+  return is_line_or_equality();
+}
+
+inline bool
+Constraint::is_inequality() const {
+  return is_ray_or_point_or_inequality();
+}
+
+inline Constraint::Type
+Constraint::type() const {
+  if (is_equality())
+    return EQUALITY;
+  if (is_necessarily_closed())
+    return NONSTRICT_INEQUALITY;
+  if (epsilon_coefficient() < 0)
+    return STRICT_INEQUALITY;
+  else
+    return NONSTRICT_INEQUALITY;
+}
+
+inline bool
+Constraint::is_nonstrict_inequality() const {
+  return type() == NONSTRICT_INEQUALITY;
+}
+
+inline bool
+Constraint::is_strict_inequality() const {
+  return type() == STRICT_INEQUALITY;
+}
+
+inline void
+Constraint::set_is_equality() {
+  set_is_line_or_equality();
+}
+
+inline void
+Constraint::set_is_inequality() {
+  set_is_ray_or_point_or_inequality();
+}
+
+inline Coefficient_traits::const_reference
+Constraint::coefficient(const Variable v) const {
+  if (v.space_dimension() > space_dimension())
+    throw_dimension_incompatible("coefficient(v)", "v", v);
+  return expr.coefficient(v);
+}
+
+inline Coefficient_traits::const_reference
+Constraint::inhomogeneous_term() const {
+  return expr.inhomogeneous_term();
+}
+
+inline memory_size_type
+Constraint::external_memory_in_bytes() const {
+  return expr.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Constraint::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline void
+Constraint::strong_normalize() {
+  expr.normalize();
+  sign_normalize();
+}
+
+/*! \relates Constraint */
+inline bool
+operator==(const Constraint& x, const Constraint& y) {
+  return x.is_equivalent_to(y);
+}
+
+/*! \relates Constraint */
+inline bool
+operator!=(const Constraint& x, const Constraint& y) {
+  return !x.is_equivalent_to(y);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator==(const Linear_Expression& e1, const Linear_Expression& e2) {
+  Linear_Expression diff(e1,
+                         std::max(e1.space_dimension(), e2.space_dimension()),
+                         Constraint::default_representation);
+  diff -= e2;
+  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator==(Variable v1, Variable v2) {
+  if (v1.space_dimension() > v2.space_dimension())
+    swap(v1, v2);
+  PPL_ASSERT(v1.space_dimension() <= v2.space_dimension());
+
+  Linear_Expression diff(v1, Constraint::default_representation);
+  diff -= v2;
+  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>=(const Linear_Expression& e1, const Linear_Expression& e2) {
+  Linear_Expression diff(e1,
+                         std::max(e1.space_dimension(), e2.space_dimension()),
+                         Constraint::default_representation);
+  diff -= e2;
+  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>=(const Variable v1, const Variable v2) {
+  Linear_Expression diff(Constraint::default_representation);
+  diff.set_space_dimension(std::max(v1.space_dimension(),
+                                    v2.space_dimension()));
+  diff += v1;
+  diff -= v2;
+  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>(const Linear_Expression& e1, const Linear_Expression& e2) {
+  Linear_Expression diff(e1, Constraint::default_representation);
+  diff -= e2;
+  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
+
+  // NOTE: this also enforces normalization.
+  c.set_epsilon_coefficient(-1);
+  PPL_ASSERT(c.OK());
+
+  return c;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>(const Variable v1, const Variable v2) {
+  Linear_Expression diff(Constraint::default_representation);
+  diff.set_space_dimension(std::max(v1.space_dimension(),
+                                    v2.space_dimension()));
+  diff += v1;
+  diff -= v2;
+  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
+
+  c.set_epsilon_coefficient(-1);
+  PPL_ASSERT(c.OK());
+
+  return c;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator==(Coefficient_traits::const_reference n, const Linear_Expression& e) {
+  Linear_Expression diff(e, Constraint::default_representation);
+  neg_assign(diff);
+  diff += n;
+  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>=(Coefficient_traits::const_reference n, const Linear_Expression& e) {
+  Linear_Expression diff(e, Constraint::default_representation);
+  neg_assign(diff);
+  diff += n;
+  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>(Coefficient_traits::const_reference n, const Linear_Expression& e) {
+  Linear_Expression diff(e, Constraint::default_representation);
+  neg_assign(diff);
+  diff += n;
+  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
+
+  // NOTE: this also enforces normalization.
+  c.set_epsilon_coefficient(-1);
+  PPL_ASSERT(c.OK());
+
+  return c;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator==(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  Linear_Expression diff(e, Constraint::default_representation);
+  diff -= n;
+  return Constraint(diff, Constraint::EQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>=(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  Linear_Expression diff(e, Constraint::default_representation);
+  diff -= n;
+  return Constraint(diff, Constraint::NONSTRICT_INEQUALITY, NECESSARILY_CLOSED);
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator>(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  Linear_Expression diff(e, Constraint::default_representation);
+  diff -= n;
+  Constraint c(diff, Constraint::STRICT_INEQUALITY, NOT_NECESSARILY_CLOSED);
+
+  // NOTE: this also enforces normalization.
+  c.set_epsilon_coefficient(-1);
+  PPL_ASSERT(c.OK());
+
+  return c;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<=(const Linear_Expression& e1, const Linear_Expression& e2) {
+  return e2 >= e1;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<=(const Variable v1, const Variable v2) {
+  return v2 >= v1;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<=(Coefficient_traits::const_reference n, const Linear_Expression& e) {
+  return e >= n;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<=(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  return n >= e;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<(const Linear_Expression& e1, const Linear_Expression& e2) {
+  return e2 > e1;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<(const Variable v1, const Variable v2) {
+  return v2 > v1;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<(Coefficient_traits::const_reference n, const Linear_Expression& e) {
+  return e > n;
+}
+
+/*! \relates Constraint */
+inline Constraint
+operator<(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  return n > e;
+}
+
+inline const Constraint&
+Constraint::zero_dim_false() {
+  PPL_ASSERT(zero_dim_false_p != 0);
+  return *zero_dim_false_p;
+}
+
+inline const Constraint&
+Constraint::zero_dim_positivity() {
+  PPL_ASSERT(zero_dim_positivity_p != 0);
+  return *zero_dim_positivity_p;
+}
+
+inline const Constraint&
+Constraint::epsilon_geq_zero() {
+  PPL_ASSERT(epsilon_geq_zero_p != 0);
+  return *epsilon_geq_zero_p;
+}
+
+inline const Constraint&
+Constraint::epsilon_leq_one() {
+  PPL_ASSERT(epsilon_leq_one_p != 0);
+  return *epsilon_leq_one_p;
+}
+
+inline void
+Constraint::m_swap(Constraint& y) {
+  using std::swap;
+  swap(expr, y.expr);
+  swap(kind_, y.kind_);
+  swap(topology_, y.topology_);
+}
+
+inline Coefficient_traits::const_reference
+Constraint::epsilon_coefficient() const {
+  PPL_ASSERT(is_not_necessarily_closed());
+  return expr.coefficient(Variable(expr.space_dimension() - 1));
+}
+
+inline void
+Constraint::set_epsilon_coefficient(Coefficient_traits::const_reference n) {
+  PPL_ASSERT(is_not_necessarily_closed());
+  expr.set_coefficient(Variable(expr.space_dimension() - 1), n);
+}
+
+/*! \relates Constraint */
+inline void
+swap(Constraint& x, Constraint& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Constraint_inlines_hh)
diff --git a/src/Constraint_types.hh b/src/Constraint_types.hh
new file mode 100644
index 0000000..223a3c6
--- /dev/null
+++ b/src/Constraint_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Constraint_types_hh
+#define PPL_Constraint_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Constraint;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Constraint_types_hh)
diff --git a/src/DB_Matrix.defs.hh b/src/DB_Matrix.defs.hh
deleted file mode 100644
index afe41ea..0000000
--- a/src/DB_Matrix.defs.hh
+++ /dev/null
@@ -1,325 +0,0 @@
-/* DB_Matrix class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_DB_Matrix_defs_hh
-#define PPL_DB_Matrix_defs_hh 1
-
-#include "DB_Matrix.types.hh"
-#include "globals.defs.hh"
-#include "DB_Row.defs.hh"
-#include "Checked_Number.types.hh"
-#include "Rounding_Dir.defs.hh"
-#include <vector>
-#include <cstddef>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-std::ostream&
-operator<<(std::ostream& s, const DB_Matrix<T>& c);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The base class for the square matrices.
-/*! \ingroup PPL_CXX_interface
-  The template class DB_Matrix<T> allows for the representation of
-  a square matrix of T objects.
-  Each DB_Matrix<T> object can be viewed as a multiset of DB_Row<T>.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Parma_Polyhedra_Library::DB_Matrix {
-public:
-  //! Returns the maximum number of rows a DB_Matrix can handle.
-  static dimension_type max_num_rows();
-
-  //! Returns the maximum number of columns a DB_Matrix can handle.
-  static dimension_type max_num_columns();
-
-  //! Builds an empty matrix.
-  /*!
-    DB_Rows' size and capacity are initialized to \f$0\f$.
-  */
-  DB_Matrix();
-
-  //! Builds a square matrix having the specified dimension.
-  explicit DB_Matrix(dimension_type n_rows);
-
-  //! Copy constructor.
-  DB_Matrix(const DB_Matrix& y);
-
-  //! Constructs a conservative approximation of \p y.
-  template <typename U>
-  explicit DB_Matrix(const DB_Matrix<U>& y);
-
-  //! Destructor.
-  ~DB_Matrix();
-
-  //! Assignment operator.
-  DB_Matrix& operator=(const DB_Matrix& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! A read-only iterator over the rows of the matrix.
-  /*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  class const_iterator {
-  private:
-    typedef typename std::vector<DB_Row<T> >::const_iterator Iter;
-    //! The const iterator on the rows' vector \p rows.
-    Iter i;
-
-  public:
-    typedef std::forward_iterator_tag iterator_category;
-    typedef typename std::iterator_traits<Iter>::value_type value_type;
-    typedef typename std::iterator_traits<Iter>::difference_type
-    difference_type;
-    typedef typename std::iterator_traits<Iter>::pointer pointer;
-    typedef typename std::iterator_traits<Iter>::reference reference;
-
-    //! Default constructor.
-    const_iterator();
-
-    /*! \brief
-      Builds a const iterator on the matrix starting from
-      an iterator \p b on the elements of the vector \p rows.
-    */
-    explicit const_iterator(const Iter& b);
-
-    //! Ordinary copy constructor.
-    const_iterator(const const_iterator& y);
-
-    //! Assignment operator.
-    const_iterator& operator=(const const_iterator& y);
-
-    //! Dereference operator.
-    reference operator*() const;
-
-    //! Indirect member selector.
-    pointer operator->() const;
-
-    //! Prefix increment operator.
-    const_iterator& operator++();
-
-    //! Postfix increment operator.
-    const_iterator operator++(int);
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if
-      \p *this and \p y are identical.
-    */
-    bool operator==(const const_iterator& y) const;
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if
-      \p *this and \p y are different.
-    */
-    bool operator!=(const const_iterator& y) const;
-  };
-
-  /*! \brief
-    Returns the const_iterator pointing to the first row,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const_iterator.
-  const_iterator end() const;
-
-private:
-  template <typename U> friend class DB_Matrix;
-
-  //! The rows of the matrix.
-  std::vector<DB_Row<T> > rows;
-
-  //! Size of the initialized part of each row.
-  dimension_type row_size;
-
-  /*! \brief
-    Capacity allocated for each row, i.e., number of
-    <CODE>long</CODE> objects that each row can contain.
-  */
-  dimension_type row_capacity;
-
-public:
-  //! Swaps \p *this with \p y.
-  void m_swap(DB_Matrix& y);
-
-  //! Makes the matrix grow by adding more rows and more columns.
-  /*!
-    \param new_n_rows
-    The number of rows and columns of the resized matrix.
-
-    A new matrix, with the specified dimension, is created.
-    The contents of the old matrix are copied in the upper, left-hand
-    corner of the new matrix, which is then assigned to \p *this.
-  */
-  void grow(dimension_type new_n_rows);
-
-  //! Resizes the matrix without worrying about the old contents.
-  /*!
-    \param new_n_rows
-    The number of rows and columns of the resized matrix.
-
-    A new matrix, with the specified dimension, is created without copying
-    the content of the old matrix and assigned to \p *this.
-  */
-  void resize_no_copy(dimension_type new_n_rows);
-
-  //! Returns the number of rows in the matrix.
-  dimension_type num_rows() const;
-
-  //! \name Subscript operators.
-  //@{
-  //! Returns a reference to the \p k-th row of the matrix.
-  DB_Row<T>& operator[](dimension_type k);
-
-  //! Returns a constant reference to the \p k-th row of the matrix.
-  const DB_Row<T>& operator[](dimension_type k) const;
-  //@}
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-void swap(DB_Matrix<T>& x, DB_Matrix<T>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-bool operator==(const DB_Matrix<T>& x, const DB_Matrix<T>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-bool operator!=(const DB_Matrix<T>& x, const DB_Matrix<T>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates DB_Matrix
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into to \p r
-  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-				 const DB_Matrix<T>& x,
-				 const DB_Matrix<T>& y,
-				 Rounding_Dir dir,
-				 Temp& tmp0,
-				 Temp& tmp1,
-				 Temp& tmp2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates DB_Matrix
-  If the Euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into to \p r
-  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			       const DB_Matrix<T>& x,
-			       const DB_Matrix<T>& y,
-			       Rounding_Dir dir,
-			       Temp& tmp0,
-			       Temp& tmp1,
-			       Temp& tmp2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates DB_Matrix
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into to \p r
-  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const DB_Matrix<T>& x,
-                                const DB_Matrix<T>& y,
-                                Rounding_Dir dir,
-                                Temp& tmp0,
-                                Temp& tmp1,
-                                Temp& tmp2);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "DB_Matrix.inlines.hh"
-#include "DB_Matrix.templates.hh"
-
-#endif // !defined(PPL_DB_Matrix_defs_hh)
diff --git a/src/DB_Matrix.inlines.hh b/src/DB_Matrix.inlines.hh
deleted file mode 100644
index d8cf31f..0000000
--- a/src/DB_Matrix.inlines.hh
+++ /dev/null
@@ -1,330 +0,0 @@
-/* DB_Matrix class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_DB_Matrix_inlines_hh
-#define PPL_DB_Matrix_inlines_hh 1
-
-#include "globals.defs.hh"
-#include "Checked_Number.defs.hh"
-#include "distances.defs.hh"
-#include "assert.hh"
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline void
-DB_Matrix<T>::m_swap(DB_Matrix& y) {
-  using std::swap;
-  swap(rows, y.rows);
-  swap(row_size, y.row_size);
-  swap(row_capacity, y.row_capacity);
-}
-
-template <typename T>
-inline dimension_type
-DB_Matrix<T>::max_num_rows() {
-  return std::vector<DB_Row<T> >().max_size();
-}
-
-template <typename T>
-inline dimension_type
-DB_Matrix<T>::max_num_columns() {
-  return DB_Row<T>::max_size();
-}
-
-template <typename T>
-inline memory_size_type
-DB_Matrix<T>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename T>
-inline
-DB_Matrix<T>::const_iterator::const_iterator()
-  : i(Iter()) {
-}
-
-template <typename T>
-inline
-DB_Matrix<T>::const_iterator::const_iterator(const Iter& b)
-  : i(b) {
-}
-
-template <typename T>
-inline
-DB_Matrix<T>::const_iterator::const_iterator(const const_iterator& y)
-  : i(y.i) {
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator&
-DB_Matrix<T>::const_iterator::operator=(const const_iterator& y) {
-  i = y.i;
-  return *this;
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator::reference
-DB_Matrix<T>::const_iterator::operator*() const {
-  return *i;
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator::pointer
-DB_Matrix<T>::const_iterator::operator->() const {
-  return &*i;
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator&
-DB_Matrix<T>::const_iterator::operator++() {
-  ++i;
-  return *this;
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator
-DB_Matrix<T>::const_iterator::operator++(int) {
-  return const_iterator(i++);
-}
-
-template <typename T>
-inline bool
-DB_Matrix<T>::const_iterator::operator==(const const_iterator& y) const {
-  return i == y.i;
-}
-
-template <typename T>
-inline bool
-DB_Matrix<T>::const_iterator::operator!=(const const_iterator& y) const {
-  return !operator==(y);
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator
-DB_Matrix<T>::begin() const {
-  return const_iterator(rows.begin());
-}
-
-template <typename T>
-inline typename DB_Matrix<T>::const_iterator
-DB_Matrix<T>::end() const {
-  return const_iterator(rows.end());
-}
-
-template <typename T>
-inline
-DB_Matrix<T>::DB_Matrix()
-  : rows(),
-    row_size(0),
-    row_capacity(0) {
-}
-
-template <typename T>
-inline
-DB_Matrix<T>::~DB_Matrix() {
-}
-
-template <typename T>
-inline DB_Row<T>&
-DB_Matrix<T>::operator[](const dimension_type k) {
-  PPL_ASSERT(k < rows.size());
-  return rows[k];
-}
-
-template <typename T>
-inline const DB_Row<T>&
-DB_Matrix<T>::operator[](const dimension_type k) const {
-  PPL_ASSERT(k < rows.size());
-  return rows[k];
-}
-
-template <typename T>
-inline dimension_type
-DB_Matrix<T>::num_rows() const {
-  return rows.size();
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-inline bool
-operator!=(const DB_Matrix<T>& x, const DB_Matrix<T>& y) {
-  return !(x == y);
-}
-
-template <typename T>
-inline
-DB_Matrix<T>::DB_Matrix(const DB_Matrix& y)
-  : rows(y.rows),
-    row_size(y.row_size),
-    row_capacity(compute_capacity(y.row_size, max_num_columns())) {
-}
-
-template <typename T>
-inline DB_Matrix<T>&
-DB_Matrix<T>::operator=(const DB_Matrix& y) {
-  // Without the following guard against auto-assignments we would
-  // recompute the row capacity based on row size, possibly without
-  // actually increasing the capacity of the rows.  This would lead to
-  // an inconsistent state.
-  if (this != &y) {
-    // The following assignment may do nothing on auto-assignments...
-    rows = y.rows;
-    row_size = y.row_size;
-    // ... hence the following assignment must not be done on
-    // auto-assignments.
-    row_capacity = compute_capacity(y.row_size, max_num_columns());
-  }
-  return *this;
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Specialization, typename Temp, typename To, typename T>
-inline bool
-l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const DB_Matrix<T>& x,
-		    const DB_Matrix<T>& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0,
-		    Temp& tmp1,
-		    Temp& tmp2) {
-  const dimension_type x_num_rows = x.num_rows();
-  if (x_num_rows != y.num_rows())
-    return false;
-  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
-  for (dimension_type i = x_num_rows; i-- > 0; ) {
-    const DB_Row<T>& x_i = x[i];
-    const DB_Row<T>& y_i = y[i];
-    for (dimension_type j = x_num_rows; j-- > 0; ) {
-      const T& x_i_j = x_i[j];
-      const T& y_i_j = y_i[j];
-      if (is_plus_infinity(x_i_j)) {
-	if (is_plus_infinity(y_i_j))
-	  continue;
-	else {
-	pinf:
-	  assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-	  return true;
-	}
-      }
-      else if (is_plus_infinity(y_i_j))
-	goto pinf;
-
-      const Temp* tmp1p;
-      const Temp* tmp2p;
-      if (x_i_j > y_i_j) {
-	maybe_assign(tmp1p, tmp1, x_i_j, dir);
-	maybe_assign(tmp2p, tmp2, y_i_j, inverse(dir));
-      }
-      else {
-	maybe_assign(tmp1p, tmp1, y_i_j, dir);
-	maybe_assign(tmp2p, tmp2, x_i_j, inverse(dir));
-      }
-      sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
-      PPL_ASSERT(sgn(tmp1) >= 0);
-      Specialization::combine(tmp0, tmp1, dir);
-    }
-  }
-  Specialization::finalize(tmp0, dir);
-  assign_r(r, tmp0, dir);
-  return true;
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const DB_Matrix<T>& x,
-			    const DB_Matrix<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
-  return
-    l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >(r, x, y,
-								    dir,
-								    tmp0,
-								    tmp1,
-								    tmp2);
-}
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const DB_Matrix<T>& x,
-			  const DB_Matrix<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
-  return
-    l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >(r, x, y,
-								  dir,
-								  tmp0,
-								  tmp1,
-								  tmp2);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const DB_Matrix<T>& x,
-			   const DB_Matrix<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
-  return
-    l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >(r, x, y,
-								   dir,
-								   tmp0,
-								   tmp1,
-								   tmp2);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-inline void
-swap(DB_Matrix<T>& x, DB_Matrix<T>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_DB_Matrix_inlines_hh)
diff --git a/src/DB_Matrix.templates.hh b/src/DB_Matrix.templates.hh
deleted file mode 100644
index e03974d..0000000
--- a/src/DB_Matrix.templates.hh
+++ /dev/null
@@ -1,319 +0,0 @@
-/* DB_Matrix class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_DB_Matrix_templates_hh
-#define PPL_DB_Matrix_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-DB_Matrix<T>::DB_Matrix(const dimension_type n_rows)
-  : rows(n_rows),
-    row_size(n_rows),
-    row_capacity(compute_capacity(n_rows, max_num_columns())) {
-  // Construct in direct order: will destroy in reverse order.
-  for (dimension_type i = 0; i < n_rows; ++i)
-    rows[i].construct(n_rows, row_capacity);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename U>
-DB_Matrix<T>::DB_Matrix(const DB_Matrix<U>& y)
-  : rows(y.rows.size()),
-    row_size(y.row_size),
-    row_capacity(compute_capacity(y.row_size, max_num_columns())) {
-  // Construct in direct order: will destroy in reverse order.
-  for (dimension_type i = 0, n_rows = rows.size(); i < n_rows; ++i)
-    rows[i].construct_upward_approximation(y[i], row_capacity);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-DB_Matrix<T>::grow(const dimension_type new_n_rows) {
-  const dimension_type old_n_rows = rows.size();
-  PPL_ASSERT(new_n_rows >= old_n_rows);
-
-  if (new_n_rows > old_n_rows) {
-    if (new_n_rows <= row_capacity) {
-      // We can recycle the old rows.
-      if (rows.capacity() < new_n_rows) {
-	// Reallocation will take place.
-	std::vector<DB_Row<T> > new_rows;
-	new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
-	new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
-	// Construct the new rows.
-	dimension_type i = new_n_rows;
-	while (i-- > old_n_rows)
-	  new_rows[i].construct(new_n_rows, row_capacity);
-	// Steal the old rows.
-	++i;
-	while (i-- > 0)
-	  swap(new_rows[i], rows[i]);
-	// Put the new vector into place.
-        using std::swap;
-	swap(rows, new_rows);
-      }
-      else {
-	// Reallocation will NOT take place.
-	rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
-	for (dimension_type i = new_n_rows; i-- > old_n_rows; )
-	  rows[i].construct(new_n_rows, row_capacity);
-      }
-    }
-    else {
-      // We cannot even recycle the old rows.
-      DB_Matrix new_matrix;
-      new_matrix.rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
-      new_matrix.rows.insert(new_matrix.rows.end(), new_n_rows, DB_Row<T>());
-      // Construct the new rows.
-      new_matrix.row_size = new_n_rows;
-      new_matrix.row_capacity = compute_capacity(new_n_rows,
-						 max_num_columns());
-      dimension_type i = new_n_rows;
-      while (i-- > old_n_rows)
-	new_matrix.rows[i].construct(new_matrix.row_size,
-				     new_matrix.row_capacity);
-      // Copy the old rows.
-      ++i;
-      while (i-- > 0) {
-	// FIXME: copying may be unnecessarily costly.
-	DB_Row<T> new_row(rows[i],
-			  new_matrix.row_size,
-			  new_matrix.row_capacity);
-	swap(new_matrix.rows[i], new_row);
-      }
-      // Put the new vector into place.
-      m_swap(new_matrix);
-      return;
-    }
-  }
-  // Here we have the right number of rows.
-  if (new_n_rows > row_size) {
-    // We need more columns.
-    if (new_n_rows <= row_capacity)
-      // But we have enough capacity: we resize existing rows.
-      for (dimension_type i = old_n_rows; i-- > 0; )
-	rows[i].expand_within_capacity(new_n_rows);
-    else {
-      // Capacity exhausted: we must reallocate the rows and
-      // make sure all the rows have the same capacity.
-      const dimension_type new_row_capacity
-	= compute_capacity(new_n_rows, max_num_columns());
-      for (dimension_type i = old_n_rows; i-- > 0; ) {
-	// FIXME: copying may be unnecessarily costly.
-	DB_Row<T> new_row(rows[i], new_n_rows, new_row_capacity);
-	swap(rows[i], new_row);
-      }
-      row_capacity = new_row_capacity;
-    }
-    // Rows have grown or shrunk.
-    row_size = new_n_rows;
-  }
-}
-
-template <typename T>
-void
-DB_Matrix<T>::resize_no_copy(const dimension_type new_n_rows) {
-  dimension_type old_n_rows = rows.size();
-
-  if (new_n_rows > old_n_rows) {
-    // Rows will be inserted.
-    if (new_n_rows <= row_capacity) {
-      // We can recycle the old rows.
-      if (rows.capacity() < new_n_rows) {
-	// Reallocation (of vector `rows') will take place.
-	std::vector<DB_Row<T> > new_rows;
-	new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
-	new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
-	// Construct the new rows (be careful: each new row must have
-	// the same capacity as each one of the old rows).
-	dimension_type i = new_n_rows;
-	while (i-- > old_n_rows)
-	  new_rows[i].construct(new_n_rows, row_capacity);
-	// Steal the old rows.
-	++i;
-	while (i-- > 0)
-	  swap(new_rows[i], rows[i]);
-	// Put the new vector into place.
-        using std::swap;
-	swap(rows, new_rows);
-      }
-      else {
-	// Reallocation (of vector `rows') will NOT take place.
-	rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
-	// Be careful: each new row must have
-	// the same capacity as each one of the old rows.
-	for (dimension_type i = new_n_rows; i-- > old_n_rows; )
-	  rows[i].construct(new_n_rows, row_capacity);
-      }
-    }
-    else {
-      // We cannot even recycle the old rows: allocate a new matrix and swap.
-      DB_Matrix new_matrix(new_n_rows);
-      m_swap(new_matrix);
-      return;
-    }
-  }
-  else if (new_n_rows < old_n_rows) {
-    // Drop some rows.
-    rows.resize(new_n_rows);
-    // Shrink the existing rows.
-    for (dimension_type i = new_n_rows; i-- > 0; )
-      rows[i].shrink(new_n_rows);
-    old_n_rows = new_n_rows;
-  }
-  // Here we have the right number of rows.
-  if (new_n_rows > row_size) {
-    // We need more columns.
-    if (new_n_rows <= row_capacity)
-      // But we have enough capacity: we resize existing rows.
-      for (dimension_type i = old_n_rows; i-- > 0; )
-	rows[i].expand_within_capacity(new_n_rows);
-    else {
-      // Capacity exhausted: we must reallocate the rows and
-      // make sure all the rows have the same capacity.
-      const dimension_type new_row_capacity
-	= compute_capacity(new_n_rows, max_num_columns());
-      for (dimension_type i = old_n_rows; i-- > 0; ) {
-	DB_Row<T> new_row(new_n_rows, new_row_capacity);
-	swap(rows[i], new_row);
-      }
-      row_capacity = new_row_capacity;
-    }
-  }
-  // DB_Rows have grown or shrunk.
-  row_size = new_n_rows;
-}
-
-template <typename T>
-void
-DB_Matrix<T>::ascii_dump(std::ostream& s) const {
-  const DB_Matrix<T>& x = *this;
-  const char separator = ' ';
-  const dimension_type nrows = x.num_rows();
-  s << nrows << separator << "\n";
-  for (dimension_type i = 0; i < nrows;  ++i) {
-    for (dimension_type j = 0; j < nrows; ++j) {
-      using namespace IO_Operators;
-      s << x[i][j] << separator;
-    }
-    s << "\n";
-  }
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, DB_Matrix<T>)
-
-template <typename T>
-bool
-DB_Matrix<T>::ascii_load(std::istream& s) {
-  dimension_type nrows;
-  if (!(s >> nrows))
-    return false;
-  resize_no_copy(nrows);
-  DB_Matrix& x = *this;
-  for (dimension_type i = 0; i < nrows;  ++i)
-    for (dimension_type j = 0; j < nrows; ++j) {
-      Result r = input(x[i][j], s, ROUND_CHECK);
-      if (result_relation(r) != VR_EQ || is_minus_infinity(x[i][j]))
-	return false;
-    }
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-bool
-operator==(const DB_Matrix<T>& x, const DB_Matrix<T>& y) {
-  const dimension_type x_num_rows = x.num_rows();
-  if (x_num_rows != y.num_rows())
-    return false;
-  for (dimension_type i = x_num_rows; i-- > 0; )
-    if (x[i] != y[i])
-      return false;
-  return true;
-}
-
-template <typename T>
-memory_size_type
-DB_Matrix<T>::external_memory_in_bytes() const {
-  memory_size_type n = rows.capacity() * sizeof(DB_Row<T>);
-  for (dimension_type i = num_rows(); i-- > 0; )
-    n += rows[i].external_memory_in_bytes(row_capacity);
-  return n;
-}
-
-template <typename T>
-bool
-DB_Matrix<T>::OK() const {
-#ifndef NDEBUG
-  using std::endl;
-  using std::cerr;
-#endif
-
-  // The matrix must be square.
-  if (num_rows() != row_size) {
-#ifndef NDEBUG
-    cerr << "DB_Matrix has fewer columns than rows:\n"
-	 << "row_size is " << row_size
-	 << ", num_rows() is " << num_rows() << "!"
-	 << endl;
-#endif
-    return false;
-  }
-
-  const DB_Matrix& x = *this;
-  const dimension_type n_rows = x.num_rows();
-  for (dimension_type i = 0; i < n_rows; ++i) {
-    if (!x[i].OK(row_size, row_capacity))
-      return false;
-  }
-
-  // All checks passed.
-  return true;
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Parma_Polyhedra_Library::DB_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-std::ostream&
-IO_Operators::operator<<(std::ostream& s, const DB_Matrix<T>& c) {
-  const dimension_type n = c.num_rows();
-  for (dimension_type i = 0; i < n; ++i) {
-    for (dimension_type j = 0; j < n; ++j)
-      s << c[i][j] << " ";
-    s << "\n";
-  }
-  return s;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_DB_Matrix_templates_hh)
diff --git a/src/DB_Matrix.types.hh b/src/DB_Matrix.types.hh
deleted file mode 100644
index c5f43d5..0000000
--- a/src/DB_Matrix.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_DB_Matrix_types_hh
-#define PPL_DB_Matrix_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-class DB_Matrix;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_DB_Matrix_types_hh)
diff --git a/src/DB_Matrix_defs.hh b/src/DB_Matrix_defs.hh
new file mode 100644
index 0000000..507972f
--- /dev/null
+++ b/src/DB_Matrix_defs.hh
@@ -0,0 +1,325 @@
+/* DB_Matrix class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_DB_Matrix_defs_hh
+#define PPL_DB_Matrix_defs_hh 1
+
+#include "DB_Matrix_types.hh"
+#include "globals_defs.hh"
+#include "DB_Row_defs.hh"
+#include "Checked_Number_types.hh"
+#include "Rounding_Dir_defs.hh"
+#include <vector>
+#include <cstddef>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+std::ostream&
+operator<<(std::ostream& s, const DB_Matrix<T>& c);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The base class for the square matrices.
+/*! \ingroup PPL_CXX_interface
+  The template class DB_Matrix<T> allows for the representation of
+  a square matrix of T objects.
+  Each DB_Matrix<T> object can be viewed as a multiset of DB_Row<T>.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::DB_Matrix {
+public:
+  //! Returns the maximum number of rows a DB_Matrix can handle.
+  static dimension_type max_num_rows();
+
+  //! Returns the maximum number of columns a DB_Matrix can handle.
+  static dimension_type max_num_columns();
+
+  //! Builds an empty matrix.
+  /*!
+    DB_Rows' size and capacity are initialized to \f$0\f$.
+  */
+  DB_Matrix();
+
+  //! Builds a square matrix having the specified dimension.
+  explicit DB_Matrix(dimension_type n_rows);
+
+  //! Copy constructor.
+  DB_Matrix(const DB_Matrix& y);
+
+  //! Constructs a conservative approximation of \p y.
+  template <typename U>
+  explicit DB_Matrix(const DB_Matrix<U>& y);
+
+  //! Destructor.
+  ~DB_Matrix();
+
+  //! Assignment operator.
+  DB_Matrix& operator=(const DB_Matrix& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! A read-only iterator over the rows of the matrix.
+  /*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  class const_iterator {
+  private:
+    typedef typename std::vector<DB_Row<T> >::const_iterator Iter;
+    //! The const iterator on the rows' vector \p rows.
+    Iter i;
+
+  public:
+    typedef std::forward_iterator_tag iterator_category;
+    typedef typename std::iterator_traits<Iter>::value_type value_type;
+    typedef typename std::iterator_traits<Iter>::difference_type
+    difference_type;
+    typedef typename std::iterator_traits<Iter>::pointer pointer;
+    typedef typename std::iterator_traits<Iter>::reference reference;
+
+    //! Default constructor.
+    const_iterator();
+
+    /*! \brief
+      Builds a const iterator on the matrix starting from
+      an iterator \p b on the elements of the vector \p rows.
+    */
+    explicit const_iterator(const Iter& b);
+
+    //! Ordinary copy constructor.
+    const_iterator(const const_iterator& y);
+
+    //! Assignment operator.
+    const_iterator& operator=(const const_iterator& y);
+
+    //! Dereference operator.
+    reference operator*() const;
+
+    //! Indirect member selector.
+    pointer operator->() const;
+
+    //! Prefix increment operator.
+    const_iterator& operator++();
+
+    //! Postfix increment operator.
+    const_iterator operator++(int);
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if
+      \p *this and \p y are identical.
+    */
+    bool operator==(const const_iterator& y) const;
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if
+      \p *this and \p y are different.
+    */
+    bool operator!=(const const_iterator& y) const;
+  };
+
+  /*! \brief
+    Returns the const_iterator pointing to the first row,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const_iterator.
+  const_iterator end() const;
+
+private:
+  template <typename U> friend class DB_Matrix;
+
+  //! The rows of the matrix.
+  std::vector<DB_Row<T> > rows;
+
+  //! Size of the initialized part of each row.
+  dimension_type row_size;
+
+  /*! \brief
+    Capacity allocated for each row, i.e., number of
+    <CODE>long</CODE> objects that each row can contain.
+  */
+  dimension_type row_capacity;
+
+public:
+  //! Swaps \p *this with \p y.
+  void m_swap(DB_Matrix& y);
+
+  //! Makes the matrix grow by adding more rows and more columns.
+  /*!
+    \param new_n_rows
+    The number of rows and columns of the resized matrix.
+
+    A new matrix, with the specified dimension, is created.
+    The contents of the old matrix are copied in the upper, left-hand
+    corner of the new matrix, which is then assigned to \p *this.
+  */
+  void grow(dimension_type new_n_rows);
+
+  //! Resizes the matrix without worrying about the old contents.
+  /*!
+    \param new_n_rows
+    The number of rows and columns of the resized matrix.
+
+    A new matrix, with the specified dimension, is created without copying
+    the content of the old matrix and assigned to \p *this.
+  */
+  void resize_no_copy(dimension_type new_n_rows);
+
+  //! Returns the number of rows in the matrix.
+  dimension_type num_rows() const;
+
+  //! \name Subscript operators.
+  //@{
+  //! Returns a reference to the \p k-th row of the matrix.
+  DB_Row<T>& operator[](dimension_type k);
+
+  //! Returns a constant reference to the \p k-th row of the matrix.
+  const DB_Row<T>& operator[](dimension_type k) const;
+  //@}
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+void swap(DB_Matrix<T>& x, DB_Matrix<T>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+bool operator==(const DB_Matrix<T>& x, const DB_Matrix<T>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+bool operator!=(const DB_Matrix<T>& x, const DB_Matrix<T>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates DB_Matrix
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into to \p r
+  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const DB_Matrix<T>& x,
+                                 const DB_Matrix<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates DB_Matrix
+  If the Euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into to \p r
+  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const DB_Matrix<T>& x,
+                               const DB_Matrix<T>& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates DB_Matrix
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into to \p r
+  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const DB_Matrix<T>& x,
+                                const DB_Matrix<T>& y,
+                                Rounding_Dir dir,
+                                Temp& tmp0,
+                                Temp& tmp1,
+                                Temp& tmp2);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "DB_Matrix_inlines.hh"
+#include "DB_Matrix_templates.hh"
+
+#endif // !defined(PPL_DB_Matrix_defs_hh)
diff --git a/src/DB_Matrix_inlines.hh b/src/DB_Matrix_inlines.hh
new file mode 100644
index 0000000..63c52ca
--- /dev/null
+++ b/src/DB_Matrix_inlines.hh
@@ -0,0 +1,330 @@
+/* DB_Matrix class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_DB_Matrix_inlines_hh
+#define PPL_DB_Matrix_inlines_hh 1
+
+#include "globals_defs.hh"
+#include "Checked_Number_defs.hh"
+#include "distances_defs.hh"
+#include "assert.hh"
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline void
+DB_Matrix<T>::m_swap(DB_Matrix& y) {
+  using std::swap;
+  swap(rows, y.rows);
+  swap(row_size, y.row_size);
+  swap(row_capacity, y.row_capacity);
+}
+
+template <typename T>
+inline dimension_type
+DB_Matrix<T>::max_num_rows() {
+  return std::vector<DB_Row<T> >().max_size();
+}
+
+template <typename T>
+inline dimension_type
+DB_Matrix<T>::max_num_columns() {
+  return DB_Row<T>::max_size();
+}
+
+template <typename T>
+inline memory_size_type
+DB_Matrix<T>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename T>
+inline
+DB_Matrix<T>::const_iterator::const_iterator()
+  : i(Iter()) {
+}
+
+template <typename T>
+inline
+DB_Matrix<T>::const_iterator::const_iterator(const Iter& b)
+  : i(b) {
+}
+
+template <typename T>
+inline
+DB_Matrix<T>::const_iterator::const_iterator(const const_iterator& y)
+  : i(y.i) {
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator&
+DB_Matrix<T>::const_iterator::operator=(const const_iterator& y) {
+  i = y.i;
+  return *this;
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator::reference
+DB_Matrix<T>::const_iterator::operator*() const {
+  return *i;
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator::pointer
+DB_Matrix<T>::const_iterator::operator->() const {
+  return &*i;
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator&
+DB_Matrix<T>::const_iterator::operator++() {
+  ++i;
+  return *this;
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator
+DB_Matrix<T>::const_iterator::operator++(int) {
+  return const_iterator(i++);
+}
+
+template <typename T>
+inline bool
+DB_Matrix<T>::const_iterator::operator==(const const_iterator& y) const {
+  return i == y.i;
+}
+
+template <typename T>
+inline bool
+DB_Matrix<T>::const_iterator::operator!=(const const_iterator& y) const {
+  return !operator==(y);
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator
+DB_Matrix<T>::begin() const {
+  return const_iterator(rows.begin());
+}
+
+template <typename T>
+inline typename DB_Matrix<T>::const_iterator
+DB_Matrix<T>::end() const {
+  return const_iterator(rows.end());
+}
+
+template <typename T>
+inline
+DB_Matrix<T>::DB_Matrix()
+  : rows(),
+    row_size(0),
+    row_capacity(0) {
+}
+
+template <typename T>
+inline
+DB_Matrix<T>::~DB_Matrix() {
+}
+
+template <typename T>
+inline DB_Row<T>&
+DB_Matrix<T>::operator[](const dimension_type k) {
+  PPL_ASSERT(k < rows.size());
+  return rows[k];
+}
+
+template <typename T>
+inline const DB_Row<T>&
+DB_Matrix<T>::operator[](const dimension_type k) const {
+  PPL_ASSERT(k < rows.size());
+  return rows[k];
+}
+
+template <typename T>
+inline dimension_type
+DB_Matrix<T>::num_rows() const {
+  return rows.size();
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+inline bool
+operator!=(const DB_Matrix<T>& x, const DB_Matrix<T>& y) {
+  return !(x == y);
+}
+
+template <typename T>
+inline
+DB_Matrix<T>::DB_Matrix(const DB_Matrix& y)
+  : rows(y.rows),
+    row_size(y.row_size),
+    row_capacity(compute_capacity(y.row_size, max_num_columns())) {
+}
+
+template <typename T>
+inline DB_Matrix<T>&
+DB_Matrix<T>::operator=(const DB_Matrix& y) {
+  // Without the following guard against auto-assignments we would
+  // recompute the row capacity based on row size, possibly without
+  // actually increasing the capacity of the rows.  This would lead to
+  // an inconsistent state.
+  if (this != &y) {
+    // The following assignment may do nothing on auto-assignments...
+    rows = y.rows;
+    row_size = y.row_size;
+    // ... hence the following assignment must not be done on
+    // auto-assignments.
+    row_capacity = compute_capacity(y.row_size, max_num_columns());
+  }
+  return *this;
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Specialization, typename Temp, typename To, typename T>
+inline bool
+l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                    const DB_Matrix<T>& x,
+                    const DB_Matrix<T>& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0,
+                    Temp& tmp1,
+                    Temp& tmp2) {
+  const dimension_type x_num_rows = x.num_rows();
+  if (x_num_rows != y.num_rows())
+    return false;
+  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
+  for (dimension_type i = x_num_rows; i-- > 0; ) {
+    const DB_Row<T>& x_i = x[i];
+    const DB_Row<T>& y_i = y[i];
+    for (dimension_type j = x_num_rows; j-- > 0; ) {
+      const T& x_i_j = x_i[j];
+      const T& y_i_j = y_i[j];
+      if (is_plus_infinity(x_i_j)) {
+        if (is_plus_infinity(y_i_j))
+          continue;
+        else {
+        pinf:
+          assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+          return true;
+        }
+      }
+      else if (is_plus_infinity(y_i_j))
+        goto pinf;
+
+      const Temp* tmp1p;
+      const Temp* tmp2p;
+      if (x_i_j > y_i_j) {
+        maybe_assign(tmp1p, tmp1, x_i_j, dir);
+        maybe_assign(tmp2p, tmp2, y_i_j, inverse(dir));
+      }
+      else {
+        maybe_assign(tmp1p, tmp1, y_i_j, dir);
+        maybe_assign(tmp2p, tmp2, x_i_j, inverse(dir));
+      }
+      sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
+      PPL_ASSERT(sgn(tmp1) >= 0);
+      Specialization::combine(tmp0, tmp1, dir);
+    }
+  }
+  Specialization::finalize(tmp0, dir);
+  assign_r(r, tmp0, dir);
+  return true;
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const DB_Matrix<T>& x,
+                            const DB_Matrix<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
+  return
+    l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >(r, x, y,
+                                                                    dir,
+                                                                    tmp0,
+                                                                    tmp1,
+                                                                    tmp2);
+}
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const DB_Matrix<T>& x,
+                          const DB_Matrix<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
+  return
+    l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >(r, x, y,
+                                                                  dir,
+                                                                  tmp0,
+                                                                  tmp1,
+                                                                  tmp2);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const DB_Matrix<T>& x,
+                           const DB_Matrix<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
+  return
+    l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >(r, x, y,
+                                                                   dir,
+                                                                   tmp0,
+                                                                   tmp1,
+                                                                   tmp2);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+inline void
+swap(DB_Matrix<T>& x, DB_Matrix<T>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_DB_Matrix_inlines_hh)
diff --git a/src/DB_Matrix_templates.hh b/src/DB_Matrix_templates.hh
new file mode 100644
index 0000000..6fba4e1
--- /dev/null
+++ b/src/DB_Matrix_templates.hh
@@ -0,0 +1,319 @@
+/* DB_Matrix class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_DB_Matrix_templates_hh
+#define PPL_DB_Matrix_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+DB_Matrix<T>::DB_Matrix(const dimension_type n_rows)
+  : rows(n_rows),
+    row_size(n_rows),
+    row_capacity(compute_capacity(n_rows, max_num_columns())) {
+  // Construct in direct order: will destroy in reverse order.
+  for (dimension_type i = 0; i < n_rows; ++i)
+    rows[i].construct(n_rows, row_capacity);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename U>
+DB_Matrix<T>::DB_Matrix(const DB_Matrix<U>& y)
+  : rows(y.rows.size()),
+    row_size(y.row_size),
+    row_capacity(compute_capacity(y.row_size, max_num_columns())) {
+  // Construct in direct order: will destroy in reverse order.
+  for (dimension_type i = 0, n_rows = rows.size(); i < n_rows; ++i)
+    rows[i].construct_upward_approximation(y[i], row_capacity);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+DB_Matrix<T>::grow(const dimension_type new_n_rows) {
+  const dimension_type old_n_rows = rows.size();
+  PPL_ASSERT(new_n_rows >= old_n_rows);
+
+  if (new_n_rows > old_n_rows) {
+    if (new_n_rows <= row_capacity) {
+      // We can recycle the old rows.
+      if (rows.capacity() < new_n_rows) {
+        // Reallocation will take place.
+        std::vector<DB_Row<T> > new_rows;
+        new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
+        new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
+        // Construct the new rows.
+        dimension_type i = new_n_rows;
+        while (i-- > old_n_rows)
+          new_rows[i].construct(new_n_rows, row_capacity);
+        // Steal the old rows.
+        ++i;
+        while (i-- > 0)
+          swap(new_rows[i], rows[i]);
+        // Put the new vector into place.
+        using std::swap;
+        swap(rows, new_rows);
+      }
+      else {
+        // Reallocation will NOT take place.
+        rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
+        for (dimension_type i = new_n_rows; i-- > old_n_rows; )
+          rows[i].construct(new_n_rows, row_capacity);
+      }
+    }
+    else {
+      // We cannot even recycle the old rows.
+      DB_Matrix new_matrix;
+      new_matrix.rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
+      new_matrix.rows.insert(new_matrix.rows.end(), new_n_rows, DB_Row<T>());
+      // Construct the new rows.
+      new_matrix.row_size = new_n_rows;
+      new_matrix.row_capacity = compute_capacity(new_n_rows,
+                                                 max_num_columns());
+      dimension_type i = new_n_rows;
+      while (i-- > old_n_rows)
+        new_matrix.rows[i].construct(new_matrix.row_size,
+                                     new_matrix.row_capacity);
+      // Copy the old rows.
+      ++i;
+      while (i-- > 0) {
+        // FIXME: copying may be unnecessarily costly.
+        DB_Row<T> new_row(rows[i],
+                          new_matrix.row_size,
+                          new_matrix.row_capacity);
+        swap(new_matrix.rows[i], new_row);
+      }
+      // Put the new vector into place.
+      m_swap(new_matrix);
+      return;
+    }
+  }
+  // Here we have the right number of rows.
+  if (new_n_rows > row_size) {
+    // We need more columns.
+    if (new_n_rows <= row_capacity)
+      // But we have enough capacity: we resize existing rows.
+      for (dimension_type i = old_n_rows; i-- > 0; )
+        rows[i].expand_within_capacity(new_n_rows);
+    else {
+      // Capacity exhausted: we must reallocate the rows and
+      // make sure all the rows have the same capacity.
+      const dimension_type new_row_capacity
+        = compute_capacity(new_n_rows, max_num_columns());
+      for (dimension_type i = old_n_rows; i-- > 0; ) {
+        // FIXME: copying may be unnecessarily costly.
+        DB_Row<T> new_row(rows[i], new_n_rows, new_row_capacity);
+        swap(rows[i], new_row);
+      }
+      row_capacity = new_row_capacity;
+    }
+    // Rows have grown or shrunk.
+    row_size = new_n_rows;
+  }
+}
+
+template <typename T>
+void
+DB_Matrix<T>::resize_no_copy(const dimension_type new_n_rows) {
+  dimension_type old_n_rows = rows.size();
+
+  if (new_n_rows > old_n_rows) {
+    // Rows will be inserted.
+    if (new_n_rows <= row_capacity) {
+      // We can recycle the old rows.
+      if (rows.capacity() < new_n_rows) {
+        // Reallocation (of vector `rows') will take place.
+        std::vector<DB_Row<T> > new_rows;
+        new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
+        new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
+        // Construct the new rows (be careful: each new row must have
+        // the same capacity as each one of the old rows).
+        dimension_type i = new_n_rows;
+        while (i-- > old_n_rows)
+          new_rows[i].construct(new_n_rows, row_capacity);
+        // Steal the old rows.
+        ++i;
+        while (i-- > 0)
+          swap(new_rows[i], rows[i]);
+        // Put the new vector into place.
+        using std::swap;
+        swap(rows, new_rows);
+      }
+      else {
+        // Reallocation (of vector `rows') will NOT take place.
+        rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
+        // Be careful: each new row must have
+        // the same capacity as each one of the old rows.
+        for (dimension_type i = new_n_rows; i-- > old_n_rows; )
+          rows[i].construct(new_n_rows, row_capacity);
+      }
+    }
+    else {
+      // We cannot even recycle the old rows: allocate a new matrix and swap.
+      DB_Matrix new_matrix(new_n_rows);
+      m_swap(new_matrix);
+      return;
+    }
+  }
+  else if (new_n_rows < old_n_rows) {
+    // Drop some rows.
+    rows.resize(new_n_rows);
+    // Shrink the existing rows.
+    for (dimension_type i = new_n_rows; i-- > 0; )
+      rows[i].shrink(new_n_rows);
+    old_n_rows = new_n_rows;
+  }
+  // Here we have the right number of rows.
+  if (new_n_rows > row_size) {
+    // We need more columns.
+    if (new_n_rows <= row_capacity)
+      // But we have enough capacity: we resize existing rows.
+      for (dimension_type i = old_n_rows; i-- > 0; )
+        rows[i].expand_within_capacity(new_n_rows);
+    else {
+      // Capacity exhausted: we must reallocate the rows and
+      // make sure all the rows have the same capacity.
+      const dimension_type new_row_capacity
+        = compute_capacity(new_n_rows, max_num_columns());
+      for (dimension_type i = old_n_rows; i-- > 0; ) {
+        DB_Row<T> new_row(new_n_rows, new_row_capacity);
+        swap(rows[i], new_row);
+      }
+      row_capacity = new_row_capacity;
+    }
+  }
+  // DB_Rows have grown or shrunk.
+  row_size = new_n_rows;
+}
+
+template <typename T>
+void
+DB_Matrix<T>::ascii_dump(std::ostream& s) const {
+  const DB_Matrix<T>& x = *this;
+  const char separator = ' ';
+  const dimension_type nrows = x.num_rows();
+  s << nrows << separator << "\n";
+  for (dimension_type i = 0; i < nrows;  ++i) {
+    for (dimension_type j = 0; j < nrows; ++j) {
+      using namespace IO_Operators;
+      s << x[i][j] << separator;
+    }
+    s << "\n";
+  }
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, DB_Matrix<T>)
+
+template <typename T>
+bool
+DB_Matrix<T>::ascii_load(std::istream& s) {
+  dimension_type nrows;
+  if (!(s >> nrows))
+    return false;
+  resize_no_copy(nrows);
+  DB_Matrix& x = *this;
+  for (dimension_type i = 0; i < nrows;  ++i)
+    for (dimension_type j = 0; j < nrows; ++j) {
+      Result r = input(x[i][j], s, ROUND_CHECK);
+      if (result_relation(r) != VR_EQ || is_minus_infinity(x[i][j]))
+        return false;
+    }
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+bool
+operator==(const DB_Matrix<T>& x, const DB_Matrix<T>& y) {
+  const dimension_type x_num_rows = x.num_rows();
+  if (x_num_rows != y.num_rows())
+    return false;
+  for (dimension_type i = x_num_rows; i-- > 0; )
+    if (x[i] != y[i])
+      return false;
+  return true;
+}
+
+template <typename T>
+memory_size_type
+DB_Matrix<T>::external_memory_in_bytes() const {
+  memory_size_type n = rows.capacity() * sizeof(DB_Row<T>);
+  for (dimension_type i = num_rows(); i-- > 0; )
+    n += rows[i].external_memory_in_bytes(row_capacity);
+  return n;
+}
+
+template <typename T>
+bool
+DB_Matrix<T>::OK() const {
+#ifndef NDEBUG
+  using std::endl;
+  using std::cerr;
+#endif
+
+  // The matrix must be square.
+  if (num_rows() != row_size) {
+#ifndef NDEBUG
+    cerr << "DB_Matrix has fewer columns than rows:\n"
+         << "row_size is " << row_size
+         << ", num_rows() is " << num_rows() << "!"
+         << endl;
+#endif
+    return false;
+  }
+
+  const DB_Matrix& x = *this;
+  const dimension_type n_rows = x.num_rows();
+  for (dimension_type i = 0; i < n_rows; ++i) {
+    if (!x[i].OK(row_size, row_capacity))
+      return false;
+  }
+
+  // All checks passed.
+  return true;
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Parma_Polyhedra_Library::DB_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+std::ostream&
+IO_Operators::operator<<(std::ostream& s, const DB_Matrix<T>& c) {
+  const dimension_type n = c.num_rows();
+  for (dimension_type i = 0; i < n; ++i) {
+    for (dimension_type j = 0; j < n; ++j)
+      s << c[i][j] << " ";
+    s << "\n";
+  }
+  return s;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_DB_Matrix_templates_hh)
diff --git a/src/DB_Matrix_types.hh b/src/DB_Matrix_types.hh
new file mode 100644
index 0000000..afc4e2a
--- /dev/null
+++ b/src/DB_Matrix_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_DB_Matrix_types_hh
+#define PPL_DB_Matrix_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class DB_Matrix;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_DB_Matrix_types_hh)
diff --git a/src/DB_Row.defs.hh b/src/DB_Row.defs.hh
deleted file mode 100644
index d5002a3..0000000
--- a/src/DB_Row.defs.hh
+++ /dev/null
@@ -1,470 +0,0 @@
-/* DB_Row class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_DB_Row_defs_hh
-#define PPL_DB_Row_defs_hh 1
-
-#include "DB_Row.types.hh"
-#include "globals.types.hh"
-#include "Ptr_Iterator.defs.hh"
-#include <cstddef>
-#include <vector>
-
-#ifndef PPL_DB_ROW_EXTRA_DEBUG
-#ifdef PPL_ABI_BREAKING_EXTRA_DEBUG
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  When PPL_DB_ROW_EXTRA_DEBUG evaluates to <CODE>true</CODE>, each instance
-  of the class DB_Row carries its own capacity; this enables extra
-  consistency checks to be performed.
-  \ingroup PPL_CXX_interface
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define PPL_DB_ROW_EXTRA_DEBUG 1
-#else // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
-#define PPL_DB_ROW_EXTRA_DEBUG 0
-#endif // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
-#endif // !defined(PPL_DB_ROW_EXTRA_DEBUG)
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The handler of the actual DB_Row implementation.
-/*! \ingroup PPL_CXX_interface
-  Exception-safety is the only responsibility of this class: it has
-  to ensure that its \p impl member is correctly deallocated.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Parma_Polyhedra_Library::DB_Row_Impl_Handler {
-public:
-  //! Default constructor.
-  DB_Row_Impl_Handler();
-
-  //! Destructor.
-  ~DB_Row_Impl_Handler();
-
-  class Impl;
-
-  //! A pointer to the actual implementation.
-  Impl* impl;
-
-#if PPL_DB_ROW_EXTRA_DEBUG
-  //! The capacity of \p impl (only available during debugging).
-  dimension_type capacity_;
-#endif // PPL_DB_ROW_EXTRA_DEBUG
-
-private:
-  //! Private and unimplemented: copy construction is not allowed.
-  DB_Row_Impl_Handler(const DB_Row_Impl_Handler&);
-
-  //! Private and unimplemented: copy assignment is not allowed.
-  DB_Row_Impl_Handler& operator=(const DB_Row_Impl_Handler&);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The base class for the single rows of matrices.
-/*! \ingroup PPL_CXX_interface
-  The class template DB_Row<T> allows for the efficient representation of
-  the single rows of a DB_Matrix. It contains elements of type T stored
-  as a vector. The class T is a family of extended numbers that
-  must provide representation for
-  \f$ -\infty \f$, \f$0\f$,\f$ +\infty \f$ (and, consequently for <EM>nan</EM>,
-  <EM>not a number</EM>, since this arises as the ``result'' of
-  undefined sums like \f$ +\infty + (-\infty) \f$).
-
-  The class T must provide the following methods:
-
-  \code
-    T()
-  \endcode
-  is the default constructor: no assumption is made on the particular
-  object constructed, provided <CODE>T().OK()</CODE> gives <CODE>true</CODE>
-  (see below).
-  \code
-    ~T()
-  \endcode
-  is the destructor.
-  \code
-    bool is_nan() const
-  \endcode
-  returns <CODE>true</CODE> if and only \p *this represents
-  the  <EM>not a number</EM> value.
-  \code
-    bool OK() const
-  \endcode
-  returns <CODE>true</CODE> if and only if \p *this satisfies all
-  its invariants.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Parma_Polyhedra_Library::DB_Row : private DB_Row_Impl_Handler<T> {
-public:
-  //! Pre-constructs a row: construction must be completed by construct().
-  DB_Row();
-
-  //! \name Post-constructors.
-  //@{
-  //! Constructs properly a default-constructed element.
-  /*!
-    Builds a row with size \p sz and minimum capacity.
-  */
-  void construct(dimension_type sz);
-
-  //! Constructs properly a default-constructed element.
-  /*!
-    \param sz
-    The size of the row that will be constructed.
-
-    \param capacity
-    The minimum capacity of the row that will be constructed.
-
-    The row that we are constructing has a minimum capacity of
-    (i.e., it can contain at least) \p elements, \p sz of which
-    will be constructed now.
-  */
-  void construct(dimension_type sz, dimension_type capacity);
-
-  //! Constructs properly a conservative approximation of \p y.
-  /*!
-    \param y
-    A row containing the elements whose upward approximations will
-    be used to properly construct \p *this.
-
-    \param capacity
-    The capacity of the constructed row.
-
-    It is assumed that \p capacity is greater than or equal to the
-    size of \p y.
-  */
-  template <typename U>
-  void construct_upward_approximation(const DB_Row<U>& y,
-				      dimension_type capacity);
-
-  //@}
-
-  //! Tight constructor: resizing will require reallocation.
-  DB_Row(dimension_type sz);
-
-  //! Sizing constructor with capacity.
-  DB_Row(dimension_type sz, dimension_type capacity);
-
-  //! Ordinary copy constructor.
-  DB_Row(const DB_Row& y);
-
-  //! Copy constructor with specified capacity.
-  /*!
-    It is assumed that \p capacity is greater than or equal to \p y size.
-  */
-  DB_Row(const DB_Row& y, dimension_type capacity);
-
-  //! Copy constructor with specified size and capacity.
-  /*!
-    It is assumed that \p sz is greater than or equal to the size of \p y
-    and, of course, that \p sz is less than or equal to \p capacity.
-    Any new position is initialized to \f$+\infty\f$.
-  */
-  DB_Row(const DB_Row& y, dimension_type sz, dimension_type capacity);
-
-  //! Destructor.
-  ~DB_Row();
-
-  //! Assignment operator.
-  DB_Row& operator=(const DB_Row& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(DB_Row& y);
-
-  //! Assigns the implementation of \p y to \p *this.
-  void assign(DB_Row& y);
-
-  /*! \brief
-    Allocates memory for a default constructed DB_Row object,
-    allowing for \p capacity coefficients at most.
-
-    It is assumed that no allocation has been performed before
-    (otherwise, a memory leak will occur).
-    After execution, the size of the DB_Row object is zero.
-  */
-  void allocate(dimension_type capacity);
-
-  //! Expands the row to size \p new_size.
-  /*!
-    Adds new positions to the implementation of the row
-    obtaining a new row with size \p new_size.
-    It is assumed that \p new_size is between the current size
-    and capacity of the row. The new positions are initialized
-    to \f$+\infty\f$.
-  */
-  void expand_within_capacity(dimension_type new_size);
-
-  //! Shrinks the row by erasing elements at the end.
-  /*!
-    Destroys elements of the row implementation
-    from position \p new_size to the end.
-    It is assumed that \p new_size is not greater than the current size.
-  */
-  void shrink(dimension_type new_size);
-
-  //! Returns the size() of the largest possible DB_Row.
-  static dimension_type max_size();
-
-  //! Gives the number of coefficients currently in use.
-  dimension_type size() const;
-
-  //! \name Subscript operators.
-  //@{
-  //! Returns a reference to the element of the row indexed by \p k.
-  T& operator[](dimension_type k);
-
-  //! Returns a constant reference to the element of the row indexed by \p k.
-  const T& operator[](dimension_type k) const;
-  //@}
-
-  //! A (non const) random access iterator to access the row's elements.
-  typedef Implementation::Ptr_Iterator<T*> iterator;
-
-  //! A const random access iterator to access the row's elements.
-  typedef Implementation::Ptr_Iterator<const T*> const_iterator;
-
-  /*! \brief
-    Returns the const iterator pointing to the first element,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const iterator.
-  */
-  iterator begin();
-
-  //! Returns the past-the-end iterator.
-  iterator end();
-
-  /*! \brief
-    Returns the const iterator pointing to the first element,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const iterator.
-  const_iterator end() const;
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a lower bound to the size in bytes of the memory
-    managed by \p *this.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns the total size in bytes of the memory occupied by \p *this,
-    provided the capacity of \p *this is given by \p capacity.
-  */
-  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
-
-  /*! \brief
-    Returns the size in bytes of the memory managed by \p *this,
-    provided the capacity of \p *this is given by \p capacity.
-  */
-  memory_size_type external_memory_in_bytes(dimension_type capacity) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK(dimension_type row_size, dimension_type row_capacity) const;
-
-private:
-  template <typename U> friend class Parma_Polyhedra_Library::DB_Row;
-
-  //! Exception-safe copy construction mechanism for coefficients.
-  void copy_construct_coefficients(const DB_Row& y);
-
-#if PPL_DB_ROW_EXTRA_DEBUG
-  //! Returns the capacity of the row (only available during debugging).
-  dimension_type capacity() const;
-#endif // PPL_DB_ROW_EXTRA_DEBUG
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates DB_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-void swap(DB_Row<T>& x, DB_Row<T>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps objects referred by \p x and \p y.
-/*! \relates DB_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-void iter_swap(typename std::vector<DB_Row<T> >::iterator x,
-	       typename std::vector<DB_Row<T> >::iterator y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! \name Classical comparison operators.
-//@{
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-/*! \relates DB_Row */
-template <typename T>
-bool operator==(const DB_Row<T>& x, const DB_Row<T>& y);
-
-/*! \relates DB_Row */
-template <typename T>
-bool operator!=(const DB_Row<T>& x, const DB_Row<T>& y);
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//@}
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-} // namespace Parma_Polyhedra_Library
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The real implementation of a DB_Row object.
-/*! \ingroup PPL_CXX_interface
-  The class DB_Row_Impl_Handler::Impl provides the implementation of
-  DB_Row objects and, in particular, of the corresponding memory
-  allocation functions.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Parma_Polyhedra_Library::DB_Row_Impl_Handler<T>::Impl {
-public:
-  //! \name Custom allocator and deallocator.
-  //@{
-
-  /*! \brief
-    Allocates a chunk of memory able to contain \p capacity T objects
-    beyond the specified \p fixed_size and returns a pointer to the new
-    allocated memory.
-  */
-  static void* operator new(size_t fixed_size, dimension_type capacity);
-
-  //! Uses the standard delete operator to free the memory \p p points to.
-  static void operator delete(void* p);
-
-  /*! \brief
-    Placement version: uses the standard operator delete to free
-    the memory \p p points to.
-  */
-  static void operator delete(void* p, dimension_type capacity);
-  //@}
-
-  //! Default constructor.
-  Impl();
-
-  //! Destructor.
-  /*!
-    Uses <CODE>shrink()</CODE> method with argument \f$0\f$
-    to delete all the row elements.
-  */
-  ~Impl();
-
-  //! Expands the row to size \p new_size.
-  /*!
-    It is assumed that \p new_size is between the current size and capacity.
-  */
-  void expand_within_capacity(dimension_type new_size);
-
-  //! Shrinks the row by erasing elements at the end.
-  /*!
-    It is assumed that \p new_size is not greater than the current size.
-  */
-  void shrink(dimension_type new_size);
-
-  //! Exception-safe copy construction mechanism for coefficients.
-  void copy_construct_coefficients(const Impl& y);
-
-  /*! \brief
-    Exception-safe upward approximation construction mechanism
-    for coefficients.
-  */
-  template <typename U>
-  void construct_upward_approximation(const U& y);
-
-  //! Returns the size() of the largest possible Impl.
-  static dimension_type max_size();
-
-  //! \name Size accessors.
-  //@{
-  //! Returns the actual size of \p this.
-  dimension_type size() const;
-
-  //! Sets to \p new_sz the actual size of \p *this.
-  void set_size(dimension_type new_sz);
-
-  //! Increments the size of \p *this by 1.
-  void bump_size();
-  //@}
-
-  //! \name Subscript operators.
-  //@{
-  //! Returns a reference to the element of \p *this indexed by \p k.
-  T& operator[](dimension_type k);
-
-  //! Returns a constant reference to the element of \p *this indexed by \p k.
-  const T& operator[](dimension_type k) const;
-  //@}
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-private:
-  friend class DB_Row<T>;
-
-  //! The number of coefficients in the row.
-  dimension_type size_;
-
-  //! The vector of coefficients.
-  T vec_[
-#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-         0
-#else
-         1
-#endif
-  ];
-
-  //! Private and unimplemented: copy construction is not allowed.
-  Impl(const Impl& y);
-
-  //! Private and unimplemented: assignment is not allowed.
-  Impl& operator=(const Impl&);
-
-  //! Exception-safe copy construction mechanism.
-  void copy_construct(const Impl& y);
-};
-
-#include "DB_Row.inlines.hh"
-#include "DB_Row.templates.hh"
-
-#endif // !defined(PPL_DB_Row_defs_hh)
diff --git a/src/DB_Row.inlines.hh b/src/DB_Row.inlines.hh
deleted file mode 100644
index 5522dad..0000000
--- a/src/DB_Row.inlines.hh
+++ /dev/null
@@ -1,428 +0,0 @@
-/* DB_Row class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_DB_Row_inlines_hh
-#define PPL_DB_Row_inlines_hh 1
-
-#include "checked.defs.hh"
-#include "assert.hh"
-#include <cstddef>
-#include <limits>
-#include <algorithm>
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline void*
-DB_Row_Impl_Handler<T>::Impl::operator new(const size_t fixed_size,
-					   const dimension_type capacity) {
-#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  return ::operator new(fixed_size + capacity*sizeof(T));
-#else
-  PPL_ASSERT(capacity >= 1);
-  return ::operator new(fixed_size + (capacity-1)*sizeof(T));
-#endif
-}
-
-template <typename T>
-inline void
-DB_Row_Impl_Handler<T>::Impl::operator delete(void* p) {
-  ::operator delete(p);
-}
-
-template <typename T>
-inline void
-DB_Row_Impl_Handler<T>::Impl::operator delete(void* p, dimension_type) {
-  ::operator delete(p);
-}
-
-template <typename T>
-inline memory_size_type
-DB_Row_Impl_Handler<T>::Impl
-::total_memory_in_bytes(dimension_type capacity) const {
-  return
-    sizeof(*this)
-    + capacity*sizeof(T)
-#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-    - 1*sizeof(T)
-#endif
-    + external_memory_in_bytes();
-}
-
-template <typename T>
-inline memory_size_type
-DB_Row_Impl_Handler<T>::Impl::total_memory_in_bytes() const {
-  // In general, this is a lower bound, as the capacity of *this
-  // may be strictly greater than `size_'
-  return total_memory_in_bytes(size_);
-}
-
-template <typename T>
-inline dimension_type
-DB_Row_Impl_Handler<T>::Impl::max_size() {
-  return std::numeric_limits<size_t>::max() / sizeof(T);
-}
-
-template <typename T>
-inline dimension_type
-DB_Row_Impl_Handler<T>::Impl::size() const {
-  return size_;
-}
-
-template <typename T>
-inline void
-DB_Row_Impl_Handler<T>::Impl::set_size(const dimension_type new_sz) {
-  size_ = new_sz;
-}
-
-template <typename T>
-inline void
-DB_Row_Impl_Handler<T>::Impl::bump_size() {
-  ++size_;
-}
-
-template <typename T>
-inline
-DB_Row_Impl_Handler<T>::Impl::Impl()
-  : size_(0) {
-}
-
-template <typename T>
-inline
-DB_Row_Impl_Handler<T>::Impl::~Impl() {
-  shrink(0);
-}
-
-template <typename T>
-inline
-DB_Row_Impl_Handler<T>::DB_Row_Impl_Handler()
-  : impl(0) {
-#if PPL_DB_ROW_EXTRA_DEBUG
-  capacity_ = 0;
-#endif
-}
-
-template <typename T>
-inline
-DB_Row_Impl_Handler<T>::~DB_Row_Impl_Handler() {
-  delete impl;
-}
-
-template <typename T>
-inline T&
-DB_Row_Impl_Handler<T>::Impl::operator[](const dimension_type k) {
-  PPL_ASSERT(k < size());
-  return vec_[k];
-}
-
-template <typename T>
-inline const T&
-DB_Row_Impl_Handler<T>::Impl::operator[](const dimension_type k) const {
-  PPL_ASSERT(k < size());
-  return vec_[k];
-}
-
-template <typename T>
-inline dimension_type
-DB_Row<T>::max_size() {
-  return DB_Row_Impl_Handler<T>::Impl::max_size();
-}
-
-template <typename T>
-inline dimension_type
-DB_Row<T>::size() const {
-  return this->impl->size();
-}
-
-#if PPL_DB_ROW_EXTRA_DEBUG
-template <typename T>
-inline dimension_type
-DB_Row<T>::capacity() const {
-  return this->capacity_;
-}
-#endif // PPL_DB_ROW_EXTRA_DEBUG
-
-template <typename T>
-inline
-DB_Row<T>::DB_Row()
-  : DB_Row_Impl_Handler<T>() {
-}
-
-template <typename T>
-inline void
-DB_Row<T>::allocate(
-#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-	       const
-#endif
-	       dimension_type capacity) {
-  DB_Row<T>& x = *this;
-  PPL_ASSERT(capacity <= max_size());
-#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  if (capacity == 0)
-    ++capacity;
-#endif
-  PPL_ASSERT(x.impl == 0);
-  x.impl = new (capacity) typename DB_Row_Impl_Handler<T>::Impl();
-#if PPL_DB_ROW_EXTRA_DEBUG
-  PPL_ASSERT(x.capacity_ == 0);
-  x.capacity_ = capacity;
-#endif
-}
-
-template <typename T>
-inline void
-DB_Row<T>::expand_within_capacity(const dimension_type new_size) {
-  DB_Row<T>& x = *this;
-  PPL_ASSERT(x.impl);
-#if PPL_DB_ROW_EXTRA_DEBUG
-  PPL_ASSERT(new_size <= x.capacity_);
-#endif
-  x.impl->expand_within_capacity(new_size);
-}
-
-template <typename T>
-inline void
-DB_Row<T>::copy_construct_coefficients(const DB_Row& y) {
-  DB_Row<T>& x = *this;
-  PPL_ASSERT(x.impl && y.impl);
-#if PPL_DB_ROW_EXTRA_DEBUG
-  PPL_ASSERT(y.size() <= x.capacity_);
-#endif
-  x.impl->copy_construct_coefficients(*(y.impl));
-}
-
-template <typename T>
-template <typename U>
-inline void
-DB_Row<T>::construct_upward_approximation(const DB_Row<U>& y,
-					  const dimension_type capacity) {
-  DB_Row<T>& x = *this;
-  PPL_ASSERT(y.size() <= capacity && capacity <= max_size());
-  allocate(capacity);
-  PPL_ASSERT(y.impl);
-  x.impl->construct_upward_approximation(*(y.impl));
-}
-
-template <typename T>
-inline void
-DB_Row<T>::construct(const dimension_type sz,
-		     const dimension_type capacity) {
-  PPL_ASSERT(sz <= capacity && capacity <= max_size());
-  allocate(capacity);
-  expand_within_capacity(sz);
-}
-
-template <typename T>
-inline void
-DB_Row<T>::construct(const dimension_type sz) {
-  construct(sz, sz);
-}
-
-template <typename T>
-inline
-DB_Row<T>::DB_Row(const dimension_type sz,
-		  const dimension_type capacity)
-  : DB_Row_Impl_Handler<T>() {
-  construct(sz, capacity);
-}
-
-template <typename T>
-inline
-DB_Row<T>::DB_Row(const dimension_type sz) {
-  construct(sz);
-}
-
-template <typename T>
-inline
-DB_Row<T>::DB_Row(const DB_Row& y)
-  : DB_Row_Impl_Handler<T>() {
-  if (y.impl != 0) {
-    allocate(compute_capacity(y.size(), max_size()));
-    copy_construct_coefficients(y);
-  }
-}
-
-template <typename T>
-inline
-DB_Row<T>::DB_Row(const DB_Row& y,
-		  const	dimension_type capacity)
-  : DB_Row_Impl_Handler<T>() {
-  PPL_ASSERT(y.impl);
-  PPL_ASSERT(y.size() <= capacity && capacity <= max_size());
-  allocate(capacity);
-  copy_construct_coefficients(y);
-}
-
-template <typename T>
-inline
-DB_Row<T>::DB_Row(const DB_Row& y,
-		  const dimension_type sz,
-		  const	dimension_type capacity)
-  : DB_Row_Impl_Handler<T>() {
-  PPL_ASSERT(y.impl);
-  PPL_ASSERT(y.size() <= sz && sz <= capacity && capacity <= max_size());
-  allocate(capacity);
-  copy_construct_coefficients(y);
-  expand_within_capacity(sz);
-}
-
-template <typename T>
-inline
-DB_Row<T>::~DB_Row() {
-}
-
-template <typename T>
-inline void
-DB_Row<T>::shrink(const dimension_type new_size) {
-  DB_Row<T>& x = *this;
-  PPL_ASSERT(x.impl);
-  x.impl->shrink(new_size);
-}
-
-template <typename T>
-inline void
-DB_Row<T>::m_swap(DB_Row& y) {
-  using std::swap;
-  DB_Row<T>& x = *this;
-  swap(x.impl, y.impl);
-#if PPL_DB_ROW_EXTRA_DEBUG
-  swap(x.capacity_, y.capacity_);
-#endif
-}
-
-template <typename T>
-inline void
-DB_Row<T>::assign(DB_Row& y) {
-  DB_Row<T>& x = *this;
-  x.impl = y.impl;
-#if PPL_DB_ROW_EXTRA_DEBUG
-  x.capacity_ = y.capacity_;
-#endif
-}
-
-template <typename T>
-inline DB_Row<T>&
-DB_Row<T>::operator=(const DB_Row& y) {
-  DB_Row tmp(y);
-  m_swap(tmp);
-  return *this;
-}
-
-template <typename T>
-inline T&
-DB_Row<T>::operator[](const dimension_type k) {
-  DB_Row<T>& x = *this;
-  return (*x.impl)[k];
-}
-
-template <typename T>
-inline const T&
-DB_Row<T>::operator[](const dimension_type k) const {
-  const DB_Row<T>& x = *this;
-  return (*x.impl)[k];
-}
-
-template <typename T>
-inline typename DB_Row<T>::iterator
-DB_Row<T>::begin() {
-  DB_Row<T>& x = *this;
-  return iterator(x.impl->vec_);
-}
-
-template <typename T>
-inline typename DB_Row<T>::iterator
-DB_Row<T>::end() {
-  DB_Row<T>& x = *this;
-  return iterator(x.impl->vec_ + x.impl->size_);
-}
-
-template <typename T>
-inline typename DB_Row<T>::const_iterator
-DB_Row<T>::begin() const {
-  const DB_Row<T>& x = *this;
-  return const_iterator(x.impl->vec_);
-}
-
-template <typename T>
-inline typename DB_Row<T>::const_iterator
-DB_Row<T>::end() const {
-  const DB_Row<T>& x = *this;
-  return const_iterator(x.impl->vec_ + x.impl->size_);
-}
-
-template <typename T>
-inline memory_size_type
-DB_Row<T>::external_memory_in_bytes(dimension_type capacity) const {
-  const DB_Row<T>& x = *this;
-  return x.impl->total_memory_in_bytes(capacity);
-}
-
-template <typename T>
-inline memory_size_type
-DB_Row<T>::total_memory_in_bytes(dimension_type capacity) const {
-  return sizeof(*this) + external_memory_in_bytes(capacity);
-}
-
-template <typename T>
-inline memory_size_type
-DB_Row<T>::external_memory_in_bytes() const {
-  const DB_Row<T>& x = *this;
-#if PPL_DB_ROW_EXTRA_DEBUG
-  return x.impl->total_memory_in_bytes(x.capacity_);
-#else
-  return x.impl->total_memory_in_bytes();
-#endif
-}
-
-template <typename T>
-inline memory_size_type
-DB_Row<T>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-/*! \relates DB_Row */
-template <typename T>
-inline bool
-operator!=(const DB_Row<T>& x, const DB_Row<T>& y) {
-  return !(x == y);
-}
-
-/*! \relates DB_Row */
-template <typename T>
-inline void
-swap(DB_Row<T>& x, DB_Row<T>& y) {
-  x.m_swap(y);
-}
-
-/*! \relates DB_Row */
-template <typename T>
-inline void
-iter_swap(typename std::vector<DB_Row<T> >::iterator x,
-	  typename std::vector<DB_Row<T> >::iterator y) {
-  swap(*x, *y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_DB_Row_inlines_hh)
diff --git a/src/DB_Row.templates.hh b/src/DB_Row.templates.hh
deleted file mode 100644
index 97eec72..0000000
--- a/src/DB_Row.templates.hh
+++ /dev/null
@@ -1,215 +0,0 @@
-/* DB_Row class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_DB_Row_templates_hh
-#define PPL_DB_Row_templates_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-template <typename U>
-void
-DB_Row_Impl_Handler<T>::Impl::construct_upward_approximation(const U& y) {
-  const dimension_type y_size = y.size();
-#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  // Construct in direct order: will destroy in reverse order.
-  for (dimension_type i = 0; i < y_size; ++i) {
-    construct(vec_[i], y[i], ROUND_UP);
-    bump_size();
-  }
-#else // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  if (y_size > 0) {
-    assign_r(vec_[0], y[0], ROUND_UP);
-    bump_size();
-    // Construct in direct order: will destroy in reverse order.
-    for (dimension_type i = 1; i < y_size; ++i) {
-      construct(vec_[i], y[i], ROUND_UP);
-      bump_size();
-    }
-  }
-#endif // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-}
-
-template <typename T>
-void
-DB_Row_Impl_Handler<T>::
-Impl::expand_within_capacity(const dimension_type new_size) {
-  PPL_ASSERT(size() <= new_size && new_size <= max_size());
-#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  if (size() == 0 && new_size > 0) {
-    // vec_[0] is already constructed: we just need to assign +infinity.
-    assign_r(vec_[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    bump_size();
-  }
-#endif
-  // Construct in direct order: will destroy in reverse order.
-  for (dimension_type i = size(); i < new_size; ++i) {
-    new (&vec_[i]) T(PLUS_INFINITY, ROUND_NOT_NEEDED);
-    bump_size();
-  }
-}
-
-template <typename T>
-void
-DB_Row_Impl_Handler<T>::Impl::shrink(dimension_type new_size) {
-  const dimension_type old_size = size();
-  PPL_ASSERT(new_size <= old_size);
-  // Since ~T() does not throw exceptions, nothing here does.
-  set_size(new_size);
-#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  // Make sure we do not try to destroy vec_[0].
-  if (new_size == 0)
-    ++new_size;
-#endif
-  // We assume construction was done "forward".
-  // We thus perform destruction "backward".
-  for (dimension_type i = old_size; i-- > new_size; )
-    vec_[i].~T();
-}
-
-template <typename T>
-void
-DB_Row_Impl_Handler<T>::Impl::copy_construct_coefficients(const Impl& y) {
-  const dimension_type y_size = y.size();
-#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  // Construct in direct order: will destroy in reverse order.
-  for (dimension_type i = 0; i < y_size; ++i) {
-    new (&vec_[i]) T(y.vec_[i]);
-    bump_size();
-  }
-#else // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  if (y_size > 0) {
-    vec_[0] = y.vec_[0];
-    bump_size();
-    // Construct in direct order: will destroy in reverse order.
-    for (dimension_type i = 1; i < y_size; ++i) {
-      new (&vec_[i]) T(y.vec_[i]);
-      bump_size();
-    }
-  }
-#endif // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-}
-
-template <typename T>
-memory_size_type
-DB_Row_Impl_Handler<T>::Impl::external_memory_in_bytes() const {
-  memory_size_type n = 0;
-  for (dimension_type i = size(); i-- > 0; )
-    n += Parma_Polyhedra_Library::external_memory_in_bytes(vec_[i]);
-  return n;
-}
-
-template <typename T>
-bool
-DB_Row<T>::OK(const dimension_type row_size,
-	      const dimension_type
-#if PPL_DB_ROW_EXTRA_DEBUG
-	      row_capacity
-#endif
-	      ) const {
-#ifndef NDEBUG
-  using std::endl;
-  using std::cerr;
-#endif
-
-  const DB_Row<T>& x = *this;
-  bool is_broken = false;
-
-#if PPL_DB_ROW_EXTRA_DEBUG
-# if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  if (x.capacity_ == 0) {
-    cerr << "Illegal row capacity: is 0, should be at least 1"
-	 << endl;
-    is_broken = true;
-  }
-  else if (x.capacity_ == 1 && row_capacity == 0)
-    // This is fine.
-    ;
-  else
-# endif // !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-  if (x.capacity_ != row_capacity) {
-    cerr << "DB_Row capacity mismatch: is " << x.capacity_
-	 << ", should be " << row_capacity << "."
-	 << endl;
-    is_broken = true;
-  }
-#endif // PPL_DB_ROW_EXTRA_DEBUG
-
-  if (x.size() != row_size) {
-#ifndef NDEBUG
-    cerr << "DB_Row size mismatch: is " << x.size()
-	 << ", should be " << row_size << "."
-	 << endl;
-#endif
-    is_broken = true;
-  }
-
-#if PPL_DB_ROW_EXTRA_DEBUG
-  if (x.capacity_ < x.size()) {
-#ifndef NDEBUG
-    cerr << "DB_Row is completely broken: capacity is " << x.capacity_
-	 << ", size is " << x.size() << "."
-	 << endl;
-#endif
-    is_broken = true;
-  }
-#endif // PPL_DB_ROW_EXTRA_DEBUG
-
-  for (dimension_type i = x.size(); i-- > 0; ) {
-    const T& element = x[i];
-    // Not OK is bad.
-    if (!element.OK()) {
-      is_broken = true;
-      break;
-    }
-    // In addition, nans should never occur.
-    if (is_not_a_number(element)) {
-#ifndef NDEBUG
-      cerr << "Not-a-number found in DB_Row."
-	   << endl;
-#endif
-      is_broken = true;
-      break;
-    }
-  }
-
-  return !is_broken;
-}
-
-/*! \relates DB_Row */
-template <typename T>
-bool
-operator==(const DB_Row<T>& x, const DB_Row<T>& y) {
-  if (x.size() != y.size())
-    return false;
-  for (dimension_type i = x.size(); i-- > 0; )
-    if (x[i] != y[i])
-      return false;
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_DB_Row_templates_hh)
diff --git a/src/DB_Row.types.hh b/src/DB_Row.types.hh
deleted file mode 100644
index 99303a1..0000000
--- a/src/DB_Row.types.hh
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_DB_Row_types_hh
-#define PPL_DB_Row_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-class DB_Row_Impl_Handler;
-
-template <typename T>
-class DB_Row;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_DB_Row_types_hh)
diff --git a/src/DB_Row_defs.hh b/src/DB_Row_defs.hh
new file mode 100644
index 0000000..d756481
--- /dev/null
+++ b/src/DB_Row_defs.hh
@@ -0,0 +1,470 @@
+/* DB_Row class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_DB_Row_defs_hh
+#define PPL_DB_Row_defs_hh 1
+
+#include "DB_Row_types.hh"
+#include "globals_types.hh"
+#include "Ptr_Iterator_defs.hh"
+#include <cstddef>
+#include <vector>
+
+#ifndef PPL_DB_ROW_EXTRA_DEBUG
+#ifdef PPL_ABI_BREAKING_EXTRA_DEBUG
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  When PPL_DB_ROW_EXTRA_DEBUG evaluates to <CODE>true</CODE>, each instance
+  of the class DB_Row carries its own capacity; this enables extra
+  consistency checks to be performed.
+  \ingroup PPL_CXX_interface
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+#define PPL_DB_ROW_EXTRA_DEBUG 1
+#else // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
+#define PPL_DB_ROW_EXTRA_DEBUG 0
+#endif // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
+#endif // !defined(PPL_DB_ROW_EXTRA_DEBUG)
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The handler of the actual DB_Row implementation.
+/*! \ingroup PPL_CXX_interface
+  Exception-safety is the only responsibility of this class: it has
+  to ensure that its \p impl member is correctly deallocated.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::DB_Row_Impl_Handler {
+public:
+  //! Default constructor.
+  DB_Row_Impl_Handler();
+
+  //! Destructor.
+  ~DB_Row_Impl_Handler();
+
+  class Impl;
+
+  //! A pointer to the actual implementation.
+  Impl* impl;
+
+#if PPL_DB_ROW_EXTRA_DEBUG
+  //! The capacity of \p impl (only available during debugging).
+  dimension_type capacity_;
+#endif // PPL_DB_ROW_EXTRA_DEBUG
+
+private:
+  //! Private and unimplemented: copy construction is not allowed.
+  DB_Row_Impl_Handler(const DB_Row_Impl_Handler&);
+
+  //! Private and unimplemented: copy assignment is not allowed.
+  DB_Row_Impl_Handler& operator=(const DB_Row_Impl_Handler&);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The base class for the single rows of matrices.
+/*! \ingroup PPL_CXX_interface
+  The class template DB_Row<T> allows for the efficient representation of
+  the single rows of a DB_Matrix. It contains elements of type T stored
+  as a vector. The class T is a family of extended numbers that
+  must provide representation for
+  \f$ -\infty \f$, \f$0\f$,\f$ +\infty \f$ (and, consequently for <EM>nan</EM>,
+  <EM>not a number</EM>, since this arises as the ``result'' of
+  undefined sums like \f$ +\infty + (-\infty) \f$).
+
+  The class T must provide the following methods:
+
+  \code
+    T()
+  \endcode
+  is the default constructor: no assumption is made on the particular
+  object constructed, provided <CODE>T().OK()</CODE> gives <CODE>true</CODE>
+  (see below).
+  \code
+    ~T()
+  \endcode
+  is the destructor.
+  \code
+    bool is_nan() const
+  \endcode
+  returns <CODE>true</CODE> if and only \p *this represents
+  the  <EM>not a number</EM> value.
+  \code
+    bool OK() const
+  \endcode
+  returns <CODE>true</CODE> if and only if \p *this satisfies all
+  its invariants.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::DB_Row : private DB_Row_Impl_Handler<T> {
+public:
+  //! Pre-constructs a row: construction must be completed by construct().
+  DB_Row();
+
+  //! \name Post-constructors.
+  //@{
+  //! Constructs properly a default-constructed element.
+  /*!
+    Builds a row with size \p sz and minimum capacity.
+  */
+  void construct(dimension_type sz);
+
+  //! Constructs properly a default-constructed element.
+  /*!
+    \param sz
+    The size of the row that will be constructed.
+
+    \param capacity
+    The minimum capacity of the row that will be constructed.
+
+    The row that we are constructing has a minimum capacity of
+    (i.e., it can contain at least) \p elements, \p sz of which
+    will be constructed now.
+  */
+  void construct(dimension_type sz, dimension_type capacity);
+
+  //! Constructs properly a conservative approximation of \p y.
+  /*!
+    \param y
+    A row containing the elements whose upward approximations will
+    be used to properly construct \p *this.
+
+    \param capacity
+    The capacity of the constructed row.
+
+    It is assumed that \p capacity is greater than or equal to the
+    size of \p y.
+  */
+  template <typename U>
+  void construct_upward_approximation(const DB_Row<U>& y,
+                                      dimension_type capacity);
+
+  //@}
+
+  //! Tight constructor: resizing will require reallocation.
+  DB_Row(dimension_type sz);
+
+  //! Sizing constructor with capacity.
+  DB_Row(dimension_type sz, dimension_type capacity);
+
+  //! Ordinary copy constructor.
+  DB_Row(const DB_Row& y);
+
+  //! Copy constructor with specified capacity.
+  /*!
+    It is assumed that \p capacity is greater than or equal to \p y size.
+  */
+  DB_Row(const DB_Row& y, dimension_type capacity);
+
+  //! Copy constructor with specified size and capacity.
+  /*!
+    It is assumed that \p sz is greater than or equal to the size of \p y
+    and, of course, that \p sz is less than or equal to \p capacity.
+    Any new position is initialized to \f$+\infty\f$.
+  */
+  DB_Row(const DB_Row& y, dimension_type sz, dimension_type capacity);
+
+  //! Destructor.
+  ~DB_Row();
+
+  //! Assignment operator.
+  DB_Row& operator=(const DB_Row& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(DB_Row& y);
+
+  //! Assigns the implementation of \p y to \p *this.
+  void assign(DB_Row& y);
+
+  /*! \brief
+    Allocates memory for a default constructed DB_Row object,
+    allowing for \p capacity coefficients at most.
+
+    It is assumed that no allocation has been performed before
+    (otherwise, a memory leak will occur).
+    After execution, the size of the DB_Row object is zero.
+  */
+  void allocate(dimension_type capacity);
+
+  //! Expands the row to size \p new_size.
+  /*!
+    Adds new positions to the implementation of the row
+    obtaining a new row with size \p new_size.
+    It is assumed that \p new_size is between the current size
+    and capacity of the row. The new positions are initialized
+    to \f$+\infty\f$.
+  */
+  void expand_within_capacity(dimension_type new_size);
+
+  //! Shrinks the row by erasing elements at the end.
+  /*!
+    Destroys elements of the row implementation
+    from position \p new_size to the end.
+    It is assumed that \p new_size is not greater than the current size.
+  */
+  void shrink(dimension_type new_size);
+
+  //! Returns the size() of the largest possible DB_Row.
+  static dimension_type max_size();
+
+  //! Gives the number of coefficients currently in use.
+  dimension_type size() const;
+
+  //! \name Subscript operators.
+  //@{
+  //! Returns a reference to the element of the row indexed by \p k.
+  T& operator[](dimension_type k);
+
+  //! Returns a constant reference to the element of the row indexed by \p k.
+  const T& operator[](dimension_type k) const;
+  //@}
+
+  //! A (non const) random access iterator to access the row's elements.
+  typedef Implementation::Ptr_Iterator<T*> iterator;
+
+  //! A const random access iterator to access the row's elements.
+  typedef Implementation::Ptr_Iterator<const T*> const_iterator;
+
+  /*! \brief
+    Returns the const iterator pointing to the first element,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const iterator.
+  */
+  iterator begin();
+
+  //! Returns the past-the-end iterator.
+  iterator end();
+
+  /*! \brief
+    Returns the const iterator pointing to the first element,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const iterator.
+  const_iterator end() const;
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a lower bound to the size in bytes of the memory
+    managed by \p *this.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns the total size in bytes of the memory occupied by \p *this,
+    provided the capacity of \p *this is given by \p capacity.
+  */
+  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
+
+  /*! \brief
+    Returns the size in bytes of the memory managed by \p *this,
+    provided the capacity of \p *this is given by \p capacity.
+  */
+  memory_size_type external_memory_in_bytes(dimension_type capacity) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK(dimension_type row_size, dimension_type row_capacity) const;
+
+private:
+  template <typename U> friend class Parma_Polyhedra_Library::DB_Row;
+
+  //! Exception-safe copy construction mechanism for coefficients.
+  void copy_construct_coefficients(const DB_Row& y);
+
+#if PPL_DB_ROW_EXTRA_DEBUG
+  //! Returns the capacity of the row (only available during debugging).
+  dimension_type capacity() const;
+#endif // PPL_DB_ROW_EXTRA_DEBUG
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates DB_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+void swap(DB_Row<T>& x, DB_Row<T>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps objects referred by \p x and \p y.
+/*! \relates DB_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+void iter_swap(typename std::vector<DB_Row<T> >::iterator x,
+               typename std::vector<DB_Row<T> >::iterator y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! \name Classical comparison operators.
+//@{
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+/*! \relates DB_Row */
+template <typename T>
+bool operator==(const DB_Row<T>& x, const DB_Row<T>& y);
+
+/*! \relates DB_Row */
+template <typename T>
+bool operator!=(const DB_Row<T>& x, const DB_Row<T>& y);
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//@}
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+} // namespace Parma_Polyhedra_Library
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The real implementation of a DB_Row object.
+/*! \ingroup PPL_CXX_interface
+  The class DB_Row_Impl_Handler::Impl provides the implementation of
+  DB_Row objects and, in particular, of the corresponding memory
+  allocation functions.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::DB_Row_Impl_Handler<T>::Impl {
+public:
+  //! \name Custom allocator and deallocator.
+  //@{
+
+  /*! \brief
+    Allocates a chunk of memory able to contain \p capacity T objects
+    beyond the specified \p fixed_size and returns a pointer to the new
+    allocated memory.
+  */
+  static void* operator new(size_t fixed_size, dimension_type capacity);
+
+  //! Uses the standard delete operator to free the memory \p p points to.
+  static void operator delete(void* p);
+
+  /*! \brief
+    Placement version: uses the standard operator delete to free
+    the memory \p p points to.
+  */
+  static void operator delete(void* p, dimension_type capacity);
+  //@}
+
+  //! Default constructor.
+  Impl();
+
+  //! Destructor.
+  /*!
+    Uses <CODE>shrink()</CODE> method with argument \f$0\f$
+    to delete all the row elements.
+  */
+  ~Impl();
+
+  //! Expands the row to size \p new_size.
+  /*!
+    It is assumed that \p new_size is between the current size and capacity.
+  */
+  void expand_within_capacity(dimension_type new_size);
+
+  //! Shrinks the row by erasing elements at the end.
+  /*!
+    It is assumed that \p new_size is not greater than the current size.
+  */
+  void shrink(dimension_type new_size);
+
+  //! Exception-safe copy construction mechanism for coefficients.
+  void copy_construct_coefficients(const Impl& y);
+
+  /*! \brief
+    Exception-safe upward approximation construction mechanism
+    for coefficients.
+  */
+  template <typename U>
+  void construct_upward_approximation(const U& y);
+
+  //! Returns the size() of the largest possible Impl.
+  static dimension_type max_size();
+
+  //! \name Size accessors.
+  //@{
+  //! Returns the actual size of \p this.
+  dimension_type size() const;
+
+  //! Sets to \p new_sz the actual size of \p *this.
+  void set_size(dimension_type new_sz);
+
+  //! Increments the size of \p *this by 1.
+  void bump_size();
+  //@}
+
+  //! \name Subscript operators.
+  //@{
+  //! Returns a reference to the element of \p *this indexed by \p k.
+  T& operator[](dimension_type k);
+
+  //! Returns a constant reference to the element of \p *this indexed by \p k.
+  const T& operator[](dimension_type k) const;
+  //@}
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+private:
+  friend class DB_Row<T>;
+
+  //! The number of coefficients in the row.
+  dimension_type size_;
+
+  //! The vector of coefficients.
+  T vec_[
+#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+          0
+#else
+          1
+#endif
+  ];
+
+  //! Private and unimplemented: copy construction is not allowed.
+  Impl(const Impl& y);
+
+  //! Private and unimplemented: assignment is not allowed.
+  Impl& operator=(const Impl&);
+
+  //! Exception-safe copy construction mechanism.
+  void copy_construct(const Impl& y);
+};
+
+#include "DB_Row_inlines.hh"
+#include "DB_Row_templates.hh"
+
+#endif // !defined(PPL_DB_Row_defs_hh)
diff --git a/src/DB_Row_inlines.hh b/src/DB_Row_inlines.hh
new file mode 100644
index 0000000..1ceeb7e
--- /dev/null
+++ b/src/DB_Row_inlines.hh
@@ -0,0 +1,428 @@
+/* DB_Row class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_DB_Row_inlines_hh
+#define PPL_DB_Row_inlines_hh 1
+
+#include "checked_defs.hh"
+#include "assert.hh"
+#include <cstddef>
+#include <limits>
+#include <algorithm>
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline void*
+DB_Row_Impl_Handler<T>::Impl::operator new(const size_t fixed_size,
+                                           const dimension_type capacity) {
+#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  return ::operator new(fixed_size + capacity*sizeof(T));
+#else
+  PPL_ASSERT(capacity >= 1);
+  return ::operator new(fixed_size + (capacity-1)*sizeof(T));
+#endif
+}
+
+template <typename T>
+inline void
+DB_Row_Impl_Handler<T>::Impl::operator delete(void* p) {
+  ::operator delete(p);
+}
+
+template <typename T>
+inline void
+DB_Row_Impl_Handler<T>::Impl::operator delete(void* p, dimension_type) {
+  ::operator delete(p);
+}
+
+template <typename T>
+inline memory_size_type
+DB_Row_Impl_Handler<T>::Impl
+::total_memory_in_bytes(dimension_type capacity) const {
+  return
+    sizeof(*this)
+    + capacity*sizeof(T)
+#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+    - 1*sizeof(T)
+#endif
+    + external_memory_in_bytes();
+}
+
+template <typename T>
+inline memory_size_type
+DB_Row_Impl_Handler<T>::Impl::total_memory_in_bytes() const {
+  // In general, this is a lower bound, as the capacity of *this
+  // may be strictly greater than `size_'
+  return total_memory_in_bytes(size_);
+}
+
+template <typename T>
+inline dimension_type
+DB_Row_Impl_Handler<T>::Impl::max_size() {
+  return std::numeric_limits<size_t>::max() / sizeof(T);
+}
+
+template <typename T>
+inline dimension_type
+DB_Row_Impl_Handler<T>::Impl::size() const {
+  return size_;
+}
+
+template <typename T>
+inline void
+DB_Row_Impl_Handler<T>::Impl::set_size(const dimension_type new_sz) {
+  size_ = new_sz;
+}
+
+template <typename T>
+inline void
+DB_Row_Impl_Handler<T>::Impl::bump_size() {
+  ++size_;
+}
+
+template <typename T>
+inline
+DB_Row_Impl_Handler<T>::Impl::Impl()
+  : size_(0) {
+}
+
+template <typename T>
+inline
+DB_Row_Impl_Handler<T>::Impl::~Impl() {
+  shrink(0);
+}
+
+template <typename T>
+inline
+DB_Row_Impl_Handler<T>::DB_Row_Impl_Handler()
+  : impl(0) {
+#if PPL_DB_ROW_EXTRA_DEBUG
+  capacity_ = 0;
+#endif
+}
+
+template <typename T>
+inline
+DB_Row_Impl_Handler<T>::~DB_Row_Impl_Handler() {
+  delete impl;
+}
+
+template <typename T>
+inline T&
+DB_Row_Impl_Handler<T>::Impl::operator[](const dimension_type k) {
+  PPL_ASSERT(k < size());
+  return vec_[k];
+}
+
+template <typename T>
+inline const T&
+DB_Row_Impl_Handler<T>::Impl::operator[](const dimension_type k) const {
+  PPL_ASSERT(k < size());
+  return vec_[k];
+}
+
+template <typename T>
+inline dimension_type
+DB_Row<T>::max_size() {
+  return DB_Row_Impl_Handler<T>::Impl::max_size();
+}
+
+template <typename T>
+inline dimension_type
+DB_Row<T>::size() const {
+  return this->impl->size();
+}
+
+#if PPL_DB_ROW_EXTRA_DEBUG
+template <typename T>
+inline dimension_type
+DB_Row<T>::capacity() const {
+  return this->capacity_;
+}
+#endif // PPL_DB_ROW_EXTRA_DEBUG
+
+template <typename T>
+inline
+DB_Row<T>::DB_Row()
+  : DB_Row_Impl_Handler<T>() {
+}
+
+template <typename T>
+inline void
+DB_Row<T>::allocate(
+#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+               const
+#endif
+               dimension_type capacity) {
+  DB_Row<T>& x = *this;
+  PPL_ASSERT(capacity <= max_size());
+#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  if (capacity == 0)
+    ++capacity;
+#endif
+  PPL_ASSERT(x.impl == 0);
+  x.impl = new (capacity) typename DB_Row_Impl_Handler<T>::Impl();
+#if PPL_DB_ROW_EXTRA_DEBUG
+  PPL_ASSERT(x.capacity_ == 0);
+  x.capacity_ = capacity;
+#endif
+}
+
+template <typename T>
+inline void
+DB_Row<T>::expand_within_capacity(const dimension_type new_size) {
+  DB_Row<T>& x = *this;
+  PPL_ASSERT(x.impl);
+#if PPL_DB_ROW_EXTRA_DEBUG
+  PPL_ASSERT(new_size <= x.capacity_);
+#endif
+  x.impl->expand_within_capacity(new_size);
+}
+
+template <typename T>
+inline void
+DB_Row<T>::copy_construct_coefficients(const DB_Row& y) {
+  DB_Row<T>& x = *this;
+  PPL_ASSERT(x.impl && y.impl);
+#if PPL_DB_ROW_EXTRA_DEBUG
+  PPL_ASSERT(y.size() <= x.capacity_);
+#endif
+  x.impl->copy_construct_coefficients(*(y.impl));
+}
+
+template <typename T>
+template <typename U>
+inline void
+DB_Row<T>::construct_upward_approximation(const DB_Row<U>& y,
+                                          const dimension_type capacity) {
+  DB_Row<T>& x = *this;
+  PPL_ASSERT(y.size() <= capacity && capacity <= max_size());
+  allocate(capacity);
+  PPL_ASSERT(y.impl);
+  x.impl->construct_upward_approximation(*(y.impl));
+}
+
+template <typename T>
+inline void
+DB_Row<T>::construct(const dimension_type sz,
+                     const dimension_type capacity) {
+  PPL_ASSERT(sz <= capacity && capacity <= max_size());
+  allocate(capacity);
+  expand_within_capacity(sz);
+}
+
+template <typename T>
+inline void
+DB_Row<T>::construct(const dimension_type sz) {
+  construct(sz, sz);
+}
+
+template <typename T>
+inline
+DB_Row<T>::DB_Row(const dimension_type sz,
+                  const dimension_type capacity)
+  : DB_Row_Impl_Handler<T>() {
+  construct(sz, capacity);
+}
+
+template <typename T>
+inline
+DB_Row<T>::DB_Row(const dimension_type sz) {
+  construct(sz);
+}
+
+template <typename T>
+inline
+DB_Row<T>::DB_Row(const DB_Row& y)
+  : DB_Row_Impl_Handler<T>() {
+  if (y.impl != 0) {
+    allocate(compute_capacity(y.size(), max_size()));
+    copy_construct_coefficients(y);
+  }
+}
+
+template <typename T>
+inline
+DB_Row<T>::DB_Row(const DB_Row& y,
+                  const dimension_type capacity)
+  : DB_Row_Impl_Handler<T>() {
+  PPL_ASSERT(y.impl);
+  PPL_ASSERT(y.size() <= capacity && capacity <= max_size());
+  allocate(capacity);
+  copy_construct_coefficients(y);
+}
+
+template <typename T>
+inline
+DB_Row<T>::DB_Row(const DB_Row& y,
+                  const dimension_type sz,
+                  const dimension_type capacity)
+  : DB_Row_Impl_Handler<T>() {
+  PPL_ASSERT(y.impl);
+  PPL_ASSERT(y.size() <= sz && sz <= capacity && capacity <= max_size());
+  allocate(capacity);
+  copy_construct_coefficients(y);
+  expand_within_capacity(sz);
+}
+
+template <typename T>
+inline
+DB_Row<T>::~DB_Row() {
+}
+
+template <typename T>
+inline void
+DB_Row<T>::shrink(const dimension_type new_size) {
+  DB_Row<T>& x = *this;
+  PPL_ASSERT(x.impl);
+  x.impl->shrink(new_size);
+}
+
+template <typename T>
+inline void
+DB_Row<T>::m_swap(DB_Row& y) {
+  using std::swap;
+  DB_Row<T>& x = *this;
+  swap(x.impl, y.impl);
+#if PPL_DB_ROW_EXTRA_DEBUG
+  swap(x.capacity_, y.capacity_);
+#endif
+}
+
+template <typename T>
+inline void
+DB_Row<T>::assign(DB_Row& y) {
+  DB_Row<T>& x = *this;
+  x.impl = y.impl;
+#if PPL_DB_ROW_EXTRA_DEBUG
+  x.capacity_ = y.capacity_;
+#endif
+}
+
+template <typename T>
+inline DB_Row<T>&
+DB_Row<T>::operator=(const DB_Row& y) {
+  DB_Row tmp(y);
+  m_swap(tmp);
+  return *this;
+}
+
+template <typename T>
+inline T&
+DB_Row<T>::operator[](const dimension_type k) {
+  DB_Row<T>& x = *this;
+  return (*x.impl)[k];
+}
+
+template <typename T>
+inline const T&
+DB_Row<T>::operator[](const dimension_type k) const {
+  const DB_Row<T>& x = *this;
+  return (*x.impl)[k];
+}
+
+template <typename T>
+inline typename DB_Row<T>::iterator
+DB_Row<T>::begin() {
+  DB_Row<T>& x = *this;
+  return iterator(x.impl->vec_);
+}
+
+template <typename T>
+inline typename DB_Row<T>::iterator
+DB_Row<T>::end() {
+  DB_Row<T>& x = *this;
+  return iterator(x.impl->vec_ + x.impl->size_);
+}
+
+template <typename T>
+inline typename DB_Row<T>::const_iterator
+DB_Row<T>::begin() const {
+  const DB_Row<T>& x = *this;
+  return const_iterator(x.impl->vec_);
+}
+
+template <typename T>
+inline typename DB_Row<T>::const_iterator
+DB_Row<T>::end() const {
+  const DB_Row<T>& x = *this;
+  return const_iterator(x.impl->vec_ + x.impl->size_);
+}
+
+template <typename T>
+inline memory_size_type
+DB_Row<T>::external_memory_in_bytes(dimension_type capacity) const {
+  const DB_Row<T>& x = *this;
+  return x.impl->total_memory_in_bytes(capacity);
+}
+
+template <typename T>
+inline memory_size_type
+DB_Row<T>::total_memory_in_bytes(dimension_type capacity) const {
+  return sizeof(*this) + external_memory_in_bytes(capacity);
+}
+
+template <typename T>
+inline memory_size_type
+DB_Row<T>::external_memory_in_bytes() const {
+  const DB_Row<T>& x = *this;
+#if PPL_DB_ROW_EXTRA_DEBUG
+  return x.impl->total_memory_in_bytes(x.capacity_);
+#else
+  return x.impl->total_memory_in_bytes();
+#endif
+}
+
+template <typename T>
+inline memory_size_type
+DB_Row<T>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+/*! \relates DB_Row */
+template <typename T>
+inline bool
+operator!=(const DB_Row<T>& x, const DB_Row<T>& y) {
+  return !(x == y);
+}
+
+/*! \relates DB_Row */
+template <typename T>
+inline void
+swap(DB_Row<T>& x, DB_Row<T>& y) {
+  x.m_swap(y);
+}
+
+/*! \relates DB_Row */
+template <typename T>
+inline void
+iter_swap(typename std::vector<DB_Row<T> >::iterator x,
+          typename std::vector<DB_Row<T> >::iterator y) {
+  swap(*x, *y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_DB_Row_inlines_hh)
diff --git a/src/DB_Row_templates.hh b/src/DB_Row_templates.hh
new file mode 100644
index 0000000..12dbac4
--- /dev/null
+++ b/src/DB_Row_templates.hh
@@ -0,0 +1,215 @@
+/* DB_Row class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_DB_Row_templates_hh
+#define PPL_DB_Row_templates_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+template <typename U>
+void
+DB_Row_Impl_Handler<T>::Impl::construct_upward_approximation(const U& y) {
+  const dimension_type y_size = y.size();
+#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  // Construct in direct order: will destroy in reverse order.
+  for (dimension_type i = 0; i < y_size; ++i) {
+    construct(vec_[i], y[i], ROUND_UP);
+    bump_size();
+  }
+#else // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  if (y_size > 0) {
+    assign_r(vec_[0], y[0], ROUND_UP);
+    bump_size();
+    // Construct in direct order: will destroy in reverse order.
+    for (dimension_type i = 1; i < y_size; ++i) {
+      construct(vec_[i], y[i], ROUND_UP);
+      bump_size();
+    }
+  }
+#endif // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+}
+
+template <typename T>
+void
+DB_Row_Impl_Handler<T>::
+Impl::expand_within_capacity(const dimension_type new_size) {
+  PPL_ASSERT(size() <= new_size && new_size <= max_size());
+#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  if (size() == 0 && new_size > 0) {
+    // vec_[0] is already constructed: we just need to assign +infinity.
+    assign_r(vec_[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    bump_size();
+  }
+#endif
+  // Construct in direct order: will destroy in reverse order.
+  for (dimension_type i = size(); i < new_size; ++i) {
+    new (&vec_[i]) T(PLUS_INFINITY, ROUND_NOT_NEEDED);
+    bump_size();
+  }
+}
+
+template <typename T>
+void
+DB_Row_Impl_Handler<T>::Impl::shrink(dimension_type new_size) {
+  const dimension_type old_size = size();
+  PPL_ASSERT(new_size <= old_size);
+  // Since ~T() does not throw exceptions, nothing here does.
+  set_size(new_size);
+#if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  // Make sure we do not try to destroy vec_[0].
+  if (new_size == 0)
+    ++new_size;
+#endif
+  // We assume construction was done "forward".
+  // We thus perform destruction "backward".
+  for (dimension_type i = old_size; i-- > new_size; )
+    vec_[i].~T();
+}
+
+template <typename T>
+void
+DB_Row_Impl_Handler<T>::Impl::copy_construct_coefficients(const Impl& y) {
+  const dimension_type y_size = y.size();
+#if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  // Construct in direct order: will destroy in reverse order.
+  for (dimension_type i = 0; i < y_size; ++i) {
+    new (&vec_[i]) T(y.vec_[i]);
+    bump_size();
+  }
+#else // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  if (y_size > 0) {
+    vec_[0] = y.vec_[0];
+    bump_size();
+    // Construct in direct order: will destroy in reverse order.
+    for (dimension_type i = 1; i < y_size; ++i) {
+      new (&vec_[i]) T(y.vec_[i]);
+      bump_size();
+    }
+  }
+#endif // PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+}
+
+template <typename T>
+memory_size_type
+DB_Row_Impl_Handler<T>::Impl::external_memory_in_bytes() const {
+  memory_size_type n = 0;
+  for (dimension_type i = size(); i-- > 0; )
+    n += Parma_Polyhedra_Library::external_memory_in_bytes(vec_[i]);
+  return n;
+}
+
+template <typename T>
+bool
+DB_Row<T>::OK(const dimension_type row_size,
+              const dimension_type
+#if PPL_DB_ROW_EXTRA_DEBUG
+              row_capacity
+#endif
+              ) const {
+#ifndef NDEBUG
+  using std::endl;
+  using std::cerr;
+#endif
+
+  const DB_Row<T>& x = *this;
+  bool is_broken = false;
+
+#if PPL_DB_ROW_EXTRA_DEBUG
+# if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  if (x.capacity_ == 0) {
+    cerr << "Illegal row capacity: is 0, should be at least 1"
+         << endl;
+    is_broken = true;
+  }
+  else if (x.capacity_ == 1 && row_capacity == 0)
+    // This is fine.
+    ;
+  else
+# endif // !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
+  if (x.capacity_ != row_capacity) {
+    cerr << "DB_Row capacity mismatch: is " << x.capacity_
+         << ", should be " << row_capacity << "."
+         << endl;
+    is_broken = true;
+  }
+#endif // PPL_DB_ROW_EXTRA_DEBUG
+
+  if (x.size() != row_size) {
+#ifndef NDEBUG
+    cerr << "DB_Row size mismatch: is " << x.size()
+         << ", should be " << row_size << "."
+         << endl;
+#endif
+    is_broken = true;
+  }
+
+#if PPL_DB_ROW_EXTRA_DEBUG
+  if (x.capacity_ < x.size()) {
+#ifndef NDEBUG
+    cerr << "DB_Row is completely broken: capacity is " << x.capacity_
+         << ", size is " << x.size() << "."
+         << endl;
+#endif
+    is_broken = true;
+  }
+#endif // PPL_DB_ROW_EXTRA_DEBUG
+
+  for (dimension_type i = x.size(); i-- > 0; ) {
+    const T& element = x[i];
+    // Not OK is bad.
+    if (!element.OK()) {
+      is_broken = true;
+      break;
+    }
+    // In addition, nans should never occur.
+    if (is_not_a_number(element)) {
+#ifndef NDEBUG
+      cerr << "Not-a-number found in DB_Row."
+           << endl;
+#endif
+      is_broken = true;
+      break;
+    }
+  }
+
+  return !is_broken;
+}
+
+/*! \relates DB_Row */
+template <typename T>
+bool
+operator==(const DB_Row<T>& x, const DB_Row<T>& y) {
+  if (x.size() != y.size())
+    return false;
+  for (dimension_type i = x.size(); i-- > 0; )
+    if (x[i] != y[i])
+      return false;
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_DB_Row_templates_hh)
diff --git a/src/DB_Row_types.hh b/src/DB_Row_types.hh
new file mode 100644
index 0000000..03e6183
--- /dev/null
+++ b/src/DB_Row_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_DB_Row_types_hh
+#define PPL_DB_Row_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class DB_Row_Impl_Handler;
+
+template <typename T>
+class DB_Row;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_DB_Row_types_hh)
diff --git a/src/Dense_Row.cc b/src/Dense_Row.cc
index 3884c1e..20503c1 100644
--- a/src/Dense_Row.cc
+++ b/src/Dense_Row.cc
@@ -1,6 +1,6 @@
 /* Dense_Row class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,10 +22,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Dense_Row.defs.hh"
-#include "Coefficient.defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Coefficient_defs.hh"
 #include "assert.hh"
-#include "Sparse_Row.defs.hh"
+#include "Sparse_Row_defs.hh"
 #include <iostream>
 #include <iomanip>
 
@@ -33,7 +33,8 @@ namespace PPL = Parma_Polyhedra_Library;
 
 PPL::Dense_Row::Dense_Row(const Sparse_Row& y, dimension_type sz, dimension_type capacity) {
   resize(sz, capacity);
-  for (Sparse_Row::const_iterator i = y.begin(), i_end = y.lower_bound(sz); i != i_end; ++i)
+  for (Sparse_Row::const_iterator i = y.begin(),
+         i_end = y.lower_bound(sz); i != i_end; ++i)
     (*this)[i.index()] = *i;
   PPL_ASSERT(OK());
 }
@@ -48,7 +49,7 @@ PPL::Dense_Row::resize(dimension_type new_size) {
       // TODO: Consider using realloc() here.
       // TODO: Consider using a smarter allocation strategy.
       const dimension_type new_capacity = new_size;
-      Coefficient* new_vec = impl.coeff_allocator.allocate(new_capacity);
+      Coefficient* const new_vec = impl.coeff_allocator.allocate(new_capacity);
 
       if (impl.vec != 0) {
         memcpy(new_vec, impl.vec, sizeof(Coefficient) * impl.size);
@@ -92,7 +93,7 @@ PPL::Dense_Row::resize(dimension_type new_size, dimension_type new_capacity) {
 
     PPL_ASSERT(impl.size == new_size);
 
-    Coefficient* new_vec = impl.coeff_allocator.allocate(new_capacity);
+    Coefficient* const new_vec = impl.coeff_allocator.allocate(new_capacity);
 
     PPL_ASSERT(impl.vec != 0);
 
@@ -102,10 +103,11 @@ PPL::Dense_Row::resize(dimension_type new_size, dimension_type new_capacity) {
 
     impl.vec = new_vec;
     impl.capacity = new_capacity;
-  } else {
+  }
+  else {
     if (new_capacity > capacity()) {
 
-      Coefficient* new_vec = impl.coeff_allocator.allocate(new_capacity);
+      Coefficient* const new_vec = impl.coeff_allocator.allocate(new_capacity);
 
       if (impl.vec != 0) {
         memcpy(new_vec, impl.vec, sizeof(Coefficient) * impl.size);
@@ -171,7 +173,8 @@ PPL::Dense_Row::add_zeroes_and_shift(dimension_type n, dimension_type i) {
 
     // The old vec will be de-allocated at the end of this block.
 
-  } else {
+  }
+  else {
     memmove(&impl.vec[n + i], &impl.vec[i], sizeof(Coefficient)
             * (impl.size - i));
     impl.size = i;
@@ -248,7 +251,8 @@ PPL::Dense_Row::init(const Sparse_Row& row) {
     if (itr != itr_end && itr.index() == impl.size) {
       new (&impl.vec[impl.size]) Coefficient(*itr);
       ++itr;
-    } else
+    }
+    else
       new (&impl.vec[impl.size]) Coefficient();
     ++impl.size;
   }
@@ -269,10 +273,12 @@ PPL::Dense_Row::operator=(const Sparse_Row& row) {
       if (itr != itr_end && itr.index() == i) {
         impl.vec[impl.size] = *itr;
         ++itr;
-      } else
+      }
+      else
         impl.vec[impl.size] = Coefficient_zero();
     }
-  } else {
+  }
+  else {
     if (capacity() >= row.size()) {
       // size() <= row.size() <= capacity().
       Sparse_Row::const_iterator itr = row.begin();
@@ -282,7 +288,8 @@ PPL::Dense_Row::operator=(const Sparse_Row& row) {
         if (itr != itr_end && itr.index() == impl.size) {
           new (&impl.vec[impl.size]) Coefficient(*itr);
           ++itr;
-        } else
+        }
+        else
           new (&impl.vec[impl.size]) Coefficient();
       }
       // Construct the additional elements.
@@ -291,10 +298,12 @@ PPL::Dense_Row::operator=(const Sparse_Row& row) {
         if (itr != itr_end && itr.index() == impl.size) {
           new (&impl.vec[impl.size]) Coefficient(*itr);
           ++itr;
-        } else
+        }
+        else
           new (&impl.vec[impl.size]) Coefficient();
       }
-    } else {
+    }
+    else {
       // Reallocation is required.
       destroy();
       init(row);
@@ -526,7 +535,8 @@ PPL::Dense_Row::OK() const {
   if (capacity() == 0) {
     if (impl.vec != 0)
       is_broken = true;
-  } else {
+  }
+  else {
     if (impl.vec == 0)
       is_broken = true;
   }
diff --git a/src/Dense_Row.defs.hh b/src/Dense_Row.defs.hh
deleted file mode 100644
index e841d32..0000000
--- a/src/Dense_Row.defs.hh
+++ /dev/null
@@ -1,561 +0,0 @@
-/* Dense_Row class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Dense_Row_defs_hh
-#define PPL_Dense_Row_defs_hh 1
-
-#include "Dense_Row.types.hh"
-
-#include "globals.defs.hh"
-
-#include "Sparse_Row.types.hh"
-#include "Coefficient.defs.hh"
-#include <memory>
-#include <vector>
-#include <limits>
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A finite sequence of coefficients.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Dense_Row {
-public:
-  class iterator;
-  class const_iterator;
-
-  //! Constructs an empty row.
-  Dense_Row();
-
-  explicit Dense_Row(const Sparse_Row& row);
-
-  //! Tight constructor: resizing may require reallocation.
-  /*!
-    Constructs a row with size and capacity \p sz.
-  */
-  Dense_Row(dimension_type sz);
-
-  //! Sizing constructor with capacity.
-  /*!
-    \param sz
-    The size of the row that will be constructed;
-
-    \param capacity
-    The capacity of the row that will be constructed;
-
-    The row that is constructed has storage for \p capacity elements,
-    \p sz of which are default-constructed now.
-  */
-  Dense_Row(dimension_type sz, dimension_type capacity);
-
-  //! Ordinary copy constructor.
-  Dense_Row(const Dense_Row& y);
-
-  //! Copy constructor with specified capacity.
-  /*!
-    It is assumed that \p capacity is greater than or equal to
-    the size of \p y.
-  */
-  Dense_Row(const Dense_Row& y, dimension_type capacity);
-
-  //! Copy constructor with specified size and capacity.
-  /*!
-    It is assumed that \p sz is less than or equal to \p capacity.
-  */
-  Dense_Row(const Dense_Row& y, dimension_type sz, dimension_type capacity);
-
-  //! Copy constructor with specified size and capacity from a Sparse_Row.
-  /*!
-    It is assumed that \p sz is less than or equal to \p capacity.
-  */
-  Dense_Row(const Sparse_Row& y, dimension_type sz, dimension_type capacity);
-
-  //! Destructor.
-  ~Dense_Row();
-
-  //! Assignment operator.
-  Dense_Row& operator=(const Dense_Row& y);
-
-  //! Assignment operator.
-  Dense_Row& operator=(const Sparse_Row& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Dense_Row& y);
-
-  //! Resizes the row to \p sz.
-  void resize(dimension_type sz);
-
-  //! Resizes the row to \p sz, with capacity \p capacity.
-  void resize(dimension_type sz, dimension_type capacity);
-
-  //! Resets all the elements of this row.
-  void clear();
-
-  //! Adds \p n zeroes before index \p i.
-  /*!
-    \param n
-    The number of zeroes that will be added to the row.
-
-    \param i
-    The index of the element before which the zeroes will be added.
-
-    Existing elements with index greater than or equal to \p i are shifted
-    to the right by \p n positions. The size is increased by \p n.
-
-    Existing iterators are invalidated.
-  */
-  void add_zeroes_and_shift(dimension_type n, dimension_type i);
-
-  //! Expands the row to size \p new_size.
-  /*!
-    Adds new positions to the implementation of the row
-    obtaining a new row with size \p new_size.
-    It is assumed that \p new_size is between the current size
-    and capacity of the row.
-  */
-  void expand_within_capacity(dimension_type new_size);
-
-  //! Shrinks the row by erasing elements at the end.
-  /*!
-    Destroys elements of the row implementation
-    from position \p new_size to the end.
-    It is assumed that \p new_size is not greater than the current size.
-  */
-  void shrink(dimension_type new_size);
-
-  //! Returns the size() of the largest possible Dense_Row.
-  static dimension_type max_size();
-
-  //! Gives the number of coefficients currently in use.
-  dimension_type size() const;
-
-  //! \name Subscript operators
-  //@{
-  //! Returns a reference to the element of the row indexed by \p k.
-  Coefficient& operator[](dimension_type k);
-
-  //! Returns a constant reference to the element of the row indexed by \p k.
-  Coefficient_traits::const_reference operator[](dimension_type k) const;
-  //@} // Subscript operators
-
-  //! Normalizes the modulo of coefficients so that they are mutually prime.
-  /*!
-    Computes the Greatest Common Divisor (GCD) among the elements of
-    the row and normalizes them by the GCD itself.
-  */
-  void normalize();
-
-  //! Swaps the i-th element with the j-th element.
-  //! Provided for compatibility with Sparse_Row
-  void swap_coefficients(dimension_type i, dimension_type j);
-
-  //! Swaps the element pointed to by i with the element pointed to by j.
-  //! Provided for compatibility with Sparse_Row
-  void swap_coefficients(iterator i, iterator j);
-
-  iterator begin();
-  const_iterator begin() const;
-
-  iterator end();
-  const_iterator end() const;
-
-  //! Resets the i-th element to 0.
-  //! Provided for compatibility with Sparse_Row
-  void reset(dimension_type i);
-
-  //! Resets the elements [first,last) to 0.
-  //! Provided for compatibility with Sparse_Row
-  void reset(dimension_type first, dimension_type last);
-
-  //! Resets the element pointed to by itr to 0.
-  //! Provided for compatibility with Sparse_Row.
-  iterator reset(iterator itr);
-
-  //! Gets the i-th element.
-  //! Provided for compatibility with Sparse_Row.
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator find(dimension_type i);
-
-  //! Provided for compatibility with Sparse_Row.
-  const_iterator find(dimension_type i) const;
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator find(iterator itr, dimension_type i);
-
-  //! Provided for compatibility with Sparse_Row.
-  const_iterator find(const_iterator itr, dimension_type i) const;
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator lower_bound(dimension_type i);
-
-  //! Provided for compatibility with Sparse_Row.
-  const_iterator lower_bound(dimension_type i) const;
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator lower_bound(iterator itr, dimension_type i);
-
-  //! Provided for compatibility with Sparse_Row.
-  const_iterator lower_bound(const_iterator itr, dimension_type i) const;
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator insert(dimension_type i, Coefficient_traits::const_reference x);
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator insert(dimension_type i);
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator insert(iterator itr, dimension_type i,
-                       Coefficient_traits::const_reference x);
-
-  //! Provided for compatibility with Sparse_Row.
-  iterator insert(iterator itr, dimension_type i);
-
-  //! Calls g(x[i],y[i]), for each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param f
-    A functor that should take a Coefficient&.
-    f(c1) must be equivalent to g(c1, 0).
-
-    \param g
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    g(c1, c2) must do nothing when c1 is zero.
-
-    This method takes \f$O(n)\f$ time.
-
-    \note
-    The functors will only be called when necessary, assuming the requested
-    properties hold.
-
-    \see combine_needs_second
-    \see combine
-  */
-  template <typename Func1, typename Func2>
-  void combine_needs_first(const Dense_Row& y,
-                           const Func1& f, const Func2& g);
-
-  //! Calls g(x[i],y[i]), for each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param g
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    g(c1, 0) must do nothing, for every c1.
-
-    \param h
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
-
-    This method takes \f$O(n)\f$ time.
-
-    \note
-    The functors will only be called when necessary, assuming the requested
-    properties hold.
-
-    \see combine_needs_first
-    \see combine
-  */
-  template <typename Func1, typename Func2>
-  void combine_needs_second(const Dense_Row& y,
-                            const Func1& g, const Func2& h);
-
-  //! Calls g(x[i],y[i]), for each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param f
-    A functor that should take a Coefficient&.
-    f(c1) must be equivalent to g(c1, 0).
-
-    \param g
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    g(c1, c2) must do nothing when both c1 and c2 are zero.
-
-    \param h
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
-
-    This method takes \f$O(n)\f$ time.
-
-    \note
-    The functors will only be called when necessary, assuming the requested
-    properties hold.
-
-    \see combine_needs_first
-    \see combine_needs_second
-  */
-  template <typename Func1, typename Func2, typename Func3>
-  void combine(const Dense_Row& y,
-               const Func1& f, const Func2& g, const Func3& h);
-
-  //! Executes <CODE>(*this)[i] = (*this)[i]*coeff1 + y[i]*coeff2</CODE>, for
-  //! each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param coeff1
-    The coefficient used for elements of *this.
-    It must not be 0.
-
-    \param coeff2
-    The coefficient used for elements of y.
-    It must not be 0.
-
-    This method takes \f$O(n)\f$ time.
-
-    \see combine_needs_first
-    \see combine_needs_second
-    \see combine
-  */
-  void linear_combine(const Dense_Row& y,
-                      Coefficient_traits::const_reference coeff1,
-                      Coefficient_traits::const_reference coeff2);
-
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end).
-  /*!
-    This method detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
-    order to save some work.
-
-    coeff1 and coeff2 must not be 0.
-  */
-  void linear_combine(const Dense_Row& y,
-                      Coefficient_traits::const_reference c1,
-                      Coefficient_traits::const_reference c2,
-                      dimension_type start, dimension_type end);
-  
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a lower bound to the size in bytes of the memory
-    managed by \p *this.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns the total size in bytes of the memory occupied by \p *this,
-    provided the capacity of \p *this is given by \p capacity.
-  */
-  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
-
-  /*! \brief
-    Returns the size in bytes of the memory managed by \p *this,
-    provided the capacity of \p *this is given by \p capacity.
-  */
-  memory_size_type external_memory_in_bytes(dimension_type capacity) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  /*! \brief
-    Checks if all the invariants are satisfied and that the actual
-    size matches the value provided as argument.
-  */
-  bool OK(dimension_type row_size) const;
-
-private:
-  void init(const Sparse_Row& row);
-
-  void destroy();
-
-  struct Impl {
-
-    Impl();
-
-    ~Impl();
-
-    //! The number of coefficients in the row.
-    dimension_type size;
-
-    //! The capacity of the row.
-    dimension_type capacity;
-
-    //! The allocator used to allocate/deallocate vec.
-    std::allocator<Coefficient> coeff_allocator;
-
-    //! The vector of coefficients.
-    //! An empty vector may be stored as NULL instead of using a valid pointer.
-    Coefficient* vec;
-  };
-
-  Impl impl;
-
-  //! Returns the capacity of the row.
-  dimension_type capacity() const;
-};
-
-class Parma_Polyhedra_Library::Dense_Row::iterator {
-public:
-
-  typedef std::bidirectional_iterator_tag iterator_category;
-  typedef Coefficient value_type;
-  typedef ptrdiff_t difference_type;
-  typedef value_type* pointer;
-  typedef value_type& reference;
-
-  iterator();
-  iterator(Dense_Row& row1, dimension_type i1);
-
-  Coefficient& operator*();
-  Coefficient_traits::const_reference operator*() const;
-
-  //! Returns the index of the element pointed to by \c *this.
-  /*!
-    If itr is a valid iterator for row, <CODE>row[itr.index()]</CODE> is
-    equivalent to *itr.
-
-    \returns the index of the element pointed to by \c *this.
-  */
-  dimension_type index() const;
-
-  iterator& operator++();
-  iterator operator++(int);
-
-  iterator& operator--();
-  iterator operator--(int);
-
-  bool operator==(const iterator& x) const;
-  bool operator!=(const iterator& x) const;
-
-  operator const_iterator() const;
-
-  bool OK() const;
-
-private:
-  Dense_Row* row;
-  dimension_type i;
-};
-
-class Parma_Polyhedra_Library::Dense_Row::const_iterator {
-public:
-
-  typedef const Coefficient value_type;
-  typedef ptrdiff_t difference_type;
-  typedef value_type* pointer;
-  typedef Coefficient_traits::const_reference reference;
-
-  const_iterator();
-  const_iterator(const Dense_Row& row1, dimension_type i1);
-
-  Coefficient_traits::const_reference operator*() const;
-
-  //! Returns the index of the element pointed to by \c *this.
-  /*!
-    If itr is a valid iterator for row, <CODE>row[itr.index()]</CODE> is
-    equivalent to *itr.
-
-    \returns the index of the element pointed to by \c *this.
-  */
-  dimension_type index() const;
-
-  const_iterator& operator++();
-  const_iterator operator++(int);
-
-  const_iterator& operator--();
-  const_iterator operator--(int);
-
-  bool operator==(const const_iterator& x) const;
-  bool operator!=(const const_iterator& x) const;
-
-  bool OK() const;
-
-private:
-  const Dense_Row* row;
-  dimension_type i;
-};
-
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates Dense_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(Dense_Row& x, Dense_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps objects referred by \p x and \p y.
-/*! \relates Dense_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void iter_swap(std::vector<Dense_Row>::iterator x,
-               std::vector<Dense_Row>::iterator y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-/*! \relates Dense_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator==(const Dense_Row& x, const Dense_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Dense_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator!=(const Dense_Row& x, const Dense_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Dense_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Dense_Row& x, const Dense_Row& y,
-                    Coefficient_traits::const_reference coeff1,
-                    Coefficient_traits::const_reference coeff2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Dense_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Dense_Row& x, const Dense_Row& y,
-                    Coefficient_traits::const_reference c1,
-                    Coefficient_traits::const_reference c2,
-                    dimension_type start, dimension_type end);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Dense_Row.inlines.hh"
-#include "Dense_Row.templates.hh"
-
-#endif // !defined(PPL_Dense_Row_defs_hh)
diff --git a/src/Dense_Row.inlines.hh b/src/Dense_Row.inlines.hh
deleted file mode 100644
index e562e4c..0000000
--- a/src/Dense_Row.inlines.hh
+++ /dev/null
@@ -1,531 +0,0 @@
-/* Dense_Row class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Dense_Row_inlines_hh
-#define PPL_Dense_Row_inlines_hh 1
-
-#include "assert.hh"
-#include <cstddef>
-#include <limits>
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Dense_Row::Impl::Impl()
-  : size(0), capacity(0), coeff_allocator(), vec(0) {
-}
-
-inline
-Dense_Row::Impl::~Impl() {
-  while (size != 0) {
-    --size;
-    vec[size].~Coefficient();
-  }
-  coeff_allocator.deallocate(vec, capacity);
-}
-
-inline dimension_type
-Dense_Row::max_size() {
-  return std::numeric_limits<size_t>::max() / sizeof(Coefficient);
-}
-
-inline dimension_type
-Dense_Row::size() const {
-  return impl.size;
-}
-
-inline dimension_type
-Dense_Row::capacity() const {
-  return impl.capacity;
-}
-
-inline
-Dense_Row::Dense_Row()
-  : impl() {
-
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::Dense_Row(const dimension_type sz,
-                     const dimension_type capacity)
-  : impl() {
-
-  resize(sz, capacity);
-
-  PPL_ASSERT(size() == sz);
-  PPL_ASSERT(impl.capacity == capacity);
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::Dense_Row(const dimension_type sz)
-  : impl() {
-
-  resize(sz);
-
-  PPL_ASSERT(size() == sz);
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::Dense_Row(const Dense_Row& y)
-  : impl() {
-  impl.coeff_allocator = y.impl.coeff_allocator;
-  if (y.impl.vec != 0) {
-    impl.capacity = y.capacity();
-    impl.vec = impl.coeff_allocator.allocate(impl.capacity);
-    while (impl.size != y.size()) {
-      new (&impl.vec[impl.size]) Coefficient(y[impl.size]);
-      ++impl.size;
-    }
-  }
-  PPL_ASSERT(size() == y.size());
-  PPL_ASSERT(capacity() == y.capacity());
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::Dense_Row(const Dense_Row& y,
-                     const dimension_type capacity)
-  : impl() {
-  PPL_ASSERT(y.size() <= capacity);
-  PPL_ASSERT(capacity <= max_size());
-
-  impl.capacity = capacity;
-  impl.coeff_allocator = y.impl.coeff_allocator;
-  impl.vec = impl.coeff_allocator.allocate(impl.capacity);
-
-  if (y.impl.vec != 0) {
-    while (impl.size != y.size()) {
-      new (&impl.vec[impl.size]) Coefficient(y[impl.size]);
-      ++impl.size;
-    }
-  }
-
-  PPL_ASSERT(size() == y.size());
-  PPL_ASSERT(impl.capacity == capacity);
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::Dense_Row(const Dense_Row& y,
-                     const dimension_type sz,
-                     const dimension_type capacity)
-  : impl() {
-  PPL_ASSERT(sz <= capacity);
-  PPL_ASSERT(capacity <= max_size());
-  PPL_ASSERT(capacity != 0);
-
-  impl.capacity = capacity;
-  impl.coeff_allocator = y.impl.coeff_allocator;
-  impl.vec = impl.coeff_allocator.allocate(impl.capacity);
-
-  const dimension_type n = std::min(sz, y.size());
-  while (impl.size != n) {
-    new (&impl.vec[impl.size]) Coefficient(y[impl.size]);
-    ++impl.size;
-  }
-  while (impl.size != sz) {
-    new (&impl.vec[impl.size]) Coefficient();
-    ++impl.size;
-  }
-
-  PPL_ASSERT(size() == sz);
-  PPL_ASSERT(impl.capacity == capacity);
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::~Dense_Row() {
-  // The `impl' field will be destroyed automatically.
-}
-
-inline void
-Dense_Row::destroy() {
-  resize(0);
-  impl.coeff_allocator.deallocate(impl.vec, impl.capacity);
-}
-
-inline void
-Dense_Row::m_swap(Dense_Row& y) {
-  using std::swap;
-  swap(impl.size, y.impl.size);
-  swap(impl.capacity, y.impl.capacity);
-  swap(impl.coeff_allocator, y.impl.coeff_allocator);
-  swap(impl.vec, y.impl.vec);
-  PPL_ASSERT(OK());
-  PPL_ASSERT(y.OK());
-}
-
-inline Dense_Row&
-Dense_Row::operator=(const Dense_Row& y) {
-
-  if (this != &y && size() == y.size()) {
-    // Avoid reallocation.
-
-    for (dimension_type i = size(); i-- > 0; )
-      (*this)[i] = y[i];
-
-    return *this;
-  }
-
-  Dense_Row x(y);
-  swap(*this, x);
-
-  return *this;
-}
-
-inline Coefficient&
-Dense_Row::operator[](const dimension_type k) {
-  PPL_ASSERT(impl.vec != 0);
-  PPL_ASSERT(k < size());
-  return impl.vec[k];
-}
-
-inline Coefficient_traits::const_reference
-Dense_Row::operator[](const dimension_type k) const {
-  PPL_ASSERT(impl.vec != 0);
-  PPL_ASSERT(k < size());
-  return impl.vec[k];
-}
-
-inline void
-Dense_Row::swap_coefficients(dimension_type i, dimension_type j) {
-  std::swap((*this)[i], (*this)[j]);
-}
-
-inline void
-Dense_Row::swap_coefficients(iterator i, iterator j) {
-  std::swap(*i, *j);
-}
-
-inline void
-Dense_Row::reset(dimension_type i) {
-  (*this)[i] = 0;
-}
-
-inline Dense_Row::iterator
-Dense_Row::reset(iterator itr) {
-  *itr = 0;
-  ++itr;
-  return itr;
-}
-
-inline Dense_Row::iterator
-Dense_Row::begin() {
-  return iterator(*this, 0);
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::begin() const {
-  return const_iterator(*this, 0);
-}
-
-inline Dense_Row::iterator
-Dense_Row::end() {
-  return iterator(*this, size());
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::end() const {
-  return const_iterator(*this, size());
-}
-
-inline Coefficient_traits::const_reference
-Dense_Row::get(dimension_type i) const {
-  return (*this)[i];
-}
-
-inline Dense_Row::iterator
-Dense_Row::find(dimension_type i) {
-  return iterator(*this, i);
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::find(dimension_type i) const {
-  return const_iterator(*this, i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::find(iterator itr, dimension_type i) {
-  (void)itr;
-  return iterator(*this, i);
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::find(const_iterator itr, dimension_type i) const {
-  (void)itr;
-  return const_iterator(*this, i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::lower_bound(dimension_type i) {
-  return find(i);
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::lower_bound(dimension_type i) const {
-  return find(i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::lower_bound(iterator itr, dimension_type i) {
-  return find(itr, i);
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::lower_bound(const_iterator itr, dimension_type i) const {
-  return find(itr, i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::insert(dimension_type i,
-                  Coefficient_traits::const_reference x) {
-  (*this)[i] = x;
-  return find(i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::insert(dimension_type i) {
-  return find(i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::insert(iterator itr, dimension_type i,
-                  Coefficient_traits::const_reference x) {
-  (void)itr;
-  (*this)[i] = x;
-  return find(i);
-}
-
-inline Dense_Row::iterator
-Dense_Row::insert(iterator itr, dimension_type i) {
-  (void)itr;
-  return find(i);
-}
-
-inline memory_size_type
-Dense_Row::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline memory_size_type
-Dense_Row::total_memory_in_bytes(dimension_type capacity) const {
-  return sizeof(*this) + external_memory_in_bytes(capacity);
-}
-
-/*! \relates Dense_Row */
-inline bool
-operator!=(const Dense_Row& x, const Dense_Row& y) {
-  return !(x == y);
-}
-
-
-inline
-Dense_Row::iterator::iterator()
-  : row(NULL), i(0) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::iterator::iterator(Dense_Row& row1,dimension_type i1)
-  : row(&row1), i(i1) {
-  PPL_ASSERT(OK());
-}
-
-inline Coefficient&
-Dense_Row::iterator::operator*() {
-  PPL_ASSERT(i < row->size());
-  return (*row)[i];
-}
-
-inline Coefficient_traits::const_reference
-Dense_Row::iterator::operator*() const {
-  PPL_ASSERT(i < row->size());
-  return (*row)[i];
-}
-
-inline dimension_type
-Dense_Row::iterator::index() const {
-  return i;
-}
-
-inline Dense_Row::iterator&
-Dense_Row::iterator::operator++() {
-  PPL_ASSERT(i < row->size());
-  ++i;
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline Dense_Row::iterator
-Dense_Row::iterator::operator++(int) {
-  iterator tmp(*this);
-  ++(*this);
-  return tmp;
-}
-
-inline Dense_Row::iterator&
-Dense_Row::iterator::operator--() {
-  PPL_ASSERT(i > 0);
-  --i;
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline Dense_Row::iterator
-Dense_Row::iterator::operator--(int) {
-  iterator tmp(*this);
-  --(*this);
-  return tmp;
-}
-
-inline bool
-Dense_Row::iterator::operator==(const iterator& x) const {
-  return (row == x.row) && (i == x.i);
-}
-
-inline bool
-Dense_Row::iterator::operator!=(const iterator& x) const {
-  return !(*this == x);
-}
-
-inline
-Dense_Row::iterator::operator const_iterator() const {
-  return const_iterator(*row, i);
-}
-
-inline bool
-Dense_Row::iterator::OK() const {
-  if (row == NULL)
-    return true;
-  // i can be equal to row.size() for past-the-end iterators
-  return (i <= row->size());
-}
-
-
-inline
-Dense_Row::const_iterator::const_iterator()
-  : row(NULL), i(0) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Dense_Row::const_iterator::const_iterator(const Dense_Row& row1,
-                                          dimension_type i1)
-  : row(&row1), i(i1) {
-  PPL_ASSERT(OK());
-}
-
-inline Coefficient_traits::const_reference
-Dense_Row::const_iterator::operator*() const {
-  PPL_ASSERT(i < row->size());
-  return (*row)[i];
-}
-
-inline dimension_type
-Dense_Row::const_iterator::index() const {
-  return i;
-}
-
-inline Dense_Row::const_iterator&
-Dense_Row::const_iterator::operator++() {
-  PPL_ASSERT(i < row->size());
-  ++i;
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::const_iterator::operator++(int) {
-  const_iterator tmp(*this);
-  ++(*this);
-  return tmp;
-}
-
-inline Dense_Row::const_iterator&
-Dense_Row::const_iterator::operator--() {
-  PPL_ASSERT(i > 0);
-  --i;
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-inline Dense_Row::const_iterator
-Dense_Row::const_iterator::operator--(int) {
-  const_iterator tmp(*this);
-  --(*this);
-  return tmp;
-}
-
-inline bool
-Dense_Row::const_iterator::operator==(const const_iterator& x) const {
-  return (row == x.row) && (i == x.i);
-}
-
-inline bool
-Dense_Row::const_iterator::operator!=(const const_iterator& x) const {
-  return !(*this == x);
-}
-
-inline bool
-Dense_Row::const_iterator::OK() const {
-  if (row == NULL)
-    return true;
-  // i can be equal to row.size() for past-the-end iterators
-  return (i <= row->size());
-}
-
-inline void
-linear_combine(Dense_Row& x, const Dense_Row& y,
-               Coefficient_traits::const_reference coeff1,
-               Coefficient_traits::const_reference coeff2) {
-  x.linear_combine(y, coeff1, coeff2);
-}
-
-inline void
-linear_combine(Dense_Row& x, const Dense_Row& y,
-               Coefficient_traits::const_reference c1,
-               Coefficient_traits::const_reference c2,
-               dimension_type start, dimension_type end) {
-  x.linear_combine(y, c1, c2, start, end);
-}
-
-/*! \relates Dense_Row */
-inline void
-swap(Dense_Row& x, Dense_Row& y) {
-  x.m_swap(y);
-}
-
-/*! \relates Dense_Row */
-inline void
-iter_swap(std::vector<Dense_Row>::iterator x,
-          std::vector<Dense_Row>::iterator y) {
-  swap(*x, *y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Dense_Row_inlines_hh)
diff --git a/src/Dense_Row.templates.hh b/src/Dense_Row.templates.hh
deleted file mode 100644
index 3517bf1..0000000
--- a/src/Dense_Row.templates.hh
+++ /dev/null
@@ -1,56 +0,0 @@
-/* Dense_Row class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Dense_Row_templates_hh
-#define PPL_Dense_Row_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-
-template <typename Func1, typename Func2>
-void
-Dense_Row::combine_needs_first(const Dense_Row& y, const Func1& /* f */,
-                               const Func2& g) {
-  for (dimension_type i = size(); i-- > 0; )
-    g((*this)[i], y[i]);
-}
-
-template <typename Func1, typename Func2>
-void
-Dense_Row::combine_needs_second(const Dense_Row& y, const Func1& g,
-                                const Func2& /* h */) {
-  for (dimension_type i = size(); i-- > 0; )
-    g((*this)[i], y[i]);
-}
-
-template <typename Func1, typename Func2, typename Func3>
-void
-Dense_Row::combine(const Dense_Row& y, const Func1& /* f */, const Func2& g,
-                   const Func3& /* h */) {
-  for (dimension_type i = size(); i-- > 0; )
-    g((*this)[i], y[i]);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Dense_Row_templates_hh)
diff --git a/src/Dense_Row.types.hh b/src/Dense_Row.types.hh
deleted file mode 100644
index 686efa8..0000000
--- a/src/Dense_Row.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Dense_Row_types_hh
-#define PPL_Dense_Row_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Dense_Row;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Dense_Row_types_hh)
diff --git a/src/Dense_Row_defs.hh b/src/Dense_Row_defs.hh
new file mode 100644
index 0000000..27af61d
--- /dev/null
+++ b/src/Dense_Row_defs.hh
@@ -0,0 +1,561 @@
+/* Dense_Row class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Dense_Row_defs_hh
+#define PPL_Dense_Row_defs_hh 1
+
+#include "Dense_Row_types.hh"
+
+#include "globals_defs.hh"
+
+#include "Sparse_Row_types.hh"
+#include "Coefficient_defs.hh"
+#include <memory>
+#include <vector>
+#include <limits>
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A finite sequence of coefficients.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Dense_Row {
+public:
+  class iterator;
+  class const_iterator;
+
+  //! Constructs an empty row.
+  Dense_Row();
+
+  explicit Dense_Row(const Sparse_Row& row);
+
+  //! Tight constructor: resizing may require reallocation.
+  /*!
+    Constructs a row with size and capacity \p sz.
+  */
+  Dense_Row(dimension_type sz);
+
+  //! Sizing constructor with capacity.
+  /*!
+    \param sz
+    The size of the row that will be constructed;
+
+    \param capacity
+    The capacity of the row that will be constructed;
+
+    The row that is constructed has storage for \p capacity elements,
+    \p sz of which are default-constructed now.
+  */
+  Dense_Row(dimension_type sz, dimension_type capacity);
+
+  //! Ordinary copy constructor.
+  Dense_Row(const Dense_Row& y);
+
+  //! Copy constructor with specified capacity.
+  /*!
+    It is assumed that \p capacity is greater than or equal to
+    the size of \p y.
+  */
+  Dense_Row(const Dense_Row& y, dimension_type capacity);
+
+  //! Copy constructor with specified size and capacity.
+  /*!
+    It is assumed that \p sz is less than or equal to \p capacity.
+  */
+  Dense_Row(const Dense_Row& y, dimension_type sz, dimension_type capacity);
+
+  //! Copy constructor with specified size and capacity from a Sparse_Row.
+  /*!
+    It is assumed that \p sz is less than or equal to \p capacity.
+  */
+  Dense_Row(const Sparse_Row& y, dimension_type sz, dimension_type capacity);
+
+  //! Destructor.
+  ~Dense_Row();
+
+  //! Assignment operator.
+  Dense_Row& operator=(const Dense_Row& y);
+
+  //! Assignment operator.
+  Dense_Row& operator=(const Sparse_Row& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Dense_Row& y);
+
+  //! Resizes the row to \p sz.
+  void resize(dimension_type sz);
+
+  //! Resizes the row to \p sz, with capacity \p capacity.
+  void resize(dimension_type sz, dimension_type capacity);
+
+  //! Resets all the elements of this row.
+  void clear();
+
+  //! Adds \p n zeroes before index \p i.
+  /*!
+    \param n
+    The number of zeroes that will be added to the row.
+
+    \param i
+    The index of the element before which the zeroes will be added.
+
+    Existing elements with index greater than or equal to \p i are shifted
+    to the right by \p n positions. The size is increased by \p n.
+
+    Existing iterators are invalidated.
+  */
+  void add_zeroes_and_shift(dimension_type n, dimension_type i);
+
+  //! Expands the row to size \p new_size.
+  /*!
+    Adds new positions to the implementation of the row
+    obtaining a new row with size \p new_size.
+    It is assumed that \p new_size is between the current size
+    and capacity of the row.
+  */
+  void expand_within_capacity(dimension_type new_size);
+
+  //! Shrinks the row by erasing elements at the end.
+  /*!
+    Destroys elements of the row implementation
+    from position \p new_size to the end.
+    It is assumed that \p new_size is not greater than the current size.
+  */
+  void shrink(dimension_type new_size);
+
+  //! Returns the size() of the largest possible Dense_Row.
+  static dimension_type max_size();
+
+  //! Gives the number of coefficients currently in use.
+  dimension_type size() const;
+
+  //! \name Subscript operators
+  //@{
+  //! Returns a reference to the element of the row indexed by \p k.
+  Coefficient& operator[](dimension_type k);
+
+  //! Returns a constant reference to the element of the row indexed by \p k.
+  Coefficient_traits::const_reference operator[](dimension_type k) const;
+  //@} // Subscript operators
+
+  //! Normalizes the modulo of coefficients so that they are mutually prime.
+  /*!
+    Computes the Greatest Common Divisor (GCD) among the elements of
+    the row and normalizes them by the GCD itself.
+  */
+  void normalize();
+
+  //! Swaps the i-th element with the j-th element.
+  //! Provided for compatibility with Sparse_Row
+  void swap_coefficients(dimension_type i, dimension_type j);
+
+  //! Swaps the element pointed to by i with the element pointed to by j.
+  //! Provided for compatibility with Sparse_Row
+  void swap_coefficients(iterator i, iterator j);
+
+  iterator begin();
+  const_iterator begin() const;
+
+  iterator end();
+  const_iterator end() const;
+
+  //! Resets the i-th element to 0.
+  //! Provided for compatibility with Sparse_Row
+  void reset(dimension_type i);
+
+  //! Resets the elements [first,last) to 0.
+  //! Provided for compatibility with Sparse_Row
+  void reset(dimension_type first, dimension_type last);
+
+  //! Resets the element pointed to by itr to 0.
+  //! Provided for compatibility with Sparse_Row.
+  iterator reset(iterator itr);
+
+  //! Gets the i-th element.
+  //! Provided for compatibility with Sparse_Row.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator find(dimension_type i);
+
+  //! Provided for compatibility with Sparse_Row.
+  const_iterator find(dimension_type i) const;
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator find(iterator itr, dimension_type i);
+
+  //! Provided for compatibility with Sparse_Row.
+  const_iterator find(const_iterator itr, dimension_type i) const;
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator lower_bound(dimension_type i);
+
+  //! Provided for compatibility with Sparse_Row.
+  const_iterator lower_bound(dimension_type i) const;
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator lower_bound(iterator itr, dimension_type i);
+
+  //! Provided for compatibility with Sparse_Row.
+  const_iterator lower_bound(const_iterator itr, dimension_type i) const;
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator insert(dimension_type i, Coefficient_traits::const_reference x);
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator insert(dimension_type i);
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator insert(iterator itr, dimension_type i,
+                       Coefficient_traits::const_reference x);
+
+  //! Provided for compatibility with Sparse_Row.
+  iterator insert(iterator itr, dimension_type i);
+
+  //! Calls g(x[i],y[i]), for each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param f
+    A functor that should take a Coefficient&.
+    f(c1) must be equivalent to g(c1, 0).
+
+    \param g
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    g(c1, c2) must do nothing when c1 is zero.
+
+    This method takes \f$O(n)\f$ time.
+
+    \note
+    The functors will only be called when necessary, assuming the requested
+    properties hold.
+
+    \see combine_needs_second
+    \see combine
+  */
+  template <typename Func1, typename Func2>
+  void combine_needs_first(const Dense_Row& y,
+                           const Func1& f, const Func2& g);
+
+  //! Calls g(x[i],y[i]), for each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param g
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    g(c1, 0) must do nothing, for every c1.
+
+    \param h
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
+
+    This method takes \f$O(n)\f$ time.
+
+    \note
+    The functors will only be called when necessary, assuming the requested
+    properties hold.
+
+    \see combine_needs_first
+    \see combine
+  */
+  template <typename Func1, typename Func2>
+  void combine_needs_second(const Dense_Row& y,
+                            const Func1& g, const Func2& h);
+
+  //! Calls g(x[i],y[i]), for each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param f
+    A functor that should take a Coefficient&.
+    f(c1) must be equivalent to g(c1, 0).
+
+    \param g
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    g(c1, c2) must do nothing when both c1 and c2 are zero.
+
+    \param h
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
+
+    This method takes \f$O(n)\f$ time.
+
+    \note
+    The functors will only be called when necessary, assuming the requested
+    properties hold.
+
+    \see combine_needs_first
+    \see combine_needs_second
+  */
+  template <typename Func1, typename Func2, typename Func3>
+  void combine(const Dense_Row& y,
+               const Func1& f, const Func2& g, const Func3& h);
+
+  //! Executes <CODE>(*this)[i] = (*this)[i]*coeff1 + y[i]*coeff2</CODE>, for
+  //! each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param coeff1
+    The coefficient used for elements of *this.
+    It must not be 0.
+
+    \param coeff2
+    The coefficient used for elements of y.
+    It must not be 0.
+
+    This method takes \f$O(n)\f$ time.
+
+    \see combine_needs_first
+    \see combine_needs_second
+    \see combine
+  */
+  void linear_combine(const Dense_Row& y,
+                      Coefficient_traits::const_reference coeff1,
+                      Coefficient_traits::const_reference coeff2);
+
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end).
+  /*!
+    This method detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
+    order to save some work.
+
+    coeff1 and coeff2 must not be 0.
+  */
+  void linear_combine(const Dense_Row& y,
+                      Coefficient_traits::const_reference c1,
+                      Coefficient_traits::const_reference c2,
+                      dimension_type start, dimension_type end);
+  
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a lower bound to the size in bytes of the memory
+    managed by \p *this.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns the total size in bytes of the memory occupied by \p *this,
+    provided the capacity of \p *this is given by \p capacity.
+  */
+  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
+
+  /*! \brief
+    Returns the size in bytes of the memory managed by \p *this,
+    provided the capacity of \p *this is given by \p capacity.
+  */
+  memory_size_type external_memory_in_bytes(dimension_type capacity) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  /*! \brief
+    Checks if all the invariants are satisfied and that the actual
+    size matches the value provided as argument.
+  */
+  bool OK(dimension_type row_size) const;
+
+private:
+  void init(const Sparse_Row& row);
+
+  void destroy();
+
+  struct Impl {
+
+    Impl();
+
+    ~Impl();
+
+    //! The number of coefficients in the row.
+    dimension_type size;
+
+    //! The capacity of the row.
+    dimension_type capacity;
+
+    //! The allocator used to allocate/deallocate vec.
+    std::allocator<Coefficient> coeff_allocator;
+
+    //! The vector of coefficients.
+    //! An empty vector may be stored as NULL instead of using a valid pointer.
+    Coefficient* vec;
+  };
+
+  Impl impl;
+
+  //! Returns the capacity of the row.
+  dimension_type capacity() const;
+};
+
+class Parma_Polyhedra_Library::Dense_Row::iterator {
+public:
+
+  typedef std::bidirectional_iterator_tag iterator_category;
+  typedef Coefficient value_type;
+  typedef ptrdiff_t difference_type;
+  typedef value_type* pointer;
+  typedef value_type& reference;
+
+  iterator();
+  iterator(Dense_Row& row1, dimension_type i1);
+
+  Coefficient& operator*();
+  Coefficient_traits::const_reference operator*() const;
+
+  //! Returns the index of the element pointed to by \c *this.
+  /*!
+    If itr is a valid iterator for row, <CODE>row[itr.index()]</CODE> is
+    equivalent to *itr.
+
+    \returns the index of the element pointed to by \c *this.
+  */
+  dimension_type index() const;
+
+  iterator& operator++();
+  iterator operator++(int);
+
+  iterator& operator--();
+  iterator operator--(int);
+
+  bool operator==(const iterator& x) const;
+  bool operator!=(const iterator& x) const;
+
+  operator const_iterator() const;
+
+  bool OK() const;
+
+private:
+  Dense_Row* row;
+  dimension_type i;
+};
+
+class Parma_Polyhedra_Library::Dense_Row::const_iterator {
+public:
+
+  typedef const Coefficient value_type;
+  typedef ptrdiff_t difference_type;
+  typedef value_type* pointer;
+  typedef Coefficient_traits::const_reference reference;
+
+  const_iterator();
+  const_iterator(const Dense_Row& row1, dimension_type i1);
+
+  Coefficient_traits::const_reference operator*() const;
+
+  //! Returns the index of the element pointed to by \c *this.
+  /*!
+    If itr is a valid iterator for row, <CODE>row[itr.index()]</CODE> is
+    equivalent to *itr.
+
+    \returns the index of the element pointed to by \c *this.
+  */
+  dimension_type index() const;
+
+  const_iterator& operator++();
+  const_iterator operator++(int);
+
+  const_iterator& operator--();
+  const_iterator operator--(int);
+
+  bool operator==(const const_iterator& x) const;
+  bool operator!=(const const_iterator& x) const;
+
+  bool OK() const;
+
+private:
+  const Dense_Row* row;
+  dimension_type i;
+};
+
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates Dense_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(Dense_Row& x, Dense_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps objects referred by \p x and \p y.
+/*! \relates Dense_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void iter_swap(std::vector<Dense_Row>::iterator x,
+               std::vector<Dense_Row>::iterator y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+/*! \relates Dense_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator==(const Dense_Row& x, const Dense_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Dense_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator!=(const Dense_Row& x, const Dense_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Dense_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Dense_Row& x, const Dense_Row& y,
+                    Coefficient_traits::const_reference coeff1,
+                    Coefficient_traits::const_reference coeff2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Dense_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Dense_Row& x, const Dense_Row& y,
+                    Coefficient_traits::const_reference c1,
+                    Coefficient_traits::const_reference c2,
+                    dimension_type start, dimension_type end);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Dense_Row_inlines.hh"
+#include "Dense_Row_templates.hh"
+
+#endif // !defined(PPL_Dense_Row_defs_hh)
diff --git a/src/Dense_Row_inlines.hh b/src/Dense_Row_inlines.hh
new file mode 100644
index 0000000..10c98b8
--- /dev/null
+++ b/src/Dense_Row_inlines.hh
@@ -0,0 +1,531 @@
+/* Dense_Row class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Dense_Row_inlines_hh
+#define PPL_Dense_Row_inlines_hh 1
+
+#include "assert.hh"
+#include <cstddef>
+#include <limits>
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Dense_Row::Impl::Impl()
+  : size(0), capacity(0), coeff_allocator(), vec(0) {
+}
+
+inline
+Dense_Row::Impl::~Impl() {
+  while (size != 0) {
+    --size;
+    vec[size].~Coefficient();
+  }
+  coeff_allocator.deallocate(vec, capacity);
+}
+
+inline dimension_type
+Dense_Row::max_size() {
+  return std::numeric_limits<size_t>::max() / sizeof(Coefficient);
+}
+
+inline dimension_type
+Dense_Row::size() const {
+  return impl.size;
+}
+
+inline dimension_type
+Dense_Row::capacity() const {
+  return impl.capacity;
+}
+
+inline
+Dense_Row::Dense_Row()
+  : impl() {
+
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::Dense_Row(const dimension_type sz,
+                     const dimension_type capacity)
+  : impl() {
+
+  resize(sz, capacity);
+
+  PPL_ASSERT(size() == sz);
+  PPL_ASSERT(impl.capacity == capacity);
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::Dense_Row(const dimension_type sz)
+  : impl() {
+
+  resize(sz);
+
+  PPL_ASSERT(size() == sz);
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::Dense_Row(const Dense_Row& y)
+  : impl() {
+  impl.coeff_allocator = y.impl.coeff_allocator;
+  if (y.impl.vec != 0) {
+    impl.capacity = y.capacity();
+    impl.vec = impl.coeff_allocator.allocate(impl.capacity);
+    while (impl.size != y.size()) {
+      new (&impl.vec[impl.size]) Coefficient(y[impl.size]);
+      ++impl.size;
+    }
+  }
+  PPL_ASSERT(size() == y.size());
+  PPL_ASSERT(capacity() == y.capacity());
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::Dense_Row(const Dense_Row& y,
+                     const dimension_type capacity)
+  : impl() {
+  PPL_ASSERT(y.size() <= capacity);
+  PPL_ASSERT(capacity <= max_size());
+
+  impl.capacity = capacity;
+  impl.coeff_allocator = y.impl.coeff_allocator;
+  impl.vec = impl.coeff_allocator.allocate(impl.capacity);
+
+  if (y.impl.vec != 0) {
+    while (impl.size != y.size()) {
+      new (&impl.vec[impl.size]) Coefficient(y[impl.size]);
+      ++impl.size;
+    }
+  }
+
+  PPL_ASSERT(size() == y.size());
+  PPL_ASSERT(impl.capacity == capacity);
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::Dense_Row(const Dense_Row& y,
+                     const dimension_type sz,
+                     const dimension_type capacity)
+  : impl() {
+  PPL_ASSERT(sz <= capacity);
+  PPL_ASSERT(capacity <= max_size());
+  PPL_ASSERT(capacity != 0);
+
+  impl.capacity = capacity;
+  impl.coeff_allocator = y.impl.coeff_allocator;
+  impl.vec = impl.coeff_allocator.allocate(impl.capacity);
+
+  const dimension_type n = std::min(sz, y.size());
+  while (impl.size != n) {
+    new (&impl.vec[impl.size]) Coefficient(y[impl.size]);
+    ++impl.size;
+  }
+  while (impl.size != sz) {
+    new (&impl.vec[impl.size]) Coefficient();
+    ++impl.size;
+  }
+
+  PPL_ASSERT(size() == sz);
+  PPL_ASSERT(impl.capacity == capacity);
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::~Dense_Row() {
+  // The `impl' field will be destroyed automatically.
+}
+
+inline void
+Dense_Row::destroy() {
+  resize(0);
+  impl.coeff_allocator.deallocate(impl.vec, impl.capacity);
+}
+
+inline void
+Dense_Row::m_swap(Dense_Row& y) {
+  using std::swap;
+  swap(impl.size, y.impl.size);
+  swap(impl.capacity, y.impl.capacity);
+  swap(impl.coeff_allocator, y.impl.coeff_allocator);
+  swap(impl.vec, y.impl.vec);
+  PPL_ASSERT(OK());
+  PPL_ASSERT(y.OK());
+}
+
+inline Dense_Row&
+Dense_Row::operator=(const Dense_Row& y) {
+
+  if (this != &y && size() == y.size()) {
+    // Avoid reallocation.
+
+    for (dimension_type i = size(); i-- > 0; )
+      (*this)[i] = y[i];
+
+    return *this;
+  }
+
+  Dense_Row x(y);
+  swap(*this, x);
+
+  return *this;
+}
+
+inline Coefficient&
+Dense_Row::operator[](const dimension_type k) {
+  PPL_ASSERT(impl.vec != 0);
+  PPL_ASSERT(k < size());
+  return impl.vec[k];
+}
+
+inline Coefficient_traits::const_reference
+Dense_Row::operator[](const dimension_type k) const {
+  PPL_ASSERT(impl.vec != 0);
+  PPL_ASSERT(k < size());
+  return impl.vec[k];
+}
+
+inline void
+Dense_Row::swap_coefficients(dimension_type i, dimension_type j) {
+  std::swap((*this)[i], (*this)[j]);
+}
+
+inline void
+Dense_Row::swap_coefficients(iterator i, iterator j) {
+  std::swap(*i, *j);
+}
+
+inline void
+Dense_Row::reset(dimension_type i) {
+  (*this)[i] = 0;
+}
+
+inline Dense_Row::iterator
+Dense_Row::reset(iterator itr) {
+  *itr = 0;
+  ++itr;
+  return itr;
+}
+
+inline Dense_Row::iterator
+Dense_Row::begin() {
+  return iterator(*this, 0);
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::begin() const {
+  return const_iterator(*this, 0);
+}
+
+inline Dense_Row::iterator
+Dense_Row::end() {
+  return iterator(*this, size());
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::end() const {
+  return const_iterator(*this, size());
+}
+
+inline Coefficient_traits::const_reference
+Dense_Row::get(dimension_type i) const {
+  return (*this)[i];
+}
+
+inline Dense_Row::iterator
+Dense_Row::find(dimension_type i) {
+  return iterator(*this, i);
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::find(dimension_type i) const {
+  return const_iterator(*this, i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::find(iterator itr, dimension_type i) {
+  (void)itr;
+  return iterator(*this, i);
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::find(const_iterator itr, dimension_type i) const {
+  (void)itr;
+  return const_iterator(*this, i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::lower_bound(dimension_type i) {
+  return find(i);
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::lower_bound(dimension_type i) const {
+  return find(i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::lower_bound(iterator itr, dimension_type i) {
+  return find(itr, i);
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::lower_bound(const_iterator itr, dimension_type i) const {
+  return find(itr, i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::insert(dimension_type i,
+                  Coefficient_traits::const_reference x) {
+  (*this)[i] = x;
+  return find(i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::insert(dimension_type i) {
+  return find(i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::insert(iterator itr, dimension_type i,
+                  Coefficient_traits::const_reference x) {
+  (void)itr;
+  (*this)[i] = x;
+  return find(i);
+}
+
+inline Dense_Row::iterator
+Dense_Row::insert(iterator itr, dimension_type i) {
+  (void)itr;
+  return find(i);
+}
+
+inline memory_size_type
+Dense_Row::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline memory_size_type
+Dense_Row::total_memory_in_bytes(dimension_type capacity) const {
+  return sizeof(*this) + external_memory_in_bytes(capacity);
+}
+
+/*! \relates Dense_Row */
+inline bool
+operator!=(const Dense_Row& x, const Dense_Row& y) {
+  return !(x == y);
+}
+
+
+inline
+Dense_Row::iterator::iterator()
+  : row(NULL), i(0) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::iterator::iterator(Dense_Row& row1,dimension_type i1)
+  : row(&row1), i(i1) {
+  PPL_ASSERT(OK());
+}
+
+inline Coefficient&
+Dense_Row::iterator::operator*() {
+  PPL_ASSERT(i < row->size());
+  return (*row)[i];
+}
+
+inline Coefficient_traits::const_reference
+Dense_Row::iterator::operator*() const {
+  PPL_ASSERT(i < row->size());
+  return (*row)[i];
+}
+
+inline dimension_type
+Dense_Row::iterator::index() const {
+  return i;
+}
+
+inline Dense_Row::iterator&
+Dense_Row::iterator::operator++() {
+  PPL_ASSERT(i < row->size());
+  ++i;
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline Dense_Row::iterator
+Dense_Row::iterator::operator++(int) {
+  iterator tmp(*this);
+  ++(*this);
+  return tmp;
+}
+
+inline Dense_Row::iterator&
+Dense_Row::iterator::operator--() {
+  PPL_ASSERT(i > 0);
+  --i;
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline Dense_Row::iterator
+Dense_Row::iterator::operator--(int) {
+  iterator tmp(*this);
+  --(*this);
+  return tmp;
+}
+
+inline bool
+Dense_Row::iterator::operator==(const iterator& x) const {
+  return (row == x.row) && (i == x.i);
+}
+
+inline bool
+Dense_Row::iterator::operator!=(const iterator& x) const {
+  return !(*this == x);
+}
+
+inline
+Dense_Row::iterator::operator const_iterator() const {
+  return const_iterator(*row, i);
+}
+
+inline bool
+Dense_Row::iterator::OK() const {
+  if (row == NULL)
+    return true;
+  // i can be equal to row.size() for past-the-end iterators
+  return (i <= row->size());
+}
+
+
+inline
+Dense_Row::const_iterator::const_iterator()
+  : row(NULL), i(0) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Dense_Row::const_iterator::const_iterator(const Dense_Row& row1,
+                                          dimension_type i1)
+  : row(&row1), i(i1) {
+  PPL_ASSERT(OK());
+}
+
+inline Coefficient_traits::const_reference
+Dense_Row::const_iterator::operator*() const {
+  PPL_ASSERT(i < row->size());
+  return (*row)[i];
+}
+
+inline dimension_type
+Dense_Row::const_iterator::index() const {
+  return i;
+}
+
+inline Dense_Row::const_iterator&
+Dense_Row::const_iterator::operator++() {
+  PPL_ASSERT(i < row->size());
+  ++i;
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::const_iterator::operator++(int) {
+  const_iterator tmp(*this);
+  ++(*this);
+  return tmp;
+}
+
+inline Dense_Row::const_iterator&
+Dense_Row::const_iterator::operator--() {
+  PPL_ASSERT(i > 0);
+  --i;
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+inline Dense_Row::const_iterator
+Dense_Row::const_iterator::operator--(int) {
+  const_iterator tmp(*this);
+  --(*this);
+  return tmp;
+}
+
+inline bool
+Dense_Row::const_iterator::operator==(const const_iterator& x) const {
+  return (row == x.row) && (i == x.i);
+}
+
+inline bool
+Dense_Row::const_iterator::operator!=(const const_iterator& x) const {
+  return !(*this == x);
+}
+
+inline bool
+Dense_Row::const_iterator::OK() const {
+  if (row == NULL)
+    return true;
+  // i can be equal to row.size() for past-the-end iterators
+  return (i <= row->size());
+}
+
+inline void
+linear_combine(Dense_Row& x, const Dense_Row& y,
+               Coefficient_traits::const_reference coeff1,
+               Coefficient_traits::const_reference coeff2) {
+  x.linear_combine(y, coeff1, coeff2);
+}
+
+inline void
+linear_combine(Dense_Row& x, const Dense_Row& y,
+               Coefficient_traits::const_reference c1,
+               Coefficient_traits::const_reference c2,
+               dimension_type start, dimension_type end) {
+  x.linear_combine(y, c1, c2, start, end);
+}
+
+/*! \relates Dense_Row */
+inline void
+swap(Dense_Row& x, Dense_Row& y) {
+  x.m_swap(y);
+}
+
+/*! \relates Dense_Row */
+inline void
+iter_swap(std::vector<Dense_Row>::iterator x,
+          std::vector<Dense_Row>::iterator y) {
+  swap(*x, *y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Dense_Row_inlines_hh)
diff --git a/src/Dense_Row_templates.hh b/src/Dense_Row_templates.hh
new file mode 100644
index 0000000..6108256
--- /dev/null
+++ b/src/Dense_Row_templates.hh
@@ -0,0 +1,56 @@
+/* Dense_Row class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Dense_Row_templates_hh
+#define PPL_Dense_Row_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+
+template <typename Func1, typename Func2>
+void
+Dense_Row::combine_needs_first(const Dense_Row& y, const Func1& /* f */,
+                               const Func2& g) {
+  for (dimension_type i = size(); i-- > 0; )
+    g((*this)[i], y[i]);
+}
+
+template <typename Func1, typename Func2>
+void
+Dense_Row::combine_needs_second(const Dense_Row& y, const Func1& g,
+                                const Func2& /* h */) {
+  for (dimension_type i = size(); i-- > 0; )
+    g((*this)[i], y[i]);
+}
+
+template <typename Func1, typename Func2, typename Func3>
+void
+Dense_Row::combine(const Dense_Row& y, const Func1& /* f */, const Func2& g,
+                   const Func3& /* h */) {
+  for (dimension_type i = size(); i-- > 0; )
+    g((*this)[i], y[i]);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Dense_Row_templates_hh)
diff --git a/src/Dense_Row_types.hh b/src/Dense_Row_types.hh
new file mode 100644
index 0000000..e4a31d5
--- /dev/null
+++ b/src/Dense_Row_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Dense_Row_types_hh
+#define PPL_Dense_Row_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Dense_Row;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Dense_Row_types_hh)
diff --git a/src/Determinate.defs.hh b/src/Determinate.defs.hh
deleted file mode 100644
index 86291f8..0000000
--- a/src/Determinate.defs.hh
+++ /dev/null
@@ -1,331 +0,0 @@
-/* Determinate class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Determinate_defs_hh
-#define PPL_Determinate_defs_hh
-
-#include "Determinate.types.hh"
-#include "Constraint_System.types.hh"
-#include "Congruence_System.types.hh"
-#include "Variable.defs.hh"
-#include "globals.types.hh"
-#include <iosfwd>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Determinate */
-template <typename PSET>
-void swap(Determinate<PSET>& x, Determinate<PSET>& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x and \p y are the same
-  COW-wrapped pointset.
-
-  \relates Determinate
-*/
-template <typename PSET>
-bool operator==(const Determinate<PSET>& x, const Determinate<PSET>& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x and \p y are different
-  COW-wrapped pointsets.
-
-  \relates Determinate
-*/
-template <typename PSET>
-bool operator!=(const Determinate<PSET>& x, const Determinate<PSET>& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Determinate */
-template <typename PSET>
-std::ostream&
-operator<<(std::ostream&, const Determinate<PSET>&);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-/*! \brief
-  A wrapper for PPL pointsets, providing them with a
-  <EM>determinate constraint system</EM> interface, as defined
-  in \ref Bag98 "[Bag98]".
-
-  The implementation uses a copy-on-write optimization, making the
-  class suitable for constructions, like the <EM>finite powerset</EM></A>
-  and <EM>ask-and-tell</EM> of \ref Bag98 "[Bag98]", that are likely
-  to perform many copies.
-
-  \ingroup PPL_CXX_interface
-*/
-template <typename PSET>
-class Parma_Polyhedra_Library::Determinate {
-public:
-  //! \name Constructors and Destructor
-  //@{
-
-  /*! \brief
-    Constructs a COW-wrapped object corresponding to the pointset \p pset.
-  */
-  Determinate(const PSET& pset);
-
-  /*! \brief
-    Constructs a COW-wrapped object corresponding to the pointset
-    defined by \p cs.
-  */
-  Determinate(const Constraint_System& cs);
-
-  /*! \brief
-    Constructs a COW-wrapped object corresponding to the pointset
-    defined by \p cgs.
-  */
-  Determinate(const Congruence_System& cgs);
-
-  //! Copy constructor.
-  Determinate(const Determinate& y);
-
-  //! Destructor.
-  ~Determinate();
-
-  //@} // Constructors and Destructor
-
-  //! \name Member Functions that Do Not Modify the Domain Element
-  //@{
-
-  //! Returns a const reference to the embedded pointset.
-  const PSET& pointset() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this embeds the universe
-    element \p PSET.
-  */
-  bool is_top() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this embeds the empty
-    element of \p PSET.
-  */
-  bool is_bottom() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this entails \p y.
-  bool definitely_entails(const Determinate& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y
-    are definitely equivalent.
-  */
-  bool is_definitely_equivalent_to(const Determinate& y) const;
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a lower bound to the size in bytes of the memory
-    managed by \p *this.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  /*!
-    Returns <CODE>true</CODE> if and only if this domain
-    has a nontrivial weakening operator.
-  */
-  static bool has_nontrivial_weakening();
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //@} // Member Functions that Do Not Modify the Domain Element
-
-
-  //! \name Member Functions that May Modify the Domain Element
-  //@{
-
-  //! Assigns to \p *this the upper bound of \p *this and \p y.
-  void upper_bound_assign(const Determinate& y);
-
-  //! Assigns to \p *this the meet of \p *this and \p y.
-  void meet_assign(const Determinate& y);
-
-  //! Assigns to \p *this the result of weakening \p *this with \p y.
-  void weakening_assign(const Determinate& y);
-
-  /*! \brief
-    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
-    of \p *this and \p y, taken in this order.
-  */
-  void concatenate_assign(const Determinate& y);
-
-  //! Returns a reference to the embedded element.
-  PSET& pointset();
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    On return from this method, the representation of \p *this
-    is not shared by different Determinate objects.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  void mutate();
-
-  //! Assignment operator.
-  Determinate& operator=(const Determinate& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Determinate& y);
-
-  //@} // Member Functions that May Modify the Domain Element
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! A function adapter for the Determinate class.
-  /*! \ingroup PPL_CXX_interface
-    It lifts a Binary_Operator_Assign function object, taking arguments
-    of type PSET, producing the corresponding function object taking
-    arguments of type Determinate<PSET>.
-
-    The template parameter Binary_Operator_Assign is supposed to
-    implement an <EM>apply and assign</EM> function, i.e., a function
-    having signature <CODE>void foo(PSET& x, const PSET& y)</CODE> that
-    applies an operator to \c x and \c y and assigns the result to \c x.
-    For instance, such a function object is obtained by
-    <CODE>std::mem_fun_ref(&C_Polyhedron::intersection_assign)</CODE>.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  template <typename Binary_Operator_Assign>
-  class Binary_Operator_Assign_Lifter {
-  public:
-    //! Explicit unary constructor.
-    explicit
-    Binary_Operator_Assign_Lifter(Binary_Operator_Assign op_assign);
-
-    //! Function-application operator.
-    void operator()(Determinate& x, const Determinate& y) const;
-
-  private:
-    //! The function object to be lifted.
-    Binary_Operator_Assign op_assign_;
-  };
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Helper function returning a Binary_Operator_Assign_Lifter object,
-    also allowing for the deduction of template arguments.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  template <typename Binary_Operator_Assign>
-  static Binary_Operator_Assign_Lifter<Binary_Operator_Assign>
-  lift_op_assign(Binary_Operator_Assign op_assign);
-
-private:
-  //! The possibly shared representation of a Determinate object.
-  /*! \ingroup PPL_CXX_interface
-    By adopting the <EM>copy-on-write</EM> technique, a single
-    representation of the base-level object may be shared by more than
-    one object of the class Determinate.
-  */
-  class Rep {
-  private:
-    /*! \brief
-      Count the number of references:
-      -   0: leaked, \p pset is non-const;
-      -   1: one reference, \p pset is non-const;
-      - > 1: more than one reference, \p pset is const.
-    */
-    mutable unsigned long references;
-
-    //! Private and unimplemented: assignment not allowed.
-    Rep& operator=(const Rep& y);
-
-    //! Private and unimplemented: copies not allowed.
-    Rep(const Rep& y);
-
-    //! Private and unimplemented: default construction not allowed.
-    Rep();
-
-  public:
-    //! The possibly shared, embedded pointset.
-    PSET pset;
-
-    /*! \brief
-      Builds a new representation by creating a pointset
-      of the specified kind, in the specified vector space.
-    */
-    Rep(dimension_type num_dimensions, Degenerate_Element kind);
-
-    //! Builds a new representation by copying the pointset \p p.
-    Rep(const PSET& p);
-
-    //! Builds a new representation by copying the constraints in \p cs.
-    Rep(const Constraint_System& cs);
-
-    //! Builds a new representation by copying the constraints in \p cgs.
-    Rep(const Congruence_System& cgs);
-
-    //! Destructor.
-    ~Rep();
-
-    //! Registers a new reference.
-    void new_reference() const;
-
-    /*! \brief
-      Unregisters one reference; returns <CODE>true</CODE> if and only if
-      the representation has become unreferenced.
-    */
-    bool del_reference() const;
-
-    //! True if and only if this representation is currently shared.
-    bool is_shared() const;
-
-    /*! \brief
-      Returns a lower bound to the total size in bytes of the memory
-      occupied by \p *this.
-    */
-    memory_size_type total_memory_in_bytes() const;
-
-    /*! \brief
-      Returns a lower bound to the size in bytes of the memory
-      managed by \p *this.
-    */
-    memory_size_type external_memory_in_bytes() const;
-  };
-
-  /*! \brief
-    A pointer to the possibly shared representation of
-    the base-level domain element.
-  */
-  Rep* prep;
-
-  friend bool
-  operator==<PSET>(const Determinate<PSET>& x, const Determinate<PSET>& y);
-
-  friend bool
-  operator!=<PSET>(const Determinate<PSET>& x, const Determinate<PSET>& y);
-};
-
-#include "Determinate.inlines.hh"
-
-#endif // !defined(PPL_Determinate_defs_hh)
diff --git a/src/Determinate.inlines.hh b/src/Determinate.inlines.hh
deleted file mode 100644
index 4915f34..0000000
--- a/src/Determinate.inlines.hh
+++ /dev/null
@@ -1,305 +0,0 @@
-/* Determinate class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Determinate_inlines_hh
-#define PPL_Determinate_inlines_hh 1
-
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-inline
-Determinate<PSET>::Rep::Rep(dimension_type num_dimensions,
-			  Degenerate_Element kind)
-  : references(0), pset(num_dimensions, kind) {
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Rep::Rep(const PSET& p)
-  : references(0), pset(p) {
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Rep::Rep(const Constraint_System& cs)
-  : references(0), pset(cs) {
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Rep::Rep(const Congruence_System& cgs)
-  : references(0), pset(cgs) {
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Rep::~Rep() {
-  PPL_ASSERT(references == 0);
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::Rep::new_reference() const {
-  ++references;
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::Rep::del_reference() const {
-  return --references == 0;
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::Rep::is_shared() const {
-  return references > 1;
-}
-
-template <typename PSET>
-inline memory_size_type
-Determinate<PSET>::Rep::external_memory_in_bytes() const {
-  return pset.external_memory_in_bytes();
-}
-
-template <typename PSET>
-inline memory_size_type
-Determinate<PSET>::Rep::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Determinate(const PSET& pset)
-  : prep(new Rep(pset)) {
-  prep->new_reference();
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Determinate(const Constraint_System& cs)
-  : prep(new Rep(cs)) {
-  prep->new_reference();
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Determinate(const Congruence_System& cgs)
-  : prep(new Rep(cgs)) {
-  prep->new_reference();
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::Determinate(const Determinate& y)
-  : prep(y.prep) {
-  prep->new_reference();
-}
-
-template <typename PSET>
-inline
-Determinate<PSET>::~Determinate() {
-  if (prep->del_reference())
-    delete prep;
-}
-
-template <typename PSET>
-inline Determinate<PSET>&
-Determinate<PSET>::operator=(const Determinate& y) {
-  y.prep->new_reference();
-  if (prep->del_reference())
-    delete prep;
-  prep = y.prep;
-  return *this;
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::m_swap(Determinate& y) {
-  using std::swap;
-  swap(prep, y.prep);
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::mutate() {
-  if (prep->is_shared()) {
-    Rep* new_prep = new Rep(prep->pset);
-    (void) prep->del_reference();
-    new_prep->new_reference();
-    prep = new_prep;
-  }
-}
-
-template <typename PSET>
-inline const PSET&
-Determinate<PSET>::pointset() const {
-  return prep->pset;
-}
-
-template <typename PSET>
-inline PSET&
-Determinate<PSET>::pointset() {
-  mutate();
-  return prep->pset;
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::upper_bound_assign(const Determinate& y) {
-  pointset().upper_bound_assign(y.pointset());
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::meet_assign(const Determinate& y) {
-  pointset().intersection_assign(y.pointset());
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::has_nontrivial_weakening() {
-  // FIXME: the following should be turned into a query to PSET.  This
-  // can be postponed until the time the ask-and-tell construction is
-  // revived.
-  return false;
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::weakening_assign(const Determinate& y) {
-  // FIXME: the following should be turned into a proper
-  // implementation.  This can be postponed until the time the
-  // ask-and-tell construction is revived.
-  pointset().difference_assign(y.pointset());
-}
-
-template <typename PSET>
-inline void
-Determinate<PSET>::concatenate_assign(const Determinate& y) {
-  pointset().concatenate_assign(y.pointset());
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::definitely_entails(const Determinate& y) const {
-  return prep == y.prep || y.prep->pset.contains(prep->pset);
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::is_definitely_equivalent_to(const Determinate& y) const {
-  return prep == y.prep || prep->pset == y.prep->pset;
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::is_top() const {
-  return prep->pset.is_universe();
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::is_bottom() const {
-  return prep->pset.is_empty();
-}
-
-template <typename PSET>
-inline memory_size_type
-Determinate<PSET>::external_memory_in_bytes() const {
-  return prep->total_memory_in_bytes();
-}
-
-template <typename PSET>
-inline memory_size_type
-Determinate<PSET>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename PSET>
-inline bool
-Determinate<PSET>::OK() const {
-  return prep->pset.OK();
-}
-
-namespace IO_Operators {
-
-/*! \relates Parma_Polyhedra_Library::Determinate */
-template <typename PSET>
-inline std::ostream&
-operator<<(std::ostream& s, const Determinate<PSET>& x) {
-  s << x.pointset();
-  return s;
-}
-
-} // namespace IO_Operators
-
-/*! \relates Determinate */
-template <typename PSET>
-inline bool
-operator==(const Determinate<PSET>& x, const Determinate<PSET>& y) {
-  return x.prep == y.prep || x.prep->pset == y.prep->pset;
-}
-
-/*! \relates Determinate */
-template <typename PSET>
-inline bool
-operator!=(const Determinate<PSET>& x, const Determinate<PSET>& y) {
-  return x.prep != y.prep && x.prep->pset != y.prep->pset;
-}
-
-template <typename PSET>
-template <typename Binary_Operator_Assign>
-inline
-Determinate<PSET>::Binary_Operator_Assign_Lifter<Binary_Operator_Assign>::
-Binary_Operator_Assign_Lifter(Binary_Operator_Assign op_assign)
-  : op_assign_(op_assign) {
-}
-
-template <typename PSET>
-template <typename Binary_Operator_Assign>
-inline void
-Determinate<PSET>::Binary_Operator_Assign_Lifter<Binary_Operator_Assign>::
-operator()(Determinate& x, const Determinate& y) const {
-  op_assign_(x.pointset(), y.pointset());
-}
-
-template <typename PSET>
-template <typename Binary_Operator_Assign>
-inline
-Determinate<PSET>::Binary_Operator_Assign_Lifter<Binary_Operator_Assign>
-Determinate<PSET>::lift_op_assign(Binary_Operator_Assign op_assign) {
-  return Binary_Operator_Assign_Lifter<Binary_Operator_Assign>(op_assign);
-}
-
-/*! \relates Determinate */
-template <typename PSET>
-inline void
-swap(Determinate<PSET>& x, Determinate<PSET>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Determinate_inlines_hh)
diff --git a/src/Determinate.types.hh b/src/Determinate.types.hh
deleted file mode 100644
index 9619fdb..0000000
--- a/src/Determinate.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Determinate_types_hh
-#define PPL_Determinate_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-class Determinate;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Determinate_types_hh)
diff --git a/src/Determinate_defs.hh b/src/Determinate_defs.hh
new file mode 100644
index 0000000..1db6792
--- /dev/null
+++ b/src/Determinate_defs.hh
@@ -0,0 +1,331 @@
+/* Determinate class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Determinate_defs_hh
+#define PPL_Determinate_defs_hh
+
+#include "Determinate_types.hh"
+#include "Constraint_System_types.hh"
+#include "Congruence_System_types.hh"
+#include "Variable_defs.hh"
+#include "globals_types.hh"
+#include <iosfwd>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Determinate */
+template <typename PSET>
+void swap(Determinate<PSET>& x, Determinate<PSET>& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x and \p y are the same
+  COW-wrapped pointset.
+
+  \relates Determinate
+*/
+template <typename PSET>
+bool operator==(const Determinate<PSET>& x, const Determinate<PSET>& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x and \p y are different
+  COW-wrapped pointsets.
+
+  \relates Determinate
+*/
+template <typename PSET>
+bool operator!=(const Determinate<PSET>& x, const Determinate<PSET>& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Determinate */
+template <typename PSET>
+std::ostream&
+operator<<(std::ostream&, const Determinate<PSET>&);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+/*! \brief
+  A wrapper for PPL pointsets, providing them with a
+  <EM>determinate constraint system</EM> interface, as defined
+  in \ref Bag98 "[Bag98]".
+
+  The implementation uses a copy-on-write optimization, making the
+  class suitable for constructions, like the <EM>finite powerset</EM>
+  and <EM>ask-and-tell</EM> of \ref Bag98 "[Bag98]", that are likely
+  to perform many copies.
+
+  \ingroup PPL_CXX_interface
+*/
+template <typename PSET>
+class Parma_Polyhedra_Library::Determinate {
+public:
+  //! \name Constructors and Destructor
+  //@{
+
+  /*! \brief
+    Constructs a COW-wrapped object corresponding to the pointset \p pset.
+  */
+  Determinate(const PSET& pset);
+
+  /*! \brief
+    Constructs a COW-wrapped object corresponding to the pointset
+    defined by \p cs.
+  */
+  Determinate(const Constraint_System& cs);
+
+  /*! \brief
+    Constructs a COW-wrapped object corresponding to the pointset
+    defined by \p cgs.
+  */
+  Determinate(const Congruence_System& cgs);
+
+  //! Copy constructor.
+  Determinate(const Determinate& y);
+
+  //! Destructor.
+  ~Determinate();
+
+  //@} // Constructors and Destructor
+
+  //! \name Member Functions that Do Not Modify the Domain Element
+  //@{
+
+  //! Returns a const reference to the embedded pointset.
+  const PSET& pointset() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this embeds the universe
+    element \p PSET.
+  */
+  bool is_top() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this embeds the empty
+    element of \p PSET.
+  */
+  bool is_bottom() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this entails \p y.
+  bool definitely_entails(const Determinate& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y
+    are definitely equivalent.
+  */
+  bool is_definitely_equivalent_to(const Determinate& y) const;
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a lower bound to the size in bytes of the memory
+    managed by \p *this.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  /*!
+    Returns <CODE>true</CODE> if and only if this domain
+    has a nontrivial weakening operator.
+  */
+  static bool has_nontrivial_weakening();
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //@} // Member Functions that Do Not Modify the Domain Element
+
+
+  //! \name Member Functions that May Modify the Domain Element
+  //@{
+
+  //! Assigns to \p *this the upper bound of \p *this and \p y.
+  void upper_bound_assign(const Determinate& y);
+
+  //! Assigns to \p *this the meet of \p *this and \p y.
+  void meet_assign(const Determinate& y);
+
+  //! Assigns to \p *this the result of weakening \p *this with \p y.
+  void weakening_assign(const Determinate& y);
+
+  /*! \brief
+    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
+    of \p *this and \p y, taken in this order.
+  */
+  void concatenate_assign(const Determinate& y);
+
+  //! Returns a reference to the embedded element.
+  PSET& pointset();
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    On return from this method, the representation of \p *this
+    is not shared by different Determinate objects.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  void mutate();
+
+  //! Assignment operator.
+  Determinate& operator=(const Determinate& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Determinate& y);
+
+  //@} // Member Functions that May Modify the Domain Element
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! A function adapter for the Determinate class.
+  /*! \ingroup PPL_CXX_interface
+    It lifts a Binary_Operator_Assign function object, taking arguments
+    of type PSET, producing the corresponding function object taking
+    arguments of type Determinate<PSET>.
+
+    The template parameter Binary_Operator_Assign is supposed to
+    implement an <EM>apply and assign</EM> function, i.e., a function
+    having signature <CODE>void foo(PSET& x, const PSET& y)</CODE> that
+    applies an operator to \c x and \c y and assigns the result to \c x.
+    For instance, such a function object is obtained by
+    <CODE>std::mem_fun_ref(&C_Polyhedron::intersection_assign)</CODE>.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  template <typename Binary_Operator_Assign>
+  class Binary_Operator_Assign_Lifter {
+  public:
+    //! Explicit unary constructor.
+    explicit
+    Binary_Operator_Assign_Lifter(Binary_Operator_Assign op_assign);
+
+    //! Function-application operator.
+    void operator()(Determinate& x, const Determinate& y) const;
+
+  private:
+    //! The function object to be lifted.
+    Binary_Operator_Assign op_assign_;
+  };
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Helper function returning a Binary_Operator_Assign_Lifter object,
+    also allowing for the deduction of template arguments.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  template <typename Binary_Operator_Assign>
+  static Binary_Operator_Assign_Lifter<Binary_Operator_Assign>
+  lift_op_assign(Binary_Operator_Assign op_assign);
+
+private:
+  //! The possibly shared representation of a Determinate object.
+  /*! \ingroup PPL_CXX_interface
+    By adopting the <EM>copy-on-write</EM> technique, a single
+    representation of the base-level object may be shared by more than
+    one object of the class Determinate.
+  */
+  class Rep {
+  private:
+    /*! \brief
+      Count the number of references:
+      -   0: leaked, \p pset is non-const;
+      -   1: one reference, \p pset is non-const;
+      - > 1: more than one reference, \p pset is const.
+    */
+    mutable unsigned long references;
+
+    //! Private and unimplemented: assignment not allowed.
+    Rep& operator=(const Rep& y);
+
+    //! Private and unimplemented: copies not allowed.
+    Rep(const Rep& y);
+
+    //! Private and unimplemented: default construction not allowed.
+    Rep();
+
+  public:
+    //! The possibly shared, embedded pointset.
+    PSET pset;
+
+    /*! \brief
+      Builds a new representation by creating a pointset
+      of the specified kind, in the specified vector space.
+    */
+    Rep(dimension_type num_dimensions, Degenerate_Element kind);
+
+    //! Builds a new representation by copying the pointset \p p.
+    Rep(const PSET& p);
+
+    //! Builds a new representation by copying the constraints in \p cs.
+    Rep(const Constraint_System& cs);
+
+    //! Builds a new representation by copying the constraints in \p cgs.
+    Rep(const Congruence_System& cgs);
+
+    //! Destructor.
+    ~Rep();
+
+    //! Registers a new reference.
+    void new_reference() const;
+
+    /*! \brief
+      Unregisters one reference; returns <CODE>true</CODE> if and only if
+      the representation has become unreferenced.
+    */
+    bool del_reference() const;
+
+    //! True if and only if this representation is currently shared.
+    bool is_shared() const;
+
+    /*! \brief
+      Returns a lower bound to the total size in bytes of the memory
+      occupied by \p *this.
+    */
+    memory_size_type total_memory_in_bytes() const;
+
+    /*! \brief
+      Returns a lower bound to the size in bytes of the memory
+      managed by \p *this.
+    */
+    memory_size_type external_memory_in_bytes() const;
+  };
+
+  /*! \brief
+    A pointer to the possibly shared representation of
+    the base-level domain element.
+  */
+  Rep* prep;
+
+  friend bool
+  operator==<PSET>(const Determinate<PSET>& x, const Determinate<PSET>& y);
+
+  friend bool
+  operator!=<PSET>(const Determinate<PSET>& x, const Determinate<PSET>& y);
+};
+
+#include "Determinate_inlines.hh"
+
+#endif // !defined(PPL_Determinate_defs_hh)
diff --git a/src/Determinate_inlines.hh b/src/Determinate_inlines.hh
new file mode 100644
index 0000000..43cdacb
--- /dev/null
+++ b/src/Determinate_inlines.hh
@@ -0,0 +1,305 @@
+/* Determinate class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Determinate_inlines_hh
+#define PPL_Determinate_inlines_hh 1
+
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+inline
+Determinate<PSET>::Rep::Rep(dimension_type num_dimensions,
+                          Degenerate_Element kind)
+  : references(0), pset(num_dimensions, kind) {
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Rep::Rep(const PSET& p)
+  : references(0), pset(p) {
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Rep::Rep(const Constraint_System& cs)
+  : references(0), pset(cs) {
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Rep::Rep(const Congruence_System& cgs)
+  : references(0), pset(cgs) {
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Rep::~Rep() {
+  PPL_ASSERT(references == 0);
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::Rep::new_reference() const {
+  ++references;
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::Rep::del_reference() const {
+  return --references == 0;
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::Rep::is_shared() const {
+  return references > 1;
+}
+
+template <typename PSET>
+inline memory_size_type
+Determinate<PSET>::Rep::external_memory_in_bytes() const {
+  return pset.external_memory_in_bytes();
+}
+
+template <typename PSET>
+inline memory_size_type
+Determinate<PSET>::Rep::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Determinate(const PSET& pset)
+  : prep(new Rep(pset)) {
+  prep->new_reference();
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Determinate(const Constraint_System& cs)
+  : prep(new Rep(cs)) {
+  prep->new_reference();
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Determinate(const Congruence_System& cgs)
+  : prep(new Rep(cgs)) {
+  prep->new_reference();
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::Determinate(const Determinate& y)
+  : prep(y.prep) {
+  prep->new_reference();
+}
+
+template <typename PSET>
+inline
+Determinate<PSET>::~Determinate() {
+  if (prep->del_reference())
+    delete prep;
+}
+
+template <typename PSET>
+inline Determinate<PSET>&
+Determinate<PSET>::operator=(const Determinate& y) {
+  y.prep->new_reference();
+  if (prep->del_reference())
+    delete prep;
+  prep = y.prep;
+  return *this;
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::m_swap(Determinate& y) {
+  using std::swap;
+  swap(prep, y.prep);
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::mutate() {
+  if (prep->is_shared()) {
+    Rep* const new_prep = new Rep(prep->pset);
+    (void) prep->del_reference();
+    new_prep->new_reference();
+    prep = new_prep;
+  }
+}
+
+template <typename PSET>
+inline const PSET&
+Determinate<PSET>::pointset() const {
+  return prep->pset;
+}
+
+template <typename PSET>
+inline PSET&
+Determinate<PSET>::pointset() {
+  mutate();
+  return prep->pset;
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::upper_bound_assign(const Determinate& y) {
+  pointset().upper_bound_assign(y.pointset());
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::meet_assign(const Determinate& y) {
+  pointset().intersection_assign(y.pointset());
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::has_nontrivial_weakening() {
+  // FIXME: the following should be turned into a query to PSET.  This
+  // can be postponed until the time the ask-and-tell construction is
+  // revived.
+  return false;
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::weakening_assign(const Determinate& y) {
+  // FIXME: the following should be turned into a proper
+  // implementation.  This can be postponed until the time the
+  // ask-and-tell construction is revived.
+  pointset().difference_assign(y.pointset());
+}
+
+template <typename PSET>
+inline void
+Determinate<PSET>::concatenate_assign(const Determinate& y) {
+  pointset().concatenate_assign(y.pointset());
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::definitely_entails(const Determinate& y) const {
+  return prep == y.prep || y.prep->pset.contains(prep->pset);
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::is_definitely_equivalent_to(const Determinate& y) const {
+  return prep == y.prep || prep->pset == y.prep->pset;
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::is_top() const {
+  return prep->pset.is_universe();
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::is_bottom() const {
+  return prep->pset.is_empty();
+}
+
+template <typename PSET>
+inline memory_size_type
+Determinate<PSET>::external_memory_in_bytes() const {
+  return prep->total_memory_in_bytes();
+}
+
+template <typename PSET>
+inline memory_size_type
+Determinate<PSET>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename PSET>
+inline bool
+Determinate<PSET>::OK() const {
+  return prep->pset.OK();
+}
+
+namespace IO_Operators {
+
+/*! \relates Parma_Polyhedra_Library::Determinate */
+template <typename PSET>
+inline std::ostream&
+operator<<(std::ostream& s, const Determinate<PSET>& x) {
+  s << x.pointset();
+  return s;
+}
+
+} // namespace IO_Operators
+
+/*! \relates Determinate */
+template <typename PSET>
+inline bool
+operator==(const Determinate<PSET>& x, const Determinate<PSET>& y) {
+  return x.prep == y.prep || x.prep->pset == y.prep->pset;
+}
+
+/*! \relates Determinate */
+template <typename PSET>
+inline bool
+operator!=(const Determinate<PSET>& x, const Determinate<PSET>& y) {
+  return x.prep != y.prep && x.prep->pset != y.prep->pset;
+}
+
+template <typename PSET>
+template <typename Binary_Operator_Assign>
+inline
+Determinate<PSET>::Binary_Operator_Assign_Lifter<Binary_Operator_Assign>::
+Binary_Operator_Assign_Lifter(Binary_Operator_Assign op_assign)
+  : op_assign_(op_assign) {
+}
+
+template <typename PSET>
+template <typename Binary_Operator_Assign>
+inline void
+Determinate<PSET>::Binary_Operator_Assign_Lifter<Binary_Operator_Assign>::
+operator()(Determinate& x, const Determinate& y) const {
+  op_assign_(x.pointset(), y.pointset());
+}
+
+template <typename PSET>
+template <typename Binary_Operator_Assign>
+inline
+Determinate<PSET>::Binary_Operator_Assign_Lifter<Binary_Operator_Assign>
+Determinate<PSET>::lift_op_assign(Binary_Operator_Assign op_assign) {
+  return Binary_Operator_Assign_Lifter<Binary_Operator_Assign>(op_assign);
+}
+
+/*! \relates Determinate */
+template <typename PSET>
+inline void
+swap(Determinate<PSET>& x, Determinate<PSET>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Determinate_inlines_hh)
diff --git a/src/Determinate_types.hh b/src/Determinate_types.hh
new file mode 100644
index 0000000..2c79f6f
--- /dev/null
+++ b/src/Determinate_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Determinate_types_hh
+#define PPL_Determinate_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+class Determinate;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Determinate_types_hh)
diff --git a/src/Difference_Floating_Point_Expression.defs.hh b/src/Difference_Floating_Point_Expression.defs.hh
deleted file mode 100644
index 00cfa24..0000000
--- a/src/Difference_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,221 +0,0 @@
-/* Declarations for the Difference_Floating_Point_Expression class and
-   its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Difference_Floating_Point_Expression_defs_hh
-#define PPL_Difference_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Difference_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Difference_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-void
-swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Difference Floating Point Expression.
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of difference floating-point expressions
-
-  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
-  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
-  be two linear forms, \f$\aslf\f$ and \f$\adlf\f$ two sound abstract
-  operators on linear form such that:
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v\right)
-  \aslf
-  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
-  =
-  \left(i \asifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v}\right)v,
-  \f]
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v\right)
-  \adlf
-  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
-  =
-  \left(i \adifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \adifp i'_{v}\right)v.
-  \f]
-  Given an expression \f$e_{1} \ominus e_{2}\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$,  we construct the interval linear form
-  \f$\linexprenv{e_{1} \ominus e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
-  on \f$\cV\f$ as follows:
-  \f[
-  \linexprenv{e_{1} \ominus e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \adlf
-  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  \aslf
-  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)
-  \aslf
-  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)
-  \aslf
-  mf_{\mathbf{f}}[-1, 1]
-  \f]
-  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
-  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
-  on \f$l\f$ and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
-  <CODE>Floating_Point_Expression::absolute_error</CODE>.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Difference_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with two parameters: builds the difference floating point
-    expression corresponding to \p x \f$\ominus\f$ \p y.
-  */
-  Difference_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
-           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
-
-  //! Destructor.
-  ~Difference_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Note that all variables occuring in the expressions represented
-    by \p first_operand and \p second_operand MUST have an associated value in
-    \p int_store. If this precondition is not met, calling the method
-    causes an undefined behavior.
-
-    See the class description for a detailed explanation of how \p result
-    is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Difference_Floating_Point_Expression<FP_Interval_Type,
-                                                   FP_Format>& y);
-
-private:
-
-  //! Pointer to the first operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
-  //! Pointer to the second operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Difference_Floating_Point_Expression(
-         const Difference_Floating_Point_Expression<FP_Interval_Type,
-                                                    FP_Format>& e);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited asssignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
-  operator=(const Difference_Floating_Point_Expression<FP_Interval_Type,
-	                                               FP_Format>& e);
-
-
-}; // class Difference_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Difference_Floating_Point_Expression.inlines.hh"
-#include "Difference_Floating_Point_Expression.templates.hh"
-
-#endif // !defined(PPL_Difference_Floating_Point_Expression_defs_hh)
diff --git a/src/Difference_Floating_Point_Expression.inlines.hh b/src/Difference_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 63dc958..0000000
--- a/src/Difference_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,70 +0,0 @@
-/* Difference_Floating_Point_Expression class implementation: inline
-   functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Difference_Floating_Point_Expression_inlines_hh
-#define PPL_Difference_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::Difference_Floating_Point_Expression(
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y)
-  : first_operand(x), second_operand(y){
-  assert(x != 0);
-  assert(y != 0);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::~Difference_Floating_Point_Expression() {
-  delete first_operand;
-  delete second_operand;
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  using std::swap;
-  swap(first_operand, y.first_operand);
-  swap(second_operand, y.second_operand);
-}
-
-/*! \relates Difference_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Difference_Floating_Point_Expression_inlines_hh)
diff --git a/src/Difference_Floating_Point_Expression.templates.hh b/src/Difference_Floating_Point_Expression.templates.hh
deleted file mode 100644
index 03d0ae0..0000000
--- a/src/Difference_Floating_Point_Expression.templates.hh
+++ /dev/null
@@ -1,53 +0,0 @@
-/* Difference_Floating_Point_Expression class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Difference_Floating_Point_Expression_templates_hh
-#define PPL_Difference_Floating_Point_Expression_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-bool Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store& int_store,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  if (!first_operand->linearize(int_store, lf_store, result))
-    return false;
-  FP_Linear_Form rel_error;
-  relative_error(result, rel_error);
-  result += rel_error;
-  FP_Linear_Form linearized_second_operand;
-  if (!second_operand->linearize(int_store, lf_store,
-                      linearized_second_operand))
-    return false;
-  result -= linearized_second_operand;
-  relative_error(linearized_second_operand, rel_error);
-  result += rel_error;
-  result += this->absolute_error;
-  return !this->overflows(result);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Difference_Floating_Point_Expression_templates_hh)
diff --git a/src/Difference_Floating_Point_Expression.types.hh b/src/Difference_Floating_Point_Expression.types.hh
deleted file mode 100644
index 5e228e4..0000000
--- a/src/Difference_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Difference_Floating_Point_Expression_types_hh
-#define PPL_Difference_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Difference_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Difference_Floating_Point_Expression_types_hh)
diff --git a/src/Difference_Floating_Point_Expression_defs.hh b/src/Difference_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..c2e6ef8
--- /dev/null
+++ b/src/Difference_Floating_Point_Expression_defs.hh
@@ -0,0 +1,221 @@
+/* Declarations for the Difference_Floating_Point_Expression class and
+   its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Difference_Floating_Point_Expression_defs_hh
+#define PPL_Difference_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Difference_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Difference_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+void
+swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Difference Floating Point Expression.
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of difference floating-point expressions
+
+  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
+  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
+  be two linear forms, \f$\aslf\f$ and \f$\adlf\f$ two sound abstract
+  operators on linear form such that:
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v\right)
+  \aslf
+  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
+  =
+  \left(i \asifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v}\right)v,
+  \f]
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v\right)
+  \adlf
+  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
+  =
+  \left(i \adifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \adifp i'_{v}\right)v.
+  \f]
+  Given an expression \f$e_{1} \ominus e_{2}\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$,  we construct the interval linear form
+  \f$\linexprenv{e_{1} \ominus e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
+  on \f$\cV\f$ as follows:
+  \f[
+  \linexprenv{e_{1} \ominus e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \adlf
+  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  \aslf
+  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)
+  \aslf
+  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)
+  \aslf
+  mf_{\mathbf{f}}[-1, 1]
+  \f]
+  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
+  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
+  on \f$l\f$ and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
+  <CODE>Floating_Point_Expression::absolute_error</CODE>.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Difference_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::boundary_type from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with two parameters: builds the difference floating point
+    expression corresponding to \p x \f$\ominus\f$ \p y.
+  */
+  Difference_Floating_Point_Expression(
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
+
+  //! Destructor.
+  ~Difference_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Note that all variables occuring in the expressions represented
+    by \p first_operand and \p second_operand MUST have an associated value in
+    \p int_store. If this precondition is not met, calling the method
+    causes an undefined behavior.
+
+    See the class description for a detailed explanation of how \p result
+    is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Difference_Floating_Point_Expression<FP_Interval_Type,
+                                                   FP_Format>& y);
+
+private:
+
+  //! Pointer to the first operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
+  //! Pointer to the second operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Difference_Floating_Point_Expression(
+         const Difference_Floating_Point_Expression<FP_Interval_Type,
+                                                    FP_Format>& e);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited asssignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
+  operator=(const Difference_Floating_Point_Expression<FP_Interval_Type,
+                                                       FP_Format>& e);
+
+
+}; // class Difference_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Difference_Floating_Point_Expression_inlines.hh"
+#include "Difference_Floating_Point_Expression_templates.hh"
+
+#endif // !defined(PPL_Difference_Floating_Point_Expression_defs_hh)
diff --git a/src/Difference_Floating_Point_Expression_inlines.hh b/src/Difference_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..ac7daf2
--- /dev/null
+++ b/src/Difference_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,70 @@
+/* Difference_Floating_Point_Expression class implementation: inline
+   functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Difference_Floating_Point_Expression_inlines_hh
+#define PPL_Difference_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::Difference_Floating_Point_Expression(
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y)
+  : first_operand(x), second_operand(y){
+  assert(x != 0);
+  assert(y != 0);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::~Difference_Floating_Point_Expression() {
+  delete first_operand;
+  delete second_operand;
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  using std::swap;
+  swap(first_operand, y.first_operand);
+  swap(second_operand, y.second_operand);
+}
+
+/*! \relates Difference_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Difference_Floating_Point_Expression_inlines_hh)
diff --git a/src/Difference_Floating_Point_Expression_templates.hh b/src/Difference_Floating_Point_Expression_templates.hh
new file mode 100644
index 0000000..9923c5a
--- /dev/null
+++ b/src/Difference_Floating_Point_Expression_templates.hh
@@ -0,0 +1,53 @@
+/* Difference_Floating_Point_Expression class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Difference_Floating_Point_Expression_templates_hh
+#define PPL_Difference_Floating_Point_Expression_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+bool Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store& int_store,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  if (!first_operand->linearize(int_store, lf_store, result))
+    return false;
+  FP_Linear_Form rel_error;
+  relative_error(result, rel_error);
+  result += rel_error;
+  FP_Linear_Form linearized_second_operand;
+  if (!second_operand->linearize(int_store, lf_store,
+                      linearized_second_operand))
+    return false;
+  result -= linearized_second_operand;
+  relative_error(linearized_second_operand, rel_error);
+  result += rel_error;
+  result += this->absolute_error;
+  return !this->overflows(result);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Difference_Floating_Point_Expression_templates_hh)
diff --git a/src/Difference_Floating_Point_Expression_types.hh b/src/Difference_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..2a435e7
--- /dev/null
+++ b/src/Difference_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Difference_Floating_Point_Expression_types_hh
+#define PPL_Difference_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Difference_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Difference_Floating_Point_Expression_types_hh)
diff --git a/src/Division_Floating_Point_Expression.defs.hh b/src/Division_Floating_Point_Expression.defs.hh
deleted file mode 100644
index 623b9e6..0000000
--- a/src/Division_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,238 +0,0 @@
-/* Declarations for the Division_Floating_Point_Expression class and its
-   constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Division_Floating_Point_Expression_defs_hh
-#define PPL_Division_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Division_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Division_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-void swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-	  Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Division Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearizationd of division floating-point expressions
-
-  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
-  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
-  be two linear forms, \f$\aslf\f$ and \f$\adivlf\f$ two sound abstract
-  operator on linear forms such that:
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v\right)
-  \aslf
-  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
-  =
-  \left(i \asifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v}\right)v,
-  \f]
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v\right)
-  \adivlf
-  i'
-  =
-  \left(i \adivifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \adivifp i'\right)v.
-  \f]
-  Given an expression \f$e_{1} \oslash [a, b]\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$,
-  we construct the interval linear form
-  \f$
-  \linexprenv{e_{1} \oslash [a, b]}{\rho^{\#}}{\rho^{\#}_l}
-  \f$
-  as follows:
-  \f[
-  \linexprenv{e_{1} \oslash [a, b]}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \adivlf
-  [a, b]\right)
-  \aslf
-  \left(\varepsilon_{\mathbf{f}}\left(
-  \linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)
-  \adivlf
-  [a, b]\right)
-  \aslf
-  mf_{\mathbf{f}}[-1, 1],
-  \f]
-  given an expression \f$e_{1} \oslash e_{2}\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval linear form
-  \f$\linexprenv{e_{1} \oslash e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
-  as follows:
-  \f[
-  \linexprenv{e_{1} \oslash e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \linexprenv{e_{1} \oslash \iota\left(
-  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)\rho^{\#}}{\rho^{\#}}{\rho^{\#}_l},
-  \f]
-  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
-  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
-  on \f$l\f$, \f$\iota(l)\rho^{\#}\f$ is the linear form computed by calling
-  method <CODE>Floating_Point_Expression::intervalize</CODE> on \f$l\f$
-  and \f$\rho^{\#}\f$, and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
-  <CODE>Floating_Point_Expression::absolute_error</CODE>.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Division_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with two parameters: builds the division floating point
-    expression corresponding to \p num \f$\oslash\f$ \p den.
-  */
-  Division_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const num,
-           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const den);
-
-  //! Destructor.
-  ~Division_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Note that all variables occuring in the expressions represented
-    by \p first_operand and \p second_operand MUST have an associated value in
-    \p int_store. If this precondition is not met, calling the method
-    causes an undefined behavior.
-
-    See the class description for a detailed explanation of how \p result
-    is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Division_Floating_Point_Expression<FP_Interval_Type,
-	                                         FP_Format>& y);
-
-private:
-
-  //! Pointer to the first operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
-  //! Pointer to the second operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Copy constructor: temporary inhibited.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Division_Floating_Point_Expression(
-         const Division_Floating_Point_Expression<FP_Interval_Type,
-                                                  FP_Format>& e);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Assignment operator: temporary inhibited.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
-  operator=(const Division_Floating_Point_Expression<FP_Interval_Type,
-	    FP_Format>& e);
-
-
-}; // class Division_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Division_Floating_Point_Expression.inlines.hh"
-#include "Division_Floating_Point_Expression.templates.hh"
-
-#endif // !defined(PPL_Division_Floating_Point_Expression_defs_hh)
diff --git a/src/Division_Floating_Point_Expression.inlines.hh b/src/Division_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 7f6de8d..0000000
--- a/src/Division_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,69 +0,0 @@
-/* Division_Floating_Point_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Division_Floating_Point_Expression_inlines_hh
-#define PPL_Division_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::Division_Floating_Point_Expression(
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const num,
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const den)
-  : first_operand(num), second_operand(den) {
-  assert(num != 0);
-  assert(den != 0);
- }
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::~Division_Floating_Point_Expression() {
-  delete first_operand;
-  delete second_operand;
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  using std::swap;
-  swap(first_operand, y.first_operand);
-  swap(second_operand, y.second_operand);
-}
-
-/*! \relates Division_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Division_Floating_Point_Expression_inlines_hh)
diff --git a/src/Division_Floating_Point_Expression.templates.hh b/src/Division_Floating_Point_Expression.templates.hh
deleted file mode 100644
index 3c3696b..0000000
--- a/src/Division_Floating_Point_Expression.templates.hh
+++ /dev/null
@@ -1,61 +0,0 @@
-/* Division_Floating_Point_Expression class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Division_Floating_Point_Expression_templates_hh
-#define PPL_Division_Floating_Point_Expression_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-bool Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store& int_store,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  FP_Linear_Form linearized_second_operand;
-  if (!second_operand->linearize(int_store, lf_store,
-                                linearized_second_operand))
-    return false;
-  FP_Interval_Type intervalized_second_operand;
-  this->intervalize(linearized_second_operand, int_store,
-                    intervalized_second_operand);
-
-  // Check if we may divide by zero.
-  if (intervalized_second_operand.lower() <= 0
-      && intervalized_second_operand.upper() >= 0)
-    return false;
-
-  if (!first_operand->linearize(int_store, lf_store, result))
-    return false;
-  FP_Linear_Form rel_error;
-  relative_error(result, rel_error);
-  result /= intervalized_second_operand;
-  rel_error /= intervalized_second_operand;
-  result += rel_error;
-  result += this->absolute_error;
-  return !this->overflows(result);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Division_Floating_Point_Expression_templates_hh)
diff --git a/src/Division_Floating_Point_Expression.types.hh b/src/Division_Floating_Point_Expression.types.hh
deleted file mode 100644
index 5931d06..0000000
--- a/src/Division_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Division_Floating_Point_Expression_types_hh
-#define PPL_Division_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Division_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Division_Floating_Point_Expression_types_hh)
diff --git a/src/Division_Floating_Point_Expression_defs.hh b/src/Division_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..ed9751b
--- /dev/null
+++ b/src/Division_Floating_Point_Expression_defs.hh
@@ -0,0 +1,237 @@
+/* Declarations for the Division_Floating_Point_Expression class and its
+   constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Division_Floating_Point_Expression_defs_hh
+#define PPL_Division_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Division_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Division_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+void swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+          Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Division Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearizationd of division floating-point expressions
+
+  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
+  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
+  be two linear forms, \f$\aslf\f$ and \f$\adivlf\f$ two sound abstract
+  operator on linear forms such that:
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v\right)
+  \aslf
+  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
+  =
+  \left(i \asifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v}\right)v,
+  \f]
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v\right)
+  \adivlf
+  i'
+  =
+  \left(i \adivifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \adivifp i'\right)v.
+  \f]
+  Given an expression \f$e_{1} \oslash [a, b]\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$,
+  we construct the interval linear form
+  \f$
+  \linexprenv{e_{1} \oslash [a, b]}{\rho^{\#}}{\rho^{\#}_l}
+  \f$
+  as follows:
+  \f[
+  \linexprenv{e_{1} \oslash [a, b]}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \adivlf
+  [a, b]\right)
+  \aslf
+  \left(\varepsilon_{\mathbf{f}}\left(
+  \linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)
+  \adivlf
+  [a, b]\right)
+  \aslf
+  mf_{\mathbf{f}}[-1, 1],
+  \f]
+  given an expression \f$e_{1} \oslash e_{2}\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval linear form
+  \f$\linexprenv{e_{1} \oslash e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
+  as follows:
+  \f[
+  \linexprenv{e_{1} \oslash e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \linexprenv{e_{1} \oslash \iota\left(
+  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)\rho^{\#}}{\rho^{\#}}{\rho^{\#}_l},
+  \f]
+  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
+  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
+  on \f$l\f$, \f$\iota(l)\rho^{\#}\f$ is the linear form computed by calling
+  method <CODE>Floating_Point_Expression::intervalize</CODE> on \f$l\f$
+  and \f$\rho^{\#}\f$, and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
+  <CODE>Floating_Point_Expression::absolute_error</CODE>.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Division_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::boundary_type from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with two parameters: builds the division floating point
+    expression corresponding to \p num \f$\oslash\f$ \p den.
+  */
+  Division_Floating_Point_Expression(
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const num,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const den);
+
+  //! Destructor.
+  ~Division_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Note that all variables occuring in the expressions represented
+    by \p first_operand and \p second_operand MUST have an associated value in
+    \p int_store. If this precondition is not met, calling the method
+    causes an undefined behavior.
+
+    See the class description for a detailed explanation of how \p result
+    is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Division_Floating_Point_Expression<FP_Interval_Type,
+                                                 FP_Format>& y);
+
+private:
+
+  //! Pointer to the first operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
+  //! Pointer to the second operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Copy constructor: temporary inhibited.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Division_Floating_Point_Expression(
+         const Division_Floating_Point_Expression<FP_Interval_Type,
+                                                  FP_Format>& e);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Assignment operator: temporary inhibited.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
+  operator=(const Division_Floating_Point_Expression<FP_Interval_Type,
+            FP_Format>& e);
+
+}; // class Division_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Division_Floating_Point_Expression_inlines.hh"
+#include "Division_Floating_Point_Expression_templates.hh"
+
+#endif // !defined(PPL_Division_Floating_Point_Expression_defs_hh)
diff --git a/src/Division_Floating_Point_Expression_inlines.hh b/src/Division_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..c6ed4df
--- /dev/null
+++ b/src/Division_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,69 @@
+/* Division_Floating_Point_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Division_Floating_Point_Expression_inlines_hh
+#define PPL_Division_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::Division_Floating_Point_Expression(
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const num,
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const den)
+  : first_operand(num), second_operand(den) {
+  assert(num != 0);
+  assert(den != 0);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::~Division_Floating_Point_Expression() {
+  delete first_operand;
+  delete second_operand;
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  using std::swap;
+  swap(first_operand, y.first_operand);
+  swap(second_operand, y.second_operand);
+}
+
+/*! \relates Division_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Division_Floating_Point_Expression_inlines_hh)
diff --git a/src/Division_Floating_Point_Expression_templates.hh b/src/Division_Floating_Point_Expression_templates.hh
new file mode 100644
index 0000000..3feb26a
--- /dev/null
+++ b/src/Division_Floating_Point_Expression_templates.hh
@@ -0,0 +1,61 @@
+/* Division_Floating_Point_Expression class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Division_Floating_Point_Expression_templates_hh
+#define PPL_Division_Floating_Point_Expression_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+bool Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store& int_store,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  FP_Linear_Form linearized_second_operand;
+  if (!second_operand->linearize(int_store, lf_store,
+                                linearized_second_operand))
+    return false;
+  FP_Interval_Type intervalized_second_operand;
+  this->intervalize(linearized_second_operand, int_store,
+                    intervalized_second_operand);
+
+  // Check if we may divide by zero.
+  if (intervalized_second_operand.lower() <= 0
+      && intervalized_second_operand.upper() >= 0)
+    return false;
+
+  if (!first_operand->linearize(int_store, lf_store, result))
+    return false;
+  FP_Linear_Form rel_error;
+  relative_error(result, rel_error);
+  result /= intervalized_second_operand;
+  rel_error /= intervalized_second_operand;
+  result += rel_error;
+  result += this->absolute_error;
+  return !this->overflows(result);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Division_Floating_Point_Expression_templates_hh)
diff --git a/src/Division_Floating_Point_Expression_types.hh b/src/Division_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..bfd2010
--- /dev/null
+++ b/src/Division_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Division_Floating_Point_Expression_types_hh
+#define PPL_Division_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Division_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Division_Floating_Point_Expression_types_hh)
diff --git a/src/Doubly_Linked_Object.defs.hh b/src/Doubly_Linked_Object.defs.hh
deleted file mode 100644
index 96bc01c..0000000
--- a/src/Doubly_Linked_Object.defs.hh
+++ /dev/null
@@ -1,65 +0,0 @@
-/* Doubly_Linked_Object class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Doubly_Linked_Object_defs_hh
-#define PPL_Doubly_Linked_Object_defs_hh 1
-
-#include "Doubly_Linked_Object.types.hh"
-#include "EList.types.hh"
-#include "EList_Iterator.types.hh"
-
-//! A (base) class for doubly linked objects.
-class Parma_Polyhedra_Library::Implementation::Watchdog::Doubly_Linked_Object {
-public:
-  //! Default constructor.
-  Doubly_Linked_Object();
-
-  //! Creates a chain element with forward link \p f and backward link \p b.
-  Doubly_Linked_Object(Doubly_Linked_Object* f, Doubly_Linked_Object* b);
-
-  //! Inserts \p y before \p *this.
-  void insert_before(Doubly_Linked_Object& y);
-
-  //! Inserts \p y after \p *this.
-  void insert_after(Doubly_Linked_Object& y);
-
-  //! Erases \p *this from the chain and returns a pointer to the next element.
-  Doubly_Linked_Object* erase();
-
-  //! Erases \p *this from the chain.
-  ~Doubly_Linked_Object();
-
-private:
-  //! Forward link.
-  Doubly_Linked_Object* next;
-
-  //! Backward link.
-  Doubly_Linked_Object* prev;
-
-  template <typename T> friend class EList;
-  template <typename T> friend class EList_Iterator;
-};
-
-#include "Doubly_Linked_Object.inlines.hh"
-
-#endif // !defined(PPL_Doubly_Linked_Object_defs_hh)
diff --git a/src/Doubly_Linked_Object.inlines.hh b/src/Doubly_Linked_Object.inlines.hh
deleted file mode 100644
index 86d075f..0000000
--- a/src/Doubly_Linked_Object.inlines.hh
+++ /dev/null
@@ -1,78 +0,0 @@
-/* Doubly_Linked_Object class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Doubly_Linked_Object_inlines_hh
-#define PPL_Doubly_Linked_Object_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-inline
-Doubly_Linked_Object::Doubly_Linked_Object() {
-}
-
-inline
-Doubly_Linked_Object::Doubly_Linked_Object(Doubly_Linked_Object* f,
-					   Doubly_Linked_Object* b)
-  : next(f),
-    prev(b) {
-}
-
-inline void
-Doubly_Linked_Object::insert_before(Doubly_Linked_Object& y) {
-  y.next = this;
-  y.prev = prev;
-  prev->next = &y;
-  prev = &y;
-}
-
-inline void
-Doubly_Linked_Object::insert_after(Doubly_Linked_Object& y) {
-  y.next = next;
-  y.prev = this;
-  next->prev = &y;
-  next = &y;
-}
-
-inline Doubly_Linked_Object*
-Doubly_Linked_Object::erase() {
-  next->prev = prev;
-  prev->next = next;
-  return next;
-}
-
-inline
-Doubly_Linked_Object::~Doubly_Linked_Object() {
-  erase();
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Doubly_Linked_Object_inlines_hh)
diff --git a/src/Doubly_Linked_Object.types.hh b/src/Doubly_Linked_Object.types.hh
deleted file mode 100644
index 41be14f..0000000
--- a/src/Doubly_Linked_Object.types.hh
+++ /dev/null
@@ -1,30 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Doubly_Linked_Object_types_hh
-#define PPL_Doubly_Linked_Object_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-class Doubly_Linked_Object;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Doubly_Linked_Object_types_hh)
diff --git a/src/Doubly_Linked_Object_defs.hh b/src/Doubly_Linked_Object_defs.hh
new file mode 100644
index 0000000..bb6b4f2
--- /dev/null
+++ b/src/Doubly_Linked_Object_defs.hh
@@ -0,0 +1,65 @@
+/* Doubly_Linked_Object class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Doubly_Linked_Object_defs_hh
+#define PPL_Doubly_Linked_Object_defs_hh 1
+
+#include "Doubly_Linked_Object_types.hh"
+#include "EList_types.hh"
+#include "EList_Iterator_types.hh"
+
+//! A (base) class for doubly linked objects.
+class Parma_Polyhedra_Library::Implementation::Doubly_Linked_Object {
+public:
+  //! Default constructor.
+  Doubly_Linked_Object();
+
+  //! Creates a chain element with forward link \p f and backward link \p b.
+  Doubly_Linked_Object(Doubly_Linked_Object* f, Doubly_Linked_Object* b);
+
+  //! Inserts \p y before \p *this.
+  void insert_before(Doubly_Linked_Object& y);
+
+  //! Inserts \p y after \p *this.
+  void insert_after(Doubly_Linked_Object& y);
+
+  //! Erases \p *this from the chain and returns a pointer to the next element.
+  Doubly_Linked_Object* erase();
+
+  //! Erases \p *this from the chain.
+  ~Doubly_Linked_Object();
+
+private:
+  //! Forward link.
+  Doubly_Linked_Object* next;
+
+  //! Backward link.
+  Doubly_Linked_Object* prev;
+
+  template <typename T> friend class EList;
+  template <typename T> friend class EList_Iterator;
+};
+
+#include "Doubly_Linked_Object_inlines.hh"
+
+#endif // !defined(PPL_Doubly_Linked_Object_defs_hh)
diff --git a/src/Doubly_Linked_Object_inlines.hh b/src/Doubly_Linked_Object_inlines.hh
new file mode 100644
index 0000000..147c6e3
--- /dev/null
+++ b/src/Doubly_Linked_Object_inlines.hh
@@ -0,0 +1,74 @@
+/* Doubly_Linked_Object class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Doubly_Linked_Object_inlines_hh
+#define PPL_Doubly_Linked_Object_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+inline
+Doubly_Linked_Object::Doubly_Linked_Object() {
+}
+
+inline
+Doubly_Linked_Object::Doubly_Linked_Object(Doubly_Linked_Object* f,
+                                           Doubly_Linked_Object* b)
+  : next(f),
+    prev(b) {
+}
+
+inline void
+Doubly_Linked_Object::insert_before(Doubly_Linked_Object& y) {
+  y.next = this;
+  y.prev = prev;
+  prev->next = &y;
+  prev = &y;
+}
+
+inline void
+Doubly_Linked_Object::insert_after(Doubly_Linked_Object& y) {
+  y.next = next;
+  y.prev = this;
+  next->prev = &y;
+  next = &y;
+}
+
+inline Doubly_Linked_Object*
+Doubly_Linked_Object::erase() {
+  next->prev = prev;
+  prev->next = next;
+  return next;
+}
+
+inline
+Doubly_Linked_Object::~Doubly_Linked_Object() {
+  erase();
+}
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Doubly_Linked_Object_inlines_hh)
diff --git a/src/Doubly_Linked_Object_types.hh b/src/Doubly_Linked_Object_types.hh
new file mode 100644
index 0000000..2e3cac1
--- /dev/null
+++ b/src/Doubly_Linked_Object_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Doubly_Linked_Object_types_hh
+#define PPL_Doubly_Linked_Object_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+class Doubly_Linked_Object;
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Doubly_Linked_Object_types_hh)
diff --git a/src/EList.defs.hh b/src/EList.defs.hh
deleted file mode 100644
index f6e5e24..0000000
--- a/src/EList.defs.hh
+++ /dev/null
@@ -1,90 +0,0 @@
-/* EList class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_EList_defs_hh
-#define PPL_EList_defs_hh 1
-
-#include "EList.types.hh"
-#include "Doubly_Linked_Object.defs.hh"
-#include "EList_Iterator.defs.hh"
-
-/*! \brief
-  A simple kind of embedded list (i.e., a doubly linked objects
-  where the links are embedded in the objects themselves).
-*/
-template <typename T>
-class Parma_Polyhedra_Library::Implementation::Watchdog::EList
-  : private Doubly_Linked_Object {
-public:
-  //! A const iterator to traverse the list.
-  typedef EList_Iterator<const T> Const_Iterator;
-
-  //! A non-const iterator to traverse the list.
-  typedef EList_Iterator<T> Iterator;
-
-  //! Constructs an empty list.
-  EList();
-
-  //! Destructs the list and all the elements in it.
-  ~EList();
-
-  //! Pushes \p obj to the front of the list.
-  void push_front(T& obj);
-
-  //! Pushes \p obj to the back of the list.
-  void push_back(T& obj);
-
-  /*! \brief
-    Inserts \p obj just before \p position and returns an iterator
-    that points to the inserted object.
-  */
-  Iterator insert(Iterator position, T& obj);
-
-  /*! \brief
-    Removes the element pointed to by \p position, returning
-    an iterator pointing to the next element, if any, or end(), otherwise.
-  */
-  Iterator erase(Iterator position);
-
-  //! Returns <CODE>true</CODE> if and only if the list is empty.
-  bool empty() const;
-
-  //! Returns an iterator pointing to the beginning of the list.
-  Iterator begin();
-
-  //! Returns an iterator pointing one past the last element in the list.
-  Iterator end();
-
-  //! Returns a const iterator pointing to the beginning of the list.
-  Const_Iterator begin() const;
-
-  //! Returns a const iterator pointing one past the last element in the list.
-  Const_Iterator end() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-};
-
-#include "EList.inlines.hh"
-
-#endif // !defined(PPL_EList_defs_hh)
diff --git a/src/EList.inlines.hh b/src/EList.inlines.hh
deleted file mode 100644
index 0645778..0000000
--- a/src/EList.inlines.hh
+++ /dev/null
@@ -1,123 +0,0 @@
-/* EList class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_EList_inlines_hh
-#define PPL_EList_inlines_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename T>
-inline
-EList<T>::EList()
-  : Doubly_Linked_Object(this, this) {
-}
-
-template <typename T>
-inline void
-EList<T>::push_front(T& obj) {
-  next->insert_before(obj);
-}
-
-template <typename T>
-inline void
-EList<T>::push_back(T& obj) {
-  prev->insert_after(obj);
-}
-
-template <typename T>
-inline typename EList<T>::Iterator
-EList<T>::insert(Iterator position, T& obj) {
-  position->insert_before(obj);
-  return Iterator(&obj);
-}
-
-template <typename T>
-inline typename EList<T>::Iterator
-EList<T>::begin() {
-  return Iterator(next);
-}
-
-template <typename T>
-inline typename EList<T>::Iterator
-EList<T>::end() {
-  return Iterator(this);
-}
-
-template <typename T>
-inline typename EList<T>::Const_Iterator
-EList<T>::begin() const {
-  return Const_Iterator(next);
-}
-
-template <typename T>
-inline typename EList<T>::Const_Iterator
-EList<T>::end() const {
-  return Const_Iterator(const_cast<EList<T>*>(this));
-}
-
-template <typename T>
-inline bool
-EList<T>::empty() const {
-  return begin() == end();
-}
-
-template <typename T>
-inline typename EList<T>::Iterator
-EList<T>::erase(Iterator position) {
-  assert(!empty());
-  return Iterator(position->erase());
-}
-
-template <typename T>
-inline
-EList<T>::~EList() {
-  // Erase and deallocate all the elements.
-  for (Iterator i = begin(), lend = end(), next; i != lend; i = next) {
-    next = erase(i);
-    delete &*i;
-  }
-}
-
-template <typename T>
-inline bool
-EList<T>::OK() const {
-  for (Const_Iterator i = begin(), lend = end(); i != lend; ++i)
-    if (!i->OK())
-      return false;
-
-  return true;
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_EList_inlines_hh)
diff --git a/src/EList.types.hh b/src/EList.types.hh
deleted file mode 100644
index ec7e41f..0000000
--- a/src/EList.types.hh
+++ /dev/null
@@ -1,31 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_EList_types_hh
-#define PPL_EList_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename T>
-class EList;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_EList_types_hh)
diff --git a/src/EList_Iterator.defs.hh b/src/EList_Iterator.defs.hh
deleted file mode 100644
index 84a9b27..0000000
--- a/src/EList_Iterator.defs.hh
+++ /dev/null
@@ -1,92 +0,0 @@
-/* EList_Iterator class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_EList_Iterator_defs_hh
-#define PPL_EList_Iterator_defs_hh 1
-
-#include "EList_Iterator.types.hh"
-#include "Doubly_Linked_Object.types.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-template <typename T>
-bool operator==(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-template <typename T>
-bool operator!=(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-//! A class providing iterators for embedded lists.
-template <typename T>
-class Parma_Polyhedra_Library::Implementation::Watchdog::EList_Iterator {
-public:
-  //! Constructs an iterator pointing to nothing.
-  EList_Iterator();
-
-  //! Constructs an iterator pointing to \p p.
-  explicit EList_Iterator(Doubly_Linked_Object* p);
-
-  //! Changes \p *this so that it points to \p p.
-  EList_Iterator& operator=(Doubly_Linked_Object* p);
-
-  //! Indirect member selector.
-  T* operator->();
-
-  //! Dereference operator.
-  T& operator*();
-
-  //! Preincrement operator.
-  EList_Iterator& operator++();
-
-  //! Postincrement operator.
-  EList_Iterator operator++(int);
-
-  //! Predecrement operator.
-  EList_Iterator& operator--();
-
-  //! Postdecrement operator.
-  EList_Iterator operator--(int);
-
-private:
-  //! Embedded pointer.
-  Doubly_Linked_Object* ptr;
-
-  friend bool operator==<T>(const EList_Iterator& x, const EList_Iterator& y);
-
-  friend bool operator!=<T>(const EList_Iterator& x, const EList_Iterator& y);
-};
-
-#include "EList_Iterator.inlines.hh"
-
-#endif // !defined(PPL_EList_Iterator_defs_hh)
diff --git a/src/EList_Iterator.inlines.hh b/src/EList_Iterator.inlines.hh
deleted file mode 100644
index 61147b2..0000000
--- a/src/EList_Iterator.inlines.hh
+++ /dev/null
@@ -1,113 +0,0 @@
-/* EList_Iterator class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_EList_Iterator_inlines_hh
-#define PPL_EList_Iterator_inlines_hh 1
-
-#include "Doubly_Linked_Object.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename T>
-inline
-EList_Iterator<T>::EList_Iterator() {
-}
-
-template <typename T>
-inline
-EList_Iterator<T>::EList_Iterator(Doubly_Linked_Object* p)
-  : ptr(p) {
-}
-
-template <typename T>
-inline EList_Iterator<T>&
-EList_Iterator<T>::operator=(Doubly_Linked_Object* p) {
-  ptr = p;
-  return *this;
-}
-
-template <typename T>
-inline T*
-EList_Iterator<T>::operator->() {
-  return static_cast<T*>(ptr);
-}
-
-template <typename T>
-inline T&
-EList_Iterator<T>::operator*() {
-  return *operator->();
-}
-
-template <typename T>
-inline EList_Iterator<T>&
-EList_Iterator<T>::operator++() {
-  ptr = ptr->next;
-  return *this;
-}
-
-template <typename T>
-inline EList_Iterator<T>
-EList_Iterator<T>::operator++(int) {
-  EList_Iterator tmp = *this;
-  ++*this;
-  return tmp;
-}
-
-template <typename T>
-inline EList_Iterator<T>&
-EList_Iterator<T>::operator--() {
-  ptr = ptr->prev;
-  return *this;
-}
-
-template <typename T>
-inline EList_Iterator<T>
-EList_Iterator<T>::operator--(int) {
-  EList_Iterator tmp = *this;
-  --*this;
-  return tmp;
-}
-
-template <typename T>
-inline bool
-operator==(const EList_Iterator<T>& x, const EList_Iterator<T>& y) {
-  return x.ptr == y.ptr;
-}
-
-template <typename T>
-inline bool
-operator!=(const EList_Iterator<T>& x, const EList_Iterator<T>& y) {
-  return x.ptr != y.ptr;
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_EList_Iterator_inlines_hh)
diff --git a/src/EList_Iterator.types.hh b/src/EList_Iterator.types.hh
deleted file mode 100644
index 9061a1f..0000000
--- a/src/EList_Iterator.types.hh
+++ /dev/null
@@ -1,31 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_EList_Iterator_types_hh
-#define PPL_EList_Iterator_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename T>
-class EList_Iterator;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_EList_Iterator_types_hh)
diff --git a/src/EList_Iterator_defs.hh b/src/EList_Iterator_defs.hh
new file mode 100644
index 0000000..0cabaa5
--- /dev/null
+++ b/src/EList_Iterator_defs.hh
@@ -0,0 +1,88 @@
+/* EList_Iterator class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_EList_Iterator_defs_hh
+#define PPL_EList_Iterator_defs_hh 1
+
+#include "EList_Iterator_types.hh"
+#include "Doubly_Linked_Object_types.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+template <typename T>
+bool operator==(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+template <typename T>
+bool operator!=(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+//! A class providing iterators for embedded lists.
+template <typename T>
+class Parma_Polyhedra_Library::Implementation::EList_Iterator {
+public:
+  //! Constructs an iterator pointing to nothing.
+  EList_Iterator();
+
+  //! Constructs an iterator pointing to \p p.
+  explicit EList_Iterator(Doubly_Linked_Object* p);
+
+  //! Changes \p *this so that it points to \p p.
+  EList_Iterator& operator=(Doubly_Linked_Object* p);
+
+  //! Indirect member selector.
+  T* operator->();
+
+  //! Dereference operator.
+  T& operator*();
+
+  //! Preincrement operator.
+  EList_Iterator& operator++();
+
+  //! Postincrement operator.
+  EList_Iterator operator++(int);
+
+  //! Predecrement operator.
+  EList_Iterator& operator--();
+
+  //! Postdecrement operator.
+  EList_Iterator operator--(int);
+
+private:
+  //! Embedded pointer.
+  Doubly_Linked_Object* ptr;
+
+  friend bool operator==<T>(const EList_Iterator& x, const EList_Iterator& y);
+
+  friend bool operator!=<T>(const EList_Iterator& x, const EList_Iterator& y);
+};
+
+#include "EList_Iterator_inlines.hh"
+
+#endif // !defined(PPL_EList_Iterator_defs_hh)
diff --git a/src/EList_Iterator_inlines.hh b/src/EList_Iterator_inlines.hh
new file mode 100644
index 0000000..1d5e96c
--- /dev/null
+++ b/src/EList_Iterator_inlines.hh
@@ -0,0 +1,109 @@
+/* EList_Iterator class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_EList_Iterator_inlines_hh
+#define PPL_EList_Iterator_inlines_hh 1
+
+#include "Doubly_Linked_Object_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename T>
+inline
+EList_Iterator<T>::EList_Iterator() {
+}
+
+template <typename T>
+inline
+EList_Iterator<T>::EList_Iterator(Doubly_Linked_Object* p)
+  : ptr(p) {
+}
+
+template <typename T>
+inline EList_Iterator<T>&
+EList_Iterator<T>::operator=(Doubly_Linked_Object* p) {
+  ptr = p;
+  return *this;
+}
+
+template <typename T>
+inline T*
+EList_Iterator<T>::operator->() {
+  return static_cast<T*>(ptr);
+}
+
+template <typename T>
+inline T&
+EList_Iterator<T>::operator*() {
+  return *operator->();
+}
+
+template <typename T>
+inline EList_Iterator<T>&
+EList_Iterator<T>::operator++() {
+  ptr = ptr->next;
+  return *this;
+}
+
+template <typename T>
+inline EList_Iterator<T>
+EList_Iterator<T>::operator++(int) {
+  EList_Iterator tmp = *this;
+  ++*this;
+  return tmp;
+}
+
+template <typename T>
+inline EList_Iterator<T>&
+EList_Iterator<T>::operator--() {
+  ptr = ptr->prev;
+  return *this;
+}
+
+template <typename T>
+inline EList_Iterator<T>
+EList_Iterator<T>::operator--(int) {
+  EList_Iterator tmp = *this;
+  --*this;
+  return tmp;
+}
+
+template <typename T>
+inline bool
+operator==(const EList_Iterator<T>& x, const EList_Iterator<T>& y) {
+  return x.ptr == y.ptr;
+}
+
+template <typename T>
+inline bool
+operator!=(const EList_Iterator<T>& x, const EList_Iterator<T>& y) {
+  return x.ptr != y.ptr;
+}
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_EList_Iterator_inlines_hh)
diff --git a/src/EList_Iterator_types.hh b/src/EList_Iterator_types.hh
new file mode 100644
index 0000000..584f9fa
--- /dev/null
+++ b/src/EList_Iterator_types.hh
@@ -0,0 +1,27 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_EList_Iterator_types_hh
+#define PPL_EList_Iterator_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename T>
+class EList_Iterator;
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_EList_Iterator_types_hh)
diff --git a/src/EList_defs.hh b/src/EList_defs.hh
new file mode 100644
index 0000000..3d3fa96
--- /dev/null
+++ b/src/EList_defs.hh
@@ -0,0 +1,90 @@
+/* EList class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_EList_defs_hh
+#define PPL_EList_defs_hh 1
+
+#include "EList_types.hh"
+#include "Doubly_Linked_Object_defs.hh"
+#include "EList_Iterator_defs.hh"
+
+/*! \brief
+  A simple kind of embedded list (i.e., a doubly linked objects
+  where the links are embedded in the objects themselves).
+*/
+template <typename T>
+class Parma_Polyhedra_Library::Implementation::EList
+  : private Doubly_Linked_Object {
+public:
+  //! A const iterator to traverse the list.
+  typedef EList_Iterator<const T> const_iterator;
+
+  //! A non-const iterator to traverse the list.
+  typedef EList_Iterator<T> iterator;
+
+  //! Constructs an empty list.
+  EList();
+
+  //! Destructs the list and all the elements in it.
+  ~EList();
+
+  //! Pushes \p obj to the front of the list.
+  void push_front(T& obj);
+
+  //! Pushes \p obj to the back of the list.
+  void push_back(T& obj);
+
+  /*! \brief
+    Inserts \p obj just before \p position and returns an iterator
+    that points to the inserted object.
+  */
+  iterator insert(iterator position, T& obj);
+
+  /*! \brief
+    Removes the element pointed to by \p position, returning
+    an iterator pointing to the next element, if any, or end(), otherwise.
+  */
+  iterator erase(iterator position);
+
+  //! Returns <CODE>true</CODE> if and only if the list is empty.
+  bool empty() const;
+
+  //! Returns an iterator pointing to the beginning of the list.
+  iterator begin();
+
+  //! Returns an iterator pointing one past the last element in the list.
+  iterator end();
+
+  //! Returns a const iterator pointing to the beginning of the list.
+  const_iterator begin() const;
+
+  //! Returns a const iterator pointing one past the last element in the list.
+  const_iterator end() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+};
+
+#include "EList_inlines.hh"
+
+#endif // !defined(PPL_EList_defs_hh)
diff --git a/src/EList_inlines.hh b/src/EList_inlines.hh
new file mode 100644
index 0000000..010c2a3
--- /dev/null
+++ b/src/EList_inlines.hh
@@ -0,0 +1,119 @@
+/* EList class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_EList_inlines_hh
+#define PPL_EList_inlines_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename T>
+inline
+EList<T>::EList()
+  : Doubly_Linked_Object(this, this) {
+}
+
+template <typename T>
+inline void
+EList<T>::push_front(T& obj) {
+  next->insert_before(obj);
+}
+
+template <typename T>
+inline void
+EList<T>::push_back(T& obj) {
+  prev->insert_after(obj);
+}
+
+template <typename T>
+inline typename EList<T>::iterator
+EList<T>::insert(iterator position, T& obj) {
+  position->insert_before(obj);
+  return iterator(&obj);
+}
+
+template <typename T>
+inline typename EList<T>::iterator
+EList<T>::begin() {
+  return iterator(next);
+}
+
+template <typename T>
+inline typename EList<T>::iterator
+EList<T>::end() {
+  return iterator(this);
+}
+
+template <typename T>
+inline typename EList<T>::const_iterator
+EList<T>::begin() const {
+  return const_iterator(next);
+}
+
+template <typename T>
+inline typename EList<T>::const_iterator
+EList<T>::end() const {
+  return const_iterator(const_cast<EList<T>*>(this));
+}
+
+template <typename T>
+inline bool
+EList<T>::empty() const {
+  return begin() == end();
+}
+
+template <typename T>
+inline typename EList<T>::iterator
+EList<T>::erase(iterator position) {
+  assert(!empty());
+  return iterator(position->erase());
+}
+
+template <typename T>
+inline
+EList<T>::~EList() {
+  // Erase and deallocate all the elements.
+  for (iterator i = begin(), lend = end(), next; i != lend; i = next) {
+    next = erase(i);
+    delete &*i;
+  }
+}
+
+template <typename T>
+inline bool
+EList<T>::OK() const {
+  for (const_iterator i = begin(), lend = end(); i != lend; ++i)
+    if (!i->OK())
+      return false;
+
+  return true;
+}
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_EList_inlines_hh)
diff --git a/src/EList_types.hh b/src/EList_types.hh
new file mode 100644
index 0000000..4793ecc
--- /dev/null
+++ b/src/EList_types.hh
@@ -0,0 +1,27 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_EList_types_hh
+#define PPL_EList_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename T>
+class EList;
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_EList_types_hh)
diff --git a/src/Expression_Adapter_defs.hh b/src/Expression_Adapter_defs.hh
new file mode 100644
index 0000000..f06e1ea
--- /dev/null
+++ b/src/Expression_Adapter_defs.hh
@@ -0,0 +1,216 @@
+/* Expression_Adapter class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Expression_Adapter_defs_hh
+#define PPL_Expression_Adapter_defs_hh 1
+
+#include "Expression_Adapter_types.hh"
+#include "Variable_types.hh"
+#include "Variables_Set_types.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Adapters' base type (for template meta-programming).
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Expression_Adapter_Base {
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An adapter for Linear_Expression objects.
+/*!
+  The adapters are meant to provide read-only, customized access to the
+  Linear_Expression members in Constraint, Generator, Congruence and
+  Grid_Generator objects. They typically implement the user-level view
+  of these expressions.
+
+  \note
+  A few methods implement low-level access routines and will take
+  bare indexes as arguments (rather than Variable objects):
+  when such a bare index \c i is zero, the inhomogeneous term is meant;
+  when the bare index \c i is greater than zero, the coefficient of the
+  variable having id <CODE>i - 1</CODE> is meant.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Adapter
+  : public Expression_Adapter_Base {
+public:
+  //! The type of this object.
+  typedef Expression_Adapter<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename T::const_reference inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename T::raw_type raw_type;
+
+  //! Returns an adapter after one-level unwrapping.
+  inner_type inner() const;
+
+  //! The type of const iterators on coefficients.
+  typedef typename raw_type::const_iterator const_iterator;
+
+  //! Returns the current representation of \p *this.
+  Representation representation() const;
+
+  //! Iterator pointing to the first nonzero variable coefficient.
+  const_iterator begin() const;
+
+  //! Iterator pointing after the last nonzero variable coefficient.
+  const_iterator end() const;
+
+  //! Iterator pointing to the first nonzero variable coefficient
+  //! of a variable bigger than or equal to \p v.
+  const_iterator lower_bound(Variable v) const;
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns the inhomogeneous term of \p *this.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is zero.
+  bool is_zero() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are zero.
+  */
+  bool all_homogeneous_terms_are_zero() const;
+
+  /*! \brief Returns \p true if \p *this is equal to \p y.
+
+    Note that <CODE>(*this == y)</CODE> has a completely different meaning.
+  */
+  template <typename Expression>
+  bool is_equal_to(const Expression& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars is zero.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+  //! Returns the \p i -th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Returns the coefficient of variable \p v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is zero,
+    for each i in [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  //! Returns the number of zero coefficient in [start, end).
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end).
+    Returns zero if all the coefficients in the range are zero.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  //! Returns the index of the last nonzero element, or zero if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last),
+  //! or \p last if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there
+  //! are no nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Removes from set \p x all the indexes of nonzero elements in \p *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \c true if <CODE>(*this)[i]</CODE> is equal to <CODE>y[i]</CODE>,
+  //! for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \c true if <CODE>(*this)[i]*c1</CODE> is equal to
+  //! <CODE>y[i]*c2</CODE>, for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Sparse_Row& row) const;
+
+  //! Returns \c true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both \p *this and \p y.
+  template <typename Expression>
+  bool have_a_common_variable(const Expression& y,
+                              Variable first, Variable last) const;
+
+protected:
+  //! Constructor.
+  explicit Expression_Adapter(const raw_type& expr);
+  //! The raw, completely unwrapped object subject to adaptation.
+  const raw_type& raw_;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A transparent adapter for Linear_Expression objects.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Adapter_Transparent
+  : public Expression_Adapter<T> {
+  typedef Expression_Adapter<T> base_type;
+public:
+  //! The type of this object.
+  typedef Expression_Adapter_Transparent<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename base_type::inner_type inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename base_type::raw_type raw_type;
+
+  //! The type of const iterators on coefficients.
+  typedef typename base_type::const_iterator const_iterator;
+
+  //! Constructor.
+  explicit Expression_Adapter_Transparent(const raw_type& expr);
+};
+
+#include "Expression_Adapter_inlines.hh"
+
+#endif // !defined(PPL_Expression_Adapter_defs_hh)
diff --git a/src/Expression_Adapter_inlines.hh b/src/Expression_Adapter_inlines.hh
new file mode 100644
index 0000000..c45f5e8
--- /dev/null
+++ b/src/Expression_Adapter_inlines.hh
@@ -0,0 +1,229 @@
+/* Expression_Adapter class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Expression_Adapter_inlines_hh
+#define PPL_Expression_Adapter_inlines_hh 1
+
+#include "Variables_Set_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+Expression_Adapter<T>::Expression_Adapter(const raw_type& expr)
+  : raw_(expr) {
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::inner_type
+Expression_Adapter<T>::inner() const {
+  return inner_type(raw_);
+}
+
+template <typename T>
+inline Representation
+Expression_Adapter<T>::representation() const {
+  return inner().representation();
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::const_iterator
+Expression_Adapter<T>::begin() const {
+  return inner().begin();
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::const_iterator
+Expression_Adapter<T>::end() const {
+  return inner().end();
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::const_iterator
+Expression_Adapter<T>::lower_bound(Variable v) const {
+  return inner().lower_bound(v);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::space_dimension() const {
+  return inner().space_dimension();
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::coefficient(Variable v) const {
+  return inner().coefficient(v);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::inhomogeneous_term() const {
+  return inner().inhomogeneous_term();
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>::is_zero() const {
+  return inner().is_zero();
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>::all_homogeneous_terms_are_zero() const {
+  return inner().all_homogeneous_terms_are_zero();
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>::is_equal_to(const Expression& y) const {
+  return inner().is_equal_to(y);
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>
+::all_zeroes(const Variables_Set& vars) const {
+  return inner().all_zeroes(vars);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::get(dimension_type i) const {
+  return inner().get(i);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::get(Variable v) const {
+  return inner().get(v);
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>::all_zeroes(dimension_type start,
+                                  dimension_type end) const {
+  return inner().all_zeroes(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::num_zeroes(dimension_type start,
+                                  dimension_type end) const {
+  return inner().num_zeroes(start, end);
+}
+
+template <typename T>
+inline Coefficient
+Expression_Adapter<T>::gcd(dimension_type start,
+                           dimension_type end) const {
+  return inner().gcd(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::last_nonzero() const {
+  return inner().last_nonzero();
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::last_nonzero(dimension_type first,
+                                    dimension_type last) const {
+  return inner().last_nonzero(first, last);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::first_nonzero(dimension_type first,
+                                     dimension_type last) const {
+  return inner().first_nonzero(first, last);
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const {
+  return inner().all_zeroes_except(vars, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Adapter<T>
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
+  inner().has_a_free_dimension_helper(x);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>
+::is_equal_to(const Expression& y,
+              dimension_type start, dimension_type end) const {
+  return inner().is_equal_to(y, start, end);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>
+::is_equal_to(const Expression& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  return inner().is_equal_to(y, c1, c2, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Adapter<T>::get_row(Dense_Row& row) const {
+  inner().get_row(row);
+}
+
+template <typename T>
+inline void
+Expression_Adapter<T>::get_row(Sparse_Row& row) const {
+  inner().get_row(row);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>
+::have_a_common_variable(const Expression& y,
+                         Variable first, Variable last) const {
+  return inner().have_a_common_variable(y, first, last);
+}
+
+template <typename T>
+inline
+Expression_Adapter_Transparent<T>
+::Expression_Adapter_Transparent(const raw_type& expr)
+  : base_type(expr) {
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Expression_Adapter_inlines_hh)
diff --git a/src/Expression_Adapter_types.hh b/src/Expression_Adapter_types.hh
new file mode 100644
index 0000000..856d260
--- /dev/null
+++ b/src/Expression_Adapter_types.hh
@@ -0,0 +1,28 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Expression_Adapter_types_hh
+#define PPL_Expression_Adapter_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Expression_Adapter_Base;
+
+template <typename T>
+class Expression_Adapter;
+
+template <typename T>
+class Expression_Adapter_Transparent;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Expression_Adapter_types_hh)
diff --git a/src/Expression_Hide_Inhomo.defs.hh b/src/Expression_Hide_Inhomo.defs.hh
deleted file mode 100644
index 6d99441..0000000
--- a/src/Expression_Hide_Inhomo.defs.hh
+++ /dev/null
@@ -1,176 +0,0 @@
-/* Expression_Hide_Inhomo class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Expression_Hide_Inhomo_defs_hh
-#define PPL_Expression_Hide_Inhomo_defs_hh 1
-
-#include "Expression_Hide_Inhomo.types.hh"
-
-#include "Linear_Expression.types.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A Linear_Expression-like object that hides the inhomogeneous term.
-//! The methods of this class always pretend that it's 0.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Expression>
-class Parma_Polyhedra_Library::Expression_Hide_Inhomo {
-public:
-
-  //! Wraps `expr'. Note that `expr' must not be destroyed as long as this
-  //! object is alive.
-  explicit Expression_Hide_Inhomo(Expression& expr);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  typedef typename Expression::const_iterator const_iterator;
-
-  //! Returns an iterator that points to the first nonzero coefficient in the
-  //! expression.
-  const_iterator begin() const;
-
-  //! Returns an iterator that points to the last nonzero coefficient in the
-  //! expression.
-  const_iterator end() const;
-
-  //! Returns an iterator that points to the first nonzero coefficient of a
-  //! variable bigger than or equal to v.
-  const_iterator lower_bound(Variable v) const;
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  bool is_zero() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  bool all_homogeneous_terms_are_zero() const;
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  bool all_zeroes(const Variables_Set& vars) const;
-
-private:
-  Expression& expr;
-
-  //! Returns the i-th coefficient.
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  //! Returns the coefficient of v.
-  Coefficient_traits::const_reference get(Variable v) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  bool all_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  Coefficient gcd(dimension_type start, dimension_type end) const;
-
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  dimension_type last_nonzero() const;
-
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
-
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  bool all_zeroes_except(const Variables_Set& vars, dimension_type start, dimension_type end) const;
-
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   Coefficient_traits::const_reference c1,
-                   Coefficient_traits::const_reference c2,
-                   dimension_type start, dimension_type end) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Dense_Row& row) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Sparse_Row& row) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  template <typename Expression2>
-  bool have_a_common_variable(const Expression2& x,
-                              Variable first, Variable last) const;
-
-  // NOTE: The following classes are friends of Expression_Hide_Inhomo in
-  // order to access its private methods.
-  template <typename T>
-  friend class Linear_System;
-  friend class Box_Helpers;
-  template <typename T>
-  friend class Expression_Hide_Inhomo;
-  template <typename T>
-  friend class Expression_Hide_Last;
-};
-
-#include "Expression_Hide_Inhomo.inlines.hh"
-
-#endif // !defined(PPL_Expression_Hide_Inhomo_defs_hh)
diff --git a/src/Expression_Hide_Inhomo.inlines.hh b/src/Expression_Hide_Inhomo.inlines.hh
deleted file mode 100644
index 2d4b400..0000000
--- a/src/Expression_Hide_Inhomo.inlines.hh
+++ /dev/null
@@ -1,314 +0,0 @@
-/* Expression_Hide_Inhomo class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Expression_Hide_Inhomo_inlines_hh
-#define PPL_Expression_Hide_Inhomo_inlines_hh 1
-
-#include "Variables_Set.defs.hh"
-#include "Linear_Expression.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Expression>
-inline
-Expression_Hide_Inhomo<Expression>
-::Expression_Hide_Inhomo(Expression& expr)
-  : expr(expr) {
-}
-
-template <typename Expression>
-inline Representation
-Expression_Hide_Inhomo<Expression>::representation() const {
-  return expr.representation();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Inhomo<Expression>::const_iterator
-Expression_Hide_Inhomo<Expression>::begin() const {
-  return expr.begin();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Inhomo<Expression>::const_iterator
-Expression_Hide_Inhomo<Expression>::end() const {
-  return expr.end();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Inhomo<Expression>::const_iterator
-Expression_Hide_Inhomo<Expression>::lower_bound(Variable v) const {
-  return expr.lower_bound(v);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::space_dimension() const {
-  return expr.space_dimension();
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::coefficient(Variable v) const {
-  return expr.coefficient(v);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::inhomogeneous_term() const {
-  return Coefficient_zero();
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::is_zero() const {
-  // Don't check the inhomogeneous_term (i.e. pretend it's 0).
-  return expr.all_homogeneous_terms_are_zero();
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::all_homogeneous_terms_are_zero() const {
-  return expr.all_homogeneous_terms_are_zero();
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::is_equal_to(const Expression2& x) const {
-  const dimension_type dim1 = space_dimension();
-  const dimension_type dim2 = x.space_dimension();
-  if (dim1 != dim2)
-    return false;
-  if (x.inhomogeneous_term() != 0)
-    return false;
-  // Note that the inhomogeneous term is not compared.
-  return expr.is_equal_to(x, 1, dim1 + 1);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>::is_equal_to(const Expression2& x) const {
-  const dimension_type dim1 = space_dimension();
-  const dimension_type dim2 = x.space_dimension();
-  if (dim1 != dim2)
-    return false;
-  if (x.inhomogeneous_term() != 0)
-    return false;
-  // Note that the inhomogeneous term is not compared.
-  return x.is_equal_to(expr, 1, dim1 + 1);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::all_zeroes(const Variables_Set& vars) const {
-  return expr.all_zeroes(vars);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::get(dimension_type i) const {
-  if (i == 0)
-    return Coefficient_zero();
-  else
-    return expr.get(i);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::get(Variable v) const {
-  return expr.get(v);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::all_zeroes(dimension_type start,
-                                               dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.all_zeroes(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::num_zeroes(dimension_type start,
-                                               dimension_type end) const {
-  if (start == end)
-    return 0;
-  if (start == 0)
-    return 1 + expr.num_zeroes(start + 1, end);
-  else
-    return expr.num_zeroes(start, end);
-}
-
-template <typename Expression>
-inline Coefficient
-Expression_Hide_Inhomo<Expression>::gcd(dimension_type start,
-                                        dimension_type end) const {
-  if (start == end)
-    return Coefficient_zero();
-  if (start == 0)
-    ++start;
-  return expr.gcd(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::last_nonzero() const {
-  return expr.last_nonzero();
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::last_nonzero(dimension_type first,
-                                                 dimension_type last) const {
-  return expr.last_nonzero(first, last);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::first_nonzero(dimension_type first,
-                                                  dimension_type last) const {
-  if (first == last)
-    return last;
-  if (first == 0)
-    ++first;
-  return expr.first_nonzero(first, last);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.all_zeroes_except(vars, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Inhomo<Expression>
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
-  bool had_0 = (x.count(0) == 1);
-  expr.has_a_free_dimension_helper(x);
-  if (had_0)
-    x.insert(0);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.is_equal_to(x, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return x.is_equal_to(expr, start, end);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.is_equal_to(x, c1, c2, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return x.is_equal_to(expr, c2, c1, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Inhomo<Expression>::get_row(Dense_Row& row) const {
-  expr.get_row(row);
-  row.reset(0);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Inhomo<Expression>::get_row(Sparse_Row& row) const {
-  expr.get_row(row);
-  row.reset(0);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  return expr.have_a_common_variable(x, first, last);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  return x.have_a_common_variable(expr, first, last);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Expression_Hide_Inhomo_inlines_hh)
diff --git a/src/Expression_Hide_Inhomo.types.hh b/src/Expression_Hide_Inhomo.types.hh
deleted file mode 100644
index de4318e..0000000
--- a/src/Expression_Hide_Inhomo.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Expression_Hide_Inhomo_types_hh
-#define PPL_Expression_Hide_Inhomo_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Expression>
-class Expression_Hide_Inhomo;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Expression_Hide_Inhomo_types_hh)
diff --git a/src/Expression_Hide_Inhomo_defs.hh b/src/Expression_Hide_Inhomo_defs.hh
new file mode 100644
index 0000000..877c8e1
--- /dev/null
+++ b/src/Expression_Hide_Inhomo_defs.hh
@@ -0,0 +1,147 @@
+/* Expression_Hide_Inhomo class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Expression_Hide_Inhomo_defs_hh
+#define PPL_Expression_Hide_Inhomo_defs_hh 1
+
+#include "Expression_Hide_Inhomo_types.hh"
+
+#include "Expression_Adapter_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  An adapter for Linear_Expression that hides the inhomogeneous term.
+
+  The methods of this class always pretend that the value of the
+  inhomogeneous term is zero.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Hide_Inhomo
+  : public Expression_Adapter<T> {
+  typedef Expression_Adapter<T> base_type;
+public:
+  //! The type of this object.
+  typedef Expression_Hide_Inhomo<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename base_type::inner_type inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename base_type::raw_type raw_type;
+
+  //! Constructor.
+  explicit Expression_Hide_Inhomo(const raw_type& expr);
+
+public:
+  //! The type of const iterators on coefficients.
+  typedef typename base_type::const_iterator const_iterator;
+
+  //! Returns the constant zero.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is zero.
+  bool is_zero() const;
+
+  /*! \brief Returns \p true if \p *this is equal to \p y.
+
+    Note that <CODE>(*this == y)</CODE> has a completely different meaning.
+  */
+  template <typename Expression>
+  bool is_equal_to(const Expression& y) const;
+
+  //! Returns the i-th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Returns the coefficient of v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars is zero.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is zero,
+    for each i in [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the number of zero coefficient in [start, end).
+  */
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end). If all the
+    coefficients in this range are zero, returns zero.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  //! Returns the index of the last nonzero element, or zero if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last), or last
+  //! if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there
+  //! are no nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Removes from set \p x all the indexes of nonzero elements in \p *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \c true if <CODE>(*this)[i]</CODE> is equal to <CODE>y[i]</CODE>,
+  //! for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \c true if <CODE>(*this)[i]*c1</CODE> is equal to
+  //! <CODE>y[i]*c2</CODE>, for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Sparse_Row& row) const;
+};
+
+#include "Expression_Hide_Inhomo_inlines.hh"
+
+#endif // !defined(PPL_Expression_Hide_Inhomo_defs_hh)
diff --git a/src/Expression_Hide_Inhomo_inlines.hh b/src/Expression_Hide_Inhomo_inlines.hh
new file mode 100644
index 0000000..e3a6919
--- /dev/null
+++ b/src/Expression_Hide_Inhomo_inlines.hh
@@ -0,0 +1,218 @@
+/* Expression_Hide_Inhomo class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Expression_Hide_Inhomo_inlines_hh
+#define PPL_Expression_Hide_Inhomo_inlines_hh 1
+
+#include "Variables_Set_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+Expression_Hide_Inhomo<T>::Expression_Hide_Inhomo(const raw_type& expr)
+  : base_type(expr) {
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Inhomo<T>::inhomogeneous_term() const {
+  // Pretend it is zero.
+  return Coefficient_zero();
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>::is_zero() const {
+  // Don't check the inhomogeneous_term (i.e., pretend it is zero).
+  return this->inner().all_homogeneous_terms_are_zero();
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Inhomo<T>
+::is_equal_to(const Expression& y) const {
+  const dimension_type x_dim = this->space_dimension();
+  const dimension_type y_dim = y.space_dimension();
+  if (x_dim != y_dim)
+    return false;
+  if (y.inhomogeneous_term() != 0)
+    return false;
+  // Note that the inhomogeneous term is not compared.
+  return this->inner().is_equal_to(y, 1, x_dim + 1);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Inhomo<T>::get(dimension_type i) const {
+  if (i == 0)
+    return Coefficient_zero();
+  else
+    return this->inner().get(i);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Inhomo<T>::get(Variable v) const {
+  return this->inner().get(v);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>
+::all_zeroes(const Variables_Set& vars) const {
+  return this->inner().all_zeroes(vars);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>::all_zeroes(dimension_type start,
+                                      dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().all_zeroes(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::num_zeroes(dimension_type start,
+                                      dimension_type end) const {
+  if (start == end)
+    return 0;
+  dimension_type nz = 0;
+  if (start == 0) {
+    ++start;
+    ++nz;
+  }
+  nz += this->inner().num_zeroes(start, end);
+  return nz;
+}
+
+template <typename T>
+inline Coefficient
+Expression_Hide_Inhomo<T>::gcd(dimension_type start,
+                               dimension_type end) const {
+  if (start == end)
+    return Coefficient_zero();
+  if (start == 0)
+    ++start;
+  return this->inner().gcd(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::last_nonzero() const {
+  return this->inner().last_nonzero();
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::last_nonzero(dimension_type first,
+                                        dimension_type last) const {
+  if (first == last)
+    return last;
+  if (first == 0)
+    ++first;
+  return this->inner().last_nonzero(first, last);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::first_nonzero(dimension_type first,
+                                         dimension_type last) const {
+  if (first == last)
+    return last;
+  if (first == 0)
+    ++first;
+  return this->inner().first_nonzero(first, last);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().all_zeroes_except(vars, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Inhomo<T>
+::has_a_free_dimension_helper(std::set<dimension_type>& y) const {
+  bool had_0 = (y.count(0) == 1);
+  this->inner().has_a_free_dimension_helper(y);
+  if (had_0)
+    y.insert(0);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Inhomo<T>
+::is_equal_to(const Expression& y,
+              dimension_type start, dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().is_equal_to(y, start, end);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Inhomo<T>
+::is_equal_to(const Expression& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().is_equal_to(y, c1, c2, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Inhomo<T>::get_row(Dense_Row& row) const {
+  this->inner().get_row(row);
+  row.reset(0);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Inhomo<T>::get_row(Sparse_Row& row) const {
+  this->inner().get_row(row);
+  row.reset(0);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Expression_Hide_Inhomo_inlines_hh)
diff --git a/src/Expression_Hide_Inhomo_types.hh b/src/Expression_Hide_Inhomo_types.hh
new file mode 100644
index 0000000..b9174ea
--- /dev/null
+++ b/src/Expression_Hide_Inhomo_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Expression_Hide_Inhomo_types_hh
+#define PPL_Expression_Hide_Inhomo_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class Expression_Hide_Inhomo;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Expression_Hide_Inhomo_types_hh)
diff --git a/src/Expression_Hide_Last.defs.hh b/src/Expression_Hide_Last.defs.hh
deleted file mode 100644
index 906a931..0000000
--- a/src/Expression_Hide_Last.defs.hh
+++ /dev/null
@@ -1,193 +0,0 @@
-/* Expression_Hide_Last class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Expression_Hide_Last_defs_hh
-#define PPL_Expression_Hide_Last_defs_hh 1
-
-#include "Expression_Hide_Last.types.hh"
-
-#include "Linear_Expression.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A Linear_Expression-like object that may or may not hide the last
-//! coefficient.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Expression>
-class Parma_Polyhedra_Library::Expression_Hide_Last {
-public:
-
-  //! Wraps `expr'. Note that `expr' must not be destroyed as long as this
-  //! object is alive.
-  explicit Expression_Hide_Last(Expression& expr, bool hide_last = false);
-
-  void set_hide_last(bool hide_last);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  typedef typename Expression::const_iterator const_iterator;
-
-  //! Returns an iterator that points to the first nonzero coefficient in the
-  //! expression.
-  const_iterator begin() const;
-
-  //! Returns an iterator that points to the last nonzero coefficient in the
-  //! expression.
-  const_iterator end() const;
-
-  //! Returns an iterator that points to the first nonzero coefficient of a
-  //! variable bigger than or equal to v.
-  const_iterator lower_bound(Variable v) const;
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  bool is_zero() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  bool all_homogeneous_terms_are_zero() const;
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  bool all_zeroes(const Variables_Set& vars) const;
-
-private:
-  Expression& expr;
-  bool hide_last;
-
-  //! Returns the i-th coefficient.
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  //! Returns the coefficient of v.
-  Coefficient_traits::const_reference get(Variable v) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  bool all_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  Coefficient gcd(dimension_type start, dimension_type end) const;
-
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  dimension_type last_nonzero() const;
-
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
-
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  bool all_zeroes_except(const Variables_Set& vars,
-                         dimension_type start, dimension_type end) const;
-
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   Coefficient_traits::const_reference c1,
-                   Coefficient_traits::const_reference c2,
-                   dimension_type start, dimension_type end) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Dense_Row& row) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Sparse_Row& row) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  template <typename Expression2>
-  bool have_a_common_variable(const Expression2& x,
-                              Variable first, Variable last) const;
-
-  // NOTE: The following classes are friends of Expression_Hide_Last in
-  // order to access its private methods.
-  template <typename T>
-  friend class Linear_System;
-  friend class Box_Helpers;
-  template <typename T>
-  friend class Expression_Hide_Inhomo;
-  template <typename T>
-  friend class Expression_Hide_Last;
-  friend class PIP_Problem;
-  friend class MIP_Problem;
-  template <typename T>
-  friend class BD_Shape;
-  friend class BHRZ03_Certificate;
-  template <typename T>
-  friend class Box;
-  friend class Grid;
-  template <typename T>
-  friend class Octagonal_Shape;
-  friend class Polyhedron;
-  friend class Octagonal_Shape_Helper;
-  friend class BD_Shape_Helpers;
-};
-
-#include "Expression_Hide_Last.inlines.hh"
-
-#endif // !defined(PPL_Expression_Hide_Last_defs_hh)
diff --git a/src/Expression_Hide_Last.inlines.hh b/src/Expression_Hide_Last.inlines.hh
deleted file mode 100644
index aa1cc66..0000000
--- a/src/Expression_Hide_Last.inlines.hh
+++ /dev/null
@@ -1,300 +0,0 @@
-/* Expression_Hide_Last class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Expression_Hide_Last_inlines_hh
-#define PPL_Expression_Hide_Last_inlines_hh 1
-
-#include "Variables_Set.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Expression>
-inline
-Expression_Hide_Last<Expression>
-::Expression_Hide_Last(Expression& expr, bool hide_last)
-  : expr(expr), hide_last(hide_last) {
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>::set_hide_last(bool hide_last) {
-  this->hide_last = hide_last;
-}
-
-template <typename Expression>
-inline Representation
-Expression_Hide_Last<Expression>::representation() const {
-  return expr.representation();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Last<Expression>::const_iterator
-Expression_Hide_Last<Expression>::begin() const {
-  return expr.begin();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Last<Expression>::const_iterator
-Expression_Hide_Last<Expression>::end() const {
-  if (hide_last) {
-    PPL_ASSERT(expr.space_dimension() != 0);
-    return expr.lower_bound(Variable(expr.space_dimension() - 1));
-  } else {
-    return expr.end();
-  }
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Last<Expression>::const_iterator
-Expression_Hide_Last<Expression>::lower_bound(Variable v) const {
-  PPL_ASSERT(v.space_dimension() <= space_dimension() + 1);
-  return expr.lower_bound(v);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::space_dimension() const {
-  if (hide_last) {
-    PPL_ASSERT(expr.space_dimension() != 0);
-    return expr.space_dimension() - 1;
-  } else
-    return expr.space_dimension();
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::coefficient(Variable v) const {
-  PPL_ASSERT(v.space_dimension() <= space_dimension());
-  return expr.coefficient(v);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::inhomogeneous_term() const {
-  return expr.inhomogeneous_term();
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::is_zero() const {
-  return expr.all_zeroes(0, space_dimension() + 1);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::all_homogeneous_terms_are_zero() const {
-  return expr.all_zeroes(1, space_dimension() + 1);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::is_equal_to(const Expression2& x) const {
-  const dimension_type dim1 = space_dimension();
-  const dimension_type dim2 = x.space_dimension();
-  if (dim1 != dim2)
-    return false;
-  return is_equal_to(x, 0, dim1 + 1);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::all_zeroes(const Variables_Set& vars) const {
-  PPL_ASSERT(vars.space_dimension() <= space_dimension());
-  return expr.all_zeroes(vars);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::get(dimension_type i) const {
-  PPL_ASSERT(i <= space_dimension());
-  return expr.get(i);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::get(Variable v) const {
-  PPL_ASSERT(v.space_dimension() <= space_dimension());
-  return expr.get(v);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::all_zeroes(dimension_type start,
-                                      dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.all_zeroes(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::num_zeroes(dimension_type start,
-                                      dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.num_zeroes(start, end);
-}
-
-template <typename Expression>
-inline Coefficient
-Expression_Hide_Last<Expression>::gcd(dimension_type start,
-                               dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.gcd(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::last_nonzero() const {
-  return expr.last_nonzero(0, space_dimension() + 1);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::last_nonzero(dimension_type first,
-                                        dimension_type last) const {
-  PPL_ASSERT(last <= space_dimension() + 1);
-  return expr.last_nonzero(first, last);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::first_nonzero(dimension_type first,
-                                         dimension_type last) const {
-  PPL_ASSERT(last <= space_dimension() + 1);
-  return expr.first_nonzero(first, last);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>
-::all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.all_zeroes_except(vars, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
-  if (x.empty())
-    return;
-  const dimension_type max_dim = *(x.end());
-  PPL_ASSERT(max_dim <= space_dimension());
-  expr.has_a_free_dimension_helper(x);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return expr.is_equal_to(x, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return x.is_equal_to(expr, start, end);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return expr.is_equal_to(x, c1, c2, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return x.is_equal_to(expr, c2, c1, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>::get_row(Dense_Row& row) const {
-  expr.get_row(row);
-  if (hide_last) {
-    PPL_ASSERT(row.size() != 0);
-    row.resize(row.size() - 1);
-  }
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>::get_row(Sparse_Row& row) const {
-  expr.get_row(row);
-  if (hide_last) {
-    PPL_ASSERT(row.size() != 0);
-    row.resize(row.size() - 1);
-  }
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  PPL_ASSERT(last.space_dimension() <= space_dimension() + 1);
-  PPL_ASSERT(last.space_dimension() <= x.space_dimension() + 1);
-  return expr.have_a_common_variable(x, first, last);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Linear_Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  PPL_ASSERT(last.space_dimension() <= space_dimension() + 1);
-  PPL_ASSERT(last.space_dimension() <= x.space_dimension() + 1);
-  return x.have_a_common_variable(expr, first, last);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Expression_Hide_Last_inlines_hh)
diff --git a/src/Expression_Hide_Last.types.hh b/src/Expression_Hide_Last.types.hh
deleted file mode 100644
index 057fbf1..0000000
--- a/src/Expression_Hide_Last.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Expression_Hide_Last_types_hh
-#define PPL_Expression_Hide_Last_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Expression>
-class Expression_Hide_Last;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Expression_Hide_Last_types_hh)
diff --git a/src/Expression_Hide_Last_defs.hh b/src/Expression_Hide_Last_defs.hh
new file mode 100644
index 0000000..7da0a9f
--- /dev/null
+++ b/src/Expression_Hide_Last_defs.hh
@@ -0,0 +1,165 @@
+/* Expression_Hide_Last class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Expression_Hide_Last_defs_hh
+#define PPL_Expression_Hide_Last_defs_hh 1
+
+#include "Expression_Hide_Last_types.hh"
+
+#include "Expression_Adapter_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An adapter for Linear_Expression that maybe hides the last coefficient.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Hide_Last
+  : public Expression_Adapter<T> {
+  typedef Expression_Adapter<T> base_type;
+public:
+  //! The type of this object.
+  typedef Expression_Hide_Last<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename base_type::inner_type inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename base_type::raw_type raw_type;
+
+  //! The type of const iterators on coefficients.
+  typedef typename base_type::const_iterator const_iterator;
+
+  //! Constructor.
+  explicit Expression_Hide_Last(const raw_type& expr, bool hide_last);
+
+  //! Iterator pointing after the last nonzero variable coefficient.
+  const_iterator end() const;
+
+  //! Iterator pointing to the first nonzero variable coefficient
+  //! of a variable bigger than or equal to \p v.
+  const_iterator lower_bound(Variable v) const;
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is zero.
+  bool is_zero() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are zero.
+  */
+  bool all_homogeneous_terms_are_zero() const;
+
+  /*! \brief Returns \p true if \p *this is equal to \p y.
+
+    Note that <CODE>(*this == y)</CODE> has a completely different meaning.
+  */
+  template <typename Expression>
+  bool is_equal_to(const Expression& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars is zero.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+  //! Returns the \p i -th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Returns the coefficient of variable \p v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is zero,
+    for each i in [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  //! Returns the number of zero coefficient in [start, end).
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end).
+    Returns zero if all the coefficients in the range are zero.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  //! Returns the index of the last nonzero element, or zero if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last),
+  //! or \p last if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there are no
+  //! nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Removes from set \p x all the indexes of nonzero elements in \p *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \c true if <CODE>(*this)[i]</CODE> is equal to <CODE>y[i]</CODE>,
+  //! for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \c true if <CODE>(*this)[i]*c1</CODE> is equal to
+  //! <CODE>y[i]*c2</CODE>, for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Sparse_Row& row) const;
+
+  //! Returns \c true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both \p *this and \p y.
+  template <typename Expression>
+  bool have_a_common_variable(const Expression& y,
+                              Variable first, Variable last) const;
+
+private:
+  //! Whether or not the last coefficient is hidden.
+  const bool hide_last_;
+};
+
+#include "Expression_Hide_Last_inlines.hh"
+
+#endif // !defined(PPL_Expression_Hide_Last_defs_hh)
diff --git a/src/Expression_Hide_Last_inlines.hh b/src/Expression_Hide_Last_inlines.hh
new file mode 100644
index 0000000..db169fc
--- /dev/null
+++ b/src/Expression_Hide_Last_inlines.hh
@@ -0,0 +1,241 @@
+/* Expression_Hide_Last class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Expression_Hide_Last_inlines_hh
+#define PPL_Expression_Hide_Last_inlines_hh 1
+
+#include "Variables_Set_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+Expression_Hide_Last<T>::Expression_Hide_Last(const raw_type& expr,
+                                              const bool hide_last)
+  : base_type(expr), hide_last_(hide_last) {
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::space_dimension() const {
+  dimension_type dim = this->inner().space_dimension();
+  if (hide_last_) {
+    PPL_ASSERT(dim > 0);
+    --dim;
+  }
+  return dim;
+}
+
+template <typename T>
+inline typename Expression_Hide_Last<T>::const_iterator
+Expression_Hide_Last<T>::end() const {
+  if (hide_last_) {
+    return this->inner().lower_bound(Variable(space_dimension()));
+  }
+  else {
+    return this->inner().end();
+  }
+}
+
+template <typename T>
+inline typename Expression_Hide_Last<T>::const_iterator
+Expression_Hide_Last<T>::lower_bound(Variable v) const {
+  PPL_ASSERT(v.space_dimension() <= space_dimension() + 1);
+  return this->inner().lower_bound(v);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Last<T>::coefficient(Variable v) const {
+  PPL_ASSERT(v.space_dimension() <= space_dimension());
+  return this->inner().coefficient(v);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::is_zero() const {
+  return this->inner().all_zeroes(0, space_dimension() + 1);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::all_homogeneous_terms_are_zero() const {
+  return this->inner().all_zeroes(1, space_dimension() + 1);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::is_equal_to(const Expression& y) const {
+  const dimension_type x_dim = space_dimension();
+  const dimension_type y_dim = y.space_dimension();
+  if (x_dim != y_dim)
+    return false;
+  return is_equal_to(y, 0, x_dim + 1);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::all_zeroes(const Variables_Set& vars) const {
+  PPL_ASSERT(vars.space_dimension() <= space_dimension());
+  return this->inner().all_zeroes(vars);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Last<T>::get(dimension_type i) const {
+  PPL_ASSERT(i <= space_dimension());
+  return this->inner().get(i);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Last<T>::get(Variable v) const {
+  PPL_ASSERT(v.space_dimension() <= space_dimension());
+  return this->inner().get(v);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::all_zeroes(dimension_type start,
+                                    dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().all_zeroes(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::num_zeroes(dimension_type start,
+                                    dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().num_zeroes(start, end);
+}
+
+template <typename T>
+inline Coefficient
+Expression_Hide_Last<T>::gcd(dimension_type start,
+                             dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().gcd(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::last_nonzero() const {
+  return this->inner().last_nonzero(0, space_dimension() + 1);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::last_nonzero(dimension_type first,
+                                      dimension_type last) const {
+  PPL_ASSERT(last <= space_dimension() + 1);
+  return this->inner().last_nonzero(first, last);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::first_nonzero(dimension_type first,
+                                       dimension_type last) const {
+  PPL_ASSERT(last <= space_dimension() + 1);
+  return this->inner().first_nonzero(first, last);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().all_zeroes_except(vars, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Last<T>
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
+  if (x.empty())
+    return;
+  PPL_ASSERT(*(--x.end()) <= space_dimension());
+  this->inner().has_a_free_dimension_helper(x);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::is_equal_to(const Expression& y,
+              dimension_type start, dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  PPL_ASSERT(end <= y.space_dimension() + 1);
+  return this->inner().is_equal_to(y, start, end);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::is_equal_to(const Expression& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  PPL_ASSERT(end <= y.space_dimension() + 1);
+  return this->inner().is_equal_to(y, c1, c2, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Last<T>::get_row(Dense_Row& row) const {
+  this->inner().get_row(row);
+  if (hide_last_) {
+    PPL_ASSERT(row.size() != 0);
+    row.resize(row.size() - 1);
+  }
+}
+
+template <typename T>
+inline void
+Expression_Hide_Last<T>::get_row(Sparse_Row& row) const {
+  this->inner().get_row(row);
+  if (hide_last_) {
+    PPL_ASSERT(row.size() != 0);
+    row.resize(row.size() - 1);
+  }
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::have_a_common_variable(const Expression& y,
+                         Variable first, Variable last) const {
+  PPL_ASSERT(last.space_dimension() <= space_dimension() + 1);
+  PPL_ASSERT(last.space_dimension() <= y.space_dimension() + 1);
+  return this->inner().have_a_common_variable(y, first, last);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Expression_Hide_Last_inlines_hh)
diff --git a/src/Expression_Hide_Last_types.hh b/src/Expression_Hide_Last_types.hh
new file mode 100644
index 0000000..ce37227
--- /dev/null
+++ b/src/Expression_Hide_Last_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Expression_Hide_Last_types_hh
+#define PPL_Expression_Hide_Last_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class Expression_Hide_Last;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Expression_Hide_Last_types_hh)
diff --git a/src/Float.cc b/src/Float.cc
index 798a10d..1571a1b 100644
--- a/src/Float.cc
+++ b/src/Float.cc
@@ -1,6 +1,6 @@
 /* IEC 559 floating point format related functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Float.defs.hh"
+#include "Float_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -38,6 +38,7 @@ const uint64_t float_ieee754_quad::MSP_POS_ZERO;
 const uint64_t float_ieee754_quad::MSP_NEG_ZERO;
 const uint64_t float_ieee754_quad::LSP_INF;
 const uint64_t float_ieee754_quad::LSP_ZERO;
+const uint64_t float_ieee754_quad::MSP_MAX;
 const uint64_t float_ieee754_quad::LSP_MAX;
 
 } // Parma_Polyhedra_Library
diff --git a/src/Float.defs.hh b/src/Float.defs.hh
deleted file mode 100644
index 5a3c54d..0000000
--- a/src/Float.defs.hh
+++ /dev/null
@@ -1,516 +0,0 @@
-/* IEC 559 floating point format related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Float_defs_hh
-#define PPL_Float_defs_hh 1
-
-#include "globals.types.hh"
-#include "meta_programming.hh"
-#include "compiler.hh"
-#include "assert.hh"
-#include "Concrete_Expression.types.hh"
-#include "Variable.types.hh"
-#include "Linear_Form.types.hh"
-#include <set>
-#include <cmath>
-#include <map>
-#include <gmp.h>
-
-#ifdef NAN
-#define PPL_NAN NAN
-#else
-#define PPL_NAN (HUGE_VAL - HUGE_VAL)
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_ieee754_half {
-  uint16_t word;
-  static const uint16_t SGN_MASK = 0x8000U;
-  static const uint16_t EXP_MASK = 0xfc00U;
-  static const uint16_t POS_INF = 0xfc00U;
-  static const uint16_t NEG_INF = 0x7c00U;
-  static const uint16_t POS_ZERO = 0x0000U;
-  static const uint16_t NEG_ZERO = 0x8000U;
-  static const unsigned int BASE = 2;
-  static const unsigned int EXPONENT_BITS = 5;
-  static const unsigned int MANTISSA_BITS = 10;
-  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
-  static const int EXPONENT_BIAS = EXPONENT_MAX;
-  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
-  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
-  static const Floating_Point_Format floating_point_format = IEEE754_HALF;
-  int inf_sign() const;
-  bool is_nan() const;
-  int zero_sign() const;
-  bool sign_bit() const;
-  void negate();
-  void dec();
-  void inc();
-  void set_max(bool negative);
-  void build(bool negative, mpz_t mantissa, int exponent);
-
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_ieee754_single {
-  uint32_t word;
-  static const uint32_t SGN_MASK = 0x80000000U;
-  static const uint32_t EXP_MASK = 0x7f800000U;
-  static const uint32_t POS_INF = 0x7f800000U;
-  static const uint32_t NEG_INF = 0xff800000U;
-  static const uint32_t POS_ZERO = 0x00000000U;
-  static const uint32_t NEG_ZERO = 0x80000000U;
-  static const unsigned int BASE = 2;
-  static const unsigned int EXPONENT_BITS = 8;
-  static const unsigned int MANTISSA_BITS = 23;
-  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
-  static const int EXPONENT_BIAS = EXPONENT_MAX;
-  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
-  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
-  static const Floating_Point_Format floating_point_format = IEEE754_SINGLE;
-  int inf_sign() const;
-  bool is_nan() const;
-  int zero_sign() const;
-  bool sign_bit() const;
-  void negate();
-  void dec();
-  void inc();
-  void set_max(bool negative);
-  void build(bool negative, mpz_t mantissa, int exponent);
-};
-
-#ifdef WORDS_BIGENDIAN
-#ifndef PPL_WORDS_BIGENDIAN
-#define PPL_WORDS_BIGENDIAN
-#endif
-#endif
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_ieee754_double {
-#ifdef PPL_WORDS_BIGENDIAN
-  uint32_t msp;
-  uint32_t lsp;
-#else
-  uint32_t lsp;
-  uint32_t msp;
-#endif
-  static const uint32_t MSP_SGN_MASK = 0x80000000U;
-  static const uint32_t MSP_POS_INF = 0x7ff00000U;
-  static const uint32_t MSP_NEG_INF = 0xfff00000U;
-  static const uint32_t MSP_POS_ZERO = 0x00000000U;
-  static const uint32_t MSP_NEG_ZERO = 0x80000000U;
-  static const uint32_t LSP_INF = 0;
-  static const uint32_t LSP_ZERO = 0;
-  static const uint32_t LSP_MAX = 0xffffffffU;
-  static const unsigned int BASE = 2;
-  static const unsigned int EXPONENT_BITS = 11;
-  static const unsigned int MANTISSA_BITS = 52;
-  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
-  static const int EXPONENT_BIAS = EXPONENT_MAX;
-  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
-  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
-  static const Floating_Point_Format floating_point_format = IEEE754_DOUBLE;
-  int inf_sign() const;
-  bool is_nan() const;
-  int zero_sign() const;
-  bool sign_bit() const;
-  void negate();
-  void dec();
-  void inc();
-  void set_max(bool negative);
-  void build(bool negative, mpz_t mantissa, int exponent);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_ibm_single {
-  uint32_t word;
-  static const uint32_t SGN_MASK = 0x80000000U;
-  static const uint32_t EXP_MASK = 0x7f000000U;
-  static const uint32_t POS_INF = 0x7f000000U;
-  static const uint32_t NEG_INF = 0xff000000U;
-  static const uint32_t POS_ZERO = 0x00000000U;
-  static const uint32_t NEG_ZERO = 0x80000000U;
-  static const unsigned int BASE = 16;
-  static const unsigned int EXPONENT_BITS = 7;
-  static const unsigned int MANTISSA_BITS = 24;
-  static const int EXPONENT_BIAS = 64;
-  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
-  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
-  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
-  static const Floating_Point_Format floating_point_format = IBM_SINGLE;
-  int inf_sign() const;
-  bool is_nan() const;
-  int zero_sign() const;
-  bool sign_bit() const;
-  void negate();
-  void dec();
-  void inc();
-  void set_max(bool negative);
-  void build(bool negative, mpz_t mantissa, int exponent);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_ibm_double {
-  static const unsigned int BASE = 16;
-  static const unsigned int EXPONENT_BITS = 7;
-  static const unsigned int MANTISSA_BITS = 56;
-  static const int EXPONENT_BIAS = 64;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_intel_double_extended {
-#ifdef PPL_WORDS_BIGENDIAN
-  uint32_t msp;
-  uint64_t lsp;
-#else
-  uint64_t lsp;
-  uint32_t msp;
-#endif
-  static const uint32_t MSP_SGN_MASK = 0x00008000U;
-  static const uint32_t MSP_POS_INF = 0x00007fffU;
-  static const uint32_t MSP_NEG_INF = 0x0000ffffU;
-  static const uint32_t MSP_POS_ZERO = 0x00000000U;
-  static const uint32_t MSP_NEG_ZERO = 0x00008000U;
-  static const uint64_t LSP_INF = static_cast<uint64_t>(0x8000000000000000ULL);
-  static const uint64_t LSP_ZERO = 0;
-  static const uint64_t LSP_DMAX = static_cast<uint64_t>(0x7fffffffffffffffULL);
-  static const uint64_t LSP_NMAX = static_cast<uint64_t>(0xffffffffffffffffULL);
-  static const unsigned int BASE = 2;
-  static const unsigned int EXPONENT_BITS = 15;
-  static const unsigned int MANTISSA_BITS = 63;
-  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
-  static const int EXPONENT_BIAS = EXPONENT_MAX;
-  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
-  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
-  static const Floating_Point_Format floating_point_format =
-                                     INTEL_DOUBLE_EXTENDED;
-  int inf_sign() const;
-  bool is_nan() const;
-  int zero_sign() const;
-  bool sign_bit() const;
-  void negate();
-  void dec();
-  void inc();
-  void set_max(bool negative);
-  void build(bool negative, mpz_t mantissa, int exponent);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct float_ieee754_quad {
-#ifdef PPL_WORDS_BIGENDIAN
-  uint64_t msp;
-  uint64_t lsp;
-#else
-  uint64_t lsp;
-  uint64_t msp;
-#endif
-  static const uint64_t MSP_SGN_MASK = static_cast<uint64_t>(0x8000000000000000ULL);
-  static const uint64_t MSP_POS_INF = static_cast<uint64_t>(0x7fff000000000000ULL);
-  static const uint64_t MSP_NEG_INF = static_cast<uint64_t>(0xffff000000000000ULL);
-  static const uint64_t MSP_POS_ZERO = static_cast<uint64_t>(0x0000000000000000ULL);
-  static const uint64_t MSP_NEG_ZERO = static_cast<uint64_t>(0x8000000000000000ULL);
-  static const uint64_t LSP_INF = 0;
-  static const uint64_t LSP_ZERO = 0;
-  static const uint64_t LSP_MAX = static_cast<uint64_t>(0xffffffffffffffffULL);
-  static const unsigned int BASE = 2;
-  static const unsigned int EXPONENT_BITS = 15;
-  static const unsigned int MANTISSA_BITS = 112;
-  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
-  static const int EXPONENT_BIAS = EXPONENT_MAX;
-  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
-  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
-  int inf_sign() const;
-  bool is_nan() const;
-  int zero_sign() const;
-  bool sign_bit() const;
-  void negate();
-  void dec();
-  void inc();
-  void set_max(bool negative);
-  void build(bool negative, mpz_t mantissa, int exponent);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Float : public False { };
-
-#if PPL_SUPPORTED_FLOAT
-template <>
-class Float<float> : public True {
-public:
-#if PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_HALF
-  typedef float_ieee754_half Binary;
-#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_SINGLE
-  typedef float_ieee754_single Binary;
-#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_DOUBLE
-  typedef float_ieee754_double Binary;
-#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IBM_SINGLE
-  typedef float_ibm_single Binary;
-#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_QUAD
-  typedef float_ieee754_quad Binary;
-#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_INTEL_DOUBLE_EXTENDED
-  typedef float_intel_double_extended Binary;
-#else
-#error "Invalid value for PPL_CXX_FLOAT_BINARY_FORMAT"
-#endif
-  union {
-    float number;
-    Binary binary;
-  } u;
-  Float();
-  Float(float v);
-  float value();
-};
-#endif
-
-#if PPL_SUPPORTED_DOUBLE
-template <>
-class Float<double> : public True {
-public:
-#if PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_HALF
-  typedef float_ieee754_half Binary;
-#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_SINGLE
-  typedef float_ieee754_single Binary;
-#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_DOUBLE
-  typedef float_ieee754_double Binary;
-#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IBM_SINGLE
-  typedef float_ibm_single Binary;
-#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_QUAD
-  typedef float_ieee754_quad Binary;
-#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_INTEL_DOUBLE_EXTENDED
-  typedef float_intel_double_extended Binary;
-#else
-#error "Invalid value for PPL_CXX_DOUBLE_BINARY_FORMAT"
-#endif
-  union {
-    double number;
-    Binary binary;
-  } u;
-  Float();
-  Float(double v);
-  double value();
-};
-#endif
-
-#if PPL_SUPPORTED_LONG_DOUBLE
-template <>
-class Float<long double> : public True {
-public:
-#if PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_HALF
-  typedef float_ieee754_half Binary;
-#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_SINGLE
-  typedef float_ieee754_single Binary;
-#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_DOUBLE
-  typedef float_ieee754_double Binary;
-#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IBM_SINGLE
-  typedef float_ibm_single Binary;
-#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_QUAD
-  typedef float_ieee754_quad Binary;
-#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_INTEL_DOUBLE_EXTENDED
-  typedef float_intel_double_extended Binary;
-#else
-#error "Invalid value for PPL_CXX_LONG_DOUBLE_BINARY_FORMAT"
-#endif
-  union {
-    long double number;
-    Binary binary;
-  } u;
-  Float();
-  Float(long double v);
-  long double value();
-};
-#endif
-
-// FIXME: is this the right place for this function?
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  If \p v is nonzero, returns the position of the most significant bit
-  in \p a.
-
-  The behavior is undefined if \p v is zero.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-unsigned int msb_position(unsigned long long v);
-
-/*! \brief
-  An abstract class to be implemented by an external analyzer such
-  as ECLAIR in order to provide to the PPL the necessary information
-  for performing the analysis of floating point computations.
-
-  \par Template type parameters
-
-  - The class template parameter \p Target specifies the implementation
-  of Concrete_Expression to be used.
-  - The class template parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain. The interval bounds
-  should have a floating point type.
-*/
-template <typename Target, typename FP_Interval_Type>
-class FP_Oracle {
-public:
-  /*
-    FIXME: the const qualifiers on expressions may raise CLANG
-    compatibility issues. It may be necessary to omit them.
-  */
-
-  /*! \brief
-    Asks the external analyzer for an interval that correctly
-    approximates the floating point entity referenced by \p dim.
-    Result is stored into \p result.
-
-    \return <CODE>true</CODE> if the analyzer was able to find a correct
-    approximation, <CODE>false</CODE> otherwise.
-  */
-  virtual bool get_interval(dimension_type dim, FP_Interval_Type& result) const
-    = 0;
-
-  /*! \brief
-    Asks the external analyzer for an interval that correctly
-    approximates the value of floating point constant \p expr.
-    Result is stored into \p result.
-
-    \return <CODE>true</CODE> if the analyzer was able to find a correct
-    approximation, <CODE>false</CODE> otherwise.
-  */
-  virtual bool get_fp_constant_value(
-               const Floating_Point_Constant<Target>& expr,
-                     FP_Interval_Type& result) const = 0;
-
-  /*! \brief
-    Asks the external analyzer for an interval that correctly approximates
-    the value of \p expr, which must be of integer type.
-    Result is stored into \p result.
-
-    \return <CODE>true</CODE> if the analyzer was able to find a correct
-    approximation, <CODE>false</CODE> otherwise.
-  */
-  virtual bool get_integer_expr_value(const Concrete_Expression<Target>& expr,
-                                      FP_Interval_Type& result) const = 0;
-
-  /*! \brief
-    Asks the external analyzer for the possible space dimensions that
-    are associated to the approximable reference \p expr.
-    Result is stored into \p result.
-
-    \return <CODE>true</CODE> if the analyzer was able to return
-    the (possibly empty!) set, <CODE>false</CODE> otherwise.
-
-    The resulting set MUST NOT contain <CODE>not_a_dimension()</CODE>.
-  */
-  virtual bool get_associated_dimensions(
-	  const Approximable_Reference<Target>& expr,
-          std::set<dimension_type>& result) const = 0;
-
-};
-
-/* FIXME: some of the following  documentation should probably be
-   under PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS */
-
-/*! \brief \relates Float
-  Returns <CODE>true</CODE> if and only if there is some floating point
-  number that is representable by \p f2 but not by \p f1.
-*/
-bool is_less_precise_than(Floating_Point_Format f1, Floating_Point_Format f2);
-
-/*! \brief \relates Float
-  Computes the absolute error of floating point computations.
-
-  \par Template type parameters
-
-  - The class template parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain. The interval bounds
-  should have a floating point type.
-
-  \param analyzed_format The floating point format used by the analyzed
-  program.
-
-  \return The interval \f$[-\omega, \omega]\f$ where \f$\omega\f$ is the
-  smallest non-zero positive number in the less precise floating point
-  format between the analyzer format and the analyzed format.
-*/
-template <typename FP_Interval_Type>
-const FP_Interval_Type&
-compute_absolute_error(Floating_Point_Format analyzed_format);
-
-/*! \brief \relates Linear_Form
-  Discards all linear forms containing variable \p var from the
-  linear form abstract store \p lf_store.
-*/
-template <typename FP_Interval_Type>
-void
-discard_occurrences(std::map<dimension_type,
-                             Linear_Form<FP_Interval_Type> >& lf_store,
-                    Variable var);
-
-/*! \brief \relates Linear_Form
-  Assigns the linear form \p lf to \p var in the linear form abstract
-  store \p lf_store, then discards all occurrences of \p var from it.
-*/
-template <typename FP_Interval_Type>
-void
-affine_form_image(std::map<dimension_type,
-                           Linear_Form<FP_Interval_Type> >& lf_store,
-                  Variable var,
-                  const Linear_Form<FP_Interval_Type>& lf);
-
-/*! \brief \relates Linear_Form
-  Discards from \p ls1 all linear forms but those that are associated
-  to the same variable in \p ls2.
-*/
-template <typename FP_Interval_Type>
-void
-upper_bound_assign(std::map<dimension_type,
-                            Linear_Form<FP_Interval_Type> >& ls1,
-                   const std::map<dimension_type,
-                                  Linear_Form<FP_Interval_Type> >& ls2);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Float.inlines.hh"
-#include "Float.templates.hh"
-
-#endif // !defined(PPL_Float_defs_hh)
diff --git a/src/Float.inlines.hh b/src/Float.inlines.hh
deleted file mode 100644
index 09933e7..0000000
--- a/src/Float.inlines.hh
+++ /dev/null
@@ -1,536 +0,0 @@
-/* IEC 559 floating point format related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Float_inlines_hh
-#define PPL_Float_inlines_hh 1
-
-#include <climits>
-#include "Variable.defs.hh"
-#include "Linear_Form.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline int
-float_ieee754_half::inf_sign() const {
-  if (word == NEG_INF)
-    return -1;
-  if (word == POS_INF)
-    return 1;
-  return 0;
-}
-
-inline bool
-float_ieee754_half::is_nan() const {
-  return (word & ~SGN_MASK) > POS_INF;
-}
-
-inline int
-float_ieee754_half::zero_sign() const {
-  if (word == NEG_ZERO)
-    return -1;
-  if (word == POS_ZERO)
-    return 1;
-  return 0;
-}
-
-inline void
-float_ieee754_half::negate() {
-  word ^= SGN_MASK;
-}
-
-inline bool
-float_ieee754_half::sign_bit() const {
-  return (word & SGN_MASK) != 0;
-}
-
-inline void
-float_ieee754_half::dec() {
-  --word;
-}
-
-inline void
-float_ieee754_half::inc() {
-  ++word;
-}
-
-inline void
-float_ieee754_half::set_max(bool negative) {
-  word = 0x7bffU;
-  if (negative)
-    word |= SGN_MASK;
-}
-
-inline void
-float_ieee754_half::build(bool negative, mpz_t mantissa, int exponent) {
-  word = static_cast<uint16_t>(mpz_get_ui(mantissa)
-                               & ((1UL << MANTISSA_BITS) - 1));
-  if (negative)
-    word |= SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
-  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
-  word |= static_cast<uint16_t>(exponent_repr) << MANTISSA_BITS;
-}
-
-inline int
-float_ieee754_single::inf_sign() const {
-  if (word == NEG_INF)
-    return -1;
-  if (word == POS_INF)
-    return 1;
-  return 0;
-}
-
-inline bool
-float_ieee754_single::is_nan() const {
-  return (word & ~SGN_MASK) > POS_INF;
-}
-
-inline int
-float_ieee754_single::zero_sign() const {
-  if (word == NEG_ZERO)
-    return -1;
-  if (word == POS_ZERO)
-    return 1;
-  return 0;
-}
-
-inline void
-float_ieee754_single::negate() {
-  word ^= SGN_MASK;
-}
-
-inline bool
-float_ieee754_single::sign_bit() const {
-  return (word & SGN_MASK) != 0;
-}
-
-inline void
-float_ieee754_single::dec() {
-  --word;
-}
-
-inline void
-float_ieee754_single::inc() {
-  ++word;
-}
-
-inline void
-float_ieee754_single::set_max(bool negative) {
-  word = 0x7f7fffffU;
-  if (negative)
-    word |= SGN_MASK;
-}
-
-inline void
-float_ieee754_single::build(bool negative, mpz_t mantissa, int exponent) {
-  word = static_cast<uint32_t>(mpz_get_ui(mantissa)
-                               & ((1UL << MANTISSA_BITS) - 1));
-  if (negative)
-    word |= SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
-  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
-  word |= static_cast<uint32_t>(exponent_repr) << MANTISSA_BITS;
-}
-
-inline int
-float_ieee754_double::inf_sign() const {
-  if (lsp != LSP_INF)
-    return 0;
-  if (msp == MSP_NEG_INF)
-    return -1;
-  if (msp == MSP_POS_INF)
-    return 1;
-  return 0;
-}
-
-inline bool
-float_ieee754_double::is_nan() const {
-  uint32_t a = msp & ~MSP_SGN_MASK;
-  return a > MSP_POS_INF || (a == MSP_POS_INF && lsp != LSP_INF);
-}
-
-inline int
-float_ieee754_double::zero_sign() const {
-  if (lsp != LSP_ZERO)
-    return 0;
-  if (msp == MSP_NEG_ZERO)
-    return -1;
-  if (msp == MSP_POS_ZERO)
-    return 1;
-  return 0;
-}
-
-inline void
-float_ieee754_double::negate() {
-  msp ^= MSP_SGN_MASK;
-}
-
-inline bool
-float_ieee754_double::sign_bit() const {
-  return (msp & MSP_SGN_MASK) != 0;
-}
-
-inline void
-float_ieee754_double::dec() {
-  if (lsp == 0) {
-    --msp;
-    lsp = LSP_MAX;
-  }
-  else
-    --lsp;
-}
-
-inline void
-float_ieee754_double::inc() {
-  if (lsp == LSP_MAX) {
-    ++msp;
-    lsp = 0;
-  }
-  else
-    ++lsp;
-}
-
-inline void
-float_ieee754_double::set_max(bool negative) {
-  msp = 0x7fefffffU;
-  lsp = 0xffffffffU;
-  if (negative)
-    msp |= MSP_SGN_MASK;
-}
-
-inline void
-float_ieee754_double::build(bool negative, mpz_t mantissa, int exponent) {
-  unsigned long m;
-#if ULONG_MAX == 0xffffffffUL
-  lsp = mpz_get_ui(mantissa);
-  mpz_tdiv_q_2exp(mantissa, mantissa, 32);
-  m = mpz_get_ui(mantissa);
-#else
-  m = mpz_get_ui(mantissa);
-  lsp = static_cast<uint32_t>(m & LSP_MAX);
-  m >>= 32;
-#endif
-  msp = static_cast<uint32_t>(m & ((1UL << (MANTISSA_BITS - 32)) - 1));
-  if (negative)
-    msp |= MSP_SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
-  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
-  msp |= static_cast<uint32_t>(exponent_repr) << (MANTISSA_BITS - 32);
-}
-
-inline int
-float_ibm_single::inf_sign() const {
-  if (word == NEG_INF)
-    return -1;
-  if (word == POS_INF)
-    return 1;
-  return 0;
-}
-
-inline bool
-float_ibm_single::is_nan() const {
-  return (word & ~SGN_MASK) > POS_INF;
-}
-
-inline int
-float_ibm_single::zero_sign() const {
-  if (word == NEG_ZERO)
-    return -1;
-  if (word == POS_ZERO)
-    return 1;
-  return 0;
-}
-
-inline void
-float_ibm_single::negate() {
-  word ^= SGN_MASK;
-}
-
-inline bool
-float_ibm_single::sign_bit() const {
-  return (word & SGN_MASK) != 0;
-}
-
-inline void
-float_ibm_single::dec() {
-  --word;
-}
-
-inline void
-float_ibm_single::inc() {
-  ++word;
-}
-
-inline void
-float_ibm_single::set_max(bool negative) {
-  word = 0x7f000000U;
-  if (negative)
-    word |= SGN_MASK;
-}
-
-inline void
-float_ibm_single::build(bool negative, mpz_t mantissa, int exponent) {
-  word = static_cast<uint32_t>(mpz_get_ui(mantissa)
-                               & ((1UL << MANTISSA_BITS) - 1));
-  if (negative)
-    word |= SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
-  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
-  word |= static_cast<uint32_t>(exponent_repr) << MANTISSA_BITS;
-}
-
-inline int
-float_intel_double_extended::inf_sign() const {
-  if (lsp != LSP_INF)
-    return 0;
-  uint32_t a = msp & MSP_NEG_INF;
-  if (a == MSP_NEG_INF)
-    return -1;
-  if (a == MSP_POS_INF)
-    return 1;
-  return 0;
-}
-
-inline bool
-float_intel_double_extended::is_nan() const {
-  return (msp & MSP_POS_INF) == MSP_POS_INF
-    && lsp != LSP_INF;
-}
-
-inline int
-float_intel_double_extended::zero_sign() const {
-  if (lsp != LSP_ZERO)
-    return 0;
-  uint32_t a = msp & MSP_NEG_INF;
-  if (a == MSP_NEG_ZERO)
-    return -1;
-  if (a == MSP_POS_ZERO)
-    return 1;
-  return 0;
-}
-
-inline void
-float_intel_double_extended::negate() {
-  msp ^= MSP_SGN_MASK;
-}
-
-inline bool
-float_intel_double_extended::sign_bit() const {
-  return (msp & MSP_SGN_MASK) != 0;
-}
-
-inline void
-float_intel_double_extended::dec() {
-  if ((lsp & LSP_DMAX) == 0) {
-    --msp;
-    lsp = ((msp & MSP_NEG_INF) == 0) ? LSP_DMAX : LSP_NMAX;
-  }
-  else
-    --lsp;
-}
-
-inline void
-float_intel_double_extended::inc() {
-  if ((lsp & LSP_DMAX) == LSP_DMAX) {
-    ++msp;
-    lsp = LSP_DMAX + 1;
-  }
-  else
-    ++lsp;
-}
-
-inline void
-float_intel_double_extended::set_max(bool negative) {
-  msp = 0x00007ffeU;
-  lsp = static_cast<uint64_t>(0xffffffffffffffffULL);
-  if (negative)
-    msp |= MSP_SGN_MASK;
-}
-
-inline void
-float_intel_double_extended::build(bool negative,
-				   mpz_t mantissa, int exponent) {
-#if ULONG_MAX == 0xffffffffUL
-  mpz_export(&lsp, 0, -1, 8, 0, 0, mantissa);
-#else
-  lsp = mpz_get_ui(mantissa);
-#endif
-  msp = (negative ? MSP_SGN_MASK : 0);
-  int exponent_repr = exponent + EXPONENT_BIAS;
-  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
-  msp |= static_cast<uint32_t>(exponent_repr);
-}
-
-inline int
-float_ieee754_quad::inf_sign() const {
-  if (lsp != LSP_INF)
-    return 0;
-  if (msp == MSP_NEG_INF)
-    return -1;
-  if (msp == MSP_POS_INF)
-    return 1;
-  return 0;
-}
-
-inline bool
-float_ieee754_quad::is_nan() const {
-  return (msp & ~MSP_SGN_MASK) == MSP_POS_INF
-    && lsp != LSP_INF;
-}
-
-inline int
-float_ieee754_quad::zero_sign() const {
-  if (lsp != LSP_ZERO)
-    return 0;
-  if (msp == MSP_NEG_ZERO)
-    return -1;
-  if (msp == MSP_POS_ZERO)
-    return 1;
-  return 0;
-}
-
-inline void
-float_ieee754_quad::negate() {
-  msp ^= MSP_SGN_MASK;
-}
-
-inline bool
-float_ieee754_quad::sign_bit() const {
-  return (msp & MSP_SGN_MASK) != 0;
-}
-
-inline void
-float_ieee754_quad::dec() {
-  if (lsp == 0) {
-    --msp;
-    lsp = LSP_MAX;
-  }
-  else
-    --lsp;
-}
-
-inline void
-float_ieee754_quad::inc() {
-  if (lsp == LSP_MAX) {
-    ++msp;
-    lsp = 0;
-  }
-  else
-    ++lsp;
-}
-
-inline void
-float_ieee754_quad::set_max(bool negative) {
-  msp = static_cast<uint64_t>(0x7ffeffffffffffffULL);
-  lsp = static_cast<uint64_t>(0xffffffffffffffffULL);
-  if (negative)
-    msp |= MSP_SGN_MASK;
-}
-
-inline void
-float_ieee754_quad::build(bool negative, mpz_t mantissa, int exponent) {
-  uint64_t parts[2];
-  mpz_export(parts, 0, -1, 8, 0, 0, mantissa);
-  lsp = parts[0];
-  msp = parts[1];
-  msp &= ((static_cast<uint64_t>(1) << (MANTISSA_BITS - 64)) - 1);
-  if (negative)
-    msp |= MSP_SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
-  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
-  msp |= static_cast<uint64_t>(exponent_repr) << (MANTISSA_BITS - 64);
-}
-
-inline bool
-is_less_precise_than(Floating_Point_Format f1, Floating_Point_Format f2) {
-  return f1 < f2;
-}
-
-inline unsigned int
-msb_position(unsigned long long v) {
-  return static_cast<unsigned int>(sizeof_to_bits(sizeof(v))) - 1U - clz(v);
-}
-
-template <typename FP_Interval_Type>
-inline void
-affine_form_image(std::map<dimension_type,
-                           Linear_Form<FP_Interval_Type> >& lf_store,
-                  const Variable var,
-                  const Linear_Form<FP_Interval_Type>& lf) {
-  // Assign the new linear form for var.
-  lf_store[var.id()] = lf;
-  // Now invalidate all linear forms in which var occurs.
-  discard_occurrences(lf_store, var);
-}
-
-#if PPL_SUPPORTED_FLOAT
-inline
-Float<float>::Float() {
-}
-
-inline
-Float<float>::Float(float v) {
-  u.number = v;
-}
-
-inline float
-Float<float>::value() {
-  return u.number;
-}
-#endif
-
-#if PPL_SUPPORTED_DOUBLE
-inline
-Float<double>::Float() {
-}
-
-inline
-Float<double>::Float(double v) {
-  u.number = v;
-}
-
-inline double
-Float<double>::value() {
-  return u.number;
-}
-#endif
-
-#if PPL_SUPPORTED_LONG_DOUBLE
-inline
-Float<long double>::Float() {
-}
-
-inline
-Float<long double>::Float(long double v) {
-  u.number = v;
-}
-
-inline long double
-Float<long double>::value() {
-  return u.number;
-}
-#endif
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Float_inlines_hh)
diff --git a/src/Float.templates.hh b/src/Float.templates.hh
deleted file mode 100644
index 871ff5a..0000000
--- a/src/Float.templates.hh
+++ /dev/null
@@ -1,167 +0,0 @@
-/* IEC 559 floating point format related functions:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Float_templates_hh
-#define PPL_Float_templates_hh 1
-
-#include "Variable.defs.hh"
-#include "Linear_Form.defs.hh"
-#include <cmath>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type>
-const FP_Interval_Type& compute_absolute_error(
-		        const Floating_Point_Format analyzed_format) {
-  typedef typename FP_Interval_Type::boundary_type analyzer_format;
-
-  // FIXME: check if initializing caches with EMPTY is better.
-  static const FP_Interval_Type ZERO_INTERVAL = FP_Interval_Type(0);
-  // Cached results for each different analyzed format.
-  static FP_Interval_Type ieee754_half_result = ZERO_INTERVAL;
-  static FP_Interval_Type ieee754_single_result = ZERO_INTERVAL;
-  static FP_Interval_Type ieee754_double_result = ZERO_INTERVAL;
-  static FP_Interval_Type ibm_single_result = ZERO_INTERVAL;
-  static FP_Interval_Type ieee754_quad_result = ZERO_INTERVAL;
-  static FP_Interval_Type intel_double_extended_result = ZERO_INTERVAL;
-
-  FP_Interval_Type* to_compute = NULL;
-  // Get the necessary information on the analyzed's format.
-  unsigned int f_base;
-  int f_exponent_bias;
-  unsigned int f_mantissa_bits;
-  switch (analyzed_format) {
-    case IEEE754_HALF:
-      if (ieee754_half_result != ZERO_INTERVAL)
-        return ieee754_half_result;
-
-      to_compute = &ieee754_half_result;
-      f_base = float_ieee754_half::BASE;
-      f_exponent_bias = float_ieee754_half::EXPONENT_BIAS;
-      f_mantissa_bits = float_ieee754_half::MANTISSA_BITS;
-      break;
-    case IEEE754_SINGLE:
-      if (ieee754_single_result != ZERO_INTERVAL)
-        return ieee754_single_result;
-
-      to_compute = &ieee754_single_result;
-      f_base = float_ieee754_single::BASE;
-      f_exponent_bias = float_ieee754_single::EXPONENT_BIAS;
-      f_mantissa_bits = float_ieee754_single::MANTISSA_BITS;
-      break;
-    case IEEE754_DOUBLE:
-      if (ieee754_double_result != ZERO_INTERVAL)
-        return ieee754_double_result;
-
-      to_compute = &ieee754_double_result;
-      f_base = float_ieee754_double::BASE;
-      f_exponent_bias = float_ieee754_double::EXPONENT_BIAS;
-      f_mantissa_bits = float_ieee754_double::MANTISSA_BITS;
-      break;
-    case IBM_SINGLE:
-      if (ibm_single_result != ZERO_INTERVAL)
-        return ibm_single_result;
-
-      to_compute = &ibm_single_result;
-      f_base = float_ibm_single::BASE;
-      f_exponent_bias = float_ibm_single::EXPONENT_BIAS;
-      f_mantissa_bits = float_ibm_single::MANTISSA_BITS;
-      break;
-    case IEEE754_QUAD:
-      if (ieee754_quad_result != ZERO_INTERVAL)
-        return ieee754_quad_result;
-
-      to_compute = &ieee754_quad_result;
-      f_base = float_ieee754_quad::BASE;
-      f_exponent_bias = float_ieee754_quad::EXPONENT_BIAS;
-      f_mantissa_bits = float_ieee754_quad::MANTISSA_BITS;
-      break;
-    case INTEL_DOUBLE_EXTENDED:
-      if (intel_double_extended_result != ZERO_INTERVAL)
-        return intel_double_extended_result;
-
-      to_compute = &intel_double_extended_result;
-      f_base = float_intel_double_extended::BASE;
-      f_exponent_bias = float_intel_double_extended::EXPONENT_BIAS;
-      f_mantissa_bits = float_intel_double_extended::MANTISSA_BITS;
-      break;
-    default:
-      PPL_UNREACHABLE;
-      break;
-  }
-
-  PPL_ASSERT(to_compute != NULL);
-
-  // We assume that f_base is a power of 2.
-  analyzer_format omega;
-  int power = static_cast<int>(msb_position(f_base))
-    * ((1 - f_exponent_bias) - static_cast<int>(f_mantissa_bits));
-  omega = std::max(static_cast<analyzer_format>(ldexp(1.0, power)),
-                   std::numeric_limits<analyzer_format>::denorm_min());
-
-  to_compute->build(i_constraint(GREATER_OR_EQUAL, -omega),
-                    i_constraint(LESS_OR_EQUAL, omega));
-  return *to_compute;
-}
-
-template <typename FP_Interval_Type>
-void
-discard_occurrences(std::map<dimension_type,
-                             Linear_Form<FP_Interval_Type> >& lf_store,
-                    Variable var) {
-  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
-  typedef typename std::map<dimension_type, FP_Linear_Form>::iterator Iter;
-  for (Iter i = lf_store.begin(); i != lf_store.end(); ) {
-    if((i->second).coefficient(var) != 0)
-      i = lf_store.erase(i);
-    else
-      ++i;
-  }
-}
-
-/* FIXME: improve efficiency by adding the list of potentially conflicting
-   variables as an argument. */
-template <typename FP_Interval_Type>
-void upper_bound_assign(std::map<dimension_type,
-			         Linear_Form<FP_Interval_Type> >& ls1,
-                        const std::map<dimension_type,
-			               Linear_Form<FP_Interval_Type> >& ls2) {
-  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
-  typedef typename std::map<dimension_type, FP_Linear_Form>::iterator Iter;
-  typedef typename std::map<dimension_type,
-                            FP_Linear_Form>::const_iterator Const_Iter;
-
-  Const_Iter i2_end = ls2.end();
-  for (Iter i1 = ls1.begin(), i1_end = ls1.end(); i1 != i1_end; ) {
-    Const_Iter i2 = ls2.find(i1->first);
-    if ((i2 == i2_end) || (i1->second != i2->second))
-      i1 = ls1.erase(i1);
-    else
-      ++i1;
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Float_templates_hh)
diff --git a/src/Float_defs.hh b/src/Float_defs.hh
new file mode 100644
index 0000000..090e70e
--- /dev/null
+++ b/src/Float_defs.hh
@@ -0,0 +1,523 @@
+/* IEC 559 floating point format related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Float_defs_hh
+#define PPL_Float_defs_hh 1
+
+#include "globals_types.hh"
+#include "meta_programming.hh"
+#include "compiler.hh"
+#include "assert.hh"
+#include "Concrete_Expression_types.hh"
+#include "Variable_types.hh"
+#include "Linear_Form_types.hh"
+#include <set>
+#include <cmath>
+#include <map>
+#include <gmp.h>
+
+#ifdef NAN
+#define PPL_NAN NAN
+#else
+#define PPL_NAN (HUGE_VAL - HUGE_VAL)
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_ieee754_half {
+  uint16_t word;
+  static const uint16_t SGN_MASK = 0x8000U;
+  static const uint16_t EXP_MASK = 0xfc00U;
+  static const uint16_t WRD_MAX = 0x7bffU;
+  static const uint16_t POS_INF = 0x7c00U;
+  static const uint16_t NEG_INF = 0xfc00U;
+  static const uint16_t POS_ZERO = 0x0000U;
+  static const uint16_t NEG_ZERO = 0x8000U;
+  static const unsigned int BASE = 2;
+  static const unsigned int EXPONENT_BITS = 5;
+  static const unsigned int MANTISSA_BITS = 10;
+  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
+  static const int EXPONENT_BIAS = EXPONENT_MAX;
+  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
+  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format = IEEE754_HALF;
+  int inf_sign() const;
+  bool is_nan() const;
+  int zero_sign() const;
+  bool sign_bit() const;
+  void negate();
+  void dec();
+  void inc();
+  void set_max(bool negative);
+  void build(bool negative, mpz_t mantissa, int exponent);
+
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_ieee754_single {
+  uint32_t word;
+  static const uint32_t SGN_MASK = 0x80000000U;
+  static const uint32_t EXP_MASK = 0x7f800000U;
+  static const uint32_t WRD_MAX = 0x7f7fffffU;
+  static const uint32_t POS_INF = 0x7f800000U;
+  static const uint32_t NEG_INF = 0xff800000U;
+  static const uint32_t POS_ZERO = 0x00000000U;
+  static const uint32_t NEG_ZERO = 0x80000000U;
+  static const unsigned int BASE = 2;
+  static const unsigned int EXPONENT_BITS = 8;
+  static const unsigned int MANTISSA_BITS = 23;
+  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
+  static const int EXPONENT_BIAS = EXPONENT_MAX;
+  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
+  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format = IEEE754_SINGLE;
+  int inf_sign() const;
+  bool is_nan() const;
+  int zero_sign() const;
+  bool sign_bit() const;
+  void negate();
+  void dec();
+  void inc();
+  void set_max(bool negative);
+  void build(bool negative, mpz_t mantissa, int exponent);
+};
+
+#ifdef WORDS_BIGENDIAN
+#ifndef PPL_WORDS_BIGENDIAN
+#define PPL_WORDS_BIGENDIAN
+#endif
+#endif
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_ieee754_double {
+#ifdef PPL_WORDS_BIGENDIAN
+  uint32_t msp;
+  uint32_t lsp;
+#else
+  uint32_t lsp;
+  uint32_t msp;
+#endif
+  static const uint32_t MSP_SGN_MASK = 0x80000000U;
+  static const uint32_t MSP_POS_INF = 0x7ff00000U;
+  static const uint32_t MSP_NEG_INF = 0xfff00000U;
+  static const uint32_t MSP_POS_ZERO = 0x00000000U;
+  static const uint32_t MSP_NEG_ZERO = 0x80000000U;
+  static const uint32_t LSP_INF = 0;
+  static const uint32_t LSP_ZERO = 0;
+  static const uint32_t MSP_MAX = 0x7fefffffU;
+  static const uint32_t LSP_MAX = 0xffffffffU;
+  static const unsigned int BASE = 2;
+  static const unsigned int EXPONENT_BITS = 11;
+  static const unsigned int MANTISSA_BITS = 52;
+  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
+  static const int EXPONENT_BIAS = EXPONENT_MAX;
+  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
+  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format = IEEE754_DOUBLE;
+  int inf_sign() const;
+  bool is_nan() const;
+  int zero_sign() const;
+  bool sign_bit() const;
+  void negate();
+  void dec();
+  void inc();
+  void set_max(bool negative);
+  void build(bool negative, mpz_t mantissa, int exponent);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_ibm_single {
+  uint32_t word;
+  static const uint32_t SGN_MASK = 0x80000000U;
+  static const uint32_t EXP_MASK = 0x7f000000U;
+  static const uint32_t WRD_MAX = 0x7fffffffU;
+  static const uint32_t POS_INF = 0x7f000000U;
+  static const uint32_t NEG_INF = 0xff000000U;
+  static const uint32_t POS_ZERO = 0x00000000U;
+  static const uint32_t NEG_ZERO = 0x80000000U;
+  static const unsigned int BASE = 16;
+  static const unsigned int EXPONENT_BITS = 7;
+  static const unsigned int MANTISSA_BITS = 24;
+  static const int EXPONENT_BIAS = 64;
+  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
+  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
+  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format = IBM_SINGLE;
+  int inf_sign() const;
+  bool is_nan() const;
+  int zero_sign() const;
+  bool sign_bit() const;
+  void negate();
+  void dec();
+  void inc();
+  void set_max(bool negative);
+  void build(bool negative, mpz_t mantissa, int exponent);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_ibm_double {
+  static const unsigned int BASE = 16;
+  static const unsigned int EXPONENT_BITS = 7;
+  static const unsigned int MANTISSA_BITS = 56;
+  static const int EXPONENT_BIAS = 64;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_intel_double_extended {
+#ifdef PPL_WORDS_BIGENDIAN
+  uint32_t msp;
+  uint64_t lsp;
+#else
+  uint64_t lsp;
+  uint32_t msp;
+#endif
+  static const uint32_t MSP_SGN_MASK = 0x00008000U;
+  static const uint32_t MSP_POS_INF = 0x00007fffU;
+  static const uint32_t MSP_NEG_INF = 0x0000ffffU;
+  static const uint32_t MSP_POS_ZERO = 0x00000000U;
+  static const uint32_t MSP_NEG_ZERO = 0x00008000U;
+  static const uint64_t LSP_INF = static_cast<uint64_t>(0x8000000000000000ULL);
+  static const uint64_t LSP_ZERO = 0;
+  static const uint32_t MSP_MAX = 0x00007ffeU;
+  static const uint64_t LSP_DMAX = static_cast<uint64_t>(0x7fffffffffffffffULL);
+  static const uint64_t LSP_NMAX = static_cast<uint64_t>(0xffffffffffffffffULL);
+  static const unsigned int BASE = 2;
+  static const unsigned int EXPONENT_BITS = 15;
+  static const unsigned int MANTISSA_BITS = 63;
+  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
+  static const int EXPONENT_BIAS = EXPONENT_MAX;
+  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
+  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format =
+                                     INTEL_DOUBLE_EXTENDED;
+  int inf_sign() const;
+  bool is_nan() const;
+  int zero_sign() const;
+  bool sign_bit() const;
+  void negate();
+  void dec();
+  void inc();
+  void set_max(bool negative);
+  void build(bool negative, mpz_t mantissa, int exponent);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct float_ieee754_quad {
+#ifdef PPL_WORDS_BIGENDIAN
+  uint64_t msp;
+  uint64_t lsp;
+#else
+  uint64_t lsp;
+  uint64_t msp;
+#endif
+  static const uint64_t MSP_SGN_MASK = static_cast<uint64_t>(0x8000000000000000ULL);
+  static const uint64_t MSP_POS_INF = static_cast<uint64_t>(0x7fff000000000000ULL);
+  static const uint64_t MSP_NEG_INF = static_cast<uint64_t>(0xffff000000000000ULL);
+  static const uint64_t MSP_POS_ZERO = static_cast<uint64_t>(0x0000000000000000ULL);
+  static const uint64_t MSP_NEG_ZERO = static_cast<uint64_t>(0x8000000000000000ULL);
+  static const uint64_t LSP_INF = 0;
+  static const uint64_t LSP_ZERO = 0;
+  static const uint64_t MSP_MAX = static_cast<uint64_t>(0x7ffeffffffffffffULL);
+  static const uint64_t LSP_MAX = static_cast<uint64_t>(0xffffffffffffffffULL);
+  static const unsigned int BASE = 2;
+  static const unsigned int EXPONENT_BITS = 15;
+  static const unsigned int MANTISSA_BITS = 112;
+  static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
+  static const int EXPONENT_BIAS = EXPONENT_MAX;
+  static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
+  static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format = IEEE754_QUAD;
+  int inf_sign() const;
+  bool is_nan() const;
+  int zero_sign() const;
+  bool sign_bit() const;
+  void negate();
+  void dec();
+  void inc();
+  void set_max(bool negative);
+  void build(bool negative, mpz_t mantissa, int exponent);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Float : public False { };
+
+#if PPL_SUPPORTED_FLOAT
+template <>
+class Float<float> : public True {
+public:
+#if PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_HALF
+  typedef float_ieee754_half Binary;
+#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_SINGLE
+  typedef float_ieee754_single Binary;
+#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_DOUBLE
+  typedef float_ieee754_double Binary;
+#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IBM_SINGLE
+  typedef float_ibm_single Binary;
+#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_IEEE754_QUAD
+  typedef float_ieee754_quad Binary;
+#elif PPL_CXX_FLOAT_BINARY_FORMAT == PPL_FLOAT_INTEL_DOUBLE_EXTENDED
+  typedef float_intel_double_extended Binary;
+#else
+#error "Invalid value for PPL_CXX_FLOAT_BINARY_FORMAT"
+#endif
+  union {
+    float number;
+    Binary binary;
+  } u;
+  Float();
+  Float(float v);
+  float value();
+};
+#endif
+
+#if PPL_SUPPORTED_DOUBLE
+template <>
+class Float<double> : public True {
+public:
+#if PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_HALF
+  typedef float_ieee754_half Binary;
+#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_SINGLE
+  typedef float_ieee754_single Binary;
+#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_DOUBLE
+  typedef float_ieee754_double Binary;
+#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IBM_SINGLE
+  typedef float_ibm_single Binary;
+#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_QUAD
+  typedef float_ieee754_quad Binary;
+#elif PPL_CXX_DOUBLE_BINARY_FORMAT == PPL_FLOAT_INTEL_DOUBLE_EXTENDED
+  typedef float_intel_double_extended Binary;
+#else
+#error "Invalid value for PPL_CXX_DOUBLE_BINARY_FORMAT"
+#endif
+  union {
+    double number;
+    Binary binary;
+  } u;
+  Float();
+  Float(double v);
+  double value();
+};
+#endif
+
+#if PPL_SUPPORTED_LONG_DOUBLE
+template <>
+class Float<long double> : public True {
+public:
+#if PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_HALF
+  typedef float_ieee754_half Binary;
+#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_SINGLE
+  typedef float_ieee754_single Binary;
+#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_DOUBLE
+  typedef float_ieee754_double Binary;
+#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IBM_SINGLE
+  typedef float_ibm_single Binary;
+#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_IEEE754_QUAD
+  typedef float_ieee754_quad Binary;
+#elif PPL_CXX_LONG_DOUBLE_BINARY_FORMAT == PPL_FLOAT_INTEL_DOUBLE_EXTENDED
+  typedef float_intel_double_extended Binary;
+#else
+#error "Invalid value for PPL_CXX_LONG_DOUBLE_BINARY_FORMAT"
+#endif
+  union {
+    long double number;
+    Binary binary;
+  } u;
+  Float();
+  Float(long double v);
+  long double value();
+};
+#endif
+
+// FIXME: is this the right place for this function?
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  If \p v is nonzero, returns the position of the most significant bit
+  in \p a.
+
+  The behavior is undefined if \p v is zero.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+unsigned int msb_position(unsigned long long v);
+
+/*! \brief
+  An abstract class to be implemented by an external analyzer such
+  as ECLAIR in order to provide to the PPL the necessary information
+  for performing the analysis of floating point computations.
+
+  \par Template type parameters
+
+  - The class template parameter \p Target specifies the implementation
+  of Concrete_Expression to be used.
+  - The class template parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain. The interval bounds
+  should have a floating point type.
+*/
+template <typename Target, typename FP_Interval_Type>
+class FP_Oracle {
+public:
+  /*
+    FIXME: the const qualifiers on expressions may raise CLANG
+    compatibility issues. It may be necessary to omit them.
+  */
+
+  /*! \brief
+    Asks the external analyzer for an interval that correctly
+    approximates the floating point entity referenced by \p dim.
+    Result is stored into \p result.
+
+    \return <CODE>true</CODE> if the analyzer was able to find a correct
+    approximation, <CODE>false</CODE> otherwise.
+  */
+  virtual bool get_interval(dimension_type dim, FP_Interval_Type& result) const
+    = 0;
+
+  /*! \brief
+    Asks the external analyzer for an interval that correctly
+    approximates the value of floating point constant \p expr.
+    Result is stored into \p result.
+
+    \return <CODE>true</CODE> if the analyzer was able to find a correct
+    approximation, <CODE>false</CODE> otherwise.
+  */
+  virtual bool get_fp_constant_value(
+               const Floating_Point_Constant<Target>& expr,
+                     FP_Interval_Type& result) const = 0;
+
+  /*! \brief
+    Asks the external analyzer for an interval that correctly approximates
+    the value of \p expr, which must be of integer type.
+    Result is stored into \p result.
+
+    \return <CODE>true</CODE> if the analyzer was able to find a correct
+    approximation, <CODE>false</CODE> otherwise.
+  */
+  virtual bool get_integer_expr_value(const Concrete_Expression<Target>& expr,
+                                      FP_Interval_Type& result) const = 0;
+
+  /*! \brief
+    Asks the external analyzer for the possible space dimensions that
+    are associated to the approximable reference \p expr.
+    Result is stored into \p result.
+
+    \return <CODE>true</CODE> if the analyzer was able to return
+    the (possibly empty!) set, <CODE>false</CODE> otherwise.
+
+    The resulting set MUST NOT contain <CODE>not_a_dimension()</CODE>.
+  */
+  virtual bool get_associated_dimensions(
+          const Approximable_Reference<Target>& expr,
+          std::set<dimension_type>& result) const = 0;
+
+};
+
+/* FIXME: some of the following  documentation should probably be
+   under PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS */
+
+/*! \brief \relates Float
+  Returns <CODE>true</CODE> if and only if there is some floating point
+  number that is representable by \p f2 but not by \p f1.
+*/
+bool is_less_precise_than(Floating_Point_Format f1, Floating_Point_Format f2);
+
+/*! \brief \relates Float
+  Computes the absolute error of floating point computations.
+
+  \par Template type parameters
+
+  - The class template parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain. The interval bounds
+  should have a floating point type.
+
+  \param analyzed_format The floating point format used by the analyzed
+  program.
+
+  \return The interval \f$[-\omega, \omega]\f$ where \f$\omega\f$ is the
+  smallest non-zero positive number in the less precise floating point
+  format between the analyzer format and the analyzed format.
+*/
+template <typename FP_Interval_Type>
+const FP_Interval_Type&
+compute_absolute_error(Floating_Point_Format analyzed_format);
+
+/*! \brief \relates Linear_Form
+  Discards all linear forms containing variable \p var from the
+  linear form abstract store \p lf_store.
+*/
+template <typename FP_Interval_Type>
+void
+discard_occurrences(std::map<dimension_type,
+                             Linear_Form<FP_Interval_Type> >& lf_store,
+                    Variable var);
+
+/*! \brief \relates Linear_Form
+  Assigns the linear form \p lf to \p var in the linear form abstract
+  store \p lf_store, then discards all occurrences of \p var from it.
+*/
+template <typename FP_Interval_Type>
+void
+affine_form_image(std::map<dimension_type,
+                           Linear_Form<FP_Interval_Type> >& lf_store,
+                  Variable var,
+                  const Linear_Form<FP_Interval_Type>& lf);
+
+/*! \brief \relates Linear_Form
+  Discards from \p ls1 all linear forms but those that are associated
+  to the same variable in \p ls2.
+*/
+template <typename FP_Interval_Type>
+void
+upper_bound_assign(std::map<dimension_type,
+                            Linear_Form<FP_Interval_Type> >& ls1,
+                   const std::map<dimension_type,
+                                  Linear_Form<FP_Interval_Type> >& ls2);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Float_inlines.hh"
+#include "Float_templates.hh"
+
+#endif // !defined(PPL_Float_defs_hh)
diff --git a/src/Float_inlines.hh b/src/Float_inlines.hh
new file mode 100644
index 0000000..3db069a
--- /dev/null
+++ b/src/Float_inlines.hh
@@ -0,0 +1,536 @@
+/* IEC 559 floating point format related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Float_inlines_hh
+#define PPL_Float_inlines_hh 1
+
+#include <climits>
+#include "Variable_defs.hh"
+#include "Linear_Form_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline int
+float_ieee754_half::inf_sign() const {
+  if (word == NEG_INF)
+    return -1;
+  if (word == POS_INF)
+    return 1;
+  return 0;
+}
+
+inline bool
+float_ieee754_half::is_nan() const {
+  return (word & ~SGN_MASK) > POS_INF;
+}
+
+inline int
+float_ieee754_half::zero_sign() const {
+  if (word == NEG_ZERO)
+    return -1;
+  if (word == POS_ZERO)
+    return 1;
+  return 0;
+}
+
+inline void
+float_ieee754_half::negate() {
+  word ^= SGN_MASK;
+}
+
+inline bool
+float_ieee754_half::sign_bit() const {
+  return (word & SGN_MASK) != 0;
+}
+
+inline void
+float_ieee754_half::dec() {
+  --word;
+}
+
+inline void
+float_ieee754_half::inc() {
+  ++word;
+}
+
+inline void
+float_ieee754_half::set_max(bool negative) {
+  word = WRD_MAX;
+  if (negative)
+    word |= SGN_MASK;
+}
+
+inline void
+float_ieee754_half::build(bool negative, mpz_t mantissa, int exponent) {
+  word = static_cast<uint16_t>(mpz_get_ui(mantissa)
+                               & ((1UL << MANTISSA_BITS) - 1));
+  if (negative)
+    word |= SGN_MASK;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
+  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
+  word |= static_cast<uint16_t>(exponent_repr) << MANTISSA_BITS;
+}
+
+inline int
+float_ieee754_single::inf_sign() const {
+  if (word == NEG_INF)
+    return -1;
+  if (word == POS_INF)
+    return 1;
+  return 0;
+}
+
+inline bool
+float_ieee754_single::is_nan() const {
+  return (word & ~SGN_MASK) > POS_INF;
+}
+
+inline int
+float_ieee754_single::zero_sign() const {
+  if (word == NEG_ZERO)
+    return -1;
+  if (word == POS_ZERO)
+    return 1;
+  return 0;
+}
+
+inline void
+float_ieee754_single::negate() {
+  word ^= SGN_MASK;
+}
+
+inline bool
+float_ieee754_single::sign_bit() const {
+  return (word & SGN_MASK) != 0;
+}
+
+inline void
+float_ieee754_single::dec() {
+  --word;
+}
+
+inline void
+float_ieee754_single::inc() {
+  ++word;
+}
+
+inline void
+float_ieee754_single::set_max(bool negative) {
+  word = WRD_MAX;
+  if (negative)
+    word |= SGN_MASK;
+}
+
+inline void
+float_ieee754_single::build(bool negative, mpz_t mantissa, int exponent) {
+  word = static_cast<uint32_t>(mpz_get_ui(mantissa)
+                               & ((1UL << MANTISSA_BITS) - 1));
+  if (negative)
+    word |= SGN_MASK;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
+  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
+  word |= static_cast<uint32_t>(exponent_repr) << MANTISSA_BITS;
+}
+
+inline int
+float_ieee754_double::inf_sign() const {
+  if (lsp != LSP_INF)
+    return 0;
+  if (msp == MSP_NEG_INF)
+    return -1;
+  if (msp == MSP_POS_INF)
+    return 1;
+  return 0;
+}
+
+inline bool
+float_ieee754_double::is_nan() const {
+  const uint32_t a = msp & ~MSP_SGN_MASK;
+  return a > MSP_POS_INF || (a == MSP_POS_INF && lsp != LSP_INF);
+}
+
+inline int
+float_ieee754_double::zero_sign() const {
+  if (lsp != LSP_ZERO)
+    return 0;
+  if (msp == MSP_NEG_ZERO)
+    return -1;
+  if (msp == MSP_POS_ZERO)
+    return 1;
+  return 0;
+}
+
+inline void
+float_ieee754_double::negate() {
+  msp ^= MSP_SGN_MASK;
+}
+
+inline bool
+float_ieee754_double::sign_bit() const {
+  return (msp & MSP_SGN_MASK) != 0;
+}
+
+inline void
+float_ieee754_double::dec() {
+  if (lsp == 0) {
+    --msp;
+    lsp = LSP_MAX;
+  }
+  else
+    --lsp;
+}
+
+inline void
+float_ieee754_double::inc() {
+  if (lsp == LSP_MAX) {
+    ++msp;
+    lsp = 0;
+  }
+  else
+    ++lsp;
+}
+
+inline void
+float_ieee754_double::set_max(bool negative) {
+  msp = MSP_MAX;
+  lsp = LSP_MAX;
+  if (negative)
+    msp |= MSP_SGN_MASK;
+}
+
+inline void
+float_ieee754_double::build(bool negative, mpz_t mantissa, int exponent) {
+  unsigned long m;
+#if ULONG_MAX == 0xffffffffUL
+  lsp = mpz_get_ui(mantissa);
+  mpz_tdiv_q_2exp(mantissa, mantissa, 32);
+  m = mpz_get_ui(mantissa);
+#else
+  m = mpz_get_ui(mantissa);
+  lsp = static_cast<uint32_t>(m & LSP_MAX);
+  m >>= 32;
+#endif
+  msp = static_cast<uint32_t>(m & ((1UL << (MANTISSA_BITS - 32)) - 1));
+  if (negative)
+    msp |= MSP_SGN_MASK;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
+  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
+  msp |= static_cast<uint32_t>(exponent_repr) << (MANTISSA_BITS - 32);
+}
+
+inline int
+float_ibm_single::inf_sign() const {
+  if (word == NEG_INF)
+    return -1;
+  if (word == POS_INF)
+    return 1;
+  return 0;
+}
+
+inline bool
+float_ibm_single::is_nan() const {
+  return (word & ~SGN_MASK) > POS_INF;
+}
+
+inline int
+float_ibm_single::zero_sign() const {
+  if (word == NEG_ZERO)
+    return -1;
+  if (word == POS_ZERO)
+    return 1;
+  return 0;
+}
+
+inline void
+float_ibm_single::negate() {
+  word ^= SGN_MASK;
+}
+
+inline bool
+float_ibm_single::sign_bit() const {
+  return (word & SGN_MASK) != 0;
+}
+
+inline void
+float_ibm_single::dec() {
+  --word;
+}
+
+inline void
+float_ibm_single::inc() {
+  ++word;
+}
+
+inline void
+float_ibm_single::set_max(bool negative) {
+  word = WRD_MAX;
+  if (negative)
+    word |= SGN_MASK;
+}
+
+inline void
+float_ibm_single::build(bool negative, mpz_t mantissa, int exponent) {
+  word = static_cast<uint32_t>(mpz_get_ui(mantissa)
+                               & ((1UL << MANTISSA_BITS) - 1));
+  if (negative)
+    word |= SGN_MASK;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
+  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
+  word |= static_cast<uint32_t>(exponent_repr) << MANTISSA_BITS;
+}
+
+inline int
+float_intel_double_extended::inf_sign() const {
+  if (lsp != LSP_INF)
+    return 0;
+  const uint32_t a = msp & MSP_NEG_INF;
+  if (a == MSP_NEG_INF)
+    return -1;
+  if (a == MSP_POS_INF)
+    return 1;
+  return 0;
+}
+
+inline bool
+float_intel_double_extended::is_nan() const {
+  return (msp & MSP_POS_INF) == MSP_POS_INF
+    && lsp != LSP_INF;
+}
+
+inline int
+float_intel_double_extended::zero_sign() const {
+  if (lsp != LSP_ZERO)
+    return 0;
+  const uint32_t a = msp & MSP_NEG_INF;
+  if (a == MSP_NEG_ZERO)
+    return -1;
+  if (a == MSP_POS_ZERO)
+    return 1;
+  return 0;
+}
+
+inline void
+float_intel_double_extended::negate() {
+  msp ^= MSP_SGN_MASK;
+}
+
+inline bool
+float_intel_double_extended::sign_bit() const {
+  return (msp & MSP_SGN_MASK) != 0;
+}
+
+inline void
+float_intel_double_extended::dec() {
+  if ((lsp & LSP_DMAX) == 0) {
+    --msp;
+    lsp = ((msp & MSP_NEG_INF) == 0) ? LSP_DMAX : LSP_NMAX;
+  }
+  else
+    --lsp;
+}
+
+inline void
+float_intel_double_extended::inc() {
+  if ((lsp & LSP_DMAX) == LSP_DMAX) {
+    ++msp;
+    lsp = LSP_DMAX + 1;
+  }
+  else
+    ++lsp;
+}
+
+inline void
+float_intel_double_extended::set_max(bool negative) {
+  msp = MSP_MAX;
+  lsp = LSP_NMAX;
+  if (negative)
+    msp |= MSP_SGN_MASK;
+}
+
+inline void
+float_intel_double_extended::build(bool negative,
+                                   mpz_t mantissa, int exponent) {
+#if ULONG_MAX == 0xffffffffUL
+  mpz_export(&lsp, 0, -1, sizeof(lsp), 0, 0, mantissa);
+#else
+  lsp = mpz_get_ui(mantissa);
+#endif
+  msp = (negative ? MSP_SGN_MASK : 0);
+  const int exponent_repr = exponent + EXPONENT_BIAS;
+  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
+  msp |= static_cast<uint32_t>(exponent_repr);
+}
+
+inline int
+float_ieee754_quad::inf_sign() const {
+  if (lsp != LSP_INF)
+    return 0;
+  if (msp == MSP_NEG_INF)
+    return -1;
+  if (msp == MSP_POS_INF)
+    return 1;
+  return 0;
+}
+
+inline bool
+float_ieee754_quad::is_nan() const {
+  return (msp & ~MSP_SGN_MASK) == MSP_POS_INF
+    && lsp != LSP_INF;
+}
+
+inline int
+float_ieee754_quad::zero_sign() const {
+  if (lsp != LSP_ZERO)
+    return 0;
+  if (msp == MSP_NEG_ZERO)
+    return -1;
+  if (msp == MSP_POS_ZERO)
+    return 1;
+  return 0;
+}
+
+inline void
+float_ieee754_quad::negate() {
+  msp ^= MSP_SGN_MASK;
+}
+
+inline bool
+float_ieee754_quad::sign_bit() const {
+  return (msp & MSP_SGN_MASK) != 0;
+}
+
+inline void
+float_ieee754_quad::dec() {
+  if (lsp == 0) {
+    --msp;
+    lsp = LSP_MAX;
+  }
+  else
+    --lsp;
+}
+
+inline void
+float_ieee754_quad::inc() {
+  if (lsp == LSP_MAX) {
+    ++msp;
+    lsp = 0;
+  }
+  else
+    ++lsp;
+}
+
+inline void
+float_ieee754_quad::set_max(bool negative) {
+  msp = MSP_MAX;
+  lsp = LSP_MAX;
+  if (negative)
+    msp |= MSP_SGN_MASK;
+}
+
+inline void
+float_ieee754_quad::build(bool negative, mpz_t mantissa, int exponent) {
+  uint64_t parts[2];
+  mpz_export(parts, 0, -1, sizeof(parts[0]), 0, 0, mantissa);
+  lsp = parts[0];
+  msp = parts[1];
+  msp &= ((static_cast<uint64_t>(1) << (MANTISSA_BITS - 64)) - 1);
+  if (negative)
+    msp |= MSP_SGN_MASK;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
+  PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
+  msp |= static_cast<uint64_t>(exponent_repr) << (MANTISSA_BITS - 64);
+}
+
+inline bool
+is_less_precise_than(Floating_Point_Format f1, Floating_Point_Format f2) {
+  return f1 < f2;
+}
+
+inline unsigned int
+msb_position(unsigned long long v) {
+  return static_cast<unsigned int>(sizeof_to_bits(sizeof(v))) - 1U - clz(v);
+}
+
+template <typename FP_Interval_Type>
+inline void
+affine_form_image(std::map<dimension_type,
+                           Linear_Form<FP_Interval_Type> >& lf_store,
+                  const Variable var,
+                  const Linear_Form<FP_Interval_Type>& lf) {
+  // Assign the new linear form for var.
+  lf_store[var.id()] = lf;
+  // Now invalidate all linear forms in which var occurs.
+  discard_occurrences(lf_store, var);
+}
+
+#if PPL_SUPPORTED_FLOAT
+inline
+Float<float>::Float() {
+}
+
+inline
+Float<float>::Float(float v) {
+  u.number = v;
+}
+
+inline float
+Float<float>::value() {
+  return u.number;
+}
+#endif
+
+#if PPL_SUPPORTED_DOUBLE
+inline
+Float<double>::Float() {
+}
+
+inline
+Float<double>::Float(double v) {
+  u.number = v;
+}
+
+inline double
+Float<double>::value() {
+  return u.number;
+}
+#endif
+
+#if PPL_SUPPORTED_LONG_DOUBLE
+inline
+Float<long double>::Float() {
+}
+
+inline
+Float<long double>::Float(long double v) {
+  u.number = v;
+}
+
+inline long double
+Float<long double>::value() {
+  return u.number;
+}
+#endif
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Float_inlines_hh)
diff --git a/src/Float_templates.hh b/src/Float_templates.hh
new file mode 100644
index 0000000..19663bf
--- /dev/null
+++ b/src/Float_templates.hh
@@ -0,0 +1,167 @@
+/* IEC 559 floating point format related functions:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Float_templates_hh
+#define PPL_Float_templates_hh 1
+
+#include "Variable_defs.hh"
+#include "Linear_Form_defs.hh"
+#include <cmath>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type>
+const FP_Interval_Type& compute_absolute_error(
+                        const Floating_Point_Format analyzed_format) {
+  typedef typename FP_Interval_Type::boundary_type analyzer_format;
+
+  // FIXME: check if initializing caches with EMPTY is better.
+  static const FP_Interval_Type ZERO_INTERVAL = FP_Interval_Type(0);
+  // Cached results for each different analyzed format.
+  static FP_Interval_Type ieee754_half_result = ZERO_INTERVAL;
+  static FP_Interval_Type ieee754_single_result = ZERO_INTERVAL;
+  static FP_Interval_Type ieee754_double_result = ZERO_INTERVAL;
+  static FP_Interval_Type ibm_single_result = ZERO_INTERVAL;
+  static FP_Interval_Type ieee754_quad_result = ZERO_INTERVAL;
+  static FP_Interval_Type intel_double_extended_result = ZERO_INTERVAL;
+
+  FP_Interval_Type* to_compute = NULL;
+  // Get the necessary information on the analyzed's format.
+  unsigned int f_base;
+  int f_exponent_bias;
+  unsigned int f_mantissa_bits;
+  switch (analyzed_format) {
+    case IEEE754_HALF:
+      if (ieee754_half_result != ZERO_INTERVAL)
+        return ieee754_half_result;
+
+      to_compute = &ieee754_half_result;
+      f_base = float_ieee754_half::BASE;
+      f_exponent_bias = float_ieee754_half::EXPONENT_BIAS;
+      f_mantissa_bits = float_ieee754_half::MANTISSA_BITS;
+      break;
+    case IEEE754_SINGLE:
+      if (ieee754_single_result != ZERO_INTERVAL)
+        return ieee754_single_result;
+
+      to_compute = &ieee754_single_result;
+      f_base = float_ieee754_single::BASE;
+      f_exponent_bias = float_ieee754_single::EXPONENT_BIAS;
+      f_mantissa_bits = float_ieee754_single::MANTISSA_BITS;
+      break;
+    case IEEE754_DOUBLE:
+      if (ieee754_double_result != ZERO_INTERVAL)
+        return ieee754_double_result;
+
+      to_compute = &ieee754_double_result;
+      f_base = float_ieee754_double::BASE;
+      f_exponent_bias = float_ieee754_double::EXPONENT_BIAS;
+      f_mantissa_bits = float_ieee754_double::MANTISSA_BITS;
+      break;
+    case IBM_SINGLE:
+      if (ibm_single_result != ZERO_INTERVAL)
+        return ibm_single_result;
+
+      to_compute = &ibm_single_result;
+      f_base = float_ibm_single::BASE;
+      f_exponent_bias = float_ibm_single::EXPONENT_BIAS;
+      f_mantissa_bits = float_ibm_single::MANTISSA_BITS;
+      break;
+    case IEEE754_QUAD:
+      if (ieee754_quad_result != ZERO_INTERVAL)
+        return ieee754_quad_result;
+
+      to_compute = &ieee754_quad_result;
+      f_base = float_ieee754_quad::BASE;
+      f_exponent_bias = float_ieee754_quad::EXPONENT_BIAS;
+      f_mantissa_bits = float_ieee754_quad::MANTISSA_BITS;
+      break;
+    case INTEL_DOUBLE_EXTENDED:
+      if (intel_double_extended_result != ZERO_INTERVAL)
+        return intel_double_extended_result;
+
+      to_compute = &intel_double_extended_result;
+      f_base = float_intel_double_extended::BASE;
+      f_exponent_bias = float_intel_double_extended::EXPONENT_BIAS;
+      f_mantissa_bits = float_intel_double_extended::MANTISSA_BITS;
+      break;
+    default:
+      PPL_UNREACHABLE;
+      break;
+  }
+
+  PPL_ASSERT(to_compute != NULL);
+
+  // We assume that f_base is a power of 2.
+  analyzer_format omega;
+  int power = static_cast<int>(msb_position(f_base))
+    * ((1 - f_exponent_bias) - static_cast<int>(f_mantissa_bits));
+  omega = std::max(static_cast<analyzer_format>(ldexp(1.0, power)),
+                   std::numeric_limits<analyzer_format>::denorm_min());
+
+  to_compute->build(i_constraint(GREATER_OR_EQUAL, -omega),
+                    i_constraint(LESS_OR_EQUAL, omega));
+  return *to_compute;
+}
+
+template <typename FP_Interval_Type>
+void
+discard_occurrences(std::map<dimension_type,
+                             Linear_Form<FP_Interval_Type> >& lf_store,
+                    Variable var) {
+  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
+  typedef typename std::map<dimension_type, FP_Linear_Form>::iterator Iter;
+  for (Iter i = lf_store.begin(); i != lf_store.end(); ) {
+    if((i->second).coefficient(var) != 0)
+      i = lf_store.erase(i);
+    else
+      ++i;
+  }
+}
+
+/* FIXME: improve efficiency by adding the list of potentially conflicting
+   variables as an argument. */
+template <typename FP_Interval_Type>
+void upper_bound_assign(std::map<dimension_type,
+                                 Linear_Form<FP_Interval_Type> >& ls1,
+                        const std::map<dimension_type,
+                                       Linear_Form<FP_Interval_Type> >& ls2) {
+  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
+  typedef typename std::map<dimension_type, FP_Linear_Form>::iterator Iter;
+  typedef typename std::map<dimension_type,
+                            FP_Linear_Form>::const_iterator Const_Iter;
+
+  Const_Iter i2_end = ls2.end();
+  for (Iter i1 = ls1.begin(), i1_end = ls1.end(); i1 != i1_end; ) {
+    Const_Iter i2 = ls2.find(i1->first);
+    if ((i2 == i2_end) || (i1->second != i2->second))
+      i1 = ls1.erase(i1);
+    else
+      ++i1;
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Float_templates_hh)
diff --git a/src/Floating_Point_Expression.defs.hh b/src/Floating_Point_Expression.defs.hh
deleted file mode 100644
index 1ed58c5..0000000
--- a/src/Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,213 +0,0 @@
-/* Declarations for the Floating_Point_Expression class and its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Floating_Point_Expression_defs_hh
-#define PPL_Floating_Point_Expression_defs_hh 1
-
-#include "globals.defs.hh"
-#include "Floating_Point_Expression.types.hh"
-#include "Linear_Form.types.hh"
-#include "Box.types.hh"
-#include <cmath>
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-/*! \brief
-  \ingroup PPL_CXX_Interface
-  A floating point expression on a given format.
-
-  This class represents a concrete <EM>floating point expression</EM>. This
-  includes constants, floating point variables, binary and unary
-  arithmetic operators.
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain. The interval bounds
-  should have a floating point type.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-  This parameter must be a struct similar to the ones defined in file
-  Float.defs.hh, even though it is sufficient to define the three
-  fields BASE, MANTISSA_BITS and EXPONENT_BIAS.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Floating_Point_Expression {
-
-public:
-
-  //! Alias for a linear form with template argument \p FP_Interval_Type.
-  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
-
-  //! Alias for a map that associates a variable index to an interval.
-  /*! \brief
-    Alias for a Box storing lower and upper bounds for floating point
-    variables.
-
-    The type a linear form abstract store associating each variable with an
-    interval that correctly approximates its value.
-  */
-  typedef Box<FP_Interval_Type> FP_Interval_Abstract_Store;
-
-  //! Alias for a map that associates a variable index to a linear form.
-  /*!
-    The type a linear form abstract store associating each variable with a
-    linear form that correctly approximates its value.
-  */
-  typedef std::map<dimension_type, FP_Linear_Form>
-          FP_Linear_Form_Abstract_Store;
-
-  //! The floating point format used by the analyzer.
-  typedef typename FP_Interval_Type::boundary_type boundary_type;
-
-  //! The interval policy used by \p FP_Interval_Type.
-  typedef typename FP_Interval_Type::info_type info_type;
-
-  //! Destructor.
-  virtual ~Floating_Point_Expression();
-
-  //! Linearizes a floating point expression.
-  /*! \brief
-    Makes \p result become a linear form that correctly approximates the
-    value of the floating point expression in the given composite
-    abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result Becomes the linearized expression.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Formally, if \p *this represents the expression \f$e\f$,
-    \p int_store represents the interval abstract store \f$\rho^{\#}\f$ and
-    \p lf_store represents the linear form abstract store \f$\rho^{\#}_l\f$,
-    then \p result will become
-    \f$\linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}\f$
-    if the linearization succeeds.
-
-    All variables occurring in the floating point expression MUST have
-    an associated interval in \p int_store.
-    If this precondition is not met, calling the method causes an
-    undefined behavior.
-  */
-  virtual bool linearize(const FP_Interval_Abstract_Store& int_store,
-                         const FP_Linear_Form_Abstract_Store& lf_store,
-                         FP_Linear_Form& result) const = 0;
-
-  /*! \brief
-    Absolute error.
-
-    Represents the interval \f$[-\omega, \omega]\f$ where \f$\omega\f$ is the
-    smallest non-zero positive number in the less precise floating point
-    format between the analyzer format and the analyzed format.
-
-  */
-  static FP_Interval_Type absolute_error;
-
-  // FIXME: this may not be the best place for them.
-  /*! \brief
-    Verifies if a given linear form overflows.
-    \param lf The linear form to verify.
-    \return
-    Returns <CODE>false</CODE> if all coefficients in \p lf are bounded,
-    <CODE>true</CODE> otherwise.
-  */
-  static bool overflows(const FP_Linear_Form& lf);
-
-  /*! \brief
-    Computes the relative error of a given linear form.
-
-    Static helper method that is used by <CODE>linearize</CODE>
-    to account for the relative errors on \p lf.
-    \param lf The linear form used to compute the relative error.
-    \param result Becomes the linear form corresponding to a relative
-    error committed on \p lf.
-
-    This method makes <CODE>result</CODE> become a linear form
-    obtained by evaluating the function \f$\varepsilon_{\mathbf{f}}(l)\f$
-    on the linear form \p lf. This function is defined
-    such as:
-    \f[
-    \varepsilon_{\mathbf{f}}\left([a, b]+\sum_{v \in \cV}[a_{v}, b_{v}]v\right)
-    \defeq
-    (\textrm{max}(|a|, |b|) \amifp [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])
-    +
-    \sum_{v \in \cV}(\textrm{max}(|a_{v}|,|b_{v}|)
-    \amifp
-    [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])v
-    \f]
-    where p is the fraction size in bits for the format \f$\mathbf{f}\f$ and
-    \f$\beta\f$ the base.
-  */
-  static void relative_error(const FP_Linear_Form& lf,
-                             FP_Linear_Form& result);
-
-  /*! \brief
-    Makes \p result become an interval that overapproximates all the
-    possible values of \p lf in the interval abstract store \p store.
-
-    \param lf The linear form to aproximate.
-    \param store The abstract store.
-    \param result The linear form that will be modified.
-
-    This method makes <CODE>result</CODE> become
-    \f$\iota(lf)\rho^{\#}\f$, that is an interval defined as:
-    \f[
-    \iota\left(i + \sum_{v \in \cV}i_{v}v\right)\rho^{\#}
-    \defeq
-    i \asifp \left(\bigoplus_{v \in \cV}{}^{\#}i_{v} \amifp
-    \rho^{\#}(v)\right)
-    \f]
-  */
-  static void intervalize(const FP_Linear_Form& lf,
-                          const FP_Interval_Abstract_Store& store,
-                          FP_Interval_Type& result);
-
-private:
-
-  /*! \brief
-    Computes the absolute error.
-
-    Static helper method that is used to compute the value of the public
-    static field <CODE>absolute_error</CODE>.
-
-    \return The interval \f$[-\omega, \omega]\f$ corresponding to the value
-    of <CODE>absolute_error</CODE>
-  */
-  static FP_Interval_Type compute_absolute_error();
-
-}; // class Floating_Point_Expression
-
-
-template <typename FP_Interval_Type, typename FP_Format>
-FP_Interval_Type Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::absolute_error = compute_absolute_error();
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Floating_Point_Expression.inlines.hh"
-#include "Floating_Point_Expression.templates.hh"
-
-#endif // !defined(PPL_Floating_Point_Expression_defs_hh)
diff --git a/src/Floating_Point_Expression.inlines.hh b/src/Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 6a24cf8..0000000
--- a/src/Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,55 +0,0 @@
-/* Floating_Point_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Floating_Point_Expression_inlines_hh
-#define PPL_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-#include "Linear_Form.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::~Floating_Point_Expression() {}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline bool
-Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::overflows(const FP_Linear_Form& lf) {
-  if (!lf.inhomogeneous_term().is_bounded())
-    return true;
-
-  dimension_type dimension = lf.space_dimension();
-  for (dimension_type i = 0; i < dimension; ++i) {
-    if (!lf.coefficient(Variable(i)).is_bounded())
-      return true;
-  }
-
-  return false;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Floating_Point_Expression_inlines_hh)
diff --git a/src/Floating_Point_Expression.templates.hh b/src/Floating_Point_Expression.templates.hh
deleted file mode 100644
index 38f05ab..0000000
--- a/src/Floating_Point_Expression.templates.hh
+++ /dev/null
@@ -1,111 +0,0 @@
-/* Floating_Point_Expression class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Floating_Point_Expression_templates_hh
-#define PPL_Floating_Point_Expression_templates_hh 1
-
-#include "Linear_Form.defs.hh"
-#include <cmath>
-
-namespace Parma_Polyhedra_Library {
-
-template<typename FP_Interval_Type, typename FP_Format>
-void
-Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::relative_error(const FP_Linear_Form& lf, FP_Linear_Form& result) {
-
-  FP_Interval_Type error_propagator;
-  boundary_type lb = -pow(FP_Format::BASE,
-  -static_cast<typename Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::boundary_type>(FP_Format::MANTISSA_BITS));
-  error_propagator.build(i_constraint(GREATER_OR_EQUAL, lb),
-                         i_constraint(LESS_OR_EQUAL, -lb));
-
-  // Handle the inhomogeneous term.
-  const FP_Interval_Type* current_term = &lf.inhomogeneous_term();
-  assert(current_term->is_bounded());
-
-  FP_Interval_Type
-    current_multiplier(std::max(std::abs(current_term->lower()),
-                                std::abs(current_term->upper())));
-  FP_Linear_Form current_result_term(current_multiplier);
-  current_result_term *= error_propagator;
-  result = FP_Linear_Form(current_result_term);
-
-  // Handle the other terms.
-  dimension_type dimension = lf.space_dimension();
-  for (dimension_type i = 0; i < dimension; ++i) {
-    current_term = &lf.coefficient(Variable(i));
-    assert(current_term->is_bounded());
-    current_multiplier
-      = FP_Interval_Type(std::max(std::abs(current_term->lower()),
-                                  std::abs(current_term->upper())));
-    current_result_term = FP_Linear_Form(Variable(i));
-    current_result_term *= current_multiplier;
-    current_result_term *= error_propagator;
-    result += current_result_term;
-  }
-
-  return;
-}
-
-template<typename FP_Interval_Type, typename FP_Format>
-void
-Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::intervalize(const FP_Linear_Form& lf,
-              const FP_Interval_Abstract_Store& store,
-              FP_Interval_Type& result) {
-  result = FP_Interval_Type(lf.inhomogeneous_term());
-  dimension_type dimension = lf.space_dimension();
-  assert(dimension <= store.space_dimension());
-  for (dimension_type i = 0; i < dimension; ++i) {
-    FP_Interval_Type current_addend = lf.coefficient(Variable(i));
-    const FP_Interval_Type& curr_int = store.get_interval(Variable(i));
-    current_addend *= curr_int;
-    result += current_addend;
-  }
-
-  return;
-}
-
-template<typename FP_Interval_Type, typename FP_Format>
-FP_Interval_Type
-Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::compute_absolute_error() {
-  typedef typename Floating_Point_Expression<FP_Interval_Type, FP_Format>
-    ::boundary_type Boundary;
-  boundary_type omega;
-  omega = std::max(pow(static_cast<Boundary>(FP_Format::BASE),
-                       static_cast<Boundary>(1 - FP_Format::EXPONENT_BIAS
-                                             - FP_Format::MANTISSA_BITS)),
-                   std::numeric_limits<Boundary>::denorm_min());
-  FP_Interval_Type result;
-  result.build(i_constraint(GREATER_OR_EQUAL, -omega),
-               i_constraint(LESS_OR_EQUAL, omega));
-  return result;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Floating_Point_Expression_templates_hh)
diff --git a/src/Floating_Point_Expression.types.hh b/src/Floating_Point_Expression.types.hh
deleted file mode 100644
index 3ae6855..0000000
--- a/src/Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Floating_Point_Expression_types_hh
-#define PPL_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Floating_Point_Expression_types_hh)
diff --git a/src/Floating_Point_Expression_defs.hh b/src/Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..57231bf
--- /dev/null
+++ b/src/Floating_Point_Expression_defs.hh
@@ -0,0 +1,212 @@
+/* Declarations for the Floating_Point_Expression class and its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Floating_Point_Expression_defs_hh
+#define PPL_Floating_Point_Expression_defs_hh 1
+
+#include "globals_defs.hh"
+#include "Floating_Point_Expression_types.hh"
+#include "Linear_Form_types.hh"
+#include "Box_types.hh"
+#include <cmath>
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+/*! \ingroup PPL_CXX_Interface \brief
+  A floating point expression on a given format.
+
+  This class represents a concrete <EM>floating point expression</EM>. This
+  includes constants, floating point variables, binary and unary
+  arithmetic operators.
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain. The interval bounds
+  should have a floating point type.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+  This parameter must be a struct similar to the ones defined in file
+  Float_defs.hh, even though it is sufficient to define the three
+  fields BASE, MANTISSA_BITS and EXPONENT_BIAS.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Floating_Point_Expression {
+
+public:
+
+  //! Alias for a linear form with template argument \p FP_Interval_Type.
+  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
+
+  //! Alias for a map that associates a variable index to an interval.
+  /*! \brief
+    Alias for a Box storing lower and upper bounds for floating point
+    variables.
+
+    The type a linear form abstract store associating each variable with an
+    interval that correctly approximates its value.
+  */
+  typedef Box<FP_Interval_Type> FP_Interval_Abstract_Store;
+
+  //! Alias for a map that associates a variable index to a linear form.
+  /*!
+    The type a linear form abstract store associating each variable with a
+    linear form that correctly approximates its value.
+  */
+  typedef std::map<dimension_type, FP_Linear_Form>
+          FP_Linear_Form_Abstract_Store;
+
+  //! The floating point format used by the analyzer.
+  typedef typename FP_Interval_Type::boundary_type boundary_type;
+
+  //! The interval policy used by \p FP_Interval_Type.
+  typedef typename FP_Interval_Type::info_type info_type;
+
+  //! Destructor.
+  virtual ~Floating_Point_Expression();
+
+  //! Linearizes a floating point expression.
+  /*! \brief
+    Makes \p result become a linear form that correctly approximates the
+    value of the floating point expression in the given composite
+    abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result Becomes the linearized expression.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Formally, if \p *this represents the expression \f$e\f$,
+    \p int_store represents the interval abstract store \f$\rho^{\#}\f$ and
+    \p lf_store represents the linear form abstract store \f$\rho^{\#}_l\f$,
+    then \p result will become
+    \f$\linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}\f$
+    if the linearization succeeds.
+
+    All variables occurring in the floating point expression MUST have
+    an associated interval in \p int_store.
+    If this precondition is not met, calling the method causes an
+    undefined behavior.
+  */
+  virtual bool linearize(const FP_Interval_Abstract_Store& int_store,
+                         const FP_Linear_Form_Abstract_Store& lf_store,
+                         FP_Linear_Form& result) const = 0;
+
+  /*! \brief
+    Absolute error.
+
+    Represents the interval \f$[-\omega, \omega]\f$ where \f$\omega\f$ is the
+    smallest non-zero positive number in the less precise floating point
+    format between the analyzer format and the analyzed format.
+
+  */
+  static FP_Interval_Type absolute_error;
+
+  // FIXME: this may not be the best place for them.
+  /*! \brief
+    Verifies if a given linear form overflows.
+    \param lf The linear form to verify.
+    \return
+    Returns <CODE>false</CODE> if all coefficients in \p lf are bounded,
+    <CODE>true</CODE> otherwise.
+  */
+  static bool overflows(const FP_Linear_Form& lf);
+
+  /*! \brief
+    Computes the relative error of a given linear form.
+
+    Static helper method that is used by <CODE>linearize</CODE>
+    to account for the relative errors on \p lf.
+    \param lf The linear form used to compute the relative error.
+    \param result Becomes the linear form corresponding to a relative
+    error committed on \p lf.
+
+    This method makes <CODE>result</CODE> become a linear form
+    obtained by evaluating the function \f$\varepsilon_{\mathbf{f}}(l)\f$
+    on the linear form \p lf. This function is defined
+    such as:
+    \f[
+    \varepsilon_{\mathbf{f}}\left([a, b]+\sum_{v \in \cV}[a_{v}, b_{v}]v\right)
+    \defeq
+    (\textrm{max}(|a|, |b|) \amifp [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])
+    +
+    \sum_{v \in \cV}(\textrm{max}(|a_{v}|,|b_{v}|)
+    \amifp
+    [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])v
+    \f]
+    where p is the fraction size in bits for the format \f$\mathbf{f}\f$ and
+    \f$\beta\f$ the base.
+  */
+  static void relative_error(const FP_Linear_Form& lf,
+                             FP_Linear_Form& result);
+
+  /*! \brief
+    Makes \p result become an interval that overapproximates all the
+    possible values of \p lf in the interval abstract store \p store.
+
+    \param lf The linear form to aproximate.
+    \param store The abstract store.
+    \param result The linear form that will be modified.
+
+    This method makes <CODE>result</CODE> become
+    \f$\iota(lf)\rho^{\#}\f$, that is an interval defined as:
+    \f[
+    \iota\left(i + \sum_{v \in \cV}i_{v}v\right)\rho^{\#}
+    \defeq
+    i \asifp \left(\bigoplus_{v \in \cV}{}^{\#}i_{v} \amifp
+    \rho^{\#}(v)\right)
+    \f]
+  */
+  static void intervalize(const FP_Linear_Form& lf,
+                          const FP_Interval_Abstract_Store& store,
+                          FP_Interval_Type& result);
+
+private:
+
+  /*! \brief
+    Computes the absolute error.
+
+    Static helper method that is used to compute the value of the public
+    static field <CODE>absolute_error</CODE>.
+
+    \return The interval \f$[-\omega, \omega]\f$ corresponding to the value
+    of <CODE>absolute_error</CODE>
+  */
+  static FP_Interval_Type compute_absolute_error();
+
+}; // class Floating_Point_Expression
+
+
+template <typename FP_Interval_Type, typename FP_Format>
+FP_Interval_Type Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::absolute_error = compute_absolute_error();
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Floating_Point_Expression_inlines.hh"
+#include "Floating_Point_Expression_templates.hh"
+
+#endif // !defined(PPL_Floating_Point_Expression_defs_hh)
diff --git a/src/Floating_Point_Expression_inlines.hh b/src/Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..644f839
--- /dev/null
+++ b/src/Floating_Point_Expression_inlines.hh
@@ -0,0 +1,55 @@
+/* Floating_Point_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Floating_Point_Expression_inlines_hh
+#define PPL_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+#include "Linear_Form_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::~Floating_Point_Expression() {}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline bool
+Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::overflows(const FP_Linear_Form& lf) {
+  if (!lf.inhomogeneous_term().is_bounded())
+    return true;
+
+  dimension_type dimension = lf.space_dimension();
+  for (dimension_type i = 0; i < dimension; ++i) {
+    if (!lf.coefficient(Variable(i)).is_bounded())
+      return true;
+  }
+
+  return false;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Floating_Point_Expression_inlines_hh)
diff --git a/src/Floating_Point_Expression_templates.hh b/src/Floating_Point_Expression_templates.hh
new file mode 100644
index 0000000..b10e685
--- /dev/null
+++ b/src/Floating_Point_Expression_templates.hh
@@ -0,0 +1,111 @@
+/* Floating_Point_Expression class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Floating_Point_Expression_templates_hh
+#define PPL_Floating_Point_Expression_templates_hh 1
+
+#include "Linear_Form_defs.hh"
+#include <cmath>
+
+namespace Parma_Polyhedra_Library {
+
+template<typename FP_Interval_Type, typename FP_Format>
+void
+Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::relative_error(const FP_Linear_Form& lf, FP_Linear_Form& result) {
+
+  FP_Interval_Type error_propagator;
+  boundary_type lb = -pow(FP_Format::BASE,
+  -static_cast<typename Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::boundary_type>(FP_Format::MANTISSA_BITS));
+  error_propagator.build(i_constraint(GREATER_OR_EQUAL, lb),
+                         i_constraint(LESS_OR_EQUAL, -lb));
+
+  // Handle the inhomogeneous term.
+  const FP_Interval_Type* current_term = &lf.inhomogeneous_term();
+  assert(current_term->is_bounded());
+
+  FP_Interval_Type
+    current_multiplier(std::max(std::abs(current_term->lower()),
+                                std::abs(current_term->upper())));
+  FP_Linear_Form current_result_term(current_multiplier);
+  current_result_term *= error_propagator;
+  result = FP_Linear_Form(current_result_term);
+
+  // Handle the other terms.
+  dimension_type dimension = lf.space_dimension();
+  for (dimension_type i = 0; i < dimension; ++i) {
+    current_term = &lf.coefficient(Variable(i));
+    assert(current_term->is_bounded());
+    current_multiplier
+      = FP_Interval_Type(std::max(std::abs(current_term->lower()),
+                                  std::abs(current_term->upper())));
+    current_result_term = FP_Linear_Form(Variable(i));
+    current_result_term *= current_multiplier;
+    current_result_term *= error_propagator;
+    result += current_result_term;
+  }
+
+  return;
+}
+
+template<typename FP_Interval_Type, typename FP_Format>
+void
+Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::intervalize(const FP_Linear_Form& lf,
+              const FP_Interval_Abstract_Store& store,
+              FP_Interval_Type& result) {
+  result = FP_Interval_Type(lf.inhomogeneous_term());
+  dimension_type dimension = lf.space_dimension();
+  assert(dimension <= store.space_dimension());
+  for (dimension_type i = 0; i < dimension; ++i) {
+    FP_Interval_Type current_addend = lf.coefficient(Variable(i));
+    const FP_Interval_Type& curr_int = store.get_interval(Variable(i));
+    current_addend *= curr_int;
+    result += current_addend;
+  }
+
+  return;
+}
+
+template<typename FP_Interval_Type, typename FP_Format>
+FP_Interval_Type
+Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::compute_absolute_error() {
+  typedef typename Floating_Point_Expression<FP_Interval_Type, FP_Format>
+    ::boundary_type Boundary;
+  boundary_type omega;
+  omega = std::max(pow(static_cast<Boundary>(FP_Format::BASE),
+                       static_cast<Boundary>(1 - FP_Format::EXPONENT_BIAS
+                                             - FP_Format::MANTISSA_BITS)),
+                   std::numeric_limits<Boundary>::denorm_min());
+  FP_Interval_Type result;
+  result.build(i_constraint(GREATER_OR_EQUAL, -omega),
+               i_constraint(LESS_OR_EQUAL, omega));
+  return result;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Floating_Point_Expression_templates_hh)
diff --git a/src/Floating_Point_Expression_types.hh b/src/Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..27cca82
--- /dev/null
+++ b/src/Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Floating_Point_Expression_types_hh
+#define PPL_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Floating_Point_Expression_types_hh)
diff --git a/src/GMP_Integer.defs.hh b/src/GMP_Integer.defs.hh
deleted file mode 100644
index a80ea6f..0000000
--- a/src/GMP_Integer.defs.hh
+++ /dev/null
@@ -1,134 +0,0 @@
-/* GMP_Integer class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_GMP_Integer_defs_hh
-#define PPL_GMP_Integer_defs_hh 1
-
-#include "GMP_Integer.types.hh"
-#include "globals.types.hh"
-#include <cstddef>
-
-namespace Parma_Polyhedra_Library {
-
-//! \name Accessor Functions
-//@{
-
-//! Returns a const reference to the underlying integer value.
-/*! \relates GMP_Integer */
-const mpz_class& raw_value(const GMP_Integer& x);
-
-//! Returns a reference to the underlying integer value.
-/*! \relates GMP_Integer */
-mpz_class& raw_value(GMP_Integer& x);
-
-//@} // Accessor Functions
-
-//! \name Arithmetic Operators
-//@{
-
-//! Assigns to \p x its negation.
-/*! \relates GMP_Integer */
-void neg_assign(GMP_Integer& x);
-
-//! Assigns to \p x the negation of \p y.
-/*! \relates GMP_Integer */
-void neg_assign(GMP_Integer& x, const GMP_Integer& y);
-
-//! Assigns to \p x its absolute value.
-/*! \relates GMP_Integer */
-void abs_assign(GMP_Integer& x);
-
-//! Assigns to \p x the absolute value of \p y.
-/*! \relates GMP_Integer */
-void abs_assign(GMP_Integer& x, const GMP_Integer& y);
-
-//! Assigns to \p x the remainder of the division of \p y by \p z.
-/*! \relates GMP_Integer */
-void rem_assign(GMP_Integer& x,
-		const GMP_Integer& y, const GMP_Integer& z);
-
-//! Assigns to \p x the greatest common divisor of \p y and \p z.
-/*! \relates GMP_Integer */
-void gcd_assign(GMP_Integer& x,
-		const GMP_Integer& y, const GMP_Integer& z);
-
-//! Extended GCD.
-/*! \relates GMP_Integer
-  Assigns to \p x the greatest common divisor of \p y and \p z, and to
-  \p s and \p t the values such that \p y * \p s + \p z * \p t = \p x.
-*/
-void gcdext_assign(GMP_Integer& x, GMP_Integer& s, GMP_Integer& t,
-		   const GMP_Integer& y, const GMP_Integer& z);
-
-//! Assigns to \p x the least common multiple of \p y and \p z.
-/*! \relates GMP_Integer */
-void lcm_assign(GMP_Integer& x,
-		const GMP_Integer& y, const GMP_Integer& z);
-
-//! Assigns to \p x the value <CODE>x + y * z</CODE>.
-/*! \relates GMP_Integer */
-void add_mul_assign(GMP_Integer& x,
-		    const GMP_Integer& y, const GMP_Integer& z);
-
-//! Assigns to \p x the value <CODE>x - y * z</CODE>.
-/*! \relates GMP_Integer */
-void sub_mul_assign(GMP_Integer& x,
-		    const GMP_Integer& y, const GMP_Integer& z);
-
-//! Assigns to \p x the value \f$ y \cdot 2^\mathtt{exp} \f$.
-/*! \relates GMP_Integer */
-void mul_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp);
-
-//! Assigns to \p x the value \f$ y / 2^\mathtt{exp} \f$.
-/*! \relates GMP_Integer */
-void div_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp);
-
-/*! \brief
-  If \p z divides \p y, assigns to \p x the quotient of the integer
-  division of \p y and \p z.
-
-  \relates GMP_Integer
-  The behavior is undefined if \p z does not divide \p y.
-*/
-void exact_div_assign(GMP_Integer& x,
-		      const GMP_Integer& y, const GMP_Integer& z);
-
-//! Assigns to \p x the integer square root of \p y.
-/*! \relates GMP_Integer */
-void sqrt_assign(GMP_Integer& x, const GMP_Integer& y);
-
-/*! \brief
-  Returns a negative, zero or positive value depending on whether
-  \p x is lower than, equal to or greater than \p y, respectively.
-
-  \relates GMP_Integer
-*/
-int cmp(const GMP_Integer& x, const GMP_Integer& y);
-
-//@} // Arithmetic Operators
-
-} // namespace Parma_Polyhedra_Library
-
-#include "GMP_Integer.inlines.hh"
-
-#endif // !defined(PPL_GMP_Integer_defs_hh)
diff --git a/src/GMP_Integer.inlines.hh b/src/GMP_Integer.inlines.hh
deleted file mode 100644
index 64a00ad..0000000
--- a/src/GMP_Integer.inlines.hh
+++ /dev/null
@@ -1,122 +0,0 @@
-/* GMP_Integer class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_GMP_Integer_inlines_hh
-#define PPL_GMP_Integer_inlines_hh 1
-
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-neg_assign(GMP_Integer& x) {
-  mpz_neg(x.get_mpz_t(), x.get_mpz_t());
-}
-
-inline void
-neg_assign(GMP_Integer& x, const GMP_Integer& y) {
-  mpz_neg(x.get_mpz_t(), y.get_mpz_t());
-}
-
-inline void
-abs_assign(GMP_Integer& x) {
-  mpz_abs(x.get_mpz_t(), x.get_mpz_t());
-}
-
-inline void
-abs_assign(GMP_Integer& x, const GMP_Integer& y) {
-  mpz_abs(x.get_mpz_t(), y.get_mpz_t());
-}
-
-inline void
-gcd_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
-  mpz_gcd(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-rem_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
-  mpz_tdiv_r(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-gcdext_assign(GMP_Integer& x, GMP_Integer& s, GMP_Integer& t,
-	      const GMP_Integer& y, const GMP_Integer& z) {
-  mpz_gcdext(x.get_mpz_t(),
-	     s.get_mpz_t(), t.get_mpz_t(),
-	     y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-lcm_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
-  mpz_lcm(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-add_mul_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
-  mpz_addmul(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-sub_mul_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
-  mpz_submul(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-mul_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp) {
-  mpz_mul_2exp(x.get_mpz_t(), y.get_mpz_t(), exp);
-}
-
-inline void
-div_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp) {
-  mpz_tdiv_q_2exp(x.get_mpz_t(), y.get_mpz_t(), exp);
-}
-
-inline void
-exact_div_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
-  PPL_ASSERT(y % z == 0);
-  mpz_divexact(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
-}
-
-inline void
-sqrt_assign(GMP_Integer& x, const GMP_Integer& y) {
-  mpz_sqrt(x.get_mpz_t(), y.get_mpz_t());
-}
-
-inline int
-cmp(const GMP_Integer& x, const GMP_Integer& y) {
-  return mpz_cmp(x.get_mpz_t(), y.get_mpz_t());
-}
-
-inline const mpz_class&
-raw_value(const GMP_Integer& x) {
-  return x;
-}
-
-inline mpz_class&
-raw_value(GMP_Integer& x) {
-  return x;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_GMP_Integer_inlines_hh)
diff --git a/src/GMP_Integer.types.hh b/src/GMP_Integer.types.hh
deleted file mode 100644
index 9a3e111..0000000
--- a/src/GMP_Integer.types.hh
+++ /dev/null
@@ -1,45 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_GMP_Integer_types_hh
-#define PPL_GMP_Integer_types_hh 1
-
-#include "Coefficient_traits_template.hh"
-#include <gmpxx.h>
-#include "mp_std_bits.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-/*! \class Parma_Polyhedra_Library::GMP_Integer
-  \brief
-  Unbounded integers as provided by the GMP library.
-
-  \ingroup PPL_CXX_interface
-  GMP_Integer is an alias for the <CODE>mpz_class</CODE> type
-  defined in the C++ interface of the GMP library.
-  For more information, see <CODE>http://gmplib.org/</CODE>
-*/
-typedef mpz_class GMP_Integer;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Coefficient traits specialization for unbounded integers.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <>
-struct Coefficient_traits_template<GMP_Integer> {
-  //! The type used for references to const unbounded integers.
-  typedef const GMP_Integer& const_reference;
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_GMP_Integer_types_hh)
diff --git a/src/GMP_Integer_defs.hh b/src/GMP_Integer_defs.hh
new file mode 100644
index 0000000..0030825
--- /dev/null
+++ b/src/GMP_Integer_defs.hh
@@ -0,0 +1,134 @@
+/* GMP_Integer class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_GMP_Integer_defs_hh
+#define PPL_GMP_Integer_defs_hh 1
+
+#include "GMP_Integer_types.hh"
+#include "globals_types.hh"
+#include <cstddef>
+
+namespace Parma_Polyhedra_Library {
+
+//! \name Accessor Functions
+//@{
+
+//! Returns a const reference to the underlying integer value.
+/*! \relates GMP_Integer */
+const mpz_class& raw_value(const GMP_Integer& x);
+
+//! Returns a reference to the underlying integer value.
+/*! \relates GMP_Integer */
+mpz_class& raw_value(GMP_Integer& x);
+
+//@} // Accessor Functions
+
+//! \name Arithmetic Operators
+//@{
+
+//! Assigns to \p x its negation.
+/*! \relates GMP_Integer */
+void neg_assign(GMP_Integer& x);
+
+//! Assigns to \p x the negation of \p y.
+/*! \relates GMP_Integer */
+void neg_assign(GMP_Integer& x, const GMP_Integer& y);
+
+//! Assigns to \p x its absolute value.
+/*! \relates GMP_Integer */
+void abs_assign(GMP_Integer& x);
+
+//! Assigns to \p x the absolute value of \p y.
+/*! \relates GMP_Integer */
+void abs_assign(GMP_Integer& x, const GMP_Integer& y);
+
+//! Assigns to \p x the remainder of the division of \p y by \p z.
+/*! \relates GMP_Integer */
+void rem_assign(GMP_Integer& x,
+                const GMP_Integer& y, const GMP_Integer& z);
+
+//! Assigns to \p x the greatest common divisor of \p y and \p z.
+/*! \relates GMP_Integer */
+void gcd_assign(GMP_Integer& x,
+                const GMP_Integer& y, const GMP_Integer& z);
+
+//! Extended GCD.
+/*! \relates GMP_Integer
+  Assigns to \p x the greatest common divisor of \p y and \p z, and to
+  \p s and \p t the values such that \p y * \p s + \p z * \p t = \p x.
+*/
+void gcdext_assign(GMP_Integer& x, GMP_Integer& s, GMP_Integer& t,
+                   const GMP_Integer& y, const GMP_Integer& z);
+
+//! Assigns to \p x the least common multiple of \p y and \p z.
+/*! \relates GMP_Integer */
+void lcm_assign(GMP_Integer& x,
+                const GMP_Integer& y, const GMP_Integer& z);
+
+//! Assigns to \p x the value <CODE>x + y * z</CODE>.
+/*! \relates GMP_Integer */
+void add_mul_assign(GMP_Integer& x,
+                    const GMP_Integer& y, const GMP_Integer& z);
+
+//! Assigns to \p x the value <CODE>x - y * z</CODE>.
+/*! \relates GMP_Integer */
+void sub_mul_assign(GMP_Integer& x,
+                    const GMP_Integer& y, const GMP_Integer& z);
+
+//! Assigns to \p x the value \f$ y \cdot 2^\mathtt{exp} \f$.
+/*! \relates GMP_Integer */
+void mul_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp);
+
+//! Assigns to \p x the value \f$ y / 2^\mathtt{exp} \f$.
+/*! \relates GMP_Integer */
+void div_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp);
+
+/*! \brief
+  If \p z divides \p y, assigns to \p x the quotient of the integer
+  division of \p y and \p z.
+
+  \relates GMP_Integer
+  The behavior is undefined if \p z does not divide \p y.
+*/
+void exact_div_assign(GMP_Integer& x,
+                      const GMP_Integer& y, const GMP_Integer& z);
+
+//! Assigns to \p x the integer square root of \p y.
+/*! \relates GMP_Integer */
+void sqrt_assign(GMP_Integer& x, const GMP_Integer& y);
+
+/*! \brief
+  Returns a negative, zero or positive value depending on whether
+  \p x is lower than, equal to or greater than \p y, respectively.
+
+  \relates GMP_Integer
+*/
+int cmp(const GMP_Integer& x, const GMP_Integer& y);
+
+//@} // Arithmetic Operators
+
+} // namespace Parma_Polyhedra_Library
+
+#include "GMP_Integer_inlines.hh"
+
+#endif // !defined(PPL_GMP_Integer_defs_hh)
diff --git a/src/GMP_Integer_inlines.hh b/src/GMP_Integer_inlines.hh
new file mode 100644
index 0000000..449622c
--- /dev/null
+++ b/src/GMP_Integer_inlines.hh
@@ -0,0 +1,122 @@
+/* GMP_Integer class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_GMP_Integer_inlines_hh
+#define PPL_GMP_Integer_inlines_hh 1
+
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+neg_assign(GMP_Integer& x) {
+  mpz_neg(x.get_mpz_t(), x.get_mpz_t());
+}
+
+inline void
+neg_assign(GMP_Integer& x, const GMP_Integer& y) {
+  mpz_neg(x.get_mpz_t(), y.get_mpz_t());
+}
+
+inline void
+abs_assign(GMP_Integer& x) {
+  mpz_abs(x.get_mpz_t(), x.get_mpz_t());
+}
+
+inline void
+abs_assign(GMP_Integer& x, const GMP_Integer& y) {
+  mpz_abs(x.get_mpz_t(), y.get_mpz_t());
+}
+
+inline void
+gcd_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
+  mpz_gcd(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+rem_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
+  mpz_tdiv_r(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+gcdext_assign(GMP_Integer& x, GMP_Integer& s, GMP_Integer& t,
+              const GMP_Integer& y, const GMP_Integer& z) {
+  mpz_gcdext(x.get_mpz_t(),
+             s.get_mpz_t(), t.get_mpz_t(),
+             y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+lcm_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
+  mpz_lcm(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+add_mul_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
+  mpz_addmul(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+sub_mul_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
+  mpz_submul(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+mul_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp) {
+  mpz_mul_2exp(x.get_mpz_t(), y.get_mpz_t(), exp);
+}
+
+inline void
+div_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp) {
+  mpz_tdiv_q_2exp(x.get_mpz_t(), y.get_mpz_t(), exp);
+}
+
+inline void
+exact_div_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
+  PPL_ASSERT(y % z == 0);
+  mpz_divexact(x.get_mpz_t(), y.get_mpz_t(), z.get_mpz_t());
+}
+
+inline void
+sqrt_assign(GMP_Integer& x, const GMP_Integer& y) {
+  mpz_sqrt(x.get_mpz_t(), y.get_mpz_t());
+}
+
+inline int
+cmp(const GMP_Integer& x, const GMP_Integer& y) {
+  return mpz_cmp(x.get_mpz_t(), y.get_mpz_t());
+}
+
+inline const mpz_class&
+raw_value(const GMP_Integer& x) {
+  return x;
+}
+
+inline mpz_class&
+raw_value(GMP_Integer& x) {
+  return x;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_GMP_Integer_inlines_hh)
diff --git a/src/GMP_Integer_types.hh b/src/GMP_Integer_types.hh
new file mode 100644
index 0000000..9463fed
--- /dev/null
+++ b/src/GMP_Integer_types.hh
@@ -0,0 +1,45 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_GMP_Integer_types_hh
+#define PPL_GMP_Integer_types_hh 1
+
+#include "Coefficient_traits_template.hh"
+#include <gmpxx.h>
+#include "mp_std_bits_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+/*! \class Parma_Polyhedra_Library::GMP_Integer
+  \brief
+  Unbounded integers as provided by the GMP library.
+
+  \ingroup PPL_CXX_interface
+  GMP_Integer is an alias for the <CODE>mpz_class</CODE> type
+  defined in the C++ interface of the GMP library.
+  For more information, see <CODE>http://gmplib.org/</CODE>
+*/
+typedef mpz_class GMP_Integer;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Coefficient traits specialization for unbounded integers.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <>
+struct Coefficient_traits_template<GMP_Integer> {
+  //! The type used for references to const unbounded integers.
+  typedef const GMP_Integer& const_reference;
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_GMP_Integer_types_hh)
diff --git a/src/Generator.cc b/src/Generator.cc
index ab61b35..4ec86a6 100644
--- a/src/Generator.cc
+++ b/src/Generator.cc
@@ -1,6 +1,6 @@
 /* Generator class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,10 +22,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Generator.defs.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.defs.hh"
-#include "math_utilities.defs.hh"
+#include "Generator_defs.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_defs.hh"
+#include "math_utilities_defs.hh"
 
 #include <iostream>
 #include <sstream>
@@ -35,8 +35,8 @@ namespace PPL = Parma_Polyhedra_Library;
 
 void
 PPL::Generator::throw_dimension_incompatible(const char* method,
-					     const char* v_name,
-					     const Variable v) const {
+                                             const char* v_name,
+                                             const Variable v) const {
   std::ostringstream s;
   s << "PPL::Generator::" << method << ":" << std::endl
     << "this->space_dimension() == " << space_dimension() << ", "
@@ -46,7 +46,7 @@ PPL::Generator::throw_dimension_incompatible(const char* method,
 
 void
 PPL::Generator::throw_invalid_argument(const char* method,
-				       const char* reason) const {
+                                       const char* reason) const {
   std::ostringstream s;
   s << "PPL::Generator::" << method << ":" << std::endl
     << reason << ".";
@@ -88,11 +88,11 @@ PPL::Generator::point(Representation r) {
 
 PPL::Generator
 PPL::Generator::closure_point(const Linear_Expression& e,
-			      Coefficient_traits::const_reference d,
+                              Coefficient_traits::const_reference d,
                               Representation r) {
   if (d == 0)
     throw std::invalid_argument("PPL::closure_point(e, d):\n"
-				"d == 0.");
+                                "d == 0.");
   Linear_Expression ec(e, r);
   ec.set_inhomogeneous_term(d);
 
@@ -125,11 +125,11 @@ PPL::Generator::ray(const Linear_Expression& e, Representation r) {
   // The origin of the space cannot be a ray.
   if (e.all_homogeneous_terms_are_zero())
     throw std::invalid_argument("PPL::ray(e):\n"
-				"e == 0, but the origin cannot be a ray.");
+                                "e == 0, but the origin cannot be a ray.");
 
   Linear_Expression ec(e, r);
   ec.set_inhomogeneous_term(0);
-  Generator g(ec, Generator::RAY, NECESSARILY_CLOSED);
+  const Generator g(ec, Generator::RAY, NECESSARILY_CLOSED);
 
   return g;
 }
@@ -139,11 +139,11 @@ PPL::Generator::line(const Linear_Expression& e, Representation r) {
   // The origin of the space cannot be a line.
   if (e.all_homogeneous_terms_are_zero())
     throw std::invalid_argument("PPL::line(e):\n"
-				"e == 0, but the origin cannot be a line.");
+                                "e == 0, but the origin cannot be a line.");
 
   Linear_Expression ec(e, r);
   ec.set_inhomogeneous_term(0);
-  Generator g(ec, Generator::LINE, NECESSARILY_CLOSED);
+  const Generator g(ec, Generator::LINE, NECESSARILY_CLOSED);
 
   return g;
 }
@@ -172,7 +172,8 @@ PPL::Generator::remove_space_dimensions(const Variables_Set& vars) {
 
     PPL_ASSERT(OK());
     return false;
-  } else {
+  }
+  else {
     strong_normalize();
     PPL_ASSERT(OK());
     return true;
@@ -228,8 +229,8 @@ PPL::Generator::is_equivalent_to(const Generator& y) const {
     // Due to the presence of epsilon-coefficients, syntactically
     // different points may actually encode the same generator.
     // First, drop the epsilon-coefficient ...
-    Linear_Expression x_expr(x);
-    Linear_Expression y_expr(y);
+    Linear_Expression x_expr(x.expression());
+    Linear_Expression y_expr(y.expression());
     // ... second, re-normalize ...
     x_expr.normalize();
     y_expr.normalize();
@@ -291,7 +292,7 @@ PPL::Generator::fancy_print(std::ostream& s) const {
     bool needed_divisor = false;
   bool extra_parentheses = false;
   const dimension_type num_variables = space_dimension();
-  Generator::Type t = type();
+  const Generator::Type t = type();
   switch (t) {
   case Generator::LINE:
     s << "l(";
@@ -378,9 +379,9 @@ PPL::IO_Operators::operator<<(std::ostream& s, const Generator::Type& t) {
 bool
 PPL::Generator::is_matching_closure_point(const Generator& p) const {
   PPL_ASSERT(topology() == p.topology()
-	 && space_dimension() == p.space_dimension()
-	 && type() == CLOSURE_POINT
-	 && p.type() == POINT);
+         && space_dimension() == p.space_dimension()
+         && type() == CLOSURE_POINT
+         && p.type() == POINT);
   const Generator& cp = *this;
   if (cp.expr.inhomogeneous_term() == p.expr.inhomogeneous_term()) {
     // Divisors are equal: we can simply compare coefficients
@@ -414,8 +415,8 @@ PPL::Generator::OK() const {
   if (is_not_necessarily_closed() && expr.space_dimension() == 0) {
 #ifndef NDEBUG
     std::cerr << "Generator has fewer coefficients than the minimum "
-	      << "allowed by its topology."
-	      << std::endl;
+              << "allowed by its topology."
+              << std::endl;
 #endif
     return false;
   }
@@ -426,7 +427,7 @@ PPL::Generator::OK() const {
   if (tmp != *this) {
 #ifndef NDEBUG
     std::cerr << "Generators should be strongly normalized!"
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
@@ -438,15 +439,15 @@ PPL::Generator::OK() const {
     if (expr.inhomogeneous_term() != 0) {
 #ifndef NDEBUG
       std::cerr << "Lines must have a zero inhomogeneous term!"
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
     if (!is_necessarily_closed() && epsilon_coefficient() != 0) {
 #ifndef NDEBUG
       std::cerr << "Lines and rays must have a zero coefficient "
-		<< "for the epsilon dimension!"
-		<< std::endl;
+                << "for the epsilon dimension!"
+                << std::endl;
 #endif
       return false;
     }
@@ -455,7 +456,7 @@ PPL::Generator::OK() const {
     if (expr.all_homogeneous_terms_are_zero()) {
 #ifndef NDEBUG
       std::cerr << "The origin of the vector space cannot be a line or a ray!"
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
@@ -465,17 +466,17 @@ PPL::Generator::OK() const {
     if (expr.inhomogeneous_term() <= 0) {
 #ifndef NDEBUG
       std::cerr << "Points must have a positive divisor!"
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
     if (!is_necessarily_closed())
       if (epsilon_coefficient() <= 0) {
 #ifndef NDEBUG
-	std::cerr << "In the NNC topology, points must have epsilon > 0"
-		  << std::endl;
+        std::cerr << "In the NNC topology, points must have epsilon > 0"
+                  << std::endl;
 #endif
-	return false;
+        return false;
       }
     break;
 
@@ -483,7 +484,7 @@ PPL::Generator::OK() const {
     if (expr.inhomogeneous_term() <= 0) {
 #ifndef NDEBUG
       std::cerr << "Closure points must have a positive divisor!"
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
diff --git a/src/Generator.defs.hh b/src/Generator.defs.hh
deleted file mode 100644
index c842319..0000000
--- a/src/Generator.defs.hh
+++ /dev/null
@@ -1,1036 +0,0 @@
-/* Generator class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Generator_defs_hh
-#define PPL_Generator_defs_hh 1
-
-#include "Generator.types.hh"
-#include "Scalar_Products.types.hh"
-#include "Variables_Set.types.hh"
-#include "Constraint_System.types.hh"
-#include "Generator_System.types.hh"
-#include "Congruence_System.types.hh"
-#include "Polyhedron.types.hh"
-#include "Grid_Generator.types.hh"
-#include "Grid_Generator_System.types.hh"
-#include "MIP_Problem.types.hh"
-#include "Grid.types.hh"
-
-#include "Variable.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Checked_Number.defs.hh"
-#include "distances.defs.hh"
-#include "Topology.types.hh"
-#include "Expression_Hide_Last.defs.hh"
-#include "Expression_Hide_Inhomo.defs.hh"
-
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-// Put them in the namespace here to declare them friend later.
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The basic comparison function.
-/*! \relates Generator
-  \return
-  The returned absolute value can be \f$0\f$, \f$1\f$ or \f$2\f$.
-
-  \param x
-  A row of coefficients;
-
-  \param y
-  Another row.
-
-  Compares \p x and \p y, where \p x and \p y may be of different size,
-  in which case the "missing" coefficients are assumed to be zero.
-  The comparison is such that:
-  -# equalities are smaller than inequalities;
-  -# lines are smaller than points and rays;
-  -# the ordering is lexicographic;
-  -# the positions compared are, in decreasing order of significance,
-     1, 2, ..., \p size(), 0;
-  -# the result is negative, zero, or positive if x is smaller than,
-     equal to, or greater than y, respectively;
-  -# when \p x and \p y are different, the absolute value of the
-     result is 1 if the difference is due to the coefficient in
-     position 0; it is 2 otherwise.
-
-  When \p x and \p y represent the hyper-planes associated
-  to two equality or inequality constraints, the coefficient
-  at 0 is the known term.
-  In this case, the return value can be characterized as follows:
-  - -2, if \p x is smaller than \p y and they are \e not parallel;
-  - -1, if \p x is smaller than \p y and they \e are parallel;
-  -  0, if \p x and y are equal;
-  - +1, if \p y is smaller than \p x and they \e are parallel;
-  - +2, if \p y is smaller than \p x and they are \e not parallel.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-int compare(const Generator& x, const Generator& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Generator */
-std::ostream& operator<<(std::ostream& s, const Generator& g);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Generator */
-void swap(Generator& x, Generator& y);
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! A line, ray, point or closure point.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Generator is one of the following:
-
-  - a line \f$\vect{l} = (a_0, \ldots, a_{n-1})^\transpose\f$;
-
-  - a ray \f$\vect{r} = (a_0, \ldots, a_{n-1})^\transpose\f$;
-
-  - a point
-    \f$\vect{p} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
-
-  - a closure point
-    \f$\vect{c} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
-
-  where \f$n\f$ is the dimension of the space
-  and, for points and closure points, \f$d > 0\f$ is the divisor.
-
-  \par A note on terminology.
-  As observed in Section \ref representation, there are cases when,
-  in order to represent a polyhedron \f$\cP\f$ using the generator system
-  \f$\cG = (L, R, P, C)\f$, we need to include in the finite set
-  \f$P\f$ even points of \f$\cP\f$ that are <EM>not</EM> vertices
-  of \f$\cP\f$.
-  This situation is even more frequent when working with NNC polyhedra
-  and it is the reason why we prefer to use the word `point'
-  where other libraries use the word `vertex'.
-
-  \par How to build a generator.
-  Each type of generator is built by applying the corresponding
-  function (<CODE>line</CODE>, <CODE>ray</CODE>, <CODE>point</CODE>
-  or <CODE>closure_point</CODE>) to a linear expression,
-  representing a direction in the space;
-  the space dimension of the generator is defined as the space dimension
-  of the corresponding linear expression.
-  Linear expressions used to define a generator should be homogeneous
-  (any constant term will be simply ignored).
-  When defining points and closure points, an optional Coefficient argument
-  can be used as a common <EM>divisor</EM> for all the coefficients
-  occurring in the provided linear expression;
-  the default value for this argument is 1.
-
-  \par
-  In all the following examples it is assumed that variables
-  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
-  are defined as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable z(2);
-  \endcode
-
-  \par Example 1
-  The following code builds a line with direction \f$x-y-z\f$
-  and having space dimension \f$3\f$:
-  \code
-  Generator l = line(x - y - z);
-  \endcode
-  As mentioned above, the constant term of the linear expression
-  is not relevant. Thus, the following code has the same effect:
-  \code
-  Generator l = line(x - y - z + 15);
-  \endcode
-  By definition, the origin of the space is not a line, so that
-  the following code throws an exception:
-  \code
-  Generator l = line(0*x);
-  \endcode
-
-  \par Example 2
-  The following code builds a ray with the same direction as the
-  line in Example 1:
-  \code
-  Generator r = ray(x - y - z);
-  \endcode
-  As is the case for lines, when specifying a ray the constant term
-  of the linear expression is not relevant; also, an exception is thrown
-  when trying to build a ray from the origin of the space.
-
-  \par Example 3
-  The following code builds the point
-  \f$\vect{p} = (1, 0, 2)^\transpose \in \Rset^3\f$:
-  \code
-  Generator p = point(1*x + 0*y + 2*z);
-  \endcode
-  The same effect can be obtained by using the following code:
-  \code
-  Generator p = point(x + 2*z);
-  \endcode
-  Similarly, the origin \f$\vect{0} \in \Rset^3\f$ can be defined
-  using either one of the following lines of code:
-  \code
-  Generator origin3 = point(0*x + 0*y + 0*z);
-  Generator origin3_alt = point(0*z);
-  \endcode
-  Note however that the following code would have defined
-  a different point, namely \f$\vect{0} \in \Rset^2\f$:
-  \code
-  Generator origin2 = point(0*y);
-  \endcode
-  The following two lines of code both define the only point
-  having space dimension zero, namely \f$\vect{0} \in \Rset^0\f$.
-  In the second case we exploit the fact that the first argument
-  of the function <CODE>point</CODE> is optional.
-  \code
-  Generator origin0 = Generator::zero_dim_point();
-  Generator origin0_alt = point();
-  \endcode
-
-  \par Example 4
-  The point \f$\vect{p}\f$ specified in Example 3 above
-  can also be obtained with the following code,
-  where we provide a non-default value for the second argument
-  of the function <CODE>point</CODE> (the divisor):
-  \code
-  Generator p = point(2*x + 0*y + 4*z, 2);
-  \endcode
-  Obviously, the divisor can be usefully exploited to specify
-  points having some non-integer (but rational) coordinates.
-  For instance, the point
-  \f$\vect{q} = (-1.5, 3.2, 2.1)^\transpose \in \Rset^3\f$
-  can be specified by the following code:
-  \code
-  Generator q = point(-15*x + 32*y + 21*z, 10);
-  \endcode
-  If a zero divisor is provided, an exception is thrown.
-
-  \par Example 5
-  Closure points are specified in the same way we defined points,
-  but invoking their specific constructor function.
-  For instance, the closure point
-  \f$\vect{c} = (1, 0, 2)^\transpose \in \Rset^3\f$ is defined by
-  \code
-  Generator c = closure_point(1*x + 0*y + 2*z);
-  \endcode
-  For the particular case of the (only) closure point
-  having space dimension zero, we can use any of the following:
-  \code
-  Generator closure_origin0 = Generator::zero_dim_closure_point();
-  Generator closure_origin0_alt = closure_point();
-  \endcode
-
-  \par How to inspect a generator
-  Several methods are provided to examine a generator and extract
-  all the encoded information: its space dimension, its type and
-  the value of its integer coefficients.
-
-  \par Example 6
-  The following code shows how it is possible to access each single
-  coefficient of a generator.
-  If <CODE>g1</CODE> is a point having coordinates
-  \f$(a_0, \ldots, a_{n-1})^\transpose\f$,
-  we construct the closure point <CODE>g2</CODE> having coordinates
-  \f$(a_0, 2 a_1, \ldots, (i+1)a_i, \ldots, n a_{n-1})^\transpose\f$.
-  \code
-  if (g1.is_point()) {
-    cout << "Point g1: " << g1 << endl;
-    Linear_Expression e;
-    for (dimension_type i = g1.space_dimension(); i-- > 0; )
-      e += (i + 1) * g1.coefficient(Variable(i)) * Variable(i);
-    Generator g2 = closure_point(e, g1.divisor());
-    cout << "Closure point g2: " << g2 << endl;
-  }
-  else
-    cout << "Generator g1 is not a point." << endl;
-  \endcode
-  Therefore, for the point
-  \code
-  Generator g1 = point(2*x - y + 3*z, 2);
-  \endcode
-  we would obtain the following output:
-  \code
-  Point g1: p((2*A - B + 3*C)/2)
-  Closure point g2: cp((2*A - 2*B + 9*C)/2)
-  \endcode
-  When working with (closure) points, be careful not to confuse
-  the notion of <EM>coefficient</EM> with the notion of <EM>coordinate</EM>:
-  these are equivalent only when the divisor of the (closure) point is 1.
-*/
-class Parma_Polyhedra_Library::Generator {
-public:
-
-  //! The representation used for new Generators.
-  /*!
-    \note The copy constructor and the copy constructor with specified size
-          use the representation of the original object, so that it is
-          indistinguishable from the original object.
-  */
-  static const Representation default_representation = SPARSE;
-
-  //! Returns the line of direction \p e.
-  /*!
-    \exception std::invalid_argument
-    Thrown if the homogeneous part of \p e represents the origin of
-    the vector space.
-  */
-  static Generator line(const Linear_Expression& e,
-                        Representation r = default_representation);
-
-  //! Returns the ray of direction \p e.
-  /*!
-    \exception std::invalid_argument
-    Thrown if the homogeneous part of \p e represents the origin of
-    the vector space.
-  */
-  static Generator ray(const Linear_Expression& e,
-                       Representation r = default_representation);
-
-  //! Returns the point at \p e / \p d.
-  /*!
-    Both \p e and \p d are optional arguments, with default values
-    Linear_Expression::zero() and Coefficient_one(), respectively.
-
-    \exception std::invalid_argument
-    Thrown if \p d is zero.
-  */
-  static Generator point(const Linear_Expression& e
-                         = Linear_Expression::zero(),
-                         Coefficient_traits::const_reference d
-                         = Coefficient_one(),
-                         Representation r = default_representation);
-
-  //! Returns the origin.
-  static Generator point(Representation r);
-
-  //! Returns the point at \p e.
-  static Generator point(const Linear_Expression& e,
-                         Representation r);
-
-  //! Constructs the point at the origin.
-  explicit Generator(Representation r = default_representation);
-
-  //! Returns the closure point at \p e / \p d.
-  /*!
-    Both \p e and \p d are optional arguments, with default values
-    Linear_Expression::zero() and Coefficient_one(), respectively.
-
-    \exception std::invalid_argument
-    Thrown if \p d is zero.
-  */
-  static Generator
-  closure_point(const Linear_Expression& e = Linear_Expression::zero(),
-                Coefficient_traits::const_reference d = Coefficient_one(),
-                Representation r = default_representation);
-
-  //! Returns the closure point at the origin.
-  static Generator
-  closure_point(Representation r);
-
-  //! Returns the closure point at \p e.
-  static Generator
-  closure_point(const Linear_Expression& e, Representation r);
-
-  //! Ordinary copy constructor.
-  //! The representation of the new Generator will be the same as g.
-  Generator(const Generator& g);
-
-  //! Copy constructor with given representation.
-  Generator(const Generator& g, Representation r);
-
-  //! Copy constructor with given space dimension.
-  //! The representation of the new Generator will be the same as g.
-  Generator(const Generator& g, dimension_type space_dim);
-
-  //! Copy constructor with given representation and space dimension.
-  Generator(const Generator& g, dimension_type space_dim, Representation r);
-
-  //! Destructor.
-  ~Generator();
-
-  //! Assignment operator.
-  Generator& operator=(const Generator& g);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Generator can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Sets the dimension of the vector space enclosing \p *this to
-  //! \p space_dim .
-  void set_space_dimension(dimension_type space_dim);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Removes all the specified dimensions from the generator.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-
-    If all dimensions with nonzero coefficients are removed from a ray or a
-    line, it is changed into a point and this method returns \p false .
-    Otherwise, it returns \p true .
-  */
-  bool remove_space_dimensions(const Variables_Set& vars);
-
-  //! Permutes the space dimensions of the generator.
-  /*!
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! The generator type.
-  enum Type {
-    /*! The generator is a line. */
-    LINE,
-    /*! The generator is a ray. */
-    RAY,
-    /*! The generator is a point. */
-    POINT,
-    /*! The generator is a closure point. */
-    CLOSURE_POINT
-  };
-
-  //! Returns the generator type of \p *this.
-  Type type() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a line.
-  bool is_line() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a ray.
-  bool is_ray() const;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! Returns <CODE>true</CODE> if and only if \p *this is a line or a ray.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool is_line_or_ray() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a point.
-  bool is_point() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a closure point.
-  bool is_closure_point() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  /*!
-    \exception std::invalid_argument
-    Thrown if the index of \p v is greater than or equal to the
-    space dimension of \p *this.
-  */
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! If \p *this is either a point or a closure point, returns its divisor.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this is neither a point nor a closure point.
-  */
-  Coefficient_traits::const_reference divisor() const;
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  //! Returns the origin of the zero-dimensional space \f$\Rset^0\f$.
-  static const Generator& zero_dim_point();
-
-  /*! \brief
-    Returns, as a closure point,
-    the origin of the zero-dimensional space \f$\Rset^0\f$.
-  */
-  static const Generator& zero_dim_closure_point();
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y
-    are equivalent generators.
-
-    Generators having different space dimensions are not equivalent.
-  */
-  bool is_equivalent_to(const Generator& y) const;
-
-  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
-  /*!
-    This is faster than is_equivalent_to(), but it may return `false' even
-    for equivalent generators.
-  */
-  bool is_equal_to(const Generator& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Generator& y);
-
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> > Expression;
-
-  //! Allows user code to read the internal expression (but note that this
-  //! is a different type, not all operations are allowed).
-  const Expression& expression() const;
-
-private:
-  //! The possible kinds of Generator objects.
-  enum Kind {
-    LINE_OR_EQUALITY = 0,
-    RAY_OR_POINT_OR_INEQUALITY = 1
-  };
-
-  Linear_Expression expr;
-
-  Expression_Hide_Inhomo<Linear_Expression> semi_wrapped_expr;
-
-  Expression wrapped_expr;
-
-  Kind kind_;
-
-  Topology topology_;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the origin of the zero-dimensional space \f$\Rset^0\f$.
-  */
-  static const Generator* zero_dim_point_p;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the origin of the zero-dimensional space \f$\Rset^0\f$, as a closure point.
-  */
-  static const Generator* zero_dim_closure_point_p;
-
-  /*! \brief
-    Builds a generator of type \p type and topology \p topology,
-    stealing the coefficients from \p e.
-
-    If the topology is NNC, the last dimension of \p e is used as the epsilon
-    coefficient.
-  */
-  Generator(Linear_Expression& e, Type type, Topology topology);
-
-  Generator(Linear_Expression& e, Kind kind, Topology topology);
-
-  Generator(dimension_type space_dim, Kind kind, Topology topology,
-            Representation r = default_representation);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row
-    represents a line or an equality.
-  */
-  bool is_line_or_equality() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row
-    represents a ray, a point or an inequality.
-  */
-  bool is_ray_or_point_or_inequality() const;
-
-  //! Sets to \p LINE_OR_EQUALITY the kind of \p *this row.
-  void set_is_line_or_equality();
-
-  //! Sets to \p RAY_OR_POINT_OR_INEQUALITY the kind of \p *this row.
-  void set_is_ray_or_point_or_inequality();
-
-  //! \name Flags inspection methods
-  //@{
-  //! Returns the topological kind of \p *this.
-  Topology topology() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the topology
-    of \p *this row is not necessarily closed.
-  */
-  bool is_not_necessarily_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the topology
-    of \p *this row is necessarily closed.
-  */
-  bool is_necessarily_closed() const;
-  //@} // Flags inspection methods
-
-  //! \name Flags coercion methods
-  //@{
-
-  //! Sets to \p x the topological kind of \p *this row.
-  void set_topology(Topology x);
-
-  //! Sets to \p NECESSARILY_CLOSED the topological kind of \p *this row.
-  void set_necessarily_closed();
-
-  //! Sets to \p NOT_NECESSARILY_CLOSED the topological kind of \p *this row.
-  void set_not_necessarily_closed();
-  //@} // Flags coercion methods
-
-  //! Marks the epsilon dimension as a standard dimension.
-  /*!
-    The row topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is increased by 1.
-  */
-  void mark_as_necessarily_closed();
-
-  //! Marks the last dimension as the epsilon dimension.
-  /*!
-    The row topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is decreased by 1.
-  */
-  void mark_as_not_necessarily_closed();
-
-  //! Linearly combines \p *this with \p y so that i-th coefficient is 0.
-  /*!
-    \param y
-    The Generator that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting Generator to \p *this and normalizes it.
-  */
-  void linear_combine(const Generator& y, dimension_type i);
-
-  //! Sets the dimension of the vector space enclosing \p *this to
-  //! \p space_dim .
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  /*!
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid objects.
-  */
-  void set_space_dimension_no_ok(dimension_type space_dim);
-
-  /*! \brief
-    Throw a <CODE>std::invalid_argument</CODE> exception
-    containing the appropriate error message.
-  */
-  void
-  throw_dimension_incompatible(const char* method,
-			       const char* v_name,
-			       Variable v) const;
-
-  /*! \brief
-    Throw a <CODE>std::invalid_argument</CODE> exception
-    containing the appropriate error message.
-  */
-  void
-  throw_invalid_argument(const char* method, const char* reason) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is not a line.
-  bool is_ray_or_point() const;
-
-  //! Sets the Generator kind to <CODE>LINE_OR_EQUALITY</CODE>.
-  void set_is_line();
-
-  //! Sets the Generator kind to <CODE>RAY_OR_POINT_OR_INEQUALITY</CODE>.
-  void set_is_ray_or_point();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the closure point
-    \p *this has the same \e coordinates of the point \p p.
-
-    It is \e assumed that \p *this is a closure point, \p p is a point
-    and both topologies and space dimensions agree.
-  */
-  bool is_matching_closure_point(const Generator& p) const;
-
-  //! Returns the epsilon coefficient. The generator must be NNC.
-  Coefficient_traits::const_reference epsilon_coefficient() const;
-
-  //! Sets the epsilon coefficient to \p n. The generator must be NNC.
-  void set_epsilon_coefficient(Coefficient_traits::const_reference n);
-
-  /*! \brief
-    Normalizes the sign of the coefficients so that the first non-zero
-    (homogeneous) coefficient of a line-or-equality is positive.
-  */
-  void sign_normalize();
-
-  /*! \brief
-    Strong normalization: ensures that different Generator objects
-    represent different hyperplanes or hyperspaces.
-
-    Applies both Generator::normalize() and Generator::sign_normalize().
-  */
-  void strong_normalize();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the coefficients are
-    strongly normalized.
-  */
-  bool check_strong_normalized() const;
-
-  //! Another print functions, with fancy output, more human-friendly.
-  //! This is used by operator<<();
-  void fancy_print(std::ostream& s) const;
-
-  friend class Linear_System<Generator>;
-  friend class Parma_Polyhedra_Library::Scalar_Products;
-  friend class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Sign;
-  friend class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Assign;
-  friend class Parma_Polyhedra_Library::Generator_System;
-  friend class Parma_Polyhedra_Library::Generator_System_const_iterator;
-  // FIXME: the following friend declaration should be avoided.
-  friend class Parma_Polyhedra_Library::Polyhedron;
-  // This is for access to Linear_Expression in `insert'.
-  friend class Parma_Polyhedra_Library::Grid_Generator_System;
-  friend class Parma_Polyhedra_Library::MIP_Problem;
-  friend class Parma_Polyhedra_Library::Grid;
-
-  friend
-  Parma_Polyhedra_Library
-  ::Linear_Expression::Linear_Expression(const Generator& g);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream& s,
-						    const Generator& g);
-
-  friend int
-  compare(const Generator& x, const Generator& y);
-};
-
-
-namespace Parma_Polyhedra_Library {
-
-//! Shorthand for Generator::line(const Linear_Expression& e, Representation r).
-/*! \relates Generator */
-Generator line(const Linear_Expression& e,
-               Representation r = Generator::default_representation);
-
-//! Shorthand for Generator::ray(const Linear_Expression& e, Representation r).
-/*! \relates Generator */
-Generator ray(const Linear_Expression& e,
-              Representation r = Generator::default_representation);
-
-/*! \brief
-  Shorthand for
-  Generator::point(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
-
-  \relates Generator
-*/
-Generator
-point(const Linear_Expression& e = Linear_Expression::zero(),
-      Coefficient_traits::const_reference d = Coefficient_one(),
-      Representation r = Generator::default_representation);
-
-//! Shorthand for Generator::point(Representation r).
-/*! \relates Generator */
-Generator
-point(Representation r);
-
-/*! \brief
-  Shorthand for
-  Generator::point(const Linear_Expression& e, Representation r).
-
-  \relates Generator
-*/
-Generator
-point(const Linear_Expression& e, Representation r);
-
-/*! \brief
-  Shorthand for
-  Generator::closure_point(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
-
-  \relates Generator
-*/
-Generator
-closure_point(const Linear_Expression& e = Linear_Expression::zero(),
-              Coefficient_traits::const_reference d = Coefficient_one(),
-              Representation r = Generator::default_representation);
-
-//! Shorthand for Generator::closure_point(Representation r).
-/*! \relates Generator */
-Generator
-closure_point(Representation r);
-
-/*! \brief
-  Shorthand for
-  Generator::closure_point(const Linear_Expression& e, Representation r).
-
-  \relates Generator
-*/
-Generator
-closure_point(const Linear_Expression& e, Representation r);
-
-//! Returns <CODE>true</CODE> if and only if \p x is equivalent to \p y.
-/*! \relates Generator */
-bool operator==(const Generator& x, const Generator& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x is not equivalent to \p y.
-/*! \relates Generator */
-bool operator!=(const Generator& x, const Generator& y);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Generator
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename To>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Generator& x,
-                                 const Generator& y,
-                                 Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Generator
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename Temp, typename To>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Generator& x,
-                                 const Generator& y,
-                                 Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Generator
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename Temp, typename To>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Generator& x,
-                                 const Generator& y,
-                                 Rounding_Dir dir,
-                                 Temp& tmp0,
-                                 Temp& tmp1,
-                                 Temp& tmp2);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Generator
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename To>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const Generator& x,
-                               const Generator& y,
-                               Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Generator
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename Temp, typename To>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Generator& x,
-                                 const Generator& y,
-                                 Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Generator
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename Temp, typename To>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const Generator& x,
-                               const Generator& y,
-                               Rounding_Dir dir,
-                               Temp& tmp0,
-                               Temp& tmp1,
-                               Temp& tmp2);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Generator
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename To>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const Generator& x,
-                                const Generator& y,
-                                Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Generator
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename Temp, typename To>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const Generator& x,
-                                const Generator& y,
-                                Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Generator
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-
-  \note
-  Distances are \e only defined between generators that are points and/or
-  closure points; for rays or lines, \c false is returned.
-*/
-template <typename Temp, typename To>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const Generator& x,
-                                const Generator& y,
-                                Rounding_Dir dir,
-                                Temp& tmp0,
-                                Temp& tmp1,
-                                Temp& tmp2);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Generator */
-std::ostream& operator<<(std::ostream& s, const Generator::Type& t);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Generator.inlines.hh"
-
-#endif // !defined(PPL_Generator_defs_hh)
diff --git a/src/Generator.inlines.hh b/src/Generator.inlines.hh
deleted file mode 100644
index 88e0a96..0000000
--- a/src/Generator.inlines.hh
+++ /dev/null
@@ -1,728 +0,0 @@
-/* Generator class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Generator_inlines_hh
-#define PPL_Generator_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline bool
-Generator::is_necessarily_closed() const {
-  return (topology() == NECESSARILY_CLOSED);
-}
-
-inline bool
-Generator::is_not_necessarily_closed() const {
-  return (topology() == NOT_NECESSARILY_CLOSED);
-}
-
-inline dimension_type
-Generator::space_dimension() const {
-  return wrapped_expr.space_dimension();
-}
-
-inline bool
-Generator::is_line_or_equality() const {
-  return (kind_ == LINE_OR_EQUALITY);
-}
-
-inline bool
-Generator::is_ray_or_point_or_inequality() const {
-  return (kind_ == RAY_OR_POINT_OR_INEQUALITY);
-}
-
-inline Topology
-Generator::topology() const {
-  return topology_;
-}
-
-inline void
-Generator::set_is_line_or_equality() {
-  kind_ = LINE_OR_EQUALITY;
-}
-
-inline void
-Generator::set_is_ray_or_point_or_inequality() {
-  kind_ = RAY_OR_POINT_OR_INEQUALITY;
-}
-
-inline void
-Generator::set_topology(Topology x) {
-  if (topology() == x)
-    return;
-  if (topology() == NECESSARILY_CLOSED) {
-    // Add a column for the epsilon dimension.
-    expr.set_space_dimension(expr.space_dimension() + 1);
-    wrapped_expr.set_hide_last(true);
-  } else {
-    PPL_ASSERT(expr.space_dimension() > 0);
-    expr.set_space_dimension(expr.space_dimension() - 1);
-    wrapped_expr.set_hide_last(false);
-  }
-  topology_ = x;
-}
-
-inline void
-Generator::mark_as_necessarily_closed() {
-  PPL_ASSERT(is_not_necessarily_closed());
-  topology_ = NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(false);
-}
-
-inline void
-Generator::mark_as_not_necessarily_closed() {
-  PPL_ASSERT(is_necessarily_closed());
-  topology_ = NOT_NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(true);
-}
-
-inline void
-Generator::set_necessarily_closed() {
-  set_topology(NECESSARILY_CLOSED);
-}
-
-inline void
-Generator::set_not_necessarily_closed() {
-  set_topology(NOT_NECESSARILY_CLOSED);
-}
-
-inline
-Generator::Generator(Representation r)
-  : expr(r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, false),
-    kind_(RAY_OR_POINT_OR_INEQUALITY),
-    topology_(NECESSARILY_CLOSED) {
-  expr.set_inhomogeneous_term(Coefficient_one());
-  PPL_ASSERT(space_dimension() == 0);
-  PPL_ASSERT(OK());
-}
-
-inline
-Generator::Generator(dimension_type space_dim, Kind kind, Topology topology,
-                     Representation r)
-  : expr(r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, topology == NOT_NECESSARILY_CLOSED),
-    kind_(kind),
-    topology_(topology) {
-  if (is_necessarily_closed())
-    expr.set_space_dimension(space_dim);
-  else
-    expr.set_space_dimension(space_dim + 1);
-  PPL_ASSERT(space_dimension() == space_dim);
-  PPL_ASSERT(OK());
-}
-
-inline
-Generator::Generator(Linear_Expression& e, Type type, Topology topology)
-  : semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, topology == NOT_NECESSARILY_CLOSED),
-    topology_(topology) {
-  PPL_ASSERT(type != CLOSURE_POINT || topology == NOT_NECESSARILY_CLOSED);
-  swap(expr, e);
-  if (topology == NOT_NECESSARILY_CLOSED)
-    expr.set_space_dimension(expr.space_dimension() + 1);
-  if (type == LINE)
-    kind_ = LINE_OR_EQUALITY;
-  else
-    kind_ = RAY_OR_POINT_OR_INEQUALITY;
-  strong_normalize();
-}
-
-inline
-Generator::Generator(Linear_Expression& e, Kind kind, Topology topology)
-  : semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, topology == NOT_NECESSARILY_CLOSED),
-    kind_(kind),
-    topology_(topology) {
-  swap(expr, e);
-  if (topology == NOT_NECESSARILY_CLOSED)
-    expr.set_space_dimension(expr.space_dimension() + 1);
-  strong_normalize();
-}
-
-inline
-Generator::Generator(const Generator& g)
-  : expr(g.expr),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
-    kind_(g.kind_),
-    topology_(g.topology_) {
-}
-
-inline
-Generator::Generator(const Generator& g, Representation r)
-  : expr(g.expr, r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
-    kind_(g.kind_),
-    topology_(g.topology_) {
-  // This does not assert OK() because it's called by OK().
-  PPL_ASSERT(OK());
-}
-
-inline
-Generator::Generator(const Generator& g, dimension_type space_dim)
-  : expr(g.expr, g.is_necessarily_closed() ? space_dim : (space_dim + 1)),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
-    kind_(g.kind_),
-    topology_(g.topology_) {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(space_dimension() == space_dim);
-}
-
-inline
-Generator::Generator(const Generator& g, dimension_type space_dim,
-                     Representation r)
-  : expr(g.expr, g.is_necessarily_closed() ? space_dim : (space_dim + 1), r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
-    kind_(g.kind_),
-    topology_(g.topology_) {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(space_dimension() == space_dim);
-}
-
-inline
-Generator::~Generator() {
-}
-
-inline Generator&
-Generator::operator=(const Generator& g) {
-  Generator tmp = g;
-  swap(*this, tmp);
-
-  return *this;
-}
-
-inline const Generator::Expression&
-Generator::expression() const {
-  return wrapped_expr;
-}
-
-inline Representation
-Generator::representation() const {
-  return expr.representation();
-}
-
-inline void
-Generator::set_representation(Representation r) {
-  expr.set_representation(r);
-}
-
-inline dimension_type
-Generator::max_space_dimension() {
-  return Linear_Expression::max_space_dimension();
-}
-
-inline void
-Generator::set_space_dimension_no_ok(dimension_type space_dim) {
-  const dimension_type old_expr_space_dim = expr.space_dimension();
-  if (topology() == NECESSARILY_CLOSED) {
-    expr.set_space_dimension(space_dim);
-  } else {
-    const dimension_type old_space_dim = space_dimension();
-    if (space_dim > old_space_dim) {
-      expr.set_space_dimension(space_dim + 1);
-      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-    } else {
-      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-      expr.set_space_dimension(space_dim + 1);
-    }
-  }
-  PPL_ASSERT(space_dimension() == space_dim);
-  if (expr.space_dimension() < old_expr_space_dim)
-    strong_normalize();
-}
-
-inline void
-Generator::set_space_dimension(dimension_type space_dim) {
-  set_space_dimension_no_ok(space_dim);
-  PPL_ASSERT(OK());
-}
-
-inline void
-Generator::shift_space_dimensions(Variable v, dimension_type n) {
-  expr.shift_space_dimensions(v, n);
-}
-
-inline bool
-Generator::is_line() const {
-  return is_line_or_equality();
-}
-
-inline bool
-Generator::is_ray_or_point() const {
-  return is_ray_or_point_or_inequality();
-}
-
-inline bool
-Generator::is_line_or_ray() const {
-  return expr.inhomogeneous_term() == 0;
-}
-
-inline bool
-Generator::is_ray() const {
-  return is_ray_or_point() && is_line_or_ray();
-}
-
-inline Generator::Type
-Generator::type() const {
-  if (is_line())
-    return LINE;
-  if (is_line_or_ray())
-    return RAY;
-  if (is_necessarily_closed())
-    return POINT;
-  else {
-    // Checking the value of the epsilon coefficient.
-    if (epsilon_coefficient() == 0)
-      return CLOSURE_POINT;
-    else
-      return POINT;
-  }
-}
-
-inline bool
-Generator::is_point() const {
-  return type() == POINT;
-}
-
-inline bool
-Generator::is_closure_point() const {
-  return type() == CLOSURE_POINT;
-}
-
-inline void
-Generator::set_is_line() {
-  set_is_line_or_equality();
-}
-
-inline void
-Generator::set_is_ray_or_point() {
-  set_is_ray_or_point_or_inequality();
-}
-
-inline Coefficient_traits::const_reference
-Generator::coefficient(const Variable v) const {
-  if (v.space_dimension() > space_dimension())
-    throw_dimension_incompatible("coefficient(v)", "v", v);
-  return expr.coefficient(v);
-}
-
-inline Coefficient_traits::const_reference
-Generator::divisor() const {
-  Coefficient_traits::const_reference d = expr.inhomogeneous_term();
-  if (!is_ray_or_point() || d == 0)
-    throw_invalid_argument("divisor()",
-			   "*this is neither a point nor a closure point");
-  return d;
-}
-
-inline Coefficient_traits::const_reference
-Generator::epsilon_coefficient() const {
-  PPL_ASSERT(is_not_necessarily_closed());
-  return expr.coefficient(Variable(expr.space_dimension() - 1));
-}
-
-
-inline void
-Generator::set_epsilon_coefficient(Coefficient_traits::const_reference n) {
-  PPL_ASSERT(is_not_necessarily_closed());
-  expr.set_coefficient(Variable(expr.space_dimension() - 1), n);
-}
-
-
-inline memory_size_type
-Generator::external_memory_in_bytes() const {
-  return expr.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Generator::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline void
-Generator::strong_normalize() {
-  expr.normalize();
-  sign_normalize();
-}
-
-inline const Generator&
-Generator::zero_dim_point() {
-  PPL_ASSERT(zero_dim_point_p != 0);
-  return *zero_dim_point_p;
-}
-
-inline const Generator&
-Generator::zero_dim_closure_point() {
-  PPL_ASSERT(zero_dim_closure_point_p != 0);
-  return *zero_dim_closure_point_p;
-}
-
-/*! \relates Generator */
-inline Generator
-line(const Linear_Expression& e, Representation r) {
-  return Generator::line(e, r);
-}
-
-/*! \relates Generator */
-inline Generator
-ray(const Linear_Expression& e, Representation r) {
-  return Generator::ray(e, r);
-}
-
-/*! \relates Generator */
-inline Generator
-point(const Linear_Expression& e, Coefficient_traits::const_reference d,
-      Representation r) {
-  return Generator::point(e, d, r);
-}
-
-/*! \relates Generator */
-inline Generator
-point(Representation r) {
-  return Generator::point(r);
-}
-
-/*! \relates Generator */
-inline Generator
-point(const Linear_Expression& e, Representation r) {
-  return Generator::point(e, r);
-}
-
-/*! \relates Generator */
-inline Generator
-closure_point(const Linear_Expression& e,
-              Coefficient_traits::const_reference d,
-              Representation r) {
-  return Generator::closure_point(e, d, r);
-}
-
-/*! \relates Generator */
-inline Generator
-closure_point(Representation r) {
-  return Generator::closure_point(r);
-}
-
-/*! \relates Generator */
-inline Generator
-closure_point(const Linear_Expression& e,
-              Representation r) {
-  return Generator::closure_point(e, r);
-}
-
-/*! \relates Generator */
-inline bool
-operator==(const Generator& x, const Generator& y) {
-  return x.is_equivalent_to(y);
-}
-
-/*! \relates Generator */
-inline bool
-operator!=(const Generator& x, const Generator& y) {
-  return !x.is_equivalent_to(y);
-}
-
-inline void
-Generator::ascii_dump(std::ostream& s) const {
-
-  expr.ascii_dump(s);
-
-  s << " ";
-  
-  switch (type()) {
-  case Generator::LINE:
-    s << "L ";
-    break;
-  case Generator::RAY:
-    s << "R ";
-    break;
-  case Generator::POINT:
-    s << "P ";
-    break;
-  case Generator::CLOSURE_POINT:
-    s << "C ";
-    break;
-  }
-  if (is_necessarily_closed())
-    s << "(C)";
-  else
-    s << "(NNC)";
-  s << "\n";
-}
-
-inline bool
-Generator::ascii_load(std::istream& s) {
-  std::string str;
-
-  expr.ascii_load(s);
-
-  if (!(s >> str))
-    return false;
-  if (str == "L")
-    set_is_line();
-  else if (str == "R" || str == "P" || str == "C")
-    set_is_ray_or_point();
-  else
-    return false;
-
-  std::string str2;
-
-  if (!(s >> str2))
-    return false;
-  if (str2 == "(C)") {
-    if (is_not_necessarily_closed())
-      // TODO: Avoid using the mark_as_*() methods if possible.
-      mark_as_necessarily_closed();
-  }
-  else {
-    if (str2 == "(NNC)") {
-      if (is_necessarily_closed())
-        // TODO: Avoid using the mark_as_*() methods if possible.
-        mark_as_not_necessarily_closed();
-    }
-    else
-      return false;
-  }
-
-  // Checking for equality of actual and declared types.
-  switch (type()) {
-  case Generator::LINE:
-    if (str != "L")
-      return false;
-    break;
-  case Generator::RAY:
-    if (str != "R")
-      return false;
-    break;
-  case Generator::POINT:
-    if (str != "P")
-      return false;
-    break;
-  case Generator::CLOSURE_POINT:
-    if (str != "C")
-      return false;
-    break;
-  }
-
-  return true;
-}
-
-inline void
-Generator::m_swap(Generator& y) {
-  using std::swap;
-  swap(expr, y.expr);
-  swap(kind_, y.kind_);
-  swap(topology_, y.topology_);
-  wrapped_expr.set_hide_last(is_not_necessarily_closed());
-  y.wrapped_expr.set_hide_last(y.is_not_necessarily_closed());
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Generator */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Specialization, typename Temp, typename To>
-inline bool
-l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const Generator& x,
-		    const Generator& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0,
-		    Temp& tmp1,
-		    Temp& tmp2) {
-  // Generator kind compatibility check: we only compute distances
-  // between (closure) points.
-  if (x.is_line_or_ray() || y.is_line_or_ray())
-    return false;
-  const dimension_type x_space_dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (x_space_dim != y.space_dimension())
-    return false;
-
-  // All zero-dim generators have distance zero.
-  if (x_space_dim == 0) {
-    assign_r(r, 0, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  PPL_DIRTY_TEMP(mpq_class, x_coord);
-  PPL_DIRTY_TEMP(mpq_class, y_coord);
-  PPL_DIRTY_TEMP(mpq_class, x_div);
-  PPL_DIRTY_TEMP(mpq_class, y_div);
-  assign_r(x_div, x.divisor(), ROUND_NOT_NEEDED);
-  assign_r(y_div, y.divisor(), ROUND_NOT_NEEDED);
-
-  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
-  // TODO: This loop can be optimized more, if needed.
-  for (dimension_type i = x_space_dim; i-- > 0; ) {
-    assign_r(x_coord, x.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-    div_assign_r(x_coord, x_coord, x_div, ROUND_NOT_NEEDED);
-    assign_r(y_coord, y.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-    div_assign_r(y_coord, y_coord, y_div, ROUND_NOT_NEEDED);
-    const Temp* tmp1p;
-    const Temp* tmp2p;
-
-    if (x_coord > y_coord) {
-      maybe_assign(tmp1p, tmp1, x_coord, dir);
-      maybe_assign(tmp2p, tmp2, y_coord, inverse(dir));
-    }
-    else {
-      maybe_assign(tmp1p, tmp1, y_coord, dir);
-      maybe_assign(tmp2p, tmp2, x_coord, inverse(dir));
-    }
-    sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
-    PPL_ASSERT(sgn(tmp1) >= 0);
-    Specialization::combine(tmp0, tmp1, dir);
-  }
-  Specialization::finalize(tmp0, dir);
-  assign_r(r, tmp0, dir);
-  return true;
-}
-
-/*! \relates Generator */
-template <typename Temp, typename To>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Generator& x,
-			    const Generator& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
-  return l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >
-    (r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Generator */
-template <typename Temp, typename To>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Generator& x,
-			    const Generator& y,
-			    const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Generator */
-template <typename To>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Generator& x,
-			    const Generator& y,
-			    const Rounding_Dir dir) {
-  return rectilinear_distance_assign<To, To>(r, x, y, dir);
-}
-
-/*! \relates Generator */
-template <typename Temp, typename To>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Generator& x,
-			  const Generator& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
-  return l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >
-    (r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Generator */
-template <typename Temp, typename To>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Generator& x,
-			  const Generator& y,
-			  const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Generator */
-template <typename To>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Generator& x,
-			  const Generator& y,
-			  const Rounding_Dir dir) {
-  return euclidean_distance_assign<To, To>(r, x, y, dir);
-}
-
-/*! \relates Generator */
-template <typename Temp, typename To>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Generator& x,
-			   const Generator& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
-  return l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >
-    (r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Generator */
-template <typename Temp, typename To>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Generator& x,
-			   const Generator& y,
-			   const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Generator */
-template <typename To>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Generator& x,
-			   const Generator& y,
-			   const Rounding_Dir dir) {
-  return l_infinity_distance_assign<To, To>(r, x, y, dir);
-}
-
-/*! \relates Generator */
-inline void
-swap(Generator& x, Generator& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Generator_inlines_hh)
diff --git a/src/Generator.types.hh b/src/Generator.types.hh
deleted file mode 100644
index 880876f..0000000
--- a/src/Generator.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Generator_types_hh
-#define PPL_Generator_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Generator;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Generator_types_hh)
diff --git a/src/Generator_System.cc b/src/Generator_System.cc
index 5efd8ce..b203497 100644
--- a/src/Generator_System.cc
+++ b/src/Generator_System.cc
@@ -1,6 +1,6 @@
 /* Generator_System class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,11 +22,11 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Generator_System.defs.hh"
-#include "Generator_System.inlines.hh"
-#include "Constraint.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
+#include "Generator_System_defs.hh"
+#include "Generator_System_inlines.hh"
+#include "Constraint_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
 #include "assert.hh"
 #include <string>
 #include <vector>
@@ -38,7 +38,7 @@ namespace PPL = Parma_Polyhedra_Library;
 bool
 PPL::Generator_System::
 adjust_topology_and_space_dimension(const Topology new_topology,
-				    const dimension_type new_space_dim) {
+                                    const dimension_type new_space_dim) {
   PPL_ASSERT(space_dimension() <= new_space_dim);
 
   if (sys.topology() != new_topology) {
@@ -53,14 +53,15 @@ adjust_topology_and_space_dimension(const Topology new_topology,
       // closure points that were matching a point (i.e., those
       // that are in the generator system, but are invisible to
       // the user).
-      Generator_System& gs = *this;
+      const Generator_System& gs = *this;
       for (dimension_type i = 0; i < sys.num_rows(); )
         if (gs[i].is_closure_point())
           sys.remove_row(i, false);
         else
           ++i;
       sys.set_necessarily_closed();
-    } else {
+    }
+    else {
       convert_into_non_necessarily_closed();
     }
   }
@@ -128,7 +129,7 @@ PPL::Generator_System::has_closure_points() const {
     return false;
   // Adopt the point of view of the user.
   for (Generator_System::const_iterator i = begin(),
-	 this_end = end(); i != this_end; ++i)
+         this_end = end(); i != this_end; ++i)
     if (i->is_closure_point())
       return true;
   return false;
@@ -160,7 +161,7 @@ PPL::Generator_System::has_points() const {
   if (sys.is_necessarily_closed())
     for (dimension_type i = sys.num_rows(); i-- > 0; ) {
       if (!gs[i].is_line_or_ray())
-	return true;
+        return true;
     }
   else {
     // !is_necessarily_closed()
@@ -181,9 +182,9 @@ PPL::Generator_System_const_iterator::skip_forward() {
       const Generator& cp = *i;
       const Generator& p = *i_next;
       if (cp.is_closure_point()
-	  && p.is_point()
-	  && cp.is_matching_closure_point(p))
-	i = i_next;
+          && p.is_point()
+          && cp.is_matching_closure_point(p))
+        i = i_next;
     }
   }
 }
@@ -226,7 +227,7 @@ PPL::Generator_System::insert(Generator& g, Recycle_Input) {
       // (i.e., set the coefficient equal to the divisor).
       // Note: normalization is preserved.
       if (!g.is_line_or_ray())
-	g.set_epsilon_coefficient(g.expr.inhomogeneous_term());
+        g.set_epsilon_coefficient(g.expr.inhomogeneous_term());
       // Inserting the new generator.
       sys.insert(g, Recycle_Input());
     }
@@ -257,7 +258,7 @@ PPL::Generator_System::insert_pending(Generator& g, Recycle_Input) {
       // (i.e., set the coefficient equal to the divisor).
       // Note: normalization is preserved.
       if (!g.is_line_or_ray())
-	g.set_epsilon_coefficient(g.expr.inhomogeneous_term());
+        g.set_epsilon_coefficient(g.expr.inhomogeneous_term());
       // Inserting the new generator.
       sys.insert_pending(g, Recycle_Input());
     }
@@ -274,14 +275,14 @@ PPL::Generator_System::num_lines() const {
   // If sys happens to be sorted, take advantage of the fact
   // that lines are at the top of the system.
   if (sys.is_sorted()) {
-    dimension_type nrows = sys.num_rows();
+    const dimension_type nrows = sys.num_rows();
     for (dimension_type i = 0; i < nrows && gs[i].is_line(); ++i)
       ++n;
   }
   else
     for (dimension_type i = sys.num_rows(); i-- > 0 ; )
       if (gs[i].is_line())
-	++n;
+        ++n;
   return n;
 }
 
@@ -298,12 +299,12 @@ PPL::Generator_System::num_rays() const {
   if (sys.is_sorted()) {
     for (dimension_type i = sys.num_rows(); i != 0 && gs[--i].is_ray_or_point(); )
       if (gs[i].is_line_or_ray())
-	++n;
+        ++n;
   }
   else
     for (dimension_type i = sys.num_rows(); i-- > 0 ; )
       if (gs[i].is_ray())
-	++n;
+        ++n;
   return n;
 }
 
@@ -337,62 +338,62 @@ PPL::Generator_System::relation_with(const Constraint& c) const {
       int first_point_or_nonsaturating_ray_sign = 2;
 
       for (dimension_type i = n_rows; i-- > 0; ) {
-	const Generator& g = gs[i];
-	const int sp_sign = Scalar_Products::sign(c, g);
-	// Checking whether the generator saturates the equality.
-	// If that is the case, then we have to do something only if
-	// the generator is a point.
-	if (sp_sign == 0) {
-	  if (g.is_point()) {
-	    if (first_point_or_nonsaturating_ray_sign == 2)
-	      // It is the first time that we find a point and
-	      // we have not found a non-saturating ray yet.
-	      first_point_or_nonsaturating_ray_sign = 0;
-	    else
-	      // We already found a point or a non-saturating ray.
-	      if (first_point_or_nonsaturating_ray_sign != 0)
-		return Poly_Con_Relation::strictly_intersects();
-	  }
-	}
-	else
-	  // Here we know that sp_sign != 0.
-	  switch (g.type()) {
-
-	  case Generator::LINE:
-	    // If a line does not saturate `c', then there is a strict
-	    // intersection between the points satisfying `c'
-	    // and the points generated by `gs'.
-	    return Poly_Con_Relation::strictly_intersects();
-
-	  case Generator::RAY:
-	    if (first_point_or_nonsaturating_ray_sign == 2) {
-	      // It is the first time that we have a non-saturating ray
-	      // and we have not found any point yet.
-	      first_point_or_nonsaturating_ray_sign = sp_sign;
-	      result = Poly_Con_Relation::is_disjoint();
-	    }
-	    else
-	      // We already found a point or a non-saturating ray.
-	      if (sp_sign != first_point_or_nonsaturating_ray_sign)
-		return Poly_Con_Relation::strictly_intersects();
-	    break;
-
-	  case Generator::POINT:
-	  case Generator::CLOSURE_POINT:
-	    // NOTE: a non-saturating closure point is treated as
-	    // a normal point.
-	    if (first_point_or_nonsaturating_ray_sign == 2) {
-	      // It is the first time that we find a point and
-	      // we have not found a non-saturating ray yet.
-	      first_point_or_nonsaturating_ray_sign = sp_sign;
-	      result = Poly_Con_Relation::is_disjoint();
-	    }
-	    else
-	      // We already found a point or a non-saturating ray.
-	      if (sp_sign != first_point_or_nonsaturating_ray_sign)
-		return Poly_Con_Relation::strictly_intersects();
-	    break;
-	  }
+        const Generator& g = gs[i];
+        const int sp_sign = Scalar_Products::sign(c, g);
+        // Checking whether the generator saturates the equality.
+        // If that is the case, then we have to do something only if
+        // the generator is a point.
+        if (sp_sign == 0) {
+          if (g.is_point()) {
+            if (first_point_or_nonsaturating_ray_sign == 2)
+              // It is the first time that we find a point and
+              // we have not found a non-saturating ray yet.
+              first_point_or_nonsaturating_ray_sign = 0;
+            else
+              // We already found a point or a non-saturating ray.
+              if (first_point_or_nonsaturating_ray_sign != 0)
+                return Poly_Con_Relation::strictly_intersects();
+          }
+        }
+        else
+          // Here we know that sp_sign != 0.
+          switch (g.type()) {
+
+          case Generator::LINE:
+            // If a line does not saturate `c', then there is a strict
+            // intersection between the points satisfying `c'
+            // and the points generated by `gs'.
+            return Poly_Con_Relation::strictly_intersects();
+
+          case Generator::RAY:
+            if (first_point_or_nonsaturating_ray_sign == 2) {
+              // It is the first time that we have a non-saturating ray
+              // and we have not found any point yet.
+              first_point_or_nonsaturating_ray_sign = sp_sign;
+              result = Poly_Con_Relation::is_disjoint();
+            }
+            else
+              // We already found a point or a non-saturating ray.
+              if (sp_sign != first_point_or_nonsaturating_ray_sign)
+                return Poly_Con_Relation::strictly_intersects();
+            break;
+
+          case Generator::POINT:
+          case Generator::CLOSURE_POINT:
+            // NOTE: a non-saturating closure point is treated as
+            // a normal point.
+            if (first_point_or_nonsaturating_ray_sign == 2) {
+              // It is the first time that we find a point and
+              // we have not found a non-saturating ray yet.
+              first_point_or_nonsaturating_ray_sign = sp_sign;
+              result = Poly_Con_Relation::is_disjoint();
+            }
+            else
+              // We already found a point or a non-saturating ray.
+              if (sp_sign != first_point_or_nonsaturating_ray_sign)
+                return Poly_Con_Relation::strictly_intersects();
+            break;
+          }
       }
     }
     break;
@@ -408,103 +409,103 @@ PPL::Generator_System::relation_with(const Constraint& c) const {
       bool first_point_or_nonsaturating_ray = true;
 
       for (dimension_type i = n_rows; i-- > 0; ) {
-	const Generator& g = gs[i];
-	const int sp_sign = Scalar_Products::sign(c, g);
-	// Checking whether the generator saturates the non-strict
-	// inequality. If that is the case, then we have to do something
-	// only if the generator is a point.
-	if (sp_sign == 0) {
-	  if (g.is_point()) {
-	    if (first_point_or_nonsaturating_ray)
-	      // It is the first time that we have a point and
-	      // we have not found a non-saturating ray yet.
-	      first_point_or_nonsaturating_ray = false;
-	    else
-	      // We already found a point or a non-saturating ray before.
-	      if (result == Poly_Con_Relation::is_disjoint())
-		// Since g saturates c, we have a strict intersection if
-		// none of the generators seen so far are included in `c'.
-		return Poly_Con_Relation::strictly_intersects();
-	  }
-	}
-	else
-	  // Here we know that sp_sign != 0.
-	  switch (g.type()) {
-
-	  case Generator::LINE:
-	    // If a line does not saturate `c', then there is a strict
-	    // intersection between the points satisfying `c' and
-	    // the points generated by `gs'.
-	    return Poly_Con_Relation::strictly_intersects();
-
-	  case Generator::RAY:
-	    if (first_point_or_nonsaturating_ray) {
-	      // It is the first time that we have a non-saturating ray
-	      // and we have not found any point yet.
-	      first_point_or_nonsaturating_ray = false;
-	      result = (sp_sign > 0)
-		? Poly_Con_Relation::is_included()
-		: Poly_Con_Relation::is_disjoint();
-	    }
-	    else {
-	      // We already found a point or a non-saturating ray.
-	      if ((sp_sign > 0
-		   && result == Poly_Con_Relation::is_disjoint())
-		  || (sp_sign < 0
-		      && result.implies(Poly_Con_Relation::is_included())))
-		// We have a strict intersection if either:
-		// - `g' satisfies `c' but none of the generators seen
-		//    so far are included in `c'; or
-		// - `g' does not satisfy `c' and all the generators
-		//    seen so far are included in `c'.
-		return Poly_Con_Relation::strictly_intersects();
-	      if (sp_sign > 0)
-		// Here all the generators seen so far either saturate
-		// or are included in `c'.
-		// Since `g' does not saturate `c' ...
-		result = Poly_Con_Relation::is_included();
-	    }
-	    break;
-
-	  case Generator::POINT:
-	  case Generator::CLOSURE_POINT:
-	    // NOTE: a non-saturating closure point is treated as
-	    // a normal point.
-	    if (first_point_or_nonsaturating_ray) {
-	      // It is the first time that we have a point and
-	      // we have not found a non-saturating ray yet.
-	      // - If point `g' saturates `c', then all the generators
-	      //   seen so far saturate `c'.
-	      // - If point `g' is included (but does not saturate) `c',
-	      //   then all the generators seen so far are included in `c'.
-	      // - If point `g' does not satisfy `c', then all the
-	      //   generators seen so far are disjoint from `c'.
-	      first_point_or_nonsaturating_ray = false;
-	      if (sp_sign > 0)
-		result = Poly_Con_Relation::is_included();
-	      else if (sp_sign < 0)
-		result = Poly_Con_Relation::is_disjoint();
-	    }
-	    else {
-	      // We already found a point or a non-saturating ray before.
-	      if ((sp_sign > 0
-		   && result == Poly_Con_Relation::is_disjoint())
-		  || (sp_sign < 0
-		      && result.implies(Poly_Con_Relation::is_included())))
-		// We have a strict intersection if either:
-		// - `g' satisfies or saturates `c' but none of the
-		//    generators seen so far are included in `c'; or
-		// - `g' does not satisfy `c' and all the generators
-		//    seen so far are included in `c'.
-		return Poly_Con_Relation::strictly_intersects();
-	      if (sp_sign > 0)
-		// Here all the generators seen so far either saturate
-		// or are included in `c'.
-		// Since `g' does not saturate `c' ...
-		result = Poly_Con_Relation::is_included();
-	    }
-	    break;
-	  }
+        const Generator& g = gs[i];
+        const int sp_sign = Scalar_Products::sign(c, g);
+        // Checking whether the generator saturates the non-strict
+        // inequality. If that is the case, then we have to do something
+        // only if the generator is a point.
+        if (sp_sign == 0) {
+          if (g.is_point()) {
+            if (first_point_or_nonsaturating_ray)
+              // It is the first time that we have a point and
+              // we have not found a non-saturating ray yet.
+              first_point_or_nonsaturating_ray = false;
+            else
+              // We already found a point or a non-saturating ray before.
+              if (result == Poly_Con_Relation::is_disjoint())
+                // Since g saturates c, we have a strict intersection if
+                // none of the generators seen so far are included in `c'.
+                return Poly_Con_Relation::strictly_intersects();
+          }
+        }
+        else
+          // Here we know that sp_sign != 0.
+          switch (g.type()) {
+
+          case Generator::LINE:
+            // If a line does not saturate `c', then there is a strict
+            // intersection between the points satisfying `c' and
+            // the points generated by `gs'.
+            return Poly_Con_Relation::strictly_intersects();
+
+          case Generator::RAY:
+            if (first_point_or_nonsaturating_ray) {
+              // It is the first time that we have a non-saturating ray
+              // and we have not found any point yet.
+              first_point_or_nonsaturating_ray = false;
+              result = (sp_sign > 0)
+                ? Poly_Con_Relation::is_included()
+                : Poly_Con_Relation::is_disjoint();
+            }
+            else {
+              // We already found a point or a non-saturating ray.
+              if ((sp_sign > 0
+                   && result == Poly_Con_Relation::is_disjoint())
+                  || (sp_sign < 0
+                      && result.implies(Poly_Con_Relation::is_included())))
+                // We have a strict intersection if either:
+                // - `g' satisfies `c' but none of the generators seen
+                //    so far are included in `c'; or
+                // - `g' does not satisfy `c' and all the generators
+                //    seen so far are included in `c'.
+                return Poly_Con_Relation::strictly_intersects();
+              if (sp_sign > 0)
+                // Here all the generators seen so far either saturate
+                // or are included in `c'.
+                // Since `g' does not saturate `c' ...
+                result = Poly_Con_Relation::is_included();
+            }
+            break;
+
+          case Generator::POINT:
+          case Generator::CLOSURE_POINT:
+            // NOTE: a non-saturating closure point is treated as
+            // a normal point.
+            if (first_point_or_nonsaturating_ray) {
+              // It is the first time that we have a point and
+              // we have not found a non-saturating ray yet.
+              // - If point `g' saturates `c', then all the generators
+              //   seen so far saturate `c'.
+              // - If point `g' is included (but does not saturate) `c',
+              //   then all the generators seen so far are included in `c'.
+              // - If point `g' does not satisfy `c', then all the
+              //   generators seen so far are disjoint from `c'.
+              first_point_or_nonsaturating_ray = false;
+              if (sp_sign > 0)
+                result = Poly_Con_Relation::is_included();
+              else if (sp_sign < 0)
+                result = Poly_Con_Relation::is_disjoint();
+            }
+            else {
+              // We already found a point or a non-saturating ray before.
+              if ((sp_sign > 0
+                   && result == Poly_Con_Relation::is_disjoint())
+                  || (sp_sign < 0
+                      && result.implies(Poly_Con_Relation::is_included())))
+                // We have a strict intersection if either:
+                // - `g' satisfies or saturates `c' but none of the
+                //    generators seen so far are included in `c'; or
+                // - `g' does not satisfy `c' and all the generators
+                //    seen so far are included in `c'.
+                return Poly_Con_Relation::strictly_intersects();
+              if (sp_sign > 0)
+                // Here all the generators seen so far either saturate
+                // or are included in `c'.
+                // Since `g' does not saturate `c' ...
+                result = Poly_Con_Relation::is_included();
+            }
+            break;
+          }
       }
     }
     break;
@@ -519,93 +520,93 @@ PPL::Generator_System::relation_with(const Constraint& c) const {
       // non-saturating ray.
       bool first_point_or_nonsaturating_ray = true;
       for (dimension_type i = n_rows; i-- > 0; ) {
-	const Generator& g = gs[i];
-	// Using the reduced scalar product operator to avoid
-	// both topology and space dimension mismatches.
-	const int sp_sign = Scalar_Products::reduced_sign(c, g);
-	// Checking whether the generator saturates the strict inequality.
-	// If that is the case, then we have to do something
-	// only if the generator is a point.
-	if (sp_sign == 0) {
-	  if (g.is_point()) {
-	    if (first_point_or_nonsaturating_ray)
-	      // It is the first time that we have a point and
-	      // we have not found a non-saturating ray yet.
-	      first_point_or_nonsaturating_ray = false;
-	    else
-	      // We already found a point or a non-saturating ray before.
-	      if (result == Poly_Con_Relation::is_included())
-		return Poly_Con_Relation::strictly_intersects();
-	  }
-	}
-	else
-	  // Here we know that sp_sign != 0.
-	  switch (g.type()) {
-
-	  case Generator::LINE:
-	    // If a line does not saturate `c', then there is a strict
-	    // intersection between the points satisfying `c' and the points
-	    // generated by `gs'.
-	    return Poly_Con_Relation::strictly_intersects();
-
-	  case Generator::RAY:
-	    if (first_point_or_nonsaturating_ray) {
-	      // It is the first time that we have a non-saturating ray
-	      // and we have not found any point yet.
-	      first_point_or_nonsaturating_ray = false;
-	      result = (sp_sign > 0)
-		? Poly_Con_Relation::is_included()
-		: Poly_Con_Relation::is_disjoint();
-	    }
-	    else {
-	      // We already found a point or a non-saturating ray before.
-	      if ((sp_sign > 0
-		   && result.implies(Poly_Con_Relation::is_disjoint()))
-		  ||
-		  (sp_sign <= 0
-		   && result == Poly_Con_Relation::is_included()))
-		return Poly_Con_Relation::strictly_intersects();
-	      if (sp_sign < 0)
-		// Here all the generators seen so far either saturate
-		// or are disjoint from `c'.
-		// Since `g' does not saturate `c' ...
-		result = Poly_Con_Relation::is_disjoint();
-	    }
-	    break;
-
-	  case Generator::POINT:
-	  case Generator::CLOSURE_POINT:
-	    if (first_point_or_nonsaturating_ray) {
-	      // It is the first time that we have a point and
-	      // we have not found a non-saturating ray yet.
-	      // - If point `g' saturates `c', then all the generators
-	      //   seen so far saturate `c'.
-	      // - If point `g' is included in (but does not saturate) `c',
-	      //   then all the generators seen so far are included in `c'.
-	      // - If point `g' strictly violates `c', then all the
-	      //   generators seen so far are disjoint from `c'.
-	      first_point_or_nonsaturating_ray = false;
-	      if (sp_sign > 0)
-		result = Poly_Con_Relation::is_included();
-	      else if (sp_sign < 0)
-		result = Poly_Con_Relation::is_disjoint();
-	    }
-	    else {
-	      // We already found a point or a non-saturating ray before.
-	      if ((sp_sign > 0
-		   && result.implies(Poly_Con_Relation::is_disjoint()))
-		  ||
-		  (sp_sign <= 0
-		   && result == Poly_Con_Relation::is_included()))
-		return Poly_Con_Relation::strictly_intersects();
-	      if (sp_sign < 0)
-		// Here all the generators seen so far either saturate
-		// or are disjoint from `c'.
-		// Since `g' does not saturate `c' ...
-		result = Poly_Con_Relation::is_disjoint();
-	    }
-	    break;
-	  }
+        const Generator& g = gs[i];
+        // Using the reduced scalar product operator to avoid
+        // both topology and space dimension mismatches.
+        const int sp_sign = Scalar_Products::reduced_sign(c, g);
+        // Checking whether the generator saturates the strict inequality.
+        // If that is the case, then we have to do something
+        // only if the generator is a point.
+        if (sp_sign == 0) {
+          if (g.is_point()) {
+            if (first_point_or_nonsaturating_ray)
+              // It is the first time that we have a point and
+              // we have not found a non-saturating ray yet.
+              first_point_or_nonsaturating_ray = false;
+            else
+              // We already found a point or a non-saturating ray before.
+              if (result == Poly_Con_Relation::is_included())
+                return Poly_Con_Relation::strictly_intersects();
+          }
+        }
+        else
+          // Here we know that sp_sign != 0.
+          switch (g.type()) {
+
+          case Generator::LINE:
+            // If a line does not saturate `c', then there is a strict
+            // intersection between the points satisfying `c' and the points
+            // generated by `gs'.
+            return Poly_Con_Relation::strictly_intersects();
+
+          case Generator::RAY:
+            if (first_point_or_nonsaturating_ray) {
+              // It is the first time that we have a non-saturating ray
+              // and we have not found any point yet.
+              first_point_or_nonsaturating_ray = false;
+              result = (sp_sign > 0)
+                ? Poly_Con_Relation::is_included()
+                : Poly_Con_Relation::is_disjoint();
+            }
+            else {
+              // We already found a point or a non-saturating ray before.
+              if ((sp_sign > 0
+                   && result.implies(Poly_Con_Relation::is_disjoint()))
+                  ||
+                  (sp_sign <= 0
+                   && result == Poly_Con_Relation::is_included()))
+                return Poly_Con_Relation::strictly_intersects();
+              if (sp_sign < 0)
+                // Here all the generators seen so far either saturate
+                // or are disjoint from `c'.
+                // Since `g' does not saturate `c' ...
+                result = Poly_Con_Relation::is_disjoint();
+            }
+            break;
+
+          case Generator::POINT:
+          case Generator::CLOSURE_POINT:
+            if (first_point_or_nonsaturating_ray) {
+              // It is the first time that we have a point and
+              // we have not found a non-saturating ray yet.
+              // - If point `g' saturates `c', then all the generators
+              //   seen so far saturate `c'.
+              // - If point `g' is included in (but does not saturate) `c',
+              //   then all the generators seen so far are included in `c'.
+              // - If point `g' strictly violates `c', then all the
+              //   generators seen so far are disjoint from `c'.
+              first_point_or_nonsaturating_ray = false;
+              if (sp_sign > 0)
+                result = Poly_Con_Relation::is_included();
+              else if (sp_sign < 0)
+                result = Poly_Con_Relation::is_disjoint();
+            }
+            else {
+              // We already found a point or a non-saturating ray before.
+              if ((sp_sign > 0
+                   && result.implies(Poly_Con_Relation::is_disjoint()))
+                  ||
+                  (sp_sign <= 0
+                   && result == Poly_Con_Relation::is_included()))
+                return Poly_Con_Relation::strictly_intersects();
+              if (sp_sign < 0)
+                // Here all the generators seen so far either saturate
+                // or are disjoint from `c'.
+                // Since `g' does not saturate `c' ...
+                result = Poly_Con_Relation::is_disjoint();
+            }
+            break;
+          }
       }
     }
     break;
@@ -622,7 +623,7 @@ PPL::Generator_System::satisfied_by_all_generators(const Constraint& c) const {
   // Setting `sps' to the appropriate scalar product sign operator.
   // This also avoids problems when having _legal_ topology mismatches
   // (which could also cause a mismatch in the number of space dimensions).
-  Topology_Adjusted_Scalar_Product_Sign sps(c);
+  const Topology_Adjusted_Scalar_Product_Sign sps(c);
 
   const Generator_System& gs = *this;
   switch (c.type()) {
@@ -630,7 +631,7 @@ PPL::Generator_System::satisfied_by_all_generators(const Constraint& c) const {
     // Equalities must be saturated by all generators.
     for (dimension_type i = gs.sys.num_rows(); i-- > 0; )
       if (sps(c, gs[i]) != 0)
-	return false;
+        return false;
     break;
   case Constraint::NONSTRICT_INEQUALITY:
     // Non-strict inequalities must be saturated by lines and
@@ -639,13 +640,13 @@ PPL::Generator_System::satisfied_by_all_generators(const Constraint& c) const {
       const Generator& g = gs[i];
       const int sp_sign = sps(c, g);
       if (g.is_line()) {
-	if (sp_sign != 0)
-	  return false;
+        if (sp_sign != 0)
+          return false;
       }
       else
-	// `g' is a ray, point or closure point.
-	if (sp_sign < 0)
-	  return false;
+        // `g' is a ray, point or closure point.
+        if (sp_sign < 0)
+          return false;
     }
     break;
   case Constraint::STRICT_INEQUALITY:
@@ -656,18 +657,18 @@ PPL::Generator_System::satisfied_by_all_generators(const Constraint& c) const {
       const int sp_sign = sps(c, g);
       switch (g.type()) {
       case Generator::POINT:
-	if (sp_sign <= 0)
-	  return false;
-	break;
+        if (sp_sign <= 0)
+          return false;
+        break;
       case Generator::LINE:
-	if (sp_sign != 0)
-	  return false;
-	break;
+        if (sp_sign != 0)
+          return false;
+        break;
       default:
-	// `g' is a ray or closure point.
-	if (sp_sign < 0)
-	  return false;
-	break;
+        // `g' is a ray or closure point.
+        if (sp_sign < 0)
+          return false;
+        break;
       }
     }
     break;
@@ -680,8 +681,8 @@ PPL::Generator_System::satisfied_by_all_generators(const Constraint& c) const {
 void
 PPL::Generator_System
 ::affine_image(Variable v,
-	       const Linear_Expression& expr,
-	       Coefficient_traits::const_reference denominator) {
+               const Linear_Expression& expr,
+               Coefficient_traits::const_reference denominator) {
   Generator_System& x = *this;
   PPL_ASSERT(v.space_dimension() <= x.space_dimension());
   PPL_ASSERT(expr.space_dimension() <= x.space_dimension());
@@ -759,7 +760,8 @@ PPL::Generator_System::remove_invalid_lines_and_rays() {
     if (g.is_line_or_ray() && g.expr.all_homogeneous_terms_are_zero()) {
       sys.remove_row(i, false);
       set_sorted(false);
-    } else
+    }
+    else
       ++i;
   }
 }
diff --git a/src/Generator_System.defs.hh b/src/Generator_System.defs.hh
deleted file mode 100644
index b534e61..0000000
--- a/src/Generator_System.defs.hh
+++ /dev/null
@@ -1,744 +0,0 @@
-/* Generator_System class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Generator_System_defs_hh
-#define PPL_Generator_System_defs_hh 1
-
-#include "Generator_System.types.hh"
-
-#include "Linear_Expression.types.hh"
-#include "Linear_System.defs.hh"
-#include "Generator.defs.hh"
-#include "Constraint.types.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Polyhedron.types.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Generator_System
-  Writes <CODE>false</CODE> if \p gs is empty.  Otherwise, writes on
-  \p s the generators of \p gs, all in one row and separated by ", ".
-*/
-std::ostream& operator<<(std::ostream& s, const Generator_System& gs);
-
-} // namespace IO_Operators
-
-// TODO: Consider removing this.
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates Generator_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator==(const Generator_System& x, const Generator_System& y);
-
-// TODO: Consider removing this.
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Generator_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator!=(const Generator_System& x, const Generator_System& y);
-
-/*! \relates Generator_System */
-void
-swap(Generator_System& x, Generator_System& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A system of generators.
-/*! \ingroup PPL_CXX_interface
-    An object of the class Generator_System is a system of generators,
-    i.e., a multiset of objects of the class Generator
-    (lines, rays, points and closure points).
-    When inserting generators in a system, space dimensions are automatically
-    adjusted so that all the generators in the system are defined
-    on the same vector space.
-    A system of generators which is meant to define a non-empty
-    polyhedron must include at least one point: the reason is that
-    lines, rays and closure points need a supporting point
-    (lines and rays only specify directions while closure points only
-    specify points in the topological closure of the NNC polyhedron).
-
-    \par
-     In all the examples it is assumed that variables
-    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
-    \code
-  Variable x(0);
-  Variable y(1);
-    \endcode
-
-    \par Example 1
-    The following code defines the line having the same direction
-    as the \f$x\f$ axis (i.e., the first Cartesian axis)
-    in \f$\Rset^2\f$:
-    \code
-  Generator_System gs;
-  gs.insert(line(x + 0*y));
-    \endcode
-    As said above, this system of generators corresponds to
-    an empty polyhedron, because the line has no supporting point.
-    To define a system of generators that does correspond to
-    the \f$x\f$ axis, we can add the following code which
-    inserts the origin of the space as a point:
-    \code
-  gs.insert(point(0*x + 0*y));
-    \endcode
-    Since space dimensions are automatically adjusted, the following
-    code obtains the same effect:
-    \code
-  gs.insert(point(0*x));
-    \endcode
-    In contrast, if we had added the following code, we would have
-    defined a line parallel to the \f$x\f$ axis through
-    the point \f$(0, 1)^\transpose \in \Rset^2\f$.
-    \code
-  gs.insert(point(0*x + 1*y));
-    \endcode
-
-    \par Example 2
-    The following code builds a ray having the same direction as
-    the positive part of the \f$x\f$ axis in \f$\Rset^2\f$:
-    \code
-  Generator_System gs;
-  gs.insert(ray(x + 0*y));
-    \endcode
-    To define a system of generators indeed corresponding to the set
-    \f[
-      \bigl\{\,
-        (x, 0)^\transpose \in \Rset^2
-      \bigm|
-        x \geq 0
-      \,\bigr\},
-    \f]
-    one just has to add the origin:
-    \code
-  gs.insert(point(0*x + 0*y));
-    \endcode
-
-    \par Example 3
-    The following code builds a system of generators having four points
-    and corresponding to a square in \f$\Rset^2\f$
-    (the same as Example 1 for the system of constraints):
-    \code
-  Generator_System gs;
-  gs.insert(point(0*x + 0*y));
-  gs.insert(point(0*x + 3*y));
-  gs.insert(point(3*x + 0*y));
-  gs.insert(point(3*x + 3*y));
-    \endcode
-
-    \par Example 4
-    By using closure points, we can define the \e kernel
-    (i.e., the largest open set included in a given set)
-    of the square defined in the previous example.
-    Note that a supporting point is needed and, for that purpose,
-    any inner point could be considered.
-    \code
-  Generator_System gs;
-  gs.insert(point(x + y));
-  gs.insert(closure_point(0*x + 0*y));
-  gs.insert(closure_point(0*x + 3*y));
-  gs.insert(closure_point(3*x + 0*y));
-  gs.insert(closure_point(3*x + 3*y));
-    \endcode
-
-    \par Example 5
-    The following code builds a system of generators having two points
-    and a ray, corresponding to a half-strip in \f$\Rset^2\f$
-    (the same as Example 2 for the system of constraints):
-    \code
-  Generator_System gs;
-  gs.insert(point(0*x + 0*y));
-  gs.insert(point(0*x + 1*y));
-  gs.insert(ray(x - y));
-    \endcode
-
-    \note
-    After inserting a multiset of generators in a generator system,
-    there are no guarantees that an <EM>exact</EM> copy of them
-    can be retrieved:
-    in general, only an <EM>equivalent</EM> generator system
-    will be available, where original generators may have been
-    reordered, removed (if they are duplicate or redundant), etc.
-*/
-class Parma_Polyhedra_Library::Generator_System {
-public:
-  typedef Generator row_type;
-
-  static const Representation default_representation = SPARSE;
-
-  //! Default constructor: builds an empty system of generators.
-  Generator_System(Representation r = default_representation);
-
-  //! Builds the singleton system containing only generator \p g.
-  explicit Generator_System(const Generator& g,
-                            Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  //! The new Generator_System will have the same representation as `gs'.
-  Generator_System(const Generator_System& gs);
-
-  //! Copy constructor with specified representation.
-  Generator_System(const Generator_System& gs, Representation r);
-
-  //! Destructor.
-  ~Generator_System();
-
-  //! Assignment operator.
-  Generator_System& operator=(const Generator_System& y);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Generator_System can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  void set_space_dimension(dimension_type space_dim);
-
-  /*! \brief
-    Removes all the generators from the generator system
-    and sets its space dimension to 0.
-  */
-  void clear();
-
-  /*! \brief
-    Inserts in \p *this a copy of the generator \p g,
-    increasing the number of space dimensions if needed.
-  */
-  void insert(const Generator& g);
-
-  /*! \brief
-    Inserts in \p *this the generator \p g, stealing its contents and
-    increasing the number of space dimensions if needed.
-  */
-  void insert(Generator& g, Recycle_Input);
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  /*! \brief
-    Returns the singleton system containing only Generator::zero_dim_point().
-  */
-  static const Generator_System& zero_dim_univ();
-
-  typedef Generator_System_const_iterator const_iterator;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this has no generators.
-  bool empty() const;
-
-  /*! \brief
-    Returns the const_iterator pointing to the first generator,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const_iterator.
-  const_iterator end() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-
-    Resizes the matrix of generators using the numbers of rows and columns
-    read from \p s, then initializes the coordinates of each generator
-    and its type reading the contents from \p s.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Generator_System& y);
-
-private:
-
-  bool has_no_rows() const;
-
-  //! Removes all the specified dimensions from the generator system.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Permutes the space dimensions of the matrix.
-  /*
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    columns must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  dimension_type num_rows() const;
-
-  //! Adds \p n rows and space dimensions to the system.
-  /*!
-    \param n
-    The number of rows and space dimensions to be added: must be strictly
-    positive.
-
-    Turns the system \f$M \in \Rset^r \times \Rset^c\f$ into
-    the system \f$N \in \Rset^{r+n} \times \Rset^{c+n}\f$
-    such that
-    \f$N = \bigl(\genfrac{}{}{0pt}{}{0}{M}\genfrac{}{}{0pt}{}{J}{o}\bigr)\f$,
-    where \f$J\f$ is the specular image
-    of the \f$n \times n\f$ identity matrix.
-  */
-  void add_universe_rows_and_space_dimensions(dimension_type n);
-
-  Topology topology() const;
-
-  //! Returns the index of the first pending row.
-  dimension_type first_pending_row() const;
-
-  //! Sets the index to indicate that the system has no pending rows.
-  void unset_pending_rows();
-
-  //! Sets the sortedness flag of the system to \p b.
-  void set_sorted(bool b);
-
-  //! Returns the value of the sortedness flag.
-  bool is_sorted() const;
-
-  //! Sets the index of the first pending row to \p i.
-  void set_index_first_pending_row(dimension_type i);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    the system topology is <CODE>NECESSARILY_CLOSED</CODE>.
-  */
-  bool is_necessarily_closed() const;
-
-  //! Full assignment operator: pending rows are copied as pending.
-  void assign_with_pending(const Generator_System& y);
-
-  //! Returns the number of rows that are in the pending part of the system.
-  dimension_type num_pending_rows() const;
-
-  /*! \brief
-    Sorts the pending rows and eliminates those that also occur
-    in the non-pending part of the system.
-  */
-  void sort_pending_and_remove_duplicates();
-
-  /*! \brief
-    Sorts the system, removing duplicates, keeping the saturation
-    matrix consistent.
-
-    \param sat
-    Bit matrix with rows corresponding to the rows of \p *this.
-  */
-  void sort_and_remove_with_sat(Bit_Matrix& sat);
-
-  /*! \brief
-    Sorts the non-pending rows (in growing order) and eliminates
-    duplicated ones.
-  */
-  void sort_rows();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is sorted,
-    without checking for duplicates.
-  */
-  bool check_sorted() const;
-
-  /*! \brief
-    Returns the number of rows in the system
-    that represent either lines or equalities.
-  */
-  dimension_type num_lines_or_equalities() const;
-
-  //! Makes the system shrink by removing its i-th row.
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(n).
-
-    Otherwise, this method just swaps the i-th row with the last and then
-    removes it, so it costs O(1).
-  */
-  void remove_row(dimension_type i, bool keep_sorted = false);
-
-  //! Makes the system shrink by removing the rows in [first,last).
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(num_rows()).
-
-    Otherwise, this method just swaps the rows with the last ones and then
-    removes them, so it costs O(last - first).
-  */
-  void remove_rows(dimension_type first, dimension_type last,
-                   bool keep_sorted = false);
-
-  //! Removes the specified rows. The row ordering of remaining rows is
-  //! preserved.
-  /*!
-    \param indexes specifies a list of row indexes.
-                   It must be sorted.
-  */
-  void remove_rows(const std::vector<dimension_type>& indexes);
-
-  //! Makes the system shrink by removing its \p n trailing rows.
-  void remove_trailing_rows(dimension_type n);
-
-  //! Minimizes the subsystem of equations contained in \p *this.
-  /*!
-    This method works only on the equalities of the system:
-    the system is required to be partially sorted, so that
-    all the equalities are grouped at its top; it is assumed that
-    the number of equalities is exactly \p n_lines_or_equalities.
-    The method finds a minimal system for the equalities and
-    returns its rank, i.e., the number of linearly independent equalities.
-    The result is an upper triangular subsystem of equalities:
-    for each equality, the pivot is chosen starting from
-    the right-most columns.
-  */
-  dimension_type gauss(dimension_type n_lines_or_equalities);
-
-  /*! \brief
-    Back-substitutes the coefficients to reduce
-    the complexity of the system.
-
-    Takes an upper triangular system having \p n_lines_or_equalities rows.
-    For each row, starting from the one having the minimum number of
-    coefficients different from zero, computes the expression of an element
-    as a function of the remaining ones and then substitutes this expression
-    in all the other rows.
-  */
-  void back_substitute(dimension_type n_lines_or_equalities);
-
-  //! Strongly normalizes the system.
-  void strong_normalize();
-
-  /*! \brief
-    Assigns to \p *this the result of merging its rows with
-    those of \p y, obtaining a sorted system.
-
-    Duplicated rows will occur only once in the result.
-    On entry, both systems are assumed to be sorted and have
-    no pending rows.
-  */
-  void merge_rows_assign(const Generator_System& y);
-
-  //! Adds to \p *this a copy of  the rows of \p y.
-  /*!
-    It is assumed that \p *this has no pending rows.
-  */
-  void insert(const Generator_System& y);
-
-  //! Adds a copy of the rows of `y' to the pending part of `*this'.
-  void insert_pending(const Generator_System& r);
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the singleton system containing only Generator::zero_dim_point().
-  */
-  static const Generator_System* zero_dim_univ_p;
-
-  friend class Generator_System_const_iterator;
-
-  //! Builds an empty system of generators having the specified topology.
-  explicit Generator_System(Topology topol,
-                            Representation r = default_representation);
-
-  /*! \brief
-    Builds a system of rays/points on a \p space_dim dimensional space. If
-    \p topol is <CODE>NOT_NECESSARILY_CLOSED</CODE> the \f$\epsilon\f$
-    dimension is added.
-  */
-  Generator_System(Topology topol, dimension_type space_dim,
-                   Representation r = default_representation);
-
-  /*! \brief
-    Adjusts \p *this so that it matches the \p new_topology and
-    \p new_space_dim (adding or removing columns if needed).
-    Returns <CODE>false</CODE> if and only if \p topol is
-    equal to <CODE>NECESSARILY_CLOSED</CODE> and \p *this
-    contains closure points.
-  */
-  bool adjust_topology_and_space_dimension(Topology new_topology,
-					   dimension_type new_space_dim);
-
-  /*! \brief
-    For each unmatched closure point in \p *this, adds the
-    corresponding point.
-
-    It is assumed that the topology of \p *this
-    is <CODE>NOT_NECESSARILY_CLOSED</CODE>.
-  */
-  void add_corresponding_points();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains one or more points.
-  */
-  bool has_points() const;
-
-  /*! \brief
-    For each unmatched point in \p *this, adds the corresponding
-    closure point.
-
-    It is assumed that the topology of \p *this
-    is <CODE>NOT_NECESSARILY_CLOSED</CODE>.
-  */
-  void add_corresponding_closure_points();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains one or more closure points.
-
-    Note: the check for the presence of closure points is
-    done under the point of view of the user. Namely, we scan
-    the generator system using high-level iterators, so that
-    closure points that are matching the corresponding points
-    will be disregarded.
-  */
-  bool has_closure_points() const;
-
-  //! Converts this generator system into a non-necessarily closed generator
-  //! system.
-  void convert_into_non_necessarily_closed();
-
-  //! Returns a constant reference to the \p k- th generator of the system.
-  const Generator& operator[](dimension_type k) const;
-
-  /*! \brief
-    Returns the relations holding between the generator system
-    and the constraint \p c.
-  */
-  Parma_Polyhedra_Library::Poly_Con_Relation
-  relation_with(const Constraint& c) const;
-
-  //! Returns <CODE>true</CODE> if all the generators satisfy \p c.
-  bool satisfied_by_all_generators(const Constraint& c) const;
-
-  //! Returns <CODE>true</CODE> if all the generators satisfy \p c.
-  /*!
-    It is assumed that <CODE>c.is_necessarily_closed()</CODE> holds.
-  */
-  bool satisfied_by_all_generators_C(const Constraint& c) const;
-
-  //! Returns <CODE>true</CODE> if all the generators satisfy \p c.
-  /*!
-    It is assumed that <CODE>c.is_necessarily_closed()</CODE> does not hold.
-  */
-  bool satisfied_by_all_generators_NNC(const Constraint& c) const;
-
-  //! Assigns to a given variable an affine expression.
-  /*!
-    \param v
-    The variable to which the affine transformation is assigned;
-
-    \param expr
-    The numerator of the affine transformation:
-    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
-
-    \param denominator
-    The denominator of the affine transformation.
-
-    We want to allow affine transformations (see the Introduction) having
-    any rational coefficients. Since the coefficients of the
-    constraints are integers we must also provide an integer \p denominator
-    that will be used as denominator of the affine transformation.
-    The denominator is required to be a positive integer.
-
-    The affine transformation assigns to each element of the column containing
-    the coefficients of v the follow expression:
-    \f[
-      \frac{\sum_{i = 0}^{n - 1} a_i x_i + b}
-           {\mathrm{denominator}}.
-    \f]
-
-    \p expr is a constant parameter and unaltered by this computation.
-  */
-  void affine_image(Variable v,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator);
-
-  //! Returns the number of lines of the system.
-  dimension_type num_lines() const;
-
-  //! Returns the number of rays of the system.
-  dimension_type num_rays() const;
-
-  //! Removes all the invalid lines and rays.
-  /*!
-    The invalid lines and rays are those with all
-    the homogeneous terms set to zero.
-  */
-  void remove_invalid_lines_and_rays();
-
-  /*! \brief
-    Applies Gaussian elimination and back-substitution so as
-    to provide a partial simplification of the system of generators.
-
-    It is assumed that the system has no pending generators.
-  */
-  void simplify();
-
-  /*! \brief
-    Inserts in \p *this a copy of the generator \p g,
-    increasing the number of space dimensions if needed.
-    It is a pending generator.
-  */
-  void insert_pending(const Generator& g);
-
-  /*! \brief
-    Inserts in \p *this the generator \p g, stealing its contents and
-    increasing the number of space dimensions if needed.
-    It is a pending generator.
-  */
-  void insert_pending(Generator& g, Recycle_Input);
-
-  Linear_System<Generator> sys;
-
-  friend bool
-  operator==(const Generator_System& x, const Generator_System& y);
-
-  friend class Polyhedron;
-};
-
-//! An iterator over a system of generators
-/*! \ingroup PPL_CXX_interface
-    A const_iterator is used to provide read-only access
-    to each generator contained in an object of Generator_System.
-
-    \par Example
-    The following code prints the system of generators
-    of the polyhedron <CODE>ph</CODE>:
-    \code
-const Generator_System& gs = ph.generators();
-for (Generator_System::const_iterator i = gs.begin(),
-        gs_end = gs.end(); i != gs_end; ++i)
-  cout << *i << endl;
-    \endcode
-    The same effect can be obtained more concisely by using
-    more features of the STL:
-    \code
-const Generator_System& gs = ph.generators();
-copy(gs.begin(), gs.end(), ostream_iterator<Generator>(cout, "\n"));
-    \endcode
-*/
-class Parma_Polyhedra_Library::Generator_System_const_iterator
-  : public std::iterator<std::forward_iterator_tag,
-        Generator,
-        ptrdiff_t,
-        const Generator*,
-        const Generator&> {
-public:
-  //! Default constructor.
-  Generator_System_const_iterator();
-
-  //! Ordinary copy constructor.
-  Generator_System_const_iterator(const Generator_System_const_iterator& y);
-
-  //! Destructor.
-  ~Generator_System_const_iterator();
-
-  //! Assignment operator.
-  Generator_System_const_iterator& operator=(const Generator_System_const_iterator& y);
-
-  //! Dereference operator.
-  const Generator& operator*() const;
-
-  //! Indirect member selector.
-  const Generator* operator->() const;
-
-  //! Prefix increment operator.
-  Generator_System_const_iterator& operator++();
-
-  //! Postfix increment operator.
-  Generator_System_const_iterator operator++(int);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are identical.
-  */
-  bool operator==(const Generator_System_const_iterator& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are different.
-  */
-  bool operator!=(const Generator_System_const_iterator& y) const;
-
-private:
-  friend class Generator_System;
-
-  //! The const iterator over the Linear_System.
-  Linear_System<Generator>::const_iterator i;
-
-  //! A const pointer to the Linear_System.
-  const Linear_System<Generator>* gsp;
-
-  //! Constructor.
-  Generator_System_const_iterator(const Linear_System<Generator>::const_iterator& iter,
-      const Generator_System& gsys);
-
-  /*! \brief
-    \p *this skips to the next generator, skipping those
-    closure points that are immediately followed by a matching point.
-  */
-  void skip_forward();
-};
-
-// Generator_System.inlines.hh is not included here on purpose.
-
-#endif // !defined(PPL_Generator_System_defs_hh)
diff --git a/src/Generator_System.inlines.hh b/src/Generator_System.inlines.hh
deleted file mode 100644
index de4bb92..0000000
--- a/src/Generator_System.inlines.hh
+++ /dev/null
@@ -1,411 +0,0 @@
-/* Generator_System class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Generator_System_inlines_hh
-#define PPL_Generator_System_inlines_hh 1
-
-#include "Generator.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Generator_System::Generator_System(Representation r)
-  : sys(NECESSARILY_CLOSED, r) {
-}
-
-inline
-Generator_System::Generator_System(const Generator& g, Representation r)
-  : sys(g.topology(), r) {
-  sys.insert(g);
-}
-
-inline
-Generator_System::Generator_System(const Generator_System& gs)
-  : sys(gs.sys) {
-}
-
-inline
-Generator_System::Generator_System(const Generator_System& gs,
-                                   Representation r)
-  : sys(gs.sys, r) {
-}
-
-inline
-Generator_System::Generator_System(const Topology topol, Representation r)
-  : sys(topol, r) {
-}
-
-inline
-Generator_System::Generator_System(const Topology topol,
-				   const dimension_type space_dim,
-                                   Representation r)
-  : sys(topol, space_dim, r) {
-}
-
-inline
-Generator_System::~Generator_System() {
-}
-
-inline Generator_System&
-Generator_System::operator=(const Generator_System& y) {
-  Generator_System tmp = y;
-  swap(*this, tmp);
-  return *this;
-}
-
-inline Representation
-Generator_System::representation() const {
-  return sys.representation();
-}
-
-inline void
-Generator_System::set_representation(Representation r) {
-  sys.set_representation(r);
-}
-
-inline dimension_type
-Generator_System::max_space_dimension() {
-  return Linear_System<Generator>::max_space_dimension();
-}
-
-inline dimension_type
-Generator_System::space_dimension() const {
-  return sys.space_dimension();
-}
-
-inline void
-Generator_System::set_space_dimension(dimension_type space_dim) {
-  const dimension_type old_space_dim = space_dimension();
-  sys.set_space_dimension_no_ok(space_dim);
-
-  if (space_dim < old_space_dim)
-    // We may have invalid lines and rays now.
-    remove_invalid_lines_and_rays();
-
-#ifndef NDEBUG
-  for (dimension_type i = 0; i < sys.num_rows(); ++i)
-    PPL_ASSERT(sys[i].OK());
-#endif
-  PPL_ASSERT(sys.OK());
-  PPL_ASSERT(OK());
-}
-
-inline void
-Generator_System::clear() {
-  sys.clear();
-}
-
-inline const Generator&
-Generator_System::operator[](const dimension_type k) const {
-  return sys[k];
-}
-
-inline void
-Generator_System
-::remove_space_dimensions(const Variables_Set& vars) {
-  sys.remove_space_dimensions(vars);
-}
-
-inline void
-Generator_System
-::shift_space_dimensions(Variable v, dimension_type n) {
-  sys.shift_space_dimensions(v, n);
-}
-
-inline void
-Generator_System
-::permute_space_dimensions(const std::vector<Variable>& cycle) {
-  sys.permute_space_dimensions(cycle);
-}
-
-inline void
-Generator_System
-::swap_space_dimensions(Variable v1, Variable v2) {
-  sys.swap_space_dimensions(v1, v2);
-}
-
-inline dimension_type
-Generator_System::num_rows() const {
-  return sys.num_rows();
-}
-
-inline void
-Generator_System::add_universe_rows_and_space_dimensions(dimension_type n) {
-  sys.add_universe_rows_and_space_dimensions(n);
-}
-
-inline Topology
-Generator_System::topology() const {
-  return sys.topology();
-}
-
-inline dimension_type
-Generator_System::first_pending_row() const {
-  return sys.first_pending_row();
-}
-
-inline void
-Generator_System::unset_pending_rows() {
-  sys.unset_pending_rows();
-}
-
-inline void
-Generator_System::set_sorted(bool b) {
-  sys.set_sorted(b);
-}
-
-inline bool
-Generator_System::is_sorted() const {
-  return sys.is_sorted();
-}
-
-inline void
-Generator_System::set_index_first_pending_row(dimension_type i) {
-  sys.set_index_first_pending_row(i);
-}
-
-inline bool
-Generator_System::is_necessarily_closed() const {
-  return sys.is_necessarily_closed();
-}
-
-inline void
-Generator_System::assign_with_pending(const Generator_System& y) {
-  sys.assign_with_pending(y.sys);
-}
-
-inline dimension_type
-Generator_System::num_pending_rows() const {
-  return sys.num_pending_rows();
-}
-
-inline void
-Generator_System::sort_pending_and_remove_duplicates() {
-  return sys.sort_pending_and_remove_duplicates();
-}
-
-inline void
-Generator_System::sort_and_remove_with_sat(Bit_Matrix& sat) {
-  sys.sort_and_remove_with_sat(sat);
-}
-
-inline void
-Generator_System::sort_rows() {
-  sys.sort_rows();
-}
-
-inline bool
-Generator_System::check_sorted() const {
-  return sys.check_sorted();
-}
-
-inline dimension_type
-Generator_System::num_lines_or_equalities() const {
-  return sys.num_lines_or_equalities();
-}
-
-inline void
-Generator_System::remove_row(dimension_type i, bool keep_sorted) {
-  sys.remove_row(i, keep_sorted);
-}
-
-inline void
-Generator_System::remove_rows(dimension_type first, dimension_type last,
-                              bool keep_sorted) {
-  sys.remove_rows(first, last, keep_sorted);
-}
-
-inline void
-Generator_System::remove_rows(const std::vector<dimension_type>& indexes) {
-  sys.remove_rows(indexes);
-}
-
-inline void
-Generator_System::remove_trailing_rows(dimension_type n) {
-  sys.remove_trailing_rows(n);
-}
-
-inline dimension_type
-Generator_System::gauss(dimension_type n_lines_or_equalities) {
-  return sys.gauss(n_lines_or_equalities);
-}
-
-inline void
-Generator_System::back_substitute(dimension_type n_lines_or_equalities) {
-  sys.back_substitute(n_lines_or_equalities);
-}
-
-inline void
-Generator_System::strong_normalize() {
-  sys.strong_normalize();
-}
-
-inline void
-Generator_System::merge_rows_assign(const Generator_System& y) {
-  sys.merge_rows_assign(y.sys);
-}
-
-inline void
-Generator_System::insert(const Generator_System& y) {
-  sys.insert(y.sys);
-}
-
-inline void
-Generator_System::insert_pending(const Generator_System& r) {
-  sys.insert_pending(r.sys);
-}
-
-inline bool
-operator==(const Generator_System& x, const Generator_System& y) {
-  return x.sys == y.sys;
-}
-
-inline bool
-operator!=(const Generator_System& x, const Generator_System& y) {
-  return !(x == y);
-}
-
-inline
-Generator_System_const_iterator::Generator_System_const_iterator()
-  : i(), gsp(0) {
-}
-
-inline
-Generator_System_const_iterator::Generator_System_const_iterator(const Generator_System_const_iterator& y)
-  : i(y.i), gsp(y.gsp) {
-}
-
-inline
-Generator_System_const_iterator::~Generator_System_const_iterator() {
-}
-
-inline
-Generator_System_const_iterator&
-Generator_System_const_iterator::operator=(const Generator_System_const_iterator& y) {
-  i = y.i;
-  gsp = y.gsp;
-  return *this;
-}
-
-inline const Generator&
-Generator_System_const_iterator::operator*() const {
-  return *i;
-}
-
-inline const Generator*
-Generator_System_const_iterator::operator->() const {
-  return i.operator->();
-}
-
-inline Generator_System_const_iterator&
-Generator_System_const_iterator::operator++() {
-  ++i;
-  if (!gsp->is_necessarily_closed())
-    skip_forward();
-  return *this;
-}
-
-inline Generator_System_const_iterator
-Generator_System_const_iterator::operator++(int) {
-  const Generator_System_const_iterator tmp = *this;
-  operator++();
-  return tmp;
-}
-
-inline bool
-Generator_System_const_iterator::operator==(const Generator_System_const_iterator& y) const {
-  return i == y.i;
-}
-
-inline bool
-Generator_System_const_iterator::operator!=(const Generator_System_const_iterator& y) const {
-  return i != y.i;
-}
-
-inline
-Generator_System_const_iterator::
-Generator_System_const_iterator(const Linear_System<Generator>::const_iterator& iter,
-                                const Generator_System& gs)
-  : i(iter), gsp(&gs.sys) {
-}
-
-inline bool
-Generator_System::empty() const {
-  return sys.has_no_rows();
-}
-
-inline bool
-Generator_System::has_no_rows() const {
-  return sys.has_no_rows();
-}
-
-inline Generator_System::const_iterator
-Generator_System::begin() const {
-  const_iterator i(sys.begin(), *this);
-  if (!sys.is_necessarily_closed())
-    i.skip_forward();
-  return i;
-}
-
-inline Generator_System::const_iterator
-Generator_System::end() const {
-  const const_iterator i(sys.end(), *this);
-  return i;
-}
-
-inline const Generator_System&
-Generator_System::zero_dim_univ() {
-  PPL_ASSERT(zero_dim_univ_p != 0);
-  return *zero_dim_univ_p;
-}
-
-inline void
-Generator_System::m_swap(Generator_System& y) {
-  swap(sys, y.sys);
-}
-
-inline memory_size_type
-Generator_System::external_memory_in_bytes() const {
-  return sys.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Generator_System::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-inline void
-Generator_System::simplify() {
-  sys.simplify();
-  remove_invalid_lines_and_rays();
-}
-
-/*! \relates Generator_System */
-inline void
-swap(Generator_System& x, Generator_System& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Generator_System_inlines_hh)
diff --git a/src/Generator_System.types.hh b/src/Generator_System.types.hh
deleted file mode 100644
index de9a9ed..0000000
--- a/src/Generator_System.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Generator_System_types_hh
-#define PPL_Generator_System_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Generator_System;
-class Generator_System_const_iterator;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Generator_System_types_hh)
diff --git a/src/Generator_System_defs.hh b/src/Generator_System_defs.hh
new file mode 100644
index 0000000..b93e929
--- /dev/null
+++ b/src/Generator_System_defs.hh
@@ -0,0 +1,744 @@
+/* Generator_System class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Generator_System_defs_hh
+#define PPL_Generator_System_defs_hh 1
+
+#include "Generator_System_types.hh"
+
+#include "Linear_Expression_types.hh"
+#include "Linear_System_defs.hh"
+#include "Generator_defs.hh"
+#include "Constraint_types.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Polyhedron_types.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Generator_System
+  Writes <CODE>false</CODE> if \p gs is empty.  Otherwise, writes on
+  \p s the generators of \p gs, all in one row and separated by ", ".
+*/
+std::ostream& operator<<(std::ostream& s, const Generator_System& gs);
+
+} // namespace IO_Operators
+
+// TODO: Consider removing this.
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates Generator_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator==(const Generator_System& x, const Generator_System& y);
+
+// TODO: Consider removing this.
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Generator_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator!=(const Generator_System& x, const Generator_System& y);
+
+/*! \relates Generator_System */
+void
+swap(Generator_System& x, Generator_System& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A system of generators.
+/*! \ingroup PPL_CXX_interface
+    An object of the class Generator_System is a system of generators,
+    i.e., a multiset of objects of the class Generator
+    (lines, rays, points and closure points).
+    When inserting generators in a system, space dimensions are automatically
+    adjusted so that all the generators in the system are defined
+    on the same vector space.
+    A system of generators which is meant to define a non-empty
+    polyhedron must include at least one point: the reason is that
+    lines, rays and closure points need a supporting point
+    (lines and rays only specify directions while closure points only
+    specify points in the topological closure of the NNC polyhedron).
+
+    \par
+     In all the examples it is assumed that variables
+    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
+    \code
+  Variable x(0);
+  Variable y(1);
+    \endcode
+
+    \par Example 1
+    The following code defines the line having the same direction
+    as the \f$x\f$ axis (i.e., the first Cartesian axis)
+    in \f$\Rset^2\f$:
+    \code
+  Generator_System gs;
+  gs.insert(line(x + 0*y));
+    \endcode
+    As said above, this system of generators corresponds to
+    an empty polyhedron, because the line has no supporting point.
+    To define a system of generators that does correspond to
+    the \f$x\f$ axis, we can add the following code which
+    inserts the origin of the space as a point:
+    \code
+  gs.insert(point(0*x + 0*y));
+    \endcode
+    Since space dimensions are automatically adjusted, the following
+    code obtains the same effect:
+    \code
+  gs.insert(point(0*x));
+    \endcode
+    In contrast, if we had added the following code, we would have
+    defined a line parallel to the \f$x\f$ axis through
+    the point \f$(0, 1)^\transpose \in \Rset^2\f$.
+    \code
+  gs.insert(point(0*x + 1*y));
+    \endcode
+
+    \par Example 2
+    The following code builds a ray having the same direction as
+    the positive part of the \f$x\f$ axis in \f$\Rset^2\f$:
+    \code
+  Generator_System gs;
+  gs.insert(ray(x + 0*y));
+    \endcode
+    To define a system of generators indeed corresponding to the set
+    \f[
+      \bigl\{\,
+        (x, 0)^\transpose \in \Rset^2
+      \bigm|
+        x \geq 0
+      \,\bigr\},
+    \f]
+    one just has to add the origin:
+    \code
+  gs.insert(point(0*x + 0*y));
+    \endcode
+
+    \par Example 3
+    The following code builds a system of generators having four points
+    and corresponding to a square in \f$\Rset^2\f$
+    (the same as Example 1 for the system of constraints):
+    \code
+  Generator_System gs;
+  gs.insert(point(0*x + 0*y));
+  gs.insert(point(0*x + 3*y));
+  gs.insert(point(3*x + 0*y));
+  gs.insert(point(3*x + 3*y));
+    \endcode
+
+    \par Example 4
+    By using closure points, we can define the \e kernel
+    (i.e., the largest open set included in a given set)
+    of the square defined in the previous example.
+    Note that a supporting point is needed and, for that purpose,
+    any inner point could be considered.
+    \code
+  Generator_System gs;
+  gs.insert(point(x + y));
+  gs.insert(closure_point(0*x + 0*y));
+  gs.insert(closure_point(0*x + 3*y));
+  gs.insert(closure_point(3*x + 0*y));
+  gs.insert(closure_point(3*x + 3*y));
+    \endcode
+
+    \par Example 5
+    The following code builds a system of generators having two points
+    and a ray, corresponding to a half-strip in \f$\Rset^2\f$
+    (the same as Example 2 for the system of constraints):
+    \code
+  Generator_System gs;
+  gs.insert(point(0*x + 0*y));
+  gs.insert(point(0*x + 1*y));
+  gs.insert(ray(x - y));
+    \endcode
+
+    \note
+    After inserting a multiset of generators in a generator system,
+    there are no guarantees that an <EM>exact</EM> copy of them
+    can be retrieved:
+    in general, only an <EM>equivalent</EM> generator system
+    will be available, where original generators may have been
+    reordered, removed (if they are duplicate or redundant), etc.
+*/
+class Parma_Polyhedra_Library::Generator_System {
+public:
+  typedef Generator row_type;
+
+  static const Representation default_representation = SPARSE;
+
+  //! Default constructor: builds an empty system of generators.
+  Generator_System(Representation r = default_representation);
+
+  //! Builds the singleton system containing only generator \p g.
+  explicit Generator_System(const Generator& g,
+                            Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  //! The new Generator_System will have the same representation as `gs'.
+  Generator_System(const Generator_System& gs);
+
+  //! Copy constructor with specified representation.
+  Generator_System(const Generator_System& gs, Representation r);
+
+  //! Destructor.
+  ~Generator_System();
+
+  //! Assignment operator.
+  Generator_System& operator=(const Generator_System& y);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Generator_System can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  void set_space_dimension(dimension_type space_dim);
+
+  /*! \brief
+    Removes all the generators from the generator system
+    and sets its space dimension to 0.
+  */
+  void clear();
+
+  /*! \brief
+    Inserts in \p *this a copy of the generator \p g,
+    increasing the number of space dimensions if needed.
+  */
+  void insert(const Generator& g);
+
+  /*! \brief
+    Inserts in \p *this the generator \p g, stealing its contents and
+    increasing the number of space dimensions if needed.
+  */
+  void insert(Generator& g, Recycle_Input);
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  /*! \brief
+    Returns the singleton system containing only Generator::zero_dim_point().
+  */
+  static const Generator_System& zero_dim_univ();
+
+  typedef Generator_System_const_iterator const_iterator;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this has no generators.
+  bool empty() const;
+
+  /*! \brief
+    Returns the const_iterator pointing to the first generator,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const_iterator.
+  const_iterator end() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+
+    Resizes the matrix of generators using the numbers of rows and columns
+    read from \p s, then initializes the coordinates of each generator
+    and its type reading the contents from \p s.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Generator_System& y);
+
+private:
+
+  bool has_no_rows() const;
+
+  //! Removes all the specified dimensions from the generator system.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Permutes the space dimensions of the matrix.
+  /*
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    columns must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  dimension_type num_rows() const;
+
+  //! Adds \p n rows and space dimensions to the system.
+  /*!
+    \param n
+    The number of rows and space dimensions to be added: must be strictly
+    positive.
+
+    Turns the system \f$M \in \Rset^r \times \Rset^c\f$ into
+    the system \f$N \in \Rset^{r+n} \times \Rset^{c+n}\f$
+    such that
+    \f$N = \bigl(\genfrac{}{}{0pt}{}{0}{M}\genfrac{}{}{0pt}{}{J}{o}\bigr)\f$,
+    where \f$J\f$ is the specular image
+    of the \f$n \times n\f$ identity matrix.
+  */
+  void add_universe_rows_and_space_dimensions(dimension_type n);
+
+  Topology topology() const;
+
+  //! Returns the index of the first pending row.
+  dimension_type first_pending_row() const;
+
+  //! Sets the index to indicate that the system has no pending rows.
+  void unset_pending_rows();
+
+  //! Sets the sortedness flag of the system to \p b.
+  void set_sorted(bool b);
+
+  //! Returns the value of the sortedness flag.
+  bool is_sorted() const;
+
+  //! Sets the index of the first pending row to \p i.
+  void set_index_first_pending_row(dimension_type i);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    the system topology is <CODE>NECESSARILY_CLOSED</CODE>.
+  */
+  bool is_necessarily_closed() const;
+
+  //! Full assignment operator: pending rows are copied as pending.
+  void assign_with_pending(const Generator_System& y);
+
+  //! Returns the number of rows that are in the pending part of the system.
+  dimension_type num_pending_rows() const;
+
+  /*! \brief
+    Sorts the pending rows and eliminates those that also occur
+    in the non-pending part of the system.
+  */
+  void sort_pending_and_remove_duplicates();
+
+  /*! \brief
+    Sorts the system, removing duplicates, keeping the saturation
+    matrix consistent.
+
+    \param sat
+    Bit matrix with rows corresponding to the rows of \p *this.
+  */
+  void sort_and_remove_with_sat(Bit_Matrix& sat);
+
+  /*! \brief
+    Sorts the non-pending rows (in growing order) and eliminates
+    duplicated ones.
+  */
+  void sort_rows();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is sorted,
+    without checking for duplicates.
+  */
+  bool check_sorted() const;
+
+  /*! \brief
+    Returns the number of rows in the system
+    that represent either lines or equalities.
+  */
+  dimension_type num_lines_or_equalities() const;
+
+  //! Makes the system shrink by removing its i-th row.
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(n).
+
+    Otherwise, this method just swaps the i-th row with the last and then
+    removes it, so it costs O(1).
+  */
+  void remove_row(dimension_type i, bool keep_sorted = false);
+
+  //! Makes the system shrink by removing the rows in [first,last).
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(num_rows()).
+
+    Otherwise, this method just swaps the rows with the last ones and then
+    removes them, so it costs O(last - first).
+  */
+  void remove_rows(dimension_type first, dimension_type last,
+                   bool keep_sorted = false);
+
+  //! Removes the specified rows. The row ordering of remaining rows is
+  //! preserved.
+  /*!
+    \param indexes specifies a list of row indexes.
+                   It must be sorted.
+  */
+  void remove_rows(const std::vector<dimension_type>& indexes);
+
+  //! Makes the system shrink by removing its \p n trailing rows.
+  void remove_trailing_rows(dimension_type n);
+
+  //! Minimizes the subsystem of equations contained in \p *this.
+  /*!
+    This method works only on the equalities of the system:
+    the system is required to be partially sorted, so that
+    all the equalities are grouped at its top; it is assumed that
+    the number of equalities is exactly \p n_lines_or_equalities.
+    The method finds a minimal system for the equalities and
+    returns its rank, i.e., the number of linearly independent equalities.
+    The result is an upper triangular subsystem of equalities:
+    for each equality, the pivot is chosen starting from
+    the right-most columns.
+  */
+  dimension_type gauss(dimension_type n_lines_or_equalities);
+
+  /*! \brief
+    Back-substitutes the coefficients to reduce
+    the complexity of the system.
+
+    Takes an upper triangular system having \p n_lines_or_equalities rows.
+    For each row, starting from the one having the minimum number of
+    coefficients different from zero, computes the expression of an element
+    as a function of the remaining ones and then substitutes this expression
+    in all the other rows.
+  */
+  void back_substitute(dimension_type n_lines_or_equalities);
+
+  //! Strongly normalizes the system.
+  void strong_normalize();
+
+  /*! \brief
+    Assigns to \p *this the result of merging its rows with
+    those of \p y, obtaining a sorted system.
+
+    Duplicated rows will occur only once in the result.
+    On entry, both systems are assumed to be sorted and have
+    no pending rows.
+  */
+  void merge_rows_assign(const Generator_System& y);
+
+  //! Adds to \p *this a copy of  the rows of \p y.
+  /*!
+    It is assumed that \p *this has no pending rows.
+  */
+  void insert(const Generator_System& y);
+
+  //! Adds a copy of the rows of `y' to the pending part of `*this'.
+  void insert_pending(const Generator_System& r);
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the singleton system containing only Generator::zero_dim_point().
+  */
+  static const Generator_System* zero_dim_univ_p;
+
+  friend class Generator_System_const_iterator;
+
+  //! Builds an empty system of generators having the specified topology.
+  explicit Generator_System(Topology topol,
+                            Representation r = default_representation);
+
+  /*! \brief
+    Builds a system of rays/points on a \p space_dim dimensional space. If
+    \p topol is <CODE>NOT_NECESSARILY_CLOSED</CODE> the \f$\epsilon\f$
+    dimension is added.
+  */
+  Generator_System(Topology topol, dimension_type space_dim,
+                   Representation r = default_representation);
+
+  /*! \brief
+    Adjusts \p *this so that it matches the \p new_topology and
+    \p new_space_dim (adding or removing columns if needed).
+    Returns <CODE>false</CODE> if and only if \p topol is
+    equal to <CODE>NECESSARILY_CLOSED</CODE> and \p *this
+    contains closure points.
+  */
+  bool adjust_topology_and_space_dimension(Topology new_topology,
+                                           dimension_type new_space_dim);
+
+  /*! \brief
+    For each unmatched closure point in \p *this, adds the
+    corresponding point.
+
+    It is assumed that the topology of \p *this
+    is <CODE>NOT_NECESSARILY_CLOSED</CODE>.
+  */
+  void add_corresponding_points();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains one or more points.
+  */
+  bool has_points() const;
+
+  /*! \brief
+    For each unmatched point in \p *this, adds the corresponding
+    closure point.
+
+    It is assumed that the topology of \p *this
+    is <CODE>NOT_NECESSARILY_CLOSED</CODE>.
+  */
+  void add_corresponding_closure_points();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains one or more closure points.
+
+    Note: the check for the presence of closure points is
+    done under the point of view of the user. Namely, we scan
+    the generator system using high-level iterators, so that
+    closure points that are matching the corresponding points
+    will be disregarded.
+  */
+  bool has_closure_points() const;
+
+  //! Converts this generator system into a non-necessarily closed generator
+  //! system.
+  void convert_into_non_necessarily_closed();
+
+  //! Returns a constant reference to the \p k- th generator of the system.
+  const Generator& operator[](dimension_type k) const;
+
+  /*! \brief
+    Returns the relations holding between the generator system
+    and the constraint \p c.
+  */
+  Parma_Polyhedra_Library::Poly_Con_Relation
+  relation_with(const Constraint& c) const;
+
+  //! Returns <CODE>true</CODE> if all the generators satisfy \p c.
+  bool satisfied_by_all_generators(const Constraint& c) const;
+
+  //! Returns <CODE>true</CODE> if all the generators satisfy \p c.
+  /*!
+    It is assumed that <CODE>c.is_necessarily_closed()</CODE> holds.
+  */
+  bool satisfied_by_all_generators_C(const Constraint& c) const;
+
+  //! Returns <CODE>true</CODE> if all the generators satisfy \p c.
+  /*!
+    It is assumed that <CODE>c.is_necessarily_closed()</CODE> does not hold.
+  */
+  bool satisfied_by_all_generators_NNC(const Constraint& c) const;
+
+  //! Assigns to a given variable an affine expression.
+  /*!
+    \param v
+    The variable to which the affine transformation is assigned;
+
+    \param expr
+    The numerator of the affine transformation:
+    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
+
+    \param denominator
+    The denominator of the affine transformation.
+
+    We want to allow affine transformations (see the Introduction) having
+    any rational coefficients. Since the coefficients of the
+    constraints are integers we must also provide an integer \p denominator
+    that will be used as denominator of the affine transformation.
+    The denominator is required to be a positive integer.
+
+    The affine transformation assigns to each element of the column containing
+    the coefficients of v the follow expression:
+    \f[
+      \frac{\sum_{i = 0}^{n - 1} a_i x_i + b}
+           {\mathrm{denominator}}.
+    \f]
+
+    \p expr is a constant parameter and unaltered by this computation.
+  */
+  void affine_image(Variable v,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator);
+
+  //! Returns the number of lines of the system.
+  dimension_type num_lines() const;
+
+  //! Returns the number of rays of the system.
+  dimension_type num_rays() const;
+
+  //! Removes all the invalid lines and rays.
+  /*!
+    The invalid lines and rays are those with all
+    the homogeneous terms set to zero.
+  */
+  void remove_invalid_lines_and_rays();
+
+  /*! \brief
+    Applies Gaussian elimination and back-substitution so as
+    to provide a partial simplification of the system of generators.
+
+    It is assumed that the system has no pending generators.
+  */
+  void simplify();
+
+  /*! \brief
+    Inserts in \p *this a copy of the generator \p g,
+    increasing the number of space dimensions if needed.
+    It is a pending generator.
+  */
+  void insert_pending(const Generator& g);
+
+  /*! \brief
+    Inserts in \p *this the generator \p g, stealing its contents and
+    increasing the number of space dimensions if needed.
+    It is a pending generator.
+  */
+  void insert_pending(Generator& g, Recycle_Input);
+
+  Linear_System<Generator> sys;
+
+  friend bool
+  operator==(const Generator_System& x, const Generator_System& y);
+
+  friend class Polyhedron;
+};
+
+//! An iterator over a system of generators
+/*! \ingroup PPL_CXX_interface
+    A const_iterator is used to provide read-only access
+    to each generator contained in an object of Generator_System.
+
+    \par Example
+    The following code prints the system of generators
+    of the polyhedron <CODE>ph</CODE>:
+    \code
+const Generator_System& gs = ph.generators();
+for (Generator_System::const_iterator i = gs.begin(),
+        gs_end = gs.end(); i != gs_end; ++i)
+  cout << *i << endl;
+    \endcode
+    The same effect can be obtained more concisely by using
+    more features of the STL:
+    \code
+const Generator_System& gs = ph.generators();
+copy(gs.begin(), gs.end(), ostream_iterator<Generator>(cout, "\n"));
+    \endcode
+*/
+class Parma_Polyhedra_Library::Generator_System_const_iterator
+  : public std::iterator<std::forward_iterator_tag,
+        Generator,
+        ptrdiff_t,
+        const Generator*,
+        const Generator&> {
+public:
+  //! Default constructor.
+  Generator_System_const_iterator();
+
+  //! Ordinary copy constructor.
+  Generator_System_const_iterator(const Generator_System_const_iterator& y);
+
+  //! Destructor.
+  ~Generator_System_const_iterator();
+
+  //! Assignment operator.
+  Generator_System_const_iterator& operator=(const Generator_System_const_iterator& y);
+
+  //! Dereference operator.
+  const Generator& operator*() const;
+
+  //! Indirect member selector.
+  const Generator* operator->() const;
+
+  //! Prefix increment operator.
+  Generator_System_const_iterator& operator++();
+
+  //! Postfix increment operator.
+  Generator_System_const_iterator operator++(int);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are identical.
+  */
+  bool operator==(const Generator_System_const_iterator& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are different.
+  */
+  bool operator!=(const Generator_System_const_iterator& y) const;
+
+private:
+  friend class Generator_System;
+
+  //! The const iterator over the Linear_System.
+  Linear_System<Generator>::const_iterator i;
+
+  //! A const pointer to the Linear_System.
+  const Linear_System<Generator>* gsp;
+
+  //! Constructor.
+  Generator_System_const_iterator(const Linear_System<Generator>::const_iterator& iter,
+      const Generator_System& gsys);
+
+  /*! \brief
+    \p *this skips to the next generator, skipping those
+    closure points that are immediately followed by a matching point.
+  */
+  void skip_forward();
+};
+
+// Generator_System_inlines.hh is not included here on purpose.
+
+#endif // !defined(PPL_Generator_System_defs_hh)
diff --git a/src/Generator_System_inlines.hh b/src/Generator_System_inlines.hh
new file mode 100644
index 0000000..bd4cb43
--- /dev/null
+++ b/src/Generator_System_inlines.hh
@@ -0,0 +1,411 @@
+/* Generator_System class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Generator_System_inlines_hh
+#define PPL_Generator_System_inlines_hh 1
+
+#include "Generator_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Generator_System::Generator_System(Representation r)
+  : sys(NECESSARILY_CLOSED, r) {
+}
+
+inline
+Generator_System::Generator_System(const Generator& g, Representation r)
+  : sys(g.topology(), r) {
+  sys.insert(g);
+}
+
+inline
+Generator_System::Generator_System(const Generator_System& gs)
+  : sys(gs.sys) {
+}
+
+inline
+Generator_System::Generator_System(const Generator_System& gs,
+                                   Representation r)
+  : sys(gs.sys, r) {
+}
+
+inline
+Generator_System::Generator_System(const Topology topol, Representation r)
+  : sys(topol, r) {
+}
+
+inline
+Generator_System::Generator_System(const Topology topol,
+                                   const dimension_type space_dim,
+                                   Representation r)
+  : sys(topol, space_dim, r) {
+}
+
+inline
+Generator_System::~Generator_System() {
+}
+
+inline Generator_System&
+Generator_System::operator=(const Generator_System& y) {
+  Generator_System tmp = y;
+  swap(*this, tmp);
+  return *this;
+}
+
+inline Representation
+Generator_System::representation() const {
+  return sys.representation();
+}
+
+inline void
+Generator_System::set_representation(Representation r) {
+  sys.set_representation(r);
+}
+
+inline dimension_type
+Generator_System::max_space_dimension() {
+  return Linear_System<Generator>::max_space_dimension();
+}
+
+inline dimension_type
+Generator_System::space_dimension() const {
+  return sys.space_dimension();
+}
+
+inline void
+Generator_System::set_space_dimension(dimension_type space_dim) {
+  const dimension_type old_space_dim = space_dimension();
+  sys.set_space_dimension_no_ok(space_dim);
+
+  if (space_dim < old_space_dim)
+    // We may have invalid lines and rays now.
+    remove_invalid_lines_and_rays();
+
+#ifndef NDEBUG
+  for (dimension_type i = 0; i < sys.num_rows(); ++i)
+    PPL_ASSERT(sys[i].OK());
+#endif
+  PPL_ASSERT(sys.OK());
+  PPL_ASSERT(OK());
+}
+
+inline void
+Generator_System::clear() {
+  sys.clear();
+}
+
+inline const Generator&
+Generator_System::operator[](const dimension_type k) const {
+  return sys[k];
+}
+
+inline void
+Generator_System
+::remove_space_dimensions(const Variables_Set& vars) {
+  sys.remove_space_dimensions(vars);
+}
+
+inline void
+Generator_System
+::shift_space_dimensions(Variable v, dimension_type n) {
+  sys.shift_space_dimensions(v, n);
+}
+
+inline void
+Generator_System
+::permute_space_dimensions(const std::vector<Variable>& cycle) {
+  sys.permute_space_dimensions(cycle);
+}
+
+inline void
+Generator_System
+::swap_space_dimensions(Variable v1, Variable v2) {
+  sys.swap_space_dimensions(v1, v2);
+}
+
+inline dimension_type
+Generator_System::num_rows() const {
+  return sys.num_rows();
+}
+
+inline void
+Generator_System::add_universe_rows_and_space_dimensions(dimension_type n) {
+  sys.add_universe_rows_and_space_dimensions(n);
+}
+
+inline Topology
+Generator_System::topology() const {
+  return sys.topology();
+}
+
+inline dimension_type
+Generator_System::first_pending_row() const {
+  return sys.first_pending_row();
+}
+
+inline void
+Generator_System::unset_pending_rows() {
+  sys.unset_pending_rows();
+}
+
+inline void
+Generator_System::set_sorted(bool b) {
+  sys.set_sorted(b);
+}
+
+inline bool
+Generator_System::is_sorted() const {
+  return sys.is_sorted();
+}
+
+inline void
+Generator_System::set_index_first_pending_row(dimension_type i) {
+  sys.set_index_first_pending_row(i);
+}
+
+inline bool
+Generator_System::is_necessarily_closed() const {
+  return sys.is_necessarily_closed();
+}
+
+inline void
+Generator_System::assign_with_pending(const Generator_System& y) {
+  sys.assign_with_pending(y.sys);
+}
+
+inline dimension_type
+Generator_System::num_pending_rows() const {
+  return sys.num_pending_rows();
+}
+
+inline void
+Generator_System::sort_pending_and_remove_duplicates() {
+  return sys.sort_pending_and_remove_duplicates();
+}
+
+inline void
+Generator_System::sort_and_remove_with_sat(Bit_Matrix& sat) {
+  sys.sort_and_remove_with_sat(sat);
+}
+
+inline void
+Generator_System::sort_rows() {
+  sys.sort_rows();
+}
+
+inline bool
+Generator_System::check_sorted() const {
+  return sys.check_sorted();
+}
+
+inline dimension_type
+Generator_System::num_lines_or_equalities() const {
+  return sys.num_lines_or_equalities();
+}
+
+inline void
+Generator_System::remove_row(dimension_type i, bool keep_sorted) {
+  sys.remove_row(i, keep_sorted);
+}
+
+inline void
+Generator_System::remove_rows(dimension_type first, dimension_type last,
+                              bool keep_sorted) {
+  sys.remove_rows(first, last, keep_sorted);
+}
+
+inline void
+Generator_System::remove_rows(const std::vector<dimension_type>& indexes) {
+  sys.remove_rows(indexes);
+}
+
+inline void
+Generator_System::remove_trailing_rows(dimension_type n) {
+  sys.remove_trailing_rows(n);
+}
+
+inline dimension_type
+Generator_System::gauss(dimension_type n_lines_or_equalities) {
+  return sys.gauss(n_lines_or_equalities);
+}
+
+inline void
+Generator_System::back_substitute(dimension_type n_lines_or_equalities) {
+  sys.back_substitute(n_lines_or_equalities);
+}
+
+inline void
+Generator_System::strong_normalize() {
+  sys.strong_normalize();
+}
+
+inline void
+Generator_System::merge_rows_assign(const Generator_System& y) {
+  sys.merge_rows_assign(y.sys);
+}
+
+inline void
+Generator_System::insert(const Generator_System& y) {
+  sys.insert(y.sys);
+}
+
+inline void
+Generator_System::insert_pending(const Generator_System& r) {
+  sys.insert_pending(r.sys);
+}
+
+inline bool
+operator==(const Generator_System& x, const Generator_System& y) {
+  return x.sys == y.sys;
+}
+
+inline bool
+operator!=(const Generator_System& x, const Generator_System& y) {
+  return !(x == y);
+}
+
+inline
+Generator_System_const_iterator::Generator_System_const_iterator()
+  : i(), gsp(0) {
+}
+
+inline
+Generator_System_const_iterator::Generator_System_const_iterator(const Generator_System_const_iterator& y)
+  : i(y.i), gsp(y.gsp) {
+}
+
+inline
+Generator_System_const_iterator::~Generator_System_const_iterator() {
+}
+
+inline
+Generator_System_const_iterator&
+Generator_System_const_iterator::operator=(const Generator_System_const_iterator& y) {
+  i = y.i;
+  gsp = y.gsp;
+  return *this;
+}
+
+inline const Generator&
+Generator_System_const_iterator::operator*() const {
+  return *i;
+}
+
+inline const Generator*
+Generator_System_const_iterator::operator->() const {
+  return i.operator->();
+}
+
+inline Generator_System_const_iterator&
+Generator_System_const_iterator::operator++() {
+  ++i;
+  if (!gsp->is_necessarily_closed())
+    skip_forward();
+  return *this;
+}
+
+inline Generator_System_const_iterator
+Generator_System_const_iterator::operator++(int) {
+  const Generator_System_const_iterator tmp = *this;
+  operator++();
+  return tmp;
+}
+
+inline bool
+Generator_System_const_iterator::operator==(const Generator_System_const_iterator& y) const {
+  return i == y.i;
+}
+
+inline bool
+Generator_System_const_iterator::operator!=(const Generator_System_const_iterator& y) const {
+  return i != y.i;
+}
+
+inline
+Generator_System_const_iterator::
+Generator_System_const_iterator(const Linear_System<Generator>::const_iterator& iter,
+                                const Generator_System& gs)
+  : i(iter), gsp(&gs.sys) {
+}
+
+inline bool
+Generator_System::empty() const {
+  return sys.has_no_rows();
+}
+
+inline bool
+Generator_System::has_no_rows() const {
+  return sys.has_no_rows();
+}
+
+inline Generator_System::const_iterator
+Generator_System::begin() const {
+  const_iterator i(sys.begin(), *this);
+  if (!sys.is_necessarily_closed())
+    i.skip_forward();
+  return i;
+}
+
+inline Generator_System::const_iterator
+Generator_System::end() const {
+  const const_iterator i(sys.end(), *this);
+  return i;
+}
+
+inline const Generator_System&
+Generator_System::zero_dim_univ() {
+  PPL_ASSERT(zero_dim_univ_p != 0);
+  return *zero_dim_univ_p;
+}
+
+inline void
+Generator_System::m_swap(Generator_System& y) {
+  swap(sys, y.sys);
+}
+
+inline memory_size_type
+Generator_System::external_memory_in_bytes() const {
+  return sys.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Generator_System::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+inline void
+Generator_System::simplify() {
+  sys.simplify();
+  remove_invalid_lines_and_rays();
+}
+
+/*! \relates Generator_System */
+inline void
+swap(Generator_System& x, Generator_System& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Generator_System_inlines_hh)
diff --git a/src/Generator_System_types.hh b/src/Generator_System_types.hh
new file mode 100644
index 0000000..f368654
--- /dev/null
+++ b/src/Generator_System_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Generator_System_types_hh
+#define PPL_Generator_System_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Generator_System;
+class Generator_System_const_iterator;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Generator_System_types_hh)
diff --git a/src/Generator_defs.hh b/src/Generator_defs.hh
new file mode 100644
index 0000000..5bb204c
--- /dev/null
+++ b/src/Generator_defs.hh
@@ -0,0 +1,1033 @@
+/* Generator class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Generator_defs_hh
+#define PPL_Generator_defs_hh 1
+
+#include "Generator_types.hh"
+#include "Scalar_Products_types.hh"
+#include "Variables_Set_types.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_System_types.hh"
+#include "Congruence_System_types.hh"
+#include "Polyhedron_types.hh"
+#include "Grid_Generator_types.hh"
+#include "Grid_Generator_System_types.hh"
+#include "MIP_Problem_types.hh"
+#include "Grid_types.hh"
+
+#include "Variable_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Checked_Number_defs.hh"
+#include "distances_defs.hh"
+#include "Topology_types.hh"
+#include "Expression_Hide_Last_defs.hh"
+#include "Expression_Hide_Inhomo_defs.hh"
+
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+// Put them in the namespace here to declare them friend later.
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The basic comparison function.
+/*! \relates Generator
+  \return
+  The returned absolute value can be \f$0\f$, \f$1\f$ or \f$2\f$.
+
+  \param x
+  A row of coefficients;
+
+  \param y
+  Another row.
+
+  Compares \p x and \p y, where \p x and \p y may be of different size,
+  in which case the "missing" coefficients are assumed to be zero.
+  The comparison is such that:
+  -# equalities are smaller than inequalities;
+  -# lines are smaller than points and rays;
+  -# the ordering is lexicographic;
+  -# the positions compared are, in decreasing order of significance,
+     1, 2, ..., \p size(), 0;
+  -# the result is negative, zero, or positive if x is smaller than,
+     equal to, or greater than y, respectively;
+  -# when \p x and \p y are different, the absolute value of the
+     result is 1 if the difference is due to the coefficient in
+     position 0; it is 2 otherwise.
+
+  When \p x and \p y represent the hyper-planes associated
+  to two equality or inequality constraints, the coefficient
+  at 0 is the known term.
+  In this case, the return value can be characterized as follows:
+  - -2, if \p x is smaller than \p y and they are \e not parallel;
+  - -1, if \p x is smaller than \p y and they \e are parallel;
+  -  0, if \p x and y are equal;
+  - +1, if \p y is smaller than \p x and they \e are parallel;
+  - +2, if \p y is smaller than \p x and they are \e not parallel.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+int compare(const Generator& x, const Generator& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Generator */
+std::ostream& operator<<(std::ostream& s, const Generator& g);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Generator */
+void swap(Generator& x, Generator& y);
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! A line, ray, point or closure point.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Generator is one of the following:
+
+  - a line \f$\vect{l} = (a_0, \ldots, a_{n-1})^\transpose\f$;
+
+  - a ray \f$\vect{r} = (a_0, \ldots, a_{n-1})^\transpose\f$;
+
+  - a point
+    \f$\vect{p} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
+
+  - a closure point
+    \f$\vect{c} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
+
+  where \f$n\f$ is the dimension of the space
+  and, for points and closure points, \f$d > 0\f$ is the divisor.
+
+  \par A note on terminology.
+  As observed in Section \ref representation, there are cases when,
+  in order to represent a polyhedron \f$\cP\f$ using the generator system
+  \f$\cG = (L, R, P, C)\f$, we need to include in the finite set
+  \f$P\f$ even points of \f$\cP\f$ that are <EM>not</EM> vertices
+  of \f$\cP\f$.
+  This situation is even more frequent when working with NNC polyhedra
+  and it is the reason why we prefer to use the word `point'
+  where other libraries use the word `vertex'.
+
+  \par How to build a generator.
+  Each type of generator is built by applying the corresponding
+  function (<CODE>line</CODE>, <CODE>ray</CODE>, <CODE>point</CODE>
+  or <CODE>closure_point</CODE>) to a linear expression,
+  representing a direction in the space;
+  the space dimension of the generator is defined as the space dimension
+  of the corresponding linear expression.
+  Linear expressions used to define a generator should be homogeneous
+  (any constant term will be simply ignored).
+  When defining points and closure points, an optional Coefficient argument
+  can be used as a common <EM>divisor</EM> for all the coefficients
+  occurring in the provided linear expression;
+  the default value for this argument is 1.
+
+  \par
+  In all the following examples it is assumed that variables
+  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
+  are defined as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable z(2);
+  \endcode
+
+  \par Example 1
+  The following code builds a line with direction \f$x-y-z\f$
+  and having space dimension \f$3\f$:
+  \code
+  Generator l = line(x - y - z);
+  \endcode
+  As mentioned above, the constant term of the linear expression
+  is not relevant. Thus, the following code has the same effect:
+  \code
+  Generator l = line(x - y - z + 15);
+  \endcode
+  By definition, the origin of the space is not a line, so that
+  the following code throws an exception:
+  \code
+  Generator l = line(0*x);
+  \endcode
+
+  \par Example 2
+  The following code builds a ray with the same direction as the
+  line in Example 1:
+  \code
+  Generator r = ray(x - y - z);
+  \endcode
+  As is the case for lines, when specifying a ray the constant term
+  of the linear expression is not relevant; also, an exception is thrown
+  when trying to build a ray from the origin of the space.
+
+  \par Example 3
+  The following code builds the point
+  \f$\vect{p} = (1, 0, 2)^\transpose \in \Rset^3\f$:
+  \code
+  Generator p = point(1*x + 0*y + 2*z);
+  \endcode
+  The same effect can be obtained by using the following code:
+  \code
+  Generator p = point(x + 2*z);
+  \endcode
+  Similarly, the origin \f$\vect{0} \in \Rset^3\f$ can be defined
+  using either one of the following lines of code:
+  \code
+  Generator origin3 = point(0*x + 0*y + 0*z);
+  Generator origin3_alt = point(0*z);
+  \endcode
+  Note however that the following code would have defined
+  a different point, namely \f$\vect{0} \in \Rset^2\f$:
+  \code
+  Generator origin2 = point(0*y);
+  \endcode
+  The following two lines of code both define the only point
+  having space dimension zero, namely \f$\vect{0} \in \Rset^0\f$.
+  In the second case we exploit the fact that the first argument
+  of the function <CODE>point</CODE> is optional.
+  \code
+  Generator origin0 = Generator::zero_dim_point();
+  Generator origin0_alt = point();
+  \endcode
+
+  \par Example 4
+  The point \f$\vect{p}\f$ specified in Example 3 above
+  can also be obtained with the following code,
+  where we provide a non-default value for the second argument
+  of the function <CODE>point</CODE> (the divisor):
+  \code
+  Generator p = point(2*x + 0*y + 4*z, 2);
+  \endcode
+  Obviously, the divisor can be usefully exploited to specify
+  points having some non-integer (but rational) coordinates.
+  For instance, the point
+  \f$\vect{q} = (-1.5, 3.2, 2.1)^\transpose \in \Rset^3\f$
+  can be specified by the following code:
+  \code
+  Generator q = point(-15*x + 32*y + 21*z, 10);
+  \endcode
+  If a zero divisor is provided, an exception is thrown.
+
+  \par Example 5
+  Closure points are specified in the same way we defined points,
+  but invoking their specific constructor function.
+  For instance, the closure point
+  \f$\vect{c} = (1, 0, 2)^\transpose \in \Rset^3\f$ is defined by
+  \code
+  Generator c = closure_point(1*x + 0*y + 2*z);
+  \endcode
+  For the particular case of the (only) closure point
+  having space dimension zero, we can use any of the following:
+  \code
+  Generator closure_origin0 = Generator::zero_dim_closure_point();
+  Generator closure_origin0_alt = closure_point();
+  \endcode
+
+  \par How to inspect a generator
+  Several methods are provided to examine a generator and extract
+  all the encoded information: its space dimension, its type and
+  the value of its integer coefficients.
+
+  \par Example 6
+  The following code shows how it is possible to access each single
+  coefficient of a generator.
+  If <CODE>g1</CODE> is a point having coordinates
+  \f$(a_0, \ldots, a_{n-1})^\transpose\f$,
+  we construct the closure point <CODE>g2</CODE> having coordinates
+  \f$(a_0, 2 a_1, \ldots, (i+1)a_i, \ldots, n a_{n-1})^\transpose\f$.
+  \code
+  if (g1.is_point()) {
+    cout << "Point g1: " << g1 << endl;
+    Linear_Expression e;
+    for (dimension_type i = g1.space_dimension(); i-- > 0; )
+      e += (i + 1) * g1.coefficient(Variable(i)) * Variable(i);
+    Generator g2 = closure_point(e, g1.divisor());
+    cout << "Closure point g2: " << g2 << endl;
+  }
+  else
+    cout << "Generator g1 is not a point." << endl;
+  \endcode
+  Therefore, for the point
+  \code
+  Generator g1 = point(2*x - y + 3*z, 2);
+  \endcode
+  we would obtain the following output:
+  \code
+  Point g1: p((2*A - B + 3*C)/2)
+  Closure point g2: cp((2*A - 2*B + 9*C)/2)
+  \endcode
+  When working with (closure) points, be careful not to confuse
+  the notion of <EM>coefficient</EM> with the notion of <EM>coordinate</EM>:
+  these are equivalent only when the divisor of the (closure) point is 1.
+*/
+class Parma_Polyhedra_Library::Generator {
+public:
+
+  //! The representation used for new Generators.
+  /*!
+    \note The copy constructor and the copy constructor with specified size
+          use the representation of the original object, so that it is
+          indistinguishable from the original object.
+  */
+  static const Representation default_representation = SPARSE;
+
+  //! Returns the line of direction \p e.
+  /*!
+    \exception std::invalid_argument
+    Thrown if the homogeneous part of \p e represents the origin of
+    the vector space.
+  */
+  static Generator line(const Linear_Expression& e,
+                        Representation r = default_representation);
+
+  //! Returns the ray of direction \p e.
+  /*!
+    \exception std::invalid_argument
+    Thrown if the homogeneous part of \p e represents the origin of
+    the vector space.
+  */
+  static Generator ray(const Linear_Expression& e,
+                       Representation r = default_representation);
+
+  //! Returns the point at \p e / \p d.
+  /*!
+    Both \p e and \p d are optional arguments, with default values
+    Linear_Expression::zero() and Coefficient_one(), respectively.
+
+    \exception std::invalid_argument
+    Thrown if \p d is zero.
+  */
+  static Generator point(const Linear_Expression& e
+                         = Linear_Expression::zero(),
+                         Coefficient_traits::const_reference d
+                         = Coefficient_one(),
+                         Representation r = default_representation);
+
+  //! Returns the origin.
+  static Generator point(Representation r);
+
+  //! Returns the point at \p e.
+  static Generator point(const Linear_Expression& e,
+                         Representation r);
+
+  //! Constructs the point at the origin.
+  explicit Generator(Representation r = default_representation);
+
+  //! Returns the closure point at \p e / \p d.
+  /*!
+    Both \p e and \p d are optional arguments, with default values
+    Linear_Expression::zero() and Coefficient_one(), respectively.
+
+    \exception std::invalid_argument
+    Thrown if \p d is zero.
+  */
+  static Generator
+  closure_point(const Linear_Expression& e = Linear_Expression::zero(),
+                Coefficient_traits::const_reference d = Coefficient_one(),
+                Representation r = default_representation);
+
+  //! Returns the closure point at the origin.
+  static Generator
+  closure_point(Representation r);
+
+  //! Returns the closure point at \p e.
+  static Generator
+  closure_point(const Linear_Expression& e, Representation r);
+
+  //! Ordinary copy constructor.
+  //! The representation of the new Generator will be the same as g.
+  Generator(const Generator& g);
+
+  //! Copy constructor with given representation.
+  Generator(const Generator& g, Representation r);
+
+  //! Copy constructor with given space dimension.
+  //! The representation of the new Generator will be the same as g.
+  Generator(const Generator& g, dimension_type space_dim);
+
+  //! Copy constructor with given representation and space dimension.
+  Generator(const Generator& g, dimension_type space_dim, Representation r);
+
+  //! Destructor.
+  ~Generator();
+
+  //! Assignment operator.
+  Generator& operator=(const Generator& g);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Generator can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Sets the dimension of the vector space enclosing \p *this to
+  //! \p space_dim .
+  void set_space_dimension(dimension_type space_dim);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Removes all the specified dimensions from the generator.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+
+    If all dimensions with nonzero coefficients are removed from a ray or a
+    line, it is changed into a point and this method returns \p false .
+    Otherwise, it returns \p true .
+  */
+  bool remove_space_dimensions(const Variables_Set& vars);
+
+  //! Permutes the space dimensions of the generator.
+  /*!
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! The generator type.
+  enum Type {
+    /*! The generator is a line. */
+    LINE,
+    /*! The generator is a ray. */
+    RAY,
+    /*! The generator is a point. */
+    POINT,
+    /*! The generator is a closure point. */
+    CLOSURE_POINT
+  };
+
+  //! Returns the generator type of \p *this.
+  Type type() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a line.
+  bool is_line() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a ray.
+  bool is_ray() const;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! Returns <CODE>true</CODE> if and only if \p *this is a line or a ray.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool is_line_or_ray() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a point.
+  bool is_point() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a closure point.
+  bool is_closure_point() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  /*!
+    \exception std::invalid_argument
+    Thrown if the index of \p v is greater than or equal to the
+    space dimension of \p *this.
+  */
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! If \p *this is either a point or a closure point, returns its divisor.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this is neither a point nor a closure point.
+  */
+  Coefficient_traits::const_reference divisor() const;
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  //! Returns the origin of the zero-dimensional space \f$\Rset^0\f$.
+  static const Generator& zero_dim_point();
+
+  /*! \brief
+    Returns, as a closure point,
+    the origin of the zero-dimensional space \f$\Rset^0\f$.
+  */
+  static const Generator& zero_dim_closure_point();
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y
+    are equivalent generators.
+
+    Generators having different space dimensions are not equivalent.
+  */
+  bool is_equivalent_to(const Generator& y) const;
+
+  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
+  /*!
+    This is faster than is_equivalent_to(), but it may return `false' even
+    for equivalent generators.
+  */
+  bool is_equal_to(const Generator& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Generator& y);
+
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> >
+  expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
+
+private:
+  //! The possible kinds of Generator objects.
+  enum Kind {
+    LINE_OR_EQUALITY = 0,
+    RAY_OR_POINT_OR_INEQUALITY = 1
+  };
+
+  //! The linear expression encoding \p *this.
+  Linear_Expression expr;
+
+  //! The kind of \p *this.
+  Kind kind_;
+
+  //! The topology of \p *this.
+  Topology topology_;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the origin of the zero-dimensional space \f$\Rset^0\f$.
+  */
+  static const Generator* zero_dim_point_p;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the origin of the zero-dimensional space \f$\Rset^0\f$, as a closure point.
+  */
+  static const Generator* zero_dim_closure_point_p;
+
+  /*! \brief
+    Builds a generator of type \p type and topology \p topology,
+    stealing the coefficients from \p e.
+
+    If the topology is NNC, the last dimension of \p e is used as the epsilon
+    coefficient.
+  */
+  Generator(Linear_Expression& e, Type type, Topology topology);
+
+  Generator(Linear_Expression& e, Kind kind, Topology topology);
+
+  Generator(dimension_type space_dim, Kind kind, Topology topology,
+            Representation r = default_representation);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row
+    represents a line or an equality.
+  */
+  bool is_line_or_equality() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row
+    represents a ray, a point or an inequality.
+  */
+  bool is_ray_or_point_or_inequality() const;
+
+  //! Sets to \p LINE_OR_EQUALITY the kind of \p *this row.
+  void set_is_line_or_equality();
+
+  //! Sets to \p RAY_OR_POINT_OR_INEQUALITY the kind of \p *this row.
+  void set_is_ray_or_point_or_inequality();
+
+  //! \name Flags inspection methods
+  //@{
+  //! Returns the topological kind of \p *this.
+  Topology topology() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the topology
+    of \p *this row is not necessarily closed.
+  */
+  bool is_not_necessarily_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the topology
+    of \p *this row is necessarily closed.
+  */
+  bool is_necessarily_closed() const;
+  //@} // Flags inspection methods
+
+  //! \name Flags coercion methods
+  //@{
+
+  //! Sets to \p x the topological kind of \p *this row.
+  void set_topology(Topology x);
+
+  //! Sets to \p NECESSARILY_CLOSED the topological kind of \p *this row.
+  void set_necessarily_closed();
+
+  //! Sets to \p NOT_NECESSARILY_CLOSED the topological kind of \p *this row.
+  void set_not_necessarily_closed();
+  //@} // Flags coercion methods
+
+  //! Marks the epsilon dimension as a standard dimension.
+  /*!
+    The row topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is increased by 1.
+  */
+  void mark_as_necessarily_closed();
+
+  //! Marks the last dimension as the epsilon dimension.
+  /*!
+    The row topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is decreased by 1.
+  */
+  void mark_as_not_necessarily_closed();
+
+  //! Linearly combines \p *this with \p y so that i-th coefficient is 0.
+  /*!
+    \param y
+    The Generator that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting Generator to \p *this and normalizes it.
+  */
+  void linear_combine(const Generator& y, dimension_type i);
+
+  //! Sets the dimension of the vector space enclosing \p *this to
+  //! \p space_dim .
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  /*!
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid objects.
+  */
+  void set_space_dimension_no_ok(dimension_type space_dim);
+
+  /*! \brief
+    Throw a <CODE>std::invalid_argument</CODE> exception
+    containing the appropriate error message.
+  */
+  void
+  throw_dimension_incompatible(const char* method,
+                               const char* v_name,
+                               Variable v) const;
+
+  /*! \brief
+    Throw a <CODE>std::invalid_argument</CODE> exception
+    containing the appropriate error message.
+  */
+  void
+  throw_invalid_argument(const char* method, const char* reason) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is not a line.
+  bool is_ray_or_point() const;
+
+  //! Sets the Generator kind to <CODE>LINE_OR_EQUALITY</CODE>.
+  void set_is_line();
+
+  //! Sets the Generator kind to <CODE>RAY_OR_POINT_OR_INEQUALITY</CODE>.
+  void set_is_ray_or_point();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the closure point
+    \p *this has the same \e coordinates of the point \p p.
+
+    It is \e assumed that \p *this is a closure point, \p p is a point
+    and both topologies and space dimensions agree.
+  */
+  bool is_matching_closure_point(const Generator& p) const;
+
+  //! Returns the epsilon coefficient. The generator must be NNC.
+  Coefficient_traits::const_reference epsilon_coefficient() const;
+
+  //! Sets the epsilon coefficient to \p n. The generator must be NNC.
+  void set_epsilon_coefficient(Coefficient_traits::const_reference n);
+
+  /*! \brief
+    Normalizes the sign of the coefficients so that the first non-zero
+    (homogeneous) coefficient of a line-or-equality is positive.
+  */
+  void sign_normalize();
+
+  /*! \brief
+    Strong normalization: ensures that different Generator objects
+    represent different hyperplanes or hyperspaces.
+
+    Applies both Generator::normalize() and Generator::sign_normalize().
+  */
+  void strong_normalize();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the coefficients are
+    strongly normalized.
+  */
+  bool check_strong_normalized() const;
+
+  /*! \brief
+    A print function, with fancy, more human-friendly output.
+
+    This is used by operator<<().
+  */
+  void fancy_print(std::ostream& s) const;
+
+  friend class Expression_Adapter<Generator>;
+  friend class Linear_System<Generator>;
+  friend class Parma_Polyhedra_Library::Scalar_Products;
+  friend class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Sign;
+  friend class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Assign;
+  friend class Parma_Polyhedra_Library::Generator_System;
+  friend class Parma_Polyhedra_Library::Generator_System_const_iterator;
+  // FIXME: the following friend declaration should be avoided.
+  friend class Parma_Polyhedra_Library::Polyhedron;
+  // This is for access to Linear_Expression in `insert'.
+  friend class Parma_Polyhedra_Library::Grid_Generator_System;
+  friend class Parma_Polyhedra_Library::MIP_Problem;
+  friend class Parma_Polyhedra_Library::Grid;
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream& s,
+                                                    const Generator& g);
+
+  friend int
+  compare(const Generator& x, const Generator& y);
+};
+
+
+namespace Parma_Polyhedra_Library {
+
+//! Shorthand for Generator::line(const Linear_Expression& e, Representation r).
+/*! \relates Generator */
+Generator line(const Linear_Expression& e,
+               Representation r = Generator::default_representation);
+
+//! Shorthand for Generator::ray(const Linear_Expression& e, Representation r).
+/*! \relates Generator */
+Generator ray(const Linear_Expression& e,
+              Representation r = Generator::default_representation);
+
+/*! \brief
+  Shorthand for
+  Generator::point(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
+
+  \relates Generator
+*/
+Generator
+point(const Linear_Expression& e = Linear_Expression::zero(),
+      Coefficient_traits::const_reference d = Coefficient_one(),
+      Representation r = Generator::default_representation);
+
+//! Shorthand for Generator::point(Representation r).
+/*! \relates Generator */
+Generator
+point(Representation r);
+
+/*! \brief
+  Shorthand for
+  Generator::point(const Linear_Expression& e, Representation r).
+
+  \relates Generator
+*/
+Generator
+point(const Linear_Expression& e, Representation r);
+
+/*! \brief
+  Shorthand for
+  Generator::closure_point(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
+
+  \relates Generator
+*/
+Generator
+closure_point(const Linear_Expression& e = Linear_Expression::zero(),
+              Coefficient_traits::const_reference d = Coefficient_one(),
+              Representation r = Generator::default_representation);
+
+//! Shorthand for Generator::closure_point(Representation r).
+/*! \relates Generator */
+Generator
+closure_point(Representation r);
+
+/*! \brief
+  Shorthand for
+  Generator::closure_point(const Linear_Expression& e, Representation r).
+
+  \relates Generator
+*/
+Generator
+closure_point(const Linear_Expression& e, Representation r);
+
+//! Returns <CODE>true</CODE> if and only if \p x is equivalent to \p y.
+/*! \relates Generator */
+bool operator==(const Generator& x, const Generator& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x is not equivalent to \p y.
+/*! \relates Generator */
+bool operator!=(const Generator& x, const Generator& y);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Generator
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename To>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Generator& x,
+                                 const Generator& y,
+                                 Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Generator
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename Temp, typename To>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Generator& x,
+                                 const Generator& y,
+                                 Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Generator
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename Temp, typename To>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Generator& x,
+                                 const Generator& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Generator
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename To>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const Generator& x,
+                               const Generator& y,
+                               Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Generator
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename Temp, typename To>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Generator& x,
+                                 const Generator& y,
+                                 Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Generator
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename Temp, typename To>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const Generator& x,
+                               const Generator& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Generator
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename To>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const Generator& x,
+                                const Generator& y,
+                                Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Generator
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename Temp, typename To>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const Generator& x,
+                                const Generator& y,
+                                Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Generator
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+
+  \note
+  Distances are \e only defined between generators that are points and/or
+  closure points; for rays or lines, \c false is returned.
+*/
+template <typename Temp, typename To>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const Generator& x,
+                                const Generator& y,
+                                Rounding_Dir dir,
+                                Temp& tmp0,
+                                Temp& tmp1,
+                                Temp& tmp2);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Generator */
+std::ostream& operator<<(std::ostream& s, const Generator::Type& t);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Generator_inlines.hh"
+
+#endif // !defined(PPL_Generator_defs_hh)
diff --git a/src/Generator_inlines.hh b/src/Generator_inlines.hh
new file mode 100644
index 0000000..8de552b
--- /dev/null
+++ b/src/Generator_inlines.hh
@@ -0,0 +1,709 @@
+/* Generator class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Generator_inlines_hh
+#define PPL_Generator_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline bool
+Generator::is_necessarily_closed() const {
+  return (topology() == NECESSARILY_CLOSED);
+}
+
+inline bool
+Generator::is_not_necessarily_closed() const {
+  return (topology() == NOT_NECESSARILY_CLOSED);
+}
+
+inline Generator::expr_type
+Generator::expression() const {
+  return expr_type(expr, is_not_necessarily_closed());
+}
+
+inline dimension_type
+Generator::space_dimension() const {
+  return expression().space_dimension();
+}
+
+inline bool
+Generator::is_line_or_equality() const {
+  return (kind_ == LINE_OR_EQUALITY);
+}
+
+inline bool
+Generator::is_ray_or_point_or_inequality() const {
+  return (kind_ == RAY_OR_POINT_OR_INEQUALITY);
+}
+
+inline Topology
+Generator::topology() const {
+  return topology_;
+}
+
+inline void
+Generator::set_is_line_or_equality() {
+  kind_ = LINE_OR_EQUALITY;
+}
+
+inline void
+Generator::set_is_ray_or_point_or_inequality() {
+  kind_ = RAY_OR_POINT_OR_INEQUALITY;
+}
+
+inline void
+Generator::set_topology(Topology x) {
+  if (topology() == x)
+    return;
+  if (topology() == NECESSARILY_CLOSED) {
+    // Add a column for the epsilon dimension.
+    expr.set_space_dimension(expr.space_dimension() + 1);
+  }
+  else {
+    PPL_ASSERT(expr.space_dimension() > 0);
+    expr.set_space_dimension(expr.space_dimension() - 1);
+  }
+  topology_ = x;
+}
+
+inline void
+Generator::mark_as_necessarily_closed() {
+  PPL_ASSERT(is_not_necessarily_closed());
+  topology_ = NECESSARILY_CLOSED;
+}
+
+inline void
+Generator::mark_as_not_necessarily_closed() {
+  PPL_ASSERT(is_necessarily_closed());
+  topology_ = NOT_NECESSARILY_CLOSED;
+}
+
+inline void
+Generator::set_necessarily_closed() {
+  set_topology(NECESSARILY_CLOSED);
+}
+
+inline void
+Generator::set_not_necessarily_closed() {
+  set_topology(NOT_NECESSARILY_CLOSED);
+}
+
+inline
+Generator::Generator(Representation r)
+  : expr(r),
+    kind_(RAY_OR_POINT_OR_INEQUALITY),
+    topology_(NECESSARILY_CLOSED) {
+  expr.set_inhomogeneous_term(Coefficient_one());
+  PPL_ASSERT(space_dimension() == 0);
+  PPL_ASSERT(OK());
+}
+
+inline
+Generator::Generator(dimension_type space_dim, Kind kind, Topology topology,
+                     Representation r)
+  : expr(r),
+    kind_(kind),
+    topology_(topology) {
+  if (is_necessarily_closed())
+    expr.set_space_dimension(space_dim);
+  else
+    expr.set_space_dimension(space_dim + 1);
+  PPL_ASSERT(space_dimension() == space_dim);
+  PPL_ASSERT(OK());
+}
+
+inline
+Generator::Generator(Linear_Expression& e, Type type, Topology topology)
+  : topology_(topology) {
+  PPL_ASSERT(type != CLOSURE_POINT || topology == NOT_NECESSARILY_CLOSED);
+  swap(expr, e);
+  if (topology == NOT_NECESSARILY_CLOSED)
+    expr.set_space_dimension(expr.space_dimension() + 1);
+  if (type == LINE)
+    kind_ = LINE_OR_EQUALITY;
+  else
+    kind_ = RAY_OR_POINT_OR_INEQUALITY;
+  strong_normalize();
+}
+
+inline
+Generator::Generator(Linear_Expression& e, Kind kind, Topology topology)
+  : kind_(kind),
+    topology_(topology) {
+  swap(expr, e);
+  if (topology == NOT_NECESSARILY_CLOSED)
+    expr.set_space_dimension(expr.space_dimension() + 1);
+  strong_normalize();
+}
+
+inline
+Generator::Generator(const Generator& g)
+  : expr(g.expr),
+    kind_(g.kind_),
+    topology_(g.topology_) {
+}
+
+inline
+Generator::Generator(const Generator& g, Representation r)
+  : expr(g.expr, r),
+    kind_(g.kind_),
+    topology_(g.topology_) {
+  // This does not assert OK() because it's called by OK().
+  PPL_ASSERT(OK());
+}
+
+inline
+Generator::Generator(const Generator& g, dimension_type space_dim)
+  : expr(g.expr, g.is_necessarily_closed() ? space_dim : (space_dim + 1)),
+    kind_(g.kind_),
+    topology_(g.topology_) {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(space_dimension() == space_dim);
+}
+
+inline
+Generator::Generator(const Generator& g, dimension_type space_dim,
+                     Representation r)
+  : expr(g.expr, g.is_necessarily_closed() ? space_dim : (space_dim + 1), r),
+    kind_(g.kind_),
+    topology_(g.topology_) {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(space_dimension() == space_dim);
+}
+
+inline
+Generator::~Generator() {
+}
+
+inline Generator&
+Generator::operator=(const Generator& g) {
+  Generator tmp = g;
+  swap(*this, tmp);
+
+  return *this;
+}
+
+inline Representation
+Generator::representation() const {
+  return expr.representation();
+}
+
+inline void
+Generator::set_representation(Representation r) {
+  expr.set_representation(r);
+}
+
+inline dimension_type
+Generator::max_space_dimension() {
+  return Linear_Expression::max_space_dimension();
+}
+
+inline void
+Generator::set_space_dimension_no_ok(dimension_type space_dim) {
+  const dimension_type old_expr_space_dim = expr.space_dimension();
+  if (topology() == NECESSARILY_CLOSED) {
+    expr.set_space_dimension(space_dim);
+  }
+  else {
+    const dimension_type old_space_dim = space_dimension();
+    if (space_dim > old_space_dim) {
+      expr.set_space_dimension(space_dim + 1);
+      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
+    }
+    else {
+      expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
+      expr.set_space_dimension(space_dim + 1);
+    }
+  }
+  PPL_ASSERT(space_dimension() == space_dim);
+  if (expr.space_dimension() < old_expr_space_dim)
+    strong_normalize();
+}
+
+inline void
+Generator::set_space_dimension(dimension_type space_dim) {
+  set_space_dimension_no_ok(space_dim);
+  PPL_ASSERT(OK());
+}
+
+inline void
+Generator::shift_space_dimensions(Variable v, dimension_type n) {
+  expr.shift_space_dimensions(v, n);
+}
+
+inline bool
+Generator::is_line() const {
+  return is_line_or_equality();
+}
+
+inline bool
+Generator::is_ray_or_point() const {
+  return is_ray_or_point_or_inequality();
+}
+
+inline bool
+Generator::is_line_or_ray() const {
+  return expr.inhomogeneous_term() == 0;
+}
+
+inline bool
+Generator::is_ray() const {
+  return is_ray_or_point() && is_line_or_ray();
+}
+
+inline Generator::Type
+Generator::type() const {
+  if (is_line())
+    return LINE;
+  if (is_line_or_ray())
+    return RAY;
+  if (is_necessarily_closed())
+    return POINT;
+  else {
+    // Checking the value of the epsilon coefficient.
+    if (epsilon_coefficient() == 0)
+      return CLOSURE_POINT;
+    else
+      return POINT;
+  }
+}
+
+inline bool
+Generator::is_point() const {
+  return type() == POINT;
+}
+
+inline bool
+Generator::is_closure_point() const {
+  return type() == CLOSURE_POINT;
+}
+
+inline void
+Generator::set_is_line() {
+  set_is_line_or_equality();
+}
+
+inline void
+Generator::set_is_ray_or_point() {
+  set_is_ray_or_point_or_inequality();
+}
+
+inline Coefficient_traits::const_reference
+Generator::coefficient(const Variable v) const {
+  if (v.space_dimension() > space_dimension())
+    throw_dimension_incompatible("coefficient(v)", "v", v);
+  return expr.coefficient(v);
+}
+
+inline Coefficient_traits::const_reference
+Generator::divisor() const {
+  Coefficient_traits::const_reference d = expr.inhomogeneous_term();
+  if (!is_ray_or_point() || d == 0)
+    throw_invalid_argument("divisor()",
+                           "*this is neither a point nor a closure point");
+  return d;
+}
+
+inline Coefficient_traits::const_reference
+Generator::epsilon_coefficient() const {
+  PPL_ASSERT(is_not_necessarily_closed());
+  return expr.coefficient(Variable(expr.space_dimension() - 1));
+}
+
+
+inline void
+Generator::set_epsilon_coefficient(Coefficient_traits::const_reference n) {
+  PPL_ASSERT(is_not_necessarily_closed());
+  expr.set_coefficient(Variable(expr.space_dimension() - 1), n);
+}
+
+
+inline memory_size_type
+Generator::external_memory_in_bytes() const {
+  return expr.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Generator::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline void
+Generator::strong_normalize() {
+  expr.normalize();
+  sign_normalize();
+}
+
+inline const Generator&
+Generator::zero_dim_point() {
+  PPL_ASSERT(zero_dim_point_p != 0);
+  return *zero_dim_point_p;
+}
+
+inline const Generator&
+Generator::zero_dim_closure_point() {
+  PPL_ASSERT(zero_dim_closure_point_p != 0);
+  return *zero_dim_closure_point_p;
+}
+
+/*! \relates Generator */
+inline Generator
+line(const Linear_Expression& e, Representation r) {
+  return Generator::line(e, r);
+}
+
+/*! \relates Generator */
+inline Generator
+ray(const Linear_Expression& e, Representation r) {
+  return Generator::ray(e, r);
+}
+
+/*! \relates Generator */
+inline Generator
+point(const Linear_Expression& e, Coefficient_traits::const_reference d,
+      Representation r) {
+  return Generator::point(e, d, r);
+}
+
+/*! \relates Generator */
+inline Generator
+point(Representation r) {
+  return Generator::point(r);
+}
+
+/*! \relates Generator */
+inline Generator
+point(const Linear_Expression& e, Representation r) {
+  return Generator::point(e, r);
+}
+
+/*! \relates Generator */
+inline Generator
+closure_point(const Linear_Expression& e,
+              Coefficient_traits::const_reference d,
+              Representation r) {
+  return Generator::closure_point(e, d, r);
+}
+
+/*! \relates Generator */
+inline Generator
+closure_point(Representation r) {
+  return Generator::closure_point(r);
+}
+
+/*! \relates Generator */
+inline Generator
+closure_point(const Linear_Expression& e,
+              Representation r) {
+  return Generator::closure_point(e, r);
+}
+
+/*! \relates Generator */
+inline bool
+operator==(const Generator& x, const Generator& y) {
+  return x.is_equivalent_to(y);
+}
+
+/*! \relates Generator */
+inline bool
+operator!=(const Generator& x, const Generator& y) {
+  return !x.is_equivalent_to(y);
+}
+
+inline void
+Generator::ascii_dump(std::ostream& s) const {
+
+  expr.ascii_dump(s);
+
+  s << " ";
+  
+  switch (type()) {
+  case Generator::LINE:
+    s << "L ";
+    break;
+  case Generator::RAY:
+    s << "R ";
+    break;
+  case Generator::POINT:
+    s << "P ";
+    break;
+  case Generator::CLOSURE_POINT:
+    s << "C ";
+    break;
+  }
+  if (is_necessarily_closed())
+    s << "(C)";
+  else
+    s << "(NNC)";
+  s << "\n";
+}
+
+inline bool
+Generator::ascii_load(std::istream& s) {
+  std::string str;
+
+  expr.ascii_load(s);
+
+  if (!(s >> str))
+    return false;
+  if (str == "L")
+    set_is_line();
+  else if (str == "R" || str == "P" || str == "C")
+    set_is_ray_or_point();
+  else
+    return false;
+
+  std::string str2;
+
+  if (!(s >> str2))
+    return false;
+  if (str2 == "(C)") {
+    if (is_not_necessarily_closed())
+      // TODO: Avoid using the mark_as_*() methods if possible.
+      mark_as_necessarily_closed();
+  }
+  else {
+    if (str2 == "(NNC)") {
+      if (is_necessarily_closed())
+        // TODO: Avoid using the mark_as_*() methods if possible.
+        mark_as_not_necessarily_closed();
+    }
+    else
+      return false;
+  }
+
+  // Checking for equality of actual and declared types.
+  switch (type()) {
+  case Generator::LINE:
+    if (str != "L")
+      return false;
+    break;
+  case Generator::RAY:
+    if (str != "R")
+      return false;
+    break;
+  case Generator::POINT:
+    if (str != "P")
+      return false;
+    break;
+  case Generator::CLOSURE_POINT:
+    if (str != "C")
+      return false;
+    break;
+  }
+
+  return true;
+}
+
+inline void
+Generator::m_swap(Generator& y) {
+  using std::swap;
+  swap(expr, y.expr);
+  swap(kind_, y.kind_);
+  swap(topology_, y.topology_);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Generator */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Specialization, typename Temp, typename To>
+inline bool
+l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                    const Generator& x,
+                    const Generator& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0,
+                    Temp& tmp1,
+                    Temp& tmp2) {
+  // Generator kind compatibility check: we only compute distances
+  // between (closure) points.
+  if (x.is_line_or_ray() || y.is_line_or_ray())
+    return false;
+  const dimension_type x_space_dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (x_space_dim != y.space_dimension())
+    return false;
+
+  // All zero-dim generators have distance zero.
+  if (x_space_dim == 0) {
+    assign_r(r, 0, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  PPL_DIRTY_TEMP(mpq_class, x_coord);
+  PPL_DIRTY_TEMP(mpq_class, y_coord);
+  PPL_DIRTY_TEMP(mpq_class, x_div);
+  PPL_DIRTY_TEMP(mpq_class, y_div);
+  assign_r(x_div, x.divisor(), ROUND_NOT_NEEDED);
+  assign_r(y_div, y.divisor(), ROUND_NOT_NEEDED);
+
+  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
+  // TODO: This loop can be optimized more, if needed.
+  for (dimension_type i = x_space_dim; i-- > 0; ) {
+    assign_r(x_coord, x.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+    div_assign_r(x_coord, x_coord, x_div, ROUND_NOT_NEEDED);
+    assign_r(y_coord, y.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+    div_assign_r(y_coord, y_coord, y_div, ROUND_NOT_NEEDED);
+    const Temp* tmp1p;
+    const Temp* tmp2p;
+
+    if (x_coord > y_coord) {
+      maybe_assign(tmp1p, tmp1, x_coord, dir);
+      maybe_assign(tmp2p, tmp2, y_coord, inverse(dir));
+    }
+    else {
+      maybe_assign(tmp1p, tmp1, y_coord, dir);
+      maybe_assign(tmp2p, tmp2, x_coord, inverse(dir));
+    }
+    sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
+    PPL_ASSERT(sgn(tmp1) >= 0);
+    Specialization::combine(tmp0, tmp1, dir);
+  }
+  Specialization::finalize(tmp0, dir);
+  assign_r(r, tmp0, dir);
+  return true;
+}
+
+/*! \relates Generator */
+template <typename Temp, typename To>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Generator& x,
+                            const Generator& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
+  return l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >
+    (r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Generator */
+template <typename Temp, typename To>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Generator& x,
+                            const Generator& y,
+                            const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Generator */
+template <typename To>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Generator& x,
+                            const Generator& y,
+                            const Rounding_Dir dir) {
+  return rectilinear_distance_assign<To, To>(r, x, y, dir);
+}
+
+/*! \relates Generator */
+template <typename Temp, typename To>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Generator& x,
+                          const Generator& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
+  return l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >
+    (r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Generator */
+template <typename Temp, typename To>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Generator& x,
+                          const Generator& y,
+                          const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Generator */
+template <typename To>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Generator& x,
+                          const Generator& y,
+                          const Rounding_Dir dir) {
+  return euclidean_distance_assign<To, To>(r, x, y, dir);
+}
+
+/*! \relates Generator */
+template <typename Temp, typename To>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Generator& x,
+                           const Generator& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
+  return l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >
+    (r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Generator */
+template <typename Temp, typename To>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Generator& x,
+                           const Generator& y,
+                           const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Generator */
+template <typename To>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Generator& x,
+                           const Generator& y,
+                           const Rounding_Dir dir) {
+  return l_infinity_distance_assign<To, To>(r, x, y, dir);
+}
+
+/*! \relates Generator */
+inline void
+swap(Generator& x, Generator& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Generator_inlines_hh)
diff --git a/src/Generator_types.hh b/src/Generator_types.hh
new file mode 100644
index 0000000..f2a7178
--- /dev/null
+++ b/src/Generator_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Generator_types_hh
+#define PPL_Generator_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Generator;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Generator_types_hh)
diff --git a/src/Grid.defs.hh b/src/Grid.defs.hh
deleted file mode 100644
index a53a204..0000000
--- a/src/Grid.defs.hh
+++ /dev/null
@@ -1,2665 +0,0 @@
-/* Grid class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_defs_hh
-#define PPL_Grid_defs_hh 1
-
-#include "Grid.types.hh"
-#include "globals.defs.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.types.hh"
-#include "Linear_Expression.defs.hh"
-#include "Constraint.types.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
-#include "Grid_Generator_System.defs.hh"
-#include "Grid_Generator_System.inlines.hh"
-#include "Grid_Generator.types.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "Grid_Certificate.types.hh"
-#include "Box.types.hh"
-#include "Polyhedron.types.hh"
-#include "BD_Shape.types.hh"
-#include "Octagonal_Shape.types.hh"
-#include <vector>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Grid
-  Writes a textual representation of \p gr on \p s: <CODE>false</CODE>
-  is written if \p gr is an empty grid; <CODE>true</CODE> is written
-  if \p gr is a universe grid; a minimized system of congruences
-  defining \p gr is written otherwise, all congruences in one row
-  separated by ", "s.
-*/
-std::ostream&
-operator<<(std::ostream& s, const Grid& gr);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Grid */
-void swap(Grid& x, Grid& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x and \p y are the same
-  grid.
-
-  \relates Grid
-  Note that \p x and \p y may be dimension-incompatible grids: in
-  those cases, the value <CODE>false</CODE> is returned.
-*/
-bool operator==(const Grid& x, const Grid& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x and \p y are different
-  grids.
-
-  \relates Grid
-  Note that \p x and \p y may be dimension-incompatible grids: in
-  those cases, the value <CODE>true</CODE> is returned.
-*/
-bool operator!=(const Grid& x, const Grid& y);
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! A grid.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Grid represents a rational grid.
-
-  The domain of grids <EM>optimally supports</EM>:
-    - all (proper and non-proper) congruences;
-    - tautological and inconsistent constraints;
-    - linear equality constraints (i.e., non-proper congruences).
-
-  Depending on the method, using a constraint that is not optimally
-  supported by the domain will either raise an exception or
-  result in a (possibly non-optimal) upward approximation.
-
-  The domain of grids support a concept of double description similar
-  to the one developed for polyhedra: hence, a grid can be specified
-  as either a finite system of congruences or a finite system of
-  generators (see Section \ref sect_rational_grids) and it is always
-  possible to obtain either representation.
-  That is, if we know the system of congruences, we can obtain
-  from this a system of generators that define the same grid
-  and vice versa.
-  These systems can contain redundant members, or they can be in the
-  minimal form.
-
-  A key attribute of any grid is its space dimension (the dimension
-  \f$n \in \Nset\f$ of the enclosing vector space):
-
-  - all grids, the empty ones included, are endowed with a space
-    dimension;
-  - most operations working on a grid and another object (another
-    grid, a congruence, a generator, a set of variables, etc.) will
-    throw an exception if the grid and the object are not
-    dimension-compatible (see Section \ref Grid_Space_Dimensions);
-  - the only ways in which the space dimension of a grid can be
-    changed are with <EM>explicit</EM> calls to operators provided for
-    that purpose, and with standard copy, assignment and swap
-    operators.
-
-  Note that two different grids can be defined on the zero-dimension
-  space: the empty grid and the universe grid \f$R^0\f$.
-
-  \par
-  In all the examples it is assumed that variables
-  <CODE>x</CODE> and <CODE>y</CODE> are defined (where they are
-  used) as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  \endcode
-
-  \par Example 1
-  The following code builds a grid corresponding to the even integer
-  pairs in \f$\Rset^2\f$, given as a system of congruences:
-  \code
-  Congruence_System cgs;
-  cgs.insert((x %= 0) / 2);
-  cgs.insert((y %= 0) / 2);
-  Grid gr(cgs);
-  \endcode
-  The following code builds the same grid as above, but starting
-  from a system of generators specifying three of the points:
-  \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(0*x + 0*y));
-  gs.insert(grid_point(0*x + 2*y));
-  gs.insert(grid_point(2*x + 0*y));
-  Grid gr(gs);
-  \endcode
-
-  \par Example 2
-  The following code builds a grid corresponding to a line in
-  \f$\Rset^2\f$ by adding a single congruence to the universe grid:
-  \code
-  Congruence_System cgs;
-  cgs.insert(x - y == 0);
-  Grid gr(cgs);
-  \endcode
-  The following code builds the same grid as above, but starting
-  from a system of generators specifying a point and a line:
-  \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(0*x + 0*y));
-  gs.insert(grid_line(x + y));
-  Grid gr(gs);
-  \endcode
-
-  \par Example 3
-  The following code builds a grid corresponding to the integral
-  points on the line \f$x = y\f$ in \f$\Rset^2\f$ constructed
-  by adding an equality and congruence to the universe grid:
-  \code
-  Congruence_System cgs;
-  cgs.insert(x - y == 0);
-  cgs.insert(x %= 0);
-  Grid gr(cgs);
-  \endcode
-  The following code builds the same grid as above, but starting
-  from a system of generators specifying a point and a parameter:
-  \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(0*x + 0*y));
-  gs.insert(parameter(x + y));
-  Grid gr(gs);
-  \endcode
-
-  \par Example 4
-  The following code builds the grid corresponding to a plane by
-  creating the universe grid in \f$\Rset^2\f$:
-  \code
-  Grid gr(2);
-  \endcode
-  The following code builds the same grid as above, but starting
-  from the empty grid in \f$\Rset^2\f$ and inserting the appropriate
-  generators (a point, and two lines).
-  \code
-  Grid gr(2, EMPTY);
-  gr.add_grid_generator(grid_point(0*x + 0*y));
-  gr.add_grid_generator(grid_line(x));
-  gr.add_grid_generator(grid_line(y));
-  \endcode
-  Note that a generator system must contain a point when describing
-  a grid.  To ensure that this is always the case it is required
-  that the first generator inserted in an empty grid is a point
-  (otherwise, an exception is thrown).
-
-  \par Example 5
-  The following code shows the use of the function
-  <CODE>add_space_dimensions_and_embed</CODE>:
-  \code
-  Grid gr(1);
-  gr.add_congruence(x == 2);
-  gr.add_space_dimensions_and_embed(1);
-  \endcode
-  We build the universe grid in the 1-dimension space \f$\Rset\f$.
-  Then we add a single equality congruence,
-  thus obtaining the grid corresponding to the singleton set
-  \f$\{ 2 \} \sseq \Rset\f$.
-  After the last line of code, the resulting grid is
-  \f[
-  \bigl\{\,
-  (2, y)^\transpose \in \Rset^2
-  \bigm|
-  y \in \Rset
-  \,\bigr\}.
-  \f]
-
-  \par Example 6
-  The following code shows the use of the function
-  <CODE>add_space_dimensions_and_project</CODE>:
-  \code
-  Grid gr(1);
-  gr.add_congruence(x == 2);
-  gr.add_space_dimensions_and_project(1);
-  \endcode
-  The first two lines of code are the same as in Example 4 for
-  <CODE>add_space_dimensions_and_embed</CODE>.
-  After the last line of code, the resulting grid is
-  the singleton set
-  \f$\bigl\{ (2, 0)^\transpose \bigr\} \sseq \Rset^2\f$.
-
-  \par Example 7
-  The following code shows the use of the function
-  <CODE>affine_image</CODE>:
-  \code
-  Grid gr(2, EMPTY);
-  gr.add_grid_generator(grid_point(0*x + 0*y));
-  gr.add_grid_generator(grid_point(4*x + 0*y));
-  gr.add_grid_generator(grid_point(0*x + 2*y));
-  Linear_Expression expr = x + 3;
-  gr.affine_image(x, expr);
-  \endcode
-  In this example the starting grid is all the pairs of \f$x\f$ and
-  \f$y\f$ in \f$\Rset^2\f$ where \f$x\f$ is an integer multiple of 4
-  and \f$y\f$ is an integer multiple of 2.  The considered variable
-  is \f$x\f$ and the affine expression is \f$x+3\f$.  The resulting
-  grid is the given grid translated 3 integers to the right (all the
-  pairs \f$(x, y)\f$ where \f$x\f$ is -1 plus an integer multiple of 4
-  and \f$y\f$ is an integer multiple of 2).
-  Moreover, if the affine transformation for the same variable \p x
-  is instead \f$x+y\f$:
-  \code
-  Linear_Expression expr = x + y;
-  \endcode
-  the resulting grid is every second integral point along the \f$x=y\f$
-  line, with this line of points repeated at every fourth integral value
-  along the \f$x\f$ axis.
-  Instead, if we do not use an invertible transformation for the
-  same variable; for example, the affine expression \f$y\f$:
-  \code
-  Linear_Expression expr = y;
-  \endcode
-  the resulting grid is every second point along the \f$x=y\f$ line.
-
-  \par Example 8
-  The following code shows the use of the function
-  <CODE>affine_preimage</CODE>:
-  \code
-  Grid gr(2, EMPTY);
-  gr.add_grid_generator(grid_point(0*x + 0*y));
-  gr.add_grid_generator(grid_point(4*x + 0*y));
-  gr.add_grid_generator(grid_point(0*x + 2*y));
-  Linear_Expression expr = x + 3;
-  gr.affine_preimage(x, expr);
-  \endcode
-  In this example the starting grid, \p var and the affine
-  expression and the denominator are the same as in Example 6, while
-  the resulting grid is similar but translated 3 integers to the
-  left (all the pairs \f$(x, y)\f$
-  where \f$x\f$ is -3 plus an integer multiple of 4 and
-  \f$y\f$ is an integer multiple of 2)..
-  Moreover, if the affine transformation for \p x is \f$x+y\f$
-  \code
-  Linear_Expression expr = x + y;
-  \endcode
-  the resulting grid is a similar grid to the result in Example 6,
-  only the grid is slanted along \f$x=-y\f$.
-  Instead, if we do not use an invertible transformation for the same
-  variable \p x, for example, the affine expression \f$y\f$:
-  \code
-  Linear_Expression expr = y;
-  \endcode
-  the resulting grid is every fourth line parallel to the \f$x\f$
-  axis.
-
-  \par Example 9
-  For this example we also use the variables:
-  \code
-  Variable z(2);
-  Variable w(3);
-  \endcode
-  The following code shows the use of the function
-  <CODE>remove_space_dimensions</CODE>:
-  \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(3*x + y +0*z + 2*w));
-  Grid gr(gs);
-  Variables_Set vars;
-  vars.insert(y);
-  vars.insert(z);
-  gr.remove_space_dimensions(vars);
-  \endcode
-  The starting grid is the singleton set
-  \f$\bigl\{ (3, 1, 0, 2)^\transpose \bigr\} \sseq \Rset^4\f$, while
-  the resulting grid is
-  \f$\bigl\{ (3, 2)^\transpose \bigr\} \sseq \Rset^2\f$.
-  Be careful when removing space dimensions <EM>incrementally</EM>:
-  since dimensions are automatically renamed after each application
-  of the <CODE>remove_space_dimensions</CODE> operator, unexpected
-  results can be obtained.
-  For instance, by using the following code we would obtain
-  a different result:
-  \code
-  set<Variable> vars1;
-  vars1.insert(y);
-  gr.remove_space_dimensions(vars1);
-  set<Variable> vars2;
-  vars2.insert(z);
-  gr.remove_space_dimensions(vars2);
-  \endcode
-  In this case, the result is the grid
-  \f$\bigl\{(3, 0)^\transpose \bigr\} \sseq \Rset^2\f$:
-  when removing the set of dimensions \p vars2
-  we are actually removing variable \f$w\f$ of the original grid.
-  For the same reason, the operator \p remove_space_dimensions
-  is not idempotent: removing twice the same non-empty set of dimensions
-  is never the same as removing them just once.
-*/
-
-class Parma_Polyhedra_Library::Grid {
-public:
-  //! The numeric type of coefficients.
-  typedef Coefficient coefficient_type;
-
-  //! Returns the maximum space dimension all kinds of Grid can handle.
-  static dimension_type max_space_dimension();
-
-  /*! \brief
-    Returns true indicating that this domain has methods that
-    can recycle congruences.
-  */
-  static bool can_recycle_congruence_systems();
-
-  /*! \brief
-    Returns true indicating that this domain has methods that
-    can recycle constraints.
-  */
-  static bool can_recycle_constraint_systems();
-
-  //! Builds a grid having the specified properties.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the grid;
-
-    \param kind
-    Specifies whether the universe or the empty grid has to be built.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Grid(dimension_type num_dimensions = 0,
-		Degenerate_Element kind = UNIVERSE);
-
-  //! Builds a grid, copying a system of congruences.
-  /*!
-    The grid inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences defining the grid.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Grid(const Congruence_System& cgs);
-
-  //! Builds a grid, recycling a system of congruences.
-  /*!
-    The grid inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences defining the grid.  Its data-structures
-    may be recycled to build the grid.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  Grid(Congruence_System& cgs, Recycle_Input dummy);
-
-  //! Builds a grid, copying a system of constraints.
-  /*!
-    The grid inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints defining the grid.
-
-    \exception std::invalid_argument
-    Thrown if the constraint system \p cs contains inequality constraints.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Grid(const Constraint_System& cs);
-
-  //! Builds a grid, recycling a system of constraints.
-  /*!
-    The grid inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints defining the grid.  Its data-structures
-    may be recycled to build the grid.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the constraint system \p cs contains inequality constraints.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  Grid(Constraint_System& cs, Recycle_Input dummy);
-
-  //! Builds a grid, copying a system of grid generators.
-  /*!
-    The grid inherits the space dimension of the generator system.
-
-    \param ggs
-    The system of generators defining the grid.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Grid(const Grid_Generator_System& ggs);
-
-  //! Builds a grid, recycling a system of grid generators.
-  /*!
-    The grid inherits the space dimension of the generator system.
-
-    \param ggs
-    The system of generators defining the grid.  Its data-structures
-    may be recycled to build the grid.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space dimension.
-  */
-  Grid(Grid_Generator_System& ggs, Recycle_Input dummy);
-
-  //! Builds a grid out of a box.
-  /*!
-    The grid inherits the space dimension of the box.
-    The built grid is the most precise grid that includes the box.
-
-    \param box
-    The box representing the grid to be built.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename Interval>
-  explicit Grid(const Box<Interval>& box,
-                Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a grid out of a bounded-difference shape.
-  /*!
-    The grid inherits the space dimension of the BDS.
-    The built grid is the most precise grid that includes the BDS.
-
-    \param bd
-    The BDS representing the grid to be built.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p bd exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename U>
-  explicit Grid(const BD_Shape<U>& bd,
-                Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a grid out of an octagonal shape.
-  /*!
-    The grid inherits the space dimension of the octagonal shape.
-    The built grid is the most precise grid that includes the octagonal shape.
-
-    \param os
-    The octagonal shape representing the grid to be built.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p os exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename U>
-  explicit Grid(const Octagonal_Shape<U>& os,
-                Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    Builds a grid from a polyhedron using algorithms whose complexity
-    does not exceed the one specified by \p complexity.
-    If \p complexity is \p ANY_COMPLEXITY, then the grid built is the
-    smallest one containing \p ph.
-
-    The grid inherits the space dimension of polyhedron.
-
-    \param ph
-    The polyhedron.
-
-    \param complexity
-    The complexity class.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Grid(const Polyhedron& ph,
-                Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  Grid(const Grid& y,
-       Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator.  (\p *this and \p y can be
-    dimension-incompatible.)
-  */
-  Grid& operator=(const Grid& y);
-
-  //! \name Member Functions that Do Not Modify the Grid
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns \f$0\f$, if \p *this is empty; otherwise, returns
-    the \ref Grid_Affine_Dimension "affine dimension" of \p *this.
-  */
-  dimension_type affine_dimension() const;
-
-  /*! \brief
-    Returns a system of equality constraints satisfied by \p *this
-    with the same affine dimension as \p *this.
-  */
-  Constraint_System constraints() const;
-
-  /*! \brief
-    Returns a minimal system of equality constraints satisfied by
-    \p *this with the same affine dimension as \p *this.
-  */
-  Constraint_System minimized_constraints() const;
-
-  //! Returns the system of congruences.
-  const Congruence_System& congruences() const;
-
-  //! Returns the system of congruences in minimal form.
-  const Congruence_System& minimized_congruences() const;
-
-  //! Returns the system of generators.
-  const Grid_Generator_System& grid_generators() const;
-
-  //! Returns the minimized system of generators.
-  const Grid_Generator_System& minimized_grid_generators() const;
-
-  //! Returns the relations holding between \p *this and \p cg.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  // FIXME: Poly_Con_Relation seems to encode exactly what we want
-  // here.  We must find a new name for that class.  Temporarily,
-  // we keep using it without changing the name.
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  //! Returns the relations holding between \p *this and \p g.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  // FIXME: see the comment for Poly_Con_Relation above.
-  Poly_Gen_Relation
-  relation_with(const Grid_Generator& g) const;
-
-  //! Returns the relations holding between \p *this and \p g.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  // FIXME: see the comment for Poly_Con_Relation above.
-  Poly_Gen_Relation
-  relation_with(const Generator& g) const;
-
-  //! Returns the relations holding between \p *this and \p c.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  // FIXME: Poly_Con_Relation seems to encode exactly what we want
-  // here.  We must find a new name for that class.  Temporarily,
-  // we keep using it without changing the name.
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  //! Returns \c true if and only if \p *this is an empty grid.
-  bool is_empty() const;
-
-  //! Returns \c true if and only if \p *this is a universe grid.
-  bool is_universe() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is a
-    topologically closed subset of the vector space.
-
-    A grid is always topologically closed.
-  */
-  bool is_topologically_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y are
-    disjoint.
-
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are dimension-incompatible.
-  */
-  bool is_disjoint_from(const Grid& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
-  /*!
-    A grid is discrete if it can be defined by a generator system which
-    contains only points and parameters.  This includes the empty grid
-    and any grid in dimension zero.
-  */
-  bool is_discrete() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is bounded.
-  bool is_bounded() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains at least one integer point.
-  */
-  bool contains_integer_point() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  bool constrains(Variable var) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
-  /*!
-    This method is the same as bounds_from_below.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
-  /*!
-    This method is the same as bounds_from_above.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from above in \p *this, in which case the
-    supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if the supremum value can be reached in \p this.
-    Always <CODE>true</CODE> when \p this bounds \p expr.  Present for
-    interface compatibility with class Polyhedron, where closure
-    points can result in a value of false.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded by \p *this,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d and \p
-    maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from above in \p *this, in which case the
-    supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if the supremum value can be reached in \p this.
-    Always <CODE>true</CODE> when \p this bounds \p expr.  Present for
-    interface compatibility with class Polyhedron, where closure
-    points can result in a value of false;
-
-    \param point
-    When maximization succeeds, will be assigned a point where \p expr
-    reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded by \p *this,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p point are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& point) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from below in \p *this, in which case the
-    infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if the is the infimum value can be reached in \p
-    this.  Always <CODE>true</CODE> when \p this bounds \p expr.
-    Present for interface compatibility with class Polyhedron, where
-    closure points can result in a value of false.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from below in \p *this, in which case the
-    infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if the is the infimum value can be reached in \p
-    this.  Always <CODE>true</CODE> when \p this bounds \p expr.
-    Present for interface compatibility with class Polyhedron, where
-    closure points can result in a value of false;
-
-    \param point
-    When minimization succeeds, will be assigned a point where \p expr
-    reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p point are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& point) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \ref Grid_Frequency "frequency" for \p *this with respect to \p expr
-    is defined, in which case the frequency and the value for \p expr
-    that is closest to zero are computed.
-
-    \param expr
-    The linear expression for which the frequency is needed;
-
-    \param freq_n
-    The numerator of the maximum frequency of \p expr;
-
-    \param freq_d
-    The denominator of the maximum frequency of \p expr;
-
-    \param val_n
-    The numerator of them value of \p expr at a point in the grid
-    that is closest to zero;
-
-    \param val_d
-    The denominator of a value of \p expr at a point in the grid
-    that is closest to zero;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or frequency is undefined with respect to \p expr,
-    then <CODE>false</CODE> is returned and \p freq_n, \p freq_d,
-    \p val_n and \p val_d are left untouched.
-  */
-  bool frequency(const Linear_Expression& expr,
-                 Coefficient& freq_n, Coefficient& freq_d,
-                 Coefficient& val_n, Coefficient& val_d) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool contains(const Grid& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this strictly
-    contains \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool strictly_contains(const Grid& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  /*!
-    \return
-    <CODE>true</CODE> if and only if \p *this satisfies all the
-    invariants and either \p check_not_empty is <CODE>false</CODE> or
-    \p *this is not empty.
-
-    \param check_not_empty
-    <CODE>true</CODE> if and only if, in addition to checking the
-    invariants, \p *this must be checked to be not empty.
-
-    The check is performed so as to intrude as little as possible.  If
-    the library has been compiled with run-time assertions enabled,
-    error messages are written on <CODE>std::cerr</CODE> in case
-    invariants are violated. This is useful for the purpose of
-    debugging the library.
-  */
-  bool OK(bool check_not_empty = false) const;
-
-  //@} // Member Functions that Do Not Modify the Grid
-
-  //! \name Space Dimension Preserving Member Functions that May Modify the Grid
-  //@{
-
-  //! Adds a copy of congruence \p cg to \p *this.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are
-    dimension-incompatible.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Adds a copy of grid generator \p g to the system of generators of
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible,
-    or if \p *this is an empty grid and \p g is not a point.
-  */
-  void add_grid_generator(const Grid_Generator& g);
-
-  //! Adds a copy of each congruence in \p cgs to \p *this.
-  /*!
-    \param cgs
-    Contains the congruences that will be added to the system of
-    congruences of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  //! Adds the congruences in \p cgs to *this.
-  /*!
-    \param cgs
-    The congruence system to be added to \p *this.  The congruences in
-    \p cgs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-
-    \warning
-    The only assumption that can be made about \p cgs upon successful
-    or exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_congruences(Congruence_System& cgs);
-
-  /*! \brief
-    Adds to \p *this a congruence equivalent to constraint \p c.
-
-    \param c
-    The constraint to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible
-    or if constraint \p c is not optimally supported by the grid domain.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds to \p *this congruences equivalent to the constraints in \p cs.
-
-    \param cs
-    The constraints to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible
-    or if \p cs contains a constraint which is not optimally supported
-    by the grid domain.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Adds to \p *this congruences equivalent to the constraints in \p cs.
-
-    \param cs
-    The constraints to be added. They may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible
-    or if \p cs contains a constraint which is not optimally supported
-    by the grid domain.
-
-    \warning
-    The only assumption that can be made about \p cs upon successful
-    or exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_constraints(Constraint_System& cs);
-
-  //! Uses a copy of the congruence \p cg to refine \p *this.
-  /*!
-    \param cg
-    The congruence used.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
- //! Uses a copy of the congruences in \p cgs to refine \p *this.
-  /*!
-    \param cgs
-    The congruences used.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  //! Uses a copy of the constraint \p c to refine \p *this.
-  /*!
-
-    \param c
-    The constraint used. If it is not an equality, it will be ignored
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  //! Uses a copy of the constraints in \p cs to refine \p *this.
-  /*!
-    \param cs
-    The constraints used. Constraints that are not equalities are ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Adds a copy of the generators in \p gs to the system of generators
-    of \p *this.
-
-    \param gs
-    Contains the generators that will be added to the system of
-    generators of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p gs are dimension-incompatible, or if
-    \p *this is empty and the system of generators \p gs is not empty,
-    but has no points.
-  */
-  void add_grid_generators(const Grid_Generator_System& gs);
-
-  /*! \brief
-    Adds the generators in \p gs to the system of generators of \p
-    *this.
-
-    \param gs
-    The generator system to be added to \p *this.  The generators in
-    \p gs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p gs are dimension-incompatible.
-
-    \warning
-    The only assumption that can be made about \p gs upon successful
-    or exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_grid_generators(Grid_Generator_System& gs);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  /*! \brief
-    Assigns to \p *this the intersection of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void intersection_assign(const Grid& y);
-
-  /*! \brief
-    Assigns to \p *this the least upper bound of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void upper_bound_assign(const Grid& y);
-
-  /*! \brief
-    If the upper bound of \p *this and \p y is exact it is assigned to \p
-    *this and <CODE>true</CODE> is returned, otherwise
-    <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool upper_bound_assign_if_exact(const Grid& y);
-
-  /*! \brief
-    Assigns to \p *this the \ref Convex_Polyhedral_Difference "grid-difference"
-    of \p *this and \p y.
-
-    The grid difference between grids x and y is the smallest grid
-    containing all the points from x and y that are only in x.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void difference_assign(const Grid& y);
-
-  /*! \brief
-    Assigns to \p *this a \ref Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-    If \c false is returned, then the intersection is empty.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool simplify_using_context_assign(const Grid& y);
-
-  /*! \brief
-    Assigns to \p *this the \ref Grid_Affine_Transformation
-    "affine image" of \p
-    *this under the function mapping variable \p var to the affine
-    expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of
-    \p *this.
-
-    \if Include_Implementation_Details
-
-    When considering the generators of a grid, the
-    affine transformation
-    \f[
-      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{\mathrm{denominator}}
-    \f]
-    is assigned to \p var where \p expr is
-    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
-    (\f$b\f$ is the inhomogeneous term).
-
-    If congruences are up-to-date, it uses the specialized function
-    affine_preimage() (for the system of congruences)
-    and inverse transformation to reach the same result.
-    To obtain the inverse transformation we use the following observation.
-
-    Observation:
-    -# The affine transformation is invertible if the coefficient
-       of \p var in this transformation (i.e., \f$a_\mathrm{var}\f$)
-       is different from zero.
-    -# If the transformation is invertible, then we can write
-       \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
-	   = a_\mathrm{var} x_\mathrm{var}
-	     + \sum_{i \neq var} a_i x_i + b,
-       \f]
-       so that the inverse transformation is
-       \f[
-	 a_\mathrm{var} x_\mathrm{var}
-           = \mathrm{denominator} * {x'}_\mathrm{var}
-             - \sum_{i \neq j} a_i x_i - b.
-       \f]
-
-    Then, if the transformation is invertible, all the entities that
-    were up-to-date remain up-to-date. Otherwise only generators remain
-    up-to-date.
-
-    \endif
-  */
-  void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		    = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the \ref Grid_Affine_Transformation
-    "affine preimage" of
-    \p *this under the function mapping variable \p var to the affine
-    expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is substituted;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this.
-
-    \if Include_Implementation_Details
-
-    When considering congruences of a grid, the affine transformation
-    \f[
-      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{denominator},
-    \f]
-    is assigned to \p var where \p expr is
-    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
-    (\f$b\f$ is the inhomogeneous term).
-
-    If generators are up-to-date, then the specialized function
-    affine_image() is used (for the system of generators)
-    and inverse transformation to reach the same result.
-    To obtain the inverse transformation, we use the following observation.
-
-    Observation:
-    -# The affine transformation is invertible if the coefficient
-       of \p var in this transformation (i.e. \f$a_\mathrm{var}\f$)
-       is different from zero.
-    -# If the transformation is invertible, then we can write
-       \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
-           = a_\mathrm{var} x_\mathrm{var}
-               + \sum_{i \neq \mathrm{var}} a_i x_i + b,
-       \f],
-       the inverse transformation is
-       \f[
-	 a_\mathrm{var} x_\mathrm{var}
-           = \mathrm{denominator} * {x'}_\mathrm{var}
-               - \sum_{i \neq j} a_i x_i - b.
-       \f].
-
-    Then, if the transformation is invertible, all the entities that
-    were up-to-date remain up-to-date. Otherwise only congruences remain
-    up-to-date.
-
-    \endif
-  */
-  void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to
-    the \ref Grid_Generalized_Image "generalized affine relation"
-    \f$\mathrm{var}' = \frac{\mathrm{expr}}{\mathrm{denominator}}
-    \pmod{\mathrm{modulus}}\f$.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol where EQUAL is the symbol for a congruence
-    relation;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression.
-    Optional argument with an automatic value of one;
-
-    \param modulus
-    The modulus of the congruence lhs %= rhs.  A modulus of zero
-    indicates lhs == rhs.  Optional argument with an automatic value
-    of zero.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p
-    *this.
-  */
-  void
-  generalized_affine_image(Variable var,
-			   Relation_Symbol relsym,
-			   const Linear_Expression& expr,
-			   Coefficient_traits::const_reference denominator
-			   = Coefficient_one(),
-			   Coefficient_traits::const_reference modulus
-			   = Coefficient_zero());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Grid_Generalized_Image "generalized affine relation"
-    \f$\mathrm{var}' = \frac{\mathrm{expr}}{\mathrm{denominator}}
-    \pmod{\mathrm{modulus}}\f$.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol where EQUAL is the symbol for a congruence
-    relation;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression.
-    Optional argument with an automatic value of one;
-
-    \param modulus
-    The modulus of the congruence lhs %= rhs.  A modulus of zero
-    indicates lhs == rhs.  Optional argument with an automatic value
-    of zero.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p
-    *this.
-  */
-  void
-  generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one(),
-			      Coefficient_traits::const_reference modulus
-			      = Coefficient_zero());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to
-    the \ref Grid_Generalized_Image "generalized affine relation"
-    \f$\mathrm{lhs}' = \mathrm{rhs} \pmod{\mathrm{modulus}}\f$.
-
-    \param lhs
-    The left hand side affine expression.
-
-    \param relsym
-    The relation symbol where EQUAL is the symbol for a congruence
-    relation;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \param modulus
-    The modulus of the congruence lhs %= rhs.  A modulus of zero
-    indicates lhs == rhs.  Optional argument with an automatic value
-    of zero.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p
-    rhs.
-  */
-  void
-  generalized_affine_image(const Linear_Expression& lhs,
-			   Relation_Symbol relsym,
-			   const Linear_Expression& rhs,
-			   Coefficient_traits::const_reference modulus
-			   = Coefficient_zero());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Grid_Generalized_Image "generalized affine relation"
-    \f$\mathrm{lhs}' = \mathrm{rhs} \pmod{\mathrm{modulus}}\f$.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol where EQUAL is the symbol for a congruence
-    relation;
-
-    \param rhs
-    The right hand side affine expression;
-
-    \param modulus
-    The modulus of the congruence lhs %= rhs.  A modulus of zero
-    indicates lhs == rhs.  Optional argument with an automatic value
-    of zero.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p
-    rhs.
-  */
-  void
-  generalized_affine_preimage(const Linear_Expression& lhs,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& rhs,
-			      Coefficient_traits::const_reference modulus
-			      = Coefficient_zero());
-
-  /*!
-    \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
-
-  /*!
-    \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the result of computing the \ref Grid_Time_Elapse
-    "time-elapse" between \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void time_elapse_assign(const Grid& y);
-
-  /*! \brief
-    \ref Wrapping_Operator "Wraps" the specified dimensions of the
-    vector space.
-
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be wrapped.
-
-    \param w
-    The width of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param r
-    The representation of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param o
-    The overflow behavior of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param cs_p
-    Possibly null pointer to a constraint system.
-    This argument is for compatibility with wrap_assign()
-    for the other domains and only checked for dimension-compatibility.
-
-    \param complexity_threshold
-    A precision parameter of the \ref Wrapping_Operator "wrapping operator".
-    This argument is for compatibility with wrap_assign()
-    for the other domains and is ignored.
-
-    \param wrap_individually
-    <CODE>true</CODE> if the dimensions should be wrapped individually.
-    As wrapping dimensions collectively does not improve the precision,
-    this argument is ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars or with <CODE>*cs_p</CODE>.
-
-    \warning
-    It is assumed that variables in \p Vars represent integers.  Thus,
-    where the extra cost is negligible, the integrality of these
-    variables is enforced; possibly causing a non-integral grid to
-    become empty.
-  */
-  void wrap_assign(const Variables_Set& vars,
-                   Bounded_Integer_Type_Width w,
-                   Bounded_Integer_Type_Representation r,
-                   Bounded_Integer_Type_Overflow o,
-                   const Constraint_System* cs_p = 0,
-                   unsigned complexity_threshold = 16,
-                   bool wrap_individually = true);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping all points with non-integer
-    coordinates.
-
-    \param complexity
-    This argument is ignored as the algorithm used has polynomial
-    complexity.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping all points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    This argument is ignored as the algorithm used has polynomial
-    complexity.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  /*! \brief
-    Assigns to \p *this the result of computing the \ref Grid_Widening
-    "Grid widening" between \p *this and \p y using congruence systems.
-
-    \param y
-    A grid that <EM>must</EM> be contained in \p *this;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void congruence_widening_assign(const Grid& y, unsigned* tp = NULL);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the \ref Grid_Widening
-    "Grid widening" between \p *this and \p y using generator systems.
-
-    \param y
-    A grid that <EM>must</EM> be contained in \p *this;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void generator_widening_assign(const Grid& y, unsigned* tp = NULL);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the \ref Grid_Widening
-    "Grid widening" between \p *this and \p y.
-
-    This widening uses either the congruence or generator systems
-    depending on which of the systems describing x and y
-    are up to date and minimized.
-
-    \param y
-    A grid that <EM>must</EM> be contained in \p *this;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void widening_assign(const Grid& y, unsigned* tp = NULL);
-
-  /*! \brief
-    Improves the result of the congruence variant of
-    \ref Grid_Widening "Grid widening" computation by also enforcing
-    those congruences in \p cgs that are satisfied by all the points
-    of \p *this.
-
-    \param y
-    A grid that <EM>must</EM> be contained in \p *this;
-
-    \param cgs
-    The system of congruences used to improve the widened grid;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
-  */
-  void limited_congruence_extrapolation_assign(const Grid& y,
-					       const Congruence_System& cgs,
-					       unsigned* tp = NULL);
-
-  /*! \brief
-    Improves the result of the generator variant of the
-    \ref Grid_Widening "Grid widening"
-    computation by also enforcing those congruences in \p cgs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    A grid that <EM>must</EM> be contained in \p *this;
-
-    \param cgs
-    The system of congruences used to improve the widened grid;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
-  */
-  void limited_generator_extrapolation_assign(const Grid& y,
-					      const Congruence_System& cgs,
-					      unsigned* tp = NULL);
-
-  /*! \brief
-    Improves the result of the \ref Grid_Widening "Grid widening"
-    computation by also enforcing those congruences in \p cgs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    A grid that <EM>must</EM> be contained in \p *this;
-
-    \param cgs
-    The system of congruences used to improve the widened grid;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
-  */
-  void limited_extrapolation_assign(const Grid& y,
-				    const Congruence_System& cgs,
-				    unsigned* tp = NULL);
-
-  //@} // Space Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  /*! \brief
-    \ref Adding_New_Dimensions_to_the_Vector_Space "Adds"
-    \p m new space dimensions and embeds the old grid in the new
-    vector space.
-
-    \param m
-    The number of dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the vector
-    space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    The new space dimensions will be those having the highest indexes
-    in the new grid, which is characterized by a system of congruences
-    in which the variables which are the new dimensions can have any
-    value.  For instance, when starting from the grid \f$\cL \sseq
-    \Rset^2\f$ and adding a third space dimension, the result will be
-    the grid
-    \f[
-      \bigl\{\,
-        (x, y, z)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cL
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    \ref Adding_New_Dimensions_to_the_Vector_Space "Adds"
-    \p m new space dimensions to the grid and does not embed it
-    in the new vector space.
-
-    \param m
-    The number of space dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    The new space dimensions will be those having the highest indexes
-    in the new grid, which is characterized by a system of congruences
-    in which the variables running through the new dimensions are all
-    constrained to be equal to 0.  For instance, when starting from
-    the grid \f$\cL \sseq \Rset^2\f$ and adding a third space
-    dimension, the result will be the grid
-    \f[
-      \bigl\{\,
-        (x, y, 0)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cL
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  /*! \brief
-    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation" of
-    \p *this and \p y, taken in this order.
-
-    \exception std::length_error
-    Thrown if the concatenation would cause the vector space
-    to exceed dimension <CODE>max_space_dimension()</CODE>.
-  */
-  void concatenate_assign(const Grid& y);
-
-  //! Removes all the specified dimensions from the vector space.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher dimensions of the vector space so that the
-    resulting space will have \ref Removing_Dimensions_from_the_Vector_Space
-    "dimension \p new_dimension."
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimensions is greater than the space dimension of
-    \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
-
-    If \p pfunc maps only some of the dimensions of \p *this then the
-    rest will be projected away.
-
-    If the highest dimension mapped to by \p pfunc is higher than the
-    highest dimension in \p *this then the number of dimensions in \p
-    *this will be increased to the highest dimension mapped to by \p
-    pfunc.
-
-    \param pfunc
-    The partial function specifying the destiny of each space
-    dimension.
-
-    The template type parameter Partial_Function must provide
-    the following methods.
-    \code
-      bool has_empty_codomain() const
-    \endcode
-    returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty codomain (i.e., it is always undefined).
-    The <CODE>has_empty_codomain()</CODE> method will always be called
-    before the methods below.  However, if
-    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
-    of the functions below will be called.
-    \code
-      dimension_type max_in_codomain() const
-    \endcode
-    returns the maximum value that belongs to the codomain of the
-    partial function.
-    The <CODE>max_in_codomain()</CODE> method is called at most once.
-    \code
-      bool maps(dimension_type i, dimension_type& j) const
-    \endcode
-    Let \f$f\f$ be the represented function and \f$k\f$ be the value
-    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
-    assigned to \p j and <CODE>true</CODE> is returned.  If \f$f\f$ is
-    undefined in \f$k\f$, then <CODE>false</CODE> is returned.
-    This method is called at most \f$n\f$ times, where \f$n\f$ is the
-    dimension of the vector space enclosing the grid.
-
-    The result is undefined if \p pfunc does not encode a partial
-    function with the properties described in the
-    \ref Mapping_the_Dimensions_of_the_Vector_Space "specification of the mapping operator".
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector
-    space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the vector
-    space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions
-    "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.  Also
-    thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are
-    \ref Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension "folded"
-    into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-  friend bool operator==(const Grid& x, const Grid& y);
-
-  friend class Parma_Polyhedra_Library::Grid_Certificate;
-
-  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
-
-  //! \name Miscellaneous Member Functions
-  //@{
-
-  //! Destructor.
-  ~Grid();
-
-  /*! \brief
-    Swaps \p *this with grid \p y.  (\p *this and \p y can be
-    dimension-incompatible.)
-  */
-  void m_swap(Grid& y);
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If \p x and \p y are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  //@} // Miscellaneous Member Functions
-
-private:
-
-  //! The system of congruences.
-  Congruence_System con_sys;
-
-  //! The system of generators.
-  Grid_Generator_System gen_sys;
-
-#define PPL_IN_Grid_CLASS
-#include "Grid_Status.idefs.hh"
-#undef PPL_IN_Grid_CLASS
-
-  //! The status flags to keep track of the grid's internal state.
-  Status status;
-
-  //! The number of dimensions of the enclosing vector space.
-  dimension_type space_dim;
-
-  enum Dimension_Kind {
-    PARAMETER = 0,
-    LINE = 1,
-    GEN_VIRTUAL = 2,
-    PROPER_CONGRUENCE = PARAMETER,
-    CON_VIRTUAL = LINE,
-    EQUALITY = GEN_VIRTUAL
-  };
-
-  typedef std::vector<Dimension_Kind> Dimension_Kinds;
-
-  // The type of row associated with each dimension.  If the virtual
-  // rows existed then the reduced systems would be square and upper
-  // or lower triangular, and the rows in each would have the types
-  // given in this vector.  As the congruence system is reduced to an
-  // upside-down lower triangular form the ordering of the congruence
-  // types is last to first.
-  Dimension_Kinds dim_kinds;
-
-  //! Builds a grid universe or empty grid.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the grid;
-
-    \param kind
-    specifies whether the universe or the empty grid has to be built.
-  */
-  void construct(dimension_type num_dimensions, Degenerate_Element kind);
-
-  //! Builds a grid from a system of congruences.
-  /*!
-    The grid inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences defining the grid. Its data-structures
-    may be recycled to build the grid.
-  */
-  void construct(Congruence_System& cgs);
-
-  //! Builds a grid from a system of grid generators.
-  /*!
-    The grid inherits the space dimension of the generator system.
-
-    \param ggs
-    The system of grid generators defining the grid.  Its data-structures
-    may be recycled to build the grid.
-  */
-  void construct(Grid_Generator_System& ggs);
-
-  //! \name Private Verifiers: Verify if Individual Flags are Set
-  //@{
-
-  //! Returns <CODE>true</CODE> if the grid is known to be empty.
-  /*!
-    The return value <CODE>false</CODE> does not necessarily
-    implies that \p *this is non-empty.
-  */
-  bool marked_empty() const;
-
-  //! Returns <CODE>true</CODE> if the system of congruences is up-to-date.
-  bool congruences_are_up_to_date() const;
-
-  //! Returns <CODE>true</CODE> if the system of generators is up-to-date.
-  bool generators_are_up_to_date() const;
-
-  //! Returns <CODE>true</CODE> if the system of congruences is minimized.
-  bool congruences_are_minimized() const;
-
-  //! Returns <CODE>true</CODE> if the system of generators is minimized.
-  bool generators_are_minimized() const;
-
-  //@} // Private Verifiers: Verify if Individual Flags are Set
-
-  //! \name State Flag Setters: Set Only the Specified Flags
-  //@{
-
-  /*! \brief
-    Sets \p status to express that the grid is the universe
-    0-dimension vector space, clearing all corresponding matrices.
-  */
-  void set_zero_dim_univ();
-
-  /*! \brief
-    Sets \p status to express that the grid is empty, clearing all
-    corresponding matrices.
-  */
-  void set_empty();
-
-  //! Sets \p status to express that congruences are up-to-date.
-  void set_congruences_up_to_date();
-
-  //! Sets \p status to express that generators are up-to-date.
-  void set_generators_up_to_date();
-
-  //! Sets \p status to express that congruences are minimized.
-  void set_congruences_minimized();
-
-  //! Sets \p status to express that generators are minimized.
-  void set_generators_minimized();
-
-  //@} // State Flag Setters: Set Only the Specified Flags
-
-  //! \name State Flag Cleaners: Clear Only the Specified Flag
-  //@{
-
-  //! Clears the \p status flag indicating that the grid is empty.
-  void clear_empty();
-
-  //! Sets \p status to express that congruences are out of date.
-  void clear_congruences_up_to_date();
-
-  //! Sets \p status to express that generators are out of date.
-  void clear_generators_up_to_date();
-
-  //! Sets \p status to express that congruences are no longer minimized.
-  void clear_congruences_minimized();
-
-  //! Sets \p status to express that generators are no longer minimized.
-  void clear_generators_minimized();
-
-  //@} // State Flag Cleaners: Clear Only the Specified Flag
-
-  //! \name Updating Matrices
-  //@{
-
-  //! Updates and minimizes the congruences from the generators.
-  void update_congruences() const;
-
-  //! Updates and minimizes the generators from the congruences.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty grid.
-
-    It is illegal to call this method when the Status field already
-    declares the grid to be empty.
-  */
-  bool update_generators() const;
-
-  //@} // Updating Matrices
-
-  //! \name Minimization of Descriptions
-  //@{
-
-  //! Minimizes both the congruences and the generators.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty grid.
-
-    Minimization is performed on each system only if the minimized
-    Status field is clear.
-  */
-  bool minimize() const;
-
-  //@} // Minimization of Descriptions
-
-  enum Three_Valued_Boolean {
-    TVB_TRUE,
-    TVB_FALSE,
-    TVB_DONT_KNOW
-  };
-
-  //! Polynomial but incomplete equivalence test between grids.
-  Three_Valued_Boolean quick_equivalence_test(const Grid& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is included in \p y.
-  bool is_included_in(const Grid& y) const;
-
-  //! Checks if and how \p expr is bounded in \p *this.
-  /*!
-    Returns <CODE>true</CODE> if and only if \p from_above is
-    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
-    or \p from_above is <CODE>false</CODE> and \p expr is bounded
-    from below in \p *this.
-
-    \param expr
-    The linear expression to test;
-
-    \param method_call
-    The call description of the public parent method, for example
-    "bounded_from_above(e)".  Passed to throw_dimension_incompatible,
-    as the first argument.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds(const Linear_Expression& expr, const char* method_call) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p
-    *this;
-
-    \param method_call
-    The call description of the public parent method, for example
-    "maximize(e)".  Passed to throw_dimension_incompatible, as the
-    first argument;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr in \p
-    *this can actually be reached (which is always the case);
-
-    \param point
-    When maximization or minimization succeeds, will be assigned the
-    point where \p expr reaches the extremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p point are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-	       const char* method_call,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included,
-	       Generator* point = NULL) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \ref Grid_Frequency "frequency" for \p *this with respect to \p expr
-    is defined, in which case the frequency and the value for \p expr
-    that is closest to zero are computed.
-
-    \param expr
-    The linear expression for which the frequency is needed;
-
-    \param freq_n
-    The numerator of the maximum frequency of \p expr;
-
-    \param freq_d
-    The denominator of the maximum frequency of \p expr;
-
-    \param val_n
-    The numerator of a value of \p expr at a point in the grid
-    that is closest to zero;
-
-    \param val_d
-    The denominator of a value of \p expr at a point in the grid
-    that is closest to zero;
-
-    If \p *this is empty or frequency is undefined with respect to \p expr,
-    then <CODE>false</CODE> is returned and \p freq_n, \p freq_d,
-    \p val_n and \p val_d are left untouched.
-
-    \warning
-    If \p expr and \p *this are dimension-incompatible,
-    the grid generator system is not minimized or \p *this is
-    empty, then the behavior is undefined.
-  */
-  bool frequency_no_check(const Linear_Expression& expr,
-		Coefficient& freq_n, Coefficient& freq_d,
-		Coefficient& val_n, Coefficient& val_d) const;
-
-  //! Checks if and how \p expr is bounded in \p *this.
-  /*!
-    Returns <CODE>true</CODE> if and only if \p from_above is
-    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
-    or \p from_above is <CODE>false</CODE> and \p expr is bounded
-    from below in \p *this.
-
-    \param expr
-    The linear expression to test;
-  */
-  bool bounds_no_check(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Adds the congruence \p cg to \p *this.
-
-    \warning
-    If \p cg and \p *this are dimension-incompatible,
-    the grid generator system is not minimized or \p *this is
-    empty, then the behavior is undefined.
-  */
-  void add_congruence_no_check(const Congruence& cg);
-
-  /*! \brief
-    Uses the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be added.
-
-    \exception std::invalid_argument
-    Thrown if c is a non-trivial inequality constraint.
-
-    \warning
-    If \p c and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void add_constraint_no_check(const Constraint& c);
-
-  /*! \brief
-    Uses the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be added.
-    Non-trivial inequalities are ignored.
-
-    \warning
-    If \p c and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Constraint& c);
-
-  //! \name Widening- and Extrapolation-Related Functions
-  //@{
-
-  //! Copies a widened selection of congruences from \p y to \p selected_cgs.
-  void select_wider_congruences(const Grid& y,
-				Congruence_System& selected_cgs) const;
-
-  //! Copies widened generators from \p y to \p widened_ggs.
-  void select_wider_generators(const Grid& y,
-                               Grid_Generator_System& widened_ggs) const;
-
-  //@} // Widening- and Extrapolation-Related Functions
-
-  //! Adds new space dimensions to the given systems.
-  /*!
-    \param cgs
-    A congruence system, to which columns are added;
-
-    \param gs
-    A generator system, to which rows and columns are added;
-
-    \param dims
-    The number of space dimensions to add.
-
-    This method is invoked only by
-    <CODE>add_space_dimensions_and_embed()</CODE>.
-  */
-  void add_space_dimensions(Congruence_System& cgs,
-			    Grid_Generator_System& gs,
-			    dimension_type dims);
-
-  //! Adds new space dimensions to the given systems.
-  /*!
-    \param gs
-    A generator system, to which columns are added;
-
-    \param cgs
-    A congruence system, to which rows and columns are added;
-
-    \param dims
-    The number of space dimensions to add.
-
-    This method is invoked only by
-    <CODE>add_space_dimensions_and_project()</CODE>.
-  */
-  void add_space_dimensions(Grid_Generator_System& gs,
-			    Congruence_System& cgs,
-			    dimension_type dims);
-
-  //! \name Minimization-related Static Member Functions
-  //@{
-
-  //! Normalizes the divisors in \p sys.
-  /*!
-    Converts \p sys to an equivalent system in which the divisors are
-    of equal value.
-
-    \param sys
-    The generator system to be normalized.  It must have at least one
-    row.
-
-    \param divisor
-    A reference to the initial value of the divisor.  The resulting
-    value of this object is the new system divisor.
-
-    \param first_point
-    If \p first_point has a value other than NULL then it is taken as
-    the first point in \p sys, and it is assumed that any following
-    points have the same divisor as \p first_point.
-  */
-  static void
-  normalize_divisors(Grid_Generator_System& sys,
-		     Coefficient& divisor,
-		     const Grid_Generator* first_point = NULL);
-
-  //! Normalizes the divisors in \p sys.
-  /*!
-    Converts \p sys to an equivalent system in which the divisors are
-    of equal value.
-
-    \param sys
-    The generator system to be normalized.  It must have at least one
-    row.
-  */
-  static void
-  normalize_divisors(Grid_Generator_System& sys);
-
-  //! Normalize all the divisors in \p sys and \p gen_sys.
-  /*!
-    Modify \p sys and \p gen_sys to use the same single divisor value
-    for all generators, leaving each system representing the grid it
-    represented originally.
-
-    \param sys
-    The first of the generator systems to be normalized.
-
-    \param gen_sys
-    The second of the generator systems to be normalized.  This system
-    must have at least one row and the divisors of the generators in
-    this system must be equal.
-
-    \exception std::runtime_error
-    Thrown if all rows in \p gen_sys are lines and/or parameters.
-  */
-  static void normalize_divisors(Grid_Generator_System& sys,
-				 Grid_Generator_System& gen_sys);
-
-  /*! \brief
-    Converts generator system \p dest to be equivalent to congruence
-    system \p source.
-  */
-  static void conversion(Congruence_System& source,
-			 Grid_Generator_System& dest,
-			 Dimension_Kinds& dim_kinds);
-
-  /*! \brief
-    Converts congruence system \p dest to be equivalent to generator
-    system \p source.
-  */
-  static void conversion(Grid_Generator_System& source,
-			 Congruence_System& dest,
-			 Dimension_Kinds& dim_kinds);
-
-  //! Converts \p cgs to upper triangular (i.e. minimized) form.
-  /*!
-    Returns <CODE>true</CODE> if \p cgs represents the empty set,
-    otherwise returns <CODE>false</CODE>.
-  */
-  static bool simplify(Congruence_System& cgs,
-		       Dimension_Kinds& dim_kinds);
-
-  //! Converts \p gs to lower triangular (i.e. minimized) form.
-  /*!
-    Expects \p gs to contain at least one point.
-  */
-  static void simplify(Grid_Generator_System& ggs,
-		       Dimension_Kinds& dim_kinds);
-
-  //! Reduces the line \p row using the line \p pivot.
-  /*!
-    Uses the line \p pivot to change the representation of the line
-    \p row so that the element at index \p column of \p row is zero.
-  */
-  // A member of Grid for access to Matrix<Dense_Row>::rows.
-  static void reduce_line_with_line(Grid_Generator& row,
-				    Grid_Generator& pivot,
-				    dimension_type column);
-
-  //! Reduces the equality \p row using the equality \p pivot.
-  /*!
-    Uses the equality \p pivot to change the representation of the
-    equality \p row so that the element at index \p column of \p row
-    is zero.
-  */
-  // A member of Grid for access to Matrix<Dense_Row>::rows.
-  static void reduce_equality_with_equality(Congruence& row,
-					    const Congruence& pivot,
-					    dimension_type column);
-
-  //! Reduces \p row using \p pivot.
-  /*!
-    Uses the point, parameter or proper congruence at \p pivot to
-    change the representation of the point, parameter or proper
-    congruence at \p row so that the element at index \p column of \p row
-    is zero.  Only elements from index \p start to index \p end are
-    modified (i.e. it is assumed that all other elements are zero).
-    This means that \p col must be in [start,end).
-
-    NOTE: This may invalidate the rows, since it messes with the divisors.
-    Client code has to fix that (if needed) and assert OK().
-  */
-  // Part of Grid for access to Matrix<Dense_Row>::rows.
-  template <typename R>
-  static void reduce_pc_with_pc(R& row,
-				R& pivot,
-				dimension_type column,
-				dimension_type start,
-				dimension_type end);
-
-  //! Reduce \p row using \p pivot.
-  /*!
-    Use the line \p pivot to change the representation of the
-    parameter \p row such that the element at index \p column of \p row
-    is zero.
-  */
-  // This takes a parameter with type Swapping_Vector<Grid_Generator> (instead
-  // of Grid_Generator_System) to simplify the implementation of `simplify()'.
-  // NOTE: This may invalidate `row' and the rows in `sys'. Client code must
-  // fix/check this.
-  static void reduce_parameter_with_line(Grid_Generator& row,
-					 const Grid_Generator& pivot,
-					 dimension_type column,
-					 Swapping_Vector<Grid_Generator>& sys,
-                                         dimension_type num_columns);
-
-  //! Reduce \p row using \p pivot.
-  /*!
-    Use the equality \p pivot to change the representation of the
-    congruence \p row such that element at index \p column of \p row
-    is zero.
-  */
-  // A member of Grid for access to Matrix<Dense_Row>::rows.
-  // This takes a parameter with type Swapping_Vector<Congruence> (instead of
-  // Congruence_System) to simplify the implementation of `conversion()'.
-  static void reduce_congruence_with_equality(Congruence& row,
-					      const Congruence& pivot,
-					      dimension_type column,
-					      Swapping_Vector<Congruence>& sys);
-
-  //! Reduce column \p dim in rows preceding \p pivot_index in \p sys.
-  /*!
-    Required when converting (or simplifying) a congruence or generator
-    system to "strong minimal form"; informally, strong minimal form means
-    that, not only is the system in minimal form (ie a triangular matrix),
-    but also the absolute values of the coefficients of the proper congruences
-    and parameters are minimal. As a simple example, the set of congruences
-    \f$\{3x \equiv_3 0, 4x + y \equiv_3 1\}\f$,
-    (which is in minimal form) is equivalent to the set
-    \f$\{3x \equiv_3 0, x + y \equiv_3 1\}\f$
-    (which is in strong minimal form).
-
-    \param sys
-    The generator or congruence system to be reduced to strong minimal form.
-
-    \param dim
-    Column to be reduced.
-
-    \param pivot_index
-    Index of last row to be reduced.
-
-    \param start
-    Index of first column to be changed.
-
-    \param end
-    Index of last column to be changed.
-
-    \param sys_dim_kinds
-    Dimension kinds of the elements of \p sys.
-
-    \param generators
-    Flag indicating whether \p sys is a congruence or generator system
-  */
-  template <typename M>
-  // This takes a parameter with type `Swapping_Vector<M::row_type>'
-  // instead of `M' to simplify the implementation of simplify().
-  // NOTE: This may invalidate the rows in `sys'. Client code must
-  // fix/check this.
-  static void reduce_reduced(Swapping_Vector<typename M::row_type>& sys,
-                             dimension_type dim,
-			     dimension_type pivot_index,
-			     dimension_type start, dimension_type end,
-			     const Dimension_Kinds& sys_dim_kinds,
-			     bool generators = true);
-
-  //! Multiply the elements of \p dest by \p multiplier.
-  // A member of Grid for access to Matrix<Dense_Row>::rows and cgs::operator[].
-  // The type of `dest' is Swapping_Vector<Congruence> instead of
-  // Congruence_System to simplify the implementation of conversion().
-  static void multiply_grid(const Coefficient& multiplier,
-			    Congruence& cg,
-                            Swapping_Vector<Congruence>& dest,
-			    dimension_type num_rows);
-
-  //! Multiply the elements of \p dest by \p multiplier.
-  // A member of Grid for access to Grid_Generator::operator[].
-  // The type of `dest' is Swapping_Vector<Grid_Generator> instead of
-  // Grid_Generator_System to simplify the implementation of conversion().
-  // NOTE: This does not check whether the rows are OK(). Client code
-  // should do that.
-  static void multiply_grid(const Coefficient& multiplier,
-			    Grid_Generator& gen,
-			    Swapping_Vector<Grid_Generator>& dest,
-			    dimension_type num_rows);
-
-  /*! \brief
-    If \p sys is lower triangular return <CODE>true</CODE>, else
-    return <CODE>false</CODE>.
-  */
-  static bool lower_triangular(const Congruence_System& sys,
-			       const Dimension_Kinds& dim_kinds);
-
-  /*! \brief
-    If \p sys is upper triangular return <CODE>true</CODE>, else
-    return <CODE>false</CODE>.
-  */
-  static bool upper_triangular(const Grid_Generator_System& sys,
-			       const Dimension_Kinds& dim_kinds);
-
-#ifndef NDEBUG
-  //! Checks that trailing rows contain only zero terms.
-  /*!
-    If all columns contain zero in the rows of \p system from row
-    index \p first to row index \p last then return <code>true</code>,
-    else return <code>false</code>.  \p row_size gives the number of
-    columns in each row.
-
-    This method is only used in assertions in the simplify methods.
-  */
-  template <typename M, typename R>
-  static bool rows_are_zero(M& system,
-			    dimension_type first,
-			    dimension_type last,
-			    dimension_type row_size);
-#endif
-
-  //@} // Minimization-Related Static Member Functions
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \name Exception Throwers
-  //@{
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-protected:
-  void throw_dimension_incompatible(const char* method,
-				    const char* other_name,
-				    dimension_type other_dim) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* gr_name,
-				    const Grid& gr) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* le_name,
-				    const Linear_Expression& le) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* cg_name,
-				    const Congruence& cg) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* c_name,
-				    const Constraint& c) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* g_name,
-				    const Grid_Generator& g) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* g_name,
-				    const Generator& g) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* cgs_name,
-				    const Congruence_System& cgs) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* cs_name,
-				    const Constraint_System& cs) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* gs_name,
-				    const Grid_Generator_System& gs) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* var_name,
-				    Variable var) const;
-  void throw_dimension_incompatible(const char* method,
-				    dimension_type required_space_dim) const;
-
-  static void throw_invalid_argument(const char* method,
-                                     const char* reason);
-  static void throw_invalid_constraint(const char* method,
-                                       const char* c_name);
-  static void throw_invalid_constraints(const char* method,
-                                        const char* cs_name);
-  static void throw_invalid_generator(const char* method,
-                                      const char* g_name);
-  static void throw_invalid_generators(const char* method,
-                                       const char* gs_name);
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //@} // Exception Throwers
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-};
-
-#include "Grid_Status.inlines.hh"
-#include "Grid.inlines.hh"
-#include "Grid.templates.hh"
-
-#endif // !defined(PPL_Grid_defs_hh)
diff --git a/src/Grid.inlines.hh b/src/Grid.inlines.hh
deleted file mode 100644
index 58c7eec..0000000
--- a/src/Grid.inlines.hh
+++ /dev/null
@@ -1,383 +0,0 @@
-/* Grid class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_inlines_hh
-#define PPL_Grid_inlines_hh 1
-
-#include "Grid_Generator.defs.hh"
-#include "Grid_Generator_System.defs.hh"
-#include "Grid_Generator_System.inlines.hh"
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-inline bool
-Grid::marked_empty() const {
-  return status.test_empty();
-}
-
-inline bool
-Grid::congruences_are_up_to_date() const {
-  return status.test_c_up_to_date();
-}
-
-inline bool
-Grid::generators_are_up_to_date() const {
-  return status.test_g_up_to_date();
-}
-
-inline bool
-Grid::congruences_are_minimized() const {
-  return status.test_c_minimized();
-}
-
-inline bool
-Grid::generators_are_minimized() const {
-  return status.test_g_minimized();
-}
-
-inline void
-Grid::set_generators_up_to_date() {
-  status.set_g_up_to_date();
-}
-
-inline void
-Grid::set_congruences_up_to_date() {
-  status.set_c_up_to_date();
-}
-
-inline void
-Grid::set_congruences_minimized() {
-  set_congruences_up_to_date();
-  status.set_c_minimized();
-}
-
-inline void
-Grid::set_generators_minimized() {
-  set_generators_up_to_date();
-  status.set_g_minimized();
-}
-
-inline void
-Grid::clear_empty() {
-  status.reset_empty();
-}
-
-inline void
-Grid::clear_congruences_minimized() {
-  status.reset_c_minimized();
-}
-
-inline void
-Grid::clear_generators_minimized() {
-  status.reset_g_minimized();
-}
-
-inline void
-Grid::clear_congruences_up_to_date() {
-  clear_congruences_minimized();
-  status.reset_c_up_to_date();
-  // Can get rid of con_sys here.
-}
-
-inline void
-Grid::clear_generators_up_to_date() {
-  clear_generators_minimized();
-  status.reset_g_up_to_date();
-  // Can get rid of gen_sys here.
-}
-
-inline dimension_type
-Grid::max_space_dimension() {
-  // One dimension is reserved to have a value of type dimension_type
-  // that does not represent a legal dimension.
-  return std::min(std::numeric_limits<dimension_type>::max() - 1,
-		  std::min(Congruence_System::max_space_dimension(),
-			   Grid_Generator_System::max_space_dimension()
-			   )
-		  );
-}
-
-inline
-Grid::Grid(dimension_type num_dimensions,
-	   const Degenerate_Element kind)
-  : con_sys(),
-    gen_sys(check_space_dimension_overflow(num_dimensions,
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(n, k)",
-                                           "n exceeds the maximum "
-                                           "allowed space dimension")) {
-  construct(num_dimensions, kind);
-  PPL_ASSERT(OK());
-}
-
-inline
-Grid::Grid(const Congruence_System& cgs)
-  : con_sys(check_space_dimension_overflow(cgs.space_dimension(),
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(cgs)",
-                                           "the space dimension of cgs "
-                                           "exceeds the maximum allowed "
-                                           "space dimension")),
-    gen_sys(cgs.space_dimension()) {
-  Congruence_System cgs_copy(cgs);
-  construct(cgs_copy);
-}
-
-inline
-Grid::Grid(Congruence_System& cgs, Recycle_Input)
-  : con_sys(check_space_dimension_overflow(cgs.space_dimension(),
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(cgs, recycle)",
-                                           "the space dimension of cgs "
-                                           "exceeds the maximum allowed "
-                                           "space dimension")),
-    gen_sys(cgs.space_dimension()) {
-  construct(cgs);
-}
-
-inline
-Grid::Grid(const Grid_Generator_System& ggs)
-  : con_sys(check_space_dimension_overflow(ggs.space_dimension(),
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(ggs)",
-                                           "the space dimension of ggs "
-                                           "exceeds the maximum allowed "
-                                           "space dimension")),
-    gen_sys(ggs.space_dimension()) {
-  Grid_Generator_System ggs_copy(ggs);
-  construct(ggs_copy);
-}
-
-inline
-Grid::Grid(Grid_Generator_System& ggs, Recycle_Input)
-  : con_sys(check_space_dimension_overflow(ggs.space_dimension(),
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(ggs, recycle)",
-                                           "the space dimension of ggs "
-                                           "exceeds the maximum allowed "
-                                           "space dimension")),
-    gen_sys(ggs.space_dimension()) {
-  construct(ggs);
-}
-
-template <typename U>
-inline
-Grid::Grid(const BD_Shape<U>& bd, Complexity_Class)
-  : con_sys(check_space_dimension_overflow(bd.space_dimension(),
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(bd)",
-                                           "the space dimension of bd "
-                                           "exceeds the maximum allowed "
-                                           "space dimension")),
-    gen_sys(bd.space_dimension()) {
-  Congruence_System cgs = bd.congruences();
-  construct(cgs);
-}
-
-template <typename U>
-inline
-Grid::Grid(const Octagonal_Shape<U>& os, Complexity_Class)
-  : con_sys(check_space_dimension_overflow(os.space_dimension(),
-                                           max_space_dimension(),
-                                           "PPL::Grid::",
-                                           "Grid(os)",
-                                           "the space dimension of os "
-                                           "exceeds the maximum allowed "
-                                           "space dimension")),
-    gen_sys(os.space_dimension()) {
-  Congruence_System cgs = os.congruences();
-  construct(cgs);
-}
-
-inline
-Grid::~Grid() {
-}
-
-inline dimension_type
-Grid::space_dimension() const {
-  return space_dim;
-}
-
-inline memory_size_type
-Grid::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline int32_t
-Grid::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-inline Constraint_System
-Grid::constraints() const {
-  return Constraint_System(congruences());
-}
-
-inline Constraint_System
-Grid::minimized_constraints() const {
-  return Constraint_System(minimized_congruences());
-}
-
-inline void
-Grid::m_swap(Grid& y) {
-  using std::swap;
-  swap(con_sys, y.con_sys);
-  swap(gen_sys, y.gen_sys);
-  swap(status, y.status);
-  swap(space_dim, y.space_dim);
-  swap(dim_kinds, y.dim_kinds);
-}
-
-inline void
-Grid::add_congruence(const Congruence& cg) {
-  // Dimension-compatibility check.
-  if (space_dim < cg.space_dimension())
-    throw_dimension_incompatible("add_congruence(cg)", "cg", cg);
-
-  if (!marked_empty())
-    add_congruence_no_check(cg);
-}
-
-inline void
-Grid::add_congruences(const Congruence_System& cgs) {
-  // TODO: this is just an executable specification.
-  // Space dimension compatibility check.
-  if (space_dim < cgs.space_dimension())
-    throw_dimension_incompatible("add_congruences(cgs)", "cgs", cgs);
-
-  if (!marked_empty()) {
-    Congruence_System cgs_copy = cgs;
-    add_recycled_congruences(cgs_copy);
-  }
-}
-
-inline void
-Grid::refine_with_congruence(const Congruence& cg) {
-  add_congruence(cg);
-}
-
-inline void
-Grid::refine_with_congruences(const Congruence_System& cgs) {
-  add_congruences(cgs);
-}
-
-inline bool
-Grid::can_recycle_constraint_systems() {
-  return true;
-}
-
-inline bool
-Grid::can_recycle_congruence_systems() {
-  return true;
-}
-
-inline void
-Grid::add_constraint(const Constraint& c) {
-  // Space dimension compatibility check.
-  if (space_dim < c.space_dimension())
-    throw_dimension_incompatible("add_constraint(c)", "c", c);
-  if (!marked_empty())
-    add_constraint_no_check(c);
-}
-
-inline void
-Grid::add_recycled_constraints(Constraint_System& cs) {
-  // TODO: really recycle the constraints.
-  add_constraints(cs);
-}
-
-inline bool
-Grid::bounds_from_above(const Linear_Expression& expr) const {
-  return bounds(expr, "bounds_from_above(e)");
-}
-
-inline bool
-Grid::bounds_from_below(const Linear_Expression& expr) const {
-  return bounds(expr, "bounds_from_below(e)");
-}
-
-inline bool
-Grid::maximize(const Linear_Expression& expr,
-	       Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const {
-  return max_min(expr, "maximize(e, ...)", sup_n, sup_d, maximum);
-}
-
-inline bool
-Grid::maximize(const Linear_Expression& expr,
-	       Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-	       Generator& point) const {
-  return max_min(expr, "maximize(e, ...)", sup_n, sup_d, maximum, &point);
-}
-
-inline bool
-Grid::minimize(const Linear_Expression& expr,
-	       Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const {
-  return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum);
-}
-
-inline bool
-Grid::minimize(const Linear_Expression& expr,
-	       Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-	       Generator& point) const {
-  return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum, &point);
-}
-
-inline void
-Grid::normalize_divisors(Grid_Generator_System& sys) {
-  PPL_DIRTY_TEMP_COEFFICIENT(divisor);
-  divisor = 1;
-  normalize_divisors(sys, divisor);
-}
-
-/*! \relates Grid */
-inline bool
-operator!=(const Grid& x, const Grid& y) {
-  return !(x == y);
-}
-
-inline bool
-Grid::strictly_contains(const Grid& y) const {
-  const Grid& x = *this;
-  return x.contains(y) && !y.contains(x);
-}
-
-inline void
-Grid::topological_closure_assign() {
-}
-
-/*! \relates Grid */
-inline void
-swap(Grid& x, Grid& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Grid_inlines_hh)
diff --git a/src/Grid.templates.hh b/src/Grid.templates.hh
deleted file mode 100644
index 9c2bf70..0000000
--- a/src/Grid.templates.hh
+++ /dev/null
@@ -1,339 +0,0 @@
-/* Grid class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_templates_hh
-#define PPL_Grid_templates_hh 1
-
-#include "Grid_Generator.defs.hh"
-#include "Grid_Generator_System.defs.hh"
-#include "Grid_Generator_System.inlines.hh"
-#include <algorithm>
-#include <deque>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Interval>
-Grid::Grid(const Box<Interval>& box, Complexity_Class)
-  : con_sys(),
-    gen_sys() {
-  space_dim = check_space_dimension_overflow(box.space_dimension(),
-                                             max_space_dimension(),
-                                             "PPL::Grid::",
-                                             "Grid(box, from_bounding_box)",
-                                             "the space dimension of box "
-                                             "exceeds the maximum allowed "
-                                             "space dimension");
-
-  if (box.is_empty()) {
-    // Empty grid.
-    set_empty();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (space_dim == 0)
-    set_zero_dim_univ();
-  else {
-    // Initialize the space dimension as indicated by the box.
-    con_sys.set_space_dimension(space_dim);
-    gen_sys.set_space_dimension(space_dim);
-    // Add congruences and generators according to `box'.
-    PPL_DIRTY_TEMP_COEFFICIENT(l_n);
-    PPL_DIRTY_TEMP_COEFFICIENT(l_d);
-    PPL_DIRTY_TEMP_COEFFICIENT(u_n);
-    PPL_DIRTY_TEMP_COEFFICIENT(u_d);
-    gen_sys.insert(grid_point());
-    for (dimension_type k = space_dim; k-- > 0; ) {
-      const Variable v_k = Variable(k);
-      bool closed = false;
-      // TODO: Consider producing the system(s) in minimized form.
-      if (box.has_lower_bound(v_k, l_n, l_d, closed)) {
-	if (box.has_upper_bound(v_k, u_n, u_d, closed))
-	  if (l_n * u_d == u_n * l_d) {
-	    // A point interval sets dimension k of every point to a
-	    // single value.
-	    con_sys.insert(l_d * v_k == l_n);
-
-            // This is declared here because it may be invalidated
-            // by the call to gen_sys.insert() at the end of the loop.
-            Grid_Generator& point = gen_sys.sys.rows[0];
-
-	    // Scale the point to use as divisor the lcm of the
-	    // divisors of the existing point and the lower bound.
-	    const Coefficient& point_divisor = point.divisor();
-	    gcd_assign(u_n, l_d, point_divisor);
-	    // `u_n' now holds the gcd.
-	    exact_div_assign(u_n, point_divisor, u_n);
-	    if (l_d < 0)
-	      neg_assign(u_n);
-	    // l_d * u_n == abs(l_d * (point_divisor / gcd(l_d, point_divisor)))
-	    point.scale_to_divisor(l_d * u_n);
-	    // Set dimension k of the point to the lower bound.
-	    if (l_d < 0)
-	      neg_assign(u_n);
-	    // point[k + 1] = l_n * point_divisor / gcd(l_d, point_divisor)
-	    point.expr.set(Variable(k), l_n * u_n);
-            PPL_ASSERT(point.OK());
-
-            PPL_ASSERT(gen_sys.sys.OK());
-
-	    continue;
-	  }
-      }
-      // A universe interval allows any value in dimension k.
-      gen_sys.insert(grid_line(v_k));
-    }
-    set_congruences_up_to_date();
-    set_generators_up_to_date();
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Partial_Function>
-void
-Grid::map_space_dimensions(const Partial_Function& pfunc) {
-  if (space_dim == 0)
-    return;
-
-  if (pfunc.has_empty_codomain()) {
-    // All dimensions vanish: the grid becomes zero_dimensional.
-    if (marked_empty()
-	|| (!generators_are_up_to_date() && !update_generators())) {
-      // Removing all dimensions from the empty grid.
-      space_dim = 0;
-      set_empty();
-    }
-    else
-      // Removing all dimensions from a non-empty grid.
-      set_zero_dim_univ();
-
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  dimension_type new_space_dimension = pfunc.max_in_codomain() + 1;
-
-  if (new_space_dimension == space_dim) {
-    // The partial function `pfunc' is indeed total and thus specifies
-    // a permutation, that is, a renaming of the dimensions.  For
-    // maximum efficiency, we will simply permute the columns of the
-    // constraint system and/or the generator system.
-
-    std::vector<Variable> cycle;
-    cycle.reserve(space_dim);
-
-    // Used to mark elements as soon as they are inserted in a cycle.
-    std::deque<bool> visited(space_dim);
-
-    for (dimension_type i = space_dim; i-- > 0; ) {
-      if (!visited[i]) {
-	dimension_type j = i;
-	do {
-	  visited[j] = true;
-	  // The following initialization is only to make the compiler happy.
-	  dimension_type k = 0;
-	  if (!pfunc.maps(j, k))
-	    throw_invalid_argument("map_space_dimensions(pfunc)",
-				   " pfunc is inconsistent");
-	  if (k == j)
-	    break;
-
-	  cycle.push_back(Variable(j));
-	  // Go along the cycle.
-	  j = k;
-	} while (!visited[j]);
-
-	// End of cycle.
-
-        // Avoid calling clear_*_minimized() if cycle.size() is less than 2,
-        // to improve efficiency.
-        if (cycle.size() >= 2) {
-          // Permute all that is up-to-date.
-          if (congruences_are_up_to_date()) {
-            con_sys.permute_space_dimensions(cycle);
-            clear_congruences_minimized();
-          }
-
-          if (generators_are_up_to_date()) {
-            gen_sys.permute_space_dimensions(cycle);
-            clear_generators_minimized();
-          }
-        }
-
-        cycle.clear();
-      }
-    }
-
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // If control gets here, then `pfunc' is not a permutation and some
-  // dimensions must be projected away.
-
-  const Grid_Generator_System& old_gensys = grid_generators();
-
-  if (old_gensys.has_no_rows()) {
-    // The grid is empty.
-    Grid new_grid(new_space_dimension, EMPTY);
-    m_swap(new_grid);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Make a local copy of the partial function.
-  std::vector<dimension_type> pfunc_maps(space_dim, not_a_dimension());
-  for (dimension_type j = space_dim; j-- > 0; ) {
-    dimension_type pfunc_j;
-    if (pfunc.maps(j, pfunc_j))
-      pfunc_maps[j] = pfunc_j;
-  }
-
-  Grid_Generator_System new_gensys;
-  // Set sortedness, for the assertion met via gs::insert.
-  new_gensys.set_sorted(false);
-  // Get the divisor of the first point.
-  Grid_Generator_System::const_iterator i;
-  Grid_Generator_System::const_iterator old_gensys_end = old_gensys.end();
-  for (i = old_gensys.begin(); i != old_gensys_end; ++i)
-    if (i->is_point())
-      break;
-  PPL_ASSERT(i != old_gensys_end);
-  const Coefficient& system_divisor = i->divisor();
-  for (i = old_gensys.begin(); i != old_gensys_end; ++i) {
-    const Grid_Generator& old_g = *i;
-    const Grid_Generator::Expression& old_g_e = old_g.expression();
-    Linear_Expression expr;
-    expr.set_space_dimension(new_space_dimension);
-    bool all_zeroes = true;
-    for (Grid_Generator::Expression::const_iterator j = old_g_e.begin(),
-          j_end = old_g_e.end(); j != j_end; ++j) {
-      const dimension_type mapped_id = pfunc_maps[j.variable().id()];
-      if (mapped_id != not_a_dimension()) {
-        add_mul_assign(expr, *j, Variable(mapped_id));
-	all_zeroes = false;
-      }
-    }
-    switch (old_g.type()) {
-    case Grid_Generator::LINE:
-      if (!all_zeroes)
-	new_gensys.insert(grid_line(expr));
-      break;
-    case Grid_Generator::PARAMETER:
-      if (!all_zeroes)
-	new_gensys.insert(parameter(expr, system_divisor));
-      break;
-    case Grid_Generator::POINT:
-      new_gensys.insert(grid_point(expr, old_g.divisor()));
-      break;
-    }
-  }
-
-  Grid new_grid(new_gensys);
-  m_swap(new_grid);
-
-  PPL_ASSERT(OK(true));
-}
-
-// Needed for converting the congruence or grid_generator system
-// to "strong minimal form".
-template <typename M>
-void
-Grid::reduce_reduced(Swapping_Vector<typename M::row_type>& rows,
-		     const dimension_type dim,
-		     const dimension_type pivot_index,
-		     const dimension_type start,
-		     const dimension_type end,
-		     const Dimension_Kinds& sys_dim_kinds,
-		     const bool generators) {
-  // TODO: Remove this.
-  typedef typename M::row_type M_row_type;
-
-  const M_row_type& pivot = rows[pivot_index];
-  const Coefficient& pivot_dim = pivot.expr.get(dim);
-
-  if (pivot_dim == 0)
-    return;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(pivot_dim_half);
-  pivot_dim_half = (pivot_dim + 1) / 2;
-  const Dimension_Kind row_kind = sys_dim_kinds[dim];
-  const bool row_is_line_or_equality
-    = (row_kind == (generators ? LINE : EQUALITY));
-
-  PPL_DIRTY_TEMP_COEFFICIENT(num_rows_to_subtract);
-  PPL_DIRTY_TEMP_COEFFICIENT(row_dim_remainder);
-  for (dimension_type kinds_index = dim,
-         row_index = pivot_index; row_index-- > 0; ) {
-    if (generators) {
-      --kinds_index;
-      // Move over any virtual rows.
-      while (sys_dim_kinds[kinds_index] == GEN_VIRTUAL)
-        --kinds_index;
-    }
-    else {
-      ++kinds_index;
-      // Move over any virtual rows.
-      while (sys_dim_kinds[kinds_index] == CON_VIRTUAL)
-        ++kinds_index;
-    }
-
-    // row_kind CONGRUENCE is included as PARAMETER
-    if (row_is_line_or_equality
-	|| (row_kind == PARAMETER
-	    && sys_dim_kinds[kinds_index] == PARAMETER)) {
-      M_row_type& row = rows[row_index];
-
-      const Coefficient& row_dim = row.expr.get(dim);
-      // num_rows_to_subtract may be positive or negative.
-      num_rows_to_subtract = row_dim / pivot_dim;
-
-      // Ensure that after subtracting num_rows_to_subtract * r_dim
-      // from row_dim, -pivot_dim_half < row_dim <= pivot_dim_half.
-      // E.g., if pivot[dim] = 9, then after this reduction
-      // -5 < row_dim <= 5.
-      row_dim_remainder = row_dim % pivot_dim;
-      if (row_dim_remainder < 0) {
-	if (row_dim_remainder <= -pivot_dim_half)
-	  --num_rows_to_subtract;
-      }
-      else if (row_dim_remainder > 0 && row_dim_remainder > pivot_dim_half)
-	++num_rows_to_subtract;
-
-      // Subtract num_rows_to_subtract copies of pivot from row i.  Only the
-      // entries from dim need to be subtracted, as the preceding
-      // entries are all zero.
-      // If num_rows_to_subtract is negative, these copies of pivot are
-      // added to row i.
-      if (num_rows_to_subtract != 0)
-        row.expr.linear_combine(pivot.expr,
-                                Coefficient_one(), -num_rows_to_subtract,
-                                start, end + 1);
-    }
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Grid_templates_hh)
diff --git a/src/Grid.types.hh b/src/Grid.types.hh
deleted file mode 100644
index 96e419e..0000000
--- a/src/Grid.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Grid_types_hh
-#define PPL_Grid_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Grid;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Grid_types_hh)
diff --git a/src/Grid_Certificate.cc b/src/Grid_Certificate.cc
index defaff4..d535b5f 100644
--- a/src/Grid_Certificate.cc
+++ b/src/Grid_Certificate.cc
@@ -1,7 +1,7 @@
 /* Grid_Certificate class implementation
    (non-inline member functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,8 +23,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid_Certificate.defs.hh"
-#include "Grid.defs.hh"
+#include "Grid_Certificate_defs.hh"
+#include "Grid_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -45,23 +45,23 @@ PPL::Grid_Certificate::Grid_Certificate(const Grid& gr)
     }
     else
       if (gr.generators_are_up_to_date() && gr.generators_are_minimized()) {
-	// Calculate number of congruences from generators.
- 	num_proper_congruences
-	  = gr.gen_sys.num_parameters() + 1 /* Integrality cg. */;
-	num_equalities = gr.space_dimension() + 1 - gr.gen_sys.num_rows();
+        // Calculate number of congruences from generators.
+        num_proper_congruences
+          = gr.gen_sys.num_parameters() + 1 /* Integrality cg. */;
+        num_equalities = gr.space_dimension() + 1 - gr.gen_sys.num_rows();
       }
       else {
-	// Minimize `gr' congruence system.  As in Polyhedron assume
-	// that `gr' contains at least one point.
+        // Minimize `gr' congruence system.  As in Polyhedron assume
+        // that `gr' contains at least one point.
         Grid& mgr = const_cast<Grid&>(gr);
-	bool empty = Grid::simplify(mgr.con_sys, mgr.dim_kinds);
-	// Avoid possible compiler warning.
-	PPL_USED(empty);
-	PPL_ASSERT(!empty);
-	mgr.set_congruences_minimized();
+        const bool empty = Grid::simplify(mgr.con_sys, mgr.dim_kinds);
+        // Avoid possible compiler warning.
+        PPL_USED(empty);
+        PPL_ASSERT(!empty);
+        mgr.set_congruences_minimized();
 
-	num_proper_congruences = mgr.con_sys.num_proper_congruences();
-	num_equalities = mgr.con_sys.num_equalities();
+        num_proper_congruences = mgr.con_sys.num_proper_congruences();
+        num_equalities = mgr.con_sys.num_equalities();
       }
   }
   else {
@@ -97,7 +97,7 @@ PPL::Grid_Certificate::compare(const Grid_Certificate& y) const {
 
 int
 PPL::Grid_Certificate::compare(const Grid& gr) const {
-  Grid_Certificate gc(gr);
+  const Grid_Certificate gc(gr);
   return compare(gc);
 }
 
diff --git a/src/Grid_Certificate.defs.hh b/src/Grid_Certificate.defs.hh
deleted file mode 100644
index fe354dc..0000000
--- a/src/Grid_Certificate.defs.hh
+++ /dev/null
@@ -1,104 +0,0 @@
-/* Grid_Certificate class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Certificate_defs_hh
-#define PPL_Grid_Certificate_defs_hh 1
-
-#include "Grid_Certificate.types.hh"
-
-#include "Grid.types.hh"
-#include "globals.defs.hh"
-#include "assert.hh"
-#include <vector>
-
-//! The convergence certificate for the Grid widening operator.
-/*! \ingroup PPL_CXX_interface
-  Convergence certificates are used to instantiate the BHZ03 framework
-  so as to define widening operators for the finite powerset domain.
-
-  \note
-  Each convergence certificate has to be used together with a
-  compatible widening operator. In particular, Grid_Certificate can
-  certify the Grid widening.
-*/
-class Parma_Polyhedra_Library::Grid_Certificate {
-public:
-  //! Default constructor.
-  Grid_Certificate();
-
-  //! Constructor: computes the certificate for \p gr.
-  Grid_Certificate(const Grid& gr);
-
-  //! Copy constructor.
-  Grid_Certificate(const Grid_Certificate& y);
-
-  //! Destructor.
-  ~Grid_Certificate();
-
-  //! The comparison function for certificates.
-  /*!
-    \return
-    \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether \p *this
-    is smaller than, equal to, or greater than \p y, respectively.
-  */
-  int compare(const Grid_Certificate& y) const;
-
-  //! Compares \p *this with the certificate for grid \p gr.
-  int compare(const Grid& gr) const;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the certificate for grid
-    \p gr is strictly smaller than \p *this.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool is_stabilizing(const Grid& gr) const;
-
-  //! A total ordering on Grid certificates.
-  /*!
-    This binary predicate defines a total ordering on Grid certificates
-    which is used when storing information about sets of grids.
-  */
-  struct Compare {
-    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
-    bool operator()(const Grid_Certificate& x,
-		    const Grid_Certificate& y) const;
-  };
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! Check if gathered information is meaningful.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool OK() const;
-
-private:
-  //! Number of a equalities in a minimized congruence system for the
-  //! grid.
-  dimension_type num_equalities;
-  //! Number of a proper congruences in a minimized congruence system
-  //! for the grid.
-  dimension_type num_proper_congruences;
-};
-
-#include "Grid_Certificate.inlines.hh"
-
-#endif // !defined(PPL_Grid_Certificate_defs_hh)
diff --git a/src/Grid_Certificate.inlines.hh b/src/Grid_Certificate.inlines.hh
deleted file mode 100644
index 0ab33c4..0000000
--- a/src/Grid_Certificate.inlines.hh
+++ /dev/null
@@ -1,61 +0,0 @@
-/* Grid_Certificate class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Certificate_inlines_hh
-#define PPL_Grid_Certificate_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Grid_Certificate::Grid_Certificate()
-  : num_equalities(0), num_proper_congruences(0) {
-  // This is the certificate for a zero-dim universe grid.
-  PPL_ASSERT(OK());
-}
-
-inline
-Grid_Certificate::Grid_Certificate(const Grid_Certificate& y)
-  : num_equalities(y.num_equalities),
-    num_proper_congruences(y.num_proper_congruences) {
-}
-
-inline
-Grid_Certificate::~Grid_Certificate() {
-}
-
-inline bool
-Grid_Certificate::is_stabilizing(const Grid& gr) const {
-  return compare(gr) == 1;
-}
-
-inline bool
-Grid_Certificate::Compare::operator()(const Grid_Certificate& x,
-				      const Grid_Certificate& y) const {
-  // For an efficient evaluation of the multiset ordering based
-  // on this LGO relation, we want larger elements to come first.
-  return x.compare(y) == 1;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Grid_Certificate_inlines_hh)
diff --git a/src/Grid_Certificate.types.hh b/src/Grid_Certificate.types.hh
deleted file mode 100644
index 4207746..0000000
--- a/src/Grid_Certificate.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Grid_Certificate_types_hh
-#define PPL_Grid_Certificate_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Grid_Certificate;
-
-}
-
-#endif // !defined(PPL_Grid_Certificate_types_hh)
diff --git a/src/Grid_Certificate_defs.hh b/src/Grid_Certificate_defs.hh
new file mode 100644
index 0000000..5aaac9a
--- /dev/null
+++ b/src/Grid_Certificate_defs.hh
@@ -0,0 +1,104 @@
+/* Grid_Certificate class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Certificate_defs_hh
+#define PPL_Grid_Certificate_defs_hh 1
+
+#include "Grid_Certificate_types.hh"
+
+#include "Grid_types.hh"
+#include "globals_defs.hh"
+#include "assert.hh"
+#include <vector>
+
+//! The convergence certificate for the Grid widening operator.
+/*! \ingroup PPL_CXX_interface
+  Convergence certificates are used to instantiate the BHZ03 framework
+  so as to define widening operators for the finite powerset domain.
+
+  \note
+  Each convergence certificate has to be used together with a
+  compatible widening operator. In particular, Grid_Certificate can
+  certify the Grid widening.
+*/
+class Parma_Polyhedra_Library::Grid_Certificate {
+public:
+  //! Default constructor.
+  Grid_Certificate();
+
+  //! Constructor: computes the certificate for \p gr.
+  Grid_Certificate(const Grid& gr);
+
+  //! Copy constructor.
+  Grid_Certificate(const Grid_Certificate& y);
+
+  //! Destructor.
+  ~Grid_Certificate();
+
+  //! The comparison function for certificates.
+  /*!
+    \return
+    \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether \p *this
+    is smaller than, equal to, or greater than \p y, respectively.
+  */
+  int compare(const Grid_Certificate& y) const;
+
+  //! Compares \p *this with the certificate for grid \p gr.
+  int compare(const Grid& gr) const;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the certificate for grid
+    \p gr is strictly smaller than \p *this.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool is_stabilizing(const Grid& gr) const;
+
+  //! A total ordering on Grid certificates.
+  /*!
+    This binary predicate defines a total ordering on Grid certificates
+    which is used when storing information about sets of grids.
+  */
+  struct Compare {
+    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
+    bool operator()(const Grid_Certificate& x,
+                    const Grid_Certificate& y) const;
+  };
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! Check if gathered information is meaningful.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool OK() const;
+
+private:
+  //! Number of a equalities in a minimized congruence system for the
+  //! grid.
+  dimension_type num_equalities;
+  //! Number of a proper congruences in a minimized congruence system
+  //! for the grid.
+  dimension_type num_proper_congruences;
+};
+
+#include "Grid_Certificate_inlines.hh"
+
+#endif // !defined(PPL_Grid_Certificate_defs_hh)
diff --git a/src/Grid_Certificate_inlines.hh b/src/Grid_Certificate_inlines.hh
new file mode 100644
index 0000000..35d3433
--- /dev/null
+++ b/src/Grid_Certificate_inlines.hh
@@ -0,0 +1,61 @@
+/* Grid_Certificate class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Certificate_inlines_hh
+#define PPL_Grid_Certificate_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Grid_Certificate::Grid_Certificate()
+  : num_equalities(0), num_proper_congruences(0) {
+  // This is the certificate for a zero-dim universe grid.
+  PPL_ASSERT(OK());
+}
+
+inline
+Grid_Certificate::Grid_Certificate(const Grid_Certificate& y)
+  : num_equalities(y.num_equalities),
+    num_proper_congruences(y.num_proper_congruences) {
+}
+
+inline
+Grid_Certificate::~Grid_Certificate() {
+}
+
+inline bool
+Grid_Certificate::is_stabilizing(const Grid& gr) const {
+  return compare(gr) == 1;
+}
+
+inline bool
+Grid_Certificate::Compare::operator()(const Grid_Certificate& x,
+                                      const Grid_Certificate& y) const {
+  // For an efficient evaluation of the multiset ordering based
+  // on this LGO relation, we want larger elements to come first.
+  return x.compare(y) == 1;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Grid_Certificate_inlines_hh)
diff --git a/src/Grid_Certificate_types.hh b/src/Grid_Certificate_types.hh
new file mode 100644
index 0000000..d825c8e
--- /dev/null
+++ b/src/Grid_Certificate_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Grid_Certificate_types_hh
+#define PPL_Grid_Certificate_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Grid_Certificate;
+
+}
+
+#endif // !defined(PPL_Grid_Certificate_types_hh)
diff --git a/src/Grid_Generator.cc b/src/Grid_Generator.cc
index 0181fe5..24022fd 100644
--- a/src/Grid_Generator.cc
+++ b/src/Grid_Generator.cc
@@ -1,6 +1,6 @@
 /* Grid_Generator class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,10 +22,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid_Generator.defs.hh"
+#include "Grid_Generator_defs.hh"
 
-#include "Variables_Set.defs.hh"
-#include "math_utilities.defs.hh"
+#include "Variables_Set_defs.hh"
+#include "math_utilities_defs.hh"
 
 #include <iostream>
 #include <sstream>
@@ -45,7 +45,7 @@ PPL::Grid_Generator::throw_dimension_incompatible(const char* method,
 
 void
 PPL::Grid_Generator::throw_invalid_argument(const char* method,
-					    const char* reason) const {
+                                            const char* reason) const {
   std::ostringstream s;
   s << "PPL::Grid_Generator::" << method << ":" << std::endl
     << reason << ".";
@@ -54,11 +54,11 @@ PPL::Grid_Generator::throw_invalid_argument(const char* method,
 
 PPL::Grid_Generator
 PPL::Grid_Generator::parameter(const Linear_Expression& e,
-			       Coefficient_traits::const_reference d,
+                               Coefficient_traits::const_reference d,
                                Representation r) {
   if (d == 0)
     throw std::invalid_argument("PPL::parameter(e, d):\n"
-				"d == 0.");
+                                "d == 0.");
   // Add 1 to space dimension to allow for parameter divisor column.
   Linear_Expression ec(e, e.space_dimension() + 1, r);
 
@@ -73,7 +73,7 @@ PPL::Grid_Generator::parameter(const Linear_Expression& e,
 
   // Using this constructor saves reallocation when creating the
   // coefficients.
-  Grid_Generator gg(ec, PARAMETER);
+  const Grid_Generator gg(ec, PARAMETER);
 
   // NOTE: normalize() must *not* be called here, because this is a parameter,
   // and it would change the represented parameter.
@@ -82,11 +82,11 @@ PPL::Grid_Generator::parameter(const Linear_Expression& e,
 
 PPL::Grid_Generator
 PPL::Grid_Generator::grid_point(const Linear_Expression& e,
-				Coefficient_traits::const_reference d,
+                                Coefficient_traits::const_reference d,
                                 Representation r) {
   if (d == 0)
     throw std::invalid_argument("PPL::grid_point(e, d):\n"
-				"d == 0.");
+                                "d == 0.");
   // Add 1 to space dimension to allow for parameter divisor column.
   Linear_Expression ec(e, 1 + e.space_dimension(), r);
   ec.set_inhomogeneous_term(d);
@@ -121,7 +121,7 @@ PPL::Grid_Generator::grid_line(const Linear_Expression& e, Representation r) {
   // The origin of the space cannot be a line.
   if (e.all_homogeneous_terms_are_zero())
     throw std::invalid_argument("PPL::grid_line(e):\n"
-				"e == 0, but the origin cannot be a line.");
+                                "e == 0, but the origin cannot be a line.");
 
   // Add 1 to space dimension to allow for parameter divisor column.
   Linear_Expression ec(e, 1 + e.space_dimension(), r);
@@ -248,7 +248,7 @@ PPL::compare(const Grid_Generator& x, const Grid_Generator& y) {
 bool
 PPL::Grid_Generator::is_equivalent_to(const Grid_Generator& y) const {
   const Grid_Generator& x = *this;
-  dimension_type x_space_dim = x.space_dimension();
+  const dimension_type x_space_dim = x.space_dimension();
   if (x_space_dim != y.space_dimension())
     return false;
 
@@ -258,7 +258,7 @@ PPL::Grid_Generator::is_equivalent_to(const Grid_Generator& y) const {
 
   Grid_Generator tmp_x = *this;
   Grid_Generator tmp_y = y;
-  Variable last_var(x_space_dim);
+  const Variable last_var(x_space_dim);
   if (x_type == POINT || x_type == LINE) {
     tmp_x.expr.set(last_var, Coefficient_zero());
     tmp_y.expr.set(last_var, Coefficient_zero());
@@ -329,7 +329,7 @@ PPL::Grid_Generator::fancy_print(std::ostream& s) const {
   bool need_divisor = false;
   bool extra_parentheses = false;
   const dimension_type num_variables = space_dimension();
-  Grid_Generator::Type t = type();
+  const Grid_Generator::Type t = type();
   switch (t) {
   case Grid_Generator::LINE:
     s << "l(";
@@ -356,7 +356,7 @@ PPL::Grid_Generator::fancy_print(std::ostream& s) const {
   PPL_DIRTY_TEMP_COEFFICIENT(c);
   bool first = true;
   for (Linear_Expression::const_iterator i = expr.begin(),
-        i_end = expr.lower_bound(Variable(num_variables)); i != i_end; ++i) {
+         i_end = expr.lower_bound(Variable(num_variables)); i != i_end; ++i) {
     c = *i;
     if (!first) {
       if (c > 0)
@@ -394,7 +394,7 @@ PPL::IO_Operators::operator<<(std::ostream& s, const Grid_Generator& g) {
 /*! \relates Parma_Polyhedra_Library::Grid_Generator */
 std::ostream&
 PPL::IO_Operators::operator<<(std::ostream& s,
-			      const Grid_Generator::Type& t) {
+                              const Grid_Generator::Type& t) {
   const char* n = 0;
   switch (t) {
   case Grid_Generator::LINE:
@@ -426,7 +426,7 @@ PPL::Grid_Generator::OK() const {
   if (x.expr.space_dimension() < 1) {
 #ifndef NDEBUG
     std::cerr << "Grid_Generator has fewer coefficients than the minimum "
-	      << "allowed:\nspace dimension is " << x.expr.space_dimension()
+              << "allowed:\nspace dimension is " << x.expr.space_dimension()
               << ", minimum is 1.\n";
 #endif
     return false;
diff --git a/src/Grid_Generator.defs.hh b/src/Grid_Generator.defs.hh
deleted file mode 100644
index 39eb3d7..0000000
--- a/src/Grid_Generator.defs.hh
+++ /dev/null
@@ -1,798 +0,0 @@
-/* Grid_Generator class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Generator_defs_hh
-#define PPL_Grid_Generator_defs_hh 1
-
-#include "Grid_Generator.types.hh"
-#include "Grid.types.hh"
-
-#include "Variables_Set.types.hh"
-#include "Grid_Generator_System.types.hh"
-#include "Linear_System.types.hh"
-
-#include "Coefficient.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Topology.types.hh"
-#include "Expression_Hide_Inhomo.defs.hh"
-#include "Expression_Hide_Last.defs.hh"
-
-#include "Grid.types.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-// Put these in the namespace here to declare them friend later.
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The basic comparison function.
-/*! \relates Grid_Generator
-  \return
-  The returned absolute value can be \f$0\f$, \f$1\f$ or \f$2\f$.
-
-  \param x
-  A row of coefficients;
-
-  \param y
-  Another row.
-
-  Compares \p x and \p y, where \p x and \p y may be of different size,
-  in which case the "missing" coefficients are assumed to be zero.
-  The comparison is such that:
-  -# equalities are smaller than inequalities;
-  -# lines are smaller than points and rays;
-  -# the ordering is lexicographic;
-  -# the positions compared are, in decreasing order of significance,
-     1, 2, ..., \p size(), 0;
-  -# the result is negative, zero, or positive if x is smaller than,
-     equal to, or greater than y, respectively;
-  -# when \p x and \p y are different, the absolute value of the
-     result is 1 if the difference is due to the coefficient in
-     position 0; it is 2 otherwise.
-
-  When \p x and \p y represent the hyper-planes associated
-  to two equality or inequality constraints, the coefficient
-  at 0 is the known term.
-  In this case, the return value can be characterized as follows:
-  - -2, if \p x is smaller than \p y and they are \e not parallel;
-  - -1, if \p x is smaller than \p y and they \e are parallel;
-  -  0, if \p x and y are equal;
-  - +1, if \p y is smaller than \p x and they \e are parallel;
-  - +2, if \p y is smaller than \p x and they are \e not parallel.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-int compare(const Grid_Generator& x, const Grid_Generator& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Grid_Generator */
-std::ostream& operator<<(std::ostream& s, const Grid_Generator& g);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Grid_Generator */
-void swap(Grid_Generator& x, Grid_Generator& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A grid line, parameter or grid point.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Grid_Generator is one of the following:
-
-  - a grid_line \f$\vect{l} = (a_0, \ldots, a_{n-1})^\transpose\f$;
-
-  - a parameter
-    \f$\vect{q} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
-
-  - a grid_point
-    \f$\vect{p} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
-
-  where \f$n\f$ is the dimension of the space
-  and, for grid_points and parameters, \f$d > 0\f$ is the divisor.
-
-  \par How to build a grid generator.
-  Each type of generator is built by applying the corresponding
-  function (<CODE>grid_line</CODE>, <CODE>parameter</CODE>
-  or <CODE>grid_point</CODE>) to a linear expression;
-  the space dimension of the generator is defined as the space dimension
-  of the corresponding linear expression.
-  Linear expressions used to define a generator should be homogeneous
-  (any constant term will be simply ignored).
-  When defining grid points and parameters, an optional Coefficient argument
-  can be used as a common <EM>divisor</EM> for all the coefficients
-  occurring in the provided linear expression;
-  the default value for this argument is 1.
-
-  \par
-  In all the following examples it is assumed that variables
-  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
-  are defined as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable z(2);
-  \endcode
-
-  \par Example 1
-  The following code builds a grid line with direction \f$x-y-z\f$
-  and having space dimension \f$3\f$:
-  \code
-  Grid_Generator l = grid_line(x - y - z);
-  \endcode
-  By definition, the origin of the space is not a line, so that
-  the following code throws an exception:
-  \code
-  Grid_Generator l = grid_line(0*x);
-  \endcode
-
-  \par Example 2
-  The following code builds the parameter as the vector
-  \f$\vect{p} = (1, -1, -1)^\transpose \in \Rset^3\f$
-  which has the same direction as the line in Example 1:
-  \code
-  Grid_Generator q = parameter(x - y - z);
-  \endcode
-  Note that, unlike lines, for parameters, the length as well
-  as the direction of the vector represented by the code is significant.
-  Thus \p q is \e not the same as the parameter \p q1 defined by
-  \code
-  Grid_Generator q1 = parameter(2x - 2y - 2z);
-  \endcode
-  By definition, the origin of the space is not a parameter, so that
-  the following code throws an exception:
-  \code
-  Grid_Generator q = parameter(0*x);
-  \endcode
-
-  \par Example 3
-  The following code builds the grid point
-  \f$\vect{p} = (1, 0, 2)^\transpose \in \Rset^3\f$:
-  \code
-  Grid_Generator p = grid_point(1*x + 0*y + 2*z);
-  \endcode
-  The same effect can be obtained by using the following code:
-  \code
-  Grid_Generator p = grid_point(x + 2*z);
-  \endcode
-  Similarly, the origin \f$\vect{0} \in \Rset^3\f$ can be defined
-  using either one of the following lines of code:
-  \code
-  Grid_Generator origin3 = grid_point(0*x + 0*y + 0*z);
-  Grid_Generator origin3_alt = grid_point(0*z);
-  \endcode
-  Note however that the following code would have defined
-  a different point, namely \f$\vect{0} \in \Rset^2\f$:
-  \code
-  Grid_Generator origin2 = grid_point(0*y);
-  \endcode
-  The following two lines of code both define the only grid point
-  having space dimension zero, namely \f$\vect{0} \in \Rset^0\f$.
-  In the second case we exploit the fact that the first argument
-  of the function <CODE>point</CODE> is optional.
-  \code
-  Grid_Generator origin0 = Generator::zero_dim_point();
-  Grid_Generator origin0_alt = grid_point();
-  \endcode
-
-  \par Example 4
-  The grid point \f$\vect{p}\f$ specified in Example 3 above
-  can also be obtained with the following code,
-  where we provide a non-default value for the second argument
-  of the function <CODE>grid_point</CODE> (the divisor):
-  \code
-  Grid_Generator p = grid_point(2*x + 0*y + 4*z, 2);
-  \endcode
-  Obviously, the divisor can be used to specify
-  points having some non-integer (but rational) coordinates.
-  For instance, the grid point
-  \f$\vect{p1} = (-1.5, 3.2, 2.1)^\transpose \in \Rset^3\f$
-  can be specified by the following code:
-  \code
-  Grid_Generator p1 = grid_point(-15*x + 32*y + 21*z, 10);
-  \endcode
-  If a zero divisor is provided, an exception is thrown.
-
-  \par Example 5
-  Parameters, like grid points can have a divisor.
-  For instance, the parameter
-  \f$\vect{q} = (1, 0, 2)^\transpose \in \Rset^3\f$ can be defined:
-  \code
-  Grid_Generator q = parameter(2*x + 0*y + 4*z, 2);
-  \endcode
-  Also, the divisor can be used to specify
-  parameters having some non-integer (but rational) coordinates.
-  For instance, the parameter
-  \f$\vect{q} = (-1.5, 3.2, 2.1)^\transpose \in \Rset^3\f$
-  can be defined:
-  \code
-  Grid_Generator q = parameter(-15*x + 32*y + 21*z, 10);
-  \endcode
-  If a zero divisor is provided, an exception is thrown.
-
-  \par How to inspect a grid generator
-  Several methods are provided to examine a grid generator and extract
-  all the encoded information: its space dimension, its type and
-  the value of its integer coefficients and the value of the denominator.
-
-  \par Example 6
-  The following code shows how it is possible to access each single
-  coefficient of a grid generator.
-  If <CODE>g1</CODE> is a grid point having coordinates
-  \f$(a_0, \ldots, a_{n-1})^\transpose\f$,
-  we construct the parameter <CODE>g2</CODE> having coordinates
-  \f$(a_0, 2 a_1, \ldots, (i+1)a_i, \ldots, n a_{n-1})^\transpose\f$.
-  \code
-  if (g1.is_point()) {
-    cout << "Grid point g1: " << g1 << endl;
-    Linear_Expression e;
-    for (dimension_type i = g1.space_dimension(); i-- > 0; )
-      e += (i + 1) * g1.coefficient(Variable(i)) * Variable(i);
-    Grid_Generator g2 = parameter(e, g1.divisor());
-    cout << "Parameter g2: " << g2 << endl;
-  }
-  else
-    cout << "Grid generator g1 is not a grid point." << endl;
-  \endcode
-  Therefore, for the grid point
-  \code
-  Grid_Generator g1 = grid_point(2*x - y + 3*z, 2);
-  \endcode
-  we would obtain the following output:
-  \code
-  Grid point g1: p((2*A - B + 3*C)/2)
-  Parameter g2: parameter((2*A - 2*B + 9*C)/2)
-  \endcode
-  When working with grid points and parameters, be careful not to confuse
-  the notion of <EM>coefficient</EM> with the notion of <EM>coordinate</EM>:
-  these are equivalent only when the divisor is 1.
-*/
-class Parma_Polyhedra_Library::Grid_Generator {
-public:
-
-  //! The possible kinds of Grid_Generator objects.
-  enum Kind {
-    LINE_OR_EQUALITY = 0,
-    RAY_OR_POINT_OR_INEQUALITY = 1
-  };
-
-  //! The representation used for new Grid_Generators.
-  /*!
-    \note The copy constructor and the copy constructor with specified size
-          use the representation of the original object, so that it is
-          indistinguishable from the original object.
-  */
-  static const Representation default_representation = SPARSE;
-
-  //! Returns the line of direction \p e.
-  /*!
-    \exception std::invalid_argument
-    Thrown if the homogeneous part of \p e represents the origin of
-    the vector space.
-  */
-  static Grid_Generator grid_line(const Linear_Expression& e,
-                                  Representation r = default_representation);
-
-  //! Returns the parameter of direction \p e and size \p e/d, with the same
-  //! representation as e.
-  /*!
-    Both \p e and \p d are optional arguments, with default values
-    Linear_Expression::zero() and Coefficient_one(), respectively.
-
-    \exception std::invalid_argument
-    Thrown if \p d is zero.
-  */
-  static Grid_Generator parameter(const Linear_Expression& e
-                                  = Linear_Expression::zero(),
-                                  Coefficient_traits::const_reference d
-                                  = Coefficient_one(),
-                                  Representation r = default_representation);
-
-  // TODO: Improve the documentation of this method.
-  //! Returns the parameter of direction and size \p Linear_Expression::zero() .
-  static Grid_Generator parameter(Representation r);
-
-  //! Returns the parameter of direction and size \p e .
-  static Grid_Generator parameter(const Linear_Expression& e,
-                                  Representation r);
-
-  //! Returns the point at \p e / \p d.
-  /*!
-    Both \p e and \p d are optional arguments, with default values
-    Linear_Expression::zero() and Coefficient_one(), respectively.
-
-    \exception std::invalid_argument
-    Thrown if \p d is zero.
-  */
-  static Grid_Generator grid_point(const Linear_Expression& e
-                                   = Linear_Expression::zero(),
-                                   Coefficient_traits::const_reference d
-                                   = Coefficient_one(),
-                                   Representation r = default_representation);
-
-  //! Returns the point at \p e .
-  static Grid_Generator grid_point(Representation r);
-
-  //! Returns the point at \p e .
-  static Grid_Generator grid_point(const Linear_Expression& e,
-                                   Representation r);
-
-  //! Returns the origin of the zero-dimensional space \f$\Rset^0\f$.
-  explicit Grid_Generator(Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  //! The new Grid_Generator will have the same representation as g.
-  Grid_Generator(const Grid_Generator& g);
-
-  //! Copy constructor with specified representation.
-  Grid_Generator(const Grid_Generator& g, Representation r);
-
-  //! Copy constructor with specified space dimension.
-  //! The new Grid_Generator will have the same representation as g.
-  Grid_Generator(const Grid_Generator& g, dimension_type space_dim);
-
-  //! Copy constructor with specified space dimension and representation.
-  Grid_Generator(const Grid_Generator& g, dimension_type space_dim,
-                 Representation r);
-
-  //! Destructor.
-  ~Grid_Generator();
-
-  //! Assignment operator.
-  Grid_Generator& operator=(const Grid_Generator& g);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Grid_Generator can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Sets the dimension of the vector space enclosing \p *this to
-  //! \p space_dim .
-  void set_space_dimension(dimension_type space_dim);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Removes all the specified dimensions from the grid generator.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-
-    Always returns \p true. The return value is needed for compatibility with
-    the Generator class.
-  */
-  bool remove_space_dimensions(const Variables_Set& vars);
-
-  //! Permutes the space dimensions of the grid generator.
-  /*
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! The generator type.
-  enum Type {
-    /*! The generator is a grid line. */
-    LINE,
-    /*! The generator is a parameter. */
-    PARAMETER,
-    /*! The generator is a grid point. */
-    POINT
-  };
-
-  //! Returns the generator type of \p *this.
-  Type type() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a line.
-  bool is_line() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a parameter.
-  bool is_parameter() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is a line or
-    a parameter.
-  */
-  bool is_line_or_parameter() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a point.
-  bool is_point() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row represents a
-    parameter or a point.
-  */
-  bool is_parameter_or_point() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  /*!
-    \exception std::invalid_argument
-    Thrown if the index of \p v is greater than or equal to the
-    space dimension of \p *this.
-  */
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the divisor of \p *this.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this is a line.
-  */
-  Coefficient_traits::const_reference divisor() const;
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  //! Returns the origin of the zero-dimensional space \f$\Rset^0\f$.
-  static const Grid_Generator& zero_dim_point();
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y are
-    equivalent generators.
-
-    Generators having different space dimensions are not equivalent.
-  */
-  bool is_equivalent_to(const Grid_Generator& y) const;
-
-  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
-  /*!
-    This is faster than is_equivalent_to(), but it may return `false' even
-    for equivalent generators.
-  */
-  bool is_equal_to(const Grid_Generator& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous terms
-    of \p *this are \f$0\f$.
-  */
-  bool all_homogeneous_terms_are_zero() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Grid_Generator& y);
-
-  /*! \brief
-    Scales \p *this to be represented with a divisor of \p d (if
-    \*this is a parameter or point). Does nothing at all on lines.
-
-    It is assumed that \p d is a multiple of the current divisor
-    and different from zero. The behavior is undefined if the assumption
-    does not hold.
-  */
-  void scale_to_divisor(Coefficient_traits::const_reference d);
-
-  //! Sets the divisor of \p *this to \p d.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this is a line.
-  */
-  void set_divisor(Coefficient_traits::const_reference d);
-
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> > Expression;
-
-  //! Allows user code to read the internal expression (but note that this
-  //! is a different type, not all operations are allowed).
-  const Expression& expression() const;
-
-private:
-  Linear_Expression expr;
-
-  Expression_Hide_Inhomo<Linear_Expression> semi_wrapped_expr;
-
-  Expression wrapped_expr;
-
-  Kind kind_;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the origin of the zero-dimensional space \f$\Rset^0\f$.
-  */
-  static const Grid_Generator* zero_dim_point_p;
-
-  //! Constructs a Grid_Generator with the specified space dimension, kind
-  //! and topology.
-  Grid_Generator(dimension_type space_dim, Kind kind, Topology topology,
-                 Representation r = default_representation);
-
-  // TODO: Avoid reducing the space dimension.
-  /*! \brief
-    Constructs a grid generator of type \p t from linear expression \p e,
-    stealing the underlying data structures from \p e.
-
-    The last column in \p e becomes the parameter divisor column of
-    the new Grid_Generator.
-
-    \note The new Grid_Generator will have the same representation as `e'.
-  */
-  Grid_Generator(Linear_Expression& e, Type t);
-
-  //! Sets the dimension of the vector space enclosing \p *this to
-  //! \p space_dim .
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  /*!
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid objects.
-  */
-  void set_space_dimension_no_ok(dimension_type space_dim);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if \p *this is equal to \p gg in
-    dimension \p dim.
-  */
-  bool is_equal_at_dimension(dimension_type dim,
-                             const Grid_Generator& gg) const;
-
-  //! Another print functions, with fancy output, more human-friendly.
-  //! This is used by operator<<();
-  void fancy_print(std::ostream& s) const;
-
-  //! Converts the Grid_Generator into a parameter.
-  void set_is_parameter();
-
-  //! Sets the Grid_Generator kind to <CODE>LINE_OR_EQUALITY</CODE>.
-  void set_is_line();
-
-  //! Sets the Grid_Generator kind to <CODE>RAY_OR_POINT_OR_INEQUALITY</CODE>.
-  void set_is_parameter_or_point();
-
-  //! \name Flags inspection methods
-  //@{
-  //! Returns the topological kind of \p *this.
-  Topology topology() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the topology
-    of \p *this row is not necessarily closed.
-  */
-  bool is_not_necessarily_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the topology
-    of \p *this row is necessarily closed.
-  */
-  bool is_necessarily_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row
-    represents a line or an equality.
-  */
-  bool is_line_or_equality() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this row
-    represents a ray, a point or an inequality.
-  */
-  bool is_ray_or_point_or_inequality() const;
-  //@} // Flags inspection methods
-
-  //! \name Flags coercion methods
-  //@{
-
-  //! Sets to \p x the topological kind of \p *this row.
-  void set_topology(Topology x);
-
-  //! Sets to \p NECESSARILY_CLOSED the topological kind of \p *this row.
-  void set_necessarily_closed();
-
-  //! Sets to \p NOT_NECESSARILY_CLOSED the topological kind of \p *this row.
-  void set_not_necessarily_closed();
-
-  //! Sets to \p LINE_OR_EQUALITY the kind of \p *this row.
-  void set_is_line_or_equality();
-
-  //! Sets to \p RAY_OR_POINT_OR_INEQUALITY the kind of \p *this row.
-  void set_is_ray_or_point_or_inequality();
-  //@} // Flags coercion methods
-
-  /*! \brief
-    Normalizes the sign of the coefficients so that the first non-zero
-    (homogeneous) coefficient of a line-or-equality is positive.
-  */
-  void sign_normalize();
-
-  /*! \brief
-    Strong normalization: ensures that different Grid_Generator objects
-    represent different hyperplanes or hyperspaces.
-
-    Applies both Grid_Generator::normalize() and Grid_Generator::sign_normalize().
-  */
-  void strong_normalize();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the coefficients are
-    strongly normalized.
-  */
-  bool check_strong_normalized() const;
-
-  //! Linearly combines \p *this with \p y so that i-th coefficient is 0.
-  /*!
-    \param y
-    The Grid_Generator that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting Grid_Generator to \p *this and normalizes it.
-  */
-  void linear_combine(const Grid_Generator& y, dimension_type i);
-
-  /*! \brief
-    Throw a <CODE>std::invalid_argument</CODE> exception containing
-    the appropriate error message.
-  */
-  void
-  throw_dimension_incompatible(const char* method,
-                               const char* name_var,
-                               const Variable v) const;
-
-  /*! \brief
-    Throw a <CODE>std::invalid_argument</CODE> exception containing
-    the appropriate error message.
-  */
-  void
-  throw_invalid_argument(const char* method, const char* reason) const;
-
-  friend std::ostream&
-  IO_Operators::operator<<(std::ostream& s, const Grid_Generator& g);
-
-  friend int
-  compare(const Grid_Generator& x, const Grid_Generator& y);
-
-  friend class Grid_Generator_System;
-  friend class Grid;
-  friend class Linear_System<Grid_Generator>;
-  friend class Scalar_Products;
-  friend class Topology_Adjusted_Scalar_Product_Sign;
-};
-
-
-namespace Parma_Polyhedra_Library {
-
-/*! \brief
-  Shorthand for
-  Grid_Generator::grid_line(const Linear_Expression& e, Representation r).
-
-  \relates Grid_Generator
-*/
-Grid_Generator
-grid_line(const Linear_Expression& e,
-          Representation r = Grid_Generator::default_representation);
-
-/*! \brief
-  Shorthand for
-  Grid_Generator::parameter(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
-
-  \relates Grid_Generator
-*/
-Grid_Generator
-parameter(const Linear_Expression& e = Linear_Expression::zero(),
-          Coefficient_traits::const_reference d = Coefficient_one(),
-          Representation r = Grid_Generator::default_representation);
-
-//! Shorthand for Grid_Generator::parameter(Representation r).
-/*! \relates Grid_Generator */
-Grid_Generator
-parameter(Representation r);
-
-/*! \brief
-  Shorthand for
-  Grid_Generator::parameter(const Linear_Expression& e, Representation r).
-
-  \relates Grid_Generator
-*/
-Grid_Generator
-parameter(const Linear_Expression& e, Representation r);
-
-/*! \brief
-  Shorthand for
-  Grid_Generator::grid_point(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
-
-  \relates Grid_Generator
-*/
-Grid_Generator
-grid_point(const Linear_Expression& e = Linear_Expression::zero(),
-           Coefficient_traits::const_reference d = Coefficient_one(),
-           Representation r = Grid_Generator::default_representation);
-
-//! Shorthand for Grid_Generator::grid_point(Representation r).
-/*! \relates Grid_Generator */
-Grid_Generator
-grid_point(Representation r);
-
-/*! \brief
-  Shorthand for
-  Grid_Generator::grid_point(const Linear_Expression& e, Representation r).
-
-  \relates Grid_Generator
-*/
-Grid_Generator
-grid_point(const Linear_Expression& e, Representation r);
-
-//! Returns <CODE>true</CODE> if and only if \p x is equivalent to \p y.
-/*! \relates Grid_Generator */
-bool operator==(const Grid_Generator& x, const Grid_Generator& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x is not equivalent to \p y.
-/*! \relates Grid_Generator */
-bool operator!=(const Grid_Generator& x, const Grid_Generator& y);
-
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Grid_Generator */
-std::ostream& operator<<(std::ostream& s, const Grid_Generator::Type& t);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Grid_Generator.inlines.hh"
-
-#endif // !defined(PPL_Grid_Generator_defs_hh)
diff --git a/src/Grid_Generator.inlines.hh b/src/Grid_Generator.inlines.hh
deleted file mode 100644
index c5c77cd..0000000
--- a/src/Grid_Generator.inlines.hh
+++ /dev/null
@@ -1,382 +0,0 @@
-/* Grid Generator class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Generator_inlines_hh
-#define PPL_Grid_Generator_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline bool
-Grid_Generator::is_necessarily_closed() const {
-  return true;
-}
-
-inline bool
-Grid_Generator::is_not_necessarily_closed() const {
-  return false;
-}
-
-inline bool
-Grid_Generator::is_line_or_equality() const {
-  return (kind_ == LINE_OR_EQUALITY);
-}
-
-inline bool
-Grid_Generator::is_ray_or_point_or_inequality() const {
-  return (kind_ == RAY_OR_POINT_OR_INEQUALITY);
-}
-
-inline Topology
-Grid_Generator::topology() const {
-  return NECESSARILY_CLOSED;
-}
-
-inline void
-Grid_Generator::set_is_line_or_equality() {
-  kind_ = LINE_OR_EQUALITY;
-}
-
-inline void
-Grid_Generator::set_is_ray_or_point_or_inequality() {
-  kind_ = RAY_OR_POINT_OR_INEQUALITY;
-}
-
-inline void
-Grid_Generator::set_topology(Topology x) {
-  PPL_USED(x);
-  PPL_ASSERT(x == NECESSARILY_CLOSED);
-}
-
-inline void
-Grid_Generator::set_necessarily_closed() {
-  set_topology(NECESSARILY_CLOSED);
-}
-
-inline void
-Grid_Generator::set_not_necessarily_closed() {
-  set_topology(NOT_NECESSARILY_CLOSED);
-}
-
-inline
-Grid_Generator::Grid_Generator(Linear_Expression& e, Type type)
-  : semi_wrapped_expr(expr), wrapped_expr(semi_wrapped_expr, true) {
-  swap(expr, e);
-  if (type == LINE)
-    kind_ = LINE_OR_EQUALITY;
-  else
-    kind_ = RAY_OR_POINT_OR_INEQUALITY;
-  PPL_ASSERT(OK());
-}
-
-inline
-Grid_Generator::Grid_Generator(Representation r)
-  : expr(Coefficient_one(), r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
-    kind_(RAY_OR_POINT_OR_INEQUALITY) {
-  expr.set_space_dimension(1);
-  PPL_ASSERT(OK());
-}
-
-inline
-Grid_Generator::Grid_Generator(const Grid_Generator& g)
-  : expr(g.expr),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
-    kind_(g.kind_) {
-}
-
-inline
-Grid_Generator::Grid_Generator(const Grid_Generator& g, Representation r)
-  : expr(g.expr, r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
-    kind_(g.kind_) {
-}
-
-inline
-Grid_Generator::Grid_Generator(dimension_type space_dim, Kind kind,
-                               Topology topology, Representation r)
-  : expr(r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
-    kind_(kind) {
-  PPL_USED(topology);
-  PPL_ASSERT(topology == NECESSARILY_CLOSED);
-  expr.set_space_dimension(space_dim + 1);
-  PPL_ASSERT(space_dimension() == space_dim);
-}
-
-inline
-Grid_Generator::Grid_Generator(const Grid_Generator& g,
-                               dimension_type space_dim)
-  : expr(g.expr, space_dim + 1),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
-    kind_(g.kind_) {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(space_dimension() == space_dim);
-}
-
-inline
-Grid_Generator::Grid_Generator(const Grid_Generator& g,
-                               dimension_type space_dim, Representation r)
-  : expr(g.expr, space_dim + 1, r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
-    kind_(g.kind_) {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(space_dimension() == space_dim);
-}
-
-inline
-Grid_Generator::~Grid_Generator() {
-}
-
-inline const Grid_Generator::Expression&
-Grid_Generator::expression() const {
-  return wrapped_expr;
-}
-
-inline Representation
-Grid_Generator::representation() const {
-  return expr.representation();
-}
-
-inline void
-Grid_Generator::set_representation(Representation r) {
-  expr.set_representation(r);
-}
-
-inline dimension_type
-Grid_Generator::max_space_dimension() {
-  return Linear_Expression::max_space_dimension() - 1;
-}
-
-inline dimension_type
-Grid_Generator::space_dimension() const {
-  return wrapped_expr.space_dimension();
-}
-
-inline void
-Grid_Generator::set_space_dimension(dimension_type space_dim) {
-  const dimension_type old_space_dim = space_dimension();
-  if (space_dim > old_space_dim) {
-    expr.set_space_dimension(space_dim + 1);
-    expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-  } else {
-    expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-    expr.set_space_dimension(space_dim + 1);
-  }
-  PPL_ASSERT(space_dimension() == space_dim);
-}
-
-inline void
-Grid_Generator::set_space_dimension_no_ok(dimension_type space_dim) {
-  set_space_dimension(space_dim);
-}
-
-inline void
-Grid_Generator::shift_space_dimensions(Variable v, dimension_type n) {
-  expr.shift_space_dimensions(v, n);
-}
-
-inline Grid_Generator::Type
-Grid_Generator::type() const {
-  if (is_line())
-    return LINE;
-  return is_point() ? POINT : PARAMETER;
-}
-
-inline bool
-Grid_Generator::is_line() const {
-  return is_line_or_equality();
-}
-
-inline bool
-Grid_Generator::is_parameter() const {
-  return is_parameter_or_point() && is_line_or_parameter();
-}
-
-inline bool
-Grid_Generator::is_line_or_parameter() const {
-  return expr.inhomogeneous_term() == 0;
-}
-
-inline bool
-Grid_Generator::is_point() const {
-  return !is_line_or_parameter();
-}
-
-inline bool
-Grid_Generator::is_parameter_or_point() const {
-  return is_ray_or_point_or_inequality();
-}
-
-inline void
-Grid_Generator::set_divisor(Coefficient_traits::const_reference d) {
-  PPL_ASSERT(!is_line());
-  if (is_line_or_parameter())
-    expr.set_coefficient(Variable(space_dimension()), d);
-  else
-    expr.set_inhomogeneous_term(d);
-}
-
-inline Coefficient_traits::const_reference
-Grid_Generator::divisor() const {
-  if (is_line())
-    throw_invalid_argument("divisor()", "*this is a line");
-  if (is_line_or_parameter())
-    return expr.coefficient(Variable(space_dimension()));
-  else
-    return expr.inhomogeneous_term();
-}
-
-inline bool
-Grid_Generator::is_equal_at_dimension(dimension_type dim,
-				      const Grid_Generator& y) const {
-  const Grid_Generator& x = *this;
-  return x.expr.get(dim) * y.divisor() == y.expr.get(dim) * x.divisor();
-}
-
-inline void
-Grid_Generator::set_is_line() {
-  set_is_line_or_equality();
-}
-
-inline void
-Grid_Generator::set_is_parameter_or_point() {
-  set_is_ray_or_point_or_inequality();
-}
-
-inline Grid_Generator&
-Grid_Generator::operator=(const Grid_Generator& g) {
-  Grid_Generator tmp = g;
-  swap(*this, tmp);
-
-  return *this;
-}
-
-inline Coefficient_traits::const_reference
-Grid_Generator::coefficient(const Variable v) const {
-  if (v.space_dimension() > space_dimension())
-    throw_dimension_incompatible("coefficient(v)", "v", v);
-  return expr.coefficient(v);
-}
-
-inline memory_size_type
-Grid_Generator::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline memory_size_type
-Grid_Generator::external_memory_in_bytes() const {
-  return expr.external_memory_in_bytes();
-}
-
-inline const Grid_Generator&
-Grid_Generator::zero_dim_point() {
-  PPL_ASSERT(zero_dim_point_p != 0);
-  return *zero_dim_point_p;
-}
-
-inline void
-Grid_Generator::strong_normalize() {
-  PPL_ASSERT(!is_parameter());
-  expr.normalize();
-  sign_normalize();
-}
-
-inline void
-Grid_Generator::m_swap(Grid_Generator& y) {
-  using std::swap;
-  swap(expr, y.expr);
-  swap(kind_, y.kind_);
-  // No need to modify wrapped_expr here.
-}
-
-/*! \relates Grid_Generator */
-inline bool
-operator==(const Grid_Generator& x, const Grid_Generator& y) {
-  return x.is_equivalent_to(y);
-}
-
-/*! \relates Grid_Generator */
-inline bool
-operator!=(const Grid_Generator& x, const Grid_Generator& y) {
-  return !(x == y);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-grid_line(const Linear_Expression& e, Representation r) {
-  return Grid_Generator::grid_line(e, r);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-parameter(const Linear_Expression& e,
-          Coefficient_traits::const_reference d, Representation r) {
-  return Grid_Generator::parameter(e, d, r);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-parameter(Representation r) {
-  return Grid_Generator::parameter(r);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-parameter(const Linear_Expression& e, Representation r) {
-  return Grid_Generator::parameter(e, r);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-grid_point(const Linear_Expression& e,
-           Coefficient_traits::const_reference d, Representation r) {
-  return Grid_Generator::grid_point(e, d, r);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-grid_point(Representation r) {
-  return Grid_Generator::grid_point(r);
-}
-
-/*! \relates Grid_Generator */
-inline Grid_Generator
-grid_point(const Linear_Expression& e, Representation r) {
-  return Grid_Generator::grid_point(e, r);
-}
-
-/*! \relates Grid_Generator */
-inline void
-swap(Grid_Generator& x, Grid_Generator& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Grid_Generator_inlines_hh)
diff --git a/src/Grid_Generator.types.hh b/src/Grid_Generator.types.hh
deleted file mode 100644
index 956b2a9..0000000
--- a/src/Grid_Generator.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Grid_Generator_types_hh
-#define PPL_Grid_Generator_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Grid_Generator;
-
-}
-
-#endif // !defined(PPL_Grid_Generator_types_hh)
diff --git a/src/Grid_Generator_System.cc b/src/Grid_Generator_System.cc
index 90aa58c..762aa27 100644
--- a/src/Grid_Generator_System.cc
+++ b/src/Grid_Generator_System.cc
@@ -1,6 +1,6 @@
 /* Grid_Generator_System class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,11 +22,11 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid_Generator_System.defs.hh"
-#include "Grid_Generator_System.inlines.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "Variables_Set.defs.hh"
+#include "Grid_Generator_System_defs.hh"
+#include "Grid_Generator_System_inlines.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "Variables_Set_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -74,8 +74,8 @@ PPL::Grid_Generator_System::insert(Grid_Generator& g, Recycle_Input) {
 void
 PPL::Grid_Generator_System
 ::affine_image(Variable v,
-	       const Linear_Expression& expr,
-	       Coefficient_traits::const_reference denominator) {
+               const Linear_Expression& expr,
+               Coefficient_traits::const_reference denominator) {
   // This is mostly a copy of Generator_System::affine_image.
 
   Grid_Generator_System& x = *this;
@@ -153,7 +153,7 @@ PPL::Grid_Generator_System::OK() const {
   if (sys.topology() == NOT_NECESSARILY_CLOSED) {
 #ifndef NDEBUG
     std::cerr << "Grid_Generator_System is NOT_NECESSARILY_CLOSED"
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
@@ -161,7 +161,7 @@ PPL::Grid_Generator_System::OK() const {
   if (sys.is_sorted()) {
 #ifndef NDEBUG
     std::cerr << "Grid_Generator_System is marked as sorted."
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
@@ -172,7 +172,7 @@ PPL::Grid_Generator_System::OK() const {
 /*! \relates Parma_Polyhedra_Library::Grid_Generator_System */
 std::ostream&
 PPL::IO_Operators::operator<<(std::ostream& s,
-			      const Grid_Generator_System& gs) {
+                              const Grid_Generator_System& gs) {
   Grid_Generator_System::const_iterator i = gs.begin();
   const Grid_Generator_System::const_iterator gs_end = gs.end();
   if (i == gs_end)
@@ -261,14 +261,14 @@ PPL::Grid_Generator_System::num_lines() const {
   // If the Linear_System happens to be sorted, take advantage of the fact
   // that lines are at the top of the system.
   if (sys.is_sorted()) {
-    dimension_type nrows = num_rows();
+    const dimension_type nrows = num_rows();
     for (dimension_type i = 0; i < nrows && ggs[i].is_line(); ++i)
       ++n;
   }
   else {
     for (dimension_type i = num_rows(); i-- > 0 ; )
       if (ggs[i].is_line())
-	++n;
+        ++n;
   }
   return n;
 }
@@ -287,12 +287,12 @@ PPL::Grid_Generator_System::num_parameters() const {
     for (dimension_type i = num_rows();
          i != 0 && ggs[--i].is_parameter_or_point(); )
       if (ggs[i].is_line_or_parameter())
-	++n;
+        ++n;
   }
   else {
     for (dimension_type i = num_rows(); i-- > 0 ; )
       if (ggs[i].is_parameter())
-	++n;
+        ++n;
   }
   return n;
 }
diff --git a/src/Grid_Generator_System.defs.hh b/src/Grid_Generator_System.defs.hh
deleted file mode 100644
index 6827233..0000000
--- a/src/Grid_Generator_System.defs.hh
+++ /dev/null
@@ -1,514 +0,0 @@
-/* Grid_Generator_System class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Generator_System_defs_hh
-#define PPL_Grid_Generator_System_defs_hh 1
-
-#include "Grid_Generator_System.types.hh"
-
-#include "Linear_System.defs.hh"
-#include "Grid_Generator.defs.hh"
-#include "Variables_Set.types.hh"
-#include "Polyhedron.types.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Grid_Generator_System
-  Writes <CODE>false</CODE> if \p gs is empty.  Otherwise, writes on
-  \p s the generators of \p gs, all in one row and separated by ", ".
-*/
-std::ostream& operator<<(std::ostream& s, const Grid_Generator_System& gs);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Grid_Generator_System */
-void swap(Grid_Generator_System& x, Grid_Generator_System& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates Grid_Generator_System */
-bool operator==(const Grid_Generator_System& x,
-		const Grid_Generator_System& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A system of grid generators.
-/*! \ingroup PPL_CXX_interface
-    An object of the class Grid_Generator_System is a system of
-    grid generators, i.e., a multiset of objects of the class
-    Grid_Generator (lines, parameters and points).
-    When inserting generators in a system, space dimensions are
-    automatically adjusted so that all the generators in the system
-    are defined on the same vector space.
-    A system of grid generators which is meant to define a non-empty
-    grid must include at least one point: the reason is that
-    lines and parameters need a supporting point
-    (lines only specify directions while parameters only
-    specify direction and distance.
-
-    \par
-     In all the examples it is assumed that variables
-    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
-    \code
-  Variable x(0);
-  Variable y(1);
-    \endcode
-
-    \par Example 1
-    The following code defines the line having the same direction
-    as the \f$x\f$ axis (i.e., the first Cartesian axis)
-    in \f$\Rset^2\f$:
-    \code
-  Grid_Generator_System gs;
-  gs.insert(grid_line(x + 0*y));
-    \endcode
-    As said above, this system of generators corresponds to
-    an empty grid, because the line has no supporting point.
-    To define a system of generators that does correspond to
-    the \f$x\f$ axis, we can add the following code which
-    inserts the origin of the space as a point:
-    \code
-  gs.insert(grid_point(0*x + 0*y));
-    \endcode
-    Since space dimensions are automatically adjusted, the following
-    code obtains the same effect:
-    \code
-  gs.insert(grid_point(0*x));
-    \endcode
-    In contrast, if we had added the following code, we would have
-    defined a line parallel to the \f$x\f$ axis through
-    the point \f$(0, 1)^\transpose \in \Rset^2\f$.
-    \code
-  gs.insert(grid_point(0*x + 1*y));
-    \endcode
-
-    \par Example 2
-    The following code builds a system of generators corresponding
-    to the grid consisting of all the integral points on the \f$x\f$ axes;
-    that is, all points satisfying the congruence relation
-    \f[
-      \bigl\{\,
-        (x, 0)^\transpose \in \Rset^2
-      \bigm|
-        x \pmod{1}\ 0
-      \,\bigr\},
-    \f]
-    \code
-  Grid_Generator_System gs;
-  gs.insert(parameter(x + 0*y));
-  gs.insert(grid_point(0*x + 0*y));
-    \endcode
-
-    \par Example 3
-    The following code builds a system of generators having three points
-    corresponding to a non-relational grid consisting of all points
-    whose coordinates are integer multiple of 3.
-    \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(0*x + 0*y));
-  gs.insert(grid_point(0*x + 3*y));
-  gs.insert(grid_point(3*x + 0*y));
-    \endcode
-
-    \par Example 4
-    By using parameters instead of two of the points we
-    can define the same grid as that defined in the previous example.
-    Note that there has to be at least one point and, for this purpose,
-    any point in the grid could be considered.
-    Thus the following code builds two identical grids from the
-    grid generator systems \p gs and \p gs1.
-    \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(0*x + 0*y));
-  gs.insert(parameter(0*x + 3*y));
-  gs.insert(parameter(3*x + 0*y));
-  Grid_Generator_System gs1;
-  gs1.insert(grid_point(3*x + 3*y));
-  gs1.insert(parameter(0*x + 3*y));
-  gs1.insert(parameter(3*x + 0*y));
-    \endcode
-
-    \par Example 5
-    The following code builds a system of generators having one point and
-    a parameter corresponding to all the integral points that
-    lie on \f$x + y = 2\f$ in \f$\Rset^2\f$
-    \code
-  Grid_Generator_System gs;
-  gs.insert(grid_point(1*x + 1*y));
-  gs.insert(parameter(1*x - 1*y));
-    \endcode
-
-    \note
-    After inserting a multiset of generators in a grid generator system,
-    there are no guarantees that an <EM>exact</EM> copy of them
-    can be retrieved:
-    in general, only an <EM>equivalent</EM> grid generator system
-    will be available, where original generators may have been
-    reordered, removed (if they are duplicate or redundant), etc.
-*/
-class Parma_Polyhedra_Library::Grid_Generator_System {
-public:
-  typedef Grid_Generator row_type;
-
-  static const Representation default_representation = SPARSE;
-
-  //! Default constructor: builds an empty system of generators.
-  explicit Grid_Generator_System(Representation r = default_representation);
-
-  //! Builds the singleton system containing only generator \p g.
-  explicit Grid_Generator_System(const Grid_Generator& g,
-                                 Representation r = default_representation);
-
-  //! Builds an empty system of generators of dimension \p dim.
-  explicit Grid_Generator_System(dimension_type dim,
-                                 Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  //! The new Grid_Generator_System will have the same representation as `gs'.
-  Grid_Generator_System(const Grid_Generator_System& gs);
-
-  //! Copy constructor with specified representation.
-  Grid_Generator_System(const Grid_Generator_System& gs, Representation r);
-
-  //! Destructor.
-  ~Grid_Generator_System();
-
-  //! Assignment operator.
-  Grid_Generator_System& operator=(const Grid_Generator_System& y);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Grid_Generator_System can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Removes all the generators from the generator system and sets its
-    space dimension to 0.
-  */
-  void clear();
-
-  /*! \brief
-    Inserts into \p *this a copy of the generator \p g, increasing the
-    number of space dimensions if needed.
-
-    If \p g is an all-zero parameter then the only action is to ensure
-    that the space dimension of \p *this is at least the space
-    dimension of \p g.
-  */
-  void insert(const Grid_Generator& g);
-
-  /*! \brief
-    Inserts into \p *this the generator \p g, increasing the number of
-    space dimensions if needed.
-  */
-  void insert(Grid_Generator& g, Recycle_Input);
-
-  /*! \brief
-    Inserts into \p *this the generators in \p gs, increasing the
-    number of space dimensions if needed.
-  */
-  void insert(Grid_Generator_System& gs, Recycle_Input);
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  /*! \brief
-    Returns the singleton system containing only
-    Grid_Generator::zero_dim_point().
-  */
-  static const Grid_Generator_System& zero_dim_univ();
-
-  //! An iterator over a system of grid generators
-  /*! \ingroup PPL_CXX_interface
-    A const_iterator is used to provide read-only access
-    to each generator contained in an object of Grid_Generator_System.
-
-    \par Example
-    The following code prints the system of generators
-    of the grid <CODE>gr</CODE>:
-    \code
-  const Grid_Generator_System& ggs = gr.generators();
-  for (Grid_Generator_System::const_iterator i = ggs.begin(),
-        ggs_end = ggs.end(); i != ggs_end; ++i)
-    cout << *i << endl;
-    \endcode
-    The same effect can be obtained more concisely by using
-    more features of the STL:
-    \code
-  const Grid_Generator_System& ggs = gr.generators();
-  copy(ggs.begin(), ggs.end(), ostream_iterator<Grid_Generator>(cout, "\n"));
-    \endcode
-  */
-  class const_iterator
-    : public std::iterator<std::forward_iterator_tag,
-			   Grid_Generator,
-			   ptrdiff_t,
-			   const Grid_Generator*,
-			   const Grid_Generator&> {
-  public:
-    //! Default constructor.
-    const_iterator();
-
-    //! Ordinary copy constructor.
-    const_iterator(const const_iterator& y);
-
-    //! Destructor.
-    ~const_iterator();
-
-    //! Assignment operator.
-    const_iterator& operator=(const const_iterator& y);
-
-    //! Dereference operator.
-    const Grid_Generator& operator*() const;
-
-    //! Indirect member selector.
-    const Grid_Generator* operator->() const;
-
-    //! Prefix increment operator.
-    const_iterator& operator++();
-
-    //! Postfix increment operator.
-    const_iterator operator++(int);
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this and \p y are
-      identical.
-    */
-    bool operator==(const const_iterator& y) const;
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this and \p y are
-      different.
-    */
-    bool operator!=(const const_iterator& y) const;
-
-  private:
-    friend class Grid_Generator_System;
-
-    Linear_System<Grid_Generator>::const_iterator i;
-
-    //! Copy constructor from Linear_System< Grid_Generator>::const_iterator.
-    const_iterator(const Linear_System<Grid_Generator>::const_iterator& y);
-  };
-
-  //! Returns <CODE>true</CODE> if and only if \p *this has no generators.
-  bool empty() const;
-
-  /*! \brief
-    Returns the const_iterator pointing to the first generator, if \p
-    *this is not empty; otherwise, returns the past-the-end
-    const_iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const_iterator.
-  const_iterator end() const;
-
-  //! Returns the number of rows (generators) in the system.
-  dimension_type num_rows() const;
-
-  //! Returns the number of parameters in the system.
-  dimension_type num_parameters() const;
-
-  //! Returns the number of lines in the system.
-  dimension_type num_lines() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this contains one or
-    more points.
-  */
-  bool has_points() const;
-
-  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
-  bool is_equal_to(const Grid_Generator_System& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-
-    Resizes the matrix of generators using the numbers of rows and columns
-    read from \p s, then initializes the coordinates of each generator
-    and its type reading the contents from \p s.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Grid_Generator_System& y);
-
-private:
-  //! Returns a constant reference to the \p k- th generator of the system.
-  const Grid_Generator& operator[](dimension_type k) const;
-
-  //! Assigns to a given variable an affine expression.
-  /*!
-    \param v
-    The variable to which the affine transformation is assigned;
-
-    \param expr
-    The numerator of the affine transformation:
-    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
-
-    \param denominator
-    The denominator of the affine transformation;
-
-    We allow affine transformations (see the Section \ref
-    rational_grid_operations)to have rational
-    coefficients. Since the coefficients of linear expressions are
-    integers we also provide an integer \p denominator that will
-    be used as denominator of the affine transformation.  The
-    denominator is required to be a positive integer and its
-    default value is 1.
-
-    The affine transformation assigns to every variable \p v, in every
-    column, the follow expression:
-    \f[
-      \frac{\sum_{i = 0}^{n - 1} a_i x_i + b}
-           {\mathrm{denominator}}.
-    \f]
-
-    \p expr is a constant parameter and unaltered by this computation.
-  */
-  void affine_image(Variable v,
-                    const Linear_Expression& expr,
-                    Coefficient_traits::const_reference denominator);
-
-  //! Sets the sortedness flag of the system to \p b.
-  void set_sorted(bool b);
-
-  /*! \brief
-    Adds \p dims rows and \p dims columns of zeroes to the matrix,
-    initializing the added rows as in the universe system.
-
-    \param dims
-    The number of rows and columns to be added: must be strictly
-    positive.
-
-    Turns the \f$r \times c\f$ matrix \f$A\f$ into the \f$(r+dims)
-    \times (c+dims)\f$ matrix
-    \f$\bigl(\genfrac{}{}{0pt}{}{A}{0} \genfrac{}{}{0pt}{}{0}{B}\bigr)\f$
-    where \f$B\f$ is the \f$dims \times dims\f$ unit matrix of the form
-    \f$\bigl(\genfrac{}{}{0pt}{}{1}{0} \genfrac{}{}{0pt}{}{0}{1}\bigr)\f$.
-    The matrix is expanded avoiding reallocation whenever possible.
-  */
-  void add_universe_rows_and_columns(dimension_type dims);
-
-  //! Resizes the system to the specified space dimension.
-  void set_space_dimension(dimension_type space_dim);
-
-  //! Removes all the specified dimensions from the generator system.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Sets the index to indicate that the system has no pending rows.
-  void unset_pending_rows();
-
-  //! Permutes the space dimensions of the matrix.
-  /*
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    columns must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  bool has_no_rows() const;
-
-  //! Makes the system shrink by removing its \p n trailing rows.
-  void remove_trailing_rows(dimension_type n);
-
-  void insert_verbatim(const Grid_Generator& g);
-
-  //! Returns the system topology.
-  Topology topology() const;
-
-  //! Returns the index of the first pending row.
-  dimension_type first_pending_row() const;
-
-  Linear_System<Grid_Generator> sys;
-
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the singleton system containing only Grid_Generator::zero_dim_point().
-  */
-  static const Grid_Generator_System* zero_dim_univ_p;
-
-  friend bool
-  operator==(const Grid_Generator_System& x, const Grid_Generator_System& y);
-
-  //! Sets the index of the first pending row to \p i.
-  void set_index_first_pending_row(dimension_type i);
-
-  //! Removes all the invalid lines and parameters.
-  /*!
-    The invalid lines and parameters are those with all
-    the homogeneous terms set to zero.
-  */
-  void remove_invalid_lines_and_parameters();
-
-  friend class Polyhedron;
-  friend class Grid;
-};
-
-// Grid_Generator_System.inlines.hh is not included here on purpose.
-
-#endif // !defined(PPL_Grid_Generator_System_defs_hh)
diff --git a/src/Grid_Generator_System.inlines.hh b/src/Grid_Generator_System.inlines.hh
deleted file mode 100644
index 7e43231..0000000
--- a/src/Grid_Generator_System.inlines.hh
+++ /dev/null
@@ -1,279 +0,0 @@
-/* Grid_Generator_System class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Generator_System_inlines_hh
-#define PPL_Grid_Generator_System_inlines_hh 1
-
-#include "Grid_Generator.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-Grid_Generator_System::set_sorted(bool b) {
-  sys.set_sorted(b);
-}
-
-inline void
-Grid_Generator_System::unset_pending_rows() {
-  sys.unset_pending_rows();
-}
-
-inline void
-Grid_Generator_System::set_index_first_pending_row(const dimension_type i) {
-  sys.set_index_first_pending_row(i);
-}
-
-inline void
-Grid_Generator_System
-::permute_space_dimensions(const std::vector<Variable>& cycle) {
-  return sys.permute_space_dimensions(cycle);
-}
-
-inline bool
-Grid_Generator_System::is_equal_to(const Grid_Generator_System& y) const {
-  return (sys == y.sys);
-}
-
-inline
-Grid_Generator_System::Grid_Generator_System(Representation r)
-  : sys(NECESSARILY_CLOSED, r) {
-  sys.set_sorted(false);
-  PPL_ASSERT(space_dimension() == 0);
-}
-
-inline
-Grid_Generator_System::Grid_Generator_System(const Grid_Generator_System& gs)
-  : sys(gs.sys) {
-}
-
-inline
-Grid_Generator_System::Grid_Generator_System(const Grid_Generator_System& gs,
-                                             Representation r)
-  : sys(gs.sys, r) {
-}
-
-inline
-Grid_Generator_System::Grid_Generator_System(dimension_type dim,
-                                             Representation r)
-  : sys(NECESSARILY_CLOSED, r) {
-  sys.set_space_dimension(dim);
-  sys.set_sorted(false);
-  PPL_ASSERT(space_dimension() == dim);
-}
-
-inline
-Grid_Generator_System::Grid_Generator_System(const Grid_Generator& g,
-                                             Representation r)
-  : sys(NECESSARILY_CLOSED, r) {
-  sys.insert(g);
-  sys.set_sorted(false);
-}
-
-inline
-Grid_Generator_System::~Grid_Generator_System() {
-}
-
-inline Grid_Generator_System&
-Grid_Generator_System::operator=(const Grid_Generator_System& y) {
-  Grid_Generator_System tmp = y;
-  swap(*this, tmp);
-  return *this;
-}
-
-inline Representation
-Grid_Generator_System::representation() const {
-  return sys.representation();
-}
-
-inline void
-Grid_Generator_System::set_representation(Representation r) {
-  sys.set_representation(r);
-}
-
-inline dimension_type
-Grid_Generator_System::max_space_dimension() {
-  // Grid generators use an extra column for the parameter divisor.
-  return Linear_System<Grid_Generator>::max_space_dimension() - 1;
-}
-
-inline dimension_type
-Grid_Generator_System::space_dimension() const {
-  return sys.space_dimension();
-}
-
-inline const Grid_Generator_System&
-Grid_Generator_System::zero_dim_univ() {
-  PPL_ASSERT(zero_dim_univ_p != 0);
-  return *zero_dim_univ_p;
-}
-
-inline void
-Grid_Generator_System::clear() {
-  sys.clear();
-  sys.set_sorted(false);
-  sys.unset_pending_rows();
-  PPL_ASSERT(space_dimension() == 0);
-}
-
-inline void
-Grid_Generator_System::m_swap(Grid_Generator_System& y) {
-  swap(sys, y.sys);
-}
-
-inline memory_size_type
-Grid_Generator_System::external_memory_in_bytes() const {
-  return sys.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Grid_Generator_System::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-inline dimension_type
-Grid_Generator_System::num_rows() const {
-  return sys.num_rows();
-}
-
-inline
-Grid_Generator_System::const_iterator::const_iterator()
-  : i() {
-}
-
-inline
-Grid_Generator_System::const_iterator::const_iterator(const const_iterator& y)
-  : i(y.i) {
-}
-
-inline
-Grid_Generator_System::const_iterator::~const_iterator() {
-}
-
-inline Grid_Generator_System::const_iterator&
-Grid_Generator_System::const_iterator::operator=(const const_iterator& y) {
-  i = y.i;
-  return *this;
-}
-
-inline const Grid_Generator&
-Grid_Generator_System::const_iterator::operator*() const {
-  return *i;
-}
-
-inline const Grid_Generator*
-Grid_Generator_System::const_iterator::operator->() const {
-  return i.operator->();
-}
-
-inline Grid_Generator_System::const_iterator&
-Grid_Generator_System::const_iterator::operator++() {
-  ++i;
-  return *this;
-}
-
-inline Grid_Generator_System::const_iterator
-Grid_Generator_System::const_iterator::operator++(int) {
-  const const_iterator tmp = *this;
-  operator++();
-  return tmp;
-}
-
-inline bool
-Grid_Generator_System
-::const_iterator::operator==(const const_iterator& y) const {
-  return i == y.i;
-}
-
-inline bool
-Grid_Generator_System
-::const_iterator::operator!=(const const_iterator& y) const {
-  return i != y.i;
-}
-
-inline bool
-Grid_Generator_System::empty() const {
-  return sys.has_no_rows();
-}
-
-inline
-Grid_Generator_System::const_iterator
-::const_iterator(const Linear_System<Grid_Generator>::const_iterator& y)
-  : i(y) {
-}
-
-inline Grid_Generator_System::const_iterator
-Grid_Generator_System::begin() const {
-  return static_cast<Grid_Generator_System::const_iterator>(sys.begin());
-}
-
-inline Grid_Generator_System::const_iterator
-Grid_Generator_System::end() const {
-  return static_cast<Grid_Generator_System::const_iterator>(sys.end());
-}
-
-inline const Grid_Generator&
-Grid_Generator_System::operator[](const dimension_type k) const {
-  return sys[k];
-}
-
-inline bool
-Grid_Generator_System::has_no_rows() const {
-  return sys.has_no_rows();
-}
-
-inline void
-Grid_Generator_System::remove_trailing_rows(dimension_type n) {
-  sys.remove_trailing_rows(n);
-}
-
-inline void
-Grid_Generator_System::insert_verbatim(const Grid_Generator& g) {
-  sys.insert(g);
-}
-
-inline Topology
-Grid_Generator_System::topology() const {
-  return sys.topology();
-}
-
-inline dimension_type
-Grid_Generator_System::first_pending_row() const {
-  return sys.first_pending_row();
-}
-
-/*! \relates Grid_Generator_System */
-inline bool
-operator==(const Grid_Generator_System& x,
-	   const Grid_Generator_System& y) {
-  return x.is_equal_to(y);
-}
-
-/*! \relates Grid_Generator_System */
-inline void
-swap(Grid_Generator_System& x, Grid_Generator_System& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Grid_Generator_System_inlines_hh)
diff --git a/src/Grid_Generator_System.types.hh b/src/Grid_Generator_System.types.hh
deleted file mode 100644
index 73bda4c..0000000
--- a/src/Grid_Generator_System.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Grid_Generator_System_types_hh
-#define PPL_Grid_Generator_System_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Grid_Generator_System;
-
-}
-
-#endif // !defined(PPL_Grid_Generator_System_types_hh)
diff --git a/src/Grid_Generator_System_defs.hh b/src/Grid_Generator_System_defs.hh
new file mode 100644
index 0000000..efe2f98
--- /dev/null
+++ b/src/Grid_Generator_System_defs.hh
@@ -0,0 +1,514 @@
+/* Grid_Generator_System class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Generator_System_defs_hh
+#define PPL_Grid_Generator_System_defs_hh 1
+
+#include "Grid_Generator_System_types.hh"
+
+#include "Linear_System_defs.hh"
+#include "Grid_Generator_defs.hh"
+#include "Variables_Set_types.hh"
+#include "Polyhedron_types.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Grid_Generator_System
+  Writes <CODE>false</CODE> if \p gs is empty.  Otherwise, writes on
+  \p s the generators of \p gs, all in one row and separated by ", ".
+*/
+std::ostream& operator<<(std::ostream& s, const Grid_Generator_System& gs);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Grid_Generator_System */
+void swap(Grid_Generator_System& x, Grid_Generator_System& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates Grid_Generator_System */
+bool operator==(const Grid_Generator_System& x,
+                const Grid_Generator_System& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A system of grid generators.
+/*! \ingroup PPL_CXX_interface
+    An object of the class Grid_Generator_System is a system of
+    grid generators, i.e., a multiset of objects of the class
+    Grid_Generator (lines, parameters and points).
+    When inserting generators in a system, space dimensions are
+    automatically adjusted so that all the generators in the system
+    are defined on the same vector space.
+    A system of grid generators which is meant to define a non-empty
+    grid must include at least one point: the reason is that
+    lines and parameters need a supporting point
+    (lines only specify directions while parameters only
+    specify direction and distance.
+
+    \par
+     In all the examples it is assumed that variables
+    <CODE>x</CODE> and <CODE>y</CODE> are defined as follows:
+    \code
+  Variable x(0);
+  Variable y(1);
+    \endcode
+
+    \par Example 1
+    The following code defines the line having the same direction
+    as the \f$x\f$ axis (i.e., the first Cartesian axis)
+    in \f$\Rset^2\f$:
+    \code
+  Grid_Generator_System gs;
+  gs.insert(grid_line(x + 0*y));
+    \endcode
+    As said above, this system of generators corresponds to
+    an empty grid, because the line has no supporting point.
+    To define a system of generators that does correspond to
+    the \f$x\f$ axis, we can add the following code which
+    inserts the origin of the space as a point:
+    \code
+  gs.insert(grid_point(0*x + 0*y));
+    \endcode
+    Since space dimensions are automatically adjusted, the following
+    code obtains the same effect:
+    \code
+  gs.insert(grid_point(0*x));
+    \endcode
+    In contrast, if we had added the following code, we would have
+    defined a line parallel to the \f$x\f$ axis through
+    the point \f$(0, 1)^\transpose \in \Rset^2\f$.
+    \code
+  gs.insert(grid_point(0*x + 1*y));
+    \endcode
+
+    \par Example 2
+    The following code builds a system of generators corresponding
+    to the grid consisting of all the integral points on the \f$x\f$ axes;
+    that is, all points satisfying the congruence relation
+    \f[
+      \bigl\{\,
+        (x, 0)^\transpose \in \Rset^2
+      \bigm|
+        x \pmod{1}\ 0
+      \,\bigr\},
+    \f]
+    \code
+  Grid_Generator_System gs;
+  gs.insert(parameter(x + 0*y));
+  gs.insert(grid_point(0*x + 0*y));
+    \endcode
+
+    \par Example 3
+    The following code builds a system of generators having three points
+    corresponding to a non-relational grid consisting of all points
+    whose coordinates are integer multiple of 3.
+    \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(0*x + 0*y));
+  gs.insert(grid_point(0*x + 3*y));
+  gs.insert(grid_point(3*x + 0*y));
+    \endcode
+
+    \par Example 4
+    By using parameters instead of two of the points we
+    can define the same grid as that defined in the previous example.
+    Note that there has to be at least one point and, for this purpose,
+    any point in the grid could be considered.
+    Thus the following code builds two identical grids from the
+    grid generator systems \p gs and \p gs1.
+    \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(0*x + 0*y));
+  gs.insert(parameter(0*x + 3*y));
+  gs.insert(parameter(3*x + 0*y));
+  Grid_Generator_System gs1;
+  gs1.insert(grid_point(3*x + 3*y));
+  gs1.insert(parameter(0*x + 3*y));
+  gs1.insert(parameter(3*x + 0*y));
+    \endcode
+
+    \par Example 5
+    The following code builds a system of generators having one point and
+    a parameter corresponding to all the integral points that
+    lie on \f$x + y = 2\f$ in \f$\Rset^2\f$
+    \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(1*x + 1*y));
+  gs.insert(parameter(1*x - 1*y));
+    \endcode
+
+    \note
+    After inserting a multiset of generators in a grid generator system,
+    there are no guarantees that an <EM>exact</EM> copy of them
+    can be retrieved:
+    in general, only an <EM>equivalent</EM> grid generator system
+    will be available, where original generators may have been
+    reordered, removed (if they are duplicate or redundant), etc.
+*/
+class Parma_Polyhedra_Library::Grid_Generator_System {
+public:
+  typedef Grid_Generator row_type;
+
+  static const Representation default_representation = SPARSE;
+
+  //! Default constructor: builds an empty system of generators.
+  explicit Grid_Generator_System(Representation r = default_representation);
+
+  //! Builds the singleton system containing only generator \p g.
+  explicit Grid_Generator_System(const Grid_Generator& g,
+                                 Representation r = default_representation);
+
+  //! Builds an empty system of generators of dimension \p dim.
+  explicit Grid_Generator_System(dimension_type dim,
+                                 Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  //! The new Grid_Generator_System will have the same representation as `gs'.
+  Grid_Generator_System(const Grid_Generator_System& gs);
+
+  //! Copy constructor with specified representation.
+  Grid_Generator_System(const Grid_Generator_System& gs, Representation r);
+
+  //! Destructor.
+  ~Grid_Generator_System();
+
+  //! Assignment operator.
+  Grid_Generator_System& operator=(const Grid_Generator_System& y);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Grid_Generator_System can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Removes all the generators from the generator system and sets its
+    space dimension to 0.
+  */
+  void clear();
+
+  /*! \brief
+    Inserts into \p *this a copy of the generator \p g, increasing the
+    number of space dimensions if needed.
+
+    If \p g is an all-zero parameter then the only action is to ensure
+    that the space dimension of \p *this is at least the space
+    dimension of \p g.
+  */
+  void insert(const Grid_Generator& g);
+
+  /*! \brief
+    Inserts into \p *this the generator \p g, increasing the number of
+    space dimensions if needed.
+  */
+  void insert(Grid_Generator& g, Recycle_Input);
+
+  /*! \brief
+    Inserts into \p *this the generators in \p gs, increasing the
+    number of space dimensions if needed.
+  */
+  void insert(Grid_Generator_System& gs, Recycle_Input);
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  /*! \brief
+    Returns the singleton system containing only
+    Grid_Generator::zero_dim_point().
+  */
+  static const Grid_Generator_System& zero_dim_univ();
+
+  //! An iterator over a system of grid generators
+  /*! \ingroup PPL_CXX_interface
+    A const_iterator is used to provide read-only access
+    to each generator contained in an object of Grid_Generator_System.
+
+    \par Example
+    The following code prints the system of generators
+    of the grid <CODE>gr</CODE>:
+    \code
+  const Grid_Generator_System& ggs = gr.generators();
+  for (Grid_Generator_System::const_iterator i = ggs.begin(),
+        ggs_end = ggs.end(); i != ggs_end; ++i)
+    cout << *i << endl;
+    \endcode
+    The same effect can be obtained more concisely by using
+    more features of the STL:
+    \code
+  const Grid_Generator_System& ggs = gr.generators();
+  copy(ggs.begin(), ggs.end(), ostream_iterator<Grid_Generator>(cout, "\n"));
+    \endcode
+  */
+  class const_iterator
+    : public std::iterator<std::forward_iterator_tag,
+                           Grid_Generator,
+                           ptrdiff_t,
+                           const Grid_Generator*,
+                           const Grid_Generator&> {
+  public:
+    //! Default constructor.
+    const_iterator();
+
+    //! Ordinary copy constructor.
+    const_iterator(const const_iterator& y);
+
+    //! Destructor.
+    ~const_iterator();
+
+    //! Assignment operator.
+    const_iterator& operator=(const const_iterator& y);
+
+    //! Dereference operator.
+    const Grid_Generator& operator*() const;
+
+    //! Indirect member selector.
+    const Grid_Generator* operator->() const;
+
+    //! Prefix increment operator.
+    const_iterator& operator++();
+
+    //! Postfix increment operator.
+    const_iterator operator++(int);
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this and \p y are
+      identical.
+    */
+    bool operator==(const const_iterator& y) const;
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this and \p y are
+      different.
+    */
+    bool operator!=(const const_iterator& y) const;
+
+  private:
+    friend class Grid_Generator_System;
+
+    Linear_System<Grid_Generator>::const_iterator i;
+
+    //! Copy constructor from Linear_System< Grid_Generator>::const_iterator.
+    const_iterator(const Linear_System<Grid_Generator>::const_iterator& y);
+  };
+
+  //! Returns <CODE>true</CODE> if and only if \p *this has no generators.
+  bool empty() const;
+
+  /*! \brief
+    Returns the const_iterator pointing to the first generator, if \p
+    *this is not empty; otherwise, returns the past-the-end
+    const_iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const_iterator.
+  const_iterator end() const;
+
+  //! Returns the number of rows (generators) in the system.
+  dimension_type num_rows() const;
+
+  //! Returns the number of parameters in the system.
+  dimension_type num_parameters() const;
+
+  //! Returns the number of lines in the system.
+  dimension_type num_lines() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this contains one or
+    more points.
+  */
+  bool has_points() const;
+
+  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
+  bool is_equal_to(const Grid_Generator_System& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+
+    Resizes the matrix of generators using the numbers of rows and columns
+    read from \p s, then initializes the coordinates of each generator
+    and its type reading the contents from \p s.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Grid_Generator_System& y);
+
+private:
+  //! Returns a constant reference to the \p k- th generator of the system.
+  const Grid_Generator& operator[](dimension_type k) const;
+
+  //! Assigns to a given variable an affine expression.
+  /*!
+    \param v
+    The variable to which the affine transformation is assigned;
+
+    \param expr
+    The numerator of the affine transformation:
+    \f$\sum_{i = 0}^{n - 1} a_i x_i + b\f$;
+
+    \param denominator
+    The denominator of the affine transformation;
+
+    We allow affine transformations (see the Section \ref
+    rational_grid_operations)to have rational
+    coefficients. Since the coefficients of linear expressions are
+    integers we also provide an integer \p denominator that will
+    be used as denominator of the affine transformation.  The
+    denominator is required to be a positive integer and its
+    default value is 1.
+
+    The affine transformation assigns to every variable \p v, in every
+    column, the follow expression:
+    \f[
+      \frac{\sum_{i = 0}^{n - 1} a_i x_i + b}
+           {\mathrm{denominator}}.
+    \f]
+
+    \p expr is a constant parameter and unaltered by this computation.
+  */
+  void affine_image(Variable v,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator);
+
+  //! Sets the sortedness flag of the system to \p b.
+  void set_sorted(bool b);
+
+  /*! \brief
+    Adds \p dims rows and \p dims columns of zeroes to the matrix,
+    initializing the added rows as in the universe system.
+
+    \param dims
+    The number of rows and columns to be added: must be strictly
+    positive.
+
+    Turns the \f$r \times c\f$ matrix \f$A\f$ into the \f$(r+dims)
+    \times (c+dims)\f$ matrix
+    \f$\bigl(\genfrac{}{}{0pt}{}{A}{0} \genfrac{}{}{0pt}{}{0}{B}\bigr)\f$
+    where \f$B\f$ is the \f$dims \times dims\f$ unit matrix of the form
+    \f$\bigl(\genfrac{}{}{0pt}{}{1}{0} \genfrac{}{}{0pt}{}{0}{1}\bigr)\f$.
+    The matrix is expanded avoiding reallocation whenever possible.
+  */
+  void add_universe_rows_and_columns(dimension_type dims);
+
+  //! Resizes the system to the specified space dimension.
+  void set_space_dimension(dimension_type space_dim);
+
+  //! Removes all the specified dimensions from the generator system.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Sets the index to indicate that the system has no pending rows.
+  void unset_pending_rows();
+
+  //! Permutes the space dimensions of the matrix.
+  /*
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    columns must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  bool has_no_rows() const;
+
+  //! Makes the system shrink by removing its \p n trailing rows.
+  void remove_trailing_rows(dimension_type n);
+
+  void insert_verbatim(const Grid_Generator& g);
+
+  //! Returns the system topology.
+  Topology topology() const;
+
+  //! Returns the index of the first pending row.
+  dimension_type first_pending_row() const;
+
+  Linear_System<Grid_Generator> sys;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the singleton system containing only Grid_Generator::zero_dim_point().
+  */
+  static const Grid_Generator_System* zero_dim_univ_p;
+
+  friend bool
+  operator==(const Grid_Generator_System& x, const Grid_Generator_System& y);
+
+  //! Sets the index of the first pending row to \p i.
+  void set_index_first_pending_row(dimension_type i);
+
+  //! Removes all the invalid lines and parameters.
+  /*!
+    The invalid lines and parameters are those with all
+    the homogeneous terms set to zero.
+  */
+  void remove_invalid_lines_and_parameters();
+
+  friend class Polyhedron;
+  friend class Grid;
+};
+
+// Grid_Generator_System_inlines.hh is not included here on purpose.
+
+#endif // !defined(PPL_Grid_Generator_System_defs_hh)
diff --git a/src/Grid_Generator_System_inlines.hh b/src/Grid_Generator_System_inlines.hh
new file mode 100644
index 0000000..4b4b56f
--- /dev/null
+++ b/src/Grid_Generator_System_inlines.hh
@@ -0,0 +1,279 @@
+/* Grid_Generator_System class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Generator_System_inlines_hh
+#define PPL_Grid_Generator_System_inlines_hh 1
+
+#include "Grid_Generator_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+Grid_Generator_System::set_sorted(bool b) {
+  sys.set_sorted(b);
+}
+
+inline void
+Grid_Generator_System::unset_pending_rows() {
+  sys.unset_pending_rows();
+}
+
+inline void
+Grid_Generator_System::set_index_first_pending_row(const dimension_type i) {
+  sys.set_index_first_pending_row(i);
+}
+
+inline void
+Grid_Generator_System
+::permute_space_dimensions(const std::vector<Variable>& cycle) {
+  return sys.permute_space_dimensions(cycle);
+}
+
+inline bool
+Grid_Generator_System::is_equal_to(const Grid_Generator_System& y) const {
+  return (sys == y.sys);
+}
+
+inline
+Grid_Generator_System::Grid_Generator_System(Representation r)
+  : sys(NECESSARILY_CLOSED, r) {
+  sys.set_sorted(false);
+  PPL_ASSERT(space_dimension() == 0);
+}
+
+inline
+Grid_Generator_System::Grid_Generator_System(const Grid_Generator_System& gs)
+  : sys(gs.sys) {
+}
+
+inline
+Grid_Generator_System::Grid_Generator_System(const Grid_Generator_System& gs,
+                                             Representation r)
+  : sys(gs.sys, r) {
+}
+
+inline
+Grid_Generator_System::Grid_Generator_System(dimension_type dim,
+                                             Representation r)
+  : sys(NECESSARILY_CLOSED, r) {
+  sys.set_space_dimension(dim);
+  sys.set_sorted(false);
+  PPL_ASSERT(space_dimension() == dim);
+}
+
+inline
+Grid_Generator_System::Grid_Generator_System(const Grid_Generator& g,
+                                             Representation r)
+  : sys(NECESSARILY_CLOSED, r) {
+  sys.insert(g);
+  sys.set_sorted(false);
+}
+
+inline
+Grid_Generator_System::~Grid_Generator_System() {
+}
+
+inline Grid_Generator_System&
+Grid_Generator_System::operator=(const Grid_Generator_System& y) {
+  Grid_Generator_System tmp = y;
+  swap(*this, tmp);
+  return *this;
+}
+
+inline Representation
+Grid_Generator_System::representation() const {
+  return sys.representation();
+}
+
+inline void
+Grid_Generator_System::set_representation(Representation r) {
+  sys.set_representation(r);
+}
+
+inline dimension_type
+Grid_Generator_System::max_space_dimension() {
+  // Grid generators use an extra column for the parameter divisor.
+  return Linear_System<Grid_Generator>::max_space_dimension() - 1;
+}
+
+inline dimension_type
+Grid_Generator_System::space_dimension() const {
+  return sys.space_dimension();
+}
+
+inline const Grid_Generator_System&
+Grid_Generator_System::zero_dim_univ() {
+  PPL_ASSERT(zero_dim_univ_p != 0);
+  return *zero_dim_univ_p;
+}
+
+inline void
+Grid_Generator_System::clear() {
+  sys.clear();
+  sys.set_sorted(false);
+  sys.unset_pending_rows();
+  PPL_ASSERT(space_dimension() == 0);
+}
+
+inline void
+Grid_Generator_System::m_swap(Grid_Generator_System& y) {
+  swap(sys, y.sys);
+}
+
+inline memory_size_type
+Grid_Generator_System::external_memory_in_bytes() const {
+  return sys.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Grid_Generator_System::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+inline dimension_type
+Grid_Generator_System::num_rows() const {
+  return sys.num_rows();
+}
+
+inline
+Grid_Generator_System::const_iterator::const_iterator()
+  : i() {
+}
+
+inline
+Grid_Generator_System::const_iterator::const_iterator(const const_iterator& y)
+  : i(y.i) {
+}
+
+inline
+Grid_Generator_System::const_iterator::~const_iterator() {
+}
+
+inline Grid_Generator_System::const_iterator&
+Grid_Generator_System::const_iterator::operator=(const const_iterator& y) {
+  i = y.i;
+  return *this;
+}
+
+inline const Grid_Generator&
+Grid_Generator_System::const_iterator::operator*() const {
+  return *i;
+}
+
+inline const Grid_Generator*
+Grid_Generator_System::const_iterator::operator->() const {
+  return i.operator->();
+}
+
+inline Grid_Generator_System::const_iterator&
+Grid_Generator_System::const_iterator::operator++() {
+  ++i;
+  return *this;
+}
+
+inline Grid_Generator_System::const_iterator
+Grid_Generator_System::const_iterator::operator++(int) {
+  const const_iterator tmp = *this;
+  operator++();
+  return tmp;
+}
+
+inline bool
+Grid_Generator_System
+::const_iterator::operator==(const const_iterator& y) const {
+  return i == y.i;
+}
+
+inline bool
+Grid_Generator_System
+::const_iterator::operator!=(const const_iterator& y) const {
+  return i != y.i;
+}
+
+inline bool
+Grid_Generator_System::empty() const {
+  return sys.has_no_rows();
+}
+
+inline
+Grid_Generator_System::const_iterator
+::const_iterator(const Linear_System<Grid_Generator>::const_iterator& y)
+  : i(y) {
+}
+
+inline Grid_Generator_System::const_iterator
+Grid_Generator_System::begin() const {
+  return static_cast<Grid_Generator_System::const_iterator>(sys.begin());
+}
+
+inline Grid_Generator_System::const_iterator
+Grid_Generator_System::end() const {
+  return static_cast<Grid_Generator_System::const_iterator>(sys.end());
+}
+
+inline const Grid_Generator&
+Grid_Generator_System::operator[](const dimension_type k) const {
+  return sys[k];
+}
+
+inline bool
+Grid_Generator_System::has_no_rows() const {
+  return sys.has_no_rows();
+}
+
+inline void
+Grid_Generator_System::remove_trailing_rows(dimension_type n) {
+  sys.remove_trailing_rows(n);
+}
+
+inline void
+Grid_Generator_System::insert_verbatim(const Grid_Generator& g) {
+  sys.insert(g);
+}
+
+inline Topology
+Grid_Generator_System::topology() const {
+  return sys.topology();
+}
+
+inline dimension_type
+Grid_Generator_System::first_pending_row() const {
+  return sys.first_pending_row();
+}
+
+/*! \relates Grid_Generator_System */
+inline bool
+operator==(const Grid_Generator_System& x,
+           const Grid_Generator_System& y) {
+  return x.is_equal_to(y);
+}
+
+/*! \relates Grid_Generator_System */
+inline void
+swap(Grid_Generator_System& x, Grid_Generator_System& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Grid_Generator_System_inlines_hh)
diff --git a/src/Grid_Generator_System_types.hh b/src/Grid_Generator_System_types.hh
new file mode 100644
index 0000000..3c5dff7
--- /dev/null
+++ b/src/Grid_Generator_System_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Grid_Generator_System_types_hh
+#define PPL_Grid_Generator_System_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Grid_Generator_System;
+
+}
+
+#endif // !defined(PPL_Grid_Generator_System_types_hh)
diff --git a/src/Grid_Generator_defs.hh b/src/Grid_Generator_defs.hh
new file mode 100644
index 0000000..d3b03ea
--- /dev/null
+++ b/src/Grid_Generator_defs.hh
@@ -0,0 +1,796 @@
+/* Grid_Generator class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Generator_defs_hh
+#define PPL_Grid_Generator_defs_hh 1
+
+#include "Grid_Generator_types.hh"
+#include "Grid_types.hh"
+
+#include "Variables_Set_types.hh"
+#include "Grid_Generator_System_types.hh"
+#include "Linear_System_types.hh"
+
+#include "Coefficient_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Topology_types.hh"
+#include "Expression_Hide_Inhomo_defs.hh"
+#include "Expression_Hide_Last_defs.hh"
+
+#include "Grid_types.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+// Put these in the namespace here to declare them friend later.
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The basic comparison function.
+/*! \relates Grid_Generator
+  \return
+  The returned absolute value can be \f$0\f$, \f$1\f$ or \f$2\f$.
+
+  \param x
+  A row of coefficients;
+
+  \param y
+  Another row.
+
+  Compares \p x and \p y, where \p x and \p y may be of different size,
+  in which case the "missing" coefficients are assumed to be zero.
+  The comparison is such that:
+  -# equalities are smaller than inequalities;
+  -# lines are smaller than points and rays;
+  -# the ordering is lexicographic;
+  -# the positions compared are, in decreasing order of significance,
+     1, 2, ..., \p size(), 0;
+  -# the result is negative, zero, or positive if x is smaller than,
+     equal to, or greater than y, respectively;
+  -# when \p x and \p y are different, the absolute value of the
+     result is 1 if the difference is due to the coefficient in
+     position 0; it is 2 otherwise.
+
+  When \p x and \p y represent the hyper-planes associated
+  to two equality or inequality constraints, the coefficient
+  at 0 is the known term.
+  In this case, the return value can be characterized as follows:
+  - -2, if \p x is smaller than \p y and they are \e not parallel;
+  - -1, if \p x is smaller than \p y and they \e are parallel;
+  -  0, if \p x and y are equal;
+  - +1, if \p y is smaller than \p x and they \e are parallel;
+  - +2, if \p y is smaller than \p x and they are \e not parallel.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+int compare(const Grid_Generator& x, const Grid_Generator& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Grid_Generator */
+std::ostream& operator<<(std::ostream& s, const Grid_Generator& g);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Grid_Generator */
+void swap(Grid_Generator& x, Grid_Generator& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A grid line, parameter or grid point.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Grid_Generator is one of the following:
+
+  - a grid_line \f$\vect{l} = (a_0, \ldots, a_{n-1})^\transpose\f$;
+
+  - a parameter
+    \f$\vect{q} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
+
+  - a grid_point
+    \f$\vect{p} = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$;
+
+  where \f$n\f$ is the dimension of the space
+  and, for grid_points and parameters, \f$d > 0\f$ is the divisor.
+
+  \par How to build a grid generator.
+  Each type of generator is built by applying the corresponding
+  function (<CODE>grid_line</CODE>, <CODE>parameter</CODE>
+  or <CODE>grid_point</CODE>) to a linear expression;
+  the space dimension of the generator is defined as the space dimension
+  of the corresponding linear expression.
+  Linear expressions used to define a generator should be homogeneous
+  (any constant term will be simply ignored).
+  When defining grid points and parameters, an optional Coefficient argument
+  can be used as a common <EM>divisor</EM> for all the coefficients
+  occurring in the provided linear expression;
+  the default value for this argument is 1.
+
+  \par
+  In all the following examples it is assumed that variables
+  <CODE>x</CODE>, <CODE>y</CODE> and <CODE>z</CODE>
+  are defined as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable z(2);
+  \endcode
+
+  \par Example 1
+  The following code builds a grid line with direction \f$x-y-z\f$
+  and having space dimension \f$3\f$:
+  \code
+  Grid_Generator l = grid_line(x - y - z);
+  \endcode
+  By definition, the origin of the space is not a line, so that
+  the following code throws an exception:
+  \code
+  Grid_Generator l = grid_line(0*x);
+  \endcode
+
+  \par Example 2
+  The following code builds the parameter as the vector
+  \f$\vect{p} = (1, -1, -1)^\transpose \in \Rset^3\f$
+  which has the same direction as the line in Example 1:
+  \code
+  Grid_Generator q = parameter(x - y - z);
+  \endcode
+  Note that, unlike lines, for parameters, the length as well
+  as the direction of the vector represented by the code is significant.
+  Thus \p q is \e not the same as the parameter \p q1 defined by
+  \code
+  Grid_Generator q1 = parameter(2x - 2y - 2z);
+  \endcode
+  By definition, the origin of the space is not a parameter, so that
+  the following code throws an exception:
+  \code
+  Grid_Generator q = parameter(0*x);
+  \endcode
+
+  \par Example 3
+  The following code builds the grid point
+  \f$\vect{p} = (1, 0, 2)^\transpose \in \Rset^3\f$:
+  \code
+  Grid_Generator p = grid_point(1*x + 0*y + 2*z);
+  \endcode
+  The same effect can be obtained by using the following code:
+  \code
+  Grid_Generator p = grid_point(x + 2*z);
+  \endcode
+  Similarly, the origin \f$\vect{0} \in \Rset^3\f$ can be defined
+  using either one of the following lines of code:
+  \code
+  Grid_Generator origin3 = grid_point(0*x + 0*y + 0*z);
+  Grid_Generator origin3_alt = grid_point(0*z);
+  \endcode
+  Note however that the following code would have defined
+  a different point, namely \f$\vect{0} \in \Rset^2\f$:
+  \code
+  Grid_Generator origin2 = grid_point(0*y);
+  \endcode
+  The following two lines of code both define the only grid point
+  having space dimension zero, namely \f$\vect{0} \in \Rset^0\f$.
+  In the second case we exploit the fact that the first argument
+  of the function <CODE>point</CODE> is optional.
+  \code
+  Grid_Generator origin0 = Generator::zero_dim_point();
+  Grid_Generator origin0_alt = grid_point();
+  \endcode
+
+  \par Example 4
+  The grid point \f$\vect{p}\f$ specified in Example 3 above
+  can also be obtained with the following code,
+  where we provide a non-default value for the second argument
+  of the function <CODE>grid_point</CODE> (the divisor):
+  \code
+  Grid_Generator p = grid_point(2*x + 0*y + 4*z, 2);
+  \endcode
+  Obviously, the divisor can be used to specify
+  points having some non-integer (but rational) coordinates.
+  For instance, the grid point
+  \f$\vect{p1} = (-1.5, 3.2, 2.1)^\transpose \in \Rset^3\f$
+  can be specified by the following code:
+  \code
+  Grid_Generator p1 = grid_point(-15*x + 32*y + 21*z, 10);
+  \endcode
+  If a zero divisor is provided, an exception is thrown.
+
+  \par Example 5
+  Parameters, like grid points can have a divisor.
+  For instance, the parameter
+  \f$\vect{q} = (1, 0, 2)^\transpose \in \Rset^3\f$ can be defined:
+  \code
+  Grid_Generator q = parameter(2*x + 0*y + 4*z, 2);
+  \endcode
+  Also, the divisor can be used to specify
+  parameters having some non-integer (but rational) coordinates.
+  For instance, the parameter
+  \f$\vect{q} = (-1.5, 3.2, 2.1)^\transpose \in \Rset^3\f$
+  can be defined:
+  \code
+  Grid_Generator q = parameter(-15*x + 32*y + 21*z, 10);
+  \endcode
+  If a zero divisor is provided, an exception is thrown.
+
+  \par How to inspect a grid generator
+  Several methods are provided to examine a grid generator and extract
+  all the encoded information: its space dimension, its type and
+  the value of its integer coefficients and the value of the denominator.
+
+  \par Example 6
+  The following code shows how it is possible to access each single
+  coefficient of a grid generator.
+  If <CODE>g1</CODE> is a grid point having coordinates
+  \f$(a_0, \ldots, a_{n-1})^\transpose\f$,
+  we construct the parameter <CODE>g2</CODE> having coordinates
+  \f$(a_0, 2 a_1, \ldots, (i+1)a_i, \ldots, n a_{n-1})^\transpose\f$.
+  \code
+  if (g1.is_point()) {
+    cout << "Grid point g1: " << g1 << endl;
+    Linear_Expression e;
+    for (dimension_type i = g1.space_dimension(); i-- > 0; )
+      e += (i + 1) * g1.coefficient(Variable(i)) * Variable(i);
+    Grid_Generator g2 = parameter(e, g1.divisor());
+    cout << "Parameter g2: " << g2 << endl;
+  }
+  else
+    cout << "Grid generator g1 is not a grid point." << endl;
+  \endcode
+  Therefore, for the grid point
+  \code
+  Grid_Generator g1 = grid_point(2*x - y + 3*z, 2);
+  \endcode
+  we would obtain the following output:
+  \code
+  Grid point g1: p((2*A - B + 3*C)/2)
+  Parameter g2: parameter((2*A - 2*B + 9*C)/2)
+  \endcode
+  When working with grid points and parameters, be careful not to confuse
+  the notion of <EM>coefficient</EM> with the notion of <EM>coordinate</EM>:
+  these are equivalent only when the divisor is 1.
+*/
+class Parma_Polyhedra_Library::Grid_Generator {
+public:
+
+  //! The possible kinds of Grid_Generator objects.
+  enum Kind {
+    LINE_OR_EQUALITY = 0,
+    RAY_OR_POINT_OR_INEQUALITY = 1
+  };
+
+  //! The representation used for new Grid_Generators.
+  /*!
+    \note The copy constructor and the copy constructor with specified size
+          use the representation of the original object, so that it is
+          indistinguishable from the original object.
+  */
+  static const Representation default_representation = SPARSE;
+
+  //! Returns the line of direction \p e.
+  /*!
+    \exception std::invalid_argument
+    Thrown if the homogeneous part of \p e represents the origin of
+    the vector space.
+  */
+  static Grid_Generator grid_line(const Linear_Expression& e,
+                                  Representation r = default_representation);
+
+  //! Returns the parameter of direction \p e and size \p e/d, with the same
+  //! representation as e.
+  /*!
+    Both \p e and \p d are optional arguments, with default values
+    Linear_Expression::zero() and Coefficient_one(), respectively.
+
+    \exception std::invalid_argument
+    Thrown if \p d is zero.
+  */
+  static Grid_Generator parameter(const Linear_Expression& e
+                                  = Linear_Expression::zero(),
+                                  Coefficient_traits::const_reference d
+                                  = Coefficient_one(),
+                                  Representation r = default_representation);
+
+  // TODO: Improve the documentation of this method.
+  //! Returns the parameter of direction and size \p Linear_Expression::zero() .
+  static Grid_Generator parameter(Representation r);
+
+  //! Returns the parameter of direction and size \p e .
+  static Grid_Generator parameter(const Linear_Expression& e,
+                                  Representation r);
+
+  //! Returns the point at \p e / \p d.
+  /*!
+    Both \p e and \p d are optional arguments, with default values
+    Linear_Expression::zero() and Coefficient_one(), respectively.
+
+    \exception std::invalid_argument
+    Thrown if \p d is zero.
+  */
+  static Grid_Generator grid_point(const Linear_Expression& e
+                                   = Linear_Expression::zero(),
+                                   Coefficient_traits::const_reference d
+                                   = Coefficient_one(),
+                                   Representation r = default_representation);
+
+  //! Returns the point at \p e .
+  static Grid_Generator grid_point(Representation r);
+
+  //! Returns the point at \p e .
+  static Grid_Generator grid_point(const Linear_Expression& e,
+                                   Representation r);
+
+  //! Returns the origin of the zero-dimensional space \f$\Rset^0\f$.
+  explicit Grid_Generator(Representation r = default_representation);
+
+  //! Ordinary copy constructor.
+  //! The new Grid_Generator will have the same representation as g.
+  Grid_Generator(const Grid_Generator& g);
+
+  //! Copy constructor with specified representation.
+  Grid_Generator(const Grid_Generator& g, Representation r);
+
+  //! Copy constructor with specified space dimension.
+  //! The new Grid_Generator will have the same representation as g.
+  Grid_Generator(const Grid_Generator& g, dimension_type space_dim);
+
+  //! Copy constructor with specified space dimension and representation.
+  Grid_Generator(const Grid_Generator& g, dimension_type space_dim,
+                 Representation r);
+
+  //! Destructor.
+  ~Grid_Generator();
+
+  //! Assignment operator.
+  Grid_Generator& operator=(const Grid_Generator& g);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Grid_Generator can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Sets the dimension of the vector space enclosing \p *this to
+  //! \p space_dim .
+  void set_space_dimension(dimension_type space_dim);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Removes all the specified dimensions from the grid generator.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+
+    Always returns \p true. The return value is needed for compatibility with
+    the Generator class.
+  */
+  bool remove_space_dimensions(const Variables_Set& vars);
+
+  //! Permutes the space dimensions of the grid generator.
+  /*
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! The generator type.
+  enum Type {
+    /*! The generator is a grid line. */
+    LINE,
+    /*! The generator is a parameter. */
+    PARAMETER,
+    /*! The generator is a grid point. */
+    POINT
+  };
+
+  //! Returns the generator type of \p *this.
+  Type type() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a line.
+  bool is_line() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a parameter.
+  bool is_parameter() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is a line or
+    a parameter.
+  */
+  bool is_line_or_parameter() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a point.
+  bool is_point() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row represents a
+    parameter or a point.
+  */
+  bool is_parameter_or_point() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  /*!
+    \exception std::invalid_argument
+    Thrown if the index of \p v is greater than or equal to the
+    space dimension of \p *this.
+  */
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns the divisor of \p *this.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this is a line.
+  */
+  Coefficient_traits::const_reference divisor() const;
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  //! Returns the origin of the zero-dimensional space \f$\Rset^0\f$.
+  static const Grid_Generator& zero_dim_point();
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y are
+    equivalent generators.
+
+    Generators having different space dimensions are not equivalent.
+  */
+  bool is_equivalent_to(const Grid_Generator& y) const;
+
+  //! Returns <CODE>true</CODE> if \p *this is identical to \p y.
+  /*!
+    This is faster than is_equivalent_to(), but it may return `false' even
+    for equivalent generators.
+  */
+  bool is_equal_to(const Grid_Generator& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous terms
+    of \p *this are \f$0\f$.
+  */
+  bool all_homogeneous_terms_are_zero() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Grid_Generator& y);
+
+  /*! \brief
+    Scales \p *this to be represented with a divisor of \p d (if
+    \*this is a parameter or point). Does nothing at all on lines.
+
+    It is assumed that \p d is a multiple of the current divisor
+    and different from zero. The behavior is undefined if the assumption
+    does not hold.
+  */
+  void scale_to_divisor(Coefficient_traits::const_reference d);
+
+  //! Sets the divisor of \p *this to \p d.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this is a line.
+  */
+  void set_divisor(Coefficient_traits::const_reference d);
+
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> >
+  expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
+
+private:
+  Linear_Expression expr;
+
+  Kind kind_;
+
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the origin of the zero-dimensional space \f$\Rset^0\f$.
+  */
+  static const Grid_Generator* zero_dim_point_p;
+
+  //! Constructs a Grid_Generator with the specified space dimension, kind
+  //! and topology.
+  Grid_Generator(dimension_type space_dim, Kind kind, Topology topology,
+                 Representation r = default_representation);
+
+  // TODO: Avoid reducing the space dimension.
+  /*! \brief
+    Constructs a grid generator of type \p t from linear expression \p e,
+    stealing the underlying data structures from \p e.
+
+    The last column in \p e becomes the parameter divisor column of
+    the new Grid_Generator.
+
+    \note The new Grid_Generator will have the same representation as `e'.
+  */
+  Grid_Generator(Linear_Expression& e, Type t);
+
+  //! Sets the dimension of the vector space enclosing \p *this to
+  //! \p space_dim .
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  /*!
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid objects.
+  */
+  void set_space_dimension_no_ok(dimension_type space_dim);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if \p *this is equal to \p gg in
+    dimension \p dim.
+  */
+  bool is_equal_at_dimension(dimension_type dim,
+                             const Grid_Generator& gg) const;
+
+  /*! \brief
+    A print function, with fancy, more human-friendly output.
+
+    This is used by operator<<().
+  */
+  void fancy_print(std::ostream& s) const;
+
+  //! Converts the Grid_Generator into a parameter.
+  void set_is_parameter();
+
+  //! Sets the Grid_Generator kind to <CODE>LINE_OR_EQUALITY</CODE>.
+  void set_is_line();
+
+  //! Sets the Grid_Generator kind to <CODE>RAY_OR_POINT_OR_INEQUALITY</CODE>.
+  void set_is_parameter_or_point();
+
+  //! \name Flags inspection methods
+  //@{
+  //! Returns the topological kind of \p *this.
+  Topology topology() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the topology
+    of \p *this row is not necessarily closed.
+  */
+  bool is_not_necessarily_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the topology
+    of \p *this row is necessarily closed.
+  */
+  bool is_necessarily_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row
+    represents a line or an equality.
+  */
+  bool is_line_or_equality() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this row
+    represents a ray, a point or an inequality.
+  */
+  bool is_ray_or_point_or_inequality() const;
+  //@} // Flags inspection methods
+
+  //! \name Flags coercion methods
+  //@{
+
+  //! Sets to \p x the topological kind of \p *this row.
+  void set_topology(Topology x);
+
+  //! Sets to \p NECESSARILY_CLOSED the topological kind of \p *this row.
+  void set_necessarily_closed();
+
+  //! Sets to \p NOT_NECESSARILY_CLOSED the topological kind of \p *this row.
+  void set_not_necessarily_closed();
+
+  //! Sets to \p LINE_OR_EQUALITY the kind of \p *this row.
+  void set_is_line_or_equality();
+
+  //! Sets to \p RAY_OR_POINT_OR_INEQUALITY the kind of \p *this row.
+  void set_is_ray_or_point_or_inequality();
+  //@} // Flags coercion methods
+
+  /*! \brief
+    Normalizes the sign of the coefficients so that the first non-zero
+    (homogeneous) coefficient of a line-or-equality is positive.
+  */
+  void sign_normalize();
+
+  /*! \brief
+    Strong normalization: ensures that different Grid_Generator objects
+    represent different hyperplanes or hyperspaces.
+
+    Applies both Grid_Generator::normalize() and Grid_Generator::sign_normalize().
+  */
+  void strong_normalize();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the coefficients are
+    strongly normalized.
+  */
+  bool check_strong_normalized() const;
+
+  //! Linearly combines \p *this with \p y so that i-th coefficient is 0.
+  /*!
+    \param y
+    The Grid_Generator that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting Grid_Generator to \p *this and normalizes it.
+  */
+  void linear_combine(const Grid_Generator& y, dimension_type i);
+
+  /*! \brief
+    Throw a <CODE>std::invalid_argument</CODE> exception containing
+    the appropriate error message.
+  */
+  void
+  throw_dimension_incompatible(const char* method,
+                               const char* name_var,
+                               const Variable v) const;
+
+  /*! \brief
+    Throw a <CODE>std::invalid_argument</CODE> exception containing
+    the appropriate error message.
+  */
+  void
+  throw_invalid_argument(const char* method, const char* reason) const;
+
+  friend std::ostream&
+  IO_Operators::operator<<(std::ostream& s, const Grid_Generator& g);
+
+  friend int
+  compare(const Grid_Generator& x, const Grid_Generator& y);
+
+  friend class Expression_Adapter<Grid_Generator>;
+  friend class Grid_Generator_System;
+  friend class Grid;
+  friend class Linear_System<Grid_Generator>;
+  friend class Scalar_Products;
+  friend class Topology_Adjusted_Scalar_Product_Sign;
+};
+
+
+namespace Parma_Polyhedra_Library {
+
+/*! \brief
+  Shorthand for
+  Grid_Generator::grid_line(const Linear_Expression& e, Representation r).
+
+  \relates Grid_Generator
+*/
+Grid_Generator
+grid_line(const Linear_Expression& e,
+          Representation r = Grid_Generator::default_representation);
+
+/*! \brief
+  Shorthand for
+  Grid_Generator::parameter(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
+
+  \relates Grid_Generator
+*/
+Grid_Generator
+parameter(const Linear_Expression& e = Linear_Expression::zero(),
+          Coefficient_traits::const_reference d = Coefficient_one(),
+          Representation r = Grid_Generator::default_representation);
+
+//! Shorthand for Grid_Generator::parameter(Representation r).
+/*! \relates Grid_Generator */
+Grid_Generator
+parameter(Representation r);
+
+/*! \brief
+  Shorthand for
+  Grid_Generator::parameter(const Linear_Expression& e, Representation r).
+
+  \relates Grid_Generator
+*/
+Grid_Generator
+parameter(const Linear_Expression& e, Representation r);
+
+/*! \brief
+  Shorthand for
+  Grid_Generator::grid_point(const Linear_Expression& e, Coefficient_traits::const_reference d, Representation r).
+
+  \relates Grid_Generator
+*/
+Grid_Generator
+grid_point(const Linear_Expression& e = Linear_Expression::zero(),
+           Coefficient_traits::const_reference d = Coefficient_one(),
+           Representation r = Grid_Generator::default_representation);
+
+//! Shorthand for Grid_Generator::grid_point(Representation r).
+/*! \relates Grid_Generator */
+Grid_Generator
+grid_point(Representation r);
+
+/*! \brief
+  Shorthand for
+  Grid_Generator::grid_point(const Linear_Expression& e, Representation r).
+
+  \relates Grid_Generator
+*/
+Grid_Generator
+grid_point(const Linear_Expression& e, Representation r);
+
+//! Returns <CODE>true</CODE> if and only if \p x is equivalent to \p y.
+/*! \relates Grid_Generator */
+bool operator==(const Grid_Generator& x, const Grid_Generator& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x is not equivalent to \p y.
+/*! \relates Grid_Generator */
+bool operator!=(const Grid_Generator& x, const Grid_Generator& y);
+
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Grid_Generator */
+std::ostream& operator<<(std::ostream& s, const Grid_Generator::Type& t);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Grid_Generator_inlines.hh"
+
+#endif // !defined(PPL_Grid_Generator_defs_hh)
diff --git a/src/Grid_Generator_inlines.hh b/src/Grid_Generator_inlines.hh
new file mode 100644
index 0000000..2d7b6bb
--- /dev/null
+++ b/src/Grid_Generator_inlines.hh
@@ -0,0 +1,369 @@
+/* Grid Generator class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Generator_inlines_hh
+#define PPL_Grid_Generator_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline bool
+Grid_Generator::is_necessarily_closed() const {
+  return true;
+}
+
+inline bool
+Grid_Generator::is_not_necessarily_closed() const {
+  return false;
+}
+
+inline bool
+Grid_Generator::is_line_or_equality() const {
+  return (kind_ == LINE_OR_EQUALITY);
+}
+
+inline bool
+Grid_Generator::is_ray_or_point_or_inequality() const {
+  return (kind_ == RAY_OR_POINT_OR_INEQUALITY);
+}
+
+inline Topology
+Grid_Generator::topology() const {
+  return NECESSARILY_CLOSED;
+}
+
+inline void
+Grid_Generator::set_is_line_or_equality() {
+  kind_ = LINE_OR_EQUALITY;
+}
+
+inline void
+Grid_Generator::set_is_ray_or_point_or_inequality() {
+  kind_ = RAY_OR_POINT_OR_INEQUALITY;
+}
+
+inline void
+Grid_Generator::set_topology(Topology x) {
+  PPL_USED(x);
+  PPL_ASSERT(x == NECESSARILY_CLOSED);
+}
+
+inline void
+Grid_Generator::set_necessarily_closed() {
+  set_topology(NECESSARILY_CLOSED);
+}
+
+inline void
+Grid_Generator::set_not_necessarily_closed() {
+  set_topology(NOT_NECESSARILY_CLOSED);
+}
+
+inline
+Grid_Generator::Grid_Generator(Linear_Expression& e, Type type) {
+  swap(expr, e);
+  if (type == LINE)
+    kind_ = LINE_OR_EQUALITY;
+  else
+    kind_ = RAY_OR_POINT_OR_INEQUALITY;
+  PPL_ASSERT(OK());
+}
+
+inline
+Grid_Generator::Grid_Generator(Representation r)
+  : expr(Coefficient_one(), r),
+    kind_(RAY_OR_POINT_OR_INEQUALITY) {
+  expr.set_space_dimension(1);
+  PPL_ASSERT(OK());
+}
+
+inline
+Grid_Generator::Grid_Generator(const Grid_Generator& g)
+  : expr(g.expr),
+    kind_(g.kind_) {
+}
+
+inline
+Grid_Generator::Grid_Generator(const Grid_Generator& g, Representation r)
+  : expr(g.expr, r),
+    kind_(g.kind_) {
+}
+
+inline
+Grid_Generator::Grid_Generator(dimension_type space_dim, Kind kind,
+                               Topology topology, Representation r)
+  : expr(r),
+    kind_(kind) {
+  PPL_USED(topology);
+  PPL_ASSERT(topology == NECESSARILY_CLOSED);
+  expr.set_space_dimension(space_dim + 1);
+  PPL_ASSERT(space_dimension() == space_dim);
+}
+
+inline
+Grid_Generator::Grid_Generator(const Grid_Generator& g,
+                               dimension_type space_dim)
+  : expr(g.expr, space_dim + 1),
+    kind_(g.kind_) {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(space_dimension() == space_dim);
+}
+
+inline
+Grid_Generator::Grid_Generator(const Grid_Generator& g,
+                               dimension_type space_dim, Representation r)
+  : expr(g.expr, space_dim + 1, r),
+    kind_(g.kind_) {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(space_dimension() == space_dim);
+}
+
+inline
+Grid_Generator::~Grid_Generator() {
+}
+
+inline Grid_Generator::expr_type
+Grid_Generator::expression() const {
+  return expr_type(expr, true);
+}
+
+inline Representation
+Grid_Generator::representation() const {
+  return expr.representation();
+}
+
+inline void
+Grid_Generator::set_representation(Representation r) {
+  expr.set_representation(r);
+}
+
+inline dimension_type
+Grid_Generator::max_space_dimension() {
+  return Linear_Expression::max_space_dimension() - 1;
+}
+
+inline dimension_type
+Grid_Generator::space_dimension() const {
+  return expression().space_dimension();
+}
+
+inline void
+Grid_Generator::set_space_dimension(dimension_type space_dim) {
+  const dimension_type old_space_dim = space_dimension();
+  if (space_dim > old_space_dim) {
+    expr.set_space_dimension(space_dim + 1);
+    expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
+  }
+  else {
+    expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
+    expr.set_space_dimension(space_dim + 1);
+  }
+  PPL_ASSERT(space_dimension() == space_dim);
+}
+
+inline void
+Grid_Generator::set_space_dimension_no_ok(dimension_type space_dim) {
+  set_space_dimension(space_dim);
+}
+
+inline void
+Grid_Generator::shift_space_dimensions(Variable v, dimension_type n) {
+  expr.shift_space_dimensions(v, n);
+}
+
+inline Grid_Generator::Type
+Grid_Generator::type() const {
+  if (is_line())
+    return LINE;
+  return is_point() ? POINT : PARAMETER;
+}
+
+inline bool
+Grid_Generator::is_line() const {
+  return is_line_or_equality();
+}
+
+inline bool
+Grid_Generator::is_parameter() const {
+  return is_parameter_or_point() && is_line_or_parameter();
+}
+
+inline bool
+Grid_Generator::is_line_or_parameter() const {
+  return expr.inhomogeneous_term() == 0;
+}
+
+inline bool
+Grid_Generator::is_point() const {
+  return !is_line_or_parameter();
+}
+
+inline bool
+Grid_Generator::is_parameter_or_point() const {
+  return is_ray_or_point_or_inequality();
+}
+
+inline void
+Grid_Generator::set_divisor(Coefficient_traits::const_reference d) {
+  PPL_ASSERT(!is_line());
+  if (is_line_or_parameter())
+    expr.set_coefficient(Variable(space_dimension()), d);
+  else
+    expr.set_inhomogeneous_term(d);
+}
+
+inline Coefficient_traits::const_reference
+Grid_Generator::divisor() const {
+  if (is_line())
+    throw_invalid_argument("divisor()", "*this is a line");
+  if (is_line_or_parameter())
+    return expr.coefficient(Variable(space_dimension()));
+  else
+    return expr.inhomogeneous_term();
+}
+
+inline bool
+Grid_Generator::is_equal_at_dimension(dimension_type dim,
+                                      const Grid_Generator& y) const {
+  const Grid_Generator& x = *this;
+  return x.expr.get(dim) * y.divisor() == y.expr.get(dim) * x.divisor();
+}
+
+inline void
+Grid_Generator::set_is_line() {
+  set_is_line_or_equality();
+}
+
+inline void
+Grid_Generator::set_is_parameter_or_point() {
+  set_is_ray_or_point_or_inequality();
+}
+
+inline Grid_Generator&
+Grid_Generator::operator=(const Grid_Generator& g) {
+  Grid_Generator tmp = g;
+  swap(*this, tmp);
+
+  return *this;
+}
+
+inline Coefficient_traits::const_reference
+Grid_Generator::coefficient(const Variable v) const {
+  if (v.space_dimension() > space_dimension())
+    throw_dimension_incompatible("coefficient(v)", "v", v);
+  return expr.coefficient(v);
+}
+
+inline memory_size_type
+Grid_Generator::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline memory_size_type
+Grid_Generator::external_memory_in_bytes() const {
+  return expr.external_memory_in_bytes();
+}
+
+inline const Grid_Generator&
+Grid_Generator::zero_dim_point() {
+  PPL_ASSERT(zero_dim_point_p != 0);
+  return *zero_dim_point_p;
+}
+
+inline void
+Grid_Generator::strong_normalize() {
+  PPL_ASSERT(!is_parameter());
+  expr.normalize();
+  sign_normalize();
+}
+
+inline void
+Grid_Generator::m_swap(Grid_Generator& y) {
+  using std::swap;
+  swap(expr, y.expr);
+  swap(kind_, y.kind_);
+}
+
+/*! \relates Grid_Generator */
+inline bool
+operator==(const Grid_Generator& x, const Grid_Generator& y) {
+  return x.is_equivalent_to(y);
+}
+
+/*! \relates Grid_Generator */
+inline bool
+operator!=(const Grid_Generator& x, const Grid_Generator& y) {
+  return !(x == y);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+grid_line(const Linear_Expression& e, Representation r) {
+  return Grid_Generator::grid_line(e, r);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+parameter(const Linear_Expression& e,
+          Coefficient_traits::const_reference d, Representation r) {
+  return Grid_Generator::parameter(e, d, r);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+parameter(Representation r) {
+  return Grid_Generator::parameter(r);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+parameter(const Linear_Expression& e, Representation r) {
+  return Grid_Generator::parameter(e, r);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+grid_point(const Linear_Expression& e,
+           Coefficient_traits::const_reference d, Representation r) {
+  return Grid_Generator::grid_point(e, d, r);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+grid_point(Representation r) {
+  return Grid_Generator::grid_point(r);
+}
+
+/*! \relates Grid_Generator */
+inline Grid_Generator
+grid_point(const Linear_Expression& e, Representation r) {
+  return Grid_Generator::grid_point(e, r);
+}
+
+/*! \relates Grid_Generator */
+inline void
+swap(Grid_Generator& x, Grid_Generator& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Grid_Generator_inlines_hh)
diff --git a/src/Grid_Generator_types.hh b/src/Grid_Generator_types.hh
new file mode 100644
index 0000000..e7a86ad
--- /dev/null
+++ b/src/Grid_Generator_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Grid_Generator_types_hh
+#define PPL_Grid_Generator_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Grid_Generator;
+
+}
+
+#endif // !defined(PPL_Grid_Generator_types_hh)
diff --git a/src/Grid_Status.cc b/src/Grid_Status.cc
index ee42455..63b5edb 100644
--- a/src/Grid_Status.cc
+++ b/src/Grid_Status.cc
@@ -1,6 +1,6 @@
 /* Grid::Status class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid.defs.hh"
+#include "Grid_defs.hh"
 #include "assert.hh"
 #include <iostream>
 #include <string>
@@ -177,7 +177,7 @@ PPL::Grid::Status::OK() const {
       return true;
 #ifndef NDEBUG
     cerr << "The empty flag is incompatible with any other one."
-	 << endl << "Flags:" << endl;
+         << endl << "Flags:" << endl;
     ascii_dump(cerr);
 #endif
     return false;
@@ -189,7 +189,7 @@ PPL::Grid::Status::OK() const {
     cerr <<
       "If a saturation matrix is up-to-date, congruences and\n"
       "generators have to be both up-to-date."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -197,7 +197,7 @@ PPL::Grid::Status::OK() const {
   if (test_c_minimized() && !test_c_up_to_date()) {
 #ifndef NDEBUG
     cerr << "If congruences are minimized they must be up-to-date."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -205,7 +205,7 @@ PPL::Grid::Status::OK() const {
   if (test_g_minimized() && !test_g_up_to_date()) {
 #ifndef NDEBUG
     cerr << "If generators are minimized they must be up-to-date."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -213,7 +213,7 @@ PPL::Grid::Status::OK() const {
   if (test_c_pending() && test_g_pending()) {
 #ifndef NDEBUG
     cerr << "There cannot be both pending congruences and pending generators."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -224,7 +224,7 @@ PPL::Grid::Status::OK() const {
     cerr <<
       "If there are pending congruences or generators, congruences\n"
       "and generators must be minimized."
-	 << endl;
+         << endl;
 #endif
       return false;
     }
@@ -234,7 +234,7 @@ PPL::Grid::Status::OK() const {
     cerr <<
       "If there are pending congruences or generators, there must\n"
       "be at least a saturation matrix up-to-date."
-	 << endl;
+         << endl;
 #endif
       return false;
     }
diff --git a/src/Grid_Status.idefs.hh b/src/Grid_Status.idefs.hh
deleted file mode 100644
index 2c94896..0000000
--- a/src/Grid_Status.idefs.hh
+++ /dev/null
@@ -1,168 +0,0 @@
-/* Grid::Status class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Status_idefs_hh
-#define PPL_Grid_Status_idefs_hh 1
-
-#ifndef PPL_IN_Grid_CLASS
-#error "Do not include Grid_Status.idefs.hh directly; use Grid.defs.hh instead"
-#endif
-
-//! A conjunctive assertion about a grid.
-/*!
-  The assertions supported that are in use are:
-  - <EM>zero-dim universe</EM>: the grid is the zero-dimension
-    vector space \f$\Rset^0 = \{\cdot\}\f$;
-  - <EM>empty</EM>: the grid is the empty set;
-  - <EM>congruences up-to-date</EM>: the grid is correctly
-    characterized by the attached system of congruences, modulo the
-    processing of pending generators;
-  - <EM>generators up-to-date</EM>: the grid is correctly
-    characterized by the attached system of generators, modulo the
-    processing of pending congruences;
-  - <EM>congruences minimized</EM>: the non-pending part of the system
-    of congruences attached to the grid is in minimal form;
-  - <EM>generators minimized</EM>: the non-pending part of the system
-    of generators attached to the grid is in minimal form.
-
-  Other supported assertions are:
-  - <EM>congruences pending</EM>
-  - <EM>generators pending</EM>
-  - <EM>congruences' saturation matrix up-to-date</EM>
-  - <EM>generators' saturation matrix up-to-date</EM>.
-
-  Not all the conjunctions of these elementary assertions constitute
-  a legal Status.  In fact:
-  - <EM>zero-dim universe</EM> excludes any other assertion;
-  - <EM>empty</EM>: excludes any other assertion;
-  - <EM>congruences pending</EM> and <EM>generators pending</EM>
-    are mutually exclusive;
-  - <EM>congruences pending</EM> implies both <EM>congruences minimized</EM>
-    and <EM>generators minimized</EM>;
-  - <EM>generators pending</EM> implies both <EM>congruences minimized</EM>
-    and <EM>generators minimized</EM>;
-  - <EM>congruences minimized</EM> implies <EM>congruences up-to-date</EM>;
-  - <EM>generators minimized</EM> implies <EM>generators up-to-date</EM>;
-  - <EM>congruences' saturation matrix up-to-date</EM> implies both
-    <EM>congruences up-to-date</EM> and <EM>generators up-to-date</EM>;
-  - <EM>generators' saturation matrix up-to-date</EM> implies both
-    <EM>congruences up-to-date</EM> and <EM>generators up-to-date</EM>.
-*/
-class Status {
-public:
-  //! By default Status is the <EM>zero-dim universe</EM> assertion.
-  Status();
-
-  //! \name Test, remove or add an individual assertion from the conjunction
-  //@{
-  bool test_zero_dim_univ() const;
-  void reset_zero_dim_univ();
-  void set_zero_dim_univ();
-
-  bool test_empty() const;
-  void reset_empty();
-  void set_empty();
-
-  bool test_c_up_to_date() const;
-  void reset_c_up_to_date();
-  void set_c_up_to_date();
-
-  bool test_g_up_to_date() const;
-  void reset_g_up_to_date();
-  void set_g_up_to_date();
-
-  bool test_c_minimized() const;
-  void reset_c_minimized();
-  void set_c_minimized();
-
-  bool test_g_minimized() const;
-  void reset_g_minimized();
-  void set_g_minimized();
-
-  bool test_sat_c_up_to_date() const;
-  void reset_sat_c_up_to_date();
-  void set_sat_c_up_to_date();
-
-  bool test_sat_g_up_to_date() const;
-  void reset_sat_g_up_to_date();
-  void set_sat_g_up_to_date();
-
-  bool test_c_pending() const;
-  void reset_c_pending();
-  void set_c_pending();
-
-  bool test_g_pending() const;
-  void reset_g_pending();
-  void set_g_pending();
-  //@} // Test, remove or add an individual assertion from the conjunction
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-private:
-  //! Status is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bitmasks for the individual assertions
-  //@{
-  static const flags_t ZERO_DIM_UNIV    = 0U;
-  static const flags_t EMPTY            = 1U << 0;
-  static const flags_t C_UP_TO_DATE     = 1U << 1;
-  static const flags_t G_UP_TO_DATE     = 1U << 2;
-  static const flags_t C_MINIMIZED      = 1U << 3;
-  static const flags_t G_MINIMIZED      = 1U << 4;
-  static const flags_t SAT_C_UP_TO_DATE = 1U << 5;
-  static const flags_t SAT_G_UP_TO_DATE = 1U << 6;
-  static const flags_t CS_PENDING       = 1U << 7;
-  static const flags_t GS_PENDING       = 1U << 8;
-  //@} // Bitmasks for the individual assertions
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! Construct from a bitmask.
-  Status(flags_t mask);
-
-  //! Check whether <EM>all</EM> bits in \p mask are set.
-  bool test_all(flags_t mask) const;
-
-  //! Check whether <EM>at least one</EM> bit in \p mask is set.
-  bool test_any(flags_t mask) const;
-
-  //! Set the bits in \p mask.
-  void set(flags_t mask);
-
-  //! Reset the bits in \p mask.
-  void reset(flags_t mask);
-};
-
-#endif // !defined(PPL_Grid_Status_idefs_hh)
diff --git a/src/Grid_Status.inlines.hh b/src/Grid_Status.inlines.hh
deleted file mode 100644
index 935217a..0000000
--- a/src/Grid_Status.inlines.hh
+++ /dev/null
@@ -1,217 +0,0 @@
-/* Grid::Status class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Grid_Status_inlines_hh
-#define PPL_Grid_Status_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Grid::Status::Status(flags_t mask)
-  : flags(mask) {
-}
-
-inline
-Grid::Status::Status()
-  : flags(ZERO_DIM_UNIV) {
-}
-
-inline bool
-Grid::Status::test_all(flags_t mask) const {
-  return (flags & mask) == mask;
-}
-
-inline bool
-Grid::Status::test_any(flags_t mask) const {
-  return (flags & mask) != 0;
-}
-
-inline void
-Grid::Status::set(flags_t mask) {
-  flags |= mask;
-}
-
-inline void
-Grid::Status::reset(flags_t mask) {
-  flags &= ~mask;
-}
-
-inline bool
-Grid::Status::test_zero_dim_univ() const {
-  return flags == ZERO_DIM_UNIV;
-}
-
-inline void
-Grid::Status::reset_zero_dim_univ() {
-  // This is a no-op if the current status is not zero-dim.
-  if (flags == ZERO_DIM_UNIV)
-    // In the zero-dim space, if it is not the universe it is empty.
-    flags = EMPTY;
-}
-
-inline void
-Grid::Status::set_zero_dim_univ() {
-  // Zero-dim universe is incompatible with anything else.
-  flags = ZERO_DIM_UNIV;
-}
-
-inline bool
-Grid::Status::test_empty() const {
-  return test_any(EMPTY);
-}
-
-inline void
-Grid::Status::reset_empty() {
-  reset(EMPTY);
-}
-
-inline void
-Grid::Status::set_empty() {
-  flags = EMPTY;
-}
-
-inline bool
-Grid::Status::test_c_up_to_date() const {
-  return test_any(C_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::reset_c_up_to_date() {
-  reset(C_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::set_c_up_to_date() {
-  set(C_UP_TO_DATE);
-}
-
-inline bool
-Grid::Status::test_g_up_to_date() const {
-  return test_any(G_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::reset_g_up_to_date() {
-  reset(G_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::set_g_up_to_date() {
-  set(G_UP_TO_DATE);
-}
-
-inline bool
-Grid::Status::test_c_minimized() const {
-  return test_any(C_MINIMIZED);
-}
-
-inline void
-Grid::Status::reset_c_minimized() {
-  reset(C_MINIMIZED);
-}
-
-inline void
-Grid::Status::set_c_minimized() {
-  set(C_MINIMIZED);
-}
-
-inline bool
-Grid::Status::test_g_minimized() const {
-  return test_any(G_MINIMIZED);
-}
-
-inline void
-Grid::Status::reset_g_minimized() {
-  reset(G_MINIMIZED);
-}
-
-inline void
-Grid::Status::set_g_minimized() {
-  set(G_MINIMIZED);
-}
-
-
-inline bool
-Grid::Status::test_c_pending() const {
-  return test_any(CS_PENDING);
-}
-
-inline void
-Grid::Status::reset_c_pending() {
-  reset(CS_PENDING);
-}
-
-inline void
-Grid::Status::set_c_pending() {
-  set(CS_PENDING);
-}
-
-inline bool
-Grid::Status::test_g_pending() const {
-  return test_any(GS_PENDING);
-}
-
-inline void
-Grid::Status::reset_g_pending() {
-  reset(GS_PENDING);
-}
-
-inline void
-Grid::Status::set_g_pending() {
-  set(GS_PENDING);
-}
-
-
-inline bool
-Grid::Status::test_sat_c_up_to_date() const {
-  return test_any(SAT_C_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::reset_sat_c_up_to_date() {
-  reset(SAT_C_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::set_sat_c_up_to_date() {
-  set(SAT_C_UP_TO_DATE);
-}
-
-inline bool
-Grid::Status::test_sat_g_up_to_date() const {
-  return test_any(SAT_G_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::reset_sat_g_up_to_date() {
-  reset(SAT_G_UP_TO_DATE);
-}
-
-inline void
-Grid::Status::set_sat_g_up_to_date() {
-  set(SAT_G_UP_TO_DATE);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Status_inlines_hh)
diff --git a/src/Grid_Status_idefs.hh b/src/Grid_Status_idefs.hh
new file mode 100644
index 0000000..cb4ea19
--- /dev/null
+++ b/src/Grid_Status_idefs.hh
@@ -0,0 +1,168 @@
+/* Grid::Status class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Status_idefs_hh
+#define PPL_Grid_Status_idefs_hh 1
+
+#ifndef PPL_IN_Grid_CLASS
+#error "Do not include Grid_Status_idefs.hh directly; use Grid_defs.hh instead"
+#endif
+
+//! A conjunctive assertion about a grid.
+/*!
+  The assertions supported that are in use are:
+  - <EM>zero-dim universe</EM>: the grid is the zero-dimension
+    vector space \f$\Rset^0 = \{\cdot\}\f$;
+  - <EM>empty</EM>: the grid is the empty set;
+  - <EM>congruences up-to-date</EM>: the grid is correctly
+    characterized by the attached system of congruences, modulo the
+    processing of pending generators;
+  - <EM>generators up-to-date</EM>: the grid is correctly
+    characterized by the attached system of generators, modulo the
+    processing of pending congruences;
+  - <EM>congruences minimized</EM>: the non-pending part of the system
+    of congruences attached to the grid is in minimal form;
+  - <EM>generators minimized</EM>: the non-pending part of the system
+    of generators attached to the grid is in minimal form.
+
+  Other supported assertions are:
+  - <EM>congruences pending</EM>
+  - <EM>generators pending</EM>
+  - <EM>congruences' saturation matrix up-to-date</EM>
+  - <EM>generators' saturation matrix up-to-date</EM>.
+
+  Not all the conjunctions of these elementary assertions constitute
+  a legal Status.  In fact:
+  - <EM>zero-dim universe</EM> excludes any other assertion;
+  - <EM>empty</EM>: excludes any other assertion;
+  - <EM>congruences pending</EM> and <EM>generators pending</EM>
+    are mutually exclusive;
+  - <EM>congruences pending</EM> implies both <EM>congruences minimized</EM>
+    and <EM>generators minimized</EM>;
+  - <EM>generators pending</EM> implies both <EM>congruences minimized</EM>
+    and <EM>generators minimized</EM>;
+  - <EM>congruences minimized</EM> implies <EM>congruences up-to-date</EM>;
+  - <EM>generators minimized</EM> implies <EM>generators up-to-date</EM>;
+  - <EM>congruences' saturation matrix up-to-date</EM> implies both
+    <EM>congruences up-to-date</EM> and <EM>generators up-to-date</EM>;
+  - <EM>generators' saturation matrix up-to-date</EM> implies both
+    <EM>congruences up-to-date</EM> and <EM>generators up-to-date</EM>.
+*/
+class Status {
+public:
+  //! By default Status is the <EM>zero-dim universe</EM> assertion.
+  Status();
+
+  //! \name Test, remove or add an individual assertion from the conjunction
+  //@{
+  bool test_zero_dim_univ() const;
+  void reset_zero_dim_univ();
+  void set_zero_dim_univ();
+
+  bool test_empty() const;
+  void reset_empty();
+  void set_empty();
+
+  bool test_c_up_to_date() const;
+  void reset_c_up_to_date();
+  void set_c_up_to_date();
+
+  bool test_g_up_to_date() const;
+  void reset_g_up_to_date();
+  void set_g_up_to_date();
+
+  bool test_c_minimized() const;
+  void reset_c_minimized();
+  void set_c_minimized();
+
+  bool test_g_minimized() const;
+  void reset_g_minimized();
+  void set_g_minimized();
+
+  bool test_sat_c_up_to_date() const;
+  void reset_sat_c_up_to_date();
+  void set_sat_c_up_to_date();
+
+  bool test_sat_g_up_to_date() const;
+  void reset_sat_g_up_to_date();
+  void set_sat_g_up_to_date();
+
+  bool test_c_pending() const;
+  void reset_c_pending();
+  void set_c_pending();
+
+  bool test_g_pending() const;
+  void reset_g_pending();
+  void set_g_pending();
+  //@} // Test, remove or add an individual assertion from the conjunction
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+private:
+  //! Status is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bitmasks for the individual assertions
+  //@{
+  static const flags_t ZERO_DIM_UNIV    = 0U;
+  static const flags_t EMPTY            = 1U << 0;
+  static const flags_t C_UP_TO_DATE     = 1U << 1;
+  static const flags_t G_UP_TO_DATE     = 1U << 2;
+  static const flags_t C_MINIMIZED      = 1U << 3;
+  static const flags_t G_MINIMIZED      = 1U << 4;
+  static const flags_t SAT_C_UP_TO_DATE = 1U << 5;
+  static const flags_t SAT_G_UP_TO_DATE = 1U << 6;
+  static const flags_t CS_PENDING       = 1U << 7;
+  static const flags_t GS_PENDING       = 1U << 8;
+  //@} // Bitmasks for the individual assertions
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! Construct from a bitmask.
+  Status(flags_t mask);
+
+  //! Check whether <EM>all</EM> bits in \p mask are set.
+  bool test_all(flags_t mask) const;
+
+  //! Check whether <EM>at least one</EM> bit in \p mask is set.
+  bool test_any(flags_t mask) const;
+
+  //! Set the bits in \p mask.
+  void set(flags_t mask);
+
+  //! Reset the bits in \p mask.
+  void reset(flags_t mask);
+};
+
+#endif // !defined(PPL_Grid_Status_idefs_hh)
diff --git a/src/Grid_Status_inlines.hh b/src/Grid_Status_inlines.hh
new file mode 100644
index 0000000..0b031ae
--- /dev/null
+++ b/src/Grid_Status_inlines.hh
@@ -0,0 +1,217 @@
+/* Grid::Status class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_Status_inlines_hh
+#define PPL_Grid_Status_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Grid::Status::Status(flags_t mask)
+  : flags(mask) {
+}
+
+inline
+Grid::Status::Status()
+  : flags(ZERO_DIM_UNIV) {
+}
+
+inline bool
+Grid::Status::test_all(flags_t mask) const {
+  return (flags & mask) == mask;
+}
+
+inline bool
+Grid::Status::test_any(flags_t mask) const {
+  return (flags & mask) != 0;
+}
+
+inline void
+Grid::Status::set(flags_t mask) {
+  flags |= mask;
+}
+
+inline void
+Grid::Status::reset(flags_t mask) {
+  flags &= ~mask;
+}
+
+inline bool
+Grid::Status::test_zero_dim_univ() const {
+  return flags == ZERO_DIM_UNIV;
+}
+
+inline void
+Grid::Status::reset_zero_dim_univ() {
+  // This is a no-op if the current status is not zero-dim.
+  if (flags == ZERO_DIM_UNIV)
+    // In the zero-dim space, if it is not the universe it is empty.
+    flags = EMPTY;
+}
+
+inline void
+Grid::Status::set_zero_dim_univ() {
+  // Zero-dim universe is incompatible with anything else.
+  flags = ZERO_DIM_UNIV;
+}
+
+inline bool
+Grid::Status::test_empty() const {
+  return test_any(EMPTY);
+}
+
+inline void
+Grid::Status::reset_empty() {
+  reset(EMPTY);
+}
+
+inline void
+Grid::Status::set_empty() {
+  flags = EMPTY;
+}
+
+inline bool
+Grid::Status::test_c_up_to_date() const {
+  return test_any(C_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::reset_c_up_to_date() {
+  reset(C_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::set_c_up_to_date() {
+  set(C_UP_TO_DATE);
+}
+
+inline bool
+Grid::Status::test_g_up_to_date() const {
+  return test_any(G_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::reset_g_up_to_date() {
+  reset(G_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::set_g_up_to_date() {
+  set(G_UP_TO_DATE);
+}
+
+inline bool
+Grid::Status::test_c_minimized() const {
+  return test_any(C_MINIMIZED);
+}
+
+inline void
+Grid::Status::reset_c_minimized() {
+  reset(C_MINIMIZED);
+}
+
+inline void
+Grid::Status::set_c_minimized() {
+  set(C_MINIMIZED);
+}
+
+inline bool
+Grid::Status::test_g_minimized() const {
+  return test_any(G_MINIMIZED);
+}
+
+inline void
+Grid::Status::reset_g_minimized() {
+  reset(G_MINIMIZED);
+}
+
+inline void
+Grid::Status::set_g_minimized() {
+  set(G_MINIMIZED);
+}
+
+
+inline bool
+Grid::Status::test_c_pending() const {
+  return test_any(CS_PENDING);
+}
+
+inline void
+Grid::Status::reset_c_pending() {
+  reset(CS_PENDING);
+}
+
+inline void
+Grid::Status::set_c_pending() {
+  set(CS_PENDING);
+}
+
+inline bool
+Grid::Status::test_g_pending() const {
+  return test_any(GS_PENDING);
+}
+
+inline void
+Grid::Status::reset_g_pending() {
+  reset(GS_PENDING);
+}
+
+inline void
+Grid::Status::set_g_pending() {
+  set(GS_PENDING);
+}
+
+
+inline bool
+Grid::Status::test_sat_c_up_to_date() const {
+  return test_any(SAT_C_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::reset_sat_c_up_to_date() {
+  reset(SAT_C_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::set_sat_c_up_to_date() {
+  set(SAT_C_UP_TO_DATE);
+}
+
+inline bool
+Grid::Status::test_sat_g_up_to_date() const {
+  return test_any(SAT_G_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::reset_sat_g_up_to_date() {
+  reset(SAT_G_UP_TO_DATE);
+}
+
+inline void
+Grid::Status::set_sat_g_up_to_date() {
+  set(SAT_G_UP_TO_DATE);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Status_inlines_hh)
diff --git a/src/Grid_chdims.cc b/src/Grid_chdims.cc
index 0abdab0..6147549 100644
--- a/src/Grid_chdims.cc
+++ b/src/Grid_chdims.cc
@@ -1,7 +1,7 @@
 /* Grid class implementation
    (non-inline operators that may change the dimension of the vector space).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,8 +23,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid.defs.hh"
-#include "Variables_Set.defs.hh"
+#include "Grid_defs.hh"
+#include "Variables_Set_defs.hh"
 #include "assert.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
@@ -32,8 +32,8 @@ namespace PPL = Parma_Polyhedra_Library;
 // Used for add_space_dimensions_and_embed.
 void
 PPL::Grid::add_space_dimensions(Congruence_System& cgs,
-				Grid_Generator_System& gs,
-				const dimension_type dims) {
+                                Grid_Generator_System& gs,
+                                const dimension_type dims) {
   PPL_ASSERT(cgs.space_dimension() == gs.space_dimension());
   PPL_ASSERT(dims > 0);
 
@@ -49,8 +49,8 @@ PPL::Grid::add_space_dimensions(Congruence_System& cgs,
 // Used for add_space_dimensions_and_project.
 void
 PPL::Grid::add_space_dimensions(Grid_Generator_System& gs,
-				Congruence_System& cgs,
-				const dimension_type dims) {
+                                Congruence_System& cgs,
+                                const dimension_type dims) {
   PPL_ASSERT(cgs.space_dimension() == gs.space_dimension());
   PPL_ASSERT(dims > 0);
 
@@ -119,7 +119,7 @@ PPL::Grid::add_space_dimensions_and_embed(dimension_type m) {
       // Only congruences are up-to-date, so modify only them.
       con_sys.set_space_dimension(con_sys.space_dimension() + m);
       if (congruences_are_minimized())
-	dim_kinds.resize(con_sys.space_dimension() + 1, CON_VIRTUAL);
+        dim_kinds.resize(con_sys.space_dimension() + 1, CON_VIRTUAL);
     }
   else {
     // Only generators are up-to-date, so modify only them.
@@ -188,7 +188,7 @@ PPL::Grid::add_space_dimensions_and_project(dimension_type m) {
       // Only congruences are up-to-date so modify only them.
       con_sys.add_unit_rows_and_space_dimensions(m);
       if (congruences_are_minimized())
-	dim_kinds.resize(con_sys.space_dimension() + 1, EQUALITY);
+        dim_kinds.resize(con_sys.space_dimension() + 1, EQUALITY);
     }
   else {
     // Only generators are up-to-date so modify only them.
@@ -305,7 +305,7 @@ PPL::Grid::remove_higher_space_dimensions(const dimension_type new_dimension) {
   // Dimension-compatibility check.
   if (new_dimension > space_dim)
     throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
-				 new_dimension);
+                                 new_dimension);
 
   // The removal of no dimensions from any grid is a no-op.
   // Note that this case also captures the only legal removal of
@@ -339,13 +339,13 @@ PPL::Grid::remove_higher_space_dimensions(const dimension_type new_dimension) {
       dimension_type num_redundant = 0;
       const dimension_type num_old_gs = space_dim - new_dimension;
       for (dimension_type row = 0; row < num_old_gs; ++row) {
-	if (dim_kinds[row] != GEN_VIRTUAL)
+        if (dim_kinds[row] != GEN_VIRTUAL)
           ++num_redundant;
       }
       if (num_redundant > 0) {
-	// Chop zero rows from end of system, to keep minimal form.
-	gen_sys.remove_trailing_rows(num_redundant);
-	gen_sys.unset_pending_rows();
+        // Chop zero rows from end of system, to keep minimal form.
+        gen_sys.remove_trailing_rows(num_redundant);
+        gen_sys.unset_pending_rows();
       }
       dim_kinds.resize(new_dimension + 1);
       // TODO: Consider if it is worth also preserving the congruences
@@ -404,7 +404,7 @@ PPL::Grid::expand_space_dimension(Variable var, dimension_type m) {
                                  "the maximum allowed space dimension");
 
   // Save the number of dimensions before adding new ones.
-  dimension_type old_dim = space_dim;
+  const dimension_type old_dim = space_dim;
 
   // Add the required new dimensions.
   add_space_dimensions_and_embed(m);
@@ -412,7 +412,7 @@ PPL::Grid::expand_space_dimension(Variable var, dimension_type m) {
   const Congruence_System& cgs = congruences();
   Congruence_System new_congruences;
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i) {
+         cgs_end = cgs.end(); i != cgs_end; ++i) {
     const Congruence& cg = *i;
 
     Coefficient_traits::const_reference coeff = cg.coefficient(var);
@@ -450,13 +450,13 @@ PPL::Grid::fold_space_dimensions(const Variables_Set& vars, Variable dest) {
   // All variables in `vars' must be dimensions of the grid.
   if (vars.space_dimension() > space_dim)
     throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-				 "vs.space_dimension()",
-				 vars.space_dimension());
+                                 "vs.space_dimension()",
+                                 vars.space_dimension());
 
   // Moreover, `dest.id()' must not occur in `vars'.
   if (vars.find(dest.id()) != vars.end())
     throw_invalid_argument("fold_space_dimensions(vs, v)",
-			   "v should not occur in vs");
+                           "v should not occur in vs");
   // All of the affine images we are going to compute are not invertible,
   // hence we will need to compute the grid generators of the polyhedron.
   // Since we keep taking copies, make sure that a single conversion
diff --git a/src/Grid_conversion.cc b/src/Grid_conversion.cc
index 4723bac..90e2449 100644
--- a/src/Grid_conversion.cc
+++ b/src/Grid_conversion.cc
@@ -1,6 +1,6 @@
 /* Grid class implementation: conversion().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid.defs.hh"
+#include "Grid_defs.hh"
 #include <cstddef>
 
 namespace Parma_Polyhedra_Library {
@@ -35,7 +35,7 @@ namespace Parma_Polyhedra_Library {
 // Where X is greater than zero and x is an integer.
 bool
 Grid::lower_triangular(const Congruence_System& sys,
-		       const Dimension_Kinds& dim_kinds) {
+                       const Dimension_Kinds& dim_kinds) {
   const dimension_type num_columns = sys.space_dimension() + 1;
 
   // Check for easy square failure case.
@@ -69,7 +69,7 @@ Grid::lower_triangular(const Congruence_System& sys,
 // Where X is greater than zero and x is an integer.
 bool
 Grid::upper_triangular(const Grid_Generator_System& sys,
-		       const Dimension_Kinds& dim_kinds) {
+                       const Dimension_Kinds& dim_kinds) {
   dimension_type num_columns = sys.space_dimension() + 1;
   dimension_type row = sys.num_rows();
 
@@ -97,7 +97,7 @@ Grid::upper_triangular(const Grid_Generator_System& sys,
 
 void
 Grid::multiply_grid(const Coefficient& multiplier, Grid_Generator& gen,
-		    Swapping_Vector<Grid_Generator>& dest_rows,
+                    Swapping_Vector<Grid_Generator>& dest_rows,
                     const dimension_type num_rows) {
   if (multiplier == 1)
     return;
@@ -105,7 +105,8 @@ Grid::multiply_grid(const Coefficient& multiplier, Grid_Generator& gen,
   if (gen.is_line()) {
     // Multiply every element of the line.
     gen.expr *= multiplier;
-  } else {
+  }
+  else {
     PPL_ASSERT(gen.is_parameter_or_point());
     // Multiply every element of every parameter.
 
@@ -119,7 +120,7 @@ Grid::multiply_grid(const Coefficient& multiplier, Grid_Generator& gen,
 
 void
 Grid::multiply_grid(const Coefficient& multiplier, Congruence& cg,
-		    Swapping_Vector<Congruence>& dest,
+                    Swapping_Vector<Congruence>& dest,
                     const dimension_type num_rows) {
   if (multiplier == 1)
     return;
@@ -131,7 +132,8 @@ Grid::multiply_grid(const Coefficient& multiplier, Congruence& cg,
       if (congruence.is_proper_congruence())
         congruence.scale(multiplier);
     }
-  } else {
+  }
+  else {
     PPL_ASSERT(cg.is_equality());
     // Multiply every element of the equality.
     cg.scale(multiplier);
@@ -144,7 +146,7 @@ Grid::multiply_grid(const Coefficient& multiplier, Congruence& cg,
 
 void
 Grid::conversion(Grid_Generator_System& source, Congruence_System& dest,
-		 Dimension_Kinds& dim_kinds) {
+                 Dimension_Kinds& dim_kinds) {
   // Quite similar to the congruence to generator version below.
   // Changes here may be needed there too.
 
@@ -168,12 +170,12 @@ Grid::conversion(Grid_Generator_System& source, Congruence_System& dest,
     else {
       --source_index;
       if (dim_kinds[dim] == PARAMETER) {
-	// Dimension `dim' has a parameter row at `source_index' in
-	// `source', so include in `diagonal_lcm' the `dim'th element
-	// of that row.
-	lcm_assign(diagonal_lcm, diagonal_lcm, source[source_index].expr.get(dim));
-	// Parameters map to proper congruences.
-	++dest_num_rows;
+        // Dimension `dim' has a parameter row at `source_index' in
+        // `source', so include in `diagonal_lcm' the `dim'th element
+        // of that row.
+        lcm_assign(diagonal_lcm, diagonal_lcm, source[source_index].expr.get(dim));
+        // Parameters map to proper congruences.
+        ++dest_num_rows;
       }
       // Lines map to virtual congruences.
     }
@@ -200,11 +202,12 @@ Grid::conversion(Grid_Generator_System& source, Congruence_System& dest,
         le.set(dim, Coefficient_one());
         Congruence cg(le, Coefficient_zero(), Recycle_Input());
         dest.insert_verbatim(cg, Recycle_Input());
-      } else {
-	PPL_ASSERT(dim_kinds[dim] == PARAMETER);
-	--source_index;
+      }
+      else {
+        PPL_ASSERT(dim_kinds[dim] == PARAMETER);
+        --source_index;
         PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-	exact_div_assign(tmp, diagonal_lcm,
+        exact_div_assign(tmp, diagonal_lcm,
                          source[source_index].expr.get(dim));
         le.set(dim, tmp);
         Congruence cg(le, Coefficient_one(), Recycle_Input());
@@ -235,14 +238,14 @@ Grid::conversion(Grid_Generator_System& source, Congruence_System& dest,
       // In the rows in `dest' above `dest_index' divide each element
       // at column `dim' by `source_dim'.
       for (dimension_type row = dest_index; row-- > 0; ) {
-	Congruence& cg = dest.rows[row];
+        Congruence& cg = dest.rows[row];
 
-	// Multiply the representation of `dest' such that entry `dim'
+        // Multiply the representation of `dest' such that entry `dim'
         // of `g' is a multiple of `source_dim'.  This ensures that
         // the result of the division that follows is a whole number.
-	gcd_assign(multiplier, cg.expression().get(dim), source_dim);
-	exact_div_assign(multiplier, source_dim, multiplier);
-	multiply_grid(multiplier, cg, dest.rows, dest_num_rows);
+        gcd_assign(multiplier, cg.expression().get(dim), source_dim);
+        exact_div_assign(multiplier, source_dim, multiplier);
+        multiply_grid(multiplier, cg, dest.rows, dest_num_rows);
 
         cg.expr.exact_div_assign(source_dim, dim, dim + 1);
       }
@@ -259,25 +262,25 @@ Grid::conversion(Grid_Generator_System& source, Congruence_System& dest,
       ++dest_index;
     for (dimension_type dim_prec = dim; dim_prec-- > 0; ) {
       if (dim_kinds[dim_prec] != GEN_VIRTUAL) {
-	--tmp_source_index;
-	const Coefficient& source_dim = source[tmp_source_index].expr.get(dim);
+        --tmp_source_index;
+        const Coefficient& source_dim = source[tmp_source_index].expr.get(dim);
         
-	// In order to compute the transpose of the inverse of
-	// `source', subtract source[tmp_source_index][dim] times the
-	// column vector in `dest' at `dim' from the column vector in
-	// `dest' at `dim_prec'.
-	//
-	// I.e., for each row `dest_index' in `dest' that is above the
-	// row `dest_index', subtract dest[tmp_source_index][dim]
-	// times the entry `dim' from the entry at `dim_prec'.
+        // In order to compute the transpose of the inverse of
+        // `source', subtract source[tmp_source_index][dim] times the
+        // column vector in `dest' at `dim' from the column vector in
+        // `dest' at `dim_prec'.
+        //
+        // I.e., for each row `dest_index' in `dest' that is above the
+        // row `dest_index', subtract dest[tmp_source_index][dim]
+        // times the entry `dim' from the entry at `dim_prec'.
         PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-	for (dimension_type row = dest_index; row-- > 0; ) {
-	  PPL_ASSERT(row < dest_num_rows);
-	  Congruence& cg = dest.rows[row];
+        for (dimension_type row = dest_index; row-- > 0; ) {
+          PPL_ASSERT(row < dest_num_rows);
+          Congruence& cg = dest.rows[row];
           tmp = cg.expr.get(dim_prec);
-	  sub_mul_assign(tmp, source_dim, cg.expression().get(dim));
+          sub_mul_assign(tmp, source_dim, cg.expression().get(dim));
           cg.expr.set(dim_prec, tmp);
-	}
+        }
       }
     }
   }
@@ -312,7 +315,7 @@ Grid::conversion(Grid_Generator_System& source, Congruence_System& dest,
 
 void
 Grid::conversion(Congruence_System& source, Grid_Generator_System& dest,
-		 Dimension_Kinds& dim_kinds) {
+                 Dimension_Kinds& dim_kinds) {
   // Quite similar to the generator to congruence version above.
   // Changes here may be needed there too.
 
@@ -320,22 +323,23 @@ Grid::conversion(Congruence_System& source, Grid_Generator_System& dest,
 
   // Initialize matrix row number counters and compute the LCM of the
   // diagonal entries of the proper congruences in `source'.
-  dimension_type source_num_rows = 0, dest_num_rows = 0;
+  dimension_type source_num_rows = 0;
+  dimension_type dest_num_rows = 0;
   PPL_DIRTY_TEMP_COEFFICIENT(diagonal_lcm);
   diagonal_lcm = 1;
-  dimension_type dims = source.space_dimension() + 1;
+  const dimension_type dims = source.space_dimension() + 1;
   for (dimension_type dim = dims; dim-- > 0; )
     if (dim_kinds[dim] == CON_VIRTUAL)
       // Virtual congruences map to lines.
       ++dest_num_rows;
     else {
       if (dim_kinds[dim] == PROPER_CONGRUENCE) {
-	// Dimension `dim' has a proper congruence row at
-	// `source_num_rows' in `source', so include in `diagonal_lcm'
-	// the `dim'th element of that row.
-	lcm_assign(diagonal_lcm, diagonal_lcm, source[source_num_rows].expr.get(dim));
-	// Proper congruences map to parameters.
-	++dest_num_rows;
+        // Dimension `dim' has a proper congruence row at
+        // `source_num_rows' in `source', so include in `diagonal_lcm'
+        // the `dim'th element of that row.
+        lcm_assign(diagonal_lcm, diagonal_lcm, source[source_num_rows].expr.get(dim));
+        // Proper congruences map to parameters.
+        ++dest_num_rows;
       }
       // Equalities map to virtual generators.
       ++source_num_rows;
@@ -366,16 +370,16 @@ Grid::conversion(Congruence_System& source, Grid_Generator_System& dest,
       g.expr.set_space_dimension(dims);
 
       if (dim_kinds[dim] == CON_VIRTUAL) {
-	g.set_is_line();
+        g.set_is_line();
         g.expr.set(0, Coefficient_zero());
         g.expr.set(dim, Coefficient_one());
       }
       else {
-	PPL_ASSERT(dim_kinds[dim] == PROPER_CONGRUENCE);
-	g.set_is_parameter_or_point();
+        PPL_ASSERT(dim_kinds[dim] == PROPER_CONGRUENCE);
+        g.set_is_parameter_or_point();
         --source_index;
         PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-	exact_div_assign(tmp, diagonal_lcm,
+        exact_div_assign(tmp, diagonal_lcm,
                          source[source_index].expr.get(dim));
         g.expr.set(0, Coefficient_zero());
         g.expr.set(dim, tmp);
@@ -413,12 +417,12 @@ Grid::conversion(Congruence_System& source, Grid_Generator_System& dest,
       for (dimension_type i = dest_index; i-- > 0; ) {
         Grid_Generator& g = dest.sys.rows[i];
 
-	// Multiply the representation of `dest' such that entry `dim'
+        // Multiply the representation of `dest' such that entry `dim'
         // of `g' is a multiple of `source_dim'.  This ensures that
         // the result of the division that follows is a whole number.
-	gcd_assign(reduced_source_dim, g.expr.get(dim), source_dim);
-	exact_div_assign(reduced_source_dim, source_dim, reduced_source_dim);
-	multiply_grid(reduced_source_dim, g, dest.sys.rows, dest_num_rows);
+        gcd_assign(reduced_source_dim, g.expr.get(dim), source_dim);
+        exact_div_assign(reduced_source_dim, source_dim, reduced_source_dim);
+        multiply_grid(reduced_source_dim, g, dest.sys.rows, dest_num_rows);
 
         g.expr.exact_div_assign(source_dim, dim, dim + 1);
         // Don't assert g.OK() here, because it may fail.
@@ -437,29 +441,29 @@ Grid::conversion(Congruence_System& source, Grid_Generator_System& dest,
       ++dest_index;
     for (dimension_type dim_fol = dim + 1; dim_fol < dims; ++dim_fol) {
       if (dim_kinds[dim_fol] != CON_VIRTUAL) {
-	--tmp_source_index;
-	Coefficient_traits::const_reference source_dim
+        --tmp_source_index;
+        Coefficient_traits::const_reference source_dim
           = source[tmp_source_index].expr.get(dim);
-	// In order to compute the transpose of the inverse of
-	// `source', subtract source[tmp_source_index][dim] times the
-	// column vector in `dest' at `dim' from the column vector in
-	// `dest' at `dim_fol'.
-	//
-	// I.e., for each row `dest_index' in `dest' that is above the
-	// row `dest_index', subtract dest[tmp_source_index][dim]
-	// times the entry `dim' from the entry at `dim_fol'.
+        // In order to compute the transpose of the inverse of
+        // `source', subtract source[tmp_source_index][dim] times the
+        // column vector in `dest' at `dim' from the column vector in
+        // `dest' at `dim_fol'.
+        //
+        // I.e., for each row `dest_index' in `dest' that is above the
+        // row `dest_index', subtract dest[tmp_source_index][dim]
+        // times the entry `dim' from the entry at `dim_fol'.
 
         PPL_DIRTY_TEMP_COEFFICIENT(tmp);
         for (dimension_type i = dest_index; i-- > 0; ) {
-	  PPL_ASSERT(i < dest_num_rows);
+          PPL_ASSERT(i < dest_num_rows);
           Grid_Generator& row = dest.sys.rows[i];
           tmp = row.expr.get(dim_fol);
-	  sub_mul_assign(tmp, source_dim,
+          sub_mul_assign(tmp, source_dim,
                          row.expr.get(dim));
           row.expr.set(dim_fol, tmp);
           // Don't assert row.OK() here, because it may fail.
           // All the rows in `dest' are checked at the end of this function.
-	}
+        }
       }
     }
   }
@@ -473,7 +477,7 @@ Grid::conversion(Congruence_System& source, Grid_Generator_System& dest,
     if (dim_kinds[dim] != GEN_VIRTUAL)
       // Factor the "diagonal" generator out of the preceding rows.
       reduce_reduced<Grid_Generator_System>
-	(dest.sys.rows, dim, i++, dim, dims - 1, dim_kinds);
+        (dest.sys.rows, dim, i++, dim, dims - 1, dim_kinds);
   }
 
   // Ensure that the parameter divisors are the same as the divisor of
diff --git a/src/Grid_defs.hh b/src/Grid_defs.hh
new file mode 100644
index 0000000..9aaf374
--- /dev/null
+++ b/src/Grid_defs.hh
@@ -0,0 +1,2665 @@
+/* Grid class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_defs_hh
+#define PPL_Grid_defs_hh 1
+
+#include "Grid_types.hh"
+#include "globals_defs.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_types.hh"
+#include "Linear_Expression_defs.hh"
+#include "Constraint_types.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
+#include "Grid_Generator_System_defs.hh"
+#include "Grid_Generator_System_inlines.hh"
+#include "Grid_Generator_types.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "Grid_Certificate_types.hh"
+#include "Box_types.hh"
+#include "Polyhedron_types.hh"
+#include "BD_Shape_types.hh"
+#include "Octagonal_Shape_types.hh"
+#include <vector>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Grid
+  Writes a textual representation of \p gr on \p s: <CODE>false</CODE>
+  is written if \p gr is an empty grid; <CODE>true</CODE> is written
+  if \p gr is a universe grid; a minimized system of congruences
+  defining \p gr is written otherwise, all congruences in one row
+  separated by ", "s.
+*/
+std::ostream&
+operator<<(std::ostream& s, const Grid& gr);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Grid */
+void swap(Grid& x, Grid& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x and \p y are the same
+  grid.
+
+  \relates Grid
+  Note that \p x and \p y may be dimension-incompatible grids: in
+  those cases, the value <CODE>false</CODE> is returned.
+*/
+bool operator==(const Grid& x, const Grid& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x and \p y are different
+  grids.
+
+  \relates Grid
+  Note that \p x and \p y may be dimension-incompatible grids: in
+  those cases, the value <CODE>true</CODE> is returned.
+*/
+bool operator!=(const Grid& x, const Grid& y);
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! A grid.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Grid represents a rational grid.
+
+  The domain of grids <EM>optimally supports</EM>:
+    - all (proper and non-proper) congruences;
+    - tautological and inconsistent constraints;
+    - linear equality constraints (i.e., non-proper congruences).
+
+  Depending on the method, using a constraint that is not optimally
+  supported by the domain will either raise an exception or
+  result in a (possibly non-optimal) upward approximation.
+
+  The domain of grids support a concept of double description similar
+  to the one developed for polyhedra: hence, a grid can be specified
+  as either a finite system of congruences or a finite system of
+  generators (see Section \ref sect_rational_grids) and it is always
+  possible to obtain either representation.
+  That is, if we know the system of congruences, we can obtain
+  from this a system of generators that define the same grid
+  and vice versa.
+  These systems can contain redundant members, or they can be in the
+  minimal form.
+
+  A key attribute of any grid is its space dimension (the dimension
+  \f$n \in \Nset\f$ of the enclosing vector space):
+
+  - all grids, the empty ones included, are endowed with a space
+    dimension;
+  - most operations working on a grid and another object (another
+    grid, a congruence, a generator, a set of variables, etc.) will
+    throw an exception if the grid and the object are not
+    dimension-compatible (see Section \ref Grid_Space_Dimensions);
+  - the only ways in which the space dimension of a grid can be
+    changed are with <EM>explicit</EM> calls to operators provided for
+    that purpose, and with standard copy, assignment and swap
+    operators.
+
+  Note that two different grids can be defined on the zero-dimension
+  space: the empty grid and the universe grid \f$R^0\f$.
+
+  \par
+  In all the examples it is assumed that variables
+  <CODE>x</CODE> and <CODE>y</CODE> are defined (where they are
+  used) as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  \endcode
+
+  \par Example 1
+  The following code builds a grid corresponding to the even integer
+  pairs in \f$\Rset^2\f$, given as a system of congruences:
+  \code
+  Congruence_System cgs;
+  cgs.insert((x %= 0) / 2);
+  cgs.insert((y %= 0) / 2);
+  Grid gr(cgs);
+  \endcode
+  The following code builds the same grid as above, but starting
+  from a system of generators specifying three of the points:
+  \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(0*x + 0*y));
+  gs.insert(grid_point(0*x + 2*y));
+  gs.insert(grid_point(2*x + 0*y));
+  Grid gr(gs);
+  \endcode
+
+  \par Example 2
+  The following code builds a grid corresponding to a line in
+  \f$\Rset^2\f$ by adding a single congruence to the universe grid:
+  \code
+  Congruence_System cgs;
+  cgs.insert(x - y == 0);
+  Grid gr(cgs);
+  \endcode
+  The following code builds the same grid as above, but starting
+  from a system of generators specifying a point and a line:
+  \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(0*x + 0*y));
+  gs.insert(grid_line(x + y));
+  Grid gr(gs);
+  \endcode
+
+  \par Example 3
+  The following code builds a grid corresponding to the integral
+  points on the line \f$x = y\f$ in \f$\Rset^2\f$ constructed
+  by adding an equality and congruence to the universe grid:
+  \code
+  Congruence_System cgs;
+  cgs.insert(x - y == 0);
+  cgs.insert(x %= 0);
+  Grid gr(cgs);
+  \endcode
+  The following code builds the same grid as above, but starting
+  from a system of generators specifying a point and a parameter:
+  \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(0*x + 0*y));
+  gs.insert(parameter(x + y));
+  Grid gr(gs);
+  \endcode
+
+  \par Example 4
+  The following code builds the grid corresponding to a plane by
+  creating the universe grid in \f$\Rset^2\f$:
+  \code
+  Grid gr(2);
+  \endcode
+  The following code builds the same grid as above, but starting
+  from the empty grid in \f$\Rset^2\f$ and inserting the appropriate
+  generators (a point, and two lines).
+  \code
+  Grid gr(2, EMPTY);
+  gr.add_grid_generator(grid_point(0*x + 0*y));
+  gr.add_grid_generator(grid_line(x));
+  gr.add_grid_generator(grid_line(y));
+  \endcode
+  Note that a generator system must contain a point when describing
+  a grid.  To ensure that this is always the case it is required
+  that the first generator inserted in an empty grid is a point
+  (otherwise, an exception is thrown).
+
+  \par Example 5
+  The following code shows the use of the function
+  <CODE>add_space_dimensions_and_embed</CODE>:
+  \code
+  Grid gr(1);
+  gr.add_congruence(x == 2);
+  gr.add_space_dimensions_and_embed(1);
+  \endcode
+  We build the universe grid in the 1-dimension space \f$\Rset\f$.
+  Then we add a single equality congruence,
+  thus obtaining the grid corresponding to the singleton set
+  \f$\{ 2 \} \sseq \Rset\f$.
+  After the last line of code, the resulting grid is
+  \f[
+  \bigl\{\,
+  (2, y)^\transpose \in \Rset^2
+  \bigm|
+  y \in \Rset
+  \,\bigr\}.
+  \f]
+
+  \par Example 6
+  The following code shows the use of the function
+  <CODE>add_space_dimensions_and_project</CODE>:
+  \code
+  Grid gr(1);
+  gr.add_congruence(x == 2);
+  gr.add_space_dimensions_and_project(1);
+  \endcode
+  The first two lines of code are the same as in Example 4 for
+  <CODE>add_space_dimensions_and_embed</CODE>.
+  After the last line of code, the resulting grid is
+  the singleton set
+  \f$\bigl\{ (2, 0)^\transpose \bigr\} \sseq \Rset^2\f$.
+
+  \par Example 7
+  The following code shows the use of the function
+  <CODE>affine_image</CODE>:
+  \code
+  Grid gr(2, EMPTY);
+  gr.add_grid_generator(grid_point(0*x + 0*y));
+  gr.add_grid_generator(grid_point(4*x + 0*y));
+  gr.add_grid_generator(grid_point(0*x + 2*y));
+  Linear_Expression expr = x + 3;
+  gr.affine_image(x, expr);
+  \endcode
+  In this example the starting grid is all the pairs of \f$x\f$ and
+  \f$y\f$ in \f$\Rset^2\f$ where \f$x\f$ is an integer multiple of 4
+  and \f$y\f$ is an integer multiple of 2.  The considered variable
+  is \f$x\f$ and the affine expression is \f$x+3\f$.  The resulting
+  grid is the given grid translated 3 integers to the right (all the
+  pairs \f$(x, y)\f$ where \f$x\f$ is -1 plus an integer multiple of 4
+  and \f$y\f$ is an integer multiple of 2).
+  Moreover, if the affine transformation for the same variable \p x
+  is instead \f$x+y\f$:
+  \code
+  Linear_Expression expr = x + y;
+  \endcode
+  the resulting grid is every second integral point along the \f$x=y\f$
+  line, with this line of points repeated at every fourth integral value
+  along the \f$x\f$ axis.
+  Instead, if we do not use an invertible transformation for the
+  same variable; for example, the affine expression \f$y\f$:
+  \code
+  Linear_Expression expr = y;
+  \endcode
+  the resulting grid is every second point along the \f$x=y\f$ line.
+
+  \par Example 8
+  The following code shows the use of the function
+  <CODE>affine_preimage</CODE>:
+  \code
+  Grid gr(2, EMPTY);
+  gr.add_grid_generator(grid_point(0*x + 0*y));
+  gr.add_grid_generator(grid_point(4*x + 0*y));
+  gr.add_grid_generator(grid_point(0*x + 2*y));
+  Linear_Expression expr = x + 3;
+  gr.affine_preimage(x, expr);
+  \endcode
+  In this example the starting grid, \p var and the affine
+  expression and the denominator are the same as in Example 6, while
+  the resulting grid is similar but translated 3 integers to the
+  left (all the pairs \f$(x, y)\f$
+  where \f$x\f$ is -3 plus an integer multiple of 4 and
+  \f$y\f$ is an integer multiple of 2)..
+  Moreover, if the affine transformation for \p x is \f$x+y\f$
+  \code
+  Linear_Expression expr = x + y;
+  \endcode
+  the resulting grid is a similar grid to the result in Example 6,
+  only the grid is slanted along \f$x=-y\f$.
+  Instead, if we do not use an invertible transformation for the same
+  variable \p x, for example, the affine expression \f$y\f$:
+  \code
+  Linear_Expression expr = y;
+  \endcode
+  the resulting grid is every fourth line parallel to the \f$x\f$
+  axis.
+
+  \par Example 9
+  For this example we also use the variables:
+  \code
+  Variable z(2);
+  Variable w(3);
+  \endcode
+  The following code shows the use of the function
+  <CODE>remove_space_dimensions</CODE>:
+  \code
+  Grid_Generator_System gs;
+  gs.insert(grid_point(3*x + y +0*z + 2*w));
+  Grid gr(gs);
+  Variables_Set vars;
+  vars.insert(y);
+  vars.insert(z);
+  gr.remove_space_dimensions(vars);
+  \endcode
+  The starting grid is the singleton set
+  \f$\bigl\{ (3, 1, 0, 2)^\transpose \bigr\} \sseq \Rset^4\f$, while
+  the resulting grid is
+  \f$\bigl\{ (3, 2)^\transpose \bigr\} \sseq \Rset^2\f$.
+  Be careful when removing space dimensions <EM>incrementally</EM>:
+  since dimensions are automatically renamed after each application
+  of the <CODE>remove_space_dimensions</CODE> operator, unexpected
+  results can be obtained.
+  For instance, by using the following code we would obtain
+  a different result:
+  \code
+  set<Variable> vars1;
+  vars1.insert(y);
+  gr.remove_space_dimensions(vars1);
+  set<Variable> vars2;
+  vars2.insert(z);
+  gr.remove_space_dimensions(vars2);
+  \endcode
+  In this case, the result is the grid
+  \f$\bigl\{(3, 0)^\transpose \bigr\} \sseq \Rset^2\f$:
+  when removing the set of dimensions \p vars2
+  we are actually removing variable \f$w\f$ of the original grid.
+  For the same reason, the operator \p remove_space_dimensions
+  is not idempotent: removing twice the same non-empty set of dimensions
+  is never the same as removing them just once.
+*/
+
+class Parma_Polyhedra_Library::Grid {
+public:
+  //! The numeric type of coefficients.
+  typedef Coefficient coefficient_type;
+
+  //! Returns the maximum space dimension all kinds of Grid can handle.
+  static dimension_type max_space_dimension();
+
+  /*! \brief
+    Returns true indicating that this domain has methods that
+    can recycle congruences.
+  */
+  static bool can_recycle_congruence_systems();
+
+  /*! \brief
+    Returns true indicating that this domain has methods that
+    can recycle constraints.
+  */
+  static bool can_recycle_constraint_systems();
+
+  //! Builds a grid having the specified properties.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the grid;
+
+    \param kind
+    Specifies whether the universe or the empty grid has to be built.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Grid(dimension_type num_dimensions = 0,
+                Degenerate_Element kind = UNIVERSE);
+
+  //! Builds a grid, copying a system of congruences.
+  /*!
+    The grid inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences defining the grid.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Grid(const Congruence_System& cgs);
+
+  //! Builds a grid, recycling a system of congruences.
+  /*!
+    The grid inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences defining the grid.  Its data-structures
+    may be recycled to build the grid.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  Grid(Congruence_System& cgs, Recycle_Input dummy);
+
+  //! Builds a grid, copying a system of constraints.
+  /*!
+    The grid inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints defining the grid.
+
+    \exception std::invalid_argument
+    Thrown if the constraint system \p cs contains inequality constraints.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Grid(const Constraint_System& cs);
+
+  //! Builds a grid, recycling a system of constraints.
+  /*!
+    The grid inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints defining the grid.  Its data-structures
+    may be recycled to build the grid.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the constraint system \p cs contains inequality constraints.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  Grid(Constraint_System& cs, Recycle_Input dummy);
+
+  //! Builds a grid, copying a system of grid generators.
+  /*!
+    The grid inherits the space dimension of the generator system.
+
+    \param ggs
+    The system of generators defining the grid.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Grid(const Grid_Generator_System& ggs);
+
+  //! Builds a grid, recycling a system of grid generators.
+  /*!
+    The grid inherits the space dimension of the generator system.
+
+    \param ggs
+    The system of generators defining the grid.  Its data-structures
+    may be recycled to build the grid.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space dimension.
+  */
+  Grid(Grid_Generator_System& ggs, Recycle_Input dummy);
+
+  //! Builds a grid out of a box.
+  /*!
+    The grid inherits the space dimension of the box.
+    The built grid is the most precise grid that includes the box.
+
+    \param box
+    The box representing the grid to be built.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename Interval>
+  explicit Grid(const Box<Interval>& box,
+                Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a grid out of a bounded-difference shape.
+  /*!
+    The grid inherits the space dimension of the BDS.
+    The built grid is the most precise grid that includes the BDS.
+
+    \param bd
+    The BDS representing the grid to be built.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p bd exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename U>
+  explicit Grid(const BD_Shape<U>& bd,
+                Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a grid out of an octagonal shape.
+  /*!
+    The grid inherits the space dimension of the octagonal shape.
+    The built grid is the most precise grid that includes the octagonal shape.
+
+    \param os
+    The octagonal shape representing the grid to be built.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p os exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename U>
+  explicit Grid(const Octagonal_Shape<U>& os,
+                Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    Builds a grid from a polyhedron using algorithms whose complexity
+    does not exceed the one specified by \p complexity.
+    If \p complexity is \p ANY_COMPLEXITY, then the grid built is the
+    smallest one containing \p ph.
+
+    The grid inherits the space dimension of polyhedron.
+
+    \param ph
+    The polyhedron.
+
+    \param complexity
+    The complexity class.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Grid(const Polyhedron& ph,
+                Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  Grid(const Grid& y,
+       Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator.  (\p *this and \p y can be
+    dimension-incompatible.)
+  */
+  Grid& operator=(const Grid& y);
+
+  //! \name Member Functions that Do Not Modify the Grid
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns \f$0\f$, if \p *this is empty; otherwise, returns
+    the \ref Grid_Affine_Dimension "affine dimension" of \p *this.
+  */
+  dimension_type affine_dimension() const;
+
+  /*! \brief
+    Returns a system of equality constraints satisfied by \p *this
+    with the same affine dimension as \p *this.
+  */
+  Constraint_System constraints() const;
+
+  /*! \brief
+    Returns a minimal system of equality constraints satisfied by
+    \p *this with the same affine dimension as \p *this.
+  */
+  Constraint_System minimized_constraints() const;
+
+  //! Returns the system of congruences.
+  const Congruence_System& congruences() const;
+
+  //! Returns the system of congruences in minimal form.
+  const Congruence_System& minimized_congruences() const;
+
+  //! Returns the system of generators.
+  const Grid_Generator_System& grid_generators() const;
+
+  //! Returns the minimized system of generators.
+  const Grid_Generator_System& minimized_grid_generators() const;
+
+  //! Returns the relations holding between \p *this and \p cg.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  // FIXME: Poly_Con_Relation seems to encode exactly what we want
+  // here.  We must find a new name for that class.  Temporarily,
+  // we keep using it without changing the name.
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  //! Returns the relations holding between \p *this and \p g.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  // FIXME: see the comment for Poly_Con_Relation above.
+  Poly_Gen_Relation
+  relation_with(const Grid_Generator& g) const;
+
+  //! Returns the relations holding between \p *this and \p g.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  // FIXME: see the comment for Poly_Con_Relation above.
+  Poly_Gen_Relation
+  relation_with(const Generator& g) const;
+
+  //! Returns the relations holding between \p *this and \p c.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  // FIXME: Poly_Con_Relation seems to encode exactly what we want
+  // here.  We must find a new name for that class.  Temporarily,
+  // we keep using it without changing the name.
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  //! Returns \c true if and only if \p *this is an empty grid.
+  bool is_empty() const;
+
+  //! Returns \c true if and only if \p *this is a universe grid.
+  bool is_universe() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is a
+    topologically closed subset of the vector space.
+
+    A grid is always topologically closed.
+  */
+  bool is_topologically_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y are
+    disjoint.
+
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are dimension-incompatible.
+  */
+  bool is_disjoint_from(const Grid& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
+  /*!
+    A grid is discrete if it can be defined by a generator system which
+    contains only points and parameters.  This includes the empty grid
+    and any grid in dimension zero.
+  */
+  bool is_discrete() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is bounded.
+  bool is_bounded() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains at least one integer point.
+  */
+  bool contains_integer_point() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  bool constrains(Variable var) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
+  /*!
+    This method is the same as bounds_from_below.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
+  /*!
+    This method is the same as bounds_from_above.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from above in \p *this, in which case the
+    supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if the supremum value can be reached in \p this.
+    Always <CODE>true</CODE> when \p this bounds \p expr.  Present for
+    interface compatibility with class Polyhedron, where closure
+    points can result in a value of false.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded by \p *this,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d and \p
+    maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from above in \p *this, in which case the
+    supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if the supremum value can be reached in \p this.
+    Always <CODE>true</CODE> when \p this bounds \p expr.  Present for
+    interface compatibility with class Polyhedron, where closure
+    points can result in a value of false;
+
+    \param point
+    When maximization succeeds, will be assigned a point where \p expr
+    reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded by \p *this,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p point are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& point) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from below in \p *this, in which case the
+    infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if the is the infimum value can be reached in \p
+    this.  Always <CODE>true</CODE> when \p this bounds \p expr.
+    Present for interface compatibility with class Polyhedron, where
+    closure points can result in a value of false.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from below in \p *this, in which case the
+    infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if the is the infimum value can be reached in \p
+    this.  Always <CODE>true</CODE> when \p this bounds \p expr.
+    Present for interface compatibility with class Polyhedron, where
+    closure points can result in a value of false;
+
+    \param point
+    When minimization succeeds, will be assigned a point where \p expr
+    reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p point are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& point) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \ref Grid_Frequency "frequency" for \p *this with respect to \p expr
+    is defined, in which case the frequency and the value for \p expr
+    that is closest to zero are computed.
+
+    \param expr
+    The linear expression for which the frequency is needed;
+
+    \param freq_n
+    The numerator of the maximum frequency of \p expr;
+
+    \param freq_d
+    The denominator of the maximum frequency of \p expr;
+
+    \param val_n
+    The numerator of them value of \p expr at a point in the grid
+    that is closest to zero;
+
+    \param val_d
+    The denominator of a value of \p expr at a point in the grid
+    that is closest to zero;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or frequency is undefined with respect to \p expr,
+    then <CODE>false</CODE> is returned and \p freq_n, \p freq_d,
+    \p val_n and \p val_d are left untouched.
+  */
+  bool frequency(const Linear_Expression& expr,
+                 Coefficient& freq_n, Coefficient& freq_d,
+                 Coefficient& val_n, Coefficient& val_d) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool contains(const Grid& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this strictly
+    contains \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool strictly_contains(const Grid& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  /*!
+    \return
+    <CODE>true</CODE> if and only if \p *this satisfies all the
+    invariants and either \p check_not_empty is <CODE>false</CODE> or
+    \p *this is not empty.
+
+    \param check_not_empty
+    <CODE>true</CODE> if and only if, in addition to checking the
+    invariants, \p *this must be checked to be not empty.
+
+    The check is performed so as to intrude as little as possible.  If
+    the library has been compiled with run-time assertions enabled,
+    error messages are written on <CODE>std::cerr</CODE> in case
+    invariants are violated. This is useful for the purpose of
+    debugging the library.
+  */
+  bool OK(bool check_not_empty = false) const;
+
+  //@} // Member Functions that Do Not Modify the Grid
+
+  //! \name Space Dimension Preserving Member Functions that May Modify the Grid
+  //@{
+
+  //! Adds a copy of congruence \p cg to \p *this.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are
+    dimension-incompatible.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Adds a copy of grid generator \p g to the system of generators of
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible,
+    or if \p *this is an empty grid and \p g is not a point.
+  */
+  void add_grid_generator(const Grid_Generator& g);
+
+  //! Adds a copy of each congruence in \p cgs to \p *this.
+  /*!
+    \param cgs
+    Contains the congruences that will be added to the system of
+    congruences of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  //! Adds the congruences in \p cgs to *this.
+  /*!
+    \param cgs
+    The congruence system to be added to \p *this.  The congruences in
+    \p cgs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+
+    \warning
+    The only assumption that can be made about \p cgs upon successful
+    or exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_congruences(Congruence_System& cgs);
+
+  /*! \brief
+    Adds to \p *this a congruence equivalent to constraint \p c.
+
+    \param c
+    The constraint to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible
+    or if constraint \p c is not optimally supported by the grid domain.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds to \p *this congruences equivalent to the constraints in \p cs.
+
+    \param cs
+    The constraints to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible
+    or if \p cs contains a constraint which is not optimally supported
+    by the grid domain.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Adds to \p *this congruences equivalent to the constraints in \p cs.
+
+    \param cs
+    The constraints to be added. They may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible
+    or if \p cs contains a constraint which is not optimally supported
+    by the grid domain.
+
+    \warning
+    The only assumption that can be made about \p cs upon successful
+    or exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_constraints(Constraint_System& cs);
+
+  //! Uses a copy of the congruence \p cg to refine \p *this.
+  /*!
+    \param cg
+    The congruence used.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+ //! Uses a copy of the congruences in \p cgs to refine \p *this.
+  /*!
+    \param cgs
+    The congruences used.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  //! Uses a copy of the constraint \p c to refine \p *this.
+  /*!
+
+    \param c
+    The constraint used. If it is not an equality, it will be ignored
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  //! Uses a copy of the constraints in \p cs to refine \p *this.
+  /*!
+    \param cs
+    The constraints used. Constraints that are not equalities are ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Adds a copy of the generators in \p gs to the system of generators
+    of \p *this.
+
+    \param gs
+    Contains the generators that will be added to the system of
+    generators of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p gs are dimension-incompatible, or if
+    \p *this is empty and the system of generators \p gs is not empty,
+    but has no points.
+  */
+  void add_grid_generators(const Grid_Generator_System& gs);
+
+  /*! \brief
+    Adds the generators in \p gs to the system of generators of \p
+    *this.
+
+    \param gs
+    The generator system to be added to \p *this.  The generators in
+    \p gs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p gs are dimension-incompatible.
+
+    \warning
+    The only assumption that can be made about \p gs upon successful
+    or exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_grid_generators(Grid_Generator_System& gs);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  /*! \brief
+    Assigns to \p *this the intersection of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void intersection_assign(const Grid& y);
+
+  /*! \brief
+    Assigns to \p *this the least upper bound of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void upper_bound_assign(const Grid& y);
+
+  /*! \brief
+    If the upper bound of \p *this and \p y is exact it is assigned to \p
+    *this and <CODE>true</CODE> is returned, otherwise
+    <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool upper_bound_assign_if_exact(const Grid& y);
+
+  /*! \brief
+    Assigns to \p *this the \ref Convex_Polyhedral_Difference "grid-difference"
+    of \p *this and \p y.
+
+    The grid difference between grids x and y is the smallest grid
+    containing all the points from x and y that are only in x.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void difference_assign(const Grid& y);
+
+  /*! \brief
+    Assigns to \p *this a \ref Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+    If \c false is returned, then the intersection is empty.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool simplify_using_context_assign(const Grid& y);
+
+  /*! \brief
+    Assigns to \p *this the \ref Grid_Affine_Transformation
+    "affine image" of \p
+    *this under the function mapping variable \p var to the affine
+    expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of
+    \p *this.
+
+    \if Include_Implementation_Details
+
+    When considering the generators of a grid, the
+    affine transformation
+    \f[
+      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{\mathrm{denominator}}
+    \f]
+    is assigned to \p var where \p expr is
+    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
+    (\f$b\f$ is the inhomogeneous term).
+
+    If congruences are up-to-date, it uses the specialized function
+    affine_preimage() (for the system of congruences)
+    and inverse transformation to reach the same result.
+    To obtain the inverse transformation we use the following observation.
+
+    Observation:
+    -# The affine transformation is invertible if the coefficient
+       of \p var in this transformation (i.e., \f$a_\mathrm{var}\f$)
+       is different from zero.
+    -# If the transformation is invertible, then we can write
+       \f[
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
+           = a_\mathrm{var} x_\mathrm{var}
+             + \sum_{i \neq var} a_i x_i + b,
+       \f]
+       so that the inverse transformation is
+       \f[
+         a_\mathrm{var} x_\mathrm{var}
+           = \mathrm{denominator} * {x'}_\mathrm{var}
+             - \sum_{i \neq j} a_i x_i - b.
+       \f]
+
+    Then, if the transformation is invertible, all the entities that
+    were up-to-date remain up-to-date. Otherwise only generators remain
+    up-to-date.
+
+    \endif
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                    = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the \ref Grid_Affine_Transformation
+    "affine preimage" of
+    \p *this under the function mapping variable \p var to the affine
+    expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is substituted;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this.
+
+    \if Include_Implementation_Details
+
+    When considering congruences of a grid, the affine transformation
+    \f[
+      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{denominator},
+    \f]
+    is assigned to \p var where \p expr is
+    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
+    (\f$b\f$ is the inhomogeneous term).
+
+    If generators are up-to-date, then the specialized function
+    affine_image() is used (for the system of generators)
+    and inverse transformation to reach the same result.
+    To obtain the inverse transformation, we use the following observation.
+
+    Observation:
+    -# The affine transformation is invertible if the coefficient
+       of \p var in this transformation (i.e. \f$a_\mathrm{var}\f$)
+       is different from zero.
+    -# If the transformation is invertible, then we can write
+       \f[
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
+           = a_\mathrm{var} x_\mathrm{var}
+               + \sum_{i \neq \mathrm{var}} a_i x_i + b,
+       \f],
+       the inverse transformation is
+       \f[
+         a_\mathrm{var} x_\mathrm{var}
+           = \mathrm{denominator} * {x'}_\mathrm{var}
+               - \sum_{i \neq j} a_i x_i - b.
+       \f].
+
+    Then, if the transformation is invertible, all the entities that
+    were up-to-date remain up-to-date. Otherwise only congruences remain
+    up-to-date.
+
+    \endif
+  */
+  void affine_preimage(Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to
+    the \ref Grid_Generalized_Image "generalized affine relation"
+    \f$\mathrm{var}' = \frac{\mathrm{expr}}{\mathrm{denominator}}
+    \pmod{\mathrm{modulus}}\f$.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol where EQUAL is the symbol for a congruence
+    relation;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression.
+    Optional argument with an automatic value of one;
+
+    \param modulus
+    The modulus of the congruence lhs %= rhs.  A modulus of zero
+    indicates lhs == rhs.  Optional argument with an automatic value
+    of zero.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p
+    *this.
+  */
+  void
+  generalized_affine_image(Variable var,
+                           Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator
+                           = Coefficient_one(),
+                           Coefficient_traits::const_reference modulus
+                           = Coefficient_zero());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Grid_Generalized_Image "generalized affine relation"
+    \f$\mathrm{var}' = \frac{\mathrm{expr}}{\mathrm{denominator}}
+    \pmod{\mathrm{modulus}}\f$.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol where EQUAL is the symbol for a congruence
+    relation;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression.
+    Optional argument with an automatic value of one;
+
+    \param modulus
+    The modulus of the congruence lhs %= rhs.  A modulus of zero
+    indicates lhs == rhs.  Optional argument with an automatic value
+    of zero.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p
+    *this.
+  */
+  void
+  generalized_affine_preimage(Variable var,
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one(),
+                              Coefficient_traits::const_reference modulus
+                              = Coefficient_zero());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to
+    the \ref Grid_Generalized_Image "generalized affine relation"
+    \f$\mathrm{lhs}' = \mathrm{rhs} \pmod{\mathrm{modulus}}\f$.
+
+    \param lhs
+    The left hand side affine expression.
+
+    \param relsym
+    The relation symbol where EQUAL is the symbol for a congruence
+    relation;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \param modulus
+    The modulus of the congruence lhs %= rhs.  A modulus of zero
+    indicates lhs == rhs.  Optional argument with an automatic value
+    of zero.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p
+    rhs.
+  */
+  void
+  generalized_affine_image(const Linear_Expression& lhs,
+                           Relation_Symbol relsym,
+                           const Linear_Expression& rhs,
+                           Coefficient_traits::const_reference modulus
+                           = Coefficient_zero());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Grid_Generalized_Image "generalized affine relation"
+    \f$\mathrm{lhs}' = \mathrm{rhs} \pmod{\mathrm{modulus}}\f$.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol where EQUAL is the symbol for a congruence
+    relation;
+
+    \param rhs
+    The right hand side affine expression;
+
+    \param modulus
+    The modulus of the congruence lhs %= rhs.  A modulus of zero
+    indicates lhs == rhs.  Optional argument with an automatic value
+    of zero.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p
+    rhs.
+  */
+  void
+  generalized_affine_preimage(const Linear_Expression& lhs,
+                              Relation_Symbol relsym,
+                              const Linear_Expression& rhs,
+                              Coefficient_traits::const_reference modulus
+                              = Coefficient_zero());
+
+  /*!
+    \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+  /*!
+    \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the result of computing the \ref Grid_Time_Elapse
+    "time-elapse" between \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void time_elapse_assign(const Grid& y);
+
+  /*! \brief
+    \ref Wrapping_Operator "Wraps" the specified dimensions of the
+    vector space.
+
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be wrapped.
+
+    \param w
+    The width of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param r
+    The representation of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param o
+    The overflow behavior of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param cs_p
+    Possibly null pointer to a constraint system.
+    This argument is for compatibility with wrap_assign()
+    for the other domains and only checked for dimension-compatibility.
+
+    \param complexity_threshold
+    A precision parameter of the \ref Wrapping_Operator "wrapping operator".
+    This argument is for compatibility with wrap_assign()
+    for the other domains and is ignored.
+
+    \param wrap_individually
+    <CODE>true</CODE> if the dimensions should be wrapped individually.
+    As wrapping dimensions collectively does not improve the precision,
+    this argument is ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars or with <CODE>*cs_p</CODE>.
+
+    \warning
+    It is assumed that variables in \p Vars represent integers.  Thus,
+    where the extra cost is negligible, the integrality of these
+    variables is enforced; possibly causing a non-integral grid to
+    become empty.
+  */
+  void wrap_assign(const Variables_Set& vars,
+                   Bounded_Integer_Type_Width w,
+                   Bounded_Integer_Type_Representation r,
+                   Bounded_Integer_Type_Overflow o,
+                   const Constraint_System* cs_p = 0,
+                   unsigned complexity_threshold = 16,
+                   bool wrap_individually = true);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping all points with non-integer
+    coordinates.
+
+    \param complexity
+    This argument is ignored as the algorithm used has polynomial
+    complexity.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping all points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    This argument is ignored as the algorithm used has polynomial
+    complexity.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  /*! \brief
+    Assigns to \p *this the result of computing the \ref Grid_Widening
+    "Grid widening" between \p *this and \p y using congruence systems.
+
+    \param y
+    A grid that <EM>must</EM> be contained in \p *this;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void congruence_widening_assign(const Grid& y, unsigned* tp = NULL);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the \ref Grid_Widening
+    "Grid widening" between \p *this and \p y using generator systems.
+
+    \param y
+    A grid that <EM>must</EM> be contained in \p *this;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void generator_widening_assign(const Grid& y, unsigned* tp = NULL);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the \ref Grid_Widening
+    "Grid widening" between \p *this and \p y.
+
+    This widening uses either the congruence or generator systems
+    depending on which of the systems describing x and y
+    are up to date and minimized.
+
+    \param y
+    A grid that <EM>must</EM> be contained in \p *this;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void widening_assign(const Grid& y, unsigned* tp = NULL);
+
+  /*! \brief
+    Improves the result of the congruence variant of
+    \ref Grid_Widening "Grid widening" computation by also enforcing
+    those congruences in \p cgs that are satisfied by all the points
+    of \p *this.
+
+    \param y
+    A grid that <EM>must</EM> be contained in \p *this;
+
+    \param cgs
+    The system of congruences used to improve the widened grid;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
+  */
+  void limited_congruence_extrapolation_assign(const Grid& y,
+                                               const Congruence_System& cgs,
+                                               unsigned* tp = NULL);
+
+  /*! \brief
+    Improves the result of the generator variant of the
+    \ref Grid_Widening "Grid widening"
+    computation by also enforcing those congruences in \p cgs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    A grid that <EM>must</EM> be contained in \p *this;
+
+    \param cgs
+    The system of congruences used to improve the widened grid;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
+  */
+  void limited_generator_extrapolation_assign(const Grid& y,
+                                              const Congruence_System& cgs,
+                                              unsigned* tp = NULL);
+
+  /*! \brief
+    Improves the result of the \ref Grid_Widening "Grid widening"
+    computation by also enforcing those congruences in \p cgs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    A grid that <EM>must</EM> be contained in \p *this;
+
+    \param cgs
+    The system of congruences used to improve the widened grid;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Grid_Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
+  */
+  void limited_extrapolation_assign(const Grid& y,
+                                    const Congruence_System& cgs,
+                                    unsigned* tp = NULL);
+
+  //@} // Space Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  /*! \brief
+    \ref Adding_New_Dimensions_to_the_Vector_Space "Adds"
+    \p m new space dimensions and embeds the old grid in the new
+    vector space.
+
+    \param m
+    The number of dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the vector
+    space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    The new space dimensions will be those having the highest indexes
+    in the new grid, which is characterized by a system of congruences
+    in which the variables which are the new dimensions can have any
+    value.  For instance, when starting from the grid \f$\cL \sseq
+    \Rset^2\f$ and adding a third space dimension, the result will be
+    the grid
+    \f[
+      \bigl\{\,
+        (x, y, z)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cL
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    \ref Adding_New_Dimensions_to_the_Vector_Space "Adds"
+    \p m new space dimensions to the grid and does not embed it
+    in the new vector space.
+
+    \param m
+    The number of space dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    The new space dimensions will be those having the highest indexes
+    in the new grid, which is characterized by a system of congruences
+    in which the variables running through the new dimensions are all
+    constrained to be equal to 0.  For instance, when starting from
+    the grid \f$\cL \sseq \Rset^2\f$ and adding a third space
+    dimension, the result will be the grid
+    \f[
+      \bigl\{\,
+        (x, y, 0)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cL
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  /*! \brief
+    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation" of
+    \p *this and \p y, taken in this order.
+
+    \exception std::length_error
+    Thrown if the concatenation would cause the vector space
+    to exceed dimension <CODE>max_space_dimension()</CODE>.
+  */
+  void concatenate_assign(const Grid& y);
+
+  //! Removes all the specified dimensions from the vector space.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher dimensions of the vector space so that the
+    resulting space will have \ref Removing_Dimensions_from_the_Vector_Space
+    "dimension \p new_dimension."
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimensions is greater than the space dimension of
+    \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
+
+    If \p pfunc maps only some of the dimensions of \p *this then the
+    rest will be projected away.
+
+    If the highest dimension mapped to by \p pfunc is higher than the
+    highest dimension in \p *this then the number of dimensions in \p
+    *this will be increased to the highest dimension mapped to by \p
+    pfunc.
+
+    \param pfunc
+    The partial function specifying the destiny of each space
+    dimension.
+
+    The template type parameter Partial_Function must provide
+    the following methods.
+    \code
+      bool has_empty_codomain() const
+    \endcode
+    returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty codomain (i.e., it is always undefined).
+    The <CODE>has_empty_codomain()</CODE> method will always be called
+    before the methods below.  However, if
+    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
+    of the functions below will be called.
+    \code
+      dimension_type max_in_codomain() const
+    \endcode
+    returns the maximum value that belongs to the codomain of the
+    partial function.
+    The <CODE>max_in_codomain()</CODE> method is called at most once.
+    \code
+      bool maps(dimension_type i, dimension_type& j) const
+    \endcode
+    Let \f$f\f$ be the represented function and \f$k\f$ be the value
+    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
+    assigned to \p j and <CODE>true</CODE> is returned.  If \f$f\f$ is
+    undefined in \f$k\f$, then <CODE>false</CODE> is returned.
+    This method is called at most \f$n\f$ times, where \f$n\f$ is the
+    dimension of the vector space enclosing the grid.
+
+    The result is undefined if \p pfunc does not encode a partial
+    function with the properties described in the
+    \ref Mapping_the_Dimensions_of_the_Vector_Space "specification of the mapping operator".
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector
+    space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the vector
+    space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions
+    "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.  Also
+    thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are
+    \ref Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension "folded"
+    into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+  friend bool operator==(const Grid& x, const Grid& y);
+
+  friend class Parma_Polyhedra_Library::Grid_Certificate;
+
+  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
+
+  //! \name Miscellaneous Member Functions
+  //@{
+
+  //! Destructor.
+  ~Grid();
+
+  /*! \brief
+    Swaps \p *this with grid \p y.  (\p *this and \p y can be
+    dimension-incompatible.)
+  */
+  void m_swap(Grid& y);
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If \p x and \p y are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  //@} // Miscellaneous Member Functions
+
+private:
+
+  //! The system of congruences.
+  Congruence_System con_sys;
+
+  //! The system of generators.
+  Grid_Generator_System gen_sys;
+
+#define PPL_IN_Grid_CLASS
+#include "Grid_Status_idefs.hh"
+#undef PPL_IN_Grid_CLASS
+
+  //! The status flags to keep track of the grid's internal state.
+  Status status;
+
+  //! The number of dimensions of the enclosing vector space.
+  dimension_type space_dim;
+
+  enum Dimension_Kind {
+    PARAMETER = 0,
+    LINE = 1,
+    GEN_VIRTUAL = 2,
+    PROPER_CONGRUENCE = PARAMETER,
+    CON_VIRTUAL = LINE,
+    EQUALITY = GEN_VIRTUAL
+  };
+
+  typedef std::vector<Dimension_Kind> Dimension_Kinds;
+
+  // The type of row associated with each dimension.  If the virtual
+  // rows existed then the reduced systems would be square and upper
+  // or lower triangular, and the rows in each would have the types
+  // given in this vector.  As the congruence system is reduced to an
+  // upside-down lower triangular form the ordering of the congruence
+  // types is last to first.
+  Dimension_Kinds dim_kinds;
+
+  //! Builds a grid universe or empty grid.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the grid;
+
+    \param kind
+    specifies whether the universe or the empty grid has to be built.
+  */
+  void construct(dimension_type num_dimensions, Degenerate_Element kind);
+
+  //! Builds a grid from a system of congruences.
+  /*!
+    The grid inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences defining the grid. Its data-structures
+    may be recycled to build the grid.
+  */
+  void construct(Congruence_System& cgs);
+
+  //! Builds a grid from a system of grid generators.
+  /*!
+    The grid inherits the space dimension of the generator system.
+
+    \param ggs
+    The system of grid generators defining the grid.  Its data-structures
+    may be recycled to build the grid.
+  */
+  void construct(Grid_Generator_System& ggs);
+
+  //! \name Private Verifiers: Verify if Individual Flags are Set
+  //@{
+
+  //! Returns <CODE>true</CODE> if the grid is known to be empty.
+  /*!
+    The return value <CODE>false</CODE> does not necessarily
+    implies that \p *this is non-empty.
+  */
+  bool marked_empty() const;
+
+  //! Returns <CODE>true</CODE> if the system of congruences is up-to-date.
+  bool congruences_are_up_to_date() const;
+
+  //! Returns <CODE>true</CODE> if the system of generators is up-to-date.
+  bool generators_are_up_to_date() const;
+
+  //! Returns <CODE>true</CODE> if the system of congruences is minimized.
+  bool congruences_are_minimized() const;
+
+  //! Returns <CODE>true</CODE> if the system of generators is minimized.
+  bool generators_are_minimized() const;
+
+  //@} // Private Verifiers: Verify if Individual Flags are Set
+
+  //! \name State Flag Setters: Set Only the Specified Flags
+  //@{
+
+  /*! \brief
+    Sets \p status to express that the grid is the universe
+    0-dimension vector space, clearing all corresponding matrices.
+  */
+  void set_zero_dim_univ();
+
+  /*! \brief
+    Sets \p status to express that the grid is empty, clearing all
+    corresponding matrices.
+  */
+  void set_empty();
+
+  //! Sets \p status to express that congruences are up-to-date.
+  void set_congruences_up_to_date();
+
+  //! Sets \p status to express that generators are up-to-date.
+  void set_generators_up_to_date();
+
+  //! Sets \p status to express that congruences are minimized.
+  void set_congruences_minimized();
+
+  //! Sets \p status to express that generators are minimized.
+  void set_generators_minimized();
+
+  //@} // State Flag Setters: Set Only the Specified Flags
+
+  //! \name State Flag Cleaners: Clear Only the Specified Flag
+  //@{
+
+  //! Clears the \p status flag indicating that the grid is empty.
+  void clear_empty();
+
+  //! Sets \p status to express that congruences are out of date.
+  void clear_congruences_up_to_date();
+
+  //! Sets \p status to express that generators are out of date.
+  void clear_generators_up_to_date();
+
+  //! Sets \p status to express that congruences are no longer minimized.
+  void clear_congruences_minimized();
+
+  //! Sets \p status to express that generators are no longer minimized.
+  void clear_generators_minimized();
+
+  //@} // State Flag Cleaners: Clear Only the Specified Flag
+
+  //! \name Updating Matrices
+  //@{
+
+  //! Updates and minimizes the congruences from the generators.
+  void update_congruences() const;
+
+  //! Updates and minimizes the generators from the congruences.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty grid.
+
+    It is illegal to call this method when the Status field already
+    declares the grid to be empty.
+  */
+  bool update_generators() const;
+
+  //@} // Updating Matrices
+
+  //! \name Minimization of Descriptions
+  //@{
+
+  //! Minimizes both the congruences and the generators.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty grid.
+
+    Minimization is performed on each system only if the minimized
+    Status field is clear.
+  */
+  bool minimize() const;
+
+  //@} // Minimization of Descriptions
+
+  enum Three_Valued_Boolean {
+    TVB_TRUE,
+    TVB_FALSE,
+    TVB_DONT_KNOW
+  };
+
+  //! Polynomial but incomplete equivalence test between grids.
+  Three_Valued_Boolean quick_equivalence_test(const Grid& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is included in \p y.
+  bool is_included_in(const Grid& y) const;
+
+  //! Checks if and how \p expr is bounded in \p *this.
+  /*!
+    Returns <CODE>true</CODE> if and only if \p from_above is
+    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
+    or \p from_above is <CODE>false</CODE> and \p expr is bounded
+    from below in \p *this.
+
+    \param expr
+    The linear expression to test;
+
+    \param method_call
+    The call description of the public parent method, for example
+    "bounded_from_above(e)".  Passed to throw_dimension_incompatible,
+    as the first argument.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds(const Linear_Expression& expr, const char* method_call) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p
+    *this;
+
+    \param method_call
+    The call description of the public parent method, for example
+    "maximize(e)".  Passed to throw_dimension_incompatible, as the
+    first argument;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr in \p
+    *this can actually be reached (which is always the case);
+
+    \param point
+    When maximization or minimization succeeds, will be assigned the
+    point where \p expr reaches the extremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p point are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               const char* method_call,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator* point = NULL) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \ref Grid_Frequency "frequency" for \p *this with respect to \p expr
+    is defined, in which case the frequency and the value for \p expr
+    that is closest to zero are computed.
+
+    \param expr
+    The linear expression for which the frequency is needed;
+
+    \param freq_n
+    The numerator of the maximum frequency of \p expr;
+
+    \param freq_d
+    The denominator of the maximum frequency of \p expr;
+
+    \param val_n
+    The numerator of a value of \p expr at a point in the grid
+    that is closest to zero;
+
+    \param val_d
+    The denominator of a value of \p expr at a point in the grid
+    that is closest to zero;
+
+    If \p *this is empty or frequency is undefined with respect to \p expr,
+    then <CODE>false</CODE> is returned and \p freq_n, \p freq_d,
+    \p val_n and \p val_d are left untouched.
+
+    \warning
+    If \p expr and \p *this are dimension-incompatible,
+    the grid generator system is not minimized or \p *this is
+    empty, then the behavior is undefined.
+  */
+  bool frequency_no_check(const Linear_Expression& expr,
+                Coefficient& freq_n, Coefficient& freq_d,
+                Coefficient& val_n, Coefficient& val_d) const;
+
+  //! Checks if and how \p expr is bounded in \p *this.
+  /*!
+    Returns <CODE>true</CODE> if and only if \p from_above is
+    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
+    or \p from_above is <CODE>false</CODE> and \p expr is bounded
+    from below in \p *this.
+
+    \param expr
+    The linear expression to test;
+  */
+  bool bounds_no_check(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Adds the congruence \p cg to \p *this.
+
+    \warning
+    If \p cg and \p *this are dimension-incompatible,
+    the grid generator system is not minimized or \p *this is
+    empty, then the behavior is undefined.
+  */
+  void add_congruence_no_check(const Congruence& cg);
+
+  /*! \brief
+    Uses the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be added.
+
+    \exception std::invalid_argument
+    Thrown if c is a non-trivial inequality constraint.
+
+    \warning
+    If \p c and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void add_constraint_no_check(const Constraint& c);
+
+  /*! \brief
+    Uses the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be added.
+    Non-trivial inequalities are ignored.
+
+    \warning
+    If \p c and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Constraint& c);
+
+  //! \name Widening- and Extrapolation-Related Functions
+  //@{
+
+  //! Copies a widened selection of congruences from \p y to \p selected_cgs.
+  void select_wider_congruences(const Grid& y,
+                                Congruence_System& selected_cgs) const;
+
+  //! Copies widened generators from \p y to \p widened_ggs.
+  void select_wider_generators(const Grid& y,
+                               Grid_Generator_System& widened_ggs) const;
+
+  //@} // Widening- and Extrapolation-Related Functions
+
+  //! Adds new space dimensions to the given systems.
+  /*!
+    \param cgs
+    A congruence system, to which columns are added;
+
+    \param gs
+    A generator system, to which rows and columns are added;
+
+    \param dims
+    The number of space dimensions to add.
+
+    This method is invoked only by
+    <CODE>add_space_dimensions_and_embed()</CODE>.
+  */
+  void add_space_dimensions(Congruence_System& cgs,
+                            Grid_Generator_System& gs,
+                            dimension_type dims);
+
+  //! Adds new space dimensions to the given systems.
+  /*!
+    \param gs
+    A generator system, to which columns are added;
+
+    \param cgs
+    A congruence system, to which rows and columns are added;
+
+    \param dims
+    The number of space dimensions to add.
+
+    This method is invoked only by
+    <CODE>add_space_dimensions_and_project()</CODE>.
+  */
+  void add_space_dimensions(Grid_Generator_System& gs,
+                            Congruence_System& cgs,
+                            dimension_type dims);
+
+  //! \name Minimization-related Static Member Functions
+  //@{
+
+  //! Normalizes the divisors in \p sys.
+  /*!
+    Converts \p sys to an equivalent system in which the divisors are
+    of equal value.
+
+    \param sys
+    The generator system to be normalized.  It must have at least one
+    row.
+
+    \param divisor
+    A reference to the initial value of the divisor.  The resulting
+    value of this object is the new system divisor.
+
+    \param first_point
+    If \p first_point has a value other than NULL then it is taken as
+    the first point in \p sys, and it is assumed that any following
+    points have the same divisor as \p first_point.
+  */
+  static void
+  normalize_divisors(Grid_Generator_System& sys,
+                     Coefficient& divisor,
+                     const Grid_Generator* first_point = NULL);
+
+  //! Normalizes the divisors in \p sys.
+  /*!
+    Converts \p sys to an equivalent system in which the divisors are
+    of equal value.
+
+    \param sys
+    The generator system to be normalized.  It must have at least one
+    row.
+  */
+  static void
+  normalize_divisors(Grid_Generator_System& sys);
+
+  //! Normalize all the divisors in \p sys and \p gen_sys.
+  /*!
+    Modify \p sys and \p gen_sys to use the same single divisor value
+    for all generators, leaving each system representing the grid it
+    represented originally.
+
+    \param sys
+    The first of the generator systems to be normalized.
+
+    \param gen_sys
+    The second of the generator systems to be normalized.  This system
+    must have at least one row and the divisors of the generators in
+    this system must be equal.
+
+    \exception std::runtime_error
+    Thrown if all rows in \p gen_sys are lines and/or parameters.
+  */
+  static void normalize_divisors(Grid_Generator_System& sys,
+                                 Grid_Generator_System& gen_sys);
+
+  /*! \brief
+    Converts generator system \p dest to be equivalent to congruence
+    system \p source.
+  */
+  static void conversion(Congruence_System& source,
+                         Grid_Generator_System& dest,
+                         Dimension_Kinds& dim_kinds);
+
+  /*! \brief
+    Converts congruence system \p dest to be equivalent to generator
+    system \p source.
+  */
+  static void conversion(Grid_Generator_System& source,
+                         Congruence_System& dest,
+                         Dimension_Kinds& dim_kinds);
+
+  //! Converts \p cgs to upper triangular (i.e. minimized) form.
+  /*!
+    Returns <CODE>true</CODE> if \p cgs represents the empty set,
+    otherwise returns <CODE>false</CODE>.
+  */
+  static bool simplify(Congruence_System& cgs,
+                       Dimension_Kinds& dim_kinds);
+
+  //! Converts \p gs to lower triangular (i.e. minimized) form.
+  /*!
+    Expects \p gs to contain at least one point.
+  */
+  static void simplify(Grid_Generator_System& ggs,
+                       Dimension_Kinds& dim_kinds);
+
+  //! Reduces the line \p row using the line \p pivot.
+  /*!
+    Uses the line \p pivot to change the representation of the line
+    \p row so that the element at index \p column of \p row is zero.
+  */
+  // A member of Grid for access to Matrix<Dense_Row>::rows.
+  static void reduce_line_with_line(Grid_Generator& row,
+                                    Grid_Generator& pivot,
+                                    dimension_type column);
+
+  //! Reduces the equality \p row using the equality \p pivot.
+  /*!
+    Uses the equality \p pivot to change the representation of the
+    equality \p row so that the element at index \p column of \p row
+    is zero.
+  */
+  // A member of Grid for access to Matrix<Dense_Row>::rows.
+  static void reduce_equality_with_equality(Congruence& row,
+                                            const Congruence& pivot,
+                                            dimension_type column);
+
+  //! Reduces \p row using \p pivot.
+  /*!
+    Uses the point, parameter or proper congruence at \p pivot to
+    change the representation of the point, parameter or proper
+    congruence at \p row so that the element at index \p column of \p row
+    is zero.  Only elements from index \p start to index \p end are
+    modified (i.e. it is assumed that all other elements are zero).
+    This means that \p col must be in [start,end).
+
+    NOTE: This may invalidate the rows, since it messes with the divisors.
+    Client code has to fix that (if needed) and assert OK().
+  */
+  // Part of Grid for access to Matrix<Dense_Row>::rows.
+  template <typename R>
+  static void reduce_pc_with_pc(R& row,
+                                R& pivot,
+                                dimension_type column,
+                                dimension_type start,
+                                dimension_type end);
+
+  //! Reduce \p row using \p pivot.
+  /*!
+    Use the line \p pivot to change the representation of the
+    parameter \p row such that the element at index \p column of \p row
+    is zero.
+  */
+  // This takes a parameter with type Swapping_Vector<Grid_Generator> (instead
+  // of Grid_Generator_System) to simplify the implementation of `simplify()'.
+  // NOTE: This may invalidate `row' and the rows in `sys'. Client code must
+  // fix/check this.
+  static void reduce_parameter_with_line(Grid_Generator& row,
+                                         const Grid_Generator& pivot,
+                                         dimension_type column,
+                                         Swapping_Vector<Grid_Generator>& sys,
+                                         dimension_type num_columns);
+
+  //! Reduce \p row using \p pivot.
+  /*!
+    Use the equality \p pivot to change the representation of the
+    congruence \p row such that element at index \p column of \p row
+    is zero.
+  */
+  // A member of Grid for access to Matrix<Dense_Row>::rows.
+  // This takes a parameter with type Swapping_Vector<Congruence> (instead of
+  // Congruence_System) to simplify the implementation of `conversion()'.
+  static void reduce_congruence_with_equality(Congruence& row,
+                                              const Congruence& pivot,
+                                              dimension_type column,
+                                              Swapping_Vector<Congruence>& sys);
+
+  //! Reduce column \p dim in rows preceding \p pivot_index in \p sys.
+  /*!
+    Required when converting (or simplifying) a congruence or generator
+    system to "strong minimal form"; informally, strong minimal form means
+    that, not only is the system in minimal form (ie a triangular matrix),
+    but also the absolute values of the coefficients of the proper congruences
+    and parameters are minimal. As a simple example, the set of congruences
+    \f$\{3x \equiv_3 0, 4x + y \equiv_3 1\}\f$,
+    (which is in minimal form) is equivalent to the set
+    \f$\{3x \equiv_3 0, x + y \equiv_3 1\}\f$
+    (which is in strong minimal form).
+
+    \param sys
+    The generator or congruence system to be reduced to strong minimal form.
+
+    \param dim
+    Column to be reduced.
+
+    \param pivot_index
+    Index of last row to be reduced.
+
+    \param start
+    Index of first column to be changed.
+
+    \param end
+    Index of last column to be changed.
+
+    \param sys_dim_kinds
+    Dimension kinds of the elements of \p sys.
+
+    \param generators
+    Flag indicating whether \p sys is a congruence or generator system
+  */
+  template <typename M>
+  // This takes a parameter with type `Swapping_Vector<M::row_type>'
+  // instead of `M' to simplify the implementation of simplify().
+  // NOTE: This may invalidate the rows in `sys'. Client code must
+  // fix/check this.
+  static void reduce_reduced(Swapping_Vector<typename M::row_type>& sys,
+                             dimension_type dim,
+                             dimension_type pivot_index,
+                             dimension_type start, dimension_type end,
+                             const Dimension_Kinds& sys_dim_kinds,
+                             bool generators = true);
+
+  //! Multiply the elements of \p dest by \p multiplier.
+  // A member of Grid for access to Matrix<Dense_Row>::rows and cgs::operator[].
+  // The type of `dest' is Swapping_Vector<Congruence> instead of
+  // Congruence_System to simplify the implementation of conversion().
+  static void multiply_grid(const Coefficient& multiplier,
+                            Congruence& cg,
+                            Swapping_Vector<Congruence>& dest,
+                            dimension_type num_rows);
+
+  //! Multiply the elements of \p dest by \p multiplier.
+  // A member of Grid for access to Grid_Generator::operator[].
+  // The type of `dest' is Swapping_Vector<Grid_Generator> instead of
+  // Grid_Generator_System to simplify the implementation of conversion().
+  // NOTE: This does not check whether the rows are OK(). Client code
+  // should do that.
+  static void multiply_grid(const Coefficient& multiplier,
+                            Grid_Generator& gen,
+                            Swapping_Vector<Grid_Generator>& dest,
+                            dimension_type num_rows);
+
+  /*! \brief
+    If \p sys is lower triangular return <CODE>true</CODE>, else
+    return <CODE>false</CODE>.
+  */
+  static bool lower_triangular(const Congruence_System& sys,
+                               const Dimension_Kinds& dim_kinds);
+
+  /*! \brief
+    If \p sys is upper triangular return <CODE>true</CODE>, else
+    return <CODE>false</CODE>.
+  */
+  static bool upper_triangular(const Grid_Generator_System& sys,
+                               const Dimension_Kinds& dim_kinds);
+
+#ifndef NDEBUG
+  //! Checks that trailing rows contain only zero terms.
+  /*!
+    If all columns contain zero in the rows of \p system from row
+    index \p first to row index \p last then return <code>true</code>,
+    else return <code>false</code>.  \p row_size gives the number of
+    columns in each row.
+
+    This method is only used in assertions in the simplify methods.
+  */
+  template <typename M, typename R>
+  static bool rows_are_zero(M& system,
+                            dimension_type first,
+                            dimension_type last,
+                            dimension_type row_size);
+#endif
+
+  //@} // Minimization-Related Static Member Functions
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \name Exception Throwers
+  //@{
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+protected:
+  void throw_dimension_incompatible(const char* method,
+                                    const char* other_name,
+                                    dimension_type other_dim) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* gr_name,
+                                    const Grid& gr) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* cg_name,
+                                    const Congruence& cg) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* c_name,
+                                    const Constraint& c) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* g_name,
+                                    const Grid_Generator& g) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* g_name,
+                                    const Generator& g) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* cgs_name,
+                                    const Congruence_System& cgs) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* cs_name,
+                                    const Constraint_System& cs) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* gs_name,
+                                    const Grid_Generator_System& gs) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* var_name,
+                                    Variable var) const;
+  void throw_dimension_incompatible(const char* method,
+                                    dimension_type required_space_dim) const;
+
+  static void throw_invalid_argument(const char* method,
+                                     const char* reason);
+  static void throw_invalid_constraint(const char* method,
+                                       const char* c_name);
+  static void throw_invalid_constraints(const char* method,
+                                        const char* cs_name);
+  static void throw_invalid_generator(const char* method,
+                                      const char* g_name);
+  static void throw_invalid_generators(const char* method,
+                                       const char* gs_name);
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //@} // Exception Throwers
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+};
+
+#include "Grid_Status_inlines.hh"
+#include "Grid_inlines.hh"
+#include "Grid_templates.hh"
+
+#endif // !defined(PPL_Grid_defs_hh)
diff --git a/src/Grid_inlines.hh b/src/Grid_inlines.hh
new file mode 100644
index 0000000..5c496dc
--- /dev/null
+++ b/src/Grid_inlines.hh
@@ -0,0 +1,383 @@
+/* Grid class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_inlines_hh
+#define PPL_Grid_inlines_hh 1
+
+#include "Grid_Generator_defs.hh"
+#include "Grid_Generator_System_defs.hh"
+#include "Grid_Generator_System_inlines.hh"
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+inline bool
+Grid::marked_empty() const {
+  return status.test_empty();
+}
+
+inline bool
+Grid::congruences_are_up_to_date() const {
+  return status.test_c_up_to_date();
+}
+
+inline bool
+Grid::generators_are_up_to_date() const {
+  return status.test_g_up_to_date();
+}
+
+inline bool
+Grid::congruences_are_minimized() const {
+  return status.test_c_minimized();
+}
+
+inline bool
+Grid::generators_are_minimized() const {
+  return status.test_g_minimized();
+}
+
+inline void
+Grid::set_generators_up_to_date() {
+  status.set_g_up_to_date();
+}
+
+inline void
+Grid::set_congruences_up_to_date() {
+  status.set_c_up_to_date();
+}
+
+inline void
+Grid::set_congruences_minimized() {
+  set_congruences_up_to_date();
+  status.set_c_minimized();
+}
+
+inline void
+Grid::set_generators_minimized() {
+  set_generators_up_to_date();
+  status.set_g_minimized();
+}
+
+inline void
+Grid::clear_empty() {
+  status.reset_empty();
+}
+
+inline void
+Grid::clear_congruences_minimized() {
+  status.reset_c_minimized();
+}
+
+inline void
+Grid::clear_generators_minimized() {
+  status.reset_g_minimized();
+}
+
+inline void
+Grid::clear_congruences_up_to_date() {
+  clear_congruences_minimized();
+  status.reset_c_up_to_date();
+  // Can get rid of con_sys here.
+}
+
+inline void
+Grid::clear_generators_up_to_date() {
+  clear_generators_minimized();
+  status.reset_g_up_to_date();
+  // Can get rid of gen_sys here.
+}
+
+inline dimension_type
+Grid::max_space_dimension() {
+  // One dimension is reserved to have a value of type dimension_type
+  // that does not represent a legal dimension.
+  return std::min(std::numeric_limits<dimension_type>::max() - 1,
+                  std::min(Congruence_System::max_space_dimension(),
+                           Grid_Generator_System::max_space_dimension()
+                           )
+                  );
+}
+
+inline
+Grid::Grid(dimension_type num_dimensions,
+           const Degenerate_Element kind)
+  : con_sys(),
+    gen_sys(check_space_dimension_overflow(num_dimensions,
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(n, k)",
+                                           "n exceeds the maximum "
+                                           "allowed space dimension")) {
+  construct(num_dimensions, kind);
+  PPL_ASSERT(OK());
+}
+
+inline
+Grid::Grid(const Congruence_System& cgs)
+  : con_sys(check_space_dimension_overflow(cgs.space_dimension(),
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(cgs)",
+                                           "the space dimension of cgs "
+                                           "exceeds the maximum allowed "
+                                           "space dimension")),
+    gen_sys(cgs.space_dimension()) {
+  Congruence_System cgs_copy(cgs);
+  construct(cgs_copy);
+}
+
+inline
+Grid::Grid(Congruence_System& cgs, Recycle_Input)
+  : con_sys(check_space_dimension_overflow(cgs.space_dimension(),
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(cgs, recycle)",
+                                           "the space dimension of cgs "
+                                           "exceeds the maximum allowed "
+                                           "space dimension")),
+    gen_sys(cgs.space_dimension()) {
+  construct(cgs);
+}
+
+inline
+Grid::Grid(const Grid_Generator_System& ggs)
+  : con_sys(check_space_dimension_overflow(ggs.space_dimension(),
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(ggs)",
+                                           "the space dimension of ggs "
+                                           "exceeds the maximum allowed "
+                                           "space dimension")),
+    gen_sys(ggs.space_dimension()) {
+  Grid_Generator_System ggs_copy(ggs);
+  construct(ggs_copy);
+}
+
+inline
+Grid::Grid(Grid_Generator_System& ggs, Recycle_Input)
+  : con_sys(check_space_dimension_overflow(ggs.space_dimension(),
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(ggs, recycle)",
+                                           "the space dimension of ggs "
+                                           "exceeds the maximum allowed "
+                                           "space dimension")),
+    gen_sys(ggs.space_dimension()) {
+  construct(ggs);
+}
+
+template <typename U>
+inline
+Grid::Grid(const BD_Shape<U>& bd, Complexity_Class)
+  : con_sys(check_space_dimension_overflow(bd.space_dimension(),
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(bd)",
+                                           "the space dimension of bd "
+                                           "exceeds the maximum allowed "
+                                           "space dimension")),
+    gen_sys(bd.space_dimension()) {
+  Congruence_System cgs = bd.congruences();
+  construct(cgs);
+}
+
+template <typename U>
+inline
+Grid::Grid(const Octagonal_Shape<U>& os, Complexity_Class)
+  : con_sys(check_space_dimension_overflow(os.space_dimension(),
+                                           max_space_dimension(),
+                                           "PPL::Grid::",
+                                           "Grid(os)",
+                                           "the space dimension of os "
+                                           "exceeds the maximum allowed "
+                                           "space dimension")),
+    gen_sys(os.space_dimension()) {
+  Congruence_System cgs = os.congruences();
+  construct(cgs);
+}
+
+inline
+Grid::~Grid() {
+}
+
+inline dimension_type
+Grid::space_dimension() const {
+  return space_dim;
+}
+
+inline memory_size_type
+Grid::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline int32_t
+Grid::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+inline Constraint_System
+Grid::constraints() const {
+  return Constraint_System(congruences());
+}
+
+inline Constraint_System
+Grid::minimized_constraints() const {
+  return Constraint_System(minimized_congruences());
+}
+
+inline void
+Grid::m_swap(Grid& y) {
+  using std::swap;
+  swap(con_sys, y.con_sys);
+  swap(gen_sys, y.gen_sys);
+  swap(status, y.status);
+  swap(space_dim, y.space_dim);
+  swap(dim_kinds, y.dim_kinds);
+}
+
+inline void
+Grid::add_congruence(const Congruence& cg) {
+  // Dimension-compatibility check.
+  if (space_dim < cg.space_dimension())
+    throw_dimension_incompatible("add_congruence(cg)", "cg", cg);
+
+  if (!marked_empty())
+    add_congruence_no_check(cg);
+}
+
+inline void
+Grid::add_congruences(const Congruence_System& cgs) {
+  // TODO: this is just an executable specification.
+  // Space dimension compatibility check.
+  if (space_dim < cgs.space_dimension())
+    throw_dimension_incompatible("add_congruences(cgs)", "cgs", cgs);
+
+  if (!marked_empty()) {
+    Congruence_System cgs_copy = cgs;
+    add_recycled_congruences(cgs_copy);
+  }
+}
+
+inline void
+Grid::refine_with_congruence(const Congruence& cg) {
+  add_congruence(cg);
+}
+
+inline void
+Grid::refine_with_congruences(const Congruence_System& cgs) {
+  add_congruences(cgs);
+}
+
+inline bool
+Grid::can_recycle_constraint_systems() {
+  return true;
+}
+
+inline bool
+Grid::can_recycle_congruence_systems() {
+  return true;
+}
+
+inline void
+Grid::add_constraint(const Constraint& c) {
+  // Space dimension compatibility check.
+  if (space_dim < c.space_dimension())
+    throw_dimension_incompatible("add_constraint(c)", "c", c);
+  if (!marked_empty())
+    add_constraint_no_check(c);
+}
+
+inline void
+Grid::add_recycled_constraints(Constraint_System& cs) {
+  // TODO: really recycle the constraints.
+  add_constraints(cs);
+}
+
+inline bool
+Grid::bounds_from_above(const Linear_Expression& expr) const {
+  return bounds(expr, "bounds_from_above(e)");
+}
+
+inline bool
+Grid::bounds_from_below(const Linear_Expression& expr) const {
+  return bounds(expr, "bounds_from_below(e)");
+}
+
+inline bool
+Grid::maximize(const Linear_Expression& expr,
+               Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const {
+  return max_min(expr, "maximize(e, ...)", sup_n, sup_d, maximum);
+}
+
+inline bool
+Grid::maximize(const Linear_Expression& expr,
+               Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+               Generator& point) const {
+  return max_min(expr, "maximize(e, ...)", sup_n, sup_d, maximum, &point);
+}
+
+inline bool
+Grid::minimize(const Linear_Expression& expr,
+               Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const {
+  return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum);
+}
+
+inline bool
+Grid::minimize(const Linear_Expression& expr,
+               Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+               Generator& point) const {
+  return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum, &point);
+}
+
+inline void
+Grid::normalize_divisors(Grid_Generator_System& sys) {
+  PPL_DIRTY_TEMP_COEFFICIENT(divisor);
+  divisor = 1;
+  normalize_divisors(sys, divisor);
+}
+
+/*! \relates Grid */
+inline bool
+operator!=(const Grid& x, const Grid& y) {
+  return !(x == y);
+}
+
+inline bool
+Grid::strictly_contains(const Grid& y) const {
+  const Grid& x = *this;
+  return x.contains(y) && !y.contains(x);
+}
+
+inline void
+Grid::topological_closure_assign() {
+}
+
+/*! \relates Grid */
+inline void
+swap(Grid& x, Grid& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Grid_inlines_hh)
diff --git a/src/Grid_nonpublic.cc b/src/Grid_nonpublic.cc
index 9347d7f..69fadd8 100644
--- a/src/Grid_nonpublic.cc
+++ b/src/Grid_nonpublic.cc
@@ -1,7 +1,7 @@
 /* Grid class implementation
    (non-inline private or protected functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,10 +23,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid.defs.hh"
-#include "Grid_Generator.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
+#include "Grid_defs.hh"
+#include "Grid_Generator_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
 #include "assert.hh"
 #include <string>
 #include <iostream>
@@ -50,7 +50,7 @@ namespace PPL = Parma_Polyhedra_Library;
 
 void
 PPL::Grid::construct(dimension_type num_dimensions,
-		     const Degenerate_Element kind) {
+                     const Degenerate_Element kind) {
   space_dim = num_dimensions;
 
   if (kind == EMPTY) {
@@ -191,7 +191,7 @@ PPL::Grid::quick_equivalence_test(const Grid& y) const {
     if (x.con_sys.num_rows() != y.con_sys.num_rows())
       return Grid::TVB_FALSE;
     //  - the same number of equalities; ...
-    dimension_type x_num_equalities = x.con_sys.num_equalities();
+    const dimension_type x_num_equalities = x.con_sys.num_equalities();
     if (x_num_equalities != y.con_sys.num_equalities())
       return Grid::TVB_FALSE;
     //  - and if there are no equalities, the same congruences.
@@ -212,9 +212,9 @@ PPL::Grid::quick_equivalence_test(const Grid& y) const {
     if (x_num_lines == 0) {
       // Check for syntactic identity.
       if (x.gen_sys == y.gen_sys)
-	return Grid::TVB_TRUE;
+        return Grid::TVB_TRUE;
       else
-	return Grid::TVB_FALSE;
+        return Grid::TVB_FALSE;
     }
   }
 
@@ -259,7 +259,7 @@ PPL::Grid::is_included_in(const Grid& y) const {
   const Grid_Generator_System& gs = x.gen_sys;
   const Congruence_System& cgs = y.con_sys;
 
-  dimension_type num_rows = gs.num_rows();
+  const dimension_type num_rows = gs.num_rows();
   for (dimension_type i = num_rows; i-- > 0; )
     if (!cgs.satisfies_all_congruences(gs[i]))
       return false;
@@ -270,7 +270,7 @@ PPL::Grid::is_included_in(const Grid& y) const {
 
 bool
 PPL::Grid::bounds(const Linear_Expression& expr,
-		  const char* method_call) const {
+                  const char* method_call) const {
   // The dimension of `expr' must be at most the dimension of *this.
   if (space_dim < expr.space_dimension())
     throw_dimension_incompatible(method_call, "e", expr);
@@ -301,8 +301,8 @@ PPL::Grid::bounds_no_check(const Linear_Expression& expr) const {
     if (g.is_line_or_parameter()) {
       const int sp_sign = Scalar_Products::homogeneous_sign(expr, g);
       if (sp_sign != 0)
-	// `*this' does not bound `expr'.
-	return false;
+        // `*this' does not bound `expr'.
+        return false;
     }
   }
   return true;
@@ -339,7 +339,7 @@ PPL::Grid::frequency_no_check(const Linear_Expression& expr,
 
   // The frequency is the gcd of the scalar products of the parameters
   // in `gen_sys'.
-  dimension_type num_rows = gen_sys.num_rows();
+  const dimension_type num_rows = gen_sys.num_rows();
   PPL_DIRTY_TEMP_COEFFICIENT(sp);
   freq_n = 0;
 
@@ -389,9 +389,9 @@ PPL::Grid::frequency_no_check(const Linear_Expression& expr,
 
 bool
 PPL::Grid::max_min(const Linear_Expression& expr,
-		   const char* method_call,
-		   Coefficient& ext_n, Coefficient& ext_d, bool& included,
-		   Generator* point) const {
+                   const char* method_call,
+                   Coefficient& ext_n, Coefficient& ext_d, bool& included,
+                   Generator* point) const {
   if (bounds(expr, method_call)) {
     if (marked_empty())
       return false;
@@ -400,7 +400,7 @@ PPL::Grid::max_min(const Linear_Expression& expr,
       ext_d = 1;
       included = true;
       if (point != 0)
-	*point = Generator::point();
+        *point = Generator::point();
       return true;
     }
     // Grid::bounds above ensures the generators are up to date.
@@ -422,8 +422,10 @@ PPL::Grid::max_min(const Linear_Expression& expr,
     exact_div_assign(ext_d, ext_d, gcd);
 
     included = true;
-    if (point != 0)
-      *point = Generator::point(Linear_Expression(gen), gen.divisor());
+    if (point != 0) {
+      const Linear_Expression g_expr(gen.expression());
+      *point = Generator::point(g_expr, gen.divisor());
+    }
     return true;
   }
   return false;
@@ -524,25 +526,25 @@ PPL::Grid::minimize() const {
       Grid& gr = const_cast<Grid&>(*this);
       // Only one of the systems can be minimized here.
       if (congruences_are_minimized()) {
-	// Minimize the generator system.
-	gr.simplify(gr.gen_sys, gr.dim_kinds);
-	gr.set_generators_minimized();
+        // Minimize the generator system.
+        gr.simplify(gr.gen_sys, gr.dim_kinds);
+        gr.set_generators_minimized();
       }
       else {
 #ifndef NDEBUG
-	// Both systems are up to date, and the empty case is handled
-	// above, so the grid should contain points.
-	bool empty = simplify(gr.con_sys, gr.dim_kinds);
-	PPL_ASSERT(!empty);
+        // Both systems are up to date, and the empty case is handled
+        // above, so the grid should contain points.
+        bool empty = simplify(gr.con_sys, gr.dim_kinds);
+        PPL_ASSERT(!empty);
 #else
-	simplify(gr.con_sys, gr.dim_kinds);
+        simplify(gr.con_sys, gr.dim_kinds);
 #endif
-	gr.set_congruences_minimized();
-	if (!generators_are_minimized()) {
-	  // Minimize the generator system.
-	  gr.simplify(gr.gen_sys, gr.dim_kinds);
-	  gr.set_generators_minimized();
-	}
+        gr.set_congruences_minimized();
+        if (!generators_are_minimized()) {
+          // Minimize the generator system.
+          gr.simplify(gr.gen_sys, gr.dim_kinds);
+          gr.set_generators_minimized();
+        }
       }
     }
     else {
@@ -562,7 +564,7 @@ PPL::Grid::minimize() const {
 
 void
 PPL::Grid::normalize_divisors(Grid_Generator_System& sys,
-			      Grid_Generator_System& gen_sys) {
+                              Grid_Generator_System& gen_sys) {
 #ifndef NDEBUG
   const dimension_type num_rows = gen_sys.num_rows();
 #endif
@@ -602,11 +604,11 @@ PPL::Grid::normalize_divisors(Grid_Generator_System& sys,
 
 void
 PPL::Grid::normalize_divisors(Grid_Generator_System& sys,
-			      Coefficient& divisor,
-			      const Grid_Generator* first_point) {
+                              Coefficient& divisor,
+                              const Grid_Generator* first_point) {
   PPL_ASSERT(divisor >= 0);
   if (sys.space_dimension() > 0 && divisor > 0) {
-    dimension_type num_rows = sys.num_rows();
+    const dimension_type num_rows = sys.num_rows();
 
     if (first_point != 0)
       lcm_assign(divisor, divisor, (*first_point).divisor());
@@ -615,17 +617,17 @@ PPL::Grid::normalize_divisors(Grid_Generator_System& sys,
       // Move to the first point or parameter.
       dimension_type row = 0;
       while (sys[row].is_line())
-	if (++row == num_rows)
-	  // All rows are lines.
-	  return;
+        if (++row == num_rows)
+          // All rows are lines.
+          return;
 
       // Calculate the LCM of the given divisor and the divisor of
       // every point or parameter.
       while (row < num_rows) {
-	const Grid_Generator& g = sys[row];
-	if (g.is_parameter_or_point())
-	  lcm_assign(divisor, divisor, g.divisor());
-	++row;
+        const Grid_Generator& g = sys[row];
+        if (g.is_parameter_or_point())
+          lcm_assign(divisor, divisor, g.divisor());
+        ++row;
       }
     }
 
@@ -683,7 +685,7 @@ PPL::Grid::add_constraint_no_check(const Constraint& c) {
   }
 
   PPL_ASSERT(c.is_equality());
-  Congruence cg(c);
+  const Congruence cg(c);
   add_congruence_no_check(cg);
 }
 
@@ -693,7 +695,7 @@ PPL::Grid::refine_no_check(const Constraint& c) {
   PPL_ASSERT(space_dim >= c.space_dimension());
 
   if (c.is_equality()) {
-    Congruence cg(c);
+    const Congruence cg(c);
     add_congruence_no_check(cg);
   }
   else if (c.is_inconsistent())
@@ -710,8 +712,8 @@ PPL::Grid::throw_invalid_argument(const char* method, const char* reason) {
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* other_name,
-					dimension_type other_dim) const {
+                                        const char* other_name,
+                                        dimension_type other_dim) const {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":\n"
     << "this->space_dimension() == " << space_dimension() << ", "
@@ -721,71 +723,71 @@ PPL::Grid::throw_dimension_incompatible(const char* method,
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* gr_name,
-					const Grid& gr) const {
+                                        const char* gr_name,
+                                        const Grid& gr) const {
   throw_dimension_incompatible(method, gr_name, gr.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* le_name,
-					const Linear_Expression& le) const {
+                                        const char* le_name,
+                                        const Linear_Expression& le) const {
   throw_dimension_incompatible(method, le_name, le.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* cg_name,
-					const Congruence& cg) const {
+                                        const char* cg_name,
+                                        const Congruence& cg) const {
   throw_dimension_incompatible(method, cg_name, cg.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* c_name,
-					const Constraint& c) const {
+                                        const char* c_name,
+                                        const Constraint& c) const {
   throw_dimension_incompatible(method, c_name, c.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* g_name,
-					const Grid_Generator& g) const {
+                                        const char* g_name,
+                                        const Grid_Generator& g) const {
   throw_dimension_incompatible(method, g_name, g.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* g_name,
-					const Generator& g) const {
+                                        const char* g_name,
+                                        const Generator& g) const {
   throw_dimension_incompatible(method, g_name, g.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* cgs_name,
-					const Congruence_System& cgs) const {
+                                        const char* cgs_name,
+                                        const Congruence_System& cgs) const {
   throw_dimension_incompatible(method, cgs_name, cgs.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* cs_name,
-					const Constraint_System& cs) const {
+                                        const char* cs_name,
+                                        const Constraint_System& cs) const {
   throw_dimension_incompatible(method, cs_name, cs.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* gs_name,
-					const Grid_Generator_System& gs) const {
+                                        const char* gs_name,
+                                        const Grid_Generator_System& gs) const {
   throw_dimension_incompatible(method, gs_name, gs.space_dimension());
 }
 
 void
 PPL::Grid::throw_dimension_incompatible(const char* method,
-					const char* var_name,
-					const Variable var) const {
+                                        const char* var_name,
+                                        const Variable var) const {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":" << std::endl
     << "this->space_dimension() == " << space_dimension() << ", "
@@ -796,7 +798,7 @@ PPL::Grid::throw_dimension_incompatible(const char* method,
 void
 PPL::Grid::
 throw_dimension_incompatible(const char* method,
-			     dimension_type required_space_dim) const {
+                             dimension_type required_space_dim) const {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":" << std::endl
     << "this->space_dimension() == " << space_dimension()
@@ -806,7 +808,7 @@ throw_dimension_incompatible(const char* method,
 
 void
 PPL::Grid::throw_invalid_constraint(const char* method,
-				    const char* c_name) {
+                                    const char* c_name) {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":" << std::endl
     << c_name << " is not an equality constraint.";
@@ -815,7 +817,7 @@ PPL::Grid::throw_invalid_constraint(const char* method,
 
 void
 PPL::Grid::throw_invalid_constraints(const char* method,
-				    const char* cs_name) {
+                                    const char* cs_name) {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":" << std::endl
     << "the constraint system " << cs_name
@@ -825,7 +827,7 @@ PPL::Grid::throw_invalid_constraints(const char* method,
 
 void
 PPL::Grid::throw_invalid_generator(const char* method,
-				   const char* g_name) {
+                                   const char* g_name) {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":" << std::endl
     << "*this is an empty grid and "
@@ -835,7 +837,7 @@ PPL::Grid::throw_invalid_generator(const char* method,
 
 void
 PPL::Grid::throw_invalid_generators(const char* method,
-				    const char* gs_name) {
+                                    const char* gs_name) {
   std::ostringstream s;
   s << "PPL::Grid::" << method << ":" << std::endl
     << "*this is an empty grid and" << std::endl
diff --git a/src/Grid_public.cc b/src/Grid_public.cc
index c02c347..d2dcea2 100644
--- a/src/Grid_public.cc
+++ b/src/Grid_public.cc
@@ -1,6 +1,6 @@
 /* Grid class implementation (non-inline public functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,11 +22,11 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid.defs.hh"
-#include "Topology.types.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "Polyhedron.defs.hh"
+#include "Grid_defs.hh"
+#include "Topology_types.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "Polyhedron_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -71,15 +71,15 @@ PPL::Grid::Grid(const Constraint_System& cs)
   if (space_dim == 0) {
     // See if an inconsistent constraint has been passed.
     for (Constraint_System::const_iterator i = cs.begin(),
-         cs_end = cs.end(); i != cs_end; ++i)
+           cs_end = cs.end(); i != cs_end; ++i)
       if (i->is_inconsistent()) {
-	// Inconsistent constraint found: the grid is empty.
-	status.set_empty();
-	// Insert the zero dim false congruence system into `con_sys'.
-	// `gen_sys' is already in empty form.
-	con_sys.insert(Congruence::zero_dim_false());
-	PPL_ASSERT(OK());
-	return;
+        // Inconsistent constraint found: the grid is empty.
+        status.set_empty();
+        // Insert the zero dim false congruence system into `con_sys'.
+        // `gen_sys' is already in empty form.
+        con_sys.insert(Congruence::zero_dim_false());
+        PPL_ASSERT(OK());
+        return;
       }
     set_zero_dim_univ();
     PPL_ASSERT(OK());
@@ -88,7 +88,7 @@ PPL::Grid::Grid(const Constraint_System& cs)
 
   Congruence_System cgs(cs.space_dimension());
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     if (i->is_equality())
       cgs.insert(*i);
     else
@@ -110,15 +110,15 @@ PPL::Grid::Grid(Constraint_System& cs, Recycle_Input)
   if (space_dim == 0) {
     // See if an inconsistent constraint has been passed.
     for (Constraint_System::const_iterator i = cs.begin(),
-         cs_end = cs.end(); i != cs_end; ++i)
+           cs_end = cs.end(); i != cs_end; ++i)
       if (i->is_inconsistent()) {
-	// Inconsistent constraint found: the grid is empty.
-	status.set_empty();
-	// Insert the zero dim false congruence system into `con_sys'.
-	// `gen_sys' is already in empty form.
-	con_sys.insert(Congruence::zero_dim_false());
-	PPL_ASSERT(OK());
-	return;
+        // Inconsistent constraint found: the grid is empty.
+        status.set_empty();
+        // Insert the zero dim false congruence system into `con_sys'.
+        // `gen_sys' is already in empty form.
+        con_sys.insert(Congruence::zero_dim_false());
+        PPL_ASSERT(OK());
+        return;
       }
     set_zero_dim_univ();
     PPL_ASSERT(OK());
@@ -127,7 +127,7 @@ PPL::Grid::Grid(Constraint_System& cs, Recycle_Input)
 
   Congruence_System cgs(space_dim);
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     if (i->is_equality())
       cgs.insert(*i);
     else
@@ -162,7 +162,7 @@ PPL::Grid::Grid(const Polyhedron& ph,
     return;
   }
 
-  bool use_constraints = ph.constraints_are_minimized()
+  const bool use_constraints = ph.constraints_are_minimized()
     || !ph.generators_are_up_to_date();
 
   // Minimize the constraint description if it is needed and
@@ -367,10 +367,10 @@ PPL::Grid::relation_with(const Congruence& cg) const {
       return Poly_Con_Relation::is_disjoint();
     else if (cg.is_equality())
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
     else if (cg.inhomogeneous_term() % cg.modulus() == 0)
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
   }
 
   if (!generators_are_up_to_date() && !update_generators())
@@ -381,8 +381,8 @@ PPL::Grid::relation_with(const Congruence& cg) const {
 
   // Return one of the relations
   // 'strictly_intersects'   a strict subset of the grid points satisfy cg
-  // 'is_included'	     every grid point satisfies cg
-  // 'is_disjoint'	     cg and the grid occupy separate spaces.
+  // 'is_included'           every grid point satisfies cg
+  // 'is_disjoint'           cg and the grid occupy separate spaces.
 
   // There is always a point.
 
@@ -407,14 +407,14 @@ PPL::Grid::relation_with(const Congruence& cg) const {
 
     case Grid_Generator::POINT:
       if (cg.is_proper_congruence())
-	sp %= div;
+        sp %= div;
       if (sp == 0) {
-	// The point satisfies the congruence.
-	if (point_sp == 0)
-	  // Any previous points satisfied the congruence.
-	  known_to_intersect = true;
-	else
-	  return Poly_Con_Relation::strictly_intersects();
+        // The point satisfies the congruence.
+        if (point_sp == 0)
+          // Any previous points satisfied the congruence.
+          known_to_intersect = true;
+        else
+          return Poly_Con_Relation::strictly_intersects();
       }
       else {
         if (point_sp == 0) {
@@ -423,7 +423,7 @@ PPL::Grid::relation_with(const Congruence& cg) const {
           // Assign `sp' to `point_sp' as `sp' is the scalar product
           // of cg and a point g and is non-zero.
           point_sp = sp;
-	}
+        }
         else {
           // A previously considered point p failed to satisfy cg such that
           // `point_sp' = `scalar_prod(p, cg)'
@@ -445,11 +445,11 @@ PPL::Grid::relation_with(const Congruence& cg) const {
 
     case Grid_Generator::PARAMETER:
       if (cg.is_proper_congruence())
-	sp %= (div * g.divisor());
+        sp %= (div * g.divisor());
       if (sp == 0)
-	// Parameter g satisfies the cg so the relation depends
-	// entirely on the other generators.
-	break;
+        // Parameter g satisfies the cg so the relation depends
+        // entirely on the other generators.
+        break;
       if (known_to_intersect)
         // At least one point satisfies cg.  However, the sum of such
         // a point and the parameter g fails to satisfy cg (due to g).
@@ -527,7 +527,7 @@ PPL::Grid::relation_with(const Grid_Generator& g) const {
 
 PPL::Poly_Gen_Relation
 PPL::Grid::relation_with(const Generator& g) const {
-  dimension_type g_space_dim = g.space_dimension();
+  const dimension_type g_space_dim = g.space_dimension();
 
   // Dimension-compatibility check.
   if (space_dim < g_space_dim)
@@ -545,7 +545,7 @@ PPL::Grid::relation_with(const Generator& g) const {
   if (!congruences_are_up_to_date())
     update_congruences();
 
-  Linear_Expression expr(g);
+  const Linear_Expression expr(g.expression());
   Grid_Generator gg(grid_point());
   if (g.is_point() || g.is_closure_point())
     // Points and closure points are converted to grid points.
@@ -568,7 +568,7 @@ PPL::Grid::relation_with(const Constraint& c) const {
     throw_dimension_incompatible("relation_with(c)", "c", c);
 
   if (c.is_equality()) {
-    Congruence cg(c);
+    const Congruence cg(c);
     return relation_with(cg);
   }
 
@@ -580,15 +580,15 @@ PPL::Grid::relation_with(const Constraint& c) const {
   if (space_dim == 0) {
     if (c.is_inconsistent())
       if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
-	// The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
-	// thus, the zero-dimensional point also saturates it.
-	return Poly_Con_Relation::saturates()
-	  && Poly_Con_Relation::is_disjoint();
+        // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
+        // thus, the zero-dimensional point also saturates it.
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_disjoint();
       else
-	return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
     else if (c.inhomogeneous_term() == 0)
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
     else
       // The zero-dimensional point saturates
       // neither the positivity constraint 1 >= 0,
@@ -604,8 +604,8 @@ PPL::Grid::relation_with(const Constraint& c) const {
 
   // Return one of the relations
   // 'strictly_intersects'   a strict subset of the grid points satisfy c
-  // 'is_included'	     every grid point satisfies c
-  // 'is_disjoint'	     c and the grid occupy separate spaces.
+  // 'is_included'           every grid point satisfies c
+  // 'is_disjoint'           c and the grid occupy separate spaces.
 
   // There is always a point.
 
@@ -619,26 +619,26 @@ PPL::Grid::relation_with(const Constraint& c) const {
     switch (g.type()) {
     case Grid_Generator::POINT:
       {
-	if (first_point == 0) {
-	  first_point = &g;
-	  const int sign = Scalar_Products::sign(c, g);
-	  if (sign == 0)
+        if (first_point == 0) {
+          first_point = &g;
+          const int sign = Scalar_Products::sign(c, g);
+          if (sign == 0)
             point_saturates = !c.is_strict_inequality();
-	  else if (sign > 0)
+          else if (sign > 0)
             point_is_included = !c.is_equality();
-	  break;
-	}
-	// Not the first point: convert `g' to be a parameter
-	// and fall through into the parameter case.
-	Grid_Generator& gen = const_cast<Grid_Generator&>(g);
-	const Grid_Generator& point = *first_point;
+          break;
+        }
+        // Not the first point: convert `g' to be a parameter
+        // and fall through into the parameter case.
+        Grid_Generator& gen = const_cast<Grid_Generator&>(g);
+        const Grid_Generator& point = *first_point;
         const Coefficient& p_div = point.divisor();
         const Coefficient& g_div = gen.divisor();
         gen.expr.linear_combine(point.expr, p_div, -g_div,
                                 1, gen.expr.space_dimension());
         gen.expr.set_inhomogeneous_term(g_div * p_div);
         gen.strong_normalize();
-	gen.set_is_parameter();
+        gen.set_is_parameter();
         PPL_ASSERT(gen.OK());
       }
       // Intentionally fall through.
@@ -747,7 +747,7 @@ PPL::Grid::is_bounded() const {
     for (dimension_type row = gen_sys.num_rows(); row-- > 0; ) {
       const Grid_Generator& gen = gen_sys[row];
       if (gen.is_line_or_parameter() || gen != first_point)
-	return false;
+        return false;
     }
   }
   return true;
@@ -823,11 +823,11 @@ PPL::Grid::constrains(const Variable var) const {
       // Count the number of lines (they are linearly independent).
       dimension_type num_lines = 0;
       for (dimension_type i = gen_sys.num_rows(); i-- > 0; )
-	if (gen_sys[i].is_line())
-	  ++num_lines;
+        if (gen_sys[i].is_line())
+          ++num_lines;
 
       if (num_lines == space_dim)
-	return false;
+        return false;
     }
 
     // Scan generators: perhaps we will find line(var).
@@ -882,9 +882,9 @@ PPL::Grid::OK(bool check_not_empty) const {
     if (con_sys.space_dimension() != space_dim) {
 #ifndef NDEBUG
       cerr << "The grid is in a space of dimension " << space_dim
-	   << " while the system of congruences is in a space of dimension "
-	   << con_sys.space_dimension()
-	   << endl;
+           << " while the system of congruences is in a space of dimension "
+           << con_sys.space_dimension()
+           << endl;
 #endif
       goto fail;
     }
@@ -897,10 +897,10 @@ PPL::Grid::OK(bool check_not_empty) const {
   if (space_dim == 0) {
     if (con_sys.has_no_rows())
       if (gen_sys.num_rows() == 1 && gen_sys[0].is_point())
-	return true;
+        return true;
 #ifndef NDEBUG
     cerr << "Zero-dimensional grid should have an empty congruence" << endl
-	 << "system and a generator system of a single point." << endl;
+         << "system and a generator system of a single point." << endl;
 #endif
     goto fail;
   }
@@ -910,8 +910,8 @@ PPL::Grid::OK(bool check_not_empty) const {
   if (!congruences_are_up_to_date() && !generators_are_up_to_date()) {
 #ifndef NDEBUG
     cerr << "Grid not empty, not zero-dimensional" << endl
-	 << "and with neither congruences nor generators up-to-date!"
-	 << endl;
+         << "and with neither congruences nor generators up-to-date!"
+         << endl;
 #endif
     goto fail;
   }
@@ -928,96 +928,96 @@ PPL::Grid::OK(bool check_not_empty) const {
     if (congruences_are_up_to_date())
       if (con_sys.space_dimension() != space_dim) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (con_sys and space_dim)"
-	     << endl;
+        cerr << "Incompatible size! (con_sys and space_dim)"
+             << endl;
 #endif
-	goto fail;
+        goto fail;
       }
 
     if (generators_are_up_to_date()) {
       if (gen_sys.space_dimension() != space_dim) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (gen_sys and space_dim)"
-	     << endl;
+        cerr << "Incompatible size! (gen_sys and space_dim)"
+             << endl;
 #endif
-	goto fail;
+        goto fail;
       }
 
       // A non-empty system of generators describing a grid is valid
       // if and only if it contains a point.
       if (!gen_sys.has_no_rows() && !gen_sys.has_points()) {
 #ifndef NDEBUG
-	cerr << "Non-empty generator system declared up-to-date "
-	     << "has no points!"
-	     << endl;
+        cerr << "Non-empty generator system declared up-to-date "
+             << "has no points!"
+             << endl;
 #endif
-	goto fail;
+        goto fail;
       }
 
       if (generators_are_minimized()) {
-	Grid_Generator_System gs = gen_sys;
+        Grid_Generator_System gs = gen_sys;
 
-	if (dim_kinds.size() != num_columns) {
+        if (dim_kinds.size() != num_columns) {
 #ifndef NDEBUG
-	  cerr << "Size of dim_kinds should equal the number of columns."
-	       << endl;
+          cerr << "Size of dim_kinds should equal the number of columns."
+               << endl;
 #endif
-	  goto fail;
-	}
+          goto fail;
+        }
 
-	if (!upper_triangular(gs, dim_kinds)) {
+        if (!upper_triangular(gs, dim_kinds)) {
 #ifndef NDEBUG
-	  cerr << "Reduced generators should be upper triangular."
-	       << endl;
+          cerr << "Reduced generators should be upper triangular."
+               << endl;
 #endif
-	  goto fail;
-	}
-
-	// Check that dim_kinds corresponds to the row kinds in gen_sys.
-	for (dimension_type dim = space_dim,
-	       row = gen_sys.num_rows(); dim > 0; --dim) {
-	  if (dim_kinds[dim] == GEN_VIRTUAL)
-	    goto ok;
-	  if (gen_sys[--row].is_parameter_or_point()
-	      && dim_kinds[dim] == PARAMETER)
-	    goto ok;
-	  PPL_ASSERT(gen_sys[row].is_line());
-	  if (dim_kinds[dim] == LINE)
-	    goto ok;
+          goto fail;
+        }
+
+        // Check that dim_kinds corresponds to the row kinds in gen_sys.
+        for (dimension_type dim = space_dim,
+               row = gen_sys.num_rows(); dim > 0; --dim) {
+          if (dim_kinds[dim] == GEN_VIRTUAL)
+            goto ok;
+          if (gen_sys[--row].is_parameter_or_point()
+              && dim_kinds[dim] == PARAMETER)
+            goto ok;
+          PPL_ASSERT(gen_sys[row].is_line());
+          if (dim_kinds[dim] == LINE)
+            goto ok;
 #ifndef NDEBUG
-	  cerr << "Kinds in dim_kinds should match those in gen_sys."
-	       << endl;
+          cerr << "Kinds in dim_kinds should match those in gen_sys."
+               << endl;
 #endif
-	  goto fail;
-	ok:
-	  PPL_ASSERT(row <= dim);
-	}
-
-	// A reduced generator system must be the same as a temporary
-	// reduced copy.
-	Dimension_Kinds dim_kinds_copy = dim_kinds;
-	// `gs' is minimized and marked_empty returned false, so `gs'
-	// should contain rows.
-	PPL_ASSERT(!gs.has_no_rows());
-	simplify(gs, dim_kinds_copy);
-	// gs contained rows before being reduced, so it should
-	// contain at least a single point afterward.
-	PPL_ASSERT(!gs.has_no_rows());
-	for (dimension_type row = gen_sys.num_rows(); row-- > 0; ) {
-	  const Grid_Generator& g = gs[row];
-	  const Grid_Generator& g_copy = gen_sys[row];
-	  if (g.is_equal_to(g_copy))
-	    continue;
+          goto fail;
+        ok:
+          PPL_ASSERT(row <= dim);
+        }
+
+        // A reduced generator system must be the same as a temporary
+        // reduced copy.
+        Dimension_Kinds dim_kinds_copy = dim_kinds;
+        // `gs' is minimized and marked_empty returned false, so `gs'
+        // should contain rows.
+        PPL_ASSERT(!gs.has_no_rows());
+        simplify(gs, dim_kinds_copy);
+        // gs contained rows before being reduced, so it should
+        // contain at least a single point afterward.
+        PPL_ASSERT(!gs.has_no_rows());
+        for (dimension_type row = gen_sys.num_rows(); row-- > 0; ) {
+          const Grid_Generator& g = gs[row];
+          const Grid_Generator& g_copy = gen_sys[row];
+          if (g.is_equal_to(g_copy))
+            continue;
 #ifndef NDEBUG
-	  cerr << "Generators are declared minimized,"
-	    " but they change under reduction.\n"
-	       << "Here is the generator system:\n";
-	  gen_sys.ascii_dump(cerr);
-	  cerr << "and here is the minimized form of the temporary copy:\n";
-	  gs.ascii_dump(cerr);
+          cerr << "Generators are declared minimized,"
+            " but they change under reduction.\n"
+               << "Here is the generator system:\n";
+          gen_sys.ascii_dump(cerr);
+          cerr << "and here is the minimized form of the temporary copy:\n";
+          gs.ascii_dump(cerr);
 #endif
-	  goto fail;
-	}
+          goto fail;
+        }
       }
 
     } // if (congruences_are_up_to_date())
@@ -1039,12 +1039,12 @@ PPL::Grid::OK(bool check_not_empty) const {
 
     if (!tmp_gr.update_generators()) {
       if (check_not_empty) {
-	// Want to know the satisfiability of the congruences.
+        // Want to know the satisfiability of the congruences.
 #ifndef NDEBUG
-	cerr << "Unsatisfiable system of congruences!"
-	     << endl;
+        cerr << "Unsatisfiable system of congruences!"
+             << endl;
 #endif
-	goto fail;
+        goto fail;
       }
       // The grid is empty, all checks are done.
       return true;
@@ -1054,9 +1054,9 @@ PPL::Grid::OK(bool check_not_empty) const {
       // A reduced congruence system must be lower triangular.
       if (!lower_triangular(con_sys, dim_kinds)) {
 #ifndef NDEBUG
-	cerr << "Reduced congruences should be lower triangular." << endl;
+        cerr << "Reduced congruences should be lower triangular." << endl;
 #endif
-	goto fail;
+        goto fail;
       }
 
       // If the congruences are minimized, all the elements in the
@@ -1064,38 +1064,38 @@ PPL::Grid::OK(bool check_not_empty) const {
       // minimized system `cs_copy'.
       if (!con_sys.is_equal_to(cs_copy)) {
 #ifndef NDEBUG
-	cerr << "Congruences are declared minimized, but they change under reduction!"
-	     << endl
-	     << "Here is the minimized form of the congruence system:"
-	     << endl;
-	cs_copy.ascii_dump(cerr);
-	cerr << endl;
+        cerr << "Congruences are declared minimized, but they change under reduction!"
+             << endl
+             << "Here is the minimized form of the congruence system:"
+             << endl;
+        cs_copy.ascii_dump(cerr);
+        cerr << endl;
 #endif
-	goto fail;
+        goto fail;
       }
 
       if (dim_kinds.size() != con_sys.space_dimension() + 1 /* inhomogeneous term */) {
 #ifndef NDEBUG
-	cerr << "Size of dim_kinds should equal the number of columns."
-	     << endl;
+        cerr << "Size of dim_kinds should equal the number of columns."
+             << endl;
 #endif
-	goto fail;
+        goto fail;
       }
 
       // Check that dim_kinds corresponds to the row kinds in con_sys.
       for (dimension_type dim = space_dim, row = 0; dim > 0; --dim) {
-	if (dim_kinds[dim] == CON_VIRTUAL)
-	    continue;
-	if (con_sys[row++].is_proper_congruence()
-	    && dim_kinds[dim] == PROPER_CONGRUENCE)
-	  continue;
-	PPL_ASSERT(con_sys[row-1].is_equality());
-	if (dim_kinds[dim] == EQUALITY)
-	  continue;
+        if (dim_kinds[dim] == CON_VIRTUAL)
+            continue;
+        if (con_sys[row++].is_proper_congruence()
+            && dim_kinds[dim] == PROPER_CONGRUENCE)
+          continue;
+        PPL_ASSERT(con_sys[row-1].is_equality());
+        if (dim_kinds[dim] == EQUALITY)
+          continue;
 #ifndef NDEBUG
-	cerr << "Kinds in dim_kinds should match those in con_sys." << endl;
+        cerr << "Kinds in dim_kinds should match those in con_sys." << endl;
 #endif
-	goto fail;
+        goto fail;
       }
     }
   }
@@ -1139,7 +1139,7 @@ PPL::Grid::add_grid_generator(const Grid_Generator& g) {
     // that can be created.
     if (marked_empty()) {
       if (g.is_parameter())
-	throw_invalid_generator("add_grid_generator(g)", "g");
+        throw_invalid_generator("add_grid_generator(g)", "g");
       set_zero_dim_univ();
     }
     PPL_ASSERT(OK());
@@ -1294,7 +1294,7 @@ PPL::Grid::refine_with_constraints(const Constraint_System& cs) {
     throw_dimension_incompatible("refine_with_constraints(cs)", "cs", cs);
 
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
     refine_no_check(*i);
 }
 
@@ -1434,7 +1434,7 @@ PPL::Grid::upper_bound_assign(const Grid& y) {
 
 bool
 PPL::Grid::upper_bound_assign_if_exact(const Grid& y) {
-  Grid& x = *this;
+  const Grid& x = *this;
 
   // Dimension-compatibility check.
   if (x.space_dim != y.space_dim)
@@ -1490,7 +1490,7 @@ PPL::Grid::difference_assign(const Grid& y) {
 
   const Congruence_System& y_cgs = y.congruences();
   for (Congruence_System::const_iterator i = y_cgs.begin(),
-	 y_cgs_end = y_cgs.end(); i != y_cgs_end; ++i) {
+         y_cgs_end = y_cgs.end(); i != y_cgs_end; ++i) {
     const Congruence& cg = *i;
 
     // The 2-complement cg2 of cg = ((e %= 0) / m) is the congruence
@@ -1509,7 +1509,7 @@ PPL::Grid::difference_assign(const Grid& y) {
       continue;
 
     if (cg.is_proper_congruence()) {
-      const Linear_Expression e = Linear_Expression(cg);
+      const Linear_Expression e(cg.expression());
       // Congruence cg is ((e %= 0) / m).
       const Coefficient& m = cg.modulus();
       // If x is included in the grid defined by the congruences cg
@@ -1517,11 +1517,11 @@ PPL::Grid::difference_assign(const Grid& y) {
       // (2e %= 0) / m) then add the 2-complement to the potential
       // result.
       if (x.relation_with((2*e %= 0) / m)
-	  .implies(Poly_Con_Relation::is_included())) {
-	Grid z = x;
-	z.add_congruence_no_check((2*e %= m) / (2*m));
-	new_grid.upper_bound_assign(z);
-	continue;
+          .implies(Poly_Con_Relation::is_included())) {
+        Grid z = x;
+        z.add_congruence_no_check((2*e %= m) / (2*m));
+        new_grid.upper_bound_assign(z);
+        continue;
       }
     }
     return;
@@ -1584,21 +1584,21 @@ PPL::Grid::simplify_using_context_assign(const Grid& y) {
         // Found: we obtain a congruence `c' contradicting the one we
         // found, and assign to `x' the grid `gr' with `c' as
         // the only congruence.
-        const Linear_Expression le(y_con_sys_i);
+        const Linear_Expression le(y_con_sys_i.expression());
         if (y_con_sys_i.is_equality()) {
           gr.refine_no_check(le == 1);
           break;
-	}
+        }
         else {
-	  const Coefficient& y_modulus_i = y_con_sys_i.modulus();
-	  if (y_modulus_i > 1)
-	    gr.refine_no_check(le == 1);
-	  else {
-	    Linear_Expression le2 = le;
+          const Coefficient& y_modulus_i = y_con_sys_i.modulus();
+          if (y_modulus_i > 1)
+            gr.refine_no_check(le == 1);
+          else {
+            Linear_Expression le2 = le;
             le2 *= 2;
-	    gr.refine_no_check(le2 == y_modulus_i);
-	  }
-	  break;
+            gr.refine_no_check(le2 == y_modulus_i);
+          }
+          break;
         }
       }
     }
@@ -1668,59 +1668,59 @@ PPL::Grid::simplify_using_context_assign(const Grid& y) {
 
     for (dimension_type i = 0, j = 0; i < x_cs_num_rows; ++i) {
       if (!redundant_by_y[i]) {
-	const Congruence& c = x_cs[i];
-	const Coefficient& modulus = c.modulus();
-	div = modulus;
+        const Congruence& c = x_cs[i];
+        const Coefficient& modulus = c.modulus();
+        div = modulus;
 
         const Grid_Generator_System& y_gs = y.gen_sys;
-	dimension_type num_ruled_out_generators = 0;
-	for (Grid_Generator_System::const_iterator k = y_gs.begin(),
-	       y_gs_end = y_gs.end(); k != y_gs_end; ++k) {
-	  const Grid_Generator& g = *k;
-	  // If the generator is not to be ruled out,
-	  // it must saturate the congruence.
-	  Scalar_Products::assign(sp, c, g);
-	  // If `c' is a proper congruence the scalar product must be
-	  // reduced modulo a (possibly scaled) modulus.
-	  if (c.is_proper_congruence()) {
-	    // If `g' is a parameter the congruence modulus must be scaled
-	    // up by the divisor of the generator.
-	    if (g.is_parameter())
-	      sp %= (div * g.divisor());
-	    else
-	      if (g.is_point())
-		sp %= div;
-	  }
-	  if (sp == 0)
-	    continue;
-	  ++num_ruled_out_generators;
-	}
-	ruled_out_vec[j].congruence_index = i;
-	ruled_out_vec[j].num_ruled_out = num_ruled_out_generators;
-	++j;
+        dimension_type num_ruled_out_generators = 0;
+        for (Grid_Generator_System::const_iterator k = y_gs.begin(),
+               y_gs_end = y_gs.end(); k != y_gs_end; ++k) {
+          const Grid_Generator& g = *k;
+          // If the generator is not to be ruled out,
+          // it must saturate the congruence.
+          Scalar_Products::assign(sp, c, g);
+          // If `c' is a proper congruence the scalar product must be
+          // reduced modulo a (possibly scaled) modulus.
+          if (c.is_proper_congruence()) {
+            // If `g' is a parameter the congruence modulus must be scaled
+            // up by the divisor of the generator.
+            if (g.is_parameter())
+              sp %= (div * g.divisor());
+            else
+              if (g.is_point())
+                sp %= div;
+          }
+          if (sp == 0)
+            continue;
+          ++num_ruled_out_generators;
+        }
+        ruled_out_vec[j].congruence_index = i;
+        ruled_out_vec[j].num_ruled_out = num_ruled_out_generators;
+        ++j;
       }
     }
     std::sort(ruled_out_vec.begin(), ruled_out_vec.end(),
-	      Ruled_Out_Less_Than());
+              Ruled_Out_Less_Than());
 
-    bool empty_intersection = (!z.minimize());
+    const bool empty_intersection = (!z.minimize());
 
     // Add the congruences in the "ruled out" order to `w'
     // until the result is the intersection.
     for (std::vector<Ruled_Out_Pair>::const_iterator
-	   j = ruled_out_vec.begin(), ruled_out_vec_end = ruled_out_vec.end();
-	 j != ruled_out_vec_end;
-	 ++j) {
+           j = ruled_out_vec.begin(), ruled_out_vec_end = ruled_out_vec.end();
+         j != ruled_out_vec_end;
+         ++j) {
       const Congruence& c = x_cs[j->congruence_index];
       result_cs.insert(c);
       w.add_congruence(c);
       if ((empty_intersection && w.is_empty())
-	  || (!empty_intersection && w.is_included_in(z))) {
-	Grid result_gr(x.space_dim, UNIVERSE);
-	result_gr.add_congruences(result_cs);
-	x.m_swap(result_gr);
-	PPL_ASSERT(x.OK());
-	return !empty_intersection;
+          || (!empty_intersection && w.is_included_in(z))) {
+        Grid result_gr(x.space_dim, UNIVERSE);
+        result_gr.add_congruences(result_cs);
+        x.m_swap(result_gr);
+        PPL_ASSERT(x.OK());
+        return !empty_intersection;
       }
     }
     // Cannot exit from here.
@@ -1737,8 +1737,8 @@ PPL::Grid::simplify_using_context_assign(const Grid& y) {
 
 void
 PPL::Grid::affine_image(const Variable var,
-			const Linear_Expression& expr,
-			Coefficient_traits::const_reference denominator) {
+                        const Linear_Expression& expr,
+                        Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("affine_image(v, e, d)", "d == 0");
@@ -1765,9 +1765,9 @@ PPL::Grid::affine_image(const Variable var,
       // Grid_Generator_System::affine_image() requires the third argument
       // to be a positive Coefficient.
       if (denominator > 0)
-	gen_sys.affine_image(var, expr, denominator);
+        gen_sys.affine_image(var, expr, denominator);
       else
-	gen_sys.affine_image(var, -expr, -denominator);
+        gen_sys.affine_image(var, -expr, -denominator);
       clear_generators_minimized();
       // Strong normalization in gs::affine_image may have modified
       // divisors.
@@ -1779,17 +1779,17 @@ PPL::Grid::affine_image(const Variable var,
       // we exchange the roles of `expr[var_space_dim]' and `denominator'.
       Linear_Expression inverse;
       if (expr_var > 0) {
-	inverse = -expr;
-	inverse.set_coefficient(var, denominator);
-	con_sys.affine_preimage(var, inverse, expr_var);
+        inverse = -expr;
+        inverse.set_coefficient(var, denominator);
+        con_sys.affine_preimage(var, inverse, expr_var);
       }
       else {
-	// The new denominator is negative: we negate everything once
-	// more, as Congruence_System::affine_preimage() requires the
-	// third argument to be positive.
-	inverse = expr;
-	inverse.set_coefficient(var, -denominator);
-	con_sys.affine_preimage(var, inverse, -expr_var);
+        // The new denominator is negative: we negate everything once
+        // more, as Congruence_System::affine_preimage() requires the
+        // third argument to be positive.
+        inverse = expr;
+        inverse.set_coefficient(var, -denominator);
+        con_sys.affine_preimage(var, inverse, -expr_var);
       }
       clear_congruences_minimized();
     }
@@ -1803,9 +1803,9 @@ PPL::Grid::affine_image(const Variable var,
       // Grid_Generator_System::affine_image() requires the third argument
       // to be a positive Coefficient.
       if (denominator > 0)
-	gen_sys.affine_image(var, expr, denominator);
+        gen_sys.affine_image(var, expr, denominator);
       else
-	gen_sys.affine_image(var, -expr, -denominator);
+        gen_sys.affine_image(var, -expr, -denominator);
 
       clear_congruences_up_to_date();
       clear_generators_minimized();
@@ -1820,8 +1820,8 @@ PPL::Grid::affine_image(const Variable var,
 void
 PPL::Grid::
 affine_preimage(const Variable var,
-		const Linear_Expression& expr,
-		Coefficient_traits::const_reference denominator) {
+                const Linear_Expression& expr,
+                Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
@@ -1848,9 +1848,9 @@ affine_preimage(const Variable var,
       // Congruence_System::affine_preimage() requires the third argument
       // to be a positive Coefficient.
       if (denominator > 0)
-	con_sys.affine_preimage(var, expr, denominator);
+        con_sys.affine_preimage(var, expr, denominator);
       else
-	con_sys.affine_preimage(var, -expr, -denominator);
+        con_sys.affine_preimage(var, -expr, -denominator);
       clear_congruences_minimized();
     }
     if (generators_are_up_to_date()) {
@@ -1859,17 +1859,17 @@ affine_preimage(const Variable var,
       // we exchange the roles of `expr[var_space_dim]' and `denominator'.
       Linear_Expression inverse;
       if (expr_var > 0) {
-	inverse = -expr;
-	inverse.set_coefficient(var, denominator);
-	gen_sys.affine_image(var, inverse, expr_var);
+        inverse = -expr;
+        inverse.set_coefficient(var, denominator);
+        gen_sys.affine_image(var, inverse, expr_var);
       }
       else {
-	// The new denominator is negative: we negate everything once
-	// more, as Grid_Generator_System::affine_image() requires the
-	// third argument to be positive.
-	inverse = expr;
+        // The new denominator is negative: we negate everything once
+        // more, as Grid_Generator_System::affine_image() requires the
+        // third argument to be positive.
+        inverse = expr;
         inverse.set_coefficient(var, -denominator);
-	gen_sys.affine_image(var, inverse, -expr_var);
+        gen_sys.affine_image(var, inverse, -expr_var);
       }
       clear_generators_minimized();
     }
@@ -1895,10 +1895,10 @@ affine_preimage(const Variable var,
 void
 PPL::Grid::
 generalized_affine_image(const Variable var,
-			 const Relation_Symbol relsym,
-			 const Linear_Expression& expr,
-			 Coefficient_traits::const_reference denominator,
-			 Coefficient_traits::const_reference modulus) {
+                         const Relation_Symbol relsym,
+                         const Linear_Expression& expr,
+                         Coefficient_traits::const_reference denominator,
+                         Coefficient_traits::const_reference modulus) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("generalized_affine_image(v, r, e, d, m)",
@@ -1910,12 +1910,12 @@ generalized_affine_image(const Variable var,
   const dimension_type expr_space_dim = expr.space_dimension();
   if (space_dim < expr_space_dim)
     throw_dimension_incompatible("generalized_affine_image(v, r, e, d, m)",
-				 "e", expr);
+                                 "e", expr);
   // `var' should be one of the dimensions of the grid.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("generalized_affine_image(v, r, e, d, m)",
-				 "v", var);
+                                 "v", var);
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_image(v, r, e, d, m)",
@@ -1979,26 +1979,26 @@ generalized_affine_image(const Variable var,
 void
 PPL::Grid::
 generalized_affine_preimage(const Variable var,
-			    const Relation_Symbol relsym,
-			    const Linear_Expression& expr,
-			    Coefficient_traits::const_reference denominator,
-			    Coefficient_traits::const_reference modulus) {
+                            const Relation_Symbol relsym,
+                            const Linear_Expression& expr,
+                            Coefficient_traits::const_reference denominator,
+                            Coefficient_traits::const_reference modulus) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("generalized_affine_preimage(v, r, e, d, m)",
-			   "d == 0");
+                           "d == 0");
 
   // The dimension of `expr' should be at most the dimension of
   // `*this'.
   const dimension_type expr_space_dim = expr.space_dimension();
   if (space_dim < expr_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d, m)",
-				 "e", expr);
+                                 "e", expr);
   // `var' should be one of the dimensions of the grid.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d, m)",
-				 "v", var);
+                                 "v", var);
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_preimage(v, r, e, d, m)",
@@ -2040,16 +2040,16 @@ generalized_affine_preimage(const Variable var,
   // computed as the image of its inverse relation.
   const Coefficient& var_coefficient = expr.coefficient(var);
   if (var_space_dim <= expr_space_dim && var_coefficient != 0) {
-    Linear_Expression inverse_expr
+    const Linear_Expression inverse_expr
       = expr - (denominator + var_coefficient) * var;
     PPL_DIRTY_TEMP_COEFFICIENT(inverse_denominator);
     neg_assign(inverse_denominator, var_coefficient);
     if (modulus < 0)
       generalized_affine_image(var, EQUAL, inverse_expr, inverse_denominator,
-			       - modulus);
+                               - modulus);
     else
       generalized_affine_image(var, EQUAL, inverse_expr, inverse_denominator,
-			       modulus);
+                               modulus);
     return;
   }
 
@@ -2076,22 +2076,22 @@ generalized_affine_preimage(const Variable var,
 void
 PPL::Grid::
 generalized_affine_image(const Linear_Expression& lhs,
-			 const Relation_Symbol relsym,
-			 const Linear_Expression& rhs,
-			 Coefficient_traits::const_reference modulus) {
+                         const Relation_Symbol relsym,
+                         const Linear_Expression& rhs,
+                         Coefficient_traits::const_reference modulus) {
   // Dimension-compatibility checks.
   // The dimension of `lhs' should be at most the dimension of
   // `*this'.
   dimension_type lhs_space_dim = lhs.space_dimension();
   if (space_dim < lhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2, m)",
-				 "e1", lhs);
+                                 "e1", lhs);
   // The dimension of `rhs' should be at most the dimension of
   // `*this'.
   const dimension_type rhs_space_dim = rhs.space_dimension();
   if (space_dim < rhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2, m)",
-				 "e2", rhs);
+                                 "e2", rhs);
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_image(e1, r, e2, m)",
@@ -2148,7 +2148,7 @@ generalized_affine_image(const Linear_Expression& lhs,
         i_end = lhs.lower_bound(Variable(lhs_space_dim)); i != i_end; ++i)
     new_lines.insert(grid_line(i.variable()));
 
-  dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
+  const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
   if (lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
     // Some variables in `lhs' also occur in `rhs'.
     // To ease the computation, add an additional dimension.
@@ -2208,19 +2208,19 @@ generalized_affine_image(const Linear_Expression& lhs,
 void
 PPL::Grid::
 generalized_affine_preimage(const Linear_Expression& lhs,
-			    const Relation_Symbol relsym,
-			    const Linear_Expression& rhs,
-			    Coefficient_traits::const_reference modulus) {
+                            const Relation_Symbol relsym,
+                            const Linear_Expression& rhs,
+                            Coefficient_traits::const_reference modulus) {
   // The dimension of `lhs' must be at most the dimension of `*this'.
   dimension_type lhs_space_dim = lhs.space_dimension();
   if (space_dim < lhs_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2, m)",
-				 "lhs", lhs);
+                                 "lhs", lhs);
   // The dimension of `rhs' must be at most the dimension of `*this'.
   const dimension_type rhs_space_dim = rhs.space_dimension();
   if (space_dim < rhs_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2, m)",
-				 "e2", rhs);
+                                 "e2", rhs);
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_preimage(e1, r, e2, m)",
@@ -2277,7 +2277,8 @@ generalized_affine_preimage(const Linear_Expression& lhs,
         i_end = lhs.lower_bound(Variable(lhs_space_dim)); i != i_end; ++i)
       new_lines.insert(grid_line(i.variable()));
 
-  dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
+  const dimension_type num_common_dims
+    = std::min(lhs_space_dim, rhs_space_dim);
   if (lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
     // Some variables in `lhs' also occur in `rhs'.
     // To ease the computation, add an additional dimension.
@@ -2335,9 +2336,9 @@ generalized_affine_preimage(const Linear_Expression& lhs,
 void
 PPL::Grid::
 bounded_affine_image(const Variable var,
-		     const Linear_Expression& lb_expr,
-		     const Linear_Expression& ub_expr,
-		     Coefficient_traits::const_reference denominator) {
+                     const Linear_Expression& lb_expr,
+                     const Linear_Expression& ub_expr,
+                     Coefficient_traits::const_reference denominator) {
 
   // The denominator cannot be zero.
   if (denominator == 0)
@@ -2348,17 +2349,17 @@ bounded_affine_image(const Variable var,
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "v", var);
+                                 "v", var);
   // The dimension of `lb_expr' and `ub_expr' should not be
   // greater than the dimension of `*this'.
   const dimension_type lb_space_dim = lb_expr.space_dimension();
   if (space_dim < lb_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "lb", lb_expr);
+                                 "lb", lb_expr);
   const dimension_type ub_space_dim = ub_expr.space_dimension();
   if (space_dim < ub_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "ub", ub_expr);
+                                 "ub", ub_expr);
 
   // Any image of an empty grid is empty.
   if (marked_empty())
@@ -2367,9 +2368,9 @@ bounded_affine_image(const Variable var,
   // In all other cases, generalized_affine_preimage() must
   // just add a line in the direction of var.
   generalized_affine_image(var,
-			   LESS_OR_EQUAL,
-			   ub_expr,
-			   denominator);
+                           LESS_OR_EQUAL,
+                           ub_expr,
+                           denominator);
 
   PPL_ASSERT(OK());
 }
@@ -2378,9 +2379,9 @@ bounded_affine_image(const Variable var,
 void
 PPL::Grid::
 bounded_affine_preimage(const Variable var,
-			const Linear_Expression& lb_expr,
-			const Linear_Expression& ub_expr,
-			Coefficient_traits::const_reference denominator) {
+                        const Linear_Expression& lb_expr,
+                        const Linear_Expression& ub_expr,
+                        Coefficient_traits::const_reference denominator) {
 
   // The denominator cannot be zero.
   if (denominator == 0)
@@ -2391,17 +2392,17 @@ bounded_affine_preimage(const Variable var,
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "v", var);
+                                 "v", var);
   // The dimension of `lb_expr' and `ub_expr' should not be
   // greater than the dimension of `*this'.
   const dimension_type lb_space_dim = lb_expr.space_dimension();
   if (space_dim < lb_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "lb", lb_expr);
+                                 "lb", lb_expr);
   const dimension_type ub_space_dim = ub_expr.space_dimension();
   if (space_dim < ub_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "ub", ub_expr);
+                                 "ub", ub_expr);
 
   // Any preimage of an empty grid is empty.
   if (marked_empty())
@@ -2410,9 +2411,9 @@ bounded_affine_preimage(const Variable var,
   // In all other cases, generalized_affine_preimage() must
   // just add a line in the direction of var.
   generalized_affine_preimage(var,
-			      LESS_OR_EQUAL,
-			      ub_expr,
-			      denominator);
+                              LESS_OR_EQUAL,
+                              ub_expr,
+                              denominator);
 
   PPL_ASSERT(OK());
 }
@@ -2443,7 +2444,7 @@ PPL::Grid::time_elapse_assign(const Grid& y) {
 
   // At this point both generator systems are up-to-date.
   Grid_Generator_System gs = y.gen_sys;
-  dimension_type gs_num_rows = gs.num_rows();
+  const dimension_type gs_num_rows = gs.num_rows();
 
   normalize_divisors(gs, gen_sys);
 
@@ -2520,7 +2521,7 @@ PPL::operator==(const Grid& x, const Grid& y) {
   default:
     if (x.is_included_in(y)) {
       if (x.marked_empty())
-	return y.is_empty();
+        return y.is_empty();
       return y.is_included_in(x);
     }
     return false;
@@ -2578,8 +2579,8 @@ PPL::Grid::ascii_dump(std::ostream& s) const {
   if ((generators_are_up_to_date() && generators_are_minimized())
       || (congruences_are_up_to_date() && congruences_are_minimized()))
     for (Dimension_Kinds::const_iterator i = dim_kinds.begin();
-	 i != dim_kinds.end();
-	 ++i)
+         i != dim_kinds.end();
+         ++i)
       s << " " << *i;
   s << endl;
 }
@@ -2630,12 +2631,12 @@ PPL::Grid::ascii_load(std::istream& s) {
 
   if (!marked_empty()
       && ((generators_are_up_to_date() && generators_are_minimized())
-	  || (congruences_are_up_to_date() && congruences_are_minimized()))) {
+          || (congruences_are_up_to_date() && congruences_are_minimized()))) {
     dim_kinds.resize(space_dim + 1);
     for (Dimension_Kinds::size_type dim = 0; dim <= space_dim; ++dim) {
       short unsigned int dim_kind;
       if (!(s >> dim_kind))
-	return false;
+        return false;
       switch(dim_kind) {
       case 0: dim_kinds[dim] = PARAMETER; break;
       case 1: dim_kinds[dim] = LINE; break;
diff --git a/src/Grid_simplify.cc b/src/Grid_simplify.cc
index cb72c6e..b52a9e1 100644
--- a/src/Grid_simplify.cc
+++ b/src/Grid_simplify.cc
@@ -1,6 +1,6 @@
 /* Grid class implementation: simplify().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,13 +23,13 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
 #include "assert.hh"
-#include "Grid.defs.hh"
+#include "Grid_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
 void
 Grid::reduce_line_with_line(Grid_Generator& row, Grid_Generator& pivot,
-			    dimension_type column) {
+                            dimension_type column) {
   Coefficient_traits::const_reference pivot_column = pivot.expr.get(column);
   Coefficient_traits::const_reference row_column = row.expr.get(column);
   PPL_ASSERT(pivot_column != 0);
@@ -56,8 +56,8 @@ Grid::reduce_line_with_line(Grid_Generator& row, Grid_Generator& pivot,
 
 void
 Grid::reduce_equality_with_equality(Congruence& row,
-				    const Congruence& pivot,
-				    const dimension_type column) {
+                                    const Congruence& pivot,
+                                    const dimension_type column) {
   // Assume two equalities.
   PPL_ASSERT(row.modulus() == 0 && pivot.modulus() == 0);
 
@@ -86,9 +86,9 @@ Grid::reduce_equality_with_equality(Congruence& row,
 template <typename R>
 void
 Grid::reduce_pc_with_pc(R& row, R& pivot,
-			const dimension_type column,
-			const dimension_type start,
-			const dimension_type end) {
+                        const dimension_type column,
+                        const dimension_type start,
+                        const dimension_type end) {
   PPL_ASSERT(start <= end);
   PPL_ASSERT(start <= column);
   PPL_ASSERT(column < end);
@@ -118,7 +118,7 @@ Grid::reduce_pc_with_pc(R& row, R& pivot,
   // then add to it a (possibly negative) multiple of row such that
   // the result in pivot[column] is the smallest possible positive
   // integer.
-  Linear_Expression old_pivot_e = pivot_e;
+  const Linear_Expression old_pivot_e = pivot_e;
   pivot_e.linear_combine_lax(row_e, s, t, start, end);
   PPL_ASSERT(pivot_e.get(column) == gcd);
   row_e.linear_combine(old_pivot_e, reduced_pivot_col, -reduced_row_col, start, end);
@@ -127,9 +127,9 @@ Grid::reduce_pc_with_pc(R& row, R& pivot,
 
 void
 Grid::reduce_parameter_with_line(Grid_Generator& row,
-				 const Grid_Generator& pivot,
-				 const dimension_type column,
-				 Swapping_Vector<Grid_Generator>& rows,
+                                 const Grid_Generator& pivot,
+                                 const dimension_type column,
+                                 Swapping_Vector<Grid_Generator>& rows,
                                  const dimension_type total_num_columns) {
   // Very similar to reduce_congruence_with_equality below.  Any
   // change here may be needed there too.
@@ -187,9 +187,9 @@ Grid::reduce_parameter_with_line(Grid_Generator& row,
 
 void
 Grid::reduce_congruence_with_equality(Congruence& row,
-				      const Congruence& pivot,
-				      const dimension_type column,
-				      Swapping_Vector<Congruence>& sys) {
+                                      const Congruence& pivot,
+                                      const dimension_type column,
+                                      Swapping_Vector<Congruence>& sys) {
   // Very similar to reduce_parameter_with_line above.  Any change
   // here may be needed there too.
   PPL_ASSERT(row.modulus() > 0 && pivot.modulus() == 0);
@@ -235,7 +235,7 @@ Grid::reduce_congruence_with_equality(Congruence& row,
 template <typename M, typename R>
 bool
 Grid::rows_are_zero(M& system, dimension_type first,
-		    dimension_type last, dimension_type row_size) {
+                    dimension_type last, dimension_type row_size) {
   while (first <= last) {
     const R& row = system[first++];
     if (!row.expr.all_zeroes(0, row_size))
@@ -286,40 +286,40 @@ Grid::simplify(Grid_Generator_System& ggs, Dimension_Kinds& dim_kinds) {
       // Change the matrix so that the value at `dim' in every row
       // following `pivot_index' is 0, leaving an equivalent grid.
       while (row_index < num_rows - 1) {
-	++row_index;
+        ++row_index;
         Grid_Generator& row = ggs.sys.rows[row_index];
 
-	if (row.expr.get(dim) == 0)
-	  continue;
+        if (row.expr.get(dim) == 0)
+          continue;
 
-	if (row.is_line())
-	  if (pivot_is_line)
-	    reduce_line_with_line(row, pivot, dim);
-	  else {
-	    PPL_ASSERT(pivot.is_parameter_or_point());
+        if (row.is_line())
+          if (pivot_is_line)
+            reduce_line_with_line(row, pivot, dim);
+          else {
+            PPL_ASSERT(pivot.is_parameter_or_point());
             using std::swap;
-	    swap(row, pivot);
-	    pivot_is_line = true;
-	    reduce_parameter_with_line(row, pivot, dim, ggs.sys.rows,
+            swap(row, pivot);
+            pivot_is_line = true;
+            reduce_parameter_with_line(row, pivot, dim, ggs.sys.rows,
                                        num_columns + 1);
-	  }
-	else {
-	  PPL_ASSERT(row.is_parameter_or_point());
-	  if (pivot_is_line)
-	    reduce_parameter_with_line(row, pivot, dim, ggs.sys.rows,
+          }
+        else {
+          PPL_ASSERT(row.is_parameter_or_point());
+          if (pivot_is_line)
+            reduce_parameter_with_line(row, pivot, dim, ggs.sys.rows,
                                        num_columns + 1);
-	  else {
-	    PPL_ASSERT(pivot.is_parameter_or_point());
-	    reduce_pc_with_pc(row, pivot, dim, dim, num_columns);
-	  }
-	}
+          else {
+            PPL_ASSERT(pivot.is_parameter_or_point());
+            reduce_pc_with_pc(row, pivot, dim, dim, num_columns);
+          }
+        }
       }
 
       if (pivot_is_line)
-	dim_kinds[dim] = LINE;
+        dim_kinds[dim] = LINE;
       else {
-	PPL_ASSERT(pivot.is_parameter_or_point());
-	dim_kinds[dim] = PARAMETER;
+        PPL_ASSERT(pivot.is_parameter_or_point());
+        dim_kinds[dim] = PARAMETER;
       }
 
       // Since we are reducing the system to "strong minimal form",
@@ -329,7 +329,7 @@ Grid::simplify(Grid_Generator_System& ggs, Dimension_Kinds& dim_kinds) {
 
       // Factor this row out of the preceding rows.
       reduce_reduced<Grid_Generator_System>
-	(ggs.sys.rows, dim, pivot_index, dim, num_columns - 1, dim_kinds);
+        (ggs.sys.rows, dim, pivot_index, dim, num_columns - 1, dim_kinds);
 
       ++pivot_index;
     }
@@ -411,7 +411,7 @@ Grid::simplify(Congruence_System& cgs, Dimension_Kinds& dim_kinds) {
       // Here row_index != num_rows.
       if (row_index != pivot_index) {
         using std::swap;
-	swap(cgs.rows[row_index], cgs.rows[pivot_index]);
+        swap(cgs.rows[row_index], cgs.rows[pivot_index]);
       }
 
       Congruence& pivot = cgs.rows[pivot_index];
@@ -420,54 +420,54 @@ Grid::simplify(Congruence_System& cgs, Dimension_Kinds& dim_kinds) {
       // Change the matrix so that the value at `dim' in every row
       // following `pivot_index' is 0, leaving an equivalent grid.
       while (row_index < num_rows - 1) {
-	++row_index;
-	Congruence& row = cgs.rows[row_index];
-	if (row.expr.get(dim) == 0)
-	  continue;
-
-	if (row.is_equality()) {
-	  if (pivot_is_equality)
-	    reduce_equality_with_equality(row, pivot, dim);
-	  else {
-	    PPL_ASSERT(pivot.is_proper_congruence());
+        ++row_index;
+        Congruence& row = cgs.rows[row_index];
+        if (row.expr.get(dim) == 0)
+          continue;
+
+        if (row.is_equality()) {
+          if (pivot_is_equality)
+            reduce_equality_with_equality(row, pivot, dim);
+          else {
+            PPL_ASSERT(pivot.is_proper_congruence());
             using std::swap;
-	    swap(row, pivot);
-	    pivot_is_equality = true;
-	    reduce_congruence_with_equality(row, pivot, dim, cgs.rows);
-	  }
+            swap(row, pivot);
+            pivot_is_equality = true;
+            reduce_congruence_with_equality(row, pivot, dim, cgs.rows);
+          }
+        }
+        else {
+          PPL_ASSERT(row.is_proper_congruence());
+          if (pivot_is_equality)
+            reduce_congruence_with_equality(row, pivot, dim, cgs.rows);
+          else {
+            PPL_ASSERT(pivot.is_proper_congruence());
+            reduce_pc_with_pc(row, pivot, dim, 0, dim + 1);
+          }
         }
-	else {
-	  PPL_ASSERT(row.is_proper_congruence());
-	  if (pivot_is_equality)
-	    reduce_congruence_with_equality(row, pivot, dim, cgs.rows);
-	  else {
-	    PPL_ASSERT(pivot.is_proper_congruence());
-	    reduce_pc_with_pc(row, pivot, dim, 0, dim + 1);
-	  }
-	}
       }
 
       if (pivot_is_equality)
-	dim_kinds[dim] = EQUALITY;
+        dim_kinds[dim] = EQUALITY;
       else {
-	PPL_ASSERT(pivot.is_proper_congruence());
-	dim_kinds[dim] = PROPER_CONGRUENCE;
+        PPL_ASSERT(pivot.is_proper_congruence());
+        dim_kinds[dim] = PROPER_CONGRUENCE;
       }
 
       // Since we are reducing the system to "strong minimal form",
       // ensure that a positive value follows the leading zeros.
       if (pivot.expr.get(dim) < 0)
-	pivot.expr.negate(0, dim + 1);
+        pivot.expr.negate(0, dim + 1);
 
       // Factor this row out of the preceding ones.
       reduce_reduced<Congruence_System>
-	(cgs.rows, dim, pivot_index, 0, dim, dim_kinds, false);
+        (cgs.rows, dim, pivot_index, 0, dim, dim_kinds, false);
 
       PPL_ASSERT(cgs.OK());
 
       ++pivot_index;
     }
-  } // end for (dimension_type dim = num_columns; dim-- > 0; )
+  }
 
   if (pivot_index > 0) {
     // If the last row is false then make it the equality 1 = 0, and
@@ -565,8 +565,8 @@ Grid::simplify(Congruence_System& cgs, Dimension_Kinds& dim_kinds) {
     while (row_index-- > 0) {
       const Congruence& row = cgs[row_index];
       if (row.modulus() > 0) {
-	new_last_row.set_modulus(row.modulus());
-	break;
+        new_last_row.set_modulus(row.modulus());
+        break;
       }
     }
     new_last_row.expr.set_inhomogeneous_term(new_last_row.modulus());
diff --git a/src/Grid_templates.hh b/src/Grid_templates.hh
new file mode 100644
index 0000000..a4223f1
--- /dev/null
+++ b/src/Grid_templates.hh
@@ -0,0 +1,339 @@
+/* Grid class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Grid_templates_hh
+#define PPL_Grid_templates_hh 1
+
+#include "Grid_Generator_defs.hh"
+#include "Grid_Generator_System_defs.hh"
+#include "Grid_Generator_System_inlines.hh"
+#include <algorithm>
+#include <deque>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Interval>
+Grid::Grid(const Box<Interval>& box, Complexity_Class)
+  : con_sys(),
+    gen_sys() {
+  space_dim = check_space_dimension_overflow(box.space_dimension(),
+                                             max_space_dimension(),
+                                             "PPL::Grid::",
+                                             "Grid(box, from_bounding_box)",
+                                             "the space dimension of box "
+                                             "exceeds the maximum allowed "
+                                             "space dimension");
+
+  if (box.is_empty()) {
+    // Empty grid.
+    set_empty();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (space_dim == 0)
+    set_zero_dim_univ();
+  else {
+    // Initialize the space dimension as indicated by the box.
+    con_sys.set_space_dimension(space_dim);
+    gen_sys.set_space_dimension(space_dim);
+    // Add congruences and generators according to `box'.
+    PPL_DIRTY_TEMP_COEFFICIENT(l_n);
+    PPL_DIRTY_TEMP_COEFFICIENT(l_d);
+    PPL_DIRTY_TEMP_COEFFICIENT(u_n);
+    PPL_DIRTY_TEMP_COEFFICIENT(u_d);
+    gen_sys.insert(grid_point());
+    for (dimension_type k = space_dim; k-- > 0; ) {
+      const Variable v_k = Variable(k);
+      bool closed = false;
+      // TODO: Consider producing the system(s) in minimized form.
+      if (box.has_lower_bound(v_k, l_n, l_d, closed)) {
+        if (box.has_upper_bound(v_k, u_n, u_d, closed))
+          if (l_n * u_d == u_n * l_d) {
+            // A point interval sets dimension k of every point to a
+            // single value.
+            con_sys.insert(l_d * v_k == l_n);
+
+            // This is declared here because it may be invalidated
+            // by the call to gen_sys.insert() at the end of the loop.
+            Grid_Generator& point = gen_sys.sys.rows[0];
+
+            // Scale the point to use as divisor the lcm of the
+            // divisors of the existing point and the lower bound.
+            const Coefficient& point_divisor = point.divisor();
+            gcd_assign(u_n, l_d, point_divisor);
+            // `u_n' now holds the gcd.
+            exact_div_assign(u_n, point_divisor, u_n);
+            if (l_d < 0)
+              neg_assign(u_n);
+            // l_d * u_n == abs(l_d * (point_divisor / gcd(l_d, point_divisor)))
+            point.scale_to_divisor(l_d * u_n);
+            // Set dimension k of the point to the lower bound.
+            if (l_d < 0)
+              neg_assign(u_n);
+            // point[k + 1] = l_n * point_divisor / gcd(l_d, point_divisor)
+            point.expr.set(Variable(k), l_n * u_n);
+            PPL_ASSERT(point.OK());
+
+            PPL_ASSERT(gen_sys.sys.OK());
+
+            continue;
+          }
+      }
+      // A universe interval allows any value in dimension k.
+      gen_sys.insert(grid_line(v_k));
+    }
+    set_congruences_up_to_date();
+    set_generators_up_to_date();
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Partial_Function>
+void
+Grid::map_space_dimensions(const Partial_Function& pfunc) {
+  if (space_dim == 0)
+    return;
+
+  if (pfunc.has_empty_codomain()) {
+    // All dimensions vanish: the grid becomes zero_dimensional.
+    if (marked_empty()
+        || (!generators_are_up_to_date() && !update_generators())) {
+      // Removing all dimensions from the empty grid.
+      space_dim = 0;
+      set_empty();
+    }
+    else
+      // Removing all dimensions from a non-empty grid.
+      set_zero_dim_univ();
+
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  dimension_type new_space_dimension = pfunc.max_in_codomain() + 1;
+
+  if (new_space_dimension == space_dim) {
+    // The partial function `pfunc' is indeed total and thus specifies
+    // a permutation, that is, a renaming of the dimensions.  For
+    // maximum efficiency, we will simply permute the columns of the
+    // constraint system and/or the generator system.
+
+    std::vector<Variable> cycle;
+    cycle.reserve(space_dim);
+
+    // Used to mark elements as soon as they are inserted in a cycle.
+    std::deque<bool> visited(space_dim);
+
+    for (dimension_type i = space_dim; i-- > 0; ) {
+      if (!visited[i]) {
+        dimension_type j = i;
+        do {
+          visited[j] = true;
+          // The following initialization is only to make the compiler happy.
+          dimension_type k = 0;
+          if (!pfunc.maps(j, k))
+            throw_invalid_argument("map_space_dimensions(pfunc)",
+                                   " pfunc is inconsistent");
+          if (k == j)
+            break;
+
+          cycle.push_back(Variable(j));
+          // Go along the cycle.
+          j = k;
+        } while (!visited[j]);
+
+        // End of cycle.
+
+        // Avoid calling clear_*_minimized() if cycle.size() is less than 2,
+        // to improve efficiency.
+        if (cycle.size() >= 2) {
+          // Permute all that is up-to-date.
+          if (congruences_are_up_to_date()) {
+            con_sys.permute_space_dimensions(cycle);
+            clear_congruences_minimized();
+          }
+
+          if (generators_are_up_to_date()) {
+            gen_sys.permute_space_dimensions(cycle);
+            clear_generators_minimized();
+          }
+        }
+
+        cycle.clear();
+      }
+    }
+
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // If control gets here, then `pfunc' is not a permutation and some
+  // dimensions must be projected away.
+
+  const Grid_Generator_System& old_gensys = grid_generators();
+
+  if (old_gensys.has_no_rows()) {
+    // The grid is empty.
+    Grid new_grid(new_space_dimension, EMPTY);
+    m_swap(new_grid);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Make a local copy of the partial function.
+  std::vector<dimension_type> pfunc_maps(space_dim, not_a_dimension());
+  for (dimension_type j = space_dim; j-- > 0; ) {
+    dimension_type pfunc_j;
+    if (pfunc.maps(j, pfunc_j))
+      pfunc_maps[j] = pfunc_j;
+  }
+
+  Grid_Generator_System new_gensys;
+  // Set sortedness, for the assertion met via gs::insert.
+  new_gensys.set_sorted(false);
+  // Get the divisor of the first point.
+  Grid_Generator_System::const_iterator i;
+  Grid_Generator_System::const_iterator old_gensys_end = old_gensys.end();
+  for (i = old_gensys.begin(); i != old_gensys_end; ++i)
+    if (i->is_point())
+      break;
+  PPL_ASSERT(i != old_gensys_end);
+  const Coefficient& system_divisor = i->divisor();
+  for (i = old_gensys.begin(); i != old_gensys_end; ++i) {
+    const Grid_Generator& old_g = *i;
+    const Grid_Generator::expr_type old_g_e = old_g.expression();
+    Linear_Expression expr;
+    expr.set_space_dimension(new_space_dimension);
+    bool all_zeroes = true;
+    for (Grid_Generator::expr_type::const_iterator j = old_g_e.begin(),
+          j_end = old_g_e.end(); j != j_end; ++j) {
+      const dimension_type mapped_id = pfunc_maps[j.variable().id()];
+      if (mapped_id != not_a_dimension()) {
+        add_mul_assign(expr, *j, Variable(mapped_id));
+        all_zeroes = false;
+      }
+    }
+    switch (old_g.type()) {
+    case Grid_Generator::LINE:
+      if (!all_zeroes)
+        new_gensys.insert(grid_line(expr));
+      break;
+    case Grid_Generator::PARAMETER:
+      if (!all_zeroes)
+        new_gensys.insert(parameter(expr, system_divisor));
+      break;
+    case Grid_Generator::POINT:
+      new_gensys.insert(grid_point(expr, old_g.divisor()));
+      break;
+    }
+  }
+
+  Grid new_grid(new_gensys);
+  m_swap(new_grid);
+
+  PPL_ASSERT(OK(true));
+}
+
+// Needed for converting the congruence or grid_generator system
+// to "strong minimal form".
+template <typename M>
+void
+Grid::reduce_reduced(Swapping_Vector<typename M::row_type>& rows,
+                     const dimension_type dim,
+                     const dimension_type pivot_index,
+                     const dimension_type start,
+                     const dimension_type end,
+                     const Dimension_Kinds& sys_dim_kinds,
+                     const bool generators) {
+  // TODO: Remove this.
+  typedef typename M::row_type M_row_type;
+
+  const M_row_type& pivot = rows[pivot_index];
+  const Coefficient& pivot_dim = pivot.expr.get(dim);
+
+  if (pivot_dim == 0)
+    return;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(pivot_dim_half);
+  pivot_dim_half = (pivot_dim + 1) / 2;
+  const Dimension_Kind row_kind = sys_dim_kinds[dim];
+  const bool row_is_line_or_equality
+    = (row_kind == (generators ? LINE : EQUALITY));
+
+  PPL_DIRTY_TEMP_COEFFICIENT(num_rows_to_subtract);
+  PPL_DIRTY_TEMP_COEFFICIENT(row_dim_remainder);
+  for (dimension_type kinds_index = dim,
+         row_index = pivot_index; row_index-- > 0; ) {
+    if (generators) {
+      --kinds_index;
+      // Move over any virtual rows.
+      while (sys_dim_kinds[kinds_index] == GEN_VIRTUAL)
+        --kinds_index;
+    }
+    else {
+      ++kinds_index;
+      // Move over any virtual rows.
+      while (sys_dim_kinds[kinds_index] == CON_VIRTUAL)
+        ++kinds_index;
+    }
+
+    // row_kind CONGRUENCE is included as PARAMETER
+    if (row_is_line_or_equality
+        || (row_kind == PARAMETER
+            && sys_dim_kinds[kinds_index] == PARAMETER)) {
+      M_row_type& row = rows[row_index];
+
+      const Coefficient& row_dim = row.expr.get(dim);
+      // num_rows_to_subtract may be positive or negative.
+      num_rows_to_subtract = row_dim / pivot_dim;
+
+      // Ensure that after subtracting num_rows_to_subtract * r_dim
+      // from row_dim, -pivot_dim_half < row_dim <= pivot_dim_half.
+      // E.g., if pivot[dim] = 9, then after this reduction
+      // -5 < row_dim <= 5.
+      row_dim_remainder = row_dim % pivot_dim;
+      if (row_dim_remainder < 0) {
+        if (row_dim_remainder <= -pivot_dim_half)
+          --num_rows_to_subtract;
+      }
+      else if (row_dim_remainder > 0 && row_dim_remainder > pivot_dim_half)
+        ++num_rows_to_subtract;
+
+      // Subtract num_rows_to_subtract copies of pivot from row i.  Only the
+      // entries from dim need to be subtracted, as the preceding
+      // entries are all zero.
+      // If num_rows_to_subtract is negative, these copies of pivot are
+      // added to row i.
+      if (num_rows_to_subtract != 0)
+        row.expr.linear_combine(pivot.expr,
+                                Coefficient_one(), -num_rows_to_subtract,
+                                start, end + 1);
+    }
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Grid_templates_hh)
diff --git a/src/Grid_types.hh b/src/Grid_types.hh
new file mode 100644
index 0000000..060d7f6
--- /dev/null
+++ b/src/Grid_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Grid_types_hh
+#define PPL_Grid_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Grid;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Grid_types_hh)
diff --git a/src/Grid_widenings.cc b/src/Grid_widenings.cc
index 08afc2b..972f127 100644
--- a/src/Grid_widenings.cc
+++ b/src/Grid_widenings.cc
@@ -1,7 +1,7 @@
 /* Grid class implementation
    (non-inline widening-related member functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,7 +23,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Grid.defs.hh"
+#include "Grid_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -31,7 +31,7 @@ namespace PPL = Parma_Polyhedra_Library;
 
 void
 PPL::Grid::select_wider_congruences(const Grid& y,
-				    Congruence_System& selected_cgs) const {
+                                    Congruence_System& selected_cgs) const {
   // Private method: the caller must ensure the following conditions
   // (beside the inclusion `y <= x').
   PPL_ASSERT(space_dim == y.space_dim);
@@ -45,17 +45,17 @@ PPL::Grid::select_wider_congruences(const Grid& y,
   for (dimension_type dim = con_sys.space_dimension(), x_row = 0, y_row = 0;
        dim > 0; --dim) {
     PPL_ASSERT(dim_kinds[dim] == CON_VIRTUAL
-	   || dim_kinds[dim] == y.dim_kinds[dim]);
+           || dim_kinds[dim] == y.dim_kinds[dim]);
     switch (dim_kinds[dim]) {
     case PROPER_CONGRUENCE:
       {
-	const Congruence& cg = con_sys[x_row];
-	const Congruence& y_cg = y.con_sys[y_row];
-	if (cg.is_equal_at_dimension(Variable(dim - 1), y_cg))
-	  // The leading diagonal entries are equal.
-	  selected_cgs.insert(cg);
-	++x_row;
-	++y_row;
+        const Congruence& cg = con_sys[x_row];
+        const Congruence& y_cg = y.con_sys[y_row];
+        if (cg.is_equal_at_dimension(Variable(dim - 1), y_cg))
+          // The leading diagonal entries are equal.
+          selected_cgs.insert(cg);
+        ++x_row;
+        ++y_row;
       }
       break;
     case EQUALITY:
@@ -89,9 +89,9 @@ PPL::Grid::congruence_widening_assign(const Grid& y, unsigned* tp) {
   if (x.congruences_are_up_to_date()) {
     if (!x.congruences_are_minimized()) {
       if (simplify(x.con_sys, x.dim_kinds)) {
-	// `x' is empty.
-	x.set_empty();
-	return;
+        // `x' is empty.
+        x.set_empty();
+        return;
       }
       x.set_congruences_minimized();
     }
@@ -104,9 +104,9 @@ PPL::Grid::congruence_widening_assign(const Grid& y, unsigned* tp) {
   if (yy.congruences_are_up_to_date()) {
     if (!yy.congruences_are_minimized()) {
       if (simplify(yy.con_sys, yy.dim_kinds)) {
-	// `y' is empty.
-	yy.set_empty();
-	return;
+        // `y' is empty.
+        yy.set_empty();
+        return;
       }
       yy.set_congruences_minimized();
     }
@@ -149,19 +149,19 @@ PPL::Grid::congruence_widening_assign(const Grid& y, unsigned* tp) {
 
 void
 PPL::Grid::limited_congruence_extrapolation_assign(const Grid& y,
-						   const Congruence_System& cgs,
-						   unsigned* tp) {
+                                                   const Congruence_System& cgs,
+                                                   unsigned* tp) {
   Grid& x = *this;
 
   // Check dimension compatibility.
   if (x.space_dim != y.space_dim)
     throw_dimension_incompatible("limited_extrapolation_assign(y, cgs)",
-				 "y", y);
+                                 "y", y);
   // `cgs' must be dimension-compatible with the two grids.
   const dimension_type cgs_space_dim = cgs.space_dimension();
   if (x.space_dim < cgs_space_dim)
     throw_dimension_incompatible("limited_extrapolation_assign(y, cgs)",
-				 "cgs", cgs);
+                                 "cgs", cgs);
 
   const dimension_type cgs_num_rows = cgs.num_rows();
   // If `cgs' is empty (of rows), fall back to ordinary widening.
@@ -199,7 +199,7 @@ PPL::Grid::limited_congruence_extrapolation_assign(const Grid& y,
     for (dimension_type i = 0; i < cgs_num_rows; ++i) {
       const Congruence& cg = cgs[i];
       if (x.relation_with(cg) == Poly_Con_Relation::is_included())
-	new_cgs.insert(cg);
+        new_cgs.insert(cg);
     }
     x.congruence_widening_assign(y, tp);
     x.add_recycled_congruences(new_cgs);
@@ -213,7 +213,7 @@ PPL::Grid::limited_congruence_extrapolation_assign(const Grid& y,
 
 void
 PPL::Grid::select_wider_generators(const Grid& y,
-				   Grid_Generator_System& widened_ggs) const {
+                                   Grid_Generator_System& widened_ggs) const {
   // Private method: the caller must ensure the following conditions
   // (beside the inclusion `y <= x').
   PPL_ASSERT(space_dim == y.space_dim);
@@ -228,19 +228,22 @@ PPL::Grid::select_wider_generators(const Grid& y,
        dim <= gen_sys.space_dimension(); ++dim) {
     PPL_ASSERT(dim_kinds[dim] == LINE
            || y.dim_kinds[dim] == GEN_VIRTUAL
-	   || dim_kinds[dim] == y.dim_kinds[dim]);
+           || dim_kinds[dim] == y.dim_kinds[dim]);
     switch (dim_kinds[dim]) {
     case PARAMETER:
       {
-	const Grid_Generator& gg = gen_sys[x_row];
-	const Grid_Generator& y_gg = y.gen_sys[y_row];
-	if (gg.is_equal_at_dimension(dim, y_gg))
-	  // The leading diagonal entry is equal.
-	  widened_ggs.insert(gg);
-        else
-          widened_ggs.insert(grid_line(Linear_Expression(gg)));
-	++x_row;
-	++y_row;
+        const Grid_Generator& gg = gen_sys[x_row];
+        const Grid_Generator& y_gg = y.gen_sys[y_row];
+        if (gg.is_equal_at_dimension(dim, y_gg))
+          // The leading diagonal entry is equal.
+          widened_ggs.insert(gg);
+        else {
+          const Linear_Expression expr(gg.expression());
+          Grid_Generator line = grid_line(expr);
+          widened_ggs.insert(line, Recycle_Input());
+        }
+        ++x_row;
+        ++y_row;
       }
       break;
     case LINE:
@@ -335,19 +338,19 @@ PPL::Grid::generator_widening_assign(const Grid& y, unsigned* tp) {
 
 void
 PPL::Grid::limited_generator_extrapolation_assign(const Grid& y,
-						  const Congruence_System& cgs,
-						  unsigned* tp) {
+                                                  const Congruence_System& cgs,
+                                                  unsigned* tp) {
   Grid& x = *this;
 
   // Check dimension compatibility.
   if (x.space_dim != y.space_dim)
     throw_dimension_incompatible("limited_extrapolation_assign(y, cgs)",
-				 "y", y);
+                                 "y", y);
   // `cgs' must be dimension-compatible with the two grids.
   const dimension_type cgs_space_dim = cgs.space_dimension();
   if (x.space_dim < cgs_space_dim)
     throw_dimension_incompatible("limited_extrapolation_assign(y, cgs)",
-				 "cgs", cgs);
+                                 "cgs", cgs);
 
   const dimension_type cgs_num_rows = cgs.num_rows();
   // If `cgs' is empty (of rows), fall back to ordinary widening.
@@ -385,7 +388,7 @@ PPL::Grid::limited_generator_extrapolation_assign(const Grid& y,
     for (dimension_type i = 0; i < cgs_num_rows; ++i) {
       const Congruence& cg = cgs[i];
       if (x.relation_with(cg) == Poly_Con_Relation::is_included())
-	new_cgs.insert(cg);
+        new_cgs.insert(cg);
     }
     x.generator_widening_assign(y, tp);
     x.add_recycled_congruences(new_cgs);
@@ -427,19 +430,19 @@ PPL::Grid::widening_assign(const Grid& y, unsigned* tp) {
 
 void
 PPL::Grid::limited_extrapolation_assign(const Grid& y,
-					const Congruence_System& cgs,
-					unsigned* tp) {
+                                        const Congruence_System& cgs,
+                                        unsigned* tp) {
   Grid& x = *this;
 
   // Check dimension compatibility.
   if (x.space_dim != y.space_dim)
     throw_dimension_incompatible("limited_extrapolation_assign(y, cgs)",
-				 "y", y);
+                                 "y", y);
   // `cgs' must be dimension-compatible with the two grids.
   const dimension_type cgs_space_dim = cgs.space_dimension();
   if (x.space_dim < cgs_space_dim)
     throw_dimension_incompatible("limited_extrapolation_assign(y, cgs)",
-				 "cgs", cgs);
+                                 "cgs", cgs);
 
   const dimension_type cgs_num_rows = cgs.num_rows();
   // If `cgs' is empty (of rows), fall back to ordinary widening.
@@ -477,7 +480,7 @@ PPL::Grid::limited_extrapolation_assign(const Grid& y,
     for (dimension_type i = 0; i < cgs_num_rows; ++i) {
       const Congruence& cg = cgs[i];
       if (x.relation_with(cg) == Poly_Con_Relation::is_included())
-	new_cgs.insert(cg);
+        new_cgs.insert(cg);
     }
     x.widening_assign(y, tp);
     x.add_recycled_congruences(new_cgs);
diff --git a/src/H79_Certificate.cc b/src/H79_Certificate.cc
index 96147e2..f90b6c3 100644
--- a/src/H79_Certificate.cc
+++ b/src/H79_Certificate.cc
@@ -1,7 +1,7 @@
 /* H79_Certificate class implementation
    (non-inline member functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,8 +23,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "H79_Certificate.defs.hh"
-#include "Polyhedron.defs.hh"
+#include "H79_Certificate_defs.hh"
+#include "Polyhedron_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -43,7 +43,7 @@ PPL::H79_Certificate::H79_Certificate(const Polyhedron& ph)
   // It is assumed that `ph' is not an empty polyhedron.
   PPL_ASSERT(!ph.marked_empty());
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
+         cs_end = cs.end(); i != cs_end; ++i) {
     ++num_constraints;
     if (i->is_equality())
       --affine_dim;
@@ -85,7 +85,7 @@ PPL::H79_Certificate::compare(const Polyhedron& ph) const {
   // polyhedron described by `*this': hence, it cannot be empty.
   PPL_ASSERT(!ph.marked_empty());
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
+         cs_end = cs.end(); i != cs_end; ++i) {
     ++ph_num_constraints;
     if (i->is_equality())
       --ph_affine_dim;
diff --git a/src/H79_Certificate.defs.hh b/src/H79_Certificate.defs.hh
deleted file mode 100644
index 638c733..0000000
--- a/src/H79_Certificate.defs.hh
+++ /dev/null
@@ -1,98 +0,0 @@
-/* H79_Certificate class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_H79_Certificate_defs_hh
-#define PPL_H79_Certificate_defs_hh 1
-
-#include "H79_Certificate.types.hh"
-#include "Polyhedron.types.hh"
-#include "globals.types.hh"
-#include "assert.hh"
-#include <vector>
-
-//! A convergence certificate for the H79 widening operator.
-/*! \ingroup PPL_CXX_interface
-  Convergence certificates are used to instantiate the BHZ03 framework
-  so as to define widening operators for the finite powerset domain.
-  \note
-  The convergence of the H79 widening can also be certified by
-  BHRZ03_Certificate.
-*/
-class Parma_Polyhedra_Library::H79_Certificate {
-public:
-  //! Default constructor.
-  H79_Certificate();
-
-  //! Constructor: computes the certificate for \p ph.
-  template <typename PH>
-  H79_Certificate(const PH& ph);
-
-  //! Constructor: computes the certificate for \p ph.
-  H79_Certificate(const Polyhedron& ph);
-
-  //! Copy constructor.
-  H79_Certificate(const H79_Certificate& y);
-
-  //! Destructor.
-  ~H79_Certificate();
-
-  //! The comparison function for certificates.
-  /*!
-    \return
-    \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether \p *this
-    is smaller than, equal to, or greater than \p y, respectively.
-
-    Compares \p *this with \p y, using a total ordering which is a
-    refinement of the limited growth ordering relation for the
-    H79 widening.
-  */
-  int compare(const H79_Certificate& y) const;
-
-  //! Compares \p *this with the certificate for polyhedron \p ph.
-  template <typename PH>
-  int compare(const PH& ph) const;
-
-  //! Compares \p *this with the certificate for polyhedron \p ph.
-  int compare(const Polyhedron& ph) const;
-
-  //! A total ordering on H79 certificates.
-  /*! \ingroup PPL_CXX_interface
-    This binary predicate defines a total ordering on H79 certificates
-    which is used when storing information about sets of polyhedra.
-  */
-  struct Compare {
-    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
-    bool operator()(const H79_Certificate& x,
-		    const H79_Certificate& y) const;
-  };
-
-private:
-  //! Affine dimension of the polyhedron.
-  dimension_type affine_dim;
-  //! Cardinality of a non-redundant constraint system for the polyhedron.
-  dimension_type num_constraints;
-};
-
-#include "H79_Certificate.inlines.hh"
-
-#endif // !defined(PPL_H79_Certificate_defs_hh)
diff --git a/src/H79_Certificate.inlines.hh b/src/H79_Certificate.inlines.hh
deleted file mode 100644
index de87869..0000000
--- a/src/H79_Certificate.inlines.hh
+++ /dev/null
@@ -1,71 +0,0 @@
-/* H79_Certificate class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_H79_Certificate_inlines_hh
-#define PPL_H79_Certificate_inlines_hh 1
-
-#include "Polyhedron.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline
-H79_Certificate::H79_Certificate()
-  : affine_dim(0), num_constraints(0) {
-  // This is the certificate for a zero-dim universe polyhedron.
-}
-
-inline
-H79_Certificate::H79_Certificate(const H79_Certificate& y)
-  : affine_dim(y.affine_dim), num_constraints(y.num_constraints) {
-}
-
-inline
-H79_Certificate::~H79_Certificate() {
-}
-
-inline bool
-H79_Certificate::Compare::operator()(const H79_Certificate& x,
-				     const H79_Certificate& y) const {
-  // For an efficient evaluation of the multiset ordering based
-  // on this LGO relation, we want larger elements to come first.
-  return x.compare(y) == 1;
-}
-
-template <typename PH>
-inline
-H79_Certificate::H79_Certificate(const PH& ph)
-  : affine_dim(0), num_constraints(0) {
-  H79_Certificate cert(Polyhedron(NECESSARILY_CLOSED, ph.constraints()));
-  affine_dim = cert.affine_dim;
-  num_constraints = cert.num_constraints;
-}
-
-template <typename PH>
-inline int
-H79_Certificate::compare(const PH& ph) const {
-  return this->compare(Polyhedron(NECESSARILY_CLOSED, ph.constraints()));
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_H79_Certificate_inlines_hh)
diff --git a/src/H79_Certificate.types.hh b/src/H79_Certificate.types.hh
deleted file mode 100644
index cbb397e..0000000
--- a/src/H79_Certificate.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_H79_Certificate_types_hh
-#define PPL_H79_Certificate_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class H79_Certificate;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_H79_Certificate_types_hh)
diff --git a/src/H79_Certificate_defs.hh b/src/H79_Certificate_defs.hh
new file mode 100644
index 0000000..1cc6fe2
--- /dev/null
+++ b/src/H79_Certificate_defs.hh
@@ -0,0 +1,98 @@
+/* H79_Certificate class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_H79_Certificate_defs_hh
+#define PPL_H79_Certificate_defs_hh 1
+
+#include "H79_Certificate_types.hh"
+#include "Polyhedron_types.hh"
+#include "globals_types.hh"
+#include "assert.hh"
+#include <vector>
+
+//! A convergence certificate for the H79 widening operator.
+/*! \ingroup PPL_CXX_interface
+  Convergence certificates are used to instantiate the BHZ03 framework
+  so as to define widening operators for the finite powerset domain.
+  \note
+  The convergence of the H79 widening can also be certified by
+  BHRZ03_Certificate.
+*/
+class Parma_Polyhedra_Library::H79_Certificate {
+public:
+  //! Default constructor.
+  H79_Certificate();
+
+  //! Constructor: computes the certificate for \p ph.
+  template <typename PH>
+  H79_Certificate(const PH& ph);
+
+  //! Constructor: computes the certificate for \p ph.
+  H79_Certificate(const Polyhedron& ph);
+
+  //! Copy constructor.
+  H79_Certificate(const H79_Certificate& y);
+
+  //! Destructor.
+  ~H79_Certificate();
+
+  //! The comparison function for certificates.
+  /*!
+    \return
+    \f$-1\f$, \f$0\f$ or \f$1\f$ depending on whether \p *this
+    is smaller than, equal to, or greater than \p y, respectively.
+
+    Compares \p *this with \p y, using a total ordering which is a
+    refinement of the limited growth ordering relation for the
+    H79 widening.
+  */
+  int compare(const H79_Certificate& y) const;
+
+  //! Compares \p *this with the certificate for polyhedron \p ph.
+  template <typename PH>
+  int compare(const PH& ph) const;
+
+  //! Compares \p *this with the certificate for polyhedron \p ph.
+  int compare(const Polyhedron& ph) const;
+
+  //! A total ordering on H79 certificates.
+  /*! \ingroup PPL_CXX_interface
+    This binary predicate defines a total ordering on H79 certificates
+    which is used when storing information about sets of polyhedra.
+  */
+  struct Compare {
+    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
+    bool operator()(const H79_Certificate& x,
+                    const H79_Certificate& y) const;
+  };
+
+private:
+  //! Affine dimension of the polyhedron.
+  dimension_type affine_dim;
+  //! Cardinality of a non-redundant constraint system for the polyhedron.
+  dimension_type num_constraints;
+};
+
+#include "H79_Certificate_inlines.hh"
+
+#endif // !defined(PPL_H79_Certificate_defs_hh)
diff --git a/src/H79_Certificate_inlines.hh b/src/H79_Certificate_inlines.hh
new file mode 100644
index 0000000..0f94d8f
--- /dev/null
+++ b/src/H79_Certificate_inlines.hh
@@ -0,0 +1,71 @@
+/* H79_Certificate class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_H79_Certificate_inlines_hh
+#define PPL_H79_Certificate_inlines_hh 1
+
+#include "Polyhedron_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline
+H79_Certificate::H79_Certificate()
+  : affine_dim(0), num_constraints(0) {
+  // This is the certificate for a zero-dim universe polyhedron.
+}
+
+inline
+H79_Certificate::H79_Certificate(const H79_Certificate& y)
+  : affine_dim(y.affine_dim), num_constraints(y.num_constraints) {
+}
+
+inline
+H79_Certificate::~H79_Certificate() {
+}
+
+inline bool
+H79_Certificate::Compare::operator()(const H79_Certificate& x,
+                                     const H79_Certificate& y) const {
+  // For an efficient evaluation of the multiset ordering based
+  // on this LGO relation, we want larger elements to come first.
+  return x.compare(y) == 1;
+}
+
+template <typename PH>
+inline
+H79_Certificate::H79_Certificate(const PH& ph)
+  : affine_dim(0), num_constraints(0) {
+  H79_Certificate cert(Polyhedron(NECESSARILY_CLOSED, ph.constraints()));
+  affine_dim = cert.affine_dim;
+  num_constraints = cert.num_constraints;
+}
+
+template <typename PH>
+inline int
+H79_Certificate::compare(const PH& ph) const {
+  return this->compare(Polyhedron(NECESSARILY_CLOSED, ph.constraints()));
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_H79_Certificate_inlines_hh)
diff --git a/src/H79_Certificate_types.hh b/src/H79_Certificate_types.hh
new file mode 100644
index 0000000..7da155b
--- /dev/null
+++ b/src/H79_Certificate_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_H79_Certificate_types_hh
+#define PPL_H79_Certificate_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class H79_Certificate;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_H79_Certificate_types_hh)
diff --git a/src/Handler.defs.hh b/src/Handler.defs.hh
deleted file mode 100644
index 5a0e400..0000000
--- a/src/Handler.defs.hh
+++ /dev/null
@@ -1,95 +0,0 @@
-/* Handler and derived classes' declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Handler_defs_hh
-#define PPL_Handler_defs_hh 1
-
-#include "Handler.types.hh"
-
-//! Abstract base class for handlers of the watchdog events.
-class Parma_Polyhedra_Library::Implementation::Watchdog::Handler {
-public:
-  //! Does the job.
-  virtual void act() const = 0;
-
-  //! Virtual destructor.
-  virtual ~Handler();
-};
-
-//! A kind of Handler that installs a flag onto a flag-holder.
-/*!
-  The template class Handler_Flag<Flag_Base, Flag> is an handler whose
-  job is to install a flag onto an <EM>holder</EM> for the flag.
-  The flag is of type \p Flag and the holder is a (volatile) pointer
-  to \p Flag_Base.  Installing the flag onto the holder means making
-  the holder point to the flag, so that it must be possible to assign
-  a value of type <CODE>Flag*</CODE> to an entity of type
-  <CODE>Flag_Base*</CODE>.
-  The class \p Flag must provide the method
-
-  \code
-    int priority() const
-  \endcode
-  returning an integer priority associated to the flag.
-
-  The handler will install its flag onto the holder only if the holder
-  is empty, namely, it is the null pointer, or if the holder holds a
-  flag of strictly lower priority.
- */
-template <typename Flag_Base, typename Flag>
-class Parma_Polyhedra_Library::Implementation::Watchdog::Handler_Flag
-  : public Handler {
-public:
-  //! Constructor with a given function.
-  Handler_Flag(const Flag_Base* volatile& holder, Flag& flag);
-
-  /*! \brief
-    Does its job: installs the flag onto the holder, if a flag with
-    an higher priority has not already been installed.
-  */
-  virtual void act() const;
-
-private:
-  // declare holder as reference to volatile pointer to const Flag_Base
-  const Flag_Base* volatile& h;
-  Flag& f;
-};
-
-//! A kind of Handler calling a given function.
-class Parma_Polyhedra_Library::Implementation::Watchdog::Handler_Function
-  : public Handler {
-public:
-  //! Constructor with a given function.
-  Handler_Function(void (*function)());
-
-  //! Does its job: calls the embedded function.
-  virtual void act() const;
-
-private:
-  //! Pointer to the embedded function.
-  void (*f)();
-};
-
-#include "Handler.inlines.hh"
-
-#endif // !defined(PPL_Handler_defs_hh)
diff --git a/src/Handler.inlines.hh b/src/Handler.inlines.hh
deleted file mode 100644
index cc684cc..0000000
--- a/src/Handler.inlines.hh
+++ /dev/null
@@ -1,66 +0,0 @@
-/* Handler and derived classes' implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Handler_inlines_hh
-#define PPL_Handler_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-inline
-Handler::~Handler() {
-}
-
-template <typename Flag_Base, typename Flag>
-Handler_Flag<Flag_Base, Flag>::Handler_Flag(const Flag_Base* volatile& holder,
-					    Flag& flag)
-  : h(holder), f(flag) {
-}
-
-template <typename Flag_Base, typename Flag>
-void
-Handler_Flag<Flag_Base, Flag>::act() const {
-  if (h == 0 || static_cast<const Flag&>(*h).priority() < f.priority())
-    h = &f;
-}
-
-inline
-Handler_Function::Handler_Function(void (*function)())
-  : f(function) {
-}
-
-inline void
-Handler_Function::act() const {
-  (*f)();
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Handler_inlines_hh)
diff --git a/src/Handler.types.hh b/src/Handler.types.hh
deleted file mode 100644
index 4f5e183..0000000
--- a/src/Handler.types.hh
+++ /dev/null
@@ -1,35 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Handler_types_hh
-#define PPL_Handler_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-class Handler;
-
-template <typename Flag_Base, typename Flag>
-class Handler_Flag;
-
-class Handler_Function;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Handler_types_hh)
diff --git a/src/Handler_defs.hh b/src/Handler_defs.hh
new file mode 100644
index 0000000..ca2f6fd
--- /dev/null
+++ b/src/Handler_defs.hh
@@ -0,0 +1,96 @@
+/* Handler and derived classes' declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Handler_defs_hh
+#define PPL_Handler_defs_hh 1
+
+#include "Handler_types.hh"
+
+//! Abstract base class for handlers of the watchdog events.
+class Parma_Polyhedra_Library::Implementation::Watchdog::Handler {
+public:
+  //! Does the job.
+  virtual void act() const = 0;
+
+  //! Virtual destructor.
+  virtual ~Handler();
+};
+
+//! A kind of Handler that installs a flag onto a flag-holder.
+/*!
+  The template class <CODE>Handler_Flag\<Flag_Base, Flag\></CODE>
+  is an handler whose job is to install a flag onto an <EM>holder</EM>
+  for the flag.
+  The flag is of type \p Flag and the holder is a (volatile) pointer
+  to \p Flag_Base.  Installing the flag onto the holder means making
+  the holder point to the flag, so that it must be possible to assign
+  a value of type <CODE>Flag*</CODE> to an entity of type
+  <CODE>Flag_Base*</CODE>.
+  The class \p Flag must provide the method
+
+  \code
+    int priority() const
+  \endcode
+  returning an integer priority associated to the flag.
+
+  The handler will install its flag onto the holder only if the holder
+  is empty, namely, it is the null pointer, or if the holder holds a
+  flag of strictly lower priority.
+ */
+template <typename Flag_Base, typename Flag>
+class Parma_Polyhedra_Library::Implementation::Watchdog::Handler_Flag
+  : public Handler {
+public:
+  //! Constructor with a given function.
+  Handler_Flag(const Flag_Base* volatile& holder, Flag& flag);
+
+  /*! \brief
+    Does its job: installs the flag onto the holder, if a flag with
+    an higher priority has not already been installed.
+  */
+  virtual void act() const;
+
+private:
+  // declare holder as reference to volatile pointer to const Flag_Base
+  const Flag_Base* volatile& h;
+  Flag& f;
+};
+
+//! A kind of Handler calling a given function.
+class Parma_Polyhedra_Library::Implementation::Watchdog::Handler_Function
+  : public Handler {
+public:
+  //! Constructor with a given function.
+  Handler_Function(void (* const function)());
+
+  //! Does its job: calls the embedded function.
+  virtual void act() const;
+
+private:
+  //! Pointer to the embedded function.
+  void (* const f)();
+};
+
+#include "Handler_inlines.hh"
+
+#endif // !defined(PPL_Handler_defs_hh)
diff --git a/src/Handler_inlines.hh b/src/Handler_inlines.hh
new file mode 100644
index 0000000..00fa0c1
--- /dev/null
+++ b/src/Handler_inlines.hh
@@ -0,0 +1,66 @@
+/* Handler and derived classes' implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Handler_inlines_hh
+#define PPL_Handler_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+inline
+Handler::~Handler() {
+}
+
+template <typename Flag_Base, typename Flag>
+Handler_Flag<Flag_Base, Flag>::Handler_Flag(const Flag_Base* volatile& holder,
+                                            Flag& flag)
+  : h(holder), f(flag) {
+}
+
+template <typename Flag_Base, typename Flag>
+void
+Handler_Flag<Flag_Base, Flag>::act() const {
+  if (h == 0 || static_cast<const Flag&>(*h).priority() < f.priority())
+    h = &f;
+}
+
+inline
+Handler_Function::Handler_Function(void (* const function)())
+  : f(function) {
+}
+
+inline void
+Handler_Function::act() const {
+  (*f)();
+}
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Handler_inlines_hh)
diff --git a/src/Handler_types.hh b/src/Handler_types.hh
new file mode 100644
index 0000000..9f842ab
--- /dev/null
+++ b/src/Handler_types.hh
@@ -0,0 +1,35 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Handler_types_hh
+#define PPL_Handler_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+class Handler;
+
+template <typename Flag_Base, typename Flag>
+class Handler_Flag;
+
+class Handler_Function;
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Handler_types_hh)
diff --git a/src/Has_Assign_Or_Swap.hh b/src/Has_Assign_Or_Swap.hh
index 2a05438..55945ed 100644
--- a/src/Has_Assign_Or_Swap.hh
+++ b/src/Has_Assign_Or_Swap.hh
@@ -1,6 +1,6 @@
 /* Has_Assign_Or_Swap classes declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -44,8 +44,8 @@ struct Has_Assign_Or_Swap : public False {
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename T>
 struct Has_Assign_Or_Swap<T,
-			  typename Enable_If_Is<void (T::*)(T& x),
-						&T::assign_or_swap>::type>
+                          typename Enable_If_Is<void (T::*)(T& x),
+                                                &T::assign_or_swap>::type>
   : public True {
 };
 
diff --git a/src/Init.cc b/src/Init.cc
index 8997598..cef1af6 100644
--- a/src/Init.cc
+++ b/src/Init.cc
@@ -1,6 +1,6 @@
 /* Init class implementation (non-inline functions and static variables).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,23 +22,23 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Init.defs.hh"
-#include "Variable.defs.hh"
-#include "fpu.defs.hh"
-#include "Rounding_Dir.defs.hh"
-#include "checked.defs.hh"
-#include "Coefficient.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Constraint.defs.hh"
-#include "Generator.defs.hh"
-#include "Congruence.defs.hh"
-#include "Grid_Generator.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "Generator_System.defs.hh"
-#include "Congruence_System.defs.hh"
-#include "Grid_Generator_System.defs.hh"
-#include "Polyhedron.defs.hh"
-#include "Watchdog.defs.hh"
+#include "Init_defs.hh"
+#include "Variable_defs.hh"
+#include "fpu_defs.hh"
+#include "Rounding_Dir_defs.hh"
+#include "checked_defs.hh"
+#include "Coefficient_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Constraint_defs.hh"
+#include "Generator_defs.hh"
+#include "Congruence_defs.hh"
+#include "Grid_Generator_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "Generator_System_defs.hh"
+#include "Congruence_System_defs.hh"
+#include "Grid_Generator_System_defs.hh"
+#include "Polyhedron_defs.hh"
+#include "Watchdog_defs.hh"
 #include <stdexcept>
 
 namespace PPL = Parma_Polyhedra_Library;
diff --git a/src/Init.defs.hh b/src/Init.defs.hh
deleted file mode 100644
index 12a5da5..0000000
--- a/src/Init.defs.hh
+++ /dev/null
@@ -1,100 +0,0 @@
-/* Init class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Init_defs_hh
-#define PPL_Init_defs_hh 1
-
-#include "Init.types.hh"
-#include "fpu.types.hh"
-
-namespace Parma_Polyhedra_Library {
-
-/*! \brief
-  Sets the FPU rounding mode so that the PPL abstractions based on
-  floating point numbers work correctly.
-
-  This is performed automatically at initialization-time.  Calling
-  this function is needed only if restore_pre_PPL_rounding() has been
-  previously called.
-*/
-void set_rounding_for_PPL();
-
-/*! \brief
-  Sets the FPU rounding mode as it was before initialization of the PPL.
-
-  This is important if the application uses floating-point computations
-  outside the PPL.  It is crucial when the application uses functions
-  from a mathematical library that are not guaranteed to work correctly
-  under all rounding modes.
-
-  After calling this function it is absolutely necessary to call
-  set_rounding_for_PPL() before using any PPL abstractions based on
-  floating point numbers.
-  This is performed automatically at finalization-time.
-*/
-void restore_pre_PPL_rounding();
-
-} // namespace Parma_Polyhedra_Library
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Class for initialization and finalization.
-/*! \ingroup PPL_CXX_interface
-  <EM>Nifty Counter</EM> initialization class,
-  ensuring that the library is initialized only once
-  and before its first use.
-  A count of the number of translation units using the library
-  is maintained. A static object of Init type will be declared
-  by each translation unit using the library.  As a result,
-  only one of them will initialize and properly finalize
-  the library.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Init {
-public:
-  //! Initializes the PPL.
-  Init();
-
-  //! Finalizes the PPL.
-  ~Init();
-
-private:
-  /*! \brief
-    Default precision parameter used for irrational calculations.
-
-    The default is chosen to have a precision greater than most
-    precise IEC 559 floating point (112 bits of mantissa).
-  */
-  static const unsigned DEFAULT_IRRATIONAL_PRECISION = 128U;
-
-  //! Count the number of objects created.
-  static unsigned int count;
-  static fpu_rounding_direction_type old_rounding_direction;
-
-  friend void set_rounding_for_PPL();
-  friend void restore_pre_PPL_rounding();
-};
-
-#include "Init.inlines.hh"
-
-
-#endif // !defined(PPL_Init_defs_hh)
diff --git a/src/Init.inlines.hh b/src/Init.inlines.hh
deleted file mode 100644
index a10e469..0000000
--- a/src/Init.inlines.hh
+++ /dev/null
@@ -1,48 +0,0 @@
-/* Init class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Init_inlines_hh
-#define PPL_Init_inlines_hh 1
-
-#include "fpu.defs.hh"
-#include "Rounding_Dir.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-set_rounding_for_PPL() {
-#if PPL_CAN_CONTROL_FPU
-    fpu_set_rounding_direction(round_fpu_dir(ROUND_DIRECT));
-#endif
-}
-
-inline void
-restore_pre_PPL_rounding() {
-#if PPL_CAN_CONTROL_FPU
-  fpu_set_rounding_direction(Init::old_rounding_direction);
-#endif
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Init_inlines_hh)
diff --git a/src/Init.types.hh b/src/Init.types.hh
deleted file mode 100644
index 60d6a65..0000000
--- a/src/Init.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Init_types_hh
-#define PPL_Init_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Init;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Init_types_hh)
diff --git a/src/Init_defs.hh b/src/Init_defs.hh
new file mode 100644
index 0000000..80923e8
--- /dev/null
+++ b/src/Init_defs.hh
@@ -0,0 +1,100 @@
+/* Init class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Init_defs_hh
+#define PPL_Init_defs_hh 1
+
+#include "Init_types.hh"
+#include "fpu_types.hh"
+
+namespace Parma_Polyhedra_Library {
+
+/*! \brief
+  Sets the FPU rounding mode so that the PPL abstractions based on
+  floating point numbers work correctly.
+
+  This is performed automatically at initialization-time.  Calling
+  this function is needed only if restore_pre_PPL_rounding() has been
+  previously called.
+*/
+void set_rounding_for_PPL();
+
+/*! \brief
+  Sets the FPU rounding mode as it was before initialization of the PPL.
+
+  This is important if the application uses floating-point computations
+  outside the PPL.  It is crucial when the application uses functions
+  from a mathematical library that are not guaranteed to work correctly
+  under all rounding modes.
+
+  After calling this function it is absolutely necessary to call
+  set_rounding_for_PPL() before using any PPL abstractions based on
+  floating point numbers.
+  This is performed automatically at finalization-time.
+*/
+void restore_pre_PPL_rounding();
+
+} // namespace Parma_Polyhedra_Library
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Class for initialization and finalization.
+/*! \ingroup PPL_CXX_interface
+  <EM>Nifty Counter</EM> initialization class,
+  ensuring that the library is initialized only once
+  and before its first use.
+  A count of the number of translation units using the library
+  is maintained. A static object of Init type will be declared
+  by each translation unit using the library.  As a result,
+  only one of them will initialize and properly finalize
+  the library.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Init {
+public:
+  //! Initializes the PPL.
+  Init();
+
+  //! Finalizes the PPL.
+  ~Init();
+
+private:
+  /*! \brief
+    Default precision parameter used for irrational calculations.
+
+    The default is chosen to have a precision greater than most
+    precise IEC 559 floating point (112 bits of mantissa).
+  */
+  static const unsigned DEFAULT_IRRATIONAL_PRECISION = 128U;
+
+  //! Count the number of objects created.
+  static unsigned int count;
+  static fpu_rounding_direction_type old_rounding_direction;
+
+  friend void set_rounding_for_PPL();
+  friend void restore_pre_PPL_rounding();
+};
+
+#include "Init_inlines.hh"
+
+
+#endif // !defined(PPL_Init_defs_hh)
diff --git a/src/Init_inlines.hh b/src/Init_inlines.hh
new file mode 100644
index 0000000..124a03e
--- /dev/null
+++ b/src/Init_inlines.hh
@@ -0,0 +1,48 @@
+/* Init class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Init_inlines_hh
+#define PPL_Init_inlines_hh 1
+
+#include "fpu_defs.hh"
+#include "Rounding_Dir_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+set_rounding_for_PPL() {
+#if PPL_CAN_CONTROL_FPU
+    fpu_set_rounding_direction(round_fpu_dir(ROUND_DIRECT));
+#endif
+}
+
+inline void
+restore_pre_PPL_rounding() {
+#if PPL_CAN_CONTROL_FPU
+  fpu_set_rounding_direction(Init::old_rounding_direction);
+#endif
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Init_inlines_hh)
diff --git a/src/Init_types.hh b/src/Init_types.hh
new file mode 100644
index 0000000..410bc01
--- /dev/null
+++ b/src/Init_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Init_types_hh
+#define PPL_Init_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Init;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Init_types_hh)
diff --git a/src/Integer_Interval.hh b/src/Integer_Interval.hh
index a68785a..1f873ed 100644
--- a/src/Integer_Interval.hh
+++ b/src/Integer_Interval.hh
@@ -1,6 +1,6 @@
 /* Integer_Interval class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,7 +24,7 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_Integer_Interval_hh
 #define PPL_Integer_Interval_hh 1
 
-#include "Interval.defs.hh"
+#include "Interval_defs.hh"
 #include <gmpxx.h>
 
 namespace Parma_Polyhedra_Library {
diff --git a/src/Interval.defs.hh b/src/Interval.defs.hh
deleted file mode 100644
index 7d25bcd..0000000
--- a/src/Interval.defs.hh
+++ /dev/null
@@ -1,761 +0,0 @@
-/* Declarations for the Interval class and its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Interval_defs_hh
-#define PPL_Interval_defs_hh 1
-
-#include "globals.defs.hh"
-#include "meta_programming.hh"
-#include "assign_or_swap.hh"
-#include "intervals.defs.hh"
-#include "Interval.types.hh"
-#include "Interval_Info.defs.hh"
-#include <iosfwd>
-
-// Temporary!
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-enum Ternary { T_YES, T_NO, T_MAYBE };
-
-inline I_Result
-combine(Result l, Result u) {
-  unsigned res = static_cast<unsigned>(l) | (static_cast<unsigned>(u) << 6);
-  return static_cast<I_Result>(res);
-}
-
-struct Interval_Base {
-};
-
-using namespace Boundary_NS;
-using namespace Interval_NS;
-
-template <typename T, typename Enable = void>
-struct Is_Singleton : public Is_Native_Or_Checked<T> {};
-
-template <typename T>
-struct Is_Interval : public Is_Same_Or_Derived<Interval_Base, T> {};
-
-//! A generic, not necessarily closed, possibly restricted interval.
-/*! \ingroup PPL_CXX_interface
-  The class template type parameter \p Boundary represents the type
-  of the interval boundaries, and can be chosen, among other possibilities,
-  within one of the following number families:
-
-  - a bounded precision native integer type (that is,
-    from <CODE>signed char</CODE> to <CODE>long long</CODE>
-    and from <CODE>int8_t</CODE> to <CODE>int64_t</CODE>);
-  - a bounded precision floating point type (<CODE>float</CODE>,
-    <CODE>double</CODE> or <CODE>long double</CODE>);
-  - an unbounded integer or rational type, as provided by the C++ interface
-    of GMP (<CODE>mpz_class</CODE> or <CODE>mpq_class</CODE>).
-
-  The class template type parameter \p Info allows to control a number
-  of features of the class, among which:
-
-  - the ability to support open as well as closed boundaries;
-  - the ability to represent empty intervals in addition to nonempty ones;
-  - the ability to represent intervals of extended number families
-    that contain positive and negative infinities;
-*/
-template <typename Boundary, typename Info>
-class Interval : public Interval_Base, private Info {
-private:
-  PPL_COMPILE_TIME_CHECK(!Info::store_special
-                         || !std::numeric_limits<Boundary>::has_infinity,
-                         "store_special is meaningless"
-                         " when boundary type may contains infinity");
-  Info& w_info() const {
-    return const_cast<Interval&>(*this);
-  }
-
-public:
-  typedef Boundary boundary_type;
-  typedef Info info_type;
-
-  typedef Interval_NS::Property Property;
-
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
-  operator=(const T& x) {
-    assign(x);
-    return *this;
-  }
-
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
-  operator+=(const T& x) {
-    add_assign(*this, x);
-    return *this;
-  }
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
-  operator-=(const T& x) {
-    sub_assign(*this, x);
-    return *this;
-  }
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
-  operator*=(const T& x) {
-    mul_assign(*this, x);
-    return *this;
-  }
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
-  operator/=(const T& x) {
-    div_assign(*this, x);
-    return *this;
-  }
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Interval& y);
-
-  Info& info() {
-    return *this;
-  }
-
-  const Info& info() const {
-    return *this;
-  }
-
-  Boundary& lower() {
-    return lower_;
-  }
-
-  const Boundary& lower() const {
-    return lower_;
-  }
-
-  Boundary& upper() {
-    return upper_;
-  }
-
-  const Boundary& upper() const {
-    return upper_;
-  }
-
-  I_Constraint<boundary_type> lower_constraint() const {
-    PPL_ASSERT(!is_empty());
-    if (info().get_boundary_property(LOWER, SPECIAL))
-      return I_Constraint<boundary_type>();
-    return i_constraint(lower_is_open() ? GREATER_THAN : GREATER_OR_EQUAL,
-                        lower(), true);
-  }
-  I_Constraint<boundary_type> upper_constraint() const {
-    PPL_ASSERT(!is_empty());
-    if (info().get_boundary_property(UPPER, SPECIAL))
-      return I_Constraint<boundary_type>();
-    return i_constraint(upper_is_open() ? LESS_THAN : LESS_OR_EQUAL,
-                        upper(), true);
-  }
-
-  bool is_empty() const {
-    return lt(UPPER, upper(), info(), LOWER, lower(), info());
-  }
-
-  bool check_empty(I_Result r) const {
-    return (r & I_ANY) == I_EMPTY
-      || ((r & I_ANY) != I_NOT_EMPTY && is_empty());
-  }
-
-  bool is_singleton() const {
-    return eq(LOWER, lower(), info(), UPPER, upper(), info());
-  }
-
-  bool lower_is_open() const {
-    PPL_ASSERT(OK());
-    return is_open(LOWER, lower(), info());
-  }
-
-  bool upper_is_open() const {
-    PPL_ASSERT(OK());
-    return is_open(UPPER, upper(), info());
-  }
-
-  bool lower_is_boundary_infinity() const {
-    PPL_ASSERT(OK());
-    return Boundary_NS::is_boundary_infinity(LOWER, lower(), info());
-  }
-
-  bool upper_is_boundary_infinity() const {
-    PPL_ASSERT(OK());
-    return Boundary_NS::is_boundary_infinity(UPPER, upper(), info());
-  }
-
-  bool lower_is_domain_inf() const {
-    PPL_ASSERT(OK());
-    return Boundary_NS::is_domain_inf(LOWER, lower(), info());
-  }
-
-  bool upper_is_domain_sup() const {
-    PPL_ASSERT(OK());
-    return Boundary_NS::is_domain_sup(UPPER, upper(), info());
-  }
-
-  bool is_bounded() const {
-    PPL_ASSERT(OK());
-    return !lower_is_boundary_infinity() && !upper_is_boundary_infinity();
-  }
-
-  bool is_universe() const {
-    PPL_ASSERT(OK());
-    return lower_is_domain_inf() && upper_is_domain_sup();
-  }
-
-  I_Result lower_extend() {
-    info().clear_boundary_properties(LOWER);
-    set_unbounded(LOWER, lower(), info());
-    return I_ANY;
-  }
-
-  template <typename C>
-  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
-  lower_extend(const C& c);
-
-  I_Result upper_extend() {
-    info().clear_boundary_properties(UPPER);
-    set_unbounded(UPPER, upper(), info());
-    return I_ANY;
-  }
-
-  template <typename C>
-  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
-  upper_extend(const C& c);
-
-  I_Result build() {
-    return assign(UNIVERSE);
-  }
-
-  template <typename C>
-  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
-  build(const C& c) {
-    Relation_Symbol rs;
-    switch (c.rel()) {
-    case V_LGE:
-    case V_GT_MINUS_INFINITY:
-    case V_LT_PLUS_INFINITY:
-      return assign(UNIVERSE);
-    default:
-      return assign(EMPTY);
-    case V_LT:
-    case V_LE:
-    case V_GT:
-    case V_GE:
-    case V_EQ:
-    case V_NE:
-      assign(UNIVERSE);
-      rs = static_cast<Relation_Symbol>(c.rel());
-      return refine_existential(rs, c.value());
-    }
-  }
-
-  template <typename C1, typename C2>
-  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C1>::value
-                     &&
-		     Is_Same_Or_Derived<I_Constraint_Base, C2>::value,
-                     I_Result>::type
-  build(const C1& c1, const C2& c2) {
-    switch (c1.rel()) {
-    case V_LGE:
-      return build(c2);
-    case V_NAN:
-      return assign(EMPTY);
-    default:
-      break;
-    }
-    switch (c2.rel()) {
-    case V_LGE:
-      return build(c1);
-    case V_NAN:
-      return assign(EMPTY);
-    default:
-      break;
-    }
-    build(c1);
-    I_Result r = add_constraint(c2);
-    return r - (I_CHANGED | I_UNCHANGED);
-  }
-
-  template <typename C>
-  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
-  add_constraint(const C& c) {
-    Interval x;
-    x.build(c);
-    return intersect_assign(x);
-  }
-
-  I_Result assign(Degenerate_Element e) {
-    I_Result r;
-    info().clear();
-    switch (e) {
-    case EMPTY:
-      lower_ = 1;
-      upper_ = 0;
-      r = I_EMPTY | I_EXACT;
-      break;
-    case UNIVERSE:
-      set_unbounded(LOWER, lower(), info());
-      set_unbounded(UPPER, upper(), info());
-      r = I_UNIVERSE | I_EXACT;
-      break;
-    default:
-      PPL_UNREACHABLE;
-      r = I_EMPTY;
-      break;
-    }
-    PPL_ASSERT(OK());
-    return r;
-  }
-
-  template <typename From>
-  typename Enable_If<Is_Special<From>::value, I_Result>::type
-  assign(const From&) {
-    info().clear();
-    Result rl, ru;
-    switch (From::vclass) {
-    case VC_MINUS_INFINITY:
-      rl = Boundary_NS::set_minus_infinity(LOWER, lower(), info());
-      ru = Boundary_NS::set_minus_infinity(UPPER, upper(), info());
-      break;
-    case VC_PLUS_INFINITY:
-      rl = Boundary_NS::set_plus_infinity(LOWER, lower(), info());
-      ru = Boundary_NS::set_plus_infinity(UPPER, upper(), info());
-      break;
-    default:
-      PPL_UNREACHABLE;
-      rl = V_NAN;
-      ru = V_NAN;
-      break;
-    }
-    PPL_ASSERT(OK());
-    return combine(rl, ru);
-  }
-
-  I_Result set_infinities() {
-    info().clear();
-    Result rl = Boundary_NS::set_minus_infinity(LOWER, lower(), info());
-    Result ru = Boundary_NS::set_plus_infinity(UPPER, upper(), info());
-    PPL_ASSERT(OK());
-    return combine(rl, ru);
-  }
-
-  static bool is_always_topologically_closed() {
-    return !Info::store_open;
-  }
-
-  bool is_topologically_closed() const {
-    PPL_ASSERT(OK());
-    return is_always_topologically_closed()
-      || is_empty()
-      || ((lower_is_boundary_infinity() || !lower_is_open())
-          && (upper_is_boundary_infinity() || !upper_is_open()));
-  }
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign() {
-    if (!Info::store_open || is_empty())
-      return;
-    if (lower_is_open() && !lower_is_boundary_infinity())
-      info().set_boundary_property(LOWER, OPEN, false);
-    if (upper_is_open() && !upper_is_boundary_infinity())
-      info().set_boundary_property(UPPER, OPEN, false);
-  }
-
-  void remove_inf() {
-    PPL_ASSERT(!is_empty());
-    if (!Info::store_open)
-      return;
-    info().set_boundary_property(LOWER, OPEN, true);
-  }
-
-  void remove_sup() {
-    PPL_ASSERT(!is_empty());
-    if (!Info::store_open)
-      return;
-    info().set_boundary_property(UPPER, OPEN, true);
-  }
-
-  int infinity_sign() const {
-    PPL_ASSERT(OK());
-    if (is_reverse_infinity(LOWER, lower(), info()))
-      return 1;
-    else if (is_reverse_infinity(UPPER, upper(), info()))
-      return -1;
-    else
-      return 0;
-  }
-
-  bool contains_integer_point() const {
-    PPL_ASSERT(OK());
-    if (is_empty())
-      return false;
-    if (!is_bounded())
-      return true;
-    Boundary l;
-    if (lower_is_open()) {
-      add_assign_r(l, lower(), Boundary(1), ROUND_DOWN);
-      floor_assign_r(l, l, ROUND_DOWN);
-    }
-    else
-      ceil_assign_r(l, lower(), ROUND_DOWN);
-    Boundary u;
-    if (upper_is_open()) {
-      sub_assign_r(u, upper(), Boundary(1), ROUND_UP);
-      ceil_assign_r(u, u, ROUND_UP);
-    }
-    else
-      floor_assign_r(u, upper(), ROUND_UP);
-    return u >= l;
-  }
-
-  void drop_some_non_integer_points() {
-    if (is_empty())
-      return;
-    if (lower_is_open() && !lower_is_boundary_infinity()) {
-      add_assign_r(lower(), lower(), Boundary(1), ROUND_DOWN);
-      floor_assign_r(lower(), lower(), ROUND_DOWN);
-      info().set_boundary_property(LOWER, OPEN, false);
-    }
-    else
-      ceil_assign_r(lower(), lower(), ROUND_DOWN);
-    if (upper_is_open() && !upper_is_boundary_infinity()) {
-      sub_assign_r(upper(), upper(), Boundary(1), ROUND_UP);
-      ceil_assign_r(upper(), upper(), ROUND_UP);
-      info().set_boundary_property(UPPER, OPEN, false);
-    }
-    else
-      floor_assign_r(upper(), upper(), ROUND_UP);
-  }
-
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value || Is_Interval<From>::value, I_Result>::type
-  wrap_assign(Bounded_Integer_Type_Width w,
-              Bounded_Integer_Type_Representation r,
-	      const From& refinement) {
-    if (is_empty())
-      return I_EMPTY;
-    if (lower_is_boundary_infinity() || upper_is_boundary_infinity())
-      return assign(refinement);
-    PPL_DIRTY_TEMP(Boundary, u);
-    Result result = sub_2exp_assign_r(u, upper(), w, ROUND_UP);
-    if (result_overflow(result) == 0 && u > lower())
-      return assign(refinement);
-    info().clear();
-    switch (r) {
-    case UNSIGNED:
-      umod_2exp_assign(LOWER, lower(), info(),
-		       LOWER, lower(), info(), w);
-      umod_2exp_assign(UPPER, upper(), info(),
-		       UPPER, upper(), info(), w);
-      break;
-    case SIGNED_2_COMPLEMENT:
-      smod_2exp_assign(LOWER, lower(), info(),
-		       LOWER, lower(), info(), w);
-      smod_2exp_assign(UPPER, upper(), info(),
-		       UPPER, upper(), info(), w);
-      break;
-    default:
-      PPL_UNREACHABLE;
-      break;
-    }
-    if (le(LOWER, lower(), info(), UPPER, upper(), info()))
-      return intersect_assign(refinement);
-    PPL_DIRTY_TEMP(Interval, tmp);
-    tmp.info().clear();
-    Boundary_NS::assign(LOWER, tmp.lower(), tmp.info(),
-			LOWER, lower(), info());
-    set_unbounded(UPPER, tmp.upper(), tmp.info());
-    tmp.intersect_assign(refinement);
-    lower_extend();
-    intersect_assign(refinement);
-    return join_assign(tmp);
-  }
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  void ascii_dump(std::ostream& s) const;
-  bool ascii_load(std::istream& s);
-
-  bool OK() const {
-    if (!Info::may_be_empty && is_empty()) {
-#ifndef NDEBUG
-      std::cerr << "The interval is unexpectedly empty.\n";
-#endif
-      return false;
-    }
-
-    if (is_open(LOWER, lower(), info())) {
-      if (is_plus_infinity(LOWER, lower(), info())) {
-#ifndef NDEBUG
-	std::cerr << "The lower boundary is +inf open.\n";
-#endif
-      }
-    }
-    else if (!Info::may_contain_infinity
-	     && (is_minus_infinity(LOWER, lower(), info())
-		 || is_plus_infinity(LOWER, lower(), info()))) {
-#ifndef NDEBUG
-      std::cerr << "The lower boundary is unexpectedly infinity.\n";
-#endif
-      return false;
-    }
-    if (!info().get_boundary_property(LOWER, SPECIAL)) {
-      if (is_not_a_number(lower())) {
-#ifndef NDEBUG
-	std::cerr << "The lower boundary is not a number.\n";
-#endif
-	return false;
-      }
-    }
-
-    if (is_open(UPPER, upper(), info())) {
-      if (is_minus_infinity(UPPER, upper(), info())) {
-#ifndef NDEBUG
-	std::cerr << "The upper boundary is -inf open.\n";
-#endif
-      }
-    }
-    else if (!Info::may_contain_infinity
-	     && (is_minus_infinity(UPPER, upper(), info())
-		 || is_plus_infinity(UPPER, upper(), info()))) {
-#ifndef NDEBUG
-      std::cerr << "The upper boundary is unexpectedly infinity."
-                << std::endl;
-#endif
-      return false;
-    }
-    if (!info().get_boundary_property(UPPER, SPECIAL)) {
-      if (is_not_a_number(upper())) {
-#ifndef NDEBUG
-	std::cerr << "The upper boundary is not a number.\n";
-#endif
-	return false;
-      }
-    }
-
-    // Everything OK.
-    return true;
-  }
-
-  Interval() {
-  }
-
-  template <typename T>
-  explicit Interval(const T& x) {
-    assign(x);
-  }
-
-  /*! \brief
-    Builds the smallest interval containing the number whose textual
-    representation is contained in \p s.
-  */
-  explicit Interval(const char* s);
-
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value
-                     || Is_Interval<T>::value, bool>::type
-  contains(const T& y) const;
-
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value
-                     || Is_Interval<T>::value, bool>::type
-  strictly_contains(const T& y) const;
-
-  template <typename T>
-  typename Enable_If<Is_Singleton<T>::value
-                     || Is_Interval<T>::value, bool>::type
-  is_disjoint_from(const T& y) const;
-
-
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  assign(const From& x);
-
-  template <typename Type>
-  typename Enable_If<Is_Singleton<Type>::value
-                     || Is_Interval<Type>::value, bool>::type
-  can_be_exactly_joined_to(const Type& x) const;
-
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  join_assign(const From& x);
-
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value
-                       || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value
-                          || Is_Interval<From2>::value)), I_Result>::type
-  join_assign(const From1& x, const From2& y);
-
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  intersect_assign(const From& x);
-
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value
-                       || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value
-                          || Is_Interval<From2>::value)), I_Result>::type
-  intersect_assign(const From1& x, const From2& y);
-
-  /*! \brief
-    Assigns to \p *this the smallest interval containing the set-theoretic
-    difference of \p *this and \p x.
-  */
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  difference_assign(const From& x);
-
-  /*! \brief
-    Assigns to \p *this the smallest interval containing the set-theoretic
-    difference of \p x and \p y.
-  */
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value
-                       || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value
-                          || Is_Interval<From2>::value)), I_Result>::type
-  difference_assign(const From1& x, const From2& y);
-
-  /*! \brief
-    Assigns to \p *this the largest interval contained in the set-theoretic
-    difference of \p *this and \p x.
-  */
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  lower_approximation_difference_assign(const From& x);
-
-  /*! \brief
-    Assigns to \p *this a \ref Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-
-    \return
-    \c false if and only if the meet of \p *this and \p y is empty.
-  */
-  template <typename From>
-  typename Enable_If<Is_Interval<From>::value, bool>::type
-  simplify_using_context_assign(const From& y);
-
-  /*! \brief
-    Assigns to \p *this an interval having empty intersection with \p y.
-    The assigned interval should be as large as possible.
-  */
-  template <typename From>
-  typename Enable_If<Is_Interval<From>::value, void>::type
-  empty_intersection_assign(const From& y);
-
-  /*! \brief
-    Refines \p to according to the existential relation \p rel with \p x.
-
-    The \p to interval is restricted to become, upon successful exit,
-    the smallest interval of its type that contains the set
-    \f[
-      \{\,
-        a \in \mathtt{to}
-      \mid
-        \exists b \in \mathtt{x} \st a \mathrel{\mathtt{rel}} b
-      \,\}.
-    \f]
-    \return
-    ???
-  */
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  refine_existential(Relation_Symbol rel, const From& x);
-
-  /*! \brief
-    Refines \p to so that it satisfies the universal relation \p rel with \p x.
-
-    The \p to interval is restricted to become, upon successful exit,
-    the smallest interval of its type that contains the set
-    \f[
-      \{\,
-        a \in \mathtt{to}
-      \mid
-        \forall b \in \mathtt{x} \itc a \mathrel{\mathtt{rel}} b
-      \,\}.
-    \f]
-    \return
-    ???
-  */
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  refine_universal(Relation_Symbol rel, const From& x);
-
-  template <typename From>
-  typename Enable_If<Is_Singleton<From>::value
-                     || Is_Interval<From>::value, I_Result>::type
-  neg_assign(const From& x);
-
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
-  add_assign(const From1& x, const From2& y);
-
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
-  sub_assign(const From1& x, const From2& y);
-
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
-  mul_assign(const From1& x, const From2& y);
-
-  template <typename From1, typename From2>
-  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
-  div_assign(const From1& x, const From2& y);
-
-  template <typename From, typename Iterator>
-  typename Enable_If<Is_Interval<From>::value, void>::type
-  CC76_widening_assign(const From& y, Iterator first, Iterator last);
-
-private:
-  Boundary lower_;
-  Boundary upper_;
-};
-
-//! Swaps \p x with \p y.
-/*! \relates Interval */
-template <typename Boundary, typename Info>
-void swap(Interval<Boundary, Info>& x, Interval<Boundary, Info>& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Interval.inlines.hh"
-#include "Interval.templates.hh"
-
-#endif // !defined(PPL_Interval_defs_hh)
diff --git a/src/Interval.inlines.hh b/src/Interval.inlines.hh
deleted file mode 100644
index e2e3932..0000000
--- a/src/Interval.inlines.hh
+++ /dev/null
@@ -1,1151 +0,0 @@
-/* Inline functions for the Interval class and its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Interval_inlines_hh
-#define PPL_Interval_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Boundary, typename Info>
-inline memory_size_type
-Interval<Boundary, Info>::external_memory_in_bytes() const {
-  return Parma_Polyhedra_Library::external_memory_in_bytes(lower())
-    + Parma_Polyhedra_Library::external_memory_in_bytes(upper());
-}
-
-template <typename Boundary, typename Info>
-inline memory_size_type
-Interval<Boundary, Info>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename Boundary, typename Info>
-inline void
-Interval<Boundary, Info>::m_swap(Interval<Boundary, Info>& y) {
-  using std::swap;
-  swap(lower(), y.lower());
-  swap(upper(), y.upper());
-  swap(info(), y.info());
-}
-
-template <typename Boundary, typename Info>
-inline bool
-f_is_empty(const Interval<Boundary, Info>& x) {
-  return x.is_empty();
-}
-template <typename Boundary, typename Info>
-inline bool
-f_is_singleton(const Interval<Boundary, Info>& x) {
-  return x.is_singleton();
-}
-template <typename Boundary, typename Info>
-inline int
-infinity_sign(const Interval<Boundary, Info>& x) {
-  return x.infinity_sign();
-}
-
-namespace Interval_NS {
-
-template <typename Boundary, typename Info>
-inline const Boundary&
-f_lower(const Interval<Boundary, Info>& x) {
-  return x.lower();
-}
-template <typename Boundary, typename Info>
-inline const Boundary&
-f_upper(const Interval<Boundary, Info>& x) {
-  return x.upper();
-}
-template <typename Boundary, typename Info>
-inline const Info&
-f_info(const Interval<Boundary, Info>& x) {
-  return x.info();
-}
-
-struct Scalar_As_Interval_Policy {
-  const_bool_nodef(may_be_empty, true);
-  const_bool_nodef(may_contain_infinity, true);
-  const_bool_nodef(check_inexact, false);
-};
-
-typedef Interval_Info_Null<Scalar_As_Interval_Policy>
-Scalar_As_Interval_Info;
-
-const Scalar_As_Interval_Info SCALAR_INFO;
-
-typedef Interval_Info_Null_Open<Scalar_As_Interval_Policy>
-Scalar_As_Interval_Info_Open;
-
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value, const T&>::type
-f_lower(const T& x) {
-  return x;
-}
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value, const T&>::type
-f_upper(const T& x) {
-  return x;
-}
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value,
-                          const Scalar_As_Interval_Info&>::type
-f_info(const T&) {
-  return SCALAR_INFO;
-}
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value,
-                          Scalar_As_Interval_Info_Open>::type
-f_info(const T&, bool open) {
-  return Scalar_As_Interval_Info_Open(open);
-}
-
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value, bool>::type
-f_is_empty(const T& x) {
-  return is_not_a_number(x);
-}
-
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value, bool>::type
-f_is_singleton(const T& x) {
-  return !f_is_empty(x);
-}
-
-} // namespace Interval_NS
-
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value
-                          || Is_Interval<T>::value, bool>::type
-is_singleton_integer(const T& x) {
-  return is_singleton(x) && is_integer(f_lower(x));
-}
-
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value
-                          || Is_Interval<T>::value, bool>::type
-check_empty_arg(const T& x) {
-  if (f_info(x).may_be_empty)
-    return f_is_empty(x);
-  else {
-    PPL_ASSERT(!f_is_empty(x));
-    return false;
-  }
-}
-
-template <typename T1, typename T2>
-inline typename Enable_If<((Is_Singleton<T1>::value
-                            || Is_Interval<T1>::value)
-			   && (Is_Singleton<T2>::value
-                               || Is_Interval<T2>::value)
-			   && (Is_Interval<T1>::value
-                               || Is_Interval<T2>::value)),
-			  bool>::type
-operator==(const T1& x, const T2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(x))
-    return check_empty_arg(y);
-  else if (check_empty_arg(y))
-    return false;
-  return eq(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y))
-    && eq(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y));
-}
-
-template <typename T1, typename T2>
-inline typename Enable_If<((Is_Singleton<T1>::value
-                            || Is_Interval<T1>::value)
-			   && (Is_Singleton<T2>::value
-                               || Is_Interval<T2>::value)
-			   && (Is_Interval<T1>::value
-                               || Is_Interval<T2>::value)),
-			  bool>::type
-operator!=(const T1& x, const T2& y) {
-  return !(x == y);
-}
-
-template <typename Boundary, typename Info>
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value
-                          || Is_Interval<T>::value, bool>::type
-Interval<Boundary, Info>::contains(const T& y) const {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(y))
-    return true;
-  if (check_empty_arg(*this))
-    return false;
-  return le(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
-    && ge(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y));
-}
-
-template <typename Boundary, typename Info>
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value
-                          || Is_Interval<T>::value, bool>::type
-Interval<Boundary, Info>::strictly_contains(const T& y) const {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(y))
-    return !check_empty_arg(*this);
-  if (check_empty_arg(*this))
-    return false;
-  return (lt(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
-	  && ge(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)))
-    || (le(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
-	&& gt(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)));
-}
-
-template <typename Boundary, typename Info>
-template <typename T>
-inline typename Enable_If<Is_Singleton<T>::value
-                          || Is_Interval<T>::value, bool>::type
-Interval<Boundary, Info>::is_disjoint_from(const T& y) const {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(*this) || check_empty_arg(y))
-    return true;
-  return gt(LOWER, lower(), info(), UPPER, f_upper(y), f_info(y))
-    || lt(UPPER, upper(), info(), LOWER, f_lower(y), f_info(y));
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>::assign(const From& x) {
-  PPL_ASSERT(f_OK(x));
-  if (check_empty_arg(x))
-    return assign(EMPTY);
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl = Boundary_NS::assign(LOWER, lower(), to_info,
-				  LOWER, f_lower(x), f_info(x));
-  Result ru = Boundary_NS::assign(UPPER, upper(), to_info,
-				  UPPER, f_upper(x), f_info(x));
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>::join_assign(const From& x) {
-  PPL_ASSERT(f_OK(x));
-  if (check_empty_arg(*this))
-    return assign(x);
-  if (check_empty_arg(x))
-    return combine(V_EQ, V_EQ);
-  Result rl, ru;
-  rl = min_assign(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
-  ru = max_assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::join_assign(const From1& x, const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(x))
-    return assign(y);
-  if (check_empty_arg(y))
-    return assign(x);
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl, ru;
-  rl = min_assign(LOWER, lower(), to_info,
-		  LOWER, f_lower(x), f_info(x),
-		  LOWER, f_lower(y), f_info(y));
-  ru = max_assign(UPPER, upper(), to_info,
-		  UPPER, f_upper(x), f_info(x),
-		  UPPER, f_upper(y), f_info(y));
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename Boundary, typename Info>
-template <typename Type>
-inline typename Enable_If<Is_Singleton<Type>::value
-                          || Is_Interval<Type>::value, bool>::type
-Interval<Boundary, Info>::can_be_exactly_joined_to(const Type& x) const {
-  PPL_DIRTY_TEMP(Boundary, b);
-  if (gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x))) {
-    b = lower();
-    return eq(LOWER, b, info(), UPPER, f_upper(x), f_info(x));
-  }
-  else if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x))) {
-    b = upper();
-    return eq(UPPER, b, info(), LOWER, f_lower(x), f_info(x));
-  }
-  return true;
-}
-
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>::intersect_assign(const From& x) {
-  PPL_ASSERT(f_OK(x));
-  max_assign(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
-  min_assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
-  PPL_ASSERT(OK());
-  return I_ANY;
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::intersect_assign(const From1& x,
-                                                 const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  max_assign(LOWER, lower(), to_info,
-             LOWER, f_lower(x), f_info(x),
-             LOWER, f_lower(y), f_info(y));
-  min_assign(UPPER, upper(), to_info,
-             UPPER, f_upper(x), f_info(x),
-             UPPER, f_upper(y), f_info(y));
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return I_NOT_EMPTY;
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>::difference_assign(const From& x) {
-  PPL_ASSERT(f_OK(x));
-  if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x))
-      || gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
-    return combine(V_EQ, V_EQ);
-  bool nl = ge(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
-  bool nu = le(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
-  Result rl = V_EQ, ru = V_EQ;
-  if (nl) {
-    if (nu)
-      return assign(EMPTY);
-    else {
-      info().clear_boundary_properties(LOWER);
-      rl = complement(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x));
-    }
-  }
-  else if (nu) {
-    info().clear_boundary_properties(UPPER);
-    ru = complement(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x));
-  }
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::difference_assign(const From1& x,
-                                                  const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  if (lt(UPPER, f_upper(x), f_info(x), LOWER, f_lower(y), f_info(y))
-      || gt(LOWER, f_lower(x), f_info(x), UPPER, f_upper(y), f_info(y)))
-    return assign(x);
-  bool nl = ge(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y));
-  bool nu = le(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y));
-  Result rl = V_EQ, ru = V_EQ;
-  if (nl) {
-    if (nu)
-      return assign(EMPTY);
-    else {
-      rl = complement(LOWER, lower(), info(), UPPER, f_upper(y), f_info(y));
-      ru = Boundary_NS::assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
-    }
-  }
-  else if (nu) {
-    ru = complement(UPPER, upper(), info(), LOWER, f_lower(y), f_info(y));
-    rl = Boundary_NS::assign(LOWER, lower(), info(),
-                             LOWER, f_lower(x), f_info(x));
-  }
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>
-::refine_existential(Relation_Symbol rel, const From& x) {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(f_OK(x));
-  if (check_empty_arg(x))
-    return assign(EMPTY);
-  switch (rel) {
-  case LESS_THAN:
-    {
-      if (lt(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(UPPER);
-      Boundary_NS::assign(UPPER, upper(), info(),
-			  UPPER, f_upper(x), f_info(x), true);
-      return I_ANY;
-    }
-  case LESS_OR_EQUAL:
-    {
-      if (le(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(UPPER);
-      Boundary_NS::assign(UPPER, upper(), info(),
-			  UPPER, f_upper(x), f_info(x));
-      return I_ANY;
-    }
-  case GREATER_THAN:
-    {
-      if (gt(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(LOWER);
-      Boundary_NS::assign(LOWER, lower(), info(),
-			  LOWER, f_lower(x), f_info(x), true);
-      return I_ANY;
-    }
-  case GREATER_OR_EQUAL:
-    {
-      if (ge(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(LOWER);
-      Boundary_NS::assign(LOWER, lower(), info(),
-			  LOWER, f_lower(x), f_info(x));
-      return I_ANY;
-    }
-  case EQUAL:
-    return intersect_assign(x);
-  case NOT_EQUAL:
-    {
-      if (!f_is_singleton(x))
-	return combine(V_EQ, V_EQ);
-      if (check_empty_arg(*this))
-	return I_EMPTY;
-      if (eq(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	remove_inf();
-      if (eq(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	remove_sup();
-      return I_ANY;
-    }
-  default:
-    PPL_UNREACHABLE;
-    return I_EMPTY;
-  }
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>::refine_universal(Relation_Symbol rel,
-                                                 const From& x) {
-  PPL_ASSERT(OK());
-  PPL_ASSERT(f_OK(x));
-  if (check_empty_arg(x))
-    return combine(V_EQ, V_EQ);
-  switch (rel) {
-  case LESS_THAN:
-    {
-      if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(UPPER);
-      Result ru = Boundary_NS::assign(UPPER, upper(), info(),
-				      LOWER, f_lower(x), SCALAR_INFO,
-                                      !is_open(LOWER, f_lower(x), f_info(x)));
-      PPL_USED(ru);
-      return I_ANY;
-    }
-  case LESS_OR_EQUAL:
-    {
-      if (le(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(UPPER);
-      Result ru = Boundary_NS::assign(UPPER, upper(), info(),
-				      LOWER, f_lower(x), SCALAR_INFO);
-      PPL_USED(ru);
-      return I_ANY;
-    }
-  case GREATER_THAN:
-    {
-      if (gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(LOWER);
-      Result rl = Boundary_NS::assign(LOWER, lower(), info(),
-				      UPPER, f_upper(x), SCALAR_INFO,
-                                      !is_open(UPPER, f_upper(x), f_info(x)));
-      PPL_USED(rl);
-      return I_ANY;
-    }
-  case GREATER_OR_EQUAL:
-    {
-      if (ge(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
-      info().clear_boundary_properties(LOWER);
-      Result rl = Boundary_NS::assign(LOWER, lower(), info(),
-				      UPPER, f_upper(x), SCALAR_INFO);
-      PPL_USED(rl);
-      return I_ANY;
-    }
-  case EQUAL:
-    if (!f_is_singleton(x))
-      return assign(EMPTY);
-    return intersect_assign(x);
-  case NOT_EQUAL:
-    {
-      if (check_empty_arg(*this))
-	return I_EMPTY;
-      if (eq(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	remove_inf();
-      if (eq(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	remove_sup();
-      return I_ANY;
-    }
-  default:
-    PPL_UNREACHABLE;
-    return I_EMPTY;
-  }
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From>
-inline typename Enable_If<Is_Singleton<From>::value
-                          || Is_Interval<From>::value, I_Result>::type
-Interval<To_Boundary, To_Info>::neg_assign(const From& x) {
-  PPL_ASSERT(f_OK(x));
-  if (check_empty_arg(x))
-    return assign(EMPTY);
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl, ru;
-  PPL_DIRTY_TEMP(To_Boundary, to_lower);
-  rl = Boundary_NS::neg_assign(LOWER, to_lower, to_info, UPPER, f_upper(x), f_info(x));
-  ru = Boundary_NS::neg_assign(UPPER, upper(), to_info, LOWER, f_lower(x), f_info(x));
-  assign_or_swap(lower(), to_lower);
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::add_assign(const From1& x, const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(x) || check_empty_arg(y))
-    return assign(EMPTY);
-  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
-  if (inf_sign != 0) {
-    if (Parma_Polyhedra_Library::infinity_sign(y) == -inf_sign)
-      return assign(EMPTY);
-  }
-  else
-    inf_sign = Parma_Polyhedra_Library::infinity_sign(y);
-  if (inf_sign < 0)
-    return assign(MINUS_INFINITY);
-  else if (inf_sign > 0)
-    return assign(PLUS_INFINITY);
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl = Boundary_NS::add_assign(LOWER, lower(), to_info,
-				      LOWER, f_lower(x), f_info(x),
-				      LOWER, f_lower(y), f_info(y));
-  Result ru = Boundary_NS::add_assign(UPPER, upper(), to_info,
-				      UPPER, f_upper(x), f_info(x),
-				      UPPER, f_upper(y), f_info(y));
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::sub_assign(const From1& x, const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(x) || check_empty_arg(y))
-    return assign(EMPTY);
-  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
-  if (inf_sign != 0) {
-    if (Parma_Polyhedra_Library::infinity_sign(y) == inf_sign)
-      return assign(EMPTY);
-  }
-  else
-    inf_sign = -Parma_Polyhedra_Library::infinity_sign(y);
-  if (inf_sign < 0)
-    return assign(MINUS_INFINITY);
-  else if (inf_sign > 0)
-    return assign(PLUS_INFINITY);
-
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl, ru;
-  PPL_DIRTY_TEMP(To_Boundary, to_lower);
-  rl = Boundary_NS::sub_assign(LOWER, to_lower, to_info,
-			       LOWER, f_lower(x), f_info(x),
-			       UPPER, f_upper(y), f_info(y));
-  ru = Boundary_NS::sub_assign(UPPER, upper(), to_info,
-			       UPPER, f_upper(x), f_info(x),
-			       LOWER, f_lower(y), f_info(y));
-  assign_or_swap(lower(), to_lower);
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-/**
-+---------+-----------+-----------+-----------------+
-|    *    |  yl > 0   |  yu < 0   |  yl < 0, yu > 0 |
-+---------+-----------+-----------+-----------------+
-| xl > 0  |xl*yl,xu*yu|xu*yl,xl*yu|   xu*yl,xu*yu   |
-+---------+-----------+-----------+-----------------+
-| xu < 0  |xl*yu,xu*yl|xu*yu,xl*yl|   xl*yu,xl*yl   |
-+---------+-----------+-----------+-----------------+
-|xl<0 xu>0|xl*yu,xu*yu|xu*yl,xl*yl|min(xl*yu,xu*yl),|
-|         |           |           |max(xl*yl,xu*yu) |
-+---------+-----------+-----------+-----------------+
-**/
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::mul_assign(const From1& x, const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(x) || check_empty_arg(y))
-    return assign(EMPTY);
-  int xls = sgn_b(LOWER, f_lower(x), f_info(x));
-  int xus = (xls > 0) ? 1 : sgn_b(UPPER, f_upper(x), f_info(x));
-  int yls = sgn_b(LOWER, f_lower(y), f_info(y));
-  int yus = (yls > 0) ? 1 : sgn_b(UPPER, f_upper(y), f_info(y));
-  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
-  int ls, us;
-  if (inf_sign != 0) {
-    ls = yls;
-    us = yus;
-    goto inf;
-  }
-  else {
-    inf_sign = Parma_Polyhedra_Library::infinity_sign(y);
-    if (inf_sign != 0) {
-      ls = xls;
-      us = xus;
-    inf:
-      if (ls == 0 && us == 0)
-	return assign(EMPTY);
-      if (ls == -us)
-	return set_infinities();
-      if (ls < 0 || us < 0)
-	inf_sign = -inf_sign;
-      if (inf_sign < 0)
-	return assign(MINUS_INFINITY);
-      else
-	return assign(PLUS_INFINITY);
-    }
-  }
-
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl, ru;
-  PPL_DIRTY_TEMP(To_Boundary, to_lower);
-
-  if (xls >= 0) {
-    if (yls >= 0) {
-      // 0 <= xl <= xu, 0 <= yl <= yu
-      rl = mul_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
-      ru = mul_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
-    }
-    else if (yus <= 0) {
-      // 0 <= xl <= xu, yl <= yu <= 0
-      rl = mul_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
-      ru = mul_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
-    }
-    else {
-      // 0 <= xl <= xu, yl < 0 < yu
-      rl = mul_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
-      ru = mul_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
-    }
-  }
-  else if (xus <= 0) {
-    if (yls >= 0) {
-      // xl <= xu <= 0, 0 <= yl <= yu
-      rl = mul_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
-      ru = mul_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
-    }
-    else if (yus <= 0) {
-      // xl <= xu <= 0, yl <= yu <= 0
-      rl = mul_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
-      ru = mul_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
-    }
-    else {
-      // xl <= xu <= 0, yl < 0 < yu
-      rl = mul_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
-      ru = mul_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
-    }
-  }
-  else if (yls >= 0) {
-    // xl < 0 < xu, 0 <= yl <= yu
-    rl = mul_assign_z(LOWER, to_lower, to_info,
-		      LOWER, f_lower(x), f_info(x), xls,
-		      UPPER, f_upper(y), f_info(y), yus);
-    ru = mul_assign_z(UPPER, upper(), to_info,
-		      UPPER, f_upper(x), f_info(x), xus,
-		      UPPER, f_upper(y), f_info(y), yus);
-  }
-  else if (yus <= 0) {
-    // xl < 0 < xu, yl <= yu <= 0
-    rl = mul_assign_z(LOWER, to_lower, to_info,
-		      UPPER, f_upper(x), f_info(x), xus,
-		      LOWER, f_lower(y), f_info(y), yls);
-    ru = mul_assign_z(UPPER, upper(), to_info,
-		      LOWER, f_lower(x), f_info(x), xls,
-		      LOWER, f_lower(y), f_info(y), yls);
-  }
-  else {
-    // xl < 0 < xu, yl < 0 < yu
-    PPL_DIRTY_TEMP(To_Boundary, tmp);
-    PPL_DIRTY_TEMP(To_Info, tmp_info);
-    tmp_info.clear();
-    Result tmp_r;
-    tmp_r = Boundary_NS::mul_assign(LOWER, tmp, tmp_info,
-				    UPPER, f_upper(x), f_info(x),
-				    LOWER, f_lower(y), f_info(y));
-    rl = Boundary_NS::mul_assign(LOWER, to_lower, to_info,
-				 LOWER, f_lower(x), f_info(x),
-				 UPPER, f_upper(y), f_info(y));
-    if (gt(LOWER, to_lower, to_info, LOWER, tmp, tmp_info)) {
-      to_lower = tmp;
-      rl = tmp_r;
-    }
-    tmp_info.clear();
-    tmp_r = Boundary_NS::mul_assign(UPPER, tmp, tmp_info,
-				    UPPER, f_upper(x), f_info(x),
-				    UPPER, f_upper(y), f_info(y));
-    ru = Boundary_NS::mul_assign(UPPER, upper(), to_info,
-				 LOWER, f_lower(x), f_info(x),
-				 LOWER, f_lower(y), f_info(y));
-    if (lt(UPPER, upper(), to_info, UPPER, tmp, tmp_info)) {
-      upper() = tmp;
-      ru = tmp_r;
-    }
-  }
-  assign_or_swap(lower(), to_lower);
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-/**
-+-----------+-----------+-----------+
-|     /     |  yu < 0   |  yl > 0   |
-+-----------+-----------+-----------+
-|   xu<=0   |xu/yl,xl/yu|xl/yl,xu/yu|
-+-----------+-----------+-----------+
-|xl<=0 xu>=0|xu/yu,xl/yu|xl/yl,xu/yl|
-+-----------+-----------+-----------+
-|   xl>=0   |xu/yu,xl/yl|xl/yu,xu/yl|
-+-----------+-----------+-----------+
-**/
-template <typename To_Boundary, typename To_Info>
-template <typename From1, typename From2>
-inline typename Enable_If<((Is_Singleton<From1>::value
-                            || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
-                               || Is_Interval<From2>::value)), I_Result>::type
-Interval<To_Boundary, To_Info>::div_assign(const From1& x, const From2& y) {
-  PPL_ASSERT(f_OK(x));
-  PPL_ASSERT(f_OK(y));
-  if (check_empty_arg(x) || check_empty_arg(y))
-    return assign(EMPTY);
-  int yls = sgn_b(LOWER, f_lower(y), f_info(y));
-  int yus = (yls > 0) ? 1 : sgn_b(UPPER, f_upper(y), f_info(y));
-  if (yls == 0 && yus == 0)
-    return assign(EMPTY);
-  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
-  if (inf_sign != 0) {
-    if (Parma_Polyhedra_Library::infinity_sign(y) != 0)
-      return assign(EMPTY);
-    if (yls == -yus)
-      return set_infinities();
-    if (yls < 0 || yus < 0)
-    inf_sign = -inf_sign;
-    if (inf_sign < 0)
-      return assign(MINUS_INFINITY);
-    else
-      return assign(PLUS_INFINITY);
-  }
-  int xls = sgn_b(LOWER, f_lower(x), f_info(x));
-  int xus = (xls > 0) ? 1 : sgn_b(UPPER, f_upper(x), f_info(x));
-
-  PPL_DIRTY_TEMP(To_Info, to_info);
-  to_info.clear();
-  Result rl, ru;
-  PPL_DIRTY_TEMP(To_Boundary, to_lower);
-  if (yls >= 0) {
-    if (xls >= 0) {
-      rl = div_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
-      ru = div_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
-    }
-    else if (xus <= 0) {
-      rl = div_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
-      ru = div_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
-    }
-    else {
-      rl = div_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
-      ru = div_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
-    }
-  }
-  else if (yus <= 0) {
-    if (xls >= 0) {
-      rl = div_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
-      ru = div_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
-    }
-    else if (xus <= 0) {
-      rl = div_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
-      ru = div_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
-    }
-    else {
-      rl = div_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
-      ru = div_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
-    }
-  }
-  else {
-    return static_cast<I_Result>(assign(UNIVERSE) | I_SINGULARITIES);
-  }
-  assign_or_swap(lower(), to_lower);
-  assign_or_swap(info(), to_info);
-  PPL_ASSERT(OK());
-  return combine(rl, ru);
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator+(const Interval<B, Info>& x, const T& y) {
-  Interval<B, Info> z;
-  z.add_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator+(const T& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.add_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info>
-inline Interval<B, Info>
-operator+(const Interval<B, Info>& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.add_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator-(const Interval<B, Info>& x, const T& y) {
-  Interval<B, Info> z;
-  z.sub_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator-(const T& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.sub_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info>
-inline Interval<B, Info>
-operator-(const Interval<B, Info>& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.sub_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator*(const Interval<B, Info>& x, const T& y) {
-  Interval<B, Info> z;
-  z.mul_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator*(const T& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.mul_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info>
-inline Interval<B, Info>
-operator*(const Interval<B, Info>& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.mul_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator/(const Interval<B, Info>& x, const T& y) {
-  Interval<B, Info> z;
-  z.div_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info, typename T>
-inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
-operator/(const T& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.div_assign(x, y);
-  return z;
-}
-
-template <typename B, typename Info>
-inline Interval<B, Info>
-operator/(const Interval<B, Info>& x, const Interval<B, Info>& y) {
-  Interval<B, Info> z;
-  z.div_assign(x, y);
-  return z;
-}
-
-template <typename Boundary, typename Info>
-inline std::ostream&
-operator<<(std::ostream& os, const Interval<Boundary, Info>& x) {
-  if (check_empty_arg(x))
-    return os << "[]";
-  if (x.is_singleton()) {
-    output(os, x.lower(), Numeric_Format(), ROUND_NOT_NEEDED);
-    return os;
-  }
-  os << (x.lower_is_open() ? "(" : "[");
-  if (x.info().get_boundary_property(LOWER, SPECIAL))
-    os << "-inf";
-  else
-    output(os, x.lower(), Numeric_Format(), ROUND_NOT_NEEDED);
-  os << ", ";
-  if (x.info().get_boundary_property(UPPER, SPECIAL))
-    os << "+inf";
-  else
-    output(os, x.upper(), Numeric_Format(), ROUND_NOT_NEEDED);
-  os << (x.upper_is_open() ? ")" : "]");
-  return os;
-}
-
-template <typename Boundary, typename Info>
-inline void
-Interval<Boundary, Info>::ascii_dump(std::ostream& s) const {
-  using Parma_Polyhedra_Library::ascii_dump;
-  s << "info ";
-  info().ascii_dump(s);
-  s << " lower ";
-  ascii_dump(s, lower());
-  s << " upper ";
-  ascii_dump(s, upper());
-  s << '\n';
-}
-
-template <typename Boundary, typename Info>
-inline bool
-Interval<Boundary, Info>::ascii_load(std::istream& s) {
-  using Parma_Polyhedra_Library::ascii_load;
-  std::string str;
-  if (!(s >> str) || str != "info")
-    return false;
-  if (!info().ascii_load(s))
-    return false;
-  if (!(s >> str) || str != "lower")
-    return false;
-  if (!ascii_load(s, lower()))
-    return false;
-  if (!(s >> str) || str != "upper")
-    return false;
-  if (!ascii_load(s, upper()))
-    return false;
-  PPL_ASSERT(OK());
-  return true;
-}
-
-/*! \brief
-  Helper class to select the appropriate numerical type to perform
-  boundary computations so as to reduce the chances of overflow without
-  incurring too much overhead.
-*/
-template <typename Interval_Boundary_Type> struct Select_Temp_Boundary_Type;
-
-template <typename Interval_Boundary_Type>
-struct Select_Temp_Boundary_Type {
-  typedef Interval_Boundary_Type type;
-};
-
-#if PPL_SUPPORTED_DOUBLE
-template <>
-struct Select_Temp_Boundary_Type<float> {
-  typedef double type;
-};
-#endif
-
-template <>
-struct Select_Temp_Boundary_Type<char> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<signed char> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<unsigned char> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<signed short> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<unsigned short> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<signed int> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<unsigned int> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<signed long> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<unsigned long> {
-  typedef signed long long type;
-};
-
-template <>
-struct Select_Temp_Boundary_Type<unsigned long long> {
-  typedef signed long long type;
-};
-
-/*! \relates Interval */
-template <typename Boundary, typename Info>
-inline void
-swap(Interval<Boundary, Info>& x, Interval<Boundary, Info>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Interval_inlines_hh)
diff --git a/src/Interval.templates.hh b/src/Interval.templates.hh
deleted file mode 100644
index d785ac1..0000000
--- a/src/Interval.templates.hh
+++ /dev/null
@@ -1,402 +0,0 @@
-/* Interval class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Interval_templates_hh
-#define PPL_Interval_templates_hh 1
-
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Boundary, typename Info>
-template <typename C>
-typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
-Interval<Boundary, Info>::lower_extend(const C& c) {
-  PPL_ASSERT(OK());
-  bool open;
-  switch (c.rel()) {
-  case V_LGE:
-    return lower_extend();
-  case V_NAN:
-    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
-  case V_GT:
-    open = true;
-    break;
-  case V_GE: // Fall through.
-  case V_EQ:
-    open = false;
-    break;
-  default:
-    PPL_UNREACHABLE;
-    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
-  }
-  min_assign(LOWER, lower(), info(), LOWER, c.value(), f_info(c.value(), open));
-  PPL_ASSERT(OK());
-  return I_ANY;
-}
-
-template <typename Boundary, typename Info>
-template <typename C>
-typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
-Interval<Boundary, Info>::upper_extend(const C& c) {
-  PPL_ASSERT(OK());
-  bool open;
-  switch (c.rel()) {
-  case V_LGE:
-    return lower_extend();
-  case V_NAN:
-    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
-  case V_LT:
-    open = true;
-    break;
-  case V_LE: // Fall through.
-  case V_EQ:
-    open = false;
-    break;
-  default:
-    PPL_UNREACHABLE;
-    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
-  }
-  max_assign(UPPER, upper(), info(), UPPER, c.value(), f_info(c.value(), open));
-  PPL_ASSERT(OK());
-  return I_ANY;
-}
-
-template <typename Boundary, typename Info>
-template <typename From, typename Iterator>
-typename Enable_If<Is_Interval<From>::value, void>::type
-Interval<Boundary, Info>::CC76_widening_assign(const From& y,
-					       Iterator first,
-					       Iterator last) {
-  // We assume that `y' is contained in or equal to `*this'.
-  PPL_ASSERT(contains(y));
-  Interval<Boundary, Info>& x = *this;
-
-  // Upper bound.
-  if (!x.upper_is_boundary_infinity()) {
-    Boundary& x_ub = x.upper();
-    const Boundary& y_ub = y.upper();
-    PPL_ASSERT(!y.upper_is_boundary_infinity() && y_ub <= x_ub);
-    if (y_ub < x_ub) {
-      Iterator k = std::lower_bound(first, last, x_ub);
-      if (k != last) {
-	if (x_ub < *k)
-	  x_ub = *k;
-      }
-      else
-	x.upper_extend();
-    }
-  }
-
-  // Lower bound.
-  if (!x.lower_is_boundary_infinity()) {
-    Boundary& x_lb = x.lower();
-    const Boundary& y_lb = y.lower();
-    PPL_ASSERT(!y.lower_is_boundary_infinity() && y_lb >= x_lb);
-    if (y_lb > x_lb) {
-      Iterator k = std::lower_bound(first, last, x_lb);
-      if (k != last) {
-	if (x_lb < *k) {
-	  if (k != first)
-	    x_lb = *--k;
-	  else
-	    x.lower_extend();
-	}
-      }
-      else {
-        if (k != first)
-          x_lb = *--k;
-        else
-          x.lower_extend();
-      }
-    }
-  }
-}
-
-template <typename Boundary, typename Info>
-Interval<Boundary, Info>::Interval(const char* s) {
-  // Get the lower bound.
-  Boundary lower_bound;
-  Result lower_r = assign_r(lower_bound, s, ROUND_DOWN);
-  if (lower_r == V_CVT_STR_UNK || lower_r == V_NAN) {
-    throw std::invalid_argument("PPL::Interval(const char* s)"
-                                " with s invalid");
-  }
-  lower_r = result_relation_class(lower_r);
-
-  // Get the upper bound.
-  Boundary upper_bound;
-  Result upper_r = assign_r(upper_bound, s, ROUND_UP);
-  PPL_ASSERT(upper_r != V_CVT_STR_UNK && upper_r != V_NAN);
-  upper_r = result_relation_class(upper_r);
-
-  // Build the interval.
-  bool lower_open = false;
-  bool upper_open = false;
-  bool lower_boundary_infinity = false;
-  bool upper_boundary_infinity = false;
-  switch (lower_r) {
-  case V_EQ: // Fall through.
-  case V_GE:
-    break;
-  case V_GT:
-    lower_open = true;
-    break;
-  case V_GT_MINUS_INFINITY:
-    lower_open = true;
-    // Fall through.
-  case V_EQ_MINUS_INFINITY:
-    lower_boundary_infinity = true;
-    break;
-  case V_EQ_PLUS_INFINITY: // Fall through.
-  case V_LT_PLUS_INFINITY:
-    if (upper_r == V_EQ_PLUS_INFINITY || upper_r == V_LT_PLUS_INFINITY)
-      assign(UNIVERSE);
-    else
-      assign(EMPTY);
-    break;
-  default:
-    PPL_UNREACHABLE;
-    break;
-  }
-  switch (upper_r) {
-  case V_EQ: // Fall through.
-  case V_LE:
-    break;
-  case V_LT:
-    upper_open = true;
-    break;
-  case V_EQ_MINUS_INFINITY: // Fall through.
-  case V_GT_MINUS_INFINITY:
-    if (lower_r == V_EQ_MINUS_INFINITY || lower_r == V_GT_MINUS_INFINITY)
-      assign(UNIVERSE);
-    else
-      assign(EMPTY);
-    break;
-  case V_LT_PLUS_INFINITY:
-    upper_open = true;
-    // Fall through.
-  case V_EQ_PLUS_INFINITY:
-    upper_boundary_infinity = true;
-    break;
-  default:
-    PPL_UNREACHABLE;
-    break;
-  }
-
-  if (!lower_boundary_infinity
-      && !upper_boundary_infinity
-      && (lower_bound > upper_bound
-          || (lower_open && lower_bound == upper_bound)))
-    assign(EMPTY);
-  else {
-    if (lower_boundary_infinity)
-      set_minus_infinity(LOWER, lower(), info(), lower_open);
-    else
-      Boundary_NS::assign(LOWER, lower(), info(),
-                          LOWER, lower_bound, SCALAR_INFO, lower_open);
-    if (upper_boundary_infinity)
-      set_plus_infinity(UPPER, upper(), info(), upper_open);
-    else
-      Boundary_NS::assign(UPPER, upper(), info(),
-                          UPPER, upper_bound, SCALAR_INFO, upper_open);
-  }
-}
-
-
-template <typename Boundary, typename Info>
-inline std::istream&
-operator>>(std::istream& is, Interval<Boundary, Info>& x) {
-  Boundary lower_bound;
-  Boundary upper_bound;
-  bool lower_boundary_infinity = false;
-  bool upper_boundary_infinity = false;
-  bool lower_open = false;
-  bool upper_open = false;
-  Result lower_r;
-  Result upper_r;
-
-  // Eat leading white space.
-  char c;
-  do {
-    if (!is.get(c))
-      goto fail;
-  } while (is_space(c));
-
-  // Get the opening parenthesis and handle the empty interval case.
-  if (c == '(')
-    lower_open = true;
-  else if (c == '[') {
-    if (!is.get(c))
-      goto fail;
-    if (c == ']') {
-      // Empty interval.
-      x.assign(EMPTY);
-      return is;
-    }
-    else
-      is.unget();
-  }
-  else
-    goto unexpected;
-
-  // Get the lower bound.
-  lower_r = input(lower_bound, is, ROUND_DOWN);
-  if (lower_r == V_CVT_STR_UNK || lower_r == V_NAN)
-    goto fail;
-  lower_r = result_relation_class(lower_r);
-
-  // Match the comma separating the lower and upper bounds.
-  do {
-    if (!is.get(c))
-      goto fail;
-  } while (is_space(c));
-  if (c != ',')
-    goto unexpected;
-
-  // Get the upper bound.
-  upper_r = input(upper_bound, is, ROUND_UP);
-  if (upper_r == V_CVT_STR_UNK || upper_r == V_NAN)
-    goto fail;
-  upper_r = result_relation_class(upper_r);
-
-  // Get the closing parenthesis.
-  do {
-    if (!is.get(c))
-      goto fail;
-  } while (is_space(c));
-  if (c == ')')
-    upper_open = true;
-  else if (c != ']') {
-  unexpected:
-    is.unget();
-  fail:
-    is.setstate(std::ios::failbit);
-    return is;
-  }
-
-  // Build interval.
-  switch (lower_r) {
-  case V_EQ: // Fall through.
-  case V_GE:
-    break;
-  case V_GT:
-    lower_open = true;
-    break;
-  case V_GT_MINUS_INFINITY:
-    lower_open = true;
-    // Fall through.
-  case V_EQ_MINUS_INFINITY:
-    lower_boundary_infinity = true;
-    break;
-  case V_EQ_PLUS_INFINITY: // Fall through.
-  case V_LT_PLUS_INFINITY:
-    if (upper_r == V_EQ_PLUS_INFINITY || upper_r == V_LT_PLUS_INFINITY)
-      x.assign(UNIVERSE);
-    else
-      x.assign(EMPTY);
-    return is;
-  default:
-    PPL_UNREACHABLE;
-    break;
-  }
-  switch (upper_r) {
-  case V_EQ: // Fall through.
-  case V_LE:
-    break;
-  case V_LT:
-    upper_open = true;
-    break;
-  case V_GT_MINUS_INFINITY:
-    upper_open = true;
-    // Fall through.
-  case V_EQ_MINUS_INFINITY:
-    if (lower_r == V_EQ_MINUS_INFINITY || lower_r == V_GT_MINUS_INFINITY)
-      x.assign(UNIVERSE);
-    else
-      x.assign(EMPTY);
-    return is;
-  case V_EQ_PLUS_INFINITY: // Fall through.
-  case V_LT_PLUS_INFINITY:
-    upper_boundary_infinity = true;
-    break;
-  default:
-    PPL_UNREACHABLE;
-    break;
-  }
-
-  if (!lower_boundary_infinity
-      && !upper_boundary_infinity
-      && (lower_bound > upper_bound
-	  || (lower_open && lower_bound == upper_bound)))
-    x.assign(EMPTY);
-  else {
-    if (lower_boundary_infinity)
-      set_minus_infinity(LOWER, x.lower(), x.info(), lower_open);
-    else
-      assign(LOWER, x.lower(), x.info(),
-             LOWER, lower_bound, SCALAR_INFO, lower_open);
-    if (upper_boundary_infinity)
-      set_plus_infinity(UPPER, x.upper(), x.info(), upper_open);
-    else
-      assign(UPPER, x.upper(), x.info(),
-             UPPER, upper_bound, SCALAR_INFO, upper_open);
-  }
-  return is;
-}
-
-template <typename Boundary, typename Info>
-template <typename From>
-typename Enable_If<Is_Interval<From>::value, bool>::type
-Interval<Boundary, Info>::simplify_using_context_assign(const From& y) {
-  // FIXME: the following code wrongly assumes that intervals are closed
-  if (lt(UPPER, upper(), info(), LOWER, f_lower(y), f_info(y))) {
-    lower_extend();
-    return false;
-  }
-  if (gt(LOWER, lower(), info(), UPPER, f_upper(y), f_info(y))) {
-    upper_extend();
-    return false;
-  }
-  // Weakening the upper bound.
-  if (!upper_is_boundary_infinity() && !y.upper_is_boundary_infinity()
-      && y.upper() <= upper())
-    upper_extend();
-  // Weakening the lower bound.
-  if (!lower_is_boundary_infinity() && !y.lower_is_boundary_infinity()
-      && y.lower() >= lower())
-    lower_extend();
-  return true;
-}
-
-template <typename Boundary, typename Info>
-template <typename From>
-typename Enable_If<Is_Interval<From>::value, void>::type
-Interval<Boundary, Info>::empty_intersection_assign(const From&) {
-  // FIXME: write me.
-  assign(EMPTY);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Interval_templates_hh)
diff --git a/src/Interval.types.hh b/src/Interval.types.hh
deleted file mode 100644
index 4e75397..0000000
--- a/src/Interval.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Interval_types_hh
-#define PPL_Interval_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Boundary, typename Info>
-class Interval;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Interval_types_hh)
diff --git a/src/Interval_Info.defs.hh b/src/Interval_Info.defs.hh
deleted file mode 100644
index 04fb3e9..0000000
--- a/src/Interval_Info.defs.hh
+++ /dev/null
@@ -1,285 +0,0 @@
-/* Interval_Info class declaration and implementation.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Interval_Info_defs_hh
-#define PPL_Interval_Info_defs_hh 1
-
-#include "Boundary.defs.hh"
-
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Interval_NS {
-
-struct Property {
-  enum Type {
-    CARDINALITY_0_,
-    CARDINALITY_1_,
-    CARDINALITY_IS_
-  };
-  typedef bool Value;
-  static const Value default_value = true;
-  static const Value unsupported_value = false;
-  Property(Type t)
-    : type(t) {
-  }
-  Type type;
-};
-
-const Property CARDINALITY_0(Property::CARDINALITY_0_);
-const Property CARDINALITY_1(Property::CARDINALITY_1_);
-const Property CARDINALITY_IS(Property::CARDINALITY_IS_);
-
-template <typename T>
-inline void
-reset_bits(T& bits) {
-  bits = 0;
-}
-
-template <typename T>
-inline void
-reset_bit(T& bits, unsigned int bit) {
-  bits &= ~(static_cast<T>(1) << bit);
-}
-
-template <typename T>
-inline void
-set_bit(T& bits, unsigned int bit, bool value) {
-  if (value)
-    bits |= static_cast<T>(1) << bit;
-  else
-    reset_bit(bits, bit);
-}
-
-template <typename T>
-inline bool
-get_bit(const T& bits, unsigned int bit) {
-  return (bits & (static_cast<T>(1) << bit)) != 0;
-}
-
-template <typename T>
-inline void
-set_bits(T& bits, unsigned int start, unsigned int len, T value) {
-  bits &= ~(((static_cast<T>(1) << len) - 1) << start);
-  bits |= value << start;
-}
-
-template <typename T>
-inline T
-get_bits(T& bits, unsigned int start, unsigned int len) {
-  return (bits >> start) & ((static_cast<T>(1) << len) - 1);
-}
-
-} // namespace Interval_NS
-
-using namespace Interval_NS;
-using namespace Boundary_NS;
-
-
-template <typename Policy>
-class Interval_Info_Null {
-public:
-  const_bool_nodef(may_be_empty, Policy::may_be_empty);
-  const_bool_nodef(may_contain_infinity, Policy::may_contain_infinity);
-  const_bool_nodef(check_inexact, Policy::check_inexact);
-  const_bool_nodef(store_special, false);
-  const_bool_nodef(store_open, false);
-  const_bool_nodef(cache_empty, false);
-  const_bool_nodef(cache_singleton, false);
-  Interval_Info_Null() {
-  }
-  void clear() {
-  }
-  void clear_boundary_properties(Boundary_Type) {
-  }
-
-  template <typename Property>
-  void set_boundary_property(Boundary_Type, const Property&, typename Property::Value = Property::default_value) {
-  }
-  template <typename Property>
-  typename Property::Value get_boundary_property(Boundary_Type, const Property&) const {
-    return Property::unsupported_value;
-  }
-  template <typename Property>
-  void set_interval_property(const Property&, typename Property::Value = Property::default_value) {
-  }
-  template <typename Property>
-  typename Property::Value get_interval_property(const Property&) const {
-    return Property::unsupported_value;
-  }
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Interval_Info_Null& y);
-
-  void ascii_dump(std::ostream& s) const;
-  bool ascii_load(std::istream& s);
-};
-
-template <typename Policy>
-class Interval_Info_Null_Open : public Interval_Info_Null<Policy> {
-public:
-  const_bool_nodef(store_open, true);
-  Interval_Info_Null_Open(bool o)
-    : open(o) {
-  }
-  bool get_boundary_property(Boundary_Type,
-                             const Boundary_NS::Property& p) const {
-    if (p.type == Boundary_NS::Property::OPEN_)
-      return open;
-    else
-      return Boundary_NS::Property::unsupported_value;
-  }
-
-  void ascii_dump(std::ostream& s) const;
-  bool ascii_load(std::istream& s);
-
-private:
-  bool open;
-};
-
-
-template <typename T, typename Policy>
-class Interval_Info_Bitset {
-public:
-  const_bool_nodef(may_be_empty, Policy::may_be_empty);
-  const_bool_nodef(may_contain_infinity, Policy::may_contain_infinity);
-  const_bool_nodef(check_inexact, Policy::check_inexact);
-  const_bool_nodef(store_special, Policy::store_special);
-  const_bool_nodef(store_open, Policy::store_open);
-  const_bool_nodef(cache_empty, Policy::cache_empty);
-  const_bool_nodef(cache_singleton, Policy::cache_singleton);
-  const_int_nodef(lower_special_bit, Policy::next_bit);
-  const_int_nodef(lower_open_bit, lower_special_bit + (store_special ? 1 : 0));
-  const_int_nodef(upper_special_bit, lower_open_bit + (store_open ? 1 : 0));
-  const_int_nodef(upper_open_bit, upper_special_bit + (store_special ? 1 : 0));
-  const_int_nodef(cardinality_is_bit, upper_open_bit + (store_open ? 1 : 0));
-  const_int_nodef(cardinality_0_bit, cardinality_is_bit
-                  + ((cache_empty || cache_singleton) ? 1 : 0));
-  const_int_nodef(cardinality_1_bit, cardinality_0_bit + (cache_empty ? 1 : 0));
-  const_int_nodef(next_bit, cardinality_1_bit + (cache_singleton ? 1 : 0));
-
-  Interval_Info_Bitset() {
-    // FIXME: would we have speed benefits with uninitialized info?
-    // (Dirty_Temp)
-    clear();
-  }
-
-  void clear() {
-    reset_bits(bitset);
-  }
-  void clear_boundary_properties(Boundary_Type t) {
-    set_boundary_property(t, SPECIAL, false);
-    set_boundary_property(t, OPEN, false);
-  }
-  void set_boundary_property(Boundary_Type t,
-                             const Boundary_NS::Property& p,
-                             bool value = true) {
-    switch (p.type) {
-    case Boundary_NS::Property::SPECIAL_:
-      if (store_special) {
-	if (t == LOWER)
-	  set_bit(bitset, lower_special_bit, value);
-	else
-	  set_bit(bitset, upper_special_bit, value);
-      }
-      break;
-    case Boundary_NS::Property::OPEN_:
-      if (store_open) {
-	if (t == LOWER)
-	  set_bit(bitset, lower_open_bit, value);
-	else
-	  set_bit(bitset, upper_open_bit, value);
-      }
-      break;
-    default:
-      break;
-    }
-  }
-  bool get_boundary_property(Boundary_Type t, const Boundary_NS::Property& p) const {
-    switch (p.type) {
-    case Boundary_NS::Property::SPECIAL_:
-      if (!store_special)
-	return false;
-      if (t == LOWER)
-	return get_bit(bitset, lower_special_bit);
-      else
-	return get_bit(bitset, upper_special_bit);
-    case Boundary_NS::Property::OPEN_:
-      if (!store_open)
-	return false;
-      else if (t == LOWER)
-	return get_bit(bitset, lower_open_bit);
-      else
-	return get_bit(bitset, upper_open_bit);
-    default:
-      return false;
-    }
-  }
-  void set_interval_property(const Interval_NS::Property& p, bool value = true) {
-    switch (p.type) {
-    case Interval_NS::Property::CARDINALITY_0_:
-      if (cache_empty)
-	set_bit(bitset, cardinality_0_bit, value);
-      break;
-    case Interval_NS::Property::CARDINALITY_1_:
-      if (cache_singleton)
-	set_bit(bitset, cardinality_1_bit, value);
-      break;
-    case Interval_NS::Property::CARDINALITY_IS_:
-      if (cache_empty || cache_singleton)
-	set_bit(bitset, cardinality_is_bit, value);
-      break;
-    default:
-      break;
-    }
-  }
-  bool get_interval_property(Interval_NS::Property p) const {
-    switch (p.type) {
-    case Interval_NS::Property::CARDINALITY_0_:
-      return cache_empty && get_bit(bitset, cardinality_0_bit);
-    case Interval_NS::Property::CARDINALITY_1_:
-      return cache_singleton && get_bit(bitset, cardinality_1_bit);
-    case Interval_NS::Property::CARDINALITY_IS_:
-      return (cache_empty || cache_singleton)
-        && get_bit(bitset, cardinality_is_bit);
-    default:
-      return false;
-    }
-  }
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Interval_Info_Bitset& y);
-
-  void ascii_dump(std::ostream& s) const;
-  bool ascii_load(std::istream& s);
-
-protected:
-  T bitset;
-};
-
-}
-
-#include "Interval_Info.inlines.hh"
-
-#endif // !defined(PPL_Interval_Info_defs_hh)
diff --git a/src/Interval_Info.inlines.hh b/src/Interval_Info.inlines.hh
deleted file mode 100644
index 4453019..0000000
--- a/src/Interval_Info.inlines.hh
+++ /dev/null
@@ -1,116 +0,0 @@
-/* Interval_Info class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Interval_Info_inlines_hh
-#define PPL_Interval_Info_inlines_hh 1
-
-#include <iomanip>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Policy>
-inline void
-Interval_Info_Null<Policy>::m_swap(Interval_Info_Null<Policy>&) {
-}
-
-template <typename Policy>
-inline void
-Interval_Info_Null<Policy>::ascii_dump(std::ostream&) const {
-}
-
-template <typename Policy>
-inline bool
-Interval_Info_Null<Policy>::ascii_load(std::istream&) {
-  return true;
-}
-
-template <typename Policy>
-inline void
-Interval_Info_Null_Open<Policy>::ascii_dump(std::ostream& s) const {
-  s << (open ? "open" : "closed");
-}
-
-template <typename Policy>
-inline bool
-Interval_Info_Null_Open<Policy>::ascii_load(std::istream& s) {
-  std::string str;
-  if (!(s >> str))
-    return false;
-  if (str == "open") {
-    open = true;
-    return true;
-  }
-  if (str == "closed") {
-    open = false;
-    return true;
-  }
-  return false;
-}
-
-template <typename T, typename Policy>
-inline void
-Interval_Info_Bitset<T, Policy>::m_swap(Interval_Info_Bitset<T, Policy>& y) {
-  using std::swap;
-  swap(bitset, y.bitset);
-}
-
-template <typename T, typename Policy>
-inline void
-Interval_Info_Bitset<T, Policy>::ascii_dump(std::ostream& s) const {
-  const std::ios::fmtflags old_flags = s.setf(std::ios::hex,
-                                              std::ios::basefield);
-  s << bitset;
-  s.flags(old_flags);
-}
-
-template <typename T, typename Policy>
-inline bool
-Interval_Info_Bitset<T, Policy>::ascii_load(std::istream& s) {
-  const std::ios::fmtflags old_flags = s.setf(std::ios::hex,
-                                              std::ios::basefield);
-  s >> bitset;
-  s.flags(old_flags);
-  return !s.fail();
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Interval_Info_Null */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Policy>
-inline void
-swap(Interval_Info_Null<Policy>& x, Interval_Info_Null<Policy>& y) {
-  x.m_swap(y);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Interval_Info_Bitset */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename Policy>
-inline void
-swap(Interval_Info_Bitset<T, Policy>& x, Interval_Info_Bitset<T, Policy>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Interval_Info_inlines_hh)
diff --git a/src/Interval_Info.types.hh b/src/Interval_Info.types.hh
deleted file mode 100644
index 8e05207..0000000
--- a/src/Interval_Info.types.hh
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Interval_Info_types_hh
-#define PPL_Interval_Info_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Policy>
-class Interval_Info_Null;
-
-template <typename T, typename Policy>
-class Interval_Info_Bitset;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Interval_Info_types_hh)
diff --git a/src/Interval_Info_defs.hh b/src/Interval_Info_defs.hh
new file mode 100644
index 0000000..235b35b
--- /dev/null
+++ b/src/Interval_Info_defs.hh
@@ -0,0 +1,285 @@
+/* Interval_Info class declaration and implementation.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Interval_Info_defs_hh
+#define PPL_Interval_Info_defs_hh 1
+
+#include "Boundary_defs.hh"
+
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Interval_NS {
+
+struct Property {
+  enum Type {
+    CARDINALITY_0_,
+    CARDINALITY_1_,
+    CARDINALITY_IS_
+  };
+  typedef bool Value;
+  static const Value default_value = true;
+  static const Value unsupported_value = false;
+  Property(Type t)
+    : type(t) {
+  }
+  Type type;
+};
+
+const Property CARDINALITY_0(Property::CARDINALITY_0_);
+const Property CARDINALITY_1(Property::CARDINALITY_1_);
+const Property CARDINALITY_IS(Property::CARDINALITY_IS_);
+
+template <typename T>
+inline void
+reset_bits(T& bits) {
+  bits = 0;
+}
+
+template <typename T>
+inline void
+reset_bit(T& bits, unsigned int bit) {
+  bits &= ~(static_cast<T>(1) << bit);
+}
+
+template <typename T>
+inline void
+set_bit(T& bits, unsigned int bit, bool value) {
+  if (value)
+    bits |= static_cast<T>(1) << bit;
+  else
+    reset_bit(bits, bit);
+}
+
+template <typename T>
+inline bool
+get_bit(const T& bits, unsigned int bit) {
+  return (bits & (static_cast<T>(1) << bit)) != 0;
+}
+
+template <typename T>
+inline void
+set_bits(T& bits, unsigned int start, unsigned int len, T value) {
+  bits &= ~(((static_cast<T>(1) << len) - 1) << start);
+  bits |= value << start;
+}
+
+template <typename T>
+inline T
+get_bits(T& bits, unsigned int start, unsigned int len) {
+  return (bits >> start) & ((static_cast<T>(1) << len) - 1);
+}
+
+} // namespace Interval_NS
+
+using namespace Interval_NS;
+using namespace Boundary_NS;
+
+
+template <typename Policy>
+class Interval_Info_Null {
+public:
+  const_bool_nodef(may_be_empty, Policy::may_be_empty);
+  const_bool_nodef(may_contain_infinity, Policy::may_contain_infinity);
+  const_bool_nodef(check_inexact, Policy::check_inexact);
+  const_bool_nodef(store_special, false);
+  const_bool_nodef(store_open, false);
+  const_bool_nodef(cache_empty, false);
+  const_bool_nodef(cache_singleton, false);
+  Interval_Info_Null() {
+  }
+  void clear() {
+  }
+  void clear_boundary_properties(Boundary_Type) {
+  }
+
+  template <typename Property>
+  void set_boundary_property(Boundary_Type, const Property&, typename Property::Value = Property::default_value) {
+  }
+  template <typename Property>
+  typename Property::Value get_boundary_property(Boundary_Type, const Property&) const {
+    return Property::unsupported_value;
+  }
+  template <typename Property>
+  void set_interval_property(const Property&, typename Property::Value = Property::default_value) {
+  }
+  template <typename Property>
+  typename Property::Value get_interval_property(const Property&) const {
+    return Property::unsupported_value;
+  }
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Interval_Info_Null& y);
+
+  void ascii_dump(std::ostream& s) const;
+  bool ascii_load(std::istream& s);
+};
+
+template <typename Policy>
+class Interval_Info_Null_Open : public Interval_Info_Null<Policy> {
+public:
+  const_bool_nodef(store_open, true);
+  Interval_Info_Null_Open(bool o)
+    : open(o) {
+  }
+  bool get_boundary_property(Boundary_Type,
+                             const Boundary_NS::Property& p) const {
+    if (p.type == Boundary_NS::Property::OPEN_)
+      return open;
+    else
+      return Boundary_NS::Property::unsupported_value;
+  }
+
+  void ascii_dump(std::ostream& s) const;
+  bool ascii_load(std::istream& s);
+
+private:
+  bool open;
+};
+
+
+template <typename T, typename Policy>
+class Interval_Info_Bitset {
+public:
+  const_bool_nodef(may_be_empty, Policy::may_be_empty);
+  const_bool_nodef(may_contain_infinity, Policy::may_contain_infinity);
+  const_bool_nodef(check_inexact, Policy::check_inexact);
+  const_bool_nodef(store_special, Policy::store_special);
+  const_bool_nodef(store_open, Policy::store_open);
+  const_bool_nodef(cache_empty, Policy::cache_empty);
+  const_bool_nodef(cache_singleton, Policy::cache_singleton);
+  const_int_nodef(lower_special_bit, Policy::next_bit);
+  const_int_nodef(lower_open_bit, lower_special_bit + (store_special ? 1 : 0));
+  const_int_nodef(upper_special_bit, lower_open_bit + (store_open ? 1 : 0));
+  const_int_nodef(upper_open_bit, upper_special_bit + (store_special ? 1 : 0));
+  const_int_nodef(cardinality_is_bit, upper_open_bit + (store_open ? 1 : 0));
+  const_int_nodef(cardinality_0_bit, cardinality_is_bit
+                  + ((cache_empty || cache_singleton) ? 1 : 0));
+  const_int_nodef(cardinality_1_bit, cardinality_0_bit + (cache_empty ? 1 : 0));
+  const_int_nodef(next_bit, cardinality_1_bit + (cache_singleton ? 1 : 0));
+
+  Interval_Info_Bitset() {
+    // FIXME: would we have speed benefits with uninitialized info?
+    // (Dirty_Temp)
+    clear();
+  }
+
+  void clear() {
+    reset_bits(bitset);
+  }
+  void clear_boundary_properties(Boundary_Type t) {
+    set_boundary_property(t, SPECIAL, false);
+    set_boundary_property(t, OPEN, false);
+  }
+  void set_boundary_property(Boundary_Type t,
+                             const Boundary_NS::Property& p,
+                             bool value = true) {
+    switch (p.type) {
+    case Boundary_NS::Property::SPECIAL_:
+      if (store_special) {
+        if (t == LOWER)
+          set_bit(bitset, lower_special_bit, value);
+        else
+          set_bit(bitset, upper_special_bit, value);
+      }
+      break;
+    case Boundary_NS::Property::OPEN_:
+      if (store_open) {
+        if (t == LOWER)
+          set_bit(bitset, lower_open_bit, value);
+        else
+          set_bit(bitset, upper_open_bit, value);
+      }
+      break;
+    default:
+      break;
+    }
+  }
+  bool get_boundary_property(Boundary_Type t, const Boundary_NS::Property& p) const {
+    switch (p.type) {
+    case Boundary_NS::Property::SPECIAL_:
+      if (!store_special)
+        return false;
+      if (t == LOWER)
+        return get_bit(bitset, lower_special_bit);
+      else
+        return get_bit(bitset, upper_special_bit);
+    case Boundary_NS::Property::OPEN_:
+      if (!store_open)
+        return false;
+      else if (t == LOWER)
+        return get_bit(bitset, lower_open_bit);
+      else
+        return get_bit(bitset, upper_open_bit);
+    default:
+      return false;
+    }
+  }
+  void set_interval_property(const Interval_NS::Property& p, bool value = true) {
+    switch (p.type) {
+    case Interval_NS::Property::CARDINALITY_0_:
+      if (cache_empty)
+        set_bit(bitset, cardinality_0_bit, value);
+      break;
+    case Interval_NS::Property::CARDINALITY_1_:
+      if (cache_singleton)
+        set_bit(bitset, cardinality_1_bit, value);
+      break;
+    case Interval_NS::Property::CARDINALITY_IS_:
+      if (cache_empty || cache_singleton)
+        set_bit(bitset, cardinality_is_bit, value);
+      break;
+    default:
+      break;
+    }
+  }
+  bool get_interval_property(Interval_NS::Property p) const {
+    switch (p.type) {
+    case Interval_NS::Property::CARDINALITY_0_:
+      return cache_empty && get_bit(bitset, cardinality_0_bit);
+    case Interval_NS::Property::CARDINALITY_1_:
+      return cache_singleton && get_bit(bitset, cardinality_1_bit);
+    case Interval_NS::Property::CARDINALITY_IS_:
+      return (cache_empty || cache_singleton)
+        && get_bit(bitset, cardinality_is_bit);
+    default:
+      return false;
+    }
+  }
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Interval_Info_Bitset& y);
+
+  void ascii_dump(std::ostream& s) const;
+  bool ascii_load(std::istream& s);
+
+protected:
+  T bitset;
+};
+
+}
+
+#include "Interval_Info_inlines.hh"
+
+#endif // !defined(PPL_Interval_Info_defs_hh)
diff --git a/src/Interval_Info_inlines.hh b/src/Interval_Info_inlines.hh
new file mode 100644
index 0000000..e93173d
--- /dev/null
+++ b/src/Interval_Info_inlines.hh
@@ -0,0 +1,116 @@
+/* Interval_Info class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Interval_Info_inlines_hh
+#define PPL_Interval_Info_inlines_hh 1
+
+#include <iomanip>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Policy>
+inline void
+Interval_Info_Null<Policy>::m_swap(Interval_Info_Null<Policy>&) {
+}
+
+template <typename Policy>
+inline void
+Interval_Info_Null<Policy>::ascii_dump(std::ostream&) const {
+}
+
+template <typename Policy>
+inline bool
+Interval_Info_Null<Policy>::ascii_load(std::istream&) {
+  return true;
+}
+
+template <typename Policy>
+inline void
+Interval_Info_Null_Open<Policy>::ascii_dump(std::ostream& s) const {
+  s << (open ? "open" : "closed");
+}
+
+template <typename Policy>
+inline bool
+Interval_Info_Null_Open<Policy>::ascii_load(std::istream& s) {
+  std::string str;
+  if (!(s >> str))
+    return false;
+  if (str == "open") {
+    open = true;
+    return true;
+  }
+  if (str == "closed") {
+    open = false;
+    return true;
+  }
+  return false;
+}
+
+template <typename T, typename Policy>
+inline void
+Interval_Info_Bitset<T, Policy>::m_swap(Interval_Info_Bitset<T, Policy>& y) {
+  using std::swap;
+  swap(bitset, y.bitset);
+}
+
+template <typename T, typename Policy>
+inline void
+Interval_Info_Bitset<T, Policy>::ascii_dump(std::ostream& s) const {
+  const std::ios::fmtflags old_flags = s.setf(std::ios::hex,
+                                              std::ios::basefield);
+  s << bitset;
+  s.flags(old_flags);
+}
+
+template <typename T, typename Policy>
+inline bool
+Interval_Info_Bitset<T, Policy>::ascii_load(std::istream& s) {
+  const std::ios::fmtflags old_flags = s.setf(std::ios::hex,
+                                              std::ios::basefield);
+  s >> bitset;
+  s.flags(old_flags);
+  return !s.fail();
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Interval_Info_Null */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Policy>
+inline void
+swap(Interval_Info_Null<Policy>& x, Interval_Info_Null<Policy>& y) {
+  x.m_swap(y);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Interval_Info_Bitset */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename Policy>
+inline void
+swap(Interval_Info_Bitset<T, Policy>& x, Interval_Info_Bitset<T, Policy>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Interval_Info_inlines_hh)
diff --git a/src/Interval_Info_types.hh b/src/Interval_Info_types.hh
new file mode 100644
index 0000000..ba1e6fb
--- /dev/null
+++ b/src/Interval_Info_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Interval_Info_types_hh
+#define PPL_Interval_Info_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Policy>
+class Interval_Info_Null;
+
+template <typename T, typename Policy>
+class Interval_Info_Bitset;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Interval_Info_types_hh)
diff --git a/src/Interval_defs.hh b/src/Interval_defs.hh
new file mode 100644
index 0000000..f953ac9
--- /dev/null
+++ b/src/Interval_defs.hh
@@ -0,0 +1,763 @@
+/* Declarations for the Interval class and its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Interval_defs_hh
+#define PPL_Interval_defs_hh 1
+
+#include "globals_defs.hh"
+#include "meta_programming.hh"
+#include "assign_or_swap.hh"
+#include "intervals_defs.hh"
+#include "Interval_types.hh"
+#include "Interval_Info_defs.hh"
+#include <iosfwd>
+
+// Temporary!
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+enum Ternary { T_YES, T_NO, T_MAYBE };
+
+inline I_Result
+combine(Result l, Result u) {
+  const unsigned res
+    = static_cast<unsigned>(l) | (static_cast<unsigned>(u) << 6);
+  return static_cast<I_Result>(res);
+}
+
+struct Interval_Base {
+};
+
+using namespace Boundary_NS;
+using namespace Interval_NS;
+
+template <typename T, typename Enable = void>
+struct Is_Singleton : public Is_Native_Or_Checked<T> {};
+
+template <typename T>
+struct Is_Interval : public Is_Same_Or_Derived<Interval_Base, T> {};
+
+//! A generic, not necessarily closed, possibly restricted interval.
+/*! \ingroup PPL_CXX_interface
+  The class template type parameter \p Boundary represents the type
+  of the interval boundaries, and can be chosen, among other possibilities,
+  within one of the following number families:
+
+  - a bounded precision native integer type (that is,
+    from <CODE>signed char</CODE> to <CODE>long long</CODE>
+    and from <CODE>int8_t</CODE> to <CODE>int64_t</CODE>);
+  - a bounded precision floating point type (<CODE>float</CODE>,
+    <CODE>double</CODE> or <CODE>long double</CODE>);
+  - an unbounded integer or rational type, as provided by the C++ interface
+    of GMP (<CODE>mpz_class</CODE> or <CODE>mpq_class</CODE>).
+
+  The class template type parameter \p Info allows to control a number
+  of features of the class, among which:
+
+  - the ability to support open as well as closed boundaries;
+  - the ability to represent empty intervals in addition to nonempty ones;
+  - the ability to represent intervals of extended number families
+    that contain positive and negative infinities;
+*/
+template <typename Boundary, typename Info>
+class Interval : public Interval_Base, private Info {
+private:
+  PPL_COMPILE_TIME_CHECK(!Info::store_special
+                         || !std::numeric_limits<Boundary>::has_infinity,
+                         "store_special is meaningless"
+                         " when boundary type may contains infinity");
+  Info& w_info() const {
+    return const_cast<Interval&>(*this);
+  }
+
+public:
+  typedef Boundary boundary_type;
+  typedef Info info_type;
+
+  typedef Interval_NS::Property Property;
+
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
+  operator=(const T& x) {
+    assign(x);
+    return *this;
+  }
+
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
+  operator+=(const T& x) {
+    add_assign(*this, x);
+    return *this;
+  }
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
+  operator-=(const T& x) {
+    sub_assign(*this, x);
+    return *this;
+  }
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
+  operator*=(const T& x) {
+    mul_assign(*this, x);
+    return *this;
+  }
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value || Is_Interval<T>::value, Interval&>::type
+  operator/=(const T& x) {
+    div_assign(*this, x);
+    return *this;
+  }
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Interval& y);
+
+  Info& info() {
+    return *this;
+  }
+
+  const Info& info() const {
+    return *this;
+  }
+
+  Boundary& lower() {
+    return lower_;
+  }
+
+  const Boundary& lower() const {
+    return lower_;
+  }
+
+  Boundary& upper() {
+    return upper_;
+  }
+
+  const Boundary& upper() const {
+    return upper_;
+  }
+
+  I_Constraint<boundary_type> lower_constraint() const {
+    PPL_ASSERT(!is_empty());
+    if (info().get_boundary_property(LOWER, SPECIAL))
+      return I_Constraint<boundary_type>();
+    return i_constraint(lower_is_open() ? GREATER_THAN : GREATER_OR_EQUAL,
+                        lower(), true);
+  }
+  I_Constraint<boundary_type> upper_constraint() const {
+    PPL_ASSERT(!is_empty());
+    if (info().get_boundary_property(UPPER, SPECIAL))
+      return I_Constraint<boundary_type>();
+    return i_constraint(upper_is_open() ? LESS_THAN : LESS_OR_EQUAL,
+                        upper(), true);
+  }
+
+  bool is_empty() const {
+    return lt(UPPER, upper(), info(), LOWER, lower(), info());
+  }
+
+  bool check_empty(I_Result r) const {
+    return (r & I_ANY) == I_EMPTY
+      || ((r & I_ANY) != I_NOT_EMPTY && is_empty());
+  }
+
+  bool is_singleton() const {
+    return eq(LOWER, lower(), info(), UPPER, upper(), info());
+  }
+
+  bool lower_is_open() const {
+    PPL_ASSERT(OK());
+    return is_open(LOWER, lower(), info());
+  }
+
+  bool upper_is_open() const {
+    PPL_ASSERT(OK());
+    return is_open(UPPER, upper(), info());
+  }
+
+  bool lower_is_boundary_infinity() const {
+    PPL_ASSERT(OK());
+    return Boundary_NS::is_boundary_infinity(LOWER, lower(), info());
+  }
+
+  bool upper_is_boundary_infinity() const {
+    PPL_ASSERT(OK());
+    return Boundary_NS::is_boundary_infinity(UPPER, upper(), info());
+  }
+
+  bool lower_is_domain_inf() const {
+    PPL_ASSERT(OK());
+    return Boundary_NS::is_domain_inf(LOWER, lower(), info());
+  }
+
+  bool upper_is_domain_sup() const {
+    PPL_ASSERT(OK());
+    return Boundary_NS::is_domain_sup(UPPER, upper(), info());
+  }
+
+  bool is_bounded() const {
+    PPL_ASSERT(OK());
+    return !lower_is_boundary_infinity() && !upper_is_boundary_infinity();
+  }
+
+  bool is_universe() const {
+    PPL_ASSERT(OK());
+    return lower_is_domain_inf() && upper_is_domain_sup();
+  }
+
+  I_Result lower_extend() {
+    info().clear_boundary_properties(LOWER);
+    set_unbounded(LOWER, lower(), info());
+    return I_ANY;
+  }
+
+  template <typename C>
+  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
+  lower_extend(const C& c);
+
+  I_Result upper_extend() {
+    info().clear_boundary_properties(UPPER);
+    set_unbounded(UPPER, upper(), info());
+    return I_ANY;
+  }
+
+  template <typename C>
+  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
+  upper_extend(const C& c);
+
+  I_Result build() {
+    return assign(UNIVERSE);
+  }
+
+  template <typename C>
+  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
+  build(const C& c) {
+    Relation_Symbol rs;
+    switch (c.rel()) {
+    case V_LGE:
+    case V_GT_MINUS_INFINITY:
+    case V_LT_PLUS_INFINITY:
+      return assign(UNIVERSE);
+    default:
+      return assign(EMPTY);
+    case V_LT:
+    case V_LE:
+    case V_GT:
+    case V_GE:
+    case V_EQ:
+    case V_NE:
+      assign(UNIVERSE);
+      rs = static_cast<Relation_Symbol>(c.rel());
+      return refine_existential(rs, c.value());
+    }
+  }
+
+  template <typename C1, typename C2>
+  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C1>::value
+                     &&
+                     Is_Same_Or_Derived<I_Constraint_Base, C2>::value,
+                     I_Result>::type
+  build(const C1& c1, const C2& c2) {
+    switch (c1.rel()) {
+    case V_LGE:
+      return build(c2);
+    case V_NAN:
+      return assign(EMPTY);
+    default:
+      break;
+    }
+    switch (c2.rel()) {
+    case V_LGE:
+      return build(c1);
+    case V_NAN:
+      return assign(EMPTY);
+    default:
+      break;
+    }
+    build(c1);
+    const I_Result r = add_constraint(c2);
+    return r - (I_CHANGED | I_UNCHANGED);
+  }
+
+  template <typename C>
+  typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
+  add_constraint(const C& c) {
+    Interval x;
+    x.build(c);
+    return intersect_assign(x);
+  }
+
+  I_Result assign(Degenerate_Element e) {
+    I_Result r;
+    info().clear();
+    switch (e) {
+    case EMPTY:
+      lower_ = 1;
+      upper_ = 0;
+      r = I_EMPTY | I_EXACT;
+      break;
+    case UNIVERSE:
+      set_unbounded(LOWER, lower(), info());
+      set_unbounded(UPPER, upper(), info());
+      r = I_UNIVERSE | I_EXACT;
+      break;
+    default:
+      PPL_UNREACHABLE;
+      r = I_EMPTY;
+      break;
+    }
+    PPL_ASSERT(OK());
+    return r;
+  }
+
+  template <typename From>
+  typename Enable_If<Is_Special<From>::value, I_Result>::type
+  assign(const From&) {
+    info().clear();
+    Result rl;
+    Result ru;
+    switch (From::vclass) {
+    case VC_MINUS_INFINITY:
+      rl = Boundary_NS::set_minus_infinity(LOWER, lower(), info());
+      ru = Boundary_NS::set_minus_infinity(UPPER, upper(), info());
+      break;
+    case VC_PLUS_INFINITY:
+      rl = Boundary_NS::set_plus_infinity(LOWER, lower(), info());
+      ru = Boundary_NS::set_plus_infinity(UPPER, upper(), info());
+      break;
+    default:
+      PPL_UNREACHABLE;
+      rl = V_NAN;
+      ru = V_NAN;
+      break;
+    }
+    PPL_ASSERT(OK());
+    return combine(rl, ru);
+  }
+
+  I_Result set_infinities() {
+    info().clear();
+    Result rl = Boundary_NS::set_minus_infinity(LOWER, lower(), info());
+    Result ru = Boundary_NS::set_plus_infinity(UPPER, upper(), info());
+    PPL_ASSERT(OK());
+    return combine(rl, ru);
+  }
+
+  static bool is_always_topologically_closed() {
+    return !Info::store_open;
+  }
+
+  bool is_topologically_closed() const {
+    PPL_ASSERT(OK());
+    return is_always_topologically_closed()
+      || is_empty()
+      || ((lower_is_boundary_infinity() || !lower_is_open())
+          && (upper_is_boundary_infinity() || !upper_is_open()));
+  }
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign() {
+    if (!Info::store_open || is_empty())
+      return;
+    if (lower_is_open() && !lower_is_boundary_infinity())
+      info().set_boundary_property(LOWER, OPEN, false);
+    if (upper_is_open() && !upper_is_boundary_infinity())
+      info().set_boundary_property(UPPER, OPEN, false);
+  }
+
+  void remove_inf() {
+    PPL_ASSERT(!is_empty());
+    if (!Info::store_open)
+      return;
+    info().set_boundary_property(LOWER, OPEN, true);
+  }
+
+  void remove_sup() {
+    PPL_ASSERT(!is_empty());
+    if (!Info::store_open)
+      return;
+    info().set_boundary_property(UPPER, OPEN, true);
+  }
+
+  int infinity_sign() const {
+    PPL_ASSERT(OK());
+    if (is_reverse_infinity(LOWER, lower(), info()))
+      return 1;
+    else if (is_reverse_infinity(UPPER, upper(), info()))
+      return -1;
+    else
+      return 0;
+  }
+
+  bool contains_integer_point() const {
+    PPL_ASSERT(OK());
+    if (is_empty())
+      return false;
+    if (!is_bounded())
+      return true;
+    Boundary l;
+    if (lower_is_open()) {
+      add_assign_r(l, lower(), Boundary(1), ROUND_DOWN);
+      floor_assign_r(l, l, ROUND_DOWN);
+    }
+    else
+      ceil_assign_r(l, lower(), ROUND_DOWN);
+    Boundary u;
+    if (upper_is_open()) {
+      sub_assign_r(u, upper(), Boundary(1), ROUND_UP);
+      ceil_assign_r(u, u, ROUND_UP);
+    }
+    else
+      floor_assign_r(u, upper(), ROUND_UP);
+    return u >= l;
+  }
+
+  void drop_some_non_integer_points() {
+    if (is_empty())
+      return;
+    if (lower_is_open() && !lower_is_boundary_infinity()) {
+      add_assign_r(lower(), lower(), Boundary(1), ROUND_DOWN);
+      floor_assign_r(lower(), lower(), ROUND_DOWN);
+      info().set_boundary_property(LOWER, OPEN, false);
+    }
+    else
+      ceil_assign_r(lower(), lower(), ROUND_DOWN);
+    if (upper_is_open() && !upper_is_boundary_infinity()) {
+      sub_assign_r(upper(), upper(), Boundary(1), ROUND_UP);
+      ceil_assign_r(upper(), upper(), ROUND_UP);
+      info().set_boundary_property(UPPER, OPEN, false);
+    }
+    else
+      floor_assign_r(upper(), upper(), ROUND_UP);
+  }
+
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value || Is_Interval<From>::value, I_Result>::type
+  wrap_assign(Bounded_Integer_Type_Width w,
+              Bounded_Integer_Type_Representation r,
+              const From& refinement) {
+    if (is_empty())
+      return I_EMPTY;
+    if (lower_is_boundary_infinity() || upper_is_boundary_infinity())
+      return assign(refinement);
+    PPL_DIRTY_TEMP(Boundary, u);
+    Result result = sub_2exp_assign_r(u, upper(), w, ROUND_UP);
+    if (result_overflow(result) == 0 && u > lower())
+      return assign(refinement);
+    info().clear();
+    switch (r) {
+    case UNSIGNED:
+      umod_2exp_assign(LOWER, lower(), info(),
+                       LOWER, lower(), info(), w);
+      umod_2exp_assign(UPPER, upper(), info(),
+                       UPPER, upper(), info(), w);
+      break;
+    case SIGNED_2_COMPLEMENT:
+      smod_2exp_assign(LOWER, lower(), info(),
+                       LOWER, lower(), info(), w);
+      smod_2exp_assign(UPPER, upper(), info(),
+                       UPPER, upper(), info(), w);
+      break;
+    default:
+      PPL_UNREACHABLE;
+      break;
+    }
+    if (le(LOWER, lower(), info(), UPPER, upper(), info()))
+      return intersect_assign(refinement);
+    PPL_DIRTY_TEMP(Interval, tmp);
+    tmp.info().clear();
+    Boundary_NS::assign(LOWER, tmp.lower(), tmp.info(),
+                        LOWER, lower(), info());
+    set_unbounded(UPPER, tmp.upper(), tmp.info());
+    tmp.intersect_assign(refinement);
+    lower_extend();
+    intersect_assign(refinement);
+    return join_assign(tmp);
+  }
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  void ascii_dump(std::ostream& s) const;
+  bool ascii_load(std::istream& s);
+
+  bool OK() const {
+    if (!Info::may_be_empty && is_empty()) {
+#ifndef NDEBUG
+      std::cerr << "The interval is unexpectedly empty.\n";
+#endif
+      return false;
+    }
+
+    if (is_open(LOWER, lower(), info())) {
+      if (is_plus_infinity(LOWER, lower(), info())) {
+#ifndef NDEBUG
+        std::cerr << "The lower boundary is +inf open.\n";
+#endif
+      }
+    }
+    else if (!Info::may_contain_infinity
+             && (is_minus_infinity(LOWER, lower(), info())
+                 || is_plus_infinity(LOWER, lower(), info()))) {
+#ifndef NDEBUG
+      std::cerr << "The lower boundary is unexpectedly infinity.\n";
+#endif
+      return false;
+    }
+    if (!info().get_boundary_property(LOWER, SPECIAL)) {
+      if (is_not_a_number(lower())) {
+#ifndef NDEBUG
+        std::cerr << "The lower boundary is not a number.\n";
+#endif
+        return false;
+      }
+    }
+
+    if (is_open(UPPER, upper(), info())) {
+      if (is_minus_infinity(UPPER, upper(), info())) {
+#ifndef NDEBUG
+        std::cerr << "The upper boundary is -inf open.\n";
+#endif
+      }
+    }
+    else if (!Info::may_contain_infinity
+             && (is_minus_infinity(UPPER, upper(), info())
+                 || is_plus_infinity(UPPER, upper(), info()))) {
+#ifndef NDEBUG
+      std::cerr << "The upper boundary is unexpectedly infinity."
+                << std::endl;
+#endif
+      return false;
+    }
+    if (!info().get_boundary_property(UPPER, SPECIAL)) {
+      if (is_not_a_number(upper())) {
+#ifndef NDEBUG
+        std::cerr << "The upper boundary is not a number.\n";
+#endif
+        return false;
+      }
+    }
+
+    // Everything OK.
+    return true;
+  }
+
+  Interval() {
+  }
+
+  template <typename T>
+  explicit Interval(const T& x) {
+    assign(x);
+  }
+
+  /*! \brief
+    Builds the smallest interval containing the number whose textual
+    representation is contained in \p s.
+  */
+  explicit Interval(const char* s);
+
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value
+                     || Is_Interval<T>::value, bool>::type
+  contains(const T& y) const;
+
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value
+                     || Is_Interval<T>::value, bool>::type
+  strictly_contains(const T& y) const;
+
+  template <typename T>
+  typename Enable_If<Is_Singleton<T>::value
+                     || Is_Interval<T>::value, bool>::type
+  is_disjoint_from(const T& y) const;
+
+
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  assign(const From& x);
+
+  template <typename Type>
+  typename Enable_If<Is_Singleton<Type>::value
+                     || Is_Interval<Type>::value, bool>::type
+  can_be_exactly_joined_to(const Type& x) const;
+
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  join_assign(const From& x);
+
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value
+                       || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value
+                          || Is_Interval<From2>::value)), I_Result>::type
+  join_assign(const From1& x, const From2& y);
+
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  intersect_assign(const From& x);
+
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value
+                       || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value
+                          || Is_Interval<From2>::value)), I_Result>::type
+  intersect_assign(const From1& x, const From2& y);
+
+  /*! \brief
+    Assigns to \p *this the smallest interval containing the set-theoretic
+    difference of \p *this and \p x.
+  */
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  difference_assign(const From& x);
+
+  /*! \brief
+    Assigns to \p *this the smallest interval containing the set-theoretic
+    difference of \p x and \p y.
+  */
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value
+                       || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value
+                          || Is_Interval<From2>::value)), I_Result>::type
+  difference_assign(const From1& x, const From2& y);
+
+  /*! \brief
+    Assigns to \p *this the largest interval contained in the set-theoretic
+    difference of \p *this and \p x.
+  */
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  lower_approximation_difference_assign(const From& x);
+
+  /*! \brief
+    Assigns to \p *this a \ref Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+
+    \return
+    \c false if and only if the meet of \p *this and \p y is empty.
+  */
+  template <typename From>
+  typename Enable_If<Is_Interval<From>::value, bool>::type
+  simplify_using_context_assign(const From& y);
+
+  /*! \brief
+    Assigns to \p *this an interval having empty intersection with \p y.
+    The assigned interval should be as large as possible.
+  */
+  template <typename From>
+  typename Enable_If<Is_Interval<From>::value, void>::type
+  empty_intersection_assign(const From& y);
+
+  /*! \brief
+    Refines \p to according to the existential relation \p rel with \p x.
+
+    The \p to interval is restricted to become, upon successful exit,
+    the smallest interval of its type that contains the set
+    \f[
+      \{\,
+        a \in \mathtt{to}
+      \mid
+        \exists b \in \mathtt{x} \st a \mathrel{\mathtt{rel}} b
+      \,\}.
+    \f]
+    \return
+    ???
+  */
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  refine_existential(Relation_Symbol rel, const From& x);
+
+  /*! \brief
+    Refines \p to so that it satisfies the universal relation \p rel with \p x.
+
+    The \p to interval is restricted to become, upon successful exit,
+    the smallest interval of its type that contains the set
+    \f[
+      \{\,
+        a \in \mathtt{to}
+      \mid
+        \forall b \in \mathtt{x} \itc a \mathrel{\mathtt{rel}} b
+      \,\}.
+    \f]
+    \return
+    ???
+  */
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  refine_universal(Relation_Symbol rel, const From& x);
+
+  template <typename From>
+  typename Enable_If<Is_Singleton<From>::value
+                     || Is_Interval<From>::value, I_Result>::type
+  neg_assign(const From& x);
+
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+  add_assign(const From1& x, const From2& y);
+
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+  sub_assign(const From1& x, const From2& y);
+
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+  mul_assign(const From1& x, const From2& y);
+
+  template <typename From1, typename From2>
+  typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+  div_assign(const From1& x, const From2& y);
+
+  template <typename From, typename Iterator>
+  typename Enable_If<Is_Interval<From>::value, void>::type
+  CC76_widening_assign(const From& y, Iterator first, Iterator last);
+
+private:
+  Boundary lower_;
+  Boundary upper_;
+};
+
+//! Swaps \p x with \p y.
+/*! \relates Interval */
+template <typename Boundary, typename Info>
+void swap(Interval<Boundary, Info>& x, Interval<Boundary, Info>& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Interval_inlines.hh"
+#include "Interval_templates.hh"
+
+#endif // !defined(PPL_Interval_defs_hh)
diff --git a/src/Interval_inlines.hh b/src/Interval_inlines.hh
new file mode 100644
index 0000000..8ab37e4
--- /dev/null
+++ b/src/Interval_inlines.hh
@@ -0,0 +1,1160 @@
+/* Inline functions for the Interval class and its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Interval_inlines_hh
+#define PPL_Interval_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Boundary, typename Info>
+inline memory_size_type
+Interval<Boundary, Info>::external_memory_in_bytes() const {
+  return Parma_Polyhedra_Library::external_memory_in_bytes(lower())
+    + Parma_Polyhedra_Library::external_memory_in_bytes(upper());
+}
+
+template <typename Boundary, typename Info>
+inline memory_size_type
+Interval<Boundary, Info>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename Boundary, typename Info>
+inline void
+Interval<Boundary, Info>::m_swap(Interval<Boundary, Info>& y) {
+  using std::swap;
+  swap(lower(), y.lower());
+  swap(upper(), y.upper());
+  swap(info(), y.info());
+}
+
+template <typename Boundary, typename Info>
+inline bool
+f_is_empty(const Interval<Boundary, Info>& x) {
+  return x.is_empty();
+}
+template <typename Boundary, typename Info>
+inline bool
+f_is_singleton(const Interval<Boundary, Info>& x) {
+  return x.is_singleton();
+}
+template <typename Boundary, typename Info>
+inline int
+infinity_sign(const Interval<Boundary, Info>& x) {
+  return x.infinity_sign();
+}
+
+namespace Interval_NS {
+
+template <typename Boundary, typename Info>
+inline const Boundary&
+f_lower(const Interval<Boundary, Info>& x) {
+  return x.lower();
+}
+template <typename Boundary, typename Info>
+inline const Boundary&
+f_upper(const Interval<Boundary, Info>& x) {
+  return x.upper();
+}
+template <typename Boundary, typename Info>
+inline const Info&
+f_info(const Interval<Boundary, Info>& x) {
+  return x.info();
+}
+
+struct Scalar_As_Interval_Policy {
+  const_bool_nodef(may_be_empty, true);
+  const_bool_nodef(may_contain_infinity, true);
+  const_bool_nodef(check_inexact, false);
+};
+
+typedef Interval_Info_Null<Scalar_As_Interval_Policy>
+Scalar_As_Interval_Info;
+
+const Scalar_As_Interval_Info SCALAR_INFO;
+
+typedef Interval_Info_Null_Open<Scalar_As_Interval_Policy>
+Scalar_As_Interval_Info_Open;
+
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value, const T&>::type
+f_lower(const T& x) {
+  return x;
+}
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value, const T&>::type
+f_upper(const T& x) {
+  return x;
+}
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value,
+                          const Scalar_As_Interval_Info&>::type
+f_info(const T&) {
+  return SCALAR_INFO;
+}
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value,
+                          Scalar_As_Interval_Info_Open>::type
+f_info(const T&, bool open) {
+  return Scalar_As_Interval_Info_Open(open);
+}
+
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value, bool>::type
+f_is_empty(const T& x) {
+  return is_not_a_number(x);
+}
+
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value, bool>::type
+f_is_singleton(const T& x) {
+  return !f_is_empty(x);
+}
+
+} // namespace Interval_NS
+
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value
+                          || Is_Interval<T>::value, bool>::type
+is_singleton_integer(const T& x) {
+  return is_singleton(x) && is_integer(f_lower(x));
+}
+
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value
+                          || Is_Interval<T>::value, bool>::type
+check_empty_arg(const T& x) {
+  if (f_info(x).may_be_empty)
+    return f_is_empty(x);
+  else {
+    PPL_ASSERT(!f_is_empty(x));
+    return false;
+  }
+}
+
+template <typename T1, typename T2>
+inline typename Enable_If<((Is_Singleton<T1>::value
+                            || Is_Interval<T1>::value)
+                           && (Is_Singleton<T2>::value
+                               || Is_Interval<T2>::value)
+                           && (Is_Interval<T1>::value
+                               || Is_Interval<T2>::value)),
+                          bool>::type
+operator==(const T1& x, const T2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(x))
+    return check_empty_arg(y);
+  else if (check_empty_arg(y))
+    return false;
+  return eq(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y))
+    && eq(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y));
+}
+
+template <typename T1, typename T2>
+inline typename Enable_If<((Is_Singleton<T1>::value
+                            || Is_Interval<T1>::value)
+                           && (Is_Singleton<T2>::value
+                               || Is_Interval<T2>::value)
+                           && (Is_Interval<T1>::value
+                               || Is_Interval<T2>::value)),
+                          bool>::type
+operator!=(const T1& x, const T2& y) {
+  return !(x == y);
+}
+
+template <typename Boundary, typename Info>
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value
+                          || Is_Interval<T>::value, bool>::type
+Interval<Boundary, Info>::contains(const T& y) const {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(y))
+    return true;
+  if (check_empty_arg(*this))
+    return false;
+  return le(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
+    && ge(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y));
+}
+
+template <typename Boundary, typename Info>
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value
+                          || Is_Interval<T>::value, bool>::type
+Interval<Boundary, Info>::strictly_contains(const T& y) const {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(y))
+    return !check_empty_arg(*this);
+  if (check_empty_arg(*this))
+    return false;
+  return (lt(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
+          && ge(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)))
+    || (le(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
+        && gt(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)));
+}
+
+template <typename Boundary, typename Info>
+template <typename T>
+inline typename Enable_If<Is_Singleton<T>::value
+                          || Is_Interval<T>::value, bool>::type
+Interval<Boundary, Info>::is_disjoint_from(const T& y) const {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(*this) || check_empty_arg(y))
+    return true;
+  return gt(LOWER, lower(), info(), UPPER, f_upper(y), f_info(y))
+    || lt(UPPER, upper(), info(), LOWER, f_lower(y), f_info(y));
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>::assign(const From& x) {
+  PPL_ASSERT(f_OK(x));
+  if (check_empty_arg(x))
+    return assign(EMPTY);
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  const Result rl = Boundary_NS::assign(LOWER, lower(), to_info,
+                                        LOWER, f_lower(x), f_info(x));
+  const Result ru = Boundary_NS::assign(UPPER, upper(), to_info,
+                                        UPPER, f_upper(x), f_info(x));
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>::join_assign(const From& x) {
+  PPL_ASSERT(f_OK(x));
+  if (check_empty_arg(*this))
+    return assign(x);
+  if (check_empty_arg(x))
+    return combine(V_EQ, V_EQ);
+  Result rl;
+  Result ru;
+  rl = min_assign(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
+  ru = max_assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::join_assign(const From1& x, const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(x))
+    return assign(y);
+  if (check_empty_arg(y))
+    return assign(x);
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  Result rl;
+  Result ru;
+  rl = min_assign(LOWER, lower(), to_info,
+                  LOWER, f_lower(x), f_info(x),
+                  LOWER, f_lower(y), f_info(y));
+  ru = max_assign(UPPER, upper(), to_info,
+                  UPPER, f_upper(x), f_info(x),
+                  UPPER, f_upper(y), f_info(y));
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename Boundary, typename Info>
+template <typename Type>
+inline typename Enable_If<Is_Singleton<Type>::value
+                          || Is_Interval<Type>::value, bool>::type
+Interval<Boundary, Info>::can_be_exactly_joined_to(const Type& x) const {
+  PPL_DIRTY_TEMP(Boundary, b);
+  if (gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x))) {
+    b = lower();
+    return eq(LOWER, b, info(), UPPER, f_upper(x), f_info(x));
+  }
+  else if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x))) {
+    b = upper();
+    return eq(UPPER, b, info(), LOWER, f_lower(x), f_info(x));
+  }
+  return true;
+}
+
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>::intersect_assign(const From& x) {
+  PPL_ASSERT(f_OK(x));
+  max_assign(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
+  min_assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
+  PPL_ASSERT(OK());
+  return I_ANY;
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::intersect_assign(const From1& x,
+                                                 const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  max_assign(LOWER, lower(), to_info,
+             LOWER, f_lower(x), f_info(x),
+             LOWER, f_lower(y), f_info(y));
+  min_assign(UPPER, upper(), to_info,
+             UPPER, f_upper(x), f_info(x),
+             UPPER, f_upper(y), f_info(y));
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return I_NOT_EMPTY;
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>::difference_assign(const From& x) {
+  PPL_ASSERT(f_OK(x));
+  if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x))
+      || gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
+    return combine(V_EQ, V_EQ);
+  bool nl = ge(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
+  bool nu = le(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
+  Result rl = V_EQ;
+  Result ru = V_EQ;
+  if (nl) {
+    if (nu)
+      return assign(EMPTY);
+    else {
+      info().clear_boundary_properties(LOWER);
+      rl = complement(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x));
+    }
+  }
+  else if (nu) {
+    info().clear_boundary_properties(UPPER);
+    ru = complement(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x));
+  }
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::difference_assign(const From1& x,
+                                                  const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  if (lt(UPPER, f_upper(x), f_info(x), LOWER, f_lower(y), f_info(y))
+      || gt(LOWER, f_lower(x), f_info(x), UPPER, f_upper(y), f_info(y)))
+    return assign(x);
+  bool nl = ge(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y));
+  bool nu = le(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y));
+  Result rl = V_EQ;
+  Result ru = V_EQ;
+  if (nl) {
+    if (nu)
+      return assign(EMPTY);
+    else {
+      rl = complement(LOWER, lower(), info(), UPPER, f_upper(y), f_info(y));
+      ru = Boundary_NS::assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
+    }
+  }
+  else if (nu) {
+    ru = complement(UPPER, upper(), info(), LOWER, f_lower(y), f_info(y));
+    rl = Boundary_NS::assign(LOWER, lower(), info(),
+                             LOWER, f_lower(x), f_info(x));
+  }
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>
+::refine_existential(Relation_Symbol rel, const From& x) {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(f_OK(x));
+  if (check_empty_arg(x))
+    return assign(EMPTY);
+  switch (rel) {
+  case LESS_THAN:
+    {
+      if (lt(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(UPPER);
+      Boundary_NS::assign(UPPER, upper(), info(),
+                          UPPER, f_upper(x), f_info(x), true);
+      return I_ANY;
+    }
+  case LESS_OR_EQUAL:
+    {
+      if (le(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(UPPER);
+      Boundary_NS::assign(UPPER, upper(), info(),
+                          UPPER, f_upper(x), f_info(x));
+      return I_ANY;
+    }
+  case GREATER_THAN:
+    {
+      if (gt(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(LOWER);
+      Boundary_NS::assign(LOWER, lower(), info(),
+                          LOWER, f_lower(x), f_info(x), true);
+      return I_ANY;
+    }
+  case GREATER_OR_EQUAL:
+    {
+      if (ge(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(LOWER);
+      Boundary_NS::assign(LOWER, lower(), info(),
+                          LOWER, f_lower(x), f_info(x));
+      return I_ANY;
+    }
+  case EQUAL:
+    return intersect_assign(x);
+  case NOT_EQUAL:
+    {
+      if (!f_is_singleton(x))
+        return combine(V_EQ, V_EQ);
+      if (check_empty_arg(*this))
+        return I_EMPTY;
+      if (eq(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
+        remove_inf();
+      if (eq(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
+        remove_sup();
+      return I_ANY;
+    }
+  default:
+    PPL_UNREACHABLE;
+    return I_EMPTY;
+  }
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>::refine_universal(Relation_Symbol rel,
+                                                 const From& x) {
+  PPL_ASSERT(OK());
+  PPL_ASSERT(f_OK(x));
+  if (check_empty_arg(x))
+    return combine(V_EQ, V_EQ);
+  switch (rel) {
+  case LESS_THAN:
+    {
+      if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(UPPER);
+      Result ru = Boundary_NS::assign(UPPER, upper(), info(),
+                                      LOWER, f_lower(x), SCALAR_INFO,
+                                      !is_open(LOWER, f_lower(x), f_info(x)));
+      PPL_USED(ru);
+      return I_ANY;
+    }
+  case LESS_OR_EQUAL:
+    {
+      if (le(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(UPPER);
+      Result ru = Boundary_NS::assign(UPPER, upper(), info(),
+                                      LOWER, f_lower(x), SCALAR_INFO);
+      PPL_USED(ru);
+      return I_ANY;
+    }
+  case GREATER_THAN:
+    {
+      if (gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(LOWER);
+      Result rl = Boundary_NS::assign(LOWER, lower(), info(),
+                                      UPPER, f_upper(x), SCALAR_INFO,
+                                      !is_open(UPPER, f_upper(x), f_info(x)));
+      PPL_USED(rl);
+      return I_ANY;
+    }
+  case GREATER_OR_EQUAL:
+    {
+      if (ge(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
+        return combine(V_EQ, V_EQ);
+      info().clear_boundary_properties(LOWER);
+      Result rl = Boundary_NS::assign(LOWER, lower(), info(),
+                                      UPPER, f_upper(x), SCALAR_INFO);
+      PPL_USED(rl);
+      return I_ANY;
+    }
+  case EQUAL:
+    if (!f_is_singleton(x))
+      return assign(EMPTY);
+    return intersect_assign(x);
+  case NOT_EQUAL:
+    {
+      if (check_empty_arg(*this))
+        return I_EMPTY;
+      if (eq(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
+        remove_inf();
+      if (eq(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
+        remove_sup();
+      return I_ANY;
+    }
+  default:
+    PPL_UNREACHABLE;
+    return I_EMPTY;
+  }
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From>
+inline typename Enable_If<Is_Singleton<From>::value
+                          || Is_Interval<From>::value, I_Result>::type
+Interval<To_Boundary, To_Info>::neg_assign(const From& x) {
+  PPL_ASSERT(f_OK(x));
+  if (check_empty_arg(x))
+    return assign(EMPTY);
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  Result rl;
+  Result ru;
+  PPL_DIRTY_TEMP(To_Boundary, to_lower);
+  rl = Boundary_NS::neg_assign(LOWER, to_lower, to_info, UPPER, f_upper(x), f_info(x));
+  ru = Boundary_NS::neg_assign(UPPER, upper(), to_info, LOWER, f_lower(x), f_info(x));
+  assign_or_swap(lower(), to_lower);
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::add_assign(const From1& x, const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(x) || check_empty_arg(y))
+    return assign(EMPTY);
+  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
+  if (inf_sign != 0) {
+    if (Parma_Polyhedra_Library::infinity_sign(y) == -inf_sign)
+      return assign(EMPTY);
+  }
+  else
+    inf_sign = Parma_Polyhedra_Library::infinity_sign(y);
+  if (inf_sign < 0)
+    return assign(MINUS_INFINITY);
+  else if (inf_sign > 0)
+    return assign(PLUS_INFINITY);
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  Result rl = Boundary_NS::add_assign(LOWER, lower(), to_info,
+                                      LOWER, f_lower(x), f_info(x),
+                                      LOWER, f_lower(y), f_info(y));
+  Result ru = Boundary_NS::add_assign(UPPER, upper(), to_info,
+                                      UPPER, f_upper(x), f_info(x),
+                                      UPPER, f_upper(y), f_info(y));
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::sub_assign(const From1& x, const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(x) || check_empty_arg(y))
+    return assign(EMPTY);
+  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
+  if (inf_sign != 0) {
+    if (Parma_Polyhedra_Library::infinity_sign(y) == inf_sign)
+      return assign(EMPTY);
+  }
+  else
+    inf_sign = -Parma_Polyhedra_Library::infinity_sign(y);
+  if (inf_sign < 0)
+    return assign(MINUS_INFINITY);
+  else if (inf_sign > 0)
+    return assign(PLUS_INFINITY);
+
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  Result rl;
+  Result ru;
+  PPL_DIRTY_TEMP(To_Boundary, to_lower);
+  rl = Boundary_NS::sub_assign(LOWER, to_lower, to_info,
+                               LOWER, f_lower(x), f_info(x),
+                               UPPER, f_upper(y), f_info(y));
+  ru = Boundary_NS::sub_assign(UPPER, upper(), to_info,
+                               UPPER, f_upper(x), f_info(x),
+                               LOWER, f_lower(y), f_info(y));
+  assign_or_swap(lower(), to_lower);
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+/**
++---------+-----------+-----------+-----------------+
+|    *    |  yl > 0   |  yu < 0   |  yl < 0, yu > 0 |
++---------+-----------+-----------+-----------------+
+| xl > 0  |xl*yl,xu*yu|xu*yl,xl*yu|   xu*yl,xu*yu   |
++---------+-----------+-----------+-----------------+
+| xu < 0  |xl*yu,xu*yl|xu*yu,xl*yl|   xl*yu,xl*yl   |
++---------+-----------+-----------+-----------------+
+|xl<0 xu>0|xl*yu,xu*yu|xu*yl,xl*yl|min(xl*yu,xu*yl),|
+|         |           |           |max(xl*yl,xu*yu) |
++---------+-----------+-----------+-----------------+
+**/
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::mul_assign(const From1& x, const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(x) || check_empty_arg(y))
+    return assign(EMPTY);
+  int xls = sgn_b(LOWER, f_lower(x), f_info(x));
+  int xus = (xls > 0) ? 1 : sgn_b(UPPER, f_upper(x), f_info(x));
+  int yls = sgn_b(LOWER, f_lower(y), f_info(y));
+  int yus = (yls > 0) ? 1 : sgn_b(UPPER, f_upper(y), f_info(y));
+  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
+  int ls;
+  int us;
+  if (inf_sign != 0) {
+    ls = yls;
+    us = yus;
+    goto inf;
+  }
+  else {
+    inf_sign = Parma_Polyhedra_Library::infinity_sign(y);
+    if (inf_sign != 0) {
+      ls = xls;
+      us = xus;
+    inf:
+      if (ls == 0 && us == 0)
+        return assign(EMPTY);
+      if (ls == -us)
+        return set_infinities();
+      if (ls < 0 || us < 0)
+        inf_sign = -inf_sign;
+      if (inf_sign < 0)
+        return assign(MINUS_INFINITY);
+      else
+        return assign(PLUS_INFINITY);
+    }
+  }
+
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  Result rl;
+  Result ru;
+  PPL_DIRTY_TEMP(To_Boundary, to_lower);
+
+  if (xls >= 0) {
+    if (yls >= 0) {
+      // 0 <= xl <= xu, 0 <= yl <= yu
+      rl = mul_assign_z(LOWER, to_lower, to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
+      ru = mul_assign_z(UPPER, upper(), to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
+    }
+    else if (yus <= 0) {
+      // 0 <= xl <= xu, yl <= yu <= 0
+      rl = mul_assign_z(LOWER, to_lower, to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
+      ru = mul_assign_z(UPPER, upper(), to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
+    }
+    else {
+      // 0 <= xl <= xu, yl < 0 < yu
+      rl = mul_assign_z(LOWER, to_lower, to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
+      ru = mul_assign_z(UPPER, upper(), to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
+    }
+  }
+  else if (xus <= 0) {
+    if (yls >= 0) {
+      // xl <= xu <= 0, 0 <= yl <= yu
+      rl = mul_assign_z(LOWER, to_lower, to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
+      ru = mul_assign_z(UPPER, upper(), to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
+    }
+    else if (yus <= 0) {
+      // xl <= xu <= 0, yl <= yu <= 0
+      rl = mul_assign_z(LOWER, to_lower, to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
+      ru = mul_assign_z(UPPER, upper(), to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
+    }
+    else {
+      // xl <= xu <= 0, yl < 0 < yu
+      rl = mul_assign_z(LOWER, to_lower, to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
+      ru = mul_assign_z(UPPER, upper(), to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
+    }
+  }
+  else if (yls >= 0) {
+    // xl < 0 < xu, 0 <= yl <= yu
+    rl = mul_assign_z(LOWER, to_lower, to_info,
+                      LOWER, f_lower(x), f_info(x), xls,
+                      UPPER, f_upper(y), f_info(y), yus);
+    ru = mul_assign_z(UPPER, upper(), to_info,
+                      UPPER, f_upper(x), f_info(x), xus,
+                      UPPER, f_upper(y), f_info(y), yus);
+  }
+  else if (yus <= 0) {
+    // xl < 0 < xu, yl <= yu <= 0
+    rl = mul_assign_z(LOWER, to_lower, to_info,
+                      UPPER, f_upper(x), f_info(x), xus,
+                      LOWER, f_lower(y), f_info(y), yls);
+    ru = mul_assign_z(UPPER, upper(), to_info,
+                      LOWER, f_lower(x), f_info(x), xls,
+                      LOWER, f_lower(y), f_info(y), yls);
+  }
+  else {
+    // xl < 0 < xu, yl < 0 < yu
+    PPL_DIRTY_TEMP(To_Boundary, tmp);
+    PPL_DIRTY_TEMP(To_Info, tmp_info);
+    tmp_info.clear();
+    Result tmp_r;
+    tmp_r = Boundary_NS::mul_assign(LOWER, tmp, tmp_info,
+                                    UPPER, f_upper(x), f_info(x),
+                                    LOWER, f_lower(y), f_info(y));
+    rl = Boundary_NS::mul_assign(LOWER, to_lower, to_info,
+                                 LOWER, f_lower(x), f_info(x),
+                                 UPPER, f_upper(y), f_info(y));
+    if (gt(LOWER, to_lower, to_info, LOWER, tmp, tmp_info)) {
+      to_lower = tmp;
+      rl = tmp_r;
+    }
+    tmp_info.clear();
+    tmp_r = Boundary_NS::mul_assign(UPPER, tmp, tmp_info,
+                                    UPPER, f_upper(x), f_info(x),
+                                    UPPER, f_upper(y), f_info(y));
+    ru = Boundary_NS::mul_assign(UPPER, upper(), to_info,
+                                 LOWER, f_lower(x), f_info(x),
+                                 LOWER, f_lower(y), f_info(y));
+    if (lt(UPPER, upper(), to_info, UPPER, tmp, tmp_info)) {
+      upper() = tmp;
+      ru = tmp_r;
+    }
+  }
+  assign_or_swap(lower(), to_lower);
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+/**
++-----------+-----------+-----------+
+|     /     |  yu < 0   |  yl > 0   |
++-----------+-----------+-----------+
+|   xu<=0   |xu/yl,xl/yu|xl/yl,xu/yu|
++-----------+-----------+-----------+
+|xl<=0 xu>=0|xu/yu,xl/yu|xl/yl,xu/yl|
++-----------+-----------+-----------+
+|   xl>=0   |xu/yu,xl/yl|xl/yu,xu/yl|
++-----------+-----------+-----------+
+**/
+template <typename To_Boundary, typename To_Info>
+template <typename From1, typename From2>
+inline typename Enable_If<((Is_Singleton<From1>::value
+                            || Is_Interval<From1>::value)
+                           && (Is_Singleton<From2>::value
+                               || Is_Interval<From2>::value)), I_Result>::type
+Interval<To_Boundary, To_Info>::div_assign(const From1& x, const From2& y) {
+  PPL_ASSERT(f_OK(x));
+  PPL_ASSERT(f_OK(y));
+  if (check_empty_arg(x) || check_empty_arg(y))
+    return assign(EMPTY);
+  int yls = sgn_b(LOWER, f_lower(y), f_info(y));
+  int yus = (yls > 0) ? 1 : sgn_b(UPPER, f_upper(y), f_info(y));
+  if (yls == 0 && yus == 0)
+    return assign(EMPTY);
+  int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
+  if (inf_sign != 0) {
+    if (Parma_Polyhedra_Library::infinity_sign(y) != 0)
+      return assign(EMPTY);
+    if (yls == -yus)
+      return set_infinities();
+    if (yls < 0 || yus < 0)
+    inf_sign = -inf_sign;
+    if (inf_sign < 0)
+      return assign(MINUS_INFINITY);
+    else
+      return assign(PLUS_INFINITY);
+  }
+  int xls = sgn_b(LOWER, f_lower(x), f_info(x));
+  int xus = (xls > 0) ? 1 : sgn_b(UPPER, f_upper(x), f_info(x));
+
+  PPL_DIRTY_TEMP(To_Info, to_info);
+  to_info.clear();
+  Result rl;
+  Result ru;
+  PPL_DIRTY_TEMP(To_Boundary, to_lower);
+  if (yls >= 0) {
+    if (xls >= 0) {
+      rl = div_assign_z(LOWER, to_lower, to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
+      ru = div_assign_z(UPPER, upper(), to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
+    }
+    else if (xus <= 0) {
+      rl = div_assign_z(LOWER, to_lower, to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
+      ru = div_assign_z(UPPER, upper(), to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
+    }
+    else {
+      rl = div_assign_z(LOWER, to_lower, to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
+      ru = div_assign_z(UPPER, upper(), to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
+    }
+  }
+  else if (yus <= 0) {
+    if (xls >= 0) {
+      rl = div_assign_z(LOWER, to_lower, to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
+      ru = div_assign_z(UPPER, upper(), to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
+    }
+    else if (xus <= 0) {
+      rl = div_assign_z(LOWER, to_lower, to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
+      ru = div_assign_z(UPPER, upper(), to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
+    }
+    else {
+      rl = div_assign_z(LOWER, to_lower, to_info,
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
+      ru = div_assign_z(UPPER, upper(), to_info,
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
+    }
+  }
+  else {
+    return static_cast<I_Result>(assign(UNIVERSE) | I_SINGULARITIES);
+  }
+  assign_or_swap(lower(), to_lower);
+  assign_or_swap(info(), to_info);
+  PPL_ASSERT(OK());
+  return combine(rl, ru);
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator+(const Interval<B, Info>& x, const T& y) {
+  Interval<B, Info> z;
+  z.add_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator+(const T& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.add_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info>
+inline Interval<B, Info>
+operator+(const Interval<B, Info>& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.add_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator-(const Interval<B, Info>& x, const T& y) {
+  Interval<B, Info> z;
+  z.sub_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator-(const T& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.sub_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info>
+inline Interval<B, Info>
+operator-(const Interval<B, Info>& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.sub_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator*(const Interval<B, Info>& x, const T& y) {
+  Interval<B, Info> z;
+  z.mul_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator*(const T& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.mul_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info>
+inline Interval<B, Info>
+operator*(const Interval<B, Info>& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.mul_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator/(const Interval<B, Info>& x, const T& y) {
+  Interval<B, Info> z;
+  z.div_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info, typename T>
+inline typename Enable_If<Is_Singleton<T>::value, Interval<B, Info> >::type
+operator/(const T& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.div_assign(x, y);
+  return z;
+}
+
+template <typename B, typename Info>
+inline Interval<B, Info>
+operator/(const Interval<B, Info>& x, const Interval<B, Info>& y) {
+  Interval<B, Info> z;
+  z.div_assign(x, y);
+  return z;
+}
+
+template <typename Boundary, typename Info>
+inline std::ostream&
+operator<<(std::ostream& os, const Interval<Boundary, Info>& x) {
+  if (check_empty_arg(x))
+    return os << "[]";
+  if (x.is_singleton()) {
+    output(os, x.lower(), Numeric_Format(), ROUND_NOT_NEEDED);
+    return os;
+  }
+  os << (x.lower_is_open() ? "(" : "[");
+  if (x.info().get_boundary_property(LOWER, SPECIAL))
+    os << "-inf";
+  else
+    output(os, x.lower(), Numeric_Format(), ROUND_NOT_NEEDED);
+  os << ", ";
+  if (x.info().get_boundary_property(UPPER, SPECIAL))
+    os << "+inf";
+  else
+    output(os, x.upper(), Numeric_Format(), ROUND_NOT_NEEDED);
+  os << (x.upper_is_open() ? ")" : "]");
+  return os;
+}
+
+template <typename Boundary, typename Info>
+inline void
+Interval<Boundary, Info>::ascii_dump(std::ostream& s) const {
+  using Parma_Polyhedra_Library::ascii_dump;
+  s << "info ";
+  info().ascii_dump(s);
+  s << " lower ";
+  ascii_dump(s, lower());
+  s << " upper ";
+  ascii_dump(s, upper());
+  s << '\n';
+}
+
+template <typename Boundary, typename Info>
+inline bool
+Interval<Boundary, Info>::ascii_load(std::istream& s) {
+  using Parma_Polyhedra_Library::ascii_load;
+  std::string str;
+  if (!(s >> str) || str != "info")
+    return false;
+  if (!info().ascii_load(s))
+    return false;
+  if (!(s >> str) || str != "lower")
+    return false;
+  if (!ascii_load(s, lower()))
+    return false;
+  if (!(s >> str) || str != "upper")
+    return false;
+  if (!ascii_load(s, upper()))
+    return false;
+  PPL_ASSERT(OK());
+  return true;
+}
+
+/*! \brief
+  Helper class to select the appropriate numerical type to perform
+  boundary computations so as to reduce the chances of overflow without
+  incurring too much overhead.
+*/
+template <typename Interval_Boundary_Type> struct Select_Temp_Boundary_Type;
+
+template <typename Interval_Boundary_Type>
+struct Select_Temp_Boundary_Type {
+  typedef Interval_Boundary_Type type;
+};
+
+#if PPL_SUPPORTED_DOUBLE
+template <>
+struct Select_Temp_Boundary_Type<float> {
+  typedef double type;
+};
+#endif
+
+template <>
+struct Select_Temp_Boundary_Type<char> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<signed char> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<unsigned char> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<signed short> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<unsigned short> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<signed int> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<unsigned int> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<signed long> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<unsigned long> {
+  typedef signed long long type;
+};
+
+template <>
+struct Select_Temp_Boundary_Type<unsigned long long> {
+  typedef signed long long type;
+};
+
+/*! \relates Interval */
+template <typename Boundary, typename Info>
+inline void
+swap(Interval<Boundary, Info>& x, Interval<Boundary, Info>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Interval_inlines_hh)
diff --git a/src/Interval_templates.hh b/src/Interval_templates.hh
new file mode 100644
index 0000000..fca1b17
--- /dev/null
+++ b/src/Interval_templates.hh
@@ -0,0 +1,402 @@
+/* Interval class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Interval_templates_hh
+#define PPL_Interval_templates_hh 1
+
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Boundary, typename Info>
+template <typename C>
+typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
+Interval<Boundary, Info>::lower_extend(const C& c) {
+  PPL_ASSERT(OK());
+  bool open;
+  switch (c.rel()) {
+  case V_LGE:
+    return lower_extend();
+  case V_NAN:
+    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
+  case V_GT:
+    open = true;
+    break;
+  case V_GE: // Fall through.
+  case V_EQ:
+    open = false;
+    break;
+  default:
+    PPL_UNREACHABLE;
+    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
+  }
+  min_assign(LOWER, lower(), info(), LOWER, c.value(), f_info(c.value(), open));
+  PPL_ASSERT(OK());
+  return I_ANY;
+}
+
+template <typename Boundary, typename Info>
+template <typename C>
+typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C>::value, I_Result>::type
+Interval<Boundary, Info>::upper_extend(const C& c) {
+  PPL_ASSERT(OK());
+  bool open;
+  switch (c.rel()) {
+  case V_LGE:
+    return lower_extend();
+  case V_NAN:
+    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
+  case V_LT:
+    open = true;
+    break;
+  case V_LE: // Fall through.
+  case V_EQ:
+    open = false;
+    break;
+  default:
+    PPL_UNREACHABLE;
+    return I_NOT_EMPTY | I_EXACT | I_UNCHANGED;
+  }
+  max_assign(UPPER, upper(), info(), UPPER, c.value(), f_info(c.value(), open));
+  PPL_ASSERT(OK());
+  return I_ANY;
+}
+
+template <typename Boundary, typename Info>
+template <typename From, typename Iterator>
+typename Enable_If<Is_Interval<From>::value, void>::type
+Interval<Boundary, Info>::CC76_widening_assign(const From& y,
+                                               Iterator first,
+                                               Iterator last) {
+  // We assume that `y' is contained in or equal to `*this'.
+  PPL_ASSERT(contains(y));
+  Interval<Boundary, Info>& x = *this;
+
+  // Upper bound.
+  if (!x.upper_is_boundary_infinity()) {
+    Boundary& x_ub = x.upper();
+    const Boundary& y_ub = y.upper();
+    PPL_ASSERT(!y.upper_is_boundary_infinity() && y_ub <= x_ub);
+    if (y_ub < x_ub) {
+      Iterator k = std::lower_bound(first, last, x_ub);
+      if (k != last) {
+        if (x_ub < *k)
+          x_ub = *k;
+      }
+      else
+        x.upper_extend();
+    }
+  }
+
+  // Lower bound.
+  if (!x.lower_is_boundary_infinity()) {
+    Boundary& x_lb = x.lower();
+    const Boundary& y_lb = y.lower();
+    PPL_ASSERT(!y.lower_is_boundary_infinity() && y_lb >= x_lb);
+    if (y_lb > x_lb) {
+      Iterator k = std::lower_bound(first, last, x_lb);
+      if (k != last) {
+        if (x_lb < *k) {
+          if (k != first)
+            x_lb = *--k;
+          else
+            x.lower_extend();
+        }
+      }
+      else {
+        if (k != first)
+          x_lb = *--k;
+        else
+          x.lower_extend();
+      }
+    }
+  }
+}
+
+template <typename Boundary, typename Info>
+Interval<Boundary, Info>::Interval(const char* s) {
+  // Get the lower bound.
+  Boundary lower_bound;
+  Result lower_r = assign_r(lower_bound, s, ROUND_DOWN);
+  if (lower_r == V_CVT_STR_UNK || lower_r == V_NAN) {
+    throw std::invalid_argument("PPL::Interval(const char* s)"
+                                " with s invalid");
+  }
+  lower_r = result_relation_class(lower_r);
+
+  // Get the upper bound.
+  Boundary upper_bound;
+  Result upper_r = assign_r(upper_bound, s, ROUND_UP);
+  PPL_ASSERT(upper_r != V_CVT_STR_UNK && upper_r != V_NAN);
+  upper_r = result_relation_class(upper_r);
+
+  // Build the interval.
+  bool lower_open = false;
+  bool upper_open = false;
+  bool lower_boundary_infinity = false;
+  bool upper_boundary_infinity = false;
+  switch (lower_r) {
+  case V_EQ: // Fall through.
+  case V_GE:
+    break;
+  case V_GT:
+    lower_open = true;
+    break;
+  case V_GT_MINUS_INFINITY:
+    lower_open = true;
+    // Fall through.
+  case V_EQ_MINUS_INFINITY:
+    lower_boundary_infinity = true;
+    break;
+  case V_EQ_PLUS_INFINITY: // Fall through.
+  case V_LT_PLUS_INFINITY:
+    if (upper_r == V_EQ_PLUS_INFINITY || upper_r == V_LT_PLUS_INFINITY)
+      assign(UNIVERSE);
+    else
+      assign(EMPTY);
+    break;
+  default:
+    PPL_UNREACHABLE;
+    break;
+  }
+  switch (upper_r) {
+  case V_EQ: // Fall through.
+  case V_LE:
+    break;
+  case V_LT:
+    upper_open = true;
+    break;
+  case V_EQ_MINUS_INFINITY: // Fall through.
+  case V_GT_MINUS_INFINITY:
+    if (lower_r == V_EQ_MINUS_INFINITY || lower_r == V_GT_MINUS_INFINITY)
+      assign(UNIVERSE);
+    else
+      assign(EMPTY);
+    break;
+  case V_LT_PLUS_INFINITY:
+    upper_open = true;
+    // Fall through.
+  case V_EQ_PLUS_INFINITY:
+    upper_boundary_infinity = true;
+    break;
+  default:
+    PPL_UNREACHABLE;
+    break;
+  }
+
+  if (!lower_boundary_infinity
+      && !upper_boundary_infinity
+      && (lower_bound > upper_bound
+          || (lower_open && lower_bound == upper_bound)))
+    assign(EMPTY);
+  else {
+    if (lower_boundary_infinity)
+      set_minus_infinity(LOWER, lower(), info(), lower_open);
+    else
+      Boundary_NS::assign(LOWER, lower(), info(),
+                          LOWER, lower_bound, SCALAR_INFO, lower_open);
+    if (upper_boundary_infinity)
+      set_plus_infinity(UPPER, upper(), info(), upper_open);
+    else
+      Boundary_NS::assign(UPPER, upper(), info(),
+                          UPPER, upper_bound, SCALAR_INFO, upper_open);
+  }
+}
+
+
+template <typename Boundary, typename Info>
+inline std::istream&
+operator>>(std::istream& is, Interval<Boundary, Info>& x) {
+  Boundary lower_bound;
+  Boundary upper_bound;
+  bool lower_boundary_infinity = false;
+  bool upper_boundary_infinity = false;
+  bool lower_open = false;
+  bool upper_open = false;
+  Result lower_r;
+  Result upper_r;
+
+  // Eat leading white space.
+  char c;
+  do {
+    if (!is.get(c))
+      goto fail;
+  } while (is_space(c));
+
+  // Get the opening parenthesis and handle the empty interval case.
+  if (c == '(')
+    lower_open = true;
+  else if (c == '[') {
+    if (!is.get(c))
+      goto fail;
+    if (c == ']') {
+      // Empty interval.
+      x.assign(EMPTY);
+      return is;
+    }
+    else
+      is.unget();
+  }
+  else
+    goto unexpected;
+
+  // Get the lower bound.
+  lower_r = input(lower_bound, is, ROUND_DOWN);
+  if (lower_r == V_CVT_STR_UNK || lower_r == V_NAN)
+    goto fail;
+  lower_r = result_relation_class(lower_r);
+
+  // Match the comma separating the lower and upper bounds.
+  do {
+    if (!is.get(c))
+      goto fail;
+  } while (is_space(c));
+  if (c != ',')
+    goto unexpected;
+
+  // Get the upper bound.
+  upper_r = input(upper_bound, is, ROUND_UP);
+  if (upper_r == V_CVT_STR_UNK || upper_r == V_NAN)
+    goto fail;
+  upper_r = result_relation_class(upper_r);
+
+  // Get the closing parenthesis.
+  do {
+    if (!is.get(c))
+      goto fail;
+  } while (is_space(c));
+  if (c == ')')
+    upper_open = true;
+  else if (c != ']') {
+  unexpected:
+    is.unget();
+  fail:
+    is.setstate(std::ios::failbit);
+    return is;
+  }
+
+  // Build interval.
+  switch (lower_r) {
+  case V_EQ: // Fall through.
+  case V_GE:
+    break;
+  case V_GT:
+    lower_open = true;
+    break;
+  case V_GT_MINUS_INFINITY:
+    lower_open = true;
+    // Fall through.
+  case V_EQ_MINUS_INFINITY:
+    lower_boundary_infinity = true;
+    break;
+  case V_EQ_PLUS_INFINITY: // Fall through.
+  case V_LT_PLUS_INFINITY:
+    if (upper_r == V_EQ_PLUS_INFINITY || upper_r == V_LT_PLUS_INFINITY)
+      x.assign(UNIVERSE);
+    else
+      x.assign(EMPTY);
+    return is;
+  default:
+    PPL_UNREACHABLE;
+    break;
+  }
+  switch (upper_r) {
+  case V_EQ: // Fall through.
+  case V_LE:
+    break;
+  case V_LT:
+    upper_open = true;
+    break;
+  case V_GT_MINUS_INFINITY:
+    upper_open = true;
+    // Fall through.
+  case V_EQ_MINUS_INFINITY:
+    if (lower_r == V_EQ_MINUS_INFINITY || lower_r == V_GT_MINUS_INFINITY)
+      x.assign(UNIVERSE);
+    else
+      x.assign(EMPTY);
+    return is;
+  case V_EQ_PLUS_INFINITY: // Fall through.
+  case V_LT_PLUS_INFINITY:
+    upper_boundary_infinity = true;
+    break;
+  default:
+    PPL_UNREACHABLE;
+    break;
+  }
+
+  if (!lower_boundary_infinity
+      && !upper_boundary_infinity
+      && (lower_bound > upper_bound
+          || (lower_open && lower_bound == upper_bound)))
+    x.assign(EMPTY);
+  else {
+    if (lower_boundary_infinity)
+      set_minus_infinity(LOWER, x.lower(), x.info(), lower_open);
+    else
+      assign(LOWER, x.lower(), x.info(),
+             LOWER, lower_bound, SCALAR_INFO, lower_open);
+    if (upper_boundary_infinity)
+      set_plus_infinity(UPPER, x.upper(), x.info(), upper_open);
+    else
+      assign(UPPER, x.upper(), x.info(),
+             UPPER, upper_bound, SCALAR_INFO, upper_open);
+  }
+  return is;
+}
+
+template <typename Boundary, typename Info>
+template <typename From>
+typename Enable_If<Is_Interval<From>::value, bool>::type
+Interval<Boundary, Info>::simplify_using_context_assign(const From& y) {
+  // FIXME: the following code wrongly assumes that intervals are closed
+  if (lt(UPPER, upper(), info(), LOWER, f_lower(y), f_info(y))) {
+    lower_extend();
+    return false;
+  }
+  if (gt(LOWER, lower(), info(), UPPER, f_upper(y), f_info(y))) {
+    upper_extend();
+    return false;
+  }
+  // Weakening the upper bound.
+  if (!upper_is_boundary_infinity() && !y.upper_is_boundary_infinity()
+      && y.upper() <= upper())
+    upper_extend();
+  // Weakening the lower bound.
+  if (!lower_is_boundary_infinity() && !y.lower_is_boundary_infinity()
+      && y.lower() >= lower())
+    lower_extend();
+  return true;
+}
+
+template <typename Boundary, typename Info>
+template <typename From>
+typename Enable_If<Is_Interval<From>::value, void>::type
+Interval<Boundary, Info>::empty_intersection_assign(const From&) {
+  // FIXME: write me.
+  assign(EMPTY);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Interval_templates_hh)
diff --git a/src/Interval_types.hh b/src/Interval_types.hh
new file mode 100644
index 0000000..948d0dc
--- /dev/null
+++ b/src/Interval_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Interval_types_hh
+#define PPL_Interval_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Boundary, typename Info>
+class Interval;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Interval_types_hh)
diff --git a/src/Linear_Expression.cc b/src/Linear_Expression.cc
index 7afa29a..4c02145 100644
--- a/src/Linear_Expression.cc
+++ b/src/Linear_Expression.cc
@@ -1,6 +1,6 @@
 /* Linear_Expression class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,14 +23,11 @@ site: http://bugseng.com/products/ppl/ . */
 
 
 #include "ppl-config.h"
-#include "Linear_Expression.defs.hh"
+#include "Linear_Expression_defs.hh"
 
-#include "Linear_Expression_Impl.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-#include "Congruence.defs.hh"
-#include "Grid_Generator.defs.hh"
-#include "Generator.defs.hh"
+#include "Linear_Expression_Impl_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
@@ -85,39 +82,6 @@ PPL::Linear_Expression::Linear_Expression(dimension_type space_dim, bool x,
   }
 }
 
-PPL::Linear_Expression::Linear_Expression(const Congruence& c,
-                                          dimension_type space_dim) {
-  switch (c.expression().representation()) {
-  case DENSE:
-    impl = new Linear_Expression_Impl<Dense_Row>(c, space_dim);
-    break;
-
-  case SPARSE:
-    impl = new Linear_Expression_Impl<Sparse_Row>(c, space_dim);
-    break;
-
-  default:
-    PPL_UNREACHABLE;
-  }
-}
-
-PPL::Linear_Expression::Linear_Expression(const Congruence& c,
-                                          dimension_type space_dim,
-                                          Representation r) {
-  switch (r) {
-  case DENSE:
-    impl = new Linear_Expression_Impl<Dense_Row>(c, space_dim);
-    break;
-
-  case SPARSE:
-    impl = new Linear_Expression_Impl<Sparse_Row>(c, space_dim);
-    break;
-
-  default:
-    PPL_UNREACHABLE;
-  }
-}
-
 PPL::Linear_Expression::Linear_Expression(const Linear_Expression& e) {
   switch (e.representation()) {
   case DENSE:
@@ -198,65 +162,6 @@ PPL::Linear_Expression::Linear_Expression(Coefficient_traits::const_reference n,
   }
 }
 
-PPL::Linear_Expression::Linear_Expression(const Constraint& c)
-  : impl(NULL) {
-  Linear_Expression tmp(c.expression());
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Constraint& c,
-                                          Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(c.expression(), r);
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Generator& g)
-  : impl(NULL) {
-  Linear_Expression tmp(g.expression());
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Generator& g, Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(g.expression(), r);
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Grid_Generator& g)
-  : impl(NULL) {
-  Linear_Expression tmp(g.expression());
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Grid_Generator& g,
-                                          Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(g.expression(), r);
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Congruence& cg)
-  : impl(NULL) {
-  Linear_Expression tmp(cg.expression());
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
-PPL::Linear_Expression::Linear_Expression(const Congruence& cg,
-                                          Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(cg.expression(), r);
-  using std::swap;
-  swap(impl, tmp.impl);
-}
-
 PPL::Linear_Expression::Linear_Expression(const Variable v, Representation r) {
   switch (r) {
   case DENSE:
diff --git a/src/Linear_Expression.defs.hh b/src/Linear_Expression.defs.hh
deleted file mode 100644
index e9ad2d6..0000000
--- a/src/Linear_Expression.defs.hh
+++ /dev/null
@@ -1,1070 +0,0 @@
-/* Linear_Expression class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Expression_defs_hh
-#define PPL_Linear_Expression_defs_hh 1
-
-#include "Linear_Expression.types.hh"
-
-#include "Constraint.types.hh"
-#include "Generator.types.hh"
-#include "Grid_Generator.types.hh"
-#include "Congruence.types.hh"
-#include "Generator.types.hh"
-#include "Constraint.types.hh"
-#include "Constraint_System.types.hh"
-#include "Coefficient.types.hh"
-#include "Polyhedron.types.hh"
-#include "Linear_System.types.hh"
-#include "Grid.types.hh"
-#include "PIP_Problem.types.hh"
-#include "BHRZ03_Certificate.types.hh"
-#include "Scalar_Products.types.hh"
-#include "MIP_Problem.types.hh"
-#include "Box.types.hh"
-#include "Congruence_System.types.hh"
-#include "BD_Shape.types.hh"
-#include "Octagonal_Shape.types.hh"
-#include "termination.types.hh"
-#include "Expression_Hide_Inhomo.types.hh"
-#include "Expression_Hide_Last.types.hh"
-
-#include "Linear_Expression_Interface.defs.hh"
-#include "Variable.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-// Put them in the namespace here to declare them friend later.
-
-//! Returns the linear expression \p e1 + \p e2.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the linear expression \p v + \p w.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(Variable v, Variable w);
-
-//! Returns the linear expression \p v + \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(Variable v, const Linear_Expression& e);
-
-//! Returns the linear expression \p e + \p v.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(const Linear_Expression& e, Variable v);
-
-//! Returns the linear expression \p n + \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the linear expression \p e + \p n.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the linear expression \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator+(const Linear_Expression& e);
-
-//! Returns the linear expression - \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(const Linear_Expression& e);
-
-//! Returns the linear expression \p e1 - \p e2.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(const Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the linear expression \p v - \p w.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(Variable v, Variable w);
-
-//! Returns the linear expression \p v - \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(Variable v, const Linear_Expression& e);
-
-//! Returns the linear expression \p e - \p v.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(const Linear_Expression& e, Variable v);
-
-//! Returns the linear expression \p n - \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the linear expression \p e - \p n.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator-(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the linear expression \p n * \p e.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator*(Coefficient_traits::const_reference n, const Linear_Expression& e);
-
-//! Returns the linear expression \p e * \p n.
-/*! \relates Linear_Expression */
-Linear_Expression
-operator*(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the linear expression \p e1 + \p e2 and assigns it to \p e1.
-/*! \relates Linear_Expression */
-Linear_Expression&
-operator+=(Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the linear expression \p e + \p v and assigns it to \p e.
-/*! \relates Linear_Expression
-  \exception std::length_error
-  Thrown if the space dimension of \p v exceeds
-  <CODE>Linear_Expression::max_space_dimension()</CODE>.
- */
-Linear_Expression&
-operator+=(Linear_Expression& e, Variable v);
-
-//! Returns the linear expression \p e + \p n and assigns it to \p e.
-/*! \relates Linear_Expression */
-Linear_Expression&
-operator+=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the linear expression \p e1 - \p e2 and assigns it to \p e1.
-/*! \relates Linear_Expression */
-Linear_Expression&
-operator-=(Linear_Expression& e1, const Linear_Expression& e2);
-
-//! Returns the linear expression \p e - \p v and assigns it to \p e.
-/*! \relates Linear_Expression
-  \exception std::length_error
-  Thrown if the space dimension of \p v exceeds
-  <CODE>Linear_Expression::max_space_dimension()</CODE>.
- */
-Linear_Expression&
-operator-=(Linear_Expression& e, Variable v);
-
-//! Returns the linear expression \p e - \p n and assigns it to \p e.
-/*! \relates Linear_Expression */
-Linear_Expression&
-operator-=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the linear expression \p n * \p e and assigns it to \p e.
-/*! \relates Linear_Expression */
-Linear_Expression&
-operator*=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Returns the linear expression \p n / \p e and assigns it to \p e.
-/*! \relates Linear_Expression */
-Linear_Expression&
-operator/=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-//! Assigns to \p e its own negation.
-/*! \relates Linear_Expression */
-void
-neg_assign(Linear_Expression& e);
-
-//! Returns the linear expression \p e + \p n * \p v and assigns it to \p e.
-/*! \relates Linear_Expression */
-Linear_Expression&
-add_mul_assign(Linear_Expression& e,
-               Coefficient_traits::const_reference n, Variable v);
-
-//! Sums \p e2 multiplied by \p factor into \p e1.
-/*! \relates Linear_Expression */
-void add_mul_assign(Linear_Expression& e1,
-                    Coefficient_traits::const_reference factor,
-                    const Linear_Expression& e2);
-
-//! Subtracts \p e2 multiplied by \p factor from \p e1.
-/*! \relates Linear_Expression */
-void sub_mul_assign(Linear_Expression& e1,
-                    Coefficient_traits::const_reference factor,
-                    const Linear_Expression& e2);
-
-//! Returns the linear expression \p e - \p n * \p v and assigns it to \p e.
-/*! \relates Linear_Expression */
-Linear_Expression&
-sub_mul_assign(Linear_Expression& e,
-               Coefficient_traits::const_reference n, Variable v);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The basic comparison function.
-/*! \relates Linear_Expression
-
-  \returns -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
-           is greater. The absolute value of the result is 1 if the difference
-           is only in the inhomogeneous terms, 2 otherwise
-
-  The order is a lexicographic. It starts comparing the variables' coefficient,
-  starting from Variable(0), and at the end it compares the inhomogeneous
-  terms.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-int compare(const Linear_Expression& x, const Linear_Expression& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-std::ostream& operator<<(std::ostream& s, const Linear_Expression& e);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-//! A linear expression.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Linear_Expression represents the linear expression
-  \f[
-    \sum_{i=0}^{n-1} a_i x_i + b
-  \f]
-  where \f$n\f$ is the dimension of the vector space,
-  each \f$a_i\f$ is the integer coefficient
-  of the \f$i\f$-th variable \f$x_i\f$
-  and \f$b\f$ is the integer for the inhomogeneous term.
-
-  \par How to build a linear expression.
-
-  Linear expressions are the basic blocks for defining
-  both constraints (i.e., linear equalities or inequalities)
-  and generators (i.e., lines, rays, points and closure points).
-  A full set of functions is defined to provide a convenient interface
-  for building complex linear expressions starting from simpler ones
-  and from objects of the classes Variable and Coefficient:
-  available operators include unary negation,
-  binary addition and subtraction,
-  as well as multiplication by a Coefficient.
-  The space dimension of a linear expression is defined as the maximum
-  space dimension of the arguments used to build it:
-  in particular, the space dimension of a Variable <CODE>x</CODE>
-  is defined as <CODE>x.id()+1</CODE>,
-  whereas all the objects of the class Coefficient have space dimension zero.
-
-  \par Example
-  The following code builds the linear expression \f$4x - 2y - z + 14\f$,
-  having space dimension \f$3\f$:
-  \code
-  Linear_Expression e = 4*x - 2*y - z + 14;
-  \endcode
-  Another way to build the same linear expression is:
-  \code
-  Linear_Expression e1 = 4*x;
-  Linear_Expression e2 = 2*y;
-  Linear_Expression e3 = z;
-  Linear_Expression e = Linear_Expression(14);
-  e += e1 - e2 - e3;
-  \endcode
-  Note that \p e1, \p e2 and \p e3 have space dimension 1, 2 and 3,
-  respectively; also, in the fourth line of code, \p e is created
-  with space dimension zero and then extended to space dimension 3
-  in the fifth line.
-*/
-class Parma_Polyhedra_Library::Linear_Expression {
-public:
-
-  static const Representation default_representation = SPARSE;
-
-  //! Default constructor: returns a copy of Linear_Expression::zero().
-  explicit Linear_Expression(Representation r = default_representation);
-
-  //! Ordinary copy constructor.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  Linear_Expression(const Linear_Expression& e);
-
-  //! Copy constructor that takes also a Representation.
-  Linear_Expression(const Linear_Expression& e, Representation r);
-
-  //! Copy constructor from a Expression_Hide_Inhomo.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Inhomo<Expression>& e);
-
-  //! Copy constructor from a Expression_Hide_Inhomo that takes a
-  //! Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    Representation r);
-
-  //! Copy constructor from a Expression_Hide_Inhomo that takes a space
-  //! dimension.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                             dimension_type space_dim);
-
-  //! Copy constructor from a Expression_Hide_Inhomo that takes a
-  //! space dimension and a Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    dimension_type space_dim, Representation r);
-
-  //! Copy constructor from a Expression_Hide_Last.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Last<Expression>& e);
-
-  //! Copy constructor from a Expression_Hide_Last that takes a
-  //! Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    Representation r);
-
-  //! Copy constructor from a Expression_Hide_Last that takes a space
-  //! dimension.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                             dimension_type space_dim);
-
-  //! Copy constructor from a Expression_Hide_Last that takes a
-  //! space dimension and a Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    dimension_type space_dim, Representation r);
-
-  Linear_Expression& operator=(const Linear_Expression& e);
-
-  //! Destructor.
-  ~Linear_Expression();
-
-  /*! \brief
-    Builds the linear expression corresponding
-    to the inhomogeneous term \p n.
-  */
-  explicit Linear_Expression(Coefficient_traits::const_reference n,
-                             Representation r = default_representation);
-
-  //! Builds the linear expression corresponding to the variable \p v.
-  /*!
-    \exception std::length_error
-    Thrown if the space dimension of \p v exceeds
-    <CODE>Linear_Expression::max_space_dimension()</CODE>.
-  */
-  Linear_Expression(Variable v, Representation r = default_representation);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to constraint \p c.
-  /*!
-    Given the constraint
-    \f$c = \bigl(\sum_{i=0}^{n-1} a_i x_i + b \relsym 0\bigr)\f$,
-    where \f$\mathord{\relsym} \in \{ =, \geq, > \}\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-    If \p c is an inequality (resp., equality) constraint, then
-    the built linear expression is unique up to a positive
-    (resp., non-zero) factor.
-
-    The constructed Linear_Expression has the same representation as \p c.
-  */
-  explicit Linear_Expression(const Constraint& c);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to constraint \p c.
-  /*!
-    Given the constraint
-    \f$c = \bigl(\sum_{i=0}^{n-1} a_i x_i + b \relsym 0\bigr)\f$,
-    where \f$\mathord{\relsym} \in \{ =, \geq, > \}\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-    If \p c is an inequality (resp., equality) constraint, then
-    the built linear expression is unique up to a positive
-    (resp., non-zero) factor.
-  */
-  explicit Linear_Expression(const Constraint& c, Representation r);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to generator \p g
-    (for points and closure points, the divisor is not copied).
-
-    Given the generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    (where, for lines and rays, we have \f$d = 1\f$),
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression will always be 0.
-    If \p g is a ray, point or closure point (resp., a line), then
-    the linear expression is unique up to a positive
-    (resp., non-zero) factor.
-
-    The constructed Linear_Expression has the same representation as \p g.
-  */
-  explicit Linear_Expression(const Generator& g);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to generator \p g
-    (for points and closure points, the divisor is not copied).
-
-    Given the generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    (where, for lines and rays, we have \f$d = 1\f$),
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression will always be 0.
-    If \p g is a ray, point or closure point (resp., a line), then
-    the linear expression is unique up to a positive
-    (resp., non-zero) factor.
-  */
-  explicit Linear_Expression(const Generator& g, Representation r);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to grid generator \p g
-    (for points, parameters and lines the divisor is not copied).
-
-    Given the grid generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression is always 0.
-
-    The constructed Linear_Expression has the same representation as \p g.
-  */
-  explicit Linear_Expression(const Grid_Generator& g);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to grid generator \p g
-    (for points, parameters and lines the divisor is not copied).
-
-    Given the grid generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression is always 0.
-  */
-  explicit Linear_Expression(const Grid_Generator& g, Representation r);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to congruence \p cg.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-
-    The constructed Linear_Expression has the same representation as \p cg.
-  */
-  explicit Linear_Expression(const Congruence& cg);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to congruence \p cg.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-  */
-  explicit Linear_Expression(const Congruence& cg, Representation r);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! A const %iterator on the expression (homogeneous) coefficient that are
-  //! nonzero.
-  /*!
-    These iterators are invalidated by operations that modify the expression.
-  */
-  class const_iterator {
-  private:
-  public:
-    typedef std::bidirectional_iterator_tag iterator_category;
-    typedef const Coefficient value_type;
-    typedef ptrdiff_t difference_type;
-    typedef value_type* pointer;
-    typedef Coefficient_traits::const_reference reference;
-
-    //! Constructs an invalid const_iterator.
-    /*!
-      This constructor takes \f$O(1)\f$ time.
-    */
-    explicit const_iterator();
-
-    //! The copy constructor.
-    /*!
-      \param itr
-      The %iterator that will be copied.
-
-      This constructor takes \f$O(1)\f$ time.
-    */
-    const_iterator(const const_iterator& itr);
-
-    ~const_iterator();
-
-    //! Swaps itr with *this.
-    /*!
-      \param itr
-      The %iterator that will be swapped with *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    void m_swap(const_iterator& itr);
-
-    //! Assigns \p itr to *this .
-    /*!
-      \param itr
-      The %iterator that will be assigned into *this.
-
-      This method takes \f$O(1)\f$ time.
-    */
-    const_iterator& operator=(const const_iterator& itr);
-
-    //! Navigates to the next nonzero coefficient.
-    /*!
-      This method takes \f$O(n)\f$ time for dense expressions, and
-      \f$O(1)\f$ time for sparse expressions.
-    */
-    const_iterator& operator++();
-
-    //! Navigates to the previous nonzero coefficient.
-    /*!
-      This method takes \f$O(n)\f$ time for dense expressions, and
-      \f$O(1)\f$ time for sparse expressions.
-    */
-    const_iterator& operator--();
-
-    //! Returns the current element.
-    reference operator*() const;
-
-    //! Returns the variable of the coefficient pointed to by \c *this.
-    /*!
-      \returns the variable of the coefficient pointed to by \c *this.
-    */
-    Variable variable() const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    bool operator==(const const_iterator& x) const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    bool operator!=(const const_iterator& x) const;
-
-  private:
-    //! Constructor from a const_iterator_interface*.
-    //! The new object takes ownership of the dynamic object.
-    const_iterator(Linear_Expression_Interface::const_iterator_interface* itr);
-
-    Linear_Expression_Interface::const_iterator_interface* itr;
-
-    friend class Linear_Expression;
-  };
-
-  //! Returns an iterator that points to the first nonzero coefficient in the
-  //! expression.
-  const_iterator begin() const;
-
-  //! Returns an iterator that points to the last nonzero coefficient in the
-  //! expression.
-  const_iterator end() const;
-
-  //! Returns an iterator that points to the first nonzero coefficient of a
-  //! variable bigger than or equal to v.
-  const_iterator lower_bound(Variable v) const;
-
-  //! Returns the maximum space dimension a Linear_Expression can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Sets the dimension of the vector space enclosing \p *this to \p n .
-  void set_space_dimension(dimension_type n);
-
-  //! Returns the coefficient of \p v in \p *this.
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Sets the coefficient of \p v in \p *this to \p n.
-  void set_coefficient(Variable v,
-                       Coefficient_traits::const_reference n);
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Sets the inhomogeneous term of \p *this to \p n.
-  void set_inhomogeneous_term(Coefficient_traits::const_reference n);
-
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param v
-    The variable whose coefficient has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  void linear_combine(const Linear_Expression& y, Variable v);
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
-  //! c1 and c2 are not 0.
-  void linear_combine(const Linear_Expression& y,
-                      Coefficient_traits::const_reference c1,
-                      Coefficient_traits::const_reference c2);
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
-  //! c1 and c2 may be 0.
-  void linear_combine_lax(const Linear_Expression& y,
-                          Coefficient_traits::const_reference c1,
-                          Coefficient_traits::const_reference c2);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Removes all the specified dimensions from the expression.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Permutes the space dimensions of the expression.
-  /*!
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  bool is_zero() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  bool all_homogeneous_terms_are_zero() const;
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  //! Returns the (zero-dimension space) constant 0.
-  static const Linear_Expression& zero();
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Linear_Expression& y);
-
-  //! Copy constructor with a specified space dimension.
-  Linear_Expression(const Linear_Expression& e, dimension_type space_dim);
-
-  //! Copy constructor with a specified space dimension and representation.
-  Linear_Expression(const Linear_Expression& e, dimension_type space_dim,
-                    Representation r);
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  bool is_equal_to(const Linear_Expression& x) const;
-
-  //! Normalizes the modulo of the coefficients and of the inhomogeneous term
-  //! so that they are mutually prime.
-  /*!
-    Computes the Greatest Common Divisor (GCD) among the coefficients
-    and the inhomogeneous term and normalizes them by the GCD itself.
-  */
-  void normalize();
-
-  //! Ensures that the first nonzero homogeneous coefficient is positive,
-  //! by negating the row if necessary.
-  void sign_normalize();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  bool all_zeroes(const Variables_Set& vars) const;
-
-private:
-  /*! \brief
-    Holds (between class initialization and finalization) a pointer to
-    the (zero-dimension space) constant 0.
-  */
-  static const Linear_Expression* zero_p;
-
-  Linear_Expression_Interface* impl;
-
-  //! Implementation sizing constructor.
-  /*!
-    The bool parameter is just to avoid problems with
-    the constructor Linear_Expression(Coefficient_traits::const_reference n).
-  */
-  Linear_Expression(dimension_type space_dim, bool,
-                    Representation r = default_representation);
-
-  //! Builds the linear expression corresponding to congruence \p cg, and
-  //! with the specified space dimension.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression
-    \f$\sum_{i=0}^{space_dim-1} a_i x_i + b\f$.
-
-    The constructed Linear_Expression has the same representation as \p cg.
-  */
-  Linear_Expression(const Congruence& cg, dimension_type space_dim);
-
-  //! Builds the linear expression corresponding to congruence \p cg, and
-  //! with the specified space dimension.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression
-    \f$\sum_{i=0}^{space_dim-1} a_i x_i + b\f$.
-  */
-  Linear_Expression(const Congruence& cg, dimension_type space_dim,
-                    Representation r);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the i-th coefficient.
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets the i-th coefficient to n.
-  void set(dimension_type i, Coefficient_traits::const_reference n);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the coefficient of v.
-  Coefficient_traits::const_reference get(Variable v) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets the coefficient of v to n.
-  void set(Variable v, Coefficient_traits::const_reference n);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  bool all_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  Coefficient gcd(dimension_type start, dimension_type end) const;
-
-  void exact_div_assign(Coefficient_traits::const_reference c,
-                        dimension_type start, dimension_type end);
-
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  void linear_combine(const Linear_Expression& y, dimension_type i);
-
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end). It assumes that c1 and c2 are nonzero.
-  void linear_combine(const Linear_Expression& y,
-                      Coefficient_traits::const_reference c1,
-                      Coefficient_traits::const_reference c2,
-                      dimension_type start, dimension_type end);
-
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end). c1 and c2 may be zero.
-  void linear_combine_lax(const Linear_Expression& y,
-                          Coefficient_traits::const_reference c1,
-                          Coefficient_traits::const_reference c2,
-                          dimension_type start, dimension_type end);
-
-  //! Equivalent to <CODE>(*this)[i] *= n</CODE>, for each i in [start, end).
-  void mul_assign(Coefficient_traits::const_reference n,
-                  dimension_type start, dimension_type end);
-
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  dimension_type last_nonzero() const;
-
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
-
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  bool all_zeroes_except(const Variables_Set& vars,
-                         dimension_type start, dimension_type end) const;
-
-  //! Sets results to the sum of (*this)[i]*y[i], for each i.
-  void scalar_product_assign(Coefficient& result,
-                             const Linear_Expression& y) const;
-
-  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
-  void scalar_product_assign(Coefficient& result, const Linear_Expression& y,
-                             dimension_type start, dimension_type end) const;
-
-  //! Computes the sign of the sum of (*this)[i]*y[i], for each i.
-  int scalar_product_sign(const Linear_Expression& y) const;
-
-  //! Computes the sign of the sum of (*this)[i]*y[i],
-  //! for each i in [start,end).
-  int scalar_product_sign(const Linear_Expression& y,
-                          dimension_type start, dimension_type end) const;
-
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  bool is_equal_to(const Linear_Expression& x,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  bool is_equal_to(const Linear_Expression& x,
-                   Coefficient_traits::const_reference c1,
-                   Coefficient_traits::const_reference c2,
-                   dimension_type start, dimension_type end) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Dense_Row& row) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Sparse_Row& row) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  bool have_a_common_variable(const Linear_Expression& x,
-                              Variable first, Variable last) const;
-
-  /*! \brief
-    Negates the elements from index \p first (included)
-    to index \p last (excluded).
-  */
-  void negate(dimension_type first, dimension_type last);
-
-  template <typename Row>
-  friend class Linear_Expression_Impl;
-
-  // NOTE: The following classes are friends of Linear_Expression in order
-  // to access its private methods.
-  // Since they are *not* friend of Linear_Expression_Impl, they can only
-  // access its public methods so they cannot break the class invariant of
-  // Linear_Expression_Impl.
-  friend class Grid;
-  friend class Congruence;
-  friend class Polyhedron;
-  friend class PIP_Tree_Node;
-  friend class Grid_Generator;
-  friend class Generator;
-  friend class Constraint;
-  friend class Constraint_System;
-  friend class PIP_Problem;
-  friend class BHRZ03_Certificate;
-  friend class Scalar_Products;
-  friend class MIP_Problem;
-  friend class Box_Helpers;
-  friend class Congruence_System;
-  friend class BD_Shape_Helpers;
-  friend class Octagonal_Shape_Helper;
-  friend class Termination_Helpers;
-  template <typename T>
-  friend class BD_Shape;
-  template <typename T>
-  friend class Octagonal_Shape;
-  template <typename T>
-  friend class Linear_System;
-  template <typename T>
-  friend class Box;
-  template <typename T>
-  friend class Expression_Hide_Inhomo;
-  template <typename T>
-  friend class Expression_Hide_Last;
-
-  friend Linear_Expression
-  operator+(const Linear_Expression& e1, const Linear_Expression& e2);
-  friend Linear_Expression
-  operator+(Coefficient_traits::const_reference n, const Linear_Expression& e);
-  friend Linear_Expression
-  operator+(const Linear_Expression& e, Coefficient_traits::const_reference n);
-  friend Linear_Expression
-  operator+(Variable v, const Linear_Expression& e);
-  friend Linear_Expression
-  operator+(Variable v, Variable w);
-
-  friend Linear_Expression
-  operator-(const Linear_Expression& e);
-
-  friend Linear_Expression
-  operator-(const Linear_Expression& e1, const Linear_Expression& e2);
-  friend Linear_Expression
-  operator-(Variable v, Variable w);
-  friend Linear_Expression
-  operator-(Coefficient_traits::const_reference n, const Linear_Expression& e);
-  friend Linear_Expression
-  operator-(const Linear_Expression& e, Coefficient_traits::const_reference n);
-  friend Linear_Expression
-  operator-(Variable v, const Linear_Expression& e);
-  friend Linear_Expression
-  operator-(const Linear_Expression& e, Variable v);
-
-  friend Linear_Expression
-  operator*(Coefficient_traits::const_reference n, const Linear_Expression& e);
-  friend Linear_Expression
-  operator*(const Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Linear_Expression&
-  operator+=(Linear_Expression& e1, const Linear_Expression& e2);
-  friend Linear_Expression&
-  operator+=(Linear_Expression& e, Variable v);
-  friend Linear_Expression&
-  operator+=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Linear_Expression&
-  operator-=(Linear_Expression& e1, const Linear_Expression& e2);
-  friend Linear_Expression&
-  operator-=(Linear_Expression& e, Variable v);
-  friend Linear_Expression&
-  operator-=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend Linear_Expression&
-  operator*=(Linear_Expression& e, Coefficient_traits::const_reference n);
-  friend Linear_Expression&
-  operator/=(Linear_Expression& e, Coefficient_traits::const_reference n);
-
-  friend void
-  neg_assign(Linear_Expression& e);
-
-  friend Linear_Expression&
-  add_mul_assign(Linear_Expression& e,
-                 Coefficient_traits::const_reference n, Variable v);
-  friend Linear_Expression&
-  sub_mul_assign(Linear_Expression& e,
-                 Coefficient_traits::const_reference n, Variable v);
-
-  friend void
-  add_mul_assign(Linear_Expression& e1,
-                 Coefficient_traits::const_reference factor,
-                 const Linear_Expression& e2);
-  friend void
-  sub_mul_assign(Linear_Expression& e1,
-                 Coefficient_traits::const_reference factor,
-                 const Linear_Expression& e2);
-
-  friend int
-  compare(const Linear_Expression& x, const Linear_Expression& y);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators
-  ::operator<<(std::ostream& s, const Linear_Expression& e);
-};
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Linear_Expression */
-void swap(Linear_Expression& x, Linear_Expression& y);
-
-//! Swaps \p x with \p y.
-/*! \relates Linear_Expression::const_iterator */
-void swap(Linear_Expression::const_iterator& x,
-          Linear_Expression::const_iterator& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Linear_Expression.inlines.hh"
-
-#endif // !defined(PPL_Linear_Expression_defs_hh)
diff --git a/src/Linear_Expression.inlines.hh b/src/Linear_Expression.inlines.hh
deleted file mode 100644
index c83b3aa..0000000
--- a/src/Linear_Expression.inlines.hh
+++ /dev/null
@@ -1,880 +0,0 @@
-/* Linear_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Expression_inlines_hh
-#define PPL_Linear_Expression_inlines_hh 1
-
-#include "Expression_Hide_Inhomo.defs.hh"
-#include "Expression_Hide_Last.defs.hh"
-
-
-namespace Parma_Polyhedra_Library {
-
-inline Linear_Expression&
-Linear_Expression::operator=(const Linear_Expression& e) {
-  Linear_Expression tmp = e;
-  swap(*this, tmp);
-  return *this;
-}
-
-inline
-Linear_Expression::~Linear_Expression() {
-  delete impl;
-}
-
-inline Representation
-Linear_Expression::representation() const {
-  return impl->representation();
-}
-
-inline dimension_type
-Linear_Expression::space_dimension() const {
-  return impl->space_dimension();
-}
-
-inline void
-Linear_Expression::set_space_dimension(dimension_type n) {
-  impl->set_space_dimension(n);
-}
-
-inline Coefficient_traits::const_reference
-Linear_Expression::coefficient(Variable v) const {
-  return impl->coefficient(v);
-}
-
-inline void
-Linear_Expression
-::set_coefficient(Variable v, Coefficient_traits::const_reference n) {
-  impl->set_coefficient(v, n);
-}
-
-inline Coefficient_traits::const_reference
-Linear_Expression::inhomogeneous_term() const {
-  return impl->inhomogeneous_term();
-}
-
-inline void
-Linear_Expression
-::set_inhomogeneous_term(Coefficient_traits::const_reference n) {
-  impl->set_inhomogeneous_term(n);
-}
-
-inline void
-Linear_Expression::swap_space_dimensions(Variable v1, Variable v2) {
-  impl->swap_space_dimensions(v1, v2);
-}
-
-inline void
-Linear_Expression::shift_space_dimensions(Variable v, dimension_type n) {
-  impl->shift_space_dimensions(v, n);
-}
-
-inline bool
-Linear_Expression::is_zero() const {
-  return impl->is_zero();
-}
-
-inline bool
-Linear_Expression::all_homogeneous_terms_are_zero() const {
-  return impl->all_homogeneous_terms_are_zero();
-}
-
-inline const Linear_Expression&
-Linear_Expression::zero() {
-  PPL_ASSERT(zero_p != 0);
-  return *zero_p;
-}
-
-inline memory_size_type
-Linear_Expression::external_memory_in_bytes() const {
-  return impl->total_memory_in_bytes();
-}
-
-inline memory_size_type
-Linear_Expression::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator+(const Linear_Expression& e) {
-  return e;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator+(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  Linear_Expression x = e;
-  x += n;
-  return x;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator+(const Linear_Expression& e, const Variable v) {
-  Linear_Expression x = e;
-  x += v;
-  return x;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator-(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  Linear_Expression x = e;
-  x -= n;
-  return x;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator-(const Variable v, const Variable w) {
-  const dimension_type v_space_dim = v.space_dimension();
-  const dimension_type w_space_dim = w.space_dimension();
-  const dimension_type space_dim = std::max(v_space_dim, w_space_dim);
-  if (space_dim > Linear_Expression::max_space_dimension())
-    throw std::length_error("Linear_Expression "
-                            "PPL::operator+(v, w):\n"
-                            "v or w exceed the maximum allowed "
-                            "space dimension.");
-  if (v_space_dim >= w_space_dim) {
-    Linear_Expression e(v);
-    e -= w;
-    return e;
-  } else {
-    Linear_Expression e(w.space_dimension(), true);
-    e -= w;
-    e += v;
-    return e;
-  }
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator*(const Linear_Expression& e, Coefficient_traits::const_reference n) {
-  Linear_Expression x = e;
-  x *= n;
-  return x;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression&
-operator+=(Linear_Expression& e, Coefficient_traits::const_reference n) {
-  *e.impl += n;
-  return e;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression&
-operator-=(Linear_Expression& e, Coefficient_traits::const_reference n) {
-  *e.impl -= n;
-  return e;
-}
-
-inline void
-Linear_Expression::m_swap(Linear_Expression& y) {
-  using std::swap;
-  swap(impl, y.impl);
-}
-
-inline void
-Linear_Expression::normalize() {
-  impl->normalize();
-}
-
-inline void
-Linear_Expression::ascii_dump(std::ostream& s) const {
-  impl->ascii_dump(s);
-}
-
-inline bool
-Linear_Expression::ascii_load(std::istream& s) {
-  return impl->ascii_load(s);
-}
-
-inline void
-Linear_Expression::remove_space_dimensions(const Variables_Set& vars) {
-  impl->remove_space_dimensions(vars);
-}
-
-inline void
-Linear_Expression::permute_space_dimensions(const std::vector<Variable>& cycle) {
-  impl->permute_space_dimensions(cycle);
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator+(const Linear_Expression& e1, const Linear_Expression& e2) {
-  if (e1.space_dimension() >= e2.space_dimension()) {
-    Linear_Expression e = e1;
-    e += e2;
-    return e;
-  } else {
-    Linear_Expression e = e2;
-    e += e1;
-    return e;
-  }
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator+(const Variable v, const Linear_Expression& e) {
-  return e + v;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator+(Coefficient_traits::const_reference n,
-               const Linear_Expression& e) {
-  return e + n;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator+(const Variable v, const Variable w) {
-  const dimension_type v_space_dim = v.space_dimension();
-  const dimension_type w_space_dim = w.space_dimension();
-  const dimension_type space_dim = std::max(v_space_dim, w_space_dim);
-  if (space_dim > Linear_Expression::max_space_dimension())
-    throw std::length_error("Linear_Expression "
-                            "PPL::operator+(v, w):\n"
-                            "v or w exceed the maximum allowed "
-                            "space dimension.");
-  if (v_space_dim >= w_space_dim) {
-    Linear_Expression e(v);
-    e += w;
-    return e;
-  } else {
-    Linear_Expression e(w);
-    e += v;
-    return e;
-  }
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator-(const Linear_Expression& e) {
-  Linear_Expression r(e);
-  neg_assign(r);
-  return r;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator-(const Linear_Expression& e1, const Linear_Expression& e2) {
-  if (e1.space_dimension() >= e2.space_dimension()) {
-    Linear_Expression e = e1;
-    e -= e2;
-    return e;
-  } else {
-    Linear_Expression e = e2;
-    neg_assign(e);
-    e += e1;
-    return e;
-  }
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator-(const Variable v, const Linear_Expression& e) {
-  Linear_Expression result(e, std::max(v.space_dimension(), e.space_dimension()));
-  result.negate(0, e.space_dimension() + 1);
-  result += v;
-  return result;
-}
-
-/*! \relates Linear_Expression */
-inline Linear_Expression
-operator-(const Linear_Expression& e, const Variable v) {
-  Linear_Expression result(e, std::max(v.space_dimension(), e.space_dimension()));
-  result -= v;
-  return result;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator-(Coefficient_traits::const_reference n,
-               const Linear_Expression& e) {
-  Linear_Expression result(e);
-  neg_assign(result);
-  result += n;
-  return result;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression
-operator*(Coefficient_traits::const_reference n,
-               const Linear_Expression& e) {
-  return e * n;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-operator+=(Linear_Expression& e1, const Linear_Expression& e2) {
-  *e1.impl += *e2.impl;
-  return e1;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-operator+=(Linear_Expression& e, const Variable v) {
-  *e.impl += v;
-  return e;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-operator-=(Linear_Expression& e1, const Linear_Expression& e2) {
-  *e1.impl -= *e2.impl;
-  return e1;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-operator-=(Linear_Expression& e, const Variable v) {
-  *e.impl -= v;
-  return e;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-operator*=(Linear_Expression& e, Coefficient_traits::const_reference n) {
-  *e.impl *= n;
-  return e;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-operator/=(Linear_Expression& e, Coefficient_traits::const_reference n) {
-  *e.impl /= n;
-  return e;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline void
-neg_assign(Linear_Expression& e) {
-  e.impl->negate();
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-add_mul_assign(Linear_Expression& e,
-                    Coefficient_traits::const_reference n,
-                    const Variable v) {
-  e.impl->add_mul_assign(n, v);
-  return e;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline Linear_Expression&
-sub_mul_assign(Linear_Expression& e,
-                    Coefficient_traits::const_reference n,
-                    const Variable v) {
-  e.impl->sub_mul_assign(n, v);
-  return e;
-}
-
-inline void
-add_mul_assign(Linear_Expression& e1,
-                    Coefficient_traits::const_reference factor,
-                    const Linear_Expression& e2) {
-  e1.impl->add_mul_assign(factor, *e2.impl);
-}
-
-inline void
-sub_mul_assign(Linear_Expression& e1,
-                    Coefficient_traits::const_reference factor,
-                    const Linear_Expression& e2) {
-  e1.impl->sub_mul_assign(factor, *e2.impl);
-}
-
-inline Coefficient_traits::const_reference
-Linear_Expression::get(dimension_type i) const {
-  return impl->get(i);
-}
-
-inline void
-Linear_Expression::set(dimension_type i,
-                       Coefficient_traits::const_reference n) {
-  impl->set(i, n);
-}
-
-inline Coefficient_traits::const_reference
-Linear_Expression::get(Variable v) const {
-  return impl->get(v.space_dimension());
-}
-
-inline void
-Linear_Expression::set(Variable v,
-                       Coefficient_traits::const_reference n) {
-  impl->set(v.space_dimension(), n);
-}
-
-inline bool
-Linear_Expression::all_zeroes(dimension_type start, dimension_type end) const {
-  return impl->all_zeroes(start, end);
-}
-
-inline dimension_type
-Linear_Expression::num_zeroes(dimension_type start, dimension_type end) const {
-  return impl->num_zeroes(start, end);
-}
-
-inline Coefficient
-Linear_Expression::gcd(dimension_type start, dimension_type end) const {
-  return impl->gcd(start, end);
-}
-
-inline void
-Linear_Expression
-::exact_div_assign(Coefficient_traits::const_reference c,
-                   dimension_type start, dimension_type end) {
-  impl->exact_div_assign(c, start, end);
-}
-
-inline void
-Linear_Expression
-::mul_assign(Coefficient_traits::const_reference c,
-             dimension_type start, dimension_type end) {
-  impl->mul_assign(c, start, end);
-}
-
-inline void
-Linear_Expression::sign_normalize() {
-  impl->sign_normalize();
-}
-
-inline void
-Linear_Expression::negate(dimension_type first, dimension_type last) {
-  impl->negate(first, last);
-}
-
-inline bool
-Linear_Expression::all_zeroes(const Variables_Set& vars) const {
-  return impl->all_zeroes(vars);
-}
-
-inline bool
-Linear_Expression::all_zeroes_except(const Variables_Set& vars, dimension_type start, dimension_type end) const {
-  return impl->all_zeroes_except(vars, start, end);
-}
-
-inline dimension_type
-Linear_Expression::last_nonzero() const {
-  return impl->last_nonzero();
-}
-
-inline void
-Linear_Expression
-::scalar_product_assign(Coefficient& result, const Linear_Expression& y) const {
-  scalar_product_assign(result, y, 0, space_dimension() + 1);
-}
-
-inline void
-Linear_Expression
-::scalar_product_assign(Coefficient& result, const Linear_Expression& y,
-                        dimension_type start, dimension_type end) const {
-  impl->scalar_product_assign(result, *(y.impl), start, end);
-}
-
-inline int
-Linear_Expression
-::scalar_product_sign(const Linear_Expression& y) const {
-  return scalar_product_sign(y, 0, space_dimension() + 1);
-}
-
-inline int
-Linear_Expression
-::scalar_product_sign(const Linear_Expression& y,
-                      dimension_type start, dimension_type end) const {
-  return impl->scalar_product_sign(*(y.impl), start, end);
-}
-
-inline dimension_type
-Linear_Expression
-::first_nonzero(dimension_type first, dimension_type last) const {
-  return impl->first_nonzero(first, last);
-}
-
-inline dimension_type
-Linear_Expression
-::last_nonzero(dimension_type first, dimension_type last) const {
-  return impl->last_nonzero(first, last);
-}
-
-inline void
-Linear_Expression
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
-  return impl->has_a_free_dimension_helper(x);
-}
-
-inline bool
-Linear_Expression
-::is_equal_to(const Linear_Expression& x,
-              dimension_type start, dimension_type end) const {
-  return impl->is_equal_to(*(x.impl), start, end);
-}
-
-inline bool
-Linear_Expression
-::is_equal_to(const Linear_Expression& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  return impl->is_equal_to(*(x.impl), c1, c2, start, end);
-}
-
-inline void
-Linear_Expression
-::get_row(Dense_Row& row) const {
-  return impl->get_row(row);
-}
-
-inline void
-Linear_Expression
-::get_row(Sparse_Row& row) const {
-  return impl->get_row(row);
-}
-
-inline void
-Linear_Expression
-::linear_combine(const Linear_Expression& y, dimension_type i) {
-  impl->linear_combine(*y.impl, i);
-}
-
-inline void
-Linear_Expression
-::linear_combine(const Linear_Expression& y,
-                 Coefficient_traits::const_reference c1,
-                 Coefficient_traits::const_reference c2) {
-  impl->linear_combine(*y.impl, c1, c2);
-}
-
-inline void
-Linear_Expression
-::linear_combine_lax(const Linear_Expression& y,
-                     Coefficient_traits::const_reference c1,
-                     Coefficient_traits::const_reference c2) {
-  impl->linear_combine_lax(*y.impl, c1, c2);
-}
-
-inline int
-compare(const Linear_Expression& x, const Linear_Expression& y) {
-  return x.impl->compare(*y.impl);
-}
-
-inline bool
-Linear_Expression::is_equal_to(const Linear_Expression& x) const {
-  return impl->is_equal_to(*x.impl);
-}
-
-inline void
-Linear_Expression::linear_combine(const Linear_Expression& y,
-                                  Coefficient_traits::const_reference c1,
-                                  Coefficient_traits::const_reference c2,
-                                  dimension_type start,
-                                  dimension_type end) {
-  impl->linear_combine(*y.impl, c1, c2, start, end);
-}
-
-inline void
-Linear_Expression::linear_combine_lax(const Linear_Expression& y,
-                                      Coefficient_traits::const_reference c1,
-                                      Coefficient_traits::const_reference c2,
-                                      dimension_type start,
-                                      dimension_type end) {
-  impl->linear_combine_lax(*y.impl, c1, c2, start, end);
-}
-
-inline bool
-Linear_Expression
-::have_a_common_variable(const Linear_Expression& x,
-                         Variable first, Variable last) const {
-  return impl->have_a_common_variable(*(x.impl), first, last);
-}
-
-inline
-Linear_Expression::const_iterator
-::const_iterator()
-  : itr(NULL) {
-}
-
-inline
-Linear_Expression::const_iterator
-::const_iterator(const const_iterator& x)
-  : itr(x.itr->clone()) {
-}
-
-inline
-Linear_Expression::const_iterator
-::~const_iterator() {
-  // Note that this does nothing if itr==NULL.
-  delete itr;
-}
-
-inline void
-Linear_Expression::const_iterator::m_swap(const_iterator& x) {
-  using std::swap;
-  swap(itr, x.itr);
-}
-
-inline Linear_Expression::const_iterator&
-Linear_Expression::const_iterator
-::operator=(const const_iterator& itr) {
-  const_iterator tmp = itr;
-  using std::swap;
-  swap(*this, tmp);
-  return *this;
-}
-
-inline Linear_Expression::const_iterator&
-Linear_Expression::const_iterator
-::operator++() {
-  PPL_ASSERT(itr != NULL);
-  ++(*itr);
-  return *this;
-}
-
-inline Linear_Expression::const_iterator&
-Linear_Expression::const_iterator
-::operator--() {
-  PPL_ASSERT(itr != NULL);
-  --(*itr);
-  return *this;
-}
-
-inline Linear_Expression::const_iterator::reference
-Linear_Expression::const_iterator
-::operator*() const {
-  PPL_ASSERT(itr != NULL);
-  return *(*itr);
-}
-
-inline Variable
-Linear_Expression::const_iterator
-::variable() const {
-  PPL_ASSERT(itr != NULL);
-  return itr->variable();
-}
-
-inline bool
-Linear_Expression::const_iterator
-::operator==(const const_iterator& x) const {
-  PPL_ASSERT(itr != NULL);
-  PPL_ASSERT(x.itr != NULL);
-  return *itr == *(x.itr);
-}
-
-inline bool
-Linear_Expression::const_iterator
-::operator!=(const const_iterator& x) const {
-  return !(*this == x);
-}
-
-inline
-Linear_Expression::const_iterator
-::const_iterator(Linear_Expression_Interface::const_iterator_interface* itr)
-  : itr(itr) {
-  PPL_ASSERT(itr != NULL);
-}
-
-inline Linear_Expression::const_iterator
-Linear_Expression
-::begin() const {
-  return const_iterator(impl->begin());
-}
-
-inline Linear_Expression::const_iterator
-Linear_Expression
-::end() const {
-  return const_iterator(impl->end());
-}
-
-inline Linear_Expression::const_iterator
-Linear_Expression
-::lower_bound(Variable v) const {
-  return const_iterator(impl->lower_bound(v));
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e)
-  : impl(NULL) {
-  Linear_Expression tmp(e.representation());
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e, Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(r);
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    dimension_type space_dim)
-  : impl(NULL) {
-  Linear_Expression tmp(e.representation());
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  itr_t i_end;
-  if (space_dim <= e.space_dimension())
-    i_end = e.lower_bound(Variable(space_dim));
-  else
-    i_end = e.end();
-  for (itr_t i = e.begin(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    dimension_type space_dim, Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(r);
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  itr_t i_end;
-  if (space_dim <= e.space_dimension())
-    i_end = e.lower_bound(Variable(space_dim));
-  else
-    i_end = e.end();
-  for (itr_t i = e.begin(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e)
-  : impl(NULL) {
-  using std::swap;
-  Linear_Expression tmp(e.representation());
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
-    add_mul_assign(tmp, *i, i.variable());
-  swap(impl, tmp.impl);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e, Representation r)
-  : impl(NULL) {
-  using std::swap;
-  Linear_Expression tmp(r);
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
-    add_mul_assign(tmp, *i, i.variable());
-  swap(impl, tmp.impl);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    dimension_type space_dim)
-  : impl(NULL) {
-  using std::swap;
-  Linear_Expression tmp(e.representation());
-  tmp.set_space_dimension(space_dim);
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
-  itr_t i_end;
-  if (space_dim <= e.space_dimension())
-    i_end = e.lower_bound(Variable(space_dim));
-  else
-    i_end = e.end();
-  for (itr_t i = e.begin(); i != i_end; ++i)
-    add_mul_assign(tmp, *i, i.variable());
-  swap(impl, tmp.impl);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    dimension_type space_dim, Representation r)
-  : impl(NULL) {
-  using std::swap;
-  Linear_Expression tmp(r);
-  tmp.set_space_dimension(space_dim);
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
-  itr_t i_end;
-  if (space_dim <= e.space_dimension())
-    i_end = e.lower_bound(Variable(space_dim));
-  else
-    i_end = e.end();
-  for (itr_t i = e.begin(); i != i_end; ++i)
-    add_mul_assign(tmp, *i, i.variable());
-  swap(impl, tmp.impl);
-}
-
-namespace IO_Operators {
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline std::ostream&
-operator<<(std::ostream& s, const Linear_Expression& e) {
-  e.impl->print(s);
-  return s;
-}
-
-} // namespace IO_Operators
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression */
-inline void
-swap(Linear_Expression& x, Linear_Expression& y) {
-  x.m_swap(y);
-}
-
-/*! \relates Linear_Expression::const_iterator */
-inline void
-swap(Linear_Expression::const_iterator& x,
-     Linear_Expression::const_iterator& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Expression_inlines_hh)
diff --git a/src/Linear_Expression.types.hh b/src/Linear_Expression.types.hh
deleted file mode 100644
index e1dbd17..0000000
--- a/src/Linear_Expression.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Linear_Expression_types_hh
-#define PPL_Linear_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Linear_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Expression_types_hh)
diff --git a/src/Linear_Expression_Impl.cc b/src/Linear_Expression_Impl.cc
index 97ed637..e802c04 100644
--- a/src/Linear_Expression_Impl.cc
+++ b/src/Linear_Expression_Impl.cc
@@ -1,6 +1,6 @@
 /* Linear_Expression_Impl class implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,9 +22,9 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Linear_Expression_Impl.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
+#include "Linear_Expression_Impl_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
 #include "assert.hh"
 #include <iostream>
 
@@ -113,7 +113,8 @@ Linear_Expression_Impl<Sparse_Row>
         row.fast_swap(src.index() - num_removed, src);
         ++src;
       }
-    } else {
+    }
+    else {
       // Shift left the coefficients in [src.index(), row.size()) by
       // num_removed positions.
       while (src != row_end) {
diff --git a/src/Linear_Expression_Impl.defs.hh b/src/Linear_Expression_Impl.defs.hh
deleted file mode 100644
index 2ab6620..0000000
--- a/src/Linear_Expression_Impl.defs.hh
+++ /dev/null
@@ -1,916 +0,0 @@
-/* Linear_Expression_Impl class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Expression_Impl_defs_hh
-#define PPL_Linear_Expression_Impl_defs_hh 1
-
-#include "Linear_Expression_Impl.types.hh"
-#include "Congruence.types.hh"
-#include "Coefficient.defs.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-#include <cstddef>
-#include "Linear_Expression_Interface.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-std::ostream&
-operator<<(std::ostream& s, const Linear_Expression_Impl<Row>& e);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A linear expression.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Linear_Expression_Impl represents the linear
-  expression
-  \f[
-    \sum_{i=0}^{n-1} a_i x_i + b
-  \f]
-  where \f$n\f$ is the dimension of the vector space,
-  each \f$a_i\f$ is the integer coefficient
-  of the \f$i\f$-th variable \f$x_i\f$
-  and \f$b\f$ is the integer for the inhomogeneous term.
-
-  \par How to build a linear expression.
-
-  Linear expressions are the basic blocks for defining
-  both constraints (i.e., linear equalities or inequalities)
-  and generators (i.e., lines, rays, points and closure points).
-  A full set of functions is defined to provide a convenient interface
-  for building complex linear expressions starting from simpler ones
-  and from objects of the classes Variable and Coefficient:
-  available operators include unary negation,
-  binary addition and subtraction,
-  as well as multiplication by a Coefficient.
-  The space dimension of a linear expression is defined as the maximum
-  space dimension of the arguments used to build it:
-  in particular, the space dimension of a Variable <CODE>x</CODE>
-  is defined as <CODE>x.id()+1</CODE>,
-  whereas all the objects of the class Coefficient have space dimension zero.
-
-  \par Example
-  The following code builds the linear expression \f$4x - 2y - z + 14\f$,
-  having space dimension \f$3\f$:
-  \code
-  Linear_Expression_Impl e = 4*x - 2*y - z + 14;
-  \endcode
-  Another way to build the same linear expression is:
-  \code
-  Linear_Expression_Impl e1 = 4*x;
-  Linear_Expression_Impl e2 = 2*y;
-  Linear_Expression_Impl e3 = z;
-  Linear_Expression_Impl e = Linear_Expression_Impl(14);
-  e += e1 - e2 - e3;
-  \endcode
-  Note that \p e1, \p e2 and \p e3 have space dimension 1, 2 and 3,
-  respectively; also, in the fourth line of code, \p e is created
-  with space dimension zero and then extended to space dimension 3
-  in the fifth line.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-class Parma_Polyhedra_Library::Linear_Expression_Impl
-  : public Linear_Expression_Interface {
-public:
-  //! Default constructor: returns a copy of Linear_Expression_Impl::zero().
-  Linear_Expression_Impl();
-
-  //! Ordinary copy constructor.
-  Linear_Expression_Impl(const Linear_Expression_Impl& e);
-
-  //! Copy constructor for other row types.
-  template <typename Row2>
-  Linear_Expression_Impl(const Linear_Expression_Impl<Row2>& e);
-
-  //! Copy constructor from any implementation of Linear_Expression_Interface.
-  Linear_Expression_Impl(const Linear_Expression_Interface& e);
-
-  //! Destructor.
-  virtual ~Linear_Expression_Impl();
-
-  //! Checks if all the invariants are satisfied.
-  virtual bool OK() const;
-
-  /*! \brief
-    Builds the linear expression corresponding
-    to the inhomogeneous term \p n.
-  */
-  explicit Linear_Expression_Impl(Coefficient_traits::const_reference n);
-
-  //! Builds the linear expression corresponding to the variable \p v.
-  /*!
-    \exception std::length_error
-    Thrown if the space dimension of \p v exceeds
-    <CODE>Linear_Expression_Impl::max_space_dimension()</CODE>.
-  */
-  Linear_Expression_Impl(Variable v);
-
-  //! Returns the current representation of this linear expression.
-  virtual Representation representation() const;
-
-  //! An interface for const iterators on the expression (homogeneous)
-  //! coefficients that are nonzero.
-  /*!
-    These iterators are invalidated by operations that modify the expression.
-  */
-  class const_iterator: public const_iterator_interface {
-  public:
-    explicit const_iterator(const Row& row, dimension_type i);
-
-    //! Returns a copy of *this.
-    //! This returns a pointer to dynamic-allocated memory. The caller has the
-    //! duty to free the memory when it's not needed anymore.
-    virtual const_iterator_interface* clone() const;
-
-    //! Navigates to the next nonzero coefficient.
-    //! Note that this method does *not* return a reference, to increase
-    //! efficiency since it's virtual.
-    virtual void operator++();
-
-    //! Navigates to the previous nonzero coefficient.
-    //! Note that this method does *not* return a reference, to increase
-    //! efficiency since it's virtual.
-    virtual void operator--();
-
-    //! Returns the current element.
-    virtual reference operator*() const;
-
-    //! Returns the variable of the coefficient pointed to by \c *this.
-    /*!
-      \returns the variable of the coefficient pointed to by \c *this.
-    */
-    virtual Variable variable() const;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    virtual bool operator==(const const_iterator_interface& x) const;
-
-  private:
-
-    void skip_zeroes_forward();
-    void skip_zeroes_backward();
-
-    const Row* row;
-    typename Row::const_iterator itr;
-  };
-
-  //! This returns a pointer to dynamic-allocated memory. The caller has the
-  //! duty to free the memory when it's not needed anymore.
-  virtual const_iterator_interface* begin() const;
-
-  //! This returns a pointer to dynamic-allocated memory. The caller has the
-  //! duty to free the memory when it's not needed anymore.
-  virtual const_iterator_interface* end() const;
-
-  //! This returns a pointer to dynamic-allocated memory. The caller has the
-  //! duty to free the memory when it's not needed anymore.
-  //! Returns (a pointer to) an iterator that points to the first nonzero
-  //! coefficient of a variable greater than or equal to v, or at end if no
-  //! such coefficient exists.
-  virtual const_iterator_interface* lower_bound(Variable v) const;
-
-  //! Returns the maximum space dimension a Linear_Expression_Impl can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  virtual dimension_type space_dimension() const;
-
-  //! Sets the dimension of the vector space enclosing \p *this to \p n .
-  virtual void set_space_dimension(dimension_type n);
-
-  //! Returns the coefficient of \p v in \p *this.
-  virtual Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Sets the coefficient of \p v in \p *this to \p n.
-  virtual void set_coefficient(Variable v,
-                               Coefficient_traits::const_reference n);
-
-  //! Returns the inhomogeneous term of \p *this.
-  virtual Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Sets the inhomogeneous term of \p *this to \p n.
-  virtual void set_inhomogeneous_term(Coefficient_traits::const_reference n);
-
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param v
-    The variable whose coefficient has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  virtual void linear_combine(const Linear_Expression_Interface& y, Variable v);
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
-  //! \p *this and \p y have the same space dimension.
-  virtual void linear_combine(const Linear_Expression_Interface& y,
-                              Coefficient_traits::const_reference c1,
-                              Coefficient_traits::const_reference c2);
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
-  //! c1 and c2 may be 0.
-  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
-                                  Coefficient_traits::const_reference c1,
-                                  Coefficient_traits::const_reference c2);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  virtual void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! Removes all the specified dimensions from the expression.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  virtual void remove_space_dimensions(const Variables_Set& vars);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  virtual void shift_space_dimensions(Variable v, dimension_type n);
-
-  //! Permutes the space dimensions of the expression.
-  /*!
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  virtual void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  virtual bool is_zero() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  virtual bool all_homogeneous_terms_are_zero() const;
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  virtual memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  virtual memory_size_type external_memory_in_bytes() const;
-
-  //! Writes to \p s an ASCII representation of \p *this.
-  virtual void ascii_dump(std::ostream& s) const;
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  virtual bool ascii_load(std::istream& s);
-
-  //! Copy constructor with a specified space dimension.
-  Linear_Expression_Impl(const Linear_Expression_Interface& e,
-                         dimension_type space_dim);
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  virtual bool is_equal_to(const Linear_Expression_Interface& x) const;
-
-  //! Normalizes the modulo of the coefficients and of the inhomogeneous term
-  //! so that they are mutually prime.
-  /*!
-    Computes the Greatest Common Divisor (GCD) among the coefficients
-    and the inhomogeneous term and normalizes them by the GCD itself.
-  */
-  virtual void normalize();
-
-  //! Ensures that the first nonzero homogeneous coefficient is positive,
-  //! by negating the row if necessary.
-  virtual void sign_normalize();
-
-  /*! \brief
-    Negates the elements from index \p first (included)
-    to index \p last (excluded).
-  */
-  virtual void negate(dimension_type first, dimension_type last);
-
-  virtual Linear_Expression_Impl&
-  operator+=(Coefficient_traits::const_reference n);
-  virtual Linear_Expression_Impl&
-  operator-=(Coefficient_traits::const_reference n);
-
-  //! The basic comparison function.
-  /*! \relates Linear_Expression_Impl
-
-    \returns
-    -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
-    is greater. The absolute value of the result is 1 if the difference
-    is only in the inhomogeneous terms, 2 otherwise.
-
-    The order is a lexicographic. It starts comparing the variables'
-    coefficient, starting from Variable(0), and at the end it compares
-    the inhomogeneous terms.
-  */
-  virtual int compare(const Linear_Expression_Interface& y) const;
-
-  virtual Linear_Expression_Impl&
-  operator+=(const Linear_Expression_Interface& e2);
-  virtual Linear_Expression_Impl& operator+=(const Variable v);
-  virtual Linear_Expression_Impl&
-  operator-=(const Linear_Expression_Interface& e2);
-  virtual Linear_Expression_Impl& operator-=(const Variable v);
-  virtual Linear_Expression_Impl&
-  operator*=(Coefficient_traits::const_reference n);
-  virtual Linear_Expression_Impl&
-  operator/=(Coefficient_traits::const_reference n);
-
-  virtual void negate();
-
-  virtual Linear_Expression_Impl&
-  add_mul_assign(Coefficient_traits::const_reference n, const Variable v);
-
-  virtual Linear_Expression_Impl&
-  sub_mul_assign(Coefficient_traits::const_reference n, const Variable v);
-
-  virtual void add_mul_assign(Coefficient_traits::const_reference factor,
-                              const Linear_Expression_Interface& e2);
-
-  virtual void sub_mul_assign(Coefficient_traits::const_reference factor,
-                              const Linear_Expression_Interface& e2);
-
-  virtual void print(std::ostream& s) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  virtual bool all_zeroes(const Variables_Set& vars) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  virtual bool have_a_common_variable(const Linear_Expression_Interface& x,
-                                      Variable first, Variable last) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the i-th coefficient.
-  virtual Coefficient_traits::const_reference get(dimension_type i) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets the i-th coefficient to n.
-  virtual void set(dimension_type i, Coefficient_traits::const_reference n);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  virtual bool all_zeroes(dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  virtual dimension_type num_zeroes(dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  virtual Coefficient gcd(dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  virtual void exact_div_assign(Coefficient_traits::const_reference c,
-                                dimension_type start, dimension_type end);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Equivalent to <CODE>(*this)[i] *= n</CODE>, for each i in [start, end).
-  virtual void mul_assign(Coefficient_traits::const_reference n,
-                          dimension_type start, dimension_type end);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  virtual void
-  linear_combine(const Linear_Expression_Interface& y, dimension_type i);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end).
-  virtual void linear_combine(const Linear_Expression_Interface& y,
-                              Coefficient_traits::const_reference c1,
-                              Coefficient_traits::const_reference c2,
-                              dimension_type start, dimension_type end);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end). c1 and c2 may be zero.
-  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
-                                  Coefficient_traits::const_reference c1,
-                                  Coefficient_traits::const_reference c2,
-                                  dimension_type start, dimension_type end);
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  virtual dimension_type last_nonzero() const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  virtual bool
-  all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
-  virtual void
-  scalar_product_assign(Coefficient& result,
-                        const Linear_Expression_Interface& y,
-                        dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Computes the sign of the sum of (*this)[i]*y[i], for each i in [start,end).
-  virtual int
-  scalar_product_sign(const Linear_Expression_Interface& y,
-                      dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  virtual dimension_type
-  first_nonzero(dimension_type first, dimension_type last) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  virtual dimension_type
-  last_nonzero(dimension_type first, dimension_type last) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  virtual void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  virtual bool is_equal_to(const Linear_Expression_Interface& x,
-                           dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  virtual bool is_equal_to(const Linear_Expression_Interface& x,
-                           Coefficient_traits::const_reference c1,
-                           Coefficient_traits::const_reference c2,
-                           dimension_type start, dimension_type end) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets `row' to a copy of the row that implements *this.
-  virtual void get_row(Dense_Row& row) const;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets `row' to a copy of the row that implements *this.
-  virtual void get_row(Sparse_Row& row) const;
-
-  //! Implementation sizing constructor.
-  /*!
-    The bool parameter is just to avoid problems with
-    the constructor Linear_Expression_Impl(Coefficient_traits::const_reference n).
-  */
-  Linear_Expression_Impl(dimension_type space_dim, bool);
-
-  //! Builds the linear expression corresponding to congruence \p cg, and
-  //! with the specified space dimension.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    builds the linear expression \f$\sum_{i=0}^{space_dim-1} a_i x_i + b\f$.
-  */
-  Linear_Expression_Impl(const Congruence& cg, dimension_type space_dim);
-
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param v
-    The variable whose coefficient has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  template <typename Row2>
-  void linear_combine(const Linear_Expression_Impl<Row2>& y, Variable v);
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
-  //! \p *this and \p y have the same space dimension.
-  template <typename Row2>
-  void linear_combine(const Linear_Expression_Impl<Row2>& y,
-                      Coefficient_traits::const_reference c1,
-                      Coefficient_traits::const_reference c2);
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
-  //! c1 and c2 may be 0.
-  template <typename Row2>
-  void linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
-                          Coefficient_traits::const_reference c1,
-                          Coefficient_traits::const_reference c2);
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  template <typename Row2>
-  bool is_equal_to(const Linear_Expression_Impl<Row2>& x) const;
-
-  template <typename Row2>
-  Linear_Expression_Impl& operator+=(const Linear_Expression_Impl<Row2>& e2);
-  template <typename Row2>
-  Linear_Expression_Impl& operator-=(const Linear_Expression_Impl<Row2>& e2);
-
-  template <typename Row2>
-  Linear_Expression_Impl&
-  sub_mul_assign(Coefficient_traits::const_reference n,
-                 const Linear_Expression_Impl<Row2>& y,
-                 dimension_type start, dimension_type end);
-
-  template <typename Row2>
-  void add_mul_assign(Coefficient_traits::const_reference factor,
-                      const Linear_Expression_Impl<Row2>& e2);
-
-  template <typename Row2>
-  void sub_mul_assign(Coefficient_traits::const_reference factor,
-                      const Linear_Expression_Impl<Row2>& e2);
-
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  template <typename Row2>
-  void linear_combine(const Linear_Expression_Impl<Row2>& y, dimension_type i);
-
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end).
-  template <typename Row2>
-  void linear_combine(const Linear_Expression_Impl<Row2>& y,
-                      Coefficient_traits::const_reference c1,
-                      Coefficient_traits::const_reference c2,
-                      dimension_type start, dimension_type end);
-
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end). c1 and c2 may be zero.
-  template <typename Row2>
-  void linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
-                          Coefficient_traits::const_reference c1,
-                          Coefficient_traits::const_reference c2,
-                          dimension_type start, dimension_type end);
-
-  //! The basic comparison function.
-  /*! \relates Linear_Expression_Impl
-
-    \returns
-    -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
-    is greater. The absolute value of the result is 1 if the difference
-    is only in the inhomogeneous terms, 2 otherwise.
-
-    The order is a lexicographic. It starts comparing the variables'
-    coefficient, starting from Variable(0), and at the end it compares
-    the inhomogeneous terms.
-  */
-  template <typename Row2>
-  int compare(const Linear_Expression_Impl<Row2>& y) const;
-
-  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
-  template <typename Row2>
-  void
-  scalar_product_assign(Coefficient& result,
-                        const Linear_Expression_Impl<Row2>& y,
-                        dimension_type start, dimension_type end) const;
-
-  //! Computes the sign of the sum of (*this)[i]*y[i],
-  //! for each i in [start,end).
-  template <typename Row2>
-  int scalar_product_sign(const Linear_Expression_Impl<Row2>& y,
-                          dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  template <typename Row2>
-  bool is_equal_to(const Linear_Expression_Impl<Row2>& x,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  template <typename Row2>
-  bool is_equal_to(const Linear_Expression_Impl<Row2>& x,
-                   Coefficient_traits::const_reference c1,
-                   Coefficient_traits::const_reference c2,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  template <typename Row2>
-  bool have_a_common_variable(const Linear_Expression_Impl<Row2>& x,
-                              Variable first, Variable last) const;
-
-private:
-
-  void construct(const Linear_Expression_Interface& e);
-  void construct(const Linear_Expression_Interface& e,
-                 dimension_type space_dim);
-
-  template <typename Row2>
-  void construct(const Linear_Expression_Impl<Row2>& e);
-  template <typename Row2>
-  void construct(const Linear_Expression_Impl<Row2>& e,
-                 dimension_type space_dim);
-
-  Row row;
-
-  template <typename Row2>
-  friend class Linear_Expression_Impl;
-
-}; // class Parma_Polyhedra_Library::Linear_Expression_Impl
-
-
-namespace Parma_Polyhedra_Library {
-
-// NOTE: declaring explicit specializations.
-
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>::OK() const;
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>::OK() const;
-
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>::all_homogeneous_terms_are_zero() const;
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>::all_homogeneous_terms_are_zero() const;
-
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>::all_zeroes(dimension_type start,
-                                              dimension_type end) const;
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>::all_zeroes(dimension_type start,
-                                               dimension_type end) const;
-
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>
-::all_zeroes(const Variables_Set& vars) const;
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>
-::all_zeroes(const Variables_Set& vars) const;
-
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>
-::all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const;
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>
-::all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const;
-
-template <>
-dimension_type
-Linear_Expression_Impl<Dense_Row>
-::first_nonzero(dimension_type first, dimension_type last) const;
-template <>
-dimension_type
-Linear_Expression_Impl<Sparse_Row>
-::first_nonzero(dimension_type first, dimension_type last) const;
-
-template <>
-Coefficient
-Linear_Expression_Impl<Dense_Row>::gcd(dimension_type start,
-                                       dimension_type end) const;
-template <>
-Coefficient
-Linear_Expression_Impl<Sparse_Row>::gcd(dimension_type start,
-                                        dimension_type end) const;
-
-template <>
-void
-Linear_Expression_Impl<Dense_Row>
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-template <>
-void
-Linear_Expression_Impl<Sparse_Row>
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-template <>
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>
-::have_a_common_variable(const Linear_Expression_Impl<Dense_Row>& y,
-                         Variable first, Variable last) const;
-template <>
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>
-::have_a_common_variable(const Linear_Expression_Impl<Sparse_Row>& y,
-                         Variable first, Variable last) const;
-template <>
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>
-::have_a_common_variable(const Linear_Expression_Impl<Dense_Row>& y,
-                         Variable first, Variable last) const;
-template <>
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>
-::have_a_common_variable(const Linear_Expression_Impl<Sparse_Row>& y,
-                         Variable first, Variable last) const;
-
-template <>
-bool
-Linear_Expression_Impl<Dense_Row>::is_zero() const;
-template <>
-bool
-Linear_Expression_Impl<Sparse_Row>::is_zero() const;
-
-template <>
-dimension_type
-Linear_Expression_Impl<Dense_Row>::last_nonzero() const;
-template <>
-dimension_type
-Linear_Expression_Impl<Sparse_Row>::last_nonzero() const;
-
-template <>
-dimension_type
-Linear_Expression_Impl<Dense_Row>
-::last_nonzero(dimension_type first, dimension_type last) const;
-template <>
-dimension_type
-Linear_Expression_Impl<Sparse_Row>
-::last_nonzero(dimension_type first, dimension_type last) const;
-
-template <>
-dimension_type
-Linear_Expression_Impl<Dense_Row>::num_zeroes(dimension_type start,
-                                              dimension_type end) const;
-template <>
-dimension_type
-Linear_Expression_Impl<Sparse_Row>::num_zeroes(dimension_type start,
-                                               dimension_type end) const;
-
-template <>
-void
-Linear_Expression_Impl<Dense_Row>
-::remove_space_dimensions(const Variables_Set& vars);
-template <>
-void
-Linear_Expression_Impl<Sparse_Row>
-::remove_space_dimensions(const Variables_Set& vars);
-
-template <>
-Representation
-Linear_Expression_Impl<Dense_Row>::representation() const;
-template <>
-Representation
-Linear_Expression_Impl<Sparse_Row>::representation() const;
-
-template <>
-void
-Linear_Expression_Impl<Dense_Row>::const_iterator::skip_zeroes_backward();
-template <>
-void
-Linear_Expression_Impl<Sparse_Row>::const_iterator::skip_zeroes_backward();
-
-template <>
-void
-Linear_Expression_Impl<Dense_Row>::const_iterator::skip_zeroes_forward();
-template <>
-void
-Linear_Expression_Impl<Sparse_Row>::const_iterator::skip_zeroes_forward();
-
-} // namespace Parma_Polyhedra_Library
-
-
-#include "Linear_Expression_Impl.inlines.hh"
-#include "Linear_Expression_Impl.templates.hh"
-
-#endif // !defined(PPL_Linear_Expression_Impl_defs_hh)
diff --git a/src/Linear_Expression_Impl.inlines.hh b/src/Linear_Expression_Impl.inlines.hh
deleted file mode 100644
index fe74cdb..0000000
--- a/src/Linear_Expression_Impl.inlines.hh
+++ /dev/null
@@ -1,282 +0,0 @@
-/* Linear_Expression_Impl class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Expression_Impl_inlines_hh
-#define PPL_Linear_Expression_Impl_inlines_hh 1
-
-#include "math_utilities.defs.hh"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-inline dimension_type
-Linear_Expression_Impl<Row>::max_space_dimension() {
-  return Row::max_size() - 1;
-}
-
-template <typename Row>
-inline
-Linear_Expression_Impl<Row>::Linear_Expression_Impl()
-  : row(1) {
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_Expression_Impl<Row>
-::Linear_Expression_Impl(dimension_type space_dim, bool)
-  : row(space_dim + 1) {
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_Expression_Impl<Row>::~Linear_Expression_Impl() {
-}
-
-template <typename Row>
-inline
-Linear_Expression_Impl<Row>
-::Linear_Expression_Impl(Coefficient_traits::const_reference n)
-  : row(1) {
-  if (n != 0)
-    row.insert(0, n);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline dimension_type
-Linear_Expression_Impl<Row>::space_dimension() const {
-  return row.size() - 1;
-}
-
-template <typename Row>
-inline void
-Linear_Expression_Impl<Row>::set_space_dimension(dimension_type n) {
-  row.resize(n + 1);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline Coefficient_traits::const_reference
-Linear_Expression_Impl<Row>::coefficient(Variable v) const {
-  if (v.space_dimension() > space_dimension())
-    return Coefficient_zero();
-  return row.get(v.id() + 1);
-}
-
-template <typename Row>
-inline void
-Linear_Expression_Impl<Row>
-::set_coefficient(Variable v, Coefficient_traits::const_reference n) {
-  PPL_ASSERT(v.space_dimension() <= space_dimension());
-  dimension_type i = v.space_dimension();
-  if (n == 0)
-    row.reset(i);
-  else
-    row.insert(i, n);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline Coefficient_traits::const_reference
-Linear_Expression_Impl<Row>::inhomogeneous_term() const {
-  return row.get(0);
-}
-
-template <typename Row>
-inline void
-Linear_Expression_Impl<Row>
-::set_inhomogeneous_term(Coefficient_traits::const_reference n) {
-  if (n == 0)
-    row.reset(0);
-  else
-    row.insert(0, n);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_Expression_Impl<Row>::swap_space_dimensions(Variable v1, Variable v2) {
-  row.swap_coefficients(v1.space_dimension(), v2.space_dimension());
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_Expression_Impl<Row>::shift_space_dimensions(Variable v,
-                                                    dimension_type n) {
-  row.add_zeroes_and_shift(n, v.space_dimension());
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline memory_size_type
-Linear_Expression_Impl<Row>::external_memory_in_bytes() const {
-  return row.external_memory_in_bytes();
-}
-
-template <typename Row>
-inline memory_size_type
-Linear_Expression_Impl<Row>::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-template <typename Row>
-inline Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator+=(Coefficient_traits::const_reference n) {
-  typename Row::iterator itr = row.insert(0);
-  (*itr) += n;
-  if (*itr == 0)
-    row.reset(itr);
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-template <typename Row>
-inline Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator-=(Coefficient_traits::const_reference n) {
-  typename Row::iterator itr = row.insert(0);
-  (*itr) -= n;
-  if (*itr == 0)
-    row.reset(itr);
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-template <typename Row>
-inline void
-Linear_Expression_Impl<Row>::normalize() {
-  row.normalize();
-  PPL_ASSERT(OK());
-}
-
-template <>
-inline bool
-Linear_Expression_Impl<Sparse_Row>::is_zero() const {
-  return row.num_stored_elements() == 0;
-}
-
-template <>
-inline bool
-Linear_Expression_Impl<Sparse_Row>::all_homogeneous_terms_are_zero() const {
-  return row.lower_bound(1) == row.end();
-}
-
-template <>
-inline bool
-Linear_Expression_Impl<Sparse_Row>::all_zeroes(dimension_type start,
-                                               dimension_type end) const {
-  return row.lower_bound(start) == row.lower_bound(end);
-}
-
-template <>
-inline dimension_type
-Linear_Expression_Impl<Sparse_Row>::num_zeroes(dimension_type start,
-                                               dimension_type end) const {
-  PPL_ASSERT(start <= end);
-  return (end - start)
-    - std::distance(row.lower_bound(start), row.lower_bound(end));
-}
-
-template <>
-inline dimension_type
-Linear_Expression_Impl<Sparse_Row>::last_nonzero() const {
-  if (row.num_stored_elements() == 0)
-    return 0;
-  Sparse_Row::const_iterator i = row.end();
-  --i;
-  return i.index();
-}
-
-template <>
-inline dimension_type
-Linear_Expression_Impl<Sparse_Row>
-::first_nonzero(dimension_type first, dimension_type last) const {
-  PPL_ASSERT(first <= last);
-  PPL_ASSERT(last <= row.size());
-  Sparse_Row::const_iterator i = row.lower_bound(first);
-
-  if (i != row.end() && i.index() < last)
-    return i.index();
-  else
-    return last;
-}
-
-template <>
-inline dimension_type
-Linear_Expression_Impl<Sparse_Row>
-::last_nonzero(dimension_type first, dimension_type last) const {
-  PPL_ASSERT(first <= last);
-  PPL_ASSERT(last <= row.size());
-  Sparse_Row::const_iterator itr1 = row.lower_bound(first);
-  Sparse_Row::const_iterator itr2 = row.lower_bound(last);
-
-  if (itr1 == itr2)
-    return last;
-
-  --itr2;
-  return itr2.index();
-}
-
-template <>
-inline Representation
-Linear_Expression_Impl<Dense_Row>::representation() const {
-  return DENSE;
-}
-
-template <>
-inline Representation
-Linear_Expression_Impl<Sparse_Row>::representation() const {
-  return SPARSE;
-}
-
-template <>
-inline void
-Linear_Expression_Impl<Sparse_Row>::const_iterator
-::skip_zeroes_forward() {
-  // Nothing to do.
-}
-
-template <>
-inline void
-Linear_Expression_Impl<Sparse_Row>::const_iterator
-::skip_zeroes_backward() {
-  // Nothing to do.
-}
-
-namespace IO_Operators {
-
-template <typename Row>
-inline std::ostream&
-operator<<(std::ostream& s, const Linear_Expression_Impl<Row>& e) {
-  e.print(s);
-  return s;
-}
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Expression_Impl_inlines_hh)
diff --git a/src/Linear_Expression_Impl.templates.hh b/src/Linear_Expression_Impl.templates.hh
deleted file mode 100644
index 4f1da25..0000000
--- a/src/Linear_Expression_Impl.templates.hh
+++ /dev/null
@@ -1,1265 +0,0 @@
-/* Linear_Expression_Impl class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Expression_Impl_templates_hh
-#define PPL_Linear_Expression_Impl_templates_hh 1
-
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-
-#include "Constraint.defs.hh"
-#include "Generator.defs.hh"
-#include "Grid_Generator.defs.hh"
-#include "Congruence.defs.hh"
-#include <stdexcept>
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Linear_Expression_Impl& e) {
-  construct(e);
-}
-
-template <typename Row>
-template <typename Row2>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Linear_Expression_Impl<Row2>& e) {
-  construct(e);
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Linear_Expression_Interface& e) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
-    construct(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
-    construct(*p);
-  } else {
-    // Add implementations for other derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>
-::Linear_Expression_Impl(const Linear_Expression_Interface& e,
-                         dimension_type space_dim) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
-    construct(*p, space_dim);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
-    construct(*p, space_dim);
-  } else {
-    // Add implementations for other derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Congruence& cg,
-                                                    dimension_type space_dim) {
-  construct(*(cg.expression().impl), space_dim);
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Impl<Row2>& y, Variable i) {
-  PPL_ASSERT(space_dimension() == y.space_dimension());
-  PPL_ASSERT(i.space_dimension() <= space_dimension());
-  linear_combine(y, i.space_dimension());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Impl<Row2>& y, dimension_type i) {
-  Linear_Expression_Impl& x = *this;
-  PPL_ASSERT(i < x.space_dimension() + 1);
-  PPL_ASSERT(x.space_dimension() == y.space_dimension());
-  Coefficient_traits::const_reference x_i = x.row.get(i);
-  Coefficient_traits::const_reference y_i = y.row.get(i);
-  PPL_ASSERT(x_i != 0);
-  PPL_ASSERT(y_i != 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(normalized_x_v);
-  PPL_DIRTY_TEMP_COEFFICIENT(normalized_y_v);
-  normalize2(x_i, y_i, normalized_x_v, normalized_y_v);
-  neg_assign(normalized_x_v);
-  linear_combine(y, normalized_y_v, normalized_x_v);
-  // We cannot use x_i here because it may have been invalidated by
-  // linear_combine().
-  assert(x.row.get(i) == 0);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Impl<Row2>& y,
-                 Coefficient_traits::const_reference c1,
-                 Coefficient_traits::const_reference c2) {
-  PPL_ASSERT(c1 != 0);
-  PPL_ASSERT(c2 != 0);
-  if (space_dimension() < y.space_dimension())
-    set_space_dimension(y.space_dimension());
-  linear_combine(y, c1, c2, 0, y.space_dimension() + 1);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
-                     Coefficient_traits::const_reference c1,
-                     Coefficient_traits::const_reference c2) {
-  if (space_dimension() < y.space_dimension())
-    set_space_dimension(y.space_dimension());
-  linear_combine_lax(y, c1, c2, 0, y.space_dimension() + 1);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-int
-Linear_Expression_Impl<Row>::compare(const Linear_Expression_Impl<Row2>& y) const {
-  const Linear_Expression_Impl& x = *this;
-  // Compare all the coefficients of the row starting from position 1.
-  // NOTE: x and y may be of different size.
-  typename Row::const_iterator i = x.row.lower_bound(1);
-  typename Row::const_iterator i_end = x.row.end();
-  typename Row2::const_iterator j = y.row.lower_bound(1);
-  typename Row2::const_iterator j_end = y.row.end();
-  while (i != i_end && j != j_end) {
-    if (i.index() < j.index()) {
-      int s = sgn(*i);
-      if (s != 0)
-        return 2*s;
-      ++i;
-      continue;
-    }
-    if (i.index() > j.index()) {
-      int s = sgn(*j);
-      if (s != 0)
-        return -2*s;
-      ++j;
-      continue;
-    }
-    PPL_ASSERT(i.index() == j.index());
-    int s = cmp(*i, *j);
-    if (s < 0)
-      return -2;
-    if (s > 0)
-      return 2;
-    PPL_ASSERT(s == 0);
-    ++i;
-    ++j;
-  }
-  for ( ; i != i_end; ++i) {
-    int s = sgn(*i);
-    if (s != 0)
-      return 2*s;
-  }
-  for ( ; j != j_end; ++j) {
-    int s = sgn(*j);
-    if (s != 0)
-      return -2*s;
-  }
-
-  // If all the coefficients in `x' equal all the coefficients in `y'
-  // (starting from position 1) we compare coefficients in position 0,
-  // i.e., inhomogeneous terms.
-  const int comp = cmp(x.row.get(0), y.row.get(0));
-  if (comp > 0)
-    return 1;
-  if (comp < 0)
-    return -1;
-  PPL_ASSERT(comp == 0);
-
-  // `x' and `y' are equal.
-  return 0;
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Variable v) {
-  if (v.space_dimension() > max_space_dimension())
-    throw std::length_error("Linear_Expression_Impl::"
-                            "Linear_Expression_Impl(v):\n"
-                            "v exceeds the maximum allowed "
-                            "space dimension.");
-  set_space_dimension(v.space_dimension());
-  (*this) += v;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-bool
-Linear_Expression_Impl<Row>
-::is_equal_to(const Linear_Expression_Impl<Row2>& x) const {
-  return row == x.row;
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::get_row(Dense_Row& row) const {
-  row = this->row;
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::get_row(Sparse_Row& row) const {
-  row = this->row;
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::permute_space_dimensions(const std::vector<Variable>& cycle) {
-  const dimension_type n = cycle.size();
-  if (n < 2)
-    return;
-
-  if (n == 2) {
-    row.swap_coefficients(cycle[0].space_dimension(),
-                          cycle[1].space_dimension());
-  }
-  else {
-    PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-    tmp = row.get(cycle.back().space_dimension());
-    for (dimension_type i = n - 1; i-- > 0; )
-      row.swap_coefficients(cycle[i + 1].space_dimension(),
-                            cycle[i].space_dimension());
-    if (tmp == 0)
-      row.reset(cycle[0].space_dimension());
-    else {
-      using std::swap;
-      swap(tmp, row[cycle[0].space_dimension()]);
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator+=(const Linear_Expression_Impl<Row2>& e) {
-  linear_combine(e, Coefficient_one(), Coefficient_one());
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator+=(const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
-    throw std::length_error("Linear_Expression_Impl& "
-                            "operator+=(e, v):\n"
-                            "v exceeds the maximum allowed space dimension.");
-  if (space_dimension() < v_space_dim)
-    set_space_dimension(v_space_dim);
-  typename Row::iterator itr = row.insert(v_space_dim);
-  ++(*itr);
-  if (*itr == 0)
-    row.reset(itr);
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-template <typename Row2>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator-=(const Linear_Expression_Impl<Row2>& e2) {
-  linear_combine(e2, Coefficient_one(), -1);
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator-=(const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
-    throw std::length_error("Linear_Expression_Impl& "
-                            "operator-=(e, v):\n"
-                            "v exceeds the maximum allowed space dimension.");
-  if (space_dimension() < v_space_dim)
-    set_space_dimension(v_space_dim);
-  typename Row::iterator itr = row.insert(v_space_dim);
-  --(*itr);
-  if (*itr == 0)
-    row.reset(itr);
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator*=(Coefficient_traits::const_reference n) {
-  if (n == 0) {
-    row.clear();
-    PPL_ASSERT(OK());
-    return *this;
-  }
-  for (typename Row::iterator i = row.begin(), i_end = row.end(); i != i_end; ++i)
-    (*i) *= n;
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::operator/=(Coefficient_traits::const_reference n) {
-  typename Row::iterator i = row.begin();
-  const typename Row::iterator& i_end = row.end();
-  while (i != i_end) {
-    (*i) /= n;
-    if (*i == 0)
-      i = row.reset(i);
-    else
-      ++i;
-  }
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::negate() {
-  for (typename Row::iterator i = row.begin(), i_end = row.end(); i != i_end; ++i)
-    neg_assign(*i);
-  PPL_ASSERT(OK());
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>::add_mul_assign(Coefficient_traits::const_reference n,
-                                            const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
-    throw std::length_error("Linear_Expression_Impl& "
-                            "add_mul_assign(e, n, v):\n"
-                            "v exceeds the maximum allowed space dimension.");
-  if (space_dimension() < v_space_dim)
-    set_space_dimension(v_space_dim);
-  if (n == 0)
-    return *this;
-  typename Row::iterator itr = row.insert(v_space_dim);
-  (*itr) += n;
-  if (*itr == 0)
-    row.reset(itr);
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>
-::sub_mul_assign(Coefficient_traits::const_reference n,
-                 const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
-    throw std::length_error("Linear_Expression_Impl& "
-                            "sub_mul_assign(e, n, v):\n"
-                            "v exceeds the maximum allowed space dimension.");
-  if (space_dimension() < v_space_dim)
-    set_space_dimension(v_space_dim);
-  if (n == 0)
-    return *this;
-  typename Row::iterator itr = row.insert(v_space_dim);
-  (*itr) -= n;
-  if (*itr == 0)
-    row.reset(itr);
-  PPL_ASSERT(OK());
-  return *this;
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::add_mul_assign(Coefficient_traits::const_reference factor,
-                 const Linear_Expression_Impl<Row2>& y) {
-  if (factor != 0)
-    linear_combine(y, Coefficient_one(), factor);
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::sub_mul_assign(Coefficient_traits::const_reference factor,
-                 const Linear_Expression_Impl<Row2>& y) {
-  if (factor != 0)
-    linear_combine(y, Coefficient_one(), -factor);
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::print(std::ostream& s) const {
-  PPL_DIRTY_TEMP_COEFFICIENT(ev);
-  bool first = true;
-  for (typename Row::const_iterator i = row.lower_bound(1), i_end = row.end();
-       i != i_end; ++i) {
-    ev = *i;
-    if (ev == 0)
-      continue;
-    if (!first) {
-      if (ev > 0)
-        s << " + ";
-      else {
-        s << " - ";
-        neg_assign(ev);
-      }
-    }
-    else
-      first = false;
-    if (ev == -1)
-      s << "-";
-    else if (ev != 1)
-      s << ev << "*";
-    IO_Operators::operator<<(s, Variable(i.index() - 1));
-  }
-  // Inhomogeneous term.
-  PPL_DIRTY_TEMP_COEFFICIENT(it);
-  it = row[0];
-  if (it != 0) {
-    if (!first) {
-      if (it > 0)
-        s << " + ";
-      else {
-        s << " - ";
-        neg_assign(it);
-      }
-    }
-    else
-      first = false;
-    s << it;
-  }
-
-  if (first)
-    // The null linear expression.
-    s << Coefficient_zero();
-}
-
-template <typename Row>
-Coefficient_traits::const_reference
-Linear_Expression_Impl<Row>::get(dimension_type i) const {
-  return row.get(i);
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::set(dimension_type i, Coefficient_traits::const_reference n) {
-  if (n == 0)
-    row.reset(i);
-  else
-    row.insert(i, n);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::exact_div_assign(Coefficient_traits::const_reference c,
-                   dimension_type start, dimension_type end) {
-  // NOTE: Since all coefficients in [start,end) are multiple of c,
-  // each of the resulting coefficients will be nonzero iff the initial
-  // coefficient was.
-  for (typename Row::iterator
-    i = row.lower_bound(start), i_end = row.lower_bound(end); i != i_end; ++i)
-    Parma_Polyhedra_Library::exact_div_assign(*i, *i, c);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::mul_assign(Coefficient_traits::const_reference c,
-                   dimension_type start, dimension_type end) {
-  if (c == 0) {
-    typename Row::iterator i = row.lower_bound(start);
-    const typename Row::iterator& i_end = row.end();
-    while (i != i_end && i.index() < end)
-      i = row.reset(i);
-  } else {
-    for (typename Row::iterator
-      i = row.lower_bound(start), i_end = row.lower_bound(end); i != i_end; ++i)
-      (*i) *= c;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Impl<Row2>& y,
-                 Coefficient_traits::const_reference c1,
-                 Coefficient_traits::const_reference c2,
-                 dimension_type start, dimension_type end) {
-  Parma_Polyhedra_Library::linear_combine(row, y.row, c1, c2, start, end);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
-                     Coefficient_traits::const_reference c1,
-                     Coefficient_traits::const_reference c2,
-                     dimension_type start, dimension_type end) {
-  PPL_ASSERT(start <= end);
-  PPL_ASSERT(end <= row.size());
-  PPL_ASSERT(end <= y.row.size());
-  if (c1 == 0) {
-    if (c2 == 0) {
-      PPL_ASSERT(c1 == 0);
-      PPL_ASSERT(c2 == 0);
-      typename Row::iterator i = row.lower_bound(start);
-      const typename Row::iterator& i_end = row.end();
-      while (i != i_end && i.index() < end)
-        i = row.reset(i);
-    } else {
-      PPL_ASSERT(c1 == 0);
-      PPL_ASSERT(c2 != 0);
-
-      typename Row::iterator i = row.lower_bound(start);
-      const typename Row::iterator& i_end = row.end();
-      typename Row2::const_iterator j = y.row.lower_bound(start);
-      typename Row2::const_iterator j_last = y.row.lower_bound(end);
-
-      while (i != i_end && i.index() < end && j != j_last) {
-        if (i.index() < j.index()) {
-          i = row.reset(i);
-          continue;
-        }
-        if (i.index() > j.index()) {
-          i = row.insert(i, j.index(), *j);
-          (*i) *= c2;
-          ++i;
-          ++j;
-          continue;
-        }
-        PPL_ASSERT(i.index() == j.index());
-        (*i) = (*j);
-        (*i) *= c2;
-        ++i;
-        ++j;
-      }
-      while (i != i_end && i.index() < end)
-        i = row.reset(i);
-      while (j != j_last) {
-        i = row.insert(i, j.index(), *j);
-        (*i) *= c2;
-        // No need to increment i here.
-        ++j;
-      }
-    }
-  } else {
-    if (c2 == 0) {
-      PPL_ASSERT(c1 != 0);
-      PPL_ASSERT(c2 == 0);
-      for (typename Row::iterator i = row.lower_bound(start),
-                                  i_end = row.lower_bound(end);
-          i != i_end; ++i)
-        (*i) *= c1;
-    } else {
-      PPL_ASSERT(c1 != 0);
-      PPL_ASSERT(c2 != 0);
-      Parma_Polyhedra_Library::linear_combine(row, y.row, c1, c2, start, end);
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::sign_normalize() {
-  typename Row::iterator i = row.lower_bound(1);
-  typename Row::iterator i_end = row.end();
-
-  for ( ; i != i_end; ++i)
-    if (*i != 0)
-      break;
-
-  if (i != i_end && *i < 0) {
-    for ( ; i != i_end; ++i)
-      neg_assign(*i);
-    // Negate the first coefficient, too.
-    typename Row::iterator i = row.begin();
-    if (i != row.end() && i.index() == 0)
-      neg_assign(*i);
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::negate(dimension_type first, dimension_type last) {
-  PPL_ASSERT(first <= last);
-  PPL_ASSERT(last <= row.size());
-  typename Row::iterator i = row.lower_bound(first);
-  typename Row::iterator i_end = row.lower_bound(last);
-  for ( ; i != i_end; ++i)
-    neg_assign(*i);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>::construct(const Linear_Expression_Impl<Row2>& e) {
-  row = e.row;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>::construct(const Linear_Expression_Impl<Row2>& e,
-                                       dimension_type space_dim) {
-  Row x(e.row, space_dim + 1, space_dim + 1);
-  swap(row, x);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-template <typename Row2>
-void
-Linear_Expression_Impl<Row>
-::scalar_product_assign(Coefficient& result, const Linear_Expression_Impl<Row2>& y,
-                        dimension_type start, dimension_type end) const {
-  const Linear_Expression_Impl<Row>& x = *this;
-  PPL_ASSERT(start <= end);
-  PPL_ASSERT(end <= x.row.size());
-  PPL_ASSERT(end <= y.row.size());
-  result = 0;
-  typename Row ::const_iterator x_i = x.row.lower_bound(start);
-  typename Row ::const_iterator x_end = x.row.lower_bound(end);
-  typename Row2::const_iterator y_i = y.row.lower_bound(start);
-  typename Row2::const_iterator y_end = y.row.lower_bound(end);
-  while (x_i != x_end && y_i != y_end) {
-    if (x_i.index() == y_i.index()) {
-      Parma_Polyhedra_Library::add_mul_assign(result, *x_i, *y_i);
-      ++x_i;
-      ++y_i;
-    } else {
-      if (x_i.index() < y_i.index()) {
-        PPL_ASSERT(y.row.get(x_i.index()) == 0);
-        // (*x_i) * 0 == 0, nothing to do.
-        ++x_i;
-      } else {
-        PPL_ASSERT(x.row.get(y_i.index()) == 0);
-        // 0 * (*y_i) == 0, nothing to do.
-        ++y_i;
-      }
-    }
-  }
-  // In the remaining positions (if any) at most one row is nonzero, so
-  // there's nothing left to do.
-}
-
-template <typename Row>
-template <typename Row2>
-int
-Linear_Expression_Impl<Row>
-::scalar_product_sign(const Linear_Expression_Impl<Row2>& y,
-                      dimension_type start, dimension_type end) const {
-  PPL_DIRTY_TEMP_COEFFICIENT(result);
-  scalar_product_assign(result, y, start, end);
-  return sgn(result);
-}
-
-template <typename Row>
-template <typename Row2>
-bool
-Linear_Expression_Impl<Row>
-::is_equal_to(const Linear_Expression_Impl<Row2>& y,
-              dimension_type start, dimension_type end) const {
-  const Linear_Expression_Impl<Row>& x = *this;
-  PPL_ASSERT(start <= end);
-  PPL_ASSERT(end <= x.row.size());
-  PPL_ASSERT(end <= y.row.size());
-
-  typename Row::const_iterator i = x.row.lower_bound(start);
-  typename Row::const_iterator i_end = x.row.lower_bound(end);
-  typename Row2::const_iterator j = y.row.lower_bound(start);
-  typename Row2::const_iterator j_end = y.row.lower_bound(end);
-  while (i != i_end && j != j_end) {
-    if (i.index() == j.index()) {
-      if (*i != *j)
-        return false;
-      ++i;
-      ++j;
-    } else {
-      if (i.index() < j.index()) {
-        if (*i != 0)
-          return false;
-        ++i;
-      } else {
-        PPL_ASSERT(i.index() > j.index());
-        if (*j != 0)
-          return false;
-        ++j;
-      }
-    }
-  }
-  for ( ; i != i_end; ++i)
-    if (*i != 0)
-      return false;
-  for ( ; j != j_end; ++j)
-    if (*j != 0)
-      return false;
-  return true;
-}
-
-template <typename Row>
-template <typename Row2>
-bool
-Linear_Expression_Impl<Row>
-::is_equal_to(const Linear_Expression_Impl<Row2>& y,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  const Linear_Expression_Impl<Row>& x = *this;
-  PPL_ASSERT(start <= end);
-  PPL_ASSERT(end <= x.row.size());
-  PPL_ASSERT(end <= y.row.size());
-
-  // Deal with trivial cases.
-  if (c1 == 0) {
-    if (c2 == 0)
-      return true;
-    else
-      return y.all_zeroes(start, end);
-  }
-  if (c2 == 0)
-    return x.all_zeroes(start, end);
-
-  PPL_ASSERT(c1 != 0);
-  PPL_ASSERT(c2 != 0);
-  typename Row::const_iterator i = x.row.lower_bound(start);
-  typename Row::const_iterator i_end = x.row.lower_bound(end);
-  typename Row2::const_iterator j = y.row.lower_bound(start);
-  typename Row2::const_iterator j_end = y.row.lower_bound(end);
-  while (i != i_end && j != j_end) {
-    if (i.index() == j.index()) {
-      if ((*i) * c1 != (*j) * c2)
-        return false;
-      ++i;
-      ++j;
-    } else {
-      if (i.index() < j.index()) {
-        if (*i != 0)
-          return false;
-        ++i;
-      } else {
-        PPL_ASSERT(i.index() > j.index());
-        if (*j != 0)
-          return false;
-        ++j;
-      }
-    }
-  }
-  for ( ; i != i_end; ++i)
-    if (*i != 0)
-      return false;
-  for ( ; j != j_end; ++j)
-    if (*j != 0)
-      return false;
-  return true;
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Interface& y, Variable v) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    linear_combine(*p, v);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    linear_combine(*p, v);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Interface& y,
-                 Coefficient_traits::const_reference c1,
-                 Coefficient_traits::const_reference c2) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    linear_combine(*p, c1, c2);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    linear_combine(*p, c1, c2);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::linear_combine_lax(const Linear_Expression_Interface& y,
-                     Coefficient_traits::const_reference c1,
-                     Coefficient_traits::const_reference c2) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    linear_combine_lax(*p, c1, c2);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    linear_combine_lax(*p, c1, c2);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>
-::is_equal_to(const Linear_Expression_Interface& y) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return is_equal_to(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return is_equal_to(*p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return false;
-  }
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>
-::operator+=(const Linear_Expression_Interface& y) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return operator+=(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return operator+=(*p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return *this;
-  }
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>&
-Linear_Expression_Impl<Row>
-::operator-=(const Linear_Expression_Interface& y) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return operator-=(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return operator-=(*p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return *this;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::add_mul_assign(Coefficient_traits::const_reference factor,
-                 const Linear_Expression_Interface& y) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    add_mul_assign(factor, *p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    add_mul_assign(factor, *p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::sub_mul_assign(Coefficient_traits::const_reference factor,
-                 const Linear_Expression_Interface& y) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    sub_mul_assign(factor, *p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    sub_mul_assign(factor, *p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Interface& y, dimension_type i) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    linear_combine(*p, i);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    linear_combine(*p, i);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::linear_combine(const Linear_Expression_Interface& y,
-                 Coefficient_traits::const_reference c1,
-                 Coefficient_traits::const_reference c2,
-                 dimension_type start, dimension_type end) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    linear_combine(*p, c1, c2, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    linear_combine(*p, c1, c2, start, end);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::linear_combine_lax(const Linear_Expression_Interface& y,
-                     Coefficient_traits::const_reference c1,
-                     Coefficient_traits::const_reference c2,
-                     dimension_type start, dimension_type end) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    linear_combine_lax(*p, c1, c2, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    linear_combine_lax(*p, c1, c2, start, end);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-int
-Linear_Expression_Impl<Row>
-::compare(const Linear_Expression_Interface& y) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return compare(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return compare(*p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return 0;
-  }
-}
-
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::construct(const Linear_Expression_Interface& y) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return construct(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return construct(*p);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::construct(const Linear_Expression_Interface& y,
-                                       dimension_type space_dim) {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return construct(*p, space_dim);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return construct(*p, space_dim);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>
-::scalar_product_assign(Coefficient& result,
-                        const Linear_Expression_Interface& y,
-                        dimension_type start, dimension_type end) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    scalar_product_assign(result, *p, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    scalar_product_assign(result, *p, start, end);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-  }
-}
-
-template <typename Row>
-int
-Linear_Expression_Impl<Row>
-::scalar_product_sign(const Linear_Expression_Interface& y,
-                      dimension_type start, dimension_type end) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return scalar_product_sign(*p, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return scalar_product_sign(*p, start, end);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return 0;
-  }
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>
-::is_equal_to(const Linear_Expression_Interface& y,
-              dimension_type start, dimension_type end) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return is_equal_to(*p, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return is_equal_to(*p, start, end);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return false;
-  }
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>
-::is_equal_to(const Linear_Expression_Interface& y,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return is_equal_to(*p, c1, c2, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return is_equal_to(*p, c1, c2, start, end);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return false;
-  }
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>
-::have_a_common_variable(const Linear_Expression_Interface& y,
-                         Variable first, Variable last) const {
-  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
-  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
-    return have_a_common_variable(*p, first, last);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
-    return have_a_common_variable(*p, first, last);
-  } else {
-    // Add implementations for new derived classes here.
-    PPL_UNREACHABLE;
-    return false;
-  }
-}
-
-template <typename Row>
-Linear_Expression_Interface::const_iterator_interface*
-Linear_Expression_Impl<Row>::begin() const {
-  return new const_iterator(row, 1);
-}
-
-template <typename Row>
-Linear_Expression_Interface::const_iterator_interface*
-Linear_Expression_Impl<Row>::end() const {
-  return new const_iterator(row, row.size());
-}
-
-template <typename Row>
-Linear_Expression_Interface::const_iterator_interface*
-Linear_Expression_Impl<Row>::lower_bound(Variable v) const {
-  return new const_iterator(row, v.space_dimension());
-}
-
-template <typename Row>
-Linear_Expression_Impl<Row>::const_iterator
-::const_iterator(const Row& row1, dimension_type i)
-  : row(&row1), itr(row1.lower_bound(i)) {
-  skip_zeroes_forward();
-}
-
-template <typename Row>
-Linear_Expression_Interface::const_iterator_interface*
-Linear_Expression_Impl<Row>::const_iterator
-::clone() const {
-  return new const_iterator(*this);
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::const_iterator
-::operator++() {
-  ++itr;
-  skip_zeroes_forward();
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::const_iterator
-::operator--() {
-  --itr;
-  skip_zeroes_backward();
-}
-
-template <typename Row>
-typename Linear_Expression_Impl<Row>::const_iterator::reference
-Linear_Expression_Impl<Row>::const_iterator
-::operator*() const {
-  return *itr;
-}
-
-template <typename Row>
-Variable
-Linear_Expression_Impl<Row>::const_iterator
-::variable() const {
-  const dimension_type i = itr.index();
-  PPL_ASSERT(i != 0);
-  return Variable(i - 1);
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>::const_iterator
-::operator==(const const_iterator_interface& x) const {
-  const const_iterator* p
-    = dynamic_cast<const const_iterator*>(&x);
-  // Comparing iterators belonging to different rows is forbidden.
-  PPL_ASSERT(p != 0);
-  PPL_ASSERT(row == p->row);
-  return itr == p->itr;
-}
-
-template <typename Row>
-void
-Linear_Expression_Impl<Row>::ascii_dump(std::ostream& s) const {
-  s << "size " << (space_dimension() + 1) << " ";
-  for (dimension_type i = 0; i < row.size(); ++i) {
-    s << row.get(i);
-    if (i != row.size() - 1)
-      s << ' ';
-  }
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>::ascii_load(std::istream& s) {
-  std::string str;
-
-  if (!(s >> str))
-    return false;
-  if (str != "size")
-    return false;
-
-  dimension_type new_size;
-  if (!(s >> new_size))
-    return false;
-
-  row.resize(0);
-  row.resize(new_size);
-
-  PPL_DIRTY_TEMP_COEFFICIENT(c);
-
-  for (dimension_type j = 0; j < new_size; ++j) {
-    if (!(s >> c))
-      return false;
-    if (c != 0)
-      row.insert(j, c);
-  }
-
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename Row>
-bool
-Linear_Expression_Impl<Row>::OK() const {
-  return row.OK();
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Expression_Impl_templates_hh)
diff --git a/src/Linear_Expression_Impl.types.hh b/src/Linear_Expression_Impl.types.hh
deleted file mode 100644
index eac0f7a..0000000
--- a/src/Linear_Expression_Impl.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Linear_Expression_Impl_types_hh
-#define PPL_Linear_Expression_Impl_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-class Linear_Expression_Impl;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Expression_Impl_types_hh)
diff --git a/src/Linear_Expression_Impl_defs.hh b/src/Linear_Expression_Impl_defs.hh
new file mode 100644
index 0000000..b5b0bb0
--- /dev/null
+++ b/src/Linear_Expression_Impl_defs.hh
@@ -0,0 +1,906 @@
+/* Linear_Expression_Impl class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Expression_Impl_defs_hh
+#define PPL_Linear_Expression_Impl_defs_hh 1
+
+#include "Linear_Expression_Impl_types.hh"
+#include "Coefficient_defs.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+#include <cstddef>
+#include "Linear_Expression_Interface_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+std::ostream&
+operator<<(std::ostream& s, const Linear_Expression_Impl<Row>& e);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A linear expression.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Linear_Expression_Impl represents the linear
+  expression
+  \f[
+    \sum_{i=0}^{n-1} a_i x_i + b
+  \f]
+  where \f$n\f$ is the dimension of the vector space,
+  each \f$a_i\f$ is the integer coefficient
+  of the \f$i\f$-th variable \f$x_i\f$
+  and \f$b\f$ is the integer for the inhomogeneous term.
+
+  \par How to build a linear expression.
+
+  Linear expressions are the basic blocks for defining
+  both constraints (i.e., linear equalities or inequalities)
+  and generators (i.e., lines, rays, points and closure points).
+  A full set of functions is defined to provide a convenient interface
+  for building complex linear expressions starting from simpler ones
+  and from objects of the classes Variable and Coefficient:
+  available operators include unary negation,
+  binary addition and subtraction,
+  as well as multiplication by a Coefficient.
+  The space dimension of a linear expression is defined as the maximum
+  space dimension of the arguments used to build it:
+  in particular, the space dimension of a Variable <CODE>x</CODE>
+  is defined as <CODE>x.id()+1</CODE>,
+  whereas all the objects of the class Coefficient have space dimension zero.
+
+  \par Example
+  The following code builds the linear expression \f$4x - 2y - z + 14\f$,
+  having space dimension \f$3\f$:
+  \code
+  Linear_Expression_Impl e = 4*x - 2*y - z + 14;
+  \endcode
+  Another way to build the same linear expression is:
+  \code
+  Linear_Expression_Impl e1 = 4*x;
+  Linear_Expression_Impl e2 = 2*y;
+  Linear_Expression_Impl e3 = z;
+  Linear_Expression_Impl e = Linear_Expression_Impl(14);
+  e += e1 - e2 - e3;
+  \endcode
+  Note that \p e1, \p e2 and \p e3 have space dimension 1, 2 and 3,
+  respectively; also, in the fourth line of code, \p e is created
+  with space dimension zero and then extended to space dimension 3
+  in the fifth line.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+class Parma_Polyhedra_Library::Linear_Expression_Impl
+  : public Linear_Expression_Interface {
+public:
+  //! Default constructor: returns a copy of Linear_Expression_Impl::zero().
+  Linear_Expression_Impl();
+
+  //! Ordinary copy constructor.
+  Linear_Expression_Impl(const Linear_Expression_Impl& e);
+
+  //! Copy constructor for other row types.
+  template <typename Row2>
+  Linear_Expression_Impl(const Linear_Expression_Impl<Row2>& e);
+
+  //! Copy constructor from any implementation of Linear_Expression_Interface.
+  Linear_Expression_Impl(const Linear_Expression_Interface& e);
+
+  //! Destructor.
+  virtual ~Linear_Expression_Impl();
+
+  //! Checks if all the invariants are satisfied.
+  virtual bool OK() const;
+
+  /*! \brief
+    Builds the linear expression corresponding
+    to the inhomogeneous term \p n.
+  */
+  explicit Linear_Expression_Impl(Coefficient_traits::const_reference n);
+
+  //! Builds the linear expression corresponding to the variable \p v.
+  /*!
+    \exception std::length_error
+    Thrown if the space dimension of \p v exceeds
+    <CODE>Linear_Expression_Impl::max_space_dimension()</CODE>.
+  */
+  Linear_Expression_Impl(Variable v);
+
+  //! Returns the current representation of this linear expression.
+  virtual Representation representation() const;
+
+  //! An interface for const iterators on the expression (homogeneous)
+  //! coefficients that are nonzero.
+  /*!
+    These iterators are invalidated by operations that modify the expression.
+  */
+  class const_iterator: public const_iterator_interface {
+  public:
+    explicit const_iterator(const Row& row, dimension_type i);
+
+    //! Returns a copy of *this.
+    //! This returns a pointer to dynamic-allocated memory. The caller has the
+    //! duty to free the memory when it's not needed anymore.
+    virtual const_iterator_interface* clone() const;
+
+    //! Navigates to the next nonzero coefficient.
+    //! Note that this method does *not* return a reference, to increase
+    //! efficiency since it's virtual.
+    virtual void operator++();
+
+    //! Navigates to the previous nonzero coefficient.
+    //! Note that this method does *not* return a reference, to increase
+    //! efficiency since it's virtual.
+    virtual void operator--();
+
+    //! Returns the current element.
+    virtual reference operator*() const;
+
+    //! Returns the variable of the coefficient pointed to by \c *this.
+    /*!
+      \returns the variable of the coefficient pointed to by \c *this.
+    */
+    virtual Variable variable() const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    virtual bool operator==(const const_iterator_interface& x) const;
+
+  private:
+
+    void skip_zeroes_forward();
+    void skip_zeroes_backward();
+
+    const Row* row;
+    typename Row::const_iterator itr;
+  };
+
+  //! This returns a pointer to dynamic-allocated memory. The caller has the
+  //! duty to free the memory when it's not needed anymore.
+  virtual const_iterator_interface* begin() const;
+
+  //! This returns a pointer to dynamic-allocated memory. The caller has the
+  //! duty to free the memory when it's not needed anymore.
+  virtual const_iterator_interface* end() const;
+
+  //! This returns a pointer to dynamic-allocated memory. The caller has the
+  //! duty to free the memory when it's not needed anymore.
+  //! Returns (a pointer to) an iterator that points to the first nonzero
+  //! coefficient of a variable greater than or equal to v, or at end if no
+  //! such coefficient exists.
+  virtual const_iterator_interface* lower_bound(Variable v) const;
+
+  //! Returns the maximum space dimension a Linear_Expression_Impl can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  virtual dimension_type space_dimension() const;
+
+  //! Sets the dimension of the vector space enclosing \p *this to \p n .
+  virtual void set_space_dimension(dimension_type n);
+
+  //! Returns the coefficient of \p v in \p *this.
+  virtual Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Sets the coefficient of \p v in \p *this to \p n.
+  virtual void set_coefficient(Variable v,
+                               Coefficient_traits::const_reference n);
+
+  //! Returns the inhomogeneous term of \p *this.
+  virtual Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Sets the inhomogeneous term of \p *this to \p n.
+  virtual void set_inhomogeneous_term(Coefficient_traits::const_reference n);
+
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param v
+    The variable whose coefficient has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  virtual void linear_combine(const Linear_Expression_Interface& y, Variable v);
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
+  //! \p *this and \p y have the same space dimension.
+  virtual void linear_combine(const Linear_Expression_Interface& y,
+                              Coefficient_traits::const_reference c1,
+                              Coefficient_traits::const_reference c2);
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
+  //! c1 and c2 may be 0.
+  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
+                                  Coefficient_traits::const_reference c1,
+                                  Coefficient_traits::const_reference c2);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  virtual void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Removes all the specified dimensions from the expression.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  virtual void remove_space_dimensions(const Variables_Set& vars);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  virtual void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Permutes the space dimensions of the expression.
+  /*!
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  virtual void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
+  virtual bool is_zero() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are \f$0\f$.
+  */
+  virtual bool all_homogeneous_terms_are_zero() const;
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  virtual memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  virtual memory_size_type external_memory_in_bytes() const;
+
+  //! Writes to \p s an ASCII representation of \p *this.
+  virtual void ascii_dump(std::ostream& s) const;
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  virtual bool ascii_load(std::istream& s);
+
+  //! Copy constructor with a specified space dimension.
+  Linear_Expression_Impl(const Linear_Expression_Interface& e,
+                         dimension_type space_dim);
+
+  //! Returns \p true if *this is equal to \p x.
+  //! Note that (*this == x) has a completely different meaning.
+  virtual bool is_equal_to(const Linear_Expression_Interface& x) const;
+
+  //! Normalizes the modulo of the coefficients and of the inhomogeneous term
+  //! so that they are mutually prime.
+  /*!
+    Computes the Greatest Common Divisor (GCD) among the coefficients
+    and the inhomogeneous term and normalizes them by the GCD itself.
+  */
+  virtual void normalize();
+
+  //! Ensures that the first nonzero homogeneous coefficient is positive,
+  //! by negating the row if necessary.
+  virtual void sign_normalize();
+
+  /*! \brief
+    Negates the elements from index \p first (included)
+    to index \p last (excluded).
+  */
+  virtual void negate(dimension_type first, dimension_type last);
+
+  virtual Linear_Expression_Impl&
+  operator+=(Coefficient_traits::const_reference n);
+  virtual Linear_Expression_Impl&
+  operator-=(Coefficient_traits::const_reference n);
+
+  //! The basic comparison function.
+  /*! \relates Linear_Expression_Impl
+
+    \returns
+    -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
+    is greater. The absolute value of the result is 1 if the difference
+    is only in the inhomogeneous terms, 2 otherwise.
+
+    The order is a lexicographic. It starts comparing the variables'
+    coefficient, starting from Variable(0), and at the end it compares
+    the inhomogeneous terms.
+  */
+  virtual int compare(const Linear_Expression_Interface& y) const;
+
+  virtual Linear_Expression_Impl&
+  operator+=(const Linear_Expression_Interface& e2);
+  virtual Linear_Expression_Impl& operator+=(const Variable v);
+  virtual Linear_Expression_Impl&
+  operator-=(const Linear_Expression_Interface& e2);
+  virtual Linear_Expression_Impl& operator-=(const Variable v);
+  virtual Linear_Expression_Impl&
+  operator*=(Coefficient_traits::const_reference n);
+  virtual Linear_Expression_Impl&
+  operator/=(Coefficient_traits::const_reference n);
+
+  virtual void negate();
+
+  virtual Linear_Expression_Impl&
+  add_mul_assign(Coefficient_traits::const_reference n, const Variable v);
+
+  virtual Linear_Expression_Impl&
+  sub_mul_assign(Coefficient_traits::const_reference n, const Variable v);
+
+  virtual void add_mul_assign(Coefficient_traits::const_reference factor,
+                              const Linear_Expression_Interface& e2);
+
+  virtual void sub_mul_assign(Coefficient_traits::const_reference factor,
+                              const Linear_Expression_Interface& e2);
+
+  virtual void print(std::ostream& s) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars[i] is \f$0\f$.
+  */
+  virtual bool all_zeroes(const Variables_Set& vars) const;
+
+  //! Returns true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both *this and x.
+  virtual bool have_a_common_variable(const Linear_Expression_Interface& x,
+                                      Variable first, Variable last) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the i-th coefficient.
+  virtual Coefficient_traits::const_reference get(dimension_type i) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets the i-th coefficient to n.
+  virtual void set(dimension_type i, Coefficient_traits::const_reference n);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
+    [start, end).
+  */
+  virtual bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns the number of zero coefficient in [start, end).
+  */
+  virtual dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end). If all the
+    coefficients in this range are 0 returns 0.
+  */
+  virtual Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  virtual void exact_div_assign(Coefficient_traits::const_reference c,
+                                dimension_type start, dimension_type end);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Equivalent to <CODE>(*this)[i] *= n</CODE>, for each i in [start, end).
+  virtual void mul_assign(Coefficient_traits::const_reference n,
+                          dimension_type start, dimension_type end);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  virtual void
+  linear_combine(const Linear_Expression_Interface& y, dimension_type i);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end).
+  virtual void linear_combine(const Linear_Expression_Interface& y,
+                              Coefficient_traits::const_reference c1,
+                              Coefficient_traits::const_reference c2,
+                              dimension_type start, dimension_type end);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end). c1 and c2 may be zero.
+  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
+                                  Coefficient_traits::const_reference c1,
+                                  Coefficient_traits::const_reference c2,
+                                  dimension_type start, dimension_type end);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the index of the last nonzero element, or 0 if there are no
+  //! nonzero elements.
+  virtual dimension_type last_nonzero() const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
+    \f$0\f$, disregarding coefficients of variables in \p vars.
+  */
+  virtual bool
+  all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
+  virtual void
+  scalar_product_assign(Coefficient& result,
+                        const Linear_Expression_Interface& y,
+                        dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Computes the sign of the sum of (*this)[i]*y[i], for each i in [start,end).
+  virtual int
+  scalar_product_sign(const Linear_Expression_Interface& y,
+                      dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the index of the first nonzero element, or \p last if there are no
+  //! nonzero elements, considering only elements in [first,last).
+  virtual dimension_type
+  first_nonzero(dimension_type first, dimension_type last) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the index of the last nonzero element in [first,last), or last
+  //! if there are no nonzero elements.
+  virtual dimension_type
+  last_nonzero(dimension_type first, dimension_type last) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Removes from the set x all the indexes of nonzero elements of *this.
+  virtual void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
+  virtual bool is_equal_to(const Linear_Expression_Interface& x,
+                           dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
+  //! [start,end).
+  virtual bool is_equal_to(const Linear_Expression_Interface& x,
+                           Coefficient_traits::const_reference c1,
+                           Coefficient_traits::const_reference c2,
+                           dimension_type start, dimension_type end) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets `row' to a copy of the row that implements *this.
+  virtual void get_row(Dense_Row& row) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets `row' to a copy of the row that implements *this.
+  virtual void get_row(Sparse_Row& row) const;
+
+  //! Implementation sizing constructor.
+  /*!
+    The bool parameter is just to avoid problems with the constructor
+    Linear_Expression_Impl(Coefficient_traits::const_reference n).
+  */
+  Linear_Expression_Impl(dimension_type space_dim, bool);
+
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param v
+    The variable whose coefficient has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  template <typename Row2>
+  void linear_combine(const Linear_Expression_Impl<Row2>& y, Variable v);
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
+  //! \p *this and \p y have the same space dimension.
+  template <typename Row2>
+  void linear_combine(const Linear_Expression_Impl<Row2>& y,
+                      Coefficient_traits::const_reference c1,
+                      Coefficient_traits::const_reference c2);
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
+  //! c1 and c2 may be 0.
+  template <typename Row2>
+  void linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
+                          Coefficient_traits::const_reference c1,
+                          Coefficient_traits::const_reference c2);
+
+  //! Returns \p true if *this is equal to \p x.
+  //! Note that (*this == x) has a completely different meaning.
+  template <typename Row2>
+  bool is_equal_to(const Linear_Expression_Impl<Row2>& x) const;
+
+  template <typename Row2>
+  Linear_Expression_Impl& operator+=(const Linear_Expression_Impl<Row2>& e2);
+  template <typename Row2>
+  Linear_Expression_Impl& operator-=(const Linear_Expression_Impl<Row2>& e2);
+
+  template <typename Row2>
+  Linear_Expression_Impl&
+  sub_mul_assign(Coefficient_traits::const_reference n,
+                 const Linear_Expression_Impl<Row2>& y,
+                 dimension_type start, dimension_type end);
+
+  template <typename Row2>
+  void add_mul_assign(Coefficient_traits::const_reference factor,
+                      const Linear_Expression_Impl<Row2>& e2);
+
+  template <typename Row2>
+  void sub_mul_assign(Coefficient_traits::const_reference factor,
+                      const Linear_Expression_Impl<Row2>& e2);
+
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  template <typename Row2>
+  void linear_combine(const Linear_Expression_Impl<Row2>& y, dimension_type i);
+
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end).
+  template <typename Row2>
+  void linear_combine(const Linear_Expression_Impl<Row2>& y,
+                      Coefficient_traits::const_reference c1,
+                      Coefficient_traits::const_reference c2,
+                      dimension_type start, dimension_type end);
+
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end). c1 and c2 may be zero.
+  template <typename Row2>
+  void linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
+                          Coefficient_traits::const_reference c1,
+                          Coefficient_traits::const_reference c2,
+                          dimension_type start, dimension_type end);
+
+  //! The basic comparison function.
+  /*! \relates Linear_Expression_Impl
+
+    \returns
+    -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
+    is greater. The absolute value of the result is 1 if the difference
+    is only in the inhomogeneous terms, 2 otherwise.
+
+    The order is a lexicographic. It starts comparing the variables'
+    coefficient, starting from Variable(0), and at the end it compares
+    the inhomogeneous terms.
+  */
+  template <typename Row2>
+  int compare(const Linear_Expression_Impl<Row2>& y) const;
+
+  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
+  template <typename Row2>
+  void
+  scalar_product_assign(Coefficient& result,
+                        const Linear_Expression_Impl<Row2>& y,
+                        dimension_type start, dimension_type end) const;
+
+  //! Computes the sign of the sum of (*this)[i]*y[i],
+  //! for each i in [start,end).
+  template <typename Row2>
+  int scalar_product_sign(const Linear_Expression_Impl<Row2>& y,
+                          dimension_type start, dimension_type end) const;
+
+  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
+  template <typename Row2>
+  bool is_equal_to(const Linear_Expression_Impl<Row2>& x,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
+  //! [start,end).
+  template <typename Row2>
+  bool is_equal_to(const Linear_Expression_Impl<Row2>& x,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both *this and x.
+  template <typename Row2>
+  bool have_a_common_variable(const Linear_Expression_Impl<Row2>& x,
+                              Variable first, Variable last) const;
+
+private:
+
+  void construct(const Linear_Expression_Interface& e);
+  void construct(const Linear_Expression_Interface& e,
+                 dimension_type space_dim);
+
+  template <typename Row2>
+  void construct(const Linear_Expression_Impl<Row2>& e);
+  template <typename Row2>
+  void construct(const Linear_Expression_Impl<Row2>& e,
+                 dimension_type space_dim);
+
+  Row row;
+
+  template <typename Row2>
+  friend class Linear_Expression_Impl;
+
+}; // class Parma_Polyhedra_Library::Linear_Expression_Impl
+
+
+namespace Parma_Polyhedra_Library {
+
+// NOTE: declaring explicit specializations.
+
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>::OK() const;
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>::OK() const;
+
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>::all_homogeneous_terms_are_zero() const;
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>::all_homogeneous_terms_are_zero() const;
+
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>::all_zeroes(dimension_type start,
+                                              dimension_type end) const;
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>::all_zeroes(dimension_type start,
+                                               dimension_type end) const;
+
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>
+::all_zeroes(const Variables_Set& vars) const;
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>
+::all_zeroes(const Variables_Set& vars) const;
+
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const;
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const;
+
+template <>
+dimension_type
+Linear_Expression_Impl<Dense_Row>
+::first_nonzero(dimension_type first, dimension_type last) const;
+template <>
+dimension_type
+Linear_Expression_Impl<Sparse_Row>
+::first_nonzero(dimension_type first, dimension_type last) const;
+
+template <>
+Coefficient
+Linear_Expression_Impl<Dense_Row>::gcd(dimension_type start,
+                                       dimension_type end) const;
+template <>
+Coefficient
+Linear_Expression_Impl<Sparse_Row>::gcd(dimension_type start,
+                                        dimension_type end) const;
+
+template <>
+void
+Linear_Expression_Impl<Dense_Row>
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+template <>
+void
+Linear_Expression_Impl<Sparse_Row>
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+template <>
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>
+::have_a_common_variable(const Linear_Expression_Impl<Dense_Row>& y,
+                         Variable first, Variable last) const;
+template <>
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>
+::have_a_common_variable(const Linear_Expression_Impl<Sparse_Row>& y,
+                         Variable first, Variable last) const;
+template <>
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>
+::have_a_common_variable(const Linear_Expression_Impl<Dense_Row>& y,
+                         Variable first, Variable last) const;
+template <>
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>
+::have_a_common_variable(const Linear_Expression_Impl<Sparse_Row>& y,
+                         Variable first, Variable last) const;
+
+template <>
+bool
+Linear_Expression_Impl<Dense_Row>::is_zero() const;
+template <>
+bool
+Linear_Expression_Impl<Sparse_Row>::is_zero() const;
+
+template <>
+dimension_type
+Linear_Expression_Impl<Dense_Row>::last_nonzero() const;
+template <>
+dimension_type
+Linear_Expression_Impl<Sparse_Row>::last_nonzero() const;
+
+template <>
+dimension_type
+Linear_Expression_Impl<Dense_Row>
+::last_nonzero(dimension_type first, dimension_type last) const;
+template <>
+dimension_type
+Linear_Expression_Impl<Sparse_Row>
+::last_nonzero(dimension_type first, dimension_type last) const;
+
+template <>
+dimension_type
+Linear_Expression_Impl<Dense_Row>::num_zeroes(dimension_type start,
+                                              dimension_type end) const;
+template <>
+dimension_type
+Linear_Expression_Impl<Sparse_Row>::num_zeroes(dimension_type start,
+                                               dimension_type end) const;
+
+template <>
+void
+Linear_Expression_Impl<Dense_Row>
+::remove_space_dimensions(const Variables_Set& vars);
+template <>
+void
+Linear_Expression_Impl<Sparse_Row>
+::remove_space_dimensions(const Variables_Set& vars);
+
+template <>
+Representation
+Linear_Expression_Impl<Dense_Row>::representation() const;
+template <>
+Representation
+Linear_Expression_Impl<Sparse_Row>::representation() const;
+
+template <>
+void
+Linear_Expression_Impl<Dense_Row>::const_iterator::skip_zeroes_backward();
+template <>
+void
+Linear_Expression_Impl<Sparse_Row>::const_iterator::skip_zeroes_backward();
+
+template <>
+void
+Linear_Expression_Impl<Dense_Row>::const_iterator::skip_zeroes_forward();
+template <>
+void
+Linear_Expression_Impl<Sparse_Row>::const_iterator::skip_zeroes_forward();
+
+} // namespace Parma_Polyhedra_Library
+
+
+#include "Linear_Expression_Impl_inlines.hh"
+#include "Linear_Expression_Impl_templates.hh"
+
+#endif // !defined(PPL_Linear_Expression_Impl_defs_hh)
diff --git a/src/Linear_Expression_Impl_inlines.hh b/src/Linear_Expression_Impl_inlines.hh
new file mode 100644
index 0000000..40ca53e
--- /dev/null
+++ b/src/Linear_Expression_Impl_inlines.hh
@@ -0,0 +1,282 @@
+/* Linear_Expression_Impl class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Expression_Impl_inlines_hh
+#define PPL_Linear_Expression_Impl_inlines_hh 1
+
+#include "math_utilities_defs.hh"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+inline dimension_type
+Linear_Expression_Impl<Row>::max_space_dimension() {
+  return Row::max_size() - 1;
+}
+
+template <typename Row>
+inline
+Linear_Expression_Impl<Row>::Linear_Expression_Impl()
+  : row(1) {
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(dimension_type space_dim, bool)
+  : row(space_dim + 1) {
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_Expression_Impl<Row>::~Linear_Expression_Impl() {
+}
+
+template <typename Row>
+inline
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(Coefficient_traits::const_reference n)
+  : row(1) {
+  if (n != 0)
+    row.insert(0, n);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline dimension_type
+Linear_Expression_Impl<Row>::space_dimension() const {
+  return row.size() - 1;
+}
+
+template <typename Row>
+inline void
+Linear_Expression_Impl<Row>::set_space_dimension(dimension_type n) {
+  row.resize(n + 1);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline Coefficient_traits::const_reference
+Linear_Expression_Impl<Row>::coefficient(Variable v) const {
+  if (v.space_dimension() > space_dimension())
+    return Coefficient_zero();
+  return row.get(v.id() + 1);
+}
+
+template <typename Row>
+inline void
+Linear_Expression_Impl<Row>
+::set_coefficient(Variable v, Coefficient_traits::const_reference n) {
+  PPL_ASSERT(v.space_dimension() <= space_dimension());
+  const dimension_type i = v.space_dimension();
+  if (n == 0)
+    row.reset(i);
+  else
+    row.insert(i, n);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline Coefficient_traits::const_reference
+Linear_Expression_Impl<Row>::inhomogeneous_term() const {
+  return row.get(0);
+}
+
+template <typename Row>
+inline void
+Linear_Expression_Impl<Row>
+::set_inhomogeneous_term(Coefficient_traits::const_reference n) {
+  if (n == 0)
+    row.reset(0);
+  else
+    row.insert(0, n);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_Expression_Impl<Row>::swap_space_dimensions(Variable v1, Variable v2) {
+  row.swap_coefficients(v1.space_dimension(), v2.space_dimension());
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_Expression_Impl<Row>::shift_space_dimensions(Variable v,
+                                                    dimension_type n) {
+  row.add_zeroes_and_shift(n, v.space_dimension());
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline memory_size_type
+Linear_Expression_Impl<Row>::external_memory_in_bytes() const {
+  return row.external_memory_in_bytes();
+}
+
+template <typename Row>
+inline memory_size_type
+Linear_Expression_Impl<Row>::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+template <typename Row>
+inline Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator+=(Coefficient_traits::const_reference n) {
+  typename Row::iterator itr = row.insert(0);
+  (*itr) += n;
+  if (*itr == 0)
+    row.reset(itr);
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+template <typename Row>
+inline Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator-=(Coefficient_traits::const_reference n) {
+  typename Row::iterator itr = row.insert(0);
+  (*itr) -= n;
+  if (*itr == 0)
+    row.reset(itr);
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+template <typename Row>
+inline void
+Linear_Expression_Impl<Row>::normalize() {
+  row.normalize();
+  PPL_ASSERT(OK());
+}
+
+template <>
+inline bool
+Linear_Expression_Impl<Sparse_Row>::is_zero() const {
+  return row.num_stored_elements() == 0;
+}
+
+template <>
+inline bool
+Linear_Expression_Impl<Sparse_Row>::all_homogeneous_terms_are_zero() const {
+  return row.lower_bound(1) == row.end();
+}
+
+template <>
+inline bool
+Linear_Expression_Impl<Sparse_Row>::all_zeroes(dimension_type start,
+                                               dimension_type end) const {
+  return row.lower_bound(start) == row.lower_bound(end);
+}
+
+template <>
+inline dimension_type
+Linear_Expression_Impl<Sparse_Row>::num_zeroes(dimension_type start,
+                                               dimension_type end) const {
+  PPL_ASSERT(start <= end);
+  return (end - start)
+    - std::distance(row.lower_bound(start), row.lower_bound(end));
+}
+
+template <>
+inline dimension_type
+Linear_Expression_Impl<Sparse_Row>::last_nonzero() const {
+  if (row.num_stored_elements() == 0)
+    return 0;
+  Sparse_Row::const_iterator i = row.end();
+  --i;
+  return i.index();
+}
+
+template <>
+inline dimension_type
+Linear_Expression_Impl<Sparse_Row>
+::first_nonzero(dimension_type first, dimension_type last) const {
+  PPL_ASSERT(first <= last);
+  PPL_ASSERT(last <= row.size());
+  Sparse_Row::const_iterator i = row.lower_bound(first);
+
+  if (i != row.end() && i.index() < last)
+    return i.index();
+  else
+    return last;
+}
+
+template <>
+inline dimension_type
+Linear_Expression_Impl<Sparse_Row>
+::last_nonzero(dimension_type first, dimension_type last) const {
+  PPL_ASSERT(first <= last);
+  PPL_ASSERT(last <= row.size());
+  Sparse_Row::const_iterator itr1 = row.lower_bound(first);
+  Sparse_Row::const_iterator itr2 = row.lower_bound(last);
+
+  if (itr1 == itr2)
+    return last;
+
+  --itr2;
+  return itr2.index();
+}
+
+template <>
+inline Representation
+Linear_Expression_Impl<Dense_Row>::representation() const {
+  return DENSE;
+}
+
+template <>
+inline Representation
+Linear_Expression_Impl<Sparse_Row>::representation() const {
+  return SPARSE;
+}
+
+template <>
+inline void
+Linear_Expression_Impl<Sparse_Row>::const_iterator
+::skip_zeroes_forward() {
+  // Nothing to do.
+}
+
+template <>
+inline void
+Linear_Expression_Impl<Sparse_Row>::const_iterator
+::skip_zeroes_backward() {
+  // Nothing to do.
+}
+
+namespace IO_Operators {
+
+template <typename Row>
+inline std::ostream&
+operator<<(std::ostream& s, const Linear_Expression_Impl<Row>& e) {
+  e.print(s);
+  return s;
+}
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Expression_Impl_inlines_hh)
diff --git a/src/Linear_Expression_Impl_templates.hh b/src/Linear_Expression_Impl_templates.hh
new file mode 100644
index 0000000..e9419ed
--- /dev/null
+++ b/src/Linear_Expression_Impl_templates.hh
@@ -0,0 +1,1316 @@
+/* Linear_Expression_Impl class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Expression_Impl_templates_hh
+#define PPL_Linear_Expression_Impl_templates_hh 1
+
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+
+#include "Constraint_defs.hh"
+#include "Generator_defs.hh"
+#include "Grid_Generator_defs.hh"
+#include "Congruence_defs.hh"
+#include <stdexcept>
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Impl& e) {
+  construct(e);
+}
+
+template <typename Row>
+template <typename Row2>
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Impl<Row2>& e) {
+  construct(e);
+}
+
+template <typename Row>
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Interface& e) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
+    construct(*p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
+    construct(*p);
+  }
+  else {
+    // Add implementations for other derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Interface& e,
+                         dimension_type space_dim) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
+    construct(*p, space_dim);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
+    construct(*p, space_dim);
+  }
+  else {
+    // Add implementations for other derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Impl<Row2>& y, Variable i) {
+  PPL_ASSERT(space_dimension() == y.space_dimension());
+  PPL_ASSERT(i.space_dimension() <= space_dimension());
+  linear_combine(y, i.space_dimension());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Impl<Row2>& y, dimension_type i) {
+  const Linear_Expression_Impl& x = *this;
+  PPL_ASSERT(i < x.space_dimension() + 1);
+  PPL_ASSERT(x.space_dimension() == y.space_dimension());
+  Coefficient_traits::const_reference x_i = x.row.get(i);
+  Coefficient_traits::const_reference y_i = y.row.get(i);
+  PPL_ASSERT(x_i != 0);
+  PPL_ASSERT(y_i != 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(normalized_x_v);
+  PPL_DIRTY_TEMP_COEFFICIENT(normalized_y_v);
+  normalize2(x_i, y_i, normalized_x_v, normalized_y_v);
+  neg_assign(normalized_x_v);
+  linear_combine(y, normalized_y_v, normalized_x_v);
+  // We cannot use x_i here because it may have been invalidated by
+  // linear_combine().
+  assert(x.row.get(i) == 0);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Impl<Row2>& y,
+                 Coefficient_traits::const_reference c1,
+                 Coefficient_traits::const_reference c2) {
+  PPL_ASSERT(c1 != 0);
+  PPL_ASSERT(c2 != 0);
+  if (space_dimension() < y.space_dimension())
+    set_space_dimension(y.space_dimension());
+  linear_combine(y, c1, c2, 0, y.space_dimension() + 1);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
+                     Coefficient_traits::const_reference c1,
+                     Coefficient_traits::const_reference c2) {
+  if (space_dimension() < y.space_dimension())
+    set_space_dimension(y.space_dimension());
+  linear_combine_lax(y, c1, c2, 0, y.space_dimension() + 1);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+int
+Linear_Expression_Impl<Row>
+::compare(const Linear_Expression_Impl<Row2>& y) const {
+  const Linear_Expression_Impl& x = *this;
+  // Compare all the coefficients of the row starting from position 1.
+  // NOTE: x and y may be of different size.
+  typename Row::const_iterator i = x.row.lower_bound(1);
+  typename Row::const_iterator i_end = x.row.end();
+  typename Row2::const_iterator j = y.row.lower_bound(1);
+  typename Row2::const_iterator j_end = y.row.end();
+  while (i != i_end && j != j_end) {
+    if (i.index() < j.index()) {
+      const int s = sgn(*i);
+      if (s != 0)
+        return 2*s;
+      ++i;
+      continue;
+    }
+    if (i.index() > j.index()) {
+      const int s = sgn(*j);
+      if (s != 0)
+        return -2*s;
+      ++j;
+      continue;
+    }
+    PPL_ASSERT(i.index() == j.index());
+    const int s = cmp(*i, *j);
+    if (s < 0)
+      return -2;
+    if (s > 0)
+      return 2;
+    PPL_ASSERT(s == 0);
+    ++i;
+    ++j;
+  }
+  for ( ; i != i_end; ++i) {
+    const int s = sgn(*i);
+    if (s != 0)
+      return 2*s;
+  }
+  for ( ; j != j_end; ++j) {
+    const int s = sgn(*j);
+    if (s != 0)
+      return -2*s;
+  }
+
+  // If all the coefficients in `x' equal all the coefficients in `y'
+  // (starting from position 1) we compare coefficients in position 0,
+  // i.e., inhomogeneous terms.
+  const int comp = cmp(x.row.get(0), y.row.get(0));
+  if (comp > 0)
+    return 1;
+  if (comp < 0)
+    return -1;
+  PPL_ASSERT(comp == 0);
+
+  // `x' and `y' are equal.
+  return 0;
+}
+
+template <typename Row>
+Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Variable v) {
+  if (v.space_dimension() > max_space_dimension())
+    throw std::length_error("Linear_Expression_Impl::"
+                            "Linear_Expression_Impl(v):\n"
+                            "v exceeds the maximum allowed "
+                            "space dimension.");
+  set_space_dimension(v.space_dimension());
+  (*this) += v;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+bool
+Linear_Expression_Impl<Row>
+::is_equal_to(const Linear_Expression_Impl<Row2>& x) const {
+  return row == x.row;
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::get_row(Dense_Row& row) const {
+  row = this->row;
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::get_row(Sparse_Row& row) const {
+  row = this->row;
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::permute_space_dimensions(const std::vector<Variable>& cycle) {
+  const dimension_type n = cycle.size();
+  if (n < 2)
+    return;
+
+  if (n == 2) {
+    row.swap_coefficients(cycle[0].space_dimension(),
+                          cycle[1].space_dimension());
+  }
+  else {
+    PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+    tmp = row.get(cycle.back().space_dimension());
+    for (dimension_type i = n - 1; i-- > 0; )
+      row.swap_coefficients(cycle[i + 1].space_dimension(),
+                            cycle[i].space_dimension());
+    if (tmp == 0)
+      row.reset(cycle[0].space_dimension());
+    else {
+      using std::swap;
+      swap(tmp, row[cycle[0].space_dimension()]);
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator+=(const Linear_Expression_Impl<Row2>& e) {
+  linear_combine(e, Coefficient_one(), Coefficient_one());
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator+=(const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
+    throw std::length_error("Linear_Expression_Impl& "
+                            "operator+=(e, v):\n"
+                            "v exceeds the maximum allowed space dimension.");
+  if (space_dimension() < v_space_dim)
+    set_space_dimension(v_space_dim);
+  typename Row::iterator itr = row.insert(v_space_dim);
+  ++(*itr);
+  if (*itr == 0)
+    row.reset(itr);
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+template <typename Row2>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator-=(const Linear_Expression_Impl<Row2>& e2) {
+  linear_combine(e2, Coefficient_one(), -1);
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator-=(const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
+    throw std::length_error("Linear_Expression_Impl& "
+                            "operator-=(e, v):\n"
+                            "v exceeds the maximum allowed space dimension.");
+  if (space_dimension() < v_space_dim)
+    set_space_dimension(v_space_dim);
+  typename Row::iterator itr = row.insert(v_space_dim);
+  --(*itr);
+  if (*itr == 0)
+    row.reset(itr);
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator*=(Coefficient_traits::const_reference n) {
+  if (n == 0) {
+    row.clear();
+    PPL_ASSERT(OK());
+    return *this;
+  }
+  for (typename Row::iterator i = row.begin(),
+         i_end = row.end(); i != i_end; ++i)
+    (*i) *= n;
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::operator/=(Coefficient_traits::const_reference n) {
+  typename Row::iterator i = row.begin();
+  const typename Row::iterator& i_end = row.end();
+  while (i != i_end) {
+    (*i) /= n;
+    if (*i == 0)
+      i = row.reset(i);
+    else
+      ++i;
+  }
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::negate() {
+  for (typename Row::iterator i = row.begin(),
+         i_end = row.end(); i != i_end; ++i)
+    neg_assign(*i);
+  PPL_ASSERT(OK());
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>::add_mul_assign(Coefficient_traits::const_reference n,
+                                            const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
+    throw std::length_error("Linear_Expression_Impl& "
+                            "add_mul_assign(e, n, v):\n"
+                            "v exceeds the maximum allowed space dimension.");
+  if (space_dimension() < v_space_dim)
+    set_space_dimension(v_space_dim);
+  if (n == 0)
+    return *this;
+  typename Row::iterator itr = row.insert(v_space_dim);
+  (*itr) += n;
+  if (*itr == 0)
+    row.reset(itr);
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression_Impl */
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>
+::sub_mul_assign(Coefficient_traits::const_reference n,
+                 const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Expression_Impl<Row>::max_space_dimension())
+    throw std::length_error("Linear_Expression_Impl& "
+                            "sub_mul_assign(e, n, v):\n"
+                            "v exceeds the maximum allowed space dimension.");
+  if (space_dimension() < v_space_dim)
+    set_space_dimension(v_space_dim);
+  if (n == 0)
+    return *this;
+  typename Row::iterator itr = row.insert(v_space_dim);
+  (*itr) -= n;
+  if (*itr == 0)
+    row.reset(itr);
+  PPL_ASSERT(OK());
+  return *this;
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::add_mul_assign(Coefficient_traits::const_reference factor,
+                 const Linear_Expression_Impl<Row2>& y) {
+  if (factor != 0)
+    linear_combine(y, Coefficient_one(), factor);
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::sub_mul_assign(Coefficient_traits::const_reference factor,
+                 const Linear_Expression_Impl<Row2>& y) {
+  if (factor != 0)
+    linear_combine(y, Coefficient_one(), -factor);
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::print(std::ostream& s) const {
+  PPL_DIRTY_TEMP_COEFFICIENT(ev);
+  bool first = true;
+  for (typename Row::const_iterator i = row.lower_bound(1), i_end = row.end();
+       i != i_end; ++i) {
+    ev = *i;
+    if (ev == 0)
+      continue;
+    if (!first) {
+      if (ev > 0)
+        s << " + ";
+      else {
+        s << " - ";
+        neg_assign(ev);
+      }
+    }
+    else
+      first = false;
+    if (ev == -1)
+      s << "-";
+    else if (ev != 1)
+      s << ev << "*";
+    IO_Operators::operator<<(s, Variable(i.index() - 1));
+  }
+  // Inhomogeneous term.
+  PPL_DIRTY_TEMP_COEFFICIENT(it);
+  it = row[0];
+  if (it != 0) {
+    if (!first) {
+      if (it > 0)
+        s << " + ";
+      else {
+        s << " - ";
+        neg_assign(it);
+      }
+    }
+    else
+      first = false;
+    s << it;
+  }
+
+  if (first)
+    // The null linear expression.
+    s << Coefficient_zero();
+}
+
+template <typename Row>
+Coefficient_traits::const_reference
+Linear_Expression_Impl<Row>::get(dimension_type i) const {
+  return row.get(i);
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::set(dimension_type i, Coefficient_traits::const_reference n) {
+  if (n == 0)
+    row.reset(i);
+  else
+    row.insert(i, n);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::exact_div_assign(Coefficient_traits::const_reference c,
+                   dimension_type start, dimension_type end) {
+  // NOTE: Since all coefficients in [start,end) are multiple of c,
+  // each of the resulting coefficients will be nonzero iff the initial
+  // coefficient was.
+  for (typename Row::iterator i = row.lower_bound(start),
+         i_end = row.lower_bound(end); i != i_end; ++i)
+    Parma_Polyhedra_Library::exact_div_assign(*i, *i, c);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::mul_assign(Coefficient_traits::const_reference c,
+                   dimension_type start, dimension_type end) {
+  if (c == 0) {
+    typename Row::iterator i = row.lower_bound(start);
+    const typename Row::iterator& i_end = row.end();
+    while (i != i_end && i.index() < end)
+      i = row.reset(i);
+  }
+  else {
+    for (typename Row::iterator
+      i = row.lower_bound(start), i_end = row.lower_bound(end); i != i_end; ++i)
+      (*i) *= c;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Impl<Row2>& y,
+                 Coefficient_traits::const_reference c1,
+                 Coefficient_traits::const_reference c2,
+                 dimension_type start, dimension_type end) {
+  Parma_Polyhedra_Library::linear_combine(row, y.row, c1, c2, start, end);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::linear_combine_lax(const Linear_Expression_Impl<Row2>& y,
+                     Coefficient_traits::const_reference c1,
+                     Coefficient_traits::const_reference c2,
+                     dimension_type start, dimension_type end) {
+  PPL_ASSERT(start <= end);
+  PPL_ASSERT(end <= row.size());
+  PPL_ASSERT(end <= y.row.size());
+  if (c1 == 0) {
+    if (c2 == 0) {
+      PPL_ASSERT(c1 == 0);
+      PPL_ASSERT(c2 == 0);
+      typename Row::iterator i = row.lower_bound(start);
+      const typename Row::iterator& i_end = row.end();
+      while (i != i_end && i.index() < end)
+        i = row.reset(i);
+    }
+    else {
+      PPL_ASSERT(c1 == 0);
+      PPL_ASSERT(c2 != 0);
+
+      typename Row::iterator i = row.lower_bound(start);
+      const typename Row::iterator& i_end = row.end();
+      typename Row2::const_iterator j = y.row.lower_bound(start);
+      typename Row2::const_iterator j_last = y.row.lower_bound(end);
+
+      while (i != i_end && i.index() < end && j != j_last) {
+        if (i.index() < j.index()) {
+          i = row.reset(i);
+          continue;
+        }
+        if (i.index() > j.index()) {
+          i = row.insert(i, j.index(), *j);
+          (*i) *= c2;
+          ++i;
+          ++j;
+          continue;
+        }
+        PPL_ASSERT(i.index() == j.index());
+        (*i) = (*j);
+        (*i) *= c2;
+        ++i;
+        ++j;
+      }
+      while (i != i_end && i.index() < end)
+        i = row.reset(i);
+      while (j != j_last) {
+        i = row.insert(i, j.index(), *j);
+        (*i) *= c2;
+        // No need to increment i here.
+        ++j;
+      }
+    }
+  }
+  else {
+    if (c2 == 0) {
+      PPL_ASSERT(c1 != 0);
+      PPL_ASSERT(c2 == 0);
+      for (typename Row::iterator i = row.lower_bound(start),
+             i_end = row.lower_bound(end); i != i_end; ++i)
+        (*i) *= c1;
+    }
+    else {
+      PPL_ASSERT(c1 != 0);
+      PPL_ASSERT(c2 != 0);
+      Parma_Polyhedra_Library::linear_combine(row, y.row, c1, c2, start, end);
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::sign_normalize() {
+  typename Row::iterator i = row.lower_bound(1);
+  typename Row::iterator i_end = row.end();
+
+  for ( ; i != i_end; ++i)
+    if (*i != 0)
+      break;
+
+  if (i != i_end && *i < 0) {
+    for ( ; i != i_end; ++i)
+      neg_assign(*i);
+    // Negate the first coefficient, too.
+    typename Row::iterator first = row.begin();
+    if (first != row.end() && first.index() == 0)
+      neg_assign(*first);
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::negate(dimension_type first, dimension_type last) {
+  PPL_ASSERT(first <= last);
+  PPL_ASSERT(last <= row.size());
+  typename Row::iterator i = row.lower_bound(first);
+  typename Row::iterator i_end = row.lower_bound(last);
+  for ( ; i != i_end; ++i)
+    neg_assign(*i);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>::construct(const Linear_Expression_Impl<Row2>& e) {
+  row = e.row;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>::construct(const Linear_Expression_Impl<Row2>& e,
+                                       dimension_type space_dim) {
+  Row x(e.row, space_dim + 1, space_dim + 1);
+  swap(row, x);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+template <typename Row2>
+void
+Linear_Expression_Impl<Row>
+::scalar_product_assign(Coefficient& result,
+                        const Linear_Expression_Impl<Row2>& y,
+                        dimension_type start, dimension_type end) const {
+  const Linear_Expression_Impl<Row>& x = *this;
+  PPL_ASSERT(start <= end);
+  PPL_ASSERT(end <= x.row.size());
+  PPL_ASSERT(end <= y.row.size());
+  result = 0;
+  typename Row ::const_iterator x_i = x.row.lower_bound(start);
+  typename Row ::const_iterator x_end = x.row.lower_bound(end);
+  typename Row2::const_iterator y_i = y.row.lower_bound(start);
+  typename Row2::const_iterator y_end = y.row.lower_bound(end);
+  while (x_i != x_end && y_i != y_end) {
+    if (x_i.index() == y_i.index()) {
+      Parma_Polyhedra_Library::add_mul_assign(result, *x_i, *y_i);
+      ++x_i;
+      ++y_i;
+    }
+    else {
+      if (x_i.index() < y_i.index()) {
+        PPL_ASSERT(y.row.get(x_i.index()) == 0);
+        // (*x_i) * 0 == 0, nothing to do.
+        ++x_i;
+      }
+      else {
+        PPL_ASSERT(x.row.get(y_i.index()) == 0);
+        // 0 * (*y_i) == 0, nothing to do.
+        ++y_i;
+      }
+    }
+  }
+  // In the remaining positions (if any) at most one row is nonzero, so
+  // there's nothing left to do.
+}
+
+template <typename Row>
+template <typename Row2>
+int
+Linear_Expression_Impl<Row>
+::scalar_product_sign(const Linear_Expression_Impl<Row2>& y,
+                      dimension_type start, dimension_type end) const {
+  PPL_DIRTY_TEMP_COEFFICIENT(result);
+  scalar_product_assign(result, y, start, end);
+  return sgn(result);
+}
+
+template <typename Row>
+template <typename Row2>
+bool
+Linear_Expression_Impl<Row>
+::is_equal_to(const Linear_Expression_Impl<Row2>& y,
+              dimension_type start, dimension_type end) const {
+  const Linear_Expression_Impl<Row>& x = *this;
+  PPL_ASSERT(start <= end);
+  PPL_ASSERT(end <= x.row.size());
+  PPL_ASSERT(end <= y.row.size());
+
+  typename Row::const_iterator i = x.row.lower_bound(start);
+  typename Row::const_iterator i_end = x.row.lower_bound(end);
+  typename Row2::const_iterator j = y.row.lower_bound(start);
+  typename Row2::const_iterator j_end = y.row.lower_bound(end);
+  while (i != i_end && j != j_end) {
+    if (i.index() == j.index()) {
+      if (*i != *j)
+        return false;
+      ++i;
+      ++j;
+    }
+    else {
+      if (i.index() < j.index()) {
+        if (*i != 0)
+          return false;
+        ++i;
+      }
+      else {
+        PPL_ASSERT(i.index() > j.index());
+        if (*j != 0)
+          return false;
+        ++j;
+      }
+    }
+  }
+  for ( ; i != i_end; ++i)
+    if (*i != 0)
+      return false;
+  for ( ; j != j_end; ++j)
+    if (*j != 0)
+      return false;
+  return true;
+}
+
+template <typename Row>
+template <typename Row2>
+bool
+Linear_Expression_Impl<Row>
+::is_equal_to(const Linear_Expression_Impl<Row2>& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  const Linear_Expression_Impl<Row>& x = *this;
+  PPL_ASSERT(start <= end);
+  PPL_ASSERT(end <= x.row.size());
+  PPL_ASSERT(end <= y.row.size());
+
+  // Deal with trivial cases.
+  if (c1 == 0) {
+    if (c2 == 0)
+      return true;
+    else
+      return y.all_zeroes(start, end);
+  }
+  if (c2 == 0)
+    return x.all_zeroes(start, end);
+
+  PPL_ASSERT(c1 != 0);
+  PPL_ASSERT(c2 != 0);
+  typename Row::const_iterator i = x.row.lower_bound(start);
+  typename Row::const_iterator i_end = x.row.lower_bound(end);
+  typename Row2::const_iterator j = y.row.lower_bound(start);
+  typename Row2::const_iterator j_end = y.row.lower_bound(end);
+  while (i != i_end && j != j_end) {
+    if (i.index() == j.index()) {
+      if ((*i) * c1 != (*j) * c2)
+        return false;
+      ++i;
+      ++j;
+    }
+    else {
+      if (i.index() < j.index()) {
+        if (*i != 0)
+          return false;
+        ++i;
+      }
+      else {
+        PPL_ASSERT(i.index() > j.index());
+        if (*j != 0)
+          return false;
+        ++j;
+      }
+    }
+  }
+  for ( ; i != i_end; ++i)
+    if (*i != 0)
+      return false;
+  for ( ; j != j_end; ++j)
+    if (*j != 0)
+      return false;
+  return true;
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Interface& y, Variable v) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    linear_combine(*p, v);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    linear_combine(*p, v);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Interface& y,
+                 Coefficient_traits::const_reference c1,
+                 Coefficient_traits::const_reference c2) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    linear_combine(*p, c1, c2);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    linear_combine(*p, c1, c2);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::linear_combine_lax(const Linear_Expression_Interface& y,
+                     Coefficient_traits::const_reference c1,
+                     Coefficient_traits::const_reference c2) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    linear_combine_lax(*p, c1, c2);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    linear_combine_lax(*p, c1, c2);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>
+::is_equal_to(const Linear_Expression_Interface& y) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return is_equal_to(*p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return is_equal_to(*p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return false;
+  }
+}
+
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>
+::operator+=(const Linear_Expression_Interface& y) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return operator+=(*p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return operator+=(*p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return *this;
+  }
+}
+
+template <typename Row>
+Linear_Expression_Impl<Row>&
+Linear_Expression_Impl<Row>
+::operator-=(const Linear_Expression_Interface& y) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return operator-=(*p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return operator-=(*p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return *this;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::add_mul_assign(Coefficient_traits::const_reference factor,
+                 const Linear_Expression_Interface& y) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    add_mul_assign(factor, *p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    add_mul_assign(factor, *p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::sub_mul_assign(Coefficient_traits::const_reference factor,
+                 const Linear_Expression_Interface& y) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    sub_mul_assign(factor, *p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    sub_mul_assign(factor, *p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Interface& y, dimension_type i) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    linear_combine(*p, i);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    linear_combine(*p, i);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::linear_combine(const Linear_Expression_Interface& y,
+                 Coefficient_traits::const_reference c1,
+                 Coefficient_traits::const_reference c2,
+                 dimension_type start, dimension_type end) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    linear_combine(*p, c1, c2, start, end);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    linear_combine(*p, c1, c2, start, end);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::linear_combine_lax(const Linear_Expression_Interface& y,
+                     Coefficient_traits::const_reference c1,
+                     Coefficient_traits::const_reference c2,
+                     dimension_type start, dimension_type end) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    linear_combine_lax(*p, c1, c2, start, end);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    linear_combine_lax(*p, c1, c2, start, end);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+int
+Linear_Expression_Impl<Row>
+::compare(const Linear_Expression_Interface& y) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return compare(*p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return compare(*p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return 0;
+  }
+}
+
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::construct(const Linear_Expression_Interface& y) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return construct(*p);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return construct(*p);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::construct(const Linear_Expression_Interface& y,
+                                       dimension_type space_dim) {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return construct(*p, space_dim);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return construct(*p, space_dim);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>
+::scalar_product_assign(Coefficient& result,
+                        const Linear_Expression_Interface& y,
+                        dimension_type start, dimension_type end) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    scalar_product_assign(result, *p, start, end);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    scalar_product_assign(result, *p, start, end);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+  }
+}
+
+template <typename Row>
+int
+Linear_Expression_Impl<Row>
+::scalar_product_sign(const Linear_Expression_Interface& y,
+                      dimension_type start, dimension_type end) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return scalar_product_sign(*p, start, end);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return scalar_product_sign(*p, start, end);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return 0;
+  }
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>
+::is_equal_to(const Linear_Expression_Interface& y,
+              dimension_type start, dimension_type end) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return is_equal_to(*p, start, end);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return is_equal_to(*p, start, end);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return false;
+  }
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>
+::is_equal_to(const Linear_Expression_Interface& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return is_equal_to(*p, c1, c2, start, end);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return is_equal_to(*p, c1, c2, start, end);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return false;
+  }
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>
+::have_a_common_variable(const Linear_Expression_Interface& y,
+                         Variable first, Variable last) const {
+  typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
+  typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+    return have_a_common_variable(*p, first, last);
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+    return have_a_common_variable(*p, first, last);
+  }
+  else {
+    // Add implementations for new derived classes here.
+    PPL_UNREACHABLE;
+    return false;
+  }
+}
+
+template <typename Row>
+Linear_Expression_Interface::const_iterator_interface*
+Linear_Expression_Impl<Row>::begin() const {
+  return new const_iterator(row, 1);
+}
+
+template <typename Row>
+Linear_Expression_Interface::const_iterator_interface*
+Linear_Expression_Impl<Row>::end() const {
+  return new const_iterator(row, row.size());
+}
+
+template <typename Row>
+Linear_Expression_Interface::const_iterator_interface*
+Linear_Expression_Impl<Row>::lower_bound(Variable v) const {
+  return new const_iterator(row, v.space_dimension());
+}
+
+template <typename Row>
+Linear_Expression_Impl<Row>::const_iterator
+::const_iterator(const Row& row1, dimension_type i)
+  : row(&row1), itr(row1.lower_bound(i)) {
+  skip_zeroes_forward();
+}
+
+template <typename Row>
+Linear_Expression_Interface::const_iterator_interface*
+Linear_Expression_Impl<Row>::const_iterator
+::clone() const {
+  return new const_iterator(*this);
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::const_iterator
+::operator++() {
+  ++itr;
+  skip_zeroes_forward();
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::const_iterator
+::operator--() {
+  --itr;
+  skip_zeroes_backward();
+}
+
+template <typename Row>
+typename Linear_Expression_Impl<Row>::const_iterator::reference
+Linear_Expression_Impl<Row>::const_iterator
+::operator*() const {
+  return *itr;
+}
+
+template <typename Row>
+Variable
+Linear_Expression_Impl<Row>::const_iterator
+::variable() const {
+  const dimension_type i = itr.index();
+  PPL_ASSERT(i != 0);
+  return Variable(i - 1);
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>::const_iterator
+::operator==(const const_iterator_interface& x) const {
+  const const_iterator* const p = dynamic_cast<const const_iterator*>(&x);
+  // Comparing iterators belonging to different rows is forbidden.
+  PPL_ASSERT(p != 0);
+  PPL_ASSERT(row == p->row);
+  return itr == p->itr;
+}
+
+template <typename Row>
+void
+Linear_Expression_Impl<Row>::ascii_dump(std::ostream& s) const {
+  s << "size " << (space_dimension() + 1) << " ";
+  for (dimension_type i = 0; i < row.size(); ++i) {
+    s << row.get(i);
+    if (i != row.size() - 1)
+      s << ' ';
+  }
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>::ascii_load(std::istream& s) {
+  std::string str;
+
+  if (!(s >> str))
+    return false;
+  if (str != "size")
+    return false;
+
+  dimension_type new_size;
+  if (!(s >> new_size))
+    return false;
+
+  row.resize(0);
+  row.resize(new_size);
+
+  PPL_DIRTY_TEMP_COEFFICIENT(c);
+
+  for (dimension_type j = 0; j < new_size; ++j) {
+    if (!(s >> c))
+      return false;
+    if (c != 0)
+      row.insert(j, c);
+  }
+
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename Row>
+bool
+Linear_Expression_Impl<Row>::OK() const {
+  return row.OK();
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Expression_Impl_templates_hh)
diff --git a/src/Linear_Expression_Impl_types.hh b/src/Linear_Expression_Impl_types.hh
new file mode 100644
index 0000000..e2beb9b
--- /dev/null
+++ b/src/Linear_Expression_Impl_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Linear_Expression_Impl_types_hh
+#define PPL_Linear_Expression_Impl_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+class Linear_Expression_Impl;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Expression_Impl_types_hh)
diff --git a/src/Linear_Expression_Interface.cc b/src/Linear_Expression_Interface.cc
index 7918b69..b064538 100644
--- a/src/Linear_Expression_Interface.cc
+++ b/src/Linear_Expression_Interface.cc
@@ -1,6 +1,6 @@
 /* Linear_Expression_Interface class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,7 +23,7 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
 
-#include "Linear_Expression_Interface.defs.hh"
+#include "Linear_Expression_Interface_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
diff --git a/src/Linear_Expression_Interface.defs.hh b/src/Linear_Expression_Interface.defs.hh
deleted file mode 100644
index 6739c55..0000000
--- a/src/Linear_Expression_Interface.defs.hh
+++ /dev/null
@@ -1,489 +0,0 @@
-/* Linear_Expression_Interface class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Expression_Interface_defs_hh
-#define PPL_Linear_Expression_Interface_defs_hh 1
-
-#include "Linear_Expression_Interface.types.hh"
-#include "Coefficient.defs.hh"
-#include "Variable.types.hh"
-#include "Variables_Set.types.hh"
-#include "Dense_Row.types.hh"
-#include "Sparse_Row.types.hh"
-#include <vector>
-#include <set>
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A linear expression.
-/*! \ingroup PPL_CXX_interface
-  An object of a class implementing Linear_Expression_Interface
-  represents a linear expression
-  \f[
-    \sum_{i=0}^{n-1} a_i x_i + b
-  \f]
-  where \f$n\f$ is the dimension of the vector space,
-  each \f$a_i\f$ is the integer coefficient
-  of the \f$i\f$-th variable \f$x_i\f$
-  and \f$b\f$ is the integer for the inhomogeneous term.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Linear_Expression_Interface {
-public:
-  virtual ~Linear_Expression_Interface();
-
-  virtual bool OK() const = 0;
-
-  //! Returns the current representation of this linear expression.
-  virtual Representation representation() const = 0;
-
-  //! An interface for const iterators on the expression (homogeneous)
-  //! coefficients that are nonzero.
-  /*!
-    These iterators are invalidated by operations that modify the expression.
-  */
-  class const_iterator_interface {
-  public:
-    typedef std::bidirectional_iterator_tag iterator_category;
-    typedef const Coefficient value_type;
-    typedef ptrdiff_t difference_type;
-    typedef value_type* pointer;
-    typedef Coefficient_traits::const_reference reference;
-
-    //! Returns a copy of *this.
-    //! This returns a pointer to dynamic-allocated memory. The caller has the
-    //! duty to free the memory when it's not needed anymore.
-    virtual const_iterator_interface* clone() const = 0;
-
-    virtual ~const_iterator_interface();
-
-    //! Navigates to the next nonzero coefficient.
-    //! Note that this method does *not* return a reference, to increase
-    //! efficiency since it's virtual.
-    virtual void operator++() = 0;
-
-    //! Navigates to the previous nonzero coefficient.
-    //! Note that this method does *not* return a reference, to increase
-    //! efficiency since it's virtual.
-    virtual void operator--() = 0;
-
-    //! Returns the current element.
-    virtual reference operator*() const = 0;
-
-    //! Returns the variable of the coefficient pointed to by \c *this.
-    /*!
-      \returns the variable of the coefficient pointed to by \c *this.
-    */
-    virtual Variable variable() const = 0;
-
-    //! Compares \p *this with x .
-    /*!
-      \param x
-      The %iterator that will be compared with *this.
-    */
-    virtual bool operator==(const const_iterator_interface& x) const = 0;
-  };
-
-  //! This returns a pointer to dynamic-allocated memory. The caller has the
-  //! duty to free the memory when it's not needed anymore.
-  virtual const_iterator_interface* begin() const = 0;
-
-  //! This returns a pointer to dynamic-allocated memory. The caller has the
-  //! duty to free the memory when it's not needed anymore.
-  virtual const_iterator_interface* end() const = 0;
-
-  //! This returns a pointer to dynamic-allocated memory. The caller has the
-  //! duty to free the memory when it's not needed anymore.
-  //! Returns (a pointer to) an iterator that points to the first nonzero
-  //! coefficient of a variable greater than or equal to v, or at end if no
-  //! such coefficient exists.
-  virtual const_iterator_interface* lower_bound(Variable v) const = 0;
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  virtual dimension_type space_dimension() const = 0;
-
-  //! Sets the dimension of the vector space enclosing \p *this to \p n .
-  virtual void set_space_dimension(dimension_type n) = 0;
-
-  //! Returns the coefficient of \p v in \p *this.
-  virtual Coefficient_traits::const_reference
-  coefficient(Variable v) const = 0;
-
-  //! Sets the coefficient of \p v in \p *this to \p n.
-  virtual void
-  set_coefficient(Variable v, Coefficient_traits::const_reference n) = 0;
-
-  //! Returns the inhomogeneous term of \p *this.
-  virtual Coefficient_traits::const_reference inhomogeneous_term() const = 0;
-
-  //! Sets the inhomogeneous term of \p *this to \p n.
-  virtual void
-  set_inhomogeneous_term(Coefficient_traits::const_reference n) = 0;
-
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param v
-    The variable whose coefficient has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  virtual void
-  linear_combine(const Linear_Expression_Interface& y, Variable v) = 0;
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
-  //! \p *this and \p y have the same space dimension.
-  virtual void linear_combine(const Linear_Expression_Interface& y,
-                              Coefficient_traits::const_reference c1,
-                              Coefficient_traits::const_reference c2) = 0;
-
-  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
-  //! c1 and c2 may be 0.
-  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
-                                  Coefficient_traits::const_reference c1,
-                                  Coefficient_traits::const_reference c2) = 0;
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  virtual void swap_space_dimensions(Variable v1, Variable v2) = 0;
-
-  //! Removes all the specified dimensions from the expression.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  virtual void remove_space_dimensions(const Variables_Set& vars) = 0;
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  virtual void shift_space_dimensions(Variable v, dimension_type n) = 0;
-
-  //! Permutes the space dimensions of the expression.
-  /*!
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  virtual void
-  permute_space_dimensions(const std::vector<Variable>& cycle) = 0;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  virtual bool is_zero() const = 0;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  virtual bool all_homogeneous_terms_are_zero() const = 0;
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  virtual memory_size_type total_memory_in_bytes() const = 0;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  virtual memory_size_type external_memory_in_bytes() const = 0;
-
-  //! Writes to \p s an ASCII representation of \p *this.
-  virtual void ascii_dump(std::ostream& s) const = 0;
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  virtual bool ascii_load(std::istream& s) = 0;
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  virtual bool is_equal_to(const Linear_Expression_Interface& x) const = 0;
-
-  //! Normalizes the modulo of the coefficients and of the inhomogeneous term
-  //! so that they are mutually prime.
-  /*!
-    Computes the Greatest Common Divisor (GCD) among the coefficients
-    and the inhomogeneous term and normalizes them by the GCD itself.
-  */
-  virtual void normalize() = 0;
-
-  //! Ensures that the first nonzero homogeneous coefficient is positive,
-  //! by negating the row if necessary.
-  virtual void sign_normalize() = 0;
-
-  /*! \brief
-    Negates the elements from index \p first (included)
-    to index \p last (excluded).
-  */
-  virtual void negate(dimension_type first, dimension_type last) = 0;
-
-  virtual Linear_Expression_Interface&
-  operator+=(Coefficient_traits::const_reference n) = 0;
-  virtual Linear_Expression_Interface&
-  operator-=(Coefficient_traits::const_reference n) = 0;
-
-  //! The basic comparison function.
-  /*! \relates Linear_Expression_Interface
-
-    \returns -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
-            is greater. The absolute value of the result is 1 if the difference
-            is only in the inhomogeneous terms, 2 otherwise
-
-    The order is a lexicographic. It starts comparing the variables'
-    coefficient, starting from Variable(0), and at the end it compares
-    the inhomogeneous terms.
-  */
-  virtual int compare(const Linear_Expression_Interface& y) const = 0;
-
-  virtual Linear_Expression_Interface&
-  operator+=(const Linear_Expression_Interface& e2) = 0;
-  virtual Linear_Expression_Interface&
-  operator+=(const Variable v) = 0;
-  virtual Linear_Expression_Interface&
-  operator-=(const Linear_Expression_Interface& e2) = 0;
-  virtual Linear_Expression_Interface&
-  operator-=(const Variable v) = 0;
-  virtual Linear_Expression_Interface&
-  operator*=(Coefficient_traits::const_reference n) = 0;
-  virtual Linear_Expression_Interface&
-  operator/=(Coefficient_traits::const_reference n) = 0;
-
-  virtual void negate() = 0;
-
-  virtual Linear_Expression_Interface&
-  add_mul_assign(Coefficient_traits::const_reference n, const Variable v) = 0;
-
-  virtual Linear_Expression_Interface&
-  sub_mul_assign(Coefficient_traits::const_reference n, const Variable v) = 0;
-
-  virtual void add_mul_assign(Coefficient_traits::const_reference factor,
-                              const Linear_Expression_Interface& e2) = 0;
-
-  virtual void sub_mul_assign(Coefficient_traits::const_reference factor,
-                              const Linear_Expression_Interface& e2) = 0;
-
-  virtual void print(std::ostream& s) const = 0;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  virtual bool all_zeroes(const Variables_Set& vars) const = 0;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  virtual bool have_a_common_variable(const Linear_Expression_Interface& x,
-                                      Variable first, Variable last) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the i-th coefficient.
-  virtual Coefficient_traits::const_reference get(dimension_type i) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets the i-th coefficient to n.
-  virtual void set(dimension_type i, Coefficient_traits::const_reference n) = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  virtual bool all_zeroes(dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  virtual dimension_type
-  num_zeroes(dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  virtual Coefficient gcd(dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  virtual void exact_div_assign(Coefficient_traits::const_reference c,
-                                dimension_type start, dimension_type end) = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Equivalent to <CODE>(*this)[i] *= n</CODE>, for each i in [start, end).
-  virtual void mul_assign(Coefficient_traits::const_reference n,
-                          dimension_type start, dimension_type end) = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Linearly combines \p *this with \p y so that the coefficient of \p v
-  //! is 0.
-  /*!
-    \param y
-    The expression that will be combined with \p *this object;
-
-    \param i
-    The index of the coefficient that has to become \f$0\f$.
-
-    Computes a linear combination of \p *this and \p y having
-    the i-th coefficient equal to \f$0\f$. Then it assigns
-    the resulting expression to \p *this.
-
-    \p *this and \p y must have the same space dimension.
-  */
-  virtual void
-  linear_combine(const Linear_Expression_Interface& y, dimension_type i) = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end).
-  virtual void linear_combine(const Linear_Expression_Interface& y,
-                              Coefficient_traits::const_reference c1,
-                              Coefficient_traits::const_reference c2,
-                              dimension_type start, dimension_type end) = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end). c1 and c2 may be zero.
-  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
-                                  Coefficient_traits::const_reference c1,
-                                  Coefficient_traits::const_reference c2,
-                                  dimension_type start, dimension_type end) = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  virtual dimension_type last_nonzero() const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  virtual dimension_type
-  last_nonzero(dimension_type first, dimension_type last) const = 0;
-
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  virtual dimension_type
-  first_nonzero(dimension_type first, dimension_type last) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  virtual bool
-  all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
-  virtual void
-  scalar_product_assign(Coefficient& result,
-                        const Linear_Expression_Interface& y,
-                        dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Computes the sign of the sum of (*this)[i]*y[i],
-  //! for each i in [start,end).
-  virtual int
-  scalar_product_sign(const Linear_Expression_Interface& y,
-                      dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  virtual void
-  has_a_free_dimension_helper(std::set<dimension_type>& x) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  virtual bool is_equal_to(const Linear_Expression_Interface& x,
-                           dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  virtual bool is_equal_to(const Linear_Expression_Interface& x,
-                           Coefficient_traits::const_reference c1,
-                           Coefficient_traits::const_reference c2,
-                           dimension_type start, dimension_type end) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets `row' to a copy of the row that implements *this.
-  virtual void get_row(Dense_Row& row) const = 0;
-
-  // NOTE: This method is public, but it's not exposed in Linear_Expression,
-  // so that it can be used internally in the PPL, by friends of
-  // Linear_Expression.
-  //! Sets `row' to a copy of the row that implements *this.
-  virtual void get_row(Sparse_Row& row) const = 0;
-};
-
-#endif // !defined(PPL_Linear_Expression_Interface_defs_hh)
diff --git a/src/Linear_Expression_Interface.types.hh b/src/Linear_Expression_Interface.types.hh
deleted file mode 100644
index b525ae7..0000000
--- a/src/Linear_Expression_Interface.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Linear_Expression_Interface_types_hh
-#define PPL_Linear_Expression_Interface_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Linear_Expression_Interface;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Expression_Interface_types_hh)
diff --git a/src/Linear_Expression_Interface_defs.hh b/src/Linear_Expression_Interface_defs.hh
new file mode 100644
index 0000000..e2d3b8f
--- /dev/null
+++ b/src/Linear_Expression_Interface_defs.hh
@@ -0,0 +1,489 @@
+/* Linear_Expression_Interface class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Expression_Interface_defs_hh
+#define PPL_Linear_Expression_Interface_defs_hh 1
+
+#include "Linear_Expression_Interface_types.hh"
+#include "Coefficient_defs.hh"
+#include "Variable_types.hh"
+#include "Variables_Set_types.hh"
+#include "Dense_Row_types.hh"
+#include "Sparse_Row_types.hh"
+#include <vector>
+#include <set>
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A linear expression.
+/*! \ingroup PPL_CXX_interface
+  An object of a class implementing Linear_Expression_Interface
+  represents a linear expression
+  \f[
+    \sum_{i=0}^{n-1} a_i x_i + b
+  \f]
+  where \f$n\f$ is the dimension of the vector space,
+  each \f$a_i\f$ is the integer coefficient
+  of the \f$i\f$-th variable \f$x_i\f$
+  and \f$b\f$ is the integer for the inhomogeneous term.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Linear_Expression_Interface {
+public:
+  virtual ~Linear_Expression_Interface();
+
+  virtual bool OK() const = 0;
+
+  //! Returns the current representation of this linear expression.
+  virtual Representation representation() const = 0;
+
+  //! An interface for const iterators on the expression (homogeneous)
+  //! coefficients that are nonzero.
+  /*!
+    These iterators are invalidated by operations that modify the expression.
+  */
+  class const_iterator_interface {
+  public:
+    typedef std::bidirectional_iterator_tag iterator_category;
+    typedef const Coefficient value_type;
+    typedef ptrdiff_t difference_type;
+    typedef value_type* pointer;
+    typedef Coefficient_traits::const_reference reference;
+
+    //! Returns a copy of *this.
+    //! This returns a pointer to dynamic-allocated memory. The caller has the
+    //! duty to free the memory when it's not needed anymore.
+    virtual const_iterator_interface* clone() const = 0;
+
+    virtual ~const_iterator_interface();
+
+    //! Navigates to the next nonzero coefficient.
+    //! Note that this method does *not* return a reference, to increase
+    //! efficiency since it's virtual.
+    virtual void operator++() = 0;
+
+    //! Navigates to the previous nonzero coefficient.
+    //! Note that this method does *not* return a reference, to increase
+    //! efficiency since it's virtual.
+    virtual void operator--() = 0;
+
+    //! Returns the current element.
+    virtual reference operator*() const = 0;
+
+    //! Returns the variable of the coefficient pointed to by \c *this.
+    /*!
+      \returns the variable of the coefficient pointed to by \c *this.
+    */
+    virtual Variable variable() const = 0;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    virtual bool operator==(const const_iterator_interface& x) const = 0;
+  };
+
+  //! This returns a pointer to dynamic-allocated memory. The caller has the
+  //! duty to free the memory when it's not needed anymore.
+  virtual const_iterator_interface* begin() const = 0;
+
+  //! This returns a pointer to dynamic-allocated memory. The caller has the
+  //! duty to free the memory when it's not needed anymore.
+  virtual const_iterator_interface* end() const = 0;
+
+  //! This returns a pointer to dynamic-allocated memory. The caller has the
+  //! duty to free the memory when it's not needed anymore.
+  //! Returns (a pointer to) an iterator that points to the first nonzero
+  //! coefficient of a variable greater than or equal to v, or at end if no
+  //! such coefficient exists.
+  virtual const_iterator_interface* lower_bound(Variable v) const = 0;
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  virtual dimension_type space_dimension() const = 0;
+
+  //! Sets the dimension of the vector space enclosing \p *this to \p n .
+  virtual void set_space_dimension(dimension_type n) = 0;
+
+  //! Returns the coefficient of \p v in \p *this.
+  virtual Coefficient_traits::const_reference
+  coefficient(Variable v) const = 0;
+
+  //! Sets the coefficient of \p v in \p *this to \p n.
+  virtual void
+  set_coefficient(Variable v, Coefficient_traits::const_reference n) = 0;
+
+  //! Returns the inhomogeneous term of \p *this.
+  virtual Coefficient_traits::const_reference inhomogeneous_term() const = 0;
+
+  //! Sets the inhomogeneous term of \p *this to \p n.
+  virtual void
+  set_inhomogeneous_term(Coefficient_traits::const_reference n) = 0;
+
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param v
+    The variable whose coefficient has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  virtual void
+  linear_combine(const Linear_Expression_Interface& y, Variable v) = 0;
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
+  //! \p *this and \p y have the same space dimension.
+  virtual void linear_combine(const Linear_Expression_Interface& y,
+                              Coefficient_traits::const_reference c1,
+                              Coefficient_traits::const_reference c2) = 0;
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
+  //! c1 and c2 may be 0.
+  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
+                                  Coefficient_traits::const_reference c1,
+                                  Coefficient_traits::const_reference c2) = 0;
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  virtual void swap_space_dimensions(Variable v1, Variable v2) = 0;
+
+  //! Removes all the specified dimensions from the expression.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  virtual void remove_space_dimensions(const Variables_Set& vars) = 0;
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  virtual void shift_space_dimensions(Variable v, dimension_type n) = 0;
+
+  //! Permutes the space dimensions of the expression.
+  /*!
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  virtual void
+  permute_space_dimensions(const std::vector<Variable>& cycle) = 0;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
+  virtual bool is_zero() const = 0;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are \f$0\f$.
+  */
+  virtual bool all_homogeneous_terms_are_zero() const = 0;
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  virtual memory_size_type total_memory_in_bytes() const = 0;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  virtual memory_size_type external_memory_in_bytes() const = 0;
+
+  //! Writes to \p s an ASCII representation of \p *this.
+  virtual void ascii_dump(std::ostream& s) const = 0;
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  virtual bool ascii_load(std::istream& s) = 0;
+
+  //! Returns \p true if *this is equal to \p x.
+  //! Note that (*this == x) has a completely different meaning.
+  virtual bool is_equal_to(const Linear_Expression_Interface& x) const = 0;
+
+  //! Normalizes the modulo of the coefficients and of the inhomogeneous term
+  //! so that they are mutually prime.
+  /*!
+    Computes the Greatest Common Divisor (GCD) among the coefficients
+    and the inhomogeneous term and normalizes them by the GCD itself.
+  */
+  virtual void normalize() = 0;
+
+  //! Ensures that the first nonzero homogeneous coefficient is positive,
+  //! by negating the row if necessary.
+  virtual void sign_normalize() = 0;
+
+  /*! \brief
+    Negates the elements from index \p first (included)
+    to index \p last (excluded).
+  */
+  virtual void negate(dimension_type first, dimension_type last) = 0;
+
+  virtual Linear_Expression_Interface&
+  operator+=(Coefficient_traits::const_reference n) = 0;
+  virtual Linear_Expression_Interface&
+  operator-=(Coefficient_traits::const_reference n) = 0;
+
+  //! The basic comparison function.
+  /*! \relates Linear_Expression_Interface
+
+    \returns -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
+            is greater. The absolute value of the result is 1 if the difference
+            is only in the inhomogeneous terms, 2 otherwise
+
+    The order is a lexicographic. It starts comparing the variables'
+    coefficient, starting from Variable(0), and at the end it compares
+    the inhomogeneous terms.
+  */
+  virtual int compare(const Linear_Expression_Interface& y) const = 0;
+
+  virtual Linear_Expression_Interface&
+  operator+=(const Linear_Expression_Interface& e2) = 0;
+  virtual Linear_Expression_Interface&
+  operator+=(const Variable v) = 0;
+  virtual Linear_Expression_Interface&
+  operator-=(const Linear_Expression_Interface& e2) = 0;
+  virtual Linear_Expression_Interface&
+  operator-=(const Variable v) = 0;
+  virtual Linear_Expression_Interface&
+  operator*=(Coefficient_traits::const_reference n) = 0;
+  virtual Linear_Expression_Interface&
+  operator/=(Coefficient_traits::const_reference n) = 0;
+
+  virtual void negate() = 0;
+
+  virtual Linear_Expression_Interface&
+  add_mul_assign(Coefficient_traits::const_reference n, const Variable v) = 0;
+
+  virtual Linear_Expression_Interface&
+  sub_mul_assign(Coefficient_traits::const_reference n, const Variable v) = 0;
+
+  virtual void add_mul_assign(Coefficient_traits::const_reference factor,
+                              const Linear_Expression_Interface& e2) = 0;
+
+  virtual void sub_mul_assign(Coefficient_traits::const_reference factor,
+                              const Linear_Expression_Interface& e2) = 0;
+
+  virtual void print(std::ostream& s) const = 0;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars[i] is \f$0\f$.
+  */
+  virtual bool all_zeroes(const Variables_Set& vars) const = 0;
+
+  //! Returns true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both *this and x.
+  virtual bool have_a_common_variable(const Linear_Expression_Interface& x,
+                                      Variable first, Variable last) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the i-th coefficient.
+  virtual Coefficient_traits::const_reference get(dimension_type i) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets the i-th coefficient to n.
+  virtual void set(dimension_type i, Coefficient_traits::const_reference n) = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
+    [start, end).
+  */
+  virtual bool all_zeroes(dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns the number of zero coefficient in [start, end).
+  */
+  virtual dimension_type
+  num_zeroes(dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end). If all the
+    coefficients in this range are 0 returns 0.
+  */
+  virtual Coefficient gcd(dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  virtual void exact_div_assign(Coefficient_traits::const_reference c,
+                                dimension_type start, dimension_type end) = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Equivalent to <CODE>(*this)[i] *= n</CODE>, for each i in [start, end).
+  virtual void mul_assign(Coefficient_traits::const_reference n,
+                          dimension_type start, dimension_type end) = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  virtual void
+  linear_combine(const Linear_Expression_Interface& y, dimension_type i) = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end).
+  virtual void linear_combine(const Linear_Expression_Interface& y,
+                              Coefficient_traits::const_reference c1,
+                              Coefficient_traits::const_reference c2,
+                              dimension_type start, dimension_type end) = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end). c1 and c2 may be zero.
+  virtual void linear_combine_lax(const Linear_Expression_Interface& y,
+                                  Coefficient_traits::const_reference c1,
+                                  Coefficient_traits::const_reference c2,
+                                  dimension_type start, dimension_type end) = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the index of the last nonzero element, or 0 if there are no
+  //! nonzero elements.
+  virtual dimension_type last_nonzero() const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the index of the last nonzero element in [first,last), or last
+  //! if there are no nonzero elements.
+  virtual dimension_type
+  last_nonzero(dimension_type first, dimension_type last) const = 0;
+
+  //! Returns the index of the first nonzero element, or \p last if there are no
+  //! nonzero elements, considering only elements in [first,last).
+  virtual dimension_type
+  first_nonzero(dimension_type first, dimension_type last) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  /*! \brief
+    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
+    \f$0\f$, disregarding coefficients of variables in \p vars.
+  */
+  virtual bool
+  all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
+  virtual void
+  scalar_product_assign(Coefficient& result,
+                        const Linear_Expression_Interface& y,
+                        dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Computes the sign of the sum of (*this)[i]*y[i],
+  //! for each i in [start,end).
+  virtual int
+  scalar_product_sign(const Linear_Expression_Interface& y,
+                      dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Removes from the set x all the indexes of nonzero elements of *this.
+  virtual void
+  has_a_free_dimension_helper(std::set<dimension_type>& x) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
+  virtual bool is_equal_to(const Linear_Expression_Interface& x,
+                           dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
+  //! [start,end).
+  virtual bool is_equal_to(const Linear_Expression_Interface& x,
+                           Coefficient_traits::const_reference c1,
+                           Coefficient_traits::const_reference c2,
+                           dimension_type start, dimension_type end) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets `row' to a copy of the row that implements *this.
+  virtual void get_row(Dense_Row& row) const = 0;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets `row' to a copy of the row that implements *this.
+  virtual void get_row(Sparse_Row& row) const = 0;
+};
+
+#endif // !defined(PPL_Linear_Expression_Interface_defs_hh)
diff --git a/src/Linear_Expression_Interface_types.hh b/src/Linear_Expression_Interface_types.hh
new file mode 100644
index 0000000..0a62b78
--- /dev/null
+++ b/src/Linear_Expression_Interface_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Linear_Expression_Interface_types_hh
+#define PPL_Linear_Expression_Interface_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Linear_Expression_Interface;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Expression_Interface_types_hh)
diff --git a/src/Linear_Expression_defs.hh b/src/Linear_Expression_defs.hh
new file mode 100644
index 0000000..02b43e3
--- /dev/null
+++ b/src/Linear_Expression_defs.hh
@@ -0,0 +1,928 @@
+/* Linear_Expression class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Expression_defs_hh
+#define PPL_Linear_Expression_defs_hh 1
+
+#include "Linear_Expression_types.hh"
+
+#include "Constraint_types.hh"
+#include "Generator_types.hh"
+#include "Congruence_types.hh"
+#include "Grid_Generator_types.hh"
+#include "Linear_System_types.hh"
+#include "Constraint_System_types.hh"
+#include "Congruence_System_types.hh"
+#include "Coefficient_types.hh"
+#include "Polyhedron_types.hh"
+#include "Grid_types.hh"
+#include "PIP_Problem_types.hh"
+#include "BHRZ03_Certificate_types.hh"
+#include "Scalar_Products_types.hh"
+#include "MIP_Problem_types.hh"
+#include "Box_types.hh"
+#include "BD_Shape_types.hh"
+#include "Octagonal_Shape_types.hh"
+#include "termination_types.hh"
+
+#include "Expression_Adapter_defs.hh"
+#include "Expression_Hide_Inhomo_types.hh"
+#include "Expression_Hide_Last_types.hh"
+
+#include "Linear_Expression_Interface_defs.hh"
+#include "Variable_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+// Put them in the namespace here to declare them friend later.
+
+//! Returns the linear expression \p e1 + \p e2.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the linear expression \p v + \p w.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(Variable v, Variable w);
+
+//! Returns the linear expression \p v + \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(Variable v, const Linear_Expression& e);
+
+//! Returns the linear expression \p e + \p v.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(const Linear_Expression& e, Variable v);
+
+//! Returns the linear expression \p n + \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the linear expression \p e + \p n.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the linear expression \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator+(const Linear_Expression& e);
+
+//! Returns the linear expression - \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(const Linear_Expression& e);
+
+//! Returns the linear expression \p e1 - \p e2.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(const Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the linear expression \p v - \p w.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(Variable v, Variable w);
+
+//! Returns the linear expression \p v - \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(Variable v, const Linear_Expression& e);
+
+//! Returns the linear expression \p e - \p v.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(const Linear_Expression& e, Variable v);
+
+//! Returns the linear expression \p n - \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the linear expression \p e - \p n.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator-(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the linear expression \p n * \p e.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator*(Coefficient_traits::const_reference n, const Linear_Expression& e);
+
+//! Returns the linear expression \p e * \p n.
+/*! \relates Linear_Expression */
+Linear_Expression
+operator*(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the linear expression \p e1 + \p e2 and assigns it to \p e1.
+/*! \relates Linear_Expression */
+Linear_Expression&
+operator+=(Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the linear expression \p e + \p v and assigns it to \p e.
+/*! \relates Linear_Expression
+  \exception std::length_error
+  Thrown if the space dimension of \p v exceeds
+  <CODE>Linear_Expression::max_space_dimension()</CODE>.
+ */
+Linear_Expression&
+operator+=(Linear_Expression& e, Variable v);
+
+//! Returns the linear expression \p e + \p n and assigns it to \p e.
+/*! \relates Linear_Expression */
+Linear_Expression&
+operator+=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the linear expression \p e1 - \p e2 and assigns it to \p e1.
+/*! \relates Linear_Expression */
+Linear_Expression&
+operator-=(Linear_Expression& e1, const Linear_Expression& e2);
+
+//! Returns the linear expression \p e - \p v and assigns it to \p e.
+/*! \relates Linear_Expression
+  \exception std::length_error
+  Thrown if the space dimension of \p v exceeds
+  <CODE>Linear_Expression::max_space_dimension()</CODE>.
+ */
+Linear_Expression&
+operator-=(Linear_Expression& e, Variable v);
+
+//! Returns the linear expression \p e - \p n and assigns it to \p e.
+/*! \relates Linear_Expression */
+Linear_Expression&
+operator-=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the linear expression \p n * \p e and assigns it to \p e.
+/*! \relates Linear_Expression */
+Linear_Expression&
+operator*=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Returns the linear expression \p n / \p e and assigns it to \p e.
+/*! \relates Linear_Expression */
+Linear_Expression&
+operator/=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+//! Assigns to \p e its own negation.
+/*! \relates Linear_Expression */
+void
+neg_assign(Linear_Expression& e);
+
+//! Returns the linear expression \p e + \p n * \p v and assigns it to \p e.
+/*! \relates Linear_Expression */
+Linear_Expression&
+add_mul_assign(Linear_Expression& e,
+               Coefficient_traits::const_reference n, Variable v);
+
+//! Sums \p e2 multiplied by \p factor into \p e1.
+/*! \relates Linear_Expression */
+void add_mul_assign(Linear_Expression& e1,
+                    Coefficient_traits::const_reference factor,
+                    const Linear_Expression& e2);
+
+//! Subtracts \p e2 multiplied by \p factor from \p e1.
+/*! \relates Linear_Expression */
+void sub_mul_assign(Linear_Expression& e1,
+                    Coefficient_traits::const_reference factor,
+                    const Linear_Expression& e2);
+
+//! Returns the linear expression \p e - \p n * \p v and assigns it to \p e.
+/*! \relates Linear_Expression */
+Linear_Expression&
+sub_mul_assign(Linear_Expression& e,
+               Coefficient_traits::const_reference n, Variable v);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The basic comparison function.
+/*! \relates Linear_Expression
+
+  \returns -1 or -2 if x is less than y, 0 if they are equal and 1 or 2 is y
+           is greater. The absolute value of the result is 1 if the difference
+           is only in the inhomogeneous terms, 2 otherwise
+
+  The order is a lexicographic. It starts comparing the variables' coefficient,
+  starting from Variable(0), and at the end it compares the inhomogeneous
+  terms.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+int compare(const Linear_Expression& x, const Linear_Expression& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+std::ostream& operator<<(std::ostream& s, const Linear_Expression& e);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+//! A linear expression.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Linear_Expression represents the linear expression
+  \f[
+    \sum_{i=0}^{n-1} a_i x_i + b
+  \f]
+  where \f$n\f$ is the dimension of the vector space,
+  each \f$a_i\f$ is the integer coefficient
+  of the \f$i\f$-th variable \f$x_i\f$
+  and \f$b\f$ is the integer for the inhomogeneous term.
+
+  \par How to build a linear expression.
+
+  Linear expressions are the basic blocks for defining
+  both constraints (i.e., linear equalities or inequalities)
+  and generators (i.e., lines, rays, points and closure points).
+  A full set of functions is defined to provide a convenient interface
+  for building complex linear expressions starting from simpler ones
+  and from objects of the classes Variable and Coefficient:
+  available operators include unary negation,
+  binary addition and subtraction,
+  as well as multiplication by a Coefficient.
+  The space dimension of a linear expression is defined as the maximum
+  space dimension of the arguments used to build it:
+  in particular, the space dimension of a Variable <CODE>x</CODE>
+  is defined as <CODE>x.id()+1</CODE>,
+  whereas all the objects of the class Coefficient have space dimension zero.
+
+  \par Example
+  The following code builds the linear expression \f$4x - 2y - z + 14\f$,
+  having space dimension \f$3\f$:
+  \code
+  Linear_Expression e = 4*x - 2*y - z + 14;
+  \endcode
+  Another way to build the same linear expression is:
+  \code
+  Linear_Expression e1 = 4*x;
+  Linear_Expression e2 = 2*y;
+  Linear_Expression e3 = z;
+  Linear_Expression e = Linear_Expression(14);
+  e += e1 - e2 - e3;
+  \endcode
+  Note that \p e1, \p e2 and \p e3 have space dimension 1, 2 and 3,
+  respectively; also, in the fourth line of code, \p e is created
+  with space dimension zero and then extended to space dimension 3
+  in the fifth line.
+*/
+class Parma_Polyhedra_Library::Linear_Expression {
+public:
+  static const Representation default_representation = SPARSE;
+
+  //! Default constructor: returns a copy of Linear_Expression::zero().
+  explicit Linear_Expression(Representation r = default_representation);
+
+  /*! \brief Ordinary copy constructor.
+    \note
+    The new expression will have the same representation as \p e
+    (not necessarily the default_representation).
+  */
+  Linear_Expression(const Linear_Expression& e);
+
+  //! Copy constructor that takes also a Representation.
+  Linear_Expression(const Linear_Expression& e, Representation r);
+
+  // Queried by expression adapters.
+  typedef const Linear_Expression& const_reference;
+  typedef Linear_Expression raw_type;
+
+  /*! \brief Copy constructor from a linear expression adapter.
+    \note
+    The new expression will have the same representation as \p e
+    (not necessarily the default_representation).
+  */
+  template <typename LE_Adapter>
+  explicit
+  Linear_Expression(const LE_Adapter& e,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
+
+  /*! \brief Copy constructor from a linear expression adapter that takes a
+    Representation.
+  */
+  template <typename LE_Adapter>
+  Linear_Expression(const LE_Adapter& e, Representation r,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
+
+  /*! \brief
+    Copy constructor from a linear expression adapter that takes a
+    space dimension.
+    \note
+    The new expression will have the same representation as \p e
+    (not necessarily default_representation).
+  */
+  template <typename LE_Adapter>
+  explicit
+  Linear_Expression(const LE_Adapter& e, dimension_type space_dim,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
+
+  /*! \brief
+    Copy constructor from a linear expression adapter that takes a
+    space dimension and a Representation.
+  */
+  template <typename LE_Adapter>
+  Linear_Expression(const LE_Adapter& e,
+                    dimension_type space_dim, Representation r,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
+
+  //! Assignment operator.
+  Linear_Expression& operator=(const Linear_Expression& e);
+
+  //! Destructor.
+  ~Linear_Expression();
+
+  /*! \brief
+    Builds the linear expression corresponding
+    to the inhomogeneous term \p n.
+  */
+  explicit Linear_Expression(Coefficient_traits::const_reference n,
+                             Representation r = default_representation);
+
+  //! Builds the linear expression corresponding to the variable \p v.
+  /*!
+    \exception std::length_error
+    Thrown if the space dimension of \p v exceeds
+    <CODE>Linear_Expression::max_space_dimension()</CODE>.
+  */
+  Linear_Expression(Variable v, Representation r = default_representation);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! A const %iterator on the expression (homogeneous) coefficient that are
+  //! nonzero.
+  /*!
+    These iterators are invalidated by operations that modify the expression.
+  */
+  class const_iterator {
+  private:
+  public:
+    typedef std::bidirectional_iterator_tag iterator_category;
+    typedef const Coefficient value_type;
+    typedef ptrdiff_t difference_type;
+    typedef value_type* pointer;
+    typedef Coefficient_traits::const_reference reference;
+
+    //! Constructs an invalid const_iterator.
+    /*!
+      This constructor takes \f$O(1)\f$ time.
+    */
+    explicit const_iterator();
+
+    //! The copy constructor.
+    /*!
+      \param itr
+      The %iterator that will be copied.
+
+      This constructor takes \f$O(1)\f$ time.
+    */
+    const_iterator(const const_iterator& itr);
+
+    ~const_iterator();
+
+    //! Swaps itr with *this.
+    /*!
+      \param itr
+      The %iterator that will be swapped with *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    void m_swap(const_iterator& itr);
+
+    //! Assigns \p itr to *this .
+    /*!
+      \param itr
+      The %iterator that will be assigned into *this.
+
+      This method takes \f$O(1)\f$ time.
+    */
+    const_iterator& operator=(const const_iterator& itr);
+
+    //! Navigates to the next nonzero coefficient.
+    /*!
+      This method takes \f$O(n)\f$ time for dense expressions, and
+      \f$O(1)\f$ time for sparse expressions.
+    */
+    const_iterator& operator++();
+
+    //! Navigates to the previous nonzero coefficient.
+    /*!
+      This method takes \f$O(n)\f$ time for dense expressions, and
+      \f$O(1)\f$ time for sparse expressions.
+    */
+    const_iterator& operator--();
+
+    //! Returns the current element.
+    reference operator*() const;
+
+    //! Returns the variable of the coefficient pointed to by \c *this.
+    /*!
+      \returns the variable of the coefficient pointed to by \c *this.
+    */
+    Variable variable() const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    bool operator==(const const_iterator& x) const;
+
+    //! Compares \p *this with x .
+    /*!
+      \param x
+      The %iterator that will be compared with *this.
+    */
+    bool operator!=(const const_iterator& x) const;
+
+  private:
+    //! Constructor from a const_iterator_interface*.
+    //! The new object takes ownership of the dynamic object.
+    const_iterator(Linear_Expression_Interface::const_iterator_interface* itr);
+
+    Linear_Expression_Interface::const_iterator_interface* itr;
+
+    friend class Linear_Expression;
+  };
+
+  //! Returns an iterator that points to the first nonzero coefficient in the
+  //! expression.
+  const_iterator begin() const;
+
+  //! Returns an iterator that points to the last nonzero coefficient in the
+  //! expression.
+  const_iterator end() const;
+
+  //! Returns an iterator that points to the first nonzero coefficient of a
+  //! variable bigger than or equal to v.
+  const_iterator lower_bound(Variable v) const;
+
+  //! Returns the maximum space dimension a Linear_Expression can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Sets the dimension of the vector space enclosing \p *this to \p n .
+  void set_space_dimension(dimension_type n);
+
+  //! Returns the coefficient of \p v in \p *this.
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Sets the coefficient of \p v in \p *this to \p n.
+  void set_coefficient(Variable v,
+                       Coefficient_traits::const_reference n);
+
+  //! Returns the inhomogeneous term of \p *this.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Sets the inhomogeneous term of \p *this to \p n.
+  void set_inhomogeneous_term(Coefficient_traits::const_reference n);
+
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param v
+    The variable whose coefficient has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the coefficient of variable \p v equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  void linear_combine(const Linear_Expression& y, Variable v);
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>, but assumes that
+  //! c1 and c2 are not 0.
+  void linear_combine(const Linear_Expression& y,
+                      Coefficient_traits::const_reference c1,
+                      Coefficient_traits::const_reference c2);
+
+  //! Equivalent to <CODE>*this = *this * c1 + y * c2</CODE>.
+  //! c1 and c2 may be 0.
+  void linear_combine_lax(const Linear_Expression& y,
+                          Coefficient_traits::const_reference c1,
+                          Coefficient_traits::const_reference c2);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! Removes all the specified dimensions from the expression.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  //! Permutes the space dimensions of the expression.
+  /*!
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
+  bool is_zero() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are \f$0\f$.
+  */
+  bool all_homogeneous_terms_are_zero() const;
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  //! Returns the (zero-dimension space) constant 0.
+  static const Linear_Expression& zero();
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Linear_Expression& y);
+
+  //! Copy constructor with a specified space dimension.
+  Linear_Expression(const Linear_Expression& e, dimension_type space_dim);
+
+  //! Copy constructor with a specified space dimension and representation.
+  Linear_Expression(const Linear_Expression& e, dimension_type space_dim,
+                    Representation r);
+
+  //! Returns \p true if *this is equal to \p x.
+  //! Note that (*this == x) has a completely different meaning.
+  bool is_equal_to(const Linear_Expression& x) const;
+
+  //! Normalizes the modulo of the coefficients and of the inhomogeneous term
+  //! so that they are mutually prime.
+  /*!
+    Computes the Greatest Common Divisor (GCD) among the coefficients
+    and the inhomogeneous term and normalizes them by the GCD itself.
+  */
+  void normalize();
+
+  //! Ensures that the first nonzero homogeneous coefficient is positive,
+  //! by negating the row if necessary.
+  void sign_normalize();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars[i] is \f$0\f$.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+private:
+  /*! \brief
+    Holds (between class initialization and finalization) a pointer to
+    the (zero-dimension space) constant 0.
+  */
+  static const Linear_Expression* zero_p;
+
+  Linear_Expression_Interface* impl;
+
+  //! Implementation sizing constructor.
+  /*!
+    The bool parameter is just to avoid problems with
+    the constructor Linear_Expression(Coefficient_traits::const_reference n).
+  */
+  Linear_Expression(dimension_type space_dim, bool,
+                    Representation r = default_representation);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the i-th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets the i-th coefficient to n.
+  void set(dimension_type i, Coefficient_traits::const_reference n);
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Returns the coefficient of v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  // NOTE: This method is public, but it's not exposed in Linear_Expression,
+  // so that it can be used internally in the PPL, by friends of
+  // Linear_Expression.
+  //! Sets the coefficient of v to n.
+  void set(Variable v, Coefficient_traits::const_reference n);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
+    [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the number of zero coefficient in [start, end).
+  */
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end). If all the
+    coefficients in this range are 0 returns 0.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  void exact_div_assign(Coefficient_traits::const_reference c,
+                        dimension_type start, dimension_type end);
+
+  //! Linearly combines \p *this with \p y so that the coefficient of \p v
+  //! is 0.
+  /*!
+    \param y
+    The expression that will be combined with \p *this object;
+
+    \param i
+    The index of the coefficient that has to become \f$0\f$.
+
+    Computes a linear combination of \p *this and \p y having
+    the i-th coefficient equal to \f$0\f$. Then it assigns
+    the resulting expression to \p *this.
+
+    \p *this and \p y must have the same space dimension.
+  */
+  void linear_combine(const Linear_Expression& y, dimension_type i);
+
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end). It assumes that c1 and c2 are nonzero.
+  void linear_combine(const Linear_Expression& y,
+                      Coefficient_traits::const_reference c1,
+                      Coefficient_traits::const_reference c2,
+                      dimension_type start, dimension_type end);
+
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end). c1 and c2 may be zero.
+  void linear_combine_lax(const Linear_Expression& y,
+                          Coefficient_traits::const_reference c1,
+                          Coefficient_traits::const_reference c2,
+                          dimension_type start, dimension_type end);
+
+  //! Equivalent to <CODE>(*this)[i] *= n</CODE>, for each i in [start, end).
+  void mul_assign(Coefficient_traits::const_reference n,
+                  dimension_type start, dimension_type end);
+
+  //! Returns the index of the last nonzero element, or 0 if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last), or last
+  //! if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there are no
+  //! nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Sets results to the sum of (*this)[i]*y[i], for each i.
+  void scalar_product_assign(Coefficient& result,
+                             const Linear_Expression& y) const;
+
+  //! Sets results to the sum of (*this)[i]*y[i], for each i in [start,end).
+  void scalar_product_assign(Coefficient& result, const Linear_Expression& y,
+                             dimension_type start, dimension_type end) const;
+
+  //! Computes the sign of the sum of (*this)[i]*y[i], for each i.
+  int scalar_product_sign(const Linear_Expression& y) const;
+
+  //! Computes the sign of the sum of (*this)[i]*y[i],
+  //! for each i in [start,end).
+  int scalar_product_sign(const Linear_Expression& y,
+                          dimension_type start, dimension_type end) const;
+
+  //! Removes from the set x all the indexes of nonzero elements of *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
+  bool is_equal_to(const Linear_Expression& x,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
+  //! [start,end).
+  bool is_equal_to(const Linear_Expression& x,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets `row' to a copy of the row that implements *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets `row' to a copy of the row that implements *this.
+  void get_row(Sparse_Row& row) const;
+
+  //! Returns true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both *this and x.
+  bool have_a_common_variable(const Linear_Expression& x,
+                              Variable first, Variable last) const;
+
+  /*! \brief
+    Negates the elements from index \p first (included)
+    to index \p last (excluded).
+  */
+  void negate(dimension_type first, dimension_type last);
+
+  template <typename Row>
+  friend class Linear_Expression_Impl;
+
+  // NOTE: The following classes are friends of Linear_Expression in order
+  // to access its private methods.
+  // Since they are *not* friend of Linear_Expression_Impl, they can only
+  // access its public methods so they cannot break the class invariant of
+  // Linear_Expression_Impl.
+  friend class Grid;
+  friend class Congruence;
+  friend class Polyhedron;
+  friend class PIP_Tree_Node;
+  friend class Grid_Generator;
+  friend class Generator;
+  friend class Constraint;
+  friend class Constraint_System;
+  friend class PIP_Problem;
+  friend class BHRZ03_Certificate;
+  friend class Scalar_Products;
+  friend class MIP_Problem;
+  friend class Box_Helpers;
+  friend class Congruence_System;
+  friend class BD_Shape_Helpers;
+  friend class Octagonal_Shape_Helper;
+  friend class Termination_Helpers;
+  template <typename T>
+  friend class BD_Shape;
+  template <typename T>
+  friend class Octagonal_Shape;
+  template <typename T>
+  friend class Linear_System;
+  template <typename T>
+  friend class Box;
+  template <typename T>
+  friend class Expression_Adapter;
+  template <typename T>
+  friend class Expression_Hide_Inhomo;
+  template <typename T>
+  friend class Expression_Hide_Last;
+
+  friend Linear_Expression
+  operator+(const Linear_Expression& e1, const Linear_Expression& e2);
+  friend Linear_Expression
+  operator+(Coefficient_traits::const_reference n, const Linear_Expression& e);
+  friend Linear_Expression
+  operator+(const Linear_Expression& e, Coefficient_traits::const_reference n);
+  friend Linear_Expression
+  operator+(Variable v, const Linear_Expression& e);
+  friend Linear_Expression
+  operator+(Variable v, Variable w);
+
+  friend Linear_Expression
+  operator-(const Linear_Expression& e);
+
+  friend Linear_Expression
+  operator-(const Linear_Expression& e1, const Linear_Expression& e2);
+  friend Linear_Expression
+  operator-(Variable v, Variable w);
+  friend Linear_Expression
+  operator-(Coefficient_traits::const_reference n, const Linear_Expression& e);
+  friend Linear_Expression
+  operator-(const Linear_Expression& e, Coefficient_traits::const_reference n);
+  friend Linear_Expression
+  operator-(Variable v, const Linear_Expression& e);
+  friend Linear_Expression
+  operator-(const Linear_Expression& e, Variable v);
+
+  friend Linear_Expression
+  operator*(Coefficient_traits::const_reference n, const Linear_Expression& e);
+  friend Linear_Expression
+  operator*(const Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Linear_Expression&
+  operator+=(Linear_Expression& e1, const Linear_Expression& e2);
+  friend Linear_Expression&
+  operator+=(Linear_Expression& e, Variable v);
+  friend Linear_Expression&
+  operator+=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Linear_Expression&
+  operator-=(Linear_Expression& e1, const Linear_Expression& e2);
+  friend Linear_Expression&
+  operator-=(Linear_Expression& e, Variable v);
+  friend Linear_Expression&
+  operator-=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend Linear_Expression&
+  operator*=(Linear_Expression& e, Coefficient_traits::const_reference n);
+  friend Linear_Expression&
+  operator/=(Linear_Expression& e, Coefficient_traits::const_reference n);
+
+  friend void
+  neg_assign(Linear_Expression& e);
+
+  friend Linear_Expression&
+  add_mul_assign(Linear_Expression& e,
+                 Coefficient_traits::const_reference n, Variable v);
+  friend Linear_Expression&
+  sub_mul_assign(Linear_Expression& e,
+                 Coefficient_traits::const_reference n, Variable v);
+
+  friend void
+  add_mul_assign(Linear_Expression& e1,
+                 Coefficient_traits::const_reference factor,
+                 const Linear_Expression& e2);
+  friend void
+  sub_mul_assign(Linear_Expression& e1,
+                 Coefficient_traits::const_reference factor,
+                 const Linear_Expression& e2);
+
+  friend int
+  compare(const Linear_Expression& x, const Linear_Expression& y);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators
+  ::operator<<(std::ostream& s, const Linear_Expression& e);
+};
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Linear_Expression */
+void swap(Linear_Expression& x, Linear_Expression& y);
+
+//! Swaps \p x with \p y.
+/*! \relates Linear_Expression::const_iterator */
+void swap(Linear_Expression::const_iterator& x,
+          Linear_Expression::const_iterator& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Linear_Expression_inlines.hh"
+
+#endif // !defined(PPL_Linear_Expression_defs_hh)
diff --git a/src/Linear_Expression_inlines.hh b/src/Linear_Expression_inlines.hh
new file mode 100644
index 0000000..3641fe0
--- /dev/null
+++ b/src/Linear_Expression_inlines.hh
@@ -0,0 +1,822 @@
+/* Linear_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Expression_inlines_hh
+#define PPL_Linear_Expression_inlines_hh 1
+
+#include "Expression_Adapter_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline Linear_Expression&
+Linear_Expression::operator=(const Linear_Expression& e) {
+  Linear_Expression tmp = e;
+  swap(*this, tmp);
+  return *this;
+}
+
+inline
+Linear_Expression::~Linear_Expression() {
+  delete impl;
+}
+
+inline Representation
+Linear_Expression::representation() const {
+  return impl->representation();
+}
+
+inline dimension_type
+Linear_Expression::space_dimension() const {
+  return impl->space_dimension();
+}
+
+inline void
+Linear_Expression::set_space_dimension(dimension_type n) {
+  impl->set_space_dimension(n);
+}
+
+inline Coefficient_traits::const_reference
+Linear_Expression::coefficient(Variable v) const {
+  return impl->coefficient(v);
+}
+
+inline void
+Linear_Expression
+::set_coefficient(Variable v, Coefficient_traits::const_reference n) {
+  impl->set_coefficient(v, n);
+}
+
+inline Coefficient_traits::const_reference
+Linear_Expression::inhomogeneous_term() const {
+  return impl->inhomogeneous_term();
+}
+
+inline void
+Linear_Expression
+::set_inhomogeneous_term(Coefficient_traits::const_reference n) {
+  impl->set_inhomogeneous_term(n);
+}
+
+inline void
+Linear_Expression::swap_space_dimensions(Variable v1, Variable v2) {
+  impl->swap_space_dimensions(v1, v2);
+}
+
+inline void
+Linear_Expression::shift_space_dimensions(Variable v, dimension_type n) {
+  impl->shift_space_dimensions(v, n);
+}
+
+inline bool
+Linear_Expression::is_zero() const {
+  return impl->is_zero();
+}
+
+inline bool
+Linear_Expression::all_homogeneous_terms_are_zero() const {
+  return impl->all_homogeneous_terms_are_zero();
+}
+
+inline const Linear_Expression&
+Linear_Expression::zero() {
+  PPL_ASSERT(zero_p != 0);
+  return *zero_p;
+}
+
+inline memory_size_type
+Linear_Expression::external_memory_in_bytes() const {
+  return impl->total_memory_in_bytes();
+}
+
+inline memory_size_type
+Linear_Expression::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator+(const Linear_Expression& e) {
+  return e;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator+(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  Linear_Expression x = e;
+  x += n;
+  return x;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator+(const Linear_Expression& e, const Variable v) {
+  Linear_Expression x = e;
+  x += v;
+  return x;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator-(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  Linear_Expression x = e;
+  x -= n;
+  return x;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator-(const Variable v, const Variable w) {
+  const dimension_type v_space_dim = v.space_dimension();
+  const dimension_type w_space_dim = w.space_dimension();
+  const dimension_type space_dim = std::max(v_space_dim, w_space_dim);
+  if (space_dim > Linear_Expression::max_space_dimension())
+    throw std::length_error("Linear_Expression "
+                            "PPL::operator+(v, w):\n"
+                            "v or w exceed the maximum allowed "
+                            "space dimension.");
+  if (v_space_dim >= w_space_dim) {
+    Linear_Expression e(v);
+    e -= w;
+    return e;
+  }
+  else {
+    Linear_Expression e(w.space_dimension(), true);
+    e -= w;
+    e += v;
+    return e;
+  }
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator*(const Linear_Expression& e, Coefficient_traits::const_reference n) {
+  Linear_Expression x = e;
+  x *= n;
+  return x;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression&
+operator+=(Linear_Expression& e, Coefficient_traits::const_reference n) {
+  *e.impl += n;
+  return e;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression&
+operator-=(Linear_Expression& e, Coefficient_traits::const_reference n) {
+  *e.impl -= n;
+  return e;
+}
+
+inline void
+Linear_Expression::m_swap(Linear_Expression& y) {
+  using std::swap;
+  swap(impl, y.impl);
+}
+
+inline void
+Linear_Expression::normalize() {
+  impl->normalize();
+}
+
+inline void
+Linear_Expression::ascii_dump(std::ostream& s) const {
+  impl->ascii_dump(s);
+}
+
+inline bool
+Linear_Expression::ascii_load(std::istream& s) {
+  return impl->ascii_load(s);
+}
+
+inline void
+Linear_Expression::remove_space_dimensions(const Variables_Set& vars) {
+  impl->remove_space_dimensions(vars);
+}
+
+inline void
+Linear_Expression::permute_space_dimensions(const std::vector<Variable>& cycle) {
+  impl->permute_space_dimensions(cycle);
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator+(const Linear_Expression& e1, const Linear_Expression& e2) {
+  if (e1.space_dimension() >= e2.space_dimension()) {
+    Linear_Expression e = e1;
+    e += e2;
+    return e;
+  }
+  else {
+    Linear_Expression e = e2;
+    e += e1;
+    return e;
+  }
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator+(const Variable v, const Linear_Expression& e) {
+  return e + v;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator+(Coefficient_traits::const_reference n,
+               const Linear_Expression& e) {
+  return e + n;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator+(const Variable v, const Variable w) {
+  const dimension_type v_space_dim = v.space_dimension();
+  const dimension_type w_space_dim = w.space_dimension();
+  const dimension_type space_dim = std::max(v_space_dim, w_space_dim);
+  if (space_dim > Linear_Expression::max_space_dimension())
+    throw std::length_error("Linear_Expression "
+                            "PPL::operator+(v, w):\n"
+                            "v or w exceed the maximum allowed "
+                            "space dimension.");
+  if (v_space_dim >= w_space_dim) {
+    Linear_Expression e(v);
+    e += w;
+    return e;
+  }
+  else {
+    Linear_Expression e(w);
+    e += v;
+    return e;
+  }
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator-(const Linear_Expression& e) {
+  Linear_Expression r(e);
+  neg_assign(r);
+  return r;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator-(const Linear_Expression& e1, const Linear_Expression& e2) {
+  if (e1.space_dimension() >= e2.space_dimension()) {
+    Linear_Expression e = e1;
+    e -= e2;
+    return e;
+  }
+  else {
+    Linear_Expression e = e2;
+    neg_assign(e);
+    e += e1;
+    return e;
+  }
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator-(const Variable v, const Linear_Expression& e) {
+  Linear_Expression result(e, std::max(v.space_dimension(), e.space_dimension()));
+  result.negate(0, e.space_dimension() + 1);
+  result += v;
+  return result;
+}
+
+/*! \relates Linear_Expression */
+inline Linear_Expression
+operator-(const Linear_Expression& e, const Variable v) {
+  Linear_Expression result(e, std::max(v.space_dimension(), e.space_dimension()));
+  result -= v;
+  return result;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator-(Coefficient_traits::const_reference n,
+               const Linear_Expression& e) {
+  Linear_Expression result(e);
+  neg_assign(result);
+  result += n;
+  return result;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression
+operator*(Coefficient_traits::const_reference n,
+               const Linear_Expression& e) {
+  return e * n;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+operator+=(Linear_Expression& e1, const Linear_Expression& e2) {
+  *e1.impl += *e2.impl;
+  return e1;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+operator+=(Linear_Expression& e, const Variable v) {
+  *e.impl += v;
+  return e;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+operator-=(Linear_Expression& e1, const Linear_Expression& e2) {
+  *e1.impl -= *e2.impl;
+  return e1;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+operator-=(Linear_Expression& e, const Variable v) {
+  *e.impl -= v;
+  return e;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+operator*=(Linear_Expression& e, Coefficient_traits::const_reference n) {
+  *e.impl *= n;
+  return e;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+operator/=(Linear_Expression& e, Coefficient_traits::const_reference n) {
+  *e.impl /= n;
+  return e;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline void
+neg_assign(Linear_Expression& e) {
+  e.impl->negate();
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+add_mul_assign(Linear_Expression& e,
+               Coefficient_traits::const_reference n,
+               const Variable v) {
+  e.impl->add_mul_assign(n, v);
+  return e;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline Linear_Expression&
+sub_mul_assign(Linear_Expression& e,
+                    Coefficient_traits::const_reference n,
+                    const Variable v) {
+  e.impl->sub_mul_assign(n, v);
+  return e;
+}
+
+inline void
+add_mul_assign(Linear_Expression& e1,
+               Coefficient_traits::const_reference factor,
+               const Linear_Expression& e2) {
+  e1.impl->add_mul_assign(factor, *e2.impl);
+}
+
+inline void
+sub_mul_assign(Linear_Expression& e1,
+                    Coefficient_traits::const_reference factor,
+                    const Linear_Expression& e2) {
+  e1.impl->sub_mul_assign(factor, *e2.impl);
+}
+
+inline Coefficient_traits::const_reference
+Linear_Expression::get(dimension_type i) const {
+  return impl->get(i);
+}
+
+inline void
+Linear_Expression::set(dimension_type i,
+                       Coefficient_traits::const_reference n) {
+  impl->set(i, n);
+}
+
+inline Coefficient_traits::const_reference
+Linear_Expression::get(Variable v) const {
+  return impl->get(v.space_dimension());
+}
+
+inline void
+Linear_Expression::set(Variable v,
+                       Coefficient_traits::const_reference n) {
+  impl->set(v.space_dimension(), n);
+}
+
+inline bool
+Linear_Expression::all_zeroes(dimension_type start, dimension_type end) const {
+  return impl->all_zeroes(start, end);
+}
+
+inline dimension_type
+Linear_Expression::num_zeroes(dimension_type start, dimension_type end) const {
+  return impl->num_zeroes(start, end);
+}
+
+inline Coefficient
+Linear_Expression::gcd(dimension_type start, dimension_type end) const {
+  return impl->gcd(start, end);
+}
+
+inline void
+Linear_Expression
+::exact_div_assign(Coefficient_traits::const_reference c,
+                   dimension_type start, dimension_type end) {
+  impl->exact_div_assign(c, start, end);
+}
+
+inline void
+Linear_Expression
+::mul_assign(Coefficient_traits::const_reference c,
+             dimension_type start, dimension_type end) {
+  impl->mul_assign(c, start, end);
+}
+
+inline void
+Linear_Expression::sign_normalize() {
+  impl->sign_normalize();
+}
+
+inline void
+Linear_Expression::negate(dimension_type first, dimension_type last) {
+  impl->negate(first, last);
+}
+
+inline bool
+Linear_Expression::all_zeroes(const Variables_Set& vars) const {
+  return impl->all_zeroes(vars);
+}
+
+inline bool
+Linear_Expression::all_zeroes_except(const Variables_Set& vars,
+                                     dimension_type start,
+                                     dimension_type end) const {
+  return impl->all_zeroes_except(vars, start, end);
+}
+
+inline dimension_type
+Linear_Expression::last_nonzero() const {
+  return impl->last_nonzero();
+}
+
+inline void
+Linear_Expression
+::scalar_product_assign(Coefficient& result, const Linear_Expression& y) const {
+  scalar_product_assign(result, y, 0, space_dimension() + 1);
+}
+
+inline void
+Linear_Expression
+::scalar_product_assign(Coefficient& result, const Linear_Expression& y,
+                        dimension_type start, dimension_type end) const {
+  impl->scalar_product_assign(result, *(y.impl), start, end);
+}
+
+inline int
+Linear_Expression
+::scalar_product_sign(const Linear_Expression& y) const {
+  return scalar_product_sign(y, 0, space_dimension() + 1);
+}
+
+inline int
+Linear_Expression
+::scalar_product_sign(const Linear_Expression& y,
+                      dimension_type start, dimension_type end) const {
+  return impl->scalar_product_sign(*(y.impl), start, end);
+}
+
+inline dimension_type
+Linear_Expression
+::first_nonzero(dimension_type first, dimension_type last) const {
+  return impl->first_nonzero(first, last);
+}
+
+inline dimension_type
+Linear_Expression
+::last_nonzero(dimension_type first, dimension_type last) const {
+  return impl->last_nonzero(first, last);
+}
+
+inline void
+Linear_Expression
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
+  return impl->has_a_free_dimension_helper(x);
+}
+
+inline bool
+Linear_Expression
+::is_equal_to(const Linear_Expression& x,
+              dimension_type start, dimension_type end) const {
+  return impl->is_equal_to(*(x.impl), start, end);
+}
+
+inline bool
+Linear_Expression
+::is_equal_to(const Linear_Expression& x,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  return impl->is_equal_to(*(x.impl), c1, c2, start, end);
+}
+
+inline void
+Linear_Expression
+::get_row(Dense_Row& row) const {
+  return impl->get_row(row);
+}
+
+inline void
+Linear_Expression
+::get_row(Sparse_Row& row) const {
+  return impl->get_row(row);
+}
+
+inline void
+Linear_Expression
+::linear_combine(const Linear_Expression& y, dimension_type i) {
+  impl->linear_combine(*y.impl, i);
+}
+
+inline void
+Linear_Expression
+::linear_combine(const Linear_Expression& y,
+                 Coefficient_traits::const_reference c1,
+                 Coefficient_traits::const_reference c2) {
+  impl->linear_combine(*y.impl, c1, c2);
+}
+
+inline void
+Linear_Expression
+::linear_combine_lax(const Linear_Expression& y,
+                     Coefficient_traits::const_reference c1,
+                     Coefficient_traits::const_reference c2) {
+  impl->linear_combine_lax(*y.impl, c1, c2);
+}
+
+inline int
+compare(const Linear_Expression& x, const Linear_Expression& y) {
+  return x.impl->compare(*y.impl);
+}
+
+inline bool
+Linear_Expression::is_equal_to(const Linear_Expression& x) const {
+  return impl->is_equal_to(*x.impl);
+}
+
+inline void
+Linear_Expression::linear_combine(const Linear_Expression& y,
+                                  Coefficient_traits::const_reference c1,
+                                  Coefficient_traits::const_reference c2,
+                                  dimension_type start,
+                                  dimension_type end) {
+  impl->linear_combine(*y.impl, c1, c2, start, end);
+}
+
+inline void
+Linear_Expression::linear_combine_lax(const Linear_Expression& y,
+                                      Coefficient_traits::const_reference c1,
+                                      Coefficient_traits::const_reference c2,
+                                      dimension_type start,
+                                      dimension_type end) {
+  impl->linear_combine_lax(*y.impl, c1, c2, start, end);
+}
+
+inline bool
+Linear_Expression
+::have_a_common_variable(const Linear_Expression& x,
+                         Variable first, Variable last) const {
+  return impl->have_a_common_variable(*(x.impl), first, last);
+}
+
+inline
+Linear_Expression::const_iterator
+::const_iterator()
+  : itr(NULL) {
+}
+
+inline
+Linear_Expression::const_iterator
+::const_iterator(const const_iterator& x)
+  : itr(x.itr->clone()) {
+}
+
+inline
+Linear_Expression::const_iterator
+::~const_iterator() {
+  // Note that this does nothing if itr==NULL.
+  delete itr;
+}
+
+inline void
+Linear_Expression::const_iterator::m_swap(const_iterator& x) {
+  using std::swap;
+  swap(itr, x.itr);
+}
+
+inline Linear_Expression::const_iterator&
+Linear_Expression::const_iterator
+::operator=(const const_iterator& itr) {
+  const_iterator tmp = itr;
+  using std::swap;
+  swap(*this, tmp);
+  return *this;
+}
+
+inline Linear_Expression::const_iterator&
+Linear_Expression::const_iterator
+::operator++() {
+  PPL_ASSERT(itr != NULL);
+  ++(*itr);
+  return *this;
+}
+
+inline Linear_Expression::const_iterator&
+Linear_Expression::const_iterator
+::operator--() {
+  PPL_ASSERT(itr != NULL);
+  --(*itr);
+  return *this;
+}
+
+inline Linear_Expression::const_iterator::reference
+Linear_Expression::const_iterator
+::operator*() const {
+  PPL_ASSERT(itr != NULL);
+  return *(*itr);
+}
+
+inline Variable
+Linear_Expression::const_iterator
+::variable() const {
+  PPL_ASSERT(itr != NULL);
+  return itr->variable();
+}
+
+inline bool
+Linear_Expression::const_iterator
+::operator==(const const_iterator& x) const {
+  PPL_ASSERT(itr != NULL);
+  PPL_ASSERT(x.itr != NULL);
+  return *itr == *(x.itr);
+}
+
+inline bool
+Linear_Expression::const_iterator
+::operator!=(const const_iterator& x) const {
+  return !(*this == x);
+}
+
+inline
+Linear_Expression::const_iterator
+::const_iterator(Linear_Expression_Interface::const_iterator_interface* itr)
+  : itr(itr) {
+  PPL_ASSERT(itr != NULL);
+}
+
+inline Linear_Expression::const_iterator
+Linear_Expression
+::begin() const {
+  return const_iterator(impl->begin());
+}
+
+inline Linear_Expression::const_iterator
+Linear_Expression
+::end() const {
+  return const_iterator(impl->end());
+}
+
+inline Linear_Expression::const_iterator
+Linear_Expression
+::lower_bound(Variable v) const {
+  return const_iterator(impl->lower_bound(v));
+}
+
+template <typename LE_Adapter>
+inline
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
+  : impl(NULL) {
+  Linear_Expression tmp(e.representation());
+  tmp.set_space_dimension(e.space_dimension());
+  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
+  for (typename LE_Adapter::const_iterator i = e.begin(),
+         i_end = e.end(); i != i_end; ++i)
+    add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
+  swap(impl, tmp.impl);
+}
+
+template <typename LE_Adapter>
+inline
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     Representation r,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
+  : impl(NULL) {
+  Linear_Expression tmp(r);
+  tmp.set_space_dimension(e.space_dimension());
+  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
+  for (typename LE_Adapter::const_iterator i = e.begin(),
+         i_end = e.end(); i != i_end; ++i)
+    add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
+  swap(impl, tmp.impl);
+}
+
+template <typename LE_Adapter>
+inline
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     dimension_type space_dim,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
+  : impl(NULL) {
+  Linear_Expression tmp(e.representation());
+  tmp.set_space_dimension(space_dim);
+  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
+  typedef typename LE_Adapter::const_iterator itr_t;
+  itr_t i_end;
+  if (space_dim <= e.space_dimension())
+    i_end = e.lower_bound(Variable(space_dim));
+  else
+    i_end = e.end();
+  for (itr_t i = e.begin(); i != i_end; ++i)
+    add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
+  swap(impl, tmp.impl);
+}
+
+template <typename LE_Adapter>
+inline
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     dimension_type space_dim,
+                                     Representation r,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
+  : impl(NULL) {
+  Linear_Expression tmp(r);
+  tmp.set_space_dimension(space_dim);
+  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
+  typedef typename LE_Adapter::const_iterator itr_t;
+  itr_t i_end;
+  if (space_dim <= e.space_dimension())
+    i_end = e.lower_bound(Variable(space_dim));
+  else
+    i_end = e.end();
+  for (itr_t i = e.begin(); i != i_end; ++i)
+    add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
+  swap(impl, tmp.impl);
+}
+
+namespace IO_Operators {
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline std::ostream&
+operator<<(std::ostream& s, const Linear_Expression& e) {
+  e.impl->print(s);
+  return s;
+}
+
+} // namespace IO_Operators
+
+/*! \relates Parma_Polyhedra_Library::Linear_Expression */
+inline void
+swap(Linear_Expression& x, Linear_Expression& y) {
+  x.m_swap(y);
+}
+
+/*! \relates Linear_Expression::const_iterator */
+inline void
+swap(Linear_Expression::const_iterator& x,
+     Linear_Expression::const_iterator& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Expression_inlines_hh)
diff --git a/src/Linear_Expression_types.hh b/src/Linear_Expression_types.hh
new file mode 100644
index 0000000..b2f216a
--- /dev/null
+++ b/src/Linear_Expression_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Linear_Expression_types_hh
+#define PPL_Linear_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Linear_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Expression_types_hh)
diff --git a/src/Linear_Form.cc b/src/Linear_Form.cc
index 68ce855..8ed57e6 100644
--- a/src/Linear_Form.cc
+++ b/src/Linear_Form.cc
@@ -1,6 +1,6 @@
 /* Linear_Form class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,4 +23,4 @@ site: http://bugseng.com/products/ppl/ . */
 
 
 #include "ppl-config.h"
-#include "Linear_Form.defs.hh"
+#include "Linear_Form_defs.hh"
diff --git a/src/Linear_Form.defs.hh b/src/Linear_Form.defs.hh
deleted file mode 100644
index ec64ef7..0000000
--- a/src/Linear_Form.defs.hh
+++ /dev/null
@@ -1,499 +0,0 @@
-/* Linear_Form class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Form_defs_hh
-#define PPL_Linear_Form_defs_hh 1
-
-#include "Linear_Form.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Variable.defs.hh"
-#include "Box.types.hh"
-#include "Float.defs.hh"
-#include <vector>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Linear_Form */
-template <typename C>
-void swap(Linear_Form<C>& x, Linear_Form<C>& y);
-
-// Put them in the namespace here to declare them friend later.
-
-//! Returns the linear form \p f1 + \p f2.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
-
-//! Returns the linear form \p v + \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(Variable v, const Linear_Form<C>& f);
-
-//! Returns the linear form \p f + \p v.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const Linear_Form<C>& f, Variable v);
-
-//! Returns the linear form \p n + \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const C& n, const Linear_Form<C>& f);
-
-//! Returns the linear form \p f + \p n.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const Linear_Form<C>& f, const C& n);
-
-//! Returns the linear form \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const Linear_Form<C>& f);
-
-//! Returns the linear form - \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f);
-
-//! Returns the linear form \p f1 - \p f2.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
-
-//! Returns the linear form \p v - \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(Variable v, const Linear_Form<C>& f);
-
-//! Returns the linear form \p f - \p v.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f, Variable v);
-
-//! Returns the linear form \p n - \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const C& n, const Linear_Form<C>& f);
-
-//! Returns the linear form \p f - \p n.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f, const C& n);
-
-//! Returns the linear form \p n * \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator*(const C& n, const Linear_Form<C>& f);
-
-//! Returns the linear form \p f * \p n.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator*(const Linear_Form<C>& f, const C& n);
-
-//! Returns the linear form \p f1 + \p f2 and assigns it to \p e1.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator+=(Linear_Form<C>& f1, const Linear_Form<C>& f2);
-
-//! Returns the linear form \p f + \p v and assigns it to \p f.
-/*! \relates Linear_Form
-  \exception std::length_error
-  Thrown if the space dimension of \p v exceeds
-  <CODE>Linear_Form::max_space_dimension()</CODE>.
- */
-template <typename C>
-Linear_Form<C>&
-operator+=(Linear_Form<C>& f, Variable v);
-
-//! Returns the linear form \p f + \p n and assigns it to \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator+=(Linear_Form<C>& f, const C& n);
-
-//! Returns the linear form \p f1 - \p f2 and assigns it to \p f1.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator-=(Linear_Form<C>& f1, const Linear_Form<C>& f2);
-
-//! Returns the linear form \p f - \p v and assigns it to \p f.
-/*! \relates Linear_Form
-  \exception std::length_error
-  Thrown if the space dimension of \p v exceeds
-  <CODE>Linear_Form::max_space_dimension()</CODE>.
- */
-template <typename C>
-Linear_Form<C>&
-operator-=(Linear_Form<C>& f, Variable v);
-
-//! Returns the linear form \p f - \p n and assigns it to \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator-=(Linear_Form<C>& f, const C& n);
-
-//! Returns the linear form \p n * \p f and assigns it to \p f.
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator*=(Linear_Form<C>& f, const C& n);
-
-//! Returns the linear form \p f / \p n and assigns it to \p f.
-/*!
-   \relates Linear_Form
-   Performs the division of a linear form by a scalar. It is up to the user to
-   ensure that division by 0 is not performed.
-*/
-template <typename C>
-Linear_Form<C>&
-operator/=(Linear_Form<C>& f, const C& n);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-/*! \relates Linear_Form */
-template <typename C>
-bool
-operator==(const Linear_Form<C>& x, const Linear_Form<C>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Linear_Form */
-template <typename C>
-bool
-operator!=(const Linear_Form<C>& x, const Linear_Form<C>& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Linear_Form */
-template <typename C>
-std::ostream& operator<<(std::ostream& s, const Linear_Form<C>& f);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-//! A linear form with interval coefficients.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Linear_Form represents the interval linear form
-  \f[
-    \sum_{i=0}^{n-1} a_i x_i + b
-  \f]
-  where \f$n\f$ is the dimension of the vector space,
-  each \f$a_i\f$ is the coefficient
-  of the \f$i\f$-th variable \f$x_i\f$
-  and \f$b\f$ is the inhomogeneous term.
-  The coefficients and the inhomogeneous term of the linear form
-  have the template parameter \p C as their type. \p C must be the
-  type of an Interval.
-
-  \par How to build a linear form.
-  A full set of functions is defined in order to provide a convenient
-  interface for building complex linear forms starting from simpler ones
-  and from objects of the classes Variable and \p C. Available operators
-  include binary addition and subtraction, as well as multiplication and
-  division by a coefficient.
-  The space dimension of a linear form is defined as
-  the highest variable dimension among variables that have a nonzero
-  coefficient in the linear form, or zero if no such variable exists.
-  The space dimension for each variable \f$x_i\f$ is given by \f$i + 1\f$.
-
-  \par Example
-  Given the type \p T of an Interval with floating point coefficients (though
-  any integral type may also be used), the following code builds the interval
-  linear form \f$lf = x_5 - x_2 + 1\f$ with space dimension 6:
-  \code
-  Variable x5(5);
-  Variable x2(2);
-  T x5_coefficient;
-  x5_coefficient.lower() = 2.0;
-  x5_coefficient.upper() = 3.0;
-  T inhomogeneous_term;
-  inhomogeneous_term.lower() = 4.0;
-  inhomogeneous_term.upper() = 8.0;
-  Linear_Form<T> lf(x2);
-  lf = -lf;
-  lf += Linear_Form<T>(x2);
-  Linear_Form<T> lf_x5(x5);
-  lf_x5 *= x5_coefficient;
-  lf += lf_x5;
-  \endcode
-  Note that \c lf_x5 is created with space dimension 6, while \c lf is
-  created with space dimension 0 and then extended first to space
-  dimension 2 when \c x2 is subtracted and finally to space dimension
-  6 when \c lf_x5 is added.
-*/
-template <typename C>
-class Parma_Polyhedra_Library::Linear_Form {
-public:
-  //! Default constructor: returns a copy of Linear_Form::zero().
-  Linear_Form();
-
-  //! Ordinary copy constructor.
-  Linear_Form(const Linear_Form& f);
-
-  //! Destructor.
-  ~Linear_Form();
-
-  //! Builds the linear form corresponding to the inhomogeneous term \p n.
-  explicit Linear_Form(const C& n);
-
-  //! Builds the linear form corresponding to the variable \p v.
-  /*!
-    \exception std::length_error
-    Thrown if the space dimension of \p v exceeds
-    <CODE>Linear_Form::max_space_dimension()</CODE>.
-  */
-  Linear_Form(Variable v);
-
-  //! Builds a linear form approximating the linear expression \p e.
-  Linear_Form(const Linear_Expression& e);
-
-  //! Returns the maximum space dimension a Linear_Form can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  const C& coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  const C& inhomogeneous_term() const;
-
-  //! Negates all the coefficients of \p *this.
-  void negate();
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Linear_Form& y);
-
-  // Floating point analysis related methods.
-
-  /*! \brief
-    Verifies if the linear form overflows.
-
-    \return
-    Returns <CODE>false</CODE> if all coefficients in \p lf are bounded,
-    <CODE>true</CODE> otherwise.
-
-    \p T must be the type of possibly unbounded quantities.
-  */
-  bool overflows() const;
-
-  /*! \brief
-    Computes the relative error associated to floating point computations
-    that operate on a quantity that is overapproximated by \p *this.
-
-    \param analyzed_format The floating point format used by the analyzed
-    program.
-    \param result Becomes the linear form corresponding to the relative
-    error committed.
-
-    This method makes <CODE>result</CODE> become a linear form
-    obtained by evaluating the function \f$\varepsilon_{\mathbf{f}}(l)\f$
-    on the linear form. This function is defined as:
-    \f[
-    \varepsilon_{\mathbf{f}}\left([a, b]+\sum_{v \in \cV}[a_{v}, b_{v}]v\right)
-    \defeq
-    (\textrm{max}(|a|, |b|) \amifp [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])
-    +
-    \sum_{v \in \cV}(\textrm{max}(|a_{v}|,|b_{v}|)
-    \amifp
-    [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])v
-    \f]
-    where p is the fraction size in bits for the format \f$\mathbf{f}\f$ and
-    \f$\beta\f$ the base.
-
-    The result is undefined if \p T is not the type of an interval with
-    floating point boundaries.
-  */
-  void relative_error(Floating_Point_Format analyzed_format,
-                      Linear_Form& result) const;
-
-  /*! \brief
-    Makes \p result become an interval that overapproximates all the
-    possible values of \p *this.
-
-    \param oracle The FP_Oracle to be queried.
-    \param result The linear form that will store the result.
-
-    \return <CODE>true</CODE> if the operation was successful,
-    <CODE>false</CODE> otherwise (the possibility of failure
-    depends on the oracle's implementation).
-
-    \par Template type parameters
-
-    - The class template parameter \p Target specifies the implementation
-    of Concrete_Expression to be used.
-
-    This method makes <CODE>result</CODE> become
-    \f$\iota(lf)\rho^{\#}\f$, that is an interval defined as:
-    \f[
-    \iota\left(i + \sum_{v \in \cV}i_{v}v\right)\rho^{\#}
-    \defeq
-    i \asifp \left(\bigoplus_{v \in \cV}{}^{\#}i_{v} \amifp
-    \rho^{\#}(v)\right)
-    \f]
-    where \f$\rho^{\#}(v)\f$ is an interval (provided by the oracle)
-    that correctly approximates the value of \f$v\f$.
-
-    The result is undefined if \p C is not the type of an interval with
-    floating point boundaries.
-  */
-  template <typename Target>
-  bool intervalize(const FP_Oracle<Target,C>& oracle, C& result) const;
-
-private:
-  //! The generic coefficient equal to the singleton zero.
-  static C zero;
-
-  //! Type of the container vector.
-  typedef std::vector<C> vec_type;
-
-  //! The container vector.
-  vec_type vec;
-
-  //! Implementation sizing constructor.
-  /*!
-    The bool parameter is just to avoid problems with
-    the constructor Linear_Form(const C& n).
-  */
-  Linear_Form(dimension_type sz, bool);
-
-  /*! \brief
-    Builds the linear form corresponding to the difference of
-    \p v and \p w.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p v or the one of \p w exceed
-    <CODE>Linear_Form::max_space_dimension()</CODE>.
-  */
-  Linear_Form(Variable v, Variable w);
-
-  //! Gives the number of generic coefficients currently in use.
-  dimension_type size() const;
-
-  //! Extends the vector of \p *this to size \p sz.
-  void extend(dimension_type sz);
-
-  //! Returns a reference to \p vec[i].
-  C& operator[](dimension_type i);
-
-  //! Returns a const reference to \p vec[i].
-  const C& operator[](dimension_type i) const;
-
-  friend Linear_Form<C>
-  operator+<C>(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
-  friend Linear_Form<C>
-  operator+<C>(const C& n, const Linear_Form<C>& f);
-  friend Linear_Form<C>
-  operator+<C>(const Linear_Form<C>& f, const C& n);
-  friend Linear_Form<C>
-  operator+<C>(Variable v, const Linear_Form<C>& f);
-
-  friend Linear_Form<C>
-  operator-<C>(const Linear_Form<C>& f);
-
-  friend Linear_Form<C>
-  operator-<C>(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
-  friend Linear_Form<C>
-  operator-<C>(const C& n, const Linear_Form<C>& f);
-  friend Linear_Form<C>
-  operator-<C>(const Linear_Form<C>& f, const C& n);
-  friend Linear_Form<C>
-  operator-<C>(Variable v, const Linear_Form<C>& f);
-  friend Linear_Form<C>
-  operator-<C>(const Linear_Form<C>& f, Variable v);
-
-  friend Linear_Form<C>
-  operator*<C>(const C& n, const Linear_Form<C>& f);
-  friend Linear_Form<C>
-  operator*<C>(const Linear_Form<C>& f, const C& n);
-
-  friend Linear_Form<C>&
-  operator+=<C>(Linear_Form<C>& f1, const Linear_Form<C>& f2);
-  friend Linear_Form<C>&
-  operator+=<C>(Linear_Form<C>& f, Variable v);
-  friend Linear_Form<C>&
-  operator+=<C>(Linear_Form<C>& f, const C& n);
-
-  friend Linear_Form<C>&
-  operator-=<C>(Linear_Form<C>& f1, const Linear_Form<C>& f2);
-  friend Linear_Form<C>&
-  operator-=<C>(Linear_Form<C>& f, Variable v);
-  friend Linear_Form<C>&
-  operator-=<C>(Linear_Form<C>& f, const C& n);
-
-  friend Linear_Form<C>&
-  operator*=<C>(Linear_Form<C>& f, const C& n);
-
-  friend Linear_Form<C>&
-  operator/=<C>(Linear_Form<C>& f, const C& n);
-
-  friend bool
-  operator==<C>(const Linear_Form<C>& x, const Linear_Form<C>& y);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators
-  ::operator<<<C>(std::ostream& s, const Linear_Form<C>& f);
-};
-
-#include "Linear_Form.inlines.hh"
-// Linear_Form.templates.hh is not included here on purpose.
-
-#endif // !defined(PPL_Linear_Form_defs_hh)
diff --git a/src/Linear_Form.inlines.hh b/src/Linear_Form.inlines.hh
deleted file mode 100644
index de26a74..0000000
--- a/src/Linear_Form.inlines.hh
+++ /dev/null
@@ -1,252 +0,0 @@
-/* Linear_Form class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Form_inlines_hh
-#define PPL_Linear_Form_inlines_hh 1
-
-#include "Variable.defs.hh"
-#include <iostream>
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename C>
-inline dimension_type
-Linear_Form<C>::max_space_dimension() {
-  return vec_type().max_size() - 1;
-}
-
-template <typename C>
-inline
-Linear_Form<C>::Linear_Form()
-  : vec(1, zero) {
-  vec.reserve(compute_capacity(1, vec_type().max_size()));
-}
-
-template <typename C>
-inline
-Linear_Form<C>::Linear_Form(dimension_type sz, bool)
-  : vec(sz, zero) {
-  vec.reserve(compute_capacity(sz, vec_type().max_size()));
-}
-
-template <typename C>
-inline
-Linear_Form<C>::Linear_Form(const Linear_Form& f)
-  : vec(f.vec) {
-}
-
-template <typename C>
-inline
-Linear_Form<C>::~Linear_Form() {
-}
-
-template <typename C>
-inline dimension_type
-Linear_Form<C>::size() const {
-  return vec.size();
-}
-
-template <typename C>
-inline void
-Linear_Form<C>::extend(dimension_type sz) {
-  assert(sz > size());
-  vec.reserve(compute_capacity(sz, vec_type().max_size()));
-  vec.resize(sz, zero);
-}
-
-template <typename C>
-inline
-Linear_Form<C>::Linear_Form(const C& n)
-  : vec(1, n) {
-  vec.reserve(compute_capacity(1, vec_type().max_size()));
-}
-
-template <typename C>
-inline dimension_type
-Linear_Form<C>::space_dimension() const {
-  return size() - 1;
-}
-
-template <typename C>
-inline const C&
-Linear_Form<C>::coefficient(Variable v) const {
-  if (v.space_dimension() > space_dimension())
-    return zero;
-  return vec[v.id()+1];
-}
-
-template <typename C>
-inline C&
-Linear_Form<C>::operator[](dimension_type i) {
-  assert(i < size());
-  return vec[i];
-}
-
-template <typename C>
-inline const C&
-Linear_Form<C>::operator[](dimension_type i) const {
-  assert(i < size());
-  return vec[i];
-}
-
-template <typename C>
-inline const C&
-Linear_Form<C>::inhomogeneous_term() const {
-  return vec[0];
-}
-
-template <typename C>
-inline memory_size_type
-Linear_Form<C>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>
-operator+(const Linear_Form<C>& f) {
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>
-operator+(const Linear_Form<C>& f, const C& n) {
-  return n + f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>
-operator+(const Linear_Form<C>& f, const Variable v) {
-  return v + f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>
-operator-(const Linear_Form<C>& f, const C& n) {
-  return -n + f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>
-operator-(const Variable v, const Variable w) {
-  return Linear_Form<C>(v, w);
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>
-operator*(const Linear_Form<C>& f, const C& n) {
-  return n * f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>&
-operator+=(Linear_Form<C>& f, const C& n) {
-  f[0] += n;
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline Linear_Form<C>&
-operator-=(Linear_Form<C>& f, const C& n) {
-  f[0] -= n;
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline bool
-operator!=(const Linear_Form<C>& x, const Linear_Form<C>& y) {
-  return !(x == y);
-}
-
-template <typename C>
-inline void
-Linear_Form<C>::m_swap(Linear_Form& y) {
-  using std::swap;
-  swap(vec, y.vec);
-}
-
-template <typename C>
-inline void
-Linear_Form<C>::ascii_dump(std::ostream& s) const {
-  using namespace IO_Operators;
-  dimension_type space_dim = space_dimension();
-  s << space_dim << "\n";
-  for (dimension_type i = 0; i <= space_dim; ++i) {
-    const char separator = ' ';
-    s << vec[i] << separator;
-  }
-  s << "\n";
-}
-
-template <typename C>
-inline bool
-Linear_Form<C>::ascii_load(std::istream& s) {
-  using namespace IO_Operators;
-  dimension_type new_dim;
-  if (!(s >> new_dim))
-    return false;
-
-  vec.resize(new_dim + 1, zero);
-  for (dimension_type i = 0; i <= new_dim; ++i) {
-    if (!(s >> vec[i]))
-      return false;
-  }
-
-  PPL_ASSERT(OK());
-  return true;
-}
-
-// Floating point analysis related methods.
-template <typename C>
-inline bool
-Linear_Form<C>::overflows() const {
-  if (!inhomogeneous_term().is_bounded())
-    return true;
-
-  for (dimension_type i = space_dimension(); i-- > 0; ) {
-    if (!coefficient(Variable(i)).is_bounded())
-      return true;
-  }
-
-  return false;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline void
-swap(Linear_Form<C>& x, Linear_Form<C>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Form_inlines_hh)
diff --git a/src/Linear_Form.templates.hh b/src/Linear_Form.templates.hh
deleted file mode 100644
index a05e665..0000000
--- a/src/Linear_Form.templates.hh
+++ /dev/null
@@ -1,527 +0,0 @@
-/* Linear_Form class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_Form_templates_hh
-#define PPL_Linear_Form_templates_hh 1
-
-#include "Linear_Form.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Box.defs.hh"
-#include <stdexcept>
-#include <iostream>
-#include <cmath>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename C>
-Linear_Form<C>::Linear_Form(const Variable v)
-  : vec() {
-  const dimension_type space_dim = v.space_dimension();
-  if (space_dim > max_space_dimension())
-    throw std::length_error("Linear_Form<C>::"
-                            "Linear_Form(v):\n"
-                            "v exceeds the maximum allowed "
-                            "space dimension.");
-  vec.reserve(compute_capacity(space_dim+1, vec_type().max_size()));
-  vec.resize(space_dim+1, zero);
-  vec[v.space_dimension()] = C(typename C::boundary_type(1));
-}
-
-template <typename C>
-Linear_Form<C>::Linear_Form(const Variable v, const Variable w)
-  : vec() {
-  const dimension_type v_space_dim = v.space_dimension();
-  const dimension_type w_space_dim = w.space_dimension();
-  const dimension_type space_dim = std::max(v_space_dim, w_space_dim);
-  if (space_dim > max_space_dimension())
-    throw std::length_error("Linear_Form<C>::"
-                            "Linear_Form(v, w):\n"
-                            "v or w exceed the maximum allowed "
-                            "space dimension.");
-  vec.reserve(compute_capacity(space_dim+1, vec_type().max_size()));
-  vec.resize(space_dim+1, zero);
-  if (v_space_dim != w_space_dim) {
-    vec[v_space_dim] = C(typename C::boundary_type(1));
-    vec[w_space_dim] = C(typename C::boundary_type(-1));
-  }
-}
-
-template <typename C>
-Linear_Form<C>::Linear_Form(const Linear_Expression& e)
-  : vec() {
-  const dimension_type space_dim = e.space_dimension();
-  if (space_dim > max_space_dimension())
-    throw std::length_error("Linear_Form<C>::"
-                            "Linear_Form(e):\n"
-                            "e exceeds the maximum allowed "
-                            "space dimension.");
-  vec.reserve(compute_capacity(space_dim+1, vec_type().max_size()));
-  vec.resize(space_dim+1);
-  for (dimension_type i = space_dim; i-- > 0; )
-    vec[i+1] = e.coefficient(Variable(i));
-  vec[0] = e.inhomogeneous_term();
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const Linear_Form<C>& f1, const Linear_Form<C>& f2) {
-  dimension_type f1_size = f1.size();
-  dimension_type f2_size = f2.size();
-  dimension_type min_size;
-  dimension_type max_size;
-  const Linear_Form<C>* p_e_max;
-  if (f1_size > f2_size) {
-    min_size = f2_size;
-    max_size = f1_size;
-    p_e_max = &f1;
-  }
-  else {
-    min_size = f1_size;
-    max_size = f2_size;
-    p_e_max = &f2;
-  }
-
-  Linear_Form<C> r(max_size, false);
-  dimension_type i = max_size;
-  while (i > min_size) {
-    --i;
-    r[i] = p_e_max->vec[i];
-  }
-  while (i > 0) {
-    --i;
-    r[i] = f1[i];
-    r[i] += f2[i];
-  }
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const Variable v, const Linear_Form<C>& f) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Form<C>::max_space_dimension())
-    throw std::length_error("Linear_Form "
-                            "operator+(v, f):\n"
-                            "v exceeds the maximum allowed "
-                            "space dimension.");
-  Linear_Form<C> r(f);
-  if (v_space_dim > f.space_dimension())
-    r.extend(v_space_dim+1);
-  r[v_space_dim] += C(typename C::boundary_type(1));
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator+(const C& n, const Linear_Form<C>& f) {
-  Linear_Form<C> r(f);
-  r[0] += n;
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f) {
-  Linear_Form<C> r(f);
-  for (dimension_type i = f.size(); i-- > 0; )
-    r[i].neg_assign(r[i]);
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f1, const Linear_Form<C>& f2) {
-  dimension_type f1_size = f1.size();
-  dimension_type f2_size = f2.size();
-  if (f1_size > f2_size) {
-    Linear_Form<C> r(f1_size, false);
-    dimension_type i = f1_size;
-    while (i > f2_size) {
-      --i;
-      r[i] = f1[i];
-    }
-    while (i > 0) {
-      --i;
-      r[i] = f1[i];
-      r[i] -= f2[i];
-    }
-    return r;
-  }
-  else {
-    Linear_Form<C> r(f2_size, false);
-    dimension_type i = f2_size;
-    while (i > f1_size) {
-      --i;
-      r[i].neg_assign(f2[i]);
-    }
-    while (i > 0) {
-      --i;
-      r[i] = f1[i];
-      r[i] -= f2[i];
-    }
-    return r;
-  }
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Variable v, const Linear_Form<C>& f) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Form<C>::max_space_dimension())
-    throw std::length_error("Linear_Form "
-                            "operator-(v, e):\n"
-                            "v exceeds the maximum allowed "
-                            "space dimension.");
-  Linear_Form<C> r(f);
-  if (v_space_dim > f.space_dimension())
-    r.extend(v_space_dim+1);
-  for (dimension_type i = f.size(); i-- > 0; )
-    r[i].neg_assign(r[i]);
-  r[v_space_dim] += C(typename C::boundary_type(1));
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const Linear_Form<C>& f, const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Form<C>::max_space_dimension())
-    throw std::length_error("Linear_Form "
-                            "operator-(e, v):\n"
-                            "v exceeds the maximum allowed "
-                            "space dimension.");
-  Linear_Form<C> r(f);
-  if (v_space_dim > f.space_dimension())
-    r.extend(v_space_dim+1);
-  r[v_space_dim] -= C(typename C::boundary_type(1));
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator-(const C& n, const Linear_Form<C>& f) {
-  Linear_Form<C> r(f);
-  for (dimension_type i = f.size(); i-- > 0; )
-    r[i].neg_assign(r[i]);
-  r[0] += n;
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>
-operator*(const C& n, const Linear_Form<C>& f) {
-  Linear_Form<C> r(f);
-  for (dimension_type i = f.size(); i-- > 0; )
-    r[i] *= n;
-  return r;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator+=(Linear_Form<C>& f1, const Linear_Form<C>& f2) {
-  dimension_type f1_size = f1.size();
-  dimension_type f2_size = f2.size();
-  if (f1_size < f2_size)
-    f1.extend(f2_size);
-  for (dimension_type i = f2_size; i-- > 0; )
-    f1[i] += f2[i];
-  return f1;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator+=(Linear_Form<C>& f, const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Form<C>::max_space_dimension())
-    throw std::length_error("Linear_Form<C>& "
-                            "operator+=(e, v):\n"
-			    "v exceeds the maximum allowed space dimension.");
-  if (v_space_dim > f.space_dimension())
-    f.extend(v_space_dim+1);
-  f[v_space_dim] += C(typename C::boundary_type(1));
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator-=(Linear_Form<C>& f1, const Linear_Form<C>& f2) {
-  dimension_type f1_size = f1.size();
-  dimension_type f2_size = f2.size();
-  if (f1_size < f2_size)
-    f1.extend(f2_size);
-  for (dimension_type i = f2_size; i-- > 0; )
-    f1[i] -= f2[i];
-  return f1;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator-=(Linear_Form<C>& f, const Variable v) {
-  const dimension_type v_space_dim = v.space_dimension();
-  if (v_space_dim > Linear_Form<C>::max_space_dimension())
-    throw std::length_error("Linear_Form<C>& "
-                            "operator-=(e, v):\n"
-			    "v exceeds the maximum allowed space dimension.");
-  if (v_space_dim > f.space_dimension())
-    f.extend(v_space_dim+1);
-  f[v_space_dim] -= C(typename C::boundary_type(1));
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator*=(Linear_Form<C>& f, const C& n) {
-  dimension_type f_size = f.size();
-  for (dimension_type i = f_size; i-- > 0; )
-    f[i] *= n;
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-Linear_Form<C>&
-operator/=(Linear_Form<C>& f, const C& n) {
-  dimension_type f_size = f.size();
-  for (dimension_type i = f_size; i-- > 0; )
-    f[i] /= n;
-  return f;
-}
-
-/*! \relates Linear_Form */
-template <typename C>
-inline bool
-operator==(const Linear_Form<C>& x, const Linear_Form<C>& y) {
-  const dimension_type x_size = x.size();
-  const dimension_type y_size = y.size();
-  if (x_size >= y_size) {
-    for (dimension_type i = y_size; i-- > 0; )
-      if (x[i] != y[i])
-        return false;
-
-    for (dimension_type i = x_size; --i >= y_size; )
-      if (x[i] != x.zero)
-        return false;
-
-  }
-  else {
-    for (dimension_type i = x_size; i-- > 0; )
-      if (x[i] != y[i])
-        return false;
-
-    for (dimension_type i = y_size; --i >= x_size; )
-      if (y[i] != x.zero)
-        return false;
-
-  }
-
-  return true;
-}
-
-template <typename C>
-void
-Linear_Form<C>::negate() {
-  for (dimension_type i = vec.size(); i-- > 0; )
-    vec[i].neg_assign(vec[i]);
-  return;
-}
-
-template <typename C>
-inline memory_size_type
-Linear_Form<C>::external_memory_in_bytes() const {
-  memory_size_type n = 0;
-  for (dimension_type i = size(); i-- > 0; )
-    n += vec[i].external_memory_in_bytes();
-  n += vec.capacity()*sizeof(C);
-  return n;
-}
-
-template <typename C>
-bool
-Linear_Form<C>::OK() const {
-  for (dimension_type i = size(); i-- > 0; )
-    if (!vec[i].OK())
-      return false;
-  return true;
-}
-
-// Floating point analysis related methods.
-template <typename C>
-void
-Linear_Form<C>::relative_error(
-		const Floating_Point_Format analyzed_format,
-                Linear_Form& result) const {
-  typedef typename C::boundary_type analyzer_format;
-
-  // Get the necessary information on the analyzed's format.
-  unsigned int f_base;
-  unsigned int f_mantissa_bits;
-  switch (analyzed_format) {
-    case IEEE754_HALF:
-      f_base = float_ieee754_half::BASE;
-      f_mantissa_bits = float_ieee754_half::MANTISSA_BITS;
-      break;
-    case IEEE754_SINGLE:
-      f_base = float_ieee754_single::BASE;
-      f_mantissa_bits = float_ieee754_single::MANTISSA_BITS;
-      break;
-    case IEEE754_DOUBLE:
-      f_base = float_ieee754_double::BASE;
-      f_mantissa_bits = float_ieee754_double::MANTISSA_BITS;
-      break;
-    case IBM_SINGLE:
-      f_base = float_ibm_single::BASE;
-      f_mantissa_bits = float_ibm_single::MANTISSA_BITS;
-      break;
-    case IEEE754_QUAD:
-      f_base = float_ieee754_quad::BASE;
-      f_mantissa_bits = float_ieee754_quad::MANTISSA_BITS;
-      break;
-    case INTEL_DOUBLE_EXTENDED:
-      f_base = float_intel_double_extended::BASE;
-      f_mantissa_bits = float_intel_double_extended::MANTISSA_BITS;
-      break;
-    default:
-      PPL_UNREACHABLE;
-      break;
-  }
-
-  C error_propagator;
-  // We assume that f_base is a power of 2.
-  unsigned int u_power = msb_position(f_base) * f_mantissa_bits;
-  int neg_power = -static_cast<int>(u_power);
-  analyzer_format lb = static_cast<analyzer_format>(ldexp(1.0, neg_power));
-
-  error_propagator.build(i_constraint(GREATER_OR_EQUAL, -lb),
-                         i_constraint(LESS_OR_EQUAL, lb));
-
-  // Handle the inhomogeneous term.
-  const C* current_term = &inhomogeneous_term();
-  assert(current_term->is_bounded());
-
-  C current_multiplier(std::max(std::abs(current_term->lower()),
-                                std::abs(current_term->upper())));
-  Linear_Form current_result_term(current_multiplier);
-  current_result_term *= error_propagator;
-  result = Linear_Form(current_result_term);
-
-  // Handle the other terms.
-  dimension_type dimension = space_dimension();
-  for (dimension_type i = 0; i < dimension; ++i) {
-    current_term = &coefficient(Variable(i));
-    assert(current_term->is_bounded());
-    current_multiplier = C(std::max(std::abs(current_term->lower()),
-                                    std::abs(current_term->upper())));
-    current_result_term = Linear_Form(Variable(i));
-    current_result_term *= current_multiplier;
-    current_result_term *= error_propagator;
-    result += current_result_term;
-  }
-
-  return;
-}
-
-template <typename C>
-template <typename Target>
-bool
-Linear_Form<C>::intervalize(const FP_Oracle<Target,C>& oracle,
-                            C& result) const {
-  result = C(inhomogeneous_term());
-  dimension_type dimension = space_dimension();
-  for (dimension_type i = 0; i < dimension; ++i) {
-    C current_addend = coefficient(Variable(i));
-    C curr_int;
-    if (!oracle.get_interval(i, curr_int))
-      return false;
-    current_addend *= curr_int;
-    result += current_addend;
-  }
-
-  return true;
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_Form */
-template <typename C>
-std::ostream&
-IO_Operators::operator<<(std::ostream& s, const Linear_Form<C>& f) {
-  const dimension_type num_variables = f.space_dimension();
-  bool first = true;
-  for (dimension_type v = 0; v < num_variables; ++v) {
-    const C& fv = f[v+1];
-    if (fv != typename C::boundary_type(0)) {
-      if (first) {
-        if (fv == typename C::boundary_type(-1))
-          s << "-";
-        else if (fv != typename C::boundary_type(1))
-          s << fv << "*";
-        first = false;
-      }
-      else {
-        if (fv == typename C::boundary_type(-1))
-          s << " - ";
-        else {
-          s << " + ";
-          if (fv != typename C::boundary_type(1))
-            s << fv << "*";
-        }
-      }
-      s << Variable(v);
-    }
-  }
-  // Inhomogeneous term.
-  const C& it = f[0];
-  if (it != 0) {
-    if (!first)
-	s << " + ";
-    else
-      first = false;
-    s << it;
-  }
-
-  if (first)
-    // The null linear form.
-    s << Linear_Form<C>::zero;
-  return s;
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(C, Linear_Form<C>)
-
-template <typename C>
-C Linear_Form<C>::zero(typename C::boundary_type(0));
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Form_templates_hh)
diff --git a/src/Linear_Form.types.hh b/src/Linear_Form.types.hh
deleted file mode 100644
index f0200e0..0000000
--- a/src/Linear_Form.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Linear_Form_types_hh
-#define PPL_Linear_Form_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename C>
-class Linear_Form;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_Form_types_hh)
diff --git a/src/Linear_Form_defs.hh b/src/Linear_Form_defs.hh
new file mode 100644
index 0000000..57d75c7
--- /dev/null
+++ b/src/Linear_Form_defs.hh
@@ -0,0 +1,499 @@
+/* Linear_Form class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Form_defs_hh
+#define PPL_Linear_Form_defs_hh 1
+
+#include "Linear_Form_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Variable_defs.hh"
+#include "Box_types.hh"
+#include "Float_defs.hh"
+#include <vector>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Linear_Form */
+template <typename C>
+void swap(Linear_Form<C>& x, Linear_Form<C>& y);
+
+// Put them in the namespace here to declare them friend later.
+
+//! Returns the linear form \p f1 + \p f2.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
+
+//! Returns the linear form \p v + \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(Variable v, const Linear_Form<C>& f);
+
+//! Returns the linear form \p f + \p v.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const Linear_Form<C>& f, Variable v);
+
+//! Returns the linear form \p n + \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const C& n, const Linear_Form<C>& f);
+
+//! Returns the linear form \p f + \p n.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const Linear_Form<C>& f, const C& n);
+
+//! Returns the linear form \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const Linear_Form<C>& f);
+
+//! Returns the linear form - \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f);
+
+//! Returns the linear form \p f1 - \p f2.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
+
+//! Returns the linear form \p v - \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(Variable v, const Linear_Form<C>& f);
+
+//! Returns the linear form \p f - \p v.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f, Variable v);
+
+//! Returns the linear form \p n - \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const C& n, const Linear_Form<C>& f);
+
+//! Returns the linear form \p f - \p n.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f, const C& n);
+
+//! Returns the linear form \p n * \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator*(const C& n, const Linear_Form<C>& f);
+
+//! Returns the linear form \p f * \p n.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator*(const Linear_Form<C>& f, const C& n);
+
+//! Returns the linear form \p f1 + \p f2 and assigns it to \p e1.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator+=(Linear_Form<C>& f1, const Linear_Form<C>& f2);
+
+//! Returns the linear form \p f + \p v and assigns it to \p f.
+/*! \relates Linear_Form
+  \exception std::length_error
+  Thrown if the space dimension of \p v exceeds
+  <CODE>Linear_Form::max_space_dimension()</CODE>.
+ */
+template <typename C>
+Linear_Form<C>&
+operator+=(Linear_Form<C>& f, Variable v);
+
+//! Returns the linear form \p f + \p n and assigns it to \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator+=(Linear_Form<C>& f, const C& n);
+
+//! Returns the linear form \p f1 - \p f2 and assigns it to \p f1.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator-=(Linear_Form<C>& f1, const Linear_Form<C>& f2);
+
+//! Returns the linear form \p f - \p v and assigns it to \p f.
+/*! \relates Linear_Form
+  \exception std::length_error
+  Thrown if the space dimension of \p v exceeds
+  <CODE>Linear_Form::max_space_dimension()</CODE>.
+ */
+template <typename C>
+Linear_Form<C>&
+operator-=(Linear_Form<C>& f, Variable v);
+
+//! Returns the linear form \p f - \p n and assigns it to \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator-=(Linear_Form<C>& f, const C& n);
+
+//! Returns the linear form \p n * \p f and assigns it to \p f.
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator*=(Linear_Form<C>& f, const C& n);
+
+//! Returns the linear form \p f / \p n and assigns it to \p f.
+/*!
+   \relates Linear_Form
+   Performs the division of a linear form by a scalar. It is up to the user to
+   ensure that division by 0 is not performed.
+*/
+template <typename C>
+Linear_Form<C>&
+operator/=(Linear_Form<C>& f, const C& n);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+/*! \relates Linear_Form */
+template <typename C>
+bool
+operator==(const Linear_Form<C>& x, const Linear_Form<C>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Linear_Form */
+template <typename C>
+bool
+operator!=(const Linear_Form<C>& x, const Linear_Form<C>& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Linear_Form */
+template <typename C>
+std::ostream& operator<<(std::ostream& s, const Linear_Form<C>& f);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+//! A linear form with interval coefficients.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Linear_Form represents the interval linear form
+  \f[
+    \sum_{i=0}^{n-1} a_i x_i + b
+  \f]
+  where \f$n\f$ is the dimension of the vector space,
+  each \f$a_i\f$ is the coefficient
+  of the \f$i\f$-th variable \f$x_i\f$
+  and \f$b\f$ is the inhomogeneous term.
+  The coefficients and the inhomogeneous term of the linear form
+  have the template parameter \p C as their type. \p C must be the
+  type of an Interval.
+
+  \par How to build a linear form.
+  A full set of functions is defined in order to provide a convenient
+  interface for building complex linear forms starting from simpler ones
+  and from objects of the classes Variable and \p C. Available operators
+  include binary addition and subtraction, as well as multiplication and
+  division by a coefficient.
+  The space dimension of a linear form is defined as
+  the highest variable dimension among variables that have a nonzero
+  coefficient in the linear form, or zero if no such variable exists.
+  The space dimension for each variable \f$x_i\f$ is given by \f$i + 1\f$.
+
+  \par Example
+  Given the type \p T of an Interval with floating point coefficients (though
+  any integral type may also be used), the following code builds the interval
+  linear form \f$lf = x_5 - x_2 + 1\f$ with space dimension 6:
+  \code
+  Variable x5(5);
+  Variable x2(2);
+  T x5_coefficient;
+  x5_coefficient.lower() = 2.0;
+  x5_coefficient.upper() = 3.0;
+  T inhomogeneous_term;
+  inhomogeneous_term.lower() = 4.0;
+  inhomogeneous_term.upper() = 8.0;
+  Linear_Form<T> lf(x2);
+  lf = -lf;
+  lf += Linear_Form<T>(x2);
+  Linear_Form<T> lf_x5(x5);
+  lf_x5 *= x5_coefficient;
+  lf += lf_x5;
+  \endcode
+  Note that \c lf_x5 is created with space dimension 6, while \c lf is
+  created with space dimension 0 and then extended first to space
+  dimension 2 when \c x2 is subtracted and finally to space dimension
+  6 when \c lf_x5 is added.
+*/
+template <typename C>
+class Parma_Polyhedra_Library::Linear_Form {
+public:
+  //! Default constructor: returns a copy of Linear_Form::zero().
+  Linear_Form();
+
+  //! Ordinary copy constructor.
+  Linear_Form(const Linear_Form& f);
+
+  //! Destructor.
+  ~Linear_Form();
+
+  //! Builds the linear form corresponding to the inhomogeneous term \p n.
+  explicit Linear_Form(const C& n);
+
+  //! Builds the linear form corresponding to the variable \p v.
+  /*!
+    \exception std::length_error
+    Thrown if the space dimension of \p v exceeds
+    <CODE>Linear_Form::max_space_dimension()</CODE>.
+  */
+  Linear_Form(Variable v);
+
+  //! Builds a linear form approximating the linear expression \p e.
+  Linear_Form(const Linear_Expression& e);
+
+  //! Returns the maximum space dimension a Linear_Form can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  const C& coefficient(Variable v) const;
+
+  //! Returns the inhomogeneous term of \p *this.
+  const C& inhomogeneous_term() const;
+
+  //! Negates all the coefficients of \p *this.
+  void negate();
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Linear_Form& y);
+
+  // Floating point analysis related methods.
+
+  /*! \brief
+    Verifies if the linear form overflows.
+
+    \return
+    Returns <CODE>false</CODE> if all coefficients in \p lf are bounded,
+    <CODE>true</CODE> otherwise.
+
+    \p T must be the type of possibly unbounded quantities.
+  */
+  bool overflows() const;
+
+  /*! \brief
+    Computes the relative error associated to floating point computations
+    that operate on a quantity that is overapproximated by \p *this.
+
+    \param analyzed_format The floating point format used by the analyzed
+    program.
+    \param result Becomes the linear form corresponding to the relative
+    error committed.
+
+    This method makes <CODE>result</CODE> become a linear form
+    obtained by evaluating the function \f$\varepsilon_{\mathbf{f}}(l)\f$
+    on the linear form. This function is defined as:
+    \f[
+    \varepsilon_{\mathbf{f}}\left([a, b]+\sum_{v \in \cV}[a_{v}, b_{v}]v\right)
+    \defeq
+    (\textrm{max}(|a|, |b|) \amifp [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])
+    +
+    \sum_{v \in \cV}(\textrm{max}(|a_{v}|,|b_{v}|)
+    \amifp
+    [-\beta^{-\textrm{p}}, \beta^{-\textrm{p}}])v
+    \f]
+    where p is the fraction size in bits for the format \f$\mathbf{f}\f$ and
+    \f$\beta\f$ the base.
+
+    The result is undefined if \p T is not the type of an interval with
+    floating point boundaries.
+  */
+  void relative_error(Floating_Point_Format analyzed_format,
+                      Linear_Form& result) const;
+
+  /*! \brief
+    Makes \p result become an interval that overapproximates all the
+    possible values of \p *this.
+
+    \param oracle The FP_Oracle to be queried.
+    \param result The linear form that will store the result.
+
+    \return <CODE>true</CODE> if the operation was successful,
+    <CODE>false</CODE> otherwise (the possibility of failure
+    depends on the oracle's implementation).
+
+    \par Template type parameters
+
+    - The class template parameter \p Target specifies the implementation
+    of Concrete_Expression to be used.
+
+    This method makes <CODE>result</CODE> become
+    \f$\iota(lf)\rho^{\#}\f$, that is an interval defined as:
+    \f[
+    \iota\left(i + \sum_{v \in \cV}i_{v}v\right)\rho^{\#}
+    \defeq
+    i \asifp \left(\bigoplus_{v \in \cV}{}^{\#}i_{v} \amifp
+    \rho^{\#}(v)\right)
+    \f]
+    where \f$\rho^{\#}(v)\f$ is an interval (provided by the oracle)
+    that correctly approximates the value of \f$v\f$.
+
+    The result is undefined if \p C is not the type of an interval with
+    floating point boundaries.
+  */
+  template <typename Target>
+  bool intervalize(const FP_Oracle<Target,C>& oracle, C& result) const;
+
+private:
+  //! The generic coefficient equal to the singleton zero.
+  static C zero;
+
+  //! Type of the container vector.
+  typedef std::vector<C> vec_type;
+
+  //! The container vector.
+  vec_type vec;
+
+  //! Implementation sizing constructor.
+  /*!
+    The bool parameter is just to avoid problems with
+    the constructor Linear_Form(const C& n).
+  */
+  Linear_Form(dimension_type sz, bool);
+
+  /*! \brief
+    Builds the linear form corresponding to the difference of
+    \p v and \p w.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p v or the one of \p w exceed
+    <CODE>Linear_Form::max_space_dimension()</CODE>.
+  */
+  Linear_Form(Variable v, Variable w);
+
+  //! Gives the number of generic coefficients currently in use.
+  dimension_type size() const;
+
+  //! Extends the vector of \p *this to size \p sz.
+  void extend(dimension_type sz);
+
+  //! Returns a reference to \p vec[i].
+  C& operator[](dimension_type i);
+
+  //! Returns a const reference to \p vec[i].
+  const C& operator[](dimension_type i) const;
+
+  friend Linear_Form<C>
+  operator+<C>(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
+  friend Linear_Form<C>
+  operator+<C>(const C& n, const Linear_Form<C>& f);
+  friend Linear_Form<C>
+  operator+<C>(const Linear_Form<C>& f, const C& n);
+  friend Linear_Form<C>
+  operator+<C>(Variable v, const Linear_Form<C>& f);
+
+  friend Linear_Form<C>
+  operator-<C>(const Linear_Form<C>& f);
+
+  friend Linear_Form<C>
+  operator-<C>(const Linear_Form<C>& f1, const Linear_Form<C>& f2);
+  friend Linear_Form<C>
+  operator-<C>(const C& n, const Linear_Form<C>& f);
+  friend Linear_Form<C>
+  operator-<C>(const Linear_Form<C>& f, const C& n);
+  friend Linear_Form<C>
+  operator-<C>(Variable v, const Linear_Form<C>& f);
+  friend Linear_Form<C>
+  operator-<C>(const Linear_Form<C>& f, Variable v);
+
+  friend Linear_Form<C>
+  operator*<C>(const C& n, const Linear_Form<C>& f);
+  friend Linear_Form<C>
+  operator*<C>(const Linear_Form<C>& f, const C& n);
+
+  friend Linear_Form<C>&
+  operator+=<C>(Linear_Form<C>& f1, const Linear_Form<C>& f2);
+  friend Linear_Form<C>&
+  operator+=<C>(Linear_Form<C>& f, Variable v);
+  friend Linear_Form<C>&
+  operator+=<C>(Linear_Form<C>& f, const C& n);
+
+  friend Linear_Form<C>&
+  operator-=<C>(Linear_Form<C>& f1, const Linear_Form<C>& f2);
+  friend Linear_Form<C>&
+  operator-=<C>(Linear_Form<C>& f, Variable v);
+  friend Linear_Form<C>&
+  operator-=<C>(Linear_Form<C>& f, const C& n);
+
+  friend Linear_Form<C>&
+  operator*=<C>(Linear_Form<C>& f, const C& n);
+
+  friend Linear_Form<C>&
+  operator/=<C>(Linear_Form<C>& f, const C& n);
+
+  friend bool
+  operator==<C>(const Linear_Form<C>& x, const Linear_Form<C>& y);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators
+  ::operator<<<C>(std::ostream& s, const Linear_Form<C>& f);
+};
+
+#include "Linear_Form_inlines.hh"
+// Linear_Form_templates.hh is not included here on purpose.
+
+#endif // !defined(PPL_Linear_Form_defs_hh)
diff --git a/src/Linear_Form_inlines.hh b/src/Linear_Form_inlines.hh
new file mode 100644
index 0000000..2ab24b1
--- /dev/null
+++ b/src/Linear_Form_inlines.hh
@@ -0,0 +1,252 @@
+/* Linear_Form class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Form_inlines_hh
+#define PPL_Linear_Form_inlines_hh 1
+
+#include "Variable_defs.hh"
+#include <iostream>
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename C>
+inline dimension_type
+Linear_Form<C>::max_space_dimension() {
+  return vec_type().max_size() - 1;
+}
+
+template <typename C>
+inline
+Linear_Form<C>::Linear_Form()
+  : vec(1, zero) {
+  vec.reserve(compute_capacity(1, vec_type().max_size()));
+}
+
+template <typename C>
+inline
+Linear_Form<C>::Linear_Form(dimension_type sz, bool)
+  : vec(sz, zero) {
+  vec.reserve(compute_capacity(sz, vec_type().max_size()));
+}
+
+template <typename C>
+inline
+Linear_Form<C>::Linear_Form(const Linear_Form& f)
+  : vec(f.vec) {
+}
+
+template <typename C>
+inline
+Linear_Form<C>::~Linear_Form() {
+}
+
+template <typename C>
+inline dimension_type
+Linear_Form<C>::size() const {
+  return vec.size();
+}
+
+template <typename C>
+inline void
+Linear_Form<C>::extend(dimension_type sz) {
+  assert(sz > size());
+  vec.reserve(compute_capacity(sz, vec_type().max_size()));
+  vec.resize(sz, zero);
+}
+
+template <typename C>
+inline
+Linear_Form<C>::Linear_Form(const C& n)
+  : vec(1, n) {
+  vec.reserve(compute_capacity(1, vec_type().max_size()));
+}
+
+template <typename C>
+inline dimension_type
+Linear_Form<C>::space_dimension() const {
+  return size() - 1;
+}
+
+template <typename C>
+inline const C&
+Linear_Form<C>::coefficient(Variable v) const {
+  if (v.space_dimension() > space_dimension())
+    return zero;
+  return vec[v.id()+1];
+}
+
+template <typename C>
+inline C&
+Linear_Form<C>::operator[](dimension_type i) {
+  assert(i < size());
+  return vec[i];
+}
+
+template <typename C>
+inline const C&
+Linear_Form<C>::operator[](dimension_type i) const {
+  assert(i < size());
+  return vec[i];
+}
+
+template <typename C>
+inline const C&
+Linear_Form<C>::inhomogeneous_term() const {
+  return vec[0];
+}
+
+template <typename C>
+inline memory_size_type
+Linear_Form<C>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>
+operator+(const Linear_Form<C>& f) {
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>
+operator+(const Linear_Form<C>& f, const C& n) {
+  return n + f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>
+operator+(const Linear_Form<C>& f, const Variable v) {
+  return v + f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>
+operator-(const Linear_Form<C>& f, const C& n) {
+  return -n + f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>
+operator-(const Variable v, const Variable w) {
+  return Linear_Form<C>(v, w);
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>
+operator*(const Linear_Form<C>& f, const C& n) {
+  return n * f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>&
+operator+=(Linear_Form<C>& f, const C& n) {
+  f[0] += n;
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline Linear_Form<C>&
+operator-=(Linear_Form<C>& f, const C& n) {
+  f[0] -= n;
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline bool
+operator!=(const Linear_Form<C>& x, const Linear_Form<C>& y) {
+  return !(x == y);
+}
+
+template <typename C>
+inline void
+Linear_Form<C>::m_swap(Linear_Form& y) {
+  using std::swap;
+  swap(vec, y.vec);
+}
+
+template <typename C>
+inline void
+Linear_Form<C>::ascii_dump(std::ostream& s) const {
+  using namespace IO_Operators;
+  dimension_type space_dim = space_dimension();
+  s << space_dim << "\n";
+  for (dimension_type i = 0; i <= space_dim; ++i) {
+    const char separator = ' ';
+    s << vec[i] << separator;
+  }
+  s << "\n";
+}
+
+template <typename C>
+inline bool
+Linear_Form<C>::ascii_load(std::istream& s) {
+  using namespace IO_Operators;
+  dimension_type new_dim;
+  if (!(s >> new_dim))
+    return false;
+
+  vec.resize(new_dim + 1, zero);
+  for (dimension_type i = 0; i <= new_dim; ++i) {
+    if (!(s >> vec[i]))
+      return false;
+  }
+
+  PPL_ASSERT(OK());
+  return true;
+}
+
+// Floating point analysis related methods.
+template <typename C>
+inline bool
+Linear_Form<C>::overflows() const {
+  if (!inhomogeneous_term().is_bounded())
+    return true;
+
+  for (dimension_type i = space_dimension(); i-- > 0; ) {
+    if (!coefficient(Variable(i)).is_bounded())
+      return true;
+  }
+
+  return false;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline void
+swap(Linear_Form<C>& x, Linear_Form<C>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Form_inlines_hh)
diff --git a/src/Linear_Form_templates.hh b/src/Linear_Form_templates.hh
new file mode 100644
index 0000000..724b89f
--- /dev/null
+++ b/src/Linear_Form_templates.hh
@@ -0,0 +1,527 @@
+/* Linear_Form class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_Form_templates_hh
+#define PPL_Linear_Form_templates_hh 1
+
+#include "Linear_Form_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Box_defs.hh"
+#include <stdexcept>
+#include <iostream>
+#include <cmath>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename C>
+Linear_Form<C>::Linear_Form(const Variable v)
+  : vec() {
+  const dimension_type space_dim = v.space_dimension();
+  if (space_dim > max_space_dimension())
+    throw std::length_error("Linear_Form<C>::"
+                            "Linear_Form(v):\n"
+                            "v exceeds the maximum allowed "
+                            "space dimension.");
+  vec.reserve(compute_capacity(space_dim+1, vec_type().max_size()));
+  vec.resize(space_dim+1, zero);
+  vec[v.space_dimension()] = C(typename C::boundary_type(1));
+}
+
+template <typename C>
+Linear_Form<C>::Linear_Form(const Variable v, const Variable w)
+  : vec() {
+  const dimension_type v_space_dim = v.space_dimension();
+  const dimension_type w_space_dim = w.space_dimension();
+  const dimension_type space_dim = std::max(v_space_dim, w_space_dim);
+  if (space_dim > max_space_dimension())
+    throw std::length_error("Linear_Form<C>::"
+                            "Linear_Form(v, w):\n"
+                            "v or w exceed the maximum allowed "
+                            "space dimension.");
+  vec.reserve(compute_capacity(space_dim+1, vec_type().max_size()));
+  vec.resize(space_dim+1, zero);
+  if (v_space_dim != w_space_dim) {
+    vec[v_space_dim] = C(typename C::boundary_type(1));
+    vec[w_space_dim] = C(typename C::boundary_type(-1));
+  }
+}
+
+template <typename C>
+Linear_Form<C>::Linear_Form(const Linear_Expression& e)
+  : vec() {
+  const dimension_type space_dim = e.space_dimension();
+  if (space_dim > max_space_dimension())
+    throw std::length_error("Linear_Form<C>::"
+                            "Linear_Form(e):\n"
+                            "e exceeds the maximum allowed "
+                            "space dimension.");
+  vec.reserve(compute_capacity(space_dim+1, vec_type().max_size()));
+  vec.resize(space_dim+1);
+  for (dimension_type i = space_dim; i-- > 0; )
+    vec[i+1] = e.coefficient(Variable(i));
+  vec[0] = e.inhomogeneous_term();
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const Linear_Form<C>& f1, const Linear_Form<C>& f2) {
+  dimension_type f1_size = f1.size();
+  dimension_type f2_size = f2.size();
+  dimension_type min_size;
+  dimension_type max_size;
+  const Linear_Form<C>* p_e_max;
+  if (f1_size > f2_size) {
+    min_size = f2_size;
+    max_size = f1_size;
+    p_e_max = &f1;
+  }
+  else {
+    min_size = f1_size;
+    max_size = f2_size;
+    p_e_max = &f2;
+  }
+
+  Linear_Form<C> r(max_size, false);
+  dimension_type i = max_size;
+  while (i > min_size) {
+    --i;
+    r[i] = p_e_max->vec[i];
+  }
+  while (i > 0) {
+    --i;
+    r[i] = f1[i];
+    r[i] += f2[i];
+  }
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const Variable v, const Linear_Form<C>& f) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Form<C>::max_space_dimension())
+    throw std::length_error("Linear_Form "
+                            "operator+(v, f):\n"
+                            "v exceeds the maximum allowed "
+                            "space dimension.");
+  Linear_Form<C> r(f);
+  if (v_space_dim > f.space_dimension())
+    r.extend(v_space_dim+1);
+  r[v_space_dim] += C(typename C::boundary_type(1));
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator+(const C& n, const Linear_Form<C>& f) {
+  Linear_Form<C> r(f);
+  r[0] += n;
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f) {
+  Linear_Form<C> r(f);
+  for (dimension_type i = f.size(); i-- > 0; )
+    r[i].neg_assign(r[i]);
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f1, const Linear_Form<C>& f2) {
+  dimension_type f1_size = f1.size();
+  dimension_type f2_size = f2.size();
+  if (f1_size > f2_size) {
+    Linear_Form<C> r(f1_size, false);
+    dimension_type i = f1_size;
+    while (i > f2_size) {
+      --i;
+      r[i] = f1[i];
+    }
+    while (i > 0) {
+      --i;
+      r[i] = f1[i];
+      r[i] -= f2[i];
+    }
+    return r;
+  }
+  else {
+    Linear_Form<C> r(f2_size, false);
+    dimension_type i = f2_size;
+    while (i > f1_size) {
+      --i;
+      r[i].neg_assign(f2[i]);
+    }
+    while (i > 0) {
+      --i;
+      r[i] = f1[i];
+      r[i] -= f2[i];
+    }
+    return r;
+  }
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Variable v, const Linear_Form<C>& f) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Form<C>::max_space_dimension())
+    throw std::length_error("Linear_Form "
+                            "operator-(v, e):\n"
+                            "v exceeds the maximum allowed "
+                            "space dimension.");
+  Linear_Form<C> r(f);
+  if (v_space_dim > f.space_dimension())
+    r.extend(v_space_dim+1);
+  for (dimension_type i = f.size(); i-- > 0; )
+    r[i].neg_assign(r[i]);
+  r[v_space_dim] += C(typename C::boundary_type(1));
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const Linear_Form<C>& f, const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Form<C>::max_space_dimension())
+    throw std::length_error("Linear_Form "
+                            "operator-(e, v):\n"
+                            "v exceeds the maximum allowed "
+                            "space dimension.");
+  Linear_Form<C> r(f);
+  if (v_space_dim > f.space_dimension())
+    r.extend(v_space_dim+1);
+  r[v_space_dim] -= C(typename C::boundary_type(1));
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator-(const C& n, const Linear_Form<C>& f) {
+  Linear_Form<C> r(f);
+  for (dimension_type i = f.size(); i-- > 0; )
+    r[i].neg_assign(r[i]);
+  r[0] += n;
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>
+operator*(const C& n, const Linear_Form<C>& f) {
+  Linear_Form<C> r(f);
+  for (dimension_type i = f.size(); i-- > 0; )
+    r[i] *= n;
+  return r;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator+=(Linear_Form<C>& f1, const Linear_Form<C>& f2) {
+  dimension_type f1_size = f1.size();
+  dimension_type f2_size = f2.size();
+  if (f1_size < f2_size)
+    f1.extend(f2_size);
+  for (dimension_type i = f2_size; i-- > 0; )
+    f1[i] += f2[i];
+  return f1;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator+=(Linear_Form<C>& f, const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Form<C>::max_space_dimension())
+    throw std::length_error("Linear_Form<C>& "
+                            "operator+=(e, v):\n"
+                            "v exceeds the maximum allowed space dimension.");
+  if (v_space_dim > f.space_dimension())
+    f.extend(v_space_dim+1);
+  f[v_space_dim] += C(typename C::boundary_type(1));
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator-=(Linear_Form<C>& f1, const Linear_Form<C>& f2) {
+  dimension_type f1_size = f1.size();
+  dimension_type f2_size = f2.size();
+  if (f1_size < f2_size)
+    f1.extend(f2_size);
+  for (dimension_type i = f2_size; i-- > 0; )
+    f1[i] -= f2[i];
+  return f1;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator-=(Linear_Form<C>& f, const Variable v) {
+  const dimension_type v_space_dim = v.space_dimension();
+  if (v_space_dim > Linear_Form<C>::max_space_dimension())
+    throw std::length_error("Linear_Form<C>& "
+                            "operator-=(e, v):\n"
+                            "v exceeds the maximum allowed space dimension.");
+  if (v_space_dim > f.space_dimension())
+    f.extend(v_space_dim+1);
+  f[v_space_dim] -= C(typename C::boundary_type(1));
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator*=(Linear_Form<C>& f, const C& n) {
+  dimension_type f_size = f.size();
+  for (dimension_type i = f_size; i-- > 0; )
+    f[i] *= n;
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+Linear_Form<C>&
+operator/=(Linear_Form<C>& f, const C& n) {
+  dimension_type f_size = f.size();
+  for (dimension_type i = f_size; i-- > 0; )
+    f[i] /= n;
+  return f;
+}
+
+/*! \relates Linear_Form */
+template <typename C>
+inline bool
+operator==(const Linear_Form<C>& x, const Linear_Form<C>& y) {
+  const dimension_type x_size = x.size();
+  const dimension_type y_size = y.size();
+  if (x_size >= y_size) {
+    for (dimension_type i = y_size; i-- > 0; )
+      if (x[i] != y[i])
+        return false;
+
+    for (dimension_type i = x_size; --i >= y_size; )
+      if (x[i] != x.zero)
+        return false;
+
+  }
+  else {
+    for (dimension_type i = x_size; i-- > 0; )
+      if (x[i] != y[i])
+        return false;
+
+    for (dimension_type i = y_size; --i >= x_size; )
+      if (y[i] != x.zero)
+        return false;
+
+  }
+
+  return true;
+}
+
+template <typename C>
+void
+Linear_Form<C>::negate() {
+  for (dimension_type i = vec.size(); i-- > 0; )
+    vec[i].neg_assign(vec[i]);
+  return;
+}
+
+template <typename C>
+inline memory_size_type
+Linear_Form<C>::external_memory_in_bytes() const {
+  memory_size_type n = 0;
+  for (dimension_type i = size(); i-- > 0; )
+    n += vec[i].external_memory_in_bytes();
+  n += vec.capacity()*sizeof(C);
+  return n;
+}
+
+template <typename C>
+bool
+Linear_Form<C>::OK() const {
+  for (dimension_type i = size(); i-- > 0; )
+    if (!vec[i].OK())
+      return false;
+  return true;
+}
+
+// Floating point analysis related methods.
+template <typename C>
+void
+Linear_Form<C>::relative_error(
+                const Floating_Point_Format analyzed_format,
+                Linear_Form& result) const {
+  typedef typename C::boundary_type analyzer_format;
+
+  // Get the necessary information on the analyzed's format.
+  unsigned int f_base;
+  unsigned int f_mantissa_bits;
+  switch (analyzed_format) {
+    case IEEE754_HALF:
+      f_base = float_ieee754_half::BASE;
+      f_mantissa_bits = float_ieee754_half::MANTISSA_BITS;
+      break;
+    case IEEE754_SINGLE:
+      f_base = float_ieee754_single::BASE;
+      f_mantissa_bits = float_ieee754_single::MANTISSA_BITS;
+      break;
+    case IEEE754_DOUBLE:
+      f_base = float_ieee754_double::BASE;
+      f_mantissa_bits = float_ieee754_double::MANTISSA_BITS;
+      break;
+    case IBM_SINGLE:
+      f_base = float_ibm_single::BASE;
+      f_mantissa_bits = float_ibm_single::MANTISSA_BITS;
+      break;
+    case IEEE754_QUAD:
+      f_base = float_ieee754_quad::BASE;
+      f_mantissa_bits = float_ieee754_quad::MANTISSA_BITS;
+      break;
+    case INTEL_DOUBLE_EXTENDED:
+      f_base = float_intel_double_extended::BASE;
+      f_mantissa_bits = float_intel_double_extended::MANTISSA_BITS;
+      break;
+    default:
+      PPL_UNREACHABLE;
+      break;
+  }
+
+  C error_propagator;
+  // We assume that f_base is a power of 2.
+  unsigned int u_power = msb_position(f_base) * f_mantissa_bits;
+  int neg_power = -static_cast<int>(u_power);
+  analyzer_format lb = static_cast<analyzer_format>(ldexp(1.0, neg_power));
+
+  error_propagator.build(i_constraint(GREATER_OR_EQUAL, -lb),
+                         i_constraint(LESS_OR_EQUAL, lb));
+
+  // Handle the inhomogeneous term.
+  const C* current_term = &inhomogeneous_term();
+  assert(current_term->is_bounded());
+
+  C current_multiplier(std::max(std::abs(current_term->lower()),
+                                std::abs(current_term->upper())));
+  Linear_Form current_result_term(current_multiplier);
+  current_result_term *= error_propagator;
+  result = Linear_Form(current_result_term);
+
+  // Handle the other terms.
+  dimension_type dimension = space_dimension();
+  for (dimension_type i = 0; i < dimension; ++i) {
+    current_term = &coefficient(Variable(i));
+    assert(current_term->is_bounded());
+    current_multiplier = C(std::max(std::abs(current_term->lower()),
+                                    std::abs(current_term->upper())));
+    current_result_term = Linear_Form(Variable(i));
+    current_result_term *= current_multiplier;
+    current_result_term *= error_propagator;
+    result += current_result_term;
+  }
+
+  return;
+}
+
+template <typename C>
+template <typename Target>
+bool
+Linear_Form<C>::intervalize(const FP_Oracle<Target,C>& oracle,
+                            C& result) const {
+  result = C(inhomogeneous_term());
+  dimension_type dimension = space_dimension();
+  for (dimension_type i = 0; i < dimension; ++i) {
+    C current_addend = coefficient(Variable(i));
+    C curr_int;
+    if (!oracle.get_interval(i, curr_int))
+      return false;
+    current_addend *= curr_int;
+    result += current_addend;
+  }
+
+  return true;
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_Form */
+template <typename C>
+std::ostream&
+IO_Operators::operator<<(std::ostream& s, const Linear_Form<C>& f) {
+  const dimension_type num_variables = f.space_dimension();
+  bool first = true;
+  for (dimension_type v = 0; v < num_variables; ++v) {
+    const C& fv = f[v+1];
+    if (fv != typename C::boundary_type(0)) {
+      if (first) {
+        if (fv == typename C::boundary_type(-1))
+          s << "-";
+        else if (fv != typename C::boundary_type(1))
+          s << fv << "*";
+        first = false;
+      }
+      else {
+        if (fv == typename C::boundary_type(-1))
+          s << " - ";
+        else {
+          s << " + ";
+          if (fv != typename C::boundary_type(1))
+            s << fv << "*";
+        }
+      }
+      s << Variable(v);
+    }
+  }
+  // Inhomogeneous term.
+  const C& it = f[0];
+  if (it != 0) {
+    if (!first)
+        s << " + ";
+    else
+      first = false;
+    s << it;
+  }
+
+  if (first)
+    // The null linear form.
+    s << Linear_Form<C>::zero;
+  return s;
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(C, Linear_Form<C>)
+
+template <typename C>
+C Linear_Form<C>::zero(typename C::boundary_type(0));
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Form_templates_hh)
diff --git a/src/Linear_Form_types.hh b/src/Linear_Form_types.hh
new file mode 100644
index 0000000..97a1282
--- /dev/null
+++ b/src/Linear_Form_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Linear_Form_types_hh
+#define PPL_Linear_Form_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename C>
+class Linear_Form;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_Form_types_hh)
diff --git a/src/Linear_System.defs.hh b/src/Linear_System.defs.hh
deleted file mode 100644
index 870cb38..0000000
--- a/src/Linear_System.defs.hh
+++ /dev/null
@@ -1,582 +0,0 @@
-/* Linear_System class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_System_defs_hh
-#define PPL_Linear_System_defs_hh 1
-
-#include "Linear_System.types.hh"
-
-#include "Swapping_Vector.defs.hh"
-#include "globals.defs.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.defs.hh"
-
-#include "Polyhedron.types.hh"
-#include "Bit_Row.types.hh"
-#include "Bit_Matrix.types.hh"
-#include "Generator_System.types.hh"
-#include "Topology.types.hh"
-
-// TODO: Check how much of this description is still true.
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The base class for systems of constraints and generators.
-/*! \ingroup PPL_CXX_interface
-  An object of this class represents either a constraint system
-  or a generator system. Each Linear_System object can be viewed
-  as a finite sequence of strong-normalized Row objects,
-  where each Row implements a constraint or a generator.
-  Linear systems are characterized by the matrix of coefficients,
-  also encoding the number, size and capacity of Row objects,
-  as well as a few additional information, including:
-   - the topological kind of (all) the rows;
-   - an indication of whether or not some of the rows in the Linear_System
-     are <EM>pending</EM>, meaning that they still have to undergo
-     an (unspecified) elaboration; if there are pending rows, then these
-     form a proper suffix of the overall sequence of rows;
-   - a Boolean flag that, when <CODE>true</CODE>, ensures that the
-     non-pending prefix of the sequence of rows is sorted.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-class Parma_Polyhedra_Library::Linear_System {
-public:
-
-  // NOTE: `iterator' is actually a const_iterator.
-  typedef typename Swapping_Vector<Row>::const_iterator iterator;
-  typedef typename Swapping_Vector<Row>::const_iterator const_iterator;
-
-  //! Builds an empty linear system with specified topology.
-  /*!
-    Rows size and capacity are initialized to \f$0\f$.
-  */
-  Linear_System(Topology topol, Representation r);
-
-  //! Builds a system with specified topology and dimensions.
-  /*!
-    \param topol
-    The topology of the system that will be created;
-
-    \param space_dim
-    The number of space dimensions of the system that will be created.
-
-    \param r
-    The representation for system's rows.
-
-    Creates a \p n_rows \f$\times\f$ \p space_dim system whose
-    coefficients are all zero and with the given topology.
-  */
-  Linear_System(Topology topol, dimension_type space_dim, Representation r);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! A tag class.
-  /*! \ingroup PPL_CXX_interface
-    Tag class to differentiate the Linear_System copy constructor that
-    copies pending rows as pending from the one that transforms
-    pending rows into non-pending ones.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  struct With_Pending {
-  };
-
-  //! Copy constructor: pending rows are transformed into non-pending ones.
-  Linear_System(const Linear_System& y);
-
-  //! Copy constructor with specified representation. Pending rows are
-  //! transformed into non-pending ones.
-  Linear_System(const Linear_System& y, Representation r);
-
-  //! Full copy constructor: pending rows are copied as pending.
-  Linear_System(const Linear_System& y, With_Pending);
-
-  //! Full copy constructor: pending rows are copied as pending.
-  Linear_System(const Linear_System& y, Representation r, With_Pending);
-
-  //! Assignment operator: pending rows are transformed into non-pending ones.
-  Linear_System& operator=(const Linear_System& y);
-
-  //! Full assignment operator: pending rows are copied as pending.
-  void assign_with_pending(const Linear_System& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Linear_System& y);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  //! Converts *this to the specified representation.
-  void set_representation(Representation r);
-
-  //! Returns the maximum space dimension a Linear_System can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the space dimension of the rows in the system.
-  /*!
-    The computation of the space dimension correctly ignores
-    the column encoding the inhomogeneous terms of constraint
-    (resp., the divisors of generators);
-    if the system topology is <CODE>NOT_NECESSARILY_CLOSED</CODE>,
-    also the column of the \f$\epsilon\f$-dimension coefficients
-    will be ignored.
-  */
-  dimension_type space_dimension() const;
-
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  void set_space_dimension(dimension_type space_dim);
-
-  //! Makes the system shrink by removing its \p n trailing rows.
-  void remove_trailing_rows(dimension_type n);
-
-  //! Makes the system shrink by removing its i-th row.
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(n).
-
-    Otherwise, this method just swaps the i-th row with the last and then
-    removes it, so it costs O(1).
-  */
-  void remove_row(dimension_type i, bool keep_sorted = false);
-
-  //! Makes the system shrink by removing the rows in [first,last).
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(num_rows()).
-
-    Otherwise, this method just swaps the rows with the last ones and then
-    removes them, so it costs O(last - first).
-  */
-  void remove_rows(dimension_type first, dimension_type last,
-                  bool keep_sorted = false);
-
-  // TODO: Consider removing this.
-  //! Removes the specified rows. The row ordering of remaining rows is
-  //! preserved.
-  /*!
-    \param indexes specifies a list of row indexes.
-                   It must be sorted.
-  */
-  void remove_rows(const std::vector<dimension_type>& indexes);
-
-  // TODO: Consider making this private.
-  //! Removes all the specified dimensions from the system.
-  /*!
-    The space dimension of the variable with the highest space
-    dimension in \p vars must be at most the space dimension
-    of \p this.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  //! Shift by \p n positions the coefficients of variables, starting from
-  //! the coefficient of \p v. This increases the space dimension by \p n.
-  void shift_space_dimensions(Variable v, dimension_type n);
-
-  // TODO: Consider making this private.
-  //! Permutes the space dimensions of the matrix.
-  /*
-    \param cycle
-    A vector representing a cycle of the permutation according to which the
-    space dimensions must be rearranged.
-
-    The \p cycle vector represents a cycle of a permutation of space
-    dimensions.
-    For example, the permutation
-    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
-    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
-  */
-  void permute_space_dimensions(const std::vector<Variable>& cycle);
-
-  //! Swaps the coefficients of the variables \p v1 and \p v2 .
-  void swap_space_dimensions(Variable v1, Variable v2);
-
-  //! \name Subscript operators
-  //@{
-  //! Returns a const reference to the \p k-th row of the system.
-  const Row& operator[](dimension_type k) const;
-  //@} // Subscript operators
-
-  iterator begin();
-  iterator end();
-  const_iterator begin() const;
-  const_iterator end() const;
-
-  bool has_no_rows() const;
-  dimension_type num_rows() const;
-
-  //! Strongly normalizes the system.
-  void strong_normalize();
-
-  //! Sign-normalizes the system.
-  void sign_normalize();
-
-  //! \name Accessors
-  //@{
-  //! Returns the system topology.
-  Topology topology() const;
-
-  //! Returns the value of the sortedness flag.
-  bool is_sorted() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    the system topology is <CODE>NECESSARILY_CLOSED</CODE>.
-  */
-  bool is_necessarily_closed() const;
-
-  /*! \brief
-    Returns the number of rows in the system
-    that represent either lines or equalities.
-  */
-  dimension_type num_lines_or_equalities() const;
-
-  //! Returns the index of the first pending row.
-  dimension_type first_pending_row() const;
-
-  //! Returns the number of rows that are in the pending part of the system.
-  dimension_type num_pending_rows() const;
-  //@} // Accessors
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is sorted,
-    without checking for duplicates.
-  */
-  bool check_sorted() const;
-
-  //! Sets the system topology to \p t .
-  void set_topology(Topology t);
-
-  //! Sets the system topology to <CODE>NECESSARILY_CLOSED</CODE>.
-  void set_necessarily_closed();
-
-  //! Sets the system topology to <CODE>NOT_NECESSARILY_CLOSED</CODE>.
-  void set_not_necessarily_closed();
-
-  // TODO: Consider removing this, or making it private.
-  //! Marks the epsilon dimension as a standard dimension.
-  /*!
-    The system topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is increased by 1.
-  */
-  void mark_as_necessarily_closed();
-
-  // TODO: Consider removing this, or making it private.
-  //! Marks the last dimension as the epsilon dimension.
-  /*!
-    The system topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
-    the number of space dimensions is decreased by 1.
-  */
-  void mark_as_not_necessarily_closed();
-
-  //! Sets the index to indicate that the system has no pending rows.
-  void unset_pending_rows();
-
-  //! Sets the index of the first pending row to \p i.
-  void set_index_first_pending_row(dimension_type i);
-
-  //! Sets the sortedness flag of the system to \p b.
-  void set_sorted(bool b);
-
-  //! Adds \p n rows and space dimensions to the system.
-  /*!
-    \param n
-    The number of rows and space dimensions to be added: must be strictly
-    positive.
-
-    Turns the system \f$M \in \Rset^r \times \Rset^c\f$ into
-    the system \f$N \in \Rset^{r+n} \times \Rset^{c+n}\f$
-    such that
-    \f$N = \bigl(\genfrac{}{}{0pt}{}{0}{M}\genfrac{}{}{0pt}{}{J}{o}\bigr)\f$,
-    where \f$J\f$ is the specular image
-    of the \f$n \times n\f$ identity matrix.
-  */
-  void add_universe_rows_and_space_dimensions(dimension_type n);
-
-  /*! \brief
-    Adds a copy of \p r to the system,
-    automatically resizing the system or the row's copy, if needed.
-  */
-  void insert(const Row& r);
-
-  /*! \brief
-    Adds a copy of the given row to the pending part of the system,
-    automatically resizing the system or the row, if needed.
-  */
-  void insert_pending(const Row& r);
-
-  /*! \brief
-    Adds \p r to the system, stealing its contents and
-    automatically resizing the system or the row, if needed.
-  */
-  void insert(Row& r, Recycle_Input);
-
-  /*! \brief
-    Adds the given row to the pending part of the system, stealing its
-    contents and automatically resizing the system or the row, if needed.
-  */
-  void insert_pending(Row& r, Recycle_Input);
-
-  //! Adds to \p *this a copy of  the rows of \p y.
-  /*!
-    It is assumed that \p *this has no pending rows.
-  */
-  void insert(const Linear_System& y);
-
-  //! Adds a copy of the rows of `y' to the pending part of `*this'.
-  void insert_pending(const Linear_System& r);
-
-  //! Adds to \p *this a the rows of `y', stealing them from `y'.
-  /*!
-    It is assumed that \p *this has no pending rows.
-  */
-  void insert(Linear_System& r, Recycle_Input);
-
-  //! Adds the rows of `y' to the pending part of `*this', stealing them from
-  //! `y'.
-  void insert_pending(Linear_System& r, Recycle_Input);
-
-  /*! \brief
-    Sorts the non-pending rows (in growing order) and eliminates
-    duplicated ones.
-  */
-  void sort_rows();
-
-  /*! \brief
-    Sorts the rows (in growing order) form \p first_row to
-    \p last_row and eliminates duplicated ones.
-  */
-  void sort_rows(dimension_type first_row, dimension_type last_row);
-
-  /*! \brief
-    Assigns to \p *this the result of merging its rows with
-    those of \p y, obtaining a sorted system.
-
-    Duplicated rows will occur only once in the result.
-    On entry, both systems are assumed to be sorted and have
-    no pending rows.
-  */
-  void merge_rows_assign(const Linear_System& y);
-
-  /*! \brief
-    Sorts the pending rows and eliminates those that also occur
-    in the non-pending part of the system.
-  */
-  void sort_pending_and_remove_duplicates();
-
-  /*! \brief
-    Sorts the system, removing duplicates, keeping the saturation
-    matrix consistent.
-
-    \param sat
-    Bit matrix with rows corresponding to the rows of \p *this.
-  */
-  void sort_and_remove_with_sat(Bit_Matrix& sat);
-
-  //! Minimizes the subsystem of equations contained in \p *this.
-  /*!
-    This method works only on the equalities of the system:
-    the system is required to be partially sorted, so that
-    all the equalities are grouped at its top; it is assumed that
-    the number of equalities is exactly \p n_lines_or_equalities.
-    The method finds a minimal system for the equalities and
-    returns its rank, i.e., the number of linearly independent equalities.
-    The result is an upper triangular subsystem of equalities:
-    for each equality, the pivot is chosen starting from
-    the right-most space dimensions.
-  */
-  dimension_type gauss(dimension_type n_lines_or_equalities);
-
-  /*! \brief
-    Back-substitutes the coefficients to reduce
-    the complexity of the system.
-
-    Takes an upper triangular system having \p n_lines_or_equalities rows.
-    For each row, starting from the one having the minimum number of
-    coefficients different from zero, computes the expression of an element
-    as a function of the remaining ones and then substitutes this expression
-    in all the other rows.
-  */
-  void back_substitute(dimension_type n_lines_or_equalities);
-
-  /*! \brief
-    Applies Gaussian elimination and back-substitution so as to
-    simplify the linear system.
-  */
-  void simplify();
-
-  //! Clears the system deallocating all its rows.
-  void clear();
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-
-    Reads into a Linear_System object the information produced by the
-    output of ascii_dump(std::ostream&) const.  The specialized methods
-    provided by Constraint_System and Generator_System take care of
-    properly reading the contents of the system.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! The vector that contains the rows.
-  /*!
-    \note This is public for convenience. Clients that modify if must preserve
-          the class invariant.
-  */
-  Swapping_Vector<Row> rows;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-private:
-  //! Makes the system shrink by removing its i-th row.
-  /*!
-    When \p keep_sorted is \p true and the system is sorted, sortedness will
-    be preserved, but this method costs O(n).
-
-    Otherwise, this method just swaps the i-th row with the last and then
-    removes it, so it costs O(1).
-
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid systems.
-  */
-  void remove_row_no_ok(dimension_type i, bool keep_sorted = false);
-
-  /*! \brief
-    Adds \p r to the pending part of the system, stealing its contents and
-    automatically resizing the system or the row, if needed.
-
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid systems.
-  */
-  void insert_pending_no_ok(Row& r, Recycle_Input);
-
-  /*! \brief
-    Adds \p r to the system, stealing its contents and
-    automatically resizing the system or the row, if needed.
-
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid systems.
-  */
-  void insert_no_ok(Row& r, Recycle_Input);
-
-  //! Sets the space dimension of the rows in the system to \p space_dim .
-  /*!
-    This method is for internal use, it does *not* assert OK() at the end,
-    so it can be used for invalid systems.
-  */
-  void set_space_dimension_no_ok(dimension_type space_dim);
-
-  //! Swaps the [first,last) row interval with the
-  //! [first + offset, last + offset) interval.
-  /*!
-    These intervals may not be disjunct.
-
-    Sorting of these intervals is *not* preserved.
-
-    Either both intervals contain only not-pending rows, or they both
-    contain pending rows.
-  */
-  void swap_row_intervals(dimension_type first, dimension_type last,
-                          dimension_type offset);
-
-  //! The space dimension of each row. All rows must have this number of
-  //! space dimensions.
-  dimension_type space_dimension_;
-
-  //! The topological kind of the rows in the system. All rows must have this
-  //! topology.
-  Topology row_topology;
-
-  //! The index of the first pending row.
-  dimension_type index_first_pending;
-
-  /*! \brief
-    <CODE>true</CODE> if rows are sorted in the ascending order as defined by
-    <CODE>bool compare(const Row&, const Row&)</CODE>.
-    If <CODE>false</CODE> may not be sorted.
-  */
-  bool sorted;
-
-  Representation representation_;
-
-  //! Ordering predicate (used when implementing the sort algorithm).
-  struct Row_Less_Than {
-    bool operator()(const Row& x, const Row& y) const;
-  };
-
-  //! Comparison predicate (used when implementing the unique algorithm).
-  struct Unique_Compare {
-    Unique_Compare(const Swapping_Vector<Row>& cont,
-                   dimension_type base = 0);
-
-    bool operator()(dimension_type i, dimension_type j) const;
-
-    const Swapping_Vector<Row>& container;
-    const dimension_type base_index;
-  };
-
-  friend class Polyhedron;
-  friend class Generator_System;
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates Linear_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-void swap(Parma_Polyhedra_Library::Linear_System<Row>& x,
-          Parma_Polyhedra_Library::Linear_System<Row>& y);
-
-} // namespace std
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates Linear_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-bool operator==(const Linear_System<Row>& x, const Linear_System<Row>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Linear_System */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-bool operator!=(const Linear_System<Row>& x, const Linear_System<Row>& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Linear_System.inlines.hh"
-#include "Linear_System.templates.hh"
-
-#endif // !defined(PPL_Linear_System_defs_hh)
diff --git a/src/Linear_System.inlines.hh b/src/Linear_System.inlines.hh
deleted file mode 100644
index 8b20e01..0000000
--- a/src/Linear_System.inlines.hh
+++ /dev/null
@@ -1,692 +0,0 @@
-/* Linear_System class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_System_inlines_hh
-#define PPL_Linear_System_inlines_hh 1
-
-#include "Bit_Row.defs.hh"
-#include "Coefficient.defs.hh"
-
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-inline memory_size_type
-Linear_System<Row>::external_memory_in_bytes() const {
-  return rows.external_memory_in_bytes();
-}
-
-template <typename Row>
-inline memory_size_type
-Linear_System<Row>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename Row>
-inline bool
-Linear_System<Row>::is_sorted() const {
-  // The flag `sorted' does not really reflect the sortedness status
-  // of a system (if `sorted' evaluates to `false' nothing is known).
-  // This assertion is used to ensure that the system
-  // is actually sorted when `sorted' value is 'true'.
-  PPL_ASSERT(!sorted || check_sorted());
-  return sorted;
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_sorted(const bool b) {
-  sorted = b;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Linear_System(Topology topol, Representation r)
-  : rows(),
-    space_dimension_(0),
-    row_topology(topol),
-    index_first_pending(0),
-    sorted(true),
-    representation_(r) {
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Linear_System(Topology topol,
-                                  dimension_type space_dim,
-                                  Representation r)
-  : rows(),
-    space_dimension_(0),
-    row_topology(topol),
-    index_first_pending(0),
-    sorted(true),
-    representation_(r) {
-  set_space_dimension(space_dim);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline dimension_type
-Linear_System<Row>::first_pending_row() const {
-  return index_first_pending;
-}
-
-template <typename Row>
-inline dimension_type
-Linear_System<Row>::num_pending_rows() const {
-  PPL_ASSERT(num_rows() >= first_pending_row());
-  return num_rows() - first_pending_row();
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::unset_pending_rows() {
-  index_first_pending = num_rows();
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_index_first_pending_row(const dimension_type i) {
-  index_first_pending = i;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Linear_System(const Linear_System& y)
-  : rows(y.rows),
-    space_dimension_(y.space_dimension_),
-    row_topology(y.row_topology),
-    representation_(y.representation_) {
-  // Previously pending rows may violate sortedness.
-  sorted = (y.num_pending_rows() > 0) ? false : y.sorted;
-  unset_pending_rows();
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Linear_System(const Linear_System& y, Representation r)
-  : rows(),
-    space_dimension_(y.space_dimension_),
-    row_topology(y.row_topology),
-    representation_(r) {
-  rows.resize(y.num_rows());
-  for (dimension_type i = 0; i < y.num_rows(); ++i) {
-    // Create the copies with the right representation.
-    Row row(y.rows[i], r);
-    swap(rows[i], row);
-  }
-  // Previously pending rows may violate sortedness.
-  sorted = (y.num_pending_rows() > 0) ? false : y.sorted;
-  unset_pending_rows();
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Linear_System(const Linear_System& y, With_Pending)
-  : rows(y.rows),
-    space_dimension_(y.space_dimension_),
-    row_topology(y.row_topology),
-    index_first_pending(y.index_first_pending),
-    sorted(y.sorted),
-    representation_(y.representation_) {
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Linear_System(const Linear_System& y, Representation r,
-                                  With_Pending)
-  : rows(),
-    space_dimension_(y.space_dimension_),
-    row_topology(y.row_topology),
-    index_first_pending(y.index_first_pending),
-    sorted(y.sorted),
-    representation_(r) {
-  rows.resize(y.num_rows());
-  for (dimension_type i = 0; i < y.num_rows(); ++i) {
-    // Create the copies with the right representation.
-    Row row(y.rows[i], r);
-    swap(rows[i], row);
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline Linear_System<Row>&
-Linear_System<Row>::operator=(const Linear_System& y) {
-  // NOTE: Pending rows are transformed into non-pending ones.
-  Linear_System<Row> tmp = y;
-  swap(*this, tmp);
-  return *this;
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::assign_with_pending(const Linear_System& y) {
-  Linear_System<Row> tmp(y, With_Pending());
-  swap(*this, tmp);
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::m_swap(Linear_System& y) {
-  using std::swap;
-  swap(rows, y.rows);
-  swap(space_dimension_, y.space_dimension_);
-  swap(row_topology, y.row_topology);
-  swap(index_first_pending, y.index_first_pending);
-  swap(sorted, y.sorted);
-  swap(representation_, y.representation_);
-  PPL_ASSERT(OK());
-  PPL_ASSERT(y.OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::clear() {
-  // Note: do NOT modify the value of `row_topology' and `representation'.
-  rows.clear();
-  index_first_pending = 0;
-  sorted = true;
-  space_dimension_ = 0;
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::mark_as_necessarily_closed() {
-  PPL_ASSERT(topology() == NOT_NECESSARILY_CLOSED);
-  row_topology = NECESSARILY_CLOSED;
-  ++space_dimension_;
-  for (dimension_type i = num_rows(); i-- > 0; )
-    rows[i].mark_as_necessarily_closed();
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::mark_as_not_necessarily_closed() {
-  PPL_ASSERT(topology() == NECESSARILY_CLOSED);
-  PPL_ASSERT(space_dimension() > 0);
-  row_topology = NOT_NECESSARILY_CLOSED;
-  --space_dimension_;
-  for (dimension_type i = num_rows(); i-- > 0; )
-    rows[i].mark_as_not_necessarily_closed();
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_topology(Topology t) {
-  if (topology() == t)
-    return;
-  for (dimension_type i = num_rows(); i-- > 0; )
-    rows[i].set_topology(t);
-  row_topology = t;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_necessarily_closed() {
-  set_topology(NECESSARILY_CLOSED);
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_not_necessarily_closed() {
-  set_topology(NOT_NECESSARILY_CLOSED);
-}
-
-template <typename Row>
-inline bool
-Linear_System<Row>::is_necessarily_closed() const {
-  return row_topology == NECESSARILY_CLOSED;
-}
-
-template <typename Row>
-inline const Row&
-Linear_System<Row>::operator[](const dimension_type k) const {
-  return rows[k];
-}
-
-template <typename Row>
-inline typename Linear_System<Row>::iterator
-Linear_System<Row>::begin() {
-  return rows.begin();
-}
-
-template <typename Row>
-inline typename Linear_System<Row>::iterator
-Linear_System<Row>::end() {
-  return rows.end();
-}
-
-template <typename Row>
-inline typename Linear_System<Row>::const_iterator
-Linear_System<Row>::begin() const {
-  return rows.begin();
-}
-
-template <typename Row>
-inline typename Linear_System<Row>::const_iterator
-Linear_System<Row>::end() const {
-  return rows.end();
-}
-
-template <typename Row>
-inline bool
-Linear_System<Row>::has_no_rows() const {
-  return rows.empty();
-}
-
-template <typename Row>
-inline dimension_type
-Linear_System<Row>::num_rows() const {
-  return rows.size();
-}
-
-template <typename Row>
-inline Topology
-Linear_System<Row>::topology() const {
-  return row_topology;
-}
-
-template <typename Row>
-inline Representation
-Linear_System<Row>::representation() const {
-  return representation_;
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_representation(Representation r) {
-  representation_ = r;
-  for (dimension_type i = 0; i < rows.size(); ++i)
-    rows[i].set_representation(r);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline dimension_type
-Linear_System<Row>::max_space_dimension() {
-  return Row::max_space_dimension();
-}
-
-template <typename Row>
-inline dimension_type
-Linear_System<Row>::space_dimension() const {
-  return space_dimension_;
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_space_dimension_no_ok(dimension_type space_dim) {
-  for (dimension_type i = rows.size(); i-- > 0; )
-    rows[i].set_space_dimension_no_ok(space_dim);
-  space_dimension_ = space_dim;
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::set_space_dimension(dimension_type space_dim) {
-  set_space_dimension_no_ok(space_dim);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::remove_row_no_ok(const dimension_type i,
-                                     const bool keep_sorted) {
-  PPL_ASSERT(i < num_rows());
-  bool was_pending = (i >= index_first_pending);
-
-  if (sorted && keep_sorted && !was_pending) {
-    for (dimension_type j = i + 1; j < rows.size(); ++j)
-      swap(rows[j], rows[j-1]);
-    rows.pop_back();
-  } else {
-    if (!was_pending)
-      sorted = false;
-    bool last_row_is_pending = (num_rows() - 1 >= index_first_pending);
-    if (was_pending == last_row_is_pending)
-      // Either both rows are pending or both rows are not pending.
-      swap(rows[i], rows.back());
-    else {
-      // Pending rows are stored after the non-pending ones.
-      PPL_ASSERT(!was_pending);
-      PPL_ASSERT(last_row_is_pending);
-
-      // Swap the row with the last non-pending row.
-      swap(rows[i], rows[index_first_pending - 1]);
-
-      // Now the (non-pending) row that has to be deleted is between the
-      // non-pending and the pending rows.
-      swap(rows[i], rows.back());
-    }
-    rows.pop_back();
-  }
-  if (!was_pending)
-    // A non-pending row has been removed.
-    --index_first_pending;
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::remove_row(const dimension_type i, bool keep_sorted) {
-  remove_row_no_ok(i, keep_sorted);
-  PPL_ASSERT(OK());
-}
-
-
-template <typename Row>
-inline void
-Linear_System<Row>::remove_rows(dimension_type first,
-                                dimension_type last,
-                                bool keep_sorted) {
-  PPL_ASSERT(first <= last);
-  PPL_ASSERT(last <= num_rows());
-  const dimension_type n = last - first;
-
-  if (n == 0)
-    return;
-
-  // All the rows that have to be removed must have the same (pending or
-  // non-pending) status.
-  PPL_ASSERT(first >= index_first_pending || last <= index_first_pending);
-
-  bool were_pending = (first >= index_first_pending);
-
-  // Move the rows in [first,last) at the end of the system.
-  if (sorted && keep_sorted && !were_pending) {
-    // Preserve the row ordering.
-    for (dimension_type i = last; i < rows.size(); ++i)
-      swap(rows[i], rows[i - n]);
-
-    rows.resize(rows.size() - n);
-
-    // `n' non-pending rows have been removed.
-    index_first_pending -= n;
-
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // We can ignore the row ordering, but we must not mix pending and
-  // non-pending rows.
-
-  dimension_type offset = rows.size() - n - first;
-  // We want to swap the rows in [first, last) and
-  // [first + offset, last + offset) (note that these intervals may not be
-  // disjunct).
-
-  if (index_first_pending == num_rows()) {
-    // There are no pending rows.
-    PPL_ASSERT(!were_pending);
-
-    swap_row_intervals(first, last, offset);
-
-    rows.resize(rows.size() - n);
-
-    // `n' non-pending rows have been removed.
-    index_first_pending -= n;
-  } else {
-    // There are some pending rows in [first + offset, last + offset).
-    if (were_pending) {
-      // Both intervals contain only pending rows, because the second
-      // interval is after the first.
-
-      swap_row_intervals(first, last, offset);
-
-      rows.resize(rows.size() - n);
-
-      // `n' non-pending rows have been removed.
-      index_first_pending -= n;
-    } else {
-      PPL_ASSERT(rows.size() - n < index_first_pending);
-      PPL_ASSERT(rows.size() > index_first_pending);
-      PPL_ASSERT(!were_pending);
-      // In the [size() - n, size()) interval there are some non-pending
-      // rows and some pending ones. Be careful not to mix them.
-
-      PPL_ASSERT(index_first_pending >= last);
-      swap_row_intervals(first, last, index_first_pending - last);
-
-      // Mark the rows that must be deleted as pending.
-      index_first_pending -= n;
-      first = index_first_pending;
-      last = first + n;
-
-      // Move them at the end of the system.
-      swap_row_intervals(first, last, num_rows() - last);
-
-      // Actually remove the rows.
-      rows.resize(rows.size() - n);
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::swap_row_intervals(dimension_type first,
-                                       dimension_type last,
-                                       dimension_type offset) {
-  PPL_ASSERT(first <= last);
-  PPL_ASSERT(last + offset <= num_rows());
-#ifndef NDEBUG
-  if (first < last) {
-    bool first_interval_has_pending_rows = (last > index_first_pending);
-    bool second_interval_has_pending_rows = (last + offset > index_first_pending);
-    bool first_interval_has_not_pending_rows = (first < index_first_pending);
-    bool second_interval_has_not_pending_rows = (first + offset < index_first_pending);
-    PPL_ASSERT(first_interval_has_not_pending_rows
-               == !first_interval_has_pending_rows);
-    PPL_ASSERT(second_interval_has_not_pending_rows
-               == !second_interval_has_pending_rows);
-    PPL_ASSERT(first_interval_has_pending_rows
-               == second_interval_has_pending_rows);
-  }
-#endif
-  if (first + offset < last) {
-    // The intervals are not disjunct, make them so.
-    const dimension_type k = last - first - offset;
-    last -= k;
-    offset += k;
-  }
-
-  if (first == last)
-    // Nothing to do.
-    return;
-
-  for (dimension_type i = first; i < last; ++i)
-    swap(rows[i], rows[i + offset]);
-
-  if (first < index_first_pending)
-    // The swaps involved not pending rows, so they may not be sorted anymore.
-    set_sorted(false);
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::remove_rows(const std::vector<dimension_type>& indexes) {
-#ifndef NDEBUG
-  {
-    // Check that `indexes' is sorted.
-    std::vector<dimension_type> sorted_indexes = indexes;
-    std::sort(sorted_indexes.begin(), sorted_indexes.end());
-    PPL_ASSERT(indexes == sorted_indexes);
-
-    // Check that the last index (if any) is lower than num_rows().
-    // This guarantees that all indexes are in [0, num_rows()).
-    if (!indexes.empty())
-      PPL_ASSERT(indexes.back() < num_rows());
-  }
-#endif
-
-  if (indexes.empty())
-    return;
-
-  const dimension_type rows_size = rows.size();
-  typedef std::vector<dimension_type>::const_iterator itr_t;
-
-  // `i' and last_unused_row' start with the value `indexes[0]' instead
-  // of `0', because the loop would just increment `last_unused_row' in the
-  // preceding iterations.
-  dimension_type last_unused_row = indexes[0];
-  dimension_type i = indexes[0];
-  itr_t itr = indexes.begin();
-  itr_t itr_end = indexes.end();
-  while (itr != itr_end) {
-    // i <= *itr < rows_size
-    PPL_ASSERT(i < rows_size);
-    if (*itr == i) {
-      // The current row has to be removed, don't increment last_unused_row.
-      ++itr;
-    } else {
-      // The current row must not be removed, swap it after the last used row.
-      swap(rows[last_unused_row], rows[i]);
-      ++last_unused_row;
-    }
-    ++i;
-  }
-
-  // Move up the remaining rows, if any.
-  for ( ; i < rows_size; ++i) {
-    swap(rows[last_unused_row], rows[i]);
-    ++last_unused_row;
-  }
-
-  PPL_ASSERT(last_unused_row == num_rows() - indexes.size());
-
-  // The rows that have to be removed are now at the end of the system, just
-  // remove them.
-  rows.resize(last_unused_row);
-
-  // Adjust index_first_pending.
-  if (indexes[0] >= index_first_pending) {
-    // Removing pending rows only.
-  } else {
-    if (indexes.back() < index_first_pending) {
-      // Removing non-pending rows only.
-      index_first_pending -= indexes.size();
-    } else {
-      // Removing some pending and some non-pending rows, count the
-      // non-pending rows that must be removed.
-      // This exploits the fact that `indexes' is sorted by using binary
-      // search.
-      itr_t j = std::lower_bound(indexes.begin(), indexes.end(),
-                                 index_first_pending);
-      std::iterator_traits<itr_t>::difference_type
-        non_pending = j - indexes.begin();
-      index_first_pending -= static_cast<dimension_type>(non_pending);
-    }
-  }
-
-  // NOTE: This method does *not* call set_sorted(false), because it preserves
-  // the relative row ordering.
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>::remove_trailing_rows(const dimension_type n) {
-  PPL_ASSERT(rows.size() >= n);
-  rows.resize(rows.size() - n);
-  if (first_pending_row() > rows.size())
-    index_first_pending = rows.size();
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>
-::permute_space_dimensions(const std::vector<Variable>& cycle) {
-  for (dimension_type i = num_rows(); i-- > 0; )
-    rows[i].permute_space_dimensions(cycle);
-  sorted = false;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Linear_System<Row>
-::swap_space_dimensions(Variable v1, Variable v2) {
-  PPL_ASSERT(v1.space_dimension() <= space_dimension());
-  PPL_ASSERT(v2.space_dimension() <= space_dimension());
-  for (dimension_type k = num_rows(); k-- > 0; )
-    rows[k].swap_space_dimensions(v1, v2);
-  sorted = false;
-  PPL_ASSERT(OK());
-}
-
-/*! \relates Linear_System */
-template <typename Row>
-inline bool
-operator!=(const Linear_System<Row>& x, const Linear_System<Row>& y) {
-  return !(x == y);
-}
-
-template <typename Row>
-inline bool
-Linear_System<Row>::Row_Less_Than::operator()(const Row& x,
-                                              const Row& y) const {
-  return compare(x, y) < 0;
-}
-
-template <typename Row>
-inline
-Linear_System<Row>::Unique_Compare
-::Unique_Compare(const Swapping_Vector<Row>& cont,
-                 dimension_type base)
-  : container(cont), base_index(base) {
-}
-
-template <typename Row>
-inline bool
-Linear_System<Row>::Unique_Compare
-::operator()(dimension_type i, dimension_type j) const {
-  return container[base_index + i].is_equal_to(container[base_index + j]);
-}
-
-/*! \relates Linear_System */
-template <typename Row>
-inline void
-swap(Linear_System<Row>& x, Linear_System<Row>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_System_inlines_hh)
diff --git a/src/Linear_System.templates.hh b/src/Linear_System.templates.hh
deleted file mode 100644
index 58b88ee..0000000
--- a/src/Linear_System.templates.hh
+++ /dev/null
@@ -1,923 +0,0 @@
-/* Linear_System class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Linear_System_templates_hh
-#define PPL_Linear_System_templates_hh 1
-
-#include "Bit_Matrix.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include <algorithm>
-#include <iostream>
-#include <string>
-#include <deque>
-
-#include "swapping_sort.templates.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-dimension_type
-Linear_System<Row>::num_lines_or_equalities() const {
-  PPL_ASSERT(num_pending_rows() == 0);
-  const Linear_System& x = *this;
-  dimension_type n = 0;
-  for (dimension_type i = num_rows(); i-- > 0; )
-    if (x[i].is_line_or_equality())
-      ++n;
-  return n;
-}
-
-template <typename Row>
-void
-Linear_System<Row>::merge_rows_assign(const Linear_System& y) {
-  PPL_ASSERT(space_dimension() >= y.space_dimension());
-  // Both systems have to be sorted and have no pending rows.
-  PPL_ASSERT(check_sorted() && y.check_sorted());
-  PPL_ASSERT(num_pending_rows() == 0 && y.num_pending_rows() == 0);
-
-  Linear_System& x = *this;
-
-  // A temporary vector...
-  Swapping_Vector<Row> tmp;
-  // ... with enough capacity not to require any reallocations.
-  tmp.reserve(compute_capacity(x.rows.size() + y.rows.size(),
-                               tmp.max_num_rows()));
-
-  dimension_type xi = 0;
-  dimension_type x_num_rows = x.num_rows();
-  dimension_type yi = 0;
-  dimension_type y_num_rows = y.num_rows();
-
-  while (xi < x_num_rows && yi < y_num_rows) {
-    const int comp = compare(x[xi], y[yi]);
-    if (comp <= 0) {
-      // Elements that can be taken from `x' are actually _stolen_ from `x'
-      tmp.resize(tmp.size() + 1);
-      swap(tmp.back(), x.rows[xi++]);
-      tmp.back().set_representation(representation());
-      if (comp == 0)
-	// A duplicate element.
-	++yi;
-    }
-    else {
-      // (comp > 0)
-      tmp.resize(tmp.size() + 1);
-      Row copy(y[yi++], space_dimension(), representation());
-      swap(tmp.back(), copy);
-    }
-  }
-  // Insert what is left.
-  if (xi < x_num_rows)
-    while (xi < x_num_rows) {
-      tmp.resize(tmp.size() + 1);
-      swap(tmp.back(), x.rows[xi++]);
-      tmp.back().set_representation(representation());
-    }
-  else
-    while (yi < y_num_rows) {
-      tmp.resize(tmp.size() + 1);
-      Row copy(y[yi++], space_dimension(), representation());
-      swap(tmp.back(), copy);
-    }
-
-  // We get the result matrix and let the old one be destroyed.
-  swap(tmp, rows);
-  // There are no pending rows.
-  unset_pending_rows();
-  PPL_ASSERT(check_sorted());
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::ascii_dump(std::ostream& s) const {
-  // Prints the topology, the number of rows, the number of columns
-  // and the sorted flag.  The specialized methods provided by
-  // Constraint_System and Generator_System take care of properly
-  // printing the contents of the system.
-  s << "topology " << (is_necessarily_closed()
-		       ? "NECESSARILY_CLOSED"
-		       : "NOT_NECESSARILY_CLOSED")
-    << "\n"
-    << num_rows() << " x " << space_dimension() << " ";
-  Parma_Polyhedra_Library::ascii_dump(s, representation());
-  s << " " << (sorted ? "(sorted)" : "(not_sorted)")
-    << "\n"
-    << "index_first_pending " << first_pending_row()
-    << "\n";
-  for (dimension_type i = 0; i < rows.size(); ++i)
-    rows[i].ascii_dump(s);
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(Row, Linear_System<Row>)
-
-template <typename Row>
-bool
-Linear_System<Row>::ascii_load(std::istream& s) {
-  std::string str;
-  if (!(s >> str) || str != "topology")
-    return false;
-  if (!(s >> str))
-    return false;
-
-  clear();
-
-  Topology t;
-  if (str == "NECESSARILY_CLOSED")
-    t = NECESSARILY_CLOSED;
-  else {
-    if (str != "NOT_NECESSARILY_CLOSED")
-      return false;
-    t = NOT_NECESSARILY_CLOSED;
-  }
-
-  set_topology(t);
-
-  dimension_type nrows;
-  dimension_type space_dims;
-  if (!(s >> nrows))
-    return false;
-  if (!(s >> str) || str != "x")
-    return false;
-  if (!(s >> space_dims))
-    return false;
-
-  space_dimension_ = space_dims;
-
-  if (!Parma_Polyhedra_Library::ascii_load(s, representation_))
-    return false;
-
-  if (!(s >> str) || (str != "(sorted)" && str != "(not_sorted)"))
-    return false;
-  bool sortedness = (str == "(sorted)");
-  dimension_type index;
-  if (!(s >> str) || str != "index_first_pending")
-    return false;
-  if (!(s >> index))
-    return false;
-
-  Row row;
-  for (dimension_type i = 0; i < nrows; ++i) {
-    if (!row.ascii_load(s))
-      return false;
-    insert(row, Recycle_Input());
-  }
-  index_first_pending = index;
-  sorted = sortedness;
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert(const Row& r) {
-  Row tmp(r, representation());
-  insert(tmp, Recycle_Input());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert(Row& r, Recycle_Input) {
-  insert_no_ok(r, Recycle_Input());
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert_no_ok(Row& r, Recycle_Input) {
-  PPL_ASSERT(topology() == r.topology());
-  // This method is only used when the system has no pending rows.
-  PPL_ASSERT(num_pending_rows() == 0);
-
-  const bool was_sorted = is_sorted();
-
-  insert_pending_no_ok(r, Recycle_Input());
-
-  if (was_sorted) {
-    const dimension_type nrows = num_rows();
-    // The added row may have caused the system to be not sorted anymore.
-    if (nrows > 1) {
-      // If the system is not empty and the inserted row is the
-      // greatest one, the system is set to be sorted.
-      // If it is not the greatest one then the system is no longer sorted.
-      sorted = (compare(rows[nrows-2], rows[nrows-1]) <= 0);
-    }
-    else
-      // A system having only one row is sorted.
-      sorted = true;
-  }
-
-  unset_pending_rows();
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert_pending_no_ok(Row& r, Recycle_Input) {
-  // TODO: A Grid_Generator_System may contain non-normalized lines that
-  // represent parameters, so this check is disabled. Consider re-enabling it
-  // when it's possibile.
-  /*
-    // The added row must be strongly normalized and have the same
-    // number of elements as the existing rows of the system.
-    PPL_ASSERT(r.check_strong_normalized());
-  */
-  PPL_ASSERT(r.topology() == topology());
-
-  r.set_representation(representation());
-
-  if (space_dimension() < r.space_dimension())
-    set_space_dimension_no_ok(r.space_dimension());
-  else
-    r.set_space_dimension_no_ok(space_dimension());
-
-  rows.resize(rows.size() + 1);
-  swap(rows.back(), r);
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert_pending(const Row& r) {
-  Row tmp(r, representation());
-  insert_pending(tmp, Recycle_Input());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert_pending(Row& r, Recycle_Input) {
-  insert_pending_no_ok(r, Recycle_Input());
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert_pending(const Linear_System& y) {
-  Linear_System tmp(y, representation(), With_Pending());
-  insert_pending(tmp, Recycle_Input());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert_pending(Linear_System& y, Recycle_Input) {
-  Linear_System& x = *this;
-  PPL_ASSERT(x.space_dimension() == y.space_dimension());
-
-  // Steal the rows of `y'.
-  // This loop must use an increasing index (instead of a decreasing one) to
-  // preserve the row ordering.
-  for (dimension_type i = 0; i < y.num_rows(); ++i)
-    x.insert_pending(y.rows[i], Recycle_Input());
-
-  y.clear();
-
-  PPL_ASSERT(x.OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert(const Linear_System& y) {
-  Linear_System tmp(y, representation(), With_Pending());
-  insert(tmp, Recycle_Input());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::insert(Linear_System& y, Recycle_Input) {
-  PPL_ASSERT(num_pending_rows() == 0);
-
-  // Adding no rows is a no-op.
-  if (y.has_no_rows())
-    return;
-
-  // Check if sortedness is preserved.
-  if (is_sorted()) {
-    if (!y.is_sorted() || y.num_pending_rows() > 0)
-      sorted = false;
-    else {
-      // `y' is sorted and has no pending rows.
-      const dimension_type n_rows = num_rows();
-      if (n_rows > 0)
-        sorted = (compare(rows[n_rows-1], y[0]) <= 0);
-    }
-  }
-
-  // Add the rows of `y' as if they were pending.
-  insert_pending(y, Recycle_Input());
-
-  // TODO: May y have pending rows? Should they remain pending?
-
-  // There are no pending_rows.
-  unset_pending_rows();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::remove_space_dimensions(const Variables_Set& vars) {
-  // Dimension-compatibility assertion.
-  PPL_ASSERT(space_dimension() >= vars.space_dimension());
-
-  // The removal of no dimensions from any system is a no-op.  This
-  // case also captures the only legal removal of dimensions from a
-  // 0-dim system.
-  if (vars.empty())
-    return;
-
-  // NOTE: num_rows() is *not* constant, because it may be decreased by
-  // remove_row_no_ok().
-  for (dimension_type i = 0; i < num_rows(); ) {
-    bool valid = rows[i].remove_space_dimensions(vars);
-    if (!valid) {
-      // Remove the current row.
-      // We can't call remove_row(i) here, because the system is not OK as
-      // some rows already have the new space dimension and others still have
-      // the old one.
-      remove_row_no_ok(i, false);
-    } else
-      ++i;
-  }
-
-  space_dimension_ -= vars.size();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::shift_space_dimensions(Variable v, dimension_type n) {
-  // NOTE: v.id() may be equal to the space dimension of the system
-  // (when no space dimension need to be shifted).
-  PPL_ASSERT(v.id() <= space_dimension());
-  for (dimension_type i = rows.size(); i-- > 0; )
-    rows[i].shift_space_dimensions(v, n);
-  space_dimension_ += n;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::sort_rows() {
-  // We sort the non-pending rows only.
-  sort_rows(0, first_pending_row());
-  sorted = true;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::sort_rows(const dimension_type first_row,
-			      const dimension_type last_row) {
-  PPL_ASSERT(first_row <= last_row && last_row <= num_rows());
-  // We cannot mix pending and non-pending rows.
-  PPL_ASSERT(first_row >= first_pending_row()
-             || last_row <= first_pending_row());
-
-  bool sorting_pending = (first_row >= first_pending_row());
-  const dimension_type old_num_pending = num_pending_rows();
-
-  const dimension_type num_elems = last_row - first_row;
-  if (num_elems < 2)
-    return;
-
-  // Build the function objects implementing indirect sort comparison,
-  // indirect unique comparison and indirect swap operation.
-  using namespace Implementation;
-  typedef Swapping_Vector<Row> Cont;
-  typedef Indirect_Sort_Compare<Cont, Row_Less_Than> Sort_Compare;
-  typedef Indirect_Swapper<Cont> Swapper;
-  const dimension_type num_duplicates
-    = indirect_sort_and_unique(num_elems,
-                               Sort_Compare(rows, first_row),
-                               Unique_Compare(rows, first_row),
-                               Swapper(rows, first_row));
-
-  if (num_duplicates > 0) {
-    typedef typename Cont::iterator Iter;
-    typedef typename std::iterator_traits<Iter>::difference_type diff_t;
-    Iter last = rows.begin() + static_cast<diff_t>(last_row);
-    Iter first = last - + static_cast<diff_t>(num_duplicates);
-    rows.erase(first, last);
-  }
-
-  if (sorting_pending) {
-    PPL_ASSERT(old_num_pending >= num_duplicates);
-    index_first_pending = num_rows() - (old_num_pending - num_duplicates);
-  } else {
-    index_first_pending = num_rows() - old_num_pending;
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::strong_normalize() {
-  const dimension_type nrows = rows.size();
-  // We strongly normalize also the pending rows.
-  for (dimension_type i = nrows; i-- > 0; )
-    rows[i].strong_normalize();
-  sorted = (nrows <= 1);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::sign_normalize() {
-  const dimension_type nrows = rows.size();
-  // We sign-normalize also the pending rows.
-  for (dimension_type i = nrows; i-- > 0; )
-    rows[i].sign_normalize();
-  sorted = (nrows <= 1);
-  PPL_ASSERT(OK());
-}
-
-/*! \relates Parma_Polyhedra_Library::Linear_System */
-template <typename Row>
-bool
-operator==(const Linear_System<Row>& x, const Linear_System<Row>& y) {
-  if (x.space_dimension() != y.space_dimension())
-    return false;
-  const dimension_type x_num_rows = x.num_rows();
-  const dimension_type y_num_rows = y.num_rows();
-  if (x_num_rows != y_num_rows)
-    return false;
-  if (x.first_pending_row() != y.first_pending_row())
-    return false;
-  // TODO: Check if the following comment is up to date.
-  // Notice that calling operator==(const Swapping_Vector<Row>&,
-  //                                const Swapping_Vector<Row>&)
-  // would be wrong here, as equality of the type fields would
-  // not be checked.
-  for (dimension_type i = x_num_rows; i-- > 0; )
-    if (x[i] != y[i])
-      return false;
-  return true;
-}
-
-template <typename Row>
-void
-Linear_System<Row>::sort_and_remove_with_sat(Bit_Matrix& sat) {
-  // We can only sort the non-pending part of the system.
-  PPL_ASSERT(first_pending_row() == sat.num_rows());
-  if (first_pending_row() <= 1) {
-    set_sorted(true);
-    return;
-  }
-
-  const dimension_type num_elems = sat.num_rows();
-  // Build the function objects implementing indirect sort comparison,
-  // indirect unique comparison and indirect swap operation.
-  typedef Swapping_Vector<Row> Cont;
-  Implementation::Indirect_Sort_Compare<Cont, Row_Less_Than> sort_cmp(rows);
-  Unique_Compare unique_cmp(rows);
-  Implementation::Indirect_Swapper2<Cont, Bit_Matrix> swapper(rows, sat);
-
-  const dimension_type num_duplicates
-    = Implementation::indirect_sort_and_unique(num_elems, sort_cmp, unique_cmp, swapper);
-
-  const dimension_type new_first_pending_row
-    = first_pending_row() - num_duplicates;
-
-  if (num_pending_rows() > 0) {
-    // In this case, we must put the duplicates after the pending rows.
-    const dimension_type n_rows = num_rows() - 1;
-    for (dimension_type i = 0; i < num_duplicates; ++i)
-      swap(rows[new_first_pending_row + i], rows[n_rows - i]);
-  }
-
-  // Erasing the duplicated rows...
-  rows.resize(rows.size() - num_duplicates);
-  index_first_pending = new_first_pending_row;
-  // ... and the corresponding rows of the saturation matrix.
-  sat.remove_trailing_rows(num_duplicates);
-
-  // Now the system is sorted.
-  sorted = true;
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-dimension_type
-Linear_System<Row>::gauss(const dimension_type n_lines_or_equalities) {
-  // This method is only applied to a linear system having no pending rows and
-  // exactly `n_lines_or_equalities' lines or equalities, all of which occur
-  // before the rays or points or inequalities.
-  PPL_ASSERT(num_pending_rows() == 0);
-  PPL_ASSERT(n_lines_or_equalities == num_lines_or_equalities());
-#ifndef NDEBUG
-  for (dimension_type i = n_lines_or_equalities; i-- > 0; )
-    PPL_ASSERT((*this)[i].is_line_or_equality());
-#endif
-
-  dimension_type rank = 0;
-  // Will keep track of the variations on the system of equalities.
-  bool changed = false;
-  // TODO: Don't use the number of columns.
-  const dimension_type num_cols
-    = is_necessarily_closed() ? space_dimension() + 1 : space_dimension() + 2;
-  // TODO: Consider exploiting the row (possible) sparseness of rows in the
-  // following loop, if needed. It would probably make it more cache-efficient
-  // for dense rows, too.
-  for (dimension_type j = num_cols; j-- > 0; )
-    for (dimension_type i = rank; i < n_lines_or_equalities; ++i) {
-      // Search for the first row having a non-zero coefficient
-      // (the pivot) in the j-th column.
-      if ((*this)[i].expr.get(j) == 0)
-	continue;
-      // Pivot found: if needed, swap rows so that this one becomes
-      // the rank-th row in the linear system.
-      if (i > rank) {
-	swap(rows[i], rows[rank]);
-	// After swapping the system is no longer sorted.
-	changed = true;
-      }
-      // Combine the row containing the pivot with all the lines or
-      // equalities following it, so that all the elements on the j-th
-      // column in these rows become 0.
-      for (dimension_type k = i + 1; k < n_lines_or_equalities; ++k) {
-        if (rows[k].expr.get(Variable(j - 1)) != 0) {
-          rows[k].linear_combine(rows[rank], j);
-          changed = true;
-        }
-      }
-      // Already dealt with the rank-th row.
-      ++rank;
-      // Consider another column index `j'.
-      break;
-    }
-  if (changed)
-    sorted = false;
-
-  PPL_ASSERT(OK());
-  return rank;
-}
-
-template <typename Row>
-void
-Linear_System<Row>
-::back_substitute(const dimension_type n_lines_or_equalities) {
-  // This method is only applied to a system having no pending rows and
-  // exactly `n_lines_or_equalities' lines or equalities, all of which occur
-  // before the first ray or point or inequality.
-  PPL_ASSERT(num_pending_rows() == 0);
-  PPL_ASSERT(n_lines_or_equalities <= num_lines_or_equalities());
-#ifndef NDEBUG
-  for (dimension_type i = n_lines_or_equalities; i-- > 0; )
-    PPL_ASSERT((*this)[i].is_line_or_equality());
-#endif
-
-  const dimension_type nrows = num_rows();
-  // Trying to keep sortedness.
-  bool still_sorted = is_sorted();
-  // This deque of Booleans will be used to flag those rows that,
-  // before exiting, need to be re-checked for sortedness.
-  std::deque<bool> check_for_sortedness;
-  if (still_sorted)
-    check_for_sortedness.insert(check_for_sortedness.end(), nrows, false);
-
-  for (dimension_type k = n_lines_or_equalities; k-- > 0; ) {
-    // For each line or equality, starting from the last one,
-    // looks for the last non-zero element.
-    // `j' will be the index of such a element.
-    Row& row_k = rows[k];
-    dimension_type j = row_k.expr.last_nonzero();
-    // TODO: Check this.
-    PPL_ASSERT(j != 0);
-
-    // Go through the equalities above `row_k'.
-    for (dimension_type i = k; i-- > 0; ) {
-      Row& row_i = rows[i];
-      if (row_i.expr.get(Variable(j - 1)) != 0) {
-	// Combine linearly `row_i' with `row_k'
-	// so that `row_i[j]' becomes zero.
-        row_i.linear_combine(row_k, j);
-	if (still_sorted) {
-	  // Trying to keep sortedness: remember which rows
-	  // have to be re-checked for sortedness at the end.
-	  if (i > 0)
-	    check_for_sortedness[i-1] = true;
-	  check_for_sortedness[i] = true;
-	}
-      }
-    }
-
-    // Due to strong normalization during previous iterations,
-    // the pivot coefficient `row_k[j]' may now be negative.
-    // Since an inequality (or ray or point) cannot be multiplied
-    // by a negative factor, the coefficient of the pivot must be
-    // forced to be positive.
-    const bool have_to_negate = (row_k.expr.get(Variable(j - 1)) < 0);
-    if (have_to_negate)
-      neg_assign(row_k.expr);
-
-    // NOTE: Here row_k will *not* be ok if we have negated it.
-
-    // Note: we do not mark index `k' in `check_for_sortedness',
-    // because we will later negate back the row.
-
-    // Go through all the other rows of the system.
-    for (dimension_type i = n_lines_or_equalities; i < nrows; ++i) {
-      Row& row_i = rows[i];
-      if (row_i.expr.get(Variable(j - 1)) != 0) {
-	// Combine linearly the `row_i' with `row_k'
-	// so that `row_i[j]' becomes zero.
-        row_i.linear_combine(row_k, j);
-	if (still_sorted) {
-	  // Trying to keep sortedness: remember which rows
-	  // have to be re-checked for sortedness at the end.
-	  if (i > n_lines_or_equalities)
-	    check_for_sortedness[i-1] = true;
-	  check_for_sortedness[i] = true;
-	}
-      }
-    }
-    if (have_to_negate)
-      // Negate `row_k' to restore strong-normalization.
-      neg_assign(row_k.expr);
-
-    PPL_ASSERT(row_k.OK());
-  }
-
-  // Trying to keep sortedness.
-  for (dimension_type i = 0; still_sorted && i+1 < nrows; ++i)
-    if (check_for_sortedness[i])
-      // Have to check sortedness of `(*this)[i]' with respect to `(*this)[i+1]'.
-      still_sorted = (compare((*this)[i], (*this)[i+1]) <= 0);
-
-  // Set the sortedness flag.
-  sorted = still_sorted;
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>::simplify() {
-  // This method is only applied to a system having no pending rows.
-  PPL_ASSERT(num_pending_rows() == 0);
-
-  // Partially sort the linear system so that all lines/equalities come first.
-  const dimension_type old_nrows = num_rows();
-  dimension_type nrows = old_nrows;
-  dimension_type n_lines_or_equalities = 0;
-  for (dimension_type i = 0; i < nrows; ++i)
-    if ((*this)[i].is_line_or_equality()) {
-      if (n_lines_or_equalities < i) {
-	swap(rows[i], rows[n_lines_or_equalities]);
-	// The system was not sorted.
-	PPL_ASSERT(!sorted);
-      }
-      ++n_lines_or_equalities;
-    }
-  // Apply Gaussian elimination to the subsystem of lines/equalities.
-  const dimension_type rank = gauss(n_lines_or_equalities);
-  // Eliminate any redundant line/equality that has been detected.
-  if (rank < n_lines_or_equalities) {
-    const dimension_type
-      n_rays_or_points_or_inequalities = nrows - n_lines_or_equalities;
-    const dimension_type
-      num_swaps = std::min(n_lines_or_equalities - rank,
-			   n_rays_or_points_or_inequalities);
-    for (dimension_type i = num_swaps; i-- > 0; )
-      swap(rows[--nrows], rows[rank + i]);
-    remove_trailing_rows(old_nrows - nrows);
-    if (n_rays_or_points_or_inequalities > num_swaps)
-      set_sorted(false);
-    unset_pending_rows();
-    n_lines_or_equalities = rank;
-  }
-  // Apply back-substitution to the system of rays/points/inequalities.
-  back_substitute(n_lines_or_equalities);
-
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Linear_System<Row>
-::add_universe_rows_and_space_dimensions(const dimension_type n) {
-  PPL_ASSERT(n > 0);
-  const bool was_sorted = is_sorted();
-  const dimension_type old_n_rows = num_rows();
-  const dimension_type old_space_dim
-    = is_necessarily_closed() ? space_dimension() : space_dimension() + 1;
-  set_space_dimension(space_dimension() + n);
-  rows.resize(rows.size() + n);
-  // The old system is moved to the bottom.
-  for (dimension_type i = old_n_rows; i-- > 0; )
-    swap(rows[i], rows[i + n]);
-  for (dimension_type i = n, c = old_space_dim; i-- > 0; ) {
-    // The top right-hand sub-system (i.e., the system made of new
-    // rows and columns) is set to the specular image of the identity
-    // matrix.
-    if (Variable(c).space_dimension() <= space_dimension()) {
-      // Variable(c) is a user variable.
-      Linear_Expression le(representation());
-      le.set_space_dimension(space_dimension());
-      le += Variable(c);
-      Row r(le, Row::LINE_OR_EQUALITY, row_topology);
-      swap(r, rows[i]);
-    } else {
-      // Variable(c) is the epsilon dimension.
-      PPL_ASSERT(row_topology == NOT_NECESSARILY_CLOSED);
-      Linear_Expression le(Variable(c), representation());
-      Row r(le, Row::LINE_OR_EQUALITY, NECESSARILY_CLOSED);
-      r.mark_as_not_necessarily_closed();
-      swap(r, rows[i]);
-      // Note: `r' is strongly normalized.
-    }
-    ++c;
-  }
-  // If the old system was empty, the last row added is either
-  // a positivity constraint or a point.
-  if (was_sorted)
-    sorted = (compare(rows[n-1], rows[n]) <= 0);
-
-  // If the system is not necessarily closed, move the epsilon coefficients to
-  // the last column.
-  if (!is_necessarily_closed()) {
-    // Try to preserve sortedness of `gen_sys'.
-    PPL_ASSERT(old_space_dim != 0);
-    if (!is_sorted()) {
-      for (dimension_type i = n; i-- > 0; ) {
-        rows[i].expr.swap_space_dimensions(Variable(old_space_dim - 1),
-                                           Variable(old_space_dim - 1 + n));
-        PPL_ASSERT(rows[i].OK());
-      }
-    } else {
-      dimension_type old_eps_index = old_space_dim - 1;
-      // The upper-right corner of `rows' contains the J matrix:
-      // swap coefficients to preserve sortedness.
-      for (dimension_type i = n; i-- > 0; ++old_eps_index) {
-        rows[i].expr.swap_space_dimensions(Variable(old_eps_index),
-                                           Variable(old_eps_index + 1));
-        PPL_ASSERT(rows[i].OK());
-      }
-
-      sorted = true;
-    }
-  }
-  // NOTE: this already checks for OK().
-  set_index_first_pending_row(index_first_pending + n);
-}
-
-template <typename Row>
-void
-Linear_System<Row>::sort_pending_and_remove_duplicates() {
-  PPL_ASSERT(num_pending_rows() > 0);
-  PPL_ASSERT(is_sorted());
-
-  // The non-pending part of the system is already sorted.
-  // Now sorting the pending part..
-  const dimension_type first_pending = first_pending_row();
-  sort_rows(first_pending, num_rows());
-  // Recompute the number of rows, because we may have removed
-  // some rows occurring more than once in the pending part.
-  const dimension_type old_num_rows = num_rows();
-  dimension_type num_rows = old_num_rows;
-
-  dimension_type k1 = 0;
-  dimension_type k2 = first_pending;
-  dimension_type num_duplicates = 0;
-  // In order to erase them, put at the end of the system
-  // those pending rows that also occur in the non-pending part.
-  while (k1 < first_pending && k2 < num_rows) {
-    const int cmp = compare(rows[k1], rows[k2]);
-    if (cmp == 0) {
-      // We found the same row.
-      ++num_duplicates;
-      --num_rows;
-      // By initial sortedness, we can increment index `k1'.
-      ++k1;
-      // Do not increment `k2'; instead, swap there the next pending row.
-      if (k2 < num_rows)
-        swap(rows[k2], rows[k2 + num_duplicates]);
-    }
-    else if (cmp < 0)
-      // By initial sortedness, we can increment `k1'.
-      ++k1;
-    else {
-      // Here `cmp > 0'.
-      // Increment `k2' and, if we already found any duplicate,
-      // swap the next pending row in position `k2'.
-      ++k2;
-      if (num_duplicates > 0 && k2 < num_rows)
-        swap(rows[k2], rows[k2 + num_duplicates]);
-    }
-  }
-  // If needed, swap any duplicates found past the pending rows
-  // that has not been considered yet; then erase the duplicates.
-  if (num_duplicates > 0) {
-    if (k2 < num_rows)
-      for (++k2; k2 < num_rows; ++k2)
-        swap(rows[k2], rows[k2 + num_duplicates]);
-    rows.resize(num_rows);
-  }
-  sorted = true;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-bool
-Linear_System<Row>::check_sorted() const {
-  for (dimension_type i = first_pending_row(); i-- > 1; )
-    if (compare(rows[i], rows[i-1]) < 0)
-      return false;
-  return true;
-}
-
-template <typename Row>
-bool
-Linear_System<Row>::OK() const {
-#ifndef NDEBUG
-  using std::endl;
-  using std::cerr;
-#endif
-
-  for (dimension_type i = rows.size(); i-- > 0; ) {
-    if (rows[i].representation() != representation()) {
-#ifndef NDEBUG
-      cerr << "Linear_System has a row with the wrong representation!"
-           << endl;
-#endif
-      return false;
-    }
-    if (rows[i].space_dimension() != space_dimension()) {
-#ifndef NDEBUG
-      cerr << "Linear_System has a row with the wrong number of space dimensions!"
-           << endl;
-#endif
-      return false;
-    }
-  }
-
-  for (dimension_type i = rows.size(); i-- > 0; )
-    if (rows[i].topology() != topology()) {
-#ifndef NDEBUG
-      cerr << "Linear_System has a row with the wrong topology!"
-           << endl;
-#endif
-      return false;
-    }
-
-  // `index_first_pending' must be less than or equal to `num_rows()'.
-  if (first_pending_row() > num_rows()) {
-#ifndef NDEBUG
-    cerr << "Linear_System has a negative number of pending rows!"
-	 << endl;
-#endif
-    return false;
-  }
-
-  // Check for topology mismatches.
-  const dimension_type n_rows = num_rows();
-  for (dimension_type i = 0; i < n_rows; ++i)
-    if (topology() != rows[i].topology()) {
-#ifndef NDEBUG
-      cerr << "Topology mismatch between the system "
-	   << "and one of its rows!"
-	   << endl;
-#endif
-      return false;
-    }
-
-  if (sorted && !check_sorted()) {
-#ifndef NDEBUG
-    cerr << "The system declares itself to be sorted but it is not!"
-	 << endl;
-#endif
-    return false;
-  }
-
-  // All checks passed.
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_System_templates_hh)
diff --git a/src/Linear_System.types.hh b/src/Linear_System.types.hh
deleted file mode 100644
index 7e45c24..0000000
--- a/src/Linear_System.types.hh
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Linear_System_types_hh
-#define PPL_Linear_System_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-class Linear_System;
-
-template <typename Row>
-class Linear_System_With_Bit_Matrix_iterator;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Linear_System_types_hh)
diff --git a/src/Linear_System_defs.hh b/src/Linear_System_defs.hh
new file mode 100644
index 0000000..e2d5168
--- /dev/null
+++ b/src/Linear_System_defs.hh
@@ -0,0 +1,582 @@
+/* Linear_System class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_System_defs_hh
+#define PPL_Linear_System_defs_hh 1
+
+#include "Linear_System_types.hh"
+
+#include "Swapping_Vector_defs.hh"
+#include "globals_defs.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_defs.hh"
+
+#include "Polyhedron_types.hh"
+#include "Bit_Row_types.hh"
+#include "Bit_Matrix_types.hh"
+#include "Generator_System_types.hh"
+#include "Topology_types.hh"
+
+// TODO: Check how much of this description is still true.
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The base class for systems of constraints and generators.
+/*! \ingroup PPL_CXX_interface
+  An object of this class represents either a constraint system
+  or a generator system. Each Linear_System object can be viewed
+  as a finite sequence of strong-normalized Row objects,
+  where each Row implements a constraint or a generator.
+  Linear systems are characterized by the matrix of coefficients,
+  also encoding the number, size and capacity of Row objects,
+  as well as a few additional information, including:
+   - the topological kind of (all) the rows;
+   - an indication of whether or not some of the rows in the Linear_System
+     are <EM>pending</EM>, meaning that they still have to undergo
+     an (unspecified) elaboration; if there are pending rows, then these
+     form a proper suffix of the overall sequence of rows;
+   - a Boolean flag that, when <CODE>true</CODE>, ensures that the
+     non-pending prefix of the sequence of rows is sorted.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+class Parma_Polyhedra_Library::Linear_System {
+public:
+
+  // NOTE: `iterator' is actually a const_iterator.
+  typedef typename Swapping_Vector<Row>::const_iterator iterator;
+  typedef typename Swapping_Vector<Row>::const_iterator const_iterator;
+
+  //! Builds an empty linear system with specified topology.
+  /*!
+    Rows size and capacity are initialized to \f$0\f$.
+  */
+  Linear_System(Topology topol, Representation r);
+
+  //! Builds a system with specified topology and dimensions.
+  /*!
+    \param topol
+    The topology of the system that will be created;
+
+    \param space_dim
+    The number of space dimensions of the system that will be created.
+
+    \param r
+    The representation for system's rows.
+
+    Creates a \p n_rows \f$\times\f$ \p space_dim system whose
+    coefficients are all zero and with the given topology.
+  */
+  Linear_System(Topology topol, dimension_type space_dim, Representation r);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! A tag class.
+  /*! \ingroup PPL_CXX_interface
+    Tag class to differentiate the Linear_System copy constructor that
+    copies pending rows as pending from the one that transforms
+    pending rows into non-pending ones.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  struct With_Pending {
+  };
+
+  //! Copy constructor: pending rows are transformed into non-pending ones.
+  Linear_System(const Linear_System& y);
+
+  //! Copy constructor with specified representation. Pending rows are
+  //! transformed into non-pending ones.
+  Linear_System(const Linear_System& y, Representation r);
+
+  //! Full copy constructor: pending rows are copied as pending.
+  Linear_System(const Linear_System& y, With_Pending);
+
+  //! Full copy constructor: pending rows are copied as pending.
+  Linear_System(const Linear_System& y, Representation r, With_Pending);
+
+  //! Assignment operator: pending rows are transformed into non-pending ones.
+  Linear_System& operator=(const Linear_System& y);
+
+  //! Full assignment operator: pending rows are copied as pending.
+  void assign_with_pending(const Linear_System& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Linear_System& y);
+
+  //! Returns the current representation of *this.
+  Representation representation() const;
+
+  //! Converts *this to the specified representation.
+  void set_representation(Representation r);
+
+  //! Returns the maximum space dimension a Linear_System can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the space dimension of the rows in the system.
+  /*!
+    The computation of the space dimension correctly ignores
+    the column encoding the inhomogeneous terms of constraint
+    (resp., the divisors of generators);
+    if the system topology is <CODE>NOT_NECESSARILY_CLOSED</CODE>,
+    also the column of the \f$\epsilon\f$-dimension coefficients
+    will be ignored.
+  */
+  dimension_type space_dimension() const;
+
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  void set_space_dimension(dimension_type space_dim);
+
+  //! Makes the system shrink by removing its \p n trailing rows.
+  void remove_trailing_rows(dimension_type n);
+
+  //! Makes the system shrink by removing its i-th row.
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(n).
+
+    Otherwise, this method just swaps the i-th row with the last and then
+    removes it, so it costs O(1).
+  */
+  void remove_row(dimension_type i, bool keep_sorted = false);
+
+  //! Makes the system shrink by removing the rows in [first,last).
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(num_rows()).
+
+    Otherwise, this method just swaps the rows with the last ones and then
+    removes them, so it costs O(last - first).
+  */
+  void remove_rows(dimension_type first, dimension_type last,
+                  bool keep_sorted = false);
+
+  // TODO: Consider removing this.
+  //! Removes the specified rows. The row ordering of remaining rows is
+  //! preserved.
+  /*!
+    \param indexes specifies a list of row indexes.
+                   It must be sorted.
+  */
+  void remove_rows(const std::vector<dimension_type>& indexes);
+
+  // TODO: Consider making this private.
+  //! Removes all the specified dimensions from the system.
+  /*!
+    The space dimension of the variable with the highest space
+    dimension in \p vars must be at most the space dimension
+    of \p this.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  //! Shift by \p n positions the coefficients of variables, starting from
+  //! the coefficient of \p v. This increases the space dimension by \p n.
+  void shift_space_dimensions(Variable v, dimension_type n);
+
+  // TODO: Consider making this private.
+  //! Permutes the space dimensions of the matrix.
+  /*
+    \param cycle
+    A vector representing a cycle of the permutation according to which the
+    space dimensions must be rearranged.
+
+    The \p cycle vector represents a cycle of a permutation of space
+    dimensions.
+    For example, the permutation
+    \f$ \{ x_1 \mapsto x_2, x_2 \mapsto x_3, x_3 \mapsto x_1 \}\f$ can be
+    represented by the vector containing \f$ x_1, x_2, x_3 \f$.
+  */
+  void permute_space_dimensions(const std::vector<Variable>& cycle);
+
+  //! Swaps the coefficients of the variables \p v1 and \p v2 .
+  void swap_space_dimensions(Variable v1, Variable v2);
+
+  //! \name Subscript operators
+  //@{
+  //! Returns a const reference to the \p k-th row of the system.
+  const Row& operator[](dimension_type k) const;
+  //@} // Subscript operators
+
+  iterator begin();
+  iterator end();
+  const_iterator begin() const;
+  const_iterator end() const;
+
+  bool has_no_rows() const;
+  dimension_type num_rows() const;
+
+  //! Strongly normalizes the system.
+  void strong_normalize();
+
+  //! Sign-normalizes the system.
+  void sign_normalize();
+
+  //! \name Accessors
+  //@{
+  //! Returns the system topology.
+  Topology topology() const;
+
+  //! Returns the value of the sortedness flag.
+  bool is_sorted() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    the system topology is <CODE>NECESSARILY_CLOSED</CODE>.
+  */
+  bool is_necessarily_closed() const;
+
+  /*! \brief
+    Returns the number of rows in the system
+    that represent either lines or equalities.
+  */
+  dimension_type num_lines_or_equalities() const;
+
+  //! Returns the index of the first pending row.
+  dimension_type first_pending_row() const;
+
+  //! Returns the number of rows that are in the pending part of the system.
+  dimension_type num_pending_rows() const;
+  //@} // Accessors
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is sorted,
+    without checking for duplicates.
+  */
+  bool check_sorted() const;
+
+  //! Sets the system topology to \p t .
+  void set_topology(Topology t);
+
+  //! Sets the system topology to <CODE>NECESSARILY_CLOSED</CODE>.
+  void set_necessarily_closed();
+
+  //! Sets the system topology to <CODE>NOT_NECESSARILY_CLOSED</CODE>.
+  void set_not_necessarily_closed();
+
+  // TODO: Consider removing this, or making it private.
+  //! Marks the epsilon dimension as a standard dimension.
+  /*!
+    The system topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is increased by 1.
+  */
+  void mark_as_necessarily_closed();
+
+  // TODO: Consider removing this, or making it private.
+  //! Marks the last dimension as the epsilon dimension.
+  /*!
+    The system topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
+    the number of space dimensions is decreased by 1.
+  */
+  void mark_as_not_necessarily_closed();
+
+  //! Sets the index to indicate that the system has no pending rows.
+  void unset_pending_rows();
+
+  //! Sets the index of the first pending row to \p i.
+  void set_index_first_pending_row(dimension_type i);
+
+  //! Sets the sortedness flag of the system to \p b.
+  void set_sorted(bool b);
+
+  //! Adds \p n rows and space dimensions to the system.
+  /*!
+    \param n
+    The number of rows and space dimensions to be added: must be strictly
+    positive.
+
+    Turns the system \f$M \in \Rset^r \times \Rset^c\f$ into
+    the system \f$N \in \Rset^{r+n} \times \Rset^{c+n}\f$
+    such that
+    \f$N = \bigl(\genfrac{}{}{0pt}{}{0}{M}\genfrac{}{}{0pt}{}{J}{o}\bigr)\f$,
+    where \f$J\f$ is the specular image
+    of the \f$n \times n\f$ identity matrix.
+  */
+  void add_universe_rows_and_space_dimensions(dimension_type n);
+
+  /*! \brief
+    Adds a copy of \p r to the system,
+    automatically resizing the system or the row's copy, if needed.
+  */
+  void insert(const Row& r);
+
+  /*! \brief
+    Adds a copy of the given row to the pending part of the system,
+    automatically resizing the system or the row, if needed.
+  */
+  void insert_pending(const Row& r);
+
+  /*! \brief
+    Adds \p r to the system, stealing its contents and
+    automatically resizing the system or the row, if needed.
+  */
+  void insert(Row& r, Recycle_Input);
+
+  /*! \brief
+    Adds the given row to the pending part of the system, stealing its
+    contents and automatically resizing the system or the row, if needed.
+  */
+  void insert_pending(Row& r, Recycle_Input);
+
+  //! Adds to \p *this a copy of  the rows of \p y.
+  /*!
+    It is assumed that \p *this has no pending rows.
+  */
+  void insert(const Linear_System& y);
+
+  //! Adds a copy of the rows of `y' to the pending part of `*this'.
+  void insert_pending(const Linear_System& r);
+
+  //! Adds to \p *this a the rows of `y', stealing them from `y'.
+  /*!
+    It is assumed that \p *this has no pending rows.
+  */
+  void insert(Linear_System& r, Recycle_Input);
+
+  //! Adds the rows of `y' to the pending part of `*this', stealing them from
+  //! `y'.
+  void insert_pending(Linear_System& r, Recycle_Input);
+
+  /*! \brief
+    Sorts the non-pending rows (in growing order) and eliminates
+    duplicated ones.
+  */
+  void sort_rows();
+
+  /*! \brief
+    Sorts the rows (in growing order) form \p first_row to
+    \p last_row and eliminates duplicated ones.
+  */
+  void sort_rows(dimension_type first_row, dimension_type last_row);
+
+  /*! \brief
+    Assigns to \p *this the result of merging its rows with
+    those of \p y, obtaining a sorted system.
+
+    Duplicated rows will occur only once in the result.
+    On entry, both systems are assumed to be sorted and have
+    no pending rows.
+  */
+  void merge_rows_assign(const Linear_System& y);
+
+  /*! \brief
+    Sorts the pending rows and eliminates those that also occur
+    in the non-pending part of the system.
+  */
+  void sort_pending_and_remove_duplicates();
+
+  /*! \brief
+    Sorts the system, removing duplicates, keeping the saturation
+    matrix consistent.
+
+    \param sat
+    Bit matrix with rows corresponding to the rows of \p *this.
+  */
+  void sort_and_remove_with_sat(Bit_Matrix& sat);
+
+  //! Minimizes the subsystem of equations contained in \p *this.
+  /*!
+    This method works only on the equalities of the system:
+    the system is required to be partially sorted, so that
+    all the equalities are grouped at its top; it is assumed that
+    the number of equalities is exactly \p n_lines_or_equalities.
+    The method finds a minimal system for the equalities and
+    returns its rank, i.e., the number of linearly independent equalities.
+    The result is an upper triangular subsystem of equalities:
+    for each equality, the pivot is chosen starting from
+    the right-most space dimensions.
+  */
+  dimension_type gauss(dimension_type n_lines_or_equalities);
+
+  /*! \brief
+    Back-substitutes the coefficients to reduce
+    the complexity of the system.
+
+    Takes an upper triangular system having \p n_lines_or_equalities rows.
+    For each row, starting from the one having the minimum number of
+    coefficients different from zero, computes the expression of an element
+    as a function of the remaining ones and then substitutes this expression
+    in all the other rows.
+  */
+  void back_substitute(dimension_type n_lines_or_equalities);
+
+  /*! \brief
+    Applies Gaussian elimination and back-substitution so as to
+    simplify the linear system.
+  */
+  void simplify();
+
+  //! Clears the system deallocating all its rows.
+  void clear();
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+
+    Reads into a Linear_System object the information produced by the
+    output of ascii_dump(std::ostream&) const.  The specialized methods
+    provided by Constraint_System and Generator_System take care of
+    properly reading the contents of the system.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! The vector that contains the rows.
+  /*!
+    \note This is public for convenience. Clients that modify if must preserve
+          the class invariant.
+  */
+  Swapping_Vector<Row> rows;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+private:
+  //! Makes the system shrink by removing its i-th row.
+  /*!
+    When \p keep_sorted is \p true and the system is sorted, sortedness will
+    be preserved, but this method costs O(n).
+
+    Otherwise, this method just swaps the i-th row with the last and then
+    removes it, so it costs O(1).
+
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid systems.
+  */
+  void remove_row_no_ok(dimension_type i, bool keep_sorted = false);
+
+  /*! \brief
+    Adds \p r to the pending part of the system, stealing its contents and
+    automatically resizing the system or the row, if needed.
+
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid systems.
+  */
+  void insert_pending_no_ok(Row& r, Recycle_Input);
+
+  /*! \brief
+    Adds \p r to the system, stealing its contents and
+    automatically resizing the system or the row, if needed.
+
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid systems.
+  */
+  void insert_no_ok(Row& r, Recycle_Input);
+
+  //! Sets the space dimension of the rows in the system to \p space_dim .
+  /*!
+    This method is for internal use, it does *not* assert OK() at the end,
+    so it can be used for invalid systems.
+  */
+  void set_space_dimension_no_ok(dimension_type space_dim);
+
+  //! Swaps the [first,last) row interval with the
+  //! [first + offset, last + offset) interval.
+  /*!
+    These intervals may not be disjunct.
+
+    Sorting of these intervals is *not* preserved.
+
+    Either both intervals contain only not-pending rows, or they both
+    contain pending rows.
+  */
+  void swap_row_intervals(dimension_type first, dimension_type last,
+                          dimension_type offset);
+
+  //! The space dimension of each row. All rows must have this number of
+  //! space dimensions.
+  dimension_type space_dimension_;
+
+  //! The topological kind of the rows in the system. All rows must have this
+  //! topology.
+  Topology row_topology;
+
+  //! The index of the first pending row.
+  dimension_type index_first_pending;
+
+  /*! \brief
+    <CODE>true</CODE> if rows are sorted in the ascending order as defined by
+    <CODE>bool compare(const Row&, const Row&)</CODE>.
+    If <CODE>false</CODE> may not be sorted.
+  */
+  bool sorted;
+
+  Representation representation_;
+
+  //! Ordering predicate (used when implementing the sort algorithm).
+  struct Row_Less_Than {
+    bool operator()(const Row& x, const Row& y) const;
+  };
+
+  //! Comparison predicate (used when implementing the unique algorithm).
+  struct Unique_Compare {
+    Unique_Compare(const Swapping_Vector<Row>& cont,
+                   dimension_type base = 0);
+
+    bool operator()(dimension_type i, dimension_type j) const;
+
+    const Swapping_Vector<Row>& container;
+    const dimension_type base_index;
+  };
+
+  friend class Polyhedron;
+  friend class Generator_System;
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates Linear_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+void swap(Parma_Polyhedra_Library::Linear_System<Row>& x,
+          Parma_Polyhedra_Library::Linear_System<Row>& y);
+
+} // namespace std
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates Linear_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+bool operator==(const Linear_System<Row>& x, const Linear_System<Row>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Linear_System */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+bool operator!=(const Linear_System<Row>& x, const Linear_System<Row>& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Linear_System_inlines.hh"
+#include "Linear_System_templates.hh"
+
+#endif // !defined(PPL_Linear_System_defs_hh)
diff --git a/src/Linear_System_inlines.hh b/src/Linear_System_inlines.hh
new file mode 100644
index 0000000..a2aedba
--- /dev/null
+++ b/src/Linear_System_inlines.hh
@@ -0,0 +1,698 @@
+/* Linear_System class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_System_inlines_hh
+#define PPL_Linear_System_inlines_hh 1
+
+#include "Bit_Row_defs.hh"
+#include "Coefficient_defs.hh"
+
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+inline memory_size_type
+Linear_System<Row>::external_memory_in_bytes() const {
+  return rows.external_memory_in_bytes();
+}
+
+template <typename Row>
+inline memory_size_type
+Linear_System<Row>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename Row>
+inline bool
+Linear_System<Row>::is_sorted() const {
+  // The flag `sorted' does not really reflect the sortedness status
+  // of a system (if `sorted' evaluates to `false' nothing is known).
+  // This assertion is used to ensure that the system
+  // is actually sorted when `sorted' value is 'true'.
+  PPL_ASSERT(!sorted || check_sorted());
+  return sorted;
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_sorted(const bool b) {
+  sorted = b;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Linear_System(Topology topol, Representation r)
+  : rows(),
+    space_dimension_(0),
+    row_topology(topol),
+    index_first_pending(0),
+    sorted(true),
+    representation_(r) {
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Linear_System(Topology topol,
+                                  dimension_type space_dim,
+                                  Representation r)
+  : rows(),
+    space_dimension_(0),
+    row_topology(topol),
+    index_first_pending(0),
+    sorted(true),
+    representation_(r) {
+  set_space_dimension(space_dim);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline dimension_type
+Linear_System<Row>::first_pending_row() const {
+  return index_first_pending;
+}
+
+template <typename Row>
+inline dimension_type
+Linear_System<Row>::num_pending_rows() const {
+  PPL_ASSERT(num_rows() >= first_pending_row());
+  return num_rows() - first_pending_row();
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::unset_pending_rows() {
+  index_first_pending = num_rows();
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_index_first_pending_row(const dimension_type i) {
+  index_first_pending = i;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Linear_System(const Linear_System& y)
+  : rows(y.rows),
+    space_dimension_(y.space_dimension_),
+    row_topology(y.row_topology),
+    representation_(y.representation_) {
+  // Previously pending rows may violate sortedness.
+  sorted = (y.num_pending_rows() > 0) ? false : y.sorted;
+  unset_pending_rows();
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Linear_System(const Linear_System& y, Representation r)
+  : rows(),
+    space_dimension_(y.space_dimension_),
+    row_topology(y.row_topology),
+    representation_(r) {
+  rows.resize(y.num_rows());
+  for (dimension_type i = 0; i < y.num_rows(); ++i) {
+    // Create the copies with the right representation.
+    Row row(y.rows[i], r);
+    swap(rows[i], row);
+  }
+  // Previously pending rows may violate sortedness.
+  sorted = (y.num_pending_rows() > 0) ? false : y.sorted;
+  unset_pending_rows();
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Linear_System(const Linear_System& y, With_Pending)
+  : rows(y.rows),
+    space_dimension_(y.space_dimension_),
+    row_topology(y.row_topology),
+    index_first_pending(y.index_first_pending),
+    sorted(y.sorted),
+    representation_(y.representation_) {
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Linear_System(const Linear_System& y, Representation r,
+                                  With_Pending)
+  : rows(),
+    space_dimension_(y.space_dimension_),
+    row_topology(y.row_topology),
+    index_first_pending(y.index_first_pending),
+    sorted(y.sorted),
+    representation_(r) {
+  rows.resize(y.num_rows());
+  for (dimension_type i = 0; i < y.num_rows(); ++i) {
+    // Create the copies with the right representation.
+    Row row(y.rows[i], r);
+    swap(rows[i], row);
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline Linear_System<Row>&
+Linear_System<Row>::operator=(const Linear_System& y) {
+  // NOTE: Pending rows are transformed into non-pending ones.
+  Linear_System<Row> tmp = y;
+  swap(*this, tmp);
+  return *this;
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::assign_with_pending(const Linear_System& y) {
+  Linear_System<Row> tmp(y, With_Pending());
+  swap(*this, tmp);
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::m_swap(Linear_System& y) {
+  using std::swap;
+  swap(rows, y.rows);
+  swap(space_dimension_, y.space_dimension_);
+  swap(row_topology, y.row_topology);
+  swap(index_first_pending, y.index_first_pending);
+  swap(sorted, y.sorted);
+  swap(representation_, y.representation_);
+  PPL_ASSERT(OK());
+  PPL_ASSERT(y.OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::clear() {
+  // Note: do NOT modify the value of `row_topology' and `representation'.
+  rows.clear();
+  index_first_pending = 0;
+  sorted = true;
+  space_dimension_ = 0;
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::mark_as_necessarily_closed() {
+  PPL_ASSERT(topology() == NOT_NECESSARILY_CLOSED);
+  row_topology = NECESSARILY_CLOSED;
+  ++space_dimension_;
+  for (dimension_type i = num_rows(); i-- > 0; )
+    rows[i].mark_as_necessarily_closed();
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::mark_as_not_necessarily_closed() {
+  PPL_ASSERT(topology() == NECESSARILY_CLOSED);
+  PPL_ASSERT(space_dimension() > 0);
+  row_topology = NOT_NECESSARILY_CLOSED;
+  --space_dimension_;
+  for (dimension_type i = num_rows(); i-- > 0; )
+    rows[i].mark_as_not_necessarily_closed();
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_topology(Topology t) {
+  if (topology() == t)
+    return;
+  for (dimension_type i = num_rows(); i-- > 0; )
+    rows[i].set_topology(t);
+  row_topology = t;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_necessarily_closed() {
+  set_topology(NECESSARILY_CLOSED);
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_not_necessarily_closed() {
+  set_topology(NOT_NECESSARILY_CLOSED);
+}
+
+template <typename Row>
+inline bool
+Linear_System<Row>::is_necessarily_closed() const {
+  return row_topology == NECESSARILY_CLOSED;
+}
+
+template <typename Row>
+inline const Row&
+Linear_System<Row>::operator[](const dimension_type k) const {
+  return rows[k];
+}
+
+template <typename Row>
+inline typename Linear_System<Row>::iterator
+Linear_System<Row>::begin() {
+  return rows.begin();
+}
+
+template <typename Row>
+inline typename Linear_System<Row>::iterator
+Linear_System<Row>::end() {
+  return rows.end();
+}
+
+template <typename Row>
+inline typename Linear_System<Row>::const_iterator
+Linear_System<Row>::begin() const {
+  return rows.begin();
+}
+
+template <typename Row>
+inline typename Linear_System<Row>::const_iterator
+Linear_System<Row>::end() const {
+  return rows.end();
+}
+
+template <typename Row>
+inline bool
+Linear_System<Row>::has_no_rows() const {
+  return rows.empty();
+}
+
+template <typename Row>
+inline dimension_type
+Linear_System<Row>::num_rows() const {
+  return rows.size();
+}
+
+template <typename Row>
+inline Topology
+Linear_System<Row>::topology() const {
+  return row_topology;
+}
+
+template <typename Row>
+inline Representation
+Linear_System<Row>::representation() const {
+  return representation_;
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_representation(Representation r) {
+  representation_ = r;
+  for (dimension_type i = 0; i < rows.size(); ++i)
+    rows[i].set_representation(r);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline dimension_type
+Linear_System<Row>::max_space_dimension() {
+  return Row::max_space_dimension();
+}
+
+template <typename Row>
+inline dimension_type
+Linear_System<Row>::space_dimension() const {
+  return space_dimension_;
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_space_dimension_no_ok(dimension_type space_dim) {
+  for (dimension_type i = rows.size(); i-- > 0; )
+    rows[i].set_space_dimension_no_ok(space_dim);
+  space_dimension_ = space_dim;
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::set_space_dimension(dimension_type space_dim) {
+  set_space_dimension_no_ok(space_dim);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::remove_row_no_ok(const dimension_type i,
+                                     const bool keep_sorted) {
+  PPL_ASSERT(i < num_rows());
+  const bool was_pending = (i >= index_first_pending);
+
+  if (sorted && keep_sorted && !was_pending) {
+    for (dimension_type j = i + 1; j < rows.size(); ++j)
+      swap(rows[j], rows[j-1]);
+    rows.pop_back();
+  }
+  else {
+    if (!was_pending)
+      sorted = false;
+    const bool last_row_is_pending = (num_rows() - 1 >= index_first_pending);
+    if (was_pending == last_row_is_pending)
+      // Either both rows are pending or both rows are not pending.
+      swap(rows[i], rows.back());
+    else {
+      // Pending rows are stored after the non-pending ones.
+      PPL_ASSERT(!was_pending);
+      PPL_ASSERT(last_row_is_pending);
+
+      // Swap the row with the last non-pending row.
+      swap(rows[i], rows[index_first_pending - 1]);
+
+      // Now the (non-pending) row that has to be deleted is between the
+      // non-pending and the pending rows.
+      swap(rows[i], rows.back());
+    }
+    rows.pop_back();
+  }
+  if (!was_pending)
+    // A non-pending row has been removed.
+    --index_first_pending;
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::remove_row(const dimension_type i, bool keep_sorted) {
+  remove_row_no_ok(i, keep_sorted);
+  PPL_ASSERT(OK());
+}
+
+
+template <typename Row>
+inline void
+Linear_System<Row>::remove_rows(dimension_type first,
+                                dimension_type last,
+                                bool keep_sorted) {
+  PPL_ASSERT(first <= last);
+  PPL_ASSERT(last <= num_rows());
+  const dimension_type n = last - first;
+
+  if (n == 0)
+    return;
+
+  // All the rows that have to be removed must have the same (pending or
+  // non-pending) status.
+  PPL_ASSERT(first >= index_first_pending || last <= index_first_pending);
+
+  const bool were_pending = (first >= index_first_pending);
+
+  // Move the rows in [first,last) at the end of the system.
+  if (sorted && keep_sorted && !were_pending) {
+    // Preserve the row ordering.
+    for (dimension_type i = last; i < rows.size(); ++i)
+      swap(rows[i], rows[i - n]);
+
+    rows.resize(rows.size() - n);
+
+    // `n' non-pending rows have been removed.
+    index_first_pending -= n;
+
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // We can ignore the row ordering, but we must not mix pending and
+  // non-pending rows.
+
+  const dimension_type offset = rows.size() - n - first;
+  // We want to swap the rows in [first, last) and
+  // [first + offset, last + offset) (note that these intervals may not be
+  // disjunct).
+
+  if (index_first_pending == num_rows()) {
+    // There are no pending rows.
+    PPL_ASSERT(!were_pending);
+
+    swap_row_intervals(first, last, offset);
+
+    rows.resize(rows.size() - n);
+
+    // `n' non-pending rows have been removed.
+    index_first_pending -= n;
+  }
+  else {
+    // There are some pending rows in [first + offset, last + offset).
+    if (were_pending) {
+      // Both intervals contain only pending rows, because the second
+      // interval is after the first.
+
+      swap_row_intervals(first, last, offset);
+
+      rows.resize(rows.size() - n);
+
+      // `n' non-pending rows have been removed.
+      index_first_pending -= n;
+    }
+    else {
+      PPL_ASSERT(rows.size() - n < index_first_pending);
+      PPL_ASSERT(rows.size() > index_first_pending);
+      PPL_ASSERT(!were_pending);
+      // In the [size() - n, size()) interval there are some non-pending
+      // rows and some pending ones. Be careful not to mix them.
+
+      PPL_ASSERT(index_first_pending >= last);
+      swap_row_intervals(first, last, index_first_pending - last);
+
+      // Mark the rows that must be deleted as pending.
+      index_first_pending -= n;
+      first = index_first_pending;
+      last = first + n;
+
+      // Move them at the end of the system.
+      swap_row_intervals(first, last, num_rows() - last);
+
+      // Actually remove the rows.
+      rows.resize(rows.size() - n);
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::swap_row_intervals(dimension_type first,
+                                       dimension_type last,
+                                       dimension_type offset) {
+  PPL_ASSERT(first <= last);
+  PPL_ASSERT(last + offset <= num_rows());
+#ifndef NDEBUG
+  if (first < last) {
+    bool first_interval_has_pending_rows = (last > index_first_pending);
+    bool second_interval_has_pending_rows = (last + offset > index_first_pending);
+    bool first_interval_has_not_pending_rows = (first < index_first_pending);
+    bool second_interval_has_not_pending_rows = (first + offset < index_first_pending);
+    PPL_ASSERT(first_interval_has_not_pending_rows
+               == !first_interval_has_pending_rows);
+    PPL_ASSERT(second_interval_has_not_pending_rows
+               == !second_interval_has_pending_rows);
+    PPL_ASSERT(first_interval_has_pending_rows
+               == second_interval_has_pending_rows);
+  }
+#endif
+  if (first + offset < last) {
+    // The intervals are not disjunct, make them so.
+    const dimension_type k = last - first - offset;
+    last -= k;
+    offset += k;
+  }
+
+  if (first == last)
+    // Nothing to do.
+    return;
+
+  for (dimension_type i = first; i < last; ++i)
+    swap(rows[i], rows[i + offset]);
+
+  if (first < index_first_pending)
+    // The swaps involved not pending rows, so they may not be sorted anymore.
+    set_sorted(false);
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::remove_rows(const std::vector<dimension_type>& indexes) {
+#ifndef NDEBUG
+  {
+    // Check that `indexes' is sorted.
+    std::vector<dimension_type> sorted_indexes = indexes;
+    std::sort(sorted_indexes.begin(), sorted_indexes.end());
+    PPL_ASSERT(indexes == sorted_indexes);
+
+    // Check that the last index (if any) is lower than num_rows().
+    // This guarantees that all indexes are in [0, num_rows()).
+    if (!indexes.empty())
+      PPL_ASSERT(indexes.back() < num_rows());
+  }
+#endif
+
+  if (indexes.empty())
+    return;
+
+  const dimension_type rows_size = rows.size();
+  typedef std::vector<dimension_type>::const_iterator itr_t;
+
+  // `i' and last_unused_row' start with the value `indexes[0]' instead
+  // of `0', because the loop would just increment `last_unused_row' in the
+  // preceding iterations.
+  dimension_type last_unused_row = indexes[0];
+  dimension_type i = indexes[0];
+  itr_t itr = indexes.begin();
+  itr_t itr_end = indexes.end();
+  while (itr != itr_end) {
+    // i <= *itr < rows_size
+    PPL_ASSERT(i < rows_size);
+    if (*itr == i) {
+      // The current row has to be removed, don't increment last_unused_row.
+      ++itr;
+    }
+    else {
+      // The current row must not be removed, swap it after the last used row.
+      swap(rows[last_unused_row], rows[i]);
+      ++last_unused_row;
+    }
+    ++i;
+  }
+
+  // Move up the remaining rows, if any.
+  for ( ; i < rows_size; ++i) {
+    swap(rows[last_unused_row], rows[i]);
+    ++last_unused_row;
+  }
+
+  PPL_ASSERT(last_unused_row == num_rows() - indexes.size());
+
+  // The rows that have to be removed are now at the end of the system, just
+  // remove them.
+  rows.resize(last_unused_row);
+
+  // Adjust index_first_pending.
+  if (indexes[0] >= index_first_pending) {
+    // Removing pending rows only.
+  }
+  else {
+    if (indexes.back() < index_first_pending) {
+      // Removing non-pending rows only.
+      index_first_pending -= indexes.size();
+    }
+    else {
+      // Removing some pending and some non-pending rows, count the
+      // non-pending rows that must be removed.
+      // This exploits the fact that `indexes' is sorted by using binary
+      // search.
+      itr_t j = std::lower_bound(indexes.begin(), indexes.end(),
+                                 index_first_pending);
+      std::iterator_traits<itr_t>::difference_type
+        non_pending = j - indexes.begin();
+      index_first_pending -= static_cast<dimension_type>(non_pending);
+    }
+  }
+
+  // NOTE: This method does *not* call set_sorted(false), because it preserves
+  // the relative row ordering.
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>::remove_trailing_rows(const dimension_type n) {
+  PPL_ASSERT(rows.size() >= n);
+  rows.resize(rows.size() - n);
+  if (first_pending_row() > rows.size())
+    index_first_pending = rows.size();
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>
+::permute_space_dimensions(const std::vector<Variable>& cycle) {
+  for (dimension_type i = num_rows(); i-- > 0; )
+    rows[i].permute_space_dimensions(cycle);
+  sorted = false;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Linear_System<Row>
+::swap_space_dimensions(Variable v1, Variable v2) {
+  PPL_ASSERT(v1.space_dimension() <= space_dimension());
+  PPL_ASSERT(v2.space_dimension() <= space_dimension());
+  for (dimension_type k = num_rows(); k-- > 0; )
+    rows[k].swap_space_dimensions(v1, v2);
+  sorted = false;
+  PPL_ASSERT(OK());
+}
+
+/*! \relates Linear_System */
+template <typename Row>
+inline bool
+operator!=(const Linear_System<Row>& x, const Linear_System<Row>& y) {
+  return !(x == y);
+}
+
+template <typename Row>
+inline bool
+Linear_System<Row>::Row_Less_Than::operator()(const Row& x,
+                                              const Row& y) const {
+  return compare(x, y) < 0;
+}
+
+template <typename Row>
+inline
+Linear_System<Row>::Unique_Compare
+::Unique_Compare(const Swapping_Vector<Row>& cont,
+                 dimension_type base)
+  : container(cont), base_index(base) {
+}
+
+template <typename Row>
+inline bool
+Linear_System<Row>::Unique_Compare
+::operator()(dimension_type i, dimension_type j) const {
+  return container[base_index + i].is_equal_to(container[base_index + j]);
+}
+
+/*! \relates Linear_System */
+template <typename Row>
+inline void
+swap(Linear_System<Row>& x, Linear_System<Row>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_System_inlines_hh)
diff --git a/src/Linear_System_templates.hh b/src/Linear_System_templates.hh
new file mode 100644
index 0000000..dd28e87
--- /dev/null
+++ b/src/Linear_System_templates.hh
@@ -0,0 +1,930 @@
+/* Linear_System class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Linear_System_templates_hh
+#define PPL_Linear_System_templates_hh 1
+
+#include "Bit_Matrix_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include <algorithm>
+#include <iostream>
+#include <string>
+#include <deque>
+
+#include "swapping_sort_templates.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+dimension_type
+Linear_System<Row>::num_lines_or_equalities() const {
+  PPL_ASSERT(num_pending_rows() == 0);
+  const Linear_System& x = *this;
+  dimension_type n = 0;
+  for (dimension_type i = num_rows(); i-- > 0; )
+    if (x[i].is_line_or_equality())
+      ++n;
+  return n;
+}
+
+template <typename Row>
+void
+Linear_System<Row>::merge_rows_assign(const Linear_System& y) {
+  PPL_ASSERT(space_dimension() >= y.space_dimension());
+  // Both systems have to be sorted and have no pending rows.
+  PPL_ASSERT(check_sorted() && y.check_sorted());
+  PPL_ASSERT(num_pending_rows() == 0 && y.num_pending_rows() == 0);
+
+  Linear_System& x = *this;
+
+  // A temporary vector...
+  Swapping_Vector<Row> tmp;
+  // ... with enough capacity not to require any reallocations.
+  tmp.reserve(compute_capacity(x.rows.size() + y.rows.size(),
+                               tmp.max_num_rows()));
+
+  dimension_type xi = 0;
+  const dimension_type x_num_rows = x.num_rows();
+  dimension_type yi = 0;
+  const dimension_type y_num_rows = y.num_rows();
+
+  while (xi < x_num_rows && yi < y_num_rows) {
+    const int comp = compare(x[xi], y[yi]);
+    if (comp <= 0) {
+      // Elements that can be taken from `x' are actually _stolen_ from `x'
+      tmp.resize(tmp.size() + 1);
+      swap(tmp.back(), x.rows[xi++]);
+      tmp.back().set_representation(representation());
+      if (comp == 0)
+        // A duplicate element.
+        ++yi;
+    }
+    else {
+      // (comp > 0)
+      tmp.resize(tmp.size() + 1);
+      Row copy(y[yi++], space_dimension(), representation());
+      swap(tmp.back(), copy);
+    }
+  }
+  // Insert what is left.
+  if (xi < x_num_rows)
+    while (xi < x_num_rows) {
+      tmp.resize(tmp.size() + 1);
+      swap(tmp.back(), x.rows[xi++]);
+      tmp.back().set_representation(representation());
+    }
+  else
+    while (yi < y_num_rows) {
+      tmp.resize(tmp.size() + 1);
+      Row copy(y[yi++], space_dimension(), representation());
+      swap(tmp.back(), copy);
+    }
+
+  // We get the result matrix and let the old one be destroyed.
+  swap(tmp, rows);
+  // There are no pending rows.
+  unset_pending_rows();
+  PPL_ASSERT(check_sorted());
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::ascii_dump(std::ostream& s) const {
+  // Prints the topology, the number of rows, the number of columns
+  // and the sorted flag.  The specialized methods provided by
+  // Constraint_System and Generator_System take care of properly
+  // printing the contents of the system.
+  s << "topology " << (is_necessarily_closed()
+                       ? "NECESSARILY_CLOSED"
+                       : "NOT_NECESSARILY_CLOSED")
+    << "\n"
+    << num_rows() << " x " << space_dimension() << " ";
+  Parma_Polyhedra_Library::ascii_dump(s, representation());
+  s << " " << (sorted ? "(sorted)" : "(not_sorted)")
+    << "\n"
+    << "index_first_pending " << first_pending_row()
+    << "\n";
+  for (dimension_type i = 0; i < rows.size(); ++i)
+    rows[i].ascii_dump(s);
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(Row, Linear_System<Row>)
+
+template <typename Row>
+bool
+Linear_System<Row>::ascii_load(std::istream& s) {
+  std::string str;
+  if (!(s >> str) || str != "topology")
+    return false;
+  if (!(s >> str))
+    return false;
+
+  clear();
+
+  Topology t;
+  if (str == "NECESSARILY_CLOSED")
+    t = NECESSARILY_CLOSED;
+  else {
+    if (str != "NOT_NECESSARILY_CLOSED")
+      return false;
+    t = NOT_NECESSARILY_CLOSED;
+  }
+
+  set_topology(t);
+
+  dimension_type nrows;
+  dimension_type space_dims;
+  if (!(s >> nrows))
+    return false;
+  if (!(s >> str) || str != "x")
+    return false;
+  if (!(s >> space_dims))
+    return false;
+
+  space_dimension_ = space_dims;
+
+  if (!Parma_Polyhedra_Library::ascii_load(s, representation_))
+    return false;
+
+  if (!(s >> str) || (str != "(sorted)" && str != "(not_sorted)"))
+    return false;
+  const bool sortedness = (str == "(sorted)");
+  dimension_type index;
+  if (!(s >> str) || str != "index_first_pending")
+    return false;
+  if (!(s >> index))
+    return false;
+
+  Row row;
+  for (dimension_type i = 0; i < nrows; ++i) {
+    if (!row.ascii_load(s))
+      return false;
+    insert(row, Recycle_Input());
+  }
+  index_first_pending = index;
+  sorted = sortedness;
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert(const Row& r) {
+  Row tmp(r, representation());
+  insert(tmp, Recycle_Input());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert(Row& r, Recycle_Input) {
+  insert_no_ok(r, Recycle_Input());
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert_no_ok(Row& r, Recycle_Input) {
+  PPL_ASSERT(topology() == r.topology());
+  // This method is only used when the system has no pending rows.
+  PPL_ASSERT(num_pending_rows() == 0);
+
+  const bool was_sorted = is_sorted();
+
+  insert_pending_no_ok(r, Recycle_Input());
+
+  if (was_sorted) {
+    const dimension_type nrows = num_rows();
+    // The added row may have caused the system to be not sorted anymore.
+    if (nrows > 1) {
+      // If the system is not empty and the inserted row is the
+      // greatest one, the system is set to be sorted.
+      // If it is not the greatest one then the system is no longer sorted.
+      sorted = (compare(rows[nrows-2], rows[nrows-1]) <= 0);
+    }
+    else
+      // A system having only one row is sorted.
+      sorted = true;
+  }
+
+  unset_pending_rows();
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert_pending_no_ok(Row& r, Recycle_Input) {
+  // TODO: A Grid_Generator_System may contain non-normalized lines that
+  // represent parameters, so this check is disabled. Consider re-enabling it
+  // when it's possibile.
+#if 0
+  // The added row must be strongly normalized and have the same
+  // number of elements as the existing rows of the system.
+  PPL_ASSERT(r.check_strong_normalized());
+#endif
+
+  PPL_ASSERT(r.topology() == topology());
+
+  r.set_representation(representation());
+
+  if (space_dimension() < r.space_dimension())
+    set_space_dimension_no_ok(r.space_dimension());
+  else
+    r.set_space_dimension_no_ok(space_dimension());
+
+  rows.resize(rows.size() + 1);
+  swap(rows.back(), r);
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert_pending(const Row& r) {
+  Row tmp(r, representation());
+  insert_pending(tmp, Recycle_Input());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert_pending(Row& r, Recycle_Input) {
+  insert_pending_no_ok(r, Recycle_Input());
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert_pending(const Linear_System& y) {
+  Linear_System tmp(y, representation(), With_Pending());
+  insert_pending(tmp, Recycle_Input());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert_pending(Linear_System& y, Recycle_Input) {
+  Linear_System& x = *this;
+  PPL_ASSERT(x.space_dimension() == y.space_dimension());
+
+  // Steal the rows of `y'.
+  // This loop must use an increasing index (instead of a decreasing one) to
+  // preserve the row ordering.
+  for (dimension_type i = 0; i < y.num_rows(); ++i)
+    x.insert_pending(y.rows[i], Recycle_Input());
+
+  y.clear();
+
+  PPL_ASSERT(x.OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert(const Linear_System& y) {
+  Linear_System tmp(y, representation(), With_Pending());
+  insert(tmp, Recycle_Input());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::insert(Linear_System& y, Recycle_Input) {
+  PPL_ASSERT(num_pending_rows() == 0);
+
+  // Adding no rows is a no-op.
+  if (y.has_no_rows())
+    return;
+
+  // Check if sortedness is preserved.
+  if (is_sorted()) {
+    if (!y.is_sorted() || y.num_pending_rows() > 0)
+      sorted = false;
+    else {
+      // `y' is sorted and has no pending rows.
+      const dimension_type n_rows = num_rows();
+      if (n_rows > 0)
+        sorted = (compare(rows[n_rows-1], y[0]) <= 0);
+    }
+  }
+
+  // Add the rows of `y' as if they were pending.
+  insert_pending(y, Recycle_Input());
+
+  // TODO: May y have pending rows? Should they remain pending?
+
+  // There are no pending_rows.
+  unset_pending_rows();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::remove_space_dimensions(const Variables_Set& vars) {
+  // Dimension-compatibility assertion.
+  PPL_ASSERT(space_dimension() >= vars.space_dimension());
+
+  // The removal of no dimensions from any system is a no-op.  This
+  // case also captures the only legal removal of dimensions from a
+  // 0-dim system.
+  if (vars.empty())
+    return;
+
+  // NOTE: num_rows() is *not* constant, because it may be decreased by
+  // remove_row_no_ok().
+  for (dimension_type i = 0; i < num_rows(); ) {
+    const bool valid = rows[i].remove_space_dimensions(vars);
+    if (!valid) {
+      // Remove the current row.
+      // We can't call remove_row(i) here, because the system is not OK as
+      // some rows already have the new space dimension and others still have
+      // the old one.
+      remove_row_no_ok(i, false);
+    }
+    else
+      ++i;
+  }
+
+  space_dimension_ -= vars.size();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::shift_space_dimensions(Variable v, dimension_type n) {
+  // NOTE: v.id() may be equal to the space dimension of the system
+  // (when no space dimension need to be shifted).
+  PPL_ASSERT(v.id() <= space_dimension());
+  for (dimension_type i = rows.size(); i-- > 0; )
+    rows[i].shift_space_dimensions(v, n);
+  space_dimension_ += n;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::sort_rows() {
+  // We sort the non-pending rows only.
+  sort_rows(0, first_pending_row());
+  sorted = true;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::sort_rows(const dimension_type first_row,
+                              const dimension_type last_row) {
+  PPL_ASSERT(first_row <= last_row && last_row <= num_rows());
+  // We cannot mix pending and non-pending rows.
+  PPL_ASSERT(first_row >= first_pending_row()
+             || last_row <= first_pending_row());
+
+  const bool sorting_pending = (first_row >= first_pending_row());
+  const dimension_type old_num_pending = num_pending_rows();
+
+  const dimension_type num_elems = last_row - first_row;
+  if (num_elems < 2)
+    return;
+
+  // Build the function objects implementing indirect sort comparison,
+  // indirect unique comparison and indirect swap operation.
+  using namespace Implementation;
+  typedef Swapping_Vector<Row> Cont;
+  typedef Indirect_Sort_Compare<Cont, Row_Less_Than> Sort_Compare;
+  typedef Indirect_Swapper<Cont> Swapper;
+  const dimension_type num_duplicates
+    = indirect_sort_and_unique(num_elems,
+                               Sort_Compare(rows, first_row),
+                               Unique_Compare(rows, first_row),
+                               Swapper(rows, first_row));
+
+  if (num_duplicates > 0) {
+    typedef typename Cont::iterator Iter;
+    typedef typename std::iterator_traits<Iter>::difference_type diff_t;
+    Iter last = rows.begin() + static_cast<diff_t>(last_row);
+    Iter first = last - + static_cast<diff_t>(num_duplicates);
+    rows.erase(first, last);
+  }
+
+  if (sorting_pending) {
+    PPL_ASSERT(old_num_pending >= num_duplicates);
+    index_first_pending = num_rows() - (old_num_pending - num_duplicates);
+  }
+  else {
+    index_first_pending = num_rows() - old_num_pending;
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::strong_normalize() {
+  const dimension_type nrows = rows.size();
+  // We strongly normalize also the pending rows.
+  for (dimension_type i = nrows; i-- > 0; )
+    rows[i].strong_normalize();
+  sorted = (nrows <= 1);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::sign_normalize() {
+  const dimension_type nrows = rows.size();
+  // We sign-normalize also the pending rows.
+  for (dimension_type i = nrows; i-- > 0; )
+    rows[i].sign_normalize();
+  sorted = (nrows <= 1);
+  PPL_ASSERT(OK());
+}
+
+/*! \relates Parma_Polyhedra_Library::Linear_System */
+template <typename Row>
+bool
+operator==(const Linear_System<Row>& x, const Linear_System<Row>& y) {
+  if (x.space_dimension() != y.space_dimension())
+    return false;
+  const dimension_type x_num_rows = x.num_rows();
+  const dimension_type y_num_rows = y.num_rows();
+  if (x_num_rows != y_num_rows)
+    return false;
+  if (x.first_pending_row() != y.first_pending_row())
+    return false;
+  // TODO: Check if the following comment is up to date.
+  // Notice that calling operator==(const Swapping_Vector<Row>&,
+  //                                const Swapping_Vector<Row>&)
+  // would be wrong here, as equality of the type fields would
+  // not be checked.
+  for (dimension_type i = x_num_rows; i-- > 0; )
+    if (x[i] != y[i])
+      return false;
+  return true;
+}
+
+template <typename Row>
+void
+Linear_System<Row>::sort_and_remove_with_sat(Bit_Matrix& sat) {
+  // We can only sort the non-pending part of the system.
+  PPL_ASSERT(first_pending_row() == sat.num_rows());
+  if (first_pending_row() <= 1) {
+    set_sorted(true);
+    return;
+  }
+
+  const dimension_type num_elems = sat.num_rows();
+  // Build the function objects implementing indirect sort comparison,
+  // indirect unique comparison and indirect swap operation.
+  typedef Swapping_Vector<Row> Cont;
+  const Implementation::Indirect_Sort_Compare<Cont, Row_Less_Than>
+    sort_cmp(rows);
+  const Unique_Compare unique_cmp(rows);
+  const Implementation::Indirect_Swapper2<Cont, Bit_Matrix> swapper(rows, sat);
+
+  const dimension_type num_duplicates
+    = Implementation::indirect_sort_and_unique(num_elems, sort_cmp,
+                                               unique_cmp, swapper);
+
+  const dimension_type new_first_pending_row
+    = first_pending_row() - num_duplicates;
+
+  if (num_pending_rows() > 0) {
+    // In this case, we must put the duplicates after the pending rows.
+    const dimension_type n_rows = num_rows() - 1;
+    for (dimension_type i = 0; i < num_duplicates; ++i)
+      swap(rows[new_first_pending_row + i], rows[n_rows - i]);
+  }
+
+  // Erasing the duplicated rows...
+  rows.resize(rows.size() - num_duplicates);
+  index_first_pending = new_first_pending_row;
+  // ... and the corresponding rows of the saturation matrix.
+  sat.remove_trailing_rows(num_duplicates);
+
+  // Now the system is sorted.
+  sorted = true;
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+dimension_type
+Linear_System<Row>::gauss(const dimension_type n_lines_or_equalities) {
+  // This method is only applied to a linear system having no pending rows and
+  // exactly `n_lines_or_equalities' lines or equalities, all of which occur
+  // before the rays or points or inequalities.
+  PPL_ASSERT(num_pending_rows() == 0);
+  PPL_ASSERT(n_lines_or_equalities == num_lines_or_equalities());
+#ifndef NDEBUG
+  for (dimension_type i = n_lines_or_equalities; i-- > 0; )
+    PPL_ASSERT((*this)[i].is_line_or_equality());
+#endif
+
+  dimension_type rank = 0;
+  // Will keep track of the variations on the system of equalities.
+  bool changed = false;
+  // TODO: Don't use the number of columns.
+  const dimension_type num_cols
+    = is_necessarily_closed() ? space_dimension() + 1 : space_dimension() + 2;
+  // TODO: Consider exploiting the row (possible) sparseness of rows in the
+  // following loop, if needed. It would probably make it more cache-efficient
+  // for dense rows, too.
+  for (dimension_type j = num_cols; j-- > 0; )
+    for (dimension_type i = rank; i < n_lines_or_equalities; ++i) {
+      // Search for the first row having a non-zero coefficient
+      // (the pivot) in the j-th column.
+      if ((*this)[i].expr.get(j) == 0)
+        continue;
+      // Pivot found: if needed, swap rows so that this one becomes
+      // the rank-th row in the linear system.
+      if (i > rank) {
+        swap(rows[i], rows[rank]);
+        // After swapping the system is no longer sorted.
+        changed = true;
+      }
+      // Combine the row containing the pivot with all the lines or
+      // equalities following it, so that all the elements on the j-th
+      // column in these rows become 0.
+      for (dimension_type k = i + 1; k < n_lines_or_equalities; ++k) {
+        if (rows[k].expr.get(Variable(j - 1)) != 0) {
+          rows[k].linear_combine(rows[rank], j);
+          changed = true;
+        }
+      }
+      // Already dealt with the rank-th row.
+      ++rank;
+      // Consider another column index `j'.
+      break;
+    }
+  if (changed)
+    sorted = false;
+
+  PPL_ASSERT(OK());
+  return rank;
+}
+
+template <typename Row>
+void
+Linear_System<Row>
+::back_substitute(const dimension_type n_lines_or_equalities) {
+  // This method is only applied to a system having no pending rows and
+  // exactly `n_lines_or_equalities' lines or equalities, all of which occur
+  // before the first ray or point or inequality.
+  PPL_ASSERT(num_pending_rows() == 0);
+  PPL_ASSERT(n_lines_or_equalities <= num_lines_or_equalities());
+#ifndef NDEBUG
+  for (dimension_type i = n_lines_or_equalities; i-- > 0; )
+    PPL_ASSERT((*this)[i].is_line_or_equality());
+#endif
+
+  const dimension_type nrows = num_rows();
+  // Trying to keep sortedness.
+  bool still_sorted = is_sorted();
+  // This deque of Booleans will be used to flag those rows that,
+  // before exiting, need to be re-checked for sortedness.
+  std::deque<bool> check_for_sortedness;
+  if (still_sorted)
+    check_for_sortedness.insert(check_for_sortedness.end(), nrows, false);
+
+  for (dimension_type k = n_lines_or_equalities; k-- > 0; ) {
+    // For each line or equality, starting from the last one,
+    // looks for the last non-zero element.
+    // `j' will be the index of such a element.
+    Row& row_k = rows[k];
+    const dimension_type j = row_k.expr.last_nonzero();
+    // TODO: Check this.
+    PPL_ASSERT(j != 0);
+
+    // Go through the equalities above `row_k'.
+    for (dimension_type i = k; i-- > 0; ) {
+      Row& row_i = rows[i];
+      if (row_i.expr.get(Variable(j - 1)) != 0) {
+        // Combine linearly `row_i' with `row_k'
+        // so that `row_i[j]' becomes zero.
+        row_i.linear_combine(row_k, j);
+        if (still_sorted) {
+          // Trying to keep sortedness: remember which rows
+          // have to be re-checked for sortedness at the end.
+          if (i > 0)
+            check_for_sortedness[i-1] = true;
+          check_for_sortedness[i] = true;
+        }
+      }
+    }
+
+    // Due to strong normalization during previous iterations,
+    // the pivot coefficient `row_k[j]' may now be negative.
+    // Since an inequality (or ray or point) cannot be multiplied
+    // by a negative factor, the coefficient of the pivot must be
+    // forced to be positive.
+    const bool have_to_negate = (row_k.expr.get(Variable(j - 1)) < 0);
+    if (have_to_negate)
+      neg_assign(row_k.expr);
+
+    // NOTE: Here row_k will *not* be ok if we have negated it.
+
+    // Note: we do not mark index `k' in `check_for_sortedness',
+    // because we will later negate back the row.
+
+    // Go through all the other rows of the system.
+    for (dimension_type i = n_lines_or_equalities; i < nrows; ++i) {
+      Row& row_i = rows[i];
+      if (row_i.expr.get(Variable(j - 1)) != 0) {
+        // Combine linearly the `row_i' with `row_k'
+        // so that `row_i[j]' becomes zero.
+        row_i.linear_combine(row_k, j);
+        if (still_sorted) {
+          // Trying to keep sortedness: remember which rows
+          // have to be re-checked for sortedness at the end.
+          if (i > n_lines_or_equalities)
+            check_for_sortedness[i-1] = true;
+          check_for_sortedness[i] = true;
+        }
+      }
+    }
+    if (have_to_negate)
+      // Negate `row_k' to restore strong-normalization.
+      neg_assign(row_k.expr);
+
+    PPL_ASSERT(row_k.OK());
+  }
+
+  // Trying to keep sortedness.
+  for (dimension_type i = 0; still_sorted && i+1 < nrows; ++i)
+    if (check_for_sortedness[i])
+      // Have to check sortedness of `(*this)[i]' with respect to `(*this)[i+1]'.
+      still_sorted = (compare((*this)[i], (*this)[i+1]) <= 0);
+
+  // Set the sortedness flag.
+  sorted = still_sorted;
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>::simplify() {
+  // This method is only applied to a system having no pending rows.
+  PPL_ASSERT(num_pending_rows() == 0);
+
+  // Partially sort the linear system so that all lines/equalities come first.
+  const dimension_type old_nrows = num_rows();
+  dimension_type nrows = old_nrows;
+  dimension_type n_lines_or_equalities = 0;
+  for (dimension_type i = 0; i < nrows; ++i)
+    if ((*this)[i].is_line_or_equality()) {
+      if (n_lines_or_equalities < i) {
+        swap(rows[i], rows[n_lines_or_equalities]);
+        // The system was not sorted.
+        PPL_ASSERT(!sorted);
+      }
+      ++n_lines_or_equalities;
+    }
+  // Apply Gaussian elimination to the subsystem of lines/equalities.
+  const dimension_type rank = gauss(n_lines_or_equalities);
+  // Eliminate any redundant line/equality that has been detected.
+  if (rank < n_lines_or_equalities) {
+    const dimension_type
+      n_rays_or_points_or_inequalities = nrows - n_lines_or_equalities;
+    const dimension_type
+      num_swaps = std::min(n_lines_or_equalities - rank,
+                           n_rays_or_points_or_inequalities);
+    for (dimension_type i = num_swaps; i-- > 0; )
+      swap(rows[--nrows], rows[rank + i]);
+    remove_trailing_rows(old_nrows - nrows);
+    if (n_rays_or_points_or_inequalities > num_swaps)
+      set_sorted(false);
+    unset_pending_rows();
+    n_lines_or_equalities = rank;
+  }
+  // Apply back-substitution to the system of rays/points/inequalities.
+  back_substitute(n_lines_or_equalities);
+
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Linear_System<Row>
+::add_universe_rows_and_space_dimensions(const dimension_type n) {
+  PPL_ASSERT(n > 0);
+  const bool was_sorted = is_sorted();
+  const dimension_type old_n_rows = num_rows();
+  const dimension_type old_space_dim
+    = is_necessarily_closed() ? space_dimension() : space_dimension() + 1;
+  set_space_dimension(space_dimension() + n);
+  rows.resize(rows.size() + n);
+  // The old system is moved to the bottom.
+  for (dimension_type i = old_n_rows; i-- > 0; )
+    swap(rows[i], rows[i + n]);
+  for (dimension_type i = n, c = old_space_dim; i-- > 0; ) {
+    // The top right-hand sub-system (i.e., the system made of new
+    // rows and columns) is set to the specular image of the identity
+    // matrix.
+    if (Variable(c).space_dimension() <= space_dimension()) {
+      // Variable(c) is a user variable.
+      Linear_Expression le(representation());
+      le.set_space_dimension(space_dimension());
+      le += Variable(c);
+      Row r(le, Row::LINE_OR_EQUALITY, row_topology);
+      swap(r, rows[i]);
+    }
+    else {
+      // Variable(c) is the epsilon dimension.
+      PPL_ASSERT(row_topology == NOT_NECESSARILY_CLOSED);
+      Linear_Expression le(Variable(c), representation());
+      Row r(le, Row::LINE_OR_EQUALITY, NECESSARILY_CLOSED);
+      r.mark_as_not_necessarily_closed();
+      swap(r, rows[i]);
+      // Note: `r' is strongly normalized.
+    }
+    ++c;
+  }
+  // If the old system was empty, the last row added is either
+  // a positivity constraint or a point.
+  if (was_sorted)
+    sorted = (compare(rows[n-1], rows[n]) <= 0);
+
+  // If the system is not necessarily closed, move the epsilon coefficients to
+  // the last column.
+  if (!is_necessarily_closed()) {
+    // Try to preserve sortedness of `gen_sys'.
+    PPL_ASSERT(old_space_dim != 0);
+    if (!is_sorted()) {
+      for (dimension_type i = n; i-- > 0; ) {
+        rows[i].expr.swap_space_dimensions(Variable(old_space_dim - 1),
+                                           Variable(old_space_dim - 1 + n));
+        PPL_ASSERT(rows[i].OK());
+      }
+    }
+    else {
+      dimension_type old_eps_index = old_space_dim - 1;
+      // The upper-right corner of `rows' contains the J matrix:
+      // swap coefficients to preserve sortedness.
+      for (dimension_type i = n; i-- > 0; ++old_eps_index) {
+        rows[i].expr.swap_space_dimensions(Variable(old_eps_index),
+                                           Variable(old_eps_index + 1));
+        PPL_ASSERT(rows[i].OK());
+      }
+
+      sorted = true;
+    }
+  }
+  // NOTE: this already checks for OK().
+  set_index_first_pending_row(index_first_pending + n);
+}
+
+template <typename Row>
+void
+Linear_System<Row>::sort_pending_and_remove_duplicates() {
+  PPL_ASSERT(num_pending_rows() > 0);
+  PPL_ASSERT(is_sorted());
+
+  // The non-pending part of the system is already sorted.
+  // Now sorting the pending part..
+  const dimension_type first_pending = first_pending_row();
+  sort_rows(first_pending, num_rows());
+  // Recompute the number of rows, because we may have removed
+  // some rows occurring more than once in the pending part.
+  const dimension_type old_num_rows = num_rows();
+  dimension_type num_rows = old_num_rows;
+
+  dimension_type k1 = 0;
+  dimension_type k2 = first_pending;
+  dimension_type num_duplicates = 0;
+  // In order to erase them, put at the end of the system
+  // those pending rows that also occur in the non-pending part.
+  while (k1 < first_pending && k2 < num_rows) {
+    const int cmp = compare(rows[k1], rows[k2]);
+    if (cmp == 0) {
+      // We found the same row.
+      ++num_duplicates;
+      --num_rows;
+      // By initial sortedness, we can increment index `k1'.
+      ++k1;
+      // Do not increment `k2'; instead, swap there the next pending row.
+      if (k2 < num_rows)
+        swap(rows[k2], rows[k2 + num_duplicates]);
+    }
+    else if (cmp < 0)
+      // By initial sortedness, we can increment `k1'.
+      ++k1;
+    else {
+      // Here `cmp > 0'.
+      // Increment `k2' and, if we already found any duplicate,
+      // swap the next pending row in position `k2'.
+      ++k2;
+      if (num_duplicates > 0 && k2 < num_rows)
+        swap(rows[k2], rows[k2 + num_duplicates]);
+    }
+  }
+  // If needed, swap any duplicates found past the pending rows
+  // that has not been considered yet; then erase the duplicates.
+  if (num_duplicates > 0) {
+    if (k2 < num_rows)
+      for (++k2; k2 < num_rows; ++k2)
+        swap(rows[k2], rows[k2 + num_duplicates]);
+    rows.resize(num_rows);
+  }
+  sorted = true;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+bool
+Linear_System<Row>::check_sorted() const {
+  for (dimension_type i = first_pending_row(); i-- > 1; )
+    if (compare(rows[i], rows[i-1]) < 0)
+      return false;
+  return true;
+}
+
+template <typename Row>
+bool
+Linear_System<Row>::OK() const {
+#ifndef NDEBUG
+  using std::endl;
+  using std::cerr;
+#endif
+
+  for (dimension_type i = rows.size(); i-- > 0; ) {
+    if (rows[i].representation() != representation()) {
+#ifndef NDEBUG
+      cerr << "Linear_System has a row with the wrong representation!"
+           << endl;
+#endif
+      return false;
+    }
+    if (rows[i].space_dimension() != space_dimension()) {
+#ifndef NDEBUG
+      cerr << "Linear_System has a row with the wrong number of space dimensions!"
+           << endl;
+#endif
+      return false;
+    }
+  }
+
+  for (dimension_type i = rows.size(); i-- > 0; )
+    if (rows[i].topology() != topology()) {
+#ifndef NDEBUG
+      cerr << "Linear_System has a row with the wrong topology!"
+           << endl;
+#endif
+      return false;
+    }
+
+  // `index_first_pending' must be less than or equal to `num_rows()'.
+  if (first_pending_row() > num_rows()) {
+#ifndef NDEBUG
+    cerr << "Linear_System has a negative number of pending rows!"
+         << endl;
+#endif
+    return false;
+  }
+
+  // Check for topology mismatches.
+  const dimension_type n_rows = num_rows();
+  for (dimension_type i = 0; i < n_rows; ++i)
+    if (topology() != rows[i].topology()) {
+#ifndef NDEBUG
+      cerr << "Topology mismatch between the system "
+           << "and one of its rows!"
+           << endl;
+#endif
+      return false;
+    }
+
+  if (sorted && !check_sorted()) {
+#ifndef NDEBUG
+    cerr << "The system declares itself to be sorted but it is not!"
+         << endl;
+#endif
+    return false;
+  }
+
+  // All checks passed.
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_System_templates_hh)
diff --git a/src/Linear_System_types.hh b/src/Linear_System_types.hh
new file mode 100644
index 0000000..7a8355c
--- /dev/null
+++ b/src/Linear_System_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Linear_System_types_hh
+#define PPL_Linear_System_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+class Linear_System;
+
+template <typename Row>
+class Linear_System_With_Bit_Matrix_iterator;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Linear_System_types_hh)
diff --git a/src/MIP_Problem.cc b/src/MIP_Problem.cc
index ed00a0f..251f106 100644
--- a/src/MIP_Problem.cc
+++ b/src/MIP_Problem.cc
@@ -1,6 +1,6 @@
 /* MIP_Problem class implementation: non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,17 +22,17 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "MIP_Problem.defs.hh"
-#include "globals.defs.hh"
-#include "Checked_Number.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Constraint.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Generator.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "math_utilities.defs.hh"
+#include "MIP_Problem_defs.hh"
+#include "globals_defs.hh"
+#include "Checked_Number_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Constraint_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Generator_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "math_utilities_defs.hh"
 
 #include <stdexcept>
 #include <deque>
@@ -45,8 +45,8 @@ site: http://bugseng.com/products/ppl/ . */
 
 // These are needed for the linear_combine() method that takes a Dense_Row and
 // a Sparse_Row.
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
 
 #endif // PPL_USE_SPARSE_MATRIX
 
@@ -359,9 +359,9 @@ PPL::MIP_Problem::add_space_dimensions_and_embed(const dimension_type m) {
   // overflow the maximum allowed space dimension.
   if (m > max_space_dimension() - space_dimension())
     throw std::length_error("PPL::MIP_Problem::"
-			    "add_space_dimensions_and_embed(m):\n"
-			    "adding m new space dimensions exceeds "
-			    "the maximum allowed space dimension.");
+                            "add_space_dimensions_and_embed(m):\n"
+                            "adding m new space dimensions exceeds "
+                            "the maximum allowed space dimension.");
   external_space_dim += m;
   if (status != UNSATISFIABLE)
     status = PARTIALLY_SATISFIABLE;
@@ -441,7 +441,7 @@ bool
 PPL::MIP_Problem::is_satisfied(const Constraint& c, const Generator& g) {
   // Scalar_Products::sign() requires the second argument to be at least
   // as large as the first one.
-  int sp_sign
+  const int sp_sign
     = (g.space_dimension() <= c.space_dimension())
     ? Scalar_Products::sign(g, c)
     : Scalar_Products::sign(c, g);
@@ -452,7 +452,7 @@ bool
 PPL::MIP_Problem::is_saturated(const Constraint& c, const Generator& g) {
   // Scalar_Products::sign() requires the space dimension of the second
   // argument to be at least as large as the one of the first one.
-  int sp_sign
+  const int sp_sign
     = (g.space_dimension() <= c.space_dimension())
     ? Scalar_Products::sign(g, c)
     : Scalar_Products::sign(c, g);
@@ -527,10 +527,10 @@ PPL::MIP_Problem
     const Constraint& cs_i = *(input_cs[i]);
     const dimension_type cs_i_end = cs_i.space_dimension() + 1;
 
-    dimension_type nonzero_coeff_column_index
+    const dimension_type nonzero_coeff_column_index
       = cs_i.expression().first_nonzero(1, cs_i_end);
-    bool found_a_nonzero_coeff = (nonzero_coeff_column_index != cs_i_end);
-    bool found_many_nonzero_coeffs
+    const bool found_a_nonzero_coeff = (nonzero_coeff_column_index != cs_i_end);
+    const bool found_many_nonzero_coeffs
       = (found_a_nonzero_coeff
          && !cs_i.expression().all_zeroes(nonzero_coeff_column_index + 1,
                                                cs_i_end));
@@ -642,7 +642,7 @@ PPL::MIP_Problem
   return true;
 }
 
-bool
+void
 PPL::MIP_Problem::process_pending_constraints() {
   // Check the pending constraints to adjust the data structures.
   // If `false' is returned, they are trivially unfeasible.
@@ -656,10 +656,10 @@ PPL::MIP_Problem::process_pending_constraints() {
                          additional_slack_vars,
                          is_tableau_constraint,
                          is_satisfied_inequality,
-			 is_nonnegative_variable,
-			 is_remergeable_variable)) {
+                         is_nonnegative_variable,
+                         is_remergeable_variable)) {
     status = UNSATISFIABLE;
-    return false;
+    return;
   }
 
   // Merge back any variable that was previously split into a positive
@@ -776,9 +776,9 @@ PPL::MIP_Problem::process_pending_constraints() {
     Row::iterator itr = tableau_k.end();
 
     const Constraint& c = *(input_cs[i + first_pending_constraint]);
-    const Constraint::Expression& c_e = c.expression();
-    for (Constraint::Expression::const_iterator j = c_e.begin(), j_end = c_e.end();
-        j != j_end; ++j) {
+    const Constraint::expr_type c_e = c.expression();
+    for (Constraint::expr_type::const_iterator j = c_e.begin(),
+           j_end = c_e.end(); j != j_end; ++j) {
       Coefficient_traits::const_reference coeff_sd = *j;
       const std::pair<dimension_type, dimension_type> mapped
         = mapping[j.variable().space_dimension()];
@@ -789,8 +789,7 @@ PPL::MIP_Problem::process_pending_constraints() {
         neg_assign(*itr, coeff_sd);
       }
     }
-    Coefficient_traits::const_reference inhomo
-      = c.inhomogeneous_term();
+    Coefficient_traits::const_reference inhomo = c.inhomogeneous_term();
     if (inhomo != 0) {
       tableau_k.insert(itr, mapping[0].first, inhomo);
       // Split if needed.
@@ -885,7 +884,7 @@ PPL::MIP_Problem::process_pending_constraints() {
   if (space_dimension() == 0) {
     status = OPTIMIZED;
     last_generator = point();
-    return true;
+    return;
   }
   // Deal with trivial cases.
   // If there is no constraint in the tableau, then the feasible region
@@ -898,7 +897,7 @@ PPL::MIP_Problem::process_pending_constraints() {
       last_generator = point();
       last_generator.set_space_dimension(space_dimension());
       status = UNBOUNDED;
-      return true;
+      return;
     }
 
     // The problem is neither trivially unfeasible nor trivially unbounded.
@@ -908,12 +907,11 @@ PPL::MIP_Problem::process_pending_constraints() {
     // Ensure the right space dimension is obtained.
     last_generator = point();
     last_generator.set_space_dimension(space_dimension());
-    PPL_ASSERT(OK());
-    return true;
+    return;
   }
 
   // Now we are ready to solve the first phase.
-  bool first_phase_successful
+  const bool first_phase_successful
     = (get_control_parameter(PRICING) == PRICING_STEEPEST_EDGE_FLOAT)
     ? compute_simplex_using_steepest_edge_float()
     : compute_simplex_using_exact_pricing();
@@ -927,7 +925,7 @@ PPL::MIP_Problem::process_pending_constraints() {
   if (!first_phase_successful || working_cost.get(0) != 0) {
     // The feasible region is empty.
     status = UNSATISFIABLE;
-    return false;
+    return;
   }
 
   // Prepare *this for a possible second phase.
@@ -935,8 +933,6 @@ PPL::MIP_Problem::process_pending_constraints() {
     erase_artificials(begin_artificials, end_artificials);
   compute_generator();
   status = SATISFIABLE;
-  PPL_ASSERT(OK());
-  return true;
 }
 
 namespace {
@@ -1035,7 +1031,7 @@ PPL::MIP_Problem::steepest_edge_float_entering_index() const {
   // this implementation and the dense implementation below.
   for (std::vector<std::pair<dimension_type, double> >::const_reverse_iterator
        i = columns.rbegin(), i_end = columns.rend(); i != i_end; ++i) {
-    double challenger_value = sqrt(i->second);
+    const double challenger_value = sqrt(i->second);
     if (entering_index == 0 || challenger_value > current_value) {
       current_value = challenger_value;
       entering_index = i->first;
@@ -1208,7 +1204,8 @@ PPL::MIP_Problem::steepest_edge_exact_entering_index() const {
         swap(current_denom, k->second);
         entering_index = k->first;
       }
-    } else {
+    }
+    else {
       PPL_ASSERT(working_cost.get(k->first) == 0);
       // Initialization during the first loop.
       if (entering_index == 0) {
@@ -1366,8 +1363,8 @@ PPL::MIP_Problem::is_unbounded_obj_function(
   const std::vector<std::pair<dimension_type, dimension_type> >& mapping,
   Optimization_Mode optimization_mode) {
 
-  for (Linear_Expression::const_iterator i = x.begin(), i_end = x.end();
-        i != i_end; ++i) {
+  for (Linear_Expression::const_iterator i = x.begin(),
+         i_end = x.end(); i != i_end; ++i) {
     // If a the value of a variable in the objective function is
     // different from zero, the final status is unbounded.
     // In the first part the variable is constrained to be greater or equal
@@ -1377,7 +1374,8 @@ PPL::MIP_Problem::is_unbounded_obj_function(
     if (optimization_mode == MAXIMIZATION) {
       if (*i > 0)
         return true;
-    } else {
+    }
+    else {
       PPL_ASSERT(optimization_mode == MINIMIZATION);
       if (*i < 0)
         return true;
@@ -1794,8 +1792,8 @@ PPL::MIP_Problem::second_phase() {
 
   // Negate the cost function if we are minimizing.
   if (opt_mode == MINIMIZATION)
-    for (Row::iterator
-         i = new_cost.begin(), i_end = new_cost.end(); i != i_end; ++i)
+    for (Row::iterator i = new_cost.begin(),
+           i_end = new_cost.end(); i != i_end; ++i)
       neg_assign(*i);
 
   const dimension_type cost_zero_size = working_cost.size();
@@ -1811,9 +1809,8 @@ PPL::MIP_Problem::second_phase() {
       = working_cost.insert(cost_zero_size - 1, Coefficient_one());
 
     // Split the variables in the cost function.
-    for (Row::const_iterator
-         i = new_cost.lower_bound(1), i_end = new_cost.end();
-         i != i_end; ++i) {
+    for (Row::const_iterator i = new_cost.lower_bound(1),
+           i_end = new_cost.end(); i != i_end; ++i) {
       const dimension_type index = i.index();
       const dimension_type original_var = mapping[index].first;
       const dimension_type split_var = mapping[index].second;
@@ -1840,14 +1837,14 @@ PPL::MIP_Problem::second_phase() {
   }
 
   // Solve the second phase problem.
-  bool second_phase_successful
+  const bool second_phase_successful
     = (get_control_parameter(PRICING) == PRICING_STEEPEST_EDGE_FLOAT)
     ? compute_simplex_using_steepest_edge_float()
     : compute_simplex_using_exact_pricing();
   compute_generator();
 #if PPL_NOISY_SIMPLEX
   std::cout << "MIP_Problem::second_phase(): 2nd phase ended at iteration "
-	    << num_iterations
+            << num_iterations
             << "." << std::endl;
 #endif // PPL_NOISY_SIMPLEX
   status = second_phase_successful ? OPTIMIZED : UNBOUNDED;
@@ -1862,12 +1859,12 @@ PPL::MIP_Problem
   const dimension_type ep_space_dim = evaluating_point.space_dimension();
   if (space_dimension() < ep_space_dim)
     throw std::invalid_argument("PPL::MIP_Problem::"
-				"evaluate_objective_function(p, n, d):\n"
-				"*this and p are dimension incompatible.");
+                                "evaluate_objective_function(p, n, d):\n"
+                                "*this and p are dimension incompatible.");
   if (!evaluating_point.is_point())
     throw std::invalid_argument("PPL::MIP_Problem::"
-				"evaluate_objective_function(p, n, d):\n"
-				"p is not a point.");
+                                "evaluate_objective_function(p, n, d):\n"
+                                "p is not a point.");
 
   // Compute the smallest space dimension  between `input_obj_function'
   // and `evaluating_point'.
@@ -1962,7 +1959,7 @@ PPL::MIP_Problem::solve_mip(bool& have_incumbent_solution,
     if (have_incumbent_solution
         && ((mip.optimization_mode() == MAXIMIZATION
               && tmp_rational <= incumbent_solution_value)
- 	    || (mip.optimization_mode() == MINIMIZATION
+            || (mip.optimization_mode() == MINIMIZATION
                 && tmp_rational >= incumbent_solution_value)))
       // Abandon this path.
       return mip_status;
@@ -1976,7 +1973,7 @@ PPL::MIP_Problem::solve_mip(bool& have_incumbent_solution,
   // sparseness of p, if the size of i_vars is expected to be greater than
   // the number of nonzeroes in p in most cases.
   for (Variables_Set::const_iterator v_begin = i_vars.begin(),
-	 v_end = i_vars.end(); v_begin != v_end; ++v_begin) {
+         v_end = i_vars.end(); v_begin != v_end; ++v_begin) {
     gcd_assign(gcd, p.coefficient(Variable(*v_begin)), p_divisor);
     if (gcd != p_divisor) {
       non_int_dim = *v_begin;
@@ -2015,7 +2012,7 @@ PPL::MIP_Problem::solve_mip(bool& have_incumbent_solution,
   PPL_ASSERT(non_int_dim < mip.space_dimension());
 
   assign_r(tmp_rational.get_num(), p.coefficient(Variable(non_int_dim)),
-	   ROUND_NOT_NEEDED);
+           ROUND_NOT_NEEDED);
   assign_r(tmp_rational.get_den(), p_divisor, ROUND_NOT_NEEDED);
   tmp_rational.canonicalize();
   assign_r(tmp_coeff1, tmp_rational, ROUND_DOWN);
@@ -2031,7 +2028,7 @@ PPL::MIP_Problem::solve_mip(bool& have_incumbent_solution,
               << "." << std::endl;
 #endif // PPL_NOISY_SIMPLEX
     solve_mip(have_incumbent_solution, incumbent_solution_value,
-	      incumbent_solution_point, mip_aux, i_vars);
+              incumbent_solution_point, mip_aux, i_vars);
   }
   // TODO: change this when we will be able to remove constraints.
   mip.add_constraint(Variable(non_int_dim) >= tmp_coeff2);
@@ -2043,7 +2040,7 @@ PPL::MIP_Problem::solve_mip(bool& have_incumbent_solution,
             << "." << std::endl;
 #endif // PPL_NOISY_SIMPLEX
   solve_mip(have_incumbent_solution, incumbent_solution_value,
-	    incumbent_solution_point, mip, i_vars);
+            incumbent_solution_point, mip, i_vars);
   return have_incumbent_solution ? mip_status : UNFEASIBLE_MIP_PROBLEM;
 }
 
@@ -2157,7 +2154,7 @@ PPL::MIP_Problem::is_mip_satisfiable(MIP_Problem& mip,
   // sparseness of p, if the size of i_vars is expected to be greater than
   // the number of nonzeroes in p in most cases.
   for (Variables_Set::const_iterator v_begin = i_vars.begin(),
-	 v_end = i_vars.end(); v_begin != v_end; ++v_begin) {
+         v_end = i_vars.end(); v_begin != v_end; ++v_begin) {
     gcd_assign(gcd, p.coefficient(Variable(*v_begin)), p_divisor);
     if (gcd != p_divisor) {
       non_int_dim = *v_begin;
@@ -2173,7 +2170,7 @@ PPL::MIP_Problem::is_mip_satisfiable(MIP_Problem& mip,
   PPL_ASSERT(non_int_dim < mip.space_dimension());
 
   assign_r(tmp_rational.get_num(), p.coefficient(Variable(non_int_dim)),
-	   ROUND_NOT_NEEDED);
+           ROUND_NOT_NEEDED);
   assign_r(tmp_rational.get_den(), p_divisor, ROUND_NOT_NEEDED);
   tmp_rational.canonicalize();
   assign_r(tmp_coeff1, tmp_rational, ROUND_DOWN);
@@ -2206,7 +2203,7 @@ PPL::MIP_Problem::is_mip_satisfiable(MIP_Problem& mip,
             << (Variable(non_int_dim) >= tmp_coeff2)
             << "." << std::endl;
 #endif // PPL_NOISY_SIMPLEX
-  bool satisfiable = is_mip_satisfiable(mip, i_vars, p);
+  const bool satisfiable = is_mip_satisfiable(mip, i_vars, p);
 #if PPL_NOISY_SIMPLEX
   std::cout << "MIP_Problem::is_mip_satisfiable(): "
             << "exiting from recursion level " << mip_recursion_level
@@ -2261,6 +2258,28 @@ PPL::MIP_Problem::OK() const {
       return false;
     }
 
+  if (external_space_dim < internal_space_dim) {
+#ifndef NDEBUG
+    cerr << "The MIP_Problem claims to have an internal space dimension "
+         << "greater than its external space dimension."
+         << endl;
+    ascii_dump(cerr);
+#endif
+    return false;
+  }
+
+  if (external_space_dim > internal_space_dim
+      && status != UNSATISFIABLE
+      && status != PARTIALLY_SATISFIABLE) {
+#ifndef NDEBUG
+    cerr << "The MIP_Problem claims to have a pending space dimension "
+         << "addition, but the status is incompatible."
+         << endl;
+    ascii_dump(cerr);
+#endif
+    return false;
+  }
+
   // Constraint system and objective function should be dimension compatible.
   if (external_space_dim < input_obj_function.space_dimension()) {
 #ifndef NDEBUG
@@ -2277,11 +2296,11 @@ PPL::MIP_Problem::OK() const {
   if (status != UNSATISFIABLE && initialized) {
     // Here `last_generator' has to be meaningful.
     // Check for dimension compatibility and actual feasibility.
-    if (external_space_dim != last_generator.space_dimension()) {
+    if (internal_space_dim != last_generator.space_dimension()) {
 #ifndef NDEBUG
       cerr << "The MIP_Problem and the cached feasible point have "
            << "incompatible space dimensions ("
-           << external_space_dim << " != "
+           << internal_space_dim << " != "
            << last_generator.space_dimension() << ")."
            << endl;
       ascii_dump(cerr);
@@ -2309,7 +2328,7 @@ PPL::MIP_Problem::OK() const {
       // to be greater than the number of nonzeroes in last_generator in most
       // cases.
       for (Variables_Set::const_iterator v_it = i_variables.begin(),
-            v_end = i_variables.end(); v_it != v_end; ++v_it) {
+             v_end = i_variables.end(); v_it != v_end; ++v_it) {
         gcd_assign(gcd, last_generator.coefficient(Variable(*v_it)),
                    last_generator.divisor());
         if (gcd != last_generator.divisor())
@@ -2328,11 +2347,12 @@ PPL::MIP_Problem::OK() const {
 #endif
       return false;
     }
-    // The size of `mapping' should be equal to the space dimension
-    // of `input_cs' plus one.
-    if (mapping.size() != external_space_dim + 1) {
+    // The size of `mapping' should be equal to the internal
+    // space dimension plus one.
+    if (mapping.size() != internal_space_dim + 1) {
 #ifndef NDEBUG
-      cerr << "`input_cs' and `mapping' have incompatible sizes" << endl;
+      cerr << "The internal space dimension and `mapping' "
+           << "have incompatible sizes" << endl;
       ascii_dump(cerr);
 #endif
       return false;
@@ -2706,7 +2726,7 @@ std::ostream&
 PPL::IO_Operators::operator<<(std::ostream& s, const MIP_Problem& mip) {
   s << "Constraints:";
   for (MIP_Problem::const_iterator i = mip.constraints_begin(),
-	 i_end = mip.constraints_end(); i != i_end; ++i)
+         i_end = mip.constraints_end(); i != i_end; ++i)
     s << "\n" << *i;
   s << "\nObjective function: "
     << mip.objective_function()
diff --git a/src/MIP_Problem.defs.hh b/src/MIP_Problem.defs.hh
deleted file mode 100644
index a43c3c4..0000000
--- a/src/MIP_Problem.defs.hh
+++ /dev/null
@@ -1,980 +0,0 @@
-/* MIP_Problem class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_MIP_Problem_defs_hh
-#define PPL_MIP_Problem_defs_hh 1
-
-#include "MIP_Problem.types.hh"
-#include "globals.types.hh"
-#include "Matrix.defs.hh"
-#include "Linear_Expression.defs.hh"
-#include "Constraint.types.hh"
-#include "Constraint_System.types.hh"
-#include "Generator.defs.hh"
-#include "Variables_Set.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-#include <vector>
-#include <deque>
-#include <iterator>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::MIP_Problem */
-std::ostream&
-operator<<(std::ostream& s, const MIP_Problem& mip);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates MIP_Problem */
-void swap(MIP_Problem& x, MIP_Problem& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A Mixed Integer (linear) Programming problem.
-/*! \ingroup PPL_CXX_interface
-  An object of this class encodes a mixed integer (linear) programming
-  problem.
-  The MIP problem is specified by providing:
-   - the dimension of the vector space;
-   - the feasible region, by means of a finite set of linear equality
-     and non-strict inequality constraints;
-   - the subset of the unknown variables that range over the integers
-     (the other variables implicitly ranging over the reals);
-   - the objective function, described by a Linear_Expression;
-   - the optimization mode (either maximization or minimization).
-
-  The class provides support for the (incremental) solution of the
-  MIP problem based on variations of the revised simplex method and
-  on branch-and-bound techniques. The result of the resolution
-  process is expressed in terms of an enumeration, encoding the
-  feasibility and the unboundedness of the optimization problem.
-  The class supports simple feasibility tests (i.e., no optimization),
-  as well as the extraction of an optimal (resp., feasible) point,
-  provided the MIP_Problem is optimizable (resp., feasible).
-
-  By exploiting the incremental nature of the solver, it is possible
-  to reuse part of the computational work already done when solving
-  variants of a given MIP_Problem: currently, incremental resolution
-  supports the addition of space dimensions, the addition of constraints,
-  the change of objective function and the change of optimization mode.
-*/
-class Parma_Polyhedra_Library::MIP_Problem {
-public:
-  //! Builds a trivial MIP problem.
-  /*!
-    A trivial MIP problem requires to maximize the objective function
-    \f$0\f$ on a vector space under no constraints at all:
-    the origin of the vector space is an optimal solution.
-
-    \param dim
-    The dimension of the vector space enclosing \p *this
-    (optional argument with default value \f$0\f$).
-
-    \exception std::length_error
-    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
-  */
-  explicit MIP_Problem(dimension_type dim = 0);
-
-  /*! \brief
-    Builds an MIP problem having space dimension \p dim
-    from the sequence of constraints in the range
-    \f$[\mathrm{first}, \mathrm{last})\f$,
-    the objective function \p obj and optimization mode \p mode;
-    those dimensions whose indices occur in \p int_vars are
-    constrained to take an integer value.
-
-    \param dim
-    The dimension of the vector space enclosing \p *this.
-
-    \param first
-    An input iterator to the start of the sequence of constraints.
-
-    \param last
-    A past-the-end input iterator to the sequence of constraints.
-
-    \param int_vars
-    The set of variables' indexes that are constrained to take integer values.
-
-    \param obj
-    The objective function (optional argument with default value \f$0\f$).
-
-    \param mode
-    The optimization mode (optional argument with default value
-    <CODE>MAXIMIZATION</CODE>).
-
-    \exception std::length_error
-    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
-
-    \exception std::invalid_argument
-    Thrown if a constraint in the sequence is a strict inequality,
-    if the space dimension of a constraint (resp., of the
-    objective function or of the integer variables) or the space dimension
-    of the integer variable set is strictly greater than \p dim.
-  */
-  template <typename In>
-  MIP_Problem(dimension_type dim,
-              In first, In last,
-              const Variables_Set& int_vars,
-              const Linear_Expression& obj = Linear_Expression::zero(),
-              Optimization_Mode mode = MAXIMIZATION);
-
-  /*! \brief
-    Builds an MIP problem having space dimension \p dim
-    from the sequence of constraints in the range
-    \f$[\mathrm{first}, \mathrm{last})\f$,
-    the objective function \p obj and optimization mode \p mode.
-
-    \param dim
-    The dimension of the vector space enclosing \p *this.
-
-    \param first
-    An input iterator to the start of the sequence of constraints.
-
-    \param last
-    A past-the-end input iterator to the sequence of constraints.
-
-    \param obj
-    The objective function (optional argument with default value \f$0\f$).
-
-    \param mode
-    The optimization mode (optional argument with default value
-    <CODE>MAXIMIZATION</CODE>).
-
-    \exception std::length_error
-    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
-
-    \exception std::invalid_argument
-    Thrown if a constraint in the sequence is a strict inequality
-    or if the space dimension of a constraint (resp., of the
-    objective function or of the integer variables) is strictly
-    greater than \p dim.
-  */
-  template <typename In>
-  MIP_Problem(dimension_type dim,
-              In first, In last,
-              const Linear_Expression& obj = Linear_Expression::zero(),
-              Optimization_Mode mode = MAXIMIZATION);
-
-  /*! \brief
-    Builds an MIP problem having space dimension \p dim from the constraint
-    system \p cs, the objective function \p obj and optimization mode \p mode.
-
-    \param dim
-    The dimension of the vector space enclosing \p *this.
-
-    \param cs
-    The constraint system defining the feasible region.
-
-    \param obj
-    The objective function (optional argument with default value \f$0\f$).
-
-    \param mode
-    The optimization mode (optional argument with default value
-    <CODE>MAXIMIZATION</CODE>).
-
-    \exception std::length_error
-    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
-
-    \exception std::invalid_argument
-    Thrown if the constraint system contains any strict inequality
-    or if the space dimension of the constraint system (resp., the
-    objective function) is strictly greater than \p dim.
-  */
-  MIP_Problem(dimension_type dim,
-              const Constraint_System& cs,
-              const Linear_Expression& obj = Linear_Expression::zero(),
-              Optimization_Mode mode = MAXIMIZATION);
-
-  //! Ordinary copy constructor.
-  MIP_Problem(const MIP_Problem& y);
-
-  //! Destructor.
-  ~MIP_Problem();
-
-  //! Assignment operator.
-  MIP_Problem& operator=(const MIP_Problem& y);
-
-  //! Returns the maximum space dimension an MIP_Problem can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the space dimension of the MIP problem.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns a set containing all the variables' indexes constrained
-    to be integral.
-  */
-  const Variables_Set& integer_space_dimensions() const;
-
-private:
-  //! A type alias for a sequence of constraints.
-  typedef std::vector<Constraint*> Constraint_Sequence;
-
-public:
-  //! A read-only iterator on the constraints defining the feasible region.
-  class const_iterator {
-  private:
-    typedef Constraint_Sequence::const_iterator Base;
-    typedef std::iterator_traits<Base> Base_Traits;
-  public:
-    typedef Base_Traits::iterator_category iterator_category;
-    typedef Base_Traits::difference_type difference_type;
-    typedef const Constraint value_type;
-    typedef const Constraint* pointer;
-    typedef const Constraint& reference;
-
-    //! Iterator difference: computes distances.
-    difference_type operator-(const const_iterator& y) const;
-
-    //! Prefix increment.
-    const_iterator& operator++();
-
-    //! Prefix decrement.
-    const_iterator& operator--();
-
-    //! Postfix increment.
-    const_iterator operator++(int);
-
-    //! Postfix decrement.
-    const_iterator operator--(int);
-
-    //! Moves iterator forward of \p n positions.
-    const_iterator& operator+=(difference_type n);
-
-    //! Moves iterator backward of \p n positions.
-    const_iterator& operator-=(difference_type n);
-
-    //! Returns an iterator \p n positions forward.
-    const_iterator operator+(difference_type n) const;
-
-    //! Returns an iterator \p n positions backward.
-    const_iterator operator-(difference_type n) const;
-
-    //! Returns a reference to the "pointed" object.
-    reference operator*() const;
-
-    //! Returns the address of the "pointed" object.
-    pointer operator->() const;
-
-    //! Compares \p *this with y.
-    /*!
-      \param y
-      The %iterator that will be compared with *this.
-    */
-    bool operator==(const const_iterator& y) const;
-
-    //! Compares \p *this with y.
-    /*!
-      \param y
-      The %iterator that will be compared with *this.
-    */
-    bool operator!=(const const_iterator& y) const;
-
-  private:
-    //! Constructor from a Base iterator.
-    explicit const_iterator(Base base);
-
-    //! The Base iterator on the Constraint_Sequence.
-    Base itr;
-
-    friend class MIP_Problem;
-  };
-
-  /*! \brief
-    Returns a read-only iterator to the first constraint defining
-    the feasible region.
-  */
-  const_iterator constraints_begin() const;
-
-  /*! \brief
-    Returns a past-the-end read-only iterator to the sequence of
-    constraints defining the feasible region.
-  */
-  const_iterator constraints_end() const;
-
-  //! Returns the objective function.
-  const Linear_Expression& objective_function() const;
-
-  //! Returns the optimization mode.
-  Optimization_Mode optimization_mode() const;
-
-  //! Resets \p *this to be equal to the trivial MIP problem.
-  /*!
-    The space dimension is reset to \f$0\f$.
-  */
-  void clear();
-
-  /*! \brief
-    Adds \p m new space dimensions and embeds the old MIP problem
-    in the new vector space.
-
-    \param m
-    The number of dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    The new space dimensions will be those having the highest indexes
-    in the new MIP problem; they are initially unconstrained.
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Sets the variables whose indexes are in set \p i_vars to be
-    integer space dimensions.
-
-    \exception std::invalid_argument
-    Thrown if some index in \p i_vars does not correspond to
-    a space dimension in \p *this.
-  */
-  void add_to_integer_space_dimensions(const Variables_Set& i_vars);
-
-  /*! \brief
-    Adds a copy of constraint \p c to the MIP problem.
-
-    \exception std::invalid_argument
-    Thrown if the constraint \p c is a strict inequality or if its space
-    dimension is strictly greater than the space dimension of \p *this.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds a copy of the constraints in \p cs to the MIP problem.
-
-    \exception std::invalid_argument
-    Thrown if the constraint system \p cs contains any strict inequality
-    or if its space dimension is strictly greater than the space dimension
-    of \p *this.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  //! Sets the objective function to \p obj.
-  /*!
-    \exception std::invalid_argument
-    Thrown if the space dimension of \p obj is strictly greater than
-    the space dimension of \p *this.
-  */
-  void set_objective_function(const Linear_Expression& obj);
-
-  //! Sets the optimization mode to \p mode.
-  void set_optimization_mode(Optimization_Mode mode);
-
-  //! Checks satisfiability of \p *this.
-  /*!
-    \return
-    <CODE>true</CODE> if and only if the MIP problem is satisfiable.
-  */
-  bool is_satisfiable() const;
-
-  //! Optimizes the MIP problem.
-  /*!
-    \return
-    An MIP_Problem_Status flag indicating the outcome of the optimization
-    attempt (unfeasible, unbounded or optimized problem).
-  */
-  MIP_Problem_Status solve() const;
-
-  /*! \brief
-    Sets \p num and \p denom so that
-    \f$\frac{\mathtt{numer}}{\mathtt{denom}}\f$ is the result of
-    evaluating the objective function on \p evaluating_point.
-
-    \param evaluating_point
-    The point on which the objective function will be evaluated.
-
-    \param numer
-    On exit will contain the numerator of the evaluated value.
-
-    \param denom
-    On exit will contain the denominator of the evaluated value.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p evaluating_point are dimension-incompatible
-    or if the generator \p evaluating_point is not a point.
-  */
-  void evaluate_objective_function(const Generator& evaluating_point,
-                                   Coefficient& numer,
-                                   Coefficient& denom) const;
-
-  //! Returns a feasible point for \p *this, if it exists.
-  /*!
-    \exception std::domain_error
-    Thrown if the MIP problem is not satisfiable.
-  */
-  const Generator& feasible_point() const;
-
-  //! Returns an optimal point for \p *this, if it exists.
-  /*!
-    \exception std::domain_error
-    Thrown if \p *this does not not have an optimizing point, i.e.,
-    if the MIP problem is unbounded or not satisfiable.
-  */
-  const Generator& optimizing_point() const;
-
-  /*! \brief
-    Sets \p numer and \p denom so that
-    \f$\frac{\mathtt{numer}}{\mathtt{denom}}\f$ is the solution of the
-    optimization problem.
-
-    \exception std::domain_error
-    Thrown if \p *this does not not have an optimizing point, i.e.,
-    if the MIP problem is unbounded or not satisfiable.
-  */
-  void optimal_value(Coefficient& numer, Coefficient& denom) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(MIP_Problem& y);
-
-  //! Names of MIP problems' control parameters.
-  enum Control_Parameter_Name {
-    //! The pricing rule.
-    PRICING
-  };
-
-  //! Possible values for MIP problem's control parameters.
-  enum Control_Parameter_Value {
-    //! Steepest edge pricing method, using floating points (default).
-    PRICING_STEEPEST_EDGE_FLOAT,
-    //! Steepest edge pricing method, using Coefficient.
-    PRICING_STEEPEST_EDGE_EXACT,
-    //! Textbook pricing method.
-    PRICING_TEXTBOOK
-  };
-
-  //! Returns the value of the control parameter \p name.
-  Control_Parameter_Value
-  get_control_parameter(Control_Parameter_Name name) const;
-
-  //! Sets control parameter \p value.
-  void set_control_parameter(Control_Parameter_Value value);
-
-private:
-  //! The dimension of the vector space.
-  dimension_type external_space_dim;
-
-  /*! \brief
-    The space dimension of the current (partial) solution of the
-    MIP problem; it may be smaller than \p external_space_dim.
-  */
-  dimension_type internal_space_dim;
-
-#if PPL_USE_SPARSE_MATRIX
-  typedef Sparse_Row Row;
-#else
-  typedef Dense_Row Row;
-#endif
-
-  //! The matrix encoding the current feasible region in tableau form.
-  Matrix<Row> tableau;
-
-  typedef Row working_cost_type;
-
-  //! The working cost function.
-  working_cost_type working_cost;
-
-  //! A map between the variables of `input_cs' and `tableau'.
-  /*!
-    Contains all the pairs (i, j) such that mapping[i].first encodes the index
-    of the column in the tableau where input_cs[i] is stored; if
-    mapping[i].second is not a zero, it encodes the split part of the tableau
-    of input_cs[i].
-    The "positive" one is represented by mapping[i].first and the "negative"
-    one is represented by mapping[i].second.
-  */
-  std::vector<std::pair<dimension_type, dimension_type> > mapping;
-
-  //! The current basic solution.
-  std::vector<dimension_type> base;
-
-  //! An enumerated type describing the internal status of the MIP problem.
-  enum Status {
-    //! The MIP problem is unsatisfiable.
-    UNSATISFIABLE,
-    //! The MIP problem is satisfiable; a feasible solution has been computed.
-    SATISFIABLE,
-    //! The MIP problem is unbounded; a feasible solution has been computed.
-    UNBOUNDED,
-    //! The MIP problem is optimized; an optimal solution has been computed.
-    OPTIMIZED,
-    /*! \brief
-      The feasible region of the MIP problem has been changed by adding
-      new space dimensions or new constraints; a feasible solution for
-      the old feasible region is still available.
-    */
-    PARTIALLY_SATISFIABLE
-  };
-
-  //! The internal state of the MIP problem.
-  Status status;
-
-  // TODO: merge `status', `initialized', `pricing' and (maybe) `opt_mode'
-  // into a single bitset status word, so as to save space and allow
-  // for other control parameters.
-
-  //! The pricing method in use.
-  Control_Parameter_Value pricing;
-
-  /*! \brief
-    A Boolean encoding whether or not internal data structures have
-    already been properly sized and populated: useful to allow for
-    deeper checks in method OK().
-  */
-  bool initialized;
-
-  //! The sequence of constraints describing the feasible region.
-  std::vector<Constraint*> input_cs;
-
-  /*! \brief
-    The number of constraints that are inherited from our parent
-    in the recursion tree built when solving via branch-and-bound.
-
-    The first \c inherited_constraints elements in \c input_cs point to
-    the inherited constraints, whose resources are owned by our ancestors.
-    The resources of the other elements in \c input_cs are owned by \c *this
-    and should be appropriately released on destruction.
-  */
-  dimension_type inherited_constraints;
-
-  //! The first index of `input_cs' containing a pending constraint.
-  dimension_type first_pending_constraint;
-
-  //! The objective function to be optimized.
-  Linear_Expression input_obj_function;
-
-  //! The optimization mode requested.
-  Optimization_Mode opt_mode;
-
-  //! The last successfully computed feasible or optimizing point.
-  Generator last_generator;
-
-  /*! \brief
-    A set containing all the indexes of variables that are constrained
-    to have an integer value.
-  */
-  Variables_Set i_variables;
-
-  //! A helper class to temporarily relax a MIP problem using RAII.
-  struct RAII_Temporary_Real_Relaxation {
-    MIP_Problem& lp;
-    Variables_Set i_vars;
-
-    RAII_Temporary_Real_Relaxation(MIP_Problem& mip)
-      : lp(mip), i_vars() {
-      // Turn mip into an LP problem (saving i_variables in i_vars).
-      using std::swap;
-      swap(i_vars, lp.i_variables);
-    }
-
-    ~RAII_Temporary_Real_Relaxation() {
-      // Restore the original set of integer variables.
-      using std::swap;
-      swap(i_vars, lp.i_variables);
-    }
-  };
-  friend struct RAII_Temporary_Real_Relaxation;
-
-  //! A tag type to distinguish normal vs. inheriting copy constructor.
-  struct Inherit_Constraints {};
-
-  //! Copy constructor inheriting constraints.
-  MIP_Problem(const MIP_Problem& y, Inherit_Constraints);
-
-  //! Helper method: implements exception safe addition.
-  void add_constraint_helper(const Constraint& c);
-
-  //! Processes the pending constraints of \p *this.
-  /*!
-    \return
-    <CODE>true</CODE> if and only if the MIP problem is satisfiable after
-    processing the pending constraints, <CODE>false</CODE> otherwise.
-  */
-  bool process_pending_constraints();
-
-  /*! \brief
-    Optimizes the MIP problem using the second phase of the
-    primal simplex algorithm.
-  */
-  void second_phase();
-
-  /*! \brief
-    Assigns to \p this->tableau a simplex tableau representing the
-    MIP problem, inserting into \p this->mapping the information
-    that is required to recover the original MIP problem.
-
-    \return
-    <CODE>UNFEASIBLE_MIP_PROBLEM</CODE> if the constraint system contains
-    any trivially unfeasible constraint (tableau was not computed);
-    <CODE>UNBOUNDED_MIP_PROBLEM</CODE> if the problem is trivially unbounded
-    (the computed tableau contains no constraints);
-    <CODE>OPTIMIZED_MIP_PROBLEM></CODE> if the problem is neither trivially
-    unfeasible nor trivially unbounded (the tableau was computed
-    successfully).
-  */
-  MIP_Problem_Status
-  compute_tableau(std::vector<dimension_type>& worked_out_row);
-
-  /*! \brief
-    Parses the pending constraints to gather information on
-    how to resize the tableau.
-
-    \note
-    All of the method parameters are output parameters; their value
-    is only meaningful when the function exit returning value \c true.
-
-    \return
-    \c false if a trivially false constraint is detected, \c true otherwise.
-
-    \param additional_tableau_rows
-    On exit, this will store the number of rows that have to be added
-    to the original tableau.
-
-    \param additional_slack_variables
-    This will store the number of slack variables that have to be added
-    to the original tableau.
-
-    \param is_tableau_constraint
-    This container of Boolean flags is initially empty. On exit, it size
-    will be equal to the number of pending constraints in \c input_cs.
-    For each pending constraint index \c i, the corresponding element
-    of this container (having index <CODE>i - first_pending_constraint</CODE>)
-    will be set to \c true if and only if the constraint has to be included
-    in the tableau.
-
-    \param is_satisfied_inequality
-    This container of Boolean flags is initially empty. On exit, its size
-    will be equal to the number of pending constraints in \c input_cs.
-    For each pending constraint index \c i, the corresponding element
-    of this container (having index <CODE>i - first_pending_constraint</CODE>)
-    will be set to \c true if and only if it is an inequality and it
-    is already satisfied by \c last_generator (hence it does not require
-    the introduction of an artificial variable).
-
-    \param is_nonnegative_variable
-    This container of Boolean flags is initially empty.
-    On exit, it size is equal to \c external_space_dim.
-    For each variable (index), the corresponding element of this container
-    is \c true if the variable is known to be nonnegative (and hence should
-    not be split into a positive and a negative part).
-
-    \param is_remergeable_variable
-    This container of Boolean flags is initially empty.
-    On exit, it size is equal to \c internal_space_dim.
-    For each variable (index), the corresponding element of this container
-    is \c true if the variable was previously split into positive and
-    negative parts that can now be merged back, since it is known
-    that the variable is nonnegative.
-  */
-  bool parse_constraints(dimension_type& additional_tableau_rows,
-			 dimension_type& additional_slack_variables,
-			 std::deque<bool>& is_tableau_constraint,
-			 std::deque<bool>& is_satisfied_inequality,
-			 std::deque<bool>& is_nonnegative_variable,
-			 std::deque<bool>& is_remergeable_variable) const;
-
-  /*! \brief
-    Computes the row index of the variable exiting the base
-    of the MIP problem. Implemented with anti-cycling rule.
-
-    \return
-    The row index of the variable exiting the base.
-
-    \param entering_var_index
-    The column index of the variable entering the base.
-  */
-  dimension_type
-  get_exiting_base_index(dimension_type entering_var_index) const;
-
-  //! Linearly combines \p x with \p y so that <CODE>*this[k]</CODE> is 0.
-  /*!
-    \param x
-    The row that will be combined with \p y object.
-
-    \param y
-    The row that will be combined with \p x object.
-
-    \param k
-    The position of \p *this that have to be \f$0\f$.
-
-    Computes a linear combination of \p x and \p y having
-    the element of index \p k equal to \f$0\f$. Then it assigns
-    the resulting Row to \p x and normalizes it.
-  */
-  static void linear_combine(Row& x, const Row& y, const dimension_type k);
-
-  // TODO: Remove this when the sparse working cost has been tested enough.
-#if PPL_USE_SPARSE_MATRIX
-
-  //! Linearly combines \p x with \p y so that <CODE>*this[k]</CODE> is 0.
-  /*!
-    \param x
-    The row that will be combined with \p y object.
-
-    \param y
-    The row that will be combined with \p x object.
-
-    \param k
-    The position of \p *this that have to be \f$0\f$.
-
-    Computes a linear combination of \p x and \p y having
-    the element of index \p k equal to \f$0\f$. Then it assigns
-    the resulting Dense_Row to \p x and normalizes it.
-  */
-  static void linear_combine(Dense_Row& x, const Sparse_Row& y,
-                             const dimension_type k);
-
-#endif // defined(PPL_USE_SPARSE_MATRIX)
-
-  static bool is_unbounded_obj_function(
-    const Linear_Expression& obj_function,
-    const std::vector<std::pair<dimension_type, dimension_type> >& mapping,
-    Optimization_Mode optimization_mode);
-
-  /*! \brief
-    Performs the pivoting operation on the tableau.
-
-    \param entering_var_index
-    The index of the variable entering the base.
-
-    \param exiting_base_index
-    The index of the row exiting the base.
-  */
-  void pivot(dimension_type entering_var_index,
-             dimension_type exiting_base_index);
-
-  /*! \brief
-    Computes the column index of the variable entering the base,
-    using the textbook algorithm with anti-cycling rule.
-
-    \return
-    The column index of the variable that enters the base.
-    If no such variable exists, optimality was achieved
-    and <CODE>0</CODE> is returned.
-  */
-  dimension_type textbook_entering_index() const;
-
-  /*! \brief
-    Computes the column index of the variable entering the base,
-    using an exact steepest-edge algorithm with anti-cycling rule.
-
-    \return
-    The column index of the variable that enters the base.
-    If no such variable exists, optimality was achieved
-    and <CODE>0</CODE> is returned.
-
-    To compute the entering_index, the steepest edge algorithm chooses
-    the index `j' such that \f$\frac{d_{j}}{\|\Delta x^{j} \|}\f$ is the
-    largest in absolute value, where
-    \f[
-      \|\Delta x^{j} \|
-        = \left(
-            1+\sum_{i=1}^{m} \alpha_{ij}^2
-          \right)^{\frac{1}{2}}.
-    \f]
-    Recall that, due to the exact integer implementation of the algorithm,
-    our tableau does not contain the ``real'' \f$\alpha\f$ values, but these
-    can be computed dividing the value of the coefficient by the value of
-    the variable in base. Obviously the result may not be an integer, so
-    we will proceed in another way: we compute the lcm of all the variables
-    in base to get the good ``weight'' of each Coefficient of the tableau.
-  */
-  dimension_type steepest_edge_exact_entering_index() const;
-
-  /*! \brief
-    Same as steepest_edge_exact_entering_index,
-    but using floating points.
-
-    \note
-    Due to rounding errors, the index of the variable entering the base
-    of the MIP problem is not predictable across different architectures.
-    Hence, the overall simplex computation may differ in the path taken
-    to reach the optimum. Anyway, the exact final result will be computed
-    for the MIP_Problem.
-  */
-  dimension_type steepest_edge_float_entering_index() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and if only the algorithm successfully
-    computed a feasible solution.
-
-    \note
-    Uses an exact pricing method (either textbook or exact steepest edge),
-    so that the result is deterministic across different architectures.
-  */
-  bool compute_simplex_using_exact_pricing();
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and if only the algorithm successfully
-    computed a feasible solution.
-
-    \note
-    Uses a floating point implementation of the steepest edge pricing
-    method, so that the result is correct, but not deterministic across
-    different architectures.
-  */
-  bool compute_simplex_using_steepest_edge_float();
-
-  /*! \brief
-    Drop unnecessary artificial variables from the tableau and get ready
-    for the second phase of the simplex algorithm.
-
-    \note
-    The two parameters denote a STL-like half-open range.
-    It is assumed that \p begin_artificials is strictly greater than 0
-    and smaller than \p end_artificials.
-
-    \param begin_artificials
-    The start of the tableau column index range for artificial variables.
-
-    \param end_artificials
-    The end of the tableau column index range for artificial variables.
-    Note that column index end_artificial is \e excluded from the range.
-  */
-  void erase_artificials(dimension_type begin_artificials,
-                         dimension_type end_artificials);
-
-  bool is_in_base(dimension_type var_index,
-		  dimension_type& row_index) const;
-
-  /*! \brief
-    Computes a valid generator that satisfies all the constraints of the
-    Linear Programming problem associated to \p *this.
-  */
-  void compute_generator() const;
-
-  /*! \brief
-    Merges back the positive and negative part of a (previously split)
-    variable after detecting a corresponding nonnegativity constraint.
-
-    \return
-    If the negative part of \p var_index was in base, the index of
-    the corresponding tableau row (which has become non-feasible);
-    otherwise \c not_a_dimension().
-
-    \param var_index
-    The index of the variable that has to be merged.
-  */
-  dimension_type merge_split_variable(dimension_type var_index);
-
-  //! Returns <CODE>true</CODE> if and only if \p c is satisfied by \p g.
-  static bool is_satisfied(const Constraint& c, const Generator& g);
-
-  //! Returns <CODE>true</CODE> if and only if \p c is saturated by \p g.
-  static bool is_saturated(const Constraint& c, const Generator& g);
-
-  /*! \brief
-    Returns a status that encodes the solution of the MIP problem.
-
-    \param have_incumbent_solution
-    It is used to store if the solving process has found a provisional
-    optimum point.
-
-    \param incumbent_solution_value
-    Encodes the evaluated value of the provisional optimum point found.
-
-    \param incumbent_solution_point
-    If the method returns `OPTIMIZED', this will contain the optimality point.
-
-    \param mip
-    The problem that has to be solved.
-
-    \param i_vars
-    The variables that are constrained to take an integer value.
-  */
-  static MIP_Problem_Status solve_mip(bool& have_incumbent_solution,
-                                      mpq_class& incumbent_solution_value,
-                                      Generator& incumbent_solution_point,
-                                      MIP_Problem& mip,
-                                      const Variables_Set& i_vars);
-
-  /*! \brief
-    Returns \c true if and if only the LP problem is satisfiable.
-  */
-  bool is_lp_satisfiable() const;
-
-  /*! \brief
-    Returns \c true if and if only the MIP problem \p mip is satisfiable
-    when variables in \p i_vars can only take integral values.
-
-    \param mip
-    The MIP problem. This is assumed to have no integral space dimension
-    (so that it is a pure LP problem).
-
-    \param i_vars
-    The variables that are constrained to take integral values.
-
-    \param p
-    If \c true is returned, it will encode a feasible point.
-  */
-  static bool is_mip_satisfiable(MIP_Problem& mip,
-                                 const Variables_Set& i_vars,
-                                 Generator& p);
-
-  /*! \brief
-    Returns \c true if and if only \c mip.last_generator satisfies all the
-    integrality conditions implicitly stated using by \p i_vars.
-
-    \param mip
-    The MIP problem. This is assumed to have no integral space dimension
-    (so that it is a pure LP problem).
-
-    \param i_vars
-    The variables that are constrained to take an integer value.
-
-    \param branching_index
-    If \c false is returned, this will encode the non-integral variable
-    index on which the `branch and bound' algorithm should be applied.
-  */
-  static bool choose_branching_variable(const MIP_Problem& mip,
-                                        const Variables_Set& i_vars,
-                                        dimension_type& branching_index);
-};
-
-#include "MIP_Problem.inlines.hh"
-#include "MIP_Problem.templates.hh"
-
-#endif // !defined(PPL_MIP_Problem_defs_hh)
diff --git a/src/MIP_Problem.inlines.hh b/src/MIP_Problem.inlines.hh
deleted file mode 100644
index c2dd27d..0000000
--- a/src/MIP_Problem.inlines.hh
+++ /dev/null
@@ -1,322 +0,0 @@
-/* MIP_Problem class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_MIP_Problem_inlines_hh
-#define PPL_MIP_Problem_inlines_hh 1
-
-#include "Constraint.defs.hh"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-inline dimension_type
-MIP_Problem::max_space_dimension() {
-  return Constraint::max_space_dimension();
-}
-
-inline dimension_type
-MIP_Problem::space_dimension() const {
-  return external_space_dim;
-}
-
-
-inline
-MIP_Problem::MIP_Problem(const MIP_Problem& y)
-  : external_space_dim(y.external_space_dim),
-    internal_space_dim(y.internal_space_dim),
-    tableau(y.tableau),
-    working_cost(y.working_cost),
-    mapping(y.mapping),
-    base(y.base),
-    status(y.status),
-    pricing(y.pricing),
-    initialized(y.initialized),
-    input_cs(),
-    inherited_constraints(0),
-    first_pending_constraint(),
-    input_obj_function(y.input_obj_function),
-    opt_mode(y.opt_mode),
-    last_generator(y.last_generator),
-    i_variables(y.i_variables) {
-  input_cs.reserve(y.input_cs.size());
-  for (Constraint_Sequence::const_iterator
-       i = y.input_cs.begin(), i_end = y.input_cs.end();
-       i != i_end; ++i)
-    add_constraint_helper(*(*i));
-  PPL_ASSERT(OK());
-}
-
-inline
-MIP_Problem::MIP_Problem(const MIP_Problem& y, Inherit_Constraints)
-  : external_space_dim(y.external_space_dim),
-    internal_space_dim(y.internal_space_dim),
-    tableau(y.tableau),
-    working_cost(y.working_cost),
-    mapping(y.mapping),
-    base(y.base),
-    status(y.status),
-    pricing(y.pricing),
-    initialized(y.initialized),
-    input_cs(y.input_cs),
-    // NOTE: The constraints are inherited, NOT copied!
-    inherited_constraints(y.input_cs.size()),
-    first_pending_constraint(y.first_pending_constraint),
-    input_obj_function(y.input_obj_function),
-    opt_mode(y.opt_mode),
-    last_generator(y.last_generator),
-    i_variables(y.i_variables) {
-  PPL_ASSERT(OK());
-}
-
-inline void
-MIP_Problem::add_constraint_helper(const Constraint& c) {
-  // For exception safety, reserve space for the new element.
-  const dimension_type size = input_cs.size();
-  if (size == input_cs.capacity()) {
-    const dimension_type max_size = input_cs.max_size();
-    if (size == max_size)
-      throw std::length_error("MIP_Problem::add_constraint(): "
-                              "too many constraints");
-    // Use an exponential grow policy to avoid too many reallocations.
-    input_cs.reserve(compute_capacity(size + 1, max_size));
-  }
-
-  // This operation does not throw, because the space for the new element
-  // has already been reserved: hence the new-ed Constraint is safe.
-  input_cs.push_back(new Constraint(c));
-}
-
-inline
-MIP_Problem::~MIP_Problem() {
-  // NOTE: do NOT delete inherited constraints; they are owned
-  // (and will eventually be deleted) by ancestors.
-  for (Constraint_Sequence::const_iterator
-         i = nth_iter(input_cs, inherited_constraints),
-         i_end = input_cs.end(); i != i_end; ++i)
-    delete *i;
-}
-
-
-inline void
-MIP_Problem::set_optimization_mode(const Optimization_Mode mode) {
-  if (opt_mode != mode) {
-    opt_mode = mode;
-    if (status == UNBOUNDED || status == OPTIMIZED)
-      status = SATISFIABLE;
-    PPL_ASSERT(OK());
-  }
-}
-
-inline const Linear_Expression&
-MIP_Problem::objective_function() const {
-  return input_obj_function;
-}
-
-inline Optimization_Mode
-MIP_Problem::optimization_mode() const {
-  return opt_mode;
-}
-
-inline void
-MIP_Problem::optimal_value(Coefficient& numer, Coefficient& denom) const {
-  const Generator& g = optimizing_point();
-  evaluate_objective_function(g, numer, denom);
-}
-
-inline MIP_Problem::const_iterator
-MIP_Problem::constraints_begin() const {
-  return const_iterator(input_cs.begin());
-}
-
-inline MIP_Problem::const_iterator
-MIP_Problem::constraints_end() const {
-  return const_iterator(input_cs.end());
-}
-
-inline const Variables_Set&
-MIP_Problem::integer_space_dimensions() const {
-  return i_variables;
-}
-
-inline MIP_Problem::Control_Parameter_Value
-MIP_Problem::get_control_parameter(Control_Parameter_Name name) const {
-  PPL_USED(name);
-  PPL_ASSERT(name == PRICING);
-  return pricing;
-}
-
-inline void
-MIP_Problem::set_control_parameter(Control_Parameter_Value value) {
-  pricing = value;
-}
-
-inline void
-MIP_Problem::m_swap(MIP_Problem& y) {
-  using std::swap;
-  swap(external_space_dim, y.external_space_dim);
-  swap(internal_space_dim, y.internal_space_dim);
-  swap(tableau, y.tableau);
-  swap(working_cost, y.working_cost);
-  swap(mapping, y.mapping);
-  swap(initialized, y.initialized);
-  swap(base, y.base);
-  swap(status, y.status);
-  swap(pricing, y.pricing);
-  swap(input_cs, y.input_cs);
-  swap(inherited_constraints, y.inherited_constraints);
-  swap(first_pending_constraint, y.first_pending_constraint);
-  swap(input_obj_function, y.input_obj_function);
-  swap(opt_mode, y.opt_mode);
-  swap(last_generator, y.last_generator);
-  swap(i_variables, y.i_variables);
-}
-
-inline MIP_Problem&
-MIP_Problem::operator=(const MIP_Problem& y) {
-  MIP_Problem tmp(y);
-  m_swap(tmp);
-  return *this;
-}
-
-inline void
-MIP_Problem::clear() {
-  MIP_Problem tmp;
-  m_swap(tmp);
-}
-
-
-inline memory_size_type
-MIP_Problem::external_memory_in_bytes() const {
-  memory_size_type n
-    = working_cost.external_memory_in_bytes()
-    + tableau.external_memory_in_bytes()
-    + input_obj_function.external_memory_in_bytes()
-    + last_generator.external_memory_in_bytes();
-
-  // Adding the external memory for `input_cs'.
-  // NOTE: disregard inherited constraints, as they are owned by ancestors.
-  n += input_cs.capacity() * sizeof(Constraint*);
-  for (Constraint_Sequence::const_iterator
-         i = nth_iter(input_cs, inherited_constraints),
-         i_end = input_cs.end(); i != i_end; ++i)
-    n += ((*i)->total_memory_in_bytes());
-
-  // Adding the external memory for `base'.
-  n += base.capacity() * sizeof(dimension_type);
-  // Adding the external memory for `mapping'.
-  n += mapping.capacity() * sizeof(std::pair<dimension_type, dimension_type>);
-  return n;
-}
-
-inline memory_size_type
-MIP_Problem::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline
-MIP_Problem::const_iterator::const_iterator(Base base)
-  : itr(base) {
-}
-
-inline MIP_Problem::const_iterator::difference_type
-MIP_Problem::const_iterator::operator-(const const_iterator& y) const {
-  return itr - y.itr;
-}
-
-inline MIP_Problem::const_iterator&
-MIP_Problem::const_iterator::operator++() {
-  ++itr;
-  return *this;
-}
-
-inline MIP_Problem::const_iterator&
-MIP_Problem::const_iterator::operator--() {
-  --itr;
-  return *this;
-}
-
-inline MIP_Problem::const_iterator
-MIP_Problem::const_iterator::operator++(int) {
-  const_iterator x = *this;
-  operator++();
-  return x;
-}
-
-inline MIP_Problem::const_iterator
-MIP_Problem::const_iterator::operator--(int) {
-  const_iterator x = *this;
-  operator--();
-  return x;
-}
-
-inline MIP_Problem::const_iterator
-MIP_Problem::const_iterator::operator+(difference_type n) const {
-  return const_iterator(itr + n);
-}
-
-inline MIP_Problem::const_iterator
-MIP_Problem::const_iterator::operator-(difference_type n) const {
-  return const_iterator(itr - n);
-}
-
-inline MIP_Problem::const_iterator&
-MIP_Problem::const_iterator::operator+=(difference_type n) {
-  itr += n;
-  return *this;
-}
-
-inline MIP_Problem::const_iterator&
-MIP_Problem::const_iterator::operator-=(difference_type n) {
-  itr -= n;
-  return *this;
-}
-
-inline MIP_Problem::const_iterator::reference
-MIP_Problem::const_iterator::operator*() const {
-  return *(*itr);
-}
-
-inline MIP_Problem::const_iterator::pointer
-MIP_Problem::const_iterator::operator->() const {
-  return *itr;
-}
-
-inline bool
-MIP_Problem::const_iterator::operator==(const const_iterator& y) const {
-  return itr == y.itr;
-}
-
-inline bool
-MIP_Problem::const_iterator::operator!=(const const_iterator& y) const {
-  return itr != y.itr;
-}
-
-/*! \relates MIP_Problem */
-inline void
-swap(MIP_Problem& x, MIP_Problem& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_MIP_Problem_inlines_hh)
diff --git a/src/MIP_Problem.templates.hh b/src/MIP_Problem.templates.hh
deleted file mode 100644
index 530c89d..0000000
--- a/src/MIP_Problem.templates.hh
+++ /dev/null
@@ -1,181 +0,0 @@
-/* MIP_Problem class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_MIP_Problem_templates_hh
-#define PPL_MIP_Problem_templates_hh 1
-
-#include "Variables_Set.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename In>
-MIP_Problem::MIP_Problem(const dimension_type dim,
-                         In first, In last,
-                         const Variables_Set& int_vars,
-                         const Linear_Expression& obj,
-                         const Optimization_Mode mode)
-  : external_space_dim(dim),
-    internal_space_dim(0),
-    tableau(),
-    working_cost(0),
-    mapping(),
-    base(),
-    status(PARTIALLY_SATISFIABLE),
-    pricing(PRICING_STEEPEST_EDGE_FLOAT),
-    initialized(false),
-    input_cs(),
-    inherited_constraints(0),
-    first_pending_constraint(0),
-    input_obj_function(obj),
-    opt_mode(mode),
-    last_generator(point()),
-    i_variables(int_vars) {
-  // Check that integer Variables_Set does not exceed the space dimension
-  // of the problem.
-  if (i_variables.space_dimension() > external_space_dim) {
-    std::ostringstream s;
-    s << "PPL::MIP_Problem::MIP_Problem"
-      << "(dim, first, last, int_vars, obj, mode):\n"
-      << "dim == "<< external_space_dim << " and int_vars.space_dimension() =="
-      << " " << i_variables.space_dimension() << " are dimension"
-      "incompatible.";
-    throw std::invalid_argument(s.str());
-  }
-
-  // Check for space dimension overflow.
-  if (dim > max_space_dimension())
-    throw std::length_error("PPL::MIP_Problem:: MIP_Problem(dim, first, "
-                            "last, int_vars, obj, mode):\n"
-                            "dim exceeds the maximum allowed"
-                            "space dimension.");
-  // Check the objective function.
-  if (obj.space_dimension() > dim) {
-    std::ostringstream s;
-    s << "PPL::MIP_Problem::MIP_Problem(dim, first, last,"
-      << "int_vars, obj, mode):\n"
-      << "obj.space_dimension() == "<< obj.space_dimension()
-      << " exceeds d == "<< dim << ".";
-    throw std::invalid_argument(s.str());
-  }
-  // Check the constraints.
-  try {
-    for (In i = first; i != last; ++i) {
-      if (i->is_strict_inequality())
-        throw std::invalid_argument("PPL::MIP_Problem::"
-                                    "MIP_Problem(dim, first, last, int_vars,"
-                                    "obj, mode):\nrange [first, last) contains"
-                                    "a strict inequality constraint.");
-      if (i->space_dimension() > dim) {
-        std::ostringstream s;
-        s << "PPL::MIP_Problem::"
-          << "MIP_Problem(dim, first, last, int_vars, obj, mode):\n"
-          << "range [first, last) contains a constraint having space"
-          << "dimension  == " << i->space_dimension() << " that exceeds"
-          "this->space_dimension == " << dim << ".";
-        throw std::invalid_argument(s.str());
-      }
-      add_constraint_helper(*i);
-    }
-  } catch (...) {
-    // Delete the allocated constraints, to avoid memory leaks.
-
-    for (Constraint_Sequence::const_iterator
-          i = input_cs.begin(), i_end = input_cs.end(); i != i_end; ++i)
-      delete *i;
-
-    throw;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename In>
-MIP_Problem::MIP_Problem(dimension_type dim,
-                         In first, In last,
-                         const Linear_Expression& obj,
-                         Optimization_Mode mode)
-  : external_space_dim(dim),
-    internal_space_dim(0),
-    tableau(),
-    working_cost(0),
-    mapping(),
-    base(),
-    status(PARTIALLY_SATISFIABLE),
-    pricing(PRICING_STEEPEST_EDGE_FLOAT),
-    initialized(false),
-    input_cs(),
-    inherited_constraints(0),
-    first_pending_constraint(0),
-    input_obj_function(obj),
-    opt_mode(mode),
-    last_generator(point()),
-    i_variables() {
-  // Check for space dimension overflow.
-  if (dim > max_space_dimension())
-    throw std::length_error("PPL::MIP_Problem::"
-                            "MIP_Problem(dim, first, last, obj, mode):\n"
-                            "dim exceeds the maximum allowed space "
-                            "dimension.");
-  // Check the objective function.
-  if (obj.space_dimension() > dim) {
-    std::ostringstream s;
-    s << "PPL::MIP_Problem::MIP_Problem(dim, first, last,"
-      << " obj, mode):\n"
-      << "obj.space_dimension() == "<< obj.space_dimension()
-      << " exceeds d == "<< dim << ".";
-    throw std::invalid_argument(s.str());
-  }
-  // Check the constraints.
-  try {
-    for (In i = first; i != last; ++i) {
-      if (i->is_strict_inequality())
-        throw std::invalid_argument("PPL::MIP_Problem::"
-                                    "MIP_Problem(dim, first, last, obj, mode):"
-                                    "\n"
-                                    "range [first, last) contains a strict "
-                                    "inequality constraint.");
-      if (i->space_dimension() > dim) {
-        std::ostringstream s;
-        s << "PPL::MIP_Problem::"
-          << "MIP_Problem(dim, first, last, obj, mode):\n"
-          << "range [first, last) contains a constraint having space"
-          << "dimension" << " == " << i->space_dimension() << " that exceeds"
-          "this->space_dimension == " << dim << ".";
-        throw std::invalid_argument(s.str());
-      }
-      add_constraint_helper(*i);
-    }
-  } catch (...) {
-    // Delete the allocated constraints, to avoid memory leaks.
-
-    for (Constraint_Sequence::const_iterator
-          i = input_cs.begin(), i_end = input_cs.end(); i != i_end; ++i)
-      delete *i;
-
-    throw;
-  }
-  PPL_ASSERT(OK());
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_MIP_Problem_templates_hh)
diff --git a/src/MIP_Problem.types.hh b/src/MIP_Problem.types.hh
deleted file mode 100644
index 0600835..0000000
--- a/src/MIP_Problem.types.hh
+++ /dev/null
@@ -1,33 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_MIP_Problem_types_hh
-#define PPL_MIP_Problem_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-//! Possible outcomes of the MIP_Problem solver.
-/*! \ingroup PPL_CXX_interface */
-enum MIP_Problem_Status {
-  //! The problem is unfeasible.
-  UNFEASIBLE_MIP_PROBLEM,
-  //! The problem is unbounded.
-  UNBOUNDED_MIP_PROBLEM,
-  //! The problem has an optimal solution.
-  OPTIMIZED_MIP_PROBLEM
-};
-
-class MIP_Problem;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_MIP_Problem_types_hh)
diff --git a/src/MIP_Problem_defs.hh b/src/MIP_Problem_defs.hh
new file mode 100644
index 0000000..989838f
--- /dev/null
+++ b/src/MIP_Problem_defs.hh
@@ -0,0 +1,975 @@
+/* MIP_Problem class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_MIP_Problem_defs_hh
+#define PPL_MIP_Problem_defs_hh 1
+
+#include "MIP_Problem_types.hh"
+#include "globals_types.hh"
+#include "Matrix_defs.hh"
+#include "Linear_Expression_defs.hh"
+#include "Constraint_types.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_defs.hh"
+#include "Variables_Set_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+#include <vector>
+#include <deque>
+#include <iterator>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::MIP_Problem */
+std::ostream&
+operator<<(std::ostream& s, const MIP_Problem& mip);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates MIP_Problem */
+void swap(MIP_Problem& x, MIP_Problem& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A Mixed Integer (linear) Programming problem.
+/*! \ingroup PPL_CXX_interface
+  An object of this class encodes a mixed integer (linear) programming
+  problem.
+  The MIP problem is specified by providing:
+   - the dimension of the vector space;
+   - the feasible region, by means of a finite set of linear equality
+     and non-strict inequality constraints;
+   - the subset of the unknown variables that range over the integers
+     (the other variables implicitly ranging over the reals);
+   - the objective function, described by a Linear_Expression;
+   - the optimization mode (either maximization or minimization).
+
+  The class provides support for the (incremental) solution of the
+  MIP problem based on variations of the revised simplex method and
+  on branch-and-bound techniques. The result of the resolution
+  process is expressed in terms of an enumeration, encoding the
+  feasibility and the unboundedness of the optimization problem.
+  The class supports simple feasibility tests (i.e., no optimization),
+  as well as the extraction of an optimal (resp., feasible) point,
+  provided the MIP_Problem is optimizable (resp., feasible).
+
+  By exploiting the incremental nature of the solver, it is possible
+  to reuse part of the computational work already done when solving
+  variants of a given MIP_Problem: currently, incremental resolution
+  supports the addition of space dimensions, the addition of constraints,
+  the change of objective function and the change of optimization mode.
+*/
+class Parma_Polyhedra_Library::MIP_Problem {
+public:
+  //! Builds a trivial MIP problem.
+  /*!
+    A trivial MIP problem requires to maximize the objective function
+    \f$0\f$ on a vector space under no constraints at all:
+    the origin of the vector space is an optimal solution.
+
+    \param dim
+    The dimension of the vector space enclosing \p *this
+    (optional argument with default value \f$0\f$).
+
+    \exception std::length_error
+    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
+  */
+  explicit MIP_Problem(dimension_type dim = 0);
+
+  /*! \brief
+    Builds an MIP problem having space dimension \p dim
+    from the sequence of constraints in the range
+    \f$[\mathrm{first}, \mathrm{last})\f$,
+    the objective function \p obj and optimization mode \p mode;
+    those dimensions whose indices occur in \p int_vars are
+    constrained to take an integer value.
+
+    \param dim
+    The dimension of the vector space enclosing \p *this.
+
+    \param first
+    An input iterator to the start of the sequence of constraints.
+
+    \param last
+    A past-the-end input iterator to the sequence of constraints.
+
+    \param int_vars
+    The set of variables' indexes that are constrained to take integer values.
+
+    \param obj
+    The objective function (optional argument with default value \f$0\f$).
+
+    \param mode
+    The optimization mode (optional argument with default value
+    <CODE>MAXIMIZATION</CODE>).
+
+    \exception std::length_error
+    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
+
+    \exception std::invalid_argument
+    Thrown if a constraint in the sequence is a strict inequality,
+    if the space dimension of a constraint (resp., of the
+    objective function or of the integer variables) or the space dimension
+    of the integer variable set is strictly greater than \p dim.
+  */
+  template <typename In>
+  MIP_Problem(dimension_type dim,
+              In first, In last,
+              const Variables_Set& int_vars,
+              const Linear_Expression& obj = Linear_Expression::zero(),
+              Optimization_Mode mode = MAXIMIZATION);
+
+  /*! \brief
+    Builds an MIP problem having space dimension \p dim
+    from the sequence of constraints in the range
+    \f$[\mathrm{first}, \mathrm{last})\f$,
+    the objective function \p obj and optimization mode \p mode.
+
+    \param dim
+    The dimension of the vector space enclosing \p *this.
+
+    \param first
+    An input iterator to the start of the sequence of constraints.
+
+    \param last
+    A past-the-end input iterator to the sequence of constraints.
+
+    \param obj
+    The objective function (optional argument with default value \f$0\f$).
+
+    \param mode
+    The optimization mode (optional argument with default value
+    <CODE>MAXIMIZATION</CODE>).
+
+    \exception std::length_error
+    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
+
+    \exception std::invalid_argument
+    Thrown if a constraint in the sequence is a strict inequality
+    or if the space dimension of a constraint (resp., of the
+    objective function or of the integer variables) is strictly
+    greater than \p dim.
+  */
+  template <typename In>
+  MIP_Problem(dimension_type dim,
+              In first, In last,
+              const Linear_Expression& obj = Linear_Expression::zero(),
+              Optimization_Mode mode = MAXIMIZATION);
+
+  /*! \brief
+    Builds an MIP problem having space dimension \p dim from the constraint
+    system \p cs, the objective function \p obj and optimization mode \p mode.
+
+    \param dim
+    The dimension of the vector space enclosing \p *this.
+
+    \param cs
+    The constraint system defining the feasible region.
+
+    \param obj
+    The objective function (optional argument with default value \f$0\f$).
+
+    \param mode
+    The optimization mode (optional argument with default value
+    <CODE>MAXIMIZATION</CODE>).
+
+    \exception std::length_error
+    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
+
+    \exception std::invalid_argument
+    Thrown if the constraint system contains any strict inequality
+    or if the space dimension of the constraint system (resp., the
+    objective function) is strictly greater than \p dim.
+  */
+  MIP_Problem(dimension_type dim,
+              const Constraint_System& cs,
+              const Linear_Expression& obj = Linear_Expression::zero(),
+              Optimization_Mode mode = MAXIMIZATION);
+
+  //! Ordinary copy constructor.
+  MIP_Problem(const MIP_Problem& y);
+
+  //! Destructor.
+  ~MIP_Problem();
+
+  //! Assignment operator.
+  MIP_Problem& operator=(const MIP_Problem& y);
+
+  //! Returns the maximum space dimension an MIP_Problem can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the space dimension of the MIP problem.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns a set containing all the variables' indexes constrained
+    to be integral.
+  */
+  const Variables_Set& integer_space_dimensions() const;
+
+private:
+  //! A type alias for a sequence of constraints.
+  typedef std::vector<Constraint*> Constraint_Sequence;
+
+public:
+  //! A read-only iterator on the constraints defining the feasible region.
+  class const_iterator {
+  private:
+    typedef Constraint_Sequence::const_iterator Base;
+    typedef std::iterator_traits<Base> Base_Traits;
+  public:
+    typedef Base_Traits::iterator_category iterator_category;
+    typedef Base_Traits::difference_type difference_type;
+    typedef const Constraint value_type;
+    typedef const Constraint* pointer;
+    typedef const Constraint& reference;
+
+    //! Iterator difference: computes distances.
+    difference_type operator-(const const_iterator& y) const;
+
+    //! Prefix increment.
+    const_iterator& operator++();
+
+    //! Prefix decrement.
+    const_iterator& operator--();
+
+    //! Postfix increment.
+    const_iterator operator++(int);
+
+    //! Postfix decrement.
+    const_iterator operator--(int);
+
+    //! Moves iterator forward of \p n positions.
+    const_iterator& operator+=(difference_type n);
+
+    //! Moves iterator backward of \p n positions.
+    const_iterator& operator-=(difference_type n);
+
+    //! Returns an iterator \p n positions forward.
+    const_iterator operator+(difference_type n) const;
+
+    //! Returns an iterator \p n positions backward.
+    const_iterator operator-(difference_type n) const;
+
+    //! Returns a reference to the "pointed" object.
+    reference operator*() const;
+
+    //! Returns the address of the "pointed" object.
+    pointer operator->() const;
+
+    //! Compares \p *this with y.
+    /*!
+      \param y
+      The %iterator that will be compared with *this.
+    */
+    bool operator==(const const_iterator& y) const;
+
+    //! Compares \p *this with y.
+    /*!
+      \param y
+      The %iterator that will be compared with *this.
+    */
+    bool operator!=(const const_iterator& y) const;
+
+  private:
+    //! Constructor from a Base iterator.
+    explicit const_iterator(Base base);
+
+    //! The Base iterator on the Constraint_Sequence.
+    Base itr;
+
+    friend class MIP_Problem;
+  };
+
+  /*! \brief
+    Returns a read-only iterator to the first constraint defining
+    the feasible region.
+  */
+  const_iterator constraints_begin() const;
+
+  /*! \brief
+    Returns a past-the-end read-only iterator to the sequence of
+    constraints defining the feasible region.
+  */
+  const_iterator constraints_end() const;
+
+  //! Returns the objective function.
+  const Linear_Expression& objective_function() const;
+
+  //! Returns the optimization mode.
+  Optimization_Mode optimization_mode() const;
+
+  //! Resets \p *this to be equal to the trivial MIP problem.
+  /*!
+    The space dimension is reset to \f$0\f$.
+  */
+  void clear();
+
+  /*! \brief
+    Adds \p m new space dimensions and embeds the old MIP problem
+    in the new vector space.
+
+    \param m
+    The number of dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    The new space dimensions will be those having the highest indexes
+    in the new MIP problem; they are initially unconstrained.
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Sets the variables whose indexes are in set \p i_vars to be
+    integer space dimensions.
+
+    \exception std::invalid_argument
+    Thrown if some index in \p i_vars does not correspond to
+    a space dimension in \p *this.
+  */
+  void add_to_integer_space_dimensions(const Variables_Set& i_vars);
+
+  /*! \brief
+    Adds a copy of constraint \p c to the MIP problem.
+
+    \exception std::invalid_argument
+    Thrown if the constraint \p c is a strict inequality or if its space
+    dimension is strictly greater than the space dimension of \p *this.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds a copy of the constraints in \p cs to the MIP problem.
+
+    \exception std::invalid_argument
+    Thrown if the constraint system \p cs contains any strict inequality
+    or if its space dimension is strictly greater than the space dimension
+    of \p *this.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  //! Sets the objective function to \p obj.
+  /*!
+    \exception std::invalid_argument
+    Thrown if the space dimension of \p obj is strictly greater than
+    the space dimension of \p *this.
+  */
+  void set_objective_function(const Linear_Expression& obj);
+
+  //! Sets the optimization mode to \p mode.
+  void set_optimization_mode(Optimization_Mode mode);
+
+  //! Checks satisfiability of \p *this.
+  /*!
+    \return
+    <CODE>true</CODE> if and only if the MIP problem is satisfiable.
+  */
+  bool is_satisfiable() const;
+
+  //! Optimizes the MIP problem.
+  /*!
+    \return
+    An MIP_Problem_Status flag indicating the outcome of the optimization
+    attempt (unfeasible, unbounded or optimized problem).
+  */
+  MIP_Problem_Status solve() const;
+
+  /*! \brief
+    Sets \p num and \p denom so that
+    \f$\frac{\mathtt{numer}}{\mathtt{denom}}\f$ is the result of
+    evaluating the objective function on \p evaluating_point.
+
+    \param evaluating_point
+    The point on which the objective function will be evaluated.
+
+    \param numer
+    On exit will contain the numerator of the evaluated value.
+
+    \param denom
+    On exit will contain the denominator of the evaluated value.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p evaluating_point are dimension-incompatible
+    or if the generator \p evaluating_point is not a point.
+  */
+  void evaluate_objective_function(const Generator& evaluating_point,
+                                   Coefficient& numer,
+                                   Coefficient& denom) const;
+
+  //! Returns a feasible point for \p *this, if it exists.
+  /*!
+    \exception std::domain_error
+    Thrown if the MIP problem is not satisfiable.
+  */
+  const Generator& feasible_point() const;
+
+  //! Returns an optimal point for \p *this, if it exists.
+  /*!
+    \exception std::domain_error
+    Thrown if \p *this does not not have an optimizing point, i.e.,
+    if the MIP problem is unbounded or not satisfiable.
+  */
+  const Generator& optimizing_point() const;
+
+  /*! \brief
+    Sets \p numer and \p denom so that
+    \f$\frac{\mathtt{numer}}{\mathtt{denom}}\f$ is the solution of the
+    optimization problem.
+
+    \exception std::domain_error
+    Thrown if \p *this does not not have an optimizing point, i.e.,
+    if the MIP problem is unbounded or not satisfiable.
+  */
+  void optimal_value(Coefficient& numer, Coefficient& denom) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(MIP_Problem& y);
+
+  //! Names of MIP problems' control parameters.
+  enum Control_Parameter_Name {
+    //! The pricing rule.
+    PRICING
+  };
+
+  //! Possible values for MIP problem's control parameters.
+  enum Control_Parameter_Value {
+    //! Steepest edge pricing method, using floating points (default).
+    PRICING_STEEPEST_EDGE_FLOAT,
+    //! Steepest edge pricing method, using Coefficient.
+    PRICING_STEEPEST_EDGE_EXACT,
+    //! Textbook pricing method.
+    PRICING_TEXTBOOK
+  };
+
+  //! Returns the value of the control parameter \p name.
+  Control_Parameter_Value
+  get_control_parameter(Control_Parameter_Name name) const;
+
+  //! Sets control parameter \p value.
+  void set_control_parameter(Control_Parameter_Value value);
+
+private:
+  //! The dimension of the vector space.
+  dimension_type external_space_dim;
+
+  /*! \brief
+    The space dimension of the current (partial) solution of the
+    MIP problem; it may be smaller than \p external_space_dim.
+  */
+  dimension_type internal_space_dim;
+
+#if PPL_USE_SPARSE_MATRIX
+  typedef Sparse_Row Row;
+#else
+  typedef Dense_Row Row;
+#endif
+
+  //! The matrix encoding the current feasible region in tableau form.
+  Matrix<Row> tableau;
+
+  typedef Row working_cost_type;
+
+  //! The working cost function.
+  working_cost_type working_cost;
+
+  //! A map between the variables of `input_cs' and `tableau'.
+  /*!
+    Contains all the pairs (i, j) such that mapping[i].first encodes the index
+    of the column in the tableau where input_cs[i] is stored; if
+    mapping[i].second is not a zero, it encodes the split part of the tableau
+    of input_cs[i].
+    The "positive" one is represented by mapping[i].first and the "negative"
+    one is represented by mapping[i].second.
+  */
+  std::vector<std::pair<dimension_type, dimension_type> > mapping;
+
+  //! The current basic solution.
+  std::vector<dimension_type> base;
+
+  //! An enumerated type describing the internal status of the MIP problem.
+  enum Status {
+    //! The MIP problem is unsatisfiable.
+    UNSATISFIABLE,
+    //! The MIP problem is satisfiable; a feasible solution has been computed.
+    SATISFIABLE,
+    //! The MIP problem is unbounded; a feasible solution has been computed.
+    UNBOUNDED,
+    //! The MIP problem is optimized; an optimal solution has been computed.
+    OPTIMIZED,
+    /*! \brief
+      The feasible region of the MIP problem has been changed by adding
+      new space dimensions or new constraints; a feasible solution for
+      the old feasible region is still available.
+    */
+    PARTIALLY_SATISFIABLE
+  };
+
+  //! The internal state of the MIP problem.
+  Status status;
+
+  // TODO: merge `status', `initialized', `pricing' and (maybe) `opt_mode'
+  // into a single bitset status word, so as to save space and allow
+  // for other control parameters.
+
+  //! The pricing method in use.
+  Control_Parameter_Value pricing;
+
+  /*! \brief
+    A Boolean encoding whether or not internal data structures have
+    already been properly sized and populated: useful to allow for
+    deeper checks in method OK().
+  */
+  bool initialized;
+
+  //! The sequence of constraints describing the feasible region.
+  std::vector<Constraint*> input_cs;
+
+  /*! \brief
+    The number of constraints that are inherited from our parent
+    in the recursion tree built when solving via branch-and-bound.
+
+    The first \c inherited_constraints elements in \c input_cs point to
+    the inherited constraints, whose resources are owned by our ancestors.
+    The resources of the other elements in \c input_cs are owned by \c *this
+    and should be appropriately released on destruction.
+  */
+  dimension_type inherited_constraints;
+
+  //! The first index of `input_cs' containing a pending constraint.
+  dimension_type first_pending_constraint;
+
+  //! The objective function to be optimized.
+  Linear_Expression input_obj_function;
+
+  //! The optimization mode requested.
+  Optimization_Mode opt_mode;
+
+  //! The last successfully computed feasible or optimizing point.
+  Generator last_generator;
+
+  /*! \brief
+    A set containing all the indexes of variables that are constrained
+    to have an integer value.
+  */
+  Variables_Set i_variables;
+
+  //! A helper class to temporarily relax a MIP problem using RAII.
+  struct RAII_Temporary_Real_Relaxation {
+    MIP_Problem& lp;
+    Variables_Set i_vars;
+
+    RAII_Temporary_Real_Relaxation(MIP_Problem& mip)
+      : lp(mip), i_vars() {
+      // Turn mip into an LP problem (saving i_variables in i_vars).
+      using std::swap;
+      swap(i_vars, lp.i_variables);
+    }
+
+    ~RAII_Temporary_Real_Relaxation() {
+      // Restore the original set of integer variables.
+      using std::swap;
+      swap(i_vars, lp.i_variables);
+    }
+  };
+  friend struct RAII_Temporary_Real_Relaxation;
+
+  //! A tag type to distinguish normal vs. inheriting copy constructor.
+  struct Inherit_Constraints {};
+
+  //! Copy constructor inheriting constraints.
+  MIP_Problem(const MIP_Problem& y, Inherit_Constraints);
+
+  //! Helper method: implements exception safe addition.
+  void add_constraint_helper(const Constraint& c);
+
+  //! Processes the pending constraints of \p *this.
+  void process_pending_constraints();
+
+  /*! \brief
+    Optimizes the MIP problem using the second phase of the
+    primal simplex algorithm.
+  */
+  void second_phase();
+
+  /*! \brief
+    Assigns to \p this->tableau a simplex tableau representing the
+    MIP problem, inserting into \p this->mapping the information
+    that is required to recover the original MIP problem.
+
+    \return
+    <CODE>UNFEASIBLE_MIP_PROBLEM</CODE> if the constraint system contains
+    any trivially unfeasible constraint (tableau was not computed);
+    <CODE>UNBOUNDED_MIP_PROBLEM</CODE> if the problem is trivially unbounded
+    (the computed tableau contains no constraints);
+    <CODE>OPTIMIZED_MIP_PROBLEM></CODE> if the problem is neither trivially
+    unfeasible nor trivially unbounded (the tableau was computed
+    successfully).
+  */
+  MIP_Problem_Status
+  compute_tableau(std::vector<dimension_type>& worked_out_row);
+
+  /*! \brief
+    Parses the pending constraints to gather information on
+    how to resize the tableau.
+
+    \note
+    All of the method parameters are output parameters; their value
+    is only meaningful when the function exit returning value \c true.
+
+    \return
+    \c false if a trivially false constraint is detected, \c true otherwise.
+
+    \param additional_tableau_rows
+    On exit, this will store the number of rows that have to be added
+    to the original tableau.
+
+    \param additional_slack_variables
+    This will store the number of slack variables that have to be added
+    to the original tableau.
+
+    \param is_tableau_constraint
+    This container of Boolean flags is initially empty. On exit, it size
+    will be equal to the number of pending constraints in \c input_cs.
+    For each pending constraint index \c i, the corresponding element
+    of this container (having index <CODE>i - first_pending_constraint</CODE>)
+    will be set to \c true if and only if the constraint has to be included
+    in the tableau.
+
+    \param is_satisfied_inequality
+    This container of Boolean flags is initially empty. On exit, its size
+    will be equal to the number of pending constraints in \c input_cs.
+    For each pending constraint index \c i, the corresponding element
+    of this container (having index <CODE>i - first_pending_constraint</CODE>)
+    will be set to \c true if and only if it is an inequality and it
+    is already satisfied by \c last_generator (hence it does not require
+    the introduction of an artificial variable).
+
+    \param is_nonnegative_variable
+    This container of Boolean flags is initially empty.
+    On exit, it size is equal to \c external_space_dim.
+    For each variable (index), the corresponding element of this container
+    is \c true if the variable is known to be nonnegative (and hence should
+    not be split into a positive and a negative part).
+
+    \param is_remergeable_variable
+    This container of Boolean flags is initially empty.
+    On exit, it size is equal to \c internal_space_dim.
+    For each variable (index), the corresponding element of this container
+    is \c true if the variable was previously split into positive and
+    negative parts that can now be merged back, since it is known
+    that the variable is nonnegative.
+  */
+  bool parse_constraints(dimension_type& additional_tableau_rows,
+                         dimension_type& additional_slack_variables,
+                         std::deque<bool>& is_tableau_constraint,
+                         std::deque<bool>& is_satisfied_inequality,
+                         std::deque<bool>& is_nonnegative_variable,
+                         std::deque<bool>& is_remergeable_variable) const;
+
+  /*! \brief
+    Computes the row index of the variable exiting the base
+    of the MIP problem. Implemented with anti-cycling rule.
+
+    \return
+    The row index of the variable exiting the base.
+
+    \param entering_var_index
+    The column index of the variable entering the base.
+  */
+  dimension_type
+  get_exiting_base_index(dimension_type entering_var_index) const;
+
+  //! Linearly combines \p x with \p y so that <CODE>*this[k]</CODE> is 0.
+  /*!
+    \param x
+    The row that will be combined with \p y object.
+
+    \param y
+    The row that will be combined with \p x object.
+
+    \param k
+    The position of \p *this that have to be \f$0\f$.
+
+    Computes a linear combination of \p x and \p y having
+    the element of index \p k equal to \f$0\f$. Then it assigns
+    the resulting Row to \p x and normalizes it.
+  */
+  static void linear_combine(Row& x, const Row& y, const dimension_type k);
+
+  // TODO: Remove this when the sparse working cost has been tested enough.
+#if PPL_USE_SPARSE_MATRIX
+
+  //! Linearly combines \p x with \p y so that <CODE>*this[k]</CODE> is 0.
+  /*!
+    \param x
+    The row that will be combined with \p y object.
+
+    \param y
+    The row that will be combined with \p x object.
+
+    \param k
+    The position of \p *this that have to be \f$0\f$.
+
+    Computes a linear combination of \p x and \p y having
+    the element of index \p k equal to \f$0\f$. Then it assigns
+    the resulting Dense_Row to \p x and normalizes it.
+  */
+  static void linear_combine(Dense_Row& x, const Sparse_Row& y,
+                             const dimension_type k);
+
+#endif // defined(PPL_USE_SPARSE_MATRIX)
+
+  static bool is_unbounded_obj_function(
+    const Linear_Expression& obj_function,
+    const std::vector<std::pair<dimension_type, dimension_type> >& mapping,
+    Optimization_Mode optimization_mode);
+
+  /*! \brief
+    Performs the pivoting operation on the tableau.
+
+    \param entering_var_index
+    The index of the variable entering the base.
+
+    \param exiting_base_index
+    The index of the row exiting the base.
+  */
+  void pivot(dimension_type entering_var_index,
+             dimension_type exiting_base_index);
+
+  /*! \brief
+    Computes the column index of the variable entering the base,
+    using the textbook algorithm with anti-cycling rule.
+
+    \return
+    The column index of the variable that enters the base.
+    If no such variable exists, optimality was achieved
+    and <CODE>0</CODE> is returned.
+  */
+  dimension_type textbook_entering_index() const;
+
+  /*! \brief
+    Computes the column index of the variable entering the base,
+    using an exact steepest-edge algorithm with anti-cycling rule.
+
+    \return
+    The column index of the variable that enters the base.
+    If no such variable exists, optimality was achieved
+    and <CODE>0</CODE> is returned.
+
+    To compute the entering_index, the steepest edge algorithm chooses
+    the index `j' such that \f$\frac{d_{j}}{\|\Delta x^{j} \|}\f$ is the
+    largest in absolute value, where
+    \f[
+      \|\Delta x^{j} \|
+        = \left(
+            1+\sum_{i=1}^{m} \alpha_{ij}^2
+          \right)^{\frac{1}{2}}.
+    \f]
+    Recall that, due to the exact integer implementation of the algorithm,
+    our tableau does not contain the ``real'' \f$\alpha\f$ values, but these
+    can be computed dividing the value of the coefficient by the value of
+    the variable in base. Obviously the result may not be an integer, so
+    we will proceed in another way: we compute the lcm of all the variables
+    in base to get the good ``weight'' of each Coefficient of the tableau.
+  */
+  dimension_type steepest_edge_exact_entering_index() const;
+
+  /*! \brief
+    Same as steepest_edge_exact_entering_index,
+    but using floating points.
+
+    \note
+    Due to rounding errors, the index of the variable entering the base
+    of the MIP problem is not predictable across different architectures.
+    Hence, the overall simplex computation may differ in the path taken
+    to reach the optimum. Anyway, the exact final result will be computed
+    for the MIP_Problem.
+  */
+  dimension_type steepest_edge_float_entering_index() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and if only the algorithm successfully
+    computed a feasible solution.
+
+    \note
+    Uses an exact pricing method (either textbook or exact steepest edge),
+    so that the result is deterministic across different architectures.
+  */
+  bool compute_simplex_using_exact_pricing();
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and if only the algorithm successfully
+    computed a feasible solution.
+
+    \note
+    Uses a floating point implementation of the steepest edge pricing
+    method, so that the result is correct, but not deterministic across
+    different architectures.
+  */
+  bool compute_simplex_using_steepest_edge_float();
+
+  /*! \brief
+    Drop unnecessary artificial variables from the tableau and get ready
+    for the second phase of the simplex algorithm.
+
+    \note
+    The two parameters denote a STL-like half-open range.
+    It is assumed that \p begin_artificials is strictly greater than 0
+    and smaller than \p end_artificials.
+
+    \param begin_artificials
+    The start of the tableau column index range for artificial variables.
+
+    \param end_artificials
+    The end of the tableau column index range for artificial variables.
+    Note that column index end_artificial is \e excluded from the range.
+  */
+  void erase_artificials(dimension_type begin_artificials,
+                         dimension_type end_artificials);
+
+  bool is_in_base(dimension_type var_index,
+                  dimension_type& row_index) const;
+
+  /*! \brief
+    Computes a valid generator that satisfies all the constraints of the
+    Linear Programming problem associated to \p *this.
+  */
+  void compute_generator() const;
+
+  /*! \brief
+    Merges back the positive and negative part of a (previously split)
+    variable after detecting a corresponding nonnegativity constraint.
+
+    \return
+    If the negative part of \p var_index was in base, the index of
+    the corresponding tableau row (which has become non-feasible);
+    otherwise \c not_a_dimension().
+
+    \param var_index
+    The index of the variable that has to be merged.
+  */
+  dimension_type merge_split_variable(dimension_type var_index);
+
+  //! Returns <CODE>true</CODE> if and only if \p c is satisfied by \p g.
+  static bool is_satisfied(const Constraint& c, const Generator& g);
+
+  //! Returns <CODE>true</CODE> if and only if \p c is saturated by \p g.
+  static bool is_saturated(const Constraint& c, const Generator& g);
+
+  /*! \brief
+    Returns a status that encodes the solution of the MIP problem.
+
+    \param have_incumbent_solution
+    It is used to store if the solving process has found a provisional
+    optimum point.
+
+    \param incumbent_solution_value
+    Encodes the evaluated value of the provisional optimum point found.
+
+    \param incumbent_solution_point
+    If the method returns `OPTIMIZED', this will contain the optimality point.
+
+    \param mip
+    The problem that has to be solved.
+
+    \param i_vars
+    The variables that are constrained to take an integer value.
+  */
+  static MIP_Problem_Status solve_mip(bool& have_incumbent_solution,
+                                      mpq_class& incumbent_solution_value,
+                                      Generator& incumbent_solution_point,
+                                      MIP_Problem& mip,
+                                      const Variables_Set& i_vars);
+
+  /*! \brief
+    Returns \c true if and if only the LP problem is satisfiable.
+  */
+  bool is_lp_satisfiable() const;
+
+  /*! \brief
+    Returns \c true if and if only the MIP problem \p mip is satisfiable
+    when variables in \p i_vars can only take integral values.
+
+    \param mip
+    The MIP problem. This is assumed to have no integral space dimension
+    (so that it is a pure LP problem).
+
+    \param i_vars
+    The variables that are constrained to take integral values.
+
+    \param p
+    If \c true is returned, it will encode a feasible point.
+  */
+  static bool is_mip_satisfiable(MIP_Problem& mip,
+                                 const Variables_Set& i_vars,
+                                 Generator& p);
+
+  /*! \brief
+    Returns \c true if and if only \c mip.last_generator satisfies all the
+    integrality conditions implicitly stated using by \p i_vars.
+
+    \param mip
+    The MIP problem. This is assumed to have no integral space dimension
+    (so that it is a pure LP problem).
+
+    \param i_vars
+    The variables that are constrained to take an integer value.
+
+    \param branching_index
+    If \c false is returned, this will encode the non-integral variable
+    index on which the `branch and bound' algorithm should be applied.
+  */
+  static bool choose_branching_variable(const MIP_Problem& mip,
+                                        const Variables_Set& i_vars,
+                                        dimension_type& branching_index);
+};
+
+#include "MIP_Problem_inlines.hh"
+#include "MIP_Problem_templates.hh"
+
+#endif // !defined(PPL_MIP_Problem_defs_hh)
diff --git a/src/MIP_Problem_inlines.hh b/src/MIP_Problem_inlines.hh
new file mode 100644
index 0000000..97b3cce
--- /dev/null
+++ b/src/MIP_Problem_inlines.hh
@@ -0,0 +1,321 @@
+/* MIP_Problem class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_MIP_Problem_inlines_hh
+#define PPL_MIP_Problem_inlines_hh 1
+
+#include "Constraint_defs.hh"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+inline dimension_type
+MIP_Problem::max_space_dimension() {
+  return Constraint::max_space_dimension();
+}
+
+inline dimension_type
+MIP_Problem::space_dimension() const {
+  return external_space_dim;
+}
+
+
+inline
+MIP_Problem::MIP_Problem(const MIP_Problem& y)
+  : external_space_dim(y.external_space_dim),
+    internal_space_dim(y.internal_space_dim),
+    tableau(y.tableau),
+    working_cost(y.working_cost),
+    mapping(y.mapping),
+    base(y.base),
+    status(y.status),
+    pricing(y.pricing),
+    initialized(y.initialized),
+    input_cs(),
+    inherited_constraints(0),
+    first_pending_constraint(),
+    input_obj_function(y.input_obj_function),
+    opt_mode(y.opt_mode),
+    last_generator(y.last_generator),
+    i_variables(y.i_variables) {
+  input_cs.reserve(y.input_cs.size());
+  for (Constraint_Sequence::const_iterator i = y.input_cs.begin(),
+         i_end = y.input_cs.end(); i != i_end; ++i)
+    add_constraint_helper(*(*i));
+  PPL_ASSERT(OK());
+}
+
+inline
+MIP_Problem::MIP_Problem(const MIP_Problem& y, Inherit_Constraints)
+  : external_space_dim(y.external_space_dim),
+    internal_space_dim(y.internal_space_dim),
+    tableau(y.tableau),
+    working_cost(y.working_cost),
+    mapping(y.mapping),
+    base(y.base),
+    status(y.status),
+    pricing(y.pricing),
+    initialized(y.initialized),
+    input_cs(y.input_cs),
+    // NOTE: The constraints are inherited, NOT copied!
+    inherited_constraints(y.input_cs.size()),
+    first_pending_constraint(y.first_pending_constraint),
+    input_obj_function(y.input_obj_function),
+    opt_mode(y.opt_mode),
+    last_generator(y.last_generator),
+    i_variables(y.i_variables) {
+  PPL_ASSERT(OK());
+}
+
+inline void
+MIP_Problem::add_constraint_helper(const Constraint& c) {
+  // For exception safety, reserve space for the new element.
+  const dimension_type size = input_cs.size();
+  if (size == input_cs.capacity()) {
+    const dimension_type max_size = input_cs.max_size();
+    if (size == max_size)
+      throw std::length_error("MIP_Problem::add_constraint(): "
+                              "too many constraints");
+    // Use an exponential grow policy to avoid too many reallocations.
+    input_cs.reserve(compute_capacity(size + 1, max_size));
+  }
+
+  // This operation does not throw, because the space for the new element
+  // has already been reserved: hence the new-ed Constraint is safe.
+  input_cs.push_back(new Constraint(c));
+}
+
+inline
+MIP_Problem::~MIP_Problem() {
+  // NOTE: do NOT delete inherited constraints; they are owned
+  // (and will eventually be deleted) by ancestors.
+  for (Constraint_Sequence::const_iterator
+         i = nth_iter(input_cs, inherited_constraints),
+         i_end = input_cs.end(); i != i_end; ++i)
+    delete *i;
+}
+
+
+inline void
+MIP_Problem::set_optimization_mode(const Optimization_Mode mode) {
+  if (opt_mode != mode) {
+    opt_mode = mode;
+    if (status == UNBOUNDED || status == OPTIMIZED)
+      status = SATISFIABLE;
+    PPL_ASSERT(OK());
+  }
+}
+
+inline const Linear_Expression&
+MIP_Problem::objective_function() const {
+  return input_obj_function;
+}
+
+inline Optimization_Mode
+MIP_Problem::optimization_mode() const {
+  return opt_mode;
+}
+
+inline void
+MIP_Problem::optimal_value(Coefficient& numer, Coefficient& denom) const {
+  const Generator& g = optimizing_point();
+  evaluate_objective_function(g, numer, denom);
+}
+
+inline MIP_Problem::const_iterator
+MIP_Problem::constraints_begin() const {
+  return const_iterator(input_cs.begin());
+}
+
+inline MIP_Problem::const_iterator
+MIP_Problem::constraints_end() const {
+  return const_iterator(input_cs.end());
+}
+
+inline const Variables_Set&
+MIP_Problem::integer_space_dimensions() const {
+  return i_variables;
+}
+
+inline MIP_Problem::Control_Parameter_Value
+MIP_Problem::get_control_parameter(Control_Parameter_Name name) const {
+  PPL_USED(name);
+  PPL_ASSERT(name == PRICING);
+  return pricing;
+}
+
+inline void
+MIP_Problem::set_control_parameter(Control_Parameter_Value value) {
+  pricing = value;
+}
+
+inline void
+MIP_Problem::m_swap(MIP_Problem& y) {
+  using std::swap;
+  swap(external_space_dim, y.external_space_dim);
+  swap(internal_space_dim, y.internal_space_dim);
+  swap(tableau, y.tableau);
+  swap(working_cost, y.working_cost);
+  swap(mapping, y.mapping);
+  swap(initialized, y.initialized);
+  swap(base, y.base);
+  swap(status, y.status);
+  swap(pricing, y.pricing);
+  swap(input_cs, y.input_cs);
+  swap(inherited_constraints, y.inherited_constraints);
+  swap(first_pending_constraint, y.first_pending_constraint);
+  swap(input_obj_function, y.input_obj_function);
+  swap(opt_mode, y.opt_mode);
+  swap(last_generator, y.last_generator);
+  swap(i_variables, y.i_variables);
+}
+
+inline MIP_Problem&
+MIP_Problem::operator=(const MIP_Problem& y) {
+  MIP_Problem tmp(y);
+  m_swap(tmp);
+  return *this;
+}
+
+inline void
+MIP_Problem::clear() {
+  MIP_Problem tmp;
+  m_swap(tmp);
+}
+
+
+inline memory_size_type
+MIP_Problem::external_memory_in_bytes() const {
+  memory_size_type n
+    = working_cost.external_memory_in_bytes()
+    + tableau.external_memory_in_bytes()
+    + input_obj_function.external_memory_in_bytes()
+    + last_generator.external_memory_in_bytes();
+
+  // Adding the external memory for `input_cs'.
+  // NOTE: disregard inherited constraints, as they are owned by ancestors.
+  n += input_cs.capacity() * sizeof(Constraint*);
+  for (Constraint_Sequence::const_iterator
+         i = nth_iter(input_cs, inherited_constraints),
+         i_end = input_cs.end(); i != i_end; ++i)
+    n += ((*i)->total_memory_in_bytes());
+
+  // Adding the external memory for `base'.
+  n += base.capacity() * sizeof(dimension_type);
+  // Adding the external memory for `mapping'.
+  n += mapping.capacity() * sizeof(std::pair<dimension_type, dimension_type>);
+  return n;
+}
+
+inline memory_size_type
+MIP_Problem::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline
+MIP_Problem::const_iterator::const_iterator(Base base)
+  : itr(base) {
+}
+
+inline MIP_Problem::const_iterator::difference_type
+MIP_Problem::const_iterator::operator-(const const_iterator& y) const {
+  return itr - y.itr;
+}
+
+inline MIP_Problem::const_iterator&
+MIP_Problem::const_iterator::operator++() {
+  ++itr;
+  return *this;
+}
+
+inline MIP_Problem::const_iterator&
+MIP_Problem::const_iterator::operator--() {
+  --itr;
+  return *this;
+}
+
+inline MIP_Problem::const_iterator
+MIP_Problem::const_iterator::operator++(int) {
+  const_iterator x = *this;
+  operator++();
+  return x;
+}
+
+inline MIP_Problem::const_iterator
+MIP_Problem::const_iterator::operator--(int) {
+  const_iterator x = *this;
+  operator--();
+  return x;
+}
+
+inline MIP_Problem::const_iterator
+MIP_Problem::const_iterator::operator+(difference_type n) const {
+  return const_iterator(itr + n);
+}
+
+inline MIP_Problem::const_iterator
+MIP_Problem::const_iterator::operator-(difference_type n) const {
+  return const_iterator(itr - n);
+}
+
+inline MIP_Problem::const_iterator&
+MIP_Problem::const_iterator::operator+=(difference_type n) {
+  itr += n;
+  return *this;
+}
+
+inline MIP_Problem::const_iterator&
+MIP_Problem::const_iterator::operator-=(difference_type n) {
+  itr -= n;
+  return *this;
+}
+
+inline MIP_Problem::const_iterator::reference
+MIP_Problem::const_iterator::operator*() const {
+  return *(*itr);
+}
+
+inline MIP_Problem::const_iterator::pointer
+MIP_Problem::const_iterator::operator->() const {
+  return *itr;
+}
+
+inline bool
+MIP_Problem::const_iterator::operator==(const const_iterator& y) const {
+  return itr == y.itr;
+}
+
+inline bool
+MIP_Problem::const_iterator::operator!=(const const_iterator& y) const {
+  return itr != y.itr;
+}
+
+/*! \relates MIP_Problem */
+inline void
+swap(MIP_Problem& x, MIP_Problem& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_MIP_Problem_inlines_hh)
diff --git a/src/MIP_Problem_templates.hh b/src/MIP_Problem_templates.hh
new file mode 100644
index 0000000..123d2bc
--- /dev/null
+++ b/src/MIP_Problem_templates.hh
@@ -0,0 +1,181 @@
+/* MIP_Problem class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_MIP_Problem_templates_hh
+#define PPL_MIP_Problem_templates_hh 1
+
+#include "Variables_Set_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename In>
+MIP_Problem::MIP_Problem(const dimension_type dim,
+                         In first, In last,
+                         const Variables_Set& int_vars,
+                         const Linear_Expression& obj,
+                         const Optimization_Mode mode)
+  : external_space_dim(dim),
+    internal_space_dim(0),
+    tableau(),
+    working_cost(0),
+    mapping(),
+    base(),
+    status(PARTIALLY_SATISFIABLE),
+    pricing(PRICING_STEEPEST_EDGE_FLOAT),
+    initialized(false),
+    input_cs(),
+    inherited_constraints(0),
+    first_pending_constraint(0),
+    input_obj_function(obj),
+    opt_mode(mode),
+    last_generator(point()),
+    i_variables(int_vars) {
+  // Check that integer Variables_Set does not exceed the space dimension
+  // of the problem.
+  if (i_variables.space_dimension() > external_space_dim) {
+    std::ostringstream s;
+    s << "PPL::MIP_Problem::MIP_Problem"
+      << "(dim, first, last, int_vars, obj, mode):\n"
+      << "dim == "<< external_space_dim << " and int_vars.space_dimension() =="
+      << " " << i_variables.space_dimension() << " are dimension"
+      "incompatible.";
+    throw std::invalid_argument(s.str());
+  }
+
+  // Check for space dimension overflow.
+  if (dim > max_space_dimension())
+    throw std::length_error("PPL::MIP_Problem:: MIP_Problem(dim, first, "
+                            "last, int_vars, obj, mode):\n"
+                            "dim exceeds the maximum allowed"
+                            "space dimension.");
+  // Check the objective function.
+  if (obj.space_dimension() > dim) {
+    std::ostringstream s;
+    s << "PPL::MIP_Problem::MIP_Problem(dim, first, last,"
+      << "int_vars, obj, mode):\n"
+      << "obj.space_dimension() == "<< obj.space_dimension()
+      << " exceeds d == "<< dim << ".";
+    throw std::invalid_argument(s.str());
+  }
+  // Check the constraints.
+  try {
+    for (In i = first; i != last; ++i) {
+      if (i->is_strict_inequality())
+        throw std::invalid_argument("PPL::MIP_Problem::"
+                                    "MIP_Problem(dim, first, last, int_vars,"
+                                    "obj, mode):\nrange [first, last) contains"
+                                    "a strict inequality constraint.");
+      if (i->space_dimension() > dim) {
+        std::ostringstream s;
+        s << "PPL::MIP_Problem::"
+          << "MIP_Problem(dim, first, last, int_vars, obj, mode):\n"
+          << "range [first, last) contains a constraint having space"
+          << "dimension  == " << i->space_dimension() << " that exceeds"
+          "this->space_dimension == " << dim << ".";
+        throw std::invalid_argument(s.str());
+      }
+      add_constraint_helper(*i);
+    }
+  } catch (...) {
+    // Delete the allocated constraints, to avoid memory leaks.
+
+    for (Constraint_Sequence::const_iterator
+          i = input_cs.begin(), i_end = input_cs.end(); i != i_end; ++i)
+      delete *i;
+
+    throw;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename In>
+MIP_Problem::MIP_Problem(dimension_type dim,
+                         In first, In last,
+                         const Linear_Expression& obj,
+                         Optimization_Mode mode)
+  : external_space_dim(dim),
+    internal_space_dim(0),
+    tableau(),
+    working_cost(0),
+    mapping(),
+    base(),
+    status(PARTIALLY_SATISFIABLE),
+    pricing(PRICING_STEEPEST_EDGE_FLOAT),
+    initialized(false),
+    input_cs(),
+    inherited_constraints(0),
+    first_pending_constraint(0),
+    input_obj_function(obj),
+    opt_mode(mode),
+    last_generator(point()),
+    i_variables() {
+  // Check for space dimension overflow.
+  if (dim > max_space_dimension())
+    throw std::length_error("PPL::MIP_Problem::"
+                            "MIP_Problem(dim, first, last, obj, mode):\n"
+                            "dim exceeds the maximum allowed space "
+                            "dimension.");
+  // Check the objective function.
+  if (obj.space_dimension() > dim) {
+    std::ostringstream s;
+    s << "PPL::MIP_Problem::MIP_Problem(dim, first, last,"
+      << " obj, mode):\n"
+      << "obj.space_dimension() == "<< obj.space_dimension()
+      << " exceeds d == "<< dim << ".";
+    throw std::invalid_argument(s.str());
+  }
+  // Check the constraints.
+  try {
+    for (In i = first; i != last; ++i) {
+      if (i->is_strict_inequality())
+        throw std::invalid_argument("PPL::MIP_Problem::"
+                                    "MIP_Problem(dim, first, last, obj, mode):"
+                                    "\n"
+                                    "range [first, last) contains a strict "
+                                    "inequality constraint.");
+      if (i->space_dimension() > dim) {
+        std::ostringstream s;
+        s << "PPL::MIP_Problem::"
+          << "MIP_Problem(dim, first, last, obj, mode):\n"
+          << "range [first, last) contains a constraint having space"
+          << "dimension" << " == " << i->space_dimension() << " that exceeds"
+          "this->space_dimension == " << dim << ".";
+        throw std::invalid_argument(s.str());
+      }
+      add_constraint_helper(*i);
+    }
+  } catch (...) {
+    // Delete the allocated constraints, to avoid memory leaks.
+
+    for (Constraint_Sequence::const_iterator
+          i = input_cs.begin(), i_end = input_cs.end(); i != i_end; ++i)
+      delete *i;
+
+    throw;
+  }
+  PPL_ASSERT(OK());
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_MIP_Problem_templates_hh)
diff --git a/src/MIP_Problem_types.hh b/src/MIP_Problem_types.hh
new file mode 100644
index 0000000..0ec632f
--- /dev/null
+++ b/src/MIP_Problem_types.hh
@@ -0,0 +1,33 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_MIP_Problem_types_hh
+#define PPL_MIP_Problem_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+//! Possible outcomes of the MIP_Problem solver.
+/*! \ingroup PPL_CXX_interface */
+enum MIP_Problem_Status {
+  //! The problem is unfeasible.
+  UNFEASIBLE_MIP_PROBLEM,
+  //! The problem is unbounded.
+  UNBOUNDED_MIP_PROBLEM,
+  //! The problem has an optimal solution.
+  OPTIMIZED_MIP_PROBLEM
+};
+
+class MIP_Problem;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_MIP_Problem_types_hh)
diff --git a/src/Makefile.am b/src/Makefile.am
index 8a73add..8cd12b7 100644
--- a/src/Makefile.am
+++ b/src/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -59,8 +59,9 @@
 #	    0.12		   10:0:0
 #	    0.12.1		   11:0:0
 #	    1.0			   12:0:0
+#	    1.1			   13:0:0
 
-LIBPPL_LT_CURRENT =  12
+LIBPPL_LT_CURRENT =  13
 LIBPPL_LT_REVISION =  0
 LIBPPL_LT_AGE =       0
 
@@ -108,11 +109,11 @@ endif USE_CHECKED_INTEGERS
 if USE_GMP_INTEGERS
 
 COEFFICIENT_TYPES_INCLUDE_FILES = \
-  GMP_Integer.types.hh
+  GMP_Integer_types.hh
 
 COEFFICIENT_DEFS_INCLUDE_FILES = \
-  GMP_Integer.defs.hh \
-  GMP_Integer.inlines.hh
+  GMP_Integer_defs.hh \
+  GMP_Integer_inlines.hh
 
 endif USE_GMP_INTEGERS
 
@@ -125,352 +126,355 @@ meta_programming.hh \
 Slow_Copy.hh \
 Has_Assign_Or_Swap.hh \
 assign_or_swap.hh \
-mp_std_bits.defs.hh \
-mp_std_bits.inlines.hh \
-Concrete_Expression.types.hh \
-Concrete_Expression.defs.hh \
-Concrete_Expression.inlines.hh \
-Temp.defs.hh \
-Temp.inlines.hh \
-Temp.templates.hh \
+mp_std_bits_defs.hh \
+mp_std_bits_inlines.hh \
+Concrete_Expression_types.hh \
+Concrete_Expression_defs.hh \
+Concrete_Expression_inlines.hh \
+Temp_defs.hh \
+Temp_inlines.hh \
+Temp_templates.hh \
 Coefficient_traits_template.hh \
-Checked_Number.types.hh \
-termination.types.hh \
+Checked_Number_types.hh \
+termination_types.hh \
 $(COEFFICIENT_TYPES_INCLUDE_FILES) \
-Coefficient.types.hh \
-stdiobuf.types.hh \
-c_streambuf.types.hh \
-globals.types.hh \
-iterator_to_const.types.hh \
-distances.types.hh \
-Interval_Info.types.hh \
-Interval.types.hh \
-Box.types.hh \
-Constraint.types.hh \
-Generator.types.hh \
-Grid_Generator.types.hh \
-Congruence.types.hh \
-Init.types.hh \
-Dense_Row.types.hh \
-CO_Tree.types.hh \
-Sparse_Row.types.hh \
-Matrix.types.hh \
-Swapping_Vector.types.hh \
-Variable.types.hh \
-Variables_Set.types.hh \
-Linear_Expression.types.hh \
-Expression_Hide_Last.types.hh \
-Expression_Hide_Inhomo.types.hh \
-Linear_Expression_Impl.types.hh \
-Linear_Expression_Interface.types.hh \
-Linear_System.types.hh \
-Linear_Form.types.hh \
-Bit_Row.types.hh \
-Bit_Matrix.types.hh \
-Constraint_System.types.hh \
-Generator_System.types.hh \
-Grid_Generator_System.types.hh \
-Congruence_System.types.hh \
-Scalar_Products.types.hh \
-PIP_Tree.types.hh \
-PIP_Problem.types.hh \
-Poly_Con_Relation.types.hh \
-Poly_Gen_Relation.types.hh \
-BHRZ03_Certificate.types.hh \
-H79_Certificate.types.hh \
-Grid_Certificate.types.hh \
-Partial_Function.types.hh \
-Polyhedron.types.hh \
-C_Polyhedron.types.hh \
-NNC_Polyhedron.types.hh \
-Grid.types.hh \
-Ptr_Iterator.types.hh \
-DB_Row.types.hh \
-DB_Matrix.types.hh \
-BD_Shape.types.hh \
-OR_Matrix.types.hh \
-Octagonal_Shape.types.hh \
-fpu.types.hh \
-Float.defs.hh \
-Float.inlines.hh \
-Float.templates.hh \
+Coefficient_types.hh \
+stdiobuf_types.hh \
+c_streambuf_types.hh \
+globals_types.hh \
+iterator_to_const_types.hh \
+distances_types.hh \
+Interval_Info_types.hh \
+Interval_types.hh \
+Box_types.hh \
+Constraint_types.hh \
+Generator_types.hh \
+Grid_Generator_types.hh \
+Congruence_types.hh \
+Init_types.hh \
+Dense_Row_types.hh \
+CO_Tree_types.hh \
+Sparse_Row_types.hh \
+Matrix_types.hh \
+Swapping_Vector_types.hh \
+Variable_types.hh \
+Variables_Set_types.hh \
+Linear_Expression_types.hh \
+Expression_Adapter_types.hh \
+Expression_Hide_Last_types.hh \
+Expression_Hide_Inhomo_types.hh \
+Linear_Expression_Impl_types.hh \
+Linear_Expression_Interface_types.hh \
+Linear_System_types.hh \
+Linear_Form_types.hh \
+Bit_Row_types.hh \
+Bit_Matrix_types.hh \
+Constraint_System_types.hh \
+Generator_System_types.hh \
+Grid_Generator_System_types.hh \
+Congruence_System_types.hh \
+Scalar_Products_types.hh \
+PIP_Tree_types.hh \
+PIP_Problem_types.hh \
+Poly_Con_Relation_types.hh \
+Poly_Gen_Relation_types.hh \
+BHRZ03_Certificate_types.hh \
+H79_Certificate_types.hh \
+Grid_Certificate_types.hh \
+Partial_Function_types.hh \
+Polyhedron_types.hh \
+C_Polyhedron_types.hh \
+NNC_Polyhedron_types.hh \
+Grid_types.hh \
+Ptr_Iterator_types.hh \
+DB_Row_types.hh \
+DB_Matrix_types.hh \
+BD_Shape_types.hh \
+OR_Matrix_types.hh \
+Octagonal_Shape_types.hh \
+fpu_types.hh \
+Float_defs.hh \
+Float_inlines.hh \
+Float_templates.hh \
 C_Integer.hh \
-fpu.defs.hh \
-fpu-c99.inlines.hh \
-fpu-ia32.inlines.hh \
-fpu-none.inlines.hh \
-fpu-sparc.inlines.hh \
-Rounding_Dir.defs.hh \
-Rounding_Dir.inlines.hh \
-Result.defs.hh \
-Result.inlines.hh \
-Numeric_Format.defs.hh \
-checked.defs.hh \
-checked.inlines.hh \
-checked_int.inlines.hh \
-checked_float.inlines.hh \
-checked_mpz.inlines.hh \
-checked_mpq.inlines.hh \
-checked_ext.inlines.hh \
-Checked_Number.defs.hh \
-Checked_Number.inlines.hh \
-Checked_Number.templates.hh \
-WRD_coefficient_types.defs.hh \
-WRD_coefficient_types.inlines.hh \
+fpu_defs.hh \
+fpu-c99_inlines.hh \
+fpu-ia32_inlines.hh \
+fpu-none_inlines.hh \
+fpu-sparc_inlines.hh \
+Rounding_Dir_defs.hh \
+Rounding_Dir_inlines.hh \
+Result_defs.hh \
+Result_inlines.hh \
+Numeric_Format_defs.hh \
+checked_defs.hh \
+checked_inlines.hh \
+checked_int_inlines.hh \
+checked_float_inlines.hh \
+checked_mpz_inlines.hh \
+checked_mpq_inlines.hh \
+checked_ext_inlines.hh \
+Checked_Number_defs.hh \
+Checked_Number_inlines.hh \
+Checked_Number_templates.hh \
+WRD_coefficient_types_defs.hh \
+WRD_coefficient_types_inlines.hh \
 checked_numeric_limits.hh \
 $(COEFFICIENT_DEFS_INCLUDE_FILES) \
-Coefficient.defs.hh \
-Coefficient.inlines.hh \
-stdiobuf.defs.hh \
-stdiobuf.inlines.hh \
-c_streambuf.defs.hh \
-c_streambuf.inlines.hh \
-globals.defs.hh \
-globals.inlines.hh \
-math_utilities.defs.hh \
-math_utilities.inlines.hh \
-iterator_to_const.defs.hh \
-iterator_to_const.inlines.hh \
-distances.defs.hh \
-distances.inlines.hh \
-Boundary.defs.hh \
-intervals.defs.hh \
-Interval_Info.defs.hh \
-Interval_Info.inlines.hh \
-Interval.defs.hh \
-Interval.inlines.hh \
-Interval.templates.hh \
-Box.defs.hh \
-Box_Status.inlines.hh \
-Box.inlines.hh \
-Box.templates.hh \
+Coefficient_defs.hh \
+Coefficient_inlines.hh \
+stdiobuf_defs.hh \
+stdiobuf_inlines.hh \
+c_streambuf_defs.hh \
+c_streambuf_inlines.hh \
+globals_defs.hh \
+globals_inlines.hh \
+math_utilities_defs.hh \
+math_utilities_inlines.hh \
+iterator_to_const_defs.hh \
+iterator_to_const_inlines.hh \
+distances_defs.hh \
+distances_inlines.hh \
+Boundary_defs.hh \
+intervals_defs.hh \
+Interval_Info_defs.hh \
+Interval_Info_inlines.hh \
+Interval_defs.hh \
+Interval_inlines.hh \
+Interval_templates.hh \
+Box_defs.hh \
+Box_Status_inlines.hh \
+Box_inlines.hh \
+Box_templates.hh \
 Integer_Interval.hh \
 Rational_Interval.hh \
 Rational_Box.hh \
-Variable.defs.hh \
-Variable.inlines.hh \
-Variables_Set.defs.hh \
-Variables_Set.inlines.hh \
-Init.defs.hh \
-Init.inlines.hh \
+Variable_defs.hh \
+Variable_inlines.hh \
+Variables_Set_defs.hh \
+Variables_Set_inlines.hh \
+Init_defs.hh \
+Init_inlines.hh \
 initializer.hh \
-Topology.types.hh \
-Dense_Row.defs.hh \
-Dense_Row.inlines.hh \
-Dense_Row.templates.hh \
-CO_Tree.defs.hh \
-CO_Tree.inlines.hh \
-CO_Tree.templates.hh \
-Sparse_Row.defs.hh \
-Sparse_Row.inlines.hh \
-Sparse_Row.templates.hh \
-Bit_Row.defs.hh \
-Bit_Row.inlines.hh \
-Linear_System.defs.hh \
-Linear_System.inlines.hh \
-Linear_System.templates.hh \
-Bit_Matrix.defs.hh \
-Bit_Matrix.inlines.hh \
-Constraint_System.defs.hh \
-Generator_System.defs.hh \
-Grid_Generator_System.defs.hh \
-Congruence_System.defs.hh \
-Linear_Expression.defs.hh \
-Linear_Expression.inlines.hh \
-Expression_Hide_Last.defs.hh \
-Expression_Hide_Last.inlines.hh \
-Expression_Hide_Inhomo.defs.hh \
-Expression_Hide_Inhomo.inlines.hh \
-Linear_Expression_Impl.defs.hh \
-Linear_Expression_Impl.inlines.hh \
-Linear_Expression_Impl.templates.hh \
-Linear_Expression_Interface.defs.hh \
-Linear_Form.defs.hh \
-Linear_Form.inlines.hh \
-Linear_Form.templates.hh \
+Topology_types.hh \
+Dense_Row_defs.hh \
+Dense_Row_inlines.hh \
+Dense_Row_templates.hh \
+CO_Tree_defs.hh \
+CO_Tree_inlines.hh \
+CO_Tree_templates.hh \
+Sparse_Row_defs.hh \
+Sparse_Row_inlines.hh \
+Sparse_Row_templates.hh \
+Bit_Row_defs.hh \
+Bit_Row_inlines.hh \
+Linear_System_defs.hh \
+Linear_System_inlines.hh \
+Linear_System_templates.hh \
+Bit_Matrix_defs.hh \
+Bit_Matrix_inlines.hh \
+Constraint_System_defs.hh \
+Generator_System_defs.hh \
+Grid_Generator_System_defs.hh \
+Congruence_System_defs.hh \
+Linear_Expression_defs.hh \
+Linear_Expression_inlines.hh \
+Expression_Adapter_defs.hh \
+Expression_Adapter_inlines.hh \
+Expression_Hide_Last_defs.hh \
+Expression_Hide_Last_inlines.hh \
+Expression_Hide_Inhomo_defs.hh \
+Expression_Hide_Inhomo_inlines.hh \
+Linear_Expression_Impl_defs.hh \
+Linear_Expression_Impl_inlines.hh \
+Linear_Expression_Impl_templates.hh \
+Linear_Expression_Interface_defs.hh \
+Linear_Form_defs.hh \
+Linear_Form_inlines.hh \
+Linear_Form_templates.hh \
 linearize.hh \
-Constraint.defs.hh \
-Constraint.inlines.hh \
-Constraint_System.inlines.hh \
-Generator.defs.hh \
-Generator.inlines.hh \
-Grid_Generator.defs.hh \
-Grid_Generator.inlines.hh \
-Congruence.defs.hh \
-Congruence.inlines.hh \
-Generator_System.inlines.hh \
-Grid_Generator_System.inlines.hh \
-Congruence_System.inlines.hh \
-Scalar_Products.defs.hh \
-Scalar_Products.inlines.hh \
-Matrix.defs.hh \
-Matrix.inlines.hh \
-Matrix.templates.hh \
-Swapping_Vector.defs.hh \
-Swapping_Vector.inlines.hh \
-MIP_Problem.types.hh \
-MIP_Problem.defs.hh \
-MIP_Problem.inlines.hh \
-MIP_Problem.templates.hh \
-PIP_Tree.types.hh \
-PIP_Tree.defs.hh \
-PIP_Tree.inlines.hh \
-PIP_Problem.types.hh \
-PIP_Problem.defs.hh \
-PIP_Problem.inlines.hh \
-PIP_Problem.templates.hh \
-Poly_Con_Relation.defs.hh \
-Poly_Con_Relation.inlines.hh \
-Poly_Gen_Relation.defs.hh \
-Poly_Gen_Relation.inlines.hh \
-BHRZ03_Certificate.defs.hh \
-BHRZ03_Certificate.inlines.hh \
-H79_Certificate.defs.hh \
-H79_Certificate.inlines.hh \
-Grid_Certificate.defs.hh \
-Grid_Certificate.inlines.hh \
-Partial_Function.defs.hh \
-Partial_Function.inlines.hh \
-Polyhedron.defs.hh \
-Ph_Status.inlines.hh \
-Polyhedron.inlines.hh \
-Polyhedron_chdims.templates.hh \
-Polyhedron_conversion.templates.hh \
-Polyhedron_minimize.templates.hh \
-Polyhedron_simplify.templates.hh \
-Polyhedron.templates.hh \
-Grid.defs.hh \
-Grid_Status.inlines.hh \
-Grid.inlines.hh \
-Grid.templates.hh \
-C_Polyhedron.defs.hh \
-C_Polyhedron.inlines.hh \
-NNC_Polyhedron.defs.hh \
-NNC_Polyhedron.inlines.hh \
-Widening_Function.types.hh \
-Widening_Function.defs.hh \
-Widening_Function.inlines.hh \
-Ptr_Iterator.defs.hh \
-Ptr_Iterator.inlines.hh \
-DB_Row.defs.hh \
-DB_Row.inlines.hh \
-DB_Row.templates.hh \
-DB_Matrix.defs.hh \
-DB_Matrix.inlines.hh \
-DB_Matrix.templates.hh \
-BD_Shape.defs.hh \
-BDS_Status.inlines.hh \
-BD_Shape.inlines.hh \
-BD_Shape.templates.hh \
-OR_Matrix.defs.hh \
-OR_Matrix.inlines.hh \
-OR_Matrix.templates.hh \
-Octagonal_Shape.defs.hh \
-Og_Status.inlines.hh \
-Octagonal_Shape.inlines.hh \
-Octagonal_Shape.templates.hh \
-Determinate.types.hh \
-Determinate.defs.hh \
-Determinate.inlines.hh \
-Powerset.types.hh \
-Powerset.defs.hh \
-Powerset.inlines.hh \
-Powerset.templates.hh \
-Pointset_Powerset.types.hh \
-Pointset_Powerset.defs.hh \
-Pointset_Powerset.inlines.hh \
-Pointset_Powerset.templates.hh \
-Partially_Reduced_Product.types.hh \
-Partially_Reduced_Product.defs.hh \
-Partially_Reduced_Product.inlines.hh \
-Partially_Reduced_Product.templates.hh \
-Weight_Profiler.defs.hh \
+Constraint_defs.hh \
+Constraint_inlines.hh \
+Constraint_System_inlines.hh \
+Generator_defs.hh \
+Generator_inlines.hh \
+Grid_Generator_defs.hh \
+Grid_Generator_inlines.hh \
+Congruence_defs.hh \
+Congruence_inlines.hh \
+Generator_System_inlines.hh \
+Grid_Generator_System_inlines.hh \
+Congruence_System_inlines.hh \
+Scalar_Products_defs.hh \
+Scalar_Products_inlines.hh \
+Matrix_defs.hh \
+Matrix_inlines.hh \
+Matrix_templates.hh \
+Swapping_Vector_defs.hh \
+Swapping_Vector_inlines.hh \
+MIP_Problem_types.hh \
+MIP_Problem_defs.hh \
+MIP_Problem_inlines.hh \
+MIP_Problem_templates.hh \
+PIP_Tree_types.hh \
+PIP_Tree_defs.hh \
+PIP_Tree_inlines.hh \
+PIP_Problem_types.hh \
+PIP_Problem_defs.hh \
+PIP_Problem_inlines.hh \
+PIP_Problem_templates.hh \
+Poly_Con_Relation_defs.hh \
+Poly_Con_Relation_inlines.hh \
+Poly_Gen_Relation_defs.hh \
+Poly_Gen_Relation_inlines.hh \
+BHRZ03_Certificate_defs.hh \
+BHRZ03_Certificate_inlines.hh \
+H79_Certificate_defs.hh \
+H79_Certificate_inlines.hh \
+Grid_Certificate_defs.hh \
+Grid_Certificate_inlines.hh \
+Partial_Function_defs.hh \
+Partial_Function_inlines.hh \
+Polyhedron_defs.hh \
+Ph_Status_inlines.hh \
+Polyhedron_inlines.hh \
+Polyhedron_chdims_templates.hh \
+Polyhedron_conversion_templates.hh \
+Polyhedron_minimize_templates.hh \
+Polyhedron_simplify_templates.hh \
+Polyhedron_templates.hh \
+Grid_defs.hh \
+Grid_Status_inlines.hh \
+Grid_inlines.hh \
+Grid_templates.hh \
+C_Polyhedron_defs.hh \
+C_Polyhedron_inlines.hh \
+NNC_Polyhedron_defs.hh \
+NNC_Polyhedron_inlines.hh \
+Widening_Function_types.hh \
+Widening_Function_defs.hh \
+Widening_Function_inlines.hh \
+Ptr_Iterator_defs.hh \
+Ptr_Iterator_inlines.hh \
+DB_Row_defs.hh \
+DB_Row_inlines.hh \
+DB_Row_templates.hh \
+DB_Matrix_defs.hh \
+DB_Matrix_inlines.hh \
+DB_Matrix_templates.hh \
+BD_Shape_defs.hh \
+BDS_Status_inlines.hh \
+BD_Shape_inlines.hh \
+BD_Shape_templates.hh \
+OR_Matrix_defs.hh \
+OR_Matrix_inlines.hh \
+OR_Matrix_templates.hh \
+Octagonal_Shape_defs.hh \
+Og_Status_inlines.hh \
+Octagonal_Shape_inlines.hh \
+Octagonal_Shape_templates.hh \
+Determinate_types.hh \
+Determinate_defs.hh \
+Determinate_inlines.hh \
+Powerset_types.hh \
+Powerset_defs.hh \
+Powerset_inlines.hh \
+Powerset_templates.hh \
+Pointset_Powerset_types.hh \
+Pointset_Powerset_defs.hh \
+Pointset_Powerset_inlines.hh \
+Pointset_Powerset_templates.hh \
+Partially_Reduced_Product_types.hh \
+Partially_Reduced_Product_defs.hh \
+Partially_Reduced_Product_inlines.hh \
+Partially_Reduced_Product_templates.hh \
+Weight_Profiler_defs.hh \
 max_space_dimension.hh \
 algorithms.hh \
-termination.defs.hh \
-termination.templates.hh \
+termination_defs.hh \
+termination_templates.hh \
 wrap_assign.hh \
 wrap_string.hh \
-Floating_Point_Expression.types.hh \
-Floating_Point_Expression.defs.hh \
-Floating_Point_Expression.inlines.hh \
-Floating_Point_Expression.templates.hh \
-Cast_Floating_Point_Expression.types.hh \
-Cast_Floating_Point_Expression.defs.hh \
-Cast_Floating_Point_Expression.inlines.hh \
-Cast_Floating_Point_Expression.templates.hh \
-Constant_Floating_Point_Expression.types.hh \
-Constant_Floating_Point_Expression.defs.hh \
-Constant_Floating_Point_Expression.inlines.hh \
-Variable_Floating_Point_Expression.types.hh \
-Variable_Floating_Point_Expression.defs.hh \
-Variable_Floating_Point_Expression.inlines.hh \
-Sum_Floating_Point_Expression.types.hh \
-Sum_Floating_Point_Expression.defs.hh \
-Sum_Floating_Point_Expression.inlines.hh \
-Sum_Floating_Point_Expression.templates.hh \
-Difference_Floating_Point_Expression.types.hh \
-Difference_Floating_Point_Expression.defs.hh \
-Difference_Floating_Point_Expression.inlines.hh \
-Difference_Floating_Point_Expression.templates.hh \
-Multiplication_Floating_Point_Expression.types.hh \
-Multiplication_Floating_Point_Expression.defs.hh \
-Multiplication_Floating_Point_Expression.inlines.hh \
-Multiplication_Floating_Point_Expression.templates.hh \
-Division_Floating_Point_Expression.types.hh \
-Division_Floating_Point_Expression.defs.hh \
-Division_Floating_Point_Expression.inlines.hh \
-Division_Floating_Point_Expression.templates.hh \
-Opposite_Floating_Point_Expression.types.hh \
-Opposite_Floating_Point_Expression.defs.hh \
-Opposite_Floating_Point_Expression.inlines.hh \
-Doubly_Linked_Object.types.hh \
-EList.types.hh \
-EList_Iterator.types.hh \
-Handler.types.hh \
-Pending_Element.types.hh \
-Pending_List.types.hh \
-Time.types.hh \
-Watchdog.types.hh \
-Threshold_Watcher.types.hh \
-Handler.defs.hh \
-Handler.inlines.hh \
-Time.defs.hh \
-Time.inlines.hh \
-Doubly_Linked_Object.defs.hh \
-Doubly_Linked_Object.inlines.hh \
-EList_Iterator.defs.hh \
-EList_Iterator.inlines.hh \
-EList.defs.hh \
-EList.inlines.hh \
-Pending_Element.defs.hh \
-Pending_Element.inlines.hh \
-Pending_List.defs.hh \
-Pending_List.inlines.hh \
-Pending_List.templates.hh \
-Watchdog.defs.hh \
-Watchdog.inlines.hh \
-Threshold_Watcher.defs.hh \
-Threshold_Watcher.inlines.hh \
-Threshold_Watcher.templates.hh
-#Any_Pointset.types.hh \
-#Any_Pointset.defs.hh \
-#Any_Pointset.inlines.hh \
-#Ask_Tell.types.hh \
-#Ask_Tell.defs.hh \
-#Ask_Tell.inlines.hh \
-#Ask_Tell.templates.hh \
-#Pointset_Ask_Tell.types.hh \
-#Pointset_Ask_Tell.defs.hh \
-#Pointset_Ask_Tell.inlines.hh \
-#Pointset_Ask_Tell.templates.hh
+Floating_Point_Expression_types.hh \
+Floating_Point_Expression_defs.hh \
+Floating_Point_Expression_inlines.hh \
+Floating_Point_Expression_templates.hh \
+Cast_Floating_Point_Expression_types.hh \
+Cast_Floating_Point_Expression_defs.hh \
+Cast_Floating_Point_Expression_inlines.hh \
+Cast_Floating_Point_Expression_templates.hh \
+Constant_Floating_Point_Expression_types.hh \
+Constant_Floating_Point_Expression_defs.hh \
+Constant_Floating_Point_Expression_inlines.hh \
+Variable_Floating_Point_Expression_types.hh \
+Variable_Floating_Point_Expression_defs.hh \
+Variable_Floating_Point_Expression_inlines.hh \
+Sum_Floating_Point_Expression_types.hh \
+Sum_Floating_Point_Expression_defs.hh \
+Sum_Floating_Point_Expression_inlines.hh \
+Sum_Floating_Point_Expression_templates.hh \
+Difference_Floating_Point_Expression_types.hh \
+Difference_Floating_Point_Expression_defs.hh \
+Difference_Floating_Point_Expression_inlines.hh \
+Difference_Floating_Point_Expression_templates.hh \
+Multiplication_Floating_Point_Expression_types.hh \
+Multiplication_Floating_Point_Expression_defs.hh \
+Multiplication_Floating_Point_Expression_inlines.hh \
+Multiplication_Floating_Point_Expression_templates.hh \
+Division_Floating_Point_Expression_types.hh \
+Division_Floating_Point_Expression_defs.hh \
+Division_Floating_Point_Expression_inlines.hh \
+Division_Floating_Point_Expression_templates.hh \
+Opposite_Floating_Point_Expression_types.hh \
+Opposite_Floating_Point_Expression_defs.hh \
+Opposite_Floating_Point_Expression_inlines.hh \
+Doubly_Linked_Object_types.hh \
+EList_types.hh \
+EList_Iterator_types.hh \
+Handler_types.hh \
+Pending_Element_types.hh \
+Pending_List_types.hh \
+Time_types.hh \
+Watchdog_types.hh \
+Threshold_Watcher_types.hh \
+Handler_defs.hh \
+Handler_inlines.hh \
+Time_defs.hh \
+Time_inlines.hh \
+Doubly_Linked_Object_defs.hh \
+Doubly_Linked_Object_inlines.hh \
+EList_Iterator_defs.hh \
+EList_Iterator_inlines.hh \
+EList_defs.hh \
+EList_inlines.hh \
+Pending_Element_defs.hh \
+Pending_Element_inlines.hh \
+Pending_List_defs.hh \
+Pending_List_inlines.hh \
+Pending_List_templates.hh \
+Watchdog_defs.hh \
+Watchdog_inlines.hh \
+Threshold_Watcher_defs.hh \
+Threshold_Watcher_inlines.hh \
+Threshold_Watcher_templates.hh
+#Any_Pointset_types.hh \
+#Any_Pointset_defs.hh \
+#Any_Pointset_inlines.hh \
+#Ask_Tell_types.hh \
+#Ask_Tell_defs.hh \
+#Ask_Tell_inlines.hh \
+#Ask_Tell_templates.hh \
+#Pointset_Ask_Tell_types.hh \
+#Pointset_Ask_Tell_defs.hh \
+#Pointset_Ask_Tell_inlines.hh \
+#Pointset_Ask_Tell_templates.hh
 
 NESTED_INCLUDE_FILES = \
-Ph_Status.idefs.hh \
-Grid_Status.idefs.hh \
-Box_Status.idefs.hh \
-BDS_Status.idefs.hh \
-Og_Status.idefs.hh
+Ph_Status_idefs.hh \
+Grid_Status_idefs.hh \
+Box_Status_idefs.hh \
+BDS_Status_idefs.hh \
+Og_Status_idefs.hh
 
 libppl_la_SOURCES = \
 assert.cc \
@@ -536,7 +540,7 @@ Weight_Profiler.cc \
 version.cc \
 $(INCLUDE_FILES) \
 $(NESTED_INCLUDE_FILES) \
-swapping_sort.templates.hh \
+swapping_sort_templates.hh \
 termination.cc \
 wrap_string.cc \
 Time.cc \
@@ -628,28 +632,28 @@ ppl.hh.sed: Makefile
 	@echo "}"                                     >>$@
 
 ppl.hh:	ppl.hh.dist ppl.hh.sed
-	$(SED) -f ppl.hh.sed $< >$@
+	$(SED) -f ppl.hh.sed ppl.hh.dist >$@
 	rm -f ppl.hh.sed
 
 BUGS.hh:	BUGS.hh.dist
-	cp -f $< $@
+	cp -f BUGS.hh.dist $@
 BUGS.cc:	BUGS.cc.dist
-	cp -f $< $@
+	cp -f BUGS.cc.dist $@
 COPYING.hh:	COPYING.hh.dist
-	cp -f $< $@
+	cp -f COPYING.hh.dist $@
 COPYING.cc:	COPYING.cc.dist
-	cp -f $< $@
+	cp -f COPYING.cc.dist $@
 CREDITS.hh:	CREDITS.hh.dist
-	cp -f $< $@
+	cp -f CREDITS.hh.dist $@
 CREDITS.cc:	CREDITS.cc.dist
-	cp -f $< $@
+	cp -f CREDITS.cc.dist $@
 
 endif !HAVE_PERL
 
 if USE_PRECOMPILED_HEADERS
 
 ppl.hh.gch: ppl.hh
-	$(CXXCOMPILE) -xc++-header -o $@ $<
+	$(CXXCOMPILE) -xc++-header -o $@ ppl.hh
 
 PRECOMPILED = ppl.hh.gch
 
diff --git a/src/Makefile.in b/src/Makefile.in
index 4882274..c9e1194 100644
--- a/src/Makefile.in
+++ b/src/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -76,10 +75,28 @@
 #	    0.12		   10:0:0
 #	    0.12.1		   11:0:0
 #	    1.0			   12:0:0
+#	    1.1			   13:0:0
 
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -102,7 +119,8 @@ bin_PROGRAMS = ppl-config$(EXEEXT)
 subdir = src
 DIST_COMMON = $(am__include_HEADERS_DIST) $(am__noinst_HEADERS_DIST) \
 	$(srcdir)/Makefile.am $(srcdir)/Makefile.in \
-	$(srcdir)/ppl-config.cc.in $(srcdir)/version.hh.in
+	$(srcdir)/ppl-config.cc.in $(srcdir)/version.hh.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -187,171 +205,173 @@ am__libppl_la_SOURCES_DIST = assert.cc Box.cc checked.cc \
 	Grid_simplify.cc stdiobuf.cc c_streambuf.cc globals.cc \
 	mp_std_bits.cc Weight_Profiler.cc version.cc namespaces.hh \
 	compiler.hh assert.hh meta_programming.hh Slow_Copy.hh \
-	Has_Assign_Or_Swap.hh assign_or_swap.hh mp_std_bits.defs.hh \
-	mp_std_bits.inlines.hh Concrete_Expression.types.hh \
-	Concrete_Expression.defs.hh Concrete_Expression.inlines.hh \
-	Temp.defs.hh Temp.inlines.hh Temp.templates.hh \
-	Coefficient_traits_template.hh Checked_Number.types.hh \
-	termination.types.hh GMP_Integer.types.hh Coefficient.types.hh \
-	stdiobuf.types.hh c_streambuf.types.hh globals.types.hh \
-	iterator_to_const.types.hh distances.types.hh \
-	Interval_Info.types.hh Interval.types.hh Box.types.hh \
-	Constraint.types.hh Generator.types.hh Grid_Generator.types.hh \
-	Congruence.types.hh Init.types.hh Dense_Row.types.hh \
-	CO_Tree.types.hh Sparse_Row.types.hh Matrix.types.hh \
-	Swapping_Vector.types.hh Variable.types.hh \
-	Variables_Set.types.hh Linear_Expression.types.hh \
-	Expression_Hide_Last.types.hh Expression_Hide_Inhomo.types.hh \
-	Linear_Expression_Impl.types.hh \
-	Linear_Expression_Interface.types.hh Linear_System.types.hh \
-	Linear_Form.types.hh Bit_Row.types.hh Bit_Matrix.types.hh \
-	Constraint_System.types.hh Generator_System.types.hh \
-	Grid_Generator_System.types.hh Congruence_System.types.hh \
-	Scalar_Products.types.hh PIP_Tree.types.hh \
-	PIP_Problem.types.hh Poly_Con_Relation.types.hh \
-	Poly_Gen_Relation.types.hh BHRZ03_Certificate.types.hh \
-	H79_Certificate.types.hh Grid_Certificate.types.hh \
-	Partial_Function.types.hh Polyhedron.types.hh \
-	C_Polyhedron.types.hh NNC_Polyhedron.types.hh Grid.types.hh \
-	Ptr_Iterator.types.hh DB_Row.types.hh DB_Matrix.types.hh \
-	BD_Shape.types.hh OR_Matrix.types.hh Octagonal_Shape.types.hh \
-	fpu.types.hh Float.defs.hh Float.inlines.hh Float.templates.hh \
-	C_Integer.hh fpu.defs.hh fpu-c99.inlines.hh \
-	fpu-ia32.inlines.hh fpu-none.inlines.hh fpu-sparc.inlines.hh \
-	Rounding_Dir.defs.hh Rounding_Dir.inlines.hh Result.defs.hh \
-	Result.inlines.hh Numeric_Format.defs.hh checked.defs.hh \
-	checked.inlines.hh checked_int.inlines.hh \
-	checked_float.inlines.hh checked_mpz.inlines.hh \
-	checked_mpq.inlines.hh checked_ext.inlines.hh \
-	Checked_Number.defs.hh Checked_Number.inlines.hh \
-	Checked_Number.templates.hh WRD_coefficient_types.defs.hh \
-	WRD_coefficient_types.inlines.hh checked_numeric_limits.hh \
-	GMP_Integer.defs.hh GMP_Integer.inlines.hh Coefficient.defs.hh \
-	Coefficient.inlines.hh stdiobuf.defs.hh stdiobuf.inlines.hh \
-	c_streambuf.defs.hh c_streambuf.inlines.hh globals.defs.hh \
-	globals.inlines.hh math_utilities.defs.hh \
-	math_utilities.inlines.hh iterator_to_const.defs.hh \
-	iterator_to_const.inlines.hh distances.defs.hh \
-	distances.inlines.hh Boundary.defs.hh intervals.defs.hh \
-	Interval_Info.defs.hh Interval_Info.inlines.hh \
-	Interval.defs.hh Interval.inlines.hh Interval.templates.hh \
-	Box.defs.hh Box_Status.inlines.hh Box.inlines.hh \
-	Box.templates.hh Integer_Interval.hh Rational_Interval.hh \
-	Rational_Box.hh Variable.defs.hh Variable.inlines.hh \
-	Variables_Set.defs.hh Variables_Set.inlines.hh Init.defs.hh \
-	Init.inlines.hh initializer.hh Topology.types.hh \
-	Dense_Row.defs.hh Dense_Row.inlines.hh Dense_Row.templates.hh \
-	CO_Tree.defs.hh CO_Tree.inlines.hh CO_Tree.templates.hh \
-	Sparse_Row.defs.hh Sparse_Row.inlines.hh \
-	Sparse_Row.templates.hh Bit_Row.defs.hh Bit_Row.inlines.hh \
-	Linear_System.defs.hh Linear_System.inlines.hh \
-	Linear_System.templates.hh Bit_Matrix.defs.hh \
-	Bit_Matrix.inlines.hh Constraint_System.defs.hh \
-	Generator_System.defs.hh Grid_Generator_System.defs.hh \
-	Congruence_System.defs.hh Linear_Expression.defs.hh \
-	Linear_Expression.inlines.hh Expression_Hide_Last.defs.hh \
-	Expression_Hide_Last.inlines.hh Expression_Hide_Inhomo.defs.hh \
-	Expression_Hide_Inhomo.inlines.hh \
-	Linear_Expression_Impl.defs.hh \
-	Linear_Expression_Impl.inlines.hh \
-	Linear_Expression_Impl.templates.hh \
-	Linear_Expression_Interface.defs.hh Linear_Form.defs.hh \
-	Linear_Form.inlines.hh Linear_Form.templates.hh linearize.hh \
-	Constraint.defs.hh Constraint.inlines.hh \
-	Constraint_System.inlines.hh Generator.defs.hh \
-	Generator.inlines.hh Grid_Generator.defs.hh \
-	Grid_Generator.inlines.hh Congruence.defs.hh \
-	Congruence.inlines.hh Generator_System.inlines.hh \
-	Grid_Generator_System.inlines.hh Congruence_System.inlines.hh \
-	Scalar_Products.defs.hh Scalar_Products.inlines.hh \
-	Matrix.defs.hh Matrix.inlines.hh Matrix.templates.hh \
-	Swapping_Vector.defs.hh Swapping_Vector.inlines.hh \
-	MIP_Problem.types.hh MIP_Problem.defs.hh \
-	MIP_Problem.inlines.hh MIP_Problem.templates.hh \
-	PIP_Tree.defs.hh PIP_Tree.inlines.hh PIP_Problem.defs.hh \
-	PIP_Problem.inlines.hh PIP_Problem.templates.hh \
-	Poly_Con_Relation.defs.hh Poly_Con_Relation.inlines.hh \
-	Poly_Gen_Relation.defs.hh Poly_Gen_Relation.inlines.hh \
-	BHRZ03_Certificate.defs.hh BHRZ03_Certificate.inlines.hh \
-	H79_Certificate.defs.hh H79_Certificate.inlines.hh \
-	Grid_Certificate.defs.hh Grid_Certificate.inlines.hh \
-	Partial_Function.defs.hh Partial_Function.inlines.hh \
-	Polyhedron.defs.hh Ph_Status.inlines.hh Polyhedron.inlines.hh \
-	Polyhedron_chdims.templates.hh \
-	Polyhedron_conversion.templates.hh \
-	Polyhedron_minimize.templates.hh \
-	Polyhedron_simplify.templates.hh Polyhedron.templates.hh \
-	Grid.defs.hh Grid_Status.inlines.hh Grid.inlines.hh \
-	Grid.templates.hh C_Polyhedron.defs.hh C_Polyhedron.inlines.hh \
-	NNC_Polyhedron.defs.hh NNC_Polyhedron.inlines.hh \
-	Widening_Function.types.hh Widening_Function.defs.hh \
-	Widening_Function.inlines.hh Ptr_Iterator.defs.hh \
-	Ptr_Iterator.inlines.hh DB_Row.defs.hh DB_Row.inlines.hh \
-	DB_Row.templates.hh DB_Matrix.defs.hh DB_Matrix.inlines.hh \
-	DB_Matrix.templates.hh BD_Shape.defs.hh BDS_Status.inlines.hh \
-	BD_Shape.inlines.hh BD_Shape.templates.hh OR_Matrix.defs.hh \
-	OR_Matrix.inlines.hh OR_Matrix.templates.hh \
-	Octagonal_Shape.defs.hh Og_Status.inlines.hh \
-	Octagonal_Shape.inlines.hh Octagonal_Shape.templates.hh \
-	Determinate.types.hh Determinate.defs.hh \
-	Determinate.inlines.hh Powerset.types.hh Powerset.defs.hh \
-	Powerset.inlines.hh Powerset.templates.hh \
-	Pointset_Powerset.types.hh Pointset_Powerset.defs.hh \
-	Pointset_Powerset.inlines.hh Pointset_Powerset.templates.hh \
-	Partially_Reduced_Product.types.hh \
-	Partially_Reduced_Product.defs.hh \
-	Partially_Reduced_Product.inlines.hh \
-	Partially_Reduced_Product.templates.hh Weight_Profiler.defs.hh \
-	max_space_dimension.hh algorithms.hh termination.defs.hh \
-	termination.templates.hh wrap_assign.hh wrap_string.hh \
-	Floating_Point_Expression.types.hh \
-	Floating_Point_Expression.defs.hh \
-	Floating_Point_Expression.inlines.hh \
-	Floating_Point_Expression.templates.hh \
-	Cast_Floating_Point_Expression.types.hh \
-	Cast_Floating_Point_Expression.defs.hh \
-	Cast_Floating_Point_Expression.inlines.hh \
-	Cast_Floating_Point_Expression.templates.hh \
-	Constant_Floating_Point_Expression.types.hh \
-	Constant_Floating_Point_Expression.defs.hh \
-	Constant_Floating_Point_Expression.inlines.hh \
-	Variable_Floating_Point_Expression.types.hh \
-	Variable_Floating_Point_Expression.defs.hh \
-	Variable_Floating_Point_Expression.inlines.hh \
-	Sum_Floating_Point_Expression.types.hh \
-	Sum_Floating_Point_Expression.defs.hh \
-	Sum_Floating_Point_Expression.inlines.hh \
-	Sum_Floating_Point_Expression.templates.hh \
-	Difference_Floating_Point_Expression.types.hh \
-	Difference_Floating_Point_Expression.defs.hh \
-	Difference_Floating_Point_Expression.inlines.hh \
-	Difference_Floating_Point_Expression.templates.hh \
-	Multiplication_Floating_Point_Expression.types.hh \
-	Multiplication_Floating_Point_Expression.defs.hh \
-	Multiplication_Floating_Point_Expression.inlines.hh \
-	Multiplication_Floating_Point_Expression.templates.hh \
-	Division_Floating_Point_Expression.types.hh \
-	Division_Floating_Point_Expression.defs.hh \
-	Division_Floating_Point_Expression.inlines.hh \
-	Division_Floating_Point_Expression.templates.hh \
-	Opposite_Floating_Point_Expression.types.hh \
-	Opposite_Floating_Point_Expression.defs.hh \
-	Opposite_Floating_Point_Expression.inlines.hh \
-	Doubly_Linked_Object.types.hh EList.types.hh \
-	EList_Iterator.types.hh Handler.types.hh \
-	Pending_Element.types.hh Pending_List.types.hh Time.types.hh \
-	Watchdog.types.hh Threshold_Watcher.types.hh Handler.defs.hh \
-	Handler.inlines.hh Time.defs.hh Time.inlines.hh \
-	Doubly_Linked_Object.defs.hh Doubly_Linked_Object.inlines.hh \
-	EList_Iterator.defs.hh EList_Iterator.inlines.hh EList.defs.hh \
-	EList.inlines.hh Pending_Element.defs.hh \
-	Pending_Element.inlines.hh Pending_List.defs.hh \
-	Pending_List.inlines.hh Pending_List.templates.hh \
-	Watchdog.defs.hh Watchdog.inlines.hh Threshold_Watcher.defs.hh \
-	Threshold_Watcher.inlines.hh Threshold_Watcher.templates.hh \
-	Ph_Status.idefs.hh Grid_Status.idefs.hh Box_Status.idefs.hh \
-	BDS_Status.idefs.hh Og_Status.idefs.hh \
-	swapping_sort.templates.hh termination.cc wrap_string.cc \
+	Has_Assign_Or_Swap.hh assign_or_swap.hh mp_std_bits_defs.hh \
+	mp_std_bits_inlines.hh Concrete_Expression_types.hh \
+	Concrete_Expression_defs.hh Concrete_Expression_inlines.hh \
+	Temp_defs.hh Temp_inlines.hh Temp_templates.hh \
+	Coefficient_traits_template.hh Checked_Number_types.hh \
+	termination_types.hh GMP_Integer_types.hh Coefficient_types.hh \
+	stdiobuf_types.hh c_streambuf_types.hh globals_types.hh \
+	iterator_to_const_types.hh distances_types.hh \
+	Interval_Info_types.hh Interval_types.hh Box_types.hh \
+	Constraint_types.hh Generator_types.hh Grid_Generator_types.hh \
+	Congruence_types.hh Init_types.hh Dense_Row_types.hh \
+	CO_Tree_types.hh Sparse_Row_types.hh Matrix_types.hh \
+	Swapping_Vector_types.hh Variable_types.hh \
+	Variables_Set_types.hh Linear_Expression_types.hh \
+	Expression_Adapter_types.hh Expression_Hide_Last_types.hh \
+	Expression_Hide_Inhomo_types.hh \
+	Linear_Expression_Impl_types.hh \
+	Linear_Expression_Interface_types.hh Linear_System_types.hh \
+	Linear_Form_types.hh Bit_Row_types.hh Bit_Matrix_types.hh \
+	Constraint_System_types.hh Generator_System_types.hh \
+	Grid_Generator_System_types.hh Congruence_System_types.hh \
+	Scalar_Products_types.hh PIP_Tree_types.hh \
+	PIP_Problem_types.hh Poly_Con_Relation_types.hh \
+	Poly_Gen_Relation_types.hh BHRZ03_Certificate_types.hh \
+	H79_Certificate_types.hh Grid_Certificate_types.hh \
+	Partial_Function_types.hh Polyhedron_types.hh \
+	C_Polyhedron_types.hh NNC_Polyhedron_types.hh Grid_types.hh \
+	Ptr_Iterator_types.hh DB_Row_types.hh DB_Matrix_types.hh \
+	BD_Shape_types.hh OR_Matrix_types.hh Octagonal_Shape_types.hh \
+	fpu_types.hh Float_defs.hh Float_inlines.hh Float_templates.hh \
+	C_Integer.hh fpu_defs.hh fpu-c99_inlines.hh \
+	fpu-ia32_inlines.hh fpu-none_inlines.hh fpu-sparc_inlines.hh \
+	Rounding_Dir_defs.hh Rounding_Dir_inlines.hh Result_defs.hh \
+	Result_inlines.hh Numeric_Format_defs.hh checked_defs.hh \
+	checked_inlines.hh checked_int_inlines.hh \
+	checked_float_inlines.hh checked_mpz_inlines.hh \
+	checked_mpq_inlines.hh checked_ext_inlines.hh \
+	Checked_Number_defs.hh Checked_Number_inlines.hh \
+	Checked_Number_templates.hh WRD_coefficient_types_defs.hh \
+	WRD_coefficient_types_inlines.hh checked_numeric_limits.hh \
+	GMP_Integer_defs.hh GMP_Integer_inlines.hh Coefficient_defs.hh \
+	Coefficient_inlines.hh stdiobuf_defs.hh stdiobuf_inlines.hh \
+	c_streambuf_defs.hh c_streambuf_inlines.hh globals_defs.hh \
+	globals_inlines.hh math_utilities_defs.hh \
+	math_utilities_inlines.hh iterator_to_const_defs.hh \
+	iterator_to_const_inlines.hh distances_defs.hh \
+	distances_inlines.hh Boundary_defs.hh intervals_defs.hh \
+	Interval_Info_defs.hh Interval_Info_inlines.hh \
+	Interval_defs.hh Interval_inlines.hh Interval_templates.hh \
+	Box_defs.hh Box_Status_inlines.hh Box_inlines.hh \
+	Box_templates.hh Integer_Interval.hh Rational_Interval.hh \
+	Rational_Box.hh Variable_defs.hh Variable_inlines.hh \
+	Variables_Set_defs.hh Variables_Set_inlines.hh Init_defs.hh \
+	Init_inlines.hh initializer.hh Topology_types.hh \
+	Dense_Row_defs.hh Dense_Row_inlines.hh Dense_Row_templates.hh \
+	CO_Tree_defs.hh CO_Tree_inlines.hh CO_Tree_templates.hh \
+	Sparse_Row_defs.hh Sparse_Row_inlines.hh \
+	Sparse_Row_templates.hh Bit_Row_defs.hh Bit_Row_inlines.hh \
+	Linear_System_defs.hh Linear_System_inlines.hh \
+	Linear_System_templates.hh Bit_Matrix_defs.hh \
+	Bit_Matrix_inlines.hh Constraint_System_defs.hh \
+	Generator_System_defs.hh Grid_Generator_System_defs.hh \
+	Congruence_System_defs.hh Linear_Expression_defs.hh \
+	Linear_Expression_inlines.hh Expression_Adapter_defs.hh \
+	Expression_Adapter_inlines.hh Expression_Hide_Last_defs.hh \
+	Expression_Hide_Last_inlines.hh Expression_Hide_Inhomo_defs.hh \
+	Expression_Hide_Inhomo_inlines.hh \
+	Linear_Expression_Impl_defs.hh \
+	Linear_Expression_Impl_inlines.hh \
+	Linear_Expression_Impl_templates.hh \
+	Linear_Expression_Interface_defs.hh Linear_Form_defs.hh \
+	Linear_Form_inlines.hh Linear_Form_templates.hh linearize.hh \
+	Constraint_defs.hh Constraint_inlines.hh \
+	Constraint_System_inlines.hh Generator_defs.hh \
+	Generator_inlines.hh Grid_Generator_defs.hh \
+	Grid_Generator_inlines.hh Congruence_defs.hh \
+	Congruence_inlines.hh Generator_System_inlines.hh \
+	Grid_Generator_System_inlines.hh Congruence_System_inlines.hh \
+	Scalar_Products_defs.hh Scalar_Products_inlines.hh \
+	Matrix_defs.hh Matrix_inlines.hh Matrix_templates.hh \
+	Swapping_Vector_defs.hh Swapping_Vector_inlines.hh \
+	MIP_Problem_types.hh MIP_Problem_defs.hh \
+	MIP_Problem_inlines.hh MIP_Problem_templates.hh \
+	PIP_Tree_defs.hh PIP_Tree_inlines.hh PIP_Problem_defs.hh \
+	PIP_Problem_inlines.hh PIP_Problem_templates.hh \
+	Poly_Con_Relation_defs.hh Poly_Con_Relation_inlines.hh \
+	Poly_Gen_Relation_defs.hh Poly_Gen_Relation_inlines.hh \
+	BHRZ03_Certificate_defs.hh BHRZ03_Certificate_inlines.hh \
+	H79_Certificate_defs.hh H79_Certificate_inlines.hh \
+	Grid_Certificate_defs.hh Grid_Certificate_inlines.hh \
+	Partial_Function_defs.hh Partial_Function_inlines.hh \
+	Polyhedron_defs.hh Ph_Status_inlines.hh Polyhedron_inlines.hh \
+	Polyhedron_chdims_templates.hh \
+	Polyhedron_conversion_templates.hh \
+	Polyhedron_minimize_templates.hh \
+	Polyhedron_simplify_templates.hh Polyhedron_templates.hh \
+	Grid_defs.hh Grid_Status_inlines.hh Grid_inlines.hh \
+	Grid_templates.hh C_Polyhedron_defs.hh C_Polyhedron_inlines.hh \
+	NNC_Polyhedron_defs.hh NNC_Polyhedron_inlines.hh \
+	Widening_Function_types.hh Widening_Function_defs.hh \
+	Widening_Function_inlines.hh Ptr_Iterator_defs.hh \
+	Ptr_Iterator_inlines.hh DB_Row_defs.hh DB_Row_inlines.hh \
+	DB_Row_templates.hh DB_Matrix_defs.hh DB_Matrix_inlines.hh \
+	DB_Matrix_templates.hh BD_Shape_defs.hh BDS_Status_inlines.hh \
+	BD_Shape_inlines.hh BD_Shape_templates.hh OR_Matrix_defs.hh \
+	OR_Matrix_inlines.hh OR_Matrix_templates.hh \
+	Octagonal_Shape_defs.hh Og_Status_inlines.hh \
+	Octagonal_Shape_inlines.hh Octagonal_Shape_templates.hh \
+	Determinate_types.hh Determinate_defs.hh \
+	Determinate_inlines.hh Powerset_types.hh Powerset_defs.hh \
+	Powerset_inlines.hh Powerset_templates.hh \
+	Pointset_Powerset_types.hh Pointset_Powerset_defs.hh \
+	Pointset_Powerset_inlines.hh Pointset_Powerset_templates.hh \
+	Partially_Reduced_Product_types.hh \
+	Partially_Reduced_Product_defs.hh \
+	Partially_Reduced_Product_inlines.hh \
+	Partially_Reduced_Product_templates.hh Weight_Profiler_defs.hh \
+	max_space_dimension.hh algorithms.hh termination_defs.hh \
+	termination_templates.hh wrap_assign.hh wrap_string.hh \
+	Floating_Point_Expression_types.hh \
+	Floating_Point_Expression_defs.hh \
+	Floating_Point_Expression_inlines.hh \
+	Floating_Point_Expression_templates.hh \
+	Cast_Floating_Point_Expression_types.hh \
+	Cast_Floating_Point_Expression_defs.hh \
+	Cast_Floating_Point_Expression_inlines.hh \
+	Cast_Floating_Point_Expression_templates.hh \
+	Constant_Floating_Point_Expression_types.hh \
+	Constant_Floating_Point_Expression_defs.hh \
+	Constant_Floating_Point_Expression_inlines.hh \
+	Variable_Floating_Point_Expression_types.hh \
+	Variable_Floating_Point_Expression_defs.hh \
+	Variable_Floating_Point_Expression_inlines.hh \
+	Sum_Floating_Point_Expression_types.hh \
+	Sum_Floating_Point_Expression_defs.hh \
+	Sum_Floating_Point_Expression_inlines.hh \
+	Sum_Floating_Point_Expression_templates.hh \
+	Difference_Floating_Point_Expression_types.hh \
+	Difference_Floating_Point_Expression_defs.hh \
+	Difference_Floating_Point_Expression_inlines.hh \
+	Difference_Floating_Point_Expression_templates.hh \
+	Multiplication_Floating_Point_Expression_types.hh \
+	Multiplication_Floating_Point_Expression_defs.hh \
+	Multiplication_Floating_Point_Expression_inlines.hh \
+	Multiplication_Floating_Point_Expression_templates.hh \
+	Division_Floating_Point_Expression_types.hh \
+	Division_Floating_Point_Expression_defs.hh \
+	Division_Floating_Point_Expression_inlines.hh \
+	Division_Floating_Point_Expression_templates.hh \
+	Opposite_Floating_Point_Expression_types.hh \
+	Opposite_Floating_Point_Expression_defs.hh \
+	Opposite_Floating_Point_Expression_inlines.hh \
+	Doubly_Linked_Object_types.hh EList_types.hh \
+	EList_Iterator_types.hh Handler_types.hh \
+	Pending_Element_types.hh Pending_List_types.hh Time_types.hh \
+	Watchdog_types.hh Threshold_Watcher_types.hh Handler_defs.hh \
+	Handler_inlines.hh Time_defs.hh Time_inlines.hh \
+	Doubly_Linked_Object_defs.hh Doubly_Linked_Object_inlines.hh \
+	EList_Iterator_defs.hh EList_Iterator_inlines.hh EList_defs.hh \
+	EList_inlines.hh Pending_Element_defs.hh \
+	Pending_Element_inlines.hh Pending_List_defs.hh \
+	Pending_List_inlines.hh Pending_List_templates.hh \
+	Watchdog_defs.hh Watchdog_inlines.hh Threshold_Watcher_defs.hh \
+	Threshold_Watcher_inlines.hh Threshold_Watcher_templates.hh \
+	Ph_Status_idefs.hh Grid_Status_idefs.hh Box_Status_idefs.hh \
+	BDS_Status_idefs.hh Og_Status_idefs.hh \
+	swapping_sort_templates.hh termination.cc wrap_string.cc \
 	Time.cc Watchdog.cc Threshold_Watcher.cc
 am__objects_1 =
 am__objects_2 = $(am__objects_1) $(am__objects_1)
@@ -380,6 +400,7 @@ libppl_la_OBJECTS = $(am_libppl_la_OBJECTS)
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 libppl_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(libppl_la_LDFLAGS) $(LDFLAGS) -o $@
@@ -390,6 +411,18 @@ nodist_ppl_config_OBJECTS = ppl-config.$(OBJEXT)
 ppl_config_OBJECTS = $(am_ppl_config_OBJECTS) \
 	$(nodist_ppl_config_OBJECTS)
 ppl_config_DEPENDENCIES = libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -402,17 +435,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -421,20 +453,24 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_la_SOURCES) $(ppl_config_SOURCES) \
 	$(nodist_ppl_config_SOURCES)
 DIST_SOURCES = $(am__libppl_la_SOURCES_DIST) $(ppl_config_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 am__include_HEADERS_DIST = ppl.hh
 am__noinst_HEADERS_DIST = ppl.hh
 HEADERS = $(include_HEADERS) $(nodist_noinst_HEADERS) \
@@ -634,7 +670,7 @@ top_srcdir = @top_srcdir@
 uudecode = @uudecode@
 xsb_prolog = @xsb_prolog@
 yap_prolog = @yap_prolog@
-LIBPPL_LT_CURRENT = 12
+LIBPPL_LT_CURRENT = 13
 LIBPPL_LT_REVISION = 0
 LIBPPL_LT_AGE = 0
 AM_CPPFLAGS = \
@@ -661,13 +697,13 @@ libppl.la
 
 @USE_CHECKED_INTEGERS_TRUE at COEFFICIENT_TYPES_INCLUDE_FILES = 
 @USE_GMP_INTEGERS_TRUE at COEFFICIENT_TYPES_INCLUDE_FILES = \
- at USE_GMP_INTEGERS_TRUE@  GMP_Integer.types.hh
+ at USE_GMP_INTEGERS_TRUE@  GMP_Integer_types.hh
 
 @USE_NATIVE_INTEGERS_TRUE at COEFFICIENT_TYPES_INCLUDE_FILES = 
 @USE_CHECKED_INTEGERS_TRUE at COEFFICIENT_DEFS_INCLUDE_FILES = 
 @USE_GMP_INTEGERS_TRUE at COEFFICIENT_DEFS_INCLUDE_FILES = \
- at USE_GMP_INTEGERS_TRUE@  GMP_Integer.defs.hh \
- at USE_GMP_INTEGERS_TRUE@  GMP_Integer.inlines.hh
+ at USE_GMP_INTEGERS_TRUE@  GMP_Integer_defs.hh \
+ at USE_GMP_INTEGERS_TRUE@  GMP_Integer_inlines.hh
 
 @USE_NATIVE_INTEGERS_TRUE at COEFFICIENT_DEFS_INCLUDE_FILES = 
 
@@ -680,352 +716,355 @@ meta_programming.hh \
 Slow_Copy.hh \
 Has_Assign_Or_Swap.hh \
 assign_or_swap.hh \
-mp_std_bits.defs.hh \
-mp_std_bits.inlines.hh \
-Concrete_Expression.types.hh \
-Concrete_Expression.defs.hh \
-Concrete_Expression.inlines.hh \
-Temp.defs.hh \
-Temp.inlines.hh \
-Temp.templates.hh \
+mp_std_bits_defs.hh \
+mp_std_bits_inlines.hh \
+Concrete_Expression_types.hh \
+Concrete_Expression_defs.hh \
+Concrete_Expression_inlines.hh \
+Temp_defs.hh \
+Temp_inlines.hh \
+Temp_templates.hh \
 Coefficient_traits_template.hh \
-Checked_Number.types.hh \
-termination.types.hh \
+Checked_Number_types.hh \
+termination_types.hh \
 $(COEFFICIENT_TYPES_INCLUDE_FILES) \
-Coefficient.types.hh \
-stdiobuf.types.hh \
-c_streambuf.types.hh \
-globals.types.hh \
-iterator_to_const.types.hh \
-distances.types.hh \
-Interval_Info.types.hh \
-Interval.types.hh \
-Box.types.hh \
-Constraint.types.hh \
-Generator.types.hh \
-Grid_Generator.types.hh \
-Congruence.types.hh \
-Init.types.hh \
-Dense_Row.types.hh \
-CO_Tree.types.hh \
-Sparse_Row.types.hh \
-Matrix.types.hh \
-Swapping_Vector.types.hh \
-Variable.types.hh \
-Variables_Set.types.hh \
-Linear_Expression.types.hh \
-Expression_Hide_Last.types.hh \
-Expression_Hide_Inhomo.types.hh \
-Linear_Expression_Impl.types.hh \
-Linear_Expression_Interface.types.hh \
-Linear_System.types.hh \
-Linear_Form.types.hh \
-Bit_Row.types.hh \
-Bit_Matrix.types.hh \
-Constraint_System.types.hh \
-Generator_System.types.hh \
-Grid_Generator_System.types.hh \
-Congruence_System.types.hh \
-Scalar_Products.types.hh \
-PIP_Tree.types.hh \
-PIP_Problem.types.hh \
-Poly_Con_Relation.types.hh \
-Poly_Gen_Relation.types.hh \
-BHRZ03_Certificate.types.hh \
-H79_Certificate.types.hh \
-Grid_Certificate.types.hh \
-Partial_Function.types.hh \
-Polyhedron.types.hh \
-C_Polyhedron.types.hh \
-NNC_Polyhedron.types.hh \
-Grid.types.hh \
-Ptr_Iterator.types.hh \
-DB_Row.types.hh \
-DB_Matrix.types.hh \
-BD_Shape.types.hh \
-OR_Matrix.types.hh \
-Octagonal_Shape.types.hh \
-fpu.types.hh \
-Float.defs.hh \
-Float.inlines.hh \
-Float.templates.hh \
+Coefficient_types.hh \
+stdiobuf_types.hh \
+c_streambuf_types.hh \
+globals_types.hh \
+iterator_to_const_types.hh \
+distances_types.hh \
+Interval_Info_types.hh \
+Interval_types.hh \
+Box_types.hh \
+Constraint_types.hh \
+Generator_types.hh \
+Grid_Generator_types.hh \
+Congruence_types.hh \
+Init_types.hh \
+Dense_Row_types.hh \
+CO_Tree_types.hh \
+Sparse_Row_types.hh \
+Matrix_types.hh \
+Swapping_Vector_types.hh \
+Variable_types.hh \
+Variables_Set_types.hh \
+Linear_Expression_types.hh \
+Expression_Adapter_types.hh \
+Expression_Hide_Last_types.hh \
+Expression_Hide_Inhomo_types.hh \
+Linear_Expression_Impl_types.hh \
+Linear_Expression_Interface_types.hh \
+Linear_System_types.hh \
+Linear_Form_types.hh \
+Bit_Row_types.hh \
+Bit_Matrix_types.hh \
+Constraint_System_types.hh \
+Generator_System_types.hh \
+Grid_Generator_System_types.hh \
+Congruence_System_types.hh \
+Scalar_Products_types.hh \
+PIP_Tree_types.hh \
+PIP_Problem_types.hh \
+Poly_Con_Relation_types.hh \
+Poly_Gen_Relation_types.hh \
+BHRZ03_Certificate_types.hh \
+H79_Certificate_types.hh \
+Grid_Certificate_types.hh \
+Partial_Function_types.hh \
+Polyhedron_types.hh \
+C_Polyhedron_types.hh \
+NNC_Polyhedron_types.hh \
+Grid_types.hh \
+Ptr_Iterator_types.hh \
+DB_Row_types.hh \
+DB_Matrix_types.hh \
+BD_Shape_types.hh \
+OR_Matrix_types.hh \
+Octagonal_Shape_types.hh \
+fpu_types.hh \
+Float_defs.hh \
+Float_inlines.hh \
+Float_templates.hh \
 C_Integer.hh \
-fpu.defs.hh \
-fpu-c99.inlines.hh \
-fpu-ia32.inlines.hh \
-fpu-none.inlines.hh \
-fpu-sparc.inlines.hh \
-Rounding_Dir.defs.hh \
-Rounding_Dir.inlines.hh \
-Result.defs.hh \
-Result.inlines.hh \
-Numeric_Format.defs.hh \
-checked.defs.hh \
-checked.inlines.hh \
-checked_int.inlines.hh \
-checked_float.inlines.hh \
-checked_mpz.inlines.hh \
-checked_mpq.inlines.hh \
-checked_ext.inlines.hh \
-Checked_Number.defs.hh \
-Checked_Number.inlines.hh \
-Checked_Number.templates.hh \
-WRD_coefficient_types.defs.hh \
-WRD_coefficient_types.inlines.hh \
+fpu_defs.hh \
+fpu-c99_inlines.hh \
+fpu-ia32_inlines.hh \
+fpu-none_inlines.hh \
+fpu-sparc_inlines.hh \
+Rounding_Dir_defs.hh \
+Rounding_Dir_inlines.hh \
+Result_defs.hh \
+Result_inlines.hh \
+Numeric_Format_defs.hh \
+checked_defs.hh \
+checked_inlines.hh \
+checked_int_inlines.hh \
+checked_float_inlines.hh \
+checked_mpz_inlines.hh \
+checked_mpq_inlines.hh \
+checked_ext_inlines.hh \
+Checked_Number_defs.hh \
+Checked_Number_inlines.hh \
+Checked_Number_templates.hh \
+WRD_coefficient_types_defs.hh \
+WRD_coefficient_types_inlines.hh \
 checked_numeric_limits.hh \
 $(COEFFICIENT_DEFS_INCLUDE_FILES) \
-Coefficient.defs.hh \
-Coefficient.inlines.hh \
-stdiobuf.defs.hh \
-stdiobuf.inlines.hh \
-c_streambuf.defs.hh \
-c_streambuf.inlines.hh \
-globals.defs.hh \
-globals.inlines.hh \
-math_utilities.defs.hh \
-math_utilities.inlines.hh \
-iterator_to_const.defs.hh \
-iterator_to_const.inlines.hh \
-distances.defs.hh \
-distances.inlines.hh \
-Boundary.defs.hh \
-intervals.defs.hh \
-Interval_Info.defs.hh \
-Interval_Info.inlines.hh \
-Interval.defs.hh \
-Interval.inlines.hh \
-Interval.templates.hh \
-Box.defs.hh \
-Box_Status.inlines.hh \
-Box.inlines.hh \
-Box.templates.hh \
+Coefficient_defs.hh \
+Coefficient_inlines.hh \
+stdiobuf_defs.hh \
+stdiobuf_inlines.hh \
+c_streambuf_defs.hh \
+c_streambuf_inlines.hh \
+globals_defs.hh \
+globals_inlines.hh \
+math_utilities_defs.hh \
+math_utilities_inlines.hh \
+iterator_to_const_defs.hh \
+iterator_to_const_inlines.hh \
+distances_defs.hh \
+distances_inlines.hh \
+Boundary_defs.hh \
+intervals_defs.hh \
+Interval_Info_defs.hh \
+Interval_Info_inlines.hh \
+Interval_defs.hh \
+Interval_inlines.hh \
+Interval_templates.hh \
+Box_defs.hh \
+Box_Status_inlines.hh \
+Box_inlines.hh \
+Box_templates.hh \
 Integer_Interval.hh \
 Rational_Interval.hh \
 Rational_Box.hh \
-Variable.defs.hh \
-Variable.inlines.hh \
-Variables_Set.defs.hh \
-Variables_Set.inlines.hh \
-Init.defs.hh \
-Init.inlines.hh \
+Variable_defs.hh \
+Variable_inlines.hh \
+Variables_Set_defs.hh \
+Variables_Set_inlines.hh \
+Init_defs.hh \
+Init_inlines.hh \
 initializer.hh \
-Topology.types.hh \
-Dense_Row.defs.hh \
-Dense_Row.inlines.hh \
-Dense_Row.templates.hh \
-CO_Tree.defs.hh \
-CO_Tree.inlines.hh \
-CO_Tree.templates.hh \
-Sparse_Row.defs.hh \
-Sparse_Row.inlines.hh \
-Sparse_Row.templates.hh \
-Bit_Row.defs.hh \
-Bit_Row.inlines.hh \
-Linear_System.defs.hh \
-Linear_System.inlines.hh \
-Linear_System.templates.hh \
-Bit_Matrix.defs.hh \
-Bit_Matrix.inlines.hh \
-Constraint_System.defs.hh \
-Generator_System.defs.hh \
-Grid_Generator_System.defs.hh \
-Congruence_System.defs.hh \
-Linear_Expression.defs.hh \
-Linear_Expression.inlines.hh \
-Expression_Hide_Last.defs.hh \
-Expression_Hide_Last.inlines.hh \
-Expression_Hide_Inhomo.defs.hh \
-Expression_Hide_Inhomo.inlines.hh \
-Linear_Expression_Impl.defs.hh \
-Linear_Expression_Impl.inlines.hh \
-Linear_Expression_Impl.templates.hh \
-Linear_Expression_Interface.defs.hh \
-Linear_Form.defs.hh \
-Linear_Form.inlines.hh \
-Linear_Form.templates.hh \
+Topology_types.hh \
+Dense_Row_defs.hh \
+Dense_Row_inlines.hh \
+Dense_Row_templates.hh \
+CO_Tree_defs.hh \
+CO_Tree_inlines.hh \
+CO_Tree_templates.hh \
+Sparse_Row_defs.hh \
+Sparse_Row_inlines.hh \
+Sparse_Row_templates.hh \
+Bit_Row_defs.hh \
+Bit_Row_inlines.hh \
+Linear_System_defs.hh \
+Linear_System_inlines.hh \
+Linear_System_templates.hh \
+Bit_Matrix_defs.hh \
+Bit_Matrix_inlines.hh \
+Constraint_System_defs.hh \
+Generator_System_defs.hh \
+Grid_Generator_System_defs.hh \
+Congruence_System_defs.hh \
+Linear_Expression_defs.hh \
+Linear_Expression_inlines.hh \
+Expression_Adapter_defs.hh \
+Expression_Adapter_inlines.hh \
+Expression_Hide_Last_defs.hh \
+Expression_Hide_Last_inlines.hh \
+Expression_Hide_Inhomo_defs.hh \
+Expression_Hide_Inhomo_inlines.hh \
+Linear_Expression_Impl_defs.hh \
+Linear_Expression_Impl_inlines.hh \
+Linear_Expression_Impl_templates.hh \
+Linear_Expression_Interface_defs.hh \
+Linear_Form_defs.hh \
+Linear_Form_inlines.hh \
+Linear_Form_templates.hh \
 linearize.hh \
-Constraint.defs.hh \
-Constraint.inlines.hh \
-Constraint_System.inlines.hh \
-Generator.defs.hh \
-Generator.inlines.hh \
-Grid_Generator.defs.hh \
-Grid_Generator.inlines.hh \
-Congruence.defs.hh \
-Congruence.inlines.hh \
-Generator_System.inlines.hh \
-Grid_Generator_System.inlines.hh \
-Congruence_System.inlines.hh \
-Scalar_Products.defs.hh \
-Scalar_Products.inlines.hh \
-Matrix.defs.hh \
-Matrix.inlines.hh \
-Matrix.templates.hh \
-Swapping_Vector.defs.hh \
-Swapping_Vector.inlines.hh \
-MIP_Problem.types.hh \
-MIP_Problem.defs.hh \
-MIP_Problem.inlines.hh \
-MIP_Problem.templates.hh \
-PIP_Tree.types.hh \
-PIP_Tree.defs.hh \
-PIP_Tree.inlines.hh \
-PIP_Problem.types.hh \
-PIP_Problem.defs.hh \
-PIP_Problem.inlines.hh \
-PIP_Problem.templates.hh \
-Poly_Con_Relation.defs.hh \
-Poly_Con_Relation.inlines.hh \
-Poly_Gen_Relation.defs.hh \
-Poly_Gen_Relation.inlines.hh \
-BHRZ03_Certificate.defs.hh \
-BHRZ03_Certificate.inlines.hh \
-H79_Certificate.defs.hh \
-H79_Certificate.inlines.hh \
-Grid_Certificate.defs.hh \
-Grid_Certificate.inlines.hh \
-Partial_Function.defs.hh \
-Partial_Function.inlines.hh \
-Polyhedron.defs.hh \
-Ph_Status.inlines.hh \
-Polyhedron.inlines.hh \
-Polyhedron_chdims.templates.hh \
-Polyhedron_conversion.templates.hh \
-Polyhedron_minimize.templates.hh \
-Polyhedron_simplify.templates.hh \
-Polyhedron.templates.hh \
-Grid.defs.hh \
-Grid_Status.inlines.hh \
-Grid.inlines.hh \
-Grid.templates.hh \
-C_Polyhedron.defs.hh \
-C_Polyhedron.inlines.hh \
-NNC_Polyhedron.defs.hh \
-NNC_Polyhedron.inlines.hh \
-Widening_Function.types.hh \
-Widening_Function.defs.hh \
-Widening_Function.inlines.hh \
-Ptr_Iterator.defs.hh \
-Ptr_Iterator.inlines.hh \
-DB_Row.defs.hh \
-DB_Row.inlines.hh \
-DB_Row.templates.hh \
-DB_Matrix.defs.hh \
-DB_Matrix.inlines.hh \
-DB_Matrix.templates.hh \
-BD_Shape.defs.hh \
-BDS_Status.inlines.hh \
-BD_Shape.inlines.hh \
-BD_Shape.templates.hh \
-OR_Matrix.defs.hh \
-OR_Matrix.inlines.hh \
-OR_Matrix.templates.hh \
-Octagonal_Shape.defs.hh \
-Og_Status.inlines.hh \
-Octagonal_Shape.inlines.hh \
-Octagonal_Shape.templates.hh \
-Determinate.types.hh \
-Determinate.defs.hh \
-Determinate.inlines.hh \
-Powerset.types.hh \
-Powerset.defs.hh \
-Powerset.inlines.hh \
-Powerset.templates.hh \
-Pointset_Powerset.types.hh \
-Pointset_Powerset.defs.hh \
-Pointset_Powerset.inlines.hh \
-Pointset_Powerset.templates.hh \
-Partially_Reduced_Product.types.hh \
-Partially_Reduced_Product.defs.hh \
-Partially_Reduced_Product.inlines.hh \
-Partially_Reduced_Product.templates.hh \
-Weight_Profiler.defs.hh \
+Constraint_defs.hh \
+Constraint_inlines.hh \
+Constraint_System_inlines.hh \
+Generator_defs.hh \
+Generator_inlines.hh \
+Grid_Generator_defs.hh \
+Grid_Generator_inlines.hh \
+Congruence_defs.hh \
+Congruence_inlines.hh \
+Generator_System_inlines.hh \
+Grid_Generator_System_inlines.hh \
+Congruence_System_inlines.hh \
+Scalar_Products_defs.hh \
+Scalar_Products_inlines.hh \
+Matrix_defs.hh \
+Matrix_inlines.hh \
+Matrix_templates.hh \
+Swapping_Vector_defs.hh \
+Swapping_Vector_inlines.hh \
+MIP_Problem_types.hh \
+MIP_Problem_defs.hh \
+MIP_Problem_inlines.hh \
+MIP_Problem_templates.hh \
+PIP_Tree_types.hh \
+PIP_Tree_defs.hh \
+PIP_Tree_inlines.hh \
+PIP_Problem_types.hh \
+PIP_Problem_defs.hh \
+PIP_Problem_inlines.hh \
+PIP_Problem_templates.hh \
+Poly_Con_Relation_defs.hh \
+Poly_Con_Relation_inlines.hh \
+Poly_Gen_Relation_defs.hh \
+Poly_Gen_Relation_inlines.hh \
+BHRZ03_Certificate_defs.hh \
+BHRZ03_Certificate_inlines.hh \
+H79_Certificate_defs.hh \
+H79_Certificate_inlines.hh \
+Grid_Certificate_defs.hh \
+Grid_Certificate_inlines.hh \
+Partial_Function_defs.hh \
+Partial_Function_inlines.hh \
+Polyhedron_defs.hh \
+Ph_Status_inlines.hh \
+Polyhedron_inlines.hh \
+Polyhedron_chdims_templates.hh \
+Polyhedron_conversion_templates.hh \
+Polyhedron_minimize_templates.hh \
+Polyhedron_simplify_templates.hh \
+Polyhedron_templates.hh \
+Grid_defs.hh \
+Grid_Status_inlines.hh \
+Grid_inlines.hh \
+Grid_templates.hh \
+C_Polyhedron_defs.hh \
+C_Polyhedron_inlines.hh \
+NNC_Polyhedron_defs.hh \
+NNC_Polyhedron_inlines.hh \
+Widening_Function_types.hh \
+Widening_Function_defs.hh \
+Widening_Function_inlines.hh \
+Ptr_Iterator_defs.hh \
+Ptr_Iterator_inlines.hh \
+DB_Row_defs.hh \
+DB_Row_inlines.hh \
+DB_Row_templates.hh \
+DB_Matrix_defs.hh \
+DB_Matrix_inlines.hh \
+DB_Matrix_templates.hh \
+BD_Shape_defs.hh \
+BDS_Status_inlines.hh \
+BD_Shape_inlines.hh \
+BD_Shape_templates.hh \
+OR_Matrix_defs.hh \
+OR_Matrix_inlines.hh \
+OR_Matrix_templates.hh \
+Octagonal_Shape_defs.hh \
+Og_Status_inlines.hh \
+Octagonal_Shape_inlines.hh \
+Octagonal_Shape_templates.hh \
+Determinate_types.hh \
+Determinate_defs.hh \
+Determinate_inlines.hh \
+Powerset_types.hh \
+Powerset_defs.hh \
+Powerset_inlines.hh \
+Powerset_templates.hh \
+Pointset_Powerset_types.hh \
+Pointset_Powerset_defs.hh \
+Pointset_Powerset_inlines.hh \
+Pointset_Powerset_templates.hh \
+Partially_Reduced_Product_types.hh \
+Partially_Reduced_Product_defs.hh \
+Partially_Reduced_Product_inlines.hh \
+Partially_Reduced_Product_templates.hh \
+Weight_Profiler_defs.hh \
 max_space_dimension.hh \
 algorithms.hh \
-termination.defs.hh \
-termination.templates.hh \
+termination_defs.hh \
+termination_templates.hh \
 wrap_assign.hh \
 wrap_string.hh \
-Floating_Point_Expression.types.hh \
-Floating_Point_Expression.defs.hh \
-Floating_Point_Expression.inlines.hh \
-Floating_Point_Expression.templates.hh \
-Cast_Floating_Point_Expression.types.hh \
-Cast_Floating_Point_Expression.defs.hh \
-Cast_Floating_Point_Expression.inlines.hh \
-Cast_Floating_Point_Expression.templates.hh \
-Constant_Floating_Point_Expression.types.hh \
-Constant_Floating_Point_Expression.defs.hh \
-Constant_Floating_Point_Expression.inlines.hh \
-Variable_Floating_Point_Expression.types.hh \
-Variable_Floating_Point_Expression.defs.hh \
-Variable_Floating_Point_Expression.inlines.hh \
-Sum_Floating_Point_Expression.types.hh \
-Sum_Floating_Point_Expression.defs.hh \
-Sum_Floating_Point_Expression.inlines.hh \
-Sum_Floating_Point_Expression.templates.hh \
-Difference_Floating_Point_Expression.types.hh \
-Difference_Floating_Point_Expression.defs.hh \
-Difference_Floating_Point_Expression.inlines.hh \
-Difference_Floating_Point_Expression.templates.hh \
-Multiplication_Floating_Point_Expression.types.hh \
-Multiplication_Floating_Point_Expression.defs.hh \
-Multiplication_Floating_Point_Expression.inlines.hh \
-Multiplication_Floating_Point_Expression.templates.hh \
-Division_Floating_Point_Expression.types.hh \
-Division_Floating_Point_Expression.defs.hh \
-Division_Floating_Point_Expression.inlines.hh \
-Division_Floating_Point_Expression.templates.hh \
-Opposite_Floating_Point_Expression.types.hh \
-Opposite_Floating_Point_Expression.defs.hh \
-Opposite_Floating_Point_Expression.inlines.hh \
-Doubly_Linked_Object.types.hh \
-EList.types.hh \
-EList_Iterator.types.hh \
-Handler.types.hh \
-Pending_Element.types.hh \
-Pending_List.types.hh \
-Time.types.hh \
-Watchdog.types.hh \
-Threshold_Watcher.types.hh \
-Handler.defs.hh \
-Handler.inlines.hh \
-Time.defs.hh \
-Time.inlines.hh \
-Doubly_Linked_Object.defs.hh \
-Doubly_Linked_Object.inlines.hh \
-EList_Iterator.defs.hh \
-EList_Iterator.inlines.hh \
-EList.defs.hh \
-EList.inlines.hh \
-Pending_Element.defs.hh \
-Pending_Element.inlines.hh \
-Pending_List.defs.hh \
-Pending_List.inlines.hh \
-Pending_List.templates.hh \
-Watchdog.defs.hh \
-Watchdog.inlines.hh \
-Threshold_Watcher.defs.hh \
-Threshold_Watcher.inlines.hh \
-Threshold_Watcher.templates.hh
-
-#Any_Pointset.types.hh \
-#Any_Pointset.defs.hh \
-#Any_Pointset.inlines.hh \
-#Ask_Tell.types.hh \
-#Ask_Tell.defs.hh \
-#Ask_Tell.inlines.hh \
-#Ask_Tell.templates.hh \
-#Pointset_Ask_Tell.types.hh \
-#Pointset_Ask_Tell.defs.hh \
-#Pointset_Ask_Tell.inlines.hh \
-#Pointset_Ask_Tell.templates.hh
+Floating_Point_Expression_types.hh \
+Floating_Point_Expression_defs.hh \
+Floating_Point_Expression_inlines.hh \
+Floating_Point_Expression_templates.hh \
+Cast_Floating_Point_Expression_types.hh \
+Cast_Floating_Point_Expression_defs.hh \
+Cast_Floating_Point_Expression_inlines.hh \
+Cast_Floating_Point_Expression_templates.hh \
+Constant_Floating_Point_Expression_types.hh \
+Constant_Floating_Point_Expression_defs.hh \
+Constant_Floating_Point_Expression_inlines.hh \
+Variable_Floating_Point_Expression_types.hh \
+Variable_Floating_Point_Expression_defs.hh \
+Variable_Floating_Point_Expression_inlines.hh \
+Sum_Floating_Point_Expression_types.hh \
+Sum_Floating_Point_Expression_defs.hh \
+Sum_Floating_Point_Expression_inlines.hh \
+Sum_Floating_Point_Expression_templates.hh \
+Difference_Floating_Point_Expression_types.hh \
+Difference_Floating_Point_Expression_defs.hh \
+Difference_Floating_Point_Expression_inlines.hh \
+Difference_Floating_Point_Expression_templates.hh \
+Multiplication_Floating_Point_Expression_types.hh \
+Multiplication_Floating_Point_Expression_defs.hh \
+Multiplication_Floating_Point_Expression_inlines.hh \
+Multiplication_Floating_Point_Expression_templates.hh \
+Division_Floating_Point_Expression_types.hh \
+Division_Floating_Point_Expression_defs.hh \
+Division_Floating_Point_Expression_inlines.hh \
+Division_Floating_Point_Expression_templates.hh \
+Opposite_Floating_Point_Expression_types.hh \
+Opposite_Floating_Point_Expression_defs.hh \
+Opposite_Floating_Point_Expression_inlines.hh \
+Doubly_Linked_Object_types.hh \
+EList_types.hh \
+EList_Iterator_types.hh \
+Handler_types.hh \
+Pending_Element_types.hh \
+Pending_List_types.hh \
+Time_types.hh \
+Watchdog_types.hh \
+Threshold_Watcher_types.hh \
+Handler_defs.hh \
+Handler_inlines.hh \
+Time_defs.hh \
+Time_inlines.hh \
+Doubly_Linked_Object_defs.hh \
+Doubly_Linked_Object_inlines.hh \
+EList_Iterator_defs.hh \
+EList_Iterator_inlines.hh \
+EList_defs.hh \
+EList_inlines.hh \
+Pending_Element_defs.hh \
+Pending_Element_inlines.hh \
+Pending_List_defs.hh \
+Pending_List_inlines.hh \
+Pending_List_templates.hh \
+Watchdog_defs.hh \
+Watchdog_inlines.hh \
+Threshold_Watcher_defs.hh \
+Threshold_Watcher_inlines.hh \
+Threshold_Watcher_templates.hh
+
+#Any_Pointset_types.hh \
+#Any_Pointset_defs.hh \
+#Any_Pointset_inlines.hh \
+#Ask_Tell_types.hh \
+#Ask_Tell_defs.hh \
+#Ask_Tell_inlines.hh \
+#Ask_Tell_templates.hh \
+#Pointset_Ask_Tell_types.hh \
+#Pointset_Ask_Tell_defs.hh \
+#Pointset_Ask_Tell_inlines.hh \
+#Pointset_Ask_Tell_templates.hh
 NESTED_INCLUDE_FILES = \
-Ph_Status.idefs.hh \
-Grid_Status.idefs.hh \
-Box_Status.idefs.hh \
-BDS_Status.idefs.hh \
-Og_Status.idefs.hh
+Ph_Status_idefs.hh \
+Grid_Status_idefs.hh \
+Box_Status_idefs.hh \
+BDS_Status_idefs.hh \
+Og_Status_idefs.hh
 
 libppl_la_SOURCES = \
 assert.cc \
@@ -1091,7 +1130,7 @@ Weight_Profiler.cc \
 version.cc \
 $(INCLUDE_FILES) \
 $(NESTED_INCLUDE_FILES) \
-swapping_sort.templates.hh \
+swapping_sort_templates.hh \
 termination.cc \
 wrap_string.cc \
 Time.cc \
@@ -1165,7 +1204,6 @@ ppl-config.cc: $(top_builddir)/config.status $(srcdir)/ppl-config.cc.in
 	cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@
 install-libLTLIBRARIES: $(lib_LTLIBRARIES)
 	@$(NORMAL_INSTALL)
-	test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)"
 	@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
 	list2=; for p in $$list; do \
 	  if test -f $$p; then \
@@ -1173,6 +1211,8 @@ install-libLTLIBRARIES: $(lib_LTLIBRARIES)
 	  else :; fi; \
 	done; \
 	test -z "$$list2" || { \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \
 	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
 	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
 	}
@@ -1188,18 +1228,23 @@ uninstall-libLTLIBRARIES:
 
 clean-libLTLIBRARIES:
 	-test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES)
-	@list='$(lib_LTLIBRARIES)'; for p in $$list; do \
-	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
-	  test "$$dir" != "$$p" || dir=.; \
-	  echo "rm -f \"$${dir}/so_locations\""; \
-	  rm -f "$${dir}/so_locations"; \
-	done
+	@list='$(lib_LTLIBRARIES)'; \
+	locs=`for p in $$list; do echo $$p; done | \
+	      sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \
+	      sort -u`; \
+	test -z "$$locs" || { \
+	  echo rm -f $${locs}; \
+	  rm -f $${locs}; \
+	}
 libppl.la: $(libppl_la_OBJECTS) $(libppl_la_DEPENDENCIES) $(EXTRA_libppl_la_DEPENDENCIES) 
 	$(AM_V_CXXLD)$(libppl_la_LINK) -rpath $(libdir) $(libppl_la_OBJECTS) $(libppl_la_LIBADD) $(LIBS)
 install-binPROGRAMS: $(bin_PROGRAMS)
 	@$(NORMAL_INSTALL)
-	test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)"
 	@list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+	fi; \
 	for p in $$list; do echo "$$p $$p"; done | \
 	sed 's/$(EXEEXT)$$//' | \
 	while read p p1; do if test -f $$p || test -f $$p1; \
@@ -1348,8 +1393,11 @@ clean-libtool:
 	-rm -rf .libs _libs
 install-includeHEADERS: $(include_HEADERS)
 	@$(NORMAL_INSTALL)
-	test -z "$(includedir)" || $(MKDIR_P) "$(DESTDIR)$(includedir)"
 	@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(includedir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(includedir)" || exit 1; \
+	fi; \
 	for p in $$list; do \
 	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
 	  echo "$$d$$p"; \
@@ -1414,6 +1462,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1568,8 +1630,8 @@ uninstall-am: uninstall-binPROGRAMS uninstall-includeHEADERS \
 .MAKE: all check install install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-am clean clean-binPROGRAMS \
-	clean-generic clean-libLTLIBRARIES clean-libtool ctags \
-	dist-hook distclean distclean-compile distclean-generic \
+	clean-generic clean-libLTLIBRARIES clean-libtool cscopelist \
+	ctags dist-hook distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-binPROGRAMS \
 	install-data install-data-am install-dvi install-dvi-am \
@@ -1638,24 +1700,24 @@ ppl_include_files.hh: $(INCLUDE_FILES) Makefile
 @HAVE_PERL_FALSE@	@echo "}"                                     >>$@
 
 @HAVE_PERL_FALSE at ppl.hh:	ppl.hh.dist ppl.hh.sed
- at HAVE_PERL_FALSE@	$(SED) -f ppl.hh.sed $< >$@
+ at HAVE_PERL_FALSE@	$(SED) -f ppl.hh.sed ppl.hh.dist >$@
 @HAVE_PERL_FALSE@	rm -f ppl.hh.sed
 
 @HAVE_PERL_FALSE at BUGS.hh:	BUGS.hh.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f BUGS.hh.dist $@
 @HAVE_PERL_FALSE at BUGS.cc:	BUGS.cc.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f BUGS.cc.dist $@
 @HAVE_PERL_FALSE at COPYING.hh:	COPYING.hh.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f COPYING.hh.dist $@
 @HAVE_PERL_FALSE at COPYING.cc:	COPYING.cc.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f COPYING.cc.dist $@
 @HAVE_PERL_FALSE at CREDITS.hh:	CREDITS.hh.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f CREDITS.hh.dist $@
 @HAVE_PERL_FALSE at CREDITS.cc:	CREDITS.cc.dist
- at HAVE_PERL_FALSE@	cp -f $< $@
+ at HAVE_PERL_FALSE@	cp -f CREDITS.cc.dist $@
 
 @USE_PRECOMPILED_HEADERS_TRUE at ppl.hh.gch: ppl.hh
- at USE_PRECOMPILED_HEADERS_TRUE@	$(CXXCOMPILE) -xc++-header -o $@ $<
+ at USE_PRECOMPILED_HEADERS_TRUE@	$(CXXCOMPILE) -xc++-header -o $@ ppl.hh
 
 # ppl.hh is not distributed.
 # ppl.hh.dist, which is distributed, is a copy of ppl.hh;
diff --git a/src/Matrix.defs.hh b/src/Matrix.defs.hh
deleted file mode 100644
index 1aae5da..0000000
--- a/src/Matrix.defs.hh
+++ /dev/null
@@ -1,437 +0,0 @@
-/* Matrix class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Matrix_defs_hh
-#define PPL_Matrix_defs_hh 1
-
-#include "Matrix.types.hh"
-#include "globals.defs.hh"
-#include "Coefficient.defs.hh"
-#include "Swapping_Vector.defs.hh"
-#include <ostream>
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A sparse matrix of Coefficient.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-class Parma_Polyhedra_Library::Matrix {
-
-public:
-  typedef typename Swapping_Vector<Row>::iterator iterator;
-  typedef typename Swapping_Vector<Row>::const_iterator const_iterator;
-
-  //! Returns the maximum number of rows of a Sparse_Matrix.
-  static dimension_type max_num_rows();
-
-  //! Returns the maximum number of columns of a Sparse_Matrix.
-  static dimension_type max_num_columns();
-
-  /*!
-    \brief Constructs a square matrix with the given size, filled with
-           unstored zeroes.
-
-    \param n
-    The size of the new square matrix.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  explicit Matrix(dimension_type n = 0);
-
-  /*!
-    \brief Constructs a matrix with the given dimensions, filled with unstored
-           zeroes.
-
-    \param num_rows
-    The number of rows in the new matrix.
-
-    \param num_columns
-    The number of columns in the new matrix.
-
-    This method takes \f$O(n)\f$ time, where n is \p num_rows.
-  */
-  Matrix(dimension_type num_rows, dimension_type num_columns);
-
-  //! Swaps (*this) with x.
-  /*!
-
-    \param x
-    The matrix that will be swapped with *this.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void m_swap(Matrix& x);
-
-  //! Returns the number of rows in the matrix.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  dimension_type num_rows() const;
-
-  //! Returns the number of columns in the matrix.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  dimension_type num_columns() const;
-
-  // TODO: Check if this can be removed.
-  //! Returns the capacity of the row vector.
-  dimension_type capacity() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this has no rows.
-  /*!
-    \note
-    The unusual naming for this method is \em intentional:
-    we do not want it to be named \c empty because this would cause
-    an error prone name clash with the corresponding methods in derived
-    classes Constraint_System and Congruence_System (which have a
-    different semantics).
-  */
-  bool has_no_rows() const;
-
-  //! Equivalent to resize(n, n).
-  void resize(dimension_type n);
-
-  // TODO: Check if this can become private.
-  //! Reserves space for at least \p n rows.
-  void reserve_rows(dimension_type n);
-
-  //! Resizes this matrix to the specified dimensions.
-  /*!
-
-    \param num_rows
-    The desired numer of rows.
-
-    \param num_columns
-    The desired numer of columns.
-
-    New rows and columns will contain non-stored zeroes.
-
-    This operation invalidates existing iterators.
-
-    Adding n rows takes \f$O(n)\f$ amortized time.
-
-    Adding n columns takes \f$O(r)\f$ time, where r is \p num_rows.
-
-    Removing n rows takes \f$O(n+k)\f$ amortized time, where k is the total
-    number of elements stored in the removed rows.
-
-    Removing n columns takes \f$O(\sum_{j=1}^{r} (k_j*\log^2 n_j))\f$ time,
-    where r is the number of rows, \f$k_j\f$ is the number of elements stored
-    in the columns of the j-th row that must be removed and \f$n_j\f$ is the
-    total number of elements stored in the j-th row.
-    A weaker (but simpler) bound is \f$O(r+k*\log^2 c)\f$, where r is the
-    number of rows, k is the number of elements that have to be removed and c
-    is the number of columns.
-  */
-  void resize(dimension_type num_rows, dimension_type num_columns);
-
-  //! Adds \p n rows and \p m columns of zeroes to the matrix.
-  /*!
-    \param n
-    The number of rows to be added: must be strictly positive.
-
-    \param m
-    The number of columns to be added: must be strictly positive.
-
-    Turns the \f$r \times c\f$ matrix \f$M\f$ into
-    the \f$(r+n) \times (c+m)\f$ matrix
-    \f$\bigl(\genfrac{}{}{0pt}{}{M}{0} \genfrac{}{}{0pt}{}{0}{0}\bigr)\f$.
-    The matrix is expanded avoiding reallocation whenever possible.
-
-    This method takes \f$O(r)\f$ time, where r is the number of the matrix's
-    rows after the operation.
-  */
-  void add_zero_rows_and_columns(dimension_type n, dimension_type m);
-
-  //! Adds to the matrix \p n rows of zeroes.
-  /*!
-    \param n
-    The number of rows to be added: must be strictly positive.
-
-    Turns the \f$r \times c\f$ matrix \f$M\f$ into
-    the \f$(r+n) \times c\f$ matrix \f$\genfrac{(}{)}{0pt}{}{M}{0}\f$.
-    The matrix is expanded avoiding reallocation whenever possible.
-
-    This method takes \f$O(k)\f$ amortized time, where k is the number of the
-    new rows.
-  */
-  void add_zero_rows(dimension_type n);
-
-  //! Adds a copy of the row \p x at the end of the matrix.
-  /*!
-
-    \param x
-    The row that will be appended to the matrix.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(n)\f$ amortized time, where n is the numer of
-    elements stored in \p x.
-  */
-  void add_row(const Row& x);
-
-  //! Adds the row \p y to the matrix.
-  /*!
-    \param y
-    The row to be added: it must have the same size and capacity as
-    \p *this. It is not declared <CODE>const</CODE> because its
-    data-structures will recycled to build the new matrix row.
-
-    Turns the \f$r \times c\f$ matrix \f$M\f$ into
-    the \f$(r+1) \times c\f$ matrix
-    \f$\genfrac{(}{)}{0pt}{}{M}{y}\f$.
-    The matrix is expanded avoiding reallocation whenever possible.
-  */
-  void add_recycled_row(Row& y);
-
-  /*! \brief
-    Removes from the matrix the last \p n rows.
-
-    \param n
-    The number of row that will be removed.
-
-    It is equivalent to num_rows() - n, num_columns()).
-
-    This method takes \f$O(n+k)\f$ amortized time, where k is the total number
-    of elements stored in the removed rows and n is the number of removed
-    rows.
-  */
-  void remove_trailing_rows(dimension_type n);
-
-  void remove_rows(iterator first, iterator last);
-
-  //! Permutes the columns of the matrix.
-  /*!
-    This method may be slow for some Row types, and should be avoided if
-    possible.
-
-    \param cycles
-    A vector representing the non-trivial cycles of the permutation
-    according to which the columns must be rearranged.
-
-    The \p cycles vector contains, one after the other, the
-    non-trivial cycles (i.e., the cycles of length greater than one)
-    of a permutation of \e non-zero column indexes.  Each cycle is
-    terminated by zero.  For example, assuming the matrix has 7
-    columns, the permutation \f$ \{ 1 \mapsto 3, 2 \mapsto 4,
-    3 \mapsto 6, 4 \mapsto 2, 5 \mapsto 5, 6 \mapsto 1 \}\f$ can be
-    represented by the non-trivial cycles \f$(1 3 6)(2 4)\f$ that, in
-    turn can be represented by a vector of 6 elements containing 1, 3,
-    6, 0, 2, 4, 0.
-
-    This method takes \f$O(k*\sum_{j=1}^{r} \log^2 n_j)\f$ expected time,
-    where k is the size of the \p cycles vector, r the number of rows and
-    \f$n_j\f$ the number of elements stored in row j.
-    A weaker (but simpler) bound is \f$O(k*r*\log^2 c)\f$, where k is the size
-    of the \p cycles vector, r is the number of rows and c is the number of
-    columns.
-
-    \note
-    The first column of the matrix, having index zero, is never involved
-    in a permutation.
-  */
-  void permute_columns(const std::vector<dimension_type>& cycles);
-
-  //! Swaps the columns having indexes \p i and \p j.
-  void swap_columns(dimension_type i,  dimension_type j);
-
-  //! Adds \p n columns of zeroes to the matrix.
-  /*!
-    \param n
-    The number of columns to be added: must be strictly positive.
-
-    Turns the \f$r \times c\f$ matrix \f$M\f$ into
-    the \f$r \times (c+n)\f$ matrix \f$(M \, 0)\f$.
-
-    This method takes \f$O(r)\f$ amortized time, where r is the numer of the
-    matrix's rows.
-  */
-  void add_zero_columns(dimension_type n);
-
-  //! Adds \p n columns of non-stored zeroes to the matrix before column i.
-  /*!
-
-    \param n
-    The numer of columns that will be added.
-
-    \param i
-    The index of the column before which the new columns will be added.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\sum_{j=1}^{r} (k_j+\log n_j))\f$ time, where r is
-    the number of rows, \f$k_j\f$ is the number of elements stored in the
-    columns of the j-th row that must be shifted and \f$n_j\f$ is the number
-    of elements stored in the j-th row.
-    A weaker (but simpler) bound is \f$O(k+r*\log c)\f$ time, where k is the
-    number of elements that must be shifted, r is the number of the rows and c
-    is the number of the columns.
-  */
-  void add_zero_columns(dimension_type n, dimension_type i);
-
-  //! Removes the i-th from the matrix, shifting other columns to the left.
-  /*!
-
-    \param i
-    The index of the column that will be removed.
-
-    This operation invalidates existing iterators on rows' elements.
-
-    This method takes \f$O(k + \sum_{j=1}^{r} (\log^2 n_j))\f$ amortized time,
-    where k is the number of elements stored with column index greater than i,
-    r the number of rows in this matrix and \f$n_j\f$ the number of elements
-    stored in row j.
-    A weaker (but simpler) bound is \f$O(r*(c-i+\log^2 c))\f$, where r is the
-    number of rows, c is the number of columns and i is the parameter passed
-    to this method.
-  */
-  void remove_column(dimension_type i);
-
-  //! Shrinks the matrix by removing its \p n trailing columns.
-  /*!
-
-    \param n
-    The number of trailing columns that will be removed.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\sum_{j=1}^r (k_j*\log n_j))\f$ amortized time,
-    where r is the number of rows, \f$k_j\f$ is the number of elements that
-    have to be removed from row j and \f$n_j\f$ is the total number of
-    elements stored in row j.
-    A weaker (but simpler) bound is \f$O(r*n*\log c)\f$, where r is the number
-    of rows, c the number of columns and n the parameter passed to this
-    method.
-  */
-  void remove_trailing_columns(dimension_type n);
-
-  //! Equivalent to resize(0,0).
-  void clear();
-
-  //! Returns an %iterator pointing to the first row.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  iterator begin();
-
-  //! Returns an %iterator pointing after the last row.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  iterator end();
-
-  //! Returns an %iterator pointing to the first row.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  const_iterator begin() const;
-
-  //! Returns an %iterator pointing after the last row.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  const_iterator end() const;
-
-  //! Returns a reference to the i-th row.
-  /*!
-    \param i
-    The index of the desired row.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  Row& operator[](dimension_type i);
-
-  //! Returns a const reference to the i-th row.
-  /*!
-    \param i
-    The index of the desired row.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  const Row& operator[](dimension_type i) const;
-
-  //! Loads the row from an ASCII representation generated using ascii_dump().
-  /*!
-    \param s
-    The stream from which read the ASCII representation.
-
-    This method takes \f$O(n*\log n)\f$ time.
-  */
-  bool ascii_load(std::istream& s);
-
-  PPL_OUTPUT_DECLARATIONS
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  /*!
-    This method is \f$O(r+k)\f$, where r is the number of rows and k is the
-    number of elements stored in the matrix.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  /*!
-    This method is \f$O(r+k)\f$, where r is the number of rows and k is the
-    number of elements stored in the matrix.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-private:
-  //! The vector that stores the matrix's elements.
-  Swapping_Vector<Row> rows;
-
-  //! The number of columns in this matrix.
-  dimension_type num_columns_;
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-void swap(Matrix<Row>& x, Matrix<Row>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-bool operator==(const Matrix<Row>& x, const Matrix<Row>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Row>
-bool operator!=(const Matrix<Row>& x, const Matrix<Row>& y);
-
-} // namespace Parma_Polyhedra_Library
-
-
-#include "Matrix.inlines.hh"
-#include "Matrix.templates.hh"
-
-#endif // !defined(PPL_Matrix_defs_hh)
diff --git a/src/Matrix.inlines.hh b/src/Matrix.inlines.hh
deleted file mode 100644
index 46498c1..0000000
--- a/src/Matrix.inlines.hh
+++ /dev/null
@@ -1,200 +0,0 @@
-/* Matrix class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Matrix_inlines_hh
-#define PPL_Matrix_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-inline dimension_type
-Matrix<Row>::max_num_rows() {
-  return std::vector<Row>().max_size();
-}
-
-template <typename Row>
-inline dimension_type
-Matrix<Row>::max_num_columns() {
-  return Row::max_size();
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::m_swap(Matrix& x) {
-  using std::swap;
-  swap(rows, x.rows);
-  swap(num_columns_, x.num_columns_);
-}
-
-template <typename Row>
-inline dimension_type
-Matrix<Row>::num_rows() const {
-  return rows.size();
-}
-
-template <typename Row>
-inline dimension_type
-Matrix<Row>::num_columns() const {
-  return num_columns_;
-}
-
-template <typename Row>
-inline dimension_type
-Matrix<Row>::capacity() const {
-  return rows.capacity();
-}
-
-template <typename Row>
-inline bool
-Matrix<Row>::has_no_rows() const {
-  return num_rows() == 0;
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::resize(dimension_type n) {
-  resize(n, n);
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::reserve_rows(dimension_type requested_capacity) {
-
-  rows.reserve(requested_capacity);
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::add_zero_rows_and_columns(dimension_type n, dimension_type m) {
-  resize(num_rows() + n, num_columns() + m);
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::add_zero_rows(dimension_type n) {
-  resize(num_rows() + n, num_columns());
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::add_row(const Row& x) {
-  // TODO: Optimize this.
-  Row row(x);
-  add_zero_rows(1);
-  // Now x may have been invalidated, if it was a row of this matrix.
-  swap(rows.back(), row);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::add_recycled_row(Row& x) {
-  add_zero_rows(1);
-  swap(rows.back(), x);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::remove_trailing_rows(dimension_type n) {
-  resize(num_rows() - n, num_columns());
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::remove_rows(iterator first, iterator last) {
-  rows.erase(first, last);
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::add_zero_columns(dimension_type n) {
-  resize(num_rows(), num_columns() + n);
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::remove_trailing_columns(dimension_type n) {
-  PPL_ASSERT(n <= num_columns());
-  resize(num_rows(), num_columns() - n);
-}
-
-template <typename Row>
-inline void
-Matrix<Row>::clear() {
-  resize(0, 0);
-}
-
-template <typename Row>
-inline typename Matrix<Row>::iterator
-Matrix<Row>::begin() {
-  return rows.begin();
-}
-
-template <typename Row>
-inline typename Matrix<Row>::iterator
-Matrix<Row>::end() {
-  return rows.end();
-}
-
-template <typename Row>
-inline typename Matrix<Row>::const_iterator
-Matrix<Row>::begin() const {
-  return rows.begin();
-}
-
-template <typename Row>
-inline typename Matrix<Row>::const_iterator
-Matrix<Row>::end() const {
-  return rows.end();
-}
-
-template <typename Row>
-inline Row&
-Matrix<Row>::operator[](dimension_type i) {
-  PPL_ASSERT(i < rows.size());
-  return rows[i];
-}
-
-template <typename Row>
-inline const Row&
-Matrix<Row>::operator[](dimension_type i) const {
-  PPL_ASSERT(i < rows.size());
-  return rows[i];
-}
-
-template <typename Row>
-inline memory_size_type
-Matrix<Row>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename Row>
-inline void
-swap(Matrix<Row>& x, Matrix<Row>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Matrix_inlines_hh)
diff --git a/src/Matrix.templates.hh b/src/Matrix.templates.hh
deleted file mode 100644
index d000eea..0000000
--- a/src/Matrix.templates.hh
+++ /dev/null
@@ -1,201 +0,0 @@
-/* Matrix class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Matrix_templates_hh
-#define PPL_Matrix_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-Matrix<Row>::Matrix(dimension_type n)
-  : rows(n), num_columns_(n) {
-  for (dimension_type i = 0; i < rows.size(); ++i)
-    rows[i].resize(num_columns_);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-Matrix<Row>::Matrix(dimension_type num_rows, dimension_type num_columns)
-  : rows(num_rows), num_columns_(num_columns) {
-  for (dimension_type i = 0; i < rows.size(); ++i)
-    rows[i].resize(num_columns_);
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Matrix<Row>::resize(dimension_type num_rows, dimension_type num_columns) {
-  const dimension_type old_num_rows = rows.size();
-  rows.resize(num_rows);
-  if (old_num_rows < num_rows) {
-    for (dimension_type i = old_num_rows; i < num_rows; ++i)
-      rows[i].resize(num_columns);
-    if (num_columns_ != num_columns) {
-      num_columns_ = num_columns;
-      for (dimension_type i = 0; i < old_num_rows; ++i)
-        rows[i].resize(num_columns);
-    }
-  } else
-    if (num_columns_ != num_columns) {
-      num_columns_ = num_columns;
-      for (dimension_type i = 0; i < num_rows; ++i)
-        rows[i].resize(num_columns);
-    }
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Matrix<Row>::permute_columns(const std::vector<dimension_type>& cycles) {
-  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-  const dimension_type n = cycles.size();
-  PPL_ASSERT(cycles[n - 1] == 0);
-  for (dimension_type k = num_rows(); k-- > 0; ) {
-    Row& rows_k = (*this)[k];
-    for (dimension_type i = 0, j = 0; i < n; i = ++j) {
-      // Make `j' be the index of the next cycle terminator.
-      while (cycles[j] != 0)
-        ++j;
-      // Cycles of length less than 2 are not allowed.
-      PPL_ASSERT(j - i >= 2);
-      if (j - i == 2)
-        // For cycles of length 2 no temporary is needed, just a swap.
-        rows_k.swap_coefficients(cycles[i], cycles[i + 1]);
-      else {
-        // Longer cycles need a temporary.
-        tmp = rows_k.get(cycles[j - 1]);
-        for (dimension_type l = (j - 1); l > i; --l)
-          rows_k.swap_coefficients(cycles[l-1], cycles[l]);
-        if (tmp == 0)
-          rows_k.reset(cycles[i]);
-        else {
-          using std::swap;
-          swap(tmp, rows_k[cycles[i]]);
-        }
-      }
-    }
-  }
-}
-
-template <typename Row>
-void
-Matrix<Row>::swap_columns(dimension_type i, dimension_type j) {
-  for (dimension_type k = num_rows(); k-- > 0; )
-    (*this)[k].swap_coefficients(i, j);
-}
-
-template <typename Row>
-void
-Matrix<Row>::add_zero_columns(dimension_type n, dimension_type i) {
-  for (dimension_type j = rows.size(); j-- > 0; )
-    rows[j].add_zeroes_and_shift(n, i);
-  num_columns_ += n;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Matrix<Row>::remove_column(dimension_type i) {
-  for (dimension_type j = rows.size(); j-- > 0; )
-    rows[j].delete_element_and_shift(i);
-  --num_columns_;
-  PPL_ASSERT(OK());
-}
-
-template <typename Row>
-void
-Matrix<Row>::ascii_dump(std::ostream& s) const {
-  s << num_rows() << " x ";
-  s << num_columns() << "\n";
-  for (const_iterator i = begin(), i_end = end(); i !=i_end; ++i)
-    i->ascii_dump(s);
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(Row, Matrix<Row>)
-
-template <typename Row>
-bool
-Matrix<Row>::ascii_load(std::istream& s) {
-  std::string str;
-  dimension_type new_num_rows;
-  dimension_type new_num_cols;
-  if (!(s >> new_num_rows))
-    return false;
-  if (!(s >> str) || str != "x")
-    return false;
-  if (!(s >> new_num_cols))
-    return false;
-
-  for (iterator i = rows.begin(), i_end = rows.end(); i != i_end; ++i)
-    i->clear();
-
-  resize(new_num_rows, new_num_cols);
-
-  for (dimension_type row = 0; row < new_num_rows; ++row)
-    if (!rows[row].ascii_load(s))
-      return false;
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename Row>
-memory_size_type
-Matrix<Row>::external_memory_in_bytes() const {
-  return rows.external_memory_in_bytes();
-}
-
-template <typename Row>
-bool
-Matrix<Row>::OK() const {
-  for (const_iterator i = begin(), i_end = end(); i != i_end; ++i)
-    if (i->size() != num_columns_)
-      return false;
-  return true;
-}
-
-/*! \relates Parma_Polyhedra_Library::Matrix */
-template <typename Row>
-bool
-operator==(const Matrix<Row>& x, const Matrix<Row>& y) {
-  if (x.num_rows() != y.num_rows())
-    return false;
-  if (x.num_columns() != y.num_columns())
-    return false;
-  for (dimension_type i = x.num_rows(); i-- > 0; )
-    if (x[i] != y[i])
-      return false;
-  return true;
-}
-
-/*! \relates Parma_Polyhedra_Library::Matrix */
-template <typename Row>
-bool
-operator!=(const Matrix<Row>& x, const Matrix<Row>& y) {
-  return !(x == y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Matrix_templates_hh)
diff --git a/src/Matrix.types.hh b/src/Matrix.types.hh
deleted file mode 100644
index a0027dd..0000000
--- a/src/Matrix.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Matrix_types_hh
-#define PPL_Matrix_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Row>
-class Matrix;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Matrix_types_hh)
diff --git a/src/Matrix_defs.hh b/src/Matrix_defs.hh
new file mode 100644
index 0000000..02743b7
--- /dev/null
+++ b/src/Matrix_defs.hh
@@ -0,0 +1,437 @@
+/* Matrix class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Matrix_defs_hh
+#define PPL_Matrix_defs_hh 1
+
+#include "Matrix_types.hh"
+#include "globals_defs.hh"
+#include "Coefficient_defs.hh"
+#include "Swapping_Vector_defs.hh"
+#include <ostream>
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A sparse matrix of Coefficient.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+class Parma_Polyhedra_Library::Matrix {
+
+public:
+  typedef typename Swapping_Vector<Row>::iterator iterator;
+  typedef typename Swapping_Vector<Row>::const_iterator const_iterator;
+
+  //! Returns the maximum number of rows of a Sparse_Matrix.
+  static dimension_type max_num_rows();
+
+  //! Returns the maximum number of columns of a Sparse_Matrix.
+  static dimension_type max_num_columns();
+
+  /*!
+    \brief Constructs a square matrix with the given size, filled with
+           unstored zeroes.
+
+    \param n
+    The size of the new square matrix.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  explicit Matrix(dimension_type n = 0);
+
+  /*!
+    \brief Constructs a matrix with the given dimensions, filled with unstored
+           zeroes.
+
+    \param num_rows
+    The number of rows in the new matrix.
+
+    \param num_columns
+    The number of columns in the new matrix.
+
+    This method takes \f$O(n)\f$ time, where n is \p num_rows.
+  */
+  Matrix(dimension_type num_rows, dimension_type num_columns);
+
+  //! Swaps (*this) with x.
+  /*!
+
+    \param x
+    The matrix that will be swapped with *this.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void m_swap(Matrix& x);
+
+  //! Returns the number of rows in the matrix.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  dimension_type num_rows() const;
+
+  //! Returns the number of columns in the matrix.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  dimension_type num_columns() const;
+
+  // TODO: Check if this can be removed.
+  //! Returns the capacity of the row vector.
+  dimension_type capacity() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this has no rows.
+  /*!
+    \note
+    The unusual naming for this method is \em intentional:
+    we do not want it to be named \c empty because this would cause
+    an error prone name clash with the corresponding methods in derived
+    classes Constraint_System and Congruence_System (which have a
+    different semantics).
+  */
+  bool has_no_rows() const;
+
+  //! Equivalent to resize(n, n).
+  void resize(dimension_type n);
+
+  // TODO: Check if this can become private.
+  //! Reserves space for at least \p n rows.
+  void reserve_rows(dimension_type n);
+
+  //! Resizes this matrix to the specified dimensions.
+  /*!
+
+    \param num_rows
+    The desired numer of rows.
+
+    \param num_columns
+    The desired numer of columns.
+
+    New rows and columns will contain non-stored zeroes.
+
+    This operation invalidates existing iterators.
+
+    Adding n rows takes \f$O(n)\f$ amortized time.
+
+    Adding n columns takes \f$O(r)\f$ time, where r is \p num_rows.
+
+    Removing n rows takes \f$O(n+k)\f$ amortized time, where k is the total
+    number of elements stored in the removed rows.
+
+    Removing n columns takes \f$O(\sum_{j=1}^{r} (k_j*\log^2 n_j))\f$ time,
+    where r is the number of rows, \f$k_j\f$ is the number of elements stored
+    in the columns of the j-th row that must be removed and \f$n_j\f$ is the
+    total number of elements stored in the j-th row.
+    A weaker (but simpler) bound is \f$O(r+k*\log^2 c)\f$, where r is the
+    number of rows, k is the number of elements that have to be removed and c
+    is the number of columns.
+  */
+  void resize(dimension_type num_rows, dimension_type num_columns);
+
+  //! Adds \p n rows and \p m columns of zeroes to the matrix.
+  /*!
+    \param n
+    The number of rows to be added: must be strictly positive.
+
+    \param m
+    The number of columns to be added: must be strictly positive.
+
+    Turns the \f$r \times c\f$ matrix \f$M\f$ into
+    the \f$(r+n) \times (c+m)\f$ matrix
+    \f$\bigl(\genfrac{}{}{0pt}{}{M}{0} \genfrac{}{}{0pt}{}{0}{0}\bigr)\f$.
+    The matrix is expanded avoiding reallocation whenever possible.
+
+    This method takes \f$O(r)\f$ time, where r is the number of the matrix's
+    rows after the operation.
+  */
+  void add_zero_rows_and_columns(dimension_type n, dimension_type m);
+
+  //! Adds to the matrix \p n rows of zeroes.
+  /*!
+    \param n
+    The number of rows to be added: must be strictly positive.
+
+    Turns the \f$r \times c\f$ matrix \f$M\f$ into
+    the \f$(r+n) \times c\f$ matrix \f$\genfrac{(}{)}{0pt}{}{M}{0}\f$.
+    The matrix is expanded avoiding reallocation whenever possible.
+
+    This method takes \f$O(k)\f$ amortized time, where k is the number of the
+    new rows.
+  */
+  void add_zero_rows(dimension_type n);
+
+  //! Adds a copy of the row \p x at the end of the matrix.
+  /*!
+
+    \param x
+    The row that will be appended to the matrix.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(n)\f$ amortized time, where n is the numer of
+    elements stored in \p x.
+  */
+  void add_row(const Row& x);
+
+  //! Adds the row \p y to the matrix.
+  /*!
+    \param y
+    The row to be added: it must have the same size and capacity as
+    \p *this. It is not declared <CODE>const</CODE> because its
+    data-structures will recycled to build the new matrix row.
+
+    Turns the \f$r \times c\f$ matrix \f$M\f$ into
+    the \f$(r+1) \times c\f$ matrix
+    \f$\genfrac{(}{)}{0pt}{}{M}{y}\f$.
+    The matrix is expanded avoiding reallocation whenever possible.
+  */
+  void add_recycled_row(Row& y);
+
+  /*! \brief
+    Removes from the matrix the last \p n rows.
+
+    \param n
+    The number of row that will be removed.
+
+    It is equivalent to num_rows() - n, num_columns()).
+
+    This method takes \f$O(n+k)\f$ amortized time, where k is the total number
+    of elements stored in the removed rows and n is the number of removed
+    rows.
+  */
+  void remove_trailing_rows(dimension_type n);
+
+  void remove_rows(iterator first, iterator last);
+
+  //! Permutes the columns of the matrix.
+  /*!
+    This method may be slow for some Row types, and should be avoided if
+    possible.
+
+    \param cycles
+    A vector representing the non-trivial cycles of the permutation
+    according to which the columns must be rearranged.
+
+    The \p cycles vector contains, one after the other, the
+    non-trivial cycles (i.e., the cycles of length greater than one)
+    of a permutation of \e non-zero column indexes.  Each cycle is
+    terminated by zero.  For example, assuming the matrix has 7
+    columns, the permutation \f$ \{ 1 \mapsto 3, 2 \mapsto 4,
+    3 \mapsto 6, 4 \mapsto 2, 5 \mapsto 5, 6 \mapsto 1 \}\f$ can be
+    represented by the non-trivial cycles \f$(1 3 6)(2 4)\f$ that, in
+    turn can be represented by a vector of 6 elements containing 1, 3,
+    6, 0, 2, 4, 0.
+
+    This method takes \f$O(k*\sum_{j=1}^{r} \log^2 n_j)\f$ expected time,
+    where k is the size of the \p cycles vector, r the number of rows and
+    \f$n_j\f$ the number of elements stored in row j.
+    A weaker (but simpler) bound is \f$O(k*r*\log^2 c)\f$, where k is the size
+    of the \p cycles vector, r is the number of rows and c is the number of
+    columns.
+
+    \note
+    The first column of the matrix, having index zero, is never involved
+    in a permutation.
+  */
+  void permute_columns(const std::vector<dimension_type>& cycles);
+
+  //! Swaps the columns having indexes \p i and \p j.
+  void swap_columns(dimension_type i,  dimension_type j);
+
+  //! Adds \p n columns of zeroes to the matrix.
+  /*!
+    \param n
+    The number of columns to be added: must be strictly positive.
+
+    Turns the \f$r \times c\f$ matrix \f$M\f$ into
+    the \f$r \times (c+n)\f$ matrix \f$(M \, 0)\f$.
+
+    This method takes \f$O(r)\f$ amortized time, where r is the numer of the
+    matrix's rows.
+  */
+  void add_zero_columns(dimension_type n);
+
+  //! Adds \p n columns of non-stored zeroes to the matrix before column i.
+  /*!
+
+    \param n
+    The numer of columns that will be added.
+
+    \param i
+    The index of the column before which the new columns will be added.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\sum_{j=1}^{r} (k_j+\log n_j))\f$ time, where r is
+    the number of rows, \f$k_j\f$ is the number of elements stored in the
+    columns of the j-th row that must be shifted and \f$n_j\f$ is the number
+    of elements stored in the j-th row.
+    A weaker (but simpler) bound is \f$O(k+r*\log c)\f$ time, where k is the
+    number of elements that must be shifted, r is the number of the rows and c
+    is the number of the columns.
+  */
+  void add_zero_columns(dimension_type n, dimension_type i);
+
+  //! Removes the i-th from the matrix, shifting other columns to the left.
+  /*!
+
+    \param i
+    The index of the column that will be removed.
+
+    This operation invalidates existing iterators on rows' elements.
+
+    This method takes \f$O(k + \sum_{j=1}^{r} (\log^2 n_j))\f$ amortized time,
+    where k is the number of elements stored with column index greater than i,
+    r the number of rows in this matrix and \f$n_j\f$ the number of elements
+    stored in row j.
+    A weaker (but simpler) bound is \f$O(r*(c-i+\log^2 c))\f$, where r is the
+    number of rows, c is the number of columns and i is the parameter passed
+    to this method.
+  */
+  void remove_column(dimension_type i);
+
+  //! Shrinks the matrix by removing its \p n trailing columns.
+  /*!
+
+    \param n
+    The number of trailing columns that will be removed.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\sum_{j=1}^r (k_j*\log n_j))\f$ amortized time,
+    where r is the number of rows, \f$k_j\f$ is the number of elements that
+    have to be removed from row j and \f$n_j\f$ is the total number of
+    elements stored in row j.
+    A weaker (but simpler) bound is \f$O(r*n*\log c)\f$, where r is the number
+    of rows, c the number of columns and n the parameter passed to this
+    method.
+  */
+  void remove_trailing_columns(dimension_type n);
+
+  //! Equivalent to resize(0,0).
+  void clear();
+
+  //! Returns an %iterator pointing to the first row.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  iterator begin();
+
+  //! Returns an %iterator pointing after the last row.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  iterator end();
+
+  //! Returns an %iterator pointing to the first row.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  const_iterator begin() const;
+
+  //! Returns an %iterator pointing after the last row.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  const_iterator end() const;
+
+  //! Returns a reference to the i-th row.
+  /*!
+    \param i
+    The index of the desired row.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  Row& operator[](dimension_type i);
+
+  //! Returns a const reference to the i-th row.
+  /*!
+    \param i
+    The index of the desired row.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  const Row& operator[](dimension_type i) const;
+
+  //! Loads the row from an ASCII representation generated using ascii_dump().
+  /*!
+    \param s
+    The stream from which read the ASCII representation.
+
+    This method takes \f$O(n*\log n)\f$ time.
+  */
+  bool ascii_load(std::istream& s);
+
+  PPL_OUTPUT_DECLARATIONS
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  /*!
+    This method is \f$O(r+k)\f$, where r is the number of rows and k is the
+    number of elements stored in the matrix.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  /*!
+    This method is \f$O(r+k)\f$, where r is the number of rows and k is the
+    number of elements stored in the matrix.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+private:
+  //! The vector that stores the matrix's elements.
+  Swapping_Vector<Row> rows;
+
+  //! The number of columns in this matrix.
+  dimension_type num_columns_;
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+void swap(Matrix<Row>& x, Matrix<Row>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+bool operator==(const Matrix<Row>& x, const Matrix<Row>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Row>
+bool operator!=(const Matrix<Row>& x, const Matrix<Row>& y);
+
+} // namespace Parma_Polyhedra_Library
+
+
+#include "Matrix_inlines.hh"
+#include "Matrix_templates.hh"
+
+#endif // !defined(PPL_Matrix_defs_hh)
diff --git a/src/Matrix_inlines.hh b/src/Matrix_inlines.hh
new file mode 100644
index 0000000..1e7bee9
--- /dev/null
+++ b/src/Matrix_inlines.hh
@@ -0,0 +1,200 @@
+/* Matrix class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Matrix_inlines_hh
+#define PPL_Matrix_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+inline dimension_type
+Matrix<Row>::max_num_rows() {
+  return std::vector<Row>().max_size();
+}
+
+template <typename Row>
+inline dimension_type
+Matrix<Row>::max_num_columns() {
+  return Row::max_size();
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::m_swap(Matrix& x) {
+  using std::swap;
+  swap(rows, x.rows);
+  swap(num_columns_, x.num_columns_);
+}
+
+template <typename Row>
+inline dimension_type
+Matrix<Row>::num_rows() const {
+  return rows.size();
+}
+
+template <typename Row>
+inline dimension_type
+Matrix<Row>::num_columns() const {
+  return num_columns_;
+}
+
+template <typename Row>
+inline dimension_type
+Matrix<Row>::capacity() const {
+  return rows.capacity();
+}
+
+template <typename Row>
+inline bool
+Matrix<Row>::has_no_rows() const {
+  return num_rows() == 0;
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::resize(dimension_type n) {
+  resize(n, n);
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::reserve_rows(dimension_type requested_capacity) {
+
+  rows.reserve(requested_capacity);
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::add_zero_rows_and_columns(dimension_type n, dimension_type m) {
+  resize(num_rows() + n, num_columns() + m);
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::add_zero_rows(dimension_type n) {
+  resize(num_rows() + n, num_columns());
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::add_row(const Row& x) {
+  // TODO: Optimize this.
+  Row row(x);
+  add_zero_rows(1);
+  // Now x may have been invalidated, if it was a row of this matrix.
+  swap(rows.back(), row);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::add_recycled_row(Row& x) {
+  add_zero_rows(1);
+  swap(rows.back(), x);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::remove_trailing_rows(dimension_type n) {
+  resize(num_rows() - n, num_columns());
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::remove_rows(iterator first, iterator last) {
+  rows.erase(first, last);
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::add_zero_columns(dimension_type n) {
+  resize(num_rows(), num_columns() + n);
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::remove_trailing_columns(dimension_type n) {
+  PPL_ASSERT(n <= num_columns());
+  resize(num_rows(), num_columns() - n);
+}
+
+template <typename Row>
+inline void
+Matrix<Row>::clear() {
+  resize(0, 0);
+}
+
+template <typename Row>
+inline typename Matrix<Row>::iterator
+Matrix<Row>::begin() {
+  return rows.begin();
+}
+
+template <typename Row>
+inline typename Matrix<Row>::iterator
+Matrix<Row>::end() {
+  return rows.end();
+}
+
+template <typename Row>
+inline typename Matrix<Row>::const_iterator
+Matrix<Row>::begin() const {
+  return rows.begin();
+}
+
+template <typename Row>
+inline typename Matrix<Row>::const_iterator
+Matrix<Row>::end() const {
+  return rows.end();
+}
+
+template <typename Row>
+inline Row&
+Matrix<Row>::operator[](dimension_type i) {
+  PPL_ASSERT(i < rows.size());
+  return rows[i];
+}
+
+template <typename Row>
+inline const Row&
+Matrix<Row>::operator[](dimension_type i) const {
+  PPL_ASSERT(i < rows.size());
+  return rows[i];
+}
+
+template <typename Row>
+inline memory_size_type
+Matrix<Row>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename Row>
+inline void
+swap(Matrix<Row>& x, Matrix<Row>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Matrix_inlines_hh)
diff --git a/src/Matrix_templates.hh b/src/Matrix_templates.hh
new file mode 100644
index 0000000..e091eaa
--- /dev/null
+++ b/src/Matrix_templates.hh
@@ -0,0 +1,202 @@
+/* Matrix class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Matrix_templates_hh
+#define PPL_Matrix_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+Matrix<Row>::Matrix(dimension_type n)
+  : rows(n), num_columns_(n) {
+  for (dimension_type i = 0; i < rows.size(); ++i)
+    rows[i].resize(num_columns_);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+Matrix<Row>::Matrix(dimension_type num_rows, dimension_type num_columns)
+  : rows(num_rows), num_columns_(num_columns) {
+  for (dimension_type i = 0; i < rows.size(); ++i)
+    rows[i].resize(num_columns_);
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Matrix<Row>::resize(dimension_type num_rows, dimension_type num_columns) {
+  const dimension_type old_num_rows = rows.size();
+  rows.resize(num_rows);
+  if (old_num_rows < num_rows) {
+    for (dimension_type i = old_num_rows; i < num_rows; ++i)
+      rows[i].resize(num_columns);
+    if (num_columns_ != num_columns) {
+      num_columns_ = num_columns;
+      for (dimension_type i = 0; i < old_num_rows; ++i)
+        rows[i].resize(num_columns);
+    }
+  }
+  else
+    if (num_columns_ != num_columns) {
+      num_columns_ = num_columns;
+      for (dimension_type i = 0; i < num_rows; ++i)
+        rows[i].resize(num_columns);
+    }
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Matrix<Row>::permute_columns(const std::vector<dimension_type>& cycles) {
+  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+  const dimension_type n = cycles.size();
+  PPL_ASSERT(cycles[n - 1] == 0);
+  for (dimension_type k = num_rows(); k-- > 0; ) {
+    Row& rows_k = (*this)[k];
+    for (dimension_type i = 0, j = 0; i < n; i = ++j) {
+      // Make `j' be the index of the next cycle terminator.
+      while (cycles[j] != 0)
+        ++j;
+      // Cycles of length less than 2 are not allowed.
+      PPL_ASSERT(j - i >= 2);
+      if (j - i == 2)
+        // For cycles of length 2 no temporary is needed, just a swap.
+        rows_k.swap_coefficients(cycles[i], cycles[i + 1]);
+      else {
+        // Longer cycles need a temporary.
+        tmp = rows_k.get(cycles[j - 1]);
+        for (dimension_type l = (j - 1); l > i; --l)
+          rows_k.swap_coefficients(cycles[l-1], cycles[l]);
+        if (tmp == 0)
+          rows_k.reset(cycles[i]);
+        else {
+          using std::swap;
+          swap(tmp, rows_k[cycles[i]]);
+        }
+      }
+    }
+  }
+}
+
+template <typename Row>
+void
+Matrix<Row>::swap_columns(dimension_type i, dimension_type j) {
+  for (dimension_type k = num_rows(); k-- > 0; )
+    (*this)[k].swap_coefficients(i, j);
+}
+
+template <typename Row>
+void
+Matrix<Row>::add_zero_columns(dimension_type n, dimension_type i) {
+  for (dimension_type j = rows.size(); j-- > 0; )
+    rows[j].add_zeroes_and_shift(n, i);
+  num_columns_ += n;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Matrix<Row>::remove_column(dimension_type i) {
+  for (dimension_type j = rows.size(); j-- > 0; )
+    rows[j].delete_element_and_shift(i);
+  --num_columns_;
+  PPL_ASSERT(OK());
+}
+
+template <typename Row>
+void
+Matrix<Row>::ascii_dump(std::ostream& s) const {
+  s << num_rows() << " x ";
+  s << num_columns() << "\n";
+  for (const_iterator i = begin(), i_end = end(); i !=i_end; ++i)
+    i->ascii_dump(s);
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(Row, Matrix<Row>)
+
+template <typename Row>
+bool
+Matrix<Row>::ascii_load(std::istream& s) {
+  std::string str;
+  dimension_type new_num_rows;
+  dimension_type new_num_cols;
+  if (!(s >> new_num_rows))
+    return false;
+  if (!(s >> str) || str != "x")
+    return false;
+  if (!(s >> new_num_cols))
+    return false;
+
+  for (iterator i = rows.begin(), i_end = rows.end(); i != i_end; ++i)
+    i->clear();
+
+  resize(new_num_rows, new_num_cols);
+
+  for (dimension_type row = 0; row < new_num_rows; ++row)
+    if (!rows[row].ascii_load(s))
+      return false;
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename Row>
+memory_size_type
+Matrix<Row>::external_memory_in_bytes() const {
+  return rows.external_memory_in_bytes();
+}
+
+template <typename Row>
+bool
+Matrix<Row>::OK() const {
+  for (const_iterator i = begin(), i_end = end(); i != i_end; ++i)
+    if (i->size() != num_columns_)
+      return false;
+  return true;
+}
+
+/*! \relates Parma_Polyhedra_Library::Matrix */
+template <typename Row>
+bool
+operator==(const Matrix<Row>& x, const Matrix<Row>& y) {
+  if (x.num_rows() != y.num_rows())
+    return false;
+  if (x.num_columns() != y.num_columns())
+    return false;
+  for (dimension_type i = x.num_rows(); i-- > 0; )
+    if (x[i] != y[i])
+      return false;
+  return true;
+}
+
+/*! \relates Parma_Polyhedra_Library::Matrix */
+template <typename Row>
+bool
+operator!=(const Matrix<Row>& x, const Matrix<Row>& y) {
+  return !(x == y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Matrix_templates_hh)
diff --git a/src/Matrix_types.hh b/src/Matrix_types.hh
new file mode 100644
index 0000000..40e0185
--- /dev/null
+++ b/src/Matrix_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Matrix_types_hh
+#define PPL_Matrix_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+class Matrix;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Matrix_types_hh)
diff --git a/src/Multiplication_Floating_Point_Expression.defs.hh b/src/Multiplication_Floating_Point_Expression.defs.hh
deleted file mode 100644
index fde4c27..0000000
--- a/src/Multiplication_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,251 +0,0 @@
-/* Declarations for the Multiplication_Floating_Point_Expression class and
-   its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Multiplication_Floating_Point_Expression_defs_hh
-#define PPL_Multiplication_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Multiplication_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Multiplication_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-void
-swap(Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Multiplication Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of multiplication floating-point expressions
-
-  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
-  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
-  be two linear forms, \f$\aslf\f$ and \f$\amlf\f$ two sound abstract
-  operators on linear forms such that:
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v\right)
-  \aslf
-  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
-  =
-  \left(i \asifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v}\right)v,
-  \f]
-  \f[
-  i
-  \amlf
-  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
-  =
-  \left(i \amifp i'\right)
-  + \sum_{v \in \cV}\left(i \amifp i'_{v}\right)v.
-  \f]
-  Given an expression \f$[a, b] \otimes e_{2}\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval linear form
-  \f$\linexprenv{[a, b] \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
-  as follows:
-  \f[
-  \linexprenv{[a, b] \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \left([a, b]
-  \amlf
-  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}\right)
-  \aslf
-  \left([a, b]
-  \amlf
-  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)\right)
-  \aslf
-  mf_{\mathbf{f}}[-1, 1].
-  \f].
-
-  Given an expression \f$e_{1} \otimes [a, b]\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval linear form
-  \f$\linexprenv{e_{1} \otimes [a, b]}{\rho^{\#}}{\rho^{\#}_l}\f$
-  as follows:
-  \f[
-  \linexprenv{e_{1} \otimes [a, b]}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \linexprenv{[a, b] \otimes e_{1}}{\rho^{\#}}{\rho^{\#}_l}.
-  \f]
-
-  Given an expression \f$e_{1} \otimes e_{2}\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval linear form
-  \f$\linexprenv{e_{1} \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
-  as follows:
-  \f[
-  \linexprenv{e_{1} \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \linexprenv{\iota\left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)\rho^{\#}
-  \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l},
-  \f]
-  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
-  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
-  on \f$l\f$, \f$\iota(l)\rho^{\#}\f$ is the linear form computed by calling
-  method <CODE>Floating_Point_Expression::intervalize</CODE> on \f$l\f$
-  and \f$\rho^{\#}\f$, and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
-  <CODE>Floating_Point_Expression::absolute_error</CODE>.
-
-  Even though we intervalize the first operand in the above example, the
-  actual implementation utilizes an heuristics for choosing which of the two
-  operands must be intervalized in order to obtain the most precise result.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Multiplication_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with two parameters: builds the multiplication floating point
-    expression corresponding to \p x \f$\otimes\f$ \p y.
-  */
-  Multiplication_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
-           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
-
-  //! Destructor.
-  ~Multiplication_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor.
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Note that all variables occuring in the expressions represented
-    by \p first_operand and \p second_operand MUST have an associated value in
-    \p int_store. If this precondition is not met, calling the method
-    causes an undefined behavior.
-
-    See the class description for a detailed explanation of how \p result
-    is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-		         const FP_Linear_Form_Abstract_Store& lf_store,
-                       FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Multiplication_Floating_Point_Expression<FP_Interval_Type,
-                                                       FP_Format>& y);
-
-private:
-
-  //! Pointer to the first operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
-  //! Pointer to the second operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Multiplication_Floating_Point_Expression(
-         const Multiplication_Floating_Point_Expression<FP_Interval_Type,
-                                                        FP_Format>& e);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited assignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
-  operator=(const Multiplication_Floating_Point_Expression<FP_Interval_Type,
-	    FP_Format>& e);
-
-
-}; // class Multiplication_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Multiplication_Floating_Point_Expression.inlines.hh"
-#include "Multiplication_Floating_Point_Expression.templates.hh"
-
-#endif // !defined(PPL_Multiplication_Floating_Point_Expression_defs_hh)
diff --git a/src/Multiplication_Floating_Point_Expression.inlines.hh b/src/Multiplication_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index f6f8c7c..0000000
--- a/src/Multiplication_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,71 +0,0 @@
-/* Multiplication_Floating_Point_Expression class implementation: inline
-   functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Multiplication_Floating_Point_Expression_inlines_hh
-#define PPL_Multiplication_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::Multiplication_Floating_Point_Expression(
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y)
-  : first_operand(x), second_operand(y) {
-  assert(x != 0);
-  assert(y != 0);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::~Multiplication_Floating_Point_Expression() {
-  delete first_operand;
-  delete second_operand;
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Multiplication_Floating_Point_Expression<FP_Interval_Type,
-                                                  FP_Format>& y) {
-  using std::swap;
-  swap(first_operand, y.first_operand);
-  swap(second_operand, y.second_operand);
-}
-
-/*! \relates Multiplication_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Multiplication_Floating_Point_Expression_inlines_hh)
diff --git a/src/Multiplication_Floating_Point_Expression.templates.hh b/src/Multiplication_Floating_Point_Expression.templates.hh
deleted file mode 100644
index e182317..0000000
--- a/src/Multiplication_Floating_Point_Expression.templates.hh
+++ /dev/null
@@ -1,109 +0,0 @@
-/* Multiplication_Floating_Point_Expression class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Multiplication_Floating_Point_Expression_templates_hh
-#define PPL_Multiplication_Floating_Point_Expression_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-bool Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store& int_store,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  /*
-    FIXME: We currently adopt the "Interval-Size Local" strategy in order to
-    decide which of the two linear forms must be intervalized, as described
-    in Section 6.2.4 ("Multiplication Strategies") of Antoine Mine's Ph.D.
-    thesis "Weakly Relational Numerical Abstract Domains".
-    In this Section are also described other multiplication strategies, such
-    as All-Cases, Relative-Size Local, Simplification-Driven Global and
-    Homogeneity Global.
-  */
-
-  // Here we choose which of the two linear forms must be intervalized.
-
-  // true if we intervalize the first form, false if we intervalize the second.
-  bool intervalize_first;
-  FP_Linear_Form linearized_first_operand;
-  if (!first_operand->linearize(int_store, lf_store,
-                               linearized_first_operand))
-    return false;
-  FP_Interval_Type intervalized_first_operand;
-  this->intervalize(linearized_first_operand, int_store,
-                    intervalized_first_operand);
-  FP_Linear_Form linearized_second_operand;
-  if (!second_operand->linearize(int_store, lf_store,
-                                linearized_second_operand))
-    return false;
-  FP_Interval_Type intervalized_second_operand;
-  this->intervalize(linearized_second_operand, int_store,
-                    intervalized_second_operand);
-
-  // FIXME: we are not sure that what we do here is policy-proof.
-  if (intervalized_first_operand.is_bounded()) {
-    if (intervalized_second_operand.is_bounded()) {
-      boundary_type first_interval_size
-        = intervalized_first_operand.upper()
-        - intervalized_first_operand.lower();
-      boundary_type second_interval_size
-        = intervalized_second_operand.upper()
-        - intervalized_second_operand.lower();
-      if (first_interval_size <= second_interval_size)
-        intervalize_first = true;
-      else
-        intervalize_first = false;
-    }
-    else
-      intervalize_first = true;
-  }
-  else {
-    if (intervalized_second_operand.is_bounded())
-      intervalize_first = false;
-    else
-      return false;
-  }
-
-  // Here we do the actual computation.
-  // For optimizing, we store the relative error directly into result.
-  if (intervalize_first) {
-    relative_error(linearized_second_operand, result);
-    linearized_second_operand *= intervalized_first_operand;
-    result *= intervalized_first_operand;
-    result += linearized_second_operand;
-  }
-  else {
-    relative_error(linearized_first_operand, result);
-    linearized_first_operand *= intervalized_second_operand;
-    result *= intervalized_second_operand;
-    result += linearized_first_operand;
-  }
-
-  result += this->absolute_error;
-  return !this->overflows(result);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Multiplication_Floating_Point_Expression_templates_hh)
diff --git a/src/Multiplication_Floating_Point_Expression.types.hh b/src/Multiplication_Floating_Point_Expression.types.hh
deleted file mode 100644
index b4c0b65..0000000
--- a/src/Multiplication_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Multiplication_Floating_Point_Expression_types_hh
-#define PPL_Multiplication_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Multiplication_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Multiplication_Floating_Point_Expression_types_hh)
diff --git a/src/Multiplication_Floating_Point_Expression_defs.hh b/src/Multiplication_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..d660399
--- /dev/null
+++ b/src/Multiplication_Floating_Point_Expression_defs.hh
@@ -0,0 +1,251 @@
+/* Declarations for the Multiplication_Floating_Point_Expression class and
+   its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Multiplication_Floating_Point_Expression_defs_hh
+#define PPL_Multiplication_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Multiplication_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Multiplication_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+void
+swap(Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Multiplication Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of multiplication floating-point expressions
+
+  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
+  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
+  be two linear forms, \f$\aslf\f$ and \f$\amlf\f$ two sound abstract
+  operators on linear forms such that:
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v\right)
+  \aslf
+  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
+  =
+  \left(i \asifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v}\right)v,
+  \f]
+  \f[
+  i
+  \amlf
+  \left(i' + \sum_{v \in \cV}i'_{v}v\right)
+  =
+  \left(i \amifp i'\right)
+  + \sum_{v \in \cV}\left(i \amifp i'_{v}\right)v.
+  \f]
+  Given an expression \f$[a, b] \otimes e_{2}\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval linear form
+  \f$\linexprenv{[a, b] \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
+  as follows:
+  \f[
+  \linexprenv{[a, b] \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \left([a, b]
+  \amlf
+  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}\right)
+  \aslf
+  \left([a, b]
+  \amlf
+  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)\right)
+  \aslf
+  mf_{\mathbf{f}}[-1, 1].
+  \f].
+
+  Given an expression \f$e_{1} \otimes [a, b]\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval linear form
+  \f$\linexprenv{e_{1} \otimes [a, b]}{\rho^{\#}}{\rho^{\#}_l}\f$
+  as follows:
+  \f[
+  \linexprenv{e_{1} \otimes [a, b]}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \linexprenv{[a, b] \otimes e_{1}}{\rho^{\#}}{\rho^{\#}_l}.
+  \f]
+
+  Given an expression \f$e_{1} \otimes e_{2}\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval linear form
+  \f$\linexprenv{e_{1} \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
+  as follows:
+  \f[
+  \linexprenv{e_{1} \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \linexprenv{\iota\left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)\rho^{\#}
+  \otimes e_{2}}{\rho^{\#}}{\rho^{\#}_l},
+  \f]
+  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
+  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
+  on \f$l\f$, \f$\iota(l)\rho^{\#}\f$ is the linear form computed by calling
+  method <CODE>Floating_Point_Expression::intervalize</CODE> on \f$l\f$
+  and \f$\rho^{\#}\f$, and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
+  <CODE>Floating_Point_Expression::absolute_error</CODE>.
+
+  Even though we intervalize the first operand in the above example, the
+  actual implementation utilizes an heuristics for choosing which of the two
+  operands must be intervalized in order to obtain the most precise result.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Multiplication_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::boundary_type from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with two parameters: builds the multiplication floating point
+    expression corresponding to \p x \f$\otimes\f$ \p y.
+  */
+  Multiplication_Floating_Point_Expression(
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
+
+  //! Destructor.
+  ~Multiplication_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor.
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Note that all variables occuring in the expressions represented
+    by \p first_operand and \p second_operand MUST have an associated value in
+    \p int_store. If this precondition is not met, calling the method
+    causes an undefined behavior.
+
+    See the class description for a detailed explanation of how \p result
+    is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                         const FP_Linear_Form_Abstract_Store& lf_store,
+                       FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Multiplication_Floating_Point_Expression<FP_Interval_Type,
+                                                       FP_Format>& y);
+
+private:
+
+  //! Pointer to the first operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
+  //! Pointer to the second operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Multiplication_Floating_Point_Expression(
+         const Multiplication_Floating_Point_Expression<FP_Interval_Type,
+                                                        FP_Format>& e);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited assignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
+  operator=(const Multiplication_Floating_Point_Expression<FP_Interval_Type,
+            FP_Format>& e);
+
+
+}; // class Multiplication_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Multiplication_Floating_Point_Expression_inlines.hh"
+#include "Multiplication_Floating_Point_Expression_templates.hh"
+
+#endif // !defined(PPL_Multiplication_Floating_Point_Expression_defs_hh)
diff --git a/src/Multiplication_Floating_Point_Expression_inlines.hh b/src/Multiplication_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..4c4ffaf
--- /dev/null
+++ b/src/Multiplication_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,71 @@
+/* Multiplication_Floating_Point_Expression class implementation: inline
+   functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Multiplication_Floating_Point_Expression_inlines_hh
+#define PPL_Multiplication_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::Multiplication_Floating_Point_Expression(
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y)
+  : first_operand(x), second_operand(y) {
+  assert(x != 0);
+  assert(y != 0);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::~Multiplication_Floating_Point_Expression() {
+  delete first_operand;
+  delete second_operand;
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Multiplication_Floating_Point_Expression<FP_Interval_Type,
+                                                  FP_Format>& y) {
+  using std::swap;
+  swap(first_operand, y.first_operand);
+  swap(second_operand, y.second_operand);
+}
+
+/*! \relates Multiplication_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Multiplication_Floating_Point_Expression_inlines_hh)
diff --git a/src/Multiplication_Floating_Point_Expression_templates.hh b/src/Multiplication_Floating_Point_Expression_templates.hh
new file mode 100644
index 0000000..762d7bd
--- /dev/null
+++ b/src/Multiplication_Floating_Point_Expression_templates.hh
@@ -0,0 +1,109 @@
+/* Multiplication_Floating_Point_Expression class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Multiplication_Floating_Point_Expression_templates_hh
+#define PPL_Multiplication_Floating_Point_Expression_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+bool Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store& int_store,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  /*
+    FIXME: We currently adopt the "Interval-Size Local" strategy in order to
+    decide which of the two linear forms must be intervalized, as described
+    in Section 6.2.4 ("Multiplication Strategies") of Antoine Mine's Ph.D.
+    thesis "Weakly Relational Numerical Abstract Domains".
+    In this Section are also described other multiplication strategies, such
+    as All-Cases, Relative-Size Local, Simplification-Driven Global and
+    Homogeneity Global.
+  */
+
+  // Here we choose which of the two linear forms must be intervalized.
+
+  // true if we intervalize the first form, false if we intervalize the second.
+  bool intervalize_first;
+  FP_Linear_Form linearized_first_operand;
+  if (!first_operand->linearize(int_store, lf_store,
+                               linearized_first_operand))
+    return false;
+  FP_Interval_Type intervalized_first_operand;
+  this->intervalize(linearized_first_operand, int_store,
+                    intervalized_first_operand);
+  FP_Linear_Form linearized_second_operand;
+  if (!second_operand->linearize(int_store, lf_store,
+                                linearized_second_operand))
+    return false;
+  FP_Interval_Type intervalized_second_operand;
+  this->intervalize(linearized_second_operand, int_store,
+                    intervalized_second_operand);
+
+  // FIXME: we are not sure that what we do here is policy-proof.
+  if (intervalized_first_operand.is_bounded()) {
+    if (intervalized_second_operand.is_bounded()) {
+      boundary_type first_interval_size
+        = intervalized_first_operand.upper()
+        - intervalized_first_operand.lower();
+      boundary_type second_interval_size
+        = intervalized_second_operand.upper()
+        - intervalized_second_operand.lower();
+      if (first_interval_size <= second_interval_size)
+        intervalize_first = true;
+      else
+        intervalize_first = false;
+    }
+    else
+      intervalize_first = true;
+  }
+  else {
+    if (intervalized_second_operand.is_bounded())
+      intervalize_first = false;
+    else
+      return false;
+  }
+
+  // Here we do the actual computation.
+  // For optimizing, we store the relative error directly into result.
+  if (intervalize_first) {
+    relative_error(linearized_second_operand, result);
+    linearized_second_operand *= intervalized_first_operand;
+    result *= intervalized_first_operand;
+    result += linearized_second_operand;
+  }
+  else {
+    relative_error(linearized_first_operand, result);
+    linearized_first_operand *= intervalized_second_operand;
+    result *= intervalized_second_operand;
+    result += linearized_first_operand;
+  }
+
+  result += this->absolute_error;
+  return !this->overflows(result);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Multiplication_Floating_Point_Expression_templates_hh)
diff --git a/src/Multiplication_Floating_Point_Expression_types.hh b/src/Multiplication_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..5e00f29
--- /dev/null
+++ b/src/Multiplication_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Multiplication_Floating_Point_Expression_types_hh
+#define PPL_Multiplication_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Multiplication_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Multiplication_Floating_Point_Expression_types_hh)
diff --git a/src/NNC_Polyhedron.cc b/src/NNC_Polyhedron.cc
index e20ca76..65fb421 100644
--- a/src/NNC_Polyhedron.cc
+++ b/src/NNC_Polyhedron.cc
@@ -1,6 +1,6 @@
 /* NNC_Polyhedron class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,9 +22,9 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "NNC_Polyhedron.defs.hh"
-#include "C_Polyhedron.defs.hh"
-#include "Grid.defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "Grid_defs.hh"
 #include "algorithms.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
@@ -43,7 +43,7 @@ PPL::NNC_Polyhedron::NNC_Polyhedron(const Congruence_System& cgs)
                                               "the space dimension of cgs "
                                               "exceeds the maximum allowed "
                                               "space dimension"),
-	       UNIVERSE) {
+               UNIVERSE) {
   add_congruences(cgs);
   PPL_ASSERT_HEAVY(OK());
 }
@@ -56,7 +56,7 @@ PPL::NNC_Polyhedron::NNC_Polyhedron(Congruence_System& cgs, Recycle_Input)
                                               "the space dimension of cgs "
                                               "exceeds the maximum allowed "
                                               "space dimension"),
-	       UNIVERSE) {
+               UNIVERSE) {
   add_congruences(cgs);
   PPL_ASSERT_HEAVY(OK());
 }
@@ -69,7 +69,7 @@ PPL::NNC_Polyhedron::NNC_Polyhedron(const Grid& grid, Complexity_Class)
                                               "the space dimension of grid "
                                               "exceeds the maximum allowed "
                                               "space dimension"),
-	       UNIVERSE) {
+               UNIVERSE) {
   add_constraints(grid.constraints());
 }
 
diff --git a/src/NNC_Polyhedron.defs.hh b/src/NNC_Polyhedron.defs.hh
deleted file mode 100644
index 19ba641..0000000
--- a/src/NNC_Polyhedron.defs.hh
+++ /dev/null
@@ -1,256 +0,0 @@
-/* NNC_Polyhedron class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_NNC_Polyhedron_defs_hh
-#define PPL_NNC_Polyhedron_defs_hh 1
-
-#include "C_Polyhedron.types.hh"
-#include "NNC_Polyhedron.types.hh"
-#include "Polyhedron.defs.hh"
-#include "Grid.types.hh"
-
-//! A not necessarily closed convex polyhedron.
-/*! \ingroup PPL_CXX_interface
-    An object of the class NNC_Polyhedron represents a
-    <EM>not necessarily closed</EM> (NNC) convex polyhedron
-    in the vector space \f$\Rset^n\f$.
-
-    \note
-    Since NNC polyhedra are a generalization of closed polyhedra,
-    any object of the class C_Polyhedron can be (explicitly) converted
-    into an object of the class NNC_Polyhedron.
-    The reason for defining two different classes is that objects of
-    the class C_Polyhedron are characterized by a more efficient
-    implementation, requiring less time and memory resources.
-*/
-class Parma_Polyhedra_Library::NNC_Polyhedron : public Polyhedron {
-public:
-  //! Builds either the universe or the empty NNC polyhedron.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the NNC polyhedron;
-
-    \param kind
-    Specifies whether a universe or an empty NNC polyhedron should be built.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space dimension.
-
-    Both parameters are optional:
-    by default, a 0-dimension space universe NNC polyhedron is built.
-  */
-  explicit NNC_Polyhedron(dimension_type num_dimensions = 0,
-			  Degenerate_Element kind = UNIVERSE);
-
-  //! Builds an NNC polyhedron from a system of constraints.
-  /*!
-    The polyhedron inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints defining the polyhedron.
-  */
-  explicit NNC_Polyhedron(const Constraint_System& cs);
-
-  //! Builds an NNC polyhedron recycling a system of constraints.
-  /*!
-    The polyhedron inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-  */
-  NNC_Polyhedron(Constraint_System& cs, Recycle_Input dummy);
-
-  //! Builds an NNC polyhedron from a system of generators.
-  /*!
-    The polyhedron inherits the space dimension of the generator system.
-
-    \param gs
-    The system of generators defining the polyhedron.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-  */
-  explicit NNC_Polyhedron(const Generator_System& gs);
-
-  //! Builds an NNC polyhedron recycling a system of generators.
-  /*!
-    The polyhedron inherits the space dimension of the generator system.
-
-    \param gs
-    The system of generators defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-  */
-  NNC_Polyhedron(Generator_System& gs, Recycle_Input dummy);
-
-  //! Builds an NNC polyhedron from a system of congruences.
-  /*!
-    The polyhedron inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-  */
-  explicit NNC_Polyhedron(const Congruence_System& cgs);
-
-  //! Builds an NNC polyhedron recycling a system of congruences.
-  /*!
-    The polyhedron inherits the space dimension of the congruence
-    system.
-
-    \param cgs
-    The system of congruences defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-  */
-  NNC_Polyhedron(Congruence_System& cgs, Recycle_Input dummy);
-
-  //! Builds an NNC polyhedron from the C polyhedron \p y.
-  /*!
-    \param y
-    The C polyhedron to be used;
-
-    \param complexity
-    This argument is ignored.
-  */
-  explicit NNC_Polyhedron(const C_Polyhedron& y,
-                          Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds an NNC polyhedron out of a box.
-  /*!
-    The polyhedron inherits the space dimension of the box
-    and is the most precise that includes the box.
-
-    \param box
-    The box representing the polyhedron to be built;
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum allowed
-    space dimension.
-  */
-  template <typename Interval>
-  explicit NNC_Polyhedron(const Box<Interval>& box,
-                          Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds an NNC polyhedron out of a grid.
-  /*!
-    The polyhedron inherits the space dimension of the grid
-    and is the most precise that includes the grid.
-
-    \param grid
-    The grid used to build the polyhedron.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-  */
-  explicit NNC_Polyhedron(const Grid& grid,
-                          Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a NNC polyhedron out of a BD shape.
-  /*!
-    The polyhedron inherits the space dimension of the BD shape
-    and is the most precise that includes the BD shape.
-
-    \param bd
-    The BD shape used to build the polyhedron.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-  */
-  template <typename U>
-  explicit NNC_Polyhedron(const BD_Shape<U>& bd,
-                          Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a NNC polyhedron out of an octagonal shape.
-  /*!
-    The polyhedron inherits the space dimension of the octagonal shape
-    and is the most precise that includes the octagonal shape.
-
-    \param os
-    The octagonal shape used to build the polyhedron.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-  */
-  template <typename U>
-  explicit NNC_Polyhedron(const Octagonal_Shape<U>& os,
-                          Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Ordinary copy constructor.
-  NNC_Polyhedron(const NNC_Polyhedron& y,
-                 Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator.
-    (\p *this and \p y can be dimension-incompatible.)
-  */
-  NNC_Polyhedron& operator=(const NNC_Polyhedron& y);
-
-  //! Assigns to \p *this the C polyhedron \p y.
-  NNC_Polyhedron& operator=(const C_Polyhedron& y);
-
-  //! Destructor.
-  ~NNC_Polyhedron();
-
-  /*! \brief
-    If the poly-hull of \p *this and \p y is exact it is assigned
-    to \p *this and <CODE>true</CODE> is returned,
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool poly_hull_assign_if_exact(const NNC_Polyhedron& y);
-
-  //! Same as poly_hull_assign_if_exact(y).
-  bool upper_bound_assign_if_exact(const NNC_Polyhedron& y);
-};
-
-#include "NNC_Polyhedron.inlines.hh"
-
-#endif // !defined(PPL_NNC_Polyhedron_defs_hh)
diff --git a/src/NNC_Polyhedron.inlines.hh b/src/NNC_Polyhedron.inlines.hh
deleted file mode 100644
index 33ca6bd..0000000
--- a/src/NNC_Polyhedron.inlines.hh
+++ /dev/null
@@ -1,153 +0,0 @@
-/* NNC_Polyhedron class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_NNC_Polyhedron_inlines_hh
-#define PPL_NNC_Polyhedron_inlines_hh 1
-
-#include "C_Polyhedron.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline
-NNC_Polyhedron::~NNC_Polyhedron() {
-}
-
-inline
-NNC_Polyhedron::NNC_Polyhedron(dimension_type num_dimensions,
-			       Degenerate_Element kind)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_space_dimension_overflow(num_dimensions,
-                                              NOT_NECESSARILY_CLOSED,
-                                              "NNC_Polyhedron(n, k)",
-                                              "n exceeds the maximum "
-                                              "allowed space dimension"),
-	       kind) {
-}
-
-inline
-NNC_Polyhedron::NNC_Polyhedron(const Constraint_System& cs)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(cs, NOT_NECESSARILY_CLOSED,
-                                                  "NNC_Polyhedron(cs)",
-                                                  "the space dimension of cs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension")) {
-}
-
-inline
-NNC_Polyhedron::NNC_Polyhedron(Constraint_System& cs, Recycle_Input)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(cs, NOT_NECESSARILY_CLOSED,
-                                                  "NNC_Polyhedron(cs, recycle)",
-                                                  "the space dimension of cs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension"),
-	       Recycle_Input()) {
-}
-
-inline
-NNC_Polyhedron::NNC_Polyhedron(const Generator_System& gs)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(gs, NOT_NECESSARILY_CLOSED,
-                                                  "NNC_Polyhedron(gs)",
-                                                  "the space dimension of gs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension")) {
-}
-
-inline
-NNC_Polyhedron::NNC_Polyhedron(Generator_System& gs, Recycle_Input)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(gs, NOT_NECESSARILY_CLOSED,
-                                                  "NNC_Polyhedron(gs, recycle)",
-                                                  "the space dimension of gs "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension"),
-	       Recycle_Input()) {
-}
-
-template <typename Interval>
-inline
-NNC_Polyhedron::NNC_Polyhedron(const Box<Interval>& box, Complexity_Class)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_obj_space_dimension_overflow(box, NOT_NECESSARILY_CLOSED,
-                                                  "NNC_Polyhedron(box)",
-                                                  "the space dimension of box "
-                                                  "exceeds the maximum allowed "
-                                                  "space dimension")) {
-}
-
-template <typename U>
-inline
-NNC_Polyhedron::NNC_Polyhedron(const BD_Shape<U>& bd, Complexity_Class)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_space_dimension_overflow(bd.space_dimension(),
-                                              NOT_NECESSARILY_CLOSED,
-                                              "NNC_Polyhedron(bd)",
-                                              "the space dimension of bd "
-                                              "exceeds the maximum allowed "
-                                              "space dimension"),
-               UNIVERSE) {
-  add_constraints(bd.constraints());
-}
-
-template <typename U>
-inline
-NNC_Polyhedron::NNC_Polyhedron(const Octagonal_Shape<U>& os, Complexity_Class)
-  : Polyhedron(NOT_NECESSARILY_CLOSED,
-               check_space_dimension_overflow(os.space_dimension(),
-                                              NOT_NECESSARILY_CLOSED,
-                                              "NNC_Polyhedron(os)",
-                                              "the space dimension of os "
-                                              "exceeds the maximum allowed "
-                                              "space dimension"),
-               UNIVERSE) {
-  add_constraints(os.constraints());
-}
-
-inline
-NNC_Polyhedron::NNC_Polyhedron(const NNC_Polyhedron& y, Complexity_Class)
-  : Polyhedron(y) {
-}
-
-inline NNC_Polyhedron&
-NNC_Polyhedron::operator=(const NNC_Polyhedron& y) {
-  Polyhedron::operator=(y);
-  return *this;
-}
-
-inline NNC_Polyhedron&
-NNC_Polyhedron::operator=(const C_Polyhedron& y) {
-  NNC_Polyhedron nnc_y(y);
-  m_swap(nnc_y);
-  return *this;
-}
-
-inline bool
-NNC_Polyhedron::upper_bound_assign_if_exact(const NNC_Polyhedron& y) {
-  return poly_hull_assign_if_exact(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_NNC_Polyhedron_inlines_hh)
diff --git a/src/NNC_Polyhedron.types.hh b/src/NNC_Polyhedron.types.hh
deleted file mode 100644
index 5eb28b2..0000000
--- a/src/NNC_Polyhedron.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_NNC_Polyhedron_types_hh
-#define PPL_NNC_Polyhedron_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class NNC_Polyhedron;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_NNC_Polyhedron_types_hh)
diff --git a/src/NNC_Polyhedron_defs.hh b/src/NNC_Polyhedron_defs.hh
new file mode 100644
index 0000000..67c7850
--- /dev/null
+++ b/src/NNC_Polyhedron_defs.hh
@@ -0,0 +1,256 @@
+/* NNC_Polyhedron class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_NNC_Polyhedron_defs_hh
+#define PPL_NNC_Polyhedron_defs_hh 1
+
+#include "C_Polyhedron_types.hh"
+#include "NNC_Polyhedron_types.hh"
+#include "Polyhedron_defs.hh"
+#include "Grid_types.hh"
+
+//! A not necessarily closed convex polyhedron.
+/*! \ingroup PPL_CXX_interface
+    An object of the class NNC_Polyhedron represents a
+    <EM>not necessarily closed</EM> (NNC) convex polyhedron
+    in the vector space \f$\Rset^n\f$.
+
+    \note
+    Since NNC polyhedra are a generalization of closed polyhedra,
+    any object of the class C_Polyhedron can be (explicitly) converted
+    into an object of the class NNC_Polyhedron.
+    The reason for defining two different classes is that objects of
+    the class C_Polyhedron are characterized by a more efficient
+    implementation, requiring less time and memory resources.
+*/
+class Parma_Polyhedra_Library::NNC_Polyhedron : public Polyhedron {
+public:
+  //! Builds either the universe or the empty NNC polyhedron.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the NNC polyhedron;
+
+    \param kind
+    Specifies whether a universe or an empty NNC polyhedron should be built.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space dimension.
+
+    Both parameters are optional:
+    by default, a 0-dimension space universe NNC polyhedron is built.
+  */
+  explicit NNC_Polyhedron(dimension_type num_dimensions = 0,
+                          Degenerate_Element kind = UNIVERSE);
+
+  //! Builds an NNC polyhedron from a system of constraints.
+  /*!
+    The polyhedron inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints defining the polyhedron.
+  */
+  explicit NNC_Polyhedron(const Constraint_System& cs);
+
+  //! Builds an NNC polyhedron recycling a system of constraints.
+  /*!
+    The polyhedron inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+  */
+  NNC_Polyhedron(Constraint_System& cs, Recycle_Input dummy);
+
+  //! Builds an NNC polyhedron from a system of generators.
+  /*!
+    The polyhedron inherits the space dimension of the generator system.
+
+    \param gs
+    The system of generators defining the polyhedron.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+  */
+  explicit NNC_Polyhedron(const Generator_System& gs);
+
+  //! Builds an NNC polyhedron recycling a system of generators.
+  /*!
+    The polyhedron inherits the space dimension of the generator system.
+
+    \param gs
+    The system of generators defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+  */
+  NNC_Polyhedron(Generator_System& gs, Recycle_Input dummy);
+
+  //! Builds an NNC polyhedron from a system of congruences.
+  /*!
+    The polyhedron inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+  */
+  explicit NNC_Polyhedron(const Congruence_System& cgs);
+
+  //! Builds an NNC polyhedron recycling a system of congruences.
+  /*!
+    The polyhedron inherits the space dimension of the congruence
+    system.
+
+    \param cgs
+    The system of congruences defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+  */
+  NNC_Polyhedron(Congruence_System& cgs, Recycle_Input dummy);
+
+  //! Builds an NNC polyhedron from the C polyhedron \p y.
+  /*!
+    \param y
+    The C polyhedron to be used;
+
+    \param complexity
+    This argument is ignored.
+  */
+  explicit NNC_Polyhedron(const C_Polyhedron& y,
+                          Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds an NNC polyhedron out of a box.
+  /*!
+    The polyhedron inherits the space dimension of the box
+    and is the most precise that includes the box.
+
+    \param box
+    The box representing the polyhedron to be built;
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum allowed
+    space dimension.
+  */
+  template <typename Interval>
+  explicit NNC_Polyhedron(const Box<Interval>& box,
+                          Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds an NNC polyhedron out of a grid.
+  /*!
+    The polyhedron inherits the space dimension of the grid
+    and is the most precise that includes the grid.
+
+    \param grid
+    The grid used to build the polyhedron.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+  */
+  explicit NNC_Polyhedron(const Grid& grid,
+                          Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a NNC polyhedron out of a BD shape.
+  /*!
+    The polyhedron inherits the space dimension of the BD shape
+    and is the most precise that includes the BD shape.
+
+    \param bd
+    The BD shape used to build the polyhedron.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+  */
+  template <typename U>
+  explicit NNC_Polyhedron(const BD_Shape<U>& bd,
+                          Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a NNC polyhedron out of an octagonal shape.
+  /*!
+    The polyhedron inherits the space dimension of the octagonal shape
+    and is the most precise that includes the octagonal shape.
+
+    \param os
+    The octagonal shape used to build the polyhedron.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+  */
+  template <typename U>
+  explicit NNC_Polyhedron(const Octagonal_Shape<U>& os,
+                          Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Ordinary copy constructor.
+  NNC_Polyhedron(const NNC_Polyhedron& y,
+                 Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator.
+    (\p *this and \p y can be dimension-incompatible.)
+  */
+  NNC_Polyhedron& operator=(const NNC_Polyhedron& y);
+
+  //! Assigns to \p *this the C polyhedron \p y.
+  NNC_Polyhedron& operator=(const C_Polyhedron& y);
+
+  //! Destructor.
+  ~NNC_Polyhedron();
+
+  /*! \brief
+    If the poly-hull of \p *this and \p y is exact it is assigned
+    to \p *this and <CODE>true</CODE> is returned,
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool poly_hull_assign_if_exact(const NNC_Polyhedron& y);
+
+  //! Same as poly_hull_assign_if_exact(y).
+  bool upper_bound_assign_if_exact(const NNC_Polyhedron& y);
+};
+
+#include "NNC_Polyhedron_inlines.hh"
+
+#endif // !defined(PPL_NNC_Polyhedron_defs_hh)
diff --git a/src/NNC_Polyhedron_inlines.hh b/src/NNC_Polyhedron_inlines.hh
new file mode 100644
index 0000000..3ef89ad
--- /dev/null
+++ b/src/NNC_Polyhedron_inlines.hh
@@ -0,0 +1,153 @@
+/* NNC_Polyhedron class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_NNC_Polyhedron_inlines_hh
+#define PPL_NNC_Polyhedron_inlines_hh 1
+
+#include "C_Polyhedron_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline
+NNC_Polyhedron::~NNC_Polyhedron() {
+}
+
+inline
+NNC_Polyhedron::NNC_Polyhedron(dimension_type num_dimensions,
+                               Degenerate_Element kind)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_space_dimension_overflow(num_dimensions,
+                                              NOT_NECESSARILY_CLOSED,
+                                              "NNC_Polyhedron(n, k)",
+                                              "n exceeds the maximum "
+                                              "allowed space dimension"),
+               kind) {
+}
+
+inline
+NNC_Polyhedron::NNC_Polyhedron(const Constraint_System& cs)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(cs, NOT_NECESSARILY_CLOSED,
+                                                  "NNC_Polyhedron(cs)",
+                                                  "the space dimension of cs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension")) {
+}
+
+inline
+NNC_Polyhedron::NNC_Polyhedron(Constraint_System& cs, Recycle_Input)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(cs, NOT_NECESSARILY_CLOSED,
+                                                  "NNC_Polyhedron(cs, recycle)",
+                                                  "the space dimension of cs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension"),
+               Recycle_Input()) {
+}
+
+inline
+NNC_Polyhedron::NNC_Polyhedron(const Generator_System& gs)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(gs, NOT_NECESSARILY_CLOSED,
+                                                  "NNC_Polyhedron(gs)",
+                                                  "the space dimension of gs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension")) {
+}
+
+inline
+NNC_Polyhedron::NNC_Polyhedron(Generator_System& gs, Recycle_Input)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(gs, NOT_NECESSARILY_CLOSED,
+                                                  "NNC_Polyhedron(gs, recycle)",
+                                                  "the space dimension of gs "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension"),
+               Recycle_Input()) {
+}
+
+template <typename Interval>
+inline
+NNC_Polyhedron::NNC_Polyhedron(const Box<Interval>& box, Complexity_Class)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_obj_space_dimension_overflow(box, NOT_NECESSARILY_CLOSED,
+                                                  "NNC_Polyhedron(box)",
+                                                  "the space dimension of box "
+                                                  "exceeds the maximum allowed "
+                                                  "space dimension")) {
+}
+
+template <typename U>
+inline
+NNC_Polyhedron::NNC_Polyhedron(const BD_Shape<U>& bd, Complexity_Class)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_space_dimension_overflow(bd.space_dimension(),
+                                              NOT_NECESSARILY_CLOSED,
+                                              "NNC_Polyhedron(bd)",
+                                              "the space dimension of bd "
+                                              "exceeds the maximum allowed "
+                                              "space dimension"),
+               UNIVERSE) {
+  add_constraints(bd.constraints());
+}
+
+template <typename U>
+inline
+NNC_Polyhedron::NNC_Polyhedron(const Octagonal_Shape<U>& os, Complexity_Class)
+  : Polyhedron(NOT_NECESSARILY_CLOSED,
+               check_space_dimension_overflow(os.space_dimension(),
+                                              NOT_NECESSARILY_CLOSED,
+                                              "NNC_Polyhedron(os)",
+                                              "the space dimension of os "
+                                              "exceeds the maximum allowed "
+                                              "space dimension"),
+               UNIVERSE) {
+  add_constraints(os.constraints());
+}
+
+inline
+NNC_Polyhedron::NNC_Polyhedron(const NNC_Polyhedron& y, Complexity_Class)
+  : Polyhedron(y) {
+}
+
+inline NNC_Polyhedron&
+NNC_Polyhedron::operator=(const NNC_Polyhedron& y) {
+  Polyhedron::operator=(y);
+  return *this;
+}
+
+inline NNC_Polyhedron&
+NNC_Polyhedron::operator=(const C_Polyhedron& y) {
+  NNC_Polyhedron nnc_y(y);
+  m_swap(nnc_y);
+  return *this;
+}
+
+inline bool
+NNC_Polyhedron::upper_bound_assign_if_exact(const NNC_Polyhedron& y) {
+  return poly_hull_assign_if_exact(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_NNC_Polyhedron_inlines_hh)
diff --git a/src/NNC_Polyhedron_types.hh b/src/NNC_Polyhedron_types.hh
new file mode 100644
index 0000000..23fd390
--- /dev/null
+++ b/src/NNC_Polyhedron_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_NNC_Polyhedron_types_hh
+#define PPL_NNC_Polyhedron_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class NNC_Polyhedron;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_NNC_Polyhedron_types_hh)
diff --git a/src/Numeric_Format.defs.hh b/src/Numeric_Format.defs.hh
deleted file mode 100644
index 75dde47..0000000
--- a/src/Numeric_Format.defs.hh
+++ /dev/null
@@ -1,38 +0,0 @@
-/* Numeric format.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Numeric_Format_defs_hh
-#define PPL_Numeric_Format_defs_hh 1
-
-#include "Result.defs.hh"
-#include "fpu.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-class Numeric_Format {
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Float_defs_hh)
-
diff --git a/src/Numeric_Format_defs.hh b/src/Numeric_Format_defs.hh
new file mode 100644
index 0000000..fcc1b7c
--- /dev/null
+++ b/src/Numeric_Format_defs.hh
@@ -0,0 +1,38 @@
+/* Numeric format.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Numeric_Format_defs_hh
+#define PPL_Numeric_Format_defs_hh 1
+
+#include "Result_defs.hh"
+#include "fpu_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+class Numeric_Format {
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Float_defs_hh)
+
diff --git a/src/OR_Matrix.defs.hh b/src/OR_Matrix.defs.hh
deleted file mode 100644
index 9e67403..0000000
--- a/src/OR_Matrix.defs.hh
+++ /dev/null
@@ -1,610 +0,0 @@
-/* OR_Matrix class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_OR_Matrix_defs_hh
-#define PPL_OR_Matrix_defs_hh 1
-
-#include "globals.defs.hh"
-#include "OR_Matrix.types.hh"
-#include "DB_Row.defs.hh"
-#include "Checked_Number.defs.hh"
-#include <cstddef>
-#include <iosfwd>
-
-#ifndef PPL_OR_MATRIX_EXTRA_DEBUG
-#ifdef PPL_ABI_BREAKING_EXTRA_DEBUG
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  When PPL_OR_MATRIX_EXTRA_DEBUG evaluates to <CODE>true</CODE>, each
-  instance of the class OR_Matrix::Pseudo_Row carries its own size;
-  this enables extra consistency checks to be performed.
-  \ingroup PPL_CXX_interface
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define PPL_OR_MATRIX_EXTRA_DEBUG 1
-#else // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
-#define PPL_OR_MATRIX_EXTRA_DEBUG 0
-#endif // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
-#endif // !defined(PPL_OR_MATRIX_EXTRA_DEBUG)
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-bool operator==(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
-
-namespace IO_Operators {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-std::ostream&
-operator<<(std::ostream& s, const OR_Matrix<T>& m);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A matrix representing octagonal constraints.
-/*!
-  An OR_Matrix object is a DB_Row object that allows
-  the representation of a \em pseudo-triangular matrix,
-  like the following:
-
-<PRE>
-         _ _
-   0    |_|_|
-   1    |_|_|_ _
-   2    |_|_|_|_|
-   3    |_|_|_|_|_ _
-   4    |_|_|_|_|_|_|
-   5    |_|_|_|_|_|_|
-         . . .
-         _ _ _ _ _ _       _
- 2n-2   |_|_|_|_|_|_| ... |_|
- 2n-1   |_|_|_|_|_|_| ... |_|
-         0 1 2 3 4 5  ... 2n-1
-
-</PRE>
-
-  It is characterized by parameter n that defines the structure,
-  and such that there are 2*n rows (and 2*n columns).
-  It provides row_iterators for the access to the rows
-  and element_iterators for the access to the elements.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-template <typename T>
-class Parma_Polyhedra_Library::OR_Matrix {
-private:
-  /*! \brief
-    An object that behaves like a matrix's row with respect to
-    the subscript operators.
-  */
-  template <typename U>
-  class Pseudo_Row {
-  public:
-    /*! \brief
-      Copy constructor allowing the construction of a const pseudo-row
-      from a non-const pseudo-row.
-      Ordinary copy constructor.
-    */
-    template <typename V>
-    Pseudo_Row(const Pseudo_Row<V>& y);
-
-    //! Destructor.
-    ~Pseudo_Row();
-
-    //! Subscript operator.
-    U& operator[](dimension_type k) const;
-
-    //! Default constructor: creates an invalid object that has to be assigned.
-    Pseudo_Row();
-
-    //! Assignment operator.
-    Pseudo_Row& operator=(const Pseudo_Row& y);
-
-#if !defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 0)
-  private:
-#else
-  // Work around a bug of GCC 4.0.x (and, likely, previous versions).
-  public:
-#endif
-
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-
-    //! Private constructor for a Pseudo_Row with size \p s beginning at \p y.
-    Pseudo_Row(U& y, dimension_type s);
-
-#else // !PPL_OR_MATRIX_EXTRA_DEBUG
-
-    //! Private constructor for a Pseudo_Row beginning at \p y.
-    explicit Pseudo_Row(U& y);
-
-#endif // !PPL_OR_MATRIX_EXTRA_DEBUG
-
-    //! Holds a reference to the beginning of this row.
-    U* first;
-
-#if !defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 0)
-#else
-  // Work around a bug of GCC 4.0.x (and, likely, previous versions).
-  private:
-#endif
-
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-
-    //! The size of the row.
-    dimension_type size_;
-
-    //! Returns the size of the row.
-    dimension_type size() const;
-
-#endif // PPL_OR_MATRIX_EXTRA_DEBUG
-
-    // FIXME: the EDG-based compilers (such as Comeau and Intel)
-    // are here in wild disagreement with GCC: what is a legal friend
-    // declaration for one, is illegal for the others.
-#ifdef __EDG__
-    template <typename V> template<typename W>
-    friend class OR_Matrix<V>::Pseudo_Row;
-    template <typename V> template<typename W>
-    friend class OR_Matrix<V>::any_row_iterator;
-#else
-    template <typename V> friend class Pseudo_Row;
-    template <typename V> friend class any_row_iterator;
-#endif
-
-    friend class OR_Matrix;
-  }; // class Pseudo_Row
-
-public:
-  //! A (non const) reference to a matrix's row.
-  typedef Pseudo_Row<T> row_reference_type;
-
-  //! A const reference to a matrix's row.
-  typedef Pseudo_Row<const T> const_row_reference_type;
-
-private:
-  /*! \brief
-    A template class to derive both OR_Matrix::iterator
-    and OR_Matrix::const_iterator.
-  */
-  template <typename U>
-  class any_row_iterator {
-  public:
-    typedef std::random_access_iterator_tag iterator_category;
-    typedef Pseudo_Row<U> value_type;
-    typedef long difference_type;
-    typedef const Pseudo_Row<U>* pointer;
-    typedef const Pseudo_Row<U>& reference;
-
-    //! Constructor to build past-the-end objects.
-    any_row_iterator(dimension_type n_rows);
-
-    /*! \brief
-      Builds an iterator pointing at the beginning of an OR_Matrix whose
-      first element is \p base;
-    */
-    explicit any_row_iterator(U& base);
-
-    /*! \brief
-      Copy constructor allowing the construction of a const_iterator
-      from a non-const iterator.
-    */
-    template <typename V>
-    any_row_iterator(const any_row_iterator<V>& y);
-
-    /*! \brief
-      Assignment operator allowing the assignment of a non-const iterator
-      to a const_iterator.
-    */
-    template <typename V>
-    any_row_iterator& operator=(const any_row_iterator<V>& y);
-
-    //! Dereference operator.
-    reference operator*() const;
-
-    //! Indirect member selector.
-    pointer operator->() const;
-
-    //! Prefix increment operator.
-    any_row_iterator& operator++();
-
-    //! Postfix increment operator.
-    any_row_iterator operator++(int);
-
-    //! Prefix decrement operator.
-    any_row_iterator& operator--();
-
-    //! Postfix decrement operator.
-    any_row_iterator operator--(int);
-
-    //! Subscript operator.
-    reference operator[](difference_type m) const;
-
-    //! Assignment-increment operator.
-    any_row_iterator& operator+=(difference_type m);
-
-    //! Assignment-increment operator for \p m of unsigned type.
-    template <typename Unsigned>
-    typename Enable_If<(static_cast<Unsigned>(-1) > 0), any_row_iterator&>::type
-    operator+=(Unsigned m);
-
-    //! Assignment-decrement operator.
-    any_row_iterator& operator-=(difference_type m);
-
-    //! Returns the difference between \p *this and \p y.
-    difference_type operator-(const any_row_iterator& y) const;
-
-    //! Returns the sum of \p *this and \p m.
-    any_row_iterator operator+(difference_type m) const;
-
-    //! Returns the sum of \p *this and \p m, for \p m of unsigned type.
-    template <typename Unsigned>
-    typename Enable_If<(static_cast<Unsigned>(-1) > 0), any_row_iterator>::type
-    operator+(Unsigned m) const;
-
-    //! Returns the difference of \p *this and \p m.
-    any_row_iterator operator-(difference_type m) const;
-
-    //! Returns <CODE>true</CODE> if and only if \p *this is equal to \p y.
-    bool operator==(const any_row_iterator& y) const;
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this
-      is different from \p y.
-    */
-    bool operator!=(const any_row_iterator& y) const;
-
-    //! Returns <CODE>true</CODE> if and only if \p *this is less than \p y.
-    bool operator<(const any_row_iterator& y) const;
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this is less than
-      or equal to \p y.
-    */
-    bool operator<=(const any_row_iterator& y) const;
-
-    //! Returns <CODE>true</CODE> if and only if \p *this is greater than \p y.
-    bool operator>(const any_row_iterator& y) const;
-
-    /*! \brief
-      Returns <CODE>true</CODE> if and only if \p *this is greater than
-      or equal to \p y.
-    */
-    bool operator>=(const any_row_iterator& y) const;
-
-    dimension_type row_size() const;
-
-    dimension_type index() const;
-
-  private:
-    //! Represents the beginning of a row.
-    Pseudo_Row<U> value;
-
-    //! External index.
-    dimension_type e;
-
-    //! Internal index: <CODE>i = (e+1)*(e+1)/2</CODE>.
-    dimension_type i;
-
-    // FIXME: the EDG-based compilers (such as Comeau and Intel)
-    // are here in wild disagreement with GCC: what is a legal friend
-    // declaration for one, is illegal for the others.
-#ifdef __EDG__
-    template <typename V> template<typename W>
-    friend class OR_Matrix<V>::any_row_iterator;
-#else
-    template <typename V> friend class any_row_iterator;
-#endif
-  }; // class any_row_iterator
-
-public:
-  //! A (non const) row iterator.
-  typedef any_row_iterator<T> row_iterator;
-
-  //! A const row iterator.
-  typedef any_row_iterator<const T> const_row_iterator;
-
-  //! A (non const) element iterator.
-  typedef typename DB_Row<T>::iterator element_iterator;
-
-  //! A const element iterator.
-  typedef typename DB_Row<T>::const_iterator const_element_iterator;
-
-public:
-  //! Returns the maximum number of rows of a OR_Matrix.
-  static dimension_type max_num_rows();
-
-  //! Builds a matrix with specified dimensions.
-  /*!
-    \param num_dimensions
-    The space dimension of the matrix that will be created.
-
-    This constructor creates a matrix with \p 2*num_dimensions rows.
-    Each element is initialized to plus infinity.
-  */
-  OR_Matrix(dimension_type num_dimensions);
-
-  //! Copy constructor.
-  OR_Matrix(const OR_Matrix& y);
-
-  //! Constructs a conservative approximation of \p y.
-  template <typename U>
-  explicit OR_Matrix(const OR_Matrix<U>& y);
-
-  //! Destructor.
-  ~OR_Matrix();
-
-  //! Assignment operator.
-  OR_Matrix& operator=(const OR_Matrix& y);
-
-private:
-  template <typename U> friend class OR_Matrix;
-
-  //! Contains the rows of the matrix.
-  /*!
-    A DB_Row which contains the rows of the OR_Matrix
-    inserting each successive row to the end of the vec.
-    To contain all the elements of OR_Matrix the size of the DB_Row
-    is 2*n*(n+1), where the n is the characteristic parameter of
-    OR_Matrix.
-  */
-  DB_Row<T> vec;
-
-  //! Contains the dimension of the space of the matrix.
-  dimension_type space_dim;
-
-  //! Contains the capacity of \p vec.
-  dimension_type vec_capacity;
-
-  //! Private and not implemented: default construction is not allowed.
-  OR_Matrix();
-
-  /*! \brief
-    Returns the index into <CODE>vec</CODE> of the first element
-    of the row of index \p k.
-  */
-  static dimension_type row_first_element_index(dimension_type k);
-
-public:
-  //! Returns the size of the row of index \p k.
-  static dimension_type row_size(dimension_type k);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(OR_Matrix& y);
-
-  //! Makes the matrix grow by adding more space dimensions.
-  /*!
-    \param new_dim
-    The new dimension of the resized matrix.
-
-    Adds new rows of right dimension to the end if
-    there is enough capacity; otherwise, creates a new matrix,
-    with the specified dimension, copying the old elements
-    in the upper part of the new matrix, which is
-    then assigned to \p *this.
-    Each new element is initialized to plus infinity.
-  */
-  void grow(dimension_type new_dim);
-
-  //! Makes the matrix shrink by removing the last space dimensions.
-  /*!
-    \param new_dim
-    The new dimension of the resized matrix.
-
-    Erases from matrix to the end the rows with index
-    greater than 2*new_dim-1.
-  */
-  void shrink(dimension_type new_dim);
-
-  //! Resizes the matrix without worrying about the old contents.
-  /*!
-    \param new_dim
-    The new dimension of the resized matrix.
-
-    If the new dimension is greater than the old one, it adds new rows
-    of right dimension to the end if there is enough capacity; otherwise,
-    it creates a new matrix, with the specified dimension, which is
-    then assigned to \p *this.
-    If the new dimension is less than the old one, it erase from the matrix
-    the rows having index greater than 2*new_dim-1
-  */
-  void resize_no_copy(dimension_type new_dim);
-
-  //! Returns the space-dimension of the matrix.
-  dimension_type space_dimension() const;
-
-  //! Returns the number of rows in the matrix.
-  dimension_type num_rows() const;
-
-  //! \name Subscript operators.
-  //@{
-  //! Returns a reference to the \p k-th row of the matrix.
-  row_reference_type operator[](dimension_type k);
-
-  //! Returns a constant reference to the \p k-th row of the matrix.
-  const_row_reference_type operator[](dimension_type k) const;
-  //@}
-
-
-  /*! \brief
-    Returns an iterator pointing to the first row,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  row_iterator row_begin();
-
-  //! Returns the past-the-end const_iterator.
-  row_iterator row_end();
-
-  /*! \brief
-    Returns a const row iterator pointing to the first row,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  const_row_iterator row_begin() const;
-
-  //! Returns the past-the-end const row iterator.
-  const_row_iterator row_end() const;
-
-  /*! \brief
-    Returns an iterator pointing to the first element,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  element_iterator element_begin();
-
-  //! Returns the past-the-end const_iterator.
-  element_iterator element_end();
-
-  /*! \brief
-    Returns a const element iterator pointing to the first element,
-    if \p *this is not empty;
-    otherwise, returns the past-the-end const_iterator.
-  */
-  const_element_iterator element_begin() const;
-
-  //! Returns the past-the-end const element iterator.
-  const_element_iterator element_end() const;
-
-  //! Clears the matrix deallocating all its rows.
-  void clear();
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  friend bool operator==<T>(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-void swap(OR_Matrix<T>& x, OR_Matrix<T>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-bool operator!=(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates OR_Matrix
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into to \p r
-  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-				 const OR_Matrix<T>& x,
-				 const OR_Matrix<T>& y,
-				 Rounding_Dir dir,
-				 Temp& tmp0,
-				 Temp& tmp1,
-				 Temp& tmp2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates OR_Matrix
-  If the Euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into to \p r
-  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			       const OR_Matrix<T>& x,
-			       const OR_Matrix<T>& y,
-			       Rounding_Dir dir,
-			       Temp& tmp0,
-			       Temp& tmp1,
-			       Temp& tmp2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates OR_Matrix
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into to \p r
-  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-				 const OR_Matrix<T>& x,
-				 const OR_Matrix<T>& y,
-				 Rounding_Dir dir,
-				 Temp& tmp0,
-				 Temp& tmp1,
-				 Temp& tmp2);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "OR_Matrix.inlines.hh"
-#include "OR_Matrix.templates.hh"
-
-#endif // !defined(PPL_OR_Matrix_defs_hh)
diff --git a/src/OR_Matrix.inlines.hh b/src/OR_Matrix.inlines.hh
deleted file mode 100644
index 3f9456a..0000000
--- a/src/OR_Matrix.inlines.hh
+++ /dev/null
@@ -1,751 +0,0 @@
-/* OR_Matrix class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_OR_Matrix_inlines_hh
-#define PPL_OR_Matrix_inlines_hh 1
-
-#include "globals.defs.hh"
-#include "Checked_Number.defs.hh"
-#include "C_Polyhedron.defs.hh"
-#include "distances.defs.hh"
-#include "assert.hh"
-#include "checked.defs.hh"
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline dimension_type
-OR_Matrix<T>::row_first_element_index(const dimension_type k) {
-  return ((k + 1)*(k + 1))/2;
-}
-
-template <typename T>
-inline dimension_type
-OR_Matrix<T>::row_size(const dimension_type k) {
-  return k + 2 - k % 2;
-}
-
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-
-template <typename T>
-template <typename U>
-inline dimension_type
-OR_Matrix<T>::Pseudo_Row<U>::size() const {
-  return size_;
-}
-
-#endif // PPL_OR_MATRIX_EXTRA_DEBUG
-
-template <typename T>
-template <typename U>
-inline
-OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row()
-  : first(0)
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  , size_(0)
-#endif
-{
-}
-
-template <typename T>
-template <typename U>
-inline
-OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row(U& y
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-		, dimension_type s
-#endif
-		)
-  : first(&y)
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  , size_(s)
-#endif
-{
-}
-
-template <typename T>
-template <typename U>
-template <typename V>
-inline
-OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row(const Pseudo_Row<V>& y)
-  : first(y.first)
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-    , size_(y.size_)
-#endif
-{
-}
-
-template <typename T>
-template <typename U>
-inline OR_Matrix<T>::Pseudo_Row<U>&
-OR_Matrix<T>::Pseudo_Row<U>::operator=(const Pseudo_Row& y) {
-  first = y.first;
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  size_ = y.size_;
-#endif
-  return *this;
-}
-
-template <typename T>
-template <typename U>
-inline
-OR_Matrix<T>::Pseudo_Row<U>::~Pseudo_Row() {
-}
-
-template <typename T>
-template <typename U>
-inline U&
-OR_Matrix<T>::Pseudo_Row<U>::operator[](const dimension_type k) const {
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  PPL_ASSERT(k < size_);
-#endif
-  return *(first + k);
-}
-
-template <typename T>
-template <typename U>
-inline
-OR_Matrix<T>::any_row_iterator<U>
-::any_row_iterator(const dimension_type n_rows)
-  : value(),
-    e(n_rows)
-    // Field `i' is intentionally not initialized here.
-{
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  // Turn `value' into a valid object.
-  value.size_ = OR_Matrix::row_size(e);
-#endif
-}
-
-template <typename T>
-template <typename U>
-inline
-OR_Matrix<T>::any_row_iterator<U>::any_row_iterator(U& base)
-  :  value(base
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-	   , OR_Matrix<T>::row_size(0)
-#endif
-	   ),
-     e(0),
-     i(0) {
-}
-
-template <typename T>
-template <typename U>
-template <typename V>
-inline
-OR_Matrix<T>::any_row_iterator<U>
-::any_row_iterator(const any_row_iterator<V>& y)
-  : value(y.value),
-    e(y.e),
-    i(y.i) {
-}
-
-template <typename T>
-template <typename U>
-template <typename V>
-inline typename OR_Matrix<T>::template any_row_iterator<U>&
-OR_Matrix<T>::any_row_iterator<U>::operator=(const any_row_iterator<V>& y) {
-  value = y.value;
-  e = y.e;
-  i = y.i;
-  return *this;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>::reference
-OR_Matrix<T>::any_row_iterator<U>::operator*() const {
-  return value;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>::pointer
-OR_Matrix<T>::any_row_iterator<U>::operator->() const {
-  return &value;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>&
-OR_Matrix<T>::any_row_iterator<U>::operator++() {
-  ++e;
-  dimension_type increment = e;
-  if (e % 2 != 0)
-    ++increment;
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  else {
-    value.size_ += 2;
-  }
-#endif
-  i += increment;
-  value.first += increment;
-  return *this;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>
-OR_Matrix<T>::any_row_iterator<U>::operator++(int) {
-  any_row_iterator old = *this;
-  ++(*this);
-  return old;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>&
-OR_Matrix<T>::any_row_iterator<U>::operator--() {
-  dimension_type decrement = e + 1;
-  --e;
-  if (e % 2 != 0) {
-    ++decrement;
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-    value.size_ -= 2;
-#endif
-  }
-  i -= decrement;
-  value.first -= decrement;
-  return *this;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>
-OR_Matrix<T>::any_row_iterator<U>::operator--(int) {
-  any_row_iterator old = *this;
-  --(*this);
-  return old;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>&
-OR_Matrix<T>::any_row_iterator<U>::operator+=(const difference_type m) {
-  difference_type e_dt = static_cast<difference_type>(e);
-  difference_type i_dt = static_cast<difference_type>(i);
-  difference_type increment = m + (m * m) / 2 + m * e_dt;
-  if (e_dt % 2 == 0 && m % 2 != 0)
-    ++increment;
-  e_dt += m;
-  i_dt += increment;
-  e = static_cast<dimension_type>(e_dt);
-  i = static_cast<dimension_type>(i_dt);
-  value.first += increment;
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  difference_type value_size_dt = static_cast<difference_type>(value.size_);
-  value_size_dt += (m - m % 2);
-  value.size_ = static_cast<dimension_type>(value_size_dt);
-#endif
-  return *this;
-}
-
-template <typename T>
-template <typename U>
-template <typename Unsigned>
-inline typename
-Enable_If<(static_cast<Unsigned>(-1) > 0),
-            typename OR_Matrix<T>::template any_row_iterator<U>& >::type
-OR_Matrix<T>::any_row_iterator<U>::operator+=(Unsigned m) {
-  dimension_type n = m;
-  dimension_type increment = n + (n*n)/2 + n*e;
-  if (e % 2 == 0 && n % 2 != 0)
-    ++increment;
-  e += n;
-  i += increment;
-  value.first += increment;
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-  value.size_ = value.size_ + n - n % 2;
-#endif
-  return *this;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>&
-OR_Matrix<T>::any_row_iterator<U>::operator-=(difference_type m) {
-  return *this += -m;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>::difference_type
-OR_Matrix<T>::any_row_iterator<U>::operator-(const any_row_iterator& y) const {
-  return e - y.e;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>
-OR_Matrix<T>::any_row_iterator<U>::operator+(difference_type m) const {
-  any_row_iterator r = *this;
-  r += m;
-  return r;
-}
-
-template <typename T>
-template <typename U>
-template <typename Unsigned>
-inline typename
-Enable_If<(static_cast<Unsigned>(-1) > 0),
-            typename OR_Matrix<T>::template any_row_iterator<U> >::type
-OR_Matrix<T>::any_row_iterator<U>::operator+(Unsigned m) const {
-  any_row_iterator r = *this;
-  r += m;
-  return r;
-}
-
-template <typename T>
-template <typename U>
-inline typename OR_Matrix<T>::template any_row_iterator<U>
-OR_Matrix<T>::any_row_iterator<U>::operator-(const difference_type m) const {
-  any_row_iterator r = *this;
-  r -= m;
-  return r;
-}
-
-template <typename T>
-template <typename U>
-inline bool
-OR_Matrix<T>::any_row_iterator<U>
-::operator==(const any_row_iterator& y) const {
-  return e == y.e;
-}
-
-template <typename T>
-template <typename U>
-inline bool
-OR_Matrix<T>::any_row_iterator<U>
-::operator!=(const any_row_iterator& y) const {
-  return e != y.e;
-}
-
-template <typename T>
-template <typename U>
-inline bool
-OR_Matrix<T>::any_row_iterator<U>::operator<(const any_row_iterator& y) const {
-  return e < y.e;
-}
-
-template <typename T>
-template <typename U>
-inline bool
-OR_Matrix<T>::any_row_iterator<U>
-::operator<=(const any_row_iterator& y) const {
-  return e <= y.e;
-}
-
-template <typename T>
-template <typename U>
-inline bool
-OR_Matrix<T>::any_row_iterator<U>::operator>(const any_row_iterator& y) const {
-  return e > y.e;
-}
-
-template <typename T>
-template <typename U>
-inline bool
-OR_Matrix<T>::any_row_iterator<U>
-::operator>=(const any_row_iterator& y) const {
-  return e >= y.e;
-}
-
-template <typename T>
-template <typename U>
-inline dimension_type
-OR_Matrix<T>::any_row_iterator<U>::row_size() const {
-  return OR_Matrix::row_size(e);
-}
-
-template <typename T>
-template <typename U>
-inline dimension_type
-OR_Matrix<T>::any_row_iterator<U>::index() const {
-  return e;
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::row_iterator
-OR_Matrix<T>::row_begin() {
-  return num_rows() == 0 ? row_iterator(0) : row_iterator(vec[0]);
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::row_iterator
-OR_Matrix<T>::row_end() {
-  return row_iterator(num_rows());
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::const_row_iterator
-OR_Matrix<T>::row_begin() const {
-  return num_rows() == 0 ? const_row_iterator(0) : const_row_iterator(vec[0]);
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::const_row_iterator
-OR_Matrix<T>::row_end() const {
-  return const_row_iterator(num_rows());
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::element_iterator
-OR_Matrix<T>::element_begin() {
-  return vec.begin();
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::element_iterator
-OR_Matrix<T>::element_end() {
-  return vec.end();
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::const_element_iterator
-OR_Matrix<T>::element_begin() const {
-  return vec.begin();
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::const_element_iterator
-OR_Matrix<T>::element_end() const {
-  return vec.end();
-}
-
-template <typename T>
-inline void
-OR_Matrix<T>::m_swap(OR_Matrix& y) {
-  using std::swap;
-  swap(vec, y.vec);
-  swap(space_dim, y.space_dim);
-  swap(vec_capacity, y.vec_capacity);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the integer square root of \p x.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-inline dimension_type
-isqrt(dimension_type x) {
-  dimension_type r = 0;
-  const dimension_type FIRST_BIT_MASK = 0x40000000U;
-  for (dimension_type t = FIRST_BIT_MASK; t != 0; t >>= 2) {
-    dimension_type s = r + t;
-    if (s <= x) {
-      x -= s;
-      r = s + t;
-    }
-    r >>= 1;
-  }
-  return r;
-}
-
-template <typename T>
-inline dimension_type
-OR_Matrix<T>::max_num_rows() {
-  // Compute the maximum number of rows that are contained in a DB_Row
-  // that allocates a pseudo-triangular matrix.
-  dimension_type k = isqrt(2*DB_Row<T>::max_size() + 1);
-  return (k - 1) - (k - 1) % 2;
-}
-
-template <typename T>
-inline memory_size_type
-OR_Matrix<T>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename T>
-inline
-OR_Matrix<T>::OR_Matrix(const dimension_type num_dimensions)
-  : vec(2*num_dimensions*(num_dimensions + 1)),
-    space_dim(num_dimensions),
-    vec_capacity(vec.size()) {
-}
-
-template <typename T>
-inline
-OR_Matrix<T>::~OR_Matrix() {
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::row_reference_type
-OR_Matrix<T>::operator[](dimension_type k) {
-  return row_reference_type(vec[row_first_element_index(k)]
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-			    , row_size(k)
-#endif
-			    );
-}
-
-template <typename T>
-inline typename OR_Matrix<T>::const_row_reference_type
-OR_Matrix<T>::operator[](dimension_type k) const {
-  return const_row_reference_type(vec[row_first_element_index(k)]
-#if PPL_OR_MATRIX_EXTRA_DEBUG
-				  , row_size(k)
-#endif
-				  );
-}
-
-template <typename T>
-inline dimension_type
-OR_Matrix<T>::space_dimension() const {
-  return space_dim;
-}
-
-template <typename T>
-inline dimension_type
-OR_Matrix<T>::num_rows() const {
-  return 2*space_dimension();
-}
-
-template <typename T>
-inline void
-OR_Matrix<T>::clear() {
-  OR_Matrix<T>(0).m_swap(*this);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-inline bool
-operator==(const OR_Matrix<T>& x, const OR_Matrix<T>& y) {
-  return x.space_dim == y.space_dim && x.vec == y.vec;
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-inline bool
-operator!=(const OR_Matrix<T>& x, const OR_Matrix<T>& y) {
-  return !(x == y);
-}
-
-template <typename T>
-inline
-OR_Matrix<T>::OR_Matrix(const OR_Matrix& y)
-  : vec(y.vec),
-    space_dim(y.space_dim),
-    vec_capacity(compute_capacity(y.vec.size(),
-                                  DB_Row<T>::max_size())) {
-}
-
-template <typename T>
-template <typename U>
-inline
-OR_Matrix<T>::OR_Matrix(const OR_Matrix<U>& y)
-  : vec(),
-    space_dim(y.space_dim),
-    vec_capacity(compute_capacity(y.vec.size(),
-                                  DB_Row<T>::max_size())) {
-  vec.construct_upward_approximation(y.vec, vec_capacity);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline OR_Matrix<T>&
-OR_Matrix<T>::operator=(const OR_Matrix& y) {
-  vec = y.vec;
-  space_dim = y.space_dim;
-  vec_capacity = compute_capacity(y.vec.size(), DB_Row<T>::max_size());
-  return *this;
-}
-
-template <typename T>
-inline void
-OR_Matrix<T>::grow(const dimension_type new_dim) {
-  PPL_ASSERT(new_dim >= space_dim);
-  if (new_dim > space_dim) {
-    const dimension_type new_size = 2*new_dim*(new_dim + 1);
-    if (new_size <= vec_capacity) {
-      // We can recycle the old vec.
-      vec.expand_within_capacity(new_size);
-      space_dim = new_dim;
-    }
-    else {
-      // We cannot recycle the old vec.
-      OR_Matrix<T> new_matrix(new_dim);
-      element_iterator j = new_matrix.element_begin();
-      for (element_iterator i = element_begin(),
-	     mend = element_end(); i != mend; ++i, ++j)
-	assign_or_swap(*j, *i);
-      m_swap(new_matrix);
-    }
-  }
-}
-
-template <typename T>
-inline void
-OR_Matrix<T>::shrink(const dimension_type new_dim) {
-  PPL_ASSERT(new_dim <= space_dim);
-  const dimension_type new_size = 2*new_dim*(new_dim + 1);
-  vec.shrink(new_size);
-  space_dim = new_dim;
-}
-
-template <typename T>
-inline void
-OR_Matrix<T>::resize_no_copy(const dimension_type new_dim) {
-  if (new_dim > space_dim) {
-    const dimension_type new_size = 2*new_dim*(new_dim + 1);
-    if (new_size <= vec_capacity) {
-      // We can recycle the old vec.
-      vec.expand_within_capacity(new_size);
-      space_dim = new_dim;
-    }
-    else {
-      // We cannot recycle the old vec.
-      OR_Matrix<T> new_matrix(new_dim);
-      m_swap(new_matrix);
-    }
-  }
-  else if (new_dim < space_dim)
-    shrink(new_dim);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Specialization, typename Temp, typename To, typename T>
-inline bool
-l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const OR_Matrix<T>& x,
-		    const OR_Matrix<T>& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0,
-		    Temp& tmp1,
-		    Temp& tmp2) {
-  if (x.num_rows() != y.num_rows())
-    return false;
-  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
-  for (typename OR_Matrix<T>::const_element_iterator
-	 i = x.element_begin(), j = y.element_begin(),
-	 mat_end = x.element_end(); i != mat_end; ++i, ++j) {
-    const T& x_i = *i;
-    const T& y_i = *j;
-    if (is_plus_infinity(x_i)) {
-      if (is_plus_infinity(y_i))
-	continue;
-      else {
-      pinf:
-	assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-	return true;
-      }
-    }
-    else if (is_plus_infinity(y_i))
-      goto pinf;
-
-    const Temp* tmp1p;
-    const Temp* tmp2p;
-    if (x_i > y_i) {
-      maybe_assign(tmp1p, tmp1, x_i, dir);
-      maybe_assign(tmp2p, tmp2, y_i, inverse(dir));
-    }
-    else {
-      maybe_assign(tmp1p, tmp1, y_i, dir);
-      maybe_assign(tmp2p, tmp2, x_i, inverse(dir));
-    }
-    sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
-    PPL_ASSERT(sgn(tmp1) >= 0);
-    Specialization::combine(tmp0, tmp1, dir);
-  }
-
-  Specialization::finalize(tmp0, dir);
-  assign_r(r, tmp0, dir);
-  return true;
-}
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const OR_Matrix<T>& x,
-			    const OR_Matrix<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
-  return
-    l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >(r, x, y,
-								    dir,
-								    tmp0,
-								    tmp1,
-								    tmp2);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const OR_Matrix<T>& x,
-			  const OR_Matrix<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
-  return
-    l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >(r, x, y,
-								  dir,
-								  tmp0,
-								  tmp1,
-								  tmp2);
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Temp, typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const OR_Matrix<T>& x,
-			   const OR_Matrix<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
-  return
-    l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >(r, x, y,
-								   dir,
-								   tmp0,
-								   tmp1,
-								   tmp2);
-}
-
-/*! \relates OR_Matrix */
-template <typename T>
-inline void
-swap(OR_Matrix<T>& x, OR_Matrix<T>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_OR_Matrix_inlines_hh)
diff --git a/src/OR_Matrix.templates.hh b/src/OR_Matrix.templates.hh
deleted file mode 100644
index de9fcb2..0000000
--- a/src/OR_Matrix.templates.hh
+++ /dev/null
@@ -1,124 +0,0 @@
-/* OR_Matrix class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_OR_Matrix_templates_hh
-#define PPL_OR_Matrix_templates_hh 1
-
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-memory_size_type
-OR_Matrix<T>::external_memory_in_bytes() const{
-  return vec.external_memory_in_bytes();
-}
-
-template <typename T>
-bool
-OR_Matrix<T>::OK() const {
-#ifndef NDEBUG
-  using std::endl;
-  using std::cerr;
-#endif
-  // The right number of cells should be in use.
-  const dimension_type dim = space_dimension();
-  if (vec.size() != 2*dim*(dim + 1)) {
-#ifndef NDEBUG
-    cerr << "OR_Matrix has a wrong number of cells:\n"
-         << "vec.size() is " << vec.size()
-         << ", expected size is " << (2*dim*(dim+1)) << "!\n";
-#endif
-    return false;
-  }
-
-  // The underlying DB_Row should be OK.
-  if (!vec.OK(vec.size(), vec_capacity))
-    return false;
-
-  // All checks passed.
-  return true;
-}
-
-template <typename T>
-void
-OR_Matrix<T>::ascii_dump(std::ostream& s) const {
-  const OR_Matrix<T>& x = *this;
-  const char separator = ' ';
-  dimension_type space = x.space_dimension();
-  s << space << separator << "\n";
-  for (const_row_iterator i = x.row_begin(),
-	 x_row_end = x.row_end(); i != x_row_end; ++i) {
-    const_row_reference_type r = *i;
-    dimension_type rs = i.row_size();
-    for (dimension_type j = 0; j < rs; ++j) {
-      using namespace IO_Operators;
-      s << r[j] << separator;
-    }
-    s << "\n";
-  }
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, OR_Matrix<T>)
-
-template <typename T>
-bool
-OR_Matrix<T>::ascii_load(std::istream& s) {
-  dimension_type space;
-  if (!(s >> space))
-    return false;
-  resize_no_copy(space);
-  for (row_iterator i = row_begin(),
-	 this_row_end = row_end(); i != this_row_end; ++i) {
-    row_reference_type r_i = *i;
-    const dimension_type rs = i.row_size();
-    for (dimension_type j = 0; j < rs; ++j) {
-      Result r = input(r_i[j], s, ROUND_CHECK);
-      if (result_relation(r) != VR_EQ || is_minus_infinity(r_i[j]))
-	return false;
-    }
-  }
-  PPL_ASSERT(OK());
-  return true;
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Parma_Polyhedra_Library::OR_Matrix */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-std::ostream&
-IO_Operators::operator<<(std::ostream& s, const OR_Matrix<T>& m) {
-  for (typename OR_Matrix<T>::const_row_iterator m_iter = m.row_begin(),
-	 m_end = m.row_end(); m_iter != m_end; ++m_iter) {
-    typename OR_Matrix<T>::const_row_reference_type r_m = *m_iter;
-    const dimension_type mr_size = m_iter.row_size();
-    for (dimension_type j = 0; j < mr_size; ++j)
-      s << r_m[j] << " ";
-    s << "\n";
-  }
-  return s;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_OR_Matrix_templates_hh)
diff --git a/src/OR_Matrix.types.hh b/src/OR_Matrix.types.hh
deleted file mode 100644
index 52f9359..0000000
--- a/src/OR_Matrix.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_OR_Matrix_types_hh
-#define PPL_OR_Matrix_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-class OR_Matrix;
-
-}
-
-#endif // !defined(PPL_OR_Matrix_types_hh)
diff --git a/src/OR_Matrix_defs.hh b/src/OR_Matrix_defs.hh
new file mode 100644
index 0000000..0215646
--- /dev/null
+++ b/src/OR_Matrix_defs.hh
@@ -0,0 +1,610 @@
+/* OR_Matrix class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_OR_Matrix_defs_hh
+#define PPL_OR_Matrix_defs_hh 1
+
+#include "globals_defs.hh"
+#include "OR_Matrix_types.hh"
+#include "DB_Row_defs.hh"
+#include "Checked_Number_defs.hh"
+#include <cstddef>
+#include <iosfwd>
+
+#ifndef PPL_OR_MATRIX_EXTRA_DEBUG
+#ifdef PPL_ABI_BREAKING_EXTRA_DEBUG
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  When PPL_OR_MATRIX_EXTRA_DEBUG evaluates to <CODE>true</CODE>, each
+  instance of the class OR_Matrix::Pseudo_Row carries its own size;
+  this enables extra consistency checks to be performed.
+  \ingroup PPL_CXX_interface
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+#define PPL_OR_MATRIX_EXTRA_DEBUG 1
+#else // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
+#define PPL_OR_MATRIX_EXTRA_DEBUG 0
+#endif // !defined(PPL_ABI_BREAKING_EXTRA_DEBUG)
+#endif // !defined(PPL_OR_MATRIX_EXTRA_DEBUG)
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+bool operator==(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
+
+namespace IO_Operators {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+std::ostream&
+operator<<(std::ostream& s, const OR_Matrix<T>& m);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A matrix representing octagonal constraints.
+/*!
+  An OR_Matrix object is a DB_Row object that allows
+  the representation of a \em pseudo-triangular matrix,
+  like the following:
+
+<PRE>
+         _ _
+   0    |_|_|
+   1    |_|_|_ _
+   2    |_|_|_|_|
+   3    |_|_|_|_|_ _
+   4    |_|_|_|_|_|_|
+   5    |_|_|_|_|_|_|
+         . . .
+         _ _ _ _ _ _       _
+ 2n-2   |_|_|_|_|_|_| ... |_|
+ 2n-1   |_|_|_|_|_|_| ... |_|
+         0 1 2 3 4 5  ... 2n-1
+
+</PRE>
+
+  It is characterized by parameter n that defines the structure,
+  and such that there are 2*n rows (and 2*n columns).
+  It provides row_iterators for the access to the rows
+  and element_iterators for the access to the elements.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+template <typename T>
+class Parma_Polyhedra_Library::OR_Matrix {
+private:
+  /*! \brief
+    An object that behaves like a matrix's row with respect to
+    the subscript operators.
+  */
+  template <typename U>
+  class Pseudo_Row {
+  public:
+    /*! \brief
+      Copy constructor allowing the construction of a const pseudo-row
+      from a non-const pseudo-row.
+      Ordinary copy constructor.
+    */
+    template <typename V>
+    Pseudo_Row(const Pseudo_Row<V>& y);
+
+    //! Destructor.
+    ~Pseudo_Row();
+
+    //! Subscript operator.
+    U& operator[](dimension_type k) const;
+
+    //! Default constructor: creates an invalid object that has to be assigned.
+    Pseudo_Row();
+
+    //! Assignment operator.
+    Pseudo_Row& operator=(const Pseudo_Row& y);
+
+#if !defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 0)
+  private:
+#else
+  // Work around a bug of GCC 4.0.x (and, likely, previous versions).
+  public:
+#endif
+
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+
+    //! Private constructor for a Pseudo_Row with size \p s beginning at \p y.
+    Pseudo_Row(U& y, dimension_type s);
+
+#else // !PPL_OR_MATRIX_EXTRA_DEBUG
+
+    //! Private constructor for a Pseudo_Row beginning at \p y.
+    explicit Pseudo_Row(U& y);
+
+#endif // !PPL_OR_MATRIX_EXTRA_DEBUG
+
+    //! Holds a reference to the beginning of this row.
+    U* first;
+
+#if !defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 0)
+#else
+  // Work around a bug of GCC 4.0.x (and, likely, previous versions).
+  private:
+#endif
+
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+
+    //! The size of the row.
+    dimension_type size_;
+
+    //! Returns the size of the row.
+    dimension_type size() const;
+
+#endif // PPL_OR_MATRIX_EXTRA_DEBUG
+
+    // FIXME: the EDG-based compilers (such as Comeau and Intel)
+    // are here in wild disagreement with GCC: what is a legal friend
+    // declaration for one, is illegal for the others.
+#ifdef __EDG__
+    template <typename V> template<typename W>
+    friend class OR_Matrix<V>::Pseudo_Row;
+    template <typename V> template<typename W>
+    friend class OR_Matrix<V>::any_row_iterator;
+#else
+    template <typename V> friend class Pseudo_Row;
+    template <typename V> friend class any_row_iterator;
+#endif
+
+    friend class OR_Matrix;
+  }; // class Pseudo_Row
+
+public:
+  //! A (non const) reference to a matrix's row.
+  typedef Pseudo_Row<T> row_reference_type;
+
+  //! A const reference to a matrix's row.
+  typedef Pseudo_Row<const T> const_row_reference_type;
+
+private:
+  /*! \brief
+    A template class to derive both OR_Matrix::iterator
+    and OR_Matrix::const_iterator.
+  */
+  template <typename U>
+  class any_row_iterator {
+  public:
+    typedef std::random_access_iterator_tag iterator_category;
+    typedef Pseudo_Row<U> value_type;
+    typedef long difference_type;
+    typedef const Pseudo_Row<U>* pointer;
+    typedef const Pseudo_Row<U>& reference;
+
+    //! Constructor to build past-the-end objects.
+    any_row_iterator(dimension_type n_rows);
+
+    /*! \brief
+      Builds an iterator pointing at the beginning of an OR_Matrix whose
+      first element is \p base;
+    */
+    explicit any_row_iterator(U& base);
+
+    /*! \brief
+      Copy constructor allowing the construction of a const_iterator
+      from a non-const iterator.
+    */
+    template <typename V>
+    any_row_iterator(const any_row_iterator<V>& y);
+
+    /*! \brief
+      Assignment operator allowing the assignment of a non-const iterator
+      to a const_iterator.
+    */
+    template <typename V>
+    any_row_iterator& operator=(const any_row_iterator<V>& y);
+
+    //! Dereference operator.
+    reference operator*() const;
+
+    //! Indirect member selector.
+    pointer operator->() const;
+
+    //! Prefix increment operator.
+    any_row_iterator& operator++();
+
+    //! Postfix increment operator.
+    any_row_iterator operator++(int);
+
+    //! Prefix decrement operator.
+    any_row_iterator& operator--();
+
+    //! Postfix decrement operator.
+    any_row_iterator operator--(int);
+
+    //! Subscript operator.
+    reference operator[](difference_type m) const;
+
+    //! Assignment-increment operator.
+    any_row_iterator& operator+=(difference_type m);
+
+    //! Assignment-increment operator for \p m of unsigned type.
+    template <typename Unsigned>
+    typename Enable_If<(static_cast<Unsigned>(-1) > 0), any_row_iterator&>::type
+    operator+=(Unsigned m);
+
+    //! Assignment-decrement operator.
+    any_row_iterator& operator-=(difference_type m);
+
+    //! Returns the difference between \p *this and \p y.
+    difference_type operator-(const any_row_iterator& y) const;
+
+    //! Returns the sum of \p *this and \p m.
+    any_row_iterator operator+(difference_type m) const;
+
+    //! Returns the sum of \p *this and \p m, for \p m of unsigned type.
+    template <typename Unsigned>
+    typename Enable_If<(static_cast<Unsigned>(-1) > 0), any_row_iterator>::type
+    operator+(Unsigned m) const;
+
+    //! Returns the difference of \p *this and \p m.
+    any_row_iterator operator-(difference_type m) const;
+
+    //! Returns <CODE>true</CODE> if and only if \p *this is equal to \p y.
+    bool operator==(const any_row_iterator& y) const;
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this
+      is different from \p y.
+    */
+    bool operator!=(const any_row_iterator& y) const;
+
+    //! Returns <CODE>true</CODE> if and only if \p *this is less than \p y.
+    bool operator<(const any_row_iterator& y) const;
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this is less than
+      or equal to \p y.
+    */
+    bool operator<=(const any_row_iterator& y) const;
+
+    //! Returns <CODE>true</CODE> if and only if \p *this is greater than \p y.
+    bool operator>(const any_row_iterator& y) const;
+
+    /*! \brief
+      Returns <CODE>true</CODE> if and only if \p *this is greater than
+      or equal to \p y.
+    */
+    bool operator>=(const any_row_iterator& y) const;
+
+    dimension_type row_size() const;
+
+    dimension_type index() const;
+
+  private:
+    //! Represents the beginning of a row.
+    Pseudo_Row<U> value;
+
+    //! External index.
+    dimension_type e;
+
+    //! Internal index: <CODE>i = (e+1)*(e+1)/2</CODE>.
+    dimension_type i;
+
+    // FIXME: the EDG-based compilers (such as Comeau and Intel)
+    // are here in wild disagreement with GCC: what is a legal friend
+    // declaration for one, is illegal for the others.
+#ifdef __EDG__
+    template <typename V> template<typename W>
+    friend class OR_Matrix<V>::any_row_iterator;
+#else
+    template <typename V> friend class any_row_iterator;
+#endif
+  }; // class any_row_iterator
+
+public:
+  //! A (non const) row iterator.
+  typedef any_row_iterator<T> row_iterator;
+
+  //! A const row iterator.
+  typedef any_row_iterator<const T> const_row_iterator;
+
+  //! A (non const) element iterator.
+  typedef typename DB_Row<T>::iterator element_iterator;
+
+  //! A const element iterator.
+  typedef typename DB_Row<T>::const_iterator const_element_iterator;
+
+public:
+  //! Returns the maximum number of rows of a OR_Matrix.
+  static dimension_type max_num_rows();
+
+  //! Builds a matrix with specified dimensions.
+  /*!
+    \param num_dimensions
+    The space dimension of the matrix that will be created.
+
+    This constructor creates a matrix with \p 2*num_dimensions rows.
+    Each element is initialized to plus infinity.
+  */
+  OR_Matrix(dimension_type num_dimensions);
+
+  //! Copy constructor.
+  OR_Matrix(const OR_Matrix& y);
+
+  //! Constructs a conservative approximation of \p y.
+  template <typename U>
+  explicit OR_Matrix(const OR_Matrix<U>& y);
+
+  //! Destructor.
+  ~OR_Matrix();
+
+  //! Assignment operator.
+  OR_Matrix& operator=(const OR_Matrix& y);
+
+private:
+  template <typename U> friend class OR_Matrix;
+
+  //! Contains the rows of the matrix.
+  /*!
+    A DB_Row which contains the rows of the OR_Matrix
+    inserting each successive row to the end of the vec.
+    To contain all the elements of OR_Matrix the size of the DB_Row
+    is 2*n*(n+1), where the n is the characteristic parameter of
+    OR_Matrix.
+  */
+  DB_Row<T> vec;
+
+  //! Contains the dimension of the space of the matrix.
+  dimension_type space_dim;
+
+  //! Contains the capacity of \p vec.
+  dimension_type vec_capacity;
+
+  //! Private and not implemented: default construction is not allowed.
+  OR_Matrix();
+
+  /*! \brief
+    Returns the index into <CODE>vec</CODE> of the first element
+    of the row of index \p k.
+  */
+  static dimension_type row_first_element_index(dimension_type k);
+
+public:
+  //! Returns the size of the row of index \p k.
+  static dimension_type row_size(dimension_type k);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(OR_Matrix& y);
+
+  //! Makes the matrix grow by adding more space dimensions.
+  /*!
+    \param new_dim
+    The new dimension of the resized matrix.
+
+    Adds new rows of right dimension to the end if
+    there is enough capacity; otherwise, creates a new matrix,
+    with the specified dimension, copying the old elements
+    in the upper part of the new matrix, which is
+    then assigned to \p *this.
+    Each new element is initialized to plus infinity.
+  */
+  void grow(dimension_type new_dim);
+
+  //! Makes the matrix shrink by removing the last space dimensions.
+  /*!
+    \param new_dim
+    The new dimension of the resized matrix.
+
+    Erases from matrix to the end the rows with index
+    greater than 2*new_dim-1.
+  */
+  void shrink(dimension_type new_dim);
+
+  //! Resizes the matrix without worrying about the old contents.
+  /*!
+    \param new_dim
+    The new dimension of the resized matrix.
+
+    If the new dimension is greater than the old one, it adds new rows
+    of right dimension to the end if there is enough capacity; otherwise,
+    it creates a new matrix, with the specified dimension, which is
+    then assigned to \p *this.
+    If the new dimension is less than the old one, it erase from the matrix
+    the rows having index greater than 2*new_dim-1
+  */
+  void resize_no_copy(dimension_type new_dim);
+
+  //! Returns the space-dimension of the matrix.
+  dimension_type space_dimension() const;
+
+  //! Returns the number of rows in the matrix.
+  dimension_type num_rows() const;
+
+  //! \name Subscript operators.
+  //@{
+  //! Returns a reference to the \p k-th row of the matrix.
+  row_reference_type operator[](dimension_type k);
+
+  //! Returns a constant reference to the \p k-th row of the matrix.
+  const_row_reference_type operator[](dimension_type k) const;
+  //@}
+
+
+  /*! \brief
+    Returns an iterator pointing to the first row,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  row_iterator row_begin();
+
+  //! Returns the past-the-end const_iterator.
+  row_iterator row_end();
+
+  /*! \brief
+    Returns a const row iterator pointing to the first row,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  const_row_iterator row_begin() const;
+
+  //! Returns the past-the-end const row iterator.
+  const_row_iterator row_end() const;
+
+  /*! \brief
+    Returns an iterator pointing to the first element,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  element_iterator element_begin();
+
+  //! Returns the past-the-end const_iterator.
+  element_iterator element_end();
+
+  /*! \brief
+    Returns a const element iterator pointing to the first element,
+    if \p *this is not empty;
+    otherwise, returns the past-the-end const_iterator.
+  */
+  const_element_iterator element_begin() const;
+
+  //! Returns the past-the-end const element iterator.
+  const_element_iterator element_end() const;
+
+  //! Clears the matrix deallocating all its rows.
+  void clear();
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  friend bool operator==<T>(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+void swap(OR_Matrix<T>& x, OR_Matrix<T>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+bool operator!=(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates OR_Matrix
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into to \p r
+  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const OR_Matrix<T>& x,
+                                 const OR_Matrix<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates OR_Matrix
+  If the Euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into to \p r
+  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const OR_Matrix<T>& x,
+                               const OR_Matrix<T>& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates OR_Matrix
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into to \p r
+  and returns <CODE>true</CODE>;  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const OR_Matrix<T>& x,
+                                 const OR_Matrix<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "OR_Matrix_inlines.hh"
+#include "OR_Matrix_templates.hh"
+
+#endif // !defined(PPL_OR_Matrix_defs_hh)
diff --git a/src/OR_Matrix_inlines.hh b/src/OR_Matrix_inlines.hh
new file mode 100644
index 0000000..f0e8349
--- /dev/null
+++ b/src/OR_Matrix_inlines.hh
@@ -0,0 +1,751 @@
+/* OR_Matrix class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_OR_Matrix_inlines_hh
+#define PPL_OR_Matrix_inlines_hh 1
+
+#include "globals_defs.hh"
+#include "Checked_Number_defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "distances_defs.hh"
+#include "assert.hh"
+#include "checked_defs.hh"
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline dimension_type
+OR_Matrix<T>::row_first_element_index(const dimension_type k) {
+  return ((k + 1)*(k + 1))/2;
+}
+
+template <typename T>
+inline dimension_type
+OR_Matrix<T>::row_size(const dimension_type k) {
+  return k + 2 - k % 2;
+}
+
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+
+template <typename T>
+template <typename U>
+inline dimension_type
+OR_Matrix<T>::Pseudo_Row<U>::size() const {
+  return size_;
+}
+
+#endif // PPL_OR_MATRIX_EXTRA_DEBUG
+
+template <typename T>
+template <typename U>
+inline
+OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row()
+  : first(0)
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  , size_(0)
+#endif
+{
+}
+
+template <typename T>
+template <typename U>
+inline
+OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row(U& y
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+                , dimension_type s
+#endif
+                )
+  : first(&y)
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  , size_(s)
+#endif
+{
+}
+
+template <typename T>
+template <typename U>
+template <typename V>
+inline
+OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row(const Pseudo_Row<V>& y)
+  : first(y.first)
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+    , size_(y.size_)
+#endif
+{
+}
+
+template <typename T>
+template <typename U>
+inline OR_Matrix<T>::Pseudo_Row<U>&
+OR_Matrix<T>::Pseudo_Row<U>::operator=(const Pseudo_Row& y) {
+  first = y.first;
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  size_ = y.size_;
+#endif
+  return *this;
+}
+
+template <typename T>
+template <typename U>
+inline
+OR_Matrix<T>::Pseudo_Row<U>::~Pseudo_Row() {
+}
+
+template <typename T>
+template <typename U>
+inline U&
+OR_Matrix<T>::Pseudo_Row<U>::operator[](const dimension_type k) const {
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  PPL_ASSERT(k < size_);
+#endif
+  return *(first + k);
+}
+
+template <typename T>
+template <typename U>
+inline
+OR_Matrix<T>::any_row_iterator<U>
+::any_row_iterator(const dimension_type n_rows)
+  : value(),
+    e(n_rows)
+    // Field `i' is intentionally not initialized here.
+{
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  // Turn `value' into a valid object.
+  value.size_ = OR_Matrix::row_size(e);
+#endif
+}
+
+template <typename T>
+template <typename U>
+inline
+OR_Matrix<T>::any_row_iterator<U>::any_row_iterator(U& base)
+  :  value(base
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+           , OR_Matrix<T>::row_size(0)
+#endif
+           ),
+     e(0),
+     i(0) {
+}
+
+template <typename T>
+template <typename U>
+template <typename V>
+inline
+OR_Matrix<T>::any_row_iterator<U>
+::any_row_iterator(const any_row_iterator<V>& y)
+  : value(y.value),
+    e(y.e),
+    i(y.i) {
+}
+
+template <typename T>
+template <typename U>
+template <typename V>
+inline typename OR_Matrix<T>::template any_row_iterator<U>&
+OR_Matrix<T>::any_row_iterator<U>::operator=(const any_row_iterator<V>& y) {
+  value = y.value;
+  e = y.e;
+  i = y.i;
+  return *this;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>::reference
+OR_Matrix<T>::any_row_iterator<U>::operator*() const {
+  return value;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>::pointer
+OR_Matrix<T>::any_row_iterator<U>::operator->() const {
+  return &value;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>&
+OR_Matrix<T>::any_row_iterator<U>::operator++() {
+  ++e;
+  dimension_type increment = e;
+  if (e % 2 != 0)
+    ++increment;
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  else {
+    value.size_ += 2;
+  }
+#endif
+  i += increment;
+  value.first += increment;
+  return *this;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>
+OR_Matrix<T>::any_row_iterator<U>::operator++(int) {
+  any_row_iterator old = *this;
+  ++(*this);
+  return old;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>&
+OR_Matrix<T>::any_row_iterator<U>::operator--() {
+  dimension_type decrement = e + 1;
+  --e;
+  if (e % 2 != 0) {
+    ++decrement;
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+    value.size_ -= 2;
+#endif
+  }
+  i -= decrement;
+  value.first -= decrement;
+  return *this;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>
+OR_Matrix<T>::any_row_iterator<U>::operator--(int) {
+  any_row_iterator old = *this;
+  --(*this);
+  return old;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>&
+OR_Matrix<T>::any_row_iterator<U>::operator+=(const difference_type m) {
+  difference_type e_dt = static_cast<difference_type>(e);
+  difference_type i_dt = static_cast<difference_type>(i);
+  difference_type increment = m + (m * m) / 2 + m * e_dt;
+  if (e_dt % 2 == 0 && m % 2 != 0)
+    ++increment;
+  e_dt += m;
+  i_dt += increment;
+  e = static_cast<dimension_type>(e_dt);
+  i = static_cast<dimension_type>(i_dt);
+  value.first += increment;
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  difference_type value_size_dt = static_cast<difference_type>(value.size_);
+  value_size_dt += (m - m % 2);
+  value.size_ = static_cast<dimension_type>(value_size_dt);
+#endif
+  return *this;
+}
+
+template <typename T>
+template <typename U>
+template <typename Unsigned>
+inline typename
+Enable_If<(static_cast<Unsigned>(-1) > 0),
+            typename OR_Matrix<T>::template any_row_iterator<U>& >::type
+OR_Matrix<T>::any_row_iterator<U>::operator+=(Unsigned m) {
+  dimension_type n = m;
+  dimension_type increment = n + (n*n)/2 + n*e;
+  if (e % 2 == 0 && n % 2 != 0)
+    ++increment;
+  e += n;
+  i += increment;
+  value.first += increment;
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+  value.size_ = value.size_ + n - n % 2;
+#endif
+  return *this;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>&
+OR_Matrix<T>::any_row_iterator<U>::operator-=(difference_type m) {
+  return *this += -m;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>::difference_type
+OR_Matrix<T>::any_row_iterator<U>::operator-(const any_row_iterator& y) const {
+  return e - y.e;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>
+OR_Matrix<T>::any_row_iterator<U>::operator+(difference_type m) const {
+  any_row_iterator r = *this;
+  r += m;
+  return r;
+}
+
+template <typename T>
+template <typename U>
+template <typename Unsigned>
+inline typename
+Enable_If<(static_cast<Unsigned>(-1) > 0),
+            typename OR_Matrix<T>::template any_row_iterator<U> >::type
+OR_Matrix<T>::any_row_iterator<U>::operator+(Unsigned m) const {
+  any_row_iterator r = *this;
+  r += m;
+  return r;
+}
+
+template <typename T>
+template <typename U>
+inline typename OR_Matrix<T>::template any_row_iterator<U>
+OR_Matrix<T>::any_row_iterator<U>::operator-(const difference_type m) const {
+  any_row_iterator r = *this;
+  r -= m;
+  return r;
+}
+
+template <typename T>
+template <typename U>
+inline bool
+OR_Matrix<T>::any_row_iterator<U>
+::operator==(const any_row_iterator& y) const {
+  return e == y.e;
+}
+
+template <typename T>
+template <typename U>
+inline bool
+OR_Matrix<T>::any_row_iterator<U>
+::operator!=(const any_row_iterator& y) const {
+  return e != y.e;
+}
+
+template <typename T>
+template <typename U>
+inline bool
+OR_Matrix<T>::any_row_iterator<U>::operator<(const any_row_iterator& y) const {
+  return e < y.e;
+}
+
+template <typename T>
+template <typename U>
+inline bool
+OR_Matrix<T>::any_row_iterator<U>
+::operator<=(const any_row_iterator& y) const {
+  return e <= y.e;
+}
+
+template <typename T>
+template <typename U>
+inline bool
+OR_Matrix<T>::any_row_iterator<U>::operator>(const any_row_iterator& y) const {
+  return e > y.e;
+}
+
+template <typename T>
+template <typename U>
+inline bool
+OR_Matrix<T>::any_row_iterator<U>
+::operator>=(const any_row_iterator& y) const {
+  return e >= y.e;
+}
+
+template <typename T>
+template <typename U>
+inline dimension_type
+OR_Matrix<T>::any_row_iterator<U>::row_size() const {
+  return OR_Matrix::row_size(e);
+}
+
+template <typename T>
+template <typename U>
+inline dimension_type
+OR_Matrix<T>::any_row_iterator<U>::index() const {
+  return e;
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::row_iterator
+OR_Matrix<T>::row_begin() {
+  return num_rows() == 0 ? row_iterator(0) : row_iterator(vec[0]);
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::row_iterator
+OR_Matrix<T>::row_end() {
+  return row_iterator(num_rows());
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::const_row_iterator
+OR_Matrix<T>::row_begin() const {
+  return num_rows() == 0 ? const_row_iterator(0) : const_row_iterator(vec[0]);
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::const_row_iterator
+OR_Matrix<T>::row_end() const {
+  return const_row_iterator(num_rows());
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::element_iterator
+OR_Matrix<T>::element_begin() {
+  return vec.begin();
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::element_iterator
+OR_Matrix<T>::element_end() {
+  return vec.end();
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::const_element_iterator
+OR_Matrix<T>::element_begin() const {
+  return vec.begin();
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::const_element_iterator
+OR_Matrix<T>::element_end() const {
+  return vec.end();
+}
+
+template <typename T>
+inline void
+OR_Matrix<T>::m_swap(OR_Matrix& y) {
+  using std::swap;
+  swap(vec, y.vec);
+  swap(space_dim, y.space_dim);
+  swap(vec_capacity, y.vec_capacity);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the integer square root of \p x.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+inline dimension_type
+isqrt(dimension_type x) {
+  dimension_type r = 0;
+  const dimension_type FIRST_BIT_MASK = 0x40000000U;
+  for (dimension_type t = FIRST_BIT_MASK; t != 0; t >>= 2) {
+    const dimension_type s = r + t;
+    if (s <= x) {
+      x -= s;
+      r = s + t;
+    }
+    r >>= 1;
+  }
+  return r;
+}
+
+template <typename T>
+inline dimension_type
+OR_Matrix<T>::max_num_rows() {
+  // Compute the maximum number of rows that are contained in a DB_Row
+  // that allocates a pseudo-triangular matrix.
+  const dimension_type k = isqrt(2*DB_Row<T>::max_size() + 1);
+  return (k - 1) - (k - 1) % 2;
+}
+
+template <typename T>
+inline memory_size_type
+OR_Matrix<T>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename T>
+inline
+OR_Matrix<T>::OR_Matrix(const dimension_type num_dimensions)
+  : vec(2*num_dimensions*(num_dimensions + 1)),
+    space_dim(num_dimensions),
+    vec_capacity(vec.size()) {
+}
+
+template <typename T>
+inline
+OR_Matrix<T>::~OR_Matrix() {
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::row_reference_type
+OR_Matrix<T>::operator[](dimension_type k) {
+  return row_reference_type(vec[row_first_element_index(k)]
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+                            , row_size(k)
+#endif
+                            );
+}
+
+template <typename T>
+inline typename OR_Matrix<T>::const_row_reference_type
+OR_Matrix<T>::operator[](dimension_type k) const {
+  return const_row_reference_type(vec[row_first_element_index(k)]
+#if PPL_OR_MATRIX_EXTRA_DEBUG
+                                  , row_size(k)
+#endif
+                                  );
+}
+
+template <typename T>
+inline dimension_type
+OR_Matrix<T>::space_dimension() const {
+  return space_dim;
+}
+
+template <typename T>
+inline dimension_type
+OR_Matrix<T>::num_rows() const {
+  return 2*space_dimension();
+}
+
+template <typename T>
+inline void
+OR_Matrix<T>::clear() {
+  OR_Matrix<T>(0).m_swap(*this);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+inline bool
+operator==(const OR_Matrix<T>& x, const OR_Matrix<T>& y) {
+  return x.space_dim == y.space_dim && x.vec == y.vec;
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+inline bool
+operator!=(const OR_Matrix<T>& x, const OR_Matrix<T>& y) {
+  return !(x == y);
+}
+
+template <typename T>
+inline
+OR_Matrix<T>::OR_Matrix(const OR_Matrix& y)
+  : vec(y.vec),
+    space_dim(y.space_dim),
+    vec_capacity(compute_capacity(y.vec.size(),
+                                  DB_Row<T>::max_size())) {
+}
+
+template <typename T>
+template <typename U>
+inline
+OR_Matrix<T>::OR_Matrix(const OR_Matrix<U>& y)
+  : vec(),
+    space_dim(y.space_dim),
+    vec_capacity(compute_capacity(y.vec.size(),
+                                  DB_Row<T>::max_size())) {
+  vec.construct_upward_approximation(y.vec, vec_capacity);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline OR_Matrix<T>&
+OR_Matrix<T>::operator=(const OR_Matrix& y) {
+  vec = y.vec;
+  space_dim = y.space_dim;
+  vec_capacity = compute_capacity(y.vec.size(), DB_Row<T>::max_size());
+  return *this;
+}
+
+template <typename T>
+inline void
+OR_Matrix<T>::grow(const dimension_type new_dim) {
+  PPL_ASSERT(new_dim >= space_dim);
+  if (new_dim > space_dim) {
+    const dimension_type new_size = 2*new_dim*(new_dim + 1);
+    if (new_size <= vec_capacity) {
+      // We can recycle the old vec.
+      vec.expand_within_capacity(new_size);
+      space_dim = new_dim;
+    }
+    else {
+      // We cannot recycle the old vec.
+      OR_Matrix<T> new_matrix(new_dim);
+      element_iterator j = new_matrix.element_begin();
+      for (element_iterator i = element_begin(),
+             mend = element_end(); i != mend; ++i, ++j)
+        assign_or_swap(*j, *i);
+      m_swap(new_matrix);
+    }
+  }
+}
+
+template <typename T>
+inline void
+OR_Matrix<T>::shrink(const dimension_type new_dim) {
+  PPL_ASSERT(new_dim <= space_dim);
+  const dimension_type new_size = 2*new_dim*(new_dim + 1);
+  vec.shrink(new_size);
+  space_dim = new_dim;
+}
+
+template <typename T>
+inline void
+OR_Matrix<T>::resize_no_copy(const dimension_type new_dim) {
+  if (new_dim > space_dim) {
+    const dimension_type new_size = 2*new_dim*(new_dim + 1);
+    if (new_size <= vec_capacity) {
+      // We can recycle the old vec.
+      vec.expand_within_capacity(new_size);
+      space_dim = new_dim;
+    }
+    else {
+      // We cannot recycle the old vec.
+      OR_Matrix<T> new_matrix(new_dim);
+      m_swap(new_matrix);
+    }
+  }
+  else if (new_dim < space_dim)
+    shrink(new_dim);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Specialization, typename Temp, typename To, typename T>
+inline bool
+l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                    const OR_Matrix<T>& x,
+                    const OR_Matrix<T>& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0,
+                    Temp& tmp1,
+                    Temp& tmp2) {
+  if (x.num_rows() != y.num_rows())
+    return false;
+  assign_r(tmp0, 0, ROUND_NOT_NEEDED);
+  for (typename OR_Matrix<T>::const_element_iterator
+         i = x.element_begin(), j = y.element_begin(),
+         mat_end = x.element_end(); i != mat_end; ++i, ++j) {
+    const T& x_i = *i;
+    const T& y_i = *j;
+    if (is_plus_infinity(x_i)) {
+      if (is_plus_infinity(y_i))
+        continue;
+      else {
+      pinf:
+        assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+        return true;
+      }
+    }
+    else if (is_plus_infinity(y_i))
+      goto pinf;
+
+    const Temp* tmp1p;
+    const Temp* tmp2p;
+    if (x_i > y_i) {
+      maybe_assign(tmp1p, tmp1, x_i, dir);
+      maybe_assign(tmp2p, tmp2, y_i, inverse(dir));
+    }
+    else {
+      maybe_assign(tmp1p, tmp1, y_i, dir);
+      maybe_assign(tmp2p, tmp2, x_i, inverse(dir));
+    }
+    sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
+    PPL_ASSERT(sgn(tmp1) >= 0);
+    Specialization::combine(tmp0, tmp1, dir);
+  }
+
+  Specialization::finalize(tmp0, dir);
+  assign_r(r, tmp0, dir);
+  return true;
+}
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const OR_Matrix<T>& x,
+                            const OR_Matrix<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
+  return
+    l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >(r, x, y,
+                                                                    dir,
+                                                                    tmp0,
+                                                                    tmp1,
+                                                                    tmp2);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const OR_Matrix<T>& x,
+                          const OR_Matrix<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
+  return
+    l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >(r, x, y,
+                                                                  dir,
+                                                                  tmp0,
+                                                                  tmp1,
+                                                                  tmp2);
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Temp, typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const OR_Matrix<T>& x,
+                           const OR_Matrix<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
+  return
+    l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >(r, x, y,
+                                                                   dir,
+                                                                   tmp0,
+                                                                   tmp1,
+                                                                   tmp2);
+}
+
+/*! \relates OR_Matrix */
+template <typename T>
+inline void
+swap(OR_Matrix<T>& x, OR_Matrix<T>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_OR_Matrix_inlines_hh)
diff --git a/src/OR_Matrix_templates.hh b/src/OR_Matrix_templates.hh
new file mode 100644
index 0000000..303677a
--- /dev/null
+++ b/src/OR_Matrix_templates.hh
@@ -0,0 +1,124 @@
+/* OR_Matrix class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_OR_Matrix_templates_hh
+#define PPL_OR_Matrix_templates_hh 1
+
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+memory_size_type
+OR_Matrix<T>::external_memory_in_bytes() const{
+  return vec.external_memory_in_bytes();
+}
+
+template <typename T>
+bool
+OR_Matrix<T>::OK() const {
+#ifndef NDEBUG
+  using std::endl;
+  using std::cerr;
+#endif
+  // The right number of cells should be in use.
+  const dimension_type dim = space_dimension();
+  if (vec.size() != 2*dim*(dim + 1)) {
+#ifndef NDEBUG
+    cerr << "OR_Matrix has a wrong number of cells:\n"
+         << "vec.size() is " << vec.size()
+         << ", expected size is " << (2*dim*(dim+1)) << "!\n";
+#endif
+    return false;
+  }
+
+  // The underlying DB_Row should be OK.
+  if (!vec.OK(vec.size(), vec_capacity))
+    return false;
+
+  // All checks passed.
+  return true;
+}
+
+template <typename T>
+void
+OR_Matrix<T>::ascii_dump(std::ostream& s) const {
+  const OR_Matrix<T>& x = *this;
+  const char separator = ' ';
+  dimension_type space = x.space_dimension();
+  s << space << separator << "\n";
+  for (const_row_iterator i = x.row_begin(),
+         x_row_end = x.row_end(); i != x_row_end; ++i) {
+    const_row_reference_type r = *i;
+    dimension_type rs = i.row_size();
+    for (dimension_type j = 0; j < rs; ++j) {
+      using namespace IO_Operators;
+      s << r[j] << separator;
+    }
+    s << "\n";
+  }
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, OR_Matrix<T>)
+
+template <typename T>
+bool
+OR_Matrix<T>::ascii_load(std::istream& s) {
+  dimension_type space;
+  if (!(s >> space))
+    return false;
+  resize_no_copy(space);
+  for (row_iterator i = row_begin(),
+         this_row_end = row_end(); i != this_row_end; ++i) {
+    row_reference_type r_i = *i;
+    const dimension_type rs = i.row_size();
+    for (dimension_type j = 0; j < rs; ++j) {
+      Result r = input(r_i[j], s, ROUND_CHECK);
+      if (result_relation(r) != VR_EQ || is_minus_infinity(r_i[j]))
+        return false;
+    }
+  }
+  PPL_ASSERT(OK());
+  return true;
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Parma_Polyhedra_Library::OR_Matrix */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+std::ostream&
+IO_Operators::operator<<(std::ostream& s, const OR_Matrix<T>& m) {
+  for (typename OR_Matrix<T>::const_row_iterator m_iter = m.row_begin(),
+         m_end = m.row_end(); m_iter != m_end; ++m_iter) {
+    typename OR_Matrix<T>::const_row_reference_type r_m = *m_iter;
+    const dimension_type mr_size = m_iter.row_size();
+    for (dimension_type j = 0; j < mr_size; ++j)
+      s << r_m[j] << " ";
+    s << "\n";
+  }
+  return s;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_OR_Matrix_templates_hh)
diff --git a/src/OR_Matrix_types.hh b/src/OR_Matrix_types.hh
new file mode 100644
index 0000000..2b46764
--- /dev/null
+++ b/src/OR_Matrix_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_OR_Matrix_types_hh
+#define PPL_OR_Matrix_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class OR_Matrix;
+
+}
+
+#endif // !defined(PPL_OR_Matrix_types_hh)
diff --git a/src/Octagonal_Shape.cc b/src/Octagonal_Shape.cc
index c9d0cf8..924f21e 100644
--- a/src/Octagonal_Shape.cc
+++ b/src/Octagonal_Shape.cc
@@ -1,6 +1,6 @@
 /* Octagonal_Shape class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Octagonal_Shape.defs.hh"
+#include "Octagonal_Shape_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
diff --git a/src/Octagonal_Shape.defs.hh b/src/Octagonal_Shape.defs.hh
deleted file mode 100644
index e6f1d4f..0000000
--- a/src/Octagonal_Shape.defs.hh
+++ /dev/null
@@ -1,2324 +0,0 @@
-/* Octagonal_Shape class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Octagonal_Shape_defs_hh
-#define PPL_Octagonal_Shape_defs_hh 1
-
-#include "Octagonal_Shape.types.hh"
-#include "globals.types.hh"
-#include "Constraint.types.hh"
-#include "Generator.types.hh"
-#include "Congruence.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint_System.types.hh"
-#include "Generator_System.types.hh"
-#include "Congruence_System.types.hh"
-#include "OR_Matrix.defs.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "Polyhedron.types.hh"
-#include "Box.types.hh"
-#include "Grid.types.hh"
-#include "BD_Shape.types.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.types.hh"
-#include "Checked_Number.defs.hh"
-#include "WRD_coefficient_types.defs.hh"
-#include "Bit_Row.defs.hh"
-#include "Interval.types.hh"
-#include "Linear_Form.types.hh"
-#include <vector>
-#include <cstddef>
-#include <climits>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Octagonal_Shape
-  Writes a textual representation of \p oct on \p s:
-  <CODE>false</CODE> is written if \p oct is an empty polyhedron;
-  <CODE>true</CODE> is written if \p oct is a universe polyhedron;
-  a system of constraints defining \p oct is written otherwise,
-  all constraints separated by ", ".
-*/
-template <typename T>
-std::ostream&
-operator<<(std::ostream& s, const Octagonal_Shape<T>& oct);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Octagonal_Shape */
-template <typename T>
-void swap(Octagonal_Shape<T>& x, Octagonal_Shape<T>& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x and \p y are the same octagon.
-
-  \relates Octagonal_Shape
-  Note that \p x and \p y may be dimension-incompatible shapes:
-  in this case, the value <CODE>false</CODE> is returned.
-*/
-template <typename T>
-bool operator==(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x and \p y are different shapes.
-
-  \relates Octagonal_Shape
-  Note that \p x and \p y may be dimension-incompatible shapes:
-  in this case, the value <CODE>true</CODE> is returned.
-*/
-template <typename T>
-bool operator!=(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Octagonal_Shape<T>& x,
-                                 const Octagonal_Shape<T>& y,
-                                 Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Octagonal_Shape<T>& x,
-                                 const Octagonal_Shape<T>& y,
-                                 Rounding_Dir dir);
-
-//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the rectilinear distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename T>
-bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                 const Octagonal_Shape<T>& x,
-                                 const Octagonal_Shape<T>& y,
-                                 Rounding_Dir dir,
-                                 Temp& tmp0,
-                                 Temp& tmp1,
-                                 Temp& tmp2);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const Octagonal_Shape<T>& x,
-                               const Octagonal_Shape<T>& y,
-                               Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const Octagonal_Shape<T>& x,
-                               const Octagonal_Shape<T>& y,
-                               Rounding_Dir dir);
-
-//! Computes the euclidean distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the euclidean distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename T>
-bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                               const Octagonal_Shape<T>& x,
-                               const Octagonal_Shape<T>& y,
-                               Rounding_Dir dir,
-                               Temp& tmp0,
-                               Temp& tmp1,
-                               Temp& tmp2);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
-*/
-template <typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const Octagonal_Shape<T>& x,
-                                const Octagonal_Shape<T>& y,
-                                Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
-*/
-template <typename Temp, typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const Octagonal_Shape<T>& x,
-                                const Octagonal_Shape<T>& y,
-                                Rounding_Dir dir);
-
-//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
-/*! \relates Octagonal_Shape
-  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
-  stores an approximation of it into \p r and returns <CODE>true</CODE>;
-  returns <CODE>false</CODE> otherwise.
-
-  The direction of the approximation is specified by \p dir.
-
-  All computations are performed using the temporary variables
-  \p tmp0, \p tmp1 and \p tmp2.
-*/
-template <typename Temp, typename To, typename T>
-bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-                                const Octagonal_Shape<T>& x,
-                                const Octagonal_Shape<T>& y,
-                                Rounding_Dir dir,
-                                Temp& tmp0,
-                                Temp& tmp1,
-                                Temp& tmp2);
-
-// This class contains some helper functions that need to be friends of
-// Linear_Expression.
-class Octagonal_Shape_Helper {
-public:
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! Decodes the constraint \p c as an octagonal difference.
-  /*! \relates Octagonal_Shape
-    \return
-    <CODE>true</CODE> if the constraint \p c is an octagonal difference;
-    <CODE>false</CODE> otherwise.
-
-    \param c
-    The constraint to be decoded.
-
-    \param c_space_dim
-    The space dimension of the constraint \p c (it is <EM>assumed</EM>
-    to match the actual space dimension of \p c).
-
-    \param c_num_vars
-    If <CODE>true</CODE> is returned, then it will be set to the number
-    of variables having a non-zero coefficient. The only legal values
-    will therefore be 0, 1 and 2.
-
-    \param c_first_var
-    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
-    then it will be set to the index of the first variable having
-    a non-zero coefficient in \p c.
-
-    \param c_second_var
-    If <CODE>true</CODE> is returned and if \p c_num_vars is set to 2,
-    then it will be set to the index of the second variable having
-    a non-zero coefficient in \p c.
-
-    \param c_coeff
-    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
-    then it will be set to the value of the first non-zero coefficient
-    in \p c.
-
-    \param c_term
-    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
-    then it will be set to the right value of the inhomogeneous term
-    of \p c.
-  */
-  #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  static bool extract_octagonal_difference(const Constraint& c,
-                                           dimension_type c_space_dim,
-                                           dimension_type& c_num_vars,
-                                           dimension_type& c_first_var,
-                                           dimension_type& c_second_var,
-                                           Coefficient& c_coeff,
-                                           Coefficient& c_term);
-};
-
-} // namespace Parma_Polyhedra_Library
-
-//! An octagonal shape.
-/*! \ingroup PPL_CXX_interface
-  The class template Octagonal_Shape<T> allows for the efficient
-  representation of a restricted kind of <EM>topologically closed</EM>
-  convex polyhedra called <EM>octagonal shapes</EM> (OSs, for short).
-  The name comes from the fact that, in a vector space of dimension 2,
-  bounded OSs are polygons with at most eight sides.
-  The closed affine half-spaces that characterize the OS can be expressed
-  by constraints of the form
-  \f[
-    ax_i + bx_j \leq k
-  \f]
-  where \f$a, b \in \{-1, 0, 1\}\f$ and \f$k\f$ is a rational number,
-  which are called <EM>octagonal constraints</EM>.
-
-  Based on the class template type parameter \p T, a family of extended
-  numbers is built and used to approximate the inhomogeneous term of
-  octagonal constraints. These extended numbers provide a representation
-  for the value \f$+\infty\f$, as well as <EM>rounding-aware</EM>
-  implementations for several arithmetic functions.
-  The value of the type parameter \p T may be one of the following:
-    - a bounded precision integer type (e.g., \c int32_t or \c int64_t);
-    - a bounded precision floating point type (e.g., \c float or \c double);
-    - an unbounded integer or rational type, as provided by GMP
-      (i.e., \c mpz_class or \c mpq_class).
-
-  The user interface for OSs is meant to be as similar as possible to
-  the one developed for the polyhedron class C_Polyhedron.
-
-  The OS domain <EM>optimally supports</EM>:
-    - tautological and inconsistent constraints and congruences;
-    - octagonal constraints;
-    - non-proper congruences (i.e., equalities) that are expressible
-      as octagonal constraints.
-
-  Depending on the method, using a constraint or congruence that is not
-  optimally supported by the domain will either raise an exception or
-  result in a (possibly non-optimal) upward approximation.
-
-  A constraint is octagonal if it has the form
-    \f[
-      \pm a_i x_i \pm a_j x_j \relsym b
-    \f]
-  where \f$\mathord{\relsym} \in \{ \leq, =, \geq \}\f$ and
-  \f$a_i\f$, \f$a_j\f$, \f$b\f$ are integer coefficients such that
-  \f$a_i = 0\f$, or \f$a_j = 0\f$, or \f$a_i = a_j\f$.
-  The user is warned that the above octagonal Constraint object
-  will be mapped into a \e correct and \e optimal approximation that,
-  depending on the expressive power of the chosen template argument \p T,
-  may loose some precision.
-  Also note that strict constraints are not octagonal.
-
-  For instance, a Constraint object encoding \f$3x + 3y \leq 1\f$ will be
-  approximated by:
-    - \f$x + y \leq 1\f$,
-      if \p T is a (bounded or unbounded) integer type;
-    - \f$x + y \leq \frac{1}{3}\f$,
-      if \p T is the unbounded rational type \c mpq_class;
-    - \f$x + y \leq k\f$, where \f$k > \frac{1}{3}\f$,
-      if \p T is a floating point type (having no exact representation
-      for \f$\frac{1}{3}\f$).
-
-  On the other hand, depending from the context, a Constraint object
-  encoding \f$3x - y \leq 1\f$ will be either upward approximated
-  (e.g., by safely ignoring it) or it will cause an exception.
-
-  In the following examples it is assumed that the type argument \p T
-  is one of the possible instances listed above and that variables
-  \c x, \c y and \c z are defined (where they are used) as follows:
-  \code
-    Variable x(0);
-    Variable y(1);
-    Variable z(2);
-  \endcode
-
-  \par Example 1
-  The following code builds an OS corresponding to a cube in \f$\Rset^3\f$,
-  given as a system of constraints:
-  \code
-    Constraint_System cs;
-    cs.insert(x >= 0);
-    cs.insert(x <= 3);
-    cs.insert(y >= 0);
-    cs.insert(y <= 3);
-    cs.insert(z >= 0);
-    cs.insert(z <= 3);
-    Octagonal_Shape<T> oct(cs);
-  \endcode
-  In contrast, the following code will raise an exception,
-  since constraints 7, 8, and 9 are not octagonal:
-  \code
-    Constraint_System cs;
-    cs.insert(x >= 0);
-    cs.insert(x <= 3);
-    cs.insert(y >= 0);
-    cs.insert(y <= 3);
-    cs.insert(z >= 0);
-    cs.insert(z <= 3);
-    cs.insert(x - 3*y <= 5);    // (7)
-    cs.insert(x - y + z <= 5);  // (8)
-    cs.insert(x + y + z <= 5);  // (9)
-    Octagonal_Shape<T> oct(cs);
-  \endcode
-*/
-template <typename T>
-class Parma_Polyhedra_Library::Octagonal_Shape {
-private:
-  /*! \brief
-    The (extended) numeric type of the inhomogeneous term of
-    the inequalities defining an OS.
-  */
-#ifndef NDEBUG
-  typedef Checked_Number<T, Debug_WRD_Extended_Number_Policy> N;
-#else
-  typedef Checked_Number<T, WRD_Extended_Number_Policy> N;
-#endif
-
-public:
-
-  //! The numeric base type upon which OSs are built.
-  typedef T coefficient_type_base;
-
-  /*! \brief
-    The (extended) numeric type of the inhomogeneous term of the
-    inequalities defining an OS.
-  */
-  typedef N coefficient_type;
-
-  //! Returns the maximum space dimension that an OS can handle.
-  static dimension_type max_space_dimension();
-
-  /*! \brief
-    Returns false indicating that this domain cannot recycle constraints
-  */
-  static bool can_recycle_constraint_systems();
-
-  /*! \brief
-    Returns false indicating that this domain cannot recycle congruences
-  */
-  static bool can_recycle_congruence_systems();
-
-  //! \name Constructors, Assignment, Swap and Destructor
-  //@{
-
-  //! Builds an universe or empty OS of the specified space dimension.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the OS;
-
-    \param kind
-    Specifies whether the universe or the empty OS has to be built.
-  */
-  explicit Octagonal_Shape(dimension_type num_dimensions = 0,
-                           Degenerate_Element kind = UNIVERSE);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  Octagonal_Shape(const Octagonal_Shape& y,
-                  Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a conservative, upward approximation of \p y.
-  /*!
-    The complexity argument is ignored.
-  */
-  template <typename U>
-  explicit Octagonal_Shape(const Octagonal_Shape<U>& y,
-                           Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds an OS from the system of constraints \p cs.
-  /*!
-    The OS inherits the space dimension of \p cs.
-
-    \param cs
-    A system of octagonal constraints.
-
-    \exception std::invalid_argument
-    Thrown if \p cs contains a constraint which is not optimally supported
-    by the Octagonal shape domain.
-  */
-  explicit Octagonal_Shape(const Constraint_System& cs);
-
-  //! Builds an OS from a system of congruences.
-  /*!
-    The OS inherits the space dimension of \p cgs
-
-    \param cgs
-    A system of congruences.
-
-    \exception std::invalid_argument
-    Thrown if \p cgs contains a congruence which is not optimally supported
-    by the Octagonal shape domain.
-  */
-  explicit Octagonal_Shape(const Congruence_System& cgs);
-
-  //! Builds an OS from the system of generators \p gs.
-  /*!
-    Builds the smallest OS containing the polyhedron defined by \p gs.
-    The OS inherits the space dimension of \p gs.
-
-    \exception std::invalid_argument
-    Thrown if the system of generators is not empty but has no points.
-  */
-  explicit Octagonal_Shape(const Generator_System& gs);
-
-  //! Builds an OS from the polyhedron \p ph.
-  /*!
-    Builds an OS containing \p ph using algorithms whose complexity
-    does not exceed the one specified by \p complexity.  If
-    \p complexity is \p ANY_COMPLEXITY, then the OS built is the
-    smallest one containing \p ph.
-  */
-  explicit Octagonal_Shape(const Polyhedron& ph,
-                           Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds an OS out of a box.
-  /*!
-    The OS inherits the space dimension of the box.
-    The built OS is the most precise OS that includes the box.
-
-    \param box
-    The box representing the OS to be built.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename Interval>
-  explicit Octagonal_Shape(const Box<Interval>& box,
-                           Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds an OS that approximates a grid.
-  /*!
-    The OS inherits the space dimension of the grid.
-    The built OS is the most precise OS that includes the grid.
-
-    \param grid
-    The grid used to build the OS.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p grid exceeds the maximum
-    allowed space dimension.
-  */
-  explicit Octagonal_Shape(const Grid& grid,
-                           Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds an OS from a BD shape.
-  /*!
-    The OS inherits the space dimension of the BD shape.
-    The built OS is the most precise OS that includes the BD shape.
-
-    \param bd
-    The BD shape used to build the OS.
-
-    \param complexity
-    This argument is ignored as the algorithm used has
-    polynomial complexity.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p bd exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename U>
-  explicit Octagonal_Shape(const BD_Shape<U>& bd,
-                           Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator.
-    (\p *this and \p y can be dimension-incompatible.)
-  */
-  Octagonal_Shape& operator=(const Octagonal_Shape& y);
-
-  /*! \brief
-    Swaps \p *this with octagon \p y.
-    (\p *this and \p y can be dimension-incompatible.)
-  */
-  void m_swap(Octagonal_Shape& y);
-
-  //! Destructor.
-  ~Octagonal_Shape();
-
-  //@} Constructors, Assignment, Swap and Destructor
-
-  //! \name Member Functions that Do Not Modify the Octagonal_Shape
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
-    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
-    of \p *this.
-  */
-  dimension_type affine_dimension() const;
-
-  //! Returns the system of constraints defining \p *this.
-  Constraint_System constraints() const;
-
-  //! Returns a minimized system of constraints defining \p *this.
-  Constraint_System minimized_constraints() const;
-
-  //! Returns a system of (equality) congruences satisfied by \p *this.
-  Congruence_System congruences() const;
-
-  /*! \brief
-    Returns a minimal system of (equality) congruences
-    satisfied by \p *this with the same affine dimension as \p *this.
-  */
-  Congruence_System minimized_congruences() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool contains(const Octagonal_Shape& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool strictly_contains(const Octagonal_Shape& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool is_disjoint_from(const Octagonal_Shape& y) const;
-
-  /*! \brief
-    Returns the relations holding between \p *this and the constraint \p c.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  /*! \brief
-    Returns the relations holding between \p *this and the congruence \p cg.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cg are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  /*! \brief
-    Returns the relations holding between \p *this and the generator \p g.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  Poly_Gen_Relation relation_with(const Generator& g) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is an empty OS.
-  bool is_empty() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is a universe OS.
-  bool is_universe() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
-  bool is_discrete() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a bounded OS.
-  */
-  bool is_bounded() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a topologically closed subset of the vector space.
-  */
-  bool is_topologically_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains (at least) an integer point.
-  */
-  bool contains_integer_point() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  bool constrains(Variable var) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from above in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from below in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
-    and \p maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value;
-
-    \param g
-    When maximization succeeds, will be assigned the point or
-    closure point where \p expr reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p g are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-                Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value;
-
-    \param g
-    When minimization succeeds, will be assigned a point or
-    closure point where \p expr reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p g are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-                Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if there exist a
-    unique value \p val such that \p *this
-    saturates the equality <CODE>expr = val</CODE>.
-
-    \param expr
-    The linear expression for which the frequency is needed;
-
-    \param freq_n
-    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
-    Present for interface compatibility with class Grid, where
-    the \ref Grid_Frequency "frequency" can have a non-zero value;
-
-    \param freq_d
-    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
-
-    \param val_n
-    The numerator of \p val;
-
-    \param val_d
-    The denominator of \p val;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
-    \p val_n and \p val_d are left untouched.
-  */
-  bool frequency(const Linear_Expression& expr,
-                 Coefficient& freq_n, Coefficient& freq_d,
-                 Coefficient& val_n, Coefficient& val_d) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //@} Member Functions that Do Not Modify the Octagonal_Shape
-
-  //! \name Space-Dimension Preserving Member Functions that May Modify the Octagonal_Shape
-  //@{
-
-  /*! \brief
-    Adds a copy of constraint \p c to the system of constraints
-    defining \p *this.
-
-    \param c
-    The constraint to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible,
-    or \p c is not optimally supported by the OS domain.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of constraints
-    defining \p *this.
-
-    \param  cs
-    The constraints that will be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible,
-    or \p cs contains a constraint which is not optimally supported
-    by the OS domain.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of constraints
-    of \p *this.
-
-    \param cs
-    The constraint system to be added to \p *this.  The constraints in
-    \p cs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible,
-    or \p cs contains a constraint which is not optimally supported
-    by the OS domain.
-
-    \warning
-    The only assumption that can be made on \p cs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_constraints(Constraint_System& cs);
-
-  /*! \brief
-    Adds to \p *this a constraint equivalent to the congruence \p cg.
-
-    \param cg
-    The congruence to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible,
-    or \p cg is not optimally supported by the OS domain.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Adds to \p *this constraints equivalent to the congruences in \p cgs.
-
-    \param cgs
-    The congruences to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    or \p cgs contains a congruence which is not optimally supported
-    by the OS domain.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Adds to \p *this constraints equivalent to the congruences in \p cgs.
-
-    \param cgs
-    The congruence system to be added to \p *this.  The congruences in
-    \p cgs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    or \p cgs contains a congruence which is not optimally supported
-    by the OS domain.
-
-    \warning
-    The only assumption that can be made on \p cgs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_congruences(Congruence_System& cgs);
-
-  /*! \brief
-    Uses a copy of constraint \p c to refine the system of octagonal
-    constraints defining \p *this.
-
-    \param c
-    The constraint. If it is not a octagonal constraint, it will be ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  /*! \brief
-    Uses a copy of congruence \p cg to refine the system of
-    octagonal constraints  of \p *this.
-
-    \param cg
-    The congruence. If it is not a octagonal equality, it
-    will be ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
-  /*! \brief
-    Uses a copy of the constraints in \p cs to refine the system of
-    octagonal constraints defining \p *this.
-
-    \param  cs
-    The constraint system to be used. Constraints that are not octagonal
-    are ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Uses a copy of the congruences in \p cgs to refine the system of
-    octagonal constraints defining \p *this.
-
-    \param  cgs
-    The congruence system to be used. Congruences that are not octagonal
-    equalities are ignored.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Refines the system of octagonal constraints defining \p *this using
-    the constraint expressed by \p left \f$\leq\f$ \p right.
-
-    \param left
-    The linear form on intervals with floating point boundaries that
-    is at the left of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param right
-    The linear form on intervals with floating point boundaries that
-    is at the right of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \exception std::invalid_argument
-    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
-
-    This function is used in abstract interpretation to model a filter
-    that is generated by a comparison of two expressions that are correctly
-    approximated by \p left and \p right respectively.
-  */
-  template <typename Interval_Info>
-  void refine_with_linear_form_inequality(
-                   const Linear_Form< Interval<T, Interval_Info> >& left,
-                   const Linear_Form< Interval<T, Interval_Info> >& right);
-
-  /*! \brief
-    Refines the system of octagonal constraints defining \p *this using
-    the constraint expressed by \p left \f$\relsym\f$ \p right, where
-    \f$\relsym\f$ is the relation symbol specified by \p relsym.
-
-    \param left
-    The linear form on intervals with floating point boundaries that
-    is at the left of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param right
-    The linear form on intervals with floating point boundaries that
-    is at the right of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param relsym
-    The relation symbol.
-
-    \exception std::invalid_argument
-    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
-
-    \exception std::runtime_error
-    Thrown if \p relsym is not a valid relation symbol.
-
-    This function is used in abstract interpretation to model a filter
-    that is generated by a comparison of two expressions that are correctly
-    approximated by \p left and \p right respectively.
-  */
-  template <typename Interval_Info>
-  void generalized_refine_with_linear_form_inequality(
-                   const Linear_Form< Interval<T, Interval_Info> >& left,
-                   const Linear_Form< Interval<T, Interval_Info> >& right,
-                   Relation_Symbol relsym);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  //! Assigns to \p *this the intersection of \p *this and \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void intersection_assign(const Octagonal_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this the smallest OS that contains
-    the convex union of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void upper_bound_assign(const Octagonal_Shape& y);
-
-  /*! \brief
-    If the upper bound of \p *this and \p y is exact, it is assigned
-    to \p *this and <CODE>true</CODE> is returned,
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    Implementation is based on Theorem 6.3 of \ref BHZ09b "[BHZ09b]".
-  */
-  bool upper_bound_assign_if_exact(const Octagonal_Shape& y);
-
-  /*! \brief
-    If the \e integer upper bound of \p *this and \p y is exact,
-    it is assigned to \p *this and <CODE>true</CODE> is returned;
-    otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \note
-    This operator is only available when the class template parameter
-    \c T is bound to an integer data type.
-
-    \note
-    The integer upper bound of two rational OS is the smallest
-    rational OS containing all the integral points in the two arguments.
-    In general, the result is \e not an upper bound for the two input
-    arguments, as it may cut away non-integral portions of the two
-    rational shapes.
-
-    Implementation is based on Theorem 6.8 of \ref BHZ09b "[BHZ09b]".
-  */
-  bool integer_upper_bound_assign_if_exact(const Octagonal_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this the smallest octagon containing
-    the set difference of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void difference_assign(const Octagonal_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this a \ref Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-    If \c false is returned, then the intersection is empty.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool simplify_using_context_assign(const Octagonal_Shape& y);
-
-  /*! \brief
-    Assigns to \p *this the \ref affine_relation "affine image"
-    of \p *this under the function mapping variable \p var into the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned.
-
-    \param expr
-    The numerator of the affine expression.
-
-    \param denominator
-    The denominator of the affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension of \p *this.
-  */
-  void affine_image(Variable var,
-                    const Linear_Expression& expr,
-                    Coefficient_traits::const_reference  denominator
-                    = Coefficient_one());
-
-  // FIXME: To be completed.
-  /*! \brief
-    Assigns to \p *this the \ref affine_form_relation "affine form image"
-    of \p *this under the function mapping variable \p var into the
-    affine expression(s) specified by \p lf.
-
-    \param var
-    The variable to which the affine expression is assigned.
-
-    \param lf
-    The linear form on intervals with floating point boundaries that
-    defines the affine expression(s). ALL of its coefficients MUST be bounded.
-
-    \exception std::invalid_argument
-    Thrown if \p lf and \p *this are dimension-incompatible or if \p var
-    is not a dimension of \p *this.
-
-    This function is used in abstract interpretation to model an assignment
-    of a value that is correctly overapproximated by \p lf to the
-    floating point variable represented by \p var.
-  */
-  template <typename Interval_Info>
-  void affine_form_image(Variable var,
-                        const Linear_Form< Interval<T, Interval_Info> >& lf);
-
-  /*! \brief
-    Assigns to \p *this the \ref affine_relation "affine preimage"
-    of \p *this under the function mapping variable \p var into the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is substituted.
-
-    \param expr
-    The numerator of the affine expression.
-
-    \param denominator
-    The denominator of the affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension of \p *this.
-  */
-  void affine_preimage(Variable var,
-                       const Linear_Expression& expr,
-                       Coefficient_traits::const_reference denominator
-                       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine transfer function"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine transfer function.
-
-    \param relsym
-    The relation symbol.
-
-    \param expr
-    The numerator of the right hand side affine expression.
-
-    \param denominator
-    The denominator of the right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension of \p *this
-    or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_image(Variable var,
-                                Relation_Symbol relsym,
-                                const Linear_Expression& expr,
-                                Coefficient_traits::const_reference denominator
-                                = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine transfer function"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression.
-
-    \param relsym
-    The relation symbol.
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_image(const Linear_Expression& lhs,
-                                Relation_Symbol relsym,
-                                const Linear_Expression& rhs);
-
-    /*!
-    \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-                            const Linear_Expression& lb_expr,
-                            const Linear_Expression& ub_expr,
-                            Coefficient_traits::const_reference denominator
-                            = Coefficient_one());
-
-/*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine transfer function.
-
-    \param relsym
-    The relation symbol.
-
-    \param expr
-    The numerator of the right hand side affine expression.
-
-    \param denominator
-    The denominator of the right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this
-    are dimension-incompatible or if \p var is not a dimension
-    of \p *this or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_preimage(Variable var,
-                                   Relation_Symbol relsym,
-                                   const Linear_Expression& expr,
-                                   Coefficient_traits::const_reference
-                                   denominator = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p relsym is a strict relation symbol.
-  */
-  void generalized_affine_preimage(const Linear_Expression& lhs,
-                                   Relation_Symbol relsym,
-                                   const Linear_Expression& rhs);
-
-  /*!
-    \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-         \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-                               const Linear_Expression& lb_expr,
-                               const Linear_Expression& ub_expr,
-                               Coefficient_traits::const_reference denominator
-                               = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void time_elapse_assign(const Octagonal_Shape& y);
-
-  /*! \brief
-    \ref Wrapping_Operator "Wraps" the specified dimensions of the
-    vector space.
-
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be wrapped.
-
-    \param w
-    The width of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param r
-    The representation of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param o
-    The overflow behavior of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param cs_p
-    Possibly null pointer to a constraint system whose variables
-    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
-    variables not in \p vars, the behavior is undefined.
-    When non-null, the pointed-to constraint system is assumed to
-    represent the conditional or looping construct guard with respect
-    to which wrapping is performed.  Since wrapping requires the
-    computation of upper bounds and due to non-distributivity of
-    constraint refinement over upper bounds, passing a constraint
-    system in this way can be more precise than refining the result of
-    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
-
-    \param complexity_threshold
-    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
-    higher values result in possibly improved precision.
-
-    \param wrap_individually
-    <CODE>true</CODE> if the dimensions should be wrapped individually
-    (something that results in much greater efficiency to the detriment of
-    precision).
-
-    \exception std::invalid_argument
-    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
-    \p vars, or if \p *this is dimension-incompatible \p vars or with
-    <CODE>*cs_p</CODE>.
-  */
-  void wrap_assign(const Variables_Set& vars,
-                   Bounded_Integer_Type_Width w,
-                   Bounded_Integer_Type_Representation r,
-                   Bounded_Integer_Type_Overflow o,
-                   const Constraint_System* cs_p = 0,
-                   unsigned complexity_threshold = 16,
-                   bool wrap_individually = true);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
-
-    \param y
-    An OS that <EM>must</EM> be contained in \p *this.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void CC76_extrapolation_assign(const Octagonal_Shape& y, unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
-
-    \param y
-    An OS that <EM>must</EM> be contained in \p *this.
-
-    \param first
-    An iterator that points to the first stop_point.
-
-    \param last
-    An iterator that points to the last stop_point.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  template <typename Iterator>
-  void CC76_extrapolation_assign(const Octagonal_Shape& y,
-                                 Iterator first, Iterator last,
-                                 unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref BHMZ05_widening "BHMZ05-widening" between \p *this and \p y.
-
-    \param y
-    An OS that <EM>must</EM> be contained in \p *this.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void BHMZ05_widening_assign(const Octagonal_Shape& y, unsigned* tp = 0);
-
-  //! Same as BHMZ05_widening_assign(y, tp).
-  void widening_assign(const Octagonal_Shape& y, unsigned* tp = 0);
-
-  /*! \brief
-    Improves the result of the \ref BHMZ05_widening "BHMZ05-widening"
-    computation by also enforcing those constraints in \p cs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    An OS that <EM>must</EM> be contained in \p *this.
-
-    \param cs
-    The system of constraints used to improve the widened OS.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
-    if there is in \p cs a strict inequality.
-  */
-  void limited_BHMZ05_extrapolation_assign(const Octagonal_Shape& y,
-                                           const Constraint_System& cs,
-                                           unsigned* tp = 0);
-
-  /*! \brief
-    Restores from \p y the constraints of \p *this, lost by
-    \ref CC76_extrapolation "CC76-extrapolation" applications.
-
-    \param y
-    An OS that <EM>must</EM> contain \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void CC76_narrowing_assign(const Octagonal_Shape& y);
-
-  /*! \brief
-    Improves the result of the \ref CC76_extrapolation "CC76-extrapolation"
-    computation by also enforcing those constraints in \p cs that are
-    satisfied by all the points of \p *this.
-
-    \param y
-    An OS that <EM>must</EM> be contained in \p *this.
-
-    \param cs
-    The system of constraints used to improve the widened OS.
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
-    if \p cs contains a strict inequality.
-  */
-  void limited_CC76_extrapolation_assign(const Octagonal_Shape& y,
-                                         const Constraint_System& cs,
-                                         unsigned* tp = 0);
-
-  //@} Space-Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  //! Adds \p m new dimensions and embeds the old OS into the new space.
-  /*!
-    \param m
-    The number of dimensions to add.
-
-    The new dimensions will be those having the highest indexes in the new OS,
-    which is characterized by a system of constraints in which the variables
-    running through the new dimensions are not constrained.
-    For instance, when starting from the OS \f$\cO \sseq \Rset^2\f$
-    and adding a third dimension, the result will be the OS
-    \f[
-      \bigl\{\,
-        (x, y, z)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cO
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Adds \p m new dimensions to the OS
-    and does not embed it in the new space.
-
-    \param m
-    The number of dimensions to add.
-
-    The new dimensions will be those having the highest indexes
-    in the new OS, which is characterized by a system
-    of constraints in which the variables running through
-    the new dimensions are all constrained to be equal to 0.
-    For instance, when starting from the OS \f$\cO \sseq \Rset^2\f$
-    and adding a third dimension, the result will be the OS
-    \f[
-      \bigl\{\,
-        (x, y, 0)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cO
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  /*! \brief
-    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
-    of \p *this and \p y, taken in this order.
-
-    \exception std::length_error
-    Thrown if the concatenation would cause the vector space
-    to exceed dimension <CODE>max_space_dimension()</CODE>.
-  */
-  void concatenate_assign(const Octagonal_Shape& y);
-
-  //! Removes all the specified dimensions.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the dimensions to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the Variable
-    objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher dimensions so that the resulting space
-    will have dimension \p new_dimension.
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimension is greater than the space dimension
-    of \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
-
-    \param pfunc
-    The partial function specifying the destiny of each dimension.
-
-    The template type parameter Partial_Function must provide
-    the following methods.
-    \code
-      bool has_empty_codomain() const
-    \endcode
-    returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty codomain (i.e., it is always undefined).
-    The <CODE>has_empty_codomain()</CODE> method will always be called
-    before the methods below.  However, if
-    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
-    of the functions below will be called.
-    \code
-      dimension_type max_in_codomain() const
-    \endcode
-    returns the maximum value that belongs to the codomain
-    of the partial function.
-    \code
-      bool maps(dimension_type i, dimension_type& j) const
-    \endcode
-    Let \f$f\f$ be the represented function and \f$k\f$ be the value
-    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
-    assigned to \p j and <CODE>true</CODE> is returned.
-    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
-    returned.
-
-    The result is undefined if \p pfunc does not encode a partial
-    function with the properties described in the
-    \ref Mapping_the_Dimensions_of_the_Vector_Space "specification of the mapping operator".
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref expand_space_dimension "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.
-    Also thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are \ref fold_space_dimensions "folded"
-    into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //! Applies to \p dest the interval constraints embedded in \p *this.
-  /*!
-    \param dest
-    The object to which the constraints will be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest.
-
-    The template type parameter U must provide the following methods.
-    \code
-      dimension_type space_dimension() const
-    \endcode
-    returns the space dimension of the object.
-    \code
-      void set_empty()
-    \endcode
-    sets the object to an empty object.
-    \code
-      bool restrict_lower(dimension_type dim, const T& lb)
-    \endcode
-    restricts the object by applying the lower bound \p lb to the space
-    dimension \p dim and returns <CODE>false</CODE> if and only if the
-    object becomes empty.
-    \code
-      bool restrict_upper(dimension_type dim, const T& ub)
-    \endcode
-    restricts the object by applying the upper bound \p ub to the space
-    dimension \p dim and returns <CODE>false</CODE> if and only if the
-    object becomes empty.
-  */
-  template <typename U>
-  void export_interval_constraints(U& dest) const;
-
-  //! Refines \p store with the constraints defining \p *this.
-  /*!
-    \param store
-    The interval floating point abstract store to refine.
-  */
-  template <typename Interval_Info>
-  void refine_fp_interval_abstract_store(
-                          Box< Interval<T, Interval_Info> >& store) const;
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If \p x and \p y are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  friend bool
-  operator==<T>(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
-
-  template <typename Temp, typename To, typename U>
-  friend bool Parma_Polyhedra_Library::rectilinear_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const Octagonal_Shape<U>& x, const Octagonal_Shape<U>& y,
-   const Rounding_Dir dir, Temp& tmp0, Temp& tmp1, Temp& tmp2);
-  template <typename Temp, typename To, typename U>
-  friend bool Parma_Polyhedra_Library::euclidean_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const Octagonal_Shape<U>& x, const Octagonal_Shape<U>& y,
-   const Rounding_Dir dir, Temp& tmp0, Temp& tmp1, Temp& tmp2);
-  template <typename Temp, typename To, typename U>
-  friend bool Parma_Polyhedra_Library::l_infinity_distance_assign
-  (Checked_Number<To, Extended_Number_Policy>& r,
-   const Octagonal_Shape<U>& x, const Octagonal_Shape<U>& y,
-   const Rounding_Dir dir, Temp& tmp0, Temp& tmp1, Temp& tmp2);
-
-private:
-  template <typename U> friend class Parma_Polyhedra_Library::Octagonal_Shape;
-  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
-
-  //! The matrix that represents the octagonal shape.
-  OR_Matrix<N> matrix;
-
-  //! Dimension of the space of the octagonal shape.
-  dimension_type space_dim;
-
-  // Please, do not move the following include directive:
-  // `Og_Status.idefs.hh' must be included exactly at this point.
-  // And please do not remove the space separating `#' from `include':
-  // this ensures that the directive will not be moved during the
-  // procedure that automatically creates the library's include file
-  // (see `Makefile.am' in the `src' directory).
-#define PPL_IN_Octagonal_Shape_CLASS
-#include "Og_Status.idefs.hh"
-#undef PPL_IN_Octagonal_Shape_CLASS
-
-  //! The status flags to keep track of the internal state.
-  Status status;
-
-  //! Returns <CODE>true</CODE> if the OS is the zero-dimensional universe.
-  bool marked_zero_dim_univ() const;
-
-  //! Returns <CODE>true</CODE> if the OS is known to be empty.
-  /*!
-    The return value <CODE>false</CODE> does not necessarily
-    implies that \p *this is non-empty.
-  */
-  bool marked_empty() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if \c this->matrix is known to be
-    strongly closed.
-
-    The return value <CODE>false</CODE> does not necessarily
-    implies that \c this->matrix is not strongly closed.
-  */
-  bool marked_strongly_closed() const;
-
-  //! Turns \p *this into a zero-dimensional universe OS.
-  void set_zero_dim_univ();
-
-  //! Turns \p *this into an empty OS.
-  void set_empty();
-
-  //! Marks \p *this as strongly closed.
-  void set_strongly_closed();
-
-  //! Marks \p *this as possibly not strongly closed.
-  void reset_strongly_closed();
-
-  N& matrix_at(dimension_type i, dimension_type j);
-  const N& matrix_at(dimension_type i, dimension_type j) const;
-
-  /*! \brief
-    Returns an upper bound for \p lf according to the constraints
-    embedded in \p *this.
-
-    \p lf must be a linear form on intervals with floating point coefficients.
-    If all coefficients in \p lf are bounded, then \p result will become a
-    correct overapproximation of the value of \p lf when variables in
-    \p lf satisfy the constraints expressed by \p *this. Otherwise the
-    behavior of the method is undefined.
-  */
-  template <typename Interval_Info>
-  void linear_form_upper_bound(
-		   const Linear_Form< Interval<T, Interval_Info> >& lf,
-                   N& result) const;
-
-  // FIXME: this function is currently not used. Consider removing it.
-  static void interval_coefficient_upper_bound(const N& var_ub,
-                                               const N& minus_var_ub,
-                                               const N& int_ub, const N& int_lb,
-                                               N& result);
-
-  /*! \brief
-    Uses the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be added. Non-octagonal constraints are ignored.
-
-    \warning
-    If \p c and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Constraint& c);
-
-  /*! \brief
-    Uses the congruence \p cg to refine \p *this.
-
-    \param cg
-    The congruence to be added.
-    Nontrivial proper congruences are ignored.
-    Non-octagonal equalities are ignored.
-
-    \warning
-    If \p cg and \p *this are dimension-incompatible,
-    the behavior is undefined.
-  */
-  void refine_no_check(const Congruence& cg);
-
-  //! Adds the constraint <CODE>matrix[i][j] <= k</CODE>.
-  void add_octagonal_constraint(dimension_type i,
-                                dimension_type j,
-                                const N& k);
-
-  //! Adds the constraint <CODE>matrix[i][j] <= numer/denom</CODE>.
-  void add_octagonal_constraint(dimension_type i,
-                                dimension_type j,
-                                Coefficient_traits::const_reference numer,
-                                Coefficient_traits::const_reference denom);
-
-  /*! \brief
-    Adds to the Octagonal_Shape the constraint
-    \f$\mathrm{var} \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$.
-
-    Note that the coefficient of \p var in \p expr is null.
-  */
-  void refine(Variable var,
-              Relation_Symbol relsym,
-              const Linear_Expression& expr,
-              Coefficient_traits::const_reference denominator
-              = Coefficient_one());
-
-  //! Removes all the constraints on variable \p v_id.
-  void forget_all_octagonal_constraints(dimension_type v_id);
-
-  //! Removes all binary constraints on variable \p v_id.
-  void forget_binary_octagonal_constraints(dimension_type v_id);
-
-  //! An helper function for the computation of affine relations.
-  /*!
-    For each variable index \c u_id (less than or equal to \p last_id
-    and different from \p v_id), deduce constraints of the form
-    <CODE>v - u \<= k</CODE> and <CODE>v + u \<= k</CODE>,
-    starting from \p ub_v, which is an upper bound for \c v
-    computed according to \p sc_expr and \p sc_denom.
-
-    Strong-closure will be able to deduce the constraints
-    <CODE>v - u \<= ub_v - lb_u</CODE> and <CODE>v + u \<= ub_v + ub_u</CODE>.
-    We can be more precise if variable \c u played an active role in the
-    computation of the upper bound for \c v.
-
-    Namely, if the corresponding coefficient
-    <CODE>q == sc_expr[u]/sc_denom</CODE> of \c u in \p sc_expr
-    is greater than zero, we can improve the bound for <CODE>v - u</CODE>.
-    In particular:
-      - if <CODE>q \>= 1</CODE>, then <CODE>v - u \<= ub_v - ub_u</CODE>;
-      - if <CODE>0 \< q \< 1</CODE>, then
-        <CODE>v - u \<= ub_v - (q*ub_u + (1-q)*lb_u)</CODE>.
-
-    Conversely, if \c q is less than zero, we can improve the bound for
-    <CODE>v + u</CODE>. In particular:
-      - if <CODE>q \<= -1</CODE>, then <CODE>v + u \<= ub_v + lb_u</CODE>;
-      - if <CODE>-1 \< q \< 0</CODE>, then
-        <CODE>v + u \<= ub_v + ((-q)*lb_u + (1+q)*ub_u)</CODE>.
-  */
-  void deduce_v_pm_u_bounds(dimension_type v_id,
-                            dimension_type last_id,
-                            const Linear_Expression& sc_expr,
-                            Coefficient_traits::const_reference sc_denom,
-                            const N& ub_v);
-
-  //! An helper function for the computation of affine relations.
-  /*!
-    For each variable index \c u_id (less than or equal to \p last_id
-    and different from \p v_id), deduce constraints of the form
-    <CODE>-v + u \<= k</CODE> and <CODE>-v - u \<= k</CODE>,
-    starting from \p minus_lb_v, which is the negation of a lower bound
-    for \c v computed according to \p sc_expr and \p sc_denom.
-
-    Strong-closure will be able to deduce the constraints
-    <CODE>-v - u \<= -lb_v - lb_u</CODE> and
-    <CODE>-v + u \<= -lb_v + ub_u</CODE>.
-    We can be more precise if variable \c u played an active role in the
-    computation of (the negation of) the lower bound for \c v.
-
-    Namely, if the corresponding coefficient
-    <CODE>q == sc_expr[u]/sc_denom</CODE> of \c u in \p sc_expr
-    is greater than zero, we can improve the bound for <CODE>-v + u</CODE>.
-    In particular:
-      - if <CODE>q \>= 1</CODE>, then <CODE>-v + u \<= -lb_v + lb_u</CODE>;
-      - if <CODE>0 \< q \< 1</CODE>, then
-        <CODE>-v + u \<= -lb_v + (q*lb_u + (1-q)*ub_u)</CODE>.
-
-    Conversely, if \c q is less than zero, we can improve the bound for
-    <CODE>-v - u</CODE>. In particular:
-      - if <CODE>q \<= -1</CODE>, then <CODE>-v - u \<= -lb_v - ub_u</CODE>;
-      - if <CODE>-1 \< q \< 0</CODE>, then
-        <CODE>-v - u \<= -lb_v - ((-q)*ub_u + (1+q)*lb_u)</CODE>.
-  */
-  void deduce_minus_v_pm_u_bounds(dimension_type v_id,
-                                  dimension_type last_id,
-                                  const Linear_Expression& sc_expr,
-                                  Coefficient_traits::const_reference sc_denom,
-                                  const N& minus_lb_v);
-
-  /*! \brief
-    Adds to \p limiting_octagon the octagonal differences in \p cs
-    that are satisfied by \p *this.
-  */
-  void get_limiting_octagon(const Constraint_System& cs,
-                            Octagonal_Shape& limiting_octagon) const;
-  //! Compute the (zero-equivalence classes) successor relation.
-  /*!
-    It is assumed that the octagon is not empty and strongly closed.
-  */
-  void compute_successors(std::vector<dimension_type>& successor) const;
-
-  //! Compute the leaders of zero-equivalence classes.
-  /*!
-    It is assumed that the OS is not empty and strongly closed.
-  */
-  void compute_leaders(std::vector<dimension_type>& successor,
-                       std::vector<dimension_type>& no_sing_leaders,
-                       bool& exist_sing_class,
-                       dimension_type& sing_leader) const;
-
-  //! Compute the leaders of zero-equivalence classes.
-  /*!
-    It is assumed that the OS is not empty and strongly closed.
-  */
-  void compute_leaders(std::vector<dimension_type>& leaders) const;
-
-  /*! \brief
-    Stores into \p non_redundant information about the matrix entries
-    that are non-redundant (i.e., they will occur in the strongly
-    reduced matrix).
-
-    It is assumed that the OS is not empty and strongly closed;
-    moreover, argument \p non_redundant is assumed to be empty.
-  */
-  void non_redundant_matrix_entries(std::vector<Bit_Row>& non_redundant) const;
-
-  //! Removes the redundant constraints from \c this->matrix.
-  void strong_reduction_assign() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \c this->matrix
-    is strongly reduced.
-  */
-  bool is_strongly_reduced() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if in the octagon taken two at a time
-    unary constraints, there is also the constraint that represent their sum.
-  */
-  bool is_strong_coherent() const;
-
-  bool tight_coherence_would_make_empty() const;
-
-  //! Assigns to \c this->matrix its strong closure.
-  /*!
-    Strong closure is a necessary condition for the precision and/or
-    the correctness of many methods. It explicitly records into \c matrix
-    those constraints that are implicitly obtainable by the other ones,
-    therefore obtaining a canonical representation for the OS.
-  */
-  void strong_closure_assign() const;
-
-  //! Applies the strong-coherence step to \c this->matrix.
-  void strong_coherence_assign();
-
-  //! Assigns to \c this->matrix its tight closure.
-  /*!
-    \note
-    This is \e not marked as a <code>const</code> method,
-    as it may modify the rational-valued geometric shape by cutting away
-    non-integral points. The method is only available if the template
-    parameter \c T is bound to an integer data type.
-  */
-  void tight_closure_assign();
-
-  /*! \brief
-    Incrementally computes strong closure, assuming that only
-    constraints affecting variable \p var need to be considered.
-
-    \note
-    It is assumed that \c *this, which was strongly closed, has only been
-    modified by adding constraints affecting variable \p var. If this
-    assumption is not satisfied, i.e., if a non-redundant constraint not
-    affecting variable \p var has been added, the behavior is undefined.
-    Worst-case complexity is \f$O(n^2)\f$.
-  */
-  void incremental_strong_closure_assign(Variable var) const;
-
-  //! Checks if and how \p expr is bounded in \p *this.
-  /*!
-    Returns <CODE>true</CODE> if and only if \p from_above is
-    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
-    or \p from_above is <CODE>false</CODE> and \p expr is bounded
-    from below in \p *this.
-
-    \param expr
-    The linear expression to test;
-
-    \param from_above
-    <CODE>true</CODE> if and only if the boundedness of interest is
-    "from above".
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds(const Linear_Expression& expr, bool from_above) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p
-    *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p * this;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d and
-    \p included are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-               bool maximize,
-               Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p
-    *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p * this;
-
-    \param g
-    When maximization or minimization succeeds, will be assigned
-    a point or closure point where \p expr reaches the
-    corresponding extremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p g are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-               bool maximize,
-               Coefficient& ext_n, Coefficient& ext_d, bool& included,
-               Generator& g) const;
-
-  void drop_some_non_integer_points_helper(N& elem);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators
-  ::operator<<<>(std::ostream& s, const Octagonal_Shape<T>& c);
-
-  //! \name Exception Throwers
-  //@{
-  void throw_dimension_incompatible(const char* method,
-                                    const Octagonal_Shape& y) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    dimension_type required_dim) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const Constraint& c) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const Congruence& cg) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const Generator& g) const;
-
-  void throw_dimension_incompatible(const char* method,
-                                    const char* le_name,
-                                    const Linear_Expression& le) const;
-
-  template <typename C>
-  void throw_dimension_incompatible(const char* method,
-                                    const char* lf_name,
-                                    const Linear_Form<C>& lf) const;
-
-  static void throw_constraint_incompatible(const char* method);
-
-  static void throw_expression_too_complex(const char* method,
-                                           const Linear_Expression& le);
-
-  static void throw_invalid_argument(const char* method, const char* reason);
-  //@} // Exception Throwers
-};
-
-#include "Og_Status.inlines.hh"
-#include "Octagonal_Shape.inlines.hh"
-#include "Octagonal_Shape.templates.hh"
-
-#endif // !defined(PPL_Octagonal_Shape_defs_hh)
diff --git a/src/Octagonal_Shape.inlines.hh b/src/Octagonal_Shape.inlines.hh
deleted file mode 100644
index 30ab50d..0000000
--- a/src/Octagonal_Shape.inlines.hh
+++ /dev/null
@@ -1,892 +0,0 @@
-/* Octagonal_Shape class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Octagonal_Shape_inlines_hh
-#define PPL_Octagonal_Shape_inlines_hh 1
-
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "C_Polyhedron.defs.hh"
-#include "Grid.defs.hh"
-#include "BD_Shape.defs.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "wrap_assign.hh"
-#include "assert.hh"
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Octagonal_Shapes {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the index coherent to \p i.
-/*! \relates Parma_Polyhedra_Library::Octagonal_Shape */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-inline dimension_type
-coherent_index(const dimension_type i) {
-  return (i % 2 != 0) ? (i-1) : (i+1);
-}
-
-} // namespace Octagonal_Shapes
-
-} // namespace Implementation
-
-template <typename T>
-inline dimension_type
-Octagonal_Shape<T>::max_space_dimension() {
-  return OR_Matrix<N>::max_num_rows()/2;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::marked_zero_dim_univ() const {
-  return status.test_zero_dim_univ();
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::marked_strongly_closed() const {
-  return status.test_strongly_closed();
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::marked_empty() const {
-  return status.test_empty();
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::set_zero_dim_univ() {
-  status.set_zero_dim_univ();
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::set_empty() {
-  status.set_empty();
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::set_strongly_closed() {
-  status.set_strongly_closed();
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::reset_strongly_closed() {
-  status.reset_strongly_closed();
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const dimension_type num_dimensions,
-				    const Degenerate_Element kind)
-  : matrix(num_dimensions), space_dim(num_dimensions), status() {
-  if (kind == EMPTY)
-    set_empty();
-  else if (num_dimensions > 0)
-    // A (non zero-dim) universe octagon is strongly closed.
-    set_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const Octagonal_Shape& y, Complexity_Class)
-  : matrix(y.matrix), space_dim(y.space_dim), status(y.status) {
-}
-
-template <typename T>
-template <typename U>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const Octagonal_Shape<U>& y,
-                                    Complexity_Class)
-  // For maximum precision, enforce shortest-path closure
-  // before copying the DB matrix.
-  : matrix((y.strong_closure_assign(), y.matrix)),
-    space_dim(y.space_dim),
-    status() {
-  // TODO: handle flags properly, possibly taking special cases into account.
-  if (y.marked_empty())
-    set_empty();
-  else if (y.marked_zero_dim_univ())
-    set_zero_dim_univ();
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const Constraint_System& cs)
-  : matrix(cs.space_dimension()),
-    space_dim(cs.space_dimension()),
-    status() {
-  if (cs.space_dimension() > 0)
-    // A (non zero-dim) universe octagon is strongly closed.
-    set_strongly_closed();
-  add_constraints(cs);
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const Congruence_System& cgs)
-  : matrix(cgs.space_dimension()),
-    space_dim(cgs.space_dimension()),
-    status() {
-  if (cgs.space_dimension() > 0)
-    // A (non zero-dim) universe octagon is strongly closed.
-    set_strongly_closed();
-  add_congruences(cgs);
-}
-
-template <typename T>
-template <typename Interval>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const Box<Interval>& box,
-                                    Complexity_Class)
-  : matrix(box.space_dimension()),
-    space_dim(box.space_dimension()),
-    status() {
-  // Check for emptiness for maximum precision.
-  if (box.is_empty())
-    set_empty();
-  else if (box.space_dimension() > 0) {
-    // A (non zero-dim) universe OS is strongly closed.
-    set_strongly_closed();
-    refine_with_constraints(box.constraints());
-  }
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const Grid& grid,
-                                    Complexity_Class)
-  : matrix(grid.space_dimension()),
-    space_dim(grid.space_dimension()),
-    status() {
-  if (grid.space_dimension() > 0)
-    // A (non zero-dim) universe OS is strongly closed.
-    set_strongly_closed();
-  // Taking minimized congruences ensures maximum precision.
-  refine_with_congruences(grid.minimized_congruences());
-}
-
-template <typename T>
-template <typename U>
-inline
-Octagonal_Shape<T>::Octagonal_Shape(const BD_Shape<U>& bd,
-                                    Complexity_Class)
-  : matrix(bd.space_dimension()),
-    space_dim(bd.space_dimension()),
-    status() {
-  // Check for emptiness for maximum precision.
-  if (bd.is_empty())
-    set_empty();
-  else if (bd.space_dimension() > 0) {
-    // A (non zero-dim) universe OS is strongly closed.
-    set_strongly_closed();
-    refine_with_constraints(bd.constraints());
-  }
-}
-
-template <typename T>
-inline Congruence_System
-Octagonal_Shape<T>::congruences() const {
-  return minimized_congruences();
-}
-
-template <typename T>
-inline Octagonal_Shape<T>&
-Octagonal_Shape<T>::operator=(const Octagonal_Shape& y) {
-  matrix = y.matrix;
-  space_dim = y.space_dim;
-  status = y.status;
-  return *this;
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::~Octagonal_Shape() {
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::m_swap(Octagonal_Shape& y) {
-  using std::swap;
-  swap(matrix, y.matrix);
-  swap(space_dim, y.space_dim);
-  swap(status, y.status);
-}
-
-template <typename T>
-inline dimension_type
-Octagonal_Shape<T>::space_dimension() const {
-  return space_dim;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::is_discrete() const {
-  return affine_dimension() == 0;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::is_empty() const {
-  strong_closure_assign();
-  return marked_empty();
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::bounds_from_above(const Linear_Expression& expr) const {
-  return bounds(expr, true);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::bounds_from_below(const Linear_Expression& expr) const {
-  return bounds(expr, false);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::maximize(const Linear_Expression& expr,
-			     Coefficient& sup_n, Coefficient& sup_d,
-			     bool& maximum) const {
-  return max_min(expr, true, sup_n, sup_d, maximum);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::maximize(const Linear_Expression& expr,
-			     Coefficient& sup_n, Coefficient& sup_d,
-			     bool& maximum,
-			     Generator& g) const {
-  return max_min(expr, true, sup_n, sup_d, maximum, g);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::minimize(const Linear_Expression& expr,
-			     Coefficient& inf_n, Coefficient& inf_d,
-			     bool& minimum) const {
-  return max_min(expr, false, inf_n, inf_d, minimum);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::minimize(const Linear_Expression& expr,
-			     Coefficient& inf_n, Coefficient& inf_d,
-			     bool& minimum,
-			     Generator& g) const {
-  return max_min(expr, false, inf_n, inf_d, minimum, g);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::is_topologically_closed() const {
-  return true;
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::topological_closure_assign() {
-}
-
-/*! \relates Octagonal_Shape */
-template <typename T>
-inline bool
-operator==(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y) {
-  if (x.space_dim != y.space_dim)
-    // Dimension-incompatible OSs are different.
-    return false;
-
-  // Zero-dim OSs are equal if and only if they are both empty or universe.
-  if (x.space_dim == 0) {
-    if (x.marked_empty())
-      return y.marked_empty();
-    else
-      return !y.marked_empty();
-  }
-
-  x.strong_closure_assign();
-  y.strong_closure_assign();
-  // If one of two octagons is empty, then they are equal if and only if
-  // the other octagon is empty too.
-  if (x.marked_empty())
-    return y.marked_empty();
-  if (y.marked_empty())
-    return false;
-  // Strong closure is a canonical form.
-  return x.matrix == y.matrix;
-}
-
-/*! \relates Octagonal_Shape */
-template <typename T>
-inline bool
-operator!=(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y) {
-  return !(x == y);
-}
-
-template <typename T>
-inline const typename Octagonal_Shape<T>::coefficient_type&
-Octagonal_Shape<T>::matrix_at(const dimension_type i,
-			      const dimension_type j) const {
-  PPL_ASSERT(i < matrix.num_rows() && j < matrix.num_rows());
-  using namespace Implementation::Octagonal_Shapes;
-  return (j < matrix.row_size(i))
-    ? matrix[i][j]
-    : matrix[coherent_index(j)][coherent_index(i)];
-}
-
-template <typename T>
-inline typename Octagonal_Shape<T>::coefficient_type&
-Octagonal_Shape<T>::matrix_at(const dimension_type i,
-			      const dimension_type j) {
-  PPL_ASSERT(i < matrix.num_rows() && j < matrix.num_rows());
-  using namespace Implementation::Octagonal_Shapes;
-  return (j < matrix.row_size(i))
-    ? matrix[i][j]
-    : matrix[coherent_index(j)][coherent_index(i)];
-}
-
-template <typename T>
-inline Constraint_System
-Octagonal_Shape<T>::minimized_constraints() const {
-  strong_reduction_assign();
-  return constraints();
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::add_octagonal_constraint(const dimension_type i,
-					     const dimension_type j,
-					     const N& k) {
-  // Private method: the caller has to ensure the following.
-#ifndef NDEBUG
-  PPL_ASSERT(i < 2*space_dim && j < 2*space_dim && i != j);
-  typename OR_Matrix<N>::row_iterator m_i = matrix.row_begin() + i;
-  PPL_ASSERT(j < m_i.row_size());
-#endif
-  N& r_i_j = matrix[i][j];
-  if (r_i_j > k) {
-    r_i_j = k;
-    if (marked_strongly_closed())
-      reset_strongly_closed();
-  }
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>
-::add_octagonal_constraint(const dimension_type i,
-			   const dimension_type j,
-			   Coefficient_traits::const_reference numer,
-			   Coefficient_traits::const_reference denom) {
-#ifndef NDEBUG
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(i < 2*space_dim && j < 2*space_dim && i != j);
-  typename OR_Matrix<N>::row_iterator m_i = matrix.row_begin() + i;
-  PPL_ASSERT(j < m_i.row_size());
-  PPL_ASSERT(denom != 0);
-#endif
-  PPL_DIRTY_TEMP(N, k);
-  div_round_up(k, numer, denom);
-  add_octagonal_constraint(i, j, k);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::add_constraints(const Constraint_System& cs) {
-  for (Constraint_System::const_iterator i = cs.begin(),
-         i_end = cs.end(); i != i_end; ++i)
-    add_constraint(*i);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::add_recycled_constraints(Constraint_System& cs) {
-  add_constraints(cs);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::add_recycled_congruences(Congruence_System& cgs) {
-  add_congruences(cgs);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::add_congruences(const Congruence_System& cgs) {
-  for (Congruence_System::const_iterator i = cgs.begin(),
-         cgs_end = cgs.end(); i != cgs_end; ++i)
-    add_congruence(*i);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::refine_with_constraint(const Constraint& c) {
-  // Dimension-compatibility check.
-  if (c.space_dimension() > space_dimension())
-    throw_dimension_incompatible("refine_with_constraint(c)", c);
-
-  if (!marked_empty())
-    refine_no_check(c);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::refine_with_constraints(const Constraint_System& cs) {
-  // Dimension-compatibility check.
-  if (cs.space_dimension() > space_dimension())
-    throw_invalid_argument("refine_with_constraints(cs)",
-                           "cs and *this are space-dimension incompatible");
-
-  for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
-    refine_no_check(*i);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::refine_with_congruence(const Congruence& cg) {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  // Dimension-compatibility check.
-  if (cg_space_dim > space_dimension())
-    throw_dimension_incompatible("refine_with_congruence(cg)", cg);
-
-  if (!marked_empty())
-    refine_no_check(cg);
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::refine_with_congruences(const Congruence_System& cgs) {
-  // Dimension-compatibility check.
-  if (cgs.space_dimension() > space_dimension())
-    throw_invalid_argument("refine_with_congruences(cgs)",
-                           "cgs and *this are space-dimension incompatible");
-
-  for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
-    refine_no_check(*i);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::refine_no_check(const Congruence& cg) {
-  PPL_ASSERT(!marked_empty());
-  PPL_ASSERT(cg.space_dimension() <= space_dimension());
-
-  if (cg.is_proper_congruence()) {
-    if (cg.is_inconsistent())
-      set_empty();
-    // Other proper congruences are just ignored.
-    return;
-  }
-
-  PPL_ASSERT(cg.is_equality());
-  Constraint c(cg);
-  refine_no_check(c);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::can_recycle_constraint_systems() {
-  return false;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::can_recycle_congruence_systems() {
-  return false;
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>
-::remove_higher_space_dimensions(const dimension_type new_dimension) {
-  // Dimension-compatibility check.
-  if (new_dimension > space_dim)
-    throw_dimension_incompatible("remove_higher_space_dimension(nd)",
-				 new_dimension);
-  // The removal of no dimensions from any octagon is a no-op.
-  // Note that this case also captures the only legal removal of
-  // dimensions from an octagon in a 0-dim space.
-  if (new_dimension == space_dim) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  strong_closure_assign();
-  matrix.shrink(new_dimension);
-  // When we remove all dimensions from a non-empty octagon,
-  // we obtain the zero-dimensional universe octagon.
-  if (new_dimension == 0 && !marked_empty())
-    set_zero_dim_univ();
-  space_dim = new_dimension;
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::wrap_assign(const Variables_Set& vars,
-                                Bounded_Integer_Type_Width w,
-                                Bounded_Integer_Type_Representation r,
-                                Bounded_Integer_Type_Overflow o,
-                                const Constraint_System* cs_p,
-                                unsigned complexity_threshold,
-                                bool wrap_individually) {
-  Implementation::wrap_assign(*this,
-                              vars, w, r, o, cs_p,
-                              complexity_threshold, wrap_individually,
-                              "Octagonal_Shape");
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::widening_assign(const Octagonal_Shape& y, unsigned* tp) {
-  BHMZ05_widening_assign(y, tp);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::CC76_extrapolation_assign(const Octagonal_Shape& y,
-					      unsigned* tp) {
-  static N stop_points[] = {
-    N(-2, ROUND_UP),
-    N(-1, ROUND_UP),
-    N( 0, ROUND_UP),
-    N( 1, ROUND_UP),
-    N( 2, ROUND_UP)
-  };
-  CC76_extrapolation_assign(y,
-			    stop_points,
-			    stop_points
-			    + sizeof(stop_points)/sizeof(stop_points[0]),
-			    tp);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::time_elapse_assign(const Octagonal_Shape& y) {
-  // Dimension-compatibility check.
-  if (space_dimension() != y.space_dimension())
-    throw_dimension_incompatible("time_elapse_assign(y)", y);
-  // Compute time-elapse on polyhedra.
-  // TODO: provide a direct implementation.
-  C_Polyhedron ph_x(constraints());
-  C_Polyhedron ph_y(y.constraints());
-  ph_x.time_elapse_assign(ph_y);
-  Octagonal_Shape<T> x(ph_x);
-  m_swap(x);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::strictly_contains(const Octagonal_Shape& y) const {
-  const Octagonal_Shape<T>& x = *this;
-  return x.contains(y) && !y.contains(x);
-}
-
-template <typename T>
-template <typename Interval_Info>
-inline void
-Octagonal_Shape<T>::generalized_refine_with_linear_form_inequality(
-		    const Linear_Form< Interval<T, Interval_Info> >& left,
-		    const Linear_Form< Interval<T, Interval_Info> >& right,
-                    const Relation_Symbol relsym) {
-  switch (relsym) {
-  case EQUAL:
-    // TODO: see if we can handle this case more efficiently.
-    refine_with_linear_form_inequality(left, right);
-    refine_with_linear_form_inequality(right, left);
-    break;
-  case LESS_THAN:
-  case LESS_OR_EQUAL:
-    refine_with_linear_form_inequality(left, right);
-    break;
-  case GREATER_THAN:
-  case GREATER_OR_EQUAL:
-    refine_with_linear_form_inequality(right, left);
-    break;
-  case NOT_EQUAL:
-    break;
-  default:
-    PPL_UNREACHABLE;
-    break;
-  }
-}
-
-template <typename T>
-template <typename Interval_Info>
-inline void
-Octagonal_Shape<T>::
-refine_fp_interval_abstract_store(
-	  Box< Interval<T, Interval_Info> >& store) const {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-                     "Octagonal_Shape<T>::refine_fp_interval_abstract_store:"
-                     " T not a floating point type.");
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-  store.intersection_assign(Box<FP_Interval_Type>(*this));
-
-}
-
-/*! \relates Octagonal_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Octagonal_Shape<T>& x,
-			    const Octagonal_Shape<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
-  // Dimension-compatibility check.
-  if (x.space_dim != y.space_dim)
-    return false;
-
-  // Zero-dim OSs are equal if and only if they are both empty or universe.
-  if (x.space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires strong closure.
-  x.strong_closure_assign();
-  y.strong_closure_assign();
-
-  // If one of two OSs is empty, then they are equal if and only if
-  // the other OS is empty too.
-  if (x.marked_empty() ||  y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  return rectilinear_distance_assign(r, x.matrix, y.matrix, dir,
-				     tmp0, tmp1, tmp2);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Octagonal_Shape<T>& x,
-			    const Octagonal_Shape<T>& y,
-			    const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename To, typename T>
-inline bool
-rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Octagonal_Shape<T>& x,
-			    const Octagonal_Shape<T>& y,
-			    const Rounding_Dir dir) {
-  return rectilinear_distance_assign<To, To, T>(r, x, y, dir);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Octagonal_Shape<T>& x,
-			  const Octagonal_Shape<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
-  // Dimension-compatibility check.
-  if (x.space_dim != y.space_dim)
-    return false;
-
-  // Zero-dim OSs are equal if and only if they are both empty or universe.
-  if (x.space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires strong closure.
-  x.strong_closure_assign();
-  y.strong_closure_assign();
-
-  // If one of two OSs is empty, then they are equal if and only if
-  // the other OS is empty too.
-  if (x.marked_empty() ||  y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  return euclidean_distance_assign(r, x.matrix, y.matrix, dir,
-				   tmp0, tmp1, tmp2);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Octagonal_Shape<T>& x,
-			  const Octagonal_Shape<T>& y,
-			  const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename To, typename T>
-inline bool
-euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Octagonal_Shape<T>& x,
-			  const Octagonal_Shape<T>& y,
-			  const Rounding_Dir dir) {
-  return euclidean_distance_assign<To, To, T>(r, x, y, dir);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Octagonal_Shape<T>& x,
-			   const Octagonal_Shape<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
-  // Dimension-compatibility check.
-  if (x.space_dim != y.space_dim)
-    return false;
-
-  // Zero-dim OSs are equal if and only if they are both empty or universe.
-  if (x.space_dim == 0) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  // The distance computation requires strong closure.
-  x.strong_closure_assign();
-  y.strong_closure_assign();
-
-  // If one of two OSs is empty, then they are equal if and only if
-  // the other OS is empty too.
-  if (x.marked_empty() ||  y.marked_empty()) {
-    if (x.marked_empty() == y.marked_empty())
-      assign_r(r, 0, ROUND_NOT_NEEDED);
-    else
-      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    return true;
-  }
-
-  return l_infinity_distance_assign(r, x.matrix, y.matrix, dir,
-				    tmp0, tmp1, tmp2);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename Temp, typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Octagonal_Shape<T>& x,
-			   const Octagonal_Shape<T>& y,
-			   const Rounding_Dir dir) {
-  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
-  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
-  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
-  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
-}
-
-/*! \relates Octagonal_Shape */
-template <typename To, typename T>
-inline bool
-l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Octagonal_Shape<T>& x,
-			   const Octagonal_Shape<T>& y,
-			   const Rounding_Dir dir) {
-  return l_infinity_distance_assign<To, To, T>(r, x, y, dir);
-}
-
-template <typename T>
-inline memory_size_type
-Octagonal_Shape<T>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename T>
-inline int32_t
-Octagonal_Shape<T>::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::drop_some_non_integer_points_helper(N& elem) {
-  if (!is_integer(elem)) {
-#ifndef NDEBUG
-    Result r =
-#endif
-    floor_assign_r(elem, elem, ROUND_DOWN);
-    PPL_ASSERT(r == V_EQ);
-    reset_strongly_closed();
-  }
-}
-
-/*! \relates Octagonal_Shape */
-template <typename T>
-inline void
-swap(Octagonal_Shape<T>& x, Octagonal_Shape<T>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Octagonal_Shape_inlines_hh)
diff --git a/src/Octagonal_Shape.templates.hh b/src/Octagonal_Shape.templates.hh
deleted file mode 100644
index 817c158..0000000
--- a/src/Octagonal_Shape.templates.hh
+++ /dev/null
@@ -1,8113 +0,0 @@
-/* Octagonal_Shape class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Octagonal_Shape_templates_hh
-#define PPL_Octagonal_Shape_templates_hh 1
-
-#include "Generator_System.defs.hh"
-#include "Generator_System.inlines.hh"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
-#include "Interval.defs.hh"
-#include "Linear_Form.defs.hh"
-#include "meta_programming.hh"
-#include "assert.hh"
-#include <vector>
-#include <deque>
-#include <string>
-#include <iostream>
-#include <sstream>
-#include <stdexcept>
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-Octagonal_Shape<T>::Octagonal_Shape(const Polyhedron& ph,
-                                    const Complexity_Class complexity)
-  : matrix(0), space_dim(0), status() {
-  const dimension_type num_dimensions = ph.space_dimension();
-
-  if (ph.marked_empty()) {
-    *this = Octagonal_Shape(num_dimensions, EMPTY);
-    return;
-  }
-
-  if (num_dimensions == 0) {
-    *this = Octagonal_Shape(num_dimensions, UNIVERSE);
-    return;
-  }
-
-  // Build from generators when we do not care about complexity
-  // or when the process has polynomial complexity.
-  if (complexity == ANY_COMPLEXITY
-      || (!ph.has_pending_constraints() && ph.generators_are_up_to_date())) {
-    *this = Octagonal_Shape(ph.generators());
-    return;
-  }
-
-  // We cannot afford exponential complexity, we do not have a complete set
-  // of generators for the polyhedron, and the polyhedron is not trivially
-  // empty or zero-dimensional.  Constraints, however, are up to date.
-  PPL_ASSERT(ph.constraints_are_up_to_date());
-
-  if (!ph.has_something_pending() && ph.constraints_are_minimized()) {
-    // If the constraint system of the polyhedron is minimized,
-    // the test `is_universe()' has polynomial complexity.
-    if (ph.is_universe()) {
-      *this = Octagonal_Shape(num_dimensions, UNIVERSE);
-      return;
-    }
-  }
-
-  // See if there is at least one inconsistent constraint in `ph.con_sys'.
-  for (Constraint_System::const_iterator i = ph.con_sys.begin(),
-         cs_end = ph.con_sys.end(); i != cs_end; ++i)
-    if (i->is_inconsistent()) {
-      *this = Octagonal_Shape(num_dimensions, EMPTY);
-      return;
-    }
-
-  // If `complexity' allows it, use simplex to derive the exact (modulo
-  // the fact that our OSs are topologically closed) variable bounds.
-  if (complexity == SIMPLEX_COMPLEXITY) {
-    MIP_Problem lp(num_dimensions);
-    lp.set_optimization_mode(MAXIMIZATION);
-
-    const Constraint_System& ph_cs = ph.constraints();
-    if (!ph_cs.has_strict_inequalities())
-      lp.add_constraints(ph_cs);
-    else
-      // Adding to `lp' a topologically closed version of `ph_cs'.
-      for (Constraint_System::const_iterator i = ph_cs.begin(),
-             ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
-        const Constraint& c = *i;
-        if (c.is_strict_inequality())
-          lp.add_constraint(Linear_Expression(c) >= 0);
-        else
-          lp.add_constraint(c);
-      }
-
-    // Check for unsatisfiability.
-    if (!lp.is_satisfiable()) {
-      *this = Octagonal_Shape<T>(num_dimensions, EMPTY);
-      return;
-    }
-
-    // Start with a universe OS that will be refined by the simplex.
-    *this = Octagonal_Shape<T>(num_dimensions, UNIVERSE);
-    // Get all the upper bounds.
-    Generator g(point());
-    PPL_DIRTY_TEMP_COEFFICIENT(numer);
-    PPL_DIRTY_TEMP_COEFFICIENT(denom);
-    for (dimension_type i = 0; i < num_dimensions; ++i) {
-      Variable x(i);
-      // Evaluate optimal upper bound for `x <= ub'.
-      lp.set_objective_function(x);
-      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-        g = lp.optimizing_point();
-        lp.evaluate_objective_function(g, numer, denom);
-        numer *= 2;
-        div_round_up(matrix[2*i + 1][2*i], numer, denom);
-      }
-      // Evaluate optimal upper bounds for `x + y <= ub'.
-      for (dimension_type j = 0; j < i; ++j) {
-        Variable y(j);
-        lp.set_objective_function(x + y);
-        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-          g = lp.optimizing_point();
-          lp.evaluate_objective_function(g, numer, denom);
-          div_round_up(matrix[2*i + 1][2*j], numer, denom);
-        }
-      }
-      // Evaluate optimal upper bound for `x - y <= ub'.
-      for (dimension_type j = 0; j < num_dimensions; ++j) {
-        if (i == j)
-          continue;
-        Variable y(j);
-        lp.set_objective_function(x - y);
-        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-          g = lp.optimizing_point();
-          lp.evaluate_objective_function(g, numer, denom);
-          div_round_up(((i < j) ?
-                        matrix[2*j][2*i]
-                        : matrix[2*i + 1][2*j + 1]),
-                       numer, denom);
-        }
-      }
-      // Evaluate optimal upper bound for `y - x <= ub'.
-      for (dimension_type j = 0; j < num_dimensions; ++j) {
-        if (i == j)
-          continue;
-        Variable y(j);
-        lp.set_objective_function(x - y);
-        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-          g = lp.optimizing_point();
-          lp.evaluate_objective_function(g, numer, denom);
-          div_round_up(((i < j)
-                        ? matrix[2*j][2*i]
-                        : matrix[2*i + 1][2*j + 1]),
-                       numer, denom);
-        }
-      }
-      // Evaluate optimal upper bound for `-x - y <= ub'.
-      for (dimension_type j = 0; j < i; ++j) {
-        Variable y(j);
-        lp.set_objective_function(-x - y);
-        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-          g = lp.optimizing_point();
-          lp.evaluate_objective_function(g, numer, denom);
-          div_round_up(matrix[2*i][2*j + 1], numer, denom);
-        }
-      }
-      // Evaluate optimal upper bound for `-x <= ub'.
-      lp.set_objective_function(-x);
-      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-        g = lp.optimizing_point();
-        lp.evaluate_objective_function(g, numer, denom);
-        numer *= 2;
-        div_round_up(matrix[2*i][2*i + 1], numer, denom);
-      }
-    }
-    set_strongly_closed();
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Extract easy-to-find bounds from constraints.
-  PPL_ASSERT(complexity == POLYNOMIAL_COMPLEXITY);
-  *this = Octagonal_Shape(num_dimensions, UNIVERSE);
-  refine_with_constraints(ph.constraints());
-}
-
-template <typename T>
-Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
-  : matrix(gs.space_dimension()),
-    space_dim(gs.space_dimension()),
-    status() {
-  const Generator_System::const_iterator gs_begin = gs.begin();
-  const Generator_System::const_iterator gs_end = gs.end();
-  if (gs_begin == gs_end) {
-    // An empty generator system defines the empty polyhedron.
-    set_empty();
-    return;
-  }
-
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typename OR_Matrix<N>::row_iterator mat_begin = matrix.row_begin();
-
-  PPL_DIRTY_TEMP(N, tmp);
-  bool mat_initialized = false;
-  bool point_seen = false;
-  // Going through all the points and closure points.
-  for (Generator_System::const_iterator k = gs_begin; k != gs_end; ++k) {
-    const Generator& g = *k;
-    switch (g.type()) {
-    case Generator::POINT:
-      point_seen = true;
-      // Intentionally fall through.
-    case Generator::CLOSURE_POINT:
-      if (!mat_initialized) {
-        // When handling the first (closure) point, we initialize the matrix.
-        mat_initialized = true;
-        const Coefficient& d = g.divisor();
-        // TODO: This can be optimized more, if needed, exploiting the
-        // (possible) sparseness of g. Also consider if OR_Matrix should be
-        // sparse, too.
-        for (dimension_type i = 0; i < space_dim; ++i) {
-          const Coefficient& g_i = g.coefficient(Variable(i));
-          const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
-          for (dimension_type j = 0; j < i; ++j) {
-            const Coefficient& g_j = g.coefficient(Variable(j));
-            const dimension_type dj = 2*j;
-            // Set for any point the hyperplanes passing in the point
-            // and having the octagonal gradient.
-            // Let be P = [P_1, P_2, ..., P_n] point.
-            // Hyperplanes: X_i - X_j = P_i - P_j.
-            div_round_up(x_i[dj], g_j - g_i, d);
-            div_round_up(x_ii[dj + 1], g_i - g_j, d);
-            // Hyperplanes: X_i + X_j = P_i + P_j.
-            div_round_up(x_i[dj + 1], -g_j - g_i, d);
-            div_round_up(x_ii[dj], g_i + g_j, d);
-          }
-          // Hyperplanes: X_i = P_i.
-          div_round_up(x_i[di + 1], -g_i - g_i, d);
-          div_round_up(x_ii[di], g_i + g_i, d);
-        }
-      }
-      else {
-        // This is not the first point: the matrix already contains
-        // valid values and we must compute maxima.
-        const Coefficient& d = g.divisor();
-        // TODO: This can be optimized more, if needed, exploiting the
-        // (possible) sparseness of g. Also consider if OR_Matrix should be
-        // sparse, too.
-        for (dimension_type i = 0; i < space_dim; ++i) {
-          const Coefficient& g_i = g.coefficient(Variable(i));
-          const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
-          for (dimension_type j = 0; j < i; ++j) {
-            const Coefficient& g_j = g.coefficient(Variable(j));
-            const dimension_type dj = 2*j;
-            // Set for any point the straight lines passing in the point
-            // and having the octagonal gradient; compute maxima values.
-            // Let be P = [P_1, P_2, ..., P_n] point.
-            // Hyperplane: X_i - X_j = max (P_i - P_j, const).
-            div_round_up(tmp, g_j - g_i, d);
-            max_assign(x_i[dj], tmp);
-            div_round_up(tmp, g_i - g_j, d);
-            max_assign(x_ii[dj + 1], tmp);
-            // Hyperplane: X_i + X_j = max (P_i + P_j, const).
-            div_round_up(tmp, -g_j - g_i, d);
-            max_assign(x_i[dj + 1], tmp);
-            div_round_up(tmp, g_i + g_j, d);
-            max_assign(x_ii[dj], tmp);
-          }
-          // Hyperplane: X_i = max (P_i, const).
-          div_round_up(tmp, -g_i - g_i, d);
-          max_assign(x_i[di + 1], tmp);
-          div_round_up(tmp, g_i + g_i, d);
-          max_assign(x_ii[di], tmp);
-        }
-      }
-      break;
-    default:
-      // Lines and rays temporarily ignored.
-      break;
-    }
-  }
-
-  if (!point_seen)
-    // The generator system is not empty, but contains no points.
-    throw_invalid_argument("Octagonal_Shape(gs)",
-                           "the non-empty generator system gs "
-                           "contains no points.");
-
-  // Going through all the lines and rays.
-  for (Generator_System::const_iterator k = gs_begin; k != gs_end; ++k) {
-    const Generator& g = *k;
-    switch (g.type()) {
-    case Generator::LINE:
-        // TODO: This can be optimized more, if needed, exploiting the
-        // (possible) sparseness of g. Also consider if OR_Matrix should be
-        // sparse, too.
-        for (dimension_type i = 0; i < space_dim; ++i) {
-          const Coefficient& g_i = g.coefficient(Variable(i));
-          const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
-          for (dimension_type j = 0; j < i; ++j) {
-            const Coefficient& g_j = g.coefficient(Variable(j));
-            const dimension_type dj = 2*j;
-            // Set for any line the right limit.
-            if (g_i != g_j) {
-              // Hyperplane: X_i - X_j <=/>= +Inf.
-              assign_r(x_i[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
-              assign_r(x_ii[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            }
-            if (g_i != -g_j) {
-              // Hyperplane: X_i + X_j <=/>= +Inf.
-              assign_r(x_i[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-              assign_r(x_ii[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            }
-          }
-          if (g_i != 0) {
-            // Hyperplane: X_i <=/>= +Inf.
-            assign_r(x_i[di + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            assign_r(x_ii[di], PLUS_INFINITY, ROUND_NOT_NEEDED);
-          }
-        }
-      break;
-    case Generator::RAY:
-        // TODO: This can be optimized more, if needed, exploiting the
-        // (possible) sparseness of g. Also consider if OR_Matrix should be
-        // sparse, too.
-        for (dimension_type i = 0; i < space_dim; ++i) {
-          const Coefficient& g_i = g.coefficient(Variable(i));
-          const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
-          for (dimension_type j = 0; j < i; ++j) {
-            const Coefficient& g_j = g.coefficient(Variable(j));
-            const dimension_type dj = 2*j;
-            // Set for any ray the right limit in the case
-            // of the binary constraints.
-            if (g_i < g_j)
-              // Hyperplane: X_i - X_j >= +Inf.
-              assign_r(x_i[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            if (g_i > g_j)
-              // Hyperplane: X_i - X_j <= +Inf.
-              assign_r(x_ii[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            if (g_i < -g_j)
-              // Hyperplane: X_i + X_j >= +Inf.
-              assign_r(x_i[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-            if (g_i > -g_j)
-              // Hyperplane: X_i + X_j <= +Inf.
-              assign_r(x_ii[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
-          }
-          // Case: unary constraints.
-          if (g_i < 0)
-            // Hyperplane: X_i  = +Inf.
-            assign_r(x_i[di + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-          if (g_i > 0)
-            // Hyperplane: X_i  = +Inf.
-            assign_r(x_ii[di], PLUS_INFINITY, ROUND_NOT_NEEDED);
-        }
-      break;
-    default:
-      // Points and closure points already dealt with.
-      break;
-    }
-  }
-  set_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::add_constraint(const Constraint& c) {
-  const dimension_type c_space_dim = c.space_dimension();
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dim)
-    throw_dimension_incompatible("add_constraint(c)", c);
-
-  // Get rid of strict inequalities.
-  if (c.is_strict_inequality()) {
-    if (c.is_inconsistent()) {
-      set_empty();
-      return;
-    }
-    if (c.is_tautological())
-      return;
-    // Nontrivial strict inequalities are not allowed.
-    throw_invalid_argument("add_constraint(c)",
-                           "strict inequalities are not allowed");
-  }
-
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(term);
-  // Constraints that are not octagonal differences are not allowed.
-  if (!Octagonal_Shape_Helper
-    ::extract_octagonal_difference(c, c_space_dim, num_vars,
-                                   i, j, coeff, term))
-    throw_invalid_argument("add_constraint(c)",
-                           "c is not an octagonal constraint");
-
-  if (num_vars == 0) {
-    // Dealing with a trivial constraint (not a strict inequality).
-    if (c.inhomogeneous_term() < 0
-        || (c.is_equality() && c.inhomogeneous_term() != 0))
-      set_empty();
-    return;
-  }
-
-  // Select the cell to be modified for the "<=" part of constraint.
-  typename OR_Matrix<N>::row_iterator i_iter = matrix.row_begin() + i;
-  typename OR_Matrix<N>::row_reference_type m_i = *i_iter;
-  N& m_i_j = m_i[j];
-  // Set `coeff' to the absolute value of itself.
-  if (coeff < 0)
-    neg_assign(coeff);
-
-  bool is_oct_changed = false;
-  // Compute the bound for `m_i_j', rounding towards plus infinity.
-  PPL_DIRTY_TEMP(N, d);
-  div_round_up(d, term, coeff);
-  if (m_i_j > d) {
-    m_i_j = d;
-    is_oct_changed = true;
-  }
-
-  if (c.is_equality()) {
-    // Select the cell to be modified for the ">=" part of constraint.
-    if (i % 2 == 0)
-      ++i_iter;
-    else
-      --i_iter;
-
-    typename OR_Matrix<N>::row_reference_type m_ci = *i_iter;
-    using namespace Implementation::Octagonal_Shapes;
-    dimension_type cj = coherent_index(j);
-    N& m_ci_cj = m_ci[cj];
-    // Also compute the bound for `m_ci_cj', rounding towards plus infinity.
-    neg_assign(term);
-    div_round_up(d, term, coeff);
-    if (m_ci_cj > d) {
-      m_ci_cj = d;
-      is_oct_changed = true;
-    }
-  }
-
-  // This method does not preserve closure.
-  if (is_oct_changed && marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::add_congruence(const Congruence& cg) {
-  const dimension_type cg_space_dim = cg.space_dimension();
-  // Dimension-compatibility check:
-  // the dimension of `cg' can not be greater than space_dim.
-  if (space_dimension() < cg_space_dim)
-    throw_dimension_incompatible("add_congruence(cg)", cg);
-
-  // Handle the case of proper congruences first.
-  if (cg.is_proper_congruence()) {
-    if (cg.is_tautological())
-      return;
-    if (cg.is_inconsistent()) {
-      set_empty();
-      return;
-    }
-    // Non-trivial and proper congruences are not allowed.
-    throw_invalid_argument("add_congruence(cg)",
-                           "cg is a non-trivial, proper congruence");
-  }
-
-  PPL_ASSERT(cg.is_equality());
-  Constraint c(cg);
-  add_constraint(c);
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-Octagonal_Shape<T>::refine_with_linear_form_inequality(
-		    const Linear_Form< Interval<T, Interval_Info> >& left,
-		    const Linear_Form< Interval<T, Interval_Info> >& right) {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-                     "Octagonal_Shape<T>::refine_with_linear_form_inequality:"
-                     " T not a floating point type.");
-
-  // We assume that the analyzer will not try to apply an unreachable filter.
-  PPL_ASSERT(!marked_empty());
-
-  // Dimension-compatibility checks.
-  // The dimensions of `left' and `right' should not be greater than the
-  // dimension of `*this'.
-  const dimension_type left_space_dim = left.space_dimension();
-  if (space_dim < left_space_dim)
-    throw_dimension_incompatible(
-          "refine_with_linear_form_inequality(left, right)", "left", left);
-
-  const dimension_type right_space_dim = right.space_dimension();
-  if (space_dim < right_space_dim)
-    throw_dimension_incompatible(
-          "refine_with_linear_form_inequality(left, right)", "right", right);
-
-  // Number of non-zero coefficients in `left': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type left_t = 0;
-  // Variable-index of the last non-zero coefficient in `left', if any.
-  dimension_type left_w_id = 0;
-  // Number of non-zero coefficients in `right': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type right_t = 0;
-  // Variable-index of the last non-zero coefficient in `right', if any.
-  dimension_type right_w_id = 0;
-
-  // Get information about the number of non-zero coefficients in `left'.
-  for (dimension_type i = left_space_dim; i-- > 0; )
-    if (left.coefficient(Variable(i)) != 0) {
-      if (left_t++ == 1)
-        break;
-      else
-        left_w_id = i;
-    }
-
-  // Get information about the number of non-zero coefficients in `right'.
-  for (dimension_type i = right_space_dim; i-- > 0; )
-    if (right.coefficient(Variable(i)) != 0) {
-      if (right_t++ == 1)
-        break;
-      else
-        right_w_id = i;
-    }
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-  // FIXME: there is plenty of duplicate code in the following lines. We could
-  // shorten it at the expense of a bit of efficiency.
-
-  if (left_t == 0) {
-    if (right_t == 0) {
-      // The constraint involves constants only. Ignore it: it is up to
-      // the analyzer to handle it.
-      PPL_ASSERT(OK());
-      return;
-    }
-
-    if (right_t == 1) {
-      // The constraint has the form [a-, a+] <= [b-, b+] + [c-, c+] * x.
-      // Reduce it to the constraint +/-x <= b+ - a- if [c-, c+] = +/-[1, 1].
-      const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
-      if (right_w_coeff == 1) {
-        const dimension_type n_right = right_w_id * 2;
-        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_b = right.inhomogeneous_term();
-        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
-                     ROUND_UP);
-        mul_2exp_assign_r(b_plus_minus_a_minus, b_plus_minus_a_minus, 1,
-                          ROUND_UP);
-        add_octagonal_constraint(n_right, n_right + 1, b_plus_minus_a_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-
-      if (right_w_coeff == -1) {
-        const dimension_type n_right = right_w_id * 2;
-        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_b = right.inhomogeneous_term();
-        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
-                     ROUND_UP);
-        mul_2exp_assign_r(b_plus_minus_a_minus, b_plus_minus_a_minus, 1,
-                          ROUND_UP);
-        add_octagonal_constraint(n_right + 1, n_right, b_plus_minus_a_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-    }
-  }
-  else if (left_t == 1) {
-    if (right_t == 0) {
-      // The constraint has the form [b-, b+] + [c-, c+] * x <= [a-, a+]
-      // Reduce it to the constraint +/-x <= a+ - b- if [c-, c+] = +/-[1, 1].
-      const FP_Interval_Type& left_w_coeff =
-	                      left.coefficient(Variable(left_w_id));
-      if (left_w_coeff == 1) {
-        const dimension_type n_left = left_w_id * 2;
-        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-        const FP_Interval_Type& left_b = left.inhomogeneous_term();
-        const FP_Interval_Type& right_a = right.inhomogeneous_term();
-        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                     ROUND_UP);
-        mul_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
-                          ROUND_UP);
-        add_octagonal_constraint(n_left + 1, n_left, a_plus_minus_b_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-
-      if (left_w_coeff == -1) {
-        const dimension_type n_left = left_w_id * 2;
-        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-        const FP_Interval_Type& left_b = left.inhomogeneous_term();
-        const FP_Interval_Type& right_a = right.inhomogeneous_term();
-        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                     ROUND_UP);
-        mul_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
-                          ROUND_UP);
-        add_octagonal_constraint(n_left, n_left + 1, a_plus_minus_b_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-    }
-
-    if (right_t == 1) {
-      // The constraint has the form
-      // [a-, a+] + [b-, b+] * x <= [c-, c+] + [d-, d+] * y.
-      // Reduce it to the constraint +/-x +/-y <= c+ - a-
-      // if [b-, b+] = +/-[1, 1] and [d-, d+] = +/-[1, 1].
-      const FP_Interval_Type& left_w_coeff =
-                              left.coefficient(Variable(left_w_id));
-      const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
-      bool is_left_coeff_one = (left_w_coeff == 1);
-      bool is_left_coeff_minus_one = (left_w_coeff == -1);
-      bool is_right_coeff_one = (right_w_coeff == 1);
-      bool is_right_coeff_minus_one = (right_w_coeff == -1);
-      if (left_w_id == right_w_id) {
-        if ((is_left_coeff_one && is_right_coeff_one)
-            || (is_left_coeff_minus_one && is_right_coeff_minus_one)) {
-          // Here we have an identity or a constants-only constraint.
-          PPL_ASSERT(OK());
-          return;
-        }
-        if (is_left_coeff_one && is_right_coeff_minus_one) {
-          // We fall back to a previous case
-          // (but we do not need to multiply the result by two).
-          const dimension_type n_left = left_w_id * 2;
-          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-          const FP_Interval_Type& left_b = left.inhomogeneous_term();
-          const FP_Interval_Type& right_a = right.inhomogeneous_term();
-          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                       ROUND_UP);
-          add_octagonal_constraint(n_left + 1, n_left, a_plus_minus_b_minus);
-          PPL_ASSERT(OK());
-          return;
-        }
-        if (is_left_coeff_minus_one && is_right_coeff_one) {
-          // We fall back to a previous case
-          // (but we do not need to multiply the result by two).
-          const dimension_type n_left = left_w_id * 2;
-          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
-          const FP_Interval_Type& left_b = left.inhomogeneous_term();
-          const FP_Interval_Type& right_a = right.inhomogeneous_term();
-          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
-                       ROUND_UP);
-          add_octagonal_constraint(n_left, n_left + 1, a_plus_minus_b_minus);
-          PPL_ASSERT(OK());
-          return;
-        }
-      }
-      else if (is_left_coeff_one && is_right_coeff_one) {
-        const dimension_type n_left = left_w_id * 2;
-        const dimension_type n_right = right_w_id * 2;
-        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_c = right.inhomogeneous_term();
-        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
-                     ROUND_UP);
-        if (left_w_id < right_w_id)
-          add_octagonal_constraint(n_right, n_left, c_plus_minus_a_minus);
-        else
-          add_octagonal_constraint(n_left + 1, n_right + 1,
-                                   c_plus_minus_a_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-      if (is_left_coeff_one && is_right_coeff_minus_one) {
-        const dimension_type n_left = left_w_id * 2;
-        const dimension_type n_right = right_w_id * 2;
-        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_c = right.inhomogeneous_term();
-        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
-                     ROUND_UP);
-        if (left_w_id < right_w_id)
-          add_octagonal_constraint(n_right + 1, n_left, c_plus_minus_a_minus);
-        else
-          add_octagonal_constraint(n_left + 1, n_right, c_plus_minus_a_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-      if (is_left_coeff_minus_one && is_right_coeff_one) {
-        const dimension_type n_left = left_w_id * 2;
-        const dimension_type n_right = right_w_id * 2;
-        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_c = right.inhomogeneous_term();
-        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
-                     ROUND_UP);
-        if (left_w_id < right_w_id)
-          add_octagonal_constraint(n_right, n_left + 1, c_plus_minus_a_minus);
-        else
-          add_octagonal_constraint(n_left, n_right + 1, c_plus_minus_a_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-      if (is_left_coeff_minus_one && is_right_coeff_minus_one) {
-        const dimension_type n_left = left_w_id * 2;
-        const dimension_type n_right = right_w_id * 2;
-        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-        const FP_Interval_Type& left_a = left.inhomogeneous_term();
-        const FP_Interval_Type& right_c = right.inhomogeneous_term();
-        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
-                     ROUND_UP);
-        if (left_w_id < right_w_id)
-          add_octagonal_constraint(n_right + 1, n_left + 1,
-                                   c_plus_minus_a_minus);
-        else
-          add_octagonal_constraint(n_left, n_right, c_plus_minus_a_minus);
-        PPL_ASSERT(OK());
-        return;
-      }
-    }
-  }
-
-  // General case.
-
-  // FIRST, update the binary constraints for each pair of DIFFERENT variables
-  // in `left' and `right'.
-
-  // Declare temporaries outside of the loop.
-  PPL_DIRTY_TEMP(N, low_coeff);
-  PPL_DIRTY_TEMP(N, high_coeff);
-  PPL_DIRTY_TEMP(N, upper_bound);
-
-  Linear_Form<FP_Interval_Type> right_minus_left(right);
-  right_minus_left -= left;
-
-  dimension_type max_w_id = std::max(left_w_id, right_w_id);
-  for (dimension_type first_v = 0; first_v < max_w_id; ++first_v) {
-    for (dimension_type second_v = first_v + 1;
-         second_v <= max_w_id; ++second_v) {
-      const FP_Interval_Type& lfv_coefficient =
-                        left.coefficient(Variable(first_v));
-      const FP_Interval_Type& lsv_coefficient =
-                        left.coefficient(Variable(second_v));
-      const FP_Interval_Type& rfv_coefficient =
-                        right.coefficient(Variable(first_v));
-      const FP_Interval_Type& rsv_coefficient =
-                        right.coefficient(Variable(second_v));
-      // We update the constraints only when both variables appear in at
-      // least one argument.
-      bool do_update = false;
-      assign_r(low_coeff, lfv_coefficient.lower(), ROUND_NOT_NEEDED);
-      assign_r(high_coeff, lfv_coefficient.upper(), ROUND_NOT_NEEDED);
-      if (low_coeff != 0 || high_coeff != 0) {
-        assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
-        assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
-        if (low_coeff != 0 || high_coeff != 0)
-          do_update = true;
-        else {
-          assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
-          assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
-          if (low_coeff != 0 || high_coeff != 0)
-            do_update = true;
-        }
-      }
-      else {
-        assign_r(low_coeff, rfv_coefficient.lower(), ROUND_NOT_NEEDED);
-        assign_r(high_coeff, rfv_coefficient.upper(), ROUND_NOT_NEEDED);
-        if (low_coeff != 0 || high_coeff != 0) {
-          assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
-          assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
-          if (low_coeff != 0 || high_coeff != 0)
-            do_update = true;
-          else {
-            assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
-            assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
-            if (low_coeff != 0 || high_coeff != 0)
-              do_update = true;
-          }
-        }
-      }
-
-      if (do_update) {
-        Variable first(first_v);
-        Variable second(second_v);
-        dimension_type n_first_var = first_v * 2;
-        dimension_type n_second_var = second_v * 2;
-        linear_form_upper_bound(right_minus_left - first + second,
-                                upper_bound);
-        add_octagonal_constraint(n_second_var + 1, n_first_var + 1,
-                                 upper_bound);
-        linear_form_upper_bound(right_minus_left + first + second,
-                                upper_bound);
-        add_octagonal_constraint(n_second_var + 1, n_first_var, upper_bound);
-        linear_form_upper_bound(right_minus_left - first - second,
-                                upper_bound);
-        add_octagonal_constraint(n_second_var, n_first_var + 1, upper_bound);
-        linear_form_upper_bound(right_minus_left + first - second,
-                                upper_bound);
-        add_octagonal_constraint(n_second_var, n_first_var, upper_bound);
-      }
-    }
-  }
-
-  // Finally, update the unary constraints.
-  for (dimension_type v = 0; v <= max_w_id; ++v) {
-    const FP_Interval_Type& lv_coefficient =
-                        left.coefficient(Variable(v));
-    const FP_Interval_Type& rv_coefficient =
-                        right.coefficient(Variable(v));
-    // We update the constraints only if v appears in at least one of the
-    // two arguments.
-    bool do_update = false;
-    assign_r(low_coeff, lv_coefficient.lower(), ROUND_NOT_NEEDED);
-    assign_r(high_coeff, lv_coefficient.upper(), ROUND_NOT_NEEDED);
-    if (low_coeff != 0 || high_coeff != 0)
-      do_update = true;
-    else {
-      assign_r(low_coeff, rv_coefficient.lower(), ROUND_NOT_NEEDED);
-      assign_r(high_coeff, rv_coefficient.upper(), ROUND_NOT_NEEDED);
-      if (low_coeff != 0 || high_coeff != 0)
-        do_update = true;
-    }
-
-    if (do_update) {
-      Variable var(v);
-      dimension_type n_var = 2 * v;
-      /*
-        VERY DIRTY trick: since we need to keep the old unary constraints
-        while computing the new ones, we momentarily keep the new coefficients
-        in the main diagonal of the matrix. They will be moved later.
-      */
-      linear_form_upper_bound(right_minus_left + var, upper_bound);
-      mul_2exp_assign_r(matrix[n_var + 1][n_var + 1], upper_bound, 1,
-                        ROUND_UP);
-      linear_form_upper_bound(right_minus_left - var, upper_bound);
-      mul_2exp_assign_r(matrix[n_var][n_var], upper_bound, 1,
-                        ROUND_UP);
-    }
-  }
-
-  /*
-    Now move the newly computed coefficients from the main diagonal to
-    their proper place, and restore +infinity on the diagonal.
-  */
-  Row_Iterator m_ite = matrix.row_begin();
-  Row_Iterator m_end = matrix.row_end();
-  for (dimension_type i = 0; m_ite != m_end; i += 2) {
-    Row_Reference upper = *m_ite;
-    N& ul = upper[i];
-    add_octagonal_constraint(i, i + 1, ul);
-    assign_r(ul, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    ++m_ite;
-    Row_Reference lower = *m_ite;
-    N& lr = lower[i + 1];
-    add_octagonal_constraint(i + 1, i, lr);
-    assign_r(lr, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    ++m_ite;
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::refine_no_check(const Constraint& c) {
-  PPL_ASSERT(!marked_empty());
-  const dimension_type c_space_dim = c.space_dimension();
-  PPL_ASSERT(c_space_dim <= space_dim);
-
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(term);
-  // Constraints that are not octagonal differences are ignored.
-  if (!Octagonal_Shape_Helper
-    ::extract_octagonal_difference(c, c_space_dim, num_vars,
-                                   i, j, coeff, term))
-    return;
-
-  if (num_vars == 0) {
-    const Coefficient& c_inhomo = c.inhomogeneous_term();
-    // Dealing with a trivial constraint (maybe a strict inequality).
-    if (c_inhomo < 0
-        || (c_inhomo != 0 && c.is_equality())
-        || (c_inhomo == 0 && c.is_strict_inequality()))
-      set_empty();
-    return;
-  }
-
-  // Select the cell to be modified for the "<=" part of constraint.
-  typename OR_Matrix<N>::row_iterator i_iter = matrix.row_begin() + i;
-  typename OR_Matrix<N>::row_reference_type m_i = *i_iter;
-  N& m_i_j = m_i[j];
-  // Set `coeff' to the absolute value of itself.
-  if (coeff < 0)
-    neg_assign(coeff);
-
-  bool is_oct_changed = false;
-  // Compute the bound for `m_i_j', rounding towards plus infinity.
-  PPL_DIRTY_TEMP(N, d);
-  div_round_up(d, term, coeff);
-  if (m_i_j > d) {
-    m_i_j = d;
-    is_oct_changed = true;
-  }
-
-  if (c.is_equality()) {
-    // Select the cell to be modified for the ">=" part of constraint.
-    if (i % 2 == 0)
-      ++i_iter;
-    else
-      --i_iter;
-
-    typename OR_Matrix<N>::row_reference_type m_ci = *i_iter;
-    using namespace Implementation::Octagonal_Shapes;
-    dimension_type cj = coherent_index(j);
-    N& m_ci_cj = m_ci[cj];
-    // Also compute the bound for `m_ci_cj', rounding towards plus infinity.
-    neg_assign(term);
-    div_round_up(d, term, coeff);
-    if (m_ci_cj > d) {
-      m_ci_cj = d;
-      is_oct_changed = true;
-    }
-  }
-
-  // This method does not preserve closure.
-  if (is_oct_changed && marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-dimension_type
-Octagonal_Shape<T>::affine_dimension() const {
-  const dimension_type n_rows = matrix.num_rows();
-  // A zero-space-dim shape always has affine dimension zero.
-  if (n_rows == 0)
-    return 0;
-
-  // Strong closure is necessary to detect emptiness
-  // and all (possibly implicit) equalities.
-  strong_closure_assign();
-  if (marked_empty())
-    return 0;
-
-  // The vector `leaders' is used to represent non-singular
-  // equivalence classes:
-  // `leaders[i] == i' if and only if `i' is the leader of its
-  // equivalence class (i.e., the minimum index in the class).
-  std::vector<dimension_type> leaders;
-  compute_leaders(leaders);
-
-  // Due to the splitting of variables, the affine dimension is the
-  // number of non-singular positive zero-equivalence classes.
-  dimension_type affine_dim = 0;
-  for (dimension_type i = 0; i < n_rows; i += 2)
-    // Note: disregard the singular equivalence class.
-    if (leaders[i] == i && leaders[i + 1] == i + 1)
-      ++affine_dim;
-
-  return affine_dim;
-}
-
-template <typename T>
-Congruence_System
-Octagonal_Shape<T>::minimized_congruences() const {
-  // Strong closure is necessary to detect emptiness
-  // and all (possibly implicit) equalities.
-  strong_closure_assign();
-  const dimension_type space_dim = space_dimension();
-  Congruence_System cgs(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cgs = Congruence_System::zero_dim_empty();
-    return cgs;
-  }
-
-  if (marked_empty()) {
-    cgs.insert(Congruence::zero_dim_false());
-    return cgs;
-  }
-
-  // The vector `leaders' is used to represent equivalence classes:
-  // `leaders[i] == i' if and only if `i' is the leader of its
-  // equivalence class (i.e., the minimum index in the class).
-  std::vector<dimension_type> leaders;
-  compute_leaders(leaders);
-
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  for (dimension_type i = 0, i_end = 2*space_dim; i != i_end; i += 2) {
-    const dimension_type lead_i = leaders[i];
-    if (i == lead_i) {
-      if (leaders[i + 1] == i)
-        // `i' is the leader of the singular equivalence class.
-        goto singular;
-      else
-        // `i' is the leader of a non-singular equivalence class.
-        continue;
-    }
-    else {
-      // `i' is not a leader.
-      if (leaders[i + 1] == lead_i)
-        // `i' belongs to the singular equivalence class.
-        goto singular;
-      else
-        // `i' does not belong to the singular equivalence class.
-        goto non_singular;
-    }
-
-  singular:
-    // `i' belongs to the singular equivalence class:
-    // we have a unary equality constraint.
-    {
-      const Variable x(i/2);
-      const N& c_ii_i = matrix[i + 1][i];
-#ifndef NDEBUG
-      const N& c_i_ii = matrix[i][i + 1];
-      PPL_ASSERT(is_additive_inverse(c_i_ii, c_ii_i));
-#endif
-      numer_denom(c_ii_i, numer, denom);
-      denom *= 2;
-      cgs.insert(denom*x == numer);
-    }
-    continue;
-
-  non_singular:
-    // `i' does not belong to the singular equivalence class.
-    // we have a binary equality constraint.
-    {
-      const N& c_i_li = matrix[i][lead_i];
-#ifndef NDEBUG
-      using namespace Implementation::Octagonal_Shapes;
-      const N& c_ii_lii = matrix[i + 1][coherent_index(lead_i)];
-      PPL_ASSERT(is_additive_inverse(c_ii_lii, c_i_li));
-#endif
-      const Variable x(lead_i/2);
-      const Variable y(i/2);
-      numer_denom(c_i_li, numer, denom);
-      if (lead_i % 2 == 0)
-        cgs.insert(denom*x - denom*y == numer);
-      else
-        cgs.insert(denom*x + denom*y + numer == 0);
-    }
-    continue;
-  }
-  return cgs;
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::concatenate_assign(const Octagonal_Shape& y) {
-  // If `y' is an empty 0-dim space octagon, let `*this' become empty.
-  // If `y' is an universal 0-dim space octagon, we simply return.
-  if (y.space_dim == 0) {
-    if (y.marked_empty())
-      set_empty();
-    return;
-  }
-
-  // If `*this' is an empty 0-dim space octagon, then it is sufficient
-  // to adjust the dimension of the vector space.
-  if (space_dim == 0 && marked_empty()) {
-    add_space_dimensions_and_embed(y.space_dim);
-    return;
-  }
-
-  // This is the old number of rows in the matrix. It is equal to
-  // the first index of columns to change.
-  dimension_type old_num_rows = matrix.num_rows();
-  // First we increase the space dimension of `*this' by adding
-  // `y.space_dimension()' new dimensions.
-  // The matrix for the new octagon is obtained
-  // by leaving the old system of constraints in the upper left-hand side
-  // (where they are at the present) and placing the constraints of `y' in the
-  // lower right-hand side.
-  add_space_dimensions_and_embed(y.space_dim);
-  typename OR_Matrix<N>::const_element_iterator
-    y_it = y.matrix.element_begin();
-  for (typename OR_Matrix<N>::row_iterator
-         i = matrix.row_begin() + old_num_rows,
-         matrix_row_end = matrix.row_end(); i != matrix_row_end; ++i) {
-    typename OR_Matrix<N>::row_reference_type r = *i;
-    dimension_type rs_i = i.row_size();
-    for (dimension_type j = old_num_rows; j < rs_i; ++j, ++y_it)
-      r[j] = *y_it;
-  }
-
-  // The concatenation does not preserve the closure.
-  if (marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::contains(const Octagonal_Shape& y) const {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("contains(y)", y);
-
-  if (space_dim == 0) {
-    // The zero-dimensional empty octagon only contains another
-    // zero-dimensional empty octagon.
-    // The zero-dimensional universe octagon contains any other
-    // zero-dimensional octagon.
-    return marked_empty() ? y.marked_empty() : true;
-  }
-
-  // `y' needs to be transitively closed.
-  y.strong_closure_assign();
-  // An empty octagon is in any other dimension-compatible octagons.
-  if (y.marked_empty())
-    return true;
-
-  // If `*this' is empty it can not contain `y' (which is not empty).
-  if (is_empty())
-    return false;
-
-  // `*this' contains `y' if and only if every element of `*this'
-  // is greater than or equal to the correspondent one of `y'.
-  for (typename OR_Matrix<N>::const_element_iterator
-         i = matrix.element_begin(), j = y.matrix.element_begin(),
-         matrix_element_end = matrix.element_end();
-       i != matrix_element_end; ++i, ++j)
-    if (*i < *j)
-      return false;
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::is_disjoint_from(const Octagonal_Shape& y) const {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("is_disjoint_from(y)", y);
-
-  // If one Octagonal_Shape is empty, the Octagonal_Shapes are disjoint.
-  strong_closure_assign();
-  if (marked_empty())
-    return true;
-  y.strong_closure_assign();
-  if (y.marked_empty())
-    return true;
-
-  // Two Octagonal_Shapes are disjoint if and only if their
-  // intersection is empty, i.e., if and only if there exists a
-  // variable such that the upper bound of the constraint on that
-  // variable in the first Octagonal_Shape is strictly less than the
-  // lower bound of the corresponding constraint in the second
-  // Octagonal_Shape or vice versa.
-
-  const dimension_type n_rows = matrix.num_rows();
-
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
-
-  const Row_Iterator y_begin = y.matrix.row_begin();
-
-  PPL_DIRTY_TEMP(N, neg_y_ci_cj);
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
-    using namespace Implementation::Octagonal_Shapes;
-    const dimension_type i = i_iter.index();
-    const dimension_type ci = coherent_index(i);
-    const dimension_type rs_i = i_iter.row_size();
-    Row_Reference m_i = *i_iter;
-    for (dimension_type j = 0; j < n_rows; ++j) {
-      const dimension_type cj = coherent_index(j);
-      Row_Reference m_cj = *(m_begin + cj);
-      const N& m_i_j = (j < rs_i) ? m_i[j] : m_cj[ci];
-      Row_Reference y_ci = *(y_begin + ci);
-      Row_Reference y_j = *(y_begin + j);
-      const N& y_ci_cj = (j < rs_i) ? y_ci[cj] : y_j[i];
-      neg_assign_r(neg_y_ci_cj, y_ci_cj, ROUND_UP);
-      if (m_i_j < neg_y_ci_cj)
-        return true;
-    }
-  }
-  return false;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::is_universe() const {
-  // An empty octagon is not universe.
-  if (marked_empty())
-    return false;
-
-  // If the octagon is non-empty and zero-dimensional,
-  // then it is necessarily the universe octagon.
-  if (space_dim == 0)
-    return true;
-
-  // An universe octagon can only contains trivial  constraints.
-  for (typename OR_Matrix<N>::const_element_iterator
-         i = matrix.element_begin(), matrix_element_end = matrix.element_end();
-       i != matrix_element_end;
-       ++i)
-    if (!is_plus_infinity(*i))
-      return false;
-
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::is_bounded() const {
-  strong_closure_assign();
-  // A zero-dimensional or empty octagon is bounded.
-  if (marked_empty() || space_dim == 0)
-    return true;
-
-  // A bounded octagon never can contains trivial constraints.
-  for (typename OR_Matrix<N>::const_row_iterator i = matrix.row_begin(),
-         matrix_row_end = matrix.row_end(); i != matrix_row_end; ++i) {
-    typename OR_Matrix<N>::const_row_reference_type x_i = *i;
-    const dimension_type i_index = i.index();
-    for (dimension_type j = i.row_size(); j-- > 0; )
-      if (i_index != j)
-        if (is_plus_infinity(x_i[j]))
-          return false;
-  }
-
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::contains_integer_point() const {
-  // Force strong closure.
-  if (is_empty())
-    return false;
-  const dimension_type space_dim = space_dimension();
-  if (space_dim == 0)
-    return true;
-
-  // A strongly closed and consistent Octagonal_Shape defined by
-  // integer constraints can only be empty due to tight coherence.
-  if (std::numeric_limits<T>::is_integer)
-    return !tight_coherence_would_make_empty();
-
-  // Build an integer Octagonal_Shape oct_z with bounds at least as
-  // tight as those in *this and then recheck for emptiness, also
-  // exploiting tight-coherence.
-  Octagonal_Shape<mpz_class> oct_z(space_dim);
-  oct_z.reset_strongly_closed();
-
-  typedef Octagonal_Shape<mpz_class>::N Z;
-  bool all_integers = true;
-  typename OR_Matrix<N>::const_element_iterator x_i = matrix.element_begin();
-  for (typename OR_Matrix<Z>::element_iterator
-         z_i = oct_z.matrix.element_begin(),
-         z_end = oct_z.matrix.element_end(); z_i != z_end; ++z_i, ++x_i) {
-    const N& d = *x_i;
-    if (is_plus_infinity(d))
-      continue;
-    if (is_integer(d))
-      assign_r(*z_i, d, ROUND_NOT_NEEDED);
-    else {
-      all_integers = false;
-      assign_r(*z_i, d, ROUND_DOWN);
-    }
-  }
-  // Restore strong closure.
-  if (all_integers)
-    // oct_z unchanged, so it is still strongly closed.
-    oct_z.set_strongly_closed();
-  else {
-    // oct_z changed: recompute strong closure.
-    oct_z.strong_closure_assign();
-    if (oct_z.marked_empty())
-      return false;
-  }
-  return !oct_z.tight_coherence_would_make_empty();
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::frequency(const Linear_Expression& expr,
-                              Coefficient& freq_n, Coefficient& freq_d,
-                              Coefficient& val_n, Coefficient& val_d) const {
-  dimension_type space_dim = space_dimension();
-  // The dimension of `expr' must be at most the dimension of *this.
-  if (space_dim < expr.space_dimension())
-    throw_dimension_incompatible("frequency(e, ...)", "e", expr);
-
-  // Check if `expr' has a constant value.
-  // If it is constant, set the frequency `freq_n' to 0
-  // and return true. Otherwise the values for \p expr
-  // are not discrete so return false.
-
-  // Space dimension is 0: if empty, then return false;
-  // otherwise the frequency is 0 and the value is the inhomogeneous term.
-  if (space_dim == 0) {
-    if (is_empty())
-      return false;
-    freq_n = 0;
-    freq_d = 1;
-    val_n = expr.inhomogeneous_term();
-    val_d = 1;
-    return true;
-  }
-
-  strong_closure_assign();
-  // For an empty Octagonal shape, we simply return false.
-  if (marked_empty())
-    return false;
-
-  // The Octagonal shape has at least 1 dimension and is not empty.
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff_j);
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  Linear_Expression le = expr;
-  // Boolean to keep track of a variable `v' in expression `le'.
-  // If we can replace `v' by an expression using variables other
-  // than `v' and are already in `le', then this is set to true.
-  bool constant_v = false;
-
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
-  val_denom = 1;
-
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
-    constant_v = false;
-    dimension_type i = i_iter.index();
-    const Variable v(i/2);
-    coeff = le.coefficient(v);
-    if (coeff == 0) {
-      constant_v = true;
-      continue;
-    }
-    // We check the unary constraints.
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ii = *(i_iter + 1);
-    const N& m_i_ii = m_i[i + 1];
-    const N& m_ii_i = m_ii[i];
-    if ((!is_plus_infinity(m_i_ii) && !is_plus_infinity(m_ii_i))
-        && (is_additive_inverse(m_i_ii, m_ii_i))) {
-      // If `v' is constant, replace it in `le' by the value.
-      numer_denom(m_i_ii, numer, denom);
-      denom *= 2;
-      le -= coeff*v;
-      le *= denom;
-      le -= numer*coeff;
-      val_denom *= denom;
-      constant_v = true;
-      continue;
-    }
-    // Check the octagonal constraints between `v' and the other dimensions
-    // that have non-zero coefficient in `le'.
-    else {
-      PPL_ASSERT(!constant_v);
-      using namespace Implementation::Octagonal_Shapes;
-      const dimension_type ci = coherent_index(i);
-      for (Row_Iterator j_iter = i_iter; j_iter != m_end; j_iter += 2) {
-        dimension_type j = j_iter.index();
-        const Variable vj(j/2);
-        coeff_j = le.coefficient(vj);
-        if (coeff_j == 0)
-          // The coefficient in `le' is 0, so do nothing.
-          continue;
-        const dimension_type cj = coherent_index(j);
-        const dimension_type cjj = coherent_index(j + 1);
-
-        Row_Reference m_j = *(m_begin + j);
-        Row_Reference m_cj = *(m_begin + cj);
-        const N& m_j_i = m_j[i];
-        const N& m_i_j = m_cj[ci];
-        if ((!is_plus_infinity(m_i_j) && !is_plus_infinity(m_j_i))
-            && (is_additive_inverse(m_i_j, m_j_i))) {
-          // The coefficient for `vj' in `le' is not 0
-          // and the constraint with `v' is an equality.
-          // So apply this equality to eliminate `v' in `le'.
-          numer_denom(m_i_j, numer, denom);
-          le -= coeff*v;
-          le += coeff*vj;
-          le *= denom;
-          le -= numer*coeff;
-          val_denom *= denom;
-          constant_v = true;
-          break;
-        }
-
-        m_j = *(m_begin + (j + 1));
-        m_cj = *(m_begin + cjj);
-        const N& m_j_i1 = m_j[i];
-        const N& m_i_j1 = m_cj[ci];
-        if ((!is_plus_infinity(m_i_j1) && !is_plus_infinity(m_j_i1))
-            && (is_additive_inverse(m_i_j1, m_j_i1))) {
-          // The coefficient for `vj' in `le' is not 0
-          // and the constraint with `v' is an equality.
-          // So apply this equality to eliminate `v' in `le'.
-          numer_denom(m_i_j1, numer, denom);
-          le -= coeff*v;
-          le -= coeff*vj;
-          le *= denom;
-          le -= numer*coeff;
-          val_denom *= denom;
-          constant_v = true;
-          break;
-        }
-      }
-      if (!constant_v)
-        // The expression `expr' is not constant.
-        return false;
-    }
-  }
-  if (!constant_v)
-    // The expression `expr' is not constant.
-    return false;
-
-  // The expression 'expr' is constant.
-  freq_n = 0;
-  freq_d = 1;
-
-  // Reduce `val_n' and `val_d'.
-  normalize2(le.inhomogeneous_term(), val_denom, val_n, val_d);
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::constrains(const Variable var) const {
-  // `var' should be one of the dimensions of the octagonal shape.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (space_dimension() < var_space_dim)
-    throw_dimension_incompatible("constrains(v)", "v", var);
-
-  // An octagon known to be empty constrains all variables.
-  // (Note: do not force emptiness check _yet_)
-  if (marked_empty())
-    return true;
-
-  // Check whether `var' is syntactically constrained.
-  const dimension_type n_v = 2*(var_space_dim - 1);
-  typename OR_Matrix<N>::const_row_iterator m_iter = matrix.row_begin() + n_v;
-  typename OR_Matrix<N>::const_row_reference_type r_v = *m_iter;
-  typename OR_Matrix<N>::const_row_reference_type r_cv = *(++m_iter);
-  for (dimension_type h = m_iter.row_size(); h-- > 0; ) {
-    if (!is_plus_infinity(r_v[h]) || !is_plus_infinity(r_cv[h]))
-      return true;
-  }
-  ++m_iter;
-  for (typename OR_Matrix<N>::const_row_iterator m_end = matrix.row_end();
-       m_iter != m_end; ++m_iter) {
-    typename OR_Matrix<N>::const_row_reference_type r = *m_iter;
-    if (!is_plus_infinity(r[n_v]) || !is_plus_infinity(r[n_v + 1]))
-      return true;
-  }
-
-  // `var' is not syntactically constrained:
-  // now force an emptiness check.
-  return is_empty();
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::is_strong_coherent() const {
-  // This method is only used by method OK() so as to check if a
-  // strongly closed matrix is also strong-coherent, as it must be.
-  const dimension_type num_rows = matrix.num_rows();
-
-  // Allocated here once and for all.
-  PPL_DIRTY_TEMP(N, semi_sum);
-  // The strong-coherence is: for every indexes i and j (and i != j)
-  // matrix[i][j] <= (matrix[i][ci] + matrix[cj][j])/2
-  // where ci = i + 1, if i is even number or
-  //       ci = i - 1, if i is odd.
-  // Ditto for cj.
-  for (dimension_type i = num_rows; i-- > 0; ) {
-    typename OR_Matrix<N>::const_row_iterator iter = matrix.row_begin() + i;
-    typename OR_Matrix<N>::const_row_reference_type m_i = *iter;
-    using namespace Implementation::Octagonal_Shapes;
-    const N& m_i_ci = m_i[coherent_index(i)];
-    for (dimension_type j = matrix.row_size(i); j-- > 0; )
-      // Note: on the main diagonal only PLUS_INFINITY can occur.
-      if (i != j) {
-        const N& m_cj_j = matrix[coherent_index(j)][j];
-        if (!is_plus_infinity(m_i_ci)
-            && !is_plus_infinity(m_cj_j)) {
-          // Compute (m_i_ci + m_cj_j)/2 into `semi_sum',
-          // rounding the result towards plus infinity.
-          add_assign_r(semi_sum, m_i_ci, m_cj_j, ROUND_UP);
-          div_2exp_assign_r(semi_sum, semi_sum, 1, ROUND_UP);
-          if (m_i[j] > semi_sum)
-            return false;
-        }
-      }
-  }
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::is_strongly_reduced() const {
-  // This method is only used in assertions: efficiency is not a must.
-
-  // An empty octagon is already transitively reduced.
-  if (marked_empty())
-    return true;
-
-  Octagonal_Shape x = *this;
-  // The matrix representing an OS is strongly reduced if, by removing
-  // any constraint, the resulting matrix describes a different OS.
-  for (typename OR_Matrix<N>::const_row_iterator iter = matrix.row_begin(),
-         matrix_row_end = matrix.row_end(); iter != matrix_row_end; ++iter) {
-    typename OR_Matrix<N>::const_row_reference_type m_i = *iter;
-    const dimension_type i = iter.index();
-    for (dimension_type j = iter.row_size(); j-- > 0; ) {
-      if (!is_plus_infinity(m_i[j])) {
-        Octagonal_Shape x_copy = *this;
-        assign_r(x_copy.matrix[i][j], PLUS_INFINITY, ROUND_NOT_NEEDED);
-        if (x == x_copy)
-          return false;
-      }
-    }
-  }
-  // The octagon is just reduced.
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::bounds(const Linear_Expression& expr,
-                           const bool from_above) const {
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((from_above
-                                  ? "bounds_from_above(e)"
-                                  : "bounds_from_below(e)"), "e", expr);
-  strong_closure_assign();
-
-  // A zero-dimensional or empty octagon bounds everything.
-  if (space_dim == 0 || marked_empty())
-    return true;
-
-  // The constraint `c' is used to check if `expr' is an octagonal difference
-  // and, in this case, to select the cell.
-  const Constraint& c = (from_above) ? expr <= 0 : expr >= 0;
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(term);
-  if (Octagonal_Shape_Helper
-    ::extract_octagonal_difference(c, c.space_dimension(), num_vars,
-                                   i, j, coeff, term)) {
-    if (num_vars == 0)
-      return true;
-    // Select the cell to be checked.
-    typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
-    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
-    return !is_plus_infinity(m_i[j]);
-  }
-  else {
-    // `c' is not an octagonal constraint: use the MIP solver.
-    Optimization_Mode mode_bounds =
-      from_above ? MAXIMIZATION : MINIMIZATION;
-    MIP_Problem mip(space_dim, constraints(), expr, mode_bounds);
-    return mip.solve() == OPTIMIZED_MIP_PROBLEM;
-  }
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::max_min(const Linear_Expression& expr,
-                            const bool maximize,
-                            Coefficient& ext_n, Coefficient& ext_d,
-                            bool& included) const {
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((maximize
-                                  ? "maximize(e, ...)"
-                                  : "minimize(e, ...)"), "e", expr);
-  // Deal with zero-dim octagons first.
-  if (space_dim == 0) {
-    if (marked_empty())
-      return false;
-    else {
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      return true;
-    }
-  }
-
-  strong_closure_assign();
-  // For an empty OS we simply return false.
-  if (marked_empty())
-    return false;
-
-  // The constraint `c' is used to check if `expr' is an octagonal difference
-  // and, in this case, to select the cell.
-  const Constraint& c = (maximize) ? expr <= 0 : expr >= 0;
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(term);
-  if (!Octagonal_Shape_Helper
-    ::extract_octagonal_difference(c, c.space_dimension(), num_vars,
-                                   i, j, coeff, term)) {
-    // `c' is not an octagonal constraint: use the MIP solver.
-    Optimization_Mode max_min = (maximize) ? MAXIMIZATION : MINIMIZATION;
-    MIP_Problem mip(space_dim, constraints(), expr, max_min);
-    if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
-      mip.optimal_value(ext_n, ext_d);
-      included = true;
-      return true;
-    }
-    else
-      // Here`expr' is unbounded in `*this'.
-      return false;
-  }
-  else {
-    // `c' is an octagonal constraint.
-    if (num_vars == 0) {
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      return true;
-    }
-
-    // Select the cell to be checked.
-    typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
-    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
-    PPL_DIRTY_TEMP(N, d);
-    if (!is_plus_infinity(m_i[j])) {
-      const Coefficient& b = expr.inhomogeneous_term();
-      PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-      neg_assign(minus_b, b);
-      const Coefficient& sc_b = maximize ? b : minus_b;
-      assign_r(d, sc_b, ROUND_UP);
-      // Set `coeff_expr' to the absolute value of coefficient of a variable
-      // of `expr'.
-      PPL_DIRTY_TEMP(N, coeff_expr);
-      const Coefficient& coeff_i = expr.coefficient(Variable(i/2));
-      const int sign_i = sgn(coeff_i);
-      if (sign_i > 0)
-        assign_r(coeff_expr, coeff_i, ROUND_UP);
-      else {
-        PPL_DIRTY_TEMP_COEFFICIENT(minus_coeff_i);
-        neg_assign(minus_coeff_i, coeff_i);
-        assign_r(coeff_expr, minus_coeff_i, ROUND_UP);
-      }
-      // Approximating the maximum/minimum of `expr'.
-      if (num_vars == 1) {
-        PPL_DIRTY_TEMP(N, m_i_j);
-        div_2exp_assign_r(m_i_j, m_i[j], 1, ROUND_UP);
-        add_mul_assign_r(d, coeff_expr, m_i_j, ROUND_UP);
-      }
-      else
-        add_mul_assign_r(d, coeff_expr, m_i[j], ROUND_UP);
-      numer_denom(d, ext_n, ext_d);
-      if (!maximize)
-        neg_assign(ext_n);
-      included = true;
-      return true;
-    }
-
-    // The `expr' is unbounded.
-    return false;
-  }
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::max_min(const Linear_Expression& expr,
-                            const bool maximize,
-                            Coefficient& ext_n, Coefficient& ext_d,
-                            bool& included, Generator& g) const {
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible((maximize
-                                  ? "maximize(e, ...)"
-                                  : "minimize(e, ...)"), "e", expr);
-  // Deal with zero-dim octagons first.
-  if (space_dim == 0) {
-    if (marked_empty())
-      return false;
-    else {
-      ext_n = expr.inhomogeneous_term();
-      ext_d = 1;
-      included = true;
-      g = point();
-      return true;
-    }
-  }
-
-  strong_closure_assign();
-  // For an empty OS we simply return false.
-  if (marked_empty())
-    return false;
-  if (!is_universe()) {
-    // We use MIP_Problems to handle constraints that are not
-    // octagonal difference.
-    Optimization_Mode max_min = (maximize) ? MAXIMIZATION : MINIMIZATION;
-    MIP_Problem mip(space_dim, constraints(), expr, max_min);
-    if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
-      g = mip.optimizing_point();
-      mip.evaluate_objective_function(g, ext_n, ext_d);
-      included = true;
-      return true;
-    }
-  }
-  // The `expr' is unbounded.
-  return false;
-}
-
-template <typename T>
-Poly_Con_Relation
-Octagonal_Shape<T>::relation_with(const Congruence& cg) const {
-  dimension_type cg_space_dim = cg.space_dimension();
-
-  // Dimension-compatibility check.
-  if (cg_space_dim > space_dim)
-    throw_dimension_incompatible("relation_with(cg)", cg);
-
-  // If the congruence is an equality,
-  // find the relation with the equivalent equality constraint.
-  if (cg.is_equality()) {
-    Constraint c(cg);
-    return relation_with(c);
-  }
-
-  strong_closure_assign();
-
-  if (marked_empty())
-    return Poly_Con_Relation::saturates()
-      && Poly_Con_Relation::is_included()
-      && Poly_Con_Relation::is_disjoint();
-
-  if (space_dim == 0) {
-    if (cg.is_inconsistent())
-      return Poly_Con_Relation::is_disjoint();
-    else
-      return Poly_Con_Relation::saturates()
-        && Poly_Con_Relation::is_included();
-  }
-
-  // Find the lower bound for a hyperplane with direction
-  // defined by the congruence.
-  Linear_Expression le = Linear_Expression(cg);
-  PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
-  bool min_included;
-  bool bounded_below = minimize(le, min_numer, min_denom, min_included);
-
-  // If there is no lower bound, then some of the hyperplanes defined by
-  // the congruence will strictly intersect the shape.
-  if (!bounded_below)
-    return Poly_Con_Relation::strictly_intersects();
-
-  // TODO: Consider adding a max_and_min() method, performing both
-  // maximization and minimization so as to possibly exploit
-  // incrementality of the MIP solver.
-
-  // Find the upper bound for a hyperplane with direction
-  // defined by the congruence.
-  PPL_DIRTY_TEMP_COEFFICIENT(max_numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(max_denom);
-  bool max_included;
-  bool bounded_above = maximize(le, max_numer, max_denom, max_included);
-
-  // If there is no upper bound, then some of the hyperplanes defined by
-  // the congruence will strictly intersect the shape.
-  if (!bounded_above)
-    return Poly_Con_Relation::strictly_intersects();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(signed_distance);
-
-  // Find the position value for the hyperplane that satisfies the congruence
-  // and is above the lower bound for the shape.
-  PPL_DIRTY_TEMP_COEFFICIENT(min_value);
-  min_value = min_numer / min_denom;
-  const Coefficient& modulus = cg.modulus();
-  signed_distance = min_value % modulus;
-  min_value -= signed_distance;
-  if (min_value * min_denom < min_numer)
-    min_value += modulus;
-
-  // Find the position value for the hyperplane that satisfies the congruence
-  // and is below the upper bound for the shape.
-  PPL_DIRTY_TEMP_COEFFICIENT(max_value);
-  max_value = max_numer / max_denom;
-  signed_distance = max_value % modulus;
-  max_value += signed_distance;
-  if (max_value * max_denom > max_numer)
-    max_value -= modulus;
-
-  // If the upper bound value is less than the lower bound value,
-  // then there is an empty intersection with the congruence;
-  // otherwise it will strictly intersect.
-  if (max_value < min_value)
-    return Poly_Con_Relation::is_disjoint();
-  else
-    return Poly_Con_Relation::strictly_intersects();
-}
-
-template <typename T>
-Poly_Con_Relation
-Octagonal_Shape<T>::relation_with(const Constraint& c) const {
-  dimension_type c_space_dim = c.space_dimension();
-
-  // Dimension-compatibility check.
-  if (c_space_dim > space_dim)
-    throw_dimension_incompatible("relation_with(c)", c);
-
-  // The closure needs to make explicit the implicit constraints.
-  strong_closure_assign();
-
-  if (marked_empty())
-    return Poly_Con_Relation::saturates()
-      && Poly_Con_Relation::is_included()
-      && Poly_Con_Relation::is_disjoint();
-
-  if (space_dim == 0) {
-    // Trivially false zero-dimensional constraint.
-    if ((c.is_equality() && c.inhomogeneous_term() != 0)
-        || (c.is_inequality() && c.inhomogeneous_term() < 0))
-      return Poly_Con_Relation::is_disjoint();
-    else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
-      // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
-      // thus, the zero-dimensional point also saturates it.
-      return Poly_Con_Relation::saturates()
-        && Poly_Con_Relation::is_disjoint();
-
-    // Trivially true zero-dimensional constraint.
-    else if (c.is_equality() || c.inhomogeneous_term() == 0)
-      return Poly_Con_Relation::saturates()
-        && Poly_Con_Relation::is_included();
-    else
-      // The zero-dimensional point saturates
-      // neither the positivity constraint 1 >= 0,
-      // nor the strict positivity constraint 1 > 0.
-      return Poly_Con_Relation::is_included();
-  }
-
-  dimension_type num_vars = 0;
-  dimension_type i = 0;
-  dimension_type j = 0;
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(c_term);
-  if (!Octagonal_Shape_Helper
-    ::extract_octagonal_difference(c, c_space_dim, num_vars,
-                                   i, j, coeff, c_term)) {
-    // Constraints that are not octagonal differences.
-    // Use maximize() and minimize() to do much of the work.
-
-    // Find the linear expression for the constraint and use that to
-    // find if the expression is bounded from above or below and if it
-    // is, find the maximum and minimum values.
-    Linear_Expression le;
-    le.set_space_dimension(c.space_dimension());
-    le.linear_combine(c.expr, Coefficient_one(), Coefficient_one(),
-                      1, c_space_dim + 1);
-
-    PPL_DIRTY_TEMP(Coefficient, max_numer);
-    PPL_DIRTY_TEMP(Coefficient, max_denom);
-    bool max_included;
-    PPL_DIRTY_TEMP(Coefficient, min_numer);
-    PPL_DIRTY_TEMP(Coefficient, min_denom);
-    bool min_included;
-    bool bounded_above = maximize(le, max_numer, max_denom, max_included);
-    bool bounded_below = minimize(le, min_numer, min_denom, min_included);
-    if (!bounded_above) {
-      if (!bounded_below)
-        return Poly_Con_Relation::strictly_intersects();
-      min_numer += c.inhomogeneous_term() * min_denom;
-      switch (sgn(min_numer)) {
-      case 1:
-        if (c.is_equality())
-          return Poly_Con_Relation::is_disjoint();
-        return Poly_Con_Relation::is_included();
-      case 0:
-        if (c.is_strict_inequality() || c.is_equality())
-          return Poly_Con_Relation::strictly_intersects();
-        return Poly_Con_Relation::is_included();
-      case -1:
-        return Poly_Con_Relation::strictly_intersects();
-      }
-    }
-    if (!bounded_below) {
-      max_numer += c.inhomogeneous_term() * max_denom;
-      switch (sgn(max_numer)) {
-      case 1:
-        return Poly_Con_Relation::strictly_intersects();
-      case 0:
-        if (c.is_strict_inequality())
-          return Poly_Con_Relation::is_disjoint();
-        return Poly_Con_Relation::strictly_intersects();
-      case -1:
-        return Poly_Con_Relation::is_disjoint();
-      }
-    }
-    else {
-      max_numer += c.inhomogeneous_term() * max_denom;
-      min_numer += c.inhomogeneous_term() * min_denom;
-      switch (sgn(max_numer)) {
-      case 1:
-        switch (sgn(min_numer)) {
-        case 1:
-          if (c.is_equality())
-            return Poly_Con_Relation::is_disjoint();
-          return Poly_Con_Relation::is_included();
-        case 0:
-          if (c.is_equality())
-            return Poly_Con_Relation::strictly_intersects();
-          if (c.is_strict_inequality())
-            return Poly_Con_Relation::strictly_intersects();
-          return Poly_Con_Relation::is_included();
-        case -1:
-          return Poly_Con_Relation::strictly_intersects();
-        }
-        PPL_UNREACHABLE;
-        break;
-      case 0:
-        if (min_numer == 0) {
-          if (c.is_strict_inequality())
-            return Poly_Con_Relation::is_disjoint()
-              && Poly_Con_Relation::saturates();
-          return Poly_Con_Relation::is_included()
-            && Poly_Con_Relation::saturates();
-        }
-        if (c.is_strict_inequality())
-          return Poly_Con_Relation::is_disjoint();
-        return Poly_Con_Relation::strictly_intersects();
-      case -1:
-        return Poly_Con_Relation::is_disjoint();
-      }
-    }
-  }
-
-  if (num_vars == 0) {
-    // Dealing with a trivial constraint.
-    switch (sgn(c.inhomogeneous_term())) {
-    case -1:
-      return Poly_Con_Relation::is_disjoint();
-    case 0:
-      if (c.is_strict_inequality())
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_disjoint();
-      else
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_included();
-    case 1:
-      if (c.is_equality())
-        return Poly_Con_Relation::is_disjoint();
-      else
-        return Poly_Con_Relation::is_included();
-    }
-  }
-
-  // Select the cell to be checked for the "<=" part of constraint.
-  typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
-  typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
-  const N& m_i_j = m_i[j];
-  // Set `coeff' to the absolute value of itself.
-  if (coeff < 0)
-    neg_assign(coeff);
-
-  // Select the cell to be checked for the ">=" part of constraint.
-  // Select the right row of the cell.
-  if (i % 2 == 0)
-    ++i_iter;
-  else
-    --i_iter;
-  typename OR_Matrix<N>::const_row_reference_type m_ci = *i_iter;
-  using namespace Implementation::Octagonal_Shapes;
-  const N& m_ci_cj = m_ci[coherent_index(j)];
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  // The following variables of mpq_class type are used to be precise
-  // when the octagon is defined by integer constraints.
-  PPL_DIRTY_TEMP(mpq_class, q_x);
-  PPL_DIRTY_TEMP(mpq_class, q_y);
-  PPL_DIRTY_TEMP(mpq_class, d);
-  PPL_DIRTY_TEMP(mpq_class, d1);
-  PPL_DIRTY_TEMP(mpq_class, c_denom);
-  PPL_DIRTY_TEMP(mpq_class, q_denom);
-  assign_r(c_denom, coeff, ROUND_NOT_NEEDED);
-  assign_r(d, c_term, ROUND_NOT_NEEDED);
-  neg_assign_r(d1, d, ROUND_NOT_NEEDED);
-  div_assign_r(d, d, c_denom, ROUND_NOT_NEEDED);
-  div_assign_r(d1, d1, c_denom, ROUND_NOT_NEEDED);
-
-  if (is_plus_infinity(m_i_j)) {
-    if (!is_plus_infinity(m_ci_cj)) {
-      // `*this' is in the following form:
-      // `-m_ci_cj <= v - u'.
-      // In this case `*this' is disjoint from `c' if
-      // `-m_ci_cj > d' (`-m_ci_cj >= d' if c is a strict inequality),
-      // i.e., if `m_ci_cj < d1' (`m_ci_cj <= d1'
-      // if c is a strict inequality).
-      numer_denom(m_ci_cj, numer, denom);
-      assign_r(q_denom, denom, ROUND_NOT_NEEDED);
-      assign_r(q_y, numer, ROUND_NOT_NEEDED);
-      div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
-      if (q_y < d1)
-        return Poly_Con_Relation::is_disjoint();
-      if (q_y == d1 && c.is_strict_inequality())
-        return Poly_Con_Relation::is_disjoint();
-    }
-
-    // In all other cases `*this' intersects `c'.
-    return Poly_Con_Relation::strictly_intersects();
-  }
-
-  // Here `m_i_j' is not plus-infinity.
-  numer_denom(m_i_j, numer, denom);
-  assign_r(q_denom, denom, ROUND_NOT_NEEDED);
-  assign_r(q_x, numer, ROUND_NOT_NEEDED);
-  div_assign_r(q_x, q_x, q_denom, ROUND_NOT_NEEDED);
-
-  if (!is_plus_infinity(m_ci_cj)) {
-    numer_denom(m_ci_cj, numer, denom);
-    assign_r(q_denom, denom, ROUND_NOT_NEEDED);
-    assign_r(q_y, numer, ROUND_NOT_NEEDED);
-    div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
-    if (q_x == d && q_y == d1) {
-      if (c.is_strict_inequality())
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_disjoint();
-      else
-        return Poly_Con_Relation::saturates()
-          && Poly_Con_Relation::is_included();
-    }
-    // `*this' is disjoint from `c' when
-    // `m_ci_cj < d1' (`m_ci_cj <= d1' if `c' is a strict inequality).
-    if (q_y < d1)
-      return Poly_Con_Relation::is_disjoint();
-    if (q_y == d1 && c.is_strict_inequality())
-      return Poly_Con_Relation::is_disjoint();
-  }
-
-  // Here `m_ci_cj' can be also plus-infinity.
-  // If `c' is an equality, `*this' is disjoint from `c' if
-  // `m_i_j < d'.
-  if (d > q_x) {
-    if (c.is_equality())
-      return Poly_Con_Relation::is_disjoint();
-    else
-      return Poly_Con_Relation::is_included();
-  }
-
-  if (d == q_x && c.is_nonstrict_inequality())
-    return Poly_Con_Relation::is_included();
-
-  // In all other cases `*this' intersects `c'.
-  return Poly_Con_Relation::strictly_intersects();
-}
-
-template <typename T>
-Poly_Gen_Relation
-Octagonal_Shape<T>::relation_with(const Generator& g) const {
-  const dimension_type g_space_dim = g.space_dimension();
-
-  // Dimension-compatibility check.
-  if (space_dim < g_space_dim)
-    throw_dimension_incompatible("relation_with(g)", g);
-
-  // The closure needs to make explicit the implicit constraints and if the
-  // octagon is empty.
-  strong_closure_assign();
-
-  // The empty octagon cannot subsume a generator.
-  if (marked_empty())
-    return Poly_Gen_Relation::nothing();
-
-  // A universe octagon in a zero-dimensional space subsumes
-  // all the generators of a zero-dimensional space.
-  if (space_dim == 0)
-    return Poly_Gen_Relation::subsumes();
-
-  const bool is_line = g.is_line();
-  const bool is_line_or_ray = g.is_line_or_ray();
-
-  // The relation between the octagon and the given generator is obtained
-  // checking if the generator satisfies all the constraints in the octagon.
-  // To check if the generator satisfies all the constraints it's enough
-  // studying the sign of the scalar product between the generator and
-  // all the constraints in the octagon.
-
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(denom);
-  PPL_DIRTY_TEMP_COEFFICIENT(product);
-
-  // We find in `*this' all the constraints.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
-    dimension_type i = i_iter.index();
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ii = *(i_iter + 1);
-    const N& m_i_ii = m_i[i + 1];
-    const N& m_ii_i = m_ii[i];
-    // We have the unary constraints.
-    const Variable x(i/2);
-    const Coefficient& g_coeff_x
-      = (x.space_dimension() > g_space_dim)
-      ? Coefficient_zero()
-      : g.coefficient(x);
-    if (is_additive_inverse(m_i_ii, m_ii_i)) {
-      // The constraint has form ax = b.
-      // To satisfy the constraint it is necessary that the scalar product
-      // is not zero. The scalar product has the form
-      // 'denom * g_coeff_x - numer * g.divisor()'.
-      numer_denom(m_ii_i, numer, denom);
-      denom *= 2;
-      product = denom * g_coeff_x;
-      // Note that if the generator `g' is a line or a ray,
-      // its divisor is zero.
-      if (!is_line_or_ray) {
-        neg_assign(numer);
-        add_mul_assign(product, numer, g.divisor());
-      }
-      if (product != 0)
-        return Poly_Gen_Relation::nothing();
-    }
-    // We have 0, 1 or 2 inequality constraints.
-    else {
-      if (!is_plus_infinity(m_i_ii)) {
-        // The constraint has form -ax <= b.
-        // If the generator is a line it's necessary to check if
-        // the scalar product is not zero, if it is positive otherwise.
-        numer_denom(m_i_ii, numer, denom);
-        denom *= -2;
-        product = denom * g_coeff_x;
-        // Note that if the generator `g' is a line or a ray,
-        // its divisor is zero.
-        if (!is_line_or_ray) {
-          neg_assign(numer);
-          add_mul_assign(product, numer, g.divisor());
-        }
-        if (is_line && product != 0)
-          return Poly_Gen_Relation::nothing();
-        else
-          // If the generator is not a line it's necessary to check
-          // that the scalar product sign is not positive and the scalar
-          // product has the form
-          // '-denom * g.coeff_x - numer * g.divisor()'.
-          if (product > 0)
-            return Poly_Gen_Relation::nothing();
-      }
-      if (!is_plus_infinity(m_ii_i)) {
-        // The constraint has form ax <= b.
-        numer_denom(m_ii_i, numer, denom);
-        denom *= 2;
-        product = denom * g_coeff_x;
-         // Note that if the generator `g' is a line or a ray,
-        // its divisor is zero.
-        if (!is_line_or_ray) {
-          neg_assign(numer);
-          add_mul_assign(product, numer , g.divisor());
-        }
-        if (is_line && product != 0)
-          return Poly_Gen_Relation::nothing();
-        else
-          // If the generator is not a line it's necessary to check
-          // that the scalar product sign is not positive and the scalar
-          // product has the form
-          // 'denom * g_coeff_x - numer * g.divisor()'.
-          if (product > 0)
-            return Poly_Gen_Relation::nothing();
-      }
-    }
-  }
-
-  // We have the binary constraints.
-  for (Row_Iterator i_iter = m_begin ; i_iter != m_end; i_iter += 2) {
-    dimension_type i = i_iter.index();
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ii = *(i_iter + 1);
-    for (dimension_type j = 0; j < i; j += 2) {
-      const N& m_i_j = m_i[j];
-      const N& m_ii_jj = m_ii[j + 1];
-      const N& m_ii_j = m_ii[j];
-      const N& m_i_jj = m_i[j + 1];
-      const Variable x(j/2);
-      const Variable y(i/2);
-      const Coefficient& g_coeff_x
-        = (x.space_dimension() > g_space_dim)
-        ? Coefficient_zero()
-        : g.coefficient(x);
-      const Coefficient& g_coeff_y
-        = (y.space_dimension() > g_space_dim)
-        ? Coefficient_zero()
-        : g.coefficient(y);
-
-      const bool difference_is_equality = is_additive_inverse(m_ii_jj, m_i_j);
-      if (difference_is_equality) {
-        // The constraint has form a*x - a*y = b.
-        // The scalar product has the form
-        // 'denom * coeff_x - denom * coeff_y - numer * g.divisor()'.
-        // To satisfy the constraint it's necessary that the scalar product
-        // is not zero.
-        numer_denom(m_i_j, numer, denom);
-        product = denom * g_coeff_x;
-        neg_assign(denom);
-        add_mul_assign(product, denom, g_coeff_y);
-        // Note that if the generator `g' is a line or a ray,
-        // its divisor is zero.
-        if (!is_line_or_ray) {
-          neg_assign(numer);
-          add_mul_assign(product, numer, g.divisor());
-        }
-        if (product != 0)
-          return Poly_Gen_Relation::nothing();
-      }
-      else {
-        if (!is_plus_infinity(m_i_j)) {
-          // The constraint has form a*x - a*y <= b.
-          // The scalar product has the form
-          // 'denom * coeff_x - denom * coeff_y - numer * g.divisor()'.
-          // If the generator is not a line it's necessary to check
-          // that the scalar product sign is not positive.
-          numer_denom(m_i_j, numer, denom);
-          product = denom * g_coeff_x;
-          neg_assign(denom);
-          add_mul_assign(product, denom, g_coeff_y);
-          // Note that if the generator `g' is a line or a ray,
-          // its divisor is zero.
-          if (!is_line_or_ray) {
-            neg_assign(numer);
-            add_mul_assign(product, numer, g.divisor());
-          }
-          if (is_line && product != 0)
-            return Poly_Gen_Relation::nothing();
-          else if (product > 0)
-            return Poly_Gen_Relation::nothing();
-        }
-        if (!is_plus_infinity(m_ii_jj)) {
-          // The constraint has form -a*x + a*y <= b.
-          // The scalar product has the form
-          // '-denom * coeff_x + denom * coeff_y - numer * g.divisor()'.
-          // If the generator is not a line it's necessary to check
-          // that the scalar product sign is not positive.
-          numer_denom(m_ii_jj, numer, denom);
-          product = denom * g_coeff_y;
-          neg_assign(denom);
-          add_mul_assign(product, denom, g_coeff_x);
-          // Note that if the generator `g' is a line or a ray,
-          // its divisor is zero.
-          if (!is_line_or_ray) {
-            neg_assign(numer);
-            add_mul_assign(product, numer, g.divisor());
-          }
-          if (is_line && product != 0)
-            return Poly_Gen_Relation::nothing();
-          else if (product > 0)
-            return Poly_Gen_Relation::nothing();
-        }
-      }
-
-      const bool sum_is_equality = is_additive_inverse(m_i_jj, m_ii_j);
-      if (sum_is_equality) {
-        // The constraint has form a*x + a*y = b.
-        // The scalar product has the form
-        // 'denom * coeff_x + denom * coeff_y - numer * g.divisor()'.
-        // To satisfy the constraint it's necessary that the scalar product
-        // is not zero.
-        numer_denom(m_ii_j, numer, denom);
-        product = denom * g_coeff_x;
-        add_mul_assign(product, denom, g_coeff_y);
-        // Note that if the generator `g' is a line or a ray,
-        // its divisor is zero.
-        if (!is_line_or_ray) {
-          neg_assign(numer);
-          add_mul_assign(product, numer, g.divisor());
-        }
-        if (product != 0)
-          return Poly_Gen_Relation::nothing();
-      }
-      else {
-        if (!is_plus_infinity(m_i_jj)) {
-          // The constraint has form -a*x - a*y <= b.
-          // The scalar product has the form
-          // '-denom * coeff_x - denom * coeff_y - numer * g.divisor()'.
-          // If the generator is not a line it's necessary to check
-          // that the scalar product sign is not positive.
-          numer_denom(m_i_jj, numer, denom);
-          neg_assign(denom);
-          product = denom * g_coeff_x;
-          add_mul_assign(product, denom, g_coeff_y);
-          // Note that if the generator `g' is a line or a ray,
-          // its divisor is zero.
-          if (!is_line_or_ray) {
-            neg_assign(numer);
-            add_mul_assign(product, numer, g.divisor());
-          }
-          if (is_line && product != 0)
-            return Poly_Gen_Relation::nothing();
-          else if (product > 0)
-            return Poly_Gen_Relation::nothing();
-        }
-        if (!is_plus_infinity(m_ii_j)) {
-          // The constraint has form a*x + a*y <= b.
-          // The scalar product has the form
-          // 'denom * coeff_x + denom * coeff_y - numer * g.divisor()'.
-          // If the generator is not a line it's necessary to check
-          // that the scalar product sign is not positive.
-          numer_denom(m_ii_j, numer, denom);
-          product = denom * g_coeff_x;
-          add_mul_assign(product, denom, g_coeff_y);
-          // Note that if the generator `g' is a line or a ray,
-          // its divisor is zero.
-          if (!is_line_or_ray) {
-            neg_assign(numer);
-            add_mul_assign(product, numer, g.divisor());
-          }
-          if (is_line && product != 0)
-            return Poly_Gen_Relation::nothing();
-          else if (product > 0)
-            return Poly_Gen_Relation::nothing();
-        }
-      }
-    }
-  }
-  // If this point is reached the constraint 'g' satisfies
-  // all the constraints in the octagon.
-  return Poly_Gen_Relation::subsumes();
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::strong_closure_assign() const {
-  // Do something only if necessary (zero-dim implies strong closure).
-  if (marked_empty() || marked_strongly_closed() || space_dim == 0)
-    return;
-
-  // Even though the octagon will not change, its internal representation
-  // is going to be modified by the closure algorithm.
-  Octagonal_Shape& x = const_cast<Octagonal_Shape<T>&>(*this);
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-
-  const dimension_type n_rows = x.matrix.num_rows();
-  const Row_Iterator m_begin = x.matrix.row_begin();
-  const Row_Iterator m_end = x.matrix.row_end();
-
-  // Fill the main diagonal with zeros.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
-    PPL_ASSERT(is_plus_infinity((*i)[i.index()]));
-    assign_r((*i)[i.index()], 0, ROUND_NOT_NEEDED);
-  }
-
-  // This algorithm is given by two steps: the first one is a simple
-  // adaptation of the `shortest-path closure' using the Floyd-Warshall
-  // algorithm; the second one is the `strong-coherence' algorithm.
-  // It is important to note that after the strong-coherence,
-  // the octagon is still shortest-path closed and hence, strongly closed.
-
-  // Recall that, given an index `h', we indicate with `ch' the coherent
-  // index, i.e., the index such that:
-  //   ch = h + 1, if h is an even number;
-  //   ch = h - 1, if h is an odd number.
-
-  typename OR_Matrix<N>::element_iterator iter_ij;
-  std::vector<N> vec_k(n_rows);
-  std::vector<N> vec_ck(n_rows);
-  PPL_DIRTY_TEMP(N, sum1);
-  PPL_DIRTY_TEMP(N, sum2);
-  Row_Reference x_k;
-  Row_Reference x_ck;
-  Row_Reference x_i;
-  Row_Reference x_ci;
-
-  // Since the index `j' of the inner loop will go from 0 up to `i',
-  // the three nested loops have to be executed twice.
-  for (int twice = 0; twice < 2; ++twice) {
-
-    Row_Iterator x_k_iter = m_begin;
-    Row_Iterator x_i_iter = m_begin;
-    for (dimension_type k = 0; k < n_rows; k += 2) {
-      const dimension_type ck = k + 1;
-      // Re-initialize the element iterator.
-      iter_ij = x.matrix.element_begin();
-      // Compute the row references `x_k' and `x_ck'.
-      x_k  = *x_k_iter;
-      ++x_k_iter;
-      x_ck = *x_k_iter;
-      ++x_k_iter;
-
-      for (dimension_type i = 0; i <= k; i += 2) {
-        const dimension_type ci = i + 1;
-        // Storing x_k_i == x_ci_ck.
-        vec_k[i] = x_k[i];
-        // Storing x_k_ci == x_i_ck.
-        vec_k[ci] = x_k[ci];
-        // Storing x_ck_i == x_ci_k.
-        vec_ck[i] = x_ck[i];
-        // Storing x_ck_ci == x_i_k.
-        vec_ck[ci] = x_ck[ci];
-      }
-      x_i_iter = x_k_iter;
-      for (dimension_type i = k + 2; i < n_rows; i += 2) {
-        const dimension_type ci = i + 1;
-        x_i = *x_i_iter;
-        ++x_i_iter;
-        x_ci = *x_i_iter;
-        ++x_i_iter;
-        // Storing x_k_i == x_ci_ck.
-        vec_k[i] = x_ci[ck];
-        // Storing x_k_ci == x_i_ck.
-        vec_k[ci] = x_i[ck];
-        // Storing x_ck_i == x_ci_k.
-        vec_ck[i] = x_ci[k];
-        // Storing x_ck_ci == x_i_k.
-        vec_ck[ci] = x_i[k];
-      }
-
-      for (dimension_type i = 0; i < n_rows; ++i) {
-        using namespace Implementation::Octagonal_Shapes;
-        const dimension_type ci = coherent_index(i);
-        const N& vec_k_ci = vec_k[ci];
-        const N& vec_ck_ci = vec_ck[ci];
-        // Unfolding two iterations on `j': this ensures that
-        // the loop exit condition `j <= i' is OK.
-        for (dimension_type j = 0; j <= i; ) {
-          // First iteration: compute
-          //
-          // <CODE>
-          //   sum1 = x_i_k + x_k_j == x_ck_ci + x_k_j;
-          //   sum2 = x_i_ck + x_ck_j == x_k_ci + x_ck_j;
-          // </CODE>
-          add_assign_r(sum1, vec_ck_ci, vec_k[j], ROUND_UP);
-          add_assign_r(sum2, vec_k_ci, vec_ck[j], ROUND_UP);
-          min_assign(sum1, sum2);
-          min_assign(*iter_ij, sum1);
-          // Exiting the first iteration: loop index control.
-          ++j;
-          ++iter_ij;
-          // Second iteration: ditto.
-          add_assign_r(sum1, vec_ck_ci, vec_k[j], ROUND_UP);
-          add_assign_r(sum2, vec_k_ci, vec_ck[j], ROUND_UP);
-          min_assign(sum1, sum2);
-          min_assign(*iter_ij, sum1);
-          // Exiting the second iteration: loop index control.
-          ++j;
-          ++iter_ij;
-        }
-      }
-    }
-  }
-
-  // Check for emptiness: the octagon is empty if and only if there is a
-  // negative value in the main diagonal.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
-    N& x_i_i = (*i)[i.index()];
-    if (sgn(x_i_i) < 0) {
-      x.set_empty();
-      return;
-    }
-    else {
-      PPL_ASSERT(sgn(x_i_i) == 0);
-      // Restore PLUS_INFINITY on the main diagonal.
-      assign_r(x_i_i, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-
-  // Step 2: we enforce the strong coherence.
-  x.strong_coherence_assign();
-  // The octagon is not empty and it is now strongly closed.
-  x.set_strongly_closed();
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::strong_coherence_assign() {
-  // The strong-coherence is: for every indexes i and j
-  // m_i_j <= (m_i_ci + m_cj_j)/2
-  // where ci = i + 1, if i is even number or
-  //       ci = i - 1, if i is odd.
-  // Ditto for cj.
-  PPL_DIRTY_TEMP(N, semi_sum);
-  for (typename OR_Matrix<N>::row_iterator i_iter = matrix.row_begin(),
-         i_end = matrix.row_end(); i_iter != i_end; ++i_iter) {
-    typename OR_Matrix<N>::row_reference_type x_i = *i_iter;
-    const dimension_type i = i_iter.index();
-    using namespace Implementation::Octagonal_Shapes;
-    const N& x_i_ci = x_i[coherent_index(i)];
-    // Avoid to do unnecessary sums.
-    if (!is_plus_infinity(x_i_ci))
-      for (dimension_type j = 0, rs_i = i_iter.row_size(); j < rs_i; ++j)
-        if (i != j) {
-          const N& x_cj_j = matrix[coherent_index(j)][j];
-          if (!is_plus_infinity(x_cj_j)) {
-            add_assign_r(semi_sum, x_i_ci, x_cj_j, ROUND_UP);
-            div_2exp_assign_r(semi_sum, semi_sum, 1, ROUND_UP);
-            min_assign(x_i[j], semi_sum);
-          }
-        }
-  }
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::tight_coherence_would_make_empty() const {
-  PPL_ASSERT(std::numeric_limits<N>::is_integer);
-  PPL_ASSERT(marked_strongly_closed());
-  const dimension_type space_dim = space_dimension();
-  for (dimension_type i = 0; i < 2*space_dim; i += 2) {
-    const dimension_type ci = i + 1;
-    const N& mat_i_ci = matrix[i][ci];
-    if (!is_plus_infinity(mat_i_ci)
-        // Check for oddness of `mat_i_ci'.
-        && !is_even(mat_i_ci)
-        // Check for zero-equivalence of `i' and `ci'.
-        && is_additive_inverse(mat_i_ci, matrix[ci][i]))
-      return true;
-  }
-  return false;
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::tight_closure_assign() {
-  PPL_COMPILE_TIME_CHECK(std::numeric_limits<T>::is_integer,
-                         "Octagonal_Shape<T>::tight_closure_assign():"
-                         " T in not an integer datatype.");
-  // FIXME: this is just an executable specification.
-  // (The following call could be replaced by shortest-path closure.)
-  strong_closure_assign();
-  if (marked_empty())
-    return;
-  if (tight_coherence_would_make_empty())
-    set_empty();
-  else {
-    // Tighten the unary constraints.
-    PPL_DIRTY_TEMP(N, temp_one);
-    assign_r(temp_one, 1, ROUND_NOT_NEEDED);
-    const dimension_type space_dim = space_dimension();
-    for (dimension_type i = 0; i < 2*space_dim; i += 2) {
-      const dimension_type ci = i + 1;
-      N& mat_i_ci = matrix[i][ci];
-      if (!is_plus_infinity(mat_i_ci) && !is_even(mat_i_ci))
-        sub_assign_r(mat_i_ci, mat_i_ci, temp_one, ROUND_UP);
-      N& mat_ci_i = matrix[ci][i];
-      if (!is_plus_infinity(mat_ci_i) && !is_even(mat_ci_i))
-        sub_assign_r(mat_ci_i, mat_ci_i, temp_one, ROUND_UP);
-    }
-    // Propagate tightened unary constraints.
-    strong_coherence_assign();
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::incremental_strong_closure_assign(const Variable var) const {
-  // `var' should be one of the dimensions of the octagon.
-  if (var.id() >= space_dim)
-    throw_dimension_incompatible("incremental_strong_closure_assign(v)",
-                                 var.id());
-
-  // Do something only if necessary.
-  if (marked_empty() || marked_strongly_closed())
-    return;
-
-  Octagonal_Shape& x = const_cast<Octagonal_Shape<T>&>(*this);
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-
-  const Row_Iterator m_begin = x.matrix.row_begin();
-  const Row_Iterator m_end = x.matrix.row_end();
-
-  // Fill the main diagonal with zeros.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
-    PPL_ASSERT(is_plus_infinity((*i)[i.index()]));
-    assign_r((*i)[i.index()], 0, ROUND_NOT_NEEDED);
-  }
-
-  // Using the incremental Floyd-Warshall algorithm.
-  // Step 1: Improve all constraints on variable `var'.
-  const dimension_type v = 2*var.id();
-  const dimension_type cv = v + 1;
-  Row_Iterator v_iter = m_begin + v;
-  Row_Iterator cv_iter = v_iter + 1;
-  Row_Reference x_v = *v_iter;
-  Row_Reference x_cv = *cv_iter;
-  const dimension_type rs_v = v_iter.row_size();
-  const dimension_type n_rows = x.matrix.num_rows();
-  PPL_DIRTY_TEMP(N, sum);
-  using namespace Implementation::Octagonal_Shapes;
-  for (Row_Iterator k_iter = m_begin; k_iter != m_end; ++k_iter) {
-    const dimension_type k = k_iter.index();
-    const dimension_type ck = coherent_index(k);
-    const dimension_type rs_k = k_iter.row_size();
-    Row_Reference x_k = *k_iter;
-    Row_Reference x_ck = (k % 2 != 0) ? *(k_iter-1) : *(k_iter + 1);
-
-    for (Row_Iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
-      const dimension_type i = i_iter.index();
-      const dimension_type ci = coherent_index(i);
-      const dimension_type rs_i = i_iter.row_size();
-      Row_Reference x_i = *i_iter;
-      Row_Reference x_ci = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
-
-      const N& x_i_k = (k < rs_i) ? x_i[k] : x_ck[ci];
-      if (!is_plus_infinity(x_i_k)) {
-        const N& x_k_v = (v < rs_k) ? x_k[v] : x_cv[ck];
-        if (!is_plus_infinity(x_k_v)) {
-          add_assign_r(sum, x_i_k, x_k_v, ROUND_UP);
-          N& x_i_v = (v < rs_i) ? x_i[v] : x_cv[ci];
-          min_assign(x_i_v, sum);
-        }
-        const N& x_k_cv = (cv < rs_k) ? x_k[cv] : x_v[ck];
-        if (!is_plus_infinity(x_k_cv)) {
-          add_assign_r(sum, x_i_k, x_k_cv, ROUND_UP);
-          N& x_i_cv = (cv < rs_i) ? x_i[cv] : x_v[ci];
-          min_assign(x_i_cv, sum);
-        }
-      }
-      const N& x_k_i = (i < rs_k) ? x_k[i] : x_ci[ck];
-      if (!is_plus_infinity(x_k_i)) {
-        const N& x_v_k = (k < rs_v) ? x_v[k] : x_ck[cv];
-        if (!is_plus_infinity(x_v_k)) {
-          N& x_v_i = (i < rs_v) ? x_v[i] : x_ci[cv];
-          add_assign_r(sum, x_v_k, x_k_i, ROUND_UP);
-          min_assign(x_v_i, sum);
-        }
-        const N& x_cv_k = (k < rs_v) ? x_cv[k] : x_ck[v];
-        if (!is_plus_infinity(x_cv_k)) {
-          N& x_cv_i = (i < rs_v) ? x_cv[i] : x_ci[v];
-          add_assign_r(sum, x_cv_k, x_k_i, ROUND_UP);
-          min_assign(x_cv_i, sum);
-        }
-      }
-
-    }
-  }
-
-  // Step 2: improve the other bounds by using the precise bounds
-  // for the constraints on `var'.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
-    const dimension_type i = i_iter.index();
-    const dimension_type ci = coherent_index(i);
-    const dimension_type rs_i = i_iter.row_size();
-    Row_Reference x_i = *i_iter;
-    const N& x_i_v = (v < rs_i) ? x_i[v] : x_cv[ci];
-    // TODO: see if it is possible to optimize this inner loop
-    // by splitting it into several parts, so as to avoid
-    // conditional expressions.
-    for (dimension_type j = 0; j < n_rows; ++j) {
-      const dimension_type cj = coherent_index(j);
-      Row_Reference x_cj = *(m_begin + cj);
-      N& x_i_j = (j < rs_i) ? x_i[j] : x_cj[ci];
-      if (!is_plus_infinity(x_i_v)) {
-        const N& x_v_j = (j < rs_v) ? x_v[j] : x_cj[cv];
-        if (!is_plus_infinity(x_v_j)) {
-          add_assign_r(sum, x_i_v, x_v_j, ROUND_UP);
-          min_assign(x_i_j, sum);
-        }
-      }
-      const N& x_i_cv = (cv < rs_i) ? x_i[cv] : x_v[ci];
-      if (!is_plus_infinity(x_i_cv)) {
-        const N& x_cv_j = (j < rs_v) ? x_cv[j] : x_cj[v];
-        if (!is_plus_infinity(x_cv_j)) {
-          add_assign_r(sum, x_i_cv, x_cv_j, ROUND_UP);
-          min_assign(x_i_j, sum);
-        }
-      }
-    }
-  }
-
-  // Check for emptiness: the octagon is empty if and only if there is a
-  // negative value on the main diagonal.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
-    N& x_i_i = (*i)[i.index()];
-    if (sgn(x_i_i) < 0) {
-      x.set_empty();
-      return;
-    }
-    else {
-      // Restore PLUS_INFINITY on the main diagonal.
-      PPL_ASSERT(sgn(x_i_i) == 0);
-      assign_r(x_i_i, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-
-  // Step 3: we enforce the strong coherence.
-  x.strong_coherence_assign();
-  // The octagon is not empty and it is now strongly closed.
-  x.set_strongly_closed();
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::compute_successors(std::vector<dimension_type>& successor) const {
-  PPL_ASSERT(!marked_empty() && marked_strongly_closed());
-  PPL_ASSERT(successor.size() == 0);
-  // Variables are ordered according to their index.
-  // The vector `successor' is used to indicate which variable
-  // immediately follows a given one in the corresponding equivalence class.
-  const dimension_type successor_size = matrix.num_rows();
-  // Initially, each variable is successor of its own zero-equivalence class.
-  successor.reserve(successor_size);
-  for (dimension_type i = 0; i < successor_size; ++i)
-    successor.push_back(i);
-  // Now compute actual successors.
-  for (dimension_type i = successor_size; i-- > 0; )  {
-    typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
-    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
-    typename OR_Matrix<N>::const_row_reference_type m_ci
-      = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
-    for (dimension_type j = 0; j < i; ++j) {
-      // FIXME: what is the following, commented-out for?
-    //for (dimension_type j = i; j-- > 0; ) {
-      using namespace Implementation::Octagonal_Shapes;
-      dimension_type cj = coherent_index(j);
-      if (is_additive_inverse(m_ci[cj], m_i[j]))
-        // Choose as successor the variable having the greatest index.
-        successor[j] = i;
-    }
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::compute_leaders(std::vector<dimension_type>& leaders) const {
-  PPL_ASSERT(!marked_empty() && marked_strongly_closed());
-  PPL_ASSERT(leaders.size() == 0);
-  // Variables are ordered according to their index.
-  // The vector `leaders' is used to indicate the smallest variable
-  // that belongs to the corresponding equivalence class.
-  const dimension_type leader_size = matrix.num_rows();
-  // Initially, each variable is leader of its own zero-equivalence class.
-  leaders.reserve(leader_size);
-  for (dimension_type i = 0; i < leader_size; ++i)
-    leaders.push_back(i);
-  // Now compute actual leaders.
-  for (typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin(),
-         matrix_row_end = matrix.row_end();
-       i_iter != matrix_row_end; ++i_iter) {
-    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
-    dimension_type i = i_iter.index();
-    typename OR_Matrix<N>::const_row_reference_type m_ci
-      = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
-    for (dimension_type j = 0; j < i; ++j) {
-      using namespace Implementation::Octagonal_Shapes;
-      dimension_type cj = coherent_index(j);
-      if (is_additive_inverse(m_ci[cj], m_i[j]))
-        // Choose as leader the variable having the smaller index.
-        leaders[i] = leaders[j];
-    }
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::compute_leaders(std::vector<dimension_type>& successor,
-                  std::vector<dimension_type>& no_sing_leaders,
-                  bool& exist_sing_class,
-                  dimension_type& sing_leader) const {
-  PPL_ASSERT(!marked_empty() && marked_strongly_closed());
-  PPL_ASSERT(no_sing_leaders.size() == 0);
-  dimension_type successor_size = successor.size();
-  std::deque<bool> dealt_with(successor_size, false);
-  for (dimension_type i = 0; i < successor_size; ++i) {
-    dimension_type next_i = successor[i];
-    if (!dealt_with[i]) {
-      // The index is a leader.
-      // Now check if it is a leader of a singular class or not.
-      using namespace Implementation::Octagonal_Shapes;
-      if (next_i == coherent_index(i)) {
-        exist_sing_class = true;
-        sing_leader = i;
-      }
-      else
-        no_sing_leaders.push_back(i);
-    }
-    // The following index is not a leader.
-    dealt_with[next_i] = true;
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::strong_reduction_assign() const {
-  // Zero-dimensional octagonal shapes are necessarily reduced.
-  if (space_dim == 0)
-    return;
-  strong_closure_assign();
-  // If `*this' is empty, then there is nothing to reduce.
-  if (marked_empty())
-    return;
-
-  // Detect non-redundant constraints.
-  std::vector<Bit_Row> non_red;
-  non_redundant_matrix_entries(non_red);
-
-  // Throw away redundant constraints.
-  Octagonal_Shape<T>& x = const_cast<Octagonal_Shape<T>&>(*this);
-#ifndef NDEBUG
-  const Octagonal_Shape x_copy_before(x);
-#endif
-  typename OR_Matrix<N>::element_iterator x_i = x.matrix.element_begin();
-  for (dimension_type i = 0; i < 2 * space_dim; ++i) {
-    const Bit_Row& non_red_i = non_red[i];
-    for (dimension_type j = 0,
-           j_end = OR_Matrix<N>::row_size(i); j < j_end; ++j, ++x_i) {
-      if (!non_red_i[j])
-        assign_r(*x_i, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-  x.reset_strongly_closed();
-#ifndef NDEBUG
-  const Octagonal_Shape x_copy_after(x);
-  PPL_ASSERT(x_copy_before == x_copy_after);
-  PPL_ASSERT(x.is_strongly_reduced());
-  PPL_ASSERT(x.OK());
-#endif
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::non_redundant_matrix_entries(std::vector<Bit_Row>& non_redundant) const {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(space_dim > 0 && !marked_empty() && marked_strongly_closed());
-  PPL_ASSERT(non_redundant.empty());
-
-  // Initialize `non_redundant' as if it was an OR_Matrix of booleans
-  // (initially set to false).
-  non_redundant.resize(2*space_dim);
-
-  // Step 1: compute zero-equivalence classes.
-  // Variables corresponding to indices `i' and `j' are zero-equivalent
-  // if they lie on a zero-weight loop; since the matrix is strongly
-  // closed, this happens if and only if matrix[i][j] == -matrix[ci][cj].
-  std::vector<dimension_type> no_sing_leaders;
-  dimension_type sing_leader = 0;
-  bool exist_sing_class = false;
-  std::vector<dimension_type> successor;
-  compute_successors(successor);
-  compute_leaders(successor, no_sing_leaders, exist_sing_class, sing_leader);
-  const dimension_type num_no_sing_leaders = no_sing_leaders.size();
-
-
-  // Step 2: flag redundant constraints in `redundancy'.
-  // Go through non-singular leaders first.
-  for (dimension_type li = 0; li < num_no_sing_leaders; ++li) {
-    const dimension_type i = no_sing_leaders[li];
-    using namespace Implementation::Octagonal_Shapes;
-    const dimension_type ci = coherent_index(i);
-    typename OR_Matrix<N>::const_row_reference_type
-      m_i = *(matrix.row_begin() + i);
-    if (i % 2 == 0) {
-      // Each positive equivalence class must have a single 0-cycle
-      // connecting all equivalent variables in increasing order.
-      // Note: by coherence assumption, the variables in the
-      // corresponding negative equivalence class are
-      // automatically connected.
-      if (i != successor[i]) {
-        dimension_type j = i;
-        dimension_type next_j = successor[j];
-        while (j != next_j) {
-          non_redundant[next_j].set(j);
-          j = next_j;
-          next_j = successor[j];
-        }
-        const dimension_type cj = coherent_index(j);
-        non_redundant[cj].set(ci);
-      }
-    }
-
-    dimension_type rs_li = (li % 2 != 0) ? li : (li + 1);
-    // Check if the constraint is redundant.
-    PPL_DIRTY_TEMP(N, tmp);
-    for (dimension_type lj = 0 ; lj <= rs_li; ++lj) {
-      const dimension_type j = no_sing_leaders[lj];
-      const dimension_type cj = coherent_index(j);
-      const N& m_i_j = m_i[j];
-      const N& m_i_ci = m_i[ci];
-      bool to_add = true;
-      // Control if the constraint is redundant by strong-coherence,
-      // that is:
-      // m_i_j >= (m_i_ci + m_cj_j)/2,   where j != ci.
-      if (j != ci) {
-        add_assign_r(tmp, m_i_ci, matrix[cj][j], ROUND_UP);
-        div_2exp_assign_r(tmp, tmp, 1, ROUND_UP);
-        if (m_i_j >= tmp)
-          // The constraint is redundant.
-          continue;
-      }
-      // Control if the constraint is redundant by strong closure, that is
-      // if there is a path from i to j (i = i_0, ... , i_n = j), such that
-      // m_i_j = sum_{k=0}^{n-1} m_{i_k}_{i_(k + 1)}.
-      // Since the octagon is already strongly closed, the above relation
-      // is reduced to three case, in accordance with k, i, j inter-depend:
-      // exit k such that
-      // 1.) m_i_j >= m_i_k   + m_cj_ck,   if k < j < i; or
-      // 2.) m_i_j >= m_i_k   + m_k,_j,    if j < k < i; or
-      // 3.) m_i_j >= m_ck_ci + m_k_j,     if j < i < k.
-      // Note: `i > j'.
-      for (dimension_type lk = 0; lk < num_no_sing_leaders; ++lk) {
-        const dimension_type k = no_sing_leaders[lk];
-        if (k != i && k != j) {
-          dimension_type ck = coherent_index(k);
-          if (k < j)
-            // Case 1.
-            add_assign_r(tmp, m_i[k], matrix[cj][ck], ROUND_UP);
-          else if (k < i)
-            // Case 2.
-            add_assign_r(tmp, m_i[k], matrix[k][j], ROUND_UP);
-          else
-            // Case 3.
-            add_assign_r(tmp, matrix[ck][ci], matrix[k][j], ROUND_UP);
-
-          // Checks if the constraint is redundant.
-          if (m_i_j >= tmp) {
-            to_add = false;
-            break;
-          }
-        }
-      }
-
-      if (to_add)
-        // The constraint is not redundant.
-        non_redundant[i].set(j);
-    }
-  }
-
-  // If there exist a singular equivalence class, then it must have a
-  // single 0-cycle connecting all the positive and negative equivalent
-  // variables.
-  // Note: the singular class is not connected with the other classes.
-  if (exist_sing_class) {
-    non_redundant[sing_leader].set(sing_leader + 1);
-    if (successor[sing_leader + 1] != sing_leader + 1) {
-      dimension_type j = sing_leader;
-      dimension_type next_j = successor[j + 1];
-      while (next_j != j + 1) {
-        non_redundant[next_j].set(j);
-        j = next_j;
-        next_j = successor[j + 1];
-      }
-      non_redundant[j + 1].set(j);
-    }
-    else
-      non_redundant[sing_leader + 1].set(sing_leader);
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::upper_bound_assign(const Octagonal_Shape& y) {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("upper_bound_assign(y)", y);
-
-  // The hull of an octagon `x' with an empty octagon is `x'.
-  y.strong_closure_assign();
-  if (y.marked_empty())
-    return;
-  strong_closure_assign();
-  if (marked_empty()) {
-    *this = y;
-    return;
-  }
-
-  // The oct-hull is obtained by computing maxima.
-  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
-  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
-         matrix_element_end = matrix.element_end();
-       i != matrix_element_end; ++i, ++j)
-    max_assign(*i, *j);
-
-  // The result is still closed.
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::difference_assign(const Octagonal_Shape& y) {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("difference_assign(y)", y);
-
-  Octagonal_Shape& x = *this;
-
-  // Being lazy here is only harmful.
-  // We close.
-  x.strong_closure_assign();
-  // The difference of an empty octagon and of an octagon `p' is empty.
-  if (x.marked_empty())
-    return;
-  // The difference of a octagon `p' and an empty octagon is `p'.
-  if (y.marked_empty())
-    return;
-
-  // If both octagons are zero-dimensional,
-  // then at this point they are necessarily universe octagons,
-  // so that their difference is empty.
-  if (x.space_dim == 0) {
-    x.set_empty();
-    return;
-  }
-
-  // TODO: This is just an executable specification.
-  //       Have to find a more efficient method.
-  if (y.contains(x)) {
-    x.set_empty();
-    return;
-  }
-
-  Octagonal_Shape new_oct(space_dim, EMPTY);
-  // We take a constraint of the octagon y at the time and we
-  // consider its complementary. Then we intersect the union
-  // of these complementary constraints with the octagon x.
-  const Constraint_System& y_cs = y.constraints();
-  for (Constraint_System::const_iterator i = y_cs.begin(),
-         y_cs_end = y_cs.end(); i != y_cs_end; ++i) {
-    const Constraint& c = *i;
-    // If the octagon `x' is included the octagon defined by `c',
-    // then `c' _must_ be skipped, as adding its complement to `x'
-    // would result in the empty octagon, and as we would obtain
-    // a result that is less precise than the difference.
-    if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
-      continue;
-    Octagonal_Shape z = x;
-    const Linear_Expression e = Linear_Expression(c);
-    z.add_constraint(e <= 0);
-    if (!z.is_empty())
-      new_oct.upper_bound_assign(z);
-    if (c.is_equality()) {
-      z = x;
-      z.add_constraint(e >= 0);
-      if (!z.is_empty())
-        new_oct.upper_bound_assign(z);
-    }
-  }
-  *this = new_oct;
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::simplify_using_context_assign(const Octagonal_Shape& y) {
-  Octagonal_Shape& x = *this;
-  const dimension_type dim = x.space_dimension();
-  // Dimension-compatibility check.
-  if (dim != y.space_dimension())
-    throw_dimension_incompatible("simplify_using_context_assign(y)", y);
-
-  // Filter away the zero-dimensional case.
-  if (dim == 0) {
-    if (y.marked_empty()) {
-      x.set_zero_dim_univ();
-      return false;
-    }
-    else
-      return !x.marked_empty();
-  }
-
-  // Filter away the case where `x' contains `y'
-  // (this subsumes the case when `y' is empty).
-  if (x.contains(y)) {
-    Octagonal_Shape<T> res(dim, UNIVERSE);
-    x.m_swap(res);
-    return false;
-  }
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iter;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_CIter;
-  typedef typename OR_Matrix<N>::element_iterator Elem_Iter;
-  typedef typename OR_Matrix<N>::const_element_iterator Elem_CIter;
-
-  // Filter away the case where `x' is empty.
-  x.strong_closure_assign();
-  if (x.marked_empty()) {
-    // Search for a constraint of `y' that is not a tautology.
-    dimension_type i;
-    dimension_type j;
-    // Prefer unary constraints.
-    for (i = 0; i < 2*dim; i += 2) {
-      // FIXME: if N is a float or bounded integer type, then
-      // we also need to check that we are actually able to construct
-      // a constraint inconsistent with respect to this one.
-      // Use something like !is_maximal()?
-      if (!is_plus_infinity(y.matrix_at(i, i + 1))) {
-        j = i + 1;
-        goto found;
-      }
-      // Use something like !is_maximal()?
-      if (!is_plus_infinity(y.matrix_at(i + 1, i))) {
-        j = i;
-        ++i;
-        goto found;
-      }
-    }
-    // Then search binary constraints.
-    // TODO: use better iteration scheme.
-    for (i = 2; i < 2*dim; ++i)
-      for (j = 0; j < i; ++j) {
-        // Use something like !is_maximal()?
-        if (!is_plus_infinity(y.matrix_at(i, j)))
-          goto found;
-      }
-
-    // Not found: we were not able to build a constraint contradicting
-    // one of the constraints in `y': `x' cannot be enlarged.
-    return false;
-
-  found:
-    // Found: build a new OS contradicting the constraint found.
-    PPL_ASSERT(i < dim && j < dim && i != j);
-    Octagonal_Shape<T> res(dim, UNIVERSE);
-    // FIXME: compute a proper contradicting constraint.
-    PPL_DIRTY_TEMP(N, tmp);
-    assign_r(tmp, 1, ROUND_UP);
-    add_assign_r(tmp, tmp, y.matrix_at(i, j), ROUND_UP);
-    // CHECKME: round down is really meant.
-    neg_assign_r(res.matrix_at(j, i), tmp, ROUND_DOWN);
-    PPL_ASSERT(!is_plus_infinity(res.matrix_at(j, i)));
-    x.m_swap(res);
-    return false;
-  }
-
-  // Here `x' and `y' are not empty and strongly closed;
-  // also, `x' does not contain `y'.
-  // Let `target' be the intersection of `x' and `y'.
-  Octagonal_Shape<T> target = x;
-  target.intersection_assign(y);
-  const bool bool_result = !target.is_empty();
-
-  // Compute redundancy information for x and ...
-  // TODO: provide a nicer data structure for redundancy.
-  std::vector<Bit_Row> x_non_redundant;
-  x.non_redundant_matrix_entries(x_non_redundant);
-  // ... count the non-redundant constraints.
-  dimension_type x_num_non_redundant = 0;
-  for (size_t i = x_non_redundant.size(); i-- > 0 ; )
-    x_num_non_redundant += x_non_redundant[i].count_ones();
-  PPL_ASSERT(x_num_non_redundant > 0);
-
-  // Let `yy' be a copy of `y': we will keep adding to `yy'
-  // the non-redundant constraints of `x',
-  // stopping as soon as `yy' becomes equal to `target'.
-  Octagonal_Shape<T> yy = y;
-
-  // The constraints added to `yy' will be recorded in `res' ...
-  Octagonal_Shape<T> res(dim, UNIVERSE);
-  // ... and we will count them too.
-  dimension_type res_num_non_redundant = 0;
-
-  // Compute leader information for `x'.
-  std::vector<dimension_type> x_leaders;
-  x.compute_leaders(x_leaders);
-
-  // First go through the unary equality constraints.
-  // Find the leader of the singular equivalence class (it is even!).
-  dimension_type sing_leader;
-  for (sing_leader = 0; sing_leader < 2*dim; sing_leader += 2) {
-    if (sing_leader == x_leaders[sing_leader]) {
-      const N& x_s_ss = x.matrix_at(sing_leader, sing_leader + 1);
-      const N& x_ss_s = x.matrix_at(sing_leader + 1, sing_leader);
-      if (is_additive_inverse(x_s_ss, x_ss_s))
-        // Singular leader found.
-        break;
-    }
-  }
-
-  // Unary equalities have `sing_leader' as a leader.
-  for (dimension_type i = sing_leader; i < 2*dim; i += 2) {
-    if (x_leaders[i] != sing_leader)
-      continue;
-    // Found a unary equality constraint:
-    // see if any of the two inequalities have to be added.
-    const N& x_i_ii = x.matrix_at(i, i + 1);
-    N& yy_i_ii = yy.matrix_at(i, i + 1);
-    if (x_i_ii < yy_i_ii) {
-      // The \leq inequality is not implied by context.
-      res.matrix_at(i, i + 1) = x_i_ii;
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy_i_ii = x_i_ii;
-      yy.reset_strongly_closed();
-    }
-    const N& x_ii_i = x.matrix_at(i + 1, i);
-    N& yy_ii_i = yy.matrix_at(i + 1, i);
-    if (x_ii_i < yy_ii_i) {
-      // The \geq inequality is not implied by context.
-      res.matrix_at(i + 1, i) = x_ii_i;
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy_ii_i = x_ii_i;
-      yy.reset_strongly_closed();
-    }
-    // Restore strong closure, if it was lost.
-    if (!yy.marked_strongly_closed()) {
-      Variable var_i(i/2);
-      yy.incremental_strong_closure_assign(var_i);
-      if (target.contains(yy)) {
-        // Target reached: swap `x' and `res' if needed.
-        if (res_num_non_redundant < x_num_non_redundant) {
-          res.reset_strongly_closed();
-          x.m_swap(res);
-        }
-        return bool_result;
-      }
-    }
-  }
-
-  // Go through the binary equality constraints.
-  for (dimension_type i = 0; i < 2*dim; ++i) {
-    const dimension_type j = x_leaders[i];
-    if (j == i || j == sing_leader)
-      continue;
-    const N& x_i_j = x.matrix_at(i, j);
-    PPL_ASSERT(!is_plus_infinity(x_i_j));
-    N& yy_i_j = yy.matrix_at(i, j);
-    if (x_i_j < yy_i_j) {
-      res.matrix_at(i, j) = x_i_j;
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy_i_j = x_i_j;
-      yy.reset_strongly_closed();
-    }
-    const N& x_j_i = x.matrix_at(j, i);
-    N& yy_j_i = yy.matrix_at(j, i);
-    PPL_ASSERT(!is_plus_infinity(x_j_i));
-    if (x_j_i < yy_j_i) {
-      res.matrix_at(j, i) = x_j_i;
-      ++res_num_non_redundant;
-      // Tighten context `yy' using the newly added constraint.
-      yy_j_i = x_j_i;
-      yy.reset_strongly_closed();
-    }
-    // Restore strong closure, if it was lost.
-    if (!yy.marked_strongly_closed()) {
-      Variable var_j(j/2);
-      yy.incremental_strong_closure_assign(var_j);
-      if (target.contains(yy)) {
-        // Target reached: swap `x' and `res' if needed.
-        if (res_num_non_redundant < x_num_non_redundant) {
-          res.reset_strongly_closed();
-          x.m_swap(res);
-        }
-        return bool_result;
-      }
-    }
-  }
-
-  // Finally go through the (proper) inequality constraints:
-  // both indices i and j should be leaders.
-  // FIXME: improve iteration scheme (are we doing twice the work?)
-  for (dimension_type i = 0; i < 2*dim; ++i) {
-    if (i != x_leaders[i])
-      continue;
-    const Bit_Row& x_non_redundant_i = x_non_redundant[i];
-    for (dimension_type j = 0; j < 2*dim; ++j) {
-      if (j != x_leaders[j])
-        continue;
-      if (i >= j) {
-        if (!x_non_redundant_i[j])
-          continue;
-      }
-      else if (!x_non_redundant[j][i])
-        continue;
-      N& yy_i_j = yy.matrix_at(i, j);
-      const N& x_i_j = x.matrix_at(i, j);
-      if (x_i_j < yy_i_j) {
-        res.matrix_at(i, j) = x_i_j;
-        ++res_num_non_redundant;
-        // Tighten context `yy' using the newly added constraint.
-        yy_i_j = x_i_j;
-        yy.reset_strongly_closed();
-        Variable var(i/2);
-        yy.incremental_strong_closure_assign(var);
-        if (target.contains(yy)) {
-          // Target reached: swap `x' and `res' if needed.
-          if (res_num_non_redundant < x_num_non_redundant) {
-            res.reset_strongly_closed();
-            x.m_swap(res);
-          }
-          return bool_result;
-        }
-      }
-    }
-  }
-  // This point should be unreachable.
-  PPL_UNREACHABLE;
-  return false;
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::add_space_dimensions_and_embed(dimension_type m) {
-  // Adding no dimensions is a no-op.
-  if (m == 0)
-    return;
-
-  const dimension_type new_dim = space_dim + m;
-  const bool was_zero_dim_univ = !marked_empty() && space_dim == 0;
-
-  // To embed an n-dimension space octagon in a (n + m)-dimension space,
-  // we just add `m' variables in the matrix of constraints.
-  matrix.grow(new_dim);
-  space_dim = new_dim;
-  // If `*this' was the zero-dim space universe octagon,
-  // then we can set the strongly closure flag.
-  if (was_zero_dim_univ)
-    set_strongly_closed();
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::add_space_dimensions_and_project(dimension_type m) {
-  // Adding no dimensions is a no-op.
-  if (m == 0)
-    return;
-
-  const dimension_type n = matrix.num_rows();
-
-  // To project an n-dimension space OS in a (space_dim + m)-dimension space,
-  // we just add `m' columns and rows in the matrix of constraints.
-  add_space_dimensions_and_embed(m);
-  // We insert 0 where it needs.
-  // Attention: now num_rows of matrix is update!
-  for (typename OR_Matrix<N>::row_iterator i = matrix.row_begin() + n,
-         matrix_row_end =  matrix.row_end(); i != matrix_row_end; i += 2) {
-    typename OR_Matrix<N>::row_reference_type x_i = *i;
-    typename OR_Matrix<N>::row_reference_type x_ci = *(i + 1);
-    const dimension_type ind = i.index();
-    assign_r(x_i[ind + 1], 0, ROUND_NOT_NEEDED);
-    assign_r(x_ci[ind], 0, ROUND_NOT_NEEDED);
-  }
-
-  if (marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::remove_space_dimensions(const Variables_Set& vars) {
-  // The removal of no dimensions from any octagon is a no-op.
-  // Note that this case also captures the only legal removal of
-  // dimensions from a octagon in a 0-dim space.
-  if (vars.empty()) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dim < min_space_dim)
-    throw_dimension_incompatible("remove_space_dimensions(vs)", min_space_dim);
-
-  const dimension_type new_space_dim = space_dim - vars.size();
-
-  strong_closure_assign();
-  // When removing _all_ dimensions from an octagon,
-  // we obtain the zero-dimensional octagon.
-  if (new_space_dim == 0) {
-    matrix.shrink(0);
-    if (!marked_empty())
-      // We set the zero_dim_univ flag.
-      set_zero_dim_univ();
-    space_dim = 0;
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // We consider each variable and we check if it has to be removed.
-  // If it has to be removed, we pass to the next one, then we will
-  // overwrite its representation in the matrix.
-  typedef typename OR_Matrix<N>::element_iterator Elem_Iter;
-  typedef typename std::iterator_traits<Elem_Iter>::difference_type diff_t;
-
-  dimension_type first = *vars.begin();
-  const dimension_type first_size = 2 * first * (first + 1);
-  Elem_Iter iter = matrix.element_begin() + static_cast<diff_t>(first_size);
-
-  for (dimension_type i = first + 1; i < space_dim; ++i) {
-    if (vars.count(i) == 0) {
-      typename OR_Matrix<N>::row_iterator row_iter = matrix.row_begin() + 2*i;
-      typename OR_Matrix<N>::row_reference_type row_ref = *row_iter;
-      typename OR_Matrix<N>::row_reference_type row_ref1 = *(++row_iter);
-      // Beware: first we shift the cells corresponding to the first
-      // row of variable(j), then we shift the cells corresponding to the
-      // second row. We recall that every variable is represented
-      // in the `matrix' by two rows and two columns.
-      for (dimension_type j = 0; j <= i; ++j)
-        if (vars.count(j) == 0) {
-          assign_or_swap(*(iter++), row_ref[2*j]);
-          assign_or_swap(*(iter++), row_ref[2*j + 1]);
-        }
-      for (dimension_type j = 0; j <= i; ++j)
-        if (vars.count(j) == 0) {
-          assign_or_swap(*(iter++), row_ref1[2*j]);
-          assign_or_swap(*(iter++), row_ref1[2*j + 1]);
-        }
-    }
-  }
-  // Update the space dimension.
-  matrix.shrink(new_space_dim);
-  space_dim = new_space_dim;
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Partial_Function>
-void
-Octagonal_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
-  if (space_dim == 0)
-    return;
-
-  if (pfunc.has_empty_codomain()) {
-    // All dimensions vanish: the octagon becomes zero_dimensional.
-    remove_higher_space_dimensions(0);
-    return;
-  }
-
-  const dimension_type new_space_dim = pfunc.max_in_codomain() + 1;
-  // If we are going to actually reduce the space dimension,
-  // then shortest-path closure is required to keep precision.
-  if (new_space_dim < space_dim)
-    strong_closure_assign();
-
-  // If the octagon is empty, then it is sufficient to adjust
-  // the space dimension of the octagon.
-  if (marked_empty()) {
-    remove_higher_space_dimensions(new_space_dim);
-    return;
-  }
-
-  // We create a new matrix with the new space dimension.
-  OR_Matrix<N> x(new_space_dim);
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-
-  Row_Iterator m_begin = x.row_begin();
-
-  for (Row_Iterator i_iter = matrix.row_begin(), i_end = matrix.row_end();
-       i_iter != i_end; i_iter += 2) {
-    dimension_type new_i;
-    dimension_type i = i_iter.index()/2;
-    // We copy and place in the position into `x' the only cells of
-    // the `matrix' that refer to both mapped variables,
-    // the variable `i' and `j'.
-    if (pfunc.maps(i, new_i)) {
-      Row_Reference r_i = *i_iter;
-      Row_Reference r_ii = *(i_iter + 1);
-      dimension_type double_new_i = 2*new_i;
-      Row_Iterator x_iter = m_begin + double_new_i;
-      Row_Reference x_i = *x_iter;
-      Row_Reference x_ii = *(x_iter + 1);
-      for (dimension_type j = 0; j <= i; ++j) {
-        dimension_type new_j;
-        // If also the second variable is mapped, we work.
-        if (pfunc.maps(j, new_j)) {
-          dimension_type dj = 2*j;
-          dimension_type double_new_j = 2*new_j;
-          // Mapped the constraints, exchanging the indexes.
-          // Attention: our matrix is pseudo-triangular.
-          // If new_j > new_i, we must consider, as rows, the rows of
-          // the variable new_j, and not of new_i ones.
-          if (new_i >= new_j) {
-            assign_or_swap(x_i[double_new_j], r_i[dj]);
-            assign_or_swap(x_ii[double_new_j], r_ii[dj]);
-            assign_or_swap(x_ii[double_new_j + 1], r_ii[dj + 1]);
-            assign_or_swap(x_i[double_new_j + 1], r_i[dj + 1]);
-          }
-          else {
-            Row_Iterator x_j_iter = m_begin + double_new_j;
-            Row_Reference x_j = *x_j_iter;
-            Row_Reference x_jj = *(x_j_iter + 1);
-            assign_or_swap(x_jj[double_new_i + 1], r_i[dj]);
-            assign_or_swap(x_jj[double_new_i], r_ii[dj]);
-            assign_or_swap(x_j[double_new_i + 1], r_i[dj + 1]);
-            assign_or_swap(x_j[double_new_i], r_ii[dj + 1]);
-          }
-
-        }
-      }
-    }
-  }
-
-  using std::swap;
-  swap(matrix, x);
-  space_dim = new_space_dim;
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::intersection_assign(const Octagonal_Shape& y) {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("intersection_assign(y)", y);
-
-  // If one of the two octagons is empty, the intersection is empty.
-  if (marked_empty())
-    return;
-  if (y.marked_empty()) {
-    set_empty();
-    return;
-  }
-  // If both octagons are zero-dimensional,then at this point
-  // they are necessarily non-empty,
-  // so that their intersection is non-empty too.
-  if (space_dim == 0)
-    return;
-
-  // To intersect two octagons we compare the constraints
-  // and we choose the less values.
-  bool changed = false;
-
-  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
-  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
-         matrix_element_end = matrix.element_end();
-       i != matrix_element_end;
-       ++i, ++j) {
-    N& elem = *i;
-    const N& y_elem = *j;
-    if (y_elem < elem) {
-      elem = y_elem;
-      changed = true;
-    }
-  }
-
-  // This method not preserve the closure.
-  if (changed && marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Iterator>
-void
-Octagonal_Shape<T>::CC76_extrapolation_assign(const Octagonal_Shape& y,
-                                              Iterator first, Iterator last,
-                                              unsigned* tp) {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("CC76_extrapolation_assign(y)", y);
-
-  // Assume `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If both octagons are zero-dimensional,
-  // since `*this' contains `y', we simply return `*this'.
-  if (space_dim == 0)
-    return;
-
-  strong_closure_assign();
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  y.strong_closure_assign();
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  // If there are tokens available, work on a temporary copy.
-  if (tp != 0 && *tp > 0) {
-    Octagonal_Shape x_tmp(*this);
-    x_tmp.CC76_extrapolation_assign(y, first, last, 0);
-    // If the widening was not precise, use one of the available tokens.
-    if (!contains(x_tmp))
-      --(*tp);
-    return;
-  }
-
-  // Compare each constraint in `y' to the corresponding one in `*this'.
-  // The constraint in `*this' is kept as is if it is stronger than or
-  // equal to the constraint in `y'; otherwise, the inhomogeneous term
-  // of the constraint in `*this' is further compared with elements taken
-  // from a sorted container (the stop-points, provided by the user), and
-  // is replaced by the first entry, if any, which is greater than or equal
-  // to the inhomogeneous term. If no such entry exists, the constraint
-  // is removed altogether.
-  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
-  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
-         matrix_element_end = matrix.element_end();
-       i != matrix_element_end;
-       ++i, ++j) {
-    const N& y_elem = *j;
-    N& elem = *i;
-    if (y_elem < elem) {
-      Iterator k = std::lower_bound(first, last, elem);
-      if (k != last) {
-        if (elem < *k)
-          assign_r(elem, *k, ROUND_UP);
-      }
-      else
-        assign_r(elem, PLUS_INFINITY, ROUND_NOT_NEEDED);
-    }
-  }
-
-  reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::get_limiting_octagon(const Constraint_System& cs,
-                       Octagonal_Shape& limiting_octagon) const {
-  const dimension_type cs_space_dim = cs.space_dimension();
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(cs_space_dim <= space_dim);
-
-  strong_closure_assign();
-  bool is_oct_changed = false;
-
-  // Allocate temporaries outside of the loop.
-  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(term);
-  PPL_DIRTY_TEMP(N, d);
-
-  for (Constraint_System::const_iterator cs_i = cs.begin(),
-         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
-    const Constraint& c = *cs_i;
-    dimension_type num_vars = 0;
-    dimension_type i = 0;
-    dimension_type j = 0;
-    // Constraints that are not octagonal differences are ignored.
-    if (!Octagonal_Shape_Helper
-      ::extract_octagonal_difference(c, cs_space_dim, num_vars, i, j,
-                                     coeff, term))
-      continue;
-
-    typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-    typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-    typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-    typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-    Row_iterator m_begin = matrix.row_begin();
-    // Select the cell to be modified for the "<=" part of the constraint.
-    Row_iterator i_iter = m_begin + i;
-    Row_reference m_i = *i_iter;
-    OR_Matrix<N>& lo_mat = limiting_octagon.matrix;
-    Row_Iterator lo_iter = lo_mat.row_begin() + i;
-    Row_Reference lo_m_i = *lo_iter;
-    N& lo_m_i_j = lo_m_i[j];
-    if (coeff < 0)
-      neg_assign(coeff);
-    // Compute the bound for `m_i_j', rounding towards plus infinity.
-    div_round_up(d, term, coeff);
-    if (m_i[j] <= d)
-      if (c.is_inequality()) {
-        if (lo_m_i_j > d) {
-          lo_m_i_j = d;
-          is_oct_changed = true;
-        }
-        else {
-          // Select the right row of the cell.
-          if (i % 2 == 0) {
-            ++i_iter;
-            ++lo_iter;
-          }
-          else {
-            --i_iter;
-            --lo_iter;
-          }
-          Row_reference m_ci = *i_iter;
-          Row_Reference lo_m_ci = *lo_iter;
-          // Select the right column of the cell.
-          using namespace Implementation::Octagonal_Shapes;
-          dimension_type cj = coherent_index(j);
-          N& lo_m_ci_cj = lo_m_ci[cj];
-          neg_assign(term);
-          div_round_up(d, term, coeff);
-          if (m_ci[cj] <= d && lo_m_ci_cj > d) {
-            lo_m_ci_cj = d;
-            is_oct_changed = true;
-          }
-        }
-      }
-  }
-  // In general, adding a constraint does not preserve the strongly
-  // closure of the octagon.
-  if (is_oct_changed && limiting_octagon.marked_strongly_closed())
-    limiting_octagon.reset_strongly_closed();
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::limited_CC76_extrapolation_assign(const Octagonal_Shape& y,
-                                    const Constraint_System& cs,
-                                    unsigned* tp) {
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)",
-                                 y);
-  // `cs' must be dimension-compatible with the two octagons.
-  const dimension_type cs_space_dim = cs.space_dimension();
-  if (space_dim < cs_space_dim)
-    throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");
-
-  // Strict inequalities not allowed.
-  if (cs.has_strict_inequalities())
-    throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");
-
-  // The limited CC76-extrapolation between two octagons in a
-  // zero-dimensional space is a octagon in a zero-dimensional
-  // space, too.
-  if (space_dim == 0)
-    return;
-
-  // Assume `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  Octagonal_Shape limiting_octagon(space_dim, UNIVERSE);
-  get_limiting_octagon(cs, limiting_octagon);
-  CC76_extrapolation_assign(y, tp);
-  intersection_assign(limiting_octagon);
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::BHMZ05_widening_assign(const Octagonal_Shape& y,
-                                           unsigned* tp) {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("BHMZ05_widening_assign(y)", y);
-
-  // Assume `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // Compute the affine dimension of `y'.
-  const dimension_type y_affine_dim = y.affine_dimension();
-  // If the affine dimension of `y' is zero, then either `y' is
-  // zero-dimensional, or it is empty, or it is a singleton.
-  // In all cases, due to the inclusion hypothesis, the result is `*this'.
-  if (y_affine_dim == 0)
-    return;
-
-  // If the affine dimension has changed, due to the inclusion hypothesis,
-  // the result is `*this'.
-  const dimension_type x_affine_dim = affine_dimension();
-  PPL_ASSERT(x_affine_dim >= y_affine_dim);
-  if (x_affine_dim != y_affine_dim)
-    return;
-
-  // If there are tokens available, work on a temporary copy.
-  if (tp != 0 && *tp > 0) {
-    Octagonal_Shape x_tmp(*this);
-    x_tmp.BHMZ05_widening_assign(y, 0);
-    // If the widening was not precise, use one of the available tokens.
-    if (!contains(x_tmp))
-      --(*tp);
-    return;
-  }
-
-  // Here no token is available.
-  PPL_ASSERT(marked_strongly_closed() && y.marked_strongly_closed());
-  // Minimize `y'.
-  y.strong_reduction_assign();
-
-  // Extrapolate unstable bounds.
-  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
-  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
-       matrix_element_end = matrix.element_end();
-       i != matrix_element_end;
-       ++i, ++j) {
-    N& elem = *i;
-      // Note: in the following line the use of `!=' (as opposed to
-      // the use of `<' that would seem -but is not- equivalent) is
-      // intentional.
-    if (*j != elem)
-      assign_r(elem, PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-  reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::limited_BHMZ05_extrapolation_assign(const Octagonal_Shape& y,
-                                      const Constraint_System& cs,
-                                      unsigned* tp) {
-
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("limited_BHMZ05_extrapolation_assign(y, cs)",
-                                 y);
-  // `cs' must be dimension-compatible with the two octagons.
-  const dimension_type cs_space_dim = cs.space_dimension();
-  if (space_dim < cs_space_dim)
-    throw_constraint_incompatible("limited_CH78_extrapolation_assign(y, cs)");
-
-  // Strict inequalities not allowed.
-  if (cs.has_strict_inequalities())
-    throw_constraint_incompatible("limited_CH78_extrapolation_assign(y, cs)");
-
-  // The limited BHMZ05-extrapolation between two octagons in a
-  // zero-dimensional space is a octagon in a zero-dimensional
-  // space, too.
-  if (space_dim == 0)
-    return;
-
-  // Assume `y' is contained in or equal to `*this'.
-  PPL_EXPECT_HEAVY(copy_contains(*this, y));
-
-  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
-  if (marked_empty())
-    return;
-  // If `y' is empty, we return.
-  if (y.marked_empty())
-    return;
-
-  Octagonal_Shape limiting_octagon(space_dim, UNIVERSE);
-  get_limiting_octagon(cs, limiting_octagon);
-  BHMZ05_widening_assign(y, tp);
-  intersection_assign(limiting_octagon);
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::CC76_narrowing_assign(const Octagonal_Shape& y) {
-  // Dimension-compatibility check.
-  if (space_dim != y.space_dim)
-    throw_dimension_incompatible("CC76_narrowing_assign(y)", y);
-
-  // Assume `*this' is contained in or equal to `y'.
-  PPL_EXPECT_HEAVY(copy_contains(y, *this));
-
-  // If both octagons are zero-dimensional, since `*this' contains `y',
-  // we simply return '*this'.
-  if (space_dim == 0)
-    return;
-
-  y.strong_closure_assign();
-  // If `y' is empty, since `y' contains `*this', `*this' is empty too.
-  if (y.marked_empty())
-    return;
-  strong_closure_assign();
-  // If `*this' is empty, we return.
-  if (marked_empty())
-    return;
-
-  // We consider a constraint of `*this', if its value is `plus_infinity',
-  // we take the value of the corresponding constraint of `y'.
-  bool is_oct_changed = false;
-  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
-  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
-         matrix_element_end = matrix.element_end();
-       i != matrix_element_end;
-       ++i, ++j) {
-    if (!is_plus_infinity(*i)
-        && !is_plus_infinity(*j)
-        && *i != *j) {
-      *i = *j;
-      is_oct_changed = true;
-    }
-  }
-
-  if (is_oct_changed && marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::deduce_v_pm_u_bounds(const dimension_type v_id,
-                       const dimension_type last_id,
-                       const Linear_Expression& sc_expr,
-                       Coefficient_traits::const_reference sc_denom,
-                       const N& ub_v) {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(sc_denom > 0);
-  PPL_ASSERT(!is_plus_infinity(ub_v));
-
-  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
-  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
-
-  // No need to consider indices greater than `last_id'.
-  const dimension_type n_v = 2*v_id;
-  typename OR_Matrix<N>::row_reference_type m_cv = matrix[n_v + 1];
-
-  // Speculatively allocate temporaries out of the loop.
-  PPL_DIRTY_TEMP(N, half);
-  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
-  PPL_DIRTY_TEMP(mpq_class, q);
-  PPL_DIRTY_TEMP(mpq_class, minus_q);
-  PPL_DIRTY_TEMP(mpq_class, ub_u);
-  PPL_DIRTY_TEMP(mpq_class, lb_u);
-  PPL_DIRTY_TEMP(N, up_approx);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_expr_u);
-
-  for (Linear_Expression::const_iterator u = sc_expr.begin(),
-      u_end = sc_expr.lower_bound(Variable(last_id + 1)); u != u_end; ++u) {
-    const dimension_type u_id = u.variable().id();
-    // Skip the case when `u_id == v_id'.
-    if (u_id == v_id)
-      continue;
-    const Coefficient& expr_u = *u;
-
-    const dimension_type n_u = u_id*2;
-    // If `expr_u' is positive, we can improve `v - u'.
-    if (expr_u > 0) {
-      if (expr_u >= sc_denom) {
-        // Here q >= 1: deducing `v - u <= ub_v - ub_u'.
-        // We avoid to check if `ub_u' is plus infinity, because
-        // it is used for the computation of `ub_v'.
-        // Let half = m_cu_u / 2.
-        div_2exp_assign_r(half, matrix[n_u + 1][n_u], 1, ROUND_UP);
-        N& m_v_minus_u = (n_v < n_u) ? matrix[n_u][n_v] : m_cv[n_u + 1];
-        sub_assign_r(m_v_minus_u, ub_v, half, ROUND_UP);
-      }
-      else {
-        // Here 0 < q < 1.
-        typename OR_Matrix<N>::row_reference_type m_u = matrix[n_u];
-        const N& m_u_cu = m_u[n_u + 1];
-        if (!is_plus_infinity(m_u_cu)) {
-          // Let `ub_u' and `lb_u' be the known upper and lower bound
-          // for `u', respectively. The upper bound for `v - u' is
-          // computed as `ub_v - (q * ub_u + (1-q) * lb_u)',
-          // i.e., `ub_v + (-lb_u) - q * (ub_u + (-lb_u))'.
-          assign_r(minus_lb_u, m_u_cu, ROUND_NOT_NEEDED);
-          div_2exp_assign_r(minus_lb_u, minus_lb_u, 1, ROUND_NOT_NEEDED);
-          assign_r(q, expr_u, ROUND_NOT_NEEDED);
-          div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
-          assign_r(ub_u, matrix[n_u + 1][n_u], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
-          // Compute `ub_u - lb_u'.
-          add_assign_r(ub_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
-          // Compute `(-lb_u) - q * (ub_u - lb_u)'.
-          sub_mul_assign_r(minus_lb_u, q, ub_u, ROUND_NOT_NEEDED);
-          assign_r(up_approx, minus_lb_u, ROUND_UP);
-          // Deducing `v - u <= ub_v - (q * ub_u + (1-q) * lb_u)'.
-          N& m_v_minus_u = (n_v < n_u) ? m_u[n_v] : m_cv[n_u + 1];
-          add_assign_r(m_v_minus_u, ub_v, up_approx, ROUND_UP);
-        }
-      }
-    }
-    else {
-      PPL_ASSERT(expr_u < 0);
-      // If `expr_u' is negative, we can improve `v + u'.
-      neg_assign(minus_expr_u, expr_u);
-      if (minus_expr_u >= sc_denom) {
-        // Here q <= -1: Deducing `v + u <= ub_v + lb_u'.
-        // We avoid to check if `lb_u' is plus infinity, because
-        // it is used for the computation of `ub_v'.
-        // Let half = m_u_cu / 2.
-        div_2exp_assign_r(half, matrix[n_u][n_u + 1], 1, ROUND_UP);
-        N& m_v_plus_u = (n_v < n_u) ? matrix[n_u + 1][n_v] : m_cv[n_u];
-        sub_assign_r(m_v_plus_u, ub_v, half, ROUND_UP);
-      }
-      else {
-        // Here -1 < q < 0.
-        typename OR_Matrix<N>::row_reference_type m_cu = matrix[n_u + 1];
-        const N& m_cu_u = m_cu[n_u];
-        if (!is_plus_infinity(m_cu_u)) {
-          // Let `ub_u' and `lb_u' be the known upper and lower bound
-          // for `u', respectively. The upper bound for `v + u' is
-          // computed as `ub_v + ((-q) * lb_u + (1 + q) * ub_u)',
-          // i.e., `ub_v + ub_u + (-q) * (lb_u - ub_u)'.
-          assign_r(ub_u, m_cu[n_u], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
-          assign_r(minus_q, minus_expr_u, ROUND_NOT_NEEDED);
-          div_assign_r(minus_q, minus_q, mpq_sc_denom, ROUND_NOT_NEEDED);
-          assign_r(lb_u, matrix[n_u][n_u + 1], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(lb_u, lb_u, 1, ROUND_NOT_NEEDED);
-          neg_assign_r(lb_u, lb_u, ROUND_NOT_NEEDED);
-          // Compute `lb_u - ub_u'.
-          sub_assign_r(lb_u, lb_u, ub_u, ROUND_NOT_NEEDED);
-          // Compute `ub_u + (-q) * (lb_u - ub_u)'.
-          add_mul_assign_r(ub_u, minus_q, lb_u, ROUND_NOT_NEEDED);
-          assign_r(up_approx, ub_u, ROUND_UP);
-          // Deducing `v + u <= ub_v + ((-q) * lb_u + (1 + q) * ub_u)'.
-          N& m_v_plus_u = (n_v < n_u) ? m_cu[n_v] : m_cv[n_u];
-          add_assign_r(m_v_plus_u, ub_v, up_approx, ROUND_UP);
-        }
-      }
-    }
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::deduce_minus_v_pm_u_bounds(const dimension_type v_id,
-                             const dimension_type last_id,
-                             const Linear_Expression& sc_expr,
-                             Coefficient_traits::const_reference sc_denom,
-                             const N& minus_lb_v) {
-  // Private method: the caller has to ensure the following.
-  PPL_ASSERT(sc_denom > 0);
-  PPL_ASSERT(!is_plus_infinity(minus_lb_v));
-
-  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
-  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
-
-  // No need to consider indices greater than `last_id'.
-  const dimension_type n_v = 2*v_id;
-  typename OR_Matrix<N>::row_reference_type m_v = matrix[n_v];
-
-  // Speculatively allocate temporaries out of the loop.
-  PPL_DIRTY_TEMP(N, half);
-  PPL_DIRTY_TEMP(mpq_class, ub_u);
-  PPL_DIRTY_TEMP(mpq_class, q);
-  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
-  PPL_DIRTY_TEMP(N, up_approx);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_expr_u);
-
-  for (Linear_Expression::const_iterator u = sc_expr.begin(),
-      u_end = sc_expr.lower_bound(Variable(last_id + 1)); u != u_end; ++u) {
-    const dimension_type u_id = u.variable().id();
-    // Skip the case when `u_id == v_id'.
-    if (u_id == v_id)
-      continue;
-    const Coefficient& expr_u = *u;
-
-    const dimension_type n_u = u_id*2;
-    // If `expr_u' is positive, we can improve `-v + u'.
-    if (expr_u > 0) {
-      if (expr_u >= sc_denom) {
-        // Here q >= 1: deducing `-v + u <= lb_u - lb_v',
-        // i.e., `u - v <= (-lb_v) - (-lb_u)'.
-        // We avoid to check if `lb_u' is plus infinity, because
-        // it is used for the computation of `lb_v'.
-        // Let half = m_u_cu / 2.
-        div_2exp_assign_r(half, matrix[n_u][n_u + 1], 1, ROUND_UP);
-        N& m_u_minus_v = (n_v < n_u) ? matrix[n_u + 1][n_v + 1] : m_v[n_u];
-        sub_assign_r(m_u_minus_v, minus_lb_v, half, ROUND_UP);
-      }
-      else {
-        // Here 0 < q < 1.
-        typename OR_Matrix<N>::row_reference_type m_cu = matrix[n_u + 1];
-        const N& m_cu_u = m_cu[n_u];
-        if (!is_plus_infinity(m_cu_u)) {
-          // Let `ub_u' and `lb_u' be the known upper and lower bound
-          // for `u', respectively. The upper bound for `u - v' is
-          // computed as `(q * lb_u + (1-q) * ub_u) - lb_v',
-          // i.e., `ub_u - q * (ub_u + (-lb_u)) + minus_lb_v'.
-          assign_r(ub_u, m_cu[n_u], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
-          assign_r(q, expr_u, ROUND_NOT_NEEDED);
-          div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
-          assign_r(minus_lb_u, matrix[n_u][n_u + 1], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(minus_lb_u, minus_lb_u, 1, ROUND_NOT_NEEDED);
-          // Compute `ub_u - lb_u'.
-          add_assign_r(minus_lb_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
-          // Compute `ub_u - q * (ub_u - lb_u)'.
-          sub_mul_assign_r(ub_u, q, minus_lb_u, ROUND_NOT_NEEDED);
-          assign_r(up_approx, ub_u, ROUND_UP);
-          // Deducing `u - v <= -lb_v - (q * lb_u + (1-q) * ub_u)'.
-          N& m_u_minus_v = (n_v < n_u) ? m_cu[n_v + 1] : m_v[n_u];
-          add_assign_r(m_u_minus_v, minus_lb_v, up_approx, ROUND_UP);
-        }
-      }
-    }
-    else {
-      PPL_ASSERT(expr_u < 0);
-      // If `expr_u' is negative, we can improve `-v - u'.
-      neg_assign(minus_expr_u, expr_u);
-      if (minus_expr_u >= sc_denom) {
-        // Here q <= -1: Deducing `-v - u <= -lb_v - ub_u'.
-        // We avoid to check if `ub_u' is plus infinity, because
-        // it is used for the computation of `lb_v'.
-        // Let half = m_cu_u / 2.
-        div_2exp_assign_r(half, matrix[n_u + 1][n_u], 1, ROUND_UP);
-        N& m_minus_v_minus_u = (n_v < n_u)
-          ? matrix[n_u][n_v + 1]
-          : m_v[n_u + 1];
-        sub_assign_r(m_minus_v_minus_u, minus_lb_v, half, ROUND_UP);
-      }
-      else {
-        // Here -1 < q < 0.
-        typename OR_Matrix<N>::row_reference_type m_u = matrix[n_u];
-        const N& m_u_cu = m_u[n_u + 1];
-        if (!is_plus_infinity(m_u_cu)) {
-          // Let `ub_u' and `lb_u' be the known upper and lower bound
-          // for `u', respectively. The upper bound for `-v - u' is
-          // computed as `-lb_v - ((-q)*ub_u + (1 + q)*lb_u)',
-          // i.e., `minus_lb_v - lb_u + q*(ub_u - lb_u)'.
-          assign_r(ub_u, matrix[n_u + 1][n_u], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
-          assign_r(q, expr_u, ROUND_NOT_NEEDED);
-          div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
-          assign_r(minus_lb_u, m_u[n_u + 1], ROUND_NOT_NEEDED);
-          div_2exp_assign_r(minus_lb_u, minus_lb_u, 1, ROUND_NOT_NEEDED);
-          // Compute `ub_u - lb_u'.
-          add_assign_r(ub_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
-          // Compute `-lb_u + q*(ub_u - lb_u)'.
-          add_mul_assign_r(minus_lb_u, q, ub_u, ROUND_NOT_NEEDED);
-          assign_r(up_approx, minus_lb_u, ROUND_UP);
-          // Deducing `-v - u <= -lb_v - ((-q) * ub_u + (1 + q) * lb_u)'.
-          N& m_minus_v_minus_u = (n_v < n_u) ? m_u[n_v + 1] : m_v[n_u + 1];
-          add_assign_r(m_minus_v_minus_u, minus_lb_v, up_approx, ROUND_UP);
-        }
-      }
-    }
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::forget_all_octagonal_constraints(const dimension_type v_id) {
-  PPL_ASSERT(v_id < space_dim);
-  const dimension_type n_v = 2*v_id;
-  typename OR_Matrix<N>::row_iterator m_iter = matrix.row_begin() + n_v;
-  typename OR_Matrix<N>::row_reference_type r_v = *m_iter;
-  typename OR_Matrix<N>::row_reference_type r_cv = *(++m_iter);
-  for (dimension_type h = m_iter.row_size(); h-- > 0; ) {
-    assign_r(r_v[h], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    assign_r(r_cv[h], PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-  ++m_iter;
-  for (typename OR_Matrix<N>::row_iterator m_end = matrix.row_end();
-       m_iter != m_end; ++m_iter) {
-    typename OR_Matrix<N>::row_reference_type r = *m_iter;
-    assign_r(r[n_v], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    assign_r(r[n_v + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::forget_binary_octagonal_constraints(const dimension_type v_id) {
-  PPL_ASSERT(v_id < space_dim);
-  const dimension_type n_v = 2*v_id;
-  typename OR_Matrix<N>::row_iterator m_iter = matrix.row_begin() + n_v;
-  typename OR_Matrix<N>::row_reference_type r_v = *m_iter;
-  typename OR_Matrix<N>::row_reference_type r_cv = *(++m_iter);
-  for (dimension_type k = n_v; k-- > 0; ) {
-    assign_r(r_v[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    assign_r(r_cv[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-  ++m_iter;
-  for (typename OR_Matrix<N>::row_iterator m_end = matrix.row_end();
-       m_iter != m_end; ++m_iter) {
-    typename OR_Matrix<N>::row_reference_type r = *m_iter;
-    assign_r(r[n_v], PLUS_INFINITY, ROUND_NOT_NEEDED);
-    assign_r(r[n_v + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::unconstrain(const Variable var) {
-  // Dimension-compatibility check.
-  const dimension_type var_id = var.id();
-  if (space_dimension() < var_id + 1)
-    throw_dimension_incompatible("unconstrain(var)", var_id + 1);
-
-  // Enforce strong closure for precision.
-  strong_closure_assign();
-
-  // If the shape is empty, this is a no-op.
-  if (marked_empty())
-    return;
-
-  forget_all_octagonal_constraints(var_id);
-  // Strong closure is preserved.
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::unconstrain(const Variables_Set& vars) {
-  // The cylindrification with respect to no dimensions is a no-op.
-  // This case captures the only legal cylindrification in a 0-dim space.
-  if (vars.empty())
-    return;
-
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dimension() < min_space_dim)
-    throw_dimension_incompatible("unconstrain(vs)", min_space_dim);
-
-  // Enforce strong closure for precision.
-  strong_closure_assign();
-
-  // If the shape is empty, this is a no-op.
-  if (marked_empty())
-    return;
-
-  for (Variables_Set::const_iterator vsi = vars.begin(),
-         vsi_end = vars.end(); vsi != vsi_end; ++vsi)
-    forget_all_octagonal_constraints(*vsi);
-  // Strong closure is preserved.
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::refine(const Variable var,
-                           const Relation_Symbol relsym,
-                           const Linear_Expression& expr,
-                           Coefficient_traits::const_reference denominator) {
-  PPL_ASSERT(denominator != 0);
-  PPL_ASSERT(space_dim >= expr.space_dimension());
-  const dimension_type var_id = var.id();
-  PPL_ASSERT(var_id <= space_dim);
-  PPL_ASSERT(expr.coefficient(var) == 0);
-  PPL_ASSERT(relsym != LESS_THAN && relsym != GREATER_THAN);
-
-  const Coefficient& b = expr.inhomogeneous_term();
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-
-  // Variable index of the last non-zero coefficient in `expr', if any.
-  dimension_type w_id = expr.last_nonzero();
-
-  if (w_id != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w_id))
-      ++t;
-    --w_id;
-  }
-
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*j + b, where `j != v';
-  // - If t == 2, then `expr' is of the general form.
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const dimension_type n_var = 2*var_id;
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign(minus_denom, denominator);
-
-  // Since we are only able to record octagonal differences, we can
-  // precisely deal with the case of a single variable only if its
-  // coefficient (taking into account the denominator) is 1.
-  // If this is not the case, we fall back to the general case
-  // so as to over-approximate the constraint.
-  if (t == 1 && expr.coefficient(Variable(w_id)) != denominator
-      && expr.coefficient(Variable(w_id)) != minus_denom)
-    t = 2;
-
-  if (t == 0) {
-    // Case 1: expr == b.
-    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
-    two_b = 2*b;
-    switch (relsym) {
-    case EQUAL:
-      // Add the constraint `var == b/denominator'.
-      add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
-      add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
-      break;
-    case LESS_OR_EQUAL:
-      // Add the constraint `var <= b/denominator'.
-      add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
-      break;
-    case GREATER_OR_EQUAL:
-      // Add the constraint `var >= b/denominator',
-      // i.e., `-var <= -b/denominator',
-      add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-  }
-  else if (t == 1) {
-    // Value of the one and only non-zero coefficient in `expr'.
-    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
-    const dimension_type n_w = 2*w_id;
-    switch (relsym) {
-    case EQUAL:
-      if (w_coeff == denominator)
-        // Add the new constraint `var - w = b/denominator'.
-        if (var_id < w_id) {
-          add_octagonal_constraint(n_w, n_var, b, denominator);
-          add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
-        }
-        else {
-          add_octagonal_constraint(n_var + 1, n_w + 1, b, denominator);
-          add_octagonal_constraint(n_var, n_w, b, minus_denom);
-        }
-      else
-        // Add the new constraint `var + w = b/denominator'.
-        if (var_id < w_id) {
-          add_octagonal_constraint(n_w + 1, n_var, b, denominator);
-          add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
-        }
-        else {
-          add_octagonal_constraint(n_var + 1, n_w, b, denominator);
-          add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
-        }
-      break;
-    case LESS_OR_EQUAL:
-      {
-        PPL_DIRTY_TEMP(N, d);
-        div_round_up(d, b, denominator);
-        // Note that: `w_id != v', so that `expr' is of the form
-        // w_coeff * w + b, with `w_id != v'.
-        if (w_coeff == denominator) {
-          // Add the new constraints `v - w <= b/denominator'.
-          if (var_id < w_id)
-            add_octagonal_constraint(n_w, n_var, d);
-          else
-            add_octagonal_constraint(n_var + 1, n_w + 1, d);
-        }
-        else if (w_coeff == minus_denom) {
-          // Add the new constraints `v + w <= b/denominator'.
-          if (var_id < w_id)
-            add_octagonal_constraint(n_w + 1, n_var, d);
-          else
-            add_octagonal_constraint(n_var + 1, n_w, d);
-        }
-        break;
-      }
-
-    case GREATER_OR_EQUAL:
-      {
-        PPL_DIRTY_TEMP(N, d);
-        div_round_up(d, b, minus_denom);
-        // Note that: `w_id != v', so that `expr' is of the form
-        // w_coeff * w + b, with `w_id != v'.
-        if (w_coeff == denominator) {
-          // Add the new constraint `v - w >= b/denominator',
-          // i.e.,  `-v + w <= -b/denominator'.
-          if (var_id < w_id)
-            add_octagonal_constraint(n_w + 1, n_var + 1, d);
-          else
-            add_octagonal_constraint(n_var, n_w, d);
-        }
-        else if (w_coeff == minus_denom) {
-          // Add the new constraints `v + w >= b/denominator',
-          // i.e.,  `-v - w <= -b/denominator'.
-          if (var_id < w_id)
-            add_octagonal_constraint(n_w, n_var + 1, d);
-          else
-            add_octagonal_constraint(n_var, n_w + 1, d);
-        }
-        break;
-      }
-
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-  }
-  else {
-    // Here t == 2, so that
-    // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2.
-    const bool is_sc = (denominator > 0);
-    PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-    neg_assign(minus_b, b);
-    const Coefficient& sc_b = is_sc ? b : minus_b;
-    const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-    const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-    const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-    // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-    // when `denominator' is negative. Do not use it unless you are sure
-    // it has been correctly assigned.
-    Linear_Expression minus_expr;
-    if (!is_sc)
-      minus_expr = -expr;
-    const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
-
-    PPL_DIRTY_TEMP(N, sum);
-    // Index of variable that is unbounded in `this'.
-    PPL_UNINITIALIZED(dimension_type, pinf_index);
-    // Number of unbounded variables found.
-    dimension_type pinf_count = 0;
-
-    switch (relsym) {
-    case EQUAL:
-      {
-        PPL_DIRTY_TEMP(N, neg_sum);
-        // Index of variable that is unbounded in `this'.
-        PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
-        // Number of unbounded variables found.
-        dimension_type neg_pinf_count = 0;
-
-        // Approximate the inhomogeneous term.
-        assign_r(sum, sc_b, ROUND_UP);
-        assign_r(neg_sum, minus_sc_b, ROUND_UP);
-
-        // Approximate the homogeneous part of `sc_expr'.
-        PPL_DIRTY_TEMP(N, coeff_i);
-        PPL_DIRTY_TEMP(N, half);
-        PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-        PPL_DIRTY_TEMP(N, minus_coeff_i);
-        // Note: indices above `w' can be disregarded, as they all have
-        // a zero coefficient in `sc_expr'.
-        for (Row_iterator m_iter = m_begin,
-               m_iter_end = m_begin + (2 * w_id + 2);
-             m_iter != m_iter_end; ) {
-          const dimension_type n_i = m_iter.index();
-          const dimension_type id = n_i/2;
-          Row_reference m_i = *m_iter;
-          ++m_iter;
-          Row_reference m_ci = *m_iter;
-          ++m_iter;
-          const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-          const int sign_i = sgn(sc_i);
-          if (sign_i > 0) {
-            assign_r(coeff_i, sc_i, ROUND_UP);
-            // Approximating `sc_expr'.
-            if (pinf_count <= 1) {
-              const N& double_approx_i = m_ci[n_i];
-              if (!is_plus_infinity(double_approx_i)) {
-                // Let half = double_approx_i / 2.
-                div_2exp_assign_r(half, double_approx_i, 1, ROUND_UP);
-                add_mul_assign_r(sum, coeff_i, half, ROUND_UP);
-              }
-              else {
-                ++pinf_count;
-                pinf_index = id;
-              }
-            }
-            // Approximating `-sc_expr'.
-            if (neg_pinf_count <= 1) {
-              const N& double_approx_minus_i = m_i[n_i + 1];
-              if (!is_plus_infinity(double_approx_minus_i)) {
-                // Let half = double_approx_minus_i / 2.
-                div_2exp_assign_r(half, double_approx_minus_i, 1, ROUND_UP);
-                add_mul_assign_r(neg_sum, coeff_i, half, ROUND_UP);
-              }
-              else {
-                ++neg_pinf_count;
-                neg_pinf_index = id;
-              }
-            }
-          }
-          else if (sign_i < 0) {
-            neg_assign_r(minus_sc_i, sc_i, ROUND_NOT_NEEDED);
-            assign_r(minus_coeff_i, minus_sc_i, ROUND_UP);
-            // Approximating `sc_expr'.
-            if (pinf_count <= 1) {
-              const N& double_approx_minus_i = m_i[n_i + 1];
-              if (!is_plus_infinity(double_approx_minus_i)) {
-                // Let half = double_approx_minus_i / 2.
-                div_2exp_assign_r(half, double_approx_minus_i, 1, ROUND_UP);
-                add_mul_assign_r(sum, minus_coeff_i, half, ROUND_UP);
-              }
-              else {
-                ++pinf_count;
-                pinf_index = id;
-              }
-            }
-            // Approximating `-sc_expr'.
-            if (neg_pinf_count <= 1) {
-              const N& double_approx_i = m_ci[n_i];
-              if (!is_plus_infinity(double_approx_i)) {
-                // Let half = double_approx_i / 2.
-                div_2exp_assign_r(half, double_approx_i, 1, ROUND_UP);
-                add_mul_assign_r(neg_sum, minus_coeff_i, half, ROUND_UP);
-              }
-              else {
-                ++neg_pinf_count;
-                neg_pinf_index = id;
-              }
-            }
-          }
-        }
-        // Return immediately if no approximation could be computed.
-        if (pinf_count > 1 && neg_pinf_count > 1) {
-          PPL_ASSERT(OK());
-          return;
-        }
-
-        // In the following, strong closure will be definitely lost.
-        reset_strongly_closed();
-
-        // Exploit the upper approximation, if possible.
-        if (pinf_count <= 1) {
-          // Compute quotient (if needed).
-          if (sc_denom != 1) {
-            // Before computing quotients, the denominator should be
-            // approximated towards zero. Since `sc_denom' is known to be
-            // positive, this amounts to rounding downwards, which is
-            // achieved as usual by rounding upwards `minus_sc_denom'
-            // and negating again the result.
-            PPL_DIRTY_TEMP(N, down_sc_denom);
-            assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-            neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-            div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-          }
-          // Add the upper bound constraint, if meaningful.
-          if (pinf_count == 0) {
-            // Add the constraint `v <= sum'.
-            PPL_DIRTY_TEMP(N, double_sum);
-            mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
-            matrix[n_var + 1][n_var] = double_sum;
-            // Deduce constraints of the form `v +/- u', where `u != v'.
-            deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, sum);
-          }
-          else
-            // Here `pinf_count == 1'.
-            if (pinf_index != var_id) {
-              const Coefficient& ppi
-                = sc_expr.coefficient(Variable(pinf_index));
-              if (ppi == sc_denom)
-                // Add the constraint `v - pinf_index <= sum'.
-                if (var_id < pinf_index)
-                  matrix[2*pinf_index][n_var] = sum;
-                else
-                  matrix[n_var + 1][2*pinf_index + 1] = sum;
-              else
-                if (ppi == minus_sc_denom) {
-                  // Add the constraint `v + pinf_index <= sum'.
-                  if (var_id < pinf_index)
-                    matrix[2*pinf_index + 1][n_var] = sum;
-                  else
-                    matrix[n_var + 1][2*pinf_index] = sum;
-                }
-            }
-        }
-
-        // Exploit the lower approximation, if possible.
-        if (neg_pinf_count <= 1) {
-          // Compute quotient (if needed).
-          if (sc_denom != 1) {
-            // Before computing quotients, the denominator should be
-            // approximated towards zero. Since `sc_denom' is known to be
-            // positive, this amounts to rounding downwards, which is
-            // achieved as usual by rounding upwards `minus_sc_denom'
-            // and negating again the result.
-            PPL_DIRTY_TEMP(N, down_sc_denom);
-            assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-            neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-            div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
-          }
-          // Add the lower bound constraint, if meaningful.
-          if (neg_pinf_count == 0) {
-            // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-            PPL_DIRTY_TEMP(N, double_neg_sum);
-            mul_2exp_assign_r(double_neg_sum, neg_sum, 1, ROUND_UP);
-            matrix[n_var][n_var + 1] = double_neg_sum;
-            // Deduce constraints of the form `-v +/- u', where `u != v'.
-            deduce_minus_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom,
-                                       neg_sum);
-          }
-          else
-            // Here `neg_pinf_count == 1'.
-            if (neg_pinf_index != var_id) {
-              const Coefficient& npi
-                = sc_expr.coefficient(Variable(neg_pinf_index));
-              if (npi == sc_denom)
-                // Add the constraint `v - neg_pinf_index >= -neg_sum',
-                // i.e., `neg_pinf_index - v <= neg_sum'.
-                if (neg_pinf_index < var_id)
-                  matrix[n_var][2*neg_pinf_index] = neg_sum;
-                else
-                  matrix[2*neg_pinf_index + 1][n_var + 1] = neg_sum;
-              else
-                if (npi == minus_sc_denom) {
-                  // Add the constraint `v + neg_pinf_index >= -neg_sum',
-                  // i.e., `-neg_pinf_index - v <= neg_sum'.
-                  if (neg_pinf_index < var_id)
-                    matrix[n_var][2*neg_pinf_index + 1] = neg_sum;
-                  else
-                    matrix[2*neg_pinf_index][n_var + 1] = neg_sum;
-                }
-            }
-        }
-        break;
-      }
-
-    case LESS_OR_EQUAL:
-      {
-        // Compute an upper approximation for `expr' into `sum',
-        // taking into account the sign of `denominator'.
-
-        // Approximate the inhomogeneous term.
-        assign_r(sum, sc_b, ROUND_UP);
-
-        // Approximate the homogeneous part of `sc_expr'.
-        PPL_DIRTY_TEMP(N, coeff_i);
-        PPL_DIRTY_TEMP(N, approx_i);
-        PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-        // Note: indices above `w_id' can be disregarded, as they all have
-        // a zero coefficient in `expr'.
-        for (Row_Iterator m_iter = m_begin,
-               m_iter_end = m_begin + (2 * w_id + 2);
-             m_iter != m_iter_end; ) {
-          const dimension_type n_i = m_iter.index();
-          const dimension_type id = n_i/2;
-          Row_Reference m_i = *m_iter;
-          ++m_iter;
-          Row_Reference m_ci = *m_iter;
-          ++m_iter;
-          const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-          const int sign_i = sgn(sc_i);
-          if (sign_i == 0)
-            continue;
-          // Choose carefully: we are approximating `sc_expr'.
-          const N& double_approx_i = (sign_i > 0) ? m_ci[n_i] : m_i[n_i + 1];
-          if (is_plus_infinity(double_approx_i)) {
-            if (++pinf_count > 1)
-              break;
-            pinf_index = id;
-            continue;
-          }
-          if (sign_i > 0)
-            assign_r(coeff_i, sc_i, ROUND_UP);
-          else {
-            neg_assign(minus_sc_i, sc_i);
-            assign_r(coeff_i, minus_sc_i, ROUND_UP);
-          }
-          div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
-          add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-        }
-        // Divide by the (sign corrected) denominator (if needed).
-        if (sc_denom != 1) {
-          // Before computing the quotient, the denominator should be
-          // approximated towards zero. Since `sc_denom' is known to be
-          // positive, this amounts to rounding downwards, which is achieved
-          // by rounding upwards `minus_sc-denom' and negating again the result.
-          PPL_DIRTY_TEMP(N, down_sc_denom);
-          assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-          neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-          div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-        }
-
-        if (pinf_count == 0) {
-          // Add the constraint `v <= sum'.
-          PPL_DIRTY_TEMP(N, double_sum);
-          mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
-          add_octagonal_constraint(n_var + 1, n_var, double_sum);
-          // Deduce constraints of the form `v +/- u', where `u != v'.
-          deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, sum);
-        }
-        else if (pinf_count == 1) {
-          dimension_type pinf_ind = 2*pinf_index;
-          if (expr.coefficient(Variable(pinf_index)) == denominator ) {
-            // Add the constraint `v - pinf_index <= sum'.
-            if (var_id < pinf_index)
-              add_octagonal_constraint(pinf_ind, n_var, sum);
-            else
-              add_octagonal_constraint(n_var + 1, pinf_ind + 1, sum);
-          }
-          else {
-            if (expr.coefficient(Variable(pinf_index)) == minus_denom) {
-              // Add the constraint `v + pinf_index <= sum'.
-              if (var_id < pinf_index)
-                add_octagonal_constraint(pinf_ind + 1, n_var, sum);
-              else
-                add_octagonal_constraint(n_var + 1, pinf_ind, sum);
-            }
-          }
-        }
-        break;
-      }
-
-    case GREATER_OR_EQUAL:
-      {
-        // Compute an upper approximation for `-sc_expr' into `sum'.
-        // Note: approximating `-sc_expr' from above and then negating the
-        // result is the same as approximating `sc_expr' from below.
-
-        // Approximate the inhomogeneous term.
-        assign_r(sum, minus_sc_b, ROUND_UP);
-
-        // Approximate the homogeneous part of `-sc_expr'.
-        PPL_DIRTY_TEMP(N, coeff_i);
-        PPL_DIRTY_TEMP(N, approx_i);
-        PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-        for (Row_Iterator m_iter = m_begin,
-               m_iter_end = m_begin + (2 * w_id + 2);
-             m_iter != m_iter_end; ) {
-          const dimension_type n_i = m_iter.index();
-          const dimension_type id = n_i/2;
-          Row_Reference m_i = *m_iter;
-          ++m_iter;
-          Row_Reference m_ci = *m_iter;
-          ++m_iter;
-          const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-          const int sign_i = sgn(sc_i);
-          if (sign_i == 0)
-            continue;
-          // Choose carefully: we are approximating `-sc_expr'.
-          const N& double_approx_i = (sign_i > 0) ? m_i[n_i + 1] : m_ci[n_i];
-          if (is_plus_infinity(double_approx_i)) {
-            if (++pinf_count > 1)
-              break;
-            pinf_index = id;
-            continue;
-          }
-          if (sign_i > 0)
-            assign_r(coeff_i, sc_i, ROUND_UP);
-          else {
-            neg_assign(minus_sc_i, sc_i);
-            assign_r(coeff_i, minus_sc_i, ROUND_UP);
-          }
-          div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
-          add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-        }
-
-        // Divide by the (sign corrected) denominator (if needed).
-        if (sc_denom != 1) {
-          // Before computing the quotient, the denominator should be
-          // approximated towards zero. Since `sc_denom' is known to be
-          // positive, this amounts to rounding downwards, which is
-          // achieved by rounding upwards `minus_sc_denom' and
-          // negating again the result.
-          PPL_DIRTY_TEMP(N, down_sc_denom);
-          assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-          neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-          div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-        }
-
-        if (pinf_count == 0) {
-          // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-          PPL_DIRTY_TEMP(N, double_sum);
-          mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
-          add_octagonal_constraint(n_var, n_var + 1, double_sum);
-          // Deduce constraints of the form `-v +/- u', where `u != v'.
-          deduce_minus_v_pm_u_bounds(var_id, pinf_index, sc_expr, sc_denom,
-                                     sum);
-        }
-        else if (pinf_count == 1) {
-          dimension_type pinf_ind = 2*pinf_index;
-          if (expr.coefficient(Variable(pinf_index)) == denominator) {
-            // Add the constraint `v - pinf_index >= -sum',
-            // i.e., `pinf_index - v <= sum'.
-            if (pinf_index < var_id)
-              add_octagonal_constraint(n_var, pinf_ind, sum);
-            else
-              add_octagonal_constraint(pinf_ind + 1, n_var, sum);
-          }
-          else {
-            if (expr.coefficient(Variable(pinf_index)) == minus_denom) {
-              // Add the constraint `v + pinf_index >= -sum',
-              // i.e., `-pinf_index - v <= sum'.
-              if (pinf_index < var_id)
-                add_octagonal_constraint(n_var, pinf_ind + 1, sum);
-              else
-                add_octagonal_constraint(pinf_ind, n_var + 1, sum);
-            }
-          }
-        }
-        break;
-      }
-
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::affine_image(const Variable var,
-                                 const Linear_Expression& expr,
-                                 Coefficient_traits::const_reference
-                                 denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("affine_image(v, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("affine_image(v, e, d)", "e", expr);
-
-  // `var' should be one of the dimensions of the octagon.
-  const dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("affine_image(v, e, d)", var_id + 1);
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty too.
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Variable-index of the last non-zero coefficient in `expr', if any.
-  dimension_type w_id = expr.last_nonzero();
-
-  if (w_id != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w_id))
-      ++t;
-    --w_id;
-  }
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-  using std::swap;
-
-  const dimension_type n_var = 2*var_id;
-  const Coefficient& b = expr.inhomogeneous_term();
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign_r(minus_denom, denominator, ROUND_NOT_NEEDED);
-
-  // `w' is the variable with index `w_id'.
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `expr' is of the general form.
-
-  if (t == 0) {
-    // Case 1: expr == b.
-    // Remove all constraints on `var'.
-    forget_all_octagonal_constraints(var_id);
-    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
-    two_b = 2*b;
-    // Add the constraint `var == b/denominator'.
-    add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
-    add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // The one and only non-zero homogeneous coefficient in `expr'.
-    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
-    if (w_coeff == denominator || w_coeff == minus_denom) {
-      // Case 2: expr = w_coeff*w + b, with w_coeff = +/- denominator.
-      if (w_id == var_id) {
-        // Here `expr' is of the form: +/- denominator * v + b.
-        const bool sign_symmetry = (w_coeff != denominator);
-        if (!sign_symmetry && b == 0)
-          // The transformation is the identity function.
-          return;
-        // Translate all the constraints on `var' adding or
-        // subtracting the value `b/denominator'.
-        PPL_DIRTY_TEMP(N, d);
-        div_round_up(d, b, denominator);
-        PPL_DIRTY_TEMP(N, minus_d);
-        div_round_up(minus_d, b, minus_denom);
-        if (sign_symmetry)
-          swap(d, minus_d);
-        const Row_Iterator m_begin = matrix.row_begin();
-        const Row_Iterator m_end = matrix.row_end();
-        Row_Iterator m_iter = m_begin + n_var;
-        Row_Reference m_v = *m_iter;
-        ++m_iter;
-        Row_Reference m_cv = *m_iter;
-        ++m_iter;
-        // NOTE: delay update of unary constraints on `var'.
-        for (dimension_type j = n_var; j-- > 0; ) {
-          N& m_v_j = m_v[j];
-          add_assign_r(m_v_j, m_v_j, minus_d, ROUND_UP);
-          N& m_cv_j = m_cv[j];
-          add_assign_r(m_cv_j, m_cv_j, d, ROUND_UP);
-          if (sign_symmetry)
-            swap(m_v_j, m_cv_j);
-        }
-        for ( ; m_iter != m_end; ++m_iter) {
-          Row_Reference m_i = *m_iter;
-          N& m_i_v = m_i[n_var];
-          add_assign_r(m_i_v, m_i_v, d, ROUND_UP);
-          N& m_i_cv = m_i[n_var + 1];
-          add_assign_r(m_i_cv, m_i_cv, minus_d, ROUND_UP);
-          if (sign_symmetry)
-            swap(m_i_v, m_i_cv);
-        }
-        // Now update unary constraints on var.
-        mul_2exp_assign_r(d, d, 1, ROUND_UP);
-        N& m_cv_v = m_cv[n_var];
-        add_assign_r(m_cv_v, m_cv_v, d, ROUND_UP);
-        mul_2exp_assign_r(minus_d, minus_d, 1, ROUND_UP);
-        N& m_v_cv = m_v[n_var + 1];
-        add_assign_r(m_v_cv, m_v_cv, minus_d, ROUND_UP);
-        if (sign_symmetry)
-          swap(m_cv_v, m_v_cv);
-        // Note: strong closure is preserved.
-      }
-      else {
-        // Here `w != var', so that `expr' is of the form
-        // +/-denominator * w + b.
-        // Remove all constraints on `var'.
-        forget_all_octagonal_constraints(var_id);
-        const dimension_type n_w = 2*w_id;
-        // Add the new constraint `var - w = b/denominator'.
-        if (w_coeff == denominator) {
-          if (var_id < w_id) {
-            add_octagonal_constraint(n_w, n_var, b, denominator);
-            add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
-          }
-          else {
-            add_octagonal_constraint(n_var + 1, n_w + 1, b, denominator);
-            add_octagonal_constraint(n_var, n_w, b, minus_denom);
-          }
-        }
-        else {
-          // Add the new constraint `var + w = b/denominator'.
-          if (var_id < w_id) {
-            add_octagonal_constraint(n_w + 1, n_var, b, denominator);
-            add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
-          }
-          else {
-            add_octagonal_constraint(n_var + 1, n_w, b, denominator);
-            add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
-          }
-        }
-        incremental_strong_closure_assign(var);
-      }
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t == 1, expr == a*w + b, but a <> +/- denominator.
-  // We will remove all the constraints on `var' and add back
-  // constraints providing upper and lower bounds for `var'.
-
-  // Compute upper approximations for `expr' and `-expr'
-  // into `pos_sum' and `neg_sum', respectively, taking into account
-  // the sign of `denominator'.
-  // Note: approximating `-expr' from above and then negating the
-  // result is the same as approximating `expr' from below.
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign_r(minus_b, b, ROUND_NOT_NEEDED);
-
-  const Coefficient& sc_b = is_sc ? b : minus_b;
-  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -expr;
-  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, pos_sum);
-  PPL_DIRTY_TEMP(N, neg_sum);
-  // Indices of the variables that are unbounded in `this->matrix'.
-  PPL_UNINITIALIZED(dimension_type, pos_pinf_index);
-  PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
-  // Number of unbounded variables found.
-  dimension_type pos_pinf_count = 0;
-  dimension_type neg_pinf_count = 0;
-
-  // Approximate the inhomogeneous term.
-  assign_r(pos_sum, sc_b, ROUND_UP);
-  assign_r(neg_sum, minus_sc_b, ROUND_UP);
-
-  // Approximate the homogeneous part of `sc_expr'.
-  PPL_DIRTY_TEMP(N, coeff_i);
-  PPL_DIRTY_TEMP(N, minus_coeff_i);
-  PPL_DIRTY_TEMP(N, half);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-  // Note: indices above `w' can be disregarded, as they all have
-  // a zero coefficient in `sc_expr'.
-  const Row_Iterator m_begin = matrix.row_begin();
-  for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
-       m_iter != m_iter_end; ) {
-    const dimension_type n_i = m_iter.index();
-    const dimension_type id = n_i/2;
-    Row_reference m_i = *m_iter;
-    ++m_iter;
-    Row_reference m_ci = *m_iter;
-    ++m_iter;
-    const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-    const int sign_i = sgn(sc_i);
-    if (sign_i > 0) {
-      assign_r(coeff_i, sc_i, ROUND_UP);
-      // Approximating `sc_expr'.
-      if (pos_pinf_count <= 1) {
-        const N& double_up_approx_i = m_ci[n_i];
-        if (!is_plus_infinity(double_up_approx_i)) {
-          // Let half = double_up_approx_i / 2.
-          div_2exp_assign_r(half, double_up_approx_i, 1, ROUND_UP);
-          add_mul_assign_r(pos_sum, coeff_i, half, ROUND_UP);
-        }
-        else {
-          ++pos_pinf_count;
-          pos_pinf_index = id;
-        }
-      }
-      // Approximating `-sc_expr'.
-      if (neg_pinf_count <= 1) {
-        const N& double_up_approx_minus_i = m_i[n_i + 1];
-        if (!is_plus_infinity(double_up_approx_minus_i)) {
-          // Let half = double_up_approx_minus_i / 2.
-          div_2exp_assign_r(half, double_up_approx_minus_i, 1, ROUND_UP);
-          add_mul_assign_r(neg_sum, coeff_i, half, ROUND_UP);
-        }
-        else {
-          ++neg_pinf_count;
-          neg_pinf_index = id;
-        }
-      }
-    }
-    else if (sign_i < 0) {
-      neg_assign_r(minus_sc_i, sc_i, ROUND_NOT_NEEDED);
-      assign_r(minus_coeff_i, minus_sc_i, ROUND_UP);
-      // Approximating `sc_expr'.
-      if (pos_pinf_count <= 1) {
-        const N& double_up_approx_minus_i = m_i[n_i + 1];
-        if (!is_plus_infinity(double_up_approx_minus_i)) {
-          // Let half = double_up_approx_minus_i / 2.
-          div_2exp_assign_r(half, double_up_approx_minus_i, 1, ROUND_UP);
-          add_mul_assign_r(pos_sum, minus_coeff_i, half, ROUND_UP);
-        }
-        else {
-          ++pos_pinf_count;
-          pos_pinf_index = id;
-        }
-      }
-      // Approximating `-sc_expr'.
-      if (neg_pinf_count <= 1) {
-        const N& double_up_approx_i = m_ci[n_i];
-        if (!is_plus_infinity(double_up_approx_i)) {
-          // Let half = double_up_approx_i / 2.
-          div_2exp_assign_r(half, double_up_approx_i, 1, ROUND_UP);
-          add_mul_assign_r(neg_sum, minus_coeff_i, half, ROUND_UP);
-        }
-        else {
-          ++neg_pinf_count;
-          neg_pinf_index = id;
-        }
-      }
-    }
-  }
-
-  // Remove all constraints on `var'.
-  forget_all_octagonal_constraints(var_id);
-  // Return immediately if no approximation could be computed.
-  if (pos_pinf_count > 1 && neg_pinf_count > 1) {
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // In the following, strong closure will be definitely lost.
-  reset_strongly_closed();
-
-  // Exploit the upper approximation, if possible.
-  if (pos_pinf_count <= 1) {
-    // Compute quotient (if needed).
-    if (sc_denom != 1) {
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(pos_sum, pos_sum, down_sc_denom, ROUND_UP);
-    }
-    // Add the upper bound constraint, if meaningful.
-    if (pos_pinf_count == 0) {
-      // Add the constraint `v <= pos_sum'.
-      PPL_DIRTY_TEMP(N, double_pos_sum);
-      mul_2exp_assign_r(double_pos_sum, pos_sum, 1, ROUND_UP);
-      matrix[n_var + 1][n_var] = double_pos_sum;
-      // Deduce constraints of the form `v +/- u', where `u != v'.
-      deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, pos_sum);
-    }
-    else
-      // Here `pos_pinf_count == 1'.
-      if (pos_pinf_index != var_id) {
-        const Coefficient& ppi = sc_expr.coefficient(Variable(pos_pinf_index));
-        if (ppi == sc_denom)
-          // Add the constraint `v - pos_pinf_index <= pos_sum'.
-          if (var_id < pos_pinf_index)
-            matrix[2*pos_pinf_index][n_var] = pos_sum;
-          else
-            matrix[n_var + 1][2*pos_pinf_index + 1] = pos_sum;
-        else
-          if (ppi == minus_sc_denom) {
-            // Add the constraint `v + pos_pinf_index <= pos_sum'.
-            if (var_id < pos_pinf_index)
-              matrix[2*pos_pinf_index + 1][n_var] = pos_sum;
-            else
-              matrix[n_var + 1][2*pos_pinf_index] = pos_sum;
-          }
-      }
-  }
-
-  // Exploit the lower approximation, if possible.
-  if (neg_pinf_count <= 1) {
-    // Compute quotient (if needed).
-    if (sc_denom != 1) {
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
-    }
-    // Add the lower bound constraint, if meaningful.
-    if (neg_pinf_count == 0) {
-      // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-      PPL_DIRTY_TEMP(N, double_neg_sum);
-      mul_2exp_assign_r(double_neg_sum, neg_sum, 1, ROUND_UP);
-      matrix[n_var][n_var + 1] = double_neg_sum;
-      // Deduce constraints of the form `-v +/- u', where `u != v'.
-      deduce_minus_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, neg_sum);
-    }
-    else
-      // Here `neg_pinf_count == 1'.
-      if (neg_pinf_index != var_id) {
-        const Coefficient& npi = sc_expr.coefficient(Variable(neg_pinf_index));
-        if (npi == sc_denom)
-          // Add the constraint `v - neg_pinf_index >= -neg_sum',
-          // i.e., `neg_pinf_index - v <= neg_sum'.
-          if (neg_pinf_index < var_id)
-            matrix[n_var][2*neg_pinf_index] = neg_sum;
-          else
-            matrix[2*neg_pinf_index + 1][n_var + 1] = neg_sum;
-        else
-          if (npi == minus_sc_denom) {
-            // Add the constraint `v + neg_pinf_index >= -neg_sum',
-            // i.e., `-neg_pinf_index - v <= neg_sum'.
-            if (neg_pinf_index < var_id)
-              matrix[n_var][2*neg_pinf_index + 1] = neg_sum;
-            else
-              matrix[2*neg_pinf_index][n_var + 1] = neg_sum;
-          }
-      }
-  }
-
-  incremental_strong_closure_assign(var);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-Octagonal_Shape<T>::affine_form_image(const Variable var,
-                    const Linear_Form< Interval<T, Interval_Info> >& lf) {
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-    "Octagonal_Shape<T>::affine_form_image(Variable, Linear_Form):"
-    " T is not a floating point type.");
-
-  // Dimension-compatibility checks.
-  // The dimension of `lf' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type lf_space_dim = lf.space_dimension();
-  if (space_dim < lf_space_dim)
-    throw_dimension_incompatible("affine_form_image(v, l)", "l", lf);
-
-  // `var' should be one of the dimensions of the octagon.
-  const dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("affine_form_image(v, l)", var.id() + 1);
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty too.
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lf': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Variable-index of the last non-zero coefficient in `lf', if any.
-  dimension_type w_id = 0;
-
-  // Get information about the number of non-zero coefficients in `lf'.
-  for (dimension_type i = lf_space_dim; i-- > 0; )
-    if (lf.coefficient(Variable(i)) != 0) {
-      if (t++ == 1)
-        break;
-      else
-        w_id = i;
-    }
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-  using std::swap;
-
-  const dimension_type n_var = 2*var_id;
-  const FP_Interval_Type& b = lf.inhomogeneous_term();
-
-  // `w' is the variable with index `w_id'.
-  // Now we know the form of `lf':
-  // - If t == 0, then lf == [lb, ub];
-  // - If t == 1, then lf == a*w + [lb, ub], where `w' can be `v' or another
-  //   variable;
-  // - If t == 2, the `lf' is of the general form.
-
-  PPL_DIRTY_TEMP(N, b_ub);
-  assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
-  PPL_DIRTY_TEMP(N, b_mlb);
-  neg_assign_r(b_mlb, b.lower(), ROUND_NOT_NEEDED);
-
-  if (t == 0) {
-    // Case 1: lf = [lb, ub].
-    forget_all_octagonal_constraints(var_id);
-    mul_2exp_assign_r(b_mlb, b_mlb, 1, ROUND_UP);
-    mul_2exp_assign_r(b_ub, b_ub, 1, ROUND_UP);
-    // Add the constraint `var >= lb && var <= ub'.
-    add_octagonal_constraint(n_var + 1, n_var, b_ub);
-    add_octagonal_constraint(n_var, n_var + 1, b_mlb);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  // True if `b' is in [0, 0].
-  bool is_b_zero = (b_mlb == 0 && b_ub == 0);
-
-  if (t == 1) {
-    // The one and only non-zero homogeneous coefficient in `lf'.
-    const FP_Interval_Type& w_coeff = lf.coefficient(Variable(w_id));
-    // True if `w_coeff' is in [1, 1].
-    bool is_w_coeff_one = (w_coeff == 1);
-    // True if `w_coeff' is in [-1, -1].
-    bool is_w_coeff_minus_one = (w_coeff == -1);
-    if (is_w_coeff_one || is_w_coeff_minus_one) {
-      // Case 2: lf = w_coeff*w + b, with w_coeff = [+/-1, +/-1].
-      if (w_id == var_id) {
-        // Here lf = w_coeff*v + b, with w_coeff = [+/-1, +/-1].
-        if (is_w_coeff_one && is_b_zero)
-          // The transformation is the identity function.
-          return;
-        // Translate all the constraints on `var' by adding the value
-        // `b_ub' or subtracting the value `b_lb'.
-        if (is_w_coeff_minus_one)
-          swap(b_ub, b_mlb);
-        const Row_Iterator m_begin = matrix.row_begin();
-        const Row_Iterator m_end = matrix.row_end();
-        Row_Iterator m_iter = m_begin + n_var;
-        Row_Reference m_v = *m_iter;
-        ++m_iter;
-        Row_Reference m_cv = *m_iter;
-        ++m_iter;
-        // NOTE: delay update of unary constraints on `var'.
-        for (dimension_type j = n_var; j-- > 0; ) {
-          N& m_v_j = m_v[j];
-          add_assign_r(m_v_j, m_v_j, b_mlb, ROUND_UP);
-          N& m_cv_j = m_cv[j];
-          add_assign_r(m_cv_j, m_cv_j, b_ub, ROUND_UP);
-          if (is_w_coeff_minus_one)
-            swap(m_v_j, m_cv_j);
-        }
-        for ( ; m_iter != m_end; ++m_iter) {
-          Row_Reference m_i = *m_iter;
-          N& m_i_v = m_i[n_var];
-          add_assign_r(m_i_v, m_i_v, b_ub, ROUND_UP);
-          N& m_i_cv = m_i[n_var + 1];
-          add_assign_r(m_i_cv, m_i_cv, b_mlb, ROUND_UP);
-          if (is_w_coeff_minus_one)
-            swap(m_i_v, m_i_cv);
-        }
-        // Now update unary constraints on var.
-        mul_2exp_assign_r(b_ub, b_ub, 1, ROUND_UP);
-        N& m_cv_v = m_cv[n_var];
-        add_assign_r(m_cv_v, m_cv_v, b_ub, ROUND_UP);
-        mul_2exp_assign_r(b_mlb, b_mlb, 1, ROUND_UP);
-        N& m_v_cv = m_v[n_var + 1];
-        add_assign_r(m_v_cv, m_v_cv, b_mlb, ROUND_UP);
-        if (is_w_coeff_minus_one)
-          swap(m_cv_v, m_v_cv);
-        // Note: strong closure is preserved.
-      }
-      else {
-        // Here `w != var', so that `lf' is of the form
-        // [+/-1, +/-1] * w + b.
-        // Remove all constraints on `var'.
-        forget_all_octagonal_constraints(var_id);
-        const dimension_type n_w = 2*w_id;
-        if (is_w_coeff_one)
-          // Add the new constraints `var - w >= b_lb'
-          // `and var - w <= b_ub'.
-          if (var_id < w_id) {
-            add_octagonal_constraint(n_w, n_var, b_ub);
-            add_octagonal_constraint(n_w + 1, n_var + 1, b_mlb);
-          }
-          else {
-            add_octagonal_constraint(n_var + 1, n_w + 1, b_ub);
-            add_octagonal_constraint(n_var, n_w, b_mlb);
-          }
-        else
-          // Add the new constraints `var + w >= b_lb'
-          // `and var + w <= b_ub'.
-          if (var_id < w_id) {
-            add_octagonal_constraint(n_w + 1, n_var, b_ub);
-            add_octagonal_constraint(n_w, n_var + 1, b_mlb);
-          }
-          else {
-            add_octagonal_constraint(n_var + 1, n_w, b_ub);
-            add_octagonal_constraint(n_var, n_w + 1, b_mlb);
-          }
-        incremental_strong_closure_assign(var);
-      }
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr == i_1*x_1 + i_2*x_2 + ... + i_n*x_n + b, where n >= 2,
-  // or t == 1, expr == i*w + b, but i <> [+/-1, +/-1].
-
-  // In the following, strong closure will be definitely lost.
-  reset_strongly_closed();
-
-  Linear_Form<FP_Interval_Type> minus_lf(lf);
-  minus_lf.negate();
-
-  // Declare temporaries outside the loop.
-  PPL_DIRTY_TEMP(N, upper_bound);
-
-  Row_Iterator m_iter = matrix.row_begin();
-  m_iter += n_var;
-  Row_Reference var_ite = *m_iter;
-  ++m_iter;
-  Row_Reference var_cv_ite = *m_iter;
-  ++m_iter;
-  Row_Iterator m_end = matrix.row_end();
-
-  // Update binary constraints on var FIRST.
-  for (dimension_type curr_var = var_id,
-         n_curr_var = n_var - 2; curr_var-- > 0; ) {
-    Variable current(curr_var);
-    linear_form_upper_bound(lf + current, upper_bound);
-    assign_r(var_cv_ite[n_curr_var], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(lf - current, upper_bound);
-    assign_r(var_cv_ite[n_curr_var + 1], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(minus_lf + current, upper_bound);
-    assign_r(var_ite[n_curr_var], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(minus_lf - current, upper_bound);
-    assign_r(var_ite[n_curr_var + 1], upper_bound, ROUND_NOT_NEEDED);
-    n_curr_var -= 2;
-  }
-  for (dimension_type curr_var = var_id + 1; m_iter != m_end; ++m_iter) {
-    Row_Reference m_v_ite = *m_iter;
-    ++m_iter;
-    Row_Reference m_cv_ite = *m_iter;
-    Variable current(curr_var);
-    linear_form_upper_bound(lf + current, upper_bound);
-    assign_r(m_cv_ite[n_var], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(lf - current, upper_bound);
-    assign_r(m_v_ite[n_var], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(minus_lf + current, upper_bound);
-    assign_r(m_cv_ite[n_var + 1], upper_bound, ROUND_NOT_NEEDED);
-    linear_form_upper_bound(minus_lf - current, upper_bound);
-    assign_r(m_v_ite[n_var + 1], upper_bound, ROUND_NOT_NEEDED);
-    ++curr_var;
-  }
-
-  // Finally, update unary constraints on var.
-  PPL_DIRTY_TEMP(N, lf_ub);
-  linear_form_upper_bound(lf, lf_ub);
-  PPL_DIRTY_TEMP(N, minus_lf_ub);
-  linear_form_upper_bound(minus_lf, minus_lf_ub);
-  mul_2exp_assign_r(lf_ub, lf_ub, 1, ROUND_UP);
-  assign_r(matrix[n_var + 1][n_var], lf_ub, ROUND_NOT_NEEDED);
-  mul_2exp_assign_r(minus_lf_ub, minus_lf_ub, 1, ROUND_UP);
-  assign_r(matrix[n_var][n_var + 1], minus_lf_ub, ROUND_NOT_NEEDED);
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename Interval_Info>
-void
-Octagonal_Shape<T>::
-linear_form_upper_bound(const Linear_Form< Interval<T, Interval_Info> >& lf,
-                        N& result) const {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-                     "Octagonal_Shape<T>::linear_form_upper_bound:"
-                     " T not a floating point type.");
-
-  const dimension_type lf_space_dimension = lf.space_dimension();
-  PPL_ASSERT(lf_space_dimension <= space_dim);
-
-  typedef Interval<T, Interval_Info> FP_Interval_Type;
-
-  PPL_DIRTY_TEMP(N, curr_lb);
-  PPL_DIRTY_TEMP(N, curr_ub);
-  PPL_DIRTY_TEMP(N, curr_var_ub);
-  PPL_DIRTY_TEMP(N, curr_minus_var_ub);
-
-  PPL_DIRTY_TEMP(N, first_comparison_term);
-  PPL_DIRTY_TEMP(N, second_comparison_term);
-
-  PPL_DIRTY_TEMP(N, negator);
-
-  assign_r(result, lf.inhomogeneous_term().upper(), ROUND_NOT_NEEDED);
-
-  for (dimension_type curr_var = 0, n_var = 0; curr_var < lf_space_dimension;
-       ++curr_var) {
-    const FP_Interval_Type& curr_coefficient =
-                            lf.coefficient(Variable(curr_var));
-    assign_r(curr_lb, curr_coefficient.lower(), ROUND_NOT_NEEDED);
-    assign_r(curr_ub, curr_coefficient.upper(), ROUND_NOT_NEEDED);
-    if (curr_lb != 0 || curr_ub != 0) {
-      assign_r(curr_var_ub, matrix[n_var + 1][n_var], ROUND_NOT_NEEDED);
-      div_2exp_assign_r(curr_var_ub, curr_var_ub, 1, ROUND_UP);
-      neg_assign_r(curr_minus_var_ub, matrix[n_var][n_var + 1],
-                   ROUND_NOT_NEEDED);
-      div_2exp_assign_r(curr_minus_var_ub, curr_minus_var_ub, 1, ROUND_DOWN);
-      // Optimize the most common case: curr = +/-[1, 1].
-      if (curr_lb == 1 && curr_ub == 1) {
-        add_assign_r(result, result, std::max(curr_var_ub, curr_minus_var_ub),
-                     ROUND_UP);
-      }
-      else if (curr_lb == -1 && curr_ub == -1) {
-        neg_assign_r(negator, std::min(curr_var_ub, curr_minus_var_ub),
-                     ROUND_NOT_NEEDED);
-        add_assign_r(result, result, negator, ROUND_UP);
-      }
-      else {
-        // Next addend will be the maximum of four quantities.
-        assign_r(first_comparison_term, 0, ROUND_NOT_NEEDED);
-        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-        add_mul_assign_r(first_comparison_term, curr_var_ub, curr_ub,
-                         ROUND_UP);
-        add_mul_assign_r(second_comparison_term, curr_var_ub, curr_lb,
-                         ROUND_UP);
-        assign_r(first_comparison_term, std::max(first_comparison_term,
-                                                 second_comparison_term),
-                 ROUND_NOT_NEEDED);
-        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_ub,
-                         ROUND_UP);
-        assign_r(first_comparison_term, std::max(first_comparison_term,
-                                                 second_comparison_term),
-                 ROUND_NOT_NEEDED);
-        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_lb,
-                         ROUND_UP);
-        assign_r(first_comparison_term, std::max(first_comparison_term,
-                                                 second_comparison_term),
-                 ROUND_NOT_NEEDED);
-
-        add_assign_r(result, result, first_comparison_term, ROUND_UP);
-      }
-    }
-
-    n_var += 2;
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::
-interval_coefficient_upper_bound(const N& var_ub, const N& minus_var_ub,
-                                 const N& int_ub, const N& int_lb,
-                                 N& result) {
-
-  // Check that T is a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-                     "Octagonal_Shape<T>::interval_coefficient_upper_bound:"
-                     " T not a floating point type.");
-
-  // NOTE: we store the first comparison term directly into result.
-  PPL_DIRTY_TEMP(N, second_comparison_term);
-  PPL_DIRTY_TEMP(N, third_comparison_term);
-  PPL_DIRTY_TEMP(N, fourth_comparison_term);
-
-  assign_r(result, 0, ROUND_NOT_NEEDED);
-  assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
-  assign_r(third_comparison_term, 0, ROUND_NOT_NEEDED);
-  assign_r(fourth_comparison_term, 0, ROUND_NOT_NEEDED);
-
-  add_mul_assign_r(result, var_ub, int_ub, ROUND_UP);
-  add_mul_assign_r(second_comparison_term, minus_var_ub, int_ub, ROUND_UP);
-  add_mul_assign_r(third_comparison_term, var_ub, int_lb, ROUND_UP);
-  add_mul_assign_r(fourth_comparison_term, minus_var_ub, int_lb, ROUND_UP);
-
-  assign_r(result, std::max(result, second_comparison_term), ROUND_NOT_NEEDED);
-  assign_r(result, std::max(result, third_comparison_term), ROUND_NOT_NEEDED);
-  assign_r(result, std::max(result, fourth_comparison_term), ROUND_NOT_NEEDED);
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::affine_preimage(const Variable var,
-                                    const Linear_Expression& expr,
-                                    Coefficient_traits::const_reference
-                                    denominator) {
-
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("affine_preimage(v, e, d)", "e", expr);
-
-  // `var' should be one of the dimensions of the octagon.
-  dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("affine_preimage(v, e, d)", var_id + 1);
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty too.
-  if (marked_empty())
-    return;
-
-  const Coefficient& b = expr.inhomogeneous_term();
-
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-
-  // Variable-index of the last non-zero coefficient in `expr', if any.
-  dimension_type w_id = expr.last_nonzero();
-
-  if (w_id != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w_id))
-      ++t;
-    --w_id;
-  }
-
-  // `w' is the variable with index `w_id'.
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `expr' is of the general form.
-
-  if (t == 0) {
-    // Case 1: expr = n; remove all constraints on `var'.
-    forget_all_octagonal_constraints(var_id);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // Value of the one and only non-zero coefficient in `expr'.
-    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
-    if (w_coeff == denominator || w_coeff == -denominator) {
-      // Case 2: expr = w_coeff*w + b, with w_coeff = +/- denominator.
-      if (w_id == var_id) {
-        // Apply affine_image() on the inverse of this transformation.
-        affine_image(var, denominator*var - b, w_coeff);
-      }
-      else {
-        // `expr == w_coeff*w + b', where `w != var'.
-        // Remove all constraints on `var'.
-        forget_all_octagonal_constraints(var_id);
-        PPL_ASSERT(OK());
-      }
-      return;
-    }
-  }
-  // General case.
-  // Either t == 2, so that
-  // expr = a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t = 1, expr = a*w + b, but a <> +/- denominator.
-  const Coefficient& coeff_v = expr.coefficient(var);
-  if (coeff_v != 0) {
-    if (coeff_v > 0) {
-      // The transformation is invertible.
-      Linear_Expression inverse = ((coeff_v + denominator)*var);
-      inverse -= expr;
-      affine_image(var, inverse, coeff_v);
-    }
-    else {
-      // The transformation is invertible.
-      PPL_DIRTY_TEMP_COEFFICIENT(minus_coeff_v);
-      neg_assign(minus_coeff_v, coeff_v);
-      Linear_Expression inverse = ((minus_coeff_v - denominator)*var);
-      inverse += expr;
-      affine_image(var, inverse, minus_coeff_v);
-    }
-  }
-  else {
-    // The transformation is not invertible: all constraints on `var' are lost.
-    forget_all_octagonal_constraints(var_id);
-    PPL_ASSERT(OK());
-  }
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::generalized_affine_image(const Variable var,
-                           const Relation_Symbol relsym,
-                           const Linear_Expression&  expr ,
-                           Coefficient_traits::const_reference denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)", "e",
-                                 expr);
-
-  // `var' should be one of the dimensions of the octagon.
-  dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-                                 var_id + 1);
-
-  // The relation symbol cannot be a strict relation symbol.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-                           "r is the disequality relation symbol");
-
-  if (relsym == EQUAL) {
-    // The relation symbol is "=":
-    // this is just an affine image computation.
-    affine_image(var, expr, denominator);
-    return;
-  }
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty too.
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Variable-index of the last non-zero coefficient in `expr', if any.
-  dimension_type w_id = expr.last_nonzero();
-
-  if (w_id != 0) {
-    ++t;
-    if (!expr.all_zeroes(1, w_id))
-      ++t;
-    --w_id;
-  }
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
-  const dimension_type n_var = 2*var_id;
-  const Coefficient& b = expr.inhomogeneous_term();
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign_r(minus_denom, denominator, ROUND_NOT_NEEDED);
-
-  // `w' is the variable with index `w_id'.
-  // Now we know the form of `expr':
-  // - If t == 0, then expr == b, with `b' a constant;
-  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `expr' is of the general form.
-
-  if (t == 0) {
-    // Case 1: expr = b.
-    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
-    two_b = 2*b;
-    // Remove all constraints on `var'.
-    forget_all_octagonal_constraints(var_id);
-    // Strong closure is lost.
-    reset_strongly_closed();
-    switch (relsym) {
-    case LESS_OR_EQUAL:
-      // Add the constraint `var <= b/denominator'.
-      add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
-      break;
-    case GREATER_OR_EQUAL:
-      // Add the constraint `var >= n/denominator',
-      // i.e., `-var <= -b/denominator'.
-      add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // The one and only non-zero homogeneous coefficient in `expr'.
-    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
-    if (w_coeff == denominator || w_coeff == minus_denom) {
-      // Case 2: expr == w_coeff*w + b, with w_coeff == +/- denominator.
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        {
-          PPL_DIRTY_TEMP(N, d);
-          div_round_up(d, b, denominator);
-          if (w_id == var_id) {
-            // Here `expr' is of the form: +/- denominator * v + b.
-            // Strong closure is not preserved.
-            reset_strongly_closed();
-            if (w_coeff == denominator) {
-              // Translate all the constraints of the form `v - w <= cost'
-              // into the constraint `v - w <= cost + b/denominator';
-              // forget each constraint `w - v <= cost1'.
-              Row_Iterator m_iter = m_begin + n_var;
-              Row_Reference m_v = *m_iter;
-              N& m_v_cv = m_v[n_var + 1];
-              ++m_iter;
-              Row_Reference m_cv = *m_iter;
-              N& m_cv_v = m_cv[n_var];
-              ++m_iter;
-              // NOTE: delay update of m_v_cv and m_cv_v.
-              for ( ; m_iter != m_end; ++m_iter) {
-                Row_Reference m_i = *m_iter;
-                N& m_i_v = m_i[n_var];
-                add_assign_r(m_i_v, m_i_v, d, ROUND_UP);
-                assign_r(m_i[n_var + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
-              }
-              for (dimension_type k = n_var; k-- > 0; ) {
-                assign_r(m_v[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
-                add_assign_r(m_cv[k], m_cv[k], d, ROUND_UP);
-              }
-              mul_2exp_assign_r(d, d, 1, ROUND_UP);
-              add_assign_r(m_cv_v, m_cv_v, d, ROUND_UP);
-              assign_r(m_v_cv, PLUS_INFINITY, ROUND_NOT_NEEDED);
-            }
-            else {
-              // Here `w_coeff == -denominator'.
-              // `expr' is of the form: -a*var + b.
-              N& m_v_cv = matrix[n_var][n_var + 1];
-              mul_2exp_assign_r(d, d, 1, ROUND_UP);
-              add_assign_r(matrix[n_var + 1][n_var], m_v_cv, d, ROUND_UP);
-              assign_r(m_v_cv, PLUS_INFINITY, ROUND_NOT_NEEDED);
-              forget_binary_octagonal_constraints(var_id);
-            }
-          }
-          else {
-            // Here `w != v', so that `expr' is the form
-            // +/- denominator*w + b.
-            // Remove all constraints on `v'.
-            forget_all_octagonal_constraints(var_id);
-            const dimension_type n_w = 2*w_id;
-            if (w_coeff == denominator) {
-              // Add the new constraint `v - w <= b/denominator'.
-              if (var_id < w_id)
-                add_octagonal_constraint(n_w, n_var, b, denominator);
-              else
-                add_octagonal_constraint(n_var + 1, n_w + 1, b, denominator);
-            }
-            else {
-              // Add the new constraint `v + w <= b/denominator'.
-              if (var_id < w_id)
-                add_octagonal_constraint(n_w + 1, n_var, b, denominator);
-              else
-                add_octagonal_constraint(n_var + 1, n_w, b, denominator);
-            }
-          }
-          break;
-        }
-
-      case GREATER_OR_EQUAL:
-        {
-          PPL_DIRTY_TEMP(N, d);
-          div_round_up(d, b, minus_denom);
-          if (w_id == var_id) {
-            // Here `expr' is of the form: +/- denominator * v + b.
-            // Strong closure is not preserved.
-            reset_strongly_closed();
-            if (w_coeff == denominator) {
-              // Translate each constraint `w - v <= cost'
-              // into the constraint `w - v <= cost - b/denominator';
-              // forget each constraint `v - w <= cost1'.
-              Row_Iterator m_iter = m_begin + n_var;
-              Row_Reference m_v = *m_iter;
-              N& m_v_cv = m_v[n_var + 1];
-              ++m_iter;
-              Row_Reference m_cv = *m_iter;
-              N& m_cv_v = m_cv[n_var];
-              ++m_iter;
-              // NOTE: delay update of m_v_cv and m_cv_v.
-              for ( ; m_iter != m_end; ++m_iter) {
-                Row_Reference m_i = *m_iter;
-                assign_r(m_i[n_var], PLUS_INFINITY, ROUND_NOT_NEEDED);
-                add_assign_r(m_i[n_var + 1], m_i[n_var + 1], d, ROUND_UP);
-              }
-              for (dimension_type k = n_var; k-- > 0; ) {
-                add_assign_r(m_v[k], m_v[k], d, ROUND_UP);
-                assign_r(m_cv[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
-              }
-              mul_2exp_assign_r(d, d, 1, ROUND_UP);
-              add_assign_r(m_v_cv, m_v_cv, d, ROUND_UP);
-              assign_r(m_cv_v, PLUS_INFINITY, ROUND_NOT_NEEDED);
-            }
-            else {
-              // Here `w_coeff == -denominator'.
-              // `expr' is of the form: -a*var + b.
-              N& m_cv_v = matrix[n_var + 1][n_var];
-              mul_2exp_assign_r(d, d, 1, ROUND_UP);
-              add_assign_r(matrix[n_var][n_var + 1], m_cv_v, d, ROUND_UP);
-              assign_r(m_cv_v, PLUS_INFINITY, ROUND_NOT_NEEDED);
-              forget_binary_octagonal_constraints(var_id);
-            }
-          }
-          else {
-            // Here `w != v', so that `expr' is of the form
-            // +/-denominator * w + b, with `w != v'.
-            // Remove all constraints on `v'.
-            forget_all_octagonal_constraints(var_id);
-            const dimension_type n_w = 2*w_id;
-            // We have got an expression of the following form:
-            // var1 + n, with `var1' != `var'.
-            // We remove all constraints of the form `var (+/- var1) >= const'
-            // and we add the new constraint `var +/- var1 >= n/denominator'.
-            if (w_coeff == denominator) {
-              // Add the new constraint `var - w >= b/denominator',
-              // i.e., `w - var <= -b/denominator'.
-              if (var_id < w_id)
-                add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
-              else
-                add_octagonal_constraint(n_var, n_w, b, minus_denom);
-            }
-            else {
-              // Add the new constraint `var + w >= b/denominator',
-              // i.e., `-w - var <= -b/denominator'.
-              if (var_id < w_id)
-                add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
-              else
-                add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
-            }
-          }
-          break;
-        }
-
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-      PPL_ASSERT(OK());
-      return;
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t == 1, expr == a*w + b, but a <> +/- denominator.
-  // We will remove all the constraints on `v' and add back
-  // a constraint providing an upper or a lower bound for `v'
-  // (depending on `relsym').
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign(minus_b, b);
-  const Coefficient& sc_b = is_sc ? b : minus_b;
-  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -expr;
-  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, sum);
-  // Index of variable that is unbounded in `this->matrix'.
-  PPL_UNINITIALIZED(dimension_type, pinf_index);
-  // Number of unbounded variables found.
-  dimension_type pinf_count = 0;
-
-  switch (relsym) {
-  case LESS_OR_EQUAL:
-    {
-      // Compute an upper approximation for `sc_expr' into `sum'.
-
-      // Approximate the inhomogeneous term.
-      assign_r(sum, sc_b, ROUND_UP);
-      // Approximate the homogeneous part of `sc_expr'.
-      PPL_DIRTY_TEMP(N, coeff_i);
-      PPL_DIRTY_TEMP(N, approx_i);
-      PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-      // Note: indices above `w' can be disregarded, as they all have
-      // a zero coefficient in `sc_expr'.
-      for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
-           m_iter != m_iter_end; ) {
-        const dimension_type n_i = m_iter.index();
-        const dimension_type id = n_i/2;
-        Row_reference m_i = *m_iter;
-        ++m_iter;
-        Row_reference m_ci = *m_iter;
-        ++m_iter;
-        const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-        const int sign_i = sgn(sc_i);
-        if (sign_i == 0)
-          continue;
-        // Choose carefully: we are approximating `sc_expr'.
-        const N& double_approx_i = (sign_i > 0) ? m_ci[n_i] : m_i[n_i + 1];
-        if (is_plus_infinity(double_approx_i)) {
-          if (++pinf_count > 1)
-            break;
-          pinf_index = id;
-          continue;
-        }
-        if (sign_i > 0)
-          assign_r(coeff_i, sc_i, ROUND_UP);
-        else {
-          neg_assign(minus_sc_i, sc_i);
-          assign_r(coeff_i, minus_sc_i, ROUND_UP);
-        }
-        div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
-        add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-      }
-      // Remove all constraints on `v'.
-      forget_all_octagonal_constraints(var_id);
-      reset_strongly_closed();
-      // Return immediately if no approximation could be computed.
-      if (pinf_count > 1) {
-        PPL_ASSERT(OK());
-        return;
-      }
-
-      // Divide by the (sign corrected) denominator (if needed).
-      if (sc_denom != 1) {
-        // Before computing the quotient, the denominator should be
-        // approximated towards zero. Since `sc_denom' is known to be
-        // positive, this amounts to rounding downwards, which is
-        // achieved as usual by rounding upwards
-        // `minus_sc_denom' and negating again the result.
-        PPL_DIRTY_TEMP(N, down_sc_denom);
-        assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-        neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-        div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-      }
-
-      if (pinf_count == 0) {
-        // Add the constraint `v <= pos_sum'.
-        PPL_DIRTY_TEMP(N, double_sum);
-        mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
-        matrix[n_var + 1][n_var] = double_sum;
-        // Deduce constraints of the form `v +/- u', where `u != v'.
-        deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, sum);
-      }
-      else if (pinf_count == 1)
-        if (pinf_index != var_id) {
-          const Coefficient& pi = expr.coefficient(Variable(pinf_index));
-          if (pi == denominator ) {
-            // Add the constraint `v - pinf_index <= sum'.
-            if (var_id < pinf_index)
-              matrix[2*pinf_index][n_var] = sum;
-            else
-              matrix[n_var + 1][2*pinf_index + 1] = sum;
-          }
-          else {
-            if (pi == minus_denom) {
-              // Add the constraint `v + pinf_index <= sum'.
-              if (var_id < pinf_index)
-                matrix[2*pinf_index + 1][n_var] = sum;
-              else
-                matrix[n_var + 1][2*pinf_index] = sum;
-            }
-          }
-        }
-      break;
-    }
-
-  case GREATER_OR_EQUAL:
-    {
-      // Compute an upper approximation for `-sc_expr' into `sum'.
-      // Note: approximating `-sc_expr' from above and then negating the
-      // result is the same as approximating `sc_expr' from below.
-
-      // Approximate the inhomogeneous term.
-      assign_r(sum, minus_sc_b, ROUND_UP);
-      PPL_DIRTY_TEMP(N, coeff_i);
-      PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-      PPL_DIRTY_TEMP(N, approx_i);
-      // Approximate the homogeneous part of `-sc_expr'.
-      for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
-           m_iter != m_iter_end; ) {
-        const dimension_type n_i = m_iter.index();
-        const dimension_type id = n_i/2;
-        Row_reference m_i = *m_iter;
-        ++m_iter;
-        Row_reference m_ci = *m_iter;
-        ++m_iter;
-        const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-        const int sign_i = sgn(sc_i);
-        if (sign_i == 0)
-          continue;
-        // Choose carefully: we are approximating `-sc_expr'.
-        const N& double_approx_i = (sign_i > 0) ? m_i[n_i + 1] : m_ci[n_i];
-        if (is_plus_infinity(double_approx_i)) {
-          if (++pinf_count > 1)
-            break;
-          pinf_index = id;
-          continue;
-        }
-        if (sign_i > 0)
-          assign_r(coeff_i, sc_i, ROUND_UP);
-        else {
-          neg_assign(minus_sc_i, sc_i);
-          assign_r(coeff_i, minus_sc_i, ROUND_UP);
-        }
-        div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
-        add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
-      }
-
-      // Remove all constraints on `var'.
-      forget_all_octagonal_constraints(var_id);
-      reset_strongly_closed();
-      // Return immediately if no approximation could be computed.
-      if (pinf_count > 1) {
-        PPL_ASSERT(OK());
-        return;
-      }
-
-      // Divide by the (sign corrected) denominator (if needed).
-      if (sc_denom != 1) {
-        // Before computing the quotient, the denominator should be
-        // approximated towards zero. Since `sc_denom' is known to be
-        // positive, this amounts to rounding downwards, which is
-        // achieved as usual by rounding upwards
-        // `minus_sc_denom' and negating again the result.
-        PPL_DIRTY_TEMP(N, down_sc_denom);
-        assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-        neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-        div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
-      }
-
-      if (pinf_count == 0) {
-        // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-        PPL_DIRTY_TEMP(N, double_sum);
-        mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
-        matrix[n_var][n_var + 1] = double_sum;
-        // Deduce constraints of the form `-v +/- u', where `u != v'.
-        deduce_minus_v_pm_u_bounds(var_id, pinf_index, sc_expr, sc_denom, sum);
-      }
-      else if (pinf_count == 1)
-        if (pinf_index != var_id) {
-          const Coefficient& pi = expr.coefficient(Variable(pinf_index));
-          if (pi == denominator) {
-            // Add the constraint `v - pinf_index >= -sum',
-            // i.e., `pinf_index - v <= sum'.
-            if (pinf_index < var_id)
-              matrix[n_var][2*pinf_index] = sum;
-            else
-              matrix[2*pinf_index + 1][n_var + 1] = sum;
-          }
-          else {
-            if (pi == minus_denom) {
-              // Add the constraint `v + pinf_index >= -sum',
-              // i.e., `-pinf_index - v <= sum'.
-              if (pinf_index < var_id)
-                matrix[n_var][2*pinf_index + 1] = sum;
-              else
-                matrix[2*pinf_index][n_var + 1] = sum;
-            }
-          }
-        }
-      break;
-    }
-
-  default:
-    // We already dealt with the other cases.
-    PPL_UNREACHABLE;
-    break;
-  }
-  incremental_strong_closure_assign(var);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::generalized_affine_image(const Linear_Expression& lhs,
-                                             const Relation_Symbol relsym,
-                                             const Linear_Expression& rhs) {
-  // Dimension-compatibility checks.
-  // The dimension of `lhs' should not be greater than the dimension
-  // of `*this'.
-  dimension_type lhs_space_dim = lhs.space_dimension();
-  if (space_dim < lhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-                                 "e1", lhs);
-
-  // The dimension of `rhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type rhs_space_dim = rhs.space_dimension();
-  if (space_dim < rhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-                                 "e2", rhs);
-
-  // Strict relation symbols are not admitted for octagons.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-                           "r is the disequality relation symbol");
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty.
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lhs': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t_lhs = 0;
-  // Index of the last non-zero coefficient in `lhs', if any.
-  dimension_type j_lhs = lhs.last_nonzero();
-
-  if (j_lhs != 0) {
-    ++t_lhs;
-    if (!lhs.all_zeroes(1, j_lhs))
-      ++t_lhs;
-    --j_lhs;
-  }
-
-  const Coefficient& b_lhs = lhs.inhomogeneous_term();
-
-  if (t_lhs == 0) {
-    // `lhs' is a constant.
-    // In principle, it is sufficient to add the constraint `lhs relsym rhs'.
-    // Note that this constraint is an octagonal difference if `t_rhs <= 1'
-    // or `t_rhs > 1' and `rhs == a*v - a*w + b_rhs' or
-    // `rhs == a*v + a*w + b_rhs'. If `rhs' is of a
-    // more general form, it will be simply ignored.
-    // TODO: if it is not an octagonal difference, should we compute
-    // approximations for this constraint?
-    switch (relsym) {
-    case LESS_OR_EQUAL:
-      refine_no_check(lhs <= rhs);
-      break;
-    case EQUAL:
-      refine_no_check(lhs == rhs);
-      break;
-    case GREATER_OR_EQUAL:
-      refine_no_check(lhs >= rhs);
-      break;
-    default:
-      // We already dealt with the other cases.
-      PPL_UNREACHABLE;
-      break;
-    }
-  }
-
-  else if (t_lhs == 1) {
-    // Here `lhs == a_lhs * v + b_lhs'.
-    // Independently from the form of `rhs', we can exploit the
-    // method computing generalized affine images for a single variable.
-    Variable v(j_lhs);
-    // Compute a sign-corrected relation symbol.
-    const Coefficient& denom = lhs.coefficient(v);
-    Relation_Symbol new_relsym = relsym;
-    if (denom < 0) {
-      if (relsym == LESS_OR_EQUAL)
-        new_relsym = GREATER_OR_EQUAL;
-      else if (relsym == GREATER_OR_EQUAL)
-        new_relsym = LESS_OR_EQUAL;
-    }
-    Linear_Expression expr = rhs - b_lhs;
-    generalized_affine_image(v, new_relsym, expr, denom);
-  }
-  else {
-    // Here `lhs' is of the general form, having at least two variables.
-    // Compute the set of variables occurring in `lhs'.
-    std::vector<Variable> lhs_vars;
-    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
-          i != i_end; ++i)
-      lhs_vars.push_back(i.variable());
-
-    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
-    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
-      // `lhs' and `rhs' variables are disjoint.
-      // Existentially quantify all variables in the lhs.
-      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
-        dimension_type lhs_vars_i = lhs_vars[i].id();
-        forget_all_octagonal_constraints(lhs_vars_i);
-      }
-      // Constrain the left hand side expression so that it is related to
-      // the right hand side expression as dictated by `relsym'.
-      // TODO: if the following constraint is NOT an octagonal difference,
-      // it will be simply ignored. Should we compute approximations for it?
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(lhs <= rhs);
-        break;
-      case EQUAL:
-        refine_no_check(lhs == rhs);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(lhs >= rhs);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-    }
-    else {
-      // Some variables in `lhs' also occur in `rhs'.
-
-#if 1 // Simplified computation (see the TODO note below).
-
-      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
-        dimension_type lhs_vars_i = lhs_vars[i].id();
-        forget_all_octagonal_constraints(lhs_vars_i);
-      }
-
-#else // Currently unnecessarily complex computation.
-
-      // More accurate computation that is worth doing only if
-      // the following TODO note is accurately dealt with.
-
-      // To ease the computation, we add an additional dimension.
-      const Variable new_var(space_dim);
-      add_space_dimensions_and_embed(1);
-      // Constrain the new dimension to be equal to `rhs'.
-      // NOTE: calling affine_image() instead of refine_no_check()
-      // ensures some approximation is tried even when the constraint
-      // is not an octagonal constraint.
-      affine_image(new_var, rhs);
-      // Existentially quantify all variables in the lhs.
-      // NOTE: enforce strong closure for precision.
-      strong_closure_assign();
-      PPL_ASSERT(!marked_empty());
-      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
-        dimension_type lhs_vars_i = lhs_vars[i].id();
-        forget_all_octagonal_constraints(lhs_vars_i);
-      }
-      // Constrain the new dimension so that it is related to
-      // the left hand side as dictated by `relsym'.
-      // TODO: each one of the following constraints is definitely NOT
-      // an octagonal difference (since it has 3 variables at least).
-      // Thus, the method refine_no_check() will simply ignore it.
-      // Should we compute approximations for this constraint?
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(lhs <= new_var);
-        break;
-      case EQUAL:
-        refine_no_check(lhs == new_var);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(lhs >= new_var);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-      // Remove the temporarily added dimension.
-      remove_higher_space_dimensions(space_dim-1);
-#endif // Currently unnecessarily complex computation.
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::bounded_affine_image(const Variable var,
-                                         const Linear_Expression& lb_expr,
-                                         const Linear_Expression& ub_expr,
-                                         Coefficient_traits::const_reference
-                                         denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
-
-  // `var' should be one of the dimensions of the octagon.
-  const dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-                                 var_id + 1);
-
-  // The dimension of `lb_expr' and `ub_expr' should not be
-  // greater than the dimension of `*this'.
-  const dimension_type lb_space_dim = lb_expr.space_dimension();
-  if (space_dim < lb_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-                                 "lb", lb_expr);
-  const dimension_type ub_space_dim = ub_expr.space_dimension();
-  if (space_dim < ub_space_dim)
-    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-                                 "ub", ub_expr);
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty too.
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lb_expr': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t = 0;
-  // Variable-index of the last non-zero coefficient in `lb_expr', if any.
-  dimension_type w_id = lb_expr.last_nonzero();
-
-  if (w_id != 0) {
-    ++t;
-    if (!lb_expr.all_zeroes(1, w_id))
-      ++t;
-    --w_id;
-  }
-
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const dimension_type n_var = 2*var_id;
-  const Coefficient& b = lb_expr.inhomogeneous_term();
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
-  neg_assign_r(minus_denom, denominator, ROUND_NOT_NEEDED);
-
-  // `w' is the variable with index `w_id'.
-  // Now we know the form of `lb_expr':
-  // - If t == 0, then lb_expr == b, with `b' a constant;
-  // - If t == 1, then lb_expr == a*w + b, where `w' can be `v' or another
-  //   variable; in this second case we have to check whether `a' is
-  //   equal to `denominator' or `-denominator', since otherwise we have
-  //   to fall back on the general form;
-  // - If t == 2, the `lb_expr' is of the general form.
-
-  if (t == 0) {
-    // Case 1: lb_expr == b.
-    generalized_affine_image(var,
-                             LESS_OR_EQUAL,
-                             ub_expr,
-                             denominator);
-    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
-    two_b = 2*b;
-    // Add the constraint `var >= b/denominator'.
-    add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
-    PPL_ASSERT(OK());
-    return;
-  }
-
-  if (t == 1) {
-    // The one and only non-zero homogeneous coefficient in `lb_expr'.
-    const Coefficient& w_coeff = lb_expr.coefficient(Variable(w_id));
-    if (w_coeff == denominator || w_coeff == minus_denom) {
-      // Case 2: lb_expr = w_coeff*w + b, with w_coeff = +/- denominator.
-      if (w_id == var_id) {
-        // Here `var' occurs in `lb_expr'.
-        // To ease the computation, we add an additional dimension.
-        const Variable new_var(space_dim);
-        add_space_dimensions_and_embed(1);
-        // Constrain the new dimension to be equal to `lb_expr'.
-        // Here `lb_expr' is of the form: +/- denominator * v + b.
-        affine_image(new_var, lb_expr, denominator);
-        // Enforce the strong closure for precision.
-        strong_closure_assign();
-        PPL_ASSERT(!marked_empty());
-        // Apply the affine upper bound.
-        generalized_affine_image(var,
-                                 LESS_OR_EQUAL,
-                                 ub_expr,
-                                 denominator);
-        // Now apply the affine lower bound, as recorded in `new_var'
-        refine_no_check(var >= new_var);
-        // Remove the temporarily added dimension.
-        remove_higher_space_dimensions(space_dim-1);
-        return;
-      }
-      else {
-        // Apply the affine upper bound.
-        generalized_affine_image(var,
-                                 LESS_OR_EQUAL,
-                                 ub_expr,
-                                 denominator);
-        // Here `w != var', so that `lb_expr' is of the form
-        // +/-denominator * w + b.
-        const dimension_type n_w = 2*w_id;
-        // Add the new constraint `var - w >= b/denominator'.
-        if (w_coeff == denominator)
-          if (var_id < w_id)
-            add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
-          else
-            add_octagonal_constraint(n_var, n_w, b, minus_denom);
-        else {
-          // Add the new constraint `var + w >= b/denominator'.
-          if (var_id < w_id)
-            add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
-          else
-            add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
-        }
-        PPL_ASSERT(OK());
-        return;
-      }
-    }
-  }
-
-  // General case.
-  // Either t == 2, so that
-  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
-  // or t == 1, expr == a*w + b, but a <> +/- denominator.
-  // We will remove all the constraints on `var' and add back
-  // constraints providing upper and lower bounds for `var'.
-
-  // Compute upper approximations for `expr' and `-expr'
-  // into `pos_sum' and `neg_sum', respectively, taking into account
-  // the sign of `denominator'.
-  // Note: approximating `-expr' from above and then negating the
-  // result is the same as approximating `expr' from below.
-  const bool is_sc = (denominator > 0);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
-  neg_assign_r(minus_b, b, ROUND_NOT_NEEDED);
-
-  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
-  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
-  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
-  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
-  // when `denominator' is negative. Do not use it unless you are sure
-  // it has been correctly assigned.
-  Linear_Expression minus_expr;
-  if (!is_sc)
-    minus_expr = -lb_expr;
-  const Linear_Expression& sc_expr = is_sc ? lb_expr : minus_expr;
-
-  PPL_DIRTY_TEMP(N, neg_sum);
-  // Indices of the variables that are unbounded in `this->matrix'.
-  PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
-  // Number of unbounded variables found.
-  dimension_type neg_pinf_count = 0;
-
-  // Approximate the inhomogeneous term.
-  assign_r(neg_sum, minus_sc_b, ROUND_UP);
-
-  // Approximate the homogeneous part of `sc_expr'.
-  PPL_DIRTY_TEMP(N, coeff_i);
-  PPL_DIRTY_TEMP(N, minus_coeff_i);
-  PPL_DIRTY_TEMP(N, half);
-  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-  // Note: indices above `w' can be disregarded, as they all have
-  // a zero coefficient in `sc_expr'.
-  for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
-       m_iter != m_iter_end; ) {
-    const dimension_type n_i = m_iter.index();
-    const dimension_type id = n_i/2;
-    Row_reference m_i = *m_iter;
-    ++m_iter;
-    Row_reference m_ci = *m_iter;
-    ++m_iter;
-    const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
-    const int sign_i = sgn(sc_i);
-    if (sign_i > 0) {
-      assign_r(coeff_i, sc_i, ROUND_UP);
-      // Approximating `-sc_expr'.
-      if (neg_pinf_count <= 1) {
-        const N& double_up_approx_minus_i = m_i[n_i + 1];
-        if (!is_plus_infinity(double_up_approx_minus_i)) {
-          // Let half = double_up_approx_minus_i / 2.
-          div_2exp_assign_r(half, double_up_approx_minus_i, 1, ROUND_UP);
-          add_mul_assign_r(neg_sum, coeff_i, half, ROUND_UP);
-        }
-        else {
-          ++neg_pinf_count;
-          neg_pinf_index = id;
-        }
-      }
-    }
-    else if (sign_i < 0) {
-      neg_assign_r(minus_sc_i, sc_i, ROUND_NOT_NEEDED);
-      assign_r(minus_coeff_i, minus_sc_i, ROUND_UP);
-      // Approximating `-sc_expr'.
-      if (neg_pinf_count <= 1) {
-        const N& double_up_approx_i = m_ci[n_i];
-        if (!is_plus_infinity(double_up_approx_i)) {
-          // Let half = double_up_approx_i / 2.
-          div_2exp_assign_r(half, double_up_approx_i, 1, ROUND_UP);
-          add_mul_assign_r(neg_sum, minus_coeff_i, half, ROUND_UP);
-        }
-        else {
-          ++neg_pinf_count;
-          neg_pinf_index = id;
-        }
-      }
-    }
-  }
-
-  // Apply the affine upper bound.
-  generalized_affine_image(var,
-                           LESS_OR_EQUAL,
-                           ub_expr,
-                           denominator);
-
-  // Return immediately if no approximation could be computed.
-  if (neg_pinf_count > 1) {
-    return;
-  }
-
-  // In the following, strong closure will be definitely lost.
-  reset_strongly_closed();
-
-  // Exploit the lower approximation, if possible.
-  if (neg_pinf_count <= 1) {
-    // Compute quotient (if needed).
-    if (sc_denom != 1) {
-      // Before computing quotients, the denominator should be approximated
-      // towards zero. Since `sc_denom' is known to be positive, this amounts to
-      // rounding downwards, which is achieved as usual by rounding upwards
-      // `minus_sc_denom' and negating again the result.
-      PPL_DIRTY_TEMP(N, down_sc_denom);
-      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
-      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
-      div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
-    }
-    // Add the lower bound constraint, if meaningful.
-    if (neg_pinf_count == 0) {
-      // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
-      PPL_DIRTY_TEMP(N, double_neg_sum);
-      mul_2exp_assign_r(double_neg_sum, neg_sum, 1, ROUND_UP);
-      matrix[n_var][n_var + 1] = double_neg_sum;
-      // Deduce constraints of the form `-v +/- u', where `u != v'.
-      deduce_minus_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, neg_sum);
-    }
-    else
-      // Here `neg_pinf_count == 1'.
-      if (neg_pinf_index != var_id) {
-        const Coefficient& npi = sc_expr.coefficient(Variable(neg_pinf_index));
-        if (npi == sc_denom)
-          // Add the constraint `v - neg_pinf_index >= -neg_sum',
-          // i.e., `neg_pinf_index - v <= neg_sum'.
-          if (neg_pinf_index < var_id)
-            matrix[n_var][2*neg_pinf_index] = neg_sum;
-          else
-            matrix[2*neg_pinf_index + 1][n_var + 1] = neg_sum;
-        else
-          if (npi == minus_sc_denom) {
-            // Add the constraint `v + neg_pinf_index >= -neg_sum',
-            // i.e., `-neg_pinf_index - v <= neg_sum'.
-            if (neg_pinf_index < var_id)
-              matrix[n_var][2*neg_pinf_index + 1] = neg_sum;
-            else
-              matrix[2*neg_pinf_index][n_var + 1] = neg_sum;
-          }
-      }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::generalized_affine_preimage(const Variable var,
-                              const Relation_Symbol relsym,
-                              const Linear_Expression& expr,
-                              Coefficient_traits::const_reference
-                              denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)", "d == 0");
-
-  // Dimension-compatibility checks.
-  // The dimension of `expr' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type expr_space_dim = expr.space_dimension();
-  if (space_dim < expr_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-                                 "e", expr);
-
-  // `var' should be one of the dimensions of the octagon.
-  const dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-                                 var_id + 1);
-
-  // The relation symbol cannot be a strict relation symbol.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-                           "r is the disequality relation symbol");
-
-  if (relsym == EQUAL) {
-    // The relation symbol is "=":
-    // this is just an affine preimage computation.
-    affine_preimage(var, expr, denominator);
-    return;
-  }
-
-  // The image of an empty octagon is empty too.
-  strong_closure_assign();
-  if (marked_empty())
-    return;
-
-  // Check whether the preimage of this affine relation can be easily
-  // computed as the image of its inverse relation.
-  const Coefficient& expr_v = expr.coefficient(var);
-  if (expr_v != 0) {
-    const Relation_Symbol reversed_relsym = (relsym == LESS_OR_EQUAL)
-      ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
-    const Linear_Expression inverse
-      = expr - (expr_v + denominator)*var;
-    PPL_DIRTY_TEMP_COEFFICIENT(inverse_denom);
-    neg_assign(inverse_denom, expr_v);
-    const Relation_Symbol inverse_relsym
-      = (sgn(denominator) == sgn(inverse_denom)) ? relsym : reversed_relsym;
-    generalized_affine_image(var, inverse_relsym, inverse, inverse_denom);
-    return;
-  }
-
-  // Here `var_coefficient == 0', so that the preimage cannot
-  // be easily computed by inverting the affine relation.
-  // Shrink the Octagonal_Shape by adding the constraint induced
-  // by the affine relation.
-  refine(var, relsym, expr, denominator);
-
-  // If the shrunk OS is empty, its preimage is empty too; ...
-  if (is_empty())
-    return;
-  // ...  otherwise, since the relation was not invertible,
-  // we just forget all constraints on `var'.
-  forget_all_octagonal_constraints(var_id);
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::generalized_affine_preimage(const Linear_Expression& lhs,
-                              const Relation_Symbol relsym,
-                              const Linear_Expression& rhs) {
-  // Dimension-compatibility checks.
-  // The dimension of `lhs' should not be greater than the dimension
-  // of `*this'.
-  dimension_type lhs_space_dim = lhs.space_dimension();
-  if (space_dim < lhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
-                                 "e1", lhs);
-
-  // The dimension of `rhs' should not be greater than the dimension
-  // of `*this'.
-  const dimension_type rhs_space_dim = rhs.space_dimension();
-  if (space_dim < rhs_space_dim)
-    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
-                                 "e2", rhs);
-
-  // Strict relation symbols are not admitted for octagons.
-  if (relsym == LESS_THAN || relsym == GREATER_THAN)
-    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
-                           "r is a strict relation symbol");
-  // The relation symbol cannot be a disequality.
-  if (relsym == NOT_EQUAL)
-    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
-                           "r is the disequality relation symbol");
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty.
-  if (marked_empty())
-    return;
-
-  // Number of non-zero coefficients in `lhs': will be set to
-  // 0, 1, or 2, the latter value meaning any value greater than 1.
-  dimension_type t_lhs = 0;
-  // Index of the last non-zero coefficient in `lhs', if any.
-  dimension_type j_lhs = lhs.last_nonzero();
-
-  if (j_lhs != 0) {
-    ++t_lhs;
-    if (!lhs.all_zeroes(1, j_lhs))
-      ++t_lhs;
-    j_lhs--;
-  }
-
-  const Coefficient& b_lhs = lhs.inhomogeneous_term();
-
-  // If all variables have a zero coefficient, then `lhs' is a constant:
-  // in this case, preimage and image happen to be the same.
-  if (t_lhs == 0) {
-    generalized_affine_image(lhs, relsym, rhs);
-    return;
-  }
-
-  else if (t_lhs == 1) {
-    // Here `lhs == a_lhs * v + b_lhs'.
-    // Independently from the form of `rhs', we can exploit the
-    // method computing generalized affine preimages for a single variable.
-    Variable v(j_lhs);
-    // Compute a sign-corrected relation symbol.
-    const Coefficient& denom = lhs.coefficient(v);
-    Relation_Symbol new_relsym = relsym;
-    if (denom < 0) {
-      if (relsym == LESS_OR_EQUAL)
-        new_relsym = GREATER_OR_EQUAL;
-      else if (relsym == GREATER_OR_EQUAL)
-        new_relsym = LESS_OR_EQUAL;
-    }
-    Linear_Expression expr = rhs - b_lhs;
-    generalized_affine_preimage(v, new_relsym, expr, denom);
-  }
-
-  else {
-    // Here `lhs' is of the general form, having at least two variables.
-    // Compute the set of variables occurring in `lhs'.
-    std::vector<Variable> lhs_vars;
-    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
-          i != i_end; ++i)
-      lhs_vars.push_back(i.variable());
-
-    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
-    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
-      // `lhs' and `rhs' variables are disjoint.
-      // Constrain the left hand side expression so that it is related to
-      // the right hand side expression as dictated by `relsym'.
-      // TODO: if the following constraint is NOT an octagonal difference,
-      // it will be simply ignored. Should we compute approximations for it?
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(lhs <= rhs);
-        break;
-      case EQUAL:
-        refine_no_check(lhs == rhs);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(lhs >= rhs);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-
-      // Any image of an empty octagon is empty.
-      if (is_empty())
-        return;
-      // Existentially quantify all variables in the lhs.
-      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
-        dimension_type lhs_vars_i = lhs_vars[i].id();
-        forget_all_octagonal_constraints(lhs_vars_i);
-      }
-    }
-    else {
-      // Some variables in `lhs' also occur in `rhs'.
-
-      // More accurate computation that is worth doing only if
-      // the following TODO note is accurately dealt with.
-
-      // To ease the computation, we add an additional dimension.
-      const Variable new_var(space_dim);
-      add_space_dimensions_and_embed(1);
-      // Constrain the new dimension to be equal to `rhs'.
-      // NOTE: calling affine_image() instead of refine_no_check()
-      // ensures some approximation is tried even when the constraint
-      // is not an octagonal difference.
-      affine_image(new_var, lhs);
-      // Existentially quantify all variables in the lhs.
-      // NOTE: enforce strong closure for precision.
-      strong_closure_assign();
-      PPL_ASSERT(!marked_empty());
-      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
-        dimension_type lhs_vars_i = lhs_vars[i].id();
-        forget_all_octagonal_constraints(lhs_vars_i);
-      }
-      // Constrain the new dimension so that it is related to
-      // the left hand side as dictated by `relsym'.
-      // Note: if `rhs == v + b_rhs' or `rhs == -v + b_rhs' or `rhs == b_rhs',
-      // one of the following constraints will be added, because they
-      // are octagonal differences.
-      // Else the following constraints are NOT octagonal differences,
-      // so the method refine_no_check() will ignore them.
-      switch (relsym) {
-      case LESS_OR_EQUAL:
-        refine_no_check(new_var <= rhs);
-        break;
-      case EQUAL:
-        refine_no_check(new_var == rhs);
-        break;
-      case GREATER_OR_EQUAL:
-        refine_no_check(new_var >= rhs);
-        break;
-      default:
-        // We already dealt with the other cases.
-        PPL_UNREACHABLE;
-        break;
-      }
-      // Remove the temporarily added dimension.
-      remove_higher_space_dimensions(space_dim-1);
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::bounded_affine_preimage(const Variable var,
-                                            const Linear_Expression& lb_expr,
-                                            const Linear_Expression& ub_expr,
-                                            Coefficient_traits::const_reference
-                                            denominator) {
-  // The denominator cannot be zero.
-  if (denominator == 0)
-    throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
-
-  // `var' should be one of the dimensions of the octagon.
-  const dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-                                 var_id + 1);
-
-  // The dimension of `lb_expr' and `ub_expr' should not be
-  // greater than the dimension of `*this'.
-  const dimension_type lb_space_dim = lb_expr.space_dimension();
-  if (space_dim < lb_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-                                 "lb", lb_expr);
-  const dimension_type ub_space_dim = ub_expr.space_dimension();
-  if (space_dim < ub_space_dim)
-    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-                                 "ub", ub_expr);
-
-  strong_closure_assign();
-  // The image of an empty octagon is empty too.
-  if (marked_empty())
-    return;
-
-  if (ub_expr.coefficient(var) == 0) {
-    refine(var, LESS_OR_EQUAL, ub_expr, denominator);
-    generalized_affine_preimage(var, GREATER_OR_EQUAL,
-                                lb_expr, denominator);
-    return;
-  }
-  if (lb_expr.coefficient(var) == 0) {
-    refine(var, GREATER_OR_EQUAL, lb_expr, denominator);
-    generalized_affine_preimage(var, LESS_OR_EQUAL,
-                                ub_expr, denominator);
-    return;
-  }
-
-  const Coefficient& expr_v = lb_expr.coefficient(var);
-  // Here `var' occurs in `lb_expr' and `ub_expr'.
-  // To ease the computation, we add an additional dimension.
-  const Variable new_var(space_dim);
-  add_space_dimensions_and_embed(1);
-  const Linear_Expression lb_inverse
-    = lb_expr - (expr_v + denominator)*var;
-  PPL_DIRTY_TEMP_COEFFICIENT(inverse_denom);
-  neg_assign(inverse_denom, expr_v);
-  affine_image(new_var, lb_inverse, inverse_denom);
-  strong_closure_assign();
-  PPL_ASSERT(!marked_empty());
-  generalized_affine_preimage(var, LESS_OR_EQUAL,
-                              ub_expr, denominator);
-  if (sgn(denominator) == sgn(inverse_denom))
-    refine_no_check(var >= new_var) ;
-  else
-    refine_no_check(var <= new_var);
-  // Remove the temporarily added dimension.
-  remove_higher_space_dimensions(space_dim-1);
-}
-
-template <typename T>
-Constraint_System
-Octagonal_Shape<T>::constraints() const {
-  const dimension_type space_dim = space_dimension();
-  Constraint_System cs;
-  cs.set_space_dimension(space_dim);
-
-  if (space_dim == 0) {
-    if (marked_empty())
-      cs = Constraint_System::zero_dim_empty();
-    return cs;
-  }
-
-  if (marked_empty()) {
-    cs.insert(Constraint::zero_dim_false());
-    return cs;
-  }
-
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-
-  Row_Iterator m_begin = matrix.row_begin();
-  Row_Iterator m_end = matrix.row_end();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(a);
-  PPL_DIRTY_TEMP_COEFFICIENT(b);
-
-  // Go through all the unary constraints in `matrix'.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
-    const dimension_type i = i_iter.index();
-    const Variable x(i/2);
-    const N& c_i_ii = (*i_iter)[i + 1];
-    ++i_iter;
-    const N& c_ii_i = (*i_iter)[i];
-    ++i_iter;
-    // Go through unary constraints.
-    if (is_additive_inverse(c_i_ii, c_ii_i)) {
-      // We have a unary equality constraint.
-      numer_denom(c_ii_i, b, a);
-      a *= 2;
-      cs.insert(a*x == b);
-    }
-    else {
-      // We have 0, 1 or 2 inequality constraints.
-      if (!is_plus_infinity(c_i_ii)) {
-        numer_denom(c_i_ii, b, a);
-        a *= 2;
-        cs.insert(-a*x <= b);
-      }
-      if (!is_plus_infinity(c_ii_i)) {
-        numer_denom(c_ii_i, b, a);
-        a *= 2;
-        cs.insert(a*x <= b);
-      }
-    }
-  }
-  //  Go through all the binary constraints in `matrix'.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
-    const dimension_type i = i_iter.index();
-    Row_Reference r_i = *i_iter;
-    ++i_iter;
-    Row_Reference r_ii = *i_iter;
-    ++i_iter;
-    const Variable y(i/2);
-    for (dimension_type j = 0; j < i; j += 2) {
-      const N& c_i_j = r_i[j];
-      const N& c_ii_jj = r_ii[j + 1];
-      const Variable x(j/2);
-      if (is_additive_inverse(c_ii_jj, c_i_j)) {
-        // We have an equality constraint of the form a*x - a*y = b.
-        numer_denom(c_i_j, b, a);
-        cs.insert(a*x - a*y == b);
-      }
-      else {
-        // We have 0, 1 or 2 inequality constraints.
-        if (!is_plus_infinity(c_i_j)) {
-          numer_denom(c_i_j, b, a);
-          cs.insert(a*x - a*y <= b);
-        }
-        if (!is_plus_infinity(c_ii_jj)) {
-          numer_denom(c_ii_jj, b, a);
-          cs.insert(a*y - a*x <= b);
-        }
-      }
-
-      const N& c_ii_j = r_ii[j];
-      const N& c_i_jj = r_i[j + 1];
-      if (is_additive_inverse(c_i_jj, c_ii_j)) {
-        // We have an equality constraint of the form a*x + a*y = b.
-        numer_denom(c_ii_j, b, a);
-        cs.insert(a*x + a*y == b);
-      }
-      else {
-        // We have 0, 1 or 2 inequality constraints.
-        if (!is_plus_infinity(c_i_jj)) {
-          numer_denom(c_i_jj, b, a);
-          cs.insert(-a*x - a*y <= b);
-        }
-        if (!is_plus_infinity(c_ii_j)) {
-          numer_denom(c_ii_j, b, a);
-          cs.insert(a*x + a*y <= b);
-        }
-      }
-    }
-  }
-  return cs;
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::expand_space_dimension(Variable var, dimension_type m) {
-  // `var' should be one of the dimensions of the vector space.
-  const dimension_type var_id = var.id();
-  if (var_id + 1 > space_dim)
-    throw_dimension_incompatible("expand_space_dimension(v, m)", var_id + 1);
-
-  // The space dimension of the resulting octagon should not
-  // overflow the maximum allowed space dimension.
-  if (m > max_space_dimension() - space_dim)
-    throw_invalid_argument("expand_dimension(v, m)",
-                           "adding m new space dimensions exceeds "
-                           "the maximum allowed space dimension");
-
-  // Nothing to do, if no dimensions must be added.
-  if (m == 0)
-    return;
-
-  // Keep track of the dimension before adding the new ones.
-  const dimension_type old_num_rows = matrix.num_rows();
-
-  // Add the required new dimensions.
-  add_space_dimensions_and_embed(m);
-
-  // For each constraints involving variable `var', we add a
-  // similar constraint with the new variable substituted for
-  // variable `var'.
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
-  const dimension_type n_var = 2*var_id;
-  Row_iterator v_iter = m_begin + n_var;
-  Row_reference m_v = *v_iter;
-  Row_reference m_cv = *(v_iter + 1);
-
-  for (Row_Iterator i_iter = m_begin + old_num_rows; i_iter != m_end;
-       i_iter += 2) {
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ci = *(i_iter + 1);
-    const dimension_type i = i_iter.index();
-    const dimension_type ci = i + 1;
-    m_i[ci] = m_v[n_var + 1];
-    m_ci[i] = m_cv[n_var];
-    for (dimension_type j = 0; j < n_var; ++j) {
-      m_i[j] = m_v[j];
-      m_ci[j] = m_cv[j];
-    }
-    for (dimension_type j = n_var + 2; j < old_num_rows; ++j) {
-      Row_Iterator j_iter = m_begin + j;
-      Row_Reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
-      m_i[j] = m_cj[n_var + 1];
-      m_ci[j] = m_cj[n_var];
-    }
-  }
-  // In general, adding a constraint does not preserve the strong closure
-  // of the octagon.
-  if (marked_strongly_closed())
-    reset_strongly_closed();
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
-                                          Variable dest) {
-  // `dest' should be one of the dimensions of the octagon.
-  if (dest.space_dimension() > space_dim)
-    throw_dimension_incompatible("fold_space_dimensions(vs, v)", "v", dest);
-
-  // The folding of no dimensions is a no-op.
-  if (vars.empty())
-    return;
-
-  // All variables in `vars' should be dimensions of the octagon.
-  if (vars.space_dimension() > space_dim)
-    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-                                 vars.space_dimension());
-
-  // Moreover, `dest.id()' should not occur in `vars'.
-  if (vars.find(dest.id()) != vars.end())
-    throw_invalid_argument("fold_space_dimensions(vs, v)",
-                           "v should not occur in vs");
-
-  // Recompute the elements of the row and the column corresponding
-  // to variable `dest' by taking the join of their value with the
-  // value of the corresponding elements in the row and column of the
-  // variable `vars'.
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-
-  const Row_Iterator m_begin = matrix.row_begin();
-
-  strong_closure_assign();
-  const dimension_type n_rows = matrix.num_rows();
-  const dimension_type n_dest = 2*dest.id();
-  Row_Iterator v_iter = m_begin + n_dest;
-  Row_Reference m_v = *v_iter;
-  Row_Reference m_cv = *(v_iter + 1);
-  for (Variables_Set::const_iterator i = vars.begin(),
-         vs_end = vars.end(); i != vs_end; ++i) {
-    const dimension_type tbf_id = *i;
-    const dimension_type tbf_var = 2*tbf_id;
-    Row_Iterator tbf_iter = m_begin + tbf_var;
-    Row_Reference m_tbf = *tbf_iter;
-    Row_Reference m_ctbf = *(tbf_iter + 1);
-    max_assign(m_v[n_dest + 1], m_tbf[tbf_var + 1]);
-    max_assign(m_cv[n_dest], m_ctbf[tbf_var]);
-
-    const dimension_type min_id = std::min(n_dest, tbf_var);
-    const dimension_type max_id = std::max(n_dest, tbf_var);
-
-    using namespace Implementation::Octagonal_Shapes;
-    for (dimension_type j = 0; j < min_id; ++j) {
-      const dimension_type cj = coherent_index(j);
-      max_assign(m_v[j], m_tbf[j]);
-      max_assign(m_cv[j], m_ctbf[j]);
-      max_assign(m_cv[cj], m_ctbf[cj]);
-      max_assign(m_v[cj], m_tbf[cj]);
-    }
-    for (dimension_type j = min_id + 2; j < max_id; ++j) {
-      const dimension_type cj = coherent_index(j);
-      Row_Iterator j_iter = m_begin + j;
-      Row_Reference m_j = *j_iter;
-      Row_Reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
-      if (n_dest == min_id) {
-        max_assign(m_cj[n_dest + 1], m_tbf[j]);
-        max_assign(m_cj[n_dest], m_ctbf[j]);
-        max_assign(m_j[n_dest], m_ctbf[cj]);
-        max_assign(m_j[n_dest + 1], m_tbf[cj]);
-      }
-      else {
-        max_assign(m_v[j], m_cj[tbf_var + 1]);
-        max_assign(m_cv[j], m_cj[tbf_var]);
-        max_assign(m_cv[cj], m_j[tbf_var]);
-        max_assign(m_v[cj], m_j[tbf_var + 1]);
-      }
-    }
-    for (dimension_type j = max_id + 2; j < n_rows; ++j) {
-      Row_Iterator j_iter = m_begin + j;
-      Row_Reference m_j = *j_iter;
-      Row_Reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
-      max_assign(m_cj[n_dest + 1], m_cj[tbf_var + 1]);
-      max_assign(m_cj[n_dest], m_cj[tbf_var]);
-      max_assign(m_j[n_dest], m_j[tbf_var]);
-      max_assign(m_j[n_dest + 1], m_j[tbf_var + 1]);
-    }
-  }
-  remove_space_dimensions(vars);
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::upper_bound_assign_if_exact(const Octagonal_Shape& y) {
-  // FIXME, CHECKME: what about inexact computations?
-
-  // Declare a const reference to *this (to avoid accidental modifications).
-  const Octagonal_Shape& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-
-  if (x_space_dim != y.space_dimension())
-    throw_dimension_incompatible("upper_bound_assign_if_exact(y)", y);
-
-  // The zero-dim case is trivial.
-  if (x_space_dim == 0) {
-    upper_bound_assign(y);
-    return true;
-  }
-  // If `x' or `y' is (known to be) empty, the upper bound is exact.
-  if (x.marked_empty()) {
-    *this = y;
-    return true;
-  }
-  else if (y.is_empty())
-    return true;
-  else if (x.is_empty()) {
-    *this = y;
-    return true;
-  }
-
-  // Here both `x' and `y' are known to be non-empty.
-  PPL_ASSERT(x.marked_strongly_closed());
-  PPL_ASSERT(y.marked_strongly_closed());
-  // Pre-compute the upper bound of `x' and `y'.
-  Octagonal_Shape<T> ub(x);
-  ub.upper_bound_assign(y);
-
-  // Compute redundancy information for x and y.
-  // TODO: provide a nicer data structure for redundancy.
-  std::vector<Bit_Row> x_non_red;
-  x.non_redundant_matrix_entries(x_non_red);
-  std::vector<Bit_Row> y_non_red;
-  y.non_redundant_matrix_entries(y_non_red);
-
-  PPL_DIRTY_TEMP(N, lhs);
-  PPL_DIRTY_TEMP(N, lhs_copy);
-  PPL_DIRTY_TEMP(N, rhs);
-  PPL_DIRTY_TEMP(N, temp_zero);
-  assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
-
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-  const dimension_type n_rows = x.matrix.num_rows();
-  const Row_Iterator x_m_begin = x.matrix.row_begin();
-  const Row_Iterator y_m_begin = y.matrix.row_begin();
-  const Row_Iterator ub_m_begin = ub.matrix.row_begin();
-
-  for (dimension_type i = n_rows; i-- > 0; ) {
-    const Bit_Row& x_non_red_i = x_non_red[i];
-    using namespace Implementation::Octagonal_Shapes;
-    const dimension_type ci = coherent_index(i);
-    const dimension_type row_size_i = OR_Matrix<N>::row_size(i);
-    Row_Reference x_i = *(x_m_begin + i);
-    Row_Reference y_i = *(y_m_begin + i);
-    Row_Reference ub_i = *(ub_m_begin + i);
-    const N& ub_i_ci = ub_i[ci];
-    for (dimension_type j = row_size_i; j-- > 0; ) {
-      // Check redundancy of x_i_j.
-      if (!x_non_red_i[j])
-        continue;
-      const N& x_i_j = x_i[j];
-      // Check 1st condition in BHZ09 theorem.
-      if (x_i_j >= y_i[j])
-        continue;
-      const dimension_type cj = coherent_index(j);
-      const dimension_type row_size_cj = OR_Matrix<N>::row_size(cj);
-      Row_Reference ub_cj = *(ub_m_begin + cj);
-      const N& ub_cj_j = ub_cj[j];
-      for (dimension_type k = 0; k < n_rows; ++k) {
-        const Bit_Row& y_non_red_k = y_non_red[k];
-        const dimension_type ck = coherent_index(k);
-        const dimension_type row_size_k = OR_Matrix<N>::row_size(k);
-        Row_Reference x_k = *(x_m_begin + k);
-        Row_Reference y_k = *(y_m_begin + k);
-        Row_Reference ub_k = *(ub_m_begin + k);
-        const N& ub_k_ck = ub_k[ck];
-        // Be careful: for each index h, the diagonal element m[h][h]
-        // is (by convention) +infty in our implementation; however,
-        // BHZ09 theorem assumes that it is equal to 0.
-        const N& ub_k_j
-          = (k == j)
-          ? temp_zero
-          : ((j < row_size_k) ? ub_k[j] : ub_cj[ck]);
-        const N& ub_i_ck
-          = (i == ck)
-          ? temp_zero
-          : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]);
-
-        for (dimension_type ell = row_size_k; ell-- > 0; ) {
-          // Check redundancy of y_k_ell.
-          if (!y_non_red_k[ell])
-            continue;
-          const N& y_k_ell = y_k[ell];
-          // Check 2nd condition in BHZ09 theorem.
-          if (y_k_ell >= x_k[ell])
-            continue;
-          const dimension_type cell = coherent_index(ell);
-          Row_Reference ub_cell = *(ub_m_begin + cell);
-          const N& ub_i_ell
-            = (i == ell)
-            ? temp_zero
-            : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]);
-          const N& ub_cj_ell
-            = (cj == ell)
-            ? temp_zero
-            : ((ell < row_size_cj) ? ub_cj[ell] : ub_cell[j]);
-          // Check 3rd condition in BHZ09 theorem.
-          add_assign_r(lhs, x_i_j, y_k_ell, ROUND_UP);
-          add_assign_r(rhs, ub_i_ell, ub_k_j, ROUND_UP);
-          if (lhs >= rhs)
-            continue;
-          // Check 4th condition in BHZ09 theorem.
-          add_assign_r(rhs, ub_i_ck, ub_cj_ell, ROUND_UP);
-          if (lhs >= rhs)
-            continue;
-          // Check 5th condition in BHZ09 theorem.
-          assign_r(lhs_copy, lhs, ROUND_NOT_NEEDED);
-          add_assign_r(lhs, lhs_copy, x_i_j, ROUND_UP);
-          add_assign_r(rhs, ub_i_ell, ub_i_ck, ROUND_UP);
-          add_assign_r(rhs, rhs, ub_cj_j, ROUND_UP);
-          if (lhs >= rhs)
-            continue;
-          // Check 6th condition in BHZ09 theorem.
-          add_assign_r(rhs, ub_k_j, ub_cj_ell, ROUND_UP);
-          add_assign_r(rhs, rhs, ub_i_ci, ROUND_UP);
-          if (lhs >= rhs)
-            continue;
-          // Check 7th condition of BHZ09 theorem.
-          add_assign_r(lhs, lhs_copy, y_k_ell, ROUND_UP);
-          add_assign_r(rhs, ub_i_ell, ub_cj_ell, ROUND_UP);
-          add_assign_r(rhs, rhs, ub_k_ck, ROUND_UP);
-          if (lhs >= rhs)
-            continue;
-          // Check 8th (last) condition in BHZ09 theorem.
-          add_assign_r(rhs, ub_k_j, ub_i_ck, ROUND_UP);
-          add_assign_r(rhs, rhs, ub_cell[ell], ROUND_UP);
-          if (lhs < rhs)
-            // All 8 conditions are satisfied:
-            // upper bound is not exact.
-            return false;
-        }
-      }
-    }
-  }
-
-  // The upper bound of x and y is indeed exact.
-  m_swap(ub);
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>
-::integer_upper_bound_assign_if_exact(const Octagonal_Shape& y) {
-  PPL_COMPILE_TIME_CHECK(std::numeric_limits<T>::is_integer,
-                         "Octagonal_Shape<T>::"
-                         "integer_upper_bound_assign_if_exact(y):"
-                         " T in not an integer datatype.");
-  // Declare a const reference to *this (to avoid accidental modifications).
-  const Octagonal_Shape& x = *this;
-  const dimension_type x_space_dim = x.space_dimension();
-
-  if (x_space_dim != y.space_dimension())
-    throw_dimension_incompatible("integer_upper_bound_assign_if_exact(y)", y);
-
-  // The zero-dim case is trivial.
-  if (x_space_dim == 0) {
-    upper_bound_assign(y);
-    return true;
-  }
-
-  // If `x' or `y' is (known to) contain no integral point,
-  // then the integer upper bound can be computed exactly by tight closure.
-  if (x.marked_empty()) {
-    *this = y;
-    tight_closure_assign();
-    return true;
-  }
-  else if (y.marked_empty()) {
-    tight_closure_assign();
-    return true;
-  }
-  else if (x.is_empty() || x.tight_coherence_would_make_empty()) {
-    *this = y;
-    tight_closure_assign();
-    return true;
-  }
-  else if (y.is_empty() || y.tight_coherence_would_make_empty()) {
-    tight_closure_assign();
-    return true;
-  }
-
-  // Here both `x' and `y' are known to be non-empty (and Z-consistent).
-  PPL_ASSERT(x.marked_strongly_closed());
-  PPL_ASSERT(y.marked_strongly_closed());
-  // Pre-compute the integer upper bound of `x' and `y':
-  // have to take copies, since tight closure might modify the rational shape.
-  Octagonal_Shape<T> tx(x);
-  tx.tight_closure_assign();
-  Octagonal_Shape<T> ty(y);
-  ty.tight_closure_assign();
-  Octagonal_Shape<T> ub(tx);
-  ub.upper_bound_assign(ty);
-
-  // Compute redundancy information for tx and ty.
-  // TODO: provide a nicer data structure for redundancy.
-  // NOTE: there is no need to identify all redundancies, since this is
-  // an optimization; hence we reuse the strong-reduction helper methods.
-  std::vector<Bit_Row> tx_non_red;
-  tx.non_redundant_matrix_entries(tx_non_red);
-  std::vector<Bit_Row> ty_non_red;
-  ty.non_redundant_matrix_entries(ty_non_red);
-
-  PPL_DIRTY_TEMP(N, lhs_i_j);
-  PPL_DIRTY_TEMP(N, lhs_k_ell);
-  PPL_DIRTY_TEMP(N, lhs);
-  PPL_DIRTY_TEMP(N, lhs_copy);
-  PPL_DIRTY_TEMP(N, rhs);
-  PPL_DIRTY_TEMP(N, temp_zero);
-  assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
-  PPL_DIRTY_TEMP(N, temp_one);
-  assign_r(temp_one, 1, ROUND_NOT_NEEDED);
-  PPL_DIRTY_TEMP(N, temp_two);
-  assign_r(temp_two, 2, ROUND_NOT_NEEDED);
-
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-  const dimension_type n_rows = tx.matrix.num_rows();
-  const Row_Iterator tx_m_begin = tx.matrix.row_begin();
-  const Row_Iterator ty_m_begin = ty.matrix.row_begin();
-  const Row_Iterator ub_m_begin = ub.matrix.row_begin();
-
-  for (dimension_type i = n_rows; i-- > 0; ) {
-    const Bit_Row& tx_non_red_i = tx_non_red[i];
-    using namespace Implementation::Octagonal_Shapes;
-    const dimension_type ci = coherent_index(i);
-    const dimension_type row_size_i = OR_Matrix<N>::row_size(i);
-    Row_Reference tx_i = *(tx_m_begin + i);
-    Row_Reference ty_i = *(ty_m_begin + i);
-    Row_Reference ub_i = *(ub_m_begin + i);
-    const N& ub_i_ci = ub_i[ci];
-    for (dimension_type j = row_size_i; j-- > 0; ) {
-      // Check redundancy of tx_i_j.
-      if (!tx_non_red_i[j])
-        continue;
-      const N& tx_i_j = tx_i[j];
-      const dimension_type cj = coherent_index(j);
-      const N& eps_i_j = (i == cj) ? temp_two : temp_one;
-      // Check condition 1a in BHZ09 Theorem 6.8.
-      add_assign_r(lhs_i_j, tx_i_j, eps_i_j, ROUND_NOT_NEEDED);
-      if (lhs_i_j > ty_i[j])
-        continue;
-      const dimension_type row_size_cj = OR_Matrix<N>::row_size(cj);
-      Row_Reference ub_cj = *(ub_m_begin + cj);
-      const N& ub_cj_j = ub_cj[j];
-      for (dimension_type k = 0; k < n_rows; ++k) {
-        const Bit_Row& ty_non_red_k = ty_non_red[k];
-        const dimension_type ck = coherent_index(k);
-        const dimension_type row_size_k = OR_Matrix<N>::row_size(k);
-        Row_Reference tx_k = *(tx_m_begin + k);
-        Row_Reference ty_k = *(ty_m_begin + k);
-        Row_Reference ub_k = *(ub_m_begin + k);
-        const N& ub_k_ck = ub_k[ck];
-        // Be careful: for each index h, the diagonal element m[h][h]
-        // is (by convention) +infty in our implementation; however,
-        // BHZ09 theorem assumes that it is equal to 0.
-        const N& ub_k_j
-          = (k == j)
-          ? temp_zero
-          : ((j < row_size_k) ? ub_k[j] : ub_cj[ck]);
-        const N& ub_i_ck
-          = (i == ck)
-          ? temp_zero
-          : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]);
-
-        for (dimension_type ell = row_size_k; ell-- > 0; ) {
-          // Check redundancy of y_k_ell.
-          if (!ty_non_red_k[ell])
-            continue;
-          const N& ty_k_ell = ty_k[ell];
-          const dimension_type cell = coherent_index(ell);
-          const N& eps_k_ell = (k == cell) ? temp_two : temp_one;
-          // Check condition 1b in BHZ09 Theorem 6.8.
-          add_assign_r(lhs_k_ell, ty_k_ell, eps_k_ell, ROUND_NOT_NEEDED);
-          if (lhs_k_ell > tx_k[ell])
-            continue;
-          Row_Reference ub_cell = *(ub_m_begin + cell);
-          const N& ub_i_ell
-            = (i == ell)
-            ? temp_zero
-            : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]);
-          const N& ub_cj_ell
-            = (cj == ell)
-            ? temp_zero
-            : ((ell < row_size_cj) ? ub_cj[ell] : ub_cell[j]);
-          // Check condition 2a in BHZ09 Theorem 6.8.
-          add_assign_r(lhs, lhs_i_j, lhs_k_ell, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, ub_i_ell, ub_k_j, ROUND_NOT_NEEDED);
-          if (lhs > rhs)
-            continue;
-          // Check condition 2b in BHZ09 Theorem 6.8.
-          add_assign_r(rhs, ub_i_ck, ub_cj_ell, ROUND_NOT_NEEDED);
-          if (lhs > rhs)
-            continue;
-          // Check condition 3a in BHZ09 Theorem 6.8.
-          assign_r(lhs_copy, lhs, ROUND_NOT_NEEDED);
-          add_assign_r(lhs, lhs, lhs_i_j, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, ub_i_ell, ub_i_ck, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, rhs, ub_cj_j, ROUND_NOT_NEEDED);
-          if (lhs > rhs)
-            continue;
-          // Check condition 3b in BHZ09 Theorem 6.8.
-          add_assign_r(rhs, ub_k_j, ub_cj_ell, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, rhs, ub_i_ci, ROUND_NOT_NEEDED);
-          if (lhs > rhs)
-            continue;
-          // Check condition 4a in BHZ09 Theorem 6.8.
-          add_assign_r(lhs, lhs_copy, lhs_k_ell, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, ub_i_ell, ub_cj_ell, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, rhs, ub_k_ck, ROUND_NOT_NEEDED);
-          if (lhs > rhs)
-            continue;
-          // Check condition 4b in BHZ09 Theorem 6.8.
-          add_assign_r(rhs, ub_k_j, ub_i_ck, ROUND_NOT_NEEDED);
-          add_assign_r(rhs, rhs, ub_cell[ell], ROUND_NOT_NEEDED);
-          if (lhs <= rhs)
-            // All 8 conditions are satisfied:
-            // integer upper bound is not exact.
-            return false;
-        }
-      }
-    }
-  }
-
-  // The upper bound of x and y is indeed exact.
-  m_swap(ub);
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::drop_some_non_integer_points(Complexity_Class) {
-  if (std::numeric_limits<T>::is_integer)
-    return;
-
-  const dimension_type space_dim = space_dimension();
-  strong_closure_assign();
-  if (space_dim == 0 || marked_empty())
-    return;
-
-  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
-         i_end = matrix.element_end(); i != i_end; ++i)
-    drop_some_non_integer_points_helper(*i);
-
-  // Unary constraints should have an even integer boundary.
-  PPL_DIRTY_TEMP(N, temp_one);
-  assign_r(temp_one, 1, ROUND_NOT_NEEDED);
-  for (dimension_type i = 0; i < 2*space_dim; i += 2) {
-    const dimension_type ci = i + 1;
-    N& mat_i_ci = matrix[i][ci];
-    if (!is_plus_infinity(mat_i_ci) && !is_even(mat_i_ci)) {
-      sub_assign_r(mat_i_ci, mat_i_ci, temp_one, ROUND_UP);
-      reset_strongly_closed();
-    }
-    N& mat_ci_i = matrix[ci][i];
-    if (!is_plus_infinity(mat_ci_i) && !is_even(mat_ci_i)) {
-      sub_assign_r(mat_ci_i, mat_ci_i, temp_one, ROUND_UP);
-      reset_strongly_closed();
-    }
-  }
-
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::drop_some_non_integer_points(const Variables_Set& vars,
-                               Complexity_Class) {
-  // Dimension-compatibility check.
-  const dimension_type min_space_dim = vars.space_dimension();
-  if (space_dimension() < min_space_dim)
-    throw_dimension_incompatible("drop_some_non_integer_points(vs, cmpl)",
-                                 min_space_dim);
-
-  if (std::numeric_limits<T>::is_integer || min_space_dim == 0)
-    return;
-
-  strong_closure_assign();
-  if (marked_empty())
-    return;
-
-  PPL_DIRTY_TEMP(N, temp_one);
-  assign_r(temp_one, 1, ROUND_NOT_NEEDED);
-
-  const Variables_Set::const_iterator v_begin = vars.begin();
-  const Variables_Set::const_iterator v_end = vars.end();
-  PPL_ASSERT(v_begin != v_end);
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
-  for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
-    const dimension_type i = 2 * (*v_i);
-    const dimension_type ci = i + 1;
-    Row_Reference m_i = matrix[i];
-    Row_Reference m_ci = matrix[ci];
-
-    // Unary constraints: should be even integers.
-    N& m_i_ci = m_i[ci];
-    if (!is_plus_infinity(m_i_ci)) {
-      drop_some_non_integer_points_helper(m_i_ci);
-      if (!is_even(m_i_ci)) {
-        sub_assign_r(m_i_ci, m_i_ci, temp_one, ROUND_UP);
-        reset_strongly_closed();
-      }
-    }
-    N& m_ci_i = m_ci[i];
-    if (!is_plus_infinity(m_ci_i)) {
-      drop_some_non_integer_points_helper(m_ci_i);
-      if (!is_even(m_ci_i)) {
-        sub_assign_r(m_ci_i, m_ci_i, temp_one, ROUND_UP);
-        reset_strongly_closed();
-      }
-    }
-
-    // Binary constraints (note: only consider j < i).
-    for (Variables_Set::const_iterator v_j = v_begin; v_j != v_i; ++v_j) {
-      const dimension_type j = 2 * (*v_j);
-      const dimension_type cj = j + 1;
-      drop_some_non_integer_points_helper(m_i[j]);
-      drop_some_non_integer_points_helper(m_i[cj]);
-      drop_some_non_integer_points_helper(m_ci[j]);
-      drop_some_non_integer_points_helper(m_ci[cj]);
-    }
-  }
-  PPL_ASSERT(OK());
-}
-
-template <typename T>
-template <typename U>
-void
-Octagonal_Shape<T>
-::export_interval_constraints(U& dest) const {
-  if (space_dim > dest.space_dimension())
-    throw std::invalid_argument(
-               "Octagonal_Shape<T>::export_interval_constraints");
-
-  strong_closure_assign();
-
-  if (marked_empty()) {
-    dest.set_empty();
-    return;
-  }
-
-  PPL_DIRTY_TEMP(N, lb);
-  PPL_DIRTY_TEMP(N, ub);
-  for (dimension_type i = space_dim; i-- > 0; ) {
-    const dimension_type ii = 2*i;
-    const dimension_type cii = ii + 1;
-
-    // Set the upper bound.
-    const N& twice_ub = matrix[cii][ii];
-    if (!is_plus_infinity(twice_ub)) {
-      assign_r(ub, twice_ub, ROUND_NOT_NEEDED);
-      div_2exp_assign_r(ub, ub, 1, ROUND_UP);
-      // FIXME: passing a raw value may not be general enough.
-      if (!dest.restrict_upper(i, ub.raw_value()))
-        return;
-    }
-
-    // Set the lower bound.
-    const N& twice_lb = matrix[ii][cii];
-    if (!is_plus_infinity(twice_lb)) {
-      assign_r(lb, twice_lb, ROUND_NOT_NEEDED);
-      neg_assign_r(lb, lb, ROUND_NOT_NEEDED);
-      div_2exp_assign_r(lb, lb, 1, ROUND_DOWN);
-      // FIXME: passing a raw value may not be general enough.
-      if (!dest.restrict_lower(i, lb.raw_value()))
-        return;
-    }
-  }
-
-}
-
-/*! \relates Parma_Polyhedra_Library::Octagonal_Shape */
-template <typename T>
-std::ostream&
-IO_Operators::operator<<(std::ostream& s, const Octagonal_Shape<T>& oct) {
-  // Handle special cases first.
-  if (oct.marked_empty()) {
-    s << "false";
-    return s;
-  }
-  if (oct.is_universe()) {
-    s << "true";
-    return s;
-  }
-
-  typedef typename Octagonal_Shape<T>::coefficient_type N;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
-
-  // Records whether or not we still have to print the first constraint.
-  bool first = true;
-
-  Row_Iterator m_begin = oct.matrix.row_begin();
-  Row_Iterator m_end = oct.matrix.row_end();
-
-  // Temporaries.
-  PPL_DIRTY_TEMP(N, negation);
-  PPL_DIRTY_TEMP(N, half);
-  // Go through all the unary constraints.
-  // (Note: loop iterator is incremented in the loop body.)
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
-    const dimension_type i = i_iter.index();
-    const Variable v_i(i/2);
-    const N& c_i_ii = (*i_iter)[i + 1];
-    ++i_iter;
-    const N& c_ii_i = (*i_iter)[i];
-    ++i_iter;
-    // Check whether or not it is an equality constraint.
-    if (is_additive_inverse(c_i_ii, c_ii_i)) {
-      // It is an equality.
-      PPL_ASSERT(!is_plus_infinity(c_i_ii) && !is_plus_infinity(c_ii_i));
-      if (first)
-        first = false;
-      else
-        s << ", ";
-      // If the value bound can NOT be divided by 2 exactly,
-      // then we output the constraint `2*v_i = bound'.
-      if (div_2exp_assign_r(half, c_ii_i, 1,
-                            ROUND_UP | ROUND_STRICT_RELATION)
-          == V_EQ)
-        s << v_i << " = " << half;
-      else
-        s << "2*" << v_i << " = " << c_ii_i;
-    }
-    else {
-      // We will print unary non-strict inequalities, if any.
-      if (!is_plus_infinity(c_i_ii)) {
-        if (first)
-          first = false;
-        else
-          s << ", ";
-        neg_assign_r(negation, c_i_ii, ROUND_NOT_NEEDED);
-        // If the value bound can NOT be divided by 2 exactly,
-        // then we output the constraint `2*v_i >= negation'.
-        if (div_2exp_assign_r(half, negation, 1,
-                              ROUND_UP | ROUND_STRICT_RELATION)
-            == V_EQ)
-          s << v_i << " >= " << half;
-        else
-          s << "2*" << v_i << " >= " << negation;
-      }
-      if (!is_plus_infinity(c_ii_i)) {
-        if (first)
-          first = false;
-        else
-          s << ", ";
-        // If the value bound can NOT be divided by 2 exactly,
-        // then we output the constraint `2*v_i <= bound'.
-        if (div_2exp_assign_r(half, c_ii_i, 1,
-                              ROUND_UP | ROUND_STRICT_RELATION)
-            == V_EQ)
-          s << v_i << " <= " << half;
-        else
-          s << "2*" << v_i << " <= " << c_ii_i;
-      }
-    }
-  }
-
-  // Go through all the binary constraints.
-  // (Note: loop iterator is incremented in the loop body.)
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
-    const dimension_type i = i_iter.index();
-    const Variable v_i(i/2);
-    Row_Reference r_i = *i_iter;
-    ++i_iter;
-    Row_Reference r_ii = *i_iter;
-    ++i_iter;
-
-    for (dimension_type j = 0; j < i; j += 2) {
-      const Variable v_j(j/2);
-      // Print binary differences.
-      const N& c_ii_jj = r_ii[j + 1];
-      const N& c_i_j = r_i[j];
-      // Check whether or not it is an equality constraint.
-      if (is_additive_inverse(c_ii_jj, c_i_j)) {
-        // It is an equality.
-        PPL_ASSERT(!is_plus_infinity(c_i_j) && !is_plus_infinity(c_ii_jj));
-        if (first)
-          first = false;
-        else
-          s << ", ";
-        if (sgn(c_i_j) >= 0)
-          s << v_j << " - " << v_i << " = " << c_i_j;
-        else
-          s << v_i << " - " << v_j << " = " << c_ii_jj;
-      }
-      else {
-        // We will print non-strict inequalities, if any.
-        if (!is_plus_infinity(c_i_j)) {
-          if (first)
-            first = false;
-          else
-            s << ", ";
-          if (sgn(c_i_j) >= 0)
-            s << v_j << " - " << v_i << " <= " << c_i_j;
-          else {
-            neg_assign_r(negation, c_i_j, ROUND_DOWN);
-            s << v_i << " - " << v_j << " >= " << negation;
-          }
-        }
-        if (!is_plus_infinity(c_ii_jj)) {
-          if (first)
-            first = false;
-          else
-            s << ", ";
-          if (sgn(c_ii_jj) >= 0)
-            s << v_i << " - " << v_j << " <= " << c_ii_jj;
-          else {
-            neg_assign_r(negation, c_ii_jj, ROUND_DOWN);
-            s << v_j << " - " << v_i << " >= " << negation;
-          }
-        }
-      }
-      // Print binary sums.
-      const N& c_i_jj = r_i[j + 1];
-      const N& c_ii_j = r_ii[j];
-      // Check whether or not it is an equality constraint.
-      if (is_additive_inverse(c_i_jj, c_ii_j)) {
-        // It is an equality.
-        PPL_ASSERT(!is_plus_infinity(c_i_jj) && !is_plus_infinity(c_ii_j));
-        if (first)
-          first = false;
-        else
-          s << ", ";
-        s << v_j << " + " << v_i << " = " << c_ii_j;
-      }
-      else {
-        // We will print non-strict inequalities, if any.
-        if (!is_plus_infinity(c_i_jj)) {
-          if (first)
-            first = false;
-          else
-            s << ", ";
-          neg_assign_r(negation, c_i_jj, ROUND_DOWN);
-          s << v_j << " + " << v_i << " >= " << negation;
-        }
-        if (!is_plus_infinity(c_ii_j)) {
-          if (first)
-            first = false;
-          else
-            s << ", ";
-          s << v_j << " + " << v_i << " <= " << c_ii_j;
-        }
-      }
-    }
-  }
-  return s;
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::ascii_dump(std::ostream& s) const {
-  s << "space_dim "
-    << space_dim
-    << "\n";
-  status.ascii_dump(s);
-  s << "\n";
-  matrix.ascii_dump(s);
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, Octagonal_Shape<T>)
-
-template <typename T>
-bool
-Octagonal_Shape<T>::ascii_load(std::istream& s) {
-  std::string str;
-
-  if (!(s >> str) || str != "space_dim")
-    return false;
-
-  if (!(s >> space_dim))
-    return false;
-
-  if (!status.ascii_load(s))
-    return false;
-
-  if (!matrix.ascii_load(s))
-    return false;
-
-  PPL_ASSERT(OK());
-  return true;
-}
-
-template <typename T>
-memory_size_type
-Octagonal_Shape<T>::external_memory_in_bytes() const {
-  return matrix.external_memory_in_bytes();
-}
-
-template <typename T>
-bool
-Octagonal_Shape<T>::OK() const {
-  // Check whether the matrix is well-formed.
-  if (!matrix.OK())
-    return false;
-
-  // Check whether the status information is legal.
-  if (!status.OK())
-    return false;
-
-  // All empty octagons are OK.
-  if (marked_empty())
-    return true;
-
-  // 0-dim universe octagon is OK.
-  if (space_dim == 0)
-    return true;
-
-  // MINUS_INFINITY cannot occur at all.
-  for (typename OR_Matrix<N>::const_row_iterator i = matrix.row_begin(),
-         matrix_row_end = matrix.row_end(); i != matrix_row_end; ++i) {
-    typename OR_Matrix<N>::const_row_reference_type x_i = *i;
-    for (dimension_type j = i.row_size(); j-- > 0; )
-      if (is_minus_infinity(x_i[j])) {
-#ifndef NDEBUG
-        using namespace Parma_Polyhedra_Library::IO_Operators;
-        std::cerr << "Octagonal_Shape::"
-                  << "matrix[" << i.index() << "][" << j << "] = "
-                  << x_i[j] << "!"
-                  << std::endl;
-#endif
-        return false;
-      }
-  }
-
-  // On the main diagonal only PLUS_INFINITY can occur.
-  for (typename OR_Matrix<N>::const_row_iterator i = matrix.row_begin(),
-         m_end = matrix.row_end(); i != m_end; ++i) {
-    typename OR_Matrix<N>::const_row_reference_type r = *i;
-    const N& m_i_i = r[i.index()];
-    if (!is_plus_infinity(m_i_i)) {
-#ifndef NDEBUG
-      const dimension_type j = i.index();
-      using namespace Parma_Polyhedra_Library::IO_Operators;
-      std::cerr << "Octagonal_Shape::matrix[" << j << "][" << j << "] = "
-                << m_i_i << "!  (+inf was expected.)\n";
-#endif
-      return false;
-    }
-  }
-
-  // The following tests might result in false alarms when using floating
-  // point coefficients: they are only meaningful if the coefficient type
-  // base is exact (since otherwise strong closure is approximated).
-  if (std::numeric_limits<coefficient_type_base>::is_exact) {
-
-    // Check whether the closure information is legal.
-    if (marked_strongly_closed()) {
-      Octagonal_Shape x = *this;
-      x.reset_strongly_closed();
-      x.strong_closure_assign();
-      if (x.matrix != matrix) {
-#ifndef NDEBUG
-        std::cerr << "Octagonal_Shape is marked as strongly closed "
-                  << "but it is not!\n";
-#endif
-        return false;
-      }
-    }
-
-    // A closed octagon must be strong-coherent.
-    if (marked_strongly_closed())
-      if (!is_strong_coherent()) {
-#ifndef NDEBUG
-        std::cerr << "Octagonal_Shape is not strong-coherent!\n";
-#endif
-        return false;
-      }
-  }
-
-  // All checks passed.
-  return true;
-}
-
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::throw_dimension_incompatible(const char* method,
-                               const Octagonal_Shape& y) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", y->space_dimension() == " << y.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::throw_dimension_incompatible(const char* method,
-                               dimension_type required_dim) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", required dimension == " << required_dim << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::throw_dimension_incompatible(const char* method,
-                                                 const Constraint& c) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", c->space_dimension == " << c.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::throw_dimension_incompatible(const char* method,
-                                                 const Congruence& cg) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", cg->space_dimension == " << cg.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::throw_dimension_incompatible(const char* method,
-                                                 const Generator& g) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", g->space_dimension == " << g.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::throw_constraint_incompatible(const char* method) {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "the constraint is incompatible.";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::throw_expression_too_complex(const char* method,
-                                                 const Linear_Expression& le) {
-  using namespace IO_Operators;
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << le << " is too complex.";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>
-::throw_dimension_incompatible(const char* method,
-                               const char* le_name,
-                               const Linear_Expression& le) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", " << le_name << "->space_dimension() == "
-    << le.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-template <typename C>
-void
-Octagonal_Shape<T>
-::throw_dimension_incompatible(const char* method,
-                               const char* lf_name,
-                               const Linear_Form<C>& lf) const {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << "this->space_dimension() == " << space_dimension()
-    << ", " << lf_name << "->space_dimension() == "
-    << lf.space_dimension() << ".";
-  throw std::invalid_argument(s.str());
-}
-
-template <typename T>
-void
-Octagonal_Shape<T>::throw_invalid_argument(const char* method,
-                                           const char* reason) {
-  std::ostringstream s;
-  s << "PPL::Octagonal_Shape::" << method << ":\n"
-    << reason << ".";
-  throw std::invalid_argument(s.str());
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Octagonal_Shape_templates_hh)
diff --git a/src/Octagonal_Shape.types.hh b/src/Octagonal_Shape.types.hh
deleted file mode 100644
index 2c0af90..0000000
--- a/src/Octagonal_Shape.types.hh
+++ /dev/null
@@ -1,25 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Octagonal_Shape_types_hh
-#define PPL_Octagonal_Shape_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-class Octagonal_Shape;
-
-class Octagonal_Shape_Helper;
-
-}
-
-#endif // !defined(PPL_Octagonal_Shape_types_hh)
diff --git a/src/Octagonal_Shape_defs.hh b/src/Octagonal_Shape_defs.hh
new file mode 100644
index 0000000..6cff16b
--- /dev/null
+++ b/src/Octagonal_Shape_defs.hh
@@ -0,0 +1,2324 @@
+/* Octagonal_Shape class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Octagonal_Shape_defs_hh
+#define PPL_Octagonal_Shape_defs_hh 1
+
+#include "Octagonal_Shape_types.hh"
+#include "globals_types.hh"
+#include "Constraint_types.hh"
+#include "Generator_types.hh"
+#include "Congruence_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_System_types.hh"
+#include "Congruence_System_types.hh"
+#include "OR_Matrix_defs.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "Polyhedron_types.hh"
+#include "Box_types.hh"
+#include "Grid_types.hh"
+#include "BD_Shape_types.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_types.hh"
+#include "Checked_Number_defs.hh"
+#include "WRD_coefficient_types_defs.hh"
+#include "Bit_Row_defs.hh"
+#include "Interval_types.hh"
+#include "Linear_Form_types.hh"
+#include <vector>
+#include <cstddef>
+#include <climits>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Octagonal_Shape
+  Writes a textual representation of \p oct on \p s:
+  <CODE>false</CODE> is written if \p oct is an empty polyhedron;
+  <CODE>true</CODE> is written if \p oct is a universe polyhedron;
+  a system of constraints defining \p oct is written otherwise,
+  all constraints separated by ", ".
+*/
+template <typename T>
+std::ostream&
+operator<<(std::ostream& s, const Octagonal_Shape<T>& oct);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Octagonal_Shape */
+template <typename T>
+void swap(Octagonal_Shape<T>& x, Octagonal_Shape<T>& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x and \p y are the same octagon.
+
+  \relates Octagonal_Shape
+  Note that \p x and \p y may be dimension-incompatible shapes:
+  in this case, the value <CODE>false</CODE> is returned.
+*/
+template <typename T>
+bool operator==(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x and \p y are different shapes.
+
+  \relates Octagonal_Shape
+  Note that \p x and \p y may be dimension-incompatible shapes:
+  in this case, the value <CODE>true</CODE> is returned.
+*/
+template <typename T>
+bool operator!=(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Octagonal_Shape<T>& x,
+                                 const Octagonal_Shape<T>& y,
+                                 Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Octagonal_Shape<T>& x,
+                                 const Octagonal_Shape<T>& y,
+                                 Rounding_Dir dir);
+
+//! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the rectilinear distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename T>
+bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                 const Octagonal_Shape<T>& x,
+                                 const Octagonal_Shape<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const Octagonal_Shape<T>& x,
+                               const Octagonal_Shape<T>& y,
+                               Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const Octagonal_Shape<T>& x,
+                               const Octagonal_Shape<T>& y,
+                               Rounding_Dir dir);
+
+//! Computes the euclidean distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the euclidean distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename T>
+bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                               const Octagonal_Shape<T>& x,
+                               const Octagonal_Shape<T>& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
+*/
+template <typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const Octagonal_Shape<T>& x,
+                                const Octagonal_Shape<T>& y,
+                                Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using variables of type
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
+*/
+template <typename Temp, typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const Octagonal_Shape<T>& x,
+                                const Octagonal_Shape<T>& y,
+                                Rounding_Dir dir);
+
+//! Computes the \f$L_\infty\f$ distance between \p x and \p y.
+/*! \relates Octagonal_Shape
+  If the \f$L_\infty\f$ distance between \p x and \p y is defined,
+  stores an approximation of it into \p r and returns <CODE>true</CODE>;
+  returns <CODE>false</CODE> otherwise.
+
+  The direction of the approximation is specified by \p dir.
+
+  All computations are performed using the temporary variables
+  \p tmp0, \p tmp1 and \p tmp2.
+*/
+template <typename Temp, typename To, typename T>
+bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                                const Octagonal_Shape<T>& x,
+                                const Octagonal_Shape<T>& y,
+                                Rounding_Dir dir,
+                                Temp& tmp0,
+                                Temp& tmp1,
+                                Temp& tmp2);
+
+// This class contains some helper functions that need to be friends of
+// Linear_Expression.
+class Octagonal_Shape_Helper {
+public:
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! Decodes the constraint \p c as an octagonal difference.
+  /*! \relates Octagonal_Shape
+    \return
+    <CODE>true</CODE> if the constraint \p c is an octagonal difference;
+    <CODE>false</CODE> otherwise.
+
+    \param c
+    The constraint to be decoded.
+
+    \param c_space_dim
+    The space dimension of the constraint \p c (it is <EM>assumed</EM>
+    to match the actual space dimension of \p c).
+
+    \param c_num_vars
+    If <CODE>true</CODE> is returned, then it will be set to the number
+    of variables having a non-zero coefficient. The only legal values
+    will therefore be 0, 1 and 2.
+
+    \param c_first_var
+    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
+    then it will be set to the index of the first variable having
+    a non-zero coefficient in \p c.
+
+    \param c_second_var
+    If <CODE>true</CODE> is returned and if \p c_num_vars is set to 2,
+    then it will be set to the index of the second variable having
+    a non-zero coefficient in \p c.
+
+    \param c_coeff
+    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
+    then it will be set to the value of the first non-zero coefficient
+    in \p c.
+
+    \param c_term
+    If <CODE>true</CODE> is returned and if \p c_num_vars is not set to 0,
+    then it will be set to the right value of the inhomogeneous term
+    of \p c.
+  */
+  #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  static bool extract_octagonal_difference(const Constraint& c,
+                                           dimension_type c_space_dim,
+                                           dimension_type& c_num_vars,
+                                           dimension_type& c_first_var,
+                                           dimension_type& c_second_var,
+                                           Coefficient& c_coeff,
+                                           Coefficient& c_term);
+};
+
+} // namespace Parma_Polyhedra_Library
+
+//! An octagonal shape.
+/*! \ingroup PPL_CXX_interface
+  The class template Octagonal_Shape<T> allows for the efficient
+  representation of a restricted kind of <EM>topologically closed</EM>
+  convex polyhedra called <EM>octagonal shapes</EM> (OSs, for short).
+  The name comes from the fact that, in a vector space of dimension 2,
+  bounded OSs are polygons with at most eight sides.
+  The closed affine half-spaces that characterize the OS can be expressed
+  by constraints of the form
+  \f[
+    ax_i + bx_j \leq k
+  \f]
+  where \f$a, b \in \{-1, 0, 1\}\f$ and \f$k\f$ is a rational number,
+  which are called <EM>octagonal constraints</EM>.
+
+  Based on the class template type parameter \p T, a family of extended
+  numbers is built and used to approximate the inhomogeneous term of
+  octagonal constraints. These extended numbers provide a representation
+  for the value \f$+\infty\f$, as well as <EM>rounding-aware</EM>
+  implementations for several arithmetic functions.
+  The value of the type parameter \p T may be one of the following:
+    - a bounded precision integer type (e.g., \c int32_t or \c int64_t);
+    - a bounded precision floating point type (e.g., \c float or \c double);
+    - an unbounded integer or rational type, as provided by GMP
+      (i.e., \c mpz_class or \c mpq_class).
+
+  The user interface for OSs is meant to be as similar as possible to
+  the one developed for the polyhedron class C_Polyhedron.
+
+  The OS domain <EM>optimally supports</EM>:
+    - tautological and inconsistent constraints and congruences;
+    - octagonal constraints;
+    - non-proper congruences (i.e., equalities) that are expressible
+      as octagonal constraints.
+
+  Depending on the method, using a constraint or congruence that is not
+  optimally supported by the domain will either raise an exception or
+  result in a (possibly non-optimal) upward approximation.
+
+  A constraint is octagonal if it has the form
+    \f[
+      \pm a_i x_i \pm a_j x_j \relsym b
+    \f]
+  where \f$\mathord{\relsym} \in \{ \leq, =, \geq \}\f$ and
+  \f$a_i\f$, \f$a_j\f$, \f$b\f$ are integer coefficients such that
+  \f$a_i = 0\f$, or \f$a_j = 0\f$, or \f$a_i = a_j\f$.
+  The user is warned that the above octagonal Constraint object
+  will be mapped into a \e correct and \e optimal approximation that,
+  depending on the expressive power of the chosen template argument \p T,
+  may loose some precision.
+  Also note that strict constraints are not octagonal.
+
+  For instance, a Constraint object encoding \f$3x + 3y \leq 1\f$ will be
+  approximated by:
+    - \f$x + y \leq 1\f$,
+      if \p T is a (bounded or unbounded) integer type;
+    - \f$x + y \leq \frac{1}{3}\f$,
+      if \p T is the unbounded rational type \c mpq_class;
+    - \f$x + y \leq k\f$, where \f$k > \frac{1}{3}\f$,
+      if \p T is a floating point type (having no exact representation
+      for \f$\frac{1}{3}\f$).
+
+  On the other hand, depending from the context, a Constraint object
+  encoding \f$3x - y \leq 1\f$ will be either upward approximated
+  (e.g., by safely ignoring it) or it will cause an exception.
+
+  In the following examples it is assumed that the type argument \p T
+  is one of the possible instances listed above and that variables
+  \c x, \c y and \c z are defined (where they are used) as follows:
+  \code
+    Variable x(0);
+    Variable y(1);
+    Variable z(2);
+  \endcode
+
+  \par Example 1
+  The following code builds an OS corresponding to a cube in \f$\Rset^3\f$,
+  given as a system of constraints:
+  \code
+    Constraint_System cs;
+    cs.insert(x >= 0);
+    cs.insert(x <= 3);
+    cs.insert(y >= 0);
+    cs.insert(y <= 3);
+    cs.insert(z >= 0);
+    cs.insert(z <= 3);
+    Octagonal_Shape<T> oct(cs);
+  \endcode
+  In contrast, the following code will raise an exception,
+  since constraints 7, 8, and 9 are not octagonal:
+  \code
+    Constraint_System cs;
+    cs.insert(x >= 0);
+    cs.insert(x <= 3);
+    cs.insert(y >= 0);
+    cs.insert(y <= 3);
+    cs.insert(z >= 0);
+    cs.insert(z <= 3);
+    cs.insert(x - 3*y <= 5);    // (7)
+    cs.insert(x - y + z <= 5);  // (8)
+    cs.insert(x + y + z <= 5);  // (9)
+    Octagonal_Shape<T> oct(cs);
+  \endcode
+*/
+template <typename T>
+class Parma_Polyhedra_Library::Octagonal_Shape {
+private:
+  /*! \brief
+    The (extended) numeric type of the inhomogeneous term of
+    the inequalities defining an OS.
+  */
+#ifndef NDEBUG
+  typedef Checked_Number<T, Debug_WRD_Extended_Number_Policy> N;
+#else
+  typedef Checked_Number<T, WRD_Extended_Number_Policy> N;
+#endif
+
+public:
+
+  //! The numeric base type upon which OSs are built.
+  typedef T coefficient_type_base;
+
+  /*! \brief
+    The (extended) numeric type of the inhomogeneous term of the
+    inequalities defining an OS.
+  */
+  typedef N coefficient_type;
+
+  //! Returns the maximum space dimension that an OS can handle.
+  static dimension_type max_space_dimension();
+
+  /*! \brief
+    Returns false indicating that this domain cannot recycle constraints
+  */
+  static bool can_recycle_constraint_systems();
+
+  /*! \brief
+    Returns false indicating that this domain cannot recycle congruences
+  */
+  static bool can_recycle_congruence_systems();
+
+  //! \name Constructors, Assignment, Swap and Destructor
+  //@{
+
+  //! Builds an universe or empty OS of the specified space dimension.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the OS;
+
+    \param kind
+    Specifies whether the universe or the empty OS has to be built.
+  */
+  explicit Octagonal_Shape(dimension_type num_dimensions = 0,
+                           Degenerate_Element kind = UNIVERSE);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  Octagonal_Shape(const Octagonal_Shape& y,
+                  Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a conservative, upward approximation of \p y.
+  /*!
+    The complexity argument is ignored.
+  */
+  template <typename U>
+  explicit Octagonal_Shape(const Octagonal_Shape<U>& y,
+                           Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds an OS from the system of constraints \p cs.
+  /*!
+    The OS inherits the space dimension of \p cs.
+
+    \param cs
+    A system of octagonal constraints.
+
+    \exception std::invalid_argument
+    Thrown if \p cs contains a constraint which is not optimally supported
+    by the Octagonal shape domain.
+  */
+  explicit Octagonal_Shape(const Constraint_System& cs);
+
+  //! Builds an OS from a system of congruences.
+  /*!
+    The OS inherits the space dimension of \p cgs
+
+    \param cgs
+    A system of congruences.
+
+    \exception std::invalid_argument
+    Thrown if \p cgs contains a congruence which is not optimally supported
+    by the Octagonal shape domain.
+  */
+  explicit Octagonal_Shape(const Congruence_System& cgs);
+
+  //! Builds an OS from the system of generators \p gs.
+  /*!
+    Builds the smallest OS containing the polyhedron defined by \p gs.
+    The OS inherits the space dimension of \p gs.
+
+    \exception std::invalid_argument
+    Thrown if the system of generators is not empty but has no points.
+  */
+  explicit Octagonal_Shape(const Generator_System& gs);
+
+  //! Builds an OS from the polyhedron \p ph.
+  /*!
+    Builds an OS containing \p ph using algorithms whose complexity
+    does not exceed the one specified by \p complexity.  If
+    \p complexity is \p ANY_COMPLEXITY, then the OS built is the
+    smallest one containing \p ph.
+  */
+  explicit Octagonal_Shape(const Polyhedron& ph,
+                           Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds an OS out of a box.
+  /*!
+    The OS inherits the space dimension of the box.
+    The built OS is the most precise OS that includes the box.
+
+    \param box
+    The box representing the OS to be built.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename Interval>
+  explicit Octagonal_Shape(const Box<Interval>& box,
+                           Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds an OS that approximates a grid.
+  /*!
+    The OS inherits the space dimension of the grid.
+    The built OS is the most precise OS that includes the grid.
+
+    \param grid
+    The grid used to build the OS.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p grid exceeds the maximum
+    allowed space dimension.
+  */
+  explicit Octagonal_Shape(const Grid& grid,
+                           Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds an OS from a BD shape.
+  /*!
+    The OS inherits the space dimension of the BD shape.
+    The built OS is the most precise OS that includes the BD shape.
+
+    \param bd
+    The BD shape used to build the OS.
+
+    \param complexity
+    This argument is ignored as the algorithm used has
+    polynomial complexity.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p bd exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename U>
+  explicit Octagonal_Shape(const BD_Shape<U>& bd,
+                           Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator.
+    (\p *this and \p y can be dimension-incompatible.)
+  */
+  Octagonal_Shape& operator=(const Octagonal_Shape& y);
+
+  /*! \brief
+    Swaps \p *this with octagon \p y.
+    (\p *this and \p y can be dimension-incompatible.)
+  */
+  void m_swap(Octagonal_Shape& y);
+
+  //! Destructor.
+  ~Octagonal_Shape();
+
+  //@} Constructors, Assignment, Swap and Destructor
+
+  //! \name Member Functions that Do Not Modify the Octagonal_Shape
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
+    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
+    of \p *this.
+  */
+  dimension_type affine_dimension() const;
+
+  //! Returns the system of constraints defining \p *this.
+  Constraint_System constraints() const;
+
+  //! Returns a minimized system of constraints defining \p *this.
+  Constraint_System minimized_constraints() const;
+
+  //! Returns a system of (equality) congruences satisfied by \p *this.
+  Congruence_System congruences() const;
+
+  /*! \brief
+    Returns a minimal system of (equality) congruences
+    satisfied by \p *this with the same affine dimension as \p *this.
+  */
+  Congruence_System minimized_congruences() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool contains(const Octagonal_Shape& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool strictly_contains(const Octagonal_Shape& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool is_disjoint_from(const Octagonal_Shape& y) const;
+
+  /*! \brief
+    Returns the relations holding between \p *this and the constraint \p c.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  /*! \brief
+    Returns the relations holding between \p *this and the congruence \p cg.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cg are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  /*! \brief
+    Returns the relations holding between \p *this and the generator \p g.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  Poly_Gen_Relation relation_with(const Generator& g) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is an empty OS.
+  bool is_empty() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is a universe OS.
+  bool is_universe() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
+  bool is_discrete() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a bounded OS.
+  */
+  bool is_bounded() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a topologically closed subset of the vector space.
+  */
+  bool is_topologically_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains (at least) an integer point.
+  */
+  bool contains_integer_point() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  bool constrains(Variable var) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from above in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from below in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
+    and \p maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value;
+
+    \param g
+    When maximization succeeds, will be assigned the point or
+    closure point where \p expr reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p g are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value;
+
+    \param g
+    When minimization succeeds, will be assigned a point or
+    closure point where \p expr reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p g are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if there exist a
+    unique value \p val such that \p *this
+    saturates the equality <CODE>expr = val</CODE>.
+
+    \param expr
+    The linear expression for which the frequency is needed;
+
+    \param freq_n
+    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
+    Present for interface compatibility with class Grid, where
+    the \ref Grid_Frequency "frequency" can have a non-zero value;
+
+    \param freq_d
+    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
+
+    \param val_n
+    The numerator of \p val;
+
+    \param val_d
+    The denominator of \p val;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
+    \p val_n and \p val_d are left untouched.
+  */
+  bool frequency(const Linear_Expression& expr,
+                 Coefficient& freq_n, Coefficient& freq_d,
+                 Coefficient& val_n, Coefficient& val_d) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //@} Member Functions that Do Not Modify the Octagonal_Shape
+
+  //! \name Space-Dimension Preserving Member Functions that May Modify the Octagonal_Shape
+  //@{
+
+  /*! \brief
+    Adds a copy of constraint \p c to the system of constraints
+    defining \p *this.
+
+    \param c
+    The constraint to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible,
+    or \p c is not optimally supported by the OS domain.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of constraints
+    defining \p *this.
+
+    \param  cs
+    The constraints that will be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible,
+    or \p cs contains a constraint which is not optimally supported
+    by the OS domain.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of constraints
+    of \p *this.
+
+    \param cs
+    The constraint system to be added to \p *this.  The constraints in
+    \p cs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible,
+    or \p cs contains a constraint which is not optimally supported
+    by the OS domain.
+
+    \warning
+    The only assumption that can be made on \p cs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_constraints(Constraint_System& cs);
+
+  /*! \brief
+    Adds to \p *this a constraint equivalent to the congruence \p cg.
+
+    \param cg
+    The congruence to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible,
+    or \p cg is not optimally supported by the OS domain.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Adds to \p *this constraints equivalent to the congruences in \p cgs.
+
+    \param cgs
+    The congruences to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    or \p cgs contains a congruence which is not optimally supported
+    by the OS domain.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Adds to \p *this constraints equivalent to the congruences in \p cgs.
+
+    \param cgs
+    The congruence system to be added to \p *this.  The congruences in
+    \p cgs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    or \p cgs contains a congruence which is not optimally supported
+    by the OS domain.
+
+    \warning
+    The only assumption that can be made on \p cgs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_congruences(Congruence_System& cgs);
+
+  /*! \brief
+    Uses a copy of constraint \p c to refine the system of octagonal
+    constraints defining \p *this.
+
+    \param c
+    The constraint. If it is not a octagonal constraint, it will be ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  /*! \brief
+    Uses a copy of congruence \p cg to refine the system of
+    octagonal constraints  of \p *this.
+
+    \param cg
+    The congruence. If it is not a octagonal equality, it
+    will be ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+  /*! \brief
+    Uses a copy of the constraints in \p cs to refine the system of
+    octagonal constraints defining \p *this.
+
+    \param  cs
+    The constraint system to be used. Constraints that are not octagonal
+    are ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Uses a copy of the congruences in \p cgs to refine the system of
+    octagonal constraints defining \p *this.
+
+    \param  cgs
+    The congruence system to be used. Congruences that are not octagonal
+    equalities are ignored.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Refines the system of octagonal constraints defining \p *this using
+    the constraint expressed by \p left \f$\leq\f$ \p right.
+
+    \param left
+    The linear form on intervals with floating point boundaries that
+    is at the left of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param right
+    The linear form on intervals with floating point boundaries that
+    is at the right of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \exception std::invalid_argument
+    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
+
+    This function is used in abstract interpretation to model a filter
+    that is generated by a comparison of two expressions that are correctly
+    approximated by \p left and \p right respectively.
+  */
+  template <typename Interval_Info>
+  void refine_with_linear_form_inequality(
+                   const Linear_Form< Interval<T, Interval_Info> >& left,
+                   const Linear_Form< Interval<T, Interval_Info> >& right);
+
+  /*! \brief
+    Refines the system of octagonal constraints defining \p *this using
+    the constraint expressed by \p left \f$\relsym\f$ \p right, where
+    \f$\relsym\f$ is the relation symbol specified by \p relsym.
+
+    \param left
+    The linear form on intervals with floating point boundaries that
+    is at the left of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param right
+    The linear form on intervals with floating point boundaries that
+    is at the right of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param relsym
+    The relation symbol.
+
+    \exception std::invalid_argument
+    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
+
+    \exception std::runtime_error
+    Thrown if \p relsym is not a valid relation symbol.
+
+    This function is used in abstract interpretation to model a filter
+    that is generated by a comparison of two expressions that are correctly
+    approximated by \p left and \p right respectively.
+  */
+  template <typename Interval_Info>
+  void generalized_refine_with_linear_form_inequality(
+                   const Linear_Form< Interval<T, Interval_Info> >& left,
+                   const Linear_Form< Interval<T, Interval_Info> >& right,
+                   Relation_Symbol relsym);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  //! Assigns to \p *this the intersection of \p *this and \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void intersection_assign(const Octagonal_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this the smallest OS that contains
+    the convex union of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void upper_bound_assign(const Octagonal_Shape& y);
+
+  /*! \brief
+    If the upper bound of \p *this and \p y is exact, it is assigned
+    to \p *this and <CODE>true</CODE> is returned,
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    Implementation is based on Theorem 6.3 of \ref BHZ09b "[BHZ09b]".
+  */
+  bool upper_bound_assign_if_exact(const Octagonal_Shape& y);
+
+  /*! \brief
+    If the \e integer upper bound of \p *this and \p y is exact,
+    it is assigned to \p *this and <CODE>true</CODE> is returned;
+    otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \note
+    This operator is only available when the class template parameter
+    \c T is bound to an integer data type.
+
+    \note
+    The integer upper bound of two rational OS is the smallest
+    rational OS containing all the integral points in the two arguments.
+    In general, the result is \e not an upper bound for the two input
+    arguments, as it may cut away non-integral portions of the two
+    rational shapes.
+
+    Implementation is based on Theorem 6.8 of \ref BHZ09b "[BHZ09b]".
+  */
+  bool integer_upper_bound_assign_if_exact(const Octagonal_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this the smallest octagon containing
+    the set difference of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void difference_assign(const Octagonal_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this a \ref Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+    If \c false is returned, then the intersection is empty.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool simplify_using_context_assign(const Octagonal_Shape& y);
+
+  /*! \brief
+    Assigns to \p *this the \ref affine_relation "affine image"
+    of \p *this under the function mapping variable \p var into the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned.
+
+    \param expr
+    The numerator of the affine expression.
+
+    \param denominator
+    The denominator of the affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension of \p *this.
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference  denominator
+                    = Coefficient_one());
+
+  // FIXME: To be completed.
+  /*! \brief
+    Assigns to \p *this the \ref affine_form_relation "affine form image"
+    of \p *this under the function mapping variable \p var into the
+    affine expression(s) specified by \p lf.
+
+    \param var
+    The variable to which the affine expression is assigned.
+
+    \param lf
+    The linear form on intervals with floating point boundaries that
+    defines the affine expression(s). ALL of its coefficients MUST be bounded.
+
+    \exception std::invalid_argument
+    Thrown if \p lf and \p *this are dimension-incompatible or if \p var
+    is not a dimension of \p *this.
+
+    This function is used in abstract interpretation to model an assignment
+    of a value that is correctly overapproximated by \p lf to the
+    floating point variable represented by \p var.
+  */
+  template <typename Interval_Info>
+  void affine_form_image(Variable var,
+                        const Linear_Form< Interval<T, Interval_Info> >& lf);
+
+  /*! \brief
+    Assigns to \p *this the \ref affine_relation "affine preimage"
+    of \p *this under the function mapping variable \p var into the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is substituted.
+
+    \param expr
+    The numerator of the affine expression.
+
+    \param denominator
+    The denominator of the affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension of \p *this.
+  */
+  void affine_preimage(Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                       = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine transfer function"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine transfer function.
+
+    \param relsym
+    The relation symbol.
+
+    \param expr
+    The numerator of the right hand side affine expression.
+
+    \param denominator
+    The denominator of the right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension of \p *this
+    or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_image(Variable var,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine transfer function"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression.
+
+    \param relsym
+    The relation symbol.
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_image(const Linear_Expression& lhs,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
+
+    /*!
+    \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+/*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine transfer function.
+
+    \param relsym
+    The relation symbol.
+
+    \param expr
+    The numerator of the right hand side affine expression.
+
+    \param denominator
+    The denominator of the right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this
+    are dimension-incompatible or if \p var is not a dimension
+    of \p *this or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_preimage(Variable var,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& expr,
+                                   Coefficient_traits::const_reference
+                                   denominator = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p relsym is a strict relation symbol.
+  */
+  void generalized_affine_preimage(const Linear_Expression& lhs,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
+
+  /*!
+    \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+         \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void time_elapse_assign(const Octagonal_Shape& y);
+
+  /*! \brief
+    \ref Wrapping_Operator "Wraps" the specified dimensions of the
+    vector space.
+
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be wrapped.
+
+    \param w
+    The width of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param r
+    The representation of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param o
+    The overflow behavior of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param cs_p
+    Possibly null pointer to a constraint system whose variables
+    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
+    variables not in \p vars, the behavior is undefined.
+    When non-null, the pointed-to constraint system is assumed to
+    represent the conditional or looping construct guard with respect
+    to which wrapping is performed.  Since wrapping requires the
+    computation of upper bounds and due to non-distributivity of
+    constraint refinement over upper bounds, passing a constraint
+    system in this way can be more precise than refining the result of
+    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
+
+    \param complexity_threshold
+    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
+    higher values result in possibly improved precision.
+
+    \param wrap_individually
+    <CODE>true</CODE> if the dimensions should be wrapped individually
+    (something that results in much greater efficiency to the detriment of
+    precision).
+
+    \exception std::invalid_argument
+    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
+    \p vars, or if \p *this is dimension-incompatible \p vars or with
+    <CODE>*cs_p</CODE>.
+  */
+  void wrap_assign(const Variables_Set& vars,
+                   Bounded_Integer_Type_Width w,
+                   Bounded_Integer_Type_Representation r,
+                   Bounded_Integer_Type_Overflow o,
+                   const Constraint_System* cs_p = 0,
+                   unsigned complexity_threshold = 16,
+                   bool wrap_individually = true);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
+
+    \param y
+    An OS that <EM>must</EM> be contained in \p *this.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void CC76_extrapolation_assign(const Octagonal_Shape& y, unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref CC76_extrapolation "CC76-extrapolation" between \p *this and \p y.
+
+    \param y
+    An OS that <EM>must</EM> be contained in \p *this.
+
+    \param first
+    An iterator that points to the first stop_point.
+
+    \param last
+    An iterator that points to the last stop_point.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  template <typename Iterator>
+  void CC76_extrapolation_assign(const Octagonal_Shape& y,
+                                 Iterator first, Iterator last,
+                                 unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref BHMZ05_widening "BHMZ05-widening" between \p *this and \p y.
+
+    \param y
+    An OS that <EM>must</EM> be contained in \p *this.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void BHMZ05_widening_assign(const Octagonal_Shape& y, unsigned* tp = 0);
+
+  //! Same as BHMZ05_widening_assign(y, tp).
+  void widening_assign(const Octagonal_Shape& y, unsigned* tp = 0);
+
+  /*! \brief
+    Improves the result of the \ref BHMZ05_widening "BHMZ05-widening"
+    computation by also enforcing those constraints in \p cs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    An OS that <EM>must</EM> be contained in \p *this.
+
+    \param cs
+    The system of constraints used to improve the widened OS.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
+    if there is in \p cs a strict inequality.
+  */
+  void limited_BHMZ05_extrapolation_assign(const Octagonal_Shape& y,
+                                           const Constraint_System& cs,
+                                           unsigned* tp = 0);
+
+  /*! \brief
+    Restores from \p y the constraints of \p *this, lost by
+    \ref CC76_extrapolation "CC76-extrapolation" applications.
+
+    \param y
+    An OS that <EM>must</EM> contain \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void CC76_narrowing_assign(const Octagonal_Shape& y);
+
+  /*! \brief
+    Improves the result of the \ref CC76_extrapolation "CC76-extrapolation"
+    computation by also enforcing those constraints in \p cs that are
+    satisfied by all the points of \p *this.
+
+    \param y
+    An OS that <EM>must</EM> be contained in \p *this.
+
+    \param cs
+    The system of constraints used to improve the widened OS.
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are dimension-incompatible or
+    if \p cs contains a strict inequality.
+  */
+  void limited_CC76_extrapolation_assign(const Octagonal_Shape& y,
+                                         const Constraint_System& cs,
+                                         unsigned* tp = 0);
+
+  //@} Space-Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  //! Adds \p m new dimensions and embeds the old OS into the new space.
+  /*!
+    \param m
+    The number of dimensions to add.
+
+    The new dimensions will be those having the highest indexes in the new OS,
+    which is characterized by a system of constraints in which the variables
+    running through the new dimensions are not constrained.
+    For instance, when starting from the OS \f$\cO \sseq \Rset^2\f$
+    and adding a third dimension, the result will be the OS
+    \f[
+      \bigl\{\,
+        (x, y, z)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cO
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Adds \p m new dimensions to the OS
+    and does not embed it in the new space.
+
+    \param m
+    The number of dimensions to add.
+
+    The new dimensions will be those having the highest indexes
+    in the new OS, which is characterized by a system
+    of constraints in which the variables running through
+    the new dimensions are all constrained to be equal to 0.
+    For instance, when starting from the OS \f$\cO \sseq \Rset^2\f$
+    and adding a third dimension, the result will be the OS
+    \f[
+      \bigl\{\,
+        (x, y, 0)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cO
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  /*! \brief
+    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
+    of \p *this and \p y, taken in this order.
+
+    \exception std::length_error
+    Thrown if the concatenation would cause the vector space
+    to exceed dimension <CODE>max_space_dimension()</CODE>.
+  */
+  void concatenate_assign(const Octagonal_Shape& y);
+
+  //! Removes all the specified dimensions.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the dimensions to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the Variable
+    objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher dimensions so that the resulting space
+    will have dimension \p new_dimension.
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimension is greater than the space dimension
+    of \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
+
+    \param pfunc
+    The partial function specifying the destiny of each dimension.
+
+    The template type parameter Partial_Function must provide
+    the following methods.
+    \code
+      bool has_empty_codomain() const
+    \endcode
+    returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty codomain (i.e., it is always undefined).
+    The <CODE>has_empty_codomain()</CODE> method will always be called
+    before the methods below.  However, if
+    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
+    of the functions below will be called.
+    \code
+      dimension_type max_in_codomain() const
+    \endcode
+    returns the maximum value that belongs to the codomain
+    of the partial function.
+    \code
+      bool maps(dimension_type i, dimension_type& j) const
+    \endcode
+    Let \f$f\f$ be the represented function and \f$k\f$ be the value
+    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
+    assigned to \p j and <CODE>true</CODE> is returned.
+    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
+    returned.
+
+    The result is undefined if \p pfunc does not encode a partial
+    function with the properties described in the
+    \ref Mapping_the_Dimensions_of_the_Vector_Space "specification of the mapping operator".
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref expand_space_dimension "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.
+    Also thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are \ref fold_space_dimensions "folded"
+    into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //! Applies to \p dest the interval constraints embedded in \p *this.
+  /*!
+    \param dest
+    The object to which the constraints will be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest.
+
+    The template type parameter U must provide the following methods.
+    \code
+      dimension_type space_dimension() const
+    \endcode
+    returns the space dimension of the object.
+    \code
+      void set_empty()
+    \endcode
+    sets the object to an empty object.
+    \code
+      bool restrict_lower(dimension_type dim, const T& lb)
+    \endcode
+    restricts the object by applying the lower bound \p lb to the space
+    dimension \p dim and returns <CODE>false</CODE> if and only if the
+    object becomes empty.
+    \code
+      bool restrict_upper(dimension_type dim, const T& ub)
+    \endcode
+    restricts the object by applying the upper bound \p ub to the space
+    dimension \p dim and returns <CODE>false</CODE> if and only if the
+    object becomes empty.
+  */
+  template <typename U>
+  void export_interval_constraints(U& dest) const;
+
+  //! Refines \p store with the constraints defining \p *this.
+  /*!
+    \param store
+    The interval floating point abstract store to refine.
+  */
+  template <typename Interval_Info>
+  void refine_fp_interval_abstract_store(
+                          Box< Interval<T, Interval_Info> >& store) const;
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If \p x and \p y are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  friend bool
+  operator==<T>(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
+
+  template <typename Temp, typename To, typename U>
+  friend bool Parma_Polyhedra_Library::rectilinear_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const Octagonal_Shape<U>& x, const Octagonal_Shape<U>& y,
+   const Rounding_Dir dir, Temp& tmp0, Temp& tmp1, Temp& tmp2);
+  template <typename Temp, typename To, typename U>
+  friend bool Parma_Polyhedra_Library::euclidean_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const Octagonal_Shape<U>& x, const Octagonal_Shape<U>& y,
+   const Rounding_Dir dir, Temp& tmp0, Temp& tmp1, Temp& tmp2);
+  template <typename Temp, typename To, typename U>
+  friend bool Parma_Polyhedra_Library::l_infinity_distance_assign
+  (Checked_Number<To, Extended_Number_Policy>& r,
+   const Octagonal_Shape<U>& x, const Octagonal_Shape<U>& y,
+   const Rounding_Dir dir, Temp& tmp0, Temp& tmp1, Temp& tmp2);
+
+private:
+  template <typename U> friend class Parma_Polyhedra_Library::Octagonal_Shape;
+  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
+
+  //! The matrix that represents the octagonal shape.
+  OR_Matrix<N> matrix;
+
+  //! Dimension of the space of the octagonal shape.
+  dimension_type space_dim;
+
+  // Please, do not move the following include directive:
+  // `Og_Status_idefs.hh' must be included exactly at this point.
+  // And please do not remove the space separating `#' from `include':
+  // this ensures that the directive will not be moved during the
+  // procedure that automatically creates the library's include file
+  // (see `Makefile.am' in the `src' directory).
+#define PPL_IN_Octagonal_Shape_CLASS
+#include "Og_Status_idefs.hh"
+#undef PPL_IN_Octagonal_Shape_CLASS
+
+  //! The status flags to keep track of the internal state.
+  Status status;
+
+  //! Returns <CODE>true</CODE> if the OS is the zero-dimensional universe.
+  bool marked_zero_dim_univ() const;
+
+  //! Returns <CODE>true</CODE> if the OS is known to be empty.
+  /*!
+    The return value <CODE>false</CODE> does not necessarily
+    implies that \p *this is non-empty.
+  */
+  bool marked_empty() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if \c this->matrix is known to be
+    strongly closed.
+
+    The return value <CODE>false</CODE> does not necessarily
+    implies that \c this->matrix is not strongly closed.
+  */
+  bool marked_strongly_closed() const;
+
+  //! Turns \p *this into a zero-dimensional universe OS.
+  void set_zero_dim_univ();
+
+  //! Turns \p *this into an empty OS.
+  void set_empty();
+
+  //! Marks \p *this as strongly closed.
+  void set_strongly_closed();
+
+  //! Marks \p *this as possibly not strongly closed.
+  void reset_strongly_closed();
+
+  N& matrix_at(dimension_type i, dimension_type j);
+  const N& matrix_at(dimension_type i, dimension_type j) const;
+
+  /*! \brief
+    Returns an upper bound for \p lf according to the constraints
+    embedded in \p *this.
+
+    \p lf must be a linear form on intervals with floating point coefficients.
+    If all coefficients in \p lf are bounded, then \p result will become a
+    correct overapproximation of the value of \p lf when variables in
+    \p lf satisfy the constraints expressed by \p *this. Otherwise the
+    behavior of the method is undefined.
+  */
+  template <typename Interval_Info>
+  void linear_form_upper_bound(
+                   const Linear_Form< Interval<T, Interval_Info> >& lf,
+                   N& result) const;
+
+  // FIXME: this function is currently not used. Consider removing it.
+  static void interval_coefficient_upper_bound(const N& var_ub,
+                                               const N& minus_var_ub,
+                                               const N& int_ub, const N& int_lb,
+                                               N& result);
+
+  /*! \brief
+    Uses the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be added. Non-octagonal constraints are ignored.
+
+    \warning
+    If \p c and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Constraint& c);
+
+  /*! \brief
+    Uses the congruence \p cg to refine \p *this.
+
+    \param cg
+    The congruence to be added.
+    Nontrivial proper congruences are ignored.
+    Non-octagonal equalities are ignored.
+
+    \warning
+    If \p cg and \p *this are dimension-incompatible,
+    the behavior is undefined.
+  */
+  void refine_no_check(const Congruence& cg);
+
+  //! Adds the constraint <CODE>matrix[i][j] <= k</CODE>.
+  void add_octagonal_constraint(dimension_type i,
+                                dimension_type j,
+                                const N& k);
+
+  //! Adds the constraint <CODE>matrix[i][j] <= numer/denom</CODE>.
+  void add_octagonal_constraint(dimension_type i,
+                                dimension_type j,
+                                Coefficient_traits::const_reference numer,
+                                Coefficient_traits::const_reference denom);
+
+  /*! \brief
+    Adds to the Octagonal_Shape the constraint
+    \f$\mathrm{var} \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$.
+
+    Note that the coefficient of \p var in \p expr is null.
+  */
+  void refine(Variable var,
+              Relation_Symbol relsym,
+              const Linear_Expression& expr,
+              Coefficient_traits::const_reference denominator
+              = Coefficient_one());
+
+  //! Removes all the constraints on variable \p v_id.
+  void forget_all_octagonal_constraints(dimension_type v_id);
+
+  //! Removes all binary constraints on variable \p v_id.
+  void forget_binary_octagonal_constraints(dimension_type v_id);
+
+  //! An helper function for the computation of affine relations.
+  /*!
+    For each variable index \c u_id (less than or equal to \p last_id
+    and different from \p v_id), deduce constraints of the form
+    <CODE>v - u \<= k</CODE> and <CODE>v + u \<= k</CODE>,
+    starting from \p ub_v, which is an upper bound for \c v
+    computed according to \p sc_expr and \p sc_denom.
+
+    Strong-closure will be able to deduce the constraints
+    <CODE>v - u \<= ub_v - lb_u</CODE> and <CODE>v + u \<= ub_v + ub_u</CODE>.
+    We can be more precise if variable \c u played an active role in the
+    computation of the upper bound for \c v.
+
+    Namely, if the corresponding coefficient
+    <CODE>q == sc_expr[u]/sc_denom</CODE> of \c u in \p sc_expr
+    is greater than zero, we can improve the bound for <CODE>v - u</CODE>.
+    In particular:
+      - if <CODE>q \>= 1</CODE>, then <CODE>v - u \<= ub_v - ub_u</CODE>;
+      - if <CODE>0 \< q \< 1</CODE>, then
+        <CODE>v - u \<= ub_v - (q*ub_u + (1-q)*lb_u)</CODE>.
+
+    Conversely, if \c q is less than zero, we can improve the bound for
+    <CODE>v + u</CODE>. In particular:
+      - if <CODE>q \<= -1</CODE>, then <CODE>v + u \<= ub_v + lb_u</CODE>;
+      - if <CODE>-1 \< q \< 0</CODE>, then
+        <CODE>v + u \<= ub_v + ((-q)*lb_u + (1+q)*ub_u)</CODE>.
+  */
+  void deduce_v_pm_u_bounds(dimension_type v_id,
+                            dimension_type last_id,
+                            const Linear_Expression& sc_expr,
+                            Coefficient_traits::const_reference sc_denom,
+                            const N& ub_v);
+
+  //! An helper function for the computation of affine relations.
+  /*!
+    For each variable index \c u_id (less than or equal to \p last_id
+    and different from \p v_id), deduce constraints of the form
+    <CODE>-v + u \<= k</CODE> and <CODE>-v - u \<= k</CODE>,
+    starting from \p minus_lb_v, which is the negation of a lower bound
+    for \c v computed according to \p sc_expr and \p sc_denom.
+
+    Strong-closure will be able to deduce the constraints
+    <CODE>-v - u \<= -lb_v - lb_u</CODE> and
+    <CODE>-v + u \<= -lb_v + ub_u</CODE>.
+    We can be more precise if variable \c u played an active role in the
+    computation of (the negation of) the lower bound for \c v.
+
+    Namely, if the corresponding coefficient
+    <CODE>q == sc_expr[u]/sc_denom</CODE> of \c u in \p sc_expr
+    is greater than zero, we can improve the bound for <CODE>-v + u</CODE>.
+    In particular:
+      - if <CODE>q \>= 1</CODE>, then <CODE>-v + u \<= -lb_v + lb_u</CODE>;
+      - if <CODE>0 \< q \< 1</CODE>, then
+        <CODE>-v + u \<= -lb_v + (q*lb_u + (1-q)*ub_u)</CODE>.
+
+    Conversely, if \c q is less than zero, we can improve the bound for
+    <CODE>-v - u</CODE>. In particular:
+      - if <CODE>q \<= -1</CODE>, then <CODE>-v - u \<= -lb_v - ub_u</CODE>;
+      - if <CODE>-1 \< q \< 0</CODE>, then
+        <CODE>-v - u \<= -lb_v - ((-q)*ub_u + (1+q)*lb_u)</CODE>.
+  */
+  void deduce_minus_v_pm_u_bounds(dimension_type v_id,
+                                  dimension_type last_id,
+                                  const Linear_Expression& sc_expr,
+                                  Coefficient_traits::const_reference sc_denom,
+                                  const N& minus_lb_v);
+
+  /*! \brief
+    Adds to \p limiting_octagon the octagonal differences in \p cs
+    that are satisfied by \p *this.
+  */
+  void get_limiting_octagon(const Constraint_System& cs,
+                            Octagonal_Shape& limiting_octagon) const;
+  //! Compute the (zero-equivalence classes) successor relation.
+  /*!
+    It is assumed that the octagon is not empty and strongly closed.
+  */
+  void compute_successors(std::vector<dimension_type>& successor) const;
+
+  //! Compute the leaders of zero-equivalence classes.
+  /*!
+    It is assumed that the OS is not empty and strongly closed.
+  */
+  void compute_leaders(std::vector<dimension_type>& successor,
+                       std::vector<dimension_type>& no_sing_leaders,
+                       bool& exist_sing_class,
+                       dimension_type& sing_leader) const;
+
+  //! Compute the leaders of zero-equivalence classes.
+  /*!
+    It is assumed that the OS is not empty and strongly closed.
+  */
+  void compute_leaders(std::vector<dimension_type>& leaders) const;
+
+  /*! \brief
+    Stores into \p non_redundant information about the matrix entries
+    that are non-redundant (i.e., they will occur in the strongly
+    reduced matrix).
+
+    It is assumed that the OS is not empty and strongly closed;
+    moreover, argument \p non_redundant is assumed to be empty.
+  */
+  void non_redundant_matrix_entries(std::vector<Bit_Row>& non_redundant) const;
+
+  //! Removes the redundant constraints from \c this->matrix.
+  void strong_reduction_assign() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \c this->matrix
+    is strongly reduced.
+  */
+  bool is_strongly_reduced() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if in the octagon taken two at a time
+    unary constraints, there is also the constraint that represent their sum.
+  */
+  bool is_strong_coherent() const;
+
+  bool tight_coherence_would_make_empty() const;
+
+  //! Assigns to \c this->matrix its strong closure.
+  /*!
+    Strong closure is a necessary condition for the precision and/or
+    the correctness of many methods. It explicitly records into \c matrix
+    those constraints that are implicitly obtainable by the other ones,
+    therefore obtaining a canonical representation for the OS.
+  */
+  void strong_closure_assign() const;
+
+  //! Applies the strong-coherence step to \c this->matrix.
+  void strong_coherence_assign();
+
+  //! Assigns to \c this->matrix its tight closure.
+  /*!
+    \note
+    This is \e not marked as a <code>const</code> method,
+    as it may modify the rational-valued geometric shape by cutting away
+    non-integral points. The method is only available if the template
+    parameter \c T is bound to an integer data type.
+  */
+  void tight_closure_assign();
+
+  /*! \brief
+    Incrementally computes strong closure, assuming that only
+    constraints affecting variable \p var need to be considered.
+
+    \note
+    It is assumed that \c *this, which was strongly closed, has only been
+    modified by adding constraints affecting variable \p var. If this
+    assumption is not satisfied, i.e., if a non-redundant constraint not
+    affecting variable \p var has been added, the behavior is undefined.
+    Worst-case complexity is \f$O(n^2)\f$.
+  */
+  void incremental_strong_closure_assign(Variable var) const;
+
+  //! Checks if and how \p expr is bounded in \p *this.
+  /*!
+    Returns <CODE>true</CODE> if and only if \p from_above is
+    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
+    or \p from_above is <CODE>false</CODE> and \p expr is bounded
+    from below in \p *this.
+
+    \param expr
+    The linear expression to test;
+
+    \param from_above
+    <CODE>true</CODE> if and only if the boundedness of interest is
+    "from above".
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds(const Linear_Expression& expr, bool from_above) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p
+    *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p * this;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d and
+    \p included are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p
+    *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p * this;
+
+    \param g
+    When maximization or minimization succeeds, will be assigned
+    a point or closure point where \p expr reaches the
+    corresponding extremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p g are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator& g) const;
+
+  void drop_some_non_integer_points_helper(N& elem);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators
+  ::operator<<<>(std::ostream& s, const Octagonal_Shape<T>& c);
+
+  //! \name Exception Throwers
+  //@{
+  void throw_dimension_incompatible(const char* method,
+                                    const Octagonal_Shape& y) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    dimension_type required_dim) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Constraint& c) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Congruence& cg) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const Generator& g) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
+
+  template <typename C>
+  void throw_dimension_incompatible(const char* method,
+                                    const char* lf_name,
+                                    const Linear_Form<C>& lf) const;
+
+  static void throw_constraint_incompatible(const char* method);
+
+  static void throw_expression_too_complex(const char* method,
+                                           const Linear_Expression& le);
+
+  static void throw_invalid_argument(const char* method, const char* reason);
+  //@} // Exception Throwers
+};
+
+#include "Og_Status_inlines.hh"
+#include "Octagonal_Shape_inlines.hh"
+#include "Octagonal_Shape_templates.hh"
+
+#endif // !defined(PPL_Octagonal_Shape_defs_hh)
diff --git a/src/Octagonal_Shape_inlines.hh b/src/Octagonal_Shape_inlines.hh
new file mode 100644
index 0000000..361b56b
--- /dev/null
+++ b/src/Octagonal_Shape_inlines.hh
@@ -0,0 +1,892 @@
+/* Octagonal_Shape class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Octagonal_Shape_inlines_hh
+#define PPL_Octagonal_Shape_inlines_hh 1
+
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "C_Polyhedron_defs.hh"
+#include "Grid_defs.hh"
+#include "BD_Shape_defs.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "wrap_assign.hh"
+#include "assert.hh"
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Octagonal_Shapes {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the index coherent to \p i.
+/*! \relates Parma_Polyhedra_Library::Octagonal_Shape */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+inline dimension_type
+coherent_index(const dimension_type i) {
+  return (i % 2 != 0) ? (i-1) : (i+1);
+}
+
+} // namespace Octagonal_Shapes
+
+} // namespace Implementation
+
+template <typename T>
+inline dimension_type
+Octagonal_Shape<T>::max_space_dimension() {
+  return OR_Matrix<N>::max_num_rows()/2;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::marked_zero_dim_univ() const {
+  return status.test_zero_dim_univ();
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::marked_strongly_closed() const {
+  return status.test_strongly_closed();
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::marked_empty() const {
+  return status.test_empty();
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::set_zero_dim_univ() {
+  status.set_zero_dim_univ();
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::set_empty() {
+  status.set_empty();
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::set_strongly_closed() {
+  status.set_strongly_closed();
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::reset_strongly_closed() {
+  status.reset_strongly_closed();
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const dimension_type num_dimensions,
+                                    const Degenerate_Element kind)
+  : matrix(num_dimensions), space_dim(num_dimensions), status() {
+  if (kind == EMPTY)
+    set_empty();
+  else if (num_dimensions > 0)
+    // A (non zero-dim) universe octagon is strongly closed.
+    set_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const Octagonal_Shape& y, Complexity_Class)
+  : matrix(y.matrix), space_dim(y.space_dim), status(y.status) {
+}
+
+template <typename T>
+template <typename U>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const Octagonal_Shape<U>& y,
+                                    Complexity_Class)
+  // For maximum precision, enforce shortest-path closure
+  // before copying the DB matrix.
+  : matrix((y.strong_closure_assign(), y.matrix)),
+    space_dim(y.space_dim),
+    status() {
+  // TODO: handle flags properly, possibly taking special cases into account.
+  if (y.marked_empty())
+    set_empty();
+  else if (y.marked_zero_dim_univ())
+    set_zero_dim_univ();
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const Constraint_System& cs)
+  : matrix(cs.space_dimension()),
+    space_dim(cs.space_dimension()),
+    status() {
+  if (cs.space_dimension() > 0)
+    // A (non zero-dim) universe octagon is strongly closed.
+    set_strongly_closed();
+  add_constraints(cs);
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const Congruence_System& cgs)
+  : matrix(cgs.space_dimension()),
+    space_dim(cgs.space_dimension()),
+    status() {
+  if (cgs.space_dimension() > 0)
+    // A (non zero-dim) universe octagon is strongly closed.
+    set_strongly_closed();
+  add_congruences(cgs);
+}
+
+template <typename T>
+template <typename Interval>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const Box<Interval>& box,
+                                    Complexity_Class)
+  : matrix(box.space_dimension()),
+    space_dim(box.space_dimension()),
+    status() {
+  // Check for emptiness for maximum precision.
+  if (box.is_empty())
+    set_empty();
+  else if (box.space_dimension() > 0) {
+    // A (non zero-dim) universe OS is strongly closed.
+    set_strongly_closed();
+    refine_with_constraints(box.constraints());
+  }
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const Grid& grid,
+                                    Complexity_Class)
+  : matrix(grid.space_dimension()),
+    space_dim(grid.space_dimension()),
+    status() {
+  if (grid.space_dimension() > 0)
+    // A (non zero-dim) universe OS is strongly closed.
+    set_strongly_closed();
+  // Taking minimized congruences ensures maximum precision.
+  refine_with_congruences(grid.minimized_congruences());
+}
+
+template <typename T>
+template <typename U>
+inline
+Octagonal_Shape<T>::Octagonal_Shape(const BD_Shape<U>& bd,
+                                    Complexity_Class)
+  : matrix(bd.space_dimension()),
+    space_dim(bd.space_dimension()),
+    status() {
+  // Check for emptiness for maximum precision.
+  if (bd.is_empty())
+    set_empty();
+  else if (bd.space_dimension() > 0) {
+    // A (non zero-dim) universe OS is strongly closed.
+    set_strongly_closed();
+    refine_with_constraints(bd.constraints());
+  }
+}
+
+template <typename T>
+inline Congruence_System
+Octagonal_Shape<T>::congruences() const {
+  return minimized_congruences();
+}
+
+template <typename T>
+inline Octagonal_Shape<T>&
+Octagonal_Shape<T>::operator=(const Octagonal_Shape& y) {
+  matrix = y.matrix;
+  space_dim = y.space_dim;
+  status = y.status;
+  return *this;
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::~Octagonal_Shape() {
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::m_swap(Octagonal_Shape& y) {
+  using std::swap;
+  swap(matrix, y.matrix);
+  swap(space_dim, y.space_dim);
+  swap(status, y.status);
+}
+
+template <typename T>
+inline dimension_type
+Octagonal_Shape<T>::space_dimension() const {
+  return space_dim;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::is_discrete() const {
+  return affine_dimension() == 0;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::is_empty() const {
+  strong_closure_assign();
+  return marked_empty();
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::bounds_from_above(const Linear_Expression& expr) const {
+  return bounds(expr, true);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::bounds_from_below(const Linear_Expression& expr) const {
+  return bounds(expr, false);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::maximize(const Linear_Expression& expr,
+                             Coefficient& sup_n, Coefficient& sup_d,
+                             bool& maximum) const {
+  return max_min(expr, true, sup_n, sup_d, maximum);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::maximize(const Linear_Expression& expr,
+                             Coefficient& sup_n, Coefficient& sup_d,
+                             bool& maximum,
+                             Generator& g) const {
+  return max_min(expr, true, sup_n, sup_d, maximum, g);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::minimize(const Linear_Expression& expr,
+                             Coefficient& inf_n, Coefficient& inf_d,
+                             bool& minimum) const {
+  return max_min(expr, false, inf_n, inf_d, minimum);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::minimize(const Linear_Expression& expr,
+                             Coefficient& inf_n, Coefficient& inf_d,
+                             bool& minimum,
+                             Generator& g) const {
+  return max_min(expr, false, inf_n, inf_d, minimum, g);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::is_topologically_closed() const {
+  return true;
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::topological_closure_assign() {
+}
+
+/*! \relates Octagonal_Shape */
+template <typename T>
+inline bool
+operator==(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y) {
+  if (x.space_dim != y.space_dim)
+    // Dimension-incompatible OSs are different.
+    return false;
+
+  // Zero-dim OSs are equal if and only if they are both empty or universe.
+  if (x.space_dim == 0) {
+    if (x.marked_empty())
+      return y.marked_empty();
+    else
+      return !y.marked_empty();
+  }
+
+  x.strong_closure_assign();
+  y.strong_closure_assign();
+  // If one of two octagons is empty, then they are equal if and only if
+  // the other octagon is empty too.
+  if (x.marked_empty())
+    return y.marked_empty();
+  if (y.marked_empty())
+    return false;
+  // Strong closure is a canonical form.
+  return x.matrix == y.matrix;
+}
+
+/*! \relates Octagonal_Shape */
+template <typename T>
+inline bool
+operator!=(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y) {
+  return !(x == y);
+}
+
+template <typename T>
+inline const typename Octagonal_Shape<T>::coefficient_type&
+Octagonal_Shape<T>::matrix_at(const dimension_type i,
+                              const dimension_type j) const {
+  PPL_ASSERT(i < matrix.num_rows() && j < matrix.num_rows());
+  using namespace Implementation::Octagonal_Shapes;
+  return (j < matrix.row_size(i))
+    ? matrix[i][j]
+    : matrix[coherent_index(j)][coherent_index(i)];
+}
+
+template <typename T>
+inline typename Octagonal_Shape<T>::coefficient_type&
+Octagonal_Shape<T>::matrix_at(const dimension_type i,
+                              const dimension_type j) {
+  PPL_ASSERT(i < matrix.num_rows() && j < matrix.num_rows());
+  using namespace Implementation::Octagonal_Shapes;
+  return (j < matrix.row_size(i))
+    ? matrix[i][j]
+    : matrix[coherent_index(j)][coherent_index(i)];
+}
+
+template <typename T>
+inline Constraint_System
+Octagonal_Shape<T>::minimized_constraints() const {
+  strong_reduction_assign();
+  return constraints();
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::add_octagonal_constraint(const dimension_type i,
+                                             const dimension_type j,
+                                             const N& k) {
+  // Private method: the caller has to ensure the following.
+#ifndef NDEBUG
+  PPL_ASSERT(i < 2*space_dim && j < 2*space_dim && i != j);
+  typename OR_Matrix<N>::row_iterator m_i = matrix.row_begin() + i;
+  PPL_ASSERT(j < m_i.row_size());
+#endif
+  N& r_i_j = matrix[i][j];
+  if (r_i_j > k) {
+    r_i_j = k;
+    if (marked_strongly_closed())
+      reset_strongly_closed();
+  }
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>
+::add_octagonal_constraint(const dimension_type i,
+                           const dimension_type j,
+                           Coefficient_traits::const_reference numer,
+                           Coefficient_traits::const_reference denom) {
+#ifndef NDEBUG
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(i < 2*space_dim && j < 2*space_dim && i != j);
+  typename OR_Matrix<N>::row_iterator m_i = matrix.row_begin() + i;
+  PPL_ASSERT(j < m_i.row_size());
+  PPL_ASSERT(denom != 0);
+#endif
+  PPL_DIRTY_TEMP(N, k);
+  div_round_up(k, numer, denom);
+  add_octagonal_constraint(i, j, k);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::add_constraints(const Constraint_System& cs) {
+  for (Constraint_System::const_iterator i = cs.begin(),
+         i_end = cs.end(); i != i_end; ++i)
+    add_constraint(*i);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::add_recycled_constraints(Constraint_System& cs) {
+  add_constraints(cs);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::add_recycled_congruences(Congruence_System& cgs) {
+  add_congruences(cgs);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::add_congruences(const Congruence_System& cgs) {
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); i != cgs_end; ++i)
+    add_congruence(*i);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::refine_with_constraint(const Constraint& c) {
+  // Dimension-compatibility check.
+  if (c.space_dimension() > space_dimension())
+    throw_dimension_incompatible("refine_with_constraint(c)", c);
+
+  if (!marked_empty())
+    refine_no_check(c);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::refine_with_constraints(const Constraint_System& cs) {
+  // Dimension-compatibility check.
+  if (cs.space_dimension() > space_dimension())
+    throw_invalid_argument("refine_with_constraints(cs)",
+                           "cs and *this are space-dimension incompatible");
+
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+    refine_no_check(*i);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::refine_with_congruence(const Congruence& cg) {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  // Dimension-compatibility check.
+  if (cg_space_dim > space_dimension())
+    throw_dimension_incompatible("refine_with_congruence(cg)", cg);
+
+  if (!marked_empty())
+    refine_no_check(cg);
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::refine_with_congruences(const Congruence_System& cgs) {
+  // Dimension-compatibility check.
+  if (cgs.space_dimension() > space_dimension())
+    throw_invalid_argument("refine_with_congruences(cgs)",
+                           "cgs and *this are space-dimension incompatible");
+
+  for (Congruence_System::const_iterator i = cgs.begin(),
+         cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
+    refine_no_check(*i);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::refine_no_check(const Congruence& cg) {
+  PPL_ASSERT(!marked_empty());
+  PPL_ASSERT(cg.space_dimension() <= space_dimension());
+
+  if (cg.is_proper_congruence()) {
+    if (cg.is_inconsistent())
+      set_empty();
+    // Other proper congruences are just ignored.
+    return;
+  }
+
+  PPL_ASSERT(cg.is_equality());
+  Constraint c(cg);
+  refine_no_check(c);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::can_recycle_constraint_systems() {
+  return false;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::can_recycle_congruence_systems() {
+  return false;
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>
+::remove_higher_space_dimensions(const dimension_type new_dimension) {
+  // Dimension-compatibility check.
+  if (new_dimension > space_dim)
+    throw_dimension_incompatible("remove_higher_space_dimension(nd)",
+                                 new_dimension);
+  // The removal of no dimensions from any octagon is a no-op.
+  // Note that this case also captures the only legal removal of
+  // dimensions from an octagon in a 0-dim space.
+  if (new_dimension == space_dim) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  strong_closure_assign();
+  matrix.shrink(new_dimension);
+  // When we remove all dimensions from a non-empty octagon,
+  // we obtain the zero-dimensional universe octagon.
+  if (new_dimension == 0 && !marked_empty())
+    set_zero_dim_univ();
+  space_dim = new_dimension;
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::wrap_assign(const Variables_Set& vars,
+                                Bounded_Integer_Type_Width w,
+                                Bounded_Integer_Type_Representation r,
+                                Bounded_Integer_Type_Overflow o,
+                                const Constraint_System* cs_p,
+                                unsigned complexity_threshold,
+                                bool wrap_individually) {
+  Implementation::wrap_assign(*this,
+                              vars, w, r, o, cs_p,
+                              complexity_threshold, wrap_individually,
+                              "Octagonal_Shape");
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::widening_assign(const Octagonal_Shape& y, unsigned* tp) {
+  BHMZ05_widening_assign(y, tp);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::CC76_extrapolation_assign(const Octagonal_Shape& y,
+                                              unsigned* tp) {
+  static N stop_points[] = {
+    N(-2, ROUND_UP),
+    N(-1, ROUND_UP),
+    N( 0, ROUND_UP),
+    N( 1, ROUND_UP),
+    N( 2, ROUND_UP)
+  };
+  CC76_extrapolation_assign(y,
+                            stop_points,
+                            stop_points
+                            + sizeof(stop_points)/sizeof(stop_points[0]),
+                            tp);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::time_elapse_assign(const Octagonal_Shape& y) {
+  // Dimension-compatibility check.
+  if (space_dimension() != y.space_dimension())
+    throw_dimension_incompatible("time_elapse_assign(y)", y);
+  // Compute time-elapse on polyhedra.
+  // TODO: provide a direct implementation.
+  C_Polyhedron ph_x(constraints());
+  C_Polyhedron ph_y(y.constraints());
+  ph_x.time_elapse_assign(ph_y);
+  Octagonal_Shape<T> x(ph_x);
+  m_swap(x);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::strictly_contains(const Octagonal_Shape& y) const {
+  const Octagonal_Shape<T>& x = *this;
+  return x.contains(y) && !y.contains(x);
+}
+
+template <typename T>
+template <typename Interval_Info>
+inline void
+Octagonal_Shape<T>::generalized_refine_with_linear_form_inequality(
+                    const Linear_Form< Interval<T, Interval_Info> >& left,
+                    const Linear_Form< Interval<T, Interval_Info> >& right,
+                    const Relation_Symbol relsym) {
+  switch (relsym) {
+  case EQUAL:
+    // TODO: see if we can handle this case more efficiently.
+    refine_with_linear_form_inequality(left, right);
+    refine_with_linear_form_inequality(right, left);
+    break;
+  case LESS_THAN:
+  case LESS_OR_EQUAL:
+    refine_with_linear_form_inequality(left, right);
+    break;
+  case GREATER_THAN:
+  case GREATER_OR_EQUAL:
+    refine_with_linear_form_inequality(right, left);
+    break;
+  case NOT_EQUAL:
+    break;
+  default:
+    PPL_UNREACHABLE;
+    break;
+  }
+}
+
+template <typename T>
+template <typename Interval_Info>
+inline void
+Octagonal_Shape<T>::
+refine_fp_interval_abstract_store(
+          Box< Interval<T, Interval_Info> >& store) const {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                     "Octagonal_Shape<T>::refine_fp_interval_abstract_store:"
+                     " T not a floating point type.");
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+  store.intersection_assign(Box<FP_Interval_Type>(*this));
+
+}
+
+/*! \relates Octagonal_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Octagonal_Shape<T>& x,
+                            const Octagonal_Shape<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
+  // Dimension-compatibility check.
+  if (x.space_dim != y.space_dim)
+    return false;
+
+  // Zero-dim OSs are equal if and only if they are both empty or universe.
+  if (x.space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires strong closure.
+  x.strong_closure_assign();
+  y.strong_closure_assign();
+
+  // If one of two OSs is empty, then they are equal if and only if
+  // the other OS is empty too.
+  if (x.marked_empty() ||  y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  return rectilinear_distance_assign(r, x.matrix, y.matrix, dir,
+                                     tmp0, tmp1, tmp2);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Octagonal_Shape<T>& x,
+                            const Octagonal_Shape<T>& y,
+                            const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return rectilinear_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename To, typename T>
+inline bool
+rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                            const Octagonal_Shape<T>& x,
+                            const Octagonal_Shape<T>& y,
+                            const Rounding_Dir dir) {
+  return rectilinear_distance_assign<To, To, T>(r, x, y, dir);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Octagonal_Shape<T>& x,
+                          const Octagonal_Shape<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
+  // Dimension-compatibility check.
+  if (x.space_dim != y.space_dim)
+    return false;
+
+  // Zero-dim OSs are equal if and only if they are both empty or universe.
+  if (x.space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires strong closure.
+  x.strong_closure_assign();
+  y.strong_closure_assign();
+
+  // If one of two OSs is empty, then they are equal if and only if
+  // the other OS is empty too.
+  if (x.marked_empty() ||  y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  return euclidean_distance_assign(r, x.matrix, y.matrix, dir,
+                                   tmp0, tmp1, tmp2);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Octagonal_Shape<T>& x,
+                          const Octagonal_Shape<T>& y,
+                          const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return euclidean_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename To, typename T>
+inline bool
+euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                          const Octagonal_Shape<T>& x,
+                          const Octagonal_Shape<T>& y,
+                          const Rounding_Dir dir) {
+  return euclidean_distance_assign<To, To, T>(r, x, y, dir);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Octagonal_Shape<T>& x,
+                           const Octagonal_Shape<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
+  // Dimension-compatibility check.
+  if (x.space_dim != y.space_dim)
+    return false;
+
+  // Zero-dim OSs are equal if and only if they are both empty or universe.
+  if (x.space_dim == 0) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  // The distance computation requires strong closure.
+  x.strong_closure_assign();
+  y.strong_closure_assign();
+
+  // If one of two OSs is empty, then they are equal if and only if
+  // the other OS is empty too.
+  if (x.marked_empty() ||  y.marked_empty()) {
+    if (x.marked_empty() == y.marked_empty())
+      assign_r(r, 0, ROUND_NOT_NEEDED);
+    else
+      assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    return true;
+  }
+
+  return l_infinity_distance_assign(r, x.matrix, y.matrix, dir,
+                                    tmp0, tmp1, tmp2);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename Temp, typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Octagonal_Shape<T>& x,
+                           const Octagonal_Shape<T>& y,
+                           const Rounding_Dir dir) {
+  typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
+  PPL_DIRTY_TEMP(Checked_Temp, tmp0);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp1);
+  PPL_DIRTY_TEMP(Checked_Temp, tmp2);
+  return l_infinity_distance_assign(r, x, y, dir, tmp0, tmp1, tmp2);
+}
+
+/*! \relates Octagonal_Shape */
+template <typename To, typename T>
+inline bool
+l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
+                           const Octagonal_Shape<T>& x,
+                           const Octagonal_Shape<T>& y,
+                           const Rounding_Dir dir) {
+  return l_infinity_distance_assign<To, To, T>(r, x, y, dir);
+}
+
+template <typename T>
+inline memory_size_type
+Octagonal_Shape<T>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename T>
+inline int32_t
+Octagonal_Shape<T>::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::drop_some_non_integer_points_helper(N& elem) {
+  if (!is_integer(elem)) {
+#ifndef NDEBUG
+    Result r =
+#endif
+    floor_assign_r(elem, elem, ROUND_DOWN);
+    PPL_ASSERT(r == V_EQ);
+    reset_strongly_closed();
+  }
+}
+
+/*! \relates Octagonal_Shape */
+template <typename T>
+inline void
+swap(Octagonal_Shape<T>& x, Octagonal_Shape<T>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Octagonal_Shape_inlines_hh)
diff --git a/src/Octagonal_Shape_templates.hh b/src/Octagonal_Shape_templates.hh
new file mode 100644
index 0000000..f4e5ae9
--- /dev/null
+++ b/src/Octagonal_Shape_templates.hh
@@ -0,0 +1,8115 @@
+/* Octagonal_Shape class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Octagonal_Shape_templates_hh
+#define PPL_Octagonal_Shape_templates_hh 1
+
+#include "Generator_System_defs.hh"
+#include "Generator_System_inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
+#include "Interval_defs.hh"
+#include "Linear_Form_defs.hh"
+#include "meta_programming.hh"
+#include "assert.hh"
+#include <vector>
+#include <deque>
+#include <string>
+#include <iostream>
+#include <sstream>
+#include <stdexcept>
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+Octagonal_Shape<T>::Octagonal_Shape(const Polyhedron& ph,
+                                    const Complexity_Class complexity)
+  : matrix(0), space_dim(0), status() {
+  const dimension_type num_dimensions = ph.space_dimension();
+
+  if (ph.marked_empty()) {
+    *this = Octagonal_Shape(num_dimensions, EMPTY);
+    return;
+  }
+
+  if (num_dimensions == 0) {
+    *this = Octagonal_Shape(num_dimensions, UNIVERSE);
+    return;
+  }
+
+  // Build from generators when we do not care about complexity
+  // or when the process has polynomial complexity.
+  if (complexity == ANY_COMPLEXITY
+      || (!ph.has_pending_constraints() && ph.generators_are_up_to_date())) {
+    *this = Octagonal_Shape(ph.generators());
+    return;
+  }
+
+  // We cannot afford exponential complexity, we do not have a complete set
+  // of generators for the polyhedron, and the polyhedron is not trivially
+  // empty or zero-dimensional.  Constraints, however, are up to date.
+  PPL_ASSERT(ph.constraints_are_up_to_date());
+
+  if (!ph.has_something_pending() && ph.constraints_are_minimized()) {
+    // If the constraint system of the polyhedron is minimized,
+    // the test `is_universe()' has polynomial complexity.
+    if (ph.is_universe()) {
+      *this = Octagonal_Shape(num_dimensions, UNIVERSE);
+      return;
+    }
+  }
+
+  // See if there is at least one inconsistent constraint in `ph.con_sys'.
+  for (Constraint_System::const_iterator i = ph.con_sys.begin(),
+         cs_end = ph.con_sys.end(); i != cs_end; ++i)
+    if (i->is_inconsistent()) {
+      *this = Octagonal_Shape(num_dimensions, EMPTY);
+      return;
+    }
+
+  // If `complexity' allows it, use simplex to derive the exact (modulo
+  // the fact that our OSs are topologically closed) variable bounds.
+  if (complexity == SIMPLEX_COMPLEXITY) {
+    MIP_Problem lp(num_dimensions);
+    lp.set_optimization_mode(MAXIMIZATION);
+
+    const Constraint_System& ph_cs = ph.constraints();
+    if (!ph_cs.has_strict_inequalities())
+      lp.add_constraints(ph_cs);
+    else
+      // Adding to `lp' a topologically closed version of `ph_cs'.
+      for (Constraint_System::const_iterator i = ph_cs.begin(),
+             ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
+        const Constraint& c = *i;
+        if (c.is_strict_inequality()) {
+          Linear_Expression expr(c.expression());
+          lp.add_constraint(expr >= 0);
+        }
+        else
+          lp.add_constraint(c);
+      }
+
+    // Check for unsatisfiability.
+    if (!lp.is_satisfiable()) {
+      *this = Octagonal_Shape<T>(num_dimensions, EMPTY);
+      return;
+    }
+
+    // Start with a universe OS that will be refined by the simplex.
+    *this = Octagonal_Shape<T>(num_dimensions, UNIVERSE);
+    // Get all the upper bounds.
+    Generator g(point());
+    PPL_DIRTY_TEMP_COEFFICIENT(numer);
+    PPL_DIRTY_TEMP_COEFFICIENT(denom);
+    for (dimension_type i = 0; i < num_dimensions; ++i) {
+      Variable x(i);
+      // Evaluate optimal upper bound for `x <= ub'.
+      lp.set_objective_function(x);
+      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, numer, denom);
+        numer *= 2;
+        div_round_up(matrix[2*i + 1][2*i], numer, denom);
+      }
+      // Evaluate optimal upper bounds for `x + y <= ub'.
+      for (dimension_type j = 0; j < i; ++j) {
+        Variable y(j);
+        lp.set_objective_function(x + y);
+        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+          g = lp.optimizing_point();
+          lp.evaluate_objective_function(g, numer, denom);
+          div_round_up(matrix[2*i + 1][2*j], numer, denom);
+        }
+      }
+      // Evaluate optimal upper bound for `x - y <= ub'.
+      for (dimension_type j = 0; j < num_dimensions; ++j) {
+        if (i == j)
+          continue;
+        Variable y(j);
+        lp.set_objective_function(x - y);
+        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+          g = lp.optimizing_point();
+          lp.evaluate_objective_function(g, numer, denom);
+          div_round_up(((i < j) ?
+                        matrix[2*j][2*i]
+                        : matrix[2*i + 1][2*j + 1]),
+                       numer, denom);
+        }
+      }
+      // Evaluate optimal upper bound for `y - x <= ub'.
+      for (dimension_type j = 0; j < num_dimensions; ++j) {
+        if (i == j)
+          continue;
+        Variable y(j);
+        lp.set_objective_function(x - y);
+        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+          g = lp.optimizing_point();
+          lp.evaluate_objective_function(g, numer, denom);
+          div_round_up(((i < j)
+                        ? matrix[2*j][2*i]
+                        : matrix[2*i + 1][2*j + 1]),
+                       numer, denom);
+        }
+      }
+      // Evaluate optimal upper bound for `-x - y <= ub'.
+      for (dimension_type j = 0; j < i; ++j) {
+        Variable y(j);
+        lp.set_objective_function(-x - y);
+        if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+          g = lp.optimizing_point();
+          lp.evaluate_objective_function(g, numer, denom);
+          div_round_up(matrix[2*i][2*j + 1], numer, denom);
+        }
+      }
+      // Evaluate optimal upper bound for `-x <= ub'.
+      lp.set_objective_function(-x);
+      if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, numer, denom);
+        numer *= 2;
+        div_round_up(matrix[2*i][2*i + 1], numer, denom);
+      }
+    }
+    set_strongly_closed();
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Extract easy-to-find bounds from constraints.
+  PPL_ASSERT(complexity == POLYNOMIAL_COMPLEXITY);
+  *this = Octagonal_Shape(num_dimensions, UNIVERSE);
+  refine_with_constraints(ph.constraints());
+}
+
+template <typename T>
+Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
+  : matrix(gs.space_dimension()),
+    space_dim(gs.space_dimension()),
+    status() {
+  const Generator_System::const_iterator gs_begin = gs.begin();
+  const Generator_System::const_iterator gs_end = gs.end();
+  if (gs_begin == gs_end) {
+    // An empty generator system defines the empty polyhedron.
+    set_empty();
+    return;
+  }
+
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typename OR_Matrix<N>::row_iterator mat_begin = matrix.row_begin();
+
+  PPL_DIRTY_TEMP(N, tmp);
+  bool mat_initialized = false;
+  bool point_seen = false;
+  // Going through all the points and closure points.
+  for (Generator_System::const_iterator k = gs_begin; k != gs_end; ++k) {
+    const Generator& g = *k;
+    switch (g.type()) {
+    case Generator::POINT:
+      point_seen = true;
+      // Intentionally fall through.
+    case Generator::CLOSURE_POINT:
+      if (!mat_initialized) {
+        // When handling the first (closure) point, we initialize the matrix.
+        mat_initialized = true;
+        const Coefficient& d = g.divisor();
+        // TODO: This can be optimized more, if needed, exploiting the
+        // (possible) sparseness of g. Also consider if OR_Matrix should be
+        // sparse, too.
+        for (dimension_type i = 0; i < space_dim; ++i) {
+          const Coefficient& g_i = g.coefficient(Variable(i));
+          const dimension_type di = 2*i;
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
+          for (dimension_type j = 0; j < i; ++j) {
+            const Coefficient& g_j = g.coefficient(Variable(j));
+            const dimension_type dj = 2*j;
+            // Set for any point the hyperplanes passing in the point
+            // and having the octagonal gradient.
+            // Let be P = [P_1, P_2, ..., P_n] point.
+            // Hyperplanes: X_i - X_j = P_i - P_j.
+            div_round_up(x_i[dj], g_j - g_i, d);
+            div_round_up(x_ii[dj + 1], g_i - g_j, d);
+            // Hyperplanes: X_i + X_j = P_i + P_j.
+            div_round_up(x_i[dj + 1], -g_j - g_i, d);
+            div_round_up(x_ii[dj], g_i + g_j, d);
+          }
+          // Hyperplanes: X_i = P_i.
+          div_round_up(x_i[di + 1], -g_i - g_i, d);
+          div_round_up(x_ii[di], g_i + g_i, d);
+        }
+      }
+      else {
+        // This is not the first point: the matrix already contains
+        // valid values and we must compute maxima.
+        const Coefficient& d = g.divisor();
+        // TODO: This can be optimized more, if needed, exploiting the
+        // (possible) sparseness of g. Also consider if OR_Matrix should be
+        // sparse, too.
+        for (dimension_type i = 0; i < space_dim; ++i) {
+          const Coefficient& g_i = g.coefficient(Variable(i));
+          const dimension_type di = 2*i;
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
+          for (dimension_type j = 0; j < i; ++j) {
+            const Coefficient& g_j = g.coefficient(Variable(j));
+            const dimension_type dj = 2*j;
+            // Set for any point the straight lines passing in the point
+            // and having the octagonal gradient; compute maxima values.
+            // Let be P = [P_1, P_2, ..., P_n] point.
+            // Hyperplane: X_i - X_j = max (P_i - P_j, const).
+            div_round_up(tmp, g_j - g_i, d);
+            max_assign(x_i[dj], tmp);
+            div_round_up(tmp, g_i - g_j, d);
+            max_assign(x_ii[dj + 1], tmp);
+            // Hyperplane: X_i + X_j = max (P_i + P_j, const).
+            div_round_up(tmp, -g_j - g_i, d);
+            max_assign(x_i[dj + 1], tmp);
+            div_round_up(tmp, g_i + g_j, d);
+            max_assign(x_ii[dj], tmp);
+          }
+          // Hyperplane: X_i = max (P_i, const).
+          div_round_up(tmp, -g_i - g_i, d);
+          max_assign(x_i[di + 1], tmp);
+          div_round_up(tmp, g_i + g_i, d);
+          max_assign(x_ii[di], tmp);
+        }
+      }
+      break;
+    default:
+      // Lines and rays temporarily ignored.
+      break;
+    }
+  }
+
+  if (!point_seen)
+    // The generator system is not empty, but contains no points.
+    throw_invalid_argument("Octagonal_Shape(gs)",
+                           "the non-empty generator system gs "
+                           "contains no points.");
+
+  // Going through all the lines and rays.
+  for (Generator_System::const_iterator k = gs_begin; k != gs_end; ++k) {
+    const Generator& g = *k;
+    switch (g.type()) {
+    case Generator::LINE:
+        // TODO: This can be optimized more, if needed, exploiting the
+        // (possible) sparseness of g. Also consider if OR_Matrix should be
+        // sparse, too.
+        for (dimension_type i = 0; i < space_dim; ++i) {
+          const Coefficient& g_i = g.coefficient(Variable(i));
+          const dimension_type di = 2*i;
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
+          for (dimension_type j = 0; j < i; ++j) {
+            const Coefficient& g_j = g.coefficient(Variable(j));
+            const dimension_type dj = 2*j;
+            // Set for any line the right limit.
+            if (g_i != g_j) {
+              // Hyperplane: X_i - X_j <=/>= +Inf.
+              assign_r(x_i[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
+              assign_r(x_ii[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            }
+            if (g_i != -g_j) {
+              // Hyperplane: X_i + X_j <=/>= +Inf.
+              assign_r(x_i[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+              assign_r(x_ii[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            }
+          }
+          if (g_i != 0) {
+            // Hyperplane: X_i <=/>= +Inf.
+            assign_r(x_i[di + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            assign_r(x_ii[di], PLUS_INFINITY, ROUND_NOT_NEEDED);
+          }
+        }
+      break;
+    case Generator::RAY:
+        // TODO: This can be optimized more, if needed, exploiting the
+        // (possible) sparseness of g. Also consider if OR_Matrix should be
+        // sparse, too.
+        for (dimension_type i = 0; i < space_dim; ++i) {
+          const Coefficient& g_i = g.coefficient(Variable(i));
+          const dimension_type di = 2*i;
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
+          for (dimension_type j = 0; j < i; ++j) {
+            const Coefficient& g_j = g.coefficient(Variable(j));
+            const dimension_type dj = 2*j;
+            // Set for any ray the right limit in the case
+            // of the binary constraints.
+            if (g_i < g_j)
+              // Hyperplane: X_i - X_j >= +Inf.
+              assign_r(x_i[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            if (g_i > g_j)
+              // Hyperplane: X_i - X_j <= +Inf.
+              assign_r(x_ii[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            if (g_i < -g_j)
+              // Hyperplane: X_i + X_j >= +Inf.
+              assign_r(x_i[dj + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+            if (g_i > -g_j)
+              // Hyperplane: X_i + X_j <= +Inf.
+              assign_r(x_ii[dj], PLUS_INFINITY, ROUND_NOT_NEEDED);
+          }
+          // Case: unary constraints.
+          if (g_i < 0)
+            // Hyperplane: X_i  = +Inf.
+            assign_r(x_i[di + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+          if (g_i > 0)
+            // Hyperplane: X_i  = +Inf.
+            assign_r(x_ii[di], PLUS_INFINITY, ROUND_NOT_NEEDED);
+        }
+      break;
+    default:
+      // Points and closure points already dealt with.
+      break;
+    }
+  }
+  set_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::add_constraint(const Constraint& c) {
+  const dimension_type c_space_dim = c.space_dimension();
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dim)
+    throw_dimension_incompatible("add_constraint(c)", c);
+
+  // Get rid of strict inequalities.
+  if (c.is_strict_inequality()) {
+    if (c.is_inconsistent()) {
+      set_empty();
+      return;
+    }
+    if (c.is_tautological())
+      return;
+    // Nontrivial strict inequalities are not allowed.
+    throw_invalid_argument("add_constraint(c)",
+                           "strict inequalities are not allowed");
+  }
+
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(term);
+  // Constraints that are not octagonal differences are not allowed.
+  if (!Octagonal_Shape_Helper
+    ::extract_octagonal_difference(c, c_space_dim, num_vars,
+                                   i, j, coeff, term))
+    throw_invalid_argument("add_constraint(c)",
+                           "c is not an octagonal constraint");
+
+  if (num_vars == 0) {
+    // Dealing with a trivial constraint (not a strict inequality).
+    if (c.inhomogeneous_term() < 0
+        || (c.is_equality() && c.inhomogeneous_term() != 0))
+      set_empty();
+    return;
+  }
+
+  // Select the cell to be modified for the "<=" part of constraint.
+  typename OR_Matrix<N>::row_iterator i_iter = matrix.row_begin() + i;
+  typename OR_Matrix<N>::row_reference_type m_i = *i_iter;
+  N& m_i_j = m_i[j];
+  // Set `coeff' to the absolute value of itself.
+  if (coeff < 0)
+    neg_assign(coeff);
+
+  bool is_oct_changed = false;
+  // Compute the bound for `m_i_j', rounding towards plus infinity.
+  PPL_DIRTY_TEMP(N, d);
+  div_round_up(d, term, coeff);
+  if (m_i_j > d) {
+    m_i_j = d;
+    is_oct_changed = true;
+  }
+
+  if (c.is_equality()) {
+    // Select the cell to be modified for the ">=" part of constraint.
+    if (i % 2 == 0)
+      ++i_iter;
+    else
+      --i_iter;
+
+    typename OR_Matrix<N>::row_reference_type m_ci = *i_iter;
+    using namespace Implementation::Octagonal_Shapes;
+    dimension_type cj = coherent_index(j);
+    N& m_ci_cj = m_ci[cj];
+    // Also compute the bound for `m_ci_cj', rounding towards plus infinity.
+    neg_assign(term);
+    div_round_up(d, term, coeff);
+    if (m_ci_cj > d) {
+      m_ci_cj = d;
+      is_oct_changed = true;
+    }
+  }
+
+  // This method does not preserve closure.
+  if (is_oct_changed && marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::add_congruence(const Congruence& cg) {
+  const dimension_type cg_space_dim = cg.space_dimension();
+  // Dimension-compatibility check:
+  // the dimension of `cg' can not be greater than space_dim.
+  if (space_dimension() < cg_space_dim)
+    throw_dimension_incompatible("add_congruence(cg)", cg);
+
+  // Handle the case of proper congruences first.
+  if (cg.is_proper_congruence()) {
+    if (cg.is_tautological())
+      return;
+    if (cg.is_inconsistent()) {
+      set_empty();
+      return;
+    }
+    // Non-trivial and proper congruences are not allowed.
+    throw_invalid_argument("add_congruence(cg)",
+                           "cg is a non-trivial, proper congruence");
+  }
+
+  PPL_ASSERT(cg.is_equality());
+  Constraint c(cg);
+  add_constraint(c);
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+Octagonal_Shape<T>::refine_with_linear_form_inequality(
+                    const Linear_Form< Interval<T, Interval_Info> >& left,
+                    const Linear_Form< Interval<T, Interval_Info> >& right) {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                     "Octagonal_Shape<T>::refine_with_linear_form_inequality:"
+                     " T not a floating point type.");
+
+  // We assume that the analyzer will not try to apply an unreachable filter.
+  PPL_ASSERT(!marked_empty());
+
+  // Dimension-compatibility checks.
+  // The dimensions of `left' and `right' should not be greater than the
+  // dimension of `*this'.
+  const dimension_type left_space_dim = left.space_dimension();
+  if (space_dim < left_space_dim)
+    throw_dimension_incompatible(
+          "refine_with_linear_form_inequality(left, right)", "left", left);
+
+  const dimension_type right_space_dim = right.space_dimension();
+  if (space_dim < right_space_dim)
+    throw_dimension_incompatible(
+          "refine_with_linear_form_inequality(left, right)", "right", right);
+
+  // Number of non-zero coefficients in `left': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type left_t = 0;
+  // Variable-index of the last non-zero coefficient in `left', if any.
+  dimension_type left_w_id = 0;
+  // Number of non-zero coefficients in `right': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type right_t = 0;
+  // Variable-index of the last non-zero coefficient in `right', if any.
+  dimension_type right_w_id = 0;
+
+  // Get information about the number of non-zero coefficients in `left'.
+  for (dimension_type i = left_space_dim; i-- > 0; )
+    if (left.coefficient(Variable(i)) != 0) {
+      if (left_t++ == 1)
+        break;
+      else
+        left_w_id = i;
+    }
+
+  // Get information about the number of non-zero coefficients in `right'.
+  for (dimension_type i = right_space_dim; i-- > 0; )
+    if (right.coefficient(Variable(i)) != 0) {
+      if (right_t++ == 1)
+        break;
+      else
+        right_w_id = i;
+    }
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+  // FIXME: there is plenty of duplicate code in the following lines. We could
+  // shorten it at the expense of a bit of efficiency.
+
+  if (left_t == 0) {
+    if (right_t == 0) {
+      // The constraint involves constants only. Ignore it: it is up to
+      // the analyzer to handle it.
+      PPL_ASSERT(OK());
+      return;
+    }
+
+    if (right_t == 1) {
+      // The constraint has the form [a-, a+] <= [b-, b+] + [c-, c+] * x.
+      // Reduce it to the constraint +/-x <= b+ - a- if [c-, c+] = +/-[1, 1].
+      const FP_Interval_Type& right_w_coeff =
+                              right.coefficient(Variable(right_w_id));
+      if (right_w_coeff == 1) {
+        const dimension_type n_right = right_w_id * 2;
+        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_b = right.inhomogeneous_term();
+        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
+                     ROUND_UP);
+        mul_2exp_assign_r(b_plus_minus_a_minus, b_plus_minus_a_minus, 1,
+                          ROUND_UP);
+        add_octagonal_constraint(n_right, n_right + 1, b_plus_minus_a_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+
+      if (right_w_coeff == -1) {
+        const dimension_type n_right = right_w_id * 2;
+        PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_b = right.inhomogeneous_term();
+        sub_assign_r(b_plus_minus_a_minus, right_b.upper(), left_a.lower(),
+                     ROUND_UP);
+        mul_2exp_assign_r(b_plus_minus_a_minus, b_plus_minus_a_minus, 1,
+                          ROUND_UP);
+        add_octagonal_constraint(n_right + 1, n_right, b_plus_minus_a_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+    }
+  }
+  else if (left_t == 1) {
+    if (right_t == 0) {
+      // The constraint has the form [b-, b+] + [c-, c+] * x <= [a-, a+]
+      // Reduce it to the constraint +/-x <= a+ - b- if [c-, c+] = +/-[1, 1].
+      const FP_Interval_Type& left_w_coeff =
+                              left.coefficient(Variable(left_w_id));
+      if (left_w_coeff == 1) {
+        const dimension_type n_left = left_w_id * 2;
+        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+        const FP_Interval_Type& left_b = left.inhomogeneous_term();
+        const FP_Interval_Type& right_a = right.inhomogeneous_term();
+        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                     ROUND_UP);
+        mul_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
+                          ROUND_UP);
+        add_octagonal_constraint(n_left + 1, n_left, a_plus_minus_b_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+
+      if (left_w_coeff == -1) {
+        const dimension_type n_left = left_w_id * 2;
+        PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+        const FP_Interval_Type& left_b = left.inhomogeneous_term();
+        const FP_Interval_Type& right_a = right.inhomogeneous_term();
+        sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                     ROUND_UP);
+        mul_2exp_assign_r(a_plus_minus_b_minus, a_plus_minus_b_minus, 1,
+                          ROUND_UP);
+        add_octagonal_constraint(n_left, n_left + 1, a_plus_minus_b_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+    }
+
+    if (right_t == 1) {
+      // The constraint has the form
+      // [a-, a+] + [b-, b+] * x <= [c-, c+] + [d-, d+] * y.
+      // Reduce it to the constraint +/-x +/-y <= c+ - a-
+      // if [b-, b+] = +/-[1, 1] and [d-, d+] = +/-[1, 1].
+      const FP_Interval_Type& left_w_coeff =
+                              left.coefficient(Variable(left_w_id));
+      const FP_Interval_Type& right_w_coeff =
+                              right.coefficient(Variable(right_w_id));
+      bool is_left_coeff_one = (left_w_coeff == 1);
+      bool is_left_coeff_minus_one = (left_w_coeff == -1);
+      bool is_right_coeff_one = (right_w_coeff == 1);
+      bool is_right_coeff_minus_one = (right_w_coeff == -1);
+      if (left_w_id == right_w_id) {
+        if ((is_left_coeff_one && is_right_coeff_one)
+            || (is_left_coeff_minus_one && is_right_coeff_minus_one)) {
+          // Here we have an identity or a constants-only constraint.
+          PPL_ASSERT(OK());
+          return;
+        }
+        if (is_left_coeff_one && is_right_coeff_minus_one) {
+          // We fall back to a previous case
+          // (but we do not need to multiply the result by two).
+          const dimension_type n_left = left_w_id * 2;
+          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+          const FP_Interval_Type& left_b = left.inhomogeneous_term();
+          const FP_Interval_Type& right_a = right.inhomogeneous_term();
+          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                       ROUND_UP);
+          add_octagonal_constraint(n_left + 1, n_left, a_plus_minus_b_minus);
+          PPL_ASSERT(OK());
+          return;
+        }
+        if (is_left_coeff_minus_one && is_right_coeff_one) {
+          // We fall back to a previous case
+          // (but we do not need to multiply the result by two).
+          const dimension_type n_left = left_w_id * 2;
+          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+          const FP_Interval_Type& left_b = left.inhomogeneous_term();
+          const FP_Interval_Type& right_a = right.inhomogeneous_term();
+          sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
+                       ROUND_UP);
+          add_octagonal_constraint(n_left, n_left + 1, a_plus_minus_b_minus);
+          PPL_ASSERT(OK());
+          return;
+        }
+      }
+      else if (is_left_coeff_one && is_right_coeff_one) {
+        const dimension_type n_left = left_w_id * 2;
+        const dimension_type n_right = right_w_id * 2;
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_c = right.inhomogeneous_term();
+        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
+                     ROUND_UP);
+        if (left_w_id < right_w_id)
+          add_octagonal_constraint(n_right, n_left, c_plus_minus_a_minus);
+        else
+          add_octagonal_constraint(n_left + 1, n_right + 1,
+                                   c_plus_minus_a_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+      if (is_left_coeff_one && is_right_coeff_minus_one) {
+        const dimension_type n_left = left_w_id * 2;
+        const dimension_type n_right = right_w_id * 2;
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_c = right.inhomogeneous_term();
+        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
+                     ROUND_UP);
+        if (left_w_id < right_w_id)
+          add_octagonal_constraint(n_right + 1, n_left, c_plus_minus_a_minus);
+        else
+          add_octagonal_constraint(n_left + 1, n_right, c_plus_minus_a_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+      if (is_left_coeff_minus_one && is_right_coeff_one) {
+        const dimension_type n_left = left_w_id * 2;
+        const dimension_type n_right = right_w_id * 2;
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_c = right.inhomogeneous_term();
+        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
+                     ROUND_UP);
+        if (left_w_id < right_w_id)
+          add_octagonal_constraint(n_right, n_left + 1, c_plus_minus_a_minus);
+        else
+          add_octagonal_constraint(n_left, n_right + 1, c_plus_minus_a_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+      if (is_left_coeff_minus_one && is_right_coeff_minus_one) {
+        const dimension_type n_left = left_w_id * 2;
+        const dimension_type n_right = right_w_id * 2;
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        const FP_Interval_Type& right_c = right.inhomogeneous_term();
+        sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
+                     ROUND_UP);
+        if (left_w_id < right_w_id)
+          add_octagonal_constraint(n_right + 1, n_left + 1,
+                                   c_plus_minus_a_minus);
+        else
+          add_octagonal_constraint(n_left, n_right, c_plus_minus_a_minus);
+        PPL_ASSERT(OK());
+        return;
+      }
+    }
+  }
+
+  // General case.
+
+  // FIRST, update the binary constraints for each pair of DIFFERENT variables
+  // in `left' and `right'.
+
+  // Declare temporaries outside of the loop.
+  PPL_DIRTY_TEMP(N, low_coeff);
+  PPL_DIRTY_TEMP(N, high_coeff);
+  PPL_DIRTY_TEMP(N, upper_bound);
+
+  Linear_Form<FP_Interval_Type> right_minus_left(right);
+  right_minus_left -= left;
+
+  dimension_type max_w_id = std::max(left_w_id, right_w_id);
+  for (dimension_type first_v = 0; first_v < max_w_id; ++first_v) {
+    for (dimension_type second_v = first_v + 1;
+         second_v <= max_w_id; ++second_v) {
+      const FP_Interval_Type& lfv_coefficient =
+                        left.coefficient(Variable(first_v));
+      const FP_Interval_Type& lsv_coefficient =
+                        left.coefficient(Variable(second_v));
+      const FP_Interval_Type& rfv_coefficient =
+                        right.coefficient(Variable(first_v));
+      const FP_Interval_Type& rsv_coefficient =
+                        right.coefficient(Variable(second_v));
+      // We update the constraints only when both variables appear in at
+      // least one argument.
+      bool do_update = false;
+      assign_r(low_coeff, lfv_coefficient.lower(), ROUND_NOT_NEEDED);
+      assign_r(high_coeff, lfv_coefficient.upper(), ROUND_NOT_NEEDED);
+      if (low_coeff != 0 || high_coeff != 0) {
+        assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
+        assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
+        if (low_coeff != 0 || high_coeff != 0)
+          do_update = true;
+        else {
+          assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
+          assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
+          if (low_coeff != 0 || high_coeff != 0)
+            do_update = true;
+        }
+      }
+      else {
+        assign_r(low_coeff, rfv_coefficient.lower(), ROUND_NOT_NEEDED);
+        assign_r(high_coeff, rfv_coefficient.upper(), ROUND_NOT_NEEDED);
+        if (low_coeff != 0 || high_coeff != 0) {
+          assign_r(low_coeff, lsv_coefficient.lower(), ROUND_NOT_NEEDED);
+          assign_r(high_coeff, lsv_coefficient.upper(), ROUND_NOT_NEEDED);
+          if (low_coeff != 0 || high_coeff != 0)
+            do_update = true;
+          else {
+            assign_r(low_coeff, rsv_coefficient.lower(), ROUND_NOT_NEEDED);
+            assign_r(high_coeff, rsv_coefficient.upper(), ROUND_NOT_NEEDED);
+            if (low_coeff != 0 || high_coeff != 0)
+              do_update = true;
+          }
+        }
+      }
+
+      if (do_update) {
+        Variable first(first_v);
+        Variable second(second_v);
+        dimension_type n_first_var = first_v * 2;
+        dimension_type n_second_var = second_v * 2;
+        linear_form_upper_bound(right_minus_left - first + second,
+                                upper_bound);
+        add_octagonal_constraint(n_second_var + 1, n_first_var + 1,
+                                 upper_bound);
+        linear_form_upper_bound(right_minus_left + first + second,
+                                upper_bound);
+        add_octagonal_constraint(n_second_var + 1, n_first_var, upper_bound);
+        linear_form_upper_bound(right_minus_left - first - second,
+                                upper_bound);
+        add_octagonal_constraint(n_second_var, n_first_var + 1, upper_bound);
+        linear_form_upper_bound(right_minus_left + first - second,
+                                upper_bound);
+        add_octagonal_constraint(n_second_var, n_first_var, upper_bound);
+      }
+    }
+  }
+
+  // Finally, update the unary constraints.
+  for (dimension_type v = 0; v <= max_w_id; ++v) {
+    const FP_Interval_Type& lv_coefficient =
+                        left.coefficient(Variable(v));
+    const FP_Interval_Type& rv_coefficient =
+                        right.coefficient(Variable(v));
+    // We update the constraints only if v appears in at least one of the
+    // two arguments.
+    bool do_update = false;
+    assign_r(low_coeff, lv_coefficient.lower(), ROUND_NOT_NEEDED);
+    assign_r(high_coeff, lv_coefficient.upper(), ROUND_NOT_NEEDED);
+    if (low_coeff != 0 || high_coeff != 0)
+      do_update = true;
+    else {
+      assign_r(low_coeff, rv_coefficient.lower(), ROUND_NOT_NEEDED);
+      assign_r(high_coeff, rv_coefficient.upper(), ROUND_NOT_NEEDED);
+      if (low_coeff != 0 || high_coeff != 0)
+        do_update = true;
+    }
+
+    if (do_update) {
+      Variable var(v);
+      dimension_type n_var = 2 * v;
+      /*
+        VERY DIRTY trick: since we need to keep the old unary constraints
+        while computing the new ones, we momentarily keep the new coefficients
+        in the main diagonal of the matrix. They will be moved later.
+      */
+      linear_form_upper_bound(right_minus_left + var, upper_bound);
+      mul_2exp_assign_r(matrix[n_var + 1][n_var + 1], upper_bound, 1,
+                        ROUND_UP);
+      linear_form_upper_bound(right_minus_left - var, upper_bound);
+      mul_2exp_assign_r(matrix[n_var][n_var], upper_bound, 1,
+                        ROUND_UP);
+    }
+  }
+
+  /*
+    Now move the newly computed coefficients from the main diagonal to
+    their proper place, and restore +infinity on the diagonal.
+  */
+  row_iterator m_ite = matrix.row_begin();
+  row_iterator m_end = matrix.row_end();
+  for (dimension_type i = 0; m_ite != m_end; i += 2) {
+    row_reference upper = *m_ite;
+    N& ul = upper[i];
+    add_octagonal_constraint(i, i + 1, ul);
+    assign_r(ul, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    ++m_ite;
+    row_reference lower = *m_ite;
+    N& lr = lower[i + 1];
+    add_octagonal_constraint(i + 1, i, lr);
+    assign_r(lr, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    ++m_ite;
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::refine_no_check(const Constraint& c) {
+  PPL_ASSERT(!marked_empty());
+  const dimension_type c_space_dim = c.space_dimension();
+  PPL_ASSERT(c_space_dim <= space_dim);
+
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(term);
+  // Constraints that are not octagonal differences are ignored.
+  if (!Octagonal_Shape_Helper
+    ::extract_octagonal_difference(c, c_space_dim, num_vars,
+                                   i, j, coeff, term))
+    return;
+
+  if (num_vars == 0) {
+    const Coefficient& c_inhomo = c.inhomogeneous_term();
+    // Dealing with a trivial constraint (maybe a strict inequality).
+    if (c_inhomo < 0
+        || (c_inhomo != 0 && c.is_equality())
+        || (c_inhomo == 0 && c.is_strict_inequality()))
+      set_empty();
+    return;
+  }
+
+  // Select the cell to be modified for the "<=" part of constraint.
+  typename OR_Matrix<N>::row_iterator i_iter = matrix.row_begin() + i;
+  typename OR_Matrix<N>::row_reference_type m_i = *i_iter;
+  N& m_i_j = m_i[j];
+  // Set `coeff' to the absolute value of itself.
+  if (coeff < 0)
+    neg_assign(coeff);
+
+  bool is_oct_changed = false;
+  // Compute the bound for `m_i_j', rounding towards plus infinity.
+  PPL_DIRTY_TEMP(N, d);
+  div_round_up(d, term, coeff);
+  if (m_i_j > d) {
+    m_i_j = d;
+    is_oct_changed = true;
+  }
+
+  if (c.is_equality()) {
+    // Select the cell to be modified for the ">=" part of constraint.
+    if (i % 2 == 0)
+      ++i_iter;
+    else
+      --i_iter;
+
+    typename OR_Matrix<N>::row_reference_type m_ci = *i_iter;
+    using namespace Implementation::Octagonal_Shapes;
+    dimension_type cj = coherent_index(j);
+    N& m_ci_cj = m_ci[cj];
+    // Also compute the bound for `m_ci_cj', rounding towards plus infinity.
+    neg_assign(term);
+    div_round_up(d, term, coeff);
+    if (m_ci_cj > d) {
+      m_ci_cj = d;
+      is_oct_changed = true;
+    }
+  }
+
+  // This method does not preserve closure.
+  if (is_oct_changed && marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+dimension_type
+Octagonal_Shape<T>::affine_dimension() const {
+  const dimension_type n_rows = matrix.num_rows();
+  // A zero-space-dim shape always has affine dimension zero.
+  if (n_rows == 0)
+    return 0;
+
+  // Strong closure is necessary to detect emptiness
+  // and all (possibly implicit) equalities.
+  strong_closure_assign();
+  if (marked_empty())
+    return 0;
+
+  // The vector `leaders' is used to represent non-singular
+  // equivalence classes:
+  // `leaders[i] == i' if and only if `i' is the leader of its
+  // equivalence class (i.e., the minimum index in the class).
+  std::vector<dimension_type> leaders;
+  compute_leaders(leaders);
+
+  // Due to the splitting of variables, the affine dimension is the
+  // number of non-singular positive zero-equivalence classes.
+  dimension_type affine_dim = 0;
+  for (dimension_type i = 0; i < n_rows; i += 2)
+    // Note: disregard the singular equivalence class.
+    if (leaders[i] == i && leaders[i + 1] == i + 1)
+      ++affine_dim;
+
+  return affine_dim;
+}
+
+template <typename T>
+Congruence_System
+Octagonal_Shape<T>::minimized_congruences() const {
+  // Strong closure is necessary to detect emptiness
+  // and all (possibly implicit) equalities.
+  strong_closure_assign();
+  const dimension_type space_dim = space_dimension();
+  Congruence_System cgs(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cgs = Congruence_System::zero_dim_empty();
+    return cgs;
+  }
+
+  if (marked_empty()) {
+    cgs.insert(Congruence::zero_dim_false());
+    return cgs;
+  }
+
+  // The vector `leaders' is used to represent equivalence classes:
+  // `leaders[i] == i' if and only if `i' is the leader of its
+  // equivalence class (i.e., the minimum index in the class).
+  std::vector<dimension_type> leaders;
+  compute_leaders(leaders);
+
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  for (dimension_type i = 0, i_end = 2*space_dim; i != i_end; i += 2) {
+    const dimension_type lead_i = leaders[i];
+    if (i == lead_i) {
+      if (leaders[i + 1] == i)
+        // `i' is the leader of the singular equivalence class.
+        goto singular;
+      else
+        // `i' is the leader of a non-singular equivalence class.
+        continue;
+    }
+    else {
+      // `i' is not a leader.
+      if (leaders[i + 1] == lead_i)
+        // `i' belongs to the singular equivalence class.
+        goto singular;
+      else
+        // `i' does not belong to the singular equivalence class.
+        goto non_singular;
+    }
+
+  singular:
+    // `i' belongs to the singular equivalence class:
+    // we have a unary equality constraint.
+    {
+      const Variable x(i/2);
+      const N& c_ii_i = matrix[i + 1][i];
+#ifndef NDEBUG
+      const N& c_i_ii = matrix[i][i + 1];
+      PPL_ASSERT(is_additive_inverse(c_i_ii, c_ii_i));
+#endif
+      numer_denom(c_ii_i, numer, denom);
+      denom *= 2;
+      cgs.insert(denom*x == numer);
+    }
+    continue;
+
+  non_singular:
+    // `i' does not belong to the singular equivalence class.
+    // we have a binary equality constraint.
+    {
+      const N& c_i_li = matrix[i][lead_i];
+#ifndef NDEBUG
+      using namespace Implementation::Octagonal_Shapes;
+      const N& c_ii_lii = matrix[i + 1][coherent_index(lead_i)];
+      PPL_ASSERT(is_additive_inverse(c_ii_lii, c_i_li));
+#endif
+      const Variable x(lead_i/2);
+      const Variable y(i/2);
+      numer_denom(c_i_li, numer, denom);
+      if (lead_i % 2 == 0)
+        cgs.insert(denom*x - denom*y == numer);
+      else
+        cgs.insert(denom*x + denom*y + numer == 0);
+    }
+    continue;
+  }
+  return cgs;
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::concatenate_assign(const Octagonal_Shape& y) {
+  // If `y' is an empty 0-dim space octagon, let `*this' become empty.
+  // If `y' is an universal 0-dim space octagon, we simply return.
+  if (y.space_dim == 0) {
+    if (y.marked_empty())
+      set_empty();
+    return;
+  }
+
+  // If `*this' is an empty 0-dim space octagon, then it is sufficient
+  // to adjust the dimension of the vector space.
+  if (space_dim == 0 && marked_empty()) {
+    add_space_dimensions_and_embed(y.space_dim);
+    return;
+  }
+
+  // This is the old number of rows in the matrix. It is equal to
+  // the first index of columns to change.
+  dimension_type old_num_rows = matrix.num_rows();
+  // First we increase the space dimension of `*this' by adding
+  // `y.space_dimension()' new dimensions.
+  // The matrix for the new octagon is obtained
+  // by leaving the old system of constraints in the upper left-hand side
+  // (where they are at the present) and placing the constraints of `y' in the
+  // lower right-hand side.
+  add_space_dimensions_and_embed(y.space_dim);
+  typename OR_Matrix<N>::const_element_iterator
+    y_it = y.matrix.element_begin();
+  for (typename OR_Matrix<N>::row_iterator
+         i = matrix.row_begin() + old_num_rows,
+         matrix_row_end = matrix.row_end(); i != matrix_row_end; ++i) {
+    typename OR_Matrix<N>::row_reference_type r = *i;
+    dimension_type rs_i = i.row_size();
+    for (dimension_type j = old_num_rows; j < rs_i; ++j, ++y_it)
+      r[j] = *y_it;
+  }
+
+  // The concatenation does not preserve the closure.
+  if (marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::contains(const Octagonal_Shape& y) const {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("contains(y)", y);
+
+  if (space_dim == 0) {
+    // The zero-dimensional empty octagon only contains another
+    // zero-dimensional empty octagon.
+    // The zero-dimensional universe octagon contains any other
+    // zero-dimensional octagon.
+    return marked_empty() ? y.marked_empty() : true;
+  }
+
+  // `y' needs to be transitively closed.
+  y.strong_closure_assign();
+  // An empty octagon is in any other dimension-compatible octagons.
+  if (y.marked_empty())
+    return true;
+
+  // If `*this' is empty it can not contain `y' (which is not empty).
+  if (is_empty())
+    return false;
+
+  // `*this' contains `y' if and only if every element of `*this'
+  // is greater than or equal to the correspondent one of `y'.
+  for (typename OR_Matrix<N>::const_element_iterator
+         i = matrix.element_begin(), j = y.matrix.element_begin(),
+         matrix_element_end = matrix.element_end();
+       i != matrix_element_end; ++i, ++j)
+    if (*i < *j)
+      return false;
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::is_disjoint_from(const Octagonal_Shape& y) const {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("is_disjoint_from(y)", y);
+
+  // If one Octagonal_Shape is empty, the Octagonal_Shapes are disjoint.
+  strong_closure_assign();
+  if (marked_empty())
+    return true;
+  y.strong_closure_assign();
+  if (y.marked_empty())
+    return true;
+
+  // Two Octagonal_Shapes are disjoint if and only if their
+  // intersection is empty, i.e., if and only if there exists a
+  // variable such that the upper bound of the constraint on that
+  // variable in the first Octagonal_Shape is strictly less than the
+  // lower bound of the corresponding constraint in the second
+  // Octagonal_Shape or vice versa.
+
+  const dimension_type n_rows = matrix.num_rows();
+
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
+
+  const row_iterator y_begin = y.matrix.row_begin();
+
+  PPL_DIRTY_TEMP(N, neg_y_ci_cj);
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
+    using namespace Implementation::Octagonal_Shapes;
+    const dimension_type i = i_iter.index();
+    const dimension_type ci = coherent_index(i);
+    const dimension_type rs_i = i_iter.row_size();
+    row_reference m_i = *i_iter;
+    for (dimension_type j = 0; j < n_rows; ++j) {
+      const dimension_type cj = coherent_index(j);
+      row_reference m_cj = *(m_begin + cj);
+      const N& m_i_j = (j < rs_i) ? m_i[j] : m_cj[ci];
+      row_reference y_ci = *(y_begin + ci);
+      row_reference y_j = *(y_begin + j);
+      const N& y_ci_cj = (j < rs_i) ? y_ci[cj] : y_j[i];
+      neg_assign_r(neg_y_ci_cj, y_ci_cj, ROUND_UP);
+      if (m_i_j < neg_y_ci_cj)
+        return true;
+    }
+  }
+  return false;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::is_universe() const {
+  // An empty octagon is not universe.
+  if (marked_empty())
+    return false;
+
+  // If the octagon is non-empty and zero-dimensional,
+  // then it is necessarily the universe octagon.
+  if (space_dim == 0)
+    return true;
+
+  // An universe octagon can only contains trivial  constraints.
+  for (typename OR_Matrix<N>::const_element_iterator
+         i = matrix.element_begin(), matrix_element_end = matrix.element_end();
+       i != matrix_element_end;
+       ++i)
+    if (!is_plus_infinity(*i))
+      return false;
+
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::is_bounded() const {
+  strong_closure_assign();
+  // A zero-dimensional or empty octagon is bounded.
+  if (marked_empty() || space_dim == 0)
+    return true;
+
+  // A bounded octagon never can contains trivial constraints.
+  for (typename OR_Matrix<N>::const_row_iterator i = matrix.row_begin(),
+         matrix_row_end = matrix.row_end(); i != matrix_row_end; ++i) {
+    typename OR_Matrix<N>::const_row_reference_type x_i = *i;
+    const dimension_type i_index = i.index();
+    for (dimension_type j = i.row_size(); j-- > 0; )
+      if (i_index != j)
+        if (is_plus_infinity(x_i[j]))
+          return false;
+  }
+
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::contains_integer_point() const {
+  // Force strong closure.
+  if (is_empty())
+    return false;
+  const dimension_type space_dim = space_dimension();
+  if (space_dim == 0)
+    return true;
+
+  // A strongly closed and consistent Octagonal_Shape defined by
+  // integer constraints can only be empty due to tight coherence.
+  if (std::numeric_limits<T>::is_integer)
+    return !tight_coherence_would_make_empty();
+
+  // Build an integer Octagonal_Shape oct_z with bounds at least as
+  // tight as those in *this and then recheck for emptiness, also
+  // exploiting tight-coherence.
+  Octagonal_Shape<mpz_class> oct_z(space_dim);
+  oct_z.reset_strongly_closed();
+
+  typedef Octagonal_Shape<mpz_class>::N Z;
+  bool all_integers = true;
+  typename OR_Matrix<N>::const_element_iterator x_i = matrix.element_begin();
+  for (typename OR_Matrix<Z>::element_iterator
+         z_i = oct_z.matrix.element_begin(),
+         z_end = oct_z.matrix.element_end(); z_i != z_end; ++z_i, ++x_i) {
+    const N& d = *x_i;
+    if (is_plus_infinity(d))
+      continue;
+    if (is_integer(d))
+      assign_r(*z_i, d, ROUND_NOT_NEEDED);
+    else {
+      all_integers = false;
+      assign_r(*z_i, d, ROUND_DOWN);
+    }
+  }
+  // Restore strong closure.
+  if (all_integers)
+    // oct_z unchanged, so it is still strongly closed.
+    oct_z.set_strongly_closed();
+  else {
+    // oct_z changed: recompute strong closure.
+    oct_z.strong_closure_assign();
+    if (oct_z.marked_empty())
+      return false;
+  }
+  return !oct_z.tight_coherence_would_make_empty();
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::frequency(const Linear_Expression& expr,
+                              Coefficient& freq_n, Coefficient& freq_d,
+                              Coefficient& val_n, Coefficient& val_d) const {
+  dimension_type space_dim = space_dimension();
+  // The dimension of `expr' must be at most the dimension of *this.
+  if (space_dim < expr.space_dimension())
+    throw_dimension_incompatible("frequency(e, ...)", "e", expr);
+
+  // Check if `expr' has a constant value.
+  // If it is constant, set the frequency `freq_n' to 0
+  // and return true. Otherwise the values for \p expr
+  // are not discrete so return false.
+
+  // Space dimension is 0: if empty, then return false;
+  // otherwise the frequency is 0 and the value is the inhomogeneous term.
+  if (space_dim == 0) {
+    if (is_empty())
+      return false;
+    freq_n = 0;
+    freq_d = 1;
+    val_n = expr.inhomogeneous_term();
+    val_d = 1;
+    return true;
+  }
+
+  strong_closure_assign();
+  // For an empty Octagonal shape, we simply return false.
+  if (marked_empty())
+    return false;
+
+  // The Octagonal shape has at least 1 dimension and is not empty.
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff_j);
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  Linear_Expression le = expr;
+  // Boolean to keep track of a variable `v' in expression `le'.
+  // If we can replace `v' by an expression using variables other
+  // than `v' and are already in `le', then this is set to true.
+  bool constant_v = false;
+
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
+  val_denom = 1;
+
+  for (row_iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
+    constant_v = false;
+    dimension_type i = i_iter.index();
+    const Variable v(i/2);
+    coeff = le.coefficient(v);
+    if (coeff == 0) {
+      constant_v = true;
+      continue;
+    }
+    // We check the unary constraints.
+    row_reference m_i = *i_iter;
+    row_reference m_ii = *(i_iter + 1);
+    const N& m_i_ii = m_i[i + 1];
+    const N& m_ii_i = m_ii[i];
+    if ((!is_plus_infinity(m_i_ii) && !is_plus_infinity(m_ii_i))
+        && (is_additive_inverse(m_i_ii, m_ii_i))) {
+      // If `v' is constant, replace it in `le' by the value.
+      numer_denom(m_i_ii, numer, denom);
+      denom *= 2;
+      le -= coeff*v;
+      le *= denom;
+      le -= numer*coeff;
+      val_denom *= denom;
+      constant_v = true;
+      continue;
+    }
+    // Check the octagonal constraints between `v' and the other dimensions
+    // that have non-zero coefficient in `le'.
+    else {
+      PPL_ASSERT(!constant_v);
+      using namespace Implementation::Octagonal_Shapes;
+      const dimension_type ci = coherent_index(i);
+      for (row_iterator j_iter = i_iter; j_iter != m_end; j_iter += 2) {
+        dimension_type j = j_iter.index();
+        const Variable vj(j/2);
+        coeff_j = le.coefficient(vj);
+        if (coeff_j == 0)
+          // The coefficient in `le' is 0, so do nothing.
+          continue;
+        const dimension_type cj = coherent_index(j);
+        const dimension_type cjj = coherent_index(j + 1);
+
+        row_reference m_j = *(m_begin + j);
+        row_reference m_cj = *(m_begin + cj);
+        const N& m_j_i = m_j[i];
+        const N& m_i_j = m_cj[ci];
+        if ((!is_plus_infinity(m_i_j) && !is_plus_infinity(m_j_i))
+            && (is_additive_inverse(m_i_j, m_j_i))) {
+          // The coefficient for `vj' in `le' is not 0
+          // and the constraint with `v' is an equality.
+          // So apply this equality to eliminate `v' in `le'.
+          numer_denom(m_i_j, numer, denom);
+          le -= coeff*v;
+          le += coeff*vj;
+          le *= denom;
+          le -= numer*coeff;
+          val_denom *= denom;
+          constant_v = true;
+          break;
+        }
+
+        m_j = *(m_begin + (j + 1));
+        m_cj = *(m_begin + cjj);
+        const N& m_j_i1 = m_j[i];
+        const N& m_i_j1 = m_cj[ci];
+        if ((!is_plus_infinity(m_i_j1) && !is_plus_infinity(m_j_i1))
+            && (is_additive_inverse(m_i_j1, m_j_i1))) {
+          // The coefficient for `vj' in `le' is not 0
+          // and the constraint with `v' is an equality.
+          // So apply this equality to eliminate `v' in `le'.
+          numer_denom(m_i_j1, numer, denom);
+          le -= coeff*v;
+          le -= coeff*vj;
+          le *= denom;
+          le -= numer*coeff;
+          val_denom *= denom;
+          constant_v = true;
+          break;
+        }
+      }
+      if (!constant_v)
+        // The expression `expr' is not constant.
+        return false;
+    }
+  }
+  if (!constant_v)
+    // The expression `expr' is not constant.
+    return false;
+
+  // The expression 'expr' is constant.
+  freq_n = 0;
+  freq_d = 1;
+
+  // Reduce `val_n' and `val_d'.
+  normalize2(le.inhomogeneous_term(), val_denom, val_n, val_d);
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::constrains(const Variable var) const {
+  // `var' should be one of the dimensions of the octagonal shape.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (space_dimension() < var_space_dim)
+    throw_dimension_incompatible("constrains(v)", "v", var);
+
+  // An octagon known to be empty constrains all variables.
+  // (Note: do not force emptiness check _yet_)
+  if (marked_empty())
+    return true;
+
+  // Check whether `var' is syntactically constrained.
+  const dimension_type n_v = 2*(var_space_dim - 1);
+  typename OR_Matrix<N>::const_row_iterator m_iter = matrix.row_begin() + n_v;
+  typename OR_Matrix<N>::const_row_reference_type r_v = *m_iter;
+  typename OR_Matrix<N>::const_row_reference_type r_cv = *(++m_iter);
+  for (dimension_type h = m_iter.row_size(); h-- > 0; ) {
+    if (!is_plus_infinity(r_v[h]) || !is_plus_infinity(r_cv[h]))
+      return true;
+  }
+  ++m_iter;
+  for (typename OR_Matrix<N>::const_row_iterator m_end = matrix.row_end();
+       m_iter != m_end; ++m_iter) {
+    typename OR_Matrix<N>::const_row_reference_type r = *m_iter;
+    if (!is_plus_infinity(r[n_v]) || !is_plus_infinity(r[n_v + 1]))
+      return true;
+  }
+
+  // `var' is not syntactically constrained:
+  // now force an emptiness check.
+  return is_empty();
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::is_strong_coherent() const {
+  // This method is only used by method OK() so as to check if a
+  // strongly closed matrix is also strong-coherent, as it must be.
+  const dimension_type num_rows = matrix.num_rows();
+
+  // Allocated here once and for all.
+  PPL_DIRTY_TEMP(N, semi_sum);
+  // The strong-coherence is: for every indexes i and j (and i != j)
+  // matrix[i][j] <= (matrix[i][ci] + matrix[cj][j])/2
+  // where ci = i + 1, if i is even number or
+  //       ci = i - 1, if i is odd.
+  // Ditto for cj.
+  for (dimension_type i = num_rows; i-- > 0; ) {
+    typename OR_Matrix<N>::const_row_iterator iter = matrix.row_begin() + i;
+    typename OR_Matrix<N>::const_row_reference_type m_i = *iter;
+    using namespace Implementation::Octagonal_Shapes;
+    const N& m_i_ci = m_i[coherent_index(i)];
+    for (dimension_type j = matrix.row_size(i); j-- > 0; )
+      // Note: on the main diagonal only PLUS_INFINITY can occur.
+      if (i != j) {
+        const N& m_cj_j = matrix[coherent_index(j)][j];
+        if (!is_plus_infinity(m_i_ci)
+            && !is_plus_infinity(m_cj_j)) {
+          // Compute (m_i_ci + m_cj_j)/2 into `semi_sum',
+          // rounding the result towards plus infinity.
+          add_assign_r(semi_sum, m_i_ci, m_cj_j, ROUND_UP);
+          div_2exp_assign_r(semi_sum, semi_sum, 1, ROUND_UP);
+          if (m_i[j] > semi_sum)
+            return false;
+        }
+      }
+  }
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::is_strongly_reduced() const {
+  // This method is only used in assertions: efficiency is not a must.
+
+  // An empty octagon is already transitively reduced.
+  if (marked_empty())
+    return true;
+
+  Octagonal_Shape x = *this;
+  // The matrix representing an OS is strongly reduced if, by removing
+  // any constraint, the resulting matrix describes a different OS.
+  for (typename OR_Matrix<N>::const_row_iterator iter = matrix.row_begin(),
+         matrix_row_end = matrix.row_end(); iter != matrix_row_end; ++iter) {
+    typename OR_Matrix<N>::const_row_reference_type m_i = *iter;
+    const dimension_type i = iter.index();
+    for (dimension_type j = iter.row_size(); j-- > 0; ) {
+      if (!is_plus_infinity(m_i[j])) {
+        Octagonal_Shape x_copy = *this;
+        assign_r(x_copy.matrix[i][j], PLUS_INFINITY, ROUND_NOT_NEEDED);
+        if (x == x_copy)
+          return false;
+      }
+    }
+  }
+  // The octagon is just reduced.
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::bounds(const Linear_Expression& expr,
+                           const bool from_above) const {
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((from_above
+                                  ? "bounds_from_above(e)"
+                                  : "bounds_from_below(e)"), "e", expr);
+  strong_closure_assign();
+
+  // A zero-dimensional or empty octagon bounds everything.
+  if (space_dim == 0 || marked_empty())
+    return true;
+
+  // The constraint `c' is used to check if `expr' is an octagonal difference
+  // and, in this case, to select the cell.
+  const Constraint& c = (from_above) ? expr <= 0 : expr >= 0;
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(term);
+  if (Octagonal_Shape_Helper
+    ::extract_octagonal_difference(c, c.space_dimension(), num_vars,
+                                   i, j, coeff, term)) {
+    if (num_vars == 0)
+      return true;
+    // Select the cell to be checked.
+    typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
+    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
+    return !is_plus_infinity(m_i[j]);
+  }
+  else {
+    // `c' is not an octagonal constraint: use the MIP solver.
+    Optimization_Mode mode_bounds =
+      from_above ? MAXIMIZATION : MINIMIZATION;
+    MIP_Problem mip(space_dim, constraints(), expr, mode_bounds);
+    return mip.solve() == OPTIMIZED_MIP_PROBLEM;
+  }
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::max_min(const Linear_Expression& expr,
+                            const bool maximize,
+                            Coefficient& ext_n, Coefficient& ext_d,
+                            bool& included) const {
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((maximize
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
+  // Deal with zero-dim octagons first.
+  if (space_dim == 0) {
+    if (marked_empty())
+      return false;
+    else {
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      return true;
+    }
+  }
+
+  strong_closure_assign();
+  // For an empty OS we simply return false.
+  if (marked_empty())
+    return false;
+
+  // The constraint `c' is used to check if `expr' is an octagonal difference
+  // and, in this case, to select the cell.
+  const Constraint& c = (maximize) ? expr <= 0 : expr >= 0;
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(term);
+  if (!Octagonal_Shape_Helper
+    ::extract_octagonal_difference(c, c.space_dimension(), num_vars,
+                                   i, j, coeff, term)) {
+    // `c' is not an octagonal constraint: use the MIP solver.
+    Optimization_Mode max_min = (maximize) ? MAXIMIZATION : MINIMIZATION;
+    MIP_Problem mip(space_dim, constraints(), expr, max_min);
+    if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
+      mip.optimal_value(ext_n, ext_d);
+      included = true;
+      return true;
+    }
+    else
+      // Here`expr' is unbounded in `*this'.
+      return false;
+  }
+  else {
+    // `c' is an octagonal constraint.
+    if (num_vars == 0) {
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      return true;
+    }
+
+    // Select the cell to be checked.
+    typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
+    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
+    PPL_DIRTY_TEMP(N, d);
+    if (!is_plus_infinity(m_i[j])) {
+      const Coefficient& b = expr.inhomogeneous_term();
+      PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+      neg_assign(minus_b, b);
+      const Coefficient& sc_b = maximize ? b : minus_b;
+      assign_r(d, sc_b, ROUND_UP);
+      // Set `coeff_expr' to the absolute value of coefficient of a variable
+      // of `expr'.
+      PPL_DIRTY_TEMP(N, coeff_expr);
+      const Coefficient& coeff_i = expr.coefficient(Variable(i/2));
+      const int sign_i = sgn(coeff_i);
+      if (sign_i > 0)
+        assign_r(coeff_expr, coeff_i, ROUND_UP);
+      else {
+        PPL_DIRTY_TEMP_COEFFICIENT(minus_coeff_i);
+        neg_assign(minus_coeff_i, coeff_i);
+        assign_r(coeff_expr, minus_coeff_i, ROUND_UP);
+      }
+      // Approximating the maximum/minimum of `expr'.
+      if (num_vars == 1) {
+        PPL_DIRTY_TEMP(N, m_i_j);
+        div_2exp_assign_r(m_i_j, m_i[j], 1, ROUND_UP);
+        add_mul_assign_r(d, coeff_expr, m_i_j, ROUND_UP);
+      }
+      else
+        add_mul_assign_r(d, coeff_expr, m_i[j], ROUND_UP);
+      numer_denom(d, ext_n, ext_d);
+      if (!maximize)
+        neg_assign(ext_n);
+      included = true;
+      return true;
+    }
+
+    // The `expr' is unbounded.
+    return false;
+  }
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::max_min(const Linear_Expression& expr,
+                            const bool maximize,
+                            Coefficient& ext_n, Coefficient& ext_d,
+                            bool& included, Generator& g) const {
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible((maximize
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
+  // Deal with zero-dim octagons first.
+  if (space_dim == 0) {
+    if (marked_empty())
+      return false;
+    else {
+      ext_n = expr.inhomogeneous_term();
+      ext_d = 1;
+      included = true;
+      g = point();
+      return true;
+    }
+  }
+
+  strong_closure_assign();
+  // For an empty OS we simply return false.
+  if (marked_empty())
+    return false;
+  if (!is_universe()) {
+    // We use MIP_Problems to handle constraints that are not
+    // octagonal difference.
+    Optimization_Mode max_min = (maximize) ? MAXIMIZATION : MINIMIZATION;
+    MIP_Problem mip(space_dim, constraints(), expr, max_min);
+    if (mip.solve() == OPTIMIZED_MIP_PROBLEM) {
+      g = mip.optimizing_point();
+      mip.evaluate_objective_function(g, ext_n, ext_d);
+      included = true;
+      return true;
+    }
+  }
+  // The `expr' is unbounded.
+  return false;
+}
+
+template <typename T>
+Poly_Con_Relation
+Octagonal_Shape<T>::relation_with(const Congruence& cg) const {
+  dimension_type cg_space_dim = cg.space_dimension();
+
+  // Dimension-compatibility check.
+  if (cg_space_dim > space_dim)
+    throw_dimension_incompatible("relation_with(cg)", cg);
+
+  // If the congruence is an equality,
+  // find the relation with the equivalent equality constraint.
+  if (cg.is_equality()) {
+    Constraint c(cg);
+    return relation_with(c);
+  }
+
+  strong_closure_assign();
+
+  if (marked_empty())
+    return Poly_Con_Relation::saturates()
+      && Poly_Con_Relation::is_included()
+      && Poly_Con_Relation::is_disjoint();
+
+  if (space_dim == 0) {
+    if (cg.is_inconsistent())
+      return Poly_Con_Relation::is_disjoint();
+    else
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_included();
+  }
+
+  // Find the lower bound for a hyperplane with direction
+  // defined by the congruence.
+  Linear_Expression le(cg.expression());
+  PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
+  bool min_included;
+  bool bounded_below = minimize(le, min_numer, min_denom, min_included);
+
+  // If there is no lower bound, then some of the hyperplanes defined by
+  // the congruence will strictly intersect the shape.
+  if (!bounded_below)
+    return Poly_Con_Relation::strictly_intersects();
+
+  // TODO: Consider adding a max_and_min() method, performing both
+  // maximization and minimization so as to possibly exploit
+  // incrementality of the MIP solver.
+
+  // Find the upper bound for a hyperplane with direction
+  // defined by the congruence.
+  PPL_DIRTY_TEMP_COEFFICIENT(max_numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(max_denom);
+  bool max_included;
+  bool bounded_above = maximize(le, max_numer, max_denom, max_included);
+
+  // If there is no upper bound, then some of the hyperplanes defined by
+  // the congruence will strictly intersect the shape.
+  if (!bounded_above)
+    return Poly_Con_Relation::strictly_intersects();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(signed_distance);
+
+  // Find the position value for the hyperplane that satisfies the congruence
+  // and is above the lower bound for the shape.
+  PPL_DIRTY_TEMP_COEFFICIENT(min_value);
+  min_value = min_numer / min_denom;
+  const Coefficient& modulus = cg.modulus();
+  signed_distance = min_value % modulus;
+  min_value -= signed_distance;
+  if (min_value * min_denom < min_numer)
+    min_value += modulus;
+
+  // Find the position value for the hyperplane that satisfies the congruence
+  // and is below the upper bound for the shape.
+  PPL_DIRTY_TEMP_COEFFICIENT(max_value);
+  max_value = max_numer / max_denom;
+  signed_distance = max_value % modulus;
+  max_value += signed_distance;
+  if (max_value * max_denom > max_numer)
+    max_value -= modulus;
+
+  // If the upper bound value is less than the lower bound value,
+  // then there is an empty intersection with the congruence;
+  // otherwise it will strictly intersect.
+  if (max_value < min_value)
+    return Poly_Con_Relation::is_disjoint();
+  else
+    return Poly_Con_Relation::strictly_intersects();
+}
+
+template <typename T>
+Poly_Con_Relation
+Octagonal_Shape<T>::relation_with(const Constraint& c) const {
+  dimension_type c_space_dim = c.space_dimension();
+
+  // Dimension-compatibility check.
+  if (c_space_dim > space_dim)
+    throw_dimension_incompatible("relation_with(c)", c);
+
+  // The closure needs to make explicit the implicit constraints.
+  strong_closure_assign();
+
+  if (marked_empty())
+    return Poly_Con_Relation::saturates()
+      && Poly_Con_Relation::is_included()
+      && Poly_Con_Relation::is_disjoint();
+
+  if (space_dim == 0) {
+    // Trivially false zero-dimensional constraint.
+    if ((c.is_equality() && c.inhomogeneous_term() != 0)
+        || (c.is_inequality() && c.inhomogeneous_term() < 0))
+      return Poly_Con_Relation::is_disjoint();
+    else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
+      // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
+      // thus, the zero-dimensional point also saturates it.
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_disjoint();
+
+    // Trivially true zero-dimensional constraint.
+    else if (c.is_equality() || c.inhomogeneous_term() == 0)
+      return Poly_Con_Relation::saturates()
+        && Poly_Con_Relation::is_included();
+    else
+      // The zero-dimensional point saturates
+      // neither the positivity constraint 1 >= 0,
+      // nor the strict positivity constraint 1 > 0.
+      return Poly_Con_Relation::is_included();
+  }
+
+  dimension_type num_vars = 0;
+  dimension_type i = 0;
+  dimension_type j = 0;
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(c_term);
+  if (!Octagonal_Shape_Helper
+    ::extract_octagonal_difference(c, c_space_dim, num_vars,
+                                   i, j, coeff, c_term)) {
+    // Constraints that are not octagonal differences.
+    // Use maximize() and minimize() to do much of the work.
+
+    // Find the linear expression for the constraint and use that to
+    // find if the expression is bounded from above or below and if it
+    // is, find the maximum and minimum values.
+    Linear_Expression le;
+    le.set_space_dimension(c.space_dimension());
+    le.linear_combine(c.expr, Coefficient_one(), Coefficient_one(),
+                      1, c_space_dim + 1);
+
+    PPL_DIRTY_TEMP(Coefficient, max_numer);
+    PPL_DIRTY_TEMP(Coefficient, max_denom);
+    bool max_included;
+    PPL_DIRTY_TEMP(Coefficient, min_numer);
+    PPL_DIRTY_TEMP(Coefficient, min_denom);
+    bool min_included;
+    bool bounded_above = maximize(le, max_numer, max_denom, max_included);
+    bool bounded_below = minimize(le, min_numer, min_denom, min_included);
+    if (!bounded_above) {
+      if (!bounded_below)
+        return Poly_Con_Relation::strictly_intersects();
+      min_numer += c.inhomogeneous_term() * min_denom;
+      switch (sgn(min_numer)) {
+      case 1:
+        if (c.is_equality())
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_included();
+      case 0:
+        if (c.is_strict_inequality() || c.is_equality())
+          return Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::is_included();
+      case -1:
+        return Poly_Con_Relation::strictly_intersects();
+      }
+    }
+    if (!bounded_below) {
+      max_numer += c.inhomogeneous_term() * max_denom;
+      switch (sgn(max_numer)) {
+      case 1:
+        return Poly_Con_Relation::strictly_intersects();
+      case 0:
+        if (c.is_strict_inequality())
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      }
+    }
+    else {
+      max_numer += c.inhomogeneous_term() * max_denom;
+      min_numer += c.inhomogeneous_term() * min_denom;
+      switch (sgn(max_numer)) {
+      case 1:
+        switch (sgn(min_numer)) {
+        case 1:
+          if (c.is_equality())
+            return Poly_Con_Relation::is_disjoint();
+          return Poly_Con_Relation::is_included();
+        case 0:
+          if (c.is_equality())
+            return Poly_Con_Relation::strictly_intersects();
+          if (c.is_strict_inequality())
+            return Poly_Con_Relation::strictly_intersects();
+          return Poly_Con_Relation::is_included();
+        case -1:
+          return Poly_Con_Relation::strictly_intersects();
+        }
+        PPL_UNREACHABLE;
+        break;
+      case 0:
+        if (min_numer == 0) {
+          if (c.is_strict_inequality())
+            return Poly_Con_Relation::is_disjoint()
+              && Poly_Con_Relation::saturates();
+          return Poly_Con_Relation::is_included()
+            && Poly_Con_Relation::saturates();
+        }
+        if (c.is_strict_inequality())
+          return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::strictly_intersects();
+      case -1:
+        return Poly_Con_Relation::is_disjoint();
+      }
+    }
+  }
+
+  if (num_vars == 0) {
+    // Dealing with a trivial constraint.
+    switch (sgn(c.inhomogeneous_term())) {
+    case -1:
+      return Poly_Con_Relation::is_disjoint();
+    case 0:
+      if (c.is_strict_inequality())
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_disjoint();
+      else
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_included();
+    case 1:
+      if (c.is_equality())
+        return Poly_Con_Relation::is_disjoint();
+      else
+        return Poly_Con_Relation::is_included();
+    }
+  }
+
+  // Select the cell to be checked for the "<=" part of constraint.
+  typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
+  typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
+  const N& m_i_j = m_i[j];
+  // Set `coeff' to the absolute value of itself.
+  if (coeff < 0)
+    neg_assign(coeff);
+
+  // Select the cell to be checked for the ">=" part of constraint.
+  // Select the right row of the cell.
+  if (i % 2 == 0)
+    ++i_iter;
+  else
+    --i_iter;
+  typename OR_Matrix<N>::const_row_reference_type m_ci = *i_iter;
+  using namespace Implementation::Octagonal_Shapes;
+  const N& m_ci_cj = m_ci[coherent_index(j)];
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  // The following variables of mpq_class type are used to be precise
+  // when the octagon is defined by integer constraints.
+  PPL_DIRTY_TEMP(mpq_class, q_x);
+  PPL_DIRTY_TEMP(mpq_class, q_y);
+  PPL_DIRTY_TEMP(mpq_class, d);
+  PPL_DIRTY_TEMP(mpq_class, d1);
+  PPL_DIRTY_TEMP(mpq_class, c_denom);
+  PPL_DIRTY_TEMP(mpq_class, q_denom);
+  assign_r(c_denom, coeff, ROUND_NOT_NEEDED);
+  assign_r(d, c_term, ROUND_NOT_NEEDED);
+  neg_assign_r(d1, d, ROUND_NOT_NEEDED);
+  div_assign_r(d, d, c_denom, ROUND_NOT_NEEDED);
+  div_assign_r(d1, d1, c_denom, ROUND_NOT_NEEDED);
+
+  if (is_plus_infinity(m_i_j)) {
+    if (!is_plus_infinity(m_ci_cj)) {
+      // `*this' is in the following form:
+      // `-m_ci_cj <= v - u'.
+      // In this case `*this' is disjoint from `c' if
+      // `-m_ci_cj > d' (`-m_ci_cj >= d' if c is a strict inequality),
+      // i.e., if `m_ci_cj < d1' (`m_ci_cj <= d1'
+      // if c is a strict inequality).
+      numer_denom(m_ci_cj, numer, denom);
+      assign_r(q_denom, denom, ROUND_NOT_NEEDED);
+      assign_r(q_y, numer, ROUND_NOT_NEEDED);
+      div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
+      if (q_y < d1)
+        return Poly_Con_Relation::is_disjoint();
+      if (q_y == d1 && c.is_strict_inequality())
+        return Poly_Con_Relation::is_disjoint();
+    }
+
+    // In all other cases `*this' intersects `c'.
+    return Poly_Con_Relation::strictly_intersects();
+  }
+
+  // Here `m_i_j' is not plus-infinity.
+  numer_denom(m_i_j, numer, denom);
+  assign_r(q_denom, denom, ROUND_NOT_NEEDED);
+  assign_r(q_x, numer, ROUND_NOT_NEEDED);
+  div_assign_r(q_x, q_x, q_denom, ROUND_NOT_NEEDED);
+
+  if (!is_plus_infinity(m_ci_cj)) {
+    numer_denom(m_ci_cj, numer, denom);
+    assign_r(q_denom, denom, ROUND_NOT_NEEDED);
+    assign_r(q_y, numer, ROUND_NOT_NEEDED);
+    div_assign_r(q_y, q_y, q_denom, ROUND_NOT_NEEDED);
+    if (q_x == d && q_y == d1) {
+      if (c.is_strict_inequality())
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_disjoint();
+      else
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_included();
+    }
+    // `*this' is disjoint from `c' when
+    // `m_ci_cj < d1' (`m_ci_cj <= d1' if `c' is a strict inequality).
+    if (q_y < d1)
+      return Poly_Con_Relation::is_disjoint();
+    if (q_y == d1 && c.is_strict_inequality())
+      return Poly_Con_Relation::is_disjoint();
+  }
+
+  // Here `m_ci_cj' can be also plus-infinity.
+  // If `c' is an equality, `*this' is disjoint from `c' if
+  // `m_i_j < d'.
+  if (d > q_x) {
+    if (c.is_equality())
+      return Poly_Con_Relation::is_disjoint();
+    else
+      return Poly_Con_Relation::is_included();
+  }
+
+  if (d == q_x && c.is_nonstrict_inequality())
+    return Poly_Con_Relation::is_included();
+
+  // In all other cases `*this' intersects `c'.
+  return Poly_Con_Relation::strictly_intersects();
+}
+
+template <typename T>
+Poly_Gen_Relation
+Octagonal_Shape<T>::relation_with(const Generator& g) const {
+  const dimension_type g_space_dim = g.space_dimension();
+
+  // Dimension-compatibility check.
+  if (space_dim < g_space_dim)
+    throw_dimension_incompatible("relation_with(g)", g);
+
+  // The closure needs to make explicit the implicit constraints and if the
+  // octagon is empty.
+  strong_closure_assign();
+
+  // The empty octagon cannot subsume a generator.
+  if (marked_empty())
+    return Poly_Gen_Relation::nothing();
+
+  // A universe octagon in a zero-dimensional space subsumes
+  // all the generators of a zero-dimensional space.
+  if (space_dim == 0)
+    return Poly_Gen_Relation::subsumes();
+
+  const bool is_line = g.is_line();
+  const bool is_line_or_ray = g.is_line_or_ray();
+
+  // The relation between the octagon and the given generator is obtained
+  // checking if the generator satisfies all the constraints in the octagon.
+  // To check if the generator satisfies all the constraints it's enough
+  // studying the sign of the scalar product between the generator and
+  // all the constraints in the octagon.
+
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(denom);
+  PPL_DIRTY_TEMP_COEFFICIENT(product);
+
+  // We find in `*this' all the constraints.
+  for (row_iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
+    dimension_type i = i_iter.index();
+    row_reference m_i = *i_iter;
+    row_reference m_ii = *(i_iter + 1);
+    const N& m_i_ii = m_i[i + 1];
+    const N& m_ii_i = m_ii[i];
+    // We have the unary constraints.
+    const Variable x(i/2);
+    const Coefficient& g_coeff_x
+      = (x.space_dimension() > g_space_dim)
+      ? Coefficient_zero()
+      : g.coefficient(x);
+    if (is_additive_inverse(m_i_ii, m_ii_i)) {
+      // The constraint has form ax = b.
+      // To satisfy the constraint it is necessary that the scalar product
+      // is not zero. The scalar product has the form
+      // 'denom * g_coeff_x - numer * g.divisor()'.
+      numer_denom(m_ii_i, numer, denom);
+      denom *= 2;
+      product = denom * g_coeff_x;
+      // Note that if the generator `g' is a line or a ray,
+      // its divisor is zero.
+      if (!is_line_or_ray) {
+        neg_assign(numer);
+        add_mul_assign(product, numer, g.divisor());
+      }
+      if (product != 0)
+        return Poly_Gen_Relation::nothing();
+    }
+    // We have 0, 1 or 2 inequality constraints.
+    else {
+      if (!is_plus_infinity(m_i_ii)) {
+        // The constraint has form -ax <= b.
+        // If the generator is a line it's necessary to check if
+        // the scalar product is not zero, if it is positive otherwise.
+        numer_denom(m_i_ii, numer, denom);
+        denom *= -2;
+        product = denom * g_coeff_x;
+        // Note that if the generator `g' is a line or a ray,
+        // its divisor is zero.
+        if (!is_line_or_ray) {
+          neg_assign(numer);
+          add_mul_assign(product, numer, g.divisor());
+        }
+        if (is_line && product != 0)
+          return Poly_Gen_Relation::nothing();
+        else
+          // If the generator is not a line it's necessary to check
+          // that the scalar product sign is not positive and the scalar
+          // product has the form
+          // '-denom * g.coeff_x - numer * g.divisor()'.
+          if (product > 0)
+            return Poly_Gen_Relation::nothing();
+      }
+      if (!is_plus_infinity(m_ii_i)) {
+        // The constraint has form ax <= b.
+        numer_denom(m_ii_i, numer, denom);
+        denom *= 2;
+        product = denom * g_coeff_x;
+         // Note that if the generator `g' is a line or a ray,
+        // its divisor is zero.
+        if (!is_line_or_ray) {
+          neg_assign(numer);
+          add_mul_assign(product, numer , g.divisor());
+        }
+        if (is_line && product != 0)
+          return Poly_Gen_Relation::nothing();
+        else
+          // If the generator is not a line it's necessary to check
+          // that the scalar product sign is not positive and the scalar
+          // product has the form
+          // 'denom * g_coeff_x - numer * g.divisor()'.
+          if (product > 0)
+            return Poly_Gen_Relation::nothing();
+      }
+    }
+  }
+
+  // We have the binary constraints.
+  for (row_iterator i_iter = m_begin ; i_iter != m_end; i_iter += 2) {
+    dimension_type i = i_iter.index();
+    row_reference m_i = *i_iter;
+    row_reference m_ii = *(i_iter + 1);
+    for (dimension_type j = 0; j < i; j += 2) {
+      const N& m_i_j = m_i[j];
+      const N& m_ii_jj = m_ii[j + 1];
+      const N& m_ii_j = m_ii[j];
+      const N& m_i_jj = m_i[j + 1];
+      const Variable x(j/2);
+      const Variable y(i/2);
+      const Coefficient& g_coeff_x
+        = (x.space_dimension() > g_space_dim)
+        ? Coefficient_zero()
+        : g.coefficient(x);
+      const Coefficient& g_coeff_y
+        = (y.space_dimension() > g_space_dim)
+        ? Coefficient_zero()
+        : g.coefficient(y);
+
+      const bool difference_is_equality = is_additive_inverse(m_ii_jj, m_i_j);
+      if (difference_is_equality) {
+        // The constraint has form a*x - a*y = b.
+        // The scalar product has the form
+        // 'denom * coeff_x - denom * coeff_y - numer * g.divisor()'.
+        // To satisfy the constraint it's necessary that the scalar product
+        // is not zero.
+        numer_denom(m_i_j, numer, denom);
+        product = denom * g_coeff_x;
+        neg_assign(denom);
+        add_mul_assign(product, denom, g_coeff_y);
+        // Note that if the generator `g' is a line or a ray,
+        // its divisor is zero.
+        if (!is_line_or_ray) {
+          neg_assign(numer);
+          add_mul_assign(product, numer, g.divisor());
+        }
+        if (product != 0)
+          return Poly_Gen_Relation::nothing();
+      }
+      else {
+        if (!is_plus_infinity(m_i_j)) {
+          // The constraint has form a*x - a*y <= b.
+          // The scalar product has the form
+          // 'denom * coeff_x - denom * coeff_y - numer * g.divisor()'.
+          // If the generator is not a line it's necessary to check
+          // that the scalar product sign is not positive.
+          numer_denom(m_i_j, numer, denom);
+          product = denom * g_coeff_x;
+          neg_assign(denom);
+          add_mul_assign(product, denom, g_coeff_y);
+          // Note that if the generator `g' is a line or a ray,
+          // its divisor is zero.
+          if (!is_line_or_ray) {
+            neg_assign(numer);
+            add_mul_assign(product, numer, g.divisor());
+          }
+          if (is_line && product != 0)
+            return Poly_Gen_Relation::nothing();
+          else if (product > 0)
+            return Poly_Gen_Relation::nothing();
+        }
+        if (!is_plus_infinity(m_ii_jj)) {
+          // The constraint has form -a*x + a*y <= b.
+          // The scalar product has the form
+          // '-denom * coeff_x + denom * coeff_y - numer * g.divisor()'.
+          // If the generator is not a line it's necessary to check
+          // that the scalar product sign is not positive.
+          numer_denom(m_ii_jj, numer, denom);
+          product = denom * g_coeff_y;
+          neg_assign(denom);
+          add_mul_assign(product, denom, g_coeff_x);
+          // Note that if the generator `g' is a line or a ray,
+          // its divisor is zero.
+          if (!is_line_or_ray) {
+            neg_assign(numer);
+            add_mul_assign(product, numer, g.divisor());
+          }
+          if (is_line && product != 0)
+            return Poly_Gen_Relation::nothing();
+          else if (product > 0)
+            return Poly_Gen_Relation::nothing();
+        }
+      }
+
+      const bool sum_is_equality = is_additive_inverse(m_i_jj, m_ii_j);
+      if (sum_is_equality) {
+        // The constraint has form a*x + a*y = b.
+        // The scalar product has the form
+        // 'denom * coeff_x + denom * coeff_y - numer * g.divisor()'.
+        // To satisfy the constraint it's necessary that the scalar product
+        // is not zero.
+        numer_denom(m_ii_j, numer, denom);
+        product = denom * g_coeff_x;
+        add_mul_assign(product, denom, g_coeff_y);
+        // Note that if the generator `g' is a line or a ray,
+        // its divisor is zero.
+        if (!is_line_or_ray) {
+          neg_assign(numer);
+          add_mul_assign(product, numer, g.divisor());
+        }
+        if (product != 0)
+          return Poly_Gen_Relation::nothing();
+      }
+      else {
+        if (!is_plus_infinity(m_i_jj)) {
+          // The constraint has form -a*x - a*y <= b.
+          // The scalar product has the form
+          // '-denom * coeff_x - denom * coeff_y - numer * g.divisor()'.
+          // If the generator is not a line it's necessary to check
+          // that the scalar product sign is not positive.
+          numer_denom(m_i_jj, numer, denom);
+          neg_assign(denom);
+          product = denom * g_coeff_x;
+          add_mul_assign(product, denom, g_coeff_y);
+          // Note that if the generator `g' is a line or a ray,
+          // its divisor is zero.
+          if (!is_line_or_ray) {
+            neg_assign(numer);
+            add_mul_assign(product, numer, g.divisor());
+          }
+          if (is_line && product != 0)
+            return Poly_Gen_Relation::nothing();
+          else if (product > 0)
+            return Poly_Gen_Relation::nothing();
+        }
+        if (!is_plus_infinity(m_ii_j)) {
+          // The constraint has form a*x + a*y <= b.
+          // The scalar product has the form
+          // 'denom * coeff_x + denom * coeff_y - numer * g.divisor()'.
+          // If the generator is not a line it's necessary to check
+          // that the scalar product sign is not positive.
+          numer_denom(m_ii_j, numer, denom);
+          product = denom * g_coeff_x;
+          add_mul_assign(product, denom, g_coeff_y);
+          // Note that if the generator `g' is a line or a ray,
+          // its divisor is zero.
+          if (!is_line_or_ray) {
+            neg_assign(numer);
+            add_mul_assign(product, numer, g.divisor());
+          }
+          if (is_line && product != 0)
+            return Poly_Gen_Relation::nothing();
+          else if (product > 0)
+            return Poly_Gen_Relation::nothing();
+        }
+      }
+    }
+  }
+  // If this point is reached the constraint 'g' satisfies
+  // all the constraints in the octagon.
+  return Poly_Gen_Relation::subsumes();
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::strong_closure_assign() const {
+  // Do something only if necessary (zero-dim implies strong closure).
+  if (marked_empty() || marked_strongly_closed() || space_dim == 0)
+    return;
+
+  // Even though the octagon will not change, its internal representation
+  // is going to be modified by the closure algorithm.
+  Octagonal_Shape& x = const_cast<Octagonal_Shape<T>&>(*this);
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+
+  const dimension_type n_rows = x.matrix.num_rows();
+  const row_iterator m_begin = x.matrix.row_begin();
+  const row_iterator m_end = x.matrix.row_end();
+
+  // Fill the main diagonal with zeros.
+  for (row_iterator i = m_begin; i != m_end; ++i) {
+    PPL_ASSERT(is_plus_infinity((*i)[i.index()]));
+    assign_r((*i)[i.index()], 0, ROUND_NOT_NEEDED);
+  }
+
+  // This algorithm is given by two steps: the first one is a simple
+  // adaptation of the `shortest-path closure' using the Floyd-Warshall
+  // algorithm; the second one is the `strong-coherence' algorithm.
+  // It is important to note that after the strong-coherence,
+  // the octagon is still shortest-path closed and hence, strongly closed.
+
+  // Recall that, given an index `h', we indicate with `ch' the coherent
+  // index, i.e., the index such that:
+  //   ch = h + 1, if h is an even number;
+  //   ch = h - 1, if h is an odd number.
+
+  typename OR_Matrix<N>::element_iterator iter_ij;
+  std::vector<N> vec_k(n_rows);
+  std::vector<N> vec_ck(n_rows);
+  PPL_DIRTY_TEMP(N, sum1);
+  PPL_DIRTY_TEMP(N, sum2);
+  row_reference x_k;
+  row_reference x_ck;
+  row_reference x_i;
+  row_reference x_ci;
+
+  // Since the index `j' of the inner loop will go from 0 up to `i',
+  // the three nested loops have to be executed twice.
+  for (int twice = 0; twice < 2; ++twice) {
+
+    row_iterator x_k_iter = m_begin;
+    row_iterator x_i_iter = m_begin;
+    for (dimension_type k = 0; k < n_rows; k += 2) {
+      const dimension_type ck = k + 1;
+      // Re-initialize the element iterator.
+      iter_ij = x.matrix.element_begin();
+      // Compute the row references `x_k' and `x_ck'.
+      x_k  = *x_k_iter;
+      ++x_k_iter;
+      x_ck = *x_k_iter;
+      ++x_k_iter;
+
+      for (dimension_type i = 0; i <= k; i += 2) {
+        const dimension_type ci = i + 1;
+        // Storing x_k_i == x_ci_ck.
+        vec_k[i] = x_k[i];
+        // Storing x_k_ci == x_i_ck.
+        vec_k[ci] = x_k[ci];
+        // Storing x_ck_i == x_ci_k.
+        vec_ck[i] = x_ck[i];
+        // Storing x_ck_ci == x_i_k.
+        vec_ck[ci] = x_ck[ci];
+      }
+      x_i_iter = x_k_iter;
+      for (dimension_type i = k + 2; i < n_rows; i += 2) {
+        const dimension_type ci = i + 1;
+        x_i = *x_i_iter;
+        ++x_i_iter;
+        x_ci = *x_i_iter;
+        ++x_i_iter;
+        // Storing x_k_i == x_ci_ck.
+        vec_k[i] = x_ci[ck];
+        // Storing x_k_ci == x_i_ck.
+        vec_k[ci] = x_i[ck];
+        // Storing x_ck_i == x_ci_k.
+        vec_ck[i] = x_ci[k];
+        // Storing x_ck_ci == x_i_k.
+        vec_ck[ci] = x_i[k];
+      }
+
+      for (dimension_type i = 0; i < n_rows; ++i) {
+        using namespace Implementation::Octagonal_Shapes;
+        const dimension_type ci = coherent_index(i);
+        const N& vec_k_ci = vec_k[ci];
+        const N& vec_ck_ci = vec_ck[ci];
+        // Unfolding two iterations on `j': this ensures that
+        // the loop exit condition `j <= i' is OK.
+        for (dimension_type j = 0; j <= i; ) {
+          // First iteration: compute
+          //
+          // <CODE>
+          //   sum1 = x_i_k + x_k_j == x_ck_ci + x_k_j;
+          //   sum2 = x_i_ck + x_ck_j == x_k_ci + x_ck_j;
+          // </CODE>
+          add_assign_r(sum1, vec_ck_ci, vec_k[j], ROUND_UP);
+          add_assign_r(sum2, vec_k_ci, vec_ck[j], ROUND_UP);
+          min_assign(sum1, sum2);
+          min_assign(*iter_ij, sum1);
+          // Exiting the first iteration: loop index control.
+          ++j;
+          ++iter_ij;
+          // Second iteration: ditto.
+          add_assign_r(sum1, vec_ck_ci, vec_k[j], ROUND_UP);
+          add_assign_r(sum2, vec_k_ci, vec_ck[j], ROUND_UP);
+          min_assign(sum1, sum2);
+          min_assign(*iter_ij, sum1);
+          // Exiting the second iteration: loop index control.
+          ++j;
+          ++iter_ij;
+        }
+      }
+    }
+  }
+
+  // Check for emptiness: the octagon is empty if and only if there is a
+  // negative value in the main diagonal.
+  for (row_iterator i = m_begin; i != m_end; ++i) {
+    N& x_i_i = (*i)[i.index()];
+    if (sgn(x_i_i) < 0) {
+      x.set_empty();
+      return;
+    }
+    else {
+      PPL_ASSERT(sgn(x_i_i) == 0);
+      // Restore PLUS_INFINITY on the main diagonal.
+      assign_r(x_i_i, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+
+  // Step 2: we enforce the strong coherence.
+  x.strong_coherence_assign();
+  // The octagon is not empty and it is now strongly closed.
+  x.set_strongly_closed();
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::strong_coherence_assign() {
+  // The strong-coherence is: for every indexes i and j
+  // m_i_j <= (m_i_ci + m_cj_j)/2
+  // where ci = i + 1, if i is even number or
+  //       ci = i - 1, if i is odd.
+  // Ditto for cj.
+  PPL_DIRTY_TEMP(N, semi_sum);
+  for (typename OR_Matrix<N>::row_iterator i_iter = matrix.row_begin(),
+         i_end = matrix.row_end(); i_iter != i_end; ++i_iter) {
+    typename OR_Matrix<N>::row_reference_type x_i = *i_iter;
+    const dimension_type i = i_iter.index();
+    using namespace Implementation::Octagonal_Shapes;
+    const N& x_i_ci = x_i[coherent_index(i)];
+    // Avoid to do unnecessary sums.
+    if (!is_plus_infinity(x_i_ci))
+      for (dimension_type j = 0, rs_i = i_iter.row_size(); j < rs_i; ++j)
+        if (i != j) {
+          const N& x_cj_j = matrix[coherent_index(j)][j];
+          if (!is_plus_infinity(x_cj_j)) {
+            add_assign_r(semi_sum, x_i_ci, x_cj_j, ROUND_UP);
+            div_2exp_assign_r(semi_sum, semi_sum, 1, ROUND_UP);
+            min_assign(x_i[j], semi_sum);
+          }
+        }
+  }
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::tight_coherence_would_make_empty() const {
+  PPL_ASSERT(std::numeric_limits<N>::is_integer);
+  PPL_ASSERT(marked_strongly_closed());
+  const dimension_type space_dim = space_dimension();
+  for (dimension_type i = 0; i < 2*space_dim; i += 2) {
+    const dimension_type ci = i + 1;
+    const N& mat_i_ci = matrix[i][ci];
+    if (!is_plus_infinity(mat_i_ci)
+        // Check for oddness of `mat_i_ci'.
+        && !is_even(mat_i_ci)
+        // Check for zero-equivalence of `i' and `ci'.
+        && is_additive_inverse(mat_i_ci, matrix[ci][i]))
+      return true;
+  }
+  return false;
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::tight_closure_assign() {
+  PPL_COMPILE_TIME_CHECK(std::numeric_limits<T>::is_integer,
+                         "Octagonal_Shape<T>::tight_closure_assign():"
+                         " T in not an integer datatype.");
+  // FIXME: this is just an executable specification.
+  // (The following call could be replaced by shortest-path closure.)
+  strong_closure_assign();
+  if (marked_empty())
+    return;
+  if (tight_coherence_would_make_empty())
+    set_empty();
+  else {
+    // Tighten the unary constraints.
+    PPL_DIRTY_TEMP(N, temp_one);
+    assign_r(temp_one, 1, ROUND_NOT_NEEDED);
+    const dimension_type space_dim = space_dimension();
+    for (dimension_type i = 0; i < 2*space_dim; i += 2) {
+      const dimension_type ci = i + 1;
+      N& mat_i_ci = matrix[i][ci];
+      if (!is_plus_infinity(mat_i_ci) && !is_even(mat_i_ci))
+        sub_assign_r(mat_i_ci, mat_i_ci, temp_one, ROUND_UP);
+      N& mat_ci_i = matrix[ci][i];
+      if (!is_plus_infinity(mat_ci_i) && !is_even(mat_ci_i))
+        sub_assign_r(mat_ci_i, mat_ci_i, temp_one, ROUND_UP);
+    }
+    // Propagate tightened unary constraints.
+    strong_coherence_assign();
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::incremental_strong_closure_assign(const Variable var) const {
+  // `var' should be one of the dimensions of the octagon.
+  if (var.id() >= space_dim)
+    throw_dimension_incompatible("incremental_strong_closure_assign(v)",
+                                 var.id());
+
+  // Do something only if necessary.
+  if (marked_empty() || marked_strongly_closed())
+    return;
+
+  Octagonal_Shape& x = const_cast<Octagonal_Shape<T>&>(*this);
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+
+  const row_iterator m_begin = x.matrix.row_begin();
+  const row_iterator m_end = x.matrix.row_end();
+
+  // Fill the main diagonal with zeros.
+  for (row_iterator i = m_begin; i != m_end; ++i) {
+    PPL_ASSERT(is_plus_infinity((*i)[i.index()]));
+    assign_r((*i)[i.index()], 0, ROUND_NOT_NEEDED);
+  }
+
+  // Using the incremental Floyd-Warshall algorithm.
+  // Step 1: Improve all constraints on variable `var'.
+  const dimension_type v = 2*var.id();
+  const dimension_type cv = v + 1;
+  row_iterator v_iter = m_begin + v;
+  row_iterator cv_iter = v_iter + 1;
+  row_reference x_v = *v_iter;
+  row_reference x_cv = *cv_iter;
+  const dimension_type rs_v = v_iter.row_size();
+  const dimension_type n_rows = x.matrix.num_rows();
+  PPL_DIRTY_TEMP(N, sum);
+  using namespace Implementation::Octagonal_Shapes;
+  for (row_iterator k_iter = m_begin; k_iter != m_end; ++k_iter) {
+    const dimension_type k = k_iter.index();
+    const dimension_type ck = coherent_index(k);
+    const dimension_type rs_k = k_iter.row_size();
+    row_reference x_k = *k_iter;
+    row_reference x_ck = (k % 2 != 0) ? *(k_iter-1) : *(k_iter + 1);
+
+    for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
+      const dimension_type i = i_iter.index();
+      const dimension_type ci = coherent_index(i);
+      const dimension_type rs_i = i_iter.row_size();
+      row_reference x_i = *i_iter;
+      row_reference x_ci = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
+
+      const N& x_i_k = (k < rs_i) ? x_i[k] : x_ck[ci];
+      if (!is_plus_infinity(x_i_k)) {
+        const N& x_k_v = (v < rs_k) ? x_k[v] : x_cv[ck];
+        if (!is_plus_infinity(x_k_v)) {
+          add_assign_r(sum, x_i_k, x_k_v, ROUND_UP);
+          N& x_i_v = (v < rs_i) ? x_i[v] : x_cv[ci];
+          min_assign(x_i_v, sum);
+        }
+        const N& x_k_cv = (cv < rs_k) ? x_k[cv] : x_v[ck];
+        if (!is_plus_infinity(x_k_cv)) {
+          add_assign_r(sum, x_i_k, x_k_cv, ROUND_UP);
+          N& x_i_cv = (cv < rs_i) ? x_i[cv] : x_v[ci];
+          min_assign(x_i_cv, sum);
+        }
+      }
+      const N& x_k_i = (i < rs_k) ? x_k[i] : x_ci[ck];
+      if (!is_plus_infinity(x_k_i)) {
+        const N& x_v_k = (k < rs_v) ? x_v[k] : x_ck[cv];
+        if (!is_plus_infinity(x_v_k)) {
+          N& x_v_i = (i < rs_v) ? x_v[i] : x_ci[cv];
+          add_assign_r(sum, x_v_k, x_k_i, ROUND_UP);
+          min_assign(x_v_i, sum);
+        }
+        const N& x_cv_k = (k < rs_v) ? x_cv[k] : x_ck[v];
+        if (!is_plus_infinity(x_cv_k)) {
+          N& x_cv_i = (i < rs_v) ? x_cv[i] : x_ci[v];
+          add_assign_r(sum, x_cv_k, x_k_i, ROUND_UP);
+          min_assign(x_cv_i, sum);
+        }
+      }
+
+    }
+  }
+
+  // Step 2: improve the other bounds by using the precise bounds
+  // for the constraints on `var'.
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
+    const dimension_type i = i_iter.index();
+    const dimension_type ci = coherent_index(i);
+    const dimension_type rs_i = i_iter.row_size();
+    row_reference x_i = *i_iter;
+    const N& x_i_v = (v < rs_i) ? x_i[v] : x_cv[ci];
+    // TODO: see if it is possible to optimize this inner loop
+    // by splitting it into several parts, so as to avoid
+    // conditional expressions.
+    for (dimension_type j = 0; j < n_rows; ++j) {
+      const dimension_type cj = coherent_index(j);
+      row_reference x_cj = *(m_begin + cj);
+      N& x_i_j = (j < rs_i) ? x_i[j] : x_cj[ci];
+      if (!is_plus_infinity(x_i_v)) {
+        const N& x_v_j = (j < rs_v) ? x_v[j] : x_cj[cv];
+        if (!is_plus_infinity(x_v_j)) {
+          add_assign_r(sum, x_i_v, x_v_j, ROUND_UP);
+          min_assign(x_i_j, sum);
+        }
+      }
+      const N& x_i_cv = (cv < rs_i) ? x_i[cv] : x_v[ci];
+      if (!is_plus_infinity(x_i_cv)) {
+        const N& x_cv_j = (j < rs_v) ? x_cv[j] : x_cj[v];
+        if (!is_plus_infinity(x_cv_j)) {
+          add_assign_r(sum, x_i_cv, x_cv_j, ROUND_UP);
+          min_assign(x_i_j, sum);
+        }
+      }
+    }
+  }
+
+  // Check for emptiness: the octagon is empty if and only if there is a
+  // negative value on the main diagonal.
+  for (row_iterator i = m_begin; i != m_end; ++i) {
+    N& x_i_i = (*i)[i.index()];
+    if (sgn(x_i_i) < 0) {
+      x.set_empty();
+      return;
+    }
+    else {
+      // Restore PLUS_INFINITY on the main diagonal.
+      PPL_ASSERT(sgn(x_i_i) == 0);
+      assign_r(x_i_i, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+
+  // Step 3: we enforce the strong coherence.
+  x.strong_coherence_assign();
+  // The octagon is not empty and it is now strongly closed.
+  x.set_strongly_closed();
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::compute_successors(std::vector<dimension_type>& successor) const {
+  PPL_ASSERT(!marked_empty() && marked_strongly_closed());
+  PPL_ASSERT(successor.size() == 0);
+  // Variables are ordered according to their index.
+  // The vector `successor' is used to indicate which variable
+  // immediately follows a given one in the corresponding equivalence class.
+  const dimension_type successor_size = matrix.num_rows();
+  // Initially, each variable is successor of its own zero-equivalence class.
+  successor.reserve(successor_size);
+  for (dimension_type i = 0; i < successor_size; ++i)
+    successor.push_back(i);
+  // Now compute actual successors.
+  for (dimension_type i = successor_size; i-- > 0; )  {
+    typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin() + i;
+    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
+    typename OR_Matrix<N>::const_row_reference_type m_ci
+      = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
+    for (dimension_type j = 0; j < i; ++j) {
+      // FIXME: what is the following, commented-out for?
+    //for (dimension_type j = i; j-- > 0; ) {
+      using namespace Implementation::Octagonal_Shapes;
+      dimension_type cj = coherent_index(j);
+      if (is_additive_inverse(m_ci[cj], m_i[j]))
+        // Choose as successor the variable having the greatest index.
+        successor[j] = i;
+    }
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::compute_leaders(std::vector<dimension_type>& leaders) const {
+  PPL_ASSERT(!marked_empty() && marked_strongly_closed());
+  PPL_ASSERT(leaders.size() == 0);
+  // Variables are ordered according to their index.
+  // The vector `leaders' is used to indicate the smallest variable
+  // that belongs to the corresponding equivalence class.
+  const dimension_type leader_size = matrix.num_rows();
+  // Initially, each variable is leader of its own zero-equivalence class.
+  leaders.reserve(leader_size);
+  for (dimension_type i = 0; i < leader_size; ++i)
+    leaders.push_back(i);
+  // Now compute actual leaders.
+  for (typename OR_Matrix<N>::const_row_iterator i_iter = matrix.row_begin(),
+         matrix_row_end = matrix.row_end();
+       i_iter != matrix_row_end; ++i_iter) {
+    typename OR_Matrix<N>::const_row_reference_type m_i = *i_iter;
+    dimension_type i = i_iter.index();
+    typename OR_Matrix<N>::const_row_reference_type m_ci
+      = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
+    for (dimension_type j = 0; j < i; ++j) {
+      using namespace Implementation::Octagonal_Shapes;
+      dimension_type cj = coherent_index(j);
+      if (is_additive_inverse(m_ci[cj], m_i[j]))
+        // Choose as leader the variable having the smaller index.
+        leaders[i] = leaders[j];
+    }
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::compute_leaders(std::vector<dimension_type>& successor,
+                  std::vector<dimension_type>& no_sing_leaders,
+                  bool& exist_sing_class,
+                  dimension_type& sing_leader) const {
+  PPL_ASSERT(!marked_empty() && marked_strongly_closed());
+  PPL_ASSERT(no_sing_leaders.size() == 0);
+  dimension_type successor_size = successor.size();
+  std::deque<bool> dealt_with(successor_size, false);
+  for (dimension_type i = 0; i < successor_size; ++i) {
+    dimension_type next_i = successor[i];
+    if (!dealt_with[i]) {
+      // The index is a leader.
+      // Now check if it is a leader of a singular class or not.
+      using namespace Implementation::Octagonal_Shapes;
+      if (next_i == coherent_index(i)) {
+        exist_sing_class = true;
+        sing_leader = i;
+      }
+      else
+        no_sing_leaders.push_back(i);
+    }
+    // The following index is not a leader.
+    dealt_with[next_i] = true;
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::strong_reduction_assign() const {
+  // Zero-dimensional octagonal shapes are necessarily reduced.
+  if (space_dim == 0)
+    return;
+  strong_closure_assign();
+  // If `*this' is empty, then there is nothing to reduce.
+  if (marked_empty())
+    return;
+
+  // Detect non-redundant constraints.
+  std::vector<Bit_Row> non_red;
+  non_redundant_matrix_entries(non_red);
+
+  // Throw away redundant constraints.
+  Octagonal_Shape<T>& x = const_cast<Octagonal_Shape<T>&>(*this);
+#ifndef NDEBUG
+  const Octagonal_Shape x_copy_before(x);
+#endif
+  typename OR_Matrix<N>::element_iterator x_i = x.matrix.element_begin();
+  for (dimension_type i = 0; i < 2 * space_dim; ++i) {
+    const Bit_Row& non_red_i = non_red[i];
+    for (dimension_type j = 0,
+           j_end = OR_Matrix<N>::row_size(i); j < j_end; ++j, ++x_i) {
+      if (!non_red_i[j])
+        assign_r(*x_i, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+  x.reset_strongly_closed();
+#ifndef NDEBUG
+  const Octagonal_Shape x_copy_after(x);
+  PPL_ASSERT(x_copy_before == x_copy_after);
+  PPL_ASSERT(x.is_strongly_reduced());
+  PPL_ASSERT(x.OK());
+#endif
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::non_redundant_matrix_entries(std::vector<Bit_Row>& non_redundant) const {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(space_dim > 0 && !marked_empty() && marked_strongly_closed());
+  PPL_ASSERT(non_redundant.empty());
+
+  // Initialize `non_redundant' as if it was an OR_Matrix of booleans
+  // (initially set to false).
+  non_redundant.resize(2*space_dim);
+
+  // Step 1: compute zero-equivalence classes.
+  // Variables corresponding to indices `i' and `j' are zero-equivalent
+  // if they lie on a zero-weight loop; since the matrix is strongly
+  // closed, this happens if and only if matrix[i][j] == -matrix[ci][cj].
+  std::vector<dimension_type> no_sing_leaders;
+  dimension_type sing_leader = 0;
+  bool exist_sing_class = false;
+  std::vector<dimension_type> successor;
+  compute_successors(successor);
+  compute_leaders(successor, no_sing_leaders, exist_sing_class, sing_leader);
+  const dimension_type num_no_sing_leaders = no_sing_leaders.size();
+
+
+  // Step 2: flag redundant constraints in `redundancy'.
+  // Go through non-singular leaders first.
+  for (dimension_type li = 0; li < num_no_sing_leaders; ++li) {
+    const dimension_type i = no_sing_leaders[li];
+    using namespace Implementation::Octagonal_Shapes;
+    const dimension_type ci = coherent_index(i);
+    typename OR_Matrix<N>::const_row_reference_type
+      m_i = *(matrix.row_begin() + i);
+    if (i % 2 == 0) {
+      // Each positive equivalence class must have a single 0-cycle
+      // connecting all equivalent variables in increasing order.
+      // Note: by coherence assumption, the variables in the
+      // corresponding negative equivalence class are
+      // automatically connected.
+      if (i != successor[i]) {
+        dimension_type j = i;
+        dimension_type next_j = successor[j];
+        while (j != next_j) {
+          non_redundant[next_j].set(j);
+          j = next_j;
+          next_j = successor[j];
+        }
+        const dimension_type cj = coherent_index(j);
+        non_redundant[cj].set(ci);
+      }
+    }
+
+    dimension_type rs_li = (li % 2 != 0) ? li : (li + 1);
+    // Check if the constraint is redundant.
+    PPL_DIRTY_TEMP(N, tmp);
+    for (dimension_type lj = 0 ; lj <= rs_li; ++lj) {
+      const dimension_type j = no_sing_leaders[lj];
+      const dimension_type cj = coherent_index(j);
+      const N& m_i_j = m_i[j];
+      const N& m_i_ci = m_i[ci];
+      bool to_add = true;
+      // Control if the constraint is redundant by strong-coherence,
+      // that is:
+      // m_i_j >= (m_i_ci + m_cj_j)/2,   where j != ci.
+      if (j != ci) {
+        add_assign_r(tmp, m_i_ci, matrix[cj][j], ROUND_UP);
+        div_2exp_assign_r(tmp, tmp, 1, ROUND_UP);
+        if (m_i_j >= tmp)
+          // The constraint is redundant.
+          continue;
+      }
+      // Control if the constraint is redundant by strong closure, that is
+      // if there is a path from i to j (i = i_0, ... , i_n = j), such that
+      // m_i_j = sum_{k=0}^{n-1} m_{i_k}_{i_(k + 1)}.
+      // Since the octagon is already strongly closed, the above relation
+      // is reduced to three case, in accordance with k, i, j inter-depend:
+      // exit k such that
+      // 1.) m_i_j >= m_i_k   + m_cj_ck,   if k < j < i; or
+      // 2.) m_i_j >= m_i_k   + m_k,_j,    if j < k < i; or
+      // 3.) m_i_j >= m_ck_ci + m_k_j,     if j < i < k.
+      // Note: `i > j'.
+      for (dimension_type lk = 0; lk < num_no_sing_leaders; ++lk) {
+        const dimension_type k = no_sing_leaders[lk];
+        if (k != i && k != j) {
+          dimension_type ck = coherent_index(k);
+          if (k < j)
+            // Case 1.
+            add_assign_r(tmp, m_i[k], matrix[cj][ck], ROUND_UP);
+          else if (k < i)
+            // Case 2.
+            add_assign_r(tmp, m_i[k], matrix[k][j], ROUND_UP);
+          else
+            // Case 3.
+            add_assign_r(tmp, matrix[ck][ci], matrix[k][j], ROUND_UP);
+
+          // Checks if the constraint is redundant.
+          if (m_i_j >= tmp) {
+            to_add = false;
+            break;
+          }
+        }
+      }
+
+      if (to_add)
+        // The constraint is not redundant.
+        non_redundant[i].set(j);
+    }
+  }
+
+  // If there exist a singular equivalence class, then it must have a
+  // single 0-cycle connecting all the positive and negative equivalent
+  // variables.
+  // Note: the singular class is not connected with the other classes.
+  if (exist_sing_class) {
+    non_redundant[sing_leader].set(sing_leader + 1);
+    if (successor[sing_leader + 1] != sing_leader + 1) {
+      dimension_type j = sing_leader;
+      dimension_type next_j = successor[j + 1];
+      while (next_j != j + 1) {
+        non_redundant[next_j].set(j);
+        j = next_j;
+        next_j = successor[j + 1];
+      }
+      non_redundant[j + 1].set(j);
+    }
+    else
+      non_redundant[sing_leader + 1].set(sing_leader);
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::upper_bound_assign(const Octagonal_Shape& y) {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("upper_bound_assign(y)", y);
+
+  // The hull of an octagon `x' with an empty octagon is `x'.
+  y.strong_closure_assign();
+  if (y.marked_empty())
+    return;
+  strong_closure_assign();
+  if (marked_empty()) {
+    *this = y;
+    return;
+  }
+
+  // The oct-hull is obtained by computing maxima.
+  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
+  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
+         matrix_element_end = matrix.element_end();
+       i != matrix_element_end; ++i, ++j)
+    max_assign(*i, *j);
+
+  // The result is still closed.
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::difference_assign(const Octagonal_Shape& y) {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("difference_assign(y)", y);
+
+  Octagonal_Shape& x = *this;
+
+  // Being lazy here is only harmful.
+  // We close.
+  x.strong_closure_assign();
+  // The difference of an empty octagon and of an octagon `p' is empty.
+  if (x.marked_empty())
+    return;
+  // The difference of a octagon `p' and an empty octagon is `p'.
+  if (y.marked_empty())
+    return;
+
+  // If both octagons are zero-dimensional,
+  // then at this point they are necessarily universe octagons,
+  // so that their difference is empty.
+  if (x.space_dim == 0) {
+    x.set_empty();
+    return;
+  }
+
+  // TODO: This is just an executable specification.
+  //       Have to find a more efficient method.
+  if (y.contains(x)) {
+    x.set_empty();
+    return;
+  }
+
+  Octagonal_Shape new_oct(space_dim, EMPTY);
+  // We take a constraint of the octagon y at the time and we
+  // consider its complementary. Then we intersect the union
+  // of these complementary constraints with the octagon x.
+  const Constraint_System& y_cs = y.constraints();
+  for (Constraint_System::const_iterator i = y_cs.begin(),
+         y_cs_end = y_cs.end(); i != y_cs_end; ++i) {
+    const Constraint& c = *i;
+    // If the octagon `x' is included the octagon defined by `c',
+    // then `c' _must_ be skipped, as adding its complement to `x'
+    // would result in the empty octagon, and as we would obtain
+    // a result that is less precise than the difference.
+    if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
+      continue;
+    Octagonal_Shape z = x;
+    const Linear_Expression e(c.expression());
+    z.add_constraint(e <= 0);
+    if (!z.is_empty())
+      new_oct.upper_bound_assign(z);
+    if (c.is_equality()) {
+      z = x;
+      z.add_constraint(e >= 0);
+      if (!z.is_empty())
+        new_oct.upper_bound_assign(z);
+    }
+  }
+  *this = new_oct;
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::simplify_using_context_assign(const Octagonal_Shape& y) {
+  Octagonal_Shape& x = *this;
+  const dimension_type dim = x.space_dimension();
+  // Dimension-compatibility check.
+  if (dim != y.space_dimension())
+    throw_dimension_incompatible("simplify_using_context_assign(y)", y);
+
+  // Filter away the zero-dimensional case.
+  if (dim == 0) {
+    if (y.marked_empty()) {
+      x.set_zero_dim_univ();
+      return false;
+    }
+    else
+      return !x.marked_empty();
+  }
+
+  // Filter away the case where `x' contains `y'
+  // (this subsumes the case when `y' is empty).
+  if (x.contains(y)) {
+    Octagonal_Shape<T> res(dim, UNIVERSE);
+    x.m_swap(res);
+    return false;
+  }
+
+  typedef typename OR_Matrix<N>::row_iterator Row_Iter;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_CIter;
+  typedef typename OR_Matrix<N>::element_iterator Elem_Iter;
+  typedef typename OR_Matrix<N>::const_element_iterator Elem_CIter;
+
+  // Filter away the case where `x' is empty.
+  x.strong_closure_assign();
+  if (x.marked_empty()) {
+    // Search for a constraint of `y' that is not a tautology.
+    dimension_type i;
+    dimension_type j;
+    // Prefer unary constraints.
+    for (i = 0; i < 2*dim; i += 2) {
+      // FIXME: if N is a float or bounded integer type, then
+      // we also need to check that we are actually able to construct
+      // a constraint inconsistent with respect to this one.
+      // Use something like !is_maximal()?
+      if (!is_plus_infinity(y.matrix_at(i, i + 1))) {
+        j = i + 1;
+        goto found;
+      }
+      // Use something like !is_maximal()?
+      if (!is_plus_infinity(y.matrix_at(i + 1, i))) {
+        j = i;
+        ++i;
+        goto found;
+      }
+    }
+    // Then search binary constraints.
+    // TODO: use better iteration scheme.
+    for (i = 2; i < 2*dim; ++i)
+      for (j = 0; j < i; ++j) {
+        // Use something like !is_maximal()?
+        if (!is_plus_infinity(y.matrix_at(i, j)))
+          goto found;
+      }
+
+    // Not found: we were not able to build a constraint contradicting
+    // one of the constraints in `y': `x' cannot be enlarged.
+    return false;
+
+  found:
+    // Found: build a new OS contradicting the constraint found.
+    PPL_ASSERT(i < dim && j < dim && i != j);
+    Octagonal_Shape<T> res(dim, UNIVERSE);
+    // FIXME: compute a proper contradicting constraint.
+    PPL_DIRTY_TEMP(N, tmp);
+    assign_r(tmp, 1, ROUND_UP);
+    add_assign_r(tmp, tmp, y.matrix_at(i, j), ROUND_UP);
+    // CHECKME: round down is really meant.
+    neg_assign_r(res.matrix_at(j, i), tmp, ROUND_DOWN);
+    PPL_ASSERT(!is_plus_infinity(res.matrix_at(j, i)));
+    x.m_swap(res);
+    return false;
+  }
+
+  // Here `x' and `y' are not empty and strongly closed;
+  // also, `x' does not contain `y'.
+  // Let `target' be the intersection of `x' and `y'.
+  Octagonal_Shape<T> target = x;
+  target.intersection_assign(y);
+  const bool bool_result = !target.is_empty();
+
+  // Compute redundancy information for x and ...
+  // TODO: provide a nicer data structure for redundancy.
+  std::vector<Bit_Row> x_non_redundant;
+  x.non_redundant_matrix_entries(x_non_redundant);
+  // ... count the non-redundant constraints.
+  dimension_type x_num_non_redundant = 0;
+  for (size_t i = x_non_redundant.size(); i-- > 0 ; )
+    x_num_non_redundant += x_non_redundant[i].count_ones();
+  PPL_ASSERT(x_num_non_redundant > 0);
+
+  // Let `yy' be a copy of `y': we will keep adding to `yy'
+  // the non-redundant constraints of `x',
+  // stopping as soon as `yy' becomes equal to `target'.
+  Octagonal_Shape<T> yy = y;
+
+  // The constraints added to `yy' will be recorded in `res' ...
+  Octagonal_Shape<T> res(dim, UNIVERSE);
+  // ... and we will count them too.
+  dimension_type res_num_non_redundant = 0;
+
+  // Compute leader information for `x'.
+  std::vector<dimension_type> x_leaders;
+  x.compute_leaders(x_leaders);
+
+  // First go through the unary equality constraints.
+  // Find the leader of the singular equivalence class (it is even!).
+  dimension_type sing_leader;
+  for (sing_leader = 0; sing_leader < 2*dim; sing_leader += 2) {
+    if (sing_leader == x_leaders[sing_leader]) {
+      const N& x_s_ss = x.matrix_at(sing_leader, sing_leader + 1);
+      const N& x_ss_s = x.matrix_at(sing_leader + 1, sing_leader);
+      if (is_additive_inverse(x_s_ss, x_ss_s))
+        // Singular leader found.
+        break;
+    }
+  }
+
+  // Unary equalities have `sing_leader' as a leader.
+  for (dimension_type i = sing_leader; i < 2*dim; i += 2) {
+    if (x_leaders[i] != sing_leader)
+      continue;
+    // Found a unary equality constraint:
+    // see if any of the two inequalities have to be added.
+    const N& x_i_ii = x.matrix_at(i, i + 1);
+    N& yy_i_ii = yy.matrix_at(i, i + 1);
+    if (x_i_ii < yy_i_ii) {
+      // The \leq inequality is not implied by context.
+      res.matrix_at(i, i + 1) = x_i_ii;
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy_i_ii = x_i_ii;
+      yy.reset_strongly_closed();
+    }
+    const N& x_ii_i = x.matrix_at(i + 1, i);
+    N& yy_ii_i = yy.matrix_at(i + 1, i);
+    if (x_ii_i < yy_ii_i) {
+      // The \geq inequality is not implied by context.
+      res.matrix_at(i + 1, i) = x_ii_i;
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy_ii_i = x_ii_i;
+      yy.reset_strongly_closed();
+    }
+    // Restore strong closure, if it was lost.
+    if (!yy.marked_strongly_closed()) {
+      Variable var_i(i/2);
+      yy.incremental_strong_closure_assign(var_i);
+      if (target.contains(yy)) {
+        // Target reached: swap `x' and `res' if needed.
+        if (res_num_non_redundant < x_num_non_redundant) {
+          res.reset_strongly_closed();
+          x.m_swap(res);
+        }
+        return bool_result;
+      }
+    }
+  }
+
+  // Go through the binary equality constraints.
+  for (dimension_type i = 0; i < 2*dim; ++i) {
+    const dimension_type j = x_leaders[i];
+    if (j == i || j == sing_leader)
+      continue;
+    const N& x_i_j = x.matrix_at(i, j);
+    PPL_ASSERT(!is_plus_infinity(x_i_j));
+    N& yy_i_j = yy.matrix_at(i, j);
+    if (x_i_j < yy_i_j) {
+      res.matrix_at(i, j) = x_i_j;
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy_i_j = x_i_j;
+      yy.reset_strongly_closed();
+    }
+    const N& x_j_i = x.matrix_at(j, i);
+    N& yy_j_i = yy.matrix_at(j, i);
+    PPL_ASSERT(!is_plus_infinity(x_j_i));
+    if (x_j_i < yy_j_i) {
+      res.matrix_at(j, i) = x_j_i;
+      ++res_num_non_redundant;
+      // Tighten context `yy' using the newly added constraint.
+      yy_j_i = x_j_i;
+      yy.reset_strongly_closed();
+    }
+    // Restore strong closure, if it was lost.
+    if (!yy.marked_strongly_closed()) {
+      Variable var_j(j/2);
+      yy.incremental_strong_closure_assign(var_j);
+      if (target.contains(yy)) {
+        // Target reached: swap `x' and `res' if needed.
+        if (res_num_non_redundant < x_num_non_redundant) {
+          res.reset_strongly_closed();
+          x.m_swap(res);
+        }
+        return bool_result;
+      }
+    }
+  }
+
+  // Finally go through the (proper) inequality constraints:
+  // both indices i and j should be leaders.
+  // FIXME: improve iteration scheme (are we doing twice the work?)
+  for (dimension_type i = 0; i < 2*dim; ++i) {
+    if (i != x_leaders[i])
+      continue;
+    const Bit_Row& x_non_redundant_i = x_non_redundant[i];
+    for (dimension_type j = 0; j < 2*dim; ++j) {
+      if (j != x_leaders[j])
+        continue;
+      if (i >= j) {
+        if (!x_non_redundant_i[j])
+          continue;
+      }
+      else if (!x_non_redundant[j][i])
+        continue;
+      N& yy_i_j = yy.matrix_at(i, j);
+      const N& x_i_j = x.matrix_at(i, j);
+      if (x_i_j < yy_i_j) {
+        res.matrix_at(i, j) = x_i_j;
+        ++res_num_non_redundant;
+        // Tighten context `yy' using the newly added constraint.
+        yy_i_j = x_i_j;
+        yy.reset_strongly_closed();
+        Variable var(i/2);
+        yy.incremental_strong_closure_assign(var);
+        if (target.contains(yy)) {
+          // Target reached: swap `x' and `res' if needed.
+          if (res_num_non_redundant < x_num_non_redundant) {
+            res.reset_strongly_closed();
+            x.m_swap(res);
+          }
+          return bool_result;
+        }
+      }
+    }
+  }
+  // This point should be unreachable.
+  PPL_UNREACHABLE;
+  return false;
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::add_space_dimensions_and_embed(dimension_type m) {
+  // Adding no dimensions is a no-op.
+  if (m == 0)
+    return;
+
+  const dimension_type new_dim = space_dim + m;
+  const bool was_zero_dim_univ = !marked_empty() && space_dim == 0;
+
+  // To embed an n-dimension space octagon in a (n + m)-dimension space,
+  // we just add `m' variables in the matrix of constraints.
+  matrix.grow(new_dim);
+  space_dim = new_dim;
+  // If `*this' was the zero-dim space universe octagon,
+  // then we can set the strongly closure flag.
+  if (was_zero_dim_univ)
+    set_strongly_closed();
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::add_space_dimensions_and_project(dimension_type m) {
+  // Adding no dimensions is a no-op.
+  if (m == 0)
+    return;
+
+  const dimension_type n = matrix.num_rows();
+
+  // To project an n-dimension space OS in a (space_dim + m)-dimension space,
+  // we just add `m' columns and rows in the matrix of constraints.
+  add_space_dimensions_and_embed(m);
+  // We insert 0 where it needs.
+  // Attention: now num_rows of matrix is update!
+  for (typename OR_Matrix<N>::row_iterator i = matrix.row_begin() + n,
+         matrix_row_end =  matrix.row_end(); i != matrix_row_end; i += 2) {
+    typename OR_Matrix<N>::row_reference_type x_i = *i;
+    typename OR_Matrix<N>::row_reference_type x_ci = *(i + 1);
+    const dimension_type ind = i.index();
+    assign_r(x_i[ind + 1], 0, ROUND_NOT_NEEDED);
+    assign_r(x_ci[ind], 0, ROUND_NOT_NEEDED);
+  }
+
+  if (marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::remove_space_dimensions(const Variables_Set& vars) {
+  // The removal of no dimensions from any octagon is a no-op.
+  // Note that this case also captures the only legal removal of
+  // dimensions from a octagon in a 0-dim space.
+  if (vars.empty()) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dim < min_space_dim)
+    throw_dimension_incompatible("remove_space_dimensions(vs)", min_space_dim);
+
+  const dimension_type new_space_dim = space_dim - vars.size();
+
+  strong_closure_assign();
+  // When removing _all_ dimensions from an octagon,
+  // we obtain the zero-dimensional octagon.
+  if (new_space_dim == 0) {
+    matrix.shrink(0);
+    if (!marked_empty())
+      // We set the zero_dim_univ flag.
+      set_zero_dim_univ();
+    space_dim = 0;
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // We consider each variable and we check if it has to be removed.
+  // If it has to be removed, we pass to the next one, then we will
+  // overwrite its representation in the matrix.
+  typedef typename OR_Matrix<N>::element_iterator Elem_Iter;
+  typedef typename std::iterator_traits<Elem_Iter>::difference_type diff_t;
+
+  dimension_type first = *vars.begin();
+  const dimension_type first_size = 2 * first * (first + 1);
+  Elem_Iter iter = matrix.element_begin() + static_cast<diff_t>(first_size);
+
+  for (dimension_type i = first + 1; i < space_dim; ++i) {
+    if (vars.count(i) == 0) {
+      typename OR_Matrix<N>::row_iterator row_iter = matrix.row_begin() + 2*i;
+      typename OR_Matrix<N>::row_reference_type row_ref = *row_iter;
+      typename OR_Matrix<N>::row_reference_type row_ref1 = *(++row_iter);
+      // Beware: first we shift the cells corresponding to the first
+      // row of variable(j), then we shift the cells corresponding to the
+      // second row. We recall that every variable is represented
+      // in the `matrix' by two rows and two columns.
+      for (dimension_type j = 0; j <= i; ++j)
+        if (vars.count(j) == 0) {
+          assign_or_swap(*(iter++), row_ref[2*j]);
+          assign_or_swap(*(iter++), row_ref[2*j + 1]);
+        }
+      for (dimension_type j = 0; j <= i; ++j)
+        if (vars.count(j) == 0) {
+          assign_or_swap(*(iter++), row_ref1[2*j]);
+          assign_or_swap(*(iter++), row_ref1[2*j + 1]);
+        }
+    }
+  }
+  // Update the space dimension.
+  matrix.shrink(new_space_dim);
+  space_dim = new_space_dim;
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Partial_Function>
+void
+Octagonal_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
+  if (space_dim == 0)
+    return;
+
+  if (pfunc.has_empty_codomain()) {
+    // All dimensions vanish: the octagon becomes zero_dimensional.
+    remove_higher_space_dimensions(0);
+    return;
+  }
+
+  const dimension_type new_space_dim = pfunc.max_in_codomain() + 1;
+  // If we are going to actually reduce the space dimension,
+  // then shortest-path closure is required to keep precision.
+  if (new_space_dim < space_dim)
+    strong_closure_assign();
+
+  // If the octagon is empty, then it is sufficient to adjust
+  // the space dimension of the octagon.
+  if (marked_empty()) {
+    remove_higher_space_dimensions(new_space_dim);
+    return;
+  }
+
+  // We create a new matrix with the new space dimension.
+  OR_Matrix<N> x(new_space_dim);
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+
+  row_iterator m_begin = x.row_begin();
+
+  for (row_iterator i_iter = matrix.row_begin(), i_end = matrix.row_end();
+       i_iter != i_end; i_iter += 2) {
+    dimension_type new_i;
+    dimension_type i = i_iter.index()/2;
+    // We copy and place in the position into `x' the only cells of
+    // the `matrix' that refer to both mapped variables,
+    // the variable `i' and `j'.
+    if (pfunc.maps(i, new_i)) {
+      row_reference r_i = *i_iter;
+      row_reference r_ii = *(i_iter + 1);
+      dimension_type double_new_i = 2*new_i;
+      row_iterator x_iter = m_begin + double_new_i;
+      row_reference x_i = *x_iter;
+      row_reference x_ii = *(x_iter + 1);
+      for (dimension_type j = 0; j <= i; ++j) {
+        dimension_type new_j;
+        // If also the second variable is mapped, we work.
+        if (pfunc.maps(j, new_j)) {
+          dimension_type dj = 2*j;
+          dimension_type double_new_j = 2*new_j;
+          // Mapped the constraints, exchanging the indexes.
+          // Attention: our matrix is pseudo-triangular.
+          // If new_j > new_i, we must consider, as rows, the rows of
+          // the variable new_j, and not of new_i ones.
+          if (new_i >= new_j) {
+            assign_or_swap(x_i[double_new_j], r_i[dj]);
+            assign_or_swap(x_ii[double_new_j], r_ii[dj]);
+            assign_or_swap(x_ii[double_new_j + 1], r_ii[dj + 1]);
+            assign_or_swap(x_i[double_new_j + 1], r_i[dj + 1]);
+          }
+          else {
+            row_iterator x_j_iter = m_begin + double_new_j;
+            row_reference x_j = *x_j_iter;
+            row_reference x_jj = *(x_j_iter + 1);
+            assign_or_swap(x_jj[double_new_i + 1], r_i[dj]);
+            assign_or_swap(x_jj[double_new_i], r_ii[dj]);
+            assign_or_swap(x_j[double_new_i + 1], r_i[dj + 1]);
+            assign_or_swap(x_j[double_new_i], r_ii[dj + 1]);
+          }
+
+        }
+      }
+    }
+  }
+
+  using std::swap;
+  swap(matrix, x);
+  space_dim = new_space_dim;
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::intersection_assign(const Octagonal_Shape& y) {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("intersection_assign(y)", y);
+
+  // If one of the two octagons is empty, the intersection is empty.
+  if (marked_empty())
+    return;
+  if (y.marked_empty()) {
+    set_empty();
+    return;
+  }
+  // If both octagons are zero-dimensional,then at this point
+  // they are necessarily non-empty,
+  // so that their intersection is non-empty too.
+  if (space_dim == 0)
+    return;
+
+  // To intersect two octagons we compare the constraints
+  // and we choose the less values.
+  bool changed = false;
+
+  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
+  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
+         matrix_element_end = matrix.element_end();
+       i != matrix_element_end;
+       ++i, ++j) {
+    N& elem = *i;
+    const N& y_elem = *j;
+    if (y_elem < elem) {
+      elem = y_elem;
+      changed = true;
+    }
+  }
+
+  // This method not preserve the closure.
+  if (changed && marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Iterator>
+void
+Octagonal_Shape<T>::CC76_extrapolation_assign(const Octagonal_Shape& y,
+                                              Iterator first, Iterator last,
+                                              unsigned* tp) {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("CC76_extrapolation_assign(y)", y);
+
+  // Assume `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If both octagons are zero-dimensional,
+  // since `*this' contains `y', we simply return `*this'.
+  if (space_dim == 0)
+    return;
+
+  strong_closure_assign();
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  y.strong_closure_assign();
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  // If there are tokens available, work on a temporary copy.
+  if (tp != 0 && *tp > 0) {
+    Octagonal_Shape x_tmp(*this);
+    x_tmp.CC76_extrapolation_assign(y, first, last, 0);
+    // If the widening was not precise, use one of the available tokens.
+    if (!contains(x_tmp))
+      --(*tp);
+    return;
+  }
+
+  // Compare each constraint in `y' to the corresponding one in `*this'.
+  // The constraint in `*this' is kept as is if it is stronger than or
+  // equal to the constraint in `y'; otherwise, the inhomogeneous term
+  // of the constraint in `*this' is further compared with elements taken
+  // from a sorted container (the stop-points, provided by the user), and
+  // is replaced by the first entry, if any, which is greater than or equal
+  // to the inhomogeneous term. If no such entry exists, the constraint
+  // is removed altogether.
+  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
+  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
+         matrix_element_end = matrix.element_end();
+       i != matrix_element_end;
+       ++i, ++j) {
+    const N& y_elem = *j;
+    N& elem = *i;
+    if (y_elem < elem) {
+      Iterator k = std::lower_bound(first, last, elem);
+      if (k != last) {
+        if (elem < *k)
+          assign_r(elem, *k, ROUND_UP);
+      }
+      else
+        assign_r(elem, PLUS_INFINITY, ROUND_NOT_NEEDED);
+    }
+  }
+
+  reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::get_limiting_octagon(const Constraint_System& cs,
+                       Octagonal_Shape& limiting_octagon) const {
+  const dimension_type cs_space_dim = cs.space_dimension();
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(cs_space_dim <= space_dim);
+
+  strong_closure_assign();
+  bool is_oct_changed = false;
+
+  // Allocate temporaries outside of the loop.
+  PPL_DIRTY_TEMP_COEFFICIENT(coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(term);
+  PPL_DIRTY_TEMP(N, d);
+
+  for (Constraint_System::const_iterator cs_i = cs.begin(),
+         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
+    const Constraint& c = *cs_i;
+    dimension_type num_vars = 0;
+    dimension_type i = 0;
+    dimension_type j = 0;
+    // Constraints that are not octagonal differences are ignored.
+    if (!Octagonal_Shape_Helper
+      ::extract_octagonal_difference(c, cs_space_dim, num_vars, i, j,
+                                     coeff, term))
+      continue;
+
+    typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+    typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+    typedef typename OR_Matrix<N>::row_iterator row_iterator;
+    typedef typename OR_Matrix<N>::row_reference_type row_reference;
+    Row_iterator m_begin = matrix.row_begin();
+    // Select the cell to be modified for the "<=" part of the constraint.
+    Row_iterator i_iter = m_begin + i;
+    Row_reference m_i = *i_iter;
+    OR_Matrix<N>& lo_mat = limiting_octagon.matrix;
+    row_iterator lo_iter = lo_mat.row_begin() + i;
+    row_reference lo_m_i = *lo_iter;
+    N& lo_m_i_j = lo_m_i[j];
+    if (coeff < 0)
+      neg_assign(coeff);
+    // Compute the bound for `m_i_j', rounding towards plus infinity.
+    div_round_up(d, term, coeff);
+    if (m_i[j] <= d)
+      if (c.is_inequality()) {
+        if (lo_m_i_j > d) {
+          lo_m_i_j = d;
+          is_oct_changed = true;
+        }
+        else {
+          // Select the right row of the cell.
+          if (i % 2 == 0) {
+            ++i_iter;
+            ++lo_iter;
+          }
+          else {
+            --i_iter;
+            --lo_iter;
+          }
+          Row_reference m_ci = *i_iter;
+          row_reference lo_m_ci = *lo_iter;
+          // Select the right column of the cell.
+          using namespace Implementation::Octagonal_Shapes;
+          dimension_type cj = coherent_index(j);
+          N& lo_m_ci_cj = lo_m_ci[cj];
+          neg_assign(term);
+          div_round_up(d, term, coeff);
+          if (m_ci[cj] <= d && lo_m_ci_cj > d) {
+            lo_m_ci_cj = d;
+            is_oct_changed = true;
+          }
+        }
+      }
+  }
+  // In general, adding a constraint does not preserve the strongly
+  // closure of the octagon.
+  if (is_oct_changed && limiting_octagon.marked_strongly_closed())
+    limiting_octagon.reset_strongly_closed();
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::limited_CC76_extrapolation_assign(const Octagonal_Shape& y,
+                                    const Constraint_System& cs,
+                                    unsigned* tp) {
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)",
+                                 y);
+  // `cs' must be dimension-compatible with the two octagons.
+  const dimension_type cs_space_dim = cs.space_dimension();
+  if (space_dim < cs_space_dim)
+    throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");
+
+  // Strict inequalities not allowed.
+  if (cs.has_strict_inequalities())
+    throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");
+
+  // The limited CC76-extrapolation between two octagons in a
+  // zero-dimensional space is a octagon in a zero-dimensional
+  // space, too.
+  if (space_dim == 0)
+    return;
+
+  // Assume `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  Octagonal_Shape limiting_octagon(space_dim, UNIVERSE);
+  get_limiting_octagon(cs, limiting_octagon);
+  CC76_extrapolation_assign(y, tp);
+  intersection_assign(limiting_octagon);
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::BHMZ05_widening_assign(const Octagonal_Shape& y,
+                                           unsigned* tp) {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("BHMZ05_widening_assign(y)", y);
+
+  // Assume `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // Compute the affine dimension of `y'.
+  const dimension_type y_affine_dim = y.affine_dimension();
+  // If the affine dimension of `y' is zero, then either `y' is
+  // zero-dimensional, or it is empty, or it is a singleton.
+  // In all cases, due to the inclusion hypothesis, the result is `*this'.
+  if (y_affine_dim == 0)
+    return;
+
+  // If the affine dimension has changed, due to the inclusion hypothesis,
+  // the result is `*this'.
+  const dimension_type x_affine_dim = affine_dimension();
+  PPL_ASSERT(x_affine_dim >= y_affine_dim);
+  if (x_affine_dim != y_affine_dim)
+    return;
+
+  // If there are tokens available, work on a temporary copy.
+  if (tp != 0 && *tp > 0) {
+    Octagonal_Shape x_tmp(*this);
+    x_tmp.BHMZ05_widening_assign(y, 0);
+    // If the widening was not precise, use one of the available tokens.
+    if (!contains(x_tmp))
+      --(*tp);
+    return;
+  }
+
+  // Here no token is available.
+  PPL_ASSERT(marked_strongly_closed() && y.marked_strongly_closed());
+  // Minimize `y'.
+  y.strong_reduction_assign();
+
+  // Extrapolate unstable bounds.
+  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
+  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
+       matrix_element_end = matrix.element_end();
+       i != matrix_element_end;
+       ++i, ++j) {
+    N& elem = *i;
+      // Note: in the following line the use of `!=' (as opposed to
+      // the use of `<' that would seem -but is not- equivalent) is
+      // intentional.
+    if (*j != elem)
+      assign_r(elem, PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+  reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::limited_BHMZ05_extrapolation_assign(const Octagonal_Shape& y,
+                                      const Constraint_System& cs,
+                                      unsigned* tp) {
+
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("limited_BHMZ05_extrapolation_assign(y, cs)",
+                                 y);
+  // `cs' must be dimension-compatible with the two octagons.
+  const dimension_type cs_space_dim = cs.space_dimension();
+  if (space_dim < cs_space_dim)
+    throw_constraint_incompatible("limited_CH78_extrapolation_assign(y, cs)");
+
+  // Strict inequalities not allowed.
+  if (cs.has_strict_inequalities())
+    throw_constraint_incompatible("limited_CH78_extrapolation_assign(y, cs)");
+
+  // The limited BHMZ05-extrapolation between two octagons in a
+  // zero-dimensional space is a octagon in a zero-dimensional
+  // space, too.
+  if (space_dim == 0)
+    return;
+
+  // Assume `y' is contained in or equal to `*this'.
+  PPL_EXPECT_HEAVY(copy_contains(*this, y));
+
+  // If `*this' is empty, since `*this' contains `y', `y' is empty too.
+  if (marked_empty())
+    return;
+  // If `y' is empty, we return.
+  if (y.marked_empty())
+    return;
+
+  Octagonal_Shape limiting_octagon(space_dim, UNIVERSE);
+  get_limiting_octagon(cs, limiting_octagon);
+  BHMZ05_widening_assign(y, tp);
+  intersection_assign(limiting_octagon);
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::CC76_narrowing_assign(const Octagonal_Shape& y) {
+  // Dimension-compatibility check.
+  if (space_dim != y.space_dim)
+    throw_dimension_incompatible("CC76_narrowing_assign(y)", y);
+
+  // Assume `*this' is contained in or equal to `y'.
+  PPL_EXPECT_HEAVY(copy_contains(y, *this));
+
+  // If both octagons are zero-dimensional, since `*this' contains `y',
+  // we simply return '*this'.
+  if (space_dim == 0)
+    return;
+
+  y.strong_closure_assign();
+  // If `y' is empty, since `y' contains `*this', `*this' is empty too.
+  if (y.marked_empty())
+    return;
+  strong_closure_assign();
+  // If `*this' is empty, we return.
+  if (marked_empty())
+    return;
+
+  // We consider a constraint of `*this', if its value is `plus_infinity',
+  // we take the value of the corresponding constraint of `y'.
+  bool is_oct_changed = false;
+  typename OR_Matrix<N>::const_element_iterator j = y.matrix.element_begin();
+  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
+         matrix_element_end = matrix.element_end();
+       i != matrix_element_end;
+       ++i, ++j) {
+    if (!is_plus_infinity(*i)
+        && !is_plus_infinity(*j)
+        && *i != *j) {
+      *i = *j;
+      is_oct_changed = true;
+    }
+  }
+
+  if (is_oct_changed && marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::deduce_v_pm_u_bounds(const dimension_type v_id,
+                       const dimension_type last_id,
+                       const Linear_Expression& sc_expr,
+                       Coefficient_traits::const_reference sc_denom,
+                       const N& ub_v) {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(sc_denom > 0);
+  PPL_ASSERT(!is_plus_infinity(ub_v));
+
+  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
+  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
+
+  // No need to consider indices greater than `last_id'.
+  const dimension_type n_v = 2*v_id;
+  typename OR_Matrix<N>::row_reference_type m_cv = matrix[n_v + 1];
+
+  // Speculatively allocate temporaries out of the loop.
+  PPL_DIRTY_TEMP(N, half);
+  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
+  PPL_DIRTY_TEMP(mpq_class, q);
+  PPL_DIRTY_TEMP(mpq_class, minus_q);
+  PPL_DIRTY_TEMP(mpq_class, ub_u);
+  PPL_DIRTY_TEMP(mpq_class, lb_u);
+  PPL_DIRTY_TEMP(N, up_approx);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_expr_u);
+
+  for (Linear_Expression::const_iterator u = sc_expr.begin(),
+      u_end = sc_expr.lower_bound(Variable(last_id + 1)); u != u_end; ++u) {
+    const dimension_type u_id = u.variable().id();
+    // Skip the case when `u_id == v_id'.
+    if (u_id == v_id)
+      continue;
+    const Coefficient& expr_u = *u;
+
+    const dimension_type n_u = u_id*2;
+    // If `expr_u' is positive, we can improve `v - u'.
+    if (expr_u > 0) {
+      if (expr_u >= sc_denom) {
+        // Here q >= 1: deducing `v - u <= ub_v - ub_u'.
+        // We avoid to check if `ub_u' is plus infinity, because
+        // it is used for the computation of `ub_v'.
+        // Let half = m_cu_u / 2.
+        div_2exp_assign_r(half, matrix[n_u + 1][n_u], 1, ROUND_UP);
+        N& m_v_minus_u = (n_v < n_u) ? matrix[n_u][n_v] : m_cv[n_u + 1];
+        sub_assign_r(m_v_minus_u, ub_v, half, ROUND_UP);
+      }
+      else {
+        // Here 0 < q < 1.
+        typename OR_Matrix<N>::row_reference_type m_u = matrix[n_u];
+        const N& m_u_cu = m_u[n_u + 1];
+        if (!is_plus_infinity(m_u_cu)) {
+          // Let `ub_u' and `lb_u' be the known upper and lower bound
+          // for `u', respectively. The upper bound for `v - u' is
+          // computed as `ub_v - (q * ub_u + (1-q) * lb_u)',
+          // i.e., `ub_v + (-lb_u) - q * (ub_u + (-lb_u))'.
+          assign_r(minus_lb_u, m_u_cu, ROUND_NOT_NEEDED);
+          div_2exp_assign_r(minus_lb_u, minus_lb_u, 1, ROUND_NOT_NEEDED);
+          assign_r(q, expr_u, ROUND_NOT_NEEDED);
+          div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
+          assign_r(ub_u, matrix[n_u + 1][n_u], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
+          // Compute `ub_u - lb_u'.
+          add_assign_r(ub_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
+          // Compute `(-lb_u) - q * (ub_u - lb_u)'.
+          sub_mul_assign_r(minus_lb_u, q, ub_u, ROUND_NOT_NEEDED);
+          assign_r(up_approx, minus_lb_u, ROUND_UP);
+          // Deducing `v - u <= ub_v - (q * ub_u + (1-q) * lb_u)'.
+          N& m_v_minus_u = (n_v < n_u) ? m_u[n_v] : m_cv[n_u + 1];
+          add_assign_r(m_v_minus_u, ub_v, up_approx, ROUND_UP);
+        }
+      }
+    }
+    else {
+      PPL_ASSERT(expr_u < 0);
+      // If `expr_u' is negative, we can improve `v + u'.
+      neg_assign(minus_expr_u, expr_u);
+      if (minus_expr_u >= sc_denom) {
+        // Here q <= -1: Deducing `v + u <= ub_v + lb_u'.
+        // We avoid to check if `lb_u' is plus infinity, because
+        // it is used for the computation of `ub_v'.
+        // Let half = m_u_cu / 2.
+        div_2exp_assign_r(half, matrix[n_u][n_u + 1], 1, ROUND_UP);
+        N& m_v_plus_u = (n_v < n_u) ? matrix[n_u + 1][n_v] : m_cv[n_u];
+        sub_assign_r(m_v_plus_u, ub_v, half, ROUND_UP);
+      }
+      else {
+        // Here -1 < q < 0.
+        typename OR_Matrix<N>::row_reference_type m_cu = matrix[n_u + 1];
+        const N& m_cu_u = m_cu[n_u];
+        if (!is_plus_infinity(m_cu_u)) {
+          // Let `ub_u' and `lb_u' be the known upper and lower bound
+          // for `u', respectively. The upper bound for `v + u' is
+          // computed as `ub_v + ((-q) * lb_u + (1 + q) * ub_u)',
+          // i.e., `ub_v + ub_u + (-q) * (lb_u - ub_u)'.
+          assign_r(ub_u, m_cu[n_u], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
+          assign_r(minus_q, minus_expr_u, ROUND_NOT_NEEDED);
+          div_assign_r(minus_q, minus_q, mpq_sc_denom, ROUND_NOT_NEEDED);
+          assign_r(lb_u, matrix[n_u][n_u + 1], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(lb_u, lb_u, 1, ROUND_NOT_NEEDED);
+          neg_assign_r(lb_u, lb_u, ROUND_NOT_NEEDED);
+          // Compute `lb_u - ub_u'.
+          sub_assign_r(lb_u, lb_u, ub_u, ROUND_NOT_NEEDED);
+          // Compute `ub_u + (-q) * (lb_u - ub_u)'.
+          add_mul_assign_r(ub_u, minus_q, lb_u, ROUND_NOT_NEEDED);
+          assign_r(up_approx, ub_u, ROUND_UP);
+          // Deducing `v + u <= ub_v + ((-q) * lb_u + (1 + q) * ub_u)'.
+          N& m_v_plus_u = (n_v < n_u) ? m_cu[n_v] : m_cv[n_u];
+          add_assign_r(m_v_plus_u, ub_v, up_approx, ROUND_UP);
+        }
+      }
+    }
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::deduce_minus_v_pm_u_bounds(const dimension_type v_id,
+                             const dimension_type last_id,
+                             const Linear_Expression& sc_expr,
+                             Coefficient_traits::const_reference sc_denom,
+                             const N& minus_lb_v) {
+  // Private method: the caller has to ensure the following.
+  PPL_ASSERT(sc_denom > 0);
+  PPL_ASSERT(!is_plus_infinity(minus_lb_v));
+
+  PPL_DIRTY_TEMP(mpq_class, mpq_sc_denom);
+  assign_r(mpq_sc_denom, sc_denom, ROUND_NOT_NEEDED);
+
+  // No need to consider indices greater than `last_id'.
+  const dimension_type n_v = 2*v_id;
+  typename OR_Matrix<N>::row_reference_type m_v = matrix[n_v];
+
+  // Speculatively allocate temporaries out of the loop.
+  PPL_DIRTY_TEMP(N, half);
+  PPL_DIRTY_TEMP(mpq_class, ub_u);
+  PPL_DIRTY_TEMP(mpq_class, q);
+  PPL_DIRTY_TEMP(mpq_class, minus_lb_u);
+  PPL_DIRTY_TEMP(N, up_approx);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_expr_u);
+
+  for (Linear_Expression::const_iterator u = sc_expr.begin(),
+      u_end = sc_expr.lower_bound(Variable(last_id + 1)); u != u_end; ++u) {
+    const dimension_type u_id = u.variable().id();
+    // Skip the case when `u_id == v_id'.
+    if (u_id == v_id)
+      continue;
+    const Coefficient& expr_u = *u;
+
+    const dimension_type n_u = u_id*2;
+    // If `expr_u' is positive, we can improve `-v + u'.
+    if (expr_u > 0) {
+      if (expr_u >= sc_denom) {
+        // Here q >= 1: deducing `-v + u <= lb_u - lb_v',
+        // i.e., `u - v <= (-lb_v) - (-lb_u)'.
+        // We avoid to check if `lb_u' is plus infinity, because
+        // it is used for the computation of `lb_v'.
+        // Let half = m_u_cu / 2.
+        div_2exp_assign_r(half, matrix[n_u][n_u + 1], 1, ROUND_UP);
+        N& m_u_minus_v = (n_v < n_u) ? matrix[n_u + 1][n_v + 1] : m_v[n_u];
+        sub_assign_r(m_u_minus_v, minus_lb_v, half, ROUND_UP);
+      }
+      else {
+        // Here 0 < q < 1.
+        typename OR_Matrix<N>::row_reference_type m_cu = matrix[n_u + 1];
+        const N& m_cu_u = m_cu[n_u];
+        if (!is_plus_infinity(m_cu_u)) {
+          // Let `ub_u' and `lb_u' be the known upper and lower bound
+          // for `u', respectively. The upper bound for `u - v' is
+          // computed as `(q * lb_u + (1-q) * ub_u) - lb_v',
+          // i.e., `ub_u - q * (ub_u + (-lb_u)) + minus_lb_v'.
+          assign_r(ub_u, m_cu[n_u], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
+          assign_r(q, expr_u, ROUND_NOT_NEEDED);
+          div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
+          assign_r(minus_lb_u, matrix[n_u][n_u + 1], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(minus_lb_u, minus_lb_u, 1, ROUND_NOT_NEEDED);
+          // Compute `ub_u - lb_u'.
+          add_assign_r(minus_lb_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
+          // Compute `ub_u - q * (ub_u - lb_u)'.
+          sub_mul_assign_r(ub_u, q, minus_lb_u, ROUND_NOT_NEEDED);
+          assign_r(up_approx, ub_u, ROUND_UP);
+          // Deducing `u - v <= -lb_v - (q * lb_u + (1-q) * ub_u)'.
+          N& m_u_minus_v = (n_v < n_u) ? m_cu[n_v + 1] : m_v[n_u];
+          add_assign_r(m_u_minus_v, minus_lb_v, up_approx, ROUND_UP);
+        }
+      }
+    }
+    else {
+      PPL_ASSERT(expr_u < 0);
+      // If `expr_u' is negative, we can improve `-v - u'.
+      neg_assign(minus_expr_u, expr_u);
+      if (minus_expr_u >= sc_denom) {
+        // Here q <= -1: Deducing `-v - u <= -lb_v - ub_u'.
+        // We avoid to check if `ub_u' is plus infinity, because
+        // it is used for the computation of `lb_v'.
+        // Let half = m_cu_u / 2.
+        div_2exp_assign_r(half, matrix[n_u + 1][n_u], 1, ROUND_UP);
+        N& m_minus_v_minus_u = (n_v < n_u)
+          ? matrix[n_u][n_v + 1]
+          : m_v[n_u + 1];
+        sub_assign_r(m_minus_v_minus_u, minus_lb_v, half, ROUND_UP);
+      }
+      else {
+        // Here -1 < q < 0.
+        typename OR_Matrix<N>::row_reference_type m_u = matrix[n_u];
+        const N& m_u_cu = m_u[n_u + 1];
+        if (!is_plus_infinity(m_u_cu)) {
+          // Let `ub_u' and `lb_u' be the known upper and lower bound
+          // for `u', respectively. The upper bound for `-v - u' is
+          // computed as `-lb_v - ((-q)*ub_u + (1 + q)*lb_u)',
+          // i.e., `minus_lb_v - lb_u + q*(ub_u - lb_u)'.
+          assign_r(ub_u, matrix[n_u + 1][n_u], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(ub_u, ub_u, 1, ROUND_NOT_NEEDED);
+          assign_r(q, expr_u, ROUND_NOT_NEEDED);
+          div_assign_r(q, q, mpq_sc_denom, ROUND_NOT_NEEDED);
+          assign_r(minus_lb_u, m_u[n_u + 1], ROUND_NOT_NEEDED);
+          div_2exp_assign_r(minus_lb_u, minus_lb_u, 1, ROUND_NOT_NEEDED);
+          // Compute `ub_u - lb_u'.
+          add_assign_r(ub_u, ub_u, minus_lb_u, ROUND_NOT_NEEDED);
+          // Compute `-lb_u + q*(ub_u - lb_u)'.
+          add_mul_assign_r(minus_lb_u, q, ub_u, ROUND_NOT_NEEDED);
+          assign_r(up_approx, minus_lb_u, ROUND_UP);
+          // Deducing `-v - u <= -lb_v - ((-q) * ub_u + (1 + q) * lb_u)'.
+          N& m_minus_v_minus_u = (n_v < n_u) ? m_u[n_v + 1] : m_v[n_u + 1];
+          add_assign_r(m_minus_v_minus_u, minus_lb_v, up_approx, ROUND_UP);
+        }
+      }
+    }
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::forget_all_octagonal_constraints(const dimension_type v_id) {
+  PPL_ASSERT(v_id < space_dim);
+  const dimension_type n_v = 2*v_id;
+  typename OR_Matrix<N>::row_iterator m_iter = matrix.row_begin() + n_v;
+  typename OR_Matrix<N>::row_reference_type r_v = *m_iter;
+  typename OR_Matrix<N>::row_reference_type r_cv = *(++m_iter);
+  for (dimension_type h = m_iter.row_size(); h-- > 0; ) {
+    assign_r(r_v[h], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    assign_r(r_cv[h], PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+  ++m_iter;
+  for (typename OR_Matrix<N>::row_iterator m_end = matrix.row_end();
+       m_iter != m_end; ++m_iter) {
+    typename OR_Matrix<N>::row_reference_type r = *m_iter;
+    assign_r(r[n_v], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    assign_r(r[n_v + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::forget_binary_octagonal_constraints(const dimension_type v_id) {
+  PPL_ASSERT(v_id < space_dim);
+  const dimension_type n_v = 2*v_id;
+  typename OR_Matrix<N>::row_iterator m_iter = matrix.row_begin() + n_v;
+  typename OR_Matrix<N>::row_reference_type r_v = *m_iter;
+  typename OR_Matrix<N>::row_reference_type r_cv = *(++m_iter);
+  for (dimension_type k = n_v; k-- > 0; ) {
+    assign_r(r_v[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    assign_r(r_cv[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+  ++m_iter;
+  for (typename OR_Matrix<N>::row_iterator m_end = matrix.row_end();
+       m_iter != m_end; ++m_iter) {
+    typename OR_Matrix<N>::row_reference_type r = *m_iter;
+    assign_r(r[n_v], PLUS_INFINITY, ROUND_NOT_NEEDED);
+    assign_r(r[n_v + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::unconstrain(const Variable var) {
+  // Dimension-compatibility check.
+  const dimension_type var_id = var.id();
+  if (space_dimension() < var_id + 1)
+    throw_dimension_incompatible("unconstrain(var)", var_id + 1);
+
+  // Enforce strong closure for precision.
+  strong_closure_assign();
+
+  // If the shape is empty, this is a no-op.
+  if (marked_empty())
+    return;
+
+  forget_all_octagonal_constraints(var_id);
+  // Strong closure is preserved.
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::unconstrain(const Variables_Set& vars) {
+  // The cylindrification with respect to no dimensions is a no-op.
+  // This case captures the only legal cylindrification in a 0-dim space.
+  if (vars.empty())
+    return;
+
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dimension() < min_space_dim)
+    throw_dimension_incompatible("unconstrain(vs)", min_space_dim);
+
+  // Enforce strong closure for precision.
+  strong_closure_assign();
+
+  // If the shape is empty, this is a no-op.
+  if (marked_empty())
+    return;
+
+  for (Variables_Set::const_iterator vsi = vars.begin(),
+         vsi_end = vars.end(); vsi != vsi_end; ++vsi)
+    forget_all_octagonal_constraints(*vsi);
+  // Strong closure is preserved.
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::refine(const Variable var,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator) {
+  PPL_ASSERT(denominator != 0);
+  PPL_ASSERT(space_dim >= expr.space_dimension());
+  const dimension_type var_id = var.id();
+  PPL_ASSERT(var_id <= space_dim);
+  PPL_ASSERT(expr.coefficient(var) == 0);
+  PPL_ASSERT(relsym != LESS_THAN && relsym != GREATER_THAN);
+
+  const Coefficient& b = expr.inhomogeneous_term();
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+
+  // Variable index of the last non-zero coefficient in `expr', if any.
+  dimension_type w_id = expr.last_nonzero();
+
+  if (w_id != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w_id))
+      ++t;
+    --w_id;
+  }
+
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*j + b, where `j != v';
+  // - If t == 2, then `expr' is of the general form.
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const dimension_type n_var = 2*var_id;
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign(minus_denom, denominator);
+
+  // Since we are only able to record octagonal differences, we can
+  // precisely deal with the case of a single variable only if its
+  // coefficient (taking into account the denominator) is 1.
+  // If this is not the case, we fall back to the general case
+  // so as to over-approximate the constraint.
+  if (t == 1 && expr.coefficient(Variable(w_id)) != denominator
+      && expr.coefficient(Variable(w_id)) != minus_denom)
+    t = 2;
+
+  if (t == 0) {
+    // Case 1: expr == b.
+    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
+    two_b = 2*b;
+    switch (relsym) {
+    case EQUAL:
+      // Add the constraint `var == b/denominator'.
+      add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
+      add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
+      break;
+    case LESS_OR_EQUAL:
+      // Add the constraint `var <= b/denominator'.
+      add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
+      break;
+    case GREATER_OR_EQUAL:
+      // Add the constraint `var >= b/denominator',
+      // i.e., `-var <= -b/denominator',
+      add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+  }
+  else if (t == 1) {
+    // Value of the one and only non-zero coefficient in `expr'.
+    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
+    const dimension_type n_w = 2*w_id;
+    switch (relsym) {
+    case EQUAL:
+      if (w_coeff == denominator)
+        // Add the new constraint `var - w = b/denominator'.
+        if (var_id < w_id) {
+          add_octagonal_constraint(n_w, n_var, b, denominator);
+          add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
+        }
+        else {
+          add_octagonal_constraint(n_var + 1, n_w + 1, b, denominator);
+          add_octagonal_constraint(n_var, n_w, b, minus_denom);
+        }
+      else
+        // Add the new constraint `var + w = b/denominator'.
+        if (var_id < w_id) {
+          add_octagonal_constraint(n_w + 1, n_var, b, denominator);
+          add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
+        }
+        else {
+          add_octagonal_constraint(n_var + 1, n_w, b, denominator);
+          add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
+        }
+      break;
+    case LESS_OR_EQUAL:
+      {
+        PPL_DIRTY_TEMP(N, d);
+        div_round_up(d, b, denominator);
+        // Note that: `w_id != v', so that `expr' is of the form
+        // w_coeff * w + b, with `w_id != v'.
+        if (w_coeff == denominator) {
+          // Add the new constraints `v - w <= b/denominator'.
+          if (var_id < w_id)
+            add_octagonal_constraint(n_w, n_var, d);
+          else
+            add_octagonal_constraint(n_var + 1, n_w + 1, d);
+        }
+        else if (w_coeff == minus_denom) {
+          // Add the new constraints `v + w <= b/denominator'.
+          if (var_id < w_id)
+            add_octagonal_constraint(n_w + 1, n_var, d);
+          else
+            add_octagonal_constraint(n_var + 1, n_w, d);
+        }
+        break;
+      }
+
+    case GREATER_OR_EQUAL:
+      {
+        PPL_DIRTY_TEMP(N, d);
+        div_round_up(d, b, minus_denom);
+        // Note that: `w_id != v', so that `expr' is of the form
+        // w_coeff * w + b, with `w_id != v'.
+        if (w_coeff == denominator) {
+          // Add the new constraint `v - w >= b/denominator',
+          // i.e.,  `-v + w <= -b/denominator'.
+          if (var_id < w_id)
+            add_octagonal_constraint(n_w + 1, n_var + 1, d);
+          else
+            add_octagonal_constraint(n_var, n_w, d);
+        }
+        else if (w_coeff == minus_denom) {
+          // Add the new constraints `v + w >= b/denominator',
+          // i.e.,  `-v - w <= -b/denominator'.
+          if (var_id < w_id)
+            add_octagonal_constraint(n_w, n_var + 1, d);
+          else
+            add_octagonal_constraint(n_var, n_w + 1, d);
+        }
+        break;
+      }
+
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+  }
+  else {
+    // Here t == 2, so that
+    // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2.
+    const bool is_sc = (denominator > 0);
+    PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+    neg_assign(minus_b, b);
+    const Coefficient& sc_b = is_sc ? b : minus_b;
+    const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+    const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+    const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+    // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+    // when `denominator' is negative. Do not use it unless you are sure
+    // it has been correctly assigned.
+    Linear_Expression minus_expr;
+    if (!is_sc)
+      minus_expr = -expr;
+    const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
+
+    PPL_DIRTY_TEMP(N, sum);
+    // Index of variable that is unbounded in `this'.
+    PPL_UNINITIALIZED(dimension_type, pinf_index);
+    // Number of unbounded variables found.
+    dimension_type pinf_count = 0;
+
+    switch (relsym) {
+    case EQUAL:
+      {
+        PPL_DIRTY_TEMP(N, neg_sum);
+        // Index of variable that is unbounded in `this'.
+        PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
+        // Number of unbounded variables found.
+        dimension_type neg_pinf_count = 0;
+
+        // Approximate the inhomogeneous term.
+        assign_r(sum, sc_b, ROUND_UP);
+        assign_r(neg_sum, minus_sc_b, ROUND_UP);
+
+        // Approximate the homogeneous part of `sc_expr'.
+        PPL_DIRTY_TEMP(N, coeff_i);
+        PPL_DIRTY_TEMP(N, half);
+        PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+        PPL_DIRTY_TEMP(N, minus_coeff_i);
+        // Note: indices above `w' can be disregarded, as they all have
+        // a zero coefficient in `sc_expr'.
+        for (Row_iterator m_iter = m_begin,
+               m_iter_end = m_begin + (2 * w_id + 2);
+             m_iter != m_iter_end; ) {
+          const dimension_type n_i = m_iter.index();
+          const dimension_type id = n_i/2;
+          Row_reference m_i = *m_iter;
+          ++m_iter;
+          Row_reference m_ci = *m_iter;
+          ++m_iter;
+          const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+          const int sign_i = sgn(sc_i);
+          if (sign_i > 0) {
+            assign_r(coeff_i, sc_i, ROUND_UP);
+            // Approximating `sc_expr'.
+            if (pinf_count <= 1) {
+              const N& double_approx_i = m_ci[n_i];
+              if (!is_plus_infinity(double_approx_i)) {
+                // Let half = double_approx_i / 2.
+                div_2exp_assign_r(half, double_approx_i, 1, ROUND_UP);
+                add_mul_assign_r(sum, coeff_i, half, ROUND_UP);
+              }
+              else {
+                ++pinf_count;
+                pinf_index = id;
+              }
+            }
+            // Approximating `-sc_expr'.
+            if (neg_pinf_count <= 1) {
+              const N& double_approx_minus_i = m_i[n_i + 1];
+              if (!is_plus_infinity(double_approx_minus_i)) {
+                // Let half = double_approx_minus_i / 2.
+                div_2exp_assign_r(half, double_approx_minus_i, 1, ROUND_UP);
+                add_mul_assign_r(neg_sum, coeff_i, half, ROUND_UP);
+              }
+              else {
+                ++neg_pinf_count;
+                neg_pinf_index = id;
+              }
+            }
+          }
+          else if (sign_i < 0) {
+            neg_assign_r(minus_sc_i, sc_i, ROUND_NOT_NEEDED);
+            assign_r(minus_coeff_i, minus_sc_i, ROUND_UP);
+            // Approximating `sc_expr'.
+            if (pinf_count <= 1) {
+              const N& double_approx_minus_i = m_i[n_i + 1];
+              if (!is_plus_infinity(double_approx_minus_i)) {
+                // Let half = double_approx_minus_i / 2.
+                div_2exp_assign_r(half, double_approx_minus_i, 1, ROUND_UP);
+                add_mul_assign_r(sum, minus_coeff_i, half, ROUND_UP);
+              }
+              else {
+                ++pinf_count;
+                pinf_index = id;
+              }
+            }
+            // Approximating `-sc_expr'.
+            if (neg_pinf_count <= 1) {
+              const N& double_approx_i = m_ci[n_i];
+              if (!is_plus_infinity(double_approx_i)) {
+                // Let half = double_approx_i / 2.
+                div_2exp_assign_r(half, double_approx_i, 1, ROUND_UP);
+                add_mul_assign_r(neg_sum, minus_coeff_i, half, ROUND_UP);
+              }
+              else {
+                ++neg_pinf_count;
+                neg_pinf_index = id;
+              }
+            }
+          }
+        }
+        // Return immediately if no approximation could be computed.
+        if (pinf_count > 1 && neg_pinf_count > 1) {
+          PPL_ASSERT(OK());
+          return;
+        }
+
+        // In the following, strong closure will be definitely lost.
+        reset_strongly_closed();
+
+        // Exploit the upper approximation, if possible.
+        if (pinf_count <= 1) {
+          // Compute quotient (if needed).
+          if (sc_denom != 1) {
+            // Before computing quotients, the denominator should be
+            // approximated towards zero. Since `sc_denom' is known to be
+            // positive, this amounts to rounding downwards, which is
+            // achieved as usual by rounding upwards `minus_sc_denom'
+            // and negating again the result.
+            PPL_DIRTY_TEMP(N, down_sc_denom);
+            assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+            neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+            div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+          }
+          // Add the upper bound constraint, if meaningful.
+          if (pinf_count == 0) {
+            // Add the constraint `v <= sum'.
+            PPL_DIRTY_TEMP(N, double_sum);
+            mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
+            matrix[n_var + 1][n_var] = double_sum;
+            // Deduce constraints of the form `v +/- u', where `u != v'.
+            deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, sum);
+          }
+          else
+            // Here `pinf_count == 1'.
+            if (pinf_index != var_id) {
+              const Coefficient& ppi
+                = sc_expr.coefficient(Variable(pinf_index));
+              if (ppi == sc_denom)
+                // Add the constraint `v - pinf_index <= sum'.
+                if (var_id < pinf_index)
+                  matrix[2*pinf_index][n_var] = sum;
+                else
+                  matrix[n_var + 1][2*pinf_index + 1] = sum;
+              else
+                if (ppi == minus_sc_denom) {
+                  // Add the constraint `v + pinf_index <= sum'.
+                  if (var_id < pinf_index)
+                    matrix[2*pinf_index + 1][n_var] = sum;
+                  else
+                    matrix[n_var + 1][2*pinf_index] = sum;
+                }
+            }
+        }
+
+        // Exploit the lower approximation, if possible.
+        if (neg_pinf_count <= 1) {
+          // Compute quotient (if needed).
+          if (sc_denom != 1) {
+            // Before computing quotients, the denominator should be
+            // approximated towards zero. Since `sc_denom' is known to be
+            // positive, this amounts to rounding downwards, which is
+            // achieved as usual by rounding upwards `minus_sc_denom'
+            // and negating again the result.
+            PPL_DIRTY_TEMP(N, down_sc_denom);
+            assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+            neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+            div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
+          }
+          // Add the lower bound constraint, if meaningful.
+          if (neg_pinf_count == 0) {
+            // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+            PPL_DIRTY_TEMP(N, double_neg_sum);
+            mul_2exp_assign_r(double_neg_sum, neg_sum, 1, ROUND_UP);
+            matrix[n_var][n_var + 1] = double_neg_sum;
+            // Deduce constraints of the form `-v +/- u', where `u != v'.
+            deduce_minus_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom,
+                                       neg_sum);
+          }
+          else
+            // Here `neg_pinf_count == 1'.
+            if (neg_pinf_index != var_id) {
+              const Coefficient& npi
+                = sc_expr.coefficient(Variable(neg_pinf_index));
+              if (npi == sc_denom)
+                // Add the constraint `v - neg_pinf_index >= -neg_sum',
+                // i.e., `neg_pinf_index - v <= neg_sum'.
+                if (neg_pinf_index < var_id)
+                  matrix[n_var][2*neg_pinf_index] = neg_sum;
+                else
+                  matrix[2*neg_pinf_index + 1][n_var + 1] = neg_sum;
+              else
+                if (npi == minus_sc_denom) {
+                  // Add the constraint `v + neg_pinf_index >= -neg_sum',
+                  // i.e., `-neg_pinf_index - v <= neg_sum'.
+                  if (neg_pinf_index < var_id)
+                    matrix[n_var][2*neg_pinf_index + 1] = neg_sum;
+                  else
+                    matrix[2*neg_pinf_index][n_var + 1] = neg_sum;
+                }
+            }
+        }
+        break;
+      }
+
+    case LESS_OR_EQUAL:
+      {
+        // Compute an upper approximation for `expr' into `sum',
+        // taking into account the sign of `denominator'.
+
+        // Approximate the inhomogeneous term.
+        assign_r(sum, sc_b, ROUND_UP);
+
+        // Approximate the homogeneous part of `sc_expr'.
+        PPL_DIRTY_TEMP(N, coeff_i);
+        PPL_DIRTY_TEMP(N, approx_i);
+        PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+        // Note: indices above `w_id' can be disregarded, as they all have
+        // a zero coefficient in `expr'.
+        for (row_iterator m_iter = m_begin,
+               m_iter_end = m_begin + (2 * w_id + 2);
+             m_iter != m_iter_end; ) {
+          const dimension_type n_i = m_iter.index();
+          const dimension_type id = n_i/2;
+          row_reference m_i = *m_iter;
+          ++m_iter;
+          row_reference m_ci = *m_iter;
+          ++m_iter;
+          const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+          const int sign_i = sgn(sc_i);
+          if (sign_i == 0)
+            continue;
+          // Choose carefully: we are approximating `sc_expr'.
+          const N& double_approx_i = (sign_i > 0) ? m_ci[n_i] : m_i[n_i + 1];
+          if (is_plus_infinity(double_approx_i)) {
+            if (++pinf_count > 1)
+              break;
+            pinf_index = id;
+            continue;
+          }
+          if (sign_i > 0)
+            assign_r(coeff_i, sc_i, ROUND_UP);
+          else {
+            neg_assign(minus_sc_i, sc_i);
+            assign_r(coeff_i, minus_sc_i, ROUND_UP);
+          }
+          div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
+          add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+        }
+        // Divide by the (sign corrected) denominator (if needed).
+        if (sc_denom != 1) {
+          // Before computing the quotient, the denominator should be
+          // approximated towards zero. Since `sc_denom' is known to be
+          // positive, this amounts to rounding downwards, which is achieved
+          // by rounding upwards `minus_sc-denom' and negating again the result.
+          PPL_DIRTY_TEMP(N, down_sc_denom);
+          assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+          neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+          div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+        }
+
+        if (pinf_count == 0) {
+          // Add the constraint `v <= sum'.
+          PPL_DIRTY_TEMP(N, double_sum);
+          mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
+          add_octagonal_constraint(n_var + 1, n_var, double_sum);
+          // Deduce constraints of the form `v +/- u', where `u != v'.
+          deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, sum);
+        }
+        else if (pinf_count == 1) {
+          dimension_type pinf_ind = 2*pinf_index;
+          if (expr.coefficient(Variable(pinf_index)) == denominator ) {
+            // Add the constraint `v - pinf_index <= sum'.
+            if (var_id < pinf_index)
+              add_octagonal_constraint(pinf_ind, n_var, sum);
+            else
+              add_octagonal_constraint(n_var + 1, pinf_ind + 1, sum);
+          }
+          else {
+            if (expr.coefficient(Variable(pinf_index)) == minus_denom) {
+              // Add the constraint `v + pinf_index <= sum'.
+              if (var_id < pinf_index)
+                add_octagonal_constraint(pinf_ind + 1, n_var, sum);
+              else
+                add_octagonal_constraint(n_var + 1, pinf_ind, sum);
+            }
+          }
+        }
+        break;
+      }
+
+    case GREATER_OR_EQUAL:
+      {
+        // Compute an upper approximation for `-sc_expr' into `sum'.
+        // Note: approximating `-sc_expr' from above and then negating the
+        // result is the same as approximating `sc_expr' from below.
+
+        // Approximate the inhomogeneous term.
+        assign_r(sum, minus_sc_b, ROUND_UP);
+
+        // Approximate the homogeneous part of `-sc_expr'.
+        PPL_DIRTY_TEMP(N, coeff_i);
+        PPL_DIRTY_TEMP(N, approx_i);
+        PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+        for (row_iterator m_iter = m_begin,
+               m_iter_end = m_begin + (2 * w_id + 2);
+             m_iter != m_iter_end; ) {
+          const dimension_type n_i = m_iter.index();
+          const dimension_type id = n_i/2;
+          row_reference m_i = *m_iter;
+          ++m_iter;
+          row_reference m_ci = *m_iter;
+          ++m_iter;
+          const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+          const int sign_i = sgn(sc_i);
+          if (sign_i == 0)
+            continue;
+          // Choose carefully: we are approximating `-sc_expr'.
+          const N& double_approx_i = (sign_i > 0) ? m_i[n_i + 1] : m_ci[n_i];
+          if (is_plus_infinity(double_approx_i)) {
+            if (++pinf_count > 1)
+              break;
+            pinf_index = id;
+            continue;
+          }
+          if (sign_i > 0)
+            assign_r(coeff_i, sc_i, ROUND_UP);
+          else {
+            neg_assign(minus_sc_i, sc_i);
+            assign_r(coeff_i, minus_sc_i, ROUND_UP);
+          }
+          div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
+          add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+        }
+
+        // Divide by the (sign corrected) denominator (if needed).
+        if (sc_denom != 1) {
+          // Before computing the quotient, the denominator should be
+          // approximated towards zero. Since `sc_denom' is known to be
+          // positive, this amounts to rounding downwards, which is
+          // achieved by rounding upwards `minus_sc_denom' and
+          // negating again the result.
+          PPL_DIRTY_TEMP(N, down_sc_denom);
+          assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+          neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+          div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+        }
+
+        if (pinf_count == 0) {
+          // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+          PPL_DIRTY_TEMP(N, double_sum);
+          mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
+          add_octagonal_constraint(n_var, n_var + 1, double_sum);
+          // Deduce constraints of the form `-v +/- u', where `u != v'.
+          deduce_minus_v_pm_u_bounds(var_id, pinf_index, sc_expr, sc_denom,
+                                     sum);
+        }
+        else if (pinf_count == 1) {
+          dimension_type pinf_ind = 2*pinf_index;
+          if (expr.coefficient(Variable(pinf_index)) == denominator) {
+            // Add the constraint `v - pinf_index >= -sum',
+            // i.e., `pinf_index - v <= sum'.
+            if (pinf_index < var_id)
+              add_octagonal_constraint(n_var, pinf_ind, sum);
+            else
+              add_octagonal_constraint(pinf_ind + 1, n_var, sum);
+          }
+          else {
+            if (expr.coefficient(Variable(pinf_index)) == minus_denom) {
+              // Add the constraint `v + pinf_index >= -sum',
+              // i.e., `-pinf_index - v <= sum'.
+              if (pinf_index < var_id)
+                add_octagonal_constraint(n_var, pinf_ind + 1, sum);
+              else
+                add_octagonal_constraint(pinf_ind, n_var + 1, sum);
+            }
+          }
+        }
+        break;
+      }
+
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::affine_image(const Variable var,
+                                 const Linear_Expression& expr,
+                                 Coefficient_traits::const_reference
+                                 denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("affine_image(v, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("affine_image(v, e, d)", "e", expr);
+
+  // `var' should be one of the dimensions of the octagon.
+  const dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("affine_image(v, e, d)", var_id + 1);
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty too.
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Variable-index of the last non-zero coefficient in `expr', if any.
+  dimension_type w_id = expr.last_nonzero();
+
+  if (w_id != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w_id))
+      ++t;
+    --w_id;
+  }
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+  using std::swap;
+
+  const dimension_type n_var = 2*var_id;
+  const Coefficient& b = expr.inhomogeneous_term();
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign_r(minus_denom, denominator, ROUND_NOT_NEEDED);
+
+  // `w' is the variable with index `w_id'.
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `expr' is of the general form.
+
+  if (t == 0) {
+    // Case 1: expr == b.
+    // Remove all constraints on `var'.
+    forget_all_octagonal_constraints(var_id);
+    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
+    two_b = 2*b;
+    // Add the constraint `var == b/denominator'.
+    add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
+    add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // The one and only non-zero homogeneous coefficient in `expr'.
+    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
+    if (w_coeff == denominator || w_coeff == minus_denom) {
+      // Case 2: expr = w_coeff*w + b, with w_coeff = +/- denominator.
+      if (w_id == var_id) {
+        // Here `expr' is of the form: +/- denominator * v + b.
+        const bool sign_symmetry = (w_coeff != denominator);
+        if (!sign_symmetry && b == 0)
+          // The transformation is the identity function.
+          return;
+        // Translate all the constraints on `var' adding or
+        // subtracting the value `b/denominator'.
+        PPL_DIRTY_TEMP(N, d);
+        div_round_up(d, b, denominator);
+        PPL_DIRTY_TEMP(N, minus_d);
+        div_round_up(minus_d, b, minus_denom);
+        if (sign_symmetry)
+          swap(d, minus_d);
+        const row_iterator m_begin = matrix.row_begin();
+        const row_iterator m_end = matrix.row_end();
+        row_iterator m_iter = m_begin + n_var;
+        row_reference m_v = *m_iter;
+        ++m_iter;
+        row_reference m_cv = *m_iter;
+        ++m_iter;
+        // NOTE: delay update of unary constraints on `var'.
+        for (dimension_type j = n_var; j-- > 0; ) {
+          N& m_v_j = m_v[j];
+          add_assign_r(m_v_j, m_v_j, minus_d, ROUND_UP);
+          N& m_cv_j = m_cv[j];
+          add_assign_r(m_cv_j, m_cv_j, d, ROUND_UP);
+          if (sign_symmetry)
+            swap(m_v_j, m_cv_j);
+        }
+        for ( ; m_iter != m_end; ++m_iter) {
+          row_reference m_i = *m_iter;
+          N& m_i_v = m_i[n_var];
+          add_assign_r(m_i_v, m_i_v, d, ROUND_UP);
+          N& m_i_cv = m_i[n_var + 1];
+          add_assign_r(m_i_cv, m_i_cv, minus_d, ROUND_UP);
+          if (sign_symmetry)
+            swap(m_i_v, m_i_cv);
+        }
+        // Now update unary constraints on var.
+        mul_2exp_assign_r(d, d, 1, ROUND_UP);
+        N& m_cv_v = m_cv[n_var];
+        add_assign_r(m_cv_v, m_cv_v, d, ROUND_UP);
+        mul_2exp_assign_r(minus_d, minus_d, 1, ROUND_UP);
+        N& m_v_cv = m_v[n_var + 1];
+        add_assign_r(m_v_cv, m_v_cv, minus_d, ROUND_UP);
+        if (sign_symmetry)
+          swap(m_cv_v, m_v_cv);
+        // Note: strong closure is preserved.
+      }
+      else {
+        // Here `w != var', so that `expr' is of the form
+        // +/-denominator * w + b.
+        // Remove all constraints on `var'.
+        forget_all_octagonal_constraints(var_id);
+        const dimension_type n_w = 2*w_id;
+        // Add the new constraint `var - w = b/denominator'.
+        if (w_coeff == denominator) {
+          if (var_id < w_id) {
+            add_octagonal_constraint(n_w, n_var, b, denominator);
+            add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
+          }
+          else {
+            add_octagonal_constraint(n_var + 1, n_w + 1, b, denominator);
+            add_octagonal_constraint(n_var, n_w, b, minus_denom);
+          }
+        }
+        else {
+          // Add the new constraint `var + w = b/denominator'.
+          if (var_id < w_id) {
+            add_octagonal_constraint(n_w + 1, n_var, b, denominator);
+            add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
+          }
+          else {
+            add_octagonal_constraint(n_var + 1, n_w, b, denominator);
+            add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
+          }
+        }
+        incremental_strong_closure_assign(var);
+      }
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t == 1, expr == a*w + b, but a <> +/- denominator.
+  // We will remove all the constraints on `var' and add back
+  // constraints providing upper and lower bounds for `var'.
+
+  // Compute upper approximations for `expr' and `-expr'
+  // into `pos_sum' and `neg_sum', respectively, taking into account
+  // the sign of `denominator'.
+  // Note: approximating `-expr' from above and then negating the
+  // result is the same as approximating `expr' from below.
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign_r(minus_b, b, ROUND_NOT_NEEDED);
+
+  const Coefficient& sc_b = is_sc ? b : minus_b;
+  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -expr;
+  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, pos_sum);
+  PPL_DIRTY_TEMP(N, neg_sum);
+  // Indices of the variables that are unbounded in `this->matrix'.
+  PPL_UNINITIALIZED(dimension_type, pos_pinf_index);
+  PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
+  // Number of unbounded variables found.
+  dimension_type pos_pinf_count = 0;
+  dimension_type neg_pinf_count = 0;
+
+  // Approximate the inhomogeneous term.
+  assign_r(pos_sum, sc_b, ROUND_UP);
+  assign_r(neg_sum, minus_sc_b, ROUND_UP);
+
+  // Approximate the homogeneous part of `sc_expr'.
+  PPL_DIRTY_TEMP(N, coeff_i);
+  PPL_DIRTY_TEMP(N, minus_coeff_i);
+  PPL_DIRTY_TEMP(N, half);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+  // Note: indices above `w' can be disregarded, as they all have
+  // a zero coefficient in `sc_expr'.
+  const row_iterator m_begin = matrix.row_begin();
+  for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
+       m_iter != m_iter_end; ) {
+    const dimension_type n_i = m_iter.index();
+    const dimension_type id = n_i/2;
+    Row_reference m_i = *m_iter;
+    ++m_iter;
+    Row_reference m_ci = *m_iter;
+    ++m_iter;
+    const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+    const int sign_i = sgn(sc_i);
+    if (sign_i > 0) {
+      assign_r(coeff_i, sc_i, ROUND_UP);
+      // Approximating `sc_expr'.
+      if (pos_pinf_count <= 1) {
+        const N& double_up_approx_i = m_ci[n_i];
+        if (!is_plus_infinity(double_up_approx_i)) {
+          // Let half = double_up_approx_i / 2.
+          div_2exp_assign_r(half, double_up_approx_i, 1, ROUND_UP);
+          add_mul_assign_r(pos_sum, coeff_i, half, ROUND_UP);
+        }
+        else {
+          ++pos_pinf_count;
+          pos_pinf_index = id;
+        }
+      }
+      // Approximating `-sc_expr'.
+      if (neg_pinf_count <= 1) {
+        const N& double_up_approx_minus_i = m_i[n_i + 1];
+        if (!is_plus_infinity(double_up_approx_minus_i)) {
+          // Let half = double_up_approx_minus_i / 2.
+          div_2exp_assign_r(half, double_up_approx_minus_i, 1, ROUND_UP);
+          add_mul_assign_r(neg_sum, coeff_i, half, ROUND_UP);
+        }
+        else {
+          ++neg_pinf_count;
+          neg_pinf_index = id;
+        }
+      }
+    }
+    else if (sign_i < 0) {
+      neg_assign_r(minus_sc_i, sc_i, ROUND_NOT_NEEDED);
+      assign_r(minus_coeff_i, minus_sc_i, ROUND_UP);
+      // Approximating `sc_expr'.
+      if (pos_pinf_count <= 1) {
+        const N& double_up_approx_minus_i = m_i[n_i + 1];
+        if (!is_plus_infinity(double_up_approx_minus_i)) {
+          // Let half = double_up_approx_minus_i / 2.
+          div_2exp_assign_r(half, double_up_approx_minus_i, 1, ROUND_UP);
+          add_mul_assign_r(pos_sum, minus_coeff_i, half, ROUND_UP);
+        }
+        else {
+          ++pos_pinf_count;
+          pos_pinf_index = id;
+        }
+      }
+      // Approximating `-sc_expr'.
+      if (neg_pinf_count <= 1) {
+        const N& double_up_approx_i = m_ci[n_i];
+        if (!is_plus_infinity(double_up_approx_i)) {
+          // Let half = double_up_approx_i / 2.
+          div_2exp_assign_r(half, double_up_approx_i, 1, ROUND_UP);
+          add_mul_assign_r(neg_sum, minus_coeff_i, half, ROUND_UP);
+        }
+        else {
+          ++neg_pinf_count;
+          neg_pinf_index = id;
+        }
+      }
+    }
+  }
+
+  // Remove all constraints on `var'.
+  forget_all_octagonal_constraints(var_id);
+  // Return immediately if no approximation could be computed.
+  if (pos_pinf_count > 1 && neg_pinf_count > 1) {
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // In the following, strong closure will be definitely lost.
+  reset_strongly_closed();
+
+  // Exploit the upper approximation, if possible.
+  if (pos_pinf_count <= 1) {
+    // Compute quotient (if needed).
+    if (sc_denom != 1) {
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(pos_sum, pos_sum, down_sc_denom, ROUND_UP);
+    }
+    // Add the upper bound constraint, if meaningful.
+    if (pos_pinf_count == 0) {
+      // Add the constraint `v <= pos_sum'.
+      PPL_DIRTY_TEMP(N, double_pos_sum);
+      mul_2exp_assign_r(double_pos_sum, pos_sum, 1, ROUND_UP);
+      matrix[n_var + 1][n_var] = double_pos_sum;
+      // Deduce constraints of the form `v +/- u', where `u != v'.
+      deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, pos_sum);
+    }
+    else
+      // Here `pos_pinf_count == 1'.
+      if (pos_pinf_index != var_id) {
+        const Coefficient& ppi = sc_expr.coefficient(Variable(pos_pinf_index));
+        if (ppi == sc_denom)
+          // Add the constraint `v - pos_pinf_index <= pos_sum'.
+          if (var_id < pos_pinf_index)
+            matrix[2*pos_pinf_index][n_var] = pos_sum;
+          else
+            matrix[n_var + 1][2*pos_pinf_index + 1] = pos_sum;
+        else
+          if (ppi == minus_sc_denom) {
+            // Add the constraint `v + pos_pinf_index <= pos_sum'.
+            if (var_id < pos_pinf_index)
+              matrix[2*pos_pinf_index + 1][n_var] = pos_sum;
+            else
+              matrix[n_var + 1][2*pos_pinf_index] = pos_sum;
+          }
+      }
+  }
+
+  // Exploit the lower approximation, if possible.
+  if (neg_pinf_count <= 1) {
+    // Compute quotient (if needed).
+    if (sc_denom != 1) {
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
+    }
+    // Add the lower bound constraint, if meaningful.
+    if (neg_pinf_count == 0) {
+      // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+      PPL_DIRTY_TEMP(N, double_neg_sum);
+      mul_2exp_assign_r(double_neg_sum, neg_sum, 1, ROUND_UP);
+      matrix[n_var][n_var + 1] = double_neg_sum;
+      // Deduce constraints of the form `-v +/- u', where `u != v'.
+      deduce_minus_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, neg_sum);
+    }
+    else
+      // Here `neg_pinf_count == 1'.
+      if (neg_pinf_index != var_id) {
+        const Coefficient& npi = sc_expr.coefficient(Variable(neg_pinf_index));
+        if (npi == sc_denom)
+          // Add the constraint `v - neg_pinf_index >= -neg_sum',
+          // i.e., `neg_pinf_index - v <= neg_sum'.
+          if (neg_pinf_index < var_id)
+            matrix[n_var][2*neg_pinf_index] = neg_sum;
+          else
+            matrix[2*neg_pinf_index + 1][n_var + 1] = neg_sum;
+        else
+          if (npi == minus_sc_denom) {
+            // Add the constraint `v + neg_pinf_index >= -neg_sum',
+            // i.e., `-neg_pinf_index - v <= neg_sum'.
+            if (neg_pinf_index < var_id)
+              matrix[n_var][2*neg_pinf_index + 1] = neg_sum;
+            else
+              matrix[2*neg_pinf_index][n_var + 1] = neg_sum;
+          }
+      }
+  }
+
+  incremental_strong_closure_assign(var);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+Octagonal_Shape<T>::affine_form_image(const Variable var,
+                    const Linear_Form< Interval<T, Interval_Info> >& lf) {
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+    "Octagonal_Shape<T>::affine_form_image(Variable, Linear_Form):"
+    " T is not a floating point type.");
+
+  // Dimension-compatibility checks.
+  // The dimension of `lf' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type lf_space_dim = lf.space_dimension();
+  if (space_dim < lf_space_dim)
+    throw_dimension_incompatible("affine_form_image(v, l)", "l", lf);
+
+  // `var' should be one of the dimensions of the octagon.
+  const dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("affine_form_image(v, l)", var.id() + 1);
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty too.
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lf': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Variable-index of the last non-zero coefficient in `lf', if any.
+  dimension_type w_id = 0;
+
+  // Get information about the number of non-zero coefficients in `lf'.
+  for (dimension_type i = lf_space_dim; i-- > 0; )
+    if (lf.coefficient(Variable(i)) != 0) {
+      if (t++ == 1)
+        break;
+      else
+        w_id = i;
+    }
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+  using std::swap;
+
+  const dimension_type n_var = 2*var_id;
+  const FP_Interval_Type& b = lf.inhomogeneous_term();
+
+  // `w' is the variable with index `w_id'.
+  // Now we know the form of `lf':
+  // - If t == 0, then lf == [lb, ub];
+  // - If t == 1, then lf == a*w + [lb, ub], where `w' can be `v' or another
+  //   variable;
+  // - If t == 2, the `lf' is of the general form.
+
+  PPL_DIRTY_TEMP(N, b_ub);
+  assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
+  PPL_DIRTY_TEMP(N, b_mlb);
+  neg_assign_r(b_mlb, b.lower(), ROUND_NOT_NEEDED);
+
+  if (t == 0) {
+    // Case 1: lf = [lb, ub].
+    forget_all_octagonal_constraints(var_id);
+    mul_2exp_assign_r(b_mlb, b_mlb, 1, ROUND_UP);
+    mul_2exp_assign_r(b_ub, b_ub, 1, ROUND_UP);
+    // Add the constraint `var >= lb && var <= ub'.
+    add_octagonal_constraint(n_var + 1, n_var, b_ub);
+    add_octagonal_constraint(n_var, n_var + 1, b_mlb);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  // True if `b' is in [0, 0].
+  bool is_b_zero = (b_mlb == 0 && b_ub == 0);
+
+  if (t == 1) {
+    // The one and only non-zero homogeneous coefficient in `lf'.
+    const FP_Interval_Type& w_coeff = lf.coefficient(Variable(w_id));
+    // True if `w_coeff' is in [1, 1].
+    bool is_w_coeff_one = (w_coeff == 1);
+    // True if `w_coeff' is in [-1, -1].
+    bool is_w_coeff_minus_one = (w_coeff == -1);
+    if (is_w_coeff_one || is_w_coeff_minus_one) {
+      // Case 2: lf = w_coeff*w + b, with w_coeff = [+/-1, +/-1].
+      if (w_id == var_id) {
+        // Here lf = w_coeff*v + b, with w_coeff = [+/-1, +/-1].
+        if (is_w_coeff_one && is_b_zero)
+          // The transformation is the identity function.
+          return;
+        // Translate all the constraints on `var' by adding the value
+        // `b_ub' or subtracting the value `b_lb'.
+        if (is_w_coeff_minus_one)
+          swap(b_ub, b_mlb);
+        const row_iterator m_begin = matrix.row_begin();
+        const row_iterator m_end = matrix.row_end();
+        row_iterator m_iter = m_begin + n_var;
+        row_reference m_v = *m_iter;
+        ++m_iter;
+        row_reference m_cv = *m_iter;
+        ++m_iter;
+        // NOTE: delay update of unary constraints on `var'.
+        for (dimension_type j = n_var; j-- > 0; ) {
+          N& m_v_j = m_v[j];
+          add_assign_r(m_v_j, m_v_j, b_mlb, ROUND_UP);
+          N& m_cv_j = m_cv[j];
+          add_assign_r(m_cv_j, m_cv_j, b_ub, ROUND_UP);
+          if (is_w_coeff_minus_one)
+            swap(m_v_j, m_cv_j);
+        }
+        for ( ; m_iter != m_end; ++m_iter) {
+          row_reference m_i = *m_iter;
+          N& m_i_v = m_i[n_var];
+          add_assign_r(m_i_v, m_i_v, b_ub, ROUND_UP);
+          N& m_i_cv = m_i[n_var + 1];
+          add_assign_r(m_i_cv, m_i_cv, b_mlb, ROUND_UP);
+          if (is_w_coeff_minus_one)
+            swap(m_i_v, m_i_cv);
+        }
+        // Now update unary constraints on var.
+        mul_2exp_assign_r(b_ub, b_ub, 1, ROUND_UP);
+        N& m_cv_v = m_cv[n_var];
+        add_assign_r(m_cv_v, m_cv_v, b_ub, ROUND_UP);
+        mul_2exp_assign_r(b_mlb, b_mlb, 1, ROUND_UP);
+        N& m_v_cv = m_v[n_var + 1];
+        add_assign_r(m_v_cv, m_v_cv, b_mlb, ROUND_UP);
+        if (is_w_coeff_minus_one)
+          swap(m_cv_v, m_v_cv);
+        // Note: strong closure is preserved.
+      }
+      else {
+        // Here `w != var', so that `lf' is of the form
+        // [+/-1, +/-1] * w + b.
+        // Remove all constraints on `var'.
+        forget_all_octagonal_constraints(var_id);
+        const dimension_type n_w = 2*w_id;
+        if (is_w_coeff_one)
+          // Add the new constraints `var - w >= b_lb'
+          // `and var - w <= b_ub'.
+          if (var_id < w_id) {
+            add_octagonal_constraint(n_w, n_var, b_ub);
+            add_octagonal_constraint(n_w + 1, n_var + 1, b_mlb);
+          }
+          else {
+            add_octagonal_constraint(n_var + 1, n_w + 1, b_ub);
+            add_octagonal_constraint(n_var, n_w, b_mlb);
+          }
+        else
+          // Add the new constraints `var + w >= b_lb'
+          // `and var + w <= b_ub'.
+          if (var_id < w_id) {
+            add_octagonal_constraint(n_w + 1, n_var, b_ub);
+            add_octagonal_constraint(n_w, n_var + 1, b_mlb);
+          }
+          else {
+            add_octagonal_constraint(n_var + 1, n_w, b_ub);
+            add_octagonal_constraint(n_var, n_w + 1, b_mlb);
+          }
+        incremental_strong_closure_assign(var);
+      }
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr == i_1*x_1 + i_2*x_2 + ... + i_n*x_n + b, where n >= 2,
+  // or t == 1, expr == i*w + b, but i <> [+/-1, +/-1].
+
+  // In the following, strong closure will be definitely lost.
+  reset_strongly_closed();
+
+  Linear_Form<FP_Interval_Type> minus_lf(lf);
+  minus_lf.negate();
+
+  // Declare temporaries outside the loop.
+  PPL_DIRTY_TEMP(N, upper_bound);
+
+  row_iterator m_iter = matrix.row_begin();
+  m_iter += n_var;
+  row_reference var_ite = *m_iter;
+  ++m_iter;
+  row_reference var_cv_ite = *m_iter;
+  ++m_iter;
+  row_iterator m_end = matrix.row_end();
+
+  // Update binary constraints on var FIRST.
+  for (dimension_type curr_var = var_id,
+         n_curr_var = n_var - 2; curr_var-- > 0; ) {
+    Variable current(curr_var);
+    linear_form_upper_bound(lf + current, upper_bound);
+    assign_r(var_cv_ite[n_curr_var], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(lf - current, upper_bound);
+    assign_r(var_cv_ite[n_curr_var + 1], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(minus_lf + current, upper_bound);
+    assign_r(var_ite[n_curr_var], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(minus_lf - current, upper_bound);
+    assign_r(var_ite[n_curr_var + 1], upper_bound, ROUND_NOT_NEEDED);
+    n_curr_var -= 2;
+  }
+  for (dimension_type curr_var = var_id + 1; m_iter != m_end; ++m_iter) {
+    row_reference m_v_ite = *m_iter;
+    ++m_iter;
+    row_reference m_cv_ite = *m_iter;
+    Variable current(curr_var);
+    linear_form_upper_bound(lf + current, upper_bound);
+    assign_r(m_cv_ite[n_var], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(lf - current, upper_bound);
+    assign_r(m_v_ite[n_var], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(minus_lf + current, upper_bound);
+    assign_r(m_cv_ite[n_var + 1], upper_bound, ROUND_NOT_NEEDED);
+    linear_form_upper_bound(minus_lf - current, upper_bound);
+    assign_r(m_v_ite[n_var + 1], upper_bound, ROUND_NOT_NEEDED);
+    ++curr_var;
+  }
+
+  // Finally, update unary constraints on var.
+  PPL_DIRTY_TEMP(N, lf_ub);
+  linear_form_upper_bound(lf, lf_ub);
+  PPL_DIRTY_TEMP(N, minus_lf_ub);
+  linear_form_upper_bound(minus_lf, minus_lf_ub);
+  mul_2exp_assign_r(lf_ub, lf_ub, 1, ROUND_UP);
+  assign_r(matrix[n_var + 1][n_var], lf_ub, ROUND_NOT_NEEDED);
+  mul_2exp_assign_r(minus_lf_ub, minus_lf_ub, 1, ROUND_UP);
+  assign_r(matrix[n_var][n_var + 1], minus_lf_ub, ROUND_NOT_NEEDED);
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename Interval_Info>
+void
+Octagonal_Shape<T>::
+linear_form_upper_bound(const Linear_Form< Interval<T, Interval_Info> >& lf,
+                        N& result) const {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                     "Octagonal_Shape<T>::linear_form_upper_bound:"
+                     " T not a floating point type.");
+
+  const dimension_type lf_space_dimension = lf.space_dimension();
+  PPL_ASSERT(lf_space_dimension <= space_dim);
+
+  typedef Interval<T, Interval_Info> FP_Interval_Type;
+
+  PPL_DIRTY_TEMP(N, curr_lb);
+  PPL_DIRTY_TEMP(N, curr_ub);
+  PPL_DIRTY_TEMP(N, curr_var_ub);
+  PPL_DIRTY_TEMP(N, curr_minus_var_ub);
+
+  PPL_DIRTY_TEMP(N, first_comparison_term);
+  PPL_DIRTY_TEMP(N, second_comparison_term);
+
+  PPL_DIRTY_TEMP(N, negator);
+
+  assign_r(result, lf.inhomogeneous_term().upper(), ROUND_NOT_NEEDED);
+
+  for (dimension_type curr_var = 0, n_var = 0; curr_var < lf_space_dimension;
+       ++curr_var) {
+    const FP_Interval_Type& curr_coefficient =
+                            lf.coefficient(Variable(curr_var));
+    assign_r(curr_lb, curr_coefficient.lower(), ROUND_NOT_NEEDED);
+    assign_r(curr_ub, curr_coefficient.upper(), ROUND_NOT_NEEDED);
+    if (curr_lb != 0 || curr_ub != 0) {
+      assign_r(curr_var_ub, matrix[n_var + 1][n_var], ROUND_NOT_NEEDED);
+      div_2exp_assign_r(curr_var_ub, curr_var_ub, 1, ROUND_UP);
+      neg_assign_r(curr_minus_var_ub, matrix[n_var][n_var + 1],
+                   ROUND_NOT_NEEDED);
+      div_2exp_assign_r(curr_minus_var_ub, curr_minus_var_ub, 1, ROUND_DOWN);
+      // Optimize the most common case: curr = +/-[1, 1].
+      if (curr_lb == 1 && curr_ub == 1) {
+        add_assign_r(result, result, std::max(curr_var_ub, curr_minus_var_ub),
+                     ROUND_UP);
+      }
+      else if (curr_lb == -1 && curr_ub == -1) {
+        neg_assign_r(negator, std::min(curr_var_ub, curr_minus_var_ub),
+                     ROUND_NOT_NEEDED);
+        add_assign_r(result, result, negator, ROUND_UP);
+      }
+      else {
+        // Next addend will be the maximum of four quantities.
+        assign_r(first_comparison_term, 0, ROUND_NOT_NEEDED);
+        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+        add_mul_assign_r(first_comparison_term, curr_var_ub, curr_ub,
+                         ROUND_UP);
+        add_mul_assign_r(second_comparison_term, curr_var_ub, curr_lb,
+                         ROUND_UP);
+        assign_r(first_comparison_term, std::max(first_comparison_term,
+                                                 second_comparison_term),
+                 ROUND_NOT_NEEDED);
+        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_ub,
+                         ROUND_UP);
+        assign_r(first_comparison_term, std::max(first_comparison_term,
+                                                 second_comparison_term),
+                 ROUND_NOT_NEEDED);
+        assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+        add_mul_assign_r(second_comparison_term, curr_minus_var_ub, curr_lb,
+                         ROUND_UP);
+        assign_r(first_comparison_term, std::max(first_comparison_term,
+                                                 second_comparison_term),
+                 ROUND_NOT_NEEDED);
+
+        add_assign_r(result, result, first_comparison_term, ROUND_UP);
+      }
+    }
+
+    n_var += 2;
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::
+interval_coefficient_upper_bound(const N& var_ub, const N& minus_var_ub,
+                                 const N& int_ub, const N& int_lb,
+                                 N& result) {
+
+  // Check that T is a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
+                     "Octagonal_Shape<T>::interval_coefficient_upper_bound:"
+                     " T not a floating point type.");
+
+  // NOTE: we store the first comparison term directly into result.
+  PPL_DIRTY_TEMP(N, second_comparison_term);
+  PPL_DIRTY_TEMP(N, third_comparison_term);
+  PPL_DIRTY_TEMP(N, fourth_comparison_term);
+
+  assign_r(result, 0, ROUND_NOT_NEEDED);
+  assign_r(second_comparison_term, 0, ROUND_NOT_NEEDED);
+  assign_r(third_comparison_term, 0, ROUND_NOT_NEEDED);
+  assign_r(fourth_comparison_term, 0, ROUND_NOT_NEEDED);
+
+  add_mul_assign_r(result, var_ub, int_ub, ROUND_UP);
+  add_mul_assign_r(second_comparison_term, minus_var_ub, int_ub, ROUND_UP);
+  add_mul_assign_r(third_comparison_term, var_ub, int_lb, ROUND_UP);
+  add_mul_assign_r(fourth_comparison_term, minus_var_ub, int_lb, ROUND_UP);
+
+  assign_r(result, std::max(result, second_comparison_term), ROUND_NOT_NEEDED);
+  assign_r(result, std::max(result, third_comparison_term), ROUND_NOT_NEEDED);
+  assign_r(result, std::max(result, fourth_comparison_term), ROUND_NOT_NEEDED);
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::affine_preimage(const Variable var,
+                                    const Linear_Expression& expr,
+                                    Coefficient_traits::const_reference
+                                    denominator) {
+
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("affine_preimage(v, e, d)", "e", expr);
+
+  // `var' should be one of the dimensions of the octagon.
+  dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("affine_preimage(v, e, d)", var_id + 1);
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty too.
+  if (marked_empty())
+    return;
+
+  const Coefficient& b = expr.inhomogeneous_term();
+
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+
+  // Variable-index of the last non-zero coefficient in `expr', if any.
+  dimension_type w_id = expr.last_nonzero();
+
+  if (w_id != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w_id))
+      ++t;
+    --w_id;
+  }
+
+  // `w' is the variable with index `w_id'.
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `expr' is of the general form.
+
+  if (t == 0) {
+    // Case 1: expr = n; remove all constraints on `var'.
+    forget_all_octagonal_constraints(var_id);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // Value of the one and only non-zero coefficient in `expr'.
+    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
+    if (w_coeff == denominator || w_coeff == -denominator) {
+      // Case 2: expr = w_coeff*w + b, with w_coeff = +/- denominator.
+      if (w_id == var_id) {
+        // Apply affine_image() on the inverse of this transformation.
+        affine_image(var, denominator*var - b, w_coeff);
+      }
+      else {
+        // `expr == w_coeff*w + b', where `w != var'.
+        // Remove all constraints on `var'.
+        forget_all_octagonal_constraints(var_id);
+        PPL_ASSERT(OK());
+      }
+      return;
+    }
+  }
+  // General case.
+  // Either t == 2, so that
+  // expr = a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t = 1, expr = a*w + b, but a <> +/- denominator.
+  const Coefficient& coeff_v = expr.coefficient(var);
+  if (coeff_v != 0) {
+    if (coeff_v > 0) {
+      // The transformation is invertible.
+      Linear_Expression inverse = ((coeff_v + denominator)*var);
+      inverse -= expr;
+      affine_image(var, inverse, coeff_v);
+    }
+    else {
+      // The transformation is invertible.
+      PPL_DIRTY_TEMP_COEFFICIENT(minus_coeff_v);
+      neg_assign(minus_coeff_v, coeff_v);
+      Linear_Expression inverse = ((minus_coeff_v - denominator)*var);
+      inverse += expr;
+      affine_image(var, inverse, minus_coeff_v);
+    }
+  }
+  else {
+    // The transformation is not invertible: all constraints on `var' are lost.
+    forget_all_octagonal_constraints(var_id);
+    PPL_ASSERT(OK());
+  }
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::generalized_affine_image(const Variable var,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression&  expr ,
+                           Coefficient_traits::const_reference denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)", "e",
+                                 expr);
+
+  // `var' should be one of the dimensions of the octagon.
+  dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
+                                 var_id + 1);
+
+  // The relation symbol cannot be a strict relation symbol.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(v, r, e, d)",
+                           "r is the disequality relation symbol");
+
+  if (relsym == EQUAL) {
+    // The relation symbol is "=":
+    // this is just an affine image computation.
+    affine_image(var, expr, denominator);
+    return;
+  }
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty too.
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Variable-index of the last non-zero coefficient in `expr', if any.
+  dimension_type w_id = expr.last_nonzero();
+
+  if (w_id != 0) {
+    ++t;
+    if (!expr.all_zeroes(1, w_id))
+      ++t;
+    --w_id;
+  }
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
+  const dimension_type n_var = 2*var_id;
+  const Coefficient& b = expr.inhomogeneous_term();
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign_r(minus_denom, denominator, ROUND_NOT_NEEDED);
+
+  // `w' is the variable with index `w_id'.
+  // Now we know the form of `expr':
+  // - If t == 0, then expr == b, with `b' a constant;
+  // - If t == 1, then expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `expr' is of the general form.
+
+  if (t == 0) {
+    // Case 1: expr = b.
+    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
+    two_b = 2*b;
+    // Remove all constraints on `var'.
+    forget_all_octagonal_constraints(var_id);
+    // Strong closure is lost.
+    reset_strongly_closed();
+    switch (relsym) {
+    case LESS_OR_EQUAL:
+      // Add the constraint `var <= b/denominator'.
+      add_octagonal_constraint(n_var + 1, n_var, two_b, denominator);
+      break;
+    case GREATER_OR_EQUAL:
+      // Add the constraint `var >= n/denominator',
+      // i.e., `-var <= -b/denominator'.
+      add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // The one and only non-zero homogeneous coefficient in `expr'.
+    const Coefficient& w_coeff = expr.coefficient(Variable(w_id));
+    if (w_coeff == denominator || w_coeff == minus_denom) {
+      // Case 2: expr == w_coeff*w + b, with w_coeff == +/- denominator.
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        {
+          PPL_DIRTY_TEMP(N, d);
+          div_round_up(d, b, denominator);
+          if (w_id == var_id) {
+            // Here `expr' is of the form: +/- denominator * v + b.
+            // Strong closure is not preserved.
+            reset_strongly_closed();
+            if (w_coeff == denominator) {
+              // Translate all the constraints of the form `v - w <= cost'
+              // into the constraint `v - w <= cost + b/denominator';
+              // forget each constraint `w - v <= cost1'.
+              row_iterator m_iter = m_begin + n_var;
+              row_reference m_v = *m_iter;
+              N& m_v_cv = m_v[n_var + 1];
+              ++m_iter;
+              row_reference m_cv = *m_iter;
+              N& m_cv_v = m_cv[n_var];
+              ++m_iter;
+              // NOTE: delay update of m_v_cv and m_cv_v.
+              for ( ; m_iter != m_end; ++m_iter) {
+                row_reference m_i = *m_iter;
+                N& m_i_v = m_i[n_var];
+                add_assign_r(m_i_v, m_i_v, d, ROUND_UP);
+                assign_r(m_i[n_var + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
+              }
+              for (dimension_type k = n_var; k-- > 0; ) {
+                assign_r(m_v[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
+                add_assign_r(m_cv[k], m_cv[k], d, ROUND_UP);
+              }
+              mul_2exp_assign_r(d, d, 1, ROUND_UP);
+              add_assign_r(m_cv_v, m_cv_v, d, ROUND_UP);
+              assign_r(m_v_cv, PLUS_INFINITY, ROUND_NOT_NEEDED);
+            }
+            else {
+              // Here `w_coeff == -denominator'.
+              // `expr' is of the form: -a*var + b.
+              N& m_v_cv = matrix[n_var][n_var + 1];
+              mul_2exp_assign_r(d, d, 1, ROUND_UP);
+              add_assign_r(matrix[n_var + 1][n_var], m_v_cv, d, ROUND_UP);
+              assign_r(m_v_cv, PLUS_INFINITY, ROUND_NOT_NEEDED);
+              forget_binary_octagonal_constraints(var_id);
+            }
+          }
+          else {
+            // Here `w != v', so that `expr' is the form
+            // +/- denominator*w + b.
+            // Remove all constraints on `v'.
+            forget_all_octagonal_constraints(var_id);
+            const dimension_type n_w = 2*w_id;
+            if (w_coeff == denominator) {
+              // Add the new constraint `v - w <= b/denominator'.
+              if (var_id < w_id)
+                add_octagonal_constraint(n_w, n_var, b, denominator);
+              else
+                add_octagonal_constraint(n_var + 1, n_w + 1, b, denominator);
+            }
+            else {
+              // Add the new constraint `v + w <= b/denominator'.
+              if (var_id < w_id)
+                add_octagonal_constraint(n_w + 1, n_var, b, denominator);
+              else
+                add_octagonal_constraint(n_var + 1, n_w, b, denominator);
+            }
+          }
+          break;
+        }
+
+      case GREATER_OR_EQUAL:
+        {
+          PPL_DIRTY_TEMP(N, d);
+          div_round_up(d, b, minus_denom);
+          if (w_id == var_id) {
+            // Here `expr' is of the form: +/- denominator * v + b.
+            // Strong closure is not preserved.
+            reset_strongly_closed();
+            if (w_coeff == denominator) {
+              // Translate each constraint `w - v <= cost'
+              // into the constraint `w - v <= cost - b/denominator';
+              // forget each constraint `v - w <= cost1'.
+              row_iterator m_iter = m_begin + n_var;
+              row_reference m_v = *m_iter;
+              N& m_v_cv = m_v[n_var + 1];
+              ++m_iter;
+              row_reference m_cv = *m_iter;
+              N& m_cv_v = m_cv[n_var];
+              ++m_iter;
+              // NOTE: delay update of m_v_cv and m_cv_v.
+              for ( ; m_iter != m_end; ++m_iter) {
+                row_reference m_i = *m_iter;
+                assign_r(m_i[n_var], PLUS_INFINITY, ROUND_NOT_NEEDED);
+                add_assign_r(m_i[n_var + 1], m_i[n_var + 1], d, ROUND_UP);
+              }
+              for (dimension_type k = n_var; k-- > 0; ) {
+                add_assign_r(m_v[k], m_v[k], d, ROUND_UP);
+                assign_r(m_cv[k], PLUS_INFINITY, ROUND_NOT_NEEDED);
+              }
+              mul_2exp_assign_r(d, d, 1, ROUND_UP);
+              add_assign_r(m_v_cv, m_v_cv, d, ROUND_UP);
+              assign_r(m_cv_v, PLUS_INFINITY, ROUND_NOT_NEEDED);
+            }
+            else {
+              // Here `w_coeff == -denominator'.
+              // `expr' is of the form: -a*var + b.
+              N& m_cv_v = matrix[n_var + 1][n_var];
+              mul_2exp_assign_r(d, d, 1, ROUND_UP);
+              add_assign_r(matrix[n_var][n_var + 1], m_cv_v, d, ROUND_UP);
+              assign_r(m_cv_v, PLUS_INFINITY, ROUND_NOT_NEEDED);
+              forget_binary_octagonal_constraints(var_id);
+            }
+          }
+          else {
+            // Here `w != v', so that `expr' is of the form
+            // +/-denominator * w + b, with `w != v'.
+            // Remove all constraints on `v'.
+            forget_all_octagonal_constraints(var_id);
+            const dimension_type n_w = 2*w_id;
+            // We have got an expression of the following form:
+            // var1 + n, with `var1' != `var'.
+            // We remove all constraints of the form `var (+/- var1) >= const'
+            // and we add the new constraint `var +/- var1 >= n/denominator'.
+            if (w_coeff == denominator) {
+              // Add the new constraint `var - w >= b/denominator',
+              // i.e., `w - var <= -b/denominator'.
+              if (var_id < w_id)
+                add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
+              else
+                add_octagonal_constraint(n_var, n_w, b, minus_denom);
+            }
+            else {
+              // Add the new constraint `var + w >= b/denominator',
+              // i.e., `-w - var <= -b/denominator'.
+              if (var_id < w_id)
+                add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
+              else
+                add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
+            }
+          }
+          break;
+        }
+
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+      PPL_ASSERT(OK());
+      return;
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t == 1, expr == a*w + b, but a <> +/- denominator.
+  // We will remove all the constraints on `v' and add back
+  // a constraint providing an upper or a lower bound for `v'
+  // (depending on `relsym').
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign(minus_b, b);
+  const Coefficient& sc_b = is_sc ? b : minus_b;
+  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -expr;
+  const Linear_Expression& sc_expr = is_sc ? expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, sum);
+  // Index of variable that is unbounded in `this->matrix'.
+  PPL_UNINITIALIZED(dimension_type, pinf_index);
+  // Number of unbounded variables found.
+  dimension_type pinf_count = 0;
+
+  switch (relsym) {
+  case LESS_OR_EQUAL:
+    {
+      // Compute an upper approximation for `sc_expr' into `sum'.
+
+      // Approximate the inhomogeneous term.
+      assign_r(sum, sc_b, ROUND_UP);
+      // Approximate the homogeneous part of `sc_expr'.
+      PPL_DIRTY_TEMP(N, coeff_i);
+      PPL_DIRTY_TEMP(N, approx_i);
+      PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+      // Note: indices above `w' can be disregarded, as they all have
+      // a zero coefficient in `sc_expr'.
+      for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
+           m_iter != m_iter_end; ) {
+        const dimension_type n_i = m_iter.index();
+        const dimension_type id = n_i/2;
+        Row_reference m_i = *m_iter;
+        ++m_iter;
+        Row_reference m_ci = *m_iter;
+        ++m_iter;
+        const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+        const int sign_i = sgn(sc_i);
+        if (sign_i == 0)
+          continue;
+        // Choose carefully: we are approximating `sc_expr'.
+        const N& double_approx_i = (sign_i > 0) ? m_ci[n_i] : m_i[n_i + 1];
+        if (is_plus_infinity(double_approx_i)) {
+          if (++pinf_count > 1)
+            break;
+          pinf_index = id;
+          continue;
+        }
+        if (sign_i > 0)
+          assign_r(coeff_i, sc_i, ROUND_UP);
+        else {
+          neg_assign(minus_sc_i, sc_i);
+          assign_r(coeff_i, minus_sc_i, ROUND_UP);
+        }
+        div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
+        add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+      }
+      // Remove all constraints on `v'.
+      forget_all_octagonal_constraints(var_id);
+      reset_strongly_closed();
+      // Return immediately if no approximation could be computed.
+      if (pinf_count > 1) {
+        PPL_ASSERT(OK());
+        return;
+      }
+
+      // Divide by the (sign corrected) denominator (if needed).
+      if (sc_denom != 1) {
+        // Before computing the quotient, the denominator should be
+        // approximated towards zero. Since `sc_denom' is known to be
+        // positive, this amounts to rounding downwards, which is
+        // achieved as usual by rounding upwards
+        // `minus_sc_denom' and negating again the result.
+        PPL_DIRTY_TEMP(N, down_sc_denom);
+        assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+        neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+        div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+      }
+
+      if (pinf_count == 0) {
+        // Add the constraint `v <= pos_sum'.
+        PPL_DIRTY_TEMP(N, double_sum);
+        mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
+        matrix[n_var + 1][n_var] = double_sum;
+        // Deduce constraints of the form `v +/- u', where `u != v'.
+        deduce_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, sum);
+      }
+      else if (pinf_count == 1)
+        if (pinf_index != var_id) {
+          const Coefficient& pi = expr.coefficient(Variable(pinf_index));
+          if (pi == denominator ) {
+            // Add the constraint `v - pinf_index <= sum'.
+            if (var_id < pinf_index)
+              matrix[2*pinf_index][n_var] = sum;
+            else
+              matrix[n_var + 1][2*pinf_index + 1] = sum;
+          }
+          else {
+            if (pi == minus_denom) {
+              // Add the constraint `v + pinf_index <= sum'.
+              if (var_id < pinf_index)
+                matrix[2*pinf_index + 1][n_var] = sum;
+              else
+                matrix[n_var + 1][2*pinf_index] = sum;
+            }
+          }
+        }
+      break;
+    }
+
+  case GREATER_OR_EQUAL:
+    {
+      // Compute an upper approximation for `-sc_expr' into `sum'.
+      // Note: approximating `-sc_expr' from above and then negating the
+      // result is the same as approximating `sc_expr' from below.
+
+      // Approximate the inhomogeneous term.
+      assign_r(sum, minus_sc_b, ROUND_UP);
+      PPL_DIRTY_TEMP(N, coeff_i);
+      PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+      PPL_DIRTY_TEMP(N, approx_i);
+      // Approximate the homogeneous part of `-sc_expr'.
+      for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
+           m_iter != m_iter_end; ) {
+        const dimension_type n_i = m_iter.index();
+        const dimension_type id = n_i/2;
+        Row_reference m_i = *m_iter;
+        ++m_iter;
+        Row_reference m_ci = *m_iter;
+        ++m_iter;
+        const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+        const int sign_i = sgn(sc_i);
+        if (sign_i == 0)
+          continue;
+        // Choose carefully: we are approximating `-sc_expr'.
+        const N& double_approx_i = (sign_i > 0) ? m_i[n_i + 1] : m_ci[n_i];
+        if (is_plus_infinity(double_approx_i)) {
+          if (++pinf_count > 1)
+            break;
+          pinf_index = id;
+          continue;
+        }
+        if (sign_i > 0)
+          assign_r(coeff_i, sc_i, ROUND_UP);
+        else {
+          neg_assign(minus_sc_i, sc_i);
+          assign_r(coeff_i, minus_sc_i, ROUND_UP);
+        }
+        div_2exp_assign_r(approx_i, double_approx_i, 1, ROUND_UP);
+        add_mul_assign_r(sum, coeff_i, approx_i, ROUND_UP);
+      }
+
+      // Remove all constraints on `var'.
+      forget_all_octagonal_constraints(var_id);
+      reset_strongly_closed();
+      // Return immediately if no approximation could be computed.
+      if (pinf_count > 1) {
+        PPL_ASSERT(OK());
+        return;
+      }
+
+      // Divide by the (sign corrected) denominator (if needed).
+      if (sc_denom != 1) {
+        // Before computing the quotient, the denominator should be
+        // approximated towards zero. Since `sc_denom' is known to be
+        // positive, this amounts to rounding downwards, which is
+        // achieved as usual by rounding upwards
+        // `minus_sc_denom' and negating again the result.
+        PPL_DIRTY_TEMP(N, down_sc_denom);
+        assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+        neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+        div_assign_r(sum, sum, down_sc_denom, ROUND_UP);
+      }
+
+      if (pinf_count == 0) {
+        // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+        PPL_DIRTY_TEMP(N, double_sum);
+        mul_2exp_assign_r(double_sum, sum, 1, ROUND_UP);
+        matrix[n_var][n_var + 1] = double_sum;
+        // Deduce constraints of the form `-v +/- u', where `u != v'.
+        deduce_minus_v_pm_u_bounds(var_id, pinf_index, sc_expr, sc_denom, sum);
+      }
+      else if (pinf_count == 1)
+        if (pinf_index != var_id) {
+          const Coefficient& pi = expr.coefficient(Variable(pinf_index));
+          if (pi == denominator) {
+            // Add the constraint `v - pinf_index >= -sum',
+            // i.e., `pinf_index - v <= sum'.
+            if (pinf_index < var_id)
+              matrix[n_var][2*pinf_index] = sum;
+            else
+              matrix[2*pinf_index + 1][n_var + 1] = sum;
+          }
+          else {
+            if (pi == minus_denom) {
+              // Add the constraint `v + pinf_index >= -sum',
+              // i.e., `-pinf_index - v <= sum'.
+              if (pinf_index < var_id)
+                matrix[n_var][2*pinf_index + 1] = sum;
+              else
+                matrix[2*pinf_index][n_var + 1] = sum;
+            }
+          }
+        }
+      break;
+    }
+
+  default:
+    // We already dealt with the other cases.
+    PPL_UNREACHABLE;
+    break;
+  }
+  incremental_strong_closure_assign(var);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::generalized_affine_image(const Linear_Expression& lhs,
+                                             const Relation_Symbol relsym,
+                                             const Linear_Expression& rhs) {
+  // Dimension-compatibility checks.
+  // The dimension of `lhs' should not be greater than the dimension
+  // of `*this'.
+  dimension_type lhs_space_dim = lhs.space_dimension();
+  if (space_dim < lhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e1", lhs);
+
+  // The dimension of `rhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type rhs_space_dim = rhs.space_dimension();
+  if (space_dim < rhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
+                                 "e2", rhs);
+
+  // Strict relation symbols are not admitted for octagons.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_image(e1, r, e2)",
+                           "r is the disequality relation symbol");
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty.
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lhs': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t_lhs = 0;
+  // Index of the last non-zero coefficient in `lhs', if any.
+  dimension_type j_lhs = lhs.last_nonzero();
+
+  if (j_lhs != 0) {
+    ++t_lhs;
+    if (!lhs.all_zeroes(1, j_lhs))
+      ++t_lhs;
+    --j_lhs;
+  }
+
+  const Coefficient& b_lhs = lhs.inhomogeneous_term();
+
+  if (t_lhs == 0) {
+    // `lhs' is a constant.
+    // In principle, it is sufficient to add the constraint `lhs relsym rhs'.
+    // Note that this constraint is an octagonal difference if `t_rhs <= 1'
+    // or `t_rhs > 1' and `rhs == a*v - a*w + b_rhs' or
+    // `rhs == a*v + a*w + b_rhs'. If `rhs' is of a
+    // more general form, it will be simply ignored.
+    // TODO: if it is not an octagonal difference, should we compute
+    // approximations for this constraint?
+    switch (relsym) {
+    case LESS_OR_EQUAL:
+      refine_no_check(lhs <= rhs);
+      break;
+    case EQUAL:
+      refine_no_check(lhs == rhs);
+      break;
+    case GREATER_OR_EQUAL:
+      refine_no_check(lhs >= rhs);
+      break;
+    default:
+      // We already dealt with the other cases.
+      PPL_UNREACHABLE;
+      break;
+    }
+  }
+
+  else if (t_lhs == 1) {
+    // Here `lhs == a_lhs * v + b_lhs'.
+    // Independently from the form of `rhs', we can exploit the
+    // method computing generalized affine images for a single variable.
+    Variable v(j_lhs);
+    // Compute a sign-corrected relation symbol.
+    const Coefficient& denom = lhs.coefficient(v);
+    Relation_Symbol new_relsym = relsym;
+    if (denom < 0) {
+      if (relsym == LESS_OR_EQUAL)
+        new_relsym = GREATER_OR_EQUAL;
+      else if (relsym == GREATER_OR_EQUAL)
+        new_relsym = LESS_OR_EQUAL;
+    }
+    Linear_Expression expr = rhs - b_lhs;
+    generalized_affine_image(v, new_relsym, expr, denom);
+  }
+  else {
+    // Here `lhs' is of the general form, having at least two variables.
+    // Compute the set of variables occurring in `lhs'.
+    std::vector<Variable> lhs_vars;
+    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
+          i != i_end; ++i)
+      lhs_vars.push_back(i.variable());
+
+    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
+    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
+      // `lhs' and `rhs' variables are disjoint.
+      // Existentially quantify all variables in the lhs.
+      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
+        dimension_type lhs_vars_i = lhs_vars[i].id();
+        forget_all_octagonal_constraints(lhs_vars_i);
+      }
+      // Constrain the left hand side expression so that it is related to
+      // the right hand side expression as dictated by `relsym'.
+      // TODO: if the following constraint is NOT an octagonal difference,
+      // it will be simply ignored. Should we compute approximations for it?
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(lhs <= rhs);
+        break;
+      case EQUAL:
+        refine_no_check(lhs == rhs);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(lhs >= rhs);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+    }
+    else {
+      // Some variables in `lhs' also occur in `rhs'.
+
+#if 1 // Simplified computation (see the TODO note below).
+
+      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
+        dimension_type lhs_vars_i = lhs_vars[i].id();
+        forget_all_octagonal_constraints(lhs_vars_i);
+      }
+
+#else // Currently unnecessarily complex computation.
+
+      // More accurate computation that is worth doing only if
+      // the following TODO note is accurately dealt with.
+
+      // To ease the computation, we add an additional dimension.
+      const Variable new_var(space_dim);
+      add_space_dimensions_and_embed(1);
+      // Constrain the new dimension to be equal to `rhs'.
+      // NOTE: calling affine_image() instead of refine_no_check()
+      // ensures some approximation is tried even when the constraint
+      // is not an octagonal constraint.
+      affine_image(new_var, rhs);
+      // Existentially quantify all variables in the lhs.
+      // NOTE: enforce strong closure for precision.
+      strong_closure_assign();
+      PPL_ASSERT(!marked_empty());
+      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
+        dimension_type lhs_vars_i = lhs_vars[i].id();
+        forget_all_octagonal_constraints(lhs_vars_i);
+      }
+      // Constrain the new dimension so that it is related to
+      // the left hand side as dictated by `relsym'.
+      // TODO: each one of the following constraints is definitely NOT
+      // an octagonal difference (since it has 3 variables at least).
+      // Thus, the method refine_no_check() will simply ignore it.
+      // Should we compute approximations for this constraint?
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(lhs <= new_var);
+        break;
+      case EQUAL:
+        refine_no_check(lhs == new_var);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(lhs >= new_var);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+      // Remove the temporarily added dimension.
+      remove_higher_space_dimensions(space_dim-1);
+#endif // Currently unnecessarily complex computation.
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::bounded_affine_image(const Variable var,
+                                         const Linear_Expression& lb_expr,
+                                         const Linear_Expression& ub_expr,
+                                         Coefficient_traits::const_reference
+                                         denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
+
+  // `var' should be one of the dimensions of the octagon.
+  const dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 var_id + 1);
+
+  // The dimension of `lb_expr' and `ub_expr' should not be
+  // greater than the dimension of `*this'.
+  const dimension_type lb_space_dim = lb_expr.space_dimension();
+  if (space_dim < lb_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "lb", lb_expr);
+  const dimension_type ub_space_dim = ub_expr.space_dimension();
+  if (space_dim < ub_space_dim)
+    throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
+                                 "ub", ub_expr);
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty too.
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lb_expr': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t = 0;
+  // Variable-index of the last non-zero coefficient in `lb_expr', if any.
+  dimension_type w_id = lb_expr.last_nonzero();
+
+  if (w_id != 0) {
+    ++t;
+    if (!lb_expr.all_zeroes(1, w_id))
+      ++t;
+    --w_id;
+  }
+
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const dimension_type n_var = 2*var_id;
+  const Coefficient& b = lb_expr.inhomogeneous_term();
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
+  neg_assign_r(minus_denom, denominator, ROUND_NOT_NEEDED);
+
+  // `w' is the variable with index `w_id'.
+  // Now we know the form of `lb_expr':
+  // - If t == 0, then lb_expr == b, with `b' a constant;
+  // - If t == 1, then lb_expr == a*w + b, where `w' can be `v' or another
+  //   variable; in this second case we have to check whether `a' is
+  //   equal to `denominator' or `-denominator', since otherwise we have
+  //   to fall back on the general form;
+  // - If t == 2, the `lb_expr' is of the general form.
+
+  if (t == 0) {
+    // Case 1: lb_expr == b.
+    generalized_affine_image(var,
+                             LESS_OR_EQUAL,
+                             ub_expr,
+                             denominator);
+    PPL_DIRTY_TEMP_COEFFICIENT(two_b);
+    two_b = 2*b;
+    // Add the constraint `var >= b/denominator'.
+    add_octagonal_constraint(n_var, n_var + 1, two_b, minus_denom);
+    PPL_ASSERT(OK());
+    return;
+  }
+
+  if (t == 1) {
+    // The one and only non-zero homogeneous coefficient in `lb_expr'.
+    const Coefficient& w_coeff = lb_expr.coefficient(Variable(w_id));
+    if (w_coeff == denominator || w_coeff == minus_denom) {
+      // Case 2: lb_expr = w_coeff*w + b, with w_coeff = +/- denominator.
+      if (w_id == var_id) {
+        // Here `var' occurs in `lb_expr'.
+        // To ease the computation, we add an additional dimension.
+        const Variable new_var(space_dim);
+        add_space_dimensions_and_embed(1);
+        // Constrain the new dimension to be equal to `lb_expr'.
+        // Here `lb_expr' is of the form: +/- denominator * v + b.
+        affine_image(new_var, lb_expr, denominator);
+        // Enforce the strong closure for precision.
+        strong_closure_assign();
+        PPL_ASSERT(!marked_empty());
+        // Apply the affine upper bound.
+        generalized_affine_image(var,
+                                 LESS_OR_EQUAL,
+                                 ub_expr,
+                                 denominator);
+        // Now apply the affine lower bound, as recorded in `new_var'
+        refine_no_check(var >= new_var);
+        // Remove the temporarily added dimension.
+        remove_higher_space_dimensions(space_dim-1);
+        return;
+      }
+      else {
+        // Apply the affine upper bound.
+        generalized_affine_image(var,
+                                 LESS_OR_EQUAL,
+                                 ub_expr,
+                                 denominator);
+        // Here `w != var', so that `lb_expr' is of the form
+        // +/-denominator * w + b.
+        const dimension_type n_w = 2*w_id;
+        // Add the new constraint `var - w >= b/denominator'.
+        if (w_coeff == denominator)
+          if (var_id < w_id)
+            add_octagonal_constraint(n_w + 1, n_var + 1, b, minus_denom);
+          else
+            add_octagonal_constraint(n_var, n_w, b, minus_denom);
+        else {
+          // Add the new constraint `var + w >= b/denominator'.
+          if (var_id < w_id)
+            add_octagonal_constraint(n_w, n_var + 1, b, minus_denom);
+          else
+            add_octagonal_constraint(n_var, n_w + 1, b, minus_denom);
+        }
+        PPL_ASSERT(OK());
+        return;
+      }
+    }
+  }
+
+  // General case.
+  // Either t == 2, so that
+  // expr == a_1*x_1 + a_2*x_2 + ... + a_n*x_n + b, where n >= 2,
+  // or t == 1, expr == a*w + b, but a <> +/- denominator.
+  // We will remove all the constraints on `var' and add back
+  // constraints providing upper and lower bounds for `var'.
+
+  // Compute upper approximations for `expr' and `-expr'
+  // into `pos_sum' and `neg_sum', respectively, taking into account
+  // the sign of `denominator'.
+  // Note: approximating `-expr' from above and then negating the
+  // result is the same as approximating `expr' from below.
+  const bool is_sc = (denominator > 0);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_b);
+  neg_assign_r(minus_b, b, ROUND_NOT_NEEDED);
+
+  const Coefficient& minus_sc_b = is_sc ? minus_b : b;
+  const Coefficient& sc_denom = is_sc ? denominator : minus_denom;
+  const Coefficient& minus_sc_denom = is_sc ? minus_denom : denominator;
+  // NOTE: here, for optimization purposes, `minus_expr' is only assigned
+  // when `denominator' is negative. Do not use it unless you are sure
+  // it has been correctly assigned.
+  Linear_Expression minus_expr;
+  if (!is_sc)
+    minus_expr = -lb_expr;
+  const Linear_Expression& sc_expr = is_sc ? lb_expr : minus_expr;
+
+  PPL_DIRTY_TEMP(N, neg_sum);
+  // Indices of the variables that are unbounded in `this->matrix'.
+  PPL_UNINITIALIZED(dimension_type, neg_pinf_index);
+  // Number of unbounded variables found.
+  dimension_type neg_pinf_count = 0;
+
+  // Approximate the inhomogeneous term.
+  assign_r(neg_sum, minus_sc_b, ROUND_UP);
+
+  // Approximate the homogeneous part of `sc_expr'.
+  PPL_DIRTY_TEMP(N, coeff_i);
+  PPL_DIRTY_TEMP(N, minus_coeff_i);
+  PPL_DIRTY_TEMP(N, half);
+  PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
+  // Note: indices above `w' can be disregarded, as they all have
+  // a zero coefficient in `sc_expr'.
+  for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
+       m_iter != m_iter_end; ) {
+    const dimension_type n_i = m_iter.index();
+    const dimension_type id = n_i/2;
+    Row_reference m_i = *m_iter;
+    ++m_iter;
+    Row_reference m_ci = *m_iter;
+    ++m_iter;
+    const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
+    const int sign_i = sgn(sc_i);
+    if (sign_i > 0) {
+      assign_r(coeff_i, sc_i, ROUND_UP);
+      // Approximating `-sc_expr'.
+      if (neg_pinf_count <= 1) {
+        const N& double_up_approx_minus_i = m_i[n_i + 1];
+        if (!is_plus_infinity(double_up_approx_minus_i)) {
+          // Let half = double_up_approx_minus_i / 2.
+          div_2exp_assign_r(half, double_up_approx_minus_i, 1, ROUND_UP);
+          add_mul_assign_r(neg_sum, coeff_i, half, ROUND_UP);
+        }
+        else {
+          ++neg_pinf_count;
+          neg_pinf_index = id;
+        }
+      }
+    }
+    else if (sign_i < 0) {
+      neg_assign_r(minus_sc_i, sc_i, ROUND_NOT_NEEDED);
+      assign_r(minus_coeff_i, minus_sc_i, ROUND_UP);
+      // Approximating `-sc_expr'.
+      if (neg_pinf_count <= 1) {
+        const N& double_up_approx_i = m_ci[n_i];
+        if (!is_plus_infinity(double_up_approx_i)) {
+          // Let half = double_up_approx_i / 2.
+          div_2exp_assign_r(half, double_up_approx_i, 1, ROUND_UP);
+          add_mul_assign_r(neg_sum, minus_coeff_i, half, ROUND_UP);
+        }
+        else {
+          ++neg_pinf_count;
+          neg_pinf_index = id;
+        }
+      }
+    }
+  }
+
+  // Apply the affine upper bound.
+  generalized_affine_image(var,
+                           LESS_OR_EQUAL,
+                           ub_expr,
+                           denominator);
+
+  // Return immediately if no approximation could be computed.
+  if (neg_pinf_count > 1) {
+    return;
+  }
+
+  // In the following, strong closure will be definitely lost.
+  reset_strongly_closed();
+
+  // Exploit the lower approximation, if possible.
+  if (neg_pinf_count <= 1) {
+    // Compute quotient (if needed).
+    if (sc_denom != 1) {
+      // Before computing quotients, the denominator should be approximated
+      // towards zero. Since `sc_denom' is known to be positive, this amounts to
+      // rounding downwards, which is achieved as usual by rounding upwards
+      // `minus_sc_denom' and negating again the result.
+      PPL_DIRTY_TEMP(N, down_sc_denom);
+      assign_r(down_sc_denom, minus_sc_denom, ROUND_UP);
+      neg_assign_r(down_sc_denom, down_sc_denom, ROUND_UP);
+      div_assign_r(neg_sum, neg_sum, down_sc_denom, ROUND_UP);
+    }
+    // Add the lower bound constraint, if meaningful.
+    if (neg_pinf_count == 0) {
+      // Add the constraint `v >= -neg_sum', i.e., `-v <= neg_sum'.
+      PPL_DIRTY_TEMP(N, double_neg_sum);
+      mul_2exp_assign_r(double_neg_sum, neg_sum, 1, ROUND_UP);
+      matrix[n_var][n_var + 1] = double_neg_sum;
+      // Deduce constraints of the form `-v +/- u', where `u != v'.
+      deduce_minus_v_pm_u_bounds(var_id, w_id, sc_expr, sc_denom, neg_sum);
+    }
+    else
+      // Here `neg_pinf_count == 1'.
+      if (neg_pinf_index != var_id) {
+        const Coefficient& npi = sc_expr.coefficient(Variable(neg_pinf_index));
+        if (npi == sc_denom)
+          // Add the constraint `v - neg_pinf_index >= -neg_sum',
+          // i.e., `neg_pinf_index - v <= neg_sum'.
+          if (neg_pinf_index < var_id)
+            matrix[n_var][2*neg_pinf_index] = neg_sum;
+          else
+            matrix[2*neg_pinf_index + 1][n_var + 1] = neg_sum;
+        else
+          if (npi == minus_sc_denom) {
+            // Add the constraint `v + neg_pinf_index >= -neg_sum',
+            // i.e., `-neg_pinf_index - v <= neg_sum'.
+            if (neg_pinf_index < var_id)
+              matrix[n_var][2*neg_pinf_index + 1] = neg_sum;
+            else
+              matrix[2*neg_pinf_index][n_var + 1] = neg_sum;
+          }
+      }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::generalized_affine_preimage(const Variable var,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference
+                              denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)", "d == 0");
+
+  // Dimension-compatibility checks.
+  // The dimension of `expr' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type expr_space_dim = expr.space_dimension();
+  if (space_dim < expr_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
+                                 "e", expr);
+
+  // `var' should be one of the dimensions of the octagon.
+  const dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
+                                 var_id + 1);
+
+  // The relation symbol cannot be a strict relation symbol.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
+                           "r is the disequality relation symbol");
+
+  if (relsym == EQUAL) {
+    // The relation symbol is "=":
+    // this is just an affine preimage computation.
+    affine_preimage(var, expr, denominator);
+    return;
+  }
+
+  // The image of an empty octagon is empty too.
+  strong_closure_assign();
+  if (marked_empty())
+    return;
+
+  // Check whether the preimage of this affine relation can be easily
+  // computed as the image of its inverse relation.
+  const Coefficient& expr_v = expr.coefficient(var);
+  if (expr_v != 0) {
+    const Relation_Symbol reversed_relsym = (relsym == LESS_OR_EQUAL)
+      ? GREATER_OR_EQUAL : LESS_OR_EQUAL;
+    const Linear_Expression inverse
+      = expr - (expr_v + denominator)*var;
+    PPL_DIRTY_TEMP_COEFFICIENT(inverse_denom);
+    neg_assign(inverse_denom, expr_v);
+    const Relation_Symbol inverse_relsym
+      = (sgn(denominator) == sgn(inverse_denom)) ? relsym : reversed_relsym;
+    generalized_affine_image(var, inverse_relsym, inverse, inverse_denom);
+    return;
+  }
+
+  // Here `var_coefficient == 0', so that the preimage cannot
+  // be easily computed by inverting the affine relation.
+  // Shrink the Octagonal_Shape by adding the constraint induced
+  // by the affine relation.
+  refine(var, relsym, expr, denominator);
+
+  // If the shrunk OS is empty, its preimage is empty too; ...
+  if (is_empty())
+    return;
+  // ...  otherwise, since the relation was not invertible,
+  // we just forget all constraints on `var'.
+  forget_all_octagonal_constraints(var_id);
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::generalized_affine_preimage(const Linear_Expression& lhs,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& rhs) {
+  // Dimension-compatibility checks.
+  // The dimension of `lhs' should not be greater than the dimension
+  // of `*this'.
+  dimension_type lhs_space_dim = lhs.space_dimension();
+  if (space_dim < lhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
+                                 "e1", lhs);
+
+  // The dimension of `rhs' should not be greater than the dimension
+  // of `*this'.
+  const dimension_type rhs_space_dim = rhs.space_dimension();
+  if (space_dim < rhs_space_dim)
+    throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
+                                 "e2", rhs);
+
+  // Strict relation symbols are not admitted for octagons.
+  if (relsym == LESS_THAN || relsym == GREATER_THAN)
+    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
+                           "r is a strict relation symbol");
+  // The relation symbol cannot be a disequality.
+  if (relsym == NOT_EQUAL)
+    throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
+                           "r is the disequality relation symbol");
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty.
+  if (marked_empty())
+    return;
+
+  // Number of non-zero coefficients in `lhs': will be set to
+  // 0, 1, or 2, the latter value meaning any value greater than 1.
+  dimension_type t_lhs = 0;
+  // Index of the last non-zero coefficient in `lhs', if any.
+  dimension_type j_lhs = lhs.last_nonzero();
+
+  if (j_lhs != 0) {
+    ++t_lhs;
+    if (!lhs.all_zeroes(1, j_lhs))
+      ++t_lhs;
+    j_lhs--;
+  }
+
+  const Coefficient& b_lhs = lhs.inhomogeneous_term();
+
+  // If all variables have a zero coefficient, then `lhs' is a constant:
+  // in this case, preimage and image happen to be the same.
+  if (t_lhs == 0) {
+    generalized_affine_image(lhs, relsym, rhs);
+    return;
+  }
+
+  else if (t_lhs == 1) {
+    // Here `lhs == a_lhs * v + b_lhs'.
+    // Independently from the form of `rhs', we can exploit the
+    // method computing generalized affine preimages for a single variable.
+    Variable v(j_lhs);
+    // Compute a sign-corrected relation symbol.
+    const Coefficient& denom = lhs.coefficient(v);
+    Relation_Symbol new_relsym = relsym;
+    if (denom < 0) {
+      if (relsym == LESS_OR_EQUAL)
+        new_relsym = GREATER_OR_EQUAL;
+      else if (relsym == GREATER_OR_EQUAL)
+        new_relsym = LESS_OR_EQUAL;
+    }
+    Linear_Expression expr = rhs - b_lhs;
+    generalized_affine_preimage(v, new_relsym, expr, denom);
+  }
+
+  else {
+    // Here `lhs' is of the general form, having at least two variables.
+    // Compute the set of variables occurring in `lhs'.
+    std::vector<Variable> lhs_vars;
+    for (Linear_Expression::const_iterator i = lhs.begin(), i_end = lhs.end();
+          i != i_end; ++i)
+      lhs_vars.push_back(i.variable());
+
+    const dimension_type num_common_dims = std::min(lhs_space_dim, rhs_space_dim);
+    if (!lhs.have_a_common_variable(rhs, Variable(0), Variable(num_common_dims))) {
+      // `lhs' and `rhs' variables are disjoint.
+      // Constrain the left hand side expression so that it is related to
+      // the right hand side expression as dictated by `relsym'.
+      // TODO: if the following constraint is NOT an octagonal difference,
+      // it will be simply ignored. Should we compute approximations for it?
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(lhs <= rhs);
+        break;
+      case EQUAL:
+        refine_no_check(lhs == rhs);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(lhs >= rhs);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+
+      // Any image of an empty octagon is empty.
+      if (is_empty())
+        return;
+      // Existentially quantify all variables in the lhs.
+      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
+        dimension_type lhs_vars_i = lhs_vars[i].id();
+        forget_all_octagonal_constraints(lhs_vars_i);
+      }
+    }
+    else {
+      // Some variables in `lhs' also occur in `rhs'.
+
+      // More accurate computation that is worth doing only if
+      // the following TODO note is accurately dealt with.
+
+      // To ease the computation, we add an additional dimension.
+      const Variable new_var(space_dim);
+      add_space_dimensions_and_embed(1);
+      // Constrain the new dimension to be equal to `rhs'.
+      // NOTE: calling affine_image() instead of refine_no_check()
+      // ensures some approximation is tried even when the constraint
+      // is not an octagonal difference.
+      affine_image(new_var, lhs);
+      // Existentially quantify all variables in the lhs.
+      // NOTE: enforce strong closure for precision.
+      strong_closure_assign();
+      PPL_ASSERT(!marked_empty());
+      for (dimension_type i = lhs_vars.size(); i-- > 0; ) {
+        dimension_type lhs_vars_i = lhs_vars[i].id();
+        forget_all_octagonal_constraints(lhs_vars_i);
+      }
+      // Constrain the new dimension so that it is related to
+      // the left hand side as dictated by `relsym'.
+      // Note: if `rhs == v + b_rhs' or `rhs == -v + b_rhs' or `rhs == b_rhs',
+      // one of the following constraints will be added, because they
+      // are octagonal differences.
+      // Else the following constraints are NOT octagonal differences,
+      // so the method refine_no_check() will ignore them.
+      switch (relsym) {
+      case LESS_OR_EQUAL:
+        refine_no_check(new_var <= rhs);
+        break;
+      case EQUAL:
+        refine_no_check(new_var == rhs);
+        break;
+      case GREATER_OR_EQUAL:
+        refine_no_check(new_var >= rhs);
+        break;
+      default:
+        // We already dealt with the other cases.
+        PPL_UNREACHABLE;
+        break;
+      }
+      // Remove the temporarily added dimension.
+      remove_higher_space_dimensions(space_dim-1);
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::bounded_affine_preimage(const Variable var,
+                                            const Linear_Expression& lb_expr,
+                                            const Linear_Expression& ub_expr,
+                                            Coefficient_traits::const_reference
+                                            denominator) {
+  // The denominator cannot be zero.
+  if (denominator == 0)
+    throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
+
+  // `var' should be one of the dimensions of the octagon.
+  const dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 var_id + 1);
+
+  // The dimension of `lb_expr' and `ub_expr' should not be
+  // greater than the dimension of `*this'.
+  const dimension_type lb_space_dim = lb_expr.space_dimension();
+  if (space_dim < lb_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "lb", lb_expr);
+  const dimension_type ub_space_dim = ub_expr.space_dimension();
+  if (space_dim < ub_space_dim)
+    throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
+                                 "ub", ub_expr);
+
+  strong_closure_assign();
+  // The image of an empty octagon is empty too.
+  if (marked_empty())
+    return;
+
+  if (ub_expr.coefficient(var) == 0) {
+    refine(var, LESS_OR_EQUAL, ub_expr, denominator);
+    generalized_affine_preimage(var, GREATER_OR_EQUAL,
+                                lb_expr, denominator);
+    return;
+  }
+  if (lb_expr.coefficient(var) == 0) {
+    refine(var, GREATER_OR_EQUAL, lb_expr, denominator);
+    generalized_affine_preimage(var, LESS_OR_EQUAL,
+                                ub_expr, denominator);
+    return;
+  }
+
+  const Coefficient& expr_v = lb_expr.coefficient(var);
+  // Here `var' occurs in `lb_expr' and `ub_expr'.
+  // To ease the computation, we add an additional dimension.
+  const Variable new_var(space_dim);
+  add_space_dimensions_and_embed(1);
+  const Linear_Expression lb_inverse
+    = lb_expr - (expr_v + denominator)*var;
+  PPL_DIRTY_TEMP_COEFFICIENT(inverse_denom);
+  neg_assign(inverse_denom, expr_v);
+  affine_image(new_var, lb_inverse, inverse_denom);
+  strong_closure_assign();
+  PPL_ASSERT(!marked_empty());
+  generalized_affine_preimage(var, LESS_OR_EQUAL,
+                              ub_expr, denominator);
+  if (sgn(denominator) == sgn(inverse_denom))
+    refine_no_check(var >= new_var) ;
+  else
+    refine_no_check(var <= new_var);
+  // Remove the temporarily added dimension.
+  remove_higher_space_dimensions(space_dim-1);
+}
+
+template <typename T>
+Constraint_System
+Octagonal_Shape<T>::constraints() const {
+  const dimension_type space_dim = space_dimension();
+  Constraint_System cs;
+  cs.set_space_dimension(space_dim);
+
+  if (space_dim == 0) {
+    if (marked_empty())
+      cs = Constraint_System::zero_dim_empty();
+    return cs;
+  }
+
+  if (marked_empty()) {
+    cs.insert(Constraint::zero_dim_false());
+    return cs;
+  }
+
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+
+  row_iterator m_begin = matrix.row_begin();
+  row_iterator m_end = matrix.row_end();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(a);
+  PPL_DIRTY_TEMP_COEFFICIENT(b);
+
+  // Go through all the unary constraints in `matrix'.
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
+    const dimension_type i = i_iter.index();
+    const Variable x(i/2);
+    const N& c_i_ii = (*i_iter)[i + 1];
+    ++i_iter;
+    const N& c_ii_i = (*i_iter)[i];
+    ++i_iter;
+    // Go through unary constraints.
+    if (is_additive_inverse(c_i_ii, c_ii_i)) {
+      // We have a unary equality constraint.
+      numer_denom(c_ii_i, b, a);
+      a *= 2;
+      cs.insert(a*x == b);
+    }
+    else {
+      // We have 0, 1 or 2 inequality constraints.
+      if (!is_plus_infinity(c_i_ii)) {
+        numer_denom(c_i_ii, b, a);
+        a *= 2;
+        cs.insert(-a*x <= b);
+      }
+      if (!is_plus_infinity(c_ii_i)) {
+        numer_denom(c_ii_i, b, a);
+        a *= 2;
+        cs.insert(a*x <= b);
+      }
+    }
+  }
+  //  Go through all the binary constraints in `matrix'.
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
+    const dimension_type i = i_iter.index();
+    row_reference r_i = *i_iter;
+    ++i_iter;
+    row_reference r_ii = *i_iter;
+    ++i_iter;
+    const Variable y(i/2);
+    for (dimension_type j = 0; j < i; j += 2) {
+      const N& c_i_j = r_i[j];
+      const N& c_ii_jj = r_ii[j + 1];
+      const Variable x(j/2);
+      if (is_additive_inverse(c_ii_jj, c_i_j)) {
+        // We have an equality constraint of the form a*x - a*y = b.
+        numer_denom(c_i_j, b, a);
+        cs.insert(a*x - a*y == b);
+      }
+      else {
+        // We have 0, 1 or 2 inequality constraints.
+        if (!is_plus_infinity(c_i_j)) {
+          numer_denom(c_i_j, b, a);
+          cs.insert(a*x - a*y <= b);
+        }
+        if (!is_plus_infinity(c_ii_jj)) {
+          numer_denom(c_ii_jj, b, a);
+          cs.insert(a*y - a*x <= b);
+        }
+      }
+
+      const N& c_ii_j = r_ii[j];
+      const N& c_i_jj = r_i[j + 1];
+      if (is_additive_inverse(c_i_jj, c_ii_j)) {
+        // We have an equality constraint of the form a*x + a*y = b.
+        numer_denom(c_ii_j, b, a);
+        cs.insert(a*x + a*y == b);
+      }
+      else {
+        // We have 0, 1 or 2 inequality constraints.
+        if (!is_plus_infinity(c_i_jj)) {
+          numer_denom(c_i_jj, b, a);
+          cs.insert(-a*x - a*y <= b);
+        }
+        if (!is_plus_infinity(c_ii_j)) {
+          numer_denom(c_ii_j, b, a);
+          cs.insert(a*x + a*y <= b);
+        }
+      }
+    }
+  }
+  return cs;
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::expand_space_dimension(Variable var, dimension_type m) {
+  // `var' should be one of the dimensions of the vector space.
+  const dimension_type var_id = var.id();
+  if (var_id + 1 > space_dim)
+    throw_dimension_incompatible("expand_space_dimension(v, m)", var_id + 1);
+
+  // The space dimension of the resulting octagon should not
+  // overflow the maximum allowed space dimension.
+  if (m > max_space_dimension() - space_dim)
+    throw_invalid_argument("expand_dimension(v, m)",
+                           "adding m new space dimensions exceeds "
+                           "the maximum allowed space dimension");
+
+  // Nothing to do, if no dimensions must be added.
+  if (m == 0)
+    return;
+
+  // Keep track of the dimension before adding the new ones.
+  const dimension_type old_num_rows = matrix.num_rows();
+
+  // Add the required new dimensions.
+  add_space_dimensions_and_embed(m);
+
+  // For each constraints involving variable `var', we add a
+  // similar constraint with the new variable substituted for
+  // variable `var'.
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
+  const dimension_type n_var = 2*var_id;
+  Row_iterator v_iter = m_begin + n_var;
+  Row_reference m_v = *v_iter;
+  Row_reference m_cv = *(v_iter + 1);
+
+  for (row_iterator i_iter = m_begin + old_num_rows; i_iter != m_end;
+       i_iter += 2) {
+    row_reference m_i = *i_iter;
+    row_reference m_ci = *(i_iter + 1);
+    const dimension_type i = i_iter.index();
+    const dimension_type ci = i + 1;
+    m_i[ci] = m_v[n_var + 1];
+    m_ci[i] = m_cv[n_var];
+    for (dimension_type j = 0; j < n_var; ++j) {
+      m_i[j] = m_v[j];
+      m_ci[j] = m_cv[j];
+    }
+    for (dimension_type j = n_var + 2; j < old_num_rows; ++j) {
+      row_iterator j_iter = m_begin + j;
+      row_reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
+      m_i[j] = m_cj[n_var + 1];
+      m_ci[j] = m_cj[n_var];
+    }
+  }
+  // In general, adding a constraint does not preserve the strong closure
+  // of the octagon.
+  if (marked_strongly_closed())
+    reset_strongly_closed();
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
+                                          Variable dest) {
+  // `dest' should be one of the dimensions of the octagon.
+  if (dest.space_dimension() > space_dim)
+    throw_dimension_incompatible("fold_space_dimensions(vs, v)", "v", dest);
+
+  // The folding of no dimensions is a no-op.
+  if (vars.empty())
+    return;
+
+  // All variables in `vars' should be dimensions of the octagon.
+  if (vars.space_dimension() > space_dim)
+    throw_dimension_incompatible("fold_space_dimensions(vs, v)",
+                                 vars.space_dimension());
+
+  // Moreover, `dest.id()' should not occur in `vars'.
+  if (vars.find(dest.id()) != vars.end())
+    throw_invalid_argument("fold_space_dimensions(vs, v)",
+                           "v should not occur in vs");
+
+  // Recompute the elements of the row and the column corresponding
+  // to variable `dest' by taking the join of their value with the
+  // value of the corresponding elements in the row and column of the
+  // variable `vars'.
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+
+  const row_iterator m_begin = matrix.row_begin();
+
+  strong_closure_assign();
+  const dimension_type n_rows = matrix.num_rows();
+  const dimension_type n_dest = 2*dest.id();
+  row_iterator v_iter = m_begin + n_dest;
+  row_reference m_v = *v_iter;
+  row_reference m_cv = *(v_iter + 1);
+  for (Variables_Set::const_iterator i = vars.begin(),
+         vs_end = vars.end(); i != vs_end; ++i) {
+    const dimension_type tbf_id = *i;
+    const dimension_type tbf_var = 2*tbf_id;
+    row_iterator tbf_iter = m_begin + tbf_var;
+    row_reference m_tbf = *tbf_iter;
+    row_reference m_ctbf = *(tbf_iter + 1);
+    max_assign(m_v[n_dest + 1], m_tbf[tbf_var + 1]);
+    max_assign(m_cv[n_dest], m_ctbf[tbf_var]);
+
+    const dimension_type min_id = std::min(n_dest, tbf_var);
+    const dimension_type max_id = std::max(n_dest, tbf_var);
+
+    using namespace Implementation::Octagonal_Shapes;
+    for (dimension_type j = 0; j < min_id; ++j) {
+      const dimension_type cj = coherent_index(j);
+      max_assign(m_v[j], m_tbf[j]);
+      max_assign(m_cv[j], m_ctbf[j]);
+      max_assign(m_cv[cj], m_ctbf[cj]);
+      max_assign(m_v[cj], m_tbf[cj]);
+    }
+    for (dimension_type j = min_id + 2; j < max_id; ++j) {
+      const dimension_type cj = coherent_index(j);
+      row_iterator j_iter = m_begin + j;
+      row_reference m_j = *j_iter;
+      row_reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
+      if (n_dest == min_id) {
+        max_assign(m_cj[n_dest + 1], m_tbf[j]);
+        max_assign(m_cj[n_dest], m_ctbf[j]);
+        max_assign(m_j[n_dest], m_ctbf[cj]);
+        max_assign(m_j[n_dest + 1], m_tbf[cj]);
+      }
+      else {
+        max_assign(m_v[j], m_cj[tbf_var + 1]);
+        max_assign(m_cv[j], m_cj[tbf_var]);
+        max_assign(m_cv[cj], m_j[tbf_var]);
+        max_assign(m_v[cj], m_j[tbf_var + 1]);
+      }
+    }
+    for (dimension_type j = max_id + 2; j < n_rows; ++j) {
+      row_iterator j_iter = m_begin + j;
+      row_reference m_j = *j_iter;
+      row_reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
+      max_assign(m_cj[n_dest + 1], m_cj[tbf_var + 1]);
+      max_assign(m_cj[n_dest], m_cj[tbf_var]);
+      max_assign(m_j[n_dest], m_j[tbf_var]);
+      max_assign(m_j[n_dest + 1], m_j[tbf_var + 1]);
+    }
+  }
+  remove_space_dimensions(vars);
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::upper_bound_assign_if_exact(const Octagonal_Shape& y) {
+  // FIXME, CHECKME: what about inexact computations?
+
+  // Declare a const reference to *this (to avoid accidental modifications).
+  const Octagonal_Shape& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+
+  if (x_space_dim != y.space_dimension())
+    throw_dimension_incompatible("upper_bound_assign_if_exact(y)", y);
+
+  // The zero-dim case is trivial.
+  if (x_space_dim == 0) {
+    upper_bound_assign(y);
+    return true;
+  }
+  // If `x' or `y' is (known to be) empty, the upper bound is exact.
+  if (x.marked_empty()) {
+    *this = y;
+    return true;
+  }
+  else if (y.is_empty())
+    return true;
+  else if (x.is_empty()) {
+    *this = y;
+    return true;
+  }
+
+  // Here both `x' and `y' are known to be non-empty.
+  PPL_ASSERT(x.marked_strongly_closed());
+  PPL_ASSERT(y.marked_strongly_closed());
+  // Pre-compute the upper bound of `x' and `y'.
+  Octagonal_Shape<T> ub(x);
+  ub.upper_bound_assign(y);
+
+  // Compute redundancy information for x and y.
+  // TODO: provide a nicer data structure for redundancy.
+  std::vector<Bit_Row> x_non_red;
+  x.non_redundant_matrix_entries(x_non_red);
+  std::vector<Bit_Row> y_non_red;
+  y.non_redundant_matrix_entries(y_non_red);
+
+  PPL_DIRTY_TEMP(N, lhs);
+  PPL_DIRTY_TEMP(N, lhs_copy);
+  PPL_DIRTY_TEMP(N, rhs);
+  PPL_DIRTY_TEMP(N, temp_zero);
+  assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
+
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+  const dimension_type n_rows = x.matrix.num_rows();
+  const row_iterator x_m_begin = x.matrix.row_begin();
+  const row_iterator y_m_begin = y.matrix.row_begin();
+  const row_iterator ub_m_begin = ub.matrix.row_begin();
+
+  for (dimension_type i = n_rows; i-- > 0; ) {
+    const Bit_Row& x_non_red_i = x_non_red[i];
+    using namespace Implementation::Octagonal_Shapes;
+    const dimension_type ci = coherent_index(i);
+    const dimension_type row_size_i = OR_Matrix<N>::row_size(i);
+    row_reference x_i = *(x_m_begin + i);
+    row_reference y_i = *(y_m_begin + i);
+    row_reference ub_i = *(ub_m_begin + i);
+    const N& ub_i_ci = ub_i[ci];
+    for (dimension_type j = row_size_i; j-- > 0; ) {
+      // Check redundancy of x_i_j.
+      if (!x_non_red_i[j])
+        continue;
+      const N& x_i_j = x_i[j];
+      // Check 1st condition in BHZ09 theorem.
+      if (x_i_j >= y_i[j])
+        continue;
+      const dimension_type cj = coherent_index(j);
+      const dimension_type row_size_cj = OR_Matrix<N>::row_size(cj);
+      row_reference ub_cj = *(ub_m_begin + cj);
+      const N& ub_cj_j = ub_cj[j];
+      for (dimension_type k = 0; k < n_rows; ++k) {
+        const Bit_Row& y_non_red_k = y_non_red[k];
+        const dimension_type ck = coherent_index(k);
+        const dimension_type row_size_k = OR_Matrix<N>::row_size(k);
+        row_reference x_k = *(x_m_begin + k);
+        row_reference y_k = *(y_m_begin + k);
+        row_reference ub_k = *(ub_m_begin + k);
+        const N& ub_k_ck = ub_k[ck];
+        // Be careful: for each index h, the diagonal element m[h][h]
+        // is (by convention) +infty in our implementation; however,
+        // BHZ09 theorem assumes that it is equal to 0.
+        const N& ub_k_j
+          = (k == j)
+          ? temp_zero
+          : ((j < row_size_k) ? ub_k[j] : ub_cj[ck]);
+        const N& ub_i_ck
+          = (i == ck)
+          ? temp_zero
+          : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]);
+
+        for (dimension_type ell = row_size_k; ell-- > 0; ) {
+          // Check redundancy of y_k_ell.
+          if (!y_non_red_k[ell])
+            continue;
+          const N& y_k_ell = y_k[ell];
+          // Check 2nd condition in BHZ09 theorem.
+          if (y_k_ell >= x_k[ell])
+            continue;
+          const dimension_type cell = coherent_index(ell);
+          row_reference ub_cell = *(ub_m_begin + cell);
+          const N& ub_i_ell
+            = (i == ell)
+            ? temp_zero
+            : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]);
+          const N& ub_cj_ell
+            = (cj == ell)
+            ? temp_zero
+            : ((ell < row_size_cj) ? ub_cj[ell] : ub_cell[j]);
+          // Check 3rd condition in BHZ09 theorem.
+          add_assign_r(lhs, x_i_j, y_k_ell, ROUND_UP);
+          add_assign_r(rhs, ub_i_ell, ub_k_j, ROUND_UP);
+          if (lhs >= rhs)
+            continue;
+          // Check 4th condition in BHZ09 theorem.
+          add_assign_r(rhs, ub_i_ck, ub_cj_ell, ROUND_UP);
+          if (lhs >= rhs)
+            continue;
+          // Check 5th condition in BHZ09 theorem.
+          assign_r(lhs_copy, lhs, ROUND_NOT_NEEDED);
+          add_assign_r(lhs, lhs_copy, x_i_j, ROUND_UP);
+          add_assign_r(rhs, ub_i_ell, ub_i_ck, ROUND_UP);
+          add_assign_r(rhs, rhs, ub_cj_j, ROUND_UP);
+          if (lhs >= rhs)
+            continue;
+          // Check 6th condition in BHZ09 theorem.
+          add_assign_r(rhs, ub_k_j, ub_cj_ell, ROUND_UP);
+          add_assign_r(rhs, rhs, ub_i_ci, ROUND_UP);
+          if (lhs >= rhs)
+            continue;
+          // Check 7th condition of BHZ09 theorem.
+          add_assign_r(lhs, lhs_copy, y_k_ell, ROUND_UP);
+          add_assign_r(rhs, ub_i_ell, ub_cj_ell, ROUND_UP);
+          add_assign_r(rhs, rhs, ub_k_ck, ROUND_UP);
+          if (lhs >= rhs)
+            continue;
+          // Check 8th (last) condition in BHZ09 theorem.
+          add_assign_r(rhs, ub_k_j, ub_i_ck, ROUND_UP);
+          add_assign_r(rhs, rhs, ub_cell[ell], ROUND_UP);
+          if (lhs < rhs)
+            // All 8 conditions are satisfied:
+            // upper bound is not exact.
+            return false;
+        }
+      }
+    }
+  }
+
+  // The upper bound of x and y is indeed exact.
+  m_swap(ub);
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>
+::integer_upper_bound_assign_if_exact(const Octagonal_Shape& y) {
+  PPL_COMPILE_TIME_CHECK(std::numeric_limits<T>::is_integer,
+                         "Octagonal_Shape<T>::"
+                         "integer_upper_bound_assign_if_exact(y):"
+                         " T in not an integer datatype.");
+  // Declare a const reference to *this (to avoid accidental modifications).
+  const Octagonal_Shape& x = *this;
+  const dimension_type x_space_dim = x.space_dimension();
+
+  if (x_space_dim != y.space_dimension())
+    throw_dimension_incompatible("integer_upper_bound_assign_if_exact(y)", y);
+
+  // The zero-dim case is trivial.
+  if (x_space_dim == 0) {
+    upper_bound_assign(y);
+    return true;
+  }
+
+  // If `x' or `y' is (known to) contain no integral point,
+  // then the integer upper bound can be computed exactly by tight closure.
+  if (x.marked_empty()) {
+    *this = y;
+    tight_closure_assign();
+    return true;
+  }
+  else if (y.marked_empty()) {
+    tight_closure_assign();
+    return true;
+  }
+  else if (x.is_empty() || x.tight_coherence_would_make_empty()) {
+    *this = y;
+    tight_closure_assign();
+    return true;
+  }
+  else if (y.is_empty() || y.tight_coherence_would_make_empty()) {
+    tight_closure_assign();
+    return true;
+  }
+
+  // Here both `x' and `y' are known to be non-empty (and Z-consistent).
+  PPL_ASSERT(x.marked_strongly_closed());
+  PPL_ASSERT(y.marked_strongly_closed());
+  // Pre-compute the integer upper bound of `x' and `y':
+  // have to take copies, since tight closure might modify the rational shape.
+  Octagonal_Shape<T> tx(x);
+  tx.tight_closure_assign();
+  Octagonal_Shape<T> ty(y);
+  ty.tight_closure_assign();
+  Octagonal_Shape<T> ub(tx);
+  ub.upper_bound_assign(ty);
+
+  // Compute redundancy information for tx and ty.
+  // TODO: provide a nicer data structure for redundancy.
+  // NOTE: there is no need to identify all redundancies, since this is
+  // an optimization; hence we reuse the strong-reduction helper methods.
+  std::vector<Bit_Row> tx_non_red;
+  tx.non_redundant_matrix_entries(tx_non_red);
+  std::vector<Bit_Row> ty_non_red;
+  ty.non_redundant_matrix_entries(ty_non_red);
+
+  PPL_DIRTY_TEMP(N, lhs_i_j);
+  PPL_DIRTY_TEMP(N, lhs_k_ell);
+  PPL_DIRTY_TEMP(N, lhs);
+  PPL_DIRTY_TEMP(N, lhs_copy);
+  PPL_DIRTY_TEMP(N, rhs);
+  PPL_DIRTY_TEMP(N, temp_zero);
+  assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
+  PPL_DIRTY_TEMP(N, temp_one);
+  assign_r(temp_one, 1, ROUND_NOT_NEEDED);
+  PPL_DIRTY_TEMP(N, temp_two);
+  assign_r(temp_two, 2, ROUND_NOT_NEEDED);
+
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+  const dimension_type n_rows = tx.matrix.num_rows();
+  const row_iterator tx_m_begin = tx.matrix.row_begin();
+  const row_iterator ty_m_begin = ty.matrix.row_begin();
+  const row_iterator ub_m_begin = ub.matrix.row_begin();
+
+  for (dimension_type i = n_rows; i-- > 0; ) {
+    const Bit_Row& tx_non_red_i = tx_non_red[i];
+    using namespace Implementation::Octagonal_Shapes;
+    const dimension_type ci = coherent_index(i);
+    const dimension_type row_size_i = OR_Matrix<N>::row_size(i);
+    row_reference tx_i = *(tx_m_begin + i);
+    row_reference ty_i = *(ty_m_begin + i);
+    row_reference ub_i = *(ub_m_begin + i);
+    const N& ub_i_ci = ub_i[ci];
+    for (dimension_type j = row_size_i; j-- > 0; ) {
+      // Check redundancy of tx_i_j.
+      if (!tx_non_red_i[j])
+        continue;
+      const N& tx_i_j = tx_i[j];
+      const dimension_type cj = coherent_index(j);
+      const N& eps_i_j = (i == cj) ? temp_two : temp_one;
+      // Check condition 1a in BHZ09 Theorem 6.8.
+      add_assign_r(lhs_i_j, tx_i_j, eps_i_j, ROUND_NOT_NEEDED);
+      if (lhs_i_j > ty_i[j])
+        continue;
+      const dimension_type row_size_cj = OR_Matrix<N>::row_size(cj);
+      row_reference ub_cj = *(ub_m_begin + cj);
+      const N& ub_cj_j = ub_cj[j];
+      for (dimension_type k = 0; k < n_rows; ++k) {
+        const Bit_Row& ty_non_red_k = ty_non_red[k];
+        const dimension_type ck = coherent_index(k);
+        const dimension_type row_size_k = OR_Matrix<N>::row_size(k);
+        row_reference tx_k = *(tx_m_begin + k);
+        row_reference ty_k = *(ty_m_begin + k);
+        row_reference ub_k = *(ub_m_begin + k);
+        const N& ub_k_ck = ub_k[ck];
+        // Be careful: for each index h, the diagonal element m[h][h]
+        // is (by convention) +infty in our implementation; however,
+        // BHZ09 theorem assumes that it is equal to 0.
+        const N& ub_k_j
+          = (k == j)
+          ? temp_zero
+          : ((j < row_size_k) ? ub_k[j] : ub_cj[ck]);
+        const N& ub_i_ck
+          = (i == ck)
+          ? temp_zero
+          : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]);
+
+        for (dimension_type ell = row_size_k; ell-- > 0; ) {
+          // Check redundancy of y_k_ell.
+          if (!ty_non_red_k[ell])
+            continue;
+          const N& ty_k_ell = ty_k[ell];
+          const dimension_type cell = coherent_index(ell);
+          const N& eps_k_ell = (k == cell) ? temp_two : temp_one;
+          // Check condition 1b in BHZ09 Theorem 6.8.
+          add_assign_r(lhs_k_ell, ty_k_ell, eps_k_ell, ROUND_NOT_NEEDED);
+          if (lhs_k_ell > tx_k[ell])
+            continue;
+          row_reference ub_cell = *(ub_m_begin + cell);
+          const N& ub_i_ell
+            = (i == ell)
+            ? temp_zero
+            : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]);
+          const N& ub_cj_ell
+            = (cj == ell)
+            ? temp_zero
+            : ((ell < row_size_cj) ? ub_cj[ell] : ub_cell[j]);
+          // Check condition 2a in BHZ09 Theorem 6.8.
+          add_assign_r(lhs, lhs_i_j, lhs_k_ell, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, ub_i_ell, ub_k_j, ROUND_NOT_NEEDED);
+          if (lhs > rhs)
+            continue;
+          // Check condition 2b in BHZ09 Theorem 6.8.
+          add_assign_r(rhs, ub_i_ck, ub_cj_ell, ROUND_NOT_NEEDED);
+          if (lhs > rhs)
+            continue;
+          // Check condition 3a in BHZ09 Theorem 6.8.
+          assign_r(lhs_copy, lhs, ROUND_NOT_NEEDED);
+          add_assign_r(lhs, lhs, lhs_i_j, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, ub_i_ell, ub_i_ck, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, rhs, ub_cj_j, ROUND_NOT_NEEDED);
+          if (lhs > rhs)
+            continue;
+          // Check condition 3b in BHZ09 Theorem 6.8.
+          add_assign_r(rhs, ub_k_j, ub_cj_ell, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, rhs, ub_i_ci, ROUND_NOT_NEEDED);
+          if (lhs > rhs)
+            continue;
+          // Check condition 4a in BHZ09 Theorem 6.8.
+          add_assign_r(lhs, lhs_copy, lhs_k_ell, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, ub_i_ell, ub_cj_ell, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, rhs, ub_k_ck, ROUND_NOT_NEEDED);
+          if (lhs > rhs)
+            continue;
+          // Check condition 4b in BHZ09 Theorem 6.8.
+          add_assign_r(rhs, ub_k_j, ub_i_ck, ROUND_NOT_NEEDED);
+          add_assign_r(rhs, rhs, ub_cell[ell], ROUND_NOT_NEEDED);
+          if (lhs <= rhs)
+            // All 8 conditions are satisfied:
+            // integer upper bound is not exact.
+            return false;
+        }
+      }
+    }
+  }
+
+  // The upper bound of x and y is indeed exact.
+  m_swap(ub);
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::drop_some_non_integer_points(Complexity_Class) {
+  if (std::numeric_limits<T>::is_integer)
+    return;
+
+  const dimension_type space_dim = space_dimension();
+  strong_closure_assign();
+  if (space_dim == 0 || marked_empty())
+    return;
+
+  for (typename OR_Matrix<N>::element_iterator i = matrix.element_begin(),
+         i_end = matrix.element_end(); i != i_end; ++i)
+    drop_some_non_integer_points_helper(*i);
+
+  // Unary constraints should have an even integer boundary.
+  PPL_DIRTY_TEMP(N, temp_one);
+  assign_r(temp_one, 1, ROUND_NOT_NEEDED);
+  for (dimension_type i = 0; i < 2*space_dim; i += 2) {
+    const dimension_type ci = i + 1;
+    N& mat_i_ci = matrix[i][ci];
+    if (!is_plus_infinity(mat_i_ci) && !is_even(mat_i_ci)) {
+      sub_assign_r(mat_i_ci, mat_i_ci, temp_one, ROUND_UP);
+      reset_strongly_closed();
+    }
+    N& mat_ci_i = matrix[ci][i];
+    if (!is_plus_infinity(mat_ci_i) && !is_even(mat_ci_i)) {
+      sub_assign_r(mat_ci_i, mat_ci_i, temp_one, ROUND_UP);
+      reset_strongly_closed();
+    }
+  }
+
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::drop_some_non_integer_points(const Variables_Set& vars,
+                               Complexity_Class) {
+  // Dimension-compatibility check.
+  const dimension_type min_space_dim = vars.space_dimension();
+  if (space_dimension() < min_space_dim)
+    throw_dimension_incompatible("drop_some_non_integer_points(vs, cmpl)",
+                                 min_space_dim);
+
+  if (std::numeric_limits<T>::is_integer || min_space_dim == 0)
+    return;
+
+  strong_closure_assign();
+  if (marked_empty())
+    return;
+
+  PPL_DIRTY_TEMP(N, temp_one);
+  assign_r(temp_one, 1, ROUND_NOT_NEEDED);
+
+  const Variables_Set::const_iterator v_begin = vars.begin();
+  const Variables_Set::const_iterator v_end = vars.end();
+  PPL_ASSERT(v_begin != v_end);
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
+  for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
+    const dimension_type i = 2 * (*v_i);
+    const dimension_type ci = i + 1;
+    row_reference m_i = matrix[i];
+    row_reference m_ci = matrix[ci];
+
+    // Unary constraints: should be even integers.
+    N& m_i_ci = m_i[ci];
+    if (!is_plus_infinity(m_i_ci)) {
+      drop_some_non_integer_points_helper(m_i_ci);
+      if (!is_even(m_i_ci)) {
+        sub_assign_r(m_i_ci, m_i_ci, temp_one, ROUND_UP);
+        reset_strongly_closed();
+      }
+    }
+    N& m_ci_i = m_ci[i];
+    if (!is_plus_infinity(m_ci_i)) {
+      drop_some_non_integer_points_helper(m_ci_i);
+      if (!is_even(m_ci_i)) {
+        sub_assign_r(m_ci_i, m_ci_i, temp_one, ROUND_UP);
+        reset_strongly_closed();
+      }
+    }
+
+    // Binary constraints (note: only consider j < i).
+    for (Variables_Set::const_iterator v_j = v_begin; v_j != v_i; ++v_j) {
+      const dimension_type j = 2 * (*v_j);
+      const dimension_type cj = j + 1;
+      drop_some_non_integer_points_helper(m_i[j]);
+      drop_some_non_integer_points_helper(m_i[cj]);
+      drop_some_non_integer_points_helper(m_ci[j]);
+      drop_some_non_integer_points_helper(m_ci[cj]);
+    }
+  }
+  PPL_ASSERT(OK());
+}
+
+template <typename T>
+template <typename U>
+void
+Octagonal_Shape<T>
+::export_interval_constraints(U& dest) const {
+  if (space_dim > dest.space_dimension())
+    throw std::invalid_argument(
+               "Octagonal_Shape<T>::export_interval_constraints");
+
+  strong_closure_assign();
+
+  if (marked_empty()) {
+    dest.set_empty();
+    return;
+  }
+
+  PPL_DIRTY_TEMP(N, lb);
+  PPL_DIRTY_TEMP(N, ub);
+  for (dimension_type i = space_dim; i-- > 0; ) {
+    const dimension_type ii = 2*i;
+    const dimension_type cii = ii + 1;
+
+    // Set the upper bound.
+    const N& twice_ub = matrix[cii][ii];
+    if (!is_plus_infinity(twice_ub)) {
+      assign_r(ub, twice_ub, ROUND_NOT_NEEDED);
+      div_2exp_assign_r(ub, ub, 1, ROUND_UP);
+      // FIXME: passing a raw value may not be general enough.
+      if (!dest.restrict_upper(i, ub.raw_value()))
+        return;
+    }
+
+    // Set the lower bound.
+    const N& twice_lb = matrix[ii][cii];
+    if (!is_plus_infinity(twice_lb)) {
+      assign_r(lb, twice_lb, ROUND_NOT_NEEDED);
+      neg_assign_r(lb, lb, ROUND_NOT_NEEDED);
+      div_2exp_assign_r(lb, lb, 1, ROUND_DOWN);
+      // FIXME: passing a raw value may not be general enough.
+      if (!dest.restrict_lower(i, lb.raw_value()))
+        return;
+    }
+  }
+
+}
+
+/*! \relates Parma_Polyhedra_Library::Octagonal_Shape */
+template <typename T>
+std::ostream&
+IO_Operators::operator<<(std::ostream& s, const Octagonal_Shape<T>& oct) {
+  // Handle special cases first.
+  if (oct.marked_empty()) {
+    s << "false";
+    return s;
+  }
+  if (oct.is_universe()) {
+    s << "true";
+    return s;
+  }
+
+  typedef typename Octagonal_Shape<T>::coefficient_type N;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
+
+  // Records whether or not we still have to print the first constraint.
+  bool first = true;
+
+  row_iterator m_begin = oct.matrix.row_begin();
+  row_iterator m_end = oct.matrix.row_end();
+
+  // Temporaries.
+  PPL_DIRTY_TEMP(N, negation);
+  PPL_DIRTY_TEMP(N, half);
+  // Go through all the unary constraints.
+  // (Note: loop iterator is incremented in the loop body.)
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
+    const dimension_type i = i_iter.index();
+    const Variable v_i(i/2);
+    const N& c_i_ii = (*i_iter)[i + 1];
+    ++i_iter;
+    const N& c_ii_i = (*i_iter)[i];
+    ++i_iter;
+    // Check whether or not it is an equality constraint.
+    if (is_additive_inverse(c_i_ii, c_ii_i)) {
+      // It is an equality.
+      PPL_ASSERT(!is_plus_infinity(c_i_ii) && !is_plus_infinity(c_ii_i));
+      if (first)
+        first = false;
+      else
+        s << ", ";
+      // If the value bound can NOT be divided by 2 exactly,
+      // then we output the constraint `2*v_i = bound'.
+      if (div_2exp_assign_r(half, c_ii_i, 1,
+                            ROUND_UP | ROUND_STRICT_RELATION)
+          == V_EQ)
+        s << v_i << " = " << half;
+      else
+        s << "2*" << v_i << " = " << c_ii_i;
+    }
+    else {
+      // We will print unary non-strict inequalities, if any.
+      if (!is_plus_infinity(c_i_ii)) {
+        if (first)
+          first = false;
+        else
+          s << ", ";
+        neg_assign_r(negation, c_i_ii, ROUND_NOT_NEEDED);
+        // If the value bound can NOT be divided by 2 exactly,
+        // then we output the constraint `2*v_i >= negation'.
+        if (div_2exp_assign_r(half, negation, 1,
+                              ROUND_UP | ROUND_STRICT_RELATION)
+            == V_EQ)
+          s << v_i << " >= " << half;
+        else
+          s << "2*" << v_i << " >= " << negation;
+      }
+      if (!is_plus_infinity(c_ii_i)) {
+        if (first)
+          first = false;
+        else
+          s << ", ";
+        // If the value bound can NOT be divided by 2 exactly,
+        // then we output the constraint `2*v_i <= bound'.
+        if (div_2exp_assign_r(half, c_ii_i, 1,
+                              ROUND_UP | ROUND_STRICT_RELATION)
+            == V_EQ)
+          s << v_i << " <= " << half;
+        else
+          s << "2*" << v_i << " <= " << c_ii_i;
+      }
+    }
+  }
+
+  // Go through all the binary constraints.
+  // (Note: loop iterator is incremented in the loop body.)
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
+    const dimension_type i = i_iter.index();
+    const Variable v_i(i/2);
+    row_reference r_i = *i_iter;
+    ++i_iter;
+    row_reference r_ii = *i_iter;
+    ++i_iter;
+
+    for (dimension_type j = 0; j < i; j += 2) {
+      const Variable v_j(j/2);
+      // Print binary differences.
+      const N& c_ii_jj = r_ii[j + 1];
+      const N& c_i_j = r_i[j];
+      // Check whether or not it is an equality constraint.
+      if (is_additive_inverse(c_ii_jj, c_i_j)) {
+        // It is an equality.
+        PPL_ASSERT(!is_plus_infinity(c_i_j) && !is_plus_infinity(c_ii_jj));
+        if (first)
+          first = false;
+        else
+          s << ", ";
+        if (sgn(c_i_j) >= 0)
+          s << v_j << " - " << v_i << " = " << c_i_j;
+        else
+          s << v_i << " - " << v_j << " = " << c_ii_jj;
+      }
+      else {
+        // We will print non-strict inequalities, if any.
+        if (!is_plus_infinity(c_i_j)) {
+          if (first)
+            first = false;
+          else
+            s << ", ";
+          if (sgn(c_i_j) >= 0)
+            s << v_j << " - " << v_i << " <= " << c_i_j;
+          else {
+            neg_assign_r(negation, c_i_j, ROUND_DOWN);
+            s << v_i << " - " << v_j << " >= " << negation;
+          }
+        }
+        if (!is_plus_infinity(c_ii_jj)) {
+          if (first)
+            first = false;
+          else
+            s << ", ";
+          if (sgn(c_ii_jj) >= 0)
+            s << v_i << " - " << v_j << " <= " << c_ii_jj;
+          else {
+            neg_assign_r(negation, c_ii_jj, ROUND_DOWN);
+            s << v_j << " - " << v_i << " >= " << negation;
+          }
+        }
+      }
+      // Print binary sums.
+      const N& c_i_jj = r_i[j + 1];
+      const N& c_ii_j = r_ii[j];
+      // Check whether or not it is an equality constraint.
+      if (is_additive_inverse(c_i_jj, c_ii_j)) {
+        // It is an equality.
+        PPL_ASSERT(!is_plus_infinity(c_i_jj) && !is_plus_infinity(c_ii_j));
+        if (first)
+          first = false;
+        else
+          s << ", ";
+        s << v_j << " + " << v_i << " = " << c_ii_j;
+      }
+      else {
+        // We will print non-strict inequalities, if any.
+        if (!is_plus_infinity(c_i_jj)) {
+          if (first)
+            first = false;
+          else
+            s << ", ";
+          neg_assign_r(negation, c_i_jj, ROUND_DOWN);
+          s << v_j << " + " << v_i << " >= " << negation;
+        }
+        if (!is_plus_infinity(c_ii_j)) {
+          if (first)
+            first = false;
+          else
+            s << ", ";
+          s << v_j << " + " << v_i << " <= " << c_ii_j;
+        }
+      }
+    }
+  }
+  return s;
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::ascii_dump(std::ostream& s) const {
+  s << "space_dim "
+    << space_dim
+    << "\n";
+  status.ascii_dump(s);
+  s << "\n";
+  matrix.ascii_dump(s);
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(T, Octagonal_Shape<T>)
+
+template <typename T>
+bool
+Octagonal_Shape<T>::ascii_load(std::istream& s) {
+  std::string str;
+
+  if (!(s >> str) || str != "space_dim")
+    return false;
+
+  if (!(s >> space_dim))
+    return false;
+
+  if (!status.ascii_load(s))
+    return false;
+
+  if (!matrix.ascii_load(s))
+    return false;
+
+  PPL_ASSERT(OK());
+  return true;
+}
+
+template <typename T>
+memory_size_type
+Octagonal_Shape<T>::external_memory_in_bytes() const {
+  return matrix.external_memory_in_bytes();
+}
+
+template <typename T>
+bool
+Octagonal_Shape<T>::OK() const {
+  // Check whether the matrix is well-formed.
+  if (!matrix.OK())
+    return false;
+
+  // Check whether the status information is legal.
+  if (!status.OK())
+    return false;
+
+  // All empty octagons are OK.
+  if (marked_empty())
+    return true;
+
+  // 0-dim universe octagon is OK.
+  if (space_dim == 0)
+    return true;
+
+  // MINUS_INFINITY cannot occur at all.
+  for (typename OR_Matrix<N>::const_row_iterator i = matrix.row_begin(),
+         matrix_row_end = matrix.row_end(); i != matrix_row_end; ++i) {
+    typename OR_Matrix<N>::const_row_reference_type x_i = *i;
+    for (dimension_type j = i.row_size(); j-- > 0; )
+      if (is_minus_infinity(x_i[j])) {
+#ifndef NDEBUG
+        using namespace Parma_Polyhedra_Library::IO_Operators;
+        std::cerr << "Octagonal_Shape::"
+                  << "matrix[" << i.index() << "][" << j << "] = "
+                  << x_i[j] << "!"
+                  << std::endl;
+#endif
+        return false;
+      }
+  }
+
+  // On the main diagonal only PLUS_INFINITY can occur.
+  for (typename OR_Matrix<N>::const_row_iterator i = matrix.row_begin(),
+         m_end = matrix.row_end(); i != m_end; ++i) {
+    typename OR_Matrix<N>::const_row_reference_type r = *i;
+    const N& m_i_i = r[i.index()];
+    if (!is_plus_infinity(m_i_i)) {
+#ifndef NDEBUG
+      const dimension_type j = i.index();
+      using namespace Parma_Polyhedra_Library::IO_Operators;
+      std::cerr << "Octagonal_Shape::matrix[" << j << "][" << j << "] = "
+                << m_i_i << "!  (+inf was expected.)\n";
+#endif
+      return false;
+    }
+  }
+
+  // The following tests might result in false alarms when using floating
+  // point coefficients: they are only meaningful if the coefficient type
+  // base is exact (since otherwise strong closure is approximated).
+  if (std::numeric_limits<coefficient_type_base>::is_exact) {
+
+    // Check whether the closure information is legal.
+    if (marked_strongly_closed()) {
+      Octagonal_Shape x = *this;
+      x.reset_strongly_closed();
+      x.strong_closure_assign();
+      if (x.matrix != matrix) {
+#ifndef NDEBUG
+        std::cerr << "Octagonal_Shape is marked as strongly closed "
+                  << "but it is not!\n";
+#endif
+        return false;
+      }
+    }
+
+    // A closed octagon must be strong-coherent.
+    if (marked_strongly_closed())
+      if (!is_strong_coherent()) {
+#ifndef NDEBUG
+        std::cerr << "Octagonal_Shape is not strong-coherent!\n";
+#endif
+        return false;
+      }
+  }
+
+  // All checks passed.
+  return true;
+}
+
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::throw_dimension_incompatible(const char* method,
+                               const Octagonal_Shape& y) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", y->space_dimension() == " << y.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::throw_dimension_incompatible(const char* method,
+                               dimension_type required_dim) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", required dimension == " << required_dim << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::throw_dimension_incompatible(const char* method,
+                                                 const Constraint& c) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", c->space_dimension == " << c.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::throw_dimension_incompatible(const char* method,
+                                                 const Congruence& cg) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", cg->space_dimension == " << cg.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::throw_dimension_incompatible(const char* method,
+                                                 const Generator& g) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", g->space_dimension == " << g.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::throw_constraint_incompatible(const char* method) {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "the constraint is incompatible.";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::throw_expression_too_complex(const char* method,
+                                                 const Linear_Expression& le) {
+  using namespace IO_Operators;
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << le << " is too complex.";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>
+::throw_dimension_incompatible(const char* method,
+                               const char* le_name,
+                               const Linear_Expression& le) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", " << le_name << "->space_dimension() == "
+    << le.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+template <typename C>
+void
+Octagonal_Shape<T>
+::throw_dimension_incompatible(const char* method,
+                               const char* lf_name,
+                               const Linear_Form<C>& lf) const {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << "this->space_dimension() == " << space_dimension()
+    << ", " << lf_name << "->space_dimension() == "
+    << lf.space_dimension() << ".";
+  throw std::invalid_argument(s.str());
+}
+
+template <typename T>
+void
+Octagonal_Shape<T>::throw_invalid_argument(const char* method,
+                                           const char* reason) {
+  std::ostringstream s;
+  s << "PPL::Octagonal_Shape::" << method << ":\n"
+    << reason << ".";
+  throw std::invalid_argument(s.str());
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Octagonal_Shape_templates_hh)
diff --git a/src/Octagonal_Shape_types.hh b/src/Octagonal_Shape_types.hh
new file mode 100644
index 0000000..594433f
--- /dev/null
+++ b/src/Octagonal_Shape_types.hh
@@ -0,0 +1,25 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Octagonal_Shape_types_hh
+#define PPL_Octagonal_Shape_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class Octagonal_Shape;
+
+class Octagonal_Shape_Helper;
+
+}
+
+#endif // !defined(PPL_Octagonal_Shape_types_hh)
diff --git a/src/Og_Status.idefs.hh b/src/Og_Status.idefs.hh
deleted file mode 100644
index 007c3cb..0000000
--- a/src/Og_Status.idefs.hh
+++ /dev/null
@@ -1,112 +0,0 @@
-/* Octagonal_Shape<T>::Status class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Og_Status_idefs_hh
-#define PPL_Og_Status_idefs_hh 1
-
-#ifndef PPL_IN_Octagonal_Shape_CLASS
-#error "Do not include Og_Status.idefs.hh directly; use Octagonal_Shape.defs.hh instead"
-#endif
-
-//! A conjunctive assertion about a Octagonal_Shape<T> object.
-/*!
-  The assertions supported are:
-  - <EM>zero-dim universe</EM>: the polyhedron is the zero-dimensional
-    vector space \f$\Rset^0 = \{\cdot\}\f$;
-  - <EM>empty</EM>: the polyhedron is the empty set;
-  - <EM>strongly closed</EM>: the Octagonal_Shape object is strongly
-    closed, so that all the constraints are as tight as possible.
-
-  Not all the conjunctions of these elementary assertions constitute
-  a legal Status.  In fact:
-  - <EM>zero-dim universe</EM> excludes any other assertion;
-  - <EM>empty</EM>: excludes any other assertion.
-*/
-class Status {
-public:
-  //! By default Status is the <EM>zero-dim universe</EM> assertion.
-  Status();
-
-  //! \name Test, remove or add an individual assertion from the conjunction.
-  //@{
-  bool test_zero_dim_univ() const;
-  void reset_zero_dim_univ();
-  void set_zero_dim_univ();
-
-  bool test_empty() const;
-  void reset_empty();
-  void set_empty();
-
-  bool test_strongly_closed() const;
-  void reset_strongly_closed();
-  void set_strongly_closed();
-  //@}
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  /*! \brief
-    Writes to \p s an ASCII representation of the internal
-    representation of \p *this.
-  */
-  void ascii_dump(std::ostream& s) const;
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-private:
-  //! Status is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bitmasks for the individual assertions.
-  //@{
-  static const flags_t ZERO_DIM_UNIV   = 0U;
-  static const flags_t EMPTY           = 1U << 0;
-  static const flags_t STRONGLY_CLOSED = 1U << 1;
-  //@}
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! Construct from a bitmask.
-  Status(flags_t mask);
-
-  //! Check whether <EM>all</EM> bits in \p mask are set.
-  bool test_all(flags_t mask) const;
-
-  //! Check whether <EM>at least one</EM> bit in \p mask is set.
-  bool test_any(flags_t mask) const;
-
-  //! Set the bits in \p mask.
-  void set(flags_t mask);
-
-  //! Reset the bits in \p mask.
-  void reset(flags_t mask);
-
-};
-
-#endif // !defined(PPL_Og_Status_idefs_hh)
diff --git a/src/Og_Status.inlines.hh b/src/Og_Status.inlines.hh
deleted file mode 100644
index 0fa705f..0000000
--- a/src/Og_Status.inlines.hh
+++ /dev/null
@@ -1,225 +0,0 @@
-/* Octagonal_Shape<T>::Status class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Og_Status_inlines_hh
-#define PPL_Og_Status_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Status::Status(flags_t mask)
-  : flags(mask) {
-}
-
-template <typename T>
-inline
-Octagonal_Shape<T>::Status::Status()
-  : flags(ZERO_DIM_UNIV) {
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::test_all(flags_t mask) const {
-  return (flags & mask) == mask;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::test_any(flags_t mask) const {
-  return (flags & mask) != 0;
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::set(flags_t mask) {
-  flags |= mask;
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::reset(flags_t mask) {
-  flags &= ~mask;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::test_zero_dim_univ() const {
-  return flags == ZERO_DIM_UNIV;
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::reset_zero_dim_univ() {
-  // This is a no-op if the current status is not zero-dim.
-  if (flags == ZERO_DIM_UNIV)
-    // In the zero-dim space, if it is not the universe it is empty.
-    flags = EMPTY;
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::set_zero_dim_univ() {
-  // Zero-dim universe is incompatible with anything else.
-  flags = ZERO_DIM_UNIV;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::test_empty() const {
-  return test_any(EMPTY);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::reset_empty() {
-  reset(EMPTY);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::set_empty() {
-  flags = EMPTY;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::test_strongly_closed() const {
-  return test_any(STRONGLY_CLOSED);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::reset_strongly_closed() {
-  reset(STRONGLY_CLOSED);
-}
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::set_strongly_closed() {
-  set(STRONGLY_CLOSED);
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::OK() const {
-  if (test_zero_dim_univ())
-    // Zero-dim universe is OK.
-    return true;
-
-  if (test_empty()) {
-    Status copy = *this;
-    copy.reset_empty();
-    if (copy.test_zero_dim_univ())
-      return true;
-    else {
-#ifndef NDEBUG
-      std::cerr << "The empty flag is incompatible with any other one."
-		<< std::endl;
-#endif
-      return false;
-    }
-  }
-
-  // Any other case is OK.
-  return true;
-}
-
-
-namespace Implementation {
-
-namespace Octagonal_Shapes {
-// These are the keywords that indicate the individual assertions.
-const std::string zero_dim_univ = "ZE";
-const std::string empty = "EM";
-const std::string strong_closed = "SC";
-const char yes = '+';
-const char no = '-';
-const char separator = ' ';
-
-/*! \relates Parma_Polyhedra_Library::Octagonal_Shape::Status
-  Reads a keyword and its associated on/off flag from \p s.
-  Returns <CODE>true</CODE> if the operation is successful,
-  returns <CODE>false</CODE> otherwise.
-  When successful, \p positive is set to <CODE>true</CODE> if the flag
-  is on; it is set to <CODE>false</CODE> otherwise.
-*/
-inline bool
-get_field(std::istream& s, const std::string& keyword, bool& positive) {
-  std::string str;
-  if (!(s >> str)
-      || (str[0] != yes && str[0] != no)
-      || str.substr(1) != keyword)
-    return false;
-  positive = (str[0] == yes);
-  return true;
-}
-
-} // namespace Octagonal_Shapes
-
-} // namespace Implementation
-
-template <typename T>
-inline void
-Octagonal_Shape<T>::Status::ascii_dump(std::ostream& s) const {
-  using namespace Implementation::Octagonal_Shapes;
-  s << (test_zero_dim_univ() ? yes : no) << zero_dim_univ
-    << separator
-    << (test_empty() ? yes : no) << empty
-    << separator
-    << separator
-    << (test_strongly_closed() ? yes : no) << strong_closed
-    << separator;
-}
-
-template <typename T>
-inline bool
-Octagonal_Shape<T>::Status::ascii_load(std::istream& s) {
-  using namespace Implementation::Octagonal_Shapes;
-  PPL_UNINITIALIZED(bool, positive);
-
-  if (!get_field(s, zero_dim_univ, positive))
-    return false;
-  if (positive)
-    set_zero_dim_univ();
-
-  if (!get_field(s, empty, positive))
-    return false;
-  if (positive)
-    set_empty();
-
-  if (!get_field(s, strong_closed, positive))
-    return false;
-  if (positive)
-    set_strongly_closed();
-  else
-    reset_strongly_closed();
-
-  // Check invariants.
-  PPL_ASSERT(OK());
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Og_Status_inlines_hh)
diff --git a/src/Og_Status_idefs.hh b/src/Og_Status_idefs.hh
new file mode 100644
index 0000000..c4bd280
--- /dev/null
+++ b/src/Og_Status_idefs.hh
@@ -0,0 +1,112 @@
+/* Octagonal_Shape<T>::Status class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Og_Status_idefs_hh
+#define PPL_Og_Status_idefs_hh 1
+
+#ifndef PPL_IN_Octagonal_Shape_CLASS
+#error "Do not include Og_Status_idefs.hh directly; use Octagonal_Shape_defs.hh instead"
+#endif
+
+//! A conjunctive assertion about a Octagonal_Shape<T> object.
+/*!
+  The assertions supported are:
+  - <EM>zero-dim universe</EM>: the polyhedron is the zero-dimensional
+    vector space \f$\Rset^0 = \{\cdot\}\f$;
+  - <EM>empty</EM>: the polyhedron is the empty set;
+  - <EM>strongly closed</EM>: the Octagonal_Shape object is strongly
+    closed, so that all the constraints are as tight as possible.
+
+  Not all the conjunctions of these elementary assertions constitute
+  a legal Status.  In fact:
+  - <EM>zero-dim universe</EM> excludes any other assertion;
+  - <EM>empty</EM>: excludes any other assertion.
+*/
+class Status {
+public:
+  //! By default Status is the <EM>zero-dim universe</EM> assertion.
+  Status();
+
+  //! \name Test, remove or add an individual assertion from the conjunction.
+  //@{
+  bool test_zero_dim_univ() const;
+  void reset_zero_dim_univ();
+  void set_zero_dim_univ();
+
+  bool test_empty() const;
+  void reset_empty();
+  void set_empty();
+
+  bool test_strongly_closed() const;
+  void reset_strongly_closed();
+  void set_strongly_closed();
+  //@}
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  /*! \brief
+    Writes to \p s an ASCII representation of the internal
+    representation of \p *this.
+  */
+  void ascii_dump(std::ostream& s) const;
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+private:
+  //! Status is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bitmasks for the individual assertions.
+  //@{
+  static const flags_t ZERO_DIM_UNIV   = 0U;
+  static const flags_t EMPTY           = 1U << 0;
+  static const flags_t STRONGLY_CLOSED = 1U << 1;
+  //@}
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! Construct from a bitmask.
+  Status(flags_t mask);
+
+  //! Check whether <EM>all</EM> bits in \p mask are set.
+  bool test_all(flags_t mask) const;
+
+  //! Check whether <EM>at least one</EM> bit in \p mask is set.
+  bool test_any(flags_t mask) const;
+
+  //! Set the bits in \p mask.
+  void set(flags_t mask);
+
+  //! Reset the bits in \p mask.
+  void reset(flags_t mask);
+
+};
+
+#endif // !defined(PPL_Og_Status_idefs_hh)
diff --git a/src/Og_Status_inlines.hh b/src/Og_Status_inlines.hh
new file mode 100644
index 0000000..228f79f
--- /dev/null
+++ b/src/Og_Status_inlines.hh
@@ -0,0 +1,225 @@
+/* Octagonal_Shape<T>::Status class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Og_Status_inlines_hh
+#define PPL_Og_Status_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Status::Status(flags_t mask)
+  : flags(mask) {
+}
+
+template <typename T>
+inline
+Octagonal_Shape<T>::Status::Status()
+  : flags(ZERO_DIM_UNIV) {
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::test_all(flags_t mask) const {
+  return (flags & mask) == mask;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::test_any(flags_t mask) const {
+  return (flags & mask) != 0;
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::set(flags_t mask) {
+  flags |= mask;
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::reset(flags_t mask) {
+  flags &= ~mask;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::test_zero_dim_univ() const {
+  return flags == ZERO_DIM_UNIV;
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::reset_zero_dim_univ() {
+  // This is a no-op if the current status is not zero-dim.
+  if (flags == ZERO_DIM_UNIV)
+    // In the zero-dim space, if it is not the universe it is empty.
+    flags = EMPTY;
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::set_zero_dim_univ() {
+  // Zero-dim universe is incompatible with anything else.
+  flags = ZERO_DIM_UNIV;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::test_empty() const {
+  return test_any(EMPTY);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::reset_empty() {
+  reset(EMPTY);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::set_empty() {
+  flags = EMPTY;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::test_strongly_closed() const {
+  return test_any(STRONGLY_CLOSED);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::reset_strongly_closed() {
+  reset(STRONGLY_CLOSED);
+}
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::set_strongly_closed() {
+  set(STRONGLY_CLOSED);
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::OK() const {
+  if (test_zero_dim_univ())
+    // Zero-dim universe is OK.
+    return true;
+
+  if (test_empty()) {
+    Status copy = *this;
+    copy.reset_empty();
+    if (copy.test_zero_dim_univ())
+      return true;
+    else {
+#ifndef NDEBUG
+      std::cerr << "The empty flag is incompatible with any other one."
+                << std::endl;
+#endif
+      return false;
+    }
+  }
+
+  // Any other case is OK.
+  return true;
+}
+
+
+namespace Implementation {
+
+namespace Octagonal_Shapes {
+// These are the keywords that indicate the individual assertions.
+const std::string zero_dim_univ = "ZE";
+const std::string empty = "EM";
+const std::string strong_closed = "SC";
+const char yes = '+';
+const char no = '-';
+const char separator = ' ';
+
+/*! \relates Parma_Polyhedra_Library::Octagonal_Shape::Status
+  Reads a keyword and its associated on/off flag from \p s.
+  Returns <CODE>true</CODE> if the operation is successful,
+  returns <CODE>false</CODE> otherwise.
+  When successful, \p positive is set to <CODE>true</CODE> if the flag
+  is on; it is set to <CODE>false</CODE> otherwise.
+*/
+inline bool
+get_field(std::istream& s, const std::string& keyword, bool& positive) {
+  std::string str;
+  if (!(s >> str)
+      || (str[0] != yes && str[0] != no)
+      || str.substr(1) != keyword)
+    return false;
+  positive = (str[0] == yes);
+  return true;
+}
+
+} // namespace Octagonal_Shapes
+
+} // namespace Implementation
+
+template <typename T>
+inline void
+Octagonal_Shape<T>::Status::ascii_dump(std::ostream& s) const {
+  using namespace Implementation::Octagonal_Shapes;
+  s << (test_zero_dim_univ() ? yes : no) << zero_dim_univ
+    << separator
+    << (test_empty() ? yes : no) << empty
+    << separator
+    << separator
+    << (test_strongly_closed() ? yes : no) << strong_closed
+    << separator;
+}
+
+template <typename T>
+inline bool
+Octagonal_Shape<T>::Status::ascii_load(std::istream& s) {
+  using namespace Implementation::Octagonal_Shapes;
+  PPL_UNINITIALIZED(bool, positive);
+
+  if (!get_field(s, zero_dim_univ, positive))
+    return false;
+  if (positive)
+    set_zero_dim_univ();
+
+  if (!get_field(s, empty, positive))
+    return false;
+  if (positive)
+    set_empty();
+
+  if (!get_field(s, strong_closed, positive))
+    return false;
+  if (positive)
+    set_strongly_closed();
+  else
+    reset_strongly_closed();
+
+  // Check invariants.
+  PPL_ASSERT(OK());
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Og_Status_inlines_hh)
diff --git a/src/Opposite_Floating_Point_Expression.defs.hh b/src/Opposite_Floating_Point_Expression.defs.hh
deleted file mode 100644
index cf4770e..0000000
--- a/src/Opposite_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,193 +0,0 @@
-/* Declarations for the Opposite_Floating_Point_Expression class and
-   its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Opposite_Floating_Point_Expression_defs_hh
-#define PPL_Opposite_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Opposite_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Opposite_Floating_Point_Expression */
-template<typename FP_Interval_Type, typename FP_Format>
-void swap(Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-          Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Opposite Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of opposite floating-point expressions
-
-  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ be an interval linear form and
-  let \f$\adlf\f$ be a sound unary operator on linear forms such that:
-
-  \f[
-  \adlf
-  \left(i + \sum_{v \in \cV}i_{v}v\right)
-  =
-  \left(\adifp i\right)
-  + \sum_{v \in \cV}\left(\adifp i_{v} \right)v,
-  \f]
-
-  Given a floating point expression \f$\ominus e\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval linear form
-  \f$\linexprenv{\ominus e}{\rho^{\#}}{\rho^{\#}_l}\f$
-  as follows:
-  \f[
-  \linexprenv{\ominus e}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \adlf
-  \left(
-  \linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}
-  \right).
-  \f]
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Opposite_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /* \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form FP_Linear_Form;
-
-  /* \brief
-     Alias for the std::map<dimension_type, FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /* \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /* \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /* \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with one parameter: builds the opposite floating point
-    expression \f$\ominus\f$ \p op.
-  */
-  explicit Opposite_Floating_Point_Expression(
-           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const op);
-
-  //! Destructor.
-  ~Opposite_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Note that all variables occuring in the expression represented
-    by \p operand MUST have an associated value in \p int_store.
-    If this precondition is not met, calling the method
-    causes an undefined behavior.
-
-    See the class description for a detailed explanation of how \p result
-    is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Opposite_Floating_Point_Expression& y);
-
-private:
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Opposite_Floating_Point_Expression(
-			  const Opposite_Floating_Point_Expression& y);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited assignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Opposite_Floating_Point_Expression& operator=(
-			  const Opposite_Floating_Point_Expression& y);
-
-  //! Pointer to the operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* operand;
-
-}; // class Opposite_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Opposite_Floating_Point_Expression.inlines.hh"
-
-#endif // !defined(PPL_Opposite_Floating_Point_Expression_defs_hh)
diff --git a/src/Opposite_Floating_Point_Expression.inlines.hh b/src/Opposite_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 1e0eb37..0000000
--- a/src/Opposite_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,79 +0,0 @@
-/* Opposite_Floating_Point_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Opposite_Floating_Point_Expression_inlines_hh
-#define PPL_Opposite_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-Opposite_Floating_Point_Expression(
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const op)
-  : operand(op)
-{
-  assert(op != 0);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-~Opposite_Floating_Point_Expression() {
-  delete operand;
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Opposite_Floating_Point_Expression& y) {
-  using std::swap;
-  swap(operand, y.operand);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline bool
-Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store& int_store,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  if (!operand->linearize(int_store, lf_store, result))
-    return false;
-
-  result.negate();
-  return true;
-}
-
-/*! \relates Opposite_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Opposite_Floating_Point_Expression_inlines_hh)
diff --git a/src/Opposite_Floating_Point_Expression.types.hh b/src/Opposite_Floating_Point_Expression.types.hh
deleted file mode 100644
index 5951a53..0000000
--- a/src/Opposite_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Opposite_Floating_Point_Expression_types_hh
-#define PPL_Opposite_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Opposite_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Opposite_Floating_Point_Expression_types_hh)
diff --git a/src/Opposite_Floating_Point_Expression_defs.hh b/src/Opposite_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..f853769
--- /dev/null
+++ b/src/Opposite_Floating_Point_Expression_defs.hh
@@ -0,0 +1,193 @@
+/* Declarations for the Opposite_Floating_Point_Expression class and
+   its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Opposite_Floating_Point_Expression_defs_hh
+#define PPL_Opposite_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Opposite_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Opposite_Floating_Point_Expression */
+template<typename FP_Interval_Type, typename FP_Format>
+void swap(Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+          Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Opposite Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of opposite floating-point expressions
+
+  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ be an interval linear form and
+  let \f$\adlf\f$ be a sound unary operator on linear forms such that:
+
+  \f[
+  \adlf
+  \left(i + \sum_{v \in \cV}i_{v}v\right)
+  =
+  \left(\adifp i\right)
+  + \sum_{v \in \cV}\left(\adifp i_{v} \right)v,
+  \f]
+
+  Given a floating point expression \f$\ominus e\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval linear form
+  \f$\linexprenv{\ominus e}{\rho^{\#}}{\rho^{\#}_l}\f$
+  as follows:
+  \f[
+  \linexprenv{\ominus e}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \adlf
+  \left(
+  \linexprenv{e}{\rho^{\#}}{\rho^{\#}_l}
+  \right).
+  \f]
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Opposite_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+    Alias for the Linear_Form<FP_Interval_Type> from
+    Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+    Alias for the std::map<dimension_type, FP_Interval_Type> from
+    Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+    Alias for the std::map<dimension_type, FP_Linear_Form> from
+    Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+    Alias for the FP_Interval_Type::boundary_type from
+    Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+    Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with one parameter: builds the opposite floating point
+    expression \f$\ominus\f$ \p op.
+  */
+  explicit Opposite_Floating_Point_Expression(
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const op);
+
+  //! Destructor.
+  ~Opposite_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Note that all variables occuring in the expression represented
+    by \p operand MUST have an associated value in \p int_store.
+    If this precondition is not met, calling the method
+    causes an undefined behavior.
+
+    See the class description for a detailed explanation of how \p result
+    is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Opposite_Floating_Point_Expression& y);
+
+private:
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Opposite_Floating_Point_Expression(
+                          const Opposite_Floating_Point_Expression& y);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited assignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Opposite_Floating_Point_Expression& operator=(
+                          const Opposite_Floating_Point_Expression& y);
+
+  //! Pointer to the operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* operand;
+
+}; // class Opposite_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Opposite_Floating_Point_Expression_inlines.hh"
+
+#endif // !defined(PPL_Opposite_Floating_Point_Expression_defs_hh)
diff --git a/src/Opposite_Floating_Point_Expression_inlines.hh b/src/Opposite_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..2e62b56
--- /dev/null
+++ b/src/Opposite_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,79 @@
+/* Opposite_Floating_Point_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Opposite_Floating_Point_Expression_inlines_hh
+#define PPL_Opposite_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+Opposite_Floating_Point_Expression(
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const op)
+  : operand(op)
+{
+  assert(op != 0);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+~Opposite_Floating_Point_Expression() {
+  delete operand;
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Opposite_Floating_Point_Expression& y) {
+  using std::swap;
+  swap(operand, y.operand);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline bool
+Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store& int_store,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  if (!operand->linearize(int_store, lf_store, result))
+    return false;
+
+  result.negate();
+  return true;
+}
+
+/*! \relates Opposite_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Opposite_Floating_Point_Expression_inlines_hh)
diff --git a/src/Opposite_Floating_Point_Expression_types.hh b/src/Opposite_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..fd8f3a4
--- /dev/null
+++ b/src/Opposite_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Opposite_Floating_Point_Expression_types_hh
+#define PPL_Opposite_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Opposite_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Opposite_Floating_Point_Expression_types_hh)
diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc
index 69e00e2..e02c103 100644
--- a/src/PIP_Problem.cc
+++ b/src/PIP_Problem.cc
@@ -1,6 +1,6 @@
 /* PIP_Problem class implementation: non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "PIP_Problem.defs.hh"
-#include "PIP_Tree.defs.hh"
+#include "PIP_Problem_defs.hh"
+#include "PIP_Tree_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
@@ -33,7 +33,7 @@ PPL::IO_Operators::operator<<(std::ostream& s, const PIP_Problem& pip) {
   s << "Space dimension: " << pip.space_dimension();
   s << "\nConstraints:";
   for (PIP_Problem::const_iterator i = pip.constraints_begin(),
-	 i_end = pip.constraints_end(); i != i_end; ++i)
+         i_end = pip.constraints_end(); i != i_end; ++i)
     s << "\n" << *i;
   s << "\nProblem parameters: " << pip.parameter_space_dimensions();
   if (pip.get_big_parameter_dimension() == not_a_dimension())
@@ -63,7 +63,7 @@ PPL::PIP_Problem::PIP_Problem(const dimension_type dim)
   PPL_ASSERT(OK());
 }
 
-PPL::PIP_Problem::PIP_Problem(const PIP_Problem &y)
+PPL::PIP_Problem::PIP_Problem(const PIP_Problem& y)
   : external_space_dim(y.external_space_dim),
     internal_space_dim(y.internal_space_dim),
     status(y.status),
@@ -157,7 +157,8 @@ PPL::PIP_Problem::solve() const {
             // Adjust inhomogeneous term if strict.
             if (c.is_strict_inequality())
               --(*itr);
-          } else {
+          }
+          else {
             // Adjust inhomogeneous term if strict.
             if (c.is_strict_inequality())
               itr = row.insert(0, -1);
@@ -176,7 +177,8 @@ PPL::PIP_Problem::solve() const {
                 = c.coefficient(Variable(*pi));
               if (coeff_pi != 0)
                 itr = row.insert(itr, i, coeff_pi);
-            } else
+            }
+            else
               break;
           }
         }
@@ -191,8 +193,8 @@ PPL::PIP_Problem::solve() const {
 
           last_row = x.initial_context[x.initial_context.num_rows()-2];
 
-          for (Row::iterator
-               i = last_row.begin(), i_end = last_row.end(); i != i_end; ++i)
+          for (Row::iterator i = last_row.begin(),
+                 i_end = last_row.end(); i != i_end; ++i)
             neg_assign(*i);
         }
       }
@@ -266,8 +268,8 @@ PPL::PIP_Problem::OK() const {
   if (external_space_dim < internal_space_dim) {
 #ifndef NDEBUG
       cerr << "The internal space dimension of the PIP_Problem is "
-	   << "greater than its external space dimension."
-	   << endl;
+           << "greater than its external space dimension."
+           << endl;
       ascii_dump(cerr);
 #endif
       return false;
@@ -280,7 +282,7 @@ PPL::PIP_Problem::OK() const {
 #ifndef NDEBUG
       cerr << "The space dimension of the PIP_Problem is smaller than "
            << "the space dimension of one of its constraints."
-	   << endl;
+           << endl;
       ascii_dump(cerr);
 #endif
       return false;
@@ -294,7 +296,7 @@ PPL::PIP_Problem::OK() const {
       && strategy != CUTTING_STRATEGY_ALL) {
 #ifndef NDEBUG
     cerr << "Invalid value for the CUTTING_STRATEGY control parameter."
-	 << endl;
+         << endl;
     ascii_dump(cerr);
 #endif
     return false;
@@ -385,7 +387,7 @@ PPL::PIP_Problem::ascii_dump(std::ostream& s) const {
 
   s << "\ncontrol_parameters\n";
   for (dimension_type i = 0; i < CONTROL_PARAMETER_NAME_SIZE; ++i) {
-    Control_Parameter_Value value = control_parameters[i];
+    const Control_Parameter_Value value = control_parameters[i];
     switch (value) {
     case CUTTING_STRATEGY_FIRST:
       s << "CUTTING_STRATEGY_FIRST";
@@ -413,12 +415,13 @@ PPL::PIP_Problem::ascii_dump(std::ostream& s) const {
   s << "\ncurrent_solution: ";
   if (current_solution == 0)
     s << "BOTTOM\n";
-  else if (const PIP_Decision_Node* dec = current_solution->as_decision()) {
+  else if (const PIP_Decision_Node* const dec
+             = current_solution->as_decision()) {
     s << "DECISION\n";
     dec->ascii_dump(s);
   }
   else {
-    const PIP_Solution_Node* sol = current_solution->as_solution();
+    const PIP_Solution_Node* const sol = current_solution->as_solution();
     PPL_ASSERT(sol != 0);
     s << "SOLUTION\n";
     sol->ascii_dump(s);
@@ -531,14 +534,14 @@ PPL::PIP_Problem::ascii_load(std::istream& s) {
   if (str == "BOTTOM")
     current_solution = 0;
   else if (str == "DECISION") {
-    PIP_Decision_Node* dec = new PIP_Decision_Node(0, 0, 0);
+    PIP_Decision_Node* const dec = new PIP_Decision_Node(0, 0, 0);
     current_solution = dec;
     if (!dec->ascii_load(s))
       return false;
     dec->set_owner(this);
   }
   else if (str == "SOLUTION") {
-    PIP_Solution_Node* sol = new PIP_Solution_Node(0);
+    PIP_Solution_Node* const sol = new PIP_Solution_Node(0);
     current_solution = sol;
     if (!sol->ascii_load(s))
       return false;
@@ -646,7 +649,7 @@ PPL::PIP_Problem::add_constraint(const Constraint& c) {
 }
 
 void
-PPL::PIP_Problem::add_constraints(const Constraint_System &cs) {
+PPL::PIP_Problem::add_constraints(const Constraint_System& cs) {
   for (Constraint_System::const_iterator ci = cs.begin(),
          ci_end = cs.end(); ci != ci_end; ++ci)
     add_constraint(*ci);
@@ -703,7 +706,7 @@ PPL::PIP_Problem::external_memory_in_bytes() const {
   // Adding the external memory for `input_cs'.
   n += input_cs.capacity() * sizeof(Constraint);
   for (const_iterator i = input_cs.begin(),
-       i_end = input_cs.end(); i != i_end; ++i)
+         i_end = input_cs.end(); i != i_end; ++i)
     n += (i->external_memory_in_bytes());
   // FIXME: Adding the external memory for `parameters'.
   n += parameters.size() * sizeof(dimension_type);
diff --git a/src/PIP_Problem.defs.hh b/src/PIP_Problem.defs.hh
deleted file mode 100644
index 75a9f72..0000000
--- a/src/PIP_Problem.defs.hh
+++ /dev/null
@@ -1,834 +0,0 @@
-/* PIP_Problem class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_PIP_Problem_defs_hh
-#define PPL_PIP_Problem_defs_hh 1
-
-#include "PIP_Problem.types.hh"
-#include "PIP_Tree.types.hh"
-#include "globals.types.hh"
-#include "Linear_Expression.defs.hh"
-#include "Constraint.defs.hh"
-#include "Constraint_System.types.hh"
-#include "Generator.defs.hh"
-#include "Variables_Set.defs.hh"
-#include <vector>
-#include <deque>
-#include <iosfwd>
-
-#include "Matrix.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::PIP_Problem */
-std::ostream&
-operator<<(std::ostream& s, const PIP_Problem& pip);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates PIP_Problem */
-void swap(PIP_Problem& x, PIP_Problem& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A Parametric Integer (linear) Programming problem.
-/*! \ingroup PPL_CXX_interface
-  An object of this class encodes a parametric integer (linear)
-  programming problem. The PIP problem is specified by providing:
-   - the dimension of the vector space;
-   - the subset of those dimensions of the vector space that are
-     interpreted as integer parameters (the other space dimensions
-     are interpreted as non-parameter integer variables);
-   - a finite set of linear equality and (strict or non-strict)
-     inequality constraints involving variables and/or parameters;
-     these constraints are used to define:
-       - the <EM>feasible region</EM>, if they involve one or more
-         problem variable (and maybe some parameters);
-       - the <EM>initial context</EM>, if they only involve the
-         parameters;
-   - optionally, the so-called <EM>big parameter</EM>,
-     i.e., a problem parameter to be considered arbitrarily big.
-
-  Note that all problem variables and problem parameters are assumed
-  to take non-negative integer values, so that there is no need
-  to specify non-negativity constraints.
-
-  The class provides support for the (incremental) solution of the
-  PIP problem based on variations of the revised simplex method and
-  on Gomory cut generation techniques.
-
-  The solution for a PIP problem is the lexicographic minimum of the
-  integer points of the feasible region, expressed in terms of the
-  parameters. As the problem to be solved only involves non-negative
-  variables and parameters, the problem will always be either unfeasible
-  or optimizable.
-
-  As the feasibility and the solution value of a PIP problem depend on the
-  values of the parameters, the solution is a binary decision tree,
-  dividing the context parameter set into subsets.
-  The tree nodes are of two kinds:
-   - \e Decision nodes.
-     These are internal tree nodes encoding one or more linear tests
-     on the parameters; if all the tests are satisfied, then the solution
-     is the node's \e true child; otherwise, the solution is the node's
-     \e false child;
-   - \e Solution nodes.
-     These are leaf nodes in the tree, encoding the solution of the problem
-     in the current context subset, where each variable is defined in terms
-     of a linear expression of the parameters.
-     Solution nodes also optionally embed a set of parameter constraints:
-     if all these constraints are satisfied, the solution is described by
-     the node, otherwise the problem has no solution.
-
-  It may happen that a decision node has no \e false child. This means
-  that there is no solution if at least one of the corresponding
-  constraints is not satisfied. Decision nodes having two or more linear
-  tests on the parameters cannot have a \e false child. Decision nodes
-  always have a \e true child.
-
-  Both kinds of tree nodes may also contain the definition of extra
-  parameters which are artificially introduced by the solver to enforce
-  an integral solution. Such artificial parameters are defined by
-  the integer division of a linear expression on the parameters
-  by an integer coefficient.
-
-  By exploiting the incremental nature of the solver, it is possible
-  to reuse part of the computational work already done when solving
-  variants of a given PIP_Problem: currently, incremental resolution
-  supports the addition of space dimensions, the addition of parameters
-  and the addition of constraints.
-
-  \par Example problem
-  An example PIP problem can be defined the following:
-  \code
-  3*j >= -2*i+8
-  j <= 4*i - 4
-  i <= n
-  j <= m
-  \endcode
-  where \c i and \c j are the problem variables
-  and \c n and \c m are the problem parameters.
-  This problem can be optimized; the resulting solution tree may be
-  represented as follows:
-  \verbatim
-  if 7*n >= 10 then
-    if 7*m >= 12 then
-      {i = 2 ; j = 2}
-    else
-      Parameter P = (m) div 2
-      if 2*n + 3*m >= 8 then
-        {i = -m - P + 4 ; j = m}
-      else
-        _|_
-  else
-    _|_
-  \endverbatim
-  The solution tree starts with a decision node depending on the
-  context constraint <code>7*n >= 10</code>.
-  If this constraint is satisfied by the values assigned to the
-  problem parameters, then the (textually first) \c then branch is taken,
-  reaching the \e true child of the root node (which in this case
-  is another decision node); otherwise, the (textually last) \c else
-  branch is taken, for which there is no corresponding \e false child.
-  \par
-  The \f$\perp\f$ notation, also called \e bottom, denotes the
-  lexicographic minimum of an empty set of solutions,
-  here meaning the corresponding subproblem is unfeasible.
-  \par
-  Notice that a tree node may introduce new (non-problem) parameters,
-  as is the case for parameter \c P in the (textually first) \c else
-  branch above. These \e artificial parameters are only meaningful
-  inside the subtree where they are defined and are used to define
-  the parametric values of the problem variables in solution nodes
-  (e.g., the <CODE>{i,j}</CODE> vector in the textually third \c then branch).
-
-  \par Context restriction
-  The above solution is correct in an unrestricted initial context,
-  meaning all possible values are allowed for the parameters. If we
-  restrict the context with the following parameter inequalities:
-  \code
-  m >= n
-  n >= 5
-  \endcode
-  then the resulting optimizing tree will be a simple solution node:
-  \verbatim
-  {i = 2 ; j = 2}
-  \endverbatim
-
-  \par Creating the PIP_Problem object
-  The PIP_Problem object corresponding to the above example can be
-  created as follows:
-  \code
-  Variable i(0);
-  Variable j(1);
-  Variable n(2);
-  Variable m(3);
-  Variables_Set params(n, m);
-  Constraint_System cs;
-  cs.insert(3*j >= -2*i+8);
-  cs.insert(j <= 4*i - 4);
-  cs.insert(j <= m);
-  cs.insert(i <= n);
-  PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params);
-  \endcode
-  If you want to restrict the initial context, simply add the parameter
-  constraints the same way as for normal constraints.
-  \code
-  cs.insert(m >= n);
-  cs.insert(n >= 5);
-  \endcode
-
-  \par Solving the problem
-  Once the PIP_Problem object has been created, you can start the
-  resolution of the problem by calling the solve() method:
-  \code
-  PIP_Problem_Status status = pip.solve();
-  \endcode
-  where the returned \c status indicates if the problem has been optimized
-  or if it is unfeasible for any possible configuration of the parameter
-  values. The resolution process is also started if an attempt is made
-  to get its solution, as follows:
-  \code
-  const PIP_Tree_Node* node = pip.solution();
-  \endcode
-  In this case, an unfeasible problem will result in an empty solution
-  tree, i.e., assigning a null pointer to \c node.
-
-  \par Printing the solution tree
-  A previously computed solution tree may be printed as follows:
-  \code
-  pip.print_solution(std::cout);
-  \endcode
-  This will produce the following output (note: variables and parameters
-  are printed according to the default output function; see
-  <code>Variable::set_output_function</code>):
-  \verbatim
-  if 7*C >= 10 then
-    if 7*D >= 12 then
-      {2 ; 2}
-    else
-      Parameter E = (D) div 2
-      if 2*C + 3*D >= 8 then
-        {-D - E + 4 ; D}
-      else
-        _|_
-  else
-    _|_
-  \endverbatim
-
-  \par Spanning the solution tree
-  A parameter assignment for a PIP problem binds each of the problem
-  parameters to a non-negative integer value. After fixing a parameter
-  assignment, the ``spanning'' of the PIP problem solution tree refers
-  to the process whereby the solution tree is navigated, starting from
-  the root node: the value of artificial parameters is computed according
-  to the parameter assignment and the node's constraints are evaluated,
-  thereby descending in either the true or the false subtree of decision
-  nodes and eventually reaching a solution node or a bottom node.
-  If a solution node is found, each of the problem variables is provided
-  with a parametric expression, which can be evaluated to a fixed value
-  using the given parameter assignment and the computed values for
-  artificial parameters.
-  \par
-  The coding of the spanning process can be done as follows.
-  First, the root of the PIP solution tree is retrieved:
-  \code
-  const PIP_Tree_Node* node = pip.solution();
-  \endcode
-  If \c node represents an unfeasible solution (i.e., \f$\perp\f$),
-  its value will be \c 0. For a non-null tree node, the virtual methods
-  \c PIP_Tree_Node::as_decision() and \c PIP_Tree_Node::as_solution()
-  can be used to check whether the node is a decision or a solution node:
-  \code
-  const PIP_Solution_Node* sol = node->as_solution();
-  if (sol != 0) {
-    // The node is a solution node
-    ...
-  }
-  else {
-    // The node is a decision node
-    const PIP_Decision_Node* dec = node->as_decision();
-    ...
-  }
-  \endcode
-  \par
-  The true (resp., false) child node of a Decision Node may be accessed by
-  using method \c PIP_Decision_Node::child_node(bool), passing \c true
-  (resp., \c false) as the input argument.
-
-  \par Artificial parameters
-  A PIP_Tree_Node::Artificial_Parameter object represents the result
-  of the integer division of a Linear_Expression (on the other
-  parameters, including the previously-defined artificials)
-  by an integer denominator (a Coefficient object).
-  The dimensions of the artificial parameters (if any) in a tree node
-  have consecutive indices starting from <code>dim+1</code>, where the value
-  of \c dim is computed as follows:
-   - for the tree root node, \c dim is the space dimension of the PIP_Problem;
-   - for any other node of the tree, it is recursively obtained by adding
-     the value of \c dim computed for the parent node to the number of
-     artificial parameters defined in the parent node.
-  \par
-  Since the numbering of dimensions for artificial parameters follows
-  the rule above, the addition of new problem variables and/or new problem
-  parameters to an already solved PIP_Problem object (as done when
-  incrementally solving a problem) will result in the systematic
-  renumbering of all the existing artificial parameters.
-
-  \par Node constraints
-  All kind of tree nodes can contain context constraints.
-  Decision nodes always contain at least one of them.
-  The node's local constraint system can be obtained using method
-  PIP_Tree_Node::constraints.
-  These constraints only involve parameters, including both the problem
-  parameters and the artificial parameters that have been defined
-  in nodes occurring on the path from the root node to the current node.
-  The meaning of these constraints is as follows:
-   - On a decision node, if all tests in the constraints are true, then the
-     solution is the \e true child; otherwise it is the \e false child.
-   - On a solution node, if the (possibly empty) system of constraints
-     evaluates to true for a given parameter assignment, then the solution
-     is described by the node; otherwise the solution is \f$\perp\f$
-     (i.e., the problem is unfeasible for that parameter assignment).
-
-  \par Getting the optimal values for the variables
-  After spanning the solution tree using the given parameter assignment,
-  if a solution node has been reached, then it is possible to retrieve
-  the parametric expression for each of the problem variables using
-  method PIP_Solution_Node::parametric_values. The retrieved expression
-  will be defined in terms of all the parameters (problem parameters
-  and artificial parameters defined along the path).
-
-  \par Solving maximization problems
-  You can solve a lexicographic maximization problem by reformulating its
-  constraints using variable substitution. Proceed the following steps:
-   - Create a big parameter (see PIP_Problem::set_big_parameter_dimension),
-     which we will call \f$M\f$.
-   - Reformulate each of the maximization problem constraints by
-     substituting each \f$x_i\f$ variable with an expression of the form
-     \f$M-x'_i\f$, where the \f$x'_i\f$ variables are positive variables to
-     be minimized.
-   - Solve the lexicographic minimum for the \f$x'\f$ variable vector.
-   - In the solution expressions, the values of the \f$x'\f$ variables will
-     be expressed in the form: \f$x'_i = M-x_i\f$. To get back the value of
-     the expression of each \f$x_i\f$ variable, just apply the
-     formula: \f$x_i = M-x'_i\f$.
-  \par
-  Note that if the resulting expression of one of the \f$x'_i\f$ variables
-  is not in the \f$x'_i = M-x_i\f$ form, this means that the
-  sign-unrestricted problem is unbounded.
-  \par
-  You can choose to maximize only a subset of the variables while minimizing
-  the other variables. In that case, just apply the variable substitution
-  method on the variables you want to be maximized. The variable
-  optimization priority will still be in lexicographic order.
-
-  \par
-  \b Example: consider you want to find the lexicographic maximum of the
-  \f$(x,y)\f$ vector, under the constraints:
-    \f[\left\{\begin{array}{l}
-      y \geq 2x - 4\\
-      y \leq -x + p
-    \end{array}\right.\f]
-  \par
-  where \f$p\f$ is a parameter.
-  \par
-  After variable substitution, the constraints become:
-    \f[\left\{\begin{array}{l}
-      M - y \geq 2M - 2x - 4\\
-      M - y \leq -M + x + p
-    \end{array}\right.\f]
-  \par
-  The code for creating the corresponding problem object is the following:
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable p(2);
-  Variable M(3);
-  Variables_Set params(p, M);
-  Constraint_System cs;
-  cs.insert(M - y >= 2*M - 2*x - 4);
-  cs.insert(M - y <= -M + x + p);
-  PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params);
-  pip.set_big_parameter_dimension(3);     // M is the big parameter
-  \endcode
-  Solving the problem provides the following solution:
-  \verbatim
-  Parameter E = (C + 1) div 3
-  {D - E - 1 ; -C + D + E + 1}
-  \endverbatim
-  Under the notations above, the solution is:
-  \f[ \left\{\begin{array}{l}
-    x' = M - \left\lfloor\frac{p+1}{3}\right\rfloor - 1 \\
-    y' = M - p + \left\lfloor\frac{p+1}{3}\right\rfloor + 1
-  \end{array}\right.
-  \f]
-  \par
-  Performing substitution again provides us with the values of the original
-  variables:
-  \f[ \left\{\begin{array}{l}
-    x = \left\lfloor\frac{p+1}{3}\right\rfloor + 1 \\
-    y = p - \left\lfloor\frac{p+1}{3}\right\rfloor - 1
-  \end{array}\right.
-  \f]
-
-  \par Allowing variables to be arbitrarily signed
-  You can deal with arbitrarily signed variables by reformulating the
-  constraints using variable substitution. Proceed the following steps:
-   - Create a big parameter (see PIP_Problem::set_big_parameter_dimension),
-     which we will call \f$M\f$.
-   - Reformulate each of the maximization problem constraints by
-     substituting each \f$x_i\f$ variable with an expression of the form
-     \f$x'_i-M\f$, where the \f$x'_i\f$ variables are positive.
-   - Solve the lexicographic minimum for the \f$x'\f$ variable vector.
-   - The solution expression can be read in the form:
-   - In the solution expressions, the values of the \f$x'\f$ variables will
-     be expressed in the form: \f$x'_i = x_i+M\f$. To get back the value of
-     the expression of each signed \f$x_i\f$ variable, just apply the
-     formula: \f$x_i = x'_i-M\f$.
-  \par
-  Note that if the resulting expression of one of the \f$x'_i\f$ variables
-  is not in the \f$x'_i = x_i+M\f$ form, this means that the
-  sign-unrestricted problem is unbounded.
-  \par
-  You can choose to define only a subset of the variables to be
-  sign-unrestricted. In that case, just apply the variable substitution
-  method on the variables you want to be sign-unrestricted.
-
-  \par
-  \b Example: consider you want to find the lexicographic minimum of the
-  \f$(x,y)\f$ vector, where the \f$x\f$ and \f$y\f$ variables are
-  sign-unrestricted, under the constraints:
-    \f[\left\{\begin{array}{l}
-      y \geq -2x - 4\\
-      2y \leq x + 2p
-    \end{array}\right.\f]
-  \par
-  where \f$p\f$ is a parameter.
-  \par
-  After variable substitution, the constraints become:
-    \f[\left\{\begin{array}{l}
-      y' - M \geq -2x' + 2M - 4\\
-      2y' - 2M \leq x' - M + 2p
-    \end{array}\right.\f]
-  \par
-  The code for creating the corresponding problem object is the following:
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable p(2);
-  Variable M(3);
-  Variables_Set params(p, M);
-  Constraint_System cs;
-  cs.insert(y - M >= -2*x + 2*M - 4);
-  cs.insert(2*y - 2*M <= x - M + 2*p);
-  PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params);
-  pip.set_big_parameter_dimension(3);     // M is the big parameter
-  \endcode
-  \par
-  Solving the problem provides the following solution:
-  \verbatim
-  Parameter E = (2*C + 3) div 5
-  {D - E - 1 ; D + 2*E - 2}
-  \endverbatim
-  Under the notations above, the solution is:
-  \f[ \left\{\begin{array}{l}
-    x' = M - \left\lfloor\frac{2p+3}{5}\right\rfloor - 1 \\
-    y' = M + 2\left\lfloor\frac{2p+3}{5}\right\rfloor - 2
-  \end{array}\right.
-  \f]
-  \par
-  Performing substitution again provides us with the values of the original
-  variables:
-  \f[ \left\{\begin{array}{l}
-    x = -\left\lfloor\frac{2p+3}{5}\right\rfloor - 1 \\
-    y = 2\left\lfloor\frac{2p+3}{5}\right\rfloor - 2
-  \end{array}\right.
-  \f]
-
-  \par Allowing parameters to be arbitrarily signed
-  You can consider a parameter \f$p\f$ arbitrarily signed by replacing
-  \f$p\f$ with \f$p^+-p^-\f$, where both \f$p^+\f$ and \f$p^-\f$ are
-  positive parameters. To represent a set of arbitrarily signed parameters,
-  replace each parameter \f$p_i\f$ with \f$p^+_i-p^-\f$, where \f$-p^-\f$ is
-  the minimum negative value of all parameters.
-
-  \par Minimizing a linear cost function
-  Lexicographic solving can be used to find the parametric minimum of a
-  linear cost function.
-  \par
-  Suppose the variables are named \f$x_1, x_2, \dots, x_n\f$, and the
-  parameters \f$p_1, p_2, \dots, p_m\f$. You can minimize a linear cost
-  function \f$f(x_2, \dots, x_n, p_1, \dots, p_m)\f$ by simply adding the
-  constraint \f$x_1 \geq f(x_2, \dots, x_n, p_1, \dots, p_m)\f$ to the
-  constraint system. As lexicographic minimization ensures \f$x_1\f$ is
-  minimized in priority, and because \f$x_1\f$ is forced by a constraint to
-  be superior or equal to the cost function, optimal solutions of the
-  problem necessarily ensure that the solution value of \f$x_1\f$ is the
-  optimal value of the cost function.
-*/
-class Parma_Polyhedra_Library::PIP_Problem {
-public:
-  //! Builds a trivial PIP problem.
-  /*!
-    A trivial PIP problem requires to compute the lexicographic minimum
-    on a vector space under no constraints and with no parameters:
-    due to the implicit non-negativity constraints, the origin of the
-    vector space is an optimal solution.
-
-    \param dim
-    The dimension of the vector space enclosing \p *this
-    (optional argument with default value \f$0\f$).
-
-    \exception std::length_error
-    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
-  */
-  explicit PIP_Problem(dimension_type dim = 0);
-
-  /*! \brief
-    Builds a PIP problem having space dimension \p dim
-    from the sequence of constraints in the range
-    \f$[\mathrm{first}, \mathrm{last})\f$;
-    those dimensions whose indices occur in \p p_vars are
-    interpreted as parameters.
-
-    \param dim
-    The dimension of the vector space (variables and parameters) enclosing
-    \p *this.
-
-    \param first
-    An input iterator to the start of the sequence of constraints.
-
-    \param last
-    A past-the-end input iterator to the sequence of constraints.
-
-    \param p_vars
-    The set of variables' indexes that are interpreted as parameters.
-
-    \exception std::length_error
-    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
-
-    \exception std::invalid_argument
-    Thrown if the space dimension of a constraint in the sequence
-    (resp., the parameter variables) is strictly greater than \p dim.
-  */
-  template <typename In>
-  PIP_Problem(dimension_type dim, In first, In last,
-	      const Variables_Set& p_vars);
-
-  //! Ordinary copy-constructor.
-  PIP_Problem(const PIP_Problem& y);
-
-  //! Destructor.
-  ~PIP_Problem();
-
-  //! Assignment operator.
-  PIP_Problem& operator=(const PIP_Problem& y);
-
-  //! Returns the maximum space dimension a PIP_Problem can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the space dimension of the PIP problem.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns a set containing all the variables' indexes representing
-    the parameters of the PIP problem.
-  */
-  const Variables_Set& parameter_space_dimensions() const;
-
-private:
-  //! A type alias for a sequence of constraints.
-  typedef std::vector<Constraint> Constraint_Sequence;
-
-public:
-  /*! \brief
-    A type alias for the read-only iterator on the constraints
-    defining the feasible region.
-  */
-  typedef Constraint_Sequence::const_iterator const_iterator;
-
-  /*! \brief
-    Returns a read-only iterator to the first constraint defining
-    the feasible region.
-  */
-  const_iterator constraints_begin() const;
-
-  /*! \brief
-    Returns a past-the-end read-only iterator to the sequence of
-    constraints defining the feasible region.
-  */
-  const_iterator constraints_end() const;
-
-  //! Resets \p *this to be equal to the trivial PIP problem.
-  /*!
-    The space dimension is reset to \f$0\f$.
-  */
-  void clear();
-
-  /*! \brief
-    Adds <CODE>m_vars + m_params</CODE> new space dimensions
-    and embeds the old PIP problem in the new vector space.
-
-    \param m_vars
-    The number of space dimensions to add that are interpreted as
-    PIP problem variables (i.e., non parameters). These are added
-    \e before adding the \p m_params parameters.
-
-    \param m_params
-    The number of space dimensions to add that are interpreted as
-    PIP problem parameters. These are added \e after having added the
-    \p m_vars problem variables.
-
-    \exception std::length_error
-    Thrown if adding <CODE>m_vars + m_params</CODE> new space
-    dimensions would cause the vector space to exceed dimension
-    <CODE>max_space_dimension()</CODE>.
-
-    The new space dimensions will be those having the highest indexes
-    in the new PIP problem; they are initially unconstrained.
-  */
-  void add_space_dimensions_and_embed(dimension_type m_vars,
-                                      dimension_type m_params);
-
-  /*! \brief
-    Sets the space dimensions whose indexes which are in set \p p_vars
-    to be parameter space dimensions.
-
-    \exception std::invalid_argument
-    Thrown if some index in \p p_vars does not correspond to
-    a space dimension in \p *this.
-  */
-  void add_to_parameter_space_dimensions(const Variables_Set& p_vars);
-
-  /*! \brief
-    Adds a copy of constraint \p c to the PIP problem.
-
-    \exception std::invalid_argument
-    Thrown if the space dimension of \p c is strictly greater than
-    the space dimension of \p *this.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds a copy of the constraints in \p cs to the PIP problem.
-
-    \exception std::invalid_argument
-    Thrown if the space dimension of constraint system \p cs is strictly
-    greater than the space dimension of \p *this.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  //! Checks satisfiability of \p *this.
-  /*!
-    \return
-    \c true if and only if the PIP problem is satisfiable.
-  */
-  bool is_satisfiable() const;
-
-  //! Optimizes the PIP problem.
-  /*!
-    \return
-    A PIP_Problem_Status flag indicating the outcome of the optimization
-    attempt (unfeasible or optimized problem).
-  */
-  PIP_Problem_Status solve() const;
-
-  //! Returns a feasible solution for \p *this, if it exists.
-  /*!
-    A null pointer is returned for an unfeasible PIP problem.
-  */
-  PIP_Tree solution() const;
-
-  //! Returns an optimizing solution for \p *this, if it exists.
-  /*!
-    A null pointer is returned for an unfeasible PIP problem.
-  */
-  PIP_Tree optimizing_solution() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //! Prints on \p s the solution computed for \p *this.
-  /*!
-    \param s
-    The output stream.
-
-    \param indent
-    An indentation parameter (default value 0).
-
-    \exception std::logic_error
-    Thrown if trying to print the solution when the PIP problem
-    still has to be solved.
-  */
-  void print_solution(std::ostream& s, int indent = 0) const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(PIP_Problem& y);
-
-  //! Possible names for PIP_Problem control parameters.
-  enum Control_Parameter_Name {
-    //! Cutting strategy
-    CUTTING_STRATEGY,
-    //! Pivot row strategy
-    PIVOT_ROW_STRATEGY,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-    //! Number of different enumeration values.
-#endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-    CONTROL_PARAMETER_NAME_SIZE
-  };
-
-  //! Possible values for PIP_Problem control parameters.
-  enum Control_Parameter_Value {
-    //! Choose the first non-integer row.
-    CUTTING_STRATEGY_FIRST,
-    //! Choose row which generates the deepest cut.
-    CUTTING_STRATEGY_DEEPEST,
-    //! Always generate all possible cuts.
-    CUTTING_STRATEGY_ALL,
-
-    //! Choose the first row with negative parameter sign.
-    PIVOT_ROW_STRATEGY_FIRST,
-    //! Choose a row that generates a lexicographically maximal pivot column.
-    PIVOT_ROW_STRATEGY_MAX_COLUMN,
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-    //! Number of different enumeration values.
-#endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-    CONTROL_PARAMETER_VALUE_SIZE
-  };
-
-  //! Returns the value of control parameter \p name.
-  Control_Parameter_Value
-  get_control_parameter(Control_Parameter_Name name) const;
-
-  //! Sets control parameter \p value.
-  void set_control_parameter(Control_Parameter_Value value);
-
-  //! Sets the dimension for the big parameter to \p big_dim.
-  void set_big_parameter_dimension(dimension_type big_dim);
-
-  /*! \brief
-    Returns the space dimension for the big parameter.
-
-    If a big parameter was not set, returns \c not_a_dimension().
-  */
-  dimension_type get_big_parameter_dimension() const;
-
-private:
-  //! Initializes the control parameters with default values.
-  void control_parameters_init();
-
-  //! Copies the control parameters from problem object \p y.
-  void control_parameters_copy(const PIP_Problem& y);
-
-  //! The dimension of the vector space.
-  dimension_type external_space_dim;
-
-  /*! \brief
-    The space dimension of the current (partial) solution of the
-    PIP problem; it may be smaller than \p external_space_dim.
-  */
-  dimension_type internal_space_dim;
-
-  //! An enumerated type describing the internal status of the PIP problem.
-  enum Status {
-    //! The PIP problem is unsatisfiable.
-    UNSATISFIABLE,
-    //! The PIP problem is optimized; the solution tree has been computed.
-    OPTIMIZED,
-    /*! \brief
-      The feasible region of the PIP problem has been changed by adding
-      new variables, parameters or constraints; a feasible solution for
-      the old feasible region is still available.
-    */
-    PARTIALLY_SATISFIABLE
-  };
-
-  //! The internal state of the MIP problem.
-  Status status;
-
-  //! The current solution decision tree
-  PIP_Tree_Node* current_solution;
-
-  //! The sequence of constraints describing the feasible region.
-  Constraint_Sequence input_cs;
-
-  //! The first index of `input_cs' containing a pending constraint.
-  dimension_type first_pending_constraint;
-
-  /*! \brief
-    A set containing all the indices of space dimensions that are
-    interpreted as problem parameters.
-  */
-  Variables_Set parameters;
-
-#if PPL_USE_SPARSE_MATRIX
-  typedef Sparse_Row Row;
-#else
-  typedef Dense_Row Row;
-#endif
-
-  /*! \brief
-    The initial context
-
-    Contains problem constraints on parameters only
-  */
-  Matrix<Row> initial_context;
-
-  //! The control parameters for the problem object.
-  Control_Parameter_Value
-  control_parameters[CONTROL_PARAMETER_NAME_SIZE];
-
-  /*! \brief
-    The dimension for the big parameter, or \c not_a_dimension()
-    if not set.
-  */
-  dimension_type big_parameter_dimension;
-
-  friend class PIP_Solution_Node;
-};
-
-#include "PIP_Problem.inlines.hh"
-#include "PIP_Problem.templates.hh"
-
-#endif // !defined(PPL_PIP_Problem_defs_hh)
diff --git a/src/PIP_Problem.inlines.hh b/src/PIP_Problem.inlines.hh
deleted file mode 100644
index 05a217f..0000000
--- a/src/PIP_Problem.inlines.hh
+++ /dev/null
@@ -1,96 +0,0 @@
-/* PIP_Problem class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_PIP_Problem_inlines_hh
-#define PPL_PIP_Problem_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline dimension_type
-PIP_Problem::space_dimension() const {
-  return external_space_dim;
-}
-
-inline dimension_type
-PIP_Problem::max_space_dimension() {
-  return Constraint::max_space_dimension();
-}
-
-inline PIP_Problem::const_iterator
-PIP_Problem::constraints_begin() const {
-  return input_cs.begin();
-}
-
-inline PIP_Problem::const_iterator
-PIP_Problem::constraints_end() const {
-  return input_cs.end();
-}
-
-inline const Variables_Set&
-PIP_Problem::parameter_space_dimensions() const {
-  return parameters;
-}
-
-inline void
-PIP_Problem::m_swap(PIP_Problem& y) {
-  using std::swap;
-  swap(external_space_dim, y.external_space_dim);
-  swap(internal_space_dim, y.internal_space_dim);
-  swap(status, y.status);
-  swap(current_solution, y.current_solution);
-  swap(input_cs, y.input_cs);
-  swap(first_pending_constraint, y.first_pending_constraint);
-  swap(parameters, y.parameters);
-  swap(initial_context, y.initial_context);
-  for (dimension_type i = CONTROL_PARAMETER_NAME_SIZE; i-- > 0; )
-    swap(control_parameters[i], y.control_parameters[i]);
-  swap(big_parameter_dimension, y.big_parameter_dimension);
-}
-
-inline PIP_Problem&
-PIP_Problem::operator=(const PIP_Problem& y) {
-  PIP_Problem tmp(y);
-  m_swap(tmp);
-  return *this;
-}
-
-inline PIP_Problem::Control_Parameter_Value
-PIP_Problem::get_control_parameter(Control_Parameter_Name name) const {
-  PPL_ASSERT(name >= 0 && name < CONTROL_PARAMETER_NAME_SIZE);
-  return control_parameters[name];
-}
-
-inline dimension_type
-PIP_Problem::get_big_parameter_dimension() const {
-  return big_parameter_dimension;
-}
-
-/*! \relates PIP_Problem */
-inline void
-swap(PIP_Problem& x, PIP_Problem& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_PIP_Problem_inlines_hh)
diff --git a/src/PIP_Problem.templates.hh b/src/PIP_Problem.templates.hh
deleted file mode 100644
index fe3a96a..0000000
--- a/src/PIP_Problem.templates.hh
+++ /dev/null
@@ -1,81 +0,0 @@
-/* PIP_Problem class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_PIP_Problem_templates_hh
-#define PPL_PIP_Problem_templates_hh 1
-
-#include "Variables_Set.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename In>
-PIP_Problem::PIP_Problem(dimension_type dim,
-                         In first, In last,
-                         const Variables_Set& p_vars)
-  : external_space_dim(dim),
-    internal_space_dim(0),
-    status(PARTIALLY_SATISFIABLE),
-    current_solution(0),
-    input_cs(),
-    first_pending_constraint(0),
-    parameters(p_vars),
-    initial_context(),
-    big_parameter_dimension(not_a_dimension()) {
-  // Check that integer Variables_Set does not exceed the space dimension
-  // of the problem.
-  if (p_vars.space_dimension() > external_space_dim) {
-    std::ostringstream s;
-    s << "PPL::PIP_Problem::PIP_Problem(dim, first, last, p_vars):\n"
-      << "dim == " << external_space_dim
-      << " and p_vars.space_dimension() == "
-      << p_vars.space_dimension()
-      << " are dimension incompatible.";
-    throw std::invalid_argument(s.str());
-  }
-
-  // Check for space dimension overflow.
-  if (dim > max_space_dimension())
-    throw std::length_error("PPL::PIP_Problem::"
-                            "PIP_Problem(dim, first, last, p_vars):\n"
-                            "dim exceeds the maximum allowed "
-                            "space dimension.");
-  // Check the constraints.
-  for (In i = first; i != last; ++i) {
-    if (i->space_dimension() > dim) {
-      std::ostringstream s;
-      s << "PPL::PIP_Problem::"
-        << "PIP_Problem(dim, first, last, p_vars):\n"
-        << "range [first, last) contains a constraint having space "
-        << "dimension == " << i->space_dimension()
-        << " that exceeds this->space_dimension == " << dim << ".";
-      throw std::invalid_argument(s.str());
-    }
-    input_cs.push_back(*i);
-  }
-  control_parameters_init();
-  PPL_ASSERT(OK());
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_PIP_Problem_templates_hh)
diff --git a/src/PIP_Problem.types.hh b/src/PIP_Problem.types.hh
deleted file mode 100644
index 911abd3..0000000
--- a/src/PIP_Problem.types.hh
+++ /dev/null
@@ -1,31 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_PIP_Problem_types_hh
-#define PPL_PIP_Problem_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-//! Possible outcomes of the PIP_Problem solver.
-/*! \ingroup PPL_CXX_interface */
-enum PIP_Problem_Status {
-  //! The problem is unfeasible.
-  UNFEASIBLE_PIP_PROBLEM,
-  //! The problem has an optimal solution.
-  OPTIMIZED_PIP_PROBLEM
-};
-
-class PIP_Problem;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_PIP_Problem_types_hh)
diff --git a/src/PIP_Problem_defs.hh b/src/PIP_Problem_defs.hh
new file mode 100644
index 0000000..c4f89d8
--- /dev/null
+++ b/src/PIP_Problem_defs.hh
@@ -0,0 +1,834 @@
+/* PIP_Problem class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_PIP_Problem_defs_hh
+#define PPL_PIP_Problem_defs_hh 1
+
+#include "PIP_Problem_types.hh"
+#include "PIP_Tree_types.hh"
+#include "globals_types.hh"
+#include "Linear_Expression_defs.hh"
+#include "Constraint_defs.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_defs.hh"
+#include "Variables_Set_defs.hh"
+#include <vector>
+#include <deque>
+#include <iosfwd>
+
+#include "Matrix_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::PIP_Problem */
+std::ostream&
+operator<<(std::ostream& s, const PIP_Problem& pip);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates PIP_Problem */
+void swap(PIP_Problem& x, PIP_Problem& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A Parametric Integer (linear) Programming problem.
+/*! \ingroup PPL_CXX_interface
+  An object of this class encodes a parametric integer (linear)
+  programming problem. The PIP problem is specified by providing:
+   - the dimension of the vector space;
+   - the subset of those dimensions of the vector space that are
+     interpreted as integer parameters (the other space dimensions
+     are interpreted as non-parameter integer variables);
+   - a finite set of linear equality and (strict or non-strict)
+     inequality constraints involving variables and/or parameters;
+     these constraints are used to define:
+       - the <EM>feasible region</EM>, if they involve one or more
+         problem variable (and maybe some parameters);
+       - the <EM>initial context</EM>, if they only involve the
+         parameters;
+   - optionally, the so-called <EM>big parameter</EM>,
+     i.e., a problem parameter to be considered arbitrarily big.
+
+  Note that all problem variables and problem parameters are assumed
+  to take non-negative integer values, so that there is no need
+  to specify non-negativity constraints.
+
+  The class provides support for the (incremental) solution of the
+  PIP problem based on variations of the revised simplex method and
+  on Gomory cut generation techniques.
+
+  The solution for a PIP problem is the lexicographic minimum of the
+  integer points of the feasible region, expressed in terms of the
+  parameters. As the problem to be solved only involves non-negative
+  variables and parameters, the problem will always be either unfeasible
+  or optimizable.
+
+  As the feasibility and the solution value of a PIP problem depend on the
+  values of the parameters, the solution is a binary decision tree,
+  dividing the context parameter set into subsets.
+  The tree nodes are of two kinds:
+   - \e Decision nodes.
+     These are internal tree nodes encoding one or more linear tests
+     on the parameters; if all the tests are satisfied, then the solution
+     is the node's \e true child; otherwise, the solution is the node's
+     \e false child;
+   - \e Solution nodes.
+     These are leaf nodes in the tree, encoding the solution of the problem
+     in the current context subset, where each variable is defined in terms
+     of a linear expression of the parameters.
+     Solution nodes also optionally embed a set of parameter constraints:
+     if all these constraints are satisfied, the solution is described by
+     the node, otherwise the problem has no solution.
+
+  It may happen that a decision node has no \e false child. This means
+  that there is no solution if at least one of the corresponding
+  constraints is not satisfied. Decision nodes having two or more linear
+  tests on the parameters cannot have a \e false child. Decision nodes
+  always have a \e true child.
+
+  Both kinds of tree nodes may also contain the definition of extra
+  parameters which are artificially introduced by the solver to enforce
+  an integral solution. Such artificial parameters are defined by
+  the integer division of a linear expression on the parameters
+  by an integer coefficient.
+
+  By exploiting the incremental nature of the solver, it is possible
+  to reuse part of the computational work already done when solving
+  variants of a given PIP_Problem: currently, incremental resolution
+  supports the addition of space dimensions, the addition of parameters
+  and the addition of constraints.
+
+  \par Example problem
+  An example PIP problem can be defined the following:
+  \code
+  3*j >= -2*i+8
+  j <= 4*i - 4
+  i <= n
+  j <= m
+  \endcode
+  where \c i and \c j are the problem variables
+  and \c n and \c m are the problem parameters.
+  This problem can be optimized; the resulting solution tree may be
+  represented as follows:
+  \verbatim
+  if 7*n >= 10 then
+    if 7*m >= 12 then
+      {i = 2 ; j = 2}
+    else
+      Parameter P = (m) div 2
+      if 2*n + 3*m >= 8 then
+        {i = -m - P + 4 ; j = m}
+      else
+        _|_
+  else
+    _|_
+  \endverbatim
+  The solution tree starts with a decision node depending on the
+  context constraint <code>7*n >= 10</code>.
+  If this constraint is satisfied by the values assigned to the
+  problem parameters, then the (textually first) \c then branch is taken,
+  reaching the \e true child of the root node (which in this case
+  is another decision node); otherwise, the (textually last) \c else
+  branch is taken, for which there is no corresponding \e false child.
+  \par
+  The \f$\perp\f$ notation, also called \e bottom, denotes the
+  lexicographic minimum of an empty set of solutions,
+  here meaning the corresponding subproblem is unfeasible.
+  \par
+  Notice that a tree node may introduce new (non-problem) parameters,
+  as is the case for parameter \c P in the (textually first) \c else
+  branch above. These \e artificial parameters are only meaningful
+  inside the subtree where they are defined and are used to define
+  the parametric values of the problem variables in solution nodes
+  (e.g., the <CODE>{i,j}</CODE> vector in the textually third \c then branch).
+
+  \par Context restriction
+  The above solution is correct in an unrestricted initial context,
+  meaning all possible values are allowed for the parameters. If we
+  restrict the context with the following parameter inequalities:
+  \code
+  m >= n
+  n >= 5
+  \endcode
+  then the resulting optimizing tree will be a simple solution node:
+  \verbatim
+  {i = 2 ; j = 2}
+  \endverbatim
+
+  \par Creating the PIP_Problem object
+  The PIP_Problem object corresponding to the above example can be
+  created as follows:
+  \code
+  Variable i(0);
+  Variable j(1);
+  Variable n(2);
+  Variable m(3);
+  Variables_Set params(n, m);
+  Constraint_System cs;
+  cs.insert(3*j >= -2*i+8);
+  cs.insert(j <= 4*i - 4);
+  cs.insert(j <= m);
+  cs.insert(i <= n);
+  PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params);
+  \endcode
+  If you want to restrict the initial context, simply add the parameter
+  constraints the same way as for normal constraints.
+  \code
+  cs.insert(m >= n);
+  cs.insert(n >= 5);
+  \endcode
+
+  \par Solving the problem
+  Once the PIP_Problem object has been created, you can start the
+  resolution of the problem by calling the solve() method:
+  \code
+  PIP_Problem_Status status = pip.solve();
+  \endcode
+  where the returned \c status indicates if the problem has been optimized
+  or if it is unfeasible for any possible configuration of the parameter
+  values. The resolution process is also started if an attempt is made
+  to get its solution, as follows:
+  \code
+  const PIP_Tree_Node* node = pip.solution();
+  \endcode
+  In this case, an unfeasible problem will result in an empty solution
+  tree, i.e., assigning a null pointer to \c node.
+
+  \par Printing the solution tree
+  A previously computed solution tree may be printed as follows:
+  \code
+  pip.print_solution(std::cout);
+  \endcode
+  This will produce the following output (note: variables and parameters
+  are printed according to the default output function; see
+  <code>Variable::set_output_function</code>):
+  \verbatim
+  if 7*C >= 10 then
+    if 7*D >= 12 then
+      {2 ; 2}
+    else
+      Parameter E = (D) div 2
+      if 2*C + 3*D >= 8 then
+        {-D - E + 4 ; D}
+      else
+        _|_
+  else
+    _|_
+  \endverbatim
+
+  \par Spanning the solution tree
+  A parameter assignment for a PIP problem binds each of the problem
+  parameters to a non-negative integer value. After fixing a parameter
+  assignment, the ``spanning'' of the PIP problem solution tree refers
+  to the process whereby the solution tree is navigated, starting from
+  the root node: the value of artificial parameters is computed according
+  to the parameter assignment and the node's constraints are evaluated,
+  thereby descending in either the true or the false subtree of decision
+  nodes and eventually reaching a solution node or a bottom node.
+  If a solution node is found, each of the problem variables is provided
+  with a parametric expression, which can be evaluated to a fixed value
+  using the given parameter assignment and the computed values for
+  artificial parameters.
+  \par
+  The coding of the spanning process can be done as follows.
+  First, the root of the PIP solution tree is retrieved:
+  \code
+  const PIP_Tree_Node* node = pip.solution();
+  \endcode
+  If \c node represents an unfeasible solution (i.e., \f$\perp\f$),
+  its value will be \c 0. For a non-null tree node, the virtual methods
+  \c PIP_Tree_Node::as_decision() and \c PIP_Tree_Node::as_solution()
+  can be used to check whether the node is a decision or a solution node:
+  \code
+  const PIP_Solution_Node* sol = node->as_solution();
+  if (sol != 0) {
+    // The node is a solution node
+    ...
+  }
+  else {
+    // The node is a decision node
+    const PIP_Decision_Node* dec = node->as_decision();
+    ...
+  }
+  \endcode
+  \par
+  The true (resp., false) child node of a Decision Node may be accessed by
+  using method \c PIP_Decision_Node::child_node(bool), passing \c true
+  (resp., \c false) as the input argument.
+
+  \par Artificial parameters
+  A PIP_Tree_Node::Artificial_Parameter object represents the result
+  of the integer division of a Linear_Expression (on the other
+  parameters, including the previously-defined artificials)
+  by an integer denominator (a Coefficient object).
+  The dimensions of the artificial parameters (if any) in a tree node
+  have consecutive indices starting from <code>dim+1</code>, where the value
+  of \c dim is computed as follows:
+   - for the tree root node, \c dim is the space dimension of the PIP_Problem;
+   - for any other node of the tree, it is recursively obtained by adding
+     the value of \c dim computed for the parent node to the number of
+     artificial parameters defined in the parent node.
+  \par
+  Since the numbering of dimensions for artificial parameters follows
+  the rule above, the addition of new problem variables and/or new problem
+  parameters to an already solved PIP_Problem object (as done when
+  incrementally solving a problem) will result in the systematic
+  renumbering of all the existing artificial parameters.
+
+  \par Node constraints
+  All kind of tree nodes can contain context constraints.
+  Decision nodes always contain at least one of them.
+  The node's local constraint system can be obtained using method
+  PIP_Tree_Node::constraints.
+  These constraints only involve parameters, including both the problem
+  parameters and the artificial parameters that have been defined
+  in nodes occurring on the path from the root node to the current node.
+  The meaning of these constraints is as follows:
+   - On a decision node, if all tests in the constraints are true, then the
+     solution is the \e true child; otherwise it is the \e false child.
+   - On a solution node, if the (possibly empty) system of constraints
+     evaluates to true for a given parameter assignment, then the solution
+     is described by the node; otherwise the solution is \f$\perp\f$
+     (i.e., the problem is unfeasible for that parameter assignment).
+
+  \par Getting the optimal values for the variables
+  After spanning the solution tree using the given parameter assignment,
+  if a solution node has been reached, then it is possible to retrieve
+  the parametric expression for each of the problem variables using
+  method PIP_Solution_Node::parametric_values. The retrieved expression
+  will be defined in terms of all the parameters (problem parameters
+  and artificial parameters defined along the path).
+
+  \par Solving maximization problems
+  You can solve a lexicographic maximization problem by reformulating its
+  constraints using variable substitution. Proceed the following steps:
+   - Create a big parameter (see PIP_Problem::set_big_parameter_dimension),
+     which we will call \f$M\f$.
+   - Reformulate each of the maximization problem constraints by
+     substituting each \f$x_i\f$ variable with an expression of the form
+     \f$M-x'_i\f$, where the \f$x'_i\f$ variables are positive variables to
+     be minimized.
+   - Solve the lexicographic minimum for the \f$x'\f$ variable vector.
+   - In the solution expressions, the values of the \f$x'\f$ variables will
+     be expressed in the form: \f$x'_i = M-x_i\f$. To get back the value of
+     the expression of each \f$x_i\f$ variable, just apply the
+     formula: \f$x_i = M-x'_i\f$.
+  \par
+  Note that if the resulting expression of one of the \f$x'_i\f$ variables
+  is not in the \f$x'_i = M-x_i\f$ form, this means that the
+  sign-unrestricted problem is unbounded.
+  \par
+  You can choose to maximize only a subset of the variables while minimizing
+  the other variables. In that case, just apply the variable substitution
+  method on the variables you want to be maximized. The variable
+  optimization priority will still be in lexicographic order.
+
+  \par
+  \b Example: consider you want to find the lexicographic maximum of the
+  \f$(x,y)\f$ vector, under the constraints:
+    \f[\left\{\begin{array}{l}
+      y \geq 2x - 4\\
+      y \leq -x + p
+    \end{array}\right.\f]
+  \par
+  where \f$p\f$ is a parameter.
+  \par
+  After variable substitution, the constraints become:
+    \f[\left\{\begin{array}{l}
+      M - y \geq 2M - 2x - 4\\
+      M - y \leq -M + x + p
+    \end{array}\right.\f]
+  \par
+  The code for creating the corresponding problem object is the following:
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable p(2);
+  Variable M(3);
+  Variables_Set params(p, M);
+  Constraint_System cs;
+  cs.insert(M - y >= 2*M - 2*x - 4);
+  cs.insert(M - y <= -M + x + p);
+  PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params);
+  pip.set_big_parameter_dimension(3);     // M is the big parameter
+  \endcode
+  Solving the problem provides the following solution:
+  \verbatim
+  Parameter E = (C + 1) div 3
+  {D - E - 1 ; -C + D + E + 1}
+  \endverbatim
+  Under the notations above, the solution is:
+  \f[ \left\{\begin{array}{l}
+    x' = M - \left\lfloor\frac{p+1}{3}\right\rfloor - 1 \\
+    y' = M - p + \left\lfloor\frac{p+1}{3}\right\rfloor + 1
+  \end{array}\right.
+  \f]
+  \par
+  Performing substitution again provides us with the values of the original
+  variables:
+  \f[ \left\{\begin{array}{l}
+    x = \left\lfloor\frac{p+1}{3}\right\rfloor + 1 \\
+    y = p - \left\lfloor\frac{p+1}{3}\right\rfloor - 1
+  \end{array}\right.
+  \f]
+
+  \par Allowing variables to be arbitrarily signed
+  You can deal with arbitrarily signed variables by reformulating the
+  constraints using variable substitution. Proceed the following steps:
+   - Create a big parameter (see PIP_Problem::set_big_parameter_dimension),
+     which we will call \f$M\f$.
+   - Reformulate each of the maximization problem constraints by
+     substituting each \f$x_i\f$ variable with an expression of the form
+     \f$x'_i-M\f$, where the \f$x'_i\f$ variables are positive.
+   - Solve the lexicographic minimum for the \f$x'\f$ variable vector.
+   - The solution expression can be read in the form:
+   - In the solution expressions, the values of the \f$x'\f$ variables will
+     be expressed in the form: \f$x'_i = x_i+M\f$. To get back the value of
+     the expression of each signed \f$x_i\f$ variable, just apply the
+     formula: \f$x_i = x'_i-M\f$.
+  \par
+  Note that if the resulting expression of one of the \f$x'_i\f$ variables
+  is not in the \f$x'_i = x_i+M\f$ form, this means that the
+  sign-unrestricted problem is unbounded.
+  \par
+  You can choose to define only a subset of the variables to be
+  sign-unrestricted. In that case, just apply the variable substitution
+  method on the variables you want to be sign-unrestricted.
+
+  \par
+  \b Example: consider you want to find the lexicographic minimum of the
+  \f$(x,y)\f$ vector, where the \f$x\f$ and \f$y\f$ variables are
+  sign-unrestricted, under the constraints:
+    \f[\left\{\begin{array}{l}
+      y \geq -2x - 4\\
+      2y \leq x + 2p
+    \end{array}\right.\f]
+  \par
+  where \f$p\f$ is a parameter.
+  \par
+  After variable substitution, the constraints become:
+    \f[\left\{\begin{array}{l}
+      y' - M \geq -2x' + 2M - 4\\
+      2y' - 2M \leq x' - M + 2p
+    \end{array}\right.\f]
+  \par
+  The code for creating the corresponding problem object is the following:
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable p(2);
+  Variable M(3);
+  Variables_Set params(p, M);
+  Constraint_System cs;
+  cs.insert(y - M >= -2*x + 2*M - 4);
+  cs.insert(2*y - 2*M <= x - M + 2*p);
+  PIP_Problem pip(cs.space_dimension(), cs.begin(), cs.end(), params);
+  pip.set_big_parameter_dimension(3);     // M is the big parameter
+  \endcode
+  \par
+  Solving the problem provides the following solution:
+  \verbatim
+  Parameter E = (2*C + 3) div 5
+  {D - E - 1 ; D + 2*E - 2}
+  \endverbatim
+  Under the notations above, the solution is:
+  \f[ \left\{\begin{array}{l}
+    x' = M - \left\lfloor\frac{2p+3}{5}\right\rfloor - 1 \\
+    y' = M + 2\left\lfloor\frac{2p+3}{5}\right\rfloor - 2
+  \end{array}\right.
+  \f]
+  \par
+  Performing substitution again provides us with the values of the original
+  variables:
+  \f[ \left\{\begin{array}{l}
+    x = -\left\lfloor\frac{2p+3}{5}\right\rfloor - 1 \\
+    y = 2\left\lfloor\frac{2p+3}{5}\right\rfloor - 2
+  \end{array}\right.
+  \f]
+
+  \par Allowing parameters to be arbitrarily signed
+  You can consider a parameter \f$p\f$ arbitrarily signed by replacing
+  \f$p\f$ with \f$p^+-p^-\f$, where both \f$p^+\f$ and \f$p^-\f$ are
+  positive parameters. To represent a set of arbitrarily signed parameters,
+  replace each parameter \f$p_i\f$ with \f$p^+_i-p^-\f$, where \f$-p^-\f$ is
+  the minimum negative value of all parameters.
+
+  \par Minimizing a linear cost function
+  Lexicographic solving can be used to find the parametric minimum of a
+  linear cost function.
+  \par
+  Suppose the variables are named \f$x_1, x_2, \dots, x_n\f$, and the
+  parameters \f$p_1, p_2, \dots, p_m\f$. You can minimize a linear cost
+  function \f$f(x_2, \dots, x_n, p_1, \dots, p_m)\f$ by simply adding the
+  constraint \f$x_1 \geq f(x_2, \dots, x_n, p_1, \dots, p_m)\f$ to the
+  constraint system. As lexicographic minimization ensures \f$x_1\f$ is
+  minimized in priority, and because \f$x_1\f$ is forced by a constraint to
+  be superior or equal to the cost function, optimal solutions of the
+  problem necessarily ensure that the solution value of \f$x_1\f$ is the
+  optimal value of the cost function.
+*/
+class Parma_Polyhedra_Library::PIP_Problem {
+public:
+  //! Builds a trivial PIP problem.
+  /*!
+    A trivial PIP problem requires to compute the lexicographic minimum
+    on a vector space under no constraints and with no parameters:
+    due to the implicit non-negativity constraints, the origin of the
+    vector space is an optimal solution.
+
+    \param dim
+    The dimension of the vector space enclosing \p *this
+    (optional argument with default value \f$0\f$).
+
+    \exception std::length_error
+    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
+  */
+  explicit PIP_Problem(dimension_type dim = 0);
+
+  /*! \brief
+    Builds a PIP problem having space dimension \p dim
+    from the sequence of constraints in the range
+    \f$[\mathrm{first}, \mathrm{last})\f$;
+    those dimensions whose indices occur in \p p_vars are
+    interpreted as parameters.
+
+    \param dim
+    The dimension of the vector space (variables and parameters) enclosing
+    \p *this.
+
+    \param first
+    An input iterator to the start of the sequence of constraints.
+
+    \param last
+    A past-the-end input iterator to the sequence of constraints.
+
+    \param p_vars
+    The set of variables' indexes that are interpreted as parameters.
+
+    \exception std::length_error
+    Thrown if \p dim exceeds <CODE>max_space_dimension()</CODE>.
+
+    \exception std::invalid_argument
+    Thrown if the space dimension of a constraint in the sequence
+    (resp., the parameter variables) is strictly greater than \p dim.
+  */
+  template <typename In>
+  PIP_Problem(dimension_type dim, In first, In last,
+              const Variables_Set& p_vars);
+
+  //! Ordinary copy-constructor.
+  PIP_Problem(const PIP_Problem& y);
+
+  //! Destructor.
+  ~PIP_Problem();
+
+  //! Assignment operator.
+  PIP_Problem& operator=(const PIP_Problem& y);
+
+  //! Returns the maximum space dimension a PIP_Problem can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the space dimension of the PIP problem.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns a set containing all the variables' indexes representing
+    the parameters of the PIP problem.
+  */
+  const Variables_Set& parameter_space_dimensions() const;
+
+private:
+  //! A type alias for a sequence of constraints.
+  typedef std::vector<Constraint> Constraint_Sequence;
+
+public:
+  /*! \brief
+    A type alias for the read-only iterator on the constraints
+    defining the feasible region.
+  */
+  typedef Constraint_Sequence::const_iterator const_iterator;
+
+  /*! \brief
+    Returns a read-only iterator to the first constraint defining
+    the feasible region.
+  */
+  const_iterator constraints_begin() const;
+
+  /*! \brief
+    Returns a past-the-end read-only iterator to the sequence of
+    constraints defining the feasible region.
+  */
+  const_iterator constraints_end() const;
+
+  //! Resets \p *this to be equal to the trivial PIP problem.
+  /*!
+    The space dimension is reset to \f$0\f$.
+  */
+  void clear();
+
+  /*! \brief
+    Adds <CODE>m_vars + m_params</CODE> new space dimensions
+    and embeds the old PIP problem in the new vector space.
+
+    \param m_vars
+    The number of space dimensions to add that are interpreted as
+    PIP problem variables (i.e., non parameters). These are added
+    \e before adding the \p m_params parameters.
+
+    \param m_params
+    The number of space dimensions to add that are interpreted as
+    PIP problem parameters. These are added \e after having added the
+    \p m_vars problem variables.
+
+    \exception std::length_error
+    Thrown if adding <CODE>m_vars + m_params</CODE> new space
+    dimensions would cause the vector space to exceed dimension
+    <CODE>max_space_dimension()</CODE>.
+
+    The new space dimensions will be those having the highest indexes
+    in the new PIP problem; they are initially unconstrained.
+  */
+  void add_space_dimensions_and_embed(dimension_type m_vars,
+                                      dimension_type m_params);
+
+  /*! \brief
+    Sets the space dimensions whose indexes which are in set \p p_vars
+    to be parameter space dimensions.
+
+    \exception std::invalid_argument
+    Thrown if some index in \p p_vars does not correspond to
+    a space dimension in \p *this.
+  */
+  void add_to_parameter_space_dimensions(const Variables_Set& p_vars);
+
+  /*! \brief
+    Adds a copy of constraint \p c to the PIP problem.
+
+    \exception std::invalid_argument
+    Thrown if the space dimension of \p c is strictly greater than
+    the space dimension of \p *this.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds a copy of the constraints in \p cs to the PIP problem.
+
+    \exception std::invalid_argument
+    Thrown if the space dimension of constraint system \p cs is strictly
+    greater than the space dimension of \p *this.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  //! Checks satisfiability of \p *this.
+  /*!
+    \return
+    \c true if and only if the PIP problem is satisfiable.
+  */
+  bool is_satisfiable() const;
+
+  //! Optimizes the PIP problem.
+  /*!
+    \return
+    A PIP_Problem_Status flag indicating the outcome of the optimization
+    attempt (unfeasible or optimized problem).
+  */
+  PIP_Problem_Status solve() const;
+
+  //! Returns a feasible solution for \p *this, if it exists.
+  /*!
+    A null pointer is returned for an unfeasible PIP problem.
+  */
+  PIP_Tree solution() const;
+
+  //! Returns an optimizing solution for \p *this, if it exists.
+  /*!
+    A null pointer is returned for an unfeasible PIP problem.
+  */
+  PIP_Tree optimizing_solution() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //! Prints on \p s the solution computed for \p *this.
+  /*!
+    \param s
+    The output stream.
+
+    \param indent
+    An indentation parameter (default value 0).
+
+    \exception std::logic_error
+    Thrown if trying to print the solution when the PIP problem
+    still has to be solved.
+  */
+  void print_solution(std::ostream& s, int indent = 0) const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(PIP_Problem& y);
+
+  //! Possible names for PIP_Problem control parameters.
+  enum Control_Parameter_Name {
+    //! Cutting strategy
+    CUTTING_STRATEGY,
+    //! Pivot row strategy
+    PIVOT_ROW_STRATEGY,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+    //! Number of different enumeration values.
+#endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+    CONTROL_PARAMETER_NAME_SIZE
+  };
+
+  //! Possible values for PIP_Problem control parameters.
+  enum Control_Parameter_Value {
+    //! Choose the first non-integer row.
+    CUTTING_STRATEGY_FIRST,
+    //! Choose row which generates the deepest cut.
+    CUTTING_STRATEGY_DEEPEST,
+    //! Always generate all possible cuts.
+    CUTTING_STRATEGY_ALL,
+
+    //! Choose the first row with negative parameter sign.
+    PIVOT_ROW_STRATEGY_FIRST,
+    //! Choose a row that generates a lexicographically maximal pivot column.
+    PIVOT_ROW_STRATEGY_MAX_COLUMN,
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+    //! Number of different enumeration values.
+#endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+    CONTROL_PARAMETER_VALUE_SIZE
+  };
+
+  //! Returns the value of control parameter \p name.
+  Control_Parameter_Value
+  get_control_parameter(Control_Parameter_Name name) const;
+
+  //! Sets control parameter \p value.
+  void set_control_parameter(Control_Parameter_Value value);
+
+  //! Sets the dimension for the big parameter to \p big_dim.
+  void set_big_parameter_dimension(dimension_type big_dim);
+
+  /*! \brief
+    Returns the space dimension for the big parameter.
+
+    If a big parameter was not set, returns \c not_a_dimension().
+  */
+  dimension_type get_big_parameter_dimension() const;
+
+private:
+  //! Initializes the control parameters with default values.
+  void control_parameters_init();
+
+  //! Copies the control parameters from problem object \p y.
+  void control_parameters_copy(const PIP_Problem& y);
+
+  //! The dimension of the vector space.
+  dimension_type external_space_dim;
+
+  /*! \brief
+    The space dimension of the current (partial) solution of the
+    PIP problem; it may be smaller than \p external_space_dim.
+  */
+  dimension_type internal_space_dim;
+
+  //! An enumerated type describing the internal status of the PIP problem.
+  enum Status {
+    //! The PIP problem is unsatisfiable.
+    UNSATISFIABLE,
+    //! The PIP problem is optimized; the solution tree has been computed.
+    OPTIMIZED,
+    /*! \brief
+      The feasible region of the PIP problem has been changed by adding
+      new variables, parameters or constraints; a feasible solution for
+      the old feasible region is still available.
+    */
+    PARTIALLY_SATISFIABLE
+  };
+
+  //! The internal state of the MIP problem.
+  Status status;
+
+  //! The current solution decision tree
+  PIP_Tree_Node* current_solution;
+
+  //! The sequence of constraints describing the feasible region.
+  Constraint_Sequence input_cs;
+
+  //! The first index of `input_cs' containing a pending constraint.
+  dimension_type first_pending_constraint;
+
+  /*! \brief
+    A set containing all the indices of space dimensions that are
+    interpreted as problem parameters.
+  */
+  Variables_Set parameters;
+
+#if PPL_USE_SPARSE_MATRIX
+  typedef Sparse_Row Row;
+#else
+  typedef Dense_Row Row;
+#endif
+
+  /*! \brief
+    The initial context
+
+    Contains problem constraints on parameters only
+  */
+  Matrix<Row> initial_context;
+
+  //! The control parameters for the problem object.
+  Control_Parameter_Value
+  control_parameters[CONTROL_PARAMETER_NAME_SIZE];
+
+  /*! \brief
+    The dimension for the big parameter, or \c not_a_dimension()
+    if not set.
+  */
+  dimension_type big_parameter_dimension;
+
+  friend class PIP_Solution_Node;
+};
+
+#include "PIP_Problem_inlines.hh"
+#include "PIP_Problem_templates.hh"
+
+#endif // !defined(PPL_PIP_Problem_defs_hh)
diff --git a/src/PIP_Problem_inlines.hh b/src/PIP_Problem_inlines.hh
new file mode 100644
index 0000000..4f7d234
--- /dev/null
+++ b/src/PIP_Problem_inlines.hh
@@ -0,0 +1,96 @@
+/* PIP_Problem class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_PIP_Problem_inlines_hh
+#define PPL_PIP_Problem_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline dimension_type
+PIP_Problem::space_dimension() const {
+  return external_space_dim;
+}
+
+inline dimension_type
+PIP_Problem::max_space_dimension() {
+  return Constraint::max_space_dimension();
+}
+
+inline PIP_Problem::const_iterator
+PIP_Problem::constraints_begin() const {
+  return input_cs.begin();
+}
+
+inline PIP_Problem::const_iterator
+PIP_Problem::constraints_end() const {
+  return input_cs.end();
+}
+
+inline const Variables_Set&
+PIP_Problem::parameter_space_dimensions() const {
+  return parameters;
+}
+
+inline void
+PIP_Problem::m_swap(PIP_Problem& y) {
+  using std::swap;
+  swap(external_space_dim, y.external_space_dim);
+  swap(internal_space_dim, y.internal_space_dim);
+  swap(status, y.status);
+  swap(current_solution, y.current_solution);
+  swap(input_cs, y.input_cs);
+  swap(first_pending_constraint, y.first_pending_constraint);
+  swap(parameters, y.parameters);
+  swap(initial_context, y.initial_context);
+  for (dimension_type i = CONTROL_PARAMETER_NAME_SIZE; i-- > 0; )
+    swap(control_parameters[i], y.control_parameters[i]);
+  swap(big_parameter_dimension, y.big_parameter_dimension);
+}
+
+inline PIP_Problem&
+PIP_Problem::operator=(const PIP_Problem& y) {
+  PIP_Problem tmp(y);
+  m_swap(tmp);
+  return *this;
+}
+
+inline PIP_Problem::Control_Parameter_Value
+PIP_Problem::get_control_parameter(Control_Parameter_Name name) const {
+  PPL_ASSERT(name >= 0 && name < CONTROL_PARAMETER_NAME_SIZE);
+  return control_parameters[name];
+}
+
+inline dimension_type
+PIP_Problem::get_big_parameter_dimension() const {
+  return big_parameter_dimension;
+}
+
+/*! \relates PIP_Problem */
+inline void
+swap(PIP_Problem& x, PIP_Problem& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_PIP_Problem_inlines_hh)
diff --git a/src/PIP_Problem_templates.hh b/src/PIP_Problem_templates.hh
new file mode 100644
index 0000000..2d414a8
--- /dev/null
+++ b/src/PIP_Problem_templates.hh
@@ -0,0 +1,81 @@
+/* PIP_Problem class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_PIP_Problem_templates_hh
+#define PPL_PIP_Problem_templates_hh 1
+
+#include "Variables_Set_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename In>
+PIP_Problem::PIP_Problem(dimension_type dim,
+                         In first, In last,
+                         const Variables_Set& p_vars)
+  : external_space_dim(dim),
+    internal_space_dim(0),
+    status(PARTIALLY_SATISFIABLE),
+    current_solution(0),
+    input_cs(),
+    first_pending_constraint(0),
+    parameters(p_vars),
+    initial_context(),
+    big_parameter_dimension(not_a_dimension()) {
+  // Check that integer Variables_Set does not exceed the space dimension
+  // of the problem.
+  if (p_vars.space_dimension() > external_space_dim) {
+    std::ostringstream s;
+    s << "PPL::PIP_Problem::PIP_Problem(dim, first, last, p_vars):\n"
+      << "dim == " << external_space_dim
+      << " and p_vars.space_dimension() == "
+      << p_vars.space_dimension()
+      << " are dimension incompatible.";
+    throw std::invalid_argument(s.str());
+  }
+
+  // Check for space dimension overflow.
+  if (dim > max_space_dimension())
+    throw std::length_error("PPL::PIP_Problem::"
+                            "PIP_Problem(dim, first, last, p_vars):\n"
+                            "dim exceeds the maximum allowed "
+                            "space dimension.");
+  // Check the constraints.
+  for (In i = first; i != last; ++i) {
+    if (i->space_dimension() > dim) {
+      std::ostringstream s;
+      s << "PPL::PIP_Problem::"
+        << "PIP_Problem(dim, first, last, p_vars):\n"
+        << "range [first, last) contains a constraint having space "
+        << "dimension == " << i->space_dimension()
+        << " that exceeds this->space_dimension == " << dim << ".";
+      throw std::invalid_argument(s.str());
+    }
+    input_cs.push_back(*i);
+  }
+  control_parameters_init();
+  PPL_ASSERT(OK());
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_PIP_Problem_templates_hh)
diff --git a/src/PIP_Problem_types.hh b/src/PIP_Problem_types.hh
new file mode 100644
index 0000000..a1f044f
--- /dev/null
+++ b/src/PIP_Problem_types.hh
@@ -0,0 +1,31 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_PIP_Problem_types_hh
+#define PPL_PIP_Problem_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+//! Possible outcomes of the PIP_Problem solver.
+/*! \ingroup PPL_CXX_interface */
+enum PIP_Problem_Status {
+  //! The problem is unfeasible.
+  UNFEASIBLE_PIP_PROBLEM,
+  //! The problem has an optimal solution.
+  OPTIMIZED_PIP_PROBLEM
+};
+
+class PIP_Problem;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_PIP_Problem_types_hh)
diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc
index 9899dc5..4a6d6b3 100644
--- a/src/PIP_Tree.cc
+++ b/src/PIP_Tree.cc
@@ -1,6 +1,6 @@
 /* PIP_Tree related class implementation: non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "PIP_Tree.defs.hh"
-#include "PIP_Problem.defs.hh"
+#include "PIP_Tree_defs.hh"
+#include "PIP_Problem_defs.hh"
 #include <algorithm>
 #include <memory>
 #include <map>
@@ -148,7 +148,7 @@ merge_assign(Matrix<PIP_Tree_Node::Row>& x, const Constraint_System& y,
     // size of `parameters' will be greater than the number of nonzero
     // coefficients in y_i).
     for (dimension_type j = 1; pj != param_end; ++pj, ++j) {
-      Variable vj(*pj);
+      const Variable vj(*pj);
       if (vj.space_dimension() > cs_space_dim)
         break;
       Coefficient_traits::const_reference c = y_i->coefficient(vj);
@@ -694,8 +694,8 @@ compatibility_check_find_pivot_in_set(
         // compared. This speeds up the code, because the values' computation
         // is a bit expensive.
 
-        int lhs_sign = sgn(cost) * sgn(row_value);
-        int rhs_sign = sgn(challenger_cost) * sgn(row_challenger_value);
+        const int lhs_sign = sgn(cost) * sgn(row_value);
+        const int rhs_sign = sgn(challenger_cost) * sgn(row_challenger_value);
 
         if (lhs_sign != rhs_sign) {
           if (lhs_sign > rhs_sign) {
@@ -781,8 +781,8 @@ compatibility_check_find_pivot(const Matrix<PIP_Tree_Node::Row>& s,
         // Before computing and comparing the actual values, the signs are
         // compared. This speeds up the code, because the values' computation
         // is a bit expensive.
-        int lhs_coeff_sgn = sgn(current_data.cost);
-        int rhs_coeff_sgn = sgn(s_i0);
+        const int lhs_coeff_sgn = sgn(current_data.cost);
+        const int rhs_coeff_sgn = sgn(s_i0);
 
         if (lhs_coeff_sgn != rhs_coeff_sgn) {
           // Same column: just compare the ratios.
@@ -1139,7 +1139,7 @@ PIP_Tree_Node::OK() const {
       cerr << "The feasible region of the PIP_Problem parameter context"
            << "is defined by a constraint system containing strict "
            << "inequalities."
-	   << endl;
+           << endl;
       ascii_dump(cerr);
 #endif
       return false;
@@ -1280,7 +1280,7 @@ PIP_Decision_Node::OK() const {
 
   // Decision nodes with a false child must have exactly one constraint.
   if (false_child != 0) {
-    dimension_type dist = Implementation::num_constraints(constraints_);
+    const dimension_type dist = Implementation::num_constraints(constraints_);
     if (dist != 1) {
 #ifndef NDEBUG
       std::cerr << "PIP_Decision_Node with a 'false' child has "
@@ -1382,7 +1382,7 @@ PIP_Decision_Node::solve(const PIP_Problem& pip,
     indent_and_print(std::cerr, indent_level,
                      "==> merge then branch with parent.\n");
 #endif
-    PIP_Tree_Node* node = true_child;
+    PIP_Tree_Node* const node = true_child;
     node->parent_merge();
     node->set_parent(parent());
     true_child = 0;
@@ -1399,7 +1399,7 @@ PIP_Decision_Node::solve(const PIP_Problem& pip,
     indent_and_print(std::cerr, indent_level,
                      "==> merge else branch with parent.\n");
 #endif
-    PIP_Tree_Node* node = false_child;
+    PIP_Tree_Node* const node = false_child;
     node->parent_merge();
     node->set_parent(parent());
     false_child = 0;
@@ -1431,7 +1431,7 @@ PIP_Decision_Node::solve(const PIP_Problem& pip,
       indent_and_print(std::cerr, indent_level,
                        "==> merge then branch with parent.\n");
 #endif
-      PIP_Tree_Node* node = true_child;
+      PIP_Tree_Node* const node = true_child;
       node->parent_merge();
       node->set_parent(parent());
       true_child = 0;
@@ -1457,12 +1457,12 @@ PIP_Decision_Node::ascii_dump(std::ostream& s) const {
     // for debugging purposes (since we want to dump broken nodes).
     s << "BOTTOM\n";
   }
-  else if (const PIP_Decision_Node* dec = true_child->as_decision()) {
+  else if (const PIP_Decision_Node* const dec = true_child->as_decision()) {
     s << "DECISION\n";
     dec->ascii_dump(s);
   }
   else {
-    const PIP_Solution_Node* sol = true_child->as_solution();
+    const PIP_Solution_Node* const sol = true_child->as_solution();
     PPL_ASSERT(sol != 0);
     s << "SOLUTION\n";
     sol->ascii_dump(s);
@@ -1472,7 +1472,7 @@ PIP_Decision_Node::ascii_dump(std::ostream& s) const {
   s << "\nfalse_child: ";
   if (false_child == 0)
     s << "BOTTOM\n";
-  else if (const PIP_Decision_Node* dec = false_child->as_decision()) {
+  else if (const PIP_Decision_Node* const dec = false_child->as_decision()) {
     // Note: this branch should normally be unreachable code.
     // Since a well-formed decision node having a false child should have
     // a single context constraint, its false child will have no context
@@ -1482,7 +1482,7 @@ PIP_Decision_Node::ascii_dump(std::ostream& s) const {
     dec->ascii_dump(s);
   }
   else {
-    const PIP_Solution_Node* sol = false_child->as_solution();
+    const PIP_Solution_Node* const sol = false_child->as_solution();
     PPL_ASSERT(sol != 0);
     s << "SOLUTION\n";
     sol->ascii_dump(s);
@@ -1510,13 +1510,13 @@ PIP_Decision_Node::ascii_load(std::istream& s) {
     // Note: normally unreachable code (see comment on ascii_dump).
     true_child = 0;
   else if (str == "DECISION") {
-    PIP_Decision_Node* dec = new PIP_Decision_Node(0, 0, 0);
+    PIP_Decision_Node* const dec = new PIP_Decision_Node(0, 0, 0);
     true_child = dec;
     if (!dec->ascii_load(s))
       return false;
   }
   else if (str == "SOLUTION") {
-    PIP_Solution_Node* sol = new PIP_Solution_Node(0);
+    PIP_Solution_Node* const sol = new PIP_Solution_Node(0);
     true_child = sol;
     if (!sol->ascii_load(s))
       return false;
@@ -1538,13 +1538,13 @@ PIP_Decision_Node::ascii_load(std::istream& s) {
     false_child = 0;
   else if (str == "DECISION") {
     // Note: normally unreachable code (see comment on ascii_dump).
-    PIP_Decision_Node* dec = new PIP_Decision_Node(0, 0, 0);
+    PIP_Decision_Node* const dec = new PIP_Decision_Node(0, 0, 0);
     false_child = dec;
     if (!dec->ascii_load(s))
       return false;
   }
   else if (str == "SOLUTION") {
-    PIP_Solution_Node* sol = new PIP_Solution_Node(0);
+    PIP_Solution_Node* const sol = new PIP_Solution_Node(0);
     false_child = sol;
     if (!sol->ascii_load(s))
       return false;
@@ -1724,7 +1724,8 @@ void
 PIP_Tree_Node::ascii_dump(std::ostream& s) const {
   s << "constraints_\n";
   constraints_.ascii_dump(s);
-  dimension_type artificial_parameters_size = artificial_parameters.size();
+  const dimension_type artificial_parameters_size
+    = artificial_parameters.size();
   s << "\nartificial_parameters( " << artificial_parameters_size << " )\n";
   for (dimension_type i = 0; i < artificial_parameters_size; ++i)
     artificial_parameters[i].ascii_dump(s);
@@ -1804,25 +1805,25 @@ PIP_Solution_Node::ascii_dump(std::ostream& os) const {
   tableau.ascii_dump(os);
 
   os << "\nbasis ";
-  dimension_type basis_size = basis.size();
+  const dimension_type basis_size = basis.size();
   os << basis_size;
   for (dimension_type i = 0; i < basis_size; ++i)
     os << (basis[i] ? " true" : " false");
 
   os << "\nmapping ";
-  dimension_type mapping_size = mapping.size();
+  const dimension_type mapping_size = mapping.size();
   os << mapping_size;
   for (dimension_type i = 0; i < mapping_size; ++i)
     os << " " << mapping[i];
 
   os << "\nvar_row ";
-  dimension_type var_row_size = var_row.size();
+  const dimension_type var_row_size = var_row.size();
   os << var_row_size;
   for (dimension_type i = 0; i < var_row_size; ++i)
     os << " " << var_row[i];
 
   os << "\nvar_column ";
-  dimension_type var_column_size = var_column.size();
+  const dimension_type var_column_size = var_column.size();
   os << var_column_size;
   for (dimension_type i = 0; i < var_column_size; ++i)
     os << " " << var_column[i];
@@ -1832,7 +1833,7 @@ PIP_Solution_Node::ascii_dump(std::ostream& os) const {
   os << "big_dimension " << big_dimension << "\n";
 
   os << "sign ";
-  dimension_type sign_size = sign.size();
+  const dimension_type sign_size = sign.size();
   os << sign_size;
   for (dimension_type i = 0; i < sign_size; ++i) {
     os << " ";
@@ -1856,7 +1857,7 @@ PIP_Solution_Node::ascii_dump(std::ostream& os) const {
   }
   os << "\n";
 
-  dimension_type solution_size = solution.size();
+  const dimension_type solution_size = solution.size();
   os << "solution " << solution_size << "\n";
   for (dimension_type i = 0; i < solution_size; ++i)
     solution[i].ascii_dump(os);
@@ -2085,7 +2086,7 @@ PIP_Tree_Node::compatibility_check(Matrix<Row>& s) {
     // pj is the pivot's column index.
     dimension_type pj = 0;
 
-    bool found_positive_pivot_candidate
+    const bool found_positive_pivot_candidate
       = compatibility_check_find_pivot(s, mapping, basis, pi, pj);
 
     if (!found_positive_pivot_candidate)
@@ -2338,16 +2339,17 @@ PIP_Solution_Node
       }
       WEIGHT_BEGIN();
       dimension_type last_dim = 0;
-      const Constraint::Expression& e = constraint.expression();
-      for (Constraint::Expression::const_iterator
+      const Constraint::expr_type e = constraint.expression();
+      for (Constraint::expr_type::const_iterator
           i = e.begin(), i_end = e.end(); i != i_end; ++i) {
         const dimension_type dim = i.variable().space_dimension();
         if (dim != last_dim + 1) {
           // We have skipped some zero coefficients.
           // Update p_index and v_index accordingly.
-          dimension_type n = std::distance(parameters.lower_bound(last_dim),
-                                           parameters.lower_bound(dim - 1));
-          dimension_type num_skipped = dim - last_dim - 1;
+          const dimension_type n
+            = std::distance(parameters.lower_bound(last_dim),
+                            parameters.lower_bound(dim - 1));
+          const dimension_type num_skipped = dim - last_dim - 1;
           p_index += n;
           v_index += (num_skipped - n);
         }
@@ -2727,10 +2729,11 @@ PIP_Solution_Node::solve(const PIP_Problem& pip,
         if (s_i_pj_itr == s_i.end())
           continue;
 
+        // FIXME: the following comment does not make sense.
         // NOTE: This is a Coefficient& instead of a
         // Coefficient_traits::const_reference, because scale() may silently
         // modify it.
-        Coefficient& s_i_pj = *s_i_pj_itr;
+        const Coefficient& s_i_pj = *s_i_pj_itr;
 
         if (s_i_pj == 0)
           continue;
@@ -3007,11 +3010,11 @@ PIP_Solution_Node::solve(const PIP_Problem& pip,
         // then we would obtain a node violating the PIP_Decision_Node
         // invariant saying that t_node should have a single constraint:
         // it will have, at least, the two splitting constraints.
-        PIP_Decision_Node* decision_node_p
+        const PIP_Decision_Node* const decision_node_p
           = dynamic_cast<PIP_Decision_Node*>(t_node);
         if (decision_node_p != 0 && decision_node_p->false_child != 0) {
           // Do NOT merge: create a new decision node.
-          PIP_Tree_Node* parent
+          PIP_Tree_Node* const parent
             = new PIP_Decision_Node(t_node->get_owner(), 0, t_node);
           // Previously wrapped 't_node' is now safe: release it
           // and protect new 'parent' node from exception safety issues.
@@ -3330,7 +3333,7 @@ PIP_Solution_Node::generate_cut(const dimension_type index,
       }
     }
     // Generate new artificial parameter.
-    Artificial_Parameter ap(expr, denom);
+    const Artificial_Parameter ap(expr, denom);
 
     // Search if the Artificial_Parameter has already been generated.
     ap_column = space_dimension;
@@ -3640,7 +3643,8 @@ PIP_Decision_Node::print_tree(std::ostream& s, const int indent,
   PIP_Tree_Node::print_tree(s, indent, pip_dim_is_param, first_art_dim);
 
   // Then print info specific of decision nodes.
-  dimension_type child_first_art_dim = first_art_dim + art_parameter_count();
+  const dimension_type child_first_art_dim
+    = first_art_dim + art_parameter_count();
 
   PPL_ASSERT(true_child != 0);
   true_child->print_tree(s, indent+1, pip_dim_is_param, child_first_art_dim);
@@ -3687,7 +3691,7 @@ PIP_Solution_Node::print_tree(std::ostream& s, const int indent,
 
 const Linear_Expression&
 PIP_Solution_Node::parametric_values(const Variable var) const {
-  const PIP_Problem* pip = get_owner();
+  const PIP_Problem* const pip = get_owner();
   PPL_ASSERT(pip != 0);
 
   const dimension_type space_dim = pip->space_dimension();
@@ -3726,7 +3730,7 @@ PIP_Solution_Node::update_solution() const {
   if (solution_valid)
     return;
 
-  const PIP_Problem* pip = get_owner();
+  const PIP_Problem* const pip = get_owner();
   PPL_ASSERT(pip != 0);
   std::vector<bool> pip_dim_is_param(pip->space_dimension());
   const Variables_Set& params = pip->parameter_space_dimensions();
diff --git a/src/PIP_Tree.defs.hh b/src/PIP_Tree.defs.hh
deleted file mode 100644
index b6f27a7..0000000
--- a/src/PIP_Tree.defs.hh
+++ /dev/null
@@ -1,836 +0,0 @@
-/* PIP_Tree_Node class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_PIP_Tree_defs_hh
-#define PPL_PIP_Tree_defs_hh 1
-
-#include "PIP_Tree.types.hh"
-#include "Variable.defs.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Constraint.defs.hh"
-#include "Variables_Set.defs.hh"
-#include "globals.defs.hh"
-#include "PIP_Problem.defs.hh"
-
-#include "Matrix.defs.hh"
-#include "Dense_Row.defs.hh"
-#include "Sparse_Row.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-//! A node of the PIP solution tree.
-/*!
-  This is the base class for the nodes of the binary trees representing
-  the solutions of PIP problems. From this one, two classes are derived:
-    - PIP_Decision_Node, for the internal nodes of the tree;
-    - PIP_Solution_Node, for the leaves of the tree.
-*/
-class PIP_Tree_Node {
-protected:
-  //! Constructor: builds a node owned by \p *owner.
-  explicit PIP_Tree_Node(const PIP_Problem* owner);
-
-  //! Copy constructor.
-  PIP_Tree_Node(const PIP_Tree_Node& y);
-
-  //! Returns a pointer to the PIP_Problem owning object.
-  const PIP_Problem* get_owner() const;
-
-  //! Sets the pointer to the PIP_Problem owning object.
-  virtual void set_owner(const PIP_Problem* owner) = 0;
-
-  /*! \brief
-    Returns \c true if and only if all the nodes in the subtree
-    rooted in \p *this is owned by \p *pip.
-  */
-  virtual bool check_ownership(const PIP_Problem* owner) const = 0;
-
-public:
-#if PPL_USE_SPARSE_MATRIX
-  typedef Sparse_Row Row;
-#else
-  typedef Dense_Row Row;
-#endif
-
-  //! Returns a pointer to a dynamically-allocated copy of \p *this.
-  virtual PIP_Tree_Node* clone() const = 0;
-
-  //! Destructor.
-  virtual ~PIP_Tree_Node();
-
-  //! Returns \c true if and only if \p *this is well formed.
-  virtual bool OK() const = 0;
-
-  //! Returns \p this if \p *this is a solution node, 0 otherwise.
-  virtual const PIP_Solution_Node* as_solution() const = 0;
-
-  //! Returns \p this if \p *this is a decision node, 0 otherwise.
-  virtual const PIP_Decision_Node* as_decision() const = 0;
-
-  /*! \brief
-    Returns the system of parameter constraints controlling \p *this.
-
-    The indices in the constraints are the same as the original variables and
-    parameters. Coefficients in indices corresponding to variables always are
-    zero.
-  */
-  const Constraint_System& constraints() const;
-
-  class Artificial_Parameter;
-
-  //! A type alias for a sequence of Artificial_Parameter's.
-  typedef std::vector<Artificial_Parameter> Artificial_Parameter_Sequence;
-
-  //! Returns a const_iterator to the beginning of local artificial parameters.
-  Artificial_Parameter_Sequence::const_iterator art_parameter_begin() const;
-
-  //! Returns a const_iterator to the end of local artificial parameters.
-  Artificial_Parameter_Sequence::const_iterator art_parameter_end() const;
-
-  //! Returns the number of local artificial parameters.
-  dimension_type art_parameter_count() const;
-
-  //! Prints on \p s the tree rooted in \p *this.
-  /*!
-    \param s
-    The output stream.
-
-    \param indent
-    The amount of indentation.
-  */
-  void print(std::ostream& s, int indent = 0) const;
-
-  //! Dumps to \p s an ASCII representation of \p *this.
-  void ascii_dump(std::ostream& s) const;
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  virtual memory_size_type total_memory_in_bytes() const = 0;
-  //! Returns the size in bytes of the memory managed by \p *this.
-  virtual memory_size_type external_memory_in_bytes() const = 0;
-
-protected:
-  //! A type alias for a sequence of constraints.
-  typedef std::vector<Constraint> Constraint_Sequence;
-
-  // Only PIP_Problem and PIP_Decision_Node are allowed to use the
-  // constructor and methods.
-  friend class PIP_Problem;
-  friend class PIP_Decision_Node;
-  friend class PIP_Solution_Node;
-
-  //! A pointer to the PIP_Problem object owning this node.
-  const PIP_Problem* owner_;
-
-  //! A pointer to the parent of \p *this, null if \p *this is the root.
-  const PIP_Decision_Node* parent_;
-
-  //! The local system of parameter constraints.
-  Constraint_System constraints_;
-
-  //! The local sequence of expressions for local artificial parameters.
-  Artificial_Parameter_Sequence artificial_parameters;
-
-  //! Returns a pointer to this node's parent.
-  const PIP_Decision_Node* parent() const;
-
-  //! Set this node's parent to \p *p.
-  void set_parent(const PIP_Decision_Node* p);
-
-  /*! \brief
-    Populates the parametric simplex tableau using external data.
-
-    \param pip
-    The PIP_Problem object containing this node.
-
-    \param external_space_dim
-    The number of all problem variables and problem parameters
-    (excluding artificial parameters).
-
-    \param first_pending_constraint
-    The first element in \p input_cs to be added to the tableau,
-    which already contains the previous elements.
-
-    \param input_cs
-    All the constraints of the PIP problem.
-
-    \param parameters
-    The set of indices of the problem parameters.
-  */
-  virtual void update_tableau(const PIP_Problem& pip,
-                              dimension_type external_space_dim,
-                              dimension_type first_pending_constraint,
-                              const Constraint_Sequence& input_cs,
-                              const Variables_Set& parameters) = 0;
-
-  /*! \brief
-    Executes a parametric simplex on the tableau, under specified context.
-
-    \return
-    The root of the PIP tree solution, or 0 if unfeasible.
-
-    \param pip
-    The PIP_Problem object containing this node.
-
-    \param check_feasible_context
-    Whether the resolution process should (re-)check feasibility of
-    context (since the initial context may have been modified).
-
-    \param context
-    The context, being a set of constraints on the parameters.
-
-    \param params
-    The local parameter set, including parent's artificial parameters.
-
-    \param space_dim
-    The space dimension of parent, including artificial parameters.
-
-    \param indent_level
-    The indentation level (for debugging output only).
-  */
-  virtual PIP_Tree_Node* solve(const PIP_Problem& pip,
-                               bool check_feasible_context,
-                               const Matrix<Row>& context,
-                               const Variables_Set& params,
-                               dimension_type space_dim,
-                               int indent_level) = 0;
-
-  //! Inserts a new parametric constraint in internal row format.
-  void add_constraint(const Row& row, const Variables_Set& parameters);
-
-  //! Merges parent's artificial parameters into \p *this.
-  void parent_merge();
-
-  //! Prints on \p s the tree rooted in \p *this.
-  /*!
-    \param s
-    The output stream.
-
-    \param indent
-    The amount of indentation.
-
-    \param pip_dim_is_param
-    A vector of Boolean flags telling which PIP problem dimensions are
-    problem parameters. The size of the vector is equal to the PIP
-    problem internal space dimension (i.e., no artificial parameters).
-
-    \param first_art_dim
-    The first space dimension corresponding to an artificial parameter
-    that was created in this node (if any).
-  */
-  virtual void print_tree(std::ostream& s,
-                          int indent,
-                          const std::vector<bool>& pip_dim_is_param,
-                          dimension_type first_art_dim) const = 0;
-
-  //! A helper function used when printing PIP trees.
-  static void
-  indent_and_print(std::ostream& s, int indent, const char* str);
-
-  /*! \brief
-    Checks whether a context matrix is satisfiable.
-
-    The satisfiability check is implemented by the revised dual simplex
-    algorithm on the context matrix. The algorithm ensures the feasible
-    solution is integer by applying a cut generation method when
-    intermediate non-integer solutions are found.
-  */
-  static bool compatibility_check(Matrix<Row>& s);
-
-  /*! \brief
-    Helper method: checks for satisfiability of the restricted context
-    obtained by adding \p row to \p context.
-  */
-  static bool compatibility_check(const Matrix<Row>& context, const Row& row);
-
-}; // class PIP_Tree_Node
-
-
-/*! \brief
-  Artificial parameters in PIP solution trees.
-
-  These parameters are built from a linear expression combining other
-  parameters (constant term included) divided by a positive integer
-  denominator. Coefficients at variables indices corresponding to
-  PIP problem variables are always zero.
-*/
-class PIP_Tree_Node::Artificial_Parameter
-  : public Linear_Expression {
-public:
-  //! Default constructor: builds a zero artificial parameter.
-  Artificial_Parameter();
-
-  //! Constructor.
-  /*!
-    Builds artificial parameter \f$\frac{\mathtt{expr}}{\mathtt{d}}\f$.
-
-    \param expr
-    The expression that, after normalization, will form the numerator of
-    the artificial parameter.
-
-    \param d
-    The integer constant that, after normalization, will form the
-    denominator of the artificial parameter.
-
-    \exception std::invalid_argument
-    Thrown if \p d is zero.
-
-    Normalization will ensure that the denominator is positive.
-  */
-  Artificial_Parameter(const Linear_Expression& expr,
-                       Coefficient_traits::const_reference d);
-
-  //! Copy constructor.
-  Artificial_Parameter(const Artificial_Parameter& y);
-
-  //! Returns the normalized (i.e., positive) denominator.
-  Coefficient_traits::const_reference denominator() const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Artificial_Parameter& y);
-
-  //! Returns \c true if and only if \p *this and \p y are equal.
-  /*!
-    Note that two artificial parameters having different space dimensions
-    are considered to be different.
-  */
-  bool operator==(const Artificial_Parameter& y) const;
-  //! Returns \c true if and only if \p *this and \p y are different.
-  bool operator!=(const Artificial_Parameter& y) const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Returns \c true if and only if the parameter is well-formed.
-  bool OK() const;
-
-private:
-  //! The normalized (i.e., positive) denominator.
-  Coefficient denom;
-}; // class PIP_Tree_Node::Artificial_Parameter
-
-
-//! Swaps \p x with \p y.
-/*! \relates PIP_Tree_Node::Artificial_Parameter */
-void
-swap(PIP_Tree_Node::Artificial_Parameter& x,
-     PIP_Tree_Node::Artificial_Parameter& y);
-
-
-//! A tree node representing part of the space of solutions.
-class PIP_Solution_Node : public PIP_Tree_Node {
-public:
-
-  //! Constructor: builds a solution node owned by \p *owner.
-  explicit PIP_Solution_Node(const PIP_Problem* owner);
-
-  //! Returns a pointer to a dynamically-allocated copy of \p *this.
-  virtual PIP_Tree_Node* clone() const;
-
-  //! Destructor.
-  virtual ~PIP_Solution_Node();
-
-  //! Returns \c true if and only if \p *this is well formed.
-  virtual bool OK() const;
-
-  //! Returns \p this.
-  virtual const PIP_Solution_Node* as_solution() const;
-
-  //! Returns 0, since \p this is not a decision node.
-  virtual const PIP_Decision_Node* as_decision() const;
-
-  /*! \brief
-    Returns a parametric expression for the values of problem variable \p var.
-
-    The returned linear expression may involve problem parameters
-    as well as artificial parameters.
-
-    \param var
-    The problem variable which is queried about.
-
-    \exception std::invalid_argument
-    Thrown if \p var is dimension-incompatible with the PIP_Problem
-    owning this solution node, or if \p var is a problem parameter.
-  */
-  const Linear_Expression& parametric_values(Variable var) const;
-
-  //! Dumps to \p os an ASCII representation of \p *this.
-  void ascii_dump(std::ostream& os) const;
-
-  /*! \brief
-    Loads from \p is an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& is);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  virtual memory_size_type total_memory_in_bytes() const;
-  //! Returns the size in bytes of the memory managed by \p *this.
-  virtual memory_size_type external_memory_in_bytes() const;
-
-private:
-  //! The type for parametric simplex tableau.
-  struct Tableau {
-    //! The matrix of simplex coefficients.
-    Matrix<Row> s;
-    //! The matrix of parameter coefficients.
-    Matrix<Row> t;
-    //! A common denominator for all matrix elements
-    Coefficient denom;
-
-    //! Default constructor.
-    Tableau();
-    //! Copy constructor.
-    Tableau(const Tableau& y);
-    //! Destructor.
-    ~Tableau();
-
-    //! Tests whether the matrix is integer, i.e., the denominator is 1.
-    bool is_integer() const;
-
-    //! Multiplies all coefficients and denominator with ratio.
-    void scale(Coefficient_traits::const_reference ratio);
-
-    //! Normalizes the modulo of coefficients so that they are mutually prime.
-    /*!
-      Computes the Greatest Common Divisor (GCD) among the elements of
-      the matrices and normalizes them and the denominator by the GCD itself.
-    */
-    void normalize();
-
-    /*! \brief
-      Compares two pivot row and column pairs before pivoting.
-
-      The algorithm searches the first (ie, leftmost) column \f$k\f$ in
-      parameter matrix for which the \f$c=s_{*j}\frac{t_{ik}}{s_{ij}}\f$
-      and \f$c'=s_{*j'}\frac{t_{i'k}}{s_{i'j'}}\f$ columns are different,
-      where \f$s_{*j}\f$ denotes the \f$j\f$<sup>th</sup> column from the
-      \f$s\f$ matrix and \f$s_{*j'}\f$ is the \f$j'\f$<sup>th</sup> column
-      of \f$s\f$.
-
-      \f$c\f$ is the computed column that would be subtracted to column
-      \f$k\f$ in parameter matrix if pivoting is done using the \f$(i,j)\f$
-      row and column pair.
-      \f$c'\f$ is the computed column that would be subtracted to column
-      \f$k\f$ in parameter matrix if pivoting is done using the
-      \f$(i',j')\f$ row and column pair.
-
-      The test is true if the computed \f$-c\f$ column is lexicographically
-      bigger than the \f$-c'\f$ column. Due to the column ordering in the
-      parameter matrix of the tableau, leftmost search will enforce solution
-      increase with respect to the following priority order:
-       - the constant term
-       - the coefficients for the original parameters
-       - the coefficients for the oldest artificial parameters.
-
-      \return
-      \c true if pivot row and column pair \f$(i,j)\f$ is more
-      suitable for pivoting than the \f$(i',j')\f$ pair
-
-      \param mapping
-      The PIP_Solution_Node::mapping vector for the tableau.
-
-      \param basis
-      The PIP_Solution_Node::basis vector for the tableau.
-
-      \param row_0
-      The row number for the first pivot row and column pair to be compared.
-
-      \param col_0
-      The column number for the first pivot row and column pair to be
-      compared.
-
-      \param row_1
-      The row number for the second pivot row and column pair to be compared.
-
-      \param col_1
-      The column number for the second pivot row and column pair to be
-      compared.
-    */
-    bool is_better_pivot(const std::vector<dimension_type>& mapping,
-                         const std::vector<bool>& basis,
-                         const dimension_type row_0,
-                         const dimension_type col_0,
-                         const dimension_type row_1,
-                         const dimension_type col_1) const;
-
-    //! Returns the value of the denominator.
-    Coefficient_traits::const_reference denominator() const;
-
-    //! Dumps to \p os an ASCII representation of \p *this.
-    void ascii_dump(std::ostream& os) const;
-
-    /*! \brief
-      Loads from \p is an ASCII representation (as produced by
-      ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-      Returns \c true if successful, \c false otherwise.
-    */
-    bool ascii_load(std::istream& is);
-
-    //! Returns the size in bytes of the memory managed by \p *this.
-    /*!
-      \note
-      No need for a \c total_memory_in_bytes() method, since
-      class Tableau is a private inner class of PIP_Solution_Node.
-    */
-    memory_size_type external_memory_in_bytes() const;
-
-    //! Returns \c true if and only if \p *this is well formed.
-    bool OK() const;
-  }; // struct Tableau
-
-  //! The parametric simplex tableau.
-  Tableau tableau;
-
-  /*! \brief
-    A boolean vector for identifying the basic variables.
-
-    Variable identifiers are numbered from 0 to <CODE>n+m-1</CODE>, where \p n
-    is the number of columns in the simplex tableau corresponding to variables,
-    and \p m is the number of rows.
-
-    Indices from 0 to <CODE>n-1</CODE> correspond to the original variables.
-
-    Indices from \p n to <CODE>n+m-1</CODE> correspond to the slack variables
-    associated to the internal constraints, which do not strictly correspond
-    to original constraints, since these may have been transformed to fit the
-    standard form of the dual simplex.
-
-    The value for <CODE>basis[i]</CODE> is:
-     - \b true if variable \p i is basic,
-     - \b false if variable \p i is nonbasic.
-  */
-  std::vector<bool> basis;
-
-  /*! \brief
-    A mapping between the tableau rows/columns and the original variables.
-
-    The value of <CODE>mapping[i]</CODE> depends of the value of <CODE>basis[i]</CODE>.
-
-     - If <CODE>basis[i]</CODE> is \b true, <CODE>mapping[i]</CODE> encodes the column
-       index of variable \p i in the \p s matrix of the tableau.
-     - If <CODE>basis[i]</CODE> is \b false, <CODE>mapping[i]</CODE> encodes the row
-       index of variable \p i in the tableau.
-  */
-  std::vector<dimension_type> mapping;
-
-  /*! \brief
-    The variable identifiers associated to the rows of the simplex tableau.
-  */
-  std::vector<dimension_type> var_row;
-
-  /*! \brief
-    The variable identifiers associated to the columns of the simplex tableau.
-  */
-  std::vector<dimension_type> var_column;
-
-  /*! \brief
-    The variable number of the special inequality used for modeling
-    equality constraints.
-
-    The subset of equality constraints in a specific problem can be expressed
-    as: \f$f_i(x,p) = 0 ; 1 \leq i \leq n\f$. As the dual simplex standard form
-    requires constraints to be inequalities, the following constraints can be
-    modeled as follows:
-
-     - \f$f_i(x,p) \geq 0 ; 1 \leq i \leq n\f$
-
-     - \f$\sum\limits_{i=1}^n f_i(x,p) \leq 0\f$
-
-    The \p special_equality_row value stores the variable number of the
-    specific constraint which is used to model the latter sum of
-    constraints. If no such constraint exists, the value is set to \p 0.
-  */
-  dimension_type special_equality_row;
-
-  /*! \brief
-    The column index in the parametric part of the simplex tableau
-    corresponding to the big parameter; \c not_a_dimension() if not set.
-  */
-  dimension_type big_dimension;
-
-  //! The possible values for the sign of a parametric linear expression.
-  enum Row_Sign {
-    //! Not computed yet (default).
-    UNKNOWN,
-    //! All row coefficients are zero.
-    ZERO,
-    //! All nonzero row coefficients are positive.
-    POSITIVE,
-    //! All nonzero row coefficients are negative.
-    NEGATIVE,
-    //! The row contains both positive and negative coefficients.
-    MIXED
-  };
-
-  //! A cache for computed sign values of constraint parametric RHS.
-  std::vector<Row_Sign> sign;
-
-  //! Parametric values for the solution.
-  std::vector<Linear_Expression> solution;
-
-  //! An indicator for solution validity.
-  bool solution_valid;
-
-  //! Returns the sign of row \p x.
-  static Row_Sign row_sign(const Row& x,
-                           dimension_type big_dimension);
-
-protected:
-  //! Copy constructor.
-  PIP_Solution_Node(const PIP_Solution_Node& y);
-
-  //! A tag type to select the alternative copy constructor.
-  struct No_Constraints {};
-
-  //! Alternative copy constructor.
-  /*!
-    This constructor differs from the default copy constructor in that
-    it will not copy the constraint system, nor the artificial parameters.
-  */
-  PIP_Solution_Node(const PIP_Solution_Node& y, No_Constraints);
-
-  // PIP_Problem::ascii load() method needs access set_owner().
-  friend bool PIP_Problem::ascii_load(std::istream& s);
-
-  //! Sets the pointer to the PIP_Problem owning object.
-  virtual void set_owner(const PIP_Problem* owner);
-
-  /*! \brief
-    Returns \c true if and only if all the nodes in the subtree
-    rooted in \p *this is owned by \p *pip.
-  */
-  virtual bool check_ownership(const PIP_Problem* owner) const;
-
-  //! Implements pure virtual method PIP_Tree_Node::update_tableau.
-  virtual void update_tableau(const PIP_Problem& pip,
-                              dimension_type external_space_dim,
-                              dimension_type first_pending_constraint,
-                              const Constraint_Sequence& input_cs,
-                              const Variables_Set& parameters);
-
-  /*! \brief
-    Update the solution values.
-
-    \param pip_dim_is_param
-    A vector of Boolean flags telling which PIP problem dimensions are
-    problem parameters. The size of the vector is equal to the PIP
-    problem internal space dimension (i.e., no artificial parameters).
-  */
-  void update_solution(const std::vector<bool>& pip_dim_is_param) const;
-
-  //! Helper method.
-  void update_solution() const;
-
-  //! Implements pure virtual method PIP_Tree_Node::solve.
-  virtual PIP_Tree_Node* solve(const PIP_Problem& pip,
-                               bool check_feasible_context,
-                               const Matrix<Row>& context,
-                               const Variables_Set& params,
-                               dimension_type space_dim,
-                               int indent_level);
-
-  /*! \brief
-    Generate a Gomory cut using non-integer tableau row \p index.
-
-    \param index
-    Row index in simplex tableau from which the cut is generated.
-
-    \param parameters
-    A std::set of the current parameter dimensions (including artificials);
-    to be updated if a new artificial parameter is to be created.
-
-    \param context
-    A set of linear inequalities on the parameters, in matrix form; to be
-    updated if a new artificial parameter is to be created.
-
-    \param space_dimension
-    The current space dimension, including variables and all parameters; to
-    be updated if an extra parameter is to be created.
-
-    \param indent_level
-    The indentation level (for debugging output only).
-  */
-  void generate_cut(dimension_type index, Variables_Set& parameters,
-                    Matrix<Row>& context, dimension_type& space_dimension,
-                    int indent_level);
-
-  //! Prints on \p s the tree rooted in \p *this.
-  virtual void print_tree(std::ostream& s, int indent,
-                          const std::vector<bool>& pip_dim_is_param,
-                          dimension_type first_art_dim) const;
-
-}; // class PIP_Solution_Node
-
-
-//! A tree node representing a decision in the space of solutions.
-class PIP_Decision_Node : public PIP_Tree_Node {
-public:
-  //! Returns a pointer to a dynamically-allocated copy of \p *this.
-  virtual PIP_Tree_Node* clone() const;
-
-  //! Destructor.
-  virtual ~PIP_Decision_Node();
-
-  //! Returns \c true if and only if \p *this is well formed.
-  virtual bool OK() const;
-
-  //! Returns \p this.
-  virtual const PIP_Decision_Node* as_decision() const;
-
-  //! Returns 0, since \p this is not a solution node.
-  virtual const PIP_Solution_Node* as_solution() const;
-
-  //! Returns a const pointer to the \p b (true or false) branch of \p *this.
-  const PIP_Tree_Node* child_node(bool b) const;
-
-  //! Returns a pointer to the \p b (true or false) branch of \p *this.
-  PIP_Tree_Node* child_node(bool b);
-
-  //! Dumps to \p s an ASCII representation of \p *this.
-  void ascii_dump(std::ostream& s) const;
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  virtual memory_size_type total_memory_in_bytes() const;
-  //! Returns the size in bytes of the memory managed by \p *this.
-  virtual memory_size_type external_memory_in_bytes() const;
-
-private:
-  // PIP_Solution_Node is allowed to use the constructor and methods.
-  friend class PIP_Solution_Node;
-
-  // PIP_Problem ascii load method needs access to private constructors.
-  friend bool PIP_Problem::ascii_load(std::istream& s);
-
-  //! Pointer to the "false" child of \p *this.
-  PIP_Tree_Node* false_child;
-
-  //! Pointer to the "true" child of \p *this.
-  PIP_Tree_Node* true_child;
-
-  /*! \brief
-    Builds a decision node having \p fcp and \p tcp as child.
-
-    The decision node will encode the structure
-    "if \c cs then \p tcp else \p fcp",
-    where the system of constraints \c cs is initially empty.
-
-    \param owner
-    Pointer to the owning PIP_Problem object; it may be null if and
-    only if both children are null.
-
-    \param fcp
-    Pointer to "false" child; it may be null.
-
-    \param tcp
-    Pointer to "true" child; it may be null.
-
-    \note
-    If any of \p fcp or \p tcp is not null, then \p owner is required
-    to be not null and equal to the owner of its non-null children;
-    otherwise the behavior is undefined.
-  */
-  explicit PIP_Decision_Node(const PIP_Problem* owner,
-                             PIP_Tree_Node* fcp,
-                             PIP_Tree_Node* tcp);
-
-  //! Sets the pointer to the PIP_Problem owning object.
-  virtual void set_owner(const PIP_Problem* owner);
-
-  /*! \brief
-    Returns \c true if and only if all the nodes in the subtree
-    rooted in \p *this is owned by \p *pip.
-  */
-  virtual bool check_ownership(const PIP_Problem* owner) const;
-
-protected:
-  //! Copy constructor.
-  PIP_Decision_Node(const PIP_Decision_Node& y);
-
-  //! Implements pure virtual method PIP_Tree_Node::update_tableau.
-  virtual void update_tableau(const PIP_Problem& pip,
-                              dimension_type external_space_dim,
-                              dimension_type first_pending_constraint,
-                              const Constraint_Sequence& input_cs,
-                              const Variables_Set& parameters);
-
-  //! Implements pure virtual method PIP_Tree_Node::solve.
-  virtual PIP_Tree_Node* solve(const PIP_Problem& pip,
-                               bool check_feasible_context,
-                               const Matrix<Row>& context,
-                               const Variables_Set& params,
-                               dimension_type space_dim,
-                               int indent_level);
-
-  //! Prints on \p s the tree rooted in \p *this.
-  virtual void print_tree(std::ostream& s, int indent,
-                          const std::vector<bool>& pip_dim_is_param,
-                          dimension_type first_art_dim) const;
-
-}; // class PIP_Decision_Node
-
-namespace IO_Operators {
-
-//! Output operator: prints the solution tree rooted in \p x.
-/*! \relates Parma_Polyhedra_Library::PIP_Tree_Node */
-std::ostream& operator<<(std::ostream& os, const PIP_Tree_Node& x);
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::PIP_Tree_Node::Artificial_Parameter */
-std::ostream& operator<<(std::ostream& os,
-                         const PIP_Tree_Node::Artificial_Parameter& x);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-#include "PIP_Tree.inlines.hh"
-
-#endif // !defined(PPL_PIP_Tree_defs_hh)
diff --git a/src/PIP_Tree.inlines.hh b/src/PIP_Tree.inlines.hh
deleted file mode 100644
index 32b56a8..0000000
--- a/src/PIP_Tree.inlines.hh
+++ /dev/null
@@ -1,140 +0,0 @@
-/* PIP_Tree related class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_PIP_Tree_inlines_hh
-#define PPL_PIP_Tree_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-PIP_Solution_Node::Tableau::Tableau()
-  : s(), t(), denom(1) {
-  PPL_ASSERT(OK());
-}
-
-inline
-PIP_Solution_Node::Tableau::Tableau(const Tableau& y)
-  : s(y.s), t(y.t), denom(y.denom) {
-  PPL_ASSERT(OK());
-}
-
-inline
-PIP_Solution_Node::Tableau::~Tableau() {
-}
-
-inline bool
-PIP_Solution_Node::Tableau::is_integer() const {
-  return denom == 1;
-}
-
-inline Coefficient_traits::const_reference
-PIP_Solution_Node::Tableau::denominator() const {
-  return denom;
-}
-
-inline
-PIP_Tree_Node::~PIP_Tree_Node() {
-}
-
-inline void
-PIP_Tree_Node::set_parent(const PIP_Decision_Node* p) {
-  parent_ = p;
-}
-
-inline const PIP_Decision_Node*
-PIP_Tree_Node::parent() const {
-  return parent_;
-}
-
-inline const PIP_Problem*
-PIP_Tree_Node::get_owner() const {
-  return owner_;
-}
-
-inline const Constraint_System&
-PIP_Tree_Node::constraints() const {
-  return constraints_;
-}
-
-inline PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
-PIP_Tree_Node::art_parameter_begin() const {
-  return artificial_parameters.begin();
-}
-
-inline PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
-PIP_Tree_Node::art_parameter_end() const {
-  return artificial_parameters.end();
-}
-
-inline dimension_type
-PIP_Tree_Node::art_parameter_count() const {
-  return artificial_parameters.size();
-}
-
-inline
-const PIP_Tree_Node*
-PIP_Decision_Node::child_node(bool b) const {
-  return b ? true_child : false_child;
-}
-
-inline
-PIP_Tree_Node*
-PIP_Decision_Node::child_node(bool b) {
-  return b ? true_child : false_child;
-}
-
-inline
-PIP_Tree_Node::Artificial_Parameter::Artificial_Parameter()
-  : Linear_Expression(), denom(1) {
-  PPL_ASSERT(OK());
-}
-
-inline
-PIP_Tree_Node::Artificial_Parameter
-::Artificial_Parameter(const Artificial_Parameter& y)
-  : Linear_Expression(y), denom(y.denom) {
-  PPL_ASSERT(OK());
-}
-
-inline Coefficient_traits::const_reference
-PIP_Tree_Node::Artificial_Parameter::denominator() const {
-  return denom;
-}
-
-inline void
-PIP_Tree_Node::Artificial_Parameter::m_swap(Artificial_Parameter& y) {
-  Linear_Expression::m_swap(y);
-  using std::swap;
-  swap(denom, y.denom);
-}
-
-/*! \relates PIP_Tree_Node::Artificial_Parameter */
-inline void
-swap(PIP_Tree_Node::Artificial_Parameter& x,
-     PIP_Tree_Node::Artificial_Parameter& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_PIP_Tree_inlines_hh)
diff --git a/src/PIP_Tree.types.hh b/src/PIP_Tree.types.hh
deleted file mode 100644
index b4a8f11..0000000
--- a/src/PIP_Tree.types.hh
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_PIP_Tree_types_hh
-#define PPL_PIP_Tree_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class PIP_Tree_Node;
-class PIP_Solution_Node;
-class PIP_Decision_Node;
-
-typedef const PIP_Tree_Node* PIP_Tree;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_PIP_Tree_types_hh)
diff --git a/src/PIP_Tree_defs.hh b/src/PIP_Tree_defs.hh
new file mode 100644
index 0000000..c26d7eb
--- /dev/null
+++ b/src/PIP_Tree_defs.hh
@@ -0,0 +1,836 @@
+/* PIP_Tree_Node class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_PIP_Tree_defs_hh
+#define PPL_PIP_Tree_defs_hh 1
+
+#include "PIP_Tree_types.hh"
+#include "Variable_defs.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Constraint_defs.hh"
+#include "Variables_Set_defs.hh"
+#include "globals_defs.hh"
+#include "PIP_Problem_defs.hh"
+
+#include "Matrix_defs.hh"
+#include "Dense_Row_defs.hh"
+#include "Sparse_Row_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+//! A node of the PIP solution tree.
+/*!
+  This is the base class for the nodes of the binary trees representing
+  the solutions of PIP problems. From this one, two classes are derived:
+    - PIP_Decision_Node, for the internal nodes of the tree;
+    - PIP_Solution_Node, for the leaves of the tree.
+*/
+class PIP_Tree_Node {
+protected:
+  //! Constructor: builds a node owned by \p *owner.
+  explicit PIP_Tree_Node(const PIP_Problem* owner);
+
+  //! Copy constructor.
+  PIP_Tree_Node(const PIP_Tree_Node& y);
+
+  //! Returns a pointer to the PIP_Problem owning object.
+  const PIP_Problem* get_owner() const;
+
+  //! Sets the pointer to the PIP_Problem owning object.
+  virtual void set_owner(const PIP_Problem* owner) = 0;
+
+  /*! \brief
+    Returns \c true if and only if all the nodes in the subtree
+    rooted in \p *this are owned by \p *owner.
+  */
+  virtual bool check_ownership(const PIP_Problem* owner) const = 0;
+
+public:
+#if PPL_USE_SPARSE_MATRIX
+  typedef Sparse_Row Row;
+#else
+  typedef Dense_Row Row;
+#endif
+
+  //! Returns a pointer to a dynamically-allocated copy of \p *this.
+  virtual PIP_Tree_Node* clone() const = 0;
+
+  //! Destructor.
+  virtual ~PIP_Tree_Node();
+
+  //! Returns \c true if and only if \p *this is well formed.
+  virtual bool OK() const = 0;
+
+  //! Returns \p this if \p *this is a solution node, 0 otherwise.
+  virtual const PIP_Solution_Node* as_solution() const = 0;
+
+  //! Returns \p this if \p *this is a decision node, 0 otherwise.
+  virtual const PIP_Decision_Node* as_decision() const = 0;
+
+  /*! \brief
+    Returns the system of parameter constraints controlling \p *this.
+
+    The indices in the constraints are the same as the original variables and
+    parameters. Coefficients in indices corresponding to variables always are
+    zero.
+  */
+  const Constraint_System& constraints() const;
+
+  class Artificial_Parameter;
+
+  //! A type alias for a sequence of Artificial_Parameter's.
+  typedef std::vector<Artificial_Parameter> Artificial_Parameter_Sequence;
+
+  //! Returns a const_iterator to the beginning of local artificial parameters.
+  Artificial_Parameter_Sequence::const_iterator art_parameter_begin() const;
+
+  //! Returns a const_iterator to the end of local artificial parameters.
+  Artificial_Parameter_Sequence::const_iterator art_parameter_end() const;
+
+  //! Returns the number of local artificial parameters.
+  dimension_type art_parameter_count() const;
+
+  //! Prints on \p s the tree rooted in \p *this.
+  /*!
+    \param s
+    The output stream.
+
+    \param indent
+    The amount of indentation.
+  */
+  void print(std::ostream& s, int indent = 0) const;
+
+  //! Dumps to \p s an ASCII representation of \p *this.
+  void ascii_dump(std::ostream& s) const;
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  virtual memory_size_type total_memory_in_bytes() const = 0;
+  //! Returns the size in bytes of the memory managed by \p *this.
+  virtual memory_size_type external_memory_in_bytes() const = 0;
+
+protected:
+  //! A type alias for a sequence of constraints.
+  typedef std::vector<Constraint> Constraint_Sequence;
+
+  // Only PIP_Problem and PIP_Decision_Node are allowed to use the
+  // constructor and methods.
+  friend class PIP_Problem;
+  friend class PIP_Decision_Node;
+  friend class PIP_Solution_Node;
+
+  //! A pointer to the PIP_Problem object owning this node.
+  const PIP_Problem* owner_;
+
+  //! A pointer to the parent of \p *this, null if \p *this is the root.
+  const PIP_Decision_Node* parent_;
+
+  //! The local system of parameter constraints.
+  Constraint_System constraints_;
+
+  //! The local sequence of expressions for local artificial parameters.
+  Artificial_Parameter_Sequence artificial_parameters;
+
+  //! Returns a pointer to this node's parent.
+  const PIP_Decision_Node* parent() const;
+
+  //! Set this node's parent to \p *p.
+  void set_parent(const PIP_Decision_Node* p);
+
+  /*! \brief
+    Populates the parametric simplex tableau using external data.
+
+    \param pip
+    The PIP_Problem object containing this node.
+
+    \param external_space_dim
+    The number of all problem variables and problem parameters
+    (excluding artificial parameters).
+
+    \param first_pending_constraint
+    The first element in \p input_cs to be added to the tableau,
+    which already contains the previous elements.
+
+    \param input_cs
+    All the constraints of the PIP problem.
+
+    \param parameters
+    The set of indices of the problem parameters.
+  */
+  virtual void update_tableau(const PIP_Problem& pip,
+                              dimension_type external_space_dim,
+                              dimension_type first_pending_constraint,
+                              const Constraint_Sequence& input_cs,
+                              const Variables_Set& parameters) = 0;
+
+  /*! \brief
+    Executes a parametric simplex on the tableau, under specified context.
+
+    \return
+    The root of the PIP tree solution, or 0 if unfeasible.
+
+    \param pip
+    The PIP_Problem object containing this node.
+
+    \param check_feasible_context
+    Whether the resolution process should (re-)check feasibility of
+    context (since the initial context may have been modified).
+
+    \param context
+    The context, being a set of constraints on the parameters.
+
+    \param params
+    The local parameter set, including parent's artificial parameters.
+
+    \param space_dim
+    The space dimension of parent, including artificial parameters.
+
+    \param indent_level
+    The indentation level (for debugging output only).
+  */
+  virtual PIP_Tree_Node* solve(const PIP_Problem& pip,
+                               bool check_feasible_context,
+                               const Matrix<Row>& context,
+                               const Variables_Set& params,
+                               dimension_type space_dim,
+                               int indent_level) = 0;
+
+  //! Inserts a new parametric constraint in internal row format.
+  void add_constraint(const Row& row, const Variables_Set& parameters);
+
+  //! Merges parent's artificial parameters into \p *this.
+  void parent_merge();
+
+  //! Prints on \p s the tree rooted in \p *this.
+  /*!
+    \param s
+    The output stream.
+
+    \param indent
+    The amount of indentation.
+
+    \param pip_dim_is_param
+    A vector of Boolean flags telling which PIP problem dimensions are
+    problem parameters. The size of the vector is equal to the PIP
+    problem internal space dimension (i.e., no artificial parameters).
+
+    \param first_art_dim
+    The first space dimension corresponding to an artificial parameter
+    that was created in this node (if any).
+  */
+  virtual void print_tree(std::ostream& s,
+                          int indent,
+                          const std::vector<bool>& pip_dim_is_param,
+                          dimension_type first_art_dim) const = 0;
+
+  //! A helper function used when printing PIP trees.
+  static void
+  indent_and_print(std::ostream& s, int indent, const char* str);
+
+  /*! \brief
+    Checks whether a context matrix is satisfiable.
+
+    The satisfiability check is implemented by the revised dual simplex
+    algorithm on the context matrix. The algorithm ensures the feasible
+    solution is integer by applying a cut generation method when
+    intermediate non-integer solutions are found.
+  */
+  static bool compatibility_check(Matrix<Row>& s);
+
+  /*! \brief
+    Helper method: checks for satisfiability of the restricted context
+    obtained by adding \p row to \p context.
+  */
+  static bool compatibility_check(const Matrix<Row>& context, const Row& row);
+
+}; // class PIP_Tree_Node
+
+
+/*! \brief
+  Artificial parameters in PIP solution trees.
+
+  These parameters are built from a linear expression combining other
+  parameters (constant term included) divided by a positive integer
+  denominator. Coefficients at variables indices corresponding to
+  PIP problem variables are always zero.
+*/
+class PIP_Tree_Node::Artificial_Parameter
+  : public Linear_Expression {
+public:
+  //! Default constructor: builds a zero artificial parameter.
+  Artificial_Parameter();
+
+  //! Constructor.
+  /*!
+    Builds artificial parameter \f$\frac{\mathtt{expr}}{\mathtt{d}}\f$.
+
+    \param expr
+    The expression that, after normalization, will form the numerator of
+    the artificial parameter.
+
+    \param d
+    The integer constant that, after normalization, will form the
+    denominator of the artificial parameter.
+
+    \exception std::invalid_argument
+    Thrown if \p d is zero.
+
+    Normalization will ensure that the denominator is positive.
+  */
+  Artificial_Parameter(const Linear_Expression& expr,
+                       Coefficient_traits::const_reference d);
+
+  //! Copy constructor.
+  Artificial_Parameter(const Artificial_Parameter& y);
+
+  //! Returns the normalized (i.e., positive) denominator.
+  Coefficient_traits::const_reference denominator() const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Artificial_Parameter& y);
+
+  //! Returns \c true if and only if \p *this and \p y are equal.
+  /*!
+    Note that two artificial parameters having different space dimensions
+    are considered to be different.
+  */
+  bool operator==(const Artificial_Parameter& y) const;
+  //! Returns \c true if and only if \p *this and \p y are different.
+  bool operator!=(const Artificial_Parameter& y) const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Returns \c true if and only if the parameter is well-formed.
+  bool OK() const;
+
+private:
+  //! The normalized (i.e., positive) denominator.
+  Coefficient denom;
+}; // class PIP_Tree_Node::Artificial_Parameter
+
+
+//! Swaps \p x with \p y.
+/*! \relates PIP_Tree_Node::Artificial_Parameter */
+void
+swap(PIP_Tree_Node::Artificial_Parameter& x,
+     PIP_Tree_Node::Artificial_Parameter& y);
+
+
+//! A tree node representing part of the space of solutions.
+class PIP_Solution_Node : public PIP_Tree_Node {
+public:
+
+  //! Constructor: builds a solution node owned by \p *owner.
+  explicit PIP_Solution_Node(const PIP_Problem* owner);
+
+  //! Returns a pointer to a dynamically-allocated copy of \p *this.
+  virtual PIP_Tree_Node* clone() const;
+
+  //! Destructor.
+  virtual ~PIP_Solution_Node();
+
+  //! Returns \c true if and only if \p *this is well formed.
+  virtual bool OK() const;
+
+  //! Returns \p this.
+  virtual const PIP_Solution_Node* as_solution() const;
+
+  //! Returns 0, since \p this is not a decision node.
+  virtual const PIP_Decision_Node* as_decision() const;
+
+  /*! \brief
+    Returns a parametric expression for the values of problem variable \p var.
+
+    The returned linear expression may involve problem parameters
+    as well as artificial parameters.
+
+    \param var
+    The problem variable which is queried about.
+
+    \exception std::invalid_argument
+    Thrown if \p var is dimension-incompatible with the PIP_Problem
+    owning this solution node, or if \p var is a problem parameter.
+  */
+  const Linear_Expression& parametric_values(Variable var) const;
+
+  //! Dumps to \p os an ASCII representation of \p *this.
+  void ascii_dump(std::ostream& os) const;
+
+  /*! \brief
+    Loads from \p is an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& is);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  virtual memory_size_type total_memory_in_bytes() const;
+  //! Returns the size in bytes of the memory managed by \p *this.
+  virtual memory_size_type external_memory_in_bytes() const;
+
+private:
+  //! The type for parametric simplex tableau.
+  struct Tableau {
+    //! The matrix of simplex coefficients.
+    Matrix<Row> s;
+    //! The matrix of parameter coefficients.
+    Matrix<Row> t;
+    //! A common denominator for all matrix elements
+    Coefficient denom;
+
+    //! Default constructor.
+    Tableau();
+    //! Copy constructor.
+    Tableau(const Tableau& y);
+    //! Destructor.
+    ~Tableau();
+
+    //! Tests whether the matrix is integer, i.e., the denominator is 1.
+    bool is_integer() const;
+
+    //! Multiplies all coefficients and denominator with ratio.
+    void scale(Coefficient_traits::const_reference ratio);
+
+    //! Normalizes the modulo of coefficients so that they are mutually prime.
+    /*!
+      Computes the Greatest Common Divisor (GCD) among the elements of
+      the matrices and normalizes them and the denominator by the GCD itself.
+    */
+    void normalize();
+
+    /*! \brief
+      Compares two pivot row and column pairs before pivoting.
+
+      The algorithm searches the first (ie, leftmost) column \f$k\f$ in
+      parameter matrix for which the \f$c=s_{*j}\frac{t_{ik}}{s_{ij}}\f$
+      and \f$c'=s_{*j'}\frac{t_{i'k}}{s_{i'j'}}\f$ columns are different,
+      where \f$s_{*j}\f$ denotes the \f$j\f$<sup>th</sup> column from the
+      \f$s\f$ matrix and \f$s_{*j'}\f$ is the \f$j'\f$<sup>th</sup> column
+      of \f$s\f$.
+
+      \f$c\f$ is the computed column that would be subtracted to column
+      \f$k\f$ in parameter matrix if pivoting is done using the \f$(i,j)\f$
+      row and column pair.
+      \f$c'\f$ is the computed column that would be subtracted to column
+      \f$k\f$ in parameter matrix if pivoting is done using the
+      \f$(i',j')\f$ row and column pair.
+
+      The test is true if the computed \f$-c\f$ column is lexicographically
+      bigger than the \f$-c'\f$ column. Due to the column ordering in the
+      parameter matrix of the tableau, leftmost search will enforce solution
+      increase with respect to the following priority order:
+       - the constant term
+       - the coefficients for the original parameters
+       - the coefficients for the oldest artificial parameters.
+
+      \return
+      \c true if pivot row and column pair \f$(i,j)\f$ is more
+      suitable for pivoting than the \f$(i',j')\f$ pair
+
+      \param mapping
+      The PIP_Solution_Node::mapping vector for the tableau.
+
+      \param basis
+      The PIP_Solution_Node::basis vector for the tableau.
+
+      \param row_0
+      The row number for the first pivot row and column pair to be compared.
+
+      \param col_0
+      The column number for the first pivot row and column pair to be
+      compared.
+
+      \param row_1
+      The row number for the second pivot row and column pair to be compared.
+
+      \param col_1
+      The column number for the second pivot row and column pair to be
+      compared.
+    */
+    bool is_better_pivot(const std::vector<dimension_type>& mapping,
+                         const std::vector<bool>& basis,
+                         const dimension_type row_0,
+                         const dimension_type col_0,
+                         const dimension_type row_1,
+                         const dimension_type col_1) const;
+
+    //! Returns the value of the denominator.
+    Coefficient_traits::const_reference denominator() const;
+
+    //! Dumps to \p os an ASCII representation of \p *this.
+    void ascii_dump(std::ostream& os) const;
+
+    /*! \brief
+      Loads from \p is an ASCII representation (as produced by
+      ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+      Returns \c true if successful, \c false otherwise.
+    */
+    bool ascii_load(std::istream& is);
+
+    //! Returns the size in bytes of the memory managed by \p *this.
+    /*!
+      \note
+      No need for a \c total_memory_in_bytes() method, since
+      class Tableau is a private inner class of PIP_Solution_Node.
+    */
+    memory_size_type external_memory_in_bytes() const;
+
+    //! Returns \c true if and only if \p *this is well formed.
+    bool OK() const;
+  }; // struct Tableau
+
+  //! The parametric simplex tableau.
+  Tableau tableau;
+
+  /*! \brief
+    A boolean vector for identifying the basic variables.
+
+    Variable identifiers are numbered from 0 to <CODE>n+m-1</CODE>, where \p n
+    is the number of columns in the simplex tableau corresponding to variables,
+    and \p m is the number of rows.
+
+    Indices from 0 to <CODE>n-1</CODE> correspond to the original variables.
+
+    Indices from \p n to <CODE>n+m-1</CODE> correspond to the slack variables
+    associated to the internal constraints, which do not strictly correspond
+    to original constraints, since these may have been transformed to fit the
+    standard form of the dual simplex.
+
+    The value for <CODE>basis[i]</CODE> is:
+     - \b true if variable \p i is basic,
+     - \b false if variable \p i is nonbasic.
+  */
+  std::vector<bool> basis;
+
+  /*! \brief
+    A mapping between the tableau rows/columns and the original variables.
+
+    The value of <CODE>mapping[i]</CODE> depends of the value of <CODE>basis[i]</CODE>.
+
+     - If <CODE>basis[i]</CODE> is \b true, <CODE>mapping[i]</CODE> encodes the column
+       index of variable \p i in the \p s matrix of the tableau.
+     - If <CODE>basis[i]</CODE> is \b false, <CODE>mapping[i]</CODE> encodes the row
+       index of variable \p i in the tableau.
+  */
+  std::vector<dimension_type> mapping;
+
+  /*! \brief
+    The variable identifiers associated to the rows of the simplex tableau.
+  */
+  std::vector<dimension_type> var_row;
+
+  /*! \brief
+    The variable identifiers associated to the columns of the simplex tableau.
+  */
+  std::vector<dimension_type> var_column;
+
+  /*! \brief
+    The variable number of the special inequality used for modeling
+    equality constraints.
+
+    The subset of equality constraints in a specific problem can be expressed
+    as: \f$f_i(x,p) = 0 ; 1 \leq i \leq n\f$. As the dual simplex standard form
+    requires constraints to be inequalities, the following constraints can be
+    modeled as follows:
+
+     - \f$f_i(x,p) \geq 0 ; 1 \leq i \leq n\f$
+
+     - \f$\sum\limits_{i=1}^n f_i(x,p) \leq 0\f$
+
+    The \p special_equality_row value stores the variable number of the
+    specific constraint which is used to model the latter sum of
+    constraints. If no such constraint exists, the value is set to \p 0.
+  */
+  dimension_type special_equality_row;
+
+  /*! \brief
+    The column index in the parametric part of the simplex tableau
+    corresponding to the big parameter; \c not_a_dimension() if not set.
+  */
+  dimension_type big_dimension;
+
+  //! The possible values for the sign of a parametric linear expression.
+  enum Row_Sign {
+    //! Not computed yet (default).
+    UNKNOWN,
+    //! All row coefficients are zero.
+    ZERO,
+    //! All nonzero row coefficients are positive.
+    POSITIVE,
+    //! All nonzero row coefficients are negative.
+    NEGATIVE,
+    //! The row contains both positive and negative coefficients.
+    MIXED
+  };
+
+  //! A cache for computed sign values of constraint parametric RHS.
+  std::vector<Row_Sign> sign;
+
+  //! Parametric values for the solution.
+  std::vector<Linear_Expression> solution;
+
+  //! An indicator for solution validity.
+  bool solution_valid;
+
+  //! Returns the sign of row \p x.
+  static Row_Sign row_sign(const Row& x,
+                           dimension_type big_dimension);
+
+protected:
+  //! Copy constructor.
+  PIP_Solution_Node(const PIP_Solution_Node& y);
+
+  //! A tag type to select the alternative copy constructor.
+  struct No_Constraints {};
+
+  //! Alternative copy constructor.
+  /*!
+    This constructor differs from the default copy constructor in that
+    it will not copy the constraint system, nor the artificial parameters.
+  */
+  PIP_Solution_Node(const PIP_Solution_Node& y, No_Constraints);
+
+  // PIP_Problem::ascii load() method needs access set_owner().
+  friend bool PIP_Problem::ascii_load(std::istream& s);
+
+  //! Sets the pointer to the PIP_Problem owning object.
+  virtual void set_owner(const PIP_Problem* owner);
+
+  /*! \brief
+    Returns \c true if and only if all the nodes in the subtree
+    rooted in \p *this is owned by \p *pip.
+  */
+  virtual bool check_ownership(const PIP_Problem* owner) const;
+
+  //! Implements pure virtual method PIP_Tree_Node::update_tableau.
+  virtual void update_tableau(const PIP_Problem& pip,
+                              dimension_type external_space_dim,
+                              dimension_type first_pending_constraint,
+                              const Constraint_Sequence& input_cs,
+                              const Variables_Set& parameters);
+
+  /*! \brief
+    Update the solution values.
+
+    \param pip_dim_is_param
+    A vector of Boolean flags telling which PIP problem dimensions are
+    problem parameters. The size of the vector is equal to the PIP
+    problem internal space dimension (i.e., no artificial parameters).
+  */
+  void update_solution(const std::vector<bool>& pip_dim_is_param) const;
+
+  //! Helper method.
+  void update_solution() const;
+
+  //! Implements pure virtual method PIP_Tree_Node::solve.
+  virtual PIP_Tree_Node* solve(const PIP_Problem& pip,
+                               bool check_feasible_context,
+                               const Matrix<Row>& context,
+                               const Variables_Set& params,
+                               dimension_type space_dim,
+                               int indent_level);
+
+  /*! \brief
+    Generate a Gomory cut using non-integer tableau row \p index.
+
+    \param index
+    Row index in simplex tableau from which the cut is generated.
+
+    \param parameters
+    A std::set of the current parameter dimensions (including artificials);
+    to be updated if a new artificial parameter is to be created.
+
+    \param context
+    A set of linear inequalities on the parameters, in matrix form; to be
+    updated if a new artificial parameter is to be created.
+
+    \param space_dimension
+    The current space dimension, including variables and all parameters; to
+    be updated if an extra parameter is to be created.
+
+    \param indent_level
+    The indentation level (for debugging output only).
+  */
+  void generate_cut(dimension_type index, Variables_Set& parameters,
+                    Matrix<Row>& context, dimension_type& space_dimension,
+                    int indent_level);
+
+  //! Prints on \p s the tree rooted in \p *this.
+  virtual void print_tree(std::ostream& s, int indent,
+                          const std::vector<bool>& pip_dim_is_param,
+                          dimension_type first_art_dim) const;
+
+}; // class PIP_Solution_Node
+
+
+//! A tree node representing a decision in the space of solutions.
+class PIP_Decision_Node : public PIP_Tree_Node {
+public:
+  //! Returns a pointer to a dynamically-allocated copy of \p *this.
+  virtual PIP_Tree_Node* clone() const;
+
+  //! Destructor.
+  virtual ~PIP_Decision_Node();
+
+  //! Returns \c true if and only if \p *this is well formed.
+  virtual bool OK() const;
+
+  //! Returns \p this.
+  virtual const PIP_Decision_Node* as_decision() const;
+
+  //! Returns 0, since \p this is not a solution node.
+  virtual const PIP_Solution_Node* as_solution() const;
+
+  //! Returns a const pointer to the \p b (true or false) branch of \p *this.
+  const PIP_Tree_Node* child_node(bool b) const;
+
+  //! Returns a pointer to the \p b (true or false) branch of \p *this.
+  PIP_Tree_Node* child_node(bool b);
+
+  //! Dumps to \p s an ASCII representation of \p *this.
+  void ascii_dump(std::ostream& s) const;
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  virtual memory_size_type total_memory_in_bytes() const;
+  //! Returns the size in bytes of the memory managed by \p *this.
+  virtual memory_size_type external_memory_in_bytes() const;
+
+private:
+  // PIP_Solution_Node is allowed to use the constructor and methods.
+  friend class PIP_Solution_Node;
+
+  // PIP_Problem ascii load method needs access to private constructors.
+  friend bool PIP_Problem::ascii_load(std::istream& s);
+
+  //! Pointer to the "false" child of \p *this.
+  PIP_Tree_Node* false_child;
+
+  //! Pointer to the "true" child of \p *this.
+  PIP_Tree_Node* true_child;
+
+  /*! \brief
+    Builds a decision node having \p fcp and \p tcp as child.
+
+    The decision node will encode the structure
+    "if \c cs then \p tcp else \p fcp",
+    where the system of constraints \c cs is initially empty.
+
+    \param owner
+    Pointer to the owning PIP_Problem object; it may be null if and
+    only if both children are null.
+
+    \param fcp
+    Pointer to "false" child; it may be null.
+
+    \param tcp
+    Pointer to "true" child; it may be null.
+
+    \note
+    If any of \p fcp or \p tcp is not null, then \p owner is required
+    to be not null and equal to the owner of its non-null children;
+    otherwise the behavior is undefined.
+  */
+  explicit PIP_Decision_Node(const PIP_Problem* owner,
+                             PIP_Tree_Node* fcp,
+                             PIP_Tree_Node* tcp);
+
+  //! Sets the pointer to the PIP_Problem owning object.
+  virtual void set_owner(const PIP_Problem* owner);
+
+  /*! \brief
+    Returns \c true if and only if all the nodes in the subtree
+    rooted in \p *this is owned by \p *pip.
+  */
+  virtual bool check_ownership(const PIP_Problem* owner) const;
+
+protected:
+  //! Copy constructor.
+  PIP_Decision_Node(const PIP_Decision_Node& y);
+
+  //! Implements pure virtual method PIP_Tree_Node::update_tableau.
+  virtual void update_tableau(const PIP_Problem& pip,
+                              dimension_type external_space_dim,
+                              dimension_type first_pending_constraint,
+                              const Constraint_Sequence& input_cs,
+                              const Variables_Set& parameters);
+
+  //! Implements pure virtual method PIP_Tree_Node::solve.
+  virtual PIP_Tree_Node* solve(const PIP_Problem& pip,
+                               bool check_feasible_context,
+                               const Matrix<Row>& context,
+                               const Variables_Set& params,
+                               dimension_type space_dim,
+                               int indent_level);
+
+  //! Prints on \p s the tree rooted in \p *this.
+  virtual void print_tree(std::ostream& s, int indent,
+                          const std::vector<bool>& pip_dim_is_param,
+                          dimension_type first_art_dim) const;
+
+}; // class PIP_Decision_Node
+
+namespace IO_Operators {
+
+//! Output operator: prints the solution tree rooted in \p x.
+/*! \relates Parma_Polyhedra_Library::PIP_Tree_Node */
+std::ostream& operator<<(std::ostream& os, const PIP_Tree_Node& x);
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::PIP_Tree_Node::Artificial_Parameter */
+std::ostream& operator<<(std::ostream& os,
+                         const PIP_Tree_Node::Artificial_Parameter& x);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+#include "PIP_Tree_inlines.hh"
+
+#endif // !defined(PPL_PIP_Tree_defs_hh)
diff --git a/src/PIP_Tree_inlines.hh b/src/PIP_Tree_inlines.hh
new file mode 100644
index 0000000..6e666d9
--- /dev/null
+++ b/src/PIP_Tree_inlines.hh
@@ -0,0 +1,140 @@
+/* PIP_Tree related class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_PIP_Tree_inlines_hh
+#define PPL_PIP_Tree_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+PIP_Solution_Node::Tableau::Tableau()
+  : s(), t(), denom(1) {
+  PPL_ASSERT(OK());
+}
+
+inline
+PIP_Solution_Node::Tableau::Tableau(const Tableau& y)
+  : s(y.s), t(y.t), denom(y.denom) {
+  PPL_ASSERT(OK());
+}
+
+inline
+PIP_Solution_Node::Tableau::~Tableau() {
+}
+
+inline bool
+PIP_Solution_Node::Tableau::is_integer() const {
+  return denom == 1;
+}
+
+inline Coefficient_traits::const_reference
+PIP_Solution_Node::Tableau::denominator() const {
+  return denom;
+}
+
+inline
+PIP_Tree_Node::~PIP_Tree_Node() {
+}
+
+inline void
+PIP_Tree_Node::set_parent(const PIP_Decision_Node* p) {
+  parent_ = p;
+}
+
+inline const PIP_Decision_Node*
+PIP_Tree_Node::parent() const {
+  return parent_;
+}
+
+inline const PIP_Problem*
+PIP_Tree_Node::get_owner() const {
+  return owner_;
+}
+
+inline const Constraint_System&
+PIP_Tree_Node::constraints() const {
+  return constraints_;
+}
+
+inline PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
+PIP_Tree_Node::art_parameter_begin() const {
+  return artificial_parameters.begin();
+}
+
+inline PIP_Tree_Node::Artificial_Parameter_Sequence::const_iterator
+PIP_Tree_Node::art_parameter_end() const {
+  return artificial_parameters.end();
+}
+
+inline dimension_type
+PIP_Tree_Node::art_parameter_count() const {
+  return artificial_parameters.size();
+}
+
+inline
+const PIP_Tree_Node*
+PIP_Decision_Node::child_node(bool b) const {
+  return b ? true_child : false_child;
+}
+
+inline
+PIP_Tree_Node*
+PIP_Decision_Node::child_node(bool b) {
+  return b ? true_child : false_child;
+}
+
+inline
+PIP_Tree_Node::Artificial_Parameter::Artificial_Parameter()
+  : Linear_Expression(), denom(1) {
+  PPL_ASSERT(OK());
+}
+
+inline
+PIP_Tree_Node::Artificial_Parameter
+::Artificial_Parameter(const Artificial_Parameter& y)
+  : Linear_Expression(y), denom(y.denom) {
+  PPL_ASSERT(OK());
+}
+
+inline Coefficient_traits::const_reference
+PIP_Tree_Node::Artificial_Parameter::denominator() const {
+  return denom;
+}
+
+inline void
+PIP_Tree_Node::Artificial_Parameter::m_swap(Artificial_Parameter& y) {
+  Linear_Expression::m_swap(y);
+  using std::swap;
+  swap(denom, y.denom);
+}
+
+/*! \relates PIP_Tree_Node::Artificial_Parameter */
+inline void
+swap(PIP_Tree_Node::Artificial_Parameter& x,
+     PIP_Tree_Node::Artificial_Parameter& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_PIP_Tree_inlines_hh)
diff --git a/src/PIP_Tree_types.hh b/src/PIP_Tree_types.hh
new file mode 100644
index 0000000..2eb61ad
--- /dev/null
+++ b/src/PIP_Tree_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_PIP_Tree_types_hh
+#define PPL_PIP_Tree_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class PIP_Tree_Node;
+class PIP_Solution_Node;
+class PIP_Decision_Node;
+
+typedef const PIP_Tree_Node* PIP_Tree;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_PIP_Tree_types_hh)
diff --git a/src/Partial_Function.cc b/src/Partial_Function.cc
index 81a62f1..b20e036 100644
--- a/src/Partial_Function.cc
+++ b/src/Partial_Function.cc
@@ -1,6 +1,6 @@
 /* Implementation of class Partial_Function (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Partial_Function.defs.hh"
-#include "Variable.defs.hh"
+#include "Partial_Function_defs.hh"
+#include "Variable_defs.hh"
 #include <iostream>
 
 namespace Parma_Polyhedra_Library {
diff --git a/src/Partial_Function.defs.hh b/src/Partial_Function.defs.hh
deleted file mode 100644
index e66d87e..0000000
--- a/src/Partial_Function.defs.hh
+++ /dev/null
@@ -1,87 +0,0 @@
-/* Partial_Function class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Partial_Function_defs_hh
-#define PPL_Partial_Function_defs_hh 1
-
-#include "Partial_Function.types.hh"
-#include "globals.defs.hh"
-#include <vector>
-#ifndef NDEBUG
-#include <set>
-#endif
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-class Partial_Function {
-public:
-  /*! \brief
-    Default constructor: builds a function with empty codomain
-    (i.e., always undefined).
-  */
-  Partial_Function();
-
-  /*! \brief
-    Returns \c true if and only if the represented partial function
-    has an empty codomain (i.e., it is always undefined).
-  */
-  bool has_empty_codomain() const;
-
-  /*! \brief
-    If the codomain is \e not empty, returns the maximum value in it.
-
-    \exception std::runtime_error
-    Thrown if called when \p *this has an empty codomain.
-  */
-  dimension_type max_in_codomain() const;
-
-  /*! \brief
-    If \p *this maps \p i to a value \c k, assigns \c k to \p j and
-    returns \c true; otherwise, \p j is unchanged and \c false is returned.
-  */
-  bool maps(dimension_type i, dimension_type& j) const;
-
-  void print(std::ostream& s) const;
-
-  /*! \brief
-    Modifies \p *this so that \p i is mapped to \p j.
-
-    \exception std::runtime_error
-    Thrown if \p *this is already mapping \p j.
-  */
-  void insert(dimension_type i, dimension_type j);
-
-private:
-  std::vector<dimension_type> vec;
-  dimension_type max;
-#ifndef NDEBUG
-  std::set<dimension_type> codomain;
-#endif
-}; // class Partial_Function
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Partial_Function.inlines.hh"
-
-#endif // !defined(PPL_Partial_Function_defs_hh)
diff --git a/src/Partial_Function.inlines.hh b/src/Partial_Function.inlines.hh
deleted file mode 100644
index 51d74c0..0000000
--- a/src/Partial_Function.inlines.hh
+++ /dev/null
@@ -1,90 +0,0 @@
-/* Partial_Function class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Partial_Function_inlines_hh
-#define PPL_Partial_Function_inlines_hh 1
-
-#include <stdexcept>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Partial_Function::Partial_Function()
-  : max(0) {
-}
-
-inline bool
-Partial_Function::has_empty_codomain() const {
-  PPL_ASSERT(vec.empty() == codomain.empty());
-  return vec.empty();
-}
-
-inline dimension_type
-Partial_Function::max_in_codomain() const {
-  if (has_empty_codomain())
-    throw std::runtime_error("Partial_Function::max_in_codomain() called"
-			     " when has_empty_codomain()");
-  PPL_ASSERT(codomain.begin() != codomain.end()
-             && max == *codomain.rbegin());
-  return max;
-}
-
-inline void
-Partial_Function::insert(dimension_type i, dimension_type j) {
-#ifndef NDEBUG
-  // The partial function has to be an injective map.
-  std::pair<std::set<dimension_type>::iterator, bool> s = codomain.insert(j);
-  PPL_ASSERT(s.second);
-#endif // #ifndef NDEBUG
-
-  // Expand `vec' if needed.
-  const dimension_type sz = vec.size();
-  if (i >= sz)
-    vec.insert(vec.end(), i - sz + 1, not_a_dimension());
-
-  // We cannot remap the same index to another one.
-  PPL_ASSERT(i < vec.size() && vec[i] == not_a_dimension());
-  vec[i] = j;
-
-  // Maybe update `max'.
-  if (j > max)
-    max = j;
-  PPL_ASSERT(codomain.begin() != codomain.end()
-             && max == *codomain.rbegin());
-}
-
-inline bool
-Partial_Function::maps(dimension_type i, dimension_type& j) const {
-  if (i >= vec.size())
-    return false;
-  dimension_type vec_i = vec[i];
-  if (vec_i == not_a_dimension())
-    return false;
-  j = vec_i;
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Partial_Function_inlines_hh)
diff --git a/src/Partial_Function.types.hh b/src/Partial_Function.types.hh
deleted file mode 100644
index ab1e5f9..0000000
--- a/src/Partial_Function.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Partial_Function_types_hh
-#define PPL_Partial_Function_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Partial_Function;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Partial_Function_types_hh)
diff --git a/src/Partial_Function_defs.hh b/src/Partial_Function_defs.hh
new file mode 100644
index 0000000..a621eef
--- /dev/null
+++ b/src/Partial_Function_defs.hh
@@ -0,0 +1,87 @@
+/* Partial_Function class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Partial_Function_defs_hh
+#define PPL_Partial_Function_defs_hh 1
+
+#include "Partial_Function_types.hh"
+#include "globals_defs.hh"
+#include <vector>
+#ifndef NDEBUG
+#include <set>
+#endif
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+class Partial_Function {
+public:
+  /*! \brief
+    Default constructor: builds a function with empty codomain
+    (i.e., always undefined).
+  */
+  Partial_Function();
+
+  /*! \brief
+    Returns \c true if and only if the represented partial function
+    has an empty codomain (i.e., it is always undefined).
+  */
+  bool has_empty_codomain() const;
+
+  /*! \brief
+    If the codomain is \e not empty, returns the maximum value in it.
+
+    \exception std::runtime_error
+    Thrown if called when \p *this has an empty codomain.
+  */
+  dimension_type max_in_codomain() const;
+
+  /*! \brief
+    If \p *this maps \p i to a value \c k, assigns \c k to \p j and
+    returns \c true; otherwise, \p j is unchanged and \c false is returned.
+  */
+  bool maps(dimension_type i, dimension_type& j) const;
+
+  void print(std::ostream& s) const;
+
+  /*! \brief
+    Modifies \p *this so that \p i is mapped to \p j.
+
+    \exception std::runtime_error
+    Thrown if \p *this is already mapping \p j.
+  */
+  void insert(dimension_type i, dimension_type j);
+
+private:
+  std::vector<dimension_type> vec;
+  dimension_type max;
+#ifndef NDEBUG
+  std::set<dimension_type> codomain;
+#endif
+}; // class Partial_Function
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Partial_Function_inlines.hh"
+
+#endif // !defined(PPL_Partial_Function_defs_hh)
diff --git a/src/Partial_Function_inlines.hh b/src/Partial_Function_inlines.hh
new file mode 100644
index 0000000..03fa44f
--- /dev/null
+++ b/src/Partial_Function_inlines.hh
@@ -0,0 +1,90 @@
+/* Partial_Function class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Partial_Function_inlines_hh
+#define PPL_Partial_Function_inlines_hh 1
+
+#include <stdexcept>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Partial_Function::Partial_Function()
+  : max(0) {
+}
+
+inline bool
+Partial_Function::has_empty_codomain() const {
+  PPL_ASSERT(vec.empty() == codomain.empty());
+  return vec.empty();
+}
+
+inline dimension_type
+Partial_Function::max_in_codomain() const {
+  if (has_empty_codomain())
+    throw std::runtime_error("Partial_Function::max_in_codomain() called"
+                             " when has_empty_codomain()");
+  PPL_ASSERT(codomain.begin() != codomain.end()
+             && max == *codomain.rbegin());
+  return max;
+}
+
+inline void
+Partial_Function::insert(dimension_type i, dimension_type j) {
+#ifndef NDEBUG
+  // The partial function has to be an injective map.
+  std::pair<std::set<dimension_type>::iterator, bool> s = codomain.insert(j);
+  PPL_ASSERT(s.second);
+#endif // #ifndef NDEBUG
+
+  // Expand `vec' if needed.
+  const dimension_type sz = vec.size();
+  if (i >= sz)
+    vec.insert(vec.end(), i - sz + 1, not_a_dimension());
+
+  // We cannot remap the same index to another one.
+  PPL_ASSERT(i < vec.size() && vec[i] == not_a_dimension());
+  vec[i] = j;
+
+  // Maybe update `max'.
+  if (j > max)
+    max = j;
+  PPL_ASSERT(codomain.begin() != codomain.end()
+             && max == *codomain.rbegin());
+}
+
+inline bool
+Partial_Function::maps(dimension_type i, dimension_type& j) const {
+  if (i >= vec.size())
+    return false;
+  const dimension_type vec_i = vec[i];
+  if (vec_i == not_a_dimension())
+    return false;
+  j = vec_i;
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Partial_Function_inlines_hh)
diff --git a/src/Partial_Function_types.hh b/src/Partial_Function_types.hh
new file mode 100644
index 0000000..647d135
--- /dev/null
+++ b/src/Partial_Function_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Partial_Function_types_hh
+#define PPL_Partial_Function_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Partial_Function;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Partial_Function_types_hh)
diff --git a/src/Partially_Reduced_Product.defs.hh b/src/Partially_Reduced_Product.defs.hh
deleted file mode 100644
index 885f158..0000000
--- a/src/Partially_Reduced_Product.defs.hh
+++ /dev/null
@@ -1,1689 +0,0 @@
-/* Partially_Reduced_Product class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Partially_Reduced_Product_defs_hh
-#define PPL_Partially_Reduced_Product_defs_hh 1
-
-#include "Partially_Reduced_Product.types.hh"
-#include "globals.types.hh"
-#include "Coefficient.defs.hh"
-#include "Variable.types.hh"
-#include "Variables_Set.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint.types.hh"
-#include "Generator.types.hh"
-#include "Congruence.types.hh"
-#include "Grid_Generator.types.hh"
-#include "Constraint_System.types.hh"
-#include "Generator_System.types.hh"
-#include "Congruence_System.types.hh"
-#include "Grid_Generator_System.types.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "C_Polyhedron.types.hh"
-#include "NNC_Polyhedron.types.hh"
-#include "Grid.types.hh"
-#include "Box.types.hh"
-#include "BD_Shape.types.hh"
-#include "Octagonal_Shape.types.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Partially_Reduced_Product
-  Writes a textual representation of \p dp on \p s.
-*/
-template <typename D1, typename D2, typename R>
-std::ostream&
-operator<<(std::ostream& s, const Partially_Reduced_Product<D1, D2, R>& dp);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Partially_Reduced_Product */
-template <typename D1, typename D2, typename R>
-void swap(Partially_Reduced_Product<D1, D2, R>& x,
-	  Partially_Reduced_Product<D1, D2, R>& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if the components of \p x and \p y
-  are pairwise equal.
-
-  \relates Partially_Reduced_Product
-  Note that \p x and \p y may be dimension-incompatible: in
-  those cases, the value <CODE>false</CODE> is returned.
-*/
-template <typename D1, typename D2, typename R>
-bool operator==(const Partially_Reduced_Product<D1, D2, R>& x,
-		const Partially_Reduced_Product<D1, D2, R>& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if the components of \p x and \p y
-  are not pairwise equal.
-
-  \relates Partially_Reduced_Product
-  Note that \p x and \p y may be dimension-incompatible: in
-  those cases, the value <CODE>true</CODE> is returned.
-*/
-template <typename D1, typename D2, typename R>
-bool operator!=(const Partially_Reduced_Product<D1, D2, R>& x,
-		const Partially_Reduced_Product<D1, D2, R>& y);
-
-} // namespace Parma_Polyhedra_Library
-
-
-/*! \brief
-  This class provides the reduction method for the Smash_Product
-  domain.
-
-  \ingroup PPL_CXX_interface
-  The reduction classes are used to instantiate the Partially_Reduced_Product
-  domain. This class propagates emptiness between its components.
-*/
-template <typename D1, typename D2>
-class Parma_Polyhedra_Library::Smash_Reduction {
-public:
-  //! Default constructor.
-  Smash_Reduction();
-
-  /*! \brief
-    The smash reduction operator for propagating emptiness between the
-    domain elements \p d1 and \p d2.
-
-    If either of the the domain elements \p d1 or \p d2 is empty
-    then the other is also set empty.
-
-    \param d1
-    A pointset domain element;
-
-    \param d2
-    A pointset domain element;
-  */
-  void product_reduce(D1& d1, D2& d2);
-
-  //! Destructor.
-  ~Smash_Reduction();
-};
-
-/*! \brief
-  This class provides the reduction method for the Constraints_Product
-  domain.
-
-  \ingroup PPL_CXX_interface
-  The reduction classes are used to instantiate the Partially_Reduced_Product
-  domain. This class adds the constraints defining each of the component
-  domains to the other component.
-*/
-template <typename D1, typename D2>
-class Parma_Polyhedra_Library::Constraints_Reduction {
-public:
-  //! Default constructor.
-  Constraints_Reduction();
-
-  /*! \brief
-    The constraints reduction operator for sharing constraints between the
-    domains.
-
-    The minimized constraint system defining the domain element \p d1
-    is added to \p d2 and the minimized constraint system  defining \p d2
-    is added to \p d1.
-    In each case, the donor domain must provide a constraint system
-    in minimal form; this must define a polyhedron in which the
-    donor element is contained.
-    The recipient domain selects a subset of these constraints
-    that it can add to the recipient element.
-    For example: if the domain \p D1 is the Grid domain and \p D2
-    the NNC Polyhedron domain, then only the equality constraints are copied
-    from \p d1 to \p d2 and from \p d2 to \p d1.
-
-    \param d1
-    A pointset domain element;
-
-    \param d2
-    A pointset domain element;
-  */
-  void product_reduce(D1& d1, D2& d2);
-
-  //! Destructor.
-  ~Constraints_Reduction();
-};
-
-/*! \brief
-  This class provides the reduction method for the Congruences_Product
-  domain.
-
-  \ingroup PPL_CXX_interface
-  The reduction classes are used to instantiate the Partially_Reduced_Product
-  domain.
-
-  This class uses the minimized congruences defining each of the components.
-  For each of the congruences, it checks if the other component
-  intersects none, one or more than one hyperplane defined by the congruence
-  and adds equalities or emptiness as appropriate; in more detail:
-  Letting the components be d1 and d2, then, for each congruence cg
-  representing d1:
-  - if more than one hyperplane defined by cg intersects
-    d2, then d1 and d2 are unchanged;
-  - if exactly one hyperplane intersects d2, then d1 and d2 are
-    refined with the corresponding equality ;
-  - otherwise, d1 and d2 are set to empty.
-  Unless d1 and d2 are already empty, the process is repeated where the
-  roles of d1 and d2 are reversed.
-  If d1 or d2 is empty, then the emptiness is propagated.
-
-*/
-template <typename D1, typename D2>
-class Parma_Polyhedra_Library::Congruences_Reduction {
-public:
-  //! Default constructor.
-  Congruences_Reduction();
-
-  /*! \brief
-    The congruences reduction operator for detect emptiness or any equalities
-    implied by each of the congruences defining one of the components
-    and the bounds of the other component. It is assumed that the
-    components are already constraints reduced.
-
-    The minimized congruence system defining the domain element \p d1
-    is used to check if \p d2 intersects none, one or more than one
-    of the hyperplanes defined by the congruences: if it intersects none,
-    then product is set empty; if it intersects one, then the equality
-    defining this hyperplane is added to both components; otherwise,
-    the product is unchanged.
-    In each case, the donor domain must provide a congruence system
-    in minimal form.
-
-    \param d1
-    A pointset domain element;
-
-    \param d2
-    A pointset domain element;
-  */
-  void product_reduce(D1& d1, D2& d2);
-
-  //! Destructor.
-  ~Congruences_Reduction();
-};
-
-/*! \brief
-  This class provides the reduction method for the Shape_Preserving_Product
-  domain.
-
-  \ingroup PPL_CXX_interface
-  The reduction classes are used to instantiate the Partially_Reduced_Product
-  domain.
-
-  This reduction method includes the congruences reduction.
-  This class uses the minimized constraints defining each of the components.
-  For each of the constraints, it checks the frequency and value for the same
-  linear expression in the other component. If the constraint does not satisfy
-  the implied congruence, the inhomogeneous term is adjusted so that it does.
-  Note that, unless the congruences reduction adds equalities, the
-  shapes of the domains are unaltered.
-
-*/
-template <typename D1, typename D2>
-class Parma_Polyhedra_Library::Shape_Preserving_Reduction {
-public:
-  //! Default constructor.
-  Shape_Preserving_Reduction();
-
-  /*! \brief
-    The congruences reduction operator for detect emptiness or any equalities
-    implied by each of the congruences defining one of the components
-    and the bounds of the other component. It is assumed that the
-    components are already constraints reduced.
-
-    The minimized congruence system defining the domain element \p d1
-    is used to check if \p d2 intersects none, one or more than one
-    of the hyperplanes defined by the congruences: if it intersects none,
-    then product is set empty; if it intersects one, then the equality
-    defining this hyperplane is added to both components; otherwise,
-    the product is unchanged.
-    In each case, the donor domain must provide a congruence system
-    in minimal form.
-
-    \param d1
-    A pointset domain element;
-
-    \param d2
-    A pointset domain element;
-  */
-  void product_reduce(D1& d1, D2& d2);
-
-  //! Destructor.
-  ~Shape_Preserving_Reduction();
-};
-
-/*! \brief
-  This class provides the reduction method for the Direct_Product domain.
-
-  \ingroup PPL_CXX_interface
-  The reduction classes are used to instantiate the Partially_Reduced_Product
-  domain template parameter \p R. This class does no reduction at all.
-*/
-template <typename D1, typename D2>
-class Parma_Polyhedra_Library::No_Reduction {
-public:
-  //! Default constructor.
-  No_Reduction();
-
-  /*! \brief
-    The null reduction operator.
-
-    The parameters \p d1 and \p d2 are ignored.
-  */
-  void product_reduce(D1& d1, D2& d2);
-
-  //! Destructor.
-  ~No_Reduction();
-};
-
-//! The partially reduced product of two abstractions.
-/*! \ingroup PPL_CXX_interface
-
-  \warning
-  At present, the supported instantiations for the
-  two domain templates \p D1 and \p D2 are the simple pointset domains:
-  <CODE>C_Polyhedron</CODE>,
-  <CODE>NNC_Polyhedron</CODE>,
-  <CODE>Grid</CODE>,
-  <CODE>Octagonal_Shape<T></CODE>,
-  <CODE>BD_Shape<T></CODE>,
-  <CODE>Box<T></CODE>.
-
-  An object of the class <CODE>Partially_Reduced_Product<D1, D2, R></CODE>
-  represents the (partially reduced) product of two pointset domains \p D1
-  and \p D2 where the form of any reduction is defined by the
-  reduction class \p R.
-
-  Suppose \f$D_1\f$ and \f$D_2\f$ are two abstract domains
-  with concretization functions:
-  \f$\fund{\gamma_1}{D_1}{\Rset^n}\f$ and
-  \f$\fund{\gamma_2}{D_2}{\Rset^n}\f$, respectively.
-
-  The partially reduced product \f$D = D_1 \times D_2\f$,
-  for any reduction class \p R, has a concretization
-  \f$\fund{\gamma}{D}{\Rset^n}\f$
-  where, if \f$d = (d_1, d_2) \in D\f$
-  \f[
-    \gamma(d) = \gamma_1(d_1) \inters \gamma_2(d_2).
-  \f]
-
-  The operations are defined to be the result of applying the corresponding
-  operations on each of the components provided the product is already reduced
-  by the reduction method defined by \p R.
-  In particular, if \p R is the <CODE>No_Reduction<D1, D2></CODE> class,
-  then the class <CODE>Partially_Reduced_Product<D1, D2, R></CODE> domain
-  is the direct product as defined in \ref CC79 "[CC79]".
-
-  How the results on the components are interpreted and
-  combined depend on the specific test.
-  For example, the test for emptiness will first make sure
-  the product is reduced (using the reduction method provided by \p R
-  if it is not already known to be reduced) and then test if either component
-  is empty; thus, if \p R defines no reduction between its components and
-  \f$d = (G, P) \in (\Gset \times \Pset)\f$
-  is a direct product in one dimension where \f$G\f$ denotes the set of
-  numbers that are integral multiples of 3 while \f$P\f$ denotes the
-  set of numbers between 1 and 2, then an operation that tests for
-  emptiness should return false.
-  However, the test for the universe returns true if and only if the
-  test <CODE>is_universe()</CODE> on both components returns true.
-
-  \par
-  In all the examples it is assumed that the template \c R is the
-  <CODE>No_Reduction<D1, D2></CODE> class and that variables
-  \c x and \c y are defined (where they are used) as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  \endcode
-
-  \par Example 1
-  The following code builds a direct product of a Grid and NNC Polyhedron,
-  corresponding to the positive even integer
-  pairs in \f$\Rset^2\f$, given as a system of congruences:
-  \code
-  Congruence_System cgs;
-  cgs.insert((x %= 0) / 2);
-  cgs.insert((y %= 0) / 2);
-  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> >
-    dp(cgs);
-  dp.add_constraint(x >= 0);
-  dp.add_constraint(y >= 0);
-  \endcode
-
-  \par Example 2
-  The following code builds the same product
-  in \f$\Rset^2\f$:
-  \code
-  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> > dp(2);
-  dp.add_constraint(x >= 0);
-  dp.add_constraint(y >= 0);
-  dp.add_congruence((x %= 0) / 2);
-  dp.add_congruence((y %= 0) / 2);
-  \endcode
-
-  \par Example 3
-  The following code will write "dp is empty":
-  \code
-  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> > dp(1);
-  dp.add_congruence((x %= 0) / 2);
-  dp.add_congruence((x %= 1) / 2);
-  if (dp.is_empty())
-    cout << "dp is empty." << endl;
-  else
-    cout << "dp is not empty." << endl;
-  \endcode
-
-  \par Example 4
-  The following code will write "dp is not empty":
-  \code
-  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> > dp(1);
-  dp.add_congruence((x %= 0) / 2);
-  dp.add_constraint(x >= 1);
-  dp.add_constraint(x <= 1);
-  if (dp.is_empty())
-    cout << "dp is empty." << endl;
-  else
-    cout << "dp is not empty." << endl;
-  \endcode
-*/
-
-template <typename D1, typename D2, typename R>
-class Parma_Polyhedra_Library::Partially_Reduced_Product {
-public:
-  /*! \brief
-    Returns the maximum space dimension this product
-    can handle.
-  */
-  static dimension_type max_space_dimension();
-
-  //! Builds an object having the specified properties.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the pair;
-
-    \param kind
-    Specifies whether a universe or an empty pair has to be built.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Partially_Reduced_Product(dimension_type num_dimensions = 0,
-				     Degenerate_Element kind = UNIVERSE);
-
-  //! Builds a pair, copying a system of congruences.
-  /*!
-    The pair inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences to be approximated by the pair.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Partially_Reduced_Product(const Congruence_System& cgs);
-
-  //! Builds a pair, recycling a system of congruences.
-  /*!
-    The pair inherits the space dimension of the congruence system.
-
-    \param cgs
-    The system of congruences to be approximates by the pair.
-    Its data-structures may be recycled to build the pair.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Partially_Reduced_Product(Congruence_System& cgs);
-
-  //! Builds a pair, copying a system of constraints.
-  /*!
-    The pair inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints to be approximated by the pair.
-
-    \exception std::length_error
-    Thrown if \p num_dimensions exceeds the maximum allowed space
-    dimension.
-  */
-  explicit Partially_Reduced_Product(const Constraint_System& cs);
-
-  //! Builds a pair, recycling a system of constraints.
-  /*!
-    The pair inherits the space dimension of the constraint system.
-
-    \param cs
-    The system of constraints to be approximated by the pair.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p cs exceeds the maximum allowed
-    space dimension.
-  */
-  explicit Partially_Reduced_Product(Constraint_System& cs);
-
-  //! Builds a product, from a C polyhedron.
-  /*!
-    Builds a product containing \p ph using algorithms whose
-    complexity does not exceed the one specified by \p complexity.
-    If \p complexity is \p ANY_COMPLEXITY, then the built product is the
-    smallest one containing \p ph.
-    The product inherits the space dimension of the polyhedron.
-
-    \param ph
-    The polyhedron to be approximated by the product.
-
-    \param complexity
-    The complexity that will not be exceeded.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p ph exceeds the maximum allowed
-    space dimension.
-  */
-  explicit
-  Partially_Reduced_Product(const C_Polyhedron& ph,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a product, from an NNC polyhedron.
-  /*!
-    Builds a product containing \p ph using algorithms whose
-    complexity does not exceed the one specified by \p complexity.
-    If \p complexity is \p ANY_COMPLEXITY, then the built product is the
-    smallest one containing \p ph.
-    The product inherits the space dimension of the polyhedron.
-
-    \param ph
-    The polyhedron to be approximated by the product.
-
-    \param complexity
-    The complexity that will not be exceeded.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p ph exceeds the maximum allowed
-    space dimension.
-  */
-  explicit
-  Partially_Reduced_Product(const NNC_Polyhedron& ph,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a product, from a grid.
-  /*!
-    Builds a product containing \p gr.
-    The product inherits the space dimension of the grid.
-
-    \param gr
-    The grid to be approximated by the product.
-
-    \param complexity
-    The complexity is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p gr exceeds the maximum allowed
-    space dimension.
-  */
-  explicit
-  Partially_Reduced_Product(const Grid& gr,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a product out of a box.
-  /*!
-    Builds a product containing \p box.
-    The product inherits the space dimension of the box.
-
-    \param box
-    The box representing the pair to be built.
-
-    \param complexity
-    The complexity is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename Interval>
-  Partially_Reduced_Product(const Box<Interval>& box,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a product out of a BD shape.
-  /*!
-    Builds a product containing \p bd.
-    The product inherits the space dimension of the BD shape.
-
-    \param bd
-    The BD shape representing the product to be built.
-
-    \param complexity
-    The complexity is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p bd exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename U>
-  Partially_Reduced_Product(const BD_Shape<U>& bd,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a product out of an octagonal shape.
-  /*!
-    Builds a product containing \p os.
-    The product inherits the space dimension of the octagonal shape.
-
-    \param os
-    The octagonal shape representing the product to be built.
-
-    \param complexity
-    The complexity is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p os exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename U>
-  Partially_Reduced_Product(const Octagonal_Shape<U>& os,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Ordinary copy constructor.
-  Partially_Reduced_Product(const Partially_Reduced_Product& y,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a conservative, upward approximation of \p y.
-  /*!
-    The complexity argument is ignored.
-  */
-  template <typename E1, typename E2, typename S>
-  explicit
-  Partially_Reduced_Product(const Partially_Reduced_Product<E1, E2, S>& y,
-                            Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator.  (\p *this and \p y can be
-    dimension-incompatible.)
-  */
-  Partially_Reduced_Product& operator=(const Partially_Reduced_Product& y);
-
-  //! \name Member Functions that Do Not Modify the Partially_Reduced_Product
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns the minimum \ref Affine_Independence_and_Affine_Dimension
-    "affine dimension"
-    (see also \ref Grid_Affine_Dimension "grid affine dimension")
-    of the components of \p *this.
-  */
-  dimension_type affine_dimension() const;
-
-  //! Returns a constant reference to the first of the pair.
-  const D1& domain1() const;
-
-  //! Returns a constant reference to the second of the pair.
-  const D2& domain2() const;
-
-  //! Returns a system of constraints which approximates \p *this.
-  Constraint_System constraints() const;
-
-  /*! \brief
-    Returns a system of constraints which approximates \p *this, in
-    reduced form.
-  */
-  Constraint_System minimized_constraints() const;
-
-  //! Returns a system of congruences which approximates \p *this.
-  Congruence_System congruences() const;
-
-  /*! \brief
-    Returns a system of congruences which approximates \p *this, in
-    reduced form.
-  */
-  Congruence_System minimized_congruences() const;
-
-  //! Returns the relations holding between \p *this and \p c.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-
-    Returns the Poly_Con_Relation \p r for \p *this:
-    suppose the first component returns \p r1 and the second \p r2,
-    then \p r implies <CODE>is_included()</CODE>
-    if and only if one or both of \p r1 and \p r2 imply
-    <CODE>is_included()</CODE>;
-    \p r implies <CODE>saturates()</CODE>
-    if and only if one or both of \p r1 and \p r2 imply
-    <CODE>saturates()</CODE>;
-    \p r implies <CODE>is_disjoint()</CODE>
-    if and only if one or both of \p r1 and \p r2 imply
-    <CODE>is_disjoint()</CODE>;
-    and \p r implies <CODE>nothing()</CODE>
-    if and only if both \p r1 and \p r2 imply
-    <CODE>strictly_intersects()</CODE>.
-  */
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  //! Returns the relations holding between \p *this and \p cg.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  //! Returns the relations holding between \p *this and \p g.
-  /*
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-
-    Returns the Poly_Gen_Relation \p r for \p *this:
-    suppose the first component returns \p r1 and the second \p r2,
-    then \p r = <CODE>subsumes()</CODE>
-    if and only if \p r1 = \p r2 = <CODE>subsumes()</CODE>;
-    and \p r = <CODE>nothing()</CODE>
-    if and only if one or both of \p r1 and \p r2 = <CODE>nothing()</CODE>;
-  */
-  Poly_Gen_Relation relation_with(const Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if either of the components
-    of \p *this are empty.
-  */
-  bool is_empty() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if both of the components
-    of \p *this are the universe.
-  */
-  bool is_universe() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if both of the components
-    of \p *this are topologically closed subsets of the vector space.
-  */
-  bool is_topologically_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this and \p y are
-    componentwise disjoint.
-
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are dimension-incompatible.
-  */
-  bool is_disjoint_from(const Partially_Reduced_Product& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if a component of \p *this
-    is discrete.
-  */
-  bool is_discrete() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if a component of \p *this
-    is bounded.
-  */
-  bool is_bounded() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  bool constrains(Variable var) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
-  /*!
-    This method is the same as bounds_from_below.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
-  /*!
-    This method is the same as bounds_from_above.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from above in \p *this, in which case the
-    supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if the supremum value can be reached in \p this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded by \p *this,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d and \p
-    maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from above in \p *this, in which case the
-    supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if the supremum value can be reached in \p this.
-
-    \param g
-    When maximization succeeds, will be assigned the point or
-    closure point where \p expr reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded by \p *this,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p g are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from below i \p *this, in which case the
-    infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if the infimum value can be reached in \p this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty and
-    \p expr is bounded from below in \p *this, in which case the
-    infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if the infimum value can be reached in \p this.
-
-    \param g
-    When minimization succeeds, will be assigned the point or closure
-    point where \p expr reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p point are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if each component of \p *this
-    contains the corresponding component of \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool contains(const Partially_Reduced_Product& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if each component of \p *this
-    strictly contains the corresponding component of \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool strictly_contains(const Partially_Reduced_Product& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //@} // Member Functions that Do Not Modify the Partially_Reduced_Product
-
-  //! \name Space Dimension Preserving Member Functions that May Modify the Partially_Reduced_Product
-  //@{
-
-  //! Adds constraint \p c to \p *this.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Use the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  //! Adds a copy of congruence \p cg to \p *this.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are
-    dimension-incompatible.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Use the congruence \p cg to refine \p *this.
-
-    \param cg
-    The congruence to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
-  //! Adds a copy of the congruences in \p cgs to \p *this.
-  /*!
-    \param cgs
-    The congruence system to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Use the congruences in \p cgs to refine \p *this.
-
-    \param  cgs
-    The congruences to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  //! Adds the congruences in \p cgs to *this.
-  /*!
-    \param cgs
-    The congruence system to be added that may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-
-    \warning
-    The only assumption that can be made about \p cgs upon successful
-    or exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_congruences(Congruence_System& cgs);
-
-  //! Adds a copy of the constraint system in \p cs to \p *this.
-  /*!
-    \param cs
-    The constraint system to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Use the constraints in \p cs to refine \p *this.
-
-    \param  cs
-     The constraints to be used for refinement.
-
-     \exception std::invalid_argument
-     Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  //! Adds the constraint system in \p cs to \p *this.
-  /*!
-    \param cs
-    The constraint system to be added that may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-
-    \warning
-    The only assumption that can be made about \p cs upon successful
-    or exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_constraints(Constraint_System& cs);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  /*! \brief
-    Assigns to \p *this the componentwise intersection of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void intersection_assign(const Partially_Reduced_Product& y);
-
-  /*! \brief
-    Assigns to \p *this an upper bound of \p *this and \p y
-    computed on the corresponding components.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void upper_bound_assign(const Partially_Reduced_Product& y);
-
-  /*! \brief
-    Assigns to \p *this an upper bound of \p *this and \p y
-    computed on the corresponding components.
-    If it is exact on each of the components of \p *this, <CODE>true</CODE>
-    is returned, otherwise <CODE>false</CODE> is returned.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool upper_bound_assign_if_exact(const Partially_Reduced_Product& y);
-
-  /*! \brief
-    Assigns to \p *this an approximation of the set-theoretic difference
-    of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void difference_assign(const Partially_Reduced_Product& y);
-
-  /*! \brief
-    Assigns to \p *this the \ref Single_Update_Affine_Functions
-    "affine image" of \p
-    *this under the function mapping variable \p var to the affine
-    expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of
-    \p *this.
-
-  */
-  void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		    = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the \ref  Single_Update_Affine_Functions
-    "affine preimage" of
-    \p *this under the function mapping variable \p var to the affine
-    expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is substituted;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this.
-  */
-  void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym
-    (see also \ref Grid_Generalized_Image "generalized affine relation".)
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				= Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-   (see also \ref Grid_Generalized_Image "generalized affine relation".)
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void
-  generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-   (see also \ref Grid_Generalized_Image "generalized affine relation".)
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-   (see also \ref Grid_Generalized_Image "generalized affine relation".)
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
-
-  /*!
-    \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
-
-  /*!
-    \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the result of computing the \ref Time_Elapse_Operator
-    "time-elapse" between \p *this and \p y.
-    (See also \ref Grid_Time_Elapse "time-elapse".)
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void time_elapse_assign(const Partially_Reduced_Product& y);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  // TODO: Add a way to call other widenings.
-
-  // CHECKME: This may not be a real widening; it depends on the reduction
-  //          class R and the widening used.
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    "widening" between \p *this and \p y.
-
-    This widening uses either the congruence or generator systems
-    depending on which of the systems describing x and y
-    are up to date and minimized.
-
-    \param y
-    A product that <EM>must</EM> be contained in \p *this;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void widening_assign(const Partially_Reduced_Product& y,
-                       unsigned* tp = NULL);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  //@} // Space Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  /*! \brief
-    Adds \p m new space dimensions and embeds the components
-    of \p *this in the new vector space.
-
-    \param m
-    The number of dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the vector
-    space to exceed dimension <CODE>max_space_dimension()</CODE>.
- */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Adds \p m new space dimensions and does not embed the components
-    in the new vector space.
-
-    \param m
-    The number of space dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  /*! \brief
-    Assigns to the first (resp., second) component of \p *this
-    the "concatenation" of the first (resp., second) components
-    of \p *this and \p y, taken in this order.
-    See also \ref Concatenating_Polyhedra.
-
-    \exception std::length_error
-    Thrown if the concatenation would cause the vector space
-    to exceed dimension <CODE>max_space_dimension()</CODE>.
-  */
-  void concatenate_assign(const Partially_Reduced_Product& y);
-
-  //! Removes all the specified dimensions from the vector space.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher dimensions of the vector space so that the
-    resulting space will have dimension \p new_dimension.
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimensions is greater than the space dimension of
-    \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
-
-    If \p pfunc maps only some of the dimensions of \p *this then the
-    rest will be projected away.
-
-    If the highest dimension mapped to by \p pfunc is higher than the
-    highest dimension in \p *this then the number of dimensions in \p
-    *this will be increased to the highest dimension mapped to by \p
-    pfunc.
-
-    \param pfunc
-    The partial function specifying the destiny of each space
-    dimension.
-
-    The template class <CODE>Partial_Function</CODE> must provide the following
-    methods.
-    \code
-      bool has_empty_codomain() const
-    \endcode
-    returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty codomain (i.e., it is always undefined).
-    The <CODE>has_empty_codomain()</CODE> method will always be called
-    before the methods below.  However, if
-    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
-    of the functions below will be called.
-    \code
-      dimension_type max_in_codomain() const
-    \endcode
-    returns the maximum value that belongs to the codomain of the
-    partial function.
-    The <CODE>max_in_codomain()</CODE> method is called at most once.
-    \code
-      bool maps(dimension_type i, dimension_type& j) const
-    \endcode
-    Let \f$f\f$ be the represented function and \f$k\f$ be the value
-    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
-    assigned to \p j and <CODE>true</CODE> is returned.  If \f$f\f$ is
-    undefined in \f$k\f$, then <CODE>false</CODE> is returned.
-    This method is called at most \f$n\f$ times, where \f$n\f$ is the
-    dimension of the vector space enclosing \p *this.
-
-    The result is undefined if \p pfunc does not encode a partial
-    function with the properties described in
-    \ref Mapping_the_Dimensions_of_the_Vector_Space
-    "specification of the mapping operator".
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector
-    space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the vector
-    space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions
-    "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.  Also
-    thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are
-    \ref Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension
-    "folded" into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-  friend bool operator==<>(const Partially_Reduced_Product<D1, D2, R>& x,
-			   const Partially_Reduced_Product<D1, D2, R>& y);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators::
-  operator<<<>(std::ostream& s, const Partially_Reduced_Product<D1, D2, R>& dp);
-
-  //! \name Miscellaneous Member Functions
-  //@{
-
-  //! Destructor.
-  ~Partially_Reduced_Product();
-
-  /*! \brief
-    Swaps \p *this with product \p y.  (\p *this and \p y can be
-    dimension-incompatible.)
-  */
-  void m_swap(Partially_Reduced_Product& y);
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If \p x and \p y are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  //@} // Miscellaneous Member Functions
-
-  //! Reduce.
-  /*
-    \return
-    <CODE>true</CODE> if and only if either of the resulting component
-    is strictly contained in the respective original.
-  */
-  bool reduce() const;
-
-protected:
-  //! The type of the first component.
-  typedef D1 Domain1;
-
-  //! The type of the second component.
-  typedef D2 Domain2;
-
-  //! The first component.
-  D1 d1;
-
-  //! The second component.
-  D2 d2;
-
-protected:
-  //! Clears the reduced flag.
-  void clear_reduced_flag() const;
-
-  //! Sets the reduced flag.
-  void set_reduced_flag() const;
-
-  //! Return <CODE>true</CODE> if and only if the reduced flag is set.
-  bool is_reduced() const;
-
-  /*! \brief
-    Flag to record whether the components are reduced with respect
-    to each other and the reduction class.
-  */
-  bool reduced;
-
-private:
-  void throw_space_dimension_overflow(const char* method,
-                                      const char* reason);
-};
-
-namespace Parma_Polyhedra_Library {
-
-/*! \brief
-  This class is temporary and will be removed when template typedefs will
-  be supported in C++.
-
-  When template typedefs will be supported in C++, what now is verbosely
-  denoted by Domain_Product<Domain1, Domain2>::Direct_Product will simply
-  be denoted by Direct_Product<Domain1, Domain2>.
-*/
-template <typename D1, typename D2>
-class Domain_Product {
-public:
-  typedef Partially_Reduced_Product<D1, D2, No_Reduction<D1, D2> >
-  Direct_Product;
-
-  typedef Partially_Reduced_Product<D1, D2, Smash_Reduction<D1, D2> >
-  Smash_Product;
-
-  typedef Partially_Reduced_Product<D1, D2, Constraints_Reduction<D1, D2> >
-  Constraints_Product;
-
-  typedef Partially_Reduced_Product<D1, D2, Congruences_Reduction<D1, D2> >
-  Congruences_Product;
-
-  typedef Partially_Reduced_Product<D1, D2, Shape_Preserving_Reduction<D1, D2> >
-  Shape_Preserving_Product;
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Partially_Reduced_Product.inlines.hh"
-#include "Partially_Reduced_Product.templates.hh"
-
-#endif // !defined(PPL_Partially_Reduced_Product_defs_hh)
diff --git a/src/Partially_Reduced_Product.inlines.hh b/src/Partially_Reduced_Product.inlines.hh
deleted file mode 100644
index 7273fec..0000000
--- a/src/Partially_Reduced_Product.inlines.hh
+++ /dev/null
@@ -1,818 +0,0 @@
-/* Partially_Reduced_Product class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Partially_Reduced_Product_inlines_hh
-#define PPL_Partially_Reduced_Product_inlines_hh 1
-
-#include "Constraint_System.defs.hh"
-#include "Congruence_System.defs.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include "Grid.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D1, typename D2, typename R>
-inline dimension_type
-Partially_Reduced_Product<D1, D2, R>::max_space_dimension() {
-  return (D1::max_space_dimension() < D2::max_space_dimension())
-    ? D1::max_space_dimension()
-    : D2::max_space_dimension();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(dimension_type num_dimensions,
-			    const Degenerate_Element kind)
-  : d1(num_dimensions <= max_space_dimension()
-       ? num_dimensions
-       : (throw_space_dimension_overflow("Partially_Reduced_Product(n, k)",
-                                         "n exceeds the maximum "
-                                         "allowed space dimension"),
-          num_dimensions),
-       kind),
-    d2(num_dimensions, kind) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Congruence_System& cgs)
-  : d1(cgs), d2(cgs) {
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(Congruence_System& cgs)
-  : d1(const_cast<const Congruence_System&>(cgs)), d2(cgs) {
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Constraint_System& cs)
-  : d1(cs), d2(cs) {
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(Constraint_System& cs)
-  : d1(const_cast<const Constraint_System&>(cs)), d2(cs) {
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const C_Polyhedron& ph,
-                            Complexity_Class complexity)
-  : d1(ph, complexity), d2(ph, complexity) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const NNC_Polyhedron& ph,
-                            Complexity_Class complexity)
-  : d1(ph, complexity), d2(ph, complexity) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Grid& gr, Complexity_Class)
-  : d1(gr), d2(gr) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-template <typename Interval>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Box<Interval>& box, Complexity_Class)
-  : d1(box), d2(box) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-template <typename U>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const BD_Shape<U>& bd, Complexity_Class)
-  : d1(bd), d2(bd) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-template <typename U>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Octagonal_Shape<U>& os, Complexity_Class)
-  : d1(os), d2(os) {
-  set_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Partially_Reduced_Product& y,
-                            Complexity_Class)
-  : d1(y.d1), d2(y.d2) {
-  reduced = y.reduced;
-}
-
-template <typename D1, typename D2, typename R>
-template <typename E1, typename E2, typename S>
-inline
-Partially_Reduced_Product<D1, D2, R>
-::Partially_Reduced_Product(const Partially_Reduced_Product<E1, E2, S>& y,
-                            Complexity_Class complexity)
-  : d1(y.space_dimension()), d2(y.space_dimension()) {
-  Partially_Reduced_Product<D1, D2, R> pg1(y.domain1(), complexity);
-  Partially_Reduced_Product<D1, D2, R> pg2(y.domain2(), complexity);
-  pg1.intersection_assign(pg2);
-  m_swap(pg1);
-  /* Even if y is reduced, the built product may not be reduced as
-     the reduction method may have changed (i.e., S != R). */
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline
-Partially_Reduced_Product<D1, D2, R>::~Partially_Reduced_Product() {
-}
-
-template <typename D1, typename D2, typename R>
-inline memory_size_type
-Partially_Reduced_Product<D1, D2, R>::external_memory_in_bytes() const {
-  return d1.external_memory_in_bytes() + d2.external_memory_in_bytes();
-}
-
-template <typename D1, typename D2, typename R>
-inline memory_size_type
-Partially_Reduced_Product<D1, D2, R>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename D1, typename D2, typename R>
-inline dimension_type
-Partially_Reduced_Product<D1, D2, R>::space_dimension() const {
-  PPL_ASSERT(d1.space_dimension() == d2.space_dimension());
-  return d1.space_dimension();
-}
-
-template <typename D1, typename D2, typename R>
-inline dimension_type
-Partially_Reduced_Product<D1, D2, R>::affine_dimension() const {
-  reduce();
-  const dimension_type d1_dim = d1.affine_dimension();
-  const dimension_type d2_dim = d2.affine_dimension();
-  return std::min(d1_dim, d2_dim);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::unconstrain(const Variable var) {
-  reduce();
-  d1.unconstrain(var);
-  d2.unconstrain(var);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::unconstrain(const Variables_Set& vars) {
-  reduce();
-  d1.unconstrain(vars);
-  d2.unconstrain(vars);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::intersection_assign(const Partially_Reduced_Product& y) {
-  d1.intersection_assign(y.d1);
-  d2.intersection_assign(y.d2);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::difference_assign(const Partially_Reduced_Product& y) {
-  reduce();
-  y.reduce();
-  d1.difference_assign(y.d1);
-  d2.difference_assign(y.d2);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::upper_bound_assign(const Partially_Reduced_Product& y) {
-  reduce();
-  y.reduce();
-  d1.upper_bound_assign(y.d1);
-  d2.upper_bound_assign(y.d2);
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>
-::upper_bound_assign_if_exact(const Partially_Reduced_Product& y) {
-  reduce();
-  y.reduce();
-  D1 d1_copy = d1;
-  bool ub_exact = d1_copy.upper_bound_assign_if_exact(y.d1);
-  if (!ub_exact)
-    return false;
-  ub_exact = d2.upper_bound_assign_if_exact(y.d2);
-  if (!ub_exact)
-    return false;
-  using std::swap;
-  swap(d1, d1_copy);
-  return true;
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::affine_image(Variable var,
-	       const Linear_Expression& expr,
-	       Coefficient_traits::const_reference denominator) {
-  d1.affine_image(var, expr, denominator);
-  d2.affine_image(var, expr, denominator);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::affine_preimage(Variable var,
-		  const Linear_Expression& expr,
-		  Coefficient_traits::const_reference denominator) {
-  d1.affine_preimage(var, expr, denominator);
-  d2.affine_preimage(var, expr, denominator);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::generalized_affine_image(Variable var,
-			   const Relation_Symbol relsym,
-			   const Linear_Expression& expr,
-			   Coefficient_traits::const_reference denominator) {
-  d1.generalized_affine_image(var, relsym, expr, denominator);
-  d2.generalized_affine_image(var, relsym, expr, denominator);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::generalized_affine_preimage(Variable var,
-			      const Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator) {
-  d1.generalized_affine_preimage(var, relsym, expr, denominator);
-  d2.generalized_affine_preimage(var, relsym, expr, denominator);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::generalized_affine_image(const Linear_Expression& lhs,
-			   const Relation_Symbol relsym,
-			   const Linear_Expression& rhs) {
-  d1.generalized_affine_image(lhs, relsym, rhs);
-  d2.generalized_affine_image(lhs, relsym, rhs);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::generalized_affine_preimage(const Linear_Expression& lhs,
-                              const Relation_Symbol relsym,
-                              const Linear_Expression& rhs) {
-  d1.generalized_affine_preimage(lhs, relsym, rhs);
-  d2.generalized_affine_preimage(lhs, relsym, rhs);
-  clear_reduced_flag();
-}
-
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::bounded_affine_image(Variable var,
-                       const Linear_Expression& lb_expr,
-                       const Linear_Expression& ub_expr,
-                       Coefficient_traits::const_reference denominator) {
-  d1.bounded_affine_image(var, lb_expr, ub_expr, denominator);
-  d2.bounded_affine_image(var, lb_expr, ub_expr, denominator);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::bounded_affine_preimage(Variable var,
-                          const Linear_Expression& lb_expr,
-                          const Linear_Expression& ub_expr,
-                          Coefficient_traits::const_reference denominator) {
-  d1.bounded_affine_preimage(var, lb_expr, ub_expr, denominator);
-  d2.bounded_affine_preimage(var, lb_expr, ub_expr, denominator);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::time_elapse_assign(const Partially_Reduced_Product& y) {
-  reduce();
-  y.reduce();
-  d1.time_elapse_assign(y.d1);
-  d2.time_elapse_assign(y.d2);
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::topological_closure_assign() {
-  d1.topological_closure_assign();
-  d2.topological_closure_assign();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::m_swap(Partially_Reduced_Product& y) {
-  using std::swap;
-  swap(d1, y.d1);
-  swap(d2, y.d2);
-  swap(reduced, y.reduced);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::add_constraint(const Constraint& c) {
-  d1.add_constraint(c);
-  d2.add_constraint(c);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::refine_with_constraint(const Constraint& c) {
-  d1.refine_with_constraint(c);
-  d2.refine_with_constraint(c);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::add_congruence(const Congruence& cg) {
-  d1.add_congruence(cg);
-  d2.add_congruence(cg);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::refine_with_congruence(const Congruence& cg) {
-  d1.refine_with_congruence(cg);
-  d2.refine_with_congruence(cg);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::add_constraints(const Constraint_System& cs) {
-  d1.add_constraints(cs);
-  d2.add_constraints(cs);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::refine_with_constraints(const Constraint_System& cs) {
-  d1.refine_with_constraints(cs);
-  d2.refine_with_constraints(cs);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::add_congruences(const Congruence_System& cgs) {
-  d1.add_congruences(cgs);
-  d2.add_congruences(cgs);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::refine_with_congruences(const Congruence_System& cgs) {
-  d1.refine_with_congruences(cgs);
-  d2.refine_with_congruences(cgs);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::drop_some_non_integer_points(Complexity_Class complexity) {
-  reduce();
-  d1.drop_some_non_integer_points(complexity);
-  d2.drop_some_non_integer_points(complexity);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity) {
-  reduce();
-  d1.drop_some_non_integer_points(vars, complexity);
-  d2.drop_some_non_integer_points(vars, complexity);
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline Partially_Reduced_Product<D1, D2, R>&
-Partially_Reduced_Product<D1, D2, R>
-::operator=(const Partially_Reduced_Product& y) {
-  d1 = y.d1;
-  d2 = y.d2;
-  reduced = y.reduced;
-  return *this;
-}
-
-template <typename D1, typename D2, typename R>
-inline const D1&
-Partially_Reduced_Product<D1, D2, R>::domain1() const {
-  reduce();
-  return d1;
-}
-
-template <typename D1, typename D2, typename R>
-inline const D2&
-Partially_Reduced_Product<D1, D2, R>::domain2() const {
-  reduce();
-  return d2;
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::is_empty() const {
-  reduce();
-  return d1.is_empty() || d2.is_empty();
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::is_universe() const {
-  return d1.is_universe() && d2.is_universe();
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::is_topologically_closed() const {
-  reduce();
-  return d1.is_topologically_closed() && d2.is_topologically_closed();
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>
-::is_disjoint_from(const Partially_Reduced_Product& y) const {
-  reduce();
-  y.reduce();
-  return d1.is_disjoint_from(y.d1) || d2.is_disjoint_from(y.d2);
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::is_discrete() const {
-  reduce();
-  return d1.is_discrete() || d2.is_discrete();
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::is_bounded() const {
-  reduce();
-  return d1.is_bounded() || d2.is_bounded();
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>
-::bounds_from_above(const Linear_Expression& expr) const {
-  reduce();
-  return d1.bounds_from_above(expr) || d2.bounds_from_above(expr);
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>
-::bounds_from_below(const Linear_Expression& expr) const {
-  reduce();
-  return d1.bounds_from_below(expr) || d2.bounds_from_below(expr);
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::constrains(Variable var) const {
-  reduce();
-  return d1.constrains(var) || d2.constrains(var);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::widening_assign(const Partially_Reduced_Product& y,
-                  unsigned* tp) {
-  // FIXME(0.10.1): In general this is _NOT_ a widening since the reduction
-  //        may mean that the sequence does not satisfy the ascending
-  //        chain condition.
-  //        However, for the direct, smash and constraints product
-  //        it may be ok - but this still needs checking.
-  reduce();
-  y.reduce();
-  d1.widening_assign(y.d1, tp);
-  d2.widening_assign(y.d2, tp);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::add_space_dimensions_and_embed(dimension_type m) {
-  d1.add_space_dimensions_and_embed(m);
-  d2.add_space_dimensions_and_embed(m);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::add_space_dimensions_and_project(dimension_type m) {
-  d1.add_space_dimensions_and_project(m);
-  d2.add_space_dimensions_and_project(m);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::concatenate_assign(const Partially_Reduced_Product& y) {
-  d1.concatenate_assign(y.d1);
-  d2.concatenate_assign(y.d2);
-  if (!is_reduced() || !y.is_reduced())
-    clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::remove_space_dimensions(const Variables_Set& vars) {
-  d1.remove_space_dimensions(vars);
-  d2.remove_space_dimensions(vars);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::remove_higher_space_dimensions(dimension_type new_dimension) {
-  d1.remove_higher_space_dimensions(new_dimension);
-  d2.remove_higher_space_dimensions(new_dimension);
-}
-
-template <typename D1, typename D2, typename R>
-template <typename Partial_Function>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::map_space_dimensions(const Partial_Function& pfunc) {
-  d1.map_space_dimensions(pfunc);
-  d2.map_space_dimensions(pfunc);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::expand_space_dimension(Variable var, dimension_type m) {
-  d1.expand_space_dimension(var, m);
-  d2.expand_space_dimension(var, m);
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>
-::fold_space_dimensions(const Variables_Set& vars,
-			Variable dest) {
-  d1.fold_space_dimensions(vars, dest);
-  d2.fold_space_dimensions(vars, dest);
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>
-::contains(const Partially_Reduced_Product& y) const {
-  reduce();
-  y.reduce();
-  return d1.contains(y.d1) && d2.contains(y.d2);
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>
-::strictly_contains(const Partially_Reduced_Product& y) const {
-  reduce();
-  y.reduce();
-  return (d1.contains(y.d1) && d2.strictly_contains(y.d2))
-    || (d2.contains(y.d2) && d1.strictly_contains(y.d1));
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::reduce() const {
-  Partially_Reduced_Product& dp
-    = const_cast<Partially_Reduced_Product&>(*this);
-  if (dp.is_reduced())
-    return false;
-  R r;
-  r.product_reduce(dp.d1, dp.d2);
-  set_reduced_flag();
-  return true;
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::is_reduced() const {
-  return reduced;
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::clear_reduced_flag() const {
-  const_cast<Partially_Reduced_Product&>(*this).reduced = false;
-}
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::set_reduced_flag() const {
-  const_cast<Partially_Reduced_Product&>(*this).reduced = true;
-}
-
-PPL_OUTPUT_3_PARAM_TEMPLATE_DEFINITIONS(D1, D2, R, Partially_Reduced_Product)
-
-template <typename D1, typename D2, typename R>
-inline void
-Partially_Reduced_Product<D1, D2, R>::ascii_dump(std::ostream& s) const {
-  const char yes = '+';
-  const char no = '-';
-  s << "Partially_Reduced_Product\n";
-  s << (reduced ? yes : no) << "reduced\n";
-  s << "Domain 1:\n";
-  d1.ascii_dump(s);
-  s << "Domain 2:\n";
-  d2.ascii_dump(s);
-}
-
-template <typename D1, typename D2, typename R>
-inline int32_t
-Partially_Reduced_Product<D1, D2, R>::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-/*! \relates Parma_Polyhedra_Library::Partially_Reduced_Product */
-template <typename D1, typename D2, typename R>
-inline bool
-operator==(const Partially_Reduced_Product<D1, D2, R>& x,
-	   const Partially_Reduced_Product<D1, D2, R>& y) {
-  x.reduce();
-  y.reduce();
-  return x.d1 == y.d1 && x.d2 == y.d2;
-}
-
-/*! \relates Parma_Polyhedra_Library::Partially_Reduced_Product */
-template <typename D1, typename D2, typename R>
-inline bool
-operator!=(const Partially_Reduced_Product<D1, D2, R>& x,
-	   const Partially_Reduced_Product<D1, D2, R>& y) {
-  return !(x == y);
-}
-
-/*! \relates Parma_Polyhedra_Library::Partially_Reduced_Product */
-template <typename D1, typename D2, typename R>
-inline std::ostream&
-IO_Operators::operator<<(std::ostream& s,
-                         const Partially_Reduced_Product<D1, D2, R>& dp) {
-  return s << "Domain 1:\n"
-	   << dp.d1
-	   << "Domain 2:\n"
-	   << dp.d2;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D1, typename D2>
-inline
-No_Reduction<D1, D2>::No_Reduction() {
-}
-
-template <typename D1, typename D2>
-void No_Reduction<D1, D2>::product_reduce(D1&, D2&) {
-}
-
-template <typename D1, typename D2>
-inline
-No_Reduction<D1, D2>::~No_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Smash_Reduction<D1, D2>::Smash_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Smash_Reduction<D1, D2>::~Smash_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Constraints_Reduction<D1, D2>::Constraints_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Constraints_Reduction<D1, D2>::~Constraints_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Congruences_Reduction<D1, D2>::Congruences_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Congruences_Reduction<D1, D2>::~Congruences_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Shape_Preserving_Reduction<D1, D2>::Shape_Preserving_Reduction() {
-}
-
-template <typename D1, typename D2>
-inline
-Shape_Preserving_Reduction<D1, D2>::~Shape_Preserving_Reduction() {
-}
-
-/*! \relates Partially_Reduced_Product */
-template <typename D1, typename D2, typename R>
-inline void
-swap(Partially_Reduced_Product<D1, D2, R>& x,
-     Partially_Reduced_Product<D1, D2, R>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Partially_Reduced_Product_inlines_hh)
diff --git a/src/Partially_Reduced_Product.templates.hh b/src/Partially_Reduced_Product.templates.hh
deleted file mode 100644
index e396649..0000000
--- a/src/Partially_Reduced_Product.templates.hh
+++ /dev/null
@@ -1,710 +0,0 @@
-/* Partially_Reduced_Product class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Partially_Reduced_Product_templates_hh
-#define PPL_Partially_Reduced_Product_templates_hh 1
-
-#include "Grid_Generator.defs.hh"
-#include "Grid_Generator_System.defs.hh"
-#include "Grid_Generator_System.inlines.hh"
-#include <algorithm>
-#include <deque>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D1, typename D2, typename R>
-void
-Partially_Reduced_Product<D1, D2, R>
-::throw_space_dimension_overflow(const char* method,
-                                 const char* reason) {
-  std::ostringstream s;
-  s << "PPL::Partially_Reduced_Product::" << method << ":" << std::endl
-    << reason << ".";
-  throw std::length_error(s.str());
-}
-
-template <typename D1, typename D2, typename R>
-Constraint_System
-Partially_Reduced_Product<D1, D2, R>::constraints() const {
-  reduce();
-  Constraint_System cs = d2.constraints();
-  const Constraint_System& cs1 = d1.constraints();
-  for (Constraint_System::const_iterator i = cs1.begin(),
-	 cs_end = cs1.end(); i != cs_end; ++i)
-    cs.insert(*i);
-  return cs;
-}
-
-template <typename D1, typename D2, typename R>
-Constraint_System
-Partially_Reduced_Product<D1, D2, R>::minimized_constraints() const {
-  reduce();
-  Constraint_System cs = d2.constraints();
-  const Constraint_System& cs1 = d1.constraints();
-  for (Constraint_System::const_iterator i = cs1.begin(),
-	 cs_end = cs1.end(); i != cs_end; ++i)
-    cs.insert(*i);
-  if (cs.has_strict_inequalities()) {
-    NNC_Polyhedron ph(cs);
-    return ph.minimized_constraints();
-  }
-  else {
-    C_Polyhedron ph(cs);
-    return ph.minimized_constraints();
-  }
-}
-
-template <typename D1, typename D2, typename R>
-Congruence_System
-Partially_Reduced_Product<D1, D2, R>::congruences() const {
-  reduce();
-  Congruence_System cgs = d2.congruences();
-  const Congruence_System& cgs1 = d1.congruences();
-  for (Congruence_System::const_iterator i = cgs1.begin(),
-	 cgs_end = cgs1.end(); i != cgs_end; ++i)
-    cgs.insert(*i);
-  return cgs;
-}
-
-template <typename D1, typename D2, typename R>
-Congruence_System
-Partially_Reduced_Product<D1, D2, R>::minimized_congruences() const {
-  reduce();
-  Congruence_System cgs = d2.congruences();
-  const Congruence_System& cgs1 = d1.congruences();
-  for (Congruence_System::const_iterator i = cgs1.begin(),
-	 cgs_end = cgs1.end(); i != cgs_end; ++i)
-    cgs.insert(*i);
-  Grid gr(cgs);
-  return gr.minimized_congruences();
-}
-
-template <typename D1, typename D2, typename R>
-void
-Partially_Reduced_Product<D1, D2, R>
-::add_recycled_constraints(Constraint_System& cs) {
-  if (d1.can_recycle_constraint_systems()) {
-    d2.refine_with_constraints(cs);
-    d1.add_recycled_constraints(cs);
-  }
-  else
-    if (d2.can_recycle_constraint_systems()) {
-      d1.refine_with_constraints(cs);
-      d2.add_recycled_constraints(cs);
-    }
-    else {
-      d1.add_constraints(cs);
-      d2.add_constraints(cs);
-    }
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-void
-Partially_Reduced_Product<D1, D2, R>
-::add_recycled_congruences(Congruence_System& cgs) {
-  if (d1.can_recycle_congruence_systems()) {
-    d2.refine_with_congruences(cgs);
-    d1.add_recycled_congruences(cgs);
-  }
-  else
-    if (d2.can_recycle_congruence_systems()) {
-      d1.refine_with_congruences(cgs);
-      d2.add_recycled_congruences(cgs);
-    }
-    else {
-      d1.add_congruences(cgs);
-      d2.add_congruences(cgs);
-    }
-  clear_reduced_flag();
-}
-
-template <typename D1, typename D2, typename R>
-Poly_Gen_Relation
-Partially_Reduced_Product<D1, D2, R>
-::relation_with(const Generator& g) const {
-  reduce();
-  if (Poly_Gen_Relation::nothing() == d1.relation_with(g)
-      || Poly_Gen_Relation::nothing() == d2.relation_with(g))
-    return Poly_Gen_Relation::nothing();
-  else
-    return Poly_Gen_Relation::subsumes();
-}
-
-template <typename D1, typename D2, typename R>
-Poly_Con_Relation
-Partially_Reduced_Product<D1, D2, R>
-::relation_with(const Constraint& c) const {
-  reduce();
-  Poly_Con_Relation relation1 = d1.relation_with(c);
-  Poly_Con_Relation relation2 = d2.relation_with(c);
-
-  Poly_Con_Relation result = Poly_Con_Relation::nothing();
-
-  if (relation1.implies(Poly_Con_Relation::is_included()))
-    result = result && Poly_Con_Relation::is_included();
-  else if (relation2.implies(Poly_Con_Relation::is_included()))
-    result = result && Poly_Con_Relation::is_included();
-  if (relation1.implies(Poly_Con_Relation::saturates()))
-    result = result && Poly_Con_Relation::saturates();
-  else if (relation2.implies(Poly_Con_Relation::saturates()))
-    result = result && Poly_Con_Relation::saturates();
-  if (relation1.implies(Poly_Con_Relation::is_disjoint()))
-    result = result && Poly_Con_Relation::is_disjoint();
-  else if (relation2.implies(Poly_Con_Relation::is_disjoint()))
-    result = result && Poly_Con_Relation::is_disjoint();
-
-  return result;
-}
-
-template <typename D1, typename D2, typename R>
-Poly_Con_Relation
-Partially_Reduced_Product<D1, D2, R>
-::relation_with(const Congruence& cg) const {
-  reduce();
-  Poly_Con_Relation relation1 = d1.relation_with(cg);
-  Poly_Con_Relation relation2 = d2.relation_with(cg);
-
-  Poly_Con_Relation result = Poly_Con_Relation::nothing();
-
-  if (relation1.implies(Poly_Con_Relation::is_included()))
-    result = result && Poly_Con_Relation::is_included();
-  else if (relation2.implies(Poly_Con_Relation::is_included()))
-    result = result && Poly_Con_Relation::is_included();
-  if (relation1.implies(Poly_Con_Relation::saturates()))
-    result = result && Poly_Con_Relation::saturates();
-  else if (relation2.implies(Poly_Con_Relation::saturates()))
-    result = result && Poly_Con_Relation::saturates();
-  if (relation1.implies(Poly_Con_Relation::is_disjoint()))
-    result = result && Poly_Con_Relation::is_disjoint();
-  else if (relation2.implies(Poly_Con_Relation::is_disjoint()))
-    result = result && Poly_Con_Relation::is_disjoint();
-
-  return result;
-}
-
-template <typename D1, typename D2, typename R>
-bool
-Partially_Reduced_Product<D1, D2, R>
-::maximize(const Linear_Expression& expr,
-	   Coefficient& sup_n,
-	   Coefficient& sup_d,
-	   bool& maximum) const {
-  reduce();
-
-  if (is_empty())
-    return false;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(sup1_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(sup1_d);
-  PPL_DIRTY_TEMP_COEFFICIENT(sup2_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(sup2_d);
-  bool maximum1;
-  bool maximum2;
-  bool r1 = d1.maximize(expr, sup1_n, sup1_d, maximum1);
-  bool r2 = d2.maximize(expr, sup2_n, sup2_d, maximum2);
-  // If neither is bounded from above, return false.
-  if (!r1 && !r2)
-    return false;
-  // If only d2 is bounded from above, then use the values for d2.
-  if (!r1) {
-    sup_n = sup2_n;
-    sup_d = sup2_d;
-    maximum = maximum2;
-    return true;
-  }
-  // If only d1 is bounded from above, then use the values for d1.
-  if (!r2) {
-    sup_n = sup1_n;
-    sup_d = sup1_d;
-    maximum = maximum1;
-    return true;
-  }
-  // If both d1 and d2 are bounded from above, then use the minimum values.
-  if (sup2_d * sup1_n >= sup1_d * sup2_n) {
-    sup_n = sup1_n;
-    sup_d = sup1_d;
-    maximum = maximum1;
-  }
-  else {
-    sup_n = sup2_n;
-    sup_d = sup2_d;
-    maximum = maximum2;
-  }
-  return true;
-}
-
-template <typename D1, typename D2, typename R>
-bool
-Partially_Reduced_Product<D1, D2, R>
-::minimize(const Linear_Expression& expr,
-	   Coefficient& inf_n,
-	   Coefficient& inf_d,
-	   bool& minimum) const {
-  reduce();
-
-  if (is_empty())
-    return false;
-  PPL_ASSERT(reduced);
-
-  PPL_DIRTY_TEMP_COEFFICIENT(inf1_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(inf1_d);
-  PPL_DIRTY_TEMP_COEFFICIENT(inf2_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(inf2_d);
-  bool minimum1;
-  bool minimum2;
-  bool r1 = d1.minimize(expr, inf1_n, inf1_d, minimum1);
-  bool r2 = d2.minimize(expr, inf2_n, inf2_d, minimum2);
-  // If neither is bounded from below, return false.
-  if (!r1 && !r2)
-    return false;
-  // If only d2 is bounded from below, then use the values for d2.
-  if (!r1) {
-    inf_n = inf2_n;
-    inf_d = inf2_d;
-    minimum = minimum2;
-    return true;
-  }
-  // If only d1 is bounded from below, then use the values for d1.
-  if (!r2) {
-    inf_n = inf1_n;
-    inf_d = inf1_d;
-    minimum = minimum1;
-    return true;
-  }
-  // If both d1 and d2 are bounded from below, then use the minimum values.
-  if (inf2_d * inf1_n <= inf1_d * inf2_n) {
-    inf_n = inf1_n;
-    inf_d = inf1_d;
-    minimum = minimum1;
-  }
-  else {
-    inf_n = inf2_n;
-    inf_d = inf2_d;
-    minimum = minimum2;
-  }
-  return true;
-}
-
-template <typename D1, typename D2, typename R>
-bool
-Partially_Reduced_Product<D1, D2, R>
-::maximize(const Linear_Expression& expr,
-	   Coefficient& sup_n,
-	   Coefficient& sup_d,
-	   bool& maximum,
-	   Generator& g) const {
-  reduce();
-
-  if (is_empty())
-    return false;
-  PPL_ASSERT(reduced);
-
-  PPL_DIRTY_TEMP_COEFFICIENT(sup1_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(sup1_d);
-  PPL_DIRTY_TEMP_COEFFICIENT(sup2_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(sup2_d);
-  bool maximum1;
-  bool maximum2;
-  Generator g1(point());
-  Generator g2(point());
-  bool r1 = d1.maximize(expr, sup1_n, sup1_d, maximum1, g1);
-  bool r2 = d2.maximize(expr, sup2_n, sup2_d, maximum2, g2);
-  // If neither is bounded from above, return false.
-  if (!r1 && !r2)
-    return false;
-  // If only d2 is bounded from above, then use the values for d2.
-  if (!r1) {
-    sup_n = sup2_n;
-    sup_d = sup2_d;
-    maximum = maximum2;
-    g = g2;
-    return true;
-  }
-  // If only d1 is bounded from above, then use the values for d1.
-  if (!r2) {
-    sup_n = sup1_n;
-    sup_d = sup1_d;
-    maximum = maximum1;
-    g = g1;
-    return true;
-  }
-  // If both d1 and d2 are bounded from above, then use the minimum values.
-  if (sup2_d * sup1_n >= sup1_d * sup2_n) {
-    sup_n = sup1_n;
-    sup_d = sup1_d;
-    maximum = maximum1;
-    g = g1;
-  }
-  else {
-    sup_n = sup2_n;
-    sup_d = sup2_d;
-    maximum = maximum2;
-    g = g2;
-  }
-  return true;
-}
-
-template <typename D1, typename D2, typename R>
-bool
-Partially_Reduced_Product<D1, D2, R>
-::minimize(const Linear_Expression& expr,
-	   Coefficient& inf_n,
-	   Coefficient& inf_d,
-	   bool& minimum,
-	   Generator& g) const {
-  reduce();
-
-  if (is_empty())
-    return false;
-  PPL_ASSERT(reduced);
-
-  PPL_DIRTY_TEMP_COEFFICIENT(inf1_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(inf1_d);
-  PPL_DIRTY_TEMP_COEFFICIENT(inf2_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(inf2_d);
-  bool minimum1;
-  bool minimum2;
-  Generator g1(point());
-  Generator g2(point());
-  bool r1 = d1.minimize(expr, inf1_n, inf1_d, minimum1, g1);
-  bool r2 = d2.minimize(expr, inf2_n, inf2_d, minimum2, g2);
-  // If neither is bounded from below, return false.
-  if (!r1 && !r2)
-    return false;
-  // If only d2 is bounded from below, then use the values for d2.
-  if (!r1) {
-    inf_n = inf2_n;
-    inf_d = inf2_d;
-    minimum = minimum2;
-    g = g2;
-    return true;
-  }
-  // If only d1 is bounded from below, then use the values for d1.
-  if (!r2) {
-    inf_n = inf1_n;
-    inf_d = inf1_d;
-    minimum = minimum1;
-    g = g1;
-    return true;
-  }
-  // If both d1 and d2 are bounded from below, then use the minimum values.
-  if (inf2_d * inf1_n <= inf1_d * inf2_n) {
-    inf_n = inf1_n;
-    inf_d = inf1_d;
-    minimum = minimum1;
-    g = g1;
-  }
-  else {
-    inf_n = inf2_n;
-    inf_d = inf2_d;
-    minimum = minimum2;
-    g = g2;
-  }
-  return true;
-}
-
-template <typename D1, typename D2, typename R>
-inline bool
-Partially_Reduced_Product<D1, D2, R>::OK() const {
-  if (reduced) {
-    Partially_Reduced_Product<D1, D2, R> dp1 = *this;
-    Partially_Reduced_Product<D1, D2, R> dp2 = *this;
-    /* Force dp1 reduction */
-    dp1.clear_reduced_flag();
-    dp1.reduce();
-    if (dp1 != dp2)
-      return false;
-  }
-  return d1.OK() && d2.OK();
-}
-
-template <typename D1, typename D2, typename R>
-bool
-Partially_Reduced_Product<D1, D2, R>::ascii_load(std::istream& s) {
-  const char yes = '+';
-  const char no = '-';
-  std::string str;
-  if (!(s >> str) || str != "Partially_Reduced_Product")
-    return false;
-  if (!(s >> str)
-      || (str[0] != yes && str[0] != no)
-      || str.substr(1) != "reduced")
-    return false;
-  reduced = (str[0] == yes);
-  if (!(s >> str) || str != "Domain")
-    return false;
-  if (!(s >> str) || str != "1:")
-    return false;
-  if (!d1.ascii_load(s))
-    return false;
-  if (!(s >> str) || str != "Domain")
-    return false;
-  if (!(s >> str) || str != "2:")
-    return false;
-  return d2.ascii_load(s);
-}
-
-template <typename D1, typename D2>
-void Smash_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
-  using std::swap;
-  if (d2.is_empty()) {
-    if (!d1.is_empty()) {
-      D1 new_d1(d1.space_dimension(), EMPTY);
-      swap(d1, new_d1);
-    }
-  }
-  else if (d1.is_empty()) {
-    D2 new_d2(d2.space_dimension(), EMPTY);
-    swap(d2, new_d2);
-  }
-}
-
-template <typename D1, typename D2>
-void Constraints_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
-  if (d1.is_empty() || d2.is_empty()) {
-    // If one of the components is empty, do the smash reduction and return.
-    Parma_Polyhedra_Library::Smash_Reduction<D1, D2> sr;
-    sr.product_reduce(d1, d2);
-    return;
-  }
-  else {
-    using std::swap;
-    dimension_type space_dim = d1.space_dimension();
-    d1.refine_with_constraints(d2.minimized_constraints());
-    if (d1.is_empty()) {
-      D2 new_d2(space_dim, EMPTY);
-      swap(d2, new_d2);
-      return;
-    }
-    d2.refine_with_constraints(d1.minimized_constraints());
-    if (d2.is_empty()) {
-      D1 new_d1(space_dim, EMPTY);
-      swap(d1, new_d1);
-    }
-  }
-}
-
-/* Auxiliary procedure for the Congruences_Reduction() method.
-   If more than one hyperplane defined by congruence cg intersect
-   d2, then d1 and d2 are unchanged; if exactly one intersects d2, then
-   the corresponding equality is added to d1 and d2;
-   otherwise d1 and d2 are set empty. */
-template <typename D1, typename D2>
-bool shrink_to_congruence_no_check(D1& d1, D2& d2, const Congruence& cg) {
-  // It is assumed that cg is a proper congruence.
-  PPL_ASSERT(cg.modulus() != 0);
-  // It is assumed that cg is satisfied by all points in d1.
-  PPL_ASSERT(d1.relation_with(cg) == Poly_Con_Relation::is_included());
-
-  Linear_Expression e(cg);
-
-  // Find the maximum and minimum bounds for the domain element d with the
-  // linear expression e.
-  PPL_DIRTY_TEMP_COEFFICIENT(max_numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(max_denom);
-  bool max_included;
-  PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
-  PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
-  if (d2.maximize(e, max_numer, max_denom, max_included)) {
-    bool min_included;
-    if (d2.minimize(e, min_numer, min_denom, min_included)) {
-      // Adjust values to allow for the denominators max_denom and min_denom.
-      max_numer *= min_denom;
-      min_numer *= max_denom;
-      PPL_DIRTY_TEMP_COEFFICIENT(denom);
-      PPL_DIRTY_TEMP_COEFFICIENT(mod);
-      denom = max_denom * min_denom;
-      mod = cg.modulus() * denom;
-      // If the difference between the maximum and minimum bounds is more than
-      // twice the modulus, then there will be two neighboring hyperplanes
-      // defined by cg that are intersected by the domain element d;
-      // there is no possible reduction in this case.
-      PPL_DIRTY_TEMP_COEFFICIENT(mod2);
-      mod2 = 2 * mod;
-      if (max_numer - min_numer < mod2
-          || (max_numer - min_numer == mod2 && (!max_included || !min_included)))
-        {
-          PPL_DIRTY_TEMP_COEFFICIENT(shrink_amount);
-          PPL_DIRTY_TEMP_COEFFICIENT(max_decreased);
-          PPL_DIRTY_TEMP_COEFFICIENT(min_increased);
-          // Find the amount by which the maximum value may be decreased.
-          shrink_amount = max_numer % mod;
-          if (!max_included && shrink_amount == 0)
-            shrink_amount = mod;
-          if (shrink_amount < 0)
-            shrink_amount += mod;
-          max_decreased = max_numer - shrink_amount;
-          // Find the amount by which the minimum value may be increased.
-          shrink_amount = min_numer % mod;
-          if (!min_included && shrink_amount == 0)
-            shrink_amount = - mod;
-          if (shrink_amount > 0)
-            shrink_amount -= mod;
-          min_increased = min_numer - shrink_amount;
-          if (max_decreased == min_increased) {
-            // The domain element d2 intersects exactly one hyperplane
-            // defined by cg, so add the equality to d1 and d2.
-            Constraint new_c(denom * e == min_increased);
-            d1.refine_with_constraint(new_c);
-            d2.refine_with_constraint(new_c);
-            return true;
-          }
-          else {
-            if (max_decreased < min_increased) {
-              using std::swap;
-              // In this case, d intersects no hyperplanes defined by cg,
-              // so set d to empty and return false.
-              D1 new_d1(d1.space_dimension(), EMPTY);
-              swap(d1, new_d1);
-              D2 new_d2(d2.space_dimension(), EMPTY);
-              swap(d2, new_d2);
-              return false;
-            }
-          }
-        }
-    }
-  }
-  return true;
-}
-
-template <typename D1, typename D2>
-void
-  Congruences_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
-  if (d1.is_empty() || d2.is_empty()) {
-    // If one of the components is empty, do the smash reduction and return.
-    Parma_Polyhedra_Library::Smash_Reduction<D1, D2> sr;
-    sr.product_reduce(d1, d2);
-    return;
-  }
-  // Use the congruences representing d1 to shrink both components.
-  const Congruence_System cgs1 = d1.minimized_congruences();
-  for (Congruence_System::const_iterator i = cgs1.begin(),
-         cgs_end = cgs1.end(); i != cgs_end; ++i) {
-    const Congruence& cg1 = *i;
-    if (cg1.is_equality())
-      d2.refine_with_congruence(cg1);
-    else
-      if (!Parma_Polyhedra_Library::
-          shrink_to_congruence_no_check(d1, d2, cg1))
-        // The product is empty.
-        return;
-  }
-  // Use the congruences representing d2 to shrink both components.
-  const Congruence_System cgs2 = d2.minimized_congruences();
-  for (Congruence_System::const_iterator i = cgs2.begin(),
-         cgs_end = cgs2.end(); i != cgs_end; ++i) {
-    const Congruence& cg2 = *i;
-    if (cg2.is_equality())
-      d1.refine_with_congruence(cg2);
-    else
-      if (!Parma_Polyhedra_Library::
-          shrink_to_congruence_no_check(d2, d1, cg2))
-        // The product is empty.
-        return;
-  }
-}
-
-template <typename D1, typename D2>
-void
-  Shape_Preserving_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
-    // First do the congruences reduction.
-    Parma_Polyhedra_Library::Congruences_Reduction<D1, D2> cgr;
-    cgr.product_reduce(d1, d2);
-    if (d1.is_empty())
-      return;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(freq_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(freq_d);
-  PPL_DIRTY_TEMP_COEFFICIENT(val_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(val_d);
-
-  // Use the constraints representing d2.
-  Constraint_System cs = d2.minimized_constraints();
-  Constraint_System refining_cs;
-  for (Constraint_System::const_iterator i = cs.begin(),
-         cs_end = cs.end(); i != cs_end; ++i) {
-    const Constraint& c = *i;
-    if (c.is_equality())
-      continue;
-    // Check the frequency and value of the linear expression for
-    // the constraint `c'.
-    Linear_Expression le(c);
-    if (!d1.frequency(le, freq_n, freq_d, val_n, val_d))
-      // Nothing to do.
-      continue;
-    if (val_n == 0)
-      // Nothing to do.
-      continue;
-    // Adjust the value of the inhomogeneous term to satisfy
-    // the implied congruence.
-    if (val_n < 0) {
-      val_n = val_n*freq_d + val_d*freq_n;
-      val_d *= freq_d;
-    }
-    le *= val_d;
-    le -= val_n;
-    refining_cs.insert(le >= 0);
-  }
-  d2.refine_with_constraints(refining_cs);
-
-  // Use the constraints representing d1.
-  cs = d1.minimized_constraints();
-  refining_cs.clear();
-  for (Constraint_System::const_iterator i = cs.begin(),
-         cs_end = cs.end(); i != cs_end; ++i) {
-    const Constraint& c = *i;
-    if (c.is_equality())
-      // Equalities already shared.
-      continue;
-    // Check the frequency and value of the linear expression for
-    // the constraint `c'.
-    Linear_Expression le(c);
-    if (!d2.frequency(le, freq_n, freq_d, val_n, val_d))
-      // Nothing to do.
-      continue;
-    if (val_n == 0)
-      // Nothing to do.
-      continue;
-    // Adjust the value of the inhomogeneous term to satisfy
-    // the implied congruence.
-    if (val_n < 0) {
-      val_n = val_n*freq_d + val_d*freq_n;
-      val_d *= freq_d;
-    }
-    le *= val_d;
-    le -= val_n;
-    refining_cs.insert(le >= 0);
-  }
-  d1.refine_with_constraints(refining_cs);
-
-  // The reduction may have introduced additional equalities
-  // so these must be shared with the other component.
-  Parma_Polyhedra_Library::Constraints_Reduction<D1, D2> cr;
-  cr.product_reduce(d1, d2);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Partially_Reduced_Product_templates_hh)
diff --git a/src/Partially_Reduced_Product.types.hh b/src/Partially_Reduced_Product.types.hh
deleted file mode 100644
index 72cfa5a..0000000
--- a/src/Partially_Reduced_Product.types.hh
+++ /dev/null
@@ -1,38 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Partially_Reduced_Product_types_hh
-#define PPL_Partially_Reduced_Product_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D1, typename D2>
-class Smash_Reduction;
-
-template <typename D1, typename D2>
-class Constraints_Reduction;
-
-template <typename D1, typename D2>
-class Congruences_Reduction;
-
-template <typename D1, typename D2>
-class Shape_Preserving_Reduction;
-
-template <typename D1, typename D2>
-class No_Reduction;
-
-template <typename D1, typename D2, typename R>
-class Partially_Reduced_Product;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Partially_Reduced_Product_types_hh)
diff --git a/src/Partially_Reduced_Product_defs.hh b/src/Partially_Reduced_Product_defs.hh
new file mode 100644
index 0000000..5f830bc
--- /dev/null
+++ b/src/Partially_Reduced_Product_defs.hh
@@ -0,0 +1,1689 @@
+/* Partially_Reduced_Product class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Partially_Reduced_Product_defs_hh
+#define PPL_Partially_Reduced_Product_defs_hh 1
+
+#include "Partially_Reduced_Product_types.hh"
+#include "globals_types.hh"
+#include "Coefficient_defs.hh"
+#include "Variable_types.hh"
+#include "Variables_Set_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_types.hh"
+#include "Generator_types.hh"
+#include "Congruence_types.hh"
+#include "Grid_Generator_types.hh"
+#include "Constraint_System_types.hh"
+#include "Generator_System_types.hh"
+#include "Congruence_System_types.hh"
+#include "Grid_Generator_System_types.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "C_Polyhedron_types.hh"
+#include "NNC_Polyhedron_types.hh"
+#include "Grid_types.hh"
+#include "Box_types.hh"
+#include "BD_Shape_types.hh"
+#include "Octagonal_Shape_types.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Partially_Reduced_Product
+  Writes a textual representation of \p dp on \p s.
+*/
+template <typename D1, typename D2, typename R>
+std::ostream&
+operator<<(std::ostream& s, const Partially_Reduced_Product<D1, D2, R>& dp);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Partially_Reduced_Product */
+template <typename D1, typename D2, typename R>
+void swap(Partially_Reduced_Product<D1, D2, R>& x,
+          Partially_Reduced_Product<D1, D2, R>& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if the components of \p x and \p y
+  are pairwise equal.
+
+  \relates Partially_Reduced_Product
+  Note that \p x and \p y may be dimension-incompatible: in
+  those cases, the value <CODE>false</CODE> is returned.
+*/
+template <typename D1, typename D2, typename R>
+bool operator==(const Partially_Reduced_Product<D1, D2, R>& x,
+                const Partially_Reduced_Product<D1, D2, R>& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if the components of \p x and \p y
+  are not pairwise equal.
+
+  \relates Partially_Reduced_Product
+  Note that \p x and \p y may be dimension-incompatible: in
+  those cases, the value <CODE>true</CODE> is returned.
+*/
+template <typename D1, typename D2, typename R>
+bool operator!=(const Partially_Reduced_Product<D1, D2, R>& x,
+                const Partially_Reduced_Product<D1, D2, R>& y);
+
+} // namespace Parma_Polyhedra_Library
+
+
+/*! \brief
+  This class provides the reduction method for the Smash_Product
+  domain.
+
+  \ingroup PPL_CXX_interface
+  The reduction classes are used to instantiate the Partially_Reduced_Product
+  domain. This class propagates emptiness between its components.
+*/
+template <typename D1, typename D2>
+class Parma_Polyhedra_Library::Smash_Reduction {
+public:
+  //! Default constructor.
+  Smash_Reduction();
+
+  /*! \brief
+    The smash reduction operator for propagating emptiness between the
+    domain elements \p d1 and \p d2.
+
+    If either of the the domain elements \p d1 or \p d2 is empty
+    then the other is also set empty.
+
+    \param d1
+    A pointset domain element;
+
+    \param d2
+    A pointset domain element;
+  */
+  void product_reduce(D1& d1, D2& d2);
+
+  //! Destructor.
+  ~Smash_Reduction();
+};
+
+/*! \brief
+  This class provides the reduction method for the Constraints_Product
+  domain.
+
+  \ingroup PPL_CXX_interface
+  The reduction classes are used to instantiate the Partially_Reduced_Product
+  domain. This class adds the constraints defining each of the component
+  domains to the other component.
+*/
+template <typename D1, typename D2>
+class Parma_Polyhedra_Library::Constraints_Reduction {
+public:
+  //! Default constructor.
+  Constraints_Reduction();
+
+  /*! \brief
+    The constraints reduction operator for sharing constraints between the
+    domains.
+
+    The minimized constraint system defining the domain element \p d1
+    is added to \p d2 and the minimized constraint system  defining \p d2
+    is added to \p d1.
+    In each case, the donor domain must provide a constraint system
+    in minimal form; this must define a polyhedron in which the
+    donor element is contained.
+    The recipient domain selects a subset of these constraints
+    that it can add to the recipient element.
+    For example: if the domain \p D1 is the Grid domain and \p D2
+    the NNC Polyhedron domain, then only the equality constraints are copied
+    from \p d1 to \p d2 and from \p d2 to \p d1.
+
+    \param d1
+    A pointset domain element;
+
+    \param d2
+    A pointset domain element;
+  */
+  void product_reduce(D1& d1, D2& d2);
+
+  //! Destructor.
+  ~Constraints_Reduction();
+};
+
+/*! \brief
+  This class provides the reduction method for the Congruences_Product
+  domain.
+
+  \ingroup PPL_CXX_interface
+  The reduction classes are used to instantiate the Partially_Reduced_Product
+  domain.
+
+  This class uses the minimized congruences defining each of the components.
+  For each of the congruences, it checks if the other component
+  intersects none, one or more than one hyperplane defined by the congruence
+  and adds equalities or emptiness as appropriate; in more detail:
+  Letting the components be d1 and d2, then, for each congruence cg
+  representing d1:
+  - if more than one hyperplane defined by cg intersects
+    d2, then d1 and d2 are unchanged;
+  - if exactly one hyperplane intersects d2, then d1 and d2 are
+    refined with the corresponding equality ;
+  - otherwise, d1 and d2 are set to empty.
+  Unless d1 and d2 are already empty, the process is repeated where the
+  roles of d1 and d2 are reversed.
+  If d1 or d2 is empty, then the emptiness is propagated.
+
+*/
+template <typename D1, typename D2>
+class Parma_Polyhedra_Library::Congruences_Reduction {
+public:
+  //! Default constructor.
+  Congruences_Reduction();
+
+  /*! \brief
+    The congruences reduction operator for detect emptiness or any equalities
+    implied by each of the congruences defining one of the components
+    and the bounds of the other component. It is assumed that the
+    components are already constraints reduced.
+
+    The minimized congruence system defining the domain element \p d1
+    is used to check if \p d2 intersects none, one or more than one
+    of the hyperplanes defined by the congruences: if it intersects none,
+    then product is set empty; if it intersects one, then the equality
+    defining this hyperplane is added to both components; otherwise,
+    the product is unchanged.
+    In each case, the donor domain must provide a congruence system
+    in minimal form.
+
+    \param d1
+    A pointset domain element;
+
+    \param d2
+    A pointset domain element;
+  */
+  void product_reduce(D1& d1, D2& d2);
+
+  //! Destructor.
+  ~Congruences_Reduction();
+};
+
+/*! \brief
+  This class provides the reduction method for the Shape_Preserving_Product
+  domain.
+
+  \ingroup PPL_CXX_interface
+  The reduction classes are used to instantiate the Partially_Reduced_Product
+  domain.
+
+  This reduction method includes the congruences reduction.
+  This class uses the minimized constraints defining each of the components.
+  For each of the constraints, it checks the frequency and value for the same
+  linear expression in the other component. If the constraint does not satisfy
+  the implied congruence, the inhomogeneous term is adjusted so that it does.
+  Note that, unless the congruences reduction adds equalities, the
+  shapes of the domains are unaltered.
+
+*/
+template <typename D1, typename D2>
+class Parma_Polyhedra_Library::Shape_Preserving_Reduction {
+public:
+  //! Default constructor.
+  Shape_Preserving_Reduction();
+
+  /*! \brief
+    The congruences reduction operator for detect emptiness or any equalities
+    implied by each of the congruences defining one of the components
+    and the bounds of the other component. It is assumed that the
+    components are already constraints reduced.
+
+    The minimized congruence system defining the domain element \p d1
+    is used to check if \p d2 intersects none, one or more than one
+    of the hyperplanes defined by the congruences: if it intersects none,
+    then product is set empty; if it intersects one, then the equality
+    defining this hyperplane is added to both components; otherwise,
+    the product is unchanged.
+    In each case, the donor domain must provide a congruence system
+    in minimal form.
+
+    \param d1
+    A pointset domain element;
+
+    \param d2
+    A pointset domain element;
+  */
+  void product_reduce(D1& d1, D2& d2);
+
+  //! Destructor.
+  ~Shape_Preserving_Reduction();
+};
+
+/*! \brief
+  This class provides the reduction method for the Direct_Product domain.
+
+  \ingroup PPL_CXX_interface
+  The reduction classes are used to instantiate the Partially_Reduced_Product
+  domain template parameter \p R. This class does no reduction at all.
+*/
+template <typename D1, typename D2>
+class Parma_Polyhedra_Library::No_Reduction {
+public:
+  //! Default constructor.
+  No_Reduction();
+
+  /*! \brief
+    The null reduction operator.
+
+    The parameters \p d1 and \p d2 are ignored.
+  */
+  void product_reduce(D1& d1, D2& d2);
+
+  //! Destructor.
+  ~No_Reduction();
+};
+
+//! The partially reduced product of two abstractions.
+/*! \ingroup PPL_CXX_interface
+
+  \warning
+  At present, the supported instantiations for the
+  two domain templates \p D1 and \p D2 are the simple pointset domains:
+  <CODE>C_Polyhedron</CODE>,
+  <CODE>NNC_Polyhedron</CODE>,
+  <CODE>Grid</CODE>,
+  <CODE>Octagonal_Shape\<T\></CODE>,
+  <CODE>BD_Shape\<T\></CODE>,
+  <CODE>Box\<T\></CODE>.
+
+  An object of the class <CODE>Partially_Reduced_Product\<D1, D2, R\></CODE>
+  represents the (partially reduced) product of two pointset domains \p D1
+  and \p D2 where the form of any reduction is defined by the
+  reduction class \p R.
+
+  Suppose \f$D_1\f$ and \f$D_2\f$ are two abstract domains
+  with concretization functions:
+  \f$\fund{\gamma_1}{D_1}{\Rset^n}\f$ and
+  \f$\fund{\gamma_2}{D_2}{\Rset^n}\f$, respectively.
+
+  The partially reduced product \f$D = D_1 \times D_2\f$,
+  for any reduction class \p R, has a concretization
+  \f$\fund{\gamma}{D}{\Rset^n}\f$
+  where, if \f$d = (d_1, d_2) \in D\f$
+  \f[
+    \gamma(d) = \gamma_1(d_1) \inters \gamma_2(d_2).
+  \f]
+
+  The operations are defined to be the result of applying the corresponding
+  operations on each of the components provided the product is already reduced
+  by the reduction method defined by \p R.
+  In particular, if \p R is the <CODE>No_Reduction\<D1, D2\></CODE> class,
+  then the class <CODE>Partially_Reduced_Product\<D1, D2, R\></CODE> domain
+  is the direct product as defined in \ref CC79 "[CC79]".
+
+  How the results on the components are interpreted and
+  combined depend on the specific test.
+  For example, the test for emptiness will first make sure
+  the product is reduced (using the reduction method provided by \p R
+  if it is not already known to be reduced) and then test if either component
+  is empty; thus, if \p R defines no reduction between its components and
+  \f$d = (G, P) \in (\Gset \times \Pset)\f$
+  is a direct product in one dimension where \f$G\f$ denotes the set of
+  numbers that are integral multiples of 3 while \f$P\f$ denotes the
+  set of numbers between 1 and 2, then an operation that tests for
+  emptiness should return false.
+  However, the test for the universe returns true if and only if the
+  test <CODE>is_universe()</CODE> on both components returns true.
+
+  \par
+  In all the examples it is assumed that the template \c R is the
+  <CODE>No_Reduction\<D1, D2\></CODE> class and that variables
+  \c x and \c y are defined (where they are used) as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  \endcode
+
+  \par Example 1
+  The following code builds a direct product of a Grid and NNC Polyhedron,
+  corresponding to the positive even integer
+  pairs in \f$\Rset^2\f$, given as a system of congruences:
+  \code
+  Congruence_System cgs;
+  cgs.insert((x %= 0) / 2);
+  cgs.insert((y %= 0) / 2);
+  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> >
+    dp(cgs);
+  dp.add_constraint(x >= 0);
+  dp.add_constraint(y >= 0);
+  \endcode
+
+  \par Example 2
+  The following code builds the same product
+  in \f$\Rset^2\f$:
+  \code
+  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> > dp(2);
+  dp.add_constraint(x >= 0);
+  dp.add_constraint(y >= 0);
+  dp.add_congruence((x %= 0) / 2);
+  dp.add_congruence((y %= 0) / 2);
+  \endcode
+
+  \par Example 3
+  The following code will write "dp is empty":
+  \code
+  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> > dp(1);
+  dp.add_congruence((x %= 0) / 2);
+  dp.add_congruence((x %= 1) / 2);
+  if (dp.is_empty())
+    cout << "dp is empty." << endl;
+  else
+    cout << "dp is not empty." << endl;
+  \endcode
+
+  \par Example 4
+  The following code will write "dp is not empty":
+  \code
+  Partially_Reduced_Product<Grid, NNC_Polyhedron, No_Reduction<D1, D2> > dp(1);
+  dp.add_congruence((x %= 0) / 2);
+  dp.add_constraint(x >= 1);
+  dp.add_constraint(x <= 1);
+  if (dp.is_empty())
+    cout << "dp is empty." << endl;
+  else
+    cout << "dp is not empty." << endl;
+  \endcode
+*/
+
+template <typename D1, typename D2, typename R>
+class Parma_Polyhedra_Library::Partially_Reduced_Product {
+public:
+  /*! \brief
+    Returns the maximum space dimension this product
+    can handle.
+  */
+  static dimension_type max_space_dimension();
+
+  //! Builds an object having the specified properties.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the pair;
+
+    \param kind
+    Specifies whether a universe or an empty pair has to be built.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Partially_Reduced_Product(dimension_type num_dimensions = 0,
+                                     Degenerate_Element kind = UNIVERSE);
+
+  //! Builds a pair, copying a system of congruences.
+  /*!
+    The pair inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences to be approximated by the pair.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Partially_Reduced_Product(const Congruence_System& cgs);
+
+  //! Builds a pair, recycling a system of congruences.
+  /*!
+    The pair inherits the space dimension of the congruence system.
+
+    \param cgs
+    The system of congruences to be approximates by the pair.
+    Its data-structures may be recycled to build the pair.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Partially_Reduced_Product(Congruence_System& cgs);
+
+  //! Builds a pair, copying a system of constraints.
+  /*!
+    The pair inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints to be approximated by the pair.
+
+    \exception std::length_error
+    Thrown if \p num_dimensions exceeds the maximum allowed space
+    dimension.
+  */
+  explicit Partially_Reduced_Product(const Constraint_System& cs);
+
+  //! Builds a pair, recycling a system of constraints.
+  /*!
+    The pair inherits the space dimension of the constraint system.
+
+    \param cs
+    The system of constraints to be approximated by the pair.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p cs exceeds the maximum allowed
+    space dimension.
+  */
+  explicit Partially_Reduced_Product(Constraint_System& cs);
+
+  //! Builds a product, from a C polyhedron.
+  /*!
+    Builds a product containing \p ph using algorithms whose
+    complexity does not exceed the one specified by \p complexity.
+    If \p complexity is \p ANY_COMPLEXITY, then the built product is the
+    smallest one containing \p ph.
+    The product inherits the space dimension of the polyhedron.
+
+    \param ph
+    The polyhedron to be approximated by the product.
+
+    \param complexity
+    The complexity that will not be exceeded.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p ph exceeds the maximum allowed
+    space dimension.
+  */
+  explicit
+  Partially_Reduced_Product(const C_Polyhedron& ph,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a product, from an NNC polyhedron.
+  /*!
+    Builds a product containing \p ph using algorithms whose
+    complexity does not exceed the one specified by \p complexity.
+    If \p complexity is \p ANY_COMPLEXITY, then the built product is the
+    smallest one containing \p ph.
+    The product inherits the space dimension of the polyhedron.
+
+    \param ph
+    The polyhedron to be approximated by the product.
+
+    \param complexity
+    The complexity that will not be exceeded.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p ph exceeds the maximum allowed
+    space dimension.
+  */
+  explicit
+  Partially_Reduced_Product(const NNC_Polyhedron& ph,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a product, from a grid.
+  /*!
+    Builds a product containing \p gr.
+    The product inherits the space dimension of the grid.
+
+    \param gr
+    The grid to be approximated by the product.
+
+    \param complexity
+    The complexity is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p gr exceeds the maximum allowed
+    space dimension.
+  */
+  explicit
+  Partially_Reduced_Product(const Grid& gr,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a product out of a box.
+  /*!
+    Builds a product containing \p box.
+    The product inherits the space dimension of the box.
+
+    \param box
+    The box representing the pair to be built.
+
+    \param complexity
+    The complexity is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename Interval>
+  Partially_Reduced_Product(const Box<Interval>& box,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a product out of a BD shape.
+  /*!
+    Builds a product containing \p bd.
+    The product inherits the space dimension of the BD shape.
+
+    \param bd
+    The BD shape representing the product to be built.
+
+    \param complexity
+    The complexity is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p bd exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename U>
+  Partially_Reduced_Product(const BD_Shape<U>& bd,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a product out of an octagonal shape.
+  /*!
+    Builds a product containing \p os.
+    The product inherits the space dimension of the octagonal shape.
+
+    \param os
+    The octagonal shape representing the product to be built.
+
+    \param complexity
+    The complexity is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p os exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename U>
+  Partially_Reduced_Product(const Octagonal_Shape<U>& os,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Ordinary copy constructor.
+  Partially_Reduced_Product(const Partially_Reduced_Product& y,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a conservative, upward approximation of \p y.
+  /*!
+    The complexity argument is ignored.
+  */
+  template <typename E1, typename E2, typename S>
+  explicit
+  Partially_Reduced_Product(const Partially_Reduced_Product<E1, E2, S>& y,
+                            Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator.  (\p *this and \p y can be
+    dimension-incompatible.)
+  */
+  Partially_Reduced_Product& operator=(const Partially_Reduced_Product& y);
+
+  //! \name Member Functions that Do Not Modify the Partially_Reduced_Product
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns the minimum \ref Affine_Independence_and_Affine_Dimension
+    "affine dimension"
+    (see also \ref Grid_Affine_Dimension "grid affine dimension")
+    of the components of \p *this.
+  */
+  dimension_type affine_dimension() const;
+
+  //! Returns a constant reference to the first of the pair.
+  const D1& domain1() const;
+
+  //! Returns a constant reference to the second of the pair.
+  const D2& domain2() const;
+
+  //! Returns a system of constraints which approximates \p *this.
+  Constraint_System constraints() const;
+
+  /*! \brief
+    Returns a system of constraints which approximates \p *this, in
+    reduced form.
+  */
+  Constraint_System minimized_constraints() const;
+
+  //! Returns a system of congruences which approximates \p *this.
+  Congruence_System congruences() const;
+
+  /*! \brief
+    Returns a system of congruences which approximates \p *this, in
+    reduced form.
+  */
+  Congruence_System minimized_congruences() const;
+
+  //! Returns the relations holding between \p *this and \p c.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+
+    Returns the Poly_Con_Relation \p r for \p *this:
+    suppose the first component returns \p r1 and the second \p r2,
+    then \p r implies <CODE>is_included()</CODE>
+    if and only if one or both of \p r1 and \p r2 imply
+    <CODE>is_included()</CODE>;
+    \p r implies <CODE>saturates()</CODE>
+    if and only if one or both of \p r1 and \p r2 imply
+    <CODE>saturates()</CODE>;
+    \p r implies <CODE>is_disjoint()</CODE>
+    if and only if one or both of \p r1 and \p r2 imply
+    <CODE>is_disjoint()</CODE>;
+    and \p r implies <CODE>nothing()</CODE>
+    if and only if both \p r1 and \p r2 imply
+    <CODE>strictly_intersects()</CODE>.
+  */
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  //! Returns the relations holding between \p *this and \p cg.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  //! Returns the relations holding between \p *this and \p g.
+  /*
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+
+    Returns the Poly_Gen_Relation \p r for \p *this:
+    suppose the first component returns \p r1 and the second \p r2,
+    then \p r = <CODE>subsumes()</CODE>
+    if and only if \p r1 = \p r2 = <CODE>subsumes()</CODE>;
+    and \p r = <CODE>nothing()</CODE>
+    if and only if one or both of \p r1 and \p r2 = <CODE>nothing()</CODE>;
+  */
+  Poly_Gen_Relation relation_with(const Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if either of the components
+    of \p *this are empty.
+  */
+  bool is_empty() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if both of the components
+    of \p *this are the universe.
+  */
+  bool is_universe() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if both of the components
+    of \p *this are topologically closed subsets of the vector space.
+  */
+  bool is_topologically_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this and \p y are
+    componentwise disjoint.
+
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are dimension-incompatible.
+  */
+  bool is_disjoint_from(const Partially_Reduced_Product& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if a component of \p *this
+    is discrete.
+  */
+  bool is_discrete() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if a component of \p *this
+    is bounded.
+  */
+  bool is_bounded() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  bool constrains(Variable var) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
+  /*!
+    This method is the same as bounds_from_below.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p expr is bounded in \p *this.
+  /*!
+    This method is the same as bounds_from_above.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from above in \p *this, in which case the
+    supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if the supremum value can be reached in \p this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded by \p *this,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d and \p
+    maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from above in \p *this, in which case the
+    supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if the supremum value can be reached in \p this.
+
+    \param g
+    When maximization succeeds, will be assigned the point or
+    closure point where \p expr reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded by \p *this,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p g are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from below i \p *this, in which case the
+    infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if the infimum value can be reached in \p this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty and
+    \p expr is bounded from below in \p *this, in which case the
+    infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if the infimum value can be reached in \p this.
+
+    \param g
+    When minimization succeeds, will be assigned the point or closure
+    point where \p expr reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p point are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if each component of \p *this
+    contains the corresponding component of \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool contains(const Partially_Reduced_Product& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if each component of \p *this
+    strictly contains the corresponding component of \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool strictly_contains(const Partially_Reduced_Product& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //@} // Member Functions that Do Not Modify the Partially_Reduced_Product
+
+  //! \name Space Dimension Preserving Member Functions that May Modify the Partially_Reduced_Product
+  //@{
+
+  //! Adds constraint \p c to \p *this.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Use the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  //! Adds a copy of congruence \p cg to \p *this.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are
+    dimension-incompatible.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Use the congruence \p cg to refine \p *this.
+
+    \param cg
+    The congruence to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+  //! Adds a copy of the congruences in \p cgs to \p *this.
+  /*!
+    \param cgs
+    The congruence system to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Use the congruences in \p cgs to refine \p *this.
+
+    \param  cgs
+    The congruences to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  //! Adds the congruences in \p cgs to *this.
+  /*!
+    \param cgs
+    The congruence system to be added that may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+
+    \warning
+    The only assumption that can be made about \p cgs upon successful
+    or exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_congruences(Congruence_System& cgs);
+
+  //! Adds a copy of the constraint system in \p cs to \p *this.
+  /*!
+    \param cs
+    The constraint system to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Use the constraints in \p cs to refine \p *this.
+
+    \param  cs
+     The constraints to be used for refinement.
+
+     \exception std::invalid_argument
+     Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  //! Adds the constraint system in \p cs to \p *this.
+  /*!
+    \param cs
+    The constraint system to be added that may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+
+    \warning
+    The only assumption that can be made about \p cs upon successful
+    or exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_constraints(Constraint_System& cs);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  /*! \brief
+    Assigns to \p *this the componentwise intersection of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void intersection_assign(const Partially_Reduced_Product& y);
+
+  /*! \brief
+    Assigns to \p *this an upper bound of \p *this and \p y
+    computed on the corresponding components.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void upper_bound_assign(const Partially_Reduced_Product& y);
+
+  /*! \brief
+    Assigns to \p *this an upper bound of \p *this and \p y
+    computed on the corresponding components.
+    If it is exact on each of the components of \p *this, <CODE>true</CODE>
+    is returned, otherwise <CODE>false</CODE> is returned.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool upper_bound_assign_if_exact(const Partially_Reduced_Product& y);
+
+  /*! \brief
+    Assigns to \p *this an approximation of the set-theoretic difference
+    of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void difference_assign(const Partially_Reduced_Product& y);
+
+  /*! \brief
+    Assigns to \p *this the \ref Single_Update_Affine_Functions
+    "affine image" of \p
+    *this under the function mapping variable \p var to the affine
+    expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of
+    \p *this.
+
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                    = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the \ref  Single_Update_Affine_Functions
+    "affine preimage" of
+    \p *this under the function mapping variable \p var to the affine
+    expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is substituted;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this.
+  */
+  void affine_preimage(Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym
+    (see also \ref Grid_Generalized_Image "generalized affine relation".)
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_image(Variable var,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+   (see also \ref Grid_Generalized_Image "generalized affine relation".)
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void
+  generalized_affine_preimage(Variable var,
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+   (see also \ref Grid_Generalized_Image "generalized affine relation".)
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_image(const Linear_Expression& lhs,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+   (see also \ref Grid_Generalized_Image "generalized affine relation".)
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_preimage(const Linear_Expression& lhs,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
+
+  /*!
+    \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+  /*!
+    \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the result of computing the \ref Time_Elapse_Operator
+    "time-elapse" between \p *this and \p y.
+    (See also \ref Grid_Time_Elapse "time-elapse".)
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void time_elapse_assign(const Partially_Reduced_Product& y);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  // TODO: Add a way to call other widenings.
+
+  // CHECKME: This may not be a real widening; it depends on the reduction
+  //          class R and the widening used.
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    "widening" between \p *this and \p y.
+
+    This widening uses either the congruence or generator systems
+    depending on which of the systems describing x and y
+    are up to date and minimized.
+
+    \param y
+    A product that <EM>must</EM> be contained in \p *this;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void widening_assign(const Partially_Reduced_Product& y,
+                       unsigned* tp = NULL);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  //@} // Space Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  /*! \brief
+    Adds \p m new space dimensions and embeds the components
+    of \p *this in the new vector space.
+
+    \param m
+    The number of dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the vector
+    space to exceed dimension <CODE>max_space_dimension()</CODE>.
+ */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Adds \p m new space dimensions and does not embed the components
+    in the new vector space.
+
+    \param m
+    The number of space dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  /*! \brief
+    Assigns to the first (resp., second) component of \p *this
+    the "concatenation" of the first (resp., second) components
+    of \p *this and \p y, taken in this order.
+    See also \ref Concatenating_Polyhedra.
+
+    \exception std::length_error
+    Thrown if the concatenation would cause the vector space
+    to exceed dimension <CODE>max_space_dimension()</CODE>.
+  */
+  void concatenate_assign(const Partially_Reduced_Product& y);
+
+  //! Removes all the specified dimensions from the vector space.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher dimensions of the vector space so that the
+    resulting space will have dimension \p new_dimension.
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimensions is greater than the space dimension of
+    \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
+
+    If \p pfunc maps only some of the dimensions of \p *this then the
+    rest will be projected away.
+
+    If the highest dimension mapped to by \p pfunc is higher than the
+    highest dimension in \p *this then the number of dimensions in \p
+    *this will be increased to the highest dimension mapped to by \p
+    pfunc.
+
+    \param pfunc
+    The partial function specifying the destiny of each space
+    dimension.
+
+    The template class <CODE>Partial_Function</CODE> must provide the following
+    methods.
+    \code
+      bool has_empty_codomain() const
+    \endcode
+    returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty codomain (i.e., it is always undefined).
+    The <CODE>has_empty_codomain()</CODE> method will always be called
+    before the methods below.  However, if
+    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
+    of the functions below will be called.
+    \code
+      dimension_type max_in_codomain() const
+    \endcode
+    returns the maximum value that belongs to the codomain of the
+    partial function.
+    The <CODE>max_in_codomain()</CODE> method is called at most once.
+    \code
+      bool maps(dimension_type i, dimension_type& j) const
+    \endcode
+    Let \f$f\f$ be the represented function and \f$k\f$ be the value
+    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
+    assigned to \p j and <CODE>true</CODE> is returned.  If \f$f\f$ is
+    undefined in \f$k\f$, then <CODE>false</CODE> is returned.
+    This method is called at most \f$n\f$ times, where \f$n\f$ is the
+    dimension of the vector space enclosing \p *this.
+
+    The result is undefined if \p pfunc does not encode a partial
+    function with the properties described in
+    \ref Mapping_the_Dimensions_of_the_Vector_Space
+    "specification of the mapping operator".
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector
+    space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the vector
+    space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions
+    "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.  Also
+    thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are
+    \ref Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension
+    "folded" into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+  friend bool operator==<>(const Partially_Reduced_Product<D1, D2, R>& x,
+                           const Partially_Reduced_Product<D1, D2, R>& y);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators::
+  operator<<<>(std::ostream& s, const Partially_Reduced_Product<D1, D2, R>& dp);
+
+  //! \name Miscellaneous Member Functions
+  //@{
+
+  //! Destructor.
+  ~Partially_Reduced_Product();
+
+  /*! \brief
+    Swaps \p *this with product \p y.  (\p *this and \p y can be
+    dimension-incompatible.)
+  */
+  void m_swap(Partially_Reduced_Product& y);
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If \p x and \p y are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  //@} // Miscellaneous Member Functions
+
+  //! Reduce.
+  /*
+    \return
+    <CODE>true</CODE> if and only if either of the resulting component
+    is strictly contained in the respective original.
+  */
+  bool reduce() const;
+
+protected:
+  //! The type of the first component.
+  typedef D1 Domain1;
+
+  //! The type of the second component.
+  typedef D2 Domain2;
+
+  //! The first component.
+  D1 d1;
+
+  //! The second component.
+  D2 d2;
+
+protected:
+  //! Clears the reduced flag.
+  void clear_reduced_flag() const;
+
+  //! Sets the reduced flag.
+  void set_reduced_flag() const;
+
+  //! Return <CODE>true</CODE> if and only if the reduced flag is set.
+  bool is_reduced() const;
+
+  /*! \brief
+    Flag to record whether the components are reduced with respect
+    to each other and the reduction class.
+  */
+  bool reduced;
+
+private:
+  void throw_space_dimension_overflow(const char* method,
+                                      const char* reason);
+};
+
+namespace Parma_Polyhedra_Library {
+
+/*! \brief
+  This class is temporary and will be removed when template typedefs will
+  be supported in C++.
+
+  When template typedefs will be supported in C++, what now is verbosely
+  denoted by <CODE>Domain_Product\<Domain1, Domain2\>::%Direct_Product</CODE>
+  will simply be denoted by <CODE>Direct_Product\<Domain1, Domain2\></CODE>.
+*/
+template <typename D1, typename D2>
+class Domain_Product {
+public:
+  typedef Partially_Reduced_Product<D1, D2, No_Reduction<D1, D2> >
+  Direct_Product;
+
+  typedef Partially_Reduced_Product<D1, D2, Smash_Reduction<D1, D2> >
+  Smash_Product;
+
+  typedef Partially_Reduced_Product<D1, D2, Constraints_Reduction<D1, D2> >
+  Constraints_Product;
+
+  typedef Partially_Reduced_Product<D1, D2, Congruences_Reduction<D1, D2> >
+  Congruences_Product;
+
+  typedef Partially_Reduced_Product<D1, D2, Shape_Preserving_Reduction<D1, D2> >
+  Shape_Preserving_Product;
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Partially_Reduced_Product_inlines.hh"
+#include "Partially_Reduced_Product_templates.hh"
+
+#endif // !defined(PPL_Partially_Reduced_Product_defs_hh)
diff --git a/src/Partially_Reduced_Product_inlines.hh b/src/Partially_Reduced_Product_inlines.hh
new file mode 100644
index 0000000..378b5a7
--- /dev/null
+++ b/src/Partially_Reduced_Product_inlines.hh
@@ -0,0 +1,815 @@
+/* Partially_Reduced_Product class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Partially_Reduced_Product_inlines_hh
+#define PPL_Partially_Reduced_Product_inlines_hh 1
+
+#include "Constraint_System_defs.hh"
+#include "Congruence_System_defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Grid_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D1, typename D2, typename R>
+inline dimension_type
+Partially_Reduced_Product<D1, D2, R>::max_space_dimension() {
+  return (D1::max_space_dimension() < D2::max_space_dimension())
+    ? D1::max_space_dimension()
+    : D2::max_space_dimension();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(dimension_type num_dimensions,
+                            const Degenerate_Element kind)
+  : d1(num_dimensions <= max_space_dimension()
+       ? num_dimensions
+       : (throw_space_dimension_overflow("Partially_Reduced_Product(n, k)",
+                                         "n exceeds the maximum "
+                                         "allowed space dimension"),
+          num_dimensions),
+       kind),
+    d2(num_dimensions, kind) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Congruence_System& cgs)
+  : d1(cgs), d2(cgs) {
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(Congruence_System& cgs)
+  : d1(const_cast<const Congruence_System&>(cgs)), d2(cgs) {
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Constraint_System& cs)
+  : d1(cs), d2(cs) {
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(Constraint_System& cs)
+  : d1(const_cast<const Constraint_System&>(cs)), d2(cs) {
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const C_Polyhedron& ph,
+                            Complexity_Class complexity)
+  : d1(ph, complexity), d2(ph, complexity) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const NNC_Polyhedron& ph,
+                            Complexity_Class complexity)
+  : d1(ph, complexity), d2(ph, complexity) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Grid& gr, Complexity_Class)
+  : d1(gr), d2(gr) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+template <typename Interval>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Box<Interval>& box, Complexity_Class)
+  : d1(box), d2(box) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+template <typename U>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const BD_Shape<U>& bd, Complexity_Class)
+  : d1(bd), d2(bd) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+template <typename U>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Octagonal_Shape<U>& os, Complexity_Class)
+  : d1(os), d2(os) {
+  set_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Partially_Reduced_Product& y,
+                            Complexity_Class)
+  : d1(y.d1), d2(y.d2) {
+  reduced = y.reduced;
+}
+
+template <typename D1, typename D2, typename R>
+template <typename E1, typename E2, typename S>
+inline
+Partially_Reduced_Product<D1, D2, R>
+::Partially_Reduced_Product(const Partially_Reduced_Product<E1, E2, S>& y,
+                            Complexity_Class complexity)
+  : d1(y.space_dimension()), d2(y.space_dimension()), reduced(false) {
+  Partially_Reduced_Product<D1, D2, R> pg1(y.domain1(), complexity);
+  Partially_Reduced_Product<D1, D2, R> pg2(y.domain2(), complexity);
+  pg1.intersection_assign(pg2);
+  m_swap(pg1);
+}
+
+template <typename D1, typename D2, typename R>
+inline
+Partially_Reduced_Product<D1, D2, R>::~Partially_Reduced_Product() {
+}
+
+template <typename D1, typename D2, typename R>
+inline memory_size_type
+Partially_Reduced_Product<D1, D2, R>::external_memory_in_bytes() const {
+  return d1.external_memory_in_bytes() + d2.external_memory_in_bytes();
+}
+
+template <typename D1, typename D2, typename R>
+inline memory_size_type
+Partially_Reduced_Product<D1, D2, R>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename D1, typename D2, typename R>
+inline dimension_type
+Partially_Reduced_Product<D1, D2, R>::space_dimension() const {
+  PPL_ASSERT(d1.space_dimension() == d2.space_dimension());
+  return d1.space_dimension();
+}
+
+template <typename D1, typename D2, typename R>
+inline dimension_type
+Partially_Reduced_Product<D1, D2, R>::affine_dimension() const {
+  reduce();
+  const dimension_type d1_dim = d1.affine_dimension();
+  const dimension_type d2_dim = d2.affine_dimension();
+  return std::min(d1_dim, d2_dim);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::unconstrain(const Variable var) {
+  reduce();
+  d1.unconstrain(var);
+  d2.unconstrain(var);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::unconstrain(const Variables_Set& vars) {
+  reduce();
+  d1.unconstrain(vars);
+  d2.unconstrain(vars);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::intersection_assign(const Partially_Reduced_Product& y) {
+  d1.intersection_assign(y.d1);
+  d2.intersection_assign(y.d2);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::difference_assign(const Partially_Reduced_Product& y) {
+  reduce();
+  y.reduce();
+  d1.difference_assign(y.d1);
+  d2.difference_assign(y.d2);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::upper_bound_assign(const Partially_Reduced_Product& y) {
+  reduce();
+  y.reduce();
+  d1.upper_bound_assign(y.d1);
+  d2.upper_bound_assign(y.d2);
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>
+::upper_bound_assign_if_exact(const Partially_Reduced_Product& y) {
+  reduce();
+  y.reduce();
+  D1 d1_copy = d1;
+  bool ub_exact = d1_copy.upper_bound_assign_if_exact(y.d1);
+  if (!ub_exact)
+    return false;
+  ub_exact = d2.upper_bound_assign_if_exact(y.d2);
+  if (!ub_exact)
+    return false;
+  using std::swap;
+  swap(d1, d1_copy);
+  return true;
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::affine_image(Variable var,
+               const Linear_Expression& expr,
+               Coefficient_traits::const_reference denominator) {
+  d1.affine_image(var, expr, denominator);
+  d2.affine_image(var, expr, denominator);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::affine_preimage(Variable var,
+                  const Linear_Expression& expr,
+                  Coefficient_traits::const_reference denominator) {
+  d1.affine_preimage(var, expr, denominator);
+  d2.affine_preimage(var, expr, denominator);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::generalized_affine_image(Variable var,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator) {
+  d1.generalized_affine_image(var, relsym, expr, denominator);
+  d2.generalized_affine_image(var, relsym, expr, denominator);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::generalized_affine_preimage(Variable var,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator) {
+  d1.generalized_affine_preimage(var, relsym, expr, denominator);
+  d2.generalized_affine_preimage(var, relsym, expr, denominator);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::generalized_affine_image(const Linear_Expression& lhs,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& rhs) {
+  d1.generalized_affine_image(lhs, relsym, rhs);
+  d2.generalized_affine_image(lhs, relsym, rhs);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::generalized_affine_preimage(const Linear_Expression& lhs,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& rhs) {
+  d1.generalized_affine_preimage(lhs, relsym, rhs);
+  d2.generalized_affine_preimage(lhs, relsym, rhs);
+  clear_reduced_flag();
+}
+
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::bounded_affine_image(Variable var,
+                       const Linear_Expression& lb_expr,
+                       const Linear_Expression& ub_expr,
+                       Coefficient_traits::const_reference denominator) {
+  d1.bounded_affine_image(var, lb_expr, ub_expr, denominator);
+  d2.bounded_affine_image(var, lb_expr, ub_expr, denominator);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::bounded_affine_preimage(Variable var,
+                          const Linear_Expression& lb_expr,
+                          const Linear_Expression& ub_expr,
+                          Coefficient_traits::const_reference denominator) {
+  d1.bounded_affine_preimage(var, lb_expr, ub_expr, denominator);
+  d2.bounded_affine_preimage(var, lb_expr, ub_expr, denominator);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::time_elapse_assign(const Partially_Reduced_Product& y) {
+  reduce();
+  y.reduce();
+  d1.time_elapse_assign(y.d1);
+  d2.time_elapse_assign(y.d2);
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::topological_closure_assign() {
+  d1.topological_closure_assign();
+  d2.topological_closure_assign();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::m_swap(Partially_Reduced_Product& y) {
+  using std::swap;
+  swap(d1, y.d1);
+  swap(d2, y.d2);
+  swap(reduced, y.reduced);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::add_constraint(const Constraint& c) {
+  d1.add_constraint(c);
+  d2.add_constraint(c);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::refine_with_constraint(const Constraint& c) {
+  d1.refine_with_constraint(c);
+  d2.refine_with_constraint(c);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::add_congruence(const Congruence& cg) {
+  d1.add_congruence(cg);
+  d2.add_congruence(cg);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::refine_with_congruence(const Congruence& cg) {
+  d1.refine_with_congruence(cg);
+  d2.refine_with_congruence(cg);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::add_constraints(const Constraint_System& cs) {
+  d1.add_constraints(cs);
+  d2.add_constraints(cs);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::refine_with_constraints(const Constraint_System& cs) {
+  d1.refine_with_constraints(cs);
+  d2.refine_with_constraints(cs);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::add_congruences(const Congruence_System& cgs) {
+  d1.add_congruences(cgs);
+  d2.add_congruences(cgs);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::refine_with_congruences(const Congruence_System& cgs) {
+  d1.refine_with_congruences(cgs);
+  d2.refine_with_congruences(cgs);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::drop_some_non_integer_points(Complexity_Class complexity) {
+  reduce();
+  d1.drop_some_non_integer_points(complexity);
+  d2.drop_some_non_integer_points(complexity);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity) {
+  reduce();
+  d1.drop_some_non_integer_points(vars, complexity);
+  d2.drop_some_non_integer_points(vars, complexity);
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline Partially_Reduced_Product<D1, D2, R>&
+Partially_Reduced_Product<D1, D2, R>
+::operator=(const Partially_Reduced_Product& y) {
+  d1 = y.d1;
+  d2 = y.d2;
+  reduced = y.reduced;
+  return *this;
+}
+
+template <typename D1, typename D2, typename R>
+inline const D1&
+Partially_Reduced_Product<D1, D2, R>::domain1() const {
+  reduce();
+  return d1;
+}
+
+template <typename D1, typename D2, typename R>
+inline const D2&
+Partially_Reduced_Product<D1, D2, R>::domain2() const {
+  reduce();
+  return d2;
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::is_empty() const {
+  reduce();
+  return d1.is_empty() || d2.is_empty();
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::is_universe() const {
+  return d1.is_universe() && d2.is_universe();
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::is_topologically_closed() const {
+  reduce();
+  return d1.is_topologically_closed() && d2.is_topologically_closed();
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>
+::is_disjoint_from(const Partially_Reduced_Product& y) const {
+  reduce();
+  y.reduce();
+  return d1.is_disjoint_from(y.d1) || d2.is_disjoint_from(y.d2);
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::is_discrete() const {
+  reduce();
+  return d1.is_discrete() || d2.is_discrete();
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::is_bounded() const {
+  reduce();
+  return d1.is_bounded() || d2.is_bounded();
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>
+::bounds_from_above(const Linear_Expression& expr) const {
+  reduce();
+  return d1.bounds_from_above(expr) || d2.bounds_from_above(expr);
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>
+::bounds_from_below(const Linear_Expression& expr) const {
+  reduce();
+  return d1.bounds_from_below(expr) || d2.bounds_from_below(expr);
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::constrains(Variable var) const {
+  reduce();
+  return d1.constrains(var) || d2.constrains(var);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::widening_assign(const Partially_Reduced_Product& y,
+                  unsigned* tp) {
+  // FIXME(0.10.1): In general this is _NOT_ a widening since the reduction
+  //        may mean that the sequence does not satisfy the ascending
+  //        chain condition.
+  //        However, for the direct, smash and constraints product
+  //        it may be ok - but this still needs checking.
+  reduce();
+  y.reduce();
+  d1.widening_assign(y.d1, tp);
+  d2.widening_assign(y.d2, tp);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::add_space_dimensions_and_embed(dimension_type m) {
+  d1.add_space_dimensions_and_embed(m);
+  d2.add_space_dimensions_and_embed(m);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::add_space_dimensions_and_project(dimension_type m) {
+  d1.add_space_dimensions_and_project(m);
+  d2.add_space_dimensions_and_project(m);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::concatenate_assign(const Partially_Reduced_Product& y) {
+  d1.concatenate_assign(y.d1);
+  d2.concatenate_assign(y.d2);
+  if (!is_reduced() || !y.is_reduced())
+    clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::remove_space_dimensions(const Variables_Set& vars) {
+  d1.remove_space_dimensions(vars);
+  d2.remove_space_dimensions(vars);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::remove_higher_space_dimensions(dimension_type new_dimension) {
+  d1.remove_higher_space_dimensions(new_dimension);
+  d2.remove_higher_space_dimensions(new_dimension);
+}
+
+template <typename D1, typename D2, typename R>
+template <typename Partial_Function>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::map_space_dimensions(const Partial_Function& pfunc) {
+  d1.map_space_dimensions(pfunc);
+  d2.map_space_dimensions(pfunc);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::expand_space_dimension(Variable var, dimension_type m) {
+  d1.expand_space_dimension(var, m);
+  d2.expand_space_dimension(var, m);
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>
+::fold_space_dimensions(const Variables_Set& vars,
+                        Variable dest) {
+  d1.fold_space_dimensions(vars, dest);
+  d2.fold_space_dimensions(vars, dest);
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>
+::contains(const Partially_Reduced_Product& y) const {
+  reduce();
+  y.reduce();
+  return d1.contains(y.d1) && d2.contains(y.d2);
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>
+::strictly_contains(const Partially_Reduced_Product& y) const {
+  reduce();
+  y.reduce();
+  return (d1.contains(y.d1) && d2.strictly_contains(y.d2))
+    || (d2.contains(y.d2) && d1.strictly_contains(y.d1));
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::reduce() const {
+  Partially_Reduced_Product& dp
+    = const_cast<Partially_Reduced_Product&>(*this);
+  if (dp.is_reduced())
+    return false;
+  R r;
+  r.product_reduce(dp.d1, dp.d2);
+  set_reduced_flag();
+  return true;
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::is_reduced() const {
+  return reduced;
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::clear_reduced_flag() const {
+  const_cast<Partially_Reduced_Product&>(*this).reduced = false;
+}
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::set_reduced_flag() const {
+  const_cast<Partially_Reduced_Product&>(*this).reduced = true;
+}
+
+PPL_OUTPUT_3_PARAM_TEMPLATE_DEFINITIONS(D1, D2, R, Partially_Reduced_Product)
+
+template <typename D1, typename D2, typename R>
+inline void
+Partially_Reduced_Product<D1, D2, R>::ascii_dump(std::ostream& s) const {
+  const char yes = '+';
+  const char no = '-';
+  s << "Partially_Reduced_Product\n";
+  s << (reduced ? yes : no) << "reduced\n";
+  s << "Domain 1:\n";
+  d1.ascii_dump(s);
+  s << "Domain 2:\n";
+  d2.ascii_dump(s);
+}
+
+template <typename D1, typename D2, typename R>
+inline int32_t
+Partially_Reduced_Product<D1, D2, R>::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+/*! \relates Parma_Polyhedra_Library::Partially_Reduced_Product */
+template <typename D1, typename D2, typename R>
+inline bool
+operator==(const Partially_Reduced_Product<D1, D2, R>& x,
+           const Partially_Reduced_Product<D1, D2, R>& y) {
+  x.reduce();
+  y.reduce();
+  return x.d1 == y.d1 && x.d2 == y.d2;
+}
+
+/*! \relates Parma_Polyhedra_Library::Partially_Reduced_Product */
+template <typename D1, typename D2, typename R>
+inline bool
+operator!=(const Partially_Reduced_Product<D1, D2, R>& x,
+           const Partially_Reduced_Product<D1, D2, R>& y) {
+  return !(x == y);
+}
+
+/*! \relates Parma_Polyhedra_Library::Partially_Reduced_Product */
+template <typename D1, typename D2, typename R>
+inline std::ostream&
+IO_Operators::operator<<(std::ostream& s,
+                         const Partially_Reduced_Product<D1, D2, R>& dp) {
+  return s << "Domain 1:\n"
+           << dp.d1
+           << "Domain 2:\n"
+           << dp.d2;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D1, typename D2>
+inline
+No_Reduction<D1, D2>::No_Reduction() {
+}
+
+template <typename D1, typename D2>
+void No_Reduction<D1, D2>::product_reduce(D1&, D2&) {
+}
+
+template <typename D1, typename D2>
+inline
+No_Reduction<D1, D2>::~No_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Smash_Reduction<D1, D2>::Smash_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Smash_Reduction<D1, D2>::~Smash_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Constraints_Reduction<D1, D2>::Constraints_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Constraints_Reduction<D1, D2>::~Constraints_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Congruences_Reduction<D1, D2>::Congruences_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Congruences_Reduction<D1, D2>::~Congruences_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Shape_Preserving_Reduction<D1, D2>::Shape_Preserving_Reduction() {
+}
+
+template <typename D1, typename D2>
+inline
+Shape_Preserving_Reduction<D1, D2>::~Shape_Preserving_Reduction() {
+}
+
+/*! \relates Partially_Reduced_Product */
+template <typename D1, typename D2, typename R>
+inline void
+swap(Partially_Reduced_Product<D1, D2, R>& x,
+     Partially_Reduced_Product<D1, D2, R>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Partially_Reduced_Product_inlines_hh)
diff --git a/src/Partially_Reduced_Product_templates.hh b/src/Partially_Reduced_Product_templates.hh
new file mode 100644
index 0000000..791ece7
--- /dev/null
+++ b/src/Partially_Reduced_Product_templates.hh
@@ -0,0 +1,710 @@
+/* Partially_Reduced_Product class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Partially_Reduced_Product_templates_hh
+#define PPL_Partially_Reduced_Product_templates_hh 1
+
+#include "Grid_Generator_defs.hh"
+#include "Grid_Generator_System_defs.hh"
+#include "Grid_Generator_System_inlines.hh"
+#include <algorithm>
+#include <deque>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D1, typename D2, typename R>
+void
+Partially_Reduced_Product<D1, D2, R>
+::throw_space_dimension_overflow(const char* method,
+                                 const char* reason) {
+  std::ostringstream s;
+  s << "PPL::Partially_Reduced_Product::" << method << ":" << std::endl
+    << reason << ".";
+  throw std::length_error(s.str());
+}
+
+template <typename D1, typename D2, typename R>
+Constraint_System
+Partially_Reduced_Product<D1, D2, R>::constraints() const {
+  reduce();
+  Constraint_System cs = d2.constraints();
+  const Constraint_System& cs1 = d1.constraints();
+  for (Constraint_System::const_iterator i = cs1.begin(),
+         cs_end = cs1.end(); i != cs_end; ++i)
+    cs.insert(*i);
+  return cs;
+}
+
+template <typename D1, typename D2, typename R>
+Constraint_System
+Partially_Reduced_Product<D1, D2, R>::minimized_constraints() const {
+  reduce();
+  Constraint_System cs = d2.constraints();
+  const Constraint_System& cs1 = d1.constraints();
+  for (Constraint_System::const_iterator i = cs1.begin(),
+         cs_end = cs1.end(); i != cs_end; ++i)
+    cs.insert(*i);
+  if (cs.has_strict_inequalities()) {
+    NNC_Polyhedron ph(cs);
+    return ph.minimized_constraints();
+  }
+  else {
+    C_Polyhedron ph(cs);
+    return ph.minimized_constraints();
+  }
+}
+
+template <typename D1, typename D2, typename R>
+Congruence_System
+Partially_Reduced_Product<D1, D2, R>::congruences() const {
+  reduce();
+  Congruence_System cgs = d2.congruences();
+  const Congruence_System& cgs1 = d1.congruences();
+  for (Congruence_System::const_iterator i = cgs1.begin(),
+         cgs_end = cgs1.end(); i != cgs_end; ++i)
+    cgs.insert(*i);
+  return cgs;
+}
+
+template <typename D1, typename D2, typename R>
+Congruence_System
+Partially_Reduced_Product<D1, D2, R>::minimized_congruences() const {
+  reduce();
+  Congruence_System cgs = d2.congruences();
+  const Congruence_System& cgs1 = d1.congruences();
+  for (Congruence_System::const_iterator i = cgs1.begin(),
+         cgs_end = cgs1.end(); i != cgs_end; ++i)
+    cgs.insert(*i);
+  Grid gr(cgs);
+  return gr.minimized_congruences();
+}
+
+template <typename D1, typename D2, typename R>
+void
+Partially_Reduced_Product<D1, D2, R>
+::add_recycled_constraints(Constraint_System& cs) {
+  if (d1.can_recycle_constraint_systems()) {
+    d2.refine_with_constraints(cs);
+    d1.add_recycled_constraints(cs);
+  }
+  else
+    if (d2.can_recycle_constraint_systems()) {
+      d1.refine_with_constraints(cs);
+      d2.add_recycled_constraints(cs);
+    }
+    else {
+      d1.add_constraints(cs);
+      d2.add_constraints(cs);
+    }
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+void
+Partially_Reduced_Product<D1, D2, R>
+::add_recycled_congruences(Congruence_System& cgs) {
+  if (d1.can_recycle_congruence_systems()) {
+    d2.refine_with_congruences(cgs);
+    d1.add_recycled_congruences(cgs);
+  }
+  else
+    if (d2.can_recycle_congruence_systems()) {
+      d1.refine_with_congruences(cgs);
+      d2.add_recycled_congruences(cgs);
+    }
+    else {
+      d1.add_congruences(cgs);
+      d2.add_congruences(cgs);
+    }
+  clear_reduced_flag();
+}
+
+template <typename D1, typename D2, typename R>
+Poly_Gen_Relation
+Partially_Reduced_Product<D1, D2, R>
+::relation_with(const Generator& g) const {
+  reduce();
+  if (Poly_Gen_Relation::nothing() == d1.relation_with(g)
+      || Poly_Gen_Relation::nothing() == d2.relation_with(g))
+    return Poly_Gen_Relation::nothing();
+  else
+    return Poly_Gen_Relation::subsumes();
+}
+
+template <typename D1, typename D2, typename R>
+Poly_Con_Relation
+Partially_Reduced_Product<D1, D2, R>
+::relation_with(const Constraint& c) const {
+  reduce();
+  Poly_Con_Relation relation1 = d1.relation_with(c);
+  Poly_Con_Relation relation2 = d2.relation_with(c);
+
+  Poly_Con_Relation result = Poly_Con_Relation::nothing();
+
+  if (relation1.implies(Poly_Con_Relation::is_included()))
+    result = result && Poly_Con_Relation::is_included();
+  else if (relation2.implies(Poly_Con_Relation::is_included()))
+    result = result && Poly_Con_Relation::is_included();
+  if (relation1.implies(Poly_Con_Relation::saturates()))
+    result = result && Poly_Con_Relation::saturates();
+  else if (relation2.implies(Poly_Con_Relation::saturates()))
+    result = result && Poly_Con_Relation::saturates();
+  if (relation1.implies(Poly_Con_Relation::is_disjoint()))
+    result = result && Poly_Con_Relation::is_disjoint();
+  else if (relation2.implies(Poly_Con_Relation::is_disjoint()))
+    result = result && Poly_Con_Relation::is_disjoint();
+
+  return result;
+}
+
+template <typename D1, typename D2, typename R>
+Poly_Con_Relation
+Partially_Reduced_Product<D1, D2, R>
+::relation_with(const Congruence& cg) const {
+  reduce();
+  Poly_Con_Relation relation1 = d1.relation_with(cg);
+  Poly_Con_Relation relation2 = d2.relation_with(cg);
+
+  Poly_Con_Relation result = Poly_Con_Relation::nothing();
+
+  if (relation1.implies(Poly_Con_Relation::is_included()))
+    result = result && Poly_Con_Relation::is_included();
+  else if (relation2.implies(Poly_Con_Relation::is_included()))
+    result = result && Poly_Con_Relation::is_included();
+  if (relation1.implies(Poly_Con_Relation::saturates()))
+    result = result && Poly_Con_Relation::saturates();
+  else if (relation2.implies(Poly_Con_Relation::saturates()))
+    result = result && Poly_Con_Relation::saturates();
+  if (relation1.implies(Poly_Con_Relation::is_disjoint()))
+    result = result && Poly_Con_Relation::is_disjoint();
+  else if (relation2.implies(Poly_Con_Relation::is_disjoint()))
+    result = result && Poly_Con_Relation::is_disjoint();
+
+  return result;
+}
+
+template <typename D1, typename D2, typename R>
+bool
+Partially_Reduced_Product<D1, D2, R>
+::maximize(const Linear_Expression& expr,
+           Coefficient& sup_n,
+           Coefficient& sup_d,
+           bool& maximum) const {
+  reduce();
+
+  if (is_empty())
+    return false;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(sup1_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(sup1_d);
+  PPL_DIRTY_TEMP_COEFFICIENT(sup2_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(sup2_d);
+  bool maximum1;
+  bool maximum2;
+  bool r1 = d1.maximize(expr, sup1_n, sup1_d, maximum1);
+  bool r2 = d2.maximize(expr, sup2_n, sup2_d, maximum2);
+  // If neither is bounded from above, return false.
+  if (!r1 && !r2)
+    return false;
+  // If only d2 is bounded from above, then use the values for d2.
+  if (!r1) {
+    sup_n = sup2_n;
+    sup_d = sup2_d;
+    maximum = maximum2;
+    return true;
+  }
+  // If only d1 is bounded from above, then use the values for d1.
+  if (!r2) {
+    sup_n = sup1_n;
+    sup_d = sup1_d;
+    maximum = maximum1;
+    return true;
+  }
+  // If both d1 and d2 are bounded from above, then use the minimum values.
+  if (sup2_d * sup1_n >= sup1_d * sup2_n) {
+    sup_n = sup1_n;
+    sup_d = sup1_d;
+    maximum = maximum1;
+  }
+  else {
+    sup_n = sup2_n;
+    sup_d = sup2_d;
+    maximum = maximum2;
+  }
+  return true;
+}
+
+template <typename D1, typename D2, typename R>
+bool
+Partially_Reduced_Product<D1, D2, R>
+::minimize(const Linear_Expression& expr,
+           Coefficient& inf_n,
+           Coefficient& inf_d,
+           bool& minimum) const {
+  reduce();
+
+  if (is_empty())
+    return false;
+  PPL_ASSERT(reduced);
+
+  PPL_DIRTY_TEMP_COEFFICIENT(inf1_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(inf1_d);
+  PPL_DIRTY_TEMP_COEFFICIENT(inf2_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(inf2_d);
+  bool minimum1;
+  bool minimum2;
+  bool r1 = d1.minimize(expr, inf1_n, inf1_d, minimum1);
+  bool r2 = d2.minimize(expr, inf2_n, inf2_d, minimum2);
+  // If neither is bounded from below, return false.
+  if (!r1 && !r2)
+    return false;
+  // If only d2 is bounded from below, then use the values for d2.
+  if (!r1) {
+    inf_n = inf2_n;
+    inf_d = inf2_d;
+    minimum = minimum2;
+    return true;
+  }
+  // If only d1 is bounded from below, then use the values for d1.
+  if (!r2) {
+    inf_n = inf1_n;
+    inf_d = inf1_d;
+    minimum = minimum1;
+    return true;
+  }
+  // If both d1 and d2 are bounded from below, then use the minimum values.
+  if (inf2_d * inf1_n <= inf1_d * inf2_n) {
+    inf_n = inf1_n;
+    inf_d = inf1_d;
+    minimum = minimum1;
+  }
+  else {
+    inf_n = inf2_n;
+    inf_d = inf2_d;
+    minimum = minimum2;
+  }
+  return true;
+}
+
+template <typename D1, typename D2, typename R>
+bool
+Partially_Reduced_Product<D1, D2, R>
+::maximize(const Linear_Expression& expr,
+           Coefficient& sup_n,
+           Coefficient& sup_d,
+           bool& maximum,
+           Generator& g) const {
+  reduce();
+
+  if (is_empty())
+    return false;
+  PPL_ASSERT(reduced);
+
+  PPL_DIRTY_TEMP_COEFFICIENT(sup1_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(sup1_d);
+  PPL_DIRTY_TEMP_COEFFICIENT(sup2_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(sup2_d);
+  bool maximum1;
+  bool maximum2;
+  Generator g1(point());
+  Generator g2(point());
+  bool r1 = d1.maximize(expr, sup1_n, sup1_d, maximum1, g1);
+  bool r2 = d2.maximize(expr, sup2_n, sup2_d, maximum2, g2);
+  // If neither is bounded from above, return false.
+  if (!r1 && !r2)
+    return false;
+  // If only d2 is bounded from above, then use the values for d2.
+  if (!r1) {
+    sup_n = sup2_n;
+    sup_d = sup2_d;
+    maximum = maximum2;
+    g = g2;
+    return true;
+  }
+  // If only d1 is bounded from above, then use the values for d1.
+  if (!r2) {
+    sup_n = sup1_n;
+    sup_d = sup1_d;
+    maximum = maximum1;
+    g = g1;
+    return true;
+  }
+  // If both d1 and d2 are bounded from above, then use the minimum values.
+  if (sup2_d * sup1_n >= sup1_d * sup2_n) {
+    sup_n = sup1_n;
+    sup_d = sup1_d;
+    maximum = maximum1;
+    g = g1;
+  }
+  else {
+    sup_n = sup2_n;
+    sup_d = sup2_d;
+    maximum = maximum2;
+    g = g2;
+  }
+  return true;
+}
+
+template <typename D1, typename D2, typename R>
+bool
+Partially_Reduced_Product<D1, D2, R>
+::minimize(const Linear_Expression& expr,
+           Coefficient& inf_n,
+           Coefficient& inf_d,
+           bool& minimum,
+           Generator& g) const {
+  reduce();
+
+  if (is_empty())
+    return false;
+  PPL_ASSERT(reduced);
+
+  PPL_DIRTY_TEMP_COEFFICIENT(inf1_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(inf1_d);
+  PPL_DIRTY_TEMP_COEFFICIENT(inf2_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(inf2_d);
+  bool minimum1;
+  bool minimum2;
+  Generator g1(point());
+  Generator g2(point());
+  bool r1 = d1.minimize(expr, inf1_n, inf1_d, minimum1, g1);
+  bool r2 = d2.minimize(expr, inf2_n, inf2_d, minimum2, g2);
+  // If neither is bounded from below, return false.
+  if (!r1 && !r2)
+    return false;
+  // If only d2 is bounded from below, then use the values for d2.
+  if (!r1) {
+    inf_n = inf2_n;
+    inf_d = inf2_d;
+    minimum = minimum2;
+    g = g2;
+    return true;
+  }
+  // If only d1 is bounded from below, then use the values for d1.
+  if (!r2) {
+    inf_n = inf1_n;
+    inf_d = inf1_d;
+    minimum = minimum1;
+    g = g1;
+    return true;
+  }
+  // If both d1 and d2 are bounded from below, then use the minimum values.
+  if (inf2_d * inf1_n <= inf1_d * inf2_n) {
+    inf_n = inf1_n;
+    inf_d = inf1_d;
+    minimum = minimum1;
+    g = g1;
+  }
+  else {
+    inf_n = inf2_n;
+    inf_d = inf2_d;
+    minimum = minimum2;
+    g = g2;
+  }
+  return true;
+}
+
+template <typename D1, typename D2, typename R>
+inline bool
+Partially_Reduced_Product<D1, D2, R>::OK() const {
+  if (reduced) {
+    Partially_Reduced_Product<D1, D2, R> dp1 = *this;
+    Partially_Reduced_Product<D1, D2, R> dp2 = *this;
+    /* Force dp1 reduction */
+    dp1.clear_reduced_flag();
+    dp1.reduce();
+    if (dp1 != dp2)
+      return false;
+  }
+  return d1.OK() && d2.OK();
+}
+
+template <typename D1, typename D2, typename R>
+bool
+Partially_Reduced_Product<D1, D2, R>::ascii_load(std::istream& s) {
+  const char yes = '+';
+  const char no = '-';
+  std::string str;
+  if (!(s >> str) || str != "Partially_Reduced_Product")
+    return false;
+  if (!(s >> str)
+      || (str[0] != yes && str[0] != no)
+      || str.substr(1) != "reduced")
+    return false;
+  reduced = (str[0] == yes);
+  if (!(s >> str) || str != "Domain")
+    return false;
+  if (!(s >> str) || str != "1:")
+    return false;
+  if (!d1.ascii_load(s))
+    return false;
+  if (!(s >> str) || str != "Domain")
+    return false;
+  if (!(s >> str) || str != "2:")
+    return false;
+  return d2.ascii_load(s);
+}
+
+template <typename D1, typename D2>
+void Smash_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
+  using std::swap;
+  if (d2.is_empty()) {
+    if (!d1.is_empty()) {
+      D1 new_d1(d1.space_dimension(), EMPTY);
+      swap(d1, new_d1);
+    }
+  }
+  else if (d1.is_empty()) {
+    D2 new_d2(d2.space_dimension(), EMPTY);
+    swap(d2, new_d2);
+  }
+}
+
+template <typename D1, typename D2>
+void Constraints_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
+  if (d1.is_empty() || d2.is_empty()) {
+    // If one of the components is empty, do the smash reduction and return.
+    Parma_Polyhedra_Library::Smash_Reduction<D1, D2> sr;
+    sr.product_reduce(d1, d2);
+    return;
+  }
+  else {
+    using std::swap;
+    dimension_type space_dim = d1.space_dimension();
+    d1.refine_with_constraints(d2.minimized_constraints());
+    if (d1.is_empty()) {
+      D2 new_d2(space_dim, EMPTY);
+      swap(d2, new_d2);
+      return;
+    }
+    d2.refine_with_constraints(d1.minimized_constraints());
+    if (d2.is_empty()) {
+      D1 new_d1(space_dim, EMPTY);
+      swap(d1, new_d1);
+    }
+  }
+}
+
+/* Auxiliary procedure for the Congruences_Reduction() method.
+   If more than one hyperplane defined by congruence cg intersect
+   d2, then d1 and d2 are unchanged; if exactly one intersects d2, then
+   the corresponding equality is added to d1 and d2;
+   otherwise d1 and d2 are set empty. */
+template <typename D1, typename D2>
+bool shrink_to_congruence_no_check(D1& d1, D2& d2, const Congruence& cg) {
+  // It is assumed that cg is a proper congruence.
+  PPL_ASSERT(cg.modulus() != 0);
+  // It is assumed that cg is satisfied by all points in d1.
+  PPL_ASSERT(d1.relation_with(cg) == Poly_Con_Relation::is_included());
+
+  Linear_Expression e(cg.expression());
+
+  // Find the maximum and minimum bounds for the domain element d with the
+  // linear expression e.
+  PPL_DIRTY_TEMP_COEFFICIENT(max_numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(max_denom);
+  bool max_included;
+  PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
+  PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
+  if (d2.maximize(e, max_numer, max_denom, max_included)) {
+    bool min_included;
+    if (d2.minimize(e, min_numer, min_denom, min_included)) {
+      // Adjust values to allow for the denominators max_denom and min_denom.
+      max_numer *= min_denom;
+      min_numer *= max_denom;
+      PPL_DIRTY_TEMP_COEFFICIENT(denom);
+      PPL_DIRTY_TEMP_COEFFICIENT(mod);
+      denom = max_denom * min_denom;
+      mod = cg.modulus() * denom;
+      // If the difference between the maximum and minimum bounds is more than
+      // twice the modulus, then there will be two neighboring hyperplanes
+      // defined by cg that are intersected by the domain element d;
+      // there is no possible reduction in this case.
+      PPL_DIRTY_TEMP_COEFFICIENT(mod2);
+      mod2 = 2 * mod;
+      if (max_numer - min_numer < mod2
+          || (max_numer - min_numer == mod2 && (!max_included || !min_included)))
+        {
+          PPL_DIRTY_TEMP_COEFFICIENT(shrink_amount);
+          PPL_DIRTY_TEMP_COEFFICIENT(max_decreased);
+          PPL_DIRTY_TEMP_COEFFICIENT(min_increased);
+          // Find the amount by which the maximum value may be decreased.
+          shrink_amount = max_numer % mod;
+          if (!max_included && shrink_amount == 0)
+            shrink_amount = mod;
+          if (shrink_amount < 0)
+            shrink_amount += mod;
+          max_decreased = max_numer - shrink_amount;
+          // Find the amount by which the minimum value may be increased.
+          shrink_amount = min_numer % mod;
+          if (!min_included && shrink_amount == 0)
+            shrink_amount = - mod;
+          if (shrink_amount > 0)
+            shrink_amount -= mod;
+          min_increased = min_numer - shrink_amount;
+          if (max_decreased == min_increased) {
+            // The domain element d2 intersects exactly one hyperplane
+            // defined by cg, so add the equality to d1 and d2.
+            Constraint new_c(denom * e == min_increased);
+            d1.refine_with_constraint(new_c);
+            d2.refine_with_constraint(new_c);
+            return true;
+          }
+          else {
+            if (max_decreased < min_increased) {
+              using std::swap;
+              // In this case, d intersects no hyperplanes defined by cg,
+              // so set d to empty and return false.
+              D1 new_d1(d1.space_dimension(), EMPTY);
+              swap(d1, new_d1);
+              D2 new_d2(d2.space_dimension(), EMPTY);
+              swap(d2, new_d2);
+              return false;
+            }
+          }
+        }
+    }
+  }
+  return true;
+}
+
+template <typename D1, typename D2>
+void
+Congruences_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
+  if (d1.is_empty() || d2.is_empty()) {
+    // If one of the components is empty, do the smash reduction and return.
+    Parma_Polyhedra_Library::Smash_Reduction<D1, D2> sr;
+    sr.product_reduce(d1, d2);
+    return;
+  }
+  // Use the congruences representing d1 to shrink both components.
+  const Congruence_System cgs1 = d1.minimized_congruences();
+  for (Congruence_System::const_iterator i = cgs1.begin(),
+         cgs_end = cgs1.end(); i != cgs_end; ++i) {
+    const Congruence& cg1 = *i;
+    if (cg1.is_equality())
+      d2.refine_with_congruence(cg1);
+    else
+      if (!Parma_Polyhedra_Library::
+          shrink_to_congruence_no_check(d1, d2, cg1))
+        // The product is empty.
+        return;
+  }
+  // Use the congruences representing d2 to shrink both components.
+  const Congruence_System cgs2 = d2.minimized_congruences();
+  for (Congruence_System::const_iterator i = cgs2.begin(),
+         cgs_end = cgs2.end(); i != cgs_end; ++i) {
+    const Congruence& cg2 = *i;
+    if (cg2.is_equality())
+      d1.refine_with_congruence(cg2);
+    else
+      if (!Parma_Polyhedra_Library::
+          shrink_to_congruence_no_check(d2, d1, cg2))
+        // The product is empty.
+        return;
+  }
+}
+
+template <typename D1, typename D2>
+void
+Shape_Preserving_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
+  // First do the congruences reduction.
+  Parma_Polyhedra_Library::Congruences_Reduction<D1, D2> cgr;
+  cgr.product_reduce(d1, d2);
+  if (d1.is_empty())
+    return;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(freq_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(freq_d);
+  PPL_DIRTY_TEMP_COEFFICIENT(val_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(val_d);
+
+  // Use the constraints representing d2.
+  Constraint_System cs = d2.minimized_constraints();
+  Constraint_System refining_cs;
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); i != cs_end; ++i) {
+    const Constraint& c = *i;
+    if (c.is_equality())
+      continue;
+    // Check the frequency and value of the linear expression for
+    // the constraint `c'.
+    Linear_Expression le(c.expression());
+    if (!d1.frequency(le, freq_n, freq_d, val_n, val_d))
+      // Nothing to do.
+      continue;
+    if (val_n == 0)
+      // Nothing to do.
+      continue;
+    // Adjust the value of the inhomogeneous term to satisfy
+    // the implied congruence.
+    if (val_n < 0) {
+      val_n = val_n*freq_d + val_d*freq_n;
+      val_d *= freq_d;
+    }
+    le *= val_d;
+    le -= val_n;
+    refining_cs.insert(le >= 0);
+  }
+  d2.refine_with_constraints(refining_cs);
+
+  // Use the constraints representing d1.
+  cs = d1.minimized_constraints();
+  refining_cs.clear();
+  for (Constraint_System::const_iterator i = cs.begin(),
+         cs_end = cs.end(); i != cs_end; ++i) {
+    const Constraint& c = *i;
+    if (c.is_equality())
+      // Equalities already shared.
+      continue;
+    // Check the frequency and value of the linear expression for
+    // the constraint `c'.
+    Linear_Expression le(c.expression());
+    if (!d2.frequency(le, freq_n, freq_d, val_n, val_d))
+      // Nothing to do.
+      continue;
+    if (val_n == 0)
+      // Nothing to do.
+      continue;
+    // Adjust the value of the inhomogeneous term to satisfy
+    // the implied congruence.
+    if (val_n < 0) {
+      val_n = val_n*freq_d + val_d*freq_n;
+      val_d *= freq_d;
+    }
+    le *= val_d;
+    le -= val_n;
+    refining_cs.insert(le >= 0);
+  }
+  d1.refine_with_constraints(refining_cs);
+
+  // The reduction may have introduced additional equalities
+  // so these must be shared with the other component.
+  Parma_Polyhedra_Library::Constraints_Reduction<D1, D2> cr;
+  cr.product_reduce(d1, d2);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Partially_Reduced_Product_templates_hh)
diff --git a/src/Partially_Reduced_Product_types.hh b/src/Partially_Reduced_Product_types.hh
new file mode 100644
index 0000000..9db15b9
--- /dev/null
+++ b/src/Partially_Reduced_Product_types.hh
@@ -0,0 +1,38 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Partially_Reduced_Product_types_hh
+#define PPL_Partially_Reduced_Product_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D1, typename D2>
+class Smash_Reduction;
+
+template <typename D1, typename D2>
+class Constraints_Reduction;
+
+template <typename D1, typename D2>
+class Congruences_Reduction;
+
+template <typename D1, typename D2>
+class Shape_Preserving_Reduction;
+
+template <typename D1, typename D2>
+class No_Reduction;
+
+template <typename D1, typename D2, typename R>
+class Partially_Reduced_Product;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Partially_Reduced_Product_types_hh)
diff --git a/src/Pending_Element.defs.hh b/src/Pending_Element.defs.hh
deleted file mode 100644
index 9d9c0db..0000000
--- a/src/Pending_Element.defs.hh
+++ /dev/null
@@ -1,77 +0,0 @@
-/* Pending_Element class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pending_Element_defs_hh
-#define PPL_Pending_Element_defs_hh 1
-
-#include "Pending_Element.types.hh"
-#include "Doubly_Linked_Object.defs.hh"
-#include "Handler.types.hh"
-
-//! A class for pending watchdog events with embedded links.
-/*!
-  Each pending watchdog event is characterized by a deadline (a positive
-  time interval), an associated handler that will be invoked upon event
-  expiration, and a Boolean flag that indicates whether the event has already
-  expired or not.
-*/
-template <typename Threshold>
-class Parma_Polyhedra_Library::Implementation::Watchdog::Pending_Element
-  : public Doubly_Linked_Object {
-public:
-  //! Constructs an element with the given attributes.
-  Pending_Element(const Threshold& deadline,
-		  const Handler& handler,
-		  bool& expired_flag);
-
-  //! Modifies \p *this so that it has the given attributes.
-  void assign(const Threshold& deadline,
-	      const Handler& handler,
-	      bool& expired_flag);
-
-  //! Returns the deadline of the event.
-  const Threshold& deadline() const;
-
-  //! Returns the handler associated to the event.
-  const Handler& handler() const;
-
-  //! Returns a reference to the "event-expired" flag.
-  bool& expired_flag() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-private:
-  //! The deadline of the event.
-  Threshold d;
-
-  //! A pointer to the handler associated to the event.
-  const Handler* p_h;
-
-  //! A pointer to a flag saying whether the event has already expired or not.
-  bool* p_f;
-};
-
-#include "Pending_Element.inlines.hh"
-
-#endif // !defined(PPL_Pending_Element_defs_hh)
diff --git a/src/Pending_Element.inlines.hh b/src/Pending_Element.inlines.hh
deleted file mode 100644
index f80a412..0000000
--- a/src/Pending_Element.inlines.hh
+++ /dev/null
@@ -1,85 +0,0 @@
-/* Pending_Element class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pending_Element_inlines_hh
-#define PPL_Pending_Element_inlines_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename Threshold>
-inline bool
-Pending_Element<Threshold>::OK() const {
-  return true;
-}
-
-template <typename Threshold>
-inline
-Pending_Element<Threshold>::Pending_Element(const Threshold& deadline,
-					    const Handler& handler,
-					    bool& expired_flag)
-  : d(deadline), p_h(&handler), p_f(&expired_flag) {
-  assert(OK());
-}
-
-template <typename Threshold>
-inline void
-Pending_Element<Threshold>::assign(const Threshold& deadline,
-				   const Handler& handler,
-				   bool& expired_flag) {
-  d = deadline;
-  p_h = &handler;
-  p_f = &expired_flag;
-  assert(OK());
-}
-
-template <typename Threshold>
-inline const Threshold&
-Pending_Element<Threshold>::deadline() const {
-  return d;
-}
-
-template <typename Threshold>
-inline const Handler&
-Pending_Element<Threshold>::handler() const {
-  return *p_h;
-}
-
-template <typename Threshold>
-inline bool&
-Pending_Element<Threshold>::expired_flag() const {
-  return *p_f;
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pending_Element_inlines_hh)
diff --git a/src/Pending_Element.types.hh b/src/Pending_Element.types.hh
deleted file mode 100644
index cc065a3..0000000
--- a/src/Pending_Element.types.hh
+++ /dev/null
@@ -1,31 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Pending_Element_types_hh
-#define PPL_Pending_Element_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <class Threshold>
-class Pending_Element;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pending_Element_types_hh)
diff --git a/src/Pending_Element_defs.hh b/src/Pending_Element_defs.hh
new file mode 100644
index 0000000..aabe2a9
--- /dev/null
+++ b/src/Pending_Element_defs.hh
@@ -0,0 +1,77 @@
+/* Pending_Element class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pending_Element_defs_hh
+#define PPL_Pending_Element_defs_hh 1
+
+#include "Pending_Element_types.hh"
+#include "Doubly_Linked_Object_defs.hh"
+#include "Handler_types.hh"
+
+//! A class for pending watchdog events with embedded links.
+/*!
+  Each pending watchdog event is characterized by a deadline (a positive
+  time interval), an associated handler that will be invoked upon event
+  expiration, and a Boolean flag that indicates whether the event has already
+  expired or not.
+*/
+template <typename Threshold>
+class Parma_Polyhedra_Library::Implementation::Watchdog::Pending_Element
+  : public Doubly_Linked_Object {
+public:
+  //! Constructs an element with the given attributes.
+  Pending_Element(const Threshold& deadline,
+                  const Handler& handler,
+                  bool& expired_flag);
+
+  //! Modifies \p *this so that it has the given attributes.
+  void assign(const Threshold& deadline,
+              const Handler& handler,
+              bool& expired_flag);
+
+  //! Returns the deadline of the event.
+  const Threshold& deadline() const;
+
+  //! Returns the handler associated to the event.
+  const Handler& handler() const;
+
+  //! Returns a reference to the "event-expired" flag.
+  bool& expired_flag() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+private:
+  //! The deadline of the event.
+  Threshold d;
+
+  //! A pointer to the handler associated to the event.
+  const Handler* p_h;
+
+  //! A pointer to a flag saying whether the event has already expired or not.
+  bool* p_f;
+};
+
+#include "Pending_Element_inlines.hh"
+
+#endif // !defined(PPL_Pending_Element_defs_hh)
diff --git a/src/Pending_Element_inlines.hh b/src/Pending_Element_inlines.hh
new file mode 100644
index 0000000..92d646d
--- /dev/null
+++ b/src/Pending_Element_inlines.hh
@@ -0,0 +1,85 @@
+/* Pending_Element class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pending_Element_inlines_hh
+#define PPL_Pending_Element_inlines_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+template <typename Threshold>
+inline bool
+Pending_Element<Threshold>::OK() const {
+  return true;
+}
+
+template <typename Threshold>
+inline
+Pending_Element<Threshold>::Pending_Element(const Threshold& deadline,
+                                            const Handler& handler,
+                                            bool& expired_flag)
+  : d(deadline), p_h(&handler), p_f(&expired_flag) {
+  assert(OK());
+}
+
+template <typename Threshold>
+inline void
+Pending_Element<Threshold>::assign(const Threshold& deadline,
+                                   const Handler& handler,
+                                   bool& expired_flag) {
+  d = deadline;
+  p_h = &handler;
+  p_f = &expired_flag;
+  assert(OK());
+}
+
+template <typename Threshold>
+inline const Threshold&
+Pending_Element<Threshold>::deadline() const {
+  return d;
+}
+
+template <typename Threshold>
+inline const Handler&
+Pending_Element<Threshold>::handler() const {
+  return *p_h;
+}
+
+template <typename Threshold>
+inline bool&
+Pending_Element<Threshold>::expired_flag() const {
+  return *p_f;
+}
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pending_Element_inlines_hh)
diff --git a/src/Pending_Element_types.hh b/src/Pending_Element_types.hh
new file mode 100644
index 0000000..0bc1b6a
--- /dev/null
+++ b/src/Pending_Element_types.hh
@@ -0,0 +1,31 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Pending_Element_types_hh
+#define PPL_Pending_Element_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+template <class Threshold>
+class Pending_Element;
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pending_Element_types_hh)
diff --git a/src/Pending_List.defs.hh b/src/Pending_List.defs.hh
deleted file mode 100644
index 9eb2119..0000000
--- a/src/Pending_List.defs.hh
+++ /dev/null
@@ -1,79 +0,0 @@
-/* Pending_List class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pending_List_defs_hh
-#define PPL_Pending_List_defs_hh 1
-
-#include "Pending_List.types.hh"
-#include "Pending_Element.defs.hh"
-#include "EList.defs.hh"
-#include "Handler.types.hh"
-
-//! An ordered list for recording pending watchdog events.
-template <typename Traits>
-class Parma_Polyhedra_Library::Implementation::Watchdog::Pending_List {
-public:
-  //! A non-const iterator to traverse the list.
-  typedef typename EList<Pending_Element<typename Traits::Threshold> >::Iterator Iterator;
-
-  //! A const iterator to traverse the list.
-  typedef typename EList<Pending_Element<typename Traits::Threshold> >::Const_Iterator Const_Iterator;
-
-  //! Constructs an empty list.
-  Pending_List();
-
-  //! Destructor.
-  ~Pending_List();
-
-  //! Inserts a new Pending_Element object with the given attributes.
-  Iterator insert(const typename Traits::Threshold& deadline,
-		  const Handler& handler,
-		  bool& expired_flag);
-
-  /*! \brief
-    Removes the element pointed to by \p position, returning
-    an iterator pointing to the next element, if any, or end(), otherwise.
-  */
-  Iterator erase(Iterator position);
-
-  //! Returns <CODE>true</CODE> if and only if the list is empty.
-  bool empty() const;
-
-  //! Returns an iterator pointing to the beginning of the list.
-  Iterator begin();
-
-  //! Returns an iterator pointing one past the last element in the list.
-  Iterator end();
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-private:
-  EList<Pending_Element<typename Traits::Threshold> > active_list;
-  EList<Pending_Element<typename Traits::Threshold> > free_list;
-};
-
-#include "Pending_List.inlines.hh"
-#include "Pending_List.templates.hh"
-
-#endif // !defined(PPL_Pending_List_defs_hh)
diff --git a/src/Pending_List.inlines.hh b/src/Pending_List.inlines.hh
deleted file mode 100644
index ee826c6..0000000
--- a/src/Pending_List.inlines.hh
+++ /dev/null
@@ -1,82 +0,0 @@
-/* Pending_List class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pending_List_inlines_hh
-#define PPL_Pending_List_inlines_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename Traits>
-inline
-Pending_List<Traits>::Pending_List()
-  : active_list(),
-    free_list() {
-  assert(OK());
-}
-
-template <typename Traits>
-inline
-Pending_List<Traits>::~Pending_List() {
-}
-
-template <typename Traits>
-inline typename Pending_List<Traits>::Iterator
-Pending_List<Traits>::begin() {
-  return active_list.begin();
-}
-
-template <typename Traits>
-inline typename Pending_List<Traits>::Iterator
-Pending_List<Traits>::end() {
-  return active_list.end();
-}
-
-template <typename Traits>
-inline bool
-Pending_List<Traits>::empty() const {
-  return active_list.empty();
-}
-
-template <typename Traits>
-inline typename Pending_List<Traits>::Iterator
-Pending_List<Traits>::erase(Iterator position) {
-  assert(!empty());
-  Iterator next = active_list.erase(position);
-  free_list.push_back(*position);
-  assert(OK());
-  return next;
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pending_List_inlines_hh)
diff --git a/src/Pending_List.templates.hh b/src/Pending_List.templates.hh
deleted file mode 100644
index c0af0e6..0000000
--- a/src/Pending_List.templates.hh
+++ /dev/null
@@ -1,96 +0,0 @@
-/* Pending_List class implementation.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pending_List_templates_hh
-#define PPL_Pending_List_templates_hh 1
-
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename Traits>
-typename Pending_List<Traits>::Iterator
-Pending_List<Traits>::insert(const typename Traits::Threshold& deadline,
-			     const Handler& handler,
-			     bool& expired_flag) {
-  Iterator position = active_list.begin();
-  for (Iterator active_list_end = active_list.end();
-       position != active_list_end
-         && Traits::less_than(position->deadline(), deadline);
-       ++position)
-    ;
-  Iterator pending_element_p;
-  // Only allocate a new element if the free list is empty.
-  if (free_list.empty())
-    pending_element_p
-      = new Pending_Element<typename Traits::Threshold>(deadline,
-                                                        handler,
-                                                        expired_flag);
-  else {
-    pending_element_p = free_list.begin();
-    free_list.erase(pending_element_p);
-    pending_element_p->assign(deadline, handler, expired_flag);
-  }
-  Iterator r = active_list.insert(position, *pending_element_p);
-  assert(OK());
-  return r;
-}
-
-template <typename Traits>
-bool
-Pending_List<Traits>::OK() const {
-  if (!active_list.OK())
-    return false;
-
-  if (!free_list.OK())
-    return false;
-
-  const typename Traits::Threshold* old;
-  Const_Iterator i = active_list.begin();
-  old = &i->deadline();
-  ++i;
-  for (Const_Iterator active_list_end = active_list.end(); i != active_list_end; ++i) {
-    const typename Traits::Threshold& t = i->deadline();
-    if (Traits::less_than(t, *old)) {
-#ifndef NDEBUG
-      std::cerr << "The active list is not sorted!"
-		<< std::endl;
-#endif
-      return false;
-    }
-    old = &t;
-  }
-  return true;
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pending_List_templates_hh)
diff --git a/src/Pending_List.types.hh b/src/Pending_List.types.hh
deleted file mode 100644
index 8983420..0000000
--- a/src/Pending_List.types.hh
+++ /dev/null
@@ -1,31 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Pending_List_types_hh
-#define PPL_Pending_List_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-template <typename Traits>
-class Pending_List;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pending_List_types_hh)
diff --git a/src/Pending_List_defs.hh b/src/Pending_List_defs.hh
new file mode 100644
index 0000000..171990e
--- /dev/null
+++ b/src/Pending_List_defs.hh
@@ -0,0 +1,79 @@
+/* Pending_List class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pending_List_defs_hh
+#define PPL_Pending_List_defs_hh 1
+
+#include "Pending_List_types.hh"
+#include "Pending_Element_defs.hh"
+#include "EList_defs.hh"
+#include "Handler_types.hh"
+
+//! An ordered list for recording pending watchdog events.
+template <typename Traits>
+class Parma_Polyhedra_Library::Implementation::Watchdog::Pending_List {
+public:
+  //! A non-const iterator to traverse the list.
+  typedef typename EList<Pending_Element<typename Traits::Threshold> >::iterator iterator;
+
+  //! A const iterator to traverse the list.
+  typedef typename EList<Pending_Element<typename Traits::Threshold> >::const_iterator const_iterator;
+
+  //! Constructs an empty list.
+  Pending_List();
+
+  //! Destructor.
+  ~Pending_List();
+
+  //! Inserts a new Pending_Element object with the given attributes.
+  iterator insert(const typename Traits::Threshold& deadline,
+                  const Handler& handler,
+                  bool& expired_flag);
+
+  /*! \brief
+    Removes the element pointed to by \p position, returning
+    an iterator pointing to the next element, if any, or end(), otherwise.
+  */
+  iterator erase(iterator position);
+
+  //! Returns <CODE>true</CODE> if and only if the list is empty.
+  bool empty() const;
+
+  //! Returns an iterator pointing to the beginning of the list.
+  iterator begin();
+
+  //! Returns an iterator pointing one past the last element in the list.
+  iterator end();
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+private:
+  EList<Pending_Element<typename Traits::Threshold> > active_list;
+  EList<Pending_Element<typename Traits::Threshold> > free_list;
+};
+
+#include "Pending_List_inlines.hh"
+#include "Pending_List_templates.hh"
+
+#endif // !defined(PPL_Pending_List_defs_hh)
diff --git a/src/Pending_List_inlines.hh b/src/Pending_List_inlines.hh
new file mode 100644
index 0000000..20c62b1
--- /dev/null
+++ b/src/Pending_List_inlines.hh
@@ -0,0 +1,82 @@
+/* Pending_List class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pending_List_inlines_hh
+#define PPL_Pending_List_inlines_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+template <typename Traits>
+inline
+Pending_List<Traits>::Pending_List()
+  : active_list(),
+    free_list() {
+  assert(OK());
+}
+
+template <typename Traits>
+inline
+Pending_List<Traits>::~Pending_List() {
+}
+
+template <typename Traits>
+inline typename Pending_List<Traits>::iterator
+Pending_List<Traits>::begin() {
+  return active_list.begin();
+}
+
+template <typename Traits>
+inline typename Pending_List<Traits>::iterator
+Pending_List<Traits>::end() {
+  return active_list.end();
+}
+
+template <typename Traits>
+inline bool
+Pending_List<Traits>::empty() const {
+  return active_list.empty();
+}
+
+template <typename Traits>
+inline typename Pending_List<Traits>::iterator
+Pending_List<Traits>::erase(iterator position) {
+  assert(!empty());
+  iterator next = active_list.erase(position);
+  free_list.push_back(*position);
+  assert(OK());
+  return next;
+}
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pending_List_inlines_hh)
diff --git a/src/Pending_List_templates.hh b/src/Pending_List_templates.hh
new file mode 100644
index 0000000..e984ce2
--- /dev/null
+++ b/src/Pending_List_templates.hh
@@ -0,0 +1,96 @@
+/* Pending_List class implementation.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pending_List_templates_hh
+#define PPL_Pending_List_templates_hh 1
+
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+template <typename Traits>
+typename Pending_List<Traits>::iterator
+Pending_List<Traits>::insert(const typename Traits::Threshold& deadline,
+                             const Handler& handler,
+                             bool& expired_flag) {
+  iterator position = active_list.begin();
+  for (iterator active_list_end = active_list.end();
+       position != active_list_end
+         && Traits::less_than(position->deadline(), deadline);
+       ++position)
+    ;
+  iterator pending_element_p;
+  // Only allocate a new element if the free list is empty.
+  if (free_list.empty())
+    pending_element_p
+      = new Pending_Element<typename Traits::Threshold>(deadline,
+                                                        handler,
+                                                        expired_flag);
+  else {
+    pending_element_p = free_list.begin();
+    free_list.erase(pending_element_p);
+    pending_element_p->assign(deadline, handler, expired_flag);
+  }
+  iterator r = active_list.insert(position, *pending_element_p);
+  assert(OK());
+  return r;
+}
+
+template <typename Traits>
+bool
+Pending_List<Traits>::OK() const {
+  if (!active_list.OK())
+    return false;
+
+  if (!free_list.OK())
+    return false;
+
+  const typename Traits::Threshold* old;
+  const_iterator i = active_list.begin();
+  old = &i->deadline();
+  ++i;
+  for (const_iterator active_list_end = active_list.end(); i != active_list_end; ++i) {
+    const typename Traits::Threshold& t = i->deadline();
+    if (Traits::less_than(t, *old)) {
+#ifndef NDEBUG
+      std::cerr << "The active list is not sorted!"
+                << std::endl;
+#endif
+      return false;
+    }
+    old = &t;
+  }
+  return true;
+}
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pending_List_templates_hh)
diff --git a/src/Pending_List_types.hh b/src/Pending_List_types.hh
new file mode 100644
index 0000000..af6c6ba
--- /dev/null
+++ b/src/Pending_List_types.hh
@@ -0,0 +1,31 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Pending_List_types_hh
+#define PPL_Pending_List_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+template <typename Traits>
+class Pending_List;
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pending_List_types_hh)
diff --git a/src/Ph_Status.cc b/src/Ph_Status.cc
index 0dac654..eb9dd8e 100644
--- a/src/Ph_Status.cc
+++ b/src/Ph_Status.cc
@@ -1,6 +1,6 @@
 /* Polyhedron::Status class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Polyhedron.defs.hh"
+#include "Polyhedron_defs.hh"
 #include "assert.hh"
 #include <iostream>
 #include <string>
@@ -177,7 +177,7 @@ PPL::Polyhedron::Status::OK() const {
     else {
 #ifndef NDEBUG
       cerr << "The empty flag is incompatible with any other one."
-	   << endl;
+           << endl;
 #endif
       return false;
     }
@@ -189,7 +189,7 @@ PPL::Polyhedron::Status::OK() const {
     cerr <<
       "If a saturation matrix is up-to-date, constraints and\n"
       "generators have to be both up-to-date."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -197,7 +197,7 @@ PPL::Polyhedron::Status::OK() const {
   if (test_c_minimized() && !test_c_up_to_date()) {
 #ifndef NDEBUG
     cerr << "If constraints are minimized they must be up-to-date."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -205,7 +205,7 @@ PPL::Polyhedron::Status::OK() const {
   if (test_g_minimized() && !test_g_up_to_date()) {
 #ifndef NDEBUG
     cerr << "If generators are minimized they must be up-to-date."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -213,7 +213,7 @@ PPL::Polyhedron::Status::OK() const {
   if (test_c_pending() && test_g_pending()) {
 #ifndef NDEBUG
     cerr << "There cannot be both pending constraints and pending generators."
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -224,7 +224,7 @@ PPL::Polyhedron::Status::OK() const {
     cerr <<
       "If there are pending constraints or generators, constraints\n"
       "and generators must be minimized."
-	 << endl;
+         << endl;
 #endif
       return false;
     }
@@ -234,7 +234,7 @@ PPL::Polyhedron::Status::OK() const {
     cerr <<
       "If there are pending constraints or generators, there must\n"
       "be at least a saturation matrix up-to-date."
-	 << endl;
+         << endl;
 #endif
       return false;
     }
diff --git a/src/Ph_Status.idefs.hh b/src/Ph_Status.idefs.hh
deleted file mode 100644
index dcbe38c..0000000
--- a/src/Ph_Status.idefs.hh
+++ /dev/null
@@ -1,183 +0,0 @@
-/* Polyhedron::Status class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Status_idefs_hh
-#define PPL_Status_idefs_hh 1
-
-#ifndef PPL_IN_Polyhedron_CLASS
-#error "Do not include Ph_Status.idefs.hh directly; use Polyhedron.defs.hh instead"
-#endif
-
-//! A conjunctive assertion about a polyhedron.
-/*! \ingroup PPL_CXX_interface
-  The assertions supported are:
-  - <EM>zero-dim universe</EM>: the polyhedron is the zero-dimension
-    vector space \f$\Rset^0 = \{\cdot\}\f$;
-  - <EM>empty</EM>: the polyhedron is the empty set;
-  - <EM>constraints pending</EM>: the polyhedron is correctly
-    characterized by the attached system of constraints, which is
-    split in two non-empty subsets: the already processed constraints,
-    which are in minimal form, and the pending constraints, which
-    still have to be processed and may thus be inconsistent or
-    contain redundancies;
-  - <EM>generators pending</EM>: the polyhedron is correctly
-    characterized by the attached system of generators, which is
-    split in two non-empty subsets: the already processed generators,
-    which are in minimal form, and the pending generators, which still
-    have to be processed and may thus contain redundancies;
-  - <EM>constraints up-to-date</EM>: the polyhedron is correctly
-    characterized by the attached system of constraints, modulo the
-    processing of pending generators;
-  - <EM>generators up-to-date</EM>: the polyhedron is correctly
-    characterized by the attached system of generators, modulo the
-    processing of pending constraints;
-  - <EM>constraints minimized</EM>: the non-pending part of the system
-    of constraints attached to the polyhedron is in minimal form;
-  - <EM>generators minimized</EM>: the non-pending part of the system
-    of generators attached to the polyhedron is in minimal form;
-  - <EM>constraints' saturation matrix up-to-date</EM>: the attached
-    saturation matrix having rows indexed by non-pending generators and
-    columns indexed by non-pending constraints correctly expresses
-    the saturation relation between the attached non-pending constraints
-    and generators;
-  - <EM>generators' saturation matrix up-to-date</EM>: the attached
-    saturation matrix having rows indexed by non-pending constraints and
-    columns indexed by non-pending generators correctly expresses
-    the saturation relation between the attached non-pending constraints
-    and generators;
-
-  Not all the conjunctions of these elementary assertions constitute
-  a legal Status.  In fact:
-  - <EM>zero-dim universe</EM> excludes any other assertion;
-  - <EM>empty</EM>: excludes any other assertion;
-  - <EM>constraints pending</EM> and <EM>generators pending</EM>
-    are mutually exclusive;
-  - <EM>constraints pending</EM> implies both <EM>constraints minimized</EM>
-    and <EM>generators minimized</EM>;
-  - <EM>generators pending</EM> implies both <EM>constraints minimized</EM>
-    and <EM>generators minimized</EM>;
-  - <EM>constraints minimized</EM> implies <EM>constraints up-to-date</EM>;
-  - <EM>generators minimized</EM> implies <EM>generators up-to-date</EM>;
-  - <EM>constraints' saturation matrix up-to-date</EM> implies both
-    <EM>constraints up-to-date</EM> and <EM>generators up-to-date</EM>;
-  - <EM>generators' saturation matrix up-to-date</EM> implies both
-    <EM>constraints up-to-date</EM> and <EM>generators up-to-date</EM>.
-*/
-class Status {
-public:
-  //! By default Status is the <EM>zero-dim universe</EM> assertion.
-  Status();
-
-  //! \name Test, remove or add an individual assertion from the conjunction
-  //@{
-  bool test_zero_dim_univ() const;
-  void reset_zero_dim_univ();
-  void set_zero_dim_univ();
-
-  bool test_empty() const;
-  void reset_empty();
-  void set_empty();
-
-  bool test_c_up_to_date() const;
-  void reset_c_up_to_date();
-  void set_c_up_to_date();
-
-  bool test_g_up_to_date() const;
-  void reset_g_up_to_date();
-  void set_g_up_to_date();
-
-  bool test_c_minimized() const;
-  void reset_c_minimized();
-  void set_c_minimized();
-
-  bool test_g_minimized() const;
-  void reset_g_minimized();
-  void set_g_minimized();
-
-  bool test_sat_c_up_to_date() const;
-  void reset_sat_c_up_to_date();
-  void set_sat_c_up_to_date();
-
-  bool test_sat_g_up_to_date() const;
-  void reset_sat_g_up_to_date();
-  void set_sat_g_up_to_date();
-
-  bool test_c_pending() const;
-  void reset_c_pending();
-  void set_c_pending();
-
-  bool test_g_pending() const;
-  void reset_g_pending();
-  void set_g_pending();
-  //@} // Test, remove or add an individual assertion from the conjunction
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-private:
-  //! Status is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bit-masks for the individual assertions
-  //@{
-  static const flags_t ZERO_DIM_UNIV    = 0U;
-  static const flags_t EMPTY            = 1U << 0;
-  static const flags_t C_UP_TO_DATE     = 1U << 1;
-  static const flags_t G_UP_TO_DATE     = 1U << 2;
-  static const flags_t C_MINIMIZED      = 1U << 3;
-  static const flags_t G_MINIMIZED      = 1U << 4;
-  static const flags_t SAT_C_UP_TO_DATE = 1U << 5;
-  static const flags_t SAT_G_UP_TO_DATE = 1U << 6;
-  static const flags_t CS_PENDING       = 1U << 7;
-  static const flags_t GS_PENDING       = 1U << 8;
-  //@} // Bit-masks for the individual assertions
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! Construct from a bit-mask.
-  Status(flags_t mask);
-
-  //! Check whether <EM>all</EM> bits in \p mask are set.
-  bool test_all(flags_t mask) const;
-
-  //! Check whether <EM>at least one</EM> bit in \p mask is set.
-  bool test_any(flags_t mask) const;
-
-  //! Set the bits in \p mask.
-  void set(flags_t mask);
-
-  //! Reset the bits in \p mask.
-  void reset(flags_t mask);
-};
-
-#endif // !defined(PPL_Status_idefs_hh)
diff --git a/src/Ph_Status.inlines.hh b/src/Ph_Status.inlines.hh
deleted file mode 100644
index 0c828de..0000000
--- a/src/Ph_Status.inlines.hh
+++ /dev/null
@@ -1,217 +0,0 @@
-/* Polyhedron::Status class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Status_inlines_hh
-#define PPL_Status_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Polyhedron::Status::Status(flags_t mask)
-  : flags(mask) {
-}
-
-inline
-Polyhedron::Status::Status()
-  : flags(ZERO_DIM_UNIV) {
-}
-
-inline bool
-Polyhedron::Status::test_all(flags_t mask) const {
-  return (flags & mask) == mask;
-}
-
-inline bool
-Polyhedron::Status::test_any(flags_t mask) const {
-  return (flags & mask) != 0;
-}
-
-inline void
-Polyhedron::Status::set(flags_t mask) {
-  flags |= mask;
-}
-
-inline void
-Polyhedron::Status::reset(flags_t mask) {
-  flags &= ~mask;
-}
-
-inline bool
-Polyhedron::Status::test_zero_dim_univ() const {
-  return flags == ZERO_DIM_UNIV;
-}
-
-inline void
-Polyhedron::Status::reset_zero_dim_univ() {
-  // This is a no-op if the current status is not zero-dim.
-  if (flags == ZERO_DIM_UNIV)
-    // In the zero-dim space, if it is not the universe it is empty.
-    flags = EMPTY;
-}
-
-inline void
-Polyhedron::Status::set_zero_dim_univ() {
-  // Zero-dim universe is incompatible with anything else.
-  flags = ZERO_DIM_UNIV;
-}
-
-inline bool
-Polyhedron::Status::test_empty() const {
-  return test_any(EMPTY);
-}
-
-inline void
-Polyhedron::Status::reset_empty() {
-  reset(EMPTY);
-}
-
-inline void
-Polyhedron::Status::set_empty() {
-  flags = EMPTY;
-}
-
-inline bool
-Polyhedron::Status::test_c_up_to_date() const {
-  return test_any(C_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::reset_c_up_to_date() {
-  reset(C_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::set_c_up_to_date() {
-  set(C_UP_TO_DATE);
-}
-
-inline bool
-Polyhedron::Status::test_g_up_to_date() const {
-  return test_any(G_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::reset_g_up_to_date() {
-  reset(G_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::set_g_up_to_date() {
-  set(G_UP_TO_DATE);
-}
-
-inline bool
-Polyhedron::Status::test_c_minimized() const {
-  return test_any(C_MINIMIZED);
-}
-
-inline void
-Polyhedron::Status::reset_c_minimized() {
-  reset(C_MINIMIZED);
-}
-
-inline void
-Polyhedron::Status::set_c_minimized() {
-  set(C_MINIMIZED);
-}
-
-inline bool
-Polyhedron::Status::test_g_minimized() const {
-  return test_any(G_MINIMIZED);
-}
-
-inline void
-Polyhedron::Status::reset_g_minimized() {
-  reset(G_MINIMIZED);
-}
-
-inline void
-Polyhedron::Status::set_g_minimized() {
-  set(G_MINIMIZED);
-}
-
-
-inline bool
-Polyhedron::Status::test_c_pending() const {
-  return test_any(CS_PENDING);
-}
-
-inline void
-Polyhedron::Status::reset_c_pending() {
-  reset(CS_PENDING);
-}
-
-inline void
-Polyhedron::Status::set_c_pending() {
-  set(CS_PENDING);
-}
-
-inline bool
-Polyhedron::Status::test_g_pending() const {
-  return test_any(GS_PENDING);
-}
-
-inline void
-Polyhedron::Status::reset_g_pending() {
-  reset(GS_PENDING);
-}
-
-inline void
-Polyhedron::Status::set_g_pending() {
-  set(GS_PENDING);
-}
-
-
-inline bool
-Polyhedron::Status::test_sat_c_up_to_date() const {
-  return test_any(SAT_C_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::reset_sat_c_up_to_date() {
-  reset(SAT_C_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::set_sat_c_up_to_date() {
-  set(SAT_C_UP_TO_DATE);
-}
-
-inline bool
-Polyhedron::Status::test_sat_g_up_to_date() const {
-  return test_any(SAT_G_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::reset_sat_g_up_to_date() {
-  reset(SAT_G_UP_TO_DATE);
-}
-
-inline void
-Polyhedron::Status::set_sat_g_up_to_date() {
-  set(SAT_G_UP_TO_DATE);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Status_inlines_hh)
diff --git a/src/Ph_Status_idefs.hh b/src/Ph_Status_idefs.hh
new file mode 100644
index 0000000..1c3128f
--- /dev/null
+++ b/src/Ph_Status_idefs.hh
@@ -0,0 +1,183 @@
+/* Polyhedron::Status class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Status_idefs_hh
+#define PPL_Status_idefs_hh 1
+
+#ifndef PPL_IN_Polyhedron_CLASS
+#error "Do not include Ph_Status_idefs.hh directly; use Polyhedron_defs.hh instead"
+#endif
+
+//! A conjunctive assertion about a polyhedron.
+/*! \ingroup PPL_CXX_interface
+  The assertions supported are:
+  - <EM>zero-dim universe</EM>: the polyhedron is the zero-dimension
+    vector space \f$\Rset^0 = \{\cdot\}\f$;
+  - <EM>empty</EM>: the polyhedron is the empty set;
+  - <EM>constraints pending</EM>: the polyhedron is correctly
+    characterized by the attached system of constraints, which is
+    split in two non-empty subsets: the already processed constraints,
+    which are in minimal form, and the pending constraints, which
+    still have to be processed and may thus be inconsistent or
+    contain redundancies;
+  - <EM>generators pending</EM>: the polyhedron is correctly
+    characterized by the attached system of generators, which is
+    split in two non-empty subsets: the already processed generators,
+    which are in minimal form, and the pending generators, which still
+    have to be processed and may thus contain redundancies;
+  - <EM>constraints up-to-date</EM>: the polyhedron is correctly
+    characterized by the attached system of constraints, modulo the
+    processing of pending generators;
+  - <EM>generators up-to-date</EM>: the polyhedron is correctly
+    characterized by the attached system of generators, modulo the
+    processing of pending constraints;
+  - <EM>constraints minimized</EM>: the non-pending part of the system
+    of constraints attached to the polyhedron is in minimal form;
+  - <EM>generators minimized</EM>: the non-pending part of the system
+    of generators attached to the polyhedron is in minimal form;
+  - <EM>constraints' saturation matrix up-to-date</EM>: the attached
+    saturation matrix having rows indexed by non-pending generators and
+    columns indexed by non-pending constraints correctly expresses
+    the saturation relation between the attached non-pending constraints
+    and generators;
+  - <EM>generators' saturation matrix up-to-date</EM>: the attached
+    saturation matrix having rows indexed by non-pending constraints and
+    columns indexed by non-pending generators correctly expresses
+    the saturation relation between the attached non-pending constraints
+    and generators;
+
+  Not all the conjunctions of these elementary assertions constitute
+  a legal Status.  In fact:
+  - <EM>zero-dim universe</EM> excludes any other assertion;
+  - <EM>empty</EM>: excludes any other assertion;
+  - <EM>constraints pending</EM> and <EM>generators pending</EM>
+    are mutually exclusive;
+  - <EM>constraints pending</EM> implies both <EM>constraints minimized</EM>
+    and <EM>generators minimized</EM>;
+  - <EM>generators pending</EM> implies both <EM>constraints minimized</EM>
+    and <EM>generators minimized</EM>;
+  - <EM>constraints minimized</EM> implies <EM>constraints up-to-date</EM>;
+  - <EM>generators minimized</EM> implies <EM>generators up-to-date</EM>;
+  - <EM>constraints' saturation matrix up-to-date</EM> implies both
+    <EM>constraints up-to-date</EM> and <EM>generators up-to-date</EM>;
+  - <EM>generators' saturation matrix up-to-date</EM> implies both
+    <EM>constraints up-to-date</EM> and <EM>generators up-to-date</EM>.
+*/
+class Status {
+public:
+  //! By default Status is the <EM>zero-dim universe</EM> assertion.
+  Status();
+
+  //! \name Test, remove or add an individual assertion from the conjunction
+  //@{
+  bool test_zero_dim_univ() const;
+  void reset_zero_dim_univ();
+  void set_zero_dim_univ();
+
+  bool test_empty() const;
+  void reset_empty();
+  void set_empty();
+
+  bool test_c_up_to_date() const;
+  void reset_c_up_to_date();
+  void set_c_up_to_date();
+
+  bool test_g_up_to_date() const;
+  void reset_g_up_to_date();
+  void set_g_up_to_date();
+
+  bool test_c_minimized() const;
+  void reset_c_minimized();
+  void set_c_minimized();
+
+  bool test_g_minimized() const;
+  void reset_g_minimized();
+  void set_g_minimized();
+
+  bool test_sat_c_up_to_date() const;
+  void reset_sat_c_up_to_date();
+  void set_sat_c_up_to_date();
+
+  bool test_sat_g_up_to_date() const;
+  void reset_sat_g_up_to_date();
+  void set_sat_g_up_to_date();
+
+  bool test_c_pending() const;
+  void reset_c_pending();
+  void set_c_pending();
+
+  bool test_g_pending() const;
+  void reset_g_pending();
+  void set_g_pending();
+  //@} // Test, remove or add an individual assertion from the conjunction
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+private:
+  //! Status is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bit-masks for the individual assertions
+  //@{
+  static const flags_t ZERO_DIM_UNIV    = 0U;
+  static const flags_t EMPTY            = 1U << 0;
+  static const flags_t C_UP_TO_DATE     = 1U << 1;
+  static const flags_t G_UP_TO_DATE     = 1U << 2;
+  static const flags_t C_MINIMIZED      = 1U << 3;
+  static const flags_t G_MINIMIZED      = 1U << 4;
+  static const flags_t SAT_C_UP_TO_DATE = 1U << 5;
+  static const flags_t SAT_G_UP_TO_DATE = 1U << 6;
+  static const flags_t CS_PENDING       = 1U << 7;
+  static const flags_t GS_PENDING       = 1U << 8;
+  //@} // Bit-masks for the individual assertions
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! Construct from a bit-mask.
+  Status(flags_t mask);
+
+  //! Check whether <EM>all</EM> bits in \p mask are set.
+  bool test_all(flags_t mask) const;
+
+  //! Check whether <EM>at least one</EM> bit in \p mask is set.
+  bool test_any(flags_t mask) const;
+
+  //! Set the bits in \p mask.
+  void set(flags_t mask);
+
+  //! Reset the bits in \p mask.
+  void reset(flags_t mask);
+};
+
+#endif // !defined(PPL_Status_idefs_hh)
diff --git a/src/Ph_Status_inlines.hh b/src/Ph_Status_inlines.hh
new file mode 100644
index 0000000..a4ce90b
--- /dev/null
+++ b/src/Ph_Status_inlines.hh
@@ -0,0 +1,217 @@
+/* Polyhedron::Status class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Status_inlines_hh
+#define PPL_Status_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Polyhedron::Status::Status(flags_t mask)
+  : flags(mask) {
+}
+
+inline
+Polyhedron::Status::Status()
+  : flags(ZERO_DIM_UNIV) {
+}
+
+inline bool
+Polyhedron::Status::test_all(flags_t mask) const {
+  return (flags & mask) == mask;
+}
+
+inline bool
+Polyhedron::Status::test_any(flags_t mask) const {
+  return (flags & mask) != 0;
+}
+
+inline void
+Polyhedron::Status::set(flags_t mask) {
+  flags |= mask;
+}
+
+inline void
+Polyhedron::Status::reset(flags_t mask) {
+  flags &= ~mask;
+}
+
+inline bool
+Polyhedron::Status::test_zero_dim_univ() const {
+  return flags == ZERO_DIM_UNIV;
+}
+
+inline void
+Polyhedron::Status::reset_zero_dim_univ() {
+  // This is a no-op if the current status is not zero-dim.
+  if (flags == ZERO_DIM_UNIV)
+    // In the zero-dim space, if it is not the universe it is empty.
+    flags = EMPTY;
+}
+
+inline void
+Polyhedron::Status::set_zero_dim_univ() {
+  // Zero-dim universe is incompatible with anything else.
+  flags = ZERO_DIM_UNIV;
+}
+
+inline bool
+Polyhedron::Status::test_empty() const {
+  return test_any(EMPTY);
+}
+
+inline void
+Polyhedron::Status::reset_empty() {
+  reset(EMPTY);
+}
+
+inline void
+Polyhedron::Status::set_empty() {
+  flags = EMPTY;
+}
+
+inline bool
+Polyhedron::Status::test_c_up_to_date() const {
+  return test_any(C_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::reset_c_up_to_date() {
+  reset(C_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::set_c_up_to_date() {
+  set(C_UP_TO_DATE);
+}
+
+inline bool
+Polyhedron::Status::test_g_up_to_date() const {
+  return test_any(G_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::reset_g_up_to_date() {
+  reset(G_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::set_g_up_to_date() {
+  set(G_UP_TO_DATE);
+}
+
+inline bool
+Polyhedron::Status::test_c_minimized() const {
+  return test_any(C_MINIMIZED);
+}
+
+inline void
+Polyhedron::Status::reset_c_minimized() {
+  reset(C_MINIMIZED);
+}
+
+inline void
+Polyhedron::Status::set_c_minimized() {
+  set(C_MINIMIZED);
+}
+
+inline bool
+Polyhedron::Status::test_g_minimized() const {
+  return test_any(G_MINIMIZED);
+}
+
+inline void
+Polyhedron::Status::reset_g_minimized() {
+  reset(G_MINIMIZED);
+}
+
+inline void
+Polyhedron::Status::set_g_minimized() {
+  set(G_MINIMIZED);
+}
+
+
+inline bool
+Polyhedron::Status::test_c_pending() const {
+  return test_any(CS_PENDING);
+}
+
+inline void
+Polyhedron::Status::reset_c_pending() {
+  reset(CS_PENDING);
+}
+
+inline void
+Polyhedron::Status::set_c_pending() {
+  set(CS_PENDING);
+}
+
+inline bool
+Polyhedron::Status::test_g_pending() const {
+  return test_any(GS_PENDING);
+}
+
+inline void
+Polyhedron::Status::reset_g_pending() {
+  reset(GS_PENDING);
+}
+
+inline void
+Polyhedron::Status::set_g_pending() {
+  set(GS_PENDING);
+}
+
+
+inline bool
+Polyhedron::Status::test_sat_c_up_to_date() const {
+  return test_any(SAT_C_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::reset_sat_c_up_to_date() {
+  reset(SAT_C_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::set_sat_c_up_to_date() {
+  set(SAT_C_UP_TO_DATE);
+}
+
+inline bool
+Polyhedron::Status::test_sat_g_up_to_date() const {
+  return test_any(SAT_G_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::reset_sat_g_up_to_date() {
+  reset(SAT_G_UP_TO_DATE);
+}
+
+inline void
+Polyhedron::Status::set_sat_g_up_to_date() {
+  set(SAT_G_UP_TO_DATE);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Status_inlines_hh)
diff --git a/src/Pointset_Powerset.cc b/src/Pointset_Powerset.cc
index 4440aaa..1a33b05 100644
--- a/src/Pointset_Powerset.cc
+++ b/src/Pointset_Powerset.cc
@@ -1,6 +1,6 @@
 /* Pointset_Powerset class implementation: non-inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Pointset_Powerset.defs.hh"
-#include "Grid.defs.hh"
+#include "Pointset_Powerset_defs.hh"
+#include "Grid_defs.hh"
 #include <utility>
 
 namespace PPL = Parma_Polyhedra_Library;
@@ -42,9 +42,9 @@ PPL::Pointset_Powerset<PPL::NNC_Polyhedron>
     const NNC_Polyhedron& ph_yi = yi->pointset();
     Sequence tmp_sequence;
     for (Sequence_const_iterator itr = new_sequence.begin(),
-	   ns_end = new_sequence.end(); itr != ns_end; ++itr) {
-      std::pair<NNC_Polyhedron, Pointset_Powerset<NNC_Polyhedron> > partition
-	= linear_partition(ph_yi, itr->pointset());
+           ns_end = new_sequence.end(); itr != ns_end; ++itr) {
+      const std::pair<NNC_Polyhedron, Pointset_Powerset<NNC_Polyhedron> >
+        partition = linear_partition(ph_yi, itr->pointset());
       const Pointset_Powerset<NNC_Polyhedron>& residues = partition.second;
       // Append the contents of `residues' to `tmp_sequence'.
       std::copy(residues.begin(), residues.end(), back_inserter(tmp_sequence));
@@ -70,38 +70,38 @@ PPL::Pointset_Powerset<PPL::NNC_Polyhedron>
 /*! \relates Parma_Polyhedra_Library::Pointset_Powerset */
 bool
 PPL::check_containment(const NNC_Polyhedron& ph,
-		       const Pointset_Powerset<NNC_Polyhedron>& ps) {
+                       const Pointset_Powerset<NNC_Polyhedron>& ps) {
   if (ph.is_empty())
     return true;
   Pointset_Powerset<NNC_Polyhedron> tmp(ph.space_dimension(), EMPTY);
   tmp.add_disjunct(ph);
   for (Pointset_Powerset<NNC_Polyhedron>::const_iterator
-	 i = ps.begin(), ps_end = ps.end(); i != ps_end; ++i) {
+         i = ps.begin(), ps_end = ps.end(); i != ps_end; ++i) {
     const NNC_Polyhedron& pi = i->pointset();
     for (Pointset_Powerset<NNC_Polyhedron>::iterator
-	   j = tmp.begin(); j != tmp.end(); ) {
+           j = tmp.begin(); j != tmp.end(); ) {
       const NNC_Polyhedron& pj = j->pointset();
       if (pi.contains(pj))
-	j = tmp.drop_disjunct(j);
+        j = tmp.drop_disjunct(j);
       else
-	++j;
+        ++j;
     }
     if (tmp.empty())
       return true;
     else {
       Pointset_Powerset<NNC_Polyhedron> new_disjuncts(ph.space_dimension(),
-						      EMPTY);
+                                                      EMPTY);
       for (Pointset_Powerset<NNC_Polyhedron>::iterator
-	     j = tmp.begin(); j != tmp.end(); ) {
-	const NNC_Polyhedron& pj = j->pointset();
-	if (pj.is_disjoint_from(pi))
-	  ++j;
-	else {
-	  std::pair<NNC_Polyhedron, Pointset_Powerset<NNC_Polyhedron> >
-	    partition = linear_partition(pi, pj);
-	  new_disjuncts.upper_bound_assign(partition.second);
-	  j = tmp.drop_disjunct(j);
-	}
+             j = tmp.begin(); j != tmp.end(); ) {
+        const NNC_Polyhedron& pj = j->pointset();
+        if (pj.is_disjoint_from(pi))
+          ++j;
+        else {
+          const std::pair<NNC_Polyhedron, Pointset_Powerset<NNC_Polyhedron> >
+            partition = linear_partition(pi, pj);
+          new_disjuncts.upper_bound_assign(partition.second);
+          j = tmp.drop_disjunct(j);
+        }
       }
       tmp.upper_bound_assign(new_disjuncts);
     }
@@ -123,19 +123,19 @@ namespace {
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 bool
 approximate_partition_aux(const PPL::Congruence& c,
-			  PPL::Grid& gr,
-			  PPL::Pointset_Powerset<PPL::Grid>& r) {
+                          PPL::Grid& gr,
+                          PPL::Pointset_Powerset<PPL::Grid>& r) {
   using namespace PPL;
   const Coefficient& c_modulus = c.modulus();
-  Grid gr_copy(gr);
+  const Grid gr_copy(gr);
   gr.add_congruence(c);
   if (gr.is_empty()) {
     r.add_disjunct(gr_copy);
     return true;
   }
 
-  Congruence_System cgs = gr.congruences();
-  Congruence_System cgs_copy = gr_copy.congruences();
+  const Congruence_System cgs = gr.congruences();
+  const Congruence_System cgs_copy = gr_copy.congruences();
   // When c is an equality, not satisfied by Grid gr
   // then add gr to the set r. There is no finite
   // partition in this case.
@@ -159,7 +159,7 @@ approximate_partition_aux(const PPL::Congruence& c,
   // in this direction, then there is a finite partition and that
   // is added to r.
   const Coefficient& c_inhomogeneous_term = c.inhomogeneous_term();
-  Linear_Expression le(c);
+  Linear_Expression le(c.expression());
   le -= c_inhomogeneous_term;
   PPL_DIRTY_TEMP_COEFFICIENT(n);
   rem_assign(n, c_inhomogeneous_term, c_modulus);
@@ -171,7 +171,7 @@ approximate_partition_aux(const PPL::Congruence& c,
       Grid gr_tmp(gr_copy);
       gr_tmp.add_congruence((le+i %= 0) / c_modulus);
       if (!gr_tmp.is_empty())
-	r.add_disjunct(gr_tmp);
+        r.add_disjunct(gr_tmp);
     }
   return true;
 }
@@ -181,7 +181,7 @@ approximate_partition_aux(const PPL::Congruence& c,
 /*! \relates Parma_Polyhedra_Library::Pointset_Powerset */
 std::pair<PPL::Grid, PPL::Pointset_Powerset<PPL::Grid> >
 PPL::approximate_partition(const Grid& p, const Grid& q,
-			   bool& finite_partition) {
+                           bool& finite_partition) {
   using namespace PPL;
   finite_partition = true;
   Pointset_Powerset<Grid> r(p.space_dimension(), EMPTY);
@@ -191,10 +191,10 @@ PPL::approximate_partition(const Grid& p, const Grid& q,
   Grid gr = q;
   const Congruence_System& p_congruences = p.congruences();
   for (Congruence_System::const_iterator i = p_congruences.begin(),
-	 p_congruences_end = p_congruences.end(); i != p_congruences_end; ++i)
+         p_congruences_end = p_congruences.end(); i != p_congruences_end; ++i)
     if (!approximate_partition_aux(*i, gr, r)) {
       finite_partition = false;
-      Pointset_Powerset<Grid> s(q);
+      const Pointset_Powerset<Grid> s(q);
       return std::make_pair(gr, s);
     }
   return std::make_pair(gr, r);
@@ -203,36 +203,36 @@ PPL::approximate_partition(const Grid& p, const Grid& q,
 /*! \relates Parma_Polyhedra_Library::Pointset_Powerset */
 bool
 PPL::check_containment(const Grid& ph,
-		       const Pointset_Powerset<Grid>& ps) {
+                       const Pointset_Powerset<Grid>& ps) {
   if (ph.is_empty())
     return true;
   Pointset_Powerset<Grid> tmp(ph.space_dimension(), EMPTY);
   tmp.add_disjunct(ph);
   for (Pointset_Powerset<Grid>::const_iterator
-	 i = ps.begin(), ps_end = ps.end(); i != ps_end; ++i) {
+         i = ps.begin(), ps_end = ps.end(); i != ps_end; ++i) {
     const Grid& pi = i->pointset();
     for (Pointset_Powerset<Grid>::iterator
-	   j = tmp.begin(); j != tmp.end(); ) {
+           j = tmp.begin(); j != tmp.end(); ) {
       const Grid& pj = j->pointset();
       if (pi.contains(pj))
-	j = tmp.drop_disjunct(j);
+        j = tmp.drop_disjunct(j);
       else
-	++j;
+        ++j;
     }
     if (tmp.empty())
       return true;
     else {
       Pointset_Powerset<Grid> new_disjuncts(ph.space_dimension(),
-						      EMPTY);
+                                                      EMPTY);
       for (Pointset_Powerset<Grid>::iterator
-	     j = tmp.begin(); j != tmp.end(); ) {
-	const Grid& pj = j->pointset();
-	if (pj.is_disjoint_from(pi))
-	  ++j;
-	else {
+             j = tmp.begin(); j != tmp.end(); ) {
+        const Grid& pj = j->pointset();
+        if (pj.is_disjoint_from(pi))
+          ++j;
+        else {
           bool finite_partition;
-	  std::pair<Grid, Pointset_Powerset<Grid> >
-	    partition = approximate_partition(pi, pj, finite_partition);
+          const std::pair<Grid, Pointset_Powerset<Grid> >
+            partition = approximate_partition(pi, pj, finite_partition);
 
           // If there is a finite partition, then we add the new
           // disjuncts to the temporary set of disjuncts and drop pj.
@@ -243,9 +243,9 @@ PPL::check_containment(const Grid& ph,
           // also not have a finite partition with respect to pi.
           if (!finite_partition)
             break;
-	  new_disjuncts.upper_bound_assign(partition.second);
-	  j = tmp.drop_disjunct(j);
-	}
+          new_disjuncts.upper_bound_assign(partition.second);
+          j = tmp.drop_disjunct(j);
+        }
       }
       tmp.upper_bound_assign(new_disjuncts);
     }
@@ -267,10 +267,10 @@ PPL::Pointset_Powerset<PPL::Grid>
     const Grid& gr_yi = yi->pointset();
     Sequence tmp_sequence;
     for (Sequence_const_iterator itr = new_sequence.begin(),
-	   ns_end = new_sequence.end(); itr != ns_end; ++itr) {
+           ns_end = new_sequence.end(); itr != ns_end; ++itr) {
       bool finite_partition;
-      std::pair<Grid, Pointset_Powerset<Grid> > partition
-	= approximate_partition(gr_yi, itr->pointset(), finite_partition);
+      const std::pair<Grid, Pointset_Powerset<Grid> > partition
+        = approximate_partition(gr_yi, itr->pointset(), finite_partition);
       const Pointset_Powerset<Grid>& residues = partition.second;
       // Append the contents of `residues' to `tmp_sequence'.
       std::copy(residues.begin(), residues.end(), back_inserter(tmp_sequence));
@@ -301,9 +301,9 @@ PPL::Pointset_Powerset<PPL::NNC_Polyhedron>
   : Base(), space_dim(y.space_dimension()) {
   Pointset_Powerset& x = *this;
   for (Pointset_Powerset<C_Polyhedron>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
+         y_end = y.end(); i != y_end; ++i)
     x.sequence.push_back(Determinate<NNC_Polyhedron>
-			 (NNC_Polyhedron(i->pointset())));
+                         (NNC_Polyhedron(i->pointset())));
   x.reduced = y.reduced;
   PPL_ASSERT_HEAVY(x.OK());
 }
@@ -316,9 +316,9 @@ PPL::Pointset_Powerset<PPL::NNC_Polyhedron>
   : Base(), space_dim(y.space_dimension()) {
   Pointset_Powerset& x = *this;
   for (Pointset_Powerset<Grid>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
+         y_end = y.end(); i != y_end; ++i)
     x.sequence.push_back(Determinate<NNC_Polyhedron>
-			 (NNC_Polyhedron(i->pointset())));
+                         (NNC_Polyhedron(i->pointset())));
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
 }
@@ -331,9 +331,9 @@ PPL::Pointset_Powerset<PPL::C_Polyhedron>
   : Base(), space_dim(y.space_dimension()) {
   Pointset_Powerset& x = *this;
   for (Pointset_Powerset<NNC_Polyhedron>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
+         y_end = y.end(); i != y_end; ++i)
     x.sequence.push_back(Determinate<C_Polyhedron>
-			 (C_Polyhedron(i->pointset())));
+                         (C_Polyhedron(i->pointset())));
 
   // Note: this might be non-reduced even when `y' is known to be
   // omega-reduced, because the constructor of C_Polyhedron, by
diff --git a/src/Pointset_Powerset.defs.hh b/src/Pointset_Powerset.defs.hh
deleted file mode 100644
index 6062bcd..0000000
--- a/src/Pointset_Powerset.defs.hh
+++ /dev/null
@@ -1,1450 +0,0 @@
-/* Pointset_Powerset class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pointset_Powerset_defs_hh
-#define PPL_Pointset_Powerset_defs_hh
-
-#include "Pointset_Powerset.types.hh"
-#include "globals.defs.hh"
-#include "BHRZ03_Certificate.types.hh"
-#include "Constraint.types.hh"
-#include "Constraint_System.types.hh"
-#include "Congruence.types.hh"
-#include "Congruence_System.types.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include "Polyhedron.defs.hh"
-#include "Grid.defs.hh"
-#include "Partially_Reduced_Product.defs.hh"
-#include "Variables_Set.types.hh"
-#include "Determinate.defs.hh"
-#include "Powerset.defs.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include <iosfwd>
-#include <list>
-#include <map>
-
-//! The powerset construction instantiated on PPL pointset domains.
-/*! \ingroup PPL_CXX_interface */
-/*!
-  \warning
-  At present, the supported instantiations for the
-  disjunct domain template \p PSET are the simple pointset domains:
-  <CODE>C_Polyhedron</CODE>,
-  <CODE>NNC_Polyhedron</CODE>,
-  <CODE>Grid</CODE>,
-  <CODE>Octagonal_Shape<T></CODE>,
-  <CODE>BD_Shape<T></CODE>,
-  <CODE>Box<T></CODE>.
-*/
-template <typename PSET>
-class Parma_Polyhedra_Library::Pointset_Powerset
-  : public Parma_Polyhedra_Library::Powerset
-<Parma_Polyhedra_Library::Determinate<PSET> > {
-public:
-  typedef PSET element_type;
-
-private:
-  typedef Determinate<PSET> Det_PSET;
-  typedef Powerset<Det_PSET> Base;
-
-public:
-  //! Returns the maximum space dimension a Pointset_Powerset<PSET> can handle.
-  static dimension_type max_space_dimension();
-
-  //! \name Constructors
-  //@{
-
-  //! Builds a universe (top) or empty (bottom) Pointset_Powerset.
-  /*!
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the powerset;
-
-    \param kind
-    Specifies whether the universe or the empty powerset has to be built.
-  */
-  explicit
-  Pointset_Powerset(dimension_type num_dimensions = 0,
-		    Degenerate_Element kind = UNIVERSE);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  Pointset_Powerset(const Pointset_Powerset& y,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    Conversion constructor: the type <CODE>QH</CODE> of the disjuncts
-    in the source powerset is different from <CODE>PSET</CODE>.
-
-    \param y
-    The powerset to be used to build the new powerset.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-  */
-  template <typename QH>
-  explicit Pointset_Powerset(const Pointset_Powerset<QH>& y,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    Creates a Pointset_Powerset from a product
-    This will be created as a single disjunct of type PSET that
-    approximates the product.
-  */
-  template <typename QH1, typename QH2, typename R>
-  explicit
-  Pointset_Powerset(const Partially_Reduced_Product<QH1, QH2, R>& prp,
-                    Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    Creates a Pointset_Powerset with a single disjunct approximating
-    the system of constraints \p cs.
-  */
-  explicit Pointset_Powerset(const Constraint_System& cs);
-
-  /*! \brief
-    Creates a Pointset_Powerset with a single disjunct approximating
-    the system of congruences \p cgs.
-  */
-  explicit Pointset_Powerset(const Congruence_System& cgs);
-
-
-  //! Builds a pointset_powerset out of a closed polyhedron.
-  /*!
-    Builds a powerset that is either empty (if the polyhedron is found
-    to be empty) or contains a single disjunct approximating the
-    polyhedron; this must only use algorithms that do not exceed the
-    specified complexity.  The powerset inherits the space dimension
-    of the polyhedron.
-
-    \param ph
-    The closed polyhedron to be used to build the powerset.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p ph exceeds the maximum
-    allowed space dimension.
-  */
-  explicit Pointset_Powerset(const C_Polyhedron& ph,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a pointset_powerset out of an nnc polyhedron.
-  /*!
-    Builds a powerset that is either empty (if the polyhedron is found
-    to be empty) or contains a single disjunct approximating the
-    polyhedron; this must only use algorithms that do not exceed the
-    specified complexity.  The powerset inherits the space dimension
-    of the polyhedron.
-
-    \param ph
-    The closed polyhedron to be used to build the powerset.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p ph exceeds the maximum
-    allowed space dimension.
-  */
-  explicit Pointset_Powerset(const NNC_Polyhedron& ph,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-
-  //! Builds a pointset_powerset out of a grid.
-  /*!
-    If the grid is nonempty, builds a powerset containing a single
-    disjunct approximating the grid. Builds the empty powerset
-    otherwise. The powerset inherits the space dimension of the grid.
-
-    \param gr
-    The grid to be used to build the powerset.
-
-    \param complexity
-    This argument is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p gr exceeds the maximum
-    allowed space dimension.
-  */
-  explicit Pointset_Powerset(const Grid& gr,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a pointset_powerset out of an octagonal shape.
-  /*!
-    If the octagonal shape is nonempty, builds a powerset
-    containing a single disjunct approximating the octagonal
-    shape. Builds the empty powerset otherwise. The powerset
-    inherits the space dimension of the octagonal shape.
-
-    \param os
-    The octagonal shape to be used to build the powerset.
-
-    \param complexity
-    This argument is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p os exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename T>
-  explicit Pointset_Powerset(const Octagonal_Shape<T>& os,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a pointset_powerset out of a bd shape.
-  /*!
-    If the bd shape is nonempty, builds a powerset containing a
-    single disjunct approximating the bd shape. Builds the empty
-    powerset otherwise.  The powerset inherits the space dimension
-    of the bd shape.
-
-    \param bds
-    The bd shape to be used to build the powerset.
-
-    \param complexity
-    This argument is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p bds exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename T>
-  explicit Pointset_Powerset(const BD_Shape<T>& bds,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a pointset_powerset out of a box.
-  /*!
-    If the box is nonempty, builds a powerset containing a single
-    disjunct approximating the box. Builds the empty powerset
-    otherwise.  The powerset inherits the space dimension of the box.
-
-    \param box
-    The box to be used to build the powerset.
-
-    \param complexity
-    This argument is ignored.
-
-    \exception std::length_error
-    Thrown if the space dimension of \p box exceeds the maximum
-    allowed space dimension.
-  */
-  template <typename Interval>
-  explicit Pointset_Powerset(const Box<Interval>& box,
-                             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //@} // Constructors and Destructor
-
-  //! \name Member Functions that Do Not Modify the Pointset_Powerset
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type affine_dimension() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is
-    an empty powerset.
-  */
-  bool is_empty() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is the top element of the powerset lattice.
-  */
-  bool is_universe() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the disjuncts
-    in \p *this are topologically closed.
-  */
-  bool is_topologically_closed() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all elements in \p *this
-    are bounded.
-  */
-  bool is_bounded() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool is_disjoint_from(const Pointset_Powerset& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
-  bool is_discrete() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-
-    \note
-    A variable is constrained if there exists a non-redundant disjunct
-    that is constraining the variable: this definition relies on the
-    powerset lattice structure and may be somewhat different from the
-    geometric intuition.
-    For instance, variable \f$x\f$ is constrained in the powerset
-    \f[
-      \mathit{ps} = \bigl\{ \{ x \geq 0 \}, \{ x \leq 0 \} \bigr\},
-    \f]
-    even though \f$\mathit{ps}\f$ is geometrically equal to the
-    whole vector space.
-  */
-  bool constrains(Variable var) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from above in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from below in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
-    and \p maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value;
-
-    \param g
-    When maximization succeeds, will be assigned the point or
-    closure point where \p expr reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p g are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value;
-
-    \param g
-    When minimization succeeds, will be assigned a point or
-    closure point where \p expr reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p g are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this geometrically
-    covers \p y, i.e., if any point (in some element) of \p y is also
-    a point (of some element) of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \warning
-    This may be <EM>really</EM> expensive!
-  */
-  bool geometrically_covers(const Pointset_Powerset& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is geometrically
-    equal to \p y, i.e., if (the elements of) \p *this and \p y
-    contain the same set of points.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \warning
-    This may be <EM>really</EM> expensive!
-  */
-  bool geometrically_equals(const Pointset_Powerset& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if each disjunct
-      of \p y is contained in a disjunct of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool contains(const Pointset_Powerset& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if each disjunct
-      of \p y is strictly contained in a disjunct of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool strictly_contains(const Pointset_Powerset& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains at least one integer point.
-  */
-  bool contains_integer_point() const;
-
-  /*! \brief
-    Returns the relations holding between the powerset \p *this
-    and the constraint \p c.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  /*! \brief
-    Returns the relations holding between the powerset \p *this
-    and the generator \p g.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  Poly_Gen_Relation relation_with(const Generator& g) const;
-
-  /*! \brief
-    Returns the relations holding between the powerset \p *this
-    and the congruence \p c.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a lower bound to the size in bytes of the memory
-    managed by \p *this.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If \p x and \p y are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //@} // Member Functions that Do Not Modify the Pointset_Powerset
-
-  //! \name Space Dimension Preserving Member Functions that May Modify the Pointset_Powerset
-  //@{
-
-  //! Adds to \p *this the disjunct \p ph.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p ph are dimension-incompatible.
-  */
-  void add_disjunct(const PSET& ph);
-
-  //! Intersects \p *this with constraint \p c.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are topology-incompatible
-    or dimension-incompatible.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Use the constraint \p c to refine \p *this.
-
-    \param c
-    The constraint to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  //! Intersects \p *this with the constraints in \p cs.
-  /*!
-    \param cs
-    The constraints to intersect with.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Use the constraints in \p cs to refine \p *this.
-
-    \param  cs
-     The constraints to be used for refinement.
-
-     \exception std::invalid_argument
-     Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  //! Intersects \p *this with congruence \p cg.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are topology-incompatible
-    or dimension-incompatible.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Use the congruence \p cg to refine \p *this.
-
-    \param cg
-    The congruence to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
-  //! Intersects \p *this with the congruences in \p cgs.
-  /*!
-    \param cgs
-    The congruences to intersect with.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Use the congruences in \p cgs to refine \p *this.
-
-    \param  cgs
-    The congruences to be used for refinement.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  //! Assigns to \p *this the intersection of \p *this and \p y.
-  /*!
-    The result is obtained by intersecting each disjunct in \p *this
-    with each disjunct in \p y and collecting all these intersections.
-  */
-  void intersection_assign(const Pointset_Powerset& y);
-
-  /*! \brief
-    Assigns to \p *this an (a smallest)
-    over-approximation as a powerset of the disjunct domain of the
-    set-theoretical difference of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  void difference_assign(const Pointset_Powerset& y);
-
-  /*! \brief
-    Assigns to \p *this a \ref Powerset_Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-    If \c false is returned, then the intersection is empty.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool simplify_using_context_assign(const Pointset_Powerset& y);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine image"
-    of \p *this under the function mapping variable \p var to the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of
-    \p *this.
-  */
-  void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine preimage"
-    of \p *this under the function mapping variable \p var to the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of
-    \p *this.
-  */
-  void affine_preimage(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				  = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void
-  generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
-
-  /*!
-    \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
-
-  /*!
-    \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
-
-    The result is obtained by computing the pairwise
-    \ref Time_Elapse_Operator "time elapse" of each disjunct
-    in \p *this with each disjunct in \p y.
-  */
-  void time_elapse_assign(const Pointset_Powerset& y);
-
-  /*! \brief
-    \ref Wrapping_Operator "Wraps" the specified dimensions of the
-    vector space.
-
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be wrapped.
-
-    \param w
-    The width of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param r
-    The representation of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param o
-    The overflow behavior of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param cs_p
-    Possibly null pointer to a constraint system whose variables
-    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
-    variables not in \p vars, the behavior is undefined.
-    When non-null, the pointed-to constraint system is assumed to
-    represent the conditional or looping construct guard with respect
-    to which wrapping is performed.  Since wrapping requires the
-    computation of upper bounds and due to non-distributivity of
-    constraint refinement over upper bounds, passing a constraint
-    system in this way can be more precise than refining the result of
-    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
-
-    \param complexity_threshold
-    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
-    higher values result in possibly improved precision.
-
-    \param wrap_individually
-    <CODE>true</CODE> if the dimensions should be wrapped individually
-    (something that results in much greater efficiency to the detriment of
-    precision).
-
-    \exception std::invalid_argument
-    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
-    \p vars, or if \p *this is dimension-incompatible \p vars or with
-    <CODE>*cs_p</CODE>.
-  */
-  void wrap_assign(const Variables_Set& vars,
-                   Bounded_Integer_Type_Width w,
-                   Bounded_Integer_Type_Representation r,
-                   Bounded_Integer_Type_Overflow o,
-                   const Constraint_System* cs_p = 0,
-                   unsigned complexity_threshold = 16,
-                   bool wrap_individually = true);
-
-  /*! \brief
-    Assign to \p *this the result of (recursively) merging together
-    the pairs of disjuncts whose upper-bound is the same as their
-    set-theoretical union.
-
-    On exit, for all the pairs \f$\cP\f$, \f$\cQ\f$ of different disjuncts
-    in \p *this, we have \f$\cP \uplus \cQ \neq \cP \union \cQ\f$.
-  */
-  void pairwise_reduce();
-
-  /*! \brief
-    Assigns to \p *this the result of applying the
-    \ref pps_bgp99_extrapolation "BGP99 extrapolation operator"
-    to \p *this and \p y, using the widening function \p widen_fun
-    and the cardinality threshold \p max_disjuncts.
-
-    \param y
-    A powerset that <EM>must</EM> definitely entail \p *this;
-
-    \param widen_fun
-    The widening function to be used on polyhedra objects. It is obtained
-    from the corresponding widening method by using the helper function
-    Parma_Polyhedra_Library::widen_fun_ref. Legal values are, e.g.,
-    <CODE>widen_fun_ref(&Polyhedron::H79_widening_assign)</CODE> and
-    <CODE>widen_fun_ref(&Polyhedron::limited_H79_extrapolation_assign, cs)</CODE>;
-
-    \param max_disjuncts
-    The maximum number of disjuncts occurring in the powerset \p *this
-    <EM>before</EM> starting the computation. If this number is exceeded,
-    some of the disjuncts in \p *this are collapsed (i.e., joined together).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    For a description of the extrapolation operator,
-    see \ref BGP99 "[BGP99]" and \ref BHZ03b "[BHZ03b]".
-  */
-  template <typename Widening>
-  void BGP99_extrapolation_assign(const Pointset_Powerset& y,
-				  Widening widen_fun,
-				  unsigned max_disjuncts);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref pps_certificate_widening "BHZ03-widening"
-    between \p *this and \p y, using the widening function \p widen_fun
-    certified by the convergence certificate \p Cert.
-
-    \param y
-    The finite powerset computed in the previous iteration step.
-    It <EM>must</EM> definitely entail \p *this;
-
-    \param widen_fun
-    The widening function to be used on disjuncts.
-    It is obtained from the corresponding widening method by using
-    the helper function widen_fun_ref. Legal values are, e.g.,
-    <CODE>widen_fun_ref(&Polyhedron::H79_widening_assign)</CODE> and
-    <CODE>widen_fun_ref(&Polyhedron::limited_H79_extrapolation_assign, cs)</CODE>.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-
-    \warning
-    In order to obtain a proper widening operator, the template parameter
-    \p Cert should be a finite convergence certificate for the base-level
-    widening function \p widen_fun; otherwise, an extrapolation operator is
-    obtained.
-    For a description of the methods that should be provided
-    by \p Cert, see BHRZ03_Certificate or H79_Certificate.
-  */
-  template <typename Cert, typename Widening>
-  void BHZ03_widening_assign(const Pointset_Powerset& y, Widening widen_fun);
-
-  //@} // Space Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  /*! \brief
-    The assignment operator
-    (\p *this and \p y can be dimension-incompatible).
-  */
-  Pointset_Powerset& operator=(const Pointset_Powerset& y);
-
-  /*! \brief
-    Conversion assignment: the type <CODE>QH</CODE> of the disjuncts
-    in the source powerset is different from <CODE>PSET</CODE>
-    (\p *this and \p y can be dimension-incompatible).
-  */
-  template <typename QH>
-  Pointset_Powerset& operator=(const Pointset_Powerset<QH>& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Pointset_Powerset& y);
-
-  /*! \brief
-    Adds \p m new dimensions to the vector space containing \p *this
-    and embeds each disjunct in \p *this in the new space.
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Adds \p m new dimensions to the vector space containing \p *this
-    without embedding the disjuncts in \p *this in the new space.
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  //! Assigns to \p *this the concatenation of \p *this and \p y.
-  /*!
-    The result is obtained by computing the pairwise
-    \ref Concatenating_Polyhedra "concatenation" of each disjunct
-    in \p *this with each disjunct in \p y.
-  */
-  void concatenate_assign(const Pointset_Powerset& y);
-
-  //! Removes all the specified space dimensions.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher space dimensions so that the resulting space
-    will have dimension \p new_dimension.
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimensions is greater than the space dimension
-    of \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a partial function.
-
-    See also Polyhedron::map_space_dimensions.
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector
-    space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the vector
-    space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions
-    "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.  Also
-    thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are
-    \ref Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension
-    "folded" into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-public:
-  typedef typename Base::size_type size_type;
-  typedef typename Base::value_type value_type;
-  typedef typename Base::iterator iterator;
-  typedef typename Base::const_iterator const_iterator;
-  typedef typename Base::reverse_iterator reverse_iterator;
-  typedef typename Base::const_reverse_iterator const_reverse_iterator;
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-private:
-  typedef typename Base::Sequence Sequence;
-  typedef typename Base::Sequence_iterator Sequence_iterator;
-  typedef typename Base::Sequence_const_iterator Sequence_const_iterator;
-
-  //! The number of dimensions of the enclosing vector space.
-  dimension_type space_dim;
-
-  /*! \brief
-    Assigns to \p dest a \ref Powerset_Meet_Preserving_Simplification
-    "powerset meet-preserving enlargement" of itself with respect to
-    \p *this.  If \c false is returned, then the intersection is empty.
-
-    \note
-    It is assumed that \p *this and \p dest are topology-compatible
-    and dimension-compatible.
-  */
-  bool intersection_preserving_enlarge_element(PSET& dest) const;
-
-  /*! \brief
-    Assigns to \p *this the result of applying the BGP99 heuristics
-    to \p *this and \p y, using the widening function \p widen_fun.
-  */
-  template <typename Widening>
-  void BGP99_heuristics_assign(const Pointset_Powerset& y, Widening widen_fun);
-
-  //! Records in \p cert_ms the certificates for this set of disjuncts.
-  template <typename Cert>
-  void collect_certificates(std::map<Cert, size_type,
-			             typename Cert::Compare>& cert_ms) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the current set of disjuncts
-    is stabilizing with respect to the multiset of certificates \p y_cert_ms.
-  */
-  template <typename Cert>
-  bool is_cert_multiset_stabilizing(const std::map<Cert, size_type,
-                                                   typename Cert::Compare>&
-				    y_cert_ms) const;
-
-  // FIXME: here it should be enough to befriend the template constructor
-  // template <typename QH>
-  // Pointset_Powerset(const Pointset_Powerset<QH>&),
-  // but, apparently, this cannot be done.
-  friend class Pointset_Powerset<NNC_Polyhedron>;
-};
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Pointset_Powerset */
-template <typename PSET>
-void swap(Pointset_Powerset<PSET>& x, Pointset_Powerset<PSET>& y);
-
-//! Partitions \p q with respect to \p p.
-/*! \relates Pointset_Powerset
-  Let \p p and \p q be two polyhedra.
-  The function returns an object <CODE>r</CODE> of type
-  <CODE>std::pair\<PSET, Pointset_Powerset\<NNC_Polyhedron\> \></CODE>
-  such that
-  - <CODE>r.first</CODE> is the intersection of \p p and \p q;
-  - <CODE>r.second</CODE> has the property that all its elements are
-    pairwise disjoint and disjoint from \p p;
-  - the set-theoretical union of <CODE>r.first</CODE> with all the
-    elements of <CODE>r.second</CODE> gives \p q (i.e., <CODE>r</CODE>
-    is the representation of a partition of \p q).
-
-  \if Include_Implementation_Details
-
-  See
-  <A HREF="http://bugseng.com/products/ppl/Documentation/bibliography#Srivastava93">
-  this paper</A> for more information about the implementation.
-  \endif
-*/
-template <typename PSET>
-std::pair<PSET, Pointset_Powerset<NNC_Polyhedron> >
-linear_partition(const PSET& p, const PSET& q);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if the union of
-  the NNC polyhedra in \p ps contains the NNC polyhedron \p ph.
-
-  \relates Pointset_Powerset
-*/
-bool
-check_containment(const NNC_Polyhedron& ph,
-		  const Pointset_Powerset<NNC_Polyhedron>& ps);
-
-
-/*! \brief
-  Partitions the grid \p q with respect to grid \p p if and only if
-  such a partition is finite.
-
-  \relates Parma_Polyhedra_Library::Pointset_Powerset
-  Let \p p and \p q be two grids.
-  The function returns an object <CODE>r</CODE> of type
-  <CODE>std::pair\<PSET, Pointset_Powerset\<Grid\> \></CODE>
-  such that
-  - <CODE>r.first</CODE> is the intersection of \p p and \p q;
-  - If there is a finite partition of \p q with respect to \p p
-    the Boolean <CODE>finite_partition</CODE> is set to true and
-    <CODE>r.second</CODE> has the property that all its elements are
-    pairwise disjoint and disjoint from \p p and the set-theoretical
-    union of <CODE>r.first</CODE> with all the elements of
-    <CODE>r.second</CODE> gives \p q (i.e., <CODE>r</CODE>
-    is the representation of a partition of \p q).
-  - Otherwise the Boolean <CODE>finite_partition</CODE> is set to false
-    and the singleton set that contains \p q is stored in
-    <CODE>r.second</CODE>r.
-*/
-std::pair<Grid, Pointset_Powerset<Grid> >
-approximate_partition(const Grid& p, const Grid& q, bool& finite_partition);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if the union of
-  the grids \p ps contains the grid \p g.
-
-  \relates Pointset_Powerset
-*/
-bool
-check_containment(const Grid& ph,
-		  const Pointset_Powerset<Grid>& ps);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if the union of
-  the objects in \p ps contains \p ph.
-
-  \relates Pointset_Powerset
-  \note
-  It is assumed that the template parameter PSET can be converted
-  without precision loss into an NNC_Polyhedron; otherwise,
-  an incorrect result might be obtained.
-*/
-template <typename PSET>
-bool
-check_containment(const PSET& ph, const Pointset_Powerset<PSET>& ps);
-
-// CHECKME: according to the Intel compiler, the declaration of the
-// following specialization (of the class template parameter) should come
-// before the declaration of the corresponding full specialization
-// (where the member template parameter is specialized too).
-template <>
-template <typename QH>
-Pointset_Powerset<NNC_Polyhedron>
-::Pointset_Powerset(const Pointset_Powerset<QH>& y,
-                    Complexity_Class);
-
-// Non-inline full specializations should be declared here
-// so as to inhibit multiple instantiations of the generic template.
-template <>
-template <>
-Pointset_Powerset<NNC_Polyhedron>
-::Pointset_Powerset(const Pointset_Powerset<C_Polyhedron>& y,
-                    Complexity_Class);
-
-template <>
-template <>
-Pointset_Powerset<NNC_Polyhedron>
-::Pointset_Powerset(const Pointset_Powerset<Grid>& y,
-                    Complexity_Class);
-
-template <>
-template <>
-Pointset_Powerset<C_Polyhedron>
-::Pointset_Powerset(const Pointset_Powerset<NNC_Polyhedron>& y,
-                    Complexity_Class);
-
-template <>
-void
-Pointset_Powerset<NNC_Polyhedron>
-::difference_assign(const Pointset_Powerset& y);
-
-template <>
-void
-Pointset_Powerset<Grid>
-::difference_assign(const Pointset_Powerset& y);
-
-template <>
-bool
-Pointset_Powerset<NNC_Polyhedron>
-::geometrically_covers(const Pointset_Powerset& y) const;
-
-template <>
-bool
-Pointset_Powerset<Grid>
-::geometrically_covers(const Pointset_Powerset& y) const;
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Pointset_Powerset.inlines.hh"
-#include "Pointset_Powerset.templates.hh"
-
-#endif // !defined(PPL_Pointset_Powerset_defs_hh)
diff --git a/src/Pointset_Powerset.inlines.hh b/src/Pointset_Powerset.inlines.hh
deleted file mode 100644
index 4076cb2..0000000
--- a/src/Pointset_Powerset.inlines.hh
+++ /dev/null
@@ -1,320 +0,0 @@
-/* Pointset_Powerset class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pointset_Powerset_inlines_hh
-#define PPL_Pointset_Powerset_inlines_hh 1
-
-#include "Constraint.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Congruence.defs.hh"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include <algorithm>
-#include <deque>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-inline dimension_type
-Pointset_Powerset<PSET>::space_dimension() const {
-  return space_dim;
-}
-
-template <typename PSET>
-inline dimension_type
-Pointset_Powerset<PSET>::max_space_dimension() {
-  return PSET::max_space_dimension();
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(dimension_type num_dimensions,
-					   Degenerate_Element kind)
-  : Base(), space_dim(num_dimensions) {
-  Pointset_Powerset& x = *this;
-  if (kind == UNIVERSE)
-    x.sequence.push_back(Determinate<PSET>(PSET(num_dimensions, kind)));
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(const Pointset_Powerset& y,
-					   Complexity_Class)
-  : Base(y), space_dim(y.space_dim) {
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(const C_Polyhedron& ph,
-					   Complexity_Class complexity)
-  : Base(), space_dim(ph.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (complexity == ANY_COMPLEXITY) {
-    if (ph.is_empty())
-      return;
-  }
-  else
-    x.reduced = false;
-  x.sequence.push_back(Determinate<PSET>(PSET(ph, complexity)));
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(const NNC_Polyhedron& ph,
-					   Complexity_Class complexity)
-  : Base(), space_dim(ph.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (complexity == ANY_COMPLEXITY) {
-    if (ph.is_empty())
-      return;
-  }
-  else
-    x.reduced = false;
-  x.sequence.push_back(Determinate<PSET>(PSET(ph, complexity)));
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(const Grid& gr,
-					   Complexity_Class)
-  : Base(), space_dim(gr.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (!gr.is_empty()) {
-    x.sequence.push_back(Determinate<PSET>(PSET(gr)));
-  }
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-template <typename QH1, typename QH2, typename R>
-inline
-Pointset_Powerset<PSET>
-::Pointset_Powerset(const Partially_Reduced_Product<QH1, QH2, R>& prp,
-                    Complexity_Class complexity)
-  : Base(), space_dim(prp.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (complexity == ANY_COMPLEXITY) {
-    if (prp.is_empty())
-      return;
-  }
-  else
-    x.reduced = false;
-  x.sequence.push_back(Determinate<PSET>(PSET(prp, complexity)));
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-template <typename Interval>
-Pointset_Powerset<PSET>::Pointset_Powerset(const Box<Interval>& box,
-					   Complexity_Class)
-  : Base(), space_dim(box.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (!box.is_empty())
-    x.sequence.push_back(Determinate<PSET>(PSET(box)));
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-template <typename T>
-Pointset_Powerset<PSET>::Pointset_Powerset(const Octagonal_Shape<T>& os,
-					   Complexity_Class)
-  : Base(), space_dim(os.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (!os.is_empty())
-    x.sequence.push_back(Determinate<PSET>(PSET(os)));
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-template <typename T>
-Pointset_Powerset<PSET>::Pointset_Powerset(const BD_Shape<T>& bds,
-					   Complexity_Class)
-  : Base(), space_dim(bds.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  if (!bds.is_empty())
-    x.sequence.push_back(Determinate<PSET>(PSET(bds)));
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(const Constraint_System& cs)
-  : Base(Determinate<PSET>(cs)), space_dim(cs.space_dimension()) {
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-inline
-Pointset_Powerset<PSET>::Pointset_Powerset(const Congruence_System& cgs)
-  : Base(Determinate<PSET>(cgs)), space_dim(cgs.space_dimension()) {
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename PSET>
-inline Pointset_Powerset<PSET>&
-Pointset_Powerset<PSET>::operator=(const Pointset_Powerset& y) {
-  Pointset_Powerset& x = *this;
-  x.Base::operator=(y);
-  x.space_dim = y.space_dim;
-  return x;
-}
-
-template <typename PSET>
-inline void
-Pointset_Powerset<PSET>::m_swap(Pointset_Powerset& y) {
-  Pointset_Powerset& x = *this;
-  x.Base::m_swap(y);
-  using std::swap;
-  swap(x.space_dim, y.space_dim);
-}
-
-template <typename PSET>
-template <typename QH>
-inline Pointset_Powerset<PSET>&
-Pointset_Powerset<PSET>::operator=(const Pointset_Powerset<QH>& y) {
-  Pointset_Powerset& x = *this;
-  Pointset_Powerset<PSET> ps(y);
-  swap(x, ps);
-  return x;
-}
-
-template <typename PSET>
-inline void
-Pointset_Powerset<PSET>::intersection_assign(const Pointset_Powerset& y) {
-  Pointset_Powerset& x = *this;
-  x.pairwise_apply_assign
-    (y,
-     Det_PSET::lift_op_assign(std::mem_fun_ref(&PSET::intersection_assign)));
-}
-
-template <typename PSET>
-inline void
-Pointset_Powerset<PSET>::time_elapse_assign(const Pointset_Powerset& y) {
-  Pointset_Powerset& x = *this;
-  x.pairwise_apply_assign
-    (y,
-     Det_PSET::lift_op_assign(std::mem_fun_ref(&PSET::time_elapse_assign)));
-}
-
-template <typename PSET>
-inline bool
-Pointset_Powerset<PSET>
-::geometrically_covers(const Pointset_Powerset& y) const {
-  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
-  const Pointset_Powerset<NNC_Polyhedron> xx(*this);
-  const Pointset_Powerset<NNC_Polyhedron> yy(y);
-  return xx.geometrically_covers(yy);
-}
-
-template <typename PSET>
-inline bool
-Pointset_Powerset<PSET>
-::geometrically_equals(const Pointset_Powerset& y) const {
-  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
-  const Pointset_Powerset<NNC_Polyhedron> xx(*this);
-  const Pointset_Powerset<NNC_Polyhedron> yy(y);
-  return xx.geometrically_covers(yy) && yy.geometrically_covers(xx);
-}
-
-template <>
-inline bool
-Pointset_Powerset<Grid>
-::geometrically_equals(const Pointset_Powerset& y) const {
-  const Pointset_Powerset& x = *this;
-  return x.geometrically_covers(y) && y.geometrically_covers(x);
-}
-
-template <>
-inline bool
-Pointset_Powerset<NNC_Polyhedron>
-::geometrically_equals(const Pointset_Powerset& y) const {
-  const Pointset_Powerset& x = *this;
-  return x.geometrically_covers(y) && y.geometrically_covers(x);
-}
-
-template <typename PSET>
-inline memory_size_type
-Pointset_Powerset<PSET>::external_memory_in_bytes() const {
-  return Base::external_memory_in_bytes();
-}
-
-template <typename PSET>
-inline memory_size_type
-Pointset_Powerset<PSET>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-template <typename PSET>
-inline int32_t
-Pointset_Powerset<PSET>::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-template <typename PSET>
-inline void
-Pointset_Powerset<PSET>
-::difference_assign(const Pointset_Powerset& y) {
-  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
-  Pointset_Powerset<NNC_Polyhedron> nnc_this(*this);
-  Pointset_Powerset<NNC_Polyhedron> nnc_y(y);
-  nnc_this.difference_assign(nnc_y);
-  *this = nnc_this;
-}
-
-/*! \relates Pointset_Powerset */
-template <typename PSET>
-inline bool
-check_containment(const PSET& ph, const Pointset_Powerset<PSET>& ps) {
-  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
-  const NNC_Polyhedron ph_nnc = NNC_Polyhedron(ph.constraints());
-  const Pointset_Powerset<NNC_Polyhedron> ps_nnc(ps);
-  return check_containment(ph_nnc, ps_nnc);
-}
-
-/*! \relates Pointset_Powerset */
-template <>
-inline bool
-check_containment(const C_Polyhedron& ph,
-		  const Pointset_Powerset<C_Polyhedron>& ps) {
-  return check_containment(NNC_Polyhedron(ph),
-			   Pointset_Powerset<NNC_Polyhedron>(ps));
-}
-
-/*! \relates Pointset_Powerset */
-template <typename PSET>
-inline void
-swap(Pointset_Powerset<PSET>& x, Pointset_Powerset<PSET>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pointset_Powerset_inlines_hh)
diff --git a/src/Pointset_Powerset.templates.hh b/src/Pointset_Powerset.templates.hh
deleted file mode 100644
index 469846d..0000000
--- a/src/Pointset_Powerset.templates.hh
+++ /dev/null
@@ -1,1611 +0,0 @@
-/* Pointset_Powerset class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Pointset_Powerset_templates_hh
-#define PPL_Pointset_Powerset_templates_hh 1
-
-#include "Constraint.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include "Variables_Set.defs.hh"
-#include <algorithm>
-#include <deque>
-#include <string>
-#include <iostream>
-#include <sstream>
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_disjunct(const PSET& ph) {
-  Pointset_Powerset& x = *this;
-  if (x.space_dimension() != ph.space_dimension()) {
-    std::ostringstream s;
-    s << "PPL::Pointset_Powerset<PSET>::add_disjunct(ph):\n"
-      << "this->space_dimension() == " << x.space_dimension() << ", "
-      << "ph.space_dimension() == " << ph.space_dimension() << ".";
-    throw std::invalid_argument(s.str());
-  }
-  x.sequence.push_back(Determinate<PSET>(ph));
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <>
-template <typename QH>
-Pointset_Powerset<NNC_Polyhedron>
-::Pointset_Powerset(const Pointset_Powerset<QH>& y,
-                    Complexity_Class complexity)
-  : Base(), space_dim(y.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  for (typename Pointset_Powerset<QH>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
-    x.sequence.push_back(Determinate<NNC_Polyhedron>
-			 (NNC_Polyhedron(i->pointset(), complexity)));
-
-  // FIXME: If the domain elements can be represented _exactly_ as NNC
-  // polyhedra, then having x.reduced = y.reduced is correct. This is
-  // the case if the domains are both linear and convex which holds
-  // for all the currently supported instantiations except for
-  // Grids; for this reason the Grid specialization has a
-  // separate implementation.  For any non-linear or non-convex
-  // domains (e.g., a domain of Intervals with restrictions or a
-  // domain of circles) that may be supported in the future, the
-  // assignment x.reduced = y.reduced will be a bug.
-  x.reduced = y.reduced;
-
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-template <typename QH>
-Pointset_Powerset<PSET>
-::Pointset_Powerset(const Pointset_Powerset<QH>& y,
-                    Complexity_Class complexity)
-  : Base(), space_dim(y.space_dimension()) {
-  Pointset_Powerset& x = *this;
-  for (typename Pointset_Powerset<QH>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
-    x.sequence.push_back(Determinate<PSET>(PSET(i->pointset(), complexity)));
-  // Note: this might be non-reduced even when `y' is known to be
-  // omega-reduced, because the constructor of PSET may have made
-  // different QH elements to become comparable.
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::concatenate_assign(const Pointset_Powerset& y) {
-  Pointset_Powerset& x = *this;
-  // Ensure omega-reduction here, since what follows has quadratic complexity.
-  x.omega_reduce();
-  y.omega_reduce();
-  Pointset_Powerset<PSET> new_x(x.space_dim + y.space_dim, EMPTY);
-  for (const_iterator xi = x.begin(), x_end = x.end(),
-	 y_begin = y.begin(), y_end = y.end(); xi != x_end; ) {
-    for (const_iterator yi = y_begin; yi != y_end; ++yi) {
-      Det_PSET zi = *xi;
-      zi.concatenate_assign(*yi);
-      PPL_ASSERT_HEAVY(!zi.is_bottom());
-      new_x.sequence.push_back(zi);
-    }
-    ++xi;
-    if ((abandon_expensive_computations != 0)
-        && (xi != x_end) && (y_begin != y_end)) {
-      // Hurry up!
-      PSET x_ph = xi->pointset();
-      for (++xi; xi != x_end; ++xi)
-	x_ph.upper_bound_assign(xi->pointset());
-      const_iterator yi = y_begin;
-      PSET y_ph = yi->pointset();
-      for (++yi; yi != y_end; ++yi)
-	y_ph.upper_bound_assign(yi->pointset());
-      x_ph.concatenate_assign(y_ph);
-      swap(x, new_x);
-      x.add_disjunct(x_ph);
-      PPL_ASSERT_HEAVY(x.OK());
-      return;
-    }
-  }
-  swap(x, new_x);
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_constraint(const Constraint& c) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().add_constraint(c);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::refine_with_constraint(const Constraint& c) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().refine_with_constraint(c);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_constraints(const Constraint_System& cs) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().add_constraints(cs);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::refine_with_constraints(const Constraint_System& cs) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().refine_with_constraints(cs);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_congruence(const Congruence& cg) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().add_congruence(cg);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::refine_with_congruence(const Congruence& cg) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().refine_with_congruence(cg);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_congruences(const Congruence_System& cgs) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().add_congruences(cgs);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::refine_with_congruences(const Congruence_System& cgs) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().refine_with_congruences(cgs);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::unconstrain(const Variable var) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().unconstrain(var);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::unconstrain(const Variables_Set& vars) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().unconstrain(vars);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_space_dimensions_and_embed(dimension_type m) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().add_space_dimensions_and_embed(m);
-  x.space_dim += m;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::add_space_dimensions_and_project(dimension_type m) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().add_space_dimensions_and_project(m);
-  x.space_dim += m;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::remove_space_dimensions(const Variables_Set& vars) {
-  Pointset_Powerset& x = *this;
-  Variables_Set::size_type num_removed = vars.size();
-  if (num_removed > 0) {
-    for (Sequence_iterator si = x.sequence.begin(),
-	   s_end = x.sequence.end(); si != s_end; ++si) {
-      si->pointset().remove_space_dimensions(vars);
-      x.reduced = false;
-    }
-    x.space_dim -= num_removed;
-    PPL_ASSERT_HEAVY(x.OK());
-  }
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::remove_higher_space_dimensions(dimension_type new_dimension) {
-  Pointset_Powerset& x = *this;
-  if (new_dimension < x.space_dim) {
-    for (Sequence_iterator si = x.sequence.begin(),
-	   s_end = x.sequence.end(); si != s_end; ++si) {
-      si->pointset().remove_higher_space_dimensions(new_dimension);
-      x.reduced = false;
-    }
-    x.space_dim = new_dimension;
-    PPL_ASSERT_HEAVY(x.OK());
-  }
-}
-
-template <typename PSET>
-template <typename Partial_Function>
-void
-Pointset_Powerset<PSET>::map_space_dimensions(const Partial_Function& pfunc) {
-  Pointset_Powerset& x = *this;
-  if (x.is_bottom()) {
-    dimension_type n = 0;
-    for (dimension_type i = x.space_dim; i-- > 0; ) {
-      dimension_type new_i;
-      if (pfunc.maps(i, new_i))
-	++n;
-    }
-    x.space_dim = n;
-  }
-  else {
-    Sequence_iterator s_begin = x.sequence.begin();
-    for (Sequence_iterator si = s_begin,
-	   s_end = x.sequence.end(); si != s_end; ++si)
-      si->pointset().map_space_dimensions(pfunc);
-    x.space_dim = s_begin->pointset().space_dimension();
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::expand_space_dimension(Variable var,
-                                                dimension_type m) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().expand_space_dimension(var, m);
-  x.space_dim += m;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::fold_space_dimensions(const Variables_Set& vars,
-                                               Variable dest) {
-  Pointset_Powerset& x = *this;
-  Variables_Set::size_type num_folded = vars.size();
-  if (num_folded > 0) {
-    for (Sequence_iterator si = x.sequence.begin(),
-           s_end = x.sequence.end(); si != s_end; ++si)
-      si->pointset().fold_space_dimensions(vars, dest);
-  }
-  x.space_dim -= num_folded;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::affine_image(Variable var,
-                                      const Linear_Expression& expr,
-                                      Coefficient_traits::const_reference
-                                      denominator) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().affine_image(var, expr, denominator);
-    // Note that the underlying domain can apply conservative approximation:
-    // that is why it would not be correct to make the loss of reduction
-    // conditional on `var' and `expr'.
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::affine_preimage(Variable var,
-                                         const Linear_Expression& expr,
-                                         Coefficient_traits::const_reference
-                                         denominator) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().affine_preimage(var, expr, denominator);
-    // Note that the underlying domain can apply conservative approximation:
-    // that is why it would not be correct to make the loss of reduction
-    // conditional on `var' and `expr'.
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::generalized_affine_image(const Linear_Expression& lhs,
-                           const Relation_Symbol relsym,
-                           const Linear_Expression& rhs) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().generalized_affine_image(lhs, relsym, rhs);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::generalized_affine_preimage(const Linear_Expression& lhs,
-                              const Relation_Symbol relsym,
-                              const Linear_Expression& rhs) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().generalized_affine_preimage(lhs, relsym, rhs);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::generalized_affine_image(Variable var,
-                           const Relation_Symbol relsym,
-                           const Linear_Expression& expr,
-                           Coefficient_traits::const_reference denominator) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().generalized_affine_image(var, relsym, expr, denominator);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::generalized_affine_preimage(Variable var,
-                              const Relation_Symbol relsym,
-                              const Linear_Expression& expr,
-                              Coefficient_traits::const_reference
-                              denominator) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().generalized_affine_preimage(var, relsym, expr, denominator);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::bounded_affine_image(Variable var,
-                       const Linear_Expression& lb_expr,
-                       const Linear_Expression& ub_expr,
-                       Coefficient_traits::const_reference denominator) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().bounded_affine_image(var, lb_expr, ub_expr, denominator);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::bounded_affine_preimage(Variable var,
-                          const Linear_Expression& lb_expr,
-                          const Linear_Expression& ub_expr,
-                          Coefficient_traits::const_reference denominator) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    si->pointset().bounded_affine_preimage(var, lb_expr, ub_expr,
-                                          denominator);
-    x.reduced = false;
-  }
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-dimension_type
-Pointset_Powerset<PSET>::affine_dimension() const {
-  // The affine dimension of the powerset is the affine dimension of
-  // the smallest vector space in which it can be embedded.
-  const Pointset_Powerset& x = *this;
-  C_Polyhedron x_ph(space_dim, EMPTY);
-
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    PSET pi(si->pointset());
-    if (!pi.is_empty()) {
-      C_Polyhedron phi(space_dim);
-      const Constraint_System& cs = pi.minimized_constraints();
-      for (Constraint_System::const_iterator i = cs.begin(),
-             cs_end = cs.end(); i != cs_end; ++i) {
-        const Constraint& c = *i;
-        if (c.is_equality())
-          phi.add_constraint(c);
-      }
-      x_ph.poly_hull_assign(phi);
-    }
-  }
-
-  return x_ph.affine_dimension();
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::is_universe() const {
-  const Pointset_Powerset& x = *this;
-  // Exploit omega-reduction, if already computed.
-  if (x.is_omega_reduced())
-    return x.size() == 1 && x.begin()->pointset().is_universe();
-
-  // A powerset is universe iff one of its disjuncts is.
-  for (const_iterator x_i = x.begin(), x_end = x.end(); x_i != x_end; ++x_i)
-    if (x_i->pointset().is_universe()) {
-      // Speculative omega-reduction, if it is worth.
-      if (x.size() > 1) {
-        Pointset_Powerset<PSET> universe(x.space_dimension(), UNIVERSE);
-        Pointset_Powerset& xx = const_cast<Pointset_Powerset&>(x);
-        swap(xx, universe);
-      }
-      return true;
-    }
-  return false;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::is_empty() const {
-  const Pointset_Powerset& x = *this;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (!si->pointset().is_empty())
-      return false;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::is_discrete() const {
-  const Pointset_Powerset& x = *this;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (!si->pointset().is_discrete())
-      return false;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::is_topologically_closed() const {
-  const Pointset_Powerset& x = *this;
-  // The powerset must be omega-reduced before checking
-  // topological closure.
-  x.omega_reduce();
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (!si->pointset().is_topologically_closed())
-      return false;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::is_bounded() const {
-  const Pointset_Powerset& x = *this;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (!si->pointset().is_bounded())
-      return false;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::constrains(Variable var) const {
-  const Pointset_Powerset& x = *this;
-  // `var' should be one of the dimensions of the powerset.
-  const dimension_type var_space_dim = var.space_dimension();
-  if (x.space_dimension() < var_space_dim) {
-    std::ostringstream s;
-    s << "PPL::Pointset_Powerset<PSET>::constrains(v):\n"
-      << "this->space_dimension() == " << x.space_dimension() << ", "
-      << "v.space_dimension() == " << var_space_dim << ".";
-    throw std::invalid_argument(s.str());
-  }
-  // omega_reduction needed, since a redundant disjunct may constrain var.
-  x.omega_reduce();
-  // An empty powerset constrains all variables.
-  if (x.is_empty())
-    return true;
-  for (const_iterator x_i = x.begin(), x_end = x.end(); x_i != x_end; ++x_i)
-    if (x_i->pointset().constrains(var))
-      return true;
-  return false;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::is_disjoint_from(const Pointset_Powerset& y) const {
-  const Pointset_Powerset& x = *this;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         x_s_end = x.sequence.end(); si != x_s_end; ++si) {
-    const PSET& pi = si->pointset();
-    for (Sequence_const_iterator sj = y.sequence.begin(),
-           y_s_end = y.sequence.end(); sj != y_s_end; ++sj) {
-      const PSET& pj = sj->pointset();
-      if (!pi.is_disjoint_from(pj))
-        return false;
-    }
-  }
-  return true;
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::drop_some_non_integer_points(const Variables_Set& vars,
-			       Complexity_Class complexity) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().drop_some_non_integer_points(vars, complexity);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>
-::drop_some_non_integer_points(Complexity_Class complexity) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().drop_some_non_integer_points(complexity);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::topological_closure_assign() {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().topological_closure_assign();
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>
-::intersection_preserving_enlarge_element(PSET& dest) const {
-  // FIXME: this is just an executable specification.
-  const Pointset_Powerset& context = *this;
-  PPL_ASSERT(context.space_dimension() == dest.space_dimension());
-  bool nonempty_intersection = false;
-  // TODO: maybe use a *sorted* constraint system?
-  PSET enlarged(context.space_dimension(), UNIVERSE);
-  for (Sequence_const_iterator si = context.sequence.begin(),
-         s_end = context.sequence.end(); si != s_end; ++si) {
-    PSET context_i(si->pointset());
-    context_i.intersection_assign(enlarged);
-    PSET enlarged_i(dest);
-    if (enlarged_i.simplify_using_context_assign(context_i))
-      nonempty_intersection = true;
-    // TODO: merge the sorted constraints of `enlarged' and `enlarged_i'?
-    enlarged.intersection_assign(enlarged_i);
-  }
-  swap(dest, enlarged);
-  return nonempty_intersection;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>
-::simplify_using_context_assign(const Pointset_Powerset& y) {
-  Pointset_Powerset& x = *this;
-
-  // Omega reduction is required.
-  // TODO: check whether it would be more efficient to Omega-reduce x
-  // during the simplification process: when examining *si, we check
-  // if it has been made redundant by any of the elements preceding it
-  // (which have been already simplified).
-  x.omega_reduce();
-  if (x.is_empty())
-    return false;
-  y.omega_reduce();
-  if (y.is_empty()) {
-    x = y;
-    return false;
-  }
-
-  if (y.size() == 1) {
-    // More efficient, special handling of the singleton context case.
-    const PSET& y_i = y.sequence.begin()->pointset();
-    for (Sequence_iterator si = x.sequence.begin(),
-           s_end = x.sequence.end(); si != s_end; ) {
-      PSET& x_i = si->pointset();
-      if (x_i.simplify_using_context_assign(y_i))
-        ++si;
-      else
-        // Intersection is empty: drop the disjunct.
-        si = x.sequence.erase(si);
-    }
-  }
-  else {
-    // The context is not a singleton.
-    for (Sequence_iterator si = x.sequence.begin(),
-           s_end = x.sequence.end(); si != s_end; ) {
-      if (y.intersection_preserving_enlarge_element(si->pointset()))
-        ++si;
-      else
-        // Intersection with `*si' is empty: drop the disjunct.
-        si = x.sequence.erase(si);
-    }
-  }
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-  return !x.sequence.empty();
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::contains(const Pointset_Powerset& y) const {
-  const Pointset_Powerset& x = *this;
-  for (Sequence_const_iterator si = y.sequence.begin(),
-         y_s_end = y.sequence.end(); si != y_s_end; ++si) {
-    const PSET& pi = si->pointset();
-    bool pi_is_contained = false;
-    for (Sequence_const_iterator sj = x.sequence.begin(),
-           x_s_end = x.sequence.end();
-         (sj != x_s_end && !pi_is_contained);
-         ++sj) {
-      const PSET& pj = sj->pointset();
-      if (pj.contains(pi))
-        pi_is_contained = true;
-    }
-    if (!pi_is_contained)
-      return false;
-  }
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::strictly_contains(const Pointset_Powerset& y) const {
-  /* omega reduction ensures that a disjunct of y cannot be strictly
-     contained in one disjunct and also contained but not strictly
-     contained in another disjunct of *this */
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  for (Sequence_const_iterator si = y.sequence.begin(),
-         y_s_end = y.sequence.end(); si != y_s_end; ++si) {
-    const PSET& pi = si->pointset();
-    bool pi_is_strictly_contained = false;
-    for (Sequence_const_iterator sj = x.sequence.begin(),
-           x_s_end = x.sequence.end();
-         (sj != x_s_end && !pi_is_strictly_contained); ++sj) {
-      const PSET& pj = sj->pointset();
-      if (pj.strictly_contains(pi))
-        pi_is_strictly_contained = true;
-    }
-    if (!pi_is_strictly_contained)
-      return false;
-  }
-  return true;
-}
-
-template <typename PSET>
-Poly_Con_Relation
-Pointset_Powerset<PSET>::relation_with(const Congruence& cg) const {
-  const Pointset_Powerset& x = *this;
-
-  /* *this is included in cg if every disjunct is included in cg */
-  bool is_included = true;
-  /* *this is disjoint with cg if every disjunct is disjoint with cg */
-  bool is_disjoint = true;
-  /* *this strictly_intersects with cg if some disjunct strictly
-     intersects with cg */
-  bool is_strictly_intersecting = false;
-  /* *this saturates cg if some disjunct saturates cg and
-     every disjunct is either disjoint from cg or saturates cg */
-  bool saturates_once = false;
-  bool may_saturate = true;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    Poly_Con_Relation relation_i = si->pointset().relation_with(cg);
-    if (!relation_i.implies(Poly_Con_Relation::is_included()))
-      is_included = false;
-    if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
-      is_disjoint = false;
-    if (relation_i.implies(Poly_Con_Relation::strictly_intersects()))
-      is_strictly_intersecting = true;
-    if (relation_i.implies(Poly_Con_Relation::saturates()))
-      saturates_once = true;
-    else if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
-      may_saturate = false;
-  }
-
-  Poly_Con_Relation result = Poly_Con_Relation::nothing();
-  if (is_included)
-    result = result && Poly_Con_Relation::is_included();
-  if (is_disjoint)
-    result = result && Poly_Con_Relation::is_disjoint();
-  if (is_strictly_intersecting)
-    result = result && Poly_Con_Relation::strictly_intersects();
-  if (saturates_once && may_saturate)
-    result = result && Poly_Con_Relation::saturates();
-
-  return result;
-}
-
-template <typename PSET>
-Poly_Con_Relation
-Pointset_Powerset<PSET>::relation_with(const Constraint& c) const {
-  const Pointset_Powerset& x = *this;
-
-  /* *this is included in c if every disjunct is included in c */
-  bool is_included = true;
-  /* *this is disjoint with c if every disjunct is disjoint with c */
-  bool is_disjoint = true;
-  /* *this strictly_intersects with c if some disjunct strictly
-     intersects with c */
-  bool is_strictly_intersecting = false;
-  /* *this saturates c if some disjunct saturates c and
-     every disjunct is either disjoint from c or saturates c */
-  bool saturates_once = false;
-  bool may_saturate = true;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    Poly_Con_Relation relation_i = si->pointset().relation_with(c);
-    if (!relation_i.implies(Poly_Con_Relation::is_included()))
-      is_included = false;
-    if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
-      is_disjoint = false;
-    if (relation_i.implies(Poly_Con_Relation::strictly_intersects()))
-      is_strictly_intersecting = true;
-    if (relation_i.implies(Poly_Con_Relation::saturates()))
-      saturates_once = true;
-    else if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
-      may_saturate = false;
-  }
-
-  Poly_Con_Relation result = Poly_Con_Relation::nothing();
-  if (is_included)
-    result = result && Poly_Con_Relation::is_included();
-  if (is_disjoint)
-    result = result && Poly_Con_Relation::is_disjoint();
-  if (is_strictly_intersecting)
-    result = result && Poly_Con_Relation::strictly_intersects();
-  if (saturates_once && may_saturate)
-    result = result && Poly_Con_Relation::saturates();
-
-  return result;
-}
-
-template <typename PSET>
-Poly_Gen_Relation
-Pointset_Powerset<PSET>::relation_with(const Generator& g) const {
-  const Pointset_Powerset& x = *this;
-
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    Poly_Gen_Relation relation_i = si->pointset().relation_with(g);
-    if (relation_i.implies(Poly_Gen_Relation::subsumes()))
-      return Poly_Gen_Relation::subsumes();
-  }
-
-  return Poly_Gen_Relation::nothing();
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>
-::bounds_from_above(const Linear_Expression& expr) const {
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (!si->pointset().bounds_from_above(expr))
-      return false;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>
-::bounds_from_below(const Linear_Expression& expr) const {
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (!si->pointset().bounds_from_below(expr))
-      return false;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::maximize(const Linear_Expression& expr,
-                                  Coefficient& sup_n,
-                                  Coefficient& sup_d,
-                                  bool& maximum) const {
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  if (x.is_empty())
-    return false;
-
-  bool first = true;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_d);
-  best_sup_n = 0;
-  best_sup_d = 1;
-  bool best_max = false;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_d);
-  iter_sup_n = 0;
-  iter_sup_d = 1;
-  bool iter_max = false;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    if (!si->pointset().maximize(expr, iter_sup_n, iter_sup_d, iter_max))
-      return false;
-    else
-      if (first) {
-        first = false;
-        best_sup_n = iter_sup_n;
-        best_sup_d = iter_sup_d;
-        best_max = iter_max;
-      }
-      else {
-        tmp = (best_sup_n * iter_sup_d) - (iter_sup_n * best_sup_d);
-        if (tmp < 0) {
-          best_sup_n = iter_sup_n;
-          best_sup_d = iter_sup_d;
-          best_max = iter_max;
-        }
-        else if (tmp == 0)
-          best_max = (best_max || iter_max);
-      }
-  }
-  sup_n = best_sup_n;
-  sup_d = best_sup_d;
-  maximum = best_max;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::maximize(const Linear_Expression& expr,
-                                  Coefficient& sup_n,
-                                  Coefficient& sup_d,
-                                  bool& maximum,
-                                  Generator& g) const {
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  if (x.is_empty())
-    return false;
-
-  bool first = true;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_d);
-  best_sup_n = 0;
-  best_sup_d = 1;
-  bool best_max = false;
-  Generator best_g = point();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_d);
-  iter_sup_n = 0;
-  iter_sup_d = 1;
-  bool iter_max = false;
-  Generator iter_g = point();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    if (!si->pointset().maximize(expr,
-                                 iter_sup_n, iter_sup_d, iter_max, iter_g))
-      return false;
-    else
-      if (first) {
-        first = false;
-        best_sup_n = iter_sup_n;
-        best_sup_d = iter_sup_d;
-        best_max = iter_max;
-        best_g = iter_g;
-      }
-      else {
-        tmp = (best_sup_n * iter_sup_d) - (iter_sup_n * best_sup_d);
-        if (tmp < 0) {
-          best_sup_n = iter_sup_n;
-          best_sup_d = iter_sup_d;
-          best_max = iter_max;
-          best_g = iter_g;
-        }
-        else if (tmp == 0) {
-          best_max = (best_max || iter_max);
-          best_g = iter_g;
-        }
-      }
-  }
-  sup_n = best_sup_n;
-  sup_d = best_sup_d;
-  maximum = best_max;
-  g = best_g;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::minimize(const Linear_Expression& expr,
-                                  Coefficient& inf_n,
-                                  Coefficient& inf_d,
-                                  bool& minimum) const {
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  if (x.is_empty())
-    return false;
-
-  bool first = true;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_d);
-  best_inf_n = 0;
-  best_inf_d = 1;
-  bool best_min = false;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_d);
-  iter_inf_n = 0;
-  iter_inf_d = 1;
-  bool iter_min = false;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    if (!si->pointset().minimize(expr, iter_inf_n, iter_inf_d, iter_min))
-      return false;
-    else
-      if (first) {
-        first = false;
-        best_inf_n = iter_inf_n;
-        best_inf_d = iter_inf_d;
-        best_min = iter_min;
-      }
-      else {
-        tmp = (best_inf_n * iter_inf_d) - (iter_inf_n * best_inf_d);
-        if (tmp > 0) {
-          best_inf_n = iter_inf_n;
-          best_inf_d = iter_inf_d;
-          best_min = iter_min;
-        }
-        else if (tmp == 0)
-          best_min = (best_min || iter_min);
-      }
-  }
-  inf_n = best_inf_n;
-  inf_d = best_inf_d;
-  minimum = best_min;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::minimize(const Linear_Expression& expr,
-                                  Coefficient& inf_n,
-                                  Coefficient& inf_d,
-                                  bool& minimum,
-                                  Generator& g) const {
-  const Pointset_Powerset& x = *this;
-  x.omega_reduce();
-  if (x.is_empty())
-    return false;
-
-  bool first = true;
-
-  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_d);
-  best_inf_n = 0;
-  best_inf_d = 1;
-  bool best_min = false;
-  Generator best_g = point();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_d);
-  iter_inf_n = 0;
-  iter_inf_d = 1;
-  bool iter_min = false;
-  Generator iter_g = point();
-
-  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
-
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si) {
-    if (!si->pointset().minimize(expr,
-                                 iter_inf_n, iter_inf_d, iter_min, iter_g))
-      return false;
-    else
-      if (first) {
-        first = false;
-        best_inf_n = iter_inf_n;
-        best_inf_d = iter_inf_d;
-        best_min = iter_min;
-        best_g = iter_g;
-      }
-      else {
-        tmp = (best_inf_n * iter_inf_d) - (iter_inf_n * best_inf_d);
-        if (tmp > 0) {
-          best_inf_n = iter_inf_n;
-          best_inf_d = iter_inf_d;
-          best_min = iter_min;
-          best_g = iter_g;
-        }
-        else if (tmp == 0) {
-          best_min = (best_min || iter_min);
-          best_g = iter_g;
-        }
-      }
-  }
-  inf_n = best_inf_n;
-  inf_d = best_inf_d;
-  minimum = best_min;
-  g = best_g;
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::contains_integer_point() const {
-  const Pointset_Powerset& x = *this;
-  for (Sequence_const_iterator si = x.sequence.begin(),
-         s_end = x.sequence.end(); si != s_end; ++si)
-    if (si->pointset().contains_integer_point())
-      return true;
-  return false;
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::wrap_assign(const Variables_Set& vars,
-                                     Bounded_Integer_Type_Width w,
-                                     Bounded_Integer_Type_Representation r,
-                                     Bounded_Integer_Type_Overflow o,
-                                     const Constraint_System* cs_p,
-                                     unsigned complexity_threshold,
-                                     bool wrap_individually) {
-  Pointset_Powerset& x = *this;
-  for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
-    si->pointset().wrap_assign(vars, w, r, o, cs_p,
-                               complexity_threshold, wrap_individually);
-  x.reduced = false;
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::pairwise_reduce() {
-  Pointset_Powerset& x = *this;
-  // It is wise to omega-reduce before pairwise-reducing.
-  x.omega_reduce();
-
-  size_type n = x.size();
-  size_type deleted;
-  do {
-    Pointset_Powerset new_x(x.space_dim, EMPTY);
-    std::deque<bool> marked(n, false);
-    deleted = 0;
-    Sequence_iterator s_begin = x.sequence.begin();
-    Sequence_iterator s_end = x.sequence.end();
-    unsigned si_index = 0;
-    for (Sequence_iterator si = s_begin; si != s_end; ++si, ++si_index) {
-      if (marked[si_index])
-	continue;
-      PSET& pi = si->pointset();
-      Sequence_const_iterator sj = si;
-      unsigned sj_index = si_index;
-      for (++sj, ++sj_index; sj != s_end; ++sj, ++sj_index) {
-	if (marked[sj_index])
-	  continue;
-	const PSET& pj = sj->pointset();
-	if (pi.upper_bound_assign_if_exact(pj)) {
-	  marked[si_index] = true;
-          marked[sj_index] = true;
-	  new_x.add_non_bottom_disjunct_preserve_reduction(pi);
-	  ++deleted;
-	  goto next;
-	}
-      }
-    next:
-      ;
-    }
-    iterator new_x_begin = new_x.begin();
-    iterator new_x_end = new_x.end();
-    unsigned xi_index = 0;
-    for (const_iterator xi = x.begin(),
-	   x_end = x.end(); xi != x_end; ++xi, ++xi_index)
-      if (!marked[xi_index])
-	new_x_begin
-          = new_x.add_non_bottom_disjunct_preserve_reduction(*xi,
-                                                             new_x_begin,
-                                                             new_x_end);
-    using std::swap;
-    swap(x.sequence, new_x.sequence);
-    n -= deleted;
-  } while (deleted > 0);
-  PPL_ASSERT_HEAVY(x.OK());
-}
-
-template <typename PSET>
-template <typename Widening>
-void
-Pointset_Powerset<PSET>::
-BGP99_heuristics_assign(const Pointset_Powerset& y, Widening widen_fun) {
-  // `x' is the current iteration value.
-  Pointset_Powerset& x = *this;
-
-#ifndef NDEBUG
-  {
-    // We assume that `y' entails `x'.
-    const Pointset_Powerset<PSET> x_copy = x;
-    const Pointset_Powerset<PSET> y_copy = y;
-    PPL_ASSERT_HEAVY(y_copy.definitely_entails(x_copy));
-  }
-#endif
-
-  size_type n = x.size();
-  Pointset_Powerset new_x(x.space_dim, EMPTY);
-  std::deque<bool> marked(n, false);
-  const_iterator x_begin = x.begin();
-  const_iterator x_end = x.end();
-  unsigned i_index = 0;
-  for (const_iterator i = x_begin,
-	 y_begin = y.begin(), y_end = y.end(); i != x_end; ++i, ++i_index)
-    for (const_iterator j = y_begin; j != y_end; ++j) {
-      const PSET& pi = i->pointset();
-      const PSET& pj = j->pointset();
-      if (pi.contains(pj)) {
-	PSET pi_copy = pi;
-	widen_fun(pi_copy, pj);
-	new_x.add_non_bottom_disjunct_preserve_reduction(pi_copy);
-	marked[i_index] = true;
-      }
-    }
-  iterator new_x_begin = new_x.begin();
-  iterator new_x_end = new_x.end();
-  i_index = 0;
-  for (const_iterator i = x_begin; i != x_end; ++i, ++i_index)
-    if (!marked[i_index])
-      new_x_begin
-        = new_x.add_non_bottom_disjunct_preserve_reduction(*i,
-                                                           new_x_begin,
-                                                           new_x_end);
-  using std::swap;
-  swap(x.sequence, new_x.sequence);
-  PPL_ASSERT_HEAVY(x.OK());
-  PPL_ASSERT(x.is_omega_reduced());
-}
-
-template <typename PSET>
-template <typename Widening>
-void
-Pointset_Powerset<PSET>::
-BGP99_extrapolation_assign(const Pointset_Powerset& y,
-			   Widening widen_fun,
-			   unsigned max_disjuncts) {
-  // `x' is the current iteration value.
-  Pointset_Powerset& x = *this;
-
-#ifndef NDEBUG
-  {
-    // We assume that `y' entails `x'.
-    const Pointset_Powerset<PSET> x_copy = x;
-    const Pointset_Powerset<PSET> y_copy = y;
-    PPL_ASSERT_HEAVY(y_copy.definitely_entails(x_copy));
-  }
-#endif
-
-  x.pairwise_reduce();
-  if (max_disjuncts != 0)
-    x.collapse(max_disjuncts);
-  x.BGP99_heuristics_assign(y, widen_fun);
-}
-
-template <typename PSET>
-template <typename Cert>
-void
-Pointset_Powerset<PSET>::
-collect_certificates(std::map<Cert, size_type,
-                     typename Cert::Compare>& cert_ms) const {
-  const Pointset_Powerset& x = *this;
-  PPL_ASSERT(x.is_omega_reduced());
-  PPL_ASSERT(cert_ms.size() == 0);
-  for (const_iterator i = x.begin(), end = x.end(); i != end; ++i) {
-    Cert ph_cert(i->pointset());
-    ++cert_ms[ph_cert];
-  }
-}
-
-template <typename PSET>
-template <typename Cert>
-bool
-Pointset_Powerset<PSET>::
-is_cert_multiset_stabilizing(const std::map<Cert, size_type,
-                             typename Cert::Compare>& y_cert_ms) const {
-  typedef std::map<Cert, size_type, typename Cert::Compare> Cert_Multiset;
-  Cert_Multiset x_cert_ms;
-  collect_certificates(x_cert_ms);
-  typename Cert_Multiset::const_iterator
-    xi = x_cert_ms.begin(),
-    x_cert_ms_end = x_cert_ms.end(),
-    yi = y_cert_ms.begin(),
-    y_cert_ms_end = y_cert_ms.end();
-  while (xi != x_cert_ms_end && yi != y_cert_ms_end) {
-    const Cert& xi_cert = xi->first;
-    const Cert& yi_cert = yi->first;
-    switch (xi_cert.compare(yi_cert)) {
-    case 0:
-      // xi_cert == yi_cert: check the number of multiset occurrences.
-      {
-	const size_type& xi_count = xi->second;
-	const size_type& yi_count = yi->second;
-	if (xi_count == yi_count) {
-	  // Same number of occurrences: compare the next pair.
-	  ++xi;
-	  ++yi;
-	}
-	else
-	  // Different number of occurrences: can decide ordering.
-	  return xi_count < yi_count;
-	break;
-      }
-    case 1:
-      // xi_cert > yi_cert: it is not stabilizing.
-      return false;
-
-    case -1:
-      // xi_cert < yi_cert: it is stabilizing.
-      return true;
-    }
-  }
-  // Here xi == x_cert_ms_end or yi == y_cert_ms_end.
-  // Stabilization is achieved if `y_cert_ms' still has other elements.
-  return yi != y_cert_ms_end;
-}
-
-template <typename PSET>
-template <typename Cert, typename Widening>
-void
-Pointset_Powerset<PSET>::BHZ03_widening_assign(const Pointset_Powerset& y,
-                                               Widening widen_fun) {
-  // `x' is the current iteration value.
-  Pointset_Powerset& x = *this;
-
-#ifndef NDEBUG
-  {
-    // We assume that `y' entails `x'.
-    const Pointset_Powerset<PSET> x_copy = x;
-    const Pointset_Powerset<PSET> y_copy = y;
-    PPL_ASSERT_HEAVY(y_copy.definitely_entails(x_copy));
-  }
-#endif
-
-  // First widening technique: do nothing.
-
-  // If `y' is the empty collection, do nothing.
-  PPL_ASSERT(x.size() > 0);
-  if (y.size() == 0)
-    return;
-
-  // Compute the poly-hull of `x'.
-  PSET x_hull(x.space_dim, EMPTY);
-  for (const_iterator i = x.begin(), x_end = x.end(); i != x_end; ++i)
-    x_hull.upper_bound_assign(i->pointset());
-
-  // Compute the poly-hull of `y'.
-  PSET y_hull(y.space_dim, EMPTY);
-  for (const_iterator i = y.begin(), y_end = y.end(); i != y_end; ++i)
-    y_hull.upper_bound_assign(i->pointset());
-  // Compute the certificate for `y_hull'.
-  const Cert y_hull_cert(y_hull);
-
-  // If the hull is stabilizing, do nothing.
-  int hull_stabilization = y_hull_cert.compare(x_hull);
-  if (hull_stabilization == 1)
-    return;
-
-  // Multiset ordering is only useful when `y' is not a singleton.
-  const bool y_is_not_a_singleton = y.size() > 1;
-
-  // The multiset certificate for `y':
-  // we want to be lazy about its computation.
-  typedef std::map<Cert, size_type, typename Cert::Compare> Cert_Multiset;
-  Cert_Multiset y_cert_ms;
-  bool y_cert_ms_computed = false;
-
-  if (hull_stabilization == 0 && y_is_not_a_singleton) {
-    // Collect the multiset certificate for `y'.
-    y.collect_certificates(y_cert_ms);
-    y_cert_ms_computed = true;
-    // If multiset ordering is stabilizing, do nothing.
-    if (x.is_cert_multiset_stabilizing(y_cert_ms))
-      return;
-  }
-
-  // Second widening technique: try the BGP99 powerset heuristics.
-  Pointset_Powerset<PSET> bgp99_heuristics = x;
-  bgp99_heuristics.BGP99_heuristics_assign(y, widen_fun);
-
-  // Compute the poly-hull of `bgp99_heuristics'.
-  PSET bgp99_heuristics_hull(x.space_dim, EMPTY);
-  for (const_iterator i = bgp99_heuristics.begin(),
-	 b_h_end = bgp99_heuristics.end(); i != b_h_end; ++i)
-    bgp99_heuristics_hull.upper_bound_assign(i->pointset());
-
-  // Check for stabilization and, if successful,
-  // commit to the result of the extrapolation.
-  hull_stabilization = y_hull_cert.compare(bgp99_heuristics_hull);
-  if (hull_stabilization == 1) {
-    // The poly-hull is stabilizing.
-    swap(x, bgp99_heuristics);
-    return;
-  }
-  else if (hull_stabilization == 0 && y_is_not_a_singleton) {
-    // If not already done, compute multiset certificate for `y'.
-    if (!y_cert_ms_computed) {
-      y.collect_certificates(y_cert_ms);
-      y_cert_ms_computed = true;
-    }
-    if (bgp99_heuristics.is_cert_multiset_stabilizing(y_cert_ms)) {
-      swap(x, bgp99_heuristics);
-      return;
-    }
-    // Third widening technique: pairwise-reduction on `bgp99_heuristics'.
-    // Note that pairwise-reduction does not affect the computation
-    // of the poly-hulls, so that we only have to check the multiset
-    // certificate relation.
-    Pointset_Powerset<PSET> reduced_bgp99_heuristics(bgp99_heuristics);
-    reduced_bgp99_heuristics.pairwise_reduce();
-    if (reduced_bgp99_heuristics.is_cert_multiset_stabilizing(y_cert_ms)) {
-      swap(x, reduced_bgp99_heuristics);
-      return;
-    }
-  }
-
-  // Fourth widening technique: this is applicable only when
-  // `y_hull' is a proper subset of `bgp99_heuristics_hull'.
-  if (bgp99_heuristics_hull.strictly_contains(y_hull)) {
-    // Compute (y_hull \widen bgp99_heuristics_hull).
-    PSET ph = bgp99_heuristics_hull;
-    widen_fun(ph, y_hull);
-    // Compute the difference between `ph' and `bgp99_heuristics_hull'.
-    ph.difference_assign(bgp99_heuristics_hull);
-    x.add_disjunct(ph);
-    return;
-  }
-
-  // Fall back to the computation of the poly-hull.
-  Pointset_Powerset<PSET> x_hull_singleton(x.space_dim, EMPTY);
-  x_hull_singleton.add_disjunct(x_hull);
-  swap(x, x_hull_singleton);
-}
-
-template <typename PSET>
-void
-Pointset_Powerset<PSET>::ascii_dump(std::ostream& s) const {
-  const Pointset_Powerset& x = *this;
-  s << "size " << x.size()
-    << "\nspace_dim " << x.space_dim
-    << "\n";
-  for (const_iterator xi = x.begin(), x_end = x.end(); xi != x_end; ++xi)
-    xi->pointset().ascii_dump(s);
-}
-
-PPL_OUTPUT_TEMPLATE_DEFINITIONS(PSET, Pointset_Powerset<PSET>)
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::ascii_load(std::istream& s) {
-  Pointset_Powerset& x = *this;
-  std::string str;
-
-  if (!(s >> str) || str != "size")
-    return false;
-
-  size_type sz;
-
-  if (!(s >> sz))
-    return false;
-
-  if (!(s >> str) || str != "space_dim")
-    return false;
-
-  if (!(s >> x.space_dim))
-    return false;
-
-  Pointset_Powerset new_x(x.space_dim, EMPTY);
-  while (sz-- > 0) {
-    PSET ph;
-    if (!ph.ascii_load(s))
-      return false;
-    new_x.add_disjunct(ph);
-  }
-  swap(x, new_x);
-
-  // Check invariants.
-  PPL_ASSERT_HEAVY(x.OK());
-  return true;
-}
-
-template <typename PSET>
-bool
-Pointset_Powerset<PSET>::OK() const {
-  const Pointset_Powerset& x = *this;
-  for (const_iterator xi = x.begin(), x_end = x.end(); xi != x_end; ++xi) {
-    const PSET& pi = xi->pointset();
-    if (pi.space_dimension() != x.space_dim) {
-#ifndef NDEBUG
-      std::cerr << "Space dimension mismatch: is " << pi.space_dimension()
-		<< " in an element of the sequence,\nshould be "
-		<< x.space_dim << "."
-		<< std::endl;
-#endif
-      return false;
-    }
-  }
-  return x.Base::OK();
-}
-
-namespace Implementation {
-
-namespace Pointset_Powersets {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Partitions polyhedron \p pset according to constraint \p c.
-/*! \relates Parma_Polyhedra_Library::Pointset_Powerset
-  On exit, the intersection of \p pset and constraint \p c is stored
-  in \p pset, whereas the intersection of \p pset with the negation of \p c
-  is added as a new disjunct of the powerset \p r.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename PSET>
-void
-linear_partition_aux(const Constraint& c,
-		     PSET& pset,
-		     Pointset_Powerset<NNC_Polyhedron>& r) {
-  Linear_Expression le(c);
-  const Constraint& neg_c = c.is_strict_inequality() ? (le <= 0) : (le < 0);
-  NNC_Polyhedron nnc_ph_pset(pset);
-  nnc_ph_pset.add_constraint(neg_c);
-  if (!nnc_ph_pset.is_empty())
-    r.add_disjunct(nnc_ph_pset);
-  pset.add_constraint(c);
-}
-
-} // namespace Pointset_Powersets
-
-} // namespace Implementation
-
-
-/*! \relates Pointset_Powerset */
-template <typename PSET>
-std::pair<PSET, Pointset_Powerset<NNC_Polyhedron> >
-linear_partition(const PSET& p, const PSET& q) {
-  using Implementation::Pointset_Powersets::linear_partition_aux;
-
-  Pointset_Powerset<NNC_Polyhedron> r(p.space_dimension(), EMPTY);
-  PSET pset = q;
-  const Constraint_System& p_constraints = p.constraints();
-  for (Constraint_System::const_iterator i = p_constraints.begin(),
-	 p_constraints_end = p_constraints.end();
-       i != p_constraints_end;
-       ++i) {
-    const Constraint& c = *i;
-    if (c.is_equality()) {
-      Linear_Expression le(c);
-      linear_partition_aux(le <= 0, pset, r);
-      linear_partition_aux(le >= 0, pset, r);
-    }
-    else
-      linear_partition_aux(c, pset, r);
-  }
-  return std::make_pair(pset, r);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pointset_Powerset_templates_hh)
diff --git a/src/Pointset_Powerset.types.hh b/src/Pointset_Powerset.types.hh
deleted file mode 100644
index 637a52a..0000000
--- a/src/Pointset_Powerset.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Pointset_Powerset_types_hh
-#define PPL_Pointset_Powerset_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-class Pointset_Powerset;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Pointset_Powerset_types_hh)
diff --git a/src/Pointset_Powerset_defs.hh b/src/Pointset_Powerset_defs.hh
new file mode 100644
index 0000000..7d33bf8
--- /dev/null
+++ b/src/Pointset_Powerset_defs.hh
@@ -0,0 +1,1449 @@
+/* Pointset_Powerset class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pointset_Powerset_defs_hh
+#define PPL_Pointset_Powerset_defs_hh
+
+#include "Pointset_Powerset_types.hh"
+#include "globals_defs.hh"
+#include "BHRZ03_Certificate_types.hh"
+#include "Constraint_types.hh"
+#include "Constraint_System_types.hh"
+#include "Congruence_types.hh"
+#include "Congruence_System_types.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Polyhedron_defs.hh"
+#include "Grid_defs.hh"
+#include "Partially_Reduced_Product_defs.hh"
+#include "Variables_Set_types.hh"
+#include "Determinate_defs.hh"
+#include "Powerset_defs.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include <iosfwd>
+#include <list>
+#include <map>
+
+//! The powerset construction instantiated on PPL pointset domains.
+/*! \ingroup PPL_CXX_interface
+  \warning
+  At present, the supported instantiations for the
+  disjunct domain template \p PSET are the simple pointset domains:
+  <CODE>C_Polyhedron</CODE>,
+  <CODE>NNC_Polyhedron</CODE>,
+  <CODE>Grid</CODE>,
+  <CODE>Octagonal_Shape\<T\></CODE>,
+  <CODE>BD_Shape\<T\></CODE>,
+  <CODE>Box\<T\></CODE>.
+*/
+template <typename PSET>
+class Parma_Polyhedra_Library::Pointset_Powerset
+  : public Parma_Polyhedra_Library::Powerset
+<Parma_Polyhedra_Library::Determinate<PSET> > {
+public:
+  typedef PSET element_type;
+
+private:
+  typedef Determinate<PSET> Det_PSET;
+  typedef Powerset<Det_PSET> Base;
+
+public:
+  //! Returns the maximum space dimension a Pointset_Powerset<PSET> can handle.
+  static dimension_type max_space_dimension();
+
+  //! \name Constructors
+  //@{
+
+  //! Builds a universe (top) or empty (bottom) Pointset_Powerset.
+  /*!
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the powerset;
+
+    \param kind
+    Specifies whether the universe or the empty powerset has to be built.
+  */
+  explicit
+  Pointset_Powerset(dimension_type num_dimensions = 0,
+                    Degenerate_Element kind = UNIVERSE);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  Pointset_Powerset(const Pointset_Powerset& y,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    Conversion constructor: the type <CODE>QH</CODE> of the disjuncts
+    in the source powerset is different from <CODE>PSET</CODE>.
+
+    \param y
+    The powerset to be used to build the new powerset.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+  */
+  template <typename QH>
+  explicit Pointset_Powerset(const Pointset_Powerset<QH>& y,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    Creates a Pointset_Powerset from a product
+    This will be created as a single disjunct of type PSET that
+    approximates the product.
+  */
+  template <typename QH1, typename QH2, typename R>
+  explicit
+  Pointset_Powerset(const Partially_Reduced_Product<QH1, QH2, R>& prp,
+                    Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    Creates a Pointset_Powerset with a single disjunct approximating
+    the system of constraints \p cs.
+  */
+  explicit Pointset_Powerset(const Constraint_System& cs);
+
+  /*! \brief
+    Creates a Pointset_Powerset with a single disjunct approximating
+    the system of congruences \p cgs.
+  */
+  explicit Pointset_Powerset(const Congruence_System& cgs);
+
+
+  //! Builds a pointset_powerset out of a closed polyhedron.
+  /*!
+    Builds a powerset that is either empty (if the polyhedron is found
+    to be empty) or contains a single disjunct approximating the
+    polyhedron; this must only use algorithms that do not exceed the
+    specified complexity.  The powerset inherits the space dimension
+    of the polyhedron.
+
+    \param ph
+    The closed polyhedron to be used to build the powerset.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p ph exceeds the maximum
+    allowed space dimension.
+  */
+  explicit Pointset_Powerset(const C_Polyhedron& ph,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a pointset_powerset out of an nnc polyhedron.
+  /*!
+    Builds a powerset that is either empty (if the polyhedron is found
+    to be empty) or contains a single disjunct approximating the
+    polyhedron; this must only use algorithms that do not exceed the
+    specified complexity.  The powerset inherits the space dimension
+    of the polyhedron.
+
+    \param ph
+    The closed polyhedron to be used to build the powerset.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p ph exceeds the maximum
+    allowed space dimension.
+  */
+  explicit Pointset_Powerset(const NNC_Polyhedron& ph,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+
+  //! Builds a pointset_powerset out of a grid.
+  /*!
+    If the grid is nonempty, builds a powerset containing a single
+    disjunct approximating the grid. Builds the empty powerset
+    otherwise. The powerset inherits the space dimension of the grid.
+
+    \param gr
+    The grid to be used to build the powerset.
+
+    \param complexity
+    This argument is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p gr exceeds the maximum
+    allowed space dimension.
+  */
+  explicit Pointset_Powerset(const Grid& gr,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a pointset_powerset out of an octagonal shape.
+  /*!
+    If the octagonal shape is nonempty, builds a powerset
+    containing a single disjunct approximating the octagonal
+    shape. Builds the empty powerset otherwise. The powerset
+    inherits the space dimension of the octagonal shape.
+
+    \param os
+    The octagonal shape to be used to build the powerset.
+
+    \param complexity
+    This argument is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p os exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename T>
+  explicit Pointset_Powerset(const Octagonal_Shape<T>& os,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a pointset_powerset out of a bd shape.
+  /*!
+    If the bd shape is nonempty, builds a powerset containing a
+    single disjunct approximating the bd shape. Builds the empty
+    powerset otherwise.  The powerset inherits the space dimension
+    of the bd shape.
+
+    \param bds
+    The bd shape to be used to build the powerset.
+
+    \param complexity
+    This argument is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p bds exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename T>
+  explicit Pointset_Powerset(const BD_Shape<T>& bds,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a pointset_powerset out of a box.
+  /*!
+    If the box is nonempty, builds a powerset containing a single
+    disjunct approximating the box. Builds the empty powerset
+    otherwise.  The powerset inherits the space dimension of the box.
+
+    \param box
+    The box to be used to build the powerset.
+
+    \param complexity
+    This argument is ignored.
+
+    \exception std::length_error
+    Thrown if the space dimension of \p box exceeds the maximum
+    allowed space dimension.
+  */
+  template <typename Interval>
+  explicit Pointset_Powerset(const Box<Interval>& box,
+                             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //@} // Constructors and Destructor
+
+  //! \name Member Functions that Do Not Modify the Pointset_Powerset
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type affine_dimension() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is
+    an empty powerset.
+  */
+  bool is_empty() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is the top element of the powerset lattice.
+  */
+  bool is_universe() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the disjuncts
+    in \p *this are topologically closed.
+  */
+  bool is_topologically_closed() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all elements in \p *this
+    are bounded.
+  */
+  bool is_bounded() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool is_disjoint_from(const Pointset_Powerset& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
+  bool is_discrete() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+
+    \note
+    A variable is constrained if there exists a non-redundant disjunct
+    that is constraining the variable: this definition relies on the
+    powerset lattice structure and may be somewhat different from the
+    geometric intuition.
+    For instance, variable \f$x\f$ is constrained in the powerset
+    \f[
+      \mathit{ps} = \bigl\{ \{ x \geq 0 \}, \{ x \leq 0 \} \bigr\},
+    \f]
+    even though \f$\mathit{ps}\f$ is geometrically equal to the
+    whole vector space.
+  */
+  bool constrains(Variable var) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from above in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from below in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
+    and \p maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value;
+
+    \param g
+    When maximization succeeds, will be assigned the point or
+    closure point where \p expr reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p g are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value;
+
+    \param g
+    When minimization succeeds, will be assigned a point or
+    closure point where \p expr reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p g are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this geometrically
+    covers \p y, i.e., if any point (in some element) of \p y is also
+    a point (of some element) of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \warning
+    This may be <EM>really</EM> expensive!
+  */
+  bool geometrically_covers(const Pointset_Powerset& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is geometrically
+    equal to \p y, i.e., if (the elements of) \p *this and \p y
+    contain the same set of points.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \warning
+    This may be <EM>really</EM> expensive!
+  */
+  bool geometrically_equals(const Pointset_Powerset& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if each disjunct
+      of \p y is contained in a disjunct of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool contains(const Pointset_Powerset& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if each disjunct
+      of \p y is strictly contained in a disjunct of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool strictly_contains(const Pointset_Powerset& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains at least one integer point.
+  */
+  bool contains_integer_point() const;
+
+  /*! \brief
+    Returns the relations holding between the powerset \p *this
+    and the constraint \p c.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  /*! \brief
+    Returns the relations holding between the powerset \p *this
+    and the generator \p g.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  Poly_Gen_Relation relation_with(const Generator& g) const;
+
+  /*! \brief
+    Returns the relations holding between the powerset \p *this
+    and the congruence \p c.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a lower bound to the size in bytes of the memory
+    managed by \p *this.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If \p x and \p y are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //@} // Member Functions that Do Not Modify the Pointset_Powerset
+
+  //! \name Space Dimension Preserving Member Functions that May Modify the Pointset_Powerset
+  //@{
+
+  //! Adds to \p *this the disjunct \p ph.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p ph are dimension-incompatible.
+  */
+  void add_disjunct(const PSET& ph);
+
+  //! Intersects \p *this with constraint \p c.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are topology-incompatible
+    or dimension-incompatible.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Use the constraint \p c to refine \p *this.
+
+    \param c
+    The constraint to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  //! Intersects \p *this with the constraints in \p cs.
+  /*!
+    \param cs
+    The constraints to intersect with.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Use the constraints in \p cs to refine \p *this.
+
+    \param  cs
+     The constraints to be used for refinement.
+
+     \exception std::invalid_argument
+     Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  //! Intersects \p *this with congruence \p cg.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are topology-incompatible
+    or dimension-incompatible.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Use the congruence \p cg to refine \p *this.
+
+    \param cg
+    The congruence to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+  //! Intersects \p *this with the congruences in \p cgs.
+  /*!
+    \param cgs
+    The congruences to intersect with.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Use the congruences in \p cgs to refine \p *this.
+
+    \param  cgs
+    The congruences to be used for refinement.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  //! Assigns to \p *this the intersection of \p *this and \p y.
+  /*!
+    The result is obtained by intersecting each disjunct in \p *this
+    with each disjunct in \p y and collecting all these intersections.
+  */
+  void intersection_assign(const Pointset_Powerset& y);
+
+  /*! \brief
+    Assigns to \p *this an (a smallest)
+    over-approximation as a powerset of the disjunct domain of the
+    set-theoretical difference of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  void difference_assign(const Pointset_Powerset& y);
+
+  /*! \brief
+    Assigns to \p *this a \ref Powerset_Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+    If \c false is returned, then the intersection is empty.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool simplify_using_context_assign(const Pointset_Powerset& y);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine image"
+    of \p *this under the function mapping variable \p var to the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of
+    \p *this.
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine preimage"
+    of \p *this under the function mapping variable \p var to the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of
+    \p *this.
+  */
+  void affine_preimage(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_image(Variable var,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                  = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void
+  generalized_affine_preimage(Variable var,
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_image(const Linear_Expression& lhs,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_preimage(const Linear_Expression& lhs,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
+
+  /*!
+    \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+  /*!
+    \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
+
+    The result is obtained by computing the pairwise
+    \ref Time_Elapse_Operator "time elapse" of each disjunct
+    in \p *this with each disjunct in \p y.
+  */
+  void time_elapse_assign(const Pointset_Powerset& y);
+
+  /*! \brief
+    \ref Wrapping_Operator "Wraps" the specified dimensions of the
+    vector space.
+
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be wrapped.
+
+    \param w
+    The width of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param r
+    The representation of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param o
+    The overflow behavior of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param cs_p
+    Possibly null pointer to a constraint system whose variables
+    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
+    variables not in \p vars, the behavior is undefined.
+    When non-null, the pointed-to constraint system is assumed to
+    represent the conditional or looping construct guard with respect
+    to which wrapping is performed.  Since wrapping requires the
+    computation of upper bounds and due to non-distributivity of
+    constraint refinement over upper bounds, passing a constraint
+    system in this way can be more precise than refining the result of
+    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
+
+    \param complexity_threshold
+    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
+    higher values result in possibly improved precision.
+
+    \param wrap_individually
+    <CODE>true</CODE> if the dimensions should be wrapped individually
+    (something that results in much greater efficiency to the detriment of
+    precision).
+
+    \exception std::invalid_argument
+    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
+    \p vars, or if \p *this is dimension-incompatible \p vars or with
+    <CODE>*cs_p</CODE>.
+  */
+  void wrap_assign(const Variables_Set& vars,
+                   Bounded_Integer_Type_Width w,
+                   Bounded_Integer_Type_Representation r,
+                   Bounded_Integer_Type_Overflow o,
+                   const Constraint_System* cs_p = 0,
+                   unsigned complexity_threshold = 16,
+                   bool wrap_individually = true);
+
+  /*! \brief
+    Assign to \p *this the result of (recursively) merging together
+    the pairs of disjuncts whose upper-bound is the same as their
+    set-theoretical union.
+
+    On exit, for all the pairs \f$\cP\f$, \f$\cQ\f$ of different disjuncts
+    in \p *this, we have \f$\cP \uplus \cQ \neq \cP \union \cQ\f$.
+  */
+  void pairwise_reduce();
+
+  /*! \brief
+    Assigns to \p *this the result of applying the
+    \ref pps_bgp99_extrapolation "BGP99 extrapolation operator"
+    to \p *this and \p y, using the widening function \p widen_fun
+    and the cardinality threshold \p max_disjuncts.
+
+    \param y
+    A powerset that <EM>must</EM> definitely entail \p *this;
+
+    \param widen_fun
+    The widening function to be used on polyhedra objects. It is obtained
+    from the corresponding widening method by using the helper function
+    Parma_Polyhedra_Library::widen_fun_ref. Legal values are, e.g.,
+    <CODE>widen_fun_ref(&Polyhedron::H79_widening_assign)</CODE> and
+    <CODE>widen_fun_ref(&Polyhedron::limited_H79_extrapolation_assign, cs)</CODE>;
+
+    \param max_disjuncts
+    The maximum number of disjuncts occurring in the powerset \p *this
+    <EM>before</EM> starting the computation. If this number is exceeded,
+    some of the disjuncts in \p *this are collapsed (i.e., joined together).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    For a description of the extrapolation operator,
+    see \ref BGP99 "[BGP99]" and \ref BHZ03b "[BHZ03b]".
+  */
+  template <typename Widening>
+  void BGP99_extrapolation_assign(const Pointset_Powerset& y,
+                                  Widening widen_fun,
+                                  unsigned max_disjuncts);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref pps_certificate_widening "BHZ03-widening"
+    between \p *this and \p y, using the widening function \p widen_fun
+    certified by the convergence certificate \p Cert.
+
+    \param y
+    The finite powerset computed in the previous iteration step.
+    It <EM>must</EM> definitely entail \p *this;
+
+    \param widen_fun
+    The widening function to be used on disjuncts.
+    It is obtained from the corresponding widening method by using
+    the helper function widen_fun_ref. Legal values are, e.g.,
+    <CODE>widen_fun_ref(&Polyhedron::H79_widening_assign)</CODE> and
+    <CODE>widen_fun_ref(&Polyhedron::limited_H79_extrapolation_assign, cs)</CODE>.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+
+    \warning
+    In order to obtain a proper widening operator, the template parameter
+    \p Cert should be a finite convergence certificate for the base-level
+    widening function \p widen_fun; otherwise, an extrapolation operator is
+    obtained.
+    For a description of the methods that should be provided
+    by \p Cert, see BHRZ03_Certificate or H79_Certificate.
+  */
+  template <typename Cert, typename Widening>
+  void BHZ03_widening_assign(const Pointset_Powerset& y, Widening widen_fun);
+
+  //@} // Space Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  /*! \brief
+    The assignment operator
+    (\p *this and \p y can be dimension-incompatible).
+  */
+  Pointset_Powerset& operator=(const Pointset_Powerset& y);
+
+  /*! \brief
+    Conversion assignment: the type <CODE>QH</CODE> of the disjuncts
+    in the source powerset is different from <CODE>PSET</CODE>
+    (\p *this and \p y can be dimension-incompatible).
+  */
+  template <typename QH>
+  Pointset_Powerset& operator=(const Pointset_Powerset<QH>& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Pointset_Powerset& y);
+
+  /*! \brief
+    Adds \p m new dimensions to the vector space containing \p *this
+    and embeds each disjunct in \p *this in the new space.
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Adds \p m new dimensions to the vector space containing \p *this
+    without embedding the disjuncts in \p *this in the new space.
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  //! Assigns to \p *this the concatenation of \p *this and \p y.
+  /*!
+    The result is obtained by computing the pairwise
+    \ref Concatenating_Polyhedra "concatenation" of each disjunct
+    in \p *this with each disjunct in \p y.
+  */
+  void concatenate_assign(const Pointset_Powerset& y);
+
+  //! Removes all the specified space dimensions.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher space dimensions so that the resulting space
+    will have dimension \p new_dimension.
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimensions is greater than the space dimension
+    of \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a partial function.
+
+    See also Polyhedron::map_space_dimensions.
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector
+    space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the vector
+    space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref Expanding_One_Dimension_of_the_Vector_Space_to_Multiple_Dimensions
+    "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.  Also
+    thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are
+    \ref Folding_Multiple_Dimensions_of_the_Vector_Space_into_One_Dimension
+    "folded" into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+public:
+  typedef typename Base::size_type size_type;
+  typedef typename Base::value_type value_type;
+  typedef typename Base::iterator iterator;
+  typedef typename Base::const_iterator const_iterator;
+  typedef typename Base::reverse_iterator reverse_iterator;
+  typedef typename Base::const_reverse_iterator const_reverse_iterator;
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+private:
+  typedef typename Base::Sequence Sequence;
+  typedef typename Base::Sequence_iterator Sequence_iterator;
+  typedef typename Base::Sequence_const_iterator Sequence_const_iterator;
+
+  //! The number of dimensions of the enclosing vector space.
+  dimension_type space_dim;
+
+  /*! \brief
+    Assigns to \p dest a \ref Powerset_Meet_Preserving_Simplification
+    "powerset meet-preserving enlargement" of itself with respect to
+    \p *this.  If \c false is returned, then the intersection is empty.
+
+    \note
+    It is assumed that \p *this and \p dest are topology-compatible
+    and dimension-compatible.
+  */
+  bool intersection_preserving_enlarge_element(PSET& dest) const;
+
+  /*! \brief
+    Assigns to \p *this the result of applying the BGP99 heuristics
+    to \p *this and \p y, using the widening function \p widen_fun.
+  */
+  template <typename Widening>
+  void BGP99_heuristics_assign(const Pointset_Powerset& y, Widening widen_fun);
+
+  //! Records in \p cert_ms the certificates for this set of disjuncts.
+  template <typename Cert>
+  void collect_certificates(std::map<Cert, size_type,
+                                     typename Cert::Compare>& cert_ms) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the current set of disjuncts
+    is stabilizing with respect to the multiset of certificates \p y_cert_ms.
+  */
+  template <typename Cert>
+  bool is_cert_multiset_stabilizing(const std::map<Cert, size_type,
+                                                   typename Cert::Compare>&
+                                    y_cert_ms) const;
+
+  // FIXME: here it should be enough to befriend the template constructor
+  // template <typename QH>
+  // Pointset_Powerset(const Pointset_Powerset<QH>&),
+  // but, apparently, this cannot be done.
+  friend class Pointset_Powerset<NNC_Polyhedron>;
+};
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Pointset_Powerset */
+template <typename PSET>
+void swap(Pointset_Powerset<PSET>& x, Pointset_Powerset<PSET>& y);
+
+//! Partitions \p q with respect to \p p.
+/*! \relates Pointset_Powerset
+  Let \p p and \p q be two polyhedra.
+  The function returns an object <CODE>r</CODE> of type
+  <CODE>std::pair\<PSET, Pointset_Powerset\<NNC_Polyhedron\> \></CODE>
+  such that
+  - <CODE>r.first</CODE> is the intersection of \p p and \p q;
+  - <CODE>r.second</CODE> has the property that all its elements are
+    pairwise disjoint and disjoint from \p p;
+  - the set-theoretical union of <CODE>r.first</CODE> with all the
+    elements of <CODE>r.second</CODE> gives \p q (i.e., <CODE>r</CODE>
+    is the representation of a partition of \p q).
+
+  \if Include_Implementation_Details
+
+  See
+  <A HREF="http://bugseng.com/products/ppl/Documentation/bibliography#Srivastava93">
+  this paper</A> for more information about the implementation.
+  \endif
+*/
+template <typename PSET>
+std::pair<PSET, Pointset_Powerset<NNC_Polyhedron> >
+linear_partition(const PSET& p, const PSET& q);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if the union of
+  the NNC polyhedra in \p ps contains the NNC polyhedron \p ph.
+
+  \relates Pointset_Powerset
+*/
+bool
+check_containment(const NNC_Polyhedron& ph,
+                  const Pointset_Powerset<NNC_Polyhedron>& ps);
+
+
+/*! \brief
+  Partitions the grid \p q with respect to grid \p p if and only if
+  such a partition is finite.
+
+  \relates Parma_Polyhedra_Library::Pointset_Powerset
+  Let \p p and \p q be two grids.
+  The function returns an object <CODE>r</CODE> of type
+  <CODE>std::pair\<PSET, Pointset_Powerset\<Grid\> \></CODE>
+  such that
+  - <CODE>r.first</CODE> is the intersection of \p p and \p q;
+  - If there is a finite partition of \p q with respect to \p p
+    the Boolean <CODE>finite_partition</CODE> is set to true and
+    <CODE>r.second</CODE> has the property that all its elements are
+    pairwise disjoint and disjoint from \p p and the set-theoretical
+    union of <CODE>r.first</CODE> with all the elements of
+    <CODE>r.second</CODE> gives \p q (i.e., <CODE>r</CODE>
+    is the representation of a partition of \p q).
+  - Otherwise the Boolean <CODE>finite_partition</CODE> is set to false
+    and the singleton set that contains \p q is stored in
+    <CODE>r.second</CODE>r.
+*/
+std::pair<Grid, Pointset_Powerset<Grid> >
+approximate_partition(const Grid& p, const Grid& q, bool& finite_partition);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if the union of
+  the grids \p ps contains the grid \p g.
+
+  \relates Pointset_Powerset
+*/
+bool
+check_containment(const Grid& ph,
+                  const Pointset_Powerset<Grid>& ps);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if the union of
+  the objects in \p ps contains \p ph.
+
+  \relates Pointset_Powerset
+  \note
+  It is assumed that the template parameter PSET can be converted
+  without precision loss into an NNC_Polyhedron; otherwise,
+  an incorrect result might be obtained.
+*/
+template <typename PSET>
+bool
+check_containment(const PSET& ph, const Pointset_Powerset<PSET>& ps);
+
+// CHECKME: according to the Intel compiler, the declaration of the
+// following specialization (of the class template parameter) should come
+// before the declaration of the corresponding full specialization
+// (where the member template parameter is specialized too).
+template <>
+template <typename QH>
+Pointset_Powerset<NNC_Polyhedron>
+::Pointset_Powerset(const Pointset_Powerset<QH>& y,
+                    Complexity_Class);
+
+// Non-inline full specializations should be declared here
+// so as to inhibit multiple instantiations of the generic template.
+template <>
+template <>
+Pointset_Powerset<NNC_Polyhedron>
+::Pointset_Powerset(const Pointset_Powerset<C_Polyhedron>& y,
+                    Complexity_Class);
+
+template <>
+template <>
+Pointset_Powerset<NNC_Polyhedron>
+::Pointset_Powerset(const Pointset_Powerset<Grid>& y,
+                    Complexity_Class);
+
+template <>
+template <>
+Pointset_Powerset<C_Polyhedron>
+::Pointset_Powerset(const Pointset_Powerset<NNC_Polyhedron>& y,
+                    Complexity_Class);
+
+template <>
+void
+Pointset_Powerset<NNC_Polyhedron>
+::difference_assign(const Pointset_Powerset& y);
+
+template <>
+void
+Pointset_Powerset<Grid>
+::difference_assign(const Pointset_Powerset& y);
+
+template <>
+bool
+Pointset_Powerset<NNC_Polyhedron>
+::geometrically_covers(const Pointset_Powerset& y) const;
+
+template <>
+bool
+Pointset_Powerset<Grid>
+::geometrically_covers(const Pointset_Powerset& y) const;
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Pointset_Powerset_inlines.hh"
+#include "Pointset_Powerset_templates.hh"
+
+#endif // !defined(PPL_Pointset_Powerset_defs_hh)
diff --git a/src/Pointset_Powerset_inlines.hh b/src/Pointset_Powerset_inlines.hh
new file mode 100644
index 0000000..a09a265
--- /dev/null
+++ b/src/Pointset_Powerset_inlines.hh
@@ -0,0 +1,320 @@
+/* Pointset_Powerset class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pointset_Powerset_inlines_hh
+#define PPL_Pointset_Powerset_inlines_hh 1
+
+#include "Constraint_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Congruence_defs.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include <algorithm>
+#include <deque>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+inline dimension_type
+Pointset_Powerset<PSET>::space_dimension() const {
+  return space_dim;
+}
+
+template <typename PSET>
+inline dimension_type
+Pointset_Powerset<PSET>::max_space_dimension() {
+  return PSET::max_space_dimension();
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(dimension_type num_dimensions,
+                                           Degenerate_Element kind)
+  : Base(), space_dim(num_dimensions) {
+  Pointset_Powerset& x = *this;
+  if (kind == UNIVERSE)
+    x.sequence.push_back(Determinate<PSET>(PSET(num_dimensions, kind)));
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(const Pointset_Powerset& y,
+                                           Complexity_Class)
+  : Base(y), space_dim(y.space_dim) {
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(const C_Polyhedron& ph,
+                                           Complexity_Class complexity)
+  : Base(), space_dim(ph.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (complexity == ANY_COMPLEXITY) {
+    if (ph.is_empty())
+      return;
+  }
+  else
+    x.reduced = false;
+  x.sequence.push_back(Determinate<PSET>(PSET(ph, complexity)));
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(const NNC_Polyhedron& ph,
+                                           Complexity_Class complexity)
+  : Base(), space_dim(ph.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (complexity == ANY_COMPLEXITY) {
+    if (ph.is_empty())
+      return;
+  }
+  else
+    x.reduced = false;
+  x.sequence.push_back(Determinate<PSET>(PSET(ph, complexity)));
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(const Grid& gr,
+                                           Complexity_Class)
+  : Base(), space_dim(gr.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (!gr.is_empty()) {
+    x.sequence.push_back(Determinate<PSET>(PSET(gr)));
+  }
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+template <typename QH1, typename QH2, typename R>
+inline
+Pointset_Powerset<PSET>
+::Pointset_Powerset(const Partially_Reduced_Product<QH1, QH2, R>& prp,
+                    Complexity_Class complexity)
+  : Base(), space_dim(prp.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (complexity == ANY_COMPLEXITY) {
+    if (prp.is_empty())
+      return;
+  }
+  else
+    x.reduced = false;
+  x.sequence.push_back(Determinate<PSET>(PSET(prp, complexity)));
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+template <typename Interval>
+Pointset_Powerset<PSET>::Pointset_Powerset(const Box<Interval>& box,
+                                           Complexity_Class)
+  : Base(), space_dim(box.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (!box.is_empty())
+    x.sequence.push_back(Determinate<PSET>(PSET(box)));
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+template <typename T>
+Pointset_Powerset<PSET>::Pointset_Powerset(const Octagonal_Shape<T>& os,
+                                           Complexity_Class)
+  : Base(), space_dim(os.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (!os.is_empty())
+    x.sequence.push_back(Determinate<PSET>(PSET(os)));
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+template <typename T>
+Pointset_Powerset<PSET>::Pointset_Powerset(const BD_Shape<T>& bds,
+                                           Complexity_Class)
+  : Base(), space_dim(bds.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  if (!bds.is_empty())
+    x.sequence.push_back(Determinate<PSET>(PSET(bds)));
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(const Constraint_System& cs)
+  : Base(Determinate<PSET>(cs)), space_dim(cs.space_dimension()) {
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+inline
+Pointset_Powerset<PSET>::Pointset_Powerset(const Congruence_System& cgs)
+  : Base(Determinate<PSET>(cgs)), space_dim(cgs.space_dimension()) {
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename PSET>
+inline Pointset_Powerset<PSET>&
+Pointset_Powerset<PSET>::operator=(const Pointset_Powerset& y) {
+  Pointset_Powerset& x = *this;
+  x.Base::operator=(y);
+  x.space_dim = y.space_dim;
+  return x;
+}
+
+template <typename PSET>
+inline void
+Pointset_Powerset<PSET>::m_swap(Pointset_Powerset& y) {
+  Pointset_Powerset& x = *this;
+  x.Base::m_swap(y);
+  using std::swap;
+  swap(x.space_dim, y.space_dim);
+}
+
+template <typename PSET>
+template <typename QH>
+inline Pointset_Powerset<PSET>&
+Pointset_Powerset<PSET>::operator=(const Pointset_Powerset<QH>& y) {
+  Pointset_Powerset& x = *this;
+  Pointset_Powerset<PSET> ps(y);
+  swap(x, ps);
+  return x;
+}
+
+template <typename PSET>
+inline void
+Pointset_Powerset<PSET>::intersection_assign(const Pointset_Powerset& y) {
+  Pointset_Powerset& x = *this;
+  x.pairwise_apply_assign
+    (y,
+     Det_PSET::lift_op_assign(std::mem_fun_ref(&PSET::intersection_assign)));
+}
+
+template <typename PSET>
+inline void
+Pointset_Powerset<PSET>::time_elapse_assign(const Pointset_Powerset& y) {
+  Pointset_Powerset& x = *this;
+  x.pairwise_apply_assign
+    (y,
+     Det_PSET::lift_op_assign(std::mem_fun_ref(&PSET::time_elapse_assign)));
+}
+
+template <typename PSET>
+inline bool
+Pointset_Powerset<PSET>
+::geometrically_covers(const Pointset_Powerset& y) const {
+  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
+  const Pointset_Powerset<NNC_Polyhedron> xx(*this);
+  const Pointset_Powerset<NNC_Polyhedron> yy(y);
+  return xx.geometrically_covers(yy);
+}
+
+template <typename PSET>
+inline bool
+Pointset_Powerset<PSET>
+::geometrically_equals(const Pointset_Powerset& y) const {
+  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
+  const Pointset_Powerset<NNC_Polyhedron> xx(*this);
+  const Pointset_Powerset<NNC_Polyhedron> yy(y);
+  return xx.geometrically_covers(yy) && yy.geometrically_covers(xx);
+}
+
+template <>
+inline bool
+Pointset_Powerset<Grid>
+::geometrically_equals(const Pointset_Powerset& y) const {
+  const Pointset_Powerset& x = *this;
+  return x.geometrically_covers(y) && y.geometrically_covers(x);
+}
+
+template <>
+inline bool
+Pointset_Powerset<NNC_Polyhedron>
+::geometrically_equals(const Pointset_Powerset& y) const {
+  const Pointset_Powerset& x = *this;
+  return x.geometrically_covers(y) && y.geometrically_covers(x);
+}
+
+template <typename PSET>
+inline memory_size_type
+Pointset_Powerset<PSET>::external_memory_in_bytes() const {
+  return Base::external_memory_in_bytes();
+}
+
+template <typename PSET>
+inline memory_size_type
+Pointset_Powerset<PSET>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+template <typename PSET>
+inline int32_t
+Pointset_Powerset<PSET>::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+template <typename PSET>
+inline void
+Pointset_Powerset<PSET>
+::difference_assign(const Pointset_Powerset& y) {
+  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
+  Pointset_Powerset<NNC_Polyhedron> nnc_this(*this);
+  Pointset_Powerset<NNC_Polyhedron> nnc_y(y);
+  nnc_this.difference_assign(nnc_y);
+  *this = nnc_this;
+}
+
+/*! \relates Pointset_Powerset */
+template <typename PSET>
+inline bool
+check_containment(const PSET& ph, const Pointset_Powerset<PSET>& ps) {
+  // This code is only used when PSET is an abstraction of NNC_Polyhedron.
+  const NNC_Polyhedron ph_nnc = NNC_Polyhedron(ph.constraints());
+  const Pointset_Powerset<NNC_Polyhedron> ps_nnc(ps);
+  return check_containment(ph_nnc, ps_nnc);
+}
+
+/*! \relates Pointset_Powerset */
+template <>
+inline bool
+check_containment(const C_Polyhedron& ph,
+                  const Pointset_Powerset<C_Polyhedron>& ps) {
+  return check_containment(NNC_Polyhedron(ph),
+                           Pointset_Powerset<NNC_Polyhedron>(ps));
+}
+
+/*! \relates Pointset_Powerset */
+template <typename PSET>
+inline void
+swap(Pointset_Powerset<PSET>& x, Pointset_Powerset<PSET>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pointset_Powerset_inlines_hh)
diff --git a/src/Pointset_Powerset_templates.hh b/src/Pointset_Powerset_templates.hh
new file mode 100644
index 0000000..12b5f12
--- /dev/null
+++ b/src/Pointset_Powerset_templates.hh
@@ -0,0 +1,1610 @@
+/* Pointset_Powerset class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Pointset_Powerset_templates_hh
+#define PPL_Pointset_Powerset_templates_hh 1
+
+#include "Constraint_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Variables_Set_defs.hh"
+#include <algorithm>
+#include <deque>
+#include <string>
+#include <iostream>
+#include <sstream>
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_disjunct(const PSET& ph) {
+  Pointset_Powerset& x = *this;
+  if (x.space_dimension() != ph.space_dimension()) {
+    std::ostringstream s;
+    s << "PPL::Pointset_Powerset<PSET>::add_disjunct(ph):\n"
+      << "this->space_dimension() == " << x.space_dimension() << ", "
+      << "ph.space_dimension() == " << ph.space_dimension() << ".";
+    throw std::invalid_argument(s.str());
+  }
+  x.sequence.push_back(Determinate<PSET>(ph));
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <>
+template <typename QH>
+Pointset_Powerset<NNC_Polyhedron>
+::Pointset_Powerset(const Pointset_Powerset<QH>& y,
+                    Complexity_Class complexity)
+  : Base(), space_dim(y.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  for (typename Pointset_Powerset<QH>::const_iterator i = y.begin(),
+         y_end = y.end(); i != y_end; ++i)
+    x.sequence.push_back(Determinate<NNC_Polyhedron>
+                         (NNC_Polyhedron(i->pointset(), complexity)));
+
+  // FIXME: If the domain elements can be represented _exactly_ as NNC
+  // polyhedra, then having x.reduced = y.reduced is correct. This is
+  // the case if the domains are both linear and convex which holds
+  // for all the currently supported instantiations except for
+  // Grids; for this reason the Grid specialization has a
+  // separate implementation.  For any non-linear or non-convex
+  // domains (e.g., a domain of Intervals with restrictions or a
+  // domain of circles) that may be supported in the future, the
+  // assignment x.reduced = y.reduced will be a bug.
+  x.reduced = y.reduced;
+
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+template <typename QH>
+Pointset_Powerset<PSET>
+::Pointset_Powerset(const Pointset_Powerset<QH>& y,
+                    Complexity_Class complexity)
+  : Base(), space_dim(y.space_dimension()) {
+  Pointset_Powerset& x = *this;
+  for (typename Pointset_Powerset<QH>::const_iterator i = y.begin(),
+         y_end = y.end(); i != y_end; ++i)
+    x.sequence.push_back(Determinate<PSET>(PSET(i->pointset(), complexity)));
+  // Note: this might be non-reduced even when `y' is known to be
+  // omega-reduced, because the constructor of PSET may have made
+  // different QH elements to become comparable.
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::concatenate_assign(const Pointset_Powerset& y) {
+  Pointset_Powerset& x = *this;
+  // Ensure omega-reduction here, since what follows has quadratic complexity.
+  x.omega_reduce();
+  y.omega_reduce();
+  Pointset_Powerset<PSET> new_x(x.space_dim + y.space_dim, EMPTY);
+  for (const_iterator xi = x.begin(), x_end = x.end(),
+         y_begin = y.begin(), y_end = y.end(); xi != x_end; ) {
+    for (const_iterator yi = y_begin; yi != y_end; ++yi) {
+      Det_PSET zi = *xi;
+      zi.concatenate_assign(*yi);
+      PPL_ASSERT_HEAVY(!zi.is_bottom());
+      new_x.sequence.push_back(zi);
+    }
+    ++xi;
+    if ((abandon_expensive_computations != 0)
+        && (xi != x_end) && (y_begin != y_end)) {
+      // Hurry up!
+      PSET x_ph = xi->pointset();
+      for (++xi; xi != x_end; ++xi)
+        x_ph.upper_bound_assign(xi->pointset());
+      const_iterator yi = y_begin;
+      PSET y_ph = yi->pointset();
+      for (++yi; yi != y_end; ++yi)
+        y_ph.upper_bound_assign(yi->pointset());
+      x_ph.concatenate_assign(y_ph);
+      swap(x, new_x);
+      x.add_disjunct(x_ph);
+      PPL_ASSERT_HEAVY(x.OK());
+      return;
+    }
+  }
+  swap(x, new_x);
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_constraint(const Constraint& c) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().add_constraint(c);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::refine_with_constraint(const Constraint& c) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().refine_with_constraint(c);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_constraints(const Constraint_System& cs) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().add_constraints(cs);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::refine_with_constraints(const Constraint_System& cs) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().refine_with_constraints(cs);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_congruence(const Congruence& cg) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().add_congruence(cg);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::refine_with_congruence(const Congruence& cg) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().refine_with_congruence(cg);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_congruences(const Congruence_System& cgs) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().add_congruences(cgs);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::refine_with_congruences(const Congruence_System& cgs) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().refine_with_congruences(cgs);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::unconstrain(const Variable var) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().unconstrain(var);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::unconstrain(const Variables_Set& vars) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().unconstrain(vars);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_space_dimensions_and_embed(dimension_type m) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().add_space_dimensions_and_embed(m);
+  x.space_dim += m;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::add_space_dimensions_and_project(dimension_type m) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().add_space_dimensions_and_project(m);
+  x.space_dim += m;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::remove_space_dimensions(const Variables_Set& vars) {
+  Pointset_Powerset& x = *this;
+  Variables_Set::size_type num_removed = vars.size();
+  if (num_removed > 0) {
+    for (Sequence_iterator si = x.sequence.begin(),
+           s_end = x.sequence.end(); si != s_end; ++si) {
+      si->pointset().remove_space_dimensions(vars);
+      x.reduced = false;
+    }
+    x.space_dim -= num_removed;
+    PPL_ASSERT_HEAVY(x.OK());
+  }
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::remove_higher_space_dimensions(dimension_type new_dimension) {
+  Pointset_Powerset& x = *this;
+  if (new_dimension < x.space_dim) {
+    for (Sequence_iterator si = x.sequence.begin(),
+           s_end = x.sequence.end(); si != s_end; ++si) {
+      si->pointset().remove_higher_space_dimensions(new_dimension);
+      x.reduced = false;
+    }
+    x.space_dim = new_dimension;
+    PPL_ASSERT_HEAVY(x.OK());
+  }
+}
+
+template <typename PSET>
+template <typename Partial_Function>
+void
+Pointset_Powerset<PSET>::map_space_dimensions(const Partial_Function& pfunc) {
+  Pointset_Powerset& x = *this;
+  if (x.is_bottom()) {
+    dimension_type n = 0;
+    for (dimension_type i = x.space_dim; i-- > 0; ) {
+      dimension_type new_i;
+      if (pfunc.maps(i, new_i))
+        ++n;
+    }
+    x.space_dim = n;
+  }
+  else {
+    Sequence_iterator s_begin = x.sequence.begin();
+    for (Sequence_iterator si = s_begin,
+           s_end = x.sequence.end(); si != s_end; ++si)
+      si->pointset().map_space_dimensions(pfunc);
+    x.space_dim = s_begin->pointset().space_dimension();
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::expand_space_dimension(Variable var,
+                                                dimension_type m) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().expand_space_dimension(var, m);
+  x.space_dim += m;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::fold_space_dimensions(const Variables_Set& vars,
+                                               Variable dest) {
+  Pointset_Powerset& x = *this;
+  Variables_Set::size_type num_folded = vars.size();
+  if (num_folded > 0) {
+    for (Sequence_iterator si = x.sequence.begin(),
+           s_end = x.sequence.end(); si != s_end; ++si)
+      si->pointset().fold_space_dimensions(vars, dest);
+  }
+  x.space_dim -= num_folded;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::affine_image(Variable var,
+                                      const Linear_Expression& expr,
+                                      Coefficient_traits::const_reference
+                                      denominator) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().affine_image(var, expr, denominator);
+    // Note that the underlying domain can apply conservative approximation:
+    // that is why it would not be correct to make the loss of reduction
+    // conditional on `var' and `expr'.
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::affine_preimage(Variable var,
+                                         const Linear_Expression& expr,
+                                         Coefficient_traits::const_reference
+                                         denominator) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().affine_preimage(var, expr, denominator);
+    // Note that the underlying domain can apply conservative approximation:
+    // that is why it would not be correct to make the loss of reduction
+    // conditional on `var' and `expr'.
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::generalized_affine_image(const Linear_Expression& lhs,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& rhs) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().generalized_affine_image(lhs, relsym, rhs);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::generalized_affine_preimage(const Linear_Expression& lhs,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& rhs) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().generalized_affine_preimage(lhs, relsym, rhs);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::generalized_affine_image(Variable var,
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().generalized_affine_image(var, relsym, expr, denominator);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::generalized_affine_preimage(Variable var,
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference
+                              denominator) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().generalized_affine_preimage(var, relsym, expr, denominator);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::bounded_affine_image(Variable var,
+                       const Linear_Expression& lb_expr,
+                       const Linear_Expression& ub_expr,
+                       Coefficient_traits::const_reference denominator) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().bounded_affine_image(var, lb_expr, ub_expr, denominator);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::bounded_affine_preimage(Variable var,
+                          const Linear_Expression& lb_expr,
+                          const Linear_Expression& ub_expr,
+                          Coefficient_traits::const_reference denominator) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    si->pointset().bounded_affine_preimage(var, lb_expr, ub_expr,
+                                          denominator);
+    x.reduced = false;
+  }
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+dimension_type
+Pointset_Powerset<PSET>::affine_dimension() const {
+  // The affine dimension of the powerset is the affine dimension of
+  // the smallest vector space in which it can be embedded.
+  const Pointset_Powerset& x = *this;
+  C_Polyhedron x_ph(space_dim, EMPTY);
+
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    PSET pi(si->pointset());
+    if (!pi.is_empty()) {
+      C_Polyhedron phi(space_dim);
+      const Constraint_System& cs = pi.minimized_constraints();
+      for (Constraint_System::const_iterator i = cs.begin(),
+             cs_end = cs.end(); i != cs_end; ++i) {
+        const Constraint& c = *i;
+        if (c.is_equality())
+          phi.add_constraint(c);
+      }
+      x_ph.poly_hull_assign(phi);
+    }
+  }
+
+  return x_ph.affine_dimension();
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::is_universe() const {
+  const Pointset_Powerset& x = *this;
+  // Exploit omega-reduction, if already computed.
+  if (x.is_omega_reduced())
+    return x.size() == 1 && x.begin()->pointset().is_universe();
+
+  // A powerset is universe iff one of its disjuncts is.
+  for (const_iterator x_i = x.begin(), x_end = x.end(); x_i != x_end; ++x_i)
+    if (x_i->pointset().is_universe()) {
+      // Speculative omega-reduction, if it is worth.
+      if (x.size() > 1) {
+        Pointset_Powerset<PSET> universe(x.space_dimension(), UNIVERSE);
+        Pointset_Powerset& xx = const_cast<Pointset_Powerset&>(x);
+        swap(xx, universe);
+      }
+      return true;
+    }
+  return false;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::is_empty() const {
+  const Pointset_Powerset& x = *this;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (!si->pointset().is_empty())
+      return false;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::is_discrete() const {
+  const Pointset_Powerset& x = *this;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (!si->pointset().is_discrete())
+      return false;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::is_topologically_closed() const {
+  const Pointset_Powerset& x = *this;
+  // The powerset must be omega-reduced before checking
+  // topological closure.
+  x.omega_reduce();
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (!si->pointset().is_topologically_closed())
+      return false;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::is_bounded() const {
+  const Pointset_Powerset& x = *this;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (!si->pointset().is_bounded())
+      return false;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::constrains(Variable var) const {
+  const Pointset_Powerset& x = *this;
+  // `var' should be one of the dimensions of the powerset.
+  const dimension_type var_space_dim = var.space_dimension();
+  if (x.space_dimension() < var_space_dim) {
+    std::ostringstream s;
+    s << "PPL::Pointset_Powerset<PSET>::constrains(v):\n"
+      << "this->space_dimension() == " << x.space_dimension() << ", "
+      << "v.space_dimension() == " << var_space_dim << ".";
+    throw std::invalid_argument(s.str());
+  }
+  // omega_reduction needed, since a redundant disjunct may constrain var.
+  x.omega_reduce();
+  // An empty powerset constrains all variables.
+  if (x.is_empty())
+    return true;
+  for (const_iterator x_i = x.begin(), x_end = x.end(); x_i != x_end; ++x_i)
+    if (x_i->pointset().constrains(var))
+      return true;
+  return false;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::is_disjoint_from(const Pointset_Powerset& y) const {
+  const Pointset_Powerset& x = *this;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         x_s_end = x.sequence.end(); si != x_s_end; ++si) {
+    const PSET& pi = si->pointset();
+    for (Sequence_const_iterator sj = y.sequence.begin(),
+           y_s_end = y.sequence.end(); sj != y_s_end; ++sj) {
+      const PSET& pj = sj->pointset();
+      if (!pi.is_disjoint_from(pj))
+        return false;
+    }
+  }
+  return true;
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::drop_some_non_integer_points(const Variables_Set& vars,
+                               Complexity_Class complexity) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().drop_some_non_integer_points(vars, complexity);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>
+::drop_some_non_integer_points(Complexity_Class complexity) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().drop_some_non_integer_points(complexity);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::topological_closure_assign() {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().topological_closure_assign();
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>
+::intersection_preserving_enlarge_element(PSET& dest) const {
+  // FIXME: this is just an executable specification.
+  const Pointset_Powerset& context = *this;
+  PPL_ASSERT(context.space_dimension() == dest.space_dimension());
+  bool nonempty_intersection = false;
+  // TODO: maybe use a *sorted* constraint system?
+  PSET enlarged(context.space_dimension(), UNIVERSE);
+  for (Sequence_const_iterator si = context.sequence.begin(),
+         s_end = context.sequence.end(); si != s_end; ++si) {
+    PSET context_i(si->pointset());
+    context_i.intersection_assign(enlarged);
+    PSET enlarged_i(dest);
+    if (enlarged_i.simplify_using_context_assign(context_i))
+      nonempty_intersection = true;
+    // TODO: merge the sorted constraints of `enlarged' and `enlarged_i'?
+    enlarged.intersection_assign(enlarged_i);
+  }
+  swap(dest, enlarged);
+  return nonempty_intersection;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>
+::simplify_using_context_assign(const Pointset_Powerset& y) {
+  Pointset_Powerset& x = *this;
+
+  // Omega reduction is required.
+  // TODO: check whether it would be more efficient to Omega-reduce x
+  // during the simplification process: when examining *si, we check
+  // if it has been made redundant by any of the elements preceding it
+  // (which have been already simplified).
+  x.omega_reduce();
+  if (x.is_empty())
+    return false;
+  y.omega_reduce();
+  if (y.is_empty()) {
+    x = y;
+    return false;
+  }
+
+  if (y.size() == 1) {
+    // More efficient, special handling of the singleton context case.
+    const PSET& y_i = y.sequence.begin()->pointset();
+    for (Sequence_iterator si = x.sequence.begin(),
+           s_end = x.sequence.end(); si != s_end; ) {
+      PSET& x_i = si->pointset();
+      if (x_i.simplify_using_context_assign(y_i))
+        ++si;
+      else
+        // Intersection is empty: drop the disjunct.
+        si = x.sequence.erase(si);
+    }
+  }
+  else {
+    // The context is not a singleton.
+    for (Sequence_iterator si = x.sequence.begin(),
+           s_end = x.sequence.end(); si != s_end; ) {
+      if (y.intersection_preserving_enlarge_element(si->pointset()))
+        ++si;
+      else
+        // Intersection with `*si' is empty: drop the disjunct.
+        si = x.sequence.erase(si);
+    }
+  }
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+  return !x.sequence.empty();
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::contains(const Pointset_Powerset& y) const {
+  const Pointset_Powerset& x = *this;
+  for (Sequence_const_iterator si = y.sequence.begin(),
+         y_s_end = y.sequence.end(); si != y_s_end; ++si) {
+    const PSET& pi = si->pointset();
+    bool pi_is_contained = false;
+    for (Sequence_const_iterator sj = x.sequence.begin(),
+           x_s_end = x.sequence.end();
+         (sj != x_s_end && !pi_is_contained);
+         ++sj) {
+      const PSET& pj = sj->pointset();
+      if (pj.contains(pi))
+        pi_is_contained = true;
+    }
+    if (!pi_is_contained)
+      return false;
+  }
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::strictly_contains(const Pointset_Powerset& y) const {
+  /* omega reduction ensures that a disjunct of y cannot be strictly
+     contained in one disjunct and also contained but not strictly
+     contained in another disjunct of *this */
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  for (Sequence_const_iterator si = y.sequence.begin(),
+         y_s_end = y.sequence.end(); si != y_s_end; ++si) {
+    const PSET& pi = si->pointset();
+    bool pi_is_strictly_contained = false;
+    for (Sequence_const_iterator sj = x.sequence.begin(),
+           x_s_end = x.sequence.end();
+         (sj != x_s_end && !pi_is_strictly_contained); ++sj) {
+      const PSET& pj = sj->pointset();
+      if (pj.strictly_contains(pi))
+        pi_is_strictly_contained = true;
+    }
+    if (!pi_is_strictly_contained)
+      return false;
+  }
+  return true;
+}
+
+template <typename PSET>
+Poly_Con_Relation
+Pointset_Powerset<PSET>::relation_with(const Congruence& cg) const {
+  const Pointset_Powerset& x = *this;
+
+  /* *this is included in cg if every disjunct is included in cg */
+  bool is_included = true;
+  /* *this is disjoint with cg if every disjunct is disjoint with cg */
+  bool is_disjoint = true;
+  /* *this strictly_intersects with cg if some disjunct strictly
+     intersects with cg */
+  bool is_strictly_intersecting = false;
+  /* *this saturates cg if some disjunct saturates cg and
+     every disjunct is either disjoint from cg or saturates cg */
+  bool saturates_once = false;
+  bool may_saturate = true;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    Poly_Con_Relation relation_i = si->pointset().relation_with(cg);
+    if (!relation_i.implies(Poly_Con_Relation::is_included()))
+      is_included = false;
+    if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
+      is_disjoint = false;
+    if (relation_i.implies(Poly_Con_Relation::strictly_intersects()))
+      is_strictly_intersecting = true;
+    if (relation_i.implies(Poly_Con_Relation::saturates()))
+      saturates_once = true;
+    else if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
+      may_saturate = false;
+  }
+
+  Poly_Con_Relation result = Poly_Con_Relation::nothing();
+  if (is_included)
+    result = result && Poly_Con_Relation::is_included();
+  if (is_disjoint)
+    result = result && Poly_Con_Relation::is_disjoint();
+  if (is_strictly_intersecting)
+    result = result && Poly_Con_Relation::strictly_intersects();
+  if (saturates_once && may_saturate)
+    result = result && Poly_Con_Relation::saturates();
+
+  return result;
+}
+
+template <typename PSET>
+Poly_Con_Relation
+Pointset_Powerset<PSET>::relation_with(const Constraint& c) const {
+  const Pointset_Powerset& x = *this;
+
+  /* *this is included in c if every disjunct is included in c */
+  bool is_included = true;
+  /* *this is disjoint with c if every disjunct is disjoint with c */
+  bool is_disjoint = true;
+  /* *this strictly_intersects with c if some disjunct strictly
+     intersects with c */
+  bool is_strictly_intersecting = false;
+  /* *this saturates c if some disjunct saturates c and
+     every disjunct is either disjoint from c or saturates c */
+  bool saturates_once = false;
+  bool may_saturate = true;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    Poly_Con_Relation relation_i = si->pointset().relation_with(c);
+    if (!relation_i.implies(Poly_Con_Relation::is_included()))
+      is_included = false;
+    if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
+      is_disjoint = false;
+    if (relation_i.implies(Poly_Con_Relation::strictly_intersects()))
+      is_strictly_intersecting = true;
+    if (relation_i.implies(Poly_Con_Relation::saturates()))
+      saturates_once = true;
+    else if (!relation_i.implies(Poly_Con_Relation::is_disjoint()))
+      may_saturate = false;
+  }
+
+  Poly_Con_Relation result = Poly_Con_Relation::nothing();
+  if (is_included)
+    result = result && Poly_Con_Relation::is_included();
+  if (is_disjoint)
+    result = result && Poly_Con_Relation::is_disjoint();
+  if (is_strictly_intersecting)
+    result = result && Poly_Con_Relation::strictly_intersects();
+  if (saturates_once && may_saturate)
+    result = result && Poly_Con_Relation::saturates();
+
+  return result;
+}
+
+template <typename PSET>
+Poly_Gen_Relation
+Pointset_Powerset<PSET>::relation_with(const Generator& g) const {
+  const Pointset_Powerset& x = *this;
+
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    Poly_Gen_Relation relation_i = si->pointset().relation_with(g);
+    if (relation_i.implies(Poly_Gen_Relation::subsumes()))
+      return Poly_Gen_Relation::subsumes();
+  }
+
+  return Poly_Gen_Relation::nothing();
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>
+::bounds_from_above(const Linear_Expression& expr) const {
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (!si->pointset().bounds_from_above(expr))
+      return false;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>
+::bounds_from_below(const Linear_Expression& expr) const {
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (!si->pointset().bounds_from_below(expr))
+      return false;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::maximize(const Linear_Expression& expr,
+                                  Coefficient& sup_n,
+                                  Coefficient& sup_d,
+                                  bool& maximum) const {
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  if (x.is_empty())
+    return false;
+
+  bool first = true;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_d);
+  best_sup_n = 0;
+  best_sup_d = 1;
+  bool best_max = false;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_d);
+  iter_sup_n = 0;
+  iter_sup_d = 1;
+  bool iter_max = false;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    if (!si->pointset().maximize(expr, iter_sup_n, iter_sup_d, iter_max))
+      return false;
+    else
+      if (first) {
+        first = false;
+        best_sup_n = iter_sup_n;
+        best_sup_d = iter_sup_d;
+        best_max = iter_max;
+      }
+      else {
+        tmp = (best_sup_n * iter_sup_d) - (iter_sup_n * best_sup_d);
+        if (tmp < 0) {
+          best_sup_n = iter_sup_n;
+          best_sup_d = iter_sup_d;
+          best_max = iter_max;
+        }
+        else if (tmp == 0)
+          best_max = (best_max || iter_max);
+      }
+  }
+  sup_n = best_sup_n;
+  sup_d = best_sup_d;
+  maximum = best_max;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::maximize(const Linear_Expression& expr,
+                                  Coefficient& sup_n,
+                                  Coefficient& sup_d,
+                                  bool& maximum,
+                                  Generator& g) const {
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  if (x.is_empty())
+    return false;
+
+  bool first = true;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(best_sup_d);
+  best_sup_n = 0;
+  best_sup_d = 1;
+  bool best_max = false;
+  Generator best_g = point();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_sup_d);
+  iter_sup_n = 0;
+  iter_sup_d = 1;
+  bool iter_max = false;
+  Generator iter_g = point();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    if (!si->pointset().maximize(expr,
+                                 iter_sup_n, iter_sup_d, iter_max, iter_g))
+      return false;
+    else
+      if (first) {
+        first = false;
+        best_sup_n = iter_sup_n;
+        best_sup_d = iter_sup_d;
+        best_max = iter_max;
+        best_g = iter_g;
+      }
+      else {
+        tmp = (best_sup_n * iter_sup_d) - (iter_sup_n * best_sup_d);
+        if (tmp < 0) {
+          best_sup_n = iter_sup_n;
+          best_sup_d = iter_sup_d;
+          best_max = iter_max;
+          best_g = iter_g;
+        }
+        else if (tmp == 0) {
+          best_max = (best_max || iter_max);
+          best_g = iter_g;
+        }
+      }
+  }
+  sup_n = best_sup_n;
+  sup_d = best_sup_d;
+  maximum = best_max;
+  g = best_g;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::minimize(const Linear_Expression& expr,
+                                  Coefficient& inf_n,
+                                  Coefficient& inf_d,
+                                  bool& minimum) const {
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  if (x.is_empty())
+    return false;
+
+  bool first = true;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_d);
+  best_inf_n = 0;
+  best_inf_d = 1;
+  bool best_min = false;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_d);
+  iter_inf_n = 0;
+  iter_inf_d = 1;
+  bool iter_min = false;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    if (!si->pointset().minimize(expr, iter_inf_n, iter_inf_d, iter_min))
+      return false;
+    else
+      if (first) {
+        first = false;
+        best_inf_n = iter_inf_n;
+        best_inf_d = iter_inf_d;
+        best_min = iter_min;
+      }
+      else {
+        tmp = (best_inf_n * iter_inf_d) - (iter_inf_n * best_inf_d);
+        if (tmp > 0) {
+          best_inf_n = iter_inf_n;
+          best_inf_d = iter_inf_d;
+          best_min = iter_min;
+        }
+        else if (tmp == 0)
+          best_min = (best_min || iter_min);
+      }
+  }
+  inf_n = best_inf_n;
+  inf_d = best_inf_d;
+  minimum = best_min;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::minimize(const Linear_Expression& expr,
+                                  Coefficient& inf_n,
+                                  Coefficient& inf_d,
+                                  bool& minimum,
+                                  Generator& g) const {
+  const Pointset_Powerset& x = *this;
+  x.omega_reduce();
+  if (x.is_empty())
+    return false;
+
+  bool first = true;
+
+  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(best_inf_d);
+  best_inf_n = 0;
+  best_inf_d = 1;
+  bool best_min = false;
+  Generator best_g = point();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(iter_inf_d);
+  iter_inf_n = 0;
+  iter_inf_d = 1;
+  bool iter_min = false;
+  Generator iter_g = point();
+
+  PPL_DIRTY_TEMP_COEFFICIENT(tmp);
+
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si) {
+    if (!si->pointset().minimize(expr,
+                                 iter_inf_n, iter_inf_d, iter_min, iter_g))
+      return false;
+    else
+      if (first) {
+        first = false;
+        best_inf_n = iter_inf_n;
+        best_inf_d = iter_inf_d;
+        best_min = iter_min;
+        best_g = iter_g;
+      }
+      else {
+        tmp = (best_inf_n * iter_inf_d) - (iter_inf_n * best_inf_d);
+        if (tmp > 0) {
+          best_inf_n = iter_inf_n;
+          best_inf_d = iter_inf_d;
+          best_min = iter_min;
+          best_g = iter_g;
+        }
+        else if (tmp == 0) {
+          best_min = (best_min || iter_min);
+          best_g = iter_g;
+        }
+      }
+  }
+  inf_n = best_inf_n;
+  inf_d = best_inf_d;
+  minimum = best_min;
+  g = best_g;
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::contains_integer_point() const {
+  const Pointset_Powerset& x = *this;
+  for (Sequence_const_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    if (si->pointset().contains_integer_point())
+      return true;
+  return false;
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::wrap_assign(const Variables_Set& vars,
+                                     Bounded_Integer_Type_Width w,
+                                     Bounded_Integer_Type_Representation r,
+                                     Bounded_Integer_Type_Overflow o,
+                                     const Constraint_System* cs_p,
+                                     unsigned complexity_threshold,
+                                     bool wrap_individually) {
+  Pointset_Powerset& x = *this;
+  for (Sequence_iterator si = x.sequence.begin(),
+         s_end = x.sequence.end(); si != s_end; ++si)
+    si->pointset().wrap_assign(vars, w, r, o, cs_p,
+                               complexity_threshold, wrap_individually);
+  x.reduced = false;
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::pairwise_reduce() {
+  Pointset_Powerset& x = *this;
+  // It is wise to omega-reduce before pairwise-reducing.
+  x.omega_reduce();
+
+  size_type n = x.size();
+  size_type deleted;
+  do {
+    Pointset_Powerset new_x(x.space_dim, EMPTY);
+    std::deque<bool> marked(n, false);
+    deleted = 0;
+    Sequence_iterator s_begin = x.sequence.begin();
+    Sequence_iterator s_end = x.sequence.end();
+    unsigned si_index = 0;
+    for (Sequence_iterator si = s_begin; si != s_end; ++si, ++si_index) {
+      if (marked[si_index])
+        continue;
+      PSET& pi = si->pointset();
+      Sequence_const_iterator sj = si;
+      unsigned sj_index = si_index;
+      for (++sj, ++sj_index; sj != s_end; ++sj, ++sj_index) {
+        if (marked[sj_index])
+          continue;
+        const PSET& pj = sj->pointset();
+        if (pi.upper_bound_assign_if_exact(pj)) {
+          marked[si_index] = true;
+          marked[sj_index] = true;
+          new_x.add_non_bottom_disjunct_preserve_reduction(pi);
+          ++deleted;
+          goto next;
+        }
+      }
+    next:
+      ;
+    }
+    iterator new_x_begin = new_x.begin();
+    iterator new_x_end = new_x.end();
+    unsigned xi_index = 0;
+    for (const_iterator xi = x.begin(),
+           x_end = x.end(); xi != x_end; ++xi, ++xi_index)
+      if (!marked[xi_index])
+        new_x_begin
+          = new_x.add_non_bottom_disjunct_preserve_reduction(*xi,
+                                                             new_x_begin,
+                                                             new_x_end);
+    using std::swap;
+    swap(x.sequence, new_x.sequence);
+    n -= deleted;
+  } while (deleted > 0);
+  PPL_ASSERT_HEAVY(x.OK());
+}
+
+template <typename PSET>
+template <typename Widening>
+void
+Pointset_Powerset<PSET>::
+BGP99_heuristics_assign(const Pointset_Powerset& y, Widening widen_fun) {
+  // `x' is the current iteration value.
+  Pointset_Powerset& x = *this;
+
+#ifndef NDEBUG
+  {
+    // We assume that `y' entails `x'.
+    const Pointset_Powerset<PSET> x_copy = x;
+    const Pointset_Powerset<PSET> y_copy = y;
+    PPL_ASSERT_HEAVY(y_copy.definitely_entails(x_copy));
+  }
+#endif
+
+  size_type n = x.size();
+  Pointset_Powerset new_x(x.space_dim, EMPTY);
+  std::deque<bool> marked(n, false);
+  const_iterator x_begin = x.begin();
+  const_iterator x_end = x.end();
+  unsigned i_index = 0;
+  for (const_iterator i = x_begin,
+         y_begin = y.begin(), y_end = y.end(); i != x_end; ++i, ++i_index)
+    for (const_iterator j = y_begin; j != y_end; ++j) {
+      const PSET& pi = i->pointset();
+      const PSET& pj = j->pointset();
+      if (pi.contains(pj)) {
+        PSET pi_copy = pi;
+        widen_fun(pi_copy, pj);
+        new_x.add_non_bottom_disjunct_preserve_reduction(pi_copy);
+        marked[i_index] = true;
+      }
+    }
+  iterator new_x_begin = new_x.begin();
+  iterator new_x_end = new_x.end();
+  i_index = 0;
+  for (const_iterator i = x_begin; i != x_end; ++i, ++i_index)
+    if (!marked[i_index])
+      new_x_begin
+        = new_x.add_non_bottom_disjunct_preserve_reduction(*i,
+                                                           new_x_begin,
+                                                           new_x_end);
+  using std::swap;
+  swap(x.sequence, new_x.sequence);
+  PPL_ASSERT_HEAVY(x.OK());
+  PPL_ASSERT(x.is_omega_reduced());
+}
+
+template <typename PSET>
+template <typename Widening>
+void
+Pointset_Powerset<PSET>::
+BGP99_extrapolation_assign(const Pointset_Powerset& y,
+                           Widening widen_fun,
+                           unsigned max_disjuncts) {
+  // `x' is the current iteration value.
+  Pointset_Powerset& x = *this;
+
+#ifndef NDEBUG
+  {
+    // We assume that `y' entails `x'.
+    const Pointset_Powerset<PSET> x_copy = x;
+    const Pointset_Powerset<PSET> y_copy = y;
+    PPL_ASSERT_HEAVY(y_copy.definitely_entails(x_copy));
+  }
+#endif
+
+  x.pairwise_reduce();
+  if (max_disjuncts != 0)
+    x.collapse(max_disjuncts);
+  x.BGP99_heuristics_assign(y, widen_fun);
+}
+
+template <typename PSET>
+template <typename Cert>
+void
+Pointset_Powerset<PSET>::
+collect_certificates(std::map<Cert, size_type,
+                     typename Cert::Compare>& cert_ms) const {
+  const Pointset_Powerset& x = *this;
+  PPL_ASSERT(x.is_omega_reduced());
+  PPL_ASSERT(cert_ms.size() == 0);
+  for (const_iterator i = x.begin(), end = x.end(); i != end; ++i) {
+    Cert ph_cert(i->pointset());
+    ++cert_ms[ph_cert];
+  }
+}
+
+template <typename PSET>
+template <typename Cert>
+bool
+Pointset_Powerset<PSET>::
+is_cert_multiset_stabilizing(const std::map<Cert, size_type,
+                             typename Cert::Compare>& y_cert_ms) const {
+  typedef std::map<Cert, size_type, typename Cert::Compare> Cert_Multiset;
+  Cert_Multiset x_cert_ms;
+  collect_certificates(x_cert_ms);
+  typename Cert_Multiset::const_iterator xi = x_cert_ms.begin();
+  typename Cert_Multiset::const_iterator x_cert_ms_end = x_cert_ms.end();
+  typename Cert_Multiset::const_iterator yi = y_cert_ms.begin();
+  typename Cert_Multiset::const_iterator y_cert_ms_end = y_cert_ms.end();
+  while (xi != x_cert_ms_end && yi != y_cert_ms_end) {
+    const Cert& xi_cert = xi->first;
+    const Cert& yi_cert = yi->first;
+    switch (xi_cert.compare(yi_cert)) {
+    case 0:
+      // xi_cert == yi_cert: check the number of multiset occurrences.
+      {
+        const size_type& xi_count = xi->second;
+        const size_type& yi_count = yi->second;
+        if (xi_count == yi_count) {
+          // Same number of occurrences: compare the next pair.
+          ++xi;
+          ++yi;
+        }
+        else
+          // Different number of occurrences: can decide ordering.
+          return xi_count < yi_count;
+        break;
+      }
+    case 1:
+      // xi_cert > yi_cert: it is not stabilizing.
+      return false;
+
+    case -1:
+      // xi_cert < yi_cert: it is stabilizing.
+      return true;
+    }
+  }
+  // Here xi == x_cert_ms_end or yi == y_cert_ms_end.
+  // Stabilization is achieved if `y_cert_ms' still has other elements.
+  return yi != y_cert_ms_end;
+}
+
+template <typename PSET>
+template <typename Cert, typename Widening>
+void
+Pointset_Powerset<PSET>::BHZ03_widening_assign(const Pointset_Powerset& y,
+                                               Widening widen_fun) {
+  // `x' is the current iteration value.
+  Pointset_Powerset& x = *this;
+
+#ifndef NDEBUG
+  {
+    // We assume that `y' entails `x'.
+    const Pointset_Powerset<PSET> x_copy = x;
+    const Pointset_Powerset<PSET> y_copy = y;
+    PPL_ASSERT_HEAVY(y_copy.definitely_entails(x_copy));
+  }
+#endif
+
+  // First widening technique: do nothing.
+
+  // If `y' is the empty collection, do nothing.
+  PPL_ASSERT(x.size() > 0);
+  if (y.size() == 0)
+    return;
+
+  // Compute the poly-hull of `x'.
+  PSET x_hull(x.space_dim, EMPTY);
+  for (const_iterator i = x.begin(), x_end = x.end(); i != x_end; ++i)
+    x_hull.upper_bound_assign(i->pointset());
+
+  // Compute the poly-hull of `y'.
+  PSET y_hull(y.space_dim, EMPTY);
+  for (const_iterator i = y.begin(), y_end = y.end(); i != y_end; ++i)
+    y_hull.upper_bound_assign(i->pointset());
+  // Compute the certificate for `y_hull'.
+  const Cert y_hull_cert(y_hull);
+
+  // If the hull is stabilizing, do nothing.
+  int hull_stabilization = y_hull_cert.compare(x_hull);
+  if (hull_stabilization == 1)
+    return;
+
+  // Multiset ordering is only useful when `y' is not a singleton.
+  const bool y_is_not_a_singleton = y.size() > 1;
+
+  // The multiset certificate for `y':
+  // we want to be lazy about its computation.
+  typedef std::map<Cert, size_type, typename Cert::Compare> Cert_Multiset;
+  Cert_Multiset y_cert_ms;
+  bool y_cert_ms_computed = false;
+
+  if (hull_stabilization == 0 && y_is_not_a_singleton) {
+    // Collect the multiset certificate for `y'.
+    y.collect_certificates(y_cert_ms);
+    y_cert_ms_computed = true;
+    // If multiset ordering is stabilizing, do nothing.
+    if (x.is_cert_multiset_stabilizing(y_cert_ms))
+      return;
+  }
+
+  // Second widening technique: try the BGP99 powerset heuristics.
+  Pointset_Powerset<PSET> bgp99_heuristics = x;
+  bgp99_heuristics.BGP99_heuristics_assign(y, widen_fun);
+
+  // Compute the poly-hull of `bgp99_heuristics'.
+  PSET bgp99_heuristics_hull(x.space_dim, EMPTY);
+  for (const_iterator i = bgp99_heuristics.begin(),
+         b_h_end = bgp99_heuristics.end(); i != b_h_end; ++i)
+    bgp99_heuristics_hull.upper_bound_assign(i->pointset());
+
+  // Check for stabilization and, if successful,
+  // commit to the result of the extrapolation.
+  hull_stabilization = y_hull_cert.compare(bgp99_heuristics_hull);
+  if (hull_stabilization == 1) {
+    // The poly-hull is stabilizing.
+    swap(x, bgp99_heuristics);
+    return;
+  }
+  else if (hull_stabilization == 0 && y_is_not_a_singleton) {
+    // If not already done, compute multiset certificate for `y'.
+    if (!y_cert_ms_computed) {
+      y.collect_certificates(y_cert_ms);
+      y_cert_ms_computed = true;
+    }
+    if (bgp99_heuristics.is_cert_multiset_stabilizing(y_cert_ms)) {
+      swap(x, bgp99_heuristics);
+      return;
+    }
+    // Third widening technique: pairwise-reduction on `bgp99_heuristics'.
+    // Note that pairwise-reduction does not affect the computation
+    // of the poly-hulls, so that we only have to check the multiset
+    // certificate relation.
+    Pointset_Powerset<PSET> reduced_bgp99_heuristics(bgp99_heuristics);
+    reduced_bgp99_heuristics.pairwise_reduce();
+    if (reduced_bgp99_heuristics.is_cert_multiset_stabilizing(y_cert_ms)) {
+      swap(x, reduced_bgp99_heuristics);
+      return;
+    }
+  }
+
+  // Fourth widening technique: this is applicable only when
+  // `y_hull' is a proper subset of `bgp99_heuristics_hull'.
+  if (bgp99_heuristics_hull.strictly_contains(y_hull)) {
+    // Compute (y_hull \widen bgp99_heuristics_hull).
+    PSET ph = bgp99_heuristics_hull;
+    widen_fun(ph, y_hull);
+    // Compute the difference between `ph' and `bgp99_heuristics_hull'.
+    ph.difference_assign(bgp99_heuristics_hull);
+    x.add_disjunct(ph);
+    return;
+  }
+
+  // Fall back to the computation of the poly-hull.
+  Pointset_Powerset<PSET> x_hull_singleton(x.space_dim, EMPTY);
+  x_hull_singleton.add_disjunct(x_hull);
+  swap(x, x_hull_singleton);
+}
+
+template <typename PSET>
+void
+Pointset_Powerset<PSET>::ascii_dump(std::ostream& s) const {
+  const Pointset_Powerset& x = *this;
+  s << "size " << x.size()
+    << "\nspace_dim " << x.space_dim
+    << "\n";
+  for (const_iterator xi = x.begin(), x_end = x.end(); xi != x_end; ++xi)
+    xi->pointset().ascii_dump(s);
+}
+
+PPL_OUTPUT_TEMPLATE_DEFINITIONS(PSET, Pointset_Powerset<PSET>)
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::ascii_load(std::istream& s) {
+  Pointset_Powerset& x = *this;
+  std::string str;
+
+  if (!(s >> str) || str != "size")
+    return false;
+
+  size_type sz;
+
+  if (!(s >> sz))
+    return false;
+
+  if (!(s >> str) || str != "space_dim")
+    return false;
+
+  if (!(s >> x.space_dim))
+    return false;
+
+  Pointset_Powerset new_x(x.space_dim, EMPTY);
+  while (sz-- > 0) {
+    PSET ph;
+    if (!ph.ascii_load(s))
+      return false;
+    new_x.add_disjunct(ph);
+  }
+  swap(x, new_x);
+
+  // Check invariants.
+  PPL_ASSERT_HEAVY(x.OK());
+  return true;
+}
+
+template <typename PSET>
+bool
+Pointset_Powerset<PSET>::OK() const {
+  const Pointset_Powerset& x = *this;
+  for (const_iterator xi = x.begin(), x_end = x.end(); xi != x_end; ++xi) {
+    const PSET& pi = xi->pointset();
+    if (pi.space_dimension() != x.space_dim) {
+#ifndef NDEBUG
+      std::cerr << "Space dimension mismatch: is " << pi.space_dimension()
+                << " in an element of the sequence,\nshould be "
+                << x.space_dim << "."
+                << std::endl;
+#endif
+      return false;
+    }
+  }
+  return x.Base::OK();
+}
+
+namespace Implementation {
+
+namespace Pointset_Powersets {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Partitions polyhedron \p pset according to constraint \p c.
+/*! \relates Parma_Polyhedra_Library::Pointset_Powerset
+  On exit, the intersection of \p pset and constraint \p c is stored
+  in \p pset, whereas the intersection of \p pset with the negation of \p c
+  is added as a new disjunct of the powerset \p r.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename PSET>
+void
+linear_partition_aux(const Constraint& c,
+                     PSET& pset,
+                     Pointset_Powerset<NNC_Polyhedron>& r) {
+  const Linear_Expression le(c.expression());
+  const Constraint& neg_c = c.is_strict_inequality() ? (le <= 0) : (le < 0);
+  NNC_Polyhedron nnc_ph_pset(pset);
+  nnc_ph_pset.add_constraint(neg_c);
+  if (!nnc_ph_pset.is_empty())
+    r.add_disjunct(nnc_ph_pset);
+  pset.add_constraint(c);
+}
+
+} // namespace Pointset_Powersets
+
+} // namespace Implementation
+
+
+/*! \relates Pointset_Powerset */
+template <typename PSET>
+std::pair<PSET, Pointset_Powerset<NNC_Polyhedron> >
+linear_partition(const PSET& p, const PSET& q) {
+  using Implementation::Pointset_Powersets::linear_partition_aux;
+
+  Pointset_Powerset<NNC_Polyhedron> r(p.space_dimension(), EMPTY);
+  PSET pset = q;
+  const Constraint_System& p_constraints = p.constraints();
+  for (Constraint_System::const_iterator i = p_constraints.begin(),
+         p_constraints_end = p_constraints.end();
+       i != p_constraints_end;
+       ++i) {
+    const Constraint& c = *i;
+    if (c.is_equality()) {
+      const Linear_Expression le(c.expression());
+      linear_partition_aux(le <= 0, pset, r);
+      linear_partition_aux(le >= 0, pset, r);
+    }
+    else
+      linear_partition_aux(c, pset, r);
+  }
+  return std::make_pair(pset, r);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pointset_Powerset_templates_hh)
diff --git a/src/Pointset_Powerset_types.hh b/src/Pointset_Powerset_types.hh
new file mode 100644
index 0000000..f52e4f5
--- /dev/null
+++ b/src/Pointset_Powerset_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Pointset_Powerset_types_hh
+#define PPL_Pointset_Powerset_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+class Pointset_Powerset;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Pointset_Powerset_types_hh)
diff --git a/src/Poly_Con_Relation.cc b/src/Poly_Con_Relation.cc
index 49fb489..3a8f0f7 100644
--- a/src/Poly_Con_Relation.cc
+++ b/src/Poly_Con_Relation.cc
@@ -1,6 +1,6 @@
 /* Poly_Con_Relation class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Poly_Con_Relation.defs.hh"
+#include "Poly_Con_Relation_defs.hh"
 #include "assert.hh"
 #include <iostream>
 #include <string>
diff --git a/src/Poly_Con_Relation.defs.hh b/src/Poly_Con_Relation.defs.hh
deleted file mode 100644
index 97113ae..0000000
--- a/src/Poly_Con_Relation.defs.hh
+++ /dev/null
@@ -1,166 +0,0 @@
-/* Poly_Con_Relation class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Poly_Con_Relation_defs_hh
-#define PPL_Poly_Con_Relation_defs_hh 1
-
-#include "Poly_Con_Relation.types.hh"
-#include "globals.defs.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-// Put them in the namespace here to declare them friend later.
-
-//! True if and only if \p x and \p y are logically equivalent.
-/*! \relates Poly_Con_Relation */
-bool operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
-
-//! True if and only if \p x and \p y are not logically equivalent.
-/*! \relates Poly_Con_Relation */
-bool operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
-
-//! Yields the logical conjunction of \p x and \p y.
-/*! \relates Poly_Con_Relation */
-Poly_Con_Relation operator&&(const Poly_Con_Relation& x,
-			     const Poly_Con_Relation& y);
-
-/*! \brief
-  Yields the assertion with all the conjuncts of \p x
-  that are not in \p y.
-
-  \relates Poly_Con_Relation
-*/
-Poly_Con_Relation operator-(const Poly_Con_Relation& x,
-			    const Poly_Con_Relation& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Poly_Con_Relation */
-std::ostream& operator<<(std::ostream& s, const Poly_Con_Relation& r);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! The relation between a polyhedron and a constraint.
-/*! \ingroup PPL_CXX_interface
-  This class implements conjunctions of assertions on the relation
-  between a polyhedron and a constraint.
-*/
-class Parma_Polyhedra_Library::Poly_Con_Relation {
-private:
-  //! Poly_Con_Relation is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bit-masks for the individual assertions
-  //@{
-  static const flags_t NOTHING             = 0U;
-  static const flags_t IS_DISJOINT         = 1U << 0;
-  static const flags_t STRICTLY_INTERSECTS = 1U << 1;
-  static const flags_t IS_INCLUDED         = 1U << 2;
-  static const flags_t SATURATES           = 1U << 3;
-  //@} // Bit-masks for the individual assertions
-
-  //! All assertions together.
-  static const flags_t EVERYTHING
-  = IS_DISJOINT
-  | STRICTLY_INTERSECTS
-  | IS_INCLUDED
-  | SATURATES;
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! True if and only if the conjunction \p x implies the conjunction \p y.
-  static bool implies(flags_t x, flags_t y);
-
-  //! Construct from a bit-mask.
-  Poly_Con_Relation(flags_t mask);
-
-  friend bool
-  operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
-  friend bool
-  operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
-
-  friend Poly_Con_Relation
-  operator&&(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
-
-  friend Poly_Con_Relation
-  operator-(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::
-  IO_Operators::operator<<(std::ostream& s, const Poly_Con_Relation& r);
-
-public:
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Access the internal flags: this is needed for some language
-    interfaces.
-  */
-#endif
-  flags_t get_flags() const;
-
-public:
-  //! The assertion that says nothing.
-  static Poly_Con_Relation nothing();
-
-  /*! \brief
-    The polyhedron and the set of points satisfying
-    the constraint are disjoint.
-  */
-  static Poly_Con_Relation is_disjoint();
-
-  /*! \brief
-    The polyhedron intersects the set of points satisfying
-    the constraint, but it is not included in it.
-  */
-  static Poly_Con_Relation strictly_intersects();
-
-  /*! \brief
-    The polyhedron is included in the set of points satisfying
-    the constraint.
-  */
-  static Poly_Con_Relation is_included();
-
-  /*! \brief
-    The polyhedron is included in the set of points saturating
-    the constraint.
-  */
-  static Poly_Con_Relation saturates();
-
-  PPL_OUTPUT_DECLARATIONS
-
-  //! True if and only if \p *this implies \p y.
-  bool implies(const Poly_Con_Relation& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-};
-
-#include "Poly_Con_Relation.inlines.hh"
-
-#endif // !defined(PPL_Poly_Con_Relation_defs_hh)
diff --git a/src/Poly_Con_Relation.inlines.hh b/src/Poly_Con_Relation.inlines.hh
deleted file mode 100644
index 17cbe83..0000000
--- a/src/Poly_Con_Relation.inlines.hh
+++ /dev/null
@@ -1,100 +0,0 @@
-/* Poly_Con_Relation class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Poly_Con_Relation_inlines_hh
-#define PPL_Poly_Con_Relation_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Poly_Con_Relation::Poly_Con_Relation(flags_t mask)
-  : flags(mask) {
-}
-
-inline Poly_Con_Relation::flags_t
-Poly_Con_Relation::get_flags() const {
-  return flags;
-}
-
-inline Poly_Con_Relation
-Poly_Con_Relation::nothing() {
-  return Poly_Con_Relation(NOTHING);
-}
-
-inline Poly_Con_Relation
-Poly_Con_Relation::is_disjoint() {
-  return Poly_Con_Relation(IS_DISJOINT);
-}
-
-inline Poly_Con_Relation
-Poly_Con_Relation::strictly_intersects() {
-  return Poly_Con_Relation(STRICTLY_INTERSECTS);
-}
-
-inline Poly_Con_Relation
-Poly_Con_Relation::is_included() {
-  return Poly_Con_Relation(IS_INCLUDED);
-}
-
-inline Poly_Con_Relation
-Poly_Con_Relation::saturates() {
-  return Poly_Con_Relation(SATURATES);
-}
-
-inline bool
-Poly_Con_Relation::implies(flags_t x, flags_t y) {
-  return (x & y) == y;
-}
-
-inline bool
-Poly_Con_Relation::implies(const Poly_Con_Relation& y) const {
-  return implies(flags, y.flags);
-}
-
-/*! \relates Poly_Con_Relation */
-inline bool
-operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
-  return x.flags == y.flags;
-}
-
-/*! \relates Poly_Con_Relation */
-inline bool
-operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
-  return x.flags != y.flags;
-}
-
-/*! \relates Poly_Con_Relation */
-inline Poly_Con_Relation
-operator&&(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
-  return Poly_Con_Relation(x.flags | y.flags);
-}
-
-/*! \relates Poly_Con_Relation */
-inline Poly_Con_Relation
-operator-(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
-  return Poly_Con_Relation(x.flags & ~y.flags);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Poly_Con_Relation_inlines_hh)
diff --git a/src/Poly_Con_Relation.types.hh b/src/Poly_Con_Relation.types.hh
deleted file mode 100644
index 5f33534..0000000
--- a/src/Poly_Con_Relation.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Poly_Con_Relation_types_hh
-#define PPL_Poly_Con_Relation_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Poly_Con_Relation;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Poly_Con_Relation_types_hh)
diff --git a/src/Poly_Con_Relation_defs.hh b/src/Poly_Con_Relation_defs.hh
new file mode 100644
index 0000000..73034ff
--- /dev/null
+++ b/src/Poly_Con_Relation_defs.hh
@@ -0,0 +1,166 @@
+/* Poly_Con_Relation class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Poly_Con_Relation_defs_hh
+#define PPL_Poly_Con_Relation_defs_hh 1
+
+#include "Poly_Con_Relation_types.hh"
+#include "globals_defs.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+// Put them in the namespace here to declare them friend later.
+
+//! True if and only if \p x and \p y are logically equivalent.
+/*! \relates Poly_Con_Relation */
+bool operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
+
+//! True if and only if \p x and \p y are not logically equivalent.
+/*! \relates Poly_Con_Relation */
+bool operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
+
+//! Yields the logical conjunction of \p x and \p y.
+/*! \relates Poly_Con_Relation */
+Poly_Con_Relation operator&&(const Poly_Con_Relation& x,
+                             const Poly_Con_Relation& y);
+
+/*! \brief
+  Yields the assertion with all the conjuncts of \p x
+  that are not in \p y.
+
+  \relates Poly_Con_Relation
+*/
+Poly_Con_Relation operator-(const Poly_Con_Relation& x,
+                            const Poly_Con_Relation& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Poly_Con_Relation */
+std::ostream& operator<<(std::ostream& s, const Poly_Con_Relation& r);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! The relation between a polyhedron and a constraint.
+/*! \ingroup PPL_CXX_interface
+  This class implements conjunctions of assertions on the relation
+  between a polyhedron and a constraint.
+*/
+class Parma_Polyhedra_Library::Poly_Con_Relation {
+private:
+  //! Poly_Con_Relation is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bit-masks for the individual assertions
+  //@{
+  static const flags_t NOTHING             = 0U;
+  static const flags_t IS_DISJOINT         = 1U << 0;
+  static const flags_t STRICTLY_INTERSECTS = 1U << 1;
+  static const flags_t IS_INCLUDED         = 1U << 2;
+  static const flags_t SATURATES           = 1U << 3;
+  //@} // Bit-masks for the individual assertions
+
+  //! All assertions together.
+  static const flags_t EVERYTHING
+  = IS_DISJOINT
+  | STRICTLY_INTERSECTS
+  | IS_INCLUDED
+  | SATURATES;
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! True if and only if the conjunction \p x implies the conjunction \p y.
+  static bool implies(flags_t x, flags_t y);
+
+  //! Construct from a bit-mask.
+  Poly_Con_Relation(flags_t mask);
+
+  friend bool
+  operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
+  friend bool
+  operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
+
+  friend Poly_Con_Relation
+  operator&&(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
+
+  friend Poly_Con_Relation
+  operator-(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::
+  IO_Operators::operator<<(std::ostream& s, const Poly_Con_Relation& r);
+
+public:
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Access the internal flags: this is needed for some language
+    interfaces.
+  */
+#endif
+  flags_t get_flags() const;
+
+public:
+  //! The assertion that says nothing.
+  static Poly_Con_Relation nothing();
+
+  /*! \brief
+    The polyhedron and the set of points satisfying
+    the constraint are disjoint.
+  */
+  static Poly_Con_Relation is_disjoint();
+
+  /*! \brief
+    The polyhedron intersects the set of points satisfying
+    the constraint, but it is not included in it.
+  */
+  static Poly_Con_Relation strictly_intersects();
+
+  /*! \brief
+    The polyhedron is included in the set of points satisfying
+    the constraint.
+  */
+  static Poly_Con_Relation is_included();
+
+  /*! \brief
+    The polyhedron is included in the set of points saturating
+    the constraint.
+  */
+  static Poly_Con_Relation saturates();
+
+  PPL_OUTPUT_DECLARATIONS
+
+  //! True if and only if \p *this implies \p y.
+  bool implies(const Poly_Con_Relation& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+};
+
+#include "Poly_Con_Relation_inlines.hh"
+
+#endif // !defined(PPL_Poly_Con_Relation_defs_hh)
diff --git a/src/Poly_Con_Relation_inlines.hh b/src/Poly_Con_Relation_inlines.hh
new file mode 100644
index 0000000..b9ba49c
--- /dev/null
+++ b/src/Poly_Con_Relation_inlines.hh
@@ -0,0 +1,100 @@
+/* Poly_Con_Relation class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Poly_Con_Relation_inlines_hh
+#define PPL_Poly_Con_Relation_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Poly_Con_Relation::Poly_Con_Relation(flags_t mask)
+  : flags(mask) {
+}
+
+inline Poly_Con_Relation::flags_t
+Poly_Con_Relation::get_flags() const {
+  return flags;
+}
+
+inline Poly_Con_Relation
+Poly_Con_Relation::nothing() {
+  return Poly_Con_Relation(NOTHING);
+}
+
+inline Poly_Con_Relation
+Poly_Con_Relation::is_disjoint() {
+  return Poly_Con_Relation(IS_DISJOINT);
+}
+
+inline Poly_Con_Relation
+Poly_Con_Relation::strictly_intersects() {
+  return Poly_Con_Relation(STRICTLY_INTERSECTS);
+}
+
+inline Poly_Con_Relation
+Poly_Con_Relation::is_included() {
+  return Poly_Con_Relation(IS_INCLUDED);
+}
+
+inline Poly_Con_Relation
+Poly_Con_Relation::saturates() {
+  return Poly_Con_Relation(SATURATES);
+}
+
+inline bool
+Poly_Con_Relation::implies(flags_t x, flags_t y) {
+  return (x & y) == y;
+}
+
+inline bool
+Poly_Con_Relation::implies(const Poly_Con_Relation& y) const {
+  return implies(flags, y.flags);
+}
+
+/*! \relates Poly_Con_Relation */
+inline bool
+operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
+  return x.flags == y.flags;
+}
+
+/*! \relates Poly_Con_Relation */
+inline bool
+operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
+  return x.flags != y.flags;
+}
+
+/*! \relates Poly_Con_Relation */
+inline Poly_Con_Relation
+operator&&(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
+  return Poly_Con_Relation(x.flags | y.flags);
+}
+
+/*! \relates Poly_Con_Relation */
+inline Poly_Con_Relation
+operator-(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
+  return Poly_Con_Relation(x.flags & ~y.flags);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Poly_Con_Relation_inlines_hh)
diff --git a/src/Poly_Con_Relation_types.hh b/src/Poly_Con_Relation_types.hh
new file mode 100644
index 0000000..c20d762
--- /dev/null
+++ b/src/Poly_Con_Relation_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Poly_Con_Relation_types_hh
+#define PPL_Poly_Con_Relation_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Poly_Con_Relation;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Poly_Con_Relation_types_hh)
diff --git a/src/Poly_Gen_Relation.cc b/src/Poly_Gen_Relation.cc
index b259d26..180155e 100644
--- a/src/Poly_Gen_Relation.cc
+++ b/src/Poly_Gen_Relation.cc
@@ -1,6 +1,6 @@
 /* Poly_Gen_Relation class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Poly_Gen_Relation.defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
 #include "assert.hh"
 #include <iostream>
 #include <string>
diff --git a/src/Poly_Gen_Relation.defs.hh b/src/Poly_Gen_Relation.defs.hh
deleted file mode 100644
index c193c26..0000000
--- a/src/Poly_Gen_Relation.defs.hh
+++ /dev/null
@@ -1,139 +0,0 @@
-/* Poly_Gen_Relation class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Poly_Gen_Relation_defs_hh
-#define PPL_Poly_Gen_Relation_defs_hh 1
-
-#include "Poly_Gen_Relation.types.hh"
-#include "globals.defs.hh"
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-// Put them in the namespace here to declare them friend later.
-
-//! True if and only if \p x and \p y are logically equivalent.
-/*! \relates Poly_Gen_Relation */
-bool operator==(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
-
-//! True if and only if \p x and \p y are not logically equivalent.
-/*! \relates Poly_Gen_Relation */
-bool operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
-
-//! Yields the logical conjunction of \p x and \p y.
-/*! \relates Poly_Gen_Relation */
-Poly_Gen_Relation operator&&(const Poly_Gen_Relation& x,
-			     const Poly_Gen_Relation& y);
-
-/*! \brief
-  Yields the assertion with all the conjuncts of \p x
-  that are not in \p y.
-
-  \relates Poly_Gen_Relation
-*/
-Poly_Gen_Relation operator-(const Poly_Gen_Relation& x,
-			    const Poly_Gen_Relation& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Poly_Gen_Relation */
-std::ostream& operator<<(std::ostream& s, const Poly_Gen_Relation& r);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! The relation between a polyhedron and a generator
-/*! \ingroup PPL_CXX_interface
-  This class implements conjunctions of assertions on the relation
-  between a polyhedron and a generator.
-*/
-class Parma_Polyhedra_Library::Poly_Gen_Relation {
-private:
-  //! Poly_Gen_Relation is implemented by means of a finite bitset.
-  typedef unsigned int flags_t;
-
-  //! \name Bit-masks for the individual assertions
-  //@{
-  static const flags_t NOTHING  = 0U;
-  static const flags_t SUBSUMES = 1U << 0;
-  //@} // Bit-masks for the individual assertions
-
-  //! All assertions together.
-  static const flags_t EVERYTHING
-  = SUBSUMES;
-
-  //! This holds the current bitset.
-  flags_t flags;
-
-  //! True if and only if the conjunction \p x implies the conjunction \p y.
-  static bool implies(flags_t x, flags_t y);
-
-  //! Construct from a bit-mask.
-  Poly_Gen_Relation(flags_t mask);
-
-  friend bool
-  operator==(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
-  friend bool
-  operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
-
-  friend Poly_Gen_Relation
-  operator&&(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
-
-  friend Poly_Gen_Relation
-  operator-(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::
-  IO_Operators::operator<<(std::ostream& s, const Poly_Gen_Relation& r);
-
-public:
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Access the internal flags: this is needed for some language
-    interfaces.
-  */
-#endif
-  flags_t get_flags() const;
-
-public:
-  //! The assertion that says nothing.
-  static Poly_Gen_Relation nothing();
-
-  //! Adding the generator would not change the polyhedron.
-  static Poly_Gen_Relation subsumes();
-
-  PPL_OUTPUT_DECLARATIONS
-
-  //! True if and only if \p *this implies \p y.
-  bool implies(const Poly_Gen_Relation& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-};
-
-#include "Poly_Gen_Relation.inlines.hh"
-
-#endif // !defined(PPL_Poly_Gen_Relation_defs_hh)
diff --git a/src/Poly_Gen_Relation.inlines.hh b/src/Poly_Gen_Relation.inlines.hh
deleted file mode 100644
index 08e5266..0000000
--- a/src/Poly_Gen_Relation.inlines.hh
+++ /dev/null
@@ -1,85 +0,0 @@
-/* Poly_Gen_Relation class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Poly_Gen_Relation_inlines_hh
-#define PPL_Poly_Gen_Relation_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Poly_Gen_Relation::Poly_Gen_Relation(flags_t mask)
-  : flags(mask) {
-}
-
-inline Poly_Gen_Relation::flags_t
-Poly_Gen_Relation::get_flags() const {
-  return flags;
-}
-
-inline Poly_Gen_Relation
-Poly_Gen_Relation::nothing() {
-  return Poly_Gen_Relation(NOTHING);
-}
-
-inline Poly_Gen_Relation
-Poly_Gen_Relation::subsumes() {
-  return Poly_Gen_Relation(SUBSUMES);
-}
-
-inline bool
-Poly_Gen_Relation::implies(flags_t x, flags_t y) {
-  return (x & y) == y;
-}
-
-inline bool
-Poly_Gen_Relation::implies(const Poly_Gen_Relation& y) const {
-  return implies(flags, y.flags);
-}
-
-/*! \relates Poly_Gen_Relation */
-inline bool
-operator==(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
-  return x.flags == y.flags;
-}
-
-/*! \relates Poly_Gen_Relation */
-inline bool
-operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
-  return x.flags != y.flags;
-}
-
-/*! \relates Poly_Gen_Relation */
-inline Poly_Gen_Relation
-operator&&(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
-  return Poly_Gen_Relation(x.flags | y.flags);
-}
-
-/*! \relates Poly_Gen_Relation */
-inline Poly_Gen_Relation
-operator-(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
-  return Poly_Gen_Relation(x.flags & ~y.flags);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Poly_Gen_Relation_inlines_hh)
diff --git a/src/Poly_Gen_Relation.types.hh b/src/Poly_Gen_Relation.types.hh
deleted file mode 100644
index e2f3ae6..0000000
--- a/src/Poly_Gen_Relation.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Poly_Gen_Relation_types_hh
-#define PPL_Poly_Gen_Relation_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Poly_Gen_Relation;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Poly_Gen_Relation_types_hh)
diff --git a/src/Poly_Gen_Relation_defs.hh b/src/Poly_Gen_Relation_defs.hh
new file mode 100644
index 0000000..13e5d00
--- /dev/null
+++ b/src/Poly_Gen_Relation_defs.hh
@@ -0,0 +1,139 @@
+/* Poly_Gen_Relation class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Poly_Gen_Relation_defs_hh
+#define PPL_Poly_Gen_Relation_defs_hh 1
+
+#include "Poly_Gen_Relation_types.hh"
+#include "globals_defs.hh"
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+// Put them in the namespace here to declare them friend later.
+
+//! True if and only if \p x and \p y are logically equivalent.
+/*! \relates Poly_Gen_Relation */
+bool operator==(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
+
+//! True if and only if \p x and \p y are not logically equivalent.
+/*! \relates Poly_Gen_Relation */
+bool operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
+
+//! Yields the logical conjunction of \p x and \p y.
+/*! \relates Poly_Gen_Relation */
+Poly_Gen_Relation operator&&(const Poly_Gen_Relation& x,
+                             const Poly_Gen_Relation& y);
+
+/*! \brief
+  Yields the assertion with all the conjuncts of \p x
+  that are not in \p y.
+
+  \relates Poly_Gen_Relation
+*/
+Poly_Gen_Relation operator-(const Poly_Gen_Relation& x,
+                            const Poly_Gen_Relation& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Poly_Gen_Relation */
+std::ostream& operator<<(std::ostream& s, const Poly_Gen_Relation& r);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! The relation between a polyhedron and a generator
+/*! \ingroup PPL_CXX_interface
+  This class implements conjunctions of assertions on the relation
+  between a polyhedron and a generator.
+*/
+class Parma_Polyhedra_Library::Poly_Gen_Relation {
+private:
+  //! Poly_Gen_Relation is implemented by means of a finite bitset.
+  typedef unsigned int flags_t;
+
+  //! \name Bit-masks for the individual assertions
+  //@{
+  static const flags_t NOTHING  = 0U;
+  static const flags_t SUBSUMES = 1U << 0;
+  //@} // Bit-masks for the individual assertions
+
+  //! All assertions together.
+  static const flags_t EVERYTHING
+  = SUBSUMES;
+
+  //! This holds the current bitset.
+  flags_t flags;
+
+  //! True if and only if the conjunction \p x implies the conjunction \p y.
+  static bool implies(flags_t x, flags_t y);
+
+  //! Construct from a bit-mask.
+  Poly_Gen_Relation(flags_t mask);
+
+  friend bool
+  operator==(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
+  friend bool
+  operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
+
+  friend Poly_Gen_Relation
+  operator&&(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
+
+  friend Poly_Gen_Relation
+  operator-(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::
+  IO_Operators::operator<<(std::ostream& s, const Poly_Gen_Relation& r);
+
+public:
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Access the internal flags: this is needed for some language
+    interfaces.
+  */
+#endif
+  flags_t get_flags() const;
+
+public:
+  //! The assertion that says nothing.
+  static Poly_Gen_Relation nothing();
+
+  //! Adding the generator would not change the polyhedron.
+  static Poly_Gen_Relation subsumes();
+
+  PPL_OUTPUT_DECLARATIONS
+
+  //! True if and only if \p *this implies \p y.
+  bool implies(const Poly_Gen_Relation& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+};
+
+#include "Poly_Gen_Relation_inlines.hh"
+
+#endif // !defined(PPL_Poly_Gen_Relation_defs_hh)
diff --git a/src/Poly_Gen_Relation_inlines.hh b/src/Poly_Gen_Relation_inlines.hh
new file mode 100644
index 0000000..1d6e991
--- /dev/null
+++ b/src/Poly_Gen_Relation_inlines.hh
@@ -0,0 +1,85 @@
+/* Poly_Gen_Relation class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Poly_Gen_Relation_inlines_hh
+#define PPL_Poly_Gen_Relation_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Poly_Gen_Relation::Poly_Gen_Relation(flags_t mask)
+  : flags(mask) {
+}
+
+inline Poly_Gen_Relation::flags_t
+Poly_Gen_Relation::get_flags() const {
+  return flags;
+}
+
+inline Poly_Gen_Relation
+Poly_Gen_Relation::nothing() {
+  return Poly_Gen_Relation(NOTHING);
+}
+
+inline Poly_Gen_Relation
+Poly_Gen_Relation::subsumes() {
+  return Poly_Gen_Relation(SUBSUMES);
+}
+
+inline bool
+Poly_Gen_Relation::implies(flags_t x, flags_t y) {
+  return (x & y) == y;
+}
+
+inline bool
+Poly_Gen_Relation::implies(const Poly_Gen_Relation& y) const {
+  return implies(flags, y.flags);
+}
+
+/*! \relates Poly_Gen_Relation */
+inline bool
+operator==(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
+  return x.flags == y.flags;
+}
+
+/*! \relates Poly_Gen_Relation */
+inline bool
+operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
+  return x.flags != y.flags;
+}
+
+/*! \relates Poly_Gen_Relation */
+inline Poly_Gen_Relation
+operator&&(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
+  return Poly_Gen_Relation(x.flags | y.flags);
+}
+
+/*! \relates Poly_Gen_Relation */
+inline Poly_Gen_Relation
+operator-(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
+  return Poly_Gen_Relation(x.flags & ~y.flags);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Poly_Gen_Relation_inlines_hh)
diff --git a/src/Poly_Gen_Relation_types.hh b/src/Poly_Gen_Relation_types.hh
new file mode 100644
index 0000000..d7f5ec4
--- /dev/null
+++ b/src/Poly_Gen_Relation_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Poly_Gen_Relation_types_hh
+#define PPL_Poly_Gen_Relation_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Poly_Gen_Relation;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Poly_Gen_Relation_types_hh)
diff --git a/src/Polyhedron.defs.hh b/src/Polyhedron.defs.hh
deleted file mode 100644
index 4f8beb7..0000000
--- a/src/Polyhedron.defs.hh
+++ /dev/null
@@ -1,2843 +0,0 @@
-/* Polyhedron class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_defs_hh
-#define PPL_Polyhedron_defs_hh 1
-
-#include "Polyhedron.types.hh"
-#include "globals.types.hh"
-#include "Variable.defs.hh"
-#include "Variables_Set.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint_System.defs.hh"
-#include "Constraint_System.inlines.hh"
-#include "Generator_System.defs.hh"
-#include "Generator_System.inlines.hh"
-#include "Congruence_System.defs.hh"
-#include "Congruence_System.inlines.hh"
-#include "Bit_Matrix.defs.hh"
-#include "Constraint.types.hh"
-#include "Generator.types.hh"
-#include "Congruence.types.hh"
-#include "Poly_Con_Relation.defs.hh"
-#include "Poly_Gen_Relation.defs.hh"
-#include "BHRZ03_Certificate.types.hh"
-#include "H79_Certificate.types.hh"
-#include "Box.types.hh"
-#include "BD_Shape.types.hh"
-#include "Octagonal_Shape.types.hh"
-#include "Interval.types.hh"
-#include "Linear_Form.types.hh"
-#include <vector>
-#include <iosfwd>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*!
-  \relates Parma_Polyhedra_Library::Polyhedron
-  Writes a textual representation of \p ph on \p s:
-  <CODE>false</CODE> is written if \p ph is an empty polyhedron;
-  <CODE>true</CODE> is written if \p ph is a universe polyhedron;
-  a minimized system of constraints defining \p ph is written otherwise,
-  all constraints in one row separated by ", ".
-*/
-std::ostream&
-operator<<(std::ostream& s, const Polyhedron& ph);
-
-} // namespace IO_Operators
-
-//! Swaps \p x with \p y.
-/*! \relates Polyhedron */
-void swap(Polyhedron& x, Polyhedron& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if
-  \p x and \p y are the same polyhedron.
-
-  \relates Polyhedron
-  Note that \p x and \p y may be topology- and/or dimension-incompatible
-  polyhedra: in those cases, the value <CODE>false</CODE> is returned.
-*/
-bool operator==(const Polyhedron& x, const Polyhedron& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if
-  \p x and \p y are different polyhedra.
-
-  \relates Polyhedron
-  Note that \p x and \p y may be topology- and/or dimension-incompatible
-  polyhedra: in those cases, the value <CODE>true</CODE> is returned.
-*/
-bool operator!=(const Polyhedron& x, const Polyhedron& y);
-
-namespace Interfaces {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Returns \c true if and only if
-  <code>ph.topology() == NECESSARILY_CLOSED</code>.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool is_necessarily_closed_for_interfaces(const Polyhedron& ph);
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! The base class for convex polyhedra.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Polyhedron represents a convex polyhedron
-  in the vector space \f$\Rset^n\f$.
-
-  A polyhedron can be specified as either a finite system of constraints
-  or a finite system of generators (see Section \ref representation)
-  and it is always possible to obtain either representation.
-  That is, if we know the system of constraints, we can obtain
-  from this the system of generators that define the same polyhedron
-  and vice versa.
-  These systems can contain redundant members: in this case we say
-  that they are not in the minimal form.
-
-  Two key attributes of any polyhedron are its topological kind
-  (recording whether it is a C_Polyhedron or an NNC_Polyhedron object)
-  and its space dimension (the dimension \f$n \in \Nset\f$ of
-  the enclosing vector space):
-
-  - all polyhedra, the empty ones included, are endowed with
-    a specific topology and space dimension;
-  - most operations working on a polyhedron and another object
-    (i.e., another polyhedron, a constraint or generator,
-    a set of variables, etc.) will throw an exception if
-    the polyhedron and the object are not both topology-compatible
-    and dimension-compatible (see Section \ref representation);
-  - the topology of a polyhedron cannot be changed;
-    rather, there are constructors for each of the two derived classes
-    that will build a new polyhedron with the topology of that class
-    from another polyhedron from either class and any topology;
-  - the only ways in which the space dimension of a polyhedron can
-    be changed are:
-    - <EM>explicit</EM> calls to operators provided for that purpose;
-    - standard copy, assignment and swap operators.
-
-  Note that four different polyhedra can be defined on
-  the zero-dimension space:
-  the empty polyhedron, either closed or NNC,
-  and the universe polyhedron \f$R^0\f$, again either closed or NNC.
-
-  \par
-  In all the examples it is assumed that variables
-  <CODE>x</CODE> and <CODE>y</CODE> are defined (where they are
-  used) as follows:
-  \code
-  Variable x(0);
-  Variable y(1);
-  \endcode
-
-  \par Example 1
-  The following code builds a polyhedron corresponding to
-  a square in \f$\Rset^2\f$, given as a system of constraints:
-  \code
-  Constraint_System cs;
-  cs.insert(x >= 0);
-  cs.insert(x <= 3);
-  cs.insert(y >= 0);
-  cs.insert(y <= 3);
-  C_Polyhedron ph(cs);
-  \endcode
-  The following code builds the same polyhedron as above,
-  but starting from a system of generators specifying
-  the four vertices of the square:
-  \code
-  Generator_System gs;
-  gs.insert(point(0*x + 0*y));
-  gs.insert(point(0*x + 3*y));
-  gs.insert(point(3*x + 0*y));
-  gs.insert(point(3*x + 3*y));
-  C_Polyhedron ph(gs);
-  \endcode
-
-  \par Example 2
-  The following code builds an unbounded polyhedron
-  corresponding to a half-strip in \f$\Rset^2\f$,
-  given as a system of constraints:
-  \code
-  Constraint_System cs;
-  cs.insert(x >= 0);
-  cs.insert(x - y <= 0);
-  cs.insert(x - y + 1 >= 0);
-  C_Polyhedron ph(cs);
-  \endcode
-  The following code builds the same polyhedron as above,
-  but starting from the system of generators specifying
-  the two vertices of the polyhedron and one ray:
-  \code
-  Generator_System gs;
-  gs.insert(point(0*x + 0*y));
-  gs.insert(point(0*x + y));
-  gs.insert(ray(x - y));
-  C_Polyhedron ph(gs);
-  \endcode
-
-  \par Example 3
-  The following code builds the polyhedron corresponding to
-  a half-plane by adding a single constraint
-  to the universe polyhedron in \f$\Rset^2\f$:
-  \code
-  C_Polyhedron ph(2);
-  ph.add_constraint(y >= 0);
-  \endcode
-  The following code builds the same polyhedron as above,
-  but starting from the empty polyhedron in the space \f$\Rset^2\f$
-  and inserting the appropriate generators
-  (a point, a ray and a line).
-  \code
-  C_Polyhedron ph(2, EMPTY);
-  ph.add_generator(point(0*x + 0*y));
-  ph.add_generator(ray(y));
-  ph.add_generator(line(x));
-  \endcode
-  Note that, although the above polyhedron has no vertices, we must add
-  one point, because otherwise the result of the Minkowski's sum
-  would be an empty polyhedron.
-  To avoid subtle errors related to the minimization process,
-  it is required that the first generator inserted in an empty
-  polyhedron is a point (otherwise, an exception is thrown).
-
-  \par Example 4
-  The following code shows the use of the function
-  <CODE>add_space_dimensions_and_embed</CODE>:
-  \code
-  C_Polyhedron ph(1);
-  ph.add_constraint(x == 2);
-  ph.add_space_dimensions_and_embed(1);
-  \endcode
-  We build the universe polyhedron in the 1-dimension space \f$\Rset\f$.
-  Then we add a single equality constraint,
-  thus obtaining the polyhedron corresponding to the singleton set
-  \f$\{ 2 \} \sseq \Rset\f$.
-  After the last line of code, the resulting polyhedron is
-  \f[
-    \bigl\{\,
-      (2, y)^\transpose \in \Rset^2
-    \bigm|
-      y \in \Rset
-    \,\bigr\}.
-  \f]
-
-  \par Example 5
-  The following code shows the use of the function
-  <CODE>add_space_dimensions_and_project</CODE>:
-  \code
-  C_Polyhedron ph(1);
-  ph.add_constraint(x == 2);
-  ph.add_space_dimensions_and_project(1);
-  \endcode
-  The first two lines of code are the same as in Example 4 for
-  <CODE>add_space_dimensions_and_embed</CODE>.
-  After the last line of code, the resulting polyhedron is
-  the singleton set
-  \f$\bigl\{ (2, 0)^\transpose \bigr\} \sseq \Rset^2\f$.
-
-  \par Example 6
-  The following code shows the use of the function
-  <CODE>affine_image</CODE>:
-  \code
-  C_Polyhedron ph(2, EMPTY);
-  ph.add_generator(point(0*x + 0*y));
-  ph.add_generator(point(0*x + 3*y));
-  ph.add_generator(point(3*x + 0*y));
-  ph.add_generator(point(3*x + 3*y));
-  Linear_Expression expr = x + 4;
-  ph.affine_image(x, expr);
-  \endcode
-  In this example the starting polyhedron is a square in
-  \f$\Rset^2\f$, the considered variable is \f$x\f$ and the affine
-  expression is \f$x+4\f$.  The resulting polyhedron is the same
-  square translated to the right.  Moreover, if the affine
-  transformation for the same variable \p x is \f$x+y\f$:
-  \code
-  Linear_Expression expr = x + y;
-  \endcode
-  the resulting polyhedron is a parallelogram with the height equal to
-  the side of the square and the oblique sides parallel to the line
-  \f$x-y\f$.
-  Instead, if we do not use an invertible transformation for the same
-  variable; for example, the affine expression \f$y\f$:
-  \code
-  Linear_Expression expr = y;
-  \endcode
-  the resulting polyhedron is a diagonal of the square.
-
-  \par Example 7
-  The following code shows the use of the function
-  <CODE>affine_preimage</CODE>:
-  \code
-  C_Polyhedron ph(2);
-  ph.add_constraint(x >= 0);
-  ph.add_constraint(x <= 3);
-  ph.add_constraint(y >= 0);
-  ph.add_constraint(y <= 3);
-  Linear_Expression expr = x + 4;
-  ph.affine_preimage(x, expr);
-  \endcode
-  In this example the starting polyhedron, \p var and the affine
-  expression and the denominator are the same as in Example 6,
-  while the resulting polyhedron is again the same square,
-  but translated to the left.
-  Moreover, if the affine transformation for \p x is \f$x+y\f$
-  \code
-  Linear_Expression expr = x + y;
-  \endcode
-  the resulting polyhedron is a parallelogram with the height equal to
-  the side of the square and the oblique sides parallel to the line
-  \f$x+y\f$.
-  Instead, if we do not use an invertible transformation for the same
-  variable \p x, for example, the affine expression \f$y\f$:
-  \code
-  Linear_Expression expr = y;
-  \endcode
-  the resulting polyhedron is a line that corresponds to the \f$y\f$ axis.
-
-  \par Example 8
-  For this example we use also the variables:
-  \code
-  Variable z(2);
-  Variable w(3);
-  \endcode
-  The following code shows the use of the function
-  <CODE>remove_space_dimensions</CODE>:
-  \code
-  Generator_System gs;
-  gs.insert(point(3*x + y + 0*z + 2*w));
-  C_Polyhedron ph(gs);
-  Variables_Set vars;
-  vars.insert(y);
-  vars.insert(z);
-  ph.remove_space_dimensions(vars);
-  \endcode
-  The starting polyhedron is the singleton set
-  \f$\bigl\{ (3, 1, 0, 2)^\transpose \bigr\} \sseq \Rset^4\f$, while
-  the resulting polyhedron is
-  \f$\bigl\{ (3, 2)^\transpose \bigr\} \sseq \Rset^2\f$.
-  Be careful when removing space dimensions <EM>incrementally</EM>:
-  since dimensions are automatically renamed after each application
-  of the <CODE>remove_space_dimensions</CODE> operator, unexpected
-  results can be obtained.
-  For instance, by using the following code we would obtain
-  a different result:
-  \code
-  set<Variable> vars1;
-  vars1.insert(y);
-  ph.remove_space_dimensions(vars1);
-  set<Variable> vars2;
-  vars2.insert(z);
-  ph.remove_space_dimensions(vars2);
-  \endcode
-  In this case, the result is the polyhedron
-  \f$\bigl\{(3, 0)^\transpose \bigr\} \sseq \Rset^2\f$:
-  when removing the set of dimensions \p vars2
-  we are actually removing variable \f$w\f$ of the original polyhedron.
-  For the same reason, the operator \p remove_space_dimensions
-  is not idempotent: removing twice the same non-empty set of dimensions
-  is never the same as removing them just once.
-*/
-
-class Parma_Polyhedra_Library::Polyhedron {
-public:
-  //! The numeric type of coefficients.
-  typedef Coefficient coefficient_type;
-
-  //! Returns the maximum space dimension all kinds of Polyhedron can handle.
-  static dimension_type max_space_dimension();
-
-  /*! \brief
-    Returns \c true indicating that this domain has methods that
-    can recycle constraints.
-  */
-  static bool can_recycle_constraint_systems();
-
-  //! Initializes the class.
-  static void initialize();
-
-  //! Finalizes the class.
-  static void finalize();
-
-  /*! \brief
-    Returns \c false indicating that this domain cannot recycle congruences.
-  */
-  static bool can_recycle_congruence_systems();
-
-protected:
-  //! Builds a polyhedron having the specified properties.
-  /*!
-    \param topol
-    The topology of the polyhedron;
-
-    \param num_dimensions
-    The number of dimensions of the vector space enclosing the polyhedron;
-
-    \param kind
-    Specifies whether the universe or the empty polyhedron has to be built.
-  */
-  Polyhedron(Topology topol,
-	     dimension_type num_dimensions,
-	     Degenerate_Element kind);
-
-  //! Ordinary copy constructor.
-  /*!
-    The complexity argument is ignored.
-  */
-  Polyhedron(const Polyhedron& y,
-             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  //! Builds a polyhedron from a system of constraints.
-  /*!
-    The polyhedron inherits the space dimension of the constraint system.
-
-    \param topol
-    The topology of the polyhedron;
-
-    \param cs
-    The system of constraints defining the polyhedron.
-
-    \exception std::invalid_argument
-    Thrown if the topology of \p cs is incompatible with \p topol.
-  */
-  Polyhedron(Topology topol, const Constraint_System& cs);
-
-  //! Builds a polyhedron recycling a system of constraints.
-  /*!
-    The polyhedron inherits the space dimension of the constraint system.
-
-    \param topol
-    The topology of the polyhedron;
-
-    \param cs
-    The system of constraints defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the topology of \p cs is incompatible with \p topol.
-  */
-  Polyhedron(Topology topol, Constraint_System& cs, Recycle_Input dummy);
-
-  //! Builds a polyhedron from a system of generators.
-  /*!
-    The polyhedron inherits the space dimension of the generator system.
-
-    \param topol
-    The topology of the polyhedron;
-
-    \param gs
-    The system of generators defining the polyhedron.
-
-    \exception std::invalid_argument
-    Thrown if the topology of \p gs is incompatible with \p topol,
-    or if the system of generators is not empty but has no points.
-  */
-  Polyhedron(Topology topol, const Generator_System& gs);
-
-  //! Builds a polyhedron recycling a system of generators.
-  /*!
-    The polyhedron inherits the space dimension of the generator system.
-
-    \param topol
-    The topology of the polyhedron;
-
-    \param gs
-    The system of generators defining the polyhedron.  It is not
-    declared <CODE>const</CODE> because its data-structures may be
-    recycled to build the polyhedron.
-
-    \param dummy
-    A dummy tag to syntactically differentiate this one
-    from the other constructors.
-
-    \exception std::invalid_argument
-    Thrown if the topology of \p gs is incompatible with \p topol,
-    or if the system of generators is not empty but has no points.
-  */
-  Polyhedron(Topology topol, Generator_System& gs, Recycle_Input dummy);
-
-  //! Builds a polyhedron from a box.
-  /*!
-    This will use an algorithm whose complexity is polynomial and build
-    the smallest polyhedron with topology \p topol containing \p box.
-
-    \param topol
-    The topology of the polyhedron;
-
-    \param box
-    The box representing the polyhedron to be built;
-
-    \param complexity
-    This argument is ignored.
-  */
-  template <typename Interval>
-  Polyhedron(Topology topol, const Box<Interval>& box,
-             Complexity_Class complexity = ANY_COMPLEXITY);
-
-  /*! \brief
-    The assignment operator.
-    (\p *this and \p y can be dimension-incompatible.)
-  */
-  Polyhedron& operator=(const Polyhedron& y);
-
-public:
-  //! \name Member Functions that Do Not Modify the Polyhedron
-  //@{
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  /*! \brief
-    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
-    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
-    of \p *this.
-  */
-  dimension_type affine_dimension() const;
-
-  //! Returns the system of constraints.
-  const Constraint_System& constraints() const;
-
-  //! Returns the system of constraints, with no redundant constraint.
-  const Constraint_System& minimized_constraints() const;
-
-  //! Returns the system of generators.
-  const Generator_System& generators() const;
-
-  //! Returns the system of generators, with no redundant generator.
-  const Generator_System& minimized_generators() const;
-
-  //! Returns a system of (equality) congruences satisfied by \p *this.
-  Congruence_System congruences() const;
-
-  /*! \brief
-    Returns a system of (equality) congruences satisfied by \p *this,
-    with no redundant congruences and having the same affine dimension
-    as \p *this.
-  */
-  Congruence_System minimized_congruences() const;
-
-  /*! \brief
-    Returns the relations holding between the polyhedron \p *this
-    and the constraint \p c.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Constraint& c) const;
-
-  /*! \brief
-    Returns the relations holding between the polyhedron \p *this
-    and the generator \p g.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are dimension-incompatible.
-  */
-  Poly_Gen_Relation relation_with(const Generator& g) const;
-
-  /*! \brief
-    Returns the relations holding between the polyhedron \p *this
-    and the congruence \p c.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p c are dimension-incompatible.
-  */
-  Poly_Con_Relation relation_with(const Congruence& cg) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is
-    an empty polyhedron.
-  */
-  bool is_empty() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a universe polyhedron.
-  */
-  bool is_universe() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a topologically closed subset of the vector space.
-  */
-  bool is_topologically_closed() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool is_disjoint_from(const Polyhedron& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
-  bool is_discrete() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    is a bounded polyhedron.
-  */
-  bool is_bounded() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this
-    contains at least one integer point.
-  */
-  bool contains_integer_point() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p var is constrained in
-    \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  bool constrains(Variable var) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from above in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_above(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p expr is
-    bounded from below in \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds_from_below(const Linear_Expression& expr) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value is computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
-    and \p maximum are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from above in \p *this, in which case
-    the supremum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be maximized subject to \p *this;
-
-    \param sup_n
-    The numerator of the supremum value;
-
-    \param sup_d
-    The denominator of the supremum value;
-
-    \param maximum
-    <CODE>true</CODE> if and only if the supremum is also the maximum value;
-
-    \param g
-    When maximization succeeds, will be assigned the point or
-    closure point where \p expr reaches its supremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from above,
-    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
-    and \p g are left untouched.
-  */
-  bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value is computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
-    and \p minimum are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is not empty
-    and \p expr is bounded from below in \p *this, in which case
-    the infimum value and a point where \p expr reaches it are computed.
-
-    \param expr
-    The linear expression to be minimized subject to \p *this;
-
-    \param inf_n
-    The numerator of the infimum value;
-
-    \param inf_d
-    The denominator of the infimum value;
-
-    \param minimum
-    <CODE>true</CODE> if and only if the infimum is also the minimum value;
-
-    \param g
-    When minimization succeeds, will be assigned a point or
-    closure point where \p expr reaches its infimum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded from below,
-    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
-    and \p g are left untouched.
-  */
-  bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if there exist a
-    unique value \p val such that \p *this
-    saturates the equality <CODE>expr = val</CODE>.
-
-    \param expr
-    The linear expression for which the frequency is needed;
-
-    \param freq_n
-    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
-    Present for interface compatibility with class Grid, where
-    the \ref Grid_Frequency "frequency" can have a non-zero value;
-
-    \param freq_d
-    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
-
-    \param val_n
-    The numerator of \p val;
-
-    \param val_d
-    The denominator of \p val;
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
-    \p val_n and \p val_d are left untouched.
-  */
-  bool frequency(const Linear_Expression& expr,
-                 Coefficient& freq_n, Coefficient& freq_d,
-                 Coefficient& val_n, Coefficient& val_d) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool contains(const Polyhedron& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
-  /*!
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool strictly_contains(const Polyhedron& y) const;
-
-  //! Checks if all the invariants are satisfied.
-  /*!
-    \return
-    <CODE>true</CODE> if and only if \p *this satisfies all the
-    invariants and either \p check_not_empty is <CODE>false</CODE> or
-    \p *this is not empty.
-
-    \param check_not_empty
-    <CODE>true</CODE> if and only if, in addition to checking the
-    invariants, \p *this must be checked to be not empty.
-
-    The check is performed so as to intrude as little as possible.  If
-    the library has been compiled with run-time assertions enabled,
-    error messages are written on <CODE>std::cerr</CODE> in case
-    invariants are violated. This is useful for the purpose of
-    debugging the library.
-  */
-  bool OK(bool check_not_empty = false) const;
-
-  //@} // Member Functions that Do Not Modify the Polyhedron
-
-  //! \name Space Dimension Preserving Member Functions that May Modify the Polyhedron
-  //@{
-
-  /*! \brief
-    Adds a copy of constraint \p c to the system of constraints
-    of \p *this (without minimizing the result).
-
-    \param c
-    The constraint that will be added to the system of
-    constraints of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are topology-incompatible
-    or dimension-incompatible.
-  */
-  void add_constraint(const Constraint& c);
-
-  /*! \brief
-    Adds a copy of generator \p g to the system of generators
-    of \p *this (without minimizing the result).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and generator \p g are topology-incompatible or
-    dimension-incompatible, or if \p *this is an empty polyhedron and
-    \p g is not a point.
-  */
-  void add_generator(const Generator& g);
-
-  /*! \brief
-    Adds a copy of congruence \p cg to \p *this,
-    if \p cg can be exactly represented by a polyhedron.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible,
-    of if \p cg is a proper congruence which is neither a tautology,
-    nor a contradiction.
-  */
-  void add_congruence(const Congruence& cg);
-
-  /*! \brief
-    Adds a copy of the constraints in \p cs to the system
-    of constraints of \p *this (without minimizing the result).
-
-    \param cs
-    Contains the constraints that will be added to the system of
-    constraints of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void add_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Adds the constraints in \p cs to the system of constraints
-    of \p *this (without minimizing the result).
-
-    \param cs
-    The constraint system to be added to \p *this.  The constraints in
-    \p cs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are topology-incompatible or
-    dimension-incompatible.
-
-    \warning
-    The only assumption that can be made on \p cs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_constraints(Constraint_System& cs);
-
-  /*! \brief
-    Adds a copy of the generators in \p gs to the system
-    of generators of \p *this (without minimizing the result).
-
-    \param gs
-    Contains the generators that will be added to the system of
-    generators of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p gs are topology-incompatible or
-    dimension-incompatible, or if \p *this is empty and the system of
-    generators \p gs is not empty, but has no points.
-  */
-  void add_generators(const Generator_System& gs);
-
-  /*! \brief
-    Adds the generators in \p gs to the system of generators
-    of \p *this (without minimizing the result).
-
-    \param gs
-    The generator system to be added to \p *this.  The generators in
-    \p gs may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p gs are topology-incompatible or
-    dimension-incompatible, or if \p *this is empty and the system of
-    generators \p gs is not empty, but has no points.
-
-    \warning
-    The only assumption that can be made on \p gs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_generators(Generator_System& gs);
-
-  /*! \brief
-    Adds a copy of the congruences in \p cgs to \p *this,
-    if all the congruences can be exactly represented by a polyhedron.
-
-    \param cgs
-    The congruences to be added.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    of if there exists in \p cgs a proper congruence which is
-    neither a tautology, nor a contradiction.
-  */
-  void add_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Adds the congruences in \p cgs to \p *this,
-    if all the congruences can be exactly represented by a polyhedron.
-
-    \param cgs
-    The congruences to be added. Its elements may be recycled.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible,
-    of if there exists in \p cgs a proper congruence which is
-    neither a tautology, nor a contradiction
-
-    \warning
-    The only assumption that can be made on \p cgs upon successful or
-    exceptional return is that it can be safely destroyed.
-  */
-  void add_recycled_congruences(Congruence_System& cgs);
-
-  /*! \brief
-    Uses a copy of constraint \p c to refine \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and constraint \p c are dimension-incompatible.
-  */
-  void refine_with_constraint(const Constraint& c);
-
-  /*! \brief
-    Uses a copy of congruence \p cg to refine \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and congruence \p cg are dimension-incompatible.
-  */
-  void refine_with_congruence(const Congruence& cg);
-
-  /*! \brief
-    Uses a copy of the constraints in \p cs to refine \p *this.
-
-    \param cs
-    Contains the constraints used to refine the system of
-    constraints of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cs are dimension-incompatible.
-  */
-  void refine_with_constraints(const Constraint_System& cs);
-
-  /*! \brief
-    Uses a copy of the congruences in \p cgs to refine \p *this.
-
-    \param cgs
-    Contains the congruences used to refine the system of
-    constraints of \p *this.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p cgs are dimension-incompatible.
-  */
-  void refine_with_congruences(const Congruence_System& cgs);
-
-  /*! \brief
-    Refines \p *this with the constraint expressed by \p left \f$<\f$
-    \p right if \p is_strict is set, with the constraint \p left \f$\leq\f$
-    \p right otherwise.
-
-    \param left
-    The linear form on intervals with floating point boundaries that
-    is on the left of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param right
-    The linear form on intervals with floating point boundaries that
-    is on the right of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param is_strict
-    True if the comparison is strict.
-
-    \exception std::invalid_argument
-    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
-
-    This function is used in abstract interpretation to model a filter
-    that is generated by a comparison of two expressions that are correctly
-    approximated by \p left and \p right respectively.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  void refine_with_linear_form_inequality(
-  const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
-  const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
-  bool is_strict = false);
-
-  /*! \brief
-    Refines \p *this with the constraint expressed by \p left \f$\relsym\f$
-    \p right, where \f$\relsym\f$ is the relation symbol specified by
-    \p relsym..
-
-    \param left
-    The linear form on intervals with floating point boundaries that
-    is on the left of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param right
-    The linear form on intervals with floating point boundaries that
-    is on the right of the comparison operator. All of its coefficients
-    MUST be bounded.
-
-    \param relsym
-    The relation symbol.
-
-    \exception std::invalid_argument
-    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
-
-    \exception std::runtime_error
-    Thrown if \p relsym is not a valid relation symbol.
-
-    This function is used in abstract interpretation to model a filter
-    that is generated by a comparison of two expressions that are correctly
-    approximated by \p left and \p right respectively.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  void generalized_refine_with_linear_form_inequality(
-  const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
-  const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
-  Relation_Symbol relsym);
-
-  //! Refines \p store with the constraints defining \p *this.
-  /*!
-    \param store
-    The interval floating point abstract store to refine.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  void refine_fp_interval_abstract_store(
-       Box< Interval<FP_Format, Interval_Info> >& store)
-       const;
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to space dimension \p var, assigning the result to \p *this.
-
-    \param var
-    The space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p var is not a space dimension of \p *this.
-  */
-  void unconstrain(Variable var);
-
-  /*! \brief
-    Computes the \ref Cylindrification "cylindrification" of \p *this with
-    respect to the set of space dimensions \p vars,
-    assigning the result to \p *this.
-
-    \param vars
-    The set of space dimension that will be unconstrained.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void unconstrain(const Variables_Set& vars);
-
-  /*! \brief
-    Assigns to \p *this the intersection of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  void intersection_assign(const Polyhedron& y);
-
-  /*! \brief
-    Assigns to \p *this the poly-hull of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  void poly_hull_assign(const Polyhedron& y);
-
-  //! Same as poly_hull_assign(y).
-  void upper_bound_assign(const Polyhedron& y);
-
-  /*! \brief
-    Assigns to \p *this
-    the \ref Convex_Polyhedral_Difference "poly-difference"
-    of \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  void poly_difference_assign(const Polyhedron& y);
-
-  //! Same as poly_difference_assign(y).
-  void difference_assign(const Polyhedron& y);
-
-  /*! \brief
-    Assigns to \p *this a \ref Meet_Preserving_Simplification
-    "meet-preserving simplification" of \p *this with respect to \p y.
-    If \c false is returned, then the intersection is empty.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  bool simplify_using_context_assign(const Polyhedron& y);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine image"
-    of \p *this under the function mapping variable \p var to the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is assigned;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of
-    \p *this.
-
-    \if Include_Implementation_Details
-
-    When considering the generators of a polyhedron, the
-    affine transformation
-    \f[
-      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{\mathrm{denominator}}
-    \f]
-    is assigned to \p var where \p expr is
-    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
-    (\f$b\f$ is the inhomogeneous term).
-
-    If constraints are up-to-date, it uses the specialized function
-    affine_preimage() (for the system of constraints)
-    and inverse transformation to reach the same result.
-    To obtain the inverse transformation we use the following observation.
-
-    Observation:
-    -# The affine transformation is invertible if the coefficient
-       of \p var in this transformation (i.e., \f$a_\mathrm{var}\f$)
-       is different from zero.
-    -# If the transformation is invertible, then we can write
-       \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
-	   = a_\mathrm{var} x_\mathrm{var}
-	     + \sum_{i \neq var} a_i x_i + b,
-       \f]
-       so that the inverse transformation is
-       \f[
-	 a_\mathrm{var} x_\mathrm{var}
-           = \mathrm{denominator} * {x'}_\mathrm{var}
-             - \sum_{i \neq j} a_i x_i - b.
-       \f]
-
-    Then, if the transformation is invertible, all the entities that
-    were up-to-date remain up-to-date. Otherwise only generators remain
-    up-to-date.
-
-    In other words, if \f$R\f$ is a \f$m_1 \times n\f$ matrix representing
-    the rays of the polyhedron, \f$V\f$ is a \f$m_2 \times n\f$
-    matrix representing the points of the polyhedron and
-    \f[
-      P = \bigl\{\,
-            \vect{x} = (x_0, \ldots, x_{n-1})^\mathrm{T}
-          \bigm|
-            \vect{x} = \vect{\lambda} R + \vect{\mu} V,
-	    \vect{\lambda} \in \Rset^{m_1}_+,
-	    \vect{\mu} \in \Rset^{m_2}_+,
-	    \sum_{i = 0}^{m_2 - 1} \mu_i = 1
-          \,\bigr\}
-    \f]
-    and \f$T\f$ is the affine transformation to apply to \f$P\f$, then
-    the resulting polyhedron is
-    \f[
-      P' = \bigl\{\,
-             (x_0, \ldots, T(x_0, \ldots, x_{n-1}),
-                     \ldots, x_{n-1})^\mathrm{T}
-           \bigm|
-             (x_0, \ldots, x_{n-1})^\mathrm{T} \in P
-           \,\bigr\}.
-    \f]
-
-    Affine transformations are, for example:
-    - translations
-    - rotations
-    - symmetries.
-    \endif
-  */
-  void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
-
-  // FIXME: To be completed.
-  /*!
-    Assigns to \p *this the
-    \ref affine_form_relation "affine form image"
-    of \p *this under the function mapping variable \p var into the
-    affine expression(s) specified by \p lf.
-
-    \param var
-    The variable to which the affine expression is assigned.
-
-    \param lf
-    The linear form on intervals with floating point boundaries that
-    defines the affine expression(s). ALL of its coefficients MUST be bounded.
-
-    \exception std::invalid_argument
-    Thrown if \p lf and \p *this are dimension-incompatible or if \p var is
-    not a space dimension of \p *this.
-
-    This function is used in abstract interpretation to model an assignment
-    of a value that is correctly overapproximated by \p lf to the
-    floating point variable represented by \p var.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  void affine_form_image(Variable var,
-  const Linear_Form<Interval <FP_Format, Interval_Info> >& lf);
-
-  /*! \brief
-    Assigns to \p *this the
-    \ref Single_Update_Affine_Functions "affine preimage"
-    of \p *this under the function mapping variable \p var to the
-    affine expression specified by \p expr and \p denominator.
-
-    \param var
-    The variable to which the affine expression is substituted;
-
-    \param expr
-    The numerator of the affine expression;
-
-    \param denominator
-    The denominator of the affine expression (optional argument with
-    default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this.
-
-    \if Include_Implementation_Details
-
-    When considering constraints of a polyhedron, the affine transformation
-    \f[
-      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{denominator},
-    \f]
-    is assigned to \p var where \p expr is
-    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
-    (\f$b\f$ is the inhomogeneous term).
-
-    If generators are up-to-date, then the specialized function
-    affine_image() is used (for the system of generators)
-    and inverse transformation to reach the same result.
-    To obtain the inverse transformation, we use the following observation.
-
-    Observation:
-    -# The affine transformation is invertible if the coefficient
-       of \p var in this transformation (i.e. \f$a_\mathrm{var}\f$)
-       is different from zero.
-    -# If the transformation is invertible, then we can write
-       \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
-           = a_\mathrm{var} x_\mathrm{var}
-               + \sum_{i \neq \mathrm{var}} a_i x_i + b,
-       \f],
-       the inverse transformation is
-       \f[
-	 a_\mathrm{var} x_\mathrm{var}
-           = \mathrm{denominator} * {x'}_\mathrm{var}
-               - \sum_{i \neq j} a_i x_i - b.
-       \f].
-
-    Then, if the transformation is invertible, all the entities that
-    were up-to-date remain up-to-date. Otherwise only constraints remain
-    up-to-date.
-
-    In other words, if \f$A\f$ is a \f$m \times n\f$ matrix representing
-    the constraints of the polyhedron, \f$T\f$ is the affine transformation
-    to apply to \f$P\f$ and
-    \f[
-      P = \bigl\{\,
-            \vect{x} = (x_0, \ldots, x_{n-1})^\mathrm{T}
-          \bigm|
-            A\vect{x} \geq \vect{0}
-          \,\bigr\}.
-    \f]
-    The resulting polyhedron is
-    \f[
-      P' = \bigl\{\,
-             \vect{x} = (x_0, \ldots, x_{n-1}))^\mathrm{T}
-           \bigm|
-             A'\vect{x} \geq \vect{0}
-           \,\bigr\},
-    \f]
-    where \f$A'\f$ is defined as follows:
-    \f[
-      {a'}_{ij}
-        = \begin{cases}
-            a_{ij} * \mathrm{denominator} + a_{i\mathrm{var}}*\mathrm{expr}[j]
-              \quad \mathrm{for } j \neq \mathrm{var}; \\
-            \mathrm{expr}[\mathrm{var}] * a_{i\mathrm{var}},
-              \quad \text{for } j = \mathrm{var}.
-          \end{cases}
-    \f]
-    \endif
-  */
-  void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				= Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
-    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
-    by \p relsym.
-
-    \param var
-    The left hand side variable of the generalized affine relation;
-
-    \param relsym
-    The relation symbol;
-
-    \param expr
-    The numerator of the right hand side affine expression;
-
-    \param denominator
-    The denominator of the right hand side affine expression (optional
-    argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p expr and \p *this are
-    dimension-incompatible or if \p var is not a space dimension of \p *this
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void
-  generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
-
-  /*! \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Generalized_Affine_Relations "generalized affine relation"
-    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
-    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
-
-    \param lhs
-    The left hand side affine expression;
-
-    \param relsym
-    The relation symbol;
-
-    \param rhs
-    The right hand side affine expression.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
-    or if \p *this is a C_Polyhedron and \p relsym is a strict
-    relation symbol.
-  */
-  void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
-
-  /*!
-    \brief
-    Assigns to \p *this the image of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
-
-  /*!
-    \brief
-    Assigns to \p *this the preimage of \p *this with respect to the
-    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
-    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
-         \leq \mathrm{var}'
-           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
-
-    \param var
-    The variable updated by the affine relation;
-
-    \param lb_expr
-    The numerator of the lower bounding affine expression;
-
-    \param ub_expr
-    The numerator of the upper bounding affine expression;
-
-    \param denominator
-    The (common) denominator for the lower and upper bounding
-    affine expressions (optional argument with default value 1).
-
-    \exception std::invalid_argument
-    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
-    and \p *this are dimension-incompatible or if \p var is not a space
-    dimension of \p *this.
-  */
-  void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  void time_elapse_assign(const Polyhedron& y);
-
-  /*! \brief
-    \ref Wrapping_Operator "Wraps" the specified dimensions of the
-    vector space.
-
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be wrapped.
-
-    \param w
-    The width of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param r
-    The representation of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param o
-    The overflow behavior of the bounded integer type corresponding to
-    all the dimensions to be wrapped.
-
-    \param cs_p
-    Possibly null pointer to a constraint system whose variables
-    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
-    variables not in \p vars, the behavior is undefined.
-    When non-null, the pointed-to constraint system is assumed to
-    represent the conditional or looping construct guard with respect
-    to which wrapping is performed.  Since wrapping requires the
-    computation of upper bounds and due to non-distributivity of
-    constraint refinement over upper bounds, passing a constraint
-    system in this way can be more precise than refining the result of
-    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
-
-    \param complexity_threshold
-    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
-    higher values result in possibly improved precision.
-
-    \param wrap_individually
-    <CODE>true</CODE> if the dimensions should be wrapped individually
-    (something that results in much greater efficiency to the detriment of
-    precision).
-
-    \exception std::invalid_argument
-    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
-    \p vars, or if \p *this is dimension-incompatible \p vars or with
-    <CODE>*cs_p</CODE>.
-  */
-  void wrap_assign(const Variables_Set& vars,
-                   Bounded_Integer_Type_Width w,
-                   Bounded_Integer_Type_Representation r,
-                   Bounded_Integer_Type_Overflow o,
-                   const Constraint_System* cs_p = 0,
-                   unsigned complexity_threshold = 16,
-                   bool wrap_individually = true);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p vars.
-
-    \param vars
-    Points with non-integer coordinates for these variables/space-dimensions
-    can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set& vars,
-                                    Complexity_Class complexity
-                                    = ANY_COMPLEXITY);
-
-  //! Assigns to \p *this its topological closure.
-  void topological_closure_assign();
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref BHRZ03_widening "BHRZ03-widening" between \p *this and \p y.
-
-    \param y
-    A polyhedron that <EM>must</EM> be contained in \p *this;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  void BHRZ03_widening_assign(const Polyhedron& y, unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref limited_extrapolation "limited extrapolation"
-    between \p *this and \p y using the \ref BHRZ03_widening
-    "BHRZ03-widening" operator.
-
-    \param y
-    A polyhedron that <EM>must</EM> be contained in \p *this;
-
-    \param cs
-    The system of constraints used to improve the widened polyhedron;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void limited_BHRZ03_extrapolation_assign(const Polyhedron& y,
-					   const Constraint_System& cs,
-					   unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref bounded_extrapolation "bounded extrapolation"
-    between \p *this and \p y using the \ref BHRZ03_widening
-    "BHRZ03-widening" operator.
-
-    \param y
-    A polyhedron that <EM>must</EM> be contained in \p *this;
-
-    \param cs
-    The system of constraints used to improve the widened polyhedron;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void bounded_BHRZ03_extrapolation_assign(const Polyhedron& y,
-					   const Constraint_System& cs,
-					   unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref H79_widening "H79_widening" between \p *this and \p y.
-
-    \param y
-    A polyhedron that <EM>must</EM> be contained in \p *this;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible or
-    dimension-incompatible.
-  */
-  void H79_widening_assign(const Polyhedron& y, unsigned* tp = 0);
-
-  //! Same as H79_widening_assign(y, tp).
-  void widening_assign(const Polyhedron& y, unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref limited_extrapolation "limited extrapolation"
-    between \p *this and \p y using the \ref H79_widening
-    "H79-widening" operator.
-
-    \param y
-    A polyhedron that <EM>must</EM> be contained in \p *this;
-
-    \param cs
-    The system of constraints used to improve the widened polyhedron;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void limited_H79_extrapolation_assign(const Polyhedron& y,
-					const Constraint_System& cs,
-					unsigned* tp = 0);
-
-  /*! \brief
-    Assigns to \p *this the result of computing the
-    \ref bounded_extrapolation "bounded extrapolation"
-    between \p *this and \p y using the \ref H79_widening
-    "H79-widening" operator.
-
-    \param y
-    A polyhedron that <EM>must</EM> be contained in \p *this;
-
-    \param cs
-    The system of constraints used to improve the widened polyhedron;
-
-    \param tp
-    An optional pointer to an unsigned variable storing the number of
-    available tokens (to be used when applying the
-    \ref Widening_with_Tokens "widening with tokens" delay technique).
-
-    \exception std::invalid_argument
-    Thrown if \p *this, \p y and \p cs are topology-incompatible or
-    dimension-incompatible.
-  */
-  void bounded_H79_extrapolation_assign(const Polyhedron& y,
-					const Constraint_System& cs,
-					unsigned* tp = 0);
-
-  //@} // Space Dimension Preserving Member Functions that May Modify [...]
-
-  //! \name Member Functions that May Modify the Dimension of the Vector Space
-  //@{
-
-  /*! \brief
-    Adds \p m new space dimensions and embeds the old polyhedron
-    in the new vector space.
-
-    \param m
-    The number of dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    The new space dimensions will be those having the highest indexes
-    in the new polyhedron, which is characterized by a system
-    of constraints in which the variables running through
-    the new dimensions are not constrained.
-    For instance, when starting from the polyhedron \f$\cP \sseq \Rset^2\f$
-    and adding a third space dimension, the result will be the polyhedron
-    \f[
-      \bigl\{\,
-        (x, y, z)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cP
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_embed(dimension_type m);
-
-  /*! \brief
-    Adds \p m new space dimensions to the polyhedron
-    and does not embed it in the new vector space.
-
-    \param m
-    The number of space dimensions to add.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    The new space dimensions will be those having the highest indexes
-    in the new polyhedron, which is characterized by a system
-    of constraints in which the variables running through
-    the new dimensions are all constrained to be equal to 0.
-    For instance, when starting from the polyhedron \f$\cP \sseq \Rset^2\f$
-    and adding a third space dimension, the result will be the polyhedron
-    \f[
-      \bigl\{\,
-        (x, y, 0)^\transpose \in \Rset^3
-      \bigm|
-        (x, y)^\transpose \in \cP
-      \,\bigr\}.
-    \f]
-  */
-  void add_space_dimensions_and_project(dimension_type m);
-
-  /*! \brief
-    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
-    of \p *this and \p y, taken in this order.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are topology-incompatible.
-
-    \exception std::length_error
-    Thrown if the concatenation would cause the vector space
-    to exceed dimension <CODE>max_space_dimension()</CODE>.
-  */
-  void concatenate_assign(const Polyhedron& y);
-
-  //! Removes all the specified dimensions from the vector space.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be removed.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with one of the
-    Variable objects contained in \p vars.
-  */
-  void remove_space_dimensions(const Variables_Set& vars);
-
-  /*! \brief
-    Removes the higher dimensions of the vector space so that
-    the resulting space will have dimension \p new_dimension.
-
-    \exception std::invalid_argument
-    Thrown if \p new_dimensions is greater than the space dimension of
-    \p *this.
-  */
-  void remove_higher_space_dimensions(dimension_type new_dimension);
-
-  /*! \brief
-    Remaps the dimensions of the vector space according to
-    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
-
-    \param pfunc
-    The partial function specifying the destiny of each space dimension.
-
-    The template type parameter Partial_Function must provide
-    the following methods.
-    \code
-      bool has_empty_codomain() const
-    \endcode
-    returns <CODE>true</CODE> if and only if the represented partial
-    function has an empty codomain (i.e., it is always undefined).
-    The <CODE>has_empty_codomain()</CODE> method will always be called
-    before the methods below.  However, if
-    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
-    of the functions below will be called.
-    \code
-      dimension_type max_in_codomain() const
-    \endcode
-    returns the maximum value that belongs to the codomain
-    of the partial function.
-    The <CODE>max_in_codomain()</CODE> method is called at most once.
-    \code
-      bool maps(dimension_type i, dimension_type& j) const
-    \endcode
-    Let \f$f\f$ be the represented function and \f$k\f$ be the value
-    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
-    assigned to \p j and <CODE>true</CODE> is returned.
-    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
-    returned.
-    This method is called at most \f$n\f$ times, where \f$n\f$ is the
-    dimension of the vector space enclosing the polyhedron.
-
-    The result is undefined if \p pfunc does not encode a partial
-    function with the properties described in the
-    \ref Mapping_the_Dimensions_of_the_Vector_Space
-    "specification of the mapping operator".
-  */
-  template <typename Partial_Function>
-  void map_space_dimensions(const Partial_Function& pfunc);
-
-  //! Creates \p m copies of the space dimension corresponding to \p var.
-  /*!
-    \param var
-    The variable corresponding to the space dimension to be replicated;
-
-    \param m
-    The number of replicas to be created.
-
-    \exception std::invalid_argument
-    Thrown if \p var does not correspond to a dimension of the vector space.
-
-    \exception std::length_error
-    Thrown if adding \p m new space dimensions would cause the
-    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
-    then the \f$k\f$-th space dimension is
-    \ref expand_space_dimension "expanded" to \p m new space dimensions
-    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
-  */
-  void expand_space_dimension(Variable var, dimension_type m);
-
-  //! Folds the space dimensions in \p vars into \p dest.
-  /*!
-    \param vars
-    The set of Variable objects corresponding to the space dimensions
-    to be folded;
-
-    \param dest
-    The variable corresponding to the space dimension that is the
-    destination of the folding operation.
-
-    \exception std::invalid_argument
-    Thrown if \p *this is dimension-incompatible with \p dest or with
-    one of the Variable objects contained in \p vars.
-    Also thrown if \p dest is contained in \p vars.
-
-    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
-    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
-    \p vars is a set of variables whose maximum space dimension
-    is also less than or equal to \f$n\f$, and \p dest is not a member
-    of \p vars, then the space dimensions corresponding to
-    variables in \p vars are \ref fold_space_dimensions "folded"
-    into the \f$k\f$-th space dimension.
-  */
-  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
-
-  //@} // Member Functions that May Modify the Dimension of the Vector Space
-
-  friend bool operator==(const Polyhedron& x, const Polyhedron& y);
-
-  //! \name Miscellaneous Member Functions
-  //@{
-
-  //! Destructor.
-  ~Polyhedron();
-
-  /*! \brief
-    Swaps \p *this with polyhedron \p y.
-    (\p *this and \p y can be dimension-incompatible.)
-
-    \exception std::invalid_argument
-    Thrown if \p x and \p y are topology-incompatible.
-  */
-  void m_swap(Polyhedron& y);
-
-  PPL_OUTPUT_DECLARATIONS
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a 32-bit hash code for \p *this.
-
-    If \p x and \p y are such that <CODE>x == y</CODE>,
-    then <CODE>x.hash_code() == y.hash_code()</CODE>.
-  */
-  int32_t hash_code() const;
-
-  //@} // Miscellaneous Member Functions
-
-private:
-  static const Representation default_con_sys_repr = DENSE;
-  static const Representation default_gen_sys_repr = DENSE;
-
-  //! The system of constraints.
-  Constraint_System con_sys;
-
-  //! The system of generators.
-  Generator_System gen_sys;
-
-  //! The saturation matrix having constraints on its columns.
-  Bit_Matrix sat_c;
-
-  //! The saturation matrix having generators on its columns.
-  Bit_Matrix sat_g;
-
-#define PPL_IN_Polyhedron_CLASS
-#include "Ph_Status.idefs.hh"
-#undef PPL_IN_Polyhedron_CLASS
-
-  //! The status flags to keep track of the polyhedron's internal state.
-  Status status;
-
-  //! The number of dimensions of the enclosing vector space.
-  dimension_type space_dim;
-
-  //! Returns the topological kind of the polyhedron.
-  Topology topology() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if the polyhedron
-    is necessarily closed.
-  */
-  bool is_necessarily_closed() const;
-
-  friend bool
-  Parma_Polyhedra_Library::Interfaces
-  ::is_necessarily_closed_for_interfaces(const Polyhedron&);
-
-  /*! \brief
-    Uses a copy of constraint \p c to refine the system of constraints
-    of \p *this.
-
-    \param c The constraint to be added. If it is dimension-incompatible
-    with \p *this, the behavior is undefined.
-  */
-  void refine_no_check(const Constraint& c);
-
-  //! \name Private Verifiers: Verify if Individual Flags are Set
-  //@{
-
-  //! Returns <CODE>true</CODE> if the polyhedron is known to be empty.
-  /*!
-    The return value <CODE>false</CODE> does not necessarily
-    implies that \p *this is non-empty.
-  */
-  bool marked_empty() const;
-
-  //! Returns <CODE>true</CODE> if the system of constraints is up-to-date.
-  bool constraints_are_up_to_date() const;
-
-  //! Returns <CODE>true</CODE> if the system of generators is up-to-date.
-  bool generators_are_up_to_date() const;
-
-  //! Returns <CODE>true</CODE> if the system of constraints is minimized.
-  /*!
-    Note that only \em weak minimization is entailed, so that
-    an NNC polyhedron may still have \f$\epsilon\f$-redundant constraints.
-  */
-  bool constraints_are_minimized() const;
-
-  //! Returns <CODE>true</CODE> if the system of generators is minimized.
-  /*!
-    Note that only \em weak minimization is entailed, so that
-    an NNC polyhedron may still have \f$\epsilon\f$-redundant generators.
-  */
-  bool generators_are_minimized() const;
-
-  //! Returns <CODE>true</CODE> if there are pending constraints.
-  bool has_pending_constraints() const;
-
-  //! Returns <CODE>true</CODE> if there are pending generators.
-  bool has_pending_generators() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if there are
-    either pending constraints or pending generators.
-  */
-  bool has_something_pending() const;
-
-  //! Returns <CODE>true</CODE> if the polyhedron can have something pending.
-  bool can_have_something_pending() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the saturation matrix \p sat_c
-    is up-to-date.
-  */
-  bool sat_c_is_up_to_date() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the saturation matrix \p sat_g
-    is up-to-date.
-  */
-  bool sat_g_is_up_to_date() const;
-
-  //@} // Private Verifiers: Verify if Individual Flags are Set
-
-  //! \name State Flag Setters: Set Only the Specified Flags
-  //@{
-
-  /*! \brief
-    Sets \p status to express that the polyhedron is the universe
-    0-dimension vector space, clearing all corresponding matrices.
-  */
-  void set_zero_dim_univ();
-
-  /*! \brief
-    Sets \p status to express that the polyhedron is empty,
-    clearing all corresponding matrices.
-  */
-  void set_empty();
-
-  //! Sets \p status to express that constraints are up-to-date.
-  void set_constraints_up_to_date();
-
-  //! Sets \p status to express that generators are up-to-date.
-  void set_generators_up_to_date();
-
-  //! Sets \p status to express that constraints are minimized.
-  void set_constraints_minimized();
-
-  //! Sets \p status to express that generators are minimized.
-  void set_generators_minimized();
-
-  //! Sets \p status to express that constraints are pending.
-  void set_constraints_pending();
-
-  //! Sets \p status to express that generators are pending.
-  void set_generators_pending();
-
-  //! Sets \p status to express that \p sat_c is up-to-date.
-  void set_sat_c_up_to_date();
-
-  //! Sets \p status to express that \p sat_g is up-to-date.
-  void set_sat_g_up_to_date();
-
-  //@} // State Flag Setters: Set Only the Specified Flags
-
-  //! \name State Flag Cleaners: Clear Only the Specified Flag
-  //@{
-
-  //! Clears the \p status flag indicating that the polyhedron is empty.
-  void clear_empty();
-
-  //! Sets \p status to express that constraints are no longer up-to-date.
-  /*!
-    This also implies that they are neither minimized
-    and both saturation matrices are no longer meaningful.
-  */
-  void clear_constraints_up_to_date();
-
-  //! Sets \p status to express that generators are no longer up-to-date.
-  /*!
-    This also implies that they are neither minimized
-    and both saturation matrices are no longer meaningful.
-  */
-  void clear_generators_up_to_date();
-
-  //! Sets \p status to express that constraints are no longer minimized.
-  void clear_constraints_minimized();
-
-  //! Sets \p status to express that generators are no longer minimized.
-  void clear_generators_minimized();
-
-  //! Sets \p status to express that there are no longer pending constraints.
-  void clear_pending_constraints();
-
-  //! Sets \p status to express that there are no longer pending generators.
-  void clear_pending_generators();
-
-  //! Sets \p status to express that \p sat_c is no longer up-to-date.
-  void clear_sat_c_up_to_date();
-
-  //! Sets \p status to express that \p sat_g is no longer up-to-date.
-  void clear_sat_g_up_to_date();
-
-  //@} // State Flag Cleaners: Clear Only the Specified Flag
-
-  //! \name The Handling of Pending Rows
-  //@{
-
-  /*! \brief
-    Processes the pending rows of either description of the polyhedron
-    and obtains a minimized polyhedron.
-
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-
-    It is assumed that the polyhedron does have some constraints or
-    generators pending.
-  */
-  bool process_pending() const;
-
-  //! Processes the pending constraints and obtains a minimized polyhedron.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-
-    It is assumed that the polyhedron does have some pending constraints.
-  */
-  bool process_pending_constraints() const;
-
-  //! Processes the pending generators and obtains a minimized polyhedron.
-  /*!
-    It is assumed that the polyhedron does have some pending generators.
-  */
-  void process_pending_generators() const;
-
-  /*! \brief
-    Lazily integrates the pending descriptions of the polyhedron
-    to obtain a constraint system without pending rows.
-
-    It is assumed that the polyhedron does have some constraints or
-    generators pending.
-  */
-  void remove_pending_to_obtain_constraints() const;
-
-  /*! \brief
-    Lazily integrates the pending descriptions of the polyhedron
-    to obtain a generator system without pending rows.
-
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-
-    It is assumed that the polyhedron does have some constraints or
-    generators pending.
-  */
-  bool remove_pending_to_obtain_generators() const;
-
-  //@} // The Handling of Pending Rows
-
-  //! \name Updating and Sorting Matrices
-  //@{
-
-  //! Updates constraints starting from generators and minimizes them.
-  /*!
-    The resulting system of constraints is only partially sorted:
-    the equalities are in the upper part of the matrix,
-    while the inequalities in the lower part.
-  */
-  void update_constraints() const;
-
-  //! Updates generators starting from constraints and minimizes them.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-
-    The resulting system of generators is only partially sorted:
-    the lines are in the upper part of the matrix,
-    while rays and points are in the lower part.
-    It is illegal to call this method when the Status field
-    already declares the polyhedron to be empty.
-  */
-  bool update_generators() const;
-
-  //! Updates \p sat_c using the updated constraints and generators.
-  /*!
-    It is assumed that constraints and generators are up-to-date
-    and minimized and that the Status field does not already flag
-    \p sat_c to be up-to-date.
-    The values of the saturation matrix are computed as follows:
-    \f[
-      \begin{cases}
-        sat\_c[i][j] = 0,
-          \quad \text{if } G[i] \cdot C^\mathrm{T}[j] = 0; \\
-        sat\_c[i][j] = 1,
-          \quad \text{if } G[i] \cdot C^\mathrm{T}[j] > 0.
-      \end{cases}
-    \f]
-  */
-  void update_sat_c() const;
-
-  //! Updates \p sat_g using the updated constraints and generators.
-  /*!
-    It is assumed that constraints and generators are up-to-date
-    and minimized and that the Status field does not already flag
-    \p sat_g to be up-to-date.
-    The values of the saturation matrix are computed as follows:
-    \f[
-      \begin{cases}
-        sat\_g[i][j] = 0,
-          \quad \text{if } C[i] \cdot G^\mathrm{T}[j] = 0; \\
-        sat\_g[i][j] = 1,
-          \quad \text{if } C[i] \cdot G^\mathrm{T}[j] > 0.
-      \end{cases}
-    \f]
-  */
-  void update_sat_g() const;
-
-  //! Sorts the matrix of constraints keeping status consistency.
-  /*!
-    It is assumed that constraints are up-to-date.
-    If at least one of the saturation matrices is up-to-date,
-    then \p sat_g is kept consistent with the sorted matrix
-    of constraints.
-    The method is declared \p const because reordering
-    the constraints does not modify the polyhedron
-    from a \e logical point of view.
-  */
-  void obtain_sorted_constraints() const;
-
-  //! Sorts the matrix of generators keeping status consistency.
-  /*!
-    It is assumed that generators are up-to-date.
-    If at least one of the saturation matrices is up-to-date,
-    then \p sat_c is kept consistent with the sorted matrix
-    of generators.
-    The method is declared \p const because reordering
-    the generators does not modify the polyhedron
-    from a \e logical point of view.
-  */
-  void obtain_sorted_generators() const;
-
-  //! Sorts the matrix of constraints and updates \p sat_c.
-  /*!
-    It is assumed that both constraints and generators
-    are up-to-date and minimized.
-    The method is declared \p const because reordering
-    the constraints does not modify the polyhedron
-    from a \e logical point of view.
-  */
-  void obtain_sorted_constraints_with_sat_c() const;
-
-  //! Sorts the matrix of generators and updates \p sat_g.
-  /*!
-    It is assumed that both constraints and generators
-    are up-to-date and minimized.
-    The method is declared \p const because reordering
-    the generators does not modify the polyhedron
-    from a \e logical point of view.
-  */
-  void obtain_sorted_generators_with_sat_g() const;
-
-  //@} // Updating and Sorting Matrices
-
-  //! \name Weak and Strong Minimization of Descriptions
-  //@{
-
-  //! Applies (weak) minimization to both the constraints and generators.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-
-    Minimization is not attempted if the Status field already declares
-    both systems to be minimized.
-  */
-  bool minimize() const;
-
-  //! Applies strong minimization to the constraints of an NNC polyhedron.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-  */
-  bool strongly_minimize_constraints() const;
-
-  //! Applies strong minimization to the generators of an NNC polyhedron.
-  /*!
-    \return
-    <CODE>false</CODE> if and only if \p *this turns out to be an
-    empty polyhedron.
-  */
-  bool strongly_minimize_generators() const;
-
-  //! If constraints are up-to-date, obtain a simplified copy of them.
-  Constraint_System simplified_constraints() const;
-
-  //@} // Weak and Strong Minimization of Descriptions
-
-  enum Three_Valued_Boolean {
-    TVB_TRUE,
-    TVB_FALSE,
-    TVB_DONT_KNOW
-  };
-
-  //! Polynomial but incomplete equivalence test between polyhedra.
-  Three_Valued_Boolean quick_equivalence_test(const Polyhedron& y) const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is included in \p y.
-  bool is_included_in(const Polyhedron& y) const;
-
-  //! Checks if and how \p expr is bounded in \p *this.
-  /*!
-    Returns <CODE>true</CODE> if and only if \p from_above is
-    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
-    or \p from_above is <CODE>false</CODE> and \p expr is bounded
-    from below in \p *this.
-
-    \param expr
-    The linear expression to test;
-
-    \param from_above
-    <CODE>true</CODE> if and only if the boundedness of interest is
-    "from above".
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-  */
-  bool bounds(const Linear_Expression& expr, bool from_above) const;
-
-  //! Maximizes or minimizes \p expr subject to \p *this.
-  /*!
-    \param expr
-    The linear expression to be maximized or minimized subject to \p
-    *this;
-
-    \param maximize
-    <CODE>true</CODE> if maximization is what is wanted;
-
-    \param ext_n
-    The numerator of the extremum value;
-
-    \param ext_d
-    The denominator of the extremum value;
-
-    \param included
-    <CODE>true</CODE> if and only if the extremum of \p expr can
-    actually be reached in \p * this;
-
-    \param g
-    When maximization or minimization succeeds, will be assigned
-    a point or closure point where \p expr reaches the
-    corresponding extremum value.
-
-    \exception std::invalid_argument
-    Thrown if \p expr and \p *this are dimension-incompatible.
-
-    If \p *this is empty or \p expr is not bounded in the appropriate
-    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
-    \p included and \p g are left untouched.
-  */
-  bool max_min(const Linear_Expression& expr,
-	       bool maximize,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included,
-	       Generator& g) const;
-
-  //! \name Widening- and Extrapolation-Related Functions
-  //@{
-
-  /*! \brief
-    Copies to \p cs_selection the constraints of \p y corresponding
-    to the definition of the CH78-widening of \p *this and \p y.
-  */
-  void select_CH78_constraints(const Polyhedron& y,
-			       Constraint_System& cs_selection) const;
-
-  /*! \brief
-    Splits the constraints of `x' into two subsets, depending on whether
-    or not they are selected to compute the \ref H79_widening "H79-widening"
-    of \p *this and \p y.
-  */
-  void select_H79_constraints(const Polyhedron& y,
-			      Constraint_System& cs_selected,
-			      Constraint_System& cs_not_selected) const;
-
-  bool BHRZ03_combining_constraints(const Polyhedron& y,
-				    const BHRZ03_Certificate& y_cert,
- 				    const Polyhedron& H79,
-				    const Constraint_System& x_minus_H79_cs);
-
-  bool BHRZ03_evolving_points(const Polyhedron& y,
-			      const BHRZ03_Certificate& y_cert,
-			      const Polyhedron& H79);
-
-  bool BHRZ03_evolving_rays(const Polyhedron& y,
-			    const BHRZ03_Certificate& y_cert,
-			    const Polyhedron& H79);
-
-  static void modify_according_to_evolution(Linear_Expression& ray,
-                                            const Linear_Expression& x,
-                                            const Linear_Expression& y);
-
-  //@} // Widening- and Extrapolation-Related Functions
-
-  //! Adds new space dimensions to the given linear systems.
-  /*!
-    \param sys1
-    The linear system to which columns are added;
-
-    \param sys2
-    The linear system to which rows and columns are added;
-
-    \param sat1
-    The saturation matrix whose columns are indexed by the rows of
-    \p sys1. On entry it is up-to-date;
-
-    \param sat2
-    The saturation matrix whose columns are indexed by the rows of \p
-    sys2;
-
-    \param add_dim
-    The number of space dimensions to add.
-
-    Adds new space dimensions to the vector space modifying the linear
-    systems and saturation matrices.
-    This function is invoked only by
-    <CODE>add_space_dimensions_and_embed()</CODE> and
-    <CODE>add_space_dimensions_and_project()</CODE>, passing the
-    linear system of constraints and that of generators (and the
-    corresponding saturation matrices) in different order (see those
-    methods for details).
-  */
-  template <typename Linear_System1, typename Linear_System2>
-  static void add_space_dimensions(Linear_System1& sys1,
-				   Linear_System2& sys2,
-				   Bit_Matrix& sat1,
-				   Bit_Matrix& sat2,
-				   dimension_type add_dim);
-
-  //! \name Minimization-Related Static Member Functions
-  //@{
-
-  //! Builds and simplifies constraints from generators (or vice versa).
-  // Detailed Doxygen comment to be found in file minimize.cc.
-  template <typename Source_Linear_System, typename Dest_Linear_System>
-  static bool minimize(bool con_to_gen,
-		       Source_Linear_System& source,
-		       Dest_Linear_System& dest,
-		       Bit_Matrix& sat);
-
-  /*! \brief
-    Adds given constraints and builds minimized corresponding generators
-    or vice versa.
-  */
-  // Detailed Doxygen comment to be found in file minimize.cc.
-  template <typename Source_Linear_System1, typename Source_Linear_System2,
-            typename Dest_Linear_System>
-  static bool add_and_minimize(bool con_to_gen,
-			       Source_Linear_System1& source1,
-			       Dest_Linear_System& dest,
-			       Bit_Matrix& sat,
-			       const Source_Linear_System2& source2);
-
-  /*! \brief
-    Adds given constraints and builds minimized corresponding generators
-    or vice versa. The given constraints are in \p source.
-  */
-  // Detailed Doxygen comment to be found in file minimize.cc.
-  template <typename Source_Linear_System, typename Dest_Linear_System>
-  static bool add_and_minimize(bool con_to_gen,
-			       Source_Linear_System& source,
-			       Dest_Linear_System& dest,
-			       Bit_Matrix& sat);
-
-  //! Performs the conversion from constraints to generators and vice versa.
-  // Detailed Doxygen comment to be found in file conversion.cc.
-  template <typename Source_Linear_System, typename Dest_Linear_System>
-  static dimension_type conversion(Source_Linear_System& source,
-				   dimension_type start,
-				   Dest_Linear_System& dest,
-				   Bit_Matrix& sat,
-				   dimension_type num_lines_or_equalities);
-
-  /*! \brief
-    Uses Gauss' elimination method to simplify the result of
-    <CODE>conversion()</CODE>.
-  */
-  // Detailed Doxygen comment to be found in file simplify.cc.
-  template <typename Linear_System1>
-  static dimension_type simplify(Linear_System1& sys, Bit_Matrix& sat);
-
-  //@} // Minimization-Related Static Member Functions
-
-  /*! \brief
-    Pointer to an array used by simplify().
-
-    Holds (between class initialization and finalization) a pointer to
-    an array, allocated with operator new[](), of
-    simplify_num_saturators_size elements.
-  */
-  static dimension_type* simplify_num_saturators_p;
-
-  /*! \brief
-    Dimension of an array used by simplify().
-
-    Holds (between class initialization and finalization) the size of the
-    array pointed to by simplify_num_saturators_p.
-  */
-  static size_t simplify_num_saturators_size;
-
-  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
-  template <typename T> friend class Parma_Polyhedra_Library::BD_Shape;
-  template <typename T> friend class Parma_Polyhedra_Library::Octagonal_Shape;
-  friend class Parma_Polyhedra_Library::Grid;
-  friend class Parma_Polyhedra_Library::BHRZ03_Certificate;
-  friend class Parma_Polyhedra_Library::H79_Certificate;
-
-protected:
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    If the poly-hull of \p *this and \p y is exact it is assigned
-    to \p *this and \c true is returned, otherwise \c false is returned.
-
-    Current implementation is based on (a variant of) Algorithm 8.1 in
-      A. Bemporad, K. Fukuda, and F. D. Torrisi
-      <em>Convexity Recognition of the Union of Polyhedra</em>
-      Technical Report AUT00-13, ETH Zurich, 2000
-
-    \note
-    It is assumed that \p *this and \p y are topologically closed
-    and dimension-compatible;
-    if the assumption does not hold, the behavior is undefined.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  bool BFT00_poly_hull_assign_if_exact(const Polyhedron& y);
-
-  bool BHZ09_poly_hull_assign_if_exact(const Polyhedron& y);
-  bool BHZ09_C_poly_hull_assign_if_exact(const Polyhedron& y);
-  bool BHZ09_NNC_poly_hull_assign_if_exact(const Polyhedron& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \name Exception Throwers
-  //@{
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-protected:
-  void throw_invalid_argument(const char* method, const char* reason) const;
-
-  void throw_topology_incompatible(const char* method,
-				   const char* ph_name,
-				   const Polyhedron& ph) const;
-  void throw_topology_incompatible(const char* method,
-				   const char* c_name,
-				   const Constraint& c) const;
-  void throw_topology_incompatible(const char* method,
-				   const char* g_name,
-				   const Generator& g) const;
-  void throw_topology_incompatible(const char* method,
-				   const char* cs_name,
-				   const Constraint_System& cs) const;
-  void throw_topology_incompatible(const char* method,
-				   const char* gs_name,
-				   const Generator_System& gs) const;
-
-  void throw_dimension_incompatible(const char* method,
-				    const char* other_name,
-				    dimension_type other_dim) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* ph_name,
-				    const Polyhedron& ph) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* le_name,
-				    const Linear_Expression& le) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* c_name,
-				    const Constraint& c) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* g_name,
-				    const Generator& g) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* cg_name,
-				    const Congruence& cg) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* cs_name,
-				    const Constraint_System& cs) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* gs_name,
-				    const Generator_System& gs) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* cgs_name,
-				    const Congruence_System& cgs) const;
-  template <typename C>
-  void throw_dimension_incompatible(const char* method,
-				    const char* lf_name,
-				    const Linear_Form<C>& lf) const;
-  void throw_dimension_incompatible(const char* method,
-				    const char* var_name,
-				    Variable var) const;
-  void throw_dimension_incompatible(const char* method,
-				    dimension_type required_space_dim) const;
-
-  // Note: the following three methods need to be static, because they
-  // can be called inside constructors (before actually constructing the
-  // polyhedron object).
-  static dimension_type
-  check_space_dimension_overflow(dimension_type dim, dimension_type max,
-                                 const Topology topol,
-                                 const char* method, const char* reason);
-
-  static dimension_type
-  check_space_dimension_overflow(dimension_type dim, const Topology topol,
-                                 const char* method, const char* reason);
-
-  template <typename Object>
-  static Object&
-  check_obj_space_dimension_overflow(Object& input, Topology topol,
-                                     const char* method, const char* reason);
-
-  void throw_invalid_generator(const char* method,
-			       const char* g_name) const;
-
-  void throw_invalid_generators(const char* method,
-				const char* gs_name) const;
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //@} // Exception Throwers
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-  /*! \brief
-    Possibly tightens \p *this by dropping some points with non-integer
-    coordinates for the space dimensions corresponding to \p *vars_p.
-
-    \param vars_p
-    When nonzero, points with non-integer coordinates for the
-    variables/space-dimensions contained in \p *vars_p can be discarded.
-
-    \param complexity
-    The maximal complexity of any algorithms used.
-
-    \note
-    Currently there is no optimality guarantee, not even if
-    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
-  */
-  void drop_some_non_integer_points(const Variables_Set* vars_p,
-                                    Complexity_Class complexity);
-
-  //! Helper function that overapproximates an interval linear form.
-  /*!
-    \param lf
-    The linear form on intervals with floating point boundaries to approximate.
-    ALL of its coefficients MUST be bounded.
-
-    \param lf_dimension
-    Must be the space dimension of \p lf.
-
-    \param result
-    Used to store the result.
-
-    This function makes \p result become a linear form that is a correct
-    approximation of \p lf under the constraints specified by \p *this.
-    The resulting linear form has the property that all of its variable
-    coefficients have a non-significant upper bound and can thus be
-    considered as singletons.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  void overapproximate_linear_form(
-  const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
-  const dimension_type lf_dimension,
-  Linear_Form<Interval <FP_Format, Interval_Info> >& result);
-
-  /*! \brief
-    Helper function that makes \p result become a Linear_Expression obtained
-    by normalizing the denominators in \p lf.
-
-    \param lf
-    The linear form on intervals with floating point boundaries to normalize.
-    It should be the result of an application of static method
-    <CODE>overapproximate_linear_form</CODE>.
-
-    \param lf_dimension
-    Must be the space dimension of \p lf.
-
-    \param result
-    Used to store the result.
-
-    This function ignores the upper bound of intervals in \p lf,
-    so that in fact \p result can be seen as \p lf multiplied by a proper
-    normalization constant.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  static void convert_to_integer_expression(
-	      const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
-              const dimension_type lf_dimension,
-              Linear_Expression& result);
-
-  //! Normalization helper function.
-  /*!
-    \param lf
-    The linear form on intervals with floating point boundaries to normalize.
-    It should be the result of an application of static method
-    <CODE>overapproximate_linear_form</CODE>.
-
-    \param lf_dimension
-    Must be the space dimension of \p lf.
-
-    \param res
-    Stores the normalized linear form, except its inhomogeneous term.
-
-    \param res_low_coeff
-    Stores the lower boundary of the inhomogeneous term of the result.
-
-    \param res_hi_coeff
-    Stores the higher boundary of the inhomogeneous term of the result.
-
-    \param denominator
-    Becomes the common denominator of \p res_low_coeff, \p res_hi_coeff
-    and all coefficients in \p res.
-
-    Results are obtained by normalizing denominators in \p lf, ignoring
-    the upper bounds of variable coefficients in \p lf.
-  */
-  template <typename FP_Format, typename Interval_Info>
-  static void
-  convert_to_integer_expressions(const Linear_Form<Interval<FP_Format,
-                                                            Interval_Info> >&
-                                 lf,
-                                 const dimension_type lf_dimension,
-                                 Linear_Expression& res,
-                                 Coefficient& res_low_coeff,
-                                 Coefficient& res_hi_coeff,
-                                 Coefficient& denominator);
-
-  template <typename Linear_System1, typename Row2>
-  static bool
-  add_to_system_and_check_independence(Linear_System1& eq_sys,
-                                       const Row2& eq);
-};
-
-#include "Ph_Status.inlines.hh"
-#include "Polyhedron.inlines.hh"
-#include "Polyhedron.templates.hh"
-#include "Polyhedron_chdims.templates.hh"
-#include "Polyhedron_conversion.templates.hh"
-#include "Polyhedron_minimize.templates.hh"
-#include "Polyhedron_simplify.templates.hh"
-
-#endif // !defined(PPL_Polyhedron_defs_hh)
diff --git a/src/Polyhedron.inlines.hh b/src/Polyhedron.inlines.hh
deleted file mode 100644
index ecdc412..0000000
--- a/src/Polyhedron.inlines.hh
+++ /dev/null
@@ -1,461 +0,0 @@
-/* Polyhedron class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_inlines_hh
-#define PPL_Polyhedron_inlines_hh 1
-
-#include "Generator.defs.hh"
-#include "compiler.hh"
-#include <algorithm>
-#include <deque>
-
-namespace Parma_Polyhedra_Library {
-
-inline memory_size_type
-Polyhedron::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline dimension_type
-Polyhedron::space_dimension() const {
-  return space_dim;
-}
-
-inline int32_t
-Polyhedron::hash_code() const {
-  return hash_code_from_dimension(space_dimension());
-}
-
-inline dimension_type
-Polyhedron::max_space_dimension() {
-  using std::min;
-  // One dimension is reserved to have a value of type dimension_type
-  // that does not represent a legal dimension.
-  return min(std::numeric_limits<dimension_type>::max() - 1,
-	     min(Constraint_System::max_space_dimension(),
-		 Generator_System::max_space_dimension()
-		 )
-	     );
-}
-
-inline Topology
-Polyhedron::topology() const {
-  // We can check either one of the two matrices.
-  // (`con_sys' is slightly better, since it is placed at offset 0.)
-  return con_sys.topology();
-}
-
-inline bool
-Polyhedron::is_discrete() const {
-  return affine_dimension() == 0;
-}
-
-inline bool
-Polyhedron::is_necessarily_closed() const {
-  // We can check either one of the two matrices.
-  // (`con_sys' is slightly better, since it is placed at offset 0.)
-  return con_sys.is_necessarily_closed();
-}
-
-inline void
-Polyhedron::upper_bound_assign(const Polyhedron& y) {
-  poly_hull_assign(y);
-}
-
-inline void
-Polyhedron::difference_assign(const Polyhedron& y) {
-  poly_difference_assign(y);
-}
-
-inline void
-Polyhedron::widening_assign(const Polyhedron& y, unsigned* tp) {
-  H79_widening_assign(y, tp);
-}
-
-inline
-Polyhedron::~Polyhedron() {
-}
-
-inline void
-Polyhedron::m_swap(Polyhedron& y) {
-  if (topology() != y.topology())
-    throw_topology_incompatible("swap(y)", "y", y);
-  using std::swap;
-  swap(con_sys, y.con_sys);
-  swap(gen_sys, y.gen_sys);
-  swap(sat_c, y.sat_c);
-  swap(sat_g, y.sat_g);
-  swap(status, y.status);
-  swap(space_dim, y.space_dim);
-}
-
-/*! \relates Polyhedron */
-inline void
-swap(Polyhedron& x, Polyhedron& y) {
-  x.m_swap(y);
-}
-
-inline bool
-Polyhedron::can_recycle_constraint_systems() {
-  return true;
-}
-
-inline bool
-Polyhedron::can_recycle_congruence_systems() {
-  return false;
-}
-
-inline bool
-Polyhedron::marked_empty() const {
-  return status.test_empty();
-}
-
-inline bool
-Polyhedron::constraints_are_up_to_date() const {
-  return status.test_c_up_to_date();
-}
-
-inline bool
-Polyhedron::generators_are_up_to_date() const {
-  return status.test_g_up_to_date();
-}
-
-inline bool
-Polyhedron::constraints_are_minimized() const {
-  return status.test_c_minimized();
-}
-
-inline bool
-Polyhedron::generators_are_minimized() const {
-  return status.test_g_minimized();
-}
-
-inline bool
-Polyhedron::sat_c_is_up_to_date() const {
-  return status.test_sat_c_up_to_date();
-}
-
-inline bool
-Polyhedron::sat_g_is_up_to_date() const {
-  return status.test_sat_g_up_to_date();
-}
-
-inline bool
-Polyhedron::has_pending_constraints() const {
-  return status.test_c_pending();
-}
-
-inline bool
-Polyhedron::has_pending_generators() const {
-  return status.test_g_pending();
-}
-
-inline bool
-Polyhedron::has_something_pending() const {
-  return status.test_c_pending() || status.test_g_pending();
-}
-
-inline bool
-Polyhedron::can_have_something_pending() const {
-  return constraints_are_minimized()
-    && generators_are_minimized()
-    && (sat_c_is_up_to_date() || sat_g_is_up_to_date());
-}
-
-inline bool
-Polyhedron::is_empty() const {
-  if (marked_empty())
-    return true;
-  // Try a fast-fail test: if generators are up-to-date and
-  // there are no pending constraints, then the generator system
-  // (since it is well formed) contains a point.
-  if (generators_are_up_to_date() && !has_pending_constraints())
-    return false;
-  return !minimize();
-}
-
-inline void
-Polyhedron::set_constraints_up_to_date() {
-  status.set_c_up_to_date();
-}
-
-inline void
-Polyhedron::set_generators_up_to_date() {
-  status.set_g_up_to_date();
-}
-
-inline void
-Polyhedron::set_constraints_minimized() {
-  set_constraints_up_to_date();
-  status.set_c_minimized();
-}
-
-inline void
-Polyhedron::set_generators_minimized() {
-  set_generators_up_to_date();
-  status.set_g_minimized();
-}
-
-inline void
-Polyhedron::set_constraints_pending() {
-  status.set_c_pending();
-}
-
-inline void
-Polyhedron::set_generators_pending() {
-  status.set_g_pending();
-}
-
-inline void
-Polyhedron::set_sat_c_up_to_date() {
-  status.set_sat_c_up_to_date();
-}
-
-inline void
-Polyhedron::set_sat_g_up_to_date() {
-  status.set_sat_g_up_to_date();
-}
-
-inline void
-Polyhedron::clear_empty() {
-  status.reset_empty();
-}
-
-inline void
-Polyhedron::clear_constraints_minimized() {
-  status.reset_c_minimized();
-}
-
-inline void
-Polyhedron::clear_generators_minimized() {
-  status.reset_g_minimized();
-}
-
-inline void
-Polyhedron::clear_pending_constraints() {
-  status.reset_c_pending();
-}
-
-inline void
-Polyhedron::clear_pending_generators() {
-  status.reset_g_pending();
-}
-
-inline void
-Polyhedron::clear_sat_c_up_to_date() {
-  status.reset_sat_c_up_to_date();
-  // Can get rid of sat_c here.
-}
-
-inline void
-Polyhedron::clear_sat_g_up_to_date() {
-  status.reset_sat_g_up_to_date();
-  // Can get rid of sat_g here.
-}
-
-inline void
-Polyhedron::clear_constraints_up_to_date() {
-  clear_pending_constraints();
-  clear_constraints_minimized();
-  clear_sat_c_up_to_date();
-  clear_sat_g_up_to_date();
-  status.reset_c_up_to_date();
-  // Can get rid of con_sys here.
-}
-
-inline void
-Polyhedron::clear_generators_up_to_date() {
-  clear_pending_generators();
-  clear_generators_minimized();
-  clear_sat_c_up_to_date();
-  clear_sat_g_up_to_date();
-  status.reset_g_up_to_date();
-  // Can get rid of gen_sys here.
-}
-
-inline bool
-Polyhedron::process_pending() const {
-  PPL_ASSERT(space_dim > 0 && !marked_empty());
-  PPL_ASSERT(has_something_pending());
-
-  Polyhedron& x = const_cast<Polyhedron&>(*this);
-
-  if (x.has_pending_constraints())
-    return x.process_pending_constraints();
-
-  PPL_ASSERT(x.has_pending_generators());
-  x.process_pending_generators();
-  return true;
-}
-
-inline bool
-Polyhedron::bounds_from_above(const Linear_Expression& expr) const {
-  return bounds(expr, true);
-}
-
-inline bool
-Polyhedron::bounds_from_below(const Linear_Expression& expr) const {
-  return bounds(expr, false);
-}
-
-inline bool
-Polyhedron::maximize(const Linear_Expression& expr,
-		     Coefficient& sup_n, Coefficient& sup_d,
-		     bool& maximum) const {
-  Generator g(point());
-  return max_min(expr, true, sup_n, sup_d, maximum, g);
-}
-
-inline bool
-Polyhedron::maximize(const Linear_Expression& expr,
-		     Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		     Generator& g) const {
-  return max_min(expr, true, sup_n, sup_d, maximum, g);
-}
-
-inline bool
-Polyhedron::minimize(const Linear_Expression& expr,
-		     Coefficient& inf_n, Coefficient& inf_d,
-		     bool& minimum) const {
-  Generator g(point());
-  return max_min(expr, false, inf_n, inf_d, minimum, g);
-}
-
-inline bool
-Polyhedron::minimize(const Linear_Expression& expr,
-		     Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		     Generator& g) const {
-  return max_min(expr, false, inf_n, inf_d, minimum, g);
-}
-
-inline Constraint_System
-Polyhedron::simplified_constraints() const {
-  PPL_ASSERT(constraints_are_up_to_date());
-  Constraint_System cs(con_sys);
-  if (cs.num_pending_rows() > 0)
-    cs.unset_pending_rows();
-  if (has_pending_constraints() || !constraints_are_minimized())
-    cs.simplify();
-  return cs;
-}
-
-inline Congruence_System
-Polyhedron::congruences() const {
-  return Congruence_System(minimized_constraints());
-}
-
-inline Congruence_System
-Polyhedron::minimized_congruences() const {
-  return Congruence_System(minimized_constraints());
-}
-
-inline void
-Polyhedron::add_recycled_congruences(Congruence_System& cgs) {
-  add_congruences(cgs);
-}
-
-template <typename FP_Format, typename Interval_Info>
-inline void
-Polyhedron::generalized_refine_with_linear_form_inequality(
-	    const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
-	    const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
-            const Relation_Symbol relsym) {
-  switch (relsym) {
-  case EQUAL:
-    // TODO: see if we can handle this case more efficiently.
-    refine_with_linear_form_inequality(left, right, false);
-    refine_with_linear_form_inequality(right, left, false);
-    break;
-  case LESS_THAN:
-    refine_with_linear_form_inequality(left, right, true);
-    break;
-  case LESS_OR_EQUAL:
-    refine_with_linear_form_inequality(left, right, false);
-    break;
-  case GREATER_THAN:
-    refine_with_linear_form_inequality(right, left, true);
-    break;
-  case GREATER_OR_EQUAL:
-    refine_with_linear_form_inequality(right, left, false);
-    break;
-  case NOT_EQUAL:
-    break;
-  default:
-    PPL_UNREACHABLE;
-    break;
-  }
-}
-
-template <typename FP_Format, typename Interval_Info>
-inline void
-Polyhedron::
-refine_fp_interval_abstract_store(
-       Box< Interval<FP_Format, Interval_Info> >& store) const {
-
-  // Check that FP_Format is indeed a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
-                     "Polyhedron::refine_fp_interval_abstract_store:"
-                     " T not a floating point type.");
-
-  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
-  store.intersection_assign(Box<FP_Interval_Type>(*this));
-
-}
-
-/*! \relates Polyhedron */
-inline bool
-operator!=(const Polyhedron& x, const Polyhedron& y) {
-  return !(x == y);
-}
-
-inline bool
-Polyhedron::strictly_contains(const Polyhedron& y) const {
-  const Polyhedron& x = *this;
-  return x.contains(y) && !y.contains(x);
-}
-
-inline void
-Polyhedron::drop_some_non_integer_points(Complexity_Class complexity) {
-  const Variables_Set* p_vs = 0;
-  drop_some_non_integer_points(p_vs, complexity);
-}
-
-inline void
-Polyhedron::drop_some_non_integer_points(const Variables_Set& vars,
-					 Complexity_Class complexity) {
-  drop_some_non_integer_points(&vars, complexity);
-}
-
-
-namespace Interfaces {
-
-inline bool
-is_necessarily_closed_for_interfaces(const Polyhedron& ph) {
-  return ph.is_necessarily_closed();
-}
-
-} // namespace Interfaces
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_inlines_hh)
diff --git a/src/Polyhedron.templates.hh b/src/Polyhedron.templates.hh
deleted file mode 100644
index 7bf33e4..0000000
--- a/src/Polyhedron.templates.hh
+++ /dev/null
@@ -1,579 +0,0 @@
-/* Polyhedron class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_templates_hh
-#define PPL_Polyhedron_templates_hh 1
-
-#include "Generator.defs.hh"
-#include "MIP_Problem.defs.hh"
-#include "Interval.defs.hh"
-#include "Linear_Form.defs.hh"
-// For static method overflows.
-#include "Floating_Point_Expression.defs.hh"
-#include <algorithm>
-#include <deque>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Interval>
-Polyhedron::Polyhedron(Topology topol,
-                       const Box<Interval>& box,
-                       Complexity_Class)
-  : con_sys(topol, default_con_sys_repr),
-    gen_sys(topol, default_gen_sys_repr),
-    sat_c(),
-    sat_g() {
-  // Initialize the space dimension as indicated by the box.
-  space_dim = box.space_dimension();
-
-  // Check for emptiness.
-  if (box.is_empty()) {
-    set_empty();
-    return;
-  }
-
-  // Zero-dim universe polyhedron.
-  if (space_dim == 0) {
-    set_zero_dim_univ();
-    return;
-  }
-
-  // Properly set the space dimension of `con_sys'.
-  con_sys.set_space_dimension(space_dim);
-
-  PPL_DIRTY_TEMP_COEFFICIENT(l_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(l_d);
-  PPL_DIRTY_TEMP_COEFFICIENT(u_n);
-  PPL_DIRTY_TEMP_COEFFICIENT(u_d);
-
-  if (topol == NECESSARILY_CLOSED) {
-    for (dimension_type k = space_dim; k-- > 0; ) {
-      const Variable v_k = Variable(k);
-      // See if we have a valid lower bound.
-      bool l_closed = false;
-      bool l_bounded = box.has_lower_bound(v_k, l_n, l_d, l_closed);
-      // See if we have a valid upper bound.
-      bool u_closed = false;
-      bool u_bounded = box.has_upper_bound(v_k, u_n, u_d, u_closed);
-
-      // See if we have an implicit equality constraint.
-      if (l_bounded && u_bounded
-          && l_closed && u_closed
-          && l_n == u_n && l_d == u_d) {
-        // Add the constraint `l_d*v_k == l_n'.
-        con_sys.insert(l_d * v_k == l_n);
-      }
-      else {
-        if (l_bounded)
-          // Add the constraint `l_d*v_k >= l_n'.
-          con_sys.insert(l_d * v_k >= l_n);
-        if (u_bounded)
-          // Add the constraint `u_d*v_k <= u_n'.
-          con_sys.insert(u_d * v_k <= u_n);
-      }
-    }
-  }
-  else {
-    // topol == NOT_NECESSARILY_CLOSED
-    for (dimension_type k = space_dim; k-- > 0; ) {
-      const Variable v_k = Variable(k);
-      // See if we have a valid lower bound.
-      bool l_closed = false;
-      bool l_bounded = box.has_lower_bound(v_k, l_n, l_d, l_closed);
-      // See if we have a valid upper bound.
-      bool u_closed = false;
-      bool u_bounded = box.has_upper_bound(v_k, u_n, u_d, u_closed);
-
-      // See if we have an implicit equality constraint.
-      if (l_bounded && u_bounded
-          && l_closed && u_closed
-          && l_n == u_n && l_d == u_d) {
-        // Add the constraint `l_d*v_k == l_n'.
-        con_sys.insert(l_d * v_k == l_n);
-      }
-      else {
-        // Check if a lower bound constraint is required.
-        if (l_bounded) {
-          if (l_closed)
-            // Add the constraint `l_d*v_k >= l_n'.
-            con_sys.insert(l_d * v_k >= l_n);
-          else
-            // Add the constraint `l_d*v_k > l_n'.
-            con_sys.insert(l_d * v_k > l_n);
-        }
-        // Check if an upper bound constraint is required.
-        if (u_bounded) {
-          if (u_closed)
-            // Add the constraint `u_d*v_k <= u_n'.
-            con_sys.insert(u_d * v_k <= u_n);
-          else
-            // Add the constraint `u_d*v_k < u_n'.
-            con_sys.insert(u_d * v_k < u_n);
-        }
-      }
-    }
-  }
-
-  // Adding the low-level constraints.
-  con_sys.add_low_level_constraints();
-
-  // Constraints are up-to-date.
-  set_constraints_up_to_date();
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename Partial_Function>
-void
-Polyhedron::map_space_dimensions(const Partial_Function& pfunc) {
-  if (space_dim == 0)
-    return;
-
-  if (pfunc.has_empty_codomain()) {
-    // All dimensions vanish: the polyhedron becomes zero_dimensional.
-    if (marked_empty()
-	|| (has_pending_constraints()
-	    && !remove_pending_to_obtain_generators())
-	|| (!generators_are_up_to_date() && !update_generators())) {
-      // Removing all dimensions from the empty polyhedron.
-      space_dim = 0;
-      con_sys.clear();
-    }
-    else
-      // Removing all dimensions from a non-empty polyhedron.
-      set_zero_dim_univ();
-
-    PPL_ASSERT_HEAVY(OK());
-    return;
-  }
-
-  const dimension_type new_space_dimension = pfunc.max_in_codomain() + 1;
-
-  if (new_space_dimension == space_dim) {
-    // The partial function `pfunc' is indeed total and thus specifies
-    // a permutation, that is, a renaming of the dimensions.  For
-    // maximum efficiency, we will simply permute the columns of the
-    // constraint system and/or the generator system.
-
-    std::vector<Variable> cycle;
-    cycle.reserve(space_dim);
-
-    // Used to mark elements as soon as they are inserted in a cycle.
-    std::deque<bool> visited(space_dim);
-
-    for (dimension_type i = space_dim; i-- > 0; ) {
-      if (visited[i])
-        continue;
-
-      dimension_type j = i;
-      do {
-        visited[j] = true;
-        // The following initialization is only to make the compiler happy.
-        dimension_type k = 0;
-        if (!pfunc.maps(j, k))
-          throw_invalid_argument("map_space_dimensions(pfunc)",
-                                 " pfunc is inconsistent");
-        if (k == j)
-          break;
-
-        cycle.push_back(Variable(j));
-        // Go along the cycle.
-        j = k;
-      } while (!visited[j]);
-
-      // End of cycle.
-
-      // Permute all that is up-to-date.  Notice that the contents of
-      // the saturation matrices is unaffected by the permutation of
-      // columns: they remain valid, if they were so.
-      if (constraints_are_up_to_date())
-        con_sys.permute_space_dimensions(cycle);
-
-      if (generators_are_up_to_date())
-        gen_sys.permute_space_dimensions(cycle);
-
-      cycle.clear();
-    }
-
-    PPL_ASSERT_HEAVY(OK());
-    return;
-  }
-
-  // If control gets here, then `pfunc' is not a permutation and some
-  // dimensions must be projected away.
-
-  // If there are pending constraints, using `generators()' we process them.
-  const Generator_System& old_gensys = generators();
-
-  if (old_gensys.has_no_rows()) {
-    // The polyhedron is empty.
-    Polyhedron new_polyhedron(topology(), new_space_dimension, EMPTY);
-    m_swap(new_polyhedron);
-    PPL_ASSERT_HEAVY(OK());
-    return;
-  }
-
-  // Make a local copy of the partial function.
-  std::vector<dimension_type> pfunc_maps(space_dim, not_a_dimension());
-  for (dimension_type j = space_dim; j-- > 0; ) {
-    dimension_type pfunc_j;
-    if (pfunc.maps(j, pfunc_j))
-      pfunc_maps[j] = pfunc_j;
-  }
-
-  Generator_System new_gensys;
-  for (Generator_System::const_iterator i = old_gensys.begin(),
-	 old_gensys_end = old_gensys.end(); i != old_gensys_end; ++i) {
-    const Generator& old_g = *i;
-    const Generator::Expression& old_e = old_g.expression();
-    Linear_Expression expr;
-    expr.set_space_dimension(new_space_dimension);
-    bool all_zeroes = true;
-    for (Generator::Expression::const_iterator j = old_e.begin(),
-          j_end = old_e.end(); j != j_end; ++j) {
-      const dimension_type mapped_id = pfunc_maps[j.variable().id()];
-      if (mapped_id != not_a_dimension()) {
-        add_mul_assign(expr, *j, Variable(mapped_id));
-	all_zeroes = false;
-      }
-    }
-    switch (old_g.type()) {
-    case Generator::LINE:
-      if (!all_zeroes)
-	new_gensys.insert(line(expr));
-      break;
-    case Generator::RAY:
-      if (!all_zeroes)
-	new_gensys.insert(ray(expr));
-      break;
-    case Generator::POINT:
-      // A point in the origin has all zero homogeneous coefficients.
-      new_gensys.insert(point(expr, old_g.divisor()));
-      break;
-    case Generator::CLOSURE_POINT:
-      // A closure point in the origin has all zero homogeneous coefficients.
-      new_gensys.insert(closure_point(expr, old_g.divisor()));
-      break;
-    }
-  }
-  Polyhedron new_polyhedron(topology(), new_gensys);
-  m_swap(new_polyhedron);
-  PPL_ASSERT_HEAVY(OK(true));
-}
-
-template <typename FP_Format, typename Interval_Info>
-void
-Polyhedron::refine_with_linear_form_inequality(
-  const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
-  const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
-  const bool is_strict) {
-
-  // Check that FP_Format is indeed a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
-                         "Polyhedron::refine_with_linear_form_inequality:"
-                         " FP_Format not a floating point type.");
-
-  // Dimension compatibility checks.
-  // The dimensions of left and right should not be greater than the
-  // dimension of *this.
-  const dimension_type left_space_dim = left.space_dimension();
-  if (space_dim < left_space_dim)
-    throw_dimension_incompatible(
-          "refine_with_linear_form_inequality(l1, l2, s)", "l1", left);
-
-  const dimension_type right_space_dim = right.space_dimension();
-  if (space_dim < right_space_dim)
-    throw_dimension_incompatible(
-          "refine_with_linear_form_inequality(l1, l2, s)", "l2", right);
-
-  // We assume that the analyzer will not refine an unreachable test.
-  PPL_ASSERT(!marked_empty());
-
-  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
-  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
-
-  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
-      overflows(left))
-    return;
-
-  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
-      overflows(right))
-    return;
-
-  // Overapproximate left - right.
-  FP_Linear_Form left_minus_right(left);
-  left_minus_right -= right;
-  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
-      overflows(left_minus_right))
-    return;
-
-  dimension_type lf_space_dim = left_minus_right.space_dimension();
-  FP_Linear_Form lf_approx;
-  overapproximate_linear_form(left_minus_right, lf_space_dim, lf_approx);
-  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
-      overflows(lf_approx))
-    return;
-
-  // Normalize left - right.
-  Linear_Expression lf_approx_le;
-  convert_to_integer_expression(lf_approx, lf_space_dim, lf_approx_le);
-
-  // Finally, do the refinement.
-  if (!is_strict || is_necessarily_closed())
-    refine_with_constraint(lf_approx_le <= 0);
-  else
-    refine_with_constraint(lf_approx_le < 0);
-}
-
-template <typename FP_Format, typename Interval_Info>
-void
-Polyhedron::affine_form_image(const Variable var,
-const Linear_Form<Interval <FP_Format, Interval_Info> >& lf) {
-
-  // Check that FP_Format is indeed a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
-                         "Polyhedron::affine_form_image:"
-                         " FP_Format not a floating point type.");
-
-  // Dimension compatibility checks.
-  // The dimension of lf should not be greater than the dimension of *this.
-  const dimension_type lf_space_dim = lf.space_dimension();
-  if (space_dim < lf_space_dim)
-    throw_dimension_incompatible("affine_form_image(v, l, s)", "l", lf);
-
-  // `var' should be one of the dimensions of the polyhedron.
-  const dimension_type var_id = var.id();
-  if (space_dim < var_id + 1)
-    throw_dimension_incompatible("affine_form_image(v, l, s)", "v", var);
-
-  // We assume that the analyzer will not perform an unreachable assignment.
-  PPL_ASSERT(!marked_empty());
-
-  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
-  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
-
-  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
-      overflows(lf)) {
-    *this = Polyhedron(topology(), space_dim, UNIVERSE);
-    return;
-  }
-
-  // Overapproximate lf.
-  FP_Linear_Form lf_approx;
-  overapproximate_linear_form(lf, lf_space_dim, lf_approx);
-
-  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
-      overflows(lf_approx)) {
-    *this = Polyhedron(topology(), space_dim, UNIVERSE);
-    return;
-  }
-
-  // Normalize lf.
-  Linear_Expression lf_approx_le;
-  PPL_DIRTY_TEMP_COEFFICIENT(lo_coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(hi_coeff);
-  PPL_DIRTY_TEMP_COEFFICIENT(denominator);
-  convert_to_integer_expressions(lf_approx, lf_space_dim, lf_approx_le,
-                                 lo_coeff, hi_coeff, denominator);
-
-  // Finally, do the assignment.
-  bounded_affine_image(var, lf_approx_le + lo_coeff, lf_approx_le + hi_coeff,
-                       denominator);
-}
-
-template <typename FP_Format, typename Interval_Info>
-void
-Polyhedron::overapproximate_linear_form
-(const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
- const dimension_type lf_dimension,
- Linear_Form<Interval <FP_Format, Interval_Info> >& result) {
-
-  // Check that FP_Format is indeed a floating point type.
-  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
-                         "Polyhedron::overapproximate_linear_form:"
-                         " FP_Format not a floating point type.");
-
-  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
-  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
-
-  // Build a Box from the Polyhedron so that we can extract upper and
-  // lower bounds of variables easily.
-  Box<FP_Interval_Type> box(*this);
-
-  result = FP_Linear_Form(lf.inhomogeneous_term());
-  // FIXME: this may not be policy-neutral.
-  const FP_Interval_Type aux_divisor1(static_cast<FP_Format>(0.5));
-  FP_Interval_Type aux_divisor2(aux_divisor1);
-  aux_divisor2.lower() = static_cast<FP_Format>(-0.5);
-
-  for (dimension_type i = 0; i < lf_dimension; ++i) {
-    Variable curr_var(i);
-    const FP_Interval_Type& curr_coeff = lf.coefficient(curr_var);
-    PPL_ASSERT(curr_coeff.is_bounded());
-    FP_Format curr_lb = curr_coeff.lower();
-    FP_Format curr_ub = curr_coeff.upper();
-    if (curr_lb != 0 || curr_ub != 0) {
-      const FP_Interval_Type& curr_int = box.get_interval(curr_var);
-      FP_Interval_Type curr_addend(curr_ub - curr_lb);
-      curr_addend *= aux_divisor2;
-      curr_addend *= curr_int;
-      result += curr_addend;
-      curr_addend = FP_Interval_Type(curr_lb + curr_ub);
-      curr_addend *= aux_divisor1;
-      FP_Linear_Form curr_addend_lf(curr_var);
-      curr_addend_lf *= curr_addend;
-      result += curr_addend_lf;
-    }
-  }
-}
-
-template <typename FP_Format, typename Interval_Info>
-void
-Polyhedron::convert_to_integer_expression(
-                const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
-                const dimension_type lf_dimension,
-                Linear_Expression& result) {
-  result = Linear_Expression();
-
-  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
-  std::vector<Coefficient> numerators(lf_dimension+1);
-  std::vector<Coefficient> denominators(lf_dimension+1);
-
-  // Convert each floating point number to a pair <numerator, denominator>
-  // and compute the lcm of all denominators.
-  PPL_DIRTY_TEMP_COEFFICIENT(lcm);
-  lcm = 1;
-  const FP_Interval_Type& b = lf.inhomogeneous_term();
-  // FIXME: are these checks numerator[i] != 0 really necessary?
-  numer_denom(b.lower(), numerators[lf_dimension],
-                         denominators[lf_dimension]);
-  if (numerators[lf_dimension] != 0)
-      lcm_assign(lcm, lcm, denominators[lf_dimension]);
-
-  for (dimension_type i = 0; i < lf_dimension; ++i) {
-    const FP_Interval_Type& curr_int = lf.coefficient(Variable(i));
-    numer_denom(curr_int.lower(), numerators[i], denominators[i]);
-    if (numerators[i] != 0)
-      lcm_assign(lcm, lcm, denominators[i]);
-  }
-
-  for (dimension_type i = 0; i < lf_dimension; ++i) {
-    if (numerators[i] != 0) {
-      exact_div_assign(denominators[i], lcm, denominators[i]);
-      numerators[i] *= denominators[i];
-      result += numerators[i] * Variable(i);
-    }
-  }
-
-  if (numerators[lf_dimension] != 0) {
-    exact_div_assign(denominators[lf_dimension],
-                     lcm, denominators[lf_dimension]);
-    numerators[lf_dimension] *= denominators[lf_dimension];
-    result += numerators[lf_dimension];
-  }
-}
-
-template <typename FP_Format, typename Interval_Info>
-void
-Polyhedron::convert_to_integer_expressions(
-	        const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
-                const dimension_type lf_dimension, Linear_Expression& res,
-                Coefficient& res_low_coeff, Coefficient& res_hi_coeff,
-                Coefficient& denominator) {
-  res = Linear_Expression();
-
-  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
-  std::vector<Coefficient> numerators(lf_dimension+2);
-  std::vector<Coefficient> denominators(lf_dimension+2);
-
-  // Convert each floating point number to a pair <numerator, denominator>
-  // and compute the lcm of all denominators.
-  Coefficient& lcm = denominator;
-  lcm = 1;
-  const FP_Interval_Type& b = lf.inhomogeneous_term();
-  numer_denom(b.lower(), numerators[lf_dimension], denominators[lf_dimension]);
-  // FIXME: are these checks numerator[i] != 0 really necessary?
-  if (numerators[lf_dimension] != 0)
-      lcm_assign(lcm, lcm, denominators[lf_dimension]);
-
-  numer_denom(b.upper(), numerators[lf_dimension+1],
-                         denominators[lf_dimension+1]);
-  if (numerators[lf_dimension+1] != 0)
-      lcm_assign(lcm, lcm, denominators[lf_dimension+1]);
-
-  for (dimension_type i = 0; i < lf_dimension; ++i) {
-    const FP_Interval_Type& curr_int = lf.coefficient(Variable(i));
-    numer_denom(curr_int.lower(), numerators[i], denominators[i]);
-    if (numerators[i] != 0)
-      lcm_assign(lcm, lcm, denominators[i]);
-  }
-
-  for (dimension_type i = 0; i < lf_dimension; ++i) {
-    if (numerators[i] != 0) {
-      exact_div_assign(denominators[i], lcm, denominators[i]);
-      numerators[i] *= denominators[i];
-      res += numerators[i] * Variable(i);
-    }
-  }
-
-  if (numerators[lf_dimension] != 0) {
-    exact_div_assign(denominators[lf_dimension],
-                     lcm, denominators[lf_dimension]);
-    numerators[lf_dimension] *= denominators[lf_dimension];
-    res_low_coeff = numerators[lf_dimension];
-  }
-  else
-    res_low_coeff = Coefficient(0);
-
-  if (numerators[lf_dimension+1] != 0) {
-    exact_div_assign(denominators[lf_dimension+1],
-                     lcm, denominators[lf_dimension+1]);
-    numerators[lf_dimension+1] *= denominators[lf_dimension+1];
-    res_hi_coeff = numerators[lf_dimension+1];
-  }
-  else
-    res_hi_coeff = Coefficient(0);
-}
-
-template <typename C>
-void
-Polyhedron::throw_dimension_incompatible(const char* method,
-				         const char* lf_name,
-				         const Linear_Form<C>& lf) const {
-  throw_dimension_incompatible(method, lf_name, lf.space_dimension());
-}
-
-template <typename Input>
-Input&
-Polyhedron::check_obj_space_dimension_overflow(Input& input,
-                                               const Topology topol,
-                                               const char* method,
-                                               const char* reason) {
-  check_space_dimension_overflow(input.space_dimension(),
-                                 max_space_dimension(),
-                                 topol, method, reason);
-  return input;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_templates_hh)
diff --git a/src/Polyhedron.types.hh b/src/Polyhedron.types.hh
deleted file mode 100644
index 5f7e822..0000000
--- a/src/Polyhedron.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Polyhedron_types_hh
-#define PPL_Polyhedron_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Polyhedron;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_types_hh)
diff --git a/src/Polyhedron_chdims.cc b/src/Polyhedron_chdims.cc
index 5264c31..e5afa64 100644
--- a/src/Polyhedron_chdims.cc
+++ b/src/Polyhedron_chdims.cc
@@ -1,7 +1,7 @@
 /* Polyhedron class implementation
    (non-inline operators that may change the dimension of the vector space).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,8 +23,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Polyhedron.defs.hh"
-#include "Variables_Set.defs.hh"
+#include "Polyhedron_defs.hh"
+#include "Variables_Set_defs.hh"
 #include "assert.hh"
 
 #define BE_LAZY 1
@@ -77,7 +77,7 @@ PPL::Polyhedron::add_space_dimensions_and_embed(dimension_type m) {
     if (generators_are_up_to_date()) {
       // `sat_c' must be up to date for add_space_dimensions().
       if (!sat_c_is_up_to_date())
-	update_sat_c();
+        update_sat_c();
       // Adds rows and/or columns to both matrices.
       // `add_space_dimensions' correctly handles pending constraints
       // or generators.
@@ -150,7 +150,7 @@ PPL::Polyhedron::add_space_dimensions_and_project(dimension_type m) {
     if (generators_are_up_to_date()) {
       // `sat_g' must be up to date for add_space_dimensions().
       if (!sat_g_is_up_to_date())
-	update_sat_g();
+        update_sat_g();
       // Adds rows and/or columns to both matrices.
       // `add_space_dimensions()' correctly handles pending constraints
       // or generators.
@@ -219,7 +219,7 @@ PPL::Polyhedron::concatenate_assign(const Polyhedron& y) {
   // by leaving the old system of constraints in the upper left-hand side
   // and placing the constraints of `cs' in the lower right-hand side.
   // NOTE: here topologies agree, whereas dimensions may not agree.
-  dimension_type added_rows = cs.num_rows();
+  const dimension_type added_rows = cs.num_rows();
 
   // We already dealt with the cases of an empty or zero-dim `y' polyhedron;
   // also, `cs' contains the low-level constraints, at least.
@@ -340,7 +340,7 @@ PPL::Polyhedron::remove_higher_space_dimensions(dimension_type new_dimension) {
   // Dimension-compatibility check.
   if (new_dimension > space_dim)
     throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
-				 new_dimension);
+                                 new_dimension);
 
   // The removal of no dimensions from any polyhedron is a no-op.
   // Note that this case also captures the only legal removal of
@@ -401,7 +401,7 @@ PPL::Polyhedron::expand_space_dimension(Variable var, dimension_type m) {
     return;
 
   // Keep track of the dimension before adding the new ones.
-  dimension_type old_dim = space_dim;
+  const dimension_type old_dim = space_dim;
 
   // Add the required new dimensions.
   add_space_dimensions_and_embed(m);
@@ -409,7 +409,7 @@ PPL::Polyhedron::expand_space_dimension(Variable var, dimension_type m) {
   const Constraint_System& cs = constraints();
   Constraint_System new_constraints(cs.topology());
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
+         cs_end = cs.end(); i != cs_end; ++i) {
     const Constraint& c = *i;
 
     Coefficient_traits::const_reference coeff = c.coefficient(var);
@@ -435,7 +435,7 @@ PPL::Polyhedron::expand_space_dimension(Variable var, dimension_type m) {
 
 void
 PPL::Polyhedron::fold_space_dimensions(const Variables_Set& vars,
-				       Variable dest) {
+                                       Variable dest) {
   // TODO: this implementation is _really_ an executable specification.
 
   // `dest' should be one of the dimensions of the polyhedron.
@@ -449,13 +449,13 @@ PPL::Polyhedron::fold_space_dimensions(const Variables_Set& vars,
   // All variables in `vars' should be dimensions of the polyhedron.
   if (vars.space_dimension() > space_dim)
     throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-				 "vs.space_dimension()",
-				 vars.space_dimension());
+                                 "vs.space_dimension()",
+                                 vars.space_dimension());
 
   // Moreover, `dest.id()' should not occur in `vars'.
   if (vars.find(dest.id()) != vars.end())
     throw_invalid_argument("fold_space_dimensions(vs, v)",
-			   "v should not occur in vs");
+                           "v should not occur in vs");
 
   // All of the affine images we are going to compute are not invertible,
   // hence we will need to compute the generators of the polyhedron.
diff --git a/src/Polyhedron_chdims.templates.hh b/src/Polyhedron_chdims.templates.hh
deleted file mode 100644
index 6468485..0000000
--- a/src/Polyhedron_chdims.templates.hh
+++ /dev/null
@@ -1,63 +0,0 @@
-/* Polyhedron class implementation (non-inline template operators that
-   may change the dimension of the vector space).
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_chdims_templates_hh
-#define PPL_Polyhedron_chdims_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Linear_System1, typename Linear_System2>
-void
-Polyhedron::add_space_dimensions(Linear_System1& sys1,
-                                 Linear_System2& sys2,
-                                 Bit_Matrix& sat1,
-                                 Bit_Matrix& sat2,
-                                 dimension_type add_dim) {
-
-  typedef typename Linear_System2::row_type sys2_row_type;
-
-  PPL_ASSERT(sys1.topology() == sys2.topology());
-  PPL_ASSERT(sys1.space_dimension() == sys2.space_dimension());
-  PPL_ASSERT(add_dim != 0);
-
-  sys1.set_space_dimension(sys1.space_dimension() + add_dim);
-  sys2.add_universe_rows_and_space_dimensions(add_dim);
-
-  // The resulting saturation matrix will be as follows:
-  // from row    0    to      add_dim-1       : only zeroes
-  //          add_dim     add_dim+num_rows-1  : old saturation matrix
-
-  // In fact all the old generators saturate all the new constraints
-  // because the polyhedron has not been embedded in the new space.
-  sat1.resize(sat1.num_rows() + add_dim, sat1.num_columns());
-  // The old matrix is moved to the end of the new matrix.
-  for (dimension_type i = sat1.num_rows() - add_dim; i-- > 0; )
-    swap(sat1[i], sat1[i+add_dim]);
-  // Computes the "sat_c", too.
-  sat2.transpose_assign(sat1);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_chdims_templates_hh)
diff --git a/src/Polyhedron_chdims_templates.hh b/src/Polyhedron_chdims_templates.hh
new file mode 100644
index 0000000..77692c3
--- /dev/null
+++ b/src/Polyhedron_chdims_templates.hh
@@ -0,0 +1,63 @@
+/* Polyhedron class implementation (non-inline template operators that
+   may change the dimension of the vector space).
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_chdims_templates_hh
+#define PPL_Polyhedron_chdims_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Linear_System1, typename Linear_System2>
+void
+Polyhedron::add_space_dimensions(Linear_System1& sys1,
+                                 Linear_System2& sys2,
+                                 Bit_Matrix& sat1,
+                                 Bit_Matrix& sat2,
+                                 dimension_type add_dim) {
+
+  typedef typename Linear_System2::row_type sys2_row_type;
+
+  PPL_ASSERT(sys1.topology() == sys2.topology());
+  PPL_ASSERT(sys1.space_dimension() == sys2.space_dimension());
+  PPL_ASSERT(add_dim != 0);
+
+  sys1.set_space_dimension(sys1.space_dimension() + add_dim);
+  sys2.add_universe_rows_and_space_dimensions(add_dim);
+
+  // The resulting saturation matrix will be as follows:
+  // from row    0    to      add_dim-1       : only zeroes
+  //          add_dim     add_dim+num_rows-1  : old saturation matrix
+
+  // In fact all the old generators saturate all the new constraints
+  // because the polyhedron has not been embedded in the new space.
+  sat1.resize(sat1.num_rows() + add_dim, sat1.num_columns());
+  // The old matrix is moved to the end of the new matrix.
+  for (dimension_type i = sat1.num_rows() - add_dim; i-- > 0; )
+    swap(sat1[i], sat1[i+add_dim]);
+  // Computes the "sat_c", too.
+  sat2.transpose_assign(sat1);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_chdims_templates_hh)
diff --git a/src/Polyhedron_conversion.templates.hh b/src/Polyhedron_conversion.templates.hh
deleted file mode 100644
index 0f2451d..0000000
--- a/src/Polyhedron_conversion.templates.hh
+++ /dev/null
@@ -1,919 +0,0 @@
-/* Polyhedron class implementation: conversion().
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_conversion_templates_hh
-#define PPL_Polyhedron_conversion_templates_hh 1
-
-#include "Bit_Row.defs.hh"
-#include "Bit_Matrix.defs.hh"
-#include "Polyhedron.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "Temp.defs.hh"
-#include "math_utilities.defs.hh"
-
-#include <cstddef>
-#include <climits>
-
-namespace Parma_Polyhedra_Library {
-
-/*!
-  \return
-  The number of lines of the polyhedron or the number of equality
-  constraints in the result of conversion.
-
-  \param source
-  The system to use to convert \p dest: it may be modified;
-
-  \param start
-  The index of \p source row from which conversion begin;
-
-  \param dest
-  The result of the conversion;
-
-  \param sat
-  The saturation matrix telling us, for each row in \p source, which
-  are the rows of \p dest that satisfy but do not saturate it;
-
-  \param num_lines_or_equalities
-  The number of rows in the system \p dest that are either lines of
-  the polyhedron (when \p dest is a system of generators) or equality
-  constraints (when \p dest is a system of constraints).
-
-  For simplicity, all the following comments assume we are converting a
-  constraint system \p source to a generator system \p dest;
-  the comments for the symmetric case can be obtained by duality.
-
-  If some of the constraints in \p source are redundant, they will be removed.
-  This is why the \p source is not declared to be a constant parameter.
-
-  If \p start is 0, then \p source is a sorted system; also, \p dest is
-  a generator system corresponding to an empty constraint system.
-  If otherwise \p start is greater than 0, then the two sub-systems of
-  \p source made by the non-pending rows and the pending rows, respectively,
-  are both sorted; also, \p dest is the generator system corresponding to
-  the non-pending constraints of \p source.
-
-  Independently from the value of \p start, \p dest has lines from index 0
-  to index \p num_lines_or_equalities - 1 and rays/points from index
-  \p num_lines_or_equalities to the last of its rows.
-
-  Note that here the rows of \p sat are indexed by rows of \p dest
-  and its columns are indexed by rows of \p source.
-
-  We know that polyhedra can be represented by both a system of
-  constraints or a system of generators (points, rays and lines)
-  (see Section \ref representation).
-  When we have both descriptions for a polyhedron \f$P\f$
-  we have what is called a <EM>double description</EM>
-  (or <EM>DD pair</EM>) for \f$P\f$.
-
-  Here, the <EM>representation system</EM> refers to the system \f$C\f$
-  whose rows represent the constraints that characterize \f$P\f$
-  and the <EM>generating system</EM>, the system \f$G\f$ whose rows
-  represent the generators of \f$P\f$.
-  We say that a pair \f$(C, G)\f$ of (real) systems is
-  a <EM>double description pair</EM> if
-  \f[
-    C\vect{x} \geq \vect{0}
-      \quad\iff\quad
-        \exists \vect{\lambda} \geq \vect{0} \mathrel{.}
-	\vect{x} = G\vect{\lambda}.
-  \f]
-
-  The term "double description" is quite natural in the sense that
-  such a pair contains two different description of the same object.
-  In fact, if we refer to the cone representation of a polyhedron \f$P\f$
-  and we call \f$C\f$ and \f$G\f$ the systems of constraints and
-  rays respectively, we have
-  \f[
-    P = \{\, \vect{x} \in \Rset^n \mid C\vect{x} \geq \vect{0}\, \}
-      = \{\, \vect{x} \in \Rset^n \mid \vect{x} = G\vect{\lambda}
-      \text{ for some } \vect{\lambda} \geq \vect{0}\, \}.
-  \f]
-
-  Because of the theorem of Minkowski (see Section \ref prelims),
-  we can say that, given a \f$m \times n\f$ representation system
-  \f$C\f$ such that
-  \f$\mathop{\mathrm{rank}}(C) = n = \mathit{dimension of the whole space}\f$
-  for a non-empty polyhedron \f$P\f$,
-  it is always possible to find a generating system \f$G\f$ for \f$P\f$
-  such that \f$(C, G)\f$ is a DD pair.
-  Conversely, Weyl's theorem ensures that, for each generating system
-  \f$G\f$, it is possible to find a representation system \f$C\f$
-  such that \f$(C, G)\f$ is a DD pair.
-
-  For efficiency reasons, our representation of polyhedra makes use
-  of a double description.
-  We are thus left with two problems:
-    -# given \f$C\f$ find \f$G\f$ such that \f$(C, G)\f$ is a DD pair;
-    -# given \f$G\f$ find \f$C\f$ such that \f$(C, G)\f$ is a DD pair.
-
-  Using Farkas' Lemma we can prove that these two problems are
-  computationally equivalent (i.e., linear-time reducible to each other).
-  Farkas' Lemma establishes a fundamental property of vectors in
-  \f$\Rset^n\f$ that, in a sense, captures the essence of duality.
-  Consider a matrix \f$A \in \Rset^{m \times n}\f$ and let
-  \f$\{ \vect{a}_1, \ldots, \vect{a}_m \}\f$ be its set of row vectors.
-  Consider also another vector \f$\vect{c} \in \Rset^n\f$ such that,
-  whenever a vector \f$\vect{y} \in \Rset^n\f$ has a non-negative projection
-  on the \f$\vect{a}_i\f$'s, it also has a non-negative projection
-  on \f$\vect{c}\f$.
-  The lemma states that \f$\vect{c}\f$ has this property if and only if
-  it is in the cone generated by the \f$\vect{a}_i\f$'s.
-  Formally, the lemma states the equivalence of the two following
-  assertions:
-    -# \f$
-         \forall \vect{y}
-           \mathrel{:} (A\vect{y} \geq 0 \implies
-	   \langle \vect{y},\vect{c} \rangle \geq 0)
-       \f$;
-    -# \f$
-         \exists \vect{\lambda} \geq \vect{0}
-           \mathrel{.} \vect{c}^\mathrm{T} = \vect{\lambda}^\mathrm{T}A
-       \f$.
-
-  With this result we can prove that \f$(C, G)\f$ is a DD pair
-  if and only if \f$(G^\mathrm{T}, C^\mathrm{T})\f$ is a DD pair.
-
-  Suppose \f$(C, G)\f$ is a DD pair.
-  Thus, for each \f$x\f$ of the appropriate dimension,
-  \f$C\vect{x} \geq \vect{0}\f$ if and only if
-  \f$\exists \lambda \geq 0 \mathrel{.} \vect{x} = G\vect{\lambda}\f$,
-  which is of course equivalent to
-  \f$
-    \exists \vect{\lambda} \geq \vect{0}
-      \mathrel{.} \vect{x}^\mathrm{T} = \vect{\lambda}^\mathrm{T}G^\mathrm{T}
-  \f$.
-
-  First, we assume that \f$\vect{z}\f$ is such that
-  \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$
-  and we will show that
-  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
-  \vect{z} = C^\mathrm{T}\vect{\mu}\f$.
-  Let \f$\vect{x}\f$ be such that \f$C\vect{x} \geq \vect{0}\f$.
-  Since \f$(C, G)\f$ is a DD pair, this is equivalent to
-  \f$
-    \exists \vect{\lambda} \geq \vect{0}
-      \mathrel{.} \vect{x}^\mathrm{T} = \vect{\lambda}^\mathrm{T}G^\mathrm{T}
-  \f$,
-  which, by Farkas' Lemma is equivalent to
-  \f$
-    \forall \vect{y} \mathrel{:} (G^\mathrm{T}\vect{y} \geq \vect{0} \implies
-                                 \langle \vect{y}, \vect{x} \rangle \geq 0)
-  \f$.
-  Taking \f$\vect{y} = \vect{z}\f$ and recalling our assumption that
-  \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$
-  we can conclude that \f$\langle \vect{z}, \vect{x} \rangle \geq 0\f$,
-  that is equivalent to \f$\langle \vect{x}, \vect{z} \rangle \geq 0\f$.
-  We have thus established that
-  \f$
-    \forall \vect{x} \mathrel{:} (C\vect{x} \geq \vect{0} \implies
-    \langle \vect{x}, \vect{z} \rangle \geq 0)
-  \f$.
-  By Farkas' Lemma, this is equivalent to
-  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
-  \vect{z}^\mathrm{T} = \vect{\mu}^\mathrm{T} C\f$,
-  which is equivalent to what we wanted to prove, that is,
-  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
-  \vect{z} = C^\mathrm{T}\vect{\mu}\f$.
-
-  In order to prove the reverse implication, the following observation
-  turns out to be useful:
-  when \f$(C, G)\f$ is a DD pair, \f$CG \geq 0\f$.
-  In fact,
-  let \f$\vect{e}_j\f$ be the vector whose components are all \f$0\f$
-  apart from the \f$j\f$-th one, which is \f$1\f$.
-  Clearly \f$\vect{e}_j \geq \vect{0}\f$ and, taking
-  \f$\vect{\lambda} = \vect{e}_j\f$ and
-  \f$\vect{x} = G\vect{\lambda} = G \vect{e}_j\f$, we have
-  \f$C\vect{x} = C(G \vect{e}_j) = (CG)\vect{e}_j \geq \vect{0}\f$,
-  since \f$(C, G)\f$ is a DD pair.
-  Thus, as \f$(CG)\vect{e}_j\f$ is the \f$j\f$-th column of \f$CG\f$
-  and since the choice of \f$j\f$ was arbitrary, \f$CG \geq \vect{0}\f$.
-
-  We now assume that \f$\vect{z}\f$ is such that
-  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
-  \vect{z} = C^\mathrm{T}\vect{\mu}\f$
-  and we will prove that \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$.
-  By Farkas' Lemma, the assumption
-  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
-  \vect{z}^\mathrm{T} = \vect{\mu}^\mathrm{T}C\f$,
-  is equivalent to
-  \f$\forall \vect{y} \mathrel{:} (C\vect{y} \geq \vect{0}
-  \implies \langle \vect{y}, \vect{z} \rangle \geq 0)\f$.
-  If we take \f$\vect{y} = G\vect{e}_j\f$ then \f$C\vect{y}
-                 = CG\vect{e}_j \geq 0\f$,
-  since \f$CG \geq \vect{0}\f$.
-  So
-  \f$
-    \langle \vect{y}, \vect{z} \rangle
-      = (\vect{e}_j^\mathrm{T}G^\mathrm{T}) \vect{z}
-      = \vect{e}_j^\mathrm{T}(G^\mathrm{T} \vect{z})
-      \geq 0
-  \f$,
-  that is, the \f$j\f$-th component of \f$G^\mathrm{T}\vect{z}\f$
-  is non-negative. The arbitrary choice of \f$j\f$ allows us to conclude
-  that \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$, as required.
-
-  In view of this result, the following exposition assumes, for clarity,
-  that the conversion being performed is from constraints to generators.
-  Thus, even if the roles of \p source and \p dest can be interchanged,
-  in the sequel we assume the \p source system will contain the constraints
-  that represent the polyhedron and the \p dest system will contain
-  the generator that generates it.
-
-  There are some observations that are useful to understand this function:
-
-  Observation 1: Let \f$A\f$ be a system of constraints that generate
-  the polyhedron \f$P\f$ and \f$\vect{c}\f$ a new constraint that must
-  be added. Suppose that there is a line \f$\vect{z}\f$ that does not
-  saturate the constraint \f$\vect{c}\f$. If we combine the old lines
-  and rays that do not saturate \f$\vect{c}\f$ (except \f$\vect{z}\f$)
-  with \f$\vect{z}\f$ such that the new ones saturate \f$\vect{c}\f$,
-  the new lines and rays also saturate the constraints  saturated by
-  the old lines and rays.
-
-  In fact, if \f$\vect{y}_1\f$ is the old generator that does not saturate
-  \f$\vect{c}\f$, \f$\vect{y}_2\f$ is the new one such that
-  \f[
-    \vect{y}_2 = \lambda \vect{y}_1 + \mu \vect{z}
-  \f]
-  and \f$\vect{c}_1\f$ is a previous constraint that \f$\vect{y}_1\f$
-  and \f$\vect{z}\f$ saturates, we can see
-  \f[
-    \langle \vect{c}_1, \vect{y}_2 \rangle
-    = \langle \vect{c}_1, (\lambda \vect{y}_1 + \mu \vect{z}) \rangle
-    = \lambda \langle \vect{c}_1, \vect{y}_1 \rangle
-       + \mu \langle \vect{c}_1, \vect{z} \rangle
-       = 0 + \mu \langle \vect{c}_1, \vect{z} \rangle
-       = \mu \langle \vect{c}_1, \vect{z} \rangle
-  \f]
-  and
-  \f[
-    \mu \langle \vect{c}_1, \vect{z} \rangle = 0.
-  \f]
-
-  Proposition 1: Let \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ be distinct
-  rays of \f$P\f$.
-  Then the following statements are equivalent:
-  a) \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are adjacent extreme rays
-     (see Section \ref prelims);
-  b) \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are extreme rays and the
-     rank of the system composed by the constraints saturated by both
-     \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ is equal to
-     \f$d - 2\f$, where \f$d\f$ is the rank of the system of constraints.
-
-  In fact, let \f$F\f$ be the system of generators that saturate the
-  constraints saturated by both \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$.
-  If b) holds, the set \f$F\f$ is 2-dimensional and \f$\vect{r}_1\f$ and
-  \f$\vect{r}_2\f$ generate this set. So, every generator
-  \f$\vect{x}\f$ of \f$F\f$ can be built as a combination of
-  \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$, i.e.
-  \f[
-    \vect{x} = \lambda \vect{r}_1 + \mu \vect{r}_2.
-  \f]
-  This combination is non-negative because there exists at least a
-  constraint \f$c\f$ saturated by \f$\vect{r}_1\f$ and not
-  \f$\vect{r}_2\f$ (or vice versa) (because they are distinct) for which
-  \f[
-    \langle \vect{c}, \vect{x} \rangle \geq 0
-  \f]
-  and
-  \f[
-    \langle \vect{c}, \vect{x} \rangle
-    = \lambda \langle \vect{c}, \vect{r}_1 \rangle
-                           (or = \mu \langle \vect{c}, \vect{r}_2 \rangle).
-  \f]
-  So, there is no other extreme ray in \f$F\f$ and a) holds.
-  Otherwise, if b) does not hold, the rank of the system generated by
-  the constraints saturated by both \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$
-  is equal to \f$d - k\f$, with \p k \>= 3, the set \f$F\f$ is
-  \p k -dimensional and at least \p k extreme rays are necessary
-  to generate \f$F\f$.
-  So, \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are not adjacent and
-  a) does not hold.
-
-  Proposition 2: When we build the new system of generators starting from
-  a system \f$A\f$ of constraints of \f$P\f$, if \f$\vect{c}\f$ is the
-  constraint to add to \f$A\f$ and all lines of \f$P\f$ saturate
-  \f$\vect{c}\f$, the new set of rays is the union of those rays that
-  saturate, of those that satisfy and of a set \f$\overline Q\f$ of
-  rays such that each of them
-  -# lies on the hyper-plane represented by the k-th constraint,
-  -# is a positive combination of two adjacent rays \f$\vect{r}_1\f$ and
-     \f$\vect{r}_2\f$ such that the first one satisfies the constraint and
-     the other does not satisfy it.
-  If the adjacency property is not taken in account, the new set of
-  rays is not irredundant, in general.
-
-  In fact, if \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are not adjacent,
-  the rank of the system composed by the constraints saturated by both
-  \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ is different from \f$d - 2\f$
-  (see the previous proposition) or neither \f$\vect{r}_1\f$ nor
-  \f$\vect{r}_2\f$ are extreme rays. Since the new ray \f$\vect{r}\f$
-  is a combination of \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$,
-  it saturates the same constraints saturated by both \f$\vect{r}_1\f$ and
-  \f$\vect{r}_2\f$.
-  If the rank is less than \f$d - 2\f$, the rank of
-  the system composed by \f$\vect{c}\f$ (that is saturated by \f$\vect{r}\f$)
-  and by the constraints of \f$A\f$ saturated by \f$\vect{r}\f$  is less
-  than \f$d - 1\f$. It means that \f$r\f$ is redundant (see
-  Section \ref prelims).
-  If neither \f$\vect{r}_1\f$ nor \f$\vect{r}_2\f$ are extreme rays,
-  they belong to a 2-dimensional face containing exactly two extreme rays
-  of \f$P\f$.
-  These two adjacent rays build a ray equal to \f$\vect{r}\f$ and so
-  \f$\vect{r}\f$ is redundant.
-*/
-template <typename Source_Linear_System, typename Dest_Linear_System>
-dimension_type
-Polyhedron::conversion(Source_Linear_System& source,
-                       const dimension_type start,
-                       Dest_Linear_System& dest,
-                       Bit_Matrix& sat,
-                       dimension_type num_lines_or_equalities) {
-  typedef typename Dest_Linear_System::row_type dest_row_type;
-  typedef typename Source_Linear_System::row_type source_row_type;
-
-  // Constraints and generators must have the same dimension,
-  // otherwise the scalar products below will bomb.
-  PPL_ASSERT(source.space_dimension() == dest.space_dimension());
-  const dimension_type source_space_dim = source.space_dimension();
-  const dimension_type source_num_rows = source.num_rows();
-  const dimension_type source_num_columns = source_space_dim
-    + (source.is_necessarily_closed() ? 1 : 2);
-
-
-  dimension_type dest_num_rows = dest.num_rows();
-  // The rows removed from `dest' will be placed in this vector, so they
-  // can be recycled if needed.
-  std::vector<dest_row_type> recyclable_dest_rows;
-
-  using std::swap;
-
-  // By construction, the number of columns of `sat' is the same as
-  // the number of rows of `source'; also, the number of rows of `sat'
-  // is the same as the number of rows of `dest'.
-  PPL_ASSERT(source_num_rows == sat.num_columns());
-  PPL_ASSERT(dest_num_rows == sat.num_rows());
-
-  // If `start > 0', then we are converting the pending constraints.
-  PPL_ASSERT(start == 0 || start == source.first_pending_row());
-
-  PPL_DIRTY_TEMP_COEFFICIENT(normalized_sp_i);
-  PPL_DIRTY_TEMP_COEFFICIENT(normalized_sp_o);
-
-  bool dest_sorted = dest.is_sorted();
-  const dimension_type dest_first_pending_row = dest.first_pending_row();
-
-  // This will contain the row indexes of the redundant rows of `source'.
-  std::vector<dimension_type> redundant_source_rows;
-
-  // Converting the sub-system of `source' having rows with indexes
-  // from `start' to the last one (i.e., `source_num_rows' - 1).
-  for (dimension_type k = start; k < source_num_rows; ++k) {
-    const source_row_type& source_k = source[k];
-
-    // `scalar_prod[i]' will contain the scalar product of the
-    // constraint `source_k' and the generator `dest_rows[i]'.  This
-    // product is 0 if and only if the generator saturates the
-    // constraint.
-    PPL_DIRTY_TEMP(std::vector<Coefficient>, scalar_prod);
-    if (dest_num_rows > scalar_prod.size()) {
-      scalar_prod.insert(scalar_prod.end(),
-                         dest_num_rows - scalar_prod.size(),
-                         Coefficient_zero());
-    }
-    // `index_non_zero' will indicate the first generator in `dest_rows'
-    // that does not saturate the constraint `source_k'.
-    dimension_type index_non_zero = 0;
-    for ( ; index_non_zero < dest_num_rows; ++index_non_zero) {
-      WEIGHT_BEGIN();
-      Scalar_Products::assign(scalar_prod[index_non_zero],
-			      source_k,
-			      dest.sys.rows[index_non_zero]);
-      WEIGHT_ADD_MUL(17, source_space_dim);
-      if (scalar_prod[index_non_zero] != 0)
-	// The generator does not saturate the constraint.
-	break;
-      // Check if the client has requested abandoning all expensive
-      // computations.  If so, the exception specified by the client
-      // is thrown now.
-      maybe_abandon();
-    }
-    for (dimension_type i = index_non_zero + 1; i < dest_num_rows; ++i) {
-      WEIGHT_BEGIN();
-      Scalar_Products::assign(scalar_prod[i], source_k, dest.sys.rows[i]);
-      WEIGHT_ADD_MUL(25, source_space_dim);
-      // Check if the client has requested abandoning all expensive
-      // computations.  If so, the exception specified by the client
-      // is thrown now.
-      maybe_abandon();
-    }
-
-    // We first treat the case when `index_non_zero' is less than
-    // `num_lines_or_equalities', i.e., when the generator that
-    // does not saturate the constraint `source_k' is a line.
-    // The other case (described later) is when all the lines
-    // in `dest_rows' (i.e., all the rows having indexes less than
-    // `num_lines_or_equalities') do saturate the constraint.
-
-    if (index_non_zero < num_lines_or_equalities) {
-      // Since the generator `dest_rows[index_non_zero]' does not saturate
-      // the constraint `source_k', it can no longer be a line
-      // (see saturation rule in Section \ref prelims).
-      // Therefore, we first transform it to a ray.
-      dest.sys.rows[index_non_zero].set_is_ray_or_point_or_inequality();
-      // Of the two possible choices, we select the ray satisfying
-      // the constraint (namely, the ray whose scalar product
-      // with the constraint gives a positive result).
-      if (scalar_prod[index_non_zero] < 0) {
-	// The ray `dest_rows[index_non_zero]' lies on the wrong half-space:
-	// we change it to have the opposite direction.
-	neg_assign(scalar_prod[index_non_zero]);
-        neg_assign(dest.sys.rows[index_non_zero].expr);
-        // The modified row may still not be OK(), so don't assert OK here.
-        // They are all checked at the end of this function.
-      }
-      // Having changed a line to a ray, we set `dest_rows' to be a
-      // non-sorted system, we decrement the number of lines of `dest_rows'
-      // and, if necessary, we move the new ray below all the remaining lines.
-      dest_sorted = false;
-      --num_lines_or_equalities;
-      if (index_non_zero != num_lines_or_equalities) {
-        swap(dest.sys.rows[index_non_zero],
-             dest.sys.rows[num_lines_or_equalities]);
-	swap(scalar_prod[index_non_zero],
-             scalar_prod[num_lines_or_equalities]);
-      }
-      const dest_row_type& dest_nle = dest.sys.rows[num_lines_or_equalities];
-
-      // Computing the new lineality space.
-      // Since each line must lie on the hyper-plane corresponding to
-      // the constraint `source_k', the scalar product between
-      // the line and the constraint must be 0.
-      // This property already holds for the lines having indexes
-      // between 0 and `index_non_zero' - 1.
-      // We have to consider the remaining lines, having indexes
-      // between `index_non_zero' and `num_lines_or_equalities' - 1.
-      // Each line that does not saturate the constraint has to be
-      // linearly combined with generator `dest_nle' so that the
-      // resulting new line saturates the constraint.
-      // Note that, by Observation 1 above, the resulting new line
-      // will still saturate all the constraints that were saturated by
-      // the old line.
-
-      Coefficient& scalar_prod_nle = scalar_prod[num_lines_or_equalities];
-      PPL_ASSERT(scalar_prod_nle != 0);
-      for (dimension_type
-	     i = index_non_zero; i < num_lines_or_equalities; ++i) {
-	if (scalar_prod[i] != 0) {
-	  // The following fragment optimizes the computation of
-	  //
-          // <CODE>
-	  //   Coefficient scale = scalar_prod[i];
-	  //   scale.gcd_assign(scalar_prod_nle);
-	  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
-	  //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
-	  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
-	  //     dest[i][c] *= normalized_sp_n;
-	  //     dest[i][c] -= normalized_sp_i * dest_nle[c];
-	  //   }
-          // </CODE>
-	  normalize2(scalar_prod[i],
-		     scalar_prod_nle,
-		     normalized_sp_i,
-		     normalized_sp_o);
-          dest_row_type& dest_i = dest.sys.rows[i];
-          neg_assign(normalized_sp_i);
-          dest_i.expr.linear_combine(dest_nle.expr,
-                                     normalized_sp_o, normalized_sp_i);
-	  dest_i.strong_normalize();
-          // The modified row may still not be OK(), so don't assert OK here.
-          // They are all checked at the end of this function.
-	  scalar_prod[i] = 0;
-	  // dest_sorted has already been set to false.
-	}
-      }
-
-      // Computing the new pointed cone.
-      // Similarly to what we have done during the computation of
-      // the lineality space, we consider all the remaining rays
-      // (having indexes strictly greater than `num_lines_or_equalities')
-      // that do not saturate the constraint `source_k'. These rays
-      // are positively combined with the ray `dest_nle' so that the
-      // resulting new rays saturate the constraint.
-      for (dimension_type
-	     i = num_lines_or_equalities + 1; i < dest_num_rows; ++i) {
-	if (scalar_prod[i] != 0) {
-	  // The following fragment optimizes the computation of
-	  //
-          // <CODE>
-	  //   Coefficient scale = scalar_prod[i];
-	  //   scale.gcd_assign(scalar_prod_nle);
-	  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
-	  //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
-	  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
-	  //     dest[i][c] *= normalized_sp_n;
-	  //     dest[i][c] -= normalized_sp_i * dest_nle[c];
-	  //   }
-          // </CODE>
-	  normalize2(scalar_prod[i],
-		     scalar_prod_nle,
-		     normalized_sp_i,
-		     normalized_sp_o);
-          dest_row_type& dest_i = dest.sys.rows[i];
-          WEIGHT_BEGIN();
-          neg_assign(normalized_sp_i);
-          dest_i.expr.linear_combine(dest_nle.expr,
-                                     normalized_sp_o, normalized_sp_i);
-	  dest_i.strong_normalize();
-          // The modified row may still not be OK(), so don't assert OK here.
-          // They are all checked at the end of this function.
-	  scalar_prod[i] = 0;
-	  // `dest_sorted' has already been set to false.
-          WEIGHT_ADD_MUL(41, source_space_dim);
-	}
-        // Check if the client has requested abandoning all expensive
-        // computations.  If so, the exception specified by the client
-        // is thrown now.
-	maybe_abandon();
-      }
-      // Since the `scalar_prod_nle' is positive (by construction), it
-      // does not saturate the constraint `source_k'.  Therefore, if
-      // the constraint is an inequality, we set to 1 the
-      // corresponding element of `sat' ...
-      Bit_Row& sat_nle = sat[num_lines_or_equalities];
-      if (source_k.is_ray_or_point_or_inequality())
-	sat_nle.set(k - redundant_source_rows.size());
-      // ... otherwise, the constraint is an equality which is
-      // violated by the generator `dest_nle': the generator has to be
-      // removed from `dest_rows'.
-      else {
-	--dest_num_rows;
-        swap(dest.sys.rows[num_lines_or_equalities],
-             dest.sys.rows[dest_num_rows]);
-        recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
-        swap(dest.sys.rows.back(), recyclable_dest_rows.back());
-        dest.sys.rows.pop_back();
-        PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
-
-	swap(scalar_prod_nle, scalar_prod[dest_num_rows]);
-	swap(sat_nle, sat[dest_num_rows]);
-	// dest_sorted has already been set to false.
-      }
-    }
-    // Here we have `index_non_zero' >= `num_lines_or_equalities',
-    // so that all the lines in `dest_rows' saturate the constraint `source_k'.
-    else {
-      // First, we reorder the generators in `dest_rows' as follows:
-      // -# all the lines should have indexes between 0 and
-      //    `num_lines_or_equalities' - 1 (this already holds);
-      // -# all the rays that saturate the constraint should have
-      //    indexes between `num_lines_or_equalities' and
-      //    `lines_or_equal_bound' - 1; these rays form the set Q=.
-      // -# all the rays that have a positive scalar product with the
-      //    constraint should have indexes between `lines_or_equal_bound'
-      //    and `sup_bound' - 1; these rays form the set Q+.
-      // -# all the rays that have a negative scalar product with the
-      //    constraint should have indexes between `sup_bound' and
-      //    `dest_num_rows' - 1; these rays form the set Q-.
-      dimension_type lines_or_equal_bound = num_lines_or_equalities;
-      dimension_type inf_bound = dest_num_rows;
-      // While we find saturating generators, we simply increment
-      // `lines_or_equal_bound'.
-      while (inf_bound > lines_or_equal_bound
-	     && scalar_prod[lines_or_equal_bound] == 0)
-	++lines_or_equal_bound;
-      dimension_type sup_bound = lines_or_equal_bound;
-      while (inf_bound > sup_bound) {
-	const int sp_sign = sgn(scalar_prod[sup_bound]);
-	if (sp_sign == 0) {
-	  // This generator has to be moved in Q=.
-	  swap(dest.sys.rows[sup_bound], dest.sys.rows[lines_or_equal_bound]);
-	  swap(scalar_prod[sup_bound], scalar_prod[lines_or_equal_bound]);
-	  swap(sat[sup_bound], sat[lines_or_equal_bound]);
-	  ++lines_or_equal_bound;
-	  ++sup_bound;
-          dest_sorted = false;
-	}
-	else if (sp_sign < 0) {
-	  // This generator has to be moved in Q-.
-	  --inf_bound;
-          swap(dest.sys.rows[sup_bound], dest.sys.rows[inf_bound]);
-	  swap(sat[sup_bound], sat[inf_bound]);
-	  swap(scalar_prod[sup_bound], scalar_prod[inf_bound]);
-          dest_sorted = false;
-	}
-	else
-	  // sp_sign > 0: this generator has to be moved in Q+.
-	  ++sup_bound;
-      }
-
-      if (sup_bound == dest_num_rows) {
-	// Here the set Q- is empty.
-	// If the constraint is an inequality, then all the generators
-	// in Q= and Q+ satisfy the constraint. The constraint is redundant
-	// and it can be safely removed from the constraint system.
-	// This is why the `source' parameter is not declared `const'.
-	if (source_k.is_ray_or_point_or_inequality()) {
-          redundant_source_rows.push_back(k);
-	} else {
-	  // The constraint is an equality, so that all the generators
-	  // in Q+ violate it. Since the set Q- is empty, we can simply
-	  // remove from `dest_rows' all the generators of Q+.
-	  PPL_ASSERT(dest_num_rows >= lines_or_equal_bound);
-          while (dest_num_rows != lines_or_equal_bound) {
-            recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
-            swap(dest.sys.rows.back(), recyclable_dest_rows.back());
-            dest.sys.rows.pop_back();
-            --dest_num_rows;
-          }
-          PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
-        }
-      }
-      else {
-	// The set Q- is not empty, i.e., at least one generator
-	// violates the constraint `source_k'.
-	// We have to further distinguish two cases:
-	if (sup_bound == num_lines_or_equalities) {
-	  // The set Q+ is empty, so that all generators that satisfy
-	  // the constraint also saturate it.
-	  // We can simply remove from `dest_rows' all the generators in Q-.
-          PPL_ASSERT(dest_num_rows >= sup_bound);
-          while (dest_num_rows != sup_bound) {
-            recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
-            swap(dest.sys.rows.back(), recyclable_dest_rows.back());
-            dest.sys.rows.pop_back();
-            --dest_num_rows;
-          }
-          PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
-        } else {
-	  // The sets Q+ and Q- are both non-empty.
-	  // The generators of the new pointed cone are all those satisfying
-	  // the constraint `source_k' plus a set of new rays enjoying
-	  // the following properties:
-	  // -# they lie on the hyper-plane represented by the constraint
-	  // -# they are obtained as a positive combination of two
-	  //    adjacent rays, the first taken from Q+ and the second
-	  //    taken from Q-.
-
-	  // The adjacency property is necessary to have an irredundant
-	  // set of new rays (see proposition 2).
-	  const dimension_type bound = dest_num_rows;
-
-	  // In the following loop,
-	  // `i' runs through the generators in the set Q+ and
-	  // `j' runs through the generators in the set Q-.
-	  for (dimension_type i = lines_or_equal_bound; i < sup_bound; ++i) {
-	    for(dimension_type j = sup_bound; j < bound; ++j) {
-	      // Checking if generators `dest_rows[i]' and `dest_rows[j]' are
-              // adjacent.
-	      // If there exist another generator that saturates
-	      // all the constraints saturated by both `dest_rows[i]' and
-	      // `dest_rows[j]', then they are NOT adjacent.
-	      PPL_ASSERT(sat[i].last() == C_Integer<unsigned long>::max
-                         || sat[i].last() < k);
-	      PPL_ASSERT(sat[j].last() == C_Integer<unsigned long>::max
-                         || sat[j].last() < k);
-
-	      // Being the union of `sat[i]' and `sat[j]',
-	      // `new_satrow' corresponds to a ray that saturates all the
-	      // constraints saturated by both `dest_rows[i]' and
-              // `dest_rows[j]'.
-	      Bit_Row new_satrow(sat[i], sat[j]);
-
-	      // Compute the number of common saturators.
-	      // NOTE: this number has to be less than `k' because
-	      // we are treating the `k'-th constraint.
-	      const dimension_type num_common_satur
-                = k - redundant_source_rows.size() - new_satrow.count_ones();
-
-	      // Even before actually creating the new ray as a
-	      // positive combination of `dest_rows[i]' and `dest_rows[j]',
-	      // we exploit saturation information to check if
-	      // it can be an extremal ray. To this end, we refer
-	      // to the definition of a minimal proper face
-	      // (see comments in Polyhedron.defs.hh):
-	      // an extremal ray saturates at least `n' - `t' - 1
-	      // constraints, where `n' is the dimension of the space
-	      // and `t' is the dimension of the lineality space.
-	      // Since `n == source_num_columns - 1' and
-	      // `t == num_lines_or_equalities', we obtain that
-	      // an extremal ray saturates at least
-	      // `source_num_columns - num_lines_or_equalities - 2'
-	      // constraints.
-	      if (num_common_satur
-		  >= source_num_columns - num_lines_or_equalities - 2) {
-		// The minimal proper face rule is satisfied.
-		// Now we actually check for redundancy by computing
-		// adjacency information.
-		bool redundant = false;
-		WEIGHT_BEGIN();
-		for (dimension_type
-		       l = num_lines_or_equalities; l < bound; ++l)
-		  if (l != i && l != j
-		      && subset_or_equal(sat[l], new_satrow)) {
-		    // Found another generator saturating all the
-		    // constraints saturated by both `dest_rows[i]' and
-                    // `dest_rows[j]'.
-		    redundant = true;
-		    break;
-		  }
-                PPL_ASSERT(bound >= num_lines_or_equalities);
-                WEIGHT_ADD_MUL(15, bound - num_lines_or_equalities);
-		if (!redundant) {
-		  // Adding the new ray to `dest_rows' and the corresponding
-		  // saturation row to `sat'.
-		  dest_row_type new_row;
-		  if (recyclable_dest_rows.empty()) {
-		    sat.add_recycled_row(new_satrow);
-		  }
-		  else {
-                    swap(new_row, recyclable_dest_rows.back());
-                    recyclable_dest_rows.pop_back();
-                    new_row.set_space_dimension_no_ok(source_space_dim);
-                    swap(sat[dest_num_rows], new_satrow);
-                  }
-
-		  // The following fragment optimizes the computation of
-		  //
-                  // <CODE>
-		  //   Coefficient scale = scalar_prod[i];
-		  //   scale.gcd_assign(scalar_prod[j]);
-		  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
-		  //   Coefficient normalized_sp_j = scalar_prod[j] / scale;
-		  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
-		  //     new_row[c] = normalized_sp_i * dest[j][c];
-		  //     new_row[c] -= normalized_sp_j * dest[i][c];
-		  //   }
-                  // </CODE>
-		  normalize2(scalar_prod[i],
-			     scalar_prod[j],
-			     normalized_sp_i,
-			     normalized_sp_o);
-		  WEIGHT_BEGIN();
-
-                  neg_assign(normalized_sp_o);
-                  new_row = dest.sys.rows[j];
-                  // TODO: Check if the following assertions hold.
-                  PPL_ASSERT(normalized_sp_i != 0);
-                  PPL_ASSERT(normalized_sp_o != 0);
-                  new_row.expr.linear_combine(dest.sys.rows[i].expr,
-                                              normalized_sp_i, normalized_sp_o);
-
-                  WEIGHT_ADD_MUL(86, source_space_dim);
-		  new_row.strong_normalize();
-                  // Don't assert new_row.OK() here, because it may fail if
-                  // the parameter `dest' contained a row that wasn't ok.
-		  // Since we added a new generator to `dest_rows',
-		  // we also add a new element to `scalar_prod';
-		  // by construction, the new ray lies on the hyper-plane
-		  // represented by the constraint `source_k'.
-		  // Thus, the added scalar product is 0.
-		  PPL_ASSERT(scalar_prod.size() >= dest_num_rows);
-		  if (scalar_prod.size() <= dest_num_rows)
-		    scalar_prod.push_back(Coefficient_zero());
-		  else
-		    scalar_prod[dest_num_rows] = Coefficient_zero();
-
-                  dest.sys.rows.resize(dest.sys.rows.size() + 1);
-                  swap(dest.sys.rows.back(), new_row);
-		  // Increment the number of generators.
-		  ++dest_num_rows;
-		} // if (!redundant)
-	      }
-	    }
-            // Check if the client has requested abandoning all expensive
-            // computations.  If so, the exception specified by the client
-            // is thrown now.
-	    maybe_abandon();
-	  }
-	  // Now we substitute the rays in Q- (i.e., the rays violating
-	  // the constraint) with the newly added rays.
-	  dimension_type j;
-	  if (source_k.is_ray_or_point_or_inequality()) {
-	    // The constraint is an inequality:
-	    // the violating generators are those in Q-.
-	    j = sup_bound;
-	    // For all the generators in Q+, set to 1 the corresponding
-	    // entry for the constraint `source_k' in the saturation matrix.
-
-            // After the removal of redundant rows in `source', the k-th
-            // row will have index `new_k'.
-            const dimension_type new_k = k - redundant_source_rows.size();
-            for (dimension_type l = lines_or_equal_bound; l < sup_bound; ++l)
-              sat[l].set(new_k);
-	  }
-	  else
-	    // The constraint is an equality:
-	    // the violating generators are those in the union of Q+ and Q-.
-	    j = lines_or_equal_bound;
-
-	  // Swapping the newly added rays
-	  // (index `i' running through `dest_num_rows - 1' down-to `bound')
-	  // with the generators violating the constraint
-	  // (index `j' running through `j' up-to `bound - 1').
-	  dimension_type i = dest_num_rows;
-	  while (j < bound && i > bound) {
-	    --i;
-            swap(dest.sys.rows[i], dest.sys.rows[j]);
-	    swap(scalar_prod[i], scalar_prod[j]);
-	    swap(sat[i], sat[j]);
-	    ++j;
-	    dest_sorted = false;
-	  }
-	  // Setting the number of generators in `dest':
-	  // - if the number of generators violating the constraint
-	  //   is less than or equal to the number of the newly added
-	  //   generators, we assign `i' to `dest_num_rows' because
-	  //   all generators above this index are significant;
-	  // - otherwise, we assign `j' to `dest_num_rows' because
-	  //   all generators below index `j-1' violates the constraint.
-          dimension_type new_num_rows = (j == bound) ? i : j;
-          PPL_ASSERT(dest_num_rows >= new_num_rows);
-          while (dest_num_rows != new_num_rows) {
-            recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
-            swap(dest.sys.rows.back(), recyclable_dest_rows.back());
-            dest.sys.rows.pop_back();
-            --dest_num_rows;
-          }
-          PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
-	}
-      }
-    }
-  }
-
-  // We may have identified some redundant constraints in `source',
-  // which have been swapped at the end of the system.
-  if (redundant_source_rows.size() > 0) {
-    source.remove_rows(redundant_source_rows);
-    sat.remove_trailing_columns(redundant_source_rows.size());
-  }
-
-  // If `start == 0', then `source' was sorted and remained so.
-  // If otherwise `start > 0', then the two sub-system made by the
-  // non-pending rows and the pending rows, respectively, were both sorted.
-  // Thus, the overall system is sorted if and only if either
-  // `start == source_num_rows' (i.e., the second sub-system is empty)
-  // or the row ordering holds for the two rows at the boundary between
-  // the two sub-systems.
-  if (start > 0 && start < source.num_rows())
-    source.set_sorted(compare(source[start - 1], source[start]) <= 0);
-  // There are no longer pending constraints in `source'.
-  source.unset_pending_rows();
-
-  // We may have identified some redundant rays in `dest_rows',
-  // which have been swapped into recyclable_dest_rows.
-  if (!recyclable_dest_rows.empty()) {
-    const dimension_type num_removed_rows = recyclable_dest_rows.size();
-    sat.remove_trailing_rows(num_removed_rows);
-  }
-  if (dest_sorted)
-    // If the non-pending generators in `dest' are still declared to be
-    // sorted, then we have to also check for the sortedness of the
-    // pending generators.
-    for (dimension_type i = dest_first_pending_row; i < dest_num_rows; ++i)
-      if (compare(dest.sys.rows[i - 1], dest.sys.rows[i]) > 0) {
-	dest_sorted = false;
-	break;
-      }
-
-#ifndef NDEBUG
-  // The previous code can modify the rows' fields, exploiting the friendness.
-  // Check that all rows are OK now.
-  for (dimension_type i = dest.num_rows(); i-- > 0; )
-    PPL_ASSERT(dest.sys.rows[i].OK());
-#endif
-
-  dest.sys.index_first_pending = dest.num_rows();
-  dest.set_sorted(dest_sorted);
-  PPL_ASSERT(dest.sys.OK());
-
-  return num_lines_or_equalities;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_conversion_templates_hh)
diff --git a/src/Polyhedron_conversion_templates.hh b/src/Polyhedron_conversion_templates.hh
new file mode 100644
index 0000000..f013b91
--- /dev/null
+++ b/src/Polyhedron_conversion_templates.hh
@@ -0,0 +1,921 @@
+/* Polyhedron class implementation: conversion().
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_conversion_templates_hh
+#define PPL_Polyhedron_conversion_templates_hh 1
+
+#include "Bit_Row_defs.hh"
+#include "Bit_Matrix_defs.hh"
+#include "Polyhedron_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "Temp_defs.hh"
+#include "math_utilities_defs.hh"
+
+#include <cstddef>
+#include <climits>
+
+namespace Parma_Polyhedra_Library {
+
+/*!
+  \return
+  The number of lines of the polyhedron or the number of equality
+  constraints in the result of conversion.
+
+  \param source
+  The system to use to convert \p dest: it may be modified;
+
+  \param start
+  The index of \p source row from which conversion begin;
+
+  \param dest
+  The result of the conversion;
+
+  \param sat
+  The saturation matrix telling us, for each row in \p source, which
+  are the rows of \p dest that satisfy but do not saturate it;
+
+  \param num_lines_or_equalities
+  The number of rows in the system \p dest that are either lines of
+  the polyhedron (when \p dest is a system of generators) or equality
+  constraints (when \p dest is a system of constraints).
+
+  For simplicity, all the following comments assume we are converting a
+  constraint system \p source to a generator system \p dest;
+  the comments for the symmetric case can be obtained by duality.
+
+  If some of the constraints in \p source are redundant, they will be removed.
+  This is why the \p source is not declared to be a constant parameter.
+
+  If \p start is 0, then \p source is a sorted system; also, \p dest is
+  a generator system corresponding to an empty constraint system.
+  If otherwise \p start is greater than 0, then the two sub-systems of
+  \p source made by the non-pending rows and the pending rows, respectively,
+  are both sorted; also, \p dest is the generator system corresponding to
+  the non-pending constraints of \p source.
+
+  Independently from the value of \p start, \p dest has lines from index 0
+  to index \p num_lines_or_equalities - 1 and rays/points from index
+  \p num_lines_or_equalities to the last of its rows.
+
+  Note that here the rows of \p sat are indexed by rows of \p dest
+  and its columns are indexed by rows of \p source.
+
+  We know that polyhedra can be represented by both a system of
+  constraints or a system of generators (points, rays and lines)
+  (see Section \ref representation).
+  When we have both descriptions for a polyhedron \f$P\f$
+  we have what is called a <EM>double description</EM>
+  (or <EM>DD pair</EM>) for \f$P\f$.
+
+  Here, the <EM>representation system</EM> refers to the system \f$C\f$
+  whose rows represent the constraints that characterize \f$P\f$
+  and the <EM>generating system</EM>, the system \f$G\f$ whose rows
+  represent the generators of \f$P\f$.
+  We say that a pair \f$(C, G)\f$ of (real) systems is
+  a <EM>double description pair</EM> if
+  \f[
+    C\vect{x} \geq \vect{0}
+      \quad\iff\quad
+        \exists \vect{\lambda} \geq \vect{0} \mathrel{.}
+        \vect{x} = G\vect{\lambda}.
+  \f]
+
+  The term "double description" is quite natural in the sense that
+  such a pair contains two different description of the same object.
+  In fact, if we refer to the cone representation of a polyhedron \f$P\f$
+  and we call \f$C\f$ and \f$G\f$ the systems of constraints and
+  rays respectively, we have
+  \f[
+    P = \{\, \vect{x} \in \Rset^n \mid C\vect{x} \geq \vect{0}\, \}
+      = \{\, \vect{x} \in \Rset^n \mid \vect{x} = G\vect{\lambda}
+      \text{ for some } \vect{\lambda} \geq \vect{0}\, \}.
+  \f]
+
+  Because of the theorem of Minkowski (see Section \ref prelims),
+  we can say that, given a \f$m \times n\f$ representation system
+  \f$C\f$ such that
+  \f$\mathop{\mathrm{rank}}(C) = n = \mathit{dimension of the whole space}\f$
+  for a non-empty polyhedron \f$P\f$,
+  it is always possible to find a generating system \f$G\f$ for \f$P\f$
+  such that \f$(C, G)\f$ is a DD pair.
+  Conversely, Weyl's theorem ensures that, for each generating system
+  \f$G\f$, it is possible to find a representation system \f$C\f$
+  such that \f$(C, G)\f$ is a DD pair.
+
+  For efficiency reasons, our representation of polyhedra makes use
+  of a double description.
+  We are thus left with two problems:
+    -# given \f$C\f$ find \f$G\f$ such that \f$(C, G)\f$ is a DD pair;
+    -# given \f$G\f$ find \f$C\f$ such that \f$(C, G)\f$ is a DD pair.
+
+  Using Farkas' Lemma we can prove that these two problems are
+  computationally equivalent (i.e., linear-time reducible to each other).
+  Farkas' Lemma establishes a fundamental property of vectors in
+  \f$\Rset^n\f$ that, in a sense, captures the essence of duality.
+  Consider a matrix \f$A \in \Rset^{m \times n}\f$ and let
+  \f$\{ \vect{a}_1, \ldots, \vect{a}_m \}\f$ be its set of row vectors.
+  Consider also another vector \f$\vect{c} \in \Rset^n\f$ such that,
+  whenever a vector \f$\vect{y} \in \Rset^n\f$ has a non-negative projection
+  on the \f$\vect{a}_i\f$'s, it also has a non-negative projection
+  on \f$\vect{c}\f$.
+  The lemma states that \f$\vect{c}\f$ has this property if and only if
+  it is in the cone generated by the \f$\vect{a}_i\f$'s.
+  Formally, the lemma states the equivalence of the two following
+  assertions:
+    -# \f$
+         \forall \vect{y}
+           \mathrel{:} (A\vect{y} \geq 0 \implies
+           \langle \vect{y},\vect{c} \rangle \geq 0)
+       \f$;
+    -# \f$
+         \exists \vect{\lambda} \geq \vect{0}
+           \mathrel{.} \vect{c}^\mathrm{T} = \vect{\lambda}^\mathrm{T}A
+       \f$.
+
+  With this result we can prove that \f$(C, G)\f$ is a DD pair
+  if and only if \f$(G^\mathrm{T}, C^\mathrm{T})\f$ is a DD pair.
+
+  Suppose \f$(C, G)\f$ is a DD pair.
+  Thus, for each \f$x\f$ of the appropriate dimension,
+  \f$C\vect{x} \geq \vect{0}\f$ if and only if
+  \f$\exists \lambda \geq 0 \mathrel{.} \vect{x} = G\vect{\lambda}\f$,
+  which is of course equivalent to
+  \f$
+    \exists \vect{\lambda} \geq \vect{0}
+      \mathrel{.} \vect{x}^\mathrm{T} = \vect{\lambda}^\mathrm{T}G^\mathrm{T}
+  \f$.
+
+  First, we assume that \f$\vect{z}\f$ is such that
+  \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$
+  and we will show that
+  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
+  \vect{z} = C^\mathrm{T}\vect{\mu}\f$.
+  Let \f$\vect{x}\f$ be such that \f$C\vect{x} \geq \vect{0}\f$.
+  Since \f$(C, G)\f$ is a DD pair, this is equivalent to
+  \f$
+    \exists \vect{\lambda} \geq \vect{0}
+      \mathrel{.} \vect{x}^\mathrm{T} = \vect{\lambda}^\mathrm{T}G^\mathrm{T}
+  \f$,
+  which, by Farkas' Lemma is equivalent to
+  \f$
+    \forall \vect{y} \mathrel{:} (G^\mathrm{T}\vect{y} \geq \vect{0} \implies
+                                 \langle \vect{y}, \vect{x} \rangle \geq 0)
+  \f$.
+  Taking \f$\vect{y} = \vect{z}\f$ and recalling our assumption that
+  \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$
+  we can conclude that \f$\langle \vect{z}, \vect{x} \rangle \geq 0\f$,
+  that is equivalent to \f$\langle \vect{x}, \vect{z} \rangle \geq 0\f$.
+  We have thus established that
+  \f$
+    \forall \vect{x} \mathrel{:} (C\vect{x} \geq \vect{0} \implies
+    \langle \vect{x}, \vect{z} \rangle \geq 0)
+  \f$.
+  By Farkas' Lemma, this is equivalent to
+  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
+  \vect{z}^\mathrm{T} = \vect{\mu}^\mathrm{T} C\f$,
+  which is equivalent to what we wanted to prove, that is,
+  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
+  \vect{z} = C^\mathrm{T}\vect{\mu}\f$.
+
+  In order to prove the reverse implication, the following observation
+  turns out to be useful:
+  when \f$(C, G)\f$ is a DD pair, \f$CG \geq 0\f$.
+  In fact,
+  let \f$\vect{e}_j\f$ be the vector whose components are all \f$0\f$
+  apart from the \f$j\f$-th one, which is \f$1\f$.
+  Clearly \f$\vect{e}_j \geq \vect{0}\f$ and, taking
+  \f$\vect{\lambda} = \vect{e}_j\f$ and
+  \f$\vect{x} = G\vect{\lambda} = G \vect{e}_j\f$, we have
+  \f$C\vect{x} = C(G \vect{e}_j) = (CG)\vect{e}_j \geq \vect{0}\f$,
+  since \f$(C, G)\f$ is a DD pair.
+  Thus, as \f$(CG)\vect{e}_j\f$ is the \f$j\f$-th column of \f$CG\f$
+  and since the choice of \f$j\f$ was arbitrary, \f$CG \geq \vect{0}\f$.
+
+  We now assume that \f$\vect{z}\f$ is such that
+  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
+  \vect{z} = C^\mathrm{T}\vect{\mu}\f$
+  and we will prove that \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$.
+  By Farkas' Lemma, the assumption
+  \f$\exists \vect{\mu} \geq \vect{0} \mathrel{.}
+  \vect{z}^\mathrm{T} = \vect{\mu}^\mathrm{T}C\f$,
+  is equivalent to
+  \f$\forall \vect{y} \mathrel{:} (C\vect{y} \geq \vect{0}
+  \implies \langle \vect{y}, \vect{z} \rangle \geq 0)\f$.
+  If we take \f$\vect{y} = G\vect{e}_j\f$ then \f$C\vect{y}
+                 = CG\vect{e}_j \geq 0\f$,
+  since \f$CG \geq \vect{0}\f$.
+  So
+  \f$
+    \langle \vect{y}, \vect{z} \rangle
+      = (\vect{e}_j^\mathrm{T}G^\mathrm{T}) \vect{z}
+      = \vect{e}_j^\mathrm{T}(G^\mathrm{T} \vect{z})
+      \geq 0
+  \f$,
+  that is, the \f$j\f$-th component of \f$G^\mathrm{T}\vect{z}\f$
+  is non-negative. The arbitrary choice of \f$j\f$ allows us to conclude
+  that \f$G^\mathrm{T}\vect{z} \geq \vect{0}\f$, as required.
+
+  In view of this result, the following exposition assumes, for clarity,
+  that the conversion being performed is from constraints to generators.
+  Thus, even if the roles of \p source and \p dest can be interchanged,
+  in the sequel we assume the \p source system will contain the constraints
+  that represent the polyhedron and the \p dest system will contain
+  the generator that generates it.
+
+  There are some observations that are useful to understand this function:
+
+  Observation 1: Let \f$A\f$ be a system of constraints that generate
+  the polyhedron \f$P\f$ and \f$\vect{c}\f$ a new constraint that must
+  be added. Suppose that there is a line \f$\vect{z}\f$ that does not
+  saturate the constraint \f$\vect{c}\f$. If we combine the old lines
+  and rays that do not saturate \f$\vect{c}\f$ (except \f$\vect{z}\f$)
+  with \f$\vect{z}\f$ such that the new ones saturate \f$\vect{c}\f$,
+  the new lines and rays also saturate the constraints  saturated by
+  the old lines and rays.
+
+  In fact, if \f$\vect{y}_1\f$ is the old generator that does not saturate
+  \f$\vect{c}\f$, \f$\vect{y}_2\f$ is the new one such that
+  \f[
+    \vect{y}_2 = \lambda \vect{y}_1 + \mu \vect{z}
+  \f]
+  and \f$\vect{c}_1\f$ is a previous constraint that \f$\vect{y}_1\f$
+  and \f$\vect{z}\f$ saturates, we can see
+  \f[
+    \langle \vect{c}_1, \vect{y}_2 \rangle
+    = \langle \vect{c}_1, (\lambda \vect{y}_1 + \mu \vect{z}) \rangle
+    = \lambda \langle \vect{c}_1, \vect{y}_1 \rangle
+       + \mu \langle \vect{c}_1, \vect{z} \rangle
+       = 0 + \mu \langle \vect{c}_1, \vect{z} \rangle
+       = \mu \langle \vect{c}_1, \vect{z} \rangle
+  \f]
+  and
+  \f[
+    \mu \langle \vect{c}_1, \vect{z} \rangle = 0.
+  \f]
+
+  Proposition 1: Let \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ be distinct
+  rays of \f$P\f$.
+  Then the following statements are equivalent:
+  a) \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are adjacent extreme rays
+     (see Section \ref prelims);
+  b) \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are extreme rays and the
+     rank of the system composed by the constraints saturated by both
+     \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ is equal to
+     \f$d - 2\f$, where \f$d\f$ is the rank of the system of constraints.
+
+  In fact, let \f$F\f$ be the system of generators that saturate the
+  constraints saturated by both \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$.
+  If b) holds, the set \f$F\f$ is 2-dimensional and \f$\vect{r}_1\f$ and
+  \f$\vect{r}_2\f$ generate this set. So, every generator
+  \f$\vect{x}\f$ of \f$F\f$ can be built as a combination of
+  \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$, i.e.
+  \f[
+    \vect{x} = \lambda \vect{r}_1 + \mu \vect{r}_2.
+  \f]
+  This combination is non-negative because there exists at least a
+  constraint \f$c\f$ saturated by \f$\vect{r}_1\f$ and not
+  \f$\vect{r}_2\f$ (or vice versa) (because they are distinct) for which
+  \f[
+    \langle \vect{c}, \vect{x} \rangle \geq 0
+  \f]
+  and
+  \f[
+    \langle \vect{c}, \vect{x} \rangle
+    = \lambda \langle \vect{c}, \vect{r}_1 \rangle
+                           (or = \mu \langle \vect{c}, \vect{r}_2 \rangle).
+  \f]
+  So, there is no other extreme ray in \f$F\f$ and a) holds.
+  Otherwise, if b) does not hold, the rank of the system generated by
+  the constraints saturated by both \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$
+  is equal to \f$d - k\f$, with \p k \>= 3, the set \f$F\f$ is
+  \p k -dimensional and at least \p k extreme rays are necessary
+  to generate \f$F\f$.
+  So, \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are not adjacent and
+  a) does not hold.
+
+  Proposition 2: When we build the new system of generators starting from
+  a system \f$A\f$ of constraints of \f$P\f$, if \f$\vect{c}\f$ is the
+  constraint to add to \f$A\f$ and all lines of \f$P\f$ saturate
+  \f$\vect{c}\f$, the new set of rays is the union of those rays that
+  saturate, of those that satisfy and of a set \f$\overline Q\f$ of
+  rays such that each of them
+  -# lies on the hyper-plane represented by the k-th constraint,
+  -# is a positive combination of two adjacent rays \f$\vect{r}_1\f$ and
+     \f$\vect{r}_2\f$ such that the first one satisfies the constraint and
+     the other does not satisfy it.
+  If the adjacency property is not taken in account, the new set of
+  rays is not irredundant, in general.
+
+  In fact, if \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ are not adjacent,
+  the rank of the system composed by the constraints saturated by both
+  \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$ is different from \f$d - 2\f$
+  (see the previous proposition) or neither \f$\vect{r}_1\f$ nor
+  \f$\vect{r}_2\f$ are extreme rays. Since the new ray \f$\vect{r}\f$
+  is a combination of \f$\vect{r}_1\f$ and \f$\vect{r}_2\f$,
+  it saturates the same constraints saturated by both \f$\vect{r}_1\f$ and
+  \f$\vect{r}_2\f$.
+  If the rank is less than \f$d - 2\f$, the rank of
+  the system composed by \f$\vect{c}\f$ (that is saturated by \f$\vect{r}\f$)
+  and by the constraints of \f$A\f$ saturated by \f$\vect{r}\f$  is less
+  than \f$d - 1\f$. It means that \f$r\f$ is redundant (see
+  Section \ref prelims).
+  If neither \f$\vect{r}_1\f$ nor \f$\vect{r}_2\f$ are extreme rays,
+  they belong to a 2-dimensional face containing exactly two extreme rays
+  of \f$P\f$.
+  These two adjacent rays build a ray equal to \f$\vect{r}\f$ and so
+  \f$\vect{r}\f$ is redundant.
+*/
+template <typename Source_Linear_System, typename Dest_Linear_System>
+dimension_type
+Polyhedron::conversion(Source_Linear_System& source,
+                       const dimension_type start,
+                       Dest_Linear_System& dest,
+                       Bit_Matrix& sat,
+                       dimension_type num_lines_or_equalities) {
+  typedef typename Dest_Linear_System::row_type dest_row_type;
+  typedef typename Source_Linear_System::row_type source_row_type;
+
+  // Constraints and generators must have the same dimension,
+  // otherwise the scalar products below will bomb.
+  PPL_ASSERT(source.space_dimension() == dest.space_dimension());
+  const dimension_type source_space_dim = source.space_dimension();
+  const dimension_type source_num_rows = source.num_rows();
+  const dimension_type source_num_columns = source_space_dim
+    + (source.is_necessarily_closed() ? 1U : 2U);
+
+
+  dimension_type dest_num_rows = dest.num_rows();
+  // The rows removed from `dest' will be placed in this vector, so they
+  // can be recycled if needed.
+  std::vector<dest_row_type> recyclable_dest_rows;
+
+  using std::swap;
+
+  // By construction, the number of columns of `sat' is the same as
+  // the number of rows of `source'; also, the number of rows of `sat'
+  // is the same as the number of rows of `dest'.
+  PPL_ASSERT(source_num_rows == sat.num_columns());
+  PPL_ASSERT(dest_num_rows == sat.num_rows());
+
+  // If `start > 0', then we are converting the pending constraints.
+  PPL_ASSERT(start == 0 || start == source.first_pending_row());
+
+  PPL_DIRTY_TEMP_COEFFICIENT(normalized_sp_i);
+  PPL_DIRTY_TEMP_COEFFICIENT(normalized_sp_o);
+
+  bool dest_sorted = dest.is_sorted();
+  const dimension_type dest_first_pending_row = dest.first_pending_row();
+
+  // This will contain the row indexes of the redundant rows of `source'.
+  std::vector<dimension_type> redundant_source_rows;
+
+  // Converting the sub-system of `source' having rows with indexes
+  // from `start' to the last one (i.e., `source_num_rows' - 1).
+  for (dimension_type k = start; k < source_num_rows; ++k) {
+    const source_row_type& source_k = source[k];
+
+    // `scalar_prod[i]' will contain the scalar product of the
+    // constraint `source_k' and the generator `dest_rows[i]'.  This
+    // product is 0 if and only if the generator saturates the
+    // constraint.
+    PPL_DIRTY_TEMP(std::vector<Coefficient>, scalar_prod);
+    if (dest_num_rows > scalar_prod.size()) {
+      scalar_prod.insert(scalar_prod.end(),
+                         dest_num_rows - scalar_prod.size(),
+                         Coefficient_zero());
+    }
+    // `index_non_zero' will indicate the first generator in `dest_rows'
+    // that does not saturate the constraint `source_k'.
+    dimension_type index_non_zero = 0;
+    for ( ; index_non_zero < dest_num_rows; ++index_non_zero) {
+      WEIGHT_BEGIN();
+      Scalar_Products::assign(scalar_prod[index_non_zero],
+                              source_k,
+                              dest.sys.rows[index_non_zero]);
+      WEIGHT_ADD_MUL(17, source_space_dim);
+      if (scalar_prod[index_non_zero] != 0)
+        // The generator does not saturate the constraint.
+        break;
+      // Check if the client has requested abandoning all expensive
+      // computations.  If so, the exception specified by the client
+      // is thrown now.
+      maybe_abandon();
+    }
+    for (dimension_type i = index_non_zero + 1; i < dest_num_rows; ++i) {
+      WEIGHT_BEGIN();
+      Scalar_Products::assign(scalar_prod[i], source_k, dest.sys.rows[i]);
+      WEIGHT_ADD_MUL(25, source_space_dim);
+      // Check if the client has requested abandoning all expensive
+      // computations.  If so, the exception specified by the client
+      // is thrown now.
+      maybe_abandon();
+    }
+
+    // We first treat the case when `index_non_zero' is less than
+    // `num_lines_or_equalities', i.e., when the generator that
+    // does not saturate the constraint `source_k' is a line.
+    // The other case (described later) is when all the lines
+    // in `dest_rows' (i.e., all the rows having indexes less than
+    // `num_lines_or_equalities') do saturate the constraint.
+
+    if (index_non_zero < num_lines_or_equalities) {
+      // Since the generator `dest_rows[index_non_zero]' does not saturate
+      // the constraint `source_k', it can no longer be a line
+      // (see saturation rule in Section \ref prelims).
+      // Therefore, we first transform it to a ray.
+      dest.sys.rows[index_non_zero].set_is_ray_or_point_or_inequality();
+      // Of the two possible choices, we select the ray satisfying
+      // the constraint (namely, the ray whose scalar product
+      // with the constraint gives a positive result).
+      if (scalar_prod[index_non_zero] < 0) {
+        // The ray `dest_rows[index_non_zero]' lies on the wrong half-space:
+        // we change it to have the opposite direction.
+        neg_assign(scalar_prod[index_non_zero]);
+        neg_assign(dest.sys.rows[index_non_zero].expr);
+        // The modified row may still not be OK(), so don't assert OK here.
+        // They are all checked at the end of this function.
+      }
+      // Having changed a line to a ray, we set `dest_rows' to be a
+      // non-sorted system, we decrement the number of lines of `dest_rows'
+      // and, if necessary, we move the new ray below all the remaining lines.
+      dest_sorted = false;
+      --num_lines_or_equalities;
+      if (index_non_zero != num_lines_or_equalities) {
+        swap(dest.sys.rows[index_non_zero],
+             dest.sys.rows[num_lines_or_equalities]);
+        swap(scalar_prod[index_non_zero],
+             scalar_prod[num_lines_or_equalities]);
+      }
+      const dest_row_type& dest_nle = dest.sys.rows[num_lines_or_equalities];
+
+      // Computing the new lineality space.
+      // Since each line must lie on the hyper-plane corresponding to
+      // the constraint `source_k', the scalar product between
+      // the line and the constraint must be 0.
+      // This property already holds for the lines having indexes
+      // between 0 and `index_non_zero' - 1.
+      // We have to consider the remaining lines, having indexes
+      // between `index_non_zero' and `num_lines_or_equalities' - 1.
+      // Each line that does not saturate the constraint has to be
+      // linearly combined with generator `dest_nle' so that the
+      // resulting new line saturates the constraint.
+      // Note that, by Observation 1 above, the resulting new line
+      // will still saturate all the constraints that were saturated by
+      // the old line.
+
+      Coefficient& scalar_prod_nle = scalar_prod[num_lines_or_equalities];
+      PPL_ASSERT(scalar_prod_nle != 0);
+      for (dimension_type
+             i = index_non_zero; i < num_lines_or_equalities; ++i) {
+        if (scalar_prod[i] != 0) {
+          // The following fragment optimizes the computation of
+          //
+          // <CODE>
+          //   Coefficient scale = scalar_prod[i];
+          //   scale.gcd_assign(scalar_prod_nle);
+          //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
+          //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
+          //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
+          //     dest[i][c] *= normalized_sp_n;
+          //     dest[i][c] -= normalized_sp_i * dest_nle[c];
+          //   }
+          // </CODE>
+          normalize2(scalar_prod[i],
+                     scalar_prod_nle,
+                     normalized_sp_i,
+                     normalized_sp_o);
+          dest_row_type& dest_i = dest.sys.rows[i];
+          neg_assign(normalized_sp_i);
+          dest_i.expr.linear_combine(dest_nle.expr,
+                                     normalized_sp_o, normalized_sp_i);
+          dest_i.strong_normalize();
+          // The modified row may still not be OK(), so don't assert OK here.
+          // They are all checked at the end of this function.
+          scalar_prod[i] = 0;
+          // dest_sorted has already been set to false.
+        }
+      }
+
+      // Computing the new pointed cone.
+      // Similarly to what we have done during the computation of
+      // the lineality space, we consider all the remaining rays
+      // (having indexes strictly greater than `num_lines_or_equalities')
+      // that do not saturate the constraint `source_k'. These rays
+      // are positively combined with the ray `dest_nle' so that the
+      // resulting new rays saturate the constraint.
+      for (dimension_type
+             i = num_lines_or_equalities + 1; i < dest_num_rows; ++i) {
+        if (scalar_prod[i] != 0) {
+          // The following fragment optimizes the computation of
+          //
+          // <CODE>
+          //   Coefficient scale = scalar_prod[i];
+          //   scale.gcd_assign(scalar_prod_nle);
+          //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
+          //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
+          //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
+          //     dest[i][c] *= normalized_sp_n;
+          //     dest[i][c] -= normalized_sp_i * dest_nle[c];
+          //   }
+          // </CODE>
+          normalize2(scalar_prod[i],
+                     scalar_prod_nle,
+                     normalized_sp_i,
+                     normalized_sp_o);
+          dest_row_type& dest_i = dest.sys.rows[i];
+          WEIGHT_BEGIN();
+          neg_assign(normalized_sp_i);
+          dest_i.expr.linear_combine(dest_nle.expr,
+                                     normalized_sp_o, normalized_sp_i);
+          dest_i.strong_normalize();
+          // The modified row may still not be OK(), so don't assert OK here.
+          // They are all checked at the end of this function.
+          scalar_prod[i] = 0;
+          // `dest_sorted' has already been set to false.
+          WEIGHT_ADD_MUL(41, source_space_dim);
+        }
+        // Check if the client has requested abandoning all expensive
+        // computations.  If so, the exception specified by the client
+        // is thrown now.
+        maybe_abandon();
+      }
+      // Since the `scalar_prod_nle' is positive (by construction), it
+      // does not saturate the constraint `source_k'.  Therefore, if
+      // the constraint is an inequality, we set to 1 the
+      // corresponding element of `sat' ...
+      Bit_Row& sat_nle = sat[num_lines_or_equalities];
+      if (source_k.is_ray_or_point_or_inequality())
+        sat_nle.set(k - redundant_source_rows.size());
+      // ... otherwise, the constraint is an equality which is
+      // violated by the generator `dest_nle': the generator has to be
+      // removed from `dest_rows'.
+      else {
+        --dest_num_rows;
+        swap(dest.sys.rows[num_lines_or_equalities],
+             dest.sys.rows[dest_num_rows]);
+        recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
+        swap(dest.sys.rows.back(), recyclable_dest_rows.back());
+        dest.sys.rows.pop_back();
+        PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
+
+        swap(scalar_prod_nle, scalar_prod[dest_num_rows]);
+        swap(sat_nle, sat[dest_num_rows]);
+        // dest_sorted has already been set to false.
+      }
+    }
+    // Here we have `index_non_zero' >= `num_lines_or_equalities',
+    // so that all the lines in `dest_rows' saturate the constraint `source_k'.
+    else {
+      // First, we reorder the generators in `dest_rows' as follows:
+      // -# all the lines should have indexes between 0 and
+      //    `num_lines_or_equalities' - 1 (this already holds);
+      // -# all the rays that saturate the constraint should have
+      //    indexes between `num_lines_or_equalities' and
+      //    `lines_or_equal_bound' - 1; these rays form the set Q=.
+      // -# all the rays that have a positive scalar product with the
+      //    constraint should have indexes between `lines_or_equal_bound'
+      //    and `sup_bound' - 1; these rays form the set Q+.
+      // -# all the rays that have a negative scalar product with the
+      //    constraint should have indexes between `sup_bound' and
+      //    `dest_num_rows' - 1; these rays form the set Q-.
+      dimension_type lines_or_equal_bound = num_lines_or_equalities;
+      dimension_type inf_bound = dest_num_rows;
+      // While we find saturating generators, we simply increment
+      // `lines_or_equal_bound'.
+      while (inf_bound > lines_or_equal_bound
+             && scalar_prod[lines_or_equal_bound] == 0)
+        ++lines_or_equal_bound;
+      dimension_type sup_bound = lines_or_equal_bound;
+      while (inf_bound > sup_bound) {
+        const int sp_sign = sgn(scalar_prod[sup_bound]);
+        if (sp_sign == 0) {
+          // This generator has to be moved in Q=.
+          swap(dest.sys.rows[sup_bound], dest.sys.rows[lines_or_equal_bound]);
+          swap(scalar_prod[sup_bound], scalar_prod[lines_or_equal_bound]);
+          swap(sat[sup_bound], sat[lines_or_equal_bound]);
+          ++lines_or_equal_bound;
+          ++sup_bound;
+          dest_sorted = false;
+        }
+        else if (sp_sign < 0) {
+          // This generator has to be moved in Q-.
+          --inf_bound;
+          swap(dest.sys.rows[sup_bound], dest.sys.rows[inf_bound]);
+          swap(sat[sup_bound], sat[inf_bound]);
+          swap(scalar_prod[sup_bound], scalar_prod[inf_bound]);
+          dest_sorted = false;
+        }
+        else
+          // sp_sign > 0: this generator has to be moved in Q+.
+          ++sup_bound;
+      }
+
+      if (sup_bound == dest_num_rows) {
+        // Here the set Q- is empty.
+        // If the constraint is an inequality, then all the generators
+        // in Q= and Q+ satisfy the constraint. The constraint is redundant
+        // and it can be safely removed from the constraint system.
+        // This is why the `source' parameter is not declared `const'.
+        if (source_k.is_ray_or_point_or_inequality()) {
+          redundant_source_rows.push_back(k);
+        }
+        else {
+          // The constraint is an equality, so that all the generators
+          // in Q+ violate it. Since the set Q- is empty, we can simply
+          // remove from `dest_rows' all the generators of Q+.
+          PPL_ASSERT(dest_num_rows >= lines_or_equal_bound);
+          while (dest_num_rows != lines_or_equal_bound) {
+            recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
+            swap(dest.sys.rows.back(), recyclable_dest_rows.back());
+            dest.sys.rows.pop_back();
+            --dest_num_rows;
+          }
+          PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
+        }
+      }
+      else {
+        // The set Q- is not empty, i.e., at least one generator
+        // violates the constraint `source_k'.
+        // We have to further distinguish two cases:
+        if (sup_bound == num_lines_or_equalities) {
+          // The set Q+ is empty, so that all generators that satisfy
+          // the constraint also saturate it.
+          // We can simply remove from `dest_rows' all the generators in Q-.
+          PPL_ASSERT(dest_num_rows >= sup_bound);
+          while (dest_num_rows != sup_bound) {
+            recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
+            swap(dest.sys.rows.back(), recyclable_dest_rows.back());
+            dest.sys.rows.pop_back();
+            --dest_num_rows;
+          }
+          PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
+        }
+        else {
+          // The sets Q+ and Q- are both non-empty.
+          // The generators of the new pointed cone are all those satisfying
+          // the constraint `source_k' plus a set of new rays enjoying
+          // the following properties:
+          // -# they lie on the hyper-plane represented by the constraint
+          // -# they are obtained as a positive combination of two
+          //    adjacent rays, the first taken from Q+ and the second
+          //    taken from Q-.
+
+          // The adjacency property is necessary to have an irredundant
+          // set of new rays (see proposition 2).
+          const dimension_type bound = dest_num_rows;
+
+          // In the following loop,
+          // `i' runs through the generators in the set Q+ and
+          // `j' runs through the generators in the set Q-.
+          for (dimension_type i = lines_or_equal_bound; i < sup_bound; ++i) {
+            for(dimension_type j = sup_bound; j < bound; ++j) {
+              // Checking if generators `dest_rows[i]' and `dest_rows[j]' are
+              // adjacent.
+              // If there exist another generator that saturates
+              // all the constraints saturated by both `dest_rows[i]' and
+              // `dest_rows[j]', then they are NOT adjacent.
+              PPL_ASSERT(sat[i].last() == C_Integer<unsigned long>::max
+                         || sat[i].last() < k);
+              PPL_ASSERT(sat[j].last() == C_Integer<unsigned long>::max
+                         || sat[j].last() < k);
+
+              // Being the union of `sat[i]' and `sat[j]',
+              // `new_satrow' corresponds to a ray that saturates all the
+              // constraints saturated by both `dest_rows[i]' and
+              // `dest_rows[j]'.
+              Bit_Row new_satrow(sat[i], sat[j]);
+
+              // Compute the number of common saturators.
+              // NOTE: this number has to be less than `k' because
+              // we are treating the `k'-th constraint.
+              const dimension_type num_common_satur
+                = k - redundant_source_rows.size() - new_satrow.count_ones();
+
+              // Even before actually creating the new ray as a
+              // positive combination of `dest_rows[i]' and `dest_rows[j]',
+              // we exploit saturation information to check if
+              // it can be an extremal ray. To this end, we refer
+              // to the definition of a minimal proper face
+              // (see comments in Polyhedron_defs.hh):
+              // an extremal ray saturates at least `n' - `t' - 1
+              // constraints, where `n' is the dimension of the space
+              // and `t' is the dimension of the lineality space.
+              // Since `n == source_num_columns - 1' and
+              // `t == num_lines_or_equalities', we obtain that
+              // an extremal ray saturates at least
+              // `source_num_columns - num_lines_or_equalities - 2'
+              // constraints.
+              if (num_common_satur
+                  >= source_num_columns - num_lines_or_equalities - 2) {
+                // The minimal proper face rule is satisfied.
+                // Now we actually check for redundancy by computing
+                // adjacency information.
+                bool redundant = false;
+                WEIGHT_BEGIN();
+                for (dimension_type
+                       l = num_lines_or_equalities; l < bound; ++l)
+                  if (l != i && l != j
+                      && subset_or_equal(sat[l], new_satrow)) {
+                    // Found another generator saturating all the
+                    // constraints saturated by both `dest_rows[i]' and
+                    // `dest_rows[j]'.
+                    redundant = true;
+                    break;
+                  }
+                PPL_ASSERT(bound >= num_lines_or_equalities);
+                WEIGHT_ADD_MUL(15, bound - num_lines_or_equalities);
+                if (!redundant) {
+                  // Adding the new ray to `dest_rows' and the corresponding
+                  // saturation row to `sat'.
+                  dest_row_type new_row;
+                  if (recyclable_dest_rows.empty()) {
+                    sat.add_recycled_row(new_satrow);
+                  }
+                  else {
+                    swap(new_row, recyclable_dest_rows.back());
+                    recyclable_dest_rows.pop_back();
+                    new_row.set_space_dimension_no_ok(source_space_dim);
+                    swap(sat[dest_num_rows], new_satrow);
+                  }
+
+                  // The following fragment optimizes the computation of
+                  //
+                  // <CODE>
+                  //   Coefficient scale = scalar_prod[i];
+                  //   scale.gcd_assign(scalar_prod[j]);
+                  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
+                  //   Coefficient normalized_sp_j = scalar_prod[j] / scale;
+                  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
+                  //     new_row[c] = normalized_sp_i * dest[j][c];
+                  //     new_row[c] -= normalized_sp_j * dest[i][c];
+                  //   }
+                  // </CODE>
+                  normalize2(scalar_prod[i],
+                             scalar_prod[j],
+                             normalized_sp_i,
+                             normalized_sp_o);
+                  WEIGHT_BEGIN();
+
+                  neg_assign(normalized_sp_o);
+                  new_row = dest.sys.rows[j];
+                  // TODO: Check if the following assertions hold.
+                  PPL_ASSERT(normalized_sp_i != 0);
+                  PPL_ASSERT(normalized_sp_o != 0);
+                  new_row.expr.linear_combine(dest.sys.rows[i].expr,
+                                              normalized_sp_i, normalized_sp_o);
+
+                  WEIGHT_ADD_MUL(86, source_space_dim);
+                  new_row.strong_normalize();
+                  // Don't assert new_row.OK() here, because it may fail if
+                  // the parameter `dest' contained a row that wasn't ok.
+                  // Since we added a new generator to `dest_rows',
+                  // we also add a new element to `scalar_prod';
+                  // by construction, the new ray lies on the hyper-plane
+                  // represented by the constraint `source_k'.
+                  // Thus, the added scalar product is 0.
+                  PPL_ASSERT(scalar_prod.size() >= dest_num_rows);
+                  if (scalar_prod.size() <= dest_num_rows)
+                    scalar_prod.push_back(Coefficient_zero());
+                  else
+                    scalar_prod[dest_num_rows] = Coefficient_zero();
+
+                  dest.sys.rows.resize(dest.sys.rows.size() + 1);
+                  swap(dest.sys.rows.back(), new_row);
+                  // Increment the number of generators.
+                  ++dest_num_rows;
+                } // if (!redundant)
+              }
+            }
+            // Check if the client has requested abandoning all expensive
+            // computations.  If so, the exception specified by the client
+            // is thrown now.
+            maybe_abandon();
+          }
+          // Now we substitute the rays in Q- (i.e., the rays violating
+          // the constraint) with the newly added rays.
+          dimension_type j;
+          if (source_k.is_ray_or_point_or_inequality()) {
+            // The constraint is an inequality:
+            // the violating generators are those in Q-.
+            j = sup_bound;
+            // For all the generators in Q+, set to 1 the corresponding
+            // entry for the constraint `source_k' in the saturation matrix.
+
+            // After the removal of redundant rows in `source', the k-th
+            // row will have index `new_k'.
+            const dimension_type new_k = k - redundant_source_rows.size();
+            for (dimension_type l = lines_or_equal_bound; l < sup_bound; ++l)
+              sat[l].set(new_k);
+          }
+          else
+            // The constraint is an equality:
+            // the violating generators are those in the union of Q+ and Q-.
+            j = lines_or_equal_bound;
+
+          // Swapping the newly added rays
+          // (index `i' running through `dest_num_rows - 1' down-to `bound')
+          // with the generators violating the constraint
+          // (index `j' running through `j' up-to `bound - 1').
+          dimension_type i = dest_num_rows;
+          while (j < bound && i > bound) {
+            --i;
+            swap(dest.sys.rows[i], dest.sys.rows[j]);
+            swap(scalar_prod[i], scalar_prod[j]);
+            swap(sat[i], sat[j]);
+            ++j;
+            dest_sorted = false;
+          }
+          // Setting the number of generators in `dest':
+          // - if the number of generators violating the constraint
+          //   is less than or equal to the number of the newly added
+          //   generators, we assign `i' to `dest_num_rows' because
+          //   all generators above this index are significant;
+          // - otherwise, we assign `j' to `dest_num_rows' because
+          //   all generators below index `j-1' violates the constraint.
+          const dimension_type new_num_rows = (j == bound) ? i : j;
+          PPL_ASSERT(dest_num_rows >= new_num_rows);
+          while (dest_num_rows != new_num_rows) {
+            recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
+            swap(dest.sys.rows.back(), recyclable_dest_rows.back());
+            dest.sys.rows.pop_back();
+            --dest_num_rows;
+          }
+          PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
+        }
+      }
+    }
+  }
+
+  // We may have identified some redundant constraints in `source',
+  // which have been swapped at the end of the system.
+  if (redundant_source_rows.size() > 0) {
+    source.remove_rows(redundant_source_rows);
+    sat.remove_trailing_columns(redundant_source_rows.size());
+  }
+
+  // If `start == 0', then `source' was sorted and remained so.
+  // If otherwise `start > 0', then the two sub-system made by the
+  // non-pending rows and the pending rows, respectively, were both sorted.
+  // Thus, the overall system is sorted if and only if either
+  // `start == source_num_rows' (i.e., the second sub-system is empty)
+  // or the row ordering holds for the two rows at the boundary between
+  // the two sub-systems.
+  if (start > 0 && start < source.num_rows())
+    source.set_sorted(compare(source[start - 1], source[start]) <= 0);
+  // There are no longer pending constraints in `source'.
+  source.unset_pending_rows();
+
+  // We may have identified some redundant rays in `dest_rows',
+  // which have been swapped into recyclable_dest_rows.
+  if (!recyclable_dest_rows.empty()) {
+    const dimension_type num_removed_rows = recyclable_dest_rows.size();
+    sat.remove_trailing_rows(num_removed_rows);
+  }
+  if (dest_sorted)
+    // If the non-pending generators in `dest' are still declared to be
+    // sorted, then we have to also check for the sortedness of the
+    // pending generators.
+    for (dimension_type i = dest_first_pending_row; i < dest_num_rows; ++i)
+      if (compare(dest.sys.rows[i - 1], dest.sys.rows[i]) > 0) {
+        dest_sorted = false;
+        break;
+      }
+
+#ifndef NDEBUG
+  // The previous code can modify the rows' fields, exploiting the friendness.
+  // Check that all rows are OK now.
+  for (dimension_type i = dest.num_rows(); i-- > 0; )
+    PPL_ASSERT(dest.sys.rows[i].OK());
+#endif
+
+  dest.sys.index_first_pending = dest.num_rows();
+  dest.set_sorted(dest_sorted);
+  PPL_ASSERT(dest.sys.OK());
+
+  return num_lines_or_equalities;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_conversion_templates_hh)
diff --git a/src/Polyhedron_defs.hh b/src/Polyhedron_defs.hh
new file mode 100644
index 0000000..c967f42
--- /dev/null
+++ b/src/Polyhedron_defs.hh
@@ -0,0 +1,2843 @@
+/* Polyhedron class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_defs_hh
+#define PPL_Polyhedron_defs_hh 1
+
+#include "Polyhedron_types.hh"
+#include "globals_types.hh"
+#include "Variable_defs.hh"
+#include "Variables_Set_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_System_defs.hh"
+#include "Constraint_System_inlines.hh"
+#include "Generator_System_defs.hh"
+#include "Generator_System_inlines.hh"
+#include "Congruence_System_defs.hh"
+#include "Congruence_System_inlines.hh"
+#include "Bit_Matrix_defs.hh"
+#include "Constraint_types.hh"
+#include "Generator_types.hh"
+#include "Congruence_types.hh"
+#include "Poly_Con_Relation_defs.hh"
+#include "Poly_Gen_Relation_defs.hh"
+#include "BHRZ03_Certificate_types.hh"
+#include "H79_Certificate_types.hh"
+#include "Box_types.hh"
+#include "BD_Shape_types.hh"
+#include "Octagonal_Shape_types.hh"
+#include "Interval_types.hh"
+#include "Linear_Form_types.hh"
+#include <vector>
+#include <iosfwd>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*!
+  \relates Parma_Polyhedra_Library::Polyhedron
+  Writes a textual representation of \p ph on \p s:
+  <CODE>false</CODE> is written if \p ph is an empty polyhedron;
+  <CODE>true</CODE> is written if \p ph is a universe polyhedron;
+  a minimized system of constraints defining \p ph is written otherwise,
+  all constraints in one row separated by ", ".
+*/
+std::ostream&
+operator<<(std::ostream& s, const Polyhedron& ph);
+
+} // namespace IO_Operators
+
+//! Swaps \p x with \p y.
+/*! \relates Polyhedron */
+void swap(Polyhedron& x, Polyhedron& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if
+  \p x and \p y are the same polyhedron.
+
+  \relates Polyhedron
+  Note that \p x and \p y may be topology- and/or dimension-incompatible
+  polyhedra: in those cases, the value <CODE>false</CODE> is returned.
+*/
+bool operator==(const Polyhedron& x, const Polyhedron& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if
+  \p x and \p y are different polyhedra.
+
+  \relates Polyhedron
+  Note that \p x and \p y may be topology- and/or dimension-incompatible
+  polyhedra: in those cases, the value <CODE>true</CODE> is returned.
+*/
+bool operator!=(const Polyhedron& x, const Polyhedron& y);
+
+namespace Interfaces {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Returns \c true if and only if
+  <code>ph.topology() == NECESSARILY_CLOSED</code>.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool is_necessarily_closed_for_interfaces(const Polyhedron& ph);
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! The base class for convex polyhedra.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Polyhedron represents a convex polyhedron
+  in the vector space \f$\Rset^n\f$.
+
+  A polyhedron can be specified as either a finite system of constraints
+  or a finite system of generators (see Section \ref representation)
+  and it is always possible to obtain either representation.
+  That is, if we know the system of constraints, we can obtain
+  from this the system of generators that define the same polyhedron
+  and vice versa.
+  These systems can contain redundant members: in this case we say
+  that they are not in the minimal form.
+
+  Two key attributes of any polyhedron are its topological kind
+  (recording whether it is a C_Polyhedron or an NNC_Polyhedron object)
+  and its space dimension (the dimension \f$n \in \Nset\f$ of
+  the enclosing vector space):
+
+  - all polyhedra, the empty ones included, are endowed with
+    a specific topology and space dimension;
+  - most operations working on a polyhedron and another object
+    (i.e., another polyhedron, a constraint or generator,
+    a set of variables, etc.) will throw an exception if
+    the polyhedron and the object are not both topology-compatible
+    and dimension-compatible (see Section \ref representation);
+  - the topology of a polyhedron cannot be changed;
+    rather, there are constructors for each of the two derived classes
+    that will build a new polyhedron with the topology of that class
+    from another polyhedron from either class and any topology;
+  - the only ways in which the space dimension of a polyhedron can
+    be changed are:
+    - <EM>explicit</EM> calls to operators provided for that purpose;
+    - standard copy, assignment and swap operators.
+
+  Note that four different polyhedra can be defined on
+  the zero-dimension space:
+  the empty polyhedron, either closed or NNC,
+  and the universe polyhedron \f$R^0\f$, again either closed or NNC.
+
+  \par
+  In all the examples it is assumed that variables
+  <CODE>x</CODE> and <CODE>y</CODE> are defined (where they are
+  used) as follows:
+  \code
+  Variable x(0);
+  Variable y(1);
+  \endcode
+
+  \par Example 1
+  The following code builds a polyhedron corresponding to
+  a square in \f$\Rset^2\f$, given as a system of constraints:
+  \code
+  Constraint_System cs;
+  cs.insert(x >= 0);
+  cs.insert(x <= 3);
+  cs.insert(y >= 0);
+  cs.insert(y <= 3);
+  C_Polyhedron ph(cs);
+  \endcode
+  The following code builds the same polyhedron as above,
+  but starting from a system of generators specifying
+  the four vertices of the square:
+  \code
+  Generator_System gs;
+  gs.insert(point(0*x + 0*y));
+  gs.insert(point(0*x + 3*y));
+  gs.insert(point(3*x + 0*y));
+  gs.insert(point(3*x + 3*y));
+  C_Polyhedron ph(gs);
+  \endcode
+
+  \par Example 2
+  The following code builds an unbounded polyhedron
+  corresponding to a half-strip in \f$\Rset^2\f$,
+  given as a system of constraints:
+  \code
+  Constraint_System cs;
+  cs.insert(x >= 0);
+  cs.insert(x - y <= 0);
+  cs.insert(x - y + 1 >= 0);
+  C_Polyhedron ph(cs);
+  \endcode
+  The following code builds the same polyhedron as above,
+  but starting from the system of generators specifying
+  the two vertices of the polyhedron and one ray:
+  \code
+  Generator_System gs;
+  gs.insert(point(0*x + 0*y));
+  gs.insert(point(0*x + y));
+  gs.insert(ray(x - y));
+  C_Polyhedron ph(gs);
+  \endcode
+
+  \par Example 3
+  The following code builds the polyhedron corresponding to
+  a half-plane by adding a single constraint
+  to the universe polyhedron in \f$\Rset^2\f$:
+  \code
+  C_Polyhedron ph(2);
+  ph.add_constraint(y >= 0);
+  \endcode
+  The following code builds the same polyhedron as above,
+  but starting from the empty polyhedron in the space \f$\Rset^2\f$
+  and inserting the appropriate generators
+  (a point, a ray and a line).
+  \code
+  C_Polyhedron ph(2, EMPTY);
+  ph.add_generator(point(0*x + 0*y));
+  ph.add_generator(ray(y));
+  ph.add_generator(line(x));
+  \endcode
+  Note that, although the above polyhedron has no vertices, we must add
+  one point, because otherwise the result of the Minkowski's sum
+  would be an empty polyhedron.
+  To avoid subtle errors related to the minimization process,
+  it is required that the first generator inserted in an empty
+  polyhedron is a point (otherwise, an exception is thrown).
+
+  \par Example 4
+  The following code shows the use of the function
+  <CODE>add_space_dimensions_and_embed</CODE>:
+  \code
+  C_Polyhedron ph(1);
+  ph.add_constraint(x == 2);
+  ph.add_space_dimensions_and_embed(1);
+  \endcode
+  We build the universe polyhedron in the 1-dimension space \f$\Rset\f$.
+  Then we add a single equality constraint,
+  thus obtaining the polyhedron corresponding to the singleton set
+  \f$\{ 2 \} \sseq \Rset\f$.
+  After the last line of code, the resulting polyhedron is
+  \f[
+    \bigl\{\,
+      (2, y)^\transpose \in \Rset^2
+    \bigm|
+      y \in \Rset
+    \,\bigr\}.
+  \f]
+
+  \par Example 5
+  The following code shows the use of the function
+  <CODE>add_space_dimensions_and_project</CODE>:
+  \code
+  C_Polyhedron ph(1);
+  ph.add_constraint(x == 2);
+  ph.add_space_dimensions_and_project(1);
+  \endcode
+  The first two lines of code are the same as in Example 4 for
+  <CODE>add_space_dimensions_and_embed</CODE>.
+  After the last line of code, the resulting polyhedron is
+  the singleton set
+  \f$\bigl\{ (2, 0)^\transpose \bigr\} \sseq \Rset^2\f$.
+
+  \par Example 6
+  The following code shows the use of the function
+  <CODE>affine_image</CODE>:
+  \code
+  C_Polyhedron ph(2, EMPTY);
+  ph.add_generator(point(0*x + 0*y));
+  ph.add_generator(point(0*x + 3*y));
+  ph.add_generator(point(3*x + 0*y));
+  ph.add_generator(point(3*x + 3*y));
+  Linear_Expression expr = x + 4;
+  ph.affine_image(x, expr);
+  \endcode
+  In this example the starting polyhedron is a square in
+  \f$\Rset^2\f$, the considered variable is \f$x\f$ and the affine
+  expression is \f$x+4\f$.  The resulting polyhedron is the same
+  square translated to the right.  Moreover, if the affine
+  transformation for the same variable \p x is \f$x+y\f$:
+  \code
+  Linear_Expression expr = x + y;
+  \endcode
+  the resulting polyhedron is a parallelogram with the height equal to
+  the side of the square and the oblique sides parallel to the line
+  \f$x-y\f$.
+  Instead, if we do not use an invertible transformation for the same
+  variable; for example, the affine expression \f$y\f$:
+  \code
+  Linear_Expression expr = y;
+  \endcode
+  the resulting polyhedron is a diagonal of the square.
+
+  \par Example 7
+  The following code shows the use of the function
+  <CODE>affine_preimage</CODE>:
+  \code
+  C_Polyhedron ph(2);
+  ph.add_constraint(x >= 0);
+  ph.add_constraint(x <= 3);
+  ph.add_constraint(y >= 0);
+  ph.add_constraint(y <= 3);
+  Linear_Expression expr = x + 4;
+  ph.affine_preimage(x, expr);
+  \endcode
+  In this example the starting polyhedron, \p var and the affine
+  expression and the denominator are the same as in Example 6,
+  while the resulting polyhedron is again the same square,
+  but translated to the left.
+  Moreover, if the affine transformation for \p x is \f$x+y\f$
+  \code
+  Linear_Expression expr = x + y;
+  \endcode
+  the resulting polyhedron is a parallelogram with the height equal to
+  the side of the square and the oblique sides parallel to the line
+  \f$x+y\f$.
+  Instead, if we do not use an invertible transformation for the same
+  variable \p x, for example, the affine expression \f$y\f$:
+  \code
+  Linear_Expression expr = y;
+  \endcode
+  the resulting polyhedron is a line that corresponds to the \f$y\f$ axis.
+
+  \par Example 8
+  For this example we use also the variables:
+  \code
+  Variable z(2);
+  Variable w(3);
+  \endcode
+  The following code shows the use of the function
+  <CODE>remove_space_dimensions</CODE>:
+  \code
+  Generator_System gs;
+  gs.insert(point(3*x + y + 0*z + 2*w));
+  C_Polyhedron ph(gs);
+  Variables_Set vars;
+  vars.insert(y);
+  vars.insert(z);
+  ph.remove_space_dimensions(vars);
+  \endcode
+  The starting polyhedron is the singleton set
+  \f$\bigl\{ (3, 1, 0, 2)^\transpose \bigr\} \sseq \Rset^4\f$, while
+  the resulting polyhedron is
+  \f$\bigl\{ (3, 2)^\transpose \bigr\} \sseq \Rset^2\f$.
+  Be careful when removing space dimensions <EM>incrementally</EM>:
+  since dimensions are automatically renamed after each application
+  of the <CODE>remove_space_dimensions</CODE> operator, unexpected
+  results can be obtained.
+  For instance, by using the following code we would obtain
+  a different result:
+  \code
+  set<Variable> vars1;
+  vars1.insert(y);
+  ph.remove_space_dimensions(vars1);
+  set<Variable> vars2;
+  vars2.insert(z);
+  ph.remove_space_dimensions(vars2);
+  \endcode
+  In this case, the result is the polyhedron
+  \f$\bigl\{(3, 0)^\transpose \bigr\} \sseq \Rset^2\f$:
+  when removing the set of dimensions \p vars2
+  we are actually removing variable \f$w\f$ of the original polyhedron.
+  For the same reason, the operator \p remove_space_dimensions
+  is not idempotent: removing twice the same non-empty set of dimensions
+  is never the same as removing them just once.
+*/
+
+class Parma_Polyhedra_Library::Polyhedron {
+public:
+  //! The numeric type of coefficients.
+  typedef Coefficient coefficient_type;
+
+  //! Returns the maximum space dimension all kinds of Polyhedron can handle.
+  static dimension_type max_space_dimension();
+
+  /*! \brief
+    Returns \c true indicating that this domain has methods that
+    can recycle constraints.
+  */
+  static bool can_recycle_constraint_systems();
+
+  //! Initializes the class.
+  static void initialize();
+
+  //! Finalizes the class.
+  static void finalize();
+
+  /*! \brief
+    Returns \c false indicating that this domain cannot recycle congruences.
+  */
+  static bool can_recycle_congruence_systems();
+
+protected:
+  //! Builds a polyhedron having the specified properties.
+  /*!
+    \param topol
+    The topology of the polyhedron;
+
+    \param num_dimensions
+    The number of dimensions of the vector space enclosing the polyhedron;
+
+    \param kind
+    Specifies whether the universe or the empty polyhedron has to be built.
+  */
+  Polyhedron(Topology topol,
+             dimension_type num_dimensions,
+             Degenerate_Element kind);
+
+  //! Ordinary copy constructor.
+  /*!
+    The complexity argument is ignored.
+  */
+  Polyhedron(const Polyhedron& y,
+             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  //! Builds a polyhedron from a system of constraints.
+  /*!
+    The polyhedron inherits the space dimension of the constraint system.
+
+    \param topol
+    The topology of the polyhedron;
+
+    \param cs
+    The system of constraints defining the polyhedron.
+
+    \exception std::invalid_argument
+    Thrown if the topology of \p cs is incompatible with \p topol.
+  */
+  Polyhedron(Topology topol, const Constraint_System& cs);
+
+  //! Builds a polyhedron recycling a system of constraints.
+  /*!
+    The polyhedron inherits the space dimension of the constraint system.
+
+    \param topol
+    The topology of the polyhedron;
+
+    \param cs
+    The system of constraints defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the topology of \p cs is incompatible with \p topol.
+  */
+  Polyhedron(Topology topol, Constraint_System& cs, Recycle_Input dummy);
+
+  //! Builds a polyhedron from a system of generators.
+  /*!
+    The polyhedron inherits the space dimension of the generator system.
+
+    \param topol
+    The topology of the polyhedron;
+
+    \param gs
+    The system of generators defining the polyhedron.
+
+    \exception std::invalid_argument
+    Thrown if the topology of \p gs is incompatible with \p topol,
+    or if the system of generators is not empty but has no points.
+  */
+  Polyhedron(Topology topol, const Generator_System& gs);
+
+  //! Builds a polyhedron recycling a system of generators.
+  /*!
+    The polyhedron inherits the space dimension of the generator system.
+
+    \param topol
+    The topology of the polyhedron;
+
+    \param gs
+    The system of generators defining the polyhedron.  It is not
+    declared <CODE>const</CODE> because its data-structures may be
+    recycled to build the polyhedron.
+
+    \param dummy
+    A dummy tag to syntactically differentiate this one
+    from the other constructors.
+
+    \exception std::invalid_argument
+    Thrown if the topology of \p gs is incompatible with \p topol,
+    or if the system of generators is not empty but has no points.
+  */
+  Polyhedron(Topology topol, Generator_System& gs, Recycle_Input dummy);
+
+  //! Builds a polyhedron from a box.
+  /*!
+    This will use an algorithm whose complexity is polynomial and build
+    the smallest polyhedron with topology \p topol containing \p box.
+
+    \param topol
+    The topology of the polyhedron;
+
+    \param box
+    The box representing the polyhedron to be built;
+
+    \param complexity
+    This argument is ignored.
+  */
+  template <typename Interval>
+  Polyhedron(Topology topol, const Box<Interval>& box,
+             Complexity_Class complexity = ANY_COMPLEXITY);
+
+  /*! \brief
+    The assignment operator.
+    (\p *this and \p y can be dimension-incompatible.)
+  */
+  Polyhedron& operator=(const Polyhedron& y);
+
+public:
+  //! \name Member Functions that Do Not Modify the Polyhedron
+  //@{
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  /*! \brief
+    Returns \f$0\f$, if \p *this is empty; otherwise, returns the
+    \ref Affine_Independence_and_Affine_Dimension "affine dimension"
+    of \p *this.
+  */
+  dimension_type affine_dimension() const;
+
+  //! Returns the system of constraints.
+  const Constraint_System& constraints() const;
+
+  //! Returns the system of constraints, with no redundant constraint.
+  const Constraint_System& minimized_constraints() const;
+
+  //! Returns the system of generators.
+  const Generator_System& generators() const;
+
+  //! Returns the system of generators, with no redundant generator.
+  const Generator_System& minimized_generators() const;
+
+  //! Returns a system of (equality) congruences satisfied by \p *this.
+  Congruence_System congruences() const;
+
+  /*! \brief
+    Returns a system of (equality) congruences satisfied by \p *this,
+    with no redundant congruences and having the same affine dimension
+    as \p *this.
+  */
+  Congruence_System minimized_congruences() const;
+
+  /*! \brief
+    Returns the relations holding between the polyhedron \p *this
+    and the constraint \p c.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Constraint& c) const;
+
+  /*! \brief
+    Returns the relations holding between the polyhedron \p *this
+    and the generator \p g.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are dimension-incompatible.
+  */
+  Poly_Gen_Relation relation_with(const Generator& g) const;
+
+  /*! \brief
+    Returns the relations holding between the polyhedron \p *this
+    and the congruence \p c.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p c are dimension-incompatible.
+  */
+  Poly_Con_Relation relation_with(const Congruence& cg) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is
+    an empty polyhedron.
+  */
+  bool is_empty() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a universe polyhedron.
+  */
+  bool is_universe() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a topologically closed subset of the vector space.
+  */
+  bool is_topologically_closed() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this and \p y are disjoint.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool is_disjoint_from(const Polyhedron& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is discrete.
+  bool is_discrete() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    is a bounded polyhedron.
+  */
+  bool is_bounded() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this
+    contains at least one integer point.
+  */
+  bool contains_integer_point() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p var is constrained in
+    \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  bool constrains(Variable var) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from above in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_above(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p expr is
+    bounded from below in \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds_from_below(const Linear_Expression& expr) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value is computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d
+    and \p maximum are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from above in \p *this, in which case
+    the supremum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be maximized subject to \p *this;
+
+    \param sup_n
+    The numerator of the supremum value;
+
+    \param sup_d
+    The denominator of the supremum value;
+
+    \param maximum
+    <CODE>true</CODE> if and only if the supremum is also the maximum value;
+
+    \param g
+    When maximization succeeds, will be assigned the point or
+    closure point where \p expr reaches its supremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from above,
+    <CODE>false</CODE> is returned and \p sup_n, \p sup_d, \p maximum
+    and \p g are left untouched.
+  */
+  bool maximize(const Linear_Expression& expr,
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value is computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d
+    and \p minimum are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is not empty
+    and \p expr is bounded from below in \p *this, in which case
+    the infimum value and a point where \p expr reaches it are computed.
+
+    \param expr
+    The linear expression to be minimized subject to \p *this;
+
+    \param inf_n
+    The numerator of the infimum value;
+
+    \param inf_d
+    The denominator of the infimum value;
+
+    \param minimum
+    <CODE>true</CODE> if and only if the infimum is also the minimum value;
+
+    \param g
+    When minimization succeeds, will be assigned a point or
+    closure point where \p expr reaches its infimum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded from below,
+    <CODE>false</CODE> is returned and \p inf_n, \p inf_d, \p minimum
+    and \p g are left untouched.
+  */
+  bool minimize(const Linear_Expression& expr,
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if there exist a
+    unique value \p val such that \p *this
+    saturates the equality <CODE>expr = val</CODE>.
+
+    \param expr
+    The linear expression for which the frequency is needed;
+
+    \param freq_n
+    If <CODE>true</CODE> is returned, the value is set to \f$0\f$;
+    Present for interface compatibility with class Grid, where
+    the \ref Grid_Frequency "frequency" can have a non-zero value;
+
+    \param freq_d
+    If <CODE>true</CODE> is returned, the value is set to \f$1\f$;
+
+    \param val_n
+    The numerator of \p val;
+
+    \param val_d
+    The denominator of \p val;
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If <CODE>false</CODE> is returned, then \p freq_n, \p freq_d,
+    \p val_n and \p val_d are left untouched.
+  */
+  bool frequency(const Linear_Expression& expr,
+                 Coefficient& freq_n, Coefficient& freq_d,
+                 Coefficient& val_n, Coefficient& val_d) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool contains(const Polyhedron& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this strictly contains \p y.
+  /*!
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool strictly_contains(const Polyhedron& y) const;
+
+  //! Checks if all the invariants are satisfied.
+  /*!
+    \return
+    <CODE>true</CODE> if and only if \p *this satisfies all the
+    invariants and either \p check_not_empty is <CODE>false</CODE> or
+    \p *this is not empty.
+
+    \param check_not_empty
+    <CODE>true</CODE> if and only if, in addition to checking the
+    invariants, \p *this must be checked to be not empty.
+
+    The check is performed so as to intrude as little as possible.  If
+    the library has been compiled with run-time assertions enabled,
+    error messages are written on <CODE>std::cerr</CODE> in case
+    invariants are violated. This is useful for the purpose of
+    debugging the library.
+  */
+  bool OK(bool check_not_empty = false) const;
+
+  //@} // Member Functions that Do Not Modify the Polyhedron
+
+  //! \name Space Dimension Preserving Member Functions that May Modify the Polyhedron
+  //@{
+
+  /*! \brief
+    Adds a copy of constraint \p c to the system of constraints
+    of \p *this (without minimizing the result).
+
+    \param c
+    The constraint that will be added to the system of
+    constraints of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are topology-incompatible
+    or dimension-incompatible.
+  */
+  void add_constraint(const Constraint& c);
+
+  /*! \brief
+    Adds a copy of generator \p g to the system of generators
+    of \p *this (without minimizing the result).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and generator \p g are topology-incompatible or
+    dimension-incompatible, or if \p *this is an empty polyhedron and
+    \p g is not a point.
+  */
+  void add_generator(const Generator& g);
+
+  /*! \brief
+    Adds a copy of congruence \p cg to \p *this,
+    if \p cg can be exactly represented by a polyhedron.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible,
+    of if \p cg is a proper congruence which is neither a tautology,
+    nor a contradiction.
+  */
+  void add_congruence(const Congruence& cg);
+
+  /*! \brief
+    Adds a copy of the constraints in \p cs to the system
+    of constraints of \p *this (without minimizing the result).
+
+    \param cs
+    Contains the constraints that will be added to the system of
+    constraints of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void add_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Adds the constraints in \p cs to the system of constraints
+    of \p *this (without minimizing the result).
+
+    \param cs
+    The constraint system to be added to \p *this.  The constraints in
+    \p cs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are topology-incompatible or
+    dimension-incompatible.
+
+    \warning
+    The only assumption that can be made on \p cs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_constraints(Constraint_System& cs);
+
+  /*! \brief
+    Adds a copy of the generators in \p gs to the system
+    of generators of \p *this (without minimizing the result).
+
+    \param gs
+    Contains the generators that will be added to the system of
+    generators of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p gs are topology-incompatible or
+    dimension-incompatible, or if \p *this is empty and the system of
+    generators \p gs is not empty, but has no points.
+  */
+  void add_generators(const Generator_System& gs);
+
+  /*! \brief
+    Adds the generators in \p gs to the system of generators
+    of \p *this (without minimizing the result).
+
+    \param gs
+    The generator system to be added to \p *this.  The generators in
+    \p gs may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p gs are topology-incompatible or
+    dimension-incompatible, or if \p *this is empty and the system of
+    generators \p gs is not empty, but has no points.
+
+    \warning
+    The only assumption that can be made on \p gs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_generators(Generator_System& gs);
+
+  /*! \brief
+    Adds a copy of the congruences in \p cgs to \p *this,
+    if all the congruences can be exactly represented by a polyhedron.
+
+    \param cgs
+    The congruences to be added.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    of if there exists in \p cgs a proper congruence which is
+    neither a tautology, nor a contradiction.
+  */
+  void add_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Adds the congruences in \p cgs to \p *this,
+    if all the congruences can be exactly represented by a polyhedron.
+
+    \param cgs
+    The congruences to be added. Its elements may be recycled.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible,
+    of if there exists in \p cgs a proper congruence which is
+    neither a tautology, nor a contradiction
+
+    \warning
+    The only assumption that can be made on \p cgs upon successful or
+    exceptional return is that it can be safely destroyed.
+  */
+  void add_recycled_congruences(Congruence_System& cgs);
+
+  /*! \brief
+    Uses a copy of constraint \p c to refine \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and constraint \p c are dimension-incompatible.
+  */
+  void refine_with_constraint(const Constraint& c);
+
+  /*! \brief
+    Uses a copy of congruence \p cg to refine \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and congruence \p cg are dimension-incompatible.
+  */
+  void refine_with_congruence(const Congruence& cg);
+
+  /*! \brief
+    Uses a copy of the constraints in \p cs to refine \p *this.
+
+    \param cs
+    Contains the constraints used to refine the system of
+    constraints of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cs are dimension-incompatible.
+  */
+  void refine_with_constraints(const Constraint_System& cs);
+
+  /*! \brief
+    Uses a copy of the congruences in \p cgs to refine \p *this.
+
+    \param cgs
+    Contains the congruences used to refine the system of
+    constraints of \p *this.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p cgs are dimension-incompatible.
+  */
+  void refine_with_congruences(const Congruence_System& cgs);
+
+  /*! \brief
+    Refines \p *this with the constraint expressed by \p left \f$<\f$
+    \p right if \p is_strict is set, with the constraint \p left \f$\leq\f$
+    \p right otherwise.
+
+    \param left
+    The linear form on intervals with floating point boundaries that
+    is on the left of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param right
+    The linear form on intervals with floating point boundaries that
+    is on the right of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param is_strict
+    True if the comparison is strict.
+
+    \exception std::invalid_argument
+    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
+
+    This function is used in abstract interpretation to model a filter
+    that is generated by a comparison of two expressions that are correctly
+    approximated by \p left and \p right respectively.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  void refine_with_linear_form_inequality(
+  const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
+  const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
+  bool is_strict = false);
+
+  /*! \brief
+    Refines \p *this with the constraint expressed by \p left \f$\relsym\f$
+    \p right, where \f$\relsym\f$ is the relation symbol specified by
+    \p relsym..
+
+    \param left
+    The linear form on intervals with floating point boundaries that
+    is on the left of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param right
+    The linear form on intervals with floating point boundaries that
+    is on the right of the comparison operator. All of its coefficients
+    MUST be bounded.
+
+    \param relsym
+    The relation symbol.
+
+    \exception std::invalid_argument
+    Thrown if \p left (or \p right) is dimension-incompatible with \p *this.
+
+    \exception std::runtime_error
+    Thrown if \p relsym is not a valid relation symbol.
+
+    This function is used in abstract interpretation to model a filter
+    that is generated by a comparison of two expressions that are correctly
+    approximated by \p left and \p right respectively.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  void generalized_refine_with_linear_form_inequality(
+  const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
+  const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
+  Relation_Symbol relsym);
+
+  //! Refines \p store with the constraints defining \p *this.
+  /*!
+    \param store
+    The interval floating point abstract store to refine.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  void refine_fp_interval_abstract_store(
+       Box< Interval<FP_Format, Interval_Info> >& store)
+       const;
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to space dimension \p var, assigning the result to \p *this.
+
+    \param var
+    The space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p var is not a space dimension of \p *this.
+  */
+  void unconstrain(Variable var);
+
+  /*! \brief
+    Computes the \ref Cylindrification "cylindrification" of \p *this with
+    respect to the set of space dimensions \p vars,
+    assigning the result to \p *this.
+
+    \param vars
+    The set of space dimension that will be unconstrained.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void unconstrain(const Variables_Set& vars);
+
+  /*! \brief
+    Assigns to \p *this the intersection of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  void intersection_assign(const Polyhedron& y);
+
+  /*! \brief
+    Assigns to \p *this the poly-hull of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  void poly_hull_assign(const Polyhedron& y);
+
+  //! Same as poly_hull_assign(y).
+  void upper_bound_assign(const Polyhedron& y);
+
+  /*! \brief
+    Assigns to \p *this
+    the \ref Convex_Polyhedral_Difference "poly-difference"
+    of \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  void poly_difference_assign(const Polyhedron& y);
+
+  //! Same as poly_difference_assign(y).
+  void difference_assign(const Polyhedron& y);
+
+  /*! \brief
+    Assigns to \p *this a \ref Meet_Preserving_Simplification
+    "meet-preserving simplification" of \p *this with respect to \p y.
+    If \c false is returned, then the intersection is empty.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  bool simplify_using_context_assign(const Polyhedron& y);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine image"
+    of \p *this under the function mapping variable \p var to the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is assigned;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of
+    \p *this.
+
+    \if Include_Implementation_Details
+
+    When considering the generators of a polyhedron, the
+    affine transformation
+    \f[
+      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{\mathrm{denominator}}
+    \f]
+    is assigned to \p var where \p expr is
+    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
+    (\f$b\f$ is the inhomogeneous term).
+
+    If constraints are up-to-date, it uses the specialized function
+    affine_preimage() (for the system of constraints)
+    and inverse transformation to reach the same result.
+    To obtain the inverse transformation we use the following observation.
+
+    Observation:
+    -# The affine transformation is invertible if the coefficient
+       of \p var in this transformation (i.e., \f$a_\mathrm{var}\f$)
+       is different from zero.
+    -# If the transformation is invertible, then we can write
+       \f[
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
+           = a_\mathrm{var} x_\mathrm{var}
+             + \sum_{i \neq var} a_i x_i + b,
+       \f]
+       so that the inverse transformation is
+       \f[
+         a_\mathrm{var} x_\mathrm{var}
+           = \mathrm{denominator} * {x'}_\mathrm{var}
+             - \sum_{i \neq j} a_i x_i - b.
+       \f]
+
+    Then, if the transformation is invertible, all the entities that
+    were up-to-date remain up-to-date. Otherwise only generators remain
+    up-to-date.
+
+    In other words, if \f$R\f$ is a \f$m_1 \times n\f$ matrix representing
+    the rays of the polyhedron, \f$V\f$ is a \f$m_2 \times n\f$
+    matrix representing the points of the polyhedron and
+    \f[
+      P = \bigl\{\,
+            \vect{x} = (x_0, \ldots, x_{n-1})^\mathrm{T}
+          \bigm|
+            \vect{x} = \vect{\lambda} R + \vect{\mu} V,
+            \vect{\lambda} \in \Rset^{m_1}_+,
+            \vect{\mu} \in \Rset^{m_2}_+,
+            \sum_{i = 0}^{m_2 - 1} \mu_i = 1
+          \,\bigr\}
+    \f]
+    and \f$T\f$ is the affine transformation to apply to \f$P\f$, then
+    the resulting polyhedron is
+    \f[
+      P' = \bigl\{\,
+             (x_0, \ldots, T(x_0, \ldots, x_{n-1}),
+                     \ldots, x_{n-1})^\mathrm{T}
+           \bigm|
+             (x_0, \ldots, x_{n-1})^\mathrm{T} \in P
+           \,\bigr\}.
+    \f]
+
+    Affine transformations are, for example:
+    - translations
+    - rotations
+    - symmetries.
+    \endif
+  */
+  void affine_image(Variable var,
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
+
+  // FIXME: To be completed.
+  /*!
+    Assigns to \p *this the
+    \ref affine_form_relation "affine form image"
+    of \p *this under the function mapping variable \p var into the
+    affine expression(s) specified by \p lf.
+
+    \param var
+    The variable to which the affine expression is assigned.
+
+    \param lf
+    The linear form on intervals with floating point boundaries that
+    defines the affine expression(s). ALL of its coefficients MUST be bounded.
+
+    \exception std::invalid_argument
+    Thrown if \p lf and \p *this are dimension-incompatible or if \p var is
+    not a space dimension of \p *this.
+
+    This function is used in abstract interpretation to model an assignment
+    of a value that is correctly overapproximated by \p lf to the
+    floating point variable represented by \p var.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  void affine_form_image(Variable var,
+  const Linear_Form<Interval <FP_Format, Interval_Info> >& lf);
+
+  /*! \brief
+    Assigns to \p *this the
+    \ref Single_Update_Affine_Functions "affine preimage"
+    of \p *this under the function mapping variable \p var to the
+    affine expression specified by \p expr and \p denominator.
+
+    \param var
+    The variable to which the affine expression is substituted;
+
+    \param expr
+    The numerator of the affine expression;
+
+    \param denominator
+    The denominator of the affine expression (optional argument with
+    default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this.
+
+    \if Include_Implementation_Details
+
+    When considering constraints of a polyhedron, the affine transformation
+    \f[
+      \frac{\sum_{i=0}^{n-1} a_i x_i + b}{denominator},
+    \f]
+    is assigned to \p var where \p expr is
+    \f$\sum_{i=0}^{n-1} a_i x_i + b\f$
+    (\f$b\f$ is the inhomogeneous term).
+
+    If generators are up-to-date, then the specialized function
+    affine_image() is used (for the system of generators)
+    and inverse transformation to reach the same result.
+    To obtain the inverse transformation, we use the following observation.
+
+    Observation:
+    -# The affine transformation is invertible if the coefficient
+       of \p var in this transformation (i.e. \f$a_\mathrm{var}\f$)
+       is different from zero.
+    -# If the transformation is invertible, then we can write
+       \f[
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
+           = a_\mathrm{var} x_\mathrm{var}
+               + \sum_{i \neq \mathrm{var}} a_i x_i + b,
+       \f],
+       the inverse transformation is
+       \f[
+         a_\mathrm{var} x_\mathrm{var}
+           = \mathrm{denominator} * {x'}_\mathrm{var}
+               - \sum_{i \neq j} a_i x_i - b.
+       \f].
+
+    Then, if the transformation is invertible, all the entities that
+    were up-to-date remain up-to-date. Otherwise only constraints remain
+    up-to-date.
+
+    In other words, if \f$A\f$ is a \f$m \times n\f$ matrix representing
+    the constraints of the polyhedron, \f$T\f$ is the affine transformation
+    to apply to \f$P\f$ and
+    \f[
+      P = \bigl\{\,
+            \vect{x} = (x_0, \ldots, x_{n-1})^\mathrm{T}
+          \bigm|
+            A\vect{x} \geq \vect{0}
+          \,\bigr\}.
+    \f]
+    The resulting polyhedron is
+    \f[
+      P' = \bigl\{\,
+             \vect{x} = (x_0, \ldots, x_{n-1}))^\mathrm{T}
+           \bigm|
+             A'\vect{x} \geq \vect{0}
+           \,\bigr\},
+    \f]
+    where \f$A'\f$ is defined as follows:
+    \f[
+      {a'}_{ij}
+        = \begin{cases}
+            a_{ij} * \mathrm{denominator} + a_{i\mathrm{var}}*\mathrm{expr}[j]
+              \quad \mathrm{for } j \neq \mathrm{var}; \\
+            \mathrm{expr}[\mathrm{var}] * a_{i\mathrm{var}},
+              \quad \text{for } j = \mathrm{var}.
+          \end{cases}
+    \f]
+    \endif
+  */
+  void affine_preimage(Variable var,
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_image(Variable var,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{var}' \relsym \frac{\mathrm{expr}}{\mathrm{denominator}}\f$,
+    where \f$\mathord{\relsym}\f$ is the relation symbol encoded
+    by \p relsym.
+
+    \param var
+    The left hand side variable of the generalized affine relation;
+
+    \param relsym
+    The relation symbol;
+
+    \param expr
+    The numerator of the right hand side affine expression;
+
+    \param denominator
+    The denominator of the right hand side affine expression (optional
+    argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p expr and \p *this are
+    dimension-incompatible or if \p var is not a space dimension of \p *this
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void
+  generalized_affine_preimage(Variable var,
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_image(const Linear_Expression& lhs,
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
+
+  /*! \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Generalized_Affine_Relations "generalized affine relation"
+    \f$\mathrm{lhs}' \relsym \mathrm{rhs}\f$, where
+    \f$\mathord{\relsym}\f$ is the relation symbol encoded by \p relsym.
+
+    \param lhs
+    The left hand side affine expression;
+
+    \param relsym
+    The relation symbol;
+
+    \param rhs
+    The right hand side affine expression.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs
+    or if \p *this is a C_Polyhedron and \p relsym is a strict
+    relation symbol.
+  */
+  void generalized_affine_preimage(const Linear_Expression& lhs,
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
+
+  /*!
+    \brief
+    Assigns to \p *this the image of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_image(Variable var,
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
+
+  /*!
+    \brief
+    Assigns to \p *this the preimage of \p *this with respect to the
+    \ref Single_Update_Bounded_Affine_Relations "bounded affine relation"
+    \f$\frac{\mathrm{lb\_expr}}{\mathrm{denominator}}
+         \leq \mathrm{var}'
+           \leq \frac{\mathrm{ub\_expr}}{\mathrm{denominator}}\f$.
+
+    \param var
+    The variable updated by the affine relation;
+
+    \param lb_expr
+    The numerator of the lower bounding affine expression;
+
+    \param ub_expr
+    The numerator of the upper bounding affine expression;
+
+    \param denominator
+    The (common) denominator for the lower and upper bounding
+    affine expressions (optional argument with default value 1).
+
+    \exception std::invalid_argument
+    Thrown if \p denominator is zero or if \p lb_expr (resp., \p ub_expr)
+    and \p *this are dimension-incompatible or if \p var is not a space
+    dimension of \p *this.
+  */
+  void bounded_affine_preimage(Variable var,
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref Time_Elapse_Operator "time-elapse" between \p *this and \p y.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  void time_elapse_assign(const Polyhedron& y);
+
+  /*! \brief
+    \ref Wrapping_Operator "Wraps" the specified dimensions of the
+    vector space.
+
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be wrapped.
+
+    \param w
+    The width of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param r
+    The representation of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param o
+    The overflow behavior of the bounded integer type corresponding to
+    all the dimensions to be wrapped.
+
+    \param cs_p
+    Possibly null pointer to a constraint system whose variables
+    are contained in \p vars.  If <CODE>*cs_p</CODE> depends on
+    variables not in \p vars, the behavior is undefined.
+    When non-null, the pointed-to constraint system is assumed to
+    represent the conditional or looping construct guard with respect
+    to which wrapping is performed.  Since wrapping requires the
+    computation of upper bounds and due to non-distributivity of
+    constraint refinement over upper bounds, passing a constraint
+    system in this way can be more precise than refining the result of
+    the wrapping operation with the constraints in <CODE>*cs_p</CODE>.
+
+    \param complexity_threshold
+    A precision parameter of the \ref Wrapping_Operator "wrapping operator":
+    higher values result in possibly improved precision.
+
+    \param wrap_individually
+    <CODE>true</CODE> if the dimensions should be wrapped individually
+    (something that results in much greater efficiency to the detriment of
+    precision).
+
+    \exception std::invalid_argument
+    Thrown if <CODE>*cs_p</CODE> is dimension-incompatible with
+    \p vars, or if \p *this is dimension-incompatible \p vars or with
+    <CODE>*cs_p</CODE>.
+  */
+  void wrap_assign(const Variables_Set& vars,
+                   Bounded_Integer_Type_Width w,
+                   Bounded_Integer_Type_Representation r,
+                   Bounded_Integer_Type_Overflow o,
+                   const Constraint_System* cs_p = 0,
+                   unsigned complexity_threshold = 16,
+                   bool wrap_individually = true);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p vars.
+
+    \param vars
+    Points with non-integer coordinates for these variables/space-dimensions
+    can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set& vars,
+                                    Complexity_Class complexity
+                                    = ANY_COMPLEXITY);
+
+  //! Assigns to \p *this its topological closure.
+  void topological_closure_assign();
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref BHRZ03_widening "BHRZ03-widening" between \p *this and \p y.
+
+    \param y
+    A polyhedron that <EM>must</EM> be contained in \p *this;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  void BHRZ03_widening_assign(const Polyhedron& y, unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref limited_extrapolation "limited extrapolation"
+    between \p *this and \p y using the \ref BHRZ03_widening
+    "BHRZ03-widening" operator.
+
+    \param y
+    A polyhedron that <EM>must</EM> be contained in \p *this;
+
+    \param cs
+    The system of constraints used to improve the widened polyhedron;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void limited_BHRZ03_extrapolation_assign(const Polyhedron& y,
+                                           const Constraint_System& cs,
+                                           unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref bounded_extrapolation "bounded extrapolation"
+    between \p *this and \p y using the \ref BHRZ03_widening
+    "BHRZ03-widening" operator.
+
+    \param y
+    A polyhedron that <EM>must</EM> be contained in \p *this;
+
+    \param cs
+    The system of constraints used to improve the widened polyhedron;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void bounded_BHRZ03_extrapolation_assign(const Polyhedron& y,
+                                           const Constraint_System& cs,
+                                           unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref H79_widening "H79_widening" between \p *this and \p y.
+
+    \param y
+    A polyhedron that <EM>must</EM> be contained in \p *this;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible or
+    dimension-incompatible.
+  */
+  void H79_widening_assign(const Polyhedron& y, unsigned* tp = 0);
+
+  //! Same as H79_widening_assign(y, tp).
+  void widening_assign(const Polyhedron& y, unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref limited_extrapolation "limited extrapolation"
+    between \p *this and \p y using the \ref H79_widening
+    "H79-widening" operator.
+
+    \param y
+    A polyhedron that <EM>must</EM> be contained in \p *this;
+
+    \param cs
+    The system of constraints used to improve the widened polyhedron;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void limited_H79_extrapolation_assign(const Polyhedron& y,
+                                        const Constraint_System& cs,
+                                        unsigned* tp = 0);
+
+  /*! \brief
+    Assigns to \p *this the result of computing the
+    \ref bounded_extrapolation "bounded extrapolation"
+    between \p *this and \p y using the \ref H79_widening
+    "H79-widening" operator.
+
+    \param y
+    A polyhedron that <EM>must</EM> be contained in \p *this;
+
+    \param cs
+    The system of constraints used to improve the widened polyhedron;
+
+    \param tp
+    An optional pointer to an unsigned variable storing the number of
+    available tokens (to be used when applying the
+    \ref Widening_with_Tokens "widening with tokens" delay technique).
+
+    \exception std::invalid_argument
+    Thrown if \p *this, \p y and \p cs are topology-incompatible or
+    dimension-incompatible.
+  */
+  void bounded_H79_extrapolation_assign(const Polyhedron& y,
+                                        const Constraint_System& cs,
+                                        unsigned* tp = 0);
+
+  //@} // Space Dimension Preserving Member Functions that May Modify [...]
+
+  //! \name Member Functions that May Modify the Dimension of the Vector Space
+  //@{
+
+  /*! \brief
+    Adds \p m new space dimensions and embeds the old polyhedron
+    in the new vector space.
+
+    \param m
+    The number of dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    The new space dimensions will be those having the highest indexes
+    in the new polyhedron, which is characterized by a system
+    of constraints in which the variables running through
+    the new dimensions are not constrained.
+    For instance, when starting from the polyhedron \f$\cP \sseq \Rset^2\f$
+    and adding a third space dimension, the result will be the polyhedron
+    \f[
+      \bigl\{\,
+        (x, y, z)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cP
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_embed(dimension_type m);
+
+  /*! \brief
+    Adds \p m new space dimensions to the polyhedron
+    and does not embed it in the new vector space.
+
+    \param m
+    The number of space dimensions to add.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    The new space dimensions will be those having the highest indexes
+    in the new polyhedron, which is characterized by a system
+    of constraints in which the variables running through
+    the new dimensions are all constrained to be equal to 0.
+    For instance, when starting from the polyhedron \f$\cP \sseq \Rset^2\f$
+    and adding a third space dimension, the result will be the polyhedron
+    \f[
+      \bigl\{\,
+        (x, y, 0)^\transpose \in \Rset^3
+      \bigm|
+        (x, y)^\transpose \in \cP
+      \,\bigr\}.
+    \f]
+  */
+  void add_space_dimensions_and_project(dimension_type m);
+
+  /*! \brief
+    Assigns to \p *this the \ref Concatenating_Polyhedra "concatenation"
+    of \p *this and \p y, taken in this order.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are topology-incompatible.
+
+    \exception std::length_error
+    Thrown if the concatenation would cause the vector space
+    to exceed dimension <CODE>max_space_dimension()</CODE>.
+  */
+  void concatenate_assign(const Polyhedron& y);
+
+  //! Removes all the specified dimensions from the vector space.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be removed.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with one of the
+    Variable objects contained in \p vars.
+  */
+  void remove_space_dimensions(const Variables_Set& vars);
+
+  /*! \brief
+    Removes the higher dimensions of the vector space so that
+    the resulting space will have dimension \p new_dimension.
+
+    \exception std::invalid_argument
+    Thrown if \p new_dimensions is greater than the space dimension of
+    \p *this.
+  */
+  void remove_higher_space_dimensions(dimension_type new_dimension);
+
+  /*! \brief
+    Remaps the dimensions of the vector space according to
+    a \ref Mapping_the_Dimensions_of_the_Vector_Space "partial function".
+
+    \param pfunc
+    The partial function specifying the destiny of each space dimension.
+
+    The template type parameter Partial_Function must provide
+    the following methods.
+    \code
+      bool has_empty_codomain() const
+    \endcode
+    returns <CODE>true</CODE> if and only if the represented partial
+    function has an empty codomain (i.e., it is always undefined).
+    The <CODE>has_empty_codomain()</CODE> method will always be called
+    before the methods below.  However, if
+    <CODE>has_empty_codomain()</CODE> returns <CODE>true</CODE>, none
+    of the functions below will be called.
+    \code
+      dimension_type max_in_codomain() const
+    \endcode
+    returns the maximum value that belongs to the codomain
+    of the partial function.
+    The <CODE>max_in_codomain()</CODE> method is called at most once.
+    \code
+      bool maps(dimension_type i, dimension_type& j) const
+    \endcode
+    Let \f$f\f$ be the represented function and \f$k\f$ be the value
+    of \p i.  If \f$f\f$ is defined in \f$k\f$, then \f$f(k)\f$ is
+    assigned to \p j and <CODE>true</CODE> is returned.
+    If \f$f\f$ is undefined in \f$k\f$, then <CODE>false</CODE> is
+    returned.
+    This method is called at most \f$n\f$ times, where \f$n\f$ is the
+    dimension of the vector space enclosing the polyhedron.
+
+    The result is undefined if \p pfunc does not encode a partial
+    function with the properties described in the
+    \ref Mapping_the_Dimensions_of_the_Vector_Space
+    "specification of the mapping operator".
+  */
+  template <typename Partial_Function>
+  void map_space_dimensions(const Partial_Function& pfunc);
+
+  //! Creates \p m copies of the space dimension corresponding to \p var.
+  /*!
+    \param var
+    The variable corresponding to the space dimension to be replicated;
+
+    \param m
+    The number of replicas to be created.
+
+    \exception std::invalid_argument
+    Thrown if \p var does not correspond to a dimension of the vector space.
+
+    \exception std::length_error
+    Thrown if adding \p m new space dimensions would cause the
+    vector space to exceed dimension <CODE>max_space_dimension()</CODE>.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    and <CODE>var</CODE> has space dimension \f$k \leq n\f$,
+    then the \f$k\f$-th space dimension is
+    \ref expand_space_dimension "expanded" to \p m new space dimensions
+    \f$n\f$, \f$n+1\f$, \f$\dots\f$, \f$n+m-1\f$.
+  */
+  void expand_space_dimension(Variable var, dimension_type m);
+
+  //! Folds the space dimensions in \p vars into \p dest.
+  /*!
+    \param vars
+    The set of Variable objects corresponding to the space dimensions
+    to be folded;
+
+    \param dest
+    The variable corresponding to the space dimension that is the
+    destination of the folding operation.
+
+    \exception std::invalid_argument
+    Thrown if \p *this is dimension-incompatible with \p dest or with
+    one of the Variable objects contained in \p vars.
+    Also thrown if \p dest is contained in \p vars.
+
+    If \p *this has space dimension \f$n\f$, with \f$n > 0\f$,
+    <CODE>dest</CODE> has space dimension \f$k \leq n\f$,
+    \p vars is a set of variables whose maximum space dimension
+    is also less than or equal to \f$n\f$, and \p dest is not a member
+    of \p vars, then the space dimensions corresponding to
+    variables in \p vars are \ref fold_space_dimensions "folded"
+    into the \f$k\f$-th space dimension.
+  */
+  void fold_space_dimensions(const Variables_Set& vars, Variable dest);
+
+  //@} // Member Functions that May Modify the Dimension of the Vector Space
+
+  friend bool operator==(const Polyhedron& x, const Polyhedron& y);
+
+  //! \name Miscellaneous Member Functions
+  //@{
+
+  //! Destructor.
+  ~Polyhedron();
+
+  /*! \brief
+    Swaps \p *this with polyhedron \p y.
+    (\p *this and \p y can be dimension-incompatible.)
+
+    \exception std::invalid_argument
+    Thrown if \p x and \p y are topology-incompatible.
+  */
+  void m_swap(Polyhedron& y);
+
+  PPL_OUTPUT_DECLARATIONS
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a 32-bit hash code for \p *this.
+
+    If \p x and \p y are such that <CODE>x == y</CODE>,
+    then <CODE>x.hash_code() == y.hash_code()</CODE>.
+  */
+  int32_t hash_code() const;
+
+  //@} // Miscellaneous Member Functions
+
+private:
+  static const Representation default_con_sys_repr = DENSE;
+  static const Representation default_gen_sys_repr = DENSE;
+
+  //! The system of constraints.
+  Constraint_System con_sys;
+
+  //! The system of generators.
+  Generator_System gen_sys;
+
+  //! The saturation matrix having constraints on its columns.
+  Bit_Matrix sat_c;
+
+  //! The saturation matrix having generators on its columns.
+  Bit_Matrix sat_g;
+
+#define PPL_IN_Polyhedron_CLASS
+#include "Ph_Status_idefs.hh"
+#undef PPL_IN_Polyhedron_CLASS
+
+  //! The status flags to keep track of the polyhedron's internal state.
+  Status status;
+
+  //! The number of dimensions of the enclosing vector space.
+  dimension_type space_dim;
+
+  //! Returns the topological kind of the polyhedron.
+  Topology topology() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if the polyhedron
+    is necessarily closed.
+  */
+  bool is_necessarily_closed() const;
+
+  friend bool
+  Parma_Polyhedra_Library::Interfaces
+  ::is_necessarily_closed_for_interfaces(const Polyhedron&);
+
+  /*! \brief
+    Uses a copy of constraint \p c to refine the system of constraints
+    of \p *this.
+
+    \param c The constraint to be added. If it is dimension-incompatible
+    with \p *this, the behavior is undefined.
+  */
+  void refine_no_check(const Constraint& c);
+
+  //! \name Private Verifiers: Verify if Individual Flags are Set
+  //@{
+
+  //! Returns <CODE>true</CODE> if the polyhedron is known to be empty.
+  /*!
+    The return value <CODE>false</CODE> does not necessarily
+    implies that \p *this is non-empty.
+  */
+  bool marked_empty() const;
+
+  //! Returns <CODE>true</CODE> if the system of constraints is up-to-date.
+  bool constraints_are_up_to_date() const;
+
+  //! Returns <CODE>true</CODE> if the system of generators is up-to-date.
+  bool generators_are_up_to_date() const;
+
+  //! Returns <CODE>true</CODE> if the system of constraints is minimized.
+  /*!
+    Note that only \em weak minimization is entailed, so that
+    an NNC polyhedron may still have \f$\epsilon\f$-redundant constraints.
+  */
+  bool constraints_are_minimized() const;
+
+  //! Returns <CODE>true</CODE> if the system of generators is minimized.
+  /*!
+    Note that only \em weak minimization is entailed, so that
+    an NNC polyhedron may still have \f$\epsilon\f$-redundant generators.
+  */
+  bool generators_are_minimized() const;
+
+  //! Returns <CODE>true</CODE> if there are pending constraints.
+  bool has_pending_constraints() const;
+
+  //! Returns <CODE>true</CODE> if there are pending generators.
+  bool has_pending_generators() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if there are
+    either pending constraints or pending generators.
+  */
+  bool has_something_pending() const;
+
+  //! Returns <CODE>true</CODE> if the polyhedron can have something pending.
+  bool can_have_something_pending() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the saturation matrix \p sat_c
+    is up-to-date.
+  */
+  bool sat_c_is_up_to_date() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the saturation matrix \p sat_g
+    is up-to-date.
+  */
+  bool sat_g_is_up_to_date() const;
+
+  //@} // Private Verifiers: Verify if Individual Flags are Set
+
+  //! \name State Flag Setters: Set Only the Specified Flags
+  //@{
+
+  /*! \brief
+    Sets \p status to express that the polyhedron is the universe
+    0-dimension vector space, clearing all corresponding matrices.
+  */
+  void set_zero_dim_univ();
+
+  /*! \brief
+    Sets \p status to express that the polyhedron is empty,
+    clearing all corresponding matrices.
+  */
+  void set_empty();
+
+  //! Sets \p status to express that constraints are up-to-date.
+  void set_constraints_up_to_date();
+
+  //! Sets \p status to express that generators are up-to-date.
+  void set_generators_up_to_date();
+
+  //! Sets \p status to express that constraints are minimized.
+  void set_constraints_minimized();
+
+  //! Sets \p status to express that generators are minimized.
+  void set_generators_minimized();
+
+  //! Sets \p status to express that constraints are pending.
+  void set_constraints_pending();
+
+  //! Sets \p status to express that generators are pending.
+  void set_generators_pending();
+
+  //! Sets \p status to express that \p sat_c is up-to-date.
+  void set_sat_c_up_to_date();
+
+  //! Sets \p status to express that \p sat_g is up-to-date.
+  void set_sat_g_up_to_date();
+
+  //@} // State Flag Setters: Set Only the Specified Flags
+
+  //! \name State Flag Cleaners: Clear Only the Specified Flag
+  //@{
+
+  //! Clears the \p status flag indicating that the polyhedron is empty.
+  void clear_empty();
+
+  //! Sets \p status to express that constraints are no longer up-to-date.
+  /*!
+    This also implies that they are neither minimized
+    and both saturation matrices are no longer meaningful.
+  */
+  void clear_constraints_up_to_date();
+
+  //! Sets \p status to express that generators are no longer up-to-date.
+  /*!
+    This also implies that they are neither minimized
+    and both saturation matrices are no longer meaningful.
+  */
+  void clear_generators_up_to_date();
+
+  //! Sets \p status to express that constraints are no longer minimized.
+  void clear_constraints_minimized();
+
+  //! Sets \p status to express that generators are no longer minimized.
+  void clear_generators_minimized();
+
+  //! Sets \p status to express that there are no longer pending constraints.
+  void clear_pending_constraints();
+
+  //! Sets \p status to express that there are no longer pending generators.
+  void clear_pending_generators();
+
+  //! Sets \p status to express that \p sat_c is no longer up-to-date.
+  void clear_sat_c_up_to_date();
+
+  //! Sets \p status to express that \p sat_g is no longer up-to-date.
+  void clear_sat_g_up_to_date();
+
+  //@} // State Flag Cleaners: Clear Only the Specified Flag
+
+  //! \name The Handling of Pending Rows
+  //@{
+
+  /*! \brief
+    Processes the pending rows of either description of the polyhedron
+    and obtains a minimized polyhedron.
+
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+
+    It is assumed that the polyhedron does have some constraints or
+    generators pending.
+  */
+  bool process_pending() const;
+
+  //! Processes the pending constraints and obtains a minimized polyhedron.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+
+    It is assumed that the polyhedron does have some pending constraints.
+  */
+  bool process_pending_constraints() const;
+
+  //! Processes the pending generators and obtains a minimized polyhedron.
+  /*!
+    It is assumed that the polyhedron does have some pending generators.
+  */
+  void process_pending_generators() const;
+
+  /*! \brief
+    Lazily integrates the pending descriptions of the polyhedron
+    to obtain a constraint system without pending rows.
+
+    It is assumed that the polyhedron does have some constraints or
+    generators pending.
+  */
+  void remove_pending_to_obtain_constraints() const;
+
+  /*! \brief
+    Lazily integrates the pending descriptions of the polyhedron
+    to obtain a generator system without pending rows.
+
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+
+    It is assumed that the polyhedron does have some constraints or
+    generators pending.
+  */
+  bool remove_pending_to_obtain_generators() const;
+
+  //@} // The Handling of Pending Rows
+
+  //! \name Updating and Sorting Matrices
+  //@{
+
+  //! Updates constraints starting from generators and minimizes them.
+  /*!
+    The resulting system of constraints is only partially sorted:
+    the equalities are in the upper part of the matrix,
+    while the inequalities in the lower part.
+  */
+  void update_constraints() const;
+
+  //! Updates generators starting from constraints and minimizes them.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+
+    The resulting system of generators is only partially sorted:
+    the lines are in the upper part of the matrix,
+    while rays and points are in the lower part.
+    It is illegal to call this method when the Status field
+    already declares the polyhedron to be empty.
+  */
+  bool update_generators() const;
+
+  //! Updates \p sat_c using the updated constraints and generators.
+  /*!
+    It is assumed that constraints and generators are up-to-date
+    and minimized and that the Status field does not already flag
+    \p sat_c to be up-to-date.
+    The values of the saturation matrix are computed as follows:
+    \f[
+      \begin{cases}
+        sat\_c[i][j] = 0,
+          \quad \text{if } G[i] \cdot C^\mathrm{T}[j] = 0; \\
+        sat\_c[i][j] = 1,
+          \quad \text{if } G[i] \cdot C^\mathrm{T}[j] > 0.
+      \end{cases}
+    \f]
+  */
+  void update_sat_c() const;
+
+  //! Updates \p sat_g using the updated constraints and generators.
+  /*!
+    It is assumed that constraints and generators are up-to-date
+    and minimized and that the Status field does not already flag
+    \p sat_g to be up-to-date.
+    The values of the saturation matrix are computed as follows:
+    \f[
+      \begin{cases}
+        sat\_g[i][j] = 0,
+          \quad \text{if } C[i] \cdot G^\mathrm{T}[j] = 0; \\
+        sat\_g[i][j] = 1,
+          \quad \text{if } C[i] \cdot G^\mathrm{T}[j] > 0.
+      \end{cases}
+    \f]
+  */
+  void update_sat_g() const;
+
+  //! Sorts the matrix of constraints keeping status consistency.
+  /*!
+    It is assumed that constraints are up-to-date.
+    If at least one of the saturation matrices is up-to-date,
+    then \p sat_g is kept consistent with the sorted matrix
+    of constraints.
+    The method is declared \p const because reordering
+    the constraints does not modify the polyhedron
+    from a \e logical point of view.
+  */
+  void obtain_sorted_constraints() const;
+
+  //! Sorts the matrix of generators keeping status consistency.
+  /*!
+    It is assumed that generators are up-to-date.
+    If at least one of the saturation matrices is up-to-date,
+    then \p sat_c is kept consistent with the sorted matrix
+    of generators.
+    The method is declared \p const because reordering
+    the generators does not modify the polyhedron
+    from a \e logical point of view.
+  */
+  void obtain_sorted_generators() const;
+
+  //! Sorts the matrix of constraints and updates \p sat_c.
+  /*!
+    It is assumed that both constraints and generators
+    are up-to-date and minimized.
+    The method is declared \p const because reordering
+    the constraints does not modify the polyhedron
+    from a \e logical point of view.
+  */
+  void obtain_sorted_constraints_with_sat_c() const;
+
+  //! Sorts the matrix of generators and updates \p sat_g.
+  /*!
+    It is assumed that both constraints and generators
+    are up-to-date and minimized.
+    The method is declared \p const because reordering
+    the generators does not modify the polyhedron
+    from a \e logical point of view.
+  */
+  void obtain_sorted_generators_with_sat_g() const;
+
+  //@} // Updating and Sorting Matrices
+
+  //! \name Weak and Strong Minimization of Descriptions
+  //@{
+
+  //! Applies (weak) minimization to both the constraints and generators.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+
+    Minimization is not attempted if the Status field already declares
+    both systems to be minimized.
+  */
+  bool minimize() const;
+
+  //! Applies strong minimization to the constraints of an NNC polyhedron.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+  */
+  bool strongly_minimize_constraints() const;
+
+  //! Applies strong minimization to the generators of an NNC polyhedron.
+  /*!
+    \return
+    <CODE>false</CODE> if and only if \p *this turns out to be an
+    empty polyhedron.
+  */
+  bool strongly_minimize_generators() const;
+
+  //! If constraints are up-to-date, obtain a simplified copy of them.
+  Constraint_System simplified_constraints() const;
+
+  //@} // Weak and Strong Minimization of Descriptions
+
+  enum Three_Valued_Boolean {
+    TVB_TRUE,
+    TVB_FALSE,
+    TVB_DONT_KNOW
+  };
+
+  //! Polynomial but incomplete equivalence test between polyhedra.
+  Three_Valued_Boolean quick_equivalence_test(const Polyhedron& y) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is included in \p y.
+  bool is_included_in(const Polyhedron& y) const;
+
+  //! Checks if and how \p expr is bounded in \p *this.
+  /*!
+    Returns <CODE>true</CODE> if and only if \p from_above is
+    <CODE>true</CODE> and \p expr is bounded from above in \p *this,
+    or \p from_above is <CODE>false</CODE> and \p expr is bounded
+    from below in \p *this.
+
+    \param expr
+    The linear expression to test;
+
+    \param from_above
+    <CODE>true</CODE> if and only if the boundedness of interest is
+    "from above".
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+  */
+  bool bounds(const Linear_Expression& expr, bool from_above) const;
+
+  //! Maximizes or minimizes \p expr subject to \p *this.
+  /*!
+    \param expr
+    The linear expression to be maximized or minimized subject to \p
+    *this;
+
+    \param maximize
+    <CODE>true</CODE> if maximization is what is wanted;
+
+    \param ext_n
+    The numerator of the extremum value;
+
+    \param ext_d
+    The denominator of the extremum value;
+
+    \param included
+    <CODE>true</CODE> if and only if the extremum of \p expr can
+    actually be reached in \p * this;
+
+    \param g
+    When maximization or minimization succeeds, will be assigned
+    a point or closure point where \p expr reaches the
+    corresponding extremum value.
+
+    \exception std::invalid_argument
+    Thrown if \p expr and \p *this are dimension-incompatible.
+
+    If \p *this is empty or \p expr is not bounded in the appropriate
+    direction, <CODE>false</CODE> is returned and \p ext_n, \p ext_d,
+    \p included and \p g are left untouched.
+  */
+  bool max_min(const Linear_Expression& expr,
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator& g) const;
+
+  //! \name Widening- and Extrapolation-Related Functions
+  //@{
+
+  /*! \brief
+    Copies to \p cs_selection the constraints of \p y corresponding
+    to the definition of the CH78-widening of \p *this and \p y.
+  */
+  void select_CH78_constraints(const Polyhedron& y,
+                               Constraint_System& cs_selection) const;
+
+  /*! \brief
+    Splits the constraints of `x' into two subsets, depending on whether
+    or not they are selected to compute the \ref H79_widening "H79-widening"
+    of \p *this and \p y.
+  */
+  void select_H79_constraints(const Polyhedron& y,
+                              Constraint_System& cs_selected,
+                              Constraint_System& cs_not_selected) const;
+
+  bool BHRZ03_combining_constraints(const Polyhedron& y,
+                                    const BHRZ03_Certificate& y_cert,
+                                    const Polyhedron& H79,
+                                    const Constraint_System& x_minus_H79_cs);
+
+  bool BHRZ03_evolving_points(const Polyhedron& y,
+                              const BHRZ03_Certificate& y_cert,
+                              const Polyhedron& H79);
+
+  bool BHRZ03_evolving_rays(const Polyhedron& y,
+                            const BHRZ03_Certificate& y_cert,
+                            const Polyhedron& H79);
+
+  static void modify_according_to_evolution(Linear_Expression& ray,
+                                            const Linear_Expression& x,
+                                            const Linear_Expression& y);
+
+  //@} // Widening- and Extrapolation-Related Functions
+
+  //! Adds new space dimensions to the given linear systems.
+  /*!
+    \param sys1
+    The linear system to which columns are added;
+
+    \param sys2
+    The linear system to which rows and columns are added;
+
+    \param sat1
+    The saturation matrix whose columns are indexed by the rows of
+    \p sys1. On entry it is up-to-date;
+
+    \param sat2
+    The saturation matrix whose columns are indexed by the rows of \p
+    sys2;
+
+    \param add_dim
+    The number of space dimensions to add.
+
+    Adds new space dimensions to the vector space modifying the linear
+    systems and saturation matrices.
+    This function is invoked only by
+    <CODE>add_space_dimensions_and_embed()</CODE> and
+    <CODE>add_space_dimensions_and_project()</CODE>, passing the
+    linear system of constraints and that of generators (and the
+    corresponding saturation matrices) in different order (see those
+    methods for details).
+  */
+  template <typename Linear_System1, typename Linear_System2>
+  static void add_space_dimensions(Linear_System1& sys1,
+                                   Linear_System2& sys2,
+                                   Bit_Matrix& sat1,
+                                   Bit_Matrix& sat2,
+                                   dimension_type add_dim);
+
+  //! \name Minimization-Related Static Member Functions
+  //@{
+
+  //! Builds and simplifies constraints from generators (or vice versa).
+  // Detailed Doxygen comment to be found in file minimize.cc.
+  template <typename Source_Linear_System, typename Dest_Linear_System>
+  static bool minimize(bool con_to_gen,
+                       Source_Linear_System& source,
+                       Dest_Linear_System& dest,
+                       Bit_Matrix& sat);
+
+  /*! \brief
+    Adds given constraints and builds minimized corresponding generators
+    or vice versa.
+  */
+  // Detailed Doxygen comment to be found in file minimize.cc.
+  template <typename Source_Linear_System1, typename Source_Linear_System2,
+            typename Dest_Linear_System>
+  static bool add_and_minimize(bool con_to_gen,
+                               Source_Linear_System1& source1,
+                               Dest_Linear_System& dest,
+                               Bit_Matrix& sat,
+                               const Source_Linear_System2& source2);
+
+  /*! \brief
+    Adds given constraints and builds minimized corresponding generators
+    or vice versa. The given constraints are in \p source.
+  */
+  // Detailed Doxygen comment to be found in file minimize.cc.
+  template <typename Source_Linear_System, typename Dest_Linear_System>
+  static bool add_and_minimize(bool con_to_gen,
+                               Source_Linear_System& source,
+                               Dest_Linear_System& dest,
+                               Bit_Matrix& sat);
+
+  //! Performs the conversion from constraints to generators and vice versa.
+  // Detailed Doxygen comment to be found in file conversion.cc.
+  template <typename Source_Linear_System, typename Dest_Linear_System>
+  static dimension_type conversion(Source_Linear_System& source,
+                                   dimension_type start,
+                                   Dest_Linear_System& dest,
+                                   Bit_Matrix& sat,
+                                   dimension_type num_lines_or_equalities);
+
+  /*! \brief
+    Uses Gauss' elimination method to simplify the result of
+    <CODE>conversion()</CODE>.
+  */
+  // Detailed Doxygen comment to be found in file simplify.cc.
+  template <typename Linear_System1>
+  static dimension_type simplify(Linear_System1& sys, Bit_Matrix& sat);
+
+  //@} // Minimization-Related Static Member Functions
+
+  /*! \brief
+    Pointer to an array used by simplify().
+
+    Holds (between class initialization and finalization) a pointer to
+    an array, allocated with operator new[](), of
+    simplify_num_saturators_size elements.
+  */
+  static dimension_type* simplify_num_saturators_p;
+
+  /*! \brief
+    Dimension of an array used by simplify().
+
+    Holds (between class initialization and finalization) the size of the
+    array pointed to by simplify_num_saturators_p.
+  */
+  static size_t simplify_num_saturators_size;
+
+  template <typename Interval> friend class Parma_Polyhedra_Library::Box;
+  template <typename T> friend class Parma_Polyhedra_Library::BD_Shape;
+  template <typename T> friend class Parma_Polyhedra_Library::Octagonal_Shape;
+  friend class Parma_Polyhedra_Library::Grid;
+  friend class Parma_Polyhedra_Library::BHRZ03_Certificate;
+  friend class Parma_Polyhedra_Library::H79_Certificate;
+
+protected:
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    If the poly-hull of \p *this and \p y is exact it is assigned
+    to \p *this and \c true is returned, otherwise \c false is returned.
+
+    Current implementation is based on (a variant of) Algorithm 8.1 in
+      A. Bemporad, K. Fukuda, and F. D. Torrisi
+      <em>Convexity Recognition of the Union of Polyhedra</em>
+      Technical Report AUT00-13, ETH Zurich, 2000
+
+    \note
+    It is assumed that \p *this and \p y are topologically closed
+    and dimension-compatible;
+    if the assumption does not hold, the behavior is undefined.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  bool BFT00_poly_hull_assign_if_exact(const Polyhedron& y);
+
+  bool BHZ09_poly_hull_assign_if_exact(const Polyhedron& y);
+  bool BHZ09_C_poly_hull_assign_if_exact(const Polyhedron& y);
+  bool BHZ09_NNC_poly_hull_assign_if_exact(const Polyhedron& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \name Exception Throwers
+  //@{
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+protected:
+  void throw_invalid_argument(const char* method, const char* reason) const;
+
+  void throw_topology_incompatible(const char* method,
+                                   const char* ph_name,
+                                   const Polyhedron& ph) const;
+  void throw_topology_incompatible(const char* method,
+                                   const char* c_name,
+                                   const Constraint& c) const;
+  void throw_topology_incompatible(const char* method,
+                                   const char* g_name,
+                                   const Generator& g) const;
+  void throw_topology_incompatible(const char* method,
+                                   const char* cs_name,
+                                   const Constraint_System& cs) const;
+  void throw_topology_incompatible(const char* method,
+                                   const char* gs_name,
+                                   const Generator_System& gs) const;
+
+  void throw_dimension_incompatible(const char* method,
+                                    const char* other_name,
+                                    dimension_type other_dim) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* ph_name,
+                                    const Polyhedron& ph) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* c_name,
+                                    const Constraint& c) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* g_name,
+                                    const Generator& g) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* cg_name,
+                                    const Congruence& cg) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* cs_name,
+                                    const Constraint_System& cs) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* gs_name,
+                                    const Generator_System& gs) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* cgs_name,
+                                    const Congruence_System& cgs) const;
+  template <typename C>
+  void throw_dimension_incompatible(const char* method,
+                                    const char* lf_name,
+                                    const Linear_Form<C>& lf) const;
+  void throw_dimension_incompatible(const char* method,
+                                    const char* var_name,
+                                    Variable var) const;
+  void throw_dimension_incompatible(const char* method,
+                                    dimension_type required_space_dim) const;
+
+  // Note: the following three methods need to be static, because they
+  // can be called inside constructors (before actually constructing the
+  // polyhedron object).
+  static dimension_type
+  check_space_dimension_overflow(dimension_type dim, dimension_type max,
+                                 const Topology topol,
+                                 const char* method, const char* reason);
+
+  static dimension_type
+  check_space_dimension_overflow(dimension_type dim, const Topology topol,
+                                 const char* method, const char* reason);
+
+  template <typename Object>
+  static Object&
+  check_obj_space_dimension_overflow(Object& input, Topology topol,
+                                     const char* method, const char* reason);
+
+  void throw_invalid_generator(const char* method,
+                               const char* g_name) const;
+
+  void throw_invalid_generators(const char* method,
+                                const char* gs_name) const;
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //@} // Exception Throwers
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+  /*! \brief
+    Possibly tightens \p *this by dropping some points with non-integer
+    coordinates for the space dimensions corresponding to \p *vars_p.
+
+    \param vars_p
+    When nonzero, points with non-integer coordinates for the
+    variables/space-dimensions contained in \p *vars_p can be discarded.
+
+    \param complexity
+    The maximal complexity of any algorithms used.
+
+    \note
+    Currently there is no optimality guarantee, not even if
+    \p complexity is <CODE>ANY_COMPLEXITY</CODE>.
+  */
+  void drop_some_non_integer_points(const Variables_Set* vars_p,
+                                    Complexity_Class complexity);
+
+  //! Helper function that overapproximates an interval linear form.
+  /*!
+    \param lf
+    The linear form on intervals with floating point boundaries to approximate.
+    ALL of its coefficients MUST be bounded.
+
+    \param lf_dimension
+    Must be the space dimension of \p lf.
+
+    \param result
+    Used to store the result.
+
+    This function makes \p result become a linear form that is a correct
+    approximation of \p lf under the constraints specified by \p *this.
+    The resulting linear form has the property that all of its variable
+    coefficients have a non-significant upper bound and can thus be
+    considered as singletons.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  void overapproximate_linear_form(
+  const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+  const dimension_type lf_dimension,
+  Linear_Form<Interval <FP_Format, Interval_Info> >& result);
+
+  /*! \brief
+    Helper function that makes \p result become a Linear_Expression obtained
+    by normalizing the denominators in \p lf.
+
+    \param lf
+    The linear form on intervals with floating point boundaries to normalize.
+    It should be the result of an application of static method
+    <CODE>overapproximate_linear_form</CODE>.
+
+    \param lf_dimension
+    Must be the space dimension of \p lf.
+
+    \param result
+    Used to store the result.
+
+    This function ignores the upper bound of intervals in \p lf,
+    so that in fact \p result can be seen as \p lf multiplied by a proper
+    normalization constant.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  static void convert_to_integer_expression(
+              const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+              const dimension_type lf_dimension,
+              Linear_Expression& result);
+
+  //! Normalization helper function.
+  /*!
+    \param lf
+    The linear form on intervals with floating point boundaries to normalize.
+    It should be the result of an application of static method
+    <CODE>overapproximate_linear_form</CODE>.
+
+    \param lf_dimension
+    Must be the space dimension of \p lf.
+
+    \param res
+    Stores the normalized linear form, except its inhomogeneous term.
+
+    \param res_low_coeff
+    Stores the lower boundary of the inhomogeneous term of the result.
+
+    \param res_hi_coeff
+    Stores the higher boundary of the inhomogeneous term of the result.
+
+    \param denominator
+    Becomes the common denominator of \p res_low_coeff, \p res_hi_coeff
+    and all coefficients in \p res.
+
+    Results are obtained by normalizing denominators in \p lf, ignoring
+    the upper bounds of variable coefficients in \p lf.
+  */
+  template <typename FP_Format, typename Interval_Info>
+  static void
+  convert_to_integer_expressions(const Linear_Form<Interval<FP_Format,
+                                                            Interval_Info> >&
+                                 lf,
+                                 const dimension_type lf_dimension,
+                                 Linear_Expression& res,
+                                 Coefficient& res_low_coeff,
+                                 Coefficient& res_hi_coeff,
+                                 Coefficient& denominator);
+
+  template <typename Linear_System1, typename Row2>
+  static bool
+  add_to_system_and_check_independence(Linear_System1& eq_sys,
+                                       const Row2& eq);
+};
+
+#include "Ph_Status_inlines.hh"
+#include "Polyhedron_inlines.hh"
+#include "Polyhedron_templates.hh"
+#include "Polyhedron_chdims_templates.hh"
+#include "Polyhedron_conversion_templates.hh"
+#include "Polyhedron_minimize_templates.hh"
+#include "Polyhedron_simplify_templates.hh"
+
+#endif // !defined(PPL_Polyhedron_defs_hh)
diff --git a/src/Polyhedron_inlines.hh b/src/Polyhedron_inlines.hh
new file mode 100644
index 0000000..f543e9c
--- /dev/null
+++ b/src/Polyhedron_inlines.hh
@@ -0,0 +1,459 @@
+/* Polyhedron class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_inlines_hh
+#define PPL_Polyhedron_inlines_hh 1
+
+#include "Generator_defs.hh"
+#include "compiler.hh"
+#include <algorithm>
+#include <deque>
+
+namespace Parma_Polyhedra_Library {
+
+inline memory_size_type
+Polyhedron::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline dimension_type
+Polyhedron::space_dimension() const {
+  return space_dim;
+}
+
+inline int32_t
+Polyhedron::hash_code() const {
+  return hash_code_from_dimension(space_dimension());
+}
+
+inline dimension_type
+Polyhedron::max_space_dimension() {
+  using std::min;
+  // One dimension is reserved to have a value of type dimension_type
+  // that does not represent a legal dimension.
+  return min(std::numeric_limits<dimension_type>::max() - 1,
+             min(Constraint_System::max_space_dimension(),
+                 Generator_System::max_space_dimension()
+                 )
+             );
+}
+
+inline Topology
+Polyhedron::topology() const {
+  // We can check either one of the two matrices.
+  // (`con_sys' is slightly better, since it is placed at offset 0.)
+  return con_sys.topology();
+}
+
+inline bool
+Polyhedron::is_discrete() const {
+  return affine_dimension() == 0;
+}
+
+inline bool
+Polyhedron::is_necessarily_closed() const {
+  // We can check either one of the two matrices.
+  // (`con_sys' is slightly better, since it is placed at offset 0.)
+  return con_sys.is_necessarily_closed();
+}
+
+inline void
+Polyhedron::upper_bound_assign(const Polyhedron& y) {
+  poly_hull_assign(y);
+}
+
+inline void
+Polyhedron::difference_assign(const Polyhedron& y) {
+  poly_difference_assign(y);
+}
+
+inline void
+Polyhedron::widening_assign(const Polyhedron& y, unsigned* tp) {
+  H79_widening_assign(y, tp);
+}
+
+inline
+Polyhedron::~Polyhedron() {
+}
+
+inline void
+Polyhedron::m_swap(Polyhedron& y) {
+  if (topology() != y.topology())
+    throw_topology_incompatible("swap(y)", "y", y);
+  using std::swap;
+  swap(con_sys, y.con_sys);
+  swap(gen_sys, y.gen_sys);
+  swap(sat_c, y.sat_c);
+  swap(sat_g, y.sat_g);
+  swap(status, y.status);
+  swap(space_dim, y.space_dim);
+}
+
+/*! \relates Polyhedron */
+inline void
+swap(Polyhedron& x, Polyhedron& y) {
+  x.m_swap(y);
+}
+
+inline bool
+Polyhedron::can_recycle_constraint_systems() {
+  return true;
+}
+
+inline bool
+Polyhedron::can_recycle_congruence_systems() {
+  return false;
+}
+
+inline bool
+Polyhedron::marked_empty() const {
+  return status.test_empty();
+}
+
+inline bool
+Polyhedron::constraints_are_up_to_date() const {
+  return status.test_c_up_to_date();
+}
+
+inline bool
+Polyhedron::generators_are_up_to_date() const {
+  return status.test_g_up_to_date();
+}
+
+inline bool
+Polyhedron::constraints_are_minimized() const {
+  return status.test_c_minimized();
+}
+
+inline bool
+Polyhedron::generators_are_minimized() const {
+  return status.test_g_minimized();
+}
+
+inline bool
+Polyhedron::sat_c_is_up_to_date() const {
+  return status.test_sat_c_up_to_date();
+}
+
+inline bool
+Polyhedron::sat_g_is_up_to_date() const {
+  return status.test_sat_g_up_to_date();
+}
+
+inline bool
+Polyhedron::has_pending_constraints() const {
+  return status.test_c_pending();
+}
+
+inline bool
+Polyhedron::has_pending_generators() const {
+  return status.test_g_pending();
+}
+
+inline bool
+Polyhedron::has_something_pending() const {
+  return status.test_c_pending() || status.test_g_pending();
+}
+
+inline bool
+Polyhedron::can_have_something_pending() const {
+  return constraints_are_minimized()
+    && generators_are_minimized()
+    && (sat_c_is_up_to_date() || sat_g_is_up_to_date());
+}
+
+inline bool
+Polyhedron::is_empty() const {
+  if (marked_empty())
+    return true;
+  // Try a fast-fail test: if generators are up-to-date and
+  // there are no pending constraints, then the generator system
+  // (since it is well formed) contains a point.
+  if (generators_are_up_to_date() && !has_pending_constraints())
+    return false;
+  return !minimize();
+}
+
+inline void
+Polyhedron::set_constraints_up_to_date() {
+  status.set_c_up_to_date();
+}
+
+inline void
+Polyhedron::set_generators_up_to_date() {
+  status.set_g_up_to_date();
+}
+
+inline void
+Polyhedron::set_constraints_minimized() {
+  set_constraints_up_to_date();
+  status.set_c_minimized();
+}
+
+inline void
+Polyhedron::set_generators_minimized() {
+  set_generators_up_to_date();
+  status.set_g_minimized();
+}
+
+inline void
+Polyhedron::set_constraints_pending() {
+  status.set_c_pending();
+}
+
+inline void
+Polyhedron::set_generators_pending() {
+  status.set_g_pending();
+}
+
+inline void
+Polyhedron::set_sat_c_up_to_date() {
+  status.set_sat_c_up_to_date();
+}
+
+inline void
+Polyhedron::set_sat_g_up_to_date() {
+  status.set_sat_g_up_to_date();
+}
+
+inline void
+Polyhedron::clear_empty() {
+  status.reset_empty();
+}
+
+inline void
+Polyhedron::clear_constraints_minimized() {
+  status.reset_c_minimized();
+}
+
+inline void
+Polyhedron::clear_generators_minimized() {
+  status.reset_g_minimized();
+}
+
+inline void
+Polyhedron::clear_pending_constraints() {
+  status.reset_c_pending();
+}
+
+inline void
+Polyhedron::clear_pending_generators() {
+  status.reset_g_pending();
+}
+
+inline void
+Polyhedron::clear_sat_c_up_to_date() {
+  status.reset_sat_c_up_to_date();
+  // Can get rid of sat_c here.
+}
+
+inline void
+Polyhedron::clear_sat_g_up_to_date() {
+  status.reset_sat_g_up_to_date();
+  // Can get rid of sat_g here.
+}
+
+inline void
+Polyhedron::clear_constraints_up_to_date() {
+  clear_pending_constraints();
+  clear_constraints_minimized();
+  clear_sat_c_up_to_date();
+  clear_sat_g_up_to_date();
+  status.reset_c_up_to_date();
+  // Can get rid of con_sys here.
+}
+
+inline void
+Polyhedron::clear_generators_up_to_date() {
+  clear_pending_generators();
+  clear_generators_minimized();
+  clear_sat_c_up_to_date();
+  clear_sat_g_up_to_date();
+  status.reset_g_up_to_date();
+  // Can get rid of gen_sys here.
+}
+
+inline bool
+Polyhedron::process_pending() const {
+  PPL_ASSERT(space_dim > 0 && !marked_empty());
+  PPL_ASSERT(has_something_pending());
+
+  if (has_pending_constraints())
+    return process_pending_constraints();
+
+  PPL_ASSERT(has_pending_generators());
+  process_pending_generators();
+  return true;
+}
+
+inline bool
+Polyhedron::bounds_from_above(const Linear_Expression& expr) const {
+  return bounds(expr, true);
+}
+
+inline bool
+Polyhedron::bounds_from_below(const Linear_Expression& expr) const {
+  return bounds(expr, false);
+}
+
+inline bool
+Polyhedron::maximize(const Linear_Expression& expr,
+                     Coefficient& sup_n, Coefficient& sup_d,
+                     bool& maximum) const {
+  Generator g(point());
+  return max_min(expr, true, sup_n, sup_d, maximum, g);
+}
+
+inline bool
+Polyhedron::maximize(const Linear_Expression& expr,
+                     Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                     Generator& g) const {
+  return max_min(expr, true, sup_n, sup_d, maximum, g);
+}
+
+inline bool
+Polyhedron::minimize(const Linear_Expression& expr,
+                     Coefficient& inf_n, Coefficient& inf_d,
+                     bool& minimum) const {
+  Generator g(point());
+  return max_min(expr, false, inf_n, inf_d, minimum, g);
+}
+
+inline bool
+Polyhedron::minimize(const Linear_Expression& expr,
+                     Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                     Generator& g) const {
+  return max_min(expr, false, inf_n, inf_d, minimum, g);
+}
+
+inline Constraint_System
+Polyhedron::simplified_constraints() const {
+  PPL_ASSERT(constraints_are_up_to_date());
+  Constraint_System cs(con_sys);
+  if (cs.num_pending_rows() > 0)
+    cs.unset_pending_rows();
+  if (has_pending_constraints() || !constraints_are_minimized())
+    cs.simplify();
+  return cs;
+}
+
+inline Congruence_System
+Polyhedron::congruences() const {
+  return Congruence_System(minimized_constraints());
+}
+
+inline Congruence_System
+Polyhedron::minimized_congruences() const {
+  return Congruence_System(minimized_constraints());
+}
+
+inline void
+Polyhedron::add_recycled_congruences(Congruence_System& cgs) {
+  add_congruences(cgs);
+}
+
+template <typename FP_Format, typename Interval_Info>
+inline void
+Polyhedron::generalized_refine_with_linear_form_inequality(
+            const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
+            const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
+            const Relation_Symbol relsym) {
+  switch (relsym) {
+  case EQUAL:
+    // TODO: see if we can handle this case more efficiently.
+    refine_with_linear_form_inequality(left, right, false);
+    refine_with_linear_form_inequality(right, left, false);
+    break;
+  case LESS_THAN:
+    refine_with_linear_form_inequality(left, right, true);
+    break;
+  case LESS_OR_EQUAL:
+    refine_with_linear_form_inequality(left, right, false);
+    break;
+  case GREATER_THAN:
+    refine_with_linear_form_inequality(right, left, true);
+    break;
+  case GREATER_OR_EQUAL:
+    refine_with_linear_form_inequality(right, left, false);
+    break;
+  case NOT_EQUAL:
+    break;
+  default:
+    PPL_UNREACHABLE;
+    break;
+  }
+}
+
+template <typename FP_Format, typename Interval_Info>
+inline void
+Polyhedron::
+refine_fp_interval_abstract_store(
+       Box< Interval<FP_Format, Interval_Info> >& store) const {
+
+  // Check that FP_Format is indeed a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
+                     "Polyhedron::refine_fp_interval_abstract_store:"
+                     " T not a floating point type.");
+
+  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
+  store.intersection_assign(Box<FP_Interval_Type>(*this));
+
+}
+
+/*! \relates Polyhedron */
+inline bool
+operator!=(const Polyhedron& x, const Polyhedron& y) {
+  return !(x == y);
+}
+
+inline bool
+Polyhedron::strictly_contains(const Polyhedron& y) const {
+  const Polyhedron& x = *this;
+  return x.contains(y) && !y.contains(x);
+}
+
+inline void
+Polyhedron::drop_some_non_integer_points(Complexity_Class complexity) {
+  const Variables_Set* const p_vs = 0;
+  drop_some_non_integer_points(p_vs, complexity);
+}
+
+inline void
+Polyhedron::drop_some_non_integer_points(const Variables_Set& vars,
+                                         Complexity_Class complexity) {
+  drop_some_non_integer_points(&vars, complexity);
+}
+
+
+namespace Interfaces {
+
+inline bool
+is_necessarily_closed_for_interfaces(const Polyhedron& ph) {
+  return ph.is_necessarily_closed();
+}
+
+} // namespace Interfaces
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_inlines_hh)
diff --git a/src/Polyhedron_minimize.templates.hh b/src/Polyhedron_minimize.templates.hh
deleted file mode 100644
index 0516bee..0000000
--- a/src/Polyhedron_minimize.templates.hh
+++ /dev/null
@@ -1,435 +0,0 @@
-/* Polyhedron class implementation: minimize() and add_and_minimize().
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_minimize_templates_hh
-#define PPL_Polyhedron_minimize_templates_hh 1
-
-#include "Bit_Matrix.defs.hh"
-#include "Polyhedron.defs.hh"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-/*!
-  \return
-  <CODE>true</CODE> if the polyhedron is empty, <CODE>false</CODE>
-  otherwise.
-
-  \param con_to_gen
-  <CODE>true</CODE> if \p source represents the constraints,
-  <CODE>false</CODE> otherwise;
-
-  \param source
-  The given system, which is not empty;
-
-  \param dest
-  The system to build and minimize;
-
-  \param sat
-  The saturation matrix.
-
-  \p dest is not <CODE>const</CODE> because it will be built (and then
-  modified) during minimize(). Also, \p sat and \p source are
-  not <CODE>const</CODE> because the former will be built during
-  \p dest creation and the latter will maybe be sorted and modified by
-  <CODE>conversion()</CODE> and <CODE>simplify()</CODE>.
-
-  \p sat has the generators on its columns and the constraints on its rows
-  if \p con_to_gen is <CODE>true</CODE>, otherwise it has the generators on
-  its rows and the constraints on its columns.
-
-  Given \p source, this function builds (by means of
-  <CODE>conversion()</CODE>) \p dest and then simplifies (invoking
-  <CODE>simplify()</CODE>) \p source, erasing redundant rows.
-  For the sequel we assume that \p source is the system of constraints
-  and \p dest is the system of generators.
-  This will simplify the description of the function; the dual case is
-  similar.
-*/
-template <typename Source_Linear_System, typename Dest_Linear_System>
-bool
-Polyhedron::minimize(const bool con_to_gen,
-                     Source_Linear_System& source,
-                     Dest_Linear_System& dest,
-                     Bit_Matrix& sat) {
-
-  typedef typename Dest_Linear_System::row_type dest_row_type;
-
-  // Topologies have to agree.
-  PPL_ASSERT(source.topology() == dest.topology());
-  // `source' cannot be empty: even if it is an empty constraint system,
-  // representing the universe polyhedron, homogenization has added
-  // the positive constraint. It also cannot be an empty generator system,
-  // since this function is always called starting from a non-empty
-  // polyhedron.
-  PPL_ASSERT(!source.has_no_rows());
-
-  // Sort the source system, if necessary.
-  if (!source.is_sorted())
-    source.sort_rows();
-
-  // Initialization of the system of generators `dest'.
-  // The algorithm works incrementally and we haven't seen any
-  // constraint yet: as a consequence, `dest' should describe
-  // the universe polyhedron of the appropriate dimension.
-  // To this end, we initialize it to the identity matrix of dimension
-  // `source.num_columns()': the rows represent the lines corresponding
-  // to the canonical basis of the vector space.
-  dimension_type dest_num_rows
-    = source.topology() == NECESSARILY_CLOSED ? source.space_dimension() + 1
-                                              : source.space_dimension() + 2;
-
-  dest.clear();
-  dest.set_space_dimension(source.space_dimension());
-
-  // Initialize `dest' to the identity matrix.
-  for (dimension_type i = 0; i < dest_num_rows; ++i) {
-    Linear_Expression expr;
-    expr.set_space_dimension(dest_num_rows - 1);
-    if (i == 0)
-      expr += 1;
-    else
-      expr += Variable(i - 1);
-    dest_row_type dest_i(expr, dest_row_type::LINE_OR_EQUALITY, NECESSARILY_CLOSED);
-    if (dest.topology() == NOT_NECESSARILY_CLOSED)
-      dest_i.mark_as_not_necessarily_closed();
-    dest.sys.insert_no_ok(dest_i, Recycle_Input());
-  }
-  // The identity matrix `dest' is not sorted (see the sorting rules
-  // in Constrant.cc and Generator.cc).
-  dest.set_sorted(false);
-
-  // NOTE: the system `dest', as it is now, is not a _legal_ system of
-  //       generators, because in the first row we have a line with a
-  //       non-zero divisor (which should only happen for
-  //       points). However, this is NOT a problem, because `source'
-  //       necessarily contains the positivity constraint (or a
-  //       combination of it with another constraint) which will
-  //       restore things as they should be.
-
-
-  // Building a saturation matrix and initializing it by setting
-  // all of its elements to zero. This matrix will be modified together
-  // with `dest' during the conversion.
-  // NOTE: since we haven't seen any constraint yet, the relevant
-  //       portion of `tmp_sat' is the sub-matrix consisting of
-  //       the first 0 columns: thus the relevant portion correctly
-  //       characterizes the initial saturation information.
-  Bit_Matrix tmp_sat(dest_num_rows, source.num_rows());
-
-  // By invoking the function conversion(), we populate `dest' with
-  // the generators characterizing the polyhedron described by all
-  // the constraints in `source'.
-  // The `start' parameter is zero (we haven't seen any constraint yet)
-  // and the 5th parameter (representing the number of lines in `dest'),
-  // by construction, is equal to `dest_num_rows'.
-  const dimension_type num_lines_or_equalities
-    = conversion(source, 0, dest, tmp_sat, dest_num_rows);
-  // conversion() may have modified the number of rows in `dest'.
-  dest_num_rows = dest.num_rows();
-
-#ifndef NDEBUG
-  for (dimension_type i = dest.num_rows(); i-- > 0; )
-    PPL_ASSERT(dest[i].OK());
-#endif
-
-  // Checking if the generators in `dest' represent an empty polyhedron:
-  // the polyhedron is empty if there are no points
-  // (because rays, lines and closure points need a supporting point).
-  // Points can be detected by looking at:
-  // - the divisor, for necessarily closed polyhedra;
-  // - the epsilon coordinate, for NNC polyhedra.
-  dimension_type first_point;
-  if (dest.is_necessarily_closed()) {
-    for (first_point = num_lines_or_equalities;
-        first_point < dest_num_rows;
-        ++first_point)
-      if (dest[first_point].expr.inhomogeneous_term() > 0)
-        break;
-  } else {
-    for (first_point = num_lines_or_equalities;
-        first_point < dest_num_rows;
-        ++first_point)
-      if (dest[first_point].expr.get(Variable(dest.space_dimension())) > 0)
-        break;
-  }
-
-  if (first_point == dest_num_rows)
-    if (con_to_gen)
-      // No point has been found: the polyhedron is empty.
-      return true;
-    else {
-      // Here `con_to_gen' is false: `dest' is a system of constraints.
-      // In this case the condition `first_point == dest_num_rows'
-      // actually means that all the constraints in `dest' have their
-      // inhomogeneous term equal to 0.
-      // This is an ILLEGAL situation, because it implies that
-      // the constraint system `dest' lacks the positivity constraint
-      // and no linear combination of the constraints in `dest'
-      // can reintroduce the positivity constraint.
-      PPL_UNREACHABLE;
-      return false;
-    }
-  else {
-    // A point has been found: the polyhedron is not empty.
-    // Now invoking simplify() to remove all the redundant constraints
-    // from the system `source'.
-    // Since the saturation matrix `tmp_sat' returned by conversion()
-    // has rows indexed by generators (the rows of `dest') and columns
-    // indexed by constraints (the rows of `source'), we have to
-    // transpose it to obtain the saturation matrix needed by simplify().
-    sat.transpose_assign(tmp_sat);
-    simplify(source, sat);
-    return false;
-  }
-}
-
-
-/*!
-  \return
-  <CODE>true</CODE> if the obtained polyhedron is empty,
-  <CODE>false</CODE> otherwise.
-
-  \param con_to_gen
-  <CODE>true</CODE> if \p source1 and \p source2 are system of
-  constraints, <CODE>false</CODE> otherwise;
-
-  \param source1
-  The first element of the given DD pair;
-
-  \param dest
-  The second element of the given DD pair;
-
-  \param sat
-  The saturation matrix that bind \p source1 to \p dest;
-
-  \param source2
-  The new system of generators or constraints.
-
-  It is assumed that \p source1 and \p source2 are sorted and have
-  no pending rows. It is also assumed that \p dest has no pending rows.
-  On entry, the rows of \p sat are indexed by the rows of \p dest
-  and its columns are indexed by the rows of \p source1.
-  On exit, the rows of \p sat are indexed by the rows of \p dest
-  and its columns are indexed by the rows of the system obtained
-  by merging \p source1 and \p source2.
-
-  Let us suppose we want to add some constraints to a given system of
-  constraints \p source1. This method, given a minimized double description
-  pair (\p source1, \p dest) and a system of new constraints \p source2,
-  modifies \p source1 by adding to it the constraints of \p source2 that
-  are not in \p source1. Then, by invoking
-  <CODE>add_and_minimize(bool, Linear_System_Class&, Linear_System_Class&, Bit_Matrix&)</CODE>,
-  processes the added constraints obtaining a new DD pair.
-
-  This method treats also the dual case, i.e., adding new generators to
-  a previous system of generators. In this case \p source1 contains the
-  old generators, \p source2 the new ones and \p dest is the system
-  of constraints in the given minimized DD pair.
-
-  Since \p source2 contains the constraints (or the generators) that
-  will be added to \p source1, it is constant: it will not be modified.
-*/
-template <typename Source_Linear_System1, typename Source_Linear_System2,
-          typename Dest_Linear_System>
-bool
-Polyhedron::add_and_minimize(const bool con_to_gen,
-                             Source_Linear_System1& source1,
-                             Dest_Linear_System& dest,
-                             Bit_Matrix& sat,
-                             const Source_Linear_System2& source2) {
-  // `source1' and `source2' cannot be empty.
-  PPL_ASSERT(!source1.has_no_rows() && !source2.has_no_rows());
-  // `source1' and `source2' must have the same number of columns
-  // to be merged.
-  PPL_ASSERT(source1.num_columns() == source2.num_columns());
-  // `source1' and `source2' are fully sorted.
-  PPL_ASSERT(source1.is_sorted() && source1.num_pending_rows() == 0);
-  PPL_ASSERT(source2.is_sorted() && source2.num_pending_rows() == 0);
-  PPL_ASSERT(dest.num_pending_rows() == 0);
-
-  const dimension_type old_source1_num_rows = source1.num_rows();
-  // `k1' and `k2' run through the rows of `source1' and `source2', resp.
-  dimension_type k1 = 0;
-  dimension_type k2 = 0;
-  dimension_type source2_num_rows = source2.num_rows();
-  while (k1 < old_source1_num_rows && k2 < source2_num_rows) {
-    // Add to `source1' the constraints from `source2', as pending rows.
-    // We exploit the property that initially both `source1' and `source2'
-    // are sorted and index `k1' only scans the non-pending rows of `source1',
-    // so that it is not influenced by the pending rows appended to it.
-    // This way no duplicate (i.e., trivially redundant) constraint
-    // is introduced in `source1'.
-    const int cmp = compare(source1[k1], source2[k2]);
-    if (cmp == 0) {
-      // We found the same row: there is no need to add `source2[k2]'.
-      ++k2;
-      // By sortedness, since `k1 < old_source1_num_rows',
-      // we can increment index `k1' too.
-      ++k1;
-    }
-    else if (cmp < 0)
-      // By sortedness, we can increment `k1'.
-      ++k1;
-    else {
-      // Here `cmp > 0'.
-      // By sortedness, `source2[k2]' cannot be in `source1'.
-      // We add it as a pending row of `source1' (sortedness unaffected).
-      source1.add_pending_row(source2[k2]);
-      // We can increment `k2'.
-      ++k2;
-    }
-  }
-  // Have we scanned all the rows in `source2'?
-  if (k2 < source2_num_rows)
-    // By sortedness, all the rows in `source2' having indexes
-    // greater than or equal to `k2' were not in `source1'.
-    // We add them as pending rows of 'source1' (sortedness not affected).
-    for ( ; k2 < source2_num_rows; ++k2)
-      source1.add_pending_row(source2[k2]);
-
-  if (source1.num_pending_rows() == 0)
-    // No row was appended to `source1', because all the constraints
-    // in `source2' were already in `source1'.
-    // There is nothing left to do ...
-    return false;
-
-  return add_and_minimize(con_to_gen, source1, dest, sat);
-}
-
-/*!
-  \return
-  <CODE>true</CODE> if the obtained polyhedron is empty,
-  <CODE>false</CODE> otherwise.
-
-  \param con_to_gen
-  <CODE>true</CODE> if \p source is a system of constraints,
-  <CODE>false</CODE> otherwise;
-
-  \param source
-  The first element of the given DD pair. It also contains the pending
-  rows to be processed;
-
-  \param dest
-  The second element of the given DD pair. It cannot have pending rows;
-
-  \param sat
-  The saturation matrix that bind the upper part of \p source to \p dest.
-
-  On entry, the rows of \p sat are indexed by the rows of \p dest
-  and its columns are indexed by the non-pending rows of \p source.
-  On exit, the rows of \p sat are indexed by the rows of \p dest
-  and its columns are indexed by the rows of \p source.
-
-  Let us suppose that \p source is a system of constraints.
-  This method assumes that the non-pending part of \p source and
-  system \p dest form a double description pair in minimal form and
-  will build a new DD pair in minimal form by processing the pending
-  constraints in \p source. To this end, it will call
-  <CODE>conversion()</CODE>) and <CODE>simplify</CODE>.
-
-  This method treats also the dual case, i.e., processing pending
-  generators. In this case \p source contains generators and \p dest
-  is the system of constraints corresponding to the non-pending part
-  of \p source.
-*/
-template <typename Source_Linear_System, typename Dest_Linear_System>
-bool
-Polyhedron::add_and_minimize(const bool con_to_gen,
-                             Source_Linear_System& source,
-                             Dest_Linear_System& dest,
-                             Bit_Matrix& sat) {
-  PPL_ASSERT(source.num_pending_rows() > 0);
-  PPL_ASSERT(source.space_dimension() == dest.space_dimension());
-  PPL_ASSERT(source.is_sorted());
-
-  // First, pad the saturation matrix with new columns (of zeroes)
-  // to accommodate for the pending rows of `source'.
-  sat.resize(dest.num_rows(), source.num_rows());
-
-  // Incrementally compute the new system of generators.
-  // Parameter `start' is set to the index of the first pending constraint.
-  const dimension_type num_lines_or_equalities
-    = conversion(source, source.first_pending_row(),
-		 dest, sat,
-		 dest.num_lines_or_equalities());
-
-  // conversion() may have modified the number of rows in `dest'.
-  const dimension_type dest_num_rows = dest.num_rows();
-
-  // Checking if the generators in `dest' represent an empty polyhedron:
-  // the polyhedron is empty if there are no points
-  // (because rays, lines and closure points need a supporting point).
-  // Points can be detected by looking at:
-  // - the divisor, for necessarily closed polyhedra;
-  // - the epsilon coordinate, for NNC polyhedra.
-  dimension_type first_point;
-  if (dest.is_necessarily_closed()) {
-    for (first_point = num_lines_or_equalities;
-        first_point < dest_num_rows;
-        ++first_point)
-      if (dest[first_point].expr.inhomogeneous_term() > 0)
-        break;
-  } else {
-    for (first_point = num_lines_or_equalities;
-        first_point < dest_num_rows;
-        ++first_point)
-      if (dest[first_point].expr.get(Variable(dest.space_dimension())) > 0)
-        break;
-  }
-
-  if (first_point == dest_num_rows)
-    if (con_to_gen)
-      // No point has been found: the polyhedron is empty.
-      return true;
-    else {
-      // Here `con_to_gen' is false: `dest' is a system of constraints.
-      // In this case the condition `first_point == dest_num_rows'
-      // actually means that all the constraints in `dest' have their
-      // inhomogeneous term equal to 0.
-      // This is an ILLEGAL situation, because it implies that
-      // the constraint system `dest' lacks the positivity constraint
-      // and no linear combination of the constraints in `dest'
-      // can reintroduce the positivity constraint.
-      PPL_UNREACHABLE;
-      return false;
-    }
-  else {
-    // A point has been found: the polyhedron is not empty.
-    // Now invoking `simplify()' to remove all the redundant constraints
-    // from the system `source'.
-    // Since the saturation matrix `sat' returned by `conversion()'
-    // has rows indexed by generators (the rows of `dest') and columns
-    // indexed by constraints (the rows of `source'), we have to
-    // transpose it to obtain the saturation matrix needed by `simplify()'.
-    sat.transpose();
-    simplify(source, sat);
-    // Transposing back.
-    sat.transpose();
-    return false;
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_minimize_templates_hh)
diff --git a/src/Polyhedron_minimize_templates.hh b/src/Polyhedron_minimize_templates.hh
new file mode 100644
index 0000000..7a268f8
--- /dev/null
+++ b/src/Polyhedron_minimize_templates.hh
@@ -0,0 +1,437 @@
+/* Polyhedron class implementation: minimize() and add_and_minimize().
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_minimize_templates_hh
+#define PPL_Polyhedron_minimize_templates_hh 1
+
+#include "Bit_Matrix_defs.hh"
+#include "Polyhedron_defs.hh"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+/*!
+  \return
+  <CODE>true</CODE> if the polyhedron is empty, <CODE>false</CODE>
+  otherwise.
+
+  \param con_to_gen
+  <CODE>true</CODE> if \p source represents the constraints,
+  <CODE>false</CODE> otherwise;
+
+  \param source
+  The given system, which is not empty;
+
+  \param dest
+  The system to build and minimize;
+
+  \param sat
+  The saturation matrix.
+
+  \p dest is not <CODE>const</CODE> because it will be built (and then
+  modified) during minimize(). Also, \p sat and \p source are
+  not <CODE>const</CODE> because the former will be built during
+  \p dest creation and the latter will maybe be sorted and modified by
+  <CODE>conversion()</CODE> and <CODE>simplify()</CODE>.
+
+  \p sat has the generators on its columns and the constraints on its rows
+  if \p con_to_gen is <CODE>true</CODE>, otherwise it has the generators on
+  its rows and the constraints on its columns.
+
+  Given \p source, this function builds (by means of
+  <CODE>conversion()</CODE>) \p dest and then simplifies (invoking
+  <CODE>simplify()</CODE>) \p source, erasing redundant rows.
+  For the sequel we assume that \p source is the system of constraints
+  and \p dest is the system of generators.
+  This will simplify the description of the function; the dual case is
+  similar.
+*/
+template <typename Source_Linear_System, typename Dest_Linear_System>
+bool
+Polyhedron::minimize(const bool con_to_gen,
+                     Source_Linear_System& source,
+                     Dest_Linear_System& dest,
+                     Bit_Matrix& sat) {
+
+  typedef typename Dest_Linear_System::row_type dest_row_type;
+
+  // Topologies have to agree.
+  PPL_ASSERT(source.topology() == dest.topology());
+  // `source' cannot be empty: even if it is an empty constraint system,
+  // representing the universe polyhedron, homogenization has added
+  // the positive constraint. It also cannot be an empty generator system,
+  // since this function is always called starting from a non-empty
+  // polyhedron.
+  PPL_ASSERT(!source.has_no_rows());
+
+  // Sort the source system, if necessary.
+  if (!source.is_sorted())
+    source.sort_rows();
+
+  // Initialization of the system of generators `dest'.
+  // The algorithm works incrementally and we haven't seen any
+  // constraint yet: as a consequence, `dest' should describe
+  // the universe polyhedron of the appropriate dimension.
+  // To this end, we initialize it to the identity matrix of dimension
+  // `source.num_columns()': the rows represent the lines corresponding
+  // to the canonical basis of the vector space.
+  dimension_type dest_num_rows
+    = source.topology() == NECESSARILY_CLOSED ? source.space_dimension() + 1
+                                              : source.space_dimension() + 2;
+
+  dest.clear();
+  dest.set_space_dimension(source.space_dimension());
+
+  // Initialize `dest' to the identity matrix.
+  for (dimension_type i = 0; i < dest_num_rows; ++i) {
+    Linear_Expression expr;
+    expr.set_space_dimension(dest_num_rows - 1);
+    if (i == 0)
+      expr += 1;
+    else
+      expr += Variable(i - 1);
+    dest_row_type dest_i(expr, dest_row_type::LINE_OR_EQUALITY, NECESSARILY_CLOSED);
+    if (dest.topology() == NOT_NECESSARILY_CLOSED)
+      dest_i.mark_as_not_necessarily_closed();
+    dest.sys.insert_no_ok(dest_i, Recycle_Input());
+  }
+  // The identity matrix `dest' is not sorted (see the sorting rules
+  // in Constrant.cc and Generator.cc).
+  dest.set_sorted(false);
+
+  // NOTE: the system `dest', as it is now, is not a _legal_ system of
+  //       generators, because in the first row we have a line with a
+  //       non-zero divisor (which should only happen for
+  //       points). However, this is NOT a problem, because `source'
+  //       necessarily contains the positivity constraint (or a
+  //       combination of it with another constraint) which will
+  //       restore things as they should be.
+
+
+  // Building a saturation matrix and initializing it by setting
+  // all of its elements to zero. This matrix will be modified together
+  // with `dest' during the conversion.
+  // NOTE: since we haven't seen any constraint yet, the relevant
+  //       portion of `tmp_sat' is the sub-matrix consisting of
+  //       the first 0 columns: thus the relevant portion correctly
+  //       characterizes the initial saturation information.
+  Bit_Matrix tmp_sat(dest_num_rows, source.num_rows());
+
+  // By invoking the function conversion(), we populate `dest' with
+  // the generators characterizing the polyhedron described by all
+  // the constraints in `source'.
+  // The `start' parameter is zero (we haven't seen any constraint yet)
+  // and the 5th parameter (representing the number of lines in `dest'),
+  // by construction, is equal to `dest_num_rows'.
+  const dimension_type num_lines_or_equalities
+    = conversion(source, 0U, dest, tmp_sat, dest_num_rows);
+  // conversion() may have modified the number of rows in `dest'.
+  dest_num_rows = dest.num_rows();
+
+#ifndef NDEBUG
+  for (dimension_type i = dest.num_rows(); i-- > 0; )
+    PPL_ASSERT(dest[i].OK());
+#endif
+
+  // Checking if the generators in `dest' represent an empty polyhedron:
+  // the polyhedron is empty if there are no points
+  // (because rays, lines and closure points need a supporting point).
+  // Points can be detected by looking at:
+  // - the divisor, for necessarily closed polyhedra;
+  // - the epsilon coordinate, for NNC polyhedra.
+  dimension_type first_point;
+  if (dest.is_necessarily_closed()) {
+    for (first_point = num_lines_or_equalities;
+        first_point < dest_num_rows;
+        ++first_point)
+      if (dest[first_point].expr.inhomogeneous_term() > 0)
+        break;
+  }
+  else {
+    for (first_point = num_lines_or_equalities;
+        first_point < dest_num_rows;
+        ++first_point)
+      if (dest[first_point].expr.get(Variable(dest.space_dimension())) > 0)
+        break;
+  }
+
+  if (first_point == dest_num_rows)
+    if (con_to_gen)
+      // No point has been found: the polyhedron is empty.
+      return true;
+    else {
+      // Here `con_to_gen' is false: `dest' is a system of constraints.
+      // In this case the condition `first_point == dest_num_rows'
+      // actually means that all the constraints in `dest' have their
+      // inhomogeneous term equal to 0.
+      // This is an ILLEGAL situation, because it implies that
+      // the constraint system `dest' lacks the positivity constraint
+      // and no linear combination of the constraints in `dest'
+      // can reintroduce the positivity constraint.
+      PPL_UNREACHABLE;
+      return false;
+    }
+  else {
+    // A point has been found: the polyhedron is not empty.
+    // Now invoking simplify() to remove all the redundant constraints
+    // from the system `source'.
+    // Since the saturation matrix `tmp_sat' returned by conversion()
+    // has rows indexed by generators (the rows of `dest') and columns
+    // indexed by constraints (the rows of `source'), we have to
+    // transpose it to obtain the saturation matrix needed by simplify().
+    sat.transpose_assign(tmp_sat);
+    simplify(source, sat);
+    return false;
+  }
+}
+
+
+/*!
+  \return
+  <CODE>true</CODE> if the obtained polyhedron is empty,
+  <CODE>false</CODE> otherwise.
+
+  \param con_to_gen
+  <CODE>true</CODE> if \p source1 and \p source2 are system of
+  constraints, <CODE>false</CODE> otherwise;
+
+  \param source1
+  The first element of the given DD pair;
+
+  \param dest
+  The second element of the given DD pair;
+
+  \param sat
+  The saturation matrix that bind \p source1 to \p dest;
+
+  \param source2
+  The new system of generators or constraints.
+
+  It is assumed that \p source1 and \p source2 are sorted and have
+  no pending rows. It is also assumed that \p dest has no pending rows.
+  On entry, the rows of \p sat are indexed by the rows of \p dest
+  and its columns are indexed by the rows of \p source1.
+  On exit, the rows of \p sat are indexed by the rows of \p dest
+  and its columns are indexed by the rows of the system obtained
+  by merging \p source1 and \p source2.
+
+  Let us suppose we want to add some constraints to a given system of
+  constraints \p source1. This method, given a minimized double description
+  pair (\p source1, \p dest) and a system of new constraints \p source2,
+  modifies \p source1 by adding to it the constraints of \p source2 that
+  are not in \p source1. Then, by invoking
+  <CODE>add_and_minimize(bool, Linear_System_Class&, Linear_System_Class&, Bit_Matrix&)</CODE>,
+  processes the added constraints obtaining a new DD pair.
+
+  This method treats also the dual case, i.e., adding new generators to
+  a previous system of generators. In this case \p source1 contains the
+  old generators, \p source2 the new ones and \p dest is the system
+  of constraints in the given minimized DD pair.
+
+  Since \p source2 contains the constraints (or the generators) that
+  will be added to \p source1, it is constant: it will not be modified.
+*/
+template <typename Source_Linear_System1, typename Source_Linear_System2,
+          typename Dest_Linear_System>
+bool
+Polyhedron::add_and_minimize(const bool con_to_gen,
+                             Source_Linear_System1& source1,
+                             Dest_Linear_System& dest,
+                             Bit_Matrix& sat,
+                             const Source_Linear_System2& source2) {
+  // `source1' and `source2' cannot be empty.
+  PPL_ASSERT(!source1.has_no_rows() && !source2.has_no_rows());
+  // `source1' and `source2' must have the same number of columns
+  // to be merged.
+  PPL_ASSERT(source1.num_columns() == source2.num_columns());
+  // `source1' and `source2' are fully sorted.
+  PPL_ASSERT(source1.is_sorted() && source1.num_pending_rows() == 0);
+  PPL_ASSERT(source2.is_sorted() && source2.num_pending_rows() == 0);
+  PPL_ASSERT(dest.num_pending_rows() == 0);
+
+  const dimension_type old_source1_num_rows = source1.num_rows();
+  // `k1' and `k2' run through the rows of `source1' and `source2', resp.
+  dimension_type k1 = 0;
+  dimension_type k2 = 0;
+  dimension_type source2_num_rows = source2.num_rows();
+  while (k1 < old_source1_num_rows && k2 < source2_num_rows) {
+    // Add to `source1' the constraints from `source2', as pending rows.
+    // We exploit the property that initially both `source1' and `source2'
+    // are sorted and index `k1' only scans the non-pending rows of `source1',
+    // so that it is not influenced by the pending rows appended to it.
+    // This way no duplicate (i.e., trivially redundant) constraint
+    // is introduced in `source1'.
+    const int cmp = compare(source1[k1], source2[k2]);
+    if (cmp == 0) {
+      // We found the same row: there is no need to add `source2[k2]'.
+      ++k2;
+      // By sortedness, since `k1 < old_source1_num_rows',
+      // we can increment index `k1' too.
+      ++k1;
+    }
+    else if (cmp < 0)
+      // By sortedness, we can increment `k1'.
+      ++k1;
+    else {
+      // Here `cmp > 0'.
+      // By sortedness, `source2[k2]' cannot be in `source1'.
+      // We add it as a pending row of `source1' (sortedness unaffected).
+      source1.add_pending_row(source2[k2]);
+      // We can increment `k2'.
+      ++k2;
+    }
+  }
+  // Have we scanned all the rows in `source2'?
+  if (k2 < source2_num_rows)
+    // By sortedness, all the rows in `source2' having indexes
+    // greater than or equal to `k2' were not in `source1'.
+    // We add them as pending rows of 'source1' (sortedness not affected).
+    for ( ; k2 < source2_num_rows; ++k2)
+      source1.add_pending_row(source2[k2]);
+
+  if (source1.num_pending_rows() == 0)
+    // No row was appended to `source1', because all the constraints
+    // in `source2' were already in `source1'.
+    // There is nothing left to do ...
+    return false;
+
+  return add_and_minimize(con_to_gen, source1, dest, sat);
+}
+
+/*!
+  \return
+  <CODE>true</CODE> if the obtained polyhedron is empty,
+  <CODE>false</CODE> otherwise.
+
+  \param con_to_gen
+  <CODE>true</CODE> if \p source is a system of constraints,
+  <CODE>false</CODE> otherwise;
+
+  \param source
+  The first element of the given DD pair. It also contains the pending
+  rows to be processed;
+
+  \param dest
+  The second element of the given DD pair. It cannot have pending rows;
+
+  \param sat
+  The saturation matrix that bind the upper part of \p source to \p dest.
+
+  On entry, the rows of \p sat are indexed by the rows of \p dest
+  and its columns are indexed by the non-pending rows of \p source.
+  On exit, the rows of \p sat are indexed by the rows of \p dest
+  and its columns are indexed by the rows of \p source.
+
+  Let us suppose that \p source is a system of constraints.
+  This method assumes that the non-pending part of \p source and
+  system \p dest form a double description pair in minimal form and
+  will build a new DD pair in minimal form by processing the pending
+  constraints in \p source. To this end, it will call
+  <CODE>conversion()</CODE>) and <CODE>simplify</CODE>.
+
+  This method treats also the dual case, i.e., processing pending
+  generators. In this case \p source contains generators and \p dest
+  is the system of constraints corresponding to the non-pending part
+  of \p source.
+*/
+template <typename Source_Linear_System, typename Dest_Linear_System>
+bool
+Polyhedron::add_and_minimize(const bool con_to_gen,
+                             Source_Linear_System& source,
+                             Dest_Linear_System& dest,
+                             Bit_Matrix& sat) {
+  PPL_ASSERT(source.num_pending_rows() > 0);
+  PPL_ASSERT(source.space_dimension() == dest.space_dimension());
+  PPL_ASSERT(source.is_sorted());
+
+  // First, pad the saturation matrix with new columns (of zeroes)
+  // to accommodate for the pending rows of `source'.
+  sat.resize(dest.num_rows(), source.num_rows());
+
+  // Incrementally compute the new system of generators.
+  // Parameter `start' is set to the index of the first pending constraint.
+  const dimension_type num_lines_or_equalities
+    = conversion(source, source.first_pending_row(),
+                 dest, sat,
+                 dest.num_lines_or_equalities());
+
+  // conversion() may have modified the number of rows in `dest'.
+  const dimension_type dest_num_rows = dest.num_rows();
+
+  // Checking if the generators in `dest' represent an empty polyhedron:
+  // the polyhedron is empty if there are no points
+  // (because rays, lines and closure points need a supporting point).
+  // Points can be detected by looking at:
+  // - the divisor, for necessarily closed polyhedra;
+  // - the epsilon coordinate, for NNC polyhedra.
+  dimension_type first_point;
+  if (dest.is_necessarily_closed()) {
+    for (first_point = num_lines_or_equalities;
+        first_point < dest_num_rows;
+        ++first_point)
+      if (dest[first_point].expr.inhomogeneous_term() > 0)
+        break;
+  }
+  else {
+    for (first_point = num_lines_or_equalities;
+        first_point < dest_num_rows;
+        ++first_point)
+      if (dest[first_point].expr.get(Variable(dest.space_dimension())) > 0)
+        break;
+  }
+
+  if (first_point == dest_num_rows)
+    if (con_to_gen)
+      // No point has been found: the polyhedron is empty.
+      return true;
+    else {
+      // Here `con_to_gen' is false: `dest' is a system of constraints.
+      // In this case the condition `first_point == dest_num_rows'
+      // actually means that all the constraints in `dest' have their
+      // inhomogeneous term equal to 0.
+      // This is an ILLEGAL situation, because it implies that
+      // the constraint system `dest' lacks the positivity constraint
+      // and no linear combination of the constraints in `dest'
+      // can reintroduce the positivity constraint.
+      PPL_UNREACHABLE;
+      return false;
+    }
+  else {
+    // A point has been found: the polyhedron is not empty.
+    // Now invoking `simplify()' to remove all the redundant constraints
+    // from the system `source'.
+    // Since the saturation matrix `sat' returned by `conversion()'
+    // has rows indexed by generators (the rows of `dest') and columns
+    // indexed by constraints (the rows of `source'), we have to
+    // transpose it to obtain the saturation matrix needed by `simplify()'.
+    sat.transpose();
+    simplify(source, sat);
+    // Transposing back.
+    sat.transpose();
+    return false;
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_minimize_templates_hh)
diff --git a/src/Polyhedron_nonpublic.cc b/src/Polyhedron_nonpublic.cc
index 4c40169..8409164 100644
--- a/src/Polyhedron_nonpublic.cc
+++ b/src/Polyhedron_nonpublic.cc
@@ -1,7 +1,7 @@
 /* Polyhedron class implementation
    (non-inline private or protected functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,10 +23,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Polyhedron.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "Linear_Form.defs.hh"
+#include "Polyhedron_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "Linear_Form_defs.hh"
 #include "C_Integer.hh"
 #include "assert.hh"
 #include <string>
@@ -50,8 +50,8 @@ site: http://bugseng.com/products/ppl/ . */
 namespace PPL = Parma_Polyhedra_Library;
 
 PPL::Polyhedron::Polyhedron(const Topology topol,
-			    const dimension_type num_dimensions,
-			    const Degenerate_Element kind)
+                            const dimension_type num_dimensions,
+                            const Degenerate_Element kind)
   : con_sys(topol, default_con_sys_repr),
     gen_sys(topol, default_gen_sys_repr),
     sat_c(),
@@ -102,8 +102,8 @@ PPL::Polyhedron::Polyhedron(const Topology topol, const Constraint_System& cs)
   const dimension_type cs_copy_space_dim = cs_copy.space_dimension();
   if (!cs_copy.adjust_topology_and_space_dimension(topol, cs_copy_space_dim))
     throw_topology_incompatible((topol == NECESSARILY_CLOSED)
-				? "C_Polyhedron(cs)"
-				: "NNC_Polyhedron(cs)", "cs", cs_copy);
+                                ? "C_Polyhedron(cs)"
+                                : "NNC_Polyhedron(cs)", "cs", cs_copy);
 
   // Set the space dimension.
   space_dim = cs_copy_space_dim;
@@ -137,8 +137,8 @@ PPL::Polyhedron::Polyhedron(const Topology topol, const Constraint_System& cs)
 }
 
 PPL::Polyhedron::Polyhedron(const Topology topol,
-			    Constraint_System& cs,
-			    Recycle_Input)
+                            Constraint_System& cs,
+                            Recycle_Input)
   : con_sys(topol, default_con_sys_repr),
     gen_sys(topol, default_gen_sys_repr),
     sat_c(),
@@ -150,8 +150,8 @@ PPL::Polyhedron::Polyhedron(const Topology topol,
   const dimension_type cs_space_dim = cs.space_dimension();
   if (!cs.adjust_topology_and_space_dimension(topol, cs_space_dim))
     throw_topology_incompatible((topol == NECESSARILY_CLOSED)
-				? "C_Polyhedron(cs, recycle)"
-				: "NNC_Polyhedron(cs, recycle)", "cs", cs);
+                                ? "C_Polyhedron(cs, recycle)"
+                                : "NNC_Polyhedron(cs, recycle)", "cs", cs);
 
   // Set the space dimension.
   space_dim = cs_space_dim;
@@ -203,8 +203,8 @@ PPL::Polyhedron::Polyhedron(const Topology topol, const Generator_System& gs)
   // Non-empty valid generator systems have a supporting point, at least.
   if (!gs.has_points())
     throw_invalid_generators((topol == NECESSARILY_CLOSED)
-			     ? "C_Polyhedron(gs)"
-			     : "NNC_Polyhedron(gs)", "gs");
+                             ? "C_Polyhedron(gs)"
+                             : "NNC_Polyhedron(gs)", "gs");
 
   // TODO: this implementation is just an executable specification.
   Generator_System gs_copy = gs;
@@ -213,8 +213,8 @@ PPL::Polyhedron::Polyhedron(const Topology topol, const Generator_System& gs)
   // Try to adapt `gs_copy' to the required topology.
   if (!gs_copy.adjust_topology_and_space_dimension(topol, gs_copy_space_dim))
     throw_topology_incompatible((topol == NECESSARILY_CLOSED)
-				? "C_Polyhedron(gs)"
-				: "NNC_Polyhedron(gs)", "gs", gs_copy);
+                                ? "C_Polyhedron(gs)"
+                                : "NNC_Polyhedron(gs)", "gs", gs_copy);
 
   if (gs_copy_space_dim > 0) {
     // Stealing the rows from `gs_copy'.
@@ -249,8 +249,8 @@ PPL::Polyhedron::Polyhedron(const Topology topol, const Generator_System& gs)
 }
 
 PPL::Polyhedron::Polyhedron(const Topology topol,
-			    Generator_System& gs,
-			    Recycle_Input)
+                            Generator_System& gs,
+                            Recycle_Input)
   : con_sys(topol, default_con_sys_repr),
     gen_sys(topol, default_gen_sys_repr),
     sat_c(),
@@ -269,15 +269,15 @@ PPL::Polyhedron::Polyhedron(const Topology topol,
   // Non-empty valid generator systems have a supporting point, at least.
   if (!gs.has_points())
     throw_invalid_generators((topol == NECESSARILY_CLOSED)
-			     ? "C_Polyhedron(gs, recycle)"
-			     : "NNC_Polyhedron(gs, recycle)", "gs");
+                             ? "C_Polyhedron(gs, recycle)"
+                             : "NNC_Polyhedron(gs, recycle)", "gs");
 
   const dimension_type gs_space_dim = gs.space_dimension();
   // Try to adapt `gs' to the required topology.
   if (!gs.adjust_topology_and_space_dimension(topol, gs_space_dim))
     throw_topology_incompatible((topol == NECESSARILY_CLOSED)
-				? "C_Polyhedron(gs, recycle)"
-				: "NNC_Polyhedron(gs, recycle)", "gs", gs);
+                                ? "C_Polyhedron(gs, recycle)"
+                                : "NNC_Polyhedron(gs, recycle)", "gs", gs);
 
   if (gs_space_dim > 0) {
     // Stealing the rows from `gs'.
@@ -346,48 +346,48 @@ PPL::Polyhedron::quick_equivalence_test(const Polyhedron& y) const {
     if (!x.has_something_pending() && !y.has_something_pending()) {
       bool css_normalized = false;
       if (x.constraints_are_minimized() && y.constraints_are_minimized()) {
-	// Equivalent minimized constraint systems have:
-	//  - the same number of constraints; ...
-	if (x.con_sys.num_rows() != y.con_sys.num_rows())
-	  return Polyhedron::TVB_FALSE;
-	//  - the same number of equalities; ...
-	dimension_type x_num_equalities = x.con_sys.num_equalities();
-	if (x_num_equalities != y.con_sys.num_equalities())
-	  return Polyhedron::TVB_FALSE;
-	//  - if there are no equalities, they have the same constraints.
-	//    Delay this test: try cheaper tests on generators first.
-	css_normalized = (x_num_equalities == 0);
+        // Equivalent minimized constraint systems have:
+        //  - the same number of constraints; ...
+        if (x.con_sys.num_rows() != y.con_sys.num_rows())
+          return Polyhedron::TVB_FALSE;
+        //  - the same number of equalities; ...
+        const dimension_type x_num_equalities = x.con_sys.num_equalities();
+        if (x_num_equalities != y.con_sys.num_equalities())
+          return Polyhedron::TVB_FALSE;
+        //  - if there are no equalities, they have the same constraints.
+        //    Delay this test: try cheaper tests on generators first.
+        css_normalized = (x_num_equalities == 0);
       }
 
       if (x.generators_are_minimized() && y.generators_are_minimized()) {
-	// Equivalent minimized generator systems have:
-	//  - the same number of generators; ...
-	if (x.gen_sys.num_rows() != y.gen_sys.num_rows())
-	  return Polyhedron::TVB_FALSE;
-	//  - the same number of lines; ...
-	const dimension_type x_num_lines = x.gen_sys.num_lines();
-	if (x_num_lines != y.gen_sys.num_lines())
-	  return Polyhedron::TVB_FALSE;
-	//  - if there are no lines, they have the same generators.
-	if (x_num_lines == 0) {
-	  // Sort the two systems and check for syntactic identity.
-	  x.obtain_sorted_generators();
-	  y.obtain_sorted_generators();
-	  if (x.gen_sys == y.gen_sys)
-	    return Polyhedron::TVB_TRUE;
-	  else
-	    return Polyhedron::TVB_FALSE;
-	}
+        // Equivalent minimized generator systems have:
+        //  - the same number of generators; ...
+        if (x.gen_sys.num_rows() != y.gen_sys.num_rows())
+          return Polyhedron::TVB_FALSE;
+        //  - the same number of lines; ...
+        const dimension_type x_num_lines = x.gen_sys.num_lines();
+        if (x_num_lines != y.gen_sys.num_lines())
+          return Polyhedron::TVB_FALSE;
+        //  - if there are no lines, they have the same generators.
+        if (x_num_lines == 0) {
+          // Sort the two systems and check for syntactic identity.
+          x.obtain_sorted_generators();
+          y.obtain_sorted_generators();
+          if (x.gen_sys == y.gen_sys)
+            return Polyhedron::TVB_TRUE;
+          else
+            return Polyhedron::TVB_FALSE;
+        }
       }
 
       if (css_normalized) {
-	// Sort the two systems and check for identity.
-	x.obtain_sorted_constraints();
-	y.obtain_sorted_constraints();
-	if (x.con_sys == y.con_sys)
-	    return Polyhedron::TVB_TRUE;
-	  else
-	    return Polyhedron::TVB_FALSE;
+        // Sort the two systems and check for identity.
+        x.obtain_sorted_constraints();
+        y.obtain_sorted_constraints();
+        if (x.con_sys == y.con_sys)
+            return Polyhedron::TVB_TRUE;
+          else
+            return Polyhedron::TVB_FALSE;
       }
     }
   }
@@ -438,24 +438,24 @@ PPL::Polyhedron::is_included_in(const Polyhedron& y) const {
     for (dimension_type i = cs.num_rows(); i-- > 0; ) {
       const Constraint& c = cs[i];
       if (c.is_inequality()) {
-	for (dimension_type j = gs.num_rows(); j-- > 0; ) {
-	  const Generator& g = gs[j];
-	  const int sp_sign = Scalar_Products::sign(c, g);
-	  if (g.is_line()) {
-	    if (sp_sign != 0)
-	      return false;
-	  }
-	  else
-	    // `g' is a ray or a point.
-	    if (sp_sign < 0)
-	      return false;
-	}
+        for (dimension_type j = gs.num_rows(); j-- > 0; ) {
+          const Generator& g = gs[j];
+          const int sp_sign = Scalar_Products::sign(c, g);
+          if (g.is_line()) {
+            if (sp_sign != 0)
+              return false;
+          }
+          else
+            // `g' is a ray or a point.
+            if (sp_sign < 0)
+              return false;
+        }
       }
       else {
-	// `c' is an equality.
-	for (dimension_type j = gs.num_rows(); j-- > 0; )
-	  if (Scalar_Products::sign(c, gs[j]) != 0)
-	    return false;
+        // `c' is an equality.
+        for (dimension_type j = gs.num_rows(); j-- > 0; )
+          if (Scalar_Products::sign(c, gs[j]) != 0)
+            return false;
       }
     }
   else {
@@ -465,51 +465,51 @@ PPL::Polyhedron::is_included_in(const Polyhedron& y) const {
       const Constraint& c = cs[i];
       switch (c.type()) {
       case Constraint::NONSTRICT_INEQUALITY:
-	for (dimension_type j = gs.num_rows(); j-- > 0; ) {
-	  const Generator& g = gs[j];
-	  const int sp_sign = Scalar_Products::reduced_sign(c, g);
-	  if (g.is_line()) {
-	    if (sp_sign != 0)
-	      return false;
-	  }
-	  else
-	    // `g' is a ray or a point or a closure point.
-	    if (sp_sign < 0)
-	      return false;
-	}
-	break;
+        for (dimension_type j = gs.num_rows(); j-- > 0; ) {
+          const Generator& g = gs[j];
+          const int sp_sign = Scalar_Products::reduced_sign(c, g);
+          if (g.is_line()) {
+            if (sp_sign != 0)
+              return false;
+          }
+          else
+            // `g' is a ray or a point or a closure point.
+            if (sp_sign < 0)
+              return false;
+        }
+        break;
       case Constraint::EQUALITY:
-	for (dimension_type j = gs.num_rows(); j-- > 0; )
-	  if (Scalar_Products::reduced_sign(c, gs[j]) != 0)
-	    return false;
-	break;
+        for (dimension_type j = gs.num_rows(); j-- > 0; )
+          if (Scalar_Products::reduced_sign(c, gs[j]) != 0)
+            return false;
+        break;
       case Constraint::STRICT_INEQUALITY:
-	for (dimension_type j = gs.num_rows(); j-- > 0; ) {
-	  const Generator& g = gs[j];
-	  const int sp_sign = Scalar_Products::reduced_sign(c, g);
-	  switch (g.type()) {
-	  case Generator::POINT:
-	    // If a point violates or saturates a strict inequality
-	    // (when ignoring the epsilon coefficients) then it is
-	    // not included in the polyhedron.
-	    if (sp_sign <= 0)
-	      return false;
-	    break;
-	  case Generator::LINE:
-	    // Lines have to saturate all constraints.
-	    if (sp_sign != 0)
-	      return false;
-	    break;
-	  case Generator::RAY:
-	    // Intentionally fall through.
-	  case Generator::CLOSURE_POINT:
-	    // The generator is a ray or closure point: usual test.
-	    if (sp_sign < 0)
-	      return false;
-	    break;
-	  }
-	}
-	break;
+        for (dimension_type j = gs.num_rows(); j-- > 0; ) {
+          const Generator& g = gs[j];
+          const int sp_sign = Scalar_Products::reduced_sign(c, g);
+          switch (g.type()) {
+          case Generator::POINT:
+            // If a point violates or saturates a strict inequality
+            // (when ignoring the epsilon coefficients) then it is
+            // not included in the polyhedron.
+            if (sp_sign <= 0)
+              return false;
+            break;
+          case Generator::LINE:
+            // Lines have to saturate all constraints.
+            if (sp_sign != 0)
+              return false;
+            break;
+          case Generator::RAY:
+            // Intentionally fall through.
+          case Generator::CLOSURE_POINT:
+            // The generator is a ray or closure point: usual test.
+            if (sp_sign < 0)
+              return false;
+            break;
+          }
+        }
+        break;
       }
     }
   }
@@ -520,14 +520,14 @@ PPL::Polyhedron::is_included_in(const Polyhedron& y) const {
 
 bool
 PPL::Polyhedron::bounds(const Linear_Expression& expr,
-			const bool from_above) const {
+                        const bool from_above) const {
   // The dimension of `expr' should not be greater than the dimension
   // of `*this'.
   const dimension_type expr_space_dim = expr.space_dimension();
   if (space_dim < expr_space_dim)
     throw_dimension_incompatible((from_above
-				  ? "bounds_from_above(e)"
-				  : "bounds_from_below(e)"), "e", expr);
+                                  ? "bounds_from_above(e)"
+                                  : "bounds_from_below(e)"), "e", expr);
 
   // A zero-dimensional or empty polyhedron bounds everything.
   if (space_dim == 0
@@ -543,11 +543,11 @@ PPL::Polyhedron::bounds(const Linear_Expression& expr,
     if (g.is_line_or_ray()) {
       const int sp_sign = Scalar_Products::homogeneous_sign(expr, g);
       if (sp_sign != 0
-	  && (g.is_line()
-	      || (from_above && sp_sign > 0)
-	      || (!from_above && sp_sign < 0)))
-	// `*this' does not bound `expr'.
-	return false;
+          && (g.is_line()
+              || (from_above && sp_sign > 0)
+              || (!from_above && sp_sign < 0)))
+        // `*this' does not bound `expr'.
+        return false;
     }
   }
   // No sources of unboundedness have been found for `expr'
@@ -557,17 +557,17 @@ PPL::Polyhedron::bounds(const Linear_Expression& expr,
 
 bool
 PPL::Polyhedron::max_min(const Linear_Expression& expr,
-			 const bool maximize,
-			 Coefficient& ext_n, Coefficient& ext_d,
-			 bool& included,
-			 Generator& g) const {
+                         const bool maximize,
+                         Coefficient& ext_n, Coefficient& ext_d,
+                         bool& included,
+                         Generator& g) const {
   // The dimension of `expr' should not be greater than the dimension
   // of `*this'.
   const dimension_type expr_space_dim = expr.space_dimension();
   if (space_dim < expr_space_dim)
     throw_dimension_incompatible((maximize
-				  ? "maximize(e, ...)"
-				  : "minimize(e, ...)"), "e", expr);
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
 
   // Deal with zero-dim polyhedra first.
   if (space_dim == 0) {
@@ -610,11 +610,11 @@ PPL::Polyhedron::max_min(const Linear_Expression& expr,
     if (gen_sys_i.is_line_or_ray()) {
       const int sp_sign = sgn(sp);
       if (sp_sign != 0
-	  && (gen_sys_i.is_line()
-	      || (maximize && sp_sign > 0)
-	      || (!maximize && sp_sign < 0)))
-	// `expr' is unbounded in `*this'.
-	return false;
+          && (gen_sys_i.is_line()
+              || (maximize && sp_sign > 0)
+              || (!maximize && sp_sign < 0)))
+        // `expr' is unbounded in `*this'.
+        return false;
     }
     else {
       // We have a point or a closure point.
@@ -627,21 +627,21 @@ PPL::Polyhedron::max_min(const Linear_Expression& expr,
       candidate.canonicalize();
       const bool g_is_point = gen_sys_i.is_point();
       if (first_candidate
-	  || (maximize
-	      && (candidate > extremum
-		  || (g_is_point
-		      && !ext_included
-		      && candidate == extremum)))
-	  || (!maximize
-	      && (candidate < extremum
-		  || (g_is_point
-		      && !ext_included
-		      && candidate == extremum)))) {
-	// We have a (new) candidate extremum.
-	first_candidate = false;
-	extremum = candidate;
-	ext_position = i;
-	ext_included = g_is_point;
+          || (maximize
+              && (candidate > extremum
+                  || (g_is_point
+                      && !ext_included
+                      && candidate == extremum)))
+          || (!maximize
+              && (candidate < extremum
+                  || (g_is_point
+                      && !ext_included
+                      && candidate == extremum)))) {
+        // We have a (new) candidate extremum.
+        first_candidate = false;
+        extremum = candidate;
+        ext_position = i;
+        ext_included = g_is_point;
       }
     }
   }
@@ -872,11 +872,11 @@ PPL::Polyhedron::update_sat_c() const {
       // and constraints are up-to-date.
       PPL_ASSERT(sp_sign >= 0);
       if (sp_sign > 0)
-	// `gen_sys[i]' satisfies (without saturate) `con_sys[j]'.
-	x.sat_c[i].set(j);
+        // `gen_sys[i]' satisfies (without saturate) `con_sys[j]'.
+        x.sat_c[i].set(j);
       else
-	// `gen_sys[i]' saturates `con_sys[j]'.
-	x.sat_c[i].clear(j);
+        // `gen_sys[i]' saturates `con_sys[j]'.
+        x.sat_c[i].clear(j);
     }
   x.set_sat_c_up_to_date();
 }
@@ -904,11 +904,11 @@ PPL::Polyhedron::update_sat_g() const {
       // and constraints are up-to-date.
       PPL_ASSERT(sp_sign >= 0);
       if (sp_sign > 0)
-	// `gen_sys[j]' satisfies (without saturate) `con_sys[i]'.
-	x.sat_g[i].set(j);
+        // `gen_sys[j]' satisfies (without saturate) `con_sys[i]'.
+        x.sat_g[i].set(j);
       else
-	// `gen_sys[j]' saturates `con_sys[i]'.
-	x.sat_g[i].clear(j);
+        // `gen_sys[j]' saturates `con_sys[i]'.
+        x.sat_g[i].clear(j);
     }
   x.set_sat_g_up_to_date();
 }
@@ -1126,9 +1126,12 @@ PPL::Polyhedron::strongly_minimize_constraints() const {
       PPL_UNREACHABLE;
       break;
     }
-  Bit_Row sat_lines_and_rays(sat_all_but_points, sat_all_but_closure_points);
-  Bit_Row sat_lines_and_closure_points(sat_all_but_rays, sat_all_but_points);
-  Bit_Row sat_lines(sat_lines_and_rays, sat_lines_and_closure_points);
+  const Bit_Row
+    sat_lines_and_rays(sat_all_but_points, sat_all_but_closure_points);
+  const Bit_Row
+    sat_lines_and_closure_points(sat_all_but_rays, sat_all_but_points);
+  const Bit_Row
+    sat_lines(sat_lines_and_rays, sat_lines_and_closure_points);
 
   // These flags are maintained to later decide if we have to add the
   // eps_leq_one constraint and whether or not the constraint system
@@ -1150,29 +1153,29 @@ PPL::Polyhedron::strongly_minimize_constraints() const {
       Bit_Row sat_ci;
       sat_ci.union_assign(sat[i], sat_lines_and_closure_points);
       if (sat_ci == sat_lines) {
-	// It is saturated by no closure points.
-	if (!found_eps_leq_one) {
-	  // Check if it is the eps_leq_one constraint.
+        // It is saturated by no closure points.
+        if (!found_eps_leq_one) {
+          // Check if it is the eps_leq_one constraint.
           const Constraint& c = cs[i];
-	  if (c.expression().all_homogeneous_terms_are_zero()
+          if (c.expression().all_homogeneous_terms_are_zero()
               && (c.expression().inhomogeneous_term() + c.epsilon_coefficient() == 0)) {
-	    // We found the eps_leq_one constraint.
-	    found_eps_leq_one = true;
-	    // Consider next constraint.
-	    ++i;
-	    continue;
-	  }
-	}
-	// Here `cs[i]' is not the eps_leq_one constraint,
-	// so it is eps-redundant.
-	// Remove it, while keeping `sat_g' consistent.
-	cs.remove_row(i, false);
-	swap(sat[i], sat[cs.num_rows()]);
-	// The constraint system is changed.
-	changed = true;
-	// Continue by considering next constraint,
-	// which is already in place due to the swap.
-	continue;
+            // We found the eps_leq_one constraint.
+            found_eps_leq_one = true;
+            // Consider next constraint.
+            ++i;
+            continue;
+          }
+        }
+        // Here `cs[i]' is not the eps_leq_one constraint,
+        // so it is eps-redundant.
+        // Remove it, while keeping `sat_g' consistent.
+        cs.remove_row(i, false);
+        swap(sat[i], sat[cs.num_rows()]);
+        // The constraint system is changed.
+        changed = true;
+        // Continue by considering next constraint,
+        // which is already in place due to the swap.
+        continue;
       }
       // Now we check if there exists another strict inequality
       // constraint having a superset of its saturators,
@@ -1180,21 +1183,21 @@ PPL::Polyhedron::strongly_minimize_constraints() const {
       sat_ci.union_assign(sat[i], sat_all_but_points);
       bool eps_redundant = false;
       for (dimension_type j = 0; j < cs.num_rows(); ++j)
-	if (i != j && cs[j].is_strict_inequality()
-	    && subset_or_equal(sat[j], sat_ci)) {
-	  // Constraint `cs[i]' is eps-redundant:
-	  // remove it, while keeping `sat_g' consistent.
-	  cs.remove_row(i, false);
-	  swap(sat[i], sat[cs.num_rows()]);
-	  eps_redundant = true;
-	  // The constraint system is changed.
-	  changed = true;
-	  break;
-	}
+        if (i != j && cs[j].is_strict_inequality()
+            && subset_or_equal(sat[j], sat_ci)) {
+          // Constraint `cs[i]' is eps-redundant:
+          // remove it, while keeping `sat_g' consistent.
+          cs.remove_row(i, false);
+          swap(sat[i], sat[cs.num_rows()]);
+          eps_redundant = true;
+          // The constraint system is changed.
+          changed = true;
+          break;
+        }
       // Continue with next constraint, which is already in place
       // due to the swap if we have found an eps-redundant constraint.
       if (!eps_redundant)
-	++i;
+        ++i;
     }
     else
       // `cs[i]' is not a strict inequality: consider next constraint.
@@ -1220,23 +1223,23 @@ PPL::Polyhedron::strongly_minimize_constraints() const {
       // topology of `cs' even on exceptional execution path.
       cs.mark_as_necessarily_closed();
       try {
-	lp.add_space_dimensions_and_embed(cs.space_dimension());
-	lp.add_constraints(cs);
-	cs.mark_as_not_necessarily_closed();
+        lp.add_space_dimensions_and_embed(cs.space_dimension());
+        lp.add_constraints(cs);
+        cs.mark_as_not_necessarily_closed();
       }
       catch (...) {
-	cs.mark_as_not_necessarily_closed();
-	throw;
+        cs.mark_as_not_necessarily_closed();
+        throw;
       }
       // The objective function is `epsilon'.
       lp.set_objective_function(Variable(x.space_dim));
       lp.set_optimization_mode(MAXIMIZATION);
-      MIP_Problem_Status status = lp.solve();
+      const MIP_Problem_Status status = lp.solve();
       PPL_ASSERT(status != UNFEASIBLE_MIP_PROBLEM);
       // If the epsilon dimension is actually unbounded,
       // then add the eps_leq_one constraint.
       if (status == UNBOUNDED_MIP_PROBLEM)
-	cs.insert(Constraint::epsilon_leq_one());
+        cs.insert(Constraint::epsilon_leq_one());
     }
   }
 
@@ -1293,36 +1296,36 @@ PPL::Polyhedron::strongly_minimize_generators() const {
     if (g.is_point()) {
       // Compute the Bit_Row corresponding to the candidate point
       // when strict inequality constraints are ignored.
-      Bit_Row sat_gs_i(sat[i], sat_all_but_strict_ineq);
+      const Bit_Row sat_gs_i(sat[i], sat_all_but_strict_ineq);
       // Check if the candidate point is actually eps-redundant:
       // namely, if there exists another point that saturates
       // all the non-strict inequalities saturated by the candidate.
       bool eps_redundant = false;
       for (dimension_type j = n_lines; j < gs_rows; ++j) {
-        Generator& g2 = gs.sys.rows[j];
-	if (i != j && g2.is_point() && subset_or_equal(sat[j], sat_gs_i)) {
-	  // Point `g' is eps-redundant:
-	  // move it to the bottom of the generator system,
-	  // while keeping `sat_c' consistent.
-	  --gs_rows;
+        const Generator& g2 = gs.sys.rows[j];
+        if (i != j && g2.is_point() && subset_or_equal(sat[j], sat_gs_i)) {
+          // Point `g' is eps-redundant:
+          // move it to the bottom of the generator system,
+          // while keeping `sat_c' consistent.
+          --gs_rows;
           swap(g, gs.sys.rows[gs_rows]);
-	  swap(sat[i], sat[gs_rows]);
-	  eps_redundant = true;
-	  changed = true;
-	  break;
-	}
+          swap(sat[i], sat[gs_rows]);
+          eps_redundant = true;
+          changed = true;
+          break;
+        }
       }
       if (!eps_redundant) {
-	// Let all point encodings have epsilon coordinate 1.
-	if (g.epsilon_coefficient() != g.expr.inhomogeneous_term()) {
-	  g.set_epsilon_coefficient(g.expr.inhomogeneous_term());
-	  // Enforce normalization.
-	  g.expr.normalize();
+        // Let all point encodings have epsilon coordinate 1.
+        if (g.epsilon_coefficient() != g.expr.inhomogeneous_term()) {
+          g.set_epsilon_coefficient(g.expr.inhomogeneous_term());
+          // Enforce normalization.
+          g.expr.normalize();
           PPL_ASSERT(g.OK());
-	  changed = true;
-	}
-	// Consider next generator.
-	++i;
+          changed = true;
+        }
+        // Consider next generator.
+        ++i;
       }
     }
     else
@@ -1382,7 +1385,7 @@ PPL::Polyhedron::refine_no_check(const Constraint& c) {
     // However, by barely invoking `con_sys.insert(c)' we would
     // cause a change in the topology of `con_sys', which is wrong.
     // Thus, we insert a "topology corrected" copy of `c'.
-    Linear_Expression nc_expr = Linear_Expression(c);
+    const Linear_Expression nc_expr(c.expression());
     if (c.is_equality())
       if (adding_pending)
         con_sys.insert_pending(nc_expr == 0);
@@ -1853,7 +1856,8 @@ PPL::Polyhedron::BHZ09_NNC_poly_hull_assign_if_exact(const Polyhedron& y) {
     const Constraint& x_cs_i = x_cs[i];
     PPL_ASSERT(x_cs_i.is_strict_inequality());
     // Build the equality constraint induced by x_cs_i.
-    Constraint eq_i(Linear_Expression(x_cs_i) == 0);
+    const Linear_Expression expr(x_cs_i.expression());
+    const Constraint eq_i(expr == 0);
     PPL_ASSERT(!(ub.relation_with(eq_i)
                  .implies(Poly_Con_Relation::is_disjoint())));
     Polyhedron ub_inters_hyperplane(ub);
@@ -1871,7 +1875,7 @@ PPL::Polyhedron::BHZ09_NNC_poly_hull_assign_if_exact(const Polyhedron& y) {
     const Constraint& y_cs_i = y_cs[i];
     PPL_ASSERT(y_cs_i.is_strict_inequality());
     // Build the equality constraint induced by y_cs_i.
-    Constraint eq_i(Linear_Expression(y_cs_i) == 0);
+    const Constraint eq_i(Linear_Expression(y_cs_i.expression()) == 0);
     PPL_ASSERT(!(ub.relation_with(eq_i)
                  .implies(Poly_Con_Relation::is_disjoint())));
     Polyhedron ub_inters_hyperplane(ub);
@@ -2081,7 +2085,7 @@ PPL::Polyhedron::BFT00_poly_hull_assign_if_exact(const Polyhedron& y) {
 
 void
 PPL::Polyhedron::drop_some_non_integer_points(const Variables_Set* vars_p,
-					      Complexity_Class complexity) {
+                                              Complexity_Class complexity) {
   // There is nothing to do for an empty set of variables.
   if (vars_p != 0 && vars_p->empty())
     return;
@@ -2129,28 +2133,39 @@ PPL::Polyhedron::drop_some_non_integer_points(const Variables_Set* vars_p,
 
   const bool con_sys_was_sorted = con_sys.is_sorted();
 
+  Variables_Set other_vars;
+  if (vars_p != 0) {
+    // Compute the complement of `*vars_p'.
+    for (dimension_type i = 0; i < space_dim; ++i) {
+      if (vars_p->find(i) == vars_p->end())
+        other_vars.insert(Variable(i));
+    }
+  }
+
   for (dimension_type j = con_sys.sys.rows.size(); j-- > 0; ) {
     Constraint& c = con_sys.sys.rows[j];
     if (c.is_tautological())
       continue;
 
-    if (vars_p != 0) {
-      if (!c.expression().all_zeroes(*vars_p))
-        goto next_constraint;
+    if (!other_vars.empty()) {
+      // Skip constraints having a nonzero coefficient for a variable
+      // that does not occurr in the input set.
+      if (!c.expression().all_zeroes(other_vars))
+        continue;
     }
 
     if (!is_necessarily_closed()) {
       // Transform all strict inequalities into non-strict ones,
       // with the inhomogeneous term incremented by 1.
       if (c.epsilon_coefficient() < 0) {
-	c.set_epsilon_coefficient(0);
+        c.set_epsilon_coefficient(0);
         Linear_Expression& e = c.expr;
         e.set_inhomogeneous_term(e.inhomogeneous_term() - 1);
-	// Enforce normalization.
-	// FIXME: is this really necessary?
-	e.normalize();
+        // Enforce normalization.
+        // FIXME: is this really necessary?
+        e.normalize();
         PPL_ASSERT(c.OK());
-	changed = true;
+        changed = true;
       }
     }
 
@@ -2162,8 +2177,8 @@ PPL::Polyhedron::drop_some_non_integer_points(const Variables_Set* vars_p,
 
       // If we have an equality, the polyhedron becomes empty.
       if (c.is_equality()) {
-	set_empty();
-	return;
+        set_empty();
+        return;
       }
 
       // Divide the inhomogeneous coefficients by the GCD.
@@ -2174,26 +2189,22 @@ PPL::Polyhedron::drop_some_non_integer_points(const Variables_Set* vars_p,
       const int c_0_sign = sgn(c_0);
       c_0 /= gcd;
       if (c_0_sign < 0)
-	--c_0;
+        --c_0;
       c.expr.set_inhomogeneous_term(c_0);
       PPL_ASSERT(c.OK());
       changed = true;
     }
-
-    next_constraint: ;
   }
 
   con_sys.set_sorted(!changed && con_sys_was_sorted);
   PPL_ASSERT(con_sys.sys.OK());
 
   if (changed) {
-    if (!is_necessarily_closed())
+    if (is_necessarily_closed())
+      con_sys.insert(Constraint::zero_dim_positivity());
+    else
       con_sys.insert(Constraint::epsilon_leq_one());
 
-    // FIXME: make sure this is correct (otherwise it should be removed).
-    if (is_necessarily_closed() && con_sys_was_sorted)
-      con_sys.set_sorted(true);
-
     // After changing the system of constraints, the generators
     // are no longer up-to-date and the constraints are no longer
     // minimized.
@@ -2205,7 +2216,7 @@ PPL::Polyhedron::drop_some_non_integer_points(const Variables_Set* vars_p,
 
 void
 PPL::Polyhedron::throw_invalid_argument(const char* method,
-					const char* reason) const {
+                                        const char* reason) const {
   std::ostringstream s;
   s << "PPL::";
   if (is_necessarily_closed())
@@ -2219,8 +2230,8 @@ PPL::Polyhedron::throw_invalid_argument(const char* method,
 
 void
 PPL::Polyhedron::throw_topology_incompatible(const char* method,
-					     const char* ph_name,
-					     const Polyhedron& ph) const {
+                                             const char* ph_name,
+                                             const Polyhedron& ph) const {
   std::ostringstream s;
   s << "PPL::";
   if (is_necessarily_closed())
@@ -2239,8 +2250,8 @@ PPL::Polyhedron::throw_topology_incompatible(const char* method,
 
 void
 PPL::Polyhedron::throw_topology_incompatible(const char* method,
-					     const char* c_name,
-					     const Constraint&) const {
+                                             const char* c_name,
+                                             const Constraint&) const {
   PPL_ASSERT(is_necessarily_closed());
   std::ostringstream s;
   s << "PPL::C_Polyhedron::" << method << ":" << std::endl
@@ -2250,8 +2261,8 @@ PPL::Polyhedron::throw_topology_incompatible(const char* method,
 
 void
 PPL::Polyhedron::throw_topology_incompatible(const char* method,
-					     const char* g_name,
-					     const Generator&) const {
+                                             const char* g_name,
+                                             const Generator&) const {
   PPL_ASSERT(is_necessarily_closed());
   std::ostringstream s;
   s << "PPL::C_Polyhedron::" << method << ":" << std::endl
@@ -2261,8 +2272,8 @@ PPL::Polyhedron::throw_topology_incompatible(const char* method,
 
 void
 PPL::Polyhedron::throw_topology_incompatible(const char* method,
-					     const char* cs_name,
-					     const Constraint_System&) const {
+                                             const char* cs_name,
+                                             const Constraint_System&) const {
   PPL_ASSERT(is_necessarily_closed());
   std::ostringstream s;
   s << "PPL::C_Polyhedron::" << method << ":" << std::endl
@@ -2272,8 +2283,8 @@ PPL::Polyhedron::throw_topology_incompatible(const char* method,
 
 void
 PPL::Polyhedron::throw_topology_incompatible(const char* method,
-					     const char* gs_name,
-					     const Generator_System&) const {
+                                             const char* gs_name,
+                                             const Generator_System&) const {
   std::ostringstream s;
   s << "PPL::C_Polyhedron::" << method << ":" << std::endl
     << gs_name << " contains closure points.";
@@ -2282,8 +2293,8 @@ PPL::Polyhedron::throw_topology_incompatible(const char* method,
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* other_name,
-					      dimension_type other_dim) const {
+                                              const char* other_name,
+                                              dimension_type other_dim) const {
   std::ostringstream s;
   s << "PPL::"
     << (is_necessarily_closed() ? "C_" : "NNC_")
@@ -2295,8 +2306,8 @@ PPL::Polyhedron::throw_dimension_incompatible(const char* method,
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* ph_name,
-					      const Polyhedron& ph) const {
+                                              const char* ph_name,
+                                              const Polyhedron& ph) const {
   throw_dimension_incompatible(method, ph_name, ph.space_dimension());
 }
 
@@ -2310,29 +2321,29 @@ PPL::Polyhedron
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* c_name,
-					      const Constraint& c) const {
+                                              const char* c_name,
+                                              const Constraint& c) const {
   throw_dimension_incompatible(method, c_name, c.space_dimension());
 }
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* g_name,
-					      const Generator& g) const {
+                                              const char* g_name,
+                                              const Generator& g) const {
   throw_dimension_incompatible(method, g_name, g.space_dimension());
 }
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* cg_name,
-					      const Congruence& cg) const {
+                                              const char* cg_name,
+                                              const Congruence& cg) const {
   throw_dimension_incompatible(method, cg_name, cg.space_dimension());
 }
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* cs_name,
-					      const Constraint_System& cs) const {
+                                              const char* cs_name,
+                                              const Constraint_System& cs) const {
   throw_dimension_incompatible(method, cs_name, cs.space_dimension());
 }
 
@@ -2354,8 +2365,8 @@ PPL::Polyhedron
 
 void
 PPL::Polyhedron::throw_dimension_incompatible(const char* method,
-					      const char* var_name,
-					      const Variable var) const {
+                                              const char* var_name,
+                                              const Variable var) const {
   std::ostringstream s;
   s << "PPL::";
   if (is_necessarily_closed())
@@ -2371,7 +2382,7 @@ PPL::Polyhedron::throw_dimension_incompatible(const char* method,
 void
 PPL::Polyhedron::
 throw_dimension_incompatible(const char* method,
-			     dimension_type required_space_dim) const {
+                             dimension_type required_space_dim) const {
   std::ostringstream s;
   s << "PPL::";
   if (is_necessarily_closed())
@@ -2388,9 +2399,9 @@ PPL::dimension_type
 PPL::Polyhedron::check_space_dimension_overflow(const dimension_type dim,
                                                 const dimension_type max,
                                                 const Topology topol,
-						const char* method,
-						const char* reason) {
-  const char* domain = (topol == NECESSARILY_CLOSED)
+                                                const char* method,
+                                                const char* reason) {
+  const char* const domain = (topol == NECESSARILY_CLOSED)
     ? "PPL::C_Polyhedron::" : "PPL::NNC_Polyhedron::";
   return PPL::check_space_dimension_overflow(dim, max, domain, method, reason);
 }
@@ -2398,15 +2409,15 @@ PPL::Polyhedron::check_space_dimension_overflow(const dimension_type dim,
 PPL::dimension_type
 PPL::Polyhedron::check_space_dimension_overflow(const dimension_type dim,
                                                 const Topology topol,
-						const char* method,
-						const char* reason) {
+                                                const char* method,
+                                                const char* reason) {
   return check_space_dimension_overflow(dim, Polyhedron::max_space_dimension(),
                                         topol, method, reason);
 }
 
 void
 PPL::Polyhedron::throw_invalid_generator(const char* method,
-					 const char* g_name) const {
+                                         const char* g_name) const {
   std::ostringstream s;
   s << "PPL::";
   if (is_necessarily_closed())
@@ -2421,7 +2432,7 @@ PPL::Polyhedron::throw_invalid_generator(const char* method,
 
 void
 PPL::Polyhedron::throw_invalid_generators(const char* method,
-					  const char* gs_name) const {
+                                          const char* gs_name) const {
   std::ostringstream s;
   s << "PPL::";
   if (is_necessarily_closed())
diff --git a/src/Polyhedron_public.cc b/src/Polyhedron_public.cc
index b9b9a10..0cebe75 100644
--- a/src/Polyhedron_public.cc
+++ b/src/Polyhedron_public.cc
@@ -1,6 +1,6 @@
 /* Polyhedron class implementation (non-inline public functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,12 +22,12 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Polyhedron.defs.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "MIP_Problem.defs.hh"
+#include "Polyhedron_defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "MIP_Problem_defs.hh"
 #include "wrap_assign.hh"
 #include "assert.hh"
 #include <cstdlib>
@@ -65,7 +65,7 @@ PPL::Polyhedron::affine_dimension() const {
   const Constraint_System& cs = minimized_constraints();
   dimension_type d = space_dim;
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     if (i->is_equality())
       --d;
   return d;
@@ -209,15 +209,15 @@ PPL::Polyhedron::relation_with(const Constraint& c) const {
   if (space_dim == 0) {
     if (c.is_inconsistent())
       if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
-	// The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
-	// thus, the zero-dimensional point also saturates it.
-	return Poly_Con_Relation::saturates()
-	  && Poly_Con_Relation::is_disjoint();
+        // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
+        // thus, the zero-dimensional point also saturates it.
+        return Poly_Con_Relation::saturates()
+          && Poly_Con_Relation::is_disjoint();
       else
-	return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
     else if (c.is_equality() || c.inhomogeneous_term() == 0)
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
     else
       // The zero-dimensional point saturates
       // neither the positivity constraint 1 >= 0,
@@ -263,7 +263,7 @@ PPL::Polyhedron::relation_with(const Generator& g) const {
 
 PPL::Poly_Con_Relation
 PPL::Polyhedron::relation_with(const Congruence& cg) const {
-  dimension_type cg_space_dim = cg.space_dimension();
+  const dimension_type cg_space_dim = cg.space_dimension();
   // Dimension-compatibility check.
   if (space_dim < cg_space_dim)
     throw_dimension_incompatible("relation_with(cg)", "cg", cg);
@@ -283,7 +283,7 @@ PPL::Polyhedron::relation_with(const Congruence& cg) const {
       return Poly_Con_Relation::is_disjoint();
     else
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
   }
 
   if ((has_pending_constraints() && !process_pending_constraints())
@@ -294,8 +294,8 @@ PPL::Polyhedron::relation_with(const Congruence& cg) const {
       && Poly_Con_Relation::is_disjoint();
 
   // Build the equality corresponding to the congruence (ignoring the modulus).
-  Linear_Expression expr = Linear_Expression(cg);
-  Constraint c(expr == 0);
+  Linear_Expression expr(cg.expression());
+  const Constraint c(expr == 0);
 
   // The polyhedron is non-empty so that there exists a point.
   // For an arbitrary generator point, compute the scalar product with
@@ -329,9 +329,9 @@ PPL::Polyhedron::relation_with(const Congruence& cg) const {
 
   // Build first halfspace constraint.
   const bool positive = (signed_distance > 0);
-  Constraint first_halfspace = positive ? (expr >= 0) : (expr <= 0);
+  const Constraint first_halfspace = positive ? (expr >= 0) : (expr <= 0);
 
-  Poly_Con_Relation first_rels = relation_with(first_halfspace);
+  const Poly_Con_Relation first_rels = relation_with(first_halfspace);
   PPL_ASSERT(!first_rels.implies(Poly_Con_Relation::saturates())
              && !first_rels.implies(Poly_Con_Relation::is_disjoint()));
   if (first_rels.implies(Poly_Con_Relation::strictly_intersects()))
@@ -342,10 +342,10 @@ PPL::Polyhedron::relation_with(const Congruence& cg) const {
     expr -= modulus;
   else
     expr += modulus;
-  Constraint second_halfspace = positive ? (expr <= 0) : (expr >= 0);
+  const Constraint second_halfspace = positive ? (expr <= 0) : (expr >= 0);
 
   PPL_ASSERT(first_rels == Poly_Con_Relation::is_included());
-  Poly_Con_Relation second_rels = relation_with(second_halfspace);
+  const Poly_Con_Relation second_rels = relation_with(second_halfspace);
   PPL_ASSERT(!second_rels.implies(Poly_Con_Relation::saturates())
              && !second_rels.implies(Poly_Con_Relation::is_disjoint()));
   if (second_rels.implies(Poly_Con_Relation::strictly_intersects()))
@@ -367,7 +367,7 @@ PPL::Polyhedron::is_universe() const {
     // Search for a constraint that is not a tautology.
     for (dimension_type i = con_sys.num_rows(); i-- > 0; )
       if (!con_sys[i].is_tautological())
-	return false;
+        return false;
     // All the constraints are tautologies.
     return true;
   }
@@ -406,13 +406,13 @@ PPL::Polyhedron::is_universe() const {
     for (dimension_type i = first_pending; i < gs_num_rows; ++i)
       switch (gen_sys[i].type()) {
       case Generator::RAY:
-	++num_pending_rays;
-	break;
+        ++num_pending_rays;
+        break;
       case Generator::LINE:
-	++num_pending_lines;
-	break;
+        ++num_pending_lines;
+        break;
       default:
-	break;
+        break;
       }
     // If no pending rays and lines were found,
     // then it is not the universe polyhedron.
@@ -422,11 +422,11 @@ PPL::Polyhedron::is_universe() const {
     // we assume they are all linearly independent).
     if (num_lines + num_pending_lines < space_dim) {
       const dimension_type num_dims_missing
-	= space_dim - (num_lines + num_pending_lines);
+        = space_dim - (num_lines + num_pending_lines);
       // In order to span an n dimensional space (where n = num_dims_missing),
       // at least n+1 rays are needed.
       if (num_rays + num_pending_rays <= num_dims_missing)
-	return false;
+        return false;
     }
   }
   else {
@@ -441,7 +441,7 @@ PPL::Polyhedron::is_universe() const {
       // an n dimensional space (where n = space_dim - num_lines),
       // at least n+1 rays are needed.
       if (num_lines < space_dim && num_lines + num_rays <= space_dim)
-	return false;
+        return false;
   }
 
   // We need the polyhedron in minimal form.
@@ -456,8 +456,8 @@ PPL::Polyhedron::is_universe() const {
   else {
     // NNC polyhedron.
     if (con_sys.num_rows() != 2
-	|| con_sys[0].is_equality()
-	|| con_sys[1].is_equality())
+        || con_sys[0].is_equality()
+        || con_sys[1].is_equality())
       return false;
     else {
       // If the system of constraints contains two rows that
@@ -522,18 +522,18 @@ PPL::Polyhedron::is_topologically_closed() const {
     for (dimension_type i = n_rows; i-- > n_lines; ) {
       const Generator& gen_sys_i = gen_sys[i];
       if (gen_sys_i.is_closure_point()) {
-	bool gen_sys_i_has_no_matching_point = true;
-	for (dimension_type j = n_rows; j-- > n_lines; ) {
-	  const Generator& gen_sys_j = gen_sys[j];
-	  if (i != j
-	      && gen_sys_j.is_point()
-	      && gen_sys_i.is_matching_closure_point(gen_sys_j)) {
-	    gen_sys_i_has_no_matching_point = false;
-	    break;
-	  }
-	}
-	if (gen_sys_i_has_no_matching_point)
-	  return false;
+        bool gen_sys_i_has_no_matching_point = true;
+        for (dimension_type j = n_rows; j-- > n_lines; ) {
+          const Generator& gen_sys_j = gen_sys[j];
+          if (i != j
+              && gen_sys_j.is_point()
+              && gen_sys_i.is_matching_closure_point(gen_sys_j)) {
+            gen_sys_i_has_no_matching_point = false;
+            break;
+          }
+        }
+        if (gen_sys_i_has_no_matching_point)
+          return false;
       }
     }
     // All closure points are matched.
@@ -568,26 +568,26 @@ PPL::Polyhedron::contains_integer_point() const {
   if (generators_are_up_to_date())
     for (dimension_type i = gen_sys.num_rows(); i-- > 0; )
       if (gen_sys[i].is_point() && gen_sys[i].divisor() == 1)
-	return true;
+        return true;
 
   const Constraint_System& cs = constraints();
 #if 0 // TEMPORARILY DISABLED.
   MIP_Problem mip(space_dim,
-		  cs.begin(), cs.end(),
-		  Variables_Set(Variable(0), Variable(space_dim-1)));
+                  cs.begin(), cs.end(),
+                  Variables_Set(Variable(0), Variable(space_dim-1)));
 #else
   // FIXME: temporary workaround, to be removed as soon as the MIP
   // problem class will correctly and precisely handle
   // ((strict) in-) equality constraints having all integer variables.
   MIP_Problem mip(space_dim);
   mip.add_to_integer_space_dimensions(Variables_Set(Variable(0),
-						    Variable(space_dim-1)));
+                                                    Variable(space_dim-1)));
   PPL_DIRTY_TEMP_COEFFICIENT(homogeneous_gcd);
   PPL_DIRTY_TEMP_COEFFICIENT(gcd);
   PPL_DIRTY_TEMP(mpq_class, rational_inhomogeneous);
   PPL_DIRTY_TEMP_COEFFICIENT(tightened_inhomogeneous);
   for (Constraint_System::const_iterator cs_i = cs.begin(),
-	 cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
+         cs_end = cs.end(); cs_i != cs_end; ++cs_i) {
     const Constraint& c = *cs_i;
     const Constraint::Type c_type = c.type();
     const Coefficient& inhomogeneous = c.inhomogeneous_term();
@@ -602,65 +602,65 @@ PPL::Polyhedron::contains_integer_point() const {
         PPL_ASSERT(c.is_inconsistent());
         return false;
       }
-      Linear_Expression le(c);
+      Linear_Expression le(c.expression());
       if (homogeneous_gcd != 1)
         le /= homogeneous_gcd;
       // Further tighten the constraint if the inhomogeneous term
       // was integer, i.e., if `homogeneous_gcd' divides `inhomogeneous'.
       gcd_assign(gcd, homogeneous_gcd, inhomogeneous);
       if (gcd == homogeneous_gcd)
-	le -= 1;
+        le -= 1;
       mip.add_constraint(le >= 0);
     }
     else {
       // Equality or non-strict inequality.
       // If possible, avoid useless gcd computations.
       if (inhomogeneous == 0)
-	// The inhomogeneous term cannot be tightened.
-	mip.add_constraint(c);
+        // The inhomogeneous term cannot be tightened.
+        mip.add_constraint(c);
       else {
-	// Compute the GCD of the coefficients of c
-	// (disregarding the inhomogeneous term)
-	// to see whether or not the inhomogeneous term can be tightened.
-	homogeneous_gcd = c.expression().gcd(1, space_dim + 1);
+        // Compute the GCD of the coefficients of c
+        // (disregarding the inhomogeneous term)
+        // to see whether or not the inhomogeneous term can be tightened.
+        homogeneous_gcd = c.expression().gcd(1, space_dim + 1);
         if (homogeneous_gcd == 0) {
           // NOTE: since tautological constraints are already filtered away
           // by iterators, here we must have an inconsistent constraint.
           PPL_ASSERT(c.is_inconsistent());
           return false;
         }
-	else if (homogeneous_gcd == 1)
-	  // The normalized inhomogeneous term is integer:
-	  // add the constraint as-is.
-	  mip.add_constraint(c);
-	else {
-	  PPL_ASSERT(homogeneous_gcd > 1);
-	  // Here the normalized inhomogeneous term is rational:
-	  // the constraint has to be tightened.
+        else if (homogeneous_gcd == 1)
+          // The normalized inhomogeneous term is integer:
+          // add the constraint as-is.
+          mip.add_constraint(c);
+        else {
+          PPL_ASSERT(homogeneous_gcd > 1);
+          // Here the normalized inhomogeneous term is rational:
+          // the constraint has to be tightened.
 #ifndef NDEBUG
-	  // `homogeneous_gcd' does not divide `inhomogeneous'.
-	  // FIXME: add a divisibility test for Coefficient.
-	  gcd_assign(gcd, homogeneous_gcd, inhomogeneous);
-	  PPL_ASSERT(gcd == 1);
+          // `homogeneous_gcd' does not divide `inhomogeneous'.
+          // FIXME: add a divisibility test for Coefficient.
+          gcd_assign(gcd, homogeneous_gcd, inhomogeneous);
+          PPL_ASSERT(gcd == 1);
 #endif
-	  if (c.type() == Constraint::EQUALITY)
-	    return false;
-	  // Extract the homogeneous part of the constraint.
-	  Linear_Expression le = Linear_Expression(c);
-	  le -= inhomogeneous;
-	  // Tighten the inhomogeneous term.
-	  assign_r(rational_inhomogeneous.get_num(),
-		   inhomogeneous, ROUND_NOT_NEEDED);
-	  assign_r(rational_inhomogeneous.get_den(),
-		   homogeneous_gcd, ROUND_NOT_NEEDED);
-	  // Note: canonicalization is not needed (as gcd == 1).
-	  PPL_ASSERT(is_canonical(rational_inhomogeneous));
-	  assign_r(tightened_inhomogeneous,
-		   rational_inhomogeneous, ROUND_DOWN);
-	  tightened_inhomogeneous *= homogeneous_gcd;
-	  le += tightened_inhomogeneous;
-	  mip.add_constraint(le >= 0);
-	}
+          if (c.type() == Constraint::EQUALITY)
+            return false;
+          // Extract the homogeneous part of the constraint.
+          Linear_Expression le(c.expression());
+          le -= inhomogeneous;
+          // Tighten the inhomogeneous term.
+          assign_r(rational_inhomogeneous.get_num(),
+                   inhomogeneous, ROUND_NOT_NEEDED);
+          assign_r(rational_inhomogeneous.get_den(),
+                   homogeneous_gcd, ROUND_NOT_NEEDED);
+          // Note: canonicalization is not needed (as gcd == 1).
+          PPL_ASSERT(is_canonical(rational_inhomogeneous));
+          assign_r(tightened_inhomogeneous,
+                   rational_inhomogeneous, ROUND_DOWN);
+          tightened_inhomogeneous *= homogeneous_gcd;
+          le += tightened_inhomogeneous;
+          mip.add_constraint(le >= 0);
+        }
       }
     }
   }
@@ -696,11 +696,11 @@ PPL::Polyhedron::constrains(const Variable var) const {
       dimension_type num_lines = 0;
       const dimension_type first_pending = gen_sys.first_pending_row();
       for (dimension_type i = first_pending; i-- > 0; )
-	if (gen_sys[i].is_line())
-	  ++num_lines;
+        if (gen_sys[i].is_line())
+          ++num_lines;
 
       if (num_lines == space_dim)
-	return false;
+        return false;
     }
 
     // Scan generators: perhaps we will find a generator equivalent to
@@ -712,8 +712,8 @@ PPL::Polyhedron::constrains(const Variable var) const {
     for (dimension_type i = gen_sys.num_rows(); i-- > 0; ) {
       const Generator& gen_sys_i = gen_sys[i];
       if (gen_sys_i.is_line_or_ray()) {
-	const int sign = sgn(gen_sys_i.coefficient(var));
-	if (sign != 0) {
+        const int sign = sgn(gen_sys_i.coefficient(var));
+        if (sign != 0) {
           if (gen_sys_i.expression().all_zeroes(1, var_id)
               && gen_sys_i.expression().all_zeroes(var_id + 1, space_dim + 1)) {
             
@@ -729,7 +729,7 @@ PPL::Polyhedron::constrains(const Variable var) const {
             else
               have_negative_ray = true;
           }
-	}
+        }
       }
     }
 
@@ -766,7 +766,7 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
   if (con_sys.topology() != gen_sys.topology()) {
 #ifndef NDEBUG
     cerr << "Constraints and generators have different topologies!"
-	 << endl;
+         << endl;
 #endif
     goto bomb;
   }
@@ -790,7 +790,7 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (has_something_pending()) {
 #ifndef NDEBUG
       cerr << "The polyhedron is empty, "
-	   << "but it has something pending" << endl;
+           << "but it has something pending" << endl;
 #endif
       goto bomb;
     }
@@ -799,28 +799,28 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     else {
       if (con_sys.space_dimension() != space_dim) {
 #ifndef NDEBUG
-	cerr << "The polyhedron is in a space of dimension "
-	     << space_dim
-	     << " while the system of constraints is in a space of dimension "
-	     << con_sys.space_dimension()
-	     << endl;
+        cerr << "The polyhedron is in a space of dimension "
+             << space_dim
+             << " while the system of constraints is in a space of dimension "
+             << con_sys.space_dimension()
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
       if (con_sys.num_rows() != 1) {
 #ifndef NDEBUG
-	cerr << "The system of constraints for an empty polyhedron "
-	     << "has more then one row"
-	     << endl;
+        cerr << "The system of constraints for an empty polyhedron "
+             << "has more then one row"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
       if (!con_sys[0].is_inconsistent()) {
 #ifndef NDEBUG
-	cerr << "Empty polyhedron with a satisfiable system of constraints"
-	     << endl;
+        cerr << "Empty polyhedron with a satisfiable system of constraints"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
       // Here we have only one, inconsistent constraint.
       return true;
@@ -834,16 +834,16 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (has_something_pending()) {
 #ifndef NDEBUG
       cerr << "Zero-dimensional polyhedron with something pending"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
     if (!con_sys.has_no_rows() || !gen_sys.has_no_rows()) {
 #ifndef NDEBUG
       cerr << "Zero-dimensional polyhedron with a non-empty"
-	   << endl
-	   << "system of constraints or generators."
-	   << endl;
+           << endl
+           << "system of constraints or generators."
+           << endl;
 #endif
       goto bomb;
     }
@@ -855,9 +855,9 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
   if (!constraints_are_up_to_date() && !generators_are_up_to_date()) {
 #ifndef NDEBUG
     cerr << "Polyhedron not empty, not zero-dimensional"
-	 << endl
-	 << "and with neither constraints nor generators up-to-date!"
-	 << endl;
+         << endl
+         << "and with neither constraints nor generators up-to-date!"
+         << endl;
 #endif
     goto bomb;
   }
@@ -872,33 +872,33 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (con_sys.space_dimension() != space_dim) {
 #ifndef NDEBUG
       cerr << "Incompatible size! (con_sys and space_dim)"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
     if (sat_c_is_up_to_date())
       if (con_sys.first_pending_row() != sat_c.num_columns()) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (con_sys and sat_c)"
-	     << endl;
+        cerr << "Incompatible size! (con_sys and sat_c)"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
     if (sat_g_is_up_to_date())
       if (con_sys.first_pending_row() != sat_g.num_rows()) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (con_sys and sat_g)"
-	     << endl;
+        cerr << "Incompatible size! (con_sys and sat_g)"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
     if (generators_are_up_to_date())
       if (con_sys.space_dimension() != gen_sys.space_dimension()) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (con_sys and gen_sys)"
-	     << endl;
+        cerr << "Incompatible size! (con_sys and gen_sys)"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
   }
 
@@ -906,31 +906,31 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (gen_sys.space_dimension() != space_dim) {
 #ifndef NDEBUG
       cerr << "Incompatible size! (gen_sys and space_dim)"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
     if (sat_c_is_up_to_date())
       if (gen_sys.first_pending_row() != sat_c.num_rows()) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (gen_sys and sat_c)"
-	     << endl;
+        cerr << "Incompatible size! (gen_sys and sat_c)"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
     if (sat_g_is_up_to_date())
       if (gen_sys.first_pending_row() != sat_g.num_columns()) {
 #ifndef NDEBUG
-	cerr << "Incompatible size! (gen_sys and sat_g)"
-	     << endl;
+        cerr << "Incompatible size! (gen_sys and sat_g)"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
 
     if (gen_sys.first_pending_row() == 0) {
 #ifndef NDEBUG
       cerr << "Up-to-date generator system with all rows pending!"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
@@ -940,8 +940,8 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (!gen_sys.has_no_rows() && !gen_sys.has_points()) {
 #ifndef NDEBUG
       cerr << "Non-empty generator system declared up-to-date "
-	   << "has no points!"
-	   << endl;
+           << "has no points!"
+           << endl;
 #endif
       goto bomb;
     }
@@ -962,16 +962,16 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       dimension_type num_closure_points = 0;
       dimension_type eps_index = gen_sys.space_dimension() + 1;
       for (dimension_type i = gen_sys.num_rows(); i-- > 0; )
-	if (!gen_sys[i].is_line_or_ray())
-	  if (gen_sys[i][eps_index] > 0)
-	    ++num_points;
-	  else
-	    ++num_closure_points;
+        if (!gen_sys[i].is_line_or_ray())
+          if (gen_sys[i][eps_index] > 0)
+            ++num_points;
+          else
+            ++num_closure_points;
       if (num_points > num_closure_points) {
 #ifndef NDEBUG
-	cerr << "# POINTS > # CLOSURE_POINTS" << endl;
+        cerr << "# POINTS > # CLOSURE_POINTS" << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
     }
     //=================================================
@@ -992,15 +992,15 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       minimize(false, copy_of_gen_sys, new_con_sys, new_sat_c);
       const dimension_type copy_num_lines = copy_of_gen_sys.num_lines();
       if (gs_without_pending.num_rows() != copy_of_gen_sys.num_rows()
-	  || gs_without_pending.num_lines() != copy_num_lines
-	  || gs_without_pending.num_rays() != copy_of_gen_sys.num_rays()) {
+          || gs_without_pending.num_lines() != copy_num_lines
+          || gs_without_pending.num_rays() != copy_of_gen_sys.num_rays()) {
 #ifndef NDEBUG
-	cerr << "Generators are declared minimized, but they are not!\n"
-	     << "Here is the minimized form of the generators:\n";
-	copy_of_gen_sys.ascii_dump(cerr);
-	cerr << endl;
+        cerr << "Generators are declared minimized, but they are not!\n"
+             << "Here is the minimized form of the generators:\n";
+        copy_of_gen_sys.ascii_dump(cerr);
+        cerr << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
 
       // CHECKME : the following observation is not formally true
@@ -1017,21 +1017,21 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       // they are different it means that the generators of the
       // polyhedron are declared minimized, but they are not.
       if (copy_num_lines == 0) {
-	copy_of_gen_sys.strong_normalize();
-	copy_of_gen_sys.sort_rows();
-	gs_without_pending.strong_normalize();
-	gs_without_pending.sort_rows();
-	if (copy_of_gen_sys != gs_without_pending) {
+        copy_of_gen_sys.strong_normalize();
+        copy_of_gen_sys.sort_rows();
+        gs_without_pending.strong_normalize();
+        gs_without_pending.sort_rows();
+        if (copy_of_gen_sys != gs_without_pending) {
 #ifndef NDEBUG
-	  cerr << "Generators are declared minimized, but they are not!\n"
-	       << "(we are in the case:\n"
-	       << "dimension of lineality space equal to 0)\n"
-	       << "Here is the minimized form of the generators:\n";
-	  copy_of_gen_sys.ascii_dump(cerr);
-	  cerr << endl;
+          cerr << "Generators are declared minimized, but they are not!\n"
+               << "(we are in the case:\n"
+               << "dimension of lineality space equal to 0)\n"
+               << "Here is the minimized form of the generators:\n";
+          copy_of_gen_sys.ascii_dump(cerr);
+          cerr << endl;
 #endif
-	    goto bomb;
-	}
+            goto bomb;
+        }
       }
     }
   }
@@ -1040,7 +1040,7 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (con_sys.first_pending_row() == 0) {
 #ifndef NDEBUG
       cerr << "Up-to-date constraint system with all rows pending!"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
@@ -1054,13 +1054,13 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     bool no_positivity_constraint = true;
     for (dimension_type i = con_sys.num_rows(); i-- > 0; )
       if (con_sys[i].inhomogeneous_term() != 0) {
-	no_positivity_constraint = false;
-	break;
+        no_positivity_constraint = false;
+        break;
       }
     if (no_positivity_constraint) {
 #ifndef NDEBUG
       cerr << "Non-empty constraint system has no positivity constraint"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
@@ -1071,17 +1071,17 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       // i.e., a constraint with a positive epsilon coefficient.
       bool no_epsilon_geq_zero = true;
       for (dimension_type i = con_sys.num_rows(); i-- > 0; )
-	if (con_sys[i].epsilon_coefficient() > 0) {
-	  no_epsilon_geq_zero = false;
-	  break;
-	}
+        if (con_sys[i].epsilon_coefficient() > 0) {
+          no_epsilon_geq_zero = false;
+          break;
+        }
       if (no_epsilon_geq_zero) {
 #ifndef NDEBUG
-	cerr << "Non-empty constraint system for NNC polyhedron "
-	     << "has no epsilon >= 0 constraint"
-	     << endl;
+        cerr << "Non-empty constraint system for NNC polyhedron "
+             << "has no epsilon >= 0 constraint"
+             << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
     }
 
@@ -1100,7 +1100,7 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (empty && check_not_empty) {
 #ifndef NDEBUG
       cerr << "Unsatisfiable system of constraints!"
-	   << endl;
+           << endl;
 #endif
       goto bomb;
     }
@@ -1111,15 +1111,15 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       // the same of the temporary minimized one.
       // If it does not happen, the polyhedron is not OK.
       if (cs_without_pending.num_rows() != copy_of_con_sys.num_rows()
-	  || cs_without_pending.num_equalities()
-	  != copy_of_con_sys.num_equalities()) {
+          || cs_without_pending.num_equalities()
+          != copy_of_con_sys.num_equalities()) {
 #ifndef NDEBUG
-	cerr << "Constraints are declared minimized, but they are not!\n"
-	     << "Here is the minimized form of the constraints:\n";
-	copy_of_con_sys.ascii_dump(cerr);
-	cerr << endl;
+        cerr << "Constraints are declared minimized, but they are not!\n"
+             << "Here is the minimized form of the constraints:\n";
+        copy_of_con_sys.ascii_dump(cerr);
+        cerr << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
       // The system `copy_of_con_sys' has the form that is obtained
       // after applying methods gauss() and back_substitute().
@@ -1137,12 +1137,12 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       cs_without_pending.sort_rows();
       if (cs_without_pending != copy_of_con_sys) {
 #ifndef NDEBUG
-	cerr << "Constraints are declared minimized, but they are not!\n"
-	     << "Here is the minimized form of the constraints:\n";
-	copy_of_con_sys.ascii_dump(cerr);
-	cerr << endl;
+        cerr << "Constraints are declared minimized, but they are not!\n"
+             << "Here is the minimized form of the constraints:\n";
+        copy_of_con_sys.ascii_dump(cerr);
+        cerr << endl;
 #endif
-	goto bomb;
+        goto bomb;
       }
     }
   }
@@ -1152,14 +1152,14 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       const Generator tmp_gen = gen_sys[i];
       const Bit_Row tmp_sat = sat_c[i];
       for (dimension_type j = sat_c.num_columns(); j-- > 0; ) {
-	const bool sat_j = (Scalar_Products::sign(con_sys[j], tmp_gen) == 0);
-	if (sat_j == tmp_sat[j]) {
+        const bool sat_j = (Scalar_Products::sign(con_sys[j], tmp_gen) == 0);
+        if (sat_j == tmp_sat[j]) {
 #ifndef NDEBUG
-	  cerr << "sat_c is declared up-to-date, but it is not!"
-	       << endl;
+          cerr << "sat_c is declared up-to-date, but it is not!"
+               << endl;
 #endif
-	  goto bomb;
-	}
+          goto bomb;
+        }
       }
     }
 
@@ -1168,14 +1168,14 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
       const Constraint tmp_con = con_sys[i];
       const Bit_Row tmp_sat = sat_g[i];
       for (dimension_type j = sat_g.num_columns(); j-- > 0; ) {
-	const bool sat_j = (Scalar_Products::sign(tmp_con, gen_sys[j]) == 0);
-	if (sat_j == tmp_sat[j]) {
+        const bool sat_j = (Scalar_Products::sign(tmp_con, gen_sys[j]) == 0);
+        if (sat_j == tmp_sat[j]) {
 #ifndef NDEBUG
-	  cerr << "sat_g is declared up-to-date, but it is not!"
-	       << endl;
+          cerr << "sat_g is declared up-to-date, but it is not!"
+               << endl;
 #endif
-	  goto bomb;
-	}
+          goto bomb;
+        }
       }
     }
 
@@ -1183,8 +1183,8 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (con_sys.num_pending_rows() == 0) {
 #ifndef NDEBUG
       cerr << "The polyhedron is declared to have pending constraints, "
-	   << "but con_sys has no pending rows!"
-	   << endl;
+           << "but con_sys has no pending rows!"
+           << endl;
 #endif
       goto bomb;
     }
@@ -1194,8 +1194,8 @@ PPL::Polyhedron::OK(bool check_not_empty) const {
     if (gen_sys.num_pending_rows() == 0) {
 #ifndef NDEBUG
       cerr << "The polyhedron is declared to have pending generators, "
-	   << "but gen_sys has no pending rows!"
-	   << endl;
+           << "but gen_sys has no pending rows!"
+           << endl;
 #endif
       goto bomb;
     }
@@ -1253,7 +1253,7 @@ PPL::Polyhedron::add_congruence(const Congruence& cg) {
     }
     // Non-trivial and proper congruences are not allowed.
     throw_invalid_argument("add_congruence(cg)",
-			   "cg is a non-trivial, proper congruence");
+                           "cg is a non-trivial, proper congruence");
   }
 
   PPL_ASSERT(cg.is_equality());
@@ -1267,9 +1267,8 @@ PPL::Polyhedron::add_congruence(const Congruence& cg) {
   }
 
   // Add the equality.
-  Linear_Expression le(cg);
-  Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
-
+  Linear_Expression le(cg.expression());
+  const Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
   refine_no_check(c);
 }
 
@@ -1291,9 +1290,9 @@ PPL::Polyhedron::add_generator(const Generator& g) {
     // Closure points can only be inserted in non-empty polyhedra.
     if (marked_empty()) {
       if (g.type() != Generator::POINT)
-	throw_invalid_generator("add_generator(g)", "g");
+        throw_invalid_generator("add_generator(g)", "g");
       else
-	set_zero_dim_univ();
+        set_zero_dim_univ();
     }
     PPL_ASSERT_HEAVY(OK());
     return;
@@ -1312,16 +1311,16 @@ PPL::Polyhedron::add_generator(const Generator& g) {
       // the system of generators to have the right dimension.
       gen_sys.adjust_topology_and_space_dimension(topology(), space_dim);
       if (!is_necessarily_closed()) {
-	// In the NNC topology, each point has to be matched by
-	// a corresponding closure point:
-	// turn the just inserted point into the corresponding
-	// (normalized) closure point.
-	gen_sys.sys.rows.back().set_epsilon_coefficient(0);
-	gen_sys.sys.rows.back().expr.normalize();
+        // In the NNC topology, each point has to be matched by
+        // a corresponding closure point:
+        // turn the just inserted point into the corresponding
+        // (normalized) closure point.
+        gen_sys.sys.rows.back().set_epsilon_coefficient(0);
+        gen_sys.sys.rows.back().expr.normalize();
         PPL_ASSERT(gen_sys.sys.rows.back().OK());
         PPL_ASSERT(gen_sys.sys.OK());
-	// Re-insert the point (which is already normalized).
-	gen_sys.insert(g);
+        // Re-insert the point (which is already normalized).
+        gen_sys.insert(g);
       }
     }
     else {
@@ -1330,7 +1329,7 @@ PPL::Polyhedron::add_generator(const Generator& g) {
       // However, by barely invoking `gen_sys.insert(g)' we would
       // cause a change in the topology of `gen_sys', which is wrong.
       // Thus, we insert a "topology corrected" copy of `g'.
-      const Linear_Expression nc_expr = Linear_Expression(g);
+      const Linear_Expression nc_expr(g.expression());
       gen_sys.insert(Generator::point(nc_expr, g.divisor()));
       // Since `gen_sys' was empty, after inserting `g' we have to resize
       // the system of generators to have the right dimension.
@@ -1347,16 +1346,16 @@ PPL::Polyhedron::add_generator(const Generator& g) {
       // Since `gen_sys' is not empty, the topology and space dimension
       // of the inserted generator are automatically adjusted.
       if (has_pending)
-	gen_sys.insert_pending(g);
+        gen_sys.insert_pending(g);
       else
-	gen_sys.insert(g);
+        gen_sys.insert(g);
       if (!is_necessarily_closed() && g.is_point()) {
-	// In the NNC topology, each point has to be matched by
-	// a corresponding closure point:
-	// turn the just inserted point into the corresponding
-	// (normalized) closure point.
-	gen_sys.sys.rows.back().set_epsilon_coefficient(0);
-	gen_sys.sys.rows.back().expr.normalize();
+        // In the NNC topology, each point has to be matched by
+        // a corresponding closure point:
+        // turn the just inserted point into the corresponding
+        // (normalized) closure point.
+        gen_sys.sys.rows.back().set_epsilon_coefficient(0);
+        gen_sys.sys.rows.back().expr.normalize();
         PPL_ASSERT(gen_sys.sys.rows.back().OK());
         PPL_ASSERT(gen_sys.sys.OK());
         // Re-insert the point (which is already normalized).
@@ -1373,29 +1372,29 @@ PPL::Polyhedron::add_generator(const Generator& g) {
       // However, by barely invoking `gen_sys.insert(g)' we would
       // cause a change in the topology of `gen_sys', which is wrong.
       // Thus, we insert a "topology corrected" copy of `g'.
-      const Linear_Expression nc_expr = Linear_Expression(g);
+      const Linear_Expression nc_expr(g.expression());
       switch (g.type()) {
       case Generator::LINE:
-	if (has_pending)
-	  gen_sys.insert_pending(Generator::line(nc_expr));
-	else
-	  gen_sys.insert(Generator::line(nc_expr));
-	break;
+        if (has_pending)
+          gen_sys.insert_pending(Generator::line(nc_expr));
+        else
+          gen_sys.insert(Generator::line(nc_expr));
+        break;
       case Generator::RAY:
-	if (has_pending)
-	  gen_sys.insert_pending(Generator::ray(nc_expr));
-	else
-	  gen_sys.insert(Generator::ray(nc_expr));
-	break;
+        if (has_pending)
+          gen_sys.insert_pending(Generator::ray(nc_expr));
+        else
+          gen_sys.insert(Generator::ray(nc_expr));
+        break;
       case Generator::POINT:
-	if (has_pending)
-	  gen_sys.insert_pending(Generator::point(nc_expr, g.divisor()));
-	else
-	  gen_sys.insert(Generator::point(nc_expr, g.divisor()));
-	break;
+        if (has_pending)
+          gen_sys.insert_pending(Generator::point(nc_expr, g.divisor()));
+        else
+          gen_sys.insert(Generator::point(nc_expr, g.divisor()));
+        break;
       case Generator::CLOSURE_POINT:
         PPL_UNREACHABLE;
-	break;
+        break;
       }
     }
 
@@ -1559,7 +1558,8 @@ PPL::Polyhedron::add_recycled_generators(Generator_System& gs) {
     gs.clear();
 
     set_generators_pending();
-  } else {
+  }
+  else {
     // Here we do not require `gen_sys' to be sorted.
     // also, we _remove_ (instead of copying) the coefficients of `gs'
     // (which is not a const).
@@ -1595,8 +1595,8 @@ PPL::Polyhedron::add_congruences(const Congruence_System& cgs) {
          cgs_end = cgs.end(); i != cgs_end; ++i) {
     const Congruence& cg = *i;
     if (cg.is_equality()) {
-      Linear_Expression le(cg);
-      Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
+      Linear_Expression le(cg.expression());
+      const Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
 
       // TODO: Consider stealing the row in c when adding it to cs.
       cs.insert(c);
@@ -1646,9 +1646,8 @@ PPL::Polyhedron::refine_with_congruence(const Congruence& cg) {
   }
 
   if (cg.is_equality()) {
-    Linear_Expression le(cg);
-    Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
-
+    Linear_Expression le(cg.expression());
+    const Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
     refine_no_check(c);
   }
 }
@@ -1661,7 +1660,7 @@ PPL::Polyhedron::refine_with_constraints(const Constraint_System& cs) {
   const dimension_type cs_space_dim = cs.space_dimension();
   if (space_dim < cs_space_dim)
     throw_dimension_incompatible("refine_with_constraints(cs)a",
-				 "cs", cs);
+                                 "cs", cs);
 
   // Adding no constraints is a no-op.
   if (cs.has_no_rows())
@@ -1706,7 +1705,7 @@ PPL::Polyhedron::refine_with_constraints(const Constraint_System& cs) {
       // would cause a change in the topology of `con_sys', which is
       // wrong.  Thus, we insert a topology closed and "topology
       // corrected" version of `c'.
-      Linear_Expression nc_expr = Linear_Expression(c);
+      const Linear_Expression nc_expr(c.expression());
       if (c.is_equality())
         if (adding_pending)
           con_sys.insert_pending(nc_expr == 0);
@@ -1744,8 +1743,8 @@ PPL::Polyhedron::refine_with_congruences(const Congruence_System& cgs) {
   for (Congruence_System::const_iterator i = cgs.begin(),
          cgs_end = cgs.end(); i != cgs_end; ++i) {
     if (i->is_equality()) {
-      Linear_Expression le(*i);
-      Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
+      Linear_Expression le(i->expression());
+      const Constraint c(le, Constraint::EQUALITY, NECESSARILY_CLOSED);
 
       // TODO: Consider stealing the row in c when adding it to cs.
       cs.insert(c);
@@ -1885,7 +1884,7 @@ PPL::Polyhedron::intersection_assign(const Polyhedron& y) {
     // If both constraint systems are (fully) sorted, then we can
     // merge them; otherwise we simply add the second to the first.
     if (x.con_sys.is_sorted()
-	&& y.con_sys.is_sorted() && !y.has_pending_constraints())
+        && y.con_sys.is_sorted() && !y.has_pending_constraints())
       x.con_sys.merge_rows_assign(y.con_sys);
     else
       x.con_sys.insert(y.con_sys);
@@ -2027,7 +2026,7 @@ PPL::Polyhedron::simplify_using_context_assign(const Polyhedron& y) {
         // found, and assign to `x' the polyhedron `ph' with `c' as
         // the only constraint.
         Polyhedron ph(x.topology(), x.space_dim, UNIVERSE);
-        Linear_Expression le(y_con_sys_i);
+        const Linear_Expression le(y_con_sys_i.expression());
         switch (y_con_sys_i.type()) {
         case Constraint::EQUALITY:
           ph.refine_no_check(le == 1);
@@ -2041,7 +2040,7 @@ PPL::Polyhedron::simplify_using_context_assign(const Polyhedron& y) {
         }
         m_swap(ph);
         PPL_ASSERT_HEAVY(OK());
-	return false;
+        return false;
       }
     }
     // `y' is the universe: `x' cannot be enlarged.
@@ -2122,7 +2121,7 @@ PPL::Polyhedron::simplify_using_context_assign(const Polyhedron& y) {
       for (dimension_type i = 0, j = 0; i < x_cs_num_rows; ++i) {
         if (!redundant_by_y[i]) {
           const Constraint& c = x_cs[i];
-          Topology_Adjusted_Scalar_Product_Sign sps(c);
+          const Topology_Adjusted_Scalar_Product_Sign sps(c);
           dimension_type num_ruled_out_generators = 0;
           for (Generator_System::const_iterator k = y_gs.begin(),
                  y_gs_end = y_gs.end(); k != y_gs_end; ++k) {
@@ -2210,7 +2209,7 @@ PPL::Polyhedron::simplify_using_context_assign(const Polyhedron& y) {
         const Constraint& c = x_cs[j->constraint_index];
         result_cs.insert(c);
         lp.add_constraint(c);
-        MIP_Problem_Status status = lp.solve();
+        const MIP_Problem_Status status = lp.solve();
         if (status == UNFEASIBLE_MIP_PROBLEM) {
           Polyhedron result_ph(x.topology(), x.space_dim, UNIVERSE);
           result_ph.add_constraints(result_cs);
@@ -2395,7 +2394,7 @@ PPL::Polyhedron::poly_hull_assign(const Polyhedron& y) {
     // If both generator systems are (fully) sorted, then we can merge
     // them; otherwise we simply add the second to the first.
     if (x.gen_sys.is_sorted()
-	&& y.gen_sys.is_sorted() && !y.has_pending_generators())
+        && y.gen_sys.is_sorted() && !y.has_pending_generators())
       x.gen_sys.merge_rows_assign(y.gen_sys);
     else
       x.gen_sys.insert(y.gen_sys);
@@ -2451,7 +2450,7 @@ PPL::Polyhedron::poly_difference_assign(const Polyhedron& y) {
 
   const Constraint_System& y_cs = y.constraints();
   for (Constraint_System::const_iterator i = y_cs.begin(),
-	 y_cs_end = y_cs.end(); i != y_cs_end; ++i) {
+         y_cs_end = y_cs.end(); i != y_cs_end; ++i) {
     const Constraint& c = *i;
     PPL_ASSERT(!c.is_tautological());
     PPL_ASSERT(!c.is_inconsistent());
@@ -2464,27 +2463,27 @@ PPL::Polyhedron::poly_difference_assign(const Polyhedron& y) {
     if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
       continue;
     Polyhedron z = x;
-    const Linear_Expression e = Linear_Expression(c);
+    const Linear_Expression e(c.expression());
     switch (c.type()) {
     case Constraint::NONSTRICT_INEQUALITY:
       if (is_necessarily_closed())
-	z.refine_no_check(e <= 0);
+        z.refine_no_check(e <= 0);
       else
-	z.refine_no_check(e < 0);
+        z.refine_no_check(e < 0);
       break;
     case Constraint::STRICT_INEQUALITY:
       z.refine_no_check(e <= 0);
       break;
     case Constraint::EQUALITY:
       if (is_necessarily_closed())
-	// We have already filtered out the case
-	// when `x' is included in `y': the result is `x'.
-	return;
+        // We have already filtered out the case
+        // when `x' is included in `y': the result is `x'.
+        return;
       else {
-	Polyhedron w = x;
-	w.refine_no_check(e < 0);
-	new_polyhedron.poly_hull_assign(w);
-	z.refine_no_check(e > 0);
+        Polyhedron w = x;
+        w.refine_no_check(e < 0);
+        new_polyhedron.poly_hull_assign(w);
+        z.refine_no_check(e > 0);
       }
       break;
     }
@@ -2498,8 +2497,8 @@ PPL::Polyhedron::poly_difference_assign(const Polyhedron& y) {
 void
 PPL::Polyhedron::
 affine_image(const Variable var,
-	     const Linear_Expression& expr,
-	     Coefficient_traits::const_reference denominator) {
+             const Linear_Expression& expr,
+             Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("affine_image(v, e, d)", "d == 0");
@@ -2525,9 +2524,9 @@ affine_image(const Variable var,
       // Generator_System::affine_image() requires the third argument
       // to be a positive Coefficient.
       if (denominator > 0)
-	gen_sys.affine_image(var, expr, denominator);
+        gen_sys.affine_image(var, expr, denominator);
       else
-	gen_sys.affine_image(var, -expr, -denominator);
+        gen_sys.affine_image(var, -expr, -denominator);
     }
     if (constraints_are_up_to_date()) {
       // To build the inverse transformation,
@@ -2536,17 +2535,17 @@ affine_image(const Variable var,
       Linear_Expression inverse;
       Coefficient_traits::const_reference c = expr.coefficient(var);
       if (c > 0) {
-	inverse = -expr;
-	inverse.set_coefficient(var, denominator);
-	con_sys.affine_preimage(var, inverse, c);
+        inverse = -expr;
+        inverse.set_coefficient(var, denominator);
+        con_sys.affine_preimage(var, inverse, c);
       }
       else {
-	// The new denominator is negative: we negate everything once
-	// more, as Constraint_System::affine_preimage() requires the
-	// third argument to be positive.
-	inverse = expr;
+        // The new denominator is negative: we negate everything once
+        // more, as Constraint_System::affine_preimage() requires the
+        // third argument to be positive.
+        inverse = expr;
         inverse.set_coefficient(var, -denominator);
-	con_sys.affine_preimage(var, inverse, -c);
+        con_sys.affine_preimage(var, inverse, -c);
       }
     }
   }
@@ -2561,9 +2560,9 @@ affine_image(const Variable var,
       // Generator_System::affine_image() requires the third argument
       // to be a positive Coefficient.
       if (denominator > 0)
-	gen_sys.affine_image(var, expr, denominator);
+        gen_sys.affine_image(var, expr, denominator);
       else
-	gen_sys.affine_image(var, -expr, -denominator);
+        gen_sys.affine_image(var, -expr, -denominator);
 
       clear_constraints_up_to_date();
       clear_generators_minimized();
@@ -2578,8 +2577,8 @@ affine_image(const Variable var,
 void
 PPL::Polyhedron::
 affine_preimage(const Variable var,
-		const Linear_Expression& expr,
-		Coefficient_traits::const_reference denominator) {
+                const Linear_Expression& expr,
+                Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("affine_preimage(v, e, d)", "d == 0");
@@ -2604,9 +2603,9 @@ affine_preimage(const Variable var,
       // Constraint_System::affine_preimage() requires the third argument
       // to be a positive Coefficient.
       if (denominator > 0)
-	con_sys.affine_preimage(var, expr, denominator);
+        con_sys.affine_preimage(var, expr, denominator);
       else
-	con_sys.affine_preimage(var, -expr, -denominator);
+        con_sys.affine_preimage(var, -expr, -denominator);
     }
     if (generators_are_up_to_date()) {
       // To build the inverse transformation,
@@ -2615,17 +2614,17 @@ affine_preimage(const Variable var,
       Linear_Expression inverse;
       Coefficient_traits::const_reference c = expr.coefficient(var);
       if (c > 0) {
-	inverse = -expr;
-	inverse.set_coefficient(var, denominator);
-	gen_sys.affine_image(var, inverse, c);
+        inverse = -expr;
+        inverse.set_coefficient(var, denominator);
+        gen_sys.affine_image(var, inverse, c);
       }
       else {
-	// The new denominator is negative:
-	// we negate everything once more, as Generator_System::affine_image()
-	// requires the third argument to be positive.
-	inverse = expr;
+        // The new denominator is negative:
+        // we negate everything once more, as Generator_System::affine_image()
+        // requires the third argument to be positive.
+        inverse = expr;
         inverse.set_coefficient(var, -denominator);
-	gen_sys.affine_image(var, inverse, -c);
+        gen_sys.affine_image(var, inverse, -c);
       }
     }
   }
@@ -2654,9 +2653,9 @@ affine_preimage(const Variable var,
 void
 PPL::Polyhedron::
 bounded_affine_image(const Variable var,
-		     const Linear_Expression& lb_expr,
-		     const Linear_Expression& ub_expr,
-		     Coefficient_traits::const_reference denominator) {
+                     const Linear_Expression& lb_expr,
+                     const Linear_Expression& ub_expr,
+                     Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("bounded_affine_image(v, lb, ub, d)", "d == 0");
@@ -2666,17 +2665,17 @@ bounded_affine_image(const Variable var,
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "v", var);
+                                 "v", var);
   // The dimension of `lb_expr' and `ub_expr' should not be
   // greater than the dimension of `*this'.
   const dimension_type lb_space_dim = lb_expr.space_dimension();
   if (space_dim < lb_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "lb", lb_expr);
+                                 "lb", lb_expr);
   const dimension_type ub_space_dim = ub_expr.space_dimension();
   if (space_dim < ub_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "ub", ub_expr);
+                                 "ub", ub_expr);
 
   // Any image of an empty polyhedron is empty.
   if (marked_empty())
@@ -2686,9 +2685,9 @@ bounded_affine_image(const Variable var,
   if (lb_expr.coefficient(var) == 0) {
     // Here `var' may only occur in `ub_expr'.
     generalized_affine_image(var,
-			     LESS_OR_EQUAL,
-			     ub_expr,
-			     denominator);
+                             LESS_OR_EQUAL,
+                             ub_expr,
+                             denominator);
     if (denominator > 0)
       refine_no_check(lb_expr <= denominator*var);
     else
@@ -2697,9 +2696,9 @@ bounded_affine_image(const Variable var,
   else if (ub_expr.coefficient(var) == 0) {
     // Here `var' only occurs in `lb_expr'.
     generalized_affine_image(var,
-			     GREATER_OR_EQUAL,
-			     lb_expr,
-			     denominator);
+                             GREATER_OR_EQUAL,
+                             lb_expr,
+                             denominator);
     if (denominator > 0)
       refine_no_check(denominator*var <= ub_expr);
     else
@@ -2714,9 +2713,9 @@ bounded_affine_image(const Variable var,
     refine_no_check(denominator*new_var == ub_expr);
     // Apply the affine lower bound.
     generalized_affine_image(var,
-			     GREATER_OR_EQUAL,
-			     lb_expr,
-			     denominator);
+                             GREATER_OR_EQUAL,
+                             lb_expr,
+                             denominator);
     if (!marked_empty())
       // Now apply the affine upper bound, as recorded in `new_var'.
       refine_no_check(new_var >= var);
@@ -2729,9 +2728,9 @@ bounded_affine_image(const Variable var,
 void
 PPL::Polyhedron::
 bounded_affine_preimage(const Variable var,
-			const Linear_Expression& lb_expr,
-			const Linear_Expression& ub_expr,
-			Coefficient_traits::const_reference denominator) {
+                        const Linear_Expression& lb_expr,
+                        const Linear_Expression& ub_expr,
+                        Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("bounded_affine_preimage(v, lb, ub, d)", "d == 0");
@@ -2741,17 +2740,17 @@ bounded_affine_preimage(const Variable var,
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "v", var);
+                                 "v", var);
   // The dimension of `lb_expr' and `ub_expr' should not be
   // greater than the dimension of `*this'.
   const dimension_type lb_space_dim = lb_expr.space_dimension();
   if (space_dim < lb_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "lb", lb_expr);
+                                 "lb", lb_expr);
   const dimension_type ub_space_dim = ub_expr.space_dimension();
   if (space_dim < ub_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "ub", ub_expr);
+                                 "ub", ub_expr);
 
   // Any preimage of an empty polyhedron is empty.
   if (marked_empty())
@@ -2800,9 +2799,9 @@ bounded_affine_preimage(const Variable var,
 void
 PPL::Polyhedron::
 generalized_affine_image(const Variable var,
-			 const Relation_Symbol relsym,
-			 const Linear_Expression& expr,
-			 Coefficient_traits::const_reference denominator) {
+                         const Relation_Symbol relsym,
+                         const Linear_Expression& expr,
+                         Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("generalized_affine_image(v, r, e, d)", "d == 0");
@@ -2812,22 +2811,22 @@ generalized_affine_image(const Variable var,
   // of `*this'.
   if (space_dim < expr.space_dimension())
     throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-				 "e", expr);
+                                 "e", expr);
   // `var' should be one of the dimensions of the polyhedron.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-				 "v", var);
+                                 "v", var);
 
   // Strict relation symbols are only admitted for NNC polyhedra.
   if (is_necessarily_closed()
       && (relsym == LESS_THAN || relsym == GREATER_THAN))
     throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-			   "r is a strict relation symbol");
+                           "r is a strict relation symbol");
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_image(v, r, e, d)",
-			   "r is the disequality relation symbol");
+                           "r is the disequality relation symbol");
 
   // First compute the affine image.
   affine_image(var, expr, denominator);
@@ -2866,7 +2865,7 @@ generalized_affine_image(const Variable var,
       // newly introduced ray.
       for (dimension_type i = gen_sys.num_rows(); i-- > 0; ) {
         const Generator& gen_i = gen_sys.sys.rows[i];
-	if (gen_i.is_point()) {
+        if (gen_i.is_point()) {
           // Add a copy of `gen_i' at the end of the system.
           // Note: copying is really meant, to avoid undefined behavior.
           gen_sys.sys.rows.push_back(Generator(gen_i));
@@ -2884,7 +2883,7 @@ generalized_affine_image(const Variable var,
             new_gen.expr -= var;
           new_gen.expr.normalize();
           PPL_ASSERT(new_gen.OK());
-	}
+        }
       }
       // Sortedness no longer hold.
       gen_sys.set_sorted(false);
@@ -2908,35 +2907,35 @@ generalized_affine_image(const Variable var,
 void
 PPL::Polyhedron::
 generalized_affine_preimage(const Variable var,
-			    const Relation_Symbol relsym,
-			    const Linear_Expression& expr,
-			    Coefficient_traits::const_reference denominator) {
+                            const Relation_Symbol relsym,
+                            const Linear_Expression& expr,
+                            Coefficient_traits::const_reference denominator) {
   // The denominator cannot be zero.
   if (denominator == 0)
     throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-			   "d == 0");
+                           "d == 0");
 
   // Dimension-compatibility checks.
   // The dimension of `expr' should not be greater than the dimension
   // of `*this'.
   if (space_dim < expr.space_dimension())
     throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-				 "e", expr);
+                                 "e", expr);
   // `var' should be one of the dimensions of the polyhedron.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-				 "v", var);
+                                 "v", var);
 
   // Strict relation symbols are only admitted for NNC polyhedra.
   if (is_necessarily_closed()
       && (relsym == LESS_THAN || relsym == GREATER_THAN))
     throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-			   "r is a strict relation symbol");
+                           "r is a strict relation symbol");
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
-			   "r is the disequality relation symbol");
+                           "r is the disequality relation symbol");
 
   // Check whether the affine relation is indeed an affine function.
   if (relsym == EQUAL) {
@@ -2969,15 +2968,15 @@ generalized_affine_preimage(const Variable var,
   // computed as the image of its inverse relation.
   const Coefficient& var_coefficient = expr.coefficient(var);
   if (var_coefficient != 0) {
-    Linear_Expression inverse_expr
+    const Linear_Expression inverse_expr
       = expr - (denominator + var_coefficient) * var;
     PPL_DIRTY_TEMP_COEFFICIENT(inverse_denominator);
     neg_assign(inverse_denominator, var_coefficient);
-    Relation_Symbol inverse_relsym
+    const Relation_Symbol inverse_relsym
       = (sgn(denominator) == sgn(inverse_denominator))
       ? relsym : reversed_relsym;
     generalized_affine_image(var, inverse_relsym, inverse_expr,
-			     inverse_denominator);
+                             inverse_denominator);
     return;
   }
 
@@ -3011,31 +3010,31 @@ generalized_affine_preimage(const Variable var,
 
 void
 PPL::Polyhedron::generalized_affine_image(const Linear_Expression& lhs,
-					  const Relation_Symbol relsym,
-					  const Linear_Expression& rhs) {
+                                          const Relation_Symbol relsym,
+                                          const Linear_Expression& rhs) {
   // Dimension-compatibility checks.
   // The dimension of `lhs' should not be greater than the dimension
   // of `*this'.
   dimension_type lhs_space_dim = lhs.space_dimension();
   if (space_dim < lhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e1", lhs);
+                                 "e1", lhs);
   // The dimension of `rhs' should not be greater than the dimension
   // of `*this'.
   const dimension_type rhs_space_dim = rhs.space_dimension();
   if (space_dim < rhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e2", rhs);
+                                 "e2", rhs);
 
   // Strict relation symbols are only admitted for NNC polyhedra.
   if (is_necessarily_closed()
       && (relsym == LESS_THAN || relsym == GREATER_THAN))
     throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-			   "r is a strict relation symbol");
+                           "r is a strict relation symbol");
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_image(e1, r, e2)",
-			   "r is the disequality relation symbol");
+                           "r is the disequality relation symbol");
 
   // Any image of an empty polyhedron is empty.
   if (marked_empty())
@@ -3101,22 +3100,22 @@ PPL::Polyhedron::generalized_affine_image(const Linear_Expression& lhs,
       // (we force minimization because we will need the generators).
       switch (relsym) {
       case LESS_THAN:
-	refine_no_check(lhs < new_var);
-	break;
+        refine_no_check(lhs < new_var);
+        break;
       case LESS_OR_EQUAL:
-	refine_no_check(lhs <= new_var);
-	break;
+        refine_no_check(lhs <= new_var);
+        break;
       case EQUAL:
-	refine_no_check(lhs == new_var);
-	break;
+        refine_no_check(lhs == new_var);
+        break;
       case GREATER_OR_EQUAL:
-	refine_no_check(lhs >= new_var);
-	break;
+        refine_no_check(lhs >= new_var);
+        break;
       case GREATER_THAN:
-	refine_no_check(lhs > new_var);
-	break;
+        refine_no_check(lhs > new_var);
+        break;
       case NOT_EQUAL:
-	// The NOT_EQUAL case has been already dealt with.
+        // The NOT_EQUAL case has been already dealt with.
         PPL_UNREACHABLE;
         break;
       }
@@ -3165,31 +3164,31 @@ PPL::Polyhedron::generalized_affine_image(const Linear_Expression& lhs,
 
 void
 PPL::Polyhedron::generalized_affine_preimage(const Linear_Expression& lhs,
-					     const Relation_Symbol relsym,
-					     const Linear_Expression& rhs) {
+                                             const Relation_Symbol relsym,
+                                             const Linear_Expression& rhs) {
   // Dimension-compatibility checks.
   // The dimension of `lhs' should not be greater than the dimension
   // of `*this'.
   dimension_type lhs_space_dim = lhs.space_dimension();
   if (space_dim < lhs_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
-				 "e1", lhs);
+                                 "e1", lhs);
   // The dimension of `rhs' should not be greater than the dimension
   // of `*this'.
   const dimension_type rhs_space_dim = rhs.space_dimension();
   if (space_dim < rhs_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(e1, r, e2)",
-				 "e2", rhs);
+                                 "e2", rhs);
 
   // Strict relation symbols are only admitted for NNC polyhedra.
   if (is_necessarily_closed()
       && (relsym == LESS_THAN || relsym == GREATER_THAN))
     throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
-			   "r is a strict relation symbol");
+                           "r is a strict relation symbol");
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_preimage(e1, r, e2)",
-			   "r is the disequality relation symbol");
+                           "r is the disequality relation symbol");
 
   // Any preimage of an empty polyhedron is empty.
   if (marked_empty())
@@ -3234,22 +3233,22 @@ PPL::Polyhedron::generalized_affine_preimage(const Linear_Expression& lhs,
       // the right hand side as dictated by `relsym'.
       switch (relsym) {
       case LESS_THAN:
-	refine_no_check(new_var < rhs);
-	break;
+        refine_no_check(new_var < rhs);
+        break;
       case LESS_OR_EQUAL:
-	refine_no_check(new_var <= rhs);
-	break;
+        refine_no_check(new_var <= rhs);
+        break;
       case EQUAL:
-	refine_no_check(new_var == rhs);
-	break;
+        refine_no_check(new_var == rhs);
+        break;
       case GREATER_OR_EQUAL:
-	refine_no_check(new_var >= rhs);
-	break;
+        refine_no_check(new_var >= rhs);
+        break;
       case GREATER_THAN:
-	refine_no_check(new_var > rhs);
-	break;
+        refine_no_check(new_var > rhs);
+        break;
       case NOT_EQUAL:
-	// The NOT_EQUAL case has been already dealt with.
+        // The NOT_EQUAL case has been already dealt with.
         PPL_UNREACHABLE;
         break;
       }
@@ -3333,31 +3332,31 @@ PPL::Polyhedron::time_elapse_assign(const Polyhedron& y) {
       Generator& g = gs.sys.rows[i];
       switch (g.type()) {
       case Generator::POINT:
-	// The points of `gs' can be erased,
-	// since their role can be played by closure points.
-	--gs_num_rows;
+        // The points of `gs' can be erased,
+        // since their role can be played by closure points.
+        --gs_num_rows;
         swap(g, gs.sys.rows[gs_num_rows]);
-	break;
+        break;
       case Generator::CLOSURE_POINT:
-	{
-	  // If it is the origin, erase it.
-	  if (g.expr.all_homogeneous_terms_are_zero()) {
-	    --gs_num_rows;
+        {
+          // If it is the origin, erase it.
+          if (g.expr.all_homogeneous_terms_are_zero()) {
+            --gs_num_rows;
             swap(g, gs.sys.rows[gs_num_rows]);
-	  }
-	  // Otherwise, transform the closure point into a ray.
-	  else {
-	    g.expr.set_inhomogeneous_term(0);
-	    // Enforce normalization.
-	    g.expr.normalize();
+          }
+          // Otherwise, transform the closure point into a ray.
+          else {
+            g.expr.set_inhomogeneous_term(0);
+            // Enforce normalization.
+            g.expr.normalize();
             PPL_ASSERT(g.OK());
-	  }
-	}
-	break;
+          }
+        }
+        break;
       case Generator::RAY:
       case Generator::LINE:
-	// For rays and lines, nothing to be done.
-	break;
+        // For rays and lines, nothing to be done.
+        break;
       }
     }
   }
@@ -3466,8 +3465,8 @@ PPL::Polyhedron::frequency(const Linear_Expression& expr,
     if (gen_sys_i.is_line_or_ray()) {
       const int sp_sign = sgn(sp);
       if (sp_sign != 0)
-	// `expr' is unbounded in `*this'.
-	return false;
+        // `expr' is unbounded in `*this'.
+        return false;
     }
     else {
       // We have a point or a closure point.
@@ -3478,9 +3477,9 @@ PPL::Polyhedron::frequency(const Linear_Expression& expr,
       assign_r(candidate.get_den(), gen_sys_i.expr.inhomogeneous_term(), ROUND_NOT_NEEDED);
       candidate.canonicalize();
       if (first_candidate) {
-	// We have a (new) candidate value.
-	first_candidate = false;
-	value = candidate;
+        // We have a (new) candidate value.
+        first_candidate = false;
+        value = candidate;
       }
       else if (candidate != value)
         return false;
@@ -3533,11 +3532,11 @@ PPL::Polyhedron::topological_closure_assign() {
     for (dimension_type i = con_sys.num_rows(); i-- > 0; ) {
       Constraint& c = con_sys.sys.rows[i];
       if (c.epsilon_coefficient() < 0 && !c.is_tautological()) {
-	c.set_epsilon_coefficient(0);
-	// Enforce normalization.
-	c.expr.normalize();
+        c.set_epsilon_coefficient(0);
+        // Enforce normalization.
+        c.expr.normalize();
         PPL_ASSERT(c.OK());
-	changed = true;
+        changed = true;
       }
     }
 
@@ -3598,9 +3597,9 @@ PPL::operator==(const Polyhedron& x, const Polyhedron& y) {
   default:
     if (x.is_included_in(y))
       if (x.marked_empty())
-	return y.is_empty();
+        return y.is_empty();
       else
-	return y.is_included_in(x);
+        return y.is_included_in(x);
     else
       return false;
   }
diff --git a/src/Polyhedron_simplify.templates.hh b/src/Polyhedron_simplify.templates.hh
deleted file mode 100644
index bd17b25..0000000
--- a/src/Polyhedron_simplify.templates.hh
+++ /dev/null
@@ -1,340 +0,0 @@
-/* Polyhedron class implementation: simplify().
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Polyhedron_simplify_templates_hh
-#define PPL_Polyhedron_simplify_templates_hh 1
-
-#include "Bit_Matrix.defs.hh"
-#include "Polyhedron.defs.hh"
-#include <cstddef>
-#include <limits>
-
-namespace Parma_Polyhedra_Library {
-
-/*!
-  \return
-  The rank of \p sys.
-
-  \param sys
-  The system to simplify: it will be modified;
-
-  \param sat
-  The saturation matrix corresponding to \p sys.
-
-  \p sys may be modified by swapping some of its rows and by possibly
-  removing some of them, if they turn out to be redundant.
-
-  If \p sys is a system of constraints, then the rows of \p sat are
-  indexed by constraints and its columns are indexed by generators;
-  otherwise, if \p sys is a system of generators, then the rows of
-  \p sat are indexed by generators and its columns by constraints.
-
-  Given a system of constraints or a system of generators, this function
-  simplifies it using Gauss' elimination method (to remove redundant
-  equalities/lines), deleting redundant inequalities/rays/points and
-  making back-substitution.
-  The explanation that follows assumes that \p sys is a system of
-  constraints. For the case when \p sys is a system of generators,
-  a similar explanation can be obtain by applying duality.
-
-  The explanation relies on the notion of <EM>redundancy</EM>.
-  (See the Introduction.)
-
-  First we make some observations that can help the reader
-  in understanding the function:
-
-  Proposition: An inequality that is saturated by all the generators
-  can be transformed to an equality.
-
-  In fact, by combining any number of generators that saturate the
-  constraints, we obtain a generator that saturates the constraints too:
-  \f[
-    \langle \vect{c}, \vect{r}_1 \rangle = 0 \land
-    \langle \vect{c}, \vect{r}_2 \rangle = 0
-    \Rightarrow
-    \langle \vect{c}, (\lambda_1 \vect{r}_1 + \lambda_2 \vect{r}_2) \rangle =
-    \lambda_1 \langle \vect{c}, \vect{r}_1 \rangle
-    + \lambda_2 \langle \vect{c}, \vect{r}_2 \rangle
-    = 0,
-  \f]
-  where \f$\lambda_1, \lambda_2\f$ can be any real number.
-*/
-template <typename Linear_System1>
-dimension_type
-Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
-
-  typedef typename Linear_System1::row_type sys_row_type;
-
-  dimension_type num_rows = sys.num_rows();
-  const dimension_type num_cols_sat = sat.num_columns();
-
-  using std::swap;
-
-  // Looking for the first inequality in `sys'.
-  dimension_type num_lines_or_equalities = 0;
-  while (num_lines_or_equalities < num_rows
-	 && sys[num_lines_or_equalities].is_line_or_equality())
-    ++num_lines_or_equalities;
-
-  // `num_saturators[i]' will contain the number of generators
-  // that saturate the constraint `sys[i]'.
-  if (num_rows > simplify_num_saturators_size) {
-    delete [] simplify_num_saturators_p;
-    simplify_num_saturators_p = 0;
-    simplify_num_saturators_size = 0;
-    const size_t max_size
-      = std::numeric_limits<size_t>::max() / sizeof(dimension_type);
-    const size_t new_size = compute_capacity(num_rows, max_size);
-    simplify_num_saturators_p = new dimension_type[new_size];
-    simplify_num_saturators_size = new_size;
-  }
-  dimension_type* num_saturators = simplify_num_saturators_p;
-
-  bool sys_sorted = sys.is_sorted();
-
-  // Computing the number of saturators for each inequality,
-  // possibly identifying and swapping those that happen to be
-  // equalities (see Proposition above).
-  for (dimension_type i = num_lines_or_equalities; i < num_rows; ++i) {
-    if (sat[i].empty()) {
-      // The constraint `sys_rows[i]' is saturated by all the generators.
-      // Thus, either it is already an equality or it can be transformed
-      // to an equality (see Proposition above).
-      sys.sys.rows[i].set_is_line_or_equality();
-      // Note: simple normalization already holds.
-      sys.sys.rows[i].sign_normalize();
-      // We also move it just after all the other equalities,
-      // so that system `sys_rows' keeps its partial sortedness.
-      if (i != num_lines_or_equalities) {
-        sys.sys.rows[i].m_swap(sys.sys.rows[num_lines_or_equalities]);
-	swap(sat[i], sat[num_lines_or_equalities]);
-	swap(num_saturators[i], num_saturators[num_lines_or_equalities]);
-      }
-      ++num_lines_or_equalities;
-      // `sys' is no longer sorted.
-      sys_sorted = false;
-    }
-    else
-      // There exists a generator which does not saturate `sys[i]',
-      // so that `sys[i]' is indeed an inequality.
-      // We store the number of its saturators.
-      num_saturators[i] = num_cols_sat - sat[i].count_ones();
-  }
-
-  sys.set_sorted(sys_sorted);
-  PPL_ASSERT(sys.OK());
-
-  // At this point, all the equalities of `sys' (included those
-  // inequalities that we just transformed to equalities) have
-  // indexes between 0 and `num_lines_or_equalities' - 1,
-  // which is the property needed by method gauss().
-  // We can simplify the system of equalities, obtaining the rank
-  // of `sys' as result.
-  const dimension_type rank = sys.gauss(num_lines_or_equalities);
-
-  // Now the irredundant equalities of `sys' have indexes from 0
-  // to `rank' - 1, whereas the equalities having indexes from `rank'
-  // to `num_lines_or_equalities' - 1 are all redundant.
-  // (The inequalities in `sys' have been left untouched.)
-  // The rows containing equalities are not sorted.
-
-  if (rank < num_lines_or_equalities) {
-    // We identified some redundant equalities.
-    // Moving them at the bottom of `sys':
-    // - index `redundant' runs through the redundant equalities
-    // - index `erasing' identifies the first row that should
-    //   be erased after this loop.
-    // Note that we exit the loop either because we have removed all
-    // redundant equalities or because we have moved all the
-    // inequalities.
-    for (dimension_type redundant = rank,
-	   erasing = num_rows;
-	 redundant < num_lines_or_equalities
-	   && erasing > num_lines_or_equalities;
-	 ) {
-      --erasing;
-      sys.remove_row(redundant);
-      swap(sat[redundant], sat[erasing]);
-      swap(num_saturators[redundant], num_saturators[erasing]);
-      ++redundant;
-    }
-    // Adjusting the value of `num_rows' to the number of meaningful
-    // rows of `sys': `num_lines_or_equalities' - `rank' is the number of
-    // redundant equalities moved to the bottom of `sys', which are
-    // no longer meaningful.
-    num_rows -= num_lines_or_equalities - rank;
-
-    // If the above loop exited because it moved all inequalities, it may not
-    // have removed all the rendundant rows.
-    sys.remove_trailing_rows(sys.num_rows() - num_rows);
-
-    PPL_ASSERT(sys.num_rows() == num_rows);
-
-    sat.remove_trailing_rows(num_lines_or_equalities - rank);
-
-    // Adjusting the value of `num_lines_or_equalities'.
-    num_lines_or_equalities = rank;
-  }
-
-  const dimension_type old_num_rows = sys.num_rows();
-
-  // Now we use the definition of redundancy (given in the Introduction)
-  // to remove redundant inequalities.
-
-  // First we check the saturation rule, which provides a necessary
-  // condition for an inequality to be irredundant (i.e., it provides
-  // a sufficient condition for identifying redundant inequalities).
-  // Let
-  //
-  //   num_saturators[i] = num_sat_lines[i] + num_sat_rays_or_points[i],
-  //   dim_lin_space = num_irredundant_lines,
-  //   dim_ray_space
-  //     = dim_vector_space - num_irredundant_equalities - dim_lin_space
-  //     = num_columns - 1 - num_lines_or_equalities - dim_lin_space,
-  //   min_sat_rays_or_points = dim_ray_space.
-  //
-  // An inequality saturated by less than `dim_ray_space' _rays/points_
-  // is redundant. Thus we have the implication
-  //
-  //   (num_saturators[i] - num_sat_lines[i] < dim_ray_space)
-  //      ==>
-  //        redundant(sys[i]).
-  //
-  // Moreover, since every line saturates all inequalities, we also have
-  //     dim_lin_space = num_sat_lines[i]
-  // so that we can rewrite the condition above as follows:
-  //
-  //   (num_saturators[i] < num_columns - num_lines_or_equalities - 1)
-  //      ==>
-  //        redundant(sys[i]).
-  //
-  const dimension_type sys_num_columns
-    = sys.topology() == NECESSARILY_CLOSED ? sys.space_dimension() + 1
-                                           : sys.space_dimension() + 2;
-  const dimension_type min_saturators
-    = sys_num_columns - num_lines_or_equalities - 1;
-  for (dimension_type i = num_lines_or_equalities; i < num_rows; ) {
-    if (num_saturators[i] < min_saturators) {
-      // The inequality `sys[i]' is redundant.
-      --num_rows;
-      sys.remove_row(i);
-      swap(sat[i], sat[num_rows]);
-      swap(num_saturators[i], num_saturators[num_rows]);
-    }
-    else
-      ++i;
-  }
-
-  // Now we check the independence rule.
-  for (dimension_type i = num_lines_or_equalities; i < num_rows; ) {
-    bool redundant = false;
-    // NOTE: in the inner loop, index `j' runs through _all_ the
-    // inequalities and we do not test if `sat[i]' is strictly
-    // contained into `sat[j]'.  Experimentation has shown that this
-    // is faster than having `j' only run through the indexes greater
-    // than `i' and also doing the test `strict_subset(sat[i],
-    // sat[k])'.
-    for (dimension_type j = num_lines_or_equalities; j < num_rows; ) {
-      if (i == j)
-	// We want to compare different rows of `sys'.
-	++j;
-      else {
-	// Let us recall that each generator lies on a facet of the
-	// polyhedron (see the Introduction).
-	// Given two constraints `c_1' and `c_2', if there are `m'
-	// generators lying on the hyper-plane corresponding to `c_1',
-	// the same `m' generators lie on the hyper-plane
-	// corresponding to `c_2', too, and there is another one lying
-	// on the latter but not on the former, then `c_2' is more
-	// restrictive than `c_1', i.e., `c_1' is redundant.
-	bool strict_subset;
-	if (subset_or_equal(sat[j], sat[i], strict_subset))
-	  if (strict_subset) {
-	    // All the saturators of the inequality `sys[i]' are
-	    // saturators of the inequality `sys[j]' too,
-	    // and there exists at least one saturator of `sys[j]'
-	    // which is not a saturator of `sys[i]'.
-	    // It follows that inequality `sys[i]' is redundant.
-	    redundant = true;
-	    break;
-	  }
-	  else {
-	    // We have `sat[j] == sat[i]'.  Hence inequalities
-	    // `sys[i]' and `sys[j]' are saturated by the same set of
-	    // generators. Then we can remove either one of the two
-	    // inequalities: we remove `sys[j]'.
-	    --num_rows;
-            sys.remove_row(j);
-            PPL_ASSERT(sys.num_rows() == num_rows);
-	    swap(sat[j], sat[num_rows]);
-	    swap(num_saturators[j], num_saturators[num_rows]);
-	  }
-	else
-	  // If we reach this point then we know that `sat[i]' does
-	  // not contain (and is different from) `sat[j]', so that
-	  // `sys[i]' is not made redundant by inequality `sys[j]'.
-	  ++j;
-      }
-    }
-    if (redundant) {
-      // The inequality `sys[i]' is redundant.
-      --num_rows;
-      sys.remove_row(i);
-      PPL_ASSERT(sys.num_rows() == num_rows);
-      swap(sat[i], sat[num_rows]);
-      swap(num_saturators[i], num_saturators[num_rows]);
-    }
-    else
-      // The inequality `sys[i]' is not redundant.
-      ++i;
-  }
-
-  // Here we physically remove the `sat' rows corresponding to the redundant
-  // inequalities previously removed from `sys'.
-  sat.remove_trailing_rows(old_num_rows - num_rows);
-
-  // At this point the first `num_lines_or_equalities' rows of 'sys'
-  // represent the irredundant equalities, while the remaining rows
-  // (i.e., those having indexes from `num_lines_or_equalities' to
-  // `num_rows' - 1) represent the irredundant inequalities.
-#ifndef NDEBUG
-  // Check if the flag is set (that of the equalities is already set).
-  for (dimension_type i = num_lines_or_equalities; i < num_rows; ++i)
-    PPL_ASSERT(sys[i].is_ray_or_point_or_inequality());
-#endif
-
-  // Finally, since now the sub-system (of `sys') of the irredundant
-  // equalities is in triangular form, we back substitute each
-  // variables with the expression obtained considering the equalities
-  // starting from the last one.
-  sys.back_substitute(num_lines_or_equalities);
-
-  // The returned value is the number of irredundant equalities i.e.,
-  // the rank of the sub-system of `sys' containing only equalities.
-  // (See the Introduction for definition of lineality space dimension.)
-  return num_lines_or_equalities;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Polyhedron_simplify_templates_hh)
diff --git a/src/Polyhedron_simplify_templates.hh b/src/Polyhedron_simplify_templates.hh
new file mode 100644
index 0000000..ce41ac4
--- /dev/null
+++ b/src/Polyhedron_simplify_templates.hh
@@ -0,0 +1,340 @@
+/* Polyhedron class implementation: simplify().
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_simplify_templates_hh
+#define PPL_Polyhedron_simplify_templates_hh 1
+
+#include "Bit_Matrix_defs.hh"
+#include "Polyhedron_defs.hh"
+#include <cstddef>
+#include <limits>
+
+namespace Parma_Polyhedra_Library {
+
+/*!
+  \return
+  The rank of \p sys.
+
+  \param sys
+  The system to simplify: it will be modified;
+
+  \param sat
+  The saturation matrix corresponding to \p sys.
+
+  \p sys may be modified by swapping some of its rows and by possibly
+  removing some of them, if they turn out to be redundant.
+
+  If \p sys is a system of constraints, then the rows of \p sat are
+  indexed by constraints and its columns are indexed by generators;
+  otherwise, if \p sys is a system of generators, then the rows of
+  \p sat are indexed by generators and its columns by constraints.
+
+  Given a system of constraints or a system of generators, this function
+  simplifies it using Gauss' elimination method (to remove redundant
+  equalities/lines), deleting redundant inequalities/rays/points and
+  making back-substitution.
+  The explanation that follows assumes that \p sys is a system of
+  constraints. For the case when \p sys is a system of generators,
+  a similar explanation can be obtain by applying duality.
+
+  The explanation relies on the notion of <EM>redundancy</EM>.
+  (See the Introduction.)
+
+  First we make some observations that can help the reader
+  in understanding the function:
+
+  Proposition: An inequality that is saturated by all the generators
+  can be transformed to an equality.
+
+  In fact, by combining any number of generators that saturate the
+  constraints, we obtain a generator that saturates the constraints too:
+  \f[
+    \langle \vect{c}, \vect{r}_1 \rangle = 0 \land
+    \langle \vect{c}, \vect{r}_2 \rangle = 0
+    \Rightarrow
+    \langle \vect{c}, (\lambda_1 \vect{r}_1 + \lambda_2 \vect{r}_2) \rangle =
+    \lambda_1 \langle \vect{c}, \vect{r}_1 \rangle
+    + \lambda_2 \langle \vect{c}, \vect{r}_2 \rangle
+    = 0,
+  \f]
+  where \f$\lambda_1, \lambda_2\f$ can be any real number.
+*/
+template <typename Linear_System1>
+dimension_type
+Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
+
+  typedef typename Linear_System1::row_type sys_row_type;
+
+  dimension_type num_rows = sys.num_rows();
+  const dimension_type num_cols_sat = sat.num_columns();
+
+  using std::swap;
+
+  // Looking for the first inequality in `sys'.
+  dimension_type num_lines_or_equalities = 0;
+  while (num_lines_or_equalities < num_rows
+         && sys[num_lines_or_equalities].is_line_or_equality())
+    ++num_lines_or_equalities;
+
+  // `num_saturators[i]' will contain the number of generators
+  // that saturate the constraint `sys[i]'.
+  if (num_rows > simplify_num_saturators_size) {
+    delete [] simplify_num_saturators_p;
+    simplify_num_saturators_p = 0;
+    simplify_num_saturators_size = 0;
+    const size_t max_size
+      = std::numeric_limits<size_t>::max() / sizeof(dimension_type);
+    const size_t new_size = compute_capacity(num_rows, max_size);
+    simplify_num_saturators_p = new dimension_type[new_size];
+    simplify_num_saturators_size = new_size;
+  }
+  dimension_type* const num_saturators = simplify_num_saturators_p;
+
+  bool sys_sorted = sys.is_sorted();
+
+  // Computing the number of saturators for each inequality,
+  // possibly identifying and swapping those that happen to be
+  // equalities (see Proposition above).
+  for (dimension_type i = num_lines_or_equalities; i < num_rows; ++i) {
+    if (sat[i].empty()) {
+      // The constraint `sys_rows[i]' is saturated by all the generators.
+      // Thus, either it is already an equality or it can be transformed
+      // to an equality (see Proposition above).
+      sys.sys.rows[i].set_is_line_or_equality();
+      // Note: simple normalization already holds.
+      sys.sys.rows[i].sign_normalize();
+      // We also move it just after all the other equalities,
+      // so that system `sys_rows' keeps its partial sortedness.
+      if (i != num_lines_or_equalities) {
+        sys.sys.rows[i].m_swap(sys.sys.rows[num_lines_or_equalities]);
+        swap(sat[i], sat[num_lines_or_equalities]);
+        swap(num_saturators[i], num_saturators[num_lines_or_equalities]);
+      }
+      ++num_lines_or_equalities;
+      // `sys' is no longer sorted.
+      sys_sorted = false;
+    }
+    else
+      // There exists a generator which does not saturate `sys[i]',
+      // so that `sys[i]' is indeed an inequality.
+      // We store the number of its saturators.
+      num_saturators[i] = num_cols_sat - sat[i].count_ones();
+  }
+
+  sys.set_sorted(sys_sorted);
+  PPL_ASSERT(sys.OK());
+
+  // At this point, all the equalities of `sys' (included those
+  // inequalities that we just transformed to equalities) have
+  // indexes between 0 and `num_lines_or_equalities' - 1,
+  // which is the property needed by method gauss().
+  // We can simplify the system of equalities, obtaining the rank
+  // of `sys' as result.
+  const dimension_type rank = sys.gauss(num_lines_or_equalities);
+
+  // Now the irredundant equalities of `sys' have indexes from 0
+  // to `rank' - 1, whereas the equalities having indexes from `rank'
+  // to `num_lines_or_equalities' - 1 are all redundant.
+  // (The inequalities in `sys' have been left untouched.)
+  // The rows containing equalities are not sorted.
+
+  if (rank < num_lines_or_equalities) {
+    // We identified some redundant equalities.
+    // Moving them at the bottom of `sys':
+    // - index `redundant' runs through the redundant equalities
+    // - index `erasing' identifies the first row that should
+    //   be erased after this loop.
+    // Note that we exit the loop either because we have removed all
+    // redundant equalities or because we have moved all the
+    // inequalities.
+    for (dimension_type redundant = rank,
+           erasing = num_rows;
+         redundant < num_lines_or_equalities
+           && erasing > num_lines_or_equalities;
+         ) {
+      --erasing;
+      sys.remove_row(redundant);
+      swap(sat[redundant], sat[erasing]);
+      swap(num_saturators[redundant], num_saturators[erasing]);
+      ++redundant;
+    }
+    // Adjusting the value of `num_rows' to the number of meaningful
+    // rows of `sys': `num_lines_or_equalities' - `rank' is the number of
+    // redundant equalities moved to the bottom of `sys', which are
+    // no longer meaningful.
+    num_rows -= num_lines_or_equalities - rank;
+
+    // If the above loop exited because it moved all inequalities, it may not
+    // have removed all the rendundant rows.
+    sys.remove_trailing_rows(sys.num_rows() - num_rows);
+
+    PPL_ASSERT(sys.num_rows() == num_rows);
+
+    sat.remove_trailing_rows(num_lines_or_equalities - rank);
+
+    // Adjusting the value of `num_lines_or_equalities'.
+    num_lines_or_equalities = rank;
+  }
+
+  const dimension_type old_num_rows = sys.num_rows();
+
+  // Now we use the definition of redundancy (given in the Introduction)
+  // to remove redundant inequalities.
+
+  // First we check the saturation rule, which provides a necessary
+  // condition for an inequality to be irredundant (i.e., it provides
+  // a sufficient condition for identifying redundant inequalities).
+  // Let
+  //
+  //   num_saturators[i] = num_sat_lines[i] + num_sat_rays_or_points[i],
+  //   dim_lin_space = num_irredundant_lines,
+  //   dim_ray_space
+  //     = dim_vector_space - num_irredundant_equalities - dim_lin_space
+  //     = num_columns - 1 - num_lines_or_equalities - dim_lin_space,
+  //   min_sat_rays_or_points = dim_ray_space.
+  //
+  // An inequality saturated by less than `dim_ray_space' _rays/points_
+  // is redundant. Thus we have the implication
+  //
+  //   (num_saturators[i] - num_sat_lines[i] < dim_ray_space)
+  //      ==>
+  //        redundant(sys[i]).
+  //
+  // Moreover, since every line saturates all inequalities, we also have
+  //     dim_lin_space = num_sat_lines[i]
+  // so that we can rewrite the condition above as follows:
+  //
+  //   (num_saturators[i] < num_columns - num_lines_or_equalities - 1)
+  //      ==>
+  //        redundant(sys[i]).
+  //
+  const dimension_type sys_num_columns
+    = sys.topology() == NECESSARILY_CLOSED ? sys.space_dimension() + 1
+                                           : sys.space_dimension() + 2;
+  const dimension_type min_saturators
+    = sys_num_columns - num_lines_or_equalities - 1;
+  for (dimension_type i = num_lines_or_equalities; i < num_rows; ) {
+    if (num_saturators[i] < min_saturators) {
+      // The inequality `sys[i]' is redundant.
+      --num_rows;
+      sys.remove_row(i);
+      swap(sat[i], sat[num_rows]);
+      swap(num_saturators[i], num_saturators[num_rows]);
+    }
+    else
+      ++i;
+  }
+
+  // Now we check the independence rule.
+  for (dimension_type i = num_lines_or_equalities; i < num_rows; ) {
+    bool redundant = false;
+    // NOTE: in the inner loop, index `j' runs through _all_ the
+    // inequalities and we do not test if `sat[i]' is strictly
+    // contained into `sat[j]'.  Experimentation has shown that this
+    // is faster than having `j' only run through the indexes greater
+    // than `i' and also doing the test `strict_subset(sat[i],
+    // sat[k])'.
+    for (dimension_type j = num_lines_or_equalities; j < num_rows; ) {
+      if (i == j)
+        // We want to compare different rows of `sys'.
+        ++j;
+      else {
+        // Let us recall that each generator lies on a facet of the
+        // polyhedron (see the Introduction).
+        // Given two constraints `c_1' and `c_2', if there are `m'
+        // generators lying on the hyper-plane corresponding to `c_1',
+        // the same `m' generators lie on the hyper-plane
+        // corresponding to `c_2', too, and there is another one lying
+        // on the latter but not on the former, then `c_2' is more
+        // restrictive than `c_1', i.e., `c_1' is redundant.
+        bool strict_subset;
+        if (subset_or_equal(sat[j], sat[i], strict_subset))
+          if (strict_subset) {
+            // All the saturators of the inequality `sys[i]' are
+            // saturators of the inequality `sys[j]' too,
+            // and there exists at least one saturator of `sys[j]'
+            // which is not a saturator of `sys[i]'.
+            // It follows that inequality `sys[i]' is redundant.
+            redundant = true;
+            break;
+          }
+          else {
+            // We have `sat[j] == sat[i]'.  Hence inequalities
+            // `sys[i]' and `sys[j]' are saturated by the same set of
+            // generators. Then we can remove either one of the two
+            // inequalities: we remove `sys[j]'.
+            --num_rows;
+            sys.remove_row(j);
+            PPL_ASSERT(sys.num_rows() == num_rows);
+            swap(sat[j], sat[num_rows]);
+            swap(num_saturators[j], num_saturators[num_rows]);
+          }
+        else
+          // If we reach this point then we know that `sat[i]' does
+          // not contain (and is different from) `sat[j]', so that
+          // `sys[i]' is not made redundant by inequality `sys[j]'.
+          ++j;
+      }
+    }
+    if (redundant) {
+      // The inequality `sys[i]' is redundant.
+      --num_rows;
+      sys.remove_row(i);
+      PPL_ASSERT(sys.num_rows() == num_rows);
+      swap(sat[i], sat[num_rows]);
+      swap(num_saturators[i], num_saturators[num_rows]);
+    }
+    else
+      // The inequality `sys[i]' is not redundant.
+      ++i;
+  }
+
+  // Here we physically remove the `sat' rows corresponding to the redundant
+  // inequalities previously removed from `sys'.
+  sat.remove_trailing_rows(old_num_rows - num_rows);
+
+  // At this point the first `num_lines_or_equalities' rows of 'sys'
+  // represent the irredundant equalities, while the remaining rows
+  // (i.e., those having indexes from `num_lines_or_equalities' to
+  // `num_rows' - 1) represent the irredundant inequalities.
+#ifndef NDEBUG
+  // Check if the flag is set (that of the equalities is already set).
+  for (dimension_type i = num_lines_or_equalities; i < num_rows; ++i)
+    PPL_ASSERT(sys[i].is_ray_or_point_or_inequality());
+#endif
+
+  // Finally, since now the sub-system (of `sys') of the irredundant
+  // equalities is in triangular form, we back substitute each
+  // variables with the expression obtained considering the equalities
+  // starting from the last one.
+  sys.back_substitute(num_lines_or_equalities);
+
+  // The returned value is the number of irredundant equalities i.e.,
+  // the rank of the sub-system of `sys' containing only equalities.
+  // (See the Introduction for definition of lineality space dimension.)
+  return num_lines_or_equalities;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_simplify_templates_hh)
diff --git a/src/Polyhedron_templates.hh b/src/Polyhedron_templates.hh
new file mode 100644
index 0000000..e604fc1
--- /dev/null
+++ b/src/Polyhedron_templates.hh
@@ -0,0 +1,579 @@
+/* Polyhedron class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Polyhedron_templates_hh
+#define PPL_Polyhedron_templates_hh 1
+
+#include "Generator_defs.hh"
+#include "MIP_Problem_defs.hh"
+#include "Interval_defs.hh"
+#include "Linear_Form_defs.hh"
+// For static method overflows.
+#include "Floating_Point_Expression_defs.hh"
+#include <algorithm>
+#include <deque>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Interval>
+Polyhedron::Polyhedron(Topology topol,
+                       const Box<Interval>& box,
+                       Complexity_Class)
+  : con_sys(topol, default_con_sys_repr),
+    gen_sys(topol, default_gen_sys_repr),
+    sat_c(),
+    sat_g() {
+  // Initialize the space dimension as indicated by the box.
+  space_dim = box.space_dimension();
+
+  // Check for emptiness.
+  if (box.is_empty()) {
+    set_empty();
+    return;
+  }
+
+  // Zero-dim universe polyhedron.
+  if (space_dim == 0) {
+    set_zero_dim_univ();
+    return;
+  }
+
+  // Properly set the space dimension of `con_sys'.
+  con_sys.set_space_dimension(space_dim);
+
+  PPL_DIRTY_TEMP_COEFFICIENT(l_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(l_d);
+  PPL_DIRTY_TEMP_COEFFICIENT(u_n);
+  PPL_DIRTY_TEMP_COEFFICIENT(u_d);
+
+  if (topol == NECESSARILY_CLOSED) {
+    for (dimension_type k = space_dim; k-- > 0; ) {
+      const Variable v_k = Variable(k);
+      // See if we have a valid lower bound.
+      bool l_closed = false;
+      bool l_bounded = box.has_lower_bound(v_k, l_n, l_d, l_closed);
+      // See if we have a valid upper bound.
+      bool u_closed = false;
+      bool u_bounded = box.has_upper_bound(v_k, u_n, u_d, u_closed);
+
+      // See if we have an implicit equality constraint.
+      if (l_bounded && u_bounded
+          && l_closed && u_closed
+          && l_n == u_n && l_d == u_d) {
+        // Add the constraint `l_d*v_k == l_n'.
+        con_sys.insert(l_d * v_k == l_n);
+      }
+      else {
+        if (l_bounded)
+          // Add the constraint `l_d*v_k >= l_n'.
+          con_sys.insert(l_d * v_k >= l_n);
+        if (u_bounded)
+          // Add the constraint `u_d*v_k <= u_n'.
+          con_sys.insert(u_d * v_k <= u_n);
+      }
+    }
+  }
+  else {
+    // topol == NOT_NECESSARILY_CLOSED
+    for (dimension_type k = space_dim; k-- > 0; ) {
+      const Variable v_k = Variable(k);
+      // See if we have a valid lower bound.
+      bool l_closed = false;
+      bool l_bounded = box.has_lower_bound(v_k, l_n, l_d, l_closed);
+      // See if we have a valid upper bound.
+      bool u_closed = false;
+      bool u_bounded = box.has_upper_bound(v_k, u_n, u_d, u_closed);
+
+      // See if we have an implicit equality constraint.
+      if (l_bounded && u_bounded
+          && l_closed && u_closed
+          && l_n == u_n && l_d == u_d) {
+        // Add the constraint `l_d*v_k == l_n'.
+        con_sys.insert(l_d * v_k == l_n);
+      }
+      else {
+        // Check if a lower bound constraint is required.
+        if (l_bounded) {
+          if (l_closed)
+            // Add the constraint `l_d*v_k >= l_n'.
+            con_sys.insert(l_d * v_k >= l_n);
+          else
+            // Add the constraint `l_d*v_k > l_n'.
+            con_sys.insert(l_d * v_k > l_n);
+        }
+        // Check if an upper bound constraint is required.
+        if (u_bounded) {
+          if (u_closed)
+            // Add the constraint `u_d*v_k <= u_n'.
+            con_sys.insert(u_d * v_k <= u_n);
+          else
+            // Add the constraint `u_d*v_k < u_n'.
+            con_sys.insert(u_d * v_k < u_n);
+        }
+      }
+    }
+  }
+
+  // Adding the low-level constraints.
+  con_sys.add_low_level_constraints();
+
+  // Constraints are up-to-date.
+  set_constraints_up_to_date();
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename Partial_Function>
+void
+Polyhedron::map_space_dimensions(const Partial_Function& pfunc) {
+  if (space_dim == 0)
+    return;
+
+  if (pfunc.has_empty_codomain()) {
+    // All dimensions vanish: the polyhedron becomes zero_dimensional.
+    if (marked_empty()
+        || (has_pending_constraints()
+            && !remove_pending_to_obtain_generators())
+        || (!generators_are_up_to_date() && !update_generators())) {
+      // Removing all dimensions from the empty polyhedron.
+      space_dim = 0;
+      con_sys.clear();
+    }
+    else
+      // Removing all dimensions from a non-empty polyhedron.
+      set_zero_dim_univ();
+
+    PPL_ASSERT_HEAVY(OK());
+    return;
+  }
+
+  const dimension_type new_space_dimension = pfunc.max_in_codomain() + 1;
+
+  if (new_space_dimension == space_dim) {
+    // The partial function `pfunc' is indeed total and thus specifies
+    // a permutation, that is, a renaming of the dimensions.  For
+    // maximum efficiency, we will simply permute the columns of the
+    // constraint system and/or the generator system.
+
+    std::vector<Variable> cycle;
+    cycle.reserve(space_dim);
+
+    // Used to mark elements as soon as they are inserted in a cycle.
+    std::deque<bool> visited(space_dim);
+
+    for (dimension_type i = space_dim; i-- > 0; ) {
+      if (visited[i])
+        continue;
+
+      dimension_type j = i;
+      do {
+        visited[j] = true;
+        // The following initialization is only to make the compiler happy.
+        dimension_type k = 0;
+        if (!pfunc.maps(j, k))
+          throw_invalid_argument("map_space_dimensions(pfunc)",
+                                 " pfunc is inconsistent");
+        if (k == j)
+          break;
+
+        cycle.push_back(Variable(j));
+        // Go along the cycle.
+        j = k;
+      } while (!visited[j]);
+
+      // End of cycle.
+
+      // Permute all that is up-to-date.  Notice that the contents of
+      // the saturation matrices is unaffected by the permutation of
+      // columns: they remain valid, if they were so.
+      if (constraints_are_up_to_date())
+        con_sys.permute_space_dimensions(cycle);
+
+      if (generators_are_up_to_date())
+        gen_sys.permute_space_dimensions(cycle);
+
+      cycle.clear();
+    }
+
+    PPL_ASSERT_HEAVY(OK());
+    return;
+  }
+
+  // If control gets here, then `pfunc' is not a permutation and some
+  // dimensions must be projected away.
+
+  // If there are pending constraints, using `generators()' we process them.
+  const Generator_System& old_gensys = generators();
+
+  if (old_gensys.has_no_rows()) {
+    // The polyhedron is empty.
+    Polyhedron new_polyhedron(topology(), new_space_dimension, EMPTY);
+    m_swap(new_polyhedron);
+    PPL_ASSERT_HEAVY(OK());
+    return;
+  }
+
+  // Make a local copy of the partial function.
+  std::vector<dimension_type> pfunc_maps(space_dim, not_a_dimension());
+  for (dimension_type j = space_dim; j-- > 0; ) {
+    dimension_type pfunc_j;
+    if (pfunc.maps(j, pfunc_j))
+      pfunc_maps[j] = pfunc_j;
+  }
+
+  Generator_System new_gensys;
+  for (Generator_System::const_iterator i = old_gensys.begin(),
+         old_gensys_end = old_gensys.end(); i != old_gensys_end; ++i) {
+    const Generator& old_g = *i;
+    const Generator::expr_type old_e = old_g.expression();
+    Linear_Expression expr;
+    expr.set_space_dimension(new_space_dimension);
+    bool all_zeroes = true;
+    for (Generator::expr_type::const_iterator j = old_e.begin(),
+          j_end = old_e.end(); j != j_end; ++j) {
+      const dimension_type mapped_id = pfunc_maps[j.variable().id()];
+      if (mapped_id != not_a_dimension()) {
+        add_mul_assign(expr, *j, Variable(mapped_id));
+        all_zeroes = false;
+      }
+    }
+    switch (old_g.type()) {
+    case Generator::LINE:
+      if (!all_zeroes)
+        new_gensys.insert(line(expr));
+      break;
+    case Generator::RAY:
+      if (!all_zeroes)
+        new_gensys.insert(ray(expr));
+      break;
+    case Generator::POINT:
+      // A point in the origin has all zero homogeneous coefficients.
+      new_gensys.insert(point(expr, old_g.divisor()));
+      break;
+    case Generator::CLOSURE_POINT:
+      // A closure point in the origin has all zero homogeneous coefficients.
+      new_gensys.insert(closure_point(expr, old_g.divisor()));
+      break;
+    }
+  }
+  Polyhedron new_polyhedron(topology(), new_gensys);
+  m_swap(new_polyhedron);
+  PPL_ASSERT_HEAVY(OK(true));
+}
+
+template <typename FP_Format, typename Interval_Info>
+void
+Polyhedron::refine_with_linear_form_inequality(
+  const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
+  const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
+  const bool is_strict) {
+
+  // Check that FP_Format is indeed a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
+                         "Polyhedron::refine_with_linear_form_inequality:"
+                         " FP_Format not a floating point type.");
+
+  // Dimension compatibility checks.
+  // The dimensions of left and right should not be greater than the
+  // dimension of *this.
+  const dimension_type left_space_dim = left.space_dimension();
+  if (space_dim < left_space_dim)
+    throw_dimension_incompatible(
+          "refine_with_linear_form_inequality(l1, l2, s)", "l1", left);
+
+  const dimension_type right_space_dim = right.space_dimension();
+  if (space_dim < right_space_dim)
+    throw_dimension_incompatible(
+          "refine_with_linear_form_inequality(l1, l2, s)", "l2", right);
+
+  // We assume that the analyzer will not refine an unreachable test.
+  PPL_ASSERT(!marked_empty());
+
+  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
+  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
+
+  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
+      overflows(left))
+    return;
+
+  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
+      overflows(right))
+    return;
+
+  // Overapproximate left - right.
+  FP_Linear_Form left_minus_right(left);
+  left_minus_right -= right;
+  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
+      overflows(left_minus_right))
+    return;
+
+  dimension_type lf_space_dim = left_minus_right.space_dimension();
+  FP_Linear_Form lf_approx;
+  overapproximate_linear_form(left_minus_right, lf_space_dim, lf_approx);
+  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
+      overflows(lf_approx))
+    return;
+
+  // Normalize left - right.
+  Linear_Expression lf_approx_le;
+  convert_to_integer_expression(lf_approx, lf_space_dim, lf_approx_le);
+
+  // Finally, do the refinement.
+  if (!is_strict || is_necessarily_closed())
+    refine_with_constraint(lf_approx_le <= 0);
+  else
+    refine_with_constraint(lf_approx_le < 0);
+}
+
+template <typename FP_Format, typename Interval_Info>
+void
+Polyhedron::affine_form_image(const Variable var,
+const Linear_Form<Interval <FP_Format, Interval_Info> >& lf) {
+
+  // Check that FP_Format is indeed a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
+                         "Polyhedron::affine_form_image:"
+                         " FP_Format not a floating point type.");
+
+  // Dimension compatibility checks.
+  // The dimension of lf should not be greater than the dimension of *this.
+  const dimension_type lf_space_dim = lf.space_dimension();
+  if (space_dim < lf_space_dim)
+    throw_dimension_incompatible("affine_form_image(v, l, s)", "l", lf);
+
+  // `var' should be one of the dimensions of the polyhedron.
+  const dimension_type var_id = var.id();
+  if (space_dim < var_id + 1)
+    throw_dimension_incompatible("affine_form_image(v, l, s)", "v", var);
+
+  // We assume that the analyzer will not perform an unreachable assignment.
+  PPL_ASSERT(!marked_empty());
+
+  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
+  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
+
+  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
+      overflows(lf)) {
+    *this = Polyhedron(topology(), space_dim, UNIVERSE);
+    return;
+  }
+
+  // Overapproximate lf.
+  FP_Linear_Form lf_approx;
+  overapproximate_linear_form(lf, lf_space_dim, lf_approx);
+
+  if (Floating_Point_Expression<FP_Interval_Type, float_ieee754_single>::
+      overflows(lf_approx)) {
+    *this = Polyhedron(topology(), space_dim, UNIVERSE);
+    return;
+  }
+
+  // Normalize lf.
+  Linear_Expression lf_approx_le;
+  PPL_DIRTY_TEMP_COEFFICIENT(lo_coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(hi_coeff);
+  PPL_DIRTY_TEMP_COEFFICIENT(denominator);
+  convert_to_integer_expressions(lf_approx, lf_space_dim, lf_approx_le,
+                                 lo_coeff, hi_coeff, denominator);
+
+  // Finally, do the assignment.
+  bounded_affine_image(var, lf_approx_le + lo_coeff, lf_approx_le + hi_coeff,
+                       denominator);
+}
+
+template <typename FP_Format, typename Interval_Info>
+void
+Polyhedron::overapproximate_linear_form
+(const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+ const dimension_type lf_dimension,
+ Linear_Form<Interval <FP_Format, Interval_Info> >& result) {
+
+  // Check that FP_Format is indeed a floating point type.
+  PPL_COMPILE_TIME_CHECK(!std::numeric_limits<FP_Format>::is_exact,
+                         "Polyhedron::overapproximate_linear_form:"
+                         " FP_Format not a floating point type.");
+
+  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
+  typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
+
+  // Build a Box from the Polyhedron so that we can extract upper and
+  // lower bounds of variables easily.
+  Box<FP_Interval_Type> box(*this);
+
+  result = FP_Linear_Form(lf.inhomogeneous_term());
+  // FIXME: this may not be policy-neutral.
+  const FP_Interval_Type aux_divisor1(static_cast<FP_Format>(0.5));
+  FP_Interval_Type aux_divisor2(aux_divisor1);
+  aux_divisor2.lower() = static_cast<FP_Format>(-0.5);
+
+  for (dimension_type i = 0; i < lf_dimension; ++i) {
+    Variable curr_var(i);
+    const FP_Interval_Type& curr_coeff = lf.coefficient(curr_var);
+    PPL_ASSERT(curr_coeff.is_bounded());
+    FP_Format curr_lb = curr_coeff.lower();
+    FP_Format curr_ub = curr_coeff.upper();
+    if (curr_lb != 0 || curr_ub != 0) {
+      const FP_Interval_Type& curr_int = box.get_interval(curr_var);
+      FP_Interval_Type curr_addend(curr_ub - curr_lb);
+      curr_addend *= aux_divisor2;
+      curr_addend *= curr_int;
+      result += curr_addend;
+      curr_addend = FP_Interval_Type(curr_lb + curr_ub);
+      curr_addend *= aux_divisor1;
+      FP_Linear_Form curr_addend_lf(curr_var);
+      curr_addend_lf *= curr_addend;
+      result += curr_addend_lf;
+    }
+  }
+}
+
+template <typename FP_Format, typename Interval_Info>
+void
+Polyhedron::convert_to_integer_expression(
+                const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+                const dimension_type lf_dimension,
+                Linear_Expression& result) {
+  result = Linear_Expression();
+
+  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
+  std::vector<Coefficient> numerators(lf_dimension+1);
+  std::vector<Coefficient> denominators(lf_dimension+1);
+
+  // Convert each floating point number to a pair <numerator, denominator>
+  // and compute the lcm of all denominators.
+  PPL_DIRTY_TEMP_COEFFICIENT(lcm);
+  lcm = 1;
+  const FP_Interval_Type& b = lf.inhomogeneous_term();
+  // FIXME: are these checks numerator[i] != 0 really necessary?
+  numer_denom(b.lower(), numerators[lf_dimension],
+                         denominators[lf_dimension]);
+  if (numerators[lf_dimension] != 0)
+      lcm_assign(lcm, lcm, denominators[lf_dimension]);
+
+  for (dimension_type i = 0; i < lf_dimension; ++i) {
+    const FP_Interval_Type& curr_int = lf.coefficient(Variable(i));
+    numer_denom(curr_int.lower(), numerators[i], denominators[i]);
+    if (numerators[i] != 0)
+      lcm_assign(lcm, lcm, denominators[i]);
+  }
+
+  for (dimension_type i = 0; i < lf_dimension; ++i) {
+    if (numerators[i] != 0) {
+      exact_div_assign(denominators[i], lcm, denominators[i]);
+      numerators[i] *= denominators[i];
+      result += numerators[i] * Variable(i);
+    }
+  }
+
+  if (numerators[lf_dimension] != 0) {
+    exact_div_assign(denominators[lf_dimension],
+                     lcm, denominators[lf_dimension]);
+    numerators[lf_dimension] *= denominators[lf_dimension];
+    result += numerators[lf_dimension];
+  }
+}
+
+template <typename FP_Format, typename Interval_Info>
+void
+Polyhedron::convert_to_integer_expressions(
+                const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+                const dimension_type lf_dimension, Linear_Expression& res,
+                Coefficient& res_low_coeff, Coefficient& res_hi_coeff,
+                Coefficient& denominator) {
+  res = Linear_Expression();
+
+  typedef Interval<FP_Format, Interval_Info> FP_Interval_Type;
+  std::vector<Coefficient> numerators(lf_dimension+2);
+  std::vector<Coefficient> denominators(lf_dimension+2);
+
+  // Convert each floating point number to a pair <numerator, denominator>
+  // and compute the lcm of all denominators.
+  Coefficient& lcm = denominator;
+  lcm = 1;
+  const FP_Interval_Type& b = lf.inhomogeneous_term();
+  numer_denom(b.lower(), numerators[lf_dimension], denominators[lf_dimension]);
+  // FIXME: are these checks numerator[i] != 0 really necessary?
+  if (numerators[lf_dimension] != 0)
+      lcm_assign(lcm, lcm, denominators[lf_dimension]);
+
+  numer_denom(b.upper(), numerators[lf_dimension+1],
+                         denominators[lf_dimension+1]);
+  if (numerators[lf_dimension+1] != 0)
+      lcm_assign(lcm, lcm, denominators[lf_dimension+1]);
+
+  for (dimension_type i = 0; i < lf_dimension; ++i) {
+    const FP_Interval_Type& curr_int = lf.coefficient(Variable(i));
+    numer_denom(curr_int.lower(), numerators[i], denominators[i]);
+    if (numerators[i] != 0)
+      lcm_assign(lcm, lcm, denominators[i]);
+  }
+
+  for (dimension_type i = 0; i < lf_dimension; ++i) {
+    if (numerators[i] != 0) {
+      exact_div_assign(denominators[i], lcm, denominators[i]);
+      numerators[i] *= denominators[i];
+      res += numerators[i] * Variable(i);
+    }
+  }
+
+  if (numerators[lf_dimension] != 0) {
+    exact_div_assign(denominators[lf_dimension],
+                     lcm, denominators[lf_dimension]);
+    numerators[lf_dimension] *= denominators[lf_dimension];
+    res_low_coeff = numerators[lf_dimension];
+  }
+  else
+    res_low_coeff = Coefficient(0);
+
+  if (numerators[lf_dimension+1] != 0) {
+    exact_div_assign(denominators[lf_dimension+1],
+                     lcm, denominators[lf_dimension+1]);
+    numerators[lf_dimension+1] *= denominators[lf_dimension+1];
+    res_hi_coeff = numerators[lf_dimension+1];
+  }
+  else
+    res_hi_coeff = Coefficient(0);
+}
+
+template <typename C>
+void
+Polyhedron::throw_dimension_incompatible(const char* method,
+                                         const char* lf_name,
+                                         const Linear_Form<C>& lf) const {
+  throw_dimension_incompatible(method, lf_name, lf.space_dimension());
+}
+
+template <typename Input>
+Input&
+Polyhedron::check_obj_space_dimension_overflow(Input& input,
+                                               const Topology topol,
+                                               const char* method,
+                                               const char* reason) {
+  check_space_dimension_overflow(input.space_dimension(),
+                                 max_space_dimension(),
+                                 topol, method, reason);
+  return input;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_templates_hh)
diff --git a/src/Polyhedron_types.hh b/src/Polyhedron_types.hh
new file mode 100644
index 0000000..05e67f5
--- /dev/null
+++ b/src/Polyhedron_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Polyhedron_types_hh
+#define PPL_Polyhedron_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Polyhedron;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Polyhedron_types_hh)
diff --git a/src/Polyhedron_widenings.cc b/src/Polyhedron_widenings.cc
index b7c6ee5..6960d2f 100644
--- a/src/Polyhedron_widenings.cc
+++ b/src/Polyhedron_widenings.cc
@@ -1,7 +1,7 @@
 /* Polyhedron class implementation
    (non-inline widening-related member functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,11 +23,11 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Polyhedron.defs.hh"
-#include "BHRZ03_Certificate.defs.hh"
+#include "Polyhedron_defs.hh"
+#include "BHRZ03_Certificate_defs.hh"
 #include "Rational_Box.hh"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
 #include "assert.hh"
 #include <iostream>
 #include <stdexcept>
@@ -38,17 +38,17 @@ namespace PPL = Parma_Polyhedra_Library;
 void
 PPL::Polyhedron
 ::select_CH78_constraints(const Polyhedron& y,
-			  Constraint_System& cs_selection) const {
+                          Constraint_System& cs_selection) const {
   // Private method: the caller must ensure the following conditions.
   PPL_ASSERT(topology() == y.topology()
-	 && topology() == cs_selection.topology()
-	 && space_dim == y.space_dim);
+         && topology() == cs_selection.topology()
+         && space_dim == y.space_dim);
   PPL_ASSERT(!marked_empty()
-	 && !has_pending_constraints()
-	 && generators_are_up_to_date());
+         && !has_pending_constraints()
+         && generators_are_up_to_date());
   PPL_ASSERT(!y.marked_empty()
-	 && !y.has_something_pending()
-	 && y.constraints_are_minimized());
+         && !y.has_something_pending()
+         && y.constraints_are_minimized());
 
   // A constraint in `y.con_sys' is copied to `cs_selection'
   // if it is satisfied by all the generators of `gen_sys'.
@@ -65,21 +65,21 @@ PPL::Polyhedron
 void
 PPL::Polyhedron
 ::select_H79_constraints(const Polyhedron& y,
-			 Constraint_System& cs_selected,
-			 Constraint_System& cs_not_selected) const {
+                         Constraint_System& cs_selected,
+                         Constraint_System& cs_not_selected) const {
   // Private method: the caller must ensure the following conditions
   // (beside the inclusion `y <= x').
   PPL_ASSERT(topology() == y.topology()
-	 && topology() == cs_selected.topology()
-	 && topology() == cs_not_selected.topology());
+         && topology() == cs_selected.topology()
+         && topology() == cs_not_selected.topology());
   PPL_ASSERT(space_dim == y.space_dim);
   PPL_ASSERT(!marked_empty()
-	 && !has_pending_generators()
-	 && constraints_are_up_to_date());
+         && !has_pending_generators()
+         && constraints_are_up_to_date());
   PPL_ASSERT(!y.marked_empty()
-	 && !y.has_something_pending()
-	 && y.constraints_are_minimized()
-	 && y.generators_are_up_to_date());
+         && !y.has_something_pending()
+         && y.constraints_are_minimized()
+         && y.generators_are_up_to_date());
 
   // FIXME: this is a workaround for NNC polyhedra.
   if (!y.is_necessarily_closed()) {
@@ -140,11 +140,11 @@ PPL::Polyhedron
       const int sp_sgn = Scalar_Products::sign(ci, y.gen_sys[j]);
       // We are assuming that `y <= x'.
       PPL_ASSERT(sp_sgn >= 0
-	     || (!is_necessarily_closed()
-		 && ci.is_strict_inequality()
-		 && y.gen_sys[j].is_point()));
+             || (!is_necessarily_closed()
+                 && ci.is_strict_inequality()
+                 && y.gen_sys[j].is_point()));
       if (sp_sgn > 0)
-	buffer.set(j);
+        buffer.set(j);
     }
     // We check whether `buffer' is a row of `tmp_sat_g',
     // exploiting its sortedness in order to have faster comparisons.
@@ -220,14 +220,14 @@ PPL::Polyhedron::H79_widening_assign(const Polyhedron& y, unsigned* tp) {
       // Check whether we are using the widening-with-tokens technique
       // and there still are tokens available.
       if (tp != 0 && *tp > 0) {
-	// There are tokens available. If `CH78' is not a subset of `x',
-	// then it is less precise and we use one of the available tokens.
-	if (!x.contains(CH78))
-	  --(*tp);
+        // There are tokens available. If `CH78' is not a subset of `x',
+        // then it is less precise and we use one of the available tokens.
+        if (!x.contains(CH78))
+          --(*tp);
       }
       else
-	// No tokens.
-	x.m_swap(CH78);
+        // No tokens.
+        x.m_swap(CH78);
       PPL_ASSERT_HEAVY(x.OK(true));
       return;
     }
@@ -271,7 +271,7 @@ PPL::Polyhedron::H79_widening_assign(const Polyhedron& y, unsigned* tp) {
       // There are tokens available. If `H79' is not a subset of `x',
       // then it is less precise and we use one of the available tokens.
       if (!x.contains(H79))
-	--(*tp);
+        --(*tp);
     }
     else
       // No tokens.
@@ -282,8 +282,8 @@ PPL::Polyhedron::H79_widening_assign(const Polyhedron& y, unsigned* tp) {
 
 void
 PPL::Polyhedron::limited_H79_extrapolation_assign(const Polyhedron& y,
-						  const Constraint_System& cs,
-						  unsigned* tp) {
+                                                  const Constraint_System& cs,
+                                                  unsigned* tp) {
   Polyhedron& x = *this;
 
   const dimension_type cs_num_rows = cs.num_rows();
@@ -297,24 +297,24 @@ PPL::Polyhedron::limited_H79_extrapolation_assign(const Polyhedron& y,
   if (x.is_necessarily_closed()) {
     if (!y.is_necessarily_closed())
       throw_topology_incompatible("limited_H79_extrapolation_assign(y, cs)",
-				  "y", y);
+                                  "y", y);
     if (cs.has_strict_inequalities())
       throw_topology_incompatible("limited_H79_extrapolation_assign(y, cs)",
-				  "cs", cs);
+                                  "cs", cs);
   }
   else if (y.is_necessarily_closed())
     throw_topology_incompatible("limited_H79_extrapolation_assign(y, cs)",
-				"y", y);
+                                "y", y);
 
   // Dimension-compatibility check.
   if (x.space_dim != y.space_dim)
     throw_dimension_incompatible("limited_H79_extrapolation_assign(y, cs)",
-				 "y", y);
+                                 "y", y);
   // `cs' must be dimension-compatible with the two polyhedra.
   const dimension_type cs_space_dim = cs.space_dimension();
   if (x.space_dim < cs_space_dim)
     throw_dimension_incompatible("limited_H79_extrapolation_assign(y, cs)",
-				 "cs", cs);
+                                 "cs", cs);
 
   // Assume `y' is contained in or equal to `x'.
   PPL_EXPECT_HEAVY(copy_contains(x, y));
@@ -360,10 +360,10 @@ PPL::Polyhedron::limited_H79_extrapolation_assign(const Polyhedron& y,
 
 void
 PPL::Polyhedron::bounded_H79_extrapolation_assign(const Polyhedron& y,
-						  const Constraint_System& cs,
-						  unsigned* tp) {
+                                                  const Constraint_System& cs,
+                                                  unsigned* tp) {
   Rational_Box x_box(*this, ANY_COMPLEXITY);
-  Rational_Box y_box(y, ANY_COMPLEXITY);
+  const Rational_Box y_box(y, ANY_COMPLEXITY);
   x_box.CC76_widening_assign(y_box);
   limited_H79_extrapolation_assign(y, cs, tp);
   Constraint_System x_box_cs = x_box.constraints();
@@ -373,23 +373,23 @@ PPL::Polyhedron::bounded_H79_extrapolation_assign(const Polyhedron& y,
 bool
 PPL::Polyhedron
 ::BHRZ03_combining_constraints(const Polyhedron& y,
-			       const BHRZ03_Certificate& y_cert,
-			       const Polyhedron& H79,
-			       const Constraint_System& x_minus_H79_cs) {
+                               const BHRZ03_Certificate& y_cert,
+                               const Polyhedron& H79,
+                               const Constraint_System& x_minus_H79_cs) {
   Polyhedron& x = *this;
   // It is assumed that `y <= x <= H79'.
   PPL_ASSERT(x.topology() == y.topology()
-	 && x.topology() == H79.topology()
-	 && x.topology() == x_minus_H79_cs.topology());
+         && x.topology() == H79.topology()
+         && x.topology() == x_minus_H79_cs.topology());
   PPL_ASSERT(x.space_dim == y.space_dim
-	 && x.space_dim == H79.space_dim
-	 && x.space_dim == x_minus_H79_cs.space_dimension());
+         && x.space_dim == H79.space_dim
+         && x.space_dim == x_minus_H79_cs.space_dimension());
   PPL_ASSERT(!x.marked_empty() && !x.has_something_pending()
-	 && x.constraints_are_minimized() && x.generators_are_minimized());
+         && x.constraints_are_minimized() && x.generators_are_minimized());
   PPL_ASSERT(!y.marked_empty() && !y.has_something_pending()
-	 && y.constraints_are_minimized() && y.generators_are_minimized());
+         && y.constraints_are_minimized() && y.generators_are_minimized());
   PPL_ASSERT(!H79.marked_empty() && !H79.has_something_pending()
-	 && H79.constraints_are_minimized() && H79.generators_are_minimized());
+         && H79.constraints_are_minimized() && H79.generators_are_minimized());
 
   // We will choose from `x_minus_H79_cs' many subsets of constraints,
   // that will be collected (one at a time) in `combining_cs'.
@@ -418,45 +418,45 @@ PPL::Polyhedron
       bool lies_on_the_boundary_of_H79 = false;
       const Constraint_System& H79_cs = H79.con_sys;
       for (dimension_type j = H79_cs.num_rows(); j-- > 0; ) {
-	const Constraint& c = H79_cs[j];
-	if (c.is_inequality() && Scalar_Products::sign(c, g) == 0) {
-	  lies_on_the_boundary_of_H79 = true;
-	  break;
-	}
+        const Constraint& c = H79_cs[j];
+        if (c.is_inequality() && Scalar_Products::sign(c, g) == 0) {
+          lies_on_the_boundary_of_H79 = true;
+          break;
+        }
       }
       if (lies_on_the_boundary_of_H79)
-	continue;
+        continue;
 
       // Consider all the constraints in `x_minus_H79_cs'
       // that are saturated by the point `g'.
       combining_cs.clear();
       for (dimension_type j = x_minus_H79_cs_num_rows; j-- > 0; ) {
-	const Constraint& c = x_minus_H79_cs[j];
-	if (Scalar_Products::sign(c, g) == 0)
-	  combining_cs.insert(c);
+        const Constraint& c = x_minus_H79_cs[j];
+        if (Scalar_Products::sign(c, g) == 0)
+          combining_cs.insert(c);
       }
       // Build a new constraint by combining all the chosen constraints.
       const dimension_type combining_cs_num_rows = combining_cs.num_rows();
       if (combining_cs_num_rows > 0) {
-	if (combining_cs_num_rows == 1)
-	  // No combination is needed.
-	  new_cs.insert(combining_cs[0]);
-	else {
-	  Linear_Expression e(0);
-	  bool strict_inequality = false;
-	  for (dimension_type h = combining_cs_num_rows; h-- > 0; ) {
-	    if (combining_cs[h].is_strict_inequality())
-	      strict_inequality = true;
-	    e += Linear_Expression(combining_cs[h]);
-	  }
-
-	  if (!e.all_homogeneous_terms_are_zero()) {
-	    if (strict_inequality)
-	      new_cs.insert(e > 0);
-	    else
-	      new_cs.insert(e >= 0);
-	  }
-	}
+        if (combining_cs_num_rows == 1)
+          // No combination is needed.
+          new_cs.insert(combining_cs[0]);
+        else {
+          Linear_Expression e(0);
+          bool strict_inequality = false;
+          for (dimension_type h = combining_cs_num_rows; h-- > 0; ) {
+            if (combining_cs[h].is_strict_inequality())
+              strict_inequality = true;
+            e += Linear_Expression(combining_cs[h].expression());
+          }
+
+          if (!e.all_homogeneous_terms_are_zero()) {
+            if (strict_inequality)
+              new_cs.insert(e > 0);
+            else
+              new_cs.insert(e >= 0);
+          }
+        }
       }
     }
   }
@@ -495,20 +495,20 @@ PPL::Polyhedron
 
 bool
 PPL::Polyhedron::BHRZ03_evolving_points(const Polyhedron& y,
-					const BHRZ03_Certificate& y_cert,
-					const Polyhedron& H79) {
+                                        const BHRZ03_Certificate& y_cert,
+                                        const Polyhedron& H79) {
   Polyhedron& x = *this;
   // It is assumed that `y <= x <= H79'.
   PPL_ASSERT(x.topology() == y.topology()
-	 && x.topology() == H79.topology());
+         && x.topology() == H79.topology());
   PPL_ASSERT(x.space_dim == y.space_dim
-	 && x.space_dim == H79.space_dim);
+         && x.space_dim == H79.space_dim);
   PPL_ASSERT(!x.marked_empty() && !x.has_something_pending()
-	 && x.constraints_are_minimized() && x.generators_are_minimized());
+         && x.constraints_are_minimized() && x.generators_are_minimized());
   PPL_ASSERT(!y.marked_empty() && !y.has_something_pending()
-	 && y.constraints_are_minimized() && y.generators_are_minimized());
+         && y.constraints_are_minimized() && y.generators_are_minimized());
   PPL_ASSERT(!H79.marked_empty() && !H79.has_something_pending()
-	 && H79.constraints_are_minimized() && H79.generators_are_minimized());
+         && H79.constraints_are_minimized() && H79.generators_are_minimized());
 
   // For each point in `x.gen_sys' that is not in `y',
   // this technique tries to identify a set of rays that:
@@ -526,19 +526,19 @@ PPL::Polyhedron::BHRZ03_evolving_points(const Polyhedron& y,
     // In the case of NNC polyhedra, we can restrict attention to
     // closure points (considering also points will only add redundancy).
     if (((g1.is_point() && closed) || (g1.is_closure_point() && !closed))
-	&& y.relation_with(g1) == Poly_Gen_Relation::nothing()) {
+        && y.relation_with(g1) == Poly_Gen_Relation::nothing()) {
       // For each point (resp., closure point) `g2' in `y.gen_sys',
       // where `g1' and `g2' are different,
       // build the candidate ray `g1 - g2'.
       for (dimension_type j = y_gen_sys_num_rows; j-- > 0; ) {
-	const Generator& g2 = y.gen_sys[j];
-	if ((g2.is_point() && closed)
-	    || (g2.is_closure_point() && !closed)) {
-	  PPL_ASSERT(compare(g1, g2) != 0);
-	  Generator ray_from_g2_to_g1 = g1;
-	  ray_from_g2_to_g1.linear_combine(g2, 0);
-	  candidate_rays.insert(ray_from_g2_to_g1);
-	}
+        const Generator& g2 = y.gen_sys[j];
+        if ((g2.is_point() && closed)
+            || (g2.is_closure_point() && !closed)) {
+          PPL_ASSERT(compare(g1, g2) != 0);
+          Generator ray_from_g2_to_g1 = g1;
+          ray_from_g2_to_g1.linear_combine(g2, 0);
+          candidate_rays.insert(ray_from_g2_to_g1);
+        }
       }
     }
   }
@@ -634,20 +634,20 @@ PPL::Polyhedron::modify_according_to_evolution(Linear_Expression& ray,
 
 bool
 PPL::Polyhedron::BHRZ03_evolving_rays(const Polyhedron& y,
-				      const BHRZ03_Certificate& y_cert,
-				      const Polyhedron& H79) {
+                                      const BHRZ03_Certificate& y_cert,
+                                      const Polyhedron& H79) {
   Polyhedron& x = *this;
   // It is assumed that `y <= x <= H79'.
   PPL_ASSERT(x.topology() == y.topology()
-	 && x.topology() == H79.topology());
+         && x.topology() == H79.topology());
   PPL_ASSERT(x.space_dim == y.space_dim
-	 && x.space_dim == H79.space_dim);
+         && x.space_dim == H79.space_dim);
   PPL_ASSERT(!x.marked_empty() && !x.has_something_pending()
-	 && x.constraints_are_minimized() && x.generators_are_minimized());
+         && x.constraints_are_minimized() && x.generators_are_minimized());
   PPL_ASSERT(!y.marked_empty() && !y.has_something_pending()
-	 && y.constraints_are_minimized() && y.generators_are_minimized());
+         && y.constraints_are_minimized() && y.generators_are_minimized());
   PPL_ASSERT(!H79.marked_empty() && !H79.has_something_pending()
-	 && H79.constraints_are_minimized() && H79.generators_are_minimized());
+         && H79.constraints_are_minimized() && H79.generators_are_minimized());
 
   const dimension_type x_gen_sys_num_rows = x.gen_sys.num_rows();
   const dimension_type y_gen_sys_num_rows = y.gen_sys.num_rows();
@@ -659,15 +659,15 @@ PPL::Polyhedron::BHRZ03_evolving_rays(const Polyhedron& y,
     // We choose a ray of `x' that does not belong to `y'.
     if (x_g.is_ray() && y.relation_with(x_g) == Poly_Gen_Relation::nothing()) {
       for (dimension_type j = y_gen_sys_num_rows; j-- > 0; ) {
-	const Generator& y_g = y.gen_sys[j];
-	if (y_g.is_ray()) {
-	  Generator new_ray(x_g);
+        const Generator& y_g = y.gen_sys[j];
+        if (y_g.is_ray()) {
+          Generator new_ray(x_g);
           // Modify `new_ray' according to the evolution of `x_g' with
           // respect to `y_g'.
           modify_according_to_evolution(new_ray.expr, x_g.expr, y_g.expr);
           PPL_ASSERT(new_ray.OK());
-	  candidate_rays.insert(new_ray);
-	}
+          candidate_rays.insert(new_ray);
+        }
       }
     }
   }
@@ -721,7 +721,7 @@ PPL::Polyhedron::BHRZ03_widening_assign(const Polyhedron& y, unsigned* tp) {
   x.minimize();
 
   // Compute certificate info for polyhedron `y'.
-  BHRZ03_Certificate y_cert(y);
+  const BHRZ03_Certificate y_cert(y);
 
   // If the iteration is stabilizing, the resulting polyhedron is `x'.
   // At this point, also check if the two polyhedra are the same
@@ -786,8 +786,8 @@ PPL::Polyhedron::BHRZ03_widening_assign(const Polyhedron& y, unsigned* tp) {
 void
 PPL::Polyhedron
 ::limited_BHRZ03_extrapolation_assign(const Polyhedron& y,
-				      const Constraint_System& cs,
-				      unsigned* tp) {
+                                      const Constraint_System& cs,
+                                      unsigned* tp) {
   Polyhedron& x = *this;
   const dimension_type cs_num_rows = cs.num_rows();
   // If `cs' is empty, we fall back to ordinary, non-limited widening.
@@ -800,24 +800,24 @@ PPL::Polyhedron
   if (x.is_necessarily_closed()) {
     if (!y.is_necessarily_closed())
       throw_topology_incompatible("limited_BHRZ03_extrapolation_assign(y, cs)",
-				  "y", y);
+                                  "y", y);
     if (cs.has_strict_inequalities())
       throw_topology_incompatible("limited_BHRZ03_extrapolation_assign(y, cs)",
-				  "cs", cs);
+                                  "cs", cs);
   }
   else if (y.is_necessarily_closed())
     throw_topology_incompatible("limited_BHRZ03_extrapolation_assign(y, cs)",
-				"y", y);
+                                "y", y);
 
   // Dimension-compatibility check.
   if (x.space_dim != y.space_dim)
     throw_dimension_incompatible("limited_BHRZ03_extrapolation_assign(y, cs)",
-				 "y", y);
+                                 "y", y);
   // `cs' must be dimension-compatible with the two polyhedra.
   const dimension_type cs_space_dim = cs.space_dimension();
   if (x.space_dim < cs_space_dim)
     throw_dimension_incompatible("limited_BHRZ03_extrapolation_assign(y, cs)",
-				 "cs", cs);
+                                 "cs", cs);
 
   // Assume `y' is contained in or equal to `x'.
   PPL_EXPECT_HEAVY(copy_contains(x, y));
@@ -864,10 +864,10 @@ PPL::Polyhedron
 void
 PPL::Polyhedron
 ::bounded_BHRZ03_extrapolation_assign(const Polyhedron& y,
-				      const Constraint_System& cs,
-				      unsigned* tp) {
+                                      const Constraint_System& cs,
+                                      unsigned* tp) {
   Rational_Box x_box(*this, ANY_COMPLEXITY);
-  Rational_Box y_box(y, ANY_COMPLEXITY);
+  const Rational_Box y_box(y, ANY_COMPLEXITY);
   x_box.CC76_widening_assign(y_box);
   limited_BHRZ03_extrapolation_assign(y, cs, tp);
   Constraint_System x_box_cs = x_box.constraints();
diff --git a/src/Powerset.defs.hh b/src/Powerset.defs.hh
deleted file mode 100644
index 60c6e77..0000000
--- a/src/Powerset.defs.hh
+++ /dev/null
@@ -1,450 +0,0 @@
-/* Powerset class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Powerset_defs_hh
-#define PPL_Powerset_defs_hh
-
-#include "Powerset.types.hh"
-#include "globals.types.hh"
-#include "iterator_to_const.defs.hh"
-#include <iosfwd>
-#include <iterator>
-#include <list>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Powerset */
-template <typename D>
-void swap(Powerset<D>& x, Powerset<D>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equivalent.
-/*! \relates Powerset */
-template <typename D>
-bool
-operator==(const Powerset<D>& x, const Powerset<D>& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are not equivalent.
-/*! \relates Powerset */
-template <typename D>
-bool
-operator!=(const Powerset<D>& x, const Powerset<D>& y);
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Powerset */
-template <typename D>
-std::ostream&
-operator<<(std::ostream& s, const Powerset<D>& x);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-
-//! The powerset construction on a base-level domain.
-/*! \ingroup PPL_CXX_interface
-  This class offers a generic implementation of a
-  <EM>powerset</EM> domain as defined in Section \ref powerset.
-
-  Besides invoking the available methods on the disjuncts of a Powerset,
-  this class also provides bidirectional iterators that allow for a
-  direct inspection of these disjuncts. For a consistent handling of
-  Omega-reduction, all the iterators are <EM>read-only</EM>, meaning
-  that the disjuncts cannot be overwritten. Rather, by using the class
-  <CODE>iterator</CODE>, it is possible to drop one or more disjuncts
-  (possibly so as to later add back modified versions).  As an example
-  of iterator usage, the following template function drops from
-  powerset \p ps all the disjuncts that would have become redundant by
-  the addition of an external element \p d.
-
-  \code
-template <typename D>
-void
-drop_subsumed(Powerset<D>& ps, const D& d) {
-  for (typename Powerset<D>::iterator i = ps.begin(),
-         ps_end = ps.end(), i != ps_end; )
-    if (i->definitely_entails(d))
-      i = ps.drop_disjunct(i);
-    else
-      ++i;
-}
-  \endcode
-
-  The template class D must provide the following methods.
-  \code
-    memory_size_type total_memory_in_bytes() const
-  \endcode
-  Returns a lower bound on the total size in bytes of the memory
-  occupied by the instance of D.
-  \code
-    bool is_top() const
-  \endcode
-  Returns <CODE>true</CODE> if and only if the instance of D is the top
-  element of the domain.
-  \code
-    bool is_bottom() const
-  \endcode
-  Returns <CODE>true</CODE> if and only if the instance of D is the
-  bottom element of the domain.
-  \code
-    bool definitely_entails(const D& y) const
-  \endcode
-  Returns <CODE>true</CODE> if the instance of D definitely entails
-  <CODE>y</CODE>.  Returns <CODE>false</CODE> if the instance may not
-  entail <CODE>y</CODE> (i.e., if the instance does not entail
-  <CODE>y</CODE> or if entailment could not be decided).
-  \code
-    void upper_bound_assign(const D& y)
-  \endcode
-  Assigns to the instance of D an upper bound of the instance and
-  <CODE>y</CODE>.
-  \code
-    void meet_assign(const D& y)
-  \endcode
-  Assigns to the instance of D the meet of the instance and
-  <CODE>y</CODE>.
-  \code
-    bool OK() const
-  \endcode
-  Returns <CODE>true</CODE> if the instance of D is in a consistent
-  state, else returns <CODE>false</CODE>.
-
-  The following operators on the template class D must be defined.
-  \code
-    operator<<(std::ostream& s, const D& x)
-  \endcode
-  Writes a textual representation of the instance of D on
-  <CODE>s</CODE>.
-  \code
-    operator==(const D& x, const D& y)
-  \endcode
-  Returns <CODE>true</CODE> if and only if <CODE>x</CODE> and
-  <CODE>y</CODE> are equivalent D's.
-  \code
-    operator!=(const D& x, const D& y)
-  \endcode
-  Returns <CODE>true</CODE> if and only if <CODE>x</CODE> and
-  <CODE>y</CODE> are different D's.
-*/
-template <typename D>
-class Parma_Polyhedra_Library::Powerset {
-public:
-  //! \name Constructors and Destructor
-  //@{
-
-  /*! \brief
-    Default constructor: builds the bottom of the powerset constraint
-    system (i.e., the empty powerset).
-  */
-  Powerset();
-
-  //! Copy constructor.
-  Powerset(const Powerset& y);
-
-  /*! \brief
-    If \p d is not bottom, builds a powerset containing only \p d.
-    Builds the empty powerset otherwise.
-  */
-  explicit Powerset(const D& d);
-
-  //! Destructor.
-  ~Powerset();
-
-  //@} // Constructors and Destructor
-
-  //! \name Member Functions that Do Not Modify the Powerset Object
-  //@{
-
-  /*! \brief
-    Returns <CODE>true</CODE> if \p *this definitely entails \p y.
-    Returns <CODE>false</CODE> if \p *this may not entail \p y
-    (i.e., if \p *this does not entail \p y or if entailment could
-    not be decided).
-  */
-  bool definitely_entails(const Powerset& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is the top
-    element of the powerset constraint system (i.e., it represents
-    the universe).
-  */
-  bool is_top() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this is the bottom
-    element of the powerset constraint system (i.e., it represents
-    the empty set).
-  */
-  bool is_bottom() const;
-
-  /*! \brief
-    Returns a lower bound to the total size in bytes of the memory
-    occupied by \p *this.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  /*! \brief
-    Returns a lower bound to the size in bytes of the memory
-    managed by \p *this.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  // FIXME: document and perhaps use an enum instead of a bool.
-  bool OK(bool disallow_bottom = false) const;
-
-  //@} // Member Functions that Do Not Modify the Powerset Object
-
-protected:
-  //! A powerset is implemented as a sequence of elements.
-  /*!
-    The particular sequence employed must support efficient deletion
-    in any position and efficient back insertion.
-  */
-  typedef std::list<D> Sequence;
-
-  //! Alias for the low-level iterator on the disjuncts.
-  typedef typename Sequence::iterator Sequence_iterator;
-
-  //! Alias for the low-level %const_iterator on the disjuncts.
-  typedef typename Sequence::const_iterator Sequence_const_iterator;
-
-  //! The sequence container holding powerset's elements.
-  Sequence sequence;
-
-  //! If <CODE>true</CODE>, \p *this is Omega-reduced.
-  mutable bool reduced;
-
-public:
-  // Sequence manipulation types, accessors and modifiers
-  typedef typename Sequence::size_type size_type;
-  typedef typename Sequence::value_type value_type;
-
-  /*! \brief
-    Alias for a <EM>read-only</EM> bidirectional %iterator on the
-    disjuncts of a Powerset element.
-
-    By using this iterator type, the disjuncts cannot be overwritten,
-    but they can be removed using methods
-    <CODE>drop_disjunct(iterator position)</CODE> and
-    <CODE>drop_disjuncts(iterator first, iterator last)</CODE>,
-    while still ensuring a correct handling of Omega-reduction.
-  */
-  typedef iterator_to_const<Sequence> iterator;
-
-  //! A bidirectional %const_iterator on the disjuncts of a Powerset element.
-  typedef const_iterator_to_const<Sequence> const_iterator;
-
-  //! The reverse iterator type built from Powerset::iterator.
-  typedef std::reverse_iterator<iterator> reverse_iterator;
-
-  //! The reverse iterator type built from Powerset::const_iterator.
-  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-
-  //! \name Member Functions for the Direct Manipulation of Disjuncts
-  //@{
-
-  /*! \brief
-    Drops from the sequence of disjuncts in \p *this all the
-    non-maximal elements so that \p *this is non-redundant.
-
-    This method is declared <CODE>const</CODE> because, even though
-    Omega-reduction may change the syntactic representation of \p *this,
-    its semantics will be unchanged.
-  */
-  void omega_reduce() const;
-
-  //! Returns the number of disjuncts.
-  size_type size() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if there are no disjuncts in
-    \p *this.
-  */
-  bool empty() const;
-
-  /*! \brief
-    Returns an iterator pointing to the first disjunct, if \p *this
-    is not empty; otherwise, returns the past-the-end iterator.
-  */
-  iterator begin();
-
-  //! Returns the past-the-end iterator.
-  iterator end();
-
-  /*! \brief
-    Returns a const_iterator pointing to the first disjunct, if \p *this
-    is not empty; otherwise, returns the past-the-end const_iterator.
-  */
-  const_iterator begin() const;
-
-  //! Returns the past-the-end const_iterator.
-  const_iterator end() const;
-
-  /*! \brief
-    Returns a reverse_iterator pointing to the last disjunct, if \p *this
-    is not empty; otherwise, returns the before-the-start reverse_iterator.
-  */
-  reverse_iterator rbegin();
-
-  //! Returns the before-the-start reverse_iterator.
-  reverse_iterator rend();
-
-  /*! \brief
-    Returns a const_reverse_iterator pointing to the last disjunct,
-    if \p *this is not empty; otherwise, returns the before-the-start
-    const_reverse_iterator.
-  */
-  const_reverse_iterator rbegin() const;
-
-  //! Returns the before-the-start const_reverse_iterator.
-  const_reverse_iterator rend() const;
-
-  //! Adds to \p *this the disjunct \p d.
-  void add_disjunct(const D& d);
-
-  /*! \brief
-    Drops the disjunct in \p *this pointed to by \p position, returning
-    an iterator to the disjunct following \p position.
-  */
-  iterator drop_disjunct(iterator position);
-
-  //! Drops all the disjuncts from \p first to \p last (excluded).
-  void drop_disjuncts(iterator first, iterator last);
-
-  //! Drops all the disjuncts, making \p *this an empty powerset.
-  void clear();
-
-  //@} // Member Functions for the Direct Manipulation of Disjuncts
-
-  //! \name Member Functions that May Modify the Powerset Object
-  //@{
-
-  //! The assignment operator.
-  Powerset& operator=(const Powerset& y);
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Powerset& y);
-
-  //! Assigns to \p *this the least upper bound of \p *this and \p y.
-  void least_upper_bound_assign(const Powerset& y);
-
-  //! Assigns to \p *this an upper bound of \p *this and \p y.
-  /*!
-    The result will be the least upper bound of \p *this and \p y.
-  */
-  void upper_bound_assign(const Powerset& y);
-
-  /*! \brief
-    Assigns to \p *this the least upper bound of \p *this and \p y
-    and returns \c true.
-
-    \exception std::invalid_argument
-    Thrown if \p *this and \p y are dimension-incompatible.
-  */
-  bool upper_bound_assign_if_exact(const Powerset& y);
-
-  //! Assigns to \p *this the meet of \p *this and \p y.
-  void meet_assign(const Powerset& y);
-
-  /*! \brief
-    If \p *this is not empty (i.e., it is not the bottom element),
-    it is reduced to a singleton obtained by computing an upper-bound
-    of all the disjuncts.
-  */
-  void collapse();
-
-  //@} // Member Functions that May Modify the Powerset element
-
-protected:
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if \p *this does not contain
-    non-maximal elements.
-  */
-  bool is_omega_reduced() const;
-
-  /*! \brief Upon return, \p *this will contain at most \p
-    max_disjuncts elements; the set of disjuncts in positions greater
-    than or equal to \p max_disjuncts, will be replaced at that
-    position by their upper-bound.
-  */
-  void collapse(unsigned max_disjuncts);
-
-  /*! \brief
-    Adds to \p *this the disjunct \p d,
-    assuming \p d is not the bottom element and ensuring
-    partial Omega-reduction.
-
-    If \p d is not the bottom element and is not Omega-redundant with
-    respect to elements in positions between \p first and \p last, all
-    elements in these positions that would be made Omega-redundant by the
-    addition of \p d are dropped and \p d is added to the reduced
-    sequence.
-    If \p *this is reduced before an invocation of this method,
-    it will be reduced upon successful return from the method.
-  */
-  iterator add_non_bottom_disjunct_preserve_reduction(const D& d,
-						      iterator first,
-						      iterator last);
-
-  /*! \brief
-    Adds to \p *this the disjunct \p d, assuming \p d is not the
-    bottom element and preserving Omega-reduction.
-
-    If \p *this is reduced before an invocation of this method,
-    it will be reduced upon successful return from the method.
-  */
-  void add_non_bottom_disjunct_preserve_reduction(const D& d);
-
-  /*! \brief
-    Assigns to \p *this the result of applying \p op_assign pairwise
-    to the elements in \p *this and \p y.
-
-    The elements of the powerset result are obtained by applying
-    \p op_assign to each pair of elements whose components are drawn
-    from \p *this and \p y, respectively.
-  */
-  template <typename Binary_Operator_Assign>
-  void pairwise_apply_assign(const Powerset& y,
-			     Binary_Operator_Assign op_assign);
-
-private:
-  /*! \brief
-    Does the hard work of checking whether \p *this contains non-maximal
-    elements and returns <CODE>true</CODE> if and only if it does not.
-  */
-  bool check_omega_reduced() const;
-
-  /*! \brief
-    Replaces the disjunct \p *sink by an upper bound of itself and
-    all the disjuncts following it.
-  */
-  void collapse(Sequence_iterator sink);
-};
-
-#include "Powerset.inlines.hh"
-#include "Powerset.templates.hh"
-
-#endif // !defined(PPL_Powerset_defs_hh)
diff --git a/src/Powerset.inlines.hh b/src/Powerset.inlines.hh
deleted file mode 100644
index 9811a31..0000000
--- a/src/Powerset.inlines.hh
+++ /dev/null
@@ -1,231 +0,0 @@
-/* Powerset class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Powerset_inlines_hh
-#define PPL_Powerset_inlines_hh 1
-
-#include <algorithm>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D>
-inline typename Powerset<D>::iterator
-Powerset<D>::begin() {
-  return sequence.begin();
-}
-
-template <typename D>
-inline typename Powerset<D>::iterator
-Powerset<D>::end() {
-  return sequence.end();
-}
-
-template <typename D>
-inline typename Powerset<D>::const_iterator
-Powerset<D>::begin() const {
-  return sequence.begin();
-}
-
-template <typename D>
-inline typename Powerset<D>::const_iterator
-Powerset<D>::end() const {
-  return sequence.end();
-}
-
-template <typename D>
-inline typename Powerset<D>::reverse_iterator
-Powerset<D>::rbegin() {
-  return reverse_iterator(end());
-}
-
-template <typename D>
-inline typename Powerset<D>::reverse_iterator
-Powerset<D>::rend() {
-  return reverse_iterator(begin());
-}
-
-template <typename D>
-inline typename Powerset<D>::const_reverse_iterator
-Powerset<D>::rbegin() const {
-  return const_reverse_iterator(end());
-}
-
-template <typename D>
-inline typename Powerset<D>::const_reverse_iterator
-Powerset<D>::rend() const {
-  return const_reverse_iterator(begin());
-}
-
-template <typename D>
-inline typename Powerset<D>::size_type
-Powerset<D>::size() const {
-  return sequence.size();
-}
-
-template <typename D>
-inline bool
-Powerset<D>::empty() const {
-  return sequence.empty();
-}
-
-template <typename D>
-inline typename Powerset<D>::iterator
-Powerset<D>::drop_disjunct(iterator position) {
-  return sequence.erase(position.base);
-}
-
-template <typename D>
-inline void
-Powerset<D>::drop_disjuncts(iterator first, iterator last) {
-  sequence.erase(first.base, last.base);
-}
-
-template <typename D>
-inline void
-Powerset<D>::clear() {
-  sequence.clear();
-}
-
-template <typename D>
-inline
-Powerset<D>::Powerset(const Powerset& y)
-  : sequence(y.sequence), reduced(y.reduced) {
-}
-
-template <typename D>
-inline Powerset<D>&
-Powerset<D>::operator=(const Powerset& y) {
-  sequence = y.sequence;
-  reduced = y.reduced;
-  return *this;
-}
-
-template <typename D>
-inline void
-Powerset<D>::m_swap(Powerset& y) {
-  using std::swap;
-  swap(sequence, y.sequence);
-  swap(reduced, y.reduced);
-}
-
-template <typename D>
-inline
-Powerset<D>::Powerset()
-  : sequence(), reduced(true) {
-}
-
-template <typename D>
-inline
-Powerset<D>::Powerset(const D& d)
-  : sequence(), reduced(false) {
-  sequence.push_back(d);
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename D>
-inline
-Powerset<D>::~Powerset() {
-}
-
-template <typename D>
-inline void
-Powerset<D>::add_non_bottom_disjunct_preserve_reduction(const D& d) {
-  // !d.is_bottom() is asserted by the callee.
-  add_non_bottom_disjunct_preserve_reduction(d, begin(), end());
-}
-
-template <typename D>
-inline void
-Powerset<D>::add_disjunct(const D& d) {
-  sequence.push_back(d);
-  reduced = false;
-}
-
-/*! \relates Powerset */
-template <typename D>
-inline
-bool operator!=(const Powerset<D>& x, const Powerset<D>& y) {
-  return !(x == y);
-}
-
-template <typename D>
-inline bool
-Powerset<D>::is_top() const {
-  // Must perform omega-reduction for correctness.
-  omega_reduce();
-  const_iterator xi = begin();
-  const_iterator x_end = end();
-  return xi != x_end && xi->is_top() && ++xi == x_end;
-}
-
-template <typename D>
-inline bool
-Powerset<D>::is_bottom() const {
-  // Must perform omega-reduction for correctness.
-  omega_reduce();
-  return empty();
-}
-
-template <typename D>
-inline void
-Powerset<D>::collapse() {
-  if (!empty())
-    collapse(sequence.begin());
-}
-
-template <typename D>
-inline void
-Powerset<D>::meet_assign(const Powerset& y) {
-  pairwise_apply_assign(y, std::mem_fun_ref(&D::meet_assign));
-}
-
-template <typename D>
-inline void
-Powerset<D>::upper_bound_assign(const Powerset& y) {
-  least_upper_bound_assign(y);
-}
-
-template <typename D>
-inline bool
-Powerset<D>::upper_bound_assign_if_exact(const Powerset& y) {
-  least_upper_bound_assign(y);
-  return true;
-}
-
-template <typename D>
-inline memory_size_type
-Powerset<D>::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-/*! \relates Powerset */
-template <typename D>
-inline void
-swap(Powerset<D>& x, Powerset<D>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Powerset_inlines_hh)
diff --git a/src/Powerset.templates.hh b/src/Powerset.templates.hh
deleted file mode 100644
index 80e6864..0000000
--- a/src/Powerset.templates.hh
+++ /dev/null
@@ -1,312 +0,0 @@
-/* Powerset class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Powerset_templates_hh
-#define PPL_Powerset_templates_hh 1
-
-#include "globals.defs.hh"
-#include <algorithm>
-#include "assert.hh"
-#include <iostream>
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D>
-void
-Powerset<D>::collapse(const Sequence_iterator sink) {
-  PPL_ASSERT(sink != sequence.end());
-  D& d = *sink;
-  iterator x_sink = sink;
-  iterator next_x_sink = x_sink;
-  ++next_x_sink;
-  iterator x_end = end();
-  for (const_iterator xi = next_x_sink; xi != x_end; ++xi)
-    d.upper_bound_assign(*xi);
-  // Drop the surplus disjuncts.
-  drop_disjuncts(next_x_sink, x_end);
-
-  // Ensure omega-reduction.
-  for (iterator xi = begin(); xi != x_sink; )
-    if (xi->definitely_entails(d))
-      xi = drop_disjunct(xi);
-    else
-      ++xi;
-
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename D>
-void
-Powerset<D>::omega_reduce() const {
-  if (reduced)
-    return;
-
-  Powerset& x = const_cast<Powerset&>(*this);
-  // First remove all bottom elements.
-  for (iterator xi = x.begin(), x_end = x.end(); xi != x_end; )
-    if (xi->is_bottom())
-      xi = x.drop_disjunct(xi);
-    else
-      ++xi;
-  // Then remove non-maximal elements.
-  for (iterator xi = x.begin(); xi != x.end(); ) {
-    const D& xv = *xi;
-    bool dropping_xi = false;
-    for (iterator yi = x.begin(); yi != x.end(); )
-      if (xi == yi)
-	++yi;
-      else {
-	const D& yv = *yi;
-	if (yv.definitely_entails(xv))
-	  yi = x.drop_disjunct(yi);
-	else if (xv.definitely_entails(yv)) {
-	  dropping_xi = true;
-	  break;
-	}
-	else
-	  ++yi;
-      }
-    if (dropping_xi)
-      xi = x.drop_disjunct(xi);
-    else
-      ++xi;
-    if (abandon_expensive_computations != 0 && xi != x.end()) {
-      // Hurry up!
-      x.collapse(xi.base);
-      break;
-    }
-  }
-  reduced = true;
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename D>
-void
-Powerset<D>::collapse(const unsigned max_disjuncts) {
-  PPL_ASSERT(max_disjuncts > 0);
-  // Omega-reduce before counting the number of disjuncts.
-  omega_reduce();
-  size_type n = size();
-  if (n > max_disjuncts) {
-    // Let `i' point to the last disjunct that will survive.
-    iterator i = begin();
-    std::advance(i, max_disjuncts-1);
-    // This disjunct will be assigned an upper-bound of itself and of
-    // all the disjuncts that follow.
-    collapse(i.base);
-  }
-  PPL_ASSERT_HEAVY(OK());
-  PPL_ASSERT(is_omega_reduced());
-}
-
-template <typename D>
-bool
-Powerset<D>::check_omega_reduced() const {
-  for (const_iterator x_begin = begin(), x_end = end(),
-	 xi = x_begin; xi != x_end; ++xi) {
-    const D& xv = *xi;
-    if (xv.is_bottom())
-      return false;
-    for (const_iterator yi = x_begin; yi != x_end; ++yi) {
-      if (xi == yi)
-	continue;
-      const D& yv = *yi;
-      if (xv.definitely_entails(yv) || yv.definitely_entails(xv))
-	return false;
-    }
-  }
-  return true;
-}
-
-template <typename D>
-bool
-Powerset<D>::is_omega_reduced() const {
-  if (!reduced && check_omega_reduced())
-    reduced = true;
-  return reduced;
-}
-
-template <typename D>
-typename Powerset<D>::iterator
-Powerset<D>::add_non_bottom_disjunct_preserve_reduction(const D& d,
-							iterator first,
-							iterator last) {
-  PPL_ASSERT_HEAVY(!d.is_bottom());
-  for (iterator xi = first; xi != last; ) {
-    const D& xv = *xi;
-    if (d.definitely_entails(xv))
-      return first;
-    else if (xv.definitely_entails(d)) {
-      if (xi == first)
-	++first;
-      xi = drop_disjunct(xi);
-    }
-    else
-      ++xi;
-  }
-  sequence.push_back(d);
-  PPL_ASSERT_HEAVY(OK());
-  return first;
-}
-
-template <typename D>
-bool
-Powerset<D>::definitely_entails(const Powerset& y) const {
-  const Powerset<D>& x = *this;
-  bool found = true;
-  for (const_iterator xi = x.begin(),
-	 x_end = x.end(); found && xi != x_end; ++xi) {
-    found = false;
-    for (const_iterator yi = y.begin(),
-	   y_end = y.end(); !found && yi != y_end; ++yi)
-      found = (*xi).definitely_entails(*yi);
-  }
-  return found;
-}
-
-/*! \relates Powerset */
-template <typename D>
-bool
-operator==(const Powerset<D>& x, const Powerset<D>& y) {
-  x.omega_reduce();
-  y.omega_reduce();
-  if (x.size() != y.size())
-    return false;
-  // Take a copy of `y' and work with it.
-  Powerset<D> z = y;
-  for (typename Powerset<D>::const_iterator xi = x.begin(),
-	 x_end = x.end(); xi != x_end; ++xi) {
-    typename Powerset<D>::iterator zi = z.begin();
-    typename Powerset<D>::iterator z_end = z.end();
-    zi = std::find(zi, z_end, *xi);
-    if (zi == z_end)
-      return false;
-    else
-      z.drop_disjunct(zi);
-  }
-  return true;
-}
-
-template <typename D>
-template <typename Binary_Operator_Assign>
-void
-Powerset<D>::pairwise_apply_assign(const Powerset& y,
-				   Binary_Operator_Assign op_assign) {
-  // Ensure omega-reduction here, since what follows has quadratic complexity.
-  omega_reduce();
-  y.omega_reduce();
-  Sequence new_sequence;
-  for (const_iterator xi = begin(), x_end = end(),
-	 y_begin = y.begin(), y_end = y.end(); xi != x_end; ++xi)
-    for (const_iterator yi = y_begin; yi != y_end; ++yi) {
-      D zi = *xi;
-      op_assign(zi, *yi);
-      if (!zi.is_bottom())
-	new_sequence.push_back(zi);
-    }
-  // Put the new sequence in place.
-  using std::swap;
-  swap(sequence, new_sequence);
-  reduced = false;
-  PPL_ASSERT_HEAVY(OK());
-}
-
-template <typename D>
-void
-Powerset<D>::least_upper_bound_assign(const Powerset& y) {
-  // Ensure omega-reduction here, since what follows has quadratic complexity.
-  omega_reduce();
-  y.omega_reduce();
-  iterator old_begin = begin();
-  iterator old_end = end();
-  for (const_iterator i = y.begin(), y_end = y.end(); i != y_end; ++i)
-    old_begin = add_non_bottom_disjunct_preserve_reduction(*i,
-							   old_begin,
-							   old_end);
-  PPL_ASSERT_HEAVY(OK());
-}
-
-namespace IO_Operators {
-
-/*! \relates Parma_Polyhedra_Library::Powerset */
-template <typename D>
-std::ostream&
-operator<<(std::ostream& s, const Powerset<D>& x) {
-  if (x.is_bottom())
-    s << "false";
-  else if (x.is_top())
-    s << "true";
-  else
-    for (typename Powerset<D>::const_iterator i = x.begin(),
-	   x_end = x.end(); i != x_end; ) {
-      s << "{ " << *i << " }";
-      ++i;
-      if (i != x_end)
-	s << ", ";
-    }
-  return s;
-}
-
-} // namespace IO_Operators
-
-template <typename D>
-memory_size_type
-Powerset<D>::external_memory_in_bytes() const {
-  memory_size_type bytes = 0;
-  for (const_iterator xi = begin(), x_end = end(); xi != x_end; ++xi) {
-    bytes += xi->total_memory_in_bytes();
-    // We assume there is at least a forward and a backward link, and
-    // that the pointers implementing them are at least the size of
-    // pointers to `D'.
-    bytes += 2*sizeof(D*);
-  }
-  return bytes;
-}
-
-template <typename D>
-bool
-Powerset<D>::OK(const bool disallow_bottom) const {
-  for (const_iterator xi = begin(), x_end = end(); xi != x_end; ++xi) {
-    if (!xi->OK())
-      return false;
-    if (disallow_bottom && xi->is_bottom()) {
-#ifndef NDEBUG
-      std::cerr << "Bottom element in powerset!"
-		<< std::endl;
-#endif
-      return false;
-    }
-  }
-  if (reduced && !check_omega_reduced()) {
-#ifndef NDEBUG
-    std::cerr << "Powerset claims to be reduced, but it is not!"
-	      << std::endl;
-#endif
-    return false;
-  }
-  return true;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Powerset_templates_hh)
diff --git a/src/Powerset.types.hh b/src/Powerset.types.hh
deleted file mode 100644
index 1707752..0000000
--- a/src/Powerset.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Powerset_types_hh
-#define PPL_Powerset_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename D>
-class Powerset;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Powerset_types_hh)
diff --git a/src/Powerset_defs.hh b/src/Powerset_defs.hh
new file mode 100644
index 0000000..1fae637
--- /dev/null
+++ b/src/Powerset_defs.hh
@@ -0,0 +1,450 @@
+/* Powerset class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Powerset_defs_hh
+#define PPL_Powerset_defs_hh
+
+#include "Powerset_types.hh"
+#include "globals_types.hh"
+#include "iterator_to_const_defs.hh"
+#include <iosfwd>
+#include <iterator>
+#include <list>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Powerset */
+template <typename D>
+void swap(Powerset<D>& x, Powerset<D>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equivalent.
+/*! \relates Powerset */
+template <typename D>
+bool
+operator==(const Powerset<D>& x, const Powerset<D>& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are not equivalent.
+/*! \relates Powerset */
+template <typename D>
+bool
+operator!=(const Powerset<D>& x, const Powerset<D>& y);
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Powerset */
+template <typename D>
+std::ostream&
+operator<<(std::ostream& s, const Powerset<D>& x);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+
+//! The powerset construction on a base-level domain.
+/*! \ingroup PPL_CXX_interface
+  This class offers a generic implementation of a
+  <EM>powerset</EM> domain as defined in Section \ref powerset.
+
+  Besides invoking the available methods on the disjuncts of a Powerset,
+  this class also provides bidirectional iterators that allow for a
+  direct inspection of these disjuncts. For a consistent handling of
+  Omega-reduction, all the iterators are <EM>read-only</EM>, meaning
+  that the disjuncts cannot be overwritten. Rather, by using the class
+  <CODE>iterator</CODE>, it is possible to drop one or more disjuncts
+  (possibly so as to later add back modified versions).  As an example
+  of iterator usage, the following template function drops from
+  powerset \p ps all the disjuncts that would have become redundant by
+  the addition of an external element \p d.
+
+  \code
+template <typename D>
+void
+drop_subsumed(Powerset<D>& ps, const D& d) {
+  for (typename Powerset<D>::iterator i = ps.begin(),
+         ps_end = ps.end(), i != ps_end; )
+    if (i->definitely_entails(d))
+      i = ps.drop_disjunct(i);
+    else
+      ++i;
+}
+  \endcode
+
+  The template class D must provide the following methods.
+  \code
+    memory_size_type total_memory_in_bytes() const
+  \endcode
+  Returns a lower bound on the total size in bytes of the memory
+  occupied by the instance of D.
+  \code
+    bool is_top() const
+  \endcode
+  Returns <CODE>true</CODE> if and only if the instance of D is the top
+  element of the domain.
+  \code
+    bool is_bottom() const
+  \endcode
+  Returns <CODE>true</CODE> if and only if the instance of D is the
+  bottom element of the domain.
+  \code
+    bool definitely_entails(const D& y) const
+  \endcode
+  Returns <CODE>true</CODE> if the instance of D definitely entails
+  <CODE>y</CODE>.  Returns <CODE>false</CODE> if the instance may not
+  entail <CODE>y</CODE> (i.e., if the instance does not entail
+  <CODE>y</CODE> or if entailment could not be decided).
+  \code
+    void upper_bound_assign(const D& y)
+  \endcode
+  Assigns to the instance of D an upper bound of the instance and
+  <CODE>y</CODE>.
+  \code
+    void meet_assign(const D& y)
+  \endcode
+  Assigns to the instance of D the meet of the instance and
+  <CODE>y</CODE>.
+  \code
+    bool OK() const
+  \endcode
+  Returns <CODE>true</CODE> if the instance of D is in a consistent
+  state, else returns <CODE>false</CODE>.
+
+  The following operators on the template class D must be defined.
+  \code
+    operator<<(std::ostream& s, const D& x)
+  \endcode
+  Writes a textual representation of the instance of D on
+  <CODE>s</CODE>.
+  \code
+    operator==(const D& x, const D& y)
+  \endcode
+  Returns <CODE>true</CODE> if and only if <CODE>x</CODE> and
+  <CODE>y</CODE> are equivalent D's.
+  \code
+    operator!=(const D& x, const D& y)
+  \endcode
+  Returns <CODE>true</CODE> if and only if <CODE>x</CODE> and
+  <CODE>y</CODE> are different D's.
+*/
+template <typename D>
+class Parma_Polyhedra_Library::Powerset {
+public:
+  //! \name Constructors and Destructor
+  //@{
+
+  /*! \brief
+    Default constructor: builds the bottom of the powerset constraint
+    system (i.e., the empty powerset).
+  */
+  Powerset();
+
+  //! Copy constructor.
+  Powerset(const Powerset& y);
+
+  /*! \brief
+    If \p d is not bottom, builds a powerset containing only \p d.
+    Builds the empty powerset otherwise.
+  */
+  explicit Powerset(const D& d);
+
+  //! Destructor.
+  ~Powerset();
+
+  //@} // Constructors and Destructor
+
+  //! \name Member Functions that Do Not Modify the Powerset Object
+  //@{
+
+  /*! \brief
+    Returns <CODE>true</CODE> if \p *this definitely entails \p y.
+    Returns <CODE>false</CODE> if \p *this may not entail \p y
+    (i.e., if \p *this does not entail \p y or if entailment could
+    not be decided).
+  */
+  bool definitely_entails(const Powerset& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is the top
+    element of the powerset constraint system (i.e., it represents
+    the universe).
+  */
+  bool is_top() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this is the bottom
+    element of the powerset constraint system (i.e., it represents
+    the empty set).
+  */
+  bool is_bottom() const;
+
+  /*! \brief
+    Returns a lower bound to the total size in bytes of the memory
+    occupied by \p *this.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  /*! \brief
+    Returns a lower bound to the size in bytes of the memory
+    managed by \p *this.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  // FIXME: document and perhaps use an enum instead of a bool.
+  bool OK(bool disallow_bottom = false) const;
+
+  //@} // Member Functions that Do Not Modify the Powerset Object
+
+protected:
+  //! A powerset is implemented as a sequence of elements.
+  /*!
+    The particular sequence employed must support efficient deletion
+    in any position and efficient back insertion.
+  */
+  typedef std::list<D> Sequence;
+
+  //! Alias for the low-level iterator on the disjuncts.
+  typedef typename Sequence::iterator Sequence_iterator;
+
+  //! Alias for the low-level %const_iterator on the disjuncts.
+  typedef typename Sequence::const_iterator Sequence_const_iterator;
+
+  //! The sequence container holding powerset's elements.
+  Sequence sequence;
+
+  //! If <CODE>true</CODE>, \p *this is Omega-reduced.
+  mutable bool reduced;
+
+public:
+  // Sequence manipulation types, accessors and modifiers
+  typedef typename Sequence::size_type size_type;
+  typedef typename Sequence::value_type value_type;
+
+  /*! \brief
+    Alias for a <EM>read-only</EM> bidirectional %iterator on the
+    disjuncts of a Powerset element.
+
+    By using this iterator type, the disjuncts cannot be overwritten,
+    but they can be removed using methods
+    <CODE>drop_disjunct(iterator position)</CODE> and
+    <CODE>drop_disjuncts(iterator first, iterator last)</CODE>,
+    while still ensuring a correct handling of Omega-reduction.
+  */
+  typedef iterator_to_const<Sequence> iterator;
+
+  //! A bidirectional %const_iterator on the disjuncts of a Powerset element.
+  typedef const_iterator_to_const<Sequence> const_iterator;
+
+  //! The reverse iterator type built from Powerset::iterator.
+  typedef std::reverse_iterator<iterator> reverse_iterator;
+
+  //! The reverse iterator type built from Powerset::const_iterator.
+  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+  //! \name Member Functions for the Direct Manipulation of Disjuncts
+  //@{
+
+  /*! \brief
+    Drops from the sequence of disjuncts in \p *this all the
+    non-maximal elements so that \p *this is non-redundant.
+
+    This method is declared <CODE>const</CODE> because, even though
+    Omega-reduction may change the syntactic representation of \p *this,
+    its semantics will be unchanged.
+  */
+  void omega_reduce() const;
+
+  //! Returns the number of disjuncts.
+  size_type size() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if there are no disjuncts in
+    \p *this.
+  */
+  bool empty() const;
+
+  /*! \brief
+    Returns an iterator pointing to the first disjunct, if \p *this
+    is not empty; otherwise, returns the past-the-end iterator.
+  */
+  iterator begin();
+
+  //! Returns the past-the-end iterator.
+  iterator end();
+
+  /*! \brief
+    Returns a const_iterator pointing to the first disjunct, if \p *this
+    is not empty; otherwise, returns the past-the-end const_iterator.
+  */
+  const_iterator begin() const;
+
+  //! Returns the past-the-end const_iterator.
+  const_iterator end() const;
+
+  /*! \brief
+    Returns a reverse_iterator pointing to the last disjunct, if \p *this
+    is not empty; otherwise, returns the before-the-start reverse_iterator.
+  */
+  reverse_iterator rbegin();
+
+  //! Returns the before-the-start reverse_iterator.
+  reverse_iterator rend();
+
+  /*! \brief
+    Returns a const_reverse_iterator pointing to the last disjunct,
+    if \p *this is not empty; otherwise, returns the before-the-start
+    const_reverse_iterator.
+  */
+  const_reverse_iterator rbegin() const;
+
+  //! Returns the before-the-start const_reverse_iterator.
+  const_reverse_iterator rend() const;
+
+  //! Adds to \p *this the disjunct \p d.
+  void add_disjunct(const D& d);
+
+  /*! \brief
+    Drops the disjunct in \p *this pointed to by \p position, returning
+    an iterator to the disjunct following \p position.
+  */
+  iterator drop_disjunct(iterator position);
+
+  //! Drops all the disjuncts from \p first to \p last (excluded).
+  void drop_disjuncts(iterator first, iterator last);
+
+  //! Drops all the disjuncts, making \p *this an empty powerset.
+  void clear();
+
+  //@} // Member Functions for the Direct Manipulation of Disjuncts
+
+  //! \name Member Functions that May Modify the Powerset Object
+  //@{
+
+  //! The assignment operator.
+  Powerset& operator=(const Powerset& y);
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Powerset& y);
+
+  //! Assigns to \p *this the least upper bound of \p *this and \p y.
+  void least_upper_bound_assign(const Powerset& y);
+
+  //! Assigns to \p *this an upper bound of \p *this and \p y.
+  /*!
+    The result will be the least upper bound of \p *this and \p y.
+  */
+  void upper_bound_assign(const Powerset& y);
+
+  /*! \brief
+    Assigns to \p *this the least upper bound of \p *this and \p y
+    and returns \c true.
+
+    \exception std::invalid_argument
+    Thrown if \p *this and \p y are dimension-incompatible.
+  */
+  bool upper_bound_assign_if_exact(const Powerset& y);
+
+  //! Assigns to \p *this the meet of \p *this and \p y.
+  void meet_assign(const Powerset& y);
+
+  /*! \brief
+    If \p *this is not empty (i.e., it is not the bottom element),
+    it is reduced to a singleton obtained by computing an upper-bound
+    of all the disjuncts.
+  */
+  void collapse();
+
+  //@} // Member Functions that May Modify the Powerset element
+
+protected:
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if \p *this does not contain
+    non-maximal elements.
+  */
+  bool is_omega_reduced() const;
+
+  /*! \brief Upon return, \p *this will contain at most \p
+    max_disjuncts elements; the set of disjuncts in positions greater
+    than or equal to \p max_disjuncts, will be replaced at that
+    position by their upper-bound.
+  */
+  void collapse(unsigned max_disjuncts);
+
+  /*! \brief
+    Adds to \p *this the disjunct \p d,
+    assuming \p d is not the bottom element and ensuring
+    partial Omega-reduction.
+
+    If \p d is not the bottom element and is not Omega-redundant with
+    respect to elements in positions between \p first and \p last, all
+    elements in these positions that would be made Omega-redundant by the
+    addition of \p d are dropped and \p d is added to the reduced
+    sequence.
+    If \p *this is reduced before an invocation of this method,
+    it will be reduced upon successful return from the method.
+  */
+  iterator add_non_bottom_disjunct_preserve_reduction(const D& d,
+                                                      iterator first,
+                                                      iterator last);
+
+  /*! \brief
+    Adds to \p *this the disjunct \p d, assuming \p d is not the
+    bottom element and preserving Omega-reduction.
+
+    If \p *this is reduced before an invocation of this method,
+    it will be reduced upon successful return from the method.
+  */
+  void add_non_bottom_disjunct_preserve_reduction(const D& d);
+
+  /*! \brief
+    Assigns to \p *this the result of applying \p op_assign pairwise
+    to the elements in \p *this and \p y.
+
+    The elements of the powerset result are obtained by applying
+    \p op_assign to each pair of elements whose components are drawn
+    from \p *this and \p y, respectively.
+  */
+  template <typename Binary_Operator_Assign>
+  void pairwise_apply_assign(const Powerset& y,
+                             Binary_Operator_Assign op_assign);
+
+private:
+  /*! \brief
+    Does the hard work of checking whether \p *this contains non-maximal
+    elements and returns <CODE>true</CODE> if and only if it does not.
+  */
+  bool check_omega_reduced() const;
+
+  /*! \brief
+    Replaces the disjunct \p *sink by an upper bound of itself and
+    all the disjuncts following it.
+  */
+  void collapse(Sequence_iterator sink);
+};
+
+#include "Powerset_inlines.hh"
+#include "Powerset_templates.hh"
+
+#endif // !defined(PPL_Powerset_defs_hh)
diff --git a/src/Powerset_inlines.hh b/src/Powerset_inlines.hh
new file mode 100644
index 0000000..ca473a2
--- /dev/null
+++ b/src/Powerset_inlines.hh
@@ -0,0 +1,231 @@
+/* Powerset class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Powerset_inlines_hh
+#define PPL_Powerset_inlines_hh 1
+
+#include <algorithm>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D>
+inline typename Powerset<D>::iterator
+Powerset<D>::begin() {
+  return sequence.begin();
+}
+
+template <typename D>
+inline typename Powerset<D>::iterator
+Powerset<D>::end() {
+  return sequence.end();
+}
+
+template <typename D>
+inline typename Powerset<D>::const_iterator
+Powerset<D>::begin() const {
+  return sequence.begin();
+}
+
+template <typename D>
+inline typename Powerset<D>::const_iterator
+Powerset<D>::end() const {
+  return sequence.end();
+}
+
+template <typename D>
+inline typename Powerset<D>::reverse_iterator
+Powerset<D>::rbegin() {
+  return reverse_iterator(end());
+}
+
+template <typename D>
+inline typename Powerset<D>::reverse_iterator
+Powerset<D>::rend() {
+  return reverse_iterator(begin());
+}
+
+template <typename D>
+inline typename Powerset<D>::const_reverse_iterator
+Powerset<D>::rbegin() const {
+  return const_reverse_iterator(end());
+}
+
+template <typename D>
+inline typename Powerset<D>::const_reverse_iterator
+Powerset<D>::rend() const {
+  return const_reverse_iterator(begin());
+}
+
+template <typename D>
+inline typename Powerset<D>::size_type
+Powerset<D>::size() const {
+  return sequence.size();
+}
+
+template <typename D>
+inline bool
+Powerset<D>::empty() const {
+  return sequence.empty();
+}
+
+template <typename D>
+inline typename Powerset<D>::iterator
+Powerset<D>::drop_disjunct(iterator position) {
+  return sequence.erase(position.base);
+}
+
+template <typename D>
+inline void
+Powerset<D>::drop_disjuncts(iterator first, iterator last) {
+  sequence.erase(first.base, last.base);
+}
+
+template <typename D>
+inline void
+Powerset<D>::clear() {
+  sequence.clear();
+}
+
+template <typename D>
+inline
+Powerset<D>::Powerset(const Powerset& y)
+  : sequence(y.sequence), reduced(y.reduced) {
+}
+
+template <typename D>
+inline Powerset<D>&
+Powerset<D>::operator=(const Powerset& y) {
+  sequence = y.sequence;
+  reduced = y.reduced;
+  return *this;
+}
+
+template <typename D>
+inline void
+Powerset<D>::m_swap(Powerset& y) {
+  using std::swap;
+  swap(sequence, y.sequence);
+  swap(reduced, y.reduced);
+}
+
+template <typename D>
+inline
+Powerset<D>::Powerset()
+  : sequence(), reduced(true) {
+}
+
+template <typename D>
+inline
+Powerset<D>::Powerset(const D& d)
+  : sequence(), reduced(false) {
+  sequence.push_back(d);
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename D>
+inline
+Powerset<D>::~Powerset() {
+}
+
+template <typename D>
+inline void
+Powerset<D>::add_non_bottom_disjunct_preserve_reduction(const D& d) {
+  // !d.is_bottom() is asserted by the callee.
+  add_non_bottom_disjunct_preserve_reduction(d, begin(), end());
+}
+
+template <typename D>
+inline void
+Powerset<D>::add_disjunct(const D& d) {
+  sequence.push_back(d);
+  reduced = false;
+}
+
+/*! \relates Powerset */
+template <typename D>
+inline
+bool operator!=(const Powerset<D>& x, const Powerset<D>& y) {
+  return !(x == y);
+}
+
+template <typename D>
+inline bool
+Powerset<D>::is_top() const {
+  // Must perform omega-reduction for correctness.
+  omega_reduce();
+  const_iterator xi = begin();
+  const_iterator x_end = end();
+  return xi != x_end && xi->is_top() && ++xi == x_end;
+}
+
+template <typename D>
+inline bool
+Powerset<D>::is_bottom() const {
+  // Must perform omega-reduction for correctness.
+  omega_reduce();
+  return empty();
+}
+
+template <typename D>
+inline void
+Powerset<D>::collapse() {
+  if (!empty())
+    collapse(sequence.begin());
+}
+
+template <typename D>
+inline void
+Powerset<D>::meet_assign(const Powerset& y) {
+  pairwise_apply_assign(y, std::mem_fun_ref(&D::meet_assign));
+}
+
+template <typename D>
+inline void
+Powerset<D>::upper_bound_assign(const Powerset& y) {
+  least_upper_bound_assign(y);
+}
+
+template <typename D>
+inline bool
+Powerset<D>::upper_bound_assign_if_exact(const Powerset& y) {
+  least_upper_bound_assign(y);
+  return true;
+}
+
+template <typename D>
+inline memory_size_type
+Powerset<D>::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+/*! \relates Powerset */
+template <typename D>
+inline void
+swap(Powerset<D>& x, Powerset<D>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Powerset_inlines_hh)
diff --git a/src/Powerset_templates.hh b/src/Powerset_templates.hh
new file mode 100644
index 0000000..bb0556b
--- /dev/null
+++ b/src/Powerset_templates.hh
@@ -0,0 +1,312 @@
+/* Powerset class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Powerset_templates_hh
+#define PPL_Powerset_templates_hh 1
+
+#include "globals_defs.hh"
+#include <algorithm>
+#include "assert.hh"
+#include <iostream>
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D>
+void
+Powerset<D>::collapse(const Sequence_iterator sink) {
+  PPL_ASSERT(sink != sequence.end());
+  D& d = *sink;
+  iterator x_sink = sink;
+  iterator next_x_sink = x_sink;
+  ++next_x_sink;
+  iterator x_end = end();
+  for (const_iterator xi = next_x_sink; xi != x_end; ++xi)
+    d.upper_bound_assign(*xi);
+  // Drop the surplus disjuncts.
+  drop_disjuncts(next_x_sink, x_end);
+
+  // Ensure omega-reduction.
+  for (iterator xi = begin(); xi != x_sink; )
+    if (xi->definitely_entails(d))
+      xi = drop_disjunct(xi);
+    else
+      ++xi;
+
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename D>
+void
+Powerset<D>::omega_reduce() const {
+  if (reduced)
+    return;
+
+  Powerset& x = const_cast<Powerset&>(*this);
+  // First remove all bottom elements.
+  for (iterator xi = x.begin(), x_end = x.end(); xi != x_end; )
+    if (xi->is_bottom())
+      xi = x.drop_disjunct(xi);
+    else
+      ++xi;
+  // Then remove non-maximal elements.
+  for (iterator xi = x.begin(); xi != x.end(); ) {
+    const D& xv = *xi;
+    bool dropping_xi = false;
+    for (iterator yi = x.begin(); yi != x.end(); )
+      if (xi == yi)
+        ++yi;
+      else {
+        const D& yv = *yi;
+        if (yv.definitely_entails(xv))
+          yi = x.drop_disjunct(yi);
+        else if (xv.definitely_entails(yv)) {
+          dropping_xi = true;
+          break;
+        }
+        else
+          ++yi;
+      }
+    if (dropping_xi)
+      xi = x.drop_disjunct(xi);
+    else
+      ++xi;
+    if (abandon_expensive_computations != 0 && xi != x.end()) {
+      // Hurry up!
+      x.collapse(xi.base);
+      break;
+    }
+  }
+  reduced = true;
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename D>
+void
+Powerset<D>::collapse(const unsigned max_disjuncts) {
+  PPL_ASSERT(max_disjuncts > 0);
+  // Omega-reduce before counting the number of disjuncts.
+  omega_reduce();
+  size_type n = size();
+  if (n > max_disjuncts) {
+    // Let `i' point to the last disjunct that will survive.
+    iterator i = begin();
+    std::advance(i, max_disjuncts-1);
+    // This disjunct will be assigned an upper-bound of itself and of
+    // all the disjuncts that follow.
+    collapse(i.base);
+  }
+  PPL_ASSERT_HEAVY(OK());
+  PPL_ASSERT(is_omega_reduced());
+}
+
+template <typename D>
+bool
+Powerset<D>::check_omega_reduced() const {
+  for (const_iterator x_begin = begin(), x_end = end(),
+         xi = x_begin; xi != x_end; ++xi) {
+    const D& xv = *xi;
+    if (xv.is_bottom())
+      return false;
+    for (const_iterator yi = x_begin; yi != x_end; ++yi) {
+      if (xi == yi)
+        continue;
+      const D& yv = *yi;
+      if (xv.definitely_entails(yv) || yv.definitely_entails(xv))
+        return false;
+    }
+  }
+  return true;
+}
+
+template <typename D>
+bool
+Powerset<D>::is_omega_reduced() const {
+  if (!reduced && check_omega_reduced())
+    reduced = true;
+  return reduced;
+}
+
+template <typename D>
+typename Powerset<D>::iterator
+Powerset<D>::add_non_bottom_disjunct_preserve_reduction(const D& d,
+                                                        iterator first,
+                                                        iterator last) {
+  PPL_ASSERT_HEAVY(!d.is_bottom());
+  for (iterator xi = first; xi != last; ) {
+    const D& xv = *xi;
+    if (d.definitely_entails(xv))
+      return first;
+    else if (xv.definitely_entails(d)) {
+      if (xi == first)
+        ++first;
+      xi = drop_disjunct(xi);
+    }
+    else
+      ++xi;
+  }
+  sequence.push_back(d);
+  PPL_ASSERT_HEAVY(OK());
+  return first;
+}
+
+template <typename D>
+bool
+Powerset<D>::definitely_entails(const Powerset& y) const {
+  const Powerset<D>& x = *this;
+  bool found = true;
+  for (const_iterator xi = x.begin(),
+         x_end = x.end(); found && xi != x_end; ++xi) {
+    found = false;
+    for (const_iterator yi = y.begin(),
+           y_end = y.end(); !found && yi != y_end; ++yi)
+      found = (*xi).definitely_entails(*yi);
+  }
+  return found;
+}
+
+/*! \relates Powerset */
+template <typename D>
+bool
+operator==(const Powerset<D>& x, const Powerset<D>& y) {
+  x.omega_reduce();
+  y.omega_reduce();
+  if (x.size() != y.size())
+    return false;
+  // Take a copy of `y' and work with it.
+  Powerset<D> z = y;
+  for (typename Powerset<D>::const_iterator xi = x.begin(),
+         x_end = x.end(); xi != x_end; ++xi) {
+    typename Powerset<D>::iterator zi = z.begin();
+    typename Powerset<D>::iterator z_end = z.end();
+    zi = std::find(zi, z_end, *xi);
+    if (zi == z_end)
+      return false;
+    else
+      z.drop_disjunct(zi);
+  }
+  return true;
+}
+
+template <typename D>
+template <typename Binary_Operator_Assign>
+void
+Powerset<D>::pairwise_apply_assign(const Powerset& y,
+                                   Binary_Operator_Assign op_assign) {
+  // Ensure omega-reduction here, since what follows has quadratic complexity.
+  omega_reduce();
+  y.omega_reduce();
+  Sequence new_sequence;
+  for (const_iterator xi = begin(), x_end = end(),
+         y_begin = y.begin(), y_end = y.end(); xi != x_end; ++xi)
+    for (const_iterator yi = y_begin; yi != y_end; ++yi) {
+      D zi = *xi;
+      op_assign(zi, *yi);
+      if (!zi.is_bottom())
+        new_sequence.push_back(zi);
+    }
+  // Put the new sequence in place.
+  using std::swap;
+  swap(sequence, new_sequence);
+  reduced = false;
+  PPL_ASSERT_HEAVY(OK());
+}
+
+template <typename D>
+void
+Powerset<D>::least_upper_bound_assign(const Powerset& y) {
+  // Ensure omega-reduction here, since what follows has quadratic complexity.
+  omega_reduce();
+  y.omega_reduce();
+  iterator old_begin = begin();
+  iterator old_end = end();
+  for (const_iterator i = y.begin(), y_end = y.end(); i != y_end; ++i)
+    old_begin = add_non_bottom_disjunct_preserve_reduction(*i,
+                                                           old_begin,
+                                                           old_end);
+  PPL_ASSERT_HEAVY(OK());
+}
+
+namespace IO_Operators {
+
+/*! \relates Parma_Polyhedra_Library::Powerset */
+template <typename D>
+std::ostream&
+operator<<(std::ostream& s, const Powerset<D>& x) {
+  if (x.is_bottom())
+    s << "false";
+  else if (x.is_top())
+    s << "true";
+  else
+    for (typename Powerset<D>::const_iterator i = x.begin(),
+           x_end = x.end(); i != x_end; ) {
+      s << "{ " << *i << " }";
+      ++i;
+      if (i != x_end)
+        s << ", ";
+    }
+  return s;
+}
+
+} // namespace IO_Operators
+
+template <typename D>
+memory_size_type
+Powerset<D>::external_memory_in_bytes() const {
+  memory_size_type bytes = 0;
+  for (const_iterator xi = begin(), x_end = end(); xi != x_end; ++xi) {
+    bytes += xi->total_memory_in_bytes();
+    // We assume there is at least a forward and a backward link, and
+    // that the pointers implementing them are at least the size of
+    // pointers to `D'.
+    bytes += 2*sizeof(D*);
+  }
+  return bytes;
+}
+
+template <typename D>
+bool
+Powerset<D>::OK(const bool disallow_bottom) const {
+  for (const_iterator xi = begin(), x_end = end(); xi != x_end; ++xi) {
+    if (!xi->OK())
+      return false;
+    if (disallow_bottom && xi->is_bottom()) {
+#ifndef NDEBUG
+      std::cerr << "Bottom element in powerset!"
+                << std::endl;
+#endif
+      return false;
+    }
+  }
+  if (reduced && !check_omega_reduced()) {
+#ifndef NDEBUG
+    std::cerr << "Powerset claims to be reduced, but it is not!"
+              << std::endl;
+#endif
+    return false;
+  }
+  return true;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Powerset_templates_hh)
diff --git a/src/Powerset_types.hh b/src/Powerset_types.hh
new file mode 100644
index 0000000..30deeb6
--- /dev/null
+++ b/src/Powerset_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Powerset_types_hh
+#define PPL_Powerset_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename D>
+class Powerset;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Powerset_types_hh)
diff --git a/src/Ptr_Iterator.defs.hh b/src/Ptr_Iterator.defs.hh
deleted file mode 100644
index 2f6c852..0000000
--- a/src/Ptr_Iterator.defs.hh
+++ /dev/null
@@ -1,172 +0,0 @@
-/* Ptr_Iterator class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Ptr_Iterator_defs_hh
-#define PPL_Ptr_Iterator_defs_hh 1
-
-#include "Ptr_Iterator.types.hh"
-#include <iterator>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-template<typename P, typename Q>
-bool operator==(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P, typename Q>
-bool operator!=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P, typename Q>
-bool operator<(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P, typename Q>
-bool operator<=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P, typename Q>
-bool operator>(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P, typename Q>
-bool operator>=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P, typename Q>
-typename Ptr_Iterator<P>::difference_type
-operator-(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
-
-template<typename P>
-Ptr_Iterator<P> operator+(typename Ptr_Iterator<P>::difference_type m,
-			  const Ptr_Iterator<P>& y);
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A class to define STL const and non-const iterators from pointer types.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename P>
-class Parma_Polyhedra_Library::Implementation::Ptr_Iterator
-  : public std::iterator<typename std::iterator_traits<P>::iterator_category,
-			 typename std::iterator_traits<P>::value_type,
-			 typename std::iterator_traits<P>::difference_type,
-			 typename std::iterator_traits<P>::pointer,
-			 typename std::iterator_traits<P>::reference> {
-public:
-  typedef typename std::iterator_traits<P>::difference_type difference_type;
-  typedef typename std::iterator_traits<P>::reference reference;
-  typedef typename std::iterator_traits<P>::pointer pointer;
-
-  //! Default constructor: no guarantees.
-  Ptr_Iterator();
-
-  //! Construct an iterator pointing at \p q.
-  explicit Ptr_Iterator(const P& q);
-
-  /*! \brief
-    Copy constructor allowing the construction of a const_iterator
-    from a non-const iterator.
-  */
-  template<typename Q>
-  Ptr_Iterator(const Ptr_Iterator<Q>& q);
-
-  //! Dereference operator.
-  reference operator*() const;
-
-  //! Indirect member selector.
-  pointer operator->() const;
-
-  //! Subscript operator.
-  reference operator[](const difference_type m) const;
-
-  //! Prefix increment operator.
-  Ptr_Iterator& operator++();
-
-  //! Postfix increment operator.
-  Ptr_Iterator operator++(int);
-
-  //! Prefix decrement operator
-  Ptr_Iterator& operator--();
-
-  //! Postfix decrement operator.
-  Ptr_Iterator operator--(int);
-
-  //! Assignment-increment operator.
-  Ptr_Iterator& operator+=(const difference_type m);
-
-  //! Assignment-decrement operator.
-  Ptr_Iterator& operator-=(const difference_type m);
-
-  //! Returns the difference between \p *this and \p y.
-  difference_type operator-(const Ptr_Iterator& y) const;
-
-  //! Returns the sum of \p *this and \p m.
-  Ptr_Iterator operator+(const difference_type m) const;
-
-  //! Returns the difference of \p *this and \p m.
-  Ptr_Iterator operator-(const difference_type m) const;
-
-private:
-  //! The base pointer implementing the iterator.
-  P p;
-
-  //! Returns the hidden pointer.
-  const P& base() const;
-
-  template <typename Q, typename R>
-  friend bool Parma_Polyhedra_Library::Implementation::
-  operator==(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  template <typename Q, typename R>
-  friend bool Parma_Polyhedra_Library::Implementation::
-  operator!=(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  template<typename Q, typename R>
-  friend bool Parma_Polyhedra_Library::Implementation::
-  operator<(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  template<typename Q, typename R>
-  friend bool Parma_Polyhedra_Library::Implementation::
-  operator<=(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  template<typename Q, typename R>
-  friend bool Parma_Polyhedra_Library::Implementation::
-  operator>(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  template<typename Q, typename R>
-  friend bool Parma_Polyhedra_Library::Implementation::
-  operator>=(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  template<typename Q, typename R>
-  friend typename Ptr_Iterator<Q>::difference_type
-  Parma_Polyhedra_Library::Implementation::
-  operator-(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
-
-  friend Ptr_Iterator<P>
-  Parma_Polyhedra_Library::Implementation::
-  operator+<>(typename Ptr_Iterator<P>::difference_type m,
-	      const Ptr_Iterator<P>& y);
-};
-
-#include "Ptr_Iterator.inlines.hh"
-
-#endif // !defined(PPL_Ptr_Iterator_defs_hh)
diff --git a/src/Ptr_Iterator.inlines.hh b/src/Ptr_Iterator.inlines.hh
deleted file mode 100644
index 62a7095..0000000
--- a/src/Ptr_Iterator.inlines.hh
+++ /dev/null
@@ -1,189 +0,0 @@
-/* Ptr_Iterator class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Ptr_Iterator_inlines_hh
-#define PPL_Ptr_Iterator_inlines_hh 1
-
-#include <algorithm>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-template <typename P>
-inline const P&
-Ptr_Iterator<P>::base() const {
-  return p;
-}
-
-template <typename P>
-inline
-Ptr_Iterator<P>::Ptr_Iterator()
-  : p(P()) {
-}
-
-template <typename P>
-inline
-Ptr_Iterator<P>::Ptr_Iterator(const P& q)
-  : p(q) {
-}
-
-template <typename P>
-template <typename Q>
-inline
-Ptr_Iterator<P>::Ptr_Iterator(const Ptr_Iterator<Q>& q)
-  : p(q.base()) {
-}
-
-template <typename P>
-inline typename Ptr_Iterator<P>::reference
-Ptr_Iterator<P>::operator*() const {
-  return *p;
-}
-
-template <typename P>
-inline typename Ptr_Iterator<P>::pointer
-Ptr_Iterator<P>::operator->() const {
-  return p;
-}
-
-template <typename P>
-inline typename Ptr_Iterator<P>::reference
-Ptr_Iterator<P>::operator[](const difference_type m) const {
-  return p[m];
-}
-
-template <typename P>
-inline Ptr_Iterator<P>&
-Ptr_Iterator<P>::operator++() {
-  ++p;
-  return *this;
-}
-
-template <typename P>
-inline Ptr_Iterator<P>
-Ptr_Iterator<P>::operator++(int) {
-  return Ptr_Iterator(p++);
-}
-
-template <typename P>
-inline Ptr_Iterator<P>&
-Ptr_Iterator<P>::operator--() {
-  --p;
-  return *this;
-}
-
-template <typename P>
-inline Ptr_Iterator<P>
-Ptr_Iterator<P>::operator--(int) {
-  return Ptr_Iterator(p--);
-}
-
-
-template <typename P>
-inline Ptr_Iterator<P>&
-Ptr_Iterator<P>::operator+=(const difference_type m) {
-  p += m;
-  return *this;
-}
-
-template <typename P>
-inline Ptr_Iterator<P>&
-Ptr_Iterator<P>::operator-=(const difference_type m) {
-  p -= m;
-  return *this;
-}
-
-template <typename P>
-inline typename Ptr_Iterator<P>::difference_type
-Ptr_Iterator<P>::operator-(const Ptr_Iterator& y) const {
-  return p - y.p;
-}
-
-template <typename P>
-inline Ptr_Iterator<P>
-Ptr_Iterator<P>::operator+(const difference_type m) const {
-  return Ptr_Iterator(p + m);
-}
-
-template <typename P>
-inline Ptr_Iterator<P>
-Ptr_Iterator<P>::operator-(const difference_type m) const {
-  return Ptr_Iterator(p - m);
-}
-
-template<typename P, typename Q>
-inline bool
-operator==(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() == y.base();
-}
-
-template<typename P, typename Q>
-inline bool
-operator!=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() != y.base();
-}
-
-template<typename P, typename Q>
-inline bool
-operator<(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() < y.base();
-}
-
-template<typename P, typename Q>
-inline bool
-operator<=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() <= y.base();
-}
-
-template<typename P, typename Q>
-inline bool
-operator>(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() > y.base();
-}
-
-template<typename P, typename Q>
-inline bool
-operator>=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() >= y.base();
-}
-
-template<typename P, typename Q>
-inline typename Ptr_Iterator<P>::difference_type
-operator-(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
-  return x.base() - y.base();
-}
-
-template<typename P>
-inline Ptr_Iterator<P>
-operator+(typename Ptr_Iterator<P>::difference_type m,
-	  const Ptr_Iterator<P>& y) {
-  return Ptr_Iterator<P>(m + y.base());
-}
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Ptr_Iterator_inlines_hh)
diff --git a/src/Ptr_Iterator.types.hh b/src/Ptr_Iterator.types.hh
deleted file mode 100644
index f710f72..0000000
--- a/src/Ptr_Iterator.types.hh
+++ /dev/null
@@ -1,27 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Ptr_Iterator_types_hh
-#define PPL_Ptr_Iterator_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-template <typename P>
-class Ptr_Iterator;
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Ptr_Iterator_types_hh)
diff --git a/src/Ptr_Iterator_defs.hh b/src/Ptr_Iterator_defs.hh
new file mode 100644
index 0000000..a2dc3fd
--- /dev/null
+++ b/src/Ptr_Iterator_defs.hh
@@ -0,0 +1,172 @@
+/* Ptr_Iterator class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Ptr_Iterator_defs_hh
+#define PPL_Ptr_Iterator_defs_hh 1
+
+#include "Ptr_Iterator_types.hh"
+#include <iterator>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template<typename P, typename Q>
+bool operator==(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P, typename Q>
+bool operator!=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P, typename Q>
+bool operator<(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P, typename Q>
+bool operator<=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P, typename Q>
+bool operator>(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P, typename Q>
+bool operator>=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P, typename Q>
+typename Ptr_Iterator<P>::difference_type
+operator-(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
+
+template<typename P>
+Ptr_Iterator<P> operator+(typename Ptr_Iterator<P>::difference_type m,
+                          const Ptr_Iterator<P>& y);
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A class to define STL const and non-const iterators from pointer types.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename P>
+class Parma_Polyhedra_Library::Implementation::Ptr_Iterator
+  : public std::iterator<typename std::iterator_traits<P>::iterator_category,
+                         typename std::iterator_traits<P>::value_type,
+                         typename std::iterator_traits<P>::difference_type,
+                         typename std::iterator_traits<P>::pointer,
+                         typename std::iterator_traits<P>::reference> {
+public:
+  typedef typename std::iterator_traits<P>::difference_type difference_type;
+  typedef typename std::iterator_traits<P>::reference reference;
+  typedef typename std::iterator_traits<P>::pointer pointer;
+
+  //! Default constructor: no guarantees.
+  Ptr_Iterator();
+
+  //! Construct an iterator pointing at \p q.
+  explicit Ptr_Iterator(const P& q);
+
+  /*! \brief
+    Copy constructor allowing the construction of a const_iterator
+    from a non-const iterator.
+  */
+  template<typename Q>
+  Ptr_Iterator(const Ptr_Iterator<Q>& q);
+
+  //! Dereference operator.
+  reference operator*() const;
+
+  //! Indirect member selector.
+  pointer operator->() const;
+
+  //! Subscript operator.
+  reference operator[](const difference_type m) const;
+
+  //! Prefix increment operator.
+  Ptr_Iterator& operator++();
+
+  //! Postfix increment operator.
+  Ptr_Iterator operator++(int);
+
+  //! Prefix decrement operator
+  Ptr_Iterator& operator--();
+
+  //! Postfix decrement operator.
+  Ptr_Iterator operator--(int);
+
+  //! Assignment-increment operator.
+  Ptr_Iterator& operator+=(const difference_type m);
+
+  //! Assignment-decrement operator.
+  Ptr_Iterator& operator-=(const difference_type m);
+
+  //! Returns the difference between \p *this and \p y.
+  difference_type operator-(const Ptr_Iterator& y) const;
+
+  //! Returns the sum of \p *this and \p m.
+  Ptr_Iterator operator+(const difference_type m) const;
+
+  //! Returns the difference of \p *this and \p m.
+  Ptr_Iterator operator-(const difference_type m) const;
+
+private:
+  //! The base pointer implementing the iterator.
+  P p;
+
+  //! Returns the hidden pointer.
+  const P& base() const;
+
+  template <typename Q, typename R>
+  friend bool Parma_Polyhedra_Library::Implementation::
+  operator==(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  template <typename Q, typename R>
+  friend bool Parma_Polyhedra_Library::Implementation::
+  operator!=(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  template<typename Q, typename R>
+  friend bool Parma_Polyhedra_Library::Implementation::
+  operator<(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  template<typename Q, typename R>
+  friend bool Parma_Polyhedra_Library::Implementation::
+  operator<=(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  template<typename Q, typename R>
+  friend bool Parma_Polyhedra_Library::Implementation::
+  operator>(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  template<typename Q, typename R>
+  friend bool Parma_Polyhedra_Library::Implementation::
+  operator>=(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  template<typename Q, typename R>
+  friend typename Ptr_Iterator<Q>::difference_type
+  Parma_Polyhedra_Library::Implementation::
+  operator-(const Ptr_Iterator<Q>& x, const Ptr_Iterator<R>& y);
+
+  friend Ptr_Iterator<P>
+  Parma_Polyhedra_Library::Implementation::
+  operator+<>(typename Ptr_Iterator<P>::difference_type m,
+              const Ptr_Iterator<P>& y);
+};
+
+#include "Ptr_Iterator_inlines.hh"
+
+#endif // !defined(PPL_Ptr_Iterator_defs_hh)
diff --git a/src/Ptr_Iterator_inlines.hh b/src/Ptr_Iterator_inlines.hh
new file mode 100644
index 0000000..dc1bdca
--- /dev/null
+++ b/src/Ptr_Iterator_inlines.hh
@@ -0,0 +1,189 @@
+/* Ptr_Iterator class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Ptr_Iterator_inlines_hh
+#define PPL_Ptr_Iterator_inlines_hh 1
+
+#include <algorithm>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename P>
+inline const P&
+Ptr_Iterator<P>::base() const {
+  return p;
+}
+
+template <typename P>
+inline
+Ptr_Iterator<P>::Ptr_Iterator()
+  : p(P()) {
+}
+
+template <typename P>
+inline
+Ptr_Iterator<P>::Ptr_Iterator(const P& q)
+  : p(q) {
+}
+
+template <typename P>
+template <typename Q>
+inline
+Ptr_Iterator<P>::Ptr_Iterator(const Ptr_Iterator<Q>& q)
+  : p(q.base()) {
+}
+
+template <typename P>
+inline typename Ptr_Iterator<P>::reference
+Ptr_Iterator<P>::operator*() const {
+  return *p;
+}
+
+template <typename P>
+inline typename Ptr_Iterator<P>::pointer
+Ptr_Iterator<P>::operator->() const {
+  return p;
+}
+
+template <typename P>
+inline typename Ptr_Iterator<P>::reference
+Ptr_Iterator<P>::operator[](const difference_type m) const {
+  return p[m];
+}
+
+template <typename P>
+inline Ptr_Iterator<P>&
+Ptr_Iterator<P>::operator++() {
+  ++p;
+  return *this;
+}
+
+template <typename P>
+inline Ptr_Iterator<P>
+Ptr_Iterator<P>::operator++(int) {
+  return Ptr_Iterator(p++);
+}
+
+template <typename P>
+inline Ptr_Iterator<P>&
+Ptr_Iterator<P>::operator--() {
+  --p;
+  return *this;
+}
+
+template <typename P>
+inline Ptr_Iterator<P>
+Ptr_Iterator<P>::operator--(int) {
+  return Ptr_Iterator(p--);
+}
+
+
+template <typename P>
+inline Ptr_Iterator<P>&
+Ptr_Iterator<P>::operator+=(const difference_type m) {
+  p += m;
+  return *this;
+}
+
+template <typename P>
+inline Ptr_Iterator<P>&
+Ptr_Iterator<P>::operator-=(const difference_type m) {
+  p -= m;
+  return *this;
+}
+
+template <typename P>
+inline typename Ptr_Iterator<P>::difference_type
+Ptr_Iterator<P>::operator-(const Ptr_Iterator& y) const {
+  return p - y.p;
+}
+
+template <typename P>
+inline Ptr_Iterator<P>
+Ptr_Iterator<P>::operator+(const difference_type m) const {
+  return Ptr_Iterator(p + m);
+}
+
+template <typename P>
+inline Ptr_Iterator<P>
+Ptr_Iterator<P>::operator-(const difference_type m) const {
+  return Ptr_Iterator(p - m);
+}
+
+template<typename P, typename Q>
+inline bool
+operator==(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() == y.base();
+}
+
+template<typename P, typename Q>
+inline bool
+operator!=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() != y.base();
+}
+
+template<typename P, typename Q>
+inline bool
+operator<(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() < y.base();
+}
+
+template<typename P, typename Q>
+inline bool
+operator<=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() <= y.base();
+}
+
+template<typename P, typename Q>
+inline bool
+operator>(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() > y.base();
+}
+
+template<typename P, typename Q>
+inline bool
+operator>=(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() >= y.base();
+}
+
+template<typename P, typename Q>
+inline typename Ptr_Iterator<P>::difference_type
+operator-(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
+  return x.base() - y.base();
+}
+
+template<typename P>
+inline Ptr_Iterator<P>
+operator+(typename Ptr_Iterator<P>::difference_type m,
+          const Ptr_Iterator<P>& y) {
+  return Ptr_Iterator<P>(m + y.base());
+}
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Ptr_Iterator_inlines_hh)
diff --git a/src/Ptr_Iterator_types.hh b/src/Ptr_Iterator_types.hh
new file mode 100644
index 0000000..f696d82
--- /dev/null
+++ b/src/Ptr_Iterator_types.hh
@@ -0,0 +1,27 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Ptr_Iterator_types_hh
+#define PPL_Ptr_Iterator_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename P>
+class Ptr_Iterator;
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Ptr_Iterator_types_hh)
diff --git a/src/Rational_Box.hh b/src/Rational_Box.hh
index 99d871b..374a060 100644
--- a/src/Rational_Box.hh
+++ b/src/Rational_Box.hh
@@ -1,6 +1,6 @@
 /* Rational_Box class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -25,7 +25,7 @@ site: http://bugseng.com/products/ppl/ . */
 #define PPL_Rational_Box_hh 1
 
 #include "Rational_Interval.hh"
-#include "Box.defs.hh"
+#include "Box_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
diff --git a/src/Rational_Interval.hh b/src/Rational_Interval.hh
index 950e69d..ec8331f 100644
--- a/src/Rational_Interval.hh
+++ b/src/Rational_Interval.hh
@@ -1,6 +1,6 @@
 /* Rational_Interval class declaration and implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,7 +24,7 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_Rational_Interval_hh
 #define PPL_Rational_Interval_hh 1
 
-#include "Interval.defs.hh"
+#include "Interval_defs.hh"
 #include <gmpxx.h>
 
 namespace Parma_Polyhedra_Library {
diff --git a/src/Result.defs.hh b/src/Result.defs.hh
deleted file mode 100644
index fa2fc2f..0000000
--- a/src/Result.defs.hh
+++ /dev/null
@@ -1,195 +0,0 @@
-/* Result enum and supporting function declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Result_defs_hh
-#define PPL_Result_defs_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-enum Result_Class {
-  //! \hideinitializer Representable number result class.
-  VC_NORMAL = 0U << 4,
-
-  //! \hideinitializer Negative infinity result class.
-  VC_MINUS_INFINITY = 1U << 4,
-
-  //! \hideinitializer Positive infinity result class.
-  VC_PLUS_INFINITY = 2U << 4,
-
-  //! \hideinitializer Not a number result class.
-  VC_NAN = 3U << 4,
-
-  VC_MASK = VC_NAN
-};
-
-// This must be kept in sync with Relation_Symbol
-enum Result_Relation {
-  //! \hideinitializer No values satisfies the relation.
-  VR_EMPTY = 0U,
-
-  //! \hideinitializer Equal. This need to be accompanied by a value.
-  VR_EQ = 1U,
-
-  //! \hideinitializer Less than. This need to be accompanied by a value.
-  VR_LT = 2U,
-
-  //! \hideinitializer Greater than. This need to be accompanied by a value.
-  VR_GT = 4U,
-
-  //! \hideinitializer Not equal. This need to be accompanied by a value.
-  VR_NE = VR_LT | VR_GT,
-
-  //! \hideinitializer Less or equal. This need to be accompanied by a value.
-  VR_LE = VR_EQ | VR_LT,
-
-  //! \hideinitializer Greater or equal. This need to be accompanied by a value.
-  VR_GE = VR_EQ | VR_GT,
-
-  //! \hideinitializer All values satisfy the relation.
-  VR_LGE = VR_LT | VR_EQ | VR_GT,
-
-  VR_MASK = VR_LGE
-};
-
-//! Possible outcomes of a checked arithmetic computation.
-/*! \ingroup PPL_CXX_interface */
-enum Result {
-  //! \hideinitializer The exact result is not comparable.
-  V_EMPTY = VR_EMPTY,
-
-  //! \hideinitializer The computed result is exact.
-  V_EQ = static_cast<unsigned>(VR_EQ),
-
-  //! \hideinitializer The computed result is inexact and rounded up.
-  V_LT = static_cast<unsigned>(VR_LT),
-
-  //! \hideinitializer The computed result is inexact and rounded down.
-  V_GT = static_cast<unsigned>(VR_GT),
-
-  //! \hideinitializer The computed result is inexact.
-  V_NE = VR_NE,
-
-  //! \hideinitializer The computed result may be inexact and rounded up.
-  V_LE = VR_LE,
-
-  //! \hideinitializer The computed result may be inexact and rounded down.
-  V_GE = VR_GE,
-
-  //! \hideinitializer The computed result may be inexact.
-  V_LGE = VR_LGE,
-
-  //! \hideinitializer The exact result is a number out of finite bounds.
-  V_OVERFLOW = 1U << 6,
-
-  //! \hideinitializer A negative integer overflow occurred (rounding up).
-  V_LT_INF = V_LT | V_OVERFLOW,
-
-  //! \hideinitializer A positive integer overflow occurred (rounding down).
-  V_GT_SUP = V_GT | V_OVERFLOW,
-
-  //! \hideinitializer A positive integer overflow occurred (rounding up).
-  V_LT_PLUS_INFINITY = V_LT | static_cast<unsigned>(VC_PLUS_INFINITY),
-
-  //! \hideinitializer A negative integer overflow occurred (rounding down).
-  V_GT_MINUS_INFINITY = V_GT | static_cast<unsigned>(VC_MINUS_INFINITY),
-
-  //! \hideinitializer Negative infinity result.
-  V_EQ_MINUS_INFINITY = V_EQ | static_cast<unsigned>(VC_MINUS_INFINITY),
-
-  //! \hideinitializer Positive infinity result.
-  V_EQ_PLUS_INFINITY = V_EQ | static_cast<unsigned>(VC_PLUS_INFINITY),
-
-  //! \hideinitializer Not a number result.
-  V_NAN = static_cast<unsigned>(VC_NAN),
-
-  //! \hideinitializer Converting from unknown string.
-  V_CVT_STR_UNK = V_NAN | (1U << 8),
-
-  //! \hideinitializer Dividing by zero.
-  V_DIV_ZERO = V_NAN | (2U << 8),
-
-  //! \hideinitializer Adding two infinities having opposite signs.
-  V_INF_ADD_INF = V_NAN | (3U << 8),
-
-  //! \hideinitializer Dividing two infinities.
-  V_INF_DIV_INF = V_NAN | (4U << 8),
-
-  //! \hideinitializer Taking the modulus of an infinity.
-  V_INF_MOD = V_NAN | (5U << 8),
-
-  //! \hideinitializer Multiplying an infinity by zero.
-  V_INF_MUL_ZERO = V_NAN | (6U << 8),
-
-  //! \hideinitializer Subtracting two infinities having the same sign.
-  V_INF_SUB_INF = V_NAN | (7U << 8),
-
-  //! \hideinitializer Computing a remainder modulo zero.
-  V_MOD_ZERO = V_NAN | (8U << 8),
-
-  //! \hideinitializer Taking the square root of a negative number.
-  V_SQRT_NEG = V_NAN | (9U << 8),
-
-  //! \hideinitializer Unknown result due to intermediate negative overflow.
-  V_UNKNOWN_NEG_OVERFLOW = V_NAN | (10U << 8),
-
-  //! \hideinitializer Unknown result due to intermediate positive overflow.
-  V_UNKNOWN_POS_OVERFLOW = V_NAN | (11U << 8),
-
-  //! \hideinitializer The computed result is not representable.
-  V_UNREPRESENTABLE = 1U << 7
-
-};
-
-//! \name Functions Inspecting and/or Combining Result Values
-//@{
-
-/*! \ingroup PPL_CXX_interface */
-Result operator&(Result x, Result y);
-
-/*! \ingroup PPL_CXX_interface */
-Result operator|(Result x, Result y);
-
-/*! \ingroup PPL_CXX_interface */
-Result operator-(Result x, Result y);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Extracts the value class part of \p r (representable number,
-  unrepresentable minus/plus infinity or nan).
-*/
-Result_Class result_class(Result r);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Extracts the relation part of \p r.
-*/
-Result_Relation result_relation(Result r);
-
-/*! \ingroup PPL_CXX_interface */
-Result result_relation_class(Result r);
-
-//@} // Functions Inspecting and/or Combining Result Values
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Result.inlines.hh"
-
-#endif // !defined(PPL_Result_defs_hh)
diff --git a/src/Result.inlines.hh b/src/Result.inlines.hh
deleted file mode 100644
index 2f22082..0000000
--- a/src/Result.inlines.hh
+++ /dev/null
@@ -1,102 +0,0 @@
-/* Result supporting functions implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Result_inlines_hh
-#define PPL_Result_inlines_hh 1
-
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-/*! \ingroup PPL_CXX_interface */
-inline Result
-operator&(Result x, Result y) {
-  unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
-  return static_cast<Result>(res);
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Result
-operator|(Result x, Result y) {
-  unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
-  return static_cast<Result>(res);
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Result
-operator-(Result x, Result y) {
-  Result y_neg = static_cast<Result>(~static_cast<unsigned>(y));
-  return x & y_neg;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Result_Class
-result_class(Result r) {
-  Result rc = r & static_cast<Result>(VC_MASK);
-  return static_cast<Result_Class>(rc);
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Result_Relation
-result_relation(Result r) {
-  Result rc = r & static_cast<Result>(VR_MASK);
-  return static_cast<Result_Relation>(rc);
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Result
-result_relation_class(Result r) {
-  return r & (static_cast<Result>(VR_MASK) | static_cast<Result>(VC_MASK));
-}
-
-inline int
-result_overflow(Result r) {
-  switch (result_class(r)) {
-  case VC_NORMAL:
-    switch (r) {
-    case V_LT_INF:
-      return -1;
-    case V_GT_SUP:
-      return 1;
-    default:
-      break;
-    }
-    break;
-  case VC_MINUS_INFINITY:
-    return -1;
-  case VC_PLUS_INFINITY:
-    return 1;
-  default:
-    break;
-  }
-  return 0;
-}
-
-inline bool
-result_representable(Result r) {
-  return (r & V_UNREPRESENTABLE) != V_UNREPRESENTABLE;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Result_inlines_hh)
diff --git a/src/Result_defs.hh b/src/Result_defs.hh
new file mode 100644
index 0000000..860a7b7
--- /dev/null
+++ b/src/Result_defs.hh
@@ -0,0 +1,195 @@
+/* Result enum and supporting function declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Result_defs_hh
+#define PPL_Result_defs_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+enum Result_Class {
+  //! \hideinitializer Representable number result class.
+  VC_NORMAL = 0U << 4,
+
+  //! \hideinitializer Negative infinity result class.
+  VC_MINUS_INFINITY = 1U << 4,
+
+  //! \hideinitializer Positive infinity result class.
+  VC_PLUS_INFINITY = 2U << 4,
+
+  //! \hideinitializer Not a number result class.
+  VC_NAN = 3U << 4,
+
+  VC_MASK = VC_NAN
+};
+
+// This must be kept in sync with Relation_Symbol
+enum Result_Relation {
+  //! \hideinitializer No values satisfies the relation.
+  VR_EMPTY = 0U,
+
+  //! \hideinitializer Equal. This need to be accompanied by a value.
+  VR_EQ = 1U,
+
+  //! \hideinitializer Less than. This need to be accompanied by a value.
+  VR_LT = 2U,
+
+  //! \hideinitializer Greater than. This need to be accompanied by a value.
+  VR_GT = 4U,
+
+  //! \hideinitializer Not equal. This need to be accompanied by a value.
+  VR_NE = VR_LT | VR_GT,
+
+  //! \hideinitializer Less or equal. This need to be accompanied by a value.
+  VR_LE = VR_EQ | VR_LT,
+
+  //! \hideinitializer Greater or equal. This need to be accompanied by a value.
+  VR_GE = VR_EQ | VR_GT,
+
+  //! \hideinitializer All values satisfy the relation.
+  VR_LGE = VR_LT | VR_EQ | VR_GT,
+
+  VR_MASK = VR_LGE
+};
+
+//! Possible outcomes of a checked arithmetic computation.
+/*! \ingroup PPL_CXX_interface */
+enum Result {
+  //! \hideinitializer The exact result is not comparable.
+  V_EMPTY = VR_EMPTY,
+
+  //! \hideinitializer The computed result is exact.
+  V_EQ = static_cast<unsigned>(VR_EQ),
+
+  //! \hideinitializer The computed result is inexact and rounded up.
+  V_LT = static_cast<unsigned>(VR_LT),
+
+  //! \hideinitializer The computed result is inexact and rounded down.
+  V_GT = static_cast<unsigned>(VR_GT),
+
+  //! \hideinitializer The computed result is inexact.
+  V_NE = VR_NE,
+
+  //! \hideinitializer The computed result may be inexact and rounded up.
+  V_LE = VR_LE,
+
+  //! \hideinitializer The computed result may be inexact and rounded down.
+  V_GE = VR_GE,
+
+  //! \hideinitializer The computed result may be inexact.
+  V_LGE = VR_LGE,
+
+  //! \hideinitializer The exact result is a number out of finite bounds.
+  V_OVERFLOW = 1U << 6,
+
+  //! \hideinitializer A negative integer overflow occurred (rounding up).
+  V_LT_INF = V_LT | V_OVERFLOW,
+
+  //! \hideinitializer A positive integer overflow occurred (rounding down).
+  V_GT_SUP = V_GT | V_OVERFLOW,
+
+  //! \hideinitializer A positive integer overflow occurred (rounding up).
+  V_LT_PLUS_INFINITY = V_LT | static_cast<unsigned>(VC_PLUS_INFINITY),
+
+  //! \hideinitializer A negative integer overflow occurred (rounding down).
+  V_GT_MINUS_INFINITY = V_GT | static_cast<unsigned>(VC_MINUS_INFINITY),
+
+  //! \hideinitializer Negative infinity result.
+  V_EQ_MINUS_INFINITY = V_EQ | static_cast<unsigned>(VC_MINUS_INFINITY),
+
+  //! \hideinitializer Positive infinity result.
+  V_EQ_PLUS_INFINITY = V_EQ | static_cast<unsigned>(VC_PLUS_INFINITY),
+
+  //! \hideinitializer Not a number result.
+  V_NAN = static_cast<unsigned>(VC_NAN),
+
+  //! \hideinitializer Converting from unknown string.
+  V_CVT_STR_UNK = V_NAN | (1U << 8),
+
+  //! \hideinitializer Dividing by zero.
+  V_DIV_ZERO = V_NAN | (2U << 8),
+
+  //! \hideinitializer Adding two infinities having opposite signs.
+  V_INF_ADD_INF = V_NAN | (3U << 8),
+
+  //! \hideinitializer Dividing two infinities.
+  V_INF_DIV_INF = V_NAN | (4U << 8),
+
+  //! \hideinitializer Taking the modulus of an infinity.
+  V_INF_MOD = V_NAN | (5U << 8),
+
+  //! \hideinitializer Multiplying an infinity by zero.
+  V_INF_MUL_ZERO = V_NAN | (6U << 8),
+
+  //! \hideinitializer Subtracting two infinities having the same sign.
+  V_INF_SUB_INF = V_NAN | (7U << 8),
+
+  //! \hideinitializer Computing a remainder modulo zero.
+  V_MOD_ZERO = V_NAN | (8U << 8),
+
+  //! \hideinitializer Taking the square root of a negative number.
+  V_SQRT_NEG = V_NAN | (9U << 8),
+
+  //! \hideinitializer Unknown result due to intermediate negative overflow.
+  V_UNKNOWN_NEG_OVERFLOW = V_NAN | (10U << 8),
+
+  //! \hideinitializer Unknown result due to intermediate positive overflow.
+  V_UNKNOWN_POS_OVERFLOW = V_NAN | (11U << 8),
+
+  //! \hideinitializer The computed result is not representable.
+  V_UNREPRESENTABLE = 1U << 7
+
+};
+
+//! \name Functions Inspecting and/or Combining Result Values
+//@{
+
+/*! \ingroup PPL_CXX_interface */
+Result operator&(Result x, Result y);
+
+/*! \ingroup PPL_CXX_interface */
+Result operator|(Result x, Result y);
+
+/*! \ingroup PPL_CXX_interface */
+Result operator-(Result x, Result y);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Extracts the value class part of \p r (representable number,
+  unrepresentable minus/plus infinity or nan).
+*/
+Result_Class result_class(Result r);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Extracts the relation part of \p r.
+*/
+Result_Relation result_relation(Result r);
+
+/*! \ingroup PPL_CXX_interface */
+Result result_relation_class(Result r);
+
+//@} // Functions Inspecting and/or Combining Result Values
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Result_inlines.hh"
+
+#endif // !defined(PPL_Result_defs_hh)
diff --git a/src/Result_inlines.hh b/src/Result_inlines.hh
new file mode 100644
index 0000000..a7ad02d
--- /dev/null
+++ b/src/Result_inlines.hh
@@ -0,0 +1,102 @@
+/* Result supporting functions implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Result_inlines_hh
+#define PPL_Result_inlines_hh 1
+
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+/*! \ingroup PPL_CXX_interface */
+inline Result
+operator&(Result x, Result y) {
+  const unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
+  return static_cast<Result>(res);
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Result
+operator|(Result x, Result y) {
+  const unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
+  return static_cast<Result>(res);
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Result
+operator-(Result x, Result y) {
+  const Result y_neg = static_cast<Result>(~static_cast<unsigned>(y));
+  return x & y_neg;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Result_Class
+result_class(Result r) {
+  const Result rc = r & static_cast<Result>(VC_MASK);
+  return static_cast<Result_Class>(rc);
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Result_Relation
+result_relation(Result r) {
+  const Result rc = r & static_cast<Result>(VR_MASK);
+  return static_cast<Result_Relation>(rc);
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Result
+result_relation_class(Result r) {
+  return r & (static_cast<Result>(VR_MASK) | static_cast<Result>(VC_MASK));
+}
+
+inline int
+result_overflow(Result r) {
+  switch (result_class(r)) {
+  case VC_NORMAL:
+    switch (r) {
+    case V_LT_INF:
+      return -1;
+    case V_GT_SUP:
+      return 1;
+    default:
+      break;
+    }
+    break;
+  case VC_MINUS_INFINITY:
+    return -1;
+  case VC_PLUS_INFINITY:
+    return 1;
+  default:
+    break;
+  }
+  return 0;
+}
+
+inline bool
+result_representable(Result r) {
+  return (r & V_UNREPRESENTABLE) != V_UNREPRESENTABLE;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Result_inlines_hh)
diff --git a/src/Rounding_Dir.defs.hh b/src/Rounding_Dir.defs.hh
deleted file mode 100644
index f9161f0..0000000
--- a/src/Rounding_Dir.defs.hh
+++ /dev/null
@@ -1,124 +0,0 @@
-/* Declaration of Rounding_Dir and related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Rounding_defs_hh
-#define PPL_Rounding_defs_hh 1
-
-#include "Result.defs.hh"
-#include "fpu.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-//! Rounding directions for arithmetic computations.
-/*! \ingroup PPL_CXX_interface */
-enum Rounding_Dir {
-  /*! \hideinitializer
-    Round toward \f$-\infty\f$.
-  */
-  ROUND_DOWN = 0U,
-
-  /*! \hideinitializer
-    Round toward \f$+\infty\f$.
-  */
-  ROUND_UP = 1U,
-
-  /*! \hideinitializer
-    Rounding is delegated to lower level. Result info is evaluated lazily.
-  */
-  ROUND_IGNORE = 6U,
-  ROUND_NATIVE = ROUND_IGNORE,
-
-  /*! \hideinitializer
-    Rounding is not needed: client code must ensure that the operation
-    result is exact and representable in the destination type.
-    Result info is evaluated lazily.
-  */
-  ROUND_NOT_NEEDED = 7U,
-
-  ROUND_DIRECT = ROUND_UP,
-  ROUND_INVERSE = ROUND_DOWN,
-
-  ROUND_DIR_MASK = 7U,
-
-  /*! \hideinitializer
-    The client code is willing to pay an extra price to know the exact
-    relation between the exact result and the computed one.
-   */
-  ROUND_STRICT_RELATION = 8U,
-
-  ROUND_CHECK = ROUND_DIRECT | ROUND_STRICT_RELATION
-};
-
-//! \name Functions Inspecting and/or Combining Rounding_Dir Values
-//@{
-
-/*! \ingroup PPL_CXX_interface */
-Rounding_Dir operator&(Rounding_Dir x, Rounding_Dir y);
-
-/*! \ingroup PPL_CXX_interface */
-Rounding_Dir operator|(Rounding_Dir x, Rounding_Dir y);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Returns the inverse rounding mode of \p dir,
-  <CODE>ROUND_IGNORE</CODE> being the inverse of itself.
-*/
-Rounding_Dir inverse(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-Rounding_Dir round_dir(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_down(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_up(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_ignore(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_not_needed(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_not_requested(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_direct(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_inverse(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-bool round_strict_relation(Rounding_Dir dir);
-
-/*! \ingroup PPL_CXX_interface */
-fpu_rounding_direction_type round_fpu_dir(Rounding_Dir dir);
-
-//@} // Functions Inspecting and/or Combining Rounding_Dir Values
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Rounding_Dir.inlines.hh"
-
-#endif // !defined(PPL_Float_defs_hh)
-
diff --git a/src/Rounding_Dir.inlines.hh b/src/Rounding_Dir.inlines.hh
deleted file mode 100644
index 8b50802..0000000
--- a/src/Rounding_Dir.inlines.hh
+++ /dev/null
@@ -1,141 +0,0 @@
-/* Inline functions operating on enum Rounding_Dir values.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Rounding_Dir_inlines_hh
-#define PPL_Rounding_Dir_inlines_hh 1
-
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-/*! \ingroup PPL_CXX_interface */
-inline Rounding_Dir
-operator&(Rounding_Dir x, Rounding_Dir y) {
-  unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
-  return static_cast<Rounding_Dir>(res);
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Rounding_Dir
-operator|(Rounding_Dir x, Rounding_Dir y) {
-  unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
-  return static_cast<Rounding_Dir>(res);
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline Rounding_Dir
-round_dir(Rounding_Dir dir) {
-  return dir & ROUND_DIR_MASK;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_down(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_DOWN;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_up(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_UP;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_ignore(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_IGNORE;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_not_needed(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_NOT_NEEDED;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_not_requested(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_IGNORE || round_dir(dir) == ROUND_NOT_NEEDED;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_direct(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_DIRECT;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_inverse(Rounding_Dir dir) {
-  return round_dir(dir) == ROUND_INVERSE;
-}
-
-/*! \ingroup PPL_CXX_interface */
-inline bool
-round_strict_relation(Rounding_Dir dir) {
-  return (dir & ROUND_STRICT_RELATION) == ROUND_STRICT_RELATION;
-}
-
-#if PPL_CAN_CONTROL_FPU
-
-/*! \ingroup PPL_CXX_interface */
-inline fpu_rounding_direction_type
-round_fpu_dir(Rounding_Dir dir) {
-  switch (round_dir(dir)) {
-  case ROUND_UP:
-    return static_cast<fpu_rounding_direction_type>(PPL_FPU_UPWARD);
-  case ROUND_DOWN:
-    return static_cast<fpu_rounding_direction_type>(PPL_FPU_DOWNWARD);
-  case ROUND_IGNORE: // Fall through.
-  default:
-    PPL_UNREACHABLE;
-    return static_cast<fpu_rounding_direction_type>(PPL_FPU_UPWARD);
-  }
-}
-
-#undef PPL_FPU_DOWNWARD
-#undef PPL_FPU_TONEAREST
-#undef PPL_FPU_TOWARDZERO
-#undef PPL_FPU_UPWARD
-
-#endif
-
-/*! \ingroup PPL_CXX_interface */
-inline Rounding_Dir
-inverse(Rounding_Dir dir) {
-  switch (round_dir(dir)) {
-  case ROUND_UP:
-    return ROUND_DOWN | (dir & ROUND_STRICT_RELATION);
-  case ROUND_DOWN:
-    return ROUND_UP | (dir & ROUND_STRICT_RELATION);
-  case ROUND_IGNORE:
-    return dir;
-  default:
-    PPL_UNREACHABLE;
-    return dir;
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Rounding_Dir_inlines_hh)
diff --git a/src/Rounding_Dir_defs.hh b/src/Rounding_Dir_defs.hh
new file mode 100644
index 0000000..82b403e
--- /dev/null
+++ b/src/Rounding_Dir_defs.hh
@@ -0,0 +1,124 @@
+/* Declaration of Rounding_Dir and related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Rounding_defs_hh
+#define PPL_Rounding_defs_hh 1
+
+#include "Result_defs.hh"
+#include "fpu_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+//! Rounding directions for arithmetic computations.
+/*! \ingroup PPL_CXX_interface */
+enum Rounding_Dir {
+  /*! \hideinitializer
+    Round toward \f$-\infty\f$.
+  */
+  ROUND_DOWN = 0U,
+
+  /*! \hideinitializer
+    Round toward \f$+\infty\f$.
+  */
+  ROUND_UP = 1U,
+
+  /*! \hideinitializer
+    Rounding is delegated to lower level. Result info is evaluated lazily.
+  */
+  ROUND_IGNORE = 6U,
+  ROUND_NATIVE = ROUND_IGNORE,
+
+  /*! \hideinitializer
+    Rounding is not needed: client code must ensure that the operation
+    result is exact and representable in the destination type.
+    Result info is evaluated lazily.
+  */
+  ROUND_NOT_NEEDED = 7U,
+
+  ROUND_DIRECT = ROUND_UP,
+  ROUND_INVERSE = ROUND_DOWN,
+
+  ROUND_DIR_MASK = 7U,
+
+  /*! \hideinitializer
+    The client code is willing to pay an extra price to know the exact
+    relation between the exact result and the computed one.
+   */
+  ROUND_STRICT_RELATION = 8U,
+
+  ROUND_CHECK = ROUND_DIRECT | ROUND_STRICT_RELATION
+};
+
+//! \name Functions Inspecting and/or Combining Rounding_Dir Values
+//@{
+
+/*! \ingroup PPL_CXX_interface */
+Rounding_Dir operator&(Rounding_Dir x, Rounding_Dir y);
+
+/*! \ingroup PPL_CXX_interface */
+Rounding_Dir operator|(Rounding_Dir x, Rounding_Dir y);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Returns the inverse rounding mode of \p dir,
+  <CODE>ROUND_IGNORE</CODE> being the inverse of itself.
+*/
+Rounding_Dir inverse(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+Rounding_Dir round_dir(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_down(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_up(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_ignore(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_not_needed(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_not_requested(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_direct(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_inverse(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+bool round_strict_relation(Rounding_Dir dir);
+
+/*! \ingroup PPL_CXX_interface */
+fpu_rounding_direction_type round_fpu_dir(Rounding_Dir dir);
+
+//@} // Functions Inspecting and/or Combining Rounding_Dir Values
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Rounding_Dir_inlines.hh"
+
+#endif // !defined(PPL_Float_defs_hh)
+
diff --git a/src/Rounding_Dir_inlines.hh b/src/Rounding_Dir_inlines.hh
new file mode 100644
index 0000000..e838463
--- /dev/null
+++ b/src/Rounding_Dir_inlines.hh
@@ -0,0 +1,141 @@
+/* Inline functions operating on enum Rounding_Dir values.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Rounding_Dir_inlines_hh
+#define PPL_Rounding_Dir_inlines_hh 1
+
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+/*! \ingroup PPL_CXX_interface */
+inline Rounding_Dir
+operator&(Rounding_Dir x, Rounding_Dir y) {
+  const unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
+  return static_cast<Rounding_Dir>(res);
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Rounding_Dir
+operator|(Rounding_Dir x, Rounding_Dir y) {
+  const unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
+  return static_cast<Rounding_Dir>(res);
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline Rounding_Dir
+round_dir(Rounding_Dir dir) {
+  return dir & ROUND_DIR_MASK;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_down(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_DOWN;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_up(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_UP;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_ignore(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_IGNORE;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_not_needed(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_NOT_NEEDED;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_not_requested(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_IGNORE || round_dir(dir) == ROUND_NOT_NEEDED;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_direct(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_DIRECT;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_inverse(Rounding_Dir dir) {
+  return round_dir(dir) == ROUND_INVERSE;
+}
+
+/*! \ingroup PPL_CXX_interface */
+inline bool
+round_strict_relation(Rounding_Dir dir) {
+  return (dir & ROUND_STRICT_RELATION) == ROUND_STRICT_RELATION;
+}
+
+#if PPL_CAN_CONTROL_FPU
+
+/*! \ingroup PPL_CXX_interface */
+inline fpu_rounding_direction_type
+round_fpu_dir(Rounding_Dir dir) {
+  switch (round_dir(dir)) {
+  case ROUND_UP:
+    return static_cast<fpu_rounding_direction_type>(PPL_FPU_UPWARD);
+  case ROUND_DOWN:
+    return static_cast<fpu_rounding_direction_type>(PPL_FPU_DOWNWARD);
+  case ROUND_IGNORE: // Fall through.
+  default:
+    PPL_UNREACHABLE;
+    return static_cast<fpu_rounding_direction_type>(PPL_FPU_UPWARD);
+  }
+}
+
+#undef PPL_FPU_DOWNWARD
+#undef PPL_FPU_TONEAREST
+#undef PPL_FPU_TOWARDZERO
+#undef PPL_FPU_UPWARD
+
+#endif
+
+/*! \ingroup PPL_CXX_interface */
+inline Rounding_Dir
+inverse(Rounding_Dir dir) {
+  switch (round_dir(dir)) {
+  case ROUND_UP:
+    return ROUND_DOWN | (dir & ROUND_STRICT_RELATION);
+  case ROUND_DOWN:
+    return ROUND_UP | (dir & ROUND_STRICT_RELATION);
+  case ROUND_IGNORE:
+    return dir;
+  default:
+    PPL_UNREACHABLE;
+    return dir;
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Rounding_Dir_inlines_hh)
diff --git a/src/Scalar_Products.cc b/src/Scalar_Products.cc
index caa9ffc..b1729b0 100644
--- a/src/Scalar_Products.cc
+++ b/src/Scalar_Products.cc
@@ -1,6 +1,6 @@
 /* Scalar_Products class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,15 +22,15 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Scalar_Products.defs.hh"
-#include "Scalar_Products.inlines.hh"
-#include "Coefficient.defs.hh"
+#include "Scalar_Products_defs.hh"
+#include "Scalar_Products_inlines.hh"
+#include "Coefficient_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
 void
 PPL::Scalar_Products::assign(Coefficient& z,
-			     const Linear_Expression& x,
+                             const Linear_Expression& x,
                              const Linear_Expression& y) {
   x.scalar_product_assign(z, y);
 }
@@ -49,31 +49,30 @@ PPL::Scalar_Products::assign(Coefficient& z,
 
 void
 PPL::Scalar_Products::assign(Coefficient& z,
-			     const Grid_Generator& gg, const Congruence& cg) {
-  gg.expr.scalar_product_assign(z, cg.expression(),
-                                0, gg.space_dimension() + 1);
+                             const Grid_Generator& gg, const Congruence& cg) {
+  gg.expr.scalar_product_assign(z, cg.expr, 0, gg.space_dimension() + 1);
 }
 
 void
 PPL::Scalar_Products::assign(Coefficient& z,
-			     const Constraint& c,
-			     const Grid_Generator& gg) {
+                             const Constraint& c,
+                             const Grid_Generator& gg) {
   assign(z, c.expr, gg.expr);
 }
 
 void
 PPL::Scalar_Products::assign(Coefficient& z,
-			     const Congruence& cg, const Grid_Generator& gg) {
+                             const Congruence& cg, const Grid_Generator& gg) {
   // Scalar product is only defined if `cg' and `gg' are
   // dimension-compatible.
   PPL_ASSERT(cg.space_dimension() <= gg.space_dimension());
-  cg.expression().scalar_product_assign(z, gg.expr);
+  cg.expr.scalar_product_assign(z, gg.expr);
 }
 
 void
 PPL::Scalar_Products::reduced_assign(Coefficient& z,
-				     const Linear_Expression& x,
-				     const Linear_Expression& y) {
+                                     const Linear_Expression& x,
+                                     const Linear_Expression& y) {
   // The reduced scalar product is only defined
   // if `y' has enough coefficients.
   PPL_ASSERT(x.space_dimension() - 1 <= y.space_dimension());
@@ -82,18 +81,18 @@ PPL::Scalar_Products::reduced_assign(Coefficient& z,
 
 void
 PPL::Scalar_Products::reduced_assign(Coefficient& z,
-				     const Grid_Generator& gg,
-				     const Congruence& cg) {
-  // The reduced scalar product is only defined if the topology of `gg'
-  // is NNC and `cg' has enough coefficients.
+                                     const Grid_Generator& gg,
+                                     const Congruence& cg) {
+  // The reduced scalar product is only defined
+  // if `cg' has enough coefficients.
   PPL_ASSERT(gg.space_dimension() <= cg.space_dimension());
-  gg.expr.scalar_product_assign(z, cg.expression(), 0, gg.space_dimension());
+  gg.expr.scalar_product_assign(z, cg.expr, 0, gg.space_dimension());
 }
 
 void
 PPL::Scalar_Products::homogeneous_assign(Coefficient& z,
-					 const Linear_Expression& x,
-					 const Linear_Expression& y) {
+                                         const Linear_Expression& x,
+                                         const Linear_Expression& y) {
   // Scalar product is only defined  if `x' and `y' are
   // dimension-compatible.
   PPL_ASSERT(x.space_dimension() <= y.space_dimension());
@@ -102,19 +101,18 @@ PPL::Scalar_Products::homogeneous_assign(Coefficient& z,
 
 void
 PPL::Scalar_Products::homogeneous_assign(Coefficient& z,
-					 const Grid_Generator& gg,
-					 const Congruence& cg) {
+                                         const Grid_Generator& gg,
+                                         const Congruence& cg) {
   // Scalar product is only defined if `gg' and `cg' are
   // dimension-compatible.
   PPL_ASSERT(gg.space_dimension() <= cg.space_dimension());
-  gg.expr.scalar_product_assign(z, cg.expression(),
-                                1, gg.space_dimension() + 1);
+  gg.expr.scalar_product_assign(z, cg.expr, 1, gg.space_dimension() + 1);
 }
 
 void
 PPL::Scalar_Products::homogeneous_assign(Coefficient& z,
-					 const Grid_Generator& gg,
-					 const Constraint& c) {
+                                         const Grid_Generator& gg,
+                                         const Constraint& c) {
   // Scalar product is only defined if `gg' and `c' are
   // dimension-compatible.
   PPL_ASSERT(gg.space_dimension() <= c.space_dimension());
diff --git a/src/Scalar_Products.defs.hh b/src/Scalar_Products.defs.hh
deleted file mode 100644
index 7effccc..0000000
--- a/src/Scalar_Products.defs.hh
+++ /dev/null
@@ -1,226 +0,0 @@
-/* Scalar_Products class definition.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Scalar_Products_defs_hh
-#define PPL_Scalar_Products_defs_hh 1
-
-#include "Scalar_Products.types.hh"
-#include "Coefficient.types.hh"
-#include "Linear_Expression.types.hh"
-#include "Constraint.types.hh"
-#include "Generator.types.hh"
-#include "Congruence.types.hh"
-#include "Grid_Generator.types.hh"
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A class implementing various scalar product functions.
-/*! \ingroup PPL_CXX_interface
-  When computing the scalar product of (Linear_Expression or Constraint or
-  Generator) objects <CODE>x</CODE> and <CODE>y</CODE>, it is assumed
-  that the space dimension of the first object <CODE>x</CODE> is less
-  than or equal to the space dimension of the second object <CODE>y</CODE>.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Scalar_Products {
-public:
-  //! Computes the scalar product of \p x and \p y and assigns it to \p z.
-  static void assign(Coefficient& z,
-                     const Linear_Expression& x, const Linear_Expression& y);
-
-  //! Computes the scalar product of \p c and \p g and assigns it to \p z.
-  static void assign(Coefficient& z, const Constraint& c, const Generator& g);
-
-  //! Computes the scalar product of \p g and \p c and assigns it to \p z.
-  static void assign(Coefficient& z, const Generator& g, const Constraint& c);
-
-  //! Computes the scalar product of \p c and \p g and assigns it to \p z.
-  static void assign(Coefficient& z,
-		     const Constraint& c, const Grid_Generator& gg);
-
-  //! Computes the scalar product of \p g and \p cg and assigns it to \p z.
-  static void assign(Coefficient& z,
-		     const Grid_Generator& gg, const Congruence& cg);
-
-  //! Computes the scalar product of \p cg and \p g and assigns it to \p z.
-  static void assign(Coefficient& z,
-		     const Congruence& cg, const Grid_Generator& gg);
-
-  //! Returns the sign of the scalar product between \p x and \p y.
-  static int sign(const Linear_Expression& x, const Linear_Expression& y);
-
-  //! Returns the sign of the scalar product between \p c and \p g.
-  static int sign(const Constraint& c, const Generator& g);
-
-  //! Returns the sign of the scalar product between \p g and \p c.
-  static int sign(const Generator& g, const Constraint& c);
-
-  //! Returns the sign of the scalar product between \p c and \p g.
-  static int sign(const Constraint& c, const Grid_Generator& g);
-
-  /*! \brief
-    Computes the \e reduced scalar product of \p x and \p y,
-    where the \f$\epsilon\f$ coefficient of \p x is ignored,
-    and assigns the result to \p z.
-  */
-  static void reduced_assign(Coefficient& z,
-			     const Linear_Expression& x,
-                             const Linear_Expression& y);
-
-  /*! \brief
-    Computes the \e reduced scalar product of \p c and \p g,
-    where the \f$\epsilon\f$ coefficient of \p c is ignored,
-    and assigns the result to \p z.
-  */
-  static void reduced_assign(Coefficient& z,
-			     const Constraint& c, const Generator& g);
-
-  /*! \brief
-    Computes the \e reduced scalar product of \p g and \p c,
-    where the \f$\epsilon\f$ coefficient of \p g is ignored,
-    and assigns the result to \p z.
-  */
-  static void reduced_assign(Coefficient& z,
-			     const Generator& g, const Constraint& c);
-
-  //! \brief
-  //! Computes the \e reduced scalar product of \p g and \p cg,
-  //! where the \f$\epsilon\f$ coefficient of \p g is ignored,
-  //! and assigns the result to \p z.
-  static void reduced_assign(Coefficient& z,
-			     const Grid_Generator& gg, const Congruence& cg);
-
-  /*! \brief
-    Returns the sign of the \e reduced scalar product of \p x and \p y,
-    where the \f$\epsilon\f$ coefficient of \p x is ignored.
-  */
-  static int reduced_sign(const Linear_Expression& x,
-                          const Linear_Expression& y);
-
-  /*! \brief
-    Returns the sign of the \e reduced scalar product of \p c and \p g,
-    where the \f$\epsilon\f$ coefficient of \p c is ignored.
-  */
-  static int reduced_sign(const Constraint& c, const Generator& g);
-
-  /*! \brief
-    Returns the sign of the \e reduced scalar product of \p g and \p c,
-    where the \f$\epsilon\f$ coefficient of \p g is ignored.
-  */
-  static int reduced_sign(const Generator& g, const Constraint& c);
-
-  /*! \brief
-    Computes the \e homogeneous scalar product of \p x and \p y,
-    where the inhomogeneous terms are ignored,
-    and assigns the result to \p z.
-  */
-  static void homogeneous_assign(Coefficient& z,
-				 const Linear_Expression& x,
-                                 const Linear_Expression& y);
-  /*! \brief
-    Computes the \e homogeneous scalar product of \p e and \p g,
-    where the inhomogeneous terms are ignored,
-    and assigns the result to \p z.
-  */
-  static void homogeneous_assign(Coefficient& z,
-				 const Linear_Expression& e,
-				 const Generator& g);
-
-  //! \brief
-  //! Computes the \e homogeneous scalar product of \p gg and \p c,
-  //! where the inhomogeneous terms are ignored,
-  //! and assigns the result to \p z.
-  static void homogeneous_assign(Coefficient& z,
-				 const Grid_Generator& gg,
-                                 const Constraint& c);
-
-  //! \brief
-  //! Computes the \e homogeneous scalar product of \p g and \p cg,
-  //! where the inhomogeneous terms are ignored,
-  //! and assigns the result to \p z.
-  static void homogeneous_assign(Coefficient& z,
-				 const Grid_Generator& gg,
-                                 const Congruence& cg);
-
-  //! \brief
-  //! Computes the \e homogeneous scalar product of \p e and \p g,
-  //! where the inhomogeneous terms are ignored,
-  //! and assigns the result to \p z.
-  static void homogeneous_assign(Coefficient& z,
-				 const Linear_Expression& e,
-				 const Grid_Generator& g);
-
-  /*! \brief
-    Returns the sign of the \e homogeneous scalar product of \p x and \p y,
-    where the inhomogeneous terms are ignored.
-  */
-  static int homogeneous_sign(const Linear_Expression& x,
-                              const Linear_Expression& y);
-
-  /*! \brief
-    Returns the sign of the \e homogeneous scalar product of \p e and \p g,
-    where the inhomogeneous terms are ignored.
-  */
-  static int homogeneous_sign(const Linear_Expression& e, const Generator& g);
-
-  //! \brief
-  //! Returns the sign of the \e homogeneous scalar product of \p e and \p g,
-  //! where the inhomogeneous terms are ignored,
-  static int homogeneous_sign(const Linear_Expression& e,
-			      const Grid_Generator& g);
-
-  //! \brief
-  //! Returns the sign of the \e homogeneous scalar product of \p g and \p c,
-  //! where the inhomogeneous terms are ignored,
-  static int homogeneous_sign(const Grid_Generator& g, const Constraint& c);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Scalar product sign function object depending on topology.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Sign {
-public:
-  //! Constructs the function object according to the topology of \p c.
-  Topology_Adjusted_Scalar_Product_Sign(const Constraint& c);
-
-  //! Constructs the function object according to the topology of \p g.
-  Topology_Adjusted_Scalar_Product_Sign(const Generator& g);
-
-  //! Computes the (topology adjusted) scalar product sign of \p c and \p g.
-  int operator()(const Constraint&, const Generator&) const;
-
-  //! Computes the (topology adjusted) scalar product sign of \p g and \p c.
-  int operator()(const Generator&, const Constraint&) const;
-
-private:
-  //! The type of the scalar product sign function pointer.
-  typedef int (*SPS_type)(const Linear_Expression&, const Linear_Expression&);
-
-  //! The scalar product sign function pointer.
-  SPS_type sps_fp;
-};
-
-// NOTE: Scalar_Products.inlines.hh is NOT included here, to avoid cyclic
-// include dependencies.
-
-#endif // !defined(PPL_Scalar_Products_defs_hh)
diff --git a/src/Scalar_Products.inlines.hh b/src/Scalar_Products.inlines.hh
deleted file mode 100644
index ea69b6f..0000000
--- a/src/Scalar_Products.inlines.hh
+++ /dev/null
@@ -1,163 +0,0 @@
-/* Scalar_Products class implementation (inline functions).
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Scalar_Products_inlines_hh
-#define PPL_Scalar_Products_inlines_hh 1
-
-#include "Linear_Expression.defs.hh"
-#include "Constraint.defs.hh"
-#include "Generator.defs.hh"
-#include "Congruence.defs.hh"
-#include "Grid_Generator.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline int
-Scalar_Products::sign(const Linear_Expression& x, const Linear_Expression& y) {
-  PPL_DIRTY_TEMP_COEFFICIENT(z);
-  assign(z, x, y);
-  return sgn(z);
-}
-
-inline int
-Scalar_Products::reduced_sign(const Linear_Expression& x,
-                              const Linear_Expression& y) {
-  PPL_DIRTY_TEMP_COEFFICIENT(z);
-  reduced_assign(z, x, y);
-  return sgn(z);
-}
-
-inline int
-Scalar_Products::homogeneous_sign(const Linear_Expression& x,
-                                  const Linear_Expression& y) {
-  PPL_DIRTY_TEMP_COEFFICIENT(z);
-  homogeneous_assign(z, x, y);
-  return sgn(z);
-}
-
-inline int
-Scalar_Products::sign(const Constraint& c, const Generator& g) {
-  return sign(c.expr, g.expr);
-}
-
-inline int
-Scalar_Products::sign(const Generator& g, const Constraint& c) {
-  return sign(g.expr, c.expr);
-}
-
-inline int
-Scalar_Products::sign(const Constraint& c, const Grid_Generator& g) {
-  PPL_DIRTY_TEMP_COEFFICIENT(z);
-  assign(z, c, g);
-  return sgn(z);
-}
-
-inline int
-Scalar_Products::reduced_sign(const Constraint& c, const Generator& g) {
-  // The reduced scalar product is only defined if the topology of `c' is
-  // NNC.
-  PPL_ASSERT(!c.is_necessarily_closed());
-  return reduced_sign(c.expr, g.expr);
-}
-
-inline int
-Scalar_Products::reduced_sign(const Generator& g, const Constraint& c) {
-  // The reduced scalar product is only defined if the topology of `g' is
-  // NNC.
-  PPL_ASSERT(!c.is_necessarily_closed());
-  return reduced_sign(g.expr, c.expr);
-}
-
-inline void
-Scalar_Products::homogeneous_assign(Coefficient& z,
-				    const Linear_Expression& e,
-				    const Generator& g) {
-  homogeneous_assign(z, e, g.expr);
-}
-
-inline void
-Scalar_Products::homogeneous_assign(Coefficient& z,
-				    const Linear_Expression& e,
-				    const Grid_Generator& g) {
-  homogeneous_assign(z, e, g.expr);
-}
-
-inline int
-Scalar_Products::homogeneous_sign(const Linear_Expression& e,
-				  const Generator& g) {
-  return homogeneous_sign(e, g.expr);
-}
-
-inline int
-Scalar_Products::homogeneous_sign(const Linear_Expression& e,
-				  const Grid_Generator& g) {
-  return homogeneous_sign(e, g.expr);
-}
-
-inline int
-Scalar_Products::homogeneous_sign(const Grid_Generator& g,
-				  const Constraint& c) {
-  PPL_DIRTY_TEMP_COEFFICIENT(z);
-  homogeneous_assign(z, g, c);
-  return sgn(z);
-}
-
-inline
-Topology_Adjusted_Scalar_Product_Sign
-::Topology_Adjusted_Scalar_Product_Sign(const Constraint& c)
-  : sps_fp(c.is_necessarily_closed()
-	   ? static_cast<SPS_type>(&Scalar_Products::sign)
-	   : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
-}
-
-inline
-Topology_Adjusted_Scalar_Product_Sign
-::Topology_Adjusted_Scalar_Product_Sign(const Generator& g)
-  : sps_fp(g.is_necessarily_closed()
-	   ? static_cast<SPS_type>(&Scalar_Products::sign)
-	   : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
-}
-
-inline int
-Topology_Adjusted_Scalar_Product_Sign::operator()(const Constraint& c,
-						  const Generator& g) const {
-  PPL_ASSERT(c.space_dimension() <= g.space_dimension());
-  PPL_ASSERT(sps_fp == (c.is_necessarily_closed()
-		    ? static_cast<SPS_type>(&Scalar_Products::sign)
-		    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
-  return sps_fp(c.expr, g.expr);
-}
-
-inline int
-Topology_Adjusted_Scalar_Product_Sign::operator()(const Generator& g,
-						  const Constraint& c) const {
-  PPL_ASSERT(g.space_dimension() <= c.space_dimension());
-  PPL_ASSERT(sps_fp == (g.is_necessarily_closed()
-		    ? static_cast<SPS_type>(&Scalar_Products::sign)
-		    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
-  return sps_fp(g.expr, c.expr);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Scalar_Products_inlines_hh)
diff --git a/src/Scalar_Products.types.hh b/src/Scalar_Products.types.hh
deleted file mode 100644
index 33c5a46..0000000
--- a/src/Scalar_Products.types.hh
+++ /dev/null
@@ -1,24 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Scalar_Products_types_hh
-#define PPL_Scalar_Products_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Scalar_Products;
-class Topology_Adjusted_Scalar_Product_Sign;
-class Topology_Adjusted_Scalar_Product_Assign;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Scalar_Products_types_hh)
diff --git a/src/Scalar_Products_defs.hh b/src/Scalar_Products_defs.hh
new file mode 100644
index 0000000..9d39226
--- /dev/null
+++ b/src/Scalar_Products_defs.hh
@@ -0,0 +1,227 @@
+/* Scalar_Products class definition.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Scalar_Products_defs_hh
+#define PPL_Scalar_Products_defs_hh 1
+
+#include "Scalar_Products_types.hh"
+#include "Coefficient_types.hh"
+#include "Linear_Expression_types.hh"
+#include "Constraint_types.hh"
+#include "Generator_types.hh"
+#include "Congruence_types.hh"
+#include "Grid_Generator_types.hh"
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A class implementing various scalar product functions.
+/*! \ingroup PPL_CXX_interface
+  When computing the scalar product of (Linear_Expression or Constraint or
+  Generator) objects <CODE>x</CODE> and <CODE>y</CODE>, it is assumed
+  that the space dimension of the first object <CODE>x</CODE> is less
+  than or equal to the space dimension of the second object <CODE>y</CODE>.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Scalar_Products {
+public:
+  //! Computes the scalar product of \p x and \p y and assigns it to \p z.
+  static void assign(Coefficient& z,
+                     const Linear_Expression& x, const Linear_Expression& y);
+
+  //! Computes the scalar product of \p c and \p g and assigns it to \p z.
+  static void assign(Coefficient& z, const Constraint& c, const Generator& g);
+
+  //! Computes the scalar product of \p g and \p c and assigns it to \p z.
+  static void assign(Coefficient& z, const Generator& g, const Constraint& c);
+
+  //! Computes the scalar product of \p c and \p g and assigns it to \p z.
+  static void assign(Coefficient& z,
+                     const Constraint& c, const Grid_Generator& gg);
+
+  //! Computes the scalar product of \p g and \p cg and assigns it to \p z.
+  static void assign(Coefficient& z,
+                     const Grid_Generator& gg, const Congruence& cg);
+
+  //! Computes the scalar product of \p cg and \p g and assigns it to \p z.
+  static void assign(Coefficient& z,
+                     const Congruence& cg, const Grid_Generator& gg);
+
+  //! Returns the sign of the scalar product between \p x and \p y.
+  static int sign(const Linear_Expression& x, const Linear_Expression& y);
+
+  //! Returns the sign of the scalar product between \p c and \p g.
+  static int sign(const Constraint& c, const Generator& g);
+
+  //! Returns the sign of the scalar product between \p g and \p c.
+  static int sign(const Generator& g, const Constraint& c);
+
+  //! Returns the sign of the scalar product between \p c and \p g.
+  static int sign(const Constraint& c, const Grid_Generator& g);
+
+  /*! \brief
+    Computes the \e reduced scalar product of \p x and \p y,
+    where the \f$\epsilon\f$ coefficient of \p x is ignored,
+    and assigns the result to \p z.
+  */
+  static void reduced_assign(Coefficient& z,
+                             const Linear_Expression& x,
+                             const Linear_Expression& y);
+
+  /*! \brief
+    Computes the \e reduced scalar product of \p c and \p g,
+    where the \f$\epsilon\f$ coefficient of \p c is ignored,
+    and assigns the result to \p z.
+  */
+  static void reduced_assign(Coefficient& z,
+                             const Constraint& c, const Generator& g);
+
+  /*! \brief
+    Computes the \e reduced scalar product of \p g and \p c,
+    where the \f$\epsilon\f$ coefficient of \p g is ignored,
+    and assigns the result to \p z.
+  */
+  static void reduced_assign(Coefficient& z,
+                             const Generator& g, const Constraint& c);
+
+  //! \brief
+  //! Computes the \e reduced scalar product of \p g and \p cg,
+  //! where the \f$\epsilon\f$ coefficient of \p g is ignored,
+  //! and assigns the result to \p z.
+  static void reduced_assign(Coefficient& z,
+                             const Grid_Generator& gg, const Congruence& cg);
+
+  /*! \brief
+    Returns the sign of the \e reduced scalar product of \p x and \p y,
+    where the \f$\epsilon\f$ coefficient of \p x is ignored.
+  */
+  static int reduced_sign(const Linear_Expression& x,
+                          const Linear_Expression& y);
+
+  /*! \brief
+    Returns the sign of the \e reduced scalar product of \p c and \p g,
+    where the \f$\epsilon\f$ coefficient of \p c is ignored.
+  */
+  static int reduced_sign(const Constraint& c, const Generator& g);
+
+  /*! \brief
+    Returns the sign of the \e reduced scalar product of \p g and \p c,
+    where the \f$\epsilon\f$ coefficient of \p g is ignored.
+  */
+  static int reduced_sign(const Generator& g, const Constraint& c);
+
+  /*! \brief
+    Computes the \e homogeneous scalar product of \p x and \p y,
+    where the inhomogeneous terms are ignored,
+    and assigns the result to \p z.
+  */
+  static void homogeneous_assign(Coefficient& z,
+                                 const Linear_Expression& x,
+                                 const Linear_Expression& y);
+  /*! \brief
+    Computes the \e homogeneous scalar product of \p e and \p g,
+    where the inhomogeneous terms are ignored,
+    and assigns the result to \p z.
+  */
+  static void homogeneous_assign(Coefficient& z,
+                                 const Linear_Expression& e,
+                                 const Generator& g);
+
+  //! \brief
+  //! Computes the \e homogeneous scalar product of \p gg and \p c,
+  //! where the inhomogeneous terms are ignored,
+  //! and assigns the result to \p z.
+  static void homogeneous_assign(Coefficient& z,
+                                 const Grid_Generator& gg,
+                                 const Constraint& c);
+
+  //! \brief
+  //! Computes the \e homogeneous scalar product of \p g and \p cg,
+  //! where the inhomogeneous terms are ignored,
+  //! and assigns the result to \p z.
+  static void homogeneous_assign(Coefficient& z,
+                                 const Grid_Generator& gg,
+                                 const Congruence& cg);
+
+  //! \brief
+  //! Computes the \e homogeneous scalar product of \p e and \p g,
+  //! where the inhomogeneous terms are ignored,
+  //! and assigns the result to \p z.
+  static void homogeneous_assign(Coefficient& z,
+                                 const Linear_Expression& e,
+                                 const Grid_Generator& g);
+
+  /*! \brief
+    Returns the sign of the \e homogeneous scalar product of \p x and \p y,
+    where the inhomogeneous terms are ignored.
+  */
+  static int homogeneous_sign(const Linear_Expression& x,
+                              const Linear_Expression& y);
+
+  /*! \brief
+    Returns the sign of the \e homogeneous scalar product of \p e and \p g,
+    where the inhomogeneous terms are ignored.
+  */
+  static int homogeneous_sign(const Linear_Expression& e, const Generator& g);
+
+  //! \brief
+  //! Returns the sign of the \e homogeneous scalar product of \p e and \p g,
+  //! where the inhomogeneous terms are ignored,
+  static int homogeneous_sign(const Linear_Expression& e,
+                              const Grid_Generator& g);
+
+  //! \brief
+  //! Returns the sign of the \e homogeneous scalar product of \p g and \p c,
+  //! where the inhomogeneous terms are ignored,
+  static int homogeneous_sign(const Grid_Generator& g, const Constraint& c);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Scalar product sign function object depending on topology.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Sign {
+public:
+  //! Constructs the function object according to the topology of \p c.
+  Topology_Adjusted_Scalar_Product_Sign(const Constraint& c);
+
+  //! Constructs the function object according to the topology of \p g.
+  Topology_Adjusted_Scalar_Product_Sign(const Generator& g);
+
+  //! Computes the (topology adjusted) scalar product sign of \p c and \p g.
+  int operator()(const Constraint&, const Generator&) const;
+
+  //! Computes the (topology adjusted) scalar product sign of \p g and \p c.
+  int operator()(const Generator&, const Constraint&) const;
+
+private:
+  //! The type of the scalar product sign function pointer.
+  typedef int (* const SPS_type)(const Linear_Expression&,
+                                 const Linear_Expression&);
+
+  //! The scalar product sign function pointer.
+  SPS_type sps_fp;
+};
+
+// NOTE: Scalar_Products_inlines.hh is NOT included here, to avoid cyclic
+// include dependencies.
+
+#endif // !defined(PPL_Scalar_Products_defs_hh)
diff --git a/src/Scalar_Products_inlines.hh b/src/Scalar_Products_inlines.hh
new file mode 100644
index 0000000..3ab91af
--- /dev/null
+++ b/src/Scalar_Products_inlines.hh
@@ -0,0 +1,163 @@
+/* Scalar_Products class implementation (inline functions).
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Scalar_Products_inlines_hh
+#define PPL_Scalar_Products_inlines_hh 1
+
+#include "Linear_Expression_defs.hh"
+#include "Constraint_defs.hh"
+#include "Generator_defs.hh"
+#include "Congruence_defs.hh"
+#include "Grid_Generator_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline int
+Scalar_Products::sign(const Linear_Expression& x, const Linear_Expression& y) {
+  PPL_DIRTY_TEMP_COEFFICIENT(z);
+  assign(z, x, y);
+  return sgn(z);
+}
+
+inline int
+Scalar_Products::reduced_sign(const Linear_Expression& x,
+                              const Linear_Expression& y) {
+  PPL_DIRTY_TEMP_COEFFICIENT(z);
+  reduced_assign(z, x, y);
+  return sgn(z);
+}
+
+inline int
+Scalar_Products::homogeneous_sign(const Linear_Expression& x,
+                                  const Linear_Expression& y) {
+  PPL_DIRTY_TEMP_COEFFICIENT(z);
+  homogeneous_assign(z, x, y);
+  return sgn(z);
+}
+
+inline int
+Scalar_Products::sign(const Constraint& c, const Generator& g) {
+  return sign(c.expr, g.expr);
+}
+
+inline int
+Scalar_Products::sign(const Generator& g, const Constraint& c) {
+  return sign(g.expr, c.expr);
+}
+
+inline int
+Scalar_Products::sign(const Constraint& c, const Grid_Generator& g) {
+  PPL_DIRTY_TEMP_COEFFICIENT(z);
+  assign(z, c, g);
+  return sgn(z);
+}
+
+inline int
+Scalar_Products::reduced_sign(const Constraint& c, const Generator& g) {
+  // The reduced scalar product is only defined if the topology of `c' is
+  // NNC.
+  PPL_ASSERT(!c.is_necessarily_closed());
+  return reduced_sign(c.expr, g.expr);
+}
+
+inline int
+Scalar_Products::reduced_sign(const Generator& g, const Constraint& c) {
+  // The reduced scalar product is only defined if the topology of `g' is
+  // NNC.
+  PPL_ASSERT(!c.is_necessarily_closed());
+  return reduced_sign(g.expr, c.expr);
+}
+
+inline void
+Scalar_Products::homogeneous_assign(Coefficient& z,
+                                    const Linear_Expression& e,
+                                    const Generator& g) {
+  homogeneous_assign(z, e, g.expr);
+}
+
+inline void
+Scalar_Products::homogeneous_assign(Coefficient& z,
+                                    const Linear_Expression& e,
+                                    const Grid_Generator& g) {
+  homogeneous_assign(z, e, g.expr);
+}
+
+inline int
+Scalar_Products::homogeneous_sign(const Linear_Expression& e,
+                                  const Generator& g) {
+  return homogeneous_sign(e, g.expr);
+}
+
+inline int
+Scalar_Products::homogeneous_sign(const Linear_Expression& e,
+                                  const Grid_Generator& g) {
+  return homogeneous_sign(e, g.expr);
+}
+
+inline int
+Scalar_Products::homogeneous_sign(const Grid_Generator& g,
+                                  const Constraint& c) {
+  PPL_DIRTY_TEMP_COEFFICIENT(z);
+  homogeneous_assign(z, g, c);
+  return sgn(z);
+}
+
+inline
+Topology_Adjusted_Scalar_Product_Sign
+::Topology_Adjusted_Scalar_Product_Sign(const Constraint& c)
+  : sps_fp(c.is_necessarily_closed()
+           ? static_cast<SPS_type>(&Scalar_Products::sign)
+           : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
+}
+
+inline
+Topology_Adjusted_Scalar_Product_Sign
+::Topology_Adjusted_Scalar_Product_Sign(const Generator& g)
+  : sps_fp(g.is_necessarily_closed()
+           ? static_cast<SPS_type>(&Scalar_Products::sign)
+           : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
+}
+
+inline int
+Topology_Adjusted_Scalar_Product_Sign::operator()(const Constraint& c,
+                                                  const Generator& g) const {
+  PPL_ASSERT(c.space_dimension() <= g.space_dimension());
+  PPL_ASSERT(sps_fp == (c.is_necessarily_closed()
+                    ? static_cast<SPS_type>(&Scalar_Products::sign)
+                    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
+  return sps_fp(c.expr, g.expr);
+}
+
+inline int
+Topology_Adjusted_Scalar_Product_Sign::operator()(const Generator& g,
+                                                  const Constraint& c) const {
+  PPL_ASSERT(g.space_dimension() <= c.space_dimension());
+  PPL_ASSERT(sps_fp == (g.is_necessarily_closed()
+                    ? static_cast<SPS_type>(&Scalar_Products::sign)
+                    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
+  return sps_fp(g.expr, c.expr);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Scalar_Products_inlines_hh)
diff --git a/src/Scalar_Products_types.hh b/src/Scalar_Products_types.hh
new file mode 100644
index 0000000..4003f37
--- /dev/null
+++ b/src/Scalar_Products_types.hh
@@ -0,0 +1,24 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Scalar_Products_types_hh
+#define PPL_Scalar_Products_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Scalar_Products;
+class Topology_Adjusted_Scalar_Product_Sign;
+class Topology_Adjusted_Scalar_Product_Assign;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Scalar_Products_types_hh)
diff --git a/src/Slow_Copy.hh b/src/Slow_Copy.hh
index e381252..e618f8f 100644
--- a/src/Slow_Copy.hh
+++ b/src/Slow_Copy.hh
@@ -1,6 +1,6 @@
 /* Basic Slow_Copy classes declarations.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/Sparse_Row.cc b/src/Sparse_Row.cc
index e9fb379..6edee27 100644
--- a/src/Sparse_Row.cc
+++ b/src/Sparse_Row.cc
@@ -1,6 +1,6 @@
 /* Sparse_Row class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Sparse_Row.defs.hh"
-#include "Dense_Row.defs.hh"
+#include "Sparse_Row_defs.hh"
+#include "Dense_Row_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
@@ -153,7 +153,8 @@ PPL::Sparse_Row::swap_coefficients(dimension_type i, dimension_type j) {
       tree.erase(itr_j);
       itr_i = tree.insert(i);
       swap(*itr_i, tmp);
-    } else {
+    }
+    else {
       // Do nothing, elements are both non-stored zeroes.
     }
 }
@@ -279,7 +280,8 @@ private:
     if (i == i_end) {
       if (j == j_end) {
         return;
-      } else {
+      }
+      else {
         // i == i_end, j != j_end, so use j.
         current_index = j.index();
         current_value = *j;
@@ -287,7 +289,8 @@ private:
         from_i = false;
         from_j = true;
       }
-    } else {
+    }
+    else {
       if (j == j_end) {
         // i != i_end, j == j_end, so use i.
         current_index = i.index();
@@ -295,7 +298,8 @@ private:
         current_value *= coeff1;
         from_i = true;
         from_j = false;
-      } else {
+      }
+      else {
         // i != i_end and j != j_end.
         if (i.index() < j.index()) {
           // i.index() < j.index(), so use i.
@@ -304,7 +308,8 @@ private:
           current_value *= coeff1;
           from_i = true;
           from_j = false;
-        } else {
+        }
+        else {
           if (i.index() != j.index()) {
             PPL_ASSERT(i.index() > j.index());
             // i.index() > j.index(), so use j.
@@ -313,7 +318,8 @@ private:
             current_value *= coeff2;
             from_i = false;
             from_j = true;
-          } else {
+          }
+          else {
             // i.index() == j.index(), so use both i and j.
             current_index = i.index();
             current_value = *i;
@@ -378,12 +384,14 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
           ++j;
           if (i == i_end)
             break;
-        } else
+        }
+        else
           if (i.index() < j.index()) {
             i = lower_bound(i, j.index());
             if (i == i_end)
               break;
-          } else {
+          }
+          else {
             PPL_ASSERT(i.index() > j.index());
             ++counter;
             ++j;
@@ -415,11 +423,13 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
         else
           ++i;
         ++j;
-      } else
+      }
+      else
         if (i.index() < j.index()) {
           (*i) *= coeff1;
           ++i;
-        } else {
+        }
+        else {
           PPL_ASSERT(i.index() > j.index());
           i = insert(i, j.index(), *j);
           (*i) *= coeff2;
@@ -434,7 +444,8 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
       i = insert(i, j.index(), *j);
       (*i) *= coeff2;
     }
-  } else {
+  }
+  else {
     // Too many insertions needed, a full copy is probably faster than
     // inserting all those new elements into *this.
     CO_Tree new_tree(sparse_row_linear_combine_helper_iterator(*this, y,
@@ -454,7 +465,8 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
 #endif
         i = reset(i);
         PPL_ASSERT(find(old_index) == end());
-      } else
+      }
+      else
         ++i;
     }
   }
@@ -524,11 +536,13 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
         else
           ++i;
         ++j;
-      } else
+      }
+      else
         if (i.index() < j.index()) {
           (*i) *= coeff1;
           ++i;
-        } else {
+        }
+        else {
           PPL_ASSERT(i.index() > j.index());
           i = insert(i, j.index(), *j);
           ++i;
@@ -561,11 +575,13 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
         else
           ++i;
         ++j;
-      } else
+      }
+      else
         if (i.index() < j.index()) {
           (*i) *= coeff1;
           ++i;
-        } else {
+        }
+        else {
           PPL_ASSERT(i.index() > j.index());
           i = insert(i, j.index(), *j);
           neg_assign(*i);
@@ -599,11 +615,13 @@ PPL::Sparse_Row::linear_combine(const Sparse_Row& y,
       else
         ++i;
       ++j;
-    } else
+    }
+    else
       if (i.index() < j.index()) {
         (*i) *= coeff1;
         ++i;
-      } else {
+      }
+      else {
         PPL_ASSERT(i.index() > j.index());
         i = insert(i, j.index(), *j);
         (*i) *= coeff2;
@@ -696,12 +714,14 @@ PPL::operator==(const Sparse_Row& x, const Sparse_Row& y) {
         return false;
       ++i;
       ++j;
-    } else {
+    }
+    else {
       if (i.index() < j.index()) {
         if (*i != 0)
           return false;
         ++i;
-      } else {
+      }
+      else {
         PPL_ASSERT(i.index() > j.index());
         if (*j != 0)
           return false;
@@ -734,7 +754,8 @@ PPL::operator==(const Dense_Row& x, const Sparse_Row& y) {
     if (itr != y.end() && itr.index() == i) {
       if (x[i] != *itr)
         return false;
-    } else {
+    }
+    else {
       if (x[i] != 0)
         return false;
     }
@@ -775,7 +796,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
       itr = x.insert(itr, i, y[i]);
       (*itr) *= coeff2;
       PPL_ASSERT((*itr) != 0);
-    } else {
+    }
+    else {
       PPL_ASSERT(itr.index() == i);
       (*itr) *= coeff1;
       add_mul_assign(*itr, y[i], coeff2);
@@ -810,7 +832,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
             continue;
           itr = x.insert(itr, i, y[i]);
           PPL_ASSERT((*itr) != 0);
-        } else {
+        }
+        else {
           PPL_ASSERT(itr.index() == i);
           (*itr) += y[i];
           if (*itr == 0)
@@ -831,7 +854,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
           itr = x.insert(itr, i, y[i]);
           neg_assign(*itr);
           PPL_ASSERT((*itr) != 0);
-        } else {
+        }
+        else {
           PPL_ASSERT(itr.index() == i);
           (*itr) -= y[i];
           if (*itr == 0)
@@ -851,7 +875,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
         itr = x.insert(itr, i, y[i]);
         (*itr) *= coeff2;
         PPL_ASSERT((*itr) != 0);
-      } else {
+      }
+      else {
         PPL_ASSERT(itr.index() == i);
         add_mul_assign(*itr, y[i], coeff2);
         if (*itr == 0)
@@ -872,7 +897,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
           continue;
         itr = x.insert(itr, i, y[i]);
         PPL_ASSERT((*itr) != 0);
-      } else {
+      }
+      else {
         PPL_ASSERT(itr.index() == i);
         (*itr) *= coeff1;
         (*itr) += y[i];
@@ -894,7 +920,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
         itr = x.insert(itr, i, y[i]);
         neg_assign(*itr);
         PPL_ASSERT((*itr) != 0);
-      } else {
+      }
+      else {
         PPL_ASSERT(itr.index() == i);
         (*itr) *= coeff1;
         (*itr) -= y[i];
@@ -916,7 +943,8 @@ PPL::linear_combine(Sparse_Row& x, const Dense_Row& y,
       itr = x.insert(itr, i, y[i]);
       (*itr) *= coeff2;
       PPL_ASSERT((*itr) != 0);
-    } else {
+    }
+    else {
       PPL_ASSERT(itr.index() == i);
       (*itr) *= coeff1;
       add_mul_assign(*itr, y[i], coeff2);
diff --git a/src/Sparse_Row.defs.hh b/src/Sparse_Row.defs.hh
deleted file mode 100644
index a089627..0000000
--- a/src/Sparse_Row.defs.hh
+++ /dev/null
@@ -1,930 +0,0 @@
-/* Sparse_Row class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Sparse_Row_defs_hh
-#define PPL_Sparse_Row_defs_hh 1
-
-#include "Sparse_Row.types.hh"
-
-#include "CO_Tree.defs.hh"
-#include "Coefficient.defs.hh"
-#include "Dense_Row.types.hh"
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A finite sparse sequence of coefficients.
-/*! \ingroup PPL_CXX_interface
-  This class is implemented using a CO_Tree. See the documentation of CO_Tree
-  for details on the implementation and the performance.
-
-  This class is a drop-in replacement of Dense_Row, meaning that code
-  using Dense_Row can be ported to Sparse_Row changing only the type.
-  The resulting code will work, but probably needs more CPU and memory (it
-  does not exploit the sparse representation yet).
-
-  To take advantage of the sparse representation, the client code must then be
-  modified to use methods which can have a faster implementation on sparse
-  data structures.
-
-  The main changes are the replacement of calls to operator[] with calls to
-  find(), lower_bound() or insert(), using hint iterators when possible.
-  Sequential scanning of rows should probably be implemented using iterators
-  rather than indexes, to improve performance.
-  reset() should be called to zero elements.
-
-  \see Sparse_Matrix
-  \see CO_Tree
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-class Parma_Polyhedra_Library::Sparse_Row {
-
-public:
-
-  //! An %iterator on the row elements
-  /*!
-    This %iterator skips non-stored zeroes.
-    \see CO_Tree::iterator
-  */
-  typedef CO_Tree::iterator iterator;
-
-  //! A const %iterator on the row elements
-  /*!
-    This %iterator skips non-stored zeroes.
-    \see CO_Tree::const_iterator
-  */
-  typedef CO_Tree::const_iterator const_iterator;
-
-  //! Constructs a row with the specified size.
-  /*!
-    \param n
-    The size for the new row.
-
-    The row will contain only non-stored zeroes.
-
-    This constructor takes \f$O(1)\f$ time.
-  */
-  explicit Sparse_Row(dimension_type n = 0);
-
-  //! Constructs a row with the specified size.
-  /*!
-    \param n
-    The size for the new row.
-
-    \param capacity
-    It is ignored. This parameter is needed for compatibility with Dense_Row.
-
-    The row will contain only non-stored zeroes.
-
-    This constructor takes \f$O(1)\f$ time.
-  */
-  Sparse_Row(dimension_type n, dimension_type capacity);
-
-  //! Copy constructor with specified capacity.
-  /*!
-    It is assumed that \p capacity is greater than or equal to
-    the size of \p y.
-  */
-  Sparse_Row(const Sparse_Row& y, dimension_type capacity);
-
-  //! Copy constructor with specified size and capacity.
-  /*!
-    It is assumed that \p sz is less than or equal to \p capacity.
-  */
-  Sparse_Row(const Sparse_Row& y, dimension_type sz, dimension_type capacity);
-
-  //! Constructor from a Dense_Row.
-  /*!
-    \param row
-    The row that will be copied into *this.
-
-    This constructor takes \f$O(n)\f$ time. Note that constructing of a row of
-    zeroes and then inserting n elements costs \f$O(n*\log^2 n)\f$ time.
-  */
-  explicit Sparse_Row(const Dense_Row& row);
-
-  //! Copy constructor from a Dense_Row with specified size and capacity.
-  /*!
-    It is assumed that \p sz is less than or equal to \p capacity.
-  */
-  Sparse_Row(const Dense_Row& y, dimension_type sz, dimension_type capacity);
-
-  Sparse_Row& operator=(const Dense_Row& row);
-
-  //! Swaps *this and x.
-  /*!
-    \param x
-    The row that will be swapped with *this.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void m_swap(Sparse_Row& x);
-
-  //! Returns the size of the row.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  dimension_type size() const;
-
-  //! Returns the number of elements explicitly stored in the row.
-  /*!
-    This is equivalent to std::distance(begin(), end()), but it's much faster.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  dimension_type num_stored_elements() const;
-
-  //! Resizes the row to the specified size.
-  /*!
-    \param n
-    The new size for the row.
-
-    This method takes \f$O(k*\log^2 n)\f$ amortized time when shrinking the
-    row and removing the trailing k elements.
-    It takes \f$O(1)\f$ time when enlarging the row.
-  */
-  void resize(dimension_type n);
-
-  //! Resizes the row to size \p n.
-  /*!
-    \param n
-    The new size for the row.
-
-    This method, with this signature, is needed for compatibility with
-    Dense_Row.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void expand_within_capacity(dimension_type n);
-
-  //! Resizes the row to size \p n.
-  /*!
-    \param n
-    The new size for the row.
-
-    This method, with this signature, is needed for compatibility with
-    Dense_Row.
-
-    This method takes \f$O(k*\log^2 n)\f$ amortized time where k is the number
-    of removed elements.
-  */
-  void shrink(dimension_type n);
-
-  /*!
-    \brief Deletes the i-th element from the row, shifting the next elements
-           to the left.
-
-    \param i
-    The index of the element that will be deleted.
-
-    The size of the row is decreased by 1.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(k+\log^2 n)\f$ amortized time, where k is the
-    number of elements with index greater than i.
-  */
-  void delete_element_and_shift(dimension_type i);
-
-  //! Adds \p n zeroes before index \p i.
-  /*!
-    \param n
-    The number of non-stored zeroes that will be added to the row.
-
-    \param i
-    The index of the element before which the zeroes will be added.
-
-    Existing elements with index greater than or equal to \p i are shifted to
-    the right by \p n positions. The size is increased by \p n.
-
-    Existing iterators are not invalidated, but are shifted to the right
-    by \p n if they pointed at or after index \p i (i.e., they point to
-    the same, possibly shifted, values as before).
-
-    This method takes \f$O(k + \log m)\f$ expected time, where \f$k\f$ is
-    the number of elements with index greater than or equal to \p i and
-    \f$m\f$ the number of stored elements.
-  */
-  void add_zeroes_and_shift(dimension_type n, dimension_type i);
-
-  //! Returns an %iterator that points at the first stored element.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  iterator begin();
-
-  //! Returns an %iterator that points after the last stored element.
-  /*!
-    This method always returns a reference to the same internal %iterator,
-    that is kept valid.
-    Client code can keep a const reference to that %iterator instead of
-    keep updating a local %iterator.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  const iterator& end();
-
-  //! Equivalent to <CODE>cbegin()</CODE>.
-  const_iterator begin() const;
-
-  //! Equivalent to <CODE>cend()</CODE>.
-  const const_iterator& end() const;
-
-  //! Returns an %iterator that points at the first element.
-  /*!
-    This method takes \f$O(1)\f$ time.
-  */
-  const_iterator cbegin() const;
-
-  //! Returns an %iterator that points after the last element.
-  /*!
-    This method always returns a reference to the same internal %iterator,
-    that is updated at each operation that modifies the structure.
-    Client code can keep a const reference to that %iterator instead of
-    keep updating a local %iterator.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  const const_iterator& cend() const;
-
-  //! Returns the size() of the largest possible Sparse_Row.
-  static dimension_type max_size();
-
-  //! Resets all the elements of this row.
-  /*!
-    This method takes \f$O(n)\f$ time.
-  */
-  void clear();
-
-  //! Gets a reference to the i-th element.
-  /*!
-    \param i
-    The index of the desired element.
-
-    For read-only access it's better to use get(), that avoids allocating
-    space for zeroes.
-
-    If possible, use the insert(), find() or lower_bound() methods with
-    a hint instead of this, to improve performance.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log n)\f$ amortized time when there is already an
-    element with index \p i, and \f$O(\log^2 n)\f$ otherwise.
-  */
-  Coefficient& operator[](dimension_type i);
-
-  //! Equivalent to <CODE>get(i)</CODE>, provided for convenience.
-  /*!
-    This method takes \f$O(\log n)\f$ time.
-  */
-  Coefficient_traits::const_reference operator[](dimension_type i) const;
-
-  //! Gets the i-th element in the sequence.
-  /*!
-    \param i
-    The index of the desired element.
-
-    If possible, use the insert(), find() or lower_bound() methods with
-    a hint instead of this, to improve performance.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  //! Looks for an element with index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    If possible, use the find() method that takes a hint %iterator, to improve
-    performance.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  iterator find(dimension_type i);
-
-  //! Looks for an element with index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param itr
-    It is used as a hint. This method will be faster if the searched element
-    is near to \p itr.
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this row. \p itr may even be end().
-
-    This method takes \f$O(\log n)\f$ time.
-    If the distance between \p itr and the searched position is \f$O(1)\f$,
-    this method takes \f$O(1)\f$ time.
-  */
-  iterator find(iterator itr, dimension_type i);
-
-  //! Looks for an element with index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    If possible, use the find() method that takes a hint %iterator, to improve
-    performance.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  const_iterator find(dimension_type i) const;
-
-  //! Looks for an element with index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param itr
-    It is used as a hint. This method will be faster if the searched element
-    is near to \p itr.
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this row. \p itr may even be end().
-
-    This method takes \f$O(\log n)\f$ time.
-    If the distance between \p itr and the searched position is \f$O(1)\f$,
-    this method takes \f$O(1)\f$ time.
-  */
-  const_iterator find(const_iterator itr, dimension_type i) const;
-
-  //! Lower bound of index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \returns an %iterator to the first element with index greater than or
-             equal to i.
-             If there are no such elements, returns end().
-
-    If possible, use the find() method that takes a hint %iterator, to improve
-    performance.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  iterator lower_bound(dimension_type i);
-
-  //! Lower bound of index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param itr
-    It is used as a hint. This method will be faster if the searched element
-    is near to \p itr.
-
-    \returns an %iterator to the first element with index greater than or
-             equal to i.
-             If there are no such elements, returns end().
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this row. \p itr may even be end().
-
-    This method takes \f$O(\log n)\f$ time.
-    If the distance between \p itr and the searched position is \f$O(1)\f$,
-    this method takes \f$O(1)\f$ time.
-  */
-  iterator lower_bound(iterator itr, dimension_type i);
-
-  //! Lower bound of index i.
-  /*!
-
-    \param i
-    The index of the desired element.
-
-    \returns an %iterator to the first element with index greater than or
-             equal to i.
-             If there are no such elements, returns end().
-
-    If possible, use the find() method that takes a hint %iterator, to improve
-    performance.
-
-    This method takes \f$O(\log n)\f$ time.
-  */
-  const_iterator lower_bound(dimension_type i) const;
-
-  //! Lower bound of index i.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param itr
-    It is used as a hint. This method will be faster if the searched element
-    is near to \p itr.
-
-    \returns an %iterator to the first element with index greater than or
-             equal to i.
-             If there are no such elements, returns end().
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this row. \p itr may even be end().
-
-    This method takes \f$O(\log n)\f$ time.
-    If the distance between \p itr and the searched position is \f$O(1)\f$,
-    this method takes \f$O(1)\f$ time.
-  */
-  const_iterator lower_bound(const_iterator itr, dimension_type i) const;
-
-  //! Equivalent to <CODE>(*this)[i] = x; find(i)</CODE>, but faster.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param x
-    The value that will be associated to the element.
-
-    If possible, use versions of this method that take a hint, to improve
-    performance.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  iterator insert(dimension_type i, Coefficient_traits::const_reference x);
-
-  //! Equivalent to <CODE>(*this)[i] = x; find(i)</CODE>, but faster.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param x
-    The value that will be associated to the element.
-
-    \param itr
-    It is used as a hint. This method will be faster if the searched element
-    is near to \p itr, even faster than <CODE>(*this)[i] = x</CODE>.
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this row. \p itr may even be end().
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time. If the distance
-    between \p itr and the searched position is \f$O(1)\f$ and the row already
-    contains an element with this index, this method takes \f$O(1)\f$ time.
-  */
-  iterator insert(iterator itr, dimension_type i,
-                  Coefficient_traits::const_reference x);
-
-  //! Equivalent to <CODE>(*this)[i]; find(i)</CODE>, but faster.
-  /*!
-    \param i
-    The index of the desired element.
-
-    If possible, use versions of this method that take a hint, to improve
-    performance.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  iterator insert(dimension_type i);
-
-  //! Equivalent to <CODE>(*this)[i]; find(i)</CODE>, but faster.
-  /*!
-    \param i
-    The index of the desired element.
-
-    \param itr
-    It is used as a hint. This method will be faster if the searched element
-    is near to \p itr, even faster than <CODE>(*this)[i]</CODE>.
-
-    The value of \p itr does not affect the result of this method, as long it
-    is a valid %iterator for this row. \p itr may even be end().
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time. If the distance
-    between \p itr and the searched position is \f$O(1)\f$ and the row already
-    contains an element with this index, this method takes \f$O(1)\f$ time.
-  */
-  iterator insert(iterator itr, dimension_type i);
-
-  //! Swaps the i-th element with the j-th element.
-  /*!
-    \param i
-    The index of an element.
-
-    \param j
-    The index of another element.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  void swap_coefficients(dimension_type i, dimension_type j);
-
-  //! Equivalent to swap(i,itr.index()), but it assumes that
-  //! lower_bound(i)==itr.
-  /*!
-    Iterators that pointed to the itr.index()-th element remain valid
-    but now point to the i-th element. Other iterators are unaffected.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void fast_swap(dimension_type i, iterator itr);
-
-  //! Swaps the element pointed to by i with the element pointed to by j.
-  /*!
-    \param i
-    An %iterator pointing to an element.
-
-    \param j
-    An %iterator pointing to another element.
-
-    This method takes \f$O(1)\f$ time.
-  */
-  void swap_coefficients(iterator i, iterator j);
-
-  //! Resets to zero the value pointed to by i.
-  /*!
-    \param i
-    An %iterator pointing to the element that will be reset (not stored
-    anymore).
-
-    By calling this method instead of getting a reference to the value and
-    setting it to zero, the element will no longer be stored.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  iterator reset(iterator i);
-
-  //! Resets to zero the values in the range [first,last).
-  /*!
-    \param first
-    An %iterator pointing to the first element to reset.
-
-    \param last
-    An %iterator pointing after the last element to reset.
-
-    By calling this method instead of getting a reference to the values and
-    setting them to zero, the elements will no longer be stored.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(k*\log^2 n)\f$ amortized time, where k is the
-    number of elements in [first,last).
-  */
-  iterator reset(iterator first, iterator last);
-
-  //! Resets to zero the i-th element.
-  /*!
-    \param i
-    The index of the element to reset.
-
-    By calling this method instead of getting a reference to the value and
-    setting it to zero, the element will no longer be stored.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(\log^2 n)\f$ amortized time.
-  */
-  void reset(dimension_type i);
-
-  //! Resets to zero the elements with index greater than or equal to i.
-  /*!
-    \param i
-    The index of the first element to reset.
-
-    By calling this method instead of getting a reference to the values and
-    setting them to zero, the elements will no longer be stored.
-
-    This operation invalidates existing iterators.
-
-    This method takes \f$O(k*\log^2 n)\f$ amortized time, where k is the
-    number of elements with index greater than or equal to i.
-  */
-  void reset_after(dimension_type i);
-
-  //! Normalizes the modulo of coefficients so that they are mutually prime.
-  /*!
-    Computes the Greatest Common Divisor (GCD) among the elements of the row
-    and normalizes them by the GCD itself.
-
-    This method takes \f$O(n)\f$ time.
-  */
-  void normalize();
-
-  //! Calls g(x[i],y[i]), for each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param f
-    A functor that should take a Coefficient&.
-    f(c1) must be equivalent to g(c1, 0).
-
-    \param g
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    g(c1, c2) must do nothing when c1 is zero.
-
-    This method takes \f$O(n*\log^2 n)\f$ time.
-
-    \note
-    The functors will only be called when necessary, assuming the requested
-    properties hold.
-
-    \see combine_needs_second
-    \see combine
-  */
-  template <typename Func1, typename Func2>
-  void combine_needs_first(const Sparse_Row& y,
-                           const Func1& f, const Func2& g);
-
-  //! Calls g(x[i],y[i]), for each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param g
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    g(c1, 0) must do nothing, for every c1.
-
-    \param h
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
-
-    This method takes \f$O(n*\log^2 n)\f$ time.
-
-    \note
-    The functors will only be called when necessary, assuming the requested
-    properties hold.
-
-    \see combine_needs_first
-    \see combine
-  */
-  template <typename Func1, typename Func2>
-  void combine_needs_second(const Sparse_Row& y,
-                            const Func1& g, const Func2& h);
-
-  //! Calls g(x[i],y[i]), for each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param f
-    A functor that should take a Coefficient&.
-    f(c1) must be equivalent to g(c1, 0).
-
-    \param g
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    g(c1, c2) must do nothing when both c1 and c2 are zero.
-
-    \param h
-    A functor that should take a Coefficient& and a
-    Coefficient_traits::const_reference.
-    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
-
-    This method takes \f$O(n*\log^2 n)\f$ time.
-
-    \note
-    The functors will only be called when necessary, assuming the requested
-    properties hold.
-
-    \see combine_needs_first
-    \see combine_needs_second
-  */
-  template <typename Func1, typename Func2, typename Func3>
-  void combine(const Sparse_Row& y,
-               const Func1& f, const Func2& g, const Func3& h);
-
-  //! Executes <CODE>(*this)[i] = (*this)[i]*coeff1 + y[i]*coeff2</CODE>, for
-  //! each i.
-  /*!
-    \param y
-    The row that will be combined with *this.
-
-    \param coeff1
-    The coefficient used for elements of *this.
-    This must not be 0.
-
-    \param coeff2
-    The coefficient used for elements of y.
-    This must not be 0.
-
-    This method takes \f$O(n*\log^2 n)\f$ time.
-
-    \note
-    The functors will only be called when necessary.
-    This method can be implemented in user code, too. It is provided for
-    convenience only.
-
-    \see combine_needs_first
-    \see combine_needs_second
-    \see combine
-  */
-  void linear_combine(const Sparse_Row& y,
-                      Coefficient_traits::const_reference coeff1,
-                      Coefficient_traits::const_reference coeff2);
-
-  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
-  //! for each i in [start, end).
-  /*!
-    This method, unlike the other linear_combine() method, detects when
-    coeff1==1 and/or coeff2==1 or coeff2==-1 in order to save some work.
-  */
-  void linear_combine(const Sparse_Row& y,
-                      Coefficient_traits::const_reference c1,
-                      Coefficient_traits::const_reference c2,
-                      dimension_type start, dimension_type end);
-
-  PPL_OUTPUT_DECLARATIONS
-
-  //! Loads the row from an ASCII representation generated using ascii_dump().
-  /*!
-    \param s
-    The stream from which the ASCII representation will be loaded.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  /*!
-    This method takes \f$O(n)\f$ time.
-  */
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  /*!
-    This method is provided for compatibility with Dense_Row.
-
-    This method takes \f$O(n)\f$ time.
-
-    \param capacity
-    This parameter is ignored.
-  */
-  memory_size_type external_memory_in_bytes(dimension_type capacity) const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  /*!
-    This method takes \f$O(n)\f$ time.
-  */
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  /*!
-    This method is provided for compatibility with Dense_Row.
-
-    This method takes \f$O(n)\f$ time.
-
-    \param capacity
-    This parameter is ignored.
-  */
-  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
-
-  //! Checks the invariant.
-  bool OK() const;
-
-  //! Checks the invariant.
-  /*!
-    This method is provided for compatibility with Dense_Row.
-
-    \param capacity
-    This parameter is ignored.
-  */
-  bool OK(dimension_type capacity) const;
-
-private:
-  //! The tree used to store the elements.
-  CO_Tree tree;
-
-  //! The size of the row.
-  /*!
-    The elements contained in this row have indexes that are less than size_.
-  */
-  dimension_type size_;
-};
-
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(Parma_Polyhedra_Library::Sparse_Row& x,
-          Parma_Polyhedra_Library::Sparse_Row& y);
-
-void swap(Parma_Polyhedra_Library::Sparse_Row& x,
-          Parma_Polyhedra_Library::Dense_Row& y);
-
-void swap(Parma_Polyhedra_Library::Dense_Row& x,
-          Parma_Polyhedra_Library::Sparse_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator==(const Sparse_Row& x, const Sparse_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool operator!=(const Sparse_Row& x, const Sparse_Row& y);
-
-bool operator==(const Dense_Row& x, const Sparse_Row& y);
-bool operator!=(const Dense_Row& x, const Sparse_Row& y);
-
-bool operator==(const Sparse_Row& x, const Dense_Row& y);
-bool operator!=(const Sparse_Row& x, const Dense_Row& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Sparse_Row& x, const Dense_Row& y,
-                    Coefficient_traits::const_reference coeff1,
-                    Coefficient_traits::const_reference coeff2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Sparse_Row
-  This function detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
-  order to save some work.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Sparse_Row& x, const Dense_Row& y,
-                    Coefficient_traits::const_reference c1,
-                    Coefficient_traits::const_reference c2,
-                    dimension_type start, dimension_type end);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Dense_Row& x, const Sparse_Row& y,
-                    Coefficient_traits::const_reference coeff1,
-                    Coefficient_traits::const_reference coeff2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Sparse_Row
-  This function detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
-  order to save some work.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Dense_Row& x, const Sparse_Row& y,
-                    Coefficient_traits::const_reference c1,
-                    Coefficient_traits::const_reference c2,
-                    dimension_type start, dimension_type end);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Sparse_Row& x, const Sparse_Row& y,
-                    Coefficient_traits::const_reference coeff1,
-                    Coefficient_traits::const_reference coeff2);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
-//! for each i in [start, end).
-/*! \relates Sparse_Row
-  This function detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
-  order to save some work.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void linear_combine(Sparse_Row& x, const Sparse_Row& y,
-                    Coefficient_traits::const_reference c1,
-                    Coefficient_traits::const_reference c2,
-                    dimension_type start, dimension_type end);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Sparse_Row.inlines.hh"
-#include "Sparse_Row.templates.hh"
-
-#endif // !defined(PPL_Sparse_Row_defs_hh)
diff --git a/src/Sparse_Row.inlines.hh b/src/Sparse_Row.inlines.hh
deleted file mode 100644
index 83d9d7a..0000000
--- a/src/Sparse_Row.inlines.hh
+++ /dev/null
@@ -1,378 +0,0 @@
-/* Sparse_Row class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Sparse_Row_inlines_hh
-#define PPL_Sparse_Row_inlines_hh 1
-
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Sparse_Row::Sparse_Row(dimension_type n)
-  : size_(n) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Sparse_Row::Sparse_Row(dimension_type n, dimension_type)
-  : size_(n) {
-  PPL_ASSERT(OK());
-}
-
-inline
-Sparse_Row::Sparse_Row(const Sparse_Row& y, dimension_type)
-  : tree(y.tree), size_(y.size_) {
-}
-
-inline
-Sparse_Row::Sparse_Row(const Sparse_Row& y, dimension_type sz, dimension_type)
-  : tree(y.begin(),
-         std::distance(y.begin(), y.lower_bound(std::min(y.size(), sz)))),
-    size_(sz) {
-  PPL_ASSERT(OK());
-}
-
-inline void
-Sparse_Row::m_swap(Sparse_Row& x) {
-  using std::swap;
-  swap(tree, x.tree);
-  swap(size_, x.size_);
-  PPL_ASSERT(OK());
-  PPL_ASSERT(x.OK());
-}
-
-inline dimension_type
-Sparse_Row::size() const {
-  return size_;
-}
-
-inline dimension_type
-Sparse_Row::num_stored_elements() const {
-  return tree.size();
-}
-
-inline void
-Sparse_Row::resize(dimension_type n) {
-  if (n < size_)
-    reset_after(n);
-  size_ = n;
-  PPL_ASSERT(OK());
-}
-
-inline void
-Sparse_Row::shrink(dimension_type n) {
-  PPL_ASSERT(size() >= n);
-  resize(n);
-}
-
-inline void
-Sparse_Row::expand_within_capacity(dimension_type n) {
-  PPL_ASSERT(size() <= n);
-  resize(n);
-}
-
-inline void
-Sparse_Row::delete_element_and_shift(dimension_type i) {
-  PPL_ASSERT(i < size_);
-  tree.erase_element_and_shift_left(i);
-  --size_;
-  PPL_ASSERT(OK());
-}
-
-inline void
-Sparse_Row::add_zeroes_and_shift(dimension_type n, dimension_type i) {
-  PPL_ASSERT(i <= size_);
-  tree.increase_keys_from(i, n);
-  size_ += n;
-  PPL_ASSERT(OK());
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::begin() {
-  return tree.begin();
-}
-
-inline const Sparse_Row::iterator&
-Sparse_Row::end() {
-  return tree.end();
-}
-
-inline Sparse_Row::const_iterator
-Sparse_Row::begin() const {
-  return tree.cbegin();
-}
-
-inline const Sparse_Row::const_iterator&
-Sparse_Row::end() const {
-  return tree.cend();
-}
-
-inline Sparse_Row::const_iterator
-Sparse_Row::cbegin() const {
-  return tree.cbegin();
-}
-
-inline const Sparse_Row::const_iterator&
-Sparse_Row::cend() const {
-  return tree.cend();
-}
-
-inline dimension_type
-Sparse_Row::max_size() {
-  return CO_Tree::max_size();
-}
-
-inline void
-Sparse_Row::clear() {
-  tree.clear();
-}
-
-inline Coefficient&
-Sparse_Row::operator[](dimension_type i) {
-  PPL_ASSERT(i < size_);
-  iterator itr = insert(i);
-  return *itr;
-}
-
-inline Coefficient_traits::const_reference
-Sparse_Row::operator[](dimension_type i) const {
-  return get(i);
-}
-
-inline Coefficient_traits::const_reference
-Sparse_Row::get(dimension_type i) const {
-  PPL_ASSERT(i < size_);
-  if (tree.empty())
-    return Coefficient_zero();
-  const_iterator itr = find(i);
-  if (itr != end())
-    return *itr;
-  else
-    return Coefficient_zero();
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::find(dimension_type i) {
-  PPL_ASSERT(i < size());
-
-  iterator itr = tree.bisect(i);
-
-  if (itr != end() && itr.index() == i)
-    return itr;
-
-  return end();
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::find(iterator hint, dimension_type i) {
-  PPL_ASSERT(i < size());
-
-  iterator itr = tree.bisect_near(hint, i);
-
-  if (itr != end() && itr.index() == i)
-    return itr;
-
-  return end();
-}
-
-inline Sparse_Row::const_iterator
-Sparse_Row::find(dimension_type i) const {
-  PPL_ASSERT(i < size());
-
-  const_iterator itr = tree.bisect(i);
-
-  if (itr != end() && itr.index() == i)
-    return itr;
-
-  return end();
-}
-
-inline Sparse_Row::const_iterator
-Sparse_Row::find(const_iterator hint, dimension_type i) const {
-  PPL_ASSERT(i < size());
-
-  const_iterator itr = tree.bisect_near(hint, i);
-
-  if (itr != end() && itr.index() == i)
-    return itr;
-
-  return end();
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::lower_bound(dimension_type i) {
-  PPL_ASSERT(i <= size());
-
-  iterator itr = tree.bisect(i);
-
-  if (itr == end())
-    return end();
-
-  if (itr.index() < i)
-    ++itr;
-
-  PPL_ASSERT(itr == end() || itr.index() >= i);
-
-  return itr;
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::lower_bound(iterator hint, dimension_type i) {
-  PPL_ASSERT(i <= size());
-
-  iterator itr = tree.bisect_near(hint, i);
-
-  if (itr == end())
-    return end();
-
-  if (itr.index() < i)
-    ++itr;
-
-  PPL_ASSERT(itr == end() || itr.index() >= i);
-
-  return itr;
-}
-
-inline Sparse_Row::const_iterator
-Sparse_Row::lower_bound(dimension_type i) const {
-  PPL_ASSERT(i <= size());
-
-  const_iterator itr = tree.bisect(i);
-
-  if (itr == end())
-    return end();
-
-  if (itr.index() < i)
-    ++itr;
-
-  PPL_ASSERT(itr == end() || itr.index() >= i);
-
-  return itr;
-}
-
-inline Sparse_Row::const_iterator
-Sparse_Row::lower_bound(const_iterator hint, dimension_type i) const {
-  PPL_ASSERT(i <= size());
-
-  const_iterator itr = tree.bisect_near(hint, i);
-
-  if (itr == end())
-    return end();
-
-  if (itr.index() < i)
-    ++itr;
-
-  PPL_ASSERT(itr == end() || itr.index() >= i);
-
-  return itr;
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::insert(dimension_type i, Coefficient_traits::const_reference x) {
-  PPL_ASSERT(i < size_);
-  return tree.insert(i, x);
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::insert(iterator itr, dimension_type i,
-                   Coefficient_traits::const_reference x) {
-  PPL_ASSERT(i < size_);
-  return tree.insert(itr, i, x);
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::insert(dimension_type i) {
-  PPL_ASSERT(i < size_);
-  return tree.insert(i);
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::insert(iterator itr, dimension_type i) {
-  PPL_ASSERT(i < size_);
-  return tree.insert(itr, i);
-}
-
-inline void
-Sparse_Row::swap_coefficients(iterator i, iterator j) {
-  PPL_ASSERT(i != end());
-  PPL_ASSERT(j != end());
-  using std::swap;
-  swap(*i, *j);
-  PPL_ASSERT(OK());
-}
-
-inline void
-Sparse_Row::fast_swap(dimension_type i, iterator itr) {
-  PPL_ASSERT(lower_bound(i) == itr);
-  PPL_ASSERT(itr != end());
-  tree.fast_shift(i, itr);
-  PPL_ASSERT(OK());
-}
-
-inline Sparse_Row::iterator
-Sparse_Row::reset(iterator i) {
-  iterator res = tree.erase(i);
-  PPL_ASSERT(OK());
-  return res;
-}
-
-inline void
-Sparse_Row::reset(dimension_type i) {
-  PPL_ASSERT(i < size());
-
-  tree.erase(i);
-  PPL_ASSERT(OK());
-}
-
-inline memory_size_type
-Sparse_Row::external_memory_in_bytes() const {
-  return tree.external_memory_in_bytes();
-}
-
-inline memory_size_type
-Sparse_Row::external_memory_in_bytes(dimension_type /* capacity */) const {
-  return external_memory_in_bytes();
-}
-
-inline memory_size_type
-Sparse_Row::total_memory_in_bytes() const {
-  return external_memory_in_bytes() + sizeof(*this);
-}
-
-inline memory_size_type
-Sparse_Row::total_memory_in_bytes(dimension_type /* capacity */) const {
-  return total_memory_in_bytes();
-}
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Sparse_Row */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-inline void
-swap(Sparse_Row& x, Sparse_Row& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Sparse_Row_inlines_hh)
diff --git a/src/Sparse_Row.templates.hh b/src/Sparse_Row.templates.hh
deleted file mode 100644
index 76b2843..0000000
--- a/src/Sparse_Row.templates.hh
+++ /dev/null
@@ -1,147 +0,0 @@
-/* Sparse_Row class implementation: non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Sparse_Row_templates_hh
-#define PPL_Sparse_Row_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-
-template <typename Func1, typename Func2>
-void
-Sparse_Row::combine_needs_first(const Sparse_Row& y,
-                                const Func1& f, const Func2& g) {
-  if (this == &y) {
-    for (iterator i = begin(), i_end = end(); i != i_end; ++i)
-      g(*i, *i);
-  } else {
-    iterator i = begin();
-    // This is a const reference to an internal iterator, that is kept valid.
-    // If we just stored a copy, that would be invalidated by the calls to
-    // reset().
-    const iterator& i_end = end();
-    const_iterator j = y.begin();
-    const_iterator j_end = y.end();
-    while (i != i_end && j != j_end)
-      if (i.index() == j.index()) {
-        g(*i, *j);
-        if (*i == 0)
-          i = reset(i);
-        else
-          ++i;
-        ++j;
-      } else
-        if (i.index() < j.index()) {
-          f(*i);
-          if (*i == 0)
-            i = reset(i);
-          else
-            ++i;
-        } else
-          j = y.lower_bound(j, i.index());
-    while (i != i_end) {
-      f(*i);
-      if (*i == 0)
-        i = reset(i);
-      else
-        ++i;
-    }
-  }
-}
-
-template <typename Func1, typename Func2>
-void
-Sparse_Row::combine_needs_second(const Sparse_Row& y,
-                                 const Func1& g,
-                                 const Func2& /* h */) {
-  iterator i = begin();
-  for (const_iterator j = y.begin(), j_end = y.end(); j != j_end; ++j) {
-    i = insert(i, j.index());
-    g(*i, *j);
-    if (*i == 0)
-      i = reset(i);
-  }
-}
-
-template <typename Func1, typename Func2, typename Func3>
-void
-Sparse_Row::combine(const Sparse_Row& y, const Func1& f,
-                    const Func2& g, const Func3& h) {
-  if (this == &y) {
-    for (iterator i = begin(), i_end = end(); i != i_end; ++i)
-      g(*i, *i);
-  } else {
-    iterator i = begin();
-    // This is a const reference to an internal iterator, that is kept valid.
-    // If we just stored a copy, that would be invalidated by the calls to
-    // reset() and insert().
-    const iterator& i_end = end();
-    const_iterator j = y.begin();
-    const_iterator j_end = y.end();
-    while (i != i_end && j != j_end) {
-      if (i.index() == j.index()) {
-        g(*i, *j);
-        if (*i == 0)
-          i = reset(i);
-        else
-          ++i;
-        ++j;
-      } else
-        if (i.index() < j.index()) {
-          f(*i);
-          if (*i == 0)
-            i = reset(i);
-          else
-            ++i;
-        } else {
-          PPL_ASSERT(i.index() > j.index());
-          i = insert(i, j.index());
-          h(*i, *j);
-          if (*i == 0)
-            i = reset(i);
-          else
-            ++i;
-          ++j;
-        }
-    }
-    PPL_ASSERT(i == i_end || j == j_end);
-    while (i != i_end) {
-      f(*i);
-      if (*i == 0)
-        i = reset(i);
-      else
-        ++i;
-    }
-    while (j != j_end) {
-      i = insert(i, j.index());
-      h(*i, *j);
-      if (*i == 0)
-        i = reset(i);
-      ++j;
-    }
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Sparse_Row_templates_hh)
diff --git a/src/Sparse_Row.types.hh b/src/Sparse_Row.types.hh
deleted file mode 100644
index adc1d9d..0000000
--- a/src/Sparse_Row.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Sparse_Row_types_hh
-#define PPL_Sparse_Row_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Sparse_Row;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Sparse_Row_types_hh)
diff --git a/src/Sparse_Row_defs.hh b/src/Sparse_Row_defs.hh
new file mode 100644
index 0000000..a8ee19a
--- /dev/null
+++ b/src/Sparse_Row_defs.hh
@@ -0,0 +1,930 @@
+/* Sparse_Row class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Sparse_Row_defs_hh
+#define PPL_Sparse_Row_defs_hh 1
+
+#include "Sparse_Row_types.hh"
+
+#include "CO_Tree_defs.hh"
+#include "Coefficient_defs.hh"
+#include "Dense_Row_types.hh"
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A finite sparse sequence of coefficients.
+/*! \ingroup PPL_CXX_interface
+  This class is implemented using a CO_Tree. See the documentation of CO_Tree
+  for details on the implementation and the performance.
+
+  This class is a drop-in replacement of Dense_Row, meaning that code
+  using Dense_Row can be ported to Sparse_Row changing only the type.
+  The resulting code will work, but probably needs more CPU and memory (it
+  does not exploit the sparse representation yet).
+
+  To take advantage of the sparse representation, the client code must then be
+  modified to use methods which can have a faster implementation on sparse
+  data structures.
+
+  The main changes are the replacement of calls to operator[] with calls to
+  find(), lower_bound() or insert(), using hint iterators when possible.
+  Sequential scanning of rows should probably be implemented using iterators
+  rather than indexes, to improve performance.
+  reset() should be called to zero elements.
+
+  \see Sparse_Matrix
+  \see CO_Tree
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Sparse_Row {
+
+public:
+
+  //! An %iterator on the row elements
+  /*!
+    This %iterator skips non-stored zeroes.
+    \see CO_Tree::iterator
+  */
+  typedef CO_Tree::iterator iterator;
+
+  //! A const %iterator on the row elements
+  /*!
+    This %iterator skips non-stored zeroes.
+    \see CO_Tree::const_iterator
+  */
+  typedef CO_Tree::const_iterator const_iterator;
+
+  //! Constructs a row with the specified size.
+  /*!
+    \param n
+    The size for the new row.
+
+    The row will contain only non-stored zeroes.
+
+    This constructor takes \f$O(1)\f$ time.
+  */
+  explicit Sparse_Row(dimension_type n = 0);
+
+  //! Constructs a row with the specified size.
+  /*!
+    \param n
+    The size for the new row.
+
+    \param capacity
+    It is ignored. This parameter is needed for compatibility with Dense_Row.
+
+    The row will contain only non-stored zeroes.
+
+    This constructor takes \f$O(1)\f$ time.
+  */
+  Sparse_Row(dimension_type n, dimension_type capacity);
+
+  //! Copy constructor with specified capacity.
+  /*!
+    It is assumed that \p capacity is greater than or equal to
+    the size of \p y.
+  */
+  Sparse_Row(const Sparse_Row& y, dimension_type capacity);
+
+  //! Copy constructor with specified size and capacity.
+  /*!
+    It is assumed that \p sz is less than or equal to \p capacity.
+  */
+  Sparse_Row(const Sparse_Row& y, dimension_type sz, dimension_type capacity);
+
+  //! Constructor from a Dense_Row.
+  /*!
+    \param row
+    The row that will be copied into *this.
+
+    This constructor takes \f$O(n)\f$ time. Note that constructing of a row of
+    zeroes and then inserting n elements costs \f$O(n*\log^2 n)\f$ time.
+  */
+  explicit Sparse_Row(const Dense_Row& row);
+
+  //! Copy constructor from a Dense_Row with specified size and capacity.
+  /*!
+    It is assumed that \p sz is less than or equal to \p capacity.
+  */
+  Sparse_Row(const Dense_Row& y, dimension_type sz, dimension_type capacity);
+
+  Sparse_Row& operator=(const Dense_Row& row);
+
+  //! Swaps *this and x.
+  /*!
+    \param x
+    The row that will be swapped with *this.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void m_swap(Sparse_Row& x);
+
+  //! Returns the size of the row.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  dimension_type size() const;
+
+  //! Returns the number of elements explicitly stored in the row.
+  /*!
+    This is equivalent to std::distance(begin(), end()), but it's much faster.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  dimension_type num_stored_elements() const;
+
+  //! Resizes the row to the specified size.
+  /*!
+    \param n
+    The new size for the row.
+
+    This method takes \f$O(k*\log^2 n)\f$ amortized time when shrinking the
+    row and removing the trailing k elements.
+    It takes \f$O(1)\f$ time when enlarging the row.
+  */
+  void resize(dimension_type n);
+
+  //! Resizes the row to size \p n.
+  /*!
+    \param n
+    The new size for the row.
+
+    This method, with this signature, is needed for compatibility with
+    Dense_Row.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void expand_within_capacity(dimension_type n);
+
+  //! Resizes the row to size \p n.
+  /*!
+    \param n
+    The new size for the row.
+
+    This method, with this signature, is needed for compatibility with
+    Dense_Row.
+
+    This method takes \f$O(k*\log^2 n)\f$ amortized time where k is the number
+    of removed elements.
+  */
+  void shrink(dimension_type n);
+
+  /*!
+    \brief Deletes the i-th element from the row, shifting the next elements
+           to the left.
+
+    \param i
+    The index of the element that will be deleted.
+
+    The size of the row is decreased by 1.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(k+\log^2 n)\f$ amortized time, where k is the
+    number of elements with index greater than i.
+  */
+  void delete_element_and_shift(dimension_type i);
+
+  //! Adds \p n zeroes before index \p i.
+  /*!
+    \param n
+    The number of non-stored zeroes that will be added to the row.
+
+    \param i
+    The index of the element before which the zeroes will be added.
+
+    Existing elements with index greater than or equal to \p i are shifted to
+    the right by \p n positions. The size is increased by \p n.
+
+    Existing iterators are not invalidated, but are shifted to the right
+    by \p n if they pointed at or after index \p i (i.e., they point to
+    the same, possibly shifted, values as before).
+
+    This method takes \f$O(k + \log m)\f$ expected time, where \f$k\f$ is
+    the number of elements with index greater than or equal to \p i and
+    \f$m\f$ the number of stored elements.
+  */
+  void add_zeroes_and_shift(dimension_type n, dimension_type i);
+
+  //! Returns an %iterator that points at the first stored element.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  iterator begin();
+
+  //! Returns an %iterator that points after the last stored element.
+  /*!
+    This method always returns a reference to the same internal %iterator,
+    that is kept valid.
+    Client code can keep a const reference to that %iterator instead of
+    keep updating a local %iterator.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  const iterator& end();
+
+  //! Equivalent to <CODE>cbegin()</CODE>.
+  const_iterator begin() const;
+
+  //! Equivalent to <CODE>cend()</CODE>.
+  const const_iterator& end() const;
+
+  //! Returns an %iterator that points at the first element.
+  /*!
+    This method takes \f$O(1)\f$ time.
+  */
+  const_iterator cbegin() const;
+
+  //! Returns an %iterator that points after the last element.
+  /*!
+    This method always returns a reference to the same internal %iterator,
+    that is updated at each operation that modifies the structure.
+    Client code can keep a const reference to that %iterator instead of
+    keep updating a local %iterator.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  const const_iterator& cend() const;
+
+  //! Returns the size() of the largest possible Sparse_Row.
+  static dimension_type max_size();
+
+  //! Resets all the elements of this row.
+  /*!
+    This method takes \f$O(n)\f$ time.
+  */
+  void clear();
+
+  //! Gets a reference to the i-th element.
+  /*!
+    \param i
+    The index of the desired element.
+
+    For read-only access it's better to use get(), that avoids allocating
+    space for zeroes.
+
+    If possible, use the insert(), find() or lower_bound() methods with
+    a hint instead of this, to improve performance.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log n)\f$ amortized time when there is already an
+    element with index \p i, and \f$O(\log^2 n)\f$ otherwise.
+  */
+  Coefficient& operator[](dimension_type i);
+
+  //! Equivalent to <CODE>get(i)</CODE>, provided for convenience.
+  /*!
+    This method takes \f$O(\log n)\f$ time.
+  */
+  Coefficient_traits::const_reference operator[](dimension_type i) const;
+
+  //! Gets the i-th element in the sequence.
+  /*!
+    \param i
+    The index of the desired element.
+
+    If possible, use the insert(), find() or lower_bound() methods with
+    a hint instead of this, to improve performance.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Looks for an element with index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    If possible, use the find() method that takes a hint %iterator, to improve
+    performance.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  iterator find(dimension_type i);
+
+  //! Looks for an element with index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param itr
+    It is used as a hint. This method will be faster if the searched element
+    is near to \p itr.
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this row. \p itr may even be end().
+
+    This method takes \f$O(\log n)\f$ time.
+    If the distance between \p itr and the searched position is \f$O(1)\f$,
+    this method takes \f$O(1)\f$ time.
+  */
+  iterator find(iterator itr, dimension_type i);
+
+  //! Looks for an element with index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    If possible, use the find() method that takes a hint %iterator, to improve
+    performance.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  const_iterator find(dimension_type i) const;
+
+  //! Looks for an element with index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param itr
+    It is used as a hint. This method will be faster if the searched element
+    is near to \p itr.
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this row. \p itr may even be end().
+
+    This method takes \f$O(\log n)\f$ time.
+    If the distance between \p itr and the searched position is \f$O(1)\f$,
+    this method takes \f$O(1)\f$ time.
+  */
+  const_iterator find(const_iterator itr, dimension_type i) const;
+
+  //! Lower bound of index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \returns an %iterator to the first element with index greater than or
+             equal to i.
+             If there are no such elements, returns end().
+
+    If possible, use the find() method that takes a hint %iterator, to improve
+    performance.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  iterator lower_bound(dimension_type i);
+
+  //! Lower bound of index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param itr
+    It is used as a hint. This method will be faster if the searched element
+    is near to \p itr.
+
+    \returns an %iterator to the first element with index greater than or
+             equal to i.
+             If there are no such elements, returns end().
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this row. \p itr may even be end().
+
+    This method takes \f$O(\log n)\f$ time.
+    If the distance between \p itr and the searched position is \f$O(1)\f$,
+    this method takes \f$O(1)\f$ time.
+  */
+  iterator lower_bound(iterator itr, dimension_type i);
+
+  //! Lower bound of index i.
+  /*!
+
+    \param i
+    The index of the desired element.
+
+    \returns an %iterator to the first element with index greater than or
+             equal to i.
+             If there are no such elements, returns end().
+
+    If possible, use the find() method that takes a hint %iterator, to improve
+    performance.
+
+    This method takes \f$O(\log n)\f$ time.
+  */
+  const_iterator lower_bound(dimension_type i) const;
+
+  //! Lower bound of index i.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param itr
+    It is used as a hint. This method will be faster if the searched element
+    is near to \p itr.
+
+    \returns an %iterator to the first element with index greater than or
+             equal to i.
+             If there are no such elements, returns end().
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this row. \p itr may even be end().
+
+    This method takes \f$O(\log n)\f$ time.
+    If the distance between \p itr and the searched position is \f$O(1)\f$,
+    this method takes \f$O(1)\f$ time.
+  */
+  const_iterator lower_bound(const_iterator itr, dimension_type i) const;
+
+  //! Equivalent to <CODE>(*this)[i] = x; find(i)</CODE>, but faster.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param x
+    The value that will be associated to the element.
+
+    If possible, use versions of this method that take a hint, to improve
+    performance.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  iterator insert(dimension_type i, Coefficient_traits::const_reference x);
+
+  //! Equivalent to <CODE>(*this)[i] = x; find(i)</CODE>, but faster.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param x
+    The value that will be associated to the element.
+
+    \param itr
+    It is used as a hint. This method will be faster if the searched element
+    is near to \p itr, even faster than <CODE>(*this)[i] = x</CODE>.
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this row. \p itr may even be end().
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time. If the distance
+    between \p itr and the searched position is \f$O(1)\f$ and the row already
+    contains an element with this index, this method takes \f$O(1)\f$ time.
+  */
+  iterator insert(iterator itr, dimension_type i,
+                  Coefficient_traits::const_reference x);
+
+  //! Equivalent to <CODE>(*this)[i]; find(i)</CODE>, but faster.
+  /*!
+    \param i
+    The index of the desired element.
+
+    If possible, use versions of this method that take a hint, to improve
+    performance.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  iterator insert(dimension_type i);
+
+  //! Equivalent to <CODE>(*this)[i]; find(i)</CODE>, but faster.
+  /*!
+    \param i
+    The index of the desired element.
+
+    \param itr
+    It is used as a hint. This method will be faster if the searched element
+    is near to \p itr, even faster than <CODE>(*this)[i]</CODE>.
+
+    The value of \p itr does not affect the result of this method, as long it
+    is a valid %iterator for this row. \p itr may even be end().
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time. If the distance
+    between \p itr and the searched position is \f$O(1)\f$ and the row already
+    contains an element with this index, this method takes \f$O(1)\f$ time.
+  */
+  iterator insert(iterator itr, dimension_type i);
+
+  //! Swaps the i-th element with the j-th element.
+  /*!
+    \param i
+    The index of an element.
+
+    \param j
+    The index of another element.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  void swap_coefficients(dimension_type i, dimension_type j);
+
+  //! Equivalent to swap(i,itr.index()), but it assumes that
+  //! lower_bound(i)==itr.
+  /*!
+    Iterators that pointed to the itr.index()-th element remain valid
+    but now point to the i-th element. Other iterators are unaffected.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void fast_swap(dimension_type i, iterator itr);
+
+  //! Swaps the element pointed to by i with the element pointed to by j.
+  /*!
+    \param i
+    An %iterator pointing to an element.
+
+    \param j
+    An %iterator pointing to another element.
+
+    This method takes \f$O(1)\f$ time.
+  */
+  void swap_coefficients(iterator i, iterator j);
+
+  //! Resets to zero the value pointed to by i.
+  /*!
+    \param i
+    An %iterator pointing to the element that will be reset (not stored
+    anymore).
+
+    By calling this method instead of getting a reference to the value and
+    setting it to zero, the element will no longer be stored.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  iterator reset(iterator i);
+
+  //! Resets to zero the values in the range [first,last).
+  /*!
+    \param first
+    An %iterator pointing to the first element to reset.
+
+    \param last
+    An %iterator pointing after the last element to reset.
+
+    By calling this method instead of getting a reference to the values and
+    setting them to zero, the elements will no longer be stored.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(k*\log^2 n)\f$ amortized time, where k is the
+    number of elements in [first,last).
+  */
+  iterator reset(iterator first, iterator last);
+
+  //! Resets to zero the i-th element.
+  /*!
+    \param i
+    The index of the element to reset.
+
+    By calling this method instead of getting a reference to the value and
+    setting it to zero, the element will no longer be stored.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(\log^2 n)\f$ amortized time.
+  */
+  void reset(dimension_type i);
+
+  //! Resets to zero the elements with index greater than or equal to i.
+  /*!
+    \param i
+    The index of the first element to reset.
+
+    By calling this method instead of getting a reference to the values and
+    setting them to zero, the elements will no longer be stored.
+
+    This operation invalidates existing iterators.
+
+    This method takes \f$O(k*\log^2 n)\f$ amortized time, where k is the
+    number of elements with index greater than or equal to i.
+  */
+  void reset_after(dimension_type i);
+
+  //! Normalizes the modulo of coefficients so that they are mutually prime.
+  /*!
+    Computes the Greatest Common Divisor (GCD) among the elements of the row
+    and normalizes them by the GCD itself.
+
+    This method takes \f$O(n)\f$ time.
+  */
+  void normalize();
+
+  //! Calls g(x[i],y[i]), for each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param f
+    A functor that should take a Coefficient&.
+    f(c1) must be equivalent to g(c1, 0).
+
+    \param g
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    g(c1, c2) must do nothing when c1 is zero.
+
+    This method takes \f$O(n*\log^2 n)\f$ time.
+
+    \note
+    The functors will only be called when necessary, assuming the requested
+    properties hold.
+
+    \see combine_needs_second
+    \see combine
+  */
+  template <typename Func1, typename Func2>
+  void combine_needs_first(const Sparse_Row& y,
+                           const Func1& f, const Func2& g);
+
+  //! Calls g(x[i],y[i]), for each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param g
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    g(c1, 0) must do nothing, for every c1.
+
+    \param h
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
+
+    This method takes \f$O(n*\log^2 n)\f$ time.
+
+    \note
+    The functors will only be called when necessary, assuming the requested
+    properties hold.
+
+    \see combine_needs_first
+    \see combine
+  */
+  template <typename Func1, typename Func2>
+  void combine_needs_second(const Sparse_Row& y,
+                            const Func1& g, const Func2& h);
+
+  //! Calls g(x[i],y[i]), for each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param f
+    A functor that should take a Coefficient&.
+    f(c1) must be equivalent to g(c1, 0).
+
+    \param g
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    g(c1, c2) must do nothing when both c1 and c2 are zero.
+
+    \param h
+    A functor that should take a Coefficient& and a
+    Coefficient_traits::const_reference.
+    h(c1, c2) must be equivalent to g(c1, c2) when c1 is zero.
+
+    This method takes \f$O(n*\log^2 n)\f$ time.
+
+    \note
+    The functors will only be called when necessary, assuming the requested
+    properties hold.
+
+    \see combine_needs_first
+    \see combine_needs_second
+  */
+  template <typename Func1, typename Func2, typename Func3>
+  void combine(const Sparse_Row& y,
+               const Func1& f, const Func2& g, const Func3& h);
+
+  //! Executes <CODE>(*this)[i] = (*this)[i]*coeff1 + y[i]*coeff2</CODE>, for
+  //! each i.
+  /*!
+    \param y
+    The row that will be combined with *this.
+
+    \param coeff1
+    The coefficient used for elements of *this.
+    This must not be 0.
+
+    \param coeff2
+    The coefficient used for elements of y.
+    This must not be 0.
+
+    This method takes \f$O(n*\log^2 n)\f$ time.
+
+    \note
+    The functors will only be called when necessary.
+    This method can be implemented in user code, too. It is provided for
+    convenience only.
+
+    \see combine_needs_first
+    \see combine_needs_second
+    \see combine
+  */
+  void linear_combine(const Sparse_Row& y,
+                      Coefficient_traits::const_reference coeff1,
+                      Coefficient_traits::const_reference coeff2);
+
+  //! Equivalent to <CODE>(*this)[i] = (*this)[i] * c1 + y[i] * c2</CODE>,
+  //! for each i in [start, end).
+  /*!
+    This method, unlike the other linear_combine() method, detects when
+    coeff1==1 and/or coeff2==1 or coeff2==-1 in order to save some work.
+  */
+  void linear_combine(const Sparse_Row& y,
+                      Coefficient_traits::const_reference c1,
+                      Coefficient_traits::const_reference c2,
+                      dimension_type start, dimension_type end);
+
+  PPL_OUTPUT_DECLARATIONS
+
+  //! Loads the row from an ASCII representation generated using ascii_dump().
+  /*!
+    \param s
+    The stream from which the ASCII representation will be loaded.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  /*!
+    This method takes \f$O(n)\f$ time.
+  */
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  /*!
+    This method is provided for compatibility with Dense_Row.
+
+    This method takes \f$O(n)\f$ time.
+
+    \param capacity
+    This parameter is ignored.
+  */
+  memory_size_type external_memory_in_bytes(dimension_type capacity) const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  /*!
+    This method takes \f$O(n)\f$ time.
+  */
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  /*!
+    This method is provided for compatibility with Dense_Row.
+
+    This method takes \f$O(n)\f$ time.
+
+    \param capacity
+    This parameter is ignored.
+  */
+  memory_size_type total_memory_in_bytes(dimension_type capacity) const;
+
+  //! Checks the invariant.
+  bool OK() const;
+
+  //! Checks the invariant.
+  /*!
+    This method is provided for compatibility with Dense_Row.
+
+    \param capacity
+    This parameter is ignored.
+  */
+  bool OK(dimension_type capacity) const;
+
+private:
+  //! The tree used to store the elements.
+  CO_Tree tree;
+
+  //! The size of the row.
+  /*!
+    The elements contained in this row have indexes that are less than size_.
+  */
+  dimension_type size_;
+};
+
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(Parma_Polyhedra_Library::Sparse_Row& x,
+          Parma_Polyhedra_Library::Sparse_Row& y);
+
+void swap(Parma_Polyhedra_Library::Sparse_Row& x,
+          Parma_Polyhedra_Library::Dense_Row& y);
+
+void swap(Parma_Polyhedra_Library::Dense_Row& x,
+          Parma_Polyhedra_Library::Sparse_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator==(const Sparse_Row& x, const Sparse_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool operator!=(const Sparse_Row& x, const Sparse_Row& y);
+
+bool operator==(const Dense_Row& x, const Sparse_Row& y);
+bool operator!=(const Dense_Row& x, const Sparse_Row& y);
+
+bool operator==(const Sparse_Row& x, const Dense_Row& y);
+bool operator!=(const Sparse_Row& x, const Dense_Row& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Sparse_Row& x, const Dense_Row& y,
+                    Coefficient_traits::const_reference coeff1,
+                    Coefficient_traits::const_reference coeff2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Sparse_Row
+  This function detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
+  order to save some work.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Sparse_Row& x, const Dense_Row& y,
+                    Coefficient_traits::const_reference c1,
+                    Coefficient_traits::const_reference c2,
+                    dimension_type start, dimension_type end);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Dense_Row& x, const Sparse_Row& y,
+                    Coefficient_traits::const_reference coeff1,
+                    Coefficient_traits::const_reference coeff2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Sparse_Row
+  This function detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
+  order to save some work.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Dense_Row& x, const Sparse_Row& y,
+                    Coefficient_traits::const_reference c1,
+                    Coefficient_traits::const_reference c2,
+                    dimension_type start, dimension_type end);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Sparse_Row& x, const Sparse_Row& y,
+                    Coefficient_traits::const_reference coeff1,
+                    Coefficient_traits::const_reference coeff2);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Equivalent to <CODE>x[i] = x[i] * c1 + y[i] * c2</CODE>,
+//! for each i in [start, end).
+/*! \relates Sparse_Row
+  This function detects when coeff1==1 and/or coeff2==1 or coeff2==-1 in
+  order to save some work.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void linear_combine(Sparse_Row& x, const Sparse_Row& y,
+                    Coefficient_traits::const_reference c1,
+                    Coefficient_traits::const_reference c2,
+                    dimension_type start, dimension_type end);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Sparse_Row_inlines.hh"
+#include "Sparse_Row_templates.hh"
+
+#endif // !defined(PPL_Sparse_Row_defs_hh)
diff --git a/src/Sparse_Row_inlines.hh b/src/Sparse_Row_inlines.hh
new file mode 100644
index 0000000..1d4ba74
--- /dev/null
+++ b/src/Sparse_Row_inlines.hh
@@ -0,0 +1,378 @@
+/* Sparse_Row class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Sparse_Row_inlines_hh
+#define PPL_Sparse_Row_inlines_hh 1
+
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Sparse_Row::Sparse_Row(dimension_type n)
+  : size_(n) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Sparse_Row::Sparse_Row(dimension_type n, dimension_type)
+  : size_(n) {
+  PPL_ASSERT(OK());
+}
+
+inline
+Sparse_Row::Sparse_Row(const Sparse_Row& y, dimension_type)
+  : tree(y.tree), size_(y.size_) {
+}
+
+inline
+Sparse_Row::Sparse_Row(const Sparse_Row& y, dimension_type sz, dimension_type)
+  : tree(y.begin(),
+         std::distance(y.begin(), y.lower_bound(std::min(y.size(), sz)))),
+    size_(sz) {
+  PPL_ASSERT(OK());
+}
+
+inline void
+Sparse_Row::m_swap(Sparse_Row& x) {
+  using std::swap;
+  swap(tree, x.tree);
+  swap(size_, x.size_);
+  PPL_ASSERT(OK());
+  PPL_ASSERT(x.OK());
+}
+
+inline dimension_type
+Sparse_Row::size() const {
+  return size_;
+}
+
+inline dimension_type
+Sparse_Row::num_stored_elements() const {
+  return tree.size();
+}
+
+inline void
+Sparse_Row::resize(dimension_type n) {
+  if (n < size_)
+    reset_after(n);
+  size_ = n;
+  PPL_ASSERT(OK());
+}
+
+inline void
+Sparse_Row::shrink(dimension_type n) {
+  PPL_ASSERT(size() >= n);
+  resize(n);
+}
+
+inline void
+Sparse_Row::expand_within_capacity(dimension_type n) {
+  PPL_ASSERT(size() <= n);
+  resize(n);
+}
+
+inline void
+Sparse_Row::delete_element_and_shift(dimension_type i) {
+  PPL_ASSERT(i < size_);
+  tree.erase_element_and_shift_left(i);
+  --size_;
+  PPL_ASSERT(OK());
+}
+
+inline void
+Sparse_Row::add_zeroes_and_shift(dimension_type n, dimension_type i) {
+  PPL_ASSERT(i <= size_);
+  tree.increase_keys_from(i, n);
+  size_ += n;
+  PPL_ASSERT(OK());
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::begin() {
+  return tree.begin();
+}
+
+inline const Sparse_Row::iterator&
+Sparse_Row::end() {
+  return tree.end();
+}
+
+inline Sparse_Row::const_iterator
+Sparse_Row::begin() const {
+  return tree.cbegin();
+}
+
+inline const Sparse_Row::const_iterator&
+Sparse_Row::end() const {
+  return tree.cend();
+}
+
+inline Sparse_Row::const_iterator
+Sparse_Row::cbegin() const {
+  return tree.cbegin();
+}
+
+inline const Sparse_Row::const_iterator&
+Sparse_Row::cend() const {
+  return tree.cend();
+}
+
+inline dimension_type
+Sparse_Row::max_size() {
+  return CO_Tree::max_size();
+}
+
+inline void
+Sparse_Row::clear() {
+  tree.clear();
+}
+
+inline Coefficient&
+Sparse_Row::operator[](dimension_type i) {
+  PPL_ASSERT(i < size_);
+  iterator itr = insert(i);
+  return *itr;
+}
+
+inline Coefficient_traits::const_reference
+Sparse_Row::operator[](dimension_type i) const {
+  return get(i);
+}
+
+inline Coefficient_traits::const_reference
+Sparse_Row::get(dimension_type i) const {
+  PPL_ASSERT(i < size_);
+  if (tree.empty())
+    return Coefficient_zero();
+  const_iterator itr = find(i);
+  if (itr != end())
+    return *itr;
+  else
+    return Coefficient_zero();
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::find(dimension_type i) {
+  PPL_ASSERT(i < size());
+
+  iterator itr = tree.bisect(i);
+
+  if (itr != end() && itr.index() == i)
+    return itr;
+
+  return end();
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::find(iterator hint, dimension_type i) {
+  PPL_ASSERT(i < size());
+
+  iterator itr = tree.bisect_near(hint, i);
+
+  if (itr != end() && itr.index() == i)
+    return itr;
+
+  return end();
+}
+
+inline Sparse_Row::const_iterator
+Sparse_Row::find(dimension_type i) const {
+  PPL_ASSERT(i < size());
+
+  const_iterator itr = tree.bisect(i);
+
+  if (itr != end() && itr.index() == i)
+    return itr;
+
+  return end();
+}
+
+inline Sparse_Row::const_iterator
+Sparse_Row::find(const_iterator hint, dimension_type i) const {
+  PPL_ASSERT(i < size());
+
+  const_iterator itr = tree.bisect_near(hint, i);
+
+  if (itr != end() && itr.index() == i)
+    return itr;
+
+  return end();
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::lower_bound(dimension_type i) {
+  PPL_ASSERT(i <= size());
+
+  iterator itr = tree.bisect(i);
+
+  if (itr == end())
+    return end();
+
+  if (itr.index() < i)
+    ++itr;
+
+  PPL_ASSERT(itr == end() || itr.index() >= i);
+
+  return itr;
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::lower_bound(iterator hint, dimension_type i) {
+  PPL_ASSERT(i <= size());
+
+  iterator itr = tree.bisect_near(hint, i);
+
+  if (itr == end())
+    return end();
+
+  if (itr.index() < i)
+    ++itr;
+
+  PPL_ASSERT(itr == end() || itr.index() >= i);
+
+  return itr;
+}
+
+inline Sparse_Row::const_iterator
+Sparse_Row::lower_bound(dimension_type i) const {
+  PPL_ASSERT(i <= size());
+
+  const_iterator itr = tree.bisect(i);
+
+  if (itr == end())
+    return end();
+
+  if (itr.index() < i)
+    ++itr;
+
+  PPL_ASSERT(itr == end() || itr.index() >= i);
+
+  return itr;
+}
+
+inline Sparse_Row::const_iterator
+Sparse_Row::lower_bound(const_iterator hint, dimension_type i) const {
+  PPL_ASSERT(i <= size());
+
+  const_iterator itr = tree.bisect_near(hint, i);
+
+  if (itr == end())
+    return end();
+
+  if (itr.index() < i)
+    ++itr;
+
+  PPL_ASSERT(itr == end() || itr.index() >= i);
+
+  return itr;
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::insert(dimension_type i, Coefficient_traits::const_reference x) {
+  PPL_ASSERT(i < size_);
+  return tree.insert(i, x);
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::insert(iterator itr, dimension_type i,
+                   Coefficient_traits::const_reference x) {
+  PPL_ASSERT(i < size_);
+  return tree.insert(itr, i, x);
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::insert(dimension_type i) {
+  PPL_ASSERT(i < size_);
+  return tree.insert(i);
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::insert(iterator itr, dimension_type i) {
+  PPL_ASSERT(i < size_);
+  return tree.insert(itr, i);
+}
+
+inline void
+Sparse_Row::swap_coefficients(iterator i, iterator j) {
+  PPL_ASSERT(i != end());
+  PPL_ASSERT(j != end());
+  using std::swap;
+  swap(*i, *j);
+  PPL_ASSERT(OK());
+}
+
+inline void
+Sparse_Row::fast_swap(dimension_type i, iterator itr) {
+  PPL_ASSERT(lower_bound(i) == itr);
+  PPL_ASSERT(itr != end());
+  tree.fast_shift(i, itr);
+  PPL_ASSERT(OK());
+}
+
+inline Sparse_Row::iterator
+Sparse_Row::reset(iterator i) {
+  iterator res = tree.erase(i);
+  PPL_ASSERT(OK());
+  return res;
+}
+
+inline void
+Sparse_Row::reset(dimension_type i) {
+  PPL_ASSERT(i < size());
+
+  tree.erase(i);
+  PPL_ASSERT(OK());
+}
+
+inline memory_size_type
+Sparse_Row::external_memory_in_bytes() const {
+  return tree.external_memory_in_bytes();
+}
+
+inline memory_size_type
+Sparse_Row::external_memory_in_bytes(dimension_type /* capacity */) const {
+  return external_memory_in_bytes();
+}
+
+inline memory_size_type
+Sparse_Row::total_memory_in_bytes() const {
+  return external_memory_in_bytes() + sizeof(*this);
+}
+
+inline memory_size_type
+Sparse_Row::total_memory_in_bytes(dimension_type /* capacity */) const {
+  return total_memory_in_bytes();
+}
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Sparse_Row */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+inline void
+swap(Sparse_Row& x, Sparse_Row& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Sparse_Row_inlines_hh)
diff --git a/src/Sparse_Row_templates.hh b/src/Sparse_Row_templates.hh
new file mode 100644
index 0000000..c703a3e
--- /dev/null
+++ b/src/Sparse_Row_templates.hh
@@ -0,0 +1,153 @@
+/* Sparse_Row class implementation: non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Sparse_Row_templates_hh
+#define PPL_Sparse_Row_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+
+template <typename Func1, typename Func2>
+void
+Sparse_Row::combine_needs_first(const Sparse_Row& y,
+                                const Func1& f, const Func2& g) {
+  if (this == &y) {
+    for (iterator i = begin(), i_end = end(); i != i_end; ++i)
+      g(*i, *i);
+  }
+  else {
+    iterator i = begin();
+    // This is a const reference to an internal iterator, that is kept valid.
+    // If we just stored a copy, that would be invalidated by the calls to
+    // reset().
+    const iterator& i_end = end();
+    const_iterator j = y.begin();
+    const_iterator j_end = y.end();
+    while (i != i_end && j != j_end)
+      if (i.index() == j.index()) {
+        g(*i, *j);
+        if (*i == 0)
+          i = reset(i);
+        else
+          ++i;
+        ++j;
+      }
+      else
+        if (i.index() < j.index()) {
+          f(*i);
+          if (*i == 0)
+            i = reset(i);
+          else
+            ++i;
+        }
+        else
+          j = y.lower_bound(j, i.index());
+    while (i != i_end) {
+      f(*i);
+      if (*i == 0)
+        i = reset(i);
+      else
+        ++i;
+    }
+  }
+}
+
+template <typename Func1, typename Func2>
+void
+Sparse_Row::combine_needs_second(const Sparse_Row& y,
+                                 const Func1& g,
+                                 const Func2& /* h */) {
+  iterator i = begin();
+  for (const_iterator j = y.begin(), j_end = y.end(); j != j_end; ++j) {
+    i = insert(i, j.index());
+    g(*i, *j);
+    if (*i == 0)
+      i = reset(i);
+  }
+}
+
+template <typename Func1, typename Func2, typename Func3>
+void
+Sparse_Row::combine(const Sparse_Row& y, const Func1& f,
+                    const Func2& g, const Func3& h) {
+  if (this == &y) {
+    for (iterator i = begin(), i_end = end(); i != i_end; ++i)
+      g(*i, *i);
+  }
+  else {
+    iterator i = begin();
+    // This is a const reference to an internal iterator, that is kept valid.
+    // If we just stored a copy, that would be invalidated by the calls to
+    // reset() and insert().
+    const iterator& i_end = end();
+    const_iterator j = y.begin();
+    const_iterator j_end = y.end();
+    while (i != i_end && j != j_end) {
+      if (i.index() == j.index()) {
+        g(*i, *j);
+        if (*i == 0)
+          i = reset(i);
+        else
+          ++i;
+        ++j;
+      }
+      else
+        if (i.index() < j.index()) {
+          f(*i);
+          if (*i == 0)
+            i = reset(i);
+          else
+            ++i;
+        }
+        else {
+          PPL_ASSERT(i.index() > j.index());
+          i = insert(i, j.index());
+          h(*i, *j);
+          if (*i == 0)
+            i = reset(i);
+          else
+            ++i;
+          ++j;
+        }
+    }
+    PPL_ASSERT(i == i_end || j == j_end);
+    while (i != i_end) {
+      f(*i);
+      if (*i == 0)
+        i = reset(i);
+      else
+        ++i;
+    }
+    while (j != j_end) {
+      i = insert(i, j.index());
+      h(*i, *j);
+      if (*i == 0)
+        i = reset(i);
+      ++j;
+    }
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Sparse_Row_templates_hh)
diff --git a/src/Sparse_Row_types.hh b/src/Sparse_Row_types.hh
new file mode 100644
index 0000000..e8b60f9
--- /dev/null
+++ b/src/Sparse_Row_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Sparse_Row_types_hh
+#define PPL_Sparse_Row_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Sparse_Row;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Sparse_Row_types_hh)
diff --git a/src/Sum_Floating_Point_Expression.defs.hh b/src/Sum_Floating_Point_Expression.defs.hh
deleted file mode 100644
index fd0d411..0000000
--- a/src/Sum_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,213 +0,0 @@
-/* Declarations for the Sum_Floating_Point_Expression class and
-   its   constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Sum_Floating_Point_Expression_defs_hh
-#define PPL_Sum_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Sum_Floating_Point_Expression.types.hh"
-#include <map>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Sum_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-void swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-	  Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Sum Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of sum floating-point expressions
-
-  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
-  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
-  be two linear forms and \f$\aslf\f$ a sound abstract operator on linear
-  forms such that:
-
-  \f[
-  \left(i + \sum_{v \in \cV}i_{v}v \right)
-  \aslf
-  \left(i' + \sum_{v \in \cV}i'_{v}v \right)
-  =
-  \left(i \asifp i'\right)
-  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v} \right)v.
-  \f]
-
-  Given an expression \f$e_{1} \oplus e_{2}\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval linear form
-  \f$\linexprenv{e_{1} \oplus e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
-  as follows:
-  \f[
-  \linexprenv{e_{1} \oplus e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  =
-  \linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \aslf
-  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  \aslf
-  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)
-  \aslf
-  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
-  \right)
-  \aslf
-  mf_{\mathbf{f}}[-1, 1]
-  \f]
-  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
-  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
-  on \f$l\f$ and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
-  <CODE>Floating_Point_Expression::absolute_error</CODE>.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Sum_Floating_Point_Expression
-  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>
-  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with two parameters: builds the sum floating point expression
-    corresponding to \p x \f$\oplus\f$ \p y.
-  */
-  Sum_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
-           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
-
-  //! Destructor.
-  ~Sum_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given astract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Note that all variables occuring in the expressions represented
-    by \p first_operand and \p second_operand MUST have an associated value in
-    \p int_store. If this precondition is not met, calling the method
-    causes an undefined behavior.
-
-    See the class description for a detailed explanation of how \p result
-    is computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-private:
-
-  //! Pointer to the first operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
-  //! Pointer to the second operand.
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Sum_Floating_Point_Expression(
-         const Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& e);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited assignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
-  operator=(const Sum_Floating_Point_Expression<FP_Interval_Type,
-	    FP_Format>& e);
-
-
-}; // class Sum_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Sum_Floating_Point_Expression.inlines.hh"
-#include "Sum_Floating_Point_Expression.templates.hh"
-
-#endif // !defined(PPL_Sum_Floating_Point_Expression_defs_hh)
diff --git a/src/Sum_Floating_Point_Expression.inlines.hh b/src/Sum_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 8a6339f..0000000
--- a/src/Sum_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,70 +0,0 @@
-/* Sum_Floating_Point_Expression class implementation: inline
-   functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Sum_Floating_Point_Expression_inlines_hh
-#define PPL_Sum_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::Sum_Floating_Point_Expression(
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
-         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y)
-  : first_operand(x), second_operand(y) {
-  assert(x != 0);
-  assert(y != 0);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::~Sum_Floating_Point_Expression() {
-  delete first_operand;
-  delete second_operand;
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  using std::swap;
-  swap(first_operand, y.first_operand);
-  swap(second_operand, y.second_operand);
-}
-
-/*! \relates Sum_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Sum_Floating_Point_Expression_inlines_hh)
diff --git a/src/Sum_Floating_Point_Expression.templates.hh b/src/Sum_Floating_Point_Expression.templates.hh
deleted file mode 100644
index ae6f0bd..0000000
--- a/src/Sum_Floating_Point_Expression.templates.hh
+++ /dev/null
@@ -1,53 +0,0 @@
-/* Sum_Floating_Point_Expression class implementation:
-   non-inline template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Sum_Floating_Point_Expression_templates_hh
-#define PPL_Sum_Floating_Point_Expression_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-bool Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store& int_store,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  if (!first_operand->linearize(int_store, lf_store, result))
-    return false;
-  FP_Linear_Form rel_error;
-  relative_error(result, rel_error);
-  result += rel_error;
-  FP_Linear_Form linearized_second_operand;
-  if (!second_operand->linearize(int_store, lf_store,
-                                linearized_second_operand))
-    return false;
-  result += linearized_second_operand;
-  relative_error(linearized_second_operand, rel_error);
-  result += rel_error;
-  result += this->absolute_error;
-  return !this->overflows(result);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Sum_Floating_Point_Expression_templates_hh)
diff --git a/src/Sum_Floating_Point_Expression.types.hh b/src/Sum_Floating_Point_Expression.types.hh
deleted file mode 100644
index 3d4db67..0000000
--- a/src/Sum_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Sum_Floating_Point_Expression_types_hh
-#define PPL_Sum_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Sum_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Sum_Floating_Point_Expression_types_hh)
diff --git a/src/Sum_Floating_Point_Expression_defs.hh b/src/Sum_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..5d4e02e
--- /dev/null
+++ b/src/Sum_Floating_Point_Expression_defs.hh
@@ -0,0 +1,213 @@
+/* Declarations for the Sum_Floating_Point_Expression class and
+   its   constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Sum_Floating_Point_Expression_defs_hh
+#define PPL_Sum_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Sum_Floating_Point_Expression_types.hh"
+#include <map>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Sum_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+void swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+          Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Sum Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of sum floating-point expressions
+
+  Let \f$i + \sum_{v \in \cV}i_{v}v \f$ and
+  \f$i' + \sum_{v \in \cV}i'_{v}v \f$
+  be two linear forms and \f$\aslf\f$ a sound abstract operator on linear
+  forms such that:
+
+  \f[
+  \left(i + \sum_{v \in \cV}i_{v}v \right)
+  \aslf
+  \left(i' + \sum_{v \in \cV}i'_{v}v \right)
+  =
+  \left(i \asifp i'\right)
+  + \sum_{v \in \cV}\left(i_{v} \asifp i'_{v} \right)v.
+  \f]
+
+  Given an expression \f$e_{1} \oplus e_{2}\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval linear form
+  \f$\linexprenv{e_{1} \oplus e_{2}}{\rho^{\#}}{\rho^{\#}_l}\f$
+  as follows:
+  \f[
+  \linexprenv{e_{1} \oplus e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  =
+  \linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \aslf
+  \linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  \aslf
+  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{1}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)
+  \aslf
+  \varepsilon_{\mathbf{f}}\left(\linexprenv{e_{2}}{\rho^{\#}}{\rho^{\#}_l}
+  \right)
+  \aslf
+  mf_{\mathbf{f}}[-1, 1]
+  \f]
+  where \f$\varepsilon_{\mathbf{f}}(l)\f$ is the linear form computed by
+  calling method <CODE>Floating_Point_Expression::relative_error</CODE>
+  on \f$l\f$ and \f$mf_{\mathbf{f}}\f$ is a rounding error defined in
+  <CODE>Floating_Point_Expression::absolute_error</CODE>.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Sum_Floating_Point_Expression
+  : public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>
+  ::FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::boundary_type from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with two parameters: builds the sum floating point expression
+    corresponding to \p x \f$\oplus\f$ \p y.
+  */
+  Sum_Floating_Point_Expression(
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
+
+  //! Destructor.
+  ~Sum_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given astract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Note that all variables occuring in the expressions represented
+    by \p first_operand and \p second_operand MUST have an associated value in
+    \p int_store. If this precondition is not met, calling the method
+    causes an undefined behavior.
+
+    See the class description for a detailed explanation of how \p result
+    is computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+private:
+
+  //! Pointer to the first operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* first_operand;
+  //! Pointer to the second operand.
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>* second_operand;
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Sum_Floating_Point_Expression(
+         const Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& e);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited assignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
+  operator=(const Sum_Floating_Point_Expression<FP_Interval_Type,
+            FP_Format>& e);
+
+
+}; // class Sum_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Sum_Floating_Point_Expression_inlines.hh"
+#include "Sum_Floating_Point_Expression_templates.hh"
+
+#endif // !defined(PPL_Sum_Floating_Point_Expression_defs_hh)
diff --git a/src/Sum_Floating_Point_Expression_inlines.hh b/src/Sum_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..8b91262
--- /dev/null
+++ b/src/Sum_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,70 @@
+/* Sum_Floating_Point_Expression class implementation: inline
+   functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Sum_Floating_Point_Expression_inlines_hh
+#define PPL_Sum_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::Sum_Floating_Point_Expression(
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+         Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y)
+  : first_operand(x), second_operand(y) {
+  assert(x != 0);
+  assert(y != 0);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::~Sum_Floating_Point_Expression() {
+  delete first_operand;
+  delete second_operand;
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  using std::swap;
+  swap(first_operand, y.first_operand);
+  swap(second_operand, y.second_operand);
+}
+
+/*! \relates Sum_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Sum_Floating_Point_Expression_inlines_hh)
diff --git a/src/Sum_Floating_Point_Expression_templates.hh b/src/Sum_Floating_Point_Expression_templates.hh
new file mode 100644
index 0000000..e1d4a62
--- /dev/null
+++ b/src/Sum_Floating_Point_Expression_templates.hh
@@ -0,0 +1,53 @@
+/* Sum_Floating_Point_Expression class implementation:
+   non-inline template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Sum_Floating_Point_Expression_templates_hh
+#define PPL_Sum_Floating_Point_Expression_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+bool Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store& int_store,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  if (!first_operand->linearize(int_store, lf_store, result))
+    return false;
+  FP_Linear_Form rel_error;
+  relative_error(result, rel_error);
+  result += rel_error;
+  FP_Linear_Form linearized_second_operand;
+  if (!second_operand->linearize(int_store, lf_store,
+                                linearized_second_operand))
+    return false;
+  result += linearized_second_operand;
+  relative_error(linearized_second_operand, rel_error);
+  result += rel_error;
+  result += this->absolute_error;
+  return !this->overflows(result);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Sum_Floating_Point_Expression_templates_hh)
diff --git a/src/Sum_Floating_Point_Expression_types.hh b/src/Sum_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..4597db7
--- /dev/null
+++ b/src/Sum_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Sum_Floating_Point_Expression_types_hh
+#define PPL_Sum_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Sum_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Sum_Floating_Point_Expression_types_hh)
diff --git a/src/Swapping_Vector.defs.hh b/src/Swapping_Vector.defs.hh
deleted file mode 100644
index aeea888..0000000
--- a/src/Swapping_Vector.defs.hh
+++ /dev/null
@@ -1,98 +0,0 @@
-/* Swapping_Vector class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Swapping_Vector_defs_hh
-#define PPL_Swapping_Vector_defs_hh 1
-
-#include "Swapping_Vector.types.hh"
-#include "globals.defs.hh"
-
-#include <vector>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A wrapper for std::vector that calls a swap() method instead of copying
-//! elements, when possible.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Swapping_Vector {
-
-public:
-  typedef typename std::vector<T>::const_iterator const_iterator;
-  typedef typename std::vector<T>::iterator iterator;
-  typedef typename std::vector<T>::size_type size_type;
-
-  Swapping_Vector();
-  explicit Swapping_Vector(dimension_type new_size);
-  Swapping_Vector(dimension_type new_size, const T& x);
-
-  void clear();
-  void reserve(dimension_type new_capacity);
-  void resize(dimension_type new_size);
-  void resize(dimension_type new_size, const T& x);
-
-  dimension_type size() const;
-  dimension_type capacity() const;
-  bool empty() const;
-
-  void m_swap(Swapping_Vector& v);
-
-  T& operator[](dimension_type i);
-  const T& operator[](dimension_type i) const;
-
-  T& back();
-  const T& back() const;
-
-  void push_back(const T& x);
-  void pop_back();
-
-  iterator begin();
-  iterator end();
-  const_iterator begin() const;
-  const_iterator end() const;
-
-  iterator erase(iterator itr);
-  iterator erase(iterator first, iterator last);
-
-  // This is defined only if T has an external_memory_in_bytes() method.
-  memory_size_type external_memory_in_bytes() const;
-
-  dimension_type max_num_rows();
-
-private:
-  std::vector<T> impl;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \relates Swapping_Vector */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-void swap(Swapping_Vector<T>& x, Swapping_Vector<T>& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Swapping_Vector.inlines.hh"
-
-#endif // !defined(PPL_Swapping_Vector_defs_hh)
diff --git a/src/Swapping_Vector.inlines.hh b/src/Swapping_Vector.inlines.hh
deleted file mode 100644
index b02e825..0000000
--- a/src/Swapping_Vector.inlines.hh
+++ /dev/null
@@ -1,234 +0,0 @@
-/* Swapping_Vector class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Swapping_Vector_inlines_hh
-#define PPL_Swapping_Vector_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline
-Swapping_Vector<T>::Swapping_Vector()
-  : impl() {
-}
-
-template <typename T>
-inline
-Swapping_Vector<T>::Swapping_Vector(dimension_type i)
-  : impl() {
-  // NOTE: This is not the same as constructing impl as `impl(i)', because
-  // this implementation calls compute_capacity().
-  resize(i);
-}
-
-template <typename T>
-inline
-Swapping_Vector<T>::Swapping_Vector(dimension_type new_size, const T& x)
-  : impl() {
-  resize(new_size, x);
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::clear() {
-  impl.clear();
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::reserve(dimension_type new_capacity) {
-  if (impl.capacity() < new_capacity) {
-    // Reallocation will take place.
-    std::vector<T> new_impl;
-
-    new_impl.reserve(compute_capacity(new_capacity, max_num_rows()));
-    new_impl.resize(impl.size());
-
-    using std::swap;
-
-    // Steal the old elements.
-    for (dimension_type i = impl.size(); i-- > 0; )
-      swap(new_impl[i], impl[i]);
-
-    // Put the new vector into place.
-    swap(impl, new_impl);
-  }
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::resize(dimension_type new_size) {
-  reserve(new_size);
-  impl.resize(new_size);
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::resize(dimension_type new_size, const T& x) {
-  reserve(new_size);
-  impl.resize(new_size, x);
-}
-
-template <typename T>
-inline dimension_type
-Swapping_Vector<T>::size() const {
-  return impl.size();
-}
-
-template <typename T>
-inline dimension_type
-Swapping_Vector<T>::capacity() const {
-  return impl.capacity();
-}
-
-template <typename T>
-inline bool
-Swapping_Vector<T>::empty() const {
-  return impl.empty();
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::m_swap(Swapping_Vector& v) {
-  using std::swap;
-  swap(impl, v.impl);
-}
-
-template <typename T>
-inline T&
-Swapping_Vector<T>::operator[](dimension_type i) {
-  return impl[i];
-}
-
-template <typename T>
-inline const T&
-Swapping_Vector<T>::operator[](dimension_type i) const {
-  return impl[i];
-}
-
-template <typename T>
-inline T&
-Swapping_Vector<T>::back() {
-  return impl.back();
-}
-
-template <typename T>
-inline const T&
-Swapping_Vector<T>::back() const {
-  return impl.back();
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::push_back(const T& x) {
-  reserve(size() + 1);
-  impl.push_back(x);
-}
-
-template <typename T>
-inline void
-Swapping_Vector<T>::pop_back() {
-  impl.pop_back();
-}
-
-template <typename T>
-inline memory_size_type
-Swapping_Vector<T>::external_memory_in_bytes() const {
-  // Estimate the size of vector.
-  memory_size_type n = impl.capacity() * sizeof(T);
-  for (const_iterator i = begin(), i_end = end(); i != i_end; ++i)
-    n += i->external_memory_in_bytes();
-  return n;
-}
-
-template <typename T>
-inline typename Swapping_Vector<T>::iterator
-Swapping_Vector<T>::begin() {
-  return impl.begin();
-}
-
-template <typename T>
-inline typename Swapping_Vector<T>::iterator
-Swapping_Vector<T>::end() {
-  return impl.end();
-}
-
-template <typename T>
-inline typename Swapping_Vector<T>::const_iterator
-Swapping_Vector<T>::begin() const {
-  return impl.begin();
-}
-
-template <typename T>
-inline typename Swapping_Vector<T>::const_iterator
-Swapping_Vector<T>::end() const {
-  return impl.end();
-}
-
-template <typename T>
-inline typename Swapping_Vector<T>::iterator
-Swapping_Vector<T>::erase(iterator itr) {
-  PPL_ASSERT(itr >= begin());
-  PPL_ASSERT(itr < end());
-  const dimension_type old_i = itr - begin();
-  dimension_type i = old_i;
-  ++i;
-  while (i != size())
-    swap(impl[i-1], impl[i]);
-  impl.pop_back();
-  return begin() + old_i;
-}
-
-template <typename T>
-inline typename Swapping_Vector<T>::iterator
-Swapping_Vector<T>::erase(iterator first, iterator last) {
-  PPL_ASSERT(begin() <= first);
-  PPL_ASSERT(first <= last);
-  PPL_ASSERT(last <= end());
-  const iterator old_first = first;
-  typedef typename std::iterator_traits<iterator>::difference_type diff_t;
-  const diff_t k = last - first;
-  const dimension_type n = static_cast<dimension_type>(end() - last);
-  using std::swap;
-  for (dimension_type i = 0; i < n; ++i, ++first)
-    swap(*first, *(first + k));
-  impl.erase(end() - k, end());
-  return old_first;
-}
-
-template <typename T>
-inline dimension_type
-Swapping_Vector<T>::max_num_rows() {
-  return impl.max_size();
-}
-
-template <typename T>
-inline void
-swap(Swapping_Vector<T>& vec1, Swapping_Vector<T>& vec2) {
-  vec1.m_swap(vec2);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-
-#endif // !defined(PPL_Swapping_Vector_inlines_hh)
diff --git a/src/Swapping_Vector.types.hh b/src/Swapping_Vector.types.hh
deleted file mode 100644
index 5135027..0000000
--- a/src/Swapping_Vector.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Swapping_Vector_types_hh
-#define PPL_Swapping_Vector_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-class Swapping_Vector;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Swapping_Vector_types_hh)
diff --git a/src/Swapping_Vector_defs.hh b/src/Swapping_Vector_defs.hh
new file mode 100644
index 0000000..870ac65
--- /dev/null
+++ b/src/Swapping_Vector_defs.hh
@@ -0,0 +1,98 @@
+/* Swapping_Vector class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Swapping_Vector_defs_hh
+#define PPL_Swapping_Vector_defs_hh 1
+
+#include "Swapping_Vector_types.hh"
+#include "globals_defs.hh"
+
+#include <vector>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A wrapper for std::vector that calls a swap() method instead of copying
+//! elements, when possible.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Swapping_Vector {
+
+public:
+  typedef typename std::vector<T>::const_iterator const_iterator;
+  typedef typename std::vector<T>::iterator iterator;
+  typedef typename std::vector<T>::size_type size_type;
+
+  Swapping_Vector();
+  explicit Swapping_Vector(dimension_type new_size);
+  Swapping_Vector(dimension_type new_size, const T& x);
+
+  void clear();
+  void reserve(dimension_type new_capacity);
+  void resize(dimension_type new_size);
+  void resize(dimension_type new_size, const T& x);
+
+  dimension_type size() const;
+  dimension_type capacity() const;
+  bool empty() const;
+
+  void m_swap(Swapping_Vector& v);
+
+  T& operator[](dimension_type i);
+  const T& operator[](dimension_type i) const;
+
+  T& back();
+  const T& back() const;
+
+  void push_back(const T& x);
+  void pop_back();
+
+  iterator begin();
+  iterator end();
+  const_iterator begin() const;
+  const_iterator end() const;
+
+  iterator erase(iterator itr);
+  iterator erase(iterator first, iterator last);
+
+  // This is defined only if T has an external_memory_in_bytes() method.
+  memory_size_type external_memory_in_bytes() const;
+
+  dimension_type max_num_rows();
+
+private:
+  std::vector<T> impl;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \relates Swapping_Vector */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+void swap(Swapping_Vector<T>& x, Swapping_Vector<T>& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Swapping_Vector_inlines.hh"
+
+#endif // !defined(PPL_Swapping_Vector_defs_hh)
diff --git a/src/Swapping_Vector_inlines.hh b/src/Swapping_Vector_inlines.hh
new file mode 100644
index 0000000..8754102
--- /dev/null
+++ b/src/Swapping_Vector_inlines.hh
@@ -0,0 +1,234 @@
+/* Swapping_Vector class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Swapping_Vector_inlines_hh
+#define PPL_Swapping_Vector_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+Swapping_Vector<T>::Swapping_Vector()
+  : impl() {
+}
+
+template <typename T>
+inline
+Swapping_Vector<T>::Swapping_Vector(dimension_type i)
+  : impl() {
+  // NOTE: This is not the same as constructing impl as `impl(i)', because
+  // this implementation calls compute_capacity().
+  resize(i);
+}
+
+template <typename T>
+inline
+Swapping_Vector<T>::Swapping_Vector(dimension_type new_size, const T& x)
+  : impl() {
+  resize(new_size, x);
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::clear() {
+  impl.clear();
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::reserve(dimension_type new_capacity) {
+  if (impl.capacity() < new_capacity) {
+    // Reallocation will take place.
+    std::vector<T> new_impl;
+
+    new_impl.reserve(compute_capacity(new_capacity, max_num_rows()));
+    new_impl.resize(impl.size());
+
+    using std::swap;
+
+    // Steal the old elements.
+    for (dimension_type i = impl.size(); i-- > 0; )
+      swap(new_impl[i], impl[i]);
+
+    // Put the new vector into place.
+    swap(impl, new_impl);
+  }
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::resize(dimension_type new_size) {
+  reserve(new_size);
+  impl.resize(new_size);
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::resize(dimension_type new_size, const T& x) {
+  reserve(new_size);
+  impl.resize(new_size, x);
+}
+
+template <typename T>
+inline dimension_type
+Swapping_Vector<T>::size() const {
+  return impl.size();
+}
+
+template <typename T>
+inline dimension_type
+Swapping_Vector<T>::capacity() const {
+  return impl.capacity();
+}
+
+template <typename T>
+inline bool
+Swapping_Vector<T>::empty() const {
+  return impl.empty();
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::m_swap(Swapping_Vector& v) {
+  using std::swap;
+  swap(impl, v.impl);
+}
+
+template <typename T>
+inline T&
+Swapping_Vector<T>::operator[](dimension_type i) {
+  return impl[i];
+}
+
+template <typename T>
+inline const T&
+Swapping_Vector<T>::operator[](dimension_type i) const {
+  return impl[i];
+}
+
+template <typename T>
+inline T&
+Swapping_Vector<T>::back() {
+  return impl.back();
+}
+
+template <typename T>
+inline const T&
+Swapping_Vector<T>::back() const {
+  return impl.back();
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::push_back(const T& x) {
+  reserve(size() + 1);
+  impl.push_back(x);
+}
+
+template <typename T>
+inline void
+Swapping_Vector<T>::pop_back() {
+  impl.pop_back();
+}
+
+template <typename T>
+inline memory_size_type
+Swapping_Vector<T>::external_memory_in_bytes() const {
+  // Estimate the size of vector.
+  memory_size_type n = impl.capacity() * sizeof(T);
+  for (const_iterator i = begin(), i_end = end(); i != i_end; ++i)
+    n += i->external_memory_in_bytes();
+  return n;
+}
+
+template <typename T>
+inline typename Swapping_Vector<T>::iterator
+Swapping_Vector<T>::begin() {
+  return impl.begin();
+}
+
+template <typename T>
+inline typename Swapping_Vector<T>::iterator
+Swapping_Vector<T>::end() {
+  return impl.end();
+}
+
+template <typename T>
+inline typename Swapping_Vector<T>::const_iterator
+Swapping_Vector<T>::begin() const {
+  return impl.begin();
+}
+
+template <typename T>
+inline typename Swapping_Vector<T>::const_iterator
+Swapping_Vector<T>::end() const {
+  return impl.end();
+}
+
+template <typename T>
+inline typename Swapping_Vector<T>::iterator
+Swapping_Vector<T>::erase(iterator itr) {
+  PPL_ASSERT(itr >= begin());
+  PPL_ASSERT(itr < end());
+  const dimension_type old_i = itr - begin();
+  dimension_type i = old_i;
+  ++i;
+  while (i != size())
+    swap(impl[i-1], impl[i]);
+  impl.pop_back();
+  return begin() + old_i;
+}
+
+template <typename T>
+inline typename Swapping_Vector<T>::iterator
+Swapping_Vector<T>::erase(iterator first, iterator last) {
+  PPL_ASSERT(begin() <= first);
+  PPL_ASSERT(first <= last);
+  PPL_ASSERT(last <= end());
+  const iterator old_first = first;
+  typedef typename std::iterator_traits<iterator>::difference_type diff_t;
+  const diff_t k = last - first;
+  const dimension_type n = static_cast<dimension_type>(end() - last);
+  using std::swap;
+  for (dimension_type i = 0; i < n; ++i, ++first)
+    swap(*first, *(first + k));
+  impl.erase(end() - k, end());
+  return old_first;
+}
+
+template <typename T>
+inline dimension_type
+Swapping_Vector<T>::max_num_rows() {
+  return impl.max_size();
+}
+
+template <typename T>
+inline void
+swap(Swapping_Vector<T>& vec1, Swapping_Vector<T>& vec2) {
+  vec1.m_swap(vec2);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+
+#endif // !defined(PPL_Swapping_Vector_inlines_hh)
diff --git a/src/Swapping_Vector_types.hh b/src/Swapping_Vector_types.hh
new file mode 100644
index 0000000..98a587e
--- /dev/null
+++ b/src/Swapping_Vector_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Swapping_Vector_types_hh
+#define PPL_Swapping_Vector_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+class Swapping_Vector;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Swapping_Vector_types_hh)
diff --git a/src/Temp.defs.hh b/src/Temp.defs.hh
deleted file mode 100644
index 89b934e..0000000
--- a/src/Temp.defs.hh
+++ /dev/null
@@ -1,143 +0,0 @@
-/* Temp_* classes declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Temp_defs_hh
-#define PPL_Temp_defs_hh 1
-
-#include "meta_programming.hh"
-#include "Slow_Copy.hh"
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A pool of temporary items of type \p T.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Temp_Item {
-public:
-  //! Obtains a reference to a temporary item.
-  static Temp_Item& obtain();
-
-  //! Releases the temporary item \p p.
-  static void release(Temp_Item& p);
-
-  //! Returns a reference to the encapsulated item.
-  T& item();
-
-private:
-  //! The encapsulated item.
-  T item_;
-
-  //! Pointer to the next item in the free list.
-  Temp_Item* next;
-
-  //! Head of the free list.
-  static Temp_Item* free_list_head;
-
-  //! Default constructor.
-  Temp_Item();
-
-  //! Copy constructor: private and intentionally not implemented.
-  Temp_Item(const Temp_Item&);
-
-  //! Assignment operator: private and intentionally not implemented.
-  Temp_Item& operator=(const Temp_Item&);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! An holder for a reference to a temporary object.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Temp_Reference_Holder {
-public:
-  //! Constructs an holder holding a dirty temp.
-  Temp_Reference_Holder();
-
-  //! Destructor.
-  ~Temp_Reference_Holder();
-
-  //! Returns a reference to the held item.
-  T& item();
-
-private:
-  //! Copy constructor: private and intentionally not implemented.
-  Temp_Reference_Holder(const Temp_Reference_Holder&);
-
-  //! Assignment operator: private and intentionally not implemented.
-  Temp_Reference_Holder& operator=(const Temp_Reference_Holder&);
-
-  //! The held item, encapsulated.
-  Temp_Item<T>& held;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! An (fake) holder for the value of a temporary object.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Temp_Value_Holder {
-public:
-  //! Constructs a fake holder.
-  Temp_Value_Holder();
-
-  //! Returns the value of the held item.
-  T& item();
-
-private:
-  //! Copy constructor: private and intentionally not implemented.
-  Temp_Value_Holder(const Temp_Value_Holder&);
-
-  //! Assignment operator: private and intentionally not implemented.
-  Temp_Value_Holder& operator=(const Temp_Value_Holder&);
-
-  //! The held item.
-  T item_;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A structure for the efficient handling of temporaries.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T, typename Enable = void>
-class Dirty_Temp;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Specialization for the handling of temporaries with a free list.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Dirty_Temp<T, typename Enable_If<Slow_Copy<T>::value>::type>
-  : public Temp_Reference_Holder<T> {
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Specialization for the handling of temporaries with local variables.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-class Dirty_Temp<T, typename Enable_If<!Slow_Copy<T>::value>::type>
-  : public Temp_Value_Holder<T> {
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Temp.inlines.hh"
-#include "Temp.templates.hh"
-
-#endif // !defined(PPL_Temp_defs_hh)
diff --git a/src/Temp.inlines.hh b/src/Temp.inlines.hh
deleted file mode 100644
index 5dd7152..0000000
--- a/src/Temp.inlines.hh
+++ /dev/null
@@ -1,97 +0,0 @@
-/* Temp_* classes implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Temp_inlines_hh
-#define PPL_Temp_inlines_hh 1
-
-#include "meta_programming.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-inline
-Temp_Item<T>::Temp_Item()
-  : item_() {
-}
-
-template <typename T>
-inline T&
-Temp_Item<T>::item() {
-    return item_;
-}
-
-template <typename T>
-inline Temp_Item<T>&
-Temp_Item<T>::obtain() {
-  if (free_list_head != 0) {
-    Temp_Item* p = free_list_head;
-    free_list_head = free_list_head->next;
-    return *p;
-  }
-  else
-    return *new Temp_Item();
-}
-
-template <typename T>
-inline void
-Temp_Item<T>::release(Temp_Item& p) {
-  p.next = free_list_head;
-  free_list_head = &p;
-}
-
-template <typename T>
-inline
-Temp_Reference_Holder<T>::Temp_Reference_Holder()
-  : held(Temp_Item<T>::obtain()) {
-}
-
-template <typename T>
-inline
-Temp_Reference_Holder<T>::~Temp_Reference_Holder() {
-  Temp_Item<T>::release(held);
-}
-
-template <typename T>
-inline T&
-Temp_Reference_Holder<T>::item() {
-  return held.item();
-}
-
-template <typename T>
-inline
-Temp_Value_Holder<T>::Temp_Value_Holder() {
-}
-
-template <typename T>
-inline T&
-Temp_Value_Holder<T>::item() {
-  return item_;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#define PPL_DIRTY_TEMP(T, id)						\
-  Parma_Polyhedra_Library::Dirty_Temp<PPL_U(T)> holder_ ## id;          \
-  PPL_U(T)& PPL_U(id) = holder_ ## id.item()
-
-#endif // !defined(PPL_Temp_inlines_hh)
diff --git a/src/Temp.templates.hh b/src/Temp.templates.hh
deleted file mode 100644
index 741a40c..0000000
--- a/src/Temp.templates.hh
+++ /dev/null
@@ -1,34 +0,0 @@
-/* Temp_* classes implementation: non-inline template members.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Temp_templates_hh
-#define PPL_Temp_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T>
-Temp_Item<T>* Temp_Item<T>::free_list_head = 0;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Temp_templates_hh)
diff --git a/src/Temp_defs.hh b/src/Temp_defs.hh
new file mode 100644
index 0000000..fbffd7f
--- /dev/null
+++ b/src/Temp_defs.hh
@@ -0,0 +1,143 @@
+/* Temp_* classes declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Temp_defs_hh
+#define PPL_Temp_defs_hh 1
+
+#include "meta_programming.hh"
+#include "Slow_Copy.hh"
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A pool of temporary items of type \p T.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Temp_Item {
+public:
+  //! Obtains a reference to a temporary item.
+  static Temp_Item& obtain();
+
+  //! Releases the temporary item \p p.
+  static void release(Temp_Item& p);
+
+  //! Returns a reference to the encapsulated item.
+  T& item();
+
+private:
+  //! The encapsulated item.
+  T item_;
+
+  //! Pointer to the next item in the free list.
+  Temp_Item* next;
+
+  //! Head of the free list.
+  static Temp_Item* free_list_head;
+
+  //! Default constructor.
+  Temp_Item();
+
+  //! Copy constructor: private and intentionally not implemented.
+  Temp_Item(const Temp_Item&);
+
+  //! Assignment operator: private and intentionally not implemented.
+  Temp_Item& operator=(const Temp_Item&);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An holder for a reference to a temporary object.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Temp_Reference_Holder {
+public:
+  //! Constructs an holder holding a dirty temp.
+  Temp_Reference_Holder();
+
+  //! Destructor.
+  ~Temp_Reference_Holder();
+
+  //! Returns a reference to the held item.
+  T& item();
+
+private:
+  //! Copy constructor: private and intentionally not implemented.
+  Temp_Reference_Holder(const Temp_Reference_Holder&);
+
+  //! Assignment operator: private and intentionally not implemented.
+  Temp_Reference_Holder& operator=(const Temp_Reference_Holder&);
+
+  //! The held item, encapsulated.
+  Temp_Item<T>& held;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An (fake) holder for the value of a temporary object.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Temp_Value_Holder {
+public:
+  //! Constructs a fake holder.
+  Temp_Value_Holder();
+
+  //! Returns the value of the held item.
+  T& item();
+
+private:
+  //! Copy constructor: private and intentionally not implemented.
+  Temp_Value_Holder(const Temp_Value_Holder&);
+
+  //! Assignment operator: private and intentionally not implemented.
+  Temp_Value_Holder& operator=(const Temp_Value_Holder&);
+
+  //! The held item.
+  T item_;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A structure for the efficient handling of temporaries.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T, typename Enable = void>
+class Dirty_Temp;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Specialization for the handling of temporaries with a free list.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Dirty_Temp<T, typename Enable_If<Slow_Copy<T>::value>::type>
+  : public Temp_Reference_Holder<T> {
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Specialization for the handling of temporaries with local variables.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Dirty_Temp<T, typename Enable_If<!Slow_Copy<T>::value>::type>
+  : public Temp_Value_Holder<T> {
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Temp_inlines.hh"
+#include "Temp_templates.hh"
+
+#endif // !defined(PPL_Temp_defs_hh)
diff --git a/src/Temp_inlines.hh b/src/Temp_inlines.hh
new file mode 100644
index 0000000..036d8ea
--- /dev/null
+++ b/src/Temp_inlines.hh
@@ -0,0 +1,97 @@
+/* Temp_* classes implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Temp_inlines_hh
+#define PPL_Temp_inlines_hh 1
+
+#include "meta_programming.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+Temp_Item<T>::Temp_Item()
+  : item_() {
+}
+
+template <typename T>
+inline T&
+Temp_Item<T>::item() {
+    return item_;
+}
+
+template <typename T>
+inline Temp_Item<T>&
+Temp_Item<T>::obtain() {
+  if (free_list_head != 0) {
+    Temp_Item* const p = free_list_head;
+    free_list_head = free_list_head->next;
+    return *p;
+  }
+  else
+    return *new Temp_Item();
+}
+
+template <typename T>
+inline void
+Temp_Item<T>::release(Temp_Item& p) {
+  p.next = free_list_head;
+  free_list_head = &p;
+}
+
+template <typename T>
+inline
+Temp_Reference_Holder<T>::Temp_Reference_Holder()
+  : held(Temp_Item<T>::obtain()) {
+}
+
+template <typename T>
+inline
+Temp_Reference_Holder<T>::~Temp_Reference_Holder() {
+  Temp_Item<T>::release(held);
+}
+
+template <typename T>
+inline T&
+Temp_Reference_Holder<T>::item() {
+  return held.item();
+}
+
+template <typename T>
+inline
+Temp_Value_Holder<T>::Temp_Value_Holder() {
+}
+
+template <typename T>
+inline T&
+Temp_Value_Holder<T>::item() {
+  return item_;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#define PPL_DIRTY_TEMP(T, id)                                           \
+  Parma_Polyhedra_Library::Dirty_Temp<PPL_U(T)> holder_ ## id;          \
+  PPL_U(T)& PPL_U(id) = holder_ ## id.item()
+
+#endif // !defined(PPL_Temp_inlines_hh)
diff --git a/src/Temp_templates.hh b/src/Temp_templates.hh
new file mode 100644
index 0000000..fe31aa0
--- /dev/null
+++ b/src/Temp_templates.hh
@@ -0,0 +1,34 @@
+/* Temp_* classes implementation: non-inline template members.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Temp_templates_hh
+#define PPL_Temp_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+Temp_Item<T>* Temp_Item<T>::free_list_head = 0;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Temp_templates_hh)
diff --git a/src/Threshold_Watcher.cc b/src/Threshold_Watcher.cc
index 70a0a2c..4444a63 100644
--- a/src/Threshold_Watcher.cc
+++ b/src/Threshold_Watcher.cc
@@ -1,7 +1,7 @@
 /* Threshold_Watcher and associated classes' implementation
    (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,5 +23,5 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Threshold_Watcher.defs.hh"
+#include "Threshold_Watcher_defs.hh"
 
diff --git a/src/Threshold_Watcher.defs.hh b/src/Threshold_Watcher.defs.hh
deleted file mode 100644
index 4896adc..0000000
--- a/src/Threshold_Watcher.defs.hh
+++ /dev/null
@@ -1,96 +0,0 @@
-/* Threshold_Watcher and associated classes' declaration and inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Threshold_Watcher_defs_hh
-#define PPL_Threshold_Watcher_defs_hh 1
-
-#include "Threshold_Watcher.types.hh"
-#include "Handler.types.hh"
-#include "Pending_List.defs.hh"
-#include <cassert>
-
-/*! \brief
-  A class of watchdogs controlling the exceeding of a threshold.
-
-  \tparam Traits
-  A class to set data types and functions for the threshold handling.
-  See \c Parma_Polyhedra_Library::Weightwatch_Traits for an example.
-*/
-template <typename Traits>
-class Parma_Polyhedra_Library::Threshold_Watcher {
-public:
-  template <typename Flag_Base, typename Flag>
-  Threshold_Watcher(const typename Traits::Delta& delta,
-                    const Flag_Base* volatile& holder,
-                    Flag& flag);
-
-  Threshold_Watcher(const typename Traits::Delta& delta,
-                    void (*function)());
-
-  ~Threshold_Watcher();
-
-private:
-  typedef Implementation::Watchdog::Pending_List<Traits> TW_Pending_List;
-  typedef Implementation::Watchdog::Handler TW_Handler;
-
-  bool expired;
-  const TW_Handler& handler;
-  typename TW_Pending_List::Iterator pending_position;
-
-  // Just to prevent their use.
-  Threshold_Watcher(const Threshold_Watcher&);
-  Threshold_Watcher& operator=(const Threshold_Watcher&);
-
-  struct Initialize {
-    //! The ordered queue of pending thresholds.
-    TW_Pending_List pending;
-  };
-  static Initialize init;
-
-  // Handle the addition of a new threshold.
-  static typename TW_Pending_List::Iterator
-  add_threshold(typename Traits::Threshold threshold,
-		const TW_Handler& handler,
-		bool& expired_flag);
-
-  // Handle the removal of a threshold.
-  static typename TW_Pending_List::Iterator
-  remove_threshold(typename TW_Pending_List::Iterator position);
-
-  //! Check threshold reaching.
-  static void check();
-
-}; // class Parma_Polyhedra_Library::Threshold_Watcher
-
-
-// Templatic initialization of static data member.
-template <typename Traits>
-typename
-Parma_Polyhedra_Library::Threshold_Watcher<Traits>::Initialize
-Parma_Polyhedra_Library::Threshold_Watcher<Traits>::init;
-
-#include "Threshold_Watcher.inlines.hh"
-#include "Threshold_Watcher.templates.hh"
-
-#endif // !defined(PPL_Threshold_Watcher_defs_hh)
-
diff --git a/src/Threshold_Watcher.inlines.hh b/src/Threshold_Watcher.inlines.hh
deleted file mode 100644
index 3c5267f..0000000
--- a/src/Threshold_Watcher.inlines.hh
+++ /dev/null
@@ -1,66 +0,0 @@
-/* Threshold_Watcher and associated classes' implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Threshold_Watcher_inlines_hh
-#define PPL_Threshold_Watcher_inlines_hh 1
-
-#include <stdexcept>
-
-#include "Handler.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Traits>
-template <typename Flag_Base, typename Flag>
-Threshold_Watcher<Traits>
-::Threshold_Watcher(const typename Traits::Delta& delta,
-                    const Flag_Base* volatile& holder,
-                    Flag& flag)
-  : expired(false),
-    handler(*new
-            Implementation::Watchdog::Handler_Flag<Flag_Base, Flag>(holder,
-                                                                    flag)) {
-  typename Traits::Threshold threshold;
-  Traits::from_delta(threshold, delta);
-  if (!Traits::less_than(Traits::get(), threshold))
-    throw std::invalid_argument("Threshold_Watcher constructor called with a"
-				" threshold already reached");
-  pending_position = add_threshold(threshold, handler, expired);
-}
-
-template <typename Traits>
-inline
-Threshold_Watcher<Traits>::Threshold_Watcher(const typename Traits::Delta& delta, void (*function)())
-  : expired(false),
-    handler(*new Implementation::Watchdog::Handler_Function(function)) {
-  typename Traits::Threshold threshold;
-  Traits::from_delta(threshold, delta);
-  if (!Traits::less_than(Traits::get(), threshold))
-    throw std::invalid_argument("Threshold_Watcher constructor called with a"
-				" threshold already reached");
-  pending_position = add_threshold(threshold, handler, expired);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Threshold_Watcher_inlines_hh)
diff --git a/src/Threshold_Watcher.templates.hh b/src/Threshold_Watcher.templates.hh
deleted file mode 100644
index 24692a9..0000000
--- a/src/Threshold_Watcher.templates.hh
+++ /dev/null
@@ -1,72 +0,0 @@
-/* Threshold_Watcher and associated classes'.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Threshold_Watcher_templates_hh
-#define PPL_Threshold_Watcher_templates_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Traits>
-typename Threshold_Watcher<Traits>::TW_Pending_List::Iterator
-Threshold_Watcher<Traits>::add_threshold(typename Traits::Threshold threshold,
-                                         const TW_Handler& handler,
-                                         bool& expired_flag) {
-  Traits::check_function = Threshold_Watcher::check;
-  return init.pending.insert(threshold, handler, expired_flag);
-}
-
-template <typename Traits>
-typename Threshold_Watcher<Traits>::TW_Pending_List::Iterator
-Threshold_Watcher<Traits>
-::remove_threshold(typename TW_Pending_List::Iterator position) {
-  typename TW_Pending_List::Iterator i = init.pending.erase(position);
-  if (init.pending.empty())
-    Traits::check_function = 0;
-  return i;
-}
-
-template <typename Traits>
-Threshold_Watcher<Traits>::~Threshold_Watcher() {
-  if (!expired)
-    remove_threshold(pending_position);
-  delete &handler;
-}
-
-template <typename Traits>
-void
-Threshold_Watcher<Traits>::check() {
-  typename TW_Pending_List::Iterator i = init.pending.begin();
-  assert(i != init.pending.end());
-  const typename Traits::Threshold& current = Traits::get();
-  while (!Traits::less_than(current, i->deadline())) {
-    i->handler().act();
-    i->expired_flag() = true;
-    i = remove_threshold(i);
-    if (i == init.pending.end())
-      break;
-  }
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Threshold_Watcher_templates_hh)
diff --git a/src/Threshold_Watcher.types.hh b/src/Threshold_Watcher.types.hh
deleted file mode 100644
index 9003f9f..0000000
--- a/src/Threshold_Watcher.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Threshold_Watcher_types_hh
-#define PPL_Threshold_Watcher_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Traits>
-class Threshold_Watcher;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Threshold_Watcher_types_hh)
diff --git a/src/Threshold_Watcher_defs.hh b/src/Threshold_Watcher_defs.hh
new file mode 100644
index 0000000..172c208
--- /dev/null
+++ b/src/Threshold_Watcher_defs.hh
@@ -0,0 +1,96 @@
+/* Threshold_Watcher and associated classes' declaration and inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Threshold_Watcher_defs_hh
+#define PPL_Threshold_Watcher_defs_hh 1
+
+#include "Threshold_Watcher_types.hh"
+#include "Handler_types.hh"
+#include "Pending_List_defs.hh"
+#include <cassert>
+
+/*! \brief
+  A class of watchdogs controlling the exceeding of a threshold.
+
+  \tparam Traits
+  A class to set data types and functions for the threshold handling.
+  See \c Parma_Polyhedra_Library::Weightwatch_Traits for an example.
+*/
+template <typename Traits>
+class Parma_Polyhedra_Library::Threshold_Watcher {
+public:
+  template <typename Flag_Base, typename Flag>
+  Threshold_Watcher(const typename Traits::Delta& delta,
+                    const Flag_Base* volatile& holder,
+                    Flag& flag);
+
+  Threshold_Watcher(const typename Traits::Delta& delta,
+                    void (*function)());
+
+  ~Threshold_Watcher();
+
+private:
+  typedef Implementation::Watchdog::Pending_List<Traits> TW_Pending_List;
+  typedef Implementation::Watchdog::Handler TW_Handler;
+
+  bool expired;
+  const TW_Handler& handler;
+  typename TW_Pending_List::iterator pending_position;
+
+  // Just to prevent their use.
+  Threshold_Watcher(const Threshold_Watcher&);
+  Threshold_Watcher& operator=(const Threshold_Watcher&);
+
+  struct Initialize {
+    //! The ordered queue of pending thresholds.
+    TW_Pending_List pending;
+  };
+  static Initialize init;
+
+  // Handle the addition of a new threshold.
+  static typename TW_Pending_List::iterator
+  add_threshold(typename Traits::Threshold threshold,
+                const TW_Handler& handler,
+                bool& expired_flag);
+
+  // Handle the removal of a threshold.
+  static typename TW_Pending_List::iterator
+  remove_threshold(typename TW_Pending_List::iterator position);
+
+  //! Check threshold reaching.
+  static void check();
+
+}; // class Parma_Polyhedra_Library::Threshold_Watcher
+
+
+// Templatic initialization of static data member.
+template <typename Traits>
+typename
+Parma_Polyhedra_Library::Threshold_Watcher<Traits>::Initialize
+Parma_Polyhedra_Library::Threshold_Watcher<Traits>::init;
+
+#include "Threshold_Watcher_inlines.hh"
+#include "Threshold_Watcher_templates.hh"
+
+#endif // !defined(PPL_Threshold_Watcher_defs_hh)
+
diff --git a/src/Threshold_Watcher_inlines.hh b/src/Threshold_Watcher_inlines.hh
new file mode 100644
index 0000000..5e7c1de
--- /dev/null
+++ b/src/Threshold_Watcher_inlines.hh
@@ -0,0 +1,66 @@
+/* Threshold_Watcher and associated classes' implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Threshold_Watcher_inlines_hh
+#define PPL_Threshold_Watcher_inlines_hh 1
+
+#include <stdexcept>
+
+#include "Handler_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Traits>
+template <typename Flag_Base, typename Flag>
+Threshold_Watcher<Traits>
+::Threshold_Watcher(const typename Traits::Delta& delta,
+                    const Flag_Base* volatile& holder,
+                    Flag& flag)
+  : expired(false),
+    handler(*new
+            Implementation::Watchdog::Handler_Flag<Flag_Base, Flag>(holder,
+                                                                    flag)) {
+  typename Traits::Threshold threshold;
+  Traits::from_delta(threshold, delta);
+  if (!Traits::less_than(Traits::get(), threshold))
+    throw std::invalid_argument("Threshold_Watcher constructor called with a"
+                                " threshold already reached");
+  pending_position = add_threshold(threshold, handler, expired);
+}
+
+template <typename Traits>
+inline
+Threshold_Watcher<Traits>::Threshold_Watcher(const typename Traits::Delta& delta, void (*function)())
+  : expired(false),
+    handler(*new Implementation::Watchdog::Handler_Function(function)) {
+  typename Traits::Threshold threshold;
+  Traits::from_delta(threshold, delta);
+  if (!Traits::less_than(Traits::get(), threshold))
+    throw std::invalid_argument("Threshold_Watcher constructor called with a"
+                                " threshold already reached");
+  pending_position = add_threshold(threshold, handler, expired);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Threshold_Watcher_inlines_hh)
diff --git a/src/Threshold_Watcher_templates.hh b/src/Threshold_Watcher_templates.hh
new file mode 100644
index 0000000..1f3d5e3
--- /dev/null
+++ b/src/Threshold_Watcher_templates.hh
@@ -0,0 +1,72 @@
+/* Threshold_Watcher and associated classes'.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Threshold_Watcher_templates_hh
+#define PPL_Threshold_Watcher_templates_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Traits>
+typename Threshold_Watcher<Traits>::TW_Pending_List::iterator
+Threshold_Watcher<Traits>::add_threshold(typename Traits::Threshold threshold,
+                                         const TW_Handler& handler,
+                                         bool& expired_flag) {
+  Traits::check_function = Threshold_Watcher::check;
+  return init.pending.insert(threshold, handler, expired_flag);
+}
+
+template <typename Traits>
+typename Threshold_Watcher<Traits>::TW_Pending_List::iterator
+Threshold_Watcher<Traits>
+::remove_threshold(typename TW_Pending_List::iterator position) {
+  typename TW_Pending_List::iterator i = init.pending.erase(position);
+  if (init.pending.empty())
+    Traits::check_function = 0;
+  return i;
+}
+
+template <typename Traits>
+Threshold_Watcher<Traits>::~Threshold_Watcher() {
+  if (!expired)
+    remove_threshold(pending_position);
+  delete &handler;
+}
+
+template <typename Traits>
+void
+Threshold_Watcher<Traits>::check() {
+  typename TW_Pending_List::iterator i = init.pending.begin();
+  assert(i != init.pending.end());
+  const typename Traits::Threshold& current = Traits::get();
+  while (!Traits::less_than(current, i->deadline())) {
+    i->handler().act();
+    i->expired_flag() = true;
+    i = remove_threshold(i);
+    if (i == init.pending.end())
+      break;
+  }
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Threshold_Watcher_templates_hh)
diff --git a/src/Threshold_Watcher_types.hh b/src/Threshold_Watcher_types.hh
new file mode 100644
index 0000000..48dbb03
--- /dev/null
+++ b/src/Threshold_Watcher_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Threshold_Watcher_types_hh
+#define PPL_Threshold_Watcher_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Traits>
+class Threshold_Watcher;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Threshold_Watcher_types_hh)
diff --git a/src/Time.cc b/src/Time.cc
index 213df40..1bcf4c3 100644
--- a/src/Time.cc
+++ b/src/Time.cc
@@ -1,6 +1,6 @@
 /* Time class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Time.defs.hh"
+#include "Time_defs.hh"
 
 namespace PPL = Parma_Polyhedra_Library;
 
diff --git a/src/Time.defs.hh b/src/Time.defs.hh
deleted file mode 100644
index 8edb750..0000000
--- a/src/Time.defs.hh
+++ /dev/null
@@ -1,126 +0,0 @@
-/* Time class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Time_defs_hh
-#define PPL_Time_defs_hh 1
-
-#include "Time.types.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
-bool operator==(const Time& x, const Time& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
-bool operator!=(const Time& x, const Time& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x is shorter than \p y.
-bool operator<(const Time& x, const Time& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x is shorter than
-  or equal to \p y.
-*/
-bool operator<=(const Time& x, const Time& y);
-
-//! Returns <CODE>true</CODE> if and only if \p x is longer than \p y.
-bool operator>(const Time& x, const Time& y);
-
-/*! \brief
-  Returns <CODE>true</CODE> if and only if \p x is longer than
-  or equal to \p y.
-*/
-bool operator>=(const Time& x, const Time& y);
-
-//! Returns the sum of \p x and \p y.
-Time operator+(const Time& x, const Time& y);
-
-/*! \brief
-  Returns the difference of \p x and \p y or the null interval,
-  if \p x is shorter than \p y.
-*/
-Time operator-(const Time& x, const Time& y);
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-//! A class for representing and manipulating positive time intervals.
-class Parma_Polyhedra_Library::Implementation::Watchdog::Time {
-public:
-  //! Zero seconds.
-  Time();
-
-  //! Constructor taking a number of centiseconds.
-  explicit Time(long centisecs);
-
-  //! Constructor with seconds and microseconds.
-  Time(long s, long m);
-
-  /*! \brief
-    Returns the number of whole seconds contained in the represented
-    time interval.
-  */
-  long seconds() const;
-
-  /*! \brief
-    Returns the number of microseconds that, when added to the number
-    of seconds returned by seconds(), give the represent time interval.
-  */
-  long microseconds() const;
-
-  //! Adds \p y to \p *this.
-  Time& operator+=(const Time& y);
-
-  /*! \brief
-    Subtracts \p y from \p *this; if \p *this is shorter than \p y,
-    \p *this is set to the null interval.
-  */
-  Time& operator-=(const Time& y);
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-private:
-  //! Number of microseconds in a second.
-  static const long USECS_PER_SEC = 1000000L;
-
-  //! Number of centiseconds in a second.
-  static const long CSECS_PER_SEC = 100L;
-
-  //! Number of seconds.
-  long secs;
-
-  //! Number of microseconds.
-  long microsecs;
-};
-
-#include "Time.inlines.hh"
-
-#endif // !defined(PPL_Time_defs_hh)
diff --git a/src/Time.inlines.hh b/src/Time.inlines.hh
deleted file mode 100644
index af4bc5b..0000000
--- a/src/Time.inlines.hh
+++ /dev/null
@@ -1,155 +0,0 @@
-/* Time class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Time_inlines_hh
-#define PPL_Time_inlines_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-inline
-Time::Time()
-  : secs(0), microsecs(0) {
-  assert(OK());
-}
-
-inline
-Time::Time(long centisecs)
-  : secs(centisecs / CSECS_PER_SEC),
-    microsecs((centisecs % CSECS_PER_SEC) * (USECS_PER_SEC/CSECS_PER_SEC)) {
-  assert(OK());
-}
-
-inline
-Time::Time(long s, long m)
-  : secs(s),
-    microsecs(m) {
-  if (microsecs >= USECS_PER_SEC) {
-    secs += microsecs / USECS_PER_SEC;
-    microsecs %= USECS_PER_SEC;
-  }
-  assert(OK());
-}
-
-inline long
-Time::seconds() const {
-  return secs;
-}
-
-inline long
-Time::microseconds() const {
-  return microsecs;
-}
-
-inline Time&
-Time::operator+=(const Time& y) {
-  long r_secs = secs + y.secs;
-  long r_microsecs = microsecs + y.microsecs;
-  if (r_microsecs >= USECS_PER_SEC) {
-    ++r_secs;
-    r_microsecs %= USECS_PER_SEC;
-  }
-  secs = r_secs;
-  microsecs = r_microsecs;
-  assert(OK());
-  return *this;
-}
-
-inline Time&
-Time::operator-=(const Time& y) {
-  long r_secs = secs - y.secs;
-  long r_microsecs = microsecs - y.microsecs;
-  if (r_microsecs < 0) {
-    --r_secs;
-    r_microsecs += USECS_PER_SEC;
-  }
-  if (r_secs < 0) {
-    r_secs = 0;
-    r_microsecs = 0;
-  }
-  secs = r_secs;
-  microsecs = r_microsecs;
-  assert(OK());
-  return *this;
-}
-
-inline Time
-operator+(const Time& x, const Time& y) {
-  Time z = x;
-  z += y;
-  return z;
-}
-
-inline Time
-operator-(const Time& x, const Time& y) {
-  Time z = x;
-  z -= y;
-  return z;
-}
-
-inline bool
-operator==(const Time& x, const Time& y) {
-  assert(x.OK() && y.OK());
-  return x.seconds() == y.seconds() && y.microseconds() == y.microseconds();
-}
-
-inline bool
-operator!=(const Time& x, const Time& y) {
-  assert(x.OK() && y.OK());
-  return !(x == y);
-}
-
-inline bool
-operator<(const Time& x, const Time& y) {
-  assert(x.OK() && y.OK());
-  return x.seconds() < y.seconds()
-    || (x.seconds() == y.seconds() && x.microseconds() < y.microseconds());
-}
-
-inline bool
-operator<=(const Time& x, const Time& y) {
-  return x < y || x == y;
-}
-
-inline bool
-operator>(const Time& x, const Time& y) {
-  return y < x;
-}
-
-inline bool
-operator>=(const Time& x, const Time& y) {
-  return y <= x;
-}
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Time_inlines_hh)
diff --git a/src/Time.types.hh b/src/Time.types.hh
deleted file mode 100644
index d82822e..0000000
--- a/src/Time.types.hh
+++ /dev/null
@@ -1,30 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Time_types_hh
-#define PPL_Time_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Watchdog {
-
-class Time;
-
-} // namespace Watchdog
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Time_types_hh)
diff --git a/src/Time_defs.hh b/src/Time_defs.hh
new file mode 100644
index 0000000..9aced25
--- /dev/null
+++ b/src/Time_defs.hh
@@ -0,0 +1,126 @@
+/* Time class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Time_defs_hh
+#define PPL_Time_defs_hh 1
+
+#include "Time_types.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
+bool operator==(const Time& x, const Time& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x and \p y are different.
+bool operator!=(const Time& x, const Time& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x is shorter than \p y.
+bool operator<(const Time& x, const Time& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x is shorter than
+  or equal to \p y.
+*/
+bool operator<=(const Time& x, const Time& y);
+
+//! Returns <CODE>true</CODE> if and only if \p x is longer than \p y.
+bool operator>(const Time& x, const Time& y);
+
+/*! \brief
+  Returns <CODE>true</CODE> if and only if \p x is longer than
+  or equal to \p y.
+*/
+bool operator>=(const Time& x, const Time& y);
+
+//! Returns the sum of \p x and \p y.
+Time operator+(const Time& x, const Time& y);
+
+/*! \brief
+  Returns the difference of \p x and \p y or the null interval,
+  if \p x is shorter than \p y.
+*/
+Time operator-(const Time& x, const Time& y);
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+//! A class for representing and manipulating positive time intervals.
+class Parma_Polyhedra_Library::Implementation::Watchdog::Time {
+public:
+  //! Zero seconds.
+  Time();
+
+  //! Constructor taking a number of centiseconds.
+  explicit Time(long centisecs);
+
+  //! Constructor with seconds and microseconds.
+  Time(long s, long m);
+
+  /*! \brief
+    Returns the number of whole seconds contained in the represented
+    time interval.
+  */
+  long seconds() const;
+
+  /*! \brief
+    Returns the number of microseconds that, when added to the number
+    of seconds returned by seconds(), give the represent time interval.
+  */
+  long microseconds() const;
+
+  //! Adds \p y to \p *this.
+  Time& operator+=(const Time& y);
+
+  /*! \brief
+    Subtracts \p y from \p *this; if \p *this is shorter than \p y,
+    \p *this is set to the null interval.
+  */
+  Time& operator-=(const Time& y);
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+private:
+  //! Number of microseconds in a second.
+  static const long USECS_PER_SEC = 1000000L;
+
+  //! Number of centiseconds in a second.
+  static const long CSECS_PER_SEC = 100L;
+
+  //! Number of seconds.
+  long secs;
+
+  //! Number of microseconds.
+  long microsecs;
+};
+
+#include "Time_inlines.hh"
+
+#endif // !defined(PPL_Time_defs_hh)
diff --git a/src/Time_inlines.hh b/src/Time_inlines.hh
new file mode 100644
index 0000000..2485f7c
--- /dev/null
+++ b/src/Time_inlines.hh
@@ -0,0 +1,155 @@
+/* Time class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Time_inlines_hh
+#define PPL_Time_inlines_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+inline
+Time::Time()
+  : secs(0), microsecs(0) {
+  assert(OK());
+}
+
+inline
+Time::Time(long centisecs)
+  : secs(centisecs / CSECS_PER_SEC),
+    microsecs((centisecs % CSECS_PER_SEC) * (USECS_PER_SEC/CSECS_PER_SEC)) {
+  assert(OK());
+}
+
+inline
+Time::Time(long s, long m)
+  : secs(s),
+    microsecs(m) {
+  if (microsecs >= USECS_PER_SEC) {
+    secs += microsecs / USECS_PER_SEC;
+    microsecs %= USECS_PER_SEC;
+  }
+  assert(OK());
+}
+
+inline long
+Time::seconds() const {
+  return secs;
+}
+
+inline long
+Time::microseconds() const {
+  return microsecs;
+}
+
+inline Time&
+Time::operator+=(const Time& y) {
+  long r_secs = secs + y.secs;
+  long r_microsecs = microsecs + y.microsecs;
+  if (r_microsecs >= USECS_PER_SEC) {
+    ++r_secs;
+    r_microsecs %= USECS_PER_SEC;
+  }
+  secs = r_secs;
+  microsecs = r_microsecs;
+  assert(OK());
+  return *this;
+}
+
+inline Time&
+Time::operator-=(const Time& y) {
+  long r_secs = secs - y.secs;
+  long r_microsecs = microsecs - y.microsecs;
+  if (r_microsecs < 0) {
+    --r_secs;
+    r_microsecs += USECS_PER_SEC;
+  }
+  if (r_secs < 0) {
+    r_secs = 0;
+    r_microsecs = 0;
+  }
+  secs = r_secs;
+  microsecs = r_microsecs;
+  assert(OK());
+  return *this;
+}
+
+inline Time
+operator+(const Time& x, const Time& y) {
+  Time z = x;
+  z += y;
+  return z;
+}
+
+inline Time
+operator-(const Time& x, const Time& y) {
+  Time z = x;
+  z -= y;
+  return z;
+}
+
+inline bool
+operator==(const Time& x, const Time& y) {
+  assert(x.OK() && y.OK());
+  return x.seconds() == y.seconds() && y.microseconds() == y.microseconds();
+}
+
+inline bool
+operator!=(const Time& x, const Time& y) {
+  assert(x.OK() && y.OK());
+  return !(x == y);
+}
+
+inline bool
+operator<(const Time& x, const Time& y) {
+  assert(x.OK() && y.OK());
+  return x.seconds() < y.seconds()
+    || (x.seconds() == y.seconds() && x.microseconds() < y.microseconds());
+}
+
+inline bool
+operator<=(const Time& x, const Time& y) {
+  return x < y || x == y;
+}
+
+inline bool
+operator>(const Time& x, const Time& y) {
+  return y < x;
+}
+
+inline bool
+operator>=(const Time& x, const Time& y) {
+  return y <= x;
+}
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Time_inlines_hh)
diff --git a/src/Time_types.hh b/src/Time_types.hh
new file mode 100644
index 0000000..1551ebc
--- /dev/null
+++ b/src/Time_types.hh
@@ -0,0 +1,30 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Time_types_hh
+#define PPL_Time_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Watchdog {
+
+class Time;
+
+} // namespace Watchdog
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Time_types_hh)
diff --git a/src/Topology.types.hh b/src/Topology.types.hh
deleted file mode 100644
index ad0da84..0000000
--- a/src/Topology.types.hh
+++ /dev/null
@@ -1,29 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Topology_types_hh
-#define PPL_Topology_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Kinds of polyhedra domains.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-enum Topology {
-  NECESSARILY_CLOSED = 0,
-  NOT_NECESSARILY_CLOSED = 1
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Topology_types_hh)
diff --git a/src/Topology_types.hh b/src/Topology_types.hh
new file mode 100644
index 0000000..7a60cc1
--- /dev/null
+++ b/src/Topology_types.hh
@@ -0,0 +1,29 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Topology_types_hh
+#define PPL_Topology_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Kinds of polyhedra domains.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+enum Topology {
+  NECESSARILY_CLOSED = 0,
+  NOT_NECESSARILY_CLOSED = 1
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Topology_types_hh)
diff --git a/src/Variable.cc b/src/Variable.cc
index 71e0657..44bf1bb 100644
--- a/src/Variable.cc
+++ b/src/Variable.cc
@@ -1,6 +1,6 @@
 /* Variable class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Variable.defs.hh"
+#include "Variable_defs.hh"
 #include <iostream>
 
 namespace PPL = Parma_Polyhedra_Library;
@@ -37,11 +37,11 @@ PPL::Variable::OK() const {
 
 void
 PPL::Variable::default_output_function(std::ostream& s, const Variable v) {
-  dimension_type varid = v.id();
+  const dimension_type varid = v.id();
   static const char var_name_letters[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
   const dimension_type num_letters = sizeof(var_name_letters) - 1;
   s << var_name_letters[varid % num_letters];
-  if (dimension_type i = varid / num_letters)
+  if (const dimension_type i = varid / num_letters)
     s << i;
 }
 
diff --git a/src/Variable.defs.hh b/src/Variable.defs.hh
deleted file mode 100644
index 961415f..0000000
--- a/src/Variable.defs.hh
+++ /dev/null
@@ -1,156 +0,0 @@
-/* Variable class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Variable_defs_hh
-#define PPL_Variable_defs_hh 1
-
-#include "Variable.types.hh"
-#include "Init.types.hh"
-#include "globals.types.hh"
-#include <iosfwd>
-#include <set>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Variable */
-std::ostream&
-operator<<(std::ostream& s, const Variable v);
-
-} // namespace IO_Operators
-
-//! Defines a total ordering on variables.
-/*! \relates Variable */
-bool less(Variable v, Variable w);
-
-/*! \relates Variable */
-void
-swap(Variable& x, Variable& y);
-
-} // namespace Parma_Polyhedra_Library
-
-//! A dimension of the vector space.
-/*! \ingroup PPL_CXX_interface
-  An object of the class Variable represents a dimension of the space,
-  that is one of the Cartesian axes.
-  Variables are used as basic blocks in order to build
-  more complex linear expressions.
-  Each variable is identified by a non-negative integer,
-  representing the index of the corresponding Cartesian axis
-  (the first axis has index 0).
-  The space dimension of a variable is the dimension of the vector space
-  made by all the Cartesian axes having an index less than or equal to
-  that of the considered variable; thus, if a variable has index \f$i\f$,
-  its space dimension is \f$i+1\f$.
-
-  Note that the ``meaning'' of an object of the class Variable
-  is completely specified by the integer index provided to its
-  constructor:
-  be careful not to be mislead by C++ language variable names.
-  For instance, in the following example the linear expressions
-  <CODE>e1</CODE> and <CODE>e2</CODE> are equivalent,
-  since the two variables <CODE>x</CODE> and <CODE>z</CODE> denote
-  the same Cartesian axis.
-  \code
-  Variable x(0);
-  Variable y(1);
-  Variable z(0);
-  Linear_Expression e1 = x + y;
-  Linear_Expression e2 = y + z;
-  \endcode
-
-*/
-class Parma_Polyhedra_Library::Variable {
-
-public:
-  //! Builds the variable corresponding to the Cartesian axis of index \p i.
-  /*!
-    \exception std::length_error
-    Thrown if <CODE>i+1</CODE> exceeds
-    <CODE>Variable::max_space_dimension()</CODE>.
-  */
-  explicit Variable(dimension_type i);
-
-  //! Returns the index of the Cartesian axis associated to the variable.
-  dimension_type id() const;
-
-  //! Returns the maximum space dimension a Variable can handle.
-  static dimension_type max_space_dimension();
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  /*!
-    The returned value is <CODE>id()+1</CODE>.
-  */
-  dimension_type space_dimension() const;
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  //! Type of output functions.
-  typedef void output_function_type(std::ostream& s, const Variable v);
-
-  //! Sets the output function to be used for printing Variable objects.
-  static void set_output_function(output_function_type* p);
-
-  //! Returns the pointer to the current output function.
-  static output_function_type* get_output_function();
-
-  //! Binary predicate defining the total ordering on variables.
-  /*! \ingroup PPL_CXX_interface */
-  struct Compare {
-    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
-    bool operator()(Variable x, Variable y) const;
-  };
-
-  //! Swaps *this and v.
-  void m_swap(Variable& v);
-
-private:
-  //! The index of the Cartesian axis.
-  dimension_type varid;
-
-  // The initialization class needs to set the default output function.
-  friend class Init;
-
-  friend std::ostream&
-  Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream& s,
-						    const Variable v);
-
-  //! Pointer to the current output function.
-  static output_function_type* current_output_function;
-
-  //! The default output function.
-  static void default_output_function(std::ostream& s, const Variable v);
-};
-
-#include "Variable.inlines.hh"
-
-#endif // !defined(PPL_Variable_defs_hh)
diff --git a/src/Variable.inlines.hh b/src/Variable.inlines.hh
deleted file mode 100644
index f428292..0000000
--- a/src/Variable.inlines.hh
+++ /dev/null
@@ -1,100 +0,0 @@
-/* Variable class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Variable_inlines_hh
-#define PPL_Variable_inlines_hh 1
-
-#include "globals.defs.hh"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-inline dimension_type
-Variable::max_space_dimension() {
-  return not_a_dimension() - 1;
-}
-
-inline
-Variable::Variable(dimension_type i)
-  : varid((i < max_space_dimension())
-	  ? i
-	  : (throw std::length_error("PPL::Variable::Variable(i):\n"
-				     "i exceeds the maximum allowed "
-				     "variable identifier."), i)) {
-}
-
-inline dimension_type
-Variable::id() const {
-  return varid;
-}
-
-inline dimension_type
-Variable::space_dimension() const {
-  return varid + 1;
-}
-
-inline memory_size_type
-Variable::external_memory_in_bytes() const {
-  return 0;
-}
-
-inline memory_size_type
-Variable::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-inline void
-Variable::set_output_function(output_function_type* p) {
-  current_output_function = p;
-}
-
-inline Variable::output_function_type*
-Variable::get_output_function() {
-  return current_output_function;
-}
-
-/*! \relates Variable */
-inline bool
-less(const Variable v, const Variable w) {
-  return v.id() < w.id();
-}
-
-inline bool
-Variable::Compare::operator()(const Variable x, const Variable y) const {
-  return less(x, y);
-}
-
-inline void
-Variable::m_swap(Variable& v) {
-  using std::swap;
-  swap(varid, v.varid);
-}
-
-inline void
-swap(Variable& x, Variable& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Variable_inlines_hh)
diff --git a/src/Variable.types.hh b/src/Variable.types.hh
deleted file mode 100644
index 789b1ec..0000000
--- a/src/Variable.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Variable_types_hh
-#define PPL_Variable_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Variable;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Variable_types_hh)
diff --git a/src/Variable_Floating_Point_Expression.defs.hh b/src/Variable_Floating_Point_Expression.defs.hh
deleted file mode 100644
index 9c7c8d1..0000000
--- a/src/Variable_Floating_Point_Expression.defs.hh
+++ /dev/null
@@ -1,187 +0,0 @@
-/* Declarations for the Variable_Floating_Point_Expression class and
-   its constituents.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Variable_Floating_Point_Expression_defs_hh
-#define PPL_Variable_Floating_Point_Expression_defs_hh 1
-
-#include "Floating_Point_Expression.defs.hh"
-#include "globals.defs.hh"
-#include "Variable_Floating_Point_Expression.types.hh"
-#include <map>
-#include <utility>
-
-namespace Parma_Polyhedra_Library {
-
-//! Swaps \p x with \p y.
-/*! \relates Variable_Floating_Point_Expression */
-template<typename FP_Interval_Type, typename FP_Format>
-void swap(Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-          Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
-
-/*! \brief
-  A generic Variable Floating Point Expression.
-
-  \ingroup PPL_CXX_interface
-
-  \par Template type parameters
-
-  - The class template type parameter \p FP_Interval_Type represents the type
-  of the intervals used in the abstract domain.
-  - The class template type parameter \p FP_Format represents the floating
-  point format used in the concrete domain.
-
-  \par Linearization of floating-point variable expressions
-
-  Given a variable expression \f$v\f$ and a composite
-  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
-  \rrbracket\f$, we construct the interval
-  linear form \f$\linexprenv{v}{\rho^{\#}}{\rho^{\#}_l}\f$ as
-  \f$\rho^{\#}_l(v)\f$ if it is defined; otherwise we construct it as
-  \f$[-1, 1]v\f$.
-*/
-template <typename FP_Interval_Type, typename FP_Format>
-class Variable_Floating_Point_Expression
-: public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
-
-public:
-
-  /*! \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form FP_Linear_Form;
-
-  /*! \brief
-     Alias for the Box<FP_Interval_Type> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
-
-  /*! \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
-  boundary_type;
-
-  /*! \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
-  */
-  typedef typename
-  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
-
-  //! \name Constructors and Destructor
-  //@{
-  /*! \brief
-    Constructor with a parameter: builds the variable floating point
-    expression corresponding to the variable having \p v_index as its index.
-  */
-  explicit Variable_Floating_Point_Expression(const dimension_type v_index);
-
-  //! Destructor.
-  ~Variable_Floating_Point_Expression();
-
-  //@} // Constructors and Destructor
-
-  /*! \brief
-    Linearizes the expression in a given abstract store.
-
-    Makes \p result become the linearization of \p *this in the given
-    composite abstract store.
-
-    \param int_store The interval abstract store.
-    \param lf_store The linear form abstract store.
-    \param result The modified linear form.
-
-    \return <CODE>true</CODE> if the linearization succeeded,
-    <CODE>false</CODE> otherwise.
-
-    Note that the variable in the expression MUST have an associated value
-    in \p int_store. If this precondition is not met, calling the method
-    causes an undefined behavior.
-
-    See the class description for a detailed explanation of how \p result is
-    computed.
-  */
-  bool linearize(const FP_Interval_Abstract_Store& int_store,
-                 const FP_Linear_Form_Abstract_Store& lf_store,
-                 FP_Linear_Form& result) const;
-
-  /*! \brief
-    Assigns a linear form to the variable with the same index of
-    \p *this in a given linear form abstract store.
-
-    \param lf The linear form assigned to the variable.
-    \param lf_store The linear form abstract store.
-
-    Note that once \p lf is assigned to a variable, all the other entries
-    of \p lf_store which contain that variable are discarded.
-  */
-  void linear_form_assign(const FP_Linear_Form& lf,
-                                FP_Linear_Form_Abstract_Store& lf_store) const;
-
-  //! Swaps \p *this with \p y.
-  void m_swap(Variable_Floating_Point_Expression& y);
-
-private:
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited copy constructor.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Variable_Floating_Point_Expression(
-			  const Variable_Floating_Point_Expression& y);
-
-  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief
-    Inhibited assignment operator.
-  */
-  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  Variable_Floating_Point_Expression& operator=(
-		          const Variable_Floating_Point_Expression& y);
-
-  //! The index of the variable.
-  dimension_type variable_index;
-
-}; // class Variable_Floating_Point_Expression
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Variable_Floating_Point_Expression.inlines.hh"
-
-#endif // !defined(PPL_Variable_Floating_Point_Expression_defs_hh)
diff --git a/src/Variable_Floating_Point_Expression.inlines.hh b/src/Variable_Floating_Point_Expression.inlines.hh
deleted file mode 100644
index 51ad6f5..0000000
--- a/src/Variable_Floating_Point_Expression.inlines.hh
+++ /dev/null
@@ -1,94 +0,0 @@
-/* Variable_Floating_Point_Expression class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Variable_Floating_Point_Expression_inlines_hh
-#define PPL_Variable_Floating_Point_Expression_inlines_hh 1
-
-#include "globals.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-Variable_Floating_Point_Expression(const dimension_type v_index)
-  : variable_index(v_index) {}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline
-Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
-~Variable_Floating_Point_Expression() {}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::m_swap(Variable_Floating_Point_Expression& y) {
-  using std::swap;
-  swap(variable_index, y.variable_index);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline bool
-Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linearize(const FP_Interval_Abstract_Store&,
-            const FP_Linear_Form_Abstract_Store& lf_store,
-            FP_Linear_Form& result) const {
-  typename FP_Linear_Form_Abstract_Store::const_iterator
-           variable_value = lf_store.find(variable_index);
-
-  if (variable_value == lf_store.end()) {
-    result = FP_Linear_Form(Variable(variable_index));
-    return true;
-  }
-
-  result = FP_Linear_Form(variable_value->second);
-  return !this->overflows(result);
-}
-
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>
-::linear_form_assign(const FP_Linear_Form& lf,
-                           FP_Linear_Form_Abstract_Store& lf_store) const {
-  for (typename FP_Linear_Form_Abstract_Store::iterator
-         i = lf_store.begin(); i != lf_store.end(); ) {
-    if ((i->second).coefficient(Variable(variable_index)) != 0)
-      i = lf_store.erase(i);
-    else
-      ++i;
-  }
-  lf_store[variable_index] = lf;
-  return;
-}
-
-/*! \relates Variable_Floating_Point_Expression */
-template <typename FP_Interval_Type, typename FP_Format>
-inline void
-swap(Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-     Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
-  x.m_swap(y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Variable_Floating_Point_Expression_inlines_hh)
diff --git a/src/Variable_Floating_Point_Expression.types.hh b/src/Variable_Floating_Point_Expression.types.hh
deleted file mode 100644
index 6ac12aa..0000000
--- a/src/Variable_Floating_Point_Expression.types.hh
+++ /dev/null
@@ -1,23 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Variable_Floating_Point_Expression_types_hh
-#define PPL_Variable_Floating_Point_Expression_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename FP_Interval_Type, typename FP_Format>
-class Variable_Floating_Point_Expression;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Variable_Floating_Point_Expression_types_hh)
diff --git a/src/Variable_Floating_Point_Expression_defs.hh b/src/Variable_Floating_Point_Expression_defs.hh
new file mode 100644
index 0000000..81dde48
--- /dev/null
+++ b/src/Variable_Floating_Point_Expression_defs.hh
@@ -0,0 +1,187 @@
+/* Declarations for the Variable_Floating_Point_Expression class and
+   its constituents.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Variable_Floating_Point_Expression_defs_hh
+#define PPL_Variable_Floating_Point_Expression_defs_hh 1
+
+#include "Floating_Point_Expression_defs.hh"
+#include "globals_defs.hh"
+#include "Variable_Floating_Point_Expression_types.hh"
+#include <map>
+#include <utility>
+
+namespace Parma_Polyhedra_Library {
+
+//! Swaps \p x with \p y.
+/*! \relates Variable_Floating_Point_Expression */
+template<typename FP_Interval_Type, typename FP_Format>
+void swap(Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+          Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+
+/*! \brief
+  A generic Variable Floating Point Expression.
+
+  \ingroup PPL_CXX_interface
+
+  \par Template type parameters
+
+  - The class template type parameter \p FP_Interval_Type represents the type
+  of the intervals used in the abstract domain.
+  - The class template type parameter \p FP_Format represents the floating
+  point format used in the concrete domain.
+
+  \par Linearization of floating-point variable expressions
+
+  Given a variable expression \f$v\f$ and a composite
+  abstract store \f$\left \llbracket \rho^{\#}, \rho^{\#}_l \right
+  \rrbracket\f$, we construct the interval
+  linear form \f$\linexprenv{v}{\rho^{\#}}{\rho^{\#}_l}\f$ as
+  \f$\rho^{\#}_l(v)\f$ if it is defined; otherwise we construct it as
+  \f$[-1, 1]v\f$.
+*/
+template <typename FP_Interval_Type, typename FP_Format>
+class Variable_Floating_Point_Expression
+: public Floating_Point_Expression<FP_Interval_Type, FP_Format> {
+
+public:
+
+  /*! \brief
+     Alias for the Linear_Form<FP_Interval_Type> from
+     Floating_Point_Expression
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form FP_Linear_Form;
+
+  /*! \brief
+     Alias for the Box<FP_Interval_Type> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
+
+  /*! \brief
+     Alias for the std::map<dimension_type, FP_Linear_Form> from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+  FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::boundary_type from
+     Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
+  boundary_type;
+
+  /*! \brief
+     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  */
+  typedef typename
+  Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
+
+  //! \name Constructors and Destructor
+  //@{
+  /*! \brief
+    Constructor with a parameter: builds the variable floating point
+    expression corresponding to the variable having \p v_index as its index.
+  */
+  explicit Variable_Floating_Point_Expression(const dimension_type v_index);
+
+  //! Destructor.
+  ~Variable_Floating_Point_Expression();
+
+  //@} // Constructors and Destructor
+
+  /*! \brief
+    Linearizes the expression in a given abstract store.
+
+    Makes \p result become the linearization of \p *this in the given
+    composite abstract store.
+
+    \param int_store The interval abstract store.
+    \param lf_store The linear form abstract store.
+    \param result The modified linear form.
+
+    \return <CODE>true</CODE> if the linearization succeeded,
+    <CODE>false</CODE> otherwise.
+
+    Note that the variable in the expression MUST have an associated value
+    in \p int_store. If this precondition is not met, calling the method
+    causes an undefined behavior.
+
+    See the class description for a detailed explanation of how \p result is
+    computed.
+  */
+  bool linearize(const FP_Interval_Abstract_Store& int_store,
+                 const FP_Linear_Form_Abstract_Store& lf_store,
+                 FP_Linear_Form& result) const;
+
+  /*! \brief
+    Assigns a linear form to the variable with the same index of
+    \p *this in a given linear form abstract store.
+
+    \param lf The linear form assigned to the variable.
+    \param lf_store The linear form abstract store.
+
+    Note that once \p lf is assigned to a variable, all the other entries
+    of \p lf_store which contain that variable are discarded.
+  */
+  void linear_form_assign(const FP_Linear_Form& lf,
+                                FP_Linear_Form_Abstract_Store& lf_store) const;
+
+  //! Swaps \p *this with \p y.
+  void m_swap(Variable_Floating_Point_Expression& y);
+
+private:
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited copy constructor.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Variable_Floating_Point_Expression(
+                          const Variable_Floating_Point_Expression& y);
+
+  #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief
+    Inhibited assignment operator.
+  */
+  #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  Variable_Floating_Point_Expression& operator=(
+                          const Variable_Floating_Point_Expression& y);
+
+  //! The index of the variable.
+  dimension_type variable_index;
+
+}; // class Variable_Floating_Point_Expression
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Variable_Floating_Point_Expression_inlines.hh"
+
+#endif // !defined(PPL_Variable_Floating_Point_Expression_defs_hh)
diff --git a/src/Variable_Floating_Point_Expression_inlines.hh b/src/Variable_Floating_Point_Expression_inlines.hh
new file mode 100644
index 0000000..397ef57
--- /dev/null
+++ b/src/Variable_Floating_Point_Expression_inlines.hh
@@ -0,0 +1,94 @@
+/* Variable_Floating_Point_Expression class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Variable_Floating_Point_Expression_inlines_hh
+#define PPL_Variable_Floating_Point_Expression_inlines_hh 1
+
+#include "globals_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+Variable_Floating_Point_Expression(const dimension_type v_index)
+  : variable_index(v_index) {}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline
+Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>::
+~Variable_Floating_Point_Expression() {}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::m_swap(Variable_Floating_Point_Expression& y) {
+  using std::swap;
+  swap(variable_index, y.variable_index);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline bool
+Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linearize(const FP_Interval_Abstract_Store&,
+            const FP_Linear_Form_Abstract_Store& lf_store,
+            FP_Linear_Form& result) const {
+  typename FP_Linear_Form_Abstract_Store::const_iterator
+           variable_value = lf_store.find(variable_index);
+
+  if (variable_value == lf_store.end()) {
+    result = FP_Linear_Form(Variable(variable_index));
+    return true;
+  }
+
+  result = FP_Linear_Form(variable_value->second);
+  return !this->overflows(result);
+}
+
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>
+::linear_form_assign(const FP_Linear_Form& lf,
+                           FP_Linear_Form_Abstract_Store& lf_store) const {
+  for (typename FP_Linear_Form_Abstract_Store::iterator
+         i = lf_store.begin(); i != lf_store.end(); ) {
+    if ((i->second).coefficient(Variable(variable_index)) != 0)
+      i = lf_store.erase(i);
+    else
+      ++i;
+  }
+  lf_store[variable_index] = lf;
+  return;
+}
+
+/*! \relates Variable_Floating_Point_Expression */
+template <typename FP_Interval_Type, typename FP_Format>
+inline void
+swap(Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
+     Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Variable_Floating_Point_Expression_inlines_hh)
diff --git a/src/Variable_Floating_Point_Expression_types.hh b/src/Variable_Floating_Point_Expression_types.hh
new file mode 100644
index 0000000..3c9999e
--- /dev/null
+++ b/src/Variable_Floating_Point_Expression_types.hh
@@ -0,0 +1,23 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Variable_Floating_Point_Expression_types_hh
+#define PPL_Variable_Floating_Point_Expression_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename FP_Interval_Type, typename FP_Format>
+class Variable_Floating_Point_Expression;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Variable_Floating_Point_Expression_types_hh)
diff --git a/src/Variable_defs.hh b/src/Variable_defs.hh
new file mode 100644
index 0000000..a384dcc
--- /dev/null
+++ b/src/Variable_defs.hh
@@ -0,0 +1,157 @@
+/* Variable class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Variable_defs_hh
+#define PPL_Variable_defs_hh 1
+
+#include "Variable_types.hh"
+#include "Init_types.hh"
+#include "globals_types.hh"
+#include <iosfwd>
+#include <set>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Variable */
+std::ostream&
+operator<<(std::ostream& s, const Variable v);
+
+} // namespace IO_Operators
+
+//! Defines a total ordering on variables.
+/*! \relates Variable */
+bool less(Variable v, Variable w);
+
+/*! \relates Variable */
+void
+swap(Variable& x, Variable& y);
+
+} // namespace Parma_Polyhedra_Library
+
+//! A dimension of the vector space.
+/*! \ingroup PPL_CXX_interface
+  An object of the class Variable represents a dimension of the space,
+  that is one of the Cartesian axes.
+  Variables are used as basic blocks in order to build
+  more complex linear expressions.
+  Each variable is identified by a non-negative integer,
+  representing the index of the corresponding Cartesian axis
+  (the first axis has index 0).
+  The space dimension of a variable is the dimension of the vector space
+  made by all the Cartesian axes having an index less than or equal to
+  that of the considered variable; thus, if a variable has index \f$i\f$,
+  its space dimension is \f$i+1\f$.
+
+  Note that the ``meaning'' of an object of the class Variable
+  is completely specified by the integer index provided to its
+  constructor:
+  be careful not to be mislead by C++ language variable names.
+  For instance, in the following example the linear expressions
+  <CODE>e1</CODE> and <CODE>e2</CODE> are equivalent,
+  since the two variables <CODE>x</CODE> and <CODE>z</CODE> denote
+  the same Cartesian axis.
+  \code
+  Variable x(0);
+  Variable y(1);
+  Variable z(0);
+  Linear_Expression e1 = x + y;
+  Linear_Expression e2 = y + z;
+  \endcode
+
+*/
+class Parma_Polyhedra_Library::Variable {
+
+public:
+  //! Builds the variable corresponding to the Cartesian axis of index \p i.
+  /*!
+    \exception std::length_error
+    Thrown if <CODE>i+1</CODE> exceeds
+    <CODE>Variable::max_space_dimension()</CODE>.
+  */
+  explicit Variable(dimension_type i);
+
+  //! Returns the index of the Cartesian axis associated to the variable.
+  dimension_type id() const;
+
+  //! Returns the maximum space dimension a Variable can handle.
+  static dimension_type max_space_dimension();
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  /*!
+    The returned value is <CODE>id()+1</CODE>.
+  */
+  dimension_type space_dimension() const;
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  //! Type of output functions.
+  typedef void output_function_type(std::ostream& s, const Variable v);
+
+  //! The default output function.
+  static void default_output_function(std::ostream& s, const Variable v);
+
+  //! Sets the output function to be used for printing Variable objects.
+  static void set_output_function(output_function_type* p);
+
+  //! Returns the pointer to the current output function.
+  static output_function_type* get_output_function();
+
+  //! Binary predicate defining the total ordering on variables.
+  /*! \ingroup PPL_CXX_interface */
+  struct Compare {
+    //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
+    bool operator()(Variable x, Variable y) const;
+  };
+
+  //! Swaps *this and v.
+  void m_swap(Variable& v);
+
+private:
+  //! The index of the Cartesian axis.
+  dimension_type varid;
+
+  // The initialization class needs to set the default output function.
+  friend class Init;
+
+  friend std::ostream&
+  Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream& s,
+                                                    const Variable v);
+
+  //! Pointer to the current output function.
+  static output_function_type* current_output_function;
+
+};
+
+#include "Variable_inlines.hh"
+
+#endif // !defined(PPL_Variable_defs_hh)
diff --git a/src/Variable_inlines.hh b/src/Variable_inlines.hh
new file mode 100644
index 0000000..03d8908
--- /dev/null
+++ b/src/Variable_inlines.hh
@@ -0,0 +1,100 @@
+/* Variable class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Variable_inlines_hh
+#define PPL_Variable_inlines_hh 1
+
+#include "globals_defs.hh"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+inline dimension_type
+Variable::max_space_dimension() {
+  return not_a_dimension() - 1;
+}
+
+inline
+Variable::Variable(dimension_type i)
+  : varid((i < max_space_dimension())
+          ? i
+          : (throw std::length_error("PPL::Variable::Variable(i):\n"
+                                     "i exceeds the maximum allowed "
+                                     "variable identifier."), i)) {
+}
+
+inline dimension_type
+Variable::id() const {
+  return varid;
+}
+
+inline dimension_type
+Variable::space_dimension() const {
+  return varid + 1;
+}
+
+inline memory_size_type
+Variable::external_memory_in_bytes() const {
+  return 0;
+}
+
+inline memory_size_type
+Variable::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+inline void
+Variable::set_output_function(output_function_type* p) {
+  current_output_function = p;
+}
+
+inline Variable::output_function_type*
+Variable::get_output_function() {
+  return current_output_function;
+}
+
+/*! \relates Variable */
+inline bool
+less(const Variable v, const Variable w) {
+  return v.id() < w.id();
+}
+
+inline bool
+Variable::Compare::operator()(const Variable x, const Variable y) const {
+  return less(x, y);
+}
+
+inline void
+Variable::m_swap(Variable& v) {
+  using std::swap;
+  swap(varid, v.varid);
+}
+
+inline void
+swap(Variable& x, Variable& y) {
+  x.m_swap(y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Variable_inlines_hh)
diff --git a/src/Variable_types.hh b/src/Variable_types.hh
new file mode 100644
index 0000000..df20b90
--- /dev/null
+++ b/src/Variable_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Variable_types_hh
+#define PPL_Variable_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Variable;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Variable_types_hh)
diff --git a/src/Variables_Set.cc b/src/Variables_Set.cc
index e200d34..bea50bd 100644
--- a/src/Variables_Set.cc
+++ b/src/Variables_Set.cc
@@ -1,6 +1,6 @@
 /* Variables_Set class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Variables_Set.defs.hh"
+#include "Variables_Set_defs.hh"
 #include <iostream>
 
 namespace PPL = Parma_Polyhedra_Library;
@@ -46,7 +46,7 @@ std::ostream&
 PPL::IO_Operators::operator<<(std::ostream& s, const Variables_Set& vs) {
   s << '{';
   for (Variables_Set::const_iterator i = vs.begin(),
-	 vs_end = vs.end(); i != vs_end; ) {
+         vs_end = vs.end(); i != vs_end; ) {
     s << ' ' << Variable(*i);
     ++i;
     if (i != vs_end)
@@ -58,10 +58,10 @@ PPL::IO_Operators::operator<<(std::ostream& s, const Variables_Set& vs) {
 
 void
 PPL::Variables_Set::ascii_dump(std::ostream& s) const {
-  dimension_type variables_set_size = size();
+  const dimension_type variables_set_size = size();
   s << "\nvariables( " << variables_set_size << " )\n";
   for (Variables_Set::const_iterator i = begin(),
-	 i_end = end(); i != i_end; ++i)
+         i_end = end(); i != i_end; ++i)
     s << *i << " ";
 }
 
diff --git a/src/Variables_Set.defs.hh b/src/Variables_Set.defs.hh
deleted file mode 100644
index 3b9b1b2..0000000
--- a/src/Variables_Set.defs.hh
+++ /dev/null
@@ -1,107 +0,0 @@
-/* Variables_Set class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Variables_Set_defs_hh
-#define PPL_Variables_Set_defs_hh 1
-
-#include "Variables_Set.types.hh"
-#include "Variable.defs.hh"
-#include "globals.types.hh"
-#include <iosfwd>
-#include <set>
-
-namespace Parma_Polyhedra_Library {
-
-namespace IO_Operators {
-
-//! Output operator.
-/*! \relates Parma_Polyhedra_Library::Variables_Set */
-std::ostream&
-operator<<(std::ostream& s, const Variables_Set& vs);
-
-} // namespace IO_Operators
-
-} // namespace Parma_Polyhedra_Library
-
-//! An std::set of variables' indexes.
-class Parma_Polyhedra_Library::Variables_Set
-  : public std::set<dimension_type> {
-private:
-  typedef std::set<dimension_type> Base;
-
-public:
-  //! Builds the empty set of variable indexes.
-  Variables_Set();
-
-  //! Builds the singleton set of indexes containing <CODE>v.id()</CODE>;
-  explicit Variables_Set(const Variable v);
-
-  /*! \brief
-    Builds the set of variables's indexes in the range from
-    <CODE>v.id()</CODE> to <CODE>w.id()</CODE>.
-
-    If <CODE>v.id() <= w.id()</CODE>, this constructor builds the
-    set of variables' indexes
-    <CODE>v.id()</CODE>, <CODE>v.id()+1</CODE>, ..., <CODE>w.id()</CODE>.
-    The empty set is built otherwise.
-  */
-  Variables_Set(const Variable v, const Variable w);
-
-  //! Returns the maximum space dimension a Variables_Set can handle.
-  static dimension_type max_space_dimension();
-
-  /*! \brief
-    Returns the dimension of the smallest vector space enclosing all
-    the variables whose indexes are in the set.
-  */
-  dimension_type space_dimension() const;
-
-  //! Inserts the index of variable \p v into the set.
-  void insert(Variable v);
-
-  // The `insert' method above overloads (instead of hiding) the
-  // other `insert' method of std::set.
-  using Base::insert;
-
-  /*! \brief
-    Loads from \p s an ASCII representation (as produced by
-    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
-    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
-  */
-  bool ascii_load(std::istream& s);
-
-  //! Returns the total size in bytes of the memory occupied by \p *this.
-  memory_size_type total_memory_in_bytes() const;
-
-  //! Returns the size in bytes of the memory managed by \p *this.
-  memory_size_type external_memory_in_bytes() const;
-
-  //! Checks if all the invariants are satisfied.
-  bool OK() const;
-
-  PPL_OUTPUT_DECLARATIONS
-};
-
-#include "Variables_Set.inlines.hh"
-
-#endif // !defined(PPL_Variables_Set_defs_hh)
diff --git a/src/Variables_Set.inlines.hh b/src/Variables_Set.inlines.hh
deleted file mode 100644
index 7fe4b30..0000000
--- a/src/Variables_Set.inlines.hh
+++ /dev/null
@@ -1,75 +0,0 @@
-/* Variables_Set class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Variables_Set_inlines_hh
-#define PPL_Variables_Set_inlines_hh 1
-
-#include "globals.defs.hh"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Variables_Set::Variables_Set()
-  : Base() {
-}
-
-inline void
-Variables_Set::insert(const Variable v) {
-  insert(v.id());
-}
-
-inline
-Variables_Set::Variables_Set(const Variable v)
-  : Base() {
-  insert(v);
-}
-
-inline dimension_type
-Variables_Set::max_space_dimension() {
-  return Variable::max_space_dimension();
-}
-
-inline dimension_type
-Variables_Set::space_dimension() const {
-  reverse_iterator i = rbegin();
-  return (i == rend()) ? 0 : (*i + 1);
-}
-
-inline memory_size_type
-Variables_Set::external_memory_in_bytes() const {
-  // We assume sets are implemented by means of red-black trees that
-  // require to store the color (we assume an enum) and three pointers
-  // to the parent, left and right child, respectively.
-  enum color { red, black };
-  return size() * (sizeof(color) + 3*sizeof(void*) + sizeof(dimension_type));
-}
-
-inline memory_size_type
-Variables_Set::total_memory_in_bytes() const {
-  return sizeof(*this) + external_memory_in_bytes();
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Variables_Set_inlines_hh)
diff --git a/src/Variables_Set.types.hh b/src/Variables_Set.types.hh
deleted file mode 100644
index c8561ad..0000000
--- a/src/Variables_Set.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Variables_Set_types_hh
-#define PPL_Variables_Set_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Variables_Set;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Variables_Set_types_hh)
diff --git a/src/Variables_Set_defs.hh b/src/Variables_Set_defs.hh
new file mode 100644
index 0000000..a4af8c9
--- /dev/null
+++ b/src/Variables_Set_defs.hh
@@ -0,0 +1,107 @@
+/* Variables_Set class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Variables_Set_defs_hh
+#define PPL_Variables_Set_defs_hh 1
+
+#include "Variables_Set_types.hh"
+#include "Variable_defs.hh"
+#include "globals_types.hh"
+#include <iosfwd>
+#include <set>
+
+namespace Parma_Polyhedra_Library {
+
+namespace IO_Operators {
+
+//! Output operator.
+/*! \relates Parma_Polyhedra_Library::Variables_Set */
+std::ostream&
+operator<<(std::ostream& s, const Variables_Set& vs);
+
+} // namespace IO_Operators
+
+} // namespace Parma_Polyhedra_Library
+
+//! An std::set of variables' indexes.
+class Parma_Polyhedra_Library::Variables_Set
+  : public std::set<dimension_type> {
+private:
+  typedef std::set<dimension_type> Base;
+
+public:
+  //! Builds the empty set of variable indexes.
+  Variables_Set();
+
+  //! Builds the singleton set of indexes containing <CODE>v.id()</CODE>;
+  explicit Variables_Set(const Variable v);
+
+  /*! \brief
+    Builds the set of variables's indexes in the range from
+    <CODE>v.id()</CODE> to <CODE>w.id()</CODE>.
+
+    If <CODE>v.id() <= w.id()</CODE>, this constructor builds the
+    set of variables' indexes
+    <CODE>v.id()</CODE>, <CODE>v.id()+1</CODE>, ..., <CODE>w.id()</CODE>.
+    The empty set is built otherwise.
+  */
+  Variables_Set(const Variable v, const Variable w);
+
+  //! Returns the maximum space dimension a Variables_Set can handle.
+  static dimension_type max_space_dimension();
+
+  /*! \brief
+    Returns the dimension of the smallest vector space enclosing all
+    the variables whose indexes are in the set.
+  */
+  dimension_type space_dimension() const;
+
+  //! Inserts the index of variable \p v into the set.
+  void insert(Variable v);
+
+  // The `insert' method above overloads (instead of hiding) the
+  // other `insert' method of std::set.
+  using Base::insert;
+
+  /*! \brief
+    Loads from \p s an ASCII representation (as produced by
+    ascii_dump(std::ostream&) const) and sets \p *this accordingly.
+    Returns <CODE>true</CODE> if successful, <CODE>false</CODE> otherwise.
+  */
+  bool ascii_load(std::istream& s);
+
+  //! Returns the total size in bytes of the memory occupied by \p *this.
+  memory_size_type total_memory_in_bytes() const;
+
+  //! Returns the size in bytes of the memory managed by \p *this.
+  memory_size_type external_memory_in_bytes() const;
+
+  //! Checks if all the invariants are satisfied.
+  bool OK() const;
+
+  PPL_OUTPUT_DECLARATIONS
+};
+
+#include "Variables_Set_inlines.hh"
+
+#endif // !defined(PPL_Variables_Set_defs_hh)
diff --git a/src/Variables_Set_inlines.hh b/src/Variables_Set_inlines.hh
new file mode 100644
index 0000000..0f1c467
--- /dev/null
+++ b/src/Variables_Set_inlines.hh
@@ -0,0 +1,75 @@
+/* Variables_Set class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Variables_Set_inlines_hh
+#define PPL_Variables_Set_inlines_hh 1
+
+#include "globals_defs.hh"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Variables_Set::Variables_Set()
+  : Base() {
+}
+
+inline void
+Variables_Set::insert(const Variable v) {
+  insert(v.id());
+}
+
+inline
+Variables_Set::Variables_Set(const Variable v)
+  : Base() {
+  insert(v);
+}
+
+inline dimension_type
+Variables_Set::max_space_dimension() {
+  return Variable::max_space_dimension();
+}
+
+inline dimension_type
+Variables_Set::space_dimension() const {
+  reverse_iterator i = rbegin();
+  return (i == rend()) ? 0 : (*i + 1);
+}
+
+inline memory_size_type
+Variables_Set::external_memory_in_bytes() const {
+  // We assume sets are implemented by means of red-black trees that
+  // require to store the color (we assume an enum) and three pointers
+  // to the parent, left and right child, respectively.
+  enum color { red, black };
+  return size() * (sizeof(color) + 3*sizeof(void*) + sizeof(dimension_type));
+}
+
+inline memory_size_type
+Variables_Set::total_memory_in_bytes() const {
+  return sizeof(*this) + external_memory_in_bytes();
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Variables_Set_inlines_hh)
diff --git a/src/Variables_Set_types.hh b/src/Variables_Set_types.hh
new file mode 100644
index 0000000..5cc6456
--- /dev/null
+++ b/src/Variables_Set_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Variables_Set_types_hh
+#define PPL_Variables_Set_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Variables_Set;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Variables_Set_types_hh)
diff --git a/src/WRD_coefficient_types.defs.hh b/src/WRD_coefficient_types.defs.hh
deleted file mode 100644
index 7c1e23e..0000000
--- a/src/WRD_coefficient_types.defs.hh
+++ /dev/null
@@ -1,153 +0,0 @@
-/* Coefficient types of weakly-relational domains: declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_WRD_coefficient_types_defs_hh
-#define PPL_WRD_coefficient_types_defs_hh 1
-
-#include "meta_programming.hh"
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief \ingroup PPL_CXX_interface
-  The production policy for checked numbers used in weakly-relational
-  domains.
- */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct WRD_Extended_Number_Policy {
-  //! Check for overflowed result.
-  const_bool_nodef(check_overflow, true);
-
-  //! Do not check for attempts to add infinities with different sign.
-  const_bool_nodef(check_inf_add_inf, false);
-
-  //! Do not check for attempts to subtract infinities with same sign.
-  const_bool_nodef(check_inf_sub_inf, false);
-
-  //! Do not check for attempts to multiply infinities by zero.
-  const_bool_nodef(check_inf_mul_zero, false);
-
-  //! Do not check for attempts to divide by zero.
-  const_bool_nodef(check_div_zero, false);
-
-  //! Do not check for attempts to divide infinities.
-  const_bool_nodef(check_inf_div_inf, false);
-
-  //! Do not check for attempts to compute remainder of infinities.
-  const_bool_nodef(check_inf_mod, false);
-
-  //! Do not checks for attempts to take the square root of a negative number.
-  const_bool_nodef(check_sqrt_neg, false);
-
-  //! Handle not-a-number special value.
-  const_bool_nodef(has_nan, true);
-
-  //! Handle infinity special values.
-  const_bool_nodef(has_infinity, true);
-
-  // `convertible' is intentionally not defined: the compile time
-  // error on conversions is the expected behavior.
-
-  //! Honor requests to check for FPU inexact results.
-  const_bool_nodef(fpu_check_inexact, true);
-
-  //! Do not make extra checks to detect FPU NaN results.
-  const_bool_nodef(fpu_check_nan_result, false);
-
-  // ROUND_DEFAULT_CONSTRUCTOR is intentionally not defined.
-  // ROUND_DEFAULT_OPERATOR is intentionally not defined.
-  // ROUND_DEFAULT_FUNCTION is intentionally not defined.
-  // ROUND_DEFAULT_INPUT is intentionally not defined.
-  // ROUND_DEFAULT_OUTPUT is intentionally not defined.
-
-  /*! \brief
-    Handles \p r: called by all constructors, operators and functions that
-    do not return a Result value.
-  */
-  static void handle_result(Result r);
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief \ingroup PPL_CXX_interface
-  The debugging policy for checked numbers used in weakly-relational
-  domains.
- */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct Debug_WRD_Extended_Number_Policy {
-  //! Check for overflowed result.
-  const_bool_nodef(check_overflow, true);
-
-  //! Check for attempts to add infinities with different sign.
-  const_bool_nodef(check_inf_add_inf, true);
-
-  //! Check for attempts to subtract infinities with same sign.
-  const_bool_nodef(check_inf_sub_inf, true);
-
-  //! Check for attempts to multiply infinities by zero.
-  const_bool_nodef(check_inf_mul_zero, true);
-
-  //! Check for attempts to divide by zero.
-  const_bool_nodef(check_div_zero, true);
-
-  //! Check for attempts to divide infinities.
-  const_bool_nodef(check_inf_div_inf, true);
-
-  //! Check for attempts to compute remainder of infinities.
-  const_bool_nodef(check_inf_mod, true);
-
-  //! Checks for attempts to take the square root of a negative number.
-  const_bool_nodef(check_sqrt_neg, true);
-
-  //! Handle not-a-number special value.
-  const_bool_nodef(has_nan, true);
-
-  //! Handle infinity special values.
-  const_bool_nodef(has_infinity, true);
-
-  // `convertible' is intentionally not defined: the compile time
-  // error on conversions is the expected behavior.
-
-  //! Honor requests to check for FPU inexact results.
-  const_bool_nodef(fpu_check_inexact, true);
-
-  //! Make extra checks to detect FPU NaN results.
-  const_bool_nodef(fpu_check_nan_result, true);
-
-  // ROUND_DEFAULT_CONSTRUCTOR is intentionally not defined.
-  // ROUND_DEFAULT_OPERATOR is intentionally not defined.
-  // ROUND_DEFAULT_FUNCTION is intentionally not defined.
-  // ROUND_DEFAULT_INPUT is intentionally not defined.
-  // ROUND_DEFAULT_OUTPUT is intentionally not defined.
-
-  /*! \brief
-    Handles \p r: called by all constructors, operators and functions that
-    do not return a Result value.
-  */
-  static void handle_result(Result r);
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "WRD_coefficient_types.inlines.hh"
-
-#endif // !defined(PPL_WRD_coefficient_types_defs_hh)
diff --git a/src/WRD_coefficient_types.inlines.hh b/src/WRD_coefficient_types.inlines.hh
deleted file mode 100644
index b30789c..0000000
--- a/src/WRD_coefficient_types.inlines.hh
+++ /dev/null
@@ -1,43 +0,0 @@
-/* Coefficient types of weakly-relational domains: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_WRD_coefficient_types_inlines_hh
-#define PPL_WRD_coefficient_types_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-WRD_Extended_Number_Policy::handle_result(Result r) {
-  if (result_class(r) == VC_NAN)
-    throw_result_exception(r);
-}
-
-inline void
-Debug_WRD_Extended_Number_Policy::handle_result(Result r) {
-  if (result_class(r) == VC_NAN)
-    throw_result_exception(r);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_WRD_coefficient_types_inlines_hh)
diff --git a/src/WRD_coefficient_types_defs.hh b/src/WRD_coefficient_types_defs.hh
new file mode 100644
index 0000000..f9cf6e2
--- /dev/null
+++ b/src/WRD_coefficient_types_defs.hh
@@ -0,0 +1,153 @@
+/* Coefficient types of weakly-relational domains: declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_WRD_coefficient_types_defs_hh
+#define PPL_WRD_coefficient_types_defs_hh 1
+
+#include "meta_programming.hh"
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface \brief
+  The production policy for checked numbers used in weakly-relational
+  domains.
+ */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct WRD_Extended_Number_Policy {
+  //! Check for overflowed result.
+  const_bool_nodef(check_overflow, true);
+
+  //! Do not check for attempts to add infinities with different sign.
+  const_bool_nodef(check_inf_add_inf, false);
+
+  //! Do not check for attempts to subtract infinities with same sign.
+  const_bool_nodef(check_inf_sub_inf, false);
+
+  //! Do not check for attempts to multiply infinities by zero.
+  const_bool_nodef(check_inf_mul_zero, false);
+
+  //! Do not check for attempts to divide by zero.
+  const_bool_nodef(check_div_zero, false);
+
+  //! Do not check for attempts to divide infinities.
+  const_bool_nodef(check_inf_div_inf, false);
+
+  //! Do not check for attempts to compute remainder of infinities.
+  const_bool_nodef(check_inf_mod, false);
+
+  //! Do not checks for attempts to take the square root of a negative number.
+  const_bool_nodef(check_sqrt_neg, false);
+
+  //! Handle not-a-number special value.
+  const_bool_nodef(has_nan, true);
+
+  //! Handle infinity special values.
+  const_bool_nodef(has_infinity, true);
+
+  // `convertible' is intentionally not defined: the compile time
+  // error on conversions is the expected behavior.
+
+  //! Honor requests to check for FPU inexact results.
+  const_bool_nodef(fpu_check_inexact, true);
+
+  //! Do not make extra checks to detect FPU NaN results.
+  const_bool_nodef(fpu_check_nan_result, false);
+
+  // ROUND_DEFAULT_CONSTRUCTOR is intentionally not defined.
+  // ROUND_DEFAULT_OPERATOR is intentionally not defined.
+  // ROUND_DEFAULT_FUNCTION is intentionally not defined.
+  // ROUND_DEFAULT_INPUT is intentionally not defined.
+  // ROUND_DEFAULT_OUTPUT is intentionally not defined.
+
+  /*! \brief
+    Handles \p r: called by all constructors, operators and functions that
+    do not return a Result value.
+  */
+  static void handle_result(Result r);
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface \brief
+  The debugging policy for checked numbers used in weakly-relational
+  domains.
+ */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct Debug_WRD_Extended_Number_Policy {
+  //! Check for overflowed result.
+  const_bool_nodef(check_overflow, true);
+
+  //! Check for attempts to add infinities with different sign.
+  const_bool_nodef(check_inf_add_inf, true);
+
+  //! Check for attempts to subtract infinities with same sign.
+  const_bool_nodef(check_inf_sub_inf, true);
+
+  //! Check for attempts to multiply infinities by zero.
+  const_bool_nodef(check_inf_mul_zero, true);
+
+  //! Check for attempts to divide by zero.
+  const_bool_nodef(check_div_zero, true);
+
+  //! Check for attempts to divide infinities.
+  const_bool_nodef(check_inf_div_inf, true);
+
+  //! Check for attempts to compute remainder of infinities.
+  const_bool_nodef(check_inf_mod, true);
+
+  //! Checks for attempts to take the square root of a negative number.
+  const_bool_nodef(check_sqrt_neg, true);
+
+  //! Handle not-a-number special value.
+  const_bool_nodef(has_nan, true);
+
+  //! Handle infinity special values.
+  const_bool_nodef(has_infinity, true);
+
+  // `convertible' is intentionally not defined: the compile time
+  // error on conversions is the expected behavior.
+
+  //! Honor requests to check for FPU inexact results.
+  const_bool_nodef(fpu_check_inexact, true);
+
+  //! Make extra checks to detect FPU NaN results.
+  const_bool_nodef(fpu_check_nan_result, true);
+
+  // ROUND_DEFAULT_CONSTRUCTOR is intentionally not defined.
+  // ROUND_DEFAULT_OPERATOR is intentionally not defined.
+  // ROUND_DEFAULT_FUNCTION is intentionally not defined.
+  // ROUND_DEFAULT_INPUT is intentionally not defined.
+  // ROUND_DEFAULT_OUTPUT is intentionally not defined.
+
+  /*! \brief
+    Handles \p r: called by all constructors, operators and functions that
+    do not return a Result value.
+  */
+  static void handle_result(Result r);
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "WRD_coefficient_types_inlines.hh"
+
+#endif // !defined(PPL_WRD_coefficient_types_defs_hh)
diff --git a/src/WRD_coefficient_types_inlines.hh b/src/WRD_coefficient_types_inlines.hh
new file mode 100644
index 0000000..2a8051e
--- /dev/null
+++ b/src/WRD_coefficient_types_inlines.hh
@@ -0,0 +1,43 @@
+/* Coefficient types of weakly-relational domains: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_WRD_coefficient_types_inlines_hh
+#define PPL_WRD_coefficient_types_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+WRD_Extended_Number_Policy::handle_result(Result r) {
+  if (result_class(r) == VC_NAN)
+    throw_result_exception(r);
+}
+
+inline void
+Debug_WRD_Extended_Number_Policy::handle_result(Result r) {
+  if (result_class(r) == VC_NAN)
+    throw_result_exception(r);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_WRD_coefficient_types_inlines_hh)
diff --git a/src/Watchdog.cc b/src/Watchdog.cc
index db789a8..4f48376 100644
--- a/src/Watchdog.cc
+++ b/src/Watchdog.cc
@@ -1,6 +1,6 @@
 /* Watchdog and associated classes' implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "Watchdog.defs.hh"
+#include "Watchdog_defs.hh"
 
 #if PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
 
@@ -97,14 +97,14 @@ my_getitimer(int which, struct itimerval* value) {
 
 void
 my_setitimer(int which,
-	     const struct itimerval* value, struct itimerval* old_value) {
+             const struct itimerval* value, struct itimerval* old_value) {
   if (setitimer(which, value, old_value) != 0)
     throw_syscall_error("setitimer");
 }
 
 void
 my_sigaction(int signum,
-	     const struct sigaction* act, struct sigaction* old_action) {
+             const struct sigaction* act, struct sigaction* old_action) {
   if (sigaction(signum, act, old_action) != 0)
     throw_syscall_error("sigaction");
 }
@@ -116,7 +116,7 @@ PPL::Watchdog::get_timer(Implementation::Watchdog::Time& time) {
   using namespace Implementation::Watchdog;
   my_getitimer(THE_TIMER, &current_timer_status);
   time = Time(current_timer_status.it_value.tv_sec,
-	      current_timer_status.it_value.tv_usec);
+              current_timer_status.it_value.tv_usec);
 }
 
 void
@@ -143,16 +143,16 @@ PPL::Watchdog::handle_timeout(int) {
   else {
     time_so_far += last_time_requested;
     if (!pending.empty()) {
-      WD_Pending_List::Iterator i = pending.begin();
+      WD_Pending_List::iterator i = pending.begin();
       do {
-	i->handler().act();
-	i->expired_flag() = true;
-	i = pending.erase(i);
+        i->handler().act();
+        i->expired_flag() = true;
+        i = pending.erase(i);
       } while (i != pending.end() && i->deadline() <= time_so_far);
       if (pending.empty())
-	alarm_clock_running = false;
+        alarm_clock_running = false;
       else
-	set_timer((*pending.begin()).deadline() - time_so_far);
+        set_timer((*pending.begin()).deadline() - time_so_far);
     }
     else
       alarm_clock_running = false;
@@ -164,14 +164,14 @@ PPL::PPL_handle_timeout(int signum) {
   PPL::Watchdog::handle_timeout(signum);
 }
 
-PPL::Watchdog::WD_Pending_List::Iterator
+PPL::Watchdog::WD_Pending_List::iterator
 PPL::Watchdog::new_watchdog_event(long csecs,
-				  const WD_Handler& handler,
-				  bool& expired_flag) {
+                                  const WD_Handler& handler,
+                                  bool& expired_flag) {
   using namespace Implementation::Watchdog;
   assert(csecs > 0);
-  WD_Pending_List::Iterator position;
-  Time deadline(csecs);
+  WD_Pending_List::iterator position;
+  const Time deadline(csecs);
   if (!alarm_clock_running) {
     position = pending.insert(deadline, handler, expired_flag);
     time_so_far = Time(0);
@@ -197,24 +197,24 @@ PPL::Watchdog::new_watchdog_event(long csecs,
 }
 
 void
-PPL::Watchdog::remove_watchdog_event(WD_Pending_List::Iterator position) {
+PPL::Watchdog::remove_watchdog_event(WD_Pending_List::iterator position) {
   using namespace Implementation::Watchdog;
   assert(!pending.empty());
   if (position == pending.begin()) {
-    WD_Pending_List::Iterator next = position;
+    WD_Pending_List::iterator next = position;
     ++next;
     if (next != pending.end()) {
-      Time first_deadline(position->deadline());
+      const Time first_deadline(position->deadline());
       Time next_deadline(next->deadline());
       if (first_deadline != next_deadline) {
-	Time time_to_shoot;
-	get_timer(time_to_shoot);
-	Time elapsed_time(last_time_requested);
-	elapsed_time -= time_to_shoot;
-	time_so_far += elapsed_time;
-	next_deadline -= first_deadline;
-	time_to_shoot += next_deadline;
-	set_timer(time_to_shoot);
+        Time time_to_shoot;
+        get_timer(time_to_shoot);
+        Time elapsed_time(last_time_requested);
+        elapsed_time -= time_to_shoot;
+        time_so_far += elapsed_time;
+        next_deadline -= first_deadline;
+        time_to_shoot += next_deadline;
+        set_timer(time_to_shoot);
       }
     }
     else {
diff --git a/src/Watchdog.defs.hh b/src/Watchdog.defs.hh
deleted file mode 100644
index 338e27b..0000000
--- a/src/Watchdog.defs.hh
+++ /dev/null
@@ -1,148 +0,0 @@
-/* Watchdog and associated classes' declaration and inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Watchdog_defs_hh
-#define PPL_Watchdog_defs_hh 1
-
-#include "Watchdog.types.hh"
-#include "Time.defs.hh"
-#include "Handler.types.hh"
-#include "Pending_List.defs.hh"
-#include <cassert>
-#include <functional>
-
-#ifdef PPL_HAVE_SYS_TIME_H
-# include <sys/time.h>
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-// Set linkage now to declare it friend later.
-extern "C" void PPL_handle_timeout(int signum);
-
-struct Watchdog_Traits {
-  typedef Implementation::Watchdog::Time Threshold;
-  static bool less_than(const Threshold& a, const Threshold& b) {
-    return a < b;
-  }
-};
-
-//! A watchdog timer.
-class Watchdog {
-public:
-  template <typename Flag_Base, typename Flag>
-  Watchdog(long csecs, const Flag_Base* volatile& holder, Flag& flag);
-
-  /*! \brief
-    Constructor: if not reset, the watchdog will trigger after \p csecs
-    centiseconds, invoking handler \p function.
-  */
-  Watchdog(long csecs, void (*function)());
-
-  //! Destructor.
-  ~Watchdog();
-
-#if PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
-
-  //! Static class initialization.
-  static void initialize();
-  //! Static class finalization.
-  static void finalize();
-
-private:
-  //! Whether or not this watchdog has expired.
-  bool expired;
-
-  typedef Implementation::Watchdog::Pending_List<Watchdog_Traits>
-  WD_Pending_List;
-
-  typedef Implementation::Watchdog::Handler
-  WD_Handler;
-
-  const WD_Handler& handler;
-  WD_Pending_List::Iterator pending_position;
-
-  // Private and not implemented: copy construction is not allowed.
-  Watchdog(const Watchdog&);
-  // Private and not implemented: copy assignment is not allowed.
-  Watchdog& operator=(const Watchdog&);
-
-  // Pass this to getitimer().
-  static itimerval current_timer_status;
-
-  //! Reads the timer value into \p time.
-  static void get_timer(Implementation::Watchdog::Time& time);
-
-  // Pass this to setitimer().
-  static itimerval signal_once;
-
-  // Last time value we set the timer to.
-  static Implementation::Watchdog::Time last_time_requested;
-
-  //! Sets the timer value to \p time.
-  static void set_timer(const Implementation::Watchdog::Time& time);
-
-  //! Stops the timer.
-  static void stop_timer();
-
-  //! Quick reschedule to avoid race conditions.
-  static void reschedule();
-
-  // Used by the above.
-  static Implementation::Watchdog::Time reschedule_time;
-
-  // Records the time elapsed since last fresh start.
-  static Implementation::Watchdog::Time time_so_far;
-
-  //! The ordered queue of pending watchdog events.
-  static WD_Pending_List pending;
-
-  //! The actual signal handler.
-  static void handle_timeout(int);
-
-  //! Handles the addition of a new watchdog event.
-  static WD_Pending_List::Iterator
-  new_watchdog_event(long csecs,
-                     const WD_Handler& handler,
-                     bool& expired_flag);
-
-  //! Handles the removal of the watchdog event referred by \p position.
-  void remove_watchdog_event(WD_Pending_List::Iterator position);
-
-  //! Whether the alarm clock is running.
-  static volatile bool alarm_clock_running;
-
-  //! Whether we are changing data that is also changed by the signal handler.
-  static volatile bool in_critical_section;
-
-  friend void PPL_handle_timeout(int signum);
-
-#endif // PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Watchdog.inlines.hh"
-
-#endif // !defined(PPL_Watchdog_defs_hh)
-
diff --git a/src/Watchdog.inlines.hh b/src/Watchdog.inlines.hh
deleted file mode 100644
index 30798ef..0000000
--- a/src/Watchdog.inlines.hh
+++ /dev/null
@@ -1,101 +0,0 @@
-/* Watchdog and associated classes' implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Watchdog_inlines_hh
-#define PPL_Watchdog_inlines_hh 1
-
-#include "Handler.defs.hh"
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-#if PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
-
-template <typename Flag_Base, typename Flag>
-Watchdog::Watchdog(long csecs,
-		   const Flag_Base* volatile& holder,
-                   Flag& flag)
-  : expired(false),
-    handler(*new
-            Implementation::Watchdog::Handler_Flag<Flag_Base, Flag>(holder,
-                                                                    flag)) {
-  if (csecs == 0)
-    throw std::invalid_argument("Watchdog constructor called with a"
-				" non-positive number of centiseconds");
-  in_critical_section = true;
-  pending_position = new_watchdog_event(csecs, handler, expired);
-  in_critical_section = false;
-}
-
-inline
-Watchdog::Watchdog(long csecs, void (*function)())
-  : expired(false),
-    handler(*new Implementation::Watchdog::Handler_Function(function)) {
-  if (csecs == 0)
-    throw std::invalid_argument("Watchdog constructor called with a"
-				" non-positive number of centiseconds");
-  in_critical_section = true;
-  pending_position = new_watchdog_event(csecs, handler, expired);
-  in_critical_section = false;
-}
-
-inline
-Watchdog::~Watchdog() {
-  if (!expired) {
-    in_critical_section = true;
-    remove_watchdog_event(pending_position);
-    in_critical_section = false;
-  }
-  delete &handler;
-}
-
-inline void
-Watchdog::reschedule() {
-  set_timer(reschedule_time);
-}
-
-#else // !PPL_HAVE_DECL_SETITIMER !! !PPL_HAVE_DECL_SIGACTION
-
-template <typename Flag_Base, typename Flag>
-Watchdog::Watchdog(long /* csecs */,
-		   const Flag_Base* volatile& /* holder */,
-                   Flag& /* flag */) {
-  throw std::logic_error("PPL::Watchdog::Watchdog objects not supported:"
-                         " system does not provide setitimer()");
-}
-
-inline
-Watchdog::Watchdog(long /* csecs */, void (* /* function */)()) {
-  throw std::logic_error("PPL::Watchdog::Watchdog objects not supported:"
-                         " system does not provide setitimer()");
-}
-
-inline
-Watchdog::~Watchdog() {
-}
-
-#endif // !PPL_HAVE_DECL_SETITIMER !! !PPL_HAVE_DECL_SIGACTION
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Watchdog_inlines_hh)
diff --git a/src/Watchdog.types.hh b/src/Watchdog.types.hh
deleted file mode 100644
index 59436e1..0000000
--- a/src/Watchdog.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Watchdog_types_hh
-#define PPL_Watchdog_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Watchdog;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Watchdog_types_hh)
diff --git a/src/Watchdog_defs.hh b/src/Watchdog_defs.hh
new file mode 100644
index 0000000..c39b4dd
--- /dev/null
+++ b/src/Watchdog_defs.hh
@@ -0,0 +1,148 @@
+/* Watchdog and associated classes' declaration and inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Watchdog_defs_hh
+#define PPL_Watchdog_defs_hh 1
+
+#include "Watchdog_types.hh"
+#include "Time_defs.hh"
+#include "Handler_types.hh"
+#include "Pending_List_defs.hh"
+#include <cassert>
+#include <functional>
+
+#ifdef PPL_HAVE_SYS_TIME_H
+# include <sys/time.h>
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+// Set linkage now to declare it friend later.
+extern "C" void PPL_handle_timeout(int signum);
+
+struct Watchdog_Traits {
+  typedef Implementation::Watchdog::Time Threshold;
+  static bool less_than(const Threshold& a, const Threshold& b) {
+    return a < b;
+  }
+};
+
+//! A watchdog timer.
+class Watchdog {
+public:
+  template <typename Flag_Base, typename Flag>
+  Watchdog(long csecs, const Flag_Base* volatile& holder, Flag& flag);
+
+  /*! \brief
+    Constructor: if not reset, the watchdog will trigger after \p csecs
+    centiseconds, invoking handler \p function.
+  */
+  Watchdog(long csecs, void (* const function)());
+
+  //! Destructor.
+  ~Watchdog();
+
+#if PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
+
+  //! Static class initialization.
+  static void initialize();
+  //! Static class finalization.
+  static void finalize();
+
+private:
+  //! Whether or not this watchdog has expired.
+  bool expired;
+
+  typedef Implementation::Watchdog::Pending_List<Watchdog_Traits>
+  WD_Pending_List;
+
+  typedef Implementation::Watchdog::Handler
+  WD_Handler;
+
+  const WD_Handler& handler;
+  WD_Pending_List::iterator pending_position;
+
+  // Private and not implemented: copy construction is not allowed.
+  Watchdog(const Watchdog&);
+  // Private and not implemented: copy assignment is not allowed.
+  Watchdog& operator=(const Watchdog&);
+
+  // Pass this to getitimer().
+  static itimerval current_timer_status;
+
+  //! Reads the timer value into \p time.
+  static void get_timer(Implementation::Watchdog::Time& time);
+
+  // Pass this to setitimer().
+  static itimerval signal_once;
+
+  // Last time value we set the timer to.
+  static Implementation::Watchdog::Time last_time_requested;
+
+  //! Sets the timer value to \p time.
+  static void set_timer(const Implementation::Watchdog::Time& time);
+
+  //! Stops the timer.
+  static void stop_timer();
+
+  //! Quick reschedule to avoid race conditions.
+  static void reschedule();
+
+  // Used by the above.
+  static Implementation::Watchdog::Time reschedule_time;
+
+  // Records the time elapsed since last fresh start.
+  static Implementation::Watchdog::Time time_so_far;
+
+  //! The ordered queue of pending watchdog events.
+  static WD_Pending_List pending;
+
+  //! The actual signal handler.
+  static void handle_timeout(int);
+
+  //! Handles the addition of a new watchdog event.
+  static WD_Pending_List::iterator
+  new_watchdog_event(long csecs,
+                     const WD_Handler& handler,
+                     bool& expired_flag);
+
+  //! Handles the removal of the watchdog event referred by \p position.
+  void remove_watchdog_event(WD_Pending_List::iterator position);
+
+  //! Whether the alarm clock is running.
+  static volatile bool alarm_clock_running;
+
+  //! Whether we are changing data that is also changed by the signal handler.
+  static volatile bool in_critical_section;
+
+  friend void PPL_handle_timeout(int signum);
+
+#endif // PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Watchdog_inlines.hh"
+
+#endif // !defined(PPL_Watchdog_defs_hh)
+
diff --git a/src/Watchdog_inlines.hh b/src/Watchdog_inlines.hh
new file mode 100644
index 0000000..cab18e4
--- /dev/null
+++ b/src/Watchdog_inlines.hh
@@ -0,0 +1,101 @@
+/* Watchdog and associated classes' implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Watchdog_inlines_hh
+#define PPL_Watchdog_inlines_hh 1
+
+#include "Handler_defs.hh"
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+#if PPL_HAVE_DECL_SETITIMER && PPL_HAVE_DECL_SIGACTION
+
+template <typename Flag_Base, typename Flag>
+Watchdog::Watchdog(long csecs,
+                   const Flag_Base* volatile& holder,
+                   Flag& flag)
+  : expired(false),
+    handler(*new
+            Implementation::Watchdog::Handler_Flag<Flag_Base, Flag>(holder,
+                                                                    flag)) {
+  if (csecs == 0)
+    throw std::invalid_argument("Watchdog constructor called with a"
+                                " non-positive number of centiseconds");
+  in_critical_section = true;
+  pending_position = new_watchdog_event(csecs, handler, expired);
+  in_critical_section = false;
+}
+
+inline
+Watchdog::Watchdog(long csecs, void (* const function)())
+  : expired(false),
+    handler(*new Implementation::Watchdog::Handler_Function(function)) {
+  if (csecs == 0)
+    throw std::invalid_argument("Watchdog constructor called with a"
+                                " non-positive number of centiseconds");
+  in_critical_section = true;
+  pending_position = new_watchdog_event(csecs, handler, expired);
+  in_critical_section = false;
+}
+
+inline
+Watchdog::~Watchdog() {
+  if (!expired) {
+    in_critical_section = true;
+    remove_watchdog_event(pending_position);
+    in_critical_section = false;
+  }
+  delete &handler;
+}
+
+inline void
+Watchdog::reschedule() {
+  set_timer(reschedule_time);
+}
+
+#else // !PPL_HAVE_DECL_SETITIMER !! !PPL_HAVE_DECL_SIGACTION
+
+template <typename Flag_Base, typename Flag>
+Watchdog::Watchdog(long /* csecs */,
+                   const Flag_Base* volatile& /* holder */,
+                   Flag& /* flag */) {
+  throw std::logic_error("PPL::Watchdog::Watchdog objects not supported:"
+                         " system does not provide setitimer()");
+}
+
+inline
+Watchdog::Watchdog(long /* csecs */, void (* /* function */)()) {
+  throw std::logic_error("PPL::Watchdog::Watchdog objects not supported:"
+                         " system does not provide setitimer()");
+}
+
+inline
+Watchdog::~Watchdog() {
+}
+
+#endif // !PPL_HAVE_DECL_SETITIMER !! !PPL_HAVE_DECL_SIGACTION
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Watchdog_inlines_hh)
diff --git a/src/Watchdog_types.hh b/src/Watchdog_types.hh
new file mode 100644
index 0000000..68d79a3
--- /dev/null
+++ b/src/Watchdog_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Watchdog_types_hh
+#define PPL_Watchdog_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Watchdog;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Watchdog_types_hh)
diff --git a/src/Weight_Profiler.cc b/src/Weight_Profiler.cc
index 75c2795..153eaad 100644
--- a/src/Weight_Profiler.cc
+++ b/src/Weight_Profiler.cc
@@ -1,6 +1,6 @@
 /* Weight_Profiler class implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,12 +22,12 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "globals.defs.hh"
+#include "globals_defs.hh"
 
 #if PPL_PROFILE_ADD_WEIGHT
 #include <iostream>
 #include <cmath>
-#include "Weight_Profiler.defs.hh"
+#include "Weight_Profiler_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -42,22 +42,22 @@ void Weight_Profiler::output_stats() {
       double variance
         = stat[VALID].squares_sum / stat[VALID].count - average * average;
       std::cout << " samples(" << stat[VALID].samples << ")"
-		<< " count(" << stat[VALID].count << ")"
-		<< " min( " << stat[VALID].min << ")"
-		<< " max( " << stat[VALID].max << ")"
-		<< " average(" << average << ")";
+                << " count(" << stat[VALID].count << ")"
+                << " min( " << stat[VALID].min << ")"
+                << " max( " << stat[VALID].max << ")"
+                << " average(" << average << ")";
       std::cout << " variance( " << variance << ")"
-		<< " stddev( " << sqrt(variance) << ")";
+                << " stddev( " << sqrt(variance) << ")";
     }
     if (stat[DISCARDED].samples > 0) {
       std::cout << " min_threshold( " << min_threshold << ")"
-		<< " max_threshold( " << max_threshold << ")";
+                << " max_threshold( " << max_threshold << ")";
       double average = stat[DISCARDED].sum / stat[DISCARDED].count;
       std::cout << " samples(" << stat[DISCARDED].samples << ")"
-		<< " count(" << stat[DISCARDED].count << ")"
-		<< " min( " << stat[DISCARDED].min << ")"
-		<< " max( " << stat[DISCARDED].max << ")"
-		<< " average(" << average << ")";
+                << " count(" << stat[DISCARDED].count << ")"
+                << " min( " << stat[DISCARDED].min << ")"
+                << " max( " << stat[DISCARDED].max << ")"
+                << " average(" << average << ")";
     }
   }
   std::cout << std::endl;
diff --git a/src/Weight_Profiler.defs.hh b/src/Weight_Profiler.defs.hh
deleted file mode 100644
index 582308c..0000000
--- a/src/Weight_Profiler.defs.hh
+++ /dev/null
@@ -1,154 +0,0 @@
-/* Weight_Profiler class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef Weight_Profiler_defs_hh
-#define Weight_Profiler_defs_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-class Weight_Profiler {
-private:
-  enum { DISCARDED = 0, VALID = 1 };
-
-public:
-  Weight_Profiler(const char* file, int line,
-		  Weightwatch_Traits::Delta delta,
-		  double min_threshold = 0, double max_threshold = 0)
-    : file(file), line(line), delta(delta),
-      min_threshold(min_threshold), max_threshold(max_threshold) {
-    for (int i = 0; i < 2; ++i) {
-      stat[i].samples = 0;
-      stat[i].count = 0;
-      stat[i].sum = 0;
-      stat[i].squares_sum = 0;
-      stat[i].min = 0;
-      stat[i].max = 0;
-    }
-  }
-
-  ~Weight_Profiler() {
-    output_stats();
-  }
-
-  void output_stats();
-
-  static void begin() {
-#ifndef NDEBUG
-    int r = clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
-    assert(r >= 0);
-#else
-    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
-#endif
-  }
-
-  void end(unsigned int factor = 1) {
-    Weightwatch_Traits::weight
-      += (Weightwatch_Traits::Threshold) delta * factor;
-    struct timespec start = stamp;
-    begin();
-    double elapsed;
-    if (stamp.tv_nsec >= start.tv_nsec) {
-      elapsed = (stamp.tv_nsec - start.tv_nsec)
-	+ (stamp.tv_sec - start.tv_sec) * 1e9;
-    }
-    else {
-      elapsed = (1000000000 - start.tv_nsec + stamp.tv_nsec )
-	+ (stamp.tv_sec - start.tv_sec - 1) * 1e9;
-    }
-    elapsed -= adjustment;
-    double elapsed1 = elapsed / factor;
-    int i = (elapsed1 < min_threshold
-             || (max_threshold > 0 && elapsed1 > max_threshold))
-      ? DISCARDED
-      : VALID;
-    ++stat[i].samples;
-    if (stat[i].count == 0)
-      stat[i].min = stat[i].max = elapsed1;
-    else if (stat[i].min > elapsed1)
-      stat[i].min = elapsed1;
-    else if (stat[i].max < elapsed1)
-      stat[i].max = elapsed1;
-    stat[i].sum += elapsed;
-    stat[i].squares_sum += elapsed * elapsed1;
-    stat[i].count += factor;
-  }
-
-  static double tune_adjustment();
-
- private:
-  //! File of this profiling point.
-  const char *file;
-
-  //! Line of this profiling point.
-  int line;
-
-  //! Computational weight to be added at each iteration.
-  Weightwatch_Traits::Delta delta;
-
-  //! Times less than this value are discarded.
-  double min_threshold;
-
-  //! Times greater than this value are discarded.
-  double max_threshold;
-
-  //! Statistical data for samples (both DISCARDED and VALID)
-  struct {
-    //! Number of collected samples.
-    unsigned int samples;
-
-    /*! \brief
-      Number of collected iterations.
-
-      \note
-      Multiple iterations are possibly collected for each sample.
-    */
-    unsigned int count;
-
-    //! Sum of the measured times.
-    double sum;
-
-    //! Sum of the squares of the measured times (to compute variance).
-    double squares_sum;
-
-    //! Minimum measured time.
-    double min;
-
-    //! Maximum measured time.
-    double max;
-  } stat[2];
-
-  //! Holds the time corresponding to last time begin() was called.
-  static struct timespec stamp;
-
-  /*! \brief
-    Time quantity used to adjust the elapsed times so as not to take
-    into account the time spent by the measurement infrastructure.
-  */
-  static double adjustment;
-};
-
-}
-
-#endif // Weight_Profiler_defs_hh
diff --git a/src/Weight_Profiler_defs.hh b/src/Weight_Profiler_defs.hh
new file mode 100644
index 0000000..68e9cb5
--- /dev/null
+++ b/src/Weight_Profiler_defs.hh
@@ -0,0 +1,154 @@
+/* Weight_Profiler class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef Weight_Profiler_defs_hh
+#define Weight_Profiler_defs_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+class Weight_Profiler {
+private:
+  enum { DISCARDED = 0, VALID = 1 };
+
+public:
+  Weight_Profiler(const char* file, int line,
+                  Weightwatch_Traits::Delta delta,
+                  double min_threshold = 0, double max_threshold = 0)
+    : file(file), line(line), delta(delta),
+      min_threshold(min_threshold), max_threshold(max_threshold) {
+    for (int i = 0; i < 2; ++i) {
+      stat[i].samples = 0;
+      stat[i].count = 0;
+      stat[i].sum = 0;
+      stat[i].squares_sum = 0;
+      stat[i].min = 0;
+      stat[i].max = 0;
+    }
+  }
+
+  ~Weight_Profiler() {
+    output_stats();
+  }
+
+  void output_stats();
+
+  static void begin() {
+#ifndef NDEBUG
+    int r = clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
+    assert(r >= 0);
+#else
+    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
+#endif
+  }
+
+  void end(unsigned int factor = 1) {
+    Weightwatch_Traits::weight
+      += (Weightwatch_Traits::Threshold) delta * factor;
+    struct timespec start = stamp;
+    begin();
+    double elapsed;
+    if (stamp.tv_nsec >= start.tv_nsec) {
+      elapsed = (stamp.tv_nsec - start.tv_nsec)
+        + (stamp.tv_sec - start.tv_sec) * 1e9;
+    }
+    else {
+      elapsed = (1000000000 - start.tv_nsec + stamp.tv_nsec )
+        + (stamp.tv_sec - start.tv_sec - 1) * 1e9;
+    }
+    elapsed -= adjustment;
+    double elapsed1 = elapsed / factor;
+    int i = (elapsed1 < min_threshold
+             || (max_threshold > 0 && elapsed1 > max_threshold))
+      ? DISCARDED
+      : VALID;
+    ++stat[i].samples;
+    if (stat[i].count == 0)
+      stat[i].min = stat[i].max = elapsed1;
+    else if (stat[i].min > elapsed1)
+      stat[i].min = elapsed1;
+    else if (stat[i].max < elapsed1)
+      stat[i].max = elapsed1;
+    stat[i].sum += elapsed;
+    stat[i].squares_sum += elapsed * elapsed1;
+    stat[i].count += factor;
+  }
+
+  static double tune_adjustment();
+
+ private:
+  //! File of this profiling point.
+  const char *file;
+
+  //! Line of this profiling point.
+  int line;
+
+  //! Computational weight to be added at each iteration.
+  Weightwatch_Traits::Delta delta;
+
+  //! Times less than this value are discarded.
+  double min_threshold;
+
+  //! Times greater than this value are discarded.
+  double max_threshold;
+
+  //! Statistical data for samples (both DISCARDED and VALID)
+  struct {
+    //! Number of collected samples.
+    unsigned int samples;
+
+    /*! \brief
+      Number of collected iterations.
+
+      \note
+      Multiple iterations are possibly collected for each sample.
+    */
+    unsigned int count;
+
+    //! Sum of the measured times.
+    double sum;
+
+    //! Sum of the squares of the measured times (to compute variance).
+    double squares_sum;
+
+    //! Minimum measured time.
+    double min;
+
+    //! Maximum measured time.
+    double max;
+  } stat[2];
+
+  //! Holds the time corresponding to last time begin() was called.
+  static struct timespec stamp;
+
+  /*! \brief
+    Time quantity used to adjust the elapsed times so as not to take
+    into account the time spent by the measurement infrastructure.
+  */
+  static double adjustment;
+};
+
+}
+
+#endif // Weight_Profiler_defs_hh
diff --git a/src/Widening_Function.defs.hh b/src/Widening_Function.defs.hh
deleted file mode 100644
index f7f9129..0000000
--- a/src/Widening_Function.defs.hh
+++ /dev/null
@@ -1,127 +0,0 @@
-/* Widening_Function class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Widening_Function_defs_hh
-#define PPL_Widening_Function_defs_hh 1
-
-#include "Widening_Function.types.hh"
-#include "Constraint_System.types.hh"
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Wraps a widening method into a function object.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename PSET>
-class Parma_Polyhedra_Library::Widening_Function {
-public:
-  //! The (parametric) type of a widening method.
-  typedef void (PSET::* Widening_Method)(const PSET&, unsigned*);
-
-  //! Explicit unary constructor.
-  explicit
-  Widening_Function(Widening_Method wm);
-
-  //! Function-application operator.
-  /*!
-    Computes <CODE>(x.*wm)(y, tp)</CODE>, where \p wm is the widening
-    method stored at construction time.
-  */
-  void operator()(PSET& x, const PSET& y, unsigned* tp = 0) const;
-
-private:
-  //! The widening method.
-  Widening_Method w_method;
-};
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Wraps a limited widening method into a function object.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename PSET, typename CSYS>
-class Parma_Polyhedra_Library::Limited_Widening_Function {
-public:
-  //! The (parametric) type of a limited widening method.
-  typedef void (PSET::* Limited_Widening_Method)(const PSET&,
-                                                 const CSYS&,
-                                                 unsigned*);
-
-  //! Constructor.
-  /*!
-    \param lwm
-    The limited widening method.
-
-    \param cs
-    The constraint system limiting the widening.
-  */
-  Limited_Widening_Function(Limited_Widening_Method lwm,
-			    const CSYS& cs);
-
-  //! Function-application operator.
-  /*!
-    Computes <CODE>(x.*lwm)(y, cs, tp)</CODE>, where \p lwm and \p cs
-    are the limited widening method and the constraint system stored
-    at construction time.
-  */
-  void operator()(PSET& x, const PSET& y, unsigned* tp = 0) const;
-
-private:
-  //! The limited widening method.
-  Limited_Widening_Method lw_method;
-  //! A constant reference to the constraint system limiting the widening.
-  const CSYS& limiting_cs;
-};
-
-namespace Parma_Polyhedra_Library {
-
-//! Wraps a widening method into a function object.
-/*!
-  \relates Pointset_Powerset
-
-  \param wm
-  The widening method.
-*/
-template <typename PSET>
-Widening_Function<PSET>
-widen_fun_ref(void (PSET::* wm)(const PSET&, unsigned*));
-
-//! Wraps a limited widening method into a function object.
-/*!
-  \relates Pointset_Powerset
-
-  \param lwm
-  The limited widening method.
-
-  \param cs
-  The constraint system limiting the widening.
-*/
-template <typename PSET, typename CSYS>
-Limited_Widening_Function<PSET, CSYS>
-widen_fun_ref(void (PSET::* lwm)(const PSET&, const CSYS&, unsigned*),
-	      const CSYS& cs);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Widening_Function.inlines.hh"
-
-#endif // !defined(PPL_Widening_Function_defs_hh)
diff --git a/src/Widening_Function.inlines.hh b/src/Widening_Function.inlines.hh
deleted file mode 100644
index dc4e4bc..0000000
--- a/src/Widening_Function.inlines.hh
+++ /dev/null
@@ -1,75 +0,0 @@
-/* Widening_Function class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Widening_Function_inlines_hh
-#define PPL_Widening_Function_inlines_hh 1
-
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-Widening_Function<PSET>::Widening_Function(Widening_Method wm)
-  : w_method(wm) {
-}
-
-template <typename PSET>
-inline void
-Widening_Function<PSET>::
-operator()(PSET& x, const PSET& y, unsigned* tp) const {
-  (x.*w_method)(y, tp);
-}
-
-template <typename PSET, typename CSYS>
-Limited_Widening_Function<PSET, CSYS>::
-Limited_Widening_Function(Limited_Widening_Method lwm,
-			  const CSYS& cs)
-  : lw_method(lwm), limiting_cs(cs) {
-}
-
-template <typename PSET, typename CSYS>
-inline void
-Limited_Widening_Function<PSET, CSYS>::
-operator()(PSET& x, const PSET& y, unsigned* tp) const {
-  (x.*lw_method)(y, limiting_cs, tp);
-}
-
-/*! \relates Pointset_Powerset */
-template <typename PSET>
-inline Widening_Function<PSET>
-widen_fun_ref(void (PSET::* wm)(const PSET&, unsigned*)) {
-  return Widening_Function<PSET>(wm);
-}
-
-/*! \relates Pointset_Powerset */
-template <typename PSET, typename CSYS>
-inline Limited_Widening_Function<PSET, CSYS>
-widen_fun_ref(void (PSET::* lwm)(const PSET&, const CSYS&, unsigned*),
-	      const CSYS& cs) {
-  return Limited_Widening_Function<PSET, CSYS>(lwm, cs);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-
-#endif // !defined(PPL_Widening_Function_inlines_hh)
diff --git a/src/Widening_Function.types.hh b/src/Widening_Function.types.hh
deleted file mode 100644
index 7931150..0000000
--- a/src/Widening_Function.types.hh
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Widening_Function_types_hh
-#define PPL_Widening_Function_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename PSET>
-class Widening_Function;
-
-template <typename PSET, typename CSYS>
-class Limited_Widening_Function;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Widening_Function_types_hh)
diff --git a/src/Widening_Function_defs.hh b/src/Widening_Function_defs.hh
new file mode 100644
index 0000000..f2611b1
--- /dev/null
+++ b/src/Widening_Function_defs.hh
@@ -0,0 +1,127 @@
+/* Widening_Function class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Widening_Function_defs_hh
+#define PPL_Widening_Function_defs_hh 1
+
+#include "Widening_Function_types.hh"
+#include "Constraint_System_types.hh"
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Wraps a widening method into a function object.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename PSET>
+class Parma_Polyhedra_Library::Widening_Function {
+public:
+  //! The (parametric) type of a widening method.
+  typedef void (PSET::* Widening_Method)(const PSET&, unsigned*);
+
+  //! Explicit unary constructor.
+  explicit
+  Widening_Function(Widening_Method wm);
+
+  //! Function-application operator.
+  /*!
+    Computes <CODE>(x.*wm)(y, tp)</CODE>, where \p wm is the widening
+    method stored at construction time.
+  */
+  void operator()(PSET& x, const PSET& y, unsigned* tp = 0) const;
+
+private:
+  //! The widening method.
+  Widening_Method w_method;
+};
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Wraps a limited widening method into a function object.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename PSET, typename CSYS>
+class Parma_Polyhedra_Library::Limited_Widening_Function {
+public:
+  //! The (parametric) type of a limited widening method.
+  typedef void (PSET::* Limited_Widening_Method)(const PSET&,
+                                                 const CSYS&,
+                                                 unsigned*);
+
+  //! Constructor.
+  /*!
+    \param lwm
+    The limited widening method.
+
+    \param cs
+    The constraint system limiting the widening.
+  */
+  Limited_Widening_Function(Limited_Widening_Method lwm,
+                            const CSYS& cs);
+
+  //! Function-application operator.
+  /*!
+    Computes <CODE>(x.*lwm)(y, cs, tp)</CODE>, where \p lwm and \p cs
+    are the limited widening method and the constraint system stored
+    at construction time.
+  */
+  void operator()(PSET& x, const PSET& y, unsigned* tp = 0) const;
+
+private:
+  //! The limited widening method.
+  Limited_Widening_Method lw_method;
+  //! A constant reference to the constraint system limiting the widening.
+  const CSYS& limiting_cs;
+};
+
+namespace Parma_Polyhedra_Library {
+
+//! Wraps a widening method into a function object.
+/*!
+  \relates Pointset_Powerset
+
+  \param wm
+  The widening method.
+*/
+template <typename PSET>
+Widening_Function<PSET>
+widen_fun_ref(void (PSET::* wm)(const PSET&, unsigned*));
+
+//! Wraps a limited widening method into a function object.
+/*!
+  \relates Pointset_Powerset
+
+  \param lwm
+  The limited widening method.
+
+  \param cs
+  The constraint system limiting the widening.
+*/
+template <typename PSET, typename CSYS>
+Limited_Widening_Function<PSET, CSYS>
+widen_fun_ref(void (PSET::* lwm)(const PSET&, const CSYS&, unsigned*),
+              const CSYS& cs);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Widening_Function_inlines.hh"
+
+#endif // !defined(PPL_Widening_Function_defs_hh)
diff --git a/src/Widening_Function_inlines.hh b/src/Widening_Function_inlines.hh
new file mode 100644
index 0000000..8b46af2
--- /dev/null
+++ b/src/Widening_Function_inlines.hh
@@ -0,0 +1,75 @@
+/* Widening_Function class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Widening_Function_inlines_hh
+#define PPL_Widening_Function_inlines_hh 1
+
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+Widening_Function<PSET>::Widening_Function(Widening_Method wm)
+  : w_method(wm) {
+}
+
+template <typename PSET>
+inline void
+Widening_Function<PSET>::
+operator()(PSET& x, const PSET& y, unsigned* tp) const {
+  (x.*w_method)(y, tp);
+}
+
+template <typename PSET, typename CSYS>
+Limited_Widening_Function<PSET, CSYS>::
+Limited_Widening_Function(Limited_Widening_Method lwm,
+                          const CSYS& cs)
+  : lw_method(lwm), limiting_cs(cs) {
+}
+
+template <typename PSET, typename CSYS>
+inline void
+Limited_Widening_Function<PSET, CSYS>::
+operator()(PSET& x, const PSET& y, unsigned* tp) const {
+  (x.*lw_method)(y, limiting_cs, tp);
+}
+
+/*! \relates Pointset_Powerset */
+template <typename PSET>
+inline Widening_Function<PSET>
+widen_fun_ref(void (PSET::* wm)(const PSET&, unsigned*)) {
+  return Widening_Function<PSET>(wm);
+}
+
+/*! \relates Pointset_Powerset */
+template <typename PSET, typename CSYS>
+inline Limited_Widening_Function<PSET, CSYS>
+widen_fun_ref(void (PSET::* lwm)(const PSET&, const CSYS&, unsigned*),
+              const CSYS& cs) {
+  return Limited_Widening_Function<PSET, CSYS>(lwm, cs);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+
+#endif // !defined(PPL_Widening_Function_inlines_hh)
diff --git a/src/Widening_Function_types.hh b/src/Widening_Function_types.hh
new file mode 100644
index 0000000..54a7cdb
--- /dev/null
+++ b/src/Widening_Function_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Widening_Function_types_hh
+#define PPL_Widening_Function_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename PSET>
+class Widening_Function;
+
+template <typename PSET, typename CSYS>
+class Limited_Widening_Function;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Widening_Function_types_hh)
diff --git a/src/algorithms.hh b/src/algorithms.hh
index 65b6ac3..333240c 100644
--- a/src/algorithms.hh
+++ b/src/algorithms.hh
@@ -1,6 +1,6 @@
 /* A collection of useful convex polyhedra algorithms: inline functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,8 +24,8 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_algorithms_hh
 #define PPL_algorithms_hh 1
 
-#include "NNC_Polyhedron.defs.hh"
-#include "Pointset_Powerset.defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Pointset_Powerset_defs.hh"
 #include <utility>
 #include "assert.hh"
 
diff --git a/src/assert.cc b/src/assert.cc
index 284d296..fe2cdf0 100644
--- a/src/assert.cc
+++ b/src/assert.cc
@@ -1,6 +1,6 @@
 /* Definitions of assert-like functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/assert.hh b/src/assert.hh
index 3c64266..c4fe5ff 100644
--- a/src/assert.hh
+++ b/src/assert.hh
@@ -1,6 +1,6 @@
 /* Implementation of PPL assert-like macros.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/assign_or_swap.hh b/src/assign_or_swap.hh
index 3acdfe5..53e97e9 100644
--- a/src/assign_or_swap.hh
+++ b/src/assign_or_swap.hh
@@ -1,6 +1,6 @@
 /* The assign_or_swap() utility functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/c_streambuf.cc b/src/c_streambuf.cc
index fdd630f..a15499a 100644
--- a/src/c_streambuf.cc
+++ b/src/c_streambuf.cc
@@ -1,6 +1,6 @@
 /* c_streambuf class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,15 +22,15 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "c_streambuf.defs.hh"
-#include "globals.defs.hh"
+#include "c_streambuf_defs.hh"
+#include "globals_defs.hh"
 #include "assert.hh"
 
 namespace Parma_Polyhedra_Library {
 
 c_streambuf::int_type
 c_streambuf::uflow() {
-  int_type c = underflow();
+  const int_type c = underflow();
   next_char_buf = traits_type::eof();
   return c;
 }
@@ -81,7 +81,7 @@ c_streambuf::pbackfail(int_type c) {
 std::streamsize
 c_streambuf::xsputn(const char_type* s, std::streamsize n) {
   PPL_ASSERT(n >= 0);
-  size_t r = cb_write(s, static_cast<size_t>(n));
+  const size_t r = cb_write(s, static_cast<size_t>(n));
   return static_cast<std::streamsize>(r);
 }
 
diff --git a/src/c_streambuf.defs.hh b/src/c_streambuf.defs.hh
deleted file mode 100644
index 2a349af..0000000
--- a/src/c_streambuf.defs.hh
+++ /dev/null
@@ -1,127 +0,0 @@
-/* c_streambuf class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_c_streambuf_defs_hh
-#define PPL_c_streambuf_defs_hh 1
-
-#include "c_streambuf.types.hh"
-#include <streambuf>
-#include <cstddef>
-
-class Parma_Polyhedra_Library::c_streambuf
-  : public std::basic_streambuf<char, std::char_traits<char> > {
-public:
-  //! Constructor.
-  c_streambuf();
-
-  //! Destructor.
-  virtual ~c_streambuf();
-
-protected:
-  /*! \brief
-    Gets a character in case of underflow.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
-  */
-  virtual int_type underflow();
-
-  /*! \brief
-    In case of underflow, gets a character and advances the next pointer.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
-  */
-  virtual int_type uflow();
-
-  /*! \brief
-    Gets a sequence of characters.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
-  */
-  virtual std::streamsize xsgetn(char_type* s, std::streamsize n);
-
-  /*! \brief
-    Puts character back in case of backup underflow.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.4.
-  */
-  virtual int_type pbackfail(int_type c = traits_type::eof());
-
-  /*! \brief
-    Writes a sequence of characters.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
-  */
-  virtual std::streamsize xsputn(const char_type* s, std::streamsize n);
-
-  /*! \brief
-    Writes a character in case of overflow.
-
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
-  */
-  virtual int_type overflow(int_type c);
-
-  /*! \brief
-    Synchronizes the stream buffer.
-
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.2.
-  */
-  virtual int sync();
-
-private:
-  //! Character type of the streambuf.
-  typedef char char_type;
-
-  //! Traits type of the streambuf.
-  typedef std::char_traits<char_type> traits_type;
-
-  //! Integer type of the streambuf.
-  typedef traits_type::int_type int_type;
-
-  //! Buffer for the last character read.
-  int_type unget_char_buf;
-
-  //! Buffer for next character
-  int_type next_char_buf;
-
-  virtual size_t cb_read(char *, size_t) {
-    return 0;
-  }
-  virtual size_t cb_write(const char *, size_t) {
-    return 0;
-  }
-  virtual int cb_sync() {
-    return 0;
-  }
-  virtual int cb_flush() {
-    return 0;
-  }
-};
-
-#include "c_streambuf.inlines.hh"
-
-#endif // !defined(PPL_c_streambuf_defs_hh)
diff --git a/src/c_streambuf.inlines.hh b/src/c_streambuf.inlines.hh
deleted file mode 100644
index d15af79..0000000
--- a/src/c_streambuf.inlines.hh
+++ /dev/null
@@ -1,40 +0,0 @@
-/* c_streambuf class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_c_streambuf_inlines_hh
-#define PPL_c_streambuf_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-c_streambuf::c_streambuf()
-  : unget_char_buf(traits_type::eof()), next_char_buf(traits_type::eof()) {
-}
-
-inline
-c_streambuf::~c_streambuf() {
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_c_streambuf_inlines_hh)
diff --git a/src/c_streambuf.types.hh b/src/c_streambuf.types.hh
deleted file mode 100644
index ece3919..0000000
--- a/src/c_streambuf.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_c_streambuf_types_hh
-#define PPL_c_streambuf_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class c_streambuf;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_c_streambuf_types_hh)
diff --git a/src/c_streambuf_defs.hh b/src/c_streambuf_defs.hh
new file mode 100644
index 0000000..0bbf9e6
--- /dev/null
+++ b/src/c_streambuf_defs.hh
@@ -0,0 +1,127 @@
+/* c_streambuf class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_c_streambuf_defs_hh
+#define PPL_c_streambuf_defs_hh 1
+
+#include "c_streambuf_types.hh"
+#include <streambuf>
+#include <cstddef>
+
+class Parma_Polyhedra_Library::c_streambuf
+  : public std::basic_streambuf<char, std::char_traits<char> > {
+public:
+  //! Constructor.
+  c_streambuf();
+
+  //! Destructor.
+  virtual ~c_streambuf();
+
+protected:
+  /*! \brief
+    Gets a character in case of underflow.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
+  */
+  virtual int_type underflow();
+
+  /*! \brief
+    In case of underflow, gets a character and advances the next pointer.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
+  */
+  virtual int_type uflow();
+
+  /*! \brief
+    Gets a sequence of characters.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
+  */
+  virtual std::streamsize xsgetn(char_type* s, std::streamsize n);
+
+  /*! \brief
+    Puts character back in case of backup underflow.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.4.
+  */
+  virtual int_type pbackfail(int_type c = traits_type::eof());
+
+  /*! \brief
+    Writes a sequence of characters.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
+  */
+  virtual std::streamsize xsputn(const char_type* s, std::streamsize n);
+
+  /*! \brief
+    Writes a character in case of overflow.
+
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
+  */
+  virtual int_type overflow(int_type c);
+
+  /*! \brief
+    Synchronizes the stream buffer.
+
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.2.
+  */
+  virtual int sync();
+
+private:
+  //! Character type of the streambuf.
+  typedef char char_type;
+
+  //! Traits type of the streambuf.
+  typedef std::char_traits<char_type> traits_type;
+
+  //! Integer type of the streambuf.
+  typedef traits_type::int_type int_type;
+
+  //! Buffer for the last character read.
+  int_type unget_char_buf;
+
+  //! Buffer for next character
+  int_type next_char_buf;
+
+  virtual size_t cb_read(char *, size_t) {
+    return 0;
+  }
+  virtual size_t cb_write(const char *, size_t) {
+    return 0;
+  }
+  virtual int cb_sync() {
+    return 0;
+  }
+  virtual int cb_flush() {
+    return 0;
+  }
+};
+
+#include "c_streambuf_inlines.hh"
+
+#endif // !defined(PPL_c_streambuf_defs_hh)
diff --git a/src/c_streambuf_inlines.hh b/src/c_streambuf_inlines.hh
new file mode 100644
index 0000000..5cc069a
--- /dev/null
+++ b/src/c_streambuf_inlines.hh
@@ -0,0 +1,40 @@
+/* c_streambuf class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_c_streambuf_inlines_hh
+#define PPL_c_streambuf_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+c_streambuf::c_streambuf()
+  : unget_char_buf(traits_type::eof()), next_char_buf(traits_type::eof()) {
+}
+
+inline
+c_streambuf::~c_streambuf() {
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_c_streambuf_inlines_hh)
diff --git a/src/c_streambuf_types.hh b/src/c_streambuf_types.hh
new file mode 100644
index 0000000..c5bad41
--- /dev/null
+++ b/src/c_streambuf_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_c_streambuf_types_hh
+#define PPL_c_streambuf_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class c_streambuf;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_c_streambuf_types_hh)
diff --git a/src/checked.cc b/src/checked.cc
index bd6c118..3cbc4ba 100644
--- a/src/checked.cc
+++ b/src/checked.cc
@@ -1,6 +1,6 @@
 /* Helper functions for checked numbers.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "checked.defs.hh"
+#include "checked_defs.hh"
 #include "C_Integer.hh"
 
 namespace Parma_Polyhedra_Library {
@@ -294,7 +294,7 @@ parse_number_part(std::istream& is, number_struct& numer) {
       is.unget();
       goto ok;
     case EXPONENT:
-      int d = get_digit(c, 10);
+      const int d = get_digit(c, 10);
       if (d >= 0) {
         empty_exponent = false;
         if (numer.exponent > max_exp_div
@@ -339,10 +339,10 @@ parse_number_part(std::istream& is, number_struct& numer) {
   return V_CVT_STR_UNK;
 }
 
-/* \brief
-   Reads a number from \p is writing it into \p numer, the numerator,
-   and \p denom, the denominator; the appropriate Result value is
-   returned.
+/*! \brief
+  Reads a number from \p is writing it into \p numer, the numerator,
+  and \p denom, the denominator; the appropriate Result value is
+  returned.
 */
 Result
 parse_number(std::istream& is, number_struct& numer, number_struct& denom) {
@@ -388,7 +388,7 @@ Result
 input_mpq(mpq_class& to, std::istream& is) {
   number_struct numer_struct;
   number_struct denom_struct;
-  Result r = parse_number(is, numer_struct, denom_struct);
+  const Result r = parse_number(is, numer_struct, denom_struct);
   if (r == V_CVT_STR_UNK) {
     is.setstate(is.failbit);
     return r;
@@ -402,8 +402,8 @@ input_mpq(mpq_class& to, std::istream& is) {
     to = 0;
     return V_EQ;
   }
-  mpz_ptr numer = to.get_num().get_mpz_t();
-  mpz_ptr denom = to.get_den().get_mpz_t();
+  const mpz_ptr numer = to.get_num().get_mpz_t();
+  const mpz_ptr denom = to.get_den().get_mpz_t();
   mpz_set_str(numer, numer_struct.mantissa.c_str(),
               static_cast<int>(numer_struct.base));
   if (denom_struct.base != 0) {
@@ -463,9 +463,9 @@ input_mpq(mpq_class& to, std::istream& is) {
 
 /* NOTE: q is overwritten! */
 std::string float_mpq_to_string(mpq_class& q) {
-  mpz_ptr n = q.get_num().get_mpz_t();
-  mpz_ptr d = q.get_den().get_mpz_t();
-  unsigned long decimals = mpz_sizeinbase(d, 2) - 1;
+  const mpz_ptr n = q.get_num().get_mpz_t();
+  const mpz_ptr d = q.get_den().get_mpz_t();
+  const unsigned long decimals = mpz_sizeinbase(d, 2) - 1;
   if (decimals != 0) {
     mpz_ui_pow_ui(d, 5, decimals);
     mpz_mul(n, n, d);
@@ -478,13 +478,13 @@ std::string float_mpq_to_string(mpq_class& q) {
   char buf[bufsize];
   mpz_get_str(buf, 10, n);
   if (decimals != 0) {
-    size_t len = strlen(buf);
+    const size_t len = strlen(buf);
     if (decimals < len) {
       memmove(&buf[len - decimals + 1], &buf[len - decimals], decimals + 1);
       buf[len - decimals] = '.';
     }
     else {
-      size_t zeroes = decimals - len;
+      const size_t zeroes = decimals - len;
       memmove(&buf[2 + zeroes], &buf[0], len + 1);
       buf[0] = '0';
       buf[1] = '.';
diff --git a/src/checked.defs.hh b/src/checked.defs.hh
deleted file mode 100644
index c04cf36..0000000
--- a/src/checked.defs.hh
+++ /dev/null
@@ -1,716 +0,0 @@
-/* Abstract checked arithmetic function container.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_defs_hh
-#define PPL_checked_defs_hh 1
-
-#include <cassert>
-#include <iostream>
-#include <gmpxx.h>
-#include "mp_std_bits.defs.hh"
-#include "Temp.defs.hh"
-#include "Rounding_Dir.defs.hh"
-#include "Numeric_Format.defs.hh"
-#include "Float.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-namespace Checked {
-
-
-// It is a pity that function partial specialization is not permitted
-// by C++.  To (partly) overcome this limitation, we use class
-// encapsulated functions and partial specialization of containing
-// classes.
-
-#define PPL_FUNCTION_CLASS(name) name ## _function_struct
-
-#define PPL_DECLARE_FUN1_0_0(name, ret_type, qual, type)                \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg) {           \
-    return PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg); \
-  }
-
-#define PPL_DECLARE_FUN1_0_1(name, ret_type, qual, type, after1)        \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg, PPL_U(after1) a1) { \
-    return                                                              \
-      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg, a1); \
-  }
-
-#define PPL_DECLARE_FUN1_0_2(name, ret_type, qual, type, after1, after2) \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg, PPL_U(after1) a1, \
-                       PPL_U(after2) a2) {                              \
-    return                                                              \
-      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg,      \
-                                                              a1, a2);  \
-  }
-
-#define PPL_DECLARE_FUN1_0_3(name, ret_type, qual, type,                \
-                             after1, after2, after3)                    \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg,             \
-                       PPL_U(after1) a1, PPL_U(after2) a2,              \
-                       PPL_U(after3) a3) {                              \
-    return                                                              \
-      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg,      \
-                                                              a1, a2,   \
-                                                              a3);      \
-  }
-
-#define PPL_DECLARE_FUN1_1_1(name, ret_type, before1, qual, type, after1) \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(before1) b1, PPL_U(qual) PPL_U(type)& arg, \
-                       PPL_U(after1) a1) {                              \
-    return                                                              \
-      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(b1, arg,  \
-                                                              a1);      \
-  }
-
-#define PPL_DECLARE_FUN1_1_2(name, ret_type, before1, qual, type,       \
-                             after1, after2)                            \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(before1) b1, PPL_U(qual) PPL_U(type)& arg, \
-                       PPL_U(after1) a1, PPL_U(after2) a2) {            \
-    return                                                              \
-      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(b1, arg,  \
-                                                              a1, a2);  \
-  }
-
-#define PPL_DECLARE_FUN1_2_2(name, ret_type, before1, before2, qual, type, \
-                             after1, after2)                            \
-  template <typename Policy, typename type>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy, typename type>                             \
-  inline ret_type PPL_U(name)(PPL_U(before1) b1, PPL_U(before2) b2,     \
-                       PPL_U(qual) PPL_U(type)& arg,                    \
-                       PPL_U(after1) a1, PPL_U(after2) a2) {            \
-    return                                                              \
-      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(b1, b2,   \
-                                                              arg,      \
-                                                              a1, a2);  \
-  }
-
-#define PPL_DECLARE_FUN2_0_0(name, ret_type, qual1, type1, qual2, type2) \
-  template <typename Policy1, typename Policy2,                         \
-            typename type1, typename type2>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy1, typename Policy2,                         \
-            typename type1, typename type2>                             \
-  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,          \
-                       PPL_U(qual2) PPL_U(type2)& arg2) {               \
-    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2,                   \
-      type1, PPL_U(type2)>::function(arg1, arg2);                       \
-  }
-
-#define PPL_DECLARE_FUN2_0_1(name, ret_type, qual1, type1,      \
-                             qual2, type2, after1)              \
-  template <typename Policy1, typename Policy2,                 \
-            typename type1, typename type2>                     \
-  struct PPL_FUNCTION_CLASS(name);                              \
-  template <typename Policy1, typename Policy2,                 \
-            typename type1, typename type2>                     \
-  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,  \
-                       PPL_U(qual2) PPL_U(type2)& arg2,         \
-                       PPL_U(after1) a1) {                      \
-    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2,           \
-      type1, PPL_U(type2)>::function(arg1, arg2, a1);           \
-  }
-
-#define PPL_DECLARE_FUN2_0_2(name, ret_type, qual1, type1, qual2, type2, \
-                             after1, after2)                            \
-  template <typename Policy1, typename Policy2,                         \
-            typename type1, typename type2>                             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy1, typename Policy2,                         \
-            typename type1, typename type2>                             \
-  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,          \
-                       PPL_U(qual2) PPL_U(type2)& arg2,                 \
-                       PPL_U(after1) a1, PPL_U(after2) a2) {            \
-    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2,                   \
-      type1, PPL_U(type2)>::function(arg1, arg2, a1, a2);               \
-  }
-
-#define PPL_DECLARE_FUN3_0_1(name, ret_type, qual1, type1,              \
-                             qual2, type2, qual3, type3, after1)        \
-  template <typename Policy1, typename Policy2, typename Policy3,       \
-            typename type1, typename type2, typename type3>             \
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy1, typename Policy2, typename Policy3,       \
-            typename type1, typename type2, typename type3>             \
-  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,          \
-                       PPL_U(qual2) PPL_U(type2)& arg2,                 \
-                       PPL_U(qual3) PPL_U(type3)& arg3,                 \
-                       PPL_U(after1) a1) {                              \
-    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2, Policy3,          \
-      type1, type2, PPL_U(type3)>                                       \
-      ::function(arg1, arg2, arg3, a1);                                 \
-  }
-
-#define PPL_DECLARE_FUN5_0_1(name, ret_type,				\
-                             qual1, type1, qual2, type2, qual3, type3,	\
-                             qual4, type4, qual5, type5,                \
-                             after1)					\
-  template <typename Policy1, typename Policy2, typename Policy3,       \
-            typename Policy4,typename Policy5,				\
-            typename type1, typename type2, typename type3,		\
-            typename type4, typename type5>				\
-  struct PPL_FUNCTION_CLASS(name);                                      \
-  template <typename Policy1, typename Policy2, typename Policy3,       \
-            typename Policy4,typename Policy5,				\
-            typename type1, typename type2, typename type3,		\
-            typename type4, typename type5>				\
-  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1, PPL_U(qual2) \
-                       PPL_U(type2)& arg2,                              \
-                       PPL_U(qual3) PPL_U(type3)& arg3, PPL_U(qual4)    \
-                       PPL_U(type4)& arg4,                              \
-                       PPL_U(qual5) PPL_U(type5)& arg5,                 \
-                       PPL_U(after1) a1) {                              \
-    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2, Policy3,          \
-      Policy4, Policy5,                                                 \
-      type1, type2,                                                     \
-      type3, type4,                                                     \
-      PPL_U(type5)>                                                     \
-      ::function(arg1, arg2, arg3, arg4, arg5, a1);			\
-  }
-
-#define PPL_SPECIALIZE_FUN1_0_0(name, func, ret_type, qual, type)       \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg) {     \
-      return PPL_U(func)<Policy>(arg);                                  \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN1_0_1(name, func, ret_type, qual, type, after1) \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg,       \
-                                    PPL_U(after1) a1) {                 \
-      return PPL_U(func)<Policy>(arg, a1);                              \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN1_0_2(name, func, ret_type, qual, type,       \
-                                after1, after2)                         \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg,       \
-                                    PPL_U(after1) a1, PPL_U(after2) a2) \
-    {                                                                   \
-      return PPL_U(func)<Policy>(arg, a1, a2);                          \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN1_0_3(name, func, ret_type, qual, type,       \
-                                after1, after2, after3)                 \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg,       \
-                                    PPL_U(after1) a1, PPL_U(after2) a2, \
-                                    PPL_U(after3) a3) {                 \
-      return PPL_U(func)<Policy>(arg, a1, a2, a3);                      \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN1_1_1(name, func, ret_type, before1,          \
-                                qual, type, after1)                     \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(before1) b1, PPL_U(qual)      \
-                                    PPL_U(type)& arg,                   \
-                                    PPL_U(after1) a1) {                 \
-      return PPL_U(func)<Policy>(b1, arg, a1);                          \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN1_1_2(name, func, ret_type, before1,          \
-                                qual, type, after1, after2)             \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(before1) b1, PPL_U(qual)      \
-                                    PPL_U(type)& arg,                   \
-                                    PPL_U(after1) a1, PPL_U(after2) a2) \
-    {                                                                   \
-      return PPL_U(func)<Policy>(b1, arg, a1, a2);                      \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN1_2_2(name, func, ret_type, before1, before2, \
-                                qual, type, after1, after2)             \
-  template <typename Policy>                                            \
-  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
-    static inline ret_type function(PPL_U(before1) b1, PPL_U(before2) b2, \
-                                    PPL_U(qual) PPL_U(type)& arg,       \
-                                    PPL_U(after1) a1, PPL_U(after2) a2) \
-    {                                                                   \
-      return PPL_U(func)<Policy>(b1, b2, arg, a1, a2);                  \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN2_0_0(name, func, ret_type, qual1, type1,     \
-                                qual2, type2)                           \
-  template <typename Policy1, typename Policy2>				\
-  struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
-                                  PPL_U(type2)> {                       \
-    static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
-                                    PPL_U(qual2) PPL_U(type2) &arg2) {  \
-      return PPL_U(func)<Policy1, Policy2>(arg1, arg2);                 \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN2_0_1(name, func, ret_type, qual1, type1,     \
-                                qual2, type2, after1)                   \
-  template <typename Policy1, typename Policy2>                         \
-  struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
-                                  PPL_U(type2)> {                       \
-    static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
-                                    PPL_U(qual2) PPL_U(type2) &arg2,    \
-                                    PPL_U(after1) a1) {                 \
-      return PPL_U(func)<Policy1, Policy2>(arg1, arg2, a1);             \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN2_0_2(name, func, ret_type, qual1, type1,     \
-                                qual2, type2, after1, after2)           \
-  template <typename Policy1, typename Policy2>                         \
-  struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
-                                  PPL_U(type2)> {                       \
-    static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
-                                    PPL_U(qual2) PPL_U(type2) &arg2,    \
-                                    PPL_U(after1) a1, PPL_U(after2) a2) \
-    {                                                                   \
-      return PPL_U(func)<Policy1, Policy2>(arg1, arg2, a1, a2);         \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN3_0_1(name, func, ret_type, qual1, type1,     \
-                                qual2, type2, qual3, type3, after1)     \
-  template <typename Policy1, typename Policy2, typename Policy3>       \
-  struct PPL_FUNCTION_CLASS(name) <Policy1, Policy2, Policy3,           \
-                                   type1, type2,                        \
-                                   PPL_U(type3)> {                      \
-    static inline Result function(PPL_U(qual1) PPL_U(type1)& arg1,      \
-                                  PPL_U(qual2) PPL_U(type2) &arg2,      \
-                                  PPL_U(qual3) PPL_U(type3) &arg3,      \
-                                  PPL_U(after1) a1) {                   \
-      return PPL_U(func)<Policy1, Policy2, Policy3>(arg1, arg2, arg3,   \
-                                                    a1);                \
-    }                                                                   \
-  };
-
-#define PPL_SPECIALIZE_FUN5_0_1(name, func, ret_type,                   \
-                                qual1, type1, qual2, type2,             \
-                                qual3, type3,                           \
-                                qual4, type4, qual5, type5, after1)     \
-  template <typename Policy1, typename Policy2, typename Policy3,	\
-	    typename Policy4, typename Policy5>				\
-  struct PPL_FUNCTION_CLASS(name) <Policy1, Policy2, Policy3, Policy4,  \
-                                   Policy5,                             \
-                                   type1, type2,                        \
-                                   type3, type4,                        \
-                                   PPL_U(type5)> {                      \
-    static inline Result                                                \
-      function(PPL_U(qual1) PPL_U(type1)& arg1, PPL_U(qual2)            \
-               PPL_U(type2) &arg2,                                      \
-               PPL_U(qual3) PPL_U(type3) &arg3, PPL_U(qual4)            \
-               PPL_U(type4) &arg4,                                      \
-               PPL_U(qual5) PPL_U(type5) &arg5, PPL_U(after1) a1) {     \
-      return PPL_U(func)<Policy1, Policy2, Policy3, Policy4,            \
-        Policy5>(arg1, arg2, arg3, arg4, arg5, a1);                     \
-    }									\
-  };
-
-// The `nonconst' macro helps readability of the sequel.
-#ifdef nonconst
-#define PPL_SAVED_nonconst nonconst
-#undef nonconst
-#endif
-#define nonconst
-
-#define PPL_SPECIALIZE_COPY(func, Type)                                 \
-  PPL_SPECIALIZE_FUN2_0_0(copy, func, void, nonconst, Type, const, Type)
-#define PPL_SPECIALIZE_SGN(func, From)                                  \
-  PPL_SPECIALIZE_FUN1_0_0(sgn, func, Result_Relation, const, From)
-#define PPL_SPECIALIZE_CMP(func, Type1, Type2)                          \
-  PPL_SPECIALIZE_FUN2_0_0(cmp, func, Result_Relation, const, Type1, const, Type2)
-#define PPL_SPECIALIZE_CLASSIFY(func, Type)                             \
-  PPL_SPECIALIZE_FUN1_0_3(classify, func, Result, const, Type, bool, bool, bool)
-#define PPL_SPECIALIZE_IS_NAN(func, Type)                       \
-  PPL_SPECIALIZE_FUN1_0_0(is_nan, func, bool, const, Type)
-#define PPL_SPECIALIZE_IS_MINF(func, Type)                      \
-  PPL_SPECIALIZE_FUN1_0_0(is_minf, func, bool, const, Type)
-#define PPL_SPECIALIZE_IS_PINF(func, Type)                      \
-  PPL_SPECIALIZE_FUN1_0_0(is_pinf, func, bool, const, Type)
-#define PPL_SPECIALIZE_IS_INT(func, Type)                       \
-  PPL_SPECIALIZE_FUN1_0_0(is_int, func, bool, const, Type)
-#define PPL_SPECIALIZE_ASSIGN_SPECIAL(func, Type)                       \
-  PPL_SPECIALIZE_FUN1_0_2(assign_special, func, Result,                 \
-                          nonconst, Type, Result_Class, Rounding_Dir)
-#define PPL_SPECIALIZE_CONSTRUCT_SPECIAL(func, Type)                    \
-  PPL_SPECIALIZE_FUN1_0_2(construct_special, func, Result, nonconst,    \
-                          Type, Result_Class, Rounding_Dir)
-#define PPL_SPECIALIZE_CONSTRUCT(func, To, From)                        \
-  PPL_SPECIALIZE_FUN2_0_1(construct, func, Result, nonconst, To,        \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_ASSIGN(func, To, From)                   \
-  PPL_SPECIALIZE_FUN2_0_1(assign, func, Result, nonconst, To,   \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_FLOOR(func, To, From)                    \
-  PPL_SPECIALIZE_FUN2_0_1(floor, func, Result, nonconst, To,    \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_CEIL(func, To, From)                     \
-  PPL_SPECIALIZE_FUN2_0_1(ceil, func, Result, nonconst, To,     \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_TRUNC(func, To, From)                    \
-  PPL_SPECIALIZE_FUN2_0_1(trunc, func, Result, nonconst, To,    \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_NEG(func, To, From)                      \
-  PPL_SPECIALIZE_FUN2_0_1(neg, func, Result, nonconst, To,      \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_ABS(func, To, From)                      \
-  PPL_SPECIALIZE_FUN2_0_1(abs, func, Result, nonconst, To,      \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_SQRT(func, To, From)                     \
-  PPL_SPECIALIZE_FUN2_0_1(sqrt, func, Result, nonconst, To,     \
-                          const, From, Rounding_Dir)
-#define PPL_SPECIALIZE_ADD(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(add, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_SUB(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(sub, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_MUL(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(mul, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_DIV(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(div, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_REM(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(rem, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_IDIV(func, To, From1, From2)                     \
-  PPL_SPECIALIZE_FUN3_0_1(idiv, func, Result, nonconst, To,             \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_ADD_2EXP(func, To, From)                         \
-  PPL_SPECIALIZE_FUN2_0_2(add_2exp, func, Result, nonconst, To,         \
-                          const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_SUB_2EXP(func, To, From)                         \
-  PPL_SPECIALIZE_FUN2_0_2(sub_2exp, func, Result, nonconst, To,         \
-                          const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_MUL_2EXP(func, To, From)                         \
-  PPL_SPECIALIZE_FUN2_0_2(mul_2exp, func, Result, nonconst, To,         \
-                          const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_DIV_2EXP(func, To, From)                         \
-  PPL_SPECIALIZE_FUN2_0_2(div_2exp, func, Result, nonconst, To,         \
-                          const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_SMOD_2EXP(func, To, From)			\
-  PPL_SPECIALIZE_FUN2_0_2(smod_2exp, func, Result, nonconst, To,	\
-                          const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_UMOD_2EXP(func, To, From)			\
-  PPL_SPECIALIZE_FUN2_0_2(umod_2exp, func, Result, nonconst, To,	\
-                          const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_ADD_MUL(func, To, From1, From2)                  \
-  PPL_SPECIALIZE_FUN3_0_1(add_mul, func, Result, nonconst, To,          \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_SUB_MUL(func, To, From1, From2)                  \
-  PPL_SPECIALIZE_FUN3_0_1(sub_mul, func, Result, nonconst, To,          \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_GCD(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(gcd, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_GCDEXT(func, To1, From1, From2, To2, To3)        \
-  PPL_SPECIALIZE_FUN5_0_1(gcdext, func, Result, nonconst, To1,		\
-                          nonconst, To2, nonconst, To3,                 \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_LCM(func, To, From1, From2)                      \
-  PPL_SPECIALIZE_FUN3_0_1(lcm, func, Result, nonconst, To,              \
-                          const, From1, const, From2, Rounding_Dir)
-#define PPL_SPECIALIZE_INPUT(func, Type)                        \
-  PPL_SPECIALIZE_FUN1_0_2(input, func, Result, nonconst, Type,  \
-                          std::istream&, Rounding_Dir)
-#define PPL_SPECIALIZE_OUTPUT(func, Type)                       \
-  PPL_SPECIALIZE_FUN1_1_2(output, func, Result, std::ostream&,  \
-                          const, Type,                          \
-                          const Numeric_Format&, Rounding_Dir)
-
-
-PPL_DECLARE_FUN2_0_0(copy,
-                     void, nonconst, Type1, const, Type2)
-PPL_DECLARE_FUN1_0_0(sgn,
-                     Result_Relation, const, From)
-PPL_DECLARE_FUN2_0_0(cmp,
-                     Result_Relation, const, Type1, const, Type2)
-PPL_DECLARE_FUN1_0_3(classify,
-                     Result, const, Type, bool, bool, bool)
-PPL_DECLARE_FUN1_0_0(is_nan,
-                     bool, const, Type)
-PPL_DECLARE_FUN1_0_0(is_minf,
-                     bool, const, Type)
-PPL_DECLARE_FUN1_0_0(is_pinf,
-                     bool, const, Type)
-PPL_DECLARE_FUN1_0_0(is_int,
-                     bool, const, Type)
-PPL_DECLARE_FUN1_0_2(assign_special,
-                     Result, nonconst, Type, Result_Class, Rounding_Dir)
-PPL_DECLARE_FUN1_0_2(construct_special,
-                     Result, nonconst, Type, Result_Class, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(construct,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(assign,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(floor,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(ceil,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(trunc,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(neg,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(abs,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN2_0_1(sqrt,
-                     Result, nonconst, To, const, From, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(add,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(sub,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(mul,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(div,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(rem,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(idiv,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN2_0_2(add_2exp,
-                     Result, nonconst, To,
-                     const, From, unsigned int, Rounding_Dir)
-PPL_DECLARE_FUN2_0_2(sub_2exp,
-                     Result, nonconst, To,
-                     const, From, unsigned int, Rounding_Dir)
-PPL_DECLARE_FUN2_0_2(mul_2exp,
-                     Result, nonconst, To,
-                     const, From, unsigned int, Rounding_Dir)
-PPL_DECLARE_FUN2_0_2(div_2exp,
-                     Result, nonconst, To,
-                     const, From, unsigned int, Rounding_Dir)
-PPL_DECLARE_FUN2_0_2(smod_2exp,
-                     Result, nonconst, To,
-                     const, From, unsigned int, Rounding_Dir)
-PPL_DECLARE_FUN2_0_2(umod_2exp,
-                     Result, nonconst, To,
-                     const, From, unsigned int, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(add_mul,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(sub_mul,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(gcd,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN5_0_1(gcdext,
-                     Result, nonconst, To1, nonconst, To2, nonconst, To3,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN3_0_1(lcm,
-                     Result, nonconst, To,
-                     const, From1, const, From2, Rounding_Dir)
-PPL_DECLARE_FUN1_0_2(input,
-                     Result, nonconst, Type, std::istream&, Rounding_Dir)
-PPL_DECLARE_FUN1_1_2(output,
-                     Result, std::ostream&, const, Type,
-                     const Numeric_Format&, Rounding_Dir)
-
-#undef PPL_DECLARE_FUN1_0_0
-#undef PPL_DECLARE_FUN1_0_1
-#undef PPL_DECLARE_FUN1_0_2
-#undef PPL_DECLARE_FUN1_0_3
-#undef PPL_DECLARE_FUN1_1_1
-#undef PPL_DECLARE_FUN1_1_2
-#undef PPL_DECLARE_FUN1_2_2
-#undef PPL_DECLARE_FUN2_0_0
-#undef PPL_DECLARE_FUN2_0_1
-#undef PPL_DECLARE_FUN2_0_2
-#undef PPL_DECLARE_FUN3_0_1
-#undef PPL_DECLARE_FUN5_0_1
-
-template <typename Policy, typename To>
-Result round(To& to, Result r, Rounding_Dir dir);
-
-Result input_mpq(mpq_class& to, std::istream& is);
-
-std::string float_mpq_to_string(mpq_class& q);
-
-} // namespace Checked
-
-struct Minus_Infinity {
-  static const Result_Class vclass = VC_MINUS_INFINITY;
-};
-struct Plus_Infinity {
-  static const Result_Class vclass = VC_PLUS_INFINITY;
-};
-struct Not_A_Number {
-  static const Result_Class vclass = VC_NAN;
-};
-
-template <typename T>
-struct Is_Special : public False { };
-
-template <>
-struct Is_Special<Minus_Infinity> : public True {};
-
-template <>
-struct Is_Special<Plus_Infinity> : public True {};
-
-template <>
-struct Is_Special<Not_A_Number> : public True {};
-
-extern Minus_Infinity MINUS_INFINITY;
-extern Plus_Infinity PLUS_INFINITY;
-extern Not_A_Number NOT_A_NUMBER;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-struct Checked_Number_Transparent_Policy {
-  //! Do not check for overflowed result.
-  const_bool_nodef(check_overflow, false);
-
-  //! Do not check for attempts to add infinities with different sign.
-  const_bool_nodef(check_inf_add_inf, false);
-
-  //! Do not check for attempts to subtract infinities with same sign.
-  const_bool_nodef(check_inf_sub_inf, false);
-
-  //! Do not check for attempts to multiply infinities by zero.
-  const_bool_nodef(check_inf_mul_zero, false);
-
-  //! Do not check for attempts to divide by zero.
-  const_bool_nodef(check_div_zero, false);
-
-  //! Do not check for attempts to divide infinities.
-  const_bool_nodef(check_inf_div_inf, false);
-
-  //! Do not check for attempts to compute remainder of infinities.
-  const_bool_nodef(check_inf_mod, false);
-
-  //! Do not check for attempts to take the square root of a negative number.
-  const_bool_nodef(check_sqrt_neg, false);
-
-  //! Handle not-a-number special value if \p T has it.
-  const_bool_nodef(has_nan, std::numeric_limits<T>::has_quiet_NaN);
-
-  //! Handle infinity special values if \p T have them.
-  const_bool_nodef(has_infinity, std::numeric_limits<T>::has_infinity);
-
-  /*! \brief
-    The checked number can always be safely converted to the
-    underlying type \p T and vice-versa.
-  */
-  const_bool_nodef(convertible, true);
-
-  //! Do not honor requests to check for FPU inexact results.
-  const_bool_nodef(fpu_check_inexact, false);
-
-  //! Do not make extra checks to detect FPU NaN results.
-  const_bool_nodef(fpu_check_nan_result, false);
-
-  /*! \brief
-    For constructors, by default use the same rounding used by
-    underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_CONSTRUCTOR = ROUND_NATIVE;
-
-  /*! \brief
-    For overloaded operators (operator+(), operator-(), ...), by
-    default use the same rounding used by the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_OPERATOR = ROUND_NATIVE;
-
-  /*! \brief
-    For input functions, by default use the same rounding used by
-    the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_INPUT = ROUND_NATIVE;
-
-  /*! \brief
-    For output functions, by default use the same rounding used by
-    the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_OUTPUT = ROUND_NATIVE;
-
-  /*! \brief
-    For all other functions, by default use the same rounding used by
-    the underlying type.
-  */
-  static const Rounding_Dir ROUND_DEFAULT_FUNCTION = ROUND_NATIVE;
-
-  /*! \brief
-    Handles \p r: called by all constructors, operators and functions that
-    do not return a Result value.
-  */
-  static void handle_result(Result r);
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#define CHECK_P(cond, check) ((cond) ? (check) : (assert(!(check)), false))
-
-#include "checked.inlines.hh"
-#include "checked_int.inlines.hh"
-#include "checked_float.inlines.hh"
-#include "checked_mpz.inlines.hh"
-#include "checked_mpq.inlines.hh"
-#include "checked_ext.inlines.hh"
-
-#undef nonconst
-#ifdef PPL_SAVED_nonconst
-#define nonconst PPL_SAVED_nonconst
-#undef PPL_SAVED_nonconst
-#endif
-
-#undef PPL_FUNCTION_CLASS
-#undef PPL_NAN
-
-#endif // !defined(PPL_checked_defs_hh)
diff --git a/src/checked.inlines.hh b/src/checked.inlines.hh
deleted file mode 100644
index 44eea27..0000000
--- a/src/checked.inlines.hh
+++ /dev/null
@@ -1,658 +0,0 @@
-/* Abstract checked arithmetic functions: fall-backs.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_inlines_hh
-#define PPL_checked_inlines_hh 1
-
-#include "globals.types.hh"
-#include "meta_programming.hh"
-#include "C_Integer.hh"
-#include "assert.hh"
-
-/*! \brief
-  Performs the test <CODE>a < b</CODE> avoiding the warning about the
-  comparison being always false due to limited range of data type.
-  FIXME: we have not found a working solution. The GCC option
-  -Wno-type-limits suppresses the warning
-*/
-#define PPL_LT_SILENT(a, b) ((a) < (b))
-#define PPL_GT_SILENT(a, b) ((a) > (b))
-
-namespace Parma_Polyhedra_Library {
-
-namespace Checked {
-
-template <typename T1, typename T2>
-struct Safe_Conversion : public False {
-};
-template <typename T>
-struct Safe_Conversion<T, T> : public True {
-};
-
-#define PPL_SAFE_CONVERSION(To, From)                        \
-  template <> struct Safe_Conversion<PPL_U(To), PPL_U(From)> \
-    : public True { }
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed short, char);
-#endif
-PPL_SAFE_CONVERSION(signed short, signed char);
-#if PPL_SIZEOF_CHAR < PPL_SIZEOF_SHORT
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed short, char);
-#endif
-PPL_SAFE_CONVERSION(signed short, unsigned char);
-#endif
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed int, char);
-#endif
-PPL_SAFE_CONVERSION(signed int, signed char);
-PPL_SAFE_CONVERSION(signed int, signed short);
-#if PPL_SIZEOF_CHAR < PPL_SIZEOF_INT
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed int, char);
-#endif
-PPL_SAFE_CONVERSION(signed int, unsigned char);
-#endif
-#if PPL_SIZEOF_SHORT < PPL_SIZEOF_INT
-PPL_SAFE_CONVERSION(signed int, unsigned short);
-#endif
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed long, char);
-#endif
-PPL_SAFE_CONVERSION(signed long, signed char);
-PPL_SAFE_CONVERSION(signed long, signed short);
-PPL_SAFE_CONVERSION(signed long, signed int);
-#if PPL_SIZEOF_CHAR < PPL_SIZEOF_LONG
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed long, char);
-#endif
-PPL_SAFE_CONVERSION(signed long, unsigned char);
-#endif
-#if PPL_SIZEOF_SHORT < PPL_SIZEOF_LONG
-PPL_SAFE_CONVERSION(signed long, unsigned short);
-#endif
-#if PPL_SIZEOF_INT < PPL_SIZEOF_LONG
-PPL_SAFE_CONVERSION(signed long, unsigned int);
-#endif
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed long long, char);
-#endif
-PPL_SAFE_CONVERSION(signed long long, signed char);
-PPL_SAFE_CONVERSION(signed long long, signed short);
-PPL_SAFE_CONVERSION(signed long long, signed int);
-PPL_SAFE_CONVERSION(signed long long, signed long);
-#if PPL_SIZEOF_CHAR < PPL_SIZEOF_LONG_LONG
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(signed long long, char);
-#endif
-PPL_SAFE_CONVERSION(signed long long, unsigned char);
-#endif
-#if PPL_SIZEOF_SHORT < PPL_SIZEOF_LONG_LONG
-PPL_SAFE_CONVERSION(signed long long, unsigned short);
-#endif
-#if PPL_SIZEOF_INT < PPL_SIZEOF_LONG_LONG
-PPL_SAFE_CONVERSION(signed long long, unsigned int);
-#endif
-#if PPL_SIZEOF_LONG < PPL_SIZEOF_LONG_LONG
-PPL_SAFE_CONVERSION(signed long long, unsigned long);
-#endif
-
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(unsigned short, char);
-#endif
-PPL_SAFE_CONVERSION(unsigned short, unsigned char);
-
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(unsigned int, char);
-#endif
-PPL_SAFE_CONVERSION(unsigned int, unsigned char);
-PPL_SAFE_CONVERSION(unsigned int, unsigned short);
-
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(unsigned long, char);
-#endif
-PPL_SAFE_CONVERSION(unsigned long, unsigned char);
-PPL_SAFE_CONVERSION(unsigned long, unsigned short);
-PPL_SAFE_CONVERSION(unsigned long, unsigned int);
-
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SAFE_CONVERSION(unsigned long long, char);
-#endif
-PPL_SAFE_CONVERSION(unsigned long long, unsigned char);
-PPL_SAFE_CONVERSION(unsigned long long, unsigned short);
-PPL_SAFE_CONVERSION(unsigned long long, unsigned int);
-PPL_SAFE_CONVERSION(unsigned long long, unsigned long);
-
-
-#if PPL_SIZEOF_CHAR <= PPL_SIZEOF_FLOAT - 2
-PPL_SAFE_CONVERSION(float, char);
-PPL_SAFE_CONVERSION(float, signed char);
-PPL_SAFE_CONVERSION(float, unsigned char);
-#endif
-#if PPL_SIZEOF_SHORT <= PPL_SIZEOF_FLOAT - 2
-PPL_SAFE_CONVERSION(float, signed short);
-PPL_SAFE_CONVERSION(float, unsigned short);
-#endif
-#if PPL_SIZEOF_INT <= PPL_SIZEOF_FLOAT - 2
-PPL_SAFE_CONVERSION(float, signed int);
-PPL_SAFE_CONVERSION(float, unsigned int);
-#endif
-#if PPL_SIZEOF_LONG <= PPL_SIZEOF_FLOAT - 2
-PPL_SAFE_CONVERSION(float, signed long);
-PPL_SAFE_CONVERSION(float, unsigned long);
-#endif
-#if PPL_SIZEOF_LONG_LONG <= PPL_SIZEOF_FLOAT - 2
-PPL_SAFE_CONVERSION(float, signed long long);
-PPL_SAFE_CONVERSION(float, unsigned long long);
-#endif
-
-#if PPL_SIZEOF_CHAR <= PPL_SIZEOF_DOUBLE - 4
-PPL_SAFE_CONVERSION(double, char);
-PPL_SAFE_CONVERSION(double, signed char);
-PPL_SAFE_CONVERSION(double, unsigned char);
-#endif
-#if PPL_SIZEOF_SHORT <= PPL_SIZEOF_DOUBLE - 4
-PPL_SAFE_CONVERSION(double, signed short);
-PPL_SAFE_CONVERSION(double, unsigned short);
-#endif
-#if PPL_SIZEOF_INT <= PPL_SIZEOF_DOUBLE - 4
-PPL_SAFE_CONVERSION(double, signed int);
-PPL_SAFE_CONVERSION(double, unsigned int);
-#endif
-#if PPL_SIZEOF_LONG <= PPL_SIZEOF_DOUBLE - 4
-PPL_SAFE_CONVERSION(double, signed long);
-PPL_SAFE_CONVERSION(double, unsigned long);
-#endif
-#if PPL_SIZEOF_LONG_LONG <= PPL_SIZEOF_DOUBLE - 4
-PPL_SAFE_CONVERSION(double, signed long long);
-PPL_SAFE_CONVERSION(double, unsigned long long);
-#endif
-PPL_SAFE_CONVERSION(double, float);
-
-#if PPL_SIZEOF_CHAR <= PPL_SIZEOF_LONG_DOUBLE - 4
-PPL_SAFE_CONVERSION(long double, char);
-PPL_SAFE_CONVERSION(long double, signed char);
-PPL_SAFE_CONVERSION(long double, unsigned char);
-#endif
-#if PPL_SIZEOF_SHORT <= PPL_SIZEOF_LONG_DOUBLE - 4
-PPL_SAFE_CONVERSION(long double, signed short);
-PPL_SAFE_CONVERSION(long double, unsigned short);
-#endif
-#if PPL_SIZEOF_INT <= PPL_SIZEOF_LONG_DOUBLE - 4
-PPL_SAFE_CONVERSION(long double, signed int);
-PPL_SAFE_CONVERSION(long double, unsigned int);
-#endif
-#if PPL_SIZEOF_LONG <= PPL_SIZEOF_LONG_DOUBLE - 4
-PPL_SAFE_CONVERSION(long double, signed long);
-PPL_SAFE_CONVERSION(long double, unsigned long);
-#endif
-#if PPL_SIZEOF_LONG_LONG <= PPL_SIZEOF_LONG_DOUBLE - 4
-PPL_SAFE_CONVERSION(long double, signed long long);
-PPL_SAFE_CONVERSION(long double, unsigned long long);
-#endif
-PPL_SAFE_CONVERSION(long double, float);
-PPL_SAFE_CONVERSION(long double, double);
-
-PPL_SAFE_CONVERSION(mpz_class, char);
-PPL_SAFE_CONVERSION(mpz_class, signed char);
-PPL_SAFE_CONVERSION(mpz_class, signed short);
-PPL_SAFE_CONVERSION(mpz_class, signed int);
-PPL_SAFE_CONVERSION(mpz_class, signed long);
-// GMP's API does not support signed long long.
-PPL_SAFE_CONVERSION(mpz_class, unsigned char);
-PPL_SAFE_CONVERSION(mpz_class, unsigned short);
-PPL_SAFE_CONVERSION(mpz_class, unsigned int);
-PPL_SAFE_CONVERSION(mpz_class, unsigned long);
-// GMP's API does not support unsigned long long.
-
-PPL_SAFE_CONVERSION(mpq_class, char);
-PPL_SAFE_CONVERSION(mpq_class, signed char);
-PPL_SAFE_CONVERSION(mpq_class, signed short);
-PPL_SAFE_CONVERSION(mpq_class, signed int);
-PPL_SAFE_CONVERSION(mpq_class, signed long);
-// GMP's API does not support signed long long.
-PPL_SAFE_CONVERSION(mpq_class, unsigned char);
-PPL_SAFE_CONVERSION(mpq_class, unsigned short);
-PPL_SAFE_CONVERSION(mpq_class, unsigned int);
-PPL_SAFE_CONVERSION(mpq_class, unsigned long);
-// GMP's API does not support unsigned long long.
-PPL_SAFE_CONVERSION(mpq_class, float);
-PPL_SAFE_CONVERSION(mpq_class, double);
-// GMP's API does not support long double.
-
-#undef PPL_SAFE_CONVERSION
-
-template <typename Policy, typename Type>
-struct PPL_FUNCTION_CLASS(construct)<Policy, Policy, Type, Type> {
-  static inline Result function(Type& to, const Type& from, Rounding_Dir) {
-    new (&to) Type(from);
-    return V_EQ;
-  }
-};
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-struct PPL_FUNCTION_CLASS(construct) {
-  static inline Result function(To& to, const From& from, Rounding_Dir dir) {
-    new (&to) To();
-    return assign<To_Policy, From_Policy>(to, from, dir);
-  }
-};
-
-template <typename To_Policy, typename To>
-struct PPL_FUNCTION_CLASS(construct_special) {
-  static inline Result function(To& to, Result_Class r, Rounding_Dir dir) {
-    new (&to) To();
-    return assign_special<To_Policy>(to, r, dir);
-  }
-};
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_exact(To& to, const From& from, Rounding_Dir) {
-  to = from;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline typename Enable_If<Is_Same<To_Policy, From_Policy>::value, void>::type
-copy_generic(Type& to, const Type& from) {
-  to = from;
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-abs_generic(To& to, const From& from, Rounding_Dir dir) {
-  if (from < 0)
-    return neg<To_Policy, From_Policy>(to, from, dir);
-  else
-    return assign<To_Policy, From_Policy>(to, from, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From>
-inline void
-gcd_exact_no_abs(To& to, const From& x, const From& y) {
-  To w_x = x;
-  To w_y = y;
-  To remainder;
-  while (w_y != 0) {
-    // The following is derived from the assumption that w_x % w_y
-    // is always representable. This is true for both native integers
-    // and IEC 559 floating point numbers.
-    rem<To_Policy, From1_Policy, From2_Policy>(remainder, w_x, w_y,
-                                               ROUND_NOT_NEEDED);
-    w_x = w_y;
-    w_y = remainder;
-  }
-  to = w_x;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  gcd_exact_no_abs<To_Policy, From1_Policy, From2_Policy>(to, x, y);
-  return abs<To_Policy, To_Policy>(to, to, dir);
-}
-
-template <typename To1_Policy, typename To2_Policy, typename To3_Policy,
-	  typename From1_Policy, typename From2_Policy,
-	  typename To1, typename To2, typename To3,
-	  typename From1, typename From2>
-inline Result
-gcdext_exact(To1& to, To2& s, To3& t, const From1& x, const From2& y,
-	     Rounding_Dir dir) {
-  // In case this becomes a bottleneck, we may consider using the
-  // Stehle'-Zimmermann algorithm (see R. Crandall and C. Pomerance,
-  // Prime Numbers - A Computational Perspective, Second Edition,
-  // Springer, 2005).
-  if (y == 0) {
-    if (x == 0) {
-      s = 0;
-      t = 1;
-      return V_EQ;
-    }
-    else {
-      if (x < 0)
-	s = -1;
-      else
-	s = 1;
-      t = 0;
-      return abs<To1_Policy, From1_Policy>(to, x, dir);
-    }
-  }
-
-  s = 1;
-  t = 0;
-  bool negative_x = x < 0;
-  bool negative_y = y < 0;
-
-  Result r;
-  r = abs<To1_Policy, From1_Policy>(to, x, dir);
-  if (r != V_EQ)
-    return r;
-
-  From2 a_y;
-  r = abs<To1_Policy, From2_Policy>(a_y, y, dir);
-  if (r != V_EQ)
-    return r;
-
-  // If PPL_MATCH_GMP_GCDEXT is defined then s is favored when the absolute
-  // values of the given numbers are equal.  For instance if x and y
-  // are both 5 then s will be 1 and t will be 0, instead of the other
-  // way round.  This is to match the behavior of GMP.
-#define PPL_MATCH_GMP_GCDEXT 1
-#ifdef PPL_MATCH_GMP_GCDEXT
-  if (to == a_y)
-    goto sign_check;
-#endif
-
-  {
-    To2 v1 = 0;
-    To3 v2 = 1;
-    To1 v3 = static_cast<To1>(a_y);
-    while (true) {
-      To1 q = to / v3;
-      // Remainder, next candidate GCD.
-      To1 t3 = to - q*v3;
-      To2 t1 = s - static_cast<To2>(q)*v1;
-      To3 t2 = t - static_cast<To3>(q)*v2;
-      s = v1;
-      t = v2;
-      to = v3;
-      if (t3 == 0)
-	break;
-      v1 = t1;
-      v2 = t2;
-      v3 = t3;
-    }
-  }
-
-#ifdef PPL_MATCH_GMP_GCDEXT
- sign_check:
-#endif
-  if (negative_x) {
-    r = neg<To2_Policy, To2_Policy>(s, s, dir);
-    if (r != V_EQ)
-      return r;
-  }
-  if (negative_y)
-    return neg<To3_Policy, To3_Policy>(t, t, dir);
-  return V_EQ;
-#undef PPL_MATCH_GMP_GCDEXT
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-lcm_gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (x == 0 || y == 0) {
-    to = 0;
-    return V_EQ;
-  }
-  To a_x;
-  To a_y;
-  Result r;
-  r = abs<From1_Policy, From1_Policy>(a_x, x, dir);
-  if (r != V_EQ)
-    return r;
-  r = abs<From2_Policy, From2_Policy>(a_y, y, dir);
-  if (r != V_EQ)
-    return r;
-  To gcd;
-  gcd_exact_no_abs<To_Policy, From1_Policy, From2_Policy>(gcd, a_x, a_y);
-  // The following is derived from the assumption that a_x / gcd(a_x, a_y)
-  // is always representable. This is true for both native integers
-  // and IEC 559 floating point numbers.
-  div<To_Policy, From1_Policy, To_Policy>(to, a_x, gcd, ROUND_NOT_NEEDED);
-  return mul<To_Policy, To_Policy, From2_Policy>(to, to, a_y, dir);
-}
-
-template <typename Policy, typename Type>
-inline Result_Relation
-sgn_generic(const Type& x) {
-  if (x > 0)
-    return VR_GT;
-  if (x == 0)
-    return VR_EQ;
-  return VR_LT;
-}
-
-template <typename T1, typename T2, typename Enable = void>
-struct Safe_Int_Comparison : public False {
-};
-
-template <typename T1, typename T2>
-struct Safe_Int_Comparison<T1, T2, typename Enable_If<(C_Integer<T1>::value && C_Integer<T2>::value)>::type>
-  : public Bool<(C_Integer<T1>::is_signed
-		 ? (C_Integer<T2>::is_signed
-		    || sizeof(T2) < sizeof(T1)
-		    || sizeof(T2) < sizeof(int))
-		 : (!C_Integer<T2>::is_signed
-		    || sizeof(T1) < sizeof(T2)
-		    || sizeof(T1) < sizeof(int)))> {
-};
-
-
-template <typename T1, typename T2>
-inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
-			   || Safe_Conversion<T1, T2>::value
-			   || Safe_Conversion<T2, T1>::value), bool>::type
-lt(const T1& x, const T2& y) {
-  return x < y;
-}
-template <typename T1, typename T2>
-inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
-			   || Safe_Conversion<T1, T2>::value
-			   || Safe_Conversion<T2, T1>::value), bool>::type
-le(const T1& x, const T2& y) {
-  return x <= y;
-}
-template <typename T1, typename T2>
-inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
-			   || Safe_Conversion<T1, T2>::value
-			   || Safe_Conversion<T2, T1>::value), bool>::type
-eq(const T1& x, const T2& y) {
-  return x == y;
-}
-
-template <typename S, typename U>
-inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
-lt(const S& x, const U& y) {
-  return x < 0 || static_cast<typename C_Integer<S>::other_type>(x) < y;
-}
-
-template <typename U, typename S>
-inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
-lt(const U& x, const S& y) {
-  return y >= 0 && x < static_cast<typename C_Integer<S>::other_type>(y);
-}
-
-template <typename S, typename U>
-inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
-le(const S& x, const U& y) {
-  return x < 0 || static_cast<typename C_Integer<S>::other_type>(x) <= y;
-}
-
-template <typename U, typename S>
-inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
-le(const U& x, const S& y) {
-  return y >= 0 && x <= static_cast<typename C_Integer<S>::other_type>(y);
-}
-
-template <typename S, typename U>
-inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
-eq(const S& x, const U& y) {
-  return x >= 0 && static_cast<typename C_Integer<S>::other_type>(x) == y;
-}
-
-template <typename U, typename S>
-inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
-eq(const U& x, const S& y) {
-  return y >= 0 && x == static_cast<typename C_Integer<S>::other_type>(y);
-}
-
-template <typename T1, typename T2>
-inline typename Enable_If<(!Safe_Conversion<T1, T2>::value
-			   && !Safe_Conversion<T2, T1>::value
-			   && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
-eq(const T1& x, const T2& y) {
-  PPL_DIRTY_TEMP(T1, tmp);
-  Result r = assign_r(tmp, y, ROUND_CHECK);
-  // FIXME: We can do this also without fpu inexact check using a
-  // conversion back and forth and then testing equality.  We should
-  // code this in checked_float.inlines.hh, probably it's faster also
-  // if fpu supports inexact check.
-  PPL_ASSERT(r != V_LE && r != V_GE && r != V_LGE);
-  return r == V_EQ && x == tmp;
-}
-
-template <typename T1, typename T2>
-inline typename Enable_If<(!Safe_Conversion<T1, T2>::value
-			   && !Safe_Conversion<T2, T1>::value
-			   && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
-lt(const T1& x, const T2& y) {
-  PPL_DIRTY_TEMP(T1, tmp);
-  Result r = assign_r(tmp, y, ROUND_UP);
-  if (!result_representable(r))
-    return true;
-  switch (result_relation(r)) {
-  case VR_EQ:
-  case VR_LT:
-  case VR_LE:
-    return x < tmp;
-  default:
-    return false;
-  }
-}
-
-template <typename T1, typename T2>
-inline typename
-Enable_If<(!Safe_Conversion<T1, T2>::value
-           && !Safe_Conversion<T2, T1>::value
-           && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
-le(const T1& x, const T2& y) {
-  PPL_DIRTY_TEMP(T1, tmp);
-  Result r = assign_r(tmp, y, (ROUND_UP | ROUND_STRICT_RELATION));
-  // FIXME: We can do this also without fpu inexact check using a
-  // conversion back and forth and then testing equality.  We should
-  // code this in checked_float.inlines.hh, probably it's faster also
-  // if fpu supports inexact check.
-  PPL_ASSERT(r != V_LE && r != V_GE && r != V_LGE);
-  if (!result_representable(r))
-    return true;
-  switch (result_relation(r)) {
-  case VR_EQ:
-    return x <= tmp;
-  case VR_LT:
-    return x < tmp;
-  case VR_LE:
-  case VR_GE:
-  case VR_LGE:
-    // See comment above.
-    PPL_UNREACHABLE;
-    return false;
-  default:
-    return false;
-  }
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-lt_p(const Type1& x, const Type2& y) {
-  return lt(x, y);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-le_p(const Type1& x, const Type2& y) {
-  return le(x, y);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-eq_p(const Type1& x, const Type2& y) {
-  return eq(x, y);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline Result_Relation
-cmp_generic(const Type1& x, const Type2& y) {
-  if (lt(y, x))
-    return VR_GT;
-  if (lt(x, y))
-    return VR_LT;
-  return VR_EQ;
-}
-
-template <typename Policy, typename Type>
-inline Result
-assign_nan(Type& to, Result r) {
-  assign_special<Policy>(to, VC_NAN, ROUND_IGNORE);
-  return r;
-}
-
-template <typename Policy, typename Type>
-inline Result
-input_generic(Type& to, std::istream& is, Rounding_Dir dir) {
-  PPL_DIRTY_TEMP(mpq_class, q);
-  Result r = input_mpq(q, is);
-  Result_Class c = result_class(r);
-  switch (c) {
-  case VC_MINUS_INFINITY:
-  case VC_PLUS_INFINITY:
-    return assign_special<Policy>(to, c, dir);
-  case VC_NAN:
-    return assign_nan<Policy>(to, r);
-  default:
-    break;
-  }
-  PPL_ASSERT(r == V_EQ);
-  return assign<Policy, void>(to, q, dir);
-}
-
-} // namespace Checked
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_checked_inlines_hh)
diff --git a/src/checked_defs.hh b/src/checked_defs.hh
new file mode 100644
index 0000000..f011628
--- /dev/null
+++ b/src/checked_defs.hh
@@ -0,0 +1,716 @@
+/* Abstract checked arithmetic function container.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_defs_hh
+#define PPL_checked_defs_hh 1
+
+#include <cassert>
+#include <iostream>
+#include <gmpxx.h>
+#include "mp_std_bits_defs.hh"
+#include "Temp_defs.hh"
+#include "Rounding_Dir_defs.hh"
+#include "Numeric_Format_defs.hh"
+#include "Float_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+namespace Checked {
+
+
+// It is a pity that function partial specialization is not permitted
+// by C++.  To (partly) overcome this limitation, we use class
+// encapsulated functions and partial specialization of containing
+// classes.
+
+#define PPL_FUNCTION_CLASS(name) name ## _function_struct
+
+#define PPL_DECLARE_FUN1_0_0(name, ret_type, qual, type)                \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg) {           \
+    return PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg); \
+  }
+
+#define PPL_DECLARE_FUN1_0_1(name, ret_type, qual, type, after1)        \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg, PPL_U(after1) a1) { \
+    return                                                              \
+      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg, a1); \
+  }
+
+#define PPL_DECLARE_FUN1_0_2(name, ret_type, qual, type, after1, after2) \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg, PPL_U(after1) a1, \
+                       PPL_U(after2) a2) {                              \
+    return                                                              \
+      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg,      \
+                                                              a1, a2);  \
+  }
+
+#define PPL_DECLARE_FUN1_0_3(name, ret_type, qual, type,                \
+                             after1, after2, after3)                    \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual) PPL_U(type)& arg,             \
+                       PPL_U(after1) a1, PPL_U(after2) a2,              \
+                       PPL_U(after3) a3) {                              \
+    return                                                              \
+      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(arg,      \
+                                                              a1, a2,   \
+                                                              a3);      \
+  }
+
+#define PPL_DECLARE_FUN1_1_1(name, ret_type, before1, qual, type, after1) \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(before1) b1, PPL_U(qual) PPL_U(type)& arg, \
+                       PPL_U(after1) a1) {                              \
+    return                                                              \
+      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(b1, arg,  \
+                                                              a1);      \
+  }
+
+#define PPL_DECLARE_FUN1_1_2(name, ret_type, before1, qual, type,       \
+                             after1, after2)                            \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(before1) b1, PPL_U(qual) PPL_U(type)& arg, \
+                       PPL_U(after1) a1, PPL_U(after2) a2) {            \
+    return                                                              \
+      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(b1, arg,  \
+                                                              a1, a2);  \
+  }
+
+#define PPL_DECLARE_FUN1_2_2(name, ret_type, before1, before2, qual, type, \
+                             after1, after2)                            \
+  template <typename Policy, typename type>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy, typename type>                             \
+  inline ret_type PPL_U(name)(PPL_U(before1) b1, PPL_U(before2) b2,     \
+                       PPL_U(qual) PPL_U(type)& arg,                    \
+                       PPL_U(after1) a1, PPL_U(after2) a2) {            \
+    return                                                              \
+      PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)>::function(b1, b2,   \
+                                                              arg,      \
+                                                              a1, a2);  \
+  }
+
+#define PPL_DECLARE_FUN2_0_0(name, ret_type, qual1, type1, qual2, type2) \
+  template <typename Policy1, typename Policy2,                         \
+            typename type1, typename type2>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy1, typename Policy2,                         \
+            typename type1, typename type2>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,          \
+                       PPL_U(qual2) PPL_U(type2)& arg2) {               \
+    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2,                   \
+      type1, PPL_U(type2)>::function(arg1, arg2);                       \
+  }
+
+#define PPL_DECLARE_FUN2_0_1(name, ret_type, qual1, type1,      \
+                             qual2, type2, after1)              \
+  template <typename Policy1, typename Policy2,                 \
+            typename type1, typename type2>                     \
+  struct PPL_FUNCTION_CLASS(name);                              \
+  template <typename Policy1, typename Policy2,                 \
+            typename type1, typename type2>                     \
+  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,  \
+                       PPL_U(qual2) PPL_U(type2)& arg2,         \
+                       PPL_U(after1) a1) {                      \
+    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2,           \
+      type1, PPL_U(type2)>::function(arg1, arg2, a1);           \
+  }
+
+#define PPL_DECLARE_FUN2_0_2(name, ret_type, qual1, type1, qual2, type2, \
+                             after1, after2)                            \
+  template <typename Policy1, typename Policy2,                         \
+            typename type1, typename type2>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy1, typename Policy2,                         \
+            typename type1, typename type2>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,          \
+                       PPL_U(qual2) PPL_U(type2)& arg2,                 \
+                       PPL_U(after1) a1, PPL_U(after2) a2) {            \
+    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2,                   \
+      type1, PPL_U(type2)>::function(arg1, arg2, a1, a2);               \
+  }
+
+#define PPL_DECLARE_FUN3_0_1(name, ret_type, qual1, type1,              \
+                             qual2, type2, qual3, type3, after1)        \
+  template <typename Policy1, typename Policy2, typename Policy3,       \
+            typename type1, typename type2, typename type3>             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy1, typename Policy2, typename Policy3,       \
+            typename type1, typename type2, typename type3>             \
+  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1,          \
+                       PPL_U(qual2) PPL_U(type2)& arg2,                 \
+                       PPL_U(qual3) PPL_U(type3)& arg3,                 \
+                       PPL_U(after1) a1) {                              \
+    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2, Policy3,          \
+      type1, type2, PPL_U(type3)>                                       \
+      ::function(arg1, arg2, arg3, a1);                                 \
+  }
+
+#define PPL_DECLARE_FUN5_0_1(name, ret_type,                            \
+                             qual1, type1, qual2, type2, qual3, type3,  \
+                             qual4, type4, qual5, type5,                \
+                             after1)                                    \
+  template <typename Policy1, typename Policy2, typename Policy3,       \
+            typename Policy4,typename Policy5,                          \
+            typename type1, typename type2, typename type3,             \
+            typename type4, typename type5>                             \
+  struct PPL_FUNCTION_CLASS(name);                                      \
+  template <typename Policy1, typename Policy2, typename Policy3,       \
+            typename Policy4,typename Policy5,                          \
+            typename type1, typename type2, typename type3,             \
+            typename type4, typename type5>                             \
+  inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1, PPL_U(qual2) \
+                       PPL_U(type2)& arg2,                              \
+                       PPL_U(qual3) PPL_U(type3)& arg3, PPL_U(qual4)    \
+                       PPL_U(type4)& arg4,                              \
+                       PPL_U(qual5) PPL_U(type5)& arg5,                 \
+                       PPL_U(after1) a1) {                              \
+    return PPL_FUNCTION_CLASS(name)<Policy1, Policy2, Policy3,          \
+      Policy4, Policy5,                                                 \
+      type1, type2,                                                     \
+      type3, type4,                                                     \
+      PPL_U(type5)>                                                     \
+      ::function(arg1, arg2, arg3, arg4, arg5, a1);                     \
+  }
+
+#define PPL_SPECIALIZE_FUN1_0_0(name, func, ret_type, qual, type)       \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg) {     \
+      return PPL_U(func)<Policy>(arg);                                  \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN1_0_1(name, func, ret_type, qual, type, after1) \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg,       \
+                                    PPL_U(after1) a1) {                 \
+      return PPL_U(func)<Policy>(arg, a1);                              \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN1_0_2(name, func, ret_type, qual, type,       \
+                                after1, after2)                         \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg,       \
+                                    PPL_U(after1) a1, PPL_U(after2) a2) \
+    {                                                                   \
+      return PPL_U(func)<Policy>(arg, a1, a2);                          \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN1_0_3(name, func, ret_type, qual, type,       \
+                                after1, after2, after3)                 \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(qual) PPL_U(type)& arg,       \
+                                    PPL_U(after1) a1, PPL_U(after2) a2, \
+                                    PPL_U(after3) a3) {                 \
+      return PPL_U(func)<Policy>(arg, a1, a2, a3);                      \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN1_1_1(name, func, ret_type, before1,          \
+                                qual, type, after1)                     \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(before1) b1, PPL_U(qual)      \
+                                    PPL_U(type)& arg,                   \
+                                    PPL_U(after1) a1) {                 \
+      return PPL_U(func)<Policy>(b1, arg, a1);                          \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN1_1_2(name, func, ret_type, before1,          \
+                                qual, type, after1, after2)             \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(before1) b1, PPL_U(qual)      \
+                                    PPL_U(type)& arg,                   \
+                                    PPL_U(after1) a1, PPL_U(after2) a2) \
+    {                                                                   \
+      return PPL_U(func)<Policy>(b1, arg, a1, a2);                      \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN1_2_2(name, func, ret_type, before1, before2, \
+                                qual, type, after1, after2)             \
+  template <typename Policy>                                            \
+  struct PPL_FUNCTION_CLASS(name)<Policy, PPL_U(type)> {                \
+    static inline ret_type function(PPL_U(before1) b1, PPL_U(before2) b2, \
+                                    PPL_U(qual) PPL_U(type)& arg,       \
+                                    PPL_U(after1) a1, PPL_U(after2) a2) \
+    {                                                                   \
+      return PPL_U(func)<Policy>(b1, b2, arg, a1, a2);                  \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN2_0_0(name, func, ret_type, qual1, type1,     \
+                                qual2, type2)                           \
+  template <typename Policy1, typename Policy2>                         \
+  struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
+                                  PPL_U(type2)> {                       \
+    static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
+                                    PPL_U(qual2) PPL_U(type2) &arg2) {  \
+      return PPL_U(func)<Policy1, Policy2>(arg1, arg2);                 \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN2_0_1(name, func, ret_type, qual1, type1,     \
+                                qual2, type2, after1)                   \
+  template <typename Policy1, typename Policy2>                         \
+  struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
+                                  PPL_U(type2)> {                       \
+    static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
+                                    PPL_U(qual2) PPL_U(type2) &arg2,    \
+                                    PPL_U(after1) a1) {                 \
+      return PPL_U(func)<Policy1, Policy2>(arg1, arg2, a1);             \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN2_0_2(name, func, ret_type, qual1, type1,     \
+                                qual2, type2, after1, after2)           \
+  template <typename Policy1, typename Policy2>                         \
+  struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
+                                  PPL_U(type2)> {                       \
+    static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
+                                    PPL_U(qual2) PPL_U(type2) &arg2,    \
+                                    PPL_U(after1) a1, PPL_U(after2) a2) \
+    {                                                                   \
+      return PPL_U(func)<Policy1, Policy2>(arg1, arg2, a1, a2);         \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN3_0_1(name, func, ret_type, qual1, type1,     \
+                                qual2, type2, qual3, type3, after1)     \
+  template <typename Policy1, typename Policy2, typename Policy3>       \
+  struct PPL_FUNCTION_CLASS(name) <Policy1, Policy2, Policy3,           \
+                                   type1, type2,                        \
+                                   PPL_U(type3)> {                      \
+    static inline Result function(PPL_U(qual1) PPL_U(type1)& arg1,      \
+                                  PPL_U(qual2) PPL_U(type2) &arg2,      \
+                                  PPL_U(qual3) PPL_U(type3) &arg3,      \
+                                  PPL_U(after1) a1) {                   \
+      return PPL_U(func)<Policy1, Policy2, Policy3>(arg1, arg2, arg3,   \
+                                                    a1);                \
+    }                                                                   \
+  };
+
+#define PPL_SPECIALIZE_FUN5_0_1(name, func, ret_type,                   \
+                                qual1, type1, qual2, type2,             \
+                                qual3, type3,                           \
+                                qual4, type4, qual5, type5, after1)     \
+  template <typename Policy1, typename Policy2, typename Policy3,       \
+            typename Policy4, typename Policy5>                         \
+  struct PPL_FUNCTION_CLASS(name) <Policy1, Policy2, Policy3, Policy4,  \
+                                   Policy5,                             \
+                                   type1, type2,                        \
+                                   type3, type4,                        \
+                                   PPL_U(type5)> {                      \
+    static inline Result                                                \
+      function(PPL_U(qual1) PPL_U(type1)& arg1, PPL_U(qual2)            \
+               PPL_U(type2) &arg2,                                      \
+               PPL_U(qual3) PPL_U(type3) &arg3, PPL_U(qual4)            \
+               PPL_U(type4) &arg4,                                      \
+               PPL_U(qual5) PPL_U(type5) &arg5, PPL_U(after1) a1) {     \
+      return PPL_U(func)<Policy1, Policy2, Policy3, Policy4,            \
+        Policy5>(arg1, arg2, arg3, arg4, arg5, a1);                     \
+    }                                                                   \
+  };
+
+// The `nonconst' macro helps readability of the sequel.
+#ifdef nonconst
+#define PPL_SAVED_nonconst nonconst
+#undef nonconst
+#endif
+#define nonconst
+
+#define PPL_SPECIALIZE_COPY(func, Type)                                 \
+  PPL_SPECIALIZE_FUN2_0_0(copy, func, void, nonconst, Type, const, Type)
+#define PPL_SPECIALIZE_SGN(func, From)                                  \
+  PPL_SPECIALIZE_FUN1_0_0(sgn, func, Result_Relation, const, From)
+#define PPL_SPECIALIZE_CMP(func, Type1, Type2)                          \
+  PPL_SPECIALIZE_FUN2_0_0(cmp, func, Result_Relation, const, Type1, const, Type2)
+#define PPL_SPECIALIZE_CLASSIFY(func, Type)                             \
+  PPL_SPECIALIZE_FUN1_0_3(classify, func, Result, const, Type, bool, bool, bool)
+#define PPL_SPECIALIZE_IS_NAN(func, Type)                       \
+  PPL_SPECIALIZE_FUN1_0_0(is_nan, func, bool, const, Type)
+#define PPL_SPECIALIZE_IS_MINF(func, Type)                      \
+  PPL_SPECIALIZE_FUN1_0_0(is_minf, func, bool, const, Type)
+#define PPL_SPECIALIZE_IS_PINF(func, Type)                      \
+  PPL_SPECIALIZE_FUN1_0_0(is_pinf, func, bool, const, Type)
+#define PPL_SPECIALIZE_IS_INT(func, Type)                       \
+  PPL_SPECIALIZE_FUN1_0_0(is_int, func, bool, const, Type)
+#define PPL_SPECIALIZE_ASSIGN_SPECIAL(func, Type)                       \
+  PPL_SPECIALIZE_FUN1_0_2(assign_special, func, Result,                 \
+                          nonconst, Type, Result_Class, Rounding_Dir)
+#define PPL_SPECIALIZE_CONSTRUCT_SPECIAL(func, Type)                    \
+  PPL_SPECIALIZE_FUN1_0_2(construct_special, func, Result, nonconst,    \
+                          Type, Result_Class, Rounding_Dir)
+#define PPL_SPECIALIZE_CONSTRUCT(func, To, From)                        \
+  PPL_SPECIALIZE_FUN2_0_1(construct, func, Result, nonconst, To,        \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_ASSIGN(func, To, From)                   \
+  PPL_SPECIALIZE_FUN2_0_1(assign, func, Result, nonconst, To,   \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_FLOOR(func, To, From)                    \
+  PPL_SPECIALIZE_FUN2_0_1(floor, func, Result, nonconst, To,    \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_CEIL(func, To, From)                     \
+  PPL_SPECIALIZE_FUN2_0_1(ceil, func, Result, nonconst, To,     \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_TRUNC(func, To, From)                    \
+  PPL_SPECIALIZE_FUN2_0_1(trunc, func, Result, nonconst, To,    \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_NEG(func, To, From)                      \
+  PPL_SPECIALIZE_FUN2_0_1(neg, func, Result, nonconst, To,      \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_ABS(func, To, From)                      \
+  PPL_SPECIALIZE_FUN2_0_1(abs, func, Result, nonconst, To,      \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_SQRT(func, To, From)                     \
+  PPL_SPECIALIZE_FUN2_0_1(sqrt, func, Result, nonconst, To,     \
+                          const, From, Rounding_Dir)
+#define PPL_SPECIALIZE_ADD(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(add, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_SUB(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(sub, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_MUL(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(mul, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_DIV(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(div, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_REM(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(rem, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_IDIV(func, To, From1, From2)                     \
+  PPL_SPECIALIZE_FUN3_0_1(idiv, func, Result, nonconst, To,             \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_ADD_2EXP(func, To, From)                         \
+  PPL_SPECIALIZE_FUN2_0_2(add_2exp, func, Result, nonconst, To,         \
+                          const, From, unsigned int, Rounding_Dir)
+#define PPL_SPECIALIZE_SUB_2EXP(func, To, From)                         \
+  PPL_SPECIALIZE_FUN2_0_2(sub_2exp, func, Result, nonconst, To,         \
+                          const, From, unsigned int, Rounding_Dir)
+#define PPL_SPECIALIZE_MUL_2EXP(func, To, From)                         \
+  PPL_SPECIALIZE_FUN2_0_2(mul_2exp, func, Result, nonconst, To,         \
+                          const, From, unsigned int, Rounding_Dir)
+#define PPL_SPECIALIZE_DIV_2EXP(func, To, From)                         \
+  PPL_SPECIALIZE_FUN2_0_2(div_2exp, func, Result, nonconst, To,         \
+                          const, From, unsigned int, Rounding_Dir)
+#define PPL_SPECIALIZE_SMOD_2EXP(func, To, From)                        \
+  PPL_SPECIALIZE_FUN2_0_2(smod_2exp, func, Result, nonconst, To,        \
+                          const, From, unsigned int, Rounding_Dir)
+#define PPL_SPECIALIZE_UMOD_2EXP(func, To, From)                        \
+  PPL_SPECIALIZE_FUN2_0_2(umod_2exp, func, Result, nonconst, To,        \
+                          const, From, unsigned int, Rounding_Dir)
+#define PPL_SPECIALIZE_ADD_MUL(func, To, From1, From2)                  \
+  PPL_SPECIALIZE_FUN3_0_1(add_mul, func, Result, nonconst, To,          \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_SUB_MUL(func, To, From1, From2)                  \
+  PPL_SPECIALIZE_FUN3_0_1(sub_mul, func, Result, nonconst, To,          \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_GCD(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(gcd, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_GCDEXT(func, To1, From1, From2, To2, To3)        \
+  PPL_SPECIALIZE_FUN5_0_1(gcdext, func, Result, nonconst, To1,          \
+                          nonconst, To2, nonconst, To3,                 \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_LCM(func, To, From1, From2)                      \
+  PPL_SPECIALIZE_FUN3_0_1(lcm, func, Result, nonconst, To,              \
+                          const, From1, const, From2, Rounding_Dir)
+#define PPL_SPECIALIZE_INPUT(func, Type)                        \
+  PPL_SPECIALIZE_FUN1_0_2(input, func, Result, nonconst, Type,  \
+                          std::istream&, Rounding_Dir)
+#define PPL_SPECIALIZE_OUTPUT(func, Type)                       \
+  PPL_SPECIALIZE_FUN1_1_2(output, func, Result, std::ostream&,  \
+                          const, Type,                          \
+                          const Numeric_Format&, Rounding_Dir)
+
+
+PPL_DECLARE_FUN2_0_0(copy,
+                     void, nonconst, Type1, const, Type2)
+PPL_DECLARE_FUN1_0_0(sgn,
+                     Result_Relation, const, From)
+PPL_DECLARE_FUN2_0_0(cmp,
+                     Result_Relation, const, Type1, const, Type2)
+PPL_DECLARE_FUN1_0_3(classify,
+                     Result, const, Type, bool, bool, bool)
+PPL_DECLARE_FUN1_0_0(is_nan,
+                     bool, const, Type)
+PPL_DECLARE_FUN1_0_0(is_minf,
+                     bool, const, Type)
+PPL_DECLARE_FUN1_0_0(is_pinf,
+                     bool, const, Type)
+PPL_DECLARE_FUN1_0_0(is_int,
+                     bool, const, Type)
+PPL_DECLARE_FUN1_0_2(assign_special,
+                     Result, nonconst, Type, Result_Class, Rounding_Dir)
+PPL_DECLARE_FUN1_0_2(construct_special,
+                     Result, nonconst, Type, Result_Class, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(construct,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(assign,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(floor,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(ceil,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(trunc,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(neg,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(abs,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN2_0_1(sqrt,
+                     Result, nonconst, To, const, From, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(add,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(sub,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(mul,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(div,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(rem,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(idiv,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN2_0_2(add_2exp,
+                     Result, nonconst, To,
+                     const, From, unsigned int, Rounding_Dir)
+PPL_DECLARE_FUN2_0_2(sub_2exp,
+                     Result, nonconst, To,
+                     const, From, unsigned int, Rounding_Dir)
+PPL_DECLARE_FUN2_0_2(mul_2exp,
+                     Result, nonconst, To,
+                     const, From, unsigned int, Rounding_Dir)
+PPL_DECLARE_FUN2_0_2(div_2exp,
+                     Result, nonconst, To,
+                     const, From, unsigned int, Rounding_Dir)
+PPL_DECLARE_FUN2_0_2(smod_2exp,
+                     Result, nonconst, To,
+                     const, From, unsigned int, Rounding_Dir)
+PPL_DECLARE_FUN2_0_2(umod_2exp,
+                     Result, nonconst, To,
+                     const, From, unsigned int, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(add_mul,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(sub_mul,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(gcd,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN5_0_1(gcdext,
+                     Result, nonconst, To1, nonconst, To2, nonconst, To3,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN3_0_1(lcm,
+                     Result, nonconst, To,
+                     const, From1, const, From2, Rounding_Dir)
+PPL_DECLARE_FUN1_0_2(input,
+                     Result, nonconst, Type, std::istream&, Rounding_Dir)
+PPL_DECLARE_FUN1_1_2(output,
+                     Result, std::ostream&, const, Type,
+                     const Numeric_Format&, Rounding_Dir)
+
+#undef PPL_DECLARE_FUN1_0_0
+#undef PPL_DECLARE_FUN1_0_1
+#undef PPL_DECLARE_FUN1_0_2
+#undef PPL_DECLARE_FUN1_0_3
+#undef PPL_DECLARE_FUN1_1_1
+#undef PPL_DECLARE_FUN1_1_2
+#undef PPL_DECLARE_FUN1_2_2
+#undef PPL_DECLARE_FUN2_0_0
+#undef PPL_DECLARE_FUN2_0_1
+#undef PPL_DECLARE_FUN2_0_2
+#undef PPL_DECLARE_FUN3_0_1
+#undef PPL_DECLARE_FUN5_0_1
+
+template <typename Policy, typename To>
+Result round(To& to, Result r, Rounding_Dir dir);
+
+Result input_mpq(mpq_class& to, std::istream& is);
+
+std::string float_mpq_to_string(mpq_class& q);
+
+} // namespace Checked
+
+struct Minus_Infinity {
+  static const Result_Class vclass = VC_MINUS_INFINITY;
+};
+struct Plus_Infinity {
+  static const Result_Class vclass = VC_PLUS_INFINITY;
+};
+struct Not_A_Number {
+  static const Result_Class vclass = VC_NAN;
+};
+
+template <typename T>
+struct Is_Special : public False { };
+
+template <>
+struct Is_Special<Minus_Infinity> : public True {};
+
+template <>
+struct Is_Special<Plus_Infinity> : public True {};
+
+template <>
+struct Is_Special<Not_A_Number> : public True {};
+
+extern Minus_Infinity MINUS_INFINITY;
+extern Plus_Infinity PLUS_INFINITY;
+extern Not_A_Number NOT_A_NUMBER;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+struct Checked_Number_Transparent_Policy {
+  //! Do not check for overflowed result.
+  const_bool_nodef(check_overflow, false);
+
+  //! Do not check for attempts to add infinities with different sign.
+  const_bool_nodef(check_inf_add_inf, false);
+
+  //! Do not check for attempts to subtract infinities with same sign.
+  const_bool_nodef(check_inf_sub_inf, false);
+
+  //! Do not check for attempts to multiply infinities by zero.
+  const_bool_nodef(check_inf_mul_zero, false);
+
+  //! Do not check for attempts to divide by zero.
+  const_bool_nodef(check_div_zero, false);
+
+  //! Do not check for attempts to divide infinities.
+  const_bool_nodef(check_inf_div_inf, false);
+
+  //! Do not check for attempts to compute remainder of infinities.
+  const_bool_nodef(check_inf_mod, false);
+
+  //! Do not check for attempts to take the square root of a negative number.
+  const_bool_nodef(check_sqrt_neg, false);
+
+  //! Handle not-a-number special value if \p T has it.
+  const_bool_nodef(has_nan, std::numeric_limits<T>::has_quiet_NaN);
+
+  //! Handle infinity special values if \p T have them.
+  const_bool_nodef(has_infinity, std::numeric_limits<T>::has_infinity);
+
+  /*! \brief
+    The checked number can always be safely converted to the
+    underlying type \p T and vice-versa.
+  */
+  const_bool_nodef(convertible, true);
+
+  //! Do not honor requests to check for FPU inexact results.
+  const_bool_nodef(fpu_check_inexact, false);
+
+  //! Do not make extra checks to detect FPU NaN results.
+  const_bool_nodef(fpu_check_nan_result, false);
+
+  /*! \brief
+    For constructors, by default use the same rounding used by
+    underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_CONSTRUCTOR = ROUND_NATIVE;
+
+  /*! \brief
+    For overloaded operators (operator+(), operator-(), ...), by
+    default use the same rounding used by the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_OPERATOR = ROUND_NATIVE;
+
+  /*! \brief
+    For input functions, by default use the same rounding used by
+    the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_INPUT = ROUND_NATIVE;
+
+  /*! \brief
+    For output functions, by default use the same rounding used by
+    the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_OUTPUT = ROUND_NATIVE;
+
+  /*! \brief
+    For all other functions, by default use the same rounding used by
+    the underlying type.
+  */
+  static const Rounding_Dir ROUND_DEFAULT_FUNCTION = ROUND_NATIVE;
+
+  /*! \brief
+    Handles \p r: called by all constructors, operators and functions that
+    do not return a Result value.
+  */
+  static void handle_result(Result r);
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#define CHECK_P(cond, check) ((cond) ? (check) : (assert(!(check)), false))
+
+#include "checked_inlines.hh"
+#include "checked_int_inlines.hh"
+#include "checked_float_inlines.hh"
+#include "checked_mpz_inlines.hh"
+#include "checked_mpq_inlines.hh"
+#include "checked_ext_inlines.hh"
+
+#undef nonconst
+#ifdef PPL_SAVED_nonconst
+#define nonconst PPL_SAVED_nonconst
+#undef PPL_SAVED_nonconst
+#endif
+
+#undef PPL_FUNCTION_CLASS
+#undef PPL_NAN
+
+#endif // !defined(PPL_checked_defs_hh)
diff --git a/src/checked_ext.inlines.hh b/src/checked_ext.inlines.hh
deleted file mode 100644
index f02d9be..0000000
--- a/src/checked_ext.inlines.hh
+++ /dev/null
@@ -1,923 +0,0 @@
-/* Checked extended arithmetic functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_ext_defs_hh
-#define PPL_checked_ext_defs_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename T> struct FPU_Related : public False {};
-template <> struct FPU_Related<float> : public True {};
-template <> struct FPU_Related<double> : public True {};
-template <> struct FPU_Related<long double> : public True {};
-
-namespace Checked {
-
-template <typename T>
-inline bool
-handle_ext_natively(const T&) {
-  return FPU_Related<T>::value;
-}
-
-template <typename Policy, typename Type>
-inline bool
-ext_to_handle(const Type& x) {
-  return !handle_ext_natively(x)
-    && (Policy::has_infinity || Policy::has_nan);
-}
-
-template <typename Policy, typename Type>
-inline Result_Relation
-sgn_ext(const Type& x) {
-  if (!ext_to_handle<Policy>(x))
-    goto native;
-  if (is_nan<Policy>(x))
-    return VR_EMPTY;
-  else if (is_minf<Policy>(x))
-    return VR_LT;
-  else if (is_pinf<Policy>(x))
-    return VR_GT;
-  else {
-  native:
-    return sgn<Policy>(x);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-construct_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return construct_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return construct_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return construct_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return construct<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-assign_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return assign<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-neg_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else {
-  native:
-    return neg<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-floor_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return floor<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-ceil_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return ceil<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-trunc_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return trunc<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-abs_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x) || is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return abs<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-add_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_add_inf, is_pinf<From2_Policy>(y)))
-      goto inf_add_inf;
-    else
-      goto minf;
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_add_inf, is_minf<From2_Policy>(y))) {
-    inf_add_inf:
-      return assign_nan<To_Policy>(to, V_INF_ADD_INF);
-    }
-    else
-      goto pinf;
-  }
-  else {
-    if (is_minf<From2_Policy>(y)) {
-    minf:
-      return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-    }
-    else if (is_pinf<From2_Policy>(y)) {
-    pinf:
-      return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-    }
-    else {
-    native:
-      return add<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-sub_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_sub_inf, is_minf<From2_Policy>(y)))
-      goto inf_sub_inf;
-    else
-      goto minf;
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_sub_inf, is_pinf<From2_Policy>(y))) {
-    inf_sub_inf:
-      return assign_nan<To_Policy>(to, V_INF_SUB_INF);
-    }
-    else
-      goto pinf;
-  }
-  else {
-    if (is_pinf<From2_Policy>(y)) {
-    minf:
-      return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-    }
-    else if (is_minf<From2_Policy>(y)) {
-    pinf:
-      return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-    }
-    else {
-    native:
-      return sub<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (is_minf<From1_Policy>(x)) {
-    switch (sgn_ext<From2_Policy>(y)) {
-    case VR_LT:
-      goto pinf;
-    case VR_GT:
-      goto minf;
-    default:
-      goto inf_mul_zero;
-    }
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    switch (sgn_ext<From2_Policy>(y)) {
-    case VR_LT:
-      goto minf;
-    case VR_GT:
-      goto pinf;
-    default:
-      goto inf_mul_zero;
-    }
-  }
-  else {
-    if (is_minf<From2_Policy>(y)) {
-      switch (sgn<From1_Policy>(x)) {
-      case VR_LT:
-	goto pinf;
-      case VR_GT:
-	goto minf;
-      default:
-	goto inf_mul_zero;
-      }
-    }
-    else if (is_pinf<From2_Policy>(y)) {
-      switch (sgn<From1_Policy>(x)) {
-      case VR_LT:
-      minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-      case VR_GT:
-      pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-      default:
-      inf_mul_zero:
-	PPL_ASSERT(To_Policy::check_inf_mul_zero);
-	return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
-      }
-    }
-    else {
-    native:
-      return mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-add_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<To_Policy>(to)
-      && !ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<To_Policy>(to)
-      || is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (is_minf<From1_Policy>(x)) {
-    switch (sgn_ext<From2_Policy>(y)) {
-    case VR_LT:
-      goto a_pinf;
-    case VR_GT:
-      goto a_minf;
-    default:
-      goto inf_mul_zero;
-    }
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    switch (sgn_ext<From2_Policy>(y)) {
-    case VR_LT:
-      goto a_minf;
-    case VR_GT:
-      goto a_pinf;
-    default:
-      goto inf_mul_zero;
-    }
-  }
-  else {
-    if (is_minf<From2_Policy>(y)) {
-      switch (sgn<From1_Policy>(x)) {
-      case VR_LT:
-	goto a_pinf;
-      case VR_GT:
-	goto a_minf;
-      default:
-	goto inf_mul_zero;
-      }
-    }
-    else if (is_pinf<From2_Policy>(y)) {
-      switch (sgn<From1_Policy>(x)) {
-      case VR_LT:
-      a_minf:
-	if (CHECK_P(To_Policy::check_inf_add_inf, is_pinf<To_Policy>(to)))
-	  goto inf_add_inf;
-	else
-	  goto minf;
-      case VR_GT:
-      a_pinf:
-	if (CHECK_P(To_Policy::check_inf_add_inf, is_minf<To_Policy>(to))) {
-	inf_add_inf:
-	  return assign_nan<To_Policy>(to, V_INF_ADD_INF);
-	}
-	else
-	  goto pinf;
-      default:
-      inf_mul_zero:
-	PPL_ASSERT(To_Policy::check_inf_mul_zero);
-	return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
-      }
-    }
-    else {
-      if (is_minf<To_Policy>(to)) {
-      minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-      }
-      if (is_pinf<To_Policy>(to)) {
-      pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-      }
-    native:
-      return add_mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-sub_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<To_Policy>(to)
-      && !ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<To_Policy>(to)
-      || is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (is_minf<From1_Policy>(x)) {
-    switch (sgn_ext<From2_Policy>(y)) {
-    case VR_LT:
-      goto a_pinf;
-    case VR_GT:
-      goto a_minf;
-    default:
-      goto inf_mul_zero;
-    }
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    switch (sgn_ext<From2_Policy>(y)) {
-    case VR_LT:
-      goto a_minf;
-    case VR_GT:
-      goto a_pinf;
-    default:
-      goto inf_mul_zero;
-    }
-  }
-  else {
-    if (is_minf<From2_Policy>(y)) {
-      switch (sgn<From1_Policy>(x)) {
-      case VR_LT:
-	goto a_pinf;
-      case VR_GT:
-	goto a_minf;
-      default:
-	goto inf_mul_zero;
-      }
-    }
-    else if (is_pinf<From2_Policy>(y)) {
-      switch (sgn<From1_Policy>(x)) {
-      case VR_LT:
-      a_minf:
-	if (CHECK_P(To_Policy::check_inf_sub_inf, is_minf<To_Policy>(to)))
-	  goto inf_sub_inf;
-	else
-	  goto pinf;
-      case VR_GT:
-      a_pinf:
-	if (CHECK_P(To_Policy::check_inf_sub_inf, is_pinf<To_Policy>(to))) {
-	inf_sub_inf:
-	  return assign_nan<To_Policy>(to, V_INF_SUB_INF);
-	}
-	else
-	  goto minf;
-      default:
-      inf_mul_zero:
-	PPL_ASSERT(To_Policy::check_inf_mul_zero);
-	return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
-      }
-    }
-    else {
-      if (is_minf<To_Policy>(to)) {
-      minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-      }
-      if (is_pinf<To_Policy>(to)) {
-      pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-      }
-    native:
-      return sub_mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-div_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (is_minf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y)))
-      goto inf_div_inf;
-    else {
-      switch (sgn<From2_Policy>(y)) {
-      case VR_LT:
-	goto pinf;
-      case VR_GT:
-	goto minf;
-      default:
-	goto div_zero;
-      }
-    }
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y))) {
-    inf_div_inf:
-      return assign_nan<To_Policy>(to, V_INF_DIV_INF);
-    }
-    else {
-      switch (sgn<From2_Policy>(y)) {
-      case VR_LT:
-      minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-      case VR_GT:
-      pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-      default:
-      div_zero:
-	PPL_ASSERT(To_Policy::check_div_zero);
-	return assign_nan<To_Policy>(to, V_DIV_ZERO);
-      }
-    }
-  }
-  else {
-    if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y)) {
-      to = 0;
-      return V_EQ;
-    }
-    else {
-    native:
-      return div<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-idiv_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (is_minf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y)))
-      goto inf_div_inf;
-    else {
-      switch (sgn<From2_Policy>(y)) {
-      case VR_LT:
-	goto pinf;
-      case VR_GT:
-	goto minf;
-      default:
-	goto div_zero;
-      }
-    }
-  }
-  else if (is_pinf<From1_Policy>(x)) {
-    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y))) {
-    inf_div_inf:
-      return assign_nan<To_Policy>(to, V_INF_DIV_INF);
-    }
-    else {
-      switch (sgn<From2_Policy>(y)) {
-      case VR_LT:
-      minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-      case VR_GT:
-      pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-      default:
-      div_zero:
-	PPL_ASSERT(To_Policy::check_div_zero);
-	return assign_nan<To_Policy>(to, V_DIV_ZERO);
-      }
-    }
-  }
-  else {
-    if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y)) {
-      to = 0;
-      return V_EQ;
-    }
-    else {
-    native:
-      return idiv<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-rem_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
-    goto native;
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From1_Policy>(x)
-		   || is_pinf<From1_Policy>(x))) {
-    return assign_nan<To_Policy>(to, V_INF_MOD);
-  }
-  else {
-    if (is_minf<From1_Policy>(y) || is_pinf<From2_Policy>(y)) {
-      to = x;
-      return V_EQ;
-    }
-    else {
-    native:
-      return rem<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-    }
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-add_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return add_2exp<To_Policy, From_Policy>(to, x, exp, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-sub_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return sub_2exp<To_Policy, From_Policy>(to, x, exp, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-mul_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return mul_2exp<To_Policy, From_Policy>(to, x, exp, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-div_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return div_2exp<To_Policy, From_Policy>(to, x, exp, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-smod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From_Policy>(x)
-		   || is_pinf<From_Policy>(x))) {
-    return assign_nan<To_Policy>(to, V_INF_MOD);
-  }
-  else {
-  native:
-    return smod_2exp<To_Policy, From_Policy>(to, x, exp, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-umod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From_Policy>(x)
-		   || is_pinf<From_Policy>(x))) {
-    return assign_nan<To_Policy>(to, V_INF_MOD);
-  }
-  else {
-  native:
-    return umod_2exp<To_Policy, From_Policy>(to, x, exp, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
-inline Result
-sqrt_ext(To& to, const From& x, Rounding_Dir dir) {
-  if (!ext_to_handle<From_Policy>(x))
-    goto native;
-  if (is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(x)) {
-    return assign_nan<To_Policy>(to, V_SQRT_NEG);
-  }
-  else if (is_pinf<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else {
-  native:
-    return sqrt<To_Policy, From_Policy>(to, x, dir);
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-gcd_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x))
-    return abs_ext<To_Policy, From2_Policy>(to, y, dir);
-  else if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y))
-    return abs_ext<To_Policy, From1_Policy>(to, x, dir);
-  else
-    return gcd<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-}
-
-template <typename To1_Policy, typename To2_Policy, typename To3_Policy,
-	  typename From1_Policy, typename From2_Policy,
-	  typename To1, typename To2, typename To3,
-	  typename From1, typename From2>
-inline Result
-gcdext_ext(To1& to, To2& s, To3& t, const From1& x, const From2& y,
-	   Rounding_Dir dir) {
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To1_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x)) {
-    s = 0;
-    t = y > 0 ? -1 : 1;
-    return abs_ext<To1_Policy, From2_Policy>(to, y, dir);
-  }
-  else if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y)) {
-    s = x > 0 ? -1 : 1;
-    t = 0;
-    return abs_ext<To1_Policy, From1_Policy>(to, x, dir);
-  }
-  else
-    return gcdext<To1_Policy, To2_Policy, To3_Policy, From1_Policy, From2_Policy>(to, s, t, x, y, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
-inline Result
-lcm_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
-  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x)
-	   || is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  else
-    return lcm<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline Result_Relation
-cmp_ext(const Type1& x, const Type2& y) {
-  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
-    goto native;
-  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
-    return VR_EMPTY;
-  else if (is_minf<Policy1>(x))
-    return is_minf<Policy2>(y) ? VR_EQ : VR_LT;
-  else if (is_pinf<Policy1>(x))
-    return is_pinf<Policy2>(y) ? VR_EQ : VR_GT;
-  else {
-    if (is_minf<Policy2>(y))
-      return VR_GT;
-    if (is_pinf<Policy2>(y))
-      return VR_LT;
-  native:
-    return cmp<Policy1, Policy2>(x, y);
-  }
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-lt_ext(const Type1& x, const Type2& y) {
-  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
-    goto native;
-  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
-    return false;
-  if (is_pinf<Policy1>(x) || is_minf<Policy2>(y))
-    return false;
-  if (is_minf<Policy1>(x) || is_pinf<Policy2>(y))
-    return true;
- native:
-  return lt_p<Policy1, Policy2>(x, y);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-gt_ext(const Type1& x, const Type2& y) {
-  return lt_ext<Policy1, Policy2>(y, x);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-le_ext(const Type1& x, const Type2& y) {
-  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
-    goto native;
-  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
-    return false;
-  if (is_minf<Policy1>(x) || is_pinf<Policy2>(y))
-    return true;
-  if (is_pinf<Policy1>(x) || is_minf<Policy2>(y))
-    return false;
- native:
-  return le_p<Policy1, Policy2>(x, y);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-ge_ext(const Type1& x, const Type2& y) {
-  return le_ext<Policy1, Policy2>(y, x);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-eq_ext(const Type1& x, const Type2& y) {
-  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
-    goto native;
-  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
-    return false;
-  if (is_minf<Policy1>(x))
-    return is_minf<Policy2>(y);
-  if (is_pinf<Policy1>(x))
-    return is_pinf<Policy2>(y);
-  else if (is_minf<Policy2>(y) || is_pinf<Policy2>(y))
-    return false;
- native:
-  return eq_p<Policy1, Policy2>(x, y);
-}
-
-template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
-inline bool
-ne_ext(const Type1& x, const Type2& y) {
-  return !eq_ext<Policy1, Policy2>(x, y);
-}
-
-template <typename Policy, typename Type>
-inline Result
-output_ext(std::ostream& os, const Type& x,
-	   const Numeric_Format& format, Rounding_Dir dir) {
-  if (!ext_to_handle<Policy>(x))
-    goto native;
-  if (is_nan<Policy>(x)) {
-    os << "nan";
-    return V_NAN;
-  }
-  if (is_minf<Policy>(x)) {
-    os << "-inf";
-    return V_EQ;
-  }
-  if (is_pinf<Policy>(x)) {
-    os << "+inf";
-    return V_EQ;
-  }
- native:
-  return output<Policy>(os, x, format, dir);
-}
-
-template <typename To_Policy, typename To>
-inline Result
-input_ext(To& to, std::istream& is, Rounding_Dir dir) {
-  return input<To_Policy>(to, is, dir);
-}
-
-} // namespace Checked
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_checked_ext_defs_hh)
diff --git a/src/checked_ext_inlines.hh b/src/checked_ext_inlines.hh
new file mode 100644
index 0000000..2f6a9b5
--- /dev/null
+++ b/src/checked_ext_inlines.hh
@@ -0,0 +1,923 @@
+/* Checked extended arithmetic functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_ext_defs_hh
+#define PPL_checked_ext_defs_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T> struct FPU_Related : public False {};
+template <> struct FPU_Related<float> : public True {};
+template <> struct FPU_Related<double> : public True {};
+template <> struct FPU_Related<long double> : public True {};
+
+namespace Checked {
+
+template <typename T>
+inline bool
+handle_ext_natively(const T&) {
+  return FPU_Related<T>::value;
+}
+
+template <typename Policy, typename Type>
+inline bool
+ext_to_handle(const Type& x) {
+  return !handle_ext_natively(x)
+    && (Policy::has_infinity || Policy::has_nan);
+}
+
+template <typename Policy, typename Type>
+inline Result_Relation
+sgn_ext(const Type& x) {
+  if (!ext_to_handle<Policy>(x))
+    goto native;
+  if (is_nan<Policy>(x))
+    return VR_EMPTY;
+  else if (is_minf<Policy>(x))
+    return VR_LT;
+  else if (is_pinf<Policy>(x))
+    return VR_GT;
+  else {
+  native:
+    return sgn<Policy>(x);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+construct_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return construct_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return construct_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return construct_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return construct<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+assign_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return assign<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+neg_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else {
+  native:
+    return neg<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+floor_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return floor<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+ceil_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return ceil<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+trunc_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return trunc<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+abs_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x) || is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return abs<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+add_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_add_inf, is_pinf<From2_Policy>(y)))
+      goto inf_add_inf;
+    else
+      goto minf;
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_add_inf, is_minf<From2_Policy>(y))) {
+    inf_add_inf:
+      return assign_nan<To_Policy>(to, V_INF_ADD_INF);
+    }
+    else
+      goto pinf;
+  }
+  else {
+    if (is_minf<From2_Policy>(y)) {
+    minf:
+      return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+    }
+    else if (is_pinf<From2_Policy>(y)) {
+    pinf:
+      return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+    }
+    else {
+    native:
+      return add<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+sub_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_sub_inf, is_minf<From2_Policy>(y)))
+      goto inf_sub_inf;
+    else
+      goto minf;
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_sub_inf, is_pinf<From2_Policy>(y))) {
+    inf_sub_inf:
+      return assign_nan<To_Policy>(to, V_INF_SUB_INF);
+    }
+    else
+      goto pinf;
+  }
+  else {
+    if (is_pinf<From2_Policy>(y)) {
+    minf:
+      return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+    }
+    else if (is_minf<From2_Policy>(y)) {
+    pinf:
+      return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+    }
+    else {
+    native:
+      return sub<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (is_minf<From1_Policy>(x)) {
+    switch (sgn_ext<From2_Policy>(y)) {
+    case VR_LT:
+      goto pinf;
+    case VR_GT:
+      goto minf;
+    default:
+      goto inf_mul_zero;
+    }
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    switch (sgn_ext<From2_Policy>(y)) {
+    case VR_LT:
+      goto minf;
+    case VR_GT:
+      goto pinf;
+    default:
+      goto inf_mul_zero;
+    }
+  }
+  else {
+    if (is_minf<From2_Policy>(y)) {
+      switch (sgn<From1_Policy>(x)) {
+      case VR_LT:
+        goto pinf;
+      case VR_GT:
+        goto minf;
+      default:
+        goto inf_mul_zero;
+      }
+    }
+    else if (is_pinf<From2_Policy>(y)) {
+      switch (sgn<From1_Policy>(x)) {
+      case VR_LT:
+      minf:
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+      case VR_GT:
+      pinf:
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+      default:
+      inf_mul_zero:
+        PPL_ASSERT(To_Policy::check_inf_mul_zero);
+        return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+      }
+    }
+    else {
+    native:
+      return mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+add_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<To_Policy>(to)
+      && !ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<To_Policy>(to)
+      || is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (is_minf<From1_Policy>(x)) {
+    switch (sgn_ext<From2_Policy>(y)) {
+    case VR_LT:
+      goto a_pinf;
+    case VR_GT:
+      goto a_minf;
+    default:
+      goto inf_mul_zero;
+    }
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    switch (sgn_ext<From2_Policy>(y)) {
+    case VR_LT:
+      goto a_minf;
+    case VR_GT:
+      goto a_pinf;
+    default:
+      goto inf_mul_zero;
+    }
+  }
+  else {
+    if (is_minf<From2_Policy>(y)) {
+      switch (sgn<From1_Policy>(x)) {
+      case VR_LT:
+        goto a_pinf;
+      case VR_GT:
+        goto a_minf;
+      default:
+        goto inf_mul_zero;
+      }
+    }
+    else if (is_pinf<From2_Policy>(y)) {
+      switch (sgn<From1_Policy>(x)) {
+      case VR_LT:
+      a_minf:
+        if (CHECK_P(To_Policy::check_inf_add_inf, is_pinf<To_Policy>(to)))
+          goto inf_add_inf;
+        else
+          goto minf;
+      case VR_GT:
+      a_pinf:
+        if (CHECK_P(To_Policy::check_inf_add_inf, is_minf<To_Policy>(to))) {
+        inf_add_inf:
+          return assign_nan<To_Policy>(to, V_INF_ADD_INF);
+        }
+        else
+          goto pinf;
+      default:
+      inf_mul_zero:
+        PPL_ASSERT(To_Policy::check_inf_mul_zero);
+        return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+      }
+    }
+    else {
+      if (is_minf<To_Policy>(to)) {
+      minf:
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+      }
+      if (is_pinf<To_Policy>(to)) {
+      pinf:
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+      }
+    native:
+      return add_mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+sub_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<To_Policy>(to)
+      && !ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<To_Policy>(to)
+      || is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (is_minf<From1_Policy>(x)) {
+    switch (sgn_ext<From2_Policy>(y)) {
+    case VR_LT:
+      goto a_pinf;
+    case VR_GT:
+      goto a_minf;
+    default:
+      goto inf_mul_zero;
+    }
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    switch (sgn_ext<From2_Policy>(y)) {
+    case VR_LT:
+      goto a_minf;
+    case VR_GT:
+      goto a_pinf;
+    default:
+      goto inf_mul_zero;
+    }
+  }
+  else {
+    if (is_minf<From2_Policy>(y)) {
+      switch (sgn<From1_Policy>(x)) {
+      case VR_LT:
+        goto a_pinf;
+      case VR_GT:
+        goto a_minf;
+      default:
+        goto inf_mul_zero;
+      }
+    }
+    else if (is_pinf<From2_Policy>(y)) {
+      switch (sgn<From1_Policy>(x)) {
+      case VR_LT:
+      a_minf:
+        if (CHECK_P(To_Policy::check_inf_sub_inf, is_minf<To_Policy>(to)))
+          goto inf_sub_inf;
+        else
+          goto pinf;
+      case VR_GT:
+      a_pinf:
+        if (CHECK_P(To_Policy::check_inf_sub_inf, is_pinf<To_Policy>(to))) {
+        inf_sub_inf:
+          return assign_nan<To_Policy>(to, V_INF_SUB_INF);
+        }
+        else
+          goto minf;
+      default:
+      inf_mul_zero:
+        PPL_ASSERT(To_Policy::check_inf_mul_zero);
+        return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+      }
+    }
+    else {
+      if (is_minf<To_Policy>(to)) {
+      minf:
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+      }
+      if (is_pinf<To_Policy>(to)) {
+      pinf:
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+      }
+    native:
+      return sub_mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+div_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (is_minf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
+                || is_pinf<From2_Policy>(y)))
+      goto inf_div_inf;
+    else {
+      switch (sgn<From2_Policy>(y)) {
+      case VR_LT:
+        goto pinf;
+      case VR_GT:
+        goto minf;
+      default:
+        goto div_zero;
+      }
+    }
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
+                || is_pinf<From2_Policy>(y))) {
+    inf_div_inf:
+      return assign_nan<To_Policy>(to, V_INF_DIV_INF);
+    }
+    else {
+      switch (sgn<From2_Policy>(y)) {
+      case VR_LT:
+      minf:
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+      case VR_GT:
+      pinf:
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+      default:
+      div_zero:
+        PPL_ASSERT(To_Policy::check_div_zero);
+        return assign_nan<To_Policy>(to, V_DIV_ZERO);
+      }
+    }
+  }
+  else {
+    if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y)) {
+      to = 0;
+      return V_EQ;
+    }
+    else {
+    native:
+      return div<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+idiv_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (is_minf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
+                || is_pinf<From2_Policy>(y)))
+      goto inf_div_inf;
+    else {
+      switch (sgn<From2_Policy>(y)) {
+      case VR_LT:
+        goto pinf;
+      case VR_GT:
+        goto minf;
+      default:
+        goto div_zero;
+      }
+    }
+  }
+  else if (is_pinf<From1_Policy>(x)) {
+    if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
+                || is_pinf<From2_Policy>(y))) {
+    inf_div_inf:
+      return assign_nan<To_Policy>(to, V_INF_DIV_INF);
+    }
+    else {
+      switch (sgn<From2_Policy>(y)) {
+      case VR_LT:
+      minf:
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+      case VR_GT:
+      pinf:
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+      default:
+      div_zero:
+        PPL_ASSERT(To_Policy::check_div_zero);
+        return assign_nan<To_Policy>(to, V_DIV_ZERO);
+      }
+    }
+  }
+  else {
+    if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y)) {
+      to = 0;
+      return V_EQ;
+    }
+    else {
+    native:
+      return idiv<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+rem_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
+    goto native;
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From1_Policy>(x)
+                   || is_pinf<From1_Policy>(x))) {
+    return assign_nan<To_Policy>(to, V_INF_MOD);
+  }
+  else {
+    if (is_minf<From1_Policy>(y) || is_pinf<From2_Policy>(y)) {
+      to = x;
+      return V_EQ;
+    }
+    else {
+    native:
+      return rem<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+    }
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+add_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return add_2exp<To_Policy, From_Policy>(to, x, exp, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+sub_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return sub_2exp<To_Policy, From_Policy>(to, x, exp, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+mul_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return mul_2exp<To_Policy, From_Policy>(to, x, exp, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+div_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return div_2exp<To_Policy, From_Policy>(to, x, exp, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+smod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From_Policy>(x)
+                   || is_pinf<From_Policy>(x))) {
+    return assign_nan<To_Policy>(to, V_INF_MOD);
+  }
+  else {
+  native:
+    return smod_2exp<To_Policy, From_Policy>(to, x, exp, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+umod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From_Policy>(x)
+                   || is_pinf<From_Policy>(x))) {
+    return assign_nan<To_Policy>(to, V_INF_MOD);
+  }
+  else {
+  native:
+    return umod_2exp<To_Policy, From_Policy>(to, x, exp, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy,
+          typename To, typename From>
+inline Result
+sqrt_ext(To& to, const From& x, Rounding_Dir dir) {
+  if (!ext_to_handle<From_Policy>(x))
+    goto native;
+  if (is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(x)) {
+    return assign_nan<To_Policy>(to, V_SQRT_NEG);
+  }
+  else if (is_pinf<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else {
+  native:
+    return sqrt<To_Policy, From_Policy>(to, x, dir);
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+gcd_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x))
+    return abs_ext<To_Policy, From2_Policy>(to, y, dir);
+  else if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y))
+    return abs_ext<To_Policy, From1_Policy>(to, x, dir);
+  else
+    return gcd<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+}
+
+template <typename To1_Policy, typename To2_Policy, typename To3_Policy,
+          typename From1_Policy, typename From2_Policy,
+          typename To1, typename To2, typename To3,
+          typename From1, typename From2>
+inline Result
+gcdext_ext(To1& to, To2& s, To3& t, const From1& x, const From2& y,
+           Rounding_Dir dir) {
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To1_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x)) {
+    s = 0;
+    t = y > 0 ? -1 : 1;
+    return abs_ext<To1_Policy, From2_Policy>(to, y, dir);
+  }
+  else if (is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y)) {
+    s = x > 0 ? -1 : 1;
+    t = 0;
+    return abs_ext<To1_Policy, From1_Policy>(to, x, dir);
+  }
+  else
+    return gcdext<To1_Policy, To2_Policy, To3_Policy, From1_Policy, From2_Policy>(to, s, t, x, y, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+lcm_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x)
+           || is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  else
+    return lcm<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline Result_Relation
+cmp_ext(const Type1& x, const Type2& y) {
+  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
+    goto native;
+  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
+    return VR_EMPTY;
+  else if (is_minf<Policy1>(x))
+    return is_minf<Policy2>(y) ? VR_EQ : VR_LT;
+  else if (is_pinf<Policy1>(x))
+    return is_pinf<Policy2>(y) ? VR_EQ : VR_GT;
+  else {
+    if (is_minf<Policy2>(y))
+      return VR_GT;
+    if (is_pinf<Policy2>(y))
+      return VR_LT;
+  native:
+    return cmp<Policy1, Policy2>(x, y);
+  }
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+lt_ext(const Type1& x, const Type2& y) {
+  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
+    goto native;
+  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
+    return false;
+  if (is_pinf<Policy1>(x) || is_minf<Policy2>(y))
+    return false;
+  if (is_minf<Policy1>(x) || is_pinf<Policy2>(y))
+    return true;
+ native:
+  return lt_p<Policy1, Policy2>(x, y);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+gt_ext(const Type1& x, const Type2& y) {
+  return lt_ext<Policy1, Policy2>(y, x);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+le_ext(const Type1& x, const Type2& y) {
+  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
+    goto native;
+  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
+    return false;
+  if (is_minf<Policy1>(x) || is_pinf<Policy2>(y))
+    return true;
+  if (is_pinf<Policy1>(x) || is_minf<Policy2>(y))
+    return false;
+ native:
+  return le_p<Policy1, Policy2>(x, y);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+ge_ext(const Type1& x, const Type2& y) {
+  return le_ext<Policy1, Policy2>(y, x);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+eq_ext(const Type1& x, const Type2& y) {
+  if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
+    goto native;
+  if (is_nan<Policy1>(x) || is_nan<Policy2>(y))
+    return false;
+  if (is_minf<Policy1>(x))
+    return is_minf<Policy2>(y);
+  if (is_pinf<Policy1>(x))
+    return is_pinf<Policy2>(y);
+  else if (is_minf<Policy2>(y) || is_pinf<Policy2>(y))
+    return false;
+ native:
+  return eq_p<Policy1, Policy2>(x, y);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+ne_ext(const Type1& x, const Type2& y) {
+  return !eq_ext<Policy1, Policy2>(x, y);
+}
+
+template <typename Policy, typename Type>
+inline Result
+output_ext(std::ostream& os, const Type& x,
+           const Numeric_Format& format, Rounding_Dir dir) {
+  if (!ext_to_handle<Policy>(x))
+    goto native;
+  if (is_nan<Policy>(x)) {
+    os << "nan";
+    return V_NAN;
+  }
+  if (is_minf<Policy>(x)) {
+    os << "-inf";
+    return V_EQ;
+  }
+  if (is_pinf<Policy>(x)) {
+    os << "+inf";
+    return V_EQ;
+  }
+ native:
+  return output<Policy>(os, x, format, dir);
+}
+
+template <typename To_Policy, typename To>
+inline Result
+input_ext(To& to, std::istream& is, Rounding_Dir dir) {
+  return input<To_Policy>(to, is, dir);
+}
+
+} // namespace Checked
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_checked_ext_defs_hh)
diff --git a/src/checked_float.inlines.hh b/src/checked_float.inlines.hh
deleted file mode 100644
index 42fd370..0000000
--- a/src/checked_float.inlines.hh
+++ /dev/null
@@ -1,1236 +0,0 @@
-/* Specialized "checked" functions for native floating-point numbers.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_float_inlines_hh
-#define PPL_checked_float_inlines_hh 1
-
-#include "compiler.hh"
-#ifndef __alpha
-#include <cmath>
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-namespace Checked {
-
-inline float
-multiply_add(float x, float y, float z) {
-#if PPL_HAVE_DECL_FMAF && defined(FP_FAST_FMAF) \
-  && !defined(__alpha) && !defined(__FreeBSD__)
-  return fmaf(x, y, z);
-#else
-  return x*y + z;
-#endif
-}
-
-inline double
-multiply_add(double x, double y, double z) {
-#if PPL_HAVE_DECL_FMA && defined(FP_FAST_FMA) \
-  && !defined(__alpha) && !defined(__FreeBSD__)
-  return fma(x, y, z);
-#else
-  return x*y + z;
-#endif
-}
-
-inline long double
-multiply_add(long double x, long double y, long double z) {
-#if PPL_HAVE_DECL_FMAL && defined(FP_FAST_FMAL) \
-  && !defined(__alpha) && !defined(__FreeBSD__)
-  return fmal(x, y, z);
-#else
-  return x*y + z;
-#endif
-}
-
-#if PPL_HAVE_DECL_RINTF
-inline float
-round_to_integer(float x) {
-  return rintf(x);
-}
-#endif
-
-inline double
-round_to_integer(double x) {
-  return rint(x);
-}
-
-#if PPL_HAVE_DECL_RINTL
-inline long double
-round_to_integer(long double x) {
-  return rintl(x);
-}
-#elif !PPL_CXX_PROVIDES_PROPER_LONG_DOUBLE
-// If proper long doubles are not provided, this is most likely
-// because long double and double are the same type: use rint().
-inline long double
-round_to_integer(long double x) {
-  return rint(x);
-}
-#elif defined(__i386__) && (defined(__GNUC__) || defined(__INTEL_COMPILER))
-// On Cygwin, we have proper long doubles but rintl() is not defined:
-// luckily, one machine instruction is enough to save the day.
-inline long double
-round_to_integer(long double x) {
-  long double i;
-  __asm__ ("frndint" : "=t" (i) : "0" (x));
-  return i;
-}
-#endif
-
-inline bool
-fpu_direct_rounding(Rounding_Dir dir) {
-  return round_direct(dir) || round_not_requested(dir);
-}
-
-inline bool
-fpu_inverse_rounding(Rounding_Dir dir) {
-  return round_inverse(dir);
-}
-
-// The FPU mode is "round down".
-//
-// The result of the rounded down multiplication is thus computed directly.
-//
-//   a = 0.3
-//   b = 0.1
-//   c_i = a * b = 0.03
-//   c = c_i = 0.0
-//
-// To obtain the result of the rounded up multiplication
-// we do -(-a * b).
-//
-//   a = 0.3
-//   b = 0.1
-//   c_i = -a * b = -0.03
-//
-// Here c_i should be forced to lose excess precision, otherwise the
-// FPU will truncate using the rounding mode in force, which is "round down".
-//
-//   c_i = -c_i = 0.03
-//   c = c_i = 0.0
-//
-// Wrong result: we should have obtained c = 0.1.
-
-inline void
-limit_precision(const float& v) {
-  PPL_CC_FLUSH(v);
-}
-
-inline void
-limit_precision(const double& v) {
-  PPL_CC_FLUSH(v);
-}
-
-inline void
-limit_precision(const long double&) {
-}
-
-template <typename Policy, typename T>
-inline Result
-classify_float(const T v, bool nan, bool inf, bool sign) {
-  Float<T> f(v);
-  if ((nan || sign) && CHECK_P(Policy::has_nan, f.u.binary.is_nan()))
-    return V_NAN;
-  if (inf) {
-    if (Policy::has_infinity) {
-      int sign_inf = f.u.binary.inf_sign();
-      if (sign_inf < 0)
-        return V_EQ_MINUS_INFINITY;
-      if (sign_inf > 0)
-        return V_EQ_PLUS_INFINITY;
-    }
-    else
-      PPL_ASSERT(f.u.binary.inf_sign() == 0);
-  }
-  if (sign) {
-    if (v < 0)
-      return V_LT;
-    if (v > 0)
-      return V_GT;
-    return V_EQ;
-  }
-  return V_LGE;
-}
-
-template <typename Policy, typename T>
-inline bool
-is_nan_float(const T v) {
-  Float<T> f(v);
-  return CHECK_P(Policy::has_nan, f.u.binary.is_nan());
-}
-
-template <typename Policy, typename T>
-inline bool
-is_inf_float(const T v) {
-  Float<T> f(v);
-  return CHECK_P(Policy::has_infinity, (f.u.binary.inf_sign() != 0));
-}
-template <typename Policy, typename T>
-inline bool
-is_minf_float(const T v) {
-  Float<T> f(v);
-  return CHECK_P(Policy::has_infinity, (f.u.binary.inf_sign() < 0));
-}
-
-template <typename Policy, typename T>
-inline bool
-is_pinf_float(const T v) {
-  Float<T> f(v);
-  return CHECK_P(Policy::has_infinity, (f.u.binary.inf_sign() > 0));
-}
-
-
-template <typename Policy, typename T>
-inline bool
-is_int_float(const T v) {
-  return round_to_integer(v) == v;
-}
-
-template <typename Policy, typename T>
-inline Result
-assign_special_float(T& v, Result_Class c, Rounding_Dir) {
-  PPL_ASSERT(c == VC_MINUS_INFINITY || c == VC_PLUS_INFINITY || c == VC_NAN);
-  switch (c) {
-  case VC_MINUS_INFINITY:
-    v = -HUGE_VAL;
-    return V_EQ_MINUS_INFINITY;
-  case VC_PLUS_INFINITY:
-    v = HUGE_VAL;
-    return V_EQ_PLUS_INFINITY;
-  case VC_NAN:
-    v = PPL_NAN;
-    return V_NAN;
-  default:
-    PPL_UNREACHABLE;
-    return V_NAN | V_UNREPRESENTABLE;
-  }
-}
-
-template <typename T>
-inline void
-pred_float(T& v) {
-  Float<T> f(v);
-  PPL_ASSERT(!f.u.binary.is_nan());
-  PPL_ASSERT(f.u.binary.inf_sign() >= 0);
-  if (f.u.binary.zero_sign() > 0) {
-    f.u.binary.negate();
-    f.u.binary.inc();
-  }
-  else if (f.u.binary.sign_bit()) {
-    f.u.binary.inc();
-  }
-  else {
-    f.u.binary.dec();
-  }
-  v = f.value();
-}
-
-template <typename T>
-inline void
-succ_float(T& v) {
-  Float<T> f(v);
-  PPL_ASSERT(!f.u.binary.is_nan());
-  PPL_ASSERT(f.u.binary.inf_sign() <= 0);
-  if (f.u.binary.zero_sign() < 0) {
-    f.u.binary.negate();
-    f.u.binary.inc();
-  }
-  else if (!f.u.binary.sign_bit()) {
-    f.u.binary.inc();
-  }
-  else {
-    f.u.binary.dec();
-  }
-  v = f.value();
-}
-
-template <typename Policy, typename To>
-inline Result
-round_lt_float(To& to, Rounding_Dir dir) {
-  if (round_down(dir)) {
-    pred_float(to);
-    return V_GT;
-  }
-  return V_LT;
-}
-
-template <typename Policy, typename To>
-inline Result
-round_gt_float(To& to, Rounding_Dir dir) {
-  if (round_up(dir)) {
-    succ_float(to);
-    return V_LT;
-  }
-  return V_GT;
-}
-
-
-template <typename Policy>
-inline void
-prepare_inexact(Rounding_Dir dir) {
-  if (Policy::fpu_check_inexact
-      && !round_not_needed(dir) && round_strict_relation(dir))
-    fpu_reset_inexact();
-}
-
-template <typename Policy>
-inline Result
-result_relation(Rounding_Dir dir) {
-  if (Policy::fpu_check_inexact
-      && !round_not_needed(dir) && round_strict_relation(dir)) {
-    switch (fpu_check_inexact()) {
-    case 0:
-      return V_EQ;
-    case -1:
-      goto unknown;
-    case 1:
-      break;
-    }
-    switch (round_dir(dir)) {
-    case ROUND_DOWN:
-      return V_GT;
-    case ROUND_UP:
-      return V_LT;
-    default:
-      return V_NE;
-    }
-  }
-  else {
-  unknown:
-    switch (round_dir(dir)) {
-    case ROUND_DOWN:
-      return V_GE;
-    case ROUND_UP:
-      return V_LE;
-    default:
-      return V_LGE;
-    }
-  }
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_float_float_exact(To& to, const From from, Rounding_Dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  to = from;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_float_float_inexact(To& to, const From from, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = from;
-  else if (fpu_inverse_rounding(dir)) {
-    From tmp = -from;
-    to = tmp;
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(from);
-    to = from;
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_float_float(To& to, const From from, Rounding_Dir dir) {
-  if (sizeof(From) > sizeof(To))
-    return assign_float_float_inexact<To_Policy, From_Policy>(to, from, dir);
-  else
-    return assign_float_float_exact<To_Policy, From_Policy>(to, from, dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-floor_float(Type& to, const Type from, Rounding_Dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (fpu_direct_rounding(ROUND_DOWN))
-    to = round_to_integer(from);
-  else if (fpu_inverse_rounding(ROUND_DOWN)) {
-    to = round_to_integer(-from);
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(ROUND_DOWN));
-    limit_precision(from);
-    to = round_to_integer(from);
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-ceil_float(Type& to, const Type from, Rounding_Dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (fpu_direct_rounding(ROUND_UP))
-    to = round_to_integer(from);
-  else if (fpu_inverse_rounding(ROUND_UP)) {
-    to = round_to_integer(-from);
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(ROUND_UP));
-    limit_precision(from);
-    to = round_to_integer(from);
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-trunc_float(Type& to, const Type from, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (from >= 0)
-    return floor<To_Policy, From_Policy>(to, from, dir);
-  else
-    return ceil<To_Policy, From_Policy>(to, from, dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-neg_float(Type& to, const Type from, Rounding_Dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  to = -from;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-add_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_inf_add_inf
-      && is_inf_float<From1_Policy>(x) && x == -y) {
-    return assign_nan<To_Policy>(to, V_INF_ADD_INF);
-  }
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = x + y;
-  else if (fpu_inverse_rounding(dir)) {
-    to = -x - y;
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(x);
-    limit_precision(y);
-    to = x + y;
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-sub_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_inf_sub_inf
-      && is_inf_float<From1_Policy>(x) && x == y) {
-    return assign_nan<To_Policy>(to, V_INF_SUB_INF);
-  }
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = x - y;
-  else if (fpu_inverse_rounding(dir)) {
-    to = y - x;
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(x);
-    limit_precision(y);
-    to = x - y;
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_inf_mul_zero
-      && ((x == 0 && is_inf_float<From2_Policy>(y))
-          ||
-	  (y == 0 && is_inf_float<From1_Policy>(x)))) {
-    return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
-  }
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = x * y;
-  else if (fpu_inverse_rounding(dir)) {
-    to = x * -y;
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(x);
-    limit_precision(y);
-    to = x * y;
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-div_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_inf_div_inf
-      && is_inf_float<From1_Policy>(x) && is_inf_float<From2_Policy>(y)) {
-    return assign_nan<To_Policy>(to, V_INF_DIV_INF);
-  }
-  if (To_Policy::check_div_zero && y == 0) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = x / y;
-  else if (fpu_inverse_rounding(dir)) {
-    to = x / -y;
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(x);
-    limit_precision(y);
-    to = x / y;
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-idiv_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  Type temp;
-  // The inexact check is useless
-  dir = round_dir(dir);
-  Result r = div<To_Policy, From1_Policy, From2_Policy>(temp, x, y, dir);
-  if (result_class(r) != VC_NORMAL) {
-    to = temp;
-    return r;
-  }
-  Result r1 = trunc<To_Policy, To_Policy>(to, temp, ROUND_NOT_NEEDED);
-  PPL_ASSERT(r1 == V_EQ);
-  if (r == V_EQ || to != temp)
-    return r1;
-  // FIXME: Prove that it is impossible to return a strict relation
-  return (dir == ROUND_UP) ? V_LE : V_GE;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-rem_float(Type& to, const Type x, const Type y, Rounding_Dir) {
-  if (To_Policy::check_inf_mod && is_inf_float<From1_Policy>(x)) {
-    return assign_nan<To_Policy>(to, V_INF_MOD);
-  }
-  if (To_Policy::check_div_zero && y == 0) {
-    return assign_nan<To_Policy>(to, V_MOD_ZERO);
-  }
-  to = std::fmod(x, y);
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return V_EQ;
-}
-
-struct Float_2exp {
-  const_bool_nodef(has_nan, false);
-  const_bool_nodef(has_infinity, false);
-};
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-add_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
-  return
-    add<To_Policy, From_Policy, Float_2exp>(to,
-                                            x,
-                                            Type(1ULL << exp),
-                                            dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-sub_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
-  return
-    sub<To_Policy, From_Policy, Float_2exp>(to,
-                                            x,
-                                            Type(1ULL << exp),
-                                            dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-mul_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
-  return
-    mul<To_Policy, From_Policy, Float_2exp>(to,
-                                            x,
-                                            Type(1ULL << exp),
-                                            dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-div_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
-  return
-    div<To_Policy, From_Policy, Float_2exp>(to,
-                                            x,
-                                            Type(1ULL << exp),
-                                            dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-smod_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (To_Policy::check_inf_mod && is_inf_float<From_Policy>(x)) {
-    return assign_nan<To_Policy>(to, V_INF_MOD);
-  }
-  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
-  Type m = 1ULL << exp;
-  rem_float<To_Policy, From_Policy, Float_2exp>(to, x, m, ROUND_IGNORE);
-  Type m2 = m / 2;
-  if (to < -m2)
-    return add_float<To_Policy, From_Policy, Float_2exp>(to, to, m, dir);
-  else if (to >= m2)
-    return sub_float<To_Policy, From_Policy, Float_2exp>(to, to, m, dir);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-umod_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (To_Policy::check_inf_mod && is_inf_float<From_Policy>(x)) {
-    return assign_nan<To_Policy>(to, V_INF_MOD);
-  }
-  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
-  Type m = 1ULL << exp;
-  rem_float<To_Policy, From_Policy, Float_2exp>(to, x, m, ROUND_IGNORE);
-  if (to < 0)
-    return add_float<To_Policy, From_Policy, Float_2exp>(to, to, m, dir);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-abs_float(Type& to, const Type from, Rounding_Dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  to = std::abs(from);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-sqrt_float(Type& to, const Type from, Rounding_Dir dir) {
-  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  if (To_Policy::check_sqrt_neg && from < 0) {
-    return assign_nan<To_Policy>(to, V_SQRT_NEG);
-  }
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = std::sqrt(from);
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(from);
-    to = std::sqrt(from);
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename Policy, typename Type>
-inline Result_Relation
-sgn_float(const Type x) {
-  if (x > 0)
-    return VR_GT;
-  if (x < 0)
-    return VR_LT;
-  if (x == 0)
-    return VR_EQ;
-  return VR_EMPTY;
-}
-
-template <typename Policy1, typename Policy2, typename Type>
-inline Result_Relation
-cmp_float(const Type x, const Type y) {
-  if (x > y)
-    return VR_GT;
-  if (x < y)
-    return VR_LT;
-  if (x == y)
-    return VR_EQ;
-  return VR_EMPTY;
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_float_int_inexact(To& to, const From from, Rounding_Dir dir) {
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = from;
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    to = from;
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_float_int(To& to, const From from, Rounding_Dir dir) {
-  if (sizeof_to_bits(sizeof(From)) > Float<To>::Binary::MANTISSA_BITS)
-    return assign_float_int_inexact<To_Policy, From_Policy>(to, from, dir);
-  else
-    return assign_exact<To_Policy, From_Policy>(to, from, dir);
-}
-
-template <typename Policy, typename T>
-inline Result
-set_neg_overflow_float(T& to, Rounding_Dir dir) {
-  switch (round_dir(dir)) {
-  case ROUND_UP:
-    {
-      Float<T> f;
-      f.u.binary.set_max(true);
-      to = f.value();
-      return V_LT_INF;
-    }
-  case ROUND_DOWN: // Fall through.
-  case ROUND_IGNORE:
-    to = -HUGE_VAL;
-    return V_GT_MINUS_INFINITY;
-  default:
-    PPL_UNREACHABLE;
-    return V_GT_MINUS_INFINITY;
-  }
-}
-
-template <typename Policy, typename T>
-inline Result
-set_pos_overflow_float(T& to, Rounding_Dir dir) {
-  switch (round_dir(dir)) {
-  case ROUND_DOWN:
-    {
-      Float<T> f;
-      f.u.binary.set_max(false);
-      to = f.value();
-      return V_GT_SUP;
-    }
-  case ROUND_UP: // Fall through.
-  case ROUND_IGNORE:
-    to = HUGE_VAL;
-    return V_LT_PLUS_INFINITY;
-  default:
-    PPL_UNREACHABLE;
-    return V_LT_PLUS_INFINITY;
-  }
-}
-
-template <typename To_Policy, typename From_Policy, typename T>
-inline Result
-assign_float_mpz(T& to, const mpz_class& from, Rounding_Dir dir) {
-  int sign = sgn(from);
-  if (sign == 0) {
-    to = 0;
-    return V_EQ;
-  }
-  mpz_srcptr from_z = from.get_mpz_t();
-  size_t exponent = mpz_sizeinbase(from_z, 2) - 1;
-  if (exponent > size_t(Float<T>::Binary::EXPONENT_MAX)) {
-    if (sign < 0)
-      return set_neg_overflow_float<To_Policy>(to, dir);
-    else
-      return set_pos_overflow_float<To_Policy>(to, dir);
-  }
-  unsigned long zeroes = mpn_scan1(from_z->_mp_d, 0);
-  size_t meaningful_bits = exponent - zeroes;
-  mpz_t mantissa;
-  mpz_init(mantissa);
-  if (exponent > Float<T>::Binary::MANTISSA_BITS)
-    mpz_tdiv_q_2exp(mantissa,
-		    from_z,
-		    exponent - Float<T>::Binary::MANTISSA_BITS);
-  else
-    mpz_mul_2exp(mantissa, from_z, Float<T>::Binary::MANTISSA_BITS - exponent);
-  Float<T> f;
-  f.u.binary.build(sign < 0, mantissa, static_cast<long>(exponent));
-  mpz_clear(mantissa);
-  to = f.value();
-  if (meaningful_bits > Float<T>::Binary::MANTISSA_BITS) {
-    if (sign < 0)
-      return round_lt_float<To_Policy>(to, dir);
-    else
-      return round_gt_float<To_Policy>(to, dir);
-  }
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename T>
-inline Result
-assign_float_mpq(T& to, const mpq_class& from, Rounding_Dir dir) {
-  const mpz_class& numer = from.get_num();
-  const mpz_class& denom = from.get_den();
-  if (denom == 1)
-    return assign_float_mpz<To_Policy, From_Policy>(to, numer, dir);
-  mpz_srcptr numer_z = numer.get_mpz_t();
-  mpz_srcptr denom_z = denom.get_mpz_t();
-  int sign = sgn(numer);
-  long exponent = static_cast<long>(mpz_sizeinbase(numer_z, 2))
-    - static_cast<long>(mpz_sizeinbase(denom_z, 2));
-  if (exponent < Float<T>::Binary::EXPONENT_MIN_DENORM) {
-    to = 0;
-  inexact:
-    if (sign < 0)
-      return round_lt_float<To_Policy>(to, dir);
-    else
-      return round_gt_float<To_Policy>(to, dir);
-  }
-  if (exponent > Float<T>::Binary::EXPONENT_MAX + 1) {
-  overflow:
-    if (sign < 0)
-      return set_neg_overflow_float<To_Policy>(to, dir);
-    else
-      return set_pos_overflow_float<To_Policy>(to, dir);
-  }
-  unsigned int needed_bits = Float<T>::Binary::MANTISSA_BITS + 1;
-  if (exponent < Float<T>::Binary::EXPONENT_MIN) {
-    long diff = Float<T>::Binary::EXPONENT_MIN - exponent;
-    needed_bits -= static_cast<unsigned int>(diff);
-  }
-  mpz_t mantissa;
-  mpz_init(mantissa);
-  {
-    long shift = static_cast<long>(needed_bits) - exponent;
-    if (shift > 0) {
-      mpz_mul_2exp(mantissa, numer_z, static_cast<unsigned long>(shift));
-      numer_z = mantissa;
-    }
-    else if (shift < 0) {
-      shift = -shift;
-      mpz_mul_2exp(mantissa, denom_z, static_cast<unsigned long>(shift));
-      denom_z = mantissa;
-    }
-  }
-  mpz_t r;
-  mpz_init(r);
-  mpz_tdiv_qr(mantissa, r, numer_z, denom_z);
-  size_t bits = mpz_sizeinbase(mantissa, 2);
-  bool inexact = (mpz_sgn(r) != 0);
-  mpz_clear(r);
-  if (bits == needed_bits + 1) {
-    inexact = (inexact || mpz_odd_p(mantissa));
-    mpz_tdiv_q_2exp(mantissa, mantissa, 1);
-  }
-  else
-    --exponent;
-  if (exponent > Float<T>::Binary::EXPONENT_MAX) {
-    mpz_clear(mantissa);
-    goto overflow;
-  }
-  else if (exponent < Float<T>::Binary::EXPONENT_MIN - 1) {
-    // Denormalized.
-    exponent = Float<T>::Binary::EXPONENT_MIN - 1;
-  }
-  Float<T> f;
-  f.u.binary.build(sign < 0, mantissa, exponent);
-  mpz_clear(mantissa);
-  to = f.value();
-  if (inexact)
-    goto inexact;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
-inline Result
-add_mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_inf_mul_zero
-      && ((x == 0 && is_inf_float<From2_Policy>(y))
-          ||
-	  (y == 0 && is_inf_float<From1_Policy>(x)))) {
-    return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
-  }
-  // FIXME: missing check_inf_add_inf
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = multiply_add(x, y, to);
-  else if (fpu_inverse_rounding(dir)) {
-    to = multiply_add(-x, y, -to);
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(x);
-    limit_precision(y);
-    limit_precision(to);
-    to = multiply_add(x, y, to);
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy, typename Type>
-inline Result
-sub_mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_inf_mul_zero
-      && ((x == 0 && is_inf_float<From2_Policy>(y))
-          ||
-	  (y == 0 && is_inf_float<From1_Policy>(x)))) {
-    return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
-  }
-  // FIXME: missing check_inf_add_inf
-  prepare_inexact<To_Policy>(dir);
-  if (fpu_direct_rounding(dir))
-    to = multiply_add(x, -y, to);
-  else if (fpu_inverse_rounding(dir)) {
-    to = multiply_add(x, y, -to);
-    limit_precision(to);
-    to = -to;
-  }
-  else {
-    fpu_rounding_control_word_type old
-      = fpu_save_rounding_direction(round_fpu_dir(dir));
-    limit_precision(x);
-    limit_precision(y);
-    limit_precision(to);
-    to = multiply_add(x, -y, to);
-    limit_precision(to);
-    fpu_restore_rounding_direction(old);
-  }
-  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
-    return V_NAN;
-  return result_relation<To_Policy>(dir);
-}
-
-template <typename From>
-inline void
-assign_mpq_numeric_float(mpq_class& to, const From from) {
-  to = from;
-}
-
-template <>
-inline void
-assign_mpq_numeric_float(mpq_class& to, const long double from) {
-  to = 0;
-  if (from == 0)
-    return;
-  mpz_class& num = to.get_num();
-  mpz_class& den = to.get_den();
-  int exp;
-  long double n = frexpl(from, &exp);
-  bool neg = false;
-  if (n < 0) {
-    neg = true;
-    n = -n;
-  }
-  const long double mult = static_cast<long double>(ULONG_MAX) + 1;
-  const unsigned int bits = sizeof(unsigned long) * CHAR_BIT;
-  while (true) {
-    n *= mult;
-    exp -= bits;
-    long double intpart = floorl(n);
-    num += (unsigned long)intpart;
-    n -= intpart;
-    if (n == 0)
-      break;
-    num <<= bits;
-  }
-  if (exp < 0)
-    den <<= -exp;
-  else
-    num <<= exp;
-  if (neg)
-    to = -to;
-  to.canonicalize();
-}
-
-template <typename Policy, typename Type>
-inline Result
-output_float(std::ostream& os, const Type from, const Numeric_Format&,
-	     Rounding_Dir) {
-  if (from == 0)
-    os << "0";
-  else if (is_minf<Policy>(from))
-    os << "-inf";
-  else if (is_pinf<Policy>(from))
-    os << "+inf";
-  else if (is_nan<Policy>(from))
-    os << "nan";
-  else {
-    mpq_class q;
-    assign_mpq_numeric_float(q, from);
-    std::string s = float_mpq_to_string(q);
-    os << s;
-  }
-  return V_EQ;
-}
-
-#if PPL_SUPPORTED_FLOAT
-PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, float, float)
-#if PPL_SUPPORTED_DOUBLE
-PPL_SPECIALIZE_ASSIGN(assign_float_float, float, double)
-PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, double, float)
-#endif
-#if PPL_SUPPORTED_LONG_DOUBLE
-PPL_SPECIALIZE_ASSIGN(assign_float_float, float, long double)
-PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, long double, float)
-#endif
-#endif
-
-#if PPL_SUPPORTED_DOUBLE
-PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, double, double)
-#if PPL_SUPPORTED_LONG_DOUBLE
-PPL_SPECIALIZE_ASSIGN(assign_float_float, double, long double)
-PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, long double, double)
-#endif
-#endif
-
-#if PPL_SUPPORTED_LONG_DOUBLE
-PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, long double, long double)
-#endif
-
-#if PPL_SUPPORTED_FLOAT
-PPL_SPECIALIZE_CLASSIFY(classify_float, float)
-PPL_SPECIALIZE_IS_NAN(is_nan_float, float)
-PPL_SPECIALIZE_IS_MINF(is_minf_float, float)
-PPL_SPECIALIZE_IS_PINF(is_pinf_float, float)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_float, float)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed short)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed int)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed long long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned short)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned int)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned long long)
-PPL_SPECIALIZE_ASSIGN(assign_float_mpz, float, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_float_mpq, float, mpq_class)
-PPL_SPECIALIZE_COPY(copy_generic, float)
-PPL_SPECIALIZE_IS_INT(is_int_float, float)
-PPL_SPECIALIZE_FLOOR(floor_float, float, float)
-PPL_SPECIALIZE_CEIL(ceil_float, float, float)
-PPL_SPECIALIZE_TRUNC(trunc_float, float, float)
-PPL_SPECIALIZE_NEG(neg_float, float, float)
-PPL_SPECIALIZE_ABS(abs_float, float, float)
-PPL_SPECIALIZE_ADD(add_float, float, float, float)
-PPL_SPECIALIZE_SUB(sub_float, float, float, float)
-PPL_SPECIALIZE_MUL(mul_float, float, float, float)
-PPL_SPECIALIZE_DIV(div_float, float, float, float)
-PPL_SPECIALIZE_REM(rem_float, float, float, float)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_float, float, float)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_float, float, float)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_float, float, float)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_float, float, float)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_float, float, float)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, float, float)
-PPL_SPECIALIZE_SQRT(sqrt_float, float, float)
-PPL_SPECIALIZE_GCD(gcd_exact, float, float, float)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, float, float, float, float, float)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, float, float, float)
-PPL_SPECIALIZE_SGN(sgn_float, float)
-PPL_SPECIALIZE_CMP(cmp_float, float, float)
-PPL_SPECIALIZE_ADD_MUL(add_mul_float, float, float, float)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_float, float, float, float)
-PPL_SPECIALIZE_INPUT(input_generic, float)
-PPL_SPECIALIZE_OUTPUT(output_float, float)
-#endif
-
-#if PPL_SUPPORTED_DOUBLE
-PPL_SPECIALIZE_CLASSIFY(classify_float, double)
-PPL_SPECIALIZE_IS_NAN(is_nan_float, double)
-PPL_SPECIALIZE_IS_MINF(is_minf_float, double)
-PPL_SPECIALIZE_IS_PINF(is_pinf_float, double)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_float, double)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed short)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed int)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed long long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned short)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned int)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned long long)
-PPL_SPECIALIZE_ASSIGN(assign_float_mpz, double, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_float_mpq, double, mpq_class)
-PPL_SPECIALIZE_COPY(copy_generic, double)
-PPL_SPECIALIZE_IS_INT(is_int_float, double)
-PPL_SPECIALIZE_FLOOR(floor_float, double, double)
-PPL_SPECIALIZE_CEIL(ceil_float, double, double)
-PPL_SPECIALIZE_TRUNC(trunc_float, double, double)
-PPL_SPECIALIZE_NEG(neg_float, double, double)
-PPL_SPECIALIZE_ABS(abs_float, double, double)
-PPL_SPECIALIZE_ADD(add_float, double, double, double)
-PPL_SPECIALIZE_SUB(sub_float, double, double, double)
-PPL_SPECIALIZE_MUL(mul_float, double, double, double)
-PPL_SPECIALIZE_DIV(div_float, double, double, double)
-PPL_SPECIALIZE_REM(rem_float, double, double, double)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_float, double, double)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_float, double, double)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_float, double, double)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_float, double, double)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_float, double, double)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, double, double)
-PPL_SPECIALIZE_SQRT(sqrt_float, double, double)
-PPL_SPECIALIZE_GCD(gcd_exact, double, double, double)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, double, double, double, double, double)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, double, double, double)
-PPL_SPECIALIZE_SGN(sgn_float, double)
-PPL_SPECIALIZE_CMP(cmp_float, double, double)
-PPL_SPECIALIZE_ADD_MUL(add_mul_float, double, double, double)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_float, double, double, double)
-PPL_SPECIALIZE_INPUT(input_generic, double)
-PPL_SPECIALIZE_OUTPUT(output_float, double)
-#endif
-
-#if PPL_SUPPORTED_LONG_DOUBLE
-PPL_SPECIALIZE_CLASSIFY(classify_float, long double)
-PPL_SPECIALIZE_IS_NAN(is_nan_float, long double)
-PPL_SPECIALIZE_IS_MINF(is_minf_float, long double)
-PPL_SPECIALIZE_IS_PINF(is_pinf_float, long double)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_float, long double)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed short)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed int)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed long long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned char)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned short)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned int)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned long)
-PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned long long)
-PPL_SPECIALIZE_ASSIGN(assign_float_mpz, long double, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_float_mpq, long double, mpq_class)
-PPL_SPECIALIZE_COPY(copy_generic, long double)
-PPL_SPECIALIZE_IS_INT(is_int_float, long double)
-PPL_SPECIALIZE_FLOOR(floor_float, long double, long double)
-PPL_SPECIALIZE_CEIL(ceil_float, long double, long double)
-PPL_SPECIALIZE_TRUNC(trunc_float, long double, long double)
-PPL_SPECIALIZE_NEG(neg_float, long double, long double)
-PPL_SPECIALIZE_ABS(abs_float, long double, long double)
-PPL_SPECIALIZE_ADD(add_float, long double, long double, long double)
-PPL_SPECIALIZE_SUB(sub_float, long double, long double, long double)
-PPL_SPECIALIZE_MUL(mul_float, long double, long double, long double)
-PPL_SPECIALIZE_DIV(div_float, long double, long double, long double)
-PPL_SPECIALIZE_REM(rem_float, long double, long double, long double)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_float, long double, long double)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_float, long double, long double)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_float, long double, long double)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_float, long double, long double)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_float, long double, long double)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, long double, long double)
-PPL_SPECIALIZE_SQRT(sqrt_float, long double, long double)
-PPL_SPECIALIZE_GCD(gcd_exact, long double, long double, long double)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, long double, long double, long double,
-		  long double, long double)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, long double, long double, long double)
-PPL_SPECIALIZE_SGN(sgn_float, long double)
-PPL_SPECIALIZE_CMP(cmp_float, long double, long double)
-PPL_SPECIALIZE_ADD_MUL(add_mul_float, long double, long double, long double)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_float, long double, long double, long double)
-PPL_SPECIALIZE_INPUT(input_generic, long double)
-PPL_SPECIALIZE_OUTPUT(output_float, long double)
-#endif
-
-} // namespace Checked
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_checked_int_inlines_hh)
diff --git a/src/checked_float_inlines.hh b/src/checked_float_inlines.hh
new file mode 100644
index 0000000..89946d4
--- /dev/null
+++ b/src/checked_float_inlines.hh
@@ -0,0 +1,1234 @@
+/* Specialized "checked" functions for native floating-point numbers.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_float_inlines_hh
+#define PPL_checked_float_inlines_hh 1
+
+#include "compiler.hh"
+#include <cmath>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Checked {
+
+inline float
+multiply_add(float x, float y, float z) {
+#if PPL_HAVE_DECL_FMAF && defined(FP_FAST_FMAF) \
+  && !defined(__alpha) && !defined(__FreeBSD__)
+  return fmaf(x, y, z);
+#else
+  return x*y + z;
+#endif
+}
+
+inline double
+multiply_add(double x, double y, double z) {
+#if PPL_HAVE_DECL_FMA && defined(FP_FAST_FMA) \
+  && !defined(__alpha) && !defined(__FreeBSD__)
+  return fma(x, y, z);
+#else
+  return x*y + z;
+#endif
+}
+
+inline long double
+multiply_add(long double x, long double y, long double z) {
+#if PPL_HAVE_DECL_FMAL && defined(FP_FAST_FMAL) \
+  && !defined(__alpha) && !defined(__FreeBSD__)
+  return fmal(x, y, z);
+#else
+  return x*y + z;
+#endif
+}
+
+#if PPL_HAVE_DECL_RINTF
+inline float
+round_to_integer(float x) {
+  return rintf(x);
+}
+#endif
+
+inline double
+round_to_integer(double x) {
+  return rint(x);
+}
+
+#if PPL_HAVE_DECL_RINTL
+inline long double
+round_to_integer(long double x) {
+  return rintl(x);
+}
+#elif !PPL_CXX_PROVIDES_PROPER_LONG_DOUBLE
+// If proper long doubles are not provided, this is most likely
+// because long double and double are the same type: use rint().
+inline long double
+round_to_integer(long double x) {
+  return rint(x);
+}
+#elif defined(__i386__) && (defined(__GNUC__) || defined(__INTEL_COMPILER))
+// On Cygwin, we have proper long doubles but rintl() is not defined:
+// luckily, one machine instruction is enough to save the day.
+inline long double
+round_to_integer(long double x) {
+  long double i;
+  __asm__ ("frndint" : "=t" (i) : "0" (x));
+  return i;
+}
+#endif
+
+inline bool
+fpu_direct_rounding(Rounding_Dir dir) {
+  return round_direct(dir) || round_not_requested(dir);
+}
+
+inline bool
+fpu_inverse_rounding(Rounding_Dir dir) {
+  return round_inverse(dir);
+}
+
+// The FPU mode is "round down".
+//
+// The result of the rounded down multiplication is thus computed directly.
+//
+//   a = 0.3
+//   b = 0.1
+//   c_i = a * b = 0.03
+//   c = c_i = 0.0
+//
+// To obtain the result of the rounded up multiplication
+// we do -(-a * b).
+//
+//   a = 0.3
+//   b = 0.1
+//   c_i = -a * b = -0.03
+//
+// Here c_i should be forced to lose excess precision, otherwise the
+// FPU will truncate using the rounding mode in force, which is "round down".
+//
+//   c_i = -c_i = 0.03
+//   c = c_i = 0.0
+//
+// Wrong result: we should have obtained c = 0.1.
+
+inline void
+limit_precision(const float& v) {
+  PPL_CC_FLUSH(v);
+}
+
+inline void
+limit_precision(const double& v) {
+  PPL_CC_FLUSH(v);
+}
+
+inline void
+limit_precision(const long double&) {
+}
+
+template <typename Policy, typename T>
+inline Result
+classify_float(const T v, bool nan, bool inf, bool sign) {
+  Float<T> f(v);
+  if ((nan || sign) && CHECK_P(Policy::has_nan, f.u.binary.is_nan()))
+    return V_NAN;
+  if (inf) {
+    if (Policy::has_infinity) {
+      int sign_inf = f.u.binary.inf_sign();
+      if (sign_inf < 0)
+        return V_EQ_MINUS_INFINITY;
+      if (sign_inf > 0)
+        return V_EQ_PLUS_INFINITY;
+    }
+    else
+      PPL_ASSERT(f.u.binary.inf_sign() == 0);
+  }
+  if (sign) {
+    if (v < 0)
+      return V_LT;
+    if (v > 0)
+      return V_GT;
+    return V_EQ;
+  }
+  return V_LGE;
+}
+
+template <typename Policy, typename T>
+inline bool
+is_nan_float(const T v) {
+  Float<T> f(v);
+  return CHECK_P(Policy::has_nan, f.u.binary.is_nan());
+}
+
+template <typename Policy, typename T>
+inline bool
+is_inf_float(const T v) {
+  Float<T> f(v);
+  return CHECK_P(Policy::has_infinity, (f.u.binary.inf_sign() != 0));
+}
+template <typename Policy, typename T>
+inline bool
+is_minf_float(const T v) {
+  Float<T> f(v);
+  return CHECK_P(Policy::has_infinity, (f.u.binary.inf_sign() < 0));
+}
+
+template <typename Policy, typename T>
+inline bool
+is_pinf_float(const T v) {
+  Float<T> f(v);
+  return CHECK_P(Policy::has_infinity, (f.u.binary.inf_sign() > 0));
+}
+
+
+template <typename Policy, typename T>
+inline bool
+is_int_float(const T v) {
+  return round_to_integer(v) == v;
+}
+
+template <typename Policy, typename T>
+inline Result
+assign_special_float(T& v, Result_Class c, Rounding_Dir) {
+  PPL_ASSERT(c == VC_MINUS_INFINITY || c == VC_PLUS_INFINITY || c == VC_NAN);
+  switch (c) {
+  case VC_MINUS_INFINITY:
+    v = -HUGE_VAL;
+    return V_EQ_MINUS_INFINITY;
+  case VC_PLUS_INFINITY:
+    v = HUGE_VAL;
+    return V_EQ_PLUS_INFINITY;
+  case VC_NAN:
+    v = PPL_NAN;
+    return V_NAN;
+  default:
+    PPL_UNREACHABLE;
+    return V_NAN | V_UNREPRESENTABLE;
+  }
+}
+
+template <typename T>
+inline void
+pred_float(T& v) {
+  Float<T> f(v);
+  PPL_ASSERT(!f.u.binary.is_nan());
+  PPL_ASSERT(f.u.binary.inf_sign() >= 0);
+  if (f.u.binary.zero_sign() > 0) {
+    f.u.binary.negate();
+    f.u.binary.inc();
+  }
+  else if (f.u.binary.sign_bit()) {
+    f.u.binary.inc();
+  }
+  else {
+    f.u.binary.dec();
+  }
+  v = f.value();
+}
+
+template <typename T>
+inline void
+succ_float(T& v) {
+  Float<T> f(v);
+  PPL_ASSERT(!f.u.binary.is_nan());
+  PPL_ASSERT(f.u.binary.inf_sign() <= 0);
+  if (f.u.binary.zero_sign() < 0) {
+    f.u.binary.negate();
+    f.u.binary.inc();
+  }
+  else if (!f.u.binary.sign_bit()) {
+    f.u.binary.inc();
+  }
+  else {
+    f.u.binary.dec();
+  }
+  v = f.value();
+}
+
+template <typename Policy, typename To>
+inline Result
+round_lt_float(To& to, Rounding_Dir dir) {
+  if (round_down(dir)) {
+    pred_float(to);
+    return V_GT;
+  }
+  return V_LT;
+}
+
+template <typename Policy, typename To>
+inline Result
+round_gt_float(To& to, Rounding_Dir dir) {
+  if (round_up(dir)) {
+    succ_float(to);
+    return V_LT;
+  }
+  return V_GT;
+}
+
+
+template <typename Policy>
+inline void
+prepare_inexact(Rounding_Dir dir) {
+  if (Policy::fpu_check_inexact
+      && !round_not_needed(dir) && round_strict_relation(dir))
+    fpu_reset_inexact();
+}
+
+template <typename Policy>
+inline Result
+result_relation(Rounding_Dir dir) {
+  if (Policy::fpu_check_inexact
+      && !round_not_needed(dir) && round_strict_relation(dir)) {
+    switch (fpu_check_inexact()) {
+    case 0:
+      return V_EQ;
+    case -1:
+      goto unknown;
+    case 1:
+      break;
+    }
+    switch (round_dir(dir)) {
+    case ROUND_DOWN:
+      return V_GT;
+    case ROUND_UP:
+      return V_LT;
+    default:
+      return V_NE;
+    }
+  }
+  else {
+  unknown:
+    switch (round_dir(dir)) {
+    case ROUND_DOWN:
+      return V_GE;
+    case ROUND_UP:
+      return V_LE;
+    default:
+      return V_LGE;
+    }
+  }
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_float_float_exact(To& to, const From from, Rounding_Dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  to = from;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_float_float_inexact(To& to, const From from, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = from;
+  else if (fpu_inverse_rounding(dir)) {
+    From tmp = -from;
+    to = tmp;
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(from);
+    to = from;
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_float_float(To& to, const From from, Rounding_Dir dir) {
+  if (sizeof(From) > sizeof(To))
+    return assign_float_float_inexact<To_Policy, From_Policy>(to, from, dir);
+  else
+    return assign_float_float_exact<To_Policy, From_Policy>(to, from, dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+floor_float(Type& to, const Type from, Rounding_Dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (fpu_direct_rounding(ROUND_DOWN))
+    to = round_to_integer(from);
+  else if (fpu_inverse_rounding(ROUND_DOWN)) {
+    to = round_to_integer(-from);
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(ROUND_DOWN));
+    limit_precision(from);
+    to = round_to_integer(from);
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+ceil_float(Type& to, const Type from, Rounding_Dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (fpu_direct_rounding(ROUND_UP))
+    to = round_to_integer(from);
+  else if (fpu_inverse_rounding(ROUND_UP)) {
+    to = round_to_integer(-from);
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(ROUND_UP));
+    limit_precision(from);
+    to = round_to_integer(from);
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+trunc_float(Type& to, const Type from, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (from >= 0)
+    return floor<To_Policy, From_Policy>(to, from, dir);
+  else
+    return ceil<To_Policy, From_Policy>(to, from, dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+neg_float(Type& to, const Type from, Rounding_Dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  to = -from;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+add_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_inf_add_inf
+      && is_inf_float<From1_Policy>(x) && x == -y) {
+    return assign_nan<To_Policy>(to, V_INF_ADD_INF);
+  }
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = x + y;
+  else if (fpu_inverse_rounding(dir)) {
+    to = -x - y;
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(x);
+    limit_precision(y);
+    to = x + y;
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+sub_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_inf_sub_inf
+      && is_inf_float<From1_Policy>(x) && x == y) {
+    return assign_nan<To_Policy>(to, V_INF_SUB_INF);
+  }
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = x - y;
+  else if (fpu_inverse_rounding(dir)) {
+    to = y - x;
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(x);
+    limit_precision(y);
+    to = x - y;
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_inf_mul_zero
+      && ((x == 0 && is_inf_float<From2_Policy>(y))
+          ||
+          (y == 0 && is_inf_float<From1_Policy>(x)))) {
+    return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+  }
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = x * y;
+  else if (fpu_inverse_rounding(dir)) {
+    to = x * -y;
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(x);
+    limit_precision(y);
+    to = x * y;
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+div_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_inf_div_inf
+      && is_inf_float<From1_Policy>(x) && is_inf_float<From2_Policy>(y)) {
+    return assign_nan<To_Policy>(to, V_INF_DIV_INF);
+  }
+  if (To_Policy::check_div_zero && y == 0) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = x / y;
+  else if (fpu_inverse_rounding(dir)) {
+    to = x / -y;
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(x);
+    limit_precision(y);
+    to = x / y;
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+idiv_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  Type temp;
+  // The inexact check is useless
+  dir = round_dir(dir);
+  Result r = div<To_Policy, From1_Policy, From2_Policy>(temp, x, y, dir);
+  if (result_class(r) != VC_NORMAL) {
+    to = temp;
+    return r;
+  }
+  Result r1 = trunc<To_Policy, To_Policy>(to, temp, ROUND_NOT_NEEDED);
+  PPL_ASSERT(r1 == V_EQ);
+  if (r == V_EQ || to != temp)
+    return r1;
+  // FIXME: Prove that it is impossible to return a strict relation
+  return (dir == ROUND_UP) ? V_LE : V_GE;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+rem_float(Type& to, const Type x, const Type y, Rounding_Dir) {
+  if (To_Policy::check_inf_mod && is_inf_float<From1_Policy>(x)) {
+    return assign_nan<To_Policy>(to, V_INF_MOD);
+  }
+  if (To_Policy::check_div_zero && y == 0) {
+    return assign_nan<To_Policy>(to, V_MOD_ZERO);
+  }
+  to = std::fmod(x, y);
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return V_EQ;
+}
+
+struct Float_2exp {
+  const_bool_nodef(has_nan, false);
+  const_bool_nodef(has_infinity, false);
+};
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+add_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
+  return
+    add<To_Policy, From_Policy, Float_2exp>(to,
+                                            x,
+                                            Type(1ULL << exp),
+                                            dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+sub_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
+  return
+    sub<To_Policy, From_Policy, Float_2exp>(to,
+                                            x,
+                                            Type(1ULL << exp),
+                                            dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+mul_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
+  return
+    mul<To_Policy, From_Policy, Float_2exp>(to,
+                                            x,
+                                            Type(1ULL << exp),
+                                            dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+div_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
+  return
+    div<To_Policy, From_Policy, Float_2exp>(to,
+                                            x,
+                                            Type(1ULL << exp),
+                                            dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+smod_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (To_Policy::check_inf_mod && is_inf_float<From_Policy>(x)) {
+    return assign_nan<To_Policy>(to, V_INF_MOD);
+  }
+  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
+  Type m = 1ULL << exp;
+  rem_float<To_Policy, From_Policy, Float_2exp>(to, x, m, ROUND_IGNORE);
+  Type m2 = m / 2;
+  if (to < -m2)
+    return add_float<To_Policy, From_Policy, Float_2exp>(to, to, m, dir);
+  else if (to >= m2)
+    return sub_float<To_Policy, From_Policy, Float_2exp>(to, to, m, dir);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+umod_2exp_float(Type& to, const Type x, unsigned int exp, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(x))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (To_Policy::check_inf_mod && is_inf_float<From_Policy>(x)) {
+    return assign_nan<To_Policy>(to, V_INF_MOD);
+  }
+  PPL_ASSERT(exp < sizeof_to_bits(sizeof(unsigned long long)));
+  Type m = 1ULL << exp;
+  rem_float<To_Policy, From_Policy, Float_2exp>(to, x, m, ROUND_IGNORE);
+  if (to < 0)
+    return add_float<To_Policy, From_Policy, Float_2exp>(to, to, m, dir);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+abs_float(Type& to, const Type from, Rounding_Dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  to = std::abs(from);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+sqrt_float(Type& to, const Type from, Rounding_Dir dir) {
+  if (To_Policy::fpu_check_nan_result && is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  if (To_Policy::check_sqrt_neg && from < 0) {
+    return assign_nan<To_Policy>(to, V_SQRT_NEG);
+  }
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = std::sqrt(from);
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(from);
+    to = std::sqrt(from);
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename Policy, typename Type>
+inline Result_Relation
+sgn_float(const Type x) {
+  if (x > 0)
+    return VR_GT;
+  if (x < 0)
+    return VR_LT;
+  if (x == 0)
+    return VR_EQ;
+  return VR_EMPTY;
+}
+
+template <typename Policy1, typename Policy2, typename Type>
+inline Result_Relation
+cmp_float(const Type x, const Type y) {
+  if (x > y)
+    return VR_GT;
+  if (x < y)
+    return VR_LT;
+  if (x == y)
+    return VR_EQ;
+  return VR_EMPTY;
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_float_int_inexact(To& to, const From from, Rounding_Dir dir) {
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = from;
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    to = from;
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_float_int(To& to, const From from, Rounding_Dir dir) {
+  if (sizeof_to_bits(sizeof(From)) > Float<To>::Binary::MANTISSA_BITS)
+    return assign_float_int_inexact<To_Policy, From_Policy>(to, from, dir);
+  else
+    return assign_exact<To_Policy, From_Policy>(to, from, dir);
+}
+
+template <typename Policy, typename T>
+inline Result
+set_neg_overflow_float(T& to, Rounding_Dir dir) {
+  switch (round_dir(dir)) {
+  case ROUND_UP:
+    {
+      Float<T> f;
+      f.u.binary.set_max(true);
+      to = f.value();
+      return V_LT_INF;
+    }
+  case ROUND_DOWN: // Fall through.
+  case ROUND_IGNORE:
+    to = -HUGE_VAL;
+    return V_GT_MINUS_INFINITY;
+  default:
+    PPL_UNREACHABLE;
+    return V_GT_MINUS_INFINITY;
+  }
+}
+
+template <typename Policy, typename T>
+inline Result
+set_pos_overflow_float(T& to, Rounding_Dir dir) {
+  switch (round_dir(dir)) {
+  case ROUND_DOWN:
+    {
+      Float<T> f;
+      f.u.binary.set_max(false);
+      to = f.value();
+      return V_GT_SUP;
+    }
+  case ROUND_UP: // Fall through.
+  case ROUND_IGNORE:
+    to = HUGE_VAL;
+    return V_LT_PLUS_INFINITY;
+  default:
+    PPL_UNREACHABLE;
+    return V_LT_PLUS_INFINITY;
+  }
+}
+
+template <typename To_Policy, typename From_Policy, typename T>
+inline Result
+assign_float_mpz(T& to, const mpz_class& from, Rounding_Dir dir) {
+  int sign = sgn(from);
+  if (sign == 0) {
+    to = 0;
+    return V_EQ;
+  }
+  mpz_srcptr from_z = from.get_mpz_t();
+  size_t exponent = mpz_sizeinbase(from_z, 2) - 1;
+  if (exponent > size_t(Float<T>::Binary::EXPONENT_MAX)) {
+    if (sign < 0)
+      return set_neg_overflow_float<To_Policy>(to, dir);
+    else
+      return set_pos_overflow_float<To_Policy>(to, dir);
+  }
+  unsigned long zeroes = mpn_scan1(from_z->_mp_d, 0);
+  size_t meaningful_bits = exponent - zeroes;
+  mpz_t mantissa;
+  mpz_init(mantissa);
+  if (exponent > Float<T>::Binary::MANTISSA_BITS)
+    mpz_tdiv_q_2exp(mantissa,
+                    from_z,
+                    exponent - Float<T>::Binary::MANTISSA_BITS);
+  else
+    mpz_mul_2exp(mantissa, from_z, Float<T>::Binary::MANTISSA_BITS - exponent);
+  Float<T> f;
+  f.u.binary.build(sign < 0, mantissa, static_cast<long>(exponent));
+  mpz_clear(mantissa);
+  to = f.value();
+  if (meaningful_bits > Float<T>::Binary::MANTISSA_BITS) {
+    if (sign < 0)
+      return round_lt_float<To_Policy>(to, dir);
+    else
+      return round_gt_float<To_Policy>(to, dir);
+  }
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename T>
+inline Result
+assign_float_mpq(T& to, const mpq_class& from, Rounding_Dir dir) {
+  const mpz_class& numer = from.get_num();
+  const mpz_class& denom = from.get_den();
+  if (denom == 1)
+    return assign_float_mpz<To_Policy, From_Policy>(to, numer, dir);
+  mpz_srcptr numer_z = numer.get_mpz_t();
+  mpz_srcptr denom_z = denom.get_mpz_t();
+  int sign = sgn(numer);
+  long exponent = static_cast<long>(mpz_sizeinbase(numer_z, 2))
+    - static_cast<long>(mpz_sizeinbase(denom_z, 2));
+  if (exponent < Float<T>::Binary::EXPONENT_MIN_DENORM) {
+    to = 0;
+  inexact:
+    if (sign < 0)
+      return round_lt_float<To_Policy>(to, dir);
+    else
+      return round_gt_float<To_Policy>(to, dir);
+  }
+  if (exponent > Float<T>::Binary::EXPONENT_MAX + 1) {
+  overflow:
+    if (sign < 0)
+      return set_neg_overflow_float<To_Policy>(to, dir);
+    else
+      return set_pos_overflow_float<To_Policy>(to, dir);
+  }
+  unsigned int needed_bits = Float<T>::Binary::MANTISSA_BITS + 1;
+  if (exponent < Float<T>::Binary::EXPONENT_MIN) {
+    long diff = Float<T>::Binary::EXPONENT_MIN - exponent;
+    needed_bits -= static_cast<unsigned int>(diff);
+  }
+  mpz_t mantissa;
+  mpz_init(mantissa);
+  {
+    long shift = static_cast<long>(needed_bits) - exponent;
+    if (shift > 0) {
+      mpz_mul_2exp(mantissa, numer_z, static_cast<unsigned long>(shift));
+      numer_z = mantissa;
+    }
+    else if (shift < 0) {
+      shift = -shift;
+      mpz_mul_2exp(mantissa, denom_z, static_cast<unsigned long>(shift));
+      denom_z = mantissa;
+    }
+  }
+  mpz_t r;
+  mpz_init(r);
+  mpz_tdiv_qr(mantissa, r, numer_z, denom_z);
+  size_t bits = mpz_sizeinbase(mantissa, 2);
+  bool inexact = (mpz_sgn(r) != 0);
+  mpz_clear(r);
+  if (bits == needed_bits + 1) {
+    inexact = (inexact || mpz_odd_p(mantissa));
+    mpz_tdiv_q_2exp(mantissa, mantissa, 1);
+  }
+  else
+    --exponent;
+  if (exponent > Float<T>::Binary::EXPONENT_MAX) {
+    mpz_clear(mantissa);
+    goto overflow;
+  }
+  else if (exponent < Float<T>::Binary::EXPONENT_MIN - 1) {
+    // Denormalized.
+    exponent = Float<T>::Binary::EXPONENT_MIN - 1;
+  }
+  Float<T> f;
+  f.u.binary.build(sign < 0, mantissa, exponent);
+  mpz_clear(mantissa);
+  to = f.value();
+  if (inexact)
+    goto inexact;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+add_mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_inf_mul_zero
+      && ((x == 0 && is_inf_float<From2_Policy>(y))
+          ||
+          (y == 0 && is_inf_float<From1_Policy>(x)))) {
+    return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+  }
+  // FIXME: missing check_inf_add_inf
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = multiply_add(x, y, to);
+  else if (fpu_inverse_rounding(dir)) {
+    to = multiply_add(-x, y, -to);
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(x);
+    limit_precision(y);
+    limit_precision(to);
+    to = multiply_add(x, y, to);
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy, typename Type>
+inline Result
+sub_mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_inf_mul_zero
+      && ((x == 0 && is_inf_float<From2_Policy>(y))
+          ||
+          (y == 0 && is_inf_float<From1_Policy>(x)))) {
+    return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+  }
+  // FIXME: missing check_inf_add_inf
+  prepare_inexact<To_Policy>(dir);
+  if (fpu_direct_rounding(dir))
+    to = multiply_add(x, -y, to);
+  else if (fpu_inverse_rounding(dir)) {
+    to = multiply_add(x, y, -to);
+    limit_precision(to);
+    to = -to;
+  }
+  else {
+    fpu_rounding_control_word_type old
+      = fpu_save_rounding_direction(round_fpu_dir(dir));
+    limit_precision(x);
+    limit_precision(y);
+    limit_precision(to);
+    to = multiply_add(x, -y, to);
+    limit_precision(to);
+    fpu_restore_rounding_direction(old);
+  }
+  if (To_Policy::fpu_check_nan_result && is_nan<To_Policy>(to))
+    return V_NAN;
+  return result_relation<To_Policy>(dir);
+}
+
+template <typename From>
+inline void
+assign_mpq_numeric_float(mpq_class& to, const From from) {
+  to = from;
+}
+
+template <>
+inline void
+assign_mpq_numeric_float(mpq_class& to, const long double from) {
+  to = 0;
+  if (from == 0.0L)
+    return;
+  mpz_class& num = to.get_num();
+  mpz_class& den = to.get_den();
+  int exp;
+  long double n = std::frexp(from, &exp);
+  bool neg = false;
+  if (n < 0.0L) {
+    neg = true;
+    n = -n;
+  }
+  const long double mult = static_cast<long double>(ULONG_MAX) + 1.0L;
+  const unsigned int bits = sizeof(unsigned long) * CHAR_BIT;
+  while (true) {
+    n *= mult;
+    exp -= bits;
+    const long double intpart = std::floor(n);
+    num += static_cast<unsigned long>(intpart);
+    n -= intpart;
+    if (n == 0.0L)
+      break;
+    num <<= bits;
+  }
+  if (exp < 0)
+    den <<= -exp;
+  else
+    num <<= exp;
+  if (neg)
+    to = -to;
+  to.canonicalize();
+}
+
+template <typename Policy, typename Type>
+inline Result
+output_float(std::ostream& os, const Type from, const Numeric_Format&,
+             Rounding_Dir) {
+  if (from == 0)
+    os << "0";
+  else if (is_minf<Policy>(from))
+    os << "-inf";
+  else if (is_pinf<Policy>(from))
+    os << "+inf";
+  else if (is_nan<Policy>(from))
+    os << "nan";
+  else {
+    mpq_class q;
+    assign_mpq_numeric_float(q, from);
+    std::string s = float_mpq_to_string(q);
+    os << s;
+  }
+  return V_EQ;
+}
+
+#if PPL_SUPPORTED_FLOAT
+PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, float, float)
+#if PPL_SUPPORTED_DOUBLE
+PPL_SPECIALIZE_ASSIGN(assign_float_float, float, double)
+PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, double, float)
+#endif
+#if PPL_SUPPORTED_LONG_DOUBLE
+PPL_SPECIALIZE_ASSIGN(assign_float_float, float, long double)
+PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, long double, float)
+#endif
+#endif
+
+#if PPL_SUPPORTED_DOUBLE
+PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, double, double)
+#if PPL_SUPPORTED_LONG_DOUBLE
+PPL_SPECIALIZE_ASSIGN(assign_float_float, double, long double)
+PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, long double, double)
+#endif
+#endif
+
+#if PPL_SUPPORTED_LONG_DOUBLE
+PPL_SPECIALIZE_ASSIGN(assign_float_float_exact, long double, long double)
+#endif
+
+#if PPL_SUPPORTED_FLOAT
+PPL_SPECIALIZE_CLASSIFY(classify_float, float)
+PPL_SPECIALIZE_IS_NAN(is_nan_float, float)
+PPL_SPECIALIZE_IS_MINF(is_minf_float, float)
+PPL_SPECIALIZE_IS_PINF(is_pinf_float, float)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_float, float)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed short)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed int)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, signed long long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned short)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned int)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, float, unsigned long long)
+PPL_SPECIALIZE_ASSIGN(assign_float_mpz, float, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_float_mpq, float, mpq_class)
+PPL_SPECIALIZE_COPY(copy_generic, float)
+PPL_SPECIALIZE_IS_INT(is_int_float, float)
+PPL_SPECIALIZE_FLOOR(floor_float, float, float)
+PPL_SPECIALIZE_CEIL(ceil_float, float, float)
+PPL_SPECIALIZE_TRUNC(trunc_float, float, float)
+PPL_SPECIALIZE_NEG(neg_float, float, float)
+PPL_SPECIALIZE_ABS(abs_float, float, float)
+PPL_SPECIALIZE_ADD(add_float, float, float, float)
+PPL_SPECIALIZE_SUB(sub_float, float, float, float)
+PPL_SPECIALIZE_MUL(mul_float, float, float, float)
+PPL_SPECIALIZE_DIV(div_float, float, float, float)
+PPL_SPECIALIZE_REM(rem_float, float, float, float)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_float, float, float)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_float, float, float)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_float, float, float)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_float, float, float)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_float, float, float)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, float, float)
+PPL_SPECIALIZE_SQRT(sqrt_float, float, float)
+PPL_SPECIALIZE_GCD(gcd_exact, float, float, float)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, float, float, float, float, float)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, float, float, float)
+PPL_SPECIALIZE_SGN(sgn_float, float)
+PPL_SPECIALIZE_CMP(cmp_float, float, float)
+PPL_SPECIALIZE_ADD_MUL(add_mul_float, float, float, float)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_float, float, float, float)
+PPL_SPECIALIZE_INPUT(input_generic, float)
+PPL_SPECIALIZE_OUTPUT(output_float, float)
+#endif
+
+#if PPL_SUPPORTED_DOUBLE
+PPL_SPECIALIZE_CLASSIFY(classify_float, double)
+PPL_SPECIALIZE_IS_NAN(is_nan_float, double)
+PPL_SPECIALIZE_IS_MINF(is_minf_float, double)
+PPL_SPECIALIZE_IS_PINF(is_pinf_float, double)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_float, double)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed short)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed int)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, signed long long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned short)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned int)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, double, unsigned long long)
+PPL_SPECIALIZE_ASSIGN(assign_float_mpz, double, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_float_mpq, double, mpq_class)
+PPL_SPECIALIZE_COPY(copy_generic, double)
+PPL_SPECIALIZE_IS_INT(is_int_float, double)
+PPL_SPECIALIZE_FLOOR(floor_float, double, double)
+PPL_SPECIALIZE_CEIL(ceil_float, double, double)
+PPL_SPECIALIZE_TRUNC(trunc_float, double, double)
+PPL_SPECIALIZE_NEG(neg_float, double, double)
+PPL_SPECIALIZE_ABS(abs_float, double, double)
+PPL_SPECIALIZE_ADD(add_float, double, double, double)
+PPL_SPECIALIZE_SUB(sub_float, double, double, double)
+PPL_SPECIALIZE_MUL(mul_float, double, double, double)
+PPL_SPECIALIZE_DIV(div_float, double, double, double)
+PPL_SPECIALIZE_REM(rem_float, double, double, double)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_float, double, double)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_float, double, double)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_float, double, double)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_float, double, double)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_float, double, double)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, double, double)
+PPL_SPECIALIZE_SQRT(sqrt_float, double, double)
+PPL_SPECIALIZE_GCD(gcd_exact, double, double, double)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, double, double, double, double, double)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, double, double, double)
+PPL_SPECIALIZE_SGN(sgn_float, double)
+PPL_SPECIALIZE_CMP(cmp_float, double, double)
+PPL_SPECIALIZE_ADD_MUL(add_mul_float, double, double, double)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_float, double, double, double)
+PPL_SPECIALIZE_INPUT(input_generic, double)
+PPL_SPECIALIZE_OUTPUT(output_float, double)
+#endif
+
+#if PPL_SUPPORTED_LONG_DOUBLE
+PPL_SPECIALIZE_CLASSIFY(classify_float, long double)
+PPL_SPECIALIZE_IS_NAN(is_nan_float, long double)
+PPL_SPECIALIZE_IS_MINF(is_minf_float, long double)
+PPL_SPECIALIZE_IS_PINF(is_pinf_float, long double)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_float, long double)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed short)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed int)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, signed long long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned char)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned short)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned int)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned long)
+PPL_SPECIALIZE_ASSIGN(assign_float_int, long double, unsigned long long)
+PPL_SPECIALIZE_ASSIGN(assign_float_mpz, long double, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_float_mpq, long double, mpq_class)
+PPL_SPECIALIZE_COPY(copy_generic, long double)
+PPL_SPECIALIZE_IS_INT(is_int_float, long double)
+PPL_SPECIALIZE_FLOOR(floor_float, long double, long double)
+PPL_SPECIALIZE_CEIL(ceil_float, long double, long double)
+PPL_SPECIALIZE_TRUNC(trunc_float, long double, long double)
+PPL_SPECIALIZE_NEG(neg_float, long double, long double)
+PPL_SPECIALIZE_ABS(abs_float, long double, long double)
+PPL_SPECIALIZE_ADD(add_float, long double, long double, long double)
+PPL_SPECIALIZE_SUB(sub_float, long double, long double, long double)
+PPL_SPECIALIZE_MUL(mul_float, long double, long double, long double)
+PPL_SPECIALIZE_DIV(div_float, long double, long double, long double)
+PPL_SPECIALIZE_REM(rem_float, long double, long double, long double)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_float, long double, long double)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_float, long double, long double)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_float, long double, long double)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_float, long double, long double)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_float, long double, long double)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, long double, long double)
+PPL_SPECIALIZE_SQRT(sqrt_float, long double, long double)
+PPL_SPECIALIZE_GCD(gcd_exact, long double, long double, long double)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, long double, long double, long double,
+                  long double, long double)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, long double, long double, long double)
+PPL_SPECIALIZE_SGN(sgn_float, long double)
+PPL_SPECIALIZE_CMP(cmp_float, long double, long double)
+PPL_SPECIALIZE_ADD_MUL(add_mul_float, long double, long double, long double)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_float, long double, long double, long double)
+PPL_SPECIALIZE_INPUT(input_generic, long double)
+PPL_SPECIALIZE_OUTPUT(output_float, long double)
+#endif
+
+} // namespace Checked
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_checked_int_inlines_hh)
diff --git a/src/checked_inlines.hh b/src/checked_inlines.hh
new file mode 100644
index 0000000..4537c9b
--- /dev/null
+++ b/src/checked_inlines.hh
@@ -0,0 +1,658 @@
+/* Abstract checked arithmetic functions: fall-backs.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_inlines_hh
+#define PPL_checked_inlines_hh 1
+
+#include "globals_types.hh"
+#include "meta_programming.hh"
+#include "C_Integer.hh"
+#include "assert.hh"
+
+/*! \brief
+  Performs the test <CODE>a < b</CODE> avoiding the warning about the
+  comparison being always false due to limited range of data type.
+  FIXME: we have not found a working solution. The GCC option
+  -Wno-type-limits suppresses the warning
+*/
+#define PPL_LT_SILENT(a, b) ((a) < (b))
+#define PPL_GT_SILENT(a, b) ((a) > (b))
+
+namespace Parma_Polyhedra_Library {
+
+namespace Checked {
+
+template <typename T1, typename T2>
+struct Safe_Conversion : public False {
+};
+template <typename T>
+struct Safe_Conversion<T, T> : public True {
+};
+
+#define PPL_SAFE_CONVERSION(To, From)                        \
+  template <> struct Safe_Conversion<PPL_U(To), PPL_U(From)> \
+    : public True { }
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed short, char);
+#endif
+PPL_SAFE_CONVERSION(signed short, signed char);
+#if PPL_SIZEOF_CHAR < PPL_SIZEOF_SHORT
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed short, char);
+#endif
+PPL_SAFE_CONVERSION(signed short, unsigned char);
+#endif
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed int, char);
+#endif
+PPL_SAFE_CONVERSION(signed int, signed char);
+PPL_SAFE_CONVERSION(signed int, signed short);
+#if PPL_SIZEOF_CHAR < PPL_SIZEOF_INT
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed int, char);
+#endif
+PPL_SAFE_CONVERSION(signed int, unsigned char);
+#endif
+#if PPL_SIZEOF_SHORT < PPL_SIZEOF_INT
+PPL_SAFE_CONVERSION(signed int, unsigned short);
+#endif
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed long, char);
+#endif
+PPL_SAFE_CONVERSION(signed long, signed char);
+PPL_SAFE_CONVERSION(signed long, signed short);
+PPL_SAFE_CONVERSION(signed long, signed int);
+#if PPL_SIZEOF_CHAR < PPL_SIZEOF_LONG
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed long, char);
+#endif
+PPL_SAFE_CONVERSION(signed long, unsigned char);
+#endif
+#if PPL_SIZEOF_SHORT < PPL_SIZEOF_LONG
+PPL_SAFE_CONVERSION(signed long, unsigned short);
+#endif
+#if PPL_SIZEOF_INT < PPL_SIZEOF_LONG
+PPL_SAFE_CONVERSION(signed long, unsigned int);
+#endif
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed long long, char);
+#endif
+PPL_SAFE_CONVERSION(signed long long, signed char);
+PPL_SAFE_CONVERSION(signed long long, signed short);
+PPL_SAFE_CONVERSION(signed long long, signed int);
+PPL_SAFE_CONVERSION(signed long long, signed long);
+#if PPL_SIZEOF_CHAR < PPL_SIZEOF_LONG_LONG
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(signed long long, char);
+#endif
+PPL_SAFE_CONVERSION(signed long long, unsigned char);
+#endif
+#if PPL_SIZEOF_SHORT < PPL_SIZEOF_LONG_LONG
+PPL_SAFE_CONVERSION(signed long long, unsigned short);
+#endif
+#if PPL_SIZEOF_INT < PPL_SIZEOF_LONG_LONG
+PPL_SAFE_CONVERSION(signed long long, unsigned int);
+#endif
+#if PPL_SIZEOF_LONG < PPL_SIZEOF_LONG_LONG
+PPL_SAFE_CONVERSION(signed long long, unsigned long);
+#endif
+
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(unsigned short, char);
+#endif
+PPL_SAFE_CONVERSION(unsigned short, unsigned char);
+
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(unsigned int, char);
+#endif
+PPL_SAFE_CONVERSION(unsigned int, unsigned char);
+PPL_SAFE_CONVERSION(unsigned int, unsigned short);
+
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(unsigned long, char);
+#endif
+PPL_SAFE_CONVERSION(unsigned long, unsigned char);
+PPL_SAFE_CONVERSION(unsigned long, unsigned short);
+PPL_SAFE_CONVERSION(unsigned long, unsigned int);
+
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SAFE_CONVERSION(unsigned long long, char);
+#endif
+PPL_SAFE_CONVERSION(unsigned long long, unsigned char);
+PPL_SAFE_CONVERSION(unsigned long long, unsigned short);
+PPL_SAFE_CONVERSION(unsigned long long, unsigned int);
+PPL_SAFE_CONVERSION(unsigned long long, unsigned long);
+
+
+#if PPL_SIZEOF_CHAR <= PPL_SIZEOF_FLOAT - 2
+PPL_SAFE_CONVERSION(float, char);
+PPL_SAFE_CONVERSION(float, signed char);
+PPL_SAFE_CONVERSION(float, unsigned char);
+#endif
+#if PPL_SIZEOF_SHORT <= PPL_SIZEOF_FLOAT - 2
+PPL_SAFE_CONVERSION(float, signed short);
+PPL_SAFE_CONVERSION(float, unsigned short);
+#endif
+#if PPL_SIZEOF_INT <= PPL_SIZEOF_FLOAT - 2
+PPL_SAFE_CONVERSION(float, signed int);
+PPL_SAFE_CONVERSION(float, unsigned int);
+#endif
+#if PPL_SIZEOF_LONG <= PPL_SIZEOF_FLOAT - 2
+PPL_SAFE_CONVERSION(float, signed long);
+PPL_SAFE_CONVERSION(float, unsigned long);
+#endif
+#if PPL_SIZEOF_LONG_LONG <= PPL_SIZEOF_FLOAT - 2
+PPL_SAFE_CONVERSION(float, signed long long);
+PPL_SAFE_CONVERSION(float, unsigned long long);
+#endif
+
+#if PPL_SIZEOF_CHAR <= PPL_SIZEOF_DOUBLE - 4
+PPL_SAFE_CONVERSION(double, char);
+PPL_SAFE_CONVERSION(double, signed char);
+PPL_SAFE_CONVERSION(double, unsigned char);
+#endif
+#if PPL_SIZEOF_SHORT <= PPL_SIZEOF_DOUBLE - 4
+PPL_SAFE_CONVERSION(double, signed short);
+PPL_SAFE_CONVERSION(double, unsigned short);
+#endif
+#if PPL_SIZEOF_INT <= PPL_SIZEOF_DOUBLE - 4
+PPL_SAFE_CONVERSION(double, signed int);
+PPL_SAFE_CONVERSION(double, unsigned int);
+#endif
+#if PPL_SIZEOF_LONG <= PPL_SIZEOF_DOUBLE - 4
+PPL_SAFE_CONVERSION(double, signed long);
+PPL_SAFE_CONVERSION(double, unsigned long);
+#endif
+#if PPL_SIZEOF_LONG_LONG <= PPL_SIZEOF_DOUBLE - 4
+PPL_SAFE_CONVERSION(double, signed long long);
+PPL_SAFE_CONVERSION(double, unsigned long long);
+#endif
+PPL_SAFE_CONVERSION(double, float);
+
+#if PPL_SIZEOF_CHAR <= PPL_SIZEOF_LONG_DOUBLE - 4
+PPL_SAFE_CONVERSION(long double, char);
+PPL_SAFE_CONVERSION(long double, signed char);
+PPL_SAFE_CONVERSION(long double, unsigned char);
+#endif
+#if PPL_SIZEOF_SHORT <= PPL_SIZEOF_LONG_DOUBLE - 4
+PPL_SAFE_CONVERSION(long double, signed short);
+PPL_SAFE_CONVERSION(long double, unsigned short);
+#endif
+#if PPL_SIZEOF_INT <= PPL_SIZEOF_LONG_DOUBLE - 4
+PPL_SAFE_CONVERSION(long double, signed int);
+PPL_SAFE_CONVERSION(long double, unsigned int);
+#endif
+#if PPL_SIZEOF_LONG <= PPL_SIZEOF_LONG_DOUBLE - 4
+PPL_SAFE_CONVERSION(long double, signed long);
+PPL_SAFE_CONVERSION(long double, unsigned long);
+#endif
+#if PPL_SIZEOF_LONG_LONG <= PPL_SIZEOF_LONG_DOUBLE - 4
+PPL_SAFE_CONVERSION(long double, signed long long);
+PPL_SAFE_CONVERSION(long double, unsigned long long);
+#endif
+PPL_SAFE_CONVERSION(long double, float);
+PPL_SAFE_CONVERSION(long double, double);
+
+PPL_SAFE_CONVERSION(mpz_class, char);
+PPL_SAFE_CONVERSION(mpz_class, signed char);
+PPL_SAFE_CONVERSION(mpz_class, signed short);
+PPL_SAFE_CONVERSION(mpz_class, signed int);
+PPL_SAFE_CONVERSION(mpz_class, signed long);
+// GMP's API does not support signed long long.
+PPL_SAFE_CONVERSION(mpz_class, unsigned char);
+PPL_SAFE_CONVERSION(mpz_class, unsigned short);
+PPL_SAFE_CONVERSION(mpz_class, unsigned int);
+PPL_SAFE_CONVERSION(mpz_class, unsigned long);
+// GMP's API does not support unsigned long long.
+
+PPL_SAFE_CONVERSION(mpq_class, char);
+PPL_SAFE_CONVERSION(mpq_class, signed char);
+PPL_SAFE_CONVERSION(mpq_class, signed short);
+PPL_SAFE_CONVERSION(mpq_class, signed int);
+PPL_SAFE_CONVERSION(mpq_class, signed long);
+// GMP's API does not support signed long long.
+PPL_SAFE_CONVERSION(mpq_class, unsigned char);
+PPL_SAFE_CONVERSION(mpq_class, unsigned short);
+PPL_SAFE_CONVERSION(mpq_class, unsigned int);
+PPL_SAFE_CONVERSION(mpq_class, unsigned long);
+// GMP's API does not support unsigned long long.
+PPL_SAFE_CONVERSION(mpq_class, float);
+PPL_SAFE_CONVERSION(mpq_class, double);
+// GMP's API does not support long double.
+
+#undef PPL_SAFE_CONVERSION
+
+template <typename Policy, typename Type>
+struct PPL_FUNCTION_CLASS(construct)<Policy, Policy, Type, Type> {
+  static inline Result function(Type& to, const Type& from, Rounding_Dir) {
+    new (&to) Type(from);
+    return V_EQ;
+  }
+};
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+struct PPL_FUNCTION_CLASS(construct) {
+  static inline Result function(To& to, const From& from, Rounding_Dir dir) {
+    new (&to) To();
+    return assign<To_Policy, From_Policy>(to, from, dir);
+  }
+};
+
+template <typename To_Policy, typename To>
+struct PPL_FUNCTION_CLASS(construct_special) {
+  static inline Result function(To& to, Result_Class r, Rounding_Dir dir) {
+    new (&to) To();
+    return assign_special<To_Policy>(to, r, dir);
+  }
+};
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_exact(To& to, const From& from, Rounding_Dir) {
+  to = from;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline typename Enable_If<Is_Same<To_Policy, From_Policy>::value, void>::type
+copy_generic(Type& to, const Type& from) {
+  to = from;
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+abs_generic(To& to, const From& from, Rounding_Dir dir) {
+  if (from < 0)
+    return neg<To_Policy, From_Policy>(to, from, dir);
+  else
+    return assign<To_Policy, From_Policy>(to, from, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From>
+inline void
+gcd_exact_no_abs(To& to, const From& x, const From& y) {
+  To w_x = x;
+  To w_y = y;
+  To remainder;
+  while (w_y != 0) {
+    // The following is derived from the assumption that w_x % w_y
+    // is always representable. This is true for both native integers
+    // and IEC 559 floating point numbers.
+    rem<To_Policy, From1_Policy, From2_Policy>(remainder, w_x, w_y,
+                                               ROUND_NOT_NEEDED);
+    w_x = w_y;
+    w_y = remainder;
+  }
+  to = w_x;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  gcd_exact_no_abs<To_Policy, From1_Policy, From2_Policy>(to, x, y);
+  return abs<To_Policy, To_Policy>(to, to, dir);
+}
+
+template <typename To1_Policy, typename To2_Policy, typename To3_Policy,
+          typename From1_Policy, typename From2_Policy,
+          typename To1, typename To2, typename To3,
+          typename From1, typename From2>
+inline Result
+gcdext_exact(To1& to, To2& s, To3& t, const From1& x, const From2& y,
+             Rounding_Dir dir) {
+  // In case this becomes a bottleneck, we may consider using the
+  // Stehle'-Zimmermann algorithm (see R. Crandall and C. Pomerance,
+  // Prime Numbers - A Computational Perspective, Second Edition,
+  // Springer, 2005).
+  if (y == 0) {
+    if (x == 0) {
+      s = 0;
+      t = 1;
+      return V_EQ;
+    }
+    else {
+      if (x < 0)
+        s = -1;
+      else
+        s = 1;
+      t = 0;
+      return abs<To1_Policy, From1_Policy>(to, x, dir);
+    }
+  }
+
+  s = 1;
+  t = 0;
+  bool negative_x = x < 0;
+  bool negative_y = y < 0;
+
+  Result r;
+  r = abs<To1_Policy, From1_Policy>(to, x, dir);
+  if (r != V_EQ)
+    return r;
+
+  From2 a_y;
+  r = abs<To1_Policy, From2_Policy>(a_y, y, dir);
+  if (r != V_EQ)
+    return r;
+
+  // If PPL_MATCH_GMP_GCDEXT is defined then s is favored when the absolute
+  // values of the given numbers are equal.  For instance if x and y
+  // are both 5 then s will be 1 and t will be 0, instead of the other
+  // way round.  This is to match the behavior of GMP.
+#define PPL_MATCH_GMP_GCDEXT 1
+#ifdef PPL_MATCH_GMP_GCDEXT
+  if (to == a_y)
+    goto sign_check;
+#endif
+
+  {
+    To2 v1 = 0;
+    To3 v2 = 1;
+    To1 v3 = static_cast<To1>(a_y);
+    while (true) {
+      To1 q = to / v3;
+      // Remainder, next candidate GCD.
+      To1 t3 = to - q*v3;
+      To2 t1 = s - static_cast<To2>(q)*v1;
+      To3 t2 = t - static_cast<To3>(q)*v2;
+      s = v1;
+      t = v2;
+      to = v3;
+      if (t3 == 0)
+        break;
+      v1 = t1;
+      v2 = t2;
+      v3 = t3;
+    }
+  }
+
+#ifdef PPL_MATCH_GMP_GCDEXT
+ sign_check:
+#endif
+  if (negative_x) {
+    r = neg<To2_Policy, To2_Policy>(s, s, dir);
+    if (r != V_EQ)
+      return r;
+  }
+  if (negative_y)
+    return neg<To3_Policy, To3_Policy>(t, t, dir);
+  return V_EQ;
+#undef PPL_MATCH_GMP_GCDEXT
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename To, typename From1, typename From2>
+inline Result
+lcm_gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
+  if (x == 0 || y == 0) {
+    to = 0;
+    return V_EQ;
+  }
+  To a_x;
+  To a_y;
+  Result r;
+  r = abs<From1_Policy, From1_Policy>(a_x, x, dir);
+  if (r != V_EQ)
+    return r;
+  r = abs<From2_Policy, From2_Policy>(a_y, y, dir);
+  if (r != V_EQ)
+    return r;
+  To gcd;
+  gcd_exact_no_abs<To_Policy, From1_Policy, From2_Policy>(gcd, a_x, a_y);
+  // The following is derived from the assumption that a_x / gcd(a_x, a_y)
+  // is always representable. This is true for both native integers
+  // and IEC 559 floating point numbers.
+  div<To_Policy, From1_Policy, To_Policy>(to, a_x, gcd, ROUND_NOT_NEEDED);
+  return mul<To_Policy, To_Policy, From2_Policy>(to, to, a_y, dir);
+}
+
+template <typename Policy, typename Type>
+inline Result_Relation
+sgn_generic(const Type& x) {
+  if (x > 0)
+    return VR_GT;
+  if (x == 0)
+    return VR_EQ;
+  return VR_LT;
+}
+
+template <typename T1, typename T2, typename Enable = void>
+struct Safe_Int_Comparison : public False {
+};
+
+template <typename T1, typename T2>
+struct Safe_Int_Comparison<T1, T2, typename Enable_If<(C_Integer<T1>::value && C_Integer<T2>::value)>::type>
+  : public Bool<(C_Integer<T1>::is_signed
+                 ? (C_Integer<T2>::is_signed
+                    || sizeof(T2) < sizeof(T1)
+                    || sizeof(T2) < sizeof(int))
+                 : (!C_Integer<T2>::is_signed
+                    || sizeof(T1) < sizeof(T2)
+                    || sizeof(T1) < sizeof(int)))> {
+};
+
+
+template <typename T1, typename T2>
+inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
+                           || Safe_Conversion<T1, T2>::value
+                           || Safe_Conversion<T2, T1>::value), bool>::type
+lt(const T1& x, const T2& y) {
+  return x < y;
+}
+template <typename T1, typename T2>
+inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
+                           || Safe_Conversion<T1, T2>::value
+                           || Safe_Conversion<T2, T1>::value), bool>::type
+le(const T1& x, const T2& y) {
+  return x <= y;
+}
+template <typename T1, typename T2>
+inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
+                           || Safe_Conversion<T1, T2>::value
+                           || Safe_Conversion<T2, T1>::value), bool>::type
+eq(const T1& x, const T2& y) {
+  return x == y;
+}
+
+template <typename S, typename U>
+inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
+lt(const S& x, const U& y) {
+  return x < 0 || static_cast<typename C_Integer<S>::other_type>(x) < y;
+}
+
+template <typename U, typename S>
+inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
+lt(const U& x, const S& y) {
+  return y >= 0 && x < static_cast<typename C_Integer<S>::other_type>(y);
+}
+
+template <typename S, typename U>
+inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
+le(const S& x, const U& y) {
+  return x < 0 || static_cast<typename C_Integer<S>::other_type>(x) <= y;
+}
+
+template <typename U, typename S>
+inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
+le(const U& x, const S& y) {
+  return y >= 0 && x <= static_cast<typename C_Integer<S>::other_type>(y);
+}
+
+template <typename S, typename U>
+inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
+eq(const S& x, const U& y) {
+  return x >= 0 && static_cast<typename C_Integer<S>::other_type>(x) == y;
+}
+
+template <typename U, typename S>
+inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
+eq(const U& x, const S& y) {
+  return y >= 0 && x == static_cast<typename C_Integer<S>::other_type>(y);
+}
+
+template <typename T1, typename T2>
+inline typename Enable_If<(!Safe_Conversion<T1, T2>::value
+                           && !Safe_Conversion<T2, T1>::value
+                           && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
+eq(const T1& x, const T2& y) {
+  PPL_DIRTY_TEMP(T1, tmp);
+  Result r = assign_r(tmp, y, ROUND_CHECK);
+  // FIXME: We can do this also without fpu inexact check using a
+  // conversion back and forth and then testing equality.  We should
+  // code this in checked_float_inlines.hh, probably it's faster also
+  // if fpu supports inexact check.
+  PPL_ASSERT(r != V_LE && r != V_GE && r != V_LGE);
+  return r == V_EQ && x == tmp;
+}
+
+template <typename T1, typename T2>
+inline typename Enable_If<(!Safe_Conversion<T1, T2>::value
+                           && !Safe_Conversion<T2, T1>::value
+                           && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
+lt(const T1& x, const T2& y) {
+  PPL_DIRTY_TEMP(T1, tmp);
+  Result r = assign_r(tmp, y, ROUND_UP);
+  if (!result_representable(r))
+    return true;
+  switch (result_relation(r)) {
+  case VR_EQ:
+  case VR_LT:
+  case VR_LE:
+    return x < tmp;
+  default:
+    return false;
+  }
+}
+
+template <typename T1, typename T2>
+inline typename
+Enable_If<(!Safe_Conversion<T1, T2>::value
+           && !Safe_Conversion<T2, T1>::value
+           && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
+le(const T1& x, const T2& y) {
+  PPL_DIRTY_TEMP(T1, tmp);
+  Result r = assign_r(tmp, y, (ROUND_UP | ROUND_STRICT_RELATION));
+  // FIXME: We can do this also without fpu inexact check using a
+  // conversion back and forth and then testing equality.  We should
+  // code this in checked_float_inlines.hh, probably it's faster also
+  // if fpu supports inexact check.
+  PPL_ASSERT(r != V_LE && r != V_GE && r != V_LGE);
+  if (!result_representable(r))
+    return true;
+  switch (result_relation(r)) {
+  case VR_EQ:
+    return x <= tmp;
+  case VR_LT:
+    return x < tmp;
+  case VR_LE:
+  case VR_GE:
+  case VR_LGE:
+    // See comment above.
+    PPL_UNREACHABLE;
+    return false;
+  default:
+    return false;
+  }
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+lt_p(const Type1& x, const Type2& y) {
+  return lt(x, y);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+le_p(const Type1& x, const Type2& y) {
+  return le(x, y);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline bool
+eq_p(const Type1& x, const Type2& y) {
+  return eq(x, y);
+}
+
+template <typename Policy1, typename Policy2,
+          typename Type1, typename Type2>
+inline Result_Relation
+cmp_generic(const Type1& x, const Type2& y) {
+  if (lt(y, x))
+    return VR_GT;
+  if (lt(x, y))
+    return VR_LT;
+  return VR_EQ;
+}
+
+template <typename Policy, typename Type>
+inline Result
+assign_nan(Type& to, Result r) {
+  assign_special<Policy>(to, VC_NAN, ROUND_IGNORE);
+  return r;
+}
+
+template <typename Policy, typename Type>
+inline Result
+input_generic(Type& to, std::istream& is, Rounding_Dir dir) {
+  PPL_DIRTY_TEMP(mpq_class, q);
+  Result r = input_mpq(q, is);
+  Result_Class c = result_class(r);
+  switch (c) {
+  case VC_MINUS_INFINITY:
+  case VC_PLUS_INFINITY:
+    return assign_special<Policy>(to, c, dir);
+  case VC_NAN:
+    return assign_nan<Policy>(to, r);
+  default:
+    break;
+  }
+  PPL_ASSERT(r == V_EQ);
+  return assign<Policy, void>(to, q, dir);
+}
+
+} // namespace Checked
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_checked_inlines_hh)
diff --git a/src/checked_int.inlines.hh b/src/checked_int.inlines.hh
deleted file mode 100644
index 5fd4e0c..0000000
--- a/src/checked_int.inlines.hh
+++ /dev/null
@@ -1,1957 +0,0 @@
-/* Specialized "checked" functions for native integer numbers.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_int_inlines_hh
-#define PPL_checked_int_inlines_hh 1
-
-#include "C_Integer.hh"
-#include <cerrno>
-#include <cstdlib>
-#include <climits>
-#include <string>
-
-#if !PPL_HAVE_DECL_STRTOLL
-signed long long
-strtoll(const char* nptr, char** endptr, int base);
-#endif
-
-#if !PPL_HAVE_DECL_STRTOULL
-unsigned long long
-strtoull(const char* nptr, char** endptr, int base);
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-namespace Checked {
-
-#ifndef PPL_HAVE_INT_FAST16_T
-typedef int16_t int_fast16_t;
-#endif
-
-#ifndef PPL_HAVE_INT_FAST32_T
-typedef int32_t int_fast32_t;
-#endif
-
-#ifndef PPL_HAVE_INT_FAST64_T
-typedef int64_t int_fast64_t;
-#endif
-
-#ifndef PPL_HAVE_UINT_FAST16_T
-typedef uint16_t uint_fast16_t;
-#endif
-
-#ifndef PPL_HAVE_UINT_FAST32_T
-typedef uint32_t uint_fast32_t;
-#endif
-
-#ifndef PPL_HAVE_UINT_FAST64_T
-typedef uint64_t uint_fast64_t;
-#endif
-
-template <typename Policy, typename Type>
-struct Extended_Int {
-  static const Type plus_infinity = C_Integer<Type>::max;
-  static const Type minus_infinity = ((C_Integer<Type>::min >= 0)
-				      ? (C_Integer<Type>::max - 1)
-				      : C_Integer<Type>::min);
-  static const Type not_a_number
-  = ((C_Integer<Type>::min >= 0)
-     ? (C_Integer<Type>::max - 2 * (Policy::has_infinity ? 1 : 0))
-     : (C_Integer<Type>::min + (Policy::has_infinity ? 1 : 0)));
-  static const Type min
-  = (C_Integer<Type>::min
-     + ((C_Integer<Type>::min >= 0)
-        ? 0
-        : ((Policy::has_infinity ? 1 : 0) + (Policy::has_nan ? 1 : 0))));
-  static const Type max
-  = (C_Integer<Type>::max
-     - ((C_Integer<Type>::min >= 0)
-        ? (2 * (Policy::has_infinity ? 1 : 0) + (Policy::has_nan ? 1 : 0))
-        : (Policy::has_infinity ? 1 : 0)));
-};
-
-template <typename Policy, typename To>
-inline Result
-set_neg_overflow_int(To& to, Rounding_Dir dir) {
-  if (round_up(dir)) {
-    to = Extended_Int<Policy, To>::min;
-    return V_LT_INF;
-  }
-  else {
-    if (Policy::has_infinity) {
-      to = Extended_Int<Policy, To>::minus_infinity;
-      return V_GT_MINUS_INFINITY;
-    }
-    return V_GT_MINUS_INFINITY | V_UNREPRESENTABLE;
-  }
-}
-
-template <typename Policy, typename To>
-inline Result
-set_pos_overflow_int(To& to, Rounding_Dir dir) {
-  if (round_down(dir)) {
-    to = Extended_Int<Policy, To>::max;
-    return V_GT_SUP;
-  }
-  else {
-    if (Policy::has_infinity) {
-      to = Extended_Int<Policy, To>::plus_infinity;
-      return V_LT_PLUS_INFINITY;
-    }
-    return V_LT_PLUS_INFINITY | V_UNREPRESENTABLE;
-  }
-}
-
-template <typename Policy, typename To>
-inline Result
-round_lt_int_no_overflow(To& to, Rounding_Dir dir) {
-  if (round_down(dir)) {
-    --to;
-    return V_GT;
-  }
-  return V_LT;
-}
-
-template <typename Policy, typename To>
-inline Result
-round_gt_int_no_overflow(To& to, Rounding_Dir dir) {
-  if (round_up(dir)) {
-    ++to;
-    return V_LT;
-  }
-  return V_GT;
-}
-
-template <typename Policy, typename To>
-inline Result
-round_lt_int(To& to, Rounding_Dir dir) {
-  if (round_down(dir)) {
-    if (to == Extended_Int<Policy, To>::min) {
-      if (Policy::has_infinity) {
-	to = Extended_Int<Policy, To>::minus_infinity;
-	return V_GT_MINUS_INFINITY;
-      }
-      return V_GT_MINUS_INFINITY | V_UNREPRESENTABLE;
-    }
-    else {
-      --to;
-      return V_GT;
-    }
-  }
-  return V_LT;
-}
-
-template <typename Policy, typename To>
-inline Result
-round_gt_int(To& to, Rounding_Dir dir) {
-  if (round_up(dir)) {
-    if (to == Extended_Int<Policy, To>::max) {
-      if (Policy::has_infinity) {
-	to = Extended_Int<Policy, To>::plus_infinity;
-	return V_LT_PLUS_INFINITY;
-      }
-      return V_LT_PLUS_INFINITY | V_UNREPRESENTABLE;
-    }
-    else {
-      ++to;
-      return V_LT;
-    }
-  }
-  return V_GT;
-}
-
-PPL_SPECIALIZE_COPY(copy_generic, char)
-PPL_SPECIALIZE_COPY(copy_generic, signed char)
-PPL_SPECIALIZE_COPY(copy_generic, signed short)
-PPL_SPECIALIZE_COPY(copy_generic, signed int)
-PPL_SPECIALIZE_COPY(copy_generic, signed long)
-PPL_SPECIALIZE_COPY(copy_generic, signed long long)
-PPL_SPECIALIZE_COPY(copy_generic, unsigned char)
-PPL_SPECIALIZE_COPY(copy_generic, unsigned short)
-PPL_SPECIALIZE_COPY(copy_generic, unsigned int)
-PPL_SPECIALIZE_COPY(copy_generic, unsigned long)
-PPL_SPECIALIZE_COPY(copy_generic, unsigned long long)
-
-template <typename Policy, typename Type>
-inline Result
-classify_int(const Type v, bool nan, bool inf, bool sign) {
-  if (Policy::has_nan
-      && (nan || sign)
-      && v == Extended_Int<Policy, Type>::not_a_number)
-    return V_NAN;
-  if (!inf && !sign)
-    return V_LGE;
-  if (Policy::has_infinity) {
-    if (v == Extended_Int<Policy, Type>::minus_infinity)
-      return inf ? V_EQ_MINUS_INFINITY : V_LT;
-    if (v == Extended_Int<Policy, Type>::plus_infinity)
-      return inf ? V_EQ_PLUS_INFINITY : V_GT;
-  }
-  if (sign) {
-    if (v < 0)
-      return V_LT;
-    if (v > 0)
-      return V_GT;
-    return V_EQ;
-  }
-  return V_LGE;
-}
-
-PPL_SPECIALIZE_CLASSIFY(classify_int, char)
-PPL_SPECIALIZE_CLASSIFY(classify_int, signed char)
-PPL_SPECIALIZE_CLASSIFY(classify_int, signed short)
-PPL_SPECIALIZE_CLASSIFY(classify_int, signed int)
-PPL_SPECIALIZE_CLASSIFY(classify_int, signed long)
-PPL_SPECIALIZE_CLASSIFY(classify_int, signed long long)
-PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned char)
-PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned short)
-PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned int)
-PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned long)
-PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned long long)
-
-template <typename Policy, typename Type>
-inline bool
-is_nan_int(const Type v) {
-  return Policy::has_nan && v == Extended_Int<Policy, Type>::not_a_number;
-}
-
-PPL_SPECIALIZE_IS_NAN(is_nan_int, char)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, signed char)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, signed short)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, signed int)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, signed long)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, signed long long)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned char)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned short)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned int)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned long)
-PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned long long)
-
-template <typename Policy, typename Type>
-inline bool
-is_minf_int(const Type v) {
-  return Policy::has_infinity
-    && v == Extended_Int<Policy, Type>::minus_infinity;
-}
-
-PPL_SPECIALIZE_IS_MINF(is_minf_int, char)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, signed char)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, signed short)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, signed int)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, signed long)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, signed long long)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned char)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned short)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned int)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned long)
-PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned long long)
-
-template <typename Policy, typename Type>
-inline bool
-is_pinf_int(const Type v) {
-  return Policy::has_infinity
-    && v == Extended_Int<Policy, Type>::plus_infinity;
-}
-
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, char)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed char)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed short)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed int)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed long)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed long long)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned char)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned short)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned int)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned long)
-PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned long long)
-
-template <typename Policy, typename Type>
-inline bool
-is_int_int(const Type v) {
-  return !is_nan<Policy>(v);
-}
-
-PPL_SPECIALIZE_IS_INT(is_int_int, char)
-PPL_SPECIALIZE_IS_INT(is_int_int, signed char)
-PPL_SPECIALIZE_IS_INT(is_int_int, signed short)
-PPL_SPECIALIZE_IS_INT(is_int_int, signed int)
-PPL_SPECIALIZE_IS_INT(is_int_int, signed long)
-PPL_SPECIALIZE_IS_INT(is_int_int, signed long long)
-PPL_SPECIALIZE_IS_INT(is_int_int, unsigned char)
-PPL_SPECIALIZE_IS_INT(is_int_int, unsigned short)
-PPL_SPECIALIZE_IS_INT(is_int_int, unsigned int)
-PPL_SPECIALIZE_IS_INT(is_int_int, unsigned long)
-PPL_SPECIALIZE_IS_INT(is_int_int, unsigned long long)
-
-template <typename Policy, typename Type>
-inline Result
-assign_special_int(Type& v, Result_Class c, Rounding_Dir dir) {
-  PPL_ASSERT(c == VC_MINUS_INFINITY || c == VC_PLUS_INFINITY || c == VC_NAN);
-  switch (c) {
-  case VC_NAN:
-    if (Policy::has_nan) {
-      v = Extended_Int<Policy, Type>::not_a_number;
-      return V_NAN;
-    }
-    return V_NAN | V_UNREPRESENTABLE;
-  case VC_MINUS_INFINITY:
-    if (Policy::has_infinity) {
-      v = Extended_Int<Policy, Type>::minus_infinity;
-      return V_EQ_MINUS_INFINITY;
-    }
-    if (round_up(dir)) {
-      v = Extended_Int<Policy, Type>::min;
-      return V_LT_INF;
-    }
-    return V_EQ_MINUS_INFINITY | V_UNREPRESENTABLE;
-  case VC_PLUS_INFINITY:
-    if (Policy::has_infinity) {
-      v = Extended_Int<Policy, Type>::plus_infinity;
-      return V_EQ_PLUS_INFINITY;
-    }
-    if (round_down(dir)) {
-      v = Extended_Int<Policy, Type>::max;
-      return V_GT_SUP;
-    }
-    return V_EQ_PLUS_INFINITY | V_UNREPRESENTABLE;
-  default:
-    PPL_UNREACHABLE;
-    return V_NAN | V_UNREPRESENTABLE;
-  }
-}
-
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, char)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed char)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed short)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed int)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed long)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed long long)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned char)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned short)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned int)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned long)
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned long long)
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_signed_int_signed_int(To& to, const From from, Rounding_Dir dir) {
-  if (sizeof(To) < sizeof(From)
-      || (sizeof(To) == sizeof(From)
-	  && (Extended_Int<To_Policy, To>::min > Extended_Int<From_Policy, From>::min
-	      || Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max))) {
-    if (CHECK_P(To_Policy::check_overflow,
-		PPL_LT_SILENT(from,
-                              static_cast<From>(Extended_Int<To_Policy, To>::min))))
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    if (CHECK_P(To_Policy::check_overflow,
-		PPL_GT_SILENT(from,
-                              static_cast<From>(Extended_Int<To_Policy, To>::max))))
-      return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  to = static_cast<To>(from);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_signed_int_unsigned_int(To& to, const From from, Rounding_Dir dir) {
-  if (sizeof(To) <= sizeof(From)) {
-    if (CHECK_P(To_Policy::check_overflow,
-		from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
-      return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  to = static_cast<To>(from);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_unsigned_int_signed_int(To& to, const From from, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_overflow, from < 0))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  if (sizeof(To) < sizeof(From)) {
-    if (CHECK_P(To_Policy::check_overflow,
-		from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
-      return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  to = static_cast<To>(from);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_unsigned_int_unsigned_int(To& to, const From from, Rounding_Dir dir) {
-  if (sizeof(To) < sizeof(From)
-      || (sizeof(To) == sizeof(From)
-	  && Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max)) {
-    if (CHECK_P(To_Policy::check_overflow,
-		PPL_GT_SILENT(from,
-                              static_cast<From>(Extended_Int<To_Policy, To>::max))))
-      return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  to = static_cast<To>(from);
-  return V_EQ;
-}
-
-
-#define PPL_ASSIGN2_SIGNED_SIGNED(Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_signed_int, Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_signed_int, Larger, Smaller)
-
-#define PPL_ASSIGN2_UNSIGNED_UNSIGNED(Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_unsigned_int, Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_unsigned_int, Larger, Smaller)
-
-#define PPL_ASSIGN2_UNSIGNED_SIGNED(Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_signed_int, Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_unsigned_int, Larger, Smaller)
-
-#define PPL_ASSIGN2_SIGNED_UNSIGNED(Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_unsigned_int, Smaller, Larger) \
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_signed_int, Larger, Smaller)
-
-#define PPL_ASSIGN_SIGNED(Type) \
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_signed_int, Type, Type)
-#define PPL_ASSIGN_UNSIGNED(Type) \
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_unsigned_int, Type, Type)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_ASSIGN_SIGNED(char)
-#endif
-PPL_ASSIGN_SIGNED(signed char)
-PPL_ASSIGN_SIGNED(signed short)
-PPL_ASSIGN_SIGNED(signed int)
-PPL_ASSIGN_SIGNED(signed long)
-PPL_ASSIGN_SIGNED(signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_ASSIGN_UNSIGNED(char)
-#endif
-PPL_ASSIGN_UNSIGNED(unsigned char)
-PPL_ASSIGN_UNSIGNED(unsigned short)
-PPL_ASSIGN_UNSIGNED(unsigned int)
-PPL_ASSIGN_UNSIGNED(unsigned long)
-PPL_ASSIGN_UNSIGNED(unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_ASSIGN2_SIGNED_SIGNED(char, signed short)
-PPL_ASSIGN2_SIGNED_SIGNED(char, signed int)
-PPL_ASSIGN2_SIGNED_SIGNED(char, signed long)
-PPL_ASSIGN2_SIGNED_SIGNED(char, signed long long)
-#endif
-PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed short)
-PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed int)
-PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed long)
-PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed long long)
-PPL_ASSIGN2_SIGNED_SIGNED(signed short, signed int)
-PPL_ASSIGN2_SIGNED_SIGNED(signed short, signed long)
-PPL_ASSIGN2_SIGNED_SIGNED(signed short, signed long long)
-PPL_ASSIGN2_SIGNED_SIGNED(signed int, signed long)
-PPL_ASSIGN2_SIGNED_SIGNED(signed int, signed long long)
-PPL_ASSIGN2_SIGNED_SIGNED(signed long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned short)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned int)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned long long)
-#endif
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned short)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned int)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned long long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned short, unsigned int)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned short, unsigned long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned short, unsigned long long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned int, unsigned long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned int, unsigned long long)
-PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned long, unsigned long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed short)
-PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed int)
-PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed long long)
-#endif
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed short)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed int)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed long long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned short, signed int)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned short, signed long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned short, signed long long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned int, signed long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned int, signed long long)
-PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned long, signed long long)
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned char)
-PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned short)
-PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned int)
-PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned long long)
-#else
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, char)
-#endif
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned char)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned short)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned int)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned long long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned short)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned int)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned long long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed int, unsigned int)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed int, unsigned long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed int, unsigned long long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed long, unsigned long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed long, unsigned long long)
-PPL_ASSIGN2_SIGNED_UNSIGNED(signed long long, unsigned long long)
-
-template <typename To_Policy, typename From_Policy, typename To, typename From>
-inline Result
-assign_int_float(To& to, const From from, Rounding_Dir dir) {
-  if (is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-#if 0
-  // FIXME: this is correct but it is inefficient and breaks the build
-  // for the missing definition of static const members (a problem present
-  // also in other areas of the PPL).
-  if (CHECK_P(To_Policy::check_overflow, lt(from, Extended_Int<To_Policy, To>::min)))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  if (CHECK_P(To_Policy::check_overflow, !le(from, Extended_Int<To_Policy, To>::max)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-#else
-  if (CHECK_P(To_Policy::check_overflow, (from < Extended_Int<To_Policy, To>::min)))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  if (CHECK_P(To_Policy::check_overflow, (from > Extended_Int<To_Policy, To>::max)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-#endif
-  if (round_not_requested(dir)) {
-    to = from;
-    return V_LGE;
-  }
-  From i_from = rint(from);
-  to = i_from;
-  if (from == i_from)
-    return V_EQ;
-  if (round_direct(ROUND_UP))
-    return round_lt_int<To_Policy>(to, dir);
-  if (round_direct(ROUND_DOWN))
-    return round_gt_int<To_Policy>(to, dir);
-  if (from < i_from)
-    return round_lt_int<To_Policy>(to, dir);
-  PPL_ASSERT(from > i_from);
-  return round_gt_int<To_Policy>(to, dir);
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_int_float, char, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed char, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed short, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed int, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long long, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned char, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned short, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned int, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long, float)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long long, float)
-
-PPL_SPECIALIZE_ASSIGN(assign_int_float, char, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed char, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed short, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed int, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long long, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned char, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned short, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned int, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long, double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long long, double)
-
-PPL_SPECIALIZE_ASSIGN(assign_int_float, char, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed char, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed short, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed int, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long long, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned char, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned short, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned int, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long, long double)
-PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long long, long double)
-
-#undef PPL_ASSIGN_SIGNED
-#undef PPL_ASSIGN_UNSIGNED
-#undef PPL_ASSIGN2_SIGNED_SIGNED
-#undef PPL_ASSIGN2_UNSIGNED_UNSIGNED
-#undef PPL_ASSIGN2_UNSIGNED_SIGNED
-#undef PPL_ASSIGN2_SIGNED_UNSIGNED
-
-template <typename To_Policy, typename From_Policy, typename To>
-inline Result
-assign_signed_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
-  if (sizeof(To) <= sizeof(signed long)) {
-    if (!To_Policy::check_overflow) {
-      to = from.get_si();
-      return V_EQ;
-    }
-    if (from.fits_slong_p()) {
-      signed long v = from.get_si();
-      if (PPL_LT_SILENT(v, (Extended_Int<To_Policy, To>::min)))
-	return set_neg_overflow_int<To_Policy>(to, dir);
-      if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max)))
-	return set_pos_overflow_int<To_Policy>(to, dir);
-      to = v;
-      return V_EQ;
-    }
-  }
-  else {
-    mpz_srcptr m = from.get_mpz_t();
-    size_t sz = mpz_size(m);
-    if (sz <= sizeof(To) / sizeof(mp_limb_t)) {
-      if (sz == 0) {
-	to = 0;
-	return V_EQ;
-      }
-      To v;
-      mpz_export(&v, 0, -1, sizeof(To), 0, 0, m);
-      if (v >= 0) {
-	if (::sgn(from) < 0)
-	  return neg<To_Policy, To_Policy>(to, v, dir);
-	to = v;
-	return V_EQ;
-      }
-    }
-  }
-  return (::sgn(from) < 0)
-    ? set_neg_overflow_int<To_Policy>(to, dir)
-    : set_pos_overflow_int<To_Policy>(to, dir);
-}
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, char, mpz_class)
-#endif
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed char, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed short, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed int, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed long, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed long long, mpz_class)
-
-template <typename To_Policy, typename From_Policy, typename To>
-inline Result
-assign_unsigned_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_overflow, ::sgn(from) < 0))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  if (sizeof(To) <= sizeof(unsigned long)) {
-    if (!To_Policy::check_overflow) {
-      to = static_cast<To>(from.get_ui());
-      return V_EQ;
-    }
-    if (from.fits_ulong_p()) {
-      unsigned long v = from.get_ui();
-      if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max)))
-	return set_pos_overflow_int<To_Policy>(to, dir);
-      to = static_cast<To>(v);
-      return V_EQ;
-    }
-  }
-  else {
-    mpz_srcptr m = from.get_mpz_t();
-    size_t sz = mpz_size(m);
-    if (sz <= sizeof(To) / sizeof(mp_limb_t)) {
-      if (sz == 0)
-	to = 0;
-      else
-	mpz_export(&to, 0, -1, sizeof(To), 0, 0, m);
-      return V_EQ;
-    }
-  }
-  return set_pos_overflow_int<To_Policy>(to, dir);
-}
-
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, char, mpz_class)
-#endif
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned char, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned short, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned int, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned long, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned long long, mpz_class)
-
-template <typename To_Policy, typename From_Policy, typename To>
-inline Result
-assign_int_mpq(To& to, const mpq_class& from, Rounding_Dir dir) {
-  mpz_srcptr n = from.get_num().get_mpz_t();
-  mpz_srcptr d = from.get_den().get_mpz_t();
-  PPL_DIRTY_TEMP(mpz_class, q);
-  mpz_ptr q_z = q.get_mpz_t();
-  if (round_not_requested(dir)) {
-    mpz_tdiv_q(q_z, n, d);
-    Result r = assign<To_Policy, void>(to, q, dir);
-    if (r != V_EQ)
-      return r;
-    return V_LGE;
-  }
-  mpz_t rem;
-  int sign;
-  mpz_init(rem);
-  mpz_tdiv_qr(q_z, rem, n, d);
-  sign = mpz_sgn(rem);
-  mpz_clear(rem);
-  Result r = assign<To_Policy, void>(to, q, dir);
-  if (r != V_EQ)
-    return r;
-  switch (sign) {
-  case -1:
-    return round_lt_int<To_Policy>(to, dir);
-  case 1:
-    return round_gt_int<To_Policy>(to, dir);
-  default:
-    return V_EQ;
-  }
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, char, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed char, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed short, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed int, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed long, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed long long, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned char, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned short, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned int, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned long, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned long long, mpq_class)
-
-#if ~0 != -1
-#error "Only two's complement is supported"
-#endif
-
-#if UCHAR_MAX == 0xff
-#define CHAR_BITS 8
-#else
-#error "Unexpected max for unsigned char"
-#endif
-
-#if USHRT_MAX == 0xffff
-#define SHRT_BITS 16
-#else
-#error "Unexpected max for unsigned short"
-#endif
-
-#if UINT_MAX == 0xffffffff
-#define INT_BITS 32
-#else
-#error "Unexpected max for unsigned int"
-#endif
-
-#if ULONG_MAX == 0xffffffffUL
-#define LONG_BITS 32
-#elif ULONG_MAX == 0xffffffffffffffffULL
-#define LONG_BITS 64
-#else
-#error "Unexpected max for unsigned long"
-#endif
-
-#if ULLONG_MAX == 0xffffffffffffffffULL
-#define LONG_LONG_BITS 64
-#else
-#error "Unexpected max for unsigned long long"
-#endif
-
-
-template <typename T>
-struct Larger;
-
-// The following may be tuned for performance on specific architectures.
-//
-// Current guidelines:
-//   - avoid division where possible (larger type variant for mul)
-//   - use larger type variant for types smaller than architecture bit size
-
-template <>
-struct Larger<char> {
-  const_bool_nodef(use_for_neg, true);
-  const_bool_nodef(use_for_add, true);
-  const_bool_nodef(use_for_sub, true);
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast16_t type_for_neg;
-  typedef int_fast16_t type_for_add;
-  typedef int_fast16_t type_for_sub;
-  typedef int_fast16_t type_for_mul;
-};
-
-template <>
-struct Larger<signed char> {
-  const_bool_nodef(use_for_neg, true);
-  const_bool_nodef(use_for_add, true);
-  const_bool_nodef(use_for_sub, true);
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast16_t type_for_neg;
-  typedef int_fast16_t type_for_add;
-  typedef int_fast16_t type_for_sub;
-  typedef int_fast16_t type_for_mul;
-};
-
-template <>
-struct Larger<unsigned char> {
-  const_bool_nodef(use_for_neg, true);
-  const_bool_nodef(use_for_add, true);
-  const_bool_nodef(use_for_sub, true);
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast16_t type_for_neg;
-  typedef uint_fast16_t type_for_add;
-  typedef int_fast16_t type_for_sub;
-  typedef uint_fast16_t type_for_mul;
-};
-
-template <>
-struct Larger<signed short> {
-  const_bool_nodef(use_for_neg, true);
-  const_bool_nodef(use_for_add, true);
-  const_bool_nodef(use_for_sub, true);
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast32_t type_for_neg;
-  typedef int_fast32_t type_for_add;
-  typedef int_fast32_t type_for_sub;
-  typedef int_fast32_t type_for_mul;
-};
-
-template <>
-struct Larger<unsigned short> {
-  const_bool_nodef(use_for_neg, true);
-  const_bool_nodef(use_for_add, true);
-  const_bool_nodef(use_for_sub, true);
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast32_t type_for_neg;
-  typedef uint_fast32_t type_for_add;
-  typedef int_fast32_t type_for_sub;
-  typedef uint_fast32_t type_for_mul;
-};
-
-template <>
-struct Larger<signed int> {
-  const_bool_nodef(use_for_neg, (LONG_BITS == 64));
-  const_bool_nodef(use_for_add, (LONG_BITS == 64));
-  const_bool_nodef(use_for_sub, (LONG_BITS == 64));
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast64_t type_for_neg;
-  typedef int_fast64_t type_for_add;
-  typedef int_fast64_t type_for_sub;
-  typedef int_fast64_t type_for_mul;
-};
-
-template <>
-struct Larger<unsigned int> {
-  const_bool_nodef(use_for_neg, (LONG_BITS == 64));
-  const_bool_nodef(use_for_add, (LONG_BITS == 64));
-  const_bool_nodef(use_for_sub, (LONG_BITS == 64));
-  const_bool_nodef(use_for_mul, true);
-  typedef int_fast64_t type_for_neg;
-  typedef uint_fast64_t type_for_add;
-  typedef int_fast64_t type_for_sub;
-  typedef uint_fast64_t type_for_mul;
-};
-
-template <>
-struct Larger<signed long> {
-  const_bool_nodef(use_for_neg, false);
-  const_bool_nodef(use_for_add, false);
-  const_bool_nodef(use_for_sub, false);
-  const_bool_nodef(use_for_mul, (LONG_BITS == 32));
-  typedef int_fast64_t type_for_neg;
-  typedef int_fast64_t type_for_add;
-  typedef int_fast64_t type_for_sub;
-  typedef int_fast64_t type_for_mul;
-};
-
-template <>
-struct Larger<unsigned long> {
-  const_bool_nodef(use_for_neg, false);
-  const_bool_nodef(use_for_add, false);
-  const_bool_nodef(use_for_sub, false);
-  const_bool_nodef(use_for_mul, (LONG_BITS == 32));
-  typedef int_fast64_t type_for_neg;
-  typedef uint_fast64_t type_for_add;
-  typedef int_fast64_t type_for_sub;
-  typedef uint_fast64_t type_for_mul;
-};
-
-template <>
-struct Larger<signed long long> {
-  const_bool_nodef(use_for_neg, false);
-  const_bool_nodef(use_for_add, false);
-  const_bool_nodef(use_for_sub, false);
-  const_bool_nodef(use_for_mul, false);
-  typedef int_fast64_t type_for_neg;
-  typedef int_fast64_t type_for_add;
-  typedef int_fast64_t type_for_sub;
-  typedef int_fast64_t type_for_mul;
-};
-
-template <>
-struct Larger<unsigned long long> {
-  const_bool_nodef(use_for_neg, false);
-  const_bool_nodef(use_for_add, false);
-  const_bool_nodef(use_for_sub, false);
-  const_bool_nodef(use_for_mul, false);
-  typedef int_fast64_t type_for_neg;
-  typedef uint_fast64_t type_for_add;
-  typedef int_fast64_t type_for_sub;
-  typedef uint_fast64_t type_for_mul;
-};
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-neg_int_larger(Type& to, const Type x, Rounding_Dir dir) {
-  typename Larger<Type>::type_for_neg l = x;
-  l = -l;
-  return assign<To_Policy, To_Policy>(to, l, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-add_int_larger(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  typename Larger<Type>::type_for_add l = x;
-  l += y;
-  return assign<To_Policy, To_Policy>(to, l, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-sub_int_larger(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  typename Larger<Type>::type_for_sub l = x;
-  l -= y;
-  return assign<To_Policy, To_Policy>(to, l, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-mul_int_larger(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  typename Larger<Type>::type_for_mul l = x;
-  l *= y;
-  return assign<To_Policy, To_Policy>(to, l, dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-neg_signed_int(Type& to, const Type from, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_neg)
-    return neg_int_larger<To_Policy, From_Policy>(to, from, dir);
-  if (CHECK_P(To_Policy::check_overflow,
-	      (from < -Extended_Int<To_Policy, Type>::max)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  to = -from;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-neg_unsigned_int(Type& to, const Type from, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_neg)
-    return neg_int_larger<To_Policy, From_Policy>(to, from, dir);
-  if (CHECK_P(To_Policy::check_overflow, from != 0))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  to = from;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-add_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_add)
-    return add_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-  if (To_Policy::check_overflow) {
-    if (y >= 0) {
-      if (x > Extended_Int<To_Policy, Type>::max - y)
-	return set_pos_overflow_int<To_Policy>(to, dir);
-    }
-    else if (x < Extended_Int<To_Policy, Type>::min - y)
-      return set_neg_overflow_int<To_Policy>(to, dir);
-  }
-  to = x + y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-add_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_add)
-    return add_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-  if (CHECK_P(To_Policy::check_overflow,
-	      (x > Extended_Int<To_Policy, Type>::max - y)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  to = x + y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-sub_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_sub)
-    return sub_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-  if (To_Policy::check_overflow) {
-    if (y >= 0) {
-      if (x < Extended_Int<To_Policy, Type>::min + y)
-	return set_neg_overflow_int<To_Policy>(to, dir);
-    }
-    else if (x > Extended_Int<To_Policy, Type>::max + y)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  to = x - y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-sub_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_sub)
-    return sub_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-  if (CHECK_P(To_Policy::check_overflow,
-	      (x < Extended_Int<To_Policy, Type>::min + y)))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  to = x - y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-mul_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_mul)
-    return mul_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-  if (!To_Policy::check_overflow) {
-    to = x * y;
-    return V_EQ;
-  }
-  if (y == 0) {
-    to = 0;
-    return V_EQ;
-  }
-  if (y == -1)
-    return neg_signed_int<To_Policy, From1_Policy>(to, x, dir);
-  if (x >= 0) {
-    if (y > 0) {
-      if (x > Extended_Int<To_Policy, Type>::max / y)
-	return set_pos_overflow_int<To_Policy>(to, dir);
-    }
-    else {
-      if (x > Extended_Int<To_Policy, Type>::min / y)
-	return set_neg_overflow_int<To_Policy>(to, dir);
-    }
-  }
-  else {
-    if (y < 0) {
-      if (x < Extended_Int<To_Policy, Type>::max / y)
-	return set_pos_overflow_int<To_Policy>(to, dir);
-    }
-    else {
-      if (x < Extended_Int<To_Policy, Type>::min / y)
-	return set_neg_overflow_int<To_Policy>(to, dir);
-    }
-  }
-  to = x * y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-mul_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (To_Policy::check_overflow && Larger<Type>::use_for_mul)
-    return mul_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
-  if (!To_Policy::check_overflow) {
-    to = x * y;
-    return V_EQ;
-  }
-  if (y == 0) {
-    to = 0;
-    return V_EQ;
-  }
-  if (x > Extended_Int<To_Policy, Type>::max / y)
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  to = x * y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-div_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  if (To_Policy::check_overflow && y == -1)
-    return neg_signed_int<To_Policy, From1_Policy>(to, x, dir);
-  to = x / y;
-  if (round_not_requested(dir))
-    return V_LGE;
-  if (y == -1)
-    return V_EQ;
-  Type m = x % y;
-  if (m < 0)
-    return round_lt_int_no_overflow<To_Policy>(to, dir);
-  else if (m > 0)
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  else
-    return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-div_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  to = x / y;
-  if (round_not_requested(dir))
-    return V_GE;
-  Type m = x % y;
-  if (m == 0)
-    return V_EQ;
-  return round_gt_int<To_Policy>(to, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-idiv_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  if (To_Policy::check_overflow && y == -1)
-    return neg_signed_int<To_Policy, From1_Policy>(to, x, dir);
-  to = x / y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-idiv_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  to = x / y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-rem_signed_int(Type& to, const Type x, const Type y, Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
-    return assign_nan<To_Policy>(to, V_MOD_ZERO);
-  }
-  to = (y == -1) ? 0 : (x % y);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-rem_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
-    return assign_nan<To_Policy>(to, V_MOD_ZERO);
-  }
-  to = x % y;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-div_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-                      Rounding_Dir dir) {
-  if (exp >= sizeof_to_bits(sizeof(Type))) {
-    to = 0;
-    if (round_not_requested(dir))
-      return V_GE;
-    if (x == 0)
-      return V_EQ;
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  }
-  to = x >> exp;
-  if (round_not_requested(dir))
-    return V_GE;
-  if (x & ((Type(1) << exp) - 1))
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  else
-    return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-div_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-                    Rounding_Dir dir) {
-  if (exp > sizeof_to_bits(sizeof(Type)) - 1) {
-  zero:
-    to = 0;
-    if (round_not_requested(dir))
-      return V_LGE;
-    if (x < 0)
-      return round_lt_int_no_overflow<To_Policy>(to, dir);
-    else if (x > 0)
-      return round_gt_int_no_overflow<To_Policy>(to, dir);
-    else
-      return V_EQ;
-  }
-  if (exp == sizeof_to_bits(sizeof(Type)) - 1) {
-    if (x == C_Integer<Type>::min) {
-      to = -1;
-      return V_EQ;
-    }
-    goto zero;
-  }
-#if 0
-  to = x / (Type(1) << exp);
-  if (round_not_requested(dir))
-    return V_GE;
-  Type r = x % (Type(1) << exp);
-  if (r < 0)
-    return round_lt_int_no_overflow<To_Policy>(to, dir);
-  else if (r > 0)
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  else
-    return V_EQ;
-#else
-  // Faster but compiler implementation dependent (see C++98 5.8.3)
-  to = x >> exp;
-  if (round_not_requested(dir))
-    return V_GE;
-  if (x & ((Type(1) << exp) - 1))
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  return V_EQ;
-#endif
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-add_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-                      Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x + (Type(1) << exp);
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  Type n = Type(1) << exp;
-  return add_unsigned_int<To_Policy, From_Policy, void>(to, x, n, dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-add_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		    Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x + (Type(1) << exp);
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  if (exp == sizeof_to_bits(sizeof(Type)) - 1) {
-    Type n = -2 * (Type(1) << (exp - 1));
-    return sub_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
-  }
-  else {
-    Type n = Type(1) << exp;
-    return add_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-sub_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-                      Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x - (Type(1) << exp);
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type)))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  Type n = Type(1) << exp;
-  return sub_unsigned_int<To_Policy, From_Policy, void>(to, x, n, dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-sub_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		    Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x - (Type(1) << exp);
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type)))
-    return set_neg_overflow_int<To_Policy>(to, dir);
-  if (exp == sizeof_to_bits(sizeof(Type)) - 1) {
-    Type n = -2 * (Type(1) << (exp - 1));
-    return add_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
-  }
-  else {
-    Type n = Type(1) << exp;
-    return sub_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
-  }
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-mul_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-                      Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x << exp;
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type))) {
-    if (x == 0) {
-      to = 0;
-      return V_EQ;
-    }
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  if (x & (((Type(1) << exp) - 1) << (sizeof_to_bits(sizeof(Type)) - exp)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  Type n = x << exp;
-  if (PPL_GT_SILENT(n, (Extended_Int<To_Policy, Type>::max)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  to = n;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-mul_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-                    Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x << exp;
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type)) - 1) {
-    if (x < 0)
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    else if (x > 0)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-    else {
-      to = 0;
-      return V_EQ;
-    }
-  }
-  Type mask = ((Type(1) << exp) - 1) << ((sizeof_to_bits(sizeof(Type)) - 1) - exp);
-  Type n;
-  if (x < 0) {
-    if ((x & mask) != mask)
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    n = x << exp;
-    if (PPL_LT_SILENT(n, (Extended_Int<To_Policy, Type>::min)))
-      return set_neg_overflow_int<To_Policy>(to, dir);
-  }
-  else {
-    if (x & mask)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-    n = x << exp;
-    if (PPL_GT_SILENT(n, (Extended_Int<To_Policy, Type>::max)))
-      return set_pos_overflow_int<To_Policy>(to, dir);
-  }
-  to = n;
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-smod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-		       Rounding_Dir dir) {
-  if (exp > sizeof_to_bits(sizeof(Type)))
-    to = x;
-  else {
-    Type v = (exp == sizeof_to_bits(sizeof(Type)) ? x : (x & ((Type(1) << exp) - 1)));
-    if (v >= (Type(1) << (exp - 1)))
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    else
-      to = v;
-  }
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-smod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		     Rounding_Dir) {
-  if (exp >= sizeof_to_bits(sizeof(Type)))
-    to = x;
-  else {
-    Type m = Type(1) << (exp - 1);
-    to = (x & (m - 1)) - (x & m);
-  }
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-umod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-		       Rounding_Dir) {
-  if (exp >= sizeof_to_bits(sizeof(Type)))
-    to = x;
-  else
-    to = x & ((Type(1) << exp) - 1);
-  return V_EQ;
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-umod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		     Rounding_Dir dir) {
-  if (exp >= sizeof_to_bits(sizeof(Type))) {
-    if (x < 0)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-    to = x;
-  }
-  else
-    to = x & ((Type(1) << exp) - 1);
-  return V_EQ;
-}
-
-template <typename Type>
-inline void
-isqrt_rem(Type& q, Type& r, const Type from) {
-  q = 0;
-  r = from;
-  Type t(1);
-  for (t <<= sizeof_to_bits(sizeof(Type)) - 2; t != 0; t >>= 2) {
-    Type s = q + t;
-    if (s <= r) {
-      r -= s;
-      q = s + t;
-    }
-    q >>= 1;
-  }
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-sqrt_unsigned_int(Type& to, const Type from, Rounding_Dir dir) {
-  Type rem;
-  isqrt_rem(to, rem, from);
-  if (round_not_requested(dir))
-    return V_GE;
-  if (rem == 0)
-    return V_EQ;
-  return round_gt_int<To_Policy>(to, dir);
-}
-
-template <typename To_Policy, typename From_Policy, typename Type>
-inline Result
-sqrt_signed_int(Type& to, const Type from, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_sqrt_neg, from < 0)) {
-    return assign_nan<To_Policy>(to, V_SQRT_NEG);
-  }
-  return sqrt_unsigned_int<To_Policy, From_Policy>(to, from, dir);
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-add_mul_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  Type z;
-  Result r = mul<To_Policy, From1_Policy, From2_Policy>(z, x, y, dir);
-  switch (result_overflow(r)) {
-  case 0:
-    return add<To_Policy, To_Policy, To_Policy>(to, to, z, dir);
-  case -1:
-    if (to <= 0)
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    return assign_nan<To_Policy>(to, V_UNKNOWN_NEG_OVERFLOW);
-  case 1:
-    if (to >= 0)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-    return assign_nan<To_Policy>(to, V_UNKNOWN_POS_OVERFLOW);
-  default:
-    PPL_UNREACHABLE;
-    return V_NAN;
-  }
-}
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-          typename Type>
-inline Result
-sub_mul_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
-  Type z;
-  Result r = mul<To_Policy, From1_Policy, From2_Policy>(z, x, y, dir);
-  switch (result_overflow(r)) {
-  case 0:
-    return sub<To_Policy, To_Policy, To_Policy>(to, to, z, dir);
-  case -1:
-    if (to >= 0)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-    return assign_nan<To_Policy>(to, V_UNKNOWN_NEG_OVERFLOW);
-  case 1:
-    if (to <= 0)
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    return assign_nan<To_Policy>(to, V_UNKNOWN_POS_OVERFLOW);
-  default:
-    PPL_UNREACHABLE;
-    return V_NAN;
-  }
-}
-
-template <typename Policy, typename Type>
-inline Result
-output_char(std::ostream& os, Type& from,
-	    const Numeric_Format&, Rounding_Dir) {
-  os << int(from);
-  return V_EQ;
-}
-
-template <typename Policy, typename Type>
-inline Result
-output_int(std::ostream& os, Type& from, const Numeric_Format&, Rounding_Dir) {
-  os << from;
-  return V_EQ;
-}
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed char, signed char)
-PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed short, signed short)
-PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed int, signed int)
-PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed long, signed long)
-PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed char, signed char)
-PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed short, signed short)
-PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed int, signed int)
-PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed long, signed long)
-PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed char, signed char)
-PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed short, signed short)
-PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed int, signed int)
-PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed long, signed long)
-PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_NEG(neg_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_NEG(neg_signed_int, signed char, signed char)
-PPL_SPECIALIZE_NEG(neg_signed_int, signed short, signed short)
-PPL_SPECIALIZE_NEG(neg_signed_int, signed int, signed int)
-PPL_SPECIALIZE_NEG(neg_signed_int, signed long, signed long)
-PPL_SPECIALIZE_NEG(neg_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_NEG(neg_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ADD(add_signed_int, char, char, char)
-#endif
-PPL_SPECIALIZE_ADD(add_signed_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_ADD(add_signed_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_ADD(add_signed_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_ADD(add_signed_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_ADD(add_signed_int, signed long long, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ADD(add_unsigned_int, char, char, char)
-#endif
-PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SUB(sub_signed_int, char, char, char)
-#endif
-PPL_SPECIALIZE_SUB(sub_signed_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_SUB(sub_signed_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_SUB(sub_signed_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_SUB(sub_signed_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_SUB(sub_signed_int, signed long long, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SUB(sub_unsigned_int, char, char, char)
-#endif
-PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_MUL(mul_signed_int, char, char, char)
-#endif
-PPL_SPECIALIZE_MUL(mul_signed_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_MUL(mul_signed_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_MUL(mul_signed_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_MUL(mul_signed_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_MUL(mul_signed_int, signed long long, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_MUL(mul_unsigned_int, char, char, char)
-#endif
-PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_DIV(div_signed_int, char, char, char)
-#endif
-PPL_SPECIALIZE_DIV(div_signed_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_DIV(div_signed_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_DIV(div_signed_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_DIV(div_signed_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_DIV(div_signed_int, signed long long, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_DIV(div_unsigned_int, char, char, char)
-#endif
-PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_IDIV(idiv_signed_int, char, char, char)
-#endif
-PPL_SPECIALIZE_IDIV(idiv_signed_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_IDIV(idiv_signed_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_IDIV(idiv_signed_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_IDIV(idiv_signed_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_IDIV(idiv_signed_int, signed long long, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_IDIV(idiv_unsigned_int, char, char, char)
-#endif
-PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_REM(rem_signed_int, char, char, char)
-#endif
-PPL_SPECIALIZE_REM(rem_signed_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_REM(rem_signed_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_REM(rem_signed_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_REM(rem_signed_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_REM(rem_signed_int, signed long long, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_REM(rem_unsigned_int, char, char, char)
-#endif
-PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed char, signed char)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed short, signed short)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed int, signed int)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed long, signed long)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed char, signed char)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed short, signed short)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed int, signed int)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed long, signed long)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed char, signed char)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed short, signed short)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed int, signed int)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed long, signed long)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed char, signed char)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed short, signed short)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed int, signed int)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed long, signed long)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed char, signed char)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed short, signed short)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed int, signed int)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed long, signed long)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed char, signed char)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed short, signed short)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed int, signed int)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed long, signed long)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SQRT(sqrt_signed_int, char, char)
-#endif
-PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed char, signed char)
-PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed short, signed short)
-PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed int, signed int)
-PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed long, signed long)
-PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned long long, unsigned long long)
-
-#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ABS(abs_generic, char, char)
-#endif
-PPL_SPECIALIZE_ABS(abs_generic, signed char, signed char)
-PPL_SPECIALIZE_ABS(abs_generic, signed short, signed short)
-PPL_SPECIALIZE_ABS(abs_generic, signed int, signed int)
-PPL_SPECIALIZE_ABS(abs_generic, signed long, signed long)
-PPL_SPECIALIZE_ABS(abs_generic, signed long long, signed long long)
-#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
-PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, char, char)
-#endif
-PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
-PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
-PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
-PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
-PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_GCD(gcd_exact, char, char, char)
-PPL_SPECIALIZE_GCD(gcd_exact, signed char, signed char, signed char)
-PPL_SPECIALIZE_GCD(gcd_exact, signed short, signed short, signed short)
-PPL_SPECIALIZE_GCD(gcd_exact, signed int, signed int, signed int)
-PPL_SPECIALIZE_GCD(gcd_exact, signed long, signed long, signed long)
-PPL_SPECIALIZE_GCD(gcd_exact, signed long long, signed long long, signed long long)
-PPL_SPECIALIZE_GCD(gcd_exact, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_GCD(gcd_exact, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_GCD(gcd_exact, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_GCD(gcd_exact, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_GCD(gcd_exact, unsigned long long, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, char, char, char, char, char)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed char, signed char, signed char, signed char, signed char)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed short, signed short, signed short, signed short, signed short)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed int, signed int, signed int, signed int, signed int)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed long, signed long, signed long, signed long, signed long)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed long long, signed long long, signed long long, signed long long, signed long long)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned char, unsigned char, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned short, unsigned short, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned long, unsigned long, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned long long, unsigned long long, unsigned long long, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, char, char, char)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed char, signed char, signed char)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed short, signed short, signed short)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed int, signed int, signed int)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed long, signed long, signed long)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed long long, signed long long, signed long long)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned long long, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_SGN(sgn_generic, char)
-PPL_SPECIALIZE_SGN(sgn_generic, signed char)
-PPL_SPECIALIZE_SGN(sgn_generic, signed short)
-PPL_SPECIALIZE_SGN(sgn_generic, signed int)
-PPL_SPECIALIZE_SGN(sgn_generic, signed long)
-PPL_SPECIALIZE_SGN(sgn_generic, signed long long)
-PPL_SPECIALIZE_SGN(sgn_generic, unsigned char)
-PPL_SPECIALIZE_SGN(sgn_generic, unsigned short)
-PPL_SPECIALIZE_SGN(sgn_generic, unsigned int)
-PPL_SPECIALIZE_SGN(sgn_generic, unsigned long)
-PPL_SPECIALIZE_SGN(sgn_generic, unsigned long long)
-
-PPL_SPECIALIZE_CMP(cmp_generic, char, char)
-PPL_SPECIALIZE_CMP(cmp_generic, signed char, signed char)
-PPL_SPECIALIZE_CMP(cmp_generic, signed short, signed short)
-PPL_SPECIALIZE_CMP(cmp_generic, signed int, signed int)
-PPL_SPECIALIZE_CMP(cmp_generic, signed long, signed long)
-PPL_SPECIALIZE_CMP(cmp_generic, signed long long, signed long long)
-PPL_SPECIALIZE_CMP(cmp_generic, unsigned char, unsigned char)
-PPL_SPECIALIZE_CMP(cmp_generic, unsigned short, unsigned short)
-PPL_SPECIALIZE_CMP(cmp_generic, unsigned int, unsigned int)
-PPL_SPECIALIZE_CMP(cmp_generic, unsigned long, unsigned long)
-PPL_SPECIALIZE_CMP(cmp_generic, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, char, char, char)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed long long, signed long long, signed long long)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned long long, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, char, char, char)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed char, signed char, signed char)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed short, signed short, signed short)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed int, signed int, signed int)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed long, signed long, signed long)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed long long, signed long long, signed long long)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned char, unsigned char, unsigned char)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned short, unsigned short, unsigned short)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned int, unsigned int, unsigned int)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned long, unsigned long, unsigned long)
-PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned long long, unsigned long long, unsigned long long)
-
-PPL_SPECIALIZE_INPUT(input_generic, char)
-PPL_SPECIALIZE_INPUT(input_generic, signed char)
-PPL_SPECIALIZE_INPUT(input_generic, signed short)
-PPL_SPECIALIZE_INPUT(input_generic, signed int)
-PPL_SPECIALIZE_INPUT(input_generic, signed long)
-PPL_SPECIALIZE_INPUT(input_generic, signed long long)
-PPL_SPECIALIZE_INPUT(input_generic, unsigned char)
-PPL_SPECIALIZE_INPUT(input_generic, unsigned short)
-PPL_SPECIALIZE_INPUT(input_generic, unsigned int)
-PPL_SPECIALIZE_INPUT(input_generic, unsigned long)
-PPL_SPECIALIZE_INPUT(input_generic, unsigned long long)
-
-PPL_SPECIALIZE_OUTPUT(output_char, char)
-PPL_SPECIALIZE_OUTPUT(output_char, signed char)
-PPL_SPECIALIZE_OUTPUT(output_int, signed short)
-PPL_SPECIALIZE_OUTPUT(output_int, signed int)
-PPL_SPECIALIZE_OUTPUT(output_int, signed long)
-PPL_SPECIALIZE_OUTPUT(output_int, signed long long)
-PPL_SPECIALIZE_OUTPUT(output_char, unsigned char)
-PPL_SPECIALIZE_OUTPUT(output_int, unsigned short)
-PPL_SPECIALIZE_OUTPUT(output_int, unsigned int)
-PPL_SPECIALIZE_OUTPUT(output_int, unsigned long)
-PPL_SPECIALIZE_OUTPUT(output_int, unsigned long long)
-
-} // namespace Checked
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_checked_int_inlines_hh)
diff --git a/src/checked_int_inlines.hh b/src/checked_int_inlines.hh
new file mode 100644
index 0000000..3ebd1a3
--- /dev/null
+++ b/src/checked_int_inlines.hh
@@ -0,0 +1,1952 @@
+/* Specialized "checked" functions for native integer numbers.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_int_inlines_hh
+#define PPL_checked_int_inlines_hh 1
+
+#include "C_Integer.hh"
+#include <cerrno>
+#include <cstdlib>
+#include <climits>
+#include <string>
+
+#if !PPL_HAVE_DECL_STRTOLL
+signed long long
+strtoll(const char* nptr, char** endptr, int base);
+#endif
+
+#if !PPL_HAVE_DECL_STRTOULL
+unsigned long long
+strtoull(const char* nptr, char** endptr, int base);
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+namespace Checked {
+
+#ifndef PPL_HAVE_INT_FAST16_T
+typedef int16_t int_fast16_t;
+#endif
+
+#ifndef PPL_HAVE_INT_FAST32_T
+typedef int32_t int_fast32_t;
+#endif
+
+#ifndef PPL_HAVE_INT_FAST64_T
+typedef int64_t int_fast64_t;
+#endif
+
+#ifndef PPL_HAVE_UINT_FAST16_T
+typedef uint16_t uint_fast16_t;
+#endif
+
+#ifndef PPL_HAVE_UINT_FAST32_T
+typedef uint32_t uint_fast32_t;
+#endif
+
+#ifndef PPL_HAVE_UINT_FAST64_T
+typedef uint64_t uint_fast64_t;
+#endif
+
+template <typename Policy, typename Type>
+struct Extended_Int {
+  static const Type plus_infinity = C_Integer<Type>::max;
+  static const Type minus_infinity = ((C_Integer<Type>::min >= 0)
+                                      ? (C_Integer<Type>::max - 1)
+                                      : C_Integer<Type>::min);
+  static const Type not_a_number
+  = ((C_Integer<Type>::min >= 0)
+     ? (C_Integer<Type>::max - 2 * (Policy::has_infinity ? 1 : 0))
+     : (C_Integer<Type>::min + (Policy::has_infinity ? 1 : 0)));
+  static const Type min
+  = (C_Integer<Type>::min
+     + ((C_Integer<Type>::min >= 0)
+        ? 0
+        : ((Policy::has_infinity ? 1 : 0) + (Policy::has_nan ? 1 : 0))));
+  static const Type max
+  = (C_Integer<Type>::max
+     - ((C_Integer<Type>::min >= 0)
+        ? (2 * (Policy::has_infinity ? 1 : 0) + (Policy::has_nan ? 1 : 0))
+        : (Policy::has_infinity ? 1 : 0)));
+};
+
+template <typename Policy, typename To>
+inline Result
+set_neg_overflow_int(To& to, Rounding_Dir dir) {
+  if (round_up(dir)) {
+    to = Extended_Int<Policy, To>::min;
+    return V_LT_INF;
+  }
+  else {
+    if (Policy::has_infinity) {
+      to = Extended_Int<Policy, To>::minus_infinity;
+      return V_GT_MINUS_INFINITY;
+    }
+    return V_GT_MINUS_INFINITY | V_UNREPRESENTABLE;
+  }
+}
+
+template <typename Policy, typename To>
+inline Result
+set_pos_overflow_int(To& to, Rounding_Dir dir) {
+  if (round_down(dir)) {
+    to = Extended_Int<Policy, To>::max;
+    return V_GT_SUP;
+  }
+  else {
+    if (Policy::has_infinity) {
+      to = Extended_Int<Policy, To>::plus_infinity;
+      return V_LT_PLUS_INFINITY;
+    }
+    return V_LT_PLUS_INFINITY | V_UNREPRESENTABLE;
+  }
+}
+
+template <typename Policy, typename To>
+inline Result
+round_lt_int_no_overflow(To& to, Rounding_Dir dir) {
+  if (round_down(dir)) {
+    --to;
+    return V_GT;
+  }
+  return V_LT;
+}
+
+template <typename Policy, typename To>
+inline Result
+round_gt_int_no_overflow(To& to, Rounding_Dir dir) {
+  if (round_up(dir)) {
+    ++to;
+    return V_LT;
+  }
+  return V_GT;
+}
+
+template <typename Policy, typename To>
+inline Result
+round_lt_int(To& to, Rounding_Dir dir) {
+  if (round_down(dir)) {
+    if (to == Extended_Int<Policy, To>::min) {
+      if (Policy::has_infinity) {
+        to = Extended_Int<Policy, To>::minus_infinity;
+        return V_GT_MINUS_INFINITY;
+      }
+      return V_GT_MINUS_INFINITY | V_UNREPRESENTABLE;
+    }
+    else {
+      --to;
+      return V_GT;
+    }
+  }
+  return V_LT;
+}
+
+template <typename Policy, typename To>
+inline Result
+round_gt_int(To& to, Rounding_Dir dir) {
+  if (round_up(dir)) {
+    if (to == Extended_Int<Policy, To>::max) {
+      if (Policy::has_infinity) {
+        to = Extended_Int<Policy, To>::plus_infinity;
+        return V_LT_PLUS_INFINITY;
+      }
+      return V_LT_PLUS_INFINITY | V_UNREPRESENTABLE;
+    }
+    else {
+      ++to;
+      return V_LT;
+    }
+  }
+  return V_GT;
+}
+
+PPL_SPECIALIZE_COPY(copy_generic, char)
+PPL_SPECIALIZE_COPY(copy_generic, signed char)
+PPL_SPECIALIZE_COPY(copy_generic, signed short)
+PPL_SPECIALIZE_COPY(copy_generic, signed int)
+PPL_SPECIALIZE_COPY(copy_generic, signed long)
+PPL_SPECIALIZE_COPY(copy_generic, signed long long)
+PPL_SPECIALIZE_COPY(copy_generic, unsigned char)
+PPL_SPECIALIZE_COPY(copy_generic, unsigned short)
+PPL_SPECIALIZE_COPY(copy_generic, unsigned int)
+PPL_SPECIALIZE_COPY(copy_generic, unsigned long)
+PPL_SPECIALIZE_COPY(copy_generic, unsigned long long)
+
+template <typename Policy, typename Type>
+inline Result
+classify_int(const Type v, bool nan, bool inf, bool sign) {
+  if (Policy::has_nan
+      && (nan || sign)
+      && v == Extended_Int<Policy, Type>::not_a_number)
+    return V_NAN;
+  if (!inf && !sign)
+    return V_LGE;
+  if (Policy::has_infinity) {
+    if (v == Extended_Int<Policy, Type>::minus_infinity)
+      return inf ? V_EQ_MINUS_INFINITY : V_LT;
+    if (v == Extended_Int<Policy, Type>::plus_infinity)
+      return inf ? V_EQ_PLUS_INFINITY : V_GT;
+  }
+  if (sign) {
+    if (v < 0)
+      return V_LT;
+    if (v > 0)
+      return V_GT;
+    return V_EQ;
+  }
+  return V_LGE;
+}
+
+PPL_SPECIALIZE_CLASSIFY(classify_int, char)
+PPL_SPECIALIZE_CLASSIFY(classify_int, signed char)
+PPL_SPECIALIZE_CLASSIFY(classify_int, signed short)
+PPL_SPECIALIZE_CLASSIFY(classify_int, signed int)
+PPL_SPECIALIZE_CLASSIFY(classify_int, signed long)
+PPL_SPECIALIZE_CLASSIFY(classify_int, signed long long)
+PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned char)
+PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned short)
+PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned int)
+PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned long)
+PPL_SPECIALIZE_CLASSIFY(classify_int, unsigned long long)
+
+template <typename Policy, typename Type>
+inline bool
+is_nan_int(const Type v) {
+  return Policy::has_nan && v == Extended_Int<Policy, Type>::not_a_number;
+}
+
+PPL_SPECIALIZE_IS_NAN(is_nan_int, char)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, signed char)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, signed short)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, signed int)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, signed long)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, signed long long)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned char)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned short)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned int)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned long)
+PPL_SPECIALIZE_IS_NAN(is_nan_int, unsigned long long)
+
+template <typename Policy, typename Type>
+inline bool
+is_minf_int(const Type v) {
+  return Policy::has_infinity
+    && v == Extended_Int<Policy, Type>::minus_infinity;
+}
+
+PPL_SPECIALIZE_IS_MINF(is_minf_int, char)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, signed char)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, signed short)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, signed int)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, signed long)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, signed long long)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned char)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned short)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned int)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned long)
+PPL_SPECIALIZE_IS_MINF(is_minf_int, unsigned long long)
+
+template <typename Policy, typename Type>
+inline bool
+is_pinf_int(const Type v) {
+  return Policy::has_infinity
+    && v == Extended_Int<Policy, Type>::plus_infinity;
+}
+
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, char)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed char)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed short)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed int)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed long)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, signed long long)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned char)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned short)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned int)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned long)
+PPL_SPECIALIZE_IS_PINF(is_pinf_int, unsigned long long)
+
+template <typename Policy, typename Type>
+inline bool
+is_int_int(const Type v) {
+  return !is_nan<Policy>(v);
+}
+
+PPL_SPECIALIZE_IS_INT(is_int_int, char)
+PPL_SPECIALIZE_IS_INT(is_int_int, signed char)
+PPL_SPECIALIZE_IS_INT(is_int_int, signed short)
+PPL_SPECIALIZE_IS_INT(is_int_int, signed int)
+PPL_SPECIALIZE_IS_INT(is_int_int, signed long)
+PPL_SPECIALIZE_IS_INT(is_int_int, signed long long)
+PPL_SPECIALIZE_IS_INT(is_int_int, unsigned char)
+PPL_SPECIALIZE_IS_INT(is_int_int, unsigned short)
+PPL_SPECIALIZE_IS_INT(is_int_int, unsigned int)
+PPL_SPECIALIZE_IS_INT(is_int_int, unsigned long)
+PPL_SPECIALIZE_IS_INT(is_int_int, unsigned long long)
+
+template <typename Policy, typename Type>
+inline Result
+assign_special_int(Type& v, Result_Class c, Rounding_Dir dir) {
+  PPL_ASSERT(c == VC_MINUS_INFINITY || c == VC_PLUS_INFINITY || c == VC_NAN);
+  switch (c) {
+  case VC_NAN:
+    if (Policy::has_nan) {
+      v = Extended_Int<Policy, Type>::not_a_number;
+      return V_NAN;
+    }
+    return V_NAN | V_UNREPRESENTABLE;
+  case VC_MINUS_INFINITY:
+    if (Policy::has_infinity) {
+      v = Extended_Int<Policy, Type>::minus_infinity;
+      return V_EQ_MINUS_INFINITY;
+    }
+    if (round_up(dir)) {
+      v = Extended_Int<Policy, Type>::min;
+      return V_LT_INF;
+    }
+    return V_EQ_MINUS_INFINITY | V_UNREPRESENTABLE;
+  case VC_PLUS_INFINITY:
+    if (Policy::has_infinity) {
+      v = Extended_Int<Policy, Type>::plus_infinity;
+      return V_EQ_PLUS_INFINITY;
+    }
+    if (round_down(dir)) {
+      v = Extended_Int<Policy, Type>::max;
+      return V_GT_SUP;
+    }
+    return V_EQ_PLUS_INFINITY | V_UNREPRESENTABLE;
+  default:
+    PPL_UNREACHABLE;
+    return V_NAN | V_UNREPRESENTABLE;
+  }
+}
+
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, char)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed char)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed short)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed int)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed long)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, signed long long)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned char)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned short)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned int)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned long)
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_int, unsigned long long)
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_signed_int_signed_int(To& to, const From from, Rounding_Dir dir) {
+  if (sizeof(To) < sizeof(From)
+      || (sizeof(To) == sizeof(From)
+          && (Extended_Int<To_Policy, To>::min > Extended_Int<From_Policy, From>::min
+              || Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max))) {
+    if (CHECK_P(To_Policy::check_overflow,
+                PPL_LT_SILENT(from,
+                              static_cast<From>(Extended_Int<To_Policy, To>::min))))
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    if (CHECK_P(To_Policy::check_overflow,
+                PPL_GT_SILENT(from,
+                              static_cast<From>(Extended_Int<To_Policy, To>::max))))
+      return set_pos_overflow_int<To_Policy>(to, dir);
+  }
+  to = static_cast<To>(from);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_signed_int_unsigned_int(To& to, const From from, Rounding_Dir dir) {
+  if (sizeof(To) <= sizeof(From)) {
+    if (CHECK_P(To_Policy::check_overflow,
+                from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
+      return set_pos_overflow_int<To_Policy>(to, dir);
+  }
+  to = static_cast<To>(from);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_unsigned_int_signed_int(To& to, const From from, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_overflow, from < 0))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  if (sizeof(To) < sizeof(From)) {
+    if (CHECK_P(To_Policy::check_overflow,
+                from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
+      return set_pos_overflow_int<To_Policy>(to, dir);
+  }
+  to = static_cast<To>(from);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_unsigned_int_unsigned_int(To& to, const From from, Rounding_Dir dir) {
+  if (sizeof(To) < sizeof(From)
+      || (sizeof(To) == sizeof(From)
+          && Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max)) {
+    if (CHECK_P(To_Policy::check_overflow,
+                PPL_GT_SILENT(from,
+                              static_cast<From>(Extended_Int<To_Policy, To>::max))))
+      return set_pos_overflow_int<To_Policy>(to, dir);
+  }
+  to = static_cast<To>(from);
+  return V_EQ;
+}
+
+
+#define PPL_ASSIGN2_SIGNED_SIGNED(Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_signed_int, Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_signed_int, Larger, Smaller)
+
+#define PPL_ASSIGN2_UNSIGNED_UNSIGNED(Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_unsigned_int, Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_unsigned_int, Larger, Smaller)
+
+#define PPL_ASSIGN2_UNSIGNED_SIGNED(Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_signed_int, Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_unsigned_int, Larger, Smaller)
+
+#define PPL_ASSIGN2_SIGNED_UNSIGNED(Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_unsigned_int, Smaller, Larger) \
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_signed_int, Larger, Smaller)
+
+#define PPL_ASSIGN_SIGNED(Type) \
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_signed_int, Type, Type)
+#define PPL_ASSIGN_UNSIGNED(Type) \
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_unsigned_int, Type, Type)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_ASSIGN_SIGNED(char)
+#endif
+PPL_ASSIGN_SIGNED(signed char)
+PPL_ASSIGN_SIGNED(signed short)
+PPL_ASSIGN_SIGNED(signed int)
+PPL_ASSIGN_SIGNED(signed long)
+PPL_ASSIGN_SIGNED(signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_ASSIGN_UNSIGNED(char)
+#endif
+PPL_ASSIGN_UNSIGNED(unsigned char)
+PPL_ASSIGN_UNSIGNED(unsigned short)
+PPL_ASSIGN_UNSIGNED(unsigned int)
+PPL_ASSIGN_UNSIGNED(unsigned long)
+PPL_ASSIGN_UNSIGNED(unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_ASSIGN2_SIGNED_SIGNED(char, signed short)
+PPL_ASSIGN2_SIGNED_SIGNED(char, signed int)
+PPL_ASSIGN2_SIGNED_SIGNED(char, signed long)
+PPL_ASSIGN2_SIGNED_SIGNED(char, signed long long)
+#endif
+PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed short)
+PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed int)
+PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed long)
+PPL_ASSIGN2_SIGNED_SIGNED(signed char, signed long long)
+PPL_ASSIGN2_SIGNED_SIGNED(signed short, signed int)
+PPL_ASSIGN2_SIGNED_SIGNED(signed short, signed long)
+PPL_ASSIGN2_SIGNED_SIGNED(signed short, signed long long)
+PPL_ASSIGN2_SIGNED_SIGNED(signed int, signed long)
+PPL_ASSIGN2_SIGNED_SIGNED(signed int, signed long long)
+PPL_ASSIGN2_SIGNED_SIGNED(signed long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned short)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned int)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(char, unsigned long long)
+#endif
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned short)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned int)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned char, unsigned long long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned short, unsigned int)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned short, unsigned long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned short, unsigned long long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned int, unsigned long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned int, unsigned long long)
+PPL_ASSIGN2_UNSIGNED_UNSIGNED(unsigned long, unsigned long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed short)
+PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed int)
+PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(char, signed long long)
+#endif
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed short)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed int)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned char, signed long long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned short, signed int)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned short, signed long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned short, signed long long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned int, signed long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned int, signed long long)
+PPL_ASSIGN2_UNSIGNED_SIGNED(unsigned long, signed long long)
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned char)
+PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned short)
+PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned int)
+PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(char, unsigned long long)
+#else
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, char)
+#endif
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned char)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned short)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned int)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed char, unsigned long long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned short)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned int)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed short, unsigned long long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed int, unsigned int)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed int, unsigned long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed int, unsigned long long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed long, unsigned long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed long, unsigned long long)
+PPL_ASSIGN2_SIGNED_UNSIGNED(signed long long, unsigned long long)
+
+template <typename To_Policy, typename From_Policy, typename To, typename From>
+inline Result
+assign_int_float(To& to, const From from, Rounding_Dir dir) {
+  if (is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+#if 0
+  // FIXME: this is correct but it is inefficient and breaks the build
+  // for the missing definition of static const members (a problem present
+  // also in other areas of the PPL).
+  if (CHECK_P(To_Policy::check_overflow, lt(from, Extended_Int<To_Policy, To>::min)))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  if (CHECK_P(To_Policy::check_overflow, !le(from, Extended_Int<To_Policy, To>::max)))
+    return set_pos_overflow_int<To_Policy>(to, dir);
+#else
+  if (CHECK_P(To_Policy::check_overflow, (from < Extended_Int<To_Policy, To>::min)))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  if (CHECK_P(To_Policy::check_overflow, (from > Extended_Int<To_Policy, To>::max)))
+    return set_pos_overflow_int<To_Policy>(to, dir);
+#endif
+  if (round_not_requested(dir)) {
+    to = from;
+    return V_LGE;
+  }
+  From i_from = rint(from);
+  to = i_from;
+  if (from == i_from)
+    return V_EQ;
+  if (round_direct(ROUND_UP))
+    return round_lt_int<To_Policy>(to, dir);
+  if (round_direct(ROUND_DOWN))
+    return round_gt_int<To_Policy>(to, dir);
+  if (from < i_from)
+    return round_lt_int<To_Policy>(to, dir);
+  PPL_ASSERT(from > i_from);
+  return round_gt_int<To_Policy>(to, dir);
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_int_float, char, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed char, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed short, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed int, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long long, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned char, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned short, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned int, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long, float)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long long, float)
+
+PPL_SPECIALIZE_ASSIGN(assign_int_float, char, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed char, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed short, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed int, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long long, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned char, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned short, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned int, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long, double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long long, double)
+
+PPL_SPECIALIZE_ASSIGN(assign_int_float, char, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed char, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed short, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed int, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, signed long long, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned char, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned short, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned int, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long, long double)
+PPL_SPECIALIZE_ASSIGN(assign_int_float, unsigned long long, long double)
+
+#undef PPL_ASSIGN_SIGNED
+#undef PPL_ASSIGN_UNSIGNED
+#undef PPL_ASSIGN2_SIGNED_SIGNED
+#undef PPL_ASSIGN2_UNSIGNED_UNSIGNED
+#undef PPL_ASSIGN2_UNSIGNED_SIGNED
+#undef PPL_ASSIGN2_SIGNED_UNSIGNED
+
+template <typename To_Policy, typename From_Policy, typename To>
+inline Result
+assign_signed_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
+  if (sizeof(To) <= sizeof(signed long)) {
+    if (!To_Policy::check_overflow) {
+      to = from.get_si();
+      return V_EQ;
+    }
+    if (from.fits_slong_p()) {
+      signed long v = from.get_si();
+      if (PPL_LT_SILENT(v, (Extended_Int<To_Policy, To>::min)))
+        return set_neg_overflow_int<To_Policy>(to, dir);
+      if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max)))
+        return set_pos_overflow_int<To_Policy>(to, dir);
+      to = v;
+      return V_EQ;
+    }
+  }
+  else {
+    mpz_srcptr m = from.get_mpz_t();
+    size_t sz = mpz_size(m);
+    if (sz <= sizeof(To) / sizeof(mp_limb_t)) {
+      if (sz == 0) {
+        to = 0;
+        return V_EQ;
+      }
+      To v;
+      mpz_export(&v, 0, -1, sizeof(To), 0, 0, m);
+      if (v >= 0) {
+        if (::sgn(from) < 0)
+          return neg<To_Policy, To_Policy>(to, v, dir);
+        to = v;
+        return V_EQ;
+      }
+    }
+  }
+  return (::sgn(from) < 0)
+    ? set_neg_overflow_int<To_Policy>(to, dir)
+    : set_pos_overflow_int<To_Policy>(to, dir);
+}
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, char, mpz_class)
+#endif
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed char, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed short, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed int, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed long, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_signed_int_mpz, signed long long, mpz_class)
+
+template <typename To_Policy, typename From_Policy, typename To>
+inline Result
+assign_unsigned_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_overflow, ::sgn(from) < 0))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  if (sizeof(To) <= sizeof(unsigned long)) {
+    if (!To_Policy::check_overflow) {
+      to = static_cast<To>(from.get_ui());
+      return V_EQ;
+    }
+    if (from.fits_ulong_p()) {
+      const unsigned long v = from.get_ui();
+      if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max)))
+        return set_pos_overflow_int<To_Policy>(to, dir);
+      to = static_cast<To>(v);
+      return V_EQ;
+    }
+  }
+  else {
+    const mpz_srcptr m = from.get_mpz_t();
+    const size_t sz = mpz_size(m);
+    if (sz <= sizeof(To) / sizeof(mp_limb_t)) {
+      if (sz == 0)
+        to = 0;
+      else
+        mpz_export(&to, 0, -1, sizeof(To), 0, 0, m);
+      return V_EQ;
+    }
+  }
+  return set_pos_overflow_int<To_Policy>(to, dir);
+}
+
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, char, mpz_class)
+#endif
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned char, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned short, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned int, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned long, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_unsigned_int_mpz, unsigned long long, mpz_class)
+
+template <typename To_Policy, typename From_Policy, typename To>
+inline Result
+assign_int_mpq(To& to, const mpq_class& from, Rounding_Dir dir) {
+  mpz_srcptr n = from.get_num().get_mpz_t();
+  mpz_srcptr d = from.get_den().get_mpz_t();
+  PPL_DIRTY_TEMP(mpz_class, q);
+  mpz_ptr q_z = q.get_mpz_t();
+  if (round_not_requested(dir)) {
+    mpz_tdiv_q(q_z, n, d);
+    Result r = assign<To_Policy, void>(to, q, dir);
+    if (r != V_EQ)
+      return r;
+    return V_LGE;
+  }
+  mpz_t rem;
+  int sign;
+  mpz_init(rem);
+  mpz_tdiv_qr(q_z, rem, n, d);
+  sign = mpz_sgn(rem);
+  mpz_clear(rem);
+  Result r = assign<To_Policy, void>(to, q, dir);
+  if (r != V_EQ)
+    return r;
+  switch (sign) {
+  case -1:
+    return round_lt_int<To_Policy>(to, dir);
+  case 1:
+    return round_gt_int<To_Policy>(to, dir);
+  default:
+    return V_EQ;
+  }
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, char, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed char, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed short, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed int, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed long, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, signed long long, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned char, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned short, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned int, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned long, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_int_mpq, unsigned long long, mpq_class)
+
+#if ~0 != -1
+#error "Only two's complement is supported"
+#endif
+
+#if UCHAR_MAX == 0xff
+#define CHAR_BITS 8
+#else
+#error "Unexpected max for unsigned char"
+#endif
+
+#if USHRT_MAX == 0xffff
+#define SHRT_BITS 16
+#else
+#error "Unexpected max for unsigned short"
+#endif
+
+#if UINT_MAX == 0xffffffff
+#define INT_BITS 32
+#else
+#error "Unexpected max for unsigned int"
+#endif
+
+#if ULONG_MAX == 0xffffffffUL
+#define LONG_BITS 32
+#elif ULONG_MAX == 0xffffffffffffffffULL
+#define LONG_BITS 64
+#else
+#error "Unexpected max for unsigned long"
+#endif
+
+#if ULLONG_MAX == 0xffffffffffffffffULL
+#define LONG_LONG_BITS 64
+#else
+#error "Unexpected max for unsigned long long"
+#endif
+
+
+template <typename T>
+struct Larger;
+
+// The following may be tuned for performance on specific architectures.
+//
+// Current guidelines:
+//   - avoid division where possible (larger type variant for mul)
+//   - use larger type variant for types smaller than architecture bit size
+
+template <>
+struct Larger<char> {
+  const_bool_nodef(use_for_neg, true);
+  const_bool_nodef(use_for_add, true);
+  const_bool_nodef(use_for_sub, true);
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast16_t type_for_neg;
+  typedef int_fast16_t type_for_add;
+  typedef int_fast16_t type_for_sub;
+  typedef int_fast16_t type_for_mul;
+};
+
+template <>
+struct Larger<signed char> {
+  const_bool_nodef(use_for_neg, true);
+  const_bool_nodef(use_for_add, true);
+  const_bool_nodef(use_for_sub, true);
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast16_t type_for_neg;
+  typedef int_fast16_t type_for_add;
+  typedef int_fast16_t type_for_sub;
+  typedef int_fast16_t type_for_mul;
+};
+
+template <>
+struct Larger<unsigned char> {
+  const_bool_nodef(use_for_neg, true);
+  const_bool_nodef(use_for_add, true);
+  const_bool_nodef(use_for_sub, true);
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast16_t type_for_neg;
+  typedef uint_fast16_t type_for_add;
+  typedef int_fast16_t type_for_sub;
+  typedef uint_fast16_t type_for_mul;
+};
+
+template <>
+struct Larger<signed short> {
+  const_bool_nodef(use_for_neg, true);
+  const_bool_nodef(use_for_add, true);
+  const_bool_nodef(use_for_sub, true);
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast32_t type_for_neg;
+  typedef int_fast32_t type_for_add;
+  typedef int_fast32_t type_for_sub;
+  typedef int_fast32_t type_for_mul;
+};
+
+template <>
+struct Larger<unsigned short> {
+  const_bool_nodef(use_for_neg, true);
+  const_bool_nodef(use_for_add, true);
+  const_bool_nodef(use_for_sub, true);
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast32_t type_for_neg;
+  typedef uint_fast32_t type_for_add;
+  typedef int_fast32_t type_for_sub;
+  typedef uint_fast32_t type_for_mul;
+};
+
+template <>
+struct Larger<signed int> {
+  const_bool_nodef(use_for_neg, (LONG_BITS == 64));
+  const_bool_nodef(use_for_add, (LONG_BITS == 64));
+  const_bool_nodef(use_for_sub, (LONG_BITS == 64));
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast64_t type_for_neg;
+  typedef int_fast64_t type_for_add;
+  typedef int_fast64_t type_for_sub;
+  typedef int_fast64_t type_for_mul;
+};
+
+template <>
+struct Larger<unsigned int> {
+  const_bool_nodef(use_for_neg, (LONG_BITS == 64));
+  const_bool_nodef(use_for_add, (LONG_BITS == 64));
+  const_bool_nodef(use_for_sub, (LONG_BITS == 64));
+  const_bool_nodef(use_for_mul, true);
+  typedef int_fast64_t type_for_neg;
+  typedef uint_fast64_t type_for_add;
+  typedef int_fast64_t type_for_sub;
+  typedef uint_fast64_t type_for_mul;
+};
+
+template <>
+struct Larger<signed long> {
+  const_bool_nodef(use_for_neg, false);
+  const_bool_nodef(use_for_add, false);
+  const_bool_nodef(use_for_sub, false);
+  const_bool_nodef(use_for_mul, (LONG_BITS == 32));
+  typedef int_fast64_t type_for_neg;
+  typedef int_fast64_t type_for_add;
+  typedef int_fast64_t type_for_sub;
+  typedef int_fast64_t type_for_mul;
+};
+
+template <>
+struct Larger<unsigned long> {
+  const_bool_nodef(use_for_neg, false);
+  const_bool_nodef(use_for_add, false);
+  const_bool_nodef(use_for_sub, false);
+  const_bool_nodef(use_for_mul, (LONG_BITS == 32));
+  typedef int_fast64_t type_for_neg;
+  typedef uint_fast64_t type_for_add;
+  typedef int_fast64_t type_for_sub;
+  typedef uint_fast64_t type_for_mul;
+};
+
+template <>
+struct Larger<signed long long> {
+  const_bool_nodef(use_for_neg, false);
+  const_bool_nodef(use_for_add, false);
+  const_bool_nodef(use_for_sub, false);
+  const_bool_nodef(use_for_mul, false);
+  typedef int_fast64_t type_for_neg;
+  typedef int_fast64_t type_for_add;
+  typedef int_fast64_t type_for_sub;
+  typedef int_fast64_t type_for_mul;
+};
+
+template <>
+struct Larger<unsigned long long> {
+  const_bool_nodef(use_for_neg, false);
+  const_bool_nodef(use_for_add, false);
+  const_bool_nodef(use_for_sub, false);
+  const_bool_nodef(use_for_mul, false);
+  typedef int_fast64_t type_for_neg;
+  typedef uint_fast64_t type_for_add;
+  typedef int_fast64_t type_for_sub;
+  typedef uint_fast64_t type_for_mul;
+};
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+neg_int_larger(Type& to, const Type x, Rounding_Dir dir) {
+  typename Larger<Type>::type_for_neg l = x;
+  l = -l;
+  return assign<To_Policy, To_Policy>(to, l, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+add_int_larger(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  typename Larger<Type>::type_for_add l = x;
+  l += y;
+  return assign<To_Policy, To_Policy>(to, l, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+sub_int_larger(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  typename Larger<Type>::type_for_sub l = x;
+  l -= y;
+  return assign<To_Policy, To_Policy>(to, l, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+mul_int_larger(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  typename Larger<Type>::type_for_mul l = x;
+  l *= y;
+  return assign<To_Policy, To_Policy>(to, l, dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+neg_signed_int(Type& to, const Type from, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_neg)
+    return neg_int_larger<To_Policy, From_Policy>(to, from, dir);
+  if (CHECK_P(To_Policy::check_overflow,
+              (from < -Extended_Int<To_Policy, Type>::max)))
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  to = -from;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+neg_unsigned_int(Type& to, const Type from, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_neg)
+    return neg_int_larger<To_Policy, From_Policy>(to, from, dir);
+  if (CHECK_P(To_Policy::check_overflow, from != 0))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  to = from;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+add_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_add)
+    return add_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+  if (To_Policy::check_overflow) {
+    if (y >= 0) {
+      if (x > Extended_Int<To_Policy, Type>::max - y)
+        return set_pos_overflow_int<To_Policy>(to, dir);
+    }
+    else if (x < Extended_Int<To_Policy, Type>::min - y)
+      return set_neg_overflow_int<To_Policy>(to, dir);
+  }
+  to = x + y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+add_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_add)
+    return add_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+  if (CHECK_P(To_Policy::check_overflow,
+              (x > Extended_Int<To_Policy, Type>::max - y)))
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  to = x + y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+sub_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_sub)
+    return sub_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+  if (To_Policy::check_overflow) {
+    if (y >= 0) {
+      if (x < Extended_Int<To_Policy, Type>::min + y)
+        return set_neg_overflow_int<To_Policy>(to, dir);
+    }
+    else if (x > Extended_Int<To_Policy, Type>::max + y)
+      return set_pos_overflow_int<To_Policy>(to, dir);
+  }
+  to = x - y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+sub_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_sub)
+    return sub_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+  if (CHECK_P(To_Policy::check_overflow,
+              (x < Extended_Int<To_Policy, Type>::min + y)))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  to = x - y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+mul_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_mul)
+    return mul_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+  if (!To_Policy::check_overflow) {
+    to = x * y;
+    return V_EQ;
+  }
+  if (y == 0) {
+    to = 0;
+    return V_EQ;
+  }
+  if (y == -1)
+    return neg_signed_int<To_Policy, From1_Policy>(to, x, dir);
+  if (x >= 0) {
+    if (y > 0) {
+      if (x > Extended_Int<To_Policy, Type>::max / y)
+        return set_pos_overflow_int<To_Policy>(to, dir);
+    }
+    else {
+      if (x > Extended_Int<To_Policy, Type>::min / y)
+        return set_neg_overflow_int<To_Policy>(to, dir);
+    }
+  }
+  else {
+    if (y < 0) {
+      if (x < Extended_Int<To_Policy, Type>::max / y)
+        return set_pos_overflow_int<To_Policy>(to, dir);
+    }
+    else {
+      if (x < Extended_Int<To_Policy, Type>::min / y)
+        return set_neg_overflow_int<To_Policy>(to, dir);
+    }
+  }
+  to = x * y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+mul_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (To_Policy::check_overflow && Larger<Type>::use_for_mul)
+    return mul_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
+  if (!To_Policy::check_overflow) {
+    to = x * y;
+    return V_EQ;
+  }
+  if (y == 0) {
+    to = 0;
+    return V_EQ;
+  }
+  if (x > Extended_Int<To_Policy, Type>::max / y)
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  to = x * y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+div_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  if (To_Policy::check_overflow && y == -1)
+    return neg_signed_int<To_Policy, From1_Policy>(to, x, dir);
+  to = x / y;
+  if (round_not_requested(dir))
+    return V_LGE;
+  if (y == -1)
+    return V_EQ;
+  Type m = x % y;
+  if (m < 0)
+    return round_lt_int_no_overflow<To_Policy>(to, dir);
+  else if (m > 0)
+    return round_gt_int_no_overflow<To_Policy>(to, dir);
+  else
+    return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+div_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  to = x / y;
+  if (round_not_requested(dir))
+    return V_GE;
+  Type m = x % y;
+  if (m == 0)
+    return V_EQ;
+  return round_gt_int<To_Policy>(to, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+idiv_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  if (To_Policy::check_overflow && y == -1)
+    return neg_signed_int<To_Policy, From1_Policy>(to, x, dir);
+  to = x / y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+idiv_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  to = x / y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+rem_signed_int(Type& to, const Type x, const Type y, Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
+    return assign_nan<To_Policy>(to, V_MOD_ZERO);
+  }
+  to = (y == -1) ? 0 : (x % y);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+rem_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, y == 0)) {
+    return assign_nan<To_Policy>(to, V_MOD_ZERO);
+  }
+  to = x % y;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+div_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
+                      Rounding_Dir dir) {
+  if (exp >= sizeof_to_bits(sizeof(Type))) {
+    to = 0;
+    if (round_not_requested(dir))
+      return V_GE;
+    if (x == 0)
+      return V_EQ;
+    return round_gt_int_no_overflow<To_Policy>(to, dir);
+  }
+  to = x >> exp;
+  if (round_not_requested(dir))
+    return V_GE;
+  if (x & ((Type(1) << exp) - 1))
+    return round_gt_int_no_overflow<To_Policy>(to, dir);
+  else
+    return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+div_2exp_signed_int(Type& to, const Type x, unsigned int exp,
+                    Rounding_Dir dir) {
+  if (x < 0) {
+    if (exp >= sizeof_to_bits(sizeof(Type))) {
+      to = 0;
+      if (round_not_requested(dir))
+        return V_LE;
+      return round_lt_int_no_overflow<To_Policy>(to, dir);
+    }
+    typedef typename C_Integer<Type>::other_type UType;
+    UType ux = x;
+    ux = -ux;
+    to = ~Type(~-(ux >> exp));
+    if (round_not_requested(dir))
+      return V_LE;
+    if (ux & ((UType(1) << exp) -1))
+      return round_lt_int_no_overflow<To_Policy>(to, dir);
+    return V_EQ;
+  }
+  else {
+    if (exp >= sizeof_to_bits(sizeof(Type)) - 1) {
+      to = 0;
+      if (round_not_requested(dir))
+        return V_GE;
+      if (x == 0)
+        return V_EQ;
+      return round_gt_int_no_overflow<To_Policy>(to, dir);
+    }
+    to = x >> exp;
+    if (round_not_requested(dir))
+      return V_GE;
+    if (x & ((Type(1) << exp) - 1))
+      return round_gt_int_no_overflow<To_Policy>(to, dir);
+    else
+      return V_EQ;
+  }
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+add_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
+                      Rounding_Dir dir) {
+  if (!To_Policy::check_overflow) {
+    to = x + (Type(1) << exp);
+    return V_EQ;
+  }
+  if (exp >= sizeof_to_bits(sizeof(Type)))
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  Type n = Type(1) << exp;
+  return add_unsigned_int<To_Policy, From_Policy, void>(to, x, n, dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+add_2exp_signed_int(Type& to, const Type x, unsigned int exp,
+                    Rounding_Dir dir) {
+  if (!To_Policy::check_overflow) {
+    to = x + (Type(1) << exp);
+    return V_EQ;
+  }
+  if (exp >= sizeof_to_bits(sizeof(Type)))
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  if (exp == sizeof_to_bits(sizeof(Type)) - 1) {
+    Type n = -2 * (Type(1) << (exp - 1));
+    return sub_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
+  }
+  else {
+    Type n = Type(1) << exp;
+    return add_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+sub_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
+                      Rounding_Dir dir) {
+  if (!To_Policy::check_overflow) {
+    to = x - (Type(1) << exp);
+    return V_EQ;
+  }
+  if (exp >= sizeof_to_bits(sizeof(Type)))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  Type n = Type(1) << exp;
+  return sub_unsigned_int<To_Policy, From_Policy, void>(to, x, n, dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+sub_2exp_signed_int(Type& to, const Type x, unsigned int exp,
+                    Rounding_Dir dir) {
+  if (!To_Policy::check_overflow) {
+    to = x - (Type(1) << exp);
+    return V_EQ;
+  }
+  if (exp >= sizeof_to_bits(sizeof(Type)))
+    return set_neg_overflow_int<To_Policy>(to, dir);
+  if (exp == sizeof_to_bits(sizeof(Type)) - 1) {
+    Type n = -2 * (Type(1) << (exp - 1));
+    return add_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
+  }
+  else {
+    Type n = Type(1) << exp;
+    return sub_signed_int<To_Policy, From_Policy, void>(to, x, n, dir);
+  }
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+mul_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
+                      Rounding_Dir dir) {
+  if (!To_Policy::check_overflow) {
+    to = x << exp;
+    return V_EQ;
+  }
+  if (exp >= sizeof_to_bits(sizeof(Type))) {
+    if (x == 0) {
+      to = 0;
+      return V_EQ;
+    }
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  }
+  if (x > Extended_Int<To_Policy, Type>::max >> exp)
+    return set_pos_overflow_int<To_Policy>(to, dir);
+  to = x << exp;
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+mul_2exp_signed_int(Type& to, const Type x, unsigned int exp,
+                    Rounding_Dir dir) {
+  if (x < 0) {
+    if (!To_Policy::check_overflow) {
+      to = x * (Type(1) << exp);
+      return V_EQ;
+    }
+    if (exp >= sizeof_to_bits(sizeof(Type)))
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    typedef typename C_Integer<Type>::other_type UType;
+    UType mask = UType(-1) << (sizeof_to_bits(sizeof(Type)) - exp - 1);
+    UType ux = x;
+    if ((ux & mask) != mask)
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    ux <<= exp;
+    Type n = ~(Type(~ux));
+    if (PPL_LT_SILENT(n, (Extended_Int<To_Policy, Type>::min)))
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    to = n;
+  }
+  else {
+    if (!To_Policy::check_overflow) {
+      to = x << exp;
+      return V_EQ;
+    }
+    if (exp >= sizeof_to_bits(sizeof(Type)) - 1) {
+      if (x == 0) {
+        to = 0;
+        return V_EQ;
+      }
+      return set_pos_overflow_int<To_Policy>(to, dir);
+    }
+    if (x > Extended_Int<To_Policy, Type>::max >> exp)
+      return set_pos_overflow_int<To_Policy>(to, dir);
+    to = x << exp;
+  }
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+smod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
+                       Rounding_Dir dir) {
+  if (exp > sizeof_to_bits(sizeof(Type)))
+    to = x;
+  else {
+    Type v = (exp == sizeof_to_bits(sizeof(Type)) ? x : (x & ((Type(1) << exp) - 1)));
+    if (v >= (Type(1) << (exp - 1)))
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    else
+      to = v;
+  }
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+smod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
+                     Rounding_Dir) {
+  if (exp >= sizeof_to_bits(sizeof(Type)))
+    to = x;
+  else {
+    Type m = Type(1) << (exp - 1);
+    to = (x & (m - 1)) - (x & m);
+  }
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+umod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
+                       Rounding_Dir) {
+  if (exp >= sizeof_to_bits(sizeof(Type)))
+    to = x;
+  else
+    to = x & ((Type(1) << exp) - 1);
+  return V_EQ;
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+umod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
+                     Rounding_Dir dir) {
+  if (exp >= sizeof_to_bits(sizeof(Type))) {
+    if (x < 0)
+      return set_pos_overflow_int<To_Policy>(to, dir);
+    to = x;
+  }
+  else
+    to = x & ((Type(1) << exp) - 1);
+  return V_EQ;
+}
+
+template <typename Type>
+inline void
+isqrt_rem(Type& q, Type& r, const Type from) {
+  q = 0;
+  r = from;
+  Type t(1);
+  for (t <<= sizeof_to_bits(sizeof(Type)) - 2; t != 0; t >>= 2) {
+    Type s = q + t;
+    if (s <= r) {
+      r -= s;
+      q = s + t;
+    }
+    q >>= 1;
+  }
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+sqrt_unsigned_int(Type& to, const Type from, Rounding_Dir dir) {
+  Type rem;
+  isqrt_rem(to, rem, from);
+  if (round_not_requested(dir))
+    return V_GE;
+  if (rem == 0)
+    return V_EQ;
+  return round_gt_int<To_Policy>(to, dir);
+}
+
+template <typename To_Policy, typename From_Policy, typename Type>
+inline Result
+sqrt_signed_int(Type& to, const Type from, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_sqrt_neg, from < 0)) {
+    return assign_nan<To_Policy>(to, V_SQRT_NEG);
+  }
+  return sqrt_unsigned_int<To_Policy, From_Policy>(to, from, dir);
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+add_mul_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  Type z;
+  Result r = mul<To_Policy, From1_Policy, From2_Policy>(z, x, y, dir);
+  switch (result_overflow(r)) {
+  case 0:
+    return add<To_Policy, To_Policy, To_Policy>(to, to, z, dir);
+  case -1:
+    if (to <= 0)
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    return assign_nan<To_Policy>(to, V_UNKNOWN_NEG_OVERFLOW);
+  case 1:
+    if (to >= 0)
+      return set_pos_overflow_int<To_Policy>(to, dir);
+    return assign_nan<To_Policy>(to, V_UNKNOWN_POS_OVERFLOW);
+  default:
+    PPL_UNREACHABLE;
+    return V_NAN;
+  }
+}
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy,
+          typename Type>
+inline Result
+sub_mul_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
+  Type z;
+  Result r = mul<To_Policy, From1_Policy, From2_Policy>(z, x, y, dir);
+  switch (result_overflow(r)) {
+  case 0:
+    return sub<To_Policy, To_Policy, To_Policy>(to, to, z, dir);
+  case -1:
+    if (to >= 0)
+      return set_pos_overflow_int<To_Policy>(to, dir);
+    return assign_nan<To_Policy>(to, V_UNKNOWN_NEG_OVERFLOW);
+  case 1:
+    if (to <= 0)
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    return assign_nan<To_Policy>(to, V_UNKNOWN_POS_OVERFLOW);
+  default:
+    PPL_UNREACHABLE;
+    return V_NAN;
+  }
+}
+
+template <typename Policy, typename Type>
+inline Result
+output_char(std::ostream& os, Type& from,
+            const Numeric_Format&, Rounding_Dir) {
+  os << int(from);
+  return V_EQ;
+}
+
+template <typename Policy, typename Type>
+inline Result
+output_int(std::ostream& os, Type& from, const Numeric_Format&, Rounding_Dir) {
+  os << from;
+  return V_EQ;
+}
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed char, signed char)
+PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed short, signed short)
+PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed int, signed int)
+PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed long, signed long)
+PPL_SPECIALIZE_FLOOR(assign_signed_int_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_FLOOR(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed char, signed char)
+PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed short, signed short)
+PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed int, signed int)
+PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed long, signed long)
+PPL_SPECIALIZE_CEIL(assign_signed_int_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_CEIL(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed char, signed char)
+PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed short, signed short)
+PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed int, signed int)
+PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed long, signed long)
+PPL_SPECIALIZE_TRUNC(assign_signed_int_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_TRUNC(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_NEG(neg_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_NEG(neg_signed_int, signed char, signed char)
+PPL_SPECIALIZE_NEG(neg_signed_int, signed short, signed short)
+PPL_SPECIALIZE_NEG(neg_signed_int, signed int, signed int)
+PPL_SPECIALIZE_NEG(neg_signed_int, signed long, signed long)
+PPL_SPECIALIZE_NEG(neg_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_NEG(neg_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_NEG(neg_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ADD(add_signed_int, char, char, char)
+#endif
+PPL_SPECIALIZE_ADD(add_signed_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_ADD(add_signed_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_ADD(add_signed_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_ADD(add_signed_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_ADD(add_signed_int, signed long long, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ADD(add_unsigned_int, char, char, char)
+#endif
+PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_ADD(add_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SUB(sub_signed_int, char, char, char)
+#endif
+PPL_SPECIALIZE_SUB(sub_signed_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_SUB(sub_signed_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_SUB(sub_signed_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_SUB(sub_signed_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_SUB(sub_signed_int, signed long long, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SUB(sub_unsigned_int, char, char, char)
+#endif
+PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_SUB(sub_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_MUL(mul_signed_int, char, char, char)
+#endif
+PPL_SPECIALIZE_MUL(mul_signed_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_MUL(mul_signed_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_MUL(mul_signed_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_MUL(mul_signed_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_MUL(mul_signed_int, signed long long, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_MUL(mul_unsigned_int, char, char, char)
+#endif
+PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_MUL(mul_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_DIV(div_signed_int, char, char, char)
+#endif
+PPL_SPECIALIZE_DIV(div_signed_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_DIV(div_signed_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_DIV(div_signed_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_DIV(div_signed_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_DIV(div_signed_int, signed long long, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_DIV(div_unsigned_int, char, char, char)
+#endif
+PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_DIV(div_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_IDIV(idiv_signed_int, char, char, char)
+#endif
+PPL_SPECIALIZE_IDIV(idiv_signed_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_IDIV(idiv_signed_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_IDIV(idiv_signed_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_IDIV(idiv_signed_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_IDIV(idiv_signed_int, signed long long, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_IDIV(idiv_unsigned_int, char, char, char)
+#endif
+PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_IDIV(idiv_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_REM(rem_signed_int, char, char, char)
+#endif
+PPL_SPECIALIZE_REM(rem_signed_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_REM(rem_signed_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_REM(rem_signed_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_REM(rem_signed_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_REM(rem_signed_int, signed long long, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_REM(rem_unsigned_int, char, char, char)
+#endif
+PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_REM(rem_unsigned_int, unsigned long long, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed char, signed char)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed short, signed short)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed int, signed int)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed long, signed long)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed char, signed char)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed short, signed short)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed int, signed int)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed long, signed long)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed char, signed char)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed short, signed short)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed int, signed int)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed long, signed long)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed char, signed char)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed short, signed short)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed int, signed int)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed long, signed long)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed char, signed char)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed short, signed short)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed int, signed int)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed long, signed long)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed char, signed char)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed short, signed short)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed int, signed int)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed long, signed long)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SQRT(sqrt_signed_int, char, char)
+#endif
+PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed char, signed char)
+PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed short, signed short)
+PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed int, signed int)
+PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed long, signed long)
+PPL_SPECIALIZE_SQRT(sqrt_signed_int, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_SQRT(sqrt_unsigned_int, unsigned long long, unsigned long long)
+
+#if PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ABS(abs_generic, char, char)
+#endif
+PPL_SPECIALIZE_ABS(abs_generic, signed char, signed char)
+PPL_SPECIALIZE_ABS(abs_generic, signed short, signed short)
+PPL_SPECIALIZE_ABS(abs_generic, signed int, signed int)
+PPL_SPECIALIZE_ABS(abs_generic, signed long, signed long)
+PPL_SPECIALIZE_ABS(abs_generic, signed long long, signed long long)
+#if !PPL_CXX_PLAIN_CHAR_IS_SIGNED
+PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, char, char)
+#endif
+PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned char, unsigned char)
+PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned short, unsigned short)
+PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned int, unsigned int)
+PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned long, unsigned long)
+PPL_SPECIALIZE_ABS(assign_unsigned_int_unsigned_int, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_GCD(gcd_exact, char, char, char)
+PPL_SPECIALIZE_GCD(gcd_exact, signed char, signed char, signed char)
+PPL_SPECIALIZE_GCD(gcd_exact, signed short, signed short, signed short)
+PPL_SPECIALIZE_GCD(gcd_exact, signed int, signed int, signed int)
+PPL_SPECIALIZE_GCD(gcd_exact, signed long, signed long, signed long)
+PPL_SPECIALIZE_GCD(gcd_exact, signed long long, signed long long, signed long long)
+PPL_SPECIALIZE_GCD(gcd_exact, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_GCD(gcd_exact, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_GCD(gcd_exact, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_GCD(gcd_exact, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_GCD(gcd_exact, unsigned long long, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, char, char, char, char, char)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed char, signed char, signed char, signed char, signed char)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed short, signed short, signed short, signed short, signed short)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed int, signed int, signed int, signed int, signed int)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed long, signed long, signed long, signed long, signed long)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, signed long long, signed long long, signed long long, signed long long, signed long long)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned char, unsigned char, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned short, unsigned short, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned int, unsigned int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned long, unsigned long, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_GCDEXT(gcdext_exact, unsigned long long, unsigned long long, unsigned long long, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, char, char, char)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed char, signed char, signed char)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed short, signed short, signed short)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed int, signed int, signed int)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed long, signed long, signed long)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, signed long long, signed long long, signed long long)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_LCM(lcm_gcd_exact, unsigned long long, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_SGN(sgn_generic, char)
+PPL_SPECIALIZE_SGN(sgn_generic, signed char)
+PPL_SPECIALIZE_SGN(sgn_generic, signed short)
+PPL_SPECIALIZE_SGN(sgn_generic, signed int)
+PPL_SPECIALIZE_SGN(sgn_generic, signed long)
+PPL_SPECIALIZE_SGN(sgn_generic, signed long long)
+PPL_SPECIALIZE_SGN(sgn_generic, unsigned char)
+PPL_SPECIALIZE_SGN(sgn_generic, unsigned short)
+PPL_SPECIALIZE_SGN(sgn_generic, unsigned int)
+PPL_SPECIALIZE_SGN(sgn_generic, unsigned long)
+PPL_SPECIALIZE_SGN(sgn_generic, unsigned long long)
+
+PPL_SPECIALIZE_CMP(cmp_generic, char, char)
+PPL_SPECIALIZE_CMP(cmp_generic, signed char, signed char)
+PPL_SPECIALIZE_CMP(cmp_generic, signed short, signed short)
+PPL_SPECIALIZE_CMP(cmp_generic, signed int, signed int)
+PPL_SPECIALIZE_CMP(cmp_generic, signed long, signed long)
+PPL_SPECIALIZE_CMP(cmp_generic, signed long long, signed long long)
+PPL_SPECIALIZE_CMP(cmp_generic, unsigned char, unsigned char)
+PPL_SPECIALIZE_CMP(cmp_generic, unsigned short, unsigned short)
+PPL_SPECIALIZE_CMP(cmp_generic, unsigned int, unsigned int)
+PPL_SPECIALIZE_CMP(cmp_generic, unsigned long, unsigned long)
+PPL_SPECIALIZE_CMP(cmp_generic, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, char, char, char)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, signed long long, signed long long, signed long long)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_ADD_MUL(add_mul_int, unsigned long long, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, char, char, char)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed char, signed char, signed char)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed short, signed short, signed short)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed int, signed int, signed int)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed long, signed long, signed long)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, signed long long, signed long long, signed long long)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned char, unsigned char, unsigned char)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned short, unsigned short, unsigned short)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned int, unsigned int, unsigned int)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned long, unsigned long, unsigned long)
+PPL_SPECIALIZE_SUB_MUL(sub_mul_int, unsigned long long, unsigned long long, unsigned long long)
+
+PPL_SPECIALIZE_INPUT(input_generic, char)
+PPL_SPECIALIZE_INPUT(input_generic, signed char)
+PPL_SPECIALIZE_INPUT(input_generic, signed short)
+PPL_SPECIALIZE_INPUT(input_generic, signed int)
+PPL_SPECIALIZE_INPUT(input_generic, signed long)
+PPL_SPECIALIZE_INPUT(input_generic, signed long long)
+PPL_SPECIALIZE_INPUT(input_generic, unsigned char)
+PPL_SPECIALIZE_INPUT(input_generic, unsigned short)
+PPL_SPECIALIZE_INPUT(input_generic, unsigned int)
+PPL_SPECIALIZE_INPUT(input_generic, unsigned long)
+PPL_SPECIALIZE_INPUT(input_generic, unsigned long long)
+
+PPL_SPECIALIZE_OUTPUT(output_char, char)
+PPL_SPECIALIZE_OUTPUT(output_char, signed char)
+PPL_SPECIALIZE_OUTPUT(output_int, signed short)
+PPL_SPECIALIZE_OUTPUT(output_int, signed int)
+PPL_SPECIALIZE_OUTPUT(output_int, signed long)
+PPL_SPECIALIZE_OUTPUT(output_int, signed long long)
+PPL_SPECIALIZE_OUTPUT(output_char, unsigned char)
+PPL_SPECIALIZE_OUTPUT(output_int, unsigned short)
+PPL_SPECIALIZE_OUTPUT(output_int, unsigned int)
+PPL_SPECIALIZE_OUTPUT(output_int, unsigned long)
+PPL_SPECIALIZE_OUTPUT(output_int, unsigned long long)
+
+} // namespace Checked
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_checked_int_inlines_hh)
diff --git a/src/checked_mpq.inlines.hh b/src/checked_mpq.inlines.hh
deleted file mode 100644
index 43261dc..0000000
--- a/src/checked_mpq.inlines.hh
+++ /dev/null
@@ -1,542 +0,0 @@
-/* Specialized "checked" functions for GMP's mpq_class numbers.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_mpq_inlines_hh
-#define PPL_checked_mpq_inlines_hh 1
-
-#include <sstream>
-#include <climits>
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Checked {
-
-template <typename Policy>
-inline Result
-classify_mpq(const mpq_class& v, bool nan, bool inf, bool sign) {
-  if ((Policy::has_nan || Policy::has_infinity)
-      && ::sgn(v.get_den()) == 0) {
-    int s = ::sgn(v.get_num());
-    if (Policy::has_nan && (nan || sign) && s == 0)
-      return V_NAN;
-    if (!inf && !sign)
-      return V_LGE;
-    if (Policy::has_infinity) {
-      if (s < 0)
-	return inf ? V_EQ_MINUS_INFINITY : V_LT;
-      if (s > 0)
-	return inf ? V_EQ_PLUS_INFINITY : V_GT;
-    }
-  }
-  if (sign)
-    return static_cast<Result>(sgn<Policy>(v));
-  return V_LGE;
-}
-
-PPL_SPECIALIZE_CLASSIFY(classify_mpq, mpq_class)
-
-template <typename Policy>
-inline bool
-is_nan_mpq(const mpq_class& v) {
-  return Policy::has_nan
-    && ::sgn(v.get_den()) == 0
-    && ::sgn(v.get_num()) == 0;
-}
-
-PPL_SPECIALIZE_IS_NAN(is_nan_mpq, mpq_class)
-
-template <typename Policy>
-inline bool
-is_minf_mpq(const mpq_class& v) {
-  return Policy::has_infinity
-    && ::sgn(v.get_den()) == 0
-    && ::sgn(v.get_num()) < 0;
-}
-
-PPL_SPECIALIZE_IS_MINF(is_minf_mpq, mpq_class)
-
-template <typename Policy>
-inline bool
-is_pinf_mpq(const mpq_class& v) {
-  return Policy::has_infinity
-    && ::sgn(v.get_den()) == 0
-    && ::sgn(v.get_num()) > 0;
-}
-
-PPL_SPECIALIZE_IS_PINF(is_pinf_mpq, mpq_class)
-
-template <typename Policy>
-inline bool
-is_int_mpq(const mpq_class& v) {
-  if ((Policy::has_infinity || Policy::has_nan)
-      && ::sgn(v.get_den()) == 0)
-    return !(Policy::has_nan && ::sgn(v.get_num()) == 0);
-  else
-    return v.get_den() == 1;
-}
-
-PPL_SPECIALIZE_IS_INT(is_int_mpq, mpq_class)
-
-template <typename Policy>
-inline Result
-assign_special_mpq(mpq_class& v, Result_Class c, Rounding_Dir) {
-  switch (c) {
-  case VC_NAN:
-    if (Policy::has_nan) {
-      v.get_num() = 0;
-      v.get_den() = 0;
-      return V_NAN | V_UNREPRESENTABLE;
-    }
-    return V_NAN;
-  case VC_MINUS_INFINITY:
-    if (Policy::has_infinity) {
-      v.get_num() = -1;
-      v.get_den() = 0;
-      return V_EQ_MINUS_INFINITY;
-    }
-    return V_EQ_MINUS_INFINITY | V_UNREPRESENTABLE;
-  case VC_PLUS_INFINITY:
-    if (Policy::has_infinity) {
-      v.get_num() = 1;
-      v.get_den() = 0;
-      return V_EQ_PLUS_INFINITY;
-    }
-    return V_EQ_PLUS_INFINITY | V_UNREPRESENTABLE;
-  default:
-    PPL_UNREACHABLE;
-    return V_NAN | V_UNREPRESENTABLE;
-  }
-}
-
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_mpq, mpq_class)
-
-PPL_SPECIALIZE_COPY(copy_generic, mpq_class)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-construct_mpq_base(mpq_class& to, const From& from, Rounding_Dir) {
-  new (&to) mpq_class(from);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, mpz_class)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, char)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed char)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed short)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed int)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed long)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned char)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned short)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned int)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-construct_mpq_float(mpq_class& to, const From& from, Rounding_Dir dir) {
-  if (is_nan<From_Policy>(from))
-    return construct_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(from))
-    return construct_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(from))
-    return construct_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  new (&to) mpq_class(from);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_float, mpq_class, float)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpq_float, mpq_class, double)
-
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, mpq_class)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, char)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed char)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed short)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed int)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed long)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned char)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned short)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned int)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpq_float(mpq_class& to, const From& from, Rounding_Dir dir) {
-  if (is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  assign_mpq_numeric_float(to, from);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpq_float, mpq_class, float)
-PPL_SPECIALIZE_ASSIGN(assign_mpq_float, mpq_class, double)
-PPL_SPECIALIZE_ASSIGN(assign_mpq_float, mpq_class, long double)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpq_signed_int(mpq_class& to, const From from, Rounding_Dir) {
-  if (sizeof(From) <= sizeof(signed long))
-    to = static_cast<signed long>(from);
-  else {
-    mpz_ptr m = to.get_num().get_mpz_t();
-    if (from >= 0)
-      mpz_import(m, 1, 1, sizeof(From), 0, 0, &from);
-    else {
-      From n = -from;
-      mpz_import(m, 1, 1, sizeof(From), 0, 0, &n);
-      mpz_neg(m, m);
-    }
-    to.get_den() = 1;
-  }
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpq_signed_int, mpq_class, signed long long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpq_unsigned_int(mpq_class& to, const From from, Rounding_Dir) {
-  if (sizeof(From) <= sizeof(unsigned long))
-    to = static_cast<unsigned long>(from);
-  else {
-    mpz_import(to.get_num().get_mpz_t(), 1, 1, sizeof(From), 0, 0, &from);
-    to.get_den() = 1;
-  }
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpq_unsigned_int, mpq_class, unsigned long long)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-floor_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
-  mpz_fdiv_q(to.get_num().get_mpz_t(),
-	     from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
-  to.get_den() = 1;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_FLOOR(floor_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-ceil_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
-  mpz_cdiv_q(to.get_num().get_mpz_t(),
-	     from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
-  to.get_den() = 1;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_CEIL(ceil_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-trunc_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
-  mpz_tdiv_q(to.get_num().get_mpz_t(),
-	     from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
-  to.get_den() = 1;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_TRUNC(trunc_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-neg_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
-  mpq_neg(to.get_mpq_t(), from.get_mpq_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_NEG(neg_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-add_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
-  to = x + y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ADD(add_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-sub_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
-  to = x - y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SUB(sub_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
-  to = x * y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_MUL(mul_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-div_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, sgn(y) == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  to = x / y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_DIV(div_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-idiv_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_div_zero, sgn(y) == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  to = x / y;
-  return trunc<To_Policy, To_Policy>(to, to, dir);
-}
-
-PPL_SPECIALIZE_IDIV(idiv_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-rem_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, sgn(y) == 0)) {
-    return assign_nan<To_Policy>(to, V_MOD_ZERO);
-  }
-  PPL_DIRTY_TEMP(mpq_class, tmp);
-  tmp = x / y;
-  tmp.get_num() %= tmp.get_den();
-  to = tmp * y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_REM(rem_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-add_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-             Rounding_Dir) {
-  PPL_DIRTY_TEMP(mpz_class, v);
-  v = 1;
-  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
-  to = x + v;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-sub_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-             Rounding_Dir) {
-  PPL_DIRTY_TEMP(mpz_class, v);
-  v = 1;
-  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
-  to = x - v;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-mul_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-             Rounding_Dir) {
-  mpz_mul_2exp(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), exp);
-  to.get_den() = x.get_den();
-  to.canonicalize();
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-div_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-             Rounding_Dir) {
-  to.get_num() = x.get_num();
-  mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
-  to.canonicalize();
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-smod_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-	      Rounding_Dir) {
-  mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
-  mpz_fdiv_r(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), to.get_den().get_mpz_t());
-  mpz_fdiv_q_2exp(to.get_den().get_mpz_t(), to.get_den().get_mpz_t(), 1);
-  bool neg = to.get_num() >= to.get_den();
-  mpz_mul_2exp(to.get_den().get_mpz_t(), to.get_den().get_mpz_t(), 1);
-  if (neg)
-    to.get_num() -= to.get_den();
-  mpz_mul_2exp(to.get_num().get_mpz_t(), to.get_num().get_mpz_t(), exp);
-  to.canonicalize();
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-umod_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-	      Rounding_Dir) {
-  mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
-  mpz_fdiv_r(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), to.get_den().get_mpz_t());
-  mpz_mul_2exp(to.get_num().get_mpz_t(), to.get_num().get_mpz_t(), exp);
-  to.canonicalize();
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-abs_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
-  to = abs(from);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ABS(abs_mpq, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-add_mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y,
-	    Rounding_Dir) {
-  to += x * y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ADD_MUL(add_mul_mpq, mpq_class, mpq_class, mpq_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-sub_mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y,
-	    Rounding_Dir) {
-  to -= x * y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SUB_MUL(sub_mul_mpq, mpq_class, mpq_class, mpq_class)
-
-extern unsigned irrational_precision;
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-sqrt_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_sqrt_neg, from < 0)) {
-    return assign_nan<To_Policy>(to, V_SQRT_NEG);
-  }
-  if (from == 0) {
-    to = 0;
-    return V_EQ;
-  }
-  bool gt1 = from.get_num() > from.get_den();
-  const mpz_class& from_a = gt1 ? from.get_num() : from.get_den();
-  const mpz_class& from_b = gt1 ? from.get_den() : from.get_num();
-  mpz_class& to_a = gt1 ? to.get_num() : to.get_den();
-  mpz_class& to_b = gt1 ? to.get_den() : to.get_num();
-  Rounding_Dir rdir = gt1 ? dir : inverse(dir);
-  mul_2exp<To_Policy, From_Policy>(to_a, from_a,
-                                   2*irrational_precision, ROUND_IGNORE);
-  Result r_div
-    = div<To_Policy, To_Policy, To_Policy>(to_a, to_a, from_b, rdir);
-  Result r_sqrt = sqrt<To_Policy, To_Policy>(to_a, to_a, rdir);
-  to_b = 1;
-  mul_2exp<To_Policy, To_Policy>(to_b, to_b,
-                                 irrational_precision, ROUND_IGNORE);
-  to.canonicalize();
-  return (r_div != V_EQ) ? r_div : r_sqrt;
-}
-
-PPL_SPECIALIZE_SQRT(sqrt_mpq, mpq_class, mpq_class)
-
-template <typename Policy>
-inline Result
-input_mpq(mpq_class& to, std::istream& is, Rounding_Dir dir) {
-  Result r = input_mpq(to, is);
-  Result_Class c = result_class(r);
-  switch (c) {
-  case VC_MINUS_INFINITY:
-  case VC_PLUS_INFINITY:
-    return assign_special<Policy>(to, c, dir);
-  case VC_NAN:
-    return assign_nan<Policy>(to, r);
-  default:
-    return r;
-  }
-}
-
-PPL_SPECIALIZE_INPUT(input_mpq, mpq_class)
-
-template <typename Policy>
-inline Result
-output_mpq(std::ostream& os,
-	   const mpq_class& from,
-	   const Numeric_Format&,
-	   Rounding_Dir) {
-  os << from;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_OUTPUT(output_mpq, mpq_class)
-
-} // namespace Checked
-
-//! Returns the precision parameter used for irrational calculations.
-inline unsigned
-irrational_precision() {
-  return Checked::irrational_precision;
-}
-
-//! Sets the precision parameter used for irrational calculations.
-/*! The lesser between numerator and denominator is limited to 2**\p p.
-
-  If \p p is less than or equal to <CODE>INT_MAX</CODE>, sets the
-  precision parameter used for irrational calculations to \p p.
-
-  \exception std::invalid_argument
-  Thrown if \p p is greater than <CODE>INT_MAX</CODE>.
-*/
-inline void
-set_irrational_precision(const unsigned p) {
-  if (p <= INT_MAX)
-    Checked::irrational_precision = p;
-  else
-    throw std::invalid_argument("PPL::set_irrational_precision(p)"
-				" with p > INT_MAX");
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_checked_mpq_inlines_hh)
diff --git a/src/checked_mpq_inlines.hh b/src/checked_mpq_inlines.hh
new file mode 100644
index 0000000..fe8d3b4
--- /dev/null
+++ b/src/checked_mpq_inlines.hh
@@ -0,0 +1,542 @@
+/* Specialized "checked" functions for GMP's mpq_class numbers.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_mpq_inlines_hh
+#define PPL_checked_mpq_inlines_hh 1
+
+#include <sstream>
+#include <climits>
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Checked {
+
+template <typename Policy>
+inline Result
+classify_mpq(const mpq_class& v, bool nan, bool inf, bool sign) {
+  if ((Policy::has_nan || Policy::has_infinity)
+      && ::sgn(v.get_den()) == 0) {
+    int s = ::sgn(v.get_num());
+    if (Policy::has_nan && (nan || sign) && s == 0)
+      return V_NAN;
+    if (!inf && !sign)
+      return V_LGE;
+    if (Policy::has_infinity) {
+      if (s < 0)
+        return inf ? V_EQ_MINUS_INFINITY : V_LT;
+      if (s > 0)
+        return inf ? V_EQ_PLUS_INFINITY : V_GT;
+    }
+  }
+  if (sign)
+    return static_cast<Result>(sgn<Policy>(v));
+  return V_LGE;
+}
+
+PPL_SPECIALIZE_CLASSIFY(classify_mpq, mpq_class)
+
+template <typename Policy>
+inline bool
+is_nan_mpq(const mpq_class& v) {
+  return Policy::has_nan
+    && ::sgn(v.get_den()) == 0
+    && ::sgn(v.get_num()) == 0;
+}
+
+PPL_SPECIALIZE_IS_NAN(is_nan_mpq, mpq_class)
+
+template <typename Policy>
+inline bool
+is_minf_mpq(const mpq_class& v) {
+  return Policy::has_infinity
+    && ::sgn(v.get_den()) == 0
+    && ::sgn(v.get_num()) < 0;
+}
+
+PPL_SPECIALIZE_IS_MINF(is_minf_mpq, mpq_class)
+
+template <typename Policy>
+inline bool
+is_pinf_mpq(const mpq_class& v) {
+  return Policy::has_infinity
+    && ::sgn(v.get_den()) == 0
+    && ::sgn(v.get_num()) > 0;
+}
+
+PPL_SPECIALIZE_IS_PINF(is_pinf_mpq, mpq_class)
+
+template <typename Policy>
+inline bool
+is_int_mpq(const mpq_class& v) {
+  if ((Policy::has_infinity || Policy::has_nan)
+      && ::sgn(v.get_den()) == 0)
+    return !(Policy::has_nan && ::sgn(v.get_num()) == 0);
+  else
+    return v.get_den() == 1;
+}
+
+PPL_SPECIALIZE_IS_INT(is_int_mpq, mpq_class)
+
+template <typename Policy>
+inline Result
+assign_special_mpq(mpq_class& v, Result_Class c, Rounding_Dir) {
+  switch (c) {
+  case VC_NAN:
+    if (Policy::has_nan) {
+      v.get_num() = 0;
+      v.get_den() = 0;
+      return V_NAN | V_UNREPRESENTABLE;
+    }
+    return V_NAN;
+  case VC_MINUS_INFINITY:
+    if (Policy::has_infinity) {
+      v.get_num() = -1;
+      v.get_den() = 0;
+      return V_EQ_MINUS_INFINITY;
+    }
+    return V_EQ_MINUS_INFINITY | V_UNREPRESENTABLE;
+  case VC_PLUS_INFINITY:
+    if (Policy::has_infinity) {
+      v.get_num() = 1;
+      v.get_den() = 0;
+      return V_EQ_PLUS_INFINITY;
+    }
+    return V_EQ_PLUS_INFINITY | V_UNREPRESENTABLE;
+  default:
+    PPL_UNREACHABLE;
+    return V_NAN | V_UNREPRESENTABLE;
+  }
+}
+
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_mpq, mpq_class)
+
+PPL_SPECIALIZE_COPY(copy_generic, mpq_class)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+construct_mpq_base(mpq_class& to, const From& from, Rounding_Dir) {
+  new (&to) mpq_class(from);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, mpz_class)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, char)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed char)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed short)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed int)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, signed long)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned char)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned short)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned int)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_base, mpq_class, unsigned long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+construct_mpq_float(mpq_class& to, const From& from, Rounding_Dir dir) {
+  if (is_nan<From_Policy>(from))
+    return construct_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(from))
+    return construct_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(from))
+    return construct_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  new (&to) mpq_class(from);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_float, mpq_class, float)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpq_float, mpq_class, double)
+
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, mpq_class)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, char)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed char)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed short)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed int)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, signed long)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned char)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned short)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned int)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpq_class, unsigned long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpq_float(mpq_class& to, const From& from, Rounding_Dir dir) {
+  if (is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  assign_mpq_numeric_float(to, from);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpq_float, mpq_class, float)
+PPL_SPECIALIZE_ASSIGN(assign_mpq_float, mpq_class, double)
+PPL_SPECIALIZE_ASSIGN(assign_mpq_float, mpq_class, long double)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpq_signed_int(mpq_class& to, const From from, Rounding_Dir) {
+  if (sizeof(From) <= sizeof(signed long))
+    to = static_cast<signed long>(from);
+  else {
+    mpz_ptr m = to.get_num().get_mpz_t();
+    if (from >= 0)
+      mpz_import(m, 1, 1, sizeof(From), 0, 0, &from);
+    else {
+      From n = -from;
+      mpz_import(m, 1, 1, sizeof(From), 0, 0, &n);
+      mpz_neg(m, m);
+    }
+    to.get_den() = 1;
+  }
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpq_signed_int, mpq_class, signed long long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpq_unsigned_int(mpq_class& to, const From from, Rounding_Dir) {
+  if (sizeof(From) <= sizeof(unsigned long))
+    to = static_cast<unsigned long>(from);
+  else {
+    mpz_import(to.get_num().get_mpz_t(), 1, 1, sizeof(From), 0, 0, &from);
+    to.get_den() = 1;
+  }
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpq_unsigned_int, mpq_class, unsigned long long)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+floor_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
+  mpz_fdiv_q(to.get_num().get_mpz_t(),
+             from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
+  to.get_den() = 1;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_FLOOR(floor_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+ceil_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
+  mpz_cdiv_q(to.get_num().get_mpz_t(),
+             from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
+  to.get_den() = 1;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_CEIL(ceil_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+trunc_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
+  mpz_tdiv_q(to.get_num().get_mpz_t(),
+             from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
+  to.get_den() = 1;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_TRUNC(trunc_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+neg_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
+  mpq_neg(to.get_mpq_t(), from.get_mpq_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_NEG(neg_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+add_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
+  to = x + y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ADD(add_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+sub_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
+  to = x - y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SUB(sub_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
+  to = x * y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_MUL(mul_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+div_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, sgn(y) == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  to = x / y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_DIV(div_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+idiv_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_div_zero, sgn(y) == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  to = x / y;
+  return trunc<To_Policy, To_Policy>(to, to, dir);
+}
+
+PPL_SPECIALIZE_IDIV(idiv_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+rem_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y, Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, sgn(y) == 0)) {
+    return assign_nan<To_Policy>(to, V_MOD_ZERO);
+  }
+  PPL_DIRTY_TEMP(mpq_class, tmp);
+  tmp = x / y;
+  tmp.get_num() %= tmp.get_den();
+  to = tmp * y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_REM(rem_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+add_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
+             Rounding_Dir) {
+  PPL_DIRTY_TEMP(mpz_class, v);
+  v = 1;
+  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
+  to = x + v;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+sub_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
+             Rounding_Dir) {
+  PPL_DIRTY_TEMP(mpz_class, v);
+  v = 1;
+  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
+  to = x - v;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+mul_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
+             Rounding_Dir) {
+  mpz_mul_2exp(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), exp);
+  to.get_den() = x.get_den();
+  to.canonicalize();
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+div_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
+             Rounding_Dir) {
+  to.get_num() = x.get_num();
+  mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
+  to.canonicalize();
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+smod_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
+              Rounding_Dir) {
+  mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
+  mpz_fdiv_r(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), to.get_den().get_mpz_t());
+  mpz_fdiv_q_2exp(to.get_den().get_mpz_t(), to.get_den().get_mpz_t(), 1);
+  bool neg = to.get_num() >= to.get_den();
+  mpz_mul_2exp(to.get_den().get_mpz_t(), to.get_den().get_mpz_t(), 1);
+  if (neg)
+    to.get_num() -= to.get_den();
+  mpz_mul_2exp(to.get_num().get_mpz_t(), to.get_num().get_mpz_t(), exp);
+  to.canonicalize();
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+umod_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
+              Rounding_Dir) {
+  mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
+  mpz_fdiv_r(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), to.get_den().get_mpz_t());
+  mpz_mul_2exp(to.get_num().get_mpz_t(), to.get_num().get_mpz_t(), exp);
+  to.canonicalize();
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+abs_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
+  to = abs(from);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ABS(abs_mpq, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+add_mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y,
+            Rounding_Dir) {
+  to += x * y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ADD_MUL(add_mul_mpq, mpq_class, mpq_class, mpq_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+sub_mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y,
+            Rounding_Dir) {
+  to -= x * y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SUB_MUL(sub_mul_mpq, mpq_class, mpq_class, mpq_class)
+
+extern unsigned irrational_precision;
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+sqrt_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_sqrt_neg, from < 0)) {
+    return assign_nan<To_Policy>(to, V_SQRT_NEG);
+  }
+  if (from == 0) {
+    to = 0;
+    return V_EQ;
+  }
+  bool gt1 = from.get_num() > from.get_den();
+  const mpz_class& from_a = gt1 ? from.get_num() : from.get_den();
+  const mpz_class& from_b = gt1 ? from.get_den() : from.get_num();
+  mpz_class& to_a = gt1 ? to.get_num() : to.get_den();
+  mpz_class& to_b = gt1 ? to.get_den() : to.get_num();
+  Rounding_Dir rdir = gt1 ? dir : inverse(dir);
+  mul_2exp<To_Policy, From_Policy>(to_a, from_a,
+                                   2*irrational_precision, ROUND_IGNORE);
+  Result r_div
+    = div<To_Policy, To_Policy, To_Policy>(to_a, to_a, from_b, rdir);
+  Result r_sqrt = sqrt<To_Policy, To_Policy>(to_a, to_a, rdir);
+  to_b = 1;
+  mul_2exp<To_Policy, To_Policy>(to_b, to_b,
+                                 irrational_precision, ROUND_IGNORE);
+  to.canonicalize();
+  return (r_div != V_EQ) ? r_div : r_sqrt;
+}
+
+PPL_SPECIALIZE_SQRT(sqrt_mpq, mpq_class, mpq_class)
+
+template <typename Policy>
+inline Result
+input_mpq(mpq_class& to, std::istream& is, Rounding_Dir dir) {
+  Result r = input_mpq(to, is);
+  Result_Class c = result_class(r);
+  switch (c) {
+  case VC_MINUS_INFINITY:
+  case VC_PLUS_INFINITY:
+    return assign_special<Policy>(to, c, dir);
+  case VC_NAN:
+    return assign_nan<Policy>(to, r);
+  default:
+    return r;
+  }
+}
+
+PPL_SPECIALIZE_INPUT(input_mpq, mpq_class)
+
+template <typename Policy>
+inline Result
+output_mpq(std::ostream& os,
+           const mpq_class& from,
+           const Numeric_Format&,
+           Rounding_Dir) {
+  os << from;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_OUTPUT(output_mpq, mpq_class)
+
+} // namespace Checked
+
+//! Returns the precision parameter used for irrational calculations.
+inline unsigned
+irrational_precision() {
+  return Checked::irrational_precision;
+}
+
+//! Sets the precision parameter used for irrational calculations.
+/*! The lesser between numerator and denominator is limited to 2**\p p.
+
+  If \p p is less than or equal to <CODE>INT_MAX</CODE>, sets the
+  precision parameter used for irrational calculations to \p p.
+
+  \exception std::invalid_argument
+  Thrown if \p p is greater than <CODE>INT_MAX</CODE>.
+*/
+inline void
+set_irrational_precision(const unsigned p) {
+  if (p <= INT_MAX)
+    Checked::irrational_precision = p;
+  else
+    throw std::invalid_argument("PPL::set_irrational_precision(p)"
+                                " with p > INT_MAX");
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_checked_mpq_inlines_hh)
diff --git a/src/checked_mpz.inlines.hh b/src/checked_mpz.inlines.hh
deleted file mode 100644
index 9b795d4..0000000
--- a/src/checked_mpz.inlines.hh
+++ /dev/null
@@ -1,645 +0,0 @@
-/* Specialized "checked" functions for GMP's mpz_class numbers.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_checked_mpz_inlines_hh
-#define PPL_checked_mpz_inlines_hh 1
-
-#include <sstream>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Checked {
-
-template <typename Policy>
-inline Result
-round_lt_mpz(mpz_class& to, Rounding_Dir dir) {
-  if (round_down(dir)) {
-    --to;
-    return V_GT;
-  }
-  return V_LT;
-}
-
-template <typename Policy>
-inline Result
-round_gt_mpz(mpz_class& to, Rounding_Dir dir) {
-  if (round_up(dir)) {
-    ++to;
-    return V_LT;
-  }
-  return V_GT;
-}
-
-#ifdef PPL_HAVE_TYPEOF
-//! Type of the _mp_size field of GMP's __mpz_struct.
-typedef typeof(__mpz_struct()._mp_size) mp_size_field_t;
-#else
-//! This is assumed to be the type of the _mp_size field of GMP's __mpz_struct.
-typedef int mp_size_field_t;
-#endif
-
-inline mp_size_field_t
-get_mp_size(const mpz_class &v) {
-  return v.get_mpz_t()->_mp_size;
-}
-
-inline void
-set_mp_size(mpz_class &v, mp_size_field_t size) {
-  v.get_mpz_t()->_mp_size = size;
-}
-
-template <typename Policy>
-inline Result
-classify_mpz(const mpz_class& v, bool nan, bool inf, bool sign) {
-  if (Policy::has_nan || Policy::has_infinity) {
-    mp_size_field_t s = get_mp_size(v);
-    if (Policy::has_nan
-	&& (nan || sign)
-	&& s == C_Integer<mp_size_field_t>::min + 1)
-      return V_NAN;
-    if (!inf && !sign)
-      return V_LGE;
-    if (Policy::has_infinity) {
-      if (s == C_Integer<mp_size_field_t>::min)
-	return inf ? V_EQ_MINUS_INFINITY : V_LT;
-      if (s == C_Integer<mp_size_field_t>::max)
-	return inf ? V_EQ_PLUS_INFINITY : V_GT;
-    }
-  }
-  if (sign)
-    return static_cast<Result>(sgn<Policy>(v));
-  return V_LGE;
-}
-
-PPL_SPECIALIZE_CLASSIFY(classify_mpz, mpz_class)
-
-template <typename Policy>
-inline bool
-is_nan_mpz(const mpz_class& v) {
-  return Policy::has_nan
-    && get_mp_size(v) == C_Integer<mp_size_field_t>::min + 1;
-}
-
-PPL_SPECIALIZE_IS_NAN(is_nan_mpz, mpz_class)
-
-template <typename Policy>
-inline bool
-is_minf_mpz(const mpz_class& v) {
-  return Policy::has_infinity
-    && get_mp_size(v) == C_Integer<mp_size_field_t>::min;
-}
-
-PPL_SPECIALIZE_IS_MINF(is_minf_mpz, mpz_class)
-
-template <typename Policy>
-inline bool
-is_pinf_mpz(const mpz_class& v) {
-  return Policy::has_infinity
-    && get_mp_size(v) == C_Integer<mp_size_field_t>::max;
-}
-
-PPL_SPECIALIZE_IS_PINF(is_pinf_mpz, mpz_class)
-
-template <typename Policy>
-inline bool
-is_int_mpz(const mpz_class& v) {
-  return !is_nan<Policy>(v);
-}
-
-PPL_SPECIALIZE_IS_INT(is_int_mpz, mpz_class)
-
-template <typename Policy>
-inline Result
-assign_special_mpz(mpz_class& v, Result_Class c, Rounding_Dir) {
-  switch (c) {
-  case VC_NAN:
-    if (Policy::has_nan)
-      set_mp_size(v, C_Integer<mp_size_field_t>::min + 1);
-    return V_NAN;
-  case VC_MINUS_INFINITY:
-    if (Policy::has_infinity) {
-      set_mp_size(v, C_Integer<mp_size_field_t>::min);
-      return V_EQ_MINUS_INFINITY;
-    }
-    return V_EQ_MINUS_INFINITY | V_UNREPRESENTABLE;
-  case VC_PLUS_INFINITY:
-    if (Policy::has_infinity) {
-      set_mp_size(v, C_Integer<mp_size_field_t>::max);
-      return V_EQ_PLUS_INFINITY;
-    }
-    return V_EQ_PLUS_INFINITY | V_UNREPRESENTABLE;
-  default:
-    PPL_UNREACHABLE;
-    return V_NAN;
-  }
-}
-
-PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_mpz, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline void
-copy_mpz(mpz_class& to, const mpz_class& from) {
-  if (is_nan_mpz<From_Policy>(from))
-    PPL_ASSERT(To_Policy::has_nan);
-  else if (is_minf_mpz<From_Policy>(from) || is_pinf_mpz<From_Policy>(from))
-    PPL_ASSERT(To_Policy::has_infinity);
-  else {
-    to = from;
-    return;
-  }
-  set_mp_size(to, get_mp_size(from));
-}
-
-PPL_SPECIALIZE_COPY(copy_mpz, mpz_class)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-construct_mpz_base(mpz_class& to, const From from, Rounding_Dir) {
-    new (&to) mpz_class(from);
-    return V_EQ;
-}
-
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, char)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed char)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed short)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed int)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed long)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned char)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned short)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned int)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-construct_mpz_float(mpz_class& to, const From& from, Rounding_Dir dir) {
-  if (is_nan<From_Policy>(from))
-    return construct_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(from))
-    return construct_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(from))
-    return construct_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  if (round_not_requested(dir)) {
-    new (&to) mpz_class(from);
-    return V_LGE;
-  }
-  From n = rint(from);
-  new (&to) mpz_class(n);
-  if (from == n)
-    return V_EQ;
-  if (from < 0)
-    return round_lt_mpz<To_Policy>(to, dir);
-  else
-    return round_gt_mpz<To_Policy>(to, dir);
-}
-
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_float, mpz_class, float)
-PPL_SPECIALIZE_CONSTRUCT(construct_mpz_float, mpz_class, double)
-
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, mpz_class)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, char)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed char)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed short)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed int)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed long)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned char)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned short)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned int)
-PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpz_signed_int(mpz_class& to, const From from, Rounding_Dir) {
-  if (sizeof(From) <= sizeof(signed long))
-    to = static_cast<signed long>(from);
-  else {
-    mpz_ptr m = to.get_mpz_t();
-    if (from >= 0)
-      mpz_import(m, 1, 1, sizeof(From), 0, 0, &from);
-    else {
-      From n = -from;
-      mpz_import(m, 1, 1, sizeof(From), 0, 0, &n);
-      mpz_neg(m, m);
-    }
-  }
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpz_signed_int, mpz_class, signed long long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpz_unsigned_int(mpz_class& to, const From from, Rounding_Dir) {
-  if (sizeof(From) <= sizeof(unsigned long))
-    to = static_cast<unsigned long>(from);
-  else
-    mpz_import(to.get_mpz_t(), 1, 1, sizeof(From), 0, 0, &from);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpz_unsigned_int, mpz_class, unsigned long long)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpz_float(mpz_class& to, const From from, Rounding_Dir dir) {
-  if (is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  if (round_not_requested(dir)) {
-    to = from;
-    return V_LGE;
-  }
-  From i_from = rint(from);
-  to = i_from;
-  if (from == i_from)
-    return V_EQ;
-  if (round_direct(ROUND_UP))
-    return round_lt_mpz<To_Policy>(to, dir);
-  if (round_direct(ROUND_DOWN))
-    return round_gt_mpz<To_Policy>(to, dir);
-  if (from < i_from)
-    return round_lt_mpz<To_Policy>(to, dir);
-  if (from > i_from)
-    return round_gt_mpz<To_Policy>(to, dir);
-  PPL_UNREACHABLE;
-  return V_NAN;
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpz_float, mpz_class, float)
-PPL_SPECIALIZE_ASSIGN(assign_mpz_float, mpz_class, double)
-
-template <typename To_Policy, typename From_Policy, typename From>
-inline Result
-assign_mpz_long_double(mpz_class& to, const From& from, Rounding_Dir dir) {
-  if (is_nan<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
-  else if (is_minf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
-  else if (is_pinf<From_Policy>(from))
-    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
-  // FIXME: this is an incredibly inefficient implementation!
-  std::stringstream ss;
-  output<From_Policy>(ss, from, Numeric_Format(), dir);
-  PPL_DIRTY_TEMP(mpq_class, tmp);
-#ifndef NDEBUG
-  Result r =
-#endif
-    input_mpq(tmp, ss);
-  PPL_ASSERT(r == V_EQ);
-  return assign<To_Policy, From_Policy>(to, tmp, dir);
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpz_long_double, mpz_class, long double)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-assign_mpz_mpq(mpz_class& to, const mpq_class& from, Rounding_Dir dir) {
-  if (round_not_needed(dir)) {
-    to = from.get_num();
-    return V_LGE;
-  }
-  if (round_ignore(dir)) {
-    to = from;
-    return V_LGE;
-  }
-  mpz_srcptr n = from.get_num().get_mpz_t();
-  mpz_srcptr d = from.get_den().get_mpz_t();
-  if (round_down(dir)) {
-    mpz_fdiv_q(to.get_mpz_t(), n, d);
-    if (round_strict_relation(dir))
-      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_GT;
-    return V_GE;
-  }
-  else {
-    PPL_ASSERT(round_up(dir));
-    mpz_cdiv_q(to.get_mpz_t(), n, d);
-    if (round_strict_relation(dir))
-      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_LT;
-    return V_LE;
-  }
-}
-
-PPL_SPECIALIZE_ASSIGN(assign_mpz_mpq, mpz_class, mpq_class)
-
-PPL_SPECIALIZE_FLOOR(assign_exact, mpz_class, mpz_class)
-PPL_SPECIALIZE_CEIL(assign_exact, mpz_class, mpz_class)
-PPL_SPECIALIZE_TRUNC(assign_exact, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-neg_mpz(mpz_class& to, const mpz_class& from, Rounding_Dir) {
-  mpz_neg(to.get_mpz_t(), from.get_mpz_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_NEG(neg_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-add_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
-  to = x + y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ADD(add_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-sub_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
-  to = x - y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SUB(sub_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
-  to = x * y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_MUL(mul_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-div_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  mpz_srcptr n = x.get_mpz_t();
-  mpz_srcptr d = y.get_mpz_t();
-  if (round_not_needed(dir)) {
-    mpz_divexact(to.get_mpz_t(), n, d);
-    return V_LGE;
-  }
-  if (round_ignore(dir)) {
-    mpz_cdiv_q(to.get_mpz_t(), n, d);
-    return V_LE;
-  }
-  if (round_down(dir)) {
-    mpz_fdiv_q(to.get_mpz_t(), n, d);
-    if (round_strict_relation(dir))
-      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_GT;
-    return V_GE;
-  }
-  else {
-    PPL_ASSERT(round_up(dir));
-    mpz_cdiv_q(to.get_mpz_t(), n, d);
-    if (round_strict_relation(dir))
-      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_LT;
-    return V_LE;
-  }
-}
-
-PPL_SPECIALIZE_DIV(div_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-idiv_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
-    return assign_nan<To_Policy>(to, V_DIV_ZERO);
-  }
-  mpz_srcptr n = x.get_mpz_t();
-  mpz_srcptr d = y.get_mpz_t();
-  mpz_tdiv_q(to.get_mpz_t(), n, d);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_IDIV(idiv_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-rem_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
-  if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
-    return assign_nan<To_Policy>(to, V_MOD_ZERO);
-  }
-  to = x % y;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_REM(rem_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-add_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-             Rounding_Dir) {
-  PPL_DIRTY_TEMP(mpz_class, v);
-  v = 1;
-  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
-  to = x + v;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ADD_2EXP(add_2exp_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-sub_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-             Rounding_Dir) {
-  PPL_DIRTY_TEMP(mpz_class, v);
-  v = 1;
-  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
-  to = x - v;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SUB_2EXP(sub_2exp_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-mul_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-             Rounding_Dir) {
-  mpz_mul_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_MUL_2EXP(mul_2exp_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-div_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-             Rounding_Dir dir) {
-  mpz_srcptr n = x.get_mpz_t();
-  if (round_not_requested(dir)) {
-    mpz_tdiv_q_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
-    return V_LGE;
-  }
-  if (round_down(dir)) {
-    mpz_fdiv_q_2exp(to.get_mpz_t(), n, exp);
-    if (round_strict_relation(dir))
-      return (mpz_divisible_2exp_p(n, exp) != 0) ? V_EQ : V_GT;
-    return V_GE;
-  }
-  else {
-    PPL_ASSERT(round_up(dir));
-    mpz_cdiv_q_2exp(to.get_mpz_t(), n, exp);
-    if (round_strict_relation(dir))
-      return (mpz_divisible_2exp_p(n, exp) != 0) ? V_EQ : V_LT;
-    return V_LE;
-  }
-}
-
-PPL_SPECIALIZE_DIV_2EXP(div_2exp_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-smod_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-	      Rounding_Dir) {
-  if (mpz_tstbit(x.get_mpz_t(), exp - 1) != 0)
-    mpz_cdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
-  else
-    mpz_fdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-umod_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-	      Rounding_Dir) {
-  mpz_fdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-abs_mpz(mpz_class& to, const mpz_class& from, Rounding_Dir) {
-  to = abs(from);
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ABS(abs_mpz, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-add_mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	    Rounding_Dir) {
-  mpz_addmul(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_ADD_MUL(add_mul_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-sub_mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	    Rounding_Dir) {
-  mpz_submul(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_SUB_MUL(sub_mul_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-gcd_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
-  mpz_gcd(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_GCD(gcd_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-gcdext_mpz(mpz_class& to, mpz_class& s, mpz_class& t,
-	   const mpz_class& x, const mpz_class& y,
-	   Rounding_Dir) {
-  mpz_gcdext(to.get_mpz_t(), s.get_mpz_t(), t.get_mpz_t(),
-	     x.get_mpz_t(), y.get_mpz_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_GCDEXT(gcdext_mpz, mpz_class, mpz_class, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From1_Policy, typename From2_Policy>
-inline Result
-lcm_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
-  mpz_lcm(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_LCM(lcm_mpz, mpz_class, mpz_class, mpz_class)
-
-template <typename To_Policy, typename From_Policy>
-inline Result
-sqrt_mpz(mpz_class& to, const mpz_class& from, Rounding_Dir dir) {
-  if (CHECK_P(To_Policy::check_sqrt_neg, from < 0)) {
-    return assign_nan<To_Policy>(to, V_SQRT_NEG);
-  }
-  if (round_not_requested(dir)) {
-    to = sqrt(from);
-    return V_GE;
-  }
-  PPL_DIRTY_TEMP(mpz_class, r);
-  mpz_sqrtrem(to.get_mpz_t(), r.get_mpz_t(), from.get_mpz_t());
-  if (r == 0)
-    return V_EQ;
-  return round_gt_mpz<To_Policy>(to, dir);
-}
-
-PPL_SPECIALIZE_SQRT(sqrt_mpz, mpz_class, mpz_class)
-
-template <typename Policy, typename Type>
-inline Result_Relation
-sgn_mp(const Type& x) {
-  int i = ::sgn(x);
-  return (i > 0) ? VR_GT : ((i < 0) ? VR_LT : VR_EQ);
-}
-
-PPL_SPECIALIZE_SGN(sgn_mp, mpz_class)
-PPL_SPECIALIZE_SGN(sgn_mp, mpq_class)
-
-template <typename Policy1, typename Policy2, typename Type>
-inline Result_Relation
-cmp_mp(const Type& x, const Type& y) {
-  int i = ::cmp(x, y);
-  return (i > 0) ? VR_GT : ((i < 0) ? VR_LT : VR_EQ);
-}
-
-PPL_SPECIALIZE_CMP(cmp_mp, mpz_class, mpz_class)
-PPL_SPECIALIZE_CMP(cmp_mp, mpq_class, mpq_class)
-
-template <typename Policy>
-inline Result
-output_mpz(std::ostream& os, const mpz_class& from, const Numeric_Format&,
-	   Rounding_Dir) {
-  os << from;
-  return V_EQ;
-}
-
-PPL_SPECIALIZE_INPUT(input_generic, mpz_class)
-PPL_SPECIALIZE_OUTPUT(output_mpz, mpz_class)
-
-} // namespace Checked
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_checked_mpz_inlines_hh)
diff --git a/src/checked_mpz_inlines.hh b/src/checked_mpz_inlines.hh
new file mode 100644
index 0000000..4147994
--- /dev/null
+++ b/src/checked_mpz_inlines.hh
@@ -0,0 +1,645 @@
+/* Specialized "checked" functions for GMP's mpz_class numbers.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_checked_mpz_inlines_hh
+#define PPL_checked_mpz_inlines_hh 1
+
+#include <sstream>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Checked {
+
+template <typename Policy>
+inline Result
+round_lt_mpz(mpz_class& to, Rounding_Dir dir) {
+  if (round_down(dir)) {
+    --to;
+    return V_GT;
+  }
+  return V_LT;
+}
+
+template <typename Policy>
+inline Result
+round_gt_mpz(mpz_class& to, Rounding_Dir dir) {
+  if (round_up(dir)) {
+    ++to;
+    return V_LT;
+  }
+  return V_GT;
+}
+
+#ifdef PPL_HAVE_TYPEOF
+//! Type of the _mp_size field of GMP's __mpz_struct.
+typedef typeof(__mpz_struct()._mp_size) mp_size_field_t;
+#else
+//! This is assumed to be the type of the _mp_size field of GMP's __mpz_struct.
+typedef int mp_size_field_t;
+#endif
+
+inline mp_size_field_t
+get_mp_size(const mpz_class &v) {
+  return v.get_mpz_t()->_mp_size;
+}
+
+inline void
+set_mp_size(mpz_class &v, mp_size_field_t size) {
+  v.get_mpz_t()->_mp_size = size;
+}
+
+template <typename Policy>
+inline Result
+classify_mpz(const mpz_class& v, bool nan, bool inf, bool sign) {
+  if (Policy::has_nan || Policy::has_infinity) {
+    mp_size_field_t s = get_mp_size(v);
+    if (Policy::has_nan
+        && (nan || sign)
+        && s == C_Integer<mp_size_field_t>::min + 1)
+      return V_NAN;
+    if (!inf && !sign)
+      return V_LGE;
+    if (Policy::has_infinity) {
+      if (s == C_Integer<mp_size_field_t>::min)
+        return inf ? V_EQ_MINUS_INFINITY : V_LT;
+      if (s == C_Integer<mp_size_field_t>::max)
+        return inf ? V_EQ_PLUS_INFINITY : V_GT;
+    }
+  }
+  if (sign)
+    return static_cast<Result>(sgn<Policy>(v));
+  return V_LGE;
+}
+
+PPL_SPECIALIZE_CLASSIFY(classify_mpz, mpz_class)
+
+template <typename Policy>
+inline bool
+is_nan_mpz(const mpz_class& v) {
+  return Policy::has_nan
+    && get_mp_size(v) == C_Integer<mp_size_field_t>::min + 1;
+}
+
+PPL_SPECIALIZE_IS_NAN(is_nan_mpz, mpz_class)
+
+template <typename Policy>
+inline bool
+is_minf_mpz(const mpz_class& v) {
+  return Policy::has_infinity
+    && get_mp_size(v) == C_Integer<mp_size_field_t>::min;
+}
+
+PPL_SPECIALIZE_IS_MINF(is_minf_mpz, mpz_class)
+
+template <typename Policy>
+inline bool
+is_pinf_mpz(const mpz_class& v) {
+  return Policy::has_infinity
+    && get_mp_size(v) == C_Integer<mp_size_field_t>::max;
+}
+
+PPL_SPECIALIZE_IS_PINF(is_pinf_mpz, mpz_class)
+
+template <typename Policy>
+inline bool
+is_int_mpz(const mpz_class& v) {
+  return !is_nan<Policy>(v);
+}
+
+PPL_SPECIALIZE_IS_INT(is_int_mpz, mpz_class)
+
+template <typename Policy>
+inline Result
+assign_special_mpz(mpz_class& v, Result_Class c, Rounding_Dir) {
+  switch (c) {
+  case VC_NAN:
+    if (Policy::has_nan)
+      set_mp_size(v, C_Integer<mp_size_field_t>::min + 1);
+    return V_NAN;
+  case VC_MINUS_INFINITY:
+    if (Policy::has_infinity) {
+      set_mp_size(v, C_Integer<mp_size_field_t>::min);
+      return V_EQ_MINUS_INFINITY;
+    }
+    return V_EQ_MINUS_INFINITY | V_UNREPRESENTABLE;
+  case VC_PLUS_INFINITY:
+    if (Policy::has_infinity) {
+      set_mp_size(v, C_Integer<mp_size_field_t>::max);
+      return V_EQ_PLUS_INFINITY;
+    }
+    return V_EQ_PLUS_INFINITY | V_UNREPRESENTABLE;
+  default:
+    PPL_UNREACHABLE;
+    return V_NAN;
+  }
+}
+
+PPL_SPECIALIZE_ASSIGN_SPECIAL(assign_special_mpz, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline void
+copy_mpz(mpz_class& to, const mpz_class& from) {
+  if (is_nan_mpz<From_Policy>(from))
+    PPL_ASSERT(To_Policy::has_nan);
+  else if (is_minf_mpz<From_Policy>(from) || is_pinf_mpz<From_Policy>(from))
+    PPL_ASSERT(To_Policy::has_infinity);
+  else {
+    to = from;
+    return;
+  }
+  set_mp_size(to, get_mp_size(from));
+}
+
+PPL_SPECIALIZE_COPY(copy_mpz, mpz_class)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+construct_mpz_base(mpz_class& to, const From from, Rounding_Dir) {
+    new (&to) mpz_class(from);
+    return V_EQ;
+}
+
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, char)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed char)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed short)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed int)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, signed long)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned char)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned short)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned int)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_base, mpz_class, unsigned long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+construct_mpz_float(mpz_class& to, const From& from, Rounding_Dir dir) {
+  if (is_nan<From_Policy>(from))
+    return construct_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(from))
+    return construct_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(from))
+    return construct_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  if (round_not_requested(dir)) {
+    new (&to) mpz_class(from);
+    return V_LGE;
+  }
+  From n = rint(from);
+  new (&to) mpz_class(n);
+  if (from == n)
+    return V_EQ;
+  if (from < 0)
+    return round_lt_mpz<To_Policy>(to, dir);
+  else
+    return round_gt_mpz<To_Policy>(to, dir);
+}
+
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_float, mpz_class, float)
+PPL_SPECIALIZE_CONSTRUCT(construct_mpz_float, mpz_class, double)
+
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, mpz_class)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, char)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed char)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed short)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed int)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, signed long)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned char)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned short)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned int)
+PPL_SPECIALIZE_ASSIGN(assign_exact, mpz_class, unsigned long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpz_signed_int(mpz_class& to, const From from, Rounding_Dir) {
+  if (sizeof(From) <= sizeof(signed long))
+    to = static_cast<signed long>(from);
+  else {
+    mpz_ptr m = to.get_mpz_t();
+    if (from >= 0)
+      mpz_import(m, 1, 1, sizeof(From), 0, 0, &from);
+    else {
+      From n = -from;
+      mpz_import(m, 1, 1, sizeof(From), 0, 0, &n);
+      mpz_neg(m, m);
+    }
+  }
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpz_signed_int, mpz_class, signed long long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpz_unsigned_int(mpz_class& to, const From from, Rounding_Dir) {
+  if (sizeof(From) <= sizeof(unsigned long))
+    to = static_cast<unsigned long>(from);
+  else
+    mpz_import(to.get_mpz_t(), 1, 1, sizeof(From), 0, 0, &from);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpz_unsigned_int, mpz_class, unsigned long long)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpz_float(mpz_class& to, const From from, Rounding_Dir dir) {
+  if (is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  if (round_not_requested(dir)) {
+    to = from;
+    return V_LGE;
+  }
+  From i_from = rint(from);
+  to = i_from;
+  if (from == i_from)
+    return V_EQ;
+  if (round_direct(ROUND_UP))
+    return round_lt_mpz<To_Policy>(to, dir);
+  if (round_direct(ROUND_DOWN))
+    return round_gt_mpz<To_Policy>(to, dir);
+  if (from < i_from)
+    return round_lt_mpz<To_Policy>(to, dir);
+  if (from > i_from)
+    return round_gt_mpz<To_Policy>(to, dir);
+  PPL_UNREACHABLE;
+  return V_NAN;
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpz_float, mpz_class, float)
+PPL_SPECIALIZE_ASSIGN(assign_mpz_float, mpz_class, double)
+
+template <typename To_Policy, typename From_Policy, typename From>
+inline Result
+assign_mpz_long_double(mpz_class& to, const From& from, Rounding_Dir dir) {
+  if (is_nan<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
+  else if (is_minf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+  else if (is_pinf<From_Policy>(from))
+    return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+  // FIXME: this is an incredibly inefficient implementation!
+  std::stringstream ss;
+  output<From_Policy>(ss, from, Numeric_Format(), dir);
+  PPL_DIRTY_TEMP(mpq_class, tmp);
+#ifndef NDEBUG
+  Result r =
+#endif
+    input_mpq(tmp, ss);
+  PPL_ASSERT(r == V_EQ);
+  return assign<To_Policy, From_Policy>(to, tmp, dir);
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpz_long_double, mpz_class, long double)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+assign_mpz_mpq(mpz_class& to, const mpq_class& from, Rounding_Dir dir) {
+  if (round_not_needed(dir)) {
+    to = from.get_num();
+    return V_LGE;
+  }
+  if (round_ignore(dir)) {
+    to = from;
+    return V_LGE;
+  }
+  const mpz_srcptr n = from.get_num().get_mpz_t();
+  const mpz_srcptr d = from.get_den().get_mpz_t();
+  if (round_down(dir)) {
+    mpz_fdiv_q(to.get_mpz_t(), n, d);
+    if (round_strict_relation(dir))
+      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_GT;
+    return V_GE;
+  }
+  else {
+    PPL_ASSERT(round_up(dir));
+    mpz_cdiv_q(to.get_mpz_t(), n, d);
+    if (round_strict_relation(dir))
+      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_LT;
+    return V_LE;
+  }
+}
+
+PPL_SPECIALIZE_ASSIGN(assign_mpz_mpq, mpz_class, mpq_class)
+
+PPL_SPECIALIZE_FLOOR(assign_exact, mpz_class, mpz_class)
+PPL_SPECIALIZE_CEIL(assign_exact, mpz_class, mpz_class)
+PPL_SPECIALIZE_TRUNC(assign_exact, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+neg_mpz(mpz_class& to, const mpz_class& from, Rounding_Dir) {
+  mpz_neg(to.get_mpz_t(), from.get_mpz_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_NEG(neg_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+add_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
+  to = x + y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ADD(add_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+sub_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
+  to = x - y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SUB(sub_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
+  to = x * y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_MUL(mul_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+div_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
+        Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  const mpz_srcptr n = x.get_mpz_t();
+  const mpz_srcptr d = y.get_mpz_t();
+  if (round_not_needed(dir)) {
+    mpz_divexact(to.get_mpz_t(), n, d);
+    return V_LGE;
+  }
+  if (round_ignore(dir)) {
+    mpz_cdiv_q(to.get_mpz_t(), n, d);
+    return V_LE;
+  }
+  if (round_down(dir)) {
+    mpz_fdiv_q(to.get_mpz_t(), n, d);
+    if (round_strict_relation(dir))
+      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_GT;
+    return V_GE;
+  }
+  else {
+    PPL_ASSERT(round_up(dir));
+    mpz_cdiv_q(to.get_mpz_t(), n, d);
+    if (round_strict_relation(dir))
+      return (mpz_divisible_p(n, d) != 0) ? V_EQ : V_LT;
+    return V_LE;
+  }
+}
+
+PPL_SPECIALIZE_DIV(div_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+idiv_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
+        Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
+    return assign_nan<To_Policy>(to, V_DIV_ZERO);
+  }
+  mpz_srcptr n = x.get_mpz_t();
+  mpz_srcptr d = y.get_mpz_t();
+  mpz_tdiv_q(to.get_mpz_t(), n, d);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_IDIV(idiv_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+rem_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
+  if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
+    return assign_nan<To_Policy>(to, V_MOD_ZERO);
+  }
+  to = x % y;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_REM(rem_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+add_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
+             Rounding_Dir) {
+  PPL_DIRTY_TEMP(mpz_class, v);
+  v = 1;
+  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
+  to = x + v;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ADD_2EXP(add_2exp_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+sub_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
+             Rounding_Dir) {
+  PPL_DIRTY_TEMP(mpz_class, v);
+  v = 1;
+  mpz_mul_2exp(v.get_mpz_t(), v.get_mpz_t(), exp);
+  to = x - v;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SUB_2EXP(sub_2exp_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+mul_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
+             Rounding_Dir) {
+  mpz_mul_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_MUL_2EXP(mul_2exp_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+div_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
+             Rounding_Dir dir) {
+  const mpz_srcptr n = x.get_mpz_t();
+  if (round_not_requested(dir)) {
+    mpz_tdiv_q_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
+    return V_LGE;
+  }
+  if (round_down(dir)) {
+    mpz_fdiv_q_2exp(to.get_mpz_t(), n, exp);
+    if (round_strict_relation(dir))
+      return (mpz_divisible_2exp_p(n, exp) != 0) ? V_EQ : V_GT;
+    return V_GE;
+  }
+  else {
+    PPL_ASSERT(round_up(dir));
+    mpz_cdiv_q_2exp(to.get_mpz_t(), n, exp);
+    if (round_strict_relation(dir))
+      return (mpz_divisible_2exp_p(n, exp) != 0) ? V_EQ : V_LT;
+    return V_LE;
+  }
+}
+
+PPL_SPECIALIZE_DIV_2EXP(div_2exp_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+smod_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
+              Rounding_Dir) {
+  if (mpz_tstbit(x.get_mpz_t(), exp - 1) != 0)
+    mpz_cdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
+  else
+    mpz_fdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+umod_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
+              Rounding_Dir) {
+  mpz_fdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+abs_mpz(mpz_class& to, const mpz_class& from, Rounding_Dir) {
+  to = abs(from);
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ABS(abs_mpz, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+add_mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
+            Rounding_Dir) {
+  mpz_addmul(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_ADD_MUL(add_mul_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+sub_mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
+            Rounding_Dir) {
+  mpz_submul(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_SUB_MUL(sub_mul_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+gcd_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
+  mpz_gcd(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_GCD(gcd_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+gcdext_mpz(mpz_class& to, mpz_class& s, mpz_class& t,
+           const mpz_class& x, const mpz_class& y,
+           Rounding_Dir) {
+  mpz_gcdext(to.get_mpz_t(), s.get_mpz_t(), t.get_mpz_t(),
+             x.get_mpz_t(), y.get_mpz_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_GCDEXT(gcdext_mpz, mpz_class, mpz_class, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From1_Policy, typename From2_Policy>
+inline Result
+lcm_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y, Rounding_Dir) {
+  mpz_lcm(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_LCM(lcm_mpz, mpz_class, mpz_class, mpz_class)
+
+template <typename To_Policy, typename From_Policy>
+inline Result
+sqrt_mpz(mpz_class& to, const mpz_class& from, Rounding_Dir dir) {
+  if (CHECK_P(To_Policy::check_sqrt_neg, from < 0)) {
+    return assign_nan<To_Policy>(to, V_SQRT_NEG);
+  }
+  if (round_not_requested(dir)) {
+    to = sqrt(from);
+    return V_GE;
+  }
+  PPL_DIRTY_TEMP(mpz_class, r);
+  mpz_sqrtrem(to.get_mpz_t(), r.get_mpz_t(), from.get_mpz_t());
+  if (r == 0)
+    return V_EQ;
+  return round_gt_mpz<To_Policy>(to, dir);
+}
+
+PPL_SPECIALIZE_SQRT(sqrt_mpz, mpz_class, mpz_class)
+
+template <typename Policy, typename Type>
+inline Result_Relation
+sgn_mp(const Type& x) {
+  const int sign = ::sgn(x);
+  return (sign > 0) ? VR_GT : ((sign < 0) ? VR_LT : VR_EQ);
+}
+
+PPL_SPECIALIZE_SGN(sgn_mp, mpz_class)
+PPL_SPECIALIZE_SGN(sgn_mp, mpq_class)
+
+template <typename Policy1, typename Policy2, typename Type>
+inline Result_Relation
+cmp_mp(const Type& x, const Type& y) {
+  int i = ::cmp(x, y);
+  return (i > 0) ? VR_GT : ((i < 0) ? VR_LT : VR_EQ);
+}
+
+PPL_SPECIALIZE_CMP(cmp_mp, mpz_class, mpz_class)
+PPL_SPECIALIZE_CMP(cmp_mp, mpq_class, mpq_class)
+
+template <typename Policy>
+inline Result
+output_mpz(std::ostream& os, const mpz_class& from, const Numeric_Format&,
+           Rounding_Dir) {
+  os << from;
+  return V_EQ;
+}
+
+PPL_SPECIALIZE_INPUT(input_generic, mpz_class)
+PPL_SPECIALIZE_OUTPUT(output_mpz, mpz_class)
+
+} // namespace Checked
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_checked_mpz_inlines_hh)
diff --git a/src/checked_numeric_limits.hh b/src/checked_numeric_limits.hh
index 757fe20..b5f410c 100644
--- a/src/checked_numeric_limits.hh
+++ b/src/checked_numeric_limits.hh
@@ -1,6 +1,6 @@
 /* Specializations of std::numeric_limits for "checked" types.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,51 +24,51 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_checked_numeric_limits_hh
 #define PPL_checked_numeric_limits_hh 1
 
-#include "Checked_Number.defs.hh"
-#include "checked_int.inlines.hh"
+#include "Checked_Number_defs.hh"
+#include "checked_int_inlines.hh"
 #include <limits>
 
 namespace std {
 
 using namespace Parma_Polyhedra_Library;
 
-#define PPL_SPECIALIZE_LIMITS_INT(T)					\
-  /*! \brief Partial specialization of std::numeric_limits. */		\
-  template <typename Policy>						\
+#define PPL_SPECIALIZE_LIMITS_INT(T)                                    \
+  /*! \brief Partial specialization of std::numeric_limits. */          \
+  template <typename Policy>                                            \
   class numeric_limits<Checked_Number<PPL_U(T), Policy> >              \
     : public numeric_limits<PPL_U(T)> {                                 \
-  private:								\
+  private:                                                              \
     typedef Checked_Number<PPL_U(T), Policy> Type;                      \
                                                                         \
-  public:								\
-    static const bool has_infinity = Policy::has_infinity;		\
+  public:                                                               \
+    static const bool has_infinity = Policy::has_infinity;              \
     static const bool has_quiet_NaN =  Policy::has_nan;                 \
                                                                         \
-    static Type min() {							\
-      Type v;								\
+    static Type min() {                                                 \
+      Type v;                                                           \
       v.raw_value() = Checked::Extended_Int<Policy, PPL_U(T)>::min;     \
-      return v;								\
-    }									\
+      return v;                                                         \
+    }                                                                   \
                                                                         \
-    static Type max() {							\
-      Type v;								\
+    static Type max() {                                                 \
+      Type v;                                                           \
       v.raw_value() = Checked::Extended_Int<Policy, PPL_U(T)>::max;     \
-      return v;								\
-    }									\
-									\
-    static Type infinity() {						\
-      Type v;								\
-      Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,	\
+      return v;                                                         \
+    }                                                                   \
+                                                                        \
+    static Type infinity() {                                            \
+      Type v;                                                           \
+      Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,  \
                                       ROUND_IGNORE);                    \
-      return v;								\
-    }									\
-									\
-    static Type quiet_NaN() {						\
-      Type v;								\
-      Checked::assign_special<Policy>(v.raw_value(), VC_NAN,		\
+      return v;                                                         \
+    }                                                                   \
+                                                                        \
+    static Type quiet_NaN() {                                           \
+      Type v;                                                           \
+      Checked::assign_special<Policy>(v.raw_value(), VC_NAN,            \
                                       ROUND_IGNORE);                    \
-      return v;								\
-    }									\
+      return v;                                                         \
+    }                                                                   \
   };
 
 PPL_SPECIALIZE_LIMITS_INT(char)
@@ -87,9 +87,9 @@ PPL_SPECIALIZE_LIMITS_INT(unsigned long long)
 
 #undef PPL_SPECIALIZE_LIMITS_INT
 
-#define PPL_SPECIALIZE_LIMITS_FLOAT(T)					\
-  /*! \brief Partial specialization of std::numeric_limits. */		\
-  template <typename Policy>						\
+#define PPL_SPECIALIZE_LIMITS_FLOAT(T)                                  \
+  /*! \brief Partial specialization of std::numeric_limits. */          \
+  template <typename Policy>                                            \
   struct numeric_limits<Checked_Number<PPL_U(T), Policy> >              \
     : public numeric_limits<PPL_U(T)> {                                 \
 };
@@ -123,7 +123,7 @@ public:
   static Type infinity() {
     Type v;
     Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,
-				    ROUND_IGNORE);
+                                    ROUND_IGNORE);
     return v;
   }
 
@@ -151,7 +151,7 @@ public:
   static Type infinity() {
     Type v;
     Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,
-				    ROUND_IGNORE);
+                                    ROUND_IGNORE);
     return v;
   }
 
diff --git a/src/compiler.hh b/src/compiler.hh
index 578b83b..840620a 100644
--- a/src/compiler.hh
+++ b/src/compiler.hh
@@ -1,6 +1,6 @@
 /* C++ compiler related stuff.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/distances.defs.hh b/src/distances.defs.hh
deleted file mode 100644
index adbb098..0000000
--- a/src/distances.defs.hh
+++ /dev/null
@@ -1,54 +0,0 @@
-/* Class declarations for several distances.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_distances_defs_hh
-#define PPL_distances_defs_hh 1
-
-#include "distances.types.hh"
-#include "Rounding_Dir.defs.hh"
-
-template <typename Temp>
-struct Parma_Polyhedra_Library::Rectilinear_Distance_Specialization {
-  static void combine(Temp& running, const Temp& current, Rounding_Dir dir);
-
-  static void finalize(Temp&, Rounding_Dir);
-};
-
-template <typename Temp>
-struct Parma_Polyhedra_Library::Euclidean_Distance_Specialization {
-  static void combine(Temp& running, Temp& current, Rounding_Dir dir);
-
-  static void finalize(Temp& running, Rounding_Dir dir);
-};
-
-
-template <typename Temp>
-struct Parma_Polyhedra_Library::L_Infinity_Distance_Specialization {
-  static void combine(Temp& running, const Temp& current, Rounding_Dir);
-
-  static void finalize(Temp&, Rounding_Dir);
-};
-
-#include "distances.inlines.hh"
-
-#endif // !defined(PPL_distances_defs_hh)
diff --git a/src/distances.inlines.hh b/src/distances.inlines.hh
deleted file mode 100644
index fd0863d..0000000
--- a/src/distances.inlines.hh
+++ /dev/null
@@ -1,113 +0,0 @@
-/* Inline functions implementing distances.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_distances_inlines_hh
-#define PPL_distances_inlines_hh 1
-
-#include "Result.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-// A struct to work around the lack of partial specialization
-// of function templates in C++.
-template <typename To, typename From>
-struct maybe_assign_struct {
-  static inline Result
-  function(const To*& top, To& tmp, const From& from, Rounding_Dir dir) {
-    // When `To' and `From' are different types, we make the conversion
-    // and use `tmp'.
-    top = &tmp;
-    return assign_r(tmp, from, dir);
-  }
-};
-
-template <typename Type>
-struct maybe_assign_struct<Type, Type> {
-  static inline Result
-  function(const Type*& top, Type&, const Type& from, Rounding_Dir) {
-    // When the types are the same, conversion is unnecessary.
-    top = &from;
-    return V_EQ;
-  }
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Assigns to \p top a pointer to a location that holds the
-  conversion, according to \p dir, of \p from to type \p To.  When
-  necessary, and only when necessary, the variable \p tmp is used to
-  hold the result of conversion.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename To, typename From>
-inline Result
-maybe_assign(const To*& top, To& tmp, const From& from, Rounding_Dir dir) {
-  return maybe_assign_struct<To, From>::function(top, tmp, from, dir);
-}
-
-template <typename Temp>
-inline void
-Rectilinear_Distance_Specialization<Temp>::combine(Temp& running,
-						   const Temp& current,
-						   Rounding_Dir dir) {
-  add_assign_r(running, running, current, dir);
-}
-
-template <typename Temp>
-inline void
-Rectilinear_Distance_Specialization<Temp>::finalize(Temp&, Rounding_Dir) {
-}
-
-template <typename Temp>
-inline void
-Euclidean_Distance_Specialization<Temp>::combine(Temp& running,
-						 Temp& current,
-						 Rounding_Dir dir) {
-  mul_assign_r(current, current, current, dir);
-  add_assign_r(running, running, current, dir);
-}
-
-template <typename Temp>
-inline void
-Euclidean_Distance_Specialization<Temp>::finalize(Temp& running,
-						  Rounding_Dir dir) {
-  sqrt_assign_r(running, running, dir);
-}
-
-template <typename Temp>
-inline void
-L_Infinity_Distance_Specialization<Temp>::combine(Temp& running,
-						  const Temp& current,
-						  Rounding_Dir) {
-  if (current > running)
-    running = current;
-}
-
-template <typename Temp>
-inline void
-L_Infinity_Distance_Specialization<Temp>::finalize(Temp&, Rounding_Dir) {
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_distances_inlines_hh)
diff --git a/src/distances.types.hh b/src/distances.types.hh
deleted file mode 100644
index e9a7995..0000000
--- a/src/distances.types.hh
+++ /dev/null
@@ -1,29 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_distances_types_hh
-#define PPL_distances_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Temp>
-struct Rectilinear_Distance_Specialization;
-
-template <typename Temp>
-struct Euclidean_Distance_Specialization;
-
-template <typename Temp>
-struct L_Infinity_Distance_Specialization;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_distances_types_hh)
diff --git a/src/distances_defs.hh b/src/distances_defs.hh
new file mode 100644
index 0000000..4803f8f
--- /dev/null
+++ b/src/distances_defs.hh
@@ -0,0 +1,54 @@
+/* Class declarations for several distances.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_distances_defs_hh
+#define PPL_distances_defs_hh 1
+
+#include "distances_types.hh"
+#include "Rounding_Dir_defs.hh"
+
+template <typename Temp>
+struct Parma_Polyhedra_Library::Rectilinear_Distance_Specialization {
+  static void combine(Temp& running, const Temp& current, Rounding_Dir dir);
+
+  static void finalize(Temp&, Rounding_Dir);
+};
+
+template <typename Temp>
+struct Parma_Polyhedra_Library::Euclidean_Distance_Specialization {
+  static void combine(Temp& running, Temp& current, Rounding_Dir dir);
+
+  static void finalize(Temp& running, Rounding_Dir dir);
+};
+
+
+template <typename Temp>
+struct Parma_Polyhedra_Library::L_Infinity_Distance_Specialization {
+  static void combine(Temp& running, const Temp& current, Rounding_Dir);
+
+  static void finalize(Temp&, Rounding_Dir);
+};
+
+#include "distances_inlines.hh"
+
+#endif // !defined(PPL_distances_defs_hh)
diff --git a/src/distances_inlines.hh b/src/distances_inlines.hh
new file mode 100644
index 0000000..279a345
--- /dev/null
+++ b/src/distances_inlines.hh
@@ -0,0 +1,113 @@
+/* Inline functions implementing distances.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_distances_inlines_hh
+#define PPL_distances_inlines_hh 1
+
+#include "Result_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+// A struct to work around the lack of partial specialization
+// of function templates in C++.
+template <typename To, typename From>
+struct maybe_assign_struct {
+  static inline Result
+  function(const To*& top, To& tmp, const From& from, Rounding_Dir dir) {
+    // When `To' and `From' are different types, we make the conversion
+    // and use `tmp'.
+    top = &tmp;
+    return assign_r(tmp, from, dir);
+  }
+};
+
+template <typename Type>
+struct maybe_assign_struct<Type, Type> {
+  static inline Result
+  function(const Type*& top, Type&, const Type& from, Rounding_Dir) {
+    // When the types are the same, conversion is unnecessary.
+    top = &from;
+    return V_EQ;
+  }
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Assigns to \p top a pointer to a location that holds the
+  conversion, according to \p dir, of \p from to type \p To.  When
+  necessary, and only when necessary, the variable \p tmp is used to
+  hold the result of conversion.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename To, typename From>
+inline Result
+maybe_assign(const To*& top, To& tmp, const From& from, Rounding_Dir dir) {
+  return maybe_assign_struct<To, From>::function(top, tmp, from, dir);
+}
+
+template <typename Temp>
+inline void
+Rectilinear_Distance_Specialization<Temp>::combine(Temp& running,
+                                                   const Temp& current,
+                                                   Rounding_Dir dir) {
+  add_assign_r(running, running, current, dir);
+}
+
+template <typename Temp>
+inline void
+Rectilinear_Distance_Specialization<Temp>::finalize(Temp&, Rounding_Dir) {
+}
+
+template <typename Temp>
+inline void
+Euclidean_Distance_Specialization<Temp>::combine(Temp& running,
+                                                 Temp& current,
+                                                 Rounding_Dir dir) {
+  mul_assign_r(current, current, current, dir);
+  add_assign_r(running, running, current, dir);
+}
+
+template <typename Temp>
+inline void
+Euclidean_Distance_Specialization<Temp>::finalize(Temp& running,
+                                                  Rounding_Dir dir) {
+  sqrt_assign_r(running, running, dir);
+}
+
+template <typename Temp>
+inline void
+L_Infinity_Distance_Specialization<Temp>::combine(Temp& running,
+                                                  const Temp& current,
+                                                  Rounding_Dir) {
+  if (current > running)
+    running = current;
+}
+
+template <typename Temp>
+inline void
+L_Infinity_Distance_Specialization<Temp>::finalize(Temp&, Rounding_Dir) {
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_distances_inlines_hh)
diff --git a/src/distances_types.hh b/src/distances_types.hh
new file mode 100644
index 0000000..f8d5892
--- /dev/null
+++ b/src/distances_types.hh
@@ -0,0 +1,29 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_distances_types_hh
+#define PPL_distances_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Temp>
+struct Rectilinear_Distance_Specialization;
+
+template <typename Temp>
+struct Euclidean_Distance_Specialization;
+
+template <typename Temp>
+struct L_Infinity_Distance_Specialization;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_distances_types_hh)
diff --git a/src/fpu-c99.inlines.hh b/src/fpu-c99.inlines.hh
deleted file mode 100644
index 176affd..0000000
--- a/src/fpu-c99.inlines.hh
+++ /dev/null
@@ -1,100 +0,0 @@
-/* C99 Floating point unit related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_fpu_c99_inlines_hh
-#define PPL_fpu_c99_inlines_hh 1
-
-#ifdef PPL_HAVE_FENV_H
-#include <fenv.h>
-#include <stdexcept>
-
-#ifdef FE_TONEAREST
-#define PPL_FPU_TONEAREST FE_TONEAREST
-#endif
-#ifdef FE_UPWARD
-#define PPL_FPU_UPWARD FE_UPWARD
-#endif
-#ifdef FE_DOWNWARD
-#define PPL_FPU_DOWNWARD FE_DOWNWARD
-#endif
-#ifdef FE_TOWARDZERO
-#define PPL_FPU_TOWARDZERO FE_TOWARDZERO
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-fpu_initialize_control_functions() {
-  int old = fegetround();
-  if (fesetround(PPL_FPU_DOWNWARD) != 0
-      || fesetround(PPL_FPU_UPWARD) != 0
-      || fesetround(old) != 0)
-    throw std::logic_error("PPL configuration error:"
-			   " PPL_CAN_CONTROL_FPU evaluates to true,"
-			   " but fesetround() returns nonzero.");
-}
-
-inline fpu_rounding_direction_type
-fpu_get_rounding_direction() {
-  return static_cast<fpu_rounding_direction_type>(fegetround());
-}
-
-inline void
-fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
-  fesetround(dir);
-}
-
-inline fpu_rounding_control_word_type
-fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
-  fpu_rounding_control_word_type old
-    = static_cast<fpu_rounding_control_word_type>(fegetround());
-  fesetround(dir);
-  return old;
-}
-
-inline void
-fpu_reset_inexact() {
-#if PPL_CXX_SUPPORTS_IEEE_INEXACT_FLAG
-  feclearexcept(FE_INEXACT);
-#endif
-}
-
-inline void
-fpu_restore_rounding_direction(fpu_rounding_control_word_type w) {
-  fesetround(w);
-}
-
-inline int
-fpu_check_inexact() {
-#if PPL_CXX_SUPPORTS_IEEE_INEXACT_FLAG
-  return fetestexcept(FE_INEXACT) != 0 ? 1 : 0;
-#else
-  return -1;
-#endif
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_HAVE_FENV_H)
-
-#endif // !defined(PPL_fpu_c99_inlines_hh)
diff --git a/src/fpu-c99_inlines.hh b/src/fpu-c99_inlines.hh
new file mode 100644
index 0000000..388281f
--- /dev/null
+++ b/src/fpu-c99_inlines.hh
@@ -0,0 +1,100 @@
+/* C99 Floating point unit related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_fpu_c99_inlines_hh
+#define PPL_fpu_c99_inlines_hh 1
+
+#ifdef PPL_HAVE_FENV_H
+#include <fenv.h>
+#include <stdexcept>
+
+#ifdef FE_TONEAREST
+#define PPL_FPU_TONEAREST FE_TONEAREST
+#endif
+#ifdef FE_UPWARD
+#define PPL_FPU_UPWARD FE_UPWARD
+#endif
+#ifdef FE_DOWNWARD
+#define PPL_FPU_DOWNWARD FE_DOWNWARD
+#endif
+#ifdef FE_TOWARDZERO
+#define PPL_FPU_TOWARDZERO FE_TOWARDZERO
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+fpu_initialize_control_functions() {
+  const int old = fegetround();
+  if (fesetround(PPL_FPU_DOWNWARD) != 0
+      || fesetround(PPL_FPU_UPWARD) != 0
+      || fesetround(old) != 0)
+    throw std::logic_error("PPL configuration error:"
+                           " PPL_CAN_CONTROL_FPU evaluates to true,"
+                           " but fesetround() returns nonzero.");
+}
+
+inline fpu_rounding_direction_type
+fpu_get_rounding_direction() {
+  return static_cast<fpu_rounding_direction_type>(fegetround());
+}
+
+inline void
+fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
+  fesetround(dir);
+}
+
+inline fpu_rounding_control_word_type
+fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
+  const fpu_rounding_control_word_type old
+    = static_cast<fpu_rounding_control_word_type>(fegetround());
+  fesetround(dir);
+  return old;
+}
+
+inline void
+fpu_reset_inexact() {
+#if PPL_CXX_SUPPORTS_IEEE_INEXACT_FLAG
+  feclearexcept(FE_INEXACT);
+#endif
+}
+
+inline void
+fpu_restore_rounding_direction(fpu_rounding_control_word_type w) {
+  fesetround(w);
+}
+
+inline int
+fpu_check_inexact() {
+#if PPL_CXX_SUPPORTS_IEEE_INEXACT_FLAG
+  return fetestexcept(FE_INEXACT) != 0 ? 1 : 0;
+#else
+  return -1;
+#endif
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_HAVE_FENV_H)
+
+#endif // !defined(PPL_fpu_c99_inlines_hh)
diff --git a/src/fpu-ia32.cc b/src/fpu-ia32.cc
index 73a1833..9c2fad0 100644
--- a/src/fpu-ia32.cc
+++ b/src/fpu-ia32.cc
@@ -1,6 +1,6 @@
 /* IA-32 floating point unit non-inline related functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,7 +27,7 @@ site: http://bugseng.com/products/ppl/ . */
   && defined(__i386__) \
   && (defined(__GNUC__) || defined(__INTEL_COMPILER))
 
-#include "fpu.defs.hh"
+#include "fpu_defs.hh"
 #include <csetjmp>
 #include <csignal>
 // This inclusion is to work around a bug present in some versions
diff --git a/src/fpu-ia32.inlines.hh b/src/fpu-ia32.inlines.hh
deleted file mode 100644
index 54ba62d..0000000
--- a/src/fpu-ia32.inlines.hh
+++ /dev/null
@@ -1,203 +0,0 @@
-/* IA-32 floating point unit inline related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_fpu_ia32_inlines_hh
-#define PPL_fpu_ia32_inlines_hh 1
-
-#include <csetjmp>
-#include <csignal>
-
-#define FPU_INVALID       0x01
-#define FPU_DIVBYZERO     0x04
-#define FPU_OVERFLOW      0x08
-#define FPU_UNDERFLOW     0x10
-#define FPU_INEXACT       0x20
-
-#define FPU_ALL_EXCEPT \
-  (FPU_INEXACT | FPU_DIVBYZERO | FPU_UNDERFLOW | FPU_OVERFLOW | FPU_INVALID)
-
-#define PPL_FPU_TONEAREST     0
-#define PPL_FPU_DOWNWARD      0x400
-#define PPL_FPU_UPWARD        0x800
-#define PPL_FPU_TOWARDZERO    0xc00
-
-#define FPU_ROUNDING_MASK 0xc00
-
-#define SSE_INEXACT       0x20
-
-#define PPL_FPU_CONTROL_DEFAULT_BASE 0x37f
-#define PPL_SSE_CONTROL_DEFAULT_BASE 0x1f80
-
-// This MUST be congruent with the definition of ROUND_DIRECT
-#define PPL_FPU_CONTROL_DEFAULT \
-  (PPL_FPU_CONTROL_DEFAULT_BASE | PPL_FPU_UPWARD)
-#define PPL_SSE_CONTROL_DEFAULT \
-  (PPL_SSE_CONTROL_DEFAULT_BASE | (PPL_FPU_UPWARD << 3))
-
-namespace Parma_Polyhedra_Library {
-
-typedef struct {
-  unsigned short control_word;
-  unsigned short unused1;
-  unsigned short status_word;
-  unsigned short unused2;
-  unsigned short tags;
-  unsigned short unused3;
-  unsigned int eip;
-  unsigned short cs_selector;
-  unsigned int opcode:11;
-  unsigned int unused4:5;
-  unsigned int data_offset;
-  unsigned short data_selector;
-  unsigned short unused5;
-} ia32_fenv_t;
-
-inline int
-fpu_get_control() {
-  unsigned short cw;
-  __asm__ __volatile__ ("fnstcw %0" : "=m" (*&cw) : : "memory");
-  return cw;
-}
-
-inline void
-fpu_set_control(int c) {
-  unsigned short cw = static_cast<unsigned short>(c);
-  __asm__ __volatile__ ("fldcw %0" : : "m" (*&cw) : "memory");
-}
-
-inline int
-fpu_get_status() {
-  unsigned short sw;
-  __asm__ __volatile__ ("fnstsw %0" : "=a" (sw) : : "memory");
-  return sw;
-}
-
-inline void
-fpu_clear_status(unsigned short bits) {
-  /* There is no fldsw instruction */
-  ia32_fenv_t env;
-  __asm__ __volatile__ ("fnstenv %0" : "=m" (env));
-  env.status_word = static_cast<unsigned short>(env.status_word & ~bits);
-  __asm__ __volatile__ ("fldenv %0" : : "m" (env) : "memory");
-}
-
-inline void
-fpu_clear_exceptions() {
-  __asm__ __volatile__ ("fnclex" : /* No outputs.  */ : : "memory");
-}
-
-#ifdef PPL_FPMATH_MAY_USE_SSE
-inline void
-sse_set_control(unsigned int cw) {
-  __asm__ __volatile__ ("ldmxcsr %0" : : "m" (*&cw) : "memory");
-}
-
-inline unsigned int
-sse_get_control() {
-  unsigned int cw;
-  __asm__ __volatile__ ("stmxcsr %0" : "=m" (*&cw) : : "memory");
-  return cw;
-}
-#endif
-
-inline void
-fpu_initialize_control_functions() {
-#ifdef PPL_FPMATH_MAY_USE_SSE
-  extern void detect_sse_unit();
-  detect_sse_unit();
-#endif
-}
-
-inline fpu_rounding_direction_type
-fpu_get_rounding_direction() {
-  return static_cast<fpu_rounding_direction_type>(fpu_get_control() & FPU_ROUNDING_MASK);
-}
-
-inline void
-fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
-#ifdef PPL_FPMATH_MAY_USE_387
-  fpu_set_control(PPL_FPU_CONTROL_DEFAULT_BASE | dir);
-#endif
-#ifdef PPL_FPMATH_MAY_USE_SSE
-  extern bool have_sse_unit;
-  if (have_sse_unit)
-    sse_set_control(PPL_SSE_CONTROL_DEFAULT_BASE | (dir << 3));
-#endif
-}
-
-inline fpu_rounding_control_word_type
-fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
-#ifdef PPL_FPMATH_MAY_USE_387
-  fpu_set_control(PPL_FPU_CONTROL_DEFAULT_BASE | dir);
-#endif
-#ifdef PPL_FPMATH_MAY_USE_SSE
-  extern bool have_sse_unit;
-  if (have_sse_unit)
-    sse_set_control(PPL_SSE_CONTROL_DEFAULT_BASE | (dir << 3));
-#endif
-  return static_cast<fpu_rounding_control_word_type>(0);
-}
-
-inline void
-fpu_reset_inexact() {
-#ifdef PPL_FPMATH_MAY_USE_387
-  fpu_clear_exceptions();
-#endif
-#ifdef PPL_FPMATH_MAY_USE_SSE
-  // NOTE: on entry to this function the current rounding mode
-  // has to be the default one.
-  extern bool have_sse_unit;
-  if (have_sse_unit)
-    sse_set_control(PPL_SSE_CONTROL_DEFAULT);
-#endif
-}
-
-inline void
-fpu_restore_rounding_direction(fpu_rounding_control_word_type) {
-#ifdef PPL_FPMATH_MAY_USE_387
-  fpu_set_control(PPL_FPU_CONTROL_DEFAULT);
-#endif
-#ifdef PPL_FPMATH_MAY_USE_SSE
-  extern bool have_sse_unit;
-  if (have_sse_unit)
-    sse_set_control(PPL_SSE_CONTROL_DEFAULT);
-#endif
-}
-
-inline int
-fpu_check_inexact() {
-#ifdef PPL_FPMATH_MAY_USE_387
-  if (fpu_get_status() & FPU_INEXACT)
-    return 1;
-#endif
-#ifdef PPL_FPMATH_MAY_USE_SSE
-  extern bool have_sse_unit;
-  if (have_sse_unit && (sse_get_control() & SSE_INEXACT))
-    return 1;
-#endif
-  return 0;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_fpu_ia32_inlines_hh)
diff --git a/src/fpu-ia32_inlines.hh b/src/fpu-ia32_inlines.hh
new file mode 100644
index 0000000..acc87fa
--- /dev/null
+++ b/src/fpu-ia32_inlines.hh
@@ -0,0 +1,203 @@
+/* IA-32 floating point unit inline related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_fpu_ia32_inlines_hh
+#define PPL_fpu_ia32_inlines_hh 1
+
+#include <csetjmp>
+#include <csignal>
+
+#define FPU_INVALID       0x01
+#define FPU_DIVBYZERO     0x04
+#define FPU_OVERFLOW      0x08
+#define FPU_UNDERFLOW     0x10
+#define FPU_INEXACT       0x20
+
+#define FPU_ALL_EXCEPT \
+  (FPU_INEXACT | FPU_DIVBYZERO | FPU_UNDERFLOW | FPU_OVERFLOW | FPU_INVALID)
+
+#define PPL_FPU_TONEAREST     0
+#define PPL_FPU_DOWNWARD      0x400
+#define PPL_FPU_UPWARD        0x800
+#define PPL_FPU_TOWARDZERO    0xc00
+
+#define FPU_ROUNDING_MASK 0xc00
+
+#define SSE_INEXACT       0x20
+
+#define PPL_FPU_CONTROL_DEFAULT_BASE 0x37f
+#define PPL_SSE_CONTROL_DEFAULT_BASE 0x1f80
+
+// This MUST be congruent with the definition of ROUND_DIRECT
+#define PPL_FPU_CONTROL_DEFAULT \
+  (PPL_FPU_CONTROL_DEFAULT_BASE | PPL_FPU_UPWARD)
+#define PPL_SSE_CONTROL_DEFAULT \
+  (PPL_SSE_CONTROL_DEFAULT_BASE | (PPL_FPU_UPWARD << 3))
+
+namespace Parma_Polyhedra_Library {
+
+typedef struct {
+  unsigned short control_word;
+  unsigned short unused1;
+  unsigned short status_word;
+  unsigned short unused2;
+  unsigned short tags;
+  unsigned short unused3;
+  unsigned int eip;
+  unsigned short cs_selector;
+  unsigned int opcode:11;
+  unsigned int unused4:5;
+  unsigned int data_offset;
+  unsigned short data_selector;
+  unsigned short unused5;
+} ia32_fenv_t;
+
+inline int
+fpu_get_control() {
+  unsigned short cw;
+  __asm__ __volatile__ ("fnstcw %0" : "=m" (*&cw) : : "memory");
+  return cw;
+}
+
+inline void
+fpu_set_control(int c) {
+  unsigned short cw = static_cast<unsigned short>(c);
+  __asm__ __volatile__ ("fldcw %0" : : "m" (*&cw) : "memory");
+}
+
+inline int
+fpu_get_status() {
+  unsigned short sw;
+  __asm__ __volatile__ ("fnstsw %0" : "=a" (sw) : : "memory");
+  return sw;
+}
+
+inline void
+fpu_clear_status(unsigned short bits) {
+  /* There is no fldsw instruction */
+  ia32_fenv_t env;
+  __asm__ __volatile__ ("fnstenv %0" : "=m" (env));
+  env.status_word = static_cast<unsigned short>(env.status_word & ~bits);
+  __asm__ __volatile__ ("fldenv %0" : : "m" (env) : "memory");
+}
+
+inline void
+fpu_clear_exceptions() {
+  __asm__ __volatile__ ("fnclex" : /* No outputs.  */ : : "memory");
+}
+
+#ifdef PPL_FPMATH_MAY_USE_SSE
+inline void
+sse_set_control(unsigned int cw) {
+  __asm__ __volatile__ ("ldmxcsr %0" : : "m" (*&cw) : "memory");
+}
+
+inline unsigned int
+sse_get_control() {
+  unsigned int cw;
+  __asm__ __volatile__ ("stmxcsr %0" : "=m" (*&cw) : : "memory");
+  return cw;
+}
+#endif
+
+inline void
+fpu_initialize_control_functions() {
+#ifdef PPL_FPMATH_MAY_USE_SSE
+  extern void detect_sse_unit();
+  detect_sse_unit();
+#endif
+}
+
+inline fpu_rounding_direction_type
+fpu_get_rounding_direction() {
+  return static_cast<fpu_rounding_direction_type>(fpu_get_control() & FPU_ROUNDING_MASK);
+}
+
+inline void
+fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
+#ifdef PPL_FPMATH_MAY_USE_387
+  fpu_set_control(PPL_FPU_CONTROL_DEFAULT_BASE | dir);
+#endif
+#ifdef PPL_FPMATH_MAY_USE_SSE
+  extern bool have_sse_unit;
+  if (have_sse_unit)
+    sse_set_control(PPL_SSE_CONTROL_DEFAULT_BASE | (dir << 3));
+#endif
+}
+
+inline fpu_rounding_control_word_type
+fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
+#ifdef PPL_FPMATH_MAY_USE_387
+  fpu_set_control(PPL_FPU_CONTROL_DEFAULT_BASE | dir);
+#endif
+#ifdef PPL_FPMATH_MAY_USE_SSE
+  extern bool have_sse_unit;
+  if (have_sse_unit)
+    sse_set_control(PPL_SSE_CONTROL_DEFAULT_BASE | (dir << 3));
+#endif
+  return static_cast<fpu_rounding_control_word_type>(0);
+}
+
+inline void
+fpu_reset_inexact() {
+#ifdef PPL_FPMATH_MAY_USE_387
+  fpu_clear_exceptions();
+#endif
+#ifdef PPL_FPMATH_MAY_USE_SSE
+  // NOTE: on entry to this function the current rounding mode
+  // has to be the default one.
+  extern bool have_sse_unit;
+  if (have_sse_unit)
+    sse_set_control(PPL_SSE_CONTROL_DEFAULT);
+#endif
+}
+
+inline void
+fpu_restore_rounding_direction(fpu_rounding_control_word_type) {
+#ifdef PPL_FPMATH_MAY_USE_387
+  fpu_set_control(PPL_FPU_CONTROL_DEFAULT);
+#endif
+#ifdef PPL_FPMATH_MAY_USE_SSE
+  extern bool have_sse_unit;
+  if (have_sse_unit)
+    sse_set_control(PPL_SSE_CONTROL_DEFAULT);
+#endif
+}
+
+inline int
+fpu_check_inexact() {
+#ifdef PPL_FPMATH_MAY_USE_387
+  if (fpu_get_status() & FPU_INEXACT)
+    return 1;
+#endif
+#ifdef PPL_FPMATH_MAY_USE_SSE
+  extern bool have_sse_unit;
+  if (have_sse_unit && (sse_get_control() & SSE_INEXACT))
+    return 1;
+#endif
+  return 0;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_fpu_ia32_inlines_hh)
diff --git a/src/fpu-none.inlines.hh b/src/fpu-none.inlines.hh
deleted file mode 100644
index 2112079..0000000
--- a/src/fpu-none.inlines.hh
+++ /dev/null
@@ -1,75 +0,0 @@
-/* Null floating point unit related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_fpu_none_inlines_hh
-#define PPL_fpu_none_inlines_hh 1
-
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-fpu_initialize_control_functions() {
-  throw std::logic_error("PPL::fpu_initialize_control_functions():"
-			 " cannot control the FPU");
-}
-
-inline fpu_rounding_direction_type
-fpu_get_rounding_direction() {
-  throw std::logic_error("PPL::fpu_get_rounding_direction():"
-			 " cannot control the FPU");
-}
-
-inline void
-fpu_set_rounding_direction(int) {
-  throw std::logic_error("PPL::fpu_set_rounding_direction():"
-			 " cannot control the FPU");
-}
-
-inline int
-fpu_save_rounding_direction(int) {
-  throw std::logic_error("PPL::fpu_save_rounding_direction():"
-			 " cannot control the FPU");
-}
-
-inline void
-fpu_reset_inexact() {
-  throw std::logic_error("PPL::fpu_reset_inexact():"
-			 " cannot control the FPU");
-}
-
-inline void
-fpu_restore_rounding_direction(int) {
-  throw std::logic_error("PPL::fpu_restore_rounding_direction():"
-			 " cannot control the FPU");
-}
-
-inline int
-fpu_check_inexact() {
-  throw std::logic_error("PPL::fpu_check_inexact():"
-			 " cannot control the FPU");
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_fpu_none_inlines_hh)
diff --git a/src/fpu-none_inlines.hh b/src/fpu-none_inlines.hh
new file mode 100644
index 0000000..97da109
--- /dev/null
+++ b/src/fpu-none_inlines.hh
@@ -0,0 +1,75 @@
+/* Null floating point unit related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_fpu_none_inlines_hh
+#define PPL_fpu_none_inlines_hh 1
+
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+fpu_initialize_control_functions() {
+  throw std::logic_error("PPL::fpu_initialize_control_functions():"
+                         " cannot control the FPU");
+}
+
+inline fpu_rounding_direction_type
+fpu_get_rounding_direction() {
+  throw std::logic_error("PPL::fpu_get_rounding_direction():"
+                         " cannot control the FPU");
+}
+
+inline void
+fpu_set_rounding_direction(int) {
+  throw std::logic_error("PPL::fpu_set_rounding_direction():"
+                         " cannot control the FPU");
+}
+
+inline int
+fpu_save_rounding_direction(int) {
+  throw std::logic_error("PPL::fpu_save_rounding_direction():"
+                         " cannot control the FPU");
+}
+
+inline void
+fpu_reset_inexact() {
+  throw std::logic_error("PPL::fpu_reset_inexact():"
+                         " cannot control the FPU");
+}
+
+inline void
+fpu_restore_rounding_direction(int) {
+  throw std::logic_error("PPL::fpu_restore_rounding_direction():"
+                         " cannot control the FPU");
+}
+
+inline int
+fpu_check_inexact() {
+  throw std::logic_error("PPL::fpu_check_inexact():"
+                         " cannot control the FPU");
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_fpu_none_inlines_hh)
diff --git a/src/fpu-sparc.inlines.hh b/src/fpu-sparc.inlines.hh
deleted file mode 100644
index 0c8f5f7..0000000
--- a/src/fpu-sparc.inlines.hh
+++ /dev/null
@@ -1,77 +0,0 @@
-/* SPARC floating point unit related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_fpu_sparc_inlines_hh
-#define PPL_fpu_sparc_inlines_hh 1
-
-#ifdef PPL_HAVE_IEEEFP_H
-#include <ieeefp.h>
-
-#define PPL_FPU_TONEAREST  ((int) FP_RN)
-#define PPL_FPU_UPWARD     ((int) FP_RP)
-#define PPL_FPU_DOWNWARD   ((int) FP_RM)
-#define PPL_FPU_TOWARDZERO ((int) FP_RZ)
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-fpu_initialize_control_functions() {
-}
-
-inline fpu_rounding_direction_type
-fpu_get_rounding_direction() {
-  return static_cast<fpu_rounding_direction_type>(fpgetround());
-}
-
-inline void
-fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
-  fpsetround((fp_rnd) dir);
-}
-
-inline fpu_rounding_control_word_type
-fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
-  return static_cast<fpu_rounding_control_word_type>(fpsetround((fp_rnd) dir));
-}
-
-inline void
-fpu_reset_inexact() {
-  fp_except except = fpgetmask();
-  except &= ~FP_X_IMP;
-  fpsetmask(except);
-}
-
-inline void
-fpu_restore_rounding_direction(fpu_rounding_control_word_type w) {
-  fpsetround((fp_rnd) w);
-}
-
-inline int
-fpu_check_inexact() {
-  return (fpgetmask() & FP_X_IMP) ? 1 : 0;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_HAVE_IEEEFP_H)
-
-#endif // !defined(PPL_fpu_sparc_inlines_hh)
diff --git a/src/fpu-sparc_inlines.hh b/src/fpu-sparc_inlines.hh
new file mode 100644
index 0000000..969a840
--- /dev/null
+++ b/src/fpu-sparc_inlines.hh
@@ -0,0 +1,77 @@
+/* SPARC floating point unit related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_fpu_sparc_inlines_hh
+#define PPL_fpu_sparc_inlines_hh 1
+
+#ifdef PPL_HAVE_IEEEFP_H
+#include <ieeefp.h>
+
+#define PPL_FPU_TONEAREST  ((int) FP_RN)
+#define PPL_FPU_UPWARD     ((int) FP_RP)
+#define PPL_FPU_DOWNWARD   ((int) FP_RM)
+#define PPL_FPU_TOWARDZERO ((int) FP_RZ)
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+fpu_initialize_control_functions() {
+}
+
+inline fpu_rounding_direction_type
+fpu_get_rounding_direction() {
+  return static_cast<fpu_rounding_direction_type>(fpgetround());
+}
+
+inline void
+fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
+  fpsetround((fp_rnd) dir);
+}
+
+inline fpu_rounding_control_word_type
+fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
+  return static_cast<fpu_rounding_control_word_type>(fpsetround((fp_rnd) dir));
+}
+
+inline void
+fpu_reset_inexact() {
+  fp_except except = fpgetmask();
+  except &= ~FP_X_IMP;
+  fpsetmask(except);
+}
+
+inline void
+fpu_restore_rounding_direction(fpu_rounding_control_word_type w) {
+  fpsetround((fp_rnd) w);
+}
+
+inline int
+fpu_check_inexact() {
+  return (fpgetmask() & FP_X_IMP) ? 1 : 0;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_HAVE_IEEEFP_H)
+
+#endif // !defined(PPL_fpu_sparc_inlines_hh)
diff --git a/src/fpu.defs.hh b/src/fpu.defs.hh
deleted file mode 100644
index a3acf1a..0000000
--- a/src/fpu.defs.hh
+++ /dev/null
@@ -1,104 +0,0 @@
-/* Floating point unit related functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_fpu_defs_hh
-#define PPL_fpu_defs_hh 1
-
-#include "fpu.types.hh"
-#include "compiler.hh"
-
-namespace Parma_Polyhedra_Library {
-
-//! \name Functions Controlling Floating Point Unit
-//@{
-
-//! Initializes the FPU control functions.
-void
-fpu_initialize_control_functions();
-
-//! Returns the current FPU rounding direction.
-fpu_rounding_direction_type
-fpu_get_rounding_direction();
-
-//! Sets the FPU rounding direction to \p dir.
-void
-fpu_set_rounding_direction(fpu_rounding_direction_type dir);
-
-/*! \brief
-  Sets the FPU rounding direction to \p dir and returns the rounding
-  control word previously in use.
-*/
-fpu_rounding_control_word_type
-fpu_save_rounding_direction(fpu_rounding_direction_type dir);
-
-/*! \brief
-  Sets the FPU rounding direction to \p dir, clears the <EM>inexact
-  computation</EM> status, and returns the rounding control word
-  previously in use.
-*/
-fpu_rounding_control_word_type
-fpu_save_rounding_direction_reset_inexact(fpu_rounding_direction_type dir);
-
-//! Restores the FPU rounding rounding control word to \p cw.
-void
-fpu_restore_rounding_direction(fpu_rounding_control_word_type w);
-
-//! Clears the <EM>inexact computation</EM> status.
-void
-fpu_reset_inexact();
-
-/*! \brief
-  Queries the <EM>inexact computation</EM> status.
-
-  Returns 0 if the computation was definitely exact, 1 if it was
-  definitely inexact, -1 if definite exactness information is unavailable.
-*/
-int
-fpu_check_inexact();
-
-//@} // Functions Controlling Floating Point Unit
-
-} // namespace Parma_Polyhedra_Library
-
-#if PPL_CAN_CONTROL_FPU
-
-#if defined(__i386__) && (defined(__GNUC__) || defined(__INTEL_COMPILER))
-#include "fpu-ia32.inlines.hh"
-#elif defined(PPL_HAVE_IEEEFP_H)					\
-  && (defined(__sparc)							\
-      || defined(sparc)							\
-      || defined(__sparc__))
-#include "fpu-sparc.inlines.hh"
-#elif defined(PPL_HAVE_FENV_H)
-#include "fpu-c99.inlines.hh"
-#else
-#error "PPL_CAN_CONTROL_FPU evaluates to true: why?"
-#endif
-
-#else // !PPL_CAN_CONTROL_FPU
-
-#include "fpu-none.inlines.hh"
-
-#endif // !PPL_CAN_CONTROL_FPU
-
-#endif // !defined(PPL_fpu_defs_hh)
diff --git a/src/fpu.types.hh b/src/fpu.types.hh
deleted file mode 100644
index 5e719b1..0000000
--- a/src/fpu.types.hh
+++ /dev/null
@@ -1,27 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_fpu_types_hh
-#define PPL_fpu_types_hh 1
-
-#ifdef PPL_HAVE_IEEEFP_H
-#include <ieeefp.h>
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-enum fpu_rounding_direction_type {};
-enum fpu_rounding_control_word_type {};
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_fpu_types_hh)
diff --git a/src/fpu_defs.hh b/src/fpu_defs.hh
new file mode 100644
index 0000000..dce91e4
--- /dev/null
+++ b/src/fpu_defs.hh
@@ -0,0 +1,104 @@
+/* Floating point unit related functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_fpu_defs_hh
+#define PPL_fpu_defs_hh 1
+
+#include "fpu_types.hh"
+#include "compiler.hh"
+
+namespace Parma_Polyhedra_Library {
+
+//! \name Functions Controlling Floating Point Unit
+//@{
+
+//! Initializes the FPU control functions.
+void
+fpu_initialize_control_functions();
+
+//! Returns the current FPU rounding direction.
+fpu_rounding_direction_type
+fpu_get_rounding_direction();
+
+//! Sets the FPU rounding direction to \p dir.
+void
+fpu_set_rounding_direction(fpu_rounding_direction_type dir);
+
+/*! \brief
+  Sets the FPU rounding direction to \p dir and returns the rounding
+  control word previously in use.
+*/
+fpu_rounding_control_word_type
+fpu_save_rounding_direction(fpu_rounding_direction_type dir);
+
+/*! \brief
+  Sets the FPU rounding direction to \p dir, clears the <EM>inexact
+  computation</EM> status, and returns the rounding control word
+  previously in use.
+*/
+fpu_rounding_control_word_type
+fpu_save_rounding_direction_reset_inexact(fpu_rounding_direction_type dir);
+
+//! Restores the FPU rounding rounding control word to \p cw.
+void
+fpu_restore_rounding_direction(fpu_rounding_control_word_type w);
+
+//! Clears the <EM>inexact computation</EM> status.
+void
+fpu_reset_inexact();
+
+/*! \brief
+  Queries the <EM>inexact computation</EM> status.
+
+  Returns 0 if the computation was definitely exact, 1 if it was
+  definitely inexact, -1 if definite exactness information is unavailable.
+*/
+int
+fpu_check_inexact();
+
+//@} // Functions Controlling Floating Point Unit
+
+} // namespace Parma_Polyhedra_Library
+
+#if PPL_CAN_CONTROL_FPU
+
+#if defined(__i386__) && (defined(__GNUC__) || defined(__INTEL_COMPILER))
+#include "fpu-ia32_inlines.hh"
+#elif defined(PPL_HAVE_IEEEFP_H)                                        \
+  && (defined(__sparc)                                                  \
+      || defined(sparc)                                                 \
+      || defined(__sparc__))
+#include "fpu-sparc_inlines.hh"
+#elif defined(PPL_HAVE_FENV_H)
+#include "fpu-c99_inlines.hh"
+#else
+#error "PPL_CAN_CONTROL_FPU evaluates to true: why?"
+#endif
+
+#else // !PPL_CAN_CONTROL_FPU
+
+#include "fpu-none_inlines.hh"
+
+#endif // !PPL_CAN_CONTROL_FPU
+
+#endif // !defined(PPL_fpu_defs_hh)
diff --git a/src/fpu_types.hh b/src/fpu_types.hh
new file mode 100644
index 0000000..e76c3a9
--- /dev/null
+++ b/src/fpu_types.hh
@@ -0,0 +1,27 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_fpu_types_hh
+#define PPL_fpu_types_hh 1
+
+#ifdef PPL_HAVE_IEEEFP_H
+#include <ieeefp.h>
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+enum fpu_rounding_direction_type {};
+enum fpu_rounding_control_word_type {};
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_fpu_types_hh)
diff --git a/src/globals.cc b/src/globals.cc
index 7e11305..a6f3517 100644
--- a/src/globals.cc
+++ b/src/globals.cc
@@ -1,6 +1,6 @@
 /* Definitions of global objects.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,9 +22,9 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "globals.defs.hh"
-#include "Constraint.defs.hh"
-#include "Generator.defs.hh"
+#include "globals_defs.hh"
+#include "Constraint_defs.hh"
+#include "Generator_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
diff --git a/src/globals.defs.hh b/src/globals.defs.hh
deleted file mode 100644
index 15340c2..0000000
--- a/src/globals.defs.hh
+++ /dev/null
@@ -1,550 +0,0 @@
-/* Declarations of global objects.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_globals_defs_hh
-#define PPL_globals_defs_hh 1
-
-#include "globals.types.hh"
-#include "C_Integer.hh"
-#include "meta_programming.hh"
-#include "Slow_Copy.hh"
-#include "Temp.defs.hh"
-#include <exception>
-#include <gmpxx.h>
-
-
-namespace Parma_Polyhedra_Library {
-
-//! Returns a value that does not designate a valid dimension.
-dimension_type
-not_a_dimension();
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the hash code for space dimension \p dim.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-int32_t
-hash_code_from_dimension(dimension_type dim);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Make sure swap() is specialized when needed.
-
-  This will cause a compile-time error whenever a specialization for \p T
-  is beneficial but missing.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-inline typename Enable_If<Slow_Copy<T>::value, void>::type
-swap(T&, T&) {
-  PPL_COMPILE_TIME_CHECK(!Slow_Copy<T>::value, "missing swap specialization");
-}
-
-/*! \brief
-  Declare a local variable named \p id, of type Coefficient, and containing
-  an unknown initial value.
-
-  Use of this macro to declare temporaries of type Coefficient results
-  in decreased memory allocation overhead and in better locality.
-*/
-#define PPL_DIRTY_TEMP_COEFFICIENT(id) \
-PPL_DIRTY_TEMP(Parma_Polyhedra_Library::Coefficient, id)
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Speculative allocation function.
-/*!
-  \return
-  The actual capacity to be allocated.
-
-  \param requested_size
-  The number of elements we need.
-
-  \param maximum_size
-  The maximum number of elements to be allocated. It is assumed
-  to be no less than \p requested_size.
-
-  Computes a capacity given a requested size.
-  Allows for speculative allocation aimed at reducing the number of
-  reallocations enough to guarantee amortized constant insertion time
-  for our vector-like data structures. In all cases, the speculative
-  allocation will not exceed \p maximum_size.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-dimension_type
-compute_capacity(dimension_type requested_size,
-                 dimension_type maximum_size);
-
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Traits class for the deterministic timeout mechanism.
-/*! \ingroup PPL_CXX_interface
-  This abstract base class should be instantiated by those users
-  willing to provide a polynomial upper bound to the time spent
-  by any invocation of a library operator.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-struct Weightwatch_Traits {
-  //! The type used to specify thresholds for computational weight.
-  typedef unsigned long long Threshold;
-
-  //! The type used to specify increments of computational weight.
-  typedef unsigned long long Delta;
-
-  //! Returns the current computational weight.
-  static const Threshold& get();
-
-  //! Compares the two weights \p a and \p b.
-  static bool less_than(const Threshold& a, const Threshold& b);
-
-  //! Computes a \c Delta value from \p unscaled and \p scale.
-  /*!
-    \return
-    \f$u \cdot 2^s\f$, where \f$u\f$ is the value of \p unscaled and
-    \f$s\f$ is the value of \p scale.
-
-    \param unscaled
-    The value of delta before scaling.
-
-    \param scale
-    The scaling to be applied to \p unscaled.
-  */
-  static Delta compute_delta(unsigned long unscaled, unsigned scale);
-
-  //! Sets \p threshold to be \p delta units bigger than the current weight.
-  static void from_delta(Threshold& threshold, const Delta& delta);
-
-  //! The current computational weight.
-  static Threshold weight;
-
-  /*! \brief
-    A pointer to the function that has to be called when checking
-    the reaching of thresholds.
-
-    The pointer can be null if no thresholds are set.
-  */
-  static void (*check_function)(void);
-};
-
-
-#ifndef NDEBUG
-
-class In_Assert {
-private:
-  //! Non zero during evaluation of PPL_ASSERT expression.
-  static unsigned int count;
-public:
-  In_Assert() {
-    ++count;
-  }
-  ~In_Assert() {
-    --count;
-  }
-  static bool asserting() {
-    return count != 0;
-  }
-};
-
-#endif
-
-
-//! User objects the PPL can throw.
-/*! \ingroup PPL_CXX_interface
-  This abstract base class should be instantiated by those users
-  willing to provide a polynomial upper bound to the time spent
-  by any invocation of a library operator.
-*/
-class Throwable {
-public:
-  //! Throws the user defined exception object.
-  virtual void throw_me() const = 0;
-
-  //! Virtual destructor.
-  virtual ~Throwable();
-};
-
-/*! \brief
-  A pointer to an exception object.
-
-  \ingroup PPL_CXX_interface
-  This pointer, which is initialized to zero, is repeatedly checked
-  along any super-linear (i.e., computationally expensive) computation
-  path in the library.
-  When it is found nonzero the exception it points to is thrown.
-  In other words, making this pointer point to an exception (and
-  leaving it in this state) ensures that the library will return
-  control to the client application, possibly by throwing the given
-  exception, within a time that is a linear function of the size
-  of the representation of the biggest object (powerset of polyhedra,
-  polyhedron, system of constraints or generators) on which the library
-  is operating upon.
-
-  \note
-  The only sensible way to assign to this pointer is from within a
-  signal handler or from a parallel thread.  For this reason, the
-  library, apart from ensuring that the pointer is initially set to zero,
-  never assigns to it.  In particular, it does not zero it again when
-  the exception is thrown: it is the client's responsibility to do so.
-*/
-extern const Throwable* volatile abandon_expensive_computations;
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  If the pointer abandon_expensive_computations is found
-  to be nonzero, the exception it points to is thrown.
-
-  \relates Throwable
-*/
-#endif
-void
-maybe_abandon();
-
-//! A tag class.
-/*! \ingroup PPL_CXX_interface
-  Tag class to distinguish those constructors that recycle the data
-  structures of their arguments, instead of taking a copy.
-*/
-struct Recycle_Input {
-};
-
-// Turn s into a string: PPL_STR(x + y) => "x + y".
-#define PPL_STR(s) #s
-// Turn the expansion of s into a string: PPL_XSTR(x) => "x expanded".
-#define PPL_XSTR(s) PPL_STR(s)
-
-#define PPL_OUTPUT_DECLARATIONS                                         \
-  /*! \brief Writes to \c std::cerr an ASCII representation of \p *this. */ \
-  void ascii_dump() const;                                              \
-  /*! \brief Writes to \p s an ASCII representation of \p *this. */     \
-  void ascii_dump(std::ostream& s) const;                               \
-  /*! \brief Prints \p *this to \c std::cerr using \c operator<<. */	\
-  void print() const;
-
-#define PPL_OUTPUT_DEFINITIONS(class_name)			\
-  void								\
-  Parma_Polyhedra_Library::class_name::ascii_dump() const {	\
-    ascii_dump(std::cerr);					\
-  }								\
-								\
-  void								\
-  Parma_Polyhedra_Library::class_name::print() const {		\
-    using IO_Operators::operator<<;				\
-    std::cerr << *this;						\
-  }
-
-#define PPL_OUTPUT_DEFINITIONS_ASCII_ONLY(class_name)			\
-  void									\
-  Parma_Polyhedra_Library::class_name::ascii_dump() const {		\
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  void									\
-  Parma_Polyhedra_Library::class_name::print() const {			\
-    std::cerr << "No user level output operator defined "		\
-	      << "for class " PPL_XSTR(class_name) << "." << std::endl; \
-  }
-
-#define PPL_OUTPUT_TEMPLATE_DEFINITIONS(type_symbol, class_prefix)	\
-  template <typename type_symbol>					\
-  void									\
-  class_prefix::ascii_dump() const {                             \
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  template <typename type_symbol>					\
-  void									\
-  class_prefix::print() const {                                  \
-    using IO_Operators::operator<<;					\
-    std::cerr << *this;							\
-  }
-
-#define PPL_OUTPUT_2_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,		\
-						type_symbol2,		\
-						class_prefix)		\
-  template <typename type_symbol1, typename type_symbol2>		\
-  void									\
-  PPL_U(class_prefix)<PPL_U(type_symbol1), PPL_U(type_symbol2)>         \
-  ::ascii_dump() const {                                                \
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  template <typename type_symbol1, typename type_symbol2>		\
-  void									\
-  PPL_U(class_prefix)<PPL_U(type_symbol1), PPL_U(type_symbol2)>         \
-  ::print() const {                                                     \
-    using IO_Operators::operator<<;					\
-    std::cerr << *this;							\
-  }
-
-#define PPL_OUTPUT_3_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,		\
-						type_symbol2,		\
-						type_symbol3,		\
-						class_prefix)		\
-  template <typename type_symbol1, typename type_symbol2,		\
-            typename type_symbol3>					\
-  void									\
-  PPL_U(class_prefix)<PPL_U(type_symbol1), type_symbol2,                \
-                      PPL_U(type_symbol3)>::ascii_dump()                \
-    const {								\
-    ascii_dump(std::cerr);						\
-  }									\
-                                                                     	\
-    template <typename type_symbol1, typename type_symbol2,		\
-              typename type_symbol3>					\
-    void								\
-    PPL_U(class_prefix)<PPL_U(type_symbol1), type_symbol2,              \
-                        PPL_U(type_symbol3)>::print()                   \
-      const {								\
-      using IO_Operators::operator<<;					\
-      std::cerr << *this;						\
-    }
-
-#define PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(type_symbol, class_prefix) \
-  template <typename type_symbol>					\
-  void									\
-  class_prefix::ascii_dump() const {                                    \
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  template <typename type_symbol>					\
-  void									\
-  class_prefix::print() const {                                         \
-    std::cerr << "No user level output operator defined "		\
-	      << "for " PPL_XSTR(class_prefix) << "." << std::endl;	\
-  }
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if \p c is any kind of space character.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool is_space(char c);
-
-template <typename T, long long v, typename Enable = void>
-struct Fit : public False {
-};
-
-template <typename T, long long v>
-struct Fit<T, v, typename Enable_If<C_Integer<T>::value>::type>  {
-  enum {
-    value = (v >= static_cast<long long>(C_Integer<T>::min)
-             && v <= static_cast<long long>(C_Integer<T>::max))
-  };
-};
-
-template <typename T, T v>
-struct TConstant {
-  static const T value = v;
-};
-
-
-template <typename T, T v>
-const T TConstant<T, v>::value;
-
-template <typename T, long long v, bool prefer_signed = true,
-	  typename Enable = void>
-struct Constant_ : public TConstant<T, v> {
-};
-
-template <typename T, long long v, bool prefer_signed>
-struct Constant_<T, v, prefer_signed,
-		 typename Enable_If<(Fit<typename C_Integer<T>::smaller_signed_type, v>::value
-				     && (prefer_signed
-                                         || !Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value))>::type>
-  : public Constant_<typename C_Integer<T>::smaller_signed_type, v, prefer_signed> {
-};
-
-template <typename T, long long v, bool prefer_signed>
-struct Constant_<T, v, prefer_signed,
-		 typename Enable_If<(Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value
-				     && (!prefer_signed
-                                         || !Fit<typename C_Integer<T>::smaller_signed_type, v>::value))>::type>
-  : public Constant_<typename C_Integer<T>::smaller_unsigned_type, v, prefer_signed> {
-};
-
-template <long long v, bool prefer_signed = true>
-struct Constant : public Constant_<long long, v, prefer_signed> {
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! \name Memory Size Inspection Functions
-//@{
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  For native types, returns the total size in bytes of the memory
-  occupied by the type of the (unused) parameter, i.e., 0.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-typename Enable_If<Is_Native<T>::value, memory_size_type>::type
-total_memory_in_bytes(const T&);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  For native types, returns the size in bytes of the memory managed
-  by the type of the (unused) parameter, i.e., 0.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-typename Enable_If<Is_Native<T>::value, memory_size_type>::type
-external_memory_in_bytes(const T&);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the total size in bytes of the memory occupied by \p x.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-memory_size_type
-total_memory_in_bytes(const mpz_class& x);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the size in bytes of the memory managed by \p x.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-memory_size_type
-external_memory_in_bytes(const mpz_class& x);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the total size in bytes of the memory occupied by \p x.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-memory_size_type
-total_memory_in_bytes(const mpq_class& x);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns the size in bytes of the memory managed by \p x.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-memory_size_type
-external_memory_in_bytes(const mpq_class& x);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//@} // Memory Size Inspection Functions
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-
-
-template <typename T, typename Enable = void>
-struct Has_OK : public False { };
-
-template <typename T>
-struct Has_OK<T, typename Enable_If_Is<bool (T::*)() const, &T::OK>::type>
-  : public True {
-};
-
-template <typename T>
-inline typename Enable_If<Has_OK<T>::value, bool>::type
-f_OK(const T& to) {
-  return to.OK();
-}
-
-#define FOK(T) inline bool f_OK(const T&) { return true; }
-
-FOK(char)
-FOK(signed char)
-FOK(unsigned char)
-FOK(signed short)
-FOK(unsigned short)
-FOK(signed int)
-FOK(unsigned int)
-FOK(signed long)
-FOK(unsigned long)
-FOK(signed long long)
-FOK(unsigned long long)
-FOK(float)
-FOK(double)
-FOK(long double)
-FOK(mpz_class)
-FOK(mpq_class)
-
-void ascii_dump(std::ostream& s, Representation r);
-bool ascii_load(std::istream& s, Representation& r);
-
-dimension_type
-check_space_dimension_overflow(dimension_type dim,
-                               dimension_type max,
-                               const char* domain,
-                               const char* method,
-                               const char* reason);
-
-template <typename RA_Container>
-typename RA_Container::iterator
-nth_iter(RA_Container& cont, dimension_type n);
-
-template <typename RA_Container>
-typename RA_Container::const_iterator
-nth_iter(const RA_Container& cont, dimension_type n);
-
-dimension_type
-least_significant_one_mask(dimension_type i);
-
-} // namespace Parma_Polyhedra_Library
-
-// By default, use sparse matrices both for MIP_Problem and PIP_Problem.
-#ifndef PPL_USE_SPARSE_MATRIX
-#define PPL_USE_SPARSE_MATRIX 1
-#endif
-
-#ifndef PPL_PROFILE_ADD_WEIGHT
-#define PPL_PROFILE_ADD_WEIGHT 0
-#endif
-
-#if defined(NDEBUG) && PPL_PROFILE_ADD_WEIGHT
-#include "Weight_Profiler.defs.hh"
-#endif
-
-#if defined(NDEBUG)
-#if PPL_PROFILE_ADD_WEIGHT
-#define WEIGHT_BEGIN() Weight_Profiler::begin()
-#define WEIGHT_ADD(delta)                                     \
-  do {                                                        \
-    static Weight_Profiler wp__(__FILE__, __LINE__, delta);   \
-    wp__.end();                                               \
-  } while (false)
-#define WEIGHT_ADD_MUL(delta, factor)                                   \
-  do {                                                                  \
-    static Weight_Profiler wp__(__FILE__, __LINE__, delta);             \
-    wp__.end(factor);                                                   \
-  } while (false)
-#else
-#define WEIGHT_BEGIN()                          \
-  do {                                          \
-  } while (false)
-#define WEIGHT_ADD(delta)                       \
-  do {                                          \
-    Weightwatch_Traits::weight += (delta);      \
-  } while (false)
-#define WEIGHT_ADD_MUL(delta, factor)                   \
-  do {                                                  \
-    Weightwatch_Traits::weight += (delta)*(factor);     \
-  } while (false)
-#endif
-#else
-#define WEIGHT_BEGIN()
-#define WEIGHT_ADD(delta)                       \
-  do {                                          \
-    if (!In_Assert::asserting())                       \
-      Weightwatch_Traits::weight += delta;      \
-  } while (false)
-#define WEIGHT_ADD_MUL(delta, factor)                   \
-  do {                                                  \
-    if (!In_Assert::asserting())                               \
-      Weightwatch_Traits::weight += delta * factor;     \
-  } while (false)
-#endif
-
-#include "globals.inlines.hh"
-
-#endif // !defined(PPL_globals_defs_hh)
diff --git a/src/globals.inlines.hh b/src/globals.inlines.hh
deleted file mode 100644
index 8250d63..0000000
--- a/src/globals.inlines.hh
+++ /dev/null
@@ -1,190 +0,0 @@
-/* Implementation of global objects: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_globals_inlines_hh
-#define PPL_globals_inlines_hh 1
-
-#include "compiler.hh"
-#include <limits>
-#include <cassert>
-#include <istream>
-#include <ostream>
-#include <cctype>
-#include <stdexcept>
-
-namespace Parma_Polyhedra_Library {
-
-inline dimension_type
-not_a_dimension() {
-  return std::numeric_limits<dimension_type>::max();
-}
-
-inline int32_t
-hash_code_from_dimension(dimension_type dim) {
-  const dimension_type divisor = 1U << (32 - 1);
-  dim = dim % divisor;
-  return static_cast<int32_t>(dim);
-}
-
-inline const Weightwatch_Traits::Threshold&
-Weightwatch_Traits::get() {
-  return weight;
-}
-
-inline bool
-Weightwatch_Traits::less_than(const Threshold& a, const Threshold& b) {
-  return b - a < (1ULL << (sizeof_to_bits(sizeof(Threshold)) - 1));
-}
-
-inline Weightwatch_Traits::Delta
-Weightwatch_Traits::compute_delta(unsigned long unscaled, unsigned scale) {
-  if ((std::numeric_limits<Delta>::max() >> scale) < unscaled)
-    throw std::invalid_argument("PPL::Weightwatch_Traits::"
-                                "compute_delta(u, s):\n"
-                                "values of u and s cause wrap around.");
-  return static_cast<Delta>(unscaled) << scale;
-}
-
-inline void
-Weightwatch_Traits::from_delta(Threshold& threshold, const Delta& delta) {
-  threshold = weight + delta;
-}
-
-inline
-Throwable::~Throwable() {
-}
-
-inline void
-maybe_abandon() {
-#ifndef NDEBUG
-  if (In_Assert::asserting())
-    return;
-#endif
-  if (Weightwatch_Traits::check_function != 0)
-    Weightwatch_Traits::check_function();
-  if (const Throwable* p = abandon_expensive_computations)
-    p->throw_me();
-}
-
-inline dimension_type
-compute_capacity(const dimension_type requested_size,
-		 const dimension_type maximum_size) {
-  assert(requested_size <= maximum_size);
-  // Speculation factor 2.
-  return (requested_size < maximum_size/2)
-    ? (2*(requested_size + 1))
-    : maximum_size;
-  // Speculation factor 1.5.
-  // return (maximum_size - requested_size > requested_size/2)
-  //   ? requested_size + requested_size/2 + 1
-  //   : maximum_size;
-}
-
-template <typename T>
-inline typename
-Enable_If<Is_Native<T>::value, memory_size_type>::type
-external_memory_in_bytes(const T&) {
-  return 0;
-}
-
-template <typename T>
-inline typename
-Enable_If<Is_Native<T>::value, memory_size_type>::type
-total_memory_in_bytes(const T&) {
-  return sizeof(T);
-}
-
-inline memory_size_type
-external_memory_in_bytes(const mpz_class& x) {
-  return static_cast<memory_size_type>(x.get_mpz_t()[0]._mp_alloc)
-    * PPL_SIZEOF_MP_LIMB_T;
-}
-
-inline memory_size_type
-total_memory_in_bytes(const mpz_class& x) {
-  return sizeof(x) + external_memory_in_bytes(x);
-}
-
-inline memory_size_type
-external_memory_in_bytes(const mpq_class& x) {
-  return external_memory_in_bytes(x.get_num())
-    + external_memory_in_bytes(x.get_den());
-}
-
-inline memory_size_type
-total_memory_in_bytes(const mpq_class& x) {
-  return sizeof(x) + external_memory_in_bytes(x);
-}
-
-inline void
-ascii_dump(std::ostream& s, Representation r) {
-  if (r == DENSE)
-    s << "DENSE";
-  else
-    s << "SPARSE";
-}
-
-inline bool
-ascii_load(std::istream& is, Representation& r) {
-  std::string s;
-  if (!(is >> s))
-    return false;
-
-  if (s == "DENSE")  {
-    r = DENSE;
-    return true;
-  }
-  if (s == "SPARSE")  {
-    r = SPARSE;
-    return true;
-  }
-  return false;
-}
-
-inline bool
-is_space(char c) {
-  return isspace(c) != 0;
-}
-
-template <typename RA_Container>
-inline typename RA_Container::iterator
-nth_iter(RA_Container& cont, dimension_type n) {
-  typedef typename RA_Container::difference_type diff_t;
-  return cont.begin() + static_cast<diff_t>(n);
-}
-
-template <typename RA_Container>
-inline typename RA_Container::const_iterator
-nth_iter(const RA_Container& cont, dimension_type n) {
-  typedef typename RA_Container::difference_type diff_t;
-  return cont.begin() + static_cast<diff_t>(n);
-}
-
-inline dimension_type
-least_significant_one_mask(const dimension_type i) {
-  return i & (~i + 1U);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_globals_inlines_hh)
diff --git a/src/globals.types.hh b/src/globals.types.hh
deleted file mode 100644
index 41aa345..0000000
--- a/src/globals.types.hh
+++ /dev/null
@@ -1,214 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_globals_types_hh
-#define PPL_globals_types_hh 1
-
-#include <cstddef>
-
-namespace Parma_Polyhedra_Library {
-
-//! An unsigned integral type for representing space dimensions.
-/*! \ingroup PPL_CXX_interface */
-typedef size_t dimension_type;
-
-//! An unsigned integral type for representing memory size in bytes.
-/*! \ingroup PPL_CXX_interface */
-typedef size_t memory_size_type;
-
-//! Kinds of degenerate abstract elements.
-/*! \ingroup PPL_CXX_interface */
-enum Degenerate_Element {
-  //! The universe element, i.e., the whole vector space.
-  UNIVERSE,
-  //! The empty element, i.e., the empty set.
-  EMPTY
-};
-
-//! Relation symbols.
-/*! \ingroup PPL_CXX_interface */
-// This must be kept in sync with Result
-enum Relation_Symbol {
-  //! \hideinitializer Equal to.
-  EQUAL = 1U,
-  //! \hideinitializer Less than.
-  LESS_THAN = 2U,
-  //! \hideinitializer Less than or equal to.
-  LESS_OR_EQUAL = LESS_THAN | EQUAL,
-  //! \hideinitializer Greater than.
-  GREATER_THAN = 4U,
-  //! \hideinitializer Greater than or equal to.
-  GREATER_OR_EQUAL = GREATER_THAN | EQUAL,
-  //! \hideinitializer Not equal to.
-  NOT_EQUAL = LESS_THAN | GREATER_THAN
-};
-
-//! Complexity pseudo-classes.
-/*! \ingroup PPL_CXX_interface */
-enum Complexity_Class {
-  //! Worst-case polynomial complexity.
-  POLYNOMIAL_COMPLEXITY,
-  //! Worst-case exponential complexity but typically polynomial behavior.
-  SIMPLEX_COMPLEXITY,
-  //! Any complexity.
-  ANY_COMPLEXITY
-};
-
-//! Possible optimization modes.
-/*! \ingroup PPL_CXX_interface */
-enum Optimization_Mode {
-  //! Minimization is requested.
-  MINIMIZATION,
-  //! Maximization is requested.
-  MAXIMIZATION
-};
-
-/*! \brief \ingroup PPL_CXX_interface
-  Widths of bounded integer types.
-
-  See the section on
-  \ref Approximating_Bounded_Integers "approximating bounded integers".
-*/
-enum Bounded_Integer_Type_Width {
-  //! \hideinitializer 8 bits.
-  BITS_8 = 8,
-
-  //! \hideinitializer 16 bits.
-  BITS_16 = 16,
-
-  //! \hideinitializer 32 bits.
-  BITS_32 = 32,
-
-  //! \hideinitializer 64 bits.
-  BITS_64 = 64,
-
-  //! \hideinitializer 128 bits.
-  BITS_128 = 128
-};
-
-/*! \brief \ingroup PPL_CXX_interface
-  Representation of bounded integer types.
-
-  See the section on
-  \ref Approximating_Bounded_Integers "approximating bounded integers".
-*/
-enum Bounded_Integer_Type_Representation {
-  //! Unsigned binary.
-  UNSIGNED,
-
-  /*! \brief
-    Signed binary where negative values are represented by the two's
-    complement of the absolute value.
-  */
-  SIGNED_2_COMPLEMENT
-};
-
-/*! \brief \ingroup PPL_CXX_interface
-  Overflow behavior of bounded integer types.
-
-  See the section on
-  \ref Approximating_Bounded_Integers "approximating bounded integers".
-*/
-enum Bounded_Integer_Type_Overflow {
-  /*! \brief
-    On overflow, wrapping takes place.
-
-    This means that, for a \f$w\f$-bit bounded integer, the computation
-    happens modulo \f$2^w\f$.
-  */
-  OVERFLOW_WRAPS,
-
-  /*! \brief
-    On overflow, the result is undefined.
-
-    This simply means that the result of the operation resulting in an
-    overflow can take any value.
-
-    \note
-    Even though something more serious can happen in the system
-    being analyzed ---due to, e.g., C's undefined behavior---, here we
-    are only concerned with the results of arithmetic operations.
-    It is the responsibility of the analyzer to ensure that other
-    manifestations of undefined behavior are conservatively approximated.
-  */
-  OVERFLOW_UNDEFINED,
-
-  /*! \brief
-    Overflow is impossible.
-
-    This is for the analysis of languages where overflow is trapped
-    before it affects the state, for which, thus, any indication that
-    an overflow may have affected the state is necessarily due to
-    the imprecision of the analysis.
-  */
-  OVERFLOW_IMPOSSIBLE
-};
-
-/*! \brief \ingroup PPL_CXX_interface
-  Possible representations of coefficient sequences (i.e. linear expressions
-  and more complex objects containing linear expressions, e.g. Constraints,
-  Generators, etc.).
-*/
-enum Representation {
-  /*! \brief
-    Dense representation: the coefficient sequence is represented as a vector
-    of coefficients, including the zero coefficients.
-    If there are only a few nonzero coefficients, this representation is
-    faster and also uses a bit less memory.
-  */
-  DENSE,
-
-  /*! \brief
-    Sparse representation: only the nonzero coefficient are stored.
-    If there are many nonzero coefficients, this improves memory consumption
-    and run time (both because there is less data to process in O(n)
-    operations and because finding zeroes/nonzeroes is much faster since
-    zeroes are not stored at all, so any stored coefficient is nonzero).
-  */
-  SPARSE
-};
-
-/*! \brief \ingroup PPL_CXX_interface
-  Floating point formats known to the library.
-
-  The parameters of each format are defined by a specific struct
-  in file Float.defs.hh.  See the section on \ref floating_point
-  "Analysis of floating point computations" for more information.
-*/
-enum Floating_Point_Format {
-  //! IEEE 754 half precision, 16 bits (5 exponent, 10 mantissa).
-  IEEE754_HALF,
-
-  //! IEEE 754 single precision, 32 bits (8 exponent, 23 mantissa).
-  IEEE754_SINGLE,
-
-  //! IEEE 754 double precision, 64 bits (11 exponent, 52 mantissa).
-  IEEE754_DOUBLE,
-
-  //! IEEE 754 quad precision, 128 bits (15 exponent, 112 mantissa).
-  IEEE754_QUAD,
-
-  //! Intel double extended precision, 80 bits (15 exponent, 64 mantissa)
-  INTEL_DOUBLE_EXTENDED,
-
-  //! IBM single precision, 32 bits (7 exponent, 24 mantissa).
-  IBM_SINGLE,
-
-  //! IBM double precision, 64 bits (7 exponent, 56 mantissa).
-  IBM_DOUBLE
-};
-
-struct Weightwatch_Traits;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_globals_types_hh)
diff --git a/src/globals_defs.hh b/src/globals_defs.hh
new file mode 100644
index 0000000..9ac1915
--- /dev/null
+++ b/src/globals_defs.hh
@@ -0,0 +1,564 @@
+/* Declarations of global objects.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_globals_defs_hh
+#define PPL_globals_defs_hh 1
+
+#include "globals_types.hh"
+#include "C_Integer.hh"
+#include "meta_programming.hh"
+#include "Slow_Copy.hh"
+#include "Temp_defs.hh"
+#include <exception>
+#include <gmpxx.h>
+
+#ifndef PPL_PROFILE_ADD_WEIGHT
+#define PPL_PROFILE_ADD_WEIGHT 0
+#endif
+
+#if defined(NDEBUG) && PPL_PROFILE_ADD_WEIGHT
+#include "Weight_Profiler_defs.hh"
+#endif
+
+#if defined(NDEBUG)
+
+#if PPL_PROFILE_ADD_WEIGHT
+
+#define WEIGHT_BEGIN() Weight_Profiler::begin()
+
+#define WEIGHT_ADD(delta)                                     \
+  do {                                                        \
+    static Weight_Profiler wp__(__FILE__, __LINE__, delta);   \
+    wp__.end();                                               \
+  } while (false)
+
+#define WEIGHT_ADD_MUL(delta, factor)                                   \
+  do {                                                                  \
+    static Weight_Profiler wp__(__FILE__, __LINE__, delta);             \
+    wp__.end(factor);                                                   \
+  } while (false)
+
+#else // !PPL_PROFILE_ADD_WEIGHT
+
+#define WEIGHT_BEGIN()                          \
+  do {                                          \
+  } while (false)
+
+#define WEIGHT_ADD(delta)                       \
+  do {                                          \
+    Weightwatch_Traits::weight += (delta);      \
+  } while (false)
+
+#define WEIGHT_ADD_MUL(delta, factor)                   \
+  do {                                                  \
+    Weightwatch_Traits::weight += (delta)*(factor);     \
+  } while (false)
+
+#endif // !PPL_PROFILE_ADD_WEIGHT
+
+#else // !defined(NDEBUG)
+
+#define WEIGHT_BEGIN()
+
+#define WEIGHT_ADD(delta)                       \
+  do {                                          \
+    if (!In_Assert::asserting())                \
+      Weightwatch_Traits::weight += delta;      \
+  } while (false)
+
+#define WEIGHT_ADD_MUL(delta, factor)                   \
+  do {                                                  \
+    if (!In_Assert::asserting())                        \
+      Weightwatch_Traits::weight += delta * factor;     \
+  } while (false)
+
+#endif // !defined(NDEBUG)
+
+
+namespace Parma_Polyhedra_Library {
+
+//! Returns a value that does not designate a valid dimension.
+dimension_type
+not_a_dimension();
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the hash code for space dimension \p dim.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+int32_t
+hash_code_from_dimension(dimension_type dim);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Make sure swap() is specialized when needed.
+
+  This will cause a compile-time error whenever a specialization for \p T
+  is beneficial but missing.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+inline typename Enable_If<Slow_Copy<T>::value, void>::type
+swap(T&, T&) {
+  PPL_COMPILE_TIME_CHECK(!Slow_Copy<T>::value, "missing swap specialization");
+}
+
+/*! \brief
+  Declare a local variable named \p id, of type Coefficient, and containing
+  an unknown initial value.
+
+  Use of this macro to declare temporaries of type Coefficient results
+  in decreased memory allocation overhead and in better locality.
+*/
+#define PPL_DIRTY_TEMP_COEFFICIENT(id) \
+PPL_DIRTY_TEMP(Parma_Polyhedra_Library::Coefficient, id)
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Speculative allocation function.
+/*!
+  \return
+  The actual capacity to be allocated.
+
+  \param requested_size
+  The number of elements we need.
+
+  \param maximum_size
+  The maximum number of elements to be allocated. It is assumed
+  to be no less than \p requested_size.
+
+  Computes a capacity given a requested size.
+  Allows for speculative allocation aimed at reducing the number of
+  reallocations enough to guarantee amortized constant insertion time
+  for our vector-like data structures. In all cases, the speculative
+  allocation will not exceed \p maximum_size.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+dimension_type
+compute_capacity(dimension_type requested_size,
+                 dimension_type maximum_size);
+
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Traits class for the deterministic timeout mechanism.
+/*! \ingroup PPL_CXX_interface
+  This abstract base class should be instantiated by those users
+  willing to provide a polynomial upper bound to the time spent
+  by any invocation of a library operator.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+struct Weightwatch_Traits {
+  //! The type used to specify thresholds for computational weight.
+  typedef unsigned long long Threshold;
+
+  //! The type used to specify increments of computational weight.
+  typedef unsigned long long Delta;
+
+  //! Returns the current computational weight.
+  static const Threshold& get();
+
+  //! Compares the two weights \p a and \p b.
+  static bool less_than(const Threshold& a, const Threshold& b);
+
+  //! Computes a \c Delta value from \p unscaled and \p scale.
+  /*!
+    \return
+    \f$u \cdot 2^s\f$, where \f$u\f$ is the value of \p unscaled and
+    \f$s\f$ is the value of \p scale.
+
+    \param unscaled
+    The value of delta before scaling.
+
+    \param scale
+    The scaling to be applied to \p unscaled.
+  */
+  static Delta compute_delta(unsigned long unscaled, unsigned scale);
+
+  //! Sets \p threshold to be \p delta units bigger than the current weight.
+  static void from_delta(Threshold& threshold, const Delta& delta);
+
+  //! The current computational weight.
+  static Threshold weight;
+
+  /*! \brief
+    A pointer to the function that has to be called when checking
+    the reaching of thresholds.
+
+    The pointer can be null if no thresholds are set.
+  */
+  static void (*check_function)(void);
+};
+
+
+#ifndef NDEBUG
+
+class In_Assert {
+private:
+  //! Non zero during evaluation of PPL_ASSERT expression.
+  static unsigned int count;
+public:
+  In_Assert() {
+    ++count;
+  }
+  ~In_Assert() {
+    --count;
+  }
+  static bool asserting() {
+    return count != 0;
+  }
+};
+
+#endif
+
+
+//! User objects the PPL can throw.
+/*! \ingroup PPL_CXX_interface
+  This abstract base class should be instantiated by those users
+  willing to provide a polynomial upper bound to the time spent
+  by any invocation of a library operator.
+*/
+class Throwable {
+public:
+  //! Throws the user defined exception object.
+  virtual void throw_me() const = 0;
+
+  //! Virtual destructor.
+  virtual ~Throwable();
+};
+
+/*! \brief
+  A pointer to an exception object.
+
+  \ingroup PPL_CXX_interface
+  This pointer, which is initialized to zero, is repeatedly checked
+  along any super-linear (i.e., computationally expensive) computation
+  path in the library.
+  When it is found nonzero the exception it points to is thrown.
+  In other words, making this pointer point to an exception (and
+  leaving it in this state) ensures that the library will return
+  control to the client application, possibly by throwing the given
+  exception, within a time that is a linear function of the size
+  of the representation of the biggest object (powerset of polyhedra,
+  polyhedron, system of constraints or generators) on which the library
+  is operating upon.
+
+  \note
+  The only sensible way to assign to this pointer is from within a
+  signal handler or from a parallel thread.  For this reason, the
+  library, apart from ensuring that the pointer is initially set to zero,
+  never assigns to it.  In particular, it does not zero it again when
+  the exception is thrown: it is the client's responsibility to do so.
+*/
+extern const Throwable* volatile abandon_expensive_computations;
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  If the pointer abandon_expensive_computations is found
+  to be nonzero, the exception it points to is thrown.
+
+  \relates Throwable
+*/
+#endif
+void
+maybe_abandon();
+
+//! A tag class.
+/*! \ingroup PPL_CXX_interface
+  Tag class to distinguish those constructors that recycle the data
+  structures of their arguments, instead of taking a copy.
+*/
+struct Recycle_Input {
+};
+
+// Turn s into a string: PPL_STR(x + y) => "x + y".
+#define PPL_STR(s) #s
+// Turn the expansion of s into a string: PPL_XSTR(x) => "x expanded".
+#define PPL_XSTR(s) PPL_STR(s)
+
+#define PPL_OUTPUT_DECLARATIONS                                         \
+  /*! \brief Writes to \c std::cerr an ASCII representation of \p *this. */ \
+  void ascii_dump() const;                                              \
+  /*! \brief Writes to \p s an ASCII representation of \p *this. */     \
+  void ascii_dump(std::ostream& s) const;                               \
+  /*! \brief Prints \p *this to \c std::cerr using \c operator<<. */    \
+  void print() const;
+
+#define PPL_OUTPUT_DEFINITIONS(class_name)                      \
+  void                                                          \
+  Parma_Polyhedra_Library::class_name::ascii_dump() const {     \
+    ascii_dump(std::cerr);                                      \
+  }                                                             \
+                                                                \
+  void                                                          \
+  Parma_Polyhedra_Library::class_name::print() const {          \
+    using IO_Operators::operator<<;                             \
+    std::cerr << *this;                                         \
+  }
+
+#define PPL_OUTPUT_DEFINITIONS_ASCII_ONLY(class_name)                   \
+  void                                                                  \
+  Parma_Polyhedra_Library::class_name::ascii_dump() const {             \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  void                                                                  \
+  Parma_Polyhedra_Library::class_name::print() const {                  \
+    std::cerr << "No user level output operator defined "               \
+              << "for class " PPL_XSTR(class_name) << "." << std::endl; \
+  }
+
+#define PPL_OUTPUT_TEMPLATE_DEFINITIONS(type_symbol, class_prefix)      \
+  template <typename type_symbol>                                       \
+  void                                                                  \
+  class_prefix::ascii_dump() const {                             \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  template <typename type_symbol>                                       \
+  void                                                                  \
+  class_prefix::print() const {                                  \
+    using IO_Operators::operator<<;                                     \
+    std::cerr << *this;                                                 \
+  }
+
+#define PPL_OUTPUT_2_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,           \
+                                                type_symbol2,           \
+                                                class_prefix)           \
+  template <typename type_symbol1, typename type_symbol2>               \
+  void                                                                  \
+  PPL_U(class_prefix)<PPL_U(type_symbol1), PPL_U(type_symbol2)>         \
+  ::ascii_dump() const {                                                \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  template <typename type_symbol1, typename type_symbol2>               \
+  void                                                                  \
+  PPL_U(class_prefix)<PPL_U(type_symbol1), PPL_U(type_symbol2)>         \
+  ::print() const {                                                     \
+    using IO_Operators::operator<<;                                     \
+    std::cerr << *this;                                                 \
+  }
+
+#define PPL_OUTPUT_3_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,           \
+                                                type_symbol2,           \
+                                                type_symbol3,           \
+                                                class_prefix)           \
+  template <typename type_symbol1, typename type_symbol2,               \
+            typename type_symbol3>                                      \
+  void                                                                  \
+  PPL_U(class_prefix)<PPL_U(type_symbol1), type_symbol2,                \
+                      PPL_U(type_symbol3)>::ascii_dump()                \
+    const {                                                             \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+    template <typename type_symbol1, typename type_symbol2,             \
+              typename type_symbol3>                                    \
+    void                                                                \
+    PPL_U(class_prefix)<PPL_U(type_symbol1), type_symbol2,              \
+                        PPL_U(type_symbol3)>::print()                   \
+      const {                                                           \
+      using IO_Operators::operator<<;                                   \
+      std::cerr << *this;                                               \
+    }
+
+#define PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(type_symbol, class_prefix) \
+  template <typename type_symbol>                                       \
+  void                                                                  \
+  class_prefix::ascii_dump() const {                                    \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  template <typename type_symbol>                                       \
+  void                                                                  \
+  class_prefix::print() const {                                         \
+    std::cerr << "No user level output operator defined "               \
+              << "for " PPL_XSTR(class_prefix) << "." << std::endl;     \
+  }
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if \p c is any kind of space character.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool is_space(char c);
+
+template <typename T, long long v, typename Enable = void>
+struct Fit : public False {
+};
+
+template <typename T, long long v>
+struct Fit<T, v, typename Enable_If<C_Integer<T>::value>::type>  {
+  enum {
+    value = (v >= static_cast<long long>(C_Integer<T>::min)
+             && v <= static_cast<long long>(C_Integer<T>::max))
+  };
+};
+
+template <typename T, T v>
+struct TConstant {
+  static const T value = v;
+};
+
+
+template <typename T, T v>
+const T TConstant<T, v>::value;
+
+template <typename T, long long v, bool prefer_signed = true,
+          typename Enable = void>
+struct Constant_ : public TConstant<T, v> {
+};
+
+template <typename T, long long v, bool prefer_signed>
+struct Constant_<T, v, prefer_signed,
+                 typename Enable_If<(Fit<typename C_Integer<T>::smaller_signed_type, v>::value
+                                     && (prefer_signed
+                                         || !Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value))>::type>
+  : public Constant_<typename C_Integer<T>::smaller_signed_type, v, prefer_signed> {
+};
+
+template <typename T, long long v, bool prefer_signed>
+struct Constant_<T, v, prefer_signed,
+                 typename Enable_If<(Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value
+                                     && (!prefer_signed
+                                         || !Fit<typename C_Integer<T>::smaller_signed_type, v>::value))>::type>
+  : public Constant_<typename C_Integer<T>::smaller_unsigned_type, v, prefer_signed> {
+};
+
+template <long long v, bool prefer_signed = true>
+struct Constant : public Constant_<long long, v, prefer_signed> {
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! \name Memory Size Inspection Functions
+//@{
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  For native types, returns the total size in bytes of the memory
+  occupied by the type of the (unused) parameter, i.e., 0.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+typename Enable_If<Is_Native<T>::value, memory_size_type>::type
+total_memory_in_bytes(const T&);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  For native types, returns the size in bytes of the memory managed
+  by the type of the (unused) parameter, i.e., 0.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+typename Enable_If<Is_Native<T>::value, memory_size_type>::type
+external_memory_in_bytes(const T&);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the total size in bytes of the memory occupied by \p x.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+memory_size_type
+total_memory_in_bytes(const mpz_class& x);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the size in bytes of the memory managed by \p x.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+memory_size_type
+external_memory_in_bytes(const mpz_class& x);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the total size in bytes of the memory occupied by \p x.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+memory_size_type
+total_memory_in_bytes(const mpq_class& x);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns the size in bytes of the memory managed by \p x.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+memory_size_type
+external_memory_in_bytes(const mpq_class& x);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//@} // Memory Size Inspection Functions
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+
+
+template <typename T, typename Enable = void>
+struct Has_OK : public False { };
+
+template <typename T>
+struct Has_OK<T, typename Enable_If_Is<bool (T::*)() const, &T::OK>::type>
+  : public True {
+};
+
+template <typename T>
+inline typename Enable_If<Has_OK<T>::value, bool>::type
+f_OK(const T& to) {
+  return to.OK();
+}
+
+#define FOK(T) inline bool f_OK(const T&) { return true; }
+
+FOK(char)
+FOK(signed char)
+FOK(unsigned char)
+FOK(signed short)
+FOK(unsigned short)
+FOK(signed int)
+FOK(unsigned int)
+FOK(signed long)
+FOK(unsigned long)
+FOK(signed long long)
+FOK(unsigned long long)
+FOK(float)
+FOK(double)
+FOK(long double)
+FOK(mpz_class)
+FOK(mpq_class)
+
+void ascii_dump(std::ostream& s, Representation r);
+bool ascii_load(std::istream& s, Representation& r);
+
+dimension_type
+check_space_dimension_overflow(dimension_type dim,
+                               dimension_type max,
+                               const char* domain,
+                               const char* method,
+                               const char* reason);
+
+template <typename RA_Container>
+typename RA_Container::iterator
+nth_iter(RA_Container& cont, dimension_type n);
+
+template <typename RA_Container>
+typename RA_Container::const_iterator
+nth_iter(const RA_Container& cont, dimension_type n);
+
+dimension_type
+least_significant_one_mask(dimension_type i);
+
+} // namespace Parma_Polyhedra_Library
+
+// By default, use sparse matrices both for MIP_Problem and PIP_Problem.
+#ifndef PPL_USE_SPARSE_MATRIX
+#define PPL_USE_SPARSE_MATRIX 1
+#endif
+
+#include "globals_inlines.hh"
+
+#endif // !defined(PPL_globals_defs_hh)
diff --git a/src/globals_inlines.hh b/src/globals_inlines.hh
new file mode 100644
index 0000000..7aabcf0
--- /dev/null
+++ b/src/globals_inlines.hh
@@ -0,0 +1,190 @@
+/* Implementation of global objects: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_globals_inlines_hh
+#define PPL_globals_inlines_hh 1
+
+#include "compiler.hh"
+#include <limits>
+#include <cassert>
+#include <istream>
+#include <ostream>
+#include <cctype>
+#include <stdexcept>
+
+namespace Parma_Polyhedra_Library {
+
+inline dimension_type
+not_a_dimension() {
+  return std::numeric_limits<dimension_type>::max();
+}
+
+inline int32_t
+hash_code_from_dimension(dimension_type dim) {
+  const dimension_type divisor = 1U << (32 - 1);
+  dim = dim % divisor;
+  return static_cast<int32_t>(dim);
+}
+
+inline const Weightwatch_Traits::Threshold&
+Weightwatch_Traits::get() {
+  return weight;
+}
+
+inline bool
+Weightwatch_Traits::less_than(const Threshold& a, const Threshold& b) {
+  return b - a < (1ULL << (sizeof_to_bits(sizeof(Threshold)) - 1));
+}
+
+inline Weightwatch_Traits::Delta
+Weightwatch_Traits::compute_delta(unsigned long unscaled, unsigned scale) {
+  if ((std::numeric_limits<Delta>::max() >> scale) < unscaled)
+    throw std::invalid_argument("PPL::Weightwatch_Traits::"
+                                "compute_delta(u, s):\n"
+                                "values of u and s cause wrap around.");
+  return static_cast<Delta>(unscaled) << scale;
+}
+
+inline void
+Weightwatch_Traits::from_delta(Threshold& threshold, const Delta& delta) {
+  threshold = weight + delta;
+}
+
+inline
+Throwable::~Throwable() {
+}
+
+inline void
+maybe_abandon() {
+#ifndef NDEBUG
+  if (In_Assert::asserting())
+    return;
+#endif
+  if (Weightwatch_Traits::check_function != 0)
+    Weightwatch_Traits::check_function();
+  if (const Throwable* const p = abandon_expensive_computations)
+    p->throw_me();
+}
+
+inline dimension_type
+compute_capacity(const dimension_type requested_size,
+                 const dimension_type maximum_size) {
+  assert(requested_size <= maximum_size);
+  // Speculation factor 2.
+  return (requested_size < maximum_size/2)
+    ? (2*(requested_size + 1))
+    : maximum_size;
+  // Speculation factor 1.5.
+  // return (maximum_size - requested_size > requested_size/2)
+  //   ? requested_size + requested_size/2 + 1
+  //   : maximum_size;
+}
+
+template <typename T>
+inline typename
+Enable_If<Is_Native<T>::value, memory_size_type>::type
+external_memory_in_bytes(const T&) {
+  return 0;
+}
+
+template <typename T>
+inline typename
+Enable_If<Is_Native<T>::value, memory_size_type>::type
+total_memory_in_bytes(const T&) {
+  return sizeof(T);
+}
+
+inline memory_size_type
+external_memory_in_bytes(const mpz_class& x) {
+  return static_cast<memory_size_type>(x.get_mpz_t()[0]._mp_alloc)
+    * PPL_SIZEOF_MP_LIMB_T;
+}
+
+inline memory_size_type
+total_memory_in_bytes(const mpz_class& x) {
+  return sizeof(x) + external_memory_in_bytes(x);
+}
+
+inline memory_size_type
+external_memory_in_bytes(const mpq_class& x) {
+  return external_memory_in_bytes(x.get_num())
+    + external_memory_in_bytes(x.get_den());
+}
+
+inline memory_size_type
+total_memory_in_bytes(const mpq_class& x) {
+  return sizeof(x) + external_memory_in_bytes(x);
+}
+
+inline void
+ascii_dump(std::ostream& s, Representation r) {
+  if (r == DENSE)
+    s << "DENSE";
+  else
+    s << "SPARSE";
+}
+
+inline bool
+ascii_load(std::istream& is, Representation& r) {
+  std::string s;
+  if (!(is >> s))
+    return false;
+
+  if (s == "DENSE")  {
+    r = DENSE;
+    return true;
+  }
+  if (s == "SPARSE")  {
+    r = SPARSE;
+    return true;
+  }
+  return false;
+}
+
+inline bool
+is_space(char c) {
+  return isspace(c) != 0;
+}
+
+template <typename RA_Container>
+inline typename RA_Container::iterator
+nth_iter(RA_Container& cont, dimension_type n) {
+  typedef typename RA_Container::difference_type diff_t;
+  return cont.begin() + static_cast<diff_t>(n);
+}
+
+template <typename RA_Container>
+inline typename RA_Container::const_iterator
+nth_iter(const RA_Container& cont, dimension_type n) {
+  typedef typename RA_Container::difference_type diff_t;
+  return cont.begin() + static_cast<diff_t>(n);
+}
+
+inline dimension_type
+least_significant_one_mask(const dimension_type i) {
+  return i & (~i + 1U);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_globals_inlines_hh)
diff --git a/src/globals_types.hh b/src/globals_types.hh
new file mode 100644
index 0000000..687fa2d
--- /dev/null
+++ b/src/globals_types.hh
@@ -0,0 +1,214 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_globals_types_hh
+#define PPL_globals_types_hh 1
+
+#include <cstddef>
+
+namespace Parma_Polyhedra_Library {
+
+//! An unsigned integral type for representing space dimensions.
+/*! \ingroup PPL_CXX_interface */
+typedef size_t dimension_type;
+
+//! An unsigned integral type for representing memory size in bytes.
+/*! \ingroup PPL_CXX_interface */
+typedef size_t memory_size_type;
+
+//! Kinds of degenerate abstract elements.
+/*! \ingroup PPL_CXX_interface */
+enum Degenerate_Element {
+  //! The universe element, i.e., the whole vector space.
+  UNIVERSE,
+  //! The empty element, i.e., the empty set.
+  EMPTY
+};
+
+//! Relation symbols.
+/*! \ingroup PPL_CXX_interface */
+// This must be kept in sync with Result
+enum Relation_Symbol {
+  //! \hideinitializer Equal to.
+  EQUAL = 1U,
+  //! \hideinitializer Less than.
+  LESS_THAN = 2U,
+  //! \hideinitializer Less than or equal to.
+  LESS_OR_EQUAL = LESS_THAN | EQUAL,
+  //! \hideinitializer Greater than.
+  GREATER_THAN = 4U,
+  //! \hideinitializer Greater than or equal to.
+  GREATER_OR_EQUAL = GREATER_THAN | EQUAL,
+  //! \hideinitializer Not equal to.
+  NOT_EQUAL = LESS_THAN | GREATER_THAN
+};
+
+//! Complexity pseudo-classes.
+/*! \ingroup PPL_CXX_interface */
+enum Complexity_Class {
+  //! Worst-case polynomial complexity.
+  POLYNOMIAL_COMPLEXITY,
+  //! Worst-case exponential complexity but typically polynomial behavior.
+  SIMPLEX_COMPLEXITY,
+  //! Any complexity.
+  ANY_COMPLEXITY
+};
+
+//! Possible optimization modes.
+/*! \ingroup PPL_CXX_interface */
+enum Optimization_Mode {
+  //! Minimization is requested.
+  MINIMIZATION,
+  //! Maximization is requested.
+  MAXIMIZATION
+};
+
+/*! \ingroup PPL_CXX_interface \brief
+  Widths of bounded integer types.
+
+  See the section on
+  \ref Approximating_Bounded_Integers "approximating bounded integers".
+*/
+enum Bounded_Integer_Type_Width {
+  //! \hideinitializer 8 bits.
+  BITS_8 = 8,
+
+  //! \hideinitializer 16 bits.
+  BITS_16 = 16,
+
+  //! \hideinitializer 32 bits.
+  BITS_32 = 32,
+
+  //! \hideinitializer 64 bits.
+  BITS_64 = 64,
+
+  //! \hideinitializer 128 bits.
+  BITS_128 = 128
+};
+
+/*! \ingroup PPL_CXX_interface \brief
+  Representation of bounded integer types.
+
+  See the section on
+  \ref Approximating_Bounded_Integers "approximating bounded integers".
+*/
+enum Bounded_Integer_Type_Representation {
+  //! Unsigned binary.
+  UNSIGNED,
+
+  /*! \brief
+    Signed binary where negative values are represented by the two's
+    complement of the absolute value.
+  */
+  SIGNED_2_COMPLEMENT
+};
+
+/*! \ingroup PPL_CXX_interface \brief
+  Overflow behavior of bounded integer types.
+
+  See the section on
+  \ref Approximating_Bounded_Integers "approximating bounded integers".
+*/
+enum Bounded_Integer_Type_Overflow {
+  /*! \brief
+    On overflow, wrapping takes place.
+
+    This means that, for a \f$w\f$-bit bounded integer, the computation
+    happens modulo \f$2^w\f$.
+  */
+  OVERFLOW_WRAPS,
+
+  /*! \brief
+    On overflow, the result is undefined.
+
+    This simply means that the result of the operation resulting in an
+    overflow can take any value.
+
+    \note
+    Even though something more serious can happen in the system
+    being analyzed ---due to, e.g., C's undefined behavior---, here we
+    are only concerned with the results of arithmetic operations.
+    It is the responsibility of the analyzer to ensure that other
+    manifestations of undefined behavior are conservatively approximated.
+  */
+  OVERFLOW_UNDEFINED,
+
+  /*! \brief
+    Overflow is impossible.
+
+    This is for the analysis of languages where overflow is trapped
+    before it affects the state, for which, thus, any indication that
+    an overflow may have affected the state is necessarily due to
+    the imprecision of the analysis.
+  */
+  OVERFLOW_IMPOSSIBLE
+};
+
+/*! \ingroup PPL_CXX_interface \brief
+  Possible representations of coefficient sequences (i.e. linear expressions
+  and more complex objects containing linear expressions, e.g. Constraints,
+  Generators, etc.).
+*/
+enum Representation {
+  /*! \brief
+    Dense representation: the coefficient sequence is represented as a vector
+    of coefficients, including the zero coefficients.
+    If there are only a few nonzero coefficients, this representation is
+    faster and also uses a bit less memory.
+  */
+  DENSE,
+
+  /*! \brief
+    Sparse representation: only the nonzero coefficient are stored.
+    If there are many nonzero coefficients, this improves memory consumption
+    and run time (both because there is less data to process in O(n)
+    operations and because finding zeroes/nonzeroes is much faster since
+    zeroes are not stored at all, so any stored coefficient is nonzero).
+  */
+  SPARSE
+};
+
+/*! \ingroup PPL_CXX_interface \brief
+  Floating point formats known to the library.
+
+  The parameters of each format are defined by a specific struct
+  in file Float_defs.hh.  See the section on \ref floating_point
+  "Analysis of floating point computations" for more information.
+*/
+enum Floating_Point_Format {
+  //! IEEE 754 half precision, 16 bits (5 exponent, 10 mantissa).
+  IEEE754_HALF,
+
+  //! IEEE 754 single precision, 32 bits (8 exponent, 23 mantissa).
+  IEEE754_SINGLE,
+
+  //! IEEE 754 double precision, 64 bits (11 exponent, 52 mantissa).
+  IEEE754_DOUBLE,
+
+  //! IEEE 754 quad precision, 128 bits (15 exponent, 112 mantissa).
+  IEEE754_QUAD,
+
+  //! Intel double extended precision, 80 bits (15 exponent, 64 mantissa)
+  INTEL_DOUBLE_EXTENDED,
+
+  //! IBM single precision, 32 bits (7 exponent, 24 mantissa).
+  IBM_SINGLE,
+
+  //! IBM double precision, 64 bits (7 exponent, 56 mantissa).
+  IBM_DOUBLE
+};
+
+struct Weightwatch_Traits;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_globals_types_hh)
diff --git a/src/initializer.hh b/src/initializer.hh
index 1e0cb6e..f681040 100644
--- a/src/initializer.hh
+++ b/src/initializer.hh
@@ -1,6 +1,6 @@
 /* Nifty counter object for the initialization of the library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,7 +24,7 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_initializer_hh
 #define PPL_initializer_hh 1
 
-#include "Init.defs.hh"
+#include "Init_defs.hh"
 
 #ifndef PPL_NO_AUTOMATIC_INITIALIZATION
 
diff --git a/src/intervals.defs.hh b/src/intervals.defs.hh
deleted file mode 100644
index 4649f1e..0000000
--- a/src/intervals.defs.hh
+++ /dev/null
@@ -1,473 +0,0 @@
-/* Helper classes for intervals.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_intervals_defs_hh
-#define PPL_intervals_defs_hh 1
-
-#include "assert.hh"
-#include <cstdlib>
-
-#include "Checked_Number.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! The result of an operation on intervals.
-/*! \ingroup PPL_CXX_interface */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-enum I_Result {
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result may be empty.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_EMPTY = 1U,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result may have only one value.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_SINGLETON = 2U,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  /*! \brief \hideinitializer
-    Result may have more than one value, but it is not the domain universe.
-  */
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_SOME = 4U,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result may be the domain universe.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_UNIVERSE = 8U,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result is not empty.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_NOT_EMPTY = I_SINGLETON | I_SOME | I_UNIVERSE,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result may be empty or not empty.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_ANY = I_EMPTY | I_NOT_EMPTY,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result may be empty or not empty.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_NOT_UNIVERSE = I_EMPTY | I_SINGLETON | I_SOME,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result is neither empty nor the domain universe.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_NOT_DEGENERATE = I_SINGLETON | I_SOME,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result is definitely exact.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_EXACT = 16,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Result is definitely inexact.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_INEXACT = 32,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Operation has definitely changed the set.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_CHANGED = 64,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Operation has left the set definitely unchanged.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_UNCHANGED = 128,
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-  //! \hideinitializer Operation is undefined for some combination of values.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-  I_SINGULARITIES = 256
-};
-
-inline I_Result
-operator|(I_Result a, I_Result b) {
-  return static_cast<I_Result>(static_cast<unsigned>(a)
-                               | static_cast<unsigned>(b));
-}
-
-inline I_Result
-operator&(I_Result a, I_Result b) {
-  return static_cast<I_Result>(static_cast<unsigned>(a)
-                               & static_cast<unsigned>(b));
-}
-
-inline I_Result
-operator-(I_Result a, I_Result b) {
-    return static_cast<I_Result>(static_cast<unsigned>(a)
-                                 & ~static_cast<unsigned>(b));
-}
-
-template <typename Criteria, typename T>
-struct Use_By_Ref;
-
-struct Use_Slow_Copy;
-template <typename T>
-struct Use_By_Ref<Use_Slow_Copy, T>
-  : public Bool<Slow_Copy<T>::value> {
-};
-
-struct By_Value;
-template <typename T>
-struct Use_By_Ref<By_Value, T>
-  : public False {
-};
-
-struct By_Ref;
-template <typename T>
-struct Use_By_Ref<By_Ref, T>
-  : public True {
-};
-
-template <typename T, typename Criteria = Use_Slow_Copy, typename Enable = void>
-class Val_Or_Ref;
-
-template <typename T, typename Criteria>
-class Val_Or_Ref<T, Criteria,
-		 typename Enable_If<!Use_By_Ref<Criteria, T>::value>::type> {
-  T value;
-public:
-  typedef T Arg_Type;
-  typedef T Return_Type;
-  Val_Or_Ref()
-    : value() {
-  }
-  explicit Val_Or_Ref(Arg_Type v, bool = false)
-    : value(v) {
-  }
-  Val_Or_Ref& operator=(Arg_Type v) {
-    value = v;
-    return *this;
-  }
-  void set(Arg_Type v, bool = false) {
-    value = v;
-  }
-  Return_Type get() const {
-    return value;
-  }
-  operator Return_Type () const {
-    return get();
-  }
-};
-
-template <typename T, typename Criteria>
-class Val_Or_Ref<T, Criteria,
-		 typename Enable_If<Use_By_Ref<Criteria, T>::value>::type> {
-  const T* ptr;
-public:
-  typedef T& Arg_Type;
-  typedef const T& Return_Type;
-  Val_Or_Ref()
-    : ptr(0) {
-  }
-  explicit Val_Or_Ref(Arg_Type v)
-    : ptr(&v) {
-  }
-  Val_Or_Ref(const T& v, bool)
-    : ptr(&v) {
-  }
-  Val_Or_Ref& operator=(Arg_Type v) {
-    ptr = &v;
-    return *this;
-  }
-  void set(Arg_Type v) {
-    ptr = &v;
-  }
-  void set(const T& v, bool) {
-    ptr = &v;
-  }
-  Return_Type get() const {
-    return *ptr;
-  }
-  operator Return_Type () const {
-    return get();
-  }
-};
-
-class I_Constraint_Base {
-};
-
-template <typename Derived>
-class I_Constraint_Common : public I_Constraint_Base {
-public:
-  template <typename T>
-  Result convert_real(T& to) const {
-    const Derived& c = static_cast<const Derived&>(*this);
-    Result r = c.rel();
-    switch (r) {
-    case V_EMPTY:
-    case V_LGE:
-      return r;
-    case V_LE:
-      r = assign_r(to, c.value(), (ROUND_UP | ROUND_STRICT_RELATION));
-      r = result_relation_class(r);
-      if (r == V_EQ)
-	return V_LE;
-      goto lt;
-    case V_LT:
-      r = assign_r(to, c.value(), ROUND_UP);
-      r = result_relation_class(r);
-    lt:
-      switch (r) {
-      case V_EMPTY:
-      case V_LT_PLUS_INFINITY:
-      case V_EQ_MINUS_INFINITY:
-	return r;
-      case V_LT:
-      case V_LE:
-      case V_EQ:
-	return V_LT;
-      default:
-	break;
-      }
-      break;
-    case V_GE:
-      r = assign_r(to, c.value(), (ROUND_DOWN | ROUND_STRICT_RELATION));
-      r = result_relation_class(r);
-      if (r == V_EQ)
-	return V_GE;
-      goto gt;
-    case V_GT:
-      r = assign_r(to, c.value(), ROUND_DOWN);
-      r = result_relation_class(r);
-    gt:
-      switch (r) {
-      case V_EMPTY:
-      case V_GT_MINUS_INFINITY:
-      case V_EQ_PLUS_INFINITY:
-	return r;
-      case V_LT:
-      case V_LE:
-      case V_EQ:
-	return V_GT;
-      default:
-	break;
-      }
-      break;
-    case V_EQ:
-      r = assign_r(to, c.value(), ROUND_CHECK);
-      r = result_relation_class(r);
-      PPL_ASSERT(r != V_LT && r != V_GT);
-      if (r == V_EQ)
-	return V_EQ;
-      else
-	return V_EMPTY;
-    case V_NE:
-      r = assign_r(to, c.value(), ROUND_CHECK);
-      r = result_relation_class(r);
-      if (r == V_EQ)
-	return V_NE;
-      else
-	return V_LGE;
-    default:
-      break;
-    }
-    PPL_UNREACHABLE;
-    return V_EMPTY;
-  }
-  template <typename T>
-  Result convert_real(T& to1, Result& rel2, T& to2) const {
-    const Derived& c = static_cast<const Derived&>(*this);
-    Result rel1;
-    if (c.rel() != V_EQ) {
-      rel2 = convert(to2);
-      return V_LGE;
-    }
-    rel2 = assign_r(to2, c.value(), ROUND_UP);
-    rel2 = result_relation_class(rel2);
-    switch (rel2) {
-    case V_EMPTY:
-    case V_EQ_MINUS_INFINITY:
-    case V_EQ:
-      return V_LGE;
-    default:
-      break;
-    }
-    rel1 = assign_r(to1, c.value(), ROUND_DOWN);
-    rel1 = result_relation_class(rel1);
-    switch (rel1) {
-    case V_EQ:
-      PPL_ASSERT(rel2 == V_LE);
-      goto eq;
-    case V_EQ_PLUS_INFINITY:
-    case V_EMPTY:
-      rel2 = rel1;
-      return V_LGE;
-    case V_GE:
-      if (rel2 == V_LE && to1 == to2) {
-      eq:
-	rel2 = V_EQ;
-	return V_LGE;
-      }
-      /* Fall through*/
-    case V_GT:
-    case V_GT_MINUS_INFINITY:
-      return rel1;
-    default:
-      PPL_UNREACHABLE;
-      return V_EMPTY;
-    }
-    switch (rel2) {
-    case V_LE:
-    case V_LT:
-    case V_LT_PLUS_INFINITY:
-      return rel1;
-    default:
-      PPL_UNREACHABLE;
-      return V_EMPTY;
-    }
-  }
-  template <typename T>
-  Result convert_integer(T& to) const {
-    Result rel = convert_real(to);
-    switch (rel) {
-    case V_LT:
-      if (is_integer(to)) {
-	rel = sub_assign_r(to, to, T(1), (ROUND_UP | ROUND_STRICT_RELATION));
-	rel = result_relation_class(rel);
-	return (rel == V_EQ) ? V_LE : rel;
-      }
-      /* Fall through */
-    case V_LE:
-      rel = floor_assign_r(to, to, ROUND_UP);
-      rel = result_relation_class(rel);
-      PPL_ASSERT(rel == V_EQ);
-      return V_LE;
-    case V_GT:
-      if (is_integer(to)) {
-	rel = add_assign_r(to, to, T(1), (ROUND_DOWN | ROUND_STRICT_RELATION));
-	rel = result_relation_class(rel);
-	return (rel == V_EQ) ? V_GE : rel;
-      }
-      /* Fall through */
-    case V_GE:
-      rel = ceil_assign_r(to, to, ROUND_DOWN);
-      rel = result_relation_class(rel);
-      PPL_ASSERT(rel == V_EQ);
-      return V_GE;
-    case V_EQ:
-      if (is_integer(to))
-	return V_EQ;
-      return V_EMPTY;
-    case V_NE:
-      if (is_integer(to))
-	return V_NE;
-      return V_LGE;
-    default:
-      return rel;
-    }
-  }
-};
-
-struct I_Constraint_Rel {
-  Result rel;
-  I_Constraint_Rel(Result r)
-    : rel(r) {
-    PPL_ASSERT(result_relation_class(r) == r);
-  }
-  I_Constraint_Rel(Relation_Symbol r)
-    : rel(static_cast<Result>(r)) {
-  }
-  operator Result() const {
-    return rel;
-  }
-};
-
-template <typename T, typename Val_Or_Ref_Criteria = Use_Slow_Copy,
-	  bool extended = false>
-class I_Constraint
-  : public I_Constraint_Common<I_Constraint<T, Val_Or_Ref_Criteria,
-                                            extended> > {
-  typedef Val_Or_Ref<T, Val_Or_Ref_Criteria> Val_Ref;
-  typedef typename Val_Ref::Arg_Type Arg_Type;
-  typedef typename Val_Ref::Return_Type Return_Type;
-  Result rel_;
-  Val_Ref value_;
-public:
-  typedef T value_type;
-  explicit I_Constraint()
-    : rel_(V_LGE) {
-  }
-  I_Constraint(I_Constraint_Rel r, Arg_Type v)
-    : rel_(r), value_(v) {
-  }
-  I_Constraint(I_Constraint_Rel r, const T& v, bool force)
-    : rel_(r), value_(v, force) {
-  }
-  template <typename U>
-  I_Constraint(I_Constraint_Rel r, const U& v)
-    : rel_(r), value_(v) {
-  }
-  void set(I_Constraint_Rel r, Arg_Type v) {
-    rel_ =  r;
-    value_.set(v);
-  }
-  void set(I_Constraint_Rel r, const T& v, bool force) {
-    rel_ =  r;
-    value_.set(v, force);
-  }
-  template <typename U>
-  void set(I_Constraint_Rel r, const U& v) {
-    rel_ = r;
-    value_.set(v);
-  }
-  Return_Type value() const {
-    return value_;
-  }
-  Result rel() const {
-    return rel_;
-  }
-};
-
-template <typename T>
-inline I_Constraint<T>
-i_constraint(I_Constraint_Rel rel, const T& v) {
-  return I_Constraint<T>(rel, v);
-}
-
-template <typename T>
-inline I_Constraint<T>
-i_constraint(I_Constraint_Rel rel, const T& v, bool force) {
-  return I_Constraint<T>(rel, v, force);
-}
-
-template <typename T>
-inline I_Constraint<T>
-i_constraint(I_Constraint_Rel rel, T& v) {
-  return I_Constraint<T>(rel, v);
-}
-
-template <typename T, typename Val_Or_Ref_Criteria>
-inline I_Constraint<T, Val_Or_Ref_Criteria>
-i_constraint(I_Constraint_Rel rel, const T& v, const Val_Or_Ref_Criteria&) {
-  return I_Constraint<T, Val_Or_Ref_Criteria>(rel, v);
-}
-
-template <typename T, typename Val_Or_Ref_Criteria>
-inline I_Constraint<T, Val_Or_Ref_Criteria>
-i_constraint(I_Constraint_Rel rel, const T& v, bool force,
-             const Val_Or_Ref_Criteria&) {
-  return I_Constraint<T, Val_Or_Ref_Criteria>(rel, v, force);
-}
-
-template <typename T, typename Val_Or_Ref_Criteria>
-inline I_Constraint<T, Val_Or_Ref_Criteria>
-i_constraint(I_Constraint_Rel rel, T& v, const Val_Or_Ref_Criteria&) {
-  return I_Constraint<T, Val_Or_Ref_Criteria>(rel, v);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_intervals_defs_hh)
diff --git a/src/intervals_defs.hh b/src/intervals_defs.hh
new file mode 100644
index 0000000..59574c4
--- /dev/null
+++ b/src/intervals_defs.hh
@@ -0,0 +1,473 @@
+/* Helper classes for intervals.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_intervals_defs_hh
+#define PPL_intervals_defs_hh 1
+
+#include "assert.hh"
+#include <cstdlib>
+
+#include "Checked_Number_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! The result of an operation on intervals.
+/*! \ingroup PPL_CXX_interface */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+enum I_Result {
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result may be empty.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_EMPTY = 1U,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result may have only one value.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_SINGLETON = 2U,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  /*! \brief \hideinitializer
+    Result may have more than one value, but it is not the domain universe.
+  */
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_SOME = 4U,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result may be the domain universe.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_UNIVERSE = 8U,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result is not empty.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_NOT_EMPTY = I_SINGLETON | I_SOME | I_UNIVERSE,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result may be empty or not empty.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_ANY = I_EMPTY | I_NOT_EMPTY,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result may be empty or not empty.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_NOT_UNIVERSE = I_EMPTY | I_SINGLETON | I_SOME,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result is neither empty nor the domain universe.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_NOT_DEGENERATE = I_SINGLETON | I_SOME,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result is definitely exact.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_EXACT = 16,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Result is definitely inexact.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_INEXACT = 32,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Operation has definitely changed the set.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_CHANGED = 64,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Operation has left the set definitely unchanged.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_UNCHANGED = 128,
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+  //! \hideinitializer Operation is undefined for some combination of values.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+  I_SINGULARITIES = 256
+};
+
+inline I_Result
+operator|(I_Result a, I_Result b) {
+  return static_cast<I_Result>(static_cast<unsigned>(a)
+                               | static_cast<unsigned>(b));
+}
+
+inline I_Result
+operator&(I_Result a, I_Result b) {
+  return static_cast<I_Result>(static_cast<unsigned>(a)
+                               & static_cast<unsigned>(b));
+}
+
+inline I_Result
+operator-(I_Result a, I_Result b) {
+    return static_cast<I_Result>(static_cast<unsigned>(a)
+                                 & ~static_cast<unsigned>(b));
+}
+
+template <typename Criteria, typename T>
+struct Use_By_Ref;
+
+struct Use_Slow_Copy;
+template <typename T>
+struct Use_By_Ref<Use_Slow_Copy, T>
+  : public Bool<Slow_Copy<T>::value> {
+};
+
+struct By_Value;
+template <typename T>
+struct Use_By_Ref<By_Value, T>
+  : public False {
+};
+
+struct By_Ref;
+template <typename T>
+struct Use_By_Ref<By_Ref, T>
+  : public True {
+};
+
+template <typename T, typename Criteria = Use_Slow_Copy, typename Enable = void>
+class Val_Or_Ref;
+
+template <typename T, typename Criteria>
+class Val_Or_Ref<T, Criteria,
+                 typename Enable_If<!Use_By_Ref<Criteria, T>::value>::type> {
+  T value;
+public:
+  typedef T Arg_Type;
+  typedef T Return_Type;
+  Val_Or_Ref()
+    : value() {
+  }
+  explicit Val_Or_Ref(Arg_Type v, bool = false)
+    : value(v) {
+  }
+  Val_Or_Ref& operator=(Arg_Type v) {
+    value = v;
+    return *this;
+  }
+  void set(Arg_Type v, bool = false) {
+    value = v;
+  }
+  Return_Type get() const {
+    return value;
+  }
+  operator Return_Type () const {
+    return get();
+  }
+};
+
+template <typename T, typename Criteria>
+class Val_Or_Ref<T, Criteria,
+                 typename Enable_If<Use_By_Ref<Criteria, T>::value>::type> {
+  const T* ptr;
+public:
+  typedef T& Arg_Type;
+  typedef const T& Return_Type;
+  Val_Or_Ref()
+    : ptr(0) {
+  }
+  explicit Val_Or_Ref(Arg_Type v)
+    : ptr(&v) {
+  }
+  Val_Or_Ref(const T& v, bool)
+    : ptr(&v) {
+  }
+  Val_Or_Ref& operator=(Arg_Type v) {
+    ptr = &v;
+    return *this;
+  }
+  void set(Arg_Type v) {
+    ptr = &v;
+  }
+  void set(const T& v, bool) {
+    ptr = &v;
+  }
+  Return_Type get() const {
+    return *ptr;
+  }
+  operator Return_Type () const {
+    return get();
+  }
+};
+
+class I_Constraint_Base {
+};
+
+template <typename Derived>
+class I_Constraint_Common : public I_Constraint_Base {
+public:
+  template <typename T>
+  Result convert_real(T& to) const {
+    const Derived& c = static_cast<const Derived&>(*this);
+    Result r = c.rel();
+    switch (r) {
+    case V_EMPTY:
+    case V_LGE:
+      return r;
+    case V_LE:
+      r = assign_r(to, c.value(), (ROUND_UP | ROUND_STRICT_RELATION));
+      r = result_relation_class(r);
+      if (r == V_EQ)
+        return V_LE;
+      goto lt;
+    case V_LT:
+      r = assign_r(to, c.value(), ROUND_UP);
+      r = result_relation_class(r);
+    lt:
+      switch (r) {
+      case V_EMPTY:
+      case V_LT_PLUS_INFINITY:
+      case V_EQ_MINUS_INFINITY:
+        return r;
+      case V_LT:
+      case V_LE:
+      case V_EQ:
+        return V_LT;
+      default:
+        break;
+      }
+      break;
+    case V_GE:
+      r = assign_r(to, c.value(), (ROUND_DOWN | ROUND_STRICT_RELATION));
+      r = result_relation_class(r);
+      if (r == V_EQ)
+        return V_GE;
+      goto gt;
+    case V_GT:
+      r = assign_r(to, c.value(), ROUND_DOWN);
+      r = result_relation_class(r);
+    gt:
+      switch (r) {
+      case V_EMPTY:
+      case V_GT_MINUS_INFINITY:
+      case V_EQ_PLUS_INFINITY:
+        return r;
+      case V_LT:
+      case V_LE:
+      case V_EQ:
+        return V_GT;
+      default:
+        break;
+      }
+      break;
+    case V_EQ:
+      r = assign_r(to, c.value(), ROUND_CHECK);
+      r = result_relation_class(r);
+      PPL_ASSERT(r != V_LT && r != V_GT);
+      if (r == V_EQ)
+        return V_EQ;
+      else
+        return V_EMPTY;
+    case V_NE:
+      r = assign_r(to, c.value(), ROUND_CHECK);
+      r = result_relation_class(r);
+      if (r == V_EQ)
+        return V_NE;
+      else
+        return V_LGE;
+    default:
+      break;
+    }
+    PPL_UNREACHABLE;
+    return V_EMPTY;
+  }
+  template <typename T>
+  Result convert_real(T& to1, Result& rel2, T& to2) const {
+    const Derived& c = static_cast<const Derived&>(*this);
+    Result rel1;
+    if (c.rel() != V_EQ) {
+      rel2 = convert(to2);
+      return V_LGE;
+    }
+    rel2 = assign_r(to2, c.value(), ROUND_UP);
+    rel2 = result_relation_class(rel2);
+    switch (rel2) {
+    case V_EMPTY:
+    case V_EQ_MINUS_INFINITY:
+    case V_EQ:
+      return V_LGE;
+    default:
+      break;
+    }
+    rel1 = assign_r(to1, c.value(), ROUND_DOWN);
+    rel1 = result_relation_class(rel1);
+    switch (rel1) {
+    case V_EQ:
+      PPL_ASSERT(rel2 == V_LE);
+      goto eq;
+    case V_EQ_PLUS_INFINITY:
+    case V_EMPTY:
+      rel2 = rel1;
+      return V_LGE;
+    case V_GE:
+      if (rel2 == V_LE && to1 == to2) {
+      eq:
+        rel2 = V_EQ;
+        return V_LGE;
+      }
+      /* Fall through*/
+    case V_GT:
+    case V_GT_MINUS_INFINITY:
+      return rel1;
+    default:
+      PPL_UNREACHABLE;
+      return V_EMPTY;
+    }
+    switch (rel2) {
+    case V_LE:
+    case V_LT:
+    case V_LT_PLUS_INFINITY:
+      return rel1;
+    default:
+      PPL_UNREACHABLE;
+      return V_EMPTY;
+    }
+  }
+  template <typename T>
+  Result convert_integer(T& to) const {
+    Result rel = convert_real(to);
+    switch (rel) {
+    case V_LT:
+      if (is_integer(to)) {
+        rel = sub_assign_r(to, to, T(1), (ROUND_UP | ROUND_STRICT_RELATION));
+        rel = result_relation_class(rel);
+        return (rel == V_EQ) ? V_LE : rel;
+      }
+      /* Fall through */
+    case V_LE:
+      rel = floor_assign_r(to, to, ROUND_UP);
+      rel = result_relation_class(rel);
+      PPL_ASSERT(rel == V_EQ);
+      return V_LE;
+    case V_GT:
+      if (is_integer(to)) {
+        rel = add_assign_r(to, to, T(1), (ROUND_DOWN | ROUND_STRICT_RELATION));
+        rel = result_relation_class(rel);
+        return (rel == V_EQ) ? V_GE : rel;
+      }
+      /* Fall through */
+    case V_GE:
+      rel = ceil_assign_r(to, to, ROUND_DOWN);
+      rel = result_relation_class(rel);
+      PPL_ASSERT(rel == V_EQ);
+      return V_GE;
+    case V_EQ:
+      if (is_integer(to))
+        return V_EQ;
+      return V_EMPTY;
+    case V_NE:
+      if (is_integer(to))
+        return V_NE;
+      return V_LGE;
+    default:
+      return rel;
+    }
+  }
+};
+
+struct I_Constraint_Rel {
+  Result rel;
+  I_Constraint_Rel(Result r)
+    : rel(r) {
+    PPL_ASSERT(result_relation_class(r) == r);
+  }
+  I_Constraint_Rel(Relation_Symbol r)
+    : rel(static_cast<Result>(r)) {
+  }
+  operator Result() const {
+    return rel;
+  }
+};
+
+template <typename T, typename Val_Or_Ref_Criteria = Use_Slow_Copy,
+          bool extended = false>
+class I_Constraint
+  : public I_Constraint_Common<I_Constraint<T, Val_Or_Ref_Criteria,
+                                            extended> > {
+  typedef Val_Or_Ref<T, Val_Or_Ref_Criteria> Val_Ref;
+  typedef typename Val_Ref::Arg_Type Arg_Type;
+  typedef typename Val_Ref::Return_Type Return_Type;
+  Result rel_;
+  Val_Ref value_;
+public:
+  typedef T value_type;
+  explicit I_Constraint()
+    : rel_(V_LGE) {
+  }
+  I_Constraint(I_Constraint_Rel r, Arg_Type v)
+    : rel_(r), value_(v) {
+  }
+  I_Constraint(I_Constraint_Rel r, const T& v, bool force)
+    : rel_(r), value_(v, force) {
+  }
+  template <typename U>
+  I_Constraint(I_Constraint_Rel r, const U& v)
+    : rel_(r), value_(v) {
+  }
+  void set(I_Constraint_Rel r, Arg_Type v) {
+    rel_ =  r;
+    value_.set(v);
+  }
+  void set(I_Constraint_Rel r, const T& v, bool force) {
+    rel_ =  r;
+    value_.set(v, force);
+  }
+  template <typename U>
+  void set(I_Constraint_Rel r, const U& v) {
+    rel_ = r;
+    value_.set(v);
+  }
+  Return_Type value() const {
+    return value_;
+  }
+  Result rel() const {
+    return rel_;
+  }
+};
+
+template <typename T>
+inline I_Constraint<T>
+i_constraint(I_Constraint_Rel rel, const T& v) {
+  return I_Constraint<T>(rel, v);
+}
+
+template <typename T>
+inline I_Constraint<T>
+i_constraint(I_Constraint_Rel rel, const T& v, bool force) {
+  return I_Constraint<T>(rel, v, force);
+}
+
+template <typename T>
+inline I_Constraint<T>
+i_constraint(I_Constraint_Rel rel, T& v) {
+  return I_Constraint<T>(rel, v);
+}
+
+template <typename T, typename Val_Or_Ref_Criteria>
+inline I_Constraint<T, Val_Or_Ref_Criteria>
+i_constraint(I_Constraint_Rel rel, const T& v, const Val_Or_Ref_Criteria&) {
+  return I_Constraint<T, Val_Or_Ref_Criteria>(rel, v);
+}
+
+template <typename T, typename Val_Or_Ref_Criteria>
+inline I_Constraint<T, Val_Or_Ref_Criteria>
+i_constraint(I_Constraint_Rel rel, const T& v, bool force,
+             const Val_Or_Ref_Criteria&) {
+  return I_Constraint<T, Val_Or_Ref_Criteria>(rel, v, force);
+}
+
+template <typename T, typename Val_Or_Ref_Criteria>
+inline I_Constraint<T, Val_Or_Ref_Criteria>
+i_constraint(I_Constraint_Rel rel, T& v, const Val_Or_Ref_Criteria&) {
+  return I_Constraint<T, Val_Or_Ref_Criteria>(rel, v);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_intervals_defs_hh)
diff --git a/src/iterator_to_const.defs.hh b/src/iterator_to_const.defs.hh
deleted file mode 100644
index 4444b7d..0000000
--- a/src/iterator_to_const.defs.hh
+++ /dev/null
@@ -1,221 +0,0 @@
-/* iterator_to_const and const_iterator_to_const class declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_iterator_to_const_hh
-#define PPL_iterator_to_const_hh 1
-
-#include "iterator_to_const.types.hh"
-#include "Powerset.types.hh"
-//#include "Ask_Tell.types.hh"
-#include <iterator>
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! An iterator on a sequence of read-only objects.
-/*! \ingroup PPL_CXX_interface
-  This template class implements a bidirectional <EM>read-only</EM>
-  iterator on the sequence of objects <CODE>Container</CODE>.
-  By using this iterator class it is not possible to modify the objects
-  contained in <CODE>Container</CODE>; rather, object modification has
-  to be implemented by object replacement, i.e., by using the methods
-  provided by <CODE>Container</CODE> to remove/insert objects.
-  Such a policy (a modifiable container of read-only objects) allows
-  for a reliable enforcement of invariants (such as sortedness of the
-  objects in the sequence).
-
-  \note
-  For any developers' need, suitable friend declarations allow for
-  accessing the low-level iterators on the sequence of objects.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Container>
-class Parma_Polyhedra_Library::iterator_to_const {
-private:
-  //! The type of the underlying mutable iterator.
-  typedef typename Container::iterator Base;
-
-  //! A shortcut for naming the const_iterator traits.
-  typedef typename
-  std::iterator_traits<typename Container::const_iterator> Traits;
-
-  //! A (mutable) iterator on the sequence of elements.
-  Base base;
-
-  //! Constructs from the lower-level iterator.
-  iterator_to_const(const Base& b);
-
-  friend class const_iterator_to_const<Container>;
-  template <typename T> friend class Powerset;
-
-public:
-  // Same traits of the const_iterator, therefore
-  // forbidding the direct modification of sequence elements.
-  typedef typename Traits::iterator_category iterator_category;
-  typedef typename Traits::value_type value_type;
-  typedef typename Traits::difference_type difference_type;
-  typedef typename Traits::pointer pointer;
-  typedef typename Traits::reference reference;
-
-  //! Default constructor.
-  iterator_to_const();
-
-  //! Copy constructor.
-  iterator_to_const(const iterator_to_const& y);
-
-  //! Dereference operator.
-  reference operator*() const;
-
-  //! Indirect access operator.
-  pointer operator->() const;
-
-  //! Prefix increment operator.
-  iterator_to_const& operator++();
-
-  //! Postfix increment operator.
-  iterator_to_const operator++(int);
-
-  //! Prefix decrement operator.
-  iterator_to_const& operator--();
-
-  //! Postfix decrement operator.
-  iterator_to_const operator--(int);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are identical.
-  */
-  bool operator==(const iterator_to_const& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are different.
-  */
-  bool operator!=(const iterator_to_const& y) const;
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A %const_iterator on a sequence of read-only objects.
-/*! \ingroup PPL_CXX_interface
-  This class, besides implementing a read-only bidirectional iterator
-  on a read-only sequence of objects, ensures interoperability
-  with template class iterator_to_const.
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Container>
-class Parma_Polyhedra_Library::const_iterator_to_const {
-private:
-  //! The type of the underlying %const_iterator.
-  typedef typename Container::const_iterator Base;
-
-  //! A shortcut for naming traits.
-  typedef typename std::iterator_traits<Base> Traits;
-
-  //! A %const_iterator on the sequence of elements.
-  Base base;
-
-  //! Constructs from the lower-level const_iterator.
-  const_iterator_to_const(const Base& b);
-
-  friend class iterator_to_const<Container>;
-  template <typename T> friend class Powerset;
-
-public:
-  // Same traits of the underlying const_iterator.
-  typedef typename Traits::iterator_category iterator_category;
-  typedef typename Traits::value_type value_type;
-  typedef typename Traits::difference_type difference_type;
-  typedef typename Traits::pointer pointer;
-  typedef typename Traits::reference reference;
-
-  //! Default constructor.
-  const_iterator_to_const();
-
-  //! Copy constructor.
-  const_iterator_to_const(const const_iterator_to_const& y);
-
-  //! Constructs from the corresponding non-const iterator.
-  const_iterator_to_const(const iterator_to_const<Container>& y);
-
-  //! Dereference operator.
-  reference operator*() const;
-
-  //! Indirect member selector.
-  pointer operator->() const;
-
-  //! Prefix increment operator.
-  const_iterator_to_const& operator++();
-
-  //! Postfix increment operator.
-  const_iterator_to_const operator++(int);
-
-  //! Prefix decrement operator.
-  const_iterator_to_const& operator--();
-
-  //! Postfix decrement operator.
-  const_iterator_to_const operator--(int);
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are identical.
-  */
-  bool operator==(const const_iterator_to_const& y) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if
-    \p *this and \p y are different.
-  */
-  bool operator!=(const const_iterator_to_const& y) const;
-};
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Mixed comparison operator: returns <CODE>true</CODE> if and only
-  if (the const version of) \p x is identical to \p y.
-
-  \relates const_iterator_to_const
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Container>
-bool
-operator==(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  Mixed comparison operator: returns <CODE>true</CODE> if and only
-  if (the const version of) \p x is different from \p y.
-
-  \relates const_iterator_to_const
-*/
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Container>
-bool
-operator!=(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "iterator_to_const.inlines.hh"
-
-#endif // !defined(PPL_iterator_to_const_hh)
diff --git a/src/iterator_to_const.inlines.hh b/src/iterator_to_const.inlines.hh
deleted file mode 100644
index e15fba0..0000000
--- a/src/iterator_to_const.inlines.hh
+++ /dev/null
@@ -1,202 +0,0 @@
-/* iterator_to_const and const_iterator_to_const class implementations:
-   inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_iterator_to_const_inlines_hh
-#define PPL_iterator_to_const_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Container>
-inline
-iterator_to_const<Container>::iterator_to_const()
-  : base() {
-}
-
-template <typename Container>
-inline
-iterator_to_const<Container>::iterator_to_const(const iterator_to_const& y)
-  : base(y.base) {
-}
-
-template <typename Container>
-inline
-iterator_to_const<Container>::iterator_to_const(const Base& b)
-  : base(b) {
-}
-
-template <typename Container>
-inline typename iterator_to_const<Container>::reference
-iterator_to_const<Container>::operator*() const {
-  return *base;
-}
-
-template <typename Container>
-inline typename iterator_to_const<Container>::pointer
-iterator_to_const<Container>::operator->() const {
-  return &*base;
-}
-
-template <typename Container>
-inline iterator_to_const<Container>&
-iterator_to_const<Container>::operator++() {
-  ++base;
-  return *this;
-}
-
-template <typename Container>
-inline iterator_to_const<Container>
-iterator_to_const<Container>::operator++(int) {
-  iterator_to_const tmp = *this;
-  operator++();
-  return tmp;
-}
-
-template <typename Container>
-inline iterator_to_const<Container>&
-iterator_to_const<Container>::operator--() {
-  --base;
-  return *this;
-}
-
-template <typename Container>
-inline iterator_to_const<Container>
-iterator_to_const<Container>::operator--(int) {
-  iterator_to_const tmp = *this;
-  operator--();
-  return tmp;
-}
-
-template <typename Container>
-inline bool
-iterator_to_const<Container>::operator==(const iterator_to_const& y) const {
-  return base == y.base;
-}
-
-template <typename Container>
-inline bool
-iterator_to_const<Container>::operator!=(const iterator_to_const& y) const {
-  return !operator==(y);
-}
-
-template <typename Container>
-inline
-const_iterator_to_const<Container>::const_iterator_to_const()
-  : base() {
-}
-
-template <typename Container>
-inline
-const_iterator_to_const<Container>
-::const_iterator_to_const(const const_iterator_to_const& y)
-  : base(y.base) {
-}
-
-template <typename Container>
-inline
-const_iterator_to_const<Container>::const_iterator_to_const(const Base& b)
-  : base(b) {
-}
-
-template <typename Container>
-inline typename const_iterator_to_const<Container>::reference
-const_iterator_to_const<Container>::operator*() const {
-  return *base;
-}
-
-template <typename Container>
-inline typename const_iterator_to_const<Container>::pointer
-const_iterator_to_const<Container>::operator->() const {
-  return &*base;
-}
-
-template <typename Container>
-inline const_iterator_to_const<Container>&
-const_iterator_to_const<Container>::operator++() {
-  ++base;
-  return *this;
-}
-
-template <typename Container>
-inline const_iterator_to_const<Container>
-const_iterator_to_const<Container>::operator++(int) {
-  const_iterator_to_const tmp = *this;
-  operator++();
-  return tmp;
-}
-
-template <typename Container>
-inline const_iterator_to_const<Container>&
-const_iterator_to_const<Container>::operator--() {
-  --base;
-  return *this;
-}
-
-template <typename Container>
-inline const_iterator_to_const<Container>
-const_iterator_to_const<Container>::operator--(int) {
-  const_iterator_to_const tmp = *this;
-  operator--();
-  return tmp;
-}
-
-template <typename Container>
-inline bool
-const_iterator_to_const<Container>
-::operator==(const const_iterator_to_const& y) const {
-  return base == y.base;
-}
-
-template <typename Container>
-inline bool
-const_iterator_to_const<Container>
-::operator!=(const const_iterator_to_const& y) const {
-  return !operator==(y);
-}
-
-template <typename Container>
-inline
-const_iterator_to_const<Container>
-::const_iterator_to_const(const iterator_to_const<Container>& y)
-  : base(y.base) {
-}
-
-/*! \relates const_iterator_to_const */
-template <typename Container>
-inline bool
-operator==(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y) {
-  return const_iterator_to_const<Container>(x).operator==(y);
-}
-
-/*! \relates const_iterator_to_const */
-template <typename Container>
-inline bool
-operator!=(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y) {
-  return !(x == y);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_iterator_to_const_inlines_hh)
diff --git a/src/iterator_to_const.types.hh b/src/iterator_to_const.types.hh
deleted file mode 100644
index 29e2157..0000000
--- a/src/iterator_to_const.types.hh
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_iterator_to_const_types_hh
-#define PPL_iterator_to_const_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Container>
-class iterator_to_const;
-
-template <typename Container>
-class const_iterator_to_const;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_iterator_to_const_types_hh)
diff --git a/src/iterator_to_const_defs.hh b/src/iterator_to_const_defs.hh
new file mode 100644
index 0000000..74a889b
--- /dev/null
+++ b/src/iterator_to_const_defs.hh
@@ -0,0 +1,221 @@
+/* iterator_to_const and const_iterator_to_const class declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_iterator_to_const_hh
+#define PPL_iterator_to_const_hh 1
+
+#include "iterator_to_const_types.hh"
+#include "Powerset_types.hh"
+//#include "Ask_Tell_types.hh"
+#include <iterator>
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An iterator on a sequence of read-only objects.
+/*! \ingroup PPL_CXX_interface
+  This template class implements a bidirectional <EM>read-only</EM>
+  iterator on the sequence of objects <CODE>Container</CODE>.
+  By using this iterator class it is not possible to modify the objects
+  contained in <CODE>Container</CODE>; rather, object modification has
+  to be implemented by object replacement, i.e., by using the methods
+  provided by <CODE>Container</CODE> to remove/insert objects.
+  Such a policy (a modifiable container of read-only objects) allows
+  for a reliable enforcement of invariants (such as sortedness of the
+  objects in the sequence).
+
+  \note
+  For any developers' need, suitable friend declarations allow for
+  accessing the low-level iterators on the sequence of objects.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Container>
+class Parma_Polyhedra_Library::iterator_to_const {
+private:
+  //! The type of the underlying mutable iterator.
+  typedef typename Container::iterator Base;
+
+  //! A shortcut for naming the const_iterator traits.
+  typedef typename
+  std::iterator_traits<typename Container::const_iterator> Traits;
+
+  //! A (mutable) iterator on the sequence of elements.
+  Base base;
+
+  //! Constructs from the lower-level iterator.
+  iterator_to_const(const Base& b);
+
+  friend class const_iterator_to_const<Container>;
+  template <typename T> friend class Powerset;
+
+public:
+  // Same traits of the const_iterator, therefore
+  // forbidding the direct modification of sequence elements.
+  typedef typename Traits::iterator_category iterator_category;
+  typedef typename Traits::value_type value_type;
+  typedef typename Traits::difference_type difference_type;
+  typedef typename Traits::pointer pointer;
+  typedef typename Traits::reference reference;
+
+  //! Default constructor.
+  iterator_to_const();
+
+  //! Copy constructor.
+  iterator_to_const(const iterator_to_const& y);
+
+  //! Dereference operator.
+  reference operator*() const;
+
+  //! Indirect access operator.
+  pointer operator->() const;
+
+  //! Prefix increment operator.
+  iterator_to_const& operator++();
+
+  //! Postfix increment operator.
+  iterator_to_const operator++(int);
+
+  //! Prefix decrement operator.
+  iterator_to_const& operator--();
+
+  //! Postfix decrement operator.
+  iterator_to_const operator--(int);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are identical.
+  */
+  bool operator==(const iterator_to_const& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are different.
+  */
+  bool operator!=(const iterator_to_const& y) const;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A %const_iterator on a sequence of read-only objects.
+/*! \ingroup PPL_CXX_interface
+  This class, besides implementing a read-only bidirectional iterator
+  on a read-only sequence of objects, ensures interoperability
+  with template class iterator_to_const.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Container>
+class Parma_Polyhedra_Library::const_iterator_to_const {
+private:
+  //! The type of the underlying %const_iterator.
+  typedef typename Container::const_iterator Base;
+
+  //! A shortcut for naming traits.
+  typedef typename std::iterator_traits<Base> Traits;
+
+  //! A %const_iterator on the sequence of elements.
+  Base base;
+
+  //! Constructs from the lower-level const_iterator.
+  const_iterator_to_const(const Base& b);
+
+  friend class iterator_to_const<Container>;
+  template <typename T> friend class Powerset;
+
+public:
+  // Same traits of the underlying const_iterator.
+  typedef typename Traits::iterator_category iterator_category;
+  typedef typename Traits::value_type value_type;
+  typedef typename Traits::difference_type difference_type;
+  typedef typename Traits::pointer pointer;
+  typedef typename Traits::reference reference;
+
+  //! Default constructor.
+  const_iterator_to_const();
+
+  //! Copy constructor.
+  const_iterator_to_const(const const_iterator_to_const& y);
+
+  //! Constructs from the corresponding non-const iterator.
+  const_iterator_to_const(const iterator_to_const<Container>& y);
+
+  //! Dereference operator.
+  reference operator*() const;
+
+  //! Indirect member selector.
+  pointer operator->() const;
+
+  //! Prefix increment operator.
+  const_iterator_to_const& operator++();
+
+  //! Postfix increment operator.
+  const_iterator_to_const operator++(int);
+
+  //! Prefix decrement operator.
+  const_iterator_to_const& operator--();
+
+  //! Postfix decrement operator.
+  const_iterator_to_const operator--(int);
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are identical.
+  */
+  bool operator==(const const_iterator_to_const& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if
+    \p *this and \p y are different.
+  */
+  bool operator!=(const const_iterator_to_const& y) const;
+};
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Mixed comparison operator: returns <CODE>true</CODE> if and only
+  if (the const version of) \p x is identical to \p y.
+
+  \relates const_iterator_to_const
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Container>
+bool
+operator==(const iterator_to_const<Container>& x,
+           const const_iterator_to_const<Container>& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  Mixed comparison operator: returns <CODE>true</CODE> if and only
+  if (the const version of) \p x is different from \p y.
+
+  \relates const_iterator_to_const
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename Container>
+bool
+operator!=(const iterator_to_const<Container>& x,
+           const const_iterator_to_const<Container>& y);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "iterator_to_const_inlines.hh"
+
+#endif // !defined(PPL_iterator_to_const_hh)
diff --git a/src/iterator_to_const_inlines.hh b/src/iterator_to_const_inlines.hh
new file mode 100644
index 0000000..1eb5e6b
--- /dev/null
+++ b/src/iterator_to_const_inlines.hh
@@ -0,0 +1,202 @@
+/* iterator_to_const and const_iterator_to_const class implementations:
+   inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_iterator_to_const_inlines_hh
+#define PPL_iterator_to_const_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Container>
+inline
+iterator_to_const<Container>::iterator_to_const()
+  : base() {
+}
+
+template <typename Container>
+inline
+iterator_to_const<Container>::iterator_to_const(const iterator_to_const& y)
+  : base(y.base) {
+}
+
+template <typename Container>
+inline
+iterator_to_const<Container>::iterator_to_const(const Base& b)
+  : base(b) {
+}
+
+template <typename Container>
+inline typename iterator_to_const<Container>::reference
+iterator_to_const<Container>::operator*() const {
+  return *base;
+}
+
+template <typename Container>
+inline typename iterator_to_const<Container>::pointer
+iterator_to_const<Container>::operator->() const {
+  return &*base;
+}
+
+template <typename Container>
+inline iterator_to_const<Container>&
+iterator_to_const<Container>::operator++() {
+  ++base;
+  return *this;
+}
+
+template <typename Container>
+inline iterator_to_const<Container>
+iterator_to_const<Container>::operator++(int) {
+  iterator_to_const tmp = *this;
+  operator++();
+  return tmp;
+}
+
+template <typename Container>
+inline iterator_to_const<Container>&
+iterator_to_const<Container>::operator--() {
+  --base;
+  return *this;
+}
+
+template <typename Container>
+inline iterator_to_const<Container>
+iterator_to_const<Container>::operator--(int) {
+  iterator_to_const tmp = *this;
+  operator--();
+  return tmp;
+}
+
+template <typename Container>
+inline bool
+iterator_to_const<Container>::operator==(const iterator_to_const& y) const {
+  return base == y.base;
+}
+
+template <typename Container>
+inline bool
+iterator_to_const<Container>::operator!=(const iterator_to_const& y) const {
+  return !operator==(y);
+}
+
+template <typename Container>
+inline
+const_iterator_to_const<Container>::const_iterator_to_const()
+  : base() {
+}
+
+template <typename Container>
+inline
+const_iterator_to_const<Container>
+::const_iterator_to_const(const const_iterator_to_const& y)
+  : base(y.base) {
+}
+
+template <typename Container>
+inline
+const_iterator_to_const<Container>::const_iterator_to_const(const Base& b)
+  : base(b) {
+}
+
+template <typename Container>
+inline typename const_iterator_to_const<Container>::reference
+const_iterator_to_const<Container>::operator*() const {
+  return *base;
+}
+
+template <typename Container>
+inline typename const_iterator_to_const<Container>::pointer
+const_iterator_to_const<Container>::operator->() const {
+  return &*base;
+}
+
+template <typename Container>
+inline const_iterator_to_const<Container>&
+const_iterator_to_const<Container>::operator++() {
+  ++base;
+  return *this;
+}
+
+template <typename Container>
+inline const_iterator_to_const<Container>
+const_iterator_to_const<Container>::operator++(int) {
+  const_iterator_to_const tmp = *this;
+  operator++();
+  return tmp;
+}
+
+template <typename Container>
+inline const_iterator_to_const<Container>&
+const_iterator_to_const<Container>::operator--() {
+  --base;
+  return *this;
+}
+
+template <typename Container>
+inline const_iterator_to_const<Container>
+const_iterator_to_const<Container>::operator--(int) {
+  const_iterator_to_const tmp = *this;
+  operator--();
+  return tmp;
+}
+
+template <typename Container>
+inline bool
+const_iterator_to_const<Container>
+::operator==(const const_iterator_to_const& y) const {
+  return base == y.base;
+}
+
+template <typename Container>
+inline bool
+const_iterator_to_const<Container>
+::operator!=(const const_iterator_to_const& y) const {
+  return !operator==(y);
+}
+
+template <typename Container>
+inline
+const_iterator_to_const<Container>
+::const_iterator_to_const(const iterator_to_const<Container>& y)
+  : base(y.base) {
+}
+
+/*! \relates const_iterator_to_const */
+template <typename Container>
+inline bool
+operator==(const iterator_to_const<Container>& x,
+           const const_iterator_to_const<Container>& y) {
+  return const_iterator_to_const<Container>(x).operator==(y);
+}
+
+/*! \relates const_iterator_to_const */
+template <typename Container>
+inline bool
+operator!=(const iterator_to_const<Container>& x,
+           const const_iterator_to_const<Container>& y) {
+  return !(x == y);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_iterator_to_const_inlines_hh)
diff --git a/src/iterator_to_const_types.hh b/src/iterator_to_const_types.hh
new file mode 100644
index 0000000..4b335a2
--- /dev/null
+++ b/src/iterator_to_const_types.hh
@@ -0,0 +1,26 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_iterator_to_const_types_hh
+#define PPL_iterator_to_const_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Container>
+class iterator_to_const;
+
+template <typename Container>
+class const_iterator_to_const;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_iterator_to_const_types_hh)
diff --git a/src/linearize.hh b/src/linearize.hh
index 1a074ae..a43ed21 100644
--- a/src/linearize.hh
+++ b/src/linearize.hh
@@ -1,6 +1,6 @@
 /* Linearization function implementation.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,10 +24,10 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_linearize_hh
 #define PPL_linearize_hh 1
 
-#include "Concrete_Expression.defs.hh"
-#include "Float.defs.hh"
-#include "Linear_Form.defs.hh"
-#include "Box.defs.hh"
+#include "Concrete_Expression_defs.hh"
+#include "Float_defs.hh"
+#include "Linear_Form_defs.hh"
+#include "Box_defs.hh"
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -826,7 +826,7 @@ linearize(const Concrete_Expression<Target>& expr,
 
       result = FP_Linear_Form(variable_value->second);
       /* FIXME: do we really need to contemplate the possibility
-	 that an unbounded linear form was saved into lf_store? */
+         that an unbounded linear form was saved into lf_store? */
       return !result.overflows();
     }
 
diff --git a/src/math_utilities.defs.hh b/src/math_utilities.defs.hh
deleted file mode 100644
index 4b8fc58..0000000
--- a/src/math_utilities.defs.hh
+++ /dev/null
@@ -1,110 +0,0 @@
-/* Declarations of some math utility functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_math_utilities_defs_hh
-#define PPL_math_utilities_defs_hh 1
-
-#include "Coefficient.types.hh"
-#include "Checked_Number.defs.hh"
-#include <gmpxx.h>
-
-namespace Parma_Polyhedra_Library {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Extract the numerator and denominator components of \p from.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
-numer_denom(const T& from,
-	    Coefficient& numer, Coefficient& denom);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Divides \p x by \p y into \p to, rounding the result towards plus infinity.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
-div_round_up(T& to,
-	     Coefficient_traits::const_reference x,
-	     Coefficient_traits::const_reference y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Assigns to \p x the minimum between \p x and \p y.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename N>
-void
-min_assign(N& x, const N& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Assigns to \p x the maximum between \p x and \p y.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename N>
-void
-max_assign(N& x, const N& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x is an even number.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_even(const T& x);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \f$x = -y\f$.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename T>
-typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_additive_inverse(const T& x, const T& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief
-  If \f$g\f$ is the GCD of \p x and \p y, the values of \p x and \p y
-  divided by \f$g\f$ are assigned to \p n_x and \p n_y, respectively.
-
-  \note
-  \p x and \p n_x may be the same object and likewise for
-  \p y and \p n_y.  Any other aliasing results in undefined behavior.
-*/
-#endif
-void
-normalize2(Coefficient_traits::const_reference x,
-	   Coefficient_traits::const_reference y,
-	   Coefficient& n_x, Coefficient& n_y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns <CODE>true</CODE> if and only if \p x is in canonical form.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-bool
-is_canonical(const mpq_class& x);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Returns a mask for the lowest \p n bits,
-#endif
-template <typename T>
-T
-low_bits_mask(unsigned n);
-
-} // namespace Parma_Polyhedra_Library
-
-#include "math_utilities.inlines.hh"
-
-#endif // !defined(PPL_math_utilities_defs_hh)
diff --git a/src/math_utilities.inlines.hh b/src/math_utilities.inlines.hh
deleted file mode 100644
index 75a9567..0000000
--- a/src/math_utilities.inlines.hh
+++ /dev/null
@@ -1,120 +0,0 @@
-/* Implementation of some math utility functions: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_math_utilities_inlines_hh
-#define PPL_math_utilities_inlines_hh 1
-
-#include "Coefficient.defs.hh"
-#include <limits>
-#include "assert.hh"
-
-namespace Parma_Polyhedra_Library {
-
-inline void
-normalize2(Coefficient_traits::const_reference x,
-	   Coefficient_traits::const_reference y,
-	   Coefficient& n_x, Coefficient& n_y) {
-  PPL_DIRTY_TEMP_COEFFICIENT(gcd);
-  gcd_assign(gcd, x, y);
-  exact_div_assign(n_x, x, gcd);
-  exact_div_assign(n_y, y, gcd);
-}
-
-template <typename T>
-inline T
-low_bits_mask(const unsigned n) {
-  PPL_ASSERT(n < unsigned(std::numeric_limits<T>::digits));
-  return ~((~static_cast<T>(0)) << n);
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
-numer_denom(const T& from,
-	    Coefficient& numer, Coefficient& denom) {
-  PPL_ASSERT(!is_not_a_number(from)
-	 && !is_minus_infinity(from)
-	 && !is_plus_infinity(from));
-  PPL_DIRTY_TEMP(mpq_class, q);
-  assign_r(q, from, ROUND_NOT_NEEDED);
-  numer = q.get_num();
-  denom = q.get_den();
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
-div_round_up(T& to,
-	     Coefficient_traits::const_reference x,
-	     Coefficient_traits::const_reference y) {
-  PPL_DIRTY_TEMP(mpq_class, q_x);
-  PPL_DIRTY_TEMP(mpq_class, q_y);
-  // Note: this code assumes that a Coefficient is always convertible
-  // to an mpq_class without loss of precision.
-  assign_r(q_x, x, ROUND_NOT_NEEDED);
-  assign_r(q_y, y, ROUND_NOT_NEEDED);
-  div_assign_r(q_x, q_x, q_y, ROUND_NOT_NEEDED);
-  assign_r(to, q_x, ROUND_UP);
-}
-
-template <typename N>
-inline void
-min_assign(N& x, const N& y) {
-  if (x > y)
-    x = y;
-}
-
-template <typename N>
-inline void
-max_assign(N& x, const N& y) {
-  if (x < y)
-    x = y;
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_even(const T& x) {
-  T mod;
-  return umod_2exp_assign_r(mod, x, 1, ROUND_DIRECT | ROUND_STRICT_RELATION) == V_EQ
-    && mod == 0;
-}
-
-template <typename T>
-inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
-is_additive_inverse(const T& x, const T& y) {
-  T negated_x;
-  return neg_assign_r(negated_x, x, ROUND_DIRECT | ROUND_STRICT_RELATION) == V_EQ
-    && negated_x == y;
-}
-
-inline bool
-is_canonical(const mpq_class& x) {
-  if (x.get_den() <= 0)
-    return false;
-  PPL_DIRTY_TEMP(mpq_class, temp);
-  temp = x;
-  temp.canonicalize();
-  return temp.get_num() == x.get_num();
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_math_utilities_inlines_hh)
diff --git a/src/math_utilities_defs.hh b/src/math_utilities_defs.hh
new file mode 100644
index 0000000..8b13404
--- /dev/null
+++ b/src/math_utilities_defs.hh
@@ -0,0 +1,110 @@
+/* Declarations of some math utility functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_math_utilities_defs_hh
+#define PPL_math_utilities_defs_hh 1
+
+#include "Coefficient_types.hh"
+#include "Checked_Number_defs.hh"
+#include <gmpxx.h>
+
+namespace Parma_Polyhedra_Library {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Extract the numerator and denominator components of \p from.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
+numer_denom(const T& from,
+            Coefficient& numer, Coefficient& denom);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Divides \p x by \p y into \p to, rounding the result towards plus infinity.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
+div_round_up(T& to,
+             Coefficient_traits::const_reference x,
+             Coefficient_traits::const_reference y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Assigns to \p x the minimum between \p x and \p y.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename N>
+void
+min_assign(N& x, const N& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Assigns to \p x the maximum between \p x and \p y.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename N>
+void
+max_assign(N& x, const N& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x is an even number.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_even(const T& x);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \f$x = -y\f$.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_additive_inverse(const T& x, const T& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  If \f$g\f$ is the GCD of \p x and \p y, the values of \p x and \p y
+  divided by \f$g\f$ are assigned to \p n_x and \p n_y, respectively.
+
+  \note
+  \p x and \p n_x may be the same object and likewise for
+  \p y and \p n_y.  Any other aliasing results in undefined behavior.
+*/
+#endif
+void
+normalize2(Coefficient_traits::const_reference x,
+           Coefficient_traits::const_reference y,
+           Coefficient& n_x, Coefficient& n_y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns <CODE>true</CODE> if and only if \p x is in canonical form.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+bool
+is_canonical(const mpq_class& x);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Returns a mask for the lowest \p n bits,
+#endif
+template <typename T>
+T
+low_bits_mask(unsigned n);
+
+} // namespace Parma_Polyhedra_Library
+
+#include "math_utilities_inlines.hh"
+
+#endif // !defined(PPL_math_utilities_defs_hh)
diff --git a/src/math_utilities_inlines.hh b/src/math_utilities_inlines.hh
new file mode 100644
index 0000000..671bb6b
--- /dev/null
+++ b/src/math_utilities_inlines.hh
@@ -0,0 +1,120 @@
+/* Implementation of some math utility functions: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_math_utilities_inlines_hh
+#define PPL_math_utilities_inlines_hh 1
+
+#include "Coefficient_defs.hh"
+#include <limits>
+#include "assert.hh"
+
+namespace Parma_Polyhedra_Library {
+
+inline void
+normalize2(Coefficient_traits::const_reference x,
+           Coefficient_traits::const_reference y,
+           Coefficient& n_x, Coefficient& n_y) {
+  PPL_DIRTY_TEMP_COEFFICIENT(gcd);
+  gcd_assign(gcd, x, y);
+  exact_div_assign(n_x, x, gcd);
+  exact_div_assign(n_y, y, gcd);
+}
+
+template <typename T>
+inline T
+low_bits_mask(const unsigned n) {
+  PPL_ASSERT(n < unsigned(std::numeric_limits<T>::digits));
+  return ~((~static_cast<T>(0)) << n);
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
+numer_denom(const T& from,
+            Coefficient& numer, Coefficient& denom) {
+  PPL_ASSERT(!is_not_a_number(from)
+         && !is_minus_infinity(from)
+         && !is_plus_infinity(from));
+  PPL_DIRTY_TEMP(mpq_class, q);
+  assign_r(q, from, ROUND_NOT_NEEDED);
+  numer = q.get_num();
+  denom = q.get_den();
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
+div_round_up(T& to,
+             Coefficient_traits::const_reference x,
+             Coefficient_traits::const_reference y) {
+  PPL_DIRTY_TEMP(mpq_class, q_x);
+  PPL_DIRTY_TEMP(mpq_class, q_y);
+  // Note: this code assumes that a Coefficient is always convertible
+  // to an mpq_class without loss of precision.
+  assign_r(q_x, x, ROUND_NOT_NEEDED);
+  assign_r(q_y, y, ROUND_NOT_NEEDED);
+  div_assign_r(q_x, q_x, q_y, ROUND_NOT_NEEDED);
+  assign_r(to, q_x, ROUND_UP);
+}
+
+template <typename N>
+inline void
+min_assign(N& x, const N& y) {
+  if (x > y)
+    x = y;
+}
+
+template <typename N>
+inline void
+max_assign(N& x, const N& y) {
+  if (x < y)
+    x = y;
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_even(const T& x) {
+  T mod;
+  return umod_2exp_assign_r(mod, x, 1, ROUND_DIRECT | ROUND_STRICT_RELATION) == V_EQ
+    && mod == 0;
+}
+
+template <typename T>
+inline typename Enable_If<Is_Native_Or_Checked<T>::value, bool>::type
+is_additive_inverse(const T& x, const T& y) {
+  T negated_x;
+  return neg_assign_r(negated_x, x, ROUND_DIRECT | ROUND_STRICT_RELATION) == V_EQ
+    && negated_x == y;
+}
+
+inline bool
+is_canonical(const mpq_class& x) {
+  if (x.get_den() <= 0)
+    return false;
+  PPL_DIRTY_TEMP(mpq_class, temp);
+  temp = x;
+  temp.canonicalize();
+  return temp.get_num() == x.get_num();
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_math_utilities_inlines_hh)
diff --git a/src/max_space_dimension.hh b/src/max_space_dimension.hh
index 5476f01..80c727a 100644
--- a/src/max_space_dimension.hh
+++ b/src/max_space_dimension.hh
@@ -1,6 +1,6 @@
 /* Definition of functions yielding maximal space dimensions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,13 +24,13 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_max_space_dimension_hh
 #define PPL_max_space_dimension_hh 1
 
-#include "Polyhedron.defs.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-#include "Grid.defs.hh"
+#include "Polyhedron_defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+#include "Grid_defs.hh"
 #include "Rational_Box.hh"
-#include "BD_Shape.defs.hh"
-#include "Octagonal_Shape.defs.hh"
+#include "BD_Shape_defs.hh"
+#include "Octagonal_Shape_defs.hh"
 #include <algorithm>
 
 namespace Parma_Polyhedra_Library {
diff --git a/src/meta_programming.hh b/src/meta_programming.hh
index 9e18296..9a75fb3 100644
--- a/src/meta_programming.hh
+++ b/src/meta_programming.hh
@@ -1,6 +1,6 @@
 /* Metaprogramming utilities.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -39,7 +39,7 @@ namespace Parma_Polyhedra_Library {
   mandated by Section 9.4.2/4 of the C++ standard).
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define const_bool_nodef(name, value)		\
+#define const_bool_nodef(name, value)           \
   enum const_bool_value_ ## name { PPL_U(name) = (value) }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -68,9 +68,9 @@ namespace Parma_Polyhedra_Library {
   mandated by Section 9.4.2/4 of the C++ standard).
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define const_value_nodef(type, name, value)	\
+#define const_value_nodef(type, name, value)    \
   static type PPL_U(name)() {                   \
-    return (value);				\
+    return (value);                             \
   }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -85,10 +85,10 @@ namespace Parma_Polyhedra_Library {
   mandated by Section 9.4.2/4 of the C++ standard).
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define const_ref_nodef(type, name, value)				\
+#define const_ref_nodef(type, name, value)                              \
   static const type& PPL_U(name)() {                                    \
     static type PPL_U(name) = (value);                                       \
-    return (name);							\
+    return (name);                                                      \
   }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -116,10 +116,10 @@ struct Compile_Time_Check<true> {
 };
 
 #define PPL_COMPILE_TIME_CHECK_NAME(suffix) compile_time_check_ ## suffix
-#define PPL_COMPILE_TIME_CHECK_AUX(e, suffix)				\
-  enum anonymous_enum_compile_time_check_ ## suffix {			\
+#define PPL_COMPILE_TIME_CHECK_AUX(e, suffix)                           \
+  enum anonymous_enum_compile_time_check_ ## suffix {                   \
     /* If e evaluates to false, then the sizeof cannot be compiled. */  \
-    PPL_COMPILE_TIME_CHECK_NAME(suffix)					\
+    PPL_COMPILE_TIME_CHECK_NAME(suffix)                                 \
       = sizeof(Parma_Polyhedra_Library::Compile_Time_Check<(e)>)        \
   }
 
diff --git a/src/mp_std_bits.cc b/src/mp_std_bits.cc
index d353c19..0ca7bdb 100644
--- a/src/mp_std_bits.cc
+++ b/src/mp_std_bits.cc
@@ -1,7 +1,7 @@
 /* Definitions of specializations of std::numeric_limits objects for
    multi-precision types.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,7 +23,10 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "mp_std_bits.defs.hh"
+#include "mp_std_bits_defs.hh"
+
+#if __GNU_MP_VERSION < 5 \
+  || (__GNU_MP_VERSION == 5 && __GNU_MP_VERSION_MINOR < 1)
 
 const bool std::numeric_limits<mpz_class>::is_specialized;
 const int std::numeric_limits<mpz_class>::digits;
@@ -45,7 +48,7 @@ const bool std::numeric_limits<mpz_class>::is_iec559;
 const bool std::numeric_limits<mpz_class>::is_bounded;
 const bool std::numeric_limits<mpz_class>::is_modulo;
 const bool std::numeric_limits<mpz_class>::traps;
-const bool std::numeric_limits<mpz_class>::tininess_before;
+const bool std::numeric_limits<mpz_class>::tinyness_before;
 const std::float_round_style std::numeric_limits<mpz_class>::round_style;
 
 const bool std::numeric_limits<mpq_class>::is_specialized;
@@ -68,5 +71,8 @@ const bool std::numeric_limits<mpq_class>::is_iec559;
 const bool std::numeric_limits<mpq_class>::is_bounded;
 const bool std::numeric_limits<mpq_class>::is_modulo;
 const bool std::numeric_limits<mpq_class>::traps;
-const bool std::numeric_limits<mpq_class>::tininess_before;
+const bool std::numeric_limits<mpq_class>::tinyness_before;
 const std::float_round_style std::numeric_limits<mpq_class>::round_style;
+
+#endif // __GNU_MP_VERSION < 5
+       // || (__GNU_MP_VERSION == 5 && __GNU_MP_VERSION_MINOR < 1)
diff --git a/src/mp_std_bits.defs.hh b/src/mp_std_bits.defs.hh
deleted file mode 100644
index d1ecf54..0000000
--- a/src/mp_std_bits.defs.hh
+++ /dev/null
@@ -1,169 +0,0 @@
-/* Declarations of specializations of std:: objects for
-   multi-precision types.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_mp_std_bits_defs_hh
-#define PPL_mp_std_bits_defs_hh 1
-
-#include <gmpxx.h>
-#include <limits>
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(mpz_class& x, mpz_class& y);
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Swaps \p x with \p y.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-void swap(mpq_class& x, mpq_class& y);
-
-namespace std {
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Specialization of std::numeric_limits.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <>
-class numeric_limits<mpz_class> {
-private:
-  typedef mpz_class Type;
-
-public:
-  static const bool is_specialized = true;
-  static const int digits = 0;
-  static const int digits10 = 0;
-  static const bool is_signed = true;
-  static const bool is_integer = true;
-  static const bool is_exact = true;
-  static const int radix = 2;
-  static const int min_exponent = 0;
-  static const int min_exponent10 = 0;
-  static const int max_exponent = 0;
-  static const int max_exponent10 = 0;
-  static const bool has_infinity = false;
-  static const bool has_quiet_NaN =  false;
-  static const bool has_signaling_NaN = false;
-  static const float_denorm_style has_denorm = denorm_absent;
-  static const bool has_denorm_loss = false;
-  static const bool is_iec559 = false;
-  static const bool is_bounded = false;
-  static const bool is_modulo = false;
-  static const bool traps = false;
-  static const bool tininess_before = false;
-  static const float_round_style round_style = round_toward_zero;
-
-  static Type min() {
-    return static_cast<Type>(0);
-  }
-
-  static Type max() {
-    return static_cast<Type>(0);
-  }
-
-  static Type epsilon() {
-    return static_cast<Type>(0);
-  }
-
-  static Type round_error() {
-    return static_cast<Type>(0);
-  }
-
-  static Type infinity() {
-    return static_cast<Type>(0);
-  }
-
-  static Type quiet_NaN() {
-    return static_cast<Type>(0);
-  }
-
-  static Type denorm_min() {
-    return static_cast<Type>(1);
-  }
-};
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! Specialization of std::numeric_limits.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <>
-class numeric_limits<mpq_class> {
-private:
-  typedef mpq_class Type;
-
-public:
-  static const bool is_specialized = true;
-  static const int digits = 0;
-  static const int digits10 = 0;
-  static const bool is_signed = true;
-  static const bool is_integer = false;
-  static const bool is_exact = true;
-  static const int radix = 2;
-  static const int min_exponent = 0;
-  static const int min_exponent10 = 0;
-  static const int max_exponent = 0;
-  static const int max_exponent10 = 0;
-  static const bool has_infinity = false;
-  static const bool has_quiet_NaN =  false;
-  static const bool has_signaling_NaN = false;
-  static const float_denorm_style has_denorm = denorm_absent;
-  static const bool has_denorm_loss = false;
-  static const bool is_iec559 = false;
-  static const bool is_bounded = false;
-  static const bool is_modulo = false;
-  static const bool traps = false;
-  static const bool tininess_before = false;
-  static const float_round_style round_style = round_toward_zero;
-
-  static Type min() {
-    return static_cast<Type>(0);
-  }
-
-  static Type max() {
-    return static_cast<Type>(0);
-  }
-
-  static Type epsilon() {
-    return static_cast<Type>(0);
-  }
-
-  static Type round_error() {
-    return static_cast<Type>(0);
-  }
-
-  static Type infinity() {
-    return static_cast<Type>(0);
-  }
-
-  static Type quiet_NaN() {
-    return static_cast<Type>(0);
-  }
-
-  static Type denorm_min() {
-    return static_cast<Type>(0);
-  }
-};
-
-} // namespace std
-
-#include "mp_std_bits.inlines.hh"
-
-#endif // !defined(PPL_mp_std_bits_defs_hh)
diff --git a/src/mp_std_bits.inlines.hh b/src/mp_std_bits.inlines.hh
deleted file mode 100644
index 30b3160..0000000
--- a/src/mp_std_bits.inlines.hh
+++ /dev/null
@@ -1,38 +0,0 @@
-/* Definitions of specializations of std:: functions and methods for
-   multi-precision types.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_mp_std_bits_inlines_hh
-#define PPL_mp_std_bits_inlines_hh 1
-
-inline void
-swap(mpz_class& x, mpz_class& y) {
-  mpz_swap(x.get_mpz_t(), y.get_mpz_t());
-}
-
-inline void
-swap(mpq_class& x, mpq_class& y) {
-  mpq_swap(x.get_mpq_t(), y.get_mpq_t());
-}
-
-#endif // !defined(PPL_mp_std_bits_inlines_hh)
diff --git a/src/mp_std_bits_defs.hh b/src/mp_std_bits_defs.hh
new file mode 100644
index 0000000..19447b8
--- /dev/null
+++ b/src/mp_std_bits_defs.hh
@@ -0,0 +1,175 @@
+/* Declarations of specializations of std:: objects for
+   multi-precision types.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_mp_std_bits_defs_hh
+#define PPL_mp_std_bits_defs_hh 1
+
+#include <gmpxx.h>
+#include <limits>
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(mpz_class& x, mpz_class& y);
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Swaps \p x with \p y.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+void swap(mpq_class& x, mpq_class& y);
+
+#if __GNU_MP_VERSION < 5 \
+  || (__GNU_MP_VERSION == 5 && __GNU_MP_VERSION_MINOR < 1)
+
+namespace std {
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Specialization of std::numeric_limits.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <>
+class numeric_limits<mpz_class> {
+private:
+  typedef mpz_class Type;
+
+public:
+  static const bool is_specialized = true;
+  static const int digits = 0;
+  static const int digits10 = 0;
+  static const bool is_signed = true;
+  static const bool is_integer = true;
+  static const bool is_exact = true;
+  static const int radix = 2;
+  static const int min_exponent = 0;
+  static const int min_exponent10 = 0;
+  static const int max_exponent = 0;
+  static const int max_exponent10 = 0;
+  static const bool has_infinity = false;
+  static const bool has_quiet_NaN =  false;
+  static const bool has_signaling_NaN = false;
+  static const float_denorm_style has_denorm = denorm_absent;
+  static const bool has_denorm_loss = false;
+  static const bool is_iec559 = false;
+  static const bool is_bounded = false;
+  static const bool is_modulo = false;
+  static const bool traps = false;
+  static const bool tinyness_before = false;
+  static const float_round_style round_style = round_toward_zero;
+
+  static Type min() {
+    return static_cast<Type>(0);
+  }
+
+  static Type max() {
+    return static_cast<Type>(0);
+  }
+
+  static Type epsilon() {
+    return static_cast<Type>(0);
+  }
+
+  static Type round_error() {
+    return static_cast<Type>(0);
+  }
+
+  static Type infinity() {
+    return static_cast<Type>(0);
+  }
+
+  static Type quiet_NaN() {
+    return static_cast<Type>(0);
+  }
+
+  static Type denorm_min() {
+    return static_cast<Type>(1);
+  }
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Specialization of std::numeric_limits.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <>
+class numeric_limits<mpq_class> {
+private:
+  typedef mpq_class Type;
+
+public:
+  static const bool is_specialized = true;
+  static const int digits = 0;
+  static const int digits10 = 0;
+  static const bool is_signed = true;
+  static const bool is_integer = false;
+  static const bool is_exact = true;
+  static const int radix = 2;
+  static const int min_exponent = 0;
+  static const int min_exponent10 = 0;
+  static const int max_exponent = 0;
+  static const int max_exponent10 = 0;
+  static const bool has_infinity = false;
+  static const bool has_quiet_NaN =  false;
+  static const bool has_signaling_NaN = false;
+  static const float_denorm_style has_denorm = denorm_absent;
+  static const bool has_denorm_loss = false;
+  static const bool is_iec559 = false;
+  static const bool is_bounded = false;
+  static const bool is_modulo = false;
+  static const bool traps = false;
+  static const bool tinyness_before = false;
+  static const float_round_style round_style = round_toward_zero;
+
+  static Type min() {
+    return static_cast<Type>(0);
+  }
+
+  static Type max() {
+    return static_cast<Type>(0);
+  }
+
+  static Type epsilon() {
+    return static_cast<Type>(0);
+  }
+
+  static Type round_error() {
+    return static_cast<Type>(0);
+  }
+
+  static Type infinity() {
+    return static_cast<Type>(0);
+  }
+
+  static Type quiet_NaN() {
+    return static_cast<Type>(0);
+  }
+
+  static Type denorm_min() {
+    return static_cast<Type>(0);
+  }
+};
+
+} // namespace std
+
+#endif // __GNU_MP_VERSION < 5
+       // || (__GNU_MP_VERSION == 5 && __GNU_MP_VERSION_MINOR < 1)
+
+#include "mp_std_bits_inlines.hh"
+
+#endif // !defined(PPL_mp_std_bits_defs_hh)
diff --git a/src/mp_std_bits_inlines.hh b/src/mp_std_bits_inlines.hh
new file mode 100644
index 0000000..90f1b24
--- /dev/null
+++ b/src/mp_std_bits_inlines.hh
@@ -0,0 +1,38 @@
+/* Definitions of specializations of std:: functions and methods for
+   multi-precision types.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_mp_std_bits_inlines_hh
+#define PPL_mp_std_bits_inlines_hh 1
+
+inline void
+swap(mpz_class& x, mpz_class& y) {
+  mpz_swap(x.get_mpz_t(), y.get_mpz_t());
+}
+
+inline void
+swap(mpq_class& x, mpq_class& y) {
+  mpq_swap(x.get_mpq_t(), y.get_mpq_t());
+}
+
+#endif // !defined(PPL_mp_std_bits_inlines_hh)
diff --git a/src/namespaces.hh b/src/namespaces.hh
index 3a67042..7f0c45b 100644
--- a/src/namespaces.hh
+++ b/src/namespaces.hh
@@ -1,6 +1,6 @@
 /* Documentation for used namespaces.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -44,7 +44,7 @@ namespace Parma_Polyhedra_Library {
   \code
     const Constraint_System& cs = ...;
     copy(cs.begin(), cs.end(),
-	 ostream_iterator<Constraint>(cout, "\n"));
+         ostream_iterator<Constraint>(cout, "\n"));
   \endcode
   the Parma_Polyhedra_Library namespace must be suitably extended.
   This can be done as follows:
diff --git a/src/ppl-config.cc.in b/src/ppl-config.cc.in
index 48265f2..78c23bf 100644
--- a/src/ppl-config.cc.in
+++ b/src/ppl-config.cc.in
@@ -1,7 +1,7 @@
 /* A program to enquire about the configuration of the PPL  -*- C++ -*-
    and of the applications using it.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -254,7 +254,7 @@ struct option long_options[] = {
 #ifdef PPL_HAVE_GETOPT_H
     int option_index = 0;
     int c = getopt_long(argc, argv, OPTION_LETTERS, long_options,
-			&option_index);
+                        &option_index);
 #else
     int c = getopt(argc, argv, OPTION_LETTERS);
 #endif
@@ -275,47 +275,47 @@ struct option long_options[] = {
       // --format
     case 'F':
       if (strcaseeq(optarg, "plain"))
-	required_format = PLAIN;
+        required_format = PLAIN;
       else if (strcaseeq(optarg, "makefile"))
-	required_format = MAKEFILE;
+        required_format = MAKEFILE;
       else if (strcaseeq(optarg, "sh"))
-	required_format = SH;
+        required_format = SH;
       else if (strcaseeq(optarg, "csh"))
-	required_format = CSH;
+        required_format = CSH;
       else
-	fatal("invalid argument `%s' to --format: "
-	      "must be `plain', `makefile', `sh' or `csh'",
-	      optarg);
+        fatal("invalid argument `%s' to --format: "
+              "must be `plain', `makefile', `sh' or `csh'",
+              optarg);
       break;
 
       // --interface
     case 'I':
       if (strcaseeq(optarg, "C++"))
-	required_interface = CXX;
+        required_interface = CXX;
       else if (strcaseeq(optarg, "C"))
-	required_interface = C;
+        required_interface = C;
       else if (strcaseeq(optarg, "Ciao-Prolog"))
-	required_interface = CIAO_PROLOG;
+        required_interface = CIAO_PROLOG;
       else if (strcaseeq(optarg, "GNU-Prolog"))
-	required_interface = GNU_PROLOG;
+        required_interface = GNU_PROLOG;
       else if (strcaseeq(optarg, "SICStus-Prolog"))
-	required_interface = SICSTUS_PROLOG;
+        required_interface = SICSTUS_PROLOG;
       else if (strcaseeq(optarg, "SWI-Prolog"))
-	required_interface = SWI_PROLOG;
+        required_interface = SWI_PROLOG;
       else if (strcaseeq(optarg, "XSB-Prolog"))
-	required_interface = XSB_PROLOG;
+        required_interface = XSB_PROLOG;
       else if (strcaseeq(optarg, "YAP-Prolog"))
-	required_interface = YAP_PROLOG;
+        required_interface = YAP_PROLOG;
       else if (strcaseeq(optarg, "OCaml"))
-	required_interface = OCAML;
+        required_interface = OCAML;
       else if (strcaseeq(optarg, "Java"))
-	required_interface = JAVA;
+        required_interface = JAVA;
       else
-	fatal("invalid argument `%s' to --interface: "
-	      "must be `C++', `C', `Ciao-Prolog', `GNU-Prolog', "
+        fatal("invalid argument `%s' to --interface: "
+              "must be `C++', `C', `Ciao-Prolog', `GNU-Prolog', "
               "`SICStus-Prolog', `SWI-Prolog', `XSB-Prolog', `YAP-Prolog', "
-	      "`OCaml' or `Java'",
-	      optarg);
+              "`OCaml' or `Java'",
+              optarg);
       break;
 
       // --application
@@ -331,27 +331,27 @@ struct option long_options[] = {
       // --prefix
     case 'p':
       if (optarg != 0) {
-	prefix = optarg;
-	if (!exec_prefix_set) {
-	  exec_prefix = optarg;
-	  exec_prefix_set = true;
-	}
+        prefix = optarg;
+        if (!exec_prefix_set) {
+          exec_prefix = optarg;
+          exec_prefix_set = true;
+        }
       }
       else {
-	required_prefix = true;
-	++num_required_items;
+        required_prefix = true;
+        ++num_required_items;
       }
       break;
 
       // --exec_prefix
     case 'e':
       if (optarg != 0) {
-	exec_prefix = optarg;
-	exec_prefix_set = true;
+        exec_prefix = optarg;
+        exec_prefix_set = true;
       }
       else {
-	required_exec_prefix = true;
-	++num_required_items;
+        required_exec_prefix = true;
+        ++num_required_items;
       }
       break;
 
@@ -557,7 +557,7 @@ portray(const char* name, long n) {
 
 void
 replace(std::string& s,
-	const std::string& pattern, const std::string& replacement) {
+        const std::string& pattern, const std::string& replacement) {
   std::string::size_type pos = 0;
   while (true) {
     pos = s.find(pattern, pos);
@@ -590,7 +590,7 @@ main(int argc, char* argv[]) try {
 
   if (strcmp(PPL_VERSION, PPL::version()) != 0)
     fatal("was compiled with PPL version %s, but linked with version %s",
-	  PPL_VERSION, PPL::version());
+          PPL_VERSION, PPL::version());
 
   // Initialize prefixes.
   prefix = "@prefix@";
@@ -648,18 +648,18 @@ main(int argc, char* argv[]) try {
       // `/usr/include' is the standard include directory:
       // thus it needs not be specified.
       if (s == "/usr/include")
-	s = cppflags;
+        s = cppflags;
       else {
-	s = "-I" + s;
-	// Avoid duplicating the -I options.
-	if (cppflags.find(s) != std::string::npos)
-	  s = "";
-	if (s.length() > 0 && strlen("@CPPFLAGS@") > 0)
-	  s += ' ';
-	s += "@CPPFLAGS@";
+        s = "-I" + s;
+        // Avoid duplicating the -I options.
+        if (cppflags.find(s) != std::string::npos)
+          s = "";
+        if (s.length() > 0 && strlen("@CPPFLAGS@") > 0)
+          s += ' ';
+        s += "@CPPFLAGS@";
       }
       if (s.length() > 0 && strlen("@extra_includes@") > 0)
-	  s += ' ';
+          s += ' ';
       s += "@extra_includes@";
       portray("CPPFLAGS", s);
     }
@@ -685,23 +685,23 @@ main(int argc, char* argv[]) try {
       s = "-L" + s;
       // Avoid duplicating the -L options.
       if (ldflags.find(s) != std::string::npos)
-	s = "";
+        s = "";
       if (s.length() > 0 && ldflags.length() > 0)
-	s += ' ';
+        s += ' ';
       s += ldflags;
     }
     if (required_library) {
       if (s.length() > 0 && strlen("@extra_libraries@") > 0)
-	s += ' ';
+        s += ' ';
       s += "@extra_libraries@";
     }
     else {
       assert(required_application);
       if (s.length() > 0)
-	s += ' ';
+        s += ' ';
       s += "-lppl";
       if (required_interface == C)
-	s += " -lppl_c";
+        s += " -lppl_c";
       s += " -lgmpxx -lgmp";
     }
     portray("LDFLAGS", s);
diff --git a/src/ppl.hh.dist b/src/ppl.hh.dist
index 61b9272..1ba06f4 100644
--- a/src/ppl.hh.dist
+++ b/src/ppl.hh.dist
@@ -1,6 +1,6 @@
 /* This is the header file of the Parma Polyhedra Library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -245,7 +245,7 @@ site: http://bugseng.com/products/ppl/ . */
 #define PPL_PACKAGE_NAME "the Parma Polyhedra Library"
 
 /* Define to the full name and version of this package. */
-#define PPL_PACKAGE_STRING "the Parma Polyhedra Library 1.0"
+#define PPL_PACKAGE_STRING "the Parma Polyhedra Library 1.1pre8"
 
 /* Define to the one symbol short name of this package. */
 #define PPL_PACKAGE_TARNAME "ppl"
@@ -254,7 +254,7 @@ site: http://bugseng.com/products/ppl/ . */
 #define PACKAGE_URL ""
 
 /* Define to the version of this package. */
-#define PPL_PACKAGE_VERSION "1.0"
+#define PPL_PACKAGE_VERSION "1.1pre8"
 
 /* ABI-breaking extra assertions are enabled when this is defined. */
 /* #undef PPL_ABI_BREAKING_EXTRA_DEBUG */
@@ -273,7 +273,7 @@ site: http://bugseng.com/products/ppl/ . */
 #define PPL_COEFFICIENT_TYPE mpz_class
 
 /* This contains the options with which `configure' was invoked. */
-#define PPL_CONFIGURE_OPTIONS " '--with-java=/usr/lib/jvm/java-7-openjdk-amd64'"
+#define PPL_CONFIGURE_OPTIONS " '--libdir=/usr/local/lib64' '--with-java=/usr/lib/jvm/java-7-openjdk-amd64' '--enable-interfaces=c++,c,ocaml,java,swi_prolog'"
 
 /* The unique code of the binary format of C++ doubles, if supported;
    undefined otherwise. */
@@ -458,7 +458,7 @@ site: http://bugseng.com/products/ppl/ . */
 
 //! The minor number of the PPL version.
 /*! \ingroup PPL_CXX_interface */
-#define PPL_VERSION_MINOR 0
+#define PPL_VERSION_MINOR 1
 
 //! The revision number of the PPL version.
 /*! \ingroup PPL_CXX_interface */
@@ -469,7 +469,7 @@ site: http://bugseng.com/products/ppl/ . */
   releases and nonzero for development snapshots.
   \ingroup PPL_CXX_interface
 */
-#define PPL_VERSION_BETA 0
+#define PPL_VERSION_BETA 8
 
 //! A string containing the PPL version.
 /*! \ingroup PPL_CXX_interface
@@ -483,7 +483,7 @@ site: http://bugseng.com/products/ppl/ . */
   PPL_VERSION_BETA is zero, <CODE>M "." m "." r "pre" b</CODE> if
   neither PPL_VERSION_REVISION nor PPL_VERSION_BETA are zero.
 */
-#define PPL_VERSION "1.0"
+#define PPL_VERSION "1.1pre8"
 
 namespace Parma_Polyhedra_Library {
 
@@ -522,7 +522,7 @@ const char* banner();
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/namespaces.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/namespaces.hh line 1. */
 /* Documentation for used namespaces.
 */
 
@@ -547,7 +547,7 @@ namespace Parma_Polyhedra_Library {
   \code
     const Constraint_System& cs = ...;
     copy(cs.begin(), cs.end(),
-	 ostream_iterator<Constraint>(cout, "\n"));
+         ostream_iterator<Constraint>(cout, "\n"));
   \endcode
   the Parma_Polyhedra_Library namespace must be suitably extended.
   This can be done as follows:
@@ -684,7 +684,7 @@ namespace std {
 } // namespace std
 
 
-/* Automatically generated from PPL source file ../src/Interval_Info.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_Info_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -697,20 +697,20 @@ class Interval_Info_Bitset;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked_numeric_limits.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_numeric_limits.hh line 1. */
 /* Specializations of std::numeric_limits for "checked" types.
 */
 
 
-/* Automatically generated from PPL source file ../src/Checked_Number.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_defs.hh line 1. */
 /* Checked_Number class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Checked_Number.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_types.hh line 1. */
 
 
-/* Automatically generated from PPL source file ../src/Coefficient_traits_template.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_traits_template.hh line 1. */
 /* Coefficient_traits_template class declaration.
 */
 
@@ -727,7 +727,7 @@ struct Coefficient_traits_template {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Checked_Number.types.hh line 17. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_types.hh line 17. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -738,7 +738,7 @@ class Checked_Number;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_defs.hh line 1. */
 /* Abstract checked arithmetic function container.
 */
 
@@ -746,7 +746,7 @@ class Checked_Number;
 #include <cassert>
 #include <iostream>
 #include <gmpxx.h>
-/* Automatically generated from PPL source file ../src/mp_std_bits.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/mp_std_bits_defs.hh line 1. */
 /* Declarations of specializations of std:: objects for
    multi-precision types.
 */
@@ -765,6 +765,9 @@ void swap(mpz_class& x, mpz_class& y);
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 void swap(mpq_class& x, mpq_class& y);
 
+#if __GNU_MP_VERSION < 5 \
+  || (__GNU_MP_VERSION == 5 && __GNU_MP_VERSION_MINOR < 1)
+
 namespace std {
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -796,7 +799,7 @@ public:
   static const bool is_bounded = false;
   static const bool is_modulo = false;
   static const bool traps = false;
-  static const bool tininess_before = false;
+  static const bool tinyness_before = false;
   static const float_round_style round_style = round_toward_zero;
 
   static Type min() {
@@ -857,7 +860,7 @@ public:
   static const bool is_bounded = false;
   static const bool is_modulo = false;
   static const bool traps = false;
-  static const bool tininess_before = false;
+  static const bool tinyness_before = false;
   static const float_round_style round_style = round_toward_zero;
 
   static Type min() {
@@ -891,7 +894,10 @@ public:
 
 } // namespace std
 
-/* Automatically generated from PPL source file ../src/mp_std_bits.inlines.hh line 1. */
+#endif // __GNU_MP_VERSION < 5
+       // || (__GNU_MP_VERSION == 5 && __GNU_MP_VERSION_MINOR < 1)
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/mp_std_bits_inlines.hh line 1. */
 /* Definitions of specializations of std:: functions and methods for
    multi-precision types.
 */
@@ -907,14 +913,14 @@ swap(mpq_class& x, mpq_class& y) {
   mpq_swap(x.get_mpq_t(), y.get_mpq_t());
 }
 
-/* Automatically generated from PPL source file ../src/mp_std_bits.defs.hh line 168. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/mp_std_bits_defs.hh line 174. */
 
-/* Automatically generated from PPL source file ../src/Temp.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Temp_defs.hh line 1. */
 /* Temp_* classes declarations.
 */
 
 
-/* Automatically generated from PPL source file ../src/meta_programming.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/meta_programming.hh line 1. */
 /* Metaprogramming utilities.
 */
 
@@ -934,7 +940,7 @@ namespace Parma_Polyhedra_Library {
   mandated by Section 9.4.2/4 of the C++ standard).
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define const_bool_nodef(name, value)		\
+#define const_bool_nodef(name, value)           \
   enum const_bool_value_ ## name { PPL_U(name) = (value) }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -963,9 +969,9 @@ namespace Parma_Polyhedra_Library {
   mandated by Section 9.4.2/4 of the C++ standard).
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define const_value_nodef(type, name, value)	\
+#define const_value_nodef(type, name, value)    \
   static type PPL_U(name)() {                   \
-    return (value);				\
+    return (value);                             \
   }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -980,10 +986,10 @@ namespace Parma_Polyhedra_Library {
   mandated by Section 9.4.2/4 of the C++ standard).
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-#define const_ref_nodef(type, name, value)				\
+#define const_ref_nodef(type, name, value)                              \
   static const type& PPL_U(name)() {                                    \
     static type PPL_U(name) = (value);                                       \
-    return (name);							\
+    return (name);                                                      \
   }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -1011,10 +1017,10 @@ struct Compile_Time_Check<true> {
 };
 
 #define PPL_COMPILE_TIME_CHECK_NAME(suffix) compile_time_check_ ## suffix
-#define PPL_COMPILE_TIME_CHECK_AUX(e, suffix)				\
-  enum anonymous_enum_compile_time_check_ ## suffix {			\
+#define PPL_COMPILE_TIME_CHECK_AUX(e, suffix)                           \
+  enum anonymous_enum_compile_time_check_ ## suffix {                   \
     /* If e evaluates to false, then the sizeof cannot be compiled. */  \
-    PPL_COMPILE_TIME_CHECK_NAME(suffix)					\
+    PPL_COMPILE_TIME_CHECK_NAME(suffix)                                 \
       = sizeof(Parma_Polyhedra_Library::Compile_Time_Check<(e)>)        \
   }
 
@@ -1233,12 +1239,12 @@ template <> struct Is_Native<mpq_class> : public True { };
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Slow_Copy.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Slow_Copy.hh line 1. */
 /* Basic Slow_Copy classes declarations.
 */
 
 
-/* Automatically generated from PPL source file ../src/Slow_Copy.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Slow_Copy.hh line 28. */
 #include <gmpxx.h>
 
 namespace Parma_Polyhedra_Library {
@@ -1272,7 +1278,7 @@ struct Slow_Copy<mpq_class> : public True {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Temp.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Temp_defs.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -1384,12 +1390,12 @@ class Dirty_Temp<T, typename Enable_If<!Slow_Copy<T>::value>::type>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Temp.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Temp_inlines.hh line 1. */
 /* Temp_* classes implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Temp.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Temp_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -1409,7 +1415,7 @@ template <typename T>
 inline Temp_Item<T>&
 Temp_Item<T>::obtain() {
   if (free_list_head != 0) {
-    Temp_Item* p = free_list_head;
+    Temp_Item* const p = free_list_head;
     free_list_head = free_list_head->next;
     return *p;
   }
@@ -1455,11 +1461,11 @@ Temp_Value_Holder<T>::item() {
 
 } // namespace Parma_Polyhedra_Library
 
-#define PPL_DIRTY_TEMP(T, id)						\
+#define PPL_DIRTY_TEMP(T, id)                                           \
   Parma_Polyhedra_Library::Dirty_Temp<PPL_U(T)> holder_ ## id;          \
   PPL_U(T)& PPL_U(id) = holder_ ## id.item()
 
-/* Automatically generated from PPL source file ../src/Temp.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Temp_templates.hh line 1. */
 /* Temp_* classes implementation: non-inline template members.
 */
 
@@ -1471,14 +1477,14 @@ Temp_Item<T>* Temp_Item<T>::free_list_head = 0;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Temp.defs.hh line 142. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Temp_defs.hh line 142. */
 
-/* Automatically generated from PPL source file ../src/Rounding_Dir.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rounding_Dir_defs.hh line 1. */
 /* Declaration of Rounding_Dir and related functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Result.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Result_defs.hh line 1. */
 /* Result enum and supporting function declarations.
 */
 
@@ -1631,13 +1637,13 @@ Result operator|(Result x, Result y);
 /*! \ingroup PPL_CXX_interface */
 Result operator-(Result x, Result y);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Extracts the value class part of \p r (representable number,
   unrepresentable minus/plus infinity or nan).
 */
 Result_Class result_class(Result r);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Extracts the relation part of \p r.
 */
 Result_Relation result_relation(Result r);
@@ -1649,12 +1655,12 @@ Result result_relation_class(Result r);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Result.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Result_inlines.hh line 1. */
 /* Result supporting functions implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/assert.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/assert.hh line 1. */
 /* Implementation of PPL assert-like macros.
 */
 
@@ -1782,42 +1788,42 @@ bool copy_contains(T x_copy, T y_copy) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Result.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Result_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
 /*! \ingroup PPL_CXX_interface */
 inline Result
 operator&(Result x, Result y) {
-  unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
+  const unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
   return static_cast<Result>(res);
 }
 
 /*! \ingroup PPL_CXX_interface */
 inline Result
 operator|(Result x, Result y) {
-  unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
+  const unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
   return static_cast<Result>(res);
 }
 
 /*! \ingroup PPL_CXX_interface */
 inline Result
 operator-(Result x, Result y) {
-  Result y_neg = static_cast<Result>(~static_cast<unsigned>(y));
+  const Result y_neg = static_cast<Result>(~static_cast<unsigned>(y));
   return x & y_neg;
 }
 
 /*! \ingroup PPL_CXX_interface */
 inline Result_Class
 result_class(Result r) {
-  Result rc = r & static_cast<Result>(VC_MASK);
+  const Result rc = r & static_cast<Result>(VC_MASK);
   return static_cast<Result_Class>(rc);
 }
 
 /*! \ingroup PPL_CXX_interface */
 inline Result_Relation
 result_relation(Result r) {
-  Result rc = r & static_cast<Result>(VR_MASK);
+  const Result rc = r & static_cast<Result>(VR_MASK);
   return static_cast<Result_Relation>(rc);
 }
 
@@ -1857,14 +1863,14 @@ result_representable(Result r) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Result.defs.hh line 194. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Result_defs.hh line 194. */
 
-/* Automatically generated from PPL source file ../src/fpu.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_defs.hh line 1. */
 /* Floating point unit related functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/fpu.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_types.hh line 1. */
 
 
 #ifdef PPL_HAVE_IEEEFP_H
@@ -1878,7 +1884,7 @@ enum fpu_rounding_control_word_type {};
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/compiler.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/compiler.hh line 1. */
 /* C++ compiler related stuff.
 */
 
@@ -2080,7 +2086,7 @@ ctz(unsigned long long ull) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/fpu.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_defs.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -2138,7 +2144,7 @@ fpu_check_inexact();
 #if PPL_CAN_CONTROL_FPU
 
 #if defined(__i386__) && (defined(__GNUC__) || defined(__INTEL_COMPILER))
-/* Automatically generated from PPL source file ../src/fpu-ia32.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu-ia32_inlines.hh line 1. */
 /* IA-32 floating point unit inline related functions.
 */
 
@@ -2319,12 +2325,12 @@ fpu_check_inexact() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/fpu.defs.hh line 87. */
-#elif defined(PPL_HAVE_IEEEFP_H)					\
-  && (defined(__sparc)							\
-      || defined(sparc)							\
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_defs.hh line 87. */
+#elif defined(PPL_HAVE_IEEEFP_H)                                        \
+  && (defined(__sparc)                                                  \
+      || defined(sparc)                                                 \
       || defined(__sparc__))
-/* Automatically generated from PPL source file ../src/fpu-sparc.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu-sparc_inlines.hh line 1. */
 /* SPARC floating point unit related functions.
 */
 
@@ -2379,9 +2385,9 @@ fpu_check_inexact() {
 
 #endif // !defined(PPL_HAVE_IEEEFP_H)
 
-/* Automatically generated from PPL source file ../src/fpu.defs.hh line 92. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_defs.hh line 92. */
 #elif defined(PPL_HAVE_FENV_H)
-/* Automatically generated from PPL source file ../src/fpu-c99.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu-c99_inlines.hh line 1. */
 /* C99 Floating point unit related functions.
 */
 
@@ -2407,13 +2413,13 @@ namespace Parma_Polyhedra_Library {
 
 inline void
 fpu_initialize_control_functions() {
-  int old = fegetround();
+  const int old = fegetround();
   if (fesetround(PPL_FPU_DOWNWARD) != 0
       || fesetround(PPL_FPU_UPWARD) != 0
       || fesetround(old) != 0)
     throw std::logic_error("PPL configuration error:"
-			   " PPL_CAN_CONTROL_FPU evaluates to true,"
-			   " but fesetround() returns nonzero.");
+                           " PPL_CAN_CONTROL_FPU evaluates to true,"
+                           " but fesetround() returns nonzero.");
 }
 
 inline fpu_rounding_direction_type
@@ -2428,7 +2434,7 @@ fpu_set_rounding_direction(fpu_rounding_direction_type dir) {
 
 inline fpu_rounding_control_word_type
 fpu_save_rounding_direction(fpu_rounding_direction_type dir) {
-  fpu_rounding_control_word_type old
+  const fpu_rounding_control_word_type old
     = static_cast<fpu_rounding_control_word_type>(fegetround());
   fesetround(dir);
   return old;
@@ -2459,14 +2465,14 @@ fpu_check_inexact() {
 
 #endif // !defined(PPL_HAVE_FENV_H)
 
-/* Automatically generated from PPL source file ../src/fpu.defs.hh line 94. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_defs.hh line 94. */
 #else
 #error "PPL_CAN_CONTROL_FPU evaluates to true: why?"
 #endif
 
 #else // !PPL_CAN_CONTROL_FPU
 
-/* Automatically generated from PPL source file ../src/fpu-none.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu-none_inlines.hh line 1. */
 /* Null floating point unit related functions.
 */
 
@@ -2478,52 +2484,52 @@ namespace Parma_Polyhedra_Library {
 inline void
 fpu_initialize_control_functions() {
   throw std::logic_error("PPL::fpu_initialize_control_functions():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 inline fpu_rounding_direction_type
 fpu_get_rounding_direction() {
   throw std::logic_error("PPL::fpu_get_rounding_direction():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 inline void
 fpu_set_rounding_direction(int) {
   throw std::logic_error("PPL::fpu_set_rounding_direction():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 inline int
 fpu_save_rounding_direction(int) {
   throw std::logic_error("PPL::fpu_save_rounding_direction():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 inline void
 fpu_reset_inexact() {
   throw std::logic_error("PPL::fpu_reset_inexact():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 inline void
 fpu_restore_rounding_direction(int) {
   throw std::logic_error("PPL::fpu_restore_rounding_direction():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 inline int
 fpu_check_inexact() {
   throw std::logic_error("PPL::fpu_check_inexact():"
-			 " cannot control the FPU");
+                         " cannot control the FPU");
 }
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/fpu.defs.hh line 101. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/fpu_defs.hh line 101. */
 
 #endif // !PPL_CAN_CONTROL_FPU
 
-/* Automatically generated from PPL source file ../src/Rounding_Dir.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rounding_Dir_defs.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -2576,7 +2582,7 @@ Rounding_Dir operator&(Rounding_Dir x, Rounding_Dir y);
 /*! \ingroup PPL_CXX_interface */
 Rounding_Dir operator|(Rounding_Dir x, Rounding_Dir y);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Returns the inverse rounding mode of \p dir,
   <CODE>ROUND_IGNORE</CODE> being the inverse of itself.
 */
@@ -2616,26 +2622,26 @@ fpu_rounding_direction_type round_fpu_dir(Rounding_Dir dir);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Rounding_Dir.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rounding_Dir_inlines.hh line 1. */
 /* Inline functions operating on enum Rounding_Dir values.
 */
 
 
-/* Automatically generated from PPL source file ../src/Rounding_Dir.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rounding_Dir_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
 /*! \ingroup PPL_CXX_interface */
 inline Rounding_Dir
 operator&(Rounding_Dir x, Rounding_Dir y) {
-  unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
+  const unsigned res = static_cast<unsigned>(x) & static_cast<unsigned>(y);
   return static_cast<Rounding_Dir>(res);
 }
 
 /*! \ingroup PPL_CXX_interface */
 inline Rounding_Dir
 operator|(Rounding_Dir x, Rounding_Dir y) {
-  unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
+  const unsigned res = static_cast<unsigned>(x) | static_cast<unsigned>(y);
   return static_cast<Rounding_Dir>(res);
 }
 
@@ -2735,15 +2741,15 @@ inverse(Rounding_Dir dir) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Rounding_Dir.defs.hh line 122. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rounding_Dir_defs.hh line 122. */
 
 
-/* Automatically generated from PPL source file ../src/Numeric_Format.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Numeric_Format_defs.hh line 1. */
 /* Numeric format.
 */
 
 
-/* Automatically generated from PPL source file ../src/Numeric_Format.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Numeric_Format_defs.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -2753,12 +2759,12 @@ class Numeric_Format {
 } // namespace Parma_Polyhedra_Library
 
 
-/* Automatically generated from PPL source file ../src/Float.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_defs.hh line 1. */
 /* IEC 559 floating point format related functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/globals.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_types.hh line 1. */
 
 
 #include <cstddef>
@@ -2820,7 +2826,7 @@ enum Optimization_Mode {
   MAXIMIZATION
 };
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Widths of bounded integer types.
 
   See the section on
@@ -2843,7 +2849,7 @@ enum Bounded_Integer_Type_Width {
   BITS_128 = 128
 };
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Representation of bounded integer types.
 
   See the section on
@@ -2860,7 +2866,7 @@ enum Bounded_Integer_Type_Representation {
   SIGNED_2_COMPLEMENT
 };
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Overflow behavior of bounded integer types.
 
   See the section on
@@ -2901,7 +2907,7 @@ enum Bounded_Integer_Type_Overflow {
   OVERFLOW_IMPOSSIBLE
 };
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Possible representations of coefficient sequences (i.e. linear expressions
   and more complex objects containing linear expressions, e.g. Constraints,
   Generators, etc.).
@@ -2925,11 +2931,11 @@ enum Representation {
   SPARSE
 };
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Floating point formats known to the library.
 
   The parameters of each format are defined by a specific struct
-  in file Float.defs.hh.  See the section on \ref floating_point
+  in file Float_defs.hh.  See the section on \ref floating_point
   "Analysis of floating point computations" for more information.
 */
 enum Floating_Point_Format {
@@ -2959,7 +2965,7 @@ struct Weightwatch_Traits;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Concrete_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Concrete_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -2970,44 +2976,44 @@ namespace Parma_Polyhedra_Library {
   This justifies (here below) the explicit use of Doxygen command \class.
 */
 
-/*! \brief \class Parma_Polyhedra_Library::Concrete_Expression
-  The base class of all concrete expressions.
+/*! \brief The base class of all concrete expressions.
+  \class Parma_Polyhedra_Library::Concrete_Expression
 */
 template <typename Target>
 class Concrete_Expression;
 
-/*! \brief \class Parma_Polyhedra_Library::Binary_Operator
-  A binary operator applied to two concrete expressions.
+/*! \brief A binary operator applied to two concrete expressions.
+  \class Parma_Polyhedra_Library::Binary_Operator
 */
 template <typename Target>
 class Binary_Operator;
 
-/*! \brief \class Parma_Polyhedra_Library::Unary_Operator
-  A unary operator applied to one concrete expression.
+/*! \brief A unary operator applied to one concrete expression.
+  \class Parma_Polyhedra_Library::Unary_Operator
 */
 template <typename Target>
 class Unary_Operator;
 
-/*! \brief \class Parma_Polyhedra_Library::Cast_Operator
-  A cast operator converting one concrete expression to some type.
+/*! \brief A cast operator converting one concrete expression to some type.
+  \class Parma_Polyhedra_Library::Cast_Operator
 */
 template <typename Target>
 class Cast_Operator;
 
-/*! \brief \class Parma_Polyhedra_Library::Integer_Constant
-  An integer constant concrete expression.
+/*! \brief An integer constant concrete expression.
+  \class Parma_Polyhedra_Library::Integer_Constant
 */
 template <typename Target>
 class Integer_Constant;
 
-/*! \brief \class Parma_Polyhedra_Library::Floating_Point_Constant
-  A floating-point constant concrete expression.
+/*! \brief A floating-point constant concrete expression.
+  \class Parma_Polyhedra_Library::Floating_Point_Constant
 */
 template <typename Target>
 class Floating_Point_Constant;
 
-/*! \brief \class Parma_Polyhedra_Library::Approximable_Reference
-  A concrete expression representing a reference to some approximable.
+/*! \brief A concrete expression representing a reference to some approximable.
+  \class Parma_Polyhedra_Library::Approximable_Reference
 */
 template <typename Target>
 class Approximable_Reference;
@@ -3022,7 +3028,7 @@ class Concrete_Expression_Type;
   Cast_Operator, Integer_Constant, Floating_Point_Constant, or
   Approximable_Reference.  For example, the Binary_Operator kind
   integer constant should be defined by an instance as the member
-  <CODE>Binary_Operator<T>::KIND</CODE>
+  <CODE>Binary_Operator\<T\>::%KIND</CODE>.
 */
 typedef int Concrete_Expression_Kind;
 
@@ -3044,7 +3050,7 @@ typedef int Concrete_Expression_UOP;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variable.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -3053,7 +3059,7 @@ class Variable;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Form.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -3063,7 +3069,7 @@ class Linear_Form;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Float.defs.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_defs.hh line 34. */
 #include <set>
 #include <cmath>
 #include <map>
@@ -3084,8 +3090,9 @@ struct float_ieee754_half {
   uint16_t word;
   static const uint16_t SGN_MASK = 0x8000U;
   static const uint16_t EXP_MASK = 0xfc00U;
-  static const uint16_t POS_INF = 0xfc00U;
-  static const uint16_t NEG_INF = 0x7c00U;
+  static const uint16_t WRD_MAX = 0x7bffU;
+  static const uint16_t POS_INF = 0x7c00U;
+  static const uint16_t NEG_INF = 0xfc00U;
   static const uint16_t POS_ZERO = 0x0000U;
   static const uint16_t NEG_ZERO = 0x8000U;
   static const unsigned int BASE = 2;
@@ -3095,7 +3102,7 @@ struct float_ieee754_half {
   static const int EXPONENT_BIAS = EXPONENT_MAX;
   static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
   static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
+                                        - static_cast<int>(MANTISSA_BITS);
   static const Floating_Point_Format floating_point_format = IEEE754_HALF;
   int inf_sign() const;
   bool is_nan() const;
@@ -3116,6 +3123,7 @@ struct float_ieee754_single {
   uint32_t word;
   static const uint32_t SGN_MASK = 0x80000000U;
   static const uint32_t EXP_MASK = 0x7f800000U;
+  static const uint32_t WRD_MAX = 0x7f7fffffU;
   static const uint32_t POS_INF = 0x7f800000U;
   static const uint32_t NEG_INF = 0xff800000U;
   static const uint32_t POS_ZERO = 0x00000000U;
@@ -3127,7 +3135,7 @@ struct float_ieee754_single {
   static const int EXPONENT_BIAS = EXPONENT_MAX;
   static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
   static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
+                                        - static_cast<int>(MANTISSA_BITS);
   static const Floating_Point_Format floating_point_format = IEEE754_SINGLE;
   int inf_sign() const;
   bool is_nan() const;
@@ -3164,6 +3172,7 @@ struct float_ieee754_double {
   static const uint32_t MSP_NEG_ZERO = 0x80000000U;
   static const uint32_t LSP_INF = 0;
   static const uint32_t LSP_ZERO = 0;
+  static const uint32_t MSP_MAX = 0x7fefffffU;
   static const uint32_t LSP_MAX = 0xffffffffU;
   static const unsigned int BASE = 2;
   static const unsigned int EXPONENT_BITS = 11;
@@ -3172,7 +3181,7 @@ struct float_ieee754_double {
   static const int EXPONENT_BIAS = EXPONENT_MAX;
   static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
   static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
+                                        - static_cast<int>(MANTISSA_BITS);
   static const Floating_Point_Format floating_point_format = IEEE754_DOUBLE;
   int inf_sign() const;
   bool is_nan() const;
@@ -3192,6 +3201,7 @@ struct float_ibm_single {
   uint32_t word;
   static const uint32_t SGN_MASK = 0x80000000U;
   static const uint32_t EXP_MASK = 0x7f000000U;
+  static const uint32_t WRD_MAX = 0x7fffffffU;
   static const uint32_t POS_INF = 0x7f000000U;
   static const uint32_t NEG_INF = 0xff000000U;
   static const uint32_t POS_ZERO = 0x00000000U;
@@ -3203,7 +3213,7 @@ struct float_ibm_single {
   static const int EXPONENT_MAX = (1 << (EXPONENT_BITS - 1)) - 1;
   static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
   static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
+                                        - static_cast<int>(MANTISSA_BITS);
   static const Floating_Point_Format floating_point_format = IBM_SINGLE;
   int inf_sign() const;
   bool is_nan() const;
@@ -3244,6 +3254,7 @@ struct float_intel_double_extended {
   static const uint32_t MSP_NEG_ZERO = 0x00008000U;
   static const uint64_t LSP_INF = static_cast<uint64_t>(0x8000000000000000ULL);
   static const uint64_t LSP_ZERO = 0;
+  static const uint32_t MSP_MAX = 0x00007ffeU;
   static const uint64_t LSP_DMAX = static_cast<uint64_t>(0x7fffffffffffffffULL);
   static const uint64_t LSP_NMAX = static_cast<uint64_t>(0xffffffffffffffffULL);
   static const unsigned int BASE = 2;
@@ -3253,7 +3264,7 @@ struct float_intel_double_extended {
   static const int EXPONENT_BIAS = EXPONENT_MAX;
   static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
   static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
+                                        - static_cast<int>(MANTISSA_BITS);
   static const Floating_Point_Format floating_point_format =
                                      INTEL_DOUBLE_EXTENDED;
   int inf_sign() const;
@@ -3285,6 +3296,7 @@ struct float_ieee754_quad {
   static const uint64_t MSP_NEG_ZERO = static_cast<uint64_t>(0x8000000000000000ULL);
   static const uint64_t LSP_INF = 0;
   static const uint64_t LSP_ZERO = 0;
+  static const uint64_t MSP_MAX = static_cast<uint64_t>(0x7ffeffffffffffffULL);
   static const uint64_t LSP_MAX = static_cast<uint64_t>(0xffffffffffffffffULL);
   static const unsigned int BASE = 2;
   static const unsigned int EXPONENT_BITS = 15;
@@ -3293,7 +3305,8 @@ struct float_ieee754_quad {
   static const int EXPONENT_BIAS = EXPONENT_MAX;
   static const int EXPONENT_MIN = -EXPONENT_MAX + 1;
   static const int EXPONENT_MIN_DENORM = EXPONENT_MIN
-					- static_cast<int>(MANTISSA_BITS);
+                                        - static_cast<int>(MANTISSA_BITS);
+  static const Floating_Point_Format floating_point_format = IEEE754_QUAD;
   int inf_sign() const;
   bool is_nan() const;
   int zero_sign() const;
@@ -3475,7 +3488,7 @@ public:
     The resulting set MUST NOT contain <CODE>not_a_dimension()</CODE>.
   */
   virtual bool get_associated_dimensions(
-	  const Approximable_Reference<Target>& expr,
+          const Approximable_Reference<Target>& expr,
           std::set<dimension_type>& result) const = 0;
 
 };
@@ -3543,18 +3556,18 @@ upper_bound_assign(std::map<dimension_type,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Float.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_inlines.hh line 1. */
 /* IEC 559 floating point format related functions.
 */
 
 
 #include <climits>
-/* Automatically generated from PPL source file ../src/Variable.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_defs.hh line 1. */
 /* Variable class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Init.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Init_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -3563,7 +3576,7 @@ class Init;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variable.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_defs.hh line 30. */
 #include <iosfwd>
 #include <set>
 
@@ -3654,6 +3667,9 @@ public:
   //! Type of output functions.
   typedef void output_function_type(std::ostream& s, const Variable v);
 
+  //! The default output function.
+  static void default_output_function(std::ostream& s, const Variable v);
+
   //! Sets the output function to be used for printing Variable objects.
   static void set_output_function(output_function_type* p);
 
@@ -3679,31 +3695,29 @@ private:
 
   friend std::ostream&
   Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream& s,
-						    const Variable v);
+                                                    const Variable v);
 
   //! Pointer to the current output function.
   static output_function_type* current_output_function;
 
-  //! The default output function.
-  static void default_output_function(std::ostream& s, const Variable v);
 };
 
-/* Automatically generated from PPL source file ../src/Variable.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_inlines.hh line 1. */
 /* Variable class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/globals.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_defs.hh line 1. */
 /* Declarations of global objects.
 */
 
 
-/* Automatically generated from PPL source file ../src/C_Integer.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Integer.hh line 1. */
 /* C integers info.
 */
 
 
-/* Automatically generated from PPL source file ../src/C_Integer.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Integer.hh line 28. */
 #include <climits>
 
 // C99 defines LLONG_MIN, LLONG_MAX and ULLONG_MAX, but this part of
@@ -3763,29 +3777,35 @@ struct C_Integer<char> : public True {
 
 template <>
 struct C_Integer<signed char> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef void smaller_type;
   typedef void smaller_signed_type;
   typedef void smaller_unsigned_type;
   typedef unsigned char other_type;
-  static const signed char min = SCHAR_MIN;
-  static const signed char max = SCHAR_MAX;
+  static const signed char min = static_cast<signed char>(SCHAR_MIN);
+  static const signed char max = static_cast<signed char>(SCHAR_MAX);
 };
 
 template <>
 struct C_Integer<signed short> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed char smaller_type;
   typedef signed char smaller_signed_type;
   typedef unsigned char smaller_unsigned_type;
   typedef unsigned short other_type;
-  static const signed short min = SHRT_MIN;
-  static const signed short max = SHRT_MAX;
+  static const signed short min = static_cast<signed short>(SHRT_MIN);
+  static const signed short max = static_cast<signed short>(SHRT_MAX);
 };
 
 template <>
 struct C_Integer<signed int> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed short smaller_type;
   typedef signed short smaller_signed_type;
   typedef unsigned short smaller_unsigned_type;
@@ -3796,7 +3816,9 @@ struct C_Integer<signed int> : public True {
 
 template <>
 struct C_Integer<signed long> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed int smaller_type;
   typedef signed int smaller_signed_type;
   typedef unsigned int smaller_unsigned_type;
@@ -3807,7 +3829,9 @@ struct C_Integer<signed long> : public True {
 
 template <>
 struct C_Integer<signed long long> : public True {
-  enum const_bool_value { is_signed = true };
+  enum const_bool_value {
+    is_signed = true
+  };
   typedef signed long smaller_type;
   typedef signed long smaller_signed_type;
   typedef unsigned long smaller_unsigned_type;
@@ -3818,65 +3842,272 @@ struct C_Integer<signed long long> : public True {
 
 template <>
 struct C_Integer<unsigned char> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef void smaller_type;
   typedef void smaller_signed_type;
   typedef void smaller_unsigned_type;
   typedef signed char other_type;
-  static const unsigned char min = 0U;
-  static const unsigned char max = static_cast<unsigned char>(~0U);
+  static const unsigned char min = static_cast<unsigned char>(0U);
+  static const unsigned char max = static_cast<unsigned char>(UCHAR_MAX);
 };
 
 template <>
 struct C_Integer<unsigned short> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned char smaller_type;
   typedef signed char smaller_signed_type;
   typedef unsigned char smaller_unsigned_type;
   typedef signed short other_type;
-  static const unsigned short min = 0U;
-  static const unsigned short max = static_cast<unsigned short>(~0U);
+  static const unsigned short min = static_cast<unsigned short>(0U);
+  static const unsigned short max = static_cast<unsigned short>(USHRT_MAX);
 };
 
 template <>
 struct C_Integer<unsigned int> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned short smaller_type;
   typedef signed short smaller_signed_type;
   typedef unsigned short smaller_unsigned_type;
   typedef signed int other_type;
   static const unsigned int min = 0U;
-  static const unsigned int max = ~0U;
+  static const unsigned int max = UINT_MAX;
 };
 
 template <>
 struct C_Integer<unsigned long> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned int smaller_type;
   typedef signed int smaller_signed_type;
   typedef unsigned int smaller_unsigned_type;
   typedef signed long other_type;
   static const unsigned long min = 0UL;
-  static const unsigned long max = ~0UL;
+  static const unsigned long max = ULONG_MAX;
 };
 
 template <>
 struct C_Integer<unsigned long long> : public True {
-  enum const_bool_value { is_signed = false };
+  enum const_bool_value {
+    is_signed = false
+  };
   typedef unsigned long smaller_type;
   typedef signed long smaller_signed_type;
   typedef unsigned long smaller_unsigned_type;
   typedef signed long long other_type;
   static const unsigned long long min = 0ULL;
-  static const unsigned long long max = ~0ULL;
+  static const unsigned long long max = ULLONG_MAX;
 };
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/globals.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_defs.hh line 32. */
 #include <exception>
 #include <gmpxx.h>
 
+#ifndef PPL_PROFILE_ADD_WEIGHT
+#define PPL_PROFILE_ADD_WEIGHT 0
+#endif
+
+#if defined(NDEBUG) && PPL_PROFILE_ADD_WEIGHT
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Weight_Profiler_defs.hh line 1. */
+/* Weight_Profiler class declaration.
+*/
+
+#ifndef Weight_Profiler_defs_hh
+#define Weight_Profiler_defs_hh 1
+
+#include <cassert>
+
+namespace Parma_Polyhedra_Library {
+
+class Weight_Profiler {
+private:
+  enum { DISCARDED = 0, VALID = 1 };
+
+public:
+  Weight_Profiler(const char* file, int line,
+                  Weightwatch_Traits::Delta delta,
+                  double min_threshold = 0, double max_threshold = 0)
+    : file(file), line(line), delta(delta),
+      min_threshold(min_threshold), max_threshold(max_threshold) {
+    for (int i = 0; i < 2; ++i) {
+      stat[i].samples = 0;
+      stat[i].count = 0;
+      stat[i].sum = 0;
+      stat[i].squares_sum = 0;
+      stat[i].min = 0;
+      stat[i].max = 0;
+    }
+  }
+
+  ~Weight_Profiler() {
+    output_stats();
+  }
+
+  void output_stats();
+
+  static void begin() {
+#ifndef NDEBUG
+    int r = clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
+    assert(r >= 0);
+#else
+    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
+#endif
+  }
+
+  void end(unsigned int factor = 1) {
+    Weightwatch_Traits::weight
+      += (Weightwatch_Traits::Threshold) delta * factor;
+    struct timespec start = stamp;
+    begin();
+    double elapsed;
+    if (stamp.tv_nsec >= start.tv_nsec) {
+      elapsed = (stamp.tv_nsec - start.tv_nsec)
+        + (stamp.tv_sec - start.tv_sec) * 1e9;
+    }
+    else {
+      elapsed = (1000000000 - start.tv_nsec + stamp.tv_nsec )
+        + (stamp.tv_sec - start.tv_sec - 1) * 1e9;
+    }
+    elapsed -= adjustment;
+    double elapsed1 = elapsed / factor;
+    int i = (elapsed1 < min_threshold
+             || (max_threshold > 0 && elapsed1 > max_threshold))
+      ? DISCARDED
+      : VALID;
+    ++stat[i].samples;
+    if (stat[i].count == 0)
+      stat[i].min = stat[i].max = elapsed1;
+    else if (stat[i].min > elapsed1)
+      stat[i].min = elapsed1;
+    else if (stat[i].max < elapsed1)
+      stat[i].max = elapsed1;
+    stat[i].sum += elapsed;
+    stat[i].squares_sum += elapsed * elapsed1;
+    stat[i].count += factor;
+  }
+
+  static double tune_adjustment();
+
+ private:
+  //! File of this profiling point.
+  const char *file;
+
+  //! Line of this profiling point.
+  int line;
+
+  //! Computational weight to be added at each iteration.
+  Weightwatch_Traits::Delta delta;
+
+  //! Times less than this value are discarded.
+  double min_threshold;
+
+  //! Times greater than this value are discarded.
+  double max_threshold;
+
+  //! Statistical data for samples (both DISCARDED and VALID)
+  struct {
+    //! Number of collected samples.
+    unsigned int samples;
+
+    /*! \brief
+      Number of collected iterations.
+
+      \note
+      Multiple iterations are possibly collected for each sample.
+    */
+    unsigned int count;
+
+    //! Sum of the measured times.
+    double sum;
+
+    //! Sum of the squares of the measured times (to compute variance).
+    double squares_sum;
+
+    //! Minimum measured time.
+    double min;
+
+    //! Maximum measured time.
+    double max;
+  } stat[2];
+
+  //! Holds the time corresponding to last time begin() was called.
+  static struct timespec stamp;
+
+  /*! \brief
+    Time quantity used to adjust the elapsed times so as not to take
+    into account the time spent by the measurement infrastructure.
+  */
+  static double adjustment;
+};
+
+}
+
+#endif // Weight_Profiler_defs_hh
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_defs.hh line 41. */
+#endif
+
+#if defined(NDEBUG)
+
+#if PPL_PROFILE_ADD_WEIGHT
+
+#define WEIGHT_BEGIN() Weight_Profiler::begin()
+
+#define WEIGHT_ADD(delta)                                     \
+  do {                                                        \
+    static Weight_Profiler wp__(__FILE__, __LINE__, delta);   \
+    wp__.end();                                               \
+  } while (false)
+
+#define WEIGHT_ADD_MUL(delta, factor)                                   \
+  do {                                                                  \
+    static Weight_Profiler wp__(__FILE__, __LINE__, delta);             \
+    wp__.end(factor);                                                   \
+  } while (false)
+
+#else // !PPL_PROFILE_ADD_WEIGHT
+
+#define WEIGHT_BEGIN()                          \
+  do {                                          \
+  } while (false)
+
+#define WEIGHT_ADD(delta)                       \
+  do {                                          \
+    Weightwatch_Traits::weight += (delta);      \
+  } while (false)
+
+#define WEIGHT_ADD_MUL(delta, factor)                   \
+  do {                                                  \
+    Weightwatch_Traits::weight += (delta)*(factor);     \
+  } while (false)
+
+#endif // !PPL_PROFILE_ADD_WEIGHT
+
+#else // !defined(NDEBUG)
+
+#define WEIGHT_BEGIN()
+
+#define WEIGHT_ADD(delta)                       \
+  do {                                          \
+    if (!In_Assert::asserting())                \
+      Weightwatch_Traits::weight += delta;      \
+  } while (false)
+
+#define WEIGHT_ADD_MUL(delta, factor)                   \
+  do {                                                  \
+    if (!In_Assert::asserting())                        \
+      Weightwatch_Traits::weight += delta * factor;     \
+  } while (false)
+
+#endif // !defined(NDEBUG)
+
 
 namespace Parma_Polyhedra_Library {
 
@@ -4080,100 +4311,100 @@ struct Recycle_Input {
   void ascii_dump() const;                                              \
   /*! \brief Writes to \p s an ASCII representation of \p *this. */     \
   void ascii_dump(std::ostream& s) const;                               \
-  /*! \brief Prints \p *this to \c std::cerr using \c operator<<. */	\
+  /*! \brief Prints \p *this to \c std::cerr using \c operator<<. */    \
   void print() const;
 
-#define PPL_OUTPUT_DEFINITIONS(class_name)			\
-  void								\
-  Parma_Polyhedra_Library::class_name::ascii_dump() const {	\
-    ascii_dump(std::cerr);					\
-  }								\
-								\
-  void								\
-  Parma_Polyhedra_Library::class_name::print() const {		\
-    using IO_Operators::operator<<;				\
-    std::cerr << *this;						\
-  }
-
-#define PPL_OUTPUT_DEFINITIONS_ASCII_ONLY(class_name)			\
-  void									\
-  Parma_Polyhedra_Library::class_name::ascii_dump() const {		\
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  void									\
-  Parma_Polyhedra_Library::class_name::print() const {			\
-    std::cerr << "No user level output operator defined "		\
-	      << "for class " PPL_XSTR(class_name) << "." << std::endl; \
-  }
-
-#define PPL_OUTPUT_TEMPLATE_DEFINITIONS(type_symbol, class_prefix)	\
-  template <typename type_symbol>					\
-  void									\
+#define PPL_OUTPUT_DEFINITIONS(class_name)                      \
+  void                                                          \
+  Parma_Polyhedra_Library::class_name::ascii_dump() const {     \
+    ascii_dump(std::cerr);                                      \
+  }                                                             \
+                                                                \
+  void                                                          \
+  Parma_Polyhedra_Library::class_name::print() const {          \
+    using IO_Operators::operator<<;                             \
+    std::cerr << *this;                                         \
+  }
+
+#define PPL_OUTPUT_DEFINITIONS_ASCII_ONLY(class_name)                   \
+  void                                                                  \
+  Parma_Polyhedra_Library::class_name::ascii_dump() const {             \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  void                                                                  \
+  Parma_Polyhedra_Library::class_name::print() const {                  \
+    std::cerr << "No user level output operator defined "               \
+              << "for class " PPL_XSTR(class_name) << "." << std::endl; \
+  }
+
+#define PPL_OUTPUT_TEMPLATE_DEFINITIONS(type_symbol, class_prefix)      \
+  template <typename type_symbol>                                       \
+  void                                                                  \
   class_prefix::ascii_dump() const {                             \
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  template <typename type_symbol>					\
-  void									\
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  template <typename type_symbol>                                       \
+  void                                                                  \
   class_prefix::print() const {                                  \
-    using IO_Operators::operator<<;					\
-    std::cerr << *this;							\
+    using IO_Operators::operator<<;                                     \
+    std::cerr << *this;                                                 \
   }
 
-#define PPL_OUTPUT_2_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,		\
-						type_symbol2,		\
-						class_prefix)		\
-  template <typename type_symbol1, typename type_symbol2>		\
-  void									\
+#define PPL_OUTPUT_2_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,           \
+                                                type_symbol2,           \
+                                                class_prefix)           \
+  template <typename type_symbol1, typename type_symbol2>               \
+  void                                                                  \
   PPL_U(class_prefix)<PPL_U(type_symbol1), PPL_U(type_symbol2)>         \
   ::ascii_dump() const {                                                \
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  template <typename type_symbol1, typename type_symbol2>		\
-  void									\
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  template <typename type_symbol1, typename type_symbol2>               \
+  void                                                                  \
   PPL_U(class_prefix)<PPL_U(type_symbol1), PPL_U(type_symbol2)>         \
   ::print() const {                                                     \
-    using IO_Operators::operator<<;					\
-    std::cerr << *this;							\
+    using IO_Operators::operator<<;                                     \
+    std::cerr << *this;                                                 \
   }
 
-#define PPL_OUTPUT_3_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,		\
-						type_symbol2,		\
-						type_symbol3,		\
-						class_prefix)		\
-  template <typename type_symbol1, typename type_symbol2,		\
-            typename type_symbol3>					\
-  void									\
+#define PPL_OUTPUT_3_PARAM_TEMPLATE_DEFINITIONS(type_symbol1,           \
+                                                type_symbol2,           \
+                                                type_symbol3,           \
+                                                class_prefix)           \
+  template <typename type_symbol1, typename type_symbol2,               \
+            typename type_symbol3>                                      \
+  void                                                                  \
   PPL_U(class_prefix)<PPL_U(type_symbol1), type_symbol2,                \
                       PPL_U(type_symbol3)>::ascii_dump()                \
-    const {								\
-    ascii_dump(std::cerr);						\
-  }									\
-                                                                     	\
-    template <typename type_symbol1, typename type_symbol2,		\
-              typename type_symbol3>					\
-    void								\
+    const {                                                             \
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+    template <typename type_symbol1, typename type_symbol2,             \
+              typename type_symbol3>                                    \
+    void                                                                \
     PPL_U(class_prefix)<PPL_U(type_symbol1), type_symbol2,              \
                         PPL_U(type_symbol3)>::print()                   \
-      const {								\
-      using IO_Operators::operator<<;					\
-      std::cerr << *this;						\
+      const {                                                           \
+      using IO_Operators::operator<<;                                   \
+      std::cerr << *this;                                               \
     }
 
 #define PPL_OUTPUT_TEMPLATE_DEFINITIONS_ASCII_ONLY(type_symbol, class_prefix) \
-  template <typename type_symbol>					\
-  void									\
+  template <typename type_symbol>                                       \
+  void                                                                  \
   class_prefix::ascii_dump() const {                                    \
-    ascii_dump(std::cerr);						\
-  }									\
-									\
-  template <typename type_symbol>					\
-  void									\
+    ascii_dump(std::cerr);                                              \
+  }                                                                     \
+                                                                        \
+  template <typename type_symbol>                                       \
+  void                                                                  \
   class_prefix::print() const {                                         \
-    std::cerr << "No user level output operator defined "		\
-	      << "for " PPL_XSTR(class_prefix) << "." << std::endl;	\
+    std::cerr << "No user level output operator defined "               \
+              << "for " PPL_XSTR(class_prefix) << "." << std::endl;     \
   }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -4203,22 +4434,22 @@ template <typename T, T v>
 const T TConstant<T, v>::value;
 
 template <typename T, long long v, bool prefer_signed = true,
-	  typename Enable = void>
+          typename Enable = void>
 struct Constant_ : public TConstant<T, v> {
 };
 
 template <typename T, long long v, bool prefer_signed>
 struct Constant_<T, v, prefer_signed,
-		 typename Enable_If<(Fit<typename C_Integer<T>::smaller_signed_type, v>::value
-				     && (prefer_signed
+                 typename Enable_If<(Fit<typename C_Integer<T>::smaller_signed_type, v>::value
+                                     && (prefer_signed
                                          || !Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value))>::type>
   : public Constant_<typename C_Integer<T>::smaller_signed_type, v, prefer_signed> {
 };
 
 template <typename T, long long v, bool prefer_signed>
 struct Constant_<T, v, prefer_signed,
-		 typename Enable_If<(Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value
-				     && (!prefer_signed
+                 typename Enable_If<(Fit<typename C_Integer<T>::smaller_unsigned_type, v>::value
+                                     && (!prefer_signed
                                          || !Fit<typename C_Integer<T>::smaller_signed_type, v>::value))>::type>
   : public Constant_<typename C_Integer<T>::smaller_unsigned_type, v, prefer_signed> {
 };
@@ -4342,195 +4573,12 @@ least_significant_one_mask(dimension_type i);
 #define PPL_USE_SPARSE_MATRIX 1
 #endif
 
-#ifndef PPL_PROFILE_ADD_WEIGHT
-#define PPL_PROFILE_ADD_WEIGHT 0
-#endif
-
-#if defined(NDEBUG) && PPL_PROFILE_ADD_WEIGHT
-/* Automatically generated from PPL source file ../src/Weight_Profiler.defs.hh line 1. */
-/* Weight_Profiler class declaration.
-*/
-
-#ifndef Weight_Profiler_defs_hh
-#define Weight_Profiler_defs_hh 1
-
-#include <cassert>
-
-namespace Parma_Polyhedra_Library {
-
-class Weight_Profiler {
-private:
-  enum { DISCARDED = 0, VALID = 1 };
-
-public:
-  Weight_Profiler(const char* file, int line,
-		  Weightwatch_Traits::Delta delta,
-		  double min_threshold = 0, double max_threshold = 0)
-    : file(file), line(line), delta(delta),
-      min_threshold(min_threshold), max_threshold(max_threshold) {
-    for (int i = 0; i < 2; ++i) {
-      stat[i].samples = 0;
-      stat[i].count = 0;
-      stat[i].sum = 0;
-      stat[i].squares_sum = 0;
-      stat[i].min = 0;
-      stat[i].max = 0;
-    }
-  }
-
-  ~Weight_Profiler() {
-    output_stats();
-  }
-
-  void output_stats();
-
-  static void begin() {
-#ifndef NDEBUG
-    int r = clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
-    assert(r >= 0);
-#else
-    clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stamp);
-#endif
-  }
-
-  void end(unsigned int factor = 1) {
-    Weightwatch_Traits::weight
-      += (Weightwatch_Traits::Threshold) delta * factor;
-    struct timespec start = stamp;
-    begin();
-    double elapsed;
-    if (stamp.tv_nsec >= start.tv_nsec) {
-      elapsed = (stamp.tv_nsec - start.tv_nsec)
-	+ (stamp.tv_sec - start.tv_sec) * 1e9;
-    }
-    else {
-      elapsed = (1000000000 - start.tv_nsec + stamp.tv_nsec )
-	+ (stamp.tv_sec - start.tv_sec - 1) * 1e9;
-    }
-    elapsed -= adjustment;
-    double elapsed1 = elapsed / factor;
-    int i = (elapsed1 < min_threshold
-             || (max_threshold > 0 && elapsed1 > max_threshold))
-      ? DISCARDED
-      : VALID;
-    ++stat[i].samples;
-    if (stat[i].count == 0)
-      stat[i].min = stat[i].max = elapsed1;
-    else if (stat[i].min > elapsed1)
-      stat[i].min = elapsed1;
-    else if (stat[i].max < elapsed1)
-      stat[i].max = elapsed1;
-    stat[i].sum += elapsed;
-    stat[i].squares_sum += elapsed * elapsed1;
-    stat[i].count += factor;
-  }
-
-  static double tune_adjustment();
-
- private:
-  //! File of this profiling point.
-  const char *file;
-
-  //! Line of this profiling point.
-  int line;
-
-  //! Computational weight to be added at each iteration.
-  Weightwatch_Traits::Delta delta;
-
-  //! Times less than this value are discarded.
-  double min_threshold;
-
-  //! Times greater than this value are discarded.
-  double max_threshold;
-
-  //! Statistical data for samples (both DISCARDED and VALID)
-  struct {
-    //! Number of collected samples.
-    unsigned int samples;
-
-    /*! \brief
-      Number of collected iterations.
-
-      \note
-      Multiple iterations are possibly collected for each sample.
-    */
-    unsigned int count;
-
-    //! Sum of the measured times.
-    double sum;
-
-    //! Sum of the squares of the measured times (to compute variance).
-    double squares_sum;
-
-    //! Minimum measured time.
-    double min;
-
-    //! Maximum measured time.
-    double max;
-  } stat[2];
-
-  //! Holds the time corresponding to last time begin() was called.
-  static struct timespec stamp;
-
-  /*! \brief
-    Time quantity used to adjust the elapsed times so as not to take
-    into account the time spent by the measurement infrastructure.
-  */
-  static double adjustment;
-};
-
-}
-
-#endif // Weight_Profiler_defs_hh
-/* Automatically generated from PPL source file ../src/globals.defs.hh line 506. */
-#endif
-
-#if defined(NDEBUG)
-#if PPL_PROFILE_ADD_WEIGHT
-#define WEIGHT_BEGIN() Weight_Profiler::begin()
-#define WEIGHT_ADD(delta)                                     \
-  do {                                                        \
-    static Weight_Profiler wp__(__FILE__, __LINE__, delta);   \
-    wp__.end();                                               \
-  } while (false)
-#define WEIGHT_ADD_MUL(delta, factor)                                   \
-  do {                                                                  \
-    static Weight_Profiler wp__(__FILE__, __LINE__, delta);             \
-    wp__.end(factor);                                                   \
-  } while (false)
-#else
-#define WEIGHT_BEGIN()                          \
-  do {                                          \
-  } while (false)
-#define WEIGHT_ADD(delta)                       \
-  do {                                          \
-    Weightwatch_Traits::weight += (delta);      \
-  } while (false)
-#define WEIGHT_ADD_MUL(delta, factor)                   \
-  do {                                                  \
-    Weightwatch_Traits::weight += (delta)*(factor);     \
-  } while (false)
-#endif
-#else
-#define WEIGHT_BEGIN()
-#define WEIGHT_ADD(delta)                       \
-  do {                                          \
-    if (!In_Assert::asserting())                       \
-      Weightwatch_Traits::weight += delta;      \
-  } while (false)
-#define WEIGHT_ADD_MUL(delta, factor)                   \
-  do {                                                  \
-    if (!In_Assert::asserting())                               \
-      Weightwatch_Traits::weight += delta * factor;     \
-  } while (false)
-#endif
-
-/* Automatically generated from PPL source file ../src/globals.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_inlines.hh line 1. */
 /* Implementation of global objects: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/globals.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_inlines.hh line 28. */
 #include <limits>
 #include <cassert>
 #include <istream>
@@ -4588,13 +4636,13 @@ maybe_abandon() {
 #endif
   if (Weightwatch_Traits::check_function != 0)
     Weightwatch_Traits::check_function();
-  if (const Throwable* p = abandon_expensive_computations)
+  if (const Throwable* const p = abandon_expensive_computations)
     p->throw_me();
 }
 
 inline dimension_type
 compute_capacity(const dimension_type requested_size,
-		 const dimension_type maximum_size) {
+                 const dimension_type maximum_size) {
   assert(requested_size <= maximum_size);
   // Speculation factor 2.
   return (requested_size < maximum_size/2)
@@ -4693,9 +4741,9 @@ least_significant_one_mask(const dimension_type i) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/globals.defs.hh line 549. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/globals_defs.hh line 563. */
 
-/* Automatically generated from PPL source file ../src/Variable.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_inlines.hh line 28. */
 #include <stdexcept>
 
 namespace Parma_Polyhedra_Library {
@@ -4708,10 +4756,10 @@ Variable::max_space_dimension() {
 inline
 Variable::Variable(dimension_type i)
   : varid((i < max_space_dimension())
-	  ? i
-	  : (throw std::length_error("PPL::Variable::Variable(i):\n"
-				     "i exceeds the maximum allowed "
-				     "variable identifier."), i)) {
+          ? i
+          : (throw std::length_error("PPL::Variable::Variable(i):\n"
+                                     "i exceeds the maximum allowed "
+                                     "variable identifier."), i)) {
 }
 
 inline dimension_type
@@ -4768,14 +4816,14 @@ swap(Variable& x, Variable& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variable.defs.hh line 155. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_defs.hh line 156. */
 
-/* Automatically generated from PPL source file ../src/Linear_Form.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_defs.hh line 1. */
 /* Linear_Form class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -4784,7 +4832,7 @@ class Linear_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -4796,7 +4844,7 @@ class Box_Helpers;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Form.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_defs.hh line 32. */
 #include <vector>
 
 namespace Parma_Polyhedra_Library {
@@ -5261,12 +5309,12 @@ private:
   ::operator<<<C>(std::ostream& s, const Linear_Form<C>& f);
 };
 
-/* Automatically generated from PPL source file ../src/Linear_Form.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_inlines.hh line 1. */
 /* Linear_Form class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_Form.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_inlines.hh line 28. */
 #include <iostream>
 #include <stdexcept>
 
@@ -5491,10 +5539,10 @@ swap(Linear_Form<C>& x, Linear_Form<C>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Form.defs.hh line 497. */
-// Linear_Form.templates.hh is not included here on purpose.
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_defs.hh line 497. */
+// Linear_Form_templates.hh is not included here on purpose.
 
-/* Automatically generated from PPL source file ../src/Float.inlines.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_inlines.hh line 30. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -5543,7 +5591,7 @@ float_ieee754_half::inc() {
 
 inline void
 float_ieee754_half::set_max(bool negative) {
-  word = 0x7bffU;
+  word = WRD_MAX;
   if (negative)
     word |= SGN_MASK;
 }
@@ -5554,7 +5602,7 @@ float_ieee754_half::build(bool negative, mpz_t mantissa, int exponent) {
                                & ((1UL << MANTISSA_BITS) - 1));
   if (negative)
     word |= SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
   PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
   word |= static_cast<uint16_t>(exponent_repr) << MANTISSA_BITS;
 }
@@ -5604,7 +5652,7 @@ float_ieee754_single::inc() {
 
 inline void
 float_ieee754_single::set_max(bool negative) {
-  word = 0x7f7fffffU;
+  word = WRD_MAX;
   if (negative)
     word |= SGN_MASK;
 }
@@ -5615,7 +5663,7 @@ float_ieee754_single::build(bool negative, mpz_t mantissa, int exponent) {
                                & ((1UL << MANTISSA_BITS) - 1));
   if (negative)
     word |= SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
   PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
   word |= static_cast<uint32_t>(exponent_repr) << MANTISSA_BITS;
 }
@@ -5633,7 +5681,7 @@ float_ieee754_double::inf_sign() const {
 
 inline bool
 float_ieee754_double::is_nan() const {
-  uint32_t a = msp & ~MSP_SGN_MASK;
+  const uint32_t a = msp & ~MSP_SGN_MASK;
   return a > MSP_POS_INF || (a == MSP_POS_INF && lsp != LSP_INF);
 }
 
@@ -5680,8 +5728,8 @@ float_ieee754_double::inc() {
 
 inline void
 float_ieee754_double::set_max(bool negative) {
-  msp = 0x7fefffffU;
-  lsp = 0xffffffffU;
+  msp = MSP_MAX;
+  lsp = LSP_MAX;
   if (negative)
     msp |= MSP_SGN_MASK;
 }
@@ -5701,7 +5749,7 @@ float_ieee754_double::build(bool negative, mpz_t mantissa, int exponent) {
   msp = static_cast<uint32_t>(m & ((1UL << (MANTISSA_BITS - 32)) - 1));
   if (negative)
     msp |= MSP_SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
   PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
   msp |= static_cast<uint32_t>(exponent_repr) << (MANTISSA_BITS - 32);
 }
@@ -5751,7 +5799,7 @@ float_ibm_single::inc() {
 
 inline void
 float_ibm_single::set_max(bool negative) {
-  word = 0x7f000000U;
+  word = WRD_MAX;
   if (negative)
     word |= SGN_MASK;
 }
@@ -5762,7 +5810,7 @@ float_ibm_single::build(bool negative, mpz_t mantissa, int exponent) {
                                & ((1UL << MANTISSA_BITS) - 1));
   if (negative)
     word |= SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
   PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
   word |= static_cast<uint32_t>(exponent_repr) << MANTISSA_BITS;
 }
@@ -5771,7 +5819,7 @@ inline int
 float_intel_double_extended::inf_sign() const {
   if (lsp != LSP_INF)
     return 0;
-  uint32_t a = msp & MSP_NEG_INF;
+  const uint32_t a = msp & MSP_NEG_INF;
   if (a == MSP_NEG_INF)
     return -1;
   if (a == MSP_POS_INF)
@@ -5789,7 +5837,7 @@ inline int
 float_intel_double_extended::zero_sign() const {
   if (lsp != LSP_ZERO)
     return 0;
-  uint32_t a = msp & MSP_NEG_INF;
+  const uint32_t a = msp & MSP_NEG_INF;
   if (a == MSP_NEG_ZERO)
     return -1;
   if (a == MSP_POS_ZERO)
@@ -5829,22 +5877,22 @@ float_intel_double_extended::inc() {
 
 inline void
 float_intel_double_extended::set_max(bool negative) {
-  msp = 0x00007ffeU;
-  lsp = static_cast<uint64_t>(0xffffffffffffffffULL);
+  msp = MSP_MAX;
+  lsp = LSP_NMAX;
   if (negative)
     msp |= MSP_SGN_MASK;
 }
 
 inline void
 float_intel_double_extended::build(bool negative,
-				   mpz_t mantissa, int exponent) {
+                                   mpz_t mantissa, int exponent) {
 #if ULONG_MAX == 0xffffffffUL
-  mpz_export(&lsp, 0, -1, 8, 0, 0, mantissa);
+  mpz_export(&lsp, 0, -1, sizeof(lsp), 0, 0, mantissa);
 #else
   lsp = mpz_get_ui(mantissa);
 #endif
   msp = (negative ? MSP_SGN_MASK : 0);
-  int exponent_repr = exponent + EXPONENT_BIAS;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
   PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
   msp |= static_cast<uint32_t>(exponent_repr);
 }
@@ -5909,8 +5957,8 @@ float_ieee754_quad::inc() {
 
 inline void
 float_ieee754_quad::set_max(bool negative) {
-  msp = static_cast<uint64_t>(0x7ffeffffffffffffULL);
-  lsp = static_cast<uint64_t>(0xffffffffffffffffULL);
+  msp = MSP_MAX;
+  lsp = LSP_MAX;
   if (negative)
     msp |= MSP_SGN_MASK;
 }
@@ -5918,13 +5966,13 @@ float_ieee754_quad::set_max(bool negative) {
 inline void
 float_ieee754_quad::build(bool negative, mpz_t mantissa, int exponent) {
   uint64_t parts[2];
-  mpz_export(parts, 0, -1, 8, 0, 0, mantissa);
+  mpz_export(parts, 0, -1, sizeof(parts[0]), 0, 0, mantissa);
   lsp = parts[0];
   msp = parts[1];
   msp &= ((static_cast<uint64_t>(1) << (MANTISSA_BITS - 64)) - 1);
   if (negative)
     msp |= MSP_SGN_MASK;
-  int exponent_repr = exponent + EXPONENT_BIAS;
+  const int exponent_repr = exponent + EXPONENT_BIAS;
   PPL_ASSERT(exponent_repr >= 0 && exponent_repr < (1 << EXPONENT_BITS));
   msp |= static_cast<uint64_t>(exponent_repr) << (MANTISSA_BITS - 64);
 }
@@ -6001,20 +6049,20 @@ Float<long double>::value() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Float.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_templates.hh line 1. */
 /* IEC 559 floating point format related functions:
    non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Float.templates.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_templates.hh line 30. */
 #include <cmath>
 
 namespace Parma_Polyhedra_Library {
 
 template <typename FP_Interval_Type>
 const FP_Interval_Type& compute_absolute_error(
-		        const Floating_Point_Format analyzed_format) {
+                        const Floating_Point_Format analyzed_format) {
   typedef typename FP_Interval_Type::boundary_type analyzer_format;
 
   // FIXME: check if initializing caches with EMPTY is better.
@@ -6125,9 +6173,9 @@ discard_occurrences(std::map<dimension_type,
    variables as an argument. */
 template <typename FP_Interval_Type>
 void upper_bound_assign(std::map<dimension_type,
-			         Linear_Form<FP_Interval_Type> >& ls1,
+                                 Linear_Form<FP_Interval_Type> >& ls1,
                         const std::map<dimension_type,
-			               Linear_Form<FP_Interval_Type> >& ls2) {
+                                       Linear_Form<FP_Interval_Type> >& ls2) {
   typedef Linear_Form<FP_Interval_Type> FP_Linear_Form;
   typedef typename std::map<dimension_type, FP_Linear_Form>::iterator Iter;
   typedef typename std::map<dimension_type,
@@ -6145,9 +6193,9 @@ void upper_bound_assign(std::map<dimension_type,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Float.defs.hh line 515. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Float_defs.hh line 522. */
 
-/* Automatically generated from PPL source file ../src/checked.defs.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_defs.hh line 35. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -6296,19 +6344,19 @@ namespace Checked {
       ::function(arg1, arg2, arg3, a1);                                 \
   }
 
-#define PPL_DECLARE_FUN5_0_1(name, ret_type,				\
-                             qual1, type1, qual2, type2, qual3, type3,	\
+#define PPL_DECLARE_FUN5_0_1(name, ret_type,                            \
+                             qual1, type1, qual2, type2, qual3, type3,  \
                              qual4, type4, qual5, type5,                \
-                             after1)					\
+                             after1)                                    \
   template <typename Policy1, typename Policy2, typename Policy3,       \
-            typename Policy4,typename Policy5,				\
-            typename type1, typename type2, typename type3,		\
-            typename type4, typename type5>				\
+            typename Policy4,typename Policy5,                          \
+            typename type1, typename type2, typename type3,             \
+            typename type4, typename type5>                             \
   struct PPL_FUNCTION_CLASS(name);                                      \
   template <typename Policy1, typename Policy2, typename Policy3,       \
-            typename Policy4,typename Policy5,				\
-            typename type1, typename type2, typename type3,		\
-            typename type4, typename type5>				\
+            typename Policy4,typename Policy5,                          \
+            typename type1, typename type2, typename type3,             \
+            typename type4, typename type5>                             \
   inline ret_type PPL_U(name)(PPL_U(qual1) PPL_U(type1)& arg1, PPL_U(qual2) \
                        PPL_U(type2)& arg2,                              \
                        PPL_U(qual3) PPL_U(type3)& arg3, PPL_U(qual4)    \
@@ -6320,7 +6368,7 @@ namespace Checked {
       type1, type2,                                                     \
       type3, type4,                                                     \
       PPL_U(type5)>                                                     \
-      ::function(arg1, arg2, arg3, arg4, arg5, a1);			\
+      ::function(arg1, arg2, arg3, arg4, arg5, a1);                     \
   }
 
 #define PPL_SPECIALIZE_FUN1_0_0(name, func, ret_type, qual, type)       \
@@ -6399,7 +6447,7 @@ namespace Checked {
 
 #define PPL_SPECIALIZE_FUN2_0_0(name, func, ret_type, qual1, type1,     \
                                 qual2, type2)                           \
-  template <typename Policy1, typename Policy2>				\
+  template <typename Policy1, typename Policy2>                         \
   struct PPL_FUNCTION_CLASS(name)<Policy1, Policy2, type1,              \
                                   PPL_U(type2)> {                       \
     static inline ret_type function(PPL_U(qual1) PPL_U(type1)& arg1,    \
@@ -6452,8 +6500,8 @@ namespace Checked {
                                 qual1, type1, qual2, type2,             \
                                 qual3, type3,                           \
                                 qual4, type4, qual5, type5, after1)     \
-  template <typename Policy1, typename Policy2, typename Policy3,	\
-	    typename Policy4, typename Policy5>				\
+  template <typename Policy1, typename Policy2, typename Policy3,       \
+            typename Policy4, typename Policy5>                         \
   struct PPL_FUNCTION_CLASS(name) <Policy1, Policy2, Policy3, Policy4,  \
                                    Policy5,                             \
                                    type1, type2,                        \
@@ -6467,7 +6515,7 @@ namespace Checked {
                PPL_U(qual5) PPL_U(type5) &arg5, PPL_U(after1) a1) {     \
       return PPL_U(func)<Policy1, Policy2, Policy3, Policy4,            \
         Policy5>(arg1, arg2, arg3, arg4, arg5, a1);                     \
-    }									\
+    }                                                                   \
   };
 
 // The `nonconst' macro helps readability of the sequel.
@@ -6553,11 +6601,11 @@ namespace Checked {
 #define PPL_SPECIALIZE_DIV_2EXP(func, To, From)                         \
   PPL_SPECIALIZE_FUN2_0_2(div_2exp, func, Result, nonconst, To,         \
                           const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_SMOD_2EXP(func, To, From)			\
-  PPL_SPECIALIZE_FUN2_0_2(smod_2exp, func, Result, nonconst, To,	\
+#define PPL_SPECIALIZE_SMOD_2EXP(func, To, From)                        \
+  PPL_SPECIALIZE_FUN2_0_2(smod_2exp, func, Result, nonconst, To,        \
                           const, From, unsigned int, Rounding_Dir)
-#define PPL_SPECIALIZE_UMOD_2EXP(func, To, From)			\
-  PPL_SPECIALIZE_FUN2_0_2(umod_2exp, func, Result, nonconst, To,	\
+#define PPL_SPECIALIZE_UMOD_2EXP(func, To, From)                        \
+  PPL_SPECIALIZE_FUN2_0_2(umod_2exp, func, Result, nonconst, To,        \
                           const, From, unsigned int, Rounding_Dir)
 #define PPL_SPECIALIZE_ADD_MUL(func, To, From1, From2)                  \
   PPL_SPECIALIZE_FUN3_0_1(add_mul, func, Result, nonconst, To,          \
@@ -6569,7 +6617,7 @@ namespace Checked {
   PPL_SPECIALIZE_FUN3_0_1(gcd, func, Result, nonconst, To,              \
                           const, From1, const, From2, Rounding_Dir)
 #define PPL_SPECIALIZE_GCDEXT(func, To1, From1, From2, To2, To3)        \
-  PPL_SPECIALIZE_FUN5_0_1(gcdext, func, Result, nonconst, To1,		\
+  PPL_SPECIALIZE_FUN5_0_1(gcdext, func, Result, nonconst, To1,          \
                           nonconst, To2, nonconst, To3,                 \
                           const, From1, const, From2, Rounding_Dir)
 #define PPL_SPECIALIZE_LCM(func, To, From1, From2)                      \
@@ -6813,12 +6861,12 @@ struct Checked_Number_Transparent_Policy {
 
 #define CHECK_P(cond, check) ((cond) ? (check) : (assert(!(check)), false))
 
-/* Automatically generated from PPL source file ../src/checked.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_inlines.hh line 1. */
 /* Abstract checked arithmetic functions: fall-backs.
 */
 
 
-/* Automatically generated from PPL source file ../src/checked.inlines.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_inlines.hh line 31. */
 
 /*! \brief
   Performs the test <CODE>a < b</CODE> avoiding the warning about the
@@ -7084,7 +7132,7 @@ abs_generic(To& to, const From& from, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline void
 gcd_exact_no_abs(To& to, const From& x, const From& y) {
   To w_x = x;
@@ -7103,7 +7151,7 @@ gcd_exact_no_abs(To& to, const From& x, const From& y) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   gcd_exact_no_abs<To_Policy, From1_Policy, From2_Policy>(to, x, y);
@@ -7111,12 +7159,12 @@ gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To1_Policy, typename To2_Policy, typename To3_Policy,
-	  typename From1_Policy, typename From2_Policy,
-	  typename To1, typename To2, typename To3,
-	  typename From1, typename From2>
+          typename From1_Policy, typename From2_Policy,
+          typename To1, typename To2, typename To3,
+          typename From1, typename From2>
 inline Result
 gcdext_exact(To1& to, To2& s, To3& t, const From1& x, const From2& y,
-	     Rounding_Dir dir) {
+             Rounding_Dir dir) {
   // In case this becomes a bottleneck, we may consider using the
   // Stehle'-Zimmermann algorithm (see R. Crandall and C. Pomerance,
   // Prime Numbers - A Computational Perspective, Second Edition,
@@ -7129,9 +7177,9 @@ gcdext_exact(To1& to, To2& s, To3& t, const From1& x, const From2& y,
     }
     else {
       if (x < 0)
-	s = -1;
+        s = -1;
       else
-	s = 1;
+        s = 1;
       t = 0;
       return abs<To1_Policy, From1_Policy>(to, x, dir);
     }
@@ -7176,7 +7224,7 @@ gcdext_exact(To1& to, To2& s, To3& t, const From1& x, const From2& y,
       t = v2;
       to = v3;
       if (t3 == 0)
-	break;
+        break;
       v1 = t1;
       v2 = t2;
       v3 = t3;
@@ -7198,7 +7246,7 @@ gcdext_exact(To1& to, To2& s, To3& t, const From1& x, const From2& y,
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 lcm_gcd_exact(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (x == 0 || y == 0) {
@@ -7240,95 +7288,95 @@ struct Safe_Int_Comparison : public False {
 template <typename T1, typename T2>
 struct Safe_Int_Comparison<T1, T2, typename Enable_If<(C_Integer<T1>::value && C_Integer<T2>::value)>::type>
   : public Bool<(C_Integer<T1>::is_signed
-		 ? (C_Integer<T2>::is_signed
-		    || sizeof(T2) < sizeof(T1)
-		    || sizeof(T2) < sizeof(int))
-		 : (!C_Integer<T2>::is_signed
-		    || sizeof(T1) < sizeof(T2)
-		    || sizeof(T1) < sizeof(int)))> {
+                 ? (C_Integer<T2>::is_signed
+                    || sizeof(T2) < sizeof(T1)
+                    || sizeof(T2) < sizeof(int))
+                 : (!C_Integer<T2>::is_signed
+                    || sizeof(T1) < sizeof(T2)
+                    || sizeof(T1) < sizeof(int)))> {
 };
 
 
 template <typename T1, typename T2>
 inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
-			   || Safe_Conversion<T1, T2>::value
-			   || Safe_Conversion<T2, T1>::value), bool>::type
+                           || Safe_Conversion<T1, T2>::value
+                           || Safe_Conversion<T2, T1>::value), bool>::type
 lt(const T1& x, const T2& y) {
   return x < y;
 }
 template <typename T1, typename T2>
 inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
-			   || Safe_Conversion<T1, T2>::value
-			   || Safe_Conversion<T2, T1>::value), bool>::type
+                           || Safe_Conversion<T1, T2>::value
+                           || Safe_Conversion<T2, T1>::value), bool>::type
 le(const T1& x, const T2& y) {
   return x <= y;
 }
 template <typename T1, typename T2>
 inline typename Enable_If<(Safe_Int_Comparison<T1, T2>::value
-			   || Safe_Conversion<T1, T2>::value
-			   || Safe_Conversion<T2, T1>::value), bool>::type
+                           || Safe_Conversion<T1, T2>::value
+                           || Safe_Conversion<T2, T1>::value), bool>::type
 eq(const T1& x, const T2& y) {
   return x == y;
 }
 
 template <typename S, typename U>
 inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
 lt(const S& x, const U& y) {
   return x < 0 || static_cast<typename C_Integer<S>::other_type>(x) < y;
 }
 
 template <typename U, typename S>
 inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
 lt(const U& x, const S& y) {
   return y >= 0 && x < static_cast<typename C_Integer<S>::other_type>(y);
 }
 
 template <typename S, typename U>
 inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
 le(const S& x, const U& y) {
   return x < 0 || static_cast<typename C_Integer<S>::other_type>(x) <= y;
 }
 
 template <typename U, typename S>
 inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
 le(const U& x, const S& y) {
   return y >= 0 && x <= static_cast<typename C_Integer<S>::other_type>(y);
 }
 
 template <typename S, typename U>
 inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
 eq(const S& x, const U& y) {
   return x >= 0 && static_cast<typename C_Integer<S>::other_type>(x) == y;
 }
 
 template <typename U, typename S>
 inline typename Enable_If<(!Safe_Int_Comparison<S, U>::value
-			   && C_Integer<U>::value
-			   && C_Integer<S>::is_signed), bool>::type
+                           && C_Integer<U>::value
+                           && C_Integer<S>::is_signed), bool>::type
 eq(const U& x, const S& y) {
   return y >= 0 && x == static_cast<typename C_Integer<S>::other_type>(y);
 }
 
 template <typename T1, typename T2>
 inline typename Enable_If<(!Safe_Conversion<T1, T2>::value
-			   && !Safe_Conversion<T2, T1>::value
-			   && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
+                           && !Safe_Conversion<T2, T1>::value
+                           && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
 eq(const T1& x, const T2& y) {
   PPL_DIRTY_TEMP(T1, tmp);
   Result r = assign_r(tmp, y, ROUND_CHECK);
   // FIXME: We can do this also without fpu inexact check using a
   // conversion back and forth and then testing equality.  We should
-  // code this in checked_float.inlines.hh, probably it's faster also
+  // code this in checked_float_inlines.hh, probably it's faster also
   // if fpu supports inexact check.
   PPL_ASSERT(r != V_LE && r != V_GE && r != V_LGE);
   return r == V_EQ && x == tmp;
@@ -7336,8 +7384,8 @@ eq(const T1& x, const T2& y) {
 
 template <typename T1, typename T2>
 inline typename Enable_If<(!Safe_Conversion<T1, T2>::value
-			   && !Safe_Conversion<T2, T1>::value
-			   && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
+                           && !Safe_Conversion<T2, T1>::value
+                           && (!C_Integer<T1>::value || !C_Integer<T2>::value)), bool>::type
 lt(const T1& x, const T2& y) {
   PPL_DIRTY_TEMP(T1, tmp);
   Result r = assign_r(tmp, y, ROUND_UP);
@@ -7363,7 +7411,7 @@ le(const T1& x, const T2& y) {
   Result r = assign_r(tmp, y, (ROUND_UP | ROUND_STRICT_RELATION));
   // FIXME: We can do this also without fpu inexact check using a
   // conversion back and forth and then testing equality.  We should
-  // code this in checked_float.inlines.hh, probably it's faster also
+  // code this in checked_float_inlines.hh, probably it's faster also
   // if fpu supports inexact check.
   PPL_ASSERT(r != V_LE && r != V_GE && r != V_LGE);
   if (!result_representable(r))
@@ -7385,28 +7433,28 @@ le(const T1& x, const T2& y) {
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 lt_p(const Type1& x, const Type2& y) {
   return lt(x, y);
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 le_p(const Type1& x, const Type2& y) {
   return le(x, y);
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 eq_p(const Type1& x, const Type2& y) {
   return eq(x, y);
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline Result_Relation
 cmp_generic(const Type1& x, const Type2& y) {
   if (lt(y, x))
@@ -7446,12 +7494,12 @@ input_generic(Type& to, std::istream& is, Rounding_Dir dir) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked_int.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_int_inlines.hh line 1. */
 /* Specialized "checked" functions for native integer numbers.
 */
 
 
-/* Automatically generated from PPL source file ../src/checked_int.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_int_inlines.hh line 28. */
 #include <cerrno>
 #include <cstdlib>
 #include <climits>
@@ -7499,8 +7547,8 @@ template <typename Policy, typename Type>
 struct Extended_Int {
   static const Type plus_infinity = C_Integer<Type>::max;
   static const Type minus_infinity = ((C_Integer<Type>::min >= 0)
-				      ? (C_Integer<Type>::max - 1)
-				      : C_Integer<Type>::min);
+                                      ? (C_Integer<Type>::max - 1)
+                                      : C_Integer<Type>::min);
   static const Type not_a_number
   = ((C_Integer<Type>::min >= 0)
      ? (C_Integer<Type>::max - 2 * (Policy::has_infinity ? 1 : 0))
@@ -7575,8 +7623,8 @@ round_lt_int(To& to, Rounding_Dir dir) {
   if (round_down(dir)) {
     if (to == Extended_Int<Policy, To>::min) {
       if (Policy::has_infinity) {
-	to = Extended_Int<Policy, To>::minus_infinity;
-	return V_GT_MINUS_INFINITY;
+        to = Extended_Int<Policy, To>::minus_infinity;
+        return V_GT_MINUS_INFINITY;
       }
       return V_GT_MINUS_INFINITY | V_UNREPRESENTABLE;
     }
@@ -7594,8 +7642,8 @@ round_gt_int(To& to, Rounding_Dir dir) {
   if (round_up(dir)) {
     if (to == Extended_Int<Policy, To>::max) {
       if (Policy::has_infinity) {
-	to = Extended_Int<Policy, To>::plus_infinity;
-	return V_LT_PLUS_INFINITY;
+        to = Extended_Int<Policy, To>::plus_infinity;
+        return V_LT_PLUS_INFINITY;
       }
       return V_LT_PLUS_INFINITY | V_UNREPRESENTABLE;
     }
@@ -7784,14 +7832,14 @@ inline Result
 assign_signed_int_signed_int(To& to, const From from, Rounding_Dir dir) {
   if (sizeof(To) < sizeof(From)
       || (sizeof(To) == sizeof(From)
-	  && (Extended_Int<To_Policy, To>::min > Extended_Int<From_Policy, From>::min
-	      || Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max))) {
+          && (Extended_Int<To_Policy, To>::min > Extended_Int<From_Policy, From>::min
+              || Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max))) {
     if (CHECK_P(To_Policy::check_overflow,
-		PPL_LT_SILENT(from,
+                PPL_LT_SILENT(from,
                               static_cast<From>(Extended_Int<To_Policy, To>::min))))
       return set_neg_overflow_int<To_Policy>(to, dir);
     if (CHECK_P(To_Policy::check_overflow,
-		PPL_GT_SILENT(from,
+                PPL_GT_SILENT(from,
                               static_cast<From>(Extended_Int<To_Policy, To>::max))))
       return set_pos_overflow_int<To_Policy>(to, dir);
   }
@@ -7804,7 +7852,7 @@ inline Result
 assign_signed_int_unsigned_int(To& to, const From from, Rounding_Dir dir) {
   if (sizeof(To) <= sizeof(From)) {
     if (CHECK_P(To_Policy::check_overflow,
-		from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
+                from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
       return set_pos_overflow_int<To_Policy>(to, dir);
   }
   to = static_cast<To>(from);
@@ -7818,7 +7866,7 @@ assign_unsigned_int_signed_int(To& to, const From from, Rounding_Dir dir) {
     return set_neg_overflow_int<To_Policy>(to, dir);
   if (sizeof(To) < sizeof(From)) {
     if (CHECK_P(To_Policy::check_overflow,
-		from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
+                from > static_cast<From>(Extended_Int<To_Policy, To>::max)))
       return set_pos_overflow_int<To_Policy>(to, dir);
   }
   to = static_cast<To>(from);
@@ -7830,9 +7878,9 @@ inline Result
 assign_unsigned_int_unsigned_int(To& to, const From from, Rounding_Dir dir) {
   if (sizeof(To) < sizeof(From)
       || (sizeof(To) == sizeof(From)
-	  && Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max)) {
+          && Extended_Int<To_Policy, To>::max < Extended_Int<From_Policy, From>::max)) {
     if (CHECK_P(To_Policy::check_overflow,
-		PPL_GT_SILENT(from,
+                PPL_GT_SILENT(from,
                               static_cast<From>(Extended_Int<To_Policy, To>::max))))
       return set_pos_overflow_int<To_Policy>(to, dir);
   }
@@ -8047,9 +8095,9 @@ assign_signed_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
     if (from.fits_slong_p()) {
       signed long v = from.get_si();
       if (PPL_LT_SILENT(v, (Extended_Int<To_Policy, To>::min)))
-	return set_neg_overflow_int<To_Policy>(to, dir);
+        return set_neg_overflow_int<To_Policy>(to, dir);
       if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max)))
-	return set_pos_overflow_int<To_Policy>(to, dir);
+        return set_pos_overflow_int<To_Policy>(to, dir);
       to = v;
       return V_EQ;
     }
@@ -8059,16 +8107,16 @@ assign_signed_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
     size_t sz = mpz_size(m);
     if (sz <= sizeof(To) / sizeof(mp_limb_t)) {
       if (sz == 0) {
-	to = 0;
-	return V_EQ;
+        to = 0;
+        return V_EQ;
       }
       To v;
       mpz_export(&v, 0, -1, sizeof(To), 0, 0, m);
       if (v >= 0) {
-	if (::sgn(from) < 0)
-	  return neg<To_Policy, To_Policy>(to, v, dir);
-	to = v;
-	return V_EQ;
+        if (::sgn(from) < 0)
+          return neg<To_Policy, To_Policy>(to, v, dir);
+        to = v;
+        return V_EQ;
       }
     }
   }
@@ -8097,21 +8145,21 @@ assign_unsigned_int_mpz(To& to, const mpz_class& from, Rounding_Dir dir) {
       return V_EQ;
     }
     if (from.fits_ulong_p()) {
-      unsigned long v = from.get_ui();
+      const unsigned long v = from.get_ui();
       if (PPL_GT_SILENT(v, (Extended_Int<To_Policy, To>::max)))
-	return set_pos_overflow_int<To_Policy>(to, dir);
+        return set_pos_overflow_int<To_Policy>(to, dir);
       to = static_cast<To>(v);
       return V_EQ;
     }
   }
   else {
-    mpz_srcptr m = from.get_mpz_t();
-    size_t sz = mpz_size(m);
+    const mpz_srcptr m = from.get_mpz_t();
+    const size_t sz = mpz_size(m);
     if (sz <= sizeof(To) / sizeof(mp_limb_t)) {
       if (sz == 0)
-	to = 0;
+        to = 0;
       else
-	mpz_export(&to, 0, -1, sizeof(To), 0, 0, m);
+        mpz_export(&to, 0, -1, sizeof(To), 0, 0, m);
       return V_EQ;
     }
   }
@@ -8391,7 +8439,7 @@ neg_signed_int(Type& to, const Type from, Rounding_Dir dir) {
   if (To_Policy::check_overflow && Larger<Type>::use_for_neg)
     return neg_int_larger<To_Policy, From_Policy>(to, from, dir);
   if (CHECK_P(To_Policy::check_overflow,
-	      (from < -Extended_Int<To_Policy, Type>::max)))
+              (from < -Extended_Int<To_Policy, Type>::max)))
     return set_pos_overflow_int<To_Policy>(to, dir);
   to = -from;
   return V_EQ;
@@ -8417,7 +8465,7 @@ add_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_overflow) {
     if (y >= 0) {
       if (x > Extended_Int<To_Policy, Type>::max - y)
-	return set_pos_overflow_int<To_Policy>(to, dir);
+        return set_pos_overflow_int<To_Policy>(to, dir);
     }
     else if (x < Extended_Int<To_Policy, Type>::min - y)
       return set_neg_overflow_int<To_Policy>(to, dir);
@@ -8433,7 +8481,7 @@ add_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_overflow && Larger<Type>::use_for_add)
     return add_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
   if (CHECK_P(To_Policy::check_overflow,
-	      (x > Extended_Int<To_Policy, Type>::max - y)))
+              (x > Extended_Int<To_Policy, Type>::max - y)))
     return set_pos_overflow_int<To_Policy>(to, dir);
   to = x + y;
   return V_EQ;
@@ -8448,7 +8496,7 @@ sub_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_overflow) {
     if (y >= 0) {
       if (x < Extended_Int<To_Policy, Type>::min + y)
-	return set_neg_overflow_int<To_Policy>(to, dir);
+        return set_neg_overflow_int<To_Policy>(to, dir);
     }
     else if (x > Extended_Int<To_Policy, Type>::max + y)
       return set_pos_overflow_int<To_Policy>(to, dir);
@@ -8464,7 +8512,7 @@ sub_unsigned_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_overflow && Larger<Type>::use_for_sub)
     return sub_int_larger<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
   if (CHECK_P(To_Policy::check_overflow,
-	      (x < Extended_Int<To_Policy, Type>::min + y)))
+              (x < Extended_Int<To_Policy, Type>::min + y)))
     return set_neg_overflow_int<To_Policy>(to, dir);
   to = x - y;
   return V_EQ;
@@ -8489,21 +8537,21 @@ mul_signed_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (x >= 0) {
     if (y > 0) {
       if (x > Extended_Int<To_Policy, Type>::max / y)
-	return set_pos_overflow_int<To_Policy>(to, dir);
+        return set_pos_overflow_int<To_Policy>(to, dir);
     }
     else {
       if (x > Extended_Int<To_Policy, Type>::min / y)
-	return set_neg_overflow_int<To_Policy>(to, dir);
+        return set_neg_overflow_int<To_Policy>(to, dir);
     }
   }
   else {
     if (y < 0) {
       if (x < Extended_Int<To_Policy, Type>::max / y)
-	return set_pos_overflow_int<To_Policy>(to, dir);
+        return set_pos_overflow_int<To_Policy>(to, dir);
     }
     else {
       if (x < Extended_Int<To_Policy, Type>::min / y)
-	return set_neg_overflow_int<To_Policy>(to, dir);
+        return set_neg_overflow_int<To_Policy>(to, dir);
     }
   }
   to = x * y;
@@ -8640,45 +8688,40 @@ template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 div_2exp_signed_int(Type& to, const Type x, unsigned int exp,
                     Rounding_Dir dir) {
-  if (exp > sizeof_to_bits(sizeof(Type)) - 1) {
-  zero:
-    to = 0;
+  if (x < 0) {
+    if (exp >= sizeof_to_bits(sizeof(Type))) {
+      to = 0;
+      if (round_not_requested(dir))
+        return V_LE;
+      return round_lt_int_no_overflow<To_Policy>(to, dir);
+    }
+    typedef typename C_Integer<Type>::other_type UType;
+    UType ux = x;
+    ux = -ux;
+    to = ~Type(~-(ux >> exp));
     if (round_not_requested(dir))
-      return V_LGE;
-    if (x < 0)
+      return V_LE;
+    if (ux & ((UType(1) << exp) -1))
       return round_lt_int_no_overflow<To_Policy>(to, dir);
-    else if (x > 0)
+    return V_EQ;
+  }
+  else {
+    if (exp >= sizeof_to_bits(sizeof(Type)) - 1) {
+      to = 0;
+      if (round_not_requested(dir))
+        return V_GE;
+      if (x == 0)
+        return V_EQ;
+      return round_gt_int_no_overflow<To_Policy>(to, dir);
+    }
+    to = x >> exp;
+    if (round_not_requested(dir))
+      return V_GE;
+    if (x & ((Type(1) << exp) - 1))
       return round_gt_int_no_overflow<To_Policy>(to, dir);
     else
       return V_EQ;
   }
-  if (exp == sizeof_to_bits(sizeof(Type)) - 1) {
-    if (x == C_Integer<Type>::min) {
-      to = -1;
-      return V_EQ;
-    }
-    goto zero;
-  }
-#if 0
-  to = x / (Type(1) << exp);
-  if (round_not_requested(dir))
-    return V_GE;
-  Type r = x % (Type(1) << exp);
-  if (r < 0)
-    return round_lt_int_no_overflow<To_Policy>(to, dir);
-  else if (r > 0)
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  else
-    return V_EQ;
-#else
-  // Faster but compiler implementation dependent (see C++98 5.8.3)
-  to = x >> exp;
-  if (round_not_requested(dir))
-    return V_GE;
-  if (x & ((Type(1) << exp) - 1))
-    return round_gt_int_no_overflow<To_Policy>(to, dir);
-  return V_EQ;
-#endif
 }
 
 template <typename To_Policy, typename From_Policy, typename Type>
@@ -8698,7 +8741,7 @@ add_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
 template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 add_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		    Rounding_Dir dir) {
+                    Rounding_Dir dir) {
   if (!To_Policy::check_overflow) {
     to = x + (Type(1) << exp);
     return V_EQ;
@@ -8732,7 +8775,7 @@ sub_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
 template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 sub_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		    Rounding_Dir dir) {
+                    Rounding_Dir dir) {
   if (!To_Policy::check_overflow) {
     to = x - (Type(1) << exp);
     return V_EQ;
@@ -8764,12 +8807,9 @@ mul_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
     }
     return set_pos_overflow_int<To_Policy>(to, dir);
   }
-  if (x & (((Type(1) << exp) - 1) << (sizeof_to_bits(sizeof(Type)) - exp)))
+  if (x > Extended_Int<To_Policy, Type>::max >> exp)
     return set_pos_overflow_int<To_Policy>(to, dir);
-  Type n = x << exp;
-  if (PPL_GT_SILENT(n, (Extended_Int<To_Policy, Type>::max)))
-    return set_pos_overflow_int<To_Policy>(to, dir);
-  to = n;
+  to = x << exp;
   return V_EQ;
 }
 
@@ -8777,44 +8817,47 @@ template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 mul_2exp_signed_int(Type& to, const Type x, unsigned int exp,
                     Rounding_Dir dir) {
-  if (!To_Policy::check_overflow) {
-    to = x << exp;
-    return V_EQ;
-  }
-  if (exp >= sizeof_to_bits(sizeof(Type)) - 1) {
-    if (x < 0)
-      return set_neg_overflow_int<To_Policy>(to, dir);
-    else if (x > 0)
-      return set_pos_overflow_int<To_Policy>(to, dir);
-    else {
-      to = 0;
+  if (x < 0) {
+    if (!To_Policy::check_overflow) {
+      to = x * (Type(1) << exp);
       return V_EQ;
     }
-  }
-  Type mask = ((Type(1) << exp) - 1) << ((sizeof_to_bits(sizeof(Type)) - 1) - exp);
-  Type n;
-  if (x < 0) {
-    if ((x & mask) != mask)
+    if (exp >= sizeof_to_bits(sizeof(Type)))
       return set_neg_overflow_int<To_Policy>(to, dir);
-    n = x << exp;
+    typedef typename C_Integer<Type>::other_type UType;
+    UType mask = UType(-1) << (sizeof_to_bits(sizeof(Type)) - exp - 1);
+    UType ux = x;
+    if ((ux & mask) != mask)
+      return set_neg_overflow_int<To_Policy>(to, dir);
+    ux <<= exp;
+    Type n = ~(Type(~ux));
     if (PPL_LT_SILENT(n, (Extended_Int<To_Policy, Type>::min)))
       return set_neg_overflow_int<To_Policy>(to, dir);
+    to = n;
   }
   else {
-    if (x & mask)
+    if (!To_Policy::check_overflow) {
+      to = x << exp;
+      return V_EQ;
+    }
+    if (exp >= sizeof_to_bits(sizeof(Type)) - 1) {
+      if (x == 0) {
+        to = 0;
+        return V_EQ;
+      }
       return set_pos_overflow_int<To_Policy>(to, dir);
-    n = x << exp;
-    if (PPL_GT_SILENT(n, (Extended_Int<To_Policy, Type>::max)))
+    }
+    if (x > Extended_Int<To_Policy, Type>::max >> exp)
       return set_pos_overflow_int<To_Policy>(to, dir);
+    to = x << exp;
   }
-  to = n;
   return V_EQ;
 }
 
 template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 smod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-		       Rounding_Dir dir) {
+                       Rounding_Dir dir) {
   if (exp > sizeof_to_bits(sizeof(Type)))
     to = x;
   else {
@@ -8830,7 +8873,7 @@ smod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
 template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 smod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		     Rounding_Dir) {
+                     Rounding_Dir) {
   if (exp >= sizeof_to_bits(sizeof(Type)))
     to = x;
   else {
@@ -8843,7 +8886,7 @@ smod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
 template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 umod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
-		       Rounding_Dir) {
+                       Rounding_Dir) {
   if (exp >= sizeof_to_bits(sizeof(Type)))
     to = x;
   else
@@ -8854,7 +8897,7 @@ umod_2exp_unsigned_int(Type& to, const Type x, unsigned int exp,
 template <typename To_Policy, typename From_Policy, typename Type>
 inline Result
 umod_2exp_signed_int(Type& to, const Type x, unsigned int exp,
-		     Rounding_Dir dir) {
+                     Rounding_Dir dir) {
   if (exp >= sizeof_to_bits(sizeof(Type))) {
     if (x < 0)
       return set_pos_overflow_int<To_Policy>(to, dir);
@@ -8951,7 +8994,7 @@ sub_mul_int(Type& to, const Type x, const Type y, Rounding_Dir dir) {
 template <typename Policy, typename Type>
 inline Result
 output_char(std::ostream& os, Type& from,
-	    const Numeric_Format&, Rounding_Dir) {
+            const Numeric_Format&, Rounding_Dir) {
   os << int(from);
   return V_EQ;
 }
@@ -9381,15 +9424,13 @@ PPL_SPECIALIZE_OUTPUT(output_int, unsigned long long)
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked_float.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_float_inlines.hh line 1. */
 /* Specialized "checked" functions for native floating-point numbers.
 */
 
 
-/* Automatically generated from PPL source file ../src/checked_float.inlines.hh line 28. */
-#ifndef __alpha
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_float_inlines.hh line 28. */
 #include <cmath>
-#endif
 
 namespace Parma_Polyhedra_Library {
 
@@ -9801,7 +9842,7 @@ neg_float(Type& to, const Type from, Rounding_Dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 add_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_inf_add_inf
@@ -9831,7 +9872,7 @@ add_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 sub_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_inf_sub_inf
@@ -9861,13 +9902,13 @@ sub_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_inf_mul_zero
       && ((x == 0 && is_inf_float<From2_Policy>(y))
           ||
-	  (y == 0 && is_inf_float<From1_Policy>(x)))) {
+          (y == 0 && is_inf_float<From1_Policy>(x)))) {
     return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
   }
   prepare_inexact<To_Policy>(dir);
@@ -9893,7 +9934,7 @@ mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 div_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_inf_div_inf
@@ -9926,7 +9967,7 @@ div_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 idiv_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   Type temp;
@@ -9946,7 +9987,7 @@ idiv_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 rem_float(Type& to, const Type x, const Type y, Rounding_Dir) {
   if (To_Policy::check_inf_mod && is_inf_float<From1_Policy>(x)) {
@@ -10197,8 +10238,8 @@ assign_float_mpz(T& to, const mpz_class& from, Rounding_Dir dir) {
   mpz_init(mantissa);
   if (exponent > Float<T>::Binary::MANTISSA_BITS)
     mpz_tdiv_q_2exp(mantissa,
-		    from_z,
-		    exponent - Float<T>::Binary::MANTISSA_BITS);
+                    from_z,
+                    exponent - Float<T>::Binary::MANTISSA_BITS);
   else
     mpz_mul_2exp(mantissa, from_z, Float<T>::Binary::MANTISSA_BITS - exponent);
   Float<T> f;
@@ -10290,13 +10331,13 @@ assign_float_mpq(T& to, const mpq_class& from, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename Type>
+          typename Type>
 inline Result
 add_mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_inf_mul_zero
       && ((x == 0 && is_inf_float<From2_Policy>(y))
           ||
-	  (y == 0 && is_inf_float<From1_Policy>(x)))) {
+          (y == 0 && is_inf_float<From1_Policy>(x)))) {
     return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
   }
   // FIXME: missing check_inf_add_inf
@@ -10329,7 +10370,7 @@ sub_mul_float(Type& to, const Type x, const Type y, Rounding_Dir dir) {
   if (To_Policy::check_inf_mul_zero
       && ((x == 0 && is_inf_float<From2_Policy>(y))
           ||
-	  (y == 0 && is_inf_float<From1_Policy>(x)))) {
+          (y == 0 && is_inf_float<From1_Policy>(x)))) {
     return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
   }
   // FIXME: missing check_inf_add_inf
@@ -10366,26 +10407,26 @@ template <>
 inline void
 assign_mpq_numeric_float(mpq_class& to, const long double from) {
   to = 0;
-  if (from == 0)
+  if (from == 0.0L)
     return;
   mpz_class& num = to.get_num();
   mpz_class& den = to.get_den();
   int exp;
-  long double n = frexpl(from, &exp);
+  long double n = std::frexp(from, &exp);
   bool neg = false;
-  if (n < 0) {
+  if (n < 0.0L) {
     neg = true;
     n = -n;
   }
-  const long double mult = static_cast<long double>(ULONG_MAX) + 1;
+  const long double mult = static_cast<long double>(ULONG_MAX) + 1.0L;
   const unsigned int bits = sizeof(unsigned long) * CHAR_BIT;
   while (true) {
     n *= mult;
     exp -= bits;
-    long double intpart = floorl(n);
-    num += (unsigned long)intpart;
+    const long double intpart = std::floor(n);
+    num += static_cast<unsigned long>(intpart);
     n -= intpart;
-    if (n == 0)
+    if (n == 0.0L)
       break;
     num <<= bits;
   }
@@ -10401,7 +10442,7 @@ assign_mpq_numeric_float(mpq_class& to, const long double from) {
 template <typename Policy, typename Type>
 inline Result
 output_float(std::ostream& os, const Type from, const Numeric_Format&,
-	     Rounding_Dir) {
+             Rounding_Dir) {
   if (from == 0)
     os << "0";
   else if (is_minf<Policy>(from))
@@ -10581,7 +10622,7 @@ PPL_SPECIALIZE_UMOD_2EXP(umod_2exp_float, long double, long double)
 PPL_SPECIALIZE_SQRT(sqrt_float, long double, long double)
 PPL_SPECIALIZE_GCD(gcd_exact, long double, long double, long double)
 PPL_SPECIALIZE_GCDEXT(gcdext_exact, long double, long double, long double,
-		  long double, long double)
+                  long double, long double)
 PPL_SPECIALIZE_LCM(lcm_gcd_exact, long double, long double, long double)
 PPL_SPECIALIZE_SGN(sgn_float, long double)
 PPL_SPECIALIZE_CMP(cmp_float, long double, long double)
@@ -10595,7 +10636,7 @@ PPL_SPECIALIZE_OUTPUT(output_float, long double)
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked_mpz.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_mpz_inlines.hh line 1. */
 /* Specialized "checked" functions for GMP's mpz_class numbers.
 */
 
@@ -10650,16 +10691,16 @@ classify_mpz(const mpz_class& v, bool nan, bool inf, bool sign) {
   if (Policy::has_nan || Policy::has_infinity) {
     mp_size_field_t s = get_mp_size(v);
     if (Policy::has_nan
-	&& (nan || sign)
-	&& s == C_Integer<mp_size_field_t>::min + 1)
+        && (nan || sign)
+        && s == C_Integer<mp_size_field_t>::min + 1)
       return V_NAN;
     if (!inf && !sign)
       return V_LGE;
     if (Policy::has_infinity) {
       if (s == C_Integer<mp_size_field_t>::min)
-	return inf ? V_EQ_MINUS_INFINITY : V_LT;
+        return inf ? V_EQ_MINUS_INFINITY : V_LT;
       if (s == C_Integer<mp_size_field_t>::max)
-	return inf ? V_EQ_PLUS_INFINITY : V_GT;
+        return inf ? V_EQ_PLUS_INFINITY : V_GT;
     }
   }
   if (sign)
@@ -10900,8 +10941,8 @@ assign_mpz_mpq(mpz_class& to, const mpq_class& from, Rounding_Dir dir) {
     to = from;
     return V_LGE;
   }
-  mpz_srcptr n = from.get_num().get_mpz_t();
-  mpz_srcptr d = from.get_den().get_mpz_t();
+  const mpz_srcptr n = from.get_num().get_mpz_t();
+  const mpz_srcptr d = from.get_den().get_mpz_t();
   if (round_down(dir)) {
     mpz_fdiv_q(to.get_mpz_t(), n, d);
     if (round_strict_relation(dir))
@@ -10962,12 +11003,12 @@ PPL_SPECIALIZE_MUL(mul_mpz, mpz_class, mpz_class, mpz_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 div_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	Rounding_Dir dir) {
+        Rounding_Dir dir) {
   if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
     return assign_nan<To_Policy>(to, V_DIV_ZERO);
   }
-  mpz_srcptr n = x.get_mpz_t();
-  mpz_srcptr d = y.get_mpz_t();
+  const mpz_srcptr n = x.get_mpz_t();
+  const mpz_srcptr d = y.get_mpz_t();
   if (round_not_needed(dir)) {
     mpz_divexact(to.get_mpz_t(), n, d);
     return V_LGE;
@@ -10996,7 +11037,7 @@ PPL_SPECIALIZE_DIV(div_mpz, mpz_class, mpz_class, mpz_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 idiv_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	Rounding_Dir) {
+        Rounding_Dir) {
   if (CHECK_P(To_Policy::check_div_zero, ::sgn(y) == 0)) {
     return assign_nan<To_Policy>(to, V_DIV_ZERO);
   }
@@ -11060,7 +11101,7 @@ template <typename To_Policy, typename From_Policy>
 inline Result
 div_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
              Rounding_Dir dir) {
-  mpz_srcptr n = x.get_mpz_t();
+  const mpz_srcptr n = x.get_mpz_t();
   if (round_not_requested(dir)) {
     mpz_tdiv_q_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
     return V_LGE;
@@ -11085,7 +11126,7 @@ PPL_SPECIALIZE_DIV_2EXP(div_2exp_mpz, mpz_class, mpz_class)
 template <typename To_Policy, typename From_Policy>
 inline Result
 smod_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-	      Rounding_Dir) {
+              Rounding_Dir) {
   if (mpz_tstbit(x.get_mpz_t(), exp - 1) != 0)
     mpz_cdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
   else
@@ -11098,7 +11139,7 @@ PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_mpz, mpz_class, mpz_class)
 template <typename To_Policy, typename From_Policy>
 inline Result
 umod_2exp_mpz(mpz_class& to, const mpz_class& x, unsigned int exp,
-	      Rounding_Dir) {
+              Rounding_Dir) {
   mpz_fdiv_r_2exp(to.get_mpz_t(), x.get_mpz_t(), exp);
   return V_EQ;
 }
@@ -11117,7 +11158,7 @@ PPL_SPECIALIZE_ABS(abs_mpz, mpz_class, mpz_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 add_mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	    Rounding_Dir) {
+            Rounding_Dir) {
   mpz_addmul(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
   return V_EQ;
 }
@@ -11127,7 +11168,7 @@ PPL_SPECIALIZE_ADD_MUL(add_mul_mpz, mpz_class, mpz_class, mpz_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 sub_mul_mpz(mpz_class& to, const mpz_class& x, const mpz_class& y,
-	    Rounding_Dir) {
+            Rounding_Dir) {
   mpz_submul(to.get_mpz_t(), x.get_mpz_t(), y.get_mpz_t());
   return V_EQ;
 }
@@ -11146,10 +11187,10 @@ PPL_SPECIALIZE_GCD(gcd_mpz, mpz_class, mpz_class, mpz_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 gcdext_mpz(mpz_class& to, mpz_class& s, mpz_class& t,
-	   const mpz_class& x, const mpz_class& y,
-	   Rounding_Dir) {
+           const mpz_class& x, const mpz_class& y,
+           Rounding_Dir) {
   mpz_gcdext(to.get_mpz_t(), s.get_mpz_t(), t.get_mpz_t(),
-	     x.get_mpz_t(), y.get_mpz_t());
+             x.get_mpz_t(), y.get_mpz_t());
   return V_EQ;
 }
 
@@ -11186,8 +11227,8 @@ PPL_SPECIALIZE_SQRT(sqrt_mpz, mpz_class, mpz_class)
 template <typename Policy, typename Type>
 inline Result_Relation
 sgn_mp(const Type& x) {
-  int i = ::sgn(x);
-  return (i > 0) ? VR_GT : ((i < 0) ? VR_LT : VR_EQ);
+  const int sign = ::sgn(x);
+  return (sign > 0) ? VR_GT : ((sign < 0) ? VR_LT : VR_EQ);
 }
 
 PPL_SPECIALIZE_SGN(sgn_mp, mpz_class)
@@ -11206,7 +11247,7 @@ PPL_SPECIALIZE_CMP(cmp_mp, mpq_class, mpq_class)
 template <typename Policy>
 inline Result
 output_mpz(std::ostream& os, const mpz_class& from, const Numeric_Format&,
-	   Rounding_Dir) {
+           Rounding_Dir) {
   os << from;
   return V_EQ;
 }
@@ -11218,7 +11259,7 @@ PPL_SPECIALIZE_OUTPUT(output_mpz, mpz_class)
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked_mpq.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_mpq_inlines.hh line 1. */
 /* Specialized "checked" functions for GMP's mpq_class numbers.
 */
 
@@ -11243,9 +11284,9 @@ classify_mpq(const mpq_class& v, bool nan, bool inf, bool sign) {
       return V_LGE;
     if (Policy::has_infinity) {
       if (s < 0)
-	return inf ? V_EQ_MINUS_INFINITY : V_LT;
+        return inf ? V_EQ_MINUS_INFINITY : V_LT;
       if (s > 0)
-	return inf ? V_EQ_PLUS_INFINITY : V_GT;
+        return inf ? V_EQ_PLUS_INFINITY : V_GT;
     }
   }
   if (sign)
@@ -11434,7 +11475,7 @@ template <typename To_Policy, typename From_Policy>
 inline Result
 floor_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
   mpz_fdiv_q(to.get_num().get_mpz_t(),
-	     from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
+             from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
   to.get_den() = 1;
   return V_EQ;
 }
@@ -11445,7 +11486,7 @@ template <typename To_Policy, typename From_Policy>
 inline Result
 ceil_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
   mpz_cdiv_q(to.get_num().get_mpz_t(),
-	     from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
+             from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
   to.get_den() = 1;
   return V_EQ;
 }
@@ -11456,7 +11497,7 @@ template <typename To_Policy, typename From_Policy>
 inline Result
 trunc_mpq(mpq_class& to, const mpq_class& from, Rounding_Dir) {
   mpz_tdiv_q(to.get_num().get_mpz_t(),
-	     from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
+             from.get_num().get_mpz_t(), from.get_den().get_mpz_t());
   to.get_den() = 1;
   return V_EQ;
 }
@@ -11591,7 +11632,7 @@ PPL_SPECIALIZE_DIV_2EXP(div_2exp_mpq, mpq_class, mpq_class)
 template <typename To_Policy, typename From_Policy>
 inline Result
 smod_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-	      Rounding_Dir) {
+              Rounding_Dir) {
   mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
   mpz_fdiv_r(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), to.get_den().get_mpz_t());
   mpz_fdiv_q_2exp(to.get_den().get_mpz_t(), to.get_den().get_mpz_t(), 1);
@@ -11609,7 +11650,7 @@ PPL_SPECIALIZE_SMOD_2EXP(smod_2exp_mpq, mpq_class, mpq_class)
 template <typename To_Policy, typename From_Policy>
 inline Result
 umod_2exp_mpq(mpq_class& to, const mpq_class& x, unsigned int exp,
-	      Rounding_Dir) {
+              Rounding_Dir) {
   mpz_mul_2exp(to.get_den().get_mpz_t(), x.get_den().get_mpz_t(), exp);
   mpz_fdiv_r(to.get_num().get_mpz_t(), x.get_num().get_mpz_t(), to.get_den().get_mpz_t());
   mpz_mul_2exp(to.get_num().get_mpz_t(), to.get_num().get_mpz_t(), exp);
@@ -11631,7 +11672,7 @@ PPL_SPECIALIZE_ABS(abs_mpq, mpq_class, mpq_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 add_mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y,
-	    Rounding_Dir) {
+            Rounding_Dir) {
   to += x * y;
   return V_EQ;
 }
@@ -11641,7 +11682,7 @@ PPL_SPECIALIZE_ADD_MUL(add_mul_mpq, mpq_class, mpq_class, mpq_class)
 template <typename To_Policy, typename From1_Policy, typename From2_Policy>
 inline Result
 sub_mul_mpq(mpq_class& to, const mpq_class& x, const mpq_class& y,
-	    Rounding_Dir) {
+            Rounding_Dir) {
   to -= x * y;
   return V_EQ;
 }
@@ -11701,9 +11742,9 @@ PPL_SPECIALIZE_INPUT(input_mpq, mpq_class)
 template <typename Policy>
 inline Result
 output_mpq(std::ostream& os,
-	   const mpq_class& from,
-	   const Numeric_Format&,
-	   Rounding_Dir) {
+           const mpq_class& from,
+           const Numeric_Format&,
+           Rounding_Dir) {
   os << from;
   return V_EQ;
 }
@@ -11733,12 +11774,12 @@ set_irrational_precision(const unsigned p) {
     Checked::irrational_precision = p;
   else
     throw std::invalid_argument("PPL::set_irrational_precision(p)"
-				" with p > INT_MAX");
+                                " with p > INT_MAX");
 }
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked_ext.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_ext_inlines.hh line 1. */
 /* Checked extended arithmetic functions.
 */
 
@@ -11783,7 +11824,7 @@ sgn_ext(const Type& x) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 construct_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11801,7 +11842,7 @@ construct_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 assign_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11819,7 +11860,7 @@ assign_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 neg_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11837,7 +11878,7 @@ neg_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 floor_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11855,7 +11896,7 @@ floor_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 ceil_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11873,7 +11914,7 @@ ceil_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 trunc_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11891,7 +11932,7 @@ trunc_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 abs_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -11907,7 +11948,7 @@ abs_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 add_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
@@ -11945,7 +11986,7 @@ add_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 sub_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
@@ -11983,7 +12024,7 @@ sub_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
@@ -12014,25 +12055,25 @@ mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
     if (is_minf<From2_Policy>(y)) {
       switch (sgn<From1_Policy>(x)) {
       case VR_LT:
-	goto pinf;
+        goto pinf;
       case VR_GT:
-	goto minf;
+        goto minf;
       default:
-	goto inf_mul_zero;
+        goto inf_mul_zero;
       }
     }
     else if (is_pinf<From2_Policy>(y)) {
       switch (sgn<From1_Policy>(x)) {
       case VR_LT:
       minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
       case VR_GT:
       pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
       default:
       inf_mul_zero:
-	PPL_ASSERT(To_Policy::check_inf_mul_zero);
-	return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+        PPL_ASSERT(To_Policy::check_inf_mul_zero);
+        return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
       }
     }
     else {
@@ -12044,7 +12085,7 @@ mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 add_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<To_Policy>(to)
@@ -12077,43 +12118,43 @@ add_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
     if (is_minf<From2_Policy>(y)) {
       switch (sgn<From1_Policy>(x)) {
       case VR_LT:
-	goto a_pinf;
+        goto a_pinf;
       case VR_GT:
-	goto a_minf;
+        goto a_minf;
       default:
-	goto inf_mul_zero;
+        goto inf_mul_zero;
       }
     }
     else if (is_pinf<From2_Policy>(y)) {
       switch (sgn<From1_Policy>(x)) {
       case VR_LT:
       a_minf:
-	if (CHECK_P(To_Policy::check_inf_add_inf, is_pinf<To_Policy>(to)))
-	  goto inf_add_inf;
-	else
-	  goto minf;
+        if (CHECK_P(To_Policy::check_inf_add_inf, is_pinf<To_Policy>(to)))
+          goto inf_add_inf;
+        else
+          goto minf;
       case VR_GT:
       a_pinf:
-	if (CHECK_P(To_Policy::check_inf_add_inf, is_minf<To_Policy>(to))) {
-	inf_add_inf:
-	  return assign_nan<To_Policy>(to, V_INF_ADD_INF);
-	}
-	else
-	  goto pinf;
+        if (CHECK_P(To_Policy::check_inf_add_inf, is_minf<To_Policy>(to))) {
+        inf_add_inf:
+          return assign_nan<To_Policy>(to, V_INF_ADD_INF);
+        }
+        else
+          goto pinf;
       default:
       inf_mul_zero:
-	PPL_ASSERT(To_Policy::check_inf_mul_zero);
-	return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+        PPL_ASSERT(To_Policy::check_inf_mul_zero);
+        return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
       }
     }
     else {
       if (is_minf<To_Policy>(to)) {
       minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
       }
       if (is_pinf<To_Policy>(to)) {
       pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
       }
     native:
       return add_mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
@@ -12122,7 +12163,7 @@ add_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 sub_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<To_Policy>(to)
@@ -12155,43 +12196,43 @@ sub_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
     if (is_minf<From2_Policy>(y)) {
       switch (sgn<From1_Policy>(x)) {
       case VR_LT:
-	goto a_pinf;
+        goto a_pinf;
       case VR_GT:
-	goto a_minf;
+        goto a_minf;
       default:
-	goto inf_mul_zero;
+        goto inf_mul_zero;
       }
     }
     else if (is_pinf<From2_Policy>(y)) {
       switch (sgn<From1_Policy>(x)) {
       case VR_LT:
       a_minf:
-	if (CHECK_P(To_Policy::check_inf_sub_inf, is_minf<To_Policy>(to)))
-	  goto inf_sub_inf;
-	else
-	  goto pinf;
+        if (CHECK_P(To_Policy::check_inf_sub_inf, is_minf<To_Policy>(to)))
+          goto inf_sub_inf;
+        else
+          goto pinf;
       case VR_GT:
       a_pinf:
-	if (CHECK_P(To_Policy::check_inf_sub_inf, is_pinf<To_Policy>(to))) {
-	inf_sub_inf:
-	  return assign_nan<To_Policy>(to, V_INF_SUB_INF);
-	}
-	else
-	  goto minf;
+        if (CHECK_P(To_Policy::check_inf_sub_inf, is_pinf<To_Policy>(to))) {
+        inf_sub_inf:
+          return assign_nan<To_Policy>(to, V_INF_SUB_INF);
+        }
+        else
+          goto minf;
       default:
       inf_mul_zero:
-	PPL_ASSERT(To_Policy::check_inf_mul_zero);
-	return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
+        PPL_ASSERT(To_Policy::check_inf_mul_zero);
+        return assign_nan<To_Policy>(to, V_INF_MUL_ZERO);
       }
     }
     else {
       if (is_minf<To_Policy>(to)) {
       minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
       }
       if (is_pinf<To_Policy>(to)) {
       pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
       }
     native:
       return sub_mul<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
@@ -12200,7 +12241,7 @@ sub_mul_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 div_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
@@ -12209,22 +12250,22 @@ div_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
     return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
   if (is_minf<From1_Policy>(x)) {
     if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y)))
+                || is_pinf<From2_Policy>(y)))
       goto inf_div_inf;
     else {
       switch (sgn<From2_Policy>(y)) {
       case VR_LT:
-	goto pinf;
+        goto pinf;
       case VR_GT:
-	goto minf;
+        goto minf;
       default:
-	goto div_zero;
+        goto div_zero;
       }
     }
   }
   else if (is_pinf<From1_Policy>(x)) {
     if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y))) {
+                || is_pinf<From2_Policy>(y))) {
     inf_div_inf:
       return assign_nan<To_Policy>(to, V_INF_DIV_INF);
     }
@@ -12232,14 +12273,14 @@ div_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
       switch (sgn<From2_Policy>(y)) {
       case VR_LT:
       minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
       case VR_GT:
       pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
       default:
       div_zero:
-	PPL_ASSERT(To_Policy::check_div_zero);
-	return assign_nan<To_Policy>(to, V_DIV_ZERO);
+        PPL_ASSERT(To_Policy::check_div_zero);
+        return assign_nan<To_Policy>(to, V_DIV_ZERO);
       }
     }
   }
@@ -12257,7 +12298,7 @@ div_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 idiv_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
@@ -12266,22 +12307,22 @@ idiv_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
     return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
   if (is_minf<From1_Policy>(x)) {
     if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y)))
+                || is_pinf<From2_Policy>(y)))
       goto inf_div_inf;
     else {
       switch (sgn<From2_Policy>(y)) {
       case VR_LT:
-	goto pinf;
+        goto pinf;
       case VR_GT:
-	goto minf;
+        goto minf;
       default:
-	goto div_zero;
+        goto div_zero;
       }
     }
   }
   else if (is_pinf<From1_Policy>(x)) {
     if (CHECK_P(To_Policy::check_inf_div_inf, is_minf<From2_Policy>(y)
-		|| is_pinf<From2_Policy>(y))) {
+                || is_pinf<From2_Policy>(y))) {
     inf_div_inf:
       return assign_nan<To_Policy>(to, V_INF_DIV_INF);
     }
@@ -12289,14 +12330,14 @@ idiv_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
       switch (sgn<From2_Policy>(y)) {
       case VR_LT:
       minf:
-	return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_MINUS_INFINITY, dir);
       case VR_GT:
       pinf:
-	return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
+        return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
       default:
       div_zero:
-	PPL_ASSERT(To_Policy::check_div_zero);
-	return assign_nan<To_Policy>(to, V_DIV_ZERO);
+        PPL_ASSERT(To_Policy::check_div_zero);
+        return assign_nan<To_Policy>(to, V_DIV_ZERO);
       }
     }
   }
@@ -12314,7 +12355,7 @@ idiv_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 rem_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (!ext_to_handle<From1_Policy>(x) && !ext_to_handle<From2_Policy>(y))
@@ -12322,7 +12363,7 @@ rem_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
     return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
   else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From1_Policy>(x)
-		   || is_pinf<From1_Policy>(x))) {
+                   || is_pinf<From1_Policy>(x))) {
     return assign_nan<To_Policy>(to, V_INF_MOD);
   }
   else {
@@ -12338,7 +12379,7 @@ rem_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 add_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12356,7 +12397,7 @@ add_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 sub_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12374,7 +12415,7 @@ sub_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 mul_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12392,7 +12433,7 @@ mul_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 div_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12410,7 +12451,7 @@ div_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 smod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12418,7 +12459,7 @@ smod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (is_nan<From_Policy>(x))
     return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
   else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From_Policy>(x)
-		   || is_pinf<From_Policy>(x))) {
+                   || is_pinf<From_Policy>(x))) {
     return assign_nan<To_Policy>(to, V_INF_MOD);
   }
   else {
@@ -12428,7 +12469,7 @@ smod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 umod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12436,7 +12477,7 @@ umod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
   if (is_nan<From_Policy>(x))
     return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
   else if (CHECK_P(To_Policy::check_inf_mod, is_minf<From_Policy>(x)
-		   || is_pinf<From_Policy>(x))) {
+                   || is_pinf<From_Policy>(x))) {
     return assign_nan<To_Policy>(to, V_INF_MOD);
   }
   else {
@@ -12446,7 +12487,7 @@ umod_2exp_ext(To& to, const From& x, unsigned int exp, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From_Policy,
-	  typename To, typename From>
+          typename To, typename From>
 inline Result
 sqrt_ext(To& to, const From& x, Rounding_Dir dir) {
   if (!ext_to_handle<From_Policy>(x))
@@ -12465,7 +12506,7 @@ sqrt_ext(To& to, const From& x, Rounding_Dir dir) {
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 gcd_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
@@ -12479,12 +12520,12 @@ gcd_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
 }
 
 template <typename To1_Policy, typename To2_Policy, typename To3_Policy,
-	  typename From1_Policy, typename From2_Policy,
-	  typename To1, typename To2, typename To3,
-	  typename From1, typename From2>
+          typename From1_Policy, typename From2_Policy,
+          typename To1, typename To2, typename To3,
+          typename From1, typename From2>
 inline Result
 gcdext_ext(To1& to, To2& s, To3& t, const From1& x, const From2& y,
-	   Rounding_Dir dir) {
+           Rounding_Dir dir) {
   if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
     return assign_special<To1_Policy>(to, VC_NAN, ROUND_IGNORE);
   else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x)) {
@@ -12502,20 +12543,20 @@ gcdext_ext(To1& to, To2& s, To3& t, const From1& x, const From2& y,
 }
 
 template <typename To_Policy, typename From1_Policy, typename From2_Policy,
-	  typename To, typename From1, typename From2>
+          typename To, typename From1, typename From2>
 inline Result
 lcm_ext(To& to, const From1& x, const From2& y, Rounding_Dir dir) {
   if (is_nan<From1_Policy>(x) || is_nan<From2_Policy>(y))
     return assign_special<To_Policy>(to, VC_NAN, ROUND_IGNORE);
   else if (is_minf<From1_Policy>(x) || is_pinf<From1_Policy>(x)
-	   || is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y))
+           || is_minf<From2_Policy>(y) || is_pinf<From2_Policy>(y))
     return assign_special<To_Policy>(to, VC_PLUS_INFINITY, dir);
   else
     return lcm<To_Policy, From1_Policy, From2_Policy>(to, x, y, dir);
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline Result_Relation
 cmp_ext(const Type1& x, const Type2& y) {
   if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
@@ -12537,7 +12578,7 @@ cmp_ext(const Type1& x, const Type2& y) {
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 lt_ext(const Type1& x, const Type2& y) {
   if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
@@ -12553,14 +12594,14 @@ lt_ext(const Type1& x, const Type2& y) {
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 gt_ext(const Type1& x, const Type2& y) {
   return lt_ext<Policy1, Policy2>(y, x);
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 le_ext(const Type1& x, const Type2& y) {
   if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
@@ -12576,14 +12617,14 @@ le_ext(const Type1& x, const Type2& y) {
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 ge_ext(const Type1& x, const Type2& y) {
   return le_ext<Policy1, Policy2>(y, x);
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 eq_ext(const Type1& x, const Type2& y) {
   if (!ext_to_handle<Policy1>(x) && !ext_to_handle<Policy2>(y))
@@ -12601,7 +12642,7 @@ eq_ext(const Type1& x, const Type2& y) {
 }
 
 template <typename Policy1, typename Policy2,
-	  typename Type1, typename Type2>
+          typename Type1, typename Type2>
 inline bool
 ne_ext(const Type1& x, const Type2& y) {
   return !eq_ext<Policy1, Policy2>(x, y);
@@ -12610,7 +12651,7 @@ ne_ext(const Type1& x, const Type2& y) {
 template <typename Policy, typename Type>
 inline Result
 output_ext(std::ostream& os, const Type& x,
-	   const Numeric_Format& format, Rounding_Dir dir) {
+           const Numeric_Format& format, Rounding_Dir dir) {
   if (!ext_to_handle<Policy>(x))
     goto native;
   if (is_nan<Policy>(x)) {
@@ -12639,7 +12680,7 @@ input_ext(To& to, std::istream& is, Rounding_Dir dir) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/checked.defs.hh line 706. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_defs.hh line 706. */
 
 #undef nonconst
 #ifdef PPL_SAVED_nonconst
@@ -12650,7 +12691,7 @@ input_ext(To& to, std::istream& is, Rounding_Dir dir) {
 #undef PPL_FUNCTION_CLASS
 #undef PPL_NAN
 
-/* Automatically generated from PPL source file ../src/Checked_Number.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_defs.hh line 31. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -12978,7 +13019,7 @@ public:
   //! Add and assign operator.
   template <typename From>
   typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
+                     Checked_Number<T, Policy>&>::type
   operator+=(const From& y);
 
   //! Subtract and assign operator.
@@ -12991,7 +13032,7 @@ public:
   //! Subtract and assign operator.
   template <typename From>
   typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
+                     Checked_Number<T, Policy>&>::type
   operator-=(const From& y);
 
   //! Multiply and assign operator.
@@ -13004,7 +13045,7 @@ public:
   //! Multiply and assign operator.
   template <typename From>
   typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
+                     Checked_Number<T, Policy>&>::type
   operator*=(const From& y);
 
   //! Divide and assign operator.
@@ -13017,7 +13058,7 @@ public:
   //! Divide and assign operator.
   template <typename From>
   typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>&>::type
+                     Checked_Number<T, Policy>&>::type
   operator/=(const From& y);
 
   //! Compute remainder and assign operator.
@@ -13030,7 +13071,7 @@ public:
   //! Compute remainder and assign operator.
   template <typename From>
   typename Enable_If<Is_Native_Or_Checked<From>::value,
-		     Checked_Number<T, Policy>& >::type
+                     Checked_Number<T, Policy>& >::type
   operator%=(const From& y);
 
   //@} // Assignment Operators
@@ -13165,12 +13206,12 @@ PPL_DECLARE_FUNC2(sub_mul_assign_r)
 
 #define PPL_DECLARE_FUNC4(name) \
 template <typename To1, typename To2, typename To3, \
-	  typename From1, typename From2> \
+          typename From1, typename From2> \
 typename Enable_If<Is_Native_Or_Checked<To1>::value \
                    && Is_Native_Or_Checked<To2>::value \
                    && Is_Native_Or_Checked<To3>::value \
                    && Is_Native_Or_Checked<From1>::value \
-		   && Is_Native_Or_Checked<From2>::value, \
+                   && Is_Native_Or_Checked<From2>::value, \
                    Result>::type \
  PPL_U(name)(To1& to, To2& s, To3& t,     \
      const From1& x, const From2& y, \
@@ -13282,24 +13323,24 @@ abs_assign(Checked_Number<T, Policy>& x, const Checked_Number<T, Policy>& y);
 template <typename T, typename Policy>
 void
 add_mul_assign(Checked_Number<T, Policy>& x,
-	       const Checked_Number<T, Policy>& y,
-	       const Checked_Number<T, Policy>& z);
+               const Checked_Number<T, Policy>& y,
+               const Checked_Number<T, Policy>& z);
 
 //! Assigns to \p x the value <CODE>x - y * z</CODE>.
 /*! \relates Checked_Number */
 template <typename T, typename Policy>
 void
 sub_mul_assign(Checked_Number<T, Policy>& x,
-	       const Checked_Number<T, Policy>& y,
-	       const Checked_Number<T, Policy>& z);
+               const Checked_Number<T, Policy>& y,
+               const Checked_Number<T, Policy>& z);
 
 //! Assigns to \p x the greatest common divisor of \p y and \p z.
 /*! \relates Checked_Number */
 template <typename T, typename Policy>
 void
 gcd_assign(Checked_Number<T, Policy>& x,
-	   const Checked_Number<T, Policy>& y,
-	   const Checked_Number<T, Policy>& z);
+           const Checked_Number<T, Policy>& y,
+           const Checked_Number<T, Policy>& z);
 
 /*! \brief
   Assigns to \p x the greatest common divisor of \p y and \p z,
@@ -13309,18 +13350,18 @@ gcd_assign(Checked_Number<T, Policy>& x,
 template <typename T, typename Policy>
 void
 gcdext_assign(Checked_Number<T, Policy>& x,
-	      Checked_Number<T, Policy>& s,
-	      Checked_Number<T, Policy>& t,
-	      const Checked_Number<T, Policy>& y,
-	      const Checked_Number<T, Policy>& z);
+              Checked_Number<T, Policy>& s,
+              Checked_Number<T, Policy>& t,
+              const Checked_Number<T, Policy>& y,
+              const Checked_Number<T, Policy>& z);
 
 //! Assigns to \p x the least common multiple of \p y and \p z.
 /*! \relates Checked_Number */
 template <typename T, typename Policy>
 void
 lcm_assign(Checked_Number<T, Policy>& x,
-	   const Checked_Number<T, Policy>& y,
-	   const Checked_Number<T, Policy>& z);
+           const Checked_Number<T, Policy>& y,
+           const Checked_Number<T, Policy>& z);
 
 //! Assigns to \p x the value \f$ y \cdot 2^\mathtt{exp} \f$.
 /*! \relates Checked_Number */
@@ -13348,14 +13389,14 @@ div_2exp_assign(Checked_Number<T, Policy>& x,
 template <typename T, typename Policy>
 void
 exact_div_assign(Checked_Number<T, Policy>& x,
-		 const Checked_Number<T, Policy>& y,
-		 const Checked_Number<T, Policy>& z);
+                 const Checked_Number<T, Policy>& y,
+                 const Checked_Number<T, Policy>& z);
 
 //! Assigns to \p x the integer square root of \p y.
 /*! \relates Checked_Number */
 template <typename T, typename Policy>
 void sqrt_assign(Checked_Number<T, Policy>& x,
-		 const Checked_Number<T, Policy>& y);
+                 const Checked_Number<T, Policy>& y);
 
 //@} // Arithmetic Operators
 
@@ -13370,14 +13411,14 @@ inline
 typename Enable_If<Is_Native_Or_Checked<T1>::value
                    && Is_Native_Or_Checked<T2>::value
                    && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
+                   bool>::type
 operator==(const T1& x, const T2& y);
 
 /*! \relates Checked_Number */
 template <typename T1, typename T2>
 inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
 equal(const T1& x, const T2& y);
 
 //! Disequality operator.
@@ -13387,14 +13428,14 @@ inline
 typename Enable_If<Is_Native_Or_Checked<T1>::value
                    && Is_Native_Or_Checked<T2>::value
                    && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
+                   bool>::type
 operator!=(const T1& x, const T2& y);
 
 /*! \relates Checked_Number */
 template <typename T1, typename T2>
 inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
 not_equal(const T1& x, const T2& y);
 
 //! Greater than or equal to operator.
@@ -13404,14 +13445,14 @@ inline
 typename Enable_If<Is_Native_Or_Checked<T1>::value
                    && Is_Native_Or_Checked<T2>::value
                    && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
+                   bool>::type
 operator>=(const T1& x, const T2& y);
 
 /*! \relates Checked_Number */
 template <typename T1, typename T2>
 inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
 greater_or_equal(const T1& x, const T2& y);
 
 //! Greater than operator.
@@ -13421,14 +13462,14 @@ inline
 typename Enable_If<Is_Native_Or_Checked<T1>::value
                    && Is_Native_Or_Checked<T2>::value
                    && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
+                   bool>::type
 operator>(const T1& x, const T2& y);
 
 /*! \relates Checked_Number */
 template <typename T1, typename T2>
 inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
 greater_than(const T1& x, const T2& y);
 
 //! Less than or equal to operator.
@@ -13438,14 +13479,14 @@ inline
 typename Enable_If<Is_Native_Or_Checked<T1>::value
                    && Is_Native_Or_Checked<T2>::value
                    && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
+                   bool>::type
 operator<=(const T1& x, const T2& y);
 
 /*! \relates Checked_Number */
 template <typename T1, typename T2>
 inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
 less_or_equal(const T1& x, const T2& y);
 
 //! Less than operator.
@@ -13455,14 +13496,14 @@ inline
 typename Enable_If<Is_Native_Or_Checked<T1>::value
                    && Is_Native_Or_Checked<T2>::value
                    && (Is_Checked<T1>::value || Is_Checked<T2>::value),
-		   bool>::type
+                   bool>::type
 operator<(const T1& x, const T2& y);
 
 /*! \relates Checked_Number */
 template <typename T1, typename T2>
 inline typename Enable_If<Is_Native_Or_Checked<T1>::value
-			  && Is_Native_Or_Checked<T2>::value,
-			  bool>::type
+                          && Is_Native_Or_Checked<T2>::value,
+                          bool>::type
 less_than(const T1& x, const T2& y);
 
 /*! \brief
@@ -13597,44 +13638,44 @@ ascii_dump(std::ostream& s, const T& t);
   (if such a delimiter is desired, it has to be written as <CODE>*^</CODE>).
 
 \code
-number	: NAN					INF	: 'inf'
-	| SIGN INF					;
-	| INF
-	| num					NAN	: 'nan'
-	| num DIV num					;
-	;
-						SIGN	: '-'
-num     : u_num						| '+'
-        | SIGN u_num					;
-
-u_num	: u_num1				EXP	: 'e'
-	| HEX u_num1					| 'p'
-	| base BASE u_num1				| '*^'
-	;                                               ;
-						POINT	: '.'
-u_num1	: mantissa					;
-	| mantissa EXP exponent
-	;					DIV	: '/'
-							;
+number  : NAN                                   INF     : 'inf'
+        | SIGN INF                                      ;
+        | INF
+        | num                                   NAN     : 'nan'
+        | num DIV num                                   ;
+        ;
+                                                SIGN    : '-'
+num     : u_num                                         | '+'
+        | SIGN u_num                                    ;
+
+u_num   : u_num1                                EXP     : 'e'
+        | HEX u_num1                                    | 'p'
+        | base BASE u_num1                              | '*^'
+        ;                                               ;
+                                                POINT   : '.'
+u_num1  : mantissa                                      ;
+        | mantissa EXP exponent
+        ;                                       DIV     : '/'
+                                                        ;
 mantissa: bdigits
-        | POINT bdigits				MINUS	: '-'
-	| bdigits POINT					;
-	| bdigits POINT bdigits
-	;					PLUS	: '+'
-						;
+        | POINT bdigits                         MINUS   : '-'
+        | bdigits POINT                                 ;
+        | bdigits POINT bdigits
+        ;                                       PLUS    : '+'
+                                                ;
 exponent: SIGN digits
-	| digits				HEX	: '0x'
-	;					;
-
-bdigits : BDIGIT				BASE	: '^^'
-	| bdigits BDIGIT				;
-	;
-						DIGIT   : '0' .. '9'
-digits  : DIGIT						;
-	| digits DIGIT
-	;					BDIGIT  : '0' .. '9'
-							| 'a' .. 'z'
-							;
+        | digits                                HEX     : '0x'
+        ;                                       ;
+
+bdigits : BDIGIT                                BASE    : '^^'
+        | bdigits BDIGIT                                ;
+        ;
+                                                DIGIT   : '0' .. '9'
+digits  : DIGIT                                         ;
+        | digits DIGIT
+        ;                                       BDIGIT  : '0' .. '9'
+                                                        | 'a' .. 'z'
+                                                        ;
 \endcode
 */
 template <typename T>
@@ -13685,12 +13726,12 @@ int maybe_check_fpu_inexact();
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Checked_Number.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_inlines.hh line 1. */
 /* Checked_Number class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Checked_Number.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_inlines.hh line 28. */
 #include <stdexcept>
 #include <sstream>
 
@@ -13751,14 +13792,14 @@ template <typename From, typename From_Policy>
 inline
 Checked_Number<T, Policy>
 ::Checked_Number(const Checked_Number<From, From_Policy>& y,
-		 Rounding_Dir dir) {
+                 Rounding_Dir dir) {
   // TODO: avoid default construction of value member.
   Policy::handle_result(check_result(Checked::assign_ext<Policy, From_Policy>
-				     (v,
-				      y.raw_value(),
-				      rounding_dir(dir)),
-				     dir)
-			);
+                                     (v,
+                                      y.raw_value(),
+                                      rounding_dir(dir)),
+                                     dir)
+                        );
 }
 
 template <typename T, typename Policy>
@@ -13769,10 +13810,10 @@ Checked_Number<T, Policy>
   // TODO: avoid default construction of value member.
   Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
   Policy::handle_result(check_result(Checked::assign_ext<Policy, From_Policy>
-				     (v,
-				      y.raw_value(),
-				      rounding_dir(dir)),
-				     dir));
+                                     (v,
+                                      y.raw_value(),
+                                      rounding_dir(dir)),
+                                     dir));
 }
 
 // TODO: avoid default construction of value member.
@@ -13780,21 +13821,21 @@ Checked_Number<T, Policy>
 template <typename T, typename Policy> \
 inline \
 Checked_Number<T, Policy>::Checked_Number(const type y, Rounding_Dir dir) { \
-  Policy::handle_result							\
+  Policy::handle_result                                                 \
     (check_result(Checked::assign_ext<Policy,                           \
                                       Checked_Number_Transparent_Policy<PPL_U(type)> > \
-		  (v, y, rounding_dir(dir)),				\
-		  dir));						\
-}									\
-template <typename T, typename Policy>					\
-inline									\
-Checked_Number<T, Policy>::Checked_Number(const type y) {		\
-  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;			\
-  Policy::handle_result							\
+                  (v, y, rounding_dir(dir)),                            \
+                  dir));                                                \
+}                                                                       \
+template <typename T, typename Policy>                                  \
+inline                                                                  \
+Checked_Number<T, Policy>::Checked_Number(const type y) {               \
+  Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;                 \
+  Policy::handle_result                                                 \
     (check_result(Checked::assign_ext<Policy,                           \
                                       Checked_Number_Transparent_Policy<PPL_U(type)> > \
-		  (v, y, rounding_dir(dir)),				\
-		  dir));						\
+                  (v, y, rounding_dir(dir)),                            \
+                  dir));                                                \
 }
 
 PPL_DEFINE_CTOR(char)
@@ -13828,9 +13869,9 @@ inline
 Checked_Number<T, Policy>::Checked_Number(const char* y, Rounding_Dir dir) {
   std::istringstream s(y);
   Policy::handle_result(check_result(Checked::input<Policy>(v,
-							    s,
-							    rounding_dir(dir)),
-				     dir));
+                                                            s,
+                                                            rounding_dir(dir)),
+                                     dir));
 }
 
 template <typename T, typename Policy>
@@ -13839,9 +13880,9 @@ Checked_Number<T, Policy>::Checked_Number(const char* y) {
   std::istringstream s(y);
   Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
   Policy::handle_result(check_result(Checked::input<Policy>(v,
-							    s,
-							    rounding_dir(dir)),
-				     dir));
+                                                            s,
+                                                            rounding_dir(dir)),
+                                     dir));
 }
 
 template <typename T, typename Policy>
@@ -13863,9 +13904,9 @@ inline
 Checked_Number<T, Policy>::Checked_Number(const From&, typename Enable_If<Is_Special<From>::value, bool>::type) {
   Rounding_Dir dir = Policy::ROUND_DEFAULT_CONSTRUCTOR;
   Policy::handle_result(check_result(Checked::assign_special<Policy>(v,
-							    From::vclass,
-							    rounding_dir(dir)),
-				     dir));
+                                                            From::vclass,
+                                                            rounding_dir(dir)),
+                                     dir));
 }
 
 template <typename To, typename From>
@@ -13873,20 +13914,20 @@ inline typename Enable_If<Is_Native_Or_Checked<To>::value
                           && Is_Special<From>::value, Result>::type
 assign_r(To& to, const From&, Rounding_Dir dir) {
   return check_result(Checked::assign_special<typename Native_Checked_To_Wrapper<To>
-		      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
-				From::vclass,
-				rounding_dir(dir)),
-		      dir);
+                      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
+                                From::vclass,
+                                rounding_dir(dir)),
+                      dir);
 }
 
 template <typename To, typename From>
 inline typename Enable_If<Is_Native_Or_Checked<To>::value && Is_Special<From>::value, Result>::type
 construct(To& to, const From&, Rounding_Dir dir) {
   return check_result(Checked::construct_special<typename Native_Checked_To_Wrapper<To>
-		      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
-				From::vclass,
-				rounding_dir(dir)),
-		      dir);
+                      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
+                                From::vclass,
+                                rounding_dir(dir)),
+                      dir);
 }
 
 template <typename T>
@@ -14007,25 +14048,25 @@ inline typename Enable_If<Is_Native_Or_Checked<To>::value, Result>::type
 assign_r(To& to, const char* x, Rounding_Dir dir) {
   std::istringstream s(x);
   return check_result(Checked::input<typename Native_Checked_To_Wrapper<To>
-		      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
-				s,
-				rounding_dir(dir)),
-		      dir);
+                      ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to),
+                                s,
+                                rounding_dir(dir)),
+                      dir);
 }
 
 #define PPL_DEFINE_FUNC1_A(name, func) \
-template <typename To, typename From>					\
+template <typename To, typename From>                                   \
 inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
                           && Is_Native_Or_Checked<From>::value,         \
                           Result>::type                                 \
  PPL_U(name)(To& to, const From& x, Rounding_Dir dir) {                 \
-  return								\
-    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>	\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From>		\
-		 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
-			   Native_Checked_From_Wrapper<From>::raw_value(x), \
-			   rounding_dir(dir)), dir);			\
+  return                                                                \
+    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>   \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From>             \
+                 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
+                           Native_Checked_From_Wrapper<From>::raw_value(x), \
+                           rounding_dir(dir)), dir);                    \
 }
 
 PPL_DEFINE_FUNC1_A(construct, construct_ext)
@@ -14040,20 +14081,20 @@ PPL_DEFINE_FUNC1_A(sqrt_assign_r, sqrt_ext)
 #undef PPL_DEFINE_FUNC1_A
 
 #define PPL_DEFINE_FUNC1_B(name, func) \
-template <typename To, typename From>					\
-inline typename Enable_If<Is_Native_Or_Checked<To>::value		\
+template <typename To, typename From>                                   \
+inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
                           && Is_Native_Or_Checked<From>::value,         \
-                          Result>::type					\
+                          Result>::type                                 \
  PPL_U(name)(To& to, const From& x, unsigned int exp, Rounding_Dir dir) { \
-  return								\
-    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>	\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From>		\
-		 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
-			   Native_Checked_From_Wrapper<From>::raw_value(x), \
-			   exp,						\
-			   rounding_dir(dir)),				\
-		 dir);							\
+  return                                                                \
+    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>   \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From>             \
+                 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
+                           Native_Checked_From_Wrapper<From>::raw_value(x), \
+                           exp,                                         \
+                           rounding_dir(dir)),                          \
+                 dir);                                                  \
 }
 
 PPL_DEFINE_FUNC1_B(add_2exp_assign_r, add_2exp_ext)
@@ -14066,23 +14107,23 @@ PPL_DEFINE_FUNC1_B(umod_2exp_assign_r, umod_2exp_ext)
 #undef PPL_DEFINE_FUNC1_B
 
 #define PPL_DEFINE_FUNC2(name, func) \
-template <typename To, typename From1, typename From2>			\
-inline typename Enable_If<Is_Native_Or_Checked<To>::value		\
+template <typename To, typename From1, typename From2>                  \
+inline typename Enable_If<Is_Native_Or_Checked<To>::value               \
                           && Is_Native_Or_Checked<From1>::value         \
                           && Is_Native_Or_Checked<From2>::value,        \
-                          Result>::type					\
+                          Result>::type                                 \
  PPL_U(name)(To& to, const From1& x, const From2& y, Rounding_Dir dir) { \
-  return								\
-    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>	\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From1>		\
-		 ::Policy,						\
-		 typename Native_Checked_From_Wrapper<From2>		\
-		 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
-			   Native_Checked_From_Wrapper<From1>::raw_value(x), \
-			   Native_Checked_From_Wrapper<From2>::raw_value(y), \
-			   rounding_dir(dir)),				\
-		 dir);							\
+  return                                                                \
+    check_result(Checked::func<typename Native_Checked_To_Wrapper<To>   \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From1>            \
+                 ::Policy,                                              \
+                 typename Native_Checked_From_Wrapper<From2>            \
+                 ::Policy>(Native_Checked_To_Wrapper<To>::raw_value(to), \
+                           Native_Checked_From_Wrapper<From1>::raw_value(x), \
+                           Native_Checked_From_Wrapper<From2>::raw_value(y), \
+                           rounding_dir(dir)),                          \
+                 dir);                                                  \
 }
 
 PPL_DEFINE_FUNC2(add_assign_r, add_ext)
@@ -14099,33 +14140,33 @@ PPL_DEFINE_FUNC2(sub_mul_assign_r, sub_mul_ext)
 #undef PPL_DEFINE_FUNC2
 
 #define PPL_DEFINE_FUNC4(name, func)                                    \
-template <typename To1,							\
-          typename To2,							\
-	  typename To3,							\
-          typename From1,						\
-          typename From2>						\
-inline typename Enable_If<Is_Native_Or_Checked<To1>::value		\
+template <typename To1,                                                 \
+          typename To2,                                                 \
+          typename To3,                                                 \
+          typename From1,                                               \
+          typename From2>                                               \
+inline typename Enable_If<Is_Native_Or_Checked<To1>::value              \
                           && Is_Native_Or_Checked<To2>::value           \
                           && Is_Native_Or_Checked<To3>::value           \
                           && Is_Native_Or_Checked<From1>::value         \
                           && Is_Native_Or_Checked<From2>::value,        \
-                          Result>::type					\
+                          Result>::type                                 \
  PPL_U(name)(To1& to, To2& s, To3& t, const From1& x, const From2& y,   \
-     Rounding_Dir dir) {						\
-  return								\
-    check_result							\
-    (Checked::func<typename Native_Checked_To_Wrapper<To1>::Policy,	\
-                   typename Native_Checked_To_Wrapper<To2>::Policy,	\
-                   typename Native_Checked_To_Wrapper<To3>::Policy,	\
-                   typename Native_Checked_From_Wrapper<From1>::Policy,	\
-                   typename Native_Checked_From_Wrapper<From2>::Policy>	\
-     (Native_Checked_To_Wrapper<To1>::raw_value(to),			\
-      Native_Checked_To_Wrapper<To2>::raw_value(s),			\
-      Native_Checked_To_Wrapper<To3>::raw_value(t),			\
-      Native_Checked_From_Wrapper<From1>::raw_value(x),			\
-      Native_Checked_From_Wrapper<From2>::raw_value(y),			\
-      rounding_dir(dir)),						\
-     dir);								\
+     Rounding_Dir dir) {                                                \
+  return                                                                \
+    check_result                                                        \
+    (Checked::func<typename Native_Checked_To_Wrapper<To1>::Policy,     \
+                   typename Native_Checked_To_Wrapper<To2>::Policy,     \
+                   typename Native_Checked_To_Wrapper<To3>::Policy,     \
+                   typename Native_Checked_From_Wrapper<From1>::Policy, \
+                   typename Native_Checked_From_Wrapper<From2>::Policy> \
+     (Native_Checked_To_Wrapper<To1>::raw_value(to),                    \
+      Native_Checked_To_Wrapper<To2>::raw_value(s),                     \
+      Native_Checked_To_Wrapper<To3>::raw_value(t),                     \
+      Native_Checked_From_Wrapper<From1>::raw_value(x),                 \
+      Native_Checked_From_Wrapper<From2>::raw_value(y),                 \
+      rounding_dir(dir)),                                               \
+     dir);                                                              \
 }
 
 PPL_DEFINE_FUNC4(gcdext_assign_r, gcdext_ext)
@@ -14137,7 +14178,7 @@ template <typename T, typename Policy> \
 inline Checked_Number<T, Policy>& \
 Checked_Number<T, Policy>::f() { \
   Policy::handle_result((fun)(*this, *this, T(1),             \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
   return *this; \
 } \
 template <typename T, typename Policy> \
@@ -14145,7 +14186,7 @@ inline Checked_Number<T, Policy> \
 Checked_Number<T, Policy>::f(int) {\
   T r = v;\
   Policy::handle_result((fun)(*this, *this, T(1),             \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
   return r;\
 }
 
@@ -14174,14 +14215,14 @@ template <typename From_Policy> \
 inline Checked_Number<T, Policy>& \
 Checked_Number<T, Policy>::f(const Checked_Number<T, From_Policy>& y) { \
   Policy::handle_result((fun)(*this, *this, y,                          \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
   return *this; \
 } \
 template <typename T, typename Policy> \
 inline Checked_Number<T, Policy>& \
 Checked_Number<T, Policy>::f(const T& y) { \
   Policy::handle_result((fun)(*this, *this, y,                \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
   return *this; \
 } \
 template <typename T, typename Policy> \
@@ -14191,7 +14232,7 @@ inline typename Enable_If<Is_Native_Or_Checked<From>::value, \
 Checked_Number<T, Policy>::f(const From& y) { \
   Checked_Number<T, Policy> cy(y); \
   Policy::handle_result((fun)(*this, *this, cy,               \
-			    Policy::ROUND_DEFAULT_OPERATOR)); \
+                            Policy::ROUND_DEFAULT_OPERATOR)); \
   return *this; \
 }
 
@@ -14212,7 +14253,7 @@ inline Checked_Number<T, Policy> \
   Policy::handle_result((fun)(r, x, y, Policy::ROUND_DEFAULT_OPERATOR)); \
   return r; \
 } \
-template <typename Type, typename T, typename Policy>	\
+template <typename Type, typename T, typename Policy>   \
 inline \
 typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
  PPL_U(f)(const Type& x, const Checked_Number<T, Policy>& y) {          \
@@ -14220,7 +14261,7 @@ typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
   Policy::handle_result((fun)(r, r, y, Policy::ROUND_DEFAULT_OPERATOR)); \
   return r; \
 } \
-template <typename T, typename Policy, typename Type>	\
+template <typename T, typename Policy, typename Type>   \
 inline \
 typename Enable_If<Is_Native<Type>::value, Checked_Number<T, Policy> >::type \
  PPL_U(f)(const Checked_Number<T, Policy>& x, const Type& y) {          \
@@ -14238,17 +14279,17 @@ PPL_DEFINE_BINARY_OP(operator %, rem_assign_r)
 #undef PPL_DEFINE_BINARY_OP
 
 #define PPL_DEFINE_COMPARE_OP(f, fun)                                   \
-template <typename T1, typename T2>					\
-inline									\
+template <typename T1, typename T2>                                     \
+inline                                                                  \
 typename Enable_If<Is_Native_Or_Checked<T1>::value                      \
                    && Is_Native_Or_Checked<T2>::value                   \
-                   && (Is_Checked<T1>::value || Is_Checked<T2>::value),	\
-		   bool>::type						\
+                   && (Is_Checked<T1>::value || Is_Checked<T2>::value), \
+                   bool>::type                                          \
  PPL_U(f)(const T1& x, const T2& y) {                                   \
-  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy,	\
-    		      typename Native_Checked_From_Wrapper<T2>::Policy>	\
-    (Native_Checked_From_Wrapper<T1>::raw_value(x),			\
-     Native_Checked_From_Wrapper<T2>::raw_value(y));			\
+  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy, \
+                      typename Native_Checked_From_Wrapper<T2>::Policy> \
+    (Native_Checked_From_Wrapper<T1>::raw_value(x),                     \
+     Native_Checked_From_Wrapper<T2>::raw_value(y));                    \
 }
 
 PPL_DEFINE_COMPARE_OP(operator ==, eq_ext)
@@ -14261,15 +14302,15 @@ PPL_DEFINE_COMPARE_OP(operator <, lt_ext)
 #undef PPL_DEFINE_COMPARE_OP
 
 #define PPL_DEFINE_COMPARE(f, fun)                                      \
-template <typename T1, typename T2>					\
-inline typename Enable_If<Is_Native_Or_Checked<T1>::value		\
-			  && Is_Native_Or_Checked<T2>::value,		\
-                          bool>::type					\
+template <typename T1, typename T2>                                     \
+inline typename Enable_If<Is_Native_Or_Checked<T1>::value               \
+                          && Is_Native_Or_Checked<T2>::value,           \
+                          bool>::type                                   \
  PPL_U(f)(const T1& x, const T2& y) {                                   \
-  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy,	\
-    		      typename Native_Checked_From_Wrapper<T2>::Policy>	\
-    (Native_Checked_From_Wrapper<T1>::raw_value(x),			\
-     Native_Checked_From_Wrapper<T2>::raw_value(y));			\
+  return Checked::fun<typename Native_Checked_From_Wrapper<T1>::Policy, \
+                      typename Native_Checked_From_Wrapper<T2>::Policy> \
+    (Native_Checked_From_Wrapper<T1>::raw_value(x),                     \
+     Native_Checked_From_Wrapper<T2>::raw_value(y));                    \
 }
 
 PPL_DEFINE_COMPARE(equal, eq_ext)
@@ -14301,7 +14342,7 @@ operator-(const Checked_Number<T, Policy>& x) {
 template <typename T, typename Policy> \
 inline void \
  PPL_U(f)(Checked_Number<T, Policy>& x) {                               \
-  Policy::handle_result((fun)(x, x, Policy::ROUND_DEFAULT_FUNCTION));	\
+  Policy::handle_result((fun)(x, x, Policy::ROUND_DEFAULT_FUNCTION));   \
 }
 
 #define PPL_DEFINE_ASSIGN_FUN2_2(f, fun) \
@@ -14319,13 +14360,13 @@ inline void \
   Policy::handle_result((fun)(x, y, z, Policy::ROUND_DEFAULT_FUNCTION)); \
 }
 
-#define PPL_DEFINE_ASSIGN_FUN5_5(f, fun)					\
-template <typename T, typename Policy>					\
-inline void								\
+#define PPL_DEFINE_ASSIGN_FUN5_5(f, fun)                                        \
+template <typename T, typename Policy>                                  \
+inline void                                                             \
  PPL_U(f)(Checked_Number<T, Policy>& x,                                 \
-  Checked_Number<T, Policy>& s, Checked_Number<T, Policy>& t,		\
-  const Checked_Number<T, Policy>& y,					\
-  const Checked_Number<T, Policy>& z) {					\
+  Checked_Number<T, Policy>& s, Checked_Number<T, Policy>& t,           \
+  const Checked_Number<T, Policy>& y,                                   \
+  const Checked_Number<T, Policy>& z) {                                 \
   Policy::handle_result((fun)(x, s, t, y, z, Policy::ROUND_DEFAULT_FUNCTION)); \
 }
 
@@ -14364,9 +14405,9 @@ PPL_DEFINE_ASSIGN_FUN3_3(lcm_assign, lcm_assign_r)
 #undef PPL_DEFINE_ASSIGN_FUN3_3
 #undef PPL_DEFINE_ASSIGN_FUN5_5
 
-#define PPL_DEFINE_ASSIGN_2EXP(f, fun)					\
+#define PPL_DEFINE_ASSIGN_2EXP(f, fun)                                  \
 template <typename T, typename Policy>                                  \
-inline void								\
+inline void                                                             \
  PPL_U(f)(Checked_Number<T, Policy>& x,                                 \
           const Checked_Number<T, Policy>& y, unsigned int exp) {       \
   Policy::handle_result((fun)(x, y, exp, Policy::ROUND_DEFAULT_FUNCTION)); \
@@ -14378,8 +14419,8 @@ PPL_DEFINE_ASSIGN_2EXP(div_2exp_assign, div_2exp_assign_r)
 template <typename T, typename Policy>
 inline void
 exact_div_assign(Checked_Number<T, Policy>& x,
-		 const Checked_Number<T, Policy>& y,
-		 const Checked_Number<T, Policy>& z) {
+                 const Checked_Number<T, Policy>& y,
+                 const Checked_Number<T, Policy>& z) {
   Policy::handle_result(div_assign_r(x, y, z, ROUND_NOT_NEEDED));
 }
 
@@ -14410,7 +14451,7 @@ cmp(const From1& x, const From2& y) {
     = Checked::cmp_ext<typename Native_Checked_From_Wrapper<From1>::Policy,
                        typename Native_Checked_From_Wrapper<From2>::Policy>
                  (Native_Checked_From_Wrapper<From1>::raw_value(x),
-		  Native_Checked_From_Wrapper<From2>::raw_value(y));
+                  Native_Checked_From_Wrapper<From2>::raw_value(y));
   switch (r) {
   case VR_LT:
     return -1;
@@ -14429,11 +14470,11 @@ typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
 output(std::ostream& os, const T& x,
        const Numeric_Format& format, Rounding_Dir dir) {
   return check_result(Checked::output_ext<typename Native_Checked_From_Wrapper<T>::Policy>
-		      (os,
-		       Native_Checked_From_Wrapper<T>::raw_value(x),
-		       format,
-		       rounding_dir(dir)),
-		      dir);
+                      (os,
+                       Native_Checked_From_Wrapper<T>::raw_value(x),
+                       format,
+                       rounding_dir(dir)),
+                      dir);
 }
 
 /*! \relates Checked_Number */
@@ -14449,16 +14490,16 @@ template <typename T>
 typename Enable_If<Is_Native_Or_Checked<T>::value, Result>::type
 input(T& x, std::istream& is, Rounding_Dir dir) {
   return check_result(Checked::input_ext<typename Native_Checked_To_Wrapper<T>::Policy>
-		      (Native_Checked_To_Wrapper<T>::raw_value(x),
-		       is,
-		       rounding_dir(dir)),
-		      dir);
+                      (Native_Checked_To_Wrapper<T>::raw_value(x),
+                       is,
+                       rounding_dir(dir)),
+                      dir);
 }
 
 /*! \relates Checked_Number */
 template <typename T, typename Policy>
 inline std::istream& operator>>(std::istream& is,
-				Checked_Number<T, Policy>& x) {
+                                Checked_Number<T, Policy>& x) {
   Result r = input(x, is, Policy::ROUND_DEFAULT_INPUT);
   if (r == V_CVT_STR_UNK)
     is.setstate(std::ios::failbit);
@@ -14511,12 +14552,12 @@ maybe_check_fpu_inexact() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Checked_Number.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_templates.hh line 1. */
 /* Checked_Number class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Checked_Number.templates.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_templates.hh line 28. */
 #include <iomanip>
 #include <limits>
 
@@ -14638,52 +14679,52 @@ ascii_load(std::istream& s, T& t) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Checked_Number.defs.hh line 1067. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Checked_Number_defs.hh line 1067. */
 
-/* Automatically generated from PPL source file ../src/checked_numeric_limits.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/checked_numeric_limits.hh line 29. */
 #include <limits>
 
 namespace std {
 
 using namespace Parma_Polyhedra_Library;
 
-#define PPL_SPECIALIZE_LIMITS_INT(T)					\
-  /*! \brief Partial specialization of std::numeric_limits. */		\
-  template <typename Policy>						\
+#define PPL_SPECIALIZE_LIMITS_INT(T)                                    \
+  /*! \brief Partial specialization of std::numeric_limits. */          \
+  template <typename Policy>                                            \
   class numeric_limits<Checked_Number<PPL_U(T), Policy> >              \
     : public numeric_limits<PPL_U(T)> {                                 \
-  private:								\
+  private:                                                              \
     typedef Checked_Number<PPL_U(T), Policy> Type;                      \
                                                                         \
-  public:								\
-    static const bool has_infinity = Policy::has_infinity;		\
+  public:                                                               \
+    static const bool has_infinity = Policy::has_infinity;              \
     static const bool has_quiet_NaN =  Policy::has_nan;                 \
                                                                         \
-    static Type min() {							\
-      Type v;								\
+    static Type min() {                                                 \
+      Type v;                                                           \
       v.raw_value() = Checked::Extended_Int<Policy, PPL_U(T)>::min;     \
-      return v;								\
-    }									\
+      return v;                                                         \
+    }                                                                   \
                                                                         \
-    static Type max() {							\
-      Type v;								\
+    static Type max() {                                                 \
+      Type v;                                                           \
       v.raw_value() = Checked::Extended_Int<Policy, PPL_U(T)>::max;     \
-      return v;								\
-    }									\
-									\
-    static Type infinity() {						\
-      Type v;								\
-      Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,	\
+      return v;                                                         \
+    }                                                                   \
+                                                                        \
+    static Type infinity() {                                            \
+      Type v;                                                           \
+      Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,  \
                                       ROUND_IGNORE);                    \
-      return v;								\
-    }									\
-									\
-    static Type quiet_NaN() {						\
-      Type v;								\
-      Checked::assign_special<Policy>(v.raw_value(), VC_NAN,		\
+      return v;                                                         \
+    }                                                                   \
+                                                                        \
+    static Type quiet_NaN() {                                           \
+      Type v;                                                           \
+      Checked::assign_special<Policy>(v.raw_value(), VC_NAN,            \
                                       ROUND_IGNORE);                    \
-      return v;								\
-    }									\
+      return v;                                                         \
+    }                                                                   \
   };
 
 PPL_SPECIALIZE_LIMITS_INT(char)
@@ -14702,9 +14743,9 @@ PPL_SPECIALIZE_LIMITS_INT(unsigned long long)
 
 #undef PPL_SPECIALIZE_LIMITS_INT
 
-#define PPL_SPECIALIZE_LIMITS_FLOAT(T)					\
-  /*! \brief Partial specialization of std::numeric_limits. */		\
-  template <typename Policy>						\
+#define PPL_SPECIALIZE_LIMITS_FLOAT(T)                                  \
+  /*! \brief Partial specialization of std::numeric_limits. */          \
+  template <typename Policy>                                            \
   struct numeric_limits<Checked_Number<PPL_U(T), Policy> >              \
     : public numeric_limits<PPL_U(T)> {                                 \
 };
@@ -14738,7 +14779,7 @@ public:
   static Type infinity() {
     Type v;
     Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,
-				    ROUND_IGNORE);
+                                    ROUND_IGNORE);
     return v;
   }
 
@@ -14766,7 +14807,7 @@ public:
   static Type infinity() {
     Type v;
     Checked::assign_special<Policy>(v.raw_value(), VC_PLUS_INFINITY,
-				    ROUND_IGNORE);
+                                    ROUND_IGNORE);
     return v;
   }
 
@@ -14779,12 +14820,12 @@ public:
 
 } // namespace std
 
-/* Automatically generated from PPL source file ../src/stdiobuf.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/stdiobuf_defs.hh line 1. */
 /* stdiobuf class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/stdiobuf.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/stdiobuf_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -14793,7 +14834,7 @@ class stdiobuf;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/stdiobuf.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/stdiobuf_defs.hh line 28. */
 #include <cstdio>
 #include <streambuf>
 
@@ -14875,7 +14916,7 @@ private:
   int_type unget_char_buf;
 };
 
-/* Automatically generated from PPL source file ../src/stdiobuf.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/stdiobuf_inlines.hh line 1. */
 /* stdiobuf class implementation: inline functions.
 */
 
@@ -14889,14 +14930,14 @@ stdiobuf::stdiobuf(FILE* file)
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/stdiobuf.defs.hh line 110. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/stdiobuf_defs.hh line 110. */
 
-/* Automatically generated from PPL source file ../src/c_streambuf.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/c_streambuf_defs.hh line 1. */
 /* c_streambuf class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/c_streambuf.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/c_streambuf_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -14905,7 +14946,7 @@ class c_streambuf;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/c_streambuf.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/c_streambuf_defs.hh line 28. */
 #include <streambuf>
 #include <cstddef>
 
@@ -15003,7 +15044,7 @@ private:
   }
 };
 
-/* Automatically generated from PPL source file ../src/c_streambuf.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/c_streambuf_inlines.hh line 1. */
 /* c_streambuf class implementation: inline functions.
 */
 
@@ -15021,29 +15062,29 @@ c_streambuf::~c_streambuf() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/c_streambuf.defs.hh line 126. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/c_streambuf_defs.hh line 126. */
 
-/* Automatically generated from PPL source file ../src/Integer_Interval.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Integer_Interval.hh line 1. */
 /* Integer_Interval class declaration and implementation.
 */
 
 
-/* Automatically generated from PPL source file ../src/Interval.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_defs.hh line 1. */
 /* Declarations for the Interval class and its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/assign_or_swap.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/assign_or_swap.hh line 1. */
 /* The assign_or_swap() utility functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Has_Assign_Or_Swap.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Has_Assign_Or_Swap.hh line 1. */
 /* Has_Assign_Or_Swap classes declarations.
 */
 
 
-/* Automatically generated from PPL source file ../src/Has_Assign_Or_Swap.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Has_Assign_Or_Swap.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -15063,14 +15104,14 @@ struct Has_Assign_Or_Swap : public False {
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename T>
 struct Has_Assign_Or_Swap<T,
-			  typename Enable_If_Is<void (T::*)(T& x),
-						&T::assign_or_swap>::type>
+                          typename Enable_If_Is<void (T::*)(T& x),
+                                                &T::assign_or_swap>::type>
   : public True {
 };
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/assign_or_swap.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/assign_or_swap.hh line 30. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -15112,15 +15153,15 @@ assign_or_swap(T& to, T& from) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/intervals.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/intervals_defs.hh line 1. */
 /* Helper classes for intervals.
 */
 
 
-/* Automatically generated from PPL source file ../src/intervals.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/intervals_defs.hh line 28. */
 #include <cstdlib>
 
-/* Automatically generated from PPL source file ../src/intervals.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/intervals_defs.hh line 31. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -15229,7 +15270,7 @@ class Val_Or_Ref;
 
 template <typename T, typename Criteria>
 class Val_Or_Ref<T, Criteria,
-		 typename Enable_If<!Use_By_Ref<Criteria, T>::value>::type> {
+                 typename Enable_If<!Use_By_Ref<Criteria, T>::value>::type> {
   T value;
 public:
   typedef T Arg_Type;
@@ -15257,7 +15298,7 @@ public:
 
 template <typename T, typename Criteria>
 class Val_Or_Ref<T, Criteria,
-		 typename Enable_If<Use_By_Ref<Criteria, T>::value>::type> {
+                 typename Enable_If<Use_By_Ref<Criteria, T>::value>::type> {
   const T* ptr;
 public:
   typedef T& Arg_Type;
@@ -15307,7 +15348,7 @@ public:
       r = assign_r(to, c.value(), (ROUND_UP | ROUND_STRICT_RELATION));
       r = result_relation_class(r);
       if (r == V_EQ)
-	return V_LE;
+        return V_LE;
       goto lt;
     case V_LT:
       r = assign_r(to, c.value(), ROUND_UP);
@@ -15317,20 +15358,20 @@ public:
       case V_EMPTY:
       case V_LT_PLUS_INFINITY:
       case V_EQ_MINUS_INFINITY:
-	return r;
+        return r;
       case V_LT:
       case V_LE:
       case V_EQ:
-	return V_LT;
+        return V_LT;
       default:
-	break;
+        break;
       }
       break;
     case V_GE:
       r = assign_r(to, c.value(), (ROUND_DOWN | ROUND_STRICT_RELATION));
       r = result_relation_class(r);
       if (r == V_EQ)
-	return V_GE;
+        return V_GE;
       goto gt;
     case V_GT:
       r = assign_r(to, c.value(), ROUND_DOWN);
@@ -15340,13 +15381,13 @@ public:
       case V_EMPTY:
       case V_GT_MINUS_INFINITY:
       case V_EQ_PLUS_INFINITY:
-	return r;
+        return r;
       case V_LT:
       case V_LE:
       case V_EQ:
-	return V_GT;
+        return V_GT;
       default:
-	break;
+        break;
       }
       break;
     case V_EQ:
@@ -15354,16 +15395,16 @@ public:
       r = result_relation_class(r);
       PPL_ASSERT(r != V_LT && r != V_GT);
       if (r == V_EQ)
-	return V_EQ;
+        return V_EQ;
       else
-	return V_EMPTY;
+        return V_EMPTY;
     case V_NE:
       r = assign_r(to, c.value(), ROUND_CHECK);
       r = result_relation_class(r);
       if (r == V_EQ)
-	return V_NE;
+        return V_NE;
       else
-	return V_LGE;
+        return V_LGE;
     default:
       break;
     }
@@ -15401,8 +15442,8 @@ public:
     case V_GE:
       if (rel2 == V_LE && to1 == to2) {
       eq:
-	rel2 = V_EQ;
-	return V_LGE;
+        rel2 = V_EQ;
+        return V_LGE;
       }
       /* Fall through*/
     case V_GT:
@@ -15428,9 +15469,9 @@ public:
     switch (rel) {
     case V_LT:
       if (is_integer(to)) {
-	rel = sub_assign_r(to, to, T(1), (ROUND_UP | ROUND_STRICT_RELATION));
-	rel = result_relation_class(rel);
-	return (rel == V_EQ) ? V_LE : rel;
+        rel = sub_assign_r(to, to, T(1), (ROUND_UP | ROUND_STRICT_RELATION));
+        rel = result_relation_class(rel);
+        return (rel == V_EQ) ? V_LE : rel;
       }
       /* Fall through */
     case V_LE:
@@ -15440,9 +15481,9 @@ public:
       return V_LE;
     case V_GT:
       if (is_integer(to)) {
-	rel = add_assign_r(to, to, T(1), (ROUND_DOWN | ROUND_STRICT_RELATION));
-	rel = result_relation_class(rel);
-	return (rel == V_EQ) ? V_GE : rel;
+        rel = add_assign_r(to, to, T(1), (ROUND_DOWN | ROUND_STRICT_RELATION));
+        rel = result_relation_class(rel);
+        return (rel == V_EQ) ? V_GE : rel;
       }
       /* Fall through */
     case V_GE:
@@ -15452,11 +15493,11 @@ public:
       return V_GE;
     case V_EQ:
       if (is_integer(to))
-	return V_EQ;
+        return V_EQ;
       return V_EMPTY;
     case V_NE:
       if (is_integer(to))
-	return V_NE;
+        return V_NE;
       return V_LGE;
     default:
       return rel;
@@ -15479,7 +15520,7 @@ struct I_Constraint_Rel {
 };
 
 template <typename T, typename Val_Or_Ref_Criteria = Use_Slow_Copy,
-	  bool extended = false>
+          bool extended = false>
 class I_Constraint
   : public I_Constraint_Common<I_Constraint<T, Val_Or_Ref_Criteria,
                                             extended> > {
@@ -15563,7 +15604,7 @@ i_constraint(I_Constraint_Rel rel, T& v, const Val_Or_Ref_Criteria&) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -15573,17 +15614,17 @@ class Interval;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval_Info.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_Info_defs.hh line 1. */
 /* Interval_Info class declaration and implementation.
 */
 
 
-/* Automatically generated from PPL source file ../src/Boundary.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Boundary_defs.hh line 1. */
 /* Interval boundary functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Boundary.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Boundary_defs.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -15675,11 +15716,6 @@ set_unbounded(Boundary_Type type, T& x, Info& info) {
 template <typename T, typename Info>
 inline Result
 set_minus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
-  /*
-  PPL_COMPILE_TIME_CHECK(Info::store_special
-                         || std::numeric_limits<T>::has_infinity,
-                         "minus infinity is not representable");
-  */
   if (open) {
     PPL_ASSERT(type == LOWER);
   }
@@ -15703,11 +15739,6 @@ set_minus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
 template <typename T, typename Info>
 inline Result
 set_plus_infinity(Boundary_Type type, T& x, Info& info, bool open = false) {
-  /*
-  PPL_COMPILE_TIME_CHECK(Info::store_special
-                         || std::numeric_limits<T>::has_infinity,
-                         "minus infinity is not representable");
-  */
   if (open) {
     PPL_ASSERT(type == UPPER);
   }
@@ -15887,11 +15918,11 @@ eq(Boundary_Type type1, const T1& x1, const Info1& info1,
    Boundary_Type type2, const T2& x2, const Info2& info2) {
   if (type1 == type2) {
     if (is_open(type1, x1, info1)
-	!= is_open(type2, x2, info2))
+        != is_open(type2, x2, info2))
       return false;
   }
   else if (is_open(type1, x1, info1)
-	   || is_open(type2, x2, info2))
+           || is_open(type2, x2, info2))
     return false;
   if (is_minus_infinity(type1, x1, info1))
     return is_minus_infinity(type2, x2, info2);
@@ -15910,18 +15941,18 @@ lt(Boundary_Type type1, const T1& x1, const Info1& info1,
    Boundary_Type type2, const T2& x2, const Info2& info2) {
   if (is_open(type1, x1, info1)) {
     if (type1 == UPPER
-	&& (type2 == LOWER
-	    || !is_open(type2, x2, info2)))
+        && (type2 == LOWER
+            || !is_open(type2, x2, info2)))
       goto le;
   }
   else if (type2 == LOWER
-	   && is_open(type2, x2, info2)) {
+           && is_open(type2, x2, info2)) {
   le:
     if (is_minus_infinity(type1, x1, info1)
-	|| is_plus_infinity(type2, x2, info2))
+        || is_plus_infinity(type2, x2, info2))
       return true;
     if (is_plus_infinity(type1, x1, info1)
-	|| is_minus_infinity(type2, x2, info2))
+        || is_minus_infinity(type2, x2, info2))
       return false;
     else
       return less_or_equal(x1, x2);
@@ -15960,7 +15991,7 @@ ge(Boundary_Type type1, const T1& x1, const Info1& info1,
 template <typename T, typename Info>
 inline Result
 adjust_boundary(Boundary_Type type, T& x, Info& info,
-		bool open, Result r) {
+                bool open, Result r) {
   r = result_relation_class(r);
   if (type == LOWER) {
     switch (r) {
@@ -15969,9 +16000,9 @@ adjust_boundary(Boundary_Type type, T& x, Info& info,
       /* Fall through */
     case V_EQ_MINUS_INFINITY:
       if (!Info::store_special)
-	return r;
+        return r;
       if (open)
-	info.set_boundary_property(type, OPEN);
+        info.set_boundary_property(type, OPEN);
       return special_set_boundary_infinity(type, x, info);
     case V_GT:
       open = true;
@@ -15993,9 +16024,9 @@ adjust_boundary(Boundary_Type type, T& x, Info& info,
       /* Fall through */
     case V_EQ_PLUS_INFINITY:
       if (!Info::store_special)
-	return r;
+        return r;
       if (open)
-	info.set_boundary_property(type, OPEN);
+        info.set_boundary_property(type, OPEN);
       return special_set_boundary_infinity(type, x, info);
     case V_LT:
       open = true;
@@ -16015,7 +16046,7 @@ adjust_boundary(Boundary_Type type, T& x, Info& info,
 template <typename To, typename To_Info, typename T, typename Info>
 inline Result
 complement(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
+           Boundary_Type type, const T& x, const Info& info) {
   PPL_ASSERT(to_type != type);
   bool should_shrink;
   if (info.get_boundary_property(type, SPECIAL)) {
@@ -16042,15 +16073,16 @@ assign(Boundary_Type to_type, To& to, To_Info& to_info,
     return set_boundary_infinity(to_type, to, to_info, should_shrink);
   }
   should_shrink = (should_shrink || normal_is_open(type, x, info));
-  bool check = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
-  Result r = assign_r(to, x, round_dir_check(to_type, check));
+  const bool check
+    = (To_Info::check_inexact || (!should_shrink && To_Info::store_open));
+  const Result r = assign_r(to, x, round_dir_check(to_type, check));
   return adjust_boundary(to_type, to, to_info, should_shrink, r);
 }
 
 template <typename To, typename To_Info, typename T, typename Info>
 inline Result
 min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
+           Boundary_Type type, const T& x, const Info& info) {
   if (lt(type, x, info, to_type, to, to_info)) {
     to_info.clear_boundary_properties(to_type);
     return assign(to_type, to, to_info, type, x, info);
@@ -16061,8 +16093,8 @@ min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
   if (lt(type1, x1, info1, type2, x2, info2))
     return assign(to_type, to, to_info, type1, x1, info1);
   else
@@ -16072,7 +16104,7 @@ min_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T, typename Info>
 inline Result
 max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
+           Boundary_Type type, const T& x, const Info& info) {
   if (gt(type, x, info, to_type, to, to_info)) {
     to_info.clear_boundary_properties(to_type);
     return assign(to_type, to, to_info, type, x, info);
@@ -16083,8 +16115,8 @@ max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
   if (gt(type1, x1, info1, type2, x2, info2))
     return assign(to_type, to, to_info, type1, x1, info1);
   else
@@ -16094,7 +16126,7 @@ max_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T, typename Info>
 inline Result
 neg_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type, const T& x, const Info& info) {
+           Boundary_Type type, const T& x, const Info& info) {
   PPL_ASSERT(to_type != type);
   bool should_shrink;
   if (info.get_boundary_property(type, SPECIAL)) {
@@ -16110,8 +16142,8 @@ neg_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 add_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
   PPL_ASSERT(type1 == type2);
   bool should_shrink;
   if (is_boundary_infinity(type1, x1, info1)) {
@@ -16135,8 +16167,8 @@ add_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 sub_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
   PPL_ASSERT(type1 != type2);
   bool should_shrink;
   if (is_boundary_infinity(type1, x1, info1)) {
@@ -16160,8 +16192,8 @@ sub_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 mul_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
   bool should_shrink;
   if (is_boundary_infinity(type1, x1, info1)) {
     should_shrink = (boundary_infinity_is_open(type1, info1)
@@ -16193,14 +16225,14 @@ set_zero(Boundary_Type to_type, To& to, To_Info& to_info, bool should_shrink) {
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 mul_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
-	     Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
-	     Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
+             Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
+             Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
   bool should_shrink;
   if (x1s != 0) {
     if (x2s != 0)
       return mul_assign(to_type, to, to_info,
-			type1, x1, info1,
-			type2, x2, info2);
+                        type1, x1, info1,
+                        type2, x2, info2);
     else
       should_shrink = info2.get_boundary_property(type2, OPEN);
   }
@@ -16214,8 +16246,8 @@ mul_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 div_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-	   Boundary_Type type1, const T1& x1, const Info1& info1,
-	   Boundary_Type type2, const T2& x2, const Info2& info2) {
+           Boundary_Type type1, const T1& x1, const Info1& info1,
+           Boundary_Type type2, const T2& x2, const Info2& info2) {
   bool should_shrink;
   if (is_boundary_infinity(type1, x1, info1)) {
     should_shrink = boundary_infinity_is_open(type1, info1);
@@ -16238,13 +16270,13 @@ div_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T1, typename Info1, typename T2, typename Info2>
 inline Result
 div_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
-	     Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
-	     Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
+             Boundary_Type type1, const T1& x1, const Info1& info1, int x1s,
+             Boundary_Type type2, const T2& x2, const Info2& info2, int x2s) {
   if (x1s != 0) {
     if (x2s != 0)
       return div_assign(to_type, to, to_info,
-			type1, x1, info1,
-			type2, x2, info2);
+                        type1, x1, info1,
+                        type2, x2, info2);
     else {
       return set_boundary_infinity(to_type, to, to_info, true);
     }
@@ -16259,8 +16291,8 @@ div_assign_z(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T, typename Info>
 inline Result
 umod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-		 Boundary_Type type, const T& x, const Info& info,
-		 unsigned int exp) {
+                 Boundary_Type type, const T& x, const Info& info,
+                 unsigned int exp) {
   PPL_ASSERT(to_type == type);
   bool should_shrink;
   if (is_boundary_infinity(type, x, info)) {
@@ -16276,8 +16308,8 @@ umod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 template <typename To, typename To_Info, typename T, typename Info>
 inline Result
 smod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
-		 Boundary_Type type, const T& x, const Info& info,
-		 unsigned int exp) {
+                 Boundary_Type type, const T& x, const Info& info,
+                 unsigned int exp) {
   PPL_ASSERT(to_type == type);
   bool should_shrink;
   if (is_boundary_infinity(type, x, info)) {
@@ -16294,7 +16326,7 @@ smod_2exp_assign(Boundary_Type to_type, To& to, To_Info& to_info,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval_Info.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_Info_defs.hh line 28. */
 
 #include <iostream>
 
@@ -16468,18 +16500,18 @@ public:
     switch (p.type) {
     case Boundary_NS::Property::SPECIAL_:
       if (store_special) {
-	if (t == LOWER)
-	  set_bit(bitset, lower_special_bit, value);
-	else
-	  set_bit(bitset, upper_special_bit, value);
+        if (t == LOWER)
+          set_bit(bitset, lower_special_bit, value);
+        else
+          set_bit(bitset, upper_special_bit, value);
       }
       break;
     case Boundary_NS::Property::OPEN_:
       if (store_open) {
-	if (t == LOWER)
-	  set_bit(bitset, lower_open_bit, value);
-	else
-	  set_bit(bitset, upper_open_bit, value);
+        if (t == LOWER)
+          set_bit(bitset, lower_open_bit, value);
+        else
+          set_bit(bitset, upper_open_bit, value);
       }
       break;
     default:
@@ -16490,18 +16522,18 @@ public:
     switch (p.type) {
     case Boundary_NS::Property::SPECIAL_:
       if (!store_special)
-	return false;
+        return false;
       if (t == LOWER)
-	return get_bit(bitset, lower_special_bit);
+        return get_bit(bitset, lower_special_bit);
       else
-	return get_bit(bitset, upper_special_bit);
+        return get_bit(bitset, upper_special_bit);
     case Boundary_NS::Property::OPEN_:
       if (!store_open)
-	return false;
+        return false;
       else if (t == LOWER)
-	return get_bit(bitset, lower_open_bit);
+        return get_bit(bitset, lower_open_bit);
       else
-	return get_bit(bitset, upper_open_bit);
+        return get_bit(bitset, upper_open_bit);
     default:
       return false;
     }
@@ -16510,15 +16542,15 @@ public:
     switch (p.type) {
     case Interval_NS::Property::CARDINALITY_0_:
       if (cache_empty)
-	set_bit(bitset, cardinality_0_bit, value);
+        set_bit(bitset, cardinality_0_bit, value);
       break;
     case Interval_NS::Property::CARDINALITY_1_:
       if (cache_singleton)
-	set_bit(bitset, cardinality_1_bit, value);
+        set_bit(bitset, cardinality_1_bit, value);
       break;
     case Interval_NS::Property::CARDINALITY_IS_:
       if (cache_empty || cache_singleton)
-	set_bit(bitset, cardinality_is_bit, value);
+        set_bit(bitset, cardinality_is_bit, value);
       break;
     default:
       break;
@@ -16550,7 +16582,7 @@ protected:
 
 }
 
-/* Automatically generated from PPL source file ../src/Interval_Info.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_Info_inlines.hh line 1. */
 /* Interval_Info class implementation: inline functions.
 */
 
@@ -16644,9 +16676,9 @@ swap(Interval_Info_Bitset<T, Policy>& x, Interval_Info_Bitset<T, Policy>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval_Info.defs.hh line 284. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_Info_defs.hh line 284. */
 
-/* Automatically generated from PPL source file ../src/Interval.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_defs.hh line 33. */
 #include <iosfwd>
 
 // Temporary!
@@ -16658,7 +16690,8 @@ enum Ternary { T_YES, T_NO, T_MAYBE };
 
 inline I_Result
 combine(Result l, Result u) {
-  unsigned res = static_cast<unsigned>(l) | (static_cast<unsigned>(u) << 6);
+  const unsigned res
+    = static_cast<unsigned>(l) | (static_cast<unsigned>(u) << 6);
   return static_cast<I_Result>(res);
 }
 
@@ -16890,7 +16923,7 @@ public:
   template <typename C1, typename C2>
   typename Enable_If<Is_Same_Or_Derived<I_Constraint_Base, C1>::value
                      &&
-		     Is_Same_Or_Derived<I_Constraint_Base, C2>::value,
+                     Is_Same_Or_Derived<I_Constraint_Base, C2>::value,
                      I_Result>::type
   build(const C1& c1, const C2& c2) {
     switch (c1.rel()) {
@@ -16910,7 +16943,7 @@ public:
       break;
     }
     build(c1);
-    I_Result r = add_constraint(c2);
+    const I_Result r = add_constraint(c2);
     return r - (I_CHANGED | I_UNCHANGED);
   }
 
@@ -16949,7 +16982,8 @@ public:
   typename Enable_If<Is_Special<From>::value, I_Result>::type
   assign(const From&) {
     info().clear();
-    Result rl, ru;
+    Result rl;
+    Result ru;
     switch (From::vclass) {
     case VC_MINUS_INFINITY:
       rl = Boundary_NS::set_minus_infinity(LOWER, lower(), info());
@@ -17069,7 +17103,7 @@ public:
   typename Enable_If<Is_Singleton<From>::value || Is_Interval<From>::value, I_Result>::type
   wrap_assign(Bounded_Integer_Type_Width w,
               Bounded_Integer_Type_Representation r,
-	      const From& refinement) {
+              const From& refinement) {
     if (is_empty())
       return I_EMPTY;
     if (lower_is_boundary_infinity() || upper_is_boundary_infinity())
@@ -17082,15 +17116,15 @@ public:
     switch (r) {
     case UNSIGNED:
       umod_2exp_assign(LOWER, lower(), info(),
-		       LOWER, lower(), info(), w);
+                       LOWER, lower(), info(), w);
       umod_2exp_assign(UPPER, upper(), info(),
-		       UPPER, upper(), info(), w);
+                       UPPER, upper(), info(), w);
       break;
     case SIGNED_2_COMPLEMENT:
       smod_2exp_assign(LOWER, lower(), info(),
-		       LOWER, lower(), info(), w);
+                       LOWER, lower(), info(), w);
       smod_2exp_assign(UPPER, upper(), info(),
-		       UPPER, upper(), info(), w);
+                       UPPER, upper(), info(), w);
       break;
     default:
       PPL_UNREACHABLE;
@@ -17101,7 +17135,7 @@ public:
     PPL_DIRTY_TEMP(Interval, tmp);
     tmp.info().clear();
     Boundary_NS::assign(LOWER, tmp.lower(), tmp.info(),
-			LOWER, lower(), info());
+                        LOWER, lower(), info());
     set_unbounded(UPPER, tmp.upper(), tmp.info());
     tmp.intersect_assign(refinement);
     lower_extend();
@@ -17129,13 +17163,13 @@ public:
     if (is_open(LOWER, lower(), info())) {
       if (is_plus_infinity(LOWER, lower(), info())) {
 #ifndef NDEBUG
-	std::cerr << "The lower boundary is +inf open.\n";
+        std::cerr << "The lower boundary is +inf open.\n";
 #endif
       }
     }
     else if (!Info::may_contain_infinity
-	     && (is_minus_infinity(LOWER, lower(), info())
-		 || is_plus_infinity(LOWER, lower(), info()))) {
+             && (is_minus_infinity(LOWER, lower(), info())
+                 || is_plus_infinity(LOWER, lower(), info()))) {
 #ifndef NDEBUG
       std::cerr << "The lower boundary is unexpectedly infinity.\n";
 #endif
@@ -17144,22 +17178,22 @@ public:
     if (!info().get_boundary_property(LOWER, SPECIAL)) {
       if (is_not_a_number(lower())) {
 #ifndef NDEBUG
-	std::cerr << "The lower boundary is not a number.\n";
+        std::cerr << "The lower boundary is not a number.\n";
 #endif
-	return false;
+        return false;
       }
     }
 
     if (is_open(UPPER, upper(), info())) {
       if (is_minus_infinity(UPPER, upper(), info())) {
 #ifndef NDEBUG
-	std::cerr << "The upper boundary is -inf open.\n";
+        std::cerr << "The upper boundary is -inf open.\n";
 #endif
       }
     }
     else if (!Info::may_contain_infinity
-	     && (is_minus_infinity(UPPER, upper(), info())
-		 || is_plus_infinity(UPPER, upper(), info()))) {
+             && (is_minus_infinity(UPPER, upper(), info())
+                 || is_plus_infinity(UPPER, upper(), info()))) {
 #ifndef NDEBUG
       std::cerr << "The upper boundary is unexpectedly infinity."
                 << std::endl;
@@ -17169,9 +17203,9 @@ public:
     if (!info().get_boundary_property(UPPER, SPECIAL)) {
       if (is_not_a_number(upper())) {
 #ifndef NDEBUG
-	std::cerr << "The upper boundary is not a number.\n";
+        std::cerr << "The upper boundary is not a number.\n";
 #endif
-	return false;
+        return false;
       }
     }
 
@@ -17227,7 +17261,7 @@ public:
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value
                        || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value
+                      && (Is_Singleton<From2>::value
                           || Is_Interval<From2>::value)), I_Result>::type
   join_assign(const From1& x, const From2& y);
 
@@ -17239,7 +17273,7 @@ public:
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value
                        || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value
+                      && (Is_Singleton<From2>::value
                           || Is_Interval<From2>::value)), I_Result>::type
   intersect_assign(const From1& x, const From2& y);
 
@@ -17259,7 +17293,7 @@ public:
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value
                        || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value
+                      && (Is_Singleton<From2>::value
                           || Is_Interval<From2>::value)), I_Result>::type
   difference_assign(const From1& x, const From2& y);
 
@@ -17338,22 +17372,22 @@ public:
 
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
   add_assign(const From1& x, const From2& y);
 
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
   sub_assign(const From1& x, const From2& y);
 
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
   mul_assign(const From1& x, const From2& y);
 
   template <typename From1, typename From2>
   typename Enable_If<((Is_Singleton<From1>::value || Is_Interval<From1>::value)
-		      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
+                      && (Is_Singleton<From2>::value || Is_Interval<From2>::value)), I_Result>::type
   div_assign(const From1& x, const From2& y);
 
   template <typename From, typename Iterator>
@@ -17372,7 +17406,7 @@ void swap(Interval<Boundary, Info>& x, Interval<Boundary, Info>& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_inlines.hh line 1. */
 /* Inline functions for the Interval class and its constituents.
 */
 
@@ -17508,11 +17542,11 @@ check_empty_arg(const T& x) {
 template <typename T1, typename T2>
 inline typename Enable_If<((Is_Singleton<T1>::value
                             || Is_Interval<T1>::value)
-			   && (Is_Singleton<T2>::value
+                           && (Is_Singleton<T2>::value
                                || Is_Interval<T2>::value)
-			   && (Is_Interval<T1>::value
+                           && (Is_Interval<T1>::value
                                || Is_Interval<T2>::value)),
-			  bool>::type
+                          bool>::type
 operator==(const T1& x, const T2& y) {
   PPL_ASSERT(f_OK(x));
   PPL_ASSERT(f_OK(y));
@@ -17527,11 +17561,11 @@ operator==(const T1& x, const T2& y) {
 template <typename T1, typename T2>
 inline typename Enable_If<((Is_Singleton<T1>::value
                             || Is_Interval<T1>::value)
-			   && (Is_Singleton<T2>::value
+                           && (Is_Singleton<T2>::value
                                || Is_Interval<T2>::value)
-			   && (Is_Interval<T1>::value
+                           && (Is_Interval<T1>::value
                                || Is_Interval<T2>::value)),
-			  bool>::type
+                          bool>::type
 operator!=(const T1& x, const T2& y) {
   return !(x == y);
 }
@@ -17563,9 +17597,9 @@ Interval<Boundary, Info>::strictly_contains(const T& y) const {
   if (check_empty_arg(*this))
     return false;
   return (lt(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
-	  && ge(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)))
+          && ge(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)))
     || (le(LOWER, lower(), info(), LOWER, f_lower(y), f_info(y))
-	&& gt(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)));
+        && gt(UPPER, upper(), info(), UPPER, f_upper(y), f_info(y)));
 }
 
 template <typename Boundary, typename Info>
@@ -17591,10 +17625,10 @@ Interval<To_Boundary, To_Info>::assign(const From& x) {
     return assign(EMPTY);
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
-  Result rl = Boundary_NS::assign(LOWER, lower(), to_info,
-				  LOWER, f_lower(x), f_info(x));
-  Result ru = Boundary_NS::assign(UPPER, upper(), to_info,
-				  UPPER, f_upper(x), f_info(x));
+  const Result rl = Boundary_NS::assign(LOWER, lower(), to_info,
+                                        LOWER, f_lower(x), f_info(x));
+  const Result ru = Boundary_NS::assign(UPPER, upper(), to_info,
+                                        UPPER, f_upper(x), f_info(x));
   assign_or_swap(info(), to_info);
   PPL_ASSERT(OK());
   return combine(rl, ru);
@@ -17610,7 +17644,8 @@ Interval<To_Boundary, To_Info>::join_assign(const From& x) {
     return assign(x);
   if (check_empty_arg(x))
     return combine(V_EQ, V_EQ);
-  Result rl, ru;
+  Result rl;
+  Result ru;
   rl = min_assign(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
   ru = max_assign(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
   PPL_ASSERT(OK());
@@ -17621,7 +17656,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::join_assign(const From1& x, const From2& y) {
   PPL_ASSERT(f_OK(x));
@@ -17632,13 +17667,14 @@ Interval<To_Boundary, To_Info>::join_assign(const From1& x, const From2& y) {
     return assign(x);
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
-  Result rl, ru;
+  Result rl;
+  Result ru;
   rl = min_assign(LOWER, lower(), to_info,
-		  LOWER, f_lower(x), f_info(x),
-		  LOWER, f_lower(y), f_info(y));
+                  LOWER, f_lower(x), f_info(x),
+                  LOWER, f_lower(y), f_info(y));
   ru = max_assign(UPPER, upper(), to_info,
-		  UPPER, f_upper(x), f_info(x),
-		  UPPER, f_upper(y), f_info(y));
+                  UPPER, f_upper(x), f_info(x),
+                  UPPER, f_upper(y), f_info(y));
   assign_or_swap(info(), to_info);
   PPL_ASSERT(OK());
   return combine(rl, ru);
@@ -17678,7 +17714,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::intersect_assign(const From1& x,
                                                  const From2& y) {
@@ -17708,7 +17744,8 @@ Interval<To_Boundary, To_Info>::difference_assign(const From& x) {
     return combine(V_EQ, V_EQ);
   bool nl = ge(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x));
   bool nu = le(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x));
-  Result rl = V_EQ, ru = V_EQ;
+  Result rl = V_EQ;
+  Result ru = V_EQ;
   if (nl) {
     if (nu)
       return assign(EMPTY);
@@ -17729,7 +17766,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::difference_assign(const From1& x,
                                                   const From2& y) {
@@ -17742,7 +17779,8 @@ Interval<To_Boundary, To_Info>::difference_assign(const From1& x,
     return assign(x);
   bool nl = ge(LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y));
   bool nu = le(UPPER, f_upper(x), f_info(x), UPPER, f_upper(y), f_info(y));
-  Result rl = V_EQ, ru = V_EQ;
+  Result rl = V_EQ;
+  Result ru = V_EQ;
   if (nl) {
     if (nu)
       return assign(EMPTY);
@@ -17775,37 +17813,37 @@ Interval<To_Boundary, To_Info>
   case LESS_THAN:
     {
       if (lt(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(UPPER);
       Boundary_NS::assign(UPPER, upper(), info(),
-			  UPPER, f_upper(x), f_info(x), true);
+                          UPPER, f_upper(x), f_info(x), true);
       return I_ANY;
     }
   case LESS_OR_EQUAL:
     {
       if (le(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(UPPER);
       Boundary_NS::assign(UPPER, upper(), info(),
-			  UPPER, f_upper(x), f_info(x));
+                          UPPER, f_upper(x), f_info(x));
       return I_ANY;
     }
   case GREATER_THAN:
     {
       if (gt(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(LOWER);
       Boundary_NS::assign(LOWER, lower(), info(),
-			  LOWER, f_lower(x), f_info(x), true);
+                          LOWER, f_lower(x), f_info(x), true);
       return I_ANY;
     }
   case GREATER_OR_EQUAL:
     {
       if (ge(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(LOWER);
       Boundary_NS::assign(LOWER, lower(), info(),
-			  LOWER, f_lower(x), f_info(x));
+                          LOWER, f_lower(x), f_info(x));
       return I_ANY;
     }
   case EQUAL:
@@ -17813,13 +17851,13 @@ Interval<To_Boundary, To_Info>
   case NOT_EQUAL:
     {
       if (!f_is_singleton(x))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       if (check_empty_arg(*this))
-	return I_EMPTY;
+        return I_EMPTY;
       if (eq(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	remove_inf();
+        remove_inf();
       if (eq(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	remove_sup();
+        remove_sup();
       return I_ANY;
     }
   default:
@@ -17842,10 +17880,10 @@ Interval<To_Boundary, To_Info>::refine_universal(Relation_Symbol rel,
   case LESS_THAN:
     {
       if (lt(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(UPPER);
       Result ru = Boundary_NS::assign(UPPER, upper(), info(),
-				      LOWER, f_lower(x), SCALAR_INFO,
+                                      LOWER, f_lower(x), SCALAR_INFO,
                                       !is_open(LOWER, f_lower(x), f_info(x)));
       PPL_USED(ru);
       return I_ANY;
@@ -17853,20 +17891,20 @@ Interval<To_Boundary, To_Info>::refine_universal(Relation_Symbol rel,
   case LESS_OR_EQUAL:
     {
       if (le(UPPER, upper(), info(), LOWER, f_lower(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(UPPER);
       Result ru = Boundary_NS::assign(UPPER, upper(), info(),
-				      LOWER, f_lower(x), SCALAR_INFO);
+                                      LOWER, f_lower(x), SCALAR_INFO);
       PPL_USED(ru);
       return I_ANY;
     }
   case GREATER_THAN:
     {
       if (gt(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(LOWER);
       Result rl = Boundary_NS::assign(LOWER, lower(), info(),
-				      UPPER, f_upper(x), SCALAR_INFO,
+                                      UPPER, f_upper(x), SCALAR_INFO,
                                       !is_open(UPPER, f_upper(x), f_info(x)));
       PPL_USED(rl);
       return I_ANY;
@@ -17874,10 +17912,10 @@ Interval<To_Boundary, To_Info>::refine_universal(Relation_Symbol rel,
   case GREATER_OR_EQUAL:
     {
       if (ge(LOWER, lower(), info(), UPPER, f_upper(x), f_info(x)))
-	return combine(V_EQ, V_EQ);
+        return combine(V_EQ, V_EQ);
       info().clear_boundary_properties(LOWER);
       Result rl = Boundary_NS::assign(LOWER, lower(), info(),
-				      UPPER, f_upper(x), SCALAR_INFO);
+                                      UPPER, f_upper(x), SCALAR_INFO);
       PPL_USED(rl);
       return I_ANY;
     }
@@ -17888,11 +17926,11 @@ Interval<To_Boundary, To_Info>::refine_universal(Relation_Symbol rel,
   case NOT_EQUAL:
     {
       if (check_empty_arg(*this))
-	return I_EMPTY;
+        return I_EMPTY;
       if (eq(LOWER, lower(), info(), LOWER, f_lower(x), f_info(x)))
-	remove_inf();
+        remove_inf();
       if (eq(UPPER, upper(), info(), UPPER, f_upper(x), f_info(x)))
-	remove_sup();
+        remove_sup();
       return I_ANY;
     }
   default:
@@ -17911,7 +17949,8 @@ Interval<To_Boundary, To_Info>::neg_assign(const From& x) {
     return assign(EMPTY);
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
-  Result rl, ru;
+  Result rl;
+  Result ru;
   PPL_DIRTY_TEMP(To_Boundary, to_lower);
   rl = Boundary_NS::neg_assign(LOWER, to_lower, to_info, UPPER, f_upper(x), f_info(x));
   ru = Boundary_NS::neg_assign(UPPER, upper(), to_info, LOWER, f_lower(x), f_info(x));
@@ -17925,7 +17964,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::add_assign(const From1& x, const From2& y) {
   PPL_ASSERT(f_OK(x));
@@ -17946,11 +17985,11 @@ Interval<To_Boundary, To_Info>::add_assign(const From1& x, const From2& y) {
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
   Result rl = Boundary_NS::add_assign(LOWER, lower(), to_info,
-				      LOWER, f_lower(x), f_info(x),
-				      LOWER, f_lower(y), f_info(y));
+                                      LOWER, f_lower(x), f_info(x),
+                                      LOWER, f_lower(y), f_info(y));
   Result ru = Boundary_NS::add_assign(UPPER, upper(), to_info,
-				      UPPER, f_upper(x), f_info(x),
-				      UPPER, f_upper(y), f_info(y));
+                                      UPPER, f_upper(x), f_info(x),
+                                      UPPER, f_upper(y), f_info(y));
   assign_or_swap(info(), to_info);
   PPL_ASSERT(OK());
   return combine(rl, ru);
@@ -17960,7 +17999,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::sub_assign(const From1& x, const From2& y) {
   PPL_ASSERT(f_OK(x));
@@ -17981,14 +18020,15 @@ Interval<To_Boundary, To_Info>::sub_assign(const From1& x, const From2& y) {
 
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
-  Result rl, ru;
+  Result rl;
+  Result ru;
   PPL_DIRTY_TEMP(To_Boundary, to_lower);
   rl = Boundary_NS::sub_assign(LOWER, to_lower, to_info,
-			       LOWER, f_lower(x), f_info(x),
-			       UPPER, f_upper(y), f_info(y));
+                               LOWER, f_lower(x), f_info(x),
+                               UPPER, f_upper(y), f_info(y));
   ru = Boundary_NS::sub_assign(UPPER, upper(), to_info,
-			       UPPER, f_upper(x), f_info(x),
-			       LOWER, f_lower(y), f_info(y));
+                               UPPER, f_upper(x), f_info(x),
+                               LOWER, f_lower(y), f_info(y));
   assign_or_swap(lower(), to_lower);
   assign_or_swap(info(), to_info);
   PPL_ASSERT(OK());
@@ -18011,7 +18051,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::mul_assign(const From1& x, const From2& y) {
   PPL_ASSERT(f_OK(x));
@@ -18023,7 +18063,8 @@ Interval<To_Boundary, To_Info>::mul_assign(const From1& x, const From2& y) {
   int yls = sgn_b(LOWER, f_lower(y), f_info(y));
   int yus = (yls > 0) ? 1 : sgn_b(UPPER, f_upper(y), f_info(y));
   int inf_sign = Parma_Polyhedra_Library::infinity_sign(x);
-  int ls, us;
+  int ls;
+  int us;
   if (inf_sign != 0) {
     ls = yls;
     us = yus;
@@ -18036,98 +18077,99 @@ Interval<To_Boundary, To_Info>::mul_assign(const From1& x, const From2& y) {
       us = xus;
     inf:
       if (ls == 0 && us == 0)
-	return assign(EMPTY);
+        return assign(EMPTY);
       if (ls == -us)
-	return set_infinities();
+        return set_infinities();
       if (ls < 0 || us < 0)
-	inf_sign = -inf_sign;
+        inf_sign = -inf_sign;
       if (inf_sign < 0)
-	return assign(MINUS_INFINITY);
+        return assign(MINUS_INFINITY);
       else
-	return assign(PLUS_INFINITY);
+        return assign(PLUS_INFINITY);
     }
   }
 
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
-  Result rl, ru;
+  Result rl;
+  Result ru;
   PPL_DIRTY_TEMP(To_Boundary, to_lower);
 
   if (xls >= 0) {
     if (yls >= 0) {
       // 0 <= xl <= xu, 0 <= yl <= yu
       rl = mul_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
       ru = mul_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
     }
     else if (yus <= 0) {
       // 0 <= xl <= xu, yl <= yu <= 0
       rl = mul_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
       ru = mul_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
     }
     else {
       // 0 <= xl <= xu, yl < 0 < yu
       rl = mul_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
       ru = mul_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
     }
   }
   else if (xus <= 0) {
     if (yls >= 0) {
       // xl <= xu <= 0, 0 <= yl <= yu
       rl = mul_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
       ru = mul_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
     }
     else if (yus <= 0) {
       // xl <= xu <= 0, yl <= yu <= 0
       rl = mul_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
       ru = mul_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
     }
     else {
       // xl <= xu <= 0, yl < 0 < yu
       rl = mul_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
       ru = mul_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
     }
   }
   else if (yls >= 0) {
     // xl < 0 < xu, 0 <= yl <= yu
     rl = mul_assign_z(LOWER, to_lower, to_info,
-		      LOWER, f_lower(x), f_info(x), xls,
-		      UPPER, f_upper(y), f_info(y), yus);
+                      LOWER, f_lower(x), f_info(x), xls,
+                      UPPER, f_upper(y), f_info(y), yus);
     ru = mul_assign_z(UPPER, upper(), to_info,
-		      UPPER, f_upper(x), f_info(x), xus,
-		      UPPER, f_upper(y), f_info(y), yus);
+                      UPPER, f_upper(x), f_info(x), xus,
+                      UPPER, f_upper(y), f_info(y), yus);
   }
   else if (yus <= 0) {
     // xl < 0 < xu, yl <= yu <= 0
     rl = mul_assign_z(LOWER, to_lower, to_info,
-		      UPPER, f_upper(x), f_info(x), xus,
-		      LOWER, f_lower(y), f_info(y), yls);
+                      UPPER, f_upper(x), f_info(x), xus,
+                      LOWER, f_lower(y), f_info(y), yls);
     ru = mul_assign_z(UPPER, upper(), to_info,
-		      LOWER, f_lower(x), f_info(x), xls,
-		      LOWER, f_lower(y), f_info(y), yls);
+                      LOWER, f_lower(x), f_info(x), xls,
+                      LOWER, f_lower(y), f_info(y), yls);
   }
   else {
     // xl < 0 < xu, yl < 0 < yu
@@ -18136,22 +18178,22 @@ Interval<To_Boundary, To_Info>::mul_assign(const From1& x, const From2& y) {
     tmp_info.clear();
     Result tmp_r;
     tmp_r = Boundary_NS::mul_assign(LOWER, tmp, tmp_info,
-				    UPPER, f_upper(x), f_info(x),
-				    LOWER, f_lower(y), f_info(y));
+                                    UPPER, f_upper(x), f_info(x),
+                                    LOWER, f_lower(y), f_info(y));
     rl = Boundary_NS::mul_assign(LOWER, to_lower, to_info,
-				 LOWER, f_lower(x), f_info(x),
-				 UPPER, f_upper(y), f_info(y));
+                                 LOWER, f_lower(x), f_info(x),
+                                 UPPER, f_upper(y), f_info(y));
     if (gt(LOWER, to_lower, to_info, LOWER, tmp, tmp_info)) {
       to_lower = tmp;
       rl = tmp_r;
     }
     tmp_info.clear();
     tmp_r = Boundary_NS::mul_assign(UPPER, tmp, tmp_info,
-				    UPPER, f_upper(x), f_info(x),
-				    UPPER, f_upper(y), f_info(y));
+                                    UPPER, f_upper(x), f_info(x),
+                                    UPPER, f_upper(y), f_info(y));
     ru = Boundary_NS::mul_assign(UPPER, upper(), to_info,
-				 LOWER, f_lower(x), f_info(x),
-				 LOWER, f_lower(y), f_info(y));
+                                 LOWER, f_lower(x), f_info(x),
+                                 LOWER, f_lower(y), f_info(y));
     if (lt(UPPER, upper(), to_info, UPPER, tmp, tmp_info)) {
       upper() = tmp;
       ru = tmp_r;
@@ -18178,7 +18220,7 @@ template <typename To_Boundary, typename To_Info>
 template <typename From1, typename From2>
 inline typename Enable_If<((Is_Singleton<From1>::value
                             || Is_Interval<From1>::value)
-			   && (Is_Singleton<From2>::value
+                           && (Is_Singleton<From2>::value
                                || Is_Interval<From2>::value)), I_Result>::type
 Interval<To_Boundary, To_Info>::div_assign(const From1& x, const From2& y) {
   PPL_ASSERT(f_OK(x));
@@ -18207,58 +18249,59 @@ Interval<To_Boundary, To_Info>::div_assign(const From1& x, const From2& y) {
 
   PPL_DIRTY_TEMP(To_Info, to_info);
   to_info.clear();
-  Result rl, ru;
+  Result rl;
+  Result ru;
   PPL_DIRTY_TEMP(To_Boundary, to_lower);
   if (yls >= 0) {
     if (xls >= 0) {
       rl = div_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
       ru = div_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
     }
     else if (xus <= 0) {
       rl = div_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
       ru = div_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
     }
     else {
       rl = div_assign_z(LOWER, to_lower, to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
       ru = div_assign_z(UPPER, upper(), to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
     }
   }
   else if (yus <= 0) {
     if (xls >= 0) {
       rl = div_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
       ru = div_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			LOWER, f_lower(y), f_info(y), yls);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        LOWER, f_lower(y), f_info(y), yls);
     }
     else if (xus <= 0) {
       rl = div_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			LOWER, f_lower(y), f_info(y), yls);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        LOWER, f_lower(y), f_info(y), yls);
       ru = div_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
     }
     else {
       rl = div_assign_z(LOWER, to_lower, to_info,
-			UPPER, f_upper(x), f_info(x), xus,
-			UPPER, f_upper(y), f_info(y), yus);
+                        UPPER, f_upper(x), f_info(x), xus,
+                        UPPER, f_upper(y), f_info(y), yus);
       ru = div_assign_z(UPPER, upper(), to_info,
-			LOWER, f_lower(x), f_info(x), xls,
-			UPPER, f_upper(y), f_info(y), yus);
+                        LOWER, f_lower(x), f_info(x), xls,
+                        UPPER, f_upper(y), f_info(y), yus);
     }
   }
   else {
@@ -18501,7 +18544,7 @@ swap(Interval<Boundary, Info>& x, Interval<Boundary, Info>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_templates.hh line 1. */
 /* Interval class implementation: non-inline template functions.
 */
 
@@ -18568,8 +18611,8 @@ template <typename Boundary, typename Info>
 template <typename From, typename Iterator>
 typename Enable_If<Is_Interval<From>::value, void>::type
 Interval<Boundary, Info>::CC76_widening_assign(const From& y,
-					       Iterator first,
-					       Iterator last) {
+                                               Iterator first,
+                                               Iterator last) {
   // We assume that `y' is contained in or equal to `*this'.
   PPL_ASSERT(contains(y));
   Interval<Boundary, Info>& x = *this;
@@ -18582,11 +18625,11 @@ Interval<Boundary, Info>::CC76_widening_assign(const From& y,
     if (y_ub < x_ub) {
       Iterator k = std::lower_bound(first, last, x_ub);
       if (k != last) {
-	if (x_ub < *k)
-	  x_ub = *k;
+        if (x_ub < *k)
+          x_ub = *k;
       }
       else
-	x.upper_extend();
+        x.upper_extend();
     }
   }
 
@@ -18598,12 +18641,12 @@ Interval<Boundary, Info>::CC76_widening_assign(const From& y,
     if (y_lb > x_lb) {
       Iterator k = std::lower_bound(first, last, x_lb);
       if (k != last) {
-	if (x_lb < *k) {
-	  if (k != first)
-	    x_lb = *--k;
-	  else
-	    x.lower_extend();
-	}
+        if (x_lb < *k) {
+          if (k != first)
+            x_lb = *--k;
+          else
+            x.lower_extend();
+        }
       }
       else {
         if (k != first)
@@ -18830,7 +18873,7 @@ operator>>(std::istream& is, Interval<Boundary, Info>& x) {
   if (!lower_boundary_infinity
       && !upper_boundary_infinity
       && (lower_bound > upper_bound
-	  || (lower_open && lower_bound == upper_bound)))
+          || (lower_open && lower_bound == upper_bound)))
     x.assign(EMPTY);
   else {
     if (lower_boundary_infinity)
@@ -18881,9 +18924,9 @@ Interval<Boundary, Info>::empty_intersection_assign(const From&) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Interval.defs.hh line 760. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Interval_defs.hh line 762. */
 
-/* Automatically generated from PPL source file ../src/Integer_Interval.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Integer_Interval.hh line 28. */
 #include <gmpxx.h>
 
 namespace Parma_Polyhedra_Library {
@@ -18909,17 +18952,17 @@ typedef Interval<mpz_class, Integer_Interval_Info> Integer_Interval;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/initializer.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/initializer.hh line 1. */
 /* Nifty counter object for the initialization of the library.
 */
 
 
-/* Automatically generated from PPL source file ../src/Init.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Init_defs.hh line 1. */
 /* Init class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Init.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Init_defs.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -18988,12 +19031,12 @@ private:
   friend void restore_pre_PPL_rounding();
 };
 
-/* Automatically generated from PPL source file ../src/Init.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Init_inlines.hh line 1. */
 /* Init class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Init.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Init_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -19013,10 +19056,10 @@ restore_pre_PPL_rounding() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Init.defs.hh line 98. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Init_defs.hh line 98. */
 
 
-/* Automatically generated from PPL source file ../src/initializer.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/initializer.hh line 28. */
 
 #ifndef PPL_NO_AUTOMATIC_INITIALIZATION
 
@@ -19051,12 +19094,12 @@ finalize() {
 
 } //namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_defs.hh line 1. */
 /* Linear_Expression_Impl class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -19066,32 +19109,23 @@ class Linear_Expression_Impl;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Congruence.types.hh line 1. */
-
-
-namespace Parma_Polyhedra_Library {
-
-class Congruence;
-
-}
-
-/* Automatically generated from PPL source file ../src/Coefficient.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_defs.hh line 1. */
 /* Coefficient class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Coefficient.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_types.hh line 1. */
 
 
-/* Automatically generated from PPL source file ../src/Coefficient.types.hh line 17. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_types.hh line 17. */
 
 #ifdef PPL_GMP_INTEGERS
-/* Automatically generated from PPL source file ../src/GMP_Integer.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_types.hh line 1. */
 
 
-/* Automatically generated from PPL source file ../src/GMP_Integer.types.hh line 17. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_types.hh line 17. */
 #include <gmpxx.h>
-/* Automatically generated from PPL source file ../src/GMP_Integer.types.hh line 19. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_types.hh line 19. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -19118,7 +19152,7 @@ struct Coefficient_traits_template<GMP_Integer> {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Coefficient.types.hh line 20. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_types.hh line 20. */
 #endif
 
 #if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
@@ -19281,20 +19315,20 @@ typedef Coefficient_traits_template<Coefficient> Coefficient_traits;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Coefficient.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_defs.hh line 28. */
 #include <iosfwd>
 
 #if defined(PPL_CHECKED_INTEGERS) || defined(PPL_NATIVE_INTEGERS)
-/* Automatically generated from PPL source file ../src/Coefficient.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_defs.hh line 33. */
 #endif
 
 #ifdef PPL_GMP_INTEGERS
-/* Automatically generated from PPL source file ../src/GMP_Integer.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_defs.hh line 1. */
 /* GMP_Integer class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/GMP_Integer.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_defs.hh line 29. */
 #include <cstddef>
 
 namespace Parma_Polyhedra_Library {
@@ -19334,12 +19368,12 @@ void abs_assign(GMP_Integer& x, const GMP_Integer& y);
 //! Assigns to \p x the remainder of the division of \p y by \p z.
 /*! \relates GMP_Integer */
 void rem_assign(GMP_Integer& x,
-		const GMP_Integer& y, const GMP_Integer& z);
+                const GMP_Integer& y, const GMP_Integer& z);
 
 //! Assigns to \p x the greatest common divisor of \p y and \p z.
 /*! \relates GMP_Integer */
 void gcd_assign(GMP_Integer& x,
-		const GMP_Integer& y, const GMP_Integer& z);
+                const GMP_Integer& y, const GMP_Integer& z);
 
 //! Extended GCD.
 /*! \relates GMP_Integer
@@ -19347,22 +19381,22 @@ void gcd_assign(GMP_Integer& x,
   \p s and \p t the values such that \p y * \p s + \p z * \p t = \p x.
 */
 void gcdext_assign(GMP_Integer& x, GMP_Integer& s, GMP_Integer& t,
-		   const GMP_Integer& y, const GMP_Integer& z);
+                   const GMP_Integer& y, const GMP_Integer& z);
 
 //! Assigns to \p x the least common multiple of \p y and \p z.
 /*! \relates GMP_Integer */
 void lcm_assign(GMP_Integer& x,
-		const GMP_Integer& y, const GMP_Integer& z);
+                const GMP_Integer& y, const GMP_Integer& z);
 
 //! Assigns to \p x the value <CODE>x + y * z</CODE>.
 /*! \relates GMP_Integer */
 void add_mul_assign(GMP_Integer& x,
-		    const GMP_Integer& y, const GMP_Integer& z);
+                    const GMP_Integer& y, const GMP_Integer& z);
 
 //! Assigns to \p x the value <CODE>x - y * z</CODE>.
 /*! \relates GMP_Integer */
 void sub_mul_assign(GMP_Integer& x,
-		    const GMP_Integer& y, const GMP_Integer& z);
+                    const GMP_Integer& y, const GMP_Integer& z);
 
 //! Assigns to \p x the value \f$ y \cdot 2^\mathtt{exp} \f$.
 /*! \relates GMP_Integer */
@@ -19380,7 +19414,7 @@ void div_2exp_assign(GMP_Integer& x, const GMP_Integer& y, unsigned int exp);
   The behavior is undefined if \p z does not divide \p y.
 */
 void exact_div_assign(GMP_Integer& x,
-		      const GMP_Integer& y, const GMP_Integer& z);
+                      const GMP_Integer& y, const GMP_Integer& z);
 
 //! Assigns to \p x the integer square root of \p y.
 /*! \relates GMP_Integer */
@@ -19398,12 +19432,12 @@ int cmp(const GMP_Integer& x, const GMP_Integer& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/GMP_Integer.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_inlines.hh line 1. */
 /* GMP_Integer class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/GMP_Integer.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -19439,10 +19473,10 @@ rem_assign(GMP_Integer& x, const GMP_Integer& y, const GMP_Integer& z) {
 
 inline void
 gcdext_assign(GMP_Integer& x, GMP_Integer& s, GMP_Integer& t,
-	      const GMP_Integer& y, const GMP_Integer& z) {
+              const GMP_Integer& y, const GMP_Integer& z) {
   mpz_gcdext(x.get_mpz_t(),
-	     s.get_mpz_t(), t.get_mpz_t(),
-	     y.get_mpz_t(), z.get_mpz_t());
+             s.get_mpz_t(), t.get_mpz_t(),
+             y.get_mpz_t(), z.get_mpz_t());
 }
 
 inline void
@@ -19498,9 +19532,9 @@ raw_value(GMP_Integer& x) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/GMP_Integer.defs.hh line 133. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/GMP_Integer_defs.hh line 133. */
 
-/* Automatically generated from PPL source file ../src/Coefficient.defs.hh line 37. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_defs.hh line 37. */
 #endif
 
 namespace Parma_Polyhedra_Library {
@@ -19523,7 +19557,7 @@ Coefficient_traits::const_reference Coefficient_one();
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Coefficient.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_inlines.hh line 1. */
 /* Coefficient class implementation: inline functions.
 */
 
@@ -19573,14 +19607,14 @@ Coefficient_one() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Coefficient.defs.hh line 60. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Coefficient_defs.hh line 60. */
 
-/* Automatically generated from PPL source file ../src/Variables_Set.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variables_Set_defs.hh line 1. */
 /* Variables_Set class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Variables_Set.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variables_Set_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -19589,7 +19623,7 @@ class Variables_Set;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variables_Set.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variables_Set_defs.hh line 30. */
 #include <iosfwd>
 #include <set>
 
@@ -19665,12 +19699,12 @@ public:
   PPL_OUTPUT_DECLARATIONS
 };
 
-/* Automatically generated from PPL source file ../src/Variables_Set.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variables_Set_inlines.hh line 1. */
 /* Variables_Set class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Variables_Set.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variables_Set_inlines.hh line 28. */
 #include <stdexcept>
 
 namespace Parma_Polyhedra_Library {
@@ -19718,14 +19752,14 @@ Variables_Set::total_memory_in_bytes() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variables_Set.defs.hh line 106. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variables_Set_defs.hh line 106. */
 
-/* Automatically generated from PPL source file ../src/Dense_Row.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_defs.hh line 1. */
 /* Dense_Row class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Dense_Row.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -19734,11 +19768,11 @@ class Dense_Row;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Dense_Row.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Dense_Row.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_defs.hh line 30. */
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -19747,7 +19781,7 @@ class Sparse_Row;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Dense_Row.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_defs.hh line 33. */
 #include <memory>
 #include <vector>
 #include <limits>
@@ -20273,12 +20307,12 @@ void linear_combine(Dense_Row& x, const Dense_Row& y,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Dense_Row.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_inlines.hh line 1. */
 /* Dense_Row class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Dense_Row.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_inlines.hh line 28. */
 #include <cstddef>
 #include <limits>
 #include <algorithm>
@@ -20782,7 +20816,7 @@ iter_swap(std::vector<Dense_Row>::iterator x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Dense_Row.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_templates.hh line 1. */
 /* Dense_Row class implementation: non-inline template functions.
 */
 
@@ -20816,21 +20850,21 @@ Dense_Row::combine(const Dense_Row& y, const Func1& /* f */, const Func2& g,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Dense_Row.defs.hh line 560. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Dense_Row_defs.hh line 560. */
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_defs.hh line 1. */
 /* Sparse_Row class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/CO_Tree.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_defs.hh line 1. */
 /* CO_Tree class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/CO_Tree.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -20839,9 +20873,9 @@ class CO_Tree;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/CO_Tree.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/CO_Tree.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_defs.hh line 30. */
 #include <memory>
 
 #ifndef PPL_CO_TREE_EXTRA_DEBUG
@@ -21769,6 +21803,17 @@ private:
                                data_type_const_reference data,
                                tree_iterator itr);
 
+  //! Helper for \c insert_precise.
+  /*!
+    This helper method takes the same arguments as \c insert_precise,
+    but besides assuming that \p itr is a correct hint, it also assumes
+    that \p key and \p data are not in the tree; namely, a proper
+    insertion has to be done and the insertion can not invalidate \p data.
+  */
+  tree_iterator insert_precise_aux(dimension_type key,
+                                   data_type_const_reference data,
+                                   tree_iterator itr);
+
   //! Inserts an element in the tree.
   /*!
 
@@ -22357,7 +22402,7 @@ void swap(CO_Tree::iterator& x, CO_Tree::iterator& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/CO_Tree.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_inlines.hh line 1. */
 /* CO_Tree class implementation: inline functions.
 */
 
@@ -22462,7 +22507,8 @@ CO_Tree::insert(dimension_type key, data_type_const_reference data1) {
     tree_iterator itr(*this);
     PPL_ASSERT(itr.index() != unused_index);
     return iterator(itr);
-  } else {
+  }
+  else {
     tree_iterator itr(*this);
     itr.go_down_searching_key(key);
     return iterator(insert_precise(key, data1, itr));
@@ -22571,7 +22617,8 @@ inline CO_Tree::iterator
 CO_Tree::bisect_in(iterator first, iterator last, dimension_type key) {
   PPL_ASSERT(first != end());
   PPL_ASSERT(last != end());
-  dimension_type index = bisect_in(dfs_index(first), dfs_index(last), key);
+  const dimension_type index
+    = bisect_in(dfs_index(first), dfs_index(last), key);
   return iterator(*this, index);
 }
 
@@ -22580,7 +22627,8 @@ CO_Tree::bisect_in(const_iterator first, const_iterator last,
                    dimension_type key) const {
   PPL_ASSERT(first != end());
   PPL_ASSERT(last != end());
-  dimension_type index = bisect_in(dfs_index(first), dfs_index(last), key);
+  const dimension_type index
+    = bisect_in(dfs_index(first), dfs_index(last), key);
   return const_iterator(*this, index);
 }
 
@@ -22588,7 +22636,8 @@ inline CO_Tree::iterator
 CO_Tree::bisect_near(iterator hint, dimension_type key) {
   if (hint == end())
     return bisect(key);
-  dimension_type index = bisect_near(dfs_index(hint), key);
+  const dimension_type index
+    = bisect_near(dfs_index(hint), key);
   return iterator(*this, index);
 }
 
@@ -22596,7 +22645,7 @@ inline CO_Tree::const_iterator
 CO_Tree::bisect_near(const_iterator hint, dimension_type key) const {
   if (hint == end())
     return bisect(key);
-  dimension_type index = bisect_near(dfs_index(hint), key);
+  const dimension_type index = bisect_near(dfs_index(hint), key);
   return const_iterator(*this, index);
 }
 
@@ -23101,12 +23150,12 @@ CO_Tree::tree_iterator::get_parent() {
 inline void
 CO_Tree::tree_iterator::follow_left_children_with_value() {
   PPL_ASSERT(index() != unused_index);
-  dimension_type* p = tree.indexes;
+  const dimension_type* p = tree.indexes;
   p += i;
   p -= (offset - 1);
   while (*p == unused_index)
     ++p;
-  ptrdiff_t distance = p - tree.indexes;
+  const ptrdiff_t distance = p - tree.indexes;
   PPL_ASSERT(distance >= 0);
   i = static_cast<dimension_type>(distance);
   offset = least_significant_one_mask(i);
@@ -23116,12 +23165,12 @@ CO_Tree::tree_iterator::follow_left_children_with_value() {
 inline void
 CO_Tree::tree_iterator::follow_right_children_with_value() {
   PPL_ASSERT(index() != unused_index);
-  dimension_type* p = tree.indexes;
+  const dimension_type* p = tree.indexes;
   p += i;
   p += (offset - 1);
   while (*p == unused_index)
     --p;
-  ptrdiff_t distance = p - tree.indexes;
+  const ptrdiff_t distance = p - tree.indexes;
   PPL_ASSERT(distance >= 0);
   i = static_cast<dimension_type>(distance);
   offset = least_significant_one_mask(i);
@@ -23199,7 +23248,7 @@ swap(CO_Tree::iterator& x, CO_Tree::iterator& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/CO_Tree.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_templates.hh line 1. */
 /* CO_Tree class implementation: non-inline template functions.
 */
 
@@ -23215,7 +23264,7 @@ CO_Tree::CO_Tree(Iterator i, dimension_type n) {
     return;
   }
 
-  dimension_type new_max_depth = integer_log2(n) + 1;
+  const dimension_type new_max_depth = integer_log2(n) + 1;
   reserved_size = (static_cast<dimension_type>(1) << new_max_depth) - 1;
 
   if (is_greater_than_ratio(n, reserved_size, max_density_percent)
@@ -23290,14 +23339,16 @@ CO_Tree::CO_Tree(Iterator i, dimension_type n) {
 
     if (top_n == 0) {
       --stack_first_empty;
-    } else {
+    }
+    else {
       if (top_n == 1) {
         PPL_ASSERT(root.index() == unused_index);
         root.index() = i.index();
         new (&(*root)) data_type(*i);
         ++i;
         --stack_first_empty;
-      } else {
+      }
+      else {
         PPL_ASSERT(stack_first_empty + 3 < sizeof(stack)/sizeof(stack[0]));
 
         const dimension_type half = (top_n + 1) / 2;
@@ -23316,9 +23367,9 @@ CO_Tree::CO_Tree(Iterator i, dimension_type n) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/CO_Tree.defs.hh line 1547. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/CO_Tree_defs.hh line 1558. */
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_defs.hh line 32. */
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! A finite sparse sequence of coefficients.
@@ -24214,7 +24265,7 @@ void linear_combine(Sparse_Row& x, const Sparse_Row& y,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_inlines.hh line 1. */
 /* Sparse_Row class implementation: inline functions.
 */
 
@@ -24570,7 +24621,7 @@ swap(Sparse_Row& x, Sparse_Row& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_templates.hh line 1. */
 /* Sparse_Row class implementation: non-inline template functions.
 */
 
@@ -24585,7 +24636,8 @@ Sparse_Row::combine_needs_first(const Sparse_Row& y,
   if (this == &y) {
     for (iterator i = begin(), i_end = end(); i != i_end; ++i)
       g(*i, *i);
-  } else {
+  }
+  else {
     iterator i = begin();
     // This is a const reference to an internal iterator, that is kept valid.
     // If we just stored a copy, that would be invalidated by the calls to
@@ -24601,14 +24653,16 @@ Sparse_Row::combine_needs_first(const Sparse_Row& y,
         else
           ++i;
         ++j;
-      } else
+      }
+      else
         if (i.index() < j.index()) {
           f(*i);
           if (*i == 0)
             i = reset(i);
           else
             ++i;
-        } else
+        }
+        else
           j = y.lower_bound(j, i.index());
     while (i != i_end) {
       f(*i);
@@ -24641,7 +24695,8 @@ Sparse_Row::combine(const Sparse_Row& y, const Func1& f,
   if (this == &y) {
     for (iterator i = begin(), i_end = end(); i != i_end; ++i)
       g(*i, *i);
-  } else {
+  }
+  else {
     iterator i = begin();
     // This is a const reference to an internal iterator, that is kept valid.
     // If we just stored a copy, that would be invalidated by the calls to
@@ -24657,14 +24712,16 @@ Sparse_Row::combine(const Sparse_Row& y, const Func1& f,
         else
           ++i;
         ++j;
-      } else
+      }
+      else
         if (i.index() < j.index()) {
           f(*i);
           if (*i == 0)
             i = reset(i);
           else
             ++i;
-        } else {
+        }
+        else {
           PPL_ASSERT(i.index() > j.index());
           i = insert(i, j.index());
           h(*i, *j);
@@ -24695,16 +24752,16 @@ Sparse_Row::combine(const Sparse_Row& y, const Func1& f,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sparse_Row.defs.hh line 929. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sparse_Row_defs.hh line 929. */
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.defs.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_defs.hh line 33. */
 #include <cstddef>
-/* Automatically generated from PPL source file ../src/Linear_Expression_Interface.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Interface_defs.hh line 1. */
 /* Linear_Expression_Interface class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Interface.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Interface_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -24713,7 +24770,7 @@ class Linear_Expression_Interface;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Interface.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Interface_defs.hh line 33. */
 #include <vector>
 #include <set>
 
@@ -25170,7 +25227,7 @@ public:
   virtual void get_row(Sparse_Row& row) const = 0;
 };
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.defs.hh line 36. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_defs.hh line 35. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -25713,20 +25770,11 @@ public:
 
   //! Implementation sizing constructor.
   /*!
-    The bool parameter is just to avoid problems with
-    the constructor Linear_Expression_Impl(Coefficient_traits::const_reference n).
+    The bool parameter is just to avoid problems with the constructor
+    Linear_Expression_Impl(Coefficient_traits::const_reference n).
   */
   Linear_Expression_Impl(dimension_type space_dim, bool);
 
-  //! Builds the linear expression corresponding to congruence \p cg, and
-  //! with the specified space dimension.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    builds the linear expression \f$\sum_{i=0}^{space_dim-1} a_i x_i + b\f$.
-  */
-  Linear_Expression_Impl(const Congruence& cg, dimension_type space_dim);
-
   //! Linearly combines \p *this with \p y so that the coefficient of \p v
   //! is 0.
   /*!
@@ -26048,17 +26096,17 @@ Linear_Expression_Impl<Sparse_Row>::const_iterator::skip_zeroes_forward();
 } // namespace Parma_Polyhedra_Library
 
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_inlines.hh line 1. */
 /* Linear_Expression_Impl class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/math_utilities.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/math_utilities_defs.hh line 1. */
 /* Declarations of some math utility functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/math_utilities.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/math_utilities_defs.hh line 29. */
 #include <gmpxx.h>
 
 namespace Parma_Polyhedra_Library {
@@ -26069,7 +26117,7 @@ namespace Parma_Polyhedra_Library {
 template <typename T>
 typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
 numer_denom(const T& from,
-	    Coefficient& numer, Coefficient& denom);
+            Coefficient& numer, Coefficient& denom);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Divides \p x by \p y into \p to, rounding the result towards plus infinity.
@@ -26077,8 +26125,8 @@ numer_denom(const T& from,
 template <typename T>
 typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
 div_round_up(T& to,
-	     Coefficient_traits::const_reference x,
-	     Coefficient_traits::const_reference y);
+             Coefficient_traits::const_reference x,
+             Coefficient_traits::const_reference y);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Assigns to \p x the minimum between \p x and \p y.
@@ -26120,8 +26168,8 @@ is_additive_inverse(const T& x, const T& y);
 #endif
 void
 normalize2(Coefficient_traits::const_reference x,
-	   Coefficient_traits::const_reference y,
-	   Coefficient& n_x, Coefficient& n_y);
+           Coefficient_traits::const_reference y,
+           Coefficient& n_x, Coefficient& n_y);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Returns <CODE>true</CODE> if and only if \p x is in canonical form.
@@ -26138,21 +26186,21 @@ low_bits_mask(unsigned n);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/math_utilities.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/math_utilities_inlines.hh line 1. */
 /* Implementation of some math utility functions: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/math_utilities.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/math_utilities_inlines.hh line 28. */
 #include <limits>
-/* Automatically generated from PPL source file ../src/math_utilities.inlines.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/math_utilities_inlines.hh line 30. */
 
 namespace Parma_Polyhedra_Library {
 
 inline void
 normalize2(Coefficient_traits::const_reference x,
-	   Coefficient_traits::const_reference y,
-	   Coefficient& n_x, Coefficient& n_y) {
+           Coefficient_traits::const_reference y,
+           Coefficient& n_x, Coefficient& n_y) {
   PPL_DIRTY_TEMP_COEFFICIENT(gcd);
   gcd_assign(gcd, x, y);
   exact_div_assign(n_x, x, gcd);
@@ -26169,10 +26217,10 @@ low_bits_mask(const unsigned n) {
 template <typename T>
 inline typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
 numer_denom(const T& from,
-	    Coefficient& numer, Coefficient& denom) {
+            Coefficient& numer, Coefficient& denom) {
   PPL_ASSERT(!is_not_a_number(from)
-	 && !is_minus_infinity(from)
-	 && !is_plus_infinity(from));
+         && !is_minus_infinity(from)
+         && !is_plus_infinity(from));
   PPL_DIRTY_TEMP(mpq_class, q);
   assign_r(q, from, ROUND_NOT_NEEDED);
   numer = q.get_num();
@@ -26182,8 +26230,8 @@ numer_denom(const T& from,
 template <typename T>
 inline typename Enable_If<Is_Native_Or_Checked<T>::value, void>::type
 div_round_up(T& to,
-	     Coefficient_traits::const_reference x,
-	     Coefficient_traits::const_reference y) {
+             Coefficient_traits::const_reference x,
+             Coefficient_traits::const_reference y) {
   PPL_DIRTY_TEMP(mpq_class, q_x);
   PPL_DIRTY_TEMP(mpq_class, q_y);
   // Note: this code assumes that a Coefficient is always convertible
@@ -26236,9 +26284,9 @@ is_canonical(const mpq_class& x) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/math_utilities.defs.hh line 109. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/math_utilities_defs.hh line 109. */
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_inlines.hh line 28. */
 #include <stdexcept>
 
 namespace Parma_Polyhedra_Library {
@@ -26305,7 +26353,7 @@ inline void
 Linear_Expression_Impl<Row>
 ::set_coefficient(Variable v, Coefficient_traits::const_reference n) {
   PPL_ASSERT(v.space_dimension() <= space_dimension());
-  dimension_type i = v.space_dimension();
+  const dimension_type i = v.space_dimension();
   if (n == 0)
     row.reset(i);
   else
@@ -26493,19 +26541,19 @@ operator<<(std::ostream& s, const Linear_Expression_Impl<Row>& e) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_templates.hh line 1. */
 /* Linear_Expression_Impl class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.templates.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_templates.hh line 29. */
 
-/* Automatically generated from PPL source file ../src/Constraint.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_defs.hh line 1. */
 /* Constraint class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constraint.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26514,9 +26562,18 @@ class Constraint;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constraint.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_defs.hh line 28. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_types.hh line 1. */
+
+
+namespace Parma_Polyhedra_Library {
+
+class Congruence;
+
+}
 
-/* Automatically generated from PPL source file ../src/Polyhedron.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26525,7 +26582,7 @@ class Polyhedron;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/termination.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26534,7 +26591,7 @@ class Termination_Helpers;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26546,7 +26603,7 @@ class Octagonal_Shape_Helper;
 
 }
 
-/* Automatically generated from PPL source file ../src/Grid.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26555,16 +26612,16 @@ class Grid;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constraint.defs.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_defs.hh line 35. */
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_defs.hh line 1. */
 /* Linear_Expression class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Generator.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26573,7 +26630,7 @@ class Generator;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26582,7 +26639,20 @@ class Grid_Generator;
 
 }
 
-/* Automatically generated from PPL source file ../src/Constraint_System.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_types.hh line 1. */
+
+
+namespace Parma_Polyhedra_Library {
+
+template <typename Row>
+class Linear_System;
+
+template <typename Row>
+class Linear_System_With_Bit_Matrix_iterator;
+
+} // namespace Parma_Polyhedra_Library
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26592,20 +26662,16 @@ class Constraint_System_const_iterator;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_System_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
-template <typename Row>
-class Linear_System;
-
-template <typename Row>
-class Linear_System_With_Bit_Matrix_iterator;
+class Congruence_System;
 
-} // namespace Parma_Polyhedra_Library
+}
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26623,7 +26689,7 @@ class PIP_Problem;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/BHRZ03_Certificate.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BHRZ03_Certificate_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26632,7 +26698,7 @@ class BHRZ03_Certificate;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Scalar_Products.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Scalar_Products_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26643,7 +26709,7 @@ class Topology_Adjusted_Scalar_Product_Assign;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -26663,50 +26729,455 @@ class MIP_Problem;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Congruence_System.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
-class Congruence_System;
+template <typename T>
+class BD_Shape;
 
-}
+class BD_Shape_Helpers;
 
-/* Automatically generated from PPL source file ../src/BD_Shape.types.hh line 1. */
+} // namespace Parma_Polyhedra_Library
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_defs.hh line 47. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Adapter_defs.hh line 1. */
+/* Expression_Adapter class declaration.
+*/
+
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Adapter_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
+class Expression_Adapter_Base;
+
 template <typename T>
-class BD_Shape;
+class Expression_Adapter;
 
-class BD_Shape_Helpers;
+template <typename T>
+class Expression_Adapter_Transparent;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Adapter_defs.hh line 32. */
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! Adapters' base type (for template meta-programming).
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+class Parma_Polyhedra_Library::Expression_Adapter_Base {
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An adapter for Linear_Expression objects.
+/*!
+  The adapters are meant to provide read-only, customized access to the
+  Linear_Expression members in Constraint, Generator, Congruence and
+  Grid_Generator objects. They typically implement the user-level view
+  of these expressions.
+
+  \note
+  A few methods implement low-level access routines and will take
+  bare indexes as arguments (rather than Variable objects):
+  when such a bare index \c i is zero, the inhomogeneous term is meant;
+  when the bare index \c i is greater than zero, the coefficient of the
+  variable having id <CODE>i - 1</CODE> is meant.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Adapter
+  : public Expression_Adapter_Base {
+public:
+  //! The type of this object.
+  typedef Expression_Adapter<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename T::const_reference inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename T::raw_type raw_type;
+
+  //! Returns an adapter after one-level unwrapping.
+  inner_type inner() const;
+
+  //! The type of const iterators on coefficients.
+  typedef typename raw_type::const_iterator const_iterator;
 
+  //! Returns the current representation of \p *this.
+  Representation representation() const;
+
+  //! Iterator pointing to the first nonzero variable coefficient.
+  const_iterator begin() const;
+
+  //! Iterator pointing after the last nonzero variable coefficient.
+  const_iterator end() const;
+
+  //! Iterator pointing to the first nonzero variable coefficient
+  //! of a variable bigger than or equal to \p v.
+  const_iterator lower_bound(Variable v) const;
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns the inhomogeneous term of \p *this.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is zero.
+  bool is_zero() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are zero.
+  */
+  bool all_homogeneous_terms_are_zero() const;
+
+  /*! \brief Returns \p true if \p *this is equal to \p y.
+
+    Note that <CODE>(*this == y)</CODE> has a completely different meaning.
+  */
+  template <typename Expression>
+  bool is_equal_to(const Expression& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars is zero.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+  //! Returns the \p i -th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Returns the coefficient of variable \p v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is zero,
+    for each i in [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  //! Returns the number of zero coefficient in [start, end).
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end).
+    Returns zero if all the coefficients in the range are zero.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  //! Returns the index of the last nonzero element, or zero if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last),
+  //! or \p last if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there
+  //! are no nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Removes from set \p x all the indexes of nonzero elements in \p *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \c true if <CODE>(*this)[i]</CODE> is equal to <CODE>y[i]</CODE>,
+  //! for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \c true if <CODE>(*this)[i]*c1</CODE> is equal to
+  //! <CODE>y[i]*c2</CODE>, for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Sparse_Row& row) const;
+
+  //! Returns \c true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both \p *this and \p y.
+  template <typename Expression>
+  bool have_a_common_variable(const Expression& y,
+                              Variable first, Variable last) const;
+
+protected:
+  //! Constructor.
+  explicit Expression_Adapter(const raw_type& expr);
+  //! The raw, completely unwrapped object subject to adaptation.
+  const raw_type& raw_;
+};
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! A transparent adapter for Linear_Expression objects.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Adapter_Transparent
+  : public Expression_Adapter<T> {
+  typedef Expression_Adapter<T> base_type;
+public:
+  //! The type of this object.
+  typedef Expression_Adapter_Transparent<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename base_type::inner_type inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename base_type::raw_type raw_type;
+
+  //! The type of const iterators on coefficients.
+  typedef typename base_type::const_iterator const_iterator;
+
+  //! Constructor.
+  explicit Expression_Adapter_Transparent(const raw_type& expr);
+};
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Adapter_inlines.hh line 1. */
+/* Expression_Adapter class implementation: inline functions.
+*/
+
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Adapter_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
+template <typename T>
+inline
+Expression_Adapter<T>::Expression_Adapter(const raw_type& expr)
+  : raw_(expr) {
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::inner_type
+Expression_Adapter<T>::inner() const {
+  return inner_type(raw_);
+}
+
+template <typename T>
+inline Representation
+Expression_Adapter<T>::representation() const {
+  return inner().representation();
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::const_iterator
+Expression_Adapter<T>::begin() const {
+  return inner().begin();
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::const_iterator
+Expression_Adapter<T>::end() const {
+  return inner().end();
+}
+
+template <typename T>
+inline typename Expression_Adapter<T>::const_iterator
+Expression_Adapter<T>::lower_bound(Variable v) const {
+  return inner().lower_bound(v);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::space_dimension() const {
+  return inner().space_dimension();
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::coefficient(Variable v) const {
+  return inner().coefficient(v);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::inhomogeneous_term() const {
+  return inner().inhomogeneous_term();
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>::is_zero() const {
+  return inner().is_zero();
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>::all_homogeneous_terms_are_zero() const {
+  return inner().all_homogeneous_terms_are_zero();
+}
+
+template <typename T>
 template <typename Expression>
+inline bool
+Expression_Adapter<T>::is_equal_to(const Expression& y) const {
+  return inner().is_equal_to(y);
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>
+::all_zeroes(const Variables_Set& vars) const {
+  return inner().all_zeroes(vars);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::get(dimension_type i) const {
+  return inner().get(i);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Adapter<T>::get(Variable v) const {
+  return inner().get(v);
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>::all_zeroes(dimension_type start,
+                                  dimension_type end) const {
+  return inner().all_zeroes(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::num_zeroes(dimension_type start,
+                                  dimension_type end) const {
+  return inner().num_zeroes(start, end);
+}
+
+template <typename T>
+inline Coefficient
+Expression_Adapter<T>::gcd(dimension_type start,
+                           dimension_type end) const {
+  return inner().gcd(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::last_nonzero() const {
+  return inner().last_nonzero();
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::last_nonzero(dimension_type first,
+                                    dimension_type last) const {
+  return inner().last_nonzero(first, last);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Adapter<T>::first_nonzero(dimension_type first,
+                                     dimension_type last) const {
+  return inner().first_nonzero(first, last);
+}
+
+template <typename T>
+inline bool
+Expression_Adapter<T>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const {
+  return inner().all_zeroes_except(vars, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Adapter<T>
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
+  inner().has_a_free_dimension_helper(x);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>
+::is_equal_to(const Expression& y,
+              dimension_type start, dimension_type end) const {
+  return inner().is_equal_to(y, start, end);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>
+::is_equal_to(const Expression& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  return inner().is_equal_to(y, c1, c2, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Adapter<T>::get_row(Dense_Row& row) const {
+  inner().get_row(row);
+}
+
+template <typename T>
+inline void
+Expression_Adapter<T>::get_row(Sparse_Row& row) const {
+  inner().get_row(row);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Adapter<T>
+::have_a_common_variable(const Expression& y,
+                         Variable first, Variable last) const {
+  return inner().have_a_common_variable(y, first, last);
+}
+
+template <typename T>
+inline
+Expression_Adapter_Transparent<T>
+::Expression_Adapter_Transparent(const raw_type& expr)
+  : base_type(expr) {
+}
+
+} // namespace Parma_Polyhedra_Library
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Adapter_defs.hh line 215. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_types.hh line 1. */
+
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
 class Expression_Hide_Inhomo;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
-template <typename Expression>
+template <typename T>
 class Expression_Hide_Last;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.defs.hh line 51. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_defs.hh line 51. */
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.defs.hh line 54. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_defs.hh line 54. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -26943,77 +27414,64 @@ std::ostream& operator<<(std::ostream& s, const Linear_Expression& e);
 */
 class Parma_Polyhedra_Library::Linear_Expression {
 public:
-
   static const Representation default_representation = SPARSE;
 
   //! Default constructor: returns a copy of Linear_Expression::zero().
   explicit Linear_Expression(Representation r = default_representation);
 
-  //! Ordinary copy constructor.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
+  /*! \brief Ordinary copy constructor.
+    \note
+    The new expression will have the same representation as \p e
+    (not necessarily the default_representation).
+  */
   Linear_Expression(const Linear_Expression& e);
 
   //! Copy constructor that takes also a Representation.
   Linear_Expression(const Linear_Expression& e, Representation r);
 
-  //! Copy constructor from a Expression_Hide_Inhomo.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Inhomo<Expression>& e);
-
-  //! Copy constructor from a Expression_Hide_Inhomo that takes a
-  //! Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    Representation r);
-
-  //! Copy constructor from a Expression_Hide_Inhomo that takes a space
-  //! dimension.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                             dimension_type space_dim);
-
-  //! Copy constructor from a Expression_Hide_Inhomo that takes a
-  //! space dimension and a Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    dimension_type space_dim, Representation r);
+  // Queried by expression adapters.
+  typedef const Linear_Expression& const_reference;
+  typedef Linear_Expression raw_type;
 
-  //! Copy constructor from a Expression_Hide_Last.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Last<Expression>& e);
+  /*! \brief Copy constructor from a linear expression adapter.
+    \note
+    The new expression will have the same representation as \p e
+    (not necessarily the default_representation).
+  */
+  template <typename LE_Adapter>
+  explicit
+  Linear_Expression(const LE_Adapter& e,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
 
-  //! Copy constructor from a Expression_Hide_Last that takes a
-  //! Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    Representation r);
+  /*! \brief Copy constructor from a linear expression adapter that takes a
+    Representation.
+  */
+  template <typename LE_Adapter>
+  Linear_Expression(const LE_Adapter& e, Representation r,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
 
-  //! Copy constructor from a Expression_Hide_Last that takes a space
-  //! dimension.
-  //! Note that the representation of the new expression will be e's
-  //! representation and not necessarily default_representation, so that
-  //! the copy and e are indistinguishable.
-  template <typename Expression>
-  explicit Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                             dimension_type space_dim);
+  /*! \brief
+    Copy constructor from a linear expression adapter that takes a
+    space dimension.
+    \note
+    The new expression will have the same representation as \p e
+    (not necessarily default_representation).
+  */
+  template <typename LE_Adapter>
+  explicit
+  Linear_Expression(const LE_Adapter& e, dimension_type space_dim,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
 
-  //! Copy constructor from a Expression_Hide_Last that takes a
-  //! space dimension and a Representation.
-  template <typename Expression>
-  Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    dimension_type space_dim, Representation r);
+  /*! \brief
+    Copy constructor from a linear expression adapter that takes a
+    space dimension and a Representation.
+  */
+  template <typename LE_Adapter>
+  Linear_Expression(const LE_Adapter& e,
+                    dimension_type space_dim, Representation r,
+                    typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type = 0);
 
+  //! Assignment operator.
   Linear_Expression& operator=(const Linear_Expression& e);
 
   //! Destructor.
@@ -27034,114 +27492,6 @@ public:
   */
   Linear_Expression(Variable v, Representation r = default_representation);
 
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to constraint \p c.
-  /*!
-    Given the constraint
-    \f$c = \bigl(\sum_{i=0}^{n-1} a_i x_i + b \relsym 0\bigr)\f$,
-    where \f$\mathord{\relsym} \in \{ =, \geq, > \}\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-    If \p c is an inequality (resp., equality) constraint, then
-    the built linear expression is unique up to a positive
-    (resp., non-zero) factor.
-
-    The constructed Linear_Expression has the same representation as \p c.
-  */
-  explicit Linear_Expression(const Constraint& c);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to constraint \p c.
-  /*!
-    Given the constraint
-    \f$c = \bigl(\sum_{i=0}^{n-1} a_i x_i + b \relsym 0\bigr)\f$,
-    where \f$\mathord{\relsym} \in \{ =, \geq, > \}\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-    If \p c is an inequality (resp., equality) constraint, then
-    the built linear expression is unique up to a positive
-    (resp., non-zero) factor.
-  */
-  explicit Linear_Expression(const Constraint& c, Representation r);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to generator \p g
-    (for points and closure points, the divisor is not copied).
-
-    Given the generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    (where, for lines and rays, we have \f$d = 1\f$),
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression will always be 0.
-    If \p g is a ray, point or closure point (resp., a line), then
-    the linear expression is unique up to a positive
-    (resp., non-zero) factor.
-
-    The constructed Linear_Expression has the same representation as \p g.
-  */
-  explicit Linear_Expression(const Generator& g);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to generator \p g
-    (for points and closure points, the divisor is not copied).
-
-    Given the generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    (where, for lines and rays, we have \f$d = 1\f$),
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression will always be 0.
-    If \p g is a ray, point or closure point (resp., a line), then
-    the linear expression is unique up to a positive
-    (resp., non-zero) factor.
-  */
-  explicit Linear_Expression(const Generator& g, Representation r);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to grid generator \p g
-    (for points, parameters and lines the divisor is not copied).
-
-    Given the grid generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression is always 0.
-
-    The constructed Linear_Expression has the same representation as \p g.
-  */
-  explicit Linear_Expression(const Grid_Generator& g);
-
-  // TODO: Consider removing this.
-  /*! \brief
-    Builds the linear expression corresponding to grid generator \p g
-    (for points, parameters and lines the divisor is not copied).
-
-    Given the grid generator
-    \f$g = (\frac{a_0}{d}, \ldots, \frac{a_{n-1}}{d})^\transpose\f$
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i\f$.
-    The inhomogeneous term of the linear expression is always 0.
-  */
-  explicit Linear_Expression(const Grid_Generator& g, Representation r);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to congruence \p cg.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-
-    The constructed Linear_Expression has the same representation as \p cg.
-  */
-  explicit Linear_Expression(const Congruence& cg);
-
-  // TODO: Consider removing this.
-  //! Builds the linear expression corresponding to congruence \p cg.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression \f$\sum_{i=0}^{n-1} a_i x_i + b\f$.
-  */
-  explicit Linear_Expression(const Congruence& cg, Representation r);
-
   //! Returns the current representation of *this.
   Representation representation() const;
 
@@ -27424,29 +27774,6 @@ private:
   Linear_Expression(dimension_type space_dim, bool,
                     Representation r = default_representation);
 
-  //! Builds the linear expression corresponding to congruence \p cg, and
-  //! with the specified space dimension.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression
-    \f$\sum_{i=0}^{space_dim-1} a_i x_i + b\f$.
-
-    The constructed Linear_Expression has the same representation as \p cg.
-  */
-  Linear_Expression(const Congruence& cg, dimension_type space_dim);
-
-  //! Builds the linear expression corresponding to congruence \p cg, and
-  //! with the specified space dimension.
-  /*!
-    Given the congruence
-    \f$cg = \bigl(\sum_{i=0}^{n-1} a_i x_i + b = 0 \pmod{m}\bigr)\f$,
-    this builds the linear expression
-    \f$\sum_{i=0}^{space_dim-1} a_i x_i + b\f$.
-  */
-  Linear_Expression(const Congruence& cg, dimension_type space_dim,
-                    Representation r);
-
   // NOTE: This method is public, but it's not exposed in Linear_Expression,
   // so that it can be used internally in the PPL, by friends of
   // Linear_Expression.
@@ -27539,8 +27866,8 @@ private:
   dimension_type first_nonzero(dimension_type first, dimension_type last) const;
 
   /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
   */
   bool all_zeroes_except(const Variables_Set& vars,
                          dimension_type start, dimension_type end) const;
@@ -27626,6 +27953,8 @@ private:
   template <typename T>
   friend class Box;
   template <typename T>
+  friend class Expression_Adapter;
+  template <typename T>
   friend class Expression_Hide_Inhomo;
   template <typename T>
   friend class Expression_Hide_Last;
@@ -27721,903 +28050,12 @@ void swap(Linear_Expression::const_iterator& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_inlines.hh line 1. */
 /* Linear_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.defs.hh line 1. */
-/* Expression_Hide_Inhomo class declaration.
-*/
-
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.defs.hh line 28. */
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.defs.hh line 32. */
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A Linear_Expression-like object that hides the inhomogeneous term.
-//! The methods of this class always pretend that it's 0.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Expression>
-class Parma_Polyhedra_Library::Expression_Hide_Inhomo {
-public:
-
-  //! Wraps `expr'. Note that `expr' must not be destroyed as long as this
-  //! object is alive.
-  explicit Expression_Hide_Inhomo(Expression& expr);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  typedef typename Expression::const_iterator const_iterator;
-
-  //! Returns an iterator that points to the first nonzero coefficient in the
-  //! expression.
-  const_iterator begin() const;
-
-  //! Returns an iterator that points to the last nonzero coefficient in the
-  //! expression.
-  const_iterator end() const;
-
-  //! Returns an iterator that points to the first nonzero coefficient of a
-  //! variable bigger than or equal to v.
-  const_iterator lower_bound(Variable v) const;
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  bool is_zero() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  bool all_homogeneous_terms_are_zero() const;
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  bool all_zeroes(const Variables_Set& vars) const;
-
-private:
-  Expression& expr;
-
-  //! Returns the i-th coefficient.
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  //! Returns the coefficient of v.
-  Coefficient_traits::const_reference get(Variable v) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  bool all_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  Coefficient gcd(dimension_type start, dimension_type end) const;
-
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  dimension_type last_nonzero() const;
-
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
-
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  bool all_zeroes_except(const Variables_Set& vars, dimension_type start, dimension_type end) const;
-
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   Coefficient_traits::const_reference c1,
-                   Coefficient_traits::const_reference c2,
-                   dimension_type start, dimension_type end) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Dense_Row& row) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Sparse_Row& row) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  template <typename Expression2>
-  bool have_a_common_variable(const Expression2& x,
-                              Variable first, Variable last) const;
-
-  // NOTE: The following classes are friends of Expression_Hide_Inhomo in
-  // order to access its private methods.
-  template <typename T>
-  friend class Linear_System;
-  friend class Box_Helpers;
-  template <typename T>
-  friend class Expression_Hide_Inhomo;
-  template <typename T>
-  friend class Expression_Hide_Last;
-};
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.inlines.hh line 1. */
-/* Expression_Hide_Inhomo class implementation: inline functions.
-*/
-
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.inlines.hh line 29. */
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Expression>
-inline
-Expression_Hide_Inhomo<Expression>
-::Expression_Hide_Inhomo(Expression& expr)
-  : expr(expr) {
-}
-
-template <typename Expression>
-inline Representation
-Expression_Hide_Inhomo<Expression>::representation() const {
-  return expr.representation();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Inhomo<Expression>::const_iterator
-Expression_Hide_Inhomo<Expression>::begin() const {
-  return expr.begin();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Inhomo<Expression>::const_iterator
-Expression_Hide_Inhomo<Expression>::end() const {
-  return expr.end();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Inhomo<Expression>::const_iterator
-Expression_Hide_Inhomo<Expression>::lower_bound(Variable v) const {
-  return expr.lower_bound(v);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::space_dimension() const {
-  return expr.space_dimension();
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::coefficient(Variable v) const {
-  return expr.coefficient(v);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::inhomogeneous_term() const {
-  return Coefficient_zero();
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::is_zero() const {
-  // Don't check the inhomogeneous_term (i.e. pretend it's 0).
-  return expr.all_homogeneous_terms_are_zero();
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::all_homogeneous_terms_are_zero() const {
-  return expr.all_homogeneous_terms_are_zero();
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::is_equal_to(const Expression2& x) const {
-  const dimension_type dim1 = space_dimension();
-  const dimension_type dim2 = x.space_dimension();
-  if (dim1 != dim2)
-    return false;
-  if (x.inhomogeneous_term() != 0)
-    return false;
-  // Note that the inhomogeneous term is not compared.
-  return expr.is_equal_to(x, 1, dim1 + 1);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>::is_equal_to(const Expression2& x) const {
-  const dimension_type dim1 = space_dimension();
-  const dimension_type dim2 = x.space_dimension();
-  if (dim1 != dim2)
-    return false;
-  if (x.inhomogeneous_term() != 0)
-    return false;
-  // Note that the inhomogeneous term is not compared.
-  return x.is_equal_to(expr, 1, dim1 + 1);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::all_zeroes(const Variables_Set& vars) const {
-  return expr.all_zeroes(vars);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::get(dimension_type i) const {
-  if (i == 0)
-    return Coefficient_zero();
-  else
-    return expr.get(i);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Inhomo<Expression>::get(Variable v) const {
-  return expr.get(v);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>::all_zeroes(dimension_type start,
-                                               dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.all_zeroes(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::num_zeroes(dimension_type start,
-                                               dimension_type end) const {
-  if (start == end)
-    return 0;
-  if (start == 0)
-    return 1 + expr.num_zeroes(start + 1, end);
-  else
-    return expr.num_zeroes(start, end);
-}
-
-template <typename Expression>
-inline Coefficient
-Expression_Hide_Inhomo<Expression>::gcd(dimension_type start,
-                                        dimension_type end) const {
-  if (start == end)
-    return Coefficient_zero();
-  if (start == 0)
-    ++start;
-  return expr.gcd(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::last_nonzero() const {
-  return expr.last_nonzero();
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::last_nonzero(dimension_type first,
-                                                 dimension_type last) const {
-  return expr.last_nonzero(first, last);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Inhomo<Expression>::first_nonzero(dimension_type first,
-                                                  dimension_type last) const {
-  if (first == last)
-    return last;
-  if (first == 0)
-    ++first;
-  return expr.first_nonzero(first, last);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.all_zeroes_except(vars, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Inhomo<Expression>
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
-  bool had_0 = (x.count(0) == 1);
-  expr.has_a_free_dimension_helper(x);
-  if (had_0)
-    x.insert(0);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.is_equal_to(x, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return x.is_equal_to(expr, start, end);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return expr.is_equal_to(x, c1, c2, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  if (start == end)
-    return true;
-  if (start == 0)
-    ++start;
-  return x.is_equal_to(expr, c2, c1, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Inhomo<Expression>::get_row(Dense_Row& row) const {
-  expr.get_row(row);
-  row.reset(0);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Inhomo<Expression>::get_row(Sparse_Row& row) const {
-  expr.get_row(row);
-  row.reset(0);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  return expr.have_a_common_variable(x, first, last);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Inhomo<Linear_Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  return x.have_a_common_variable(expr, first, last);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Inhomo.defs.hh line 175. */
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.defs.hh line 1. */
-/* Expression_Hide_Last class declaration.
-*/
-
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.defs.hh line 28. */
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.defs.hh line 32. */
-
-#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-//! A Linear_Expression-like object that may or may not hide the last
-//! coefficient.
-#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
-template <typename Expression>
-class Parma_Polyhedra_Library::Expression_Hide_Last {
-public:
-
-  //! Wraps `expr'. Note that `expr' must not be destroyed as long as this
-  //! object is alive.
-  explicit Expression_Hide_Last(Expression& expr, bool hide_last = false);
-
-  void set_hide_last(bool hide_last);
-
-  //! Returns the current representation of *this.
-  Representation representation() const;
-
-  typedef typename Expression::const_iterator const_iterator;
-
-  //! Returns an iterator that points to the first nonzero coefficient in the
-  //! expression.
-  const_iterator begin() const;
-
-  //! Returns an iterator that points to the last nonzero coefficient in the
-  //! expression.
-  const_iterator end() const;
-
-  //! Returns an iterator that points to the first nonzero coefficient of a
-  //! variable bigger than or equal to v.
-  const_iterator lower_bound(Variable v) const;
-
-  //! Returns the dimension of the vector space enclosing \p *this.
-  dimension_type space_dimension() const;
-
-  //! Returns the coefficient of \p v in \p *this.
-  Coefficient_traits::const_reference coefficient(Variable v) const;
-
-  //! Returns the inhomogeneous term of \p *this.
-  Coefficient_traits::const_reference inhomogeneous_term() const;
-
-  //! Returns <CODE>true</CODE> if and only if \p *this is \f$0\f$.
-  bool is_zero() const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if and only if all the homogeneous
-    terms of \p *this are \f$0\f$.
-  */
-  bool all_homogeneous_terms_are_zero() const;
-
-  //! Returns \p true if *this is equal to \p x.
-  //! Note that (*this == x) has a completely different meaning.
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if the coefficient of each variable in
-    \p vars[i] is \f$0\f$.
-  */
-  bool all_zeroes(const Variables_Set& vars) const;
-
-private:
-  Expression& expr;
-  bool hide_last;
-
-  //! Returns the i-th coefficient.
-  Coefficient_traits::const_reference get(dimension_type i) const;
-
-  //! Returns the coefficient of v.
-  Coefficient_traits::const_reference get(Variable v) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if (*this)[i] is \f$0\f$, for each i in
-    [start, end).
-  */
-  bool all_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the number of zero coefficient in [start, end).
-  */
-  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
-
-  /*! \brief
-    Returns the gcd of the nonzero coefficients in [start,end). If all the
-    coefficients in this range are 0 returns 0.
-  */
-  Coefficient gcd(dimension_type start, dimension_type end) const;
-
-  //! Returns the index of the last nonzero element, or 0 if there are no
-  //! nonzero elements.
-  dimension_type last_nonzero() const;
-
-  //! Returns the index of the last nonzero element in [first,last), or last
-  //! if there are no nonzero elements.
-  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
-
-  //! Returns the index of the first nonzero element, or \p last if there are no
-  //! nonzero elements, considering only elements in [first,last).
-  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
-
-  /*! \brief
-    Returns <CODE>true</CODE> if each coefficient in [start,end) is *not* in
-    \f$0\f$, disregarding coefficients of variables in \p vars.
-  */
-  bool all_zeroes_except(const Variables_Set& vars,
-                         dimension_type start, dimension_type end) const;
-
-  //! Removes from the set x all the indexes of nonzero elements of *this.
-  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
-
-  //! Returns \p true if (*this)[i] is equal to x[i], for each i in [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   dimension_type start, dimension_type end) const;
-
-  //! Returns \p true if (*this)[i]*c1 is equal to x[i]*c2, for each i in
-  //! [start,end).
-  template <typename Expression2>
-  bool is_equal_to(const Expression2& x,
-                   Coefficient_traits::const_reference c1,
-                   Coefficient_traits::const_reference c2,
-                   dimension_type start, dimension_type end) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Dense_Row& row) const;
-
-  //! Sets `row' to a copy of the row that implements *this.
-  void get_row(Sparse_Row& row) const;
-
-  //! Returns true if there is a variable in [first,last) whose coefficient
-  //! is nonzero in both *this and x.
-  template <typename Expression2>
-  bool have_a_common_variable(const Expression2& x,
-                              Variable first, Variable last) const;
-
-  // NOTE: The following classes are friends of Expression_Hide_Last in
-  // order to access its private methods.
-  template <typename T>
-  friend class Linear_System;
-  friend class Box_Helpers;
-  template <typename T>
-  friend class Expression_Hide_Inhomo;
-  template <typename T>
-  friend class Expression_Hide_Last;
-  friend class PIP_Problem;
-  friend class MIP_Problem;
-  template <typename T>
-  friend class BD_Shape;
-  friend class BHRZ03_Certificate;
-  template <typename T>
-  friend class Box;
-  friend class Grid;
-  template <typename T>
-  friend class Octagonal_Shape;
-  friend class Polyhedron;
-  friend class Octagonal_Shape_Helper;
-  friend class BD_Shape_Helpers;
-};
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.inlines.hh line 1. */
-/* Expression_Hide_Last class implementation: inline functions.
-*/
-
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.inlines.hh line 28. */
-
-namespace Parma_Polyhedra_Library {
-
-template <typename Expression>
-inline
-Expression_Hide_Last<Expression>
-::Expression_Hide_Last(Expression& expr, bool hide_last)
-  : expr(expr), hide_last(hide_last) {
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>::set_hide_last(bool hide_last) {
-  this->hide_last = hide_last;
-}
-
-template <typename Expression>
-inline Representation
-Expression_Hide_Last<Expression>::representation() const {
-  return expr.representation();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Last<Expression>::const_iterator
-Expression_Hide_Last<Expression>::begin() const {
-  return expr.begin();
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Last<Expression>::const_iterator
-Expression_Hide_Last<Expression>::end() const {
-  if (hide_last) {
-    PPL_ASSERT(expr.space_dimension() != 0);
-    return expr.lower_bound(Variable(expr.space_dimension() - 1));
-  } else {
-    return expr.end();
-  }
-}
-
-template <typename Expression>
-inline typename Expression_Hide_Last<Expression>::const_iterator
-Expression_Hide_Last<Expression>::lower_bound(Variable v) const {
-  PPL_ASSERT(v.space_dimension() <= space_dimension() + 1);
-  return expr.lower_bound(v);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::space_dimension() const {
-  if (hide_last) {
-    PPL_ASSERT(expr.space_dimension() != 0);
-    return expr.space_dimension() - 1;
-  } else
-    return expr.space_dimension();
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::coefficient(Variable v) const {
-  PPL_ASSERT(v.space_dimension() <= space_dimension());
-  return expr.coefficient(v);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::inhomogeneous_term() const {
-  return expr.inhomogeneous_term();
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::is_zero() const {
-  return expr.all_zeroes(0, space_dimension() + 1);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::all_homogeneous_terms_are_zero() const {
-  return expr.all_zeroes(1, space_dimension() + 1);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::is_equal_to(const Expression2& x) const {
-  const dimension_type dim1 = space_dimension();
-  const dimension_type dim2 = x.space_dimension();
-  if (dim1 != dim2)
-    return false;
-  return is_equal_to(x, 0, dim1 + 1);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::all_zeroes(const Variables_Set& vars) const {
-  PPL_ASSERT(vars.space_dimension() <= space_dimension());
-  return expr.all_zeroes(vars);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::get(dimension_type i) const {
-  PPL_ASSERT(i <= space_dimension());
-  return expr.get(i);
-}
-
-template <typename Expression>
-inline Coefficient_traits::const_reference
-Expression_Hide_Last<Expression>::get(Variable v) const {
-  PPL_ASSERT(v.space_dimension() <= space_dimension());
-  return expr.get(v);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>::all_zeroes(dimension_type start,
-                                      dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.all_zeroes(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::num_zeroes(dimension_type start,
-                                      dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.num_zeroes(start, end);
-}
-
-template <typename Expression>
-inline Coefficient
-Expression_Hide_Last<Expression>::gcd(dimension_type start,
-                               dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.gcd(start, end);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::last_nonzero() const {
-  return expr.last_nonzero(0, space_dimension() + 1);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::last_nonzero(dimension_type first,
-                                        dimension_type last) const {
-  PPL_ASSERT(last <= space_dimension() + 1);
-  return expr.last_nonzero(first, last);
-}
-
-template <typename Expression>
-inline dimension_type
-Expression_Hide_Last<Expression>::first_nonzero(dimension_type first,
-                                         dimension_type last) const {
-  PPL_ASSERT(last <= space_dimension() + 1);
-  return expr.first_nonzero(first, last);
-}
-
-template <typename Expression>
-inline bool
-Expression_Hide_Last<Expression>
-::all_zeroes_except(const Variables_Set& vars,
-                    dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  return expr.all_zeroes_except(vars, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>
-::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
-  if (x.empty())
-    return;
-  const dimension_type max_dim = *(x.end());
-  PPL_ASSERT(max_dim <= space_dimension());
-  expr.has_a_free_dimension_helper(x);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return expr.is_equal_to(x, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return x.is_equal_to(expr, start, end);
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return expr.is_equal_to(x, c1, c2, start, end);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Linear_Expression>
-::is_equal_to(const Expression2& x,
-              Coefficient_traits::const_reference c1,
-              Coefficient_traits::const_reference c2,
-              dimension_type start, dimension_type end) const {
-  PPL_ASSERT(end <= space_dimension() + 1);
-  PPL_ASSERT(end <= x.space_dimension() + 1);
-  return x.is_equal_to(expr, c2, c1, start, end);
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>::get_row(Dense_Row& row) const {
-  expr.get_row(row);
-  if (hide_last) {
-    PPL_ASSERT(row.size() != 0);
-    row.resize(row.size() - 1);
-  }
-}
-
-template <typename Expression>
-inline void
-Expression_Hide_Last<Expression>::get_row(Sparse_Row& row) const {
-  expr.get_row(row);
-  if (hide_last) {
-    PPL_ASSERT(row.size() != 0);
-    row.resize(row.size() - 1);
-  }
-}
-
-template <typename Expression>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  PPL_ASSERT(last.space_dimension() <= space_dimension() + 1);
-  PPL_ASSERT(last.space_dimension() <= x.space_dimension() + 1);
-  return expr.have_a_common_variable(x, first, last);
-}
-
-template <>
-template <typename Expression2>
-inline bool
-Expression_Hide_Last<Linear_Expression>
-::have_a_common_variable(const Expression2& x,
-                         Variable first, Variable last) const {
-  PPL_ASSERT(last.space_dimension() <= space_dimension() + 1);
-  PPL_ASSERT(last.space_dimension() <= x.space_dimension() + 1);
-  return x.have_a_common_variable(expr, first, last);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-/* Automatically generated from PPL source file ../src/Expression_Hide_Last.defs.hh line 192. */
-
-/* Automatically generated from PPL source file ../src/Linear_Expression.inlines.hh line 29. */
-
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -28751,7 +28189,8 @@ operator-(const Variable v, const Variable w) {
     Linear_Expression e(v);
     e -= w;
     return e;
-  } else {
+  }
+  else {
     Linear_Expression e(w.space_dimension(), true);
     e -= w;
     e += v;
@@ -28819,7 +28258,8 @@ operator+(const Linear_Expression& e1, const Linear_Expression& e2) {
     Linear_Expression e = e1;
     e += e2;
     return e;
-  } else {
+  }
+  else {
     Linear_Expression e = e2;
     e += e1;
     return e;
@@ -28854,7 +28294,8 @@ operator+(const Variable v, const Variable w) {
     Linear_Expression e(v);
     e += w;
     return e;
-  } else {
+  }
+  else {
     Linear_Expression e(w);
     e += v;
     return e;
@@ -28876,7 +28317,8 @@ operator-(const Linear_Expression& e1, const Linear_Expression& e2) {
     Linear_Expression e = e1;
     e -= e2;
     return e;
-  } else {
+  }
+  else {
     Linear_Expression e = e2;
     neg_assign(e);
     e += e1;
@@ -28969,8 +28411,8 @@ neg_assign(Linear_Expression& e) {
 /*! \relates Parma_Polyhedra_Library::Linear_Expression */
 inline Linear_Expression&
 add_mul_assign(Linear_Expression& e,
-                    Coefficient_traits::const_reference n,
-                    const Variable v) {
+               Coefficient_traits::const_reference n,
+               const Variable v) {
   e.impl->add_mul_assign(n, v);
   return e;
 }
@@ -28986,8 +28428,8 @@ sub_mul_assign(Linear_Expression& e,
 
 inline void
 add_mul_assign(Linear_Expression& e1,
-                    Coefficient_traits::const_reference factor,
-                    const Linear_Expression& e2) {
+               Coefficient_traits::const_reference factor,
+               const Linear_Expression& e2) {
   e1.impl->add_mul_assign(factor, *e2.impl);
 }
 
@@ -29065,7 +28507,9 @@ Linear_Expression::all_zeroes(const Variables_Set& vars) const {
 }
 
 inline bool
-Linear_Expression::all_zeroes_except(const Variables_Set& vars, dimension_type start, dimension_type end) const {
+Linear_Expression::all_zeroes_except(const Variables_Set& vars,
+                                     dimension_type start,
+                                     dimension_type end) const {
   return impl->all_zeroes_except(vars, start, end);
 }
 
@@ -29306,111 +28750,47 @@ Linear_Expression
   return const_iterator(impl->lower_bound(v));
 }
 
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e)
-  : impl(NULL) {
-  Linear_Expression tmp(e.representation());
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
+template <typename LE_Adapter>
 inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e, Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(r);
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    dimension_type space_dim)
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
   : impl(NULL) {
   Linear_Expression tmp(e.representation());
   tmp.set_space_dimension(e.space_dimension());
   tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  itr_t i_end;
-  if (space_dim <= e.space_dimension())
-    i_end = e.lower_bound(Variable(space_dim));
-  else
-    i_end = e.end();
-  for (itr_t i = e.begin(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Inhomo<Expression>& e,
-                    dimension_type space_dim, Representation r)
-  : impl(NULL) {
-  Linear_Expression tmp(r);
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Inhomo<Expression>::const_iterator itr_t;
-  itr_t i_end;
-  if (space_dim <= e.space_dimension())
-    i_end = e.lower_bound(Variable(space_dim));
-  else
-    i_end = e.end();
-  for (itr_t i = e.begin(); i != i_end; ++i)
-    add_mul_assign(tmp, i.variable(), *i);
-}
-
-template <typename Expression>
-inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e)
-  : impl(NULL) {
-  using std::swap;
-  Linear_Expression tmp(e.representation());
-  tmp.set_space_dimension(e.space_dimension());
-  tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
+  for (typename LE_Adapter::const_iterator i = e.begin(),
+         i_end = e.end(); i != i_end; ++i)
     add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
   swap(impl, tmp.impl);
 }
 
-template <typename Expression>
+template <typename LE_Adapter>
 inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e, Representation r)
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     Representation r,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
   : impl(NULL) {
-  using std::swap;
   Linear_Expression tmp(r);
   tmp.set_space_dimension(e.space_dimension());
   tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
-  for (itr_t i = e.begin(), i_end = e.end(); i != i_end; ++i)
+  for (typename LE_Adapter::const_iterator i = e.begin(),
+         i_end = e.end(); i != i_end; ++i)
     add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
   swap(impl, tmp.impl);
 }
 
-template <typename Expression>
+template <typename LE_Adapter>
 inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    dimension_type space_dim)
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     dimension_type space_dim,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
   : impl(NULL) {
-  using std::swap;
   Linear_Expression tmp(e.representation());
   tmp.set_space_dimension(space_dim);
   tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
+  typedef typename LE_Adapter::const_iterator itr_t;
   itr_t i_end;
   if (space_dim <= e.space_dimension())
     i_end = e.lower_bound(Variable(space_dim));
@@ -29418,20 +28798,21 @@ Linear_Expression
     i_end = e.end();
   for (itr_t i = e.begin(); i != i_end; ++i)
     add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
   swap(impl, tmp.impl);
 }
 
-template <typename Expression>
+template <typename LE_Adapter>
 inline
-Linear_Expression
-::Linear_Expression(const Expression_Hide_Last<Expression>& e,
-                    dimension_type space_dim, Representation r)
+Linear_Expression::Linear_Expression(const LE_Adapter& e,
+                                     dimension_type space_dim,
+                                     Representation r,
+                                     typename Enable_If<Is_Same_Or_Derived<Expression_Adapter_Base, LE_Adapter>::value, void*>::type)
   : impl(NULL) {
-  using std::swap;
   Linear_Expression tmp(r);
   tmp.set_space_dimension(space_dim);
   tmp.set_inhomogeneous_term(e.inhomogeneous_term());
-  typedef typename Expression_Hide_Last<Expression>::const_iterator itr_t;
+  typedef typename LE_Adapter::const_iterator itr_t;
   itr_t i_end;
   if (space_dim <= e.space_dimension())
     i_end = e.lower_bound(Variable(space_dim));
@@ -29439,6 +28820,7 @@ Linear_Expression
     i_end = e.end();
   for (itr_t i = e.begin(); i != i_end; ++i)
     add_mul_assign(tmp, *i, i.variable());
+  using std::swap;
   swap(impl, tmp.impl);
 }
 
@@ -29468,9 +28850,9 @@ swap(Linear_Expression::const_iterator& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression.defs.hh line 1069. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_defs.hh line 927. */
 
-/* Automatically generated from PPL source file ../src/Topology.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Topology_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -29486,7 +28868,367 @@ enum Topology {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constraint.defs.hh line 40. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_defs.hh line 1. */
+/* Expression_Hide_Last class declaration.
+*/
+
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_defs.hh line 28. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_defs.hh line 32. */
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+//! An adapter for Linear_Expression that maybe hides the last coefficient.
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Hide_Last
+  : public Expression_Adapter<T> {
+  typedef Expression_Adapter<T> base_type;
+public:
+  //! The type of this object.
+  typedef Expression_Hide_Last<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename base_type::inner_type inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename base_type::raw_type raw_type;
+
+  //! The type of const iterators on coefficients.
+  typedef typename base_type::const_iterator const_iterator;
+
+  //! Constructor.
+  explicit Expression_Hide_Last(const raw_type& expr, bool hide_last);
+
+  //! Iterator pointing after the last nonzero variable coefficient.
+  const_iterator end() const;
+
+  //! Iterator pointing to the first nonzero variable coefficient
+  //! of a variable bigger than or equal to \p v.
+  const_iterator lower_bound(Variable v) const;
+
+  //! Returns the dimension of the vector space enclosing \p *this.
+  dimension_type space_dimension() const;
+
+  //! Returns the coefficient of \p v in \p *this.
+  Coefficient_traits::const_reference coefficient(Variable v) const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is zero.
+  bool is_zero() const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if and only if all the homogeneous
+    terms of \p *this are zero.
+  */
+  bool all_homogeneous_terms_are_zero() const;
+
+  /*! \brief Returns \p true if \p *this is equal to \p y.
+
+    Note that <CODE>(*this == y)</CODE> has a completely different meaning.
+  */
+  template <typename Expression>
+  bool is_equal_to(const Expression& y) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars is zero.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+  //! Returns the \p i -th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Returns the coefficient of variable \p v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is zero,
+    for each i in [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  //! Returns the number of zero coefficient in [start, end).
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end).
+    Returns zero if all the coefficients in the range are zero.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  //! Returns the index of the last nonzero element, or zero if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last),
+  //! or \p last if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there are no
+  //! nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Removes from set \p x all the indexes of nonzero elements in \p *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \c true if <CODE>(*this)[i]</CODE> is equal to <CODE>y[i]</CODE>,
+  //! for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \c true if <CODE>(*this)[i]*c1</CODE> is equal to
+  //! <CODE>y[i]*c2</CODE>, for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Sparse_Row& row) const;
+
+  //! Returns \c true if there is a variable in [first,last) whose coefficient
+  //! is nonzero in both \p *this and \p y.
+  template <typename Expression>
+  bool have_a_common_variable(const Expression& y,
+                              Variable first, Variable last) const;
+
+private:
+  //! Whether or not the last coefficient is hidden.
+  const bool hide_last_;
+};
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_inlines.hh line 1. */
+/* Expression_Hide_Last class implementation: inline functions.
+*/
+
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_inlines.hh line 28. */
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+inline
+Expression_Hide_Last<T>::Expression_Hide_Last(const raw_type& expr,
+                                              const bool hide_last)
+  : base_type(expr), hide_last_(hide_last) {
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::space_dimension() const {
+  dimension_type dim = this->inner().space_dimension();
+  if (hide_last_) {
+    PPL_ASSERT(dim > 0);
+    --dim;
+  }
+  return dim;
+}
+
+template <typename T>
+inline typename Expression_Hide_Last<T>::const_iterator
+Expression_Hide_Last<T>::end() const {
+  if (hide_last_) {
+    return this->inner().lower_bound(Variable(space_dimension()));
+  }
+  else {
+    return this->inner().end();
+  }
+}
+
+template <typename T>
+inline typename Expression_Hide_Last<T>::const_iterator
+Expression_Hide_Last<T>::lower_bound(Variable v) const {
+  PPL_ASSERT(v.space_dimension() <= space_dimension() + 1);
+  return this->inner().lower_bound(v);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Last<T>::coefficient(Variable v) const {
+  PPL_ASSERT(v.space_dimension() <= space_dimension());
+  return this->inner().coefficient(v);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::is_zero() const {
+  return this->inner().all_zeroes(0, space_dimension() + 1);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::all_homogeneous_terms_are_zero() const {
+  return this->inner().all_zeroes(1, space_dimension() + 1);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::is_equal_to(const Expression& y) const {
+  const dimension_type x_dim = space_dimension();
+  const dimension_type y_dim = y.space_dimension();
+  if (x_dim != y_dim)
+    return false;
+  return is_equal_to(y, 0, x_dim + 1);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::all_zeroes(const Variables_Set& vars) const {
+  PPL_ASSERT(vars.space_dimension() <= space_dimension());
+  return this->inner().all_zeroes(vars);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Last<T>::get(dimension_type i) const {
+  PPL_ASSERT(i <= space_dimension());
+  return this->inner().get(i);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Last<T>::get(Variable v) const {
+  PPL_ASSERT(v.space_dimension() <= space_dimension());
+  return this->inner().get(v);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>::all_zeroes(dimension_type start,
+                                    dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().all_zeroes(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::num_zeroes(dimension_type start,
+                                    dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().num_zeroes(start, end);
+}
+
+template <typename T>
+inline Coefficient
+Expression_Hide_Last<T>::gcd(dimension_type start,
+                             dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().gcd(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::last_nonzero() const {
+  return this->inner().last_nonzero(0, space_dimension() + 1);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::last_nonzero(dimension_type first,
+                                      dimension_type last) const {
+  PPL_ASSERT(last <= space_dimension() + 1);
+  return this->inner().last_nonzero(first, last);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Last<T>::first_nonzero(dimension_type first,
+                                       dimension_type last) const {
+  PPL_ASSERT(last <= space_dimension() + 1);
+  return this->inner().first_nonzero(first, last);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Last<T>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  return this->inner().all_zeroes_except(vars, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Last<T>
+::has_a_free_dimension_helper(std::set<dimension_type>& x) const {
+  if (x.empty())
+    return;
+  PPL_ASSERT(*(--x.end()) <= space_dimension());
+  this->inner().has_a_free_dimension_helper(x);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::is_equal_to(const Expression& y,
+              dimension_type start, dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  PPL_ASSERT(end <= y.space_dimension() + 1);
+  return this->inner().is_equal_to(y, start, end);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::is_equal_to(const Expression& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  PPL_ASSERT(end <= space_dimension() + 1);
+  PPL_ASSERT(end <= y.space_dimension() + 1);
+  return this->inner().is_equal_to(y, c1, c2, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Last<T>::get_row(Dense_Row& row) const {
+  this->inner().get_row(row);
+  if (hide_last_) {
+    PPL_ASSERT(row.size() != 0);
+    row.resize(row.size() - 1);
+  }
+}
+
+template <typename T>
+inline void
+Expression_Hide_Last<T>::get_row(Sparse_Row& row) const {
+  this->inner().get_row(row);
+  if (hide_last_) {
+    PPL_ASSERT(row.size() != 0);
+    row.resize(row.size() - 1);
+  }
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Last<T>
+::have_a_common_variable(const Expression& y,
+                         Variable first, Variable last) const {
+  PPL_ASSERT(last.space_dimension() <= space_dimension() + 1);
+  PPL_ASSERT(last.space_dimension() <= y.space_dimension() + 1);
+  return this->inner().have_a_common_variable(y, first, last);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Last_defs.hh line 164. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_defs.hh line 40. */
 
 #include <iosfwd>
 
@@ -29967,13 +29709,10 @@ public:
   */
   static const Constraint& epsilon_leq_one();
 
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Expression_Hide_Last<Linear_Expression> Expression;
-
-  //! Allows user code to read the constraint's expression (but note that the
-  //! return type is not Linear_Expression, not all operations are allowed).
-  const Expression& expression() const;
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Hide_Last<Linear_Expression> expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
 
 private:
 
@@ -29985,8 +29724,6 @@ private:
 
   Linear_Expression expr;
 
-  Expression wrapped_expr;
-
   Kind kind_;
 
   Topology topology_;
@@ -30109,8 +29846,8 @@ private:
   */
   void
   throw_dimension_incompatible(const char* method,
-			       const char* name_var,
-			       Variable v) const;
+                               const char* name_var,
+                               Variable v) const;
 
   //! Returns the epsilon coefficient. The constraint must be NNC.
   Coefficient_traits::const_reference epsilon_coefficient() const;
@@ -30286,13 +30023,12 @@ void swap(Constraint& x, Constraint& y);
 
 } // namespace Parma_Polyhedra_Library
 
-
-/* Automatically generated from PPL source file ../src/Constraint.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_inlines.hh line 1. */
 /* Constraint class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constraint.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -30306,9 +30042,14 @@ Constraint::is_not_necessarily_closed() const {
   return !is_necessarily_closed();
 }
 
+inline Constraint::expr_type
+Constraint::expression() const {
+  return expr_type(expr, is_not_necessarily_closed());
+}
+
 inline dimension_type
 Constraint::space_dimension() const {
-  return wrapped_expr.space_dimension();
+  return expression().space_dimension();
 }
 
 inline void
@@ -30348,11 +30089,10 @@ Constraint::set_topology(Topology x) {
   if (topology() == NECESSARILY_CLOSED) {
     // Add a column for the epsilon dimension.
     expr.set_space_dimension(expr.space_dimension() + 1);
-    wrapped_expr.set_hide_last(true);
-  } else {
+  }
+  else {
     PPL_ASSERT(expr.space_dimension() != 0);
     expr.set_space_dimension(expr.space_dimension() - 1);
-    wrapped_expr.set_hide_last(false);
   }
   topology_ = x;
 }
@@ -30361,14 +30101,12 @@ inline void
 Constraint::mark_as_necessarily_closed() {
   PPL_ASSERT(is_not_necessarily_closed());
   topology_ = NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(false);
 }
 
 inline void
 Constraint::mark_as_not_necessarily_closed() {
   PPL_ASSERT(is_necessarily_closed());
   topology_ = NOT_NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(true);
 }
 
 inline void
@@ -30384,7 +30122,6 @@ Constraint::set_not_necessarily_closed() {
 inline
 Constraint::Constraint(Representation r)
   : expr(r),
-    wrapped_expr(expr, false),
     kind_(RAY_OR_POINT_OR_INEQUALITY),
     topology_(NECESSARILY_CLOSED) {
   PPL_ASSERT(OK());
@@ -30394,7 +30131,6 @@ inline
 Constraint::Constraint(dimension_type space_dim, Kind kind, Topology topology,
                        Representation r)
   : expr(r),
-    wrapped_expr(expr, topology == NOT_NECESSARILY_CLOSED),
     kind_(kind),
     topology_(topology) {
   expr.set_space_dimension(space_dim + 1);
@@ -30404,8 +30140,7 @@ Constraint::Constraint(dimension_type space_dim, Kind kind, Topology topology,
 
 inline
 Constraint::Constraint(Linear_Expression& e, Kind kind, Topology topology)
-  : wrapped_expr(expr, topology == NOT_NECESSARILY_CLOSED),
-    kind_(kind),
+  : kind_(kind),
     topology_(topology) {
   PPL_ASSERT(kind != RAY_OR_POINT_OR_INEQUALITY || topology == NOT_NECESSARILY_CLOSED);
   swap(expr, e);
@@ -30418,8 +30153,7 @@ Constraint::Constraint(Linear_Expression& e, Kind kind, Topology topology)
 
 inline
 Constraint::Constraint(Linear_Expression& e, Type type, Topology topology)
-  : wrapped_expr(expr, topology == NOT_NECESSARILY_CLOSED),
-    topology_(topology) {
+  : topology_(topology) {
   PPL_ASSERT(type != STRICT_INEQUALITY || topology == NOT_NECESSARILY_CLOSED);
   swap(expr, e);
   if (topology == NOT_NECESSARILY_CLOSED)
@@ -30435,7 +30169,6 @@ Constraint::Constraint(Linear_Expression& e, Type type, Topology topology)
 inline
 Constraint::Constraint(const Constraint& c)
   : expr(c.expr),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
     kind_(c.kind_),
     topology_(c.topology_) {
   // NOTE: This does not call PPL_ASSERT(OK()) because this is called by OK().
@@ -30444,7 +30177,6 @@ Constraint::Constraint(const Constraint& c)
 inline
 Constraint::Constraint(const Constraint& c, Representation r)
   : expr(c.expr, r),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
     kind_(c.kind_),
     topology_(c.topology_) {
   PPL_ASSERT(OK());
@@ -30453,7 +30185,6 @@ Constraint::Constraint(const Constraint& c, Representation r)
 inline
 Constraint::Constraint(const Constraint& c, const dimension_type space_dim)
   : expr(c.expr, c.is_necessarily_closed() ? space_dim : (space_dim + 1)),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
     kind_(c.kind_), topology_(c.topology_) {
   PPL_ASSERT(space_dimension() == space_dim);
   PPL_ASSERT(OK());
@@ -30463,7 +30194,6 @@ inline
 Constraint::Constraint(const Constraint& c, const dimension_type space_dim,
                        Representation r)
   : expr(c.expr, c.is_necessarily_closed() ? space_dim : (space_dim + 1), r),
-    wrapped_expr(expr, c.is_not_necessarily_closed()),
     kind_(c.kind_), topology_(c.topology_) {
   PPL_ASSERT(space_dimension() == space_dim);
   PPL_ASSERT(OK());
@@ -30481,11 +30211,6 @@ Constraint::operator=(const Constraint& c) {
   return *this;
 }
 
-inline const Constraint::Expression&
-Constraint::expression() const {
-  return wrapped_expr;
-}
-
 inline Representation
 Constraint::representation() const {
   return expr.representation();
@@ -30506,12 +30231,14 @@ Constraint::set_space_dimension_no_ok(dimension_type space_dim) {
   const dimension_type old_expr_space_dim = expr.space_dimension();
   if (topology() == NECESSARILY_CLOSED) {
     expr.set_space_dimension(space_dim);
-  } else {
+  }
+  else {
     const dimension_type old_space_dim = space_dimension();
     if (space_dim > old_space_dim) {
       expr.set_space_dimension(space_dim + 1);
       expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-    } else {
+    }
+    else {
       expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
       expr.set_space_dimension(space_dim + 1);
     }
@@ -30829,8 +30556,6 @@ Constraint::m_swap(Constraint& y) {
   swap(expr, y.expr);
   swap(kind_, y.kind_);
   swap(topology_, y.topology_);
-  wrapped_expr.set_hide_last(is_not_necessarily_closed());
-  y.wrapped_expr.set_hide_last(y.is_not_necessarily_closed());
 }
 
 inline Coefficient_traits::const_reference
@@ -30853,14 +30578,14 @@ swap(Constraint& x, Constraint& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constraint.defs.hh line 841. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_defs.hh line 835. */
 
-/* Automatically generated from PPL source file ../src/Generator.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_defs.hh line 1. */
 /* Generator class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Generator_System.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_System_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -30870,7 +30595,7 @@ class Generator_System_const_iterator;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid_Generator_System.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_System_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -30879,14 +30604,14 @@ class Grid_Generator_System;
 
 }
 
-/* Automatically generated from PPL source file ../src/Generator.defs.hh line 38. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_defs.hh line 38. */
 
-/* Automatically generated from PPL source file ../src/distances.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/distances_defs.hh line 1. */
 /* Class declarations for several distances.
 */
 
 
-/* Automatically generated from PPL source file ../src/distances.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/distances_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -30902,7 +30627,7 @@ struct L_Infinity_Distance_Specialization;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/distances.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/distances_defs.hh line 29. */
 
 template <typename Temp>
 struct Parma_Polyhedra_Library::Rectilinear_Distance_Specialization {
@@ -30926,12 +30651,12 @@ struct Parma_Polyhedra_Library::L_Infinity_Distance_Specialization {
   static void finalize(Temp&, Rounding_Dir);
 };
 
-/* Automatically generated from PPL source file ../src/distances.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/distances_inlines.hh line 1. */
 /* Inline functions implementing distances.
 */
 
 
-/* Automatically generated from PPL source file ../src/distances.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/distances_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -30975,8 +30700,8 @@ maybe_assign(const To*& top, To& tmp, const From& from, Rounding_Dir dir) {
 template <typename Temp>
 inline void
 Rectilinear_Distance_Specialization<Temp>::combine(Temp& running,
-						   const Temp& current,
-						   Rounding_Dir dir) {
+                                                   const Temp& current,
+                                                   Rounding_Dir dir) {
   add_assign_r(running, running, current, dir);
 }
 
@@ -30988,8 +30713,8 @@ Rectilinear_Distance_Specialization<Temp>::finalize(Temp&, Rounding_Dir) {
 template <typename Temp>
 inline void
 Euclidean_Distance_Specialization<Temp>::combine(Temp& running,
-						 Temp& current,
-						 Rounding_Dir dir) {
+                                                 Temp& current,
+                                                 Rounding_Dir dir) {
   mul_assign_r(current, current, current, dir);
   add_assign_r(running, running, current, dir);
 }
@@ -30997,15 +30722,15 @@ Euclidean_Distance_Specialization<Temp>::combine(Temp& running,
 template <typename Temp>
 inline void
 Euclidean_Distance_Specialization<Temp>::finalize(Temp& running,
-						  Rounding_Dir dir) {
+                                                  Rounding_Dir dir) {
   sqrt_assign_r(running, running, dir);
 }
 
 template <typename Temp>
 inline void
 L_Infinity_Distance_Specialization<Temp>::combine(Temp& running,
-						  const Temp& current,
-						  Rounding_Dir) {
+                                                  const Temp& current,
+                                                  Rounding_Dir) {
   if (current > running)
     running = current;
 }
@@ -31017,9 +30742,328 @@ L_Infinity_Distance_Specialization<Temp>::finalize(Temp&, Rounding_Dir) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/distances.defs.hh line 53. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/distances_defs.hh line 53. */
 
-/* Automatically generated from PPL source file ../src/Generator.defs.hh line 46. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_defs.hh line 1. */
+/* Expression_Hide_Inhomo class declaration.
+*/
+
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_defs.hh line 28. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_defs.hh line 32. */
+
+#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
+/*! \brief
+  An adapter for Linear_Expression that hides the inhomogeneous term.
+
+  The methods of this class always pretend that the value of the
+  inhomogeneous term is zero.
+*/
+#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
+template <typename T>
+class Parma_Polyhedra_Library::Expression_Hide_Inhomo
+  : public Expression_Adapter<T> {
+  typedef Expression_Adapter<T> base_type;
+public:
+  //! The type of this object.
+  typedef Expression_Hide_Inhomo<T> const_reference;
+  //! The type obtained by one-level unwrapping.
+  typedef typename base_type::inner_type inner_type;
+  //! The raw, completely unwrapped type.
+  typedef typename base_type::raw_type raw_type;
+
+  //! Constructor.
+  explicit Expression_Hide_Inhomo(const raw_type& expr);
+
+public:
+  //! The type of const iterators on coefficients.
+  typedef typename base_type::const_iterator const_iterator;
+
+  //! Returns the constant zero.
+  Coefficient_traits::const_reference inhomogeneous_term() const;
+
+  //! Returns <CODE>true</CODE> if and only if \p *this is zero.
+  bool is_zero() const;
+
+  /*! \brief Returns \p true if \p *this is equal to \p y.
+
+    Note that <CODE>(*this == y)</CODE> has a completely different meaning.
+  */
+  template <typename Expression>
+  bool is_equal_to(const Expression& y) const;
+
+  //! Returns the i-th coefficient.
+  Coefficient_traits::const_reference get(dimension_type i) const;
+
+  //! Returns the coefficient of v.
+  Coefficient_traits::const_reference get(Variable v) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if the coefficient of each variable in
+    \p vars is zero.
+  */
+  bool all_zeroes(const Variables_Set& vars) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if (*this)[i] is zero,
+    for each i in [start, end).
+  */
+  bool all_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the number of zero coefficient in [start, end).
+  */
+  dimension_type num_zeroes(dimension_type start, dimension_type end) const;
+
+  /*! \brief
+    Returns the gcd of the nonzero coefficients in [start,end). If all the
+    coefficients in this range are zero, returns zero.
+  */
+  Coefficient gcd(dimension_type start, dimension_type end) const;
+
+  //! Returns the index of the last nonzero element, or zero if there are no
+  //! nonzero elements.
+  dimension_type last_nonzero() const;
+
+  //! Returns the index of the last nonzero element in [first,last), or last
+  //! if there are no nonzero elements.
+  dimension_type last_nonzero(dimension_type first, dimension_type last) const;
+
+  //! Returns the index of the first nonzero element, or \p last if there
+  //! are no nonzero elements, considering only elements in [first,last).
+  dimension_type first_nonzero(dimension_type first, dimension_type last) const;
+
+  /*! \brief
+    Returns <CODE>true</CODE> if all coefficients in [start,end),
+    except those corresponding to variables in \p vars, are zero.
+  */
+  bool all_zeroes_except(const Variables_Set& vars,
+                         dimension_type start, dimension_type end) const;
+
+  //! Removes from set \p x all the indexes of nonzero elements in \p *this.
+  void has_a_free_dimension_helper(std::set<dimension_type>& x) const;
+
+  //! Returns \c true if <CODE>(*this)[i]</CODE> is equal to <CODE>y[i]</CODE>,
+  //! for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   dimension_type start, dimension_type end) const;
+
+  //! Returns \c true if <CODE>(*this)[i]*c1</CODE> is equal to
+  //! <CODE>y[i]*c2</CODE>, for each i in [start,end).
+  template <typename Expression>
+  bool is_equal_to(const Expression& y,
+                   Coefficient_traits::const_reference c1,
+                   Coefficient_traits::const_reference c2,
+                   dimension_type start, dimension_type end) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Dense_Row& row) const;
+
+  //! Sets \p row to a copy of the row as adapted by \p *this.
+  void get_row(Sparse_Row& row) const;
+};
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_inlines.hh line 1. */
+/* Expression_Hide_Inhomo class implementation: inline functions.
+*/
+
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_inlines.hh line 28. */
+
+namespace Parma_Polyhedra_Library {
+
+template <typename T>
+Expression_Hide_Inhomo<T>::Expression_Hide_Inhomo(const raw_type& expr)
+  : base_type(expr) {
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Inhomo<T>::inhomogeneous_term() const {
+  // Pretend it is zero.
+  return Coefficient_zero();
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>::is_zero() const {
+  // Don't check the inhomogeneous_term (i.e., pretend it is zero).
+  return this->inner().all_homogeneous_terms_are_zero();
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Inhomo<T>
+::is_equal_to(const Expression& y) const {
+  const dimension_type x_dim = this->space_dimension();
+  const dimension_type y_dim = y.space_dimension();
+  if (x_dim != y_dim)
+    return false;
+  if (y.inhomogeneous_term() != 0)
+    return false;
+  // Note that the inhomogeneous term is not compared.
+  return this->inner().is_equal_to(y, 1, x_dim + 1);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Inhomo<T>::get(dimension_type i) const {
+  if (i == 0)
+    return Coefficient_zero();
+  else
+    return this->inner().get(i);
+}
+
+template <typename T>
+inline Coefficient_traits::const_reference
+Expression_Hide_Inhomo<T>::get(Variable v) const {
+  return this->inner().get(v);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>
+::all_zeroes(const Variables_Set& vars) const {
+  return this->inner().all_zeroes(vars);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>::all_zeroes(dimension_type start,
+                                      dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().all_zeroes(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::num_zeroes(dimension_type start,
+                                      dimension_type end) const {
+  if (start == end)
+    return 0;
+  dimension_type nz = 0;
+  if (start == 0) {
+    ++start;
+    ++nz;
+  }
+  nz += this->inner().num_zeroes(start, end);
+  return nz;
+}
+
+template <typename T>
+inline Coefficient
+Expression_Hide_Inhomo<T>::gcd(dimension_type start,
+                               dimension_type end) const {
+  if (start == end)
+    return Coefficient_zero();
+  if (start == 0)
+    ++start;
+  return this->inner().gcd(start, end);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::last_nonzero() const {
+  return this->inner().last_nonzero();
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::last_nonzero(dimension_type first,
+                                        dimension_type last) const {
+  if (first == last)
+    return last;
+  if (first == 0)
+    ++first;
+  return this->inner().last_nonzero(first, last);
+}
+
+template <typename T>
+inline dimension_type
+Expression_Hide_Inhomo<T>::first_nonzero(dimension_type first,
+                                         dimension_type last) const {
+  if (first == last)
+    return last;
+  if (first == 0)
+    ++first;
+  return this->inner().first_nonzero(first, last);
+}
+
+template <typename T>
+inline bool
+Expression_Hide_Inhomo<T>
+::all_zeroes_except(const Variables_Set& vars,
+                    dimension_type start, dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().all_zeroes_except(vars, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Inhomo<T>
+::has_a_free_dimension_helper(std::set<dimension_type>& y) const {
+  bool had_0 = (y.count(0) == 1);
+  this->inner().has_a_free_dimension_helper(y);
+  if (had_0)
+    y.insert(0);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Inhomo<T>
+::is_equal_to(const Expression& y,
+              dimension_type start, dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().is_equal_to(y, start, end);
+}
+
+template <typename T>
+template <typename Expression>
+inline bool
+Expression_Hide_Inhomo<T>
+::is_equal_to(const Expression& y,
+              Coefficient_traits::const_reference c1,
+              Coefficient_traits::const_reference c2,
+              dimension_type start, dimension_type end) const {
+  if (start == end)
+    return true;
+  if (start == 0)
+    ++start;
+  return this->inner().is_equal_to(y, c1, c2, start, end);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Inhomo<T>::get_row(Dense_Row& row) const {
+  this->inner().get_row(row);
+  row.reset(0);
+}
+
+template <typename T>
+inline void
+Expression_Hide_Inhomo<T>::get_row(Sparse_Row& row) const {
+  this->inner().get_row(row);
+  row.reset(0);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Expression_Hide_Inhomo_defs.hh line 146. */
+
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_defs.hh line 46. */
 
 #include <iosfwd>
 
@@ -31503,13 +31547,11 @@ public:
   //! Swaps \p *this with \p y.
   void m_swap(Generator& y);
 
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> > Expression;
-
-  //! Allows user code to read the internal expression (but note that this
-  //! is a different type, not all operations are allowed).
-  const Expression& expression() const;
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> >
+  expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
 
 private:
   //! The possible kinds of Generator objects.
@@ -31518,14 +31560,13 @@ private:
     RAY_OR_POINT_OR_INEQUALITY = 1
   };
 
+  //! The linear expression encoding \p *this.
   Linear_Expression expr;
 
-  Expression_Hide_Inhomo<Linear_Expression> semi_wrapped_expr;
-
-  Expression wrapped_expr;
-
+  //! The kind of \p *this.
   Kind kind_;
 
+  //! The topology of \p *this.
   Topology topology_;
 
   /*! \brief
@@ -31605,14 +31646,14 @@ private:
 
   //! Marks the epsilon dimension as a standard dimension.
   /*!
-    The row topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
+    The row topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
     the number of space dimensions is increased by 1.
   */
   void mark_as_necessarily_closed();
 
   //! Marks the last dimension as the epsilon dimension.
   /*!
-    The row topology is changed to <CODE>NECESSARILY_CLOSED</CODE>, and
+    The row topology is changed to <CODE>NOT_NECESSARILY_CLOSED</CODE>, and
     the number of space dimensions is decreased by 1.
   */
   void mark_as_not_necessarily_closed();
@@ -31646,8 +31687,8 @@ private:
   */
   void
   throw_dimension_incompatible(const char* method,
-			       const char* v_name,
-			       Variable v) const;
+                               const char* v_name,
+                               Variable v) const;
 
   /*! \brief
     Throw a <CODE>std::invalid_argument</CODE> exception
@@ -31700,10 +31741,14 @@ private:
   */
   bool check_strong_normalized() const;
 
-  //! Another print functions, with fancy output, more human-friendly.
-  //! This is used by operator<<();
+  /*! \brief
+    A print function, with fancy, more human-friendly output.
+
+    This is used by operator<<().
+  */
   void fancy_print(std::ostream& s) const;
 
+  friend class Expression_Adapter<Generator>;
   friend class Linear_System<Generator>;
   friend class Parma_Polyhedra_Library::Scalar_Products;
   friend class Parma_Polyhedra_Library::Topology_Adjusted_Scalar_Product_Sign;
@@ -31717,13 +31762,9 @@ private:
   friend class Parma_Polyhedra_Library::MIP_Problem;
   friend class Parma_Polyhedra_Library::Grid;
 
-  friend
-  Parma_Polyhedra_Library
-  ::Linear_Expression::Linear_Expression(const Generator& g);
-
   friend std::ostream&
   Parma_Polyhedra_Library::IO_Operators::operator<<(std::ostream& s,
-						    const Generator& g);
+                                                    const Generator& g);
 
   friend int
   compare(const Generator& x, const Generator& y);
@@ -31809,7 +31850,7 @@ bool operator!=(const Generator& x, const Generator& y);
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 
   \note
   Distances are \e only defined between generators that are points and/or
@@ -31830,7 +31871,7 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 
   \note
   Distances are \e only defined between generators that are points and/or
@@ -31875,7 +31916,7 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 
   \note
   Distances are \e only defined between generators that are points and/or
@@ -31896,7 +31937,7 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 
   \note
   Distances are \e only defined between generators that are points and/or
@@ -31941,7 +31982,7 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 
   \note
   Distances are \e only defined between generators that are points and/or
@@ -31962,7 +32003,7 @@ bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 
   \note
   Distances are \e only defined between generators that are points and/or
@@ -32008,7 +32049,7 @@ std::ostream& operator<<(std::ostream& s, const Generator::Type& t);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Generator.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_inlines.hh line 1. */
 /* Generator class implementation: inline functions.
 */
 
@@ -32025,9 +32066,14 @@ Generator::is_not_necessarily_closed() const {
   return (topology() == NOT_NECESSARILY_CLOSED);
 }
 
+inline Generator::expr_type
+Generator::expression() const {
+  return expr_type(expr, is_not_necessarily_closed());
+}
+
 inline dimension_type
 Generator::space_dimension() const {
-  return wrapped_expr.space_dimension();
+  return expression().space_dimension();
 }
 
 inline bool
@@ -32062,11 +32108,10 @@ Generator::set_topology(Topology x) {
   if (topology() == NECESSARILY_CLOSED) {
     // Add a column for the epsilon dimension.
     expr.set_space_dimension(expr.space_dimension() + 1);
-    wrapped_expr.set_hide_last(true);
-  } else {
+  }
+  else {
     PPL_ASSERT(expr.space_dimension() > 0);
     expr.set_space_dimension(expr.space_dimension() - 1);
-    wrapped_expr.set_hide_last(false);
   }
   topology_ = x;
 }
@@ -32075,14 +32120,12 @@ inline void
 Generator::mark_as_necessarily_closed() {
   PPL_ASSERT(is_not_necessarily_closed());
   topology_ = NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(false);
 }
 
 inline void
 Generator::mark_as_not_necessarily_closed() {
   PPL_ASSERT(is_necessarily_closed());
   topology_ = NOT_NECESSARILY_CLOSED;
-  wrapped_expr.set_hide_last(true);
 }
 
 inline void
@@ -32098,8 +32141,6 @@ Generator::set_not_necessarily_closed() {
 inline
 Generator::Generator(Representation r)
   : expr(r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, false),
     kind_(RAY_OR_POINT_OR_INEQUALITY),
     topology_(NECESSARILY_CLOSED) {
   expr.set_inhomogeneous_term(Coefficient_one());
@@ -32111,8 +32152,6 @@ inline
 Generator::Generator(dimension_type space_dim, Kind kind, Topology topology,
                      Representation r)
   : expr(r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, topology == NOT_NECESSARILY_CLOSED),
     kind_(kind),
     topology_(topology) {
   if (is_necessarily_closed())
@@ -32125,9 +32164,7 @@ Generator::Generator(dimension_type space_dim, Kind kind, Topology topology,
 
 inline
 Generator::Generator(Linear_Expression& e, Type type, Topology topology)
-  : semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, topology == NOT_NECESSARILY_CLOSED),
-    topology_(topology) {
+  : topology_(topology) {
   PPL_ASSERT(type != CLOSURE_POINT || topology == NOT_NECESSARILY_CLOSED);
   swap(expr, e);
   if (topology == NOT_NECESSARILY_CLOSED)
@@ -32141,9 +32178,7 @@ Generator::Generator(Linear_Expression& e, Type type, Topology topology)
 
 inline
 Generator::Generator(Linear_Expression& e, Kind kind, Topology topology)
-  : semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, topology == NOT_NECESSARILY_CLOSED),
-    kind_(kind),
+  : kind_(kind),
     topology_(topology) {
   swap(expr, e);
   if (topology == NOT_NECESSARILY_CLOSED)
@@ -32154,8 +32189,6 @@ Generator::Generator(Linear_Expression& e, Kind kind, Topology topology)
 inline
 Generator::Generator(const Generator& g)
   : expr(g.expr),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
     kind_(g.kind_),
     topology_(g.topology_) {
 }
@@ -32163,8 +32196,6 @@ Generator::Generator(const Generator& g)
 inline
 Generator::Generator(const Generator& g, Representation r)
   : expr(g.expr, r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
     kind_(g.kind_),
     topology_(g.topology_) {
   // This does not assert OK() because it's called by OK().
@@ -32174,8 +32205,6 @@ Generator::Generator(const Generator& g, Representation r)
 inline
 Generator::Generator(const Generator& g, dimension_type space_dim)
   : expr(g.expr, g.is_necessarily_closed() ? space_dim : (space_dim + 1)),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
     kind_(g.kind_),
     topology_(g.topology_) {
   PPL_ASSERT(OK());
@@ -32186,8 +32215,6 @@ inline
 Generator::Generator(const Generator& g, dimension_type space_dim,
                      Representation r)
   : expr(g.expr, g.is_necessarily_closed() ? space_dim : (space_dim + 1), r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, g.is_not_necessarily_closed()),
     kind_(g.kind_),
     topology_(g.topology_) {
   PPL_ASSERT(OK());
@@ -32206,11 +32233,6 @@ Generator::operator=(const Generator& g) {
   return *this;
 }
 
-inline const Generator::Expression&
-Generator::expression() const {
-  return wrapped_expr;
-}
-
 inline Representation
 Generator::representation() const {
   return expr.representation();
@@ -32231,12 +32253,14 @@ Generator::set_space_dimension_no_ok(dimension_type space_dim) {
   const dimension_type old_expr_space_dim = expr.space_dimension();
   if (topology() == NECESSARILY_CLOSED) {
     expr.set_space_dimension(space_dim);
-  } else {
+  }
+  else {
     const dimension_type old_space_dim = space_dimension();
     if (space_dim > old_space_dim) {
       expr.set_space_dimension(space_dim + 1);
       expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-    } else {
+    }
+    else {
       expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
       expr.set_space_dimension(space_dim + 1);
     }
@@ -32326,7 +32350,7 @@ Generator::divisor() const {
   Coefficient_traits::const_reference d = expr.inhomogeneous_term();
   if (!is_ray_or_point() || d == 0)
     throw_invalid_argument("divisor()",
-			   "*this is neither a point nor a closure point");
+                           "*this is neither a point nor a closure point");
   return d;
 }
 
@@ -32527,8 +32551,6 @@ Generator::m_swap(Generator& y) {
   swap(expr, y.expr);
   swap(kind_, y.kind_);
   swap(topology_, y.topology_);
-  wrapped_expr.set_hide_last(is_not_necessarily_closed());
-  y.wrapped_expr.set_hide_last(y.is_not_necessarily_closed());
 }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -32537,12 +32559,12 @@ Generator::m_swap(Generator& y) {
 template <typename Specialization, typename Temp, typename To>
 inline bool
 l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const Generator& x,
-		    const Generator& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0,
-		    Temp& tmp1,
-		    Temp& tmp2) {
+                    const Generator& x,
+                    const Generator& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0,
+                    Temp& tmp1,
+                    Temp& tmp2) {
   // Generator kind compatibility check: we only compute distances
   // between (closure) points.
   if (x.is_line_or_ray() || y.is_line_or_ray())
@@ -32596,12 +32618,12 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Generator& x,
-			    const Generator& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
+                            const Generator& x,
+                            const Generator& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
   return l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >
     (r, x, y, dir, tmp0, tmp1, tmp2);
 }
@@ -32610,9 +32632,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Generator& x,
-			    const Generator& y,
-			    const Rounding_Dir dir) {
+                            const Generator& x,
+                            const Generator& y,
+                            const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -32624,9 +32646,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Generator& x,
-			    const Generator& y,
-			    const Rounding_Dir dir) {
+                            const Generator& x,
+                            const Generator& y,
+                            const Rounding_Dir dir) {
   return rectilinear_distance_assign<To, To>(r, x, y, dir);
 }
 
@@ -32634,12 +32656,12 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Generator& x,
-			  const Generator& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
+                          const Generator& x,
+                          const Generator& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
   return l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >
     (r, x, y, dir, tmp0, tmp1, tmp2);
 }
@@ -32648,9 +32670,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Generator& x,
-			  const Generator& y,
-			  const Rounding_Dir dir) {
+                          const Generator& x,
+                          const Generator& y,
+                          const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -32662,9 +32684,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Generator& x,
-			  const Generator& y,
-			  const Rounding_Dir dir) {
+                          const Generator& x,
+                          const Generator& y,
+                          const Rounding_Dir dir) {
   return euclidean_distance_assign<To, To>(r, x, y, dir);
 }
 
@@ -32672,12 +32694,12 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Generator& x,
-			   const Generator& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
+                           const Generator& x,
+                           const Generator& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
   return l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >
     (r, x, y, dir, tmp0, tmp1, tmp2);
 }
@@ -32686,9 +32708,9 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Generator& x,
-			   const Generator& y,
-			   const Rounding_Dir dir) {
+                           const Generator& x,
+                           const Generator& y,
+                           const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -32700,9 +32722,9 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Generator& x,
-			   const Generator& y,
-			   const Rounding_Dir dir) {
+                           const Generator& x,
+                           const Generator& y,
+                           const Rounding_Dir dir) {
   return l_infinity_distance_assign<To, To>(r, x, y, dir);
 }
 
@@ -32714,20 +32736,20 @@ swap(Generator& x, Generator& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Generator.defs.hh line 1035. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_defs.hh line 1032. */
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_defs.hh line 1. */
 /* Grid_Generator class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_defs.hh line 29. */
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_defs.hh line 33. */
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.defs.hh line 39. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_defs.hh line 39. */
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.defs.hh line 41. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_defs.hh line 41. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -33220,21 +33242,15 @@ public:
   */
   void set_divisor(Coefficient_traits::const_reference d);
 
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> > Expression;
-
-  //! Allows user code to read the internal expression (but note that this
-  //! is a different type, not all operations are allowed).
-  const Expression& expression() const;
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Hide_Last<Expression_Hide_Inhomo<Linear_Expression> >
+  expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
 
 private:
   Linear_Expression expr;
 
-  Expression_Hide_Inhomo<Linear_Expression> semi_wrapped_expr;
-
-  Expression wrapped_expr;
-
   Kind kind_;
 
   /*! \brief
@@ -33276,8 +33292,11 @@ private:
   bool is_equal_at_dimension(dimension_type dim,
                              const Grid_Generator& gg) const;
 
-  //! Another print functions, with fancy output, more human-friendly.
-  //! This is used by operator<<();
+  /*! \brief
+    A print function, with fancy, more human-friendly output.
+
+    This is used by operator<<().
+  */
   void fancy_print(std::ostream& s) const;
 
   //! Converts the Grid_Generator into a parameter.
@@ -33394,6 +33413,7 @@ private:
   friend int
   compare(const Grid_Generator& x, const Grid_Generator& y);
 
+  friend class Expression_Adapter<Grid_Generator>;
   friend class Grid_Generator_System;
   friend class Grid;
   friend class Linear_System<Grid_Generator>;
@@ -33483,7 +33503,7 @@ std::ostream& operator<<(std::ostream& s, const Grid_Generator::Type& t);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_inlines.hh line 1. */
 /* Grid Generator class implementation: inline functions.
 */
 
@@ -33542,8 +33562,7 @@ Grid_Generator::set_not_necessarily_closed() {
 }
 
 inline
-Grid_Generator::Grid_Generator(Linear_Expression& e, Type type)
-  : semi_wrapped_expr(expr), wrapped_expr(semi_wrapped_expr, true) {
+Grid_Generator::Grid_Generator(Linear_Expression& e, Type type) {
   swap(expr, e);
   if (type == LINE)
     kind_ = LINE_OR_EQUALITY;
@@ -33555,8 +33574,6 @@ Grid_Generator::Grid_Generator(Linear_Expression& e, Type type)
 inline
 Grid_Generator::Grid_Generator(Representation r)
   : expr(Coefficient_one(), r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
     kind_(RAY_OR_POINT_OR_INEQUALITY) {
   expr.set_space_dimension(1);
   PPL_ASSERT(OK());
@@ -33565,16 +33582,12 @@ Grid_Generator::Grid_Generator(Representation r)
 inline
 Grid_Generator::Grid_Generator(const Grid_Generator& g)
   : expr(g.expr),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
     kind_(g.kind_) {
 }
 
 inline
 Grid_Generator::Grid_Generator(const Grid_Generator& g, Representation r)
   : expr(g.expr, r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
     kind_(g.kind_) {
 }
 
@@ -33582,8 +33595,6 @@ inline
 Grid_Generator::Grid_Generator(dimension_type space_dim, Kind kind,
                                Topology topology, Representation r)
   : expr(r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
     kind_(kind) {
   PPL_USED(topology);
   PPL_ASSERT(topology == NECESSARILY_CLOSED);
@@ -33595,8 +33606,6 @@ inline
 Grid_Generator::Grid_Generator(const Grid_Generator& g,
                                dimension_type space_dim)
   : expr(g.expr, space_dim + 1),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
     kind_(g.kind_) {
   PPL_ASSERT(OK());
   PPL_ASSERT(space_dimension() == space_dim);
@@ -33606,8 +33615,6 @@ inline
 Grid_Generator::Grid_Generator(const Grid_Generator& g,
                                dimension_type space_dim, Representation r)
   : expr(g.expr, space_dim + 1, r),
-    semi_wrapped_expr(expr),
-    wrapped_expr(semi_wrapped_expr, true),
     kind_(g.kind_) {
   PPL_ASSERT(OK());
   PPL_ASSERT(space_dimension() == space_dim);
@@ -33617,9 +33624,9 @@ inline
 Grid_Generator::~Grid_Generator() {
 }
 
-inline const Grid_Generator::Expression&
+inline Grid_Generator::expr_type
 Grid_Generator::expression() const {
-  return wrapped_expr;
+  return expr_type(expr, true);
 }
 
 inline Representation
@@ -33639,7 +33646,7 @@ Grid_Generator::max_space_dimension() {
 
 inline dimension_type
 Grid_Generator::space_dimension() const {
-  return wrapped_expr.space_dimension();
+  return expression().space_dimension();
 }
 
 inline void
@@ -33648,7 +33655,8 @@ Grid_Generator::set_space_dimension(dimension_type space_dim) {
   if (space_dim > old_space_dim) {
     expr.set_space_dimension(space_dim + 1);
     expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
-  } else {
+  }
+  else {
     expr.swap_space_dimensions(Variable(space_dim), Variable(old_space_dim));
     expr.set_space_dimension(space_dim + 1);
   }
@@ -33718,7 +33726,7 @@ Grid_Generator::divisor() const {
 
 inline bool
 Grid_Generator::is_equal_at_dimension(dimension_type dim,
-				      const Grid_Generator& y) const {
+                                      const Grid_Generator& y) const {
   const Grid_Generator& x = *this;
   return x.expr.get(dim) * y.divisor() == y.expr.get(dim) * x.divisor();
 }
@@ -33776,7 +33784,6 @@ Grid_Generator::m_swap(Grid_Generator& y) {
   using std::swap;
   swap(expr, y.expr);
   swap(kind_, y.kind_);
-  // No need to modify wrapped_expr here.
 }
 
 /*! \relates Grid_Generator */
@@ -33843,18 +33850,18 @@ swap(Grid_Generator& x, Grid_Generator& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid_Generator.defs.hh line 797. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_defs.hh line 795. */
 
-/* Automatically generated from PPL source file ../src/Congruence.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_defs.hh line 1. */
 /* Congruence class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Congruence.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Congruence.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_defs.hh line 31. */
 
-/* Automatically generated from PPL source file ../src/Congruence.defs.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_defs.hh line 37. */
 
 #include <iosfwd>
 #include <vector>
@@ -34031,11 +34038,10 @@ public:
 
   void permute_space_dimensions(const std::vector<Variable>& cycles);
 
-  //! The type returned by the expression() method, that provides most
-  //! of the const methods in Linear_Expression.
-  typedef Linear_Expression Expression;
-
-  const Expression& expression() const;
+  //! The type of the (adapted) internal expression.
+  typedef Expression_Adapter_Transparent<Linear_Expression> expr_type;
+  //! Partial read access to the (adapted) internal expression.
+  expr_type expression() const;
 
   //! Returns the coefficient of \p v in \p *this.
   /*!
@@ -34267,8 +34273,8 @@ private:
   */
   void
   throw_dimension_incompatible(const char* method,
-			       const char* v_name,
-			       Variable v) const;
+                               const char* v_name,
+                               Variable v) const;
 
   friend bool
   operator==(const Congruence& x, const Congruence& y);
@@ -34276,6 +34282,7 @@ private:
   friend bool
   operator!=(const Congruence& x, const Congruence& y);
 
+  friend class Scalar_Products;
   friend class Grid;
 };
 
@@ -34322,7 +34329,7 @@ swap(Congruence& x, Congruence& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Congruence.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_inlines.hh line 1. */
 /* Congruence class implementation: inline functions.
 */
 
@@ -34372,9 +34379,9 @@ Congruence::set_representation(Representation r) {
   expr.set_representation(r);
 }
 
-inline const Congruence::Expression&
+inline Congruence::expr_type
 Congruence::expression() const {
-  return expr;
+  return expr_type(expr);
 }
 
 inline void
@@ -34394,7 +34401,7 @@ Congruence::~Congruence() {
 
 inline
 Congruence::Congruence(Linear_Expression& le,
-		       Coefficient_traits::const_reference m,
+                       Coefficient_traits::const_reference m,
                        Recycle_Input)
   : modulus_(m) {
   PPL_ASSERT(m >= 0);
@@ -34405,21 +34412,21 @@ Congruence::Congruence(Linear_Expression& le,
 
 inline Congruence
 Congruence::create(const Linear_Expression& e,
-		   Coefficient_traits::const_reference n,
+                   Coefficient_traits::const_reference n,
                    Representation r) {
   Linear_Expression diff(e, r);
   diff -= n;
-  Congruence cg(diff, 1, Recycle_Input());
+  const Congruence cg(diff, 1, Recycle_Input());
   return cg;
 }
 
 inline Congruence
 Congruence::create(Coefficient_traits::const_reference n,
-		   const Linear_Expression& e,
+                   const Linear_Expression& e,
                    Representation r) {
   Linear_Expression diff(e, r);
   diff -= n;
-  Congruence cg(diff, 1, Recycle_Input());
+  const Congruence cg(diff, 1, Recycle_Input());
   return cg;
 }
 
@@ -34546,7 +34553,7 @@ Congruence::is_equality() const {
 
 inline bool
 Congruence::is_equal_at_dimension(Variable v,
-				  const Congruence& cg) const {
+                                  const Congruence& cg) const {
   return coefficient(v) * cg.modulus() == cg.coefficient(v) * modulus();
 }
 
@@ -34581,34 +34588,39 @@ swap(Congruence& x, Congruence& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Congruence.defs.hh line 503. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_defs.hh line 505. */
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.templates.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_templates.hh line 34. */
 #include <stdexcept>
 #include <iostream>
 
 namespace Parma_Polyhedra_Library {
 
 template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Linear_Expression_Impl& e) {
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Impl& e) {
   construct(e);
 }
 
 template <typename Row>
 template <typename Row2>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Linear_Expression_Impl<Row2>& e) {
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Impl<Row2>& e) {
   construct(e);
 }
 
 template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Linear_Expression_Interface& e) {
+Linear_Expression_Impl<Row>
+::Linear_Expression_Impl(const Linear_Expression_Interface& e) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
     construct(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
     construct(*p);
-  } else {
+  }
+  else {
     // Add implementations for other derived classes here.
     PPL_UNREACHABLE;
   }
@@ -34620,23 +34632,19 @@ Linear_Expression_Impl<Row>
                          dimension_type space_dim) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&e)) {
     construct(*p, space_dim);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&e)) {
     construct(*p, space_dim);
-  } else {
+  }
+  else {
     // Add implementations for other derived classes here.
     PPL_UNREACHABLE;
   }
 }
 
 template <typename Row>
-Linear_Expression_Impl<Row>::Linear_Expression_Impl(const Congruence& cg,
-                                                    dimension_type space_dim) {
-  construct(*(cg.expression().impl), space_dim);
-}
-
-template <typename Row>
 template <typename Row2>
 void
 Linear_Expression_Impl<Row>
@@ -34651,7 +34659,7 @@ template <typename Row2>
 void
 Linear_Expression_Impl<Row>
 ::linear_combine(const Linear_Expression_Impl<Row2>& y, dimension_type i) {
-  Linear_Expression_Impl& x = *this;
+  const Linear_Expression_Impl& x = *this;
   PPL_ASSERT(i < x.space_dimension() + 1);
   PPL_ASSERT(x.space_dimension() == y.space_dimension());
   Coefficient_traits::const_reference x_i = x.row.get(i);
@@ -34700,7 +34708,8 @@ Linear_Expression_Impl<Row>
 template <typename Row>
 template <typename Row2>
 int
-Linear_Expression_Impl<Row>::compare(const Linear_Expression_Impl<Row2>& y) const {
+Linear_Expression_Impl<Row>
+::compare(const Linear_Expression_Impl<Row2>& y) const {
   const Linear_Expression_Impl& x = *this;
   // Compare all the coefficients of the row starting from position 1.
   // NOTE: x and y may be of different size.
@@ -34710,21 +34719,21 @@ Linear_Expression_Impl<Row>::compare(const Linear_Expression_Impl<Row2>& y) cons
   typename Row2::const_iterator j_end = y.row.end();
   while (i != i_end && j != j_end) {
     if (i.index() < j.index()) {
-      int s = sgn(*i);
+      const int s = sgn(*i);
       if (s != 0)
         return 2*s;
       ++i;
       continue;
     }
     if (i.index() > j.index()) {
-      int s = sgn(*j);
+      const int s = sgn(*j);
       if (s != 0)
         return -2*s;
       ++j;
       continue;
     }
     PPL_ASSERT(i.index() == j.index());
-    int s = cmp(*i, *j);
+    const int s = cmp(*i, *j);
     if (s < 0)
       return -2;
     if (s > 0)
@@ -34734,12 +34743,12 @@ Linear_Expression_Impl<Row>::compare(const Linear_Expression_Impl<Row2>& y) cons
     ++j;
   }
   for ( ; i != i_end; ++i) {
-    int s = sgn(*i);
+    const int s = sgn(*i);
     if (s != 0)
       return 2*s;
   }
   for ( ; j != j_end; ++j) {
-    int s = sgn(*j);
+    const int s = sgn(*j);
     if (s != 0)
       return -2*s;
   }
@@ -34882,7 +34891,8 @@ Linear_Expression_Impl<Row>::operator*=(Coefficient_traits::const_reference n) {
     PPL_ASSERT(OK());
     return *this;
   }
-  for (typename Row::iterator i = row.begin(), i_end = row.end(); i != i_end; ++i)
+  for (typename Row::iterator i = row.begin(),
+         i_end = row.end(); i != i_end; ++i)
     (*i) *= n;
   PPL_ASSERT(OK());
   return *this;
@@ -34909,7 +34919,8 @@ Linear_Expression_Impl<Row>::operator/=(Coefficient_traits::const_reference n) {
 template <typename Row>
 void
 Linear_Expression_Impl<Row>::negate() {
-  for (typename Row::iterator i = row.begin(), i_end = row.end(); i != i_end; ++i)
+  for (typename Row::iterator i = row.begin(),
+         i_end = row.end(); i != i_end; ++i)
     neg_assign(*i);
   PPL_ASSERT(OK());
 }
@@ -35052,8 +35063,8 @@ Linear_Expression_Impl<Row>
   // NOTE: Since all coefficients in [start,end) are multiple of c,
   // each of the resulting coefficients will be nonzero iff the initial
   // coefficient was.
-  for (typename Row::iterator
-    i = row.lower_bound(start), i_end = row.lower_bound(end); i != i_end; ++i)
+  for (typename Row::iterator i = row.lower_bound(start),
+         i_end = row.lower_bound(end); i != i_end; ++i)
     Parma_Polyhedra_Library::exact_div_assign(*i, *i, c);
   PPL_ASSERT(OK());
 }
@@ -35068,7 +35079,8 @@ Linear_Expression_Impl<Row>
     const typename Row::iterator& i_end = row.end();
     while (i != i_end && i.index() < end)
       i = row.reset(i);
-  } else {
+  }
+  else {
     for (typename Row::iterator
       i = row.lower_bound(start), i_end = row.lower_bound(end); i != i_end; ++i)
       (*i) *= c;
@@ -35107,7 +35119,8 @@ Linear_Expression_Impl<Row>
       const typename Row::iterator& i_end = row.end();
       while (i != i_end && i.index() < end)
         i = row.reset(i);
-    } else {
+    }
+    else {
       PPL_ASSERT(c1 == 0);
       PPL_ASSERT(c2 != 0);
 
@@ -35143,15 +35156,16 @@ Linear_Expression_Impl<Row>
         ++j;
       }
     }
-  } else {
+  }
+  else {
     if (c2 == 0) {
       PPL_ASSERT(c1 != 0);
       PPL_ASSERT(c2 == 0);
       for (typename Row::iterator i = row.lower_bound(start),
-                                  i_end = row.lower_bound(end);
-          i != i_end; ++i)
+             i_end = row.lower_bound(end); i != i_end; ++i)
         (*i) *= c1;
-    } else {
+    }
+    else {
       PPL_ASSERT(c1 != 0);
       PPL_ASSERT(c2 != 0);
       Parma_Polyhedra_Library::linear_combine(row, y.row, c1, c2, start, end);
@@ -35174,9 +35188,9 @@ Linear_Expression_Impl<Row>::sign_normalize() {
     for ( ; i != i_end; ++i)
       neg_assign(*i);
     // Negate the first coefficient, too.
-    typename Row::iterator i = row.begin();
-    if (i != row.end() && i.index() == 0)
-      neg_assign(*i);
+    typename Row::iterator first = row.begin();
+    if (first != row.end() && first.index() == 0)
+      neg_assign(*first);
   }
   PPL_ASSERT(OK());
 }
@@ -35215,7 +35229,8 @@ template <typename Row>
 template <typename Row2>
 void
 Linear_Expression_Impl<Row>
-::scalar_product_assign(Coefficient& result, const Linear_Expression_Impl<Row2>& y,
+::scalar_product_assign(Coefficient& result,
+                        const Linear_Expression_Impl<Row2>& y,
                         dimension_type start, dimension_type end) const {
   const Linear_Expression_Impl<Row>& x = *this;
   PPL_ASSERT(start <= end);
@@ -35231,12 +35246,14 @@ Linear_Expression_Impl<Row>
       Parma_Polyhedra_Library::add_mul_assign(result, *x_i, *y_i);
       ++x_i;
       ++y_i;
-    } else {
+    }
+    else {
       if (x_i.index() < y_i.index()) {
         PPL_ASSERT(y.row.get(x_i.index()) == 0);
         // (*x_i) * 0 == 0, nothing to do.
         ++x_i;
-      } else {
+      }
+      else {
         PPL_ASSERT(x.row.get(y_i.index()) == 0);
         // 0 * (*y_i) == 0, nothing to do.
         ++y_i;
@@ -35279,12 +35296,14 @@ Linear_Expression_Impl<Row>
         return false;
       ++i;
       ++j;
-    } else {
+    }
+    else {
       if (i.index() < j.index()) {
         if (*i != 0)
           return false;
         ++i;
-      } else {
+      }
+      else {
         PPL_ASSERT(i.index() > j.index());
         if (*j != 0)
           return false;
@@ -35336,12 +35355,14 @@ Linear_Expression_Impl<Row>
         return false;
       ++i;
       ++j;
-    } else {
+    }
+    else {
       if (i.index() < j.index()) {
         if (*i != 0)
           return false;
         ++i;
-      } else {
+      }
+      else {
         PPL_ASSERT(i.index() > j.index());
         if (*j != 0)
           return false;
@@ -35364,11 +35385,13 @@ Linear_Expression_Impl<Row>
 ::linear_combine(const Linear_Expression_Interface& y, Variable v) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     linear_combine(*p, v);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     linear_combine(*p, v);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35382,11 +35405,13 @@ Linear_Expression_Impl<Row>
                  Coefficient_traits::const_reference c2) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     linear_combine(*p, c1, c2);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     linear_combine(*p, c1, c2);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35400,11 +35425,13 @@ Linear_Expression_Impl<Row>
                      Coefficient_traits::const_reference c2) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     linear_combine_lax(*p, c1, c2);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     linear_combine_lax(*p, c1, c2);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35416,11 +35443,13 @@ Linear_Expression_Impl<Row>
 ::is_equal_to(const Linear_Expression_Interface& y) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return is_equal_to(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return is_equal_to(*p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return false;
@@ -35433,11 +35462,13 @@ Linear_Expression_Impl<Row>
 ::operator+=(const Linear_Expression_Interface& y) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return operator+=(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return operator+=(*p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return *this;
@@ -35450,11 +35481,13 @@ Linear_Expression_Impl<Row>
 ::operator-=(const Linear_Expression_Interface& y) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return operator-=(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return operator-=(*p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return *this;
@@ -35468,11 +35501,13 @@ Linear_Expression_Impl<Row>
                  const Linear_Expression_Interface& y) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     add_mul_assign(factor, *p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     add_mul_assign(factor, *p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35485,11 +35520,13 @@ Linear_Expression_Impl<Row>
                  const Linear_Expression_Interface& y) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     sub_mul_assign(factor, *p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     sub_mul_assign(factor, *p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35501,11 +35538,13 @@ Linear_Expression_Impl<Row>
 ::linear_combine(const Linear_Expression_Interface& y, dimension_type i) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     linear_combine(*p, i);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     linear_combine(*p, i);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35520,11 +35559,13 @@ Linear_Expression_Impl<Row>
                  dimension_type start, dimension_type end) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     linear_combine(*p, c1, c2, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     linear_combine(*p, c1, c2, start, end);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35539,11 +35580,13 @@ Linear_Expression_Impl<Row>
                      dimension_type start, dimension_type end) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     linear_combine_lax(*p, c1, c2, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     linear_combine_lax(*p, c1, c2, start, end);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35555,11 +35598,13 @@ Linear_Expression_Impl<Row>
 ::compare(const Linear_Expression_Interface& y) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return compare(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return compare(*p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return 0;
@@ -35572,11 +35617,13 @@ void
 Linear_Expression_Impl<Row>::construct(const Linear_Expression_Interface& y) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return construct(*p);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return construct(*p);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35588,11 +35635,13 @@ Linear_Expression_Impl<Row>::construct(const Linear_Expression_Interface& y,
                                        dimension_type space_dim) {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return construct(*p, space_dim);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return construct(*p, space_dim);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35606,11 +35655,13 @@ Linear_Expression_Impl<Row>
                         dimension_type start, dimension_type end) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     scalar_product_assign(result, *p, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     scalar_product_assign(result, *p, start, end);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
   }
@@ -35623,11 +35674,13 @@ Linear_Expression_Impl<Row>
                       dimension_type start, dimension_type end) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return scalar_product_sign(*p, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return scalar_product_sign(*p, start, end);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return 0;
@@ -35641,11 +35694,13 @@ Linear_Expression_Impl<Row>
               dimension_type start, dimension_type end) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return is_equal_to(*p, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return is_equal_to(*p, start, end);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return false;
@@ -35661,11 +35716,13 @@ Linear_Expression_Impl<Row>
               dimension_type start, dimension_type end) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return is_equal_to(*p, c1, c2, start, end);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return is_equal_to(*p, c1, c2, start, end);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return false;
@@ -35679,11 +35736,13 @@ Linear_Expression_Impl<Row>
                          Variable first, Variable last) const {
   typedef const Linear_Expression_Impl<Dense_Row>* Dense_Ptr;
   typedef const Linear_Expression_Impl<Sparse_Row>* Sparse_Ptr;
-  if (Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
+  if (const Dense_Ptr p = dynamic_cast<Dense_Ptr>(&y)) {
     return have_a_common_variable(*p, first, last);
-  } else if (Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
+  }
+  else if (const Sparse_Ptr p = dynamic_cast<Sparse_Ptr>(&y)) {
     return have_a_common_variable(*p, first, last);
-  } else {
+  }
+  else {
     // Add implementations for new derived classes here.
     PPL_UNREACHABLE;
     return false;
@@ -35758,8 +35817,7 @@ template <typename Row>
 bool
 Linear_Expression_Impl<Row>::const_iterator
 ::operator==(const const_iterator_interface& x) const {
-  const const_iterator* p
-    = dynamic_cast<const const_iterator*>(&x);
+  const const_iterator* const p = dynamic_cast<const const_iterator*>(&x);
   // Comparing iterators belonging to different rows is forbidden.
   PPL_ASSERT(p != 0);
   PPL_ASSERT(row == p->row);
@@ -35815,19 +35873,19 @@ Linear_Expression_Impl<Row>::OK() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_Expression_Impl.defs.hh line 915. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Expression_Impl_defs.hh line 905. */
 
-/* Automatically generated from PPL source file ../src/Linear_Form.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_templates.hh line 1. */
 /* Linear_Form class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Box.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_defs.hh line 1. */
 /* Box class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Poly_Con_Relation.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Con_Relation_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -35836,7 +35894,7 @@ class Poly_Con_Relation;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Poly_Gen_Relation.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Gen_Relation_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -35845,7 +35903,7 @@ class Poly_Gen_Relation;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -35870,7 +35928,7 @@ class Partially_Reduced_Product;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.defs.hh line 50. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_defs.hh line 50. */
 #include <vector>
 #include <iosfwd>
 
@@ -35917,14 +35975,14 @@ std::ostream& operator<<(std::ostream& s, const Box<ITV>& box);
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename ITV>
 bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    Rounding_Dir dir);
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            Rounding_Dir dir);
 
 //! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
 /*! \relates Box
@@ -35935,14 +35993,14 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename ITV>
 bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    Rounding_Dir dir);
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            Rounding_Dir dir);
 
 //! Computes the rectilinear (or Manhattan) distance between \p x and \p y.
 /*! \relates Box
@@ -35958,12 +36016,12 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2);
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2);
 
 //! Computes the euclidean distance between \p x and \p y.
 /*! \relates Box
@@ -35974,14 +36032,14 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename ITV>
 bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  Rounding_Dir dir);
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          Rounding_Dir dir);
 
 //! Computes the euclidean distance between \p x and \p y.
 /*! \relates Box
@@ -35992,14 +36050,14 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename ITV>
 bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  Rounding_Dir dir);
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          Rounding_Dir dir);
 
 //! Computes the euclidean distance between \p x and \p y.
 /*! \relates Box
@@ -36015,12 +36073,12 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2);
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2);
 
 //! Computes the \f$L_\infty\f$ distance between \p x and \p y.
 /*! \relates Box
@@ -36031,14 +36089,14 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename ITV>
 bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   Rounding_Dir dir);
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           Rounding_Dir dir);
 
 //! Computes the \f$L_\infty\f$ distance between \p x and \p y.
 /*! \relates Box
@@ -36049,14 +36107,14 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename ITV>
 bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   Rounding_Dir dir);
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           Rounding_Dir dir);
 
 //! Computes the \f$L_\infty\f$ distance between \p x and \p y.
 /*! \relates Box
@@ -36072,12 +36130,12 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2);
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 /*! \relates Box
@@ -36085,12 +36143,12 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Specialization,
-	  typename Temp, typename To, typename ITV>
+          typename Temp, typename To, typename ITV>
 bool
 l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const Box<ITV>& x, const Box<ITV>& y,
-		    Rounding_Dir dir,
-		    Temp& tmp0, Temp& tmp1, Temp& tmp2);
+                    const Box<ITV>& x, const Box<ITV>& y,
+                    Rounding_Dir dir,
+                    Temp& tmp0, Temp& tmp1, Temp& tmp2);
 
 } // namespace Parma_Polyhedra_Library
 
@@ -36150,7 +36208,7 @@ public:
     Specifies whether the universe or the empty box has to be built.
   */
   explicit Box(dimension_type num_dimensions = 0,
-	       Degenerate_Element kind = UNIVERSE);
+               Degenerate_Element kind = UNIVERSE);
 
   //! Ordinary copy constructor.
   /*!
@@ -36257,7 +36315,7 @@ public:
   */
   template <typename T>
   explicit Box(const BD_Shape<T>& bds,
-	       Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
+               Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
 
   //! Builds a box containing the octagonal shape \p oct.
   /*!
@@ -36266,7 +36324,7 @@ public:
   */
   template <typename T>
   explicit Box(const Octagonal_Shape<T>& oct,
-	       Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
+               Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
 
   //! Builds a box containing the polyhedron \p ph.
   /*!
@@ -36276,7 +36334,7 @@ public:
     smallest one containing \p ph.
   */
   explicit Box(const Polyhedron& ph,
-	       Complexity_Class complexity = ANY_COMPLEXITY);
+               Complexity_Class complexity = ANY_COMPLEXITY);
 
   //! Builds a box containing the grid \p gr.
   /*!
@@ -36284,7 +36342,7 @@ public:
     The \p complexity argument is ignored.
   */
   explicit Box(const Grid& gr,
-	       Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
+               Complexity_Class complexity = POLYNOMIAL_COMPLEXITY);
 
   //! Builds a box containing the partially reduced product \p dp.
   /*!
@@ -36293,7 +36351,7 @@ public:
   */
   template <typename D1, typename D2, typename R>
   explicit Box(const Partially_Reduced_Product<D1, D2, R>& dp,
-	       Complexity_Class complexity = ANY_COMPLEXITY);
+               Complexity_Class complexity = ANY_COMPLEXITY);
 
   /*! \brief
     The assignment operator
@@ -36419,7 +36477,7 @@ public:
     and \p maximum are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -36450,8 +36508,8 @@ public:
     and \p g are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -36478,7 +36536,7 @@ public:
     and \p minimum are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -36509,8 +36567,8 @@ public:
     and \p g are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if there exist a
@@ -36844,9 +36902,9 @@ public:
     \p *this.
   */
   void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
 
   // FIXME: To be completed.
   /*! \brief
@@ -36893,9 +36951,9 @@ public:
     dimension-incompatible or if \p var is not a space dimension of \p *this.
   */
   void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -36922,10 +36980,10 @@ public:
     dimension-incompatible or if \p var is not a space dimension of \p *this.
   */
   void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				  = Coefficient_one());
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                  = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -36953,10 +37011,10 @@ public:
   */
   void
   generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -36977,8 +37035,8 @@ public:
     Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs.
   */
   void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -36999,8 +37057,8 @@ public:
     Thrown if \p *this is dimension-incompatible with \p lhs or \p rhs.
   */
   void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -37028,10 +37086,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -37059,10 +37117,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -37199,7 +37257,7 @@ public:
                      && Is_Same_Or_Derived<Interval_Base, ITV>::value,
                      void>::type
   CC76_widening_assign(const T& y,
-		       Iterator first, Iterator last);
+                       Iterator first, Iterator last);
 
   //! Same as CC76_widening_assign(y, tp).
   void widening_assign(const Box& y, unsigned* tp = 0);
@@ -37225,8 +37283,8 @@ public:
     if \p cs contains a strict inequality.
   */
   void limited_CC76_extrapolation_assign(const Box& y,
-					 const Constraint_System& cs,
-					 unsigned* tp = 0);
+                                         const Constraint_System& cs,
+                                         unsigned* tp = 0);
 
   /*! \brief
     Assigns to \p *this the result of restoring in \p y the constraints
@@ -37485,7 +37543,7 @@ public:
        boundary of \f$I\f$ is closed (i.e., it is included in the interval).
   */
   bool has_lower_bound(Variable var,
-		       Coefficient& n, Coefficient& d, bool& closed) const;
+                       Coefficient& n, Coefficient& d, bool& closed) const;
 
   /*! \brief
     If the space dimension of \p var is unbounded above, return
@@ -37588,13 +37646,13 @@ private:
   Sequence seq;
 
 #define PPL_IN_Box_CLASS
-/* Automatically generated from PPL source file ../src/Box_Status.idefs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_Status_idefs.hh line 1. */
 /* Box<ITV>::Status class declaration.
 */
 
 
 #ifndef PPL_IN_Box_CLASS
-#error "Do not include Box_Status.idefs.hh directly; use Box.defs.hh instead"
+#error "Do not include Box_Status_idefs.hh directly; use Box_defs.hh instead"
 #endif
 
 //! A conjunctive assertion about a Box<ITV> object.
@@ -37681,7 +37739,7 @@ private:
   void reset(flags_t mask);
 };
 
-/* Automatically generated from PPL source file ../src/Box.defs.hh line 1768. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_defs.hh line 1768. */
 #undef PPL_IN_Box_CLASS
 
   //! The status flags to keep track of the internal state.
@@ -38044,9 +38102,9 @@ private:
     \p included and \p g are left untouched.
   */
   bool max_min(const Linear_Expression& expr,
-	       bool maximize,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included,
-	       Generator& g) const;
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator& g) const;
 
   //! Maximizes or minimizes \p expr subject to \p *this.
   /*!
@@ -38074,8 +38132,8 @@ private:
     \p included and \p point are left untouched.
   */
   bool max_min(const Linear_Expression& expr,
-	       bool maximize,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included) const;
 
   /*! \brief
     Adds to \p limiting_box the interval constraints in \p cs
@@ -38087,29 +38145,29 @@ private:
   //! \name Exception Throwers
   //@{
   void throw_dimension_incompatible(const char* method,
-				    const Box& y) const;
+                                    const Box& y) const;
 
   void throw_dimension_incompatible(const char* method,
-				    dimension_type required_dim) const;
+                                    dimension_type required_dim) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const Constraint& c) const;
+                                    const Constraint& c) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const Congruence& cg) const;
+                                    const Congruence& cg) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const Constraint_System& cs) const;
+                                    const Constraint_System& cs) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const Congruence_System& cgs) const;
+                                    const Congruence_System& cgs) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const Generator& g) const;
+                                    const Generator& g) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const char* le_name,
-				    const Linear_Expression& le) const;
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
 
   template <typename C>
   void throw_dimension_incompatible(const char* method,
@@ -38119,7 +38177,7 @@ private:
   static void throw_constraint_incompatible(const char* method);
 
   static void throw_expression_too_complex(const char* method,
-					   const Linear_Expression& le);
+                                           const Linear_Expression& le);
 
   static void throw_invalid_argument(const char* method, const char* reason);
   //@} // Exception Throwers
@@ -38196,7 +38254,7 @@ public:
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box_Status.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_Status_inlines.hh line 1. */
 /* Box<ITV>::Status class implementation: inline functions.
 */
 
@@ -38402,31 +38460,31 @@ Box<ITV>::Status::ascii_load(std::istream& s) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_inlines.hh line 1. */
 /* Box class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constraint_System.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_defs.hh line 1. */
 /* Constraint_System class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constraint_System.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Linear_System.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_defs.hh line 1. */
 /* Linear_System class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Linear_System.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Swapping_Vector.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Swapping_Vector_defs.hh line 1. */
 /* Swapping_Vector class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Swapping_Vector.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Swapping_Vector_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -38436,10 +38494,10 @@ class Swapping_Vector;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Swapping_Vector.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Swapping_Vector_defs.hh line 29. */
 
 #include <vector>
-/* Automatically generated from PPL source file ../src/Swapping_Vector.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Swapping_Vector_defs.hh line 32. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -38504,7 +38562,7 @@ void swap(Swapping_Vector<T>& x, Swapping_Vector<T>& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Swapping_Vector.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Swapping_Vector_inlines.hh line 1. */
 /* Swapping_Vector class implementation: inline functions.
 */
 
@@ -38716,11 +38774,11 @@ swap(Swapping_Vector<T>& vec1, Swapping_Vector<T>& vec2) {
 } // namespace Parma_Polyhedra_Library
 
 
-/* Automatically generated from PPL source file ../src/Swapping_Vector.defs.hh line 97. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Swapping_Vector_defs.hh line 97. */
 
-/* Automatically generated from PPL source file ../src/Linear_System.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_defs.hh line 33. */
 
-/* Automatically generated from PPL source file ../src/Bit_Row.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Row_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -38729,7 +38787,7 @@ class Bit_Row;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Bit_Matrix.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Matrix_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -38738,7 +38796,7 @@ class Bit_Matrix;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.defs.hh line 39. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_defs.hh line 39. */
 
 // TODO: Check how much of this description is still true.
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -39279,17 +39337,17 @@ bool operator!=(const Linear_System<Row>& x, const Linear_System<Row>& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_inlines.hh line 1. */
 /* Linear_System class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Bit_Row.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Row_defs.hh line 1. */
 /* Bit_Row class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Bit_Row.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Row_defs.hh line 29. */
 #include <iosfwd>
 #include <gmpxx.h>
 #include <vector>
@@ -39355,7 +39413,7 @@ bool subset_or_equal(const Bit_Row& x, const Bit_Row& y);
 */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 bool subset_or_equal(const Bit_Row& x, const Bit_Row& y,
-		     bool& strict_subset);
+                     bool& strict_subset);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Set-theoretic strict inclusion test.
@@ -39425,7 +39483,7 @@ public:
   friend bool operator!=(const Bit_Row& x, const Bit_Row& y);
   friend bool subset_or_equal(const Bit_Row& x, const Bit_Row& y);
   friend bool subset_or_equal(const Bit_Row& x, const Bit_Row& y,
-			      bool& strict_subset);
+                              bool& strict_subset);
   friend bool strict_subset(const Bit_Row& x, const Bit_Row& y);
 
   //! Returns the index of the first set bit or ULONG_MAX if no bit is set.
@@ -39473,12 +39531,12 @@ private:
   void union_helper(const Bit_Row& y, const Bit_Row& z);
 };
 
-/* Automatically generated from PPL source file ../src/Bit_Row.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Row_inlines.hh line 1. */
 /* Bit_Row class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Bit_Row.inlines.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Row_inlines.hh line 30. */
 
 // For the declaration of ffs(3).
 #if defined(PPL_HAVE_STRINGS_H)
@@ -39549,7 +39607,7 @@ Bit_Row::clear_from(const unsigned long k) {
 
 inline unsigned long
 Bit_Row::count_ones() const {
-  mp_size_t x_size = vec->_mp_size;
+  const mp_size_t x_size = vec->_mp_size;
   PPL_ASSERT(x_size >= 0);
   return (x_size == 0) ? 0 : mpn_popcount(vec->_mp_d, x_size);
 }
@@ -39685,9 +39743,9 @@ iter_swap(std::vector<Bit_Row>::iterator x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Bit_Row.defs.hh line 213. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Row_defs.hh line 213. */
 
-/* Automatically generated from PPL source file ../src/Linear_System.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_inlines.hh line 29. */
 
 #include <algorithm>
 
@@ -40028,16 +40086,17 @@ inline void
 Linear_System<Row>::remove_row_no_ok(const dimension_type i,
                                      const bool keep_sorted) {
   PPL_ASSERT(i < num_rows());
-  bool was_pending = (i >= index_first_pending);
+  const bool was_pending = (i >= index_first_pending);
 
   if (sorted && keep_sorted && !was_pending) {
     for (dimension_type j = i + 1; j < rows.size(); ++j)
       swap(rows[j], rows[j-1]);
     rows.pop_back();
-  } else {
+  }
+  else {
     if (!was_pending)
       sorted = false;
-    bool last_row_is_pending = (num_rows() - 1 >= index_first_pending);
+    const bool last_row_is_pending = (num_rows() - 1 >= index_first_pending);
     if (was_pending == last_row_is_pending)
       // Either both rows are pending or both rows are not pending.
       swap(rows[i], rows.back());
@@ -40084,7 +40143,7 @@ Linear_System<Row>::remove_rows(dimension_type first,
   // non-pending) status.
   PPL_ASSERT(first >= index_first_pending || last <= index_first_pending);
 
-  bool were_pending = (first >= index_first_pending);
+  const bool were_pending = (first >= index_first_pending);
 
   // Move the rows in [first,last) at the end of the system.
   if (sorted && keep_sorted && !were_pending) {
@@ -40104,7 +40163,7 @@ Linear_System<Row>::remove_rows(dimension_type first,
   // We can ignore the row ordering, but we must not mix pending and
   // non-pending rows.
 
-  dimension_type offset = rows.size() - n - first;
+  const dimension_type offset = rows.size() - n - first;
   // We want to swap the rows in [first, last) and
   // [first + offset, last + offset) (note that these intervals may not be
   // disjunct).
@@ -40119,7 +40178,8 @@ Linear_System<Row>::remove_rows(dimension_type first,
 
     // `n' non-pending rows have been removed.
     index_first_pending -= n;
-  } else {
+  }
+  else {
     // There are some pending rows in [first + offset, last + offset).
     if (were_pending) {
       // Both intervals contain only pending rows, because the second
@@ -40131,7 +40191,8 @@ Linear_System<Row>::remove_rows(dimension_type first,
 
       // `n' non-pending rows have been removed.
       index_first_pending -= n;
-    } else {
+    }
+    else {
       PPL_ASSERT(rows.size() - n < index_first_pending);
       PPL_ASSERT(rows.size() > index_first_pending);
       PPL_ASSERT(!were_pending);
@@ -40235,7 +40296,8 @@ Linear_System<Row>::remove_rows(const std::vector<dimension_type>& indexes) {
     if (*itr == i) {
       // The current row has to be removed, don't increment last_unused_row.
       ++itr;
-    } else {
+    }
+    else {
       // The current row must not be removed, swap it after the last used row.
       swap(rows[last_unused_row], rows[i]);
       ++last_unused_row;
@@ -40258,11 +40320,13 @@ Linear_System<Row>::remove_rows(const std::vector<dimension_type>& indexes) {
   // Adjust index_first_pending.
   if (indexes[0] >= index_first_pending) {
     // Removing pending rows only.
-  } else {
+  }
+  else {
     if (indexes.back() < index_first_pending) {
       // Removing non-pending rows only.
       index_first_pending -= indexes.size();
-    } else {
+    }
+    else {
       // Removing some pending and some non-pending rows, count the
       // non-pending rows that must be removed.
       // This exploits the fact that `indexes' is sorted by using binary
@@ -40351,17 +40415,17 @@ swap(Linear_System<Row>& x, Linear_System<Row>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_templates.hh line 1. */
 /* Linear_System class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Bit_Matrix.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Matrix_defs.hh line 1. */
 /* Bit_Matrix class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Bit_Matrix.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Matrix_defs.hh line 30. */
 #include <vector>
 #include <iosfwd>
 
@@ -40517,13 +40581,13 @@ bool operator!=(const Bit_Matrix& x, const Bit_Matrix& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Bit_Matrix.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Matrix_inlines.hh line 1. */
 /* Bit_Matrix class implementation: inline functions.
 */
 
 
 #include <algorithm>
-/* Automatically generated from PPL source file ../src/Bit_Matrix.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Matrix_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -40540,7 +40604,7 @@ Bit_Matrix::max_num_rows() {
 
 inline
 Bit_Matrix::Bit_Matrix(const dimension_type n_rows,
-		       const dimension_type n_columns)
+                       const dimension_type n_columns)
   : rows(n_rows),
     row_size(n_columns) {
 }
@@ -40627,7 +40691,7 @@ inline bool
 Bit_Matrix::sorted_contains(const Bit_Row& row) const {
   PPL_ASSERT(check_sorted());
   return std::binary_search(rows.begin(), rows.end(), row,
-			    Bit_Row_Less_Than());
+                            Bit_Row_Less_Than());
 }
 
 /*! \relates Bit_Matrix */
@@ -40644,14 +40708,14 @@ swap(Bit_Matrix& x, Bit_Matrix& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Bit_Matrix.defs.hh line 186. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Bit_Matrix_defs.hh line 186. */
 
-/* Automatically generated from PPL source file ../src/Scalar_Products.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Scalar_Products_defs.hh line 1. */
 /* Scalar_Products class definition.
 */
 
 
-/* Automatically generated from PPL source file ../src/Scalar_Products.defs.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Scalar_Products_defs.hh line 34. */
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! A class implementing various scalar product functions.
@@ -40676,15 +40740,15 @@ public:
 
   //! Computes the scalar product of \p c and \p g and assigns it to \p z.
   static void assign(Coefficient& z,
-		     const Constraint& c, const Grid_Generator& gg);
+                     const Constraint& c, const Grid_Generator& gg);
 
   //! Computes the scalar product of \p g and \p cg and assigns it to \p z.
   static void assign(Coefficient& z,
-		     const Grid_Generator& gg, const Congruence& cg);
+                     const Grid_Generator& gg, const Congruence& cg);
 
   //! Computes the scalar product of \p cg and \p g and assigns it to \p z.
   static void assign(Coefficient& z,
-		     const Congruence& cg, const Grid_Generator& gg);
+                     const Congruence& cg, const Grid_Generator& gg);
 
   //! Returns the sign of the scalar product between \p x and \p y.
   static int sign(const Linear_Expression& x, const Linear_Expression& y);
@@ -40704,7 +40768,7 @@ public:
     and assigns the result to \p z.
   */
   static void reduced_assign(Coefficient& z,
-			     const Linear_Expression& x,
+                             const Linear_Expression& x,
                              const Linear_Expression& y);
 
   /*! \brief
@@ -40713,7 +40777,7 @@ public:
     and assigns the result to \p z.
   */
   static void reduced_assign(Coefficient& z,
-			     const Constraint& c, const Generator& g);
+                             const Constraint& c, const Generator& g);
 
   /*! \brief
     Computes the \e reduced scalar product of \p g and \p c,
@@ -40721,14 +40785,14 @@ public:
     and assigns the result to \p z.
   */
   static void reduced_assign(Coefficient& z,
-			     const Generator& g, const Constraint& c);
+                             const Generator& g, const Constraint& c);
 
   //! \brief
   //! Computes the \e reduced scalar product of \p g and \p cg,
   //! where the \f$\epsilon\f$ coefficient of \p g is ignored,
   //! and assigns the result to \p z.
   static void reduced_assign(Coefficient& z,
-			     const Grid_Generator& gg, const Congruence& cg);
+                             const Grid_Generator& gg, const Congruence& cg);
 
   /*! \brief
     Returns the sign of the \e reduced scalar product of \p x and \p y,
@@ -40755,7 +40819,7 @@ public:
     and assigns the result to \p z.
   */
   static void homogeneous_assign(Coefficient& z,
-				 const Linear_Expression& x,
+                                 const Linear_Expression& x,
                                  const Linear_Expression& y);
   /*! \brief
     Computes the \e homogeneous scalar product of \p e and \p g,
@@ -40763,15 +40827,15 @@ public:
     and assigns the result to \p z.
   */
   static void homogeneous_assign(Coefficient& z,
-				 const Linear_Expression& e,
-				 const Generator& g);
+                                 const Linear_Expression& e,
+                                 const Generator& g);
 
   //! \brief
   //! Computes the \e homogeneous scalar product of \p gg and \p c,
   //! where the inhomogeneous terms are ignored,
   //! and assigns the result to \p z.
   static void homogeneous_assign(Coefficient& z,
-				 const Grid_Generator& gg,
+                                 const Grid_Generator& gg,
                                  const Constraint& c);
 
   //! \brief
@@ -40779,7 +40843,7 @@ public:
   //! where the inhomogeneous terms are ignored,
   //! and assigns the result to \p z.
   static void homogeneous_assign(Coefficient& z,
-				 const Grid_Generator& gg,
+                                 const Grid_Generator& gg,
                                  const Congruence& cg);
 
   //! \brief
@@ -40787,8 +40851,8 @@ public:
   //! where the inhomogeneous terms are ignored,
   //! and assigns the result to \p z.
   static void homogeneous_assign(Coefficient& z,
-				 const Linear_Expression& e,
-				 const Grid_Generator& g);
+                                 const Linear_Expression& e,
+                                 const Grid_Generator& g);
 
   /*! \brief
     Returns the sign of the \e homogeneous scalar product of \p x and \p y,
@@ -40807,7 +40871,7 @@ public:
   //! Returns the sign of the \e homogeneous scalar product of \p e and \p g,
   //! where the inhomogeneous terms are ignored,
   static int homogeneous_sign(const Linear_Expression& e,
-			      const Grid_Generator& g);
+                              const Grid_Generator& g);
 
   //! \brief
   //! Returns the sign of the \e homogeneous scalar product of \p g and \p c,
@@ -40835,21 +40899,22 @@ public:
 
 private:
   //! The type of the scalar product sign function pointer.
-  typedef int (*SPS_type)(const Linear_Expression&, const Linear_Expression&);
+  typedef int (* const SPS_type)(const Linear_Expression&,
+                                 const Linear_Expression&);
 
   //! The scalar product sign function pointer.
   SPS_type sps_fp;
 };
 
-// NOTE: Scalar_Products.inlines.hh is NOT included here, to avoid cyclic
+// NOTE: Scalar_Products_inlines.hh is NOT included here, to avoid cyclic
 // include dependencies.
 
-/* Automatically generated from PPL source file ../src/Scalar_Products.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Scalar_Products_inlines.hh line 1. */
 /* Scalar_Products class implementation (inline functions).
 */
 
 
-/* Automatically generated from PPL source file ../src/Scalar_Products.inlines.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Scalar_Products_inlines.hh line 32. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -40911,33 +40976,33 @@ Scalar_Products::reduced_sign(const Generator& g, const Constraint& c) {
 
 inline void
 Scalar_Products::homogeneous_assign(Coefficient& z,
-				    const Linear_Expression& e,
-				    const Generator& g) {
+                                    const Linear_Expression& e,
+                                    const Generator& g) {
   homogeneous_assign(z, e, g.expr);
 }
 
 inline void
 Scalar_Products::homogeneous_assign(Coefficient& z,
-				    const Linear_Expression& e,
-				    const Grid_Generator& g) {
+                                    const Linear_Expression& e,
+                                    const Grid_Generator& g) {
   homogeneous_assign(z, e, g.expr);
 }
 
 inline int
 Scalar_Products::homogeneous_sign(const Linear_Expression& e,
-				  const Generator& g) {
+                                  const Generator& g) {
   return homogeneous_sign(e, g.expr);
 }
 
 inline int
 Scalar_Products::homogeneous_sign(const Linear_Expression& e,
-				  const Grid_Generator& g) {
+                                  const Grid_Generator& g) {
   return homogeneous_sign(e, g.expr);
 }
 
 inline int
 Scalar_Products::homogeneous_sign(const Grid_Generator& g,
-				  const Constraint& c) {
+                                  const Constraint& c) {
   PPL_DIRTY_TEMP_COEFFICIENT(z);
   homogeneous_assign(z, g, c);
   return sgn(z);
@@ -40947,47 +41012,47 @@ inline
 Topology_Adjusted_Scalar_Product_Sign
 ::Topology_Adjusted_Scalar_Product_Sign(const Constraint& c)
   : sps_fp(c.is_necessarily_closed()
-	   ? static_cast<SPS_type>(&Scalar_Products::sign)
-	   : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
+           ? static_cast<SPS_type>(&Scalar_Products::sign)
+           : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
 }
 
 inline
 Topology_Adjusted_Scalar_Product_Sign
 ::Topology_Adjusted_Scalar_Product_Sign(const Generator& g)
   : sps_fp(g.is_necessarily_closed()
-	   ? static_cast<SPS_type>(&Scalar_Products::sign)
-	   : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
+           ? static_cast<SPS_type>(&Scalar_Products::sign)
+           : static_cast<SPS_type>(&Scalar_Products::reduced_sign)) {
 }
 
 inline int
 Topology_Adjusted_Scalar_Product_Sign::operator()(const Constraint& c,
-						  const Generator& g) const {
+                                                  const Generator& g) const {
   PPL_ASSERT(c.space_dimension() <= g.space_dimension());
   PPL_ASSERT(sps_fp == (c.is_necessarily_closed()
-		    ? static_cast<SPS_type>(&Scalar_Products::sign)
-		    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
+                    ? static_cast<SPS_type>(&Scalar_Products::sign)
+                    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
   return sps_fp(c.expr, g.expr);
 }
 
 inline int
 Topology_Adjusted_Scalar_Product_Sign::operator()(const Generator& g,
-						  const Constraint& c) const {
+                                                  const Constraint& c) const {
   PPL_ASSERT(g.space_dimension() <= c.space_dimension());
   PPL_ASSERT(sps_fp == (g.is_necessarily_closed()
-		    ? static_cast<SPS_type>(&Scalar_Products::sign)
-		    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
+                    ? static_cast<SPS_type>(&Scalar_Products::sign)
+                    : static_cast<SPS_type>(&Scalar_Products::reduced_sign)));
   return sps_fp(g.expr, c.expr);
 }
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.templates.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_templates.hh line 31. */
 #include <algorithm>
 #include <iostream>
 #include <string>
 #include <deque>
 
-/* Automatically generated from PPL source file ../src/swapping_sort.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/swapping_sort_templates.hh line 1. */
 /* Sorting objects for which copies cost more than swaps.
 */
 
@@ -41144,7 +41209,7 @@ swapping_unique(Iter first, Iter last) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.templates.hh line 37. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_templates.hh line 37. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -41177,9 +41242,9 @@ Linear_System<Row>::merge_rows_assign(const Linear_System& y) {
                                tmp.max_num_rows()));
 
   dimension_type xi = 0;
-  dimension_type x_num_rows = x.num_rows();
+  const dimension_type x_num_rows = x.num_rows();
   dimension_type yi = 0;
-  dimension_type y_num_rows = y.num_rows();
+  const dimension_type y_num_rows = y.num_rows();
 
   while (xi < x_num_rows && yi < y_num_rows) {
     const int comp = compare(x[xi], y[yi]);
@@ -41189,8 +41254,8 @@ Linear_System<Row>::merge_rows_assign(const Linear_System& y) {
       swap(tmp.back(), x.rows[xi++]);
       tmp.back().set_representation(representation());
       if (comp == 0)
-	// A duplicate element.
-	++yi;
+        // A duplicate element.
+        ++yi;
     }
     else {
       // (comp > 0)
@@ -41229,8 +41294,8 @@ Linear_System<Row>::ascii_dump(std::ostream& s) const {
   // Constraint_System and Generator_System take care of properly
   // printing the contents of the system.
   s << "topology " << (is_necessarily_closed()
-		       ? "NECESSARILY_CLOSED"
-		       : "NOT_NECESSARILY_CLOSED")
+                       ? "NECESSARILY_CLOSED"
+                       : "NOT_NECESSARILY_CLOSED")
     << "\n"
     << num_rows() << " x " << space_dimension() << " ";
   Parma_Polyhedra_Library::ascii_dump(s, representation());
@@ -41282,7 +41347,7 @@ Linear_System<Row>::ascii_load(std::istream& s) {
 
   if (!(s >> str) || (str != "(sorted)" && str != "(not_sorted)"))
     return false;
-  bool sortedness = (str == "(sorted)");
+  const bool sortedness = (str == "(sorted)");
   dimension_type index;
   if (!(s >> str) || str != "index_first_pending")
     return false;
@@ -41351,11 +41416,12 @@ Linear_System<Row>::insert_pending_no_ok(Row& r, Recycle_Input) {
   // TODO: A Grid_Generator_System may contain non-normalized lines that
   // represent parameters, so this check is disabled. Consider re-enabling it
   // when it's possibile.
-  /*
-    // The added row must be strongly normalized and have the same
-    // number of elements as the existing rows of the system.
-    PPL_ASSERT(r.check_strong_normalized());
-  */
+#if 0
+  // The added row must be strongly normalized and have the same
+  // number of elements as the existing rows of the system.
+  PPL_ASSERT(r.check_strong_normalized());
+#endif
+
   PPL_ASSERT(r.topology() == topology());
 
   r.set_representation(representation());
@@ -41461,14 +41527,15 @@ Linear_System<Row>::remove_space_dimensions(const Variables_Set& vars) {
   // NOTE: num_rows() is *not* constant, because it may be decreased by
   // remove_row_no_ok().
   for (dimension_type i = 0; i < num_rows(); ) {
-    bool valid = rows[i].remove_space_dimensions(vars);
+    const bool valid = rows[i].remove_space_dimensions(vars);
     if (!valid) {
       // Remove the current row.
       // We can't call remove_row(i) here, because the system is not OK as
       // some rows already have the new space dimension and others still have
       // the old one.
       remove_row_no_ok(i, false);
-    } else
+    }
+    else
       ++i;
   }
 
@@ -41501,13 +41568,13 @@ Linear_System<Row>::sort_rows() {
 template <typename Row>
 void
 Linear_System<Row>::sort_rows(const dimension_type first_row,
-			      const dimension_type last_row) {
+                              const dimension_type last_row) {
   PPL_ASSERT(first_row <= last_row && last_row <= num_rows());
   // We cannot mix pending and non-pending rows.
   PPL_ASSERT(first_row >= first_pending_row()
              || last_row <= first_pending_row());
 
-  bool sorting_pending = (first_row >= first_pending_row());
+  const bool sorting_pending = (first_row >= first_pending_row());
   const dimension_type old_num_pending = num_pending_rows();
 
   const dimension_type num_elems = last_row - first_row;
@@ -41537,7 +41604,8 @@ Linear_System<Row>::sort_rows(const dimension_type first_row,
   if (sorting_pending) {
     PPL_ASSERT(old_num_pending >= num_duplicates);
     index_first_pending = num_rows() - (old_num_pending - num_duplicates);
-  } else {
+  }
+  else {
     index_first_pending = num_rows() - old_num_pending;
   }
 
@@ -41603,12 +41671,14 @@ Linear_System<Row>::sort_and_remove_with_sat(Bit_Matrix& sat) {
   // Build the function objects implementing indirect sort comparison,
   // indirect unique comparison and indirect swap operation.
   typedef Swapping_Vector<Row> Cont;
-  Implementation::Indirect_Sort_Compare<Cont, Row_Less_Than> sort_cmp(rows);
-  Unique_Compare unique_cmp(rows);
-  Implementation::Indirect_Swapper2<Cont, Bit_Matrix> swapper(rows, sat);
+  const Implementation::Indirect_Sort_Compare<Cont, Row_Less_Than>
+    sort_cmp(rows);
+  const Unique_Compare unique_cmp(rows);
+  const Implementation::Indirect_Swapper2<Cont, Bit_Matrix> swapper(rows, sat);
 
   const dimension_type num_duplicates
-    = Implementation::indirect_sort_and_unique(num_elems, sort_cmp, unique_cmp, swapper);
+    = Implementation::indirect_sort_and_unique(num_elems, sort_cmp,
+                                               unique_cmp, swapper);
 
   const dimension_type new_first_pending_row
     = first_pending_row() - num_duplicates;
@@ -41659,13 +41729,13 @@ Linear_System<Row>::gauss(const dimension_type n_lines_or_equalities) {
       // Search for the first row having a non-zero coefficient
       // (the pivot) in the j-th column.
       if ((*this)[i].expr.get(j) == 0)
-	continue;
+        continue;
       // Pivot found: if needed, swap rows so that this one becomes
       // the rank-th row in the linear system.
       if (i > rank) {
-	swap(rows[i], rows[rank]);
-	// After swapping the system is no longer sorted.
-	changed = true;
+        swap(rows[i], rows[rank]);
+        // After swapping the system is no longer sorted.
+        changed = true;
       }
       // Combine the row containing the pivot with all the lines or
       // equalities following it, so that all the elements on the j-th
@@ -41716,7 +41786,7 @@ Linear_System<Row>
     // looks for the last non-zero element.
     // `j' will be the index of such a element.
     Row& row_k = rows[k];
-    dimension_type j = row_k.expr.last_nonzero();
+    const dimension_type j = row_k.expr.last_nonzero();
     // TODO: Check this.
     PPL_ASSERT(j != 0);
 
@@ -41724,16 +41794,16 @@ Linear_System<Row>
     for (dimension_type i = k; i-- > 0; ) {
       Row& row_i = rows[i];
       if (row_i.expr.get(Variable(j - 1)) != 0) {
-	// Combine linearly `row_i' with `row_k'
-	// so that `row_i[j]' becomes zero.
+        // Combine linearly `row_i' with `row_k'
+        // so that `row_i[j]' becomes zero.
         row_i.linear_combine(row_k, j);
-	if (still_sorted) {
-	  // Trying to keep sortedness: remember which rows
-	  // have to be re-checked for sortedness at the end.
-	  if (i > 0)
-	    check_for_sortedness[i-1] = true;
-	  check_for_sortedness[i] = true;
-	}
+        if (still_sorted) {
+          // Trying to keep sortedness: remember which rows
+          // have to be re-checked for sortedness at the end.
+          if (i > 0)
+            check_for_sortedness[i-1] = true;
+          check_for_sortedness[i] = true;
+        }
       }
     }
 
@@ -41755,16 +41825,16 @@ Linear_System<Row>
     for (dimension_type i = n_lines_or_equalities; i < nrows; ++i) {
       Row& row_i = rows[i];
       if (row_i.expr.get(Variable(j - 1)) != 0) {
-	// Combine linearly the `row_i' with `row_k'
-	// so that `row_i[j]' becomes zero.
+        // Combine linearly the `row_i' with `row_k'
+        // so that `row_i[j]' becomes zero.
         row_i.linear_combine(row_k, j);
-	if (still_sorted) {
-	  // Trying to keep sortedness: remember which rows
-	  // have to be re-checked for sortedness at the end.
-	  if (i > n_lines_or_equalities)
-	    check_for_sortedness[i-1] = true;
-	  check_for_sortedness[i] = true;
-	}
+        if (still_sorted) {
+          // Trying to keep sortedness: remember which rows
+          // have to be re-checked for sortedness at the end.
+          if (i > n_lines_or_equalities)
+            check_for_sortedness[i-1] = true;
+          check_for_sortedness[i] = true;
+        }
       }
     }
     if (have_to_negate)
@@ -41799,9 +41869,9 @@ Linear_System<Row>::simplify() {
   for (dimension_type i = 0; i < nrows; ++i)
     if ((*this)[i].is_line_or_equality()) {
       if (n_lines_or_equalities < i) {
-	swap(rows[i], rows[n_lines_or_equalities]);
-	// The system was not sorted.
-	PPL_ASSERT(!sorted);
+        swap(rows[i], rows[n_lines_or_equalities]);
+        // The system was not sorted.
+        PPL_ASSERT(!sorted);
       }
       ++n_lines_or_equalities;
     }
@@ -41813,7 +41883,7 @@ Linear_System<Row>::simplify() {
       n_rays_or_points_or_inequalities = nrows - n_lines_or_equalities;
     const dimension_type
       num_swaps = std::min(n_lines_or_equalities - rank,
-			   n_rays_or_points_or_inequalities);
+                           n_rays_or_points_or_inequalities);
     for (dimension_type i = num_swaps; i-- > 0; )
       swap(rows[--nrows], rows[rank + i]);
     remove_trailing_rows(old_nrows - nrows);
@@ -41853,7 +41923,8 @@ Linear_System<Row>
       le += Variable(c);
       Row r(le, Row::LINE_OR_EQUALITY, row_topology);
       swap(r, rows[i]);
-    } else {
+    }
+    else {
       // Variable(c) is the epsilon dimension.
       PPL_ASSERT(row_topology == NOT_NECESSARILY_CLOSED);
       Linear_Expression le(Variable(c), representation());
@@ -41880,7 +41951,8 @@ Linear_System<Row>
                                            Variable(old_space_dim - 1 + n));
         PPL_ASSERT(rows[i].OK());
       }
-    } else {
+    }
+    else {
       dimension_type old_eps_index = old_space_dim - 1;
       // The upper-right corner of `rows' contains the J matrix:
       // swap coefficients to preserve sortedness.
@@ -42000,7 +42072,7 @@ Linear_System<Row>::OK() const {
   if (first_pending_row() > num_rows()) {
 #ifndef NDEBUG
     cerr << "Linear_System has a negative number of pending rows!"
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -42011,8 +42083,8 @@ Linear_System<Row>::OK() const {
     if (topology() != rows[i].topology()) {
 #ifndef NDEBUG
       cerr << "Topology mismatch between the system "
-	   << "and one of its rows!"
-	   << endl;
+           << "and one of its rows!"
+           << endl;
 #endif
       return false;
     }
@@ -42020,7 +42092,7 @@ Linear_System<Row>::OK() const {
   if (sorted && !check_sorted()) {
 #ifndef NDEBUG
     cerr << "The system declares itself to be sorted but it is not!"
-	 << endl;
+         << endl;
 #endif
     return false;
   }
@@ -42031,11 +42103,11 @@ Linear_System<Row>::OK() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Linear_System.defs.hh line 581. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_System_defs.hh line 581. */
 
-/* Automatically generated from PPL source file ../src/Constraint_System.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_defs.hh line 31. */
 
-/* Automatically generated from PPL source file ../src/Constraint_System.defs.hh line 38. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_defs.hh line 38. */
 #include <iterator>
 #include <iosfwd>
 
@@ -42683,14 +42755,14 @@ num_constraints(const Constraint_System& cs);
 
 } // namespace Parma_Polyhedra_Library
 
-// Constraint_System.inlines.hh is not included here on purpose.
+// Constraint_System_inlines.hh is not included here on purpose.
 
-/* Automatically generated from PPL source file ../src/Constraint_System.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_inlines.hh line 1. */
 /* Constraint_System class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constraint_System.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constraint_System_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -42723,7 +42795,7 @@ Constraint_System::Constraint_System(const Topology topol, Representation r)
 
 inline
 Constraint_System::Constraint_System(const Topology topol,
-				     const dimension_type space_dim,
+                                     const dimension_type space_dim,
                                      Representation r)
   : sys(topol, space_dim, r) {
 }
@@ -42838,7 +42910,7 @@ Constraint_System_const_iterator::operator!=(const Constraint_System_const_itera
 inline
 Constraint_System_const_iterator::
 Constraint_System_const_iterator(const Linear_System<Constraint>::const_iterator& iter,
-	       const Constraint_System& cs)
+               const Constraint_System& cs)
   : i(iter), csp(&cs.sys) {
 }
 
@@ -43102,12 +43174,12 @@ num_constraints(const Constraint_System& cs) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Congruence_System.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_System_defs.hh line 1. */
 /* Congruence_System class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Congruence_System.defs.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_System_defs.hh line 35. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -43324,10 +43396,10 @@ public:
   */
   class const_iterator
     : public std::iterator<std::forward_iterator_tag,
-			   Congruence,
-			   ptrdiff_t,
-			   const Congruence*,
-			   const Congruence&> {
+                           Congruence,
+                           ptrdiff_t,
+                           const Congruence*,
+                           const Congruence&> {
   public:
     //! Default constructor.
     const_iterator();
@@ -43376,7 +43448,7 @@ public:
 
     //! Constructor.
     const_iterator(const Swapping_Vector<Congruence>::const_iterator& iter,
-		   const Congruence_System& cgs);
+                   const Congruence_System& cgs);
 
     //! \p *this skips to the next non-trivial congruence.
     void skip_forward();
@@ -43615,14 +43687,14 @@ swap(Congruence_System& x, Congruence_System& y);
 
 } // namespace Parma_Polyhedra_Library
 
-// Congruence_System.inlines.hh is not included here on purpose.
+// Congruence_System_inlines.hh is not included here on purpose.
 
-/* Automatically generated from PPL source file ../src/Congruence_System.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_System_inlines.hh line 1. */
 /* Congruence_System class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Congruence_System.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Congruence_System_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -43817,7 +43889,7 @@ Congruence_System::const_iterator::operator!=(const const_iterator& y) const {
 inline
 Congruence_System::const_iterator::
 const_iterator(const Swapping_Vector<Congruence>::const_iterator& iter,
-	       const Congruence_System& cgs)
+               const Congruence_System& cgs)
   : i(iter), csp(&cgs.rows) {
 }
 
@@ -43867,7 +43939,7 @@ swap(Congruence_System& x, Congruence_System& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.inlines.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_inlines.hh line 33. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -44399,12 +44471,12 @@ Box<ITV>::unconstrain(const Variable var) {
 template <typename Temp, typename To, typename ITV>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
   return l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >
     (r, x, y, dir, tmp0, tmp1, tmp2);
 }
@@ -44413,9 +44485,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    const Rounding_Dir dir) {
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -44427,9 +44499,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename ITV>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Box<ITV>& x,
-			    const Box<ITV>& y,
-			    const Rounding_Dir dir) {
+                            const Box<ITV>& x,
+                            const Box<ITV>& y,
+                            const Rounding_Dir dir) {
   // FIXME: the following qualification is only to work around a bug
   // in the Intel C/C++ compiler version 10.1.x.
   return Parma_Polyhedra_Library
@@ -44440,12 +44512,12 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
   return l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >
     (r, x, y, dir, tmp0, tmp1, tmp2);
 }
@@ -44454,9 +44526,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  const Rounding_Dir dir) {
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -44468,9 +44540,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename ITV>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Box<ITV>& x,
-			  const Box<ITV>& y,
-			  const Rounding_Dir dir) {
+                          const Box<ITV>& x,
+                          const Box<ITV>& y,
+                          const Rounding_Dir dir) {
   // FIXME: the following qualification is only to work around a bug
   // in the Intel C/C++ compiler version 10.1.x.
   return Parma_Polyhedra_Library
@@ -44481,12 +44553,12 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
   return l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >
     (r, x, y, dir, tmp0, tmp1, tmp2);
 }
@@ -44495,9 +44567,9 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename ITV>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   const Rounding_Dir dir) {
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -44509,9 +44581,9 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename ITV>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Box<ITV>& x,
-			   const Box<ITV>& y,
-			   const Rounding_Dir dir) {
+                           const Box<ITV>& x,
+                           const Box<ITV>& y,
+                           const Rounding_Dir dir) {
   // FIXME: the following qualification is only to work around a bug
   // in the Intel C/C++ compiler version 10.1.x.
   return Parma_Polyhedra_Library
@@ -44527,24 +44599,24 @@ swap(Box<ITV>& x, Box<ITV>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_templates.hh line 1. */
 /* Box class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Generator_System.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_System_defs.hh line 1. */
 /* Generator_System class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Generator_System.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_System_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Poly_Con_Relation.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Con_Relation_defs.hh line 1. */
 /* Poly_Con_Relation class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Poly_Con_Relation.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Con_Relation_defs.hh line 29. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -44562,7 +44634,7 @@ bool operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y);
 //! Yields the logical conjunction of \p x and \p y.
 /*! \relates Poly_Con_Relation */
 Poly_Con_Relation operator&&(const Poly_Con_Relation& x,
-			     const Poly_Con_Relation& y);
+                             const Poly_Con_Relation& y);
 
 /*! \brief
   Yields the assertion with all the conjuncts of \p x
@@ -44571,7 +44643,7 @@ Poly_Con_Relation operator&&(const Poly_Con_Relation& x,
   \relates Poly_Con_Relation
 */
 Poly_Con_Relation operator-(const Poly_Con_Relation& x,
-			    const Poly_Con_Relation& y);
+                            const Poly_Con_Relation& y);
 
 namespace IO_Operators {
 
@@ -44680,7 +44752,7 @@ public:
   bool OK() const;
 };
 
-/* Automatically generated from PPL source file ../src/Poly_Con_Relation.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Con_Relation_inlines.hh line 1. */
 /* Poly_Con_Relation class implementation: inline functions.
 */
 
@@ -44758,9 +44830,9 @@ operator-(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Poly_Con_Relation.defs.hh line 165. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Con_Relation_defs.hh line 165. */
 
-/* Automatically generated from PPL source file ../src/Generator_System.defs.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_System_defs.hh line 35. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -45243,7 +45315,7 @@ private:
     contains closure points.
   */
   bool adjust_topology_and_space_dimension(Topology new_topology,
-					   dimension_type new_space_dim);
+                                           dimension_type new_space_dim);
 
   /*! \brief
     For each unmatched closure point in \p *this, adds the
@@ -45338,8 +45410,8 @@ private:
     \p expr is a constant parameter and unaltered by this computation.
   */
   void affine_image(Variable v,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator);
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator);
 
   //! Returns the number of lines of the system.
   dimension_type num_lines() const;
@@ -45468,14 +45540,14 @@ private:
   void skip_forward();
 };
 
-// Generator_System.inlines.hh is not included here on purpose.
+// Generator_System_inlines.hh is not included here on purpose.
 
-/* Automatically generated from PPL source file ../src/Generator_System.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_System_inlines.hh line 1. */
 /* Generator_System class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Generator_System.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Generator_System_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -45508,7 +45580,7 @@ Generator_System::Generator_System(const Topology topol, Representation r)
 
 inline
 Generator_System::Generator_System(const Topology topol,
-				   const dimension_type space_dim,
+                                   const dimension_type space_dim,
                                    Representation r)
   : sys(topol, space_dim, r) {
 }
@@ -45859,12 +45931,12 @@ swap(Generator_System& x, Generator_System& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Poly_Gen_Relation.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Gen_Relation_defs.hh line 1. */
 /* Poly_Gen_Relation class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Poly_Gen_Relation.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Gen_Relation_defs.hh line 29. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -45882,7 +45954,7 @@ bool operator!=(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y);
 //! Yields the logical conjunction of \p x and \p y.
 /*! \relates Poly_Gen_Relation */
 Poly_Gen_Relation operator&&(const Poly_Gen_Relation& x,
-			     const Poly_Gen_Relation& y);
+                             const Poly_Gen_Relation& y);
 
 /*! \brief
   Yields the assertion with all the conjuncts of \p x
@@ -45891,7 +45963,7 @@ Poly_Gen_Relation operator&&(const Poly_Gen_Relation& x,
   \relates Poly_Gen_Relation
 */
 Poly_Gen_Relation operator-(const Poly_Gen_Relation& x,
-			    const Poly_Gen_Relation& y);
+                            const Poly_Gen_Relation& y);
 
 namespace IO_Operators {
 
@@ -45973,7 +46045,7 @@ public:
   bool OK() const;
 };
 
-/* Automatically generated from PPL source file ../src/Poly_Gen_Relation.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Gen_Relation_inlines.hh line 1. */
 /* Poly_Gen_Relation class implementation: inline functions.
 */
 
@@ -46036,14 +46108,14 @@ operator-(const Poly_Gen_Relation& x, const Poly_Gen_Relation& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Poly_Gen_Relation.defs.hh line 138. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Poly_Gen_Relation_defs.hh line 138. */
 
-/* Automatically generated from PPL source file ../src/Polyhedron.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_defs.hh line 1. */
 /* Polyhedron class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/H79_Certificate.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/H79_Certificate_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -46052,7 +46124,7 @@ class H79_Certificate;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron.defs.hh line 51. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_defs.hh line 51. */
 #include <vector>
 #include <iosfwd>
 
@@ -46409,8 +46481,8 @@ protected:
     Specifies whether the universe or the empty polyhedron has to be built.
   */
   Polyhedron(Topology topol,
-	     dimension_type num_dimensions,
-	     Degenerate_Element kind);
+             dimension_type num_dimensions,
+             Degenerate_Element kind);
 
   //! Ordinary copy constructor.
   /*!
@@ -46673,7 +46745,7 @@ public:
     and \p maximum are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -46704,8 +46776,8 @@ public:
     and \p g are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -46732,7 +46804,7 @@ public:
     and \p minimum are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -46763,8 +46835,8 @@ public:
     and \p g are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if there exist a
@@ -47202,14 +47274,14 @@ public:
        is different from zero.
     -# If the transformation is invertible, then we can write
        \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
-	   = a_\mathrm{var} x_\mathrm{var}
-	     + \sum_{i \neq var} a_i x_i + b,
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
+           = a_\mathrm{var} x_\mathrm{var}
+             + \sum_{i \neq var} a_i x_i + b,
        \f]
        so that the inverse transformation is
        \f[
-	 a_\mathrm{var} x_\mathrm{var}
+         a_\mathrm{var} x_\mathrm{var}
            = \mathrm{denominator} * {x'}_\mathrm{var}
              - \sum_{i \neq j} a_i x_i - b.
        \f]
@@ -47226,9 +47298,9 @@ public:
             \vect{x} = (x_0, \ldots, x_{n-1})^\mathrm{T}
           \bigm|
             \vect{x} = \vect{\lambda} R + \vect{\mu} V,
-	    \vect{\lambda} \in \Rset^{m_1}_+,
-	    \vect{\mu} \in \Rset^{m_2}_+,
-	    \sum_{i = 0}^{m_2 - 1} \mu_i = 1
+            \vect{\lambda} \in \Rset^{m_1}_+,
+            \vect{\mu} \in \Rset^{m_2}_+,
+            \sum_{i = 0}^{m_2 - 1} \mu_i = 1
           \,\bigr\}
     \f]
     and \f$T\f$ is the affine transformation to apply to \f$P\f$, then
@@ -47249,9 +47321,9 @@ public:
     \endif
   */
   void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
 
   // FIXME: To be completed.
   /*!
@@ -47320,14 +47392,14 @@ public:
        is different from zero.
     -# If the transformation is invertible, then we can write
        \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
            = a_\mathrm{var} x_\mathrm{var}
                + \sum_{i \neq \mathrm{var}} a_i x_i + b,
        \f],
        the inverse transformation is
        \f[
-	 a_\mathrm{var} x_\mathrm{var}
+         a_\mathrm{var} x_\mathrm{var}
            = \mathrm{denominator} * {x'}_\mathrm{var}
                - \sum_{i \neq j} a_i x_i - b.
        \f].
@@ -47367,9 +47439,9 @@ public:
     \endif
   */
   void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -47398,10 +47470,10 @@ public:
     relation symbol.
   */
   void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				= Coefficient_one());
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -47431,10 +47503,10 @@ public:
   */
   void
   generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -47457,8 +47529,8 @@ public:
     relation symbol.
   */
   void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -47481,8 +47553,8 @@ public:
     relation symbol.
   */
   void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
 
   /*!
     \brief
@@ -47511,10 +47583,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
 
   /*!
     \brief
@@ -47543,10 +47615,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -47688,8 +47760,8 @@ public:
     dimension-incompatible.
   */
   void limited_BHRZ03_extrapolation_assign(const Polyhedron& y,
-					   const Constraint_System& cs,
-					   unsigned* tp = 0);
+                                           const Constraint_System& cs,
+                                           unsigned* tp = 0);
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -47713,8 +47785,8 @@ public:
     dimension-incompatible.
   */
   void bounded_BHRZ03_extrapolation_assign(const Polyhedron& y,
-					   const Constraint_System& cs,
-					   unsigned* tp = 0);
+                                           const Constraint_System& cs,
+                                           unsigned* tp = 0);
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -47759,8 +47831,8 @@ public:
     dimension-incompatible.
   */
   void limited_H79_extrapolation_assign(const Polyhedron& y,
-					const Constraint_System& cs,
-					unsigned* tp = 0);
+                                        const Constraint_System& cs,
+                                        unsigned* tp = 0);
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -47784,8 +47856,8 @@ public:
     dimension-incompatible.
   */
   void bounded_H79_extrapolation_assign(const Polyhedron& y,
-					const Constraint_System& cs,
-					unsigned* tp = 0);
+                                        const Constraint_System& cs,
+                                        unsigned* tp = 0);
 
   //@} // Space Dimension Preserving Member Functions that May Modify [...]
 
@@ -48033,13 +48105,13 @@ private:
   Bit_Matrix sat_g;
 
 #define PPL_IN_Polyhedron_CLASS
-/* Automatically generated from PPL source file ../src/Ph_Status.idefs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ph_Status_idefs.hh line 1. */
 /* Polyhedron::Status class declaration.
 */
 
 
 #ifndef PPL_IN_Polyhedron_CLASS
-#error "Do not include Ph_Status.idefs.hh directly; use Polyhedron.defs.hh instead"
+#error "Do not include Ph_Status_idefs.hh directly; use Polyhedron_defs.hh instead"
 #endif
 
 //! A conjunctive assertion about a polyhedron.
@@ -48194,7 +48266,7 @@ private:
   void reset(flags_t mask);
 };
 
-/* Automatically generated from PPL source file ../src/Polyhedron.defs.hh line 2032. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_defs.hh line 2032. */
 #undef PPL_IN_Polyhedron_CLASS
 
   //! The status flags to keep track of the polyhedron's internal state.
@@ -48624,9 +48696,9 @@ private:
     \p included and \p g are left untouched.
   */
   bool max_min(const Linear_Expression& expr,
-	       bool maximize,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included,
-	       Generator& g) const;
+               bool maximize,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator& g) const;
 
   //! \name Widening- and Extrapolation-Related Functions
   //@{
@@ -48636,7 +48708,7 @@ private:
     to the definition of the CH78-widening of \p *this and \p y.
   */
   void select_CH78_constraints(const Polyhedron& y,
-			       Constraint_System& cs_selection) const;
+                               Constraint_System& cs_selection) const;
 
   /*! \brief
     Splits the constraints of `x' into two subsets, depending on whether
@@ -48644,21 +48716,21 @@ private:
     of \p *this and \p y.
   */
   void select_H79_constraints(const Polyhedron& y,
-			      Constraint_System& cs_selected,
-			      Constraint_System& cs_not_selected) const;
+                              Constraint_System& cs_selected,
+                              Constraint_System& cs_not_selected) const;
 
   bool BHRZ03_combining_constraints(const Polyhedron& y,
-				    const BHRZ03_Certificate& y_cert,
- 				    const Polyhedron& H79,
-				    const Constraint_System& x_minus_H79_cs);
+                                    const BHRZ03_Certificate& y_cert,
+                                    const Polyhedron& H79,
+                                    const Constraint_System& x_minus_H79_cs);
 
   bool BHRZ03_evolving_points(const Polyhedron& y,
-			      const BHRZ03_Certificate& y_cert,
-			      const Polyhedron& H79);
+                              const BHRZ03_Certificate& y_cert,
+                              const Polyhedron& H79);
 
   bool BHRZ03_evolving_rays(const Polyhedron& y,
-			    const BHRZ03_Certificate& y_cert,
-			    const Polyhedron& H79);
+                            const BHRZ03_Certificate& y_cert,
+                            const Polyhedron& H79);
 
   static void modify_according_to_evolution(Linear_Expression& ray,
                                             const Linear_Expression& x,
@@ -48696,10 +48768,10 @@ private:
   */
   template <typename Linear_System1, typename Linear_System2>
   static void add_space_dimensions(Linear_System1& sys1,
-				   Linear_System2& sys2,
-				   Bit_Matrix& sat1,
-				   Bit_Matrix& sat2,
-				   dimension_type add_dim);
+                                   Linear_System2& sys2,
+                                   Bit_Matrix& sat1,
+                                   Bit_Matrix& sat2,
+                                   dimension_type add_dim);
 
   //! \name Minimization-Related Static Member Functions
   //@{
@@ -48708,9 +48780,9 @@ private:
   // Detailed Doxygen comment to be found in file minimize.cc.
   template <typename Source_Linear_System, typename Dest_Linear_System>
   static bool minimize(bool con_to_gen,
-		       Source_Linear_System& source,
-		       Dest_Linear_System& dest,
-		       Bit_Matrix& sat);
+                       Source_Linear_System& source,
+                       Dest_Linear_System& dest,
+                       Bit_Matrix& sat);
 
   /*! \brief
     Adds given constraints and builds minimized corresponding generators
@@ -48720,10 +48792,10 @@ private:
   template <typename Source_Linear_System1, typename Source_Linear_System2,
             typename Dest_Linear_System>
   static bool add_and_minimize(bool con_to_gen,
-			       Source_Linear_System1& source1,
-			       Dest_Linear_System& dest,
-			       Bit_Matrix& sat,
-			       const Source_Linear_System2& source2);
+                               Source_Linear_System1& source1,
+                               Dest_Linear_System& dest,
+                               Bit_Matrix& sat,
+                               const Source_Linear_System2& source2);
 
   /*! \brief
     Adds given constraints and builds minimized corresponding generators
@@ -48732,18 +48804,18 @@ private:
   // Detailed Doxygen comment to be found in file minimize.cc.
   template <typename Source_Linear_System, typename Dest_Linear_System>
   static bool add_and_minimize(bool con_to_gen,
-			       Source_Linear_System& source,
-			       Dest_Linear_System& dest,
-			       Bit_Matrix& sat);
+                               Source_Linear_System& source,
+                               Dest_Linear_System& dest,
+                               Bit_Matrix& sat);
 
   //! Performs the conversion from constraints to generators and vice versa.
   // Detailed Doxygen comment to be found in file conversion.cc.
   template <typename Source_Linear_System, typename Dest_Linear_System>
   static dimension_type conversion(Source_Linear_System& source,
-				   dimension_type start,
-				   Dest_Linear_System& dest,
-				   Bit_Matrix& sat,
-				   dimension_type num_lines_or_equalities);
+                                   dimension_type start,
+                                   Dest_Linear_System& dest,
+                                   Bit_Matrix& sat,
+                                   dimension_type num_lines_or_equalities);
 
   /*! \brief
     Uses Gauss' elimination method to simplify the result of
@@ -48810,57 +48882,57 @@ protected:
   void throw_invalid_argument(const char* method, const char* reason) const;
 
   void throw_topology_incompatible(const char* method,
-				   const char* ph_name,
-				   const Polyhedron& ph) const;
+                                   const char* ph_name,
+                                   const Polyhedron& ph) const;
   void throw_topology_incompatible(const char* method,
-				   const char* c_name,
-				   const Constraint& c) const;
+                                   const char* c_name,
+                                   const Constraint& c) const;
   void throw_topology_incompatible(const char* method,
-				   const char* g_name,
-				   const Generator& g) const;
+                                   const char* g_name,
+                                   const Generator& g) const;
   void throw_topology_incompatible(const char* method,
-				   const char* cs_name,
-				   const Constraint_System& cs) const;
+                                   const char* cs_name,
+                                   const Constraint_System& cs) const;
   void throw_topology_incompatible(const char* method,
-				   const char* gs_name,
-				   const Generator_System& gs) const;
+                                   const char* gs_name,
+                                   const Generator_System& gs) const;
 
   void throw_dimension_incompatible(const char* method,
-				    const char* other_name,
-				    dimension_type other_dim) const;
+                                    const char* other_name,
+                                    dimension_type other_dim) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* ph_name,
-				    const Polyhedron& ph) const;
+                                    const char* ph_name,
+                                    const Polyhedron& ph) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* le_name,
-				    const Linear_Expression& le) const;
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* c_name,
-				    const Constraint& c) const;
+                                    const char* c_name,
+                                    const Constraint& c) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* g_name,
-				    const Generator& g) const;
+                                    const char* g_name,
+                                    const Generator& g) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* cg_name,
-				    const Congruence& cg) const;
+                                    const char* cg_name,
+                                    const Congruence& cg) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* cs_name,
-				    const Constraint_System& cs) const;
+                                    const char* cs_name,
+                                    const Constraint_System& cs) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* gs_name,
-				    const Generator_System& gs) const;
+                                    const char* gs_name,
+                                    const Generator_System& gs) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* cgs_name,
-				    const Congruence_System& cgs) const;
+                                    const char* cgs_name,
+                                    const Congruence_System& cgs) const;
   template <typename C>
   void throw_dimension_incompatible(const char* method,
-				    const char* lf_name,
-				    const Linear_Form<C>& lf) const;
+                                    const char* lf_name,
+                                    const Linear_Form<C>& lf) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* var_name,
-				    Variable var) const;
+                                    const char* var_name,
+                                    Variable var) const;
   void throw_dimension_incompatible(const char* method,
-				    dimension_type required_space_dim) const;
+                                    dimension_type required_space_dim) const;
 
   // Note: the following three methods need to be static, because they
   // can be called inside constructors (before actually constructing the
@@ -48880,10 +48952,10 @@ protected:
                                      const char* method, const char* reason);
 
   void throw_invalid_generator(const char* method,
-			       const char* g_name) const;
+                               const char* g_name) const;
 
   void throw_invalid_generators(const char* method,
-				const char* gs_name) const;
+                                const char* gs_name) const;
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   //@} // Exception Throwers
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
@@ -48951,7 +49023,7 @@ protected:
   */
   template <typename FP_Format, typename Interval_Info>
   static void convert_to_integer_expression(
-	      const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+              const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
               const dimension_type lf_dimension,
               Linear_Expression& result);
 
@@ -48998,7 +49070,7 @@ protected:
                                        const Row2& eq);
 };
 
-/* Automatically generated from PPL source file ../src/Ph_Status.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ph_Status_inlines.hh line 1. */
 /* Polyhedron::Status class implementation: inline functions.
 */
 
@@ -49193,12 +49265,12 @@ Polyhedron::Status::set_sat_g_up_to_date() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_inlines.hh line 1. */
 /* Polyhedron class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Polyhedron.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_inlines.hh line 29. */
 #include <algorithm>
 #include <deque>
 
@@ -49225,10 +49297,10 @@ Polyhedron::max_space_dimension() {
   // One dimension is reserved to have a value of type dimension_type
   // that does not represent a legal dimension.
   return min(std::numeric_limits<dimension_type>::max() - 1,
-	     min(Constraint_System::max_space_dimension(),
-		 Generator_System::max_space_dimension()
-		 )
-	     );
+             min(Constraint_System::max_space_dimension(),
+                 Generator_System::max_space_dimension()
+                 )
+             );
 }
 
 inline Topology
@@ -49471,13 +49543,11 @@ Polyhedron::process_pending() const {
   PPL_ASSERT(space_dim > 0 && !marked_empty());
   PPL_ASSERT(has_something_pending());
 
-  Polyhedron& x = const_cast<Polyhedron&>(*this);
+  if (has_pending_constraints())
+    return process_pending_constraints();
 
-  if (x.has_pending_constraints())
-    return x.process_pending_constraints();
-
-  PPL_ASSERT(x.has_pending_generators());
-  x.process_pending_generators();
+  PPL_ASSERT(has_pending_generators());
+  process_pending_generators();
   return true;
 }
 
@@ -49493,31 +49563,31 @@ Polyhedron::bounds_from_below(const Linear_Expression& expr) const {
 
 inline bool
 Polyhedron::maximize(const Linear_Expression& expr,
-		     Coefficient& sup_n, Coefficient& sup_d,
-		     bool& maximum) const {
+                     Coefficient& sup_n, Coefficient& sup_d,
+                     bool& maximum) const {
   Generator g(point());
   return max_min(expr, true, sup_n, sup_d, maximum, g);
 }
 
 inline bool
 Polyhedron::maximize(const Linear_Expression& expr,
-		     Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		     Generator& g) const {
+                     Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                     Generator& g) const {
   return max_min(expr, true, sup_n, sup_d, maximum, g);
 }
 
 inline bool
 Polyhedron::minimize(const Linear_Expression& expr,
-		     Coefficient& inf_n, Coefficient& inf_d,
-		     bool& minimum) const {
+                     Coefficient& inf_n, Coefficient& inf_d,
+                     bool& minimum) const {
   Generator g(point());
   return max_min(expr, false, inf_n, inf_d, minimum, g);
 }
 
 inline bool
 Polyhedron::minimize(const Linear_Expression& expr,
-		     Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		     Generator& g) const {
+                     Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                     Generator& g) const {
   return max_min(expr, false, inf_n, inf_d, minimum, g);
 }
 
@@ -49550,8 +49620,8 @@ Polyhedron::add_recycled_congruences(Congruence_System& cgs) {
 template <typename FP_Format, typename Interval_Info>
 inline void
 Polyhedron::generalized_refine_with_linear_form_inequality(
-	    const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
-	    const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
+            const Linear_Form< Interval<FP_Format, Interval_Info> >& left,
+            const Linear_Form< Interval<FP_Format, Interval_Info> >& right,
             const Relation_Symbol relsym) {
   switch (relsym) {
   case EQUAL:
@@ -49609,13 +49679,13 @@ Polyhedron::strictly_contains(const Polyhedron& y) const {
 
 inline void
 Polyhedron::drop_some_non_integer_points(Complexity_Class complexity) {
-  const Variables_Set* p_vs = 0;
+  const Variables_Set* const p_vs = 0;
   drop_some_non_integer_points(p_vs, complexity);
 }
 
 inline void
 Polyhedron::drop_some_non_integer_points(const Variables_Set& vars,
-					 Complexity_Class complexity) {
+                                         Complexity_Class complexity) {
   drop_some_non_integer_points(&vars, complexity);
 }
 
@@ -49631,22 +49701,22 @@ is_necessarily_closed_for_interfaces(const Polyhedron& ph) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_templates.hh line 1. */
 /* Polyhedron class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_defs.hh line 1. */
 /* MIP_Problem class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Matrix.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Matrix_defs.hh line 1. */
 /* Matrix class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Matrix.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Matrix_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -49656,7 +49726,7 @@ class Matrix;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Matrix.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Matrix_defs.hh line 31. */
 #include <ostream>
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -50060,7 +50130,7 @@ bool operator!=(const Matrix<Row>& x, const Matrix<Row>& y);
 } // namespace Parma_Polyhedra_Library
 
 
-/* Automatically generated from PPL source file ../src/Matrix.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Matrix_inlines.hh line 1. */
 /* Matrix class implementation: inline functions.
 */
 
@@ -50238,7 +50308,7 @@ swap(Matrix<Row>& x, Matrix<Row>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Matrix.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Matrix_templates.hh line 1. */
 /* Matrix class implementation: non-inline template functions.
 */
 
@@ -50274,7 +50344,8 @@ Matrix<Row>::resize(dimension_type num_rows, dimension_type num_columns) {
       for (dimension_type i = 0; i < old_num_rows; ++i)
         rows[i].resize(num_columns);
     }
-  } else
+  }
+  else
     if (num_columns_ != num_columns) {
       num_columns_ = num_columns;
       for (dimension_type i = 0; i < num_rows; ++i)
@@ -50417,9 +50488,9 @@ operator!=(const Matrix<Row>& x, const Matrix<Row>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Matrix.defs.hh line 436. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Matrix_defs.hh line 436. */
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.defs.hh line 37. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_defs.hh line 37. */
 #include <vector>
 #include <deque>
 #include <iterator>
@@ -51014,12 +51085,7 @@ private:
   void add_constraint_helper(const Constraint& c);
 
   //! Processes the pending constraints of \p *this.
-  /*!
-    \return
-    <CODE>true</CODE> if and only if the MIP problem is satisfiable after
-    processing the pending constraints, <CODE>false</CODE> otherwise.
-  */
-  bool process_pending_constraints();
+  void process_pending_constraints();
 
   /*! \brief
     Optimizes the MIP problem using the second phase of the
@@ -51096,11 +51162,11 @@ private:
     that the variable is nonnegative.
   */
   bool parse_constraints(dimension_type& additional_tableau_rows,
-			 dimension_type& additional_slack_variables,
-			 std::deque<bool>& is_tableau_constraint,
-			 std::deque<bool>& is_satisfied_inequality,
-			 std::deque<bool>& is_nonnegative_variable,
-			 std::deque<bool>& is_remergeable_variable) const;
+                         dimension_type& additional_slack_variables,
+                         std::deque<bool>& is_tableau_constraint,
+                         std::deque<bool>& is_satisfied_inequality,
+                         std::deque<bool>& is_nonnegative_variable,
+                         std::deque<bool>& is_remergeable_variable) const;
 
   /*! \brief
     Computes the row index of the variable exiting the base
@@ -51264,7 +51330,7 @@ private:
                          dimension_type end_artificials);
 
   bool is_in_base(dimension_type var_index,
-		  dimension_type& row_index) const;
+                  dimension_type& row_index) const;
 
   /*! \brief
     Computes a valid generator that satisfies all the constraints of the
@@ -51360,12 +51426,12 @@ private:
                                         dimension_type& branching_index);
 };
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_inlines.hh line 1. */
 /* MIP_Problem class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_inlines.hh line 28. */
 #include <stdexcept>
 
 namespace Parma_Polyhedra_Library {
@@ -51400,9 +51466,8 @@ MIP_Problem::MIP_Problem(const MIP_Problem& y)
     last_generator(y.last_generator),
     i_variables(y.i_variables) {
   input_cs.reserve(y.input_cs.size());
-  for (Constraint_Sequence::const_iterator
-       i = y.input_cs.begin(), i_end = y.input_cs.end();
-       i != i_end; ++i)
+  for (Constraint_Sequence::const_iterator i = y.input_cs.begin(),
+         i_end = y.input_cs.end(); i != i_end; ++i)
     add_constraint_helper(*(*i));
   PPL_ASSERT(OK());
 }
@@ -51660,12 +51725,12 @@ swap(MIP_Problem& x, MIP_Problem& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_templates.hh line 1. */
 /* MIP_Problem class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.templates.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_templates.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -51819,16 +51884,16 @@ MIP_Problem::MIP_Problem(dimension_type dim,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/MIP_Problem.defs.hh line 979. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/MIP_Problem_defs.hh line 974. */
 
-/* Automatically generated from PPL source file ../src/Polyhedron.templates.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_templates.hh line 31. */
 // For static method overflows.
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Floating_Point_Expression class and its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -51838,14 +51903,13 @@ class Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_defs.hh line 31. */
 #include <cmath>
 #include <map>
 
 namespace Parma_Polyhedra_Library {
 
-/*! \brief
-  \ingroup PPL_CXX_Interface
+/*! \ingroup PPL_CXX_Interface \brief
   A floating point expression on a given format.
 
   This class represents a concrete <EM>floating point expression</EM>. This
@@ -51860,7 +51924,7 @@ namespace Parma_Polyhedra_Library {
   - The class template type parameter \p FP_Format represents the floating
   point format used in the concrete domain.
   This parameter must be a struct similar to the ones defined in file
-  Float.defs.hh, even though it is sufficient to define the three
+  Float_defs.hh, even though it is sufficient to define the three
   fields BASE, MANTISSA_BITS and EXPONENT_BIAS.
 */
 template <typename FP_Interval_Type, typename FP_Format>
@@ -52018,12 +52082,12 @@ FP_Interval_Type Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_inlines.hh line 1. */
 /* Floating_Point_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -52050,13 +52114,13 @@ Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_templates.hh line 1. */
 /* Floating_Point_Expression class implementation:
    non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.templates.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_templates.hh line 29. */
 #include <cmath>
 
 namespace Parma_Polyhedra_Library {
@@ -52139,9 +52203,9 @@ Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Floating_Point_Expression.defs.hh line 212. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Floating_Point_Expression_defs.hh line 211. */
 
-/* Automatically generated from PPL source file ../src/Polyhedron.templates.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_templates.hh line 33. */
 #include <algorithm>
 #include <deque>
 
@@ -52263,9 +52327,9 @@ Polyhedron::map_space_dimensions(const Partial_Function& pfunc) {
   if (pfunc.has_empty_codomain()) {
     // All dimensions vanish: the polyhedron becomes zero_dimensional.
     if (marked_empty()
-	|| (has_pending_constraints()
-	    && !remove_pending_to_obtain_generators())
-	|| (!generators_are_up_to_date() && !update_generators())) {
+        || (has_pending_constraints()
+            && !remove_pending_to_obtain_generators())
+        || (!generators_are_up_to_date() && !update_generators())) {
       // Removing all dimensions from the empty polyhedron.
       space_dim = 0;
       con_sys.clear();
@@ -52354,28 +52418,28 @@ Polyhedron::map_space_dimensions(const Partial_Function& pfunc) {
 
   Generator_System new_gensys;
   for (Generator_System::const_iterator i = old_gensys.begin(),
-	 old_gensys_end = old_gensys.end(); i != old_gensys_end; ++i) {
+         old_gensys_end = old_gensys.end(); i != old_gensys_end; ++i) {
     const Generator& old_g = *i;
-    const Generator::Expression& old_e = old_g.expression();
+    const Generator::expr_type old_e = old_g.expression();
     Linear_Expression expr;
     expr.set_space_dimension(new_space_dimension);
     bool all_zeroes = true;
-    for (Generator::Expression::const_iterator j = old_e.begin(),
+    for (Generator::expr_type::const_iterator j = old_e.begin(),
           j_end = old_e.end(); j != j_end; ++j) {
       const dimension_type mapped_id = pfunc_maps[j.variable().id()];
       if (mapped_id != not_a_dimension()) {
         add_mul_assign(expr, *j, Variable(mapped_id));
-	all_zeroes = false;
+        all_zeroes = false;
       }
     }
     switch (old_g.type()) {
     case Generator::LINE:
       if (!all_zeroes)
-	new_gensys.insert(line(expr));
+        new_gensys.insert(line(expr));
       break;
     case Generator::RAY:
       if (!all_zeroes)
-	new_gensys.insert(ray(expr));
+        new_gensys.insert(ray(expr));
       break;
     case Generator::POINT:
       // A point in the origin has all zero homogeneous coefficients.
@@ -52607,7 +52671,7 @@ Polyhedron::convert_to_integer_expression(
 template <typename FP_Format, typename Interval_Info>
 void
 Polyhedron::convert_to_integer_expressions(
-	        const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
+                const Linear_Form<Interval <FP_Format, Interval_Info> >& lf,
                 const dimension_type lf_dimension, Linear_Expression& res,
                 Coefficient& res_low_coeff, Coefficient& res_hi_coeff,
                 Coefficient& denominator) {
@@ -52669,8 +52733,8 @@ Polyhedron::convert_to_integer_expressions(
 template <typename C>
 void
 Polyhedron::throw_dimension_incompatible(const char* method,
-				         const char* lf_name,
-				         const Linear_Form<C>& lf) const {
+                                         const char* lf_name,
+                                         const Linear_Form<C>& lf) const {
   throw_dimension_incompatible(method, lf_name, lf.space_dimension());
 }
 
@@ -52688,7 +52752,7 @@ Polyhedron::check_obj_space_dimension_overflow(Input& input,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron_chdims.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_chdims_templates.hh line 1. */
 /* Polyhedron class implementation (non-inline template operators that
    may change the dimension of the vector space).
 */
@@ -52729,12 +52793,12 @@ Polyhedron::add_space_dimensions(Linear_System1& sys1,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron_conversion.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_conversion_templates.hh line 1. */
 /* Polyhedron class implementation: conversion().
 */
 
 
-/* Automatically generated from PPL source file ../src/Polyhedron_conversion.templates.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_conversion_templates.hh line 34. */
 
 #include <cstddef>
 #include <climits>
@@ -52802,7 +52866,7 @@ namespace Parma_Polyhedra_Library {
     C\vect{x} \geq \vect{0}
       \quad\iff\quad
         \exists \vect{\lambda} \geq \vect{0} \mathrel{.}
-	\vect{x} = G\vect{\lambda}.
+        \vect{x} = G\vect{\lambda}.
   \f]
 
   The term "double description" is quite natural in the sense that
@@ -52850,7 +52914,7 @@ namespace Parma_Polyhedra_Library {
     -# \f$
          \forall \vect{y}
            \mathrel{:} (A\vect{y} \geq 0 \implies
-	   \langle \vect{y},\vect{c} \rangle \geq 0)
+           \langle \vect{y},\vect{c} \rangle \geq 0)
        \f$;
     -# \f$
          \exists \vect{\lambda} \geq \vect{0}
@@ -53066,7 +53130,7 @@ Polyhedron::conversion(Source_Linear_System& source,
   const dimension_type source_space_dim = source.space_dimension();
   const dimension_type source_num_rows = source.num_rows();
   const dimension_type source_num_columns = source_space_dim
-    + (source.is_necessarily_closed() ? 1 : 2);
+    + (source.is_necessarily_closed() ? 1U : 2U);
 
 
   dimension_type dest_num_rows = dest.num_rows();
@@ -53115,12 +53179,12 @@ Polyhedron::conversion(Source_Linear_System& source,
     for ( ; index_non_zero < dest_num_rows; ++index_non_zero) {
       WEIGHT_BEGIN();
       Scalar_Products::assign(scalar_prod[index_non_zero],
-			      source_k,
-			      dest.sys.rows[index_non_zero]);
+                              source_k,
+                              dest.sys.rows[index_non_zero]);
       WEIGHT_ADD_MUL(17, source_space_dim);
       if (scalar_prod[index_non_zero] != 0)
-	// The generator does not saturate the constraint.
-	break;
+        // The generator does not saturate the constraint.
+        break;
       // Check if the client has requested abandoning all expensive
       // computations.  If so, the exception specified by the client
       // is thrown now.
@@ -53153,9 +53217,9 @@ Polyhedron::conversion(Source_Linear_System& source,
       // the constraint (namely, the ray whose scalar product
       // with the constraint gives a positive result).
       if (scalar_prod[index_non_zero] < 0) {
-	// The ray `dest_rows[index_non_zero]' lies on the wrong half-space:
-	// we change it to have the opposite direction.
-	neg_assign(scalar_prod[index_non_zero]);
+        // The ray `dest_rows[index_non_zero]' lies on the wrong half-space:
+        // we change it to have the opposite direction.
+        neg_assign(scalar_prod[index_non_zero]);
         neg_assign(dest.sys.rows[index_non_zero].expr);
         // The modified row may still not be OK(), so don't assert OK here.
         // They are all checked at the end of this function.
@@ -53168,7 +53232,7 @@ Polyhedron::conversion(Source_Linear_System& source,
       if (index_non_zero != num_lines_or_equalities) {
         swap(dest.sys.rows[index_non_zero],
              dest.sys.rows[num_lines_or_equalities]);
-	swap(scalar_prod[index_non_zero],
+        swap(scalar_prod[index_non_zero],
              scalar_prod[num_lines_or_equalities]);
       }
       const dest_row_type& dest_nle = dest.sys.rows[num_lines_or_equalities];
@@ -53191,34 +53255,34 @@ Polyhedron::conversion(Source_Linear_System& source,
       Coefficient& scalar_prod_nle = scalar_prod[num_lines_or_equalities];
       PPL_ASSERT(scalar_prod_nle != 0);
       for (dimension_type
-	     i = index_non_zero; i < num_lines_or_equalities; ++i) {
-	if (scalar_prod[i] != 0) {
-	  // The following fragment optimizes the computation of
-	  //
+             i = index_non_zero; i < num_lines_or_equalities; ++i) {
+        if (scalar_prod[i] != 0) {
+          // The following fragment optimizes the computation of
+          //
           // <CODE>
-	  //   Coefficient scale = scalar_prod[i];
-	  //   scale.gcd_assign(scalar_prod_nle);
-	  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
-	  //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
-	  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
-	  //     dest[i][c] *= normalized_sp_n;
-	  //     dest[i][c] -= normalized_sp_i * dest_nle[c];
-	  //   }
+          //   Coefficient scale = scalar_prod[i];
+          //   scale.gcd_assign(scalar_prod_nle);
+          //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
+          //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
+          //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
+          //     dest[i][c] *= normalized_sp_n;
+          //     dest[i][c] -= normalized_sp_i * dest_nle[c];
+          //   }
           // </CODE>
-	  normalize2(scalar_prod[i],
-		     scalar_prod_nle,
-		     normalized_sp_i,
-		     normalized_sp_o);
+          normalize2(scalar_prod[i],
+                     scalar_prod_nle,
+                     normalized_sp_i,
+                     normalized_sp_o);
           dest_row_type& dest_i = dest.sys.rows[i];
           neg_assign(normalized_sp_i);
           dest_i.expr.linear_combine(dest_nle.expr,
                                      normalized_sp_o, normalized_sp_i);
-	  dest_i.strong_normalize();
+          dest_i.strong_normalize();
           // The modified row may still not be OK(), so don't assert OK here.
           // They are all checked at the end of this function.
-	  scalar_prod[i] = 0;
-	  // dest_sorted has already been set to false.
-	}
+          scalar_prod[i] = 0;
+          // dest_sorted has already been set to false.
+        }
       }
 
       // Computing the new pointed cone.
@@ -53229,40 +53293,40 @@ Polyhedron::conversion(Source_Linear_System& source,
       // are positively combined with the ray `dest_nle' so that the
       // resulting new rays saturate the constraint.
       for (dimension_type
-	     i = num_lines_or_equalities + 1; i < dest_num_rows; ++i) {
-	if (scalar_prod[i] != 0) {
-	  // The following fragment optimizes the computation of
-	  //
+             i = num_lines_or_equalities + 1; i < dest_num_rows; ++i) {
+        if (scalar_prod[i] != 0) {
+          // The following fragment optimizes the computation of
+          //
           // <CODE>
-	  //   Coefficient scale = scalar_prod[i];
-	  //   scale.gcd_assign(scalar_prod_nle);
-	  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
-	  //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
-	  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
-	  //     dest[i][c] *= normalized_sp_n;
-	  //     dest[i][c] -= normalized_sp_i * dest_nle[c];
-	  //   }
+          //   Coefficient scale = scalar_prod[i];
+          //   scale.gcd_assign(scalar_prod_nle);
+          //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
+          //   Coefficient normalized_sp_n = scalar_prod_nle / scale;
+          //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
+          //     dest[i][c] *= normalized_sp_n;
+          //     dest[i][c] -= normalized_sp_i * dest_nle[c];
+          //   }
           // </CODE>
-	  normalize2(scalar_prod[i],
-		     scalar_prod_nle,
-		     normalized_sp_i,
-		     normalized_sp_o);
+          normalize2(scalar_prod[i],
+                     scalar_prod_nle,
+                     normalized_sp_i,
+                     normalized_sp_o);
           dest_row_type& dest_i = dest.sys.rows[i];
           WEIGHT_BEGIN();
           neg_assign(normalized_sp_i);
           dest_i.expr.linear_combine(dest_nle.expr,
                                      normalized_sp_o, normalized_sp_i);
-	  dest_i.strong_normalize();
+          dest_i.strong_normalize();
           // The modified row may still not be OK(), so don't assert OK here.
           // They are all checked at the end of this function.
-	  scalar_prod[i] = 0;
-	  // `dest_sorted' has already been set to false.
+          scalar_prod[i] = 0;
+          // `dest_sorted' has already been set to false.
           WEIGHT_ADD_MUL(41, source_space_dim);
-	}
+        }
         // Check if the client has requested abandoning all expensive
         // computations.  If so, the exception specified by the client
         // is thrown now.
-	maybe_abandon();
+        maybe_abandon();
       }
       // Since the `scalar_prod_nle' is positive (by construction), it
       // does not saturate the constraint `source_k'.  Therefore, if
@@ -53270,12 +53334,12 @@ Polyhedron::conversion(Source_Linear_System& source,
       // corresponding element of `sat' ...
       Bit_Row& sat_nle = sat[num_lines_or_equalities];
       if (source_k.is_ray_or_point_or_inequality())
-	sat_nle.set(k - redundant_source_rows.size());
+        sat_nle.set(k - redundant_source_rows.size());
       // ... otherwise, the constraint is an equality which is
       // violated by the generator `dest_nle': the generator has to be
       // removed from `dest_rows'.
       else {
-	--dest_num_rows;
+        --dest_num_rows;
         swap(dest.sys.rows[num_lines_or_equalities],
              dest.sys.rows[dest_num_rows]);
         recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
@@ -53283,9 +53347,9 @@ Polyhedron::conversion(Source_Linear_System& source,
         dest.sys.rows.pop_back();
         PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
 
-	swap(scalar_prod_nle, scalar_prod[dest_num_rows]);
-	swap(sat_nle, sat[dest_num_rows]);
-	// dest_sorted has already been set to false.
+        swap(scalar_prod_nle, scalar_prod[dest_num_rows]);
+        swap(sat_nle, sat[dest_num_rows]);
+        // dest_sorted has already been set to false.
       }
     }
     // Here we have `index_non_zero' >= `num_lines_or_equalities',
@@ -53308,46 +53372,47 @@ Polyhedron::conversion(Source_Linear_System& source,
       // While we find saturating generators, we simply increment
       // `lines_or_equal_bound'.
       while (inf_bound > lines_or_equal_bound
-	     && scalar_prod[lines_or_equal_bound] == 0)
-	++lines_or_equal_bound;
+             && scalar_prod[lines_or_equal_bound] == 0)
+        ++lines_or_equal_bound;
       dimension_type sup_bound = lines_or_equal_bound;
       while (inf_bound > sup_bound) {
-	const int sp_sign = sgn(scalar_prod[sup_bound]);
-	if (sp_sign == 0) {
-	  // This generator has to be moved in Q=.
-	  swap(dest.sys.rows[sup_bound], dest.sys.rows[lines_or_equal_bound]);
-	  swap(scalar_prod[sup_bound], scalar_prod[lines_or_equal_bound]);
-	  swap(sat[sup_bound], sat[lines_or_equal_bound]);
-	  ++lines_or_equal_bound;
-	  ++sup_bound;
+        const int sp_sign = sgn(scalar_prod[sup_bound]);
+        if (sp_sign == 0) {
+          // This generator has to be moved in Q=.
+          swap(dest.sys.rows[sup_bound], dest.sys.rows[lines_or_equal_bound]);
+          swap(scalar_prod[sup_bound], scalar_prod[lines_or_equal_bound]);
+          swap(sat[sup_bound], sat[lines_or_equal_bound]);
+          ++lines_or_equal_bound;
+          ++sup_bound;
           dest_sorted = false;
-	}
-	else if (sp_sign < 0) {
-	  // This generator has to be moved in Q-.
-	  --inf_bound;
+        }
+        else if (sp_sign < 0) {
+          // This generator has to be moved in Q-.
+          --inf_bound;
           swap(dest.sys.rows[sup_bound], dest.sys.rows[inf_bound]);
-	  swap(sat[sup_bound], sat[inf_bound]);
-	  swap(scalar_prod[sup_bound], scalar_prod[inf_bound]);
+          swap(sat[sup_bound], sat[inf_bound]);
+          swap(scalar_prod[sup_bound], scalar_prod[inf_bound]);
           dest_sorted = false;
-	}
-	else
-	  // sp_sign > 0: this generator has to be moved in Q+.
-	  ++sup_bound;
+        }
+        else
+          // sp_sign > 0: this generator has to be moved in Q+.
+          ++sup_bound;
       }
 
       if (sup_bound == dest_num_rows) {
-	// Here the set Q- is empty.
-	// If the constraint is an inequality, then all the generators
-	// in Q= and Q+ satisfy the constraint. The constraint is redundant
-	// and it can be safely removed from the constraint system.
-	// This is why the `source' parameter is not declared `const'.
-	if (source_k.is_ray_or_point_or_inequality()) {
+        // Here the set Q- is empty.
+        // If the constraint is an inequality, then all the generators
+        // in Q= and Q+ satisfy the constraint. The constraint is redundant
+        // and it can be safely removed from the constraint system.
+        // This is why the `source' parameter is not declared `const'.
+        if (source_k.is_ray_or_point_or_inequality()) {
           redundant_source_rows.push_back(k);
-	} else {
-	  // The constraint is an equality, so that all the generators
-	  // in Q+ violate it. Since the set Q- is empty, we can simply
-	  // remove from `dest_rows' all the generators of Q+.
-	  PPL_ASSERT(dest_num_rows >= lines_or_equal_bound);
+        }
+        else {
+          // The constraint is an equality, so that all the generators
+          // in Q+ violate it. Since the set Q- is empty, we can simply
+          // remove from `dest_rows' all the generators of Q+.
+          PPL_ASSERT(dest_num_rows >= lines_or_equal_bound);
           while (dest_num_rows != lines_or_equal_bound) {
             recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
             swap(dest.sys.rows.back(), recyclable_dest_rows.back());
@@ -53358,13 +53423,13 @@ Polyhedron::conversion(Source_Linear_System& source,
         }
       }
       else {
-	// The set Q- is not empty, i.e., at least one generator
-	// violates the constraint `source_k'.
-	// We have to further distinguish two cases:
-	if (sup_bound == num_lines_or_equalities) {
-	  // The set Q+ is empty, so that all generators that satisfy
-	  // the constraint also saturate it.
-	  // We can simply remove from `dest_rows' all the generators in Q-.
+        // The set Q- is not empty, i.e., at least one generator
+        // violates the constraint `source_k'.
+        // We have to further distinguish two cases:
+        if (sup_bound == num_lines_or_equalities) {
+          // The set Q+ is empty, so that all generators that satisfy
+          // the constraint also saturate it.
+          // We can simply remove from `dest_rows' all the generators in Q-.
           PPL_ASSERT(dest_num_rows >= sup_bound);
           while (dest_num_rows != sup_bound) {
             recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
@@ -53373,111 +53438,112 @@ Polyhedron::conversion(Source_Linear_System& source,
             --dest_num_rows;
           }
           PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
-        } else {
-	  // The sets Q+ and Q- are both non-empty.
-	  // The generators of the new pointed cone are all those satisfying
-	  // the constraint `source_k' plus a set of new rays enjoying
-	  // the following properties:
-	  // -# they lie on the hyper-plane represented by the constraint
-	  // -# they are obtained as a positive combination of two
-	  //    adjacent rays, the first taken from Q+ and the second
-	  //    taken from Q-.
-
-	  // The adjacency property is necessary to have an irredundant
-	  // set of new rays (see proposition 2).
-	  const dimension_type bound = dest_num_rows;
-
-	  // In the following loop,
-	  // `i' runs through the generators in the set Q+ and
-	  // `j' runs through the generators in the set Q-.
-	  for (dimension_type i = lines_or_equal_bound; i < sup_bound; ++i) {
-	    for(dimension_type j = sup_bound; j < bound; ++j) {
-	      // Checking if generators `dest_rows[i]' and `dest_rows[j]' are
+        }
+        else {
+          // The sets Q+ and Q- are both non-empty.
+          // The generators of the new pointed cone are all those satisfying
+          // the constraint `source_k' plus a set of new rays enjoying
+          // the following properties:
+          // -# they lie on the hyper-plane represented by the constraint
+          // -# they are obtained as a positive combination of two
+          //    adjacent rays, the first taken from Q+ and the second
+          //    taken from Q-.
+
+          // The adjacency property is necessary to have an irredundant
+          // set of new rays (see proposition 2).
+          const dimension_type bound = dest_num_rows;
+
+          // In the following loop,
+          // `i' runs through the generators in the set Q+ and
+          // `j' runs through the generators in the set Q-.
+          for (dimension_type i = lines_or_equal_bound; i < sup_bound; ++i) {
+            for(dimension_type j = sup_bound; j < bound; ++j) {
+              // Checking if generators `dest_rows[i]' and `dest_rows[j]' are
               // adjacent.
-	      // If there exist another generator that saturates
-	      // all the constraints saturated by both `dest_rows[i]' and
-	      // `dest_rows[j]', then they are NOT adjacent.
-	      PPL_ASSERT(sat[i].last() == C_Integer<unsigned long>::max
+              // If there exist another generator that saturates
+              // all the constraints saturated by both `dest_rows[i]' and
+              // `dest_rows[j]', then they are NOT adjacent.
+              PPL_ASSERT(sat[i].last() == C_Integer<unsigned long>::max
                          || sat[i].last() < k);
-	      PPL_ASSERT(sat[j].last() == C_Integer<unsigned long>::max
+              PPL_ASSERT(sat[j].last() == C_Integer<unsigned long>::max
                          || sat[j].last() < k);
 
-	      // Being the union of `sat[i]' and `sat[j]',
-	      // `new_satrow' corresponds to a ray that saturates all the
-	      // constraints saturated by both `dest_rows[i]' and
+              // Being the union of `sat[i]' and `sat[j]',
+              // `new_satrow' corresponds to a ray that saturates all the
+              // constraints saturated by both `dest_rows[i]' and
               // `dest_rows[j]'.
-	      Bit_Row new_satrow(sat[i], sat[j]);
+              Bit_Row new_satrow(sat[i], sat[j]);
 
-	      // Compute the number of common saturators.
-	      // NOTE: this number has to be less than `k' because
-	      // we are treating the `k'-th constraint.
-	      const dimension_type num_common_satur
+              // Compute the number of common saturators.
+              // NOTE: this number has to be less than `k' because
+              // we are treating the `k'-th constraint.
+              const dimension_type num_common_satur
                 = k - redundant_source_rows.size() - new_satrow.count_ones();
 
-	      // Even before actually creating the new ray as a
-	      // positive combination of `dest_rows[i]' and `dest_rows[j]',
-	      // we exploit saturation information to check if
-	      // it can be an extremal ray. To this end, we refer
-	      // to the definition of a minimal proper face
-	      // (see comments in Polyhedron.defs.hh):
-	      // an extremal ray saturates at least `n' - `t' - 1
-	      // constraints, where `n' is the dimension of the space
-	      // and `t' is the dimension of the lineality space.
-	      // Since `n == source_num_columns - 1' and
-	      // `t == num_lines_or_equalities', we obtain that
-	      // an extremal ray saturates at least
-	      // `source_num_columns - num_lines_or_equalities - 2'
-	      // constraints.
-	      if (num_common_satur
-		  >= source_num_columns - num_lines_or_equalities - 2) {
-		// The minimal proper face rule is satisfied.
-		// Now we actually check for redundancy by computing
-		// adjacency information.
-		bool redundant = false;
-		WEIGHT_BEGIN();
-		for (dimension_type
-		       l = num_lines_or_equalities; l < bound; ++l)
-		  if (l != i && l != j
-		      && subset_or_equal(sat[l], new_satrow)) {
-		    // Found another generator saturating all the
-		    // constraints saturated by both `dest_rows[i]' and
+              // Even before actually creating the new ray as a
+              // positive combination of `dest_rows[i]' and `dest_rows[j]',
+              // we exploit saturation information to check if
+              // it can be an extremal ray. To this end, we refer
+              // to the definition of a minimal proper face
+              // (see comments in Polyhedron_defs.hh):
+              // an extremal ray saturates at least `n' - `t' - 1
+              // constraints, where `n' is the dimension of the space
+              // and `t' is the dimension of the lineality space.
+              // Since `n == source_num_columns - 1' and
+              // `t == num_lines_or_equalities', we obtain that
+              // an extremal ray saturates at least
+              // `source_num_columns - num_lines_or_equalities - 2'
+              // constraints.
+              if (num_common_satur
+                  >= source_num_columns - num_lines_or_equalities - 2) {
+                // The minimal proper face rule is satisfied.
+                // Now we actually check for redundancy by computing
+                // adjacency information.
+                bool redundant = false;
+                WEIGHT_BEGIN();
+                for (dimension_type
+                       l = num_lines_or_equalities; l < bound; ++l)
+                  if (l != i && l != j
+                      && subset_or_equal(sat[l], new_satrow)) {
+                    // Found another generator saturating all the
+                    // constraints saturated by both `dest_rows[i]' and
                     // `dest_rows[j]'.
-		    redundant = true;
-		    break;
-		  }
+                    redundant = true;
+                    break;
+                  }
                 PPL_ASSERT(bound >= num_lines_or_equalities);
                 WEIGHT_ADD_MUL(15, bound - num_lines_or_equalities);
-		if (!redundant) {
-		  // Adding the new ray to `dest_rows' and the corresponding
-		  // saturation row to `sat'.
-		  dest_row_type new_row;
-		  if (recyclable_dest_rows.empty()) {
-		    sat.add_recycled_row(new_satrow);
-		  }
-		  else {
+                if (!redundant) {
+                  // Adding the new ray to `dest_rows' and the corresponding
+                  // saturation row to `sat'.
+                  dest_row_type new_row;
+                  if (recyclable_dest_rows.empty()) {
+                    sat.add_recycled_row(new_satrow);
+                  }
+                  else {
                     swap(new_row, recyclable_dest_rows.back());
                     recyclable_dest_rows.pop_back();
                     new_row.set_space_dimension_no_ok(source_space_dim);
                     swap(sat[dest_num_rows], new_satrow);
                   }
 
-		  // The following fragment optimizes the computation of
-		  //
+                  // The following fragment optimizes the computation of
+                  //
                   // <CODE>
-		  //   Coefficient scale = scalar_prod[i];
-		  //   scale.gcd_assign(scalar_prod[j]);
-		  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
-		  //   Coefficient normalized_sp_j = scalar_prod[j] / scale;
-		  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
-		  //     new_row[c] = normalized_sp_i * dest[j][c];
-		  //     new_row[c] -= normalized_sp_j * dest[i][c];
-		  //   }
+                  //   Coefficient scale = scalar_prod[i];
+                  //   scale.gcd_assign(scalar_prod[j]);
+                  //   Coefficient normalized_sp_i = scalar_prod[i] / scale;
+                  //   Coefficient normalized_sp_j = scalar_prod[j] / scale;
+                  //   for (dimension_type c = dest_num_columns; c-- > 0; ) {
+                  //     new_row[c] = normalized_sp_i * dest[j][c];
+                  //     new_row[c] -= normalized_sp_j * dest[i][c];
+                  //   }
                   // </CODE>
-		  normalize2(scalar_prod[i],
-			     scalar_prod[j],
-			     normalized_sp_i,
-			     normalized_sp_o);
-		  WEIGHT_BEGIN();
+                  normalize2(scalar_prod[i],
+                             scalar_prod[j],
+                             normalized_sp_i,
+                             normalized_sp_o);
+                  WEIGHT_BEGIN();
 
                   neg_assign(normalized_sp_o);
                   new_row = dest.sys.rows[j];
@@ -53488,74 +53554,74 @@ Polyhedron::conversion(Source_Linear_System& source,
                                               normalized_sp_i, normalized_sp_o);
 
                   WEIGHT_ADD_MUL(86, source_space_dim);
-		  new_row.strong_normalize();
+                  new_row.strong_normalize();
                   // Don't assert new_row.OK() here, because it may fail if
                   // the parameter `dest' contained a row that wasn't ok.
-		  // Since we added a new generator to `dest_rows',
-		  // we also add a new element to `scalar_prod';
-		  // by construction, the new ray lies on the hyper-plane
-		  // represented by the constraint `source_k'.
-		  // Thus, the added scalar product is 0.
-		  PPL_ASSERT(scalar_prod.size() >= dest_num_rows);
-		  if (scalar_prod.size() <= dest_num_rows)
-		    scalar_prod.push_back(Coefficient_zero());
-		  else
-		    scalar_prod[dest_num_rows] = Coefficient_zero();
+                  // Since we added a new generator to `dest_rows',
+                  // we also add a new element to `scalar_prod';
+                  // by construction, the new ray lies on the hyper-plane
+                  // represented by the constraint `source_k'.
+                  // Thus, the added scalar product is 0.
+                  PPL_ASSERT(scalar_prod.size() >= dest_num_rows);
+                  if (scalar_prod.size() <= dest_num_rows)
+                    scalar_prod.push_back(Coefficient_zero());
+                  else
+                    scalar_prod[dest_num_rows] = Coefficient_zero();
 
                   dest.sys.rows.resize(dest.sys.rows.size() + 1);
                   swap(dest.sys.rows.back(), new_row);
-		  // Increment the number of generators.
-		  ++dest_num_rows;
-		} // if (!redundant)
-	      }
-	    }
+                  // Increment the number of generators.
+                  ++dest_num_rows;
+                } // if (!redundant)
+              }
+            }
             // Check if the client has requested abandoning all expensive
             // computations.  If so, the exception specified by the client
             // is thrown now.
-	    maybe_abandon();
-	  }
-	  // Now we substitute the rays in Q- (i.e., the rays violating
-	  // the constraint) with the newly added rays.
-	  dimension_type j;
-	  if (source_k.is_ray_or_point_or_inequality()) {
-	    // The constraint is an inequality:
-	    // the violating generators are those in Q-.
-	    j = sup_bound;
-	    // For all the generators in Q+, set to 1 the corresponding
-	    // entry for the constraint `source_k' in the saturation matrix.
+            maybe_abandon();
+          }
+          // Now we substitute the rays in Q- (i.e., the rays violating
+          // the constraint) with the newly added rays.
+          dimension_type j;
+          if (source_k.is_ray_or_point_or_inequality()) {
+            // The constraint is an inequality:
+            // the violating generators are those in Q-.
+            j = sup_bound;
+            // For all the generators in Q+, set to 1 the corresponding
+            // entry for the constraint `source_k' in the saturation matrix.
 
             // After the removal of redundant rows in `source', the k-th
             // row will have index `new_k'.
             const dimension_type new_k = k - redundant_source_rows.size();
             for (dimension_type l = lines_or_equal_bound; l < sup_bound; ++l)
               sat[l].set(new_k);
-	  }
-	  else
-	    // The constraint is an equality:
-	    // the violating generators are those in the union of Q+ and Q-.
-	    j = lines_or_equal_bound;
-
-	  // Swapping the newly added rays
-	  // (index `i' running through `dest_num_rows - 1' down-to `bound')
-	  // with the generators violating the constraint
-	  // (index `j' running through `j' up-to `bound - 1').
-	  dimension_type i = dest_num_rows;
-	  while (j < bound && i > bound) {
-	    --i;
+          }
+          else
+            // The constraint is an equality:
+            // the violating generators are those in the union of Q+ and Q-.
+            j = lines_or_equal_bound;
+
+          // Swapping the newly added rays
+          // (index `i' running through `dest_num_rows - 1' down-to `bound')
+          // with the generators violating the constraint
+          // (index `j' running through `j' up-to `bound - 1').
+          dimension_type i = dest_num_rows;
+          while (j < bound && i > bound) {
+            --i;
             swap(dest.sys.rows[i], dest.sys.rows[j]);
-	    swap(scalar_prod[i], scalar_prod[j]);
-	    swap(sat[i], sat[j]);
-	    ++j;
-	    dest_sorted = false;
-	  }
-	  // Setting the number of generators in `dest':
-	  // - if the number of generators violating the constraint
-	  //   is less than or equal to the number of the newly added
-	  //   generators, we assign `i' to `dest_num_rows' because
-	  //   all generators above this index are significant;
-	  // - otherwise, we assign `j' to `dest_num_rows' because
-	  //   all generators below index `j-1' violates the constraint.
-          dimension_type new_num_rows = (j == bound) ? i : j;
+            swap(scalar_prod[i], scalar_prod[j]);
+            swap(sat[i], sat[j]);
+            ++j;
+            dest_sorted = false;
+          }
+          // Setting the number of generators in `dest':
+          // - if the number of generators violating the constraint
+          //   is less than or equal to the number of the newly added
+          //   generators, we assign `i' to `dest_num_rows' because
+          //   all generators above this index are significant;
+          // - otherwise, we assign `j' to `dest_num_rows' because
+          //   all generators below index `j-1' violates the constraint.
+          const dimension_type new_num_rows = (j == bound) ? i : j;
           PPL_ASSERT(dest_num_rows >= new_num_rows);
           while (dest_num_rows != new_num_rows) {
             recyclable_dest_rows.resize(recyclable_dest_rows.size() + 1);
@@ -53564,7 +53630,7 @@ Polyhedron::conversion(Source_Linear_System& source,
             --dest_num_rows;
           }
           PPL_ASSERT(dest_num_rows == dest.sys.rows.size());
-	}
+        }
       }
     }
   }
@@ -53600,8 +53666,8 @@ Polyhedron::conversion(Source_Linear_System& source,
     // pending generators.
     for (dimension_type i = dest_first_pending_row; i < dest_num_rows; ++i)
       if (compare(dest.sys.rows[i - 1], dest.sys.rows[i]) > 0) {
-	dest_sorted = false;
-	break;
+        dest_sorted = false;
+        break;
       }
 
 #ifndef NDEBUG
@@ -53620,12 +53686,12 @@ Polyhedron::conversion(Source_Linear_System& source,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron_minimize.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_minimize_templates.hh line 1. */
 /* Polyhedron class implementation: minimize() and add_and_minimize().
 */
 
 
-/* Automatically generated from PPL source file ../src/Polyhedron_minimize.templates.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_minimize_templates.hh line 29. */
 #include <stdexcept>
 
 namespace Parma_Polyhedra_Library {
@@ -53744,7 +53810,7 @@ Polyhedron::minimize(const bool con_to_gen,
   // and the 5th parameter (representing the number of lines in `dest'),
   // by construction, is equal to `dest_num_rows'.
   const dimension_type num_lines_or_equalities
-    = conversion(source, 0, dest, tmp_sat, dest_num_rows);
+    = conversion(source, 0U, dest, tmp_sat, dest_num_rows);
   // conversion() may have modified the number of rows in `dest'.
   dest_num_rows = dest.num_rows();
 
@@ -53766,7 +53832,8 @@ Polyhedron::minimize(const bool con_to_gen,
         ++first_point)
       if (dest[first_point].expr.inhomogeneous_term() > 0)
         break;
-  } else {
+  }
+  else {
     for (first_point = num_lines_or_equalities;
         first_point < dest_num_rows;
         ++first_point)
@@ -53971,8 +54038,8 @@ Polyhedron::add_and_minimize(const bool con_to_gen,
   // Parameter `start' is set to the index of the first pending constraint.
   const dimension_type num_lines_or_equalities
     = conversion(source, source.first_pending_row(),
-		 dest, sat,
-		 dest.num_lines_or_equalities());
+                 dest, sat,
+                 dest.num_lines_or_equalities());
 
   // conversion() may have modified the number of rows in `dest'.
   const dimension_type dest_num_rows = dest.num_rows();
@@ -53990,7 +54057,8 @@ Polyhedron::add_and_minimize(const bool con_to_gen,
         ++first_point)
       if (dest[first_point].expr.inhomogeneous_term() > 0)
         break;
-  } else {
+  }
+  else {
     for (first_point = num_lines_or_equalities;
         first_point < dest_num_rows;
         ++first_point)
@@ -54032,12 +54100,12 @@ Polyhedron::add_and_minimize(const bool con_to_gen,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron_simplify.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_simplify_templates.hh line 1. */
 /* Polyhedron class implementation: simplify().
 */
 
 
-/* Automatically generated from PPL source file ../src/Polyhedron_simplify.templates.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_simplify_templates.hh line 29. */
 #include <cstddef>
 #include <limits>
 
@@ -54105,7 +54173,7 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
   // Looking for the first inequality in `sys'.
   dimension_type num_lines_or_equalities = 0;
   while (num_lines_or_equalities < num_rows
-	 && sys[num_lines_or_equalities].is_line_or_equality())
+         && sys[num_lines_or_equalities].is_line_or_equality())
     ++num_lines_or_equalities;
 
   // `num_saturators[i]' will contain the number of generators
@@ -54120,7 +54188,7 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
     simplify_num_saturators_p = new dimension_type[new_size];
     simplify_num_saturators_size = new_size;
   }
-  dimension_type* num_saturators = simplify_num_saturators_p;
+  dimension_type* const num_saturators = simplify_num_saturators_p;
 
   bool sys_sorted = sys.is_sorted();
 
@@ -54139,8 +54207,8 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
       // so that system `sys_rows' keeps its partial sortedness.
       if (i != num_lines_or_equalities) {
         sys.sys.rows[i].m_swap(sys.sys.rows[num_lines_or_equalities]);
-	swap(sat[i], sat[num_lines_or_equalities]);
-	swap(num_saturators[i], num_saturators[num_lines_or_equalities]);
+        swap(sat[i], sat[num_lines_or_equalities]);
+        swap(num_saturators[i], num_saturators[num_lines_or_equalities]);
       }
       ++num_lines_or_equalities;
       // `sys' is no longer sorted.
@@ -54180,10 +54248,10 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
     // redundant equalities or because we have moved all the
     // inequalities.
     for (dimension_type redundant = rank,
-	   erasing = num_rows;
-	 redundant < num_lines_or_equalities
-	   && erasing > num_lines_or_equalities;
-	 ) {
+           erasing = num_rows;
+         redundant < num_lines_or_equalities
+           && erasing > num_lines_or_equalities;
+         ) {
       --erasing;
       sys.remove_row(redundant);
       swap(sat[redundant], sat[erasing]);
@@ -54268,44 +54336,44 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
     // sat[k])'.
     for (dimension_type j = num_lines_or_equalities; j < num_rows; ) {
       if (i == j)
-	// We want to compare different rows of `sys'.
-	++j;
+        // We want to compare different rows of `sys'.
+        ++j;
       else {
-	// Let us recall that each generator lies on a facet of the
-	// polyhedron (see the Introduction).
-	// Given two constraints `c_1' and `c_2', if there are `m'
-	// generators lying on the hyper-plane corresponding to `c_1',
-	// the same `m' generators lie on the hyper-plane
-	// corresponding to `c_2', too, and there is another one lying
-	// on the latter but not on the former, then `c_2' is more
-	// restrictive than `c_1', i.e., `c_1' is redundant.
-	bool strict_subset;
-	if (subset_or_equal(sat[j], sat[i], strict_subset))
-	  if (strict_subset) {
-	    // All the saturators of the inequality `sys[i]' are
-	    // saturators of the inequality `sys[j]' too,
-	    // and there exists at least one saturator of `sys[j]'
-	    // which is not a saturator of `sys[i]'.
-	    // It follows that inequality `sys[i]' is redundant.
-	    redundant = true;
-	    break;
-	  }
-	  else {
-	    // We have `sat[j] == sat[i]'.  Hence inequalities
-	    // `sys[i]' and `sys[j]' are saturated by the same set of
-	    // generators. Then we can remove either one of the two
-	    // inequalities: we remove `sys[j]'.
-	    --num_rows;
+        // Let us recall that each generator lies on a facet of the
+        // polyhedron (see the Introduction).
+        // Given two constraints `c_1' and `c_2', if there are `m'
+        // generators lying on the hyper-plane corresponding to `c_1',
+        // the same `m' generators lie on the hyper-plane
+        // corresponding to `c_2', too, and there is another one lying
+        // on the latter but not on the former, then `c_2' is more
+        // restrictive than `c_1', i.e., `c_1' is redundant.
+        bool strict_subset;
+        if (subset_or_equal(sat[j], sat[i], strict_subset))
+          if (strict_subset) {
+            // All the saturators of the inequality `sys[i]' are
+            // saturators of the inequality `sys[j]' too,
+            // and there exists at least one saturator of `sys[j]'
+            // which is not a saturator of `sys[i]'.
+            // It follows that inequality `sys[i]' is redundant.
+            redundant = true;
+            break;
+          }
+          else {
+            // We have `sat[j] == sat[i]'.  Hence inequalities
+            // `sys[i]' and `sys[j]' are saturated by the same set of
+            // generators. Then we can remove either one of the two
+            // inequalities: we remove `sys[j]'.
+            --num_rows;
             sys.remove_row(j);
             PPL_ASSERT(sys.num_rows() == num_rows);
-	    swap(sat[j], sat[num_rows]);
-	    swap(num_saturators[j], num_saturators[num_rows]);
-	  }
-	else
-	  // If we reach this point then we know that `sat[i]' does
-	  // not contain (and is different from) `sat[j]', so that
-	  // `sys[i]' is not made redundant by inequality `sys[j]'.
-	  ++j;
+            swap(sat[j], sat[num_rows]);
+            swap(num_saturators[j], num_saturators[num_rows]);
+          }
+        else
+          // If we reach this point then we know that `sat[i]' does
+          // not contain (and is different from) `sat[j]', so that
+          // `sys[i]' is not made redundant by inequality `sys[j]'.
+          ++j;
       }
     }
     if (redundant) {
@@ -54349,21 +54417,21 @@ Polyhedron::simplify(Linear_System1& sys, Bit_Matrix& sat) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Polyhedron.defs.hh line 2842. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Polyhedron_defs.hh line 2842. */
 
-/* Automatically generated from PPL source file ../src/Grid.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_defs.hh line 1. */
 /* Grid class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid_Generator_System.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_System_defs.hh line 1. */
 /* Grid_Generator_System class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid_Generator_System.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_System_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Grid_Generator_System.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_System_defs.hh line 33. */
 #include <iosfwd>
 
 namespace Parma_Polyhedra_Library {
@@ -54387,7 +54455,7 @@ void swap(Grid_Generator_System& x, Grid_Generator_System& y);
 //! Returns <CODE>true</CODE> if and only if \p x and \p y are identical.
 /*! \relates Grid_Generator_System */
 bool operator==(const Grid_Generator_System& x,
-		const Grid_Generator_System& y);
+                const Grid_Generator_System& y);
 
 } // namespace Parma_Polyhedra_Library
 
@@ -54610,10 +54678,10 @@ public:
   */
   class const_iterator
     : public std::iterator<std::forward_iterator_tag,
-			   Grid_Generator,
-			   ptrdiff_t,
-			   const Grid_Generator*,
-			   const Grid_Generator&> {
+                           Grid_Generator,
+                           ptrdiff_t,
+                           const Grid_Generator*,
+                           const Grid_Generator&> {
   public:
     //! Default constructor.
     const_iterator();
@@ -54843,14 +54911,14 @@ private:
   friend class Grid;
 };
 
-// Grid_Generator_System.inlines.hh is not included here on purpose.
+// Grid_Generator_System_inlines.hh is not included here on purpose.
 
-/* Automatically generated from PPL source file ../src/Grid_Generator_System.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_System_inlines.hh line 1. */
 /* Grid_Generator_System class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid_Generator_System.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Generator_System_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -55090,7 +55158,7 @@ Grid_Generator_System::first_pending_row() const {
 /*! \relates Grid_Generator_System */
 inline bool
 operator==(const Grid_Generator_System& x,
-	   const Grid_Generator_System& y) {
+           const Grid_Generator_System& y) {
   return x.is_equal_to(y);
 }
 
@@ -55102,7 +55170,7 @@ swap(Grid_Generator_System& x, Grid_Generator_System& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid_Certificate.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Certificate_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -55111,7 +55179,7 @@ class Grid_Certificate;
 
 }
 
-/* Automatically generated from PPL source file ../src/Grid.defs.hh line 47. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_defs.hh line 47. */
 #include <vector>
 #include <iosfwd>
 
@@ -55461,7 +55529,7 @@ public:
     dimension.
   */
   explicit Grid(dimension_type num_dimensions = 0,
-		Degenerate_Element kind = UNIVERSE);
+                Degenerate_Element kind = UNIVERSE);
 
   //! Builds a grid, copying a system of congruences.
   /*!
@@ -55830,7 +55898,7 @@ public:
     maximum are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -55864,8 +55932,8 @@ public:
     and \p point are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& point) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& point) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -55895,7 +55963,7 @@ public:
     and \p minimum are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -55929,8 +55997,8 @@ public:
     and \p point are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& point) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& point) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -56283,14 +56351,14 @@ public:
        is different from zero.
     -# If the transformation is invertible, then we can write
        \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
-	   = a_\mathrm{var} x_\mathrm{var}
-	     + \sum_{i \neq var} a_i x_i + b,
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
+           = a_\mathrm{var} x_\mathrm{var}
+             + \sum_{i \neq var} a_i x_i + b,
        \f]
        so that the inverse transformation is
        \f[
-	 a_\mathrm{var} x_\mathrm{var}
+         a_\mathrm{var} x_\mathrm{var}
            = \mathrm{denominator} * {x'}_\mathrm{var}
              - \sum_{i \neq j} a_i x_i - b.
        \f]
@@ -56302,9 +56370,9 @@ public:
     \endif
   */
   void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		    = Coefficient_one());
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                    = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the \ref Grid_Affine_Transformation
@@ -56347,14 +56415,14 @@ public:
        is different from zero.
     -# If the transformation is invertible, then we can write
        \f[
-  	 \mathrm{denominator} * {x'}_\mathrm{var}
-	   = \sum_{i = 0}^{n - 1} a_i x_i + b
+         \mathrm{denominator} * {x'}_\mathrm{var}
+           = \sum_{i = 0}^{n - 1} a_i x_i + b
            = a_\mathrm{var} x_\mathrm{var}
                + \sum_{i \neq \mathrm{var}} a_i x_i + b,
        \f],
        the inverse transformation is
        \f[
-	 a_\mathrm{var} x_\mathrm{var}
+         a_\mathrm{var} x_\mathrm{var}
            = \mathrm{denominator} * {x'}_\mathrm{var}
                - \sum_{i \neq j} a_i x_i - b.
        \f].
@@ -56366,9 +56434,9 @@ public:
     \endif
   */
   void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to
@@ -56402,12 +56470,12 @@ public:
   */
   void
   generalized_affine_image(Variable var,
-			   Relation_Symbol relsym,
-			   const Linear_Expression& expr,
-			   Coefficient_traits::const_reference denominator
-			   = Coefficient_one(),
-			   Coefficient_traits::const_reference modulus
-			   = Coefficient_zero());
+                           Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator
+                           = Coefficient_one(),
+                           Coefficient_traits::const_reference modulus
+                           = Coefficient_zero());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -56441,12 +56509,12 @@ public:
   */
   void
   generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one(),
-			      Coefficient_traits::const_reference modulus
-			      = Coefficient_zero());
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one(),
+                              Coefficient_traits::const_reference modulus
+                              = Coefficient_zero());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to
@@ -56474,10 +56542,10 @@ public:
   */
   void
   generalized_affine_image(const Linear_Expression& lhs,
-			   Relation_Symbol relsym,
-			   const Linear_Expression& rhs,
-			   Coefficient_traits::const_reference modulus
-			   = Coefficient_zero());
+                           Relation_Symbol relsym,
+                           const Linear_Expression& rhs,
+                           Coefficient_traits::const_reference modulus
+                           = Coefficient_zero());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -56505,10 +56573,10 @@ public:
   */
   void
   generalized_affine_preimage(const Linear_Expression& lhs,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& rhs,
-			      Coefficient_traits::const_reference modulus
-			      = Coefficient_zero());
+                              Relation_Symbol relsym,
+                              const Linear_Expression& rhs,
+                              Coefficient_traits::const_reference modulus
+                              = Coefficient_zero());
 
   /*!
     \brief
@@ -56537,10 +56605,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
 
   /*!
     \brief
@@ -56569,10 +56637,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the result of computing the \ref Grid_Time_Elapse
@@ -56742,8 +56810,8 @@ public:
     Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
   */
   void limited_congruence_extrapolation_assign(const Grid& y,
-					       const Congruence_System& cgs,
-					       unsigned* tp = NULL);
+                                               const Congruence_System& cgs,
+                                               unsigned* tp = NULL);
 
   /*! \brief
     Improves the result of the generator variant of the
@@ -56766,8 +56834,8 @@ public:
     Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
   */
   void limited_generator_extrapolation_assign(const Grid& y,
-					      const Congruence_System& cgs,
-					      unsigned* tp = NULL);
+                                              const Congruence_System& cgs,
+                                              unsigned* tp = NULL);
 
   /*! \brief
     Improves the result of the \ref Grid_Widening "Grid widening"
@@ -56789,8 +56857,8 @@ public:
     Thrown if \p *this, \p y and \p cgs are dimension-incompatible.
   */
   void limited_extrapolation_assign(const Grid& y,
-				    const Congruence_System& cgs,
-				    unsigned* tp = NULL);
+                                    const Congruence_System& cgs,
+                                    unsigned* tp = NULL);
 
   //@} // Space Dimension Preserving Member Functions that May Modify [...]
 
@@ -57041,13 +57109,13 @@ private:
   Grid_Generator_System gen_sys;
 
 #define PPL_IN_Grid_CLASS
-/* Automatically generated from PPL source file ../src/Grid_Status.idefs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Status_idefs.hh line 1. */
 /* Grid::Status class declaration.
 */
 
 
 #ifndef PPL_IN_Grid_CLASS
-#error "Do not include Grid_Status.idefs.hh directly; use Grid.defs.hh instead"
+#error "Do not include Grid_Status_idefs.hh directly; use Grid_defs.hh instead"
 #endif
 
 //! A conjunctive assertion about a grid.
@@ -57187,7 +57255,7 @@ private:
   void reset(flags_t mask);
 };
 
-/* Automatically generated from PPL source file ../src/Grid.defs.hh line 1977. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_defs.hh line 1977. */
 #undef PPL_IN_Grid_CLASS
 
   //! The status flags to keep track of the grid's internal state.
@@ -57418,9 +57486,9 @@ private:
     \p included and \p point are left untouched.
   */
   bool max_min(const Linear_Expression& expr,
-	       const char* method_call,
-	       Coefficient& ext_n, Coefficient& ext_d, bool& included,
-	       Generator* point = NULL) const;
+               const char* method_call,
+               Coefficient& ext_n, Coefficient& ext_d, bool& included,
+               Generator* point = NULL) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -57455,8 +57523,8 @@ private:
     empty, then the behavior is undefined.
   */
   bool frequency_no_check(const Linear_Expression& expr,
-		Coefficient& freq_n, Coefficient& freq_d,
-		Coefficient& val_n, Coefficient& val_d) const;
+                Coefficient& freq_n, Coefficient& freq_d,
+                Coefficient& val_n, Coefficient& val_d) const;
 
   //! Checks if and how \p expr is bounded in \p *this.
   /*!
@@ -57513,7 +57581,7 @@ private:
 
   //! Copies a widened selection of congruences from \p y to \p selected_cgs.
   void select_wider_congruences(const Grid& y,
-				Congruence_System& selected_cgs) const;
+                                Congruence_System& selected_cgs) const;
 
   //! Copies widened generators from \p y to \p widened_ggs.
   void select_wider_generators(const Grid& y,
@@ -57536,8 +57604,8 @@ private:
     <CODE>add_space_dimensions_and_embed()</CODE>.
   */
   void add_space_dimensions(Congruence_System& cgs,
-			    Grid_Generator_System& gs,
-			    dimension_type dims);
+                            Grid_Generator_System& gs,
+                            dimension_type dims);
 
   //! Adds new space dimensions to the given systems.
   /*!
@@ -57554,8 +57622,8 @@ private:
     <CODE>add_space_dimensions_and_project()</CODE>.
   */
   void add_space_dimensions(Grid_Generator_System& gs,
-			    Congruence_System& cgs,
-			    dimension_type dims);
+                            Congruence_System& cgs,
+                            dimension_type dims);
 
   //! \name Minimization-related Static Member Functions
   //@{
@@ -57580,8 +57648,8 @@ private:
   */
   static void
   normalize_divisors(Grid_Generator_System& sys,
-		     Coefficient& divisor,
-		     const Grid_Generator* first_point = NULL);
+                     Coefficient& divisor,
+                     const Grid_Generator* first_point = NULL);
 
   //! Normalizes the divisors in \p sys.
   /*!
@@ -57613,23 +57681,23 @@ private:
     Thrown if all rows in \p gen_sys are lines and/or parameters.
   */
   static void normalize_divisors(Grid_Generator_System& sys,
-				 Grid_Generator_System& gen_sys);
+                                 Grid_Generator_System& gen_sys);
 
   /*! \brief
     Converts generator system \p dest to be equivalent to congruence
     system \p source.
   */
   static void conversion(Congruence_System& source,
-			 Grid_Generator_System& dest,
-			 Dimension_Kinds& dim_kinds);
+                         Grid_Generator_System& dest,
+                         Dimension_Kinds& dim_kinds);
 
   /*! \brief
     Converts congruence system \p dest to be equivalent to generator
     system \p source.
   */
   static void conversion(Grid_Generator_System& source,
-			 Congruence_System& dest,
-			 Dimension_Kinds& dim_kinds);
+                         Congruence_System& dest,
+                         Dimension_Kinds& dim_kinds);
 
   //! Converts \p cgs to upper triangular (i.e. minimized) form.
   /*!
@@ -57637,14 +57705,14 @@ private:
     otherwise returns <CODE>false</CODE>.
   */
   static bool simplify(Congruence_System& cgs,
-		       Dimension_Kinds& dim_kinds);
+                       Dimension_Kinds& dim_kinds);
 
   //! Converts \p gs to lower triangular (i.e. minimized) form.
   /*!
     Expects \p gs to contain at least one point.
   */
   static void simplify(Grid_Generator_System& ggs,
-		       Dimension_Kinds& dim_kinds);
+                       Dimension_Kinds& dim_kinds);
 
   //! Reduces the line \p row using the line \p pivot.
   /*!
@@ -57653,8 +57721,8 @@ private:
   */
   // A member of Grid for access to Matrix<Dense_Row>::rows.
   static void reduce_line_with_line(Grid_Generator& row,
-				    Grid_Generator& pivot,
-				    dimension_type column);
+                                    Grid_Generator& pivot,
+                                    dimension_type column);
 
   //! Reduces the equality \p row using the equality \p pivot.
   /*!
@@ -57664,8 +57732,8 @@ private:
   */
   // A member of Grid for access to Matrix<Dense_Row>::rows.
   static void reduce_equality_with_equality(Congruence& row,
-					    const Congruence& pivot,
-					    dimension_type column);
+                                            const Congruence& pivot,
+                                            dimension_type column);
 
   //! Reduces \p row using \p pivot.
   /*!
@@ -57682,10 +57750,10 @@ private:
   // Part of Grid for access to Matrix<Dense_Row>::rows.
   template <typename R>
   static void reduce_pc_with_pc(R& row,
-				R& pivot,
-				dimension_type column,
-				dimension_type start,
-				dimension_type end);
+                                R& pivot,
+                                dimension_type column,
+                                dimension_type start,
+                                dimension_type end);
 
   //! Reduce \p row using \p pivot.
   /*!
@@ -57698,9 +57766,9 @@ private:
   // NOTE: This may invalidate `row' and the rows in `sys'. Client code must
   // fix/check this.
   static void reduce_parameter_with_line(Grid_Generator& row,
-					 const Grid_Generator& pivot,
-					 dimension_type column,
-					 Swapping_Vector<Grid_Generator>& sys,
+                                         const Grid_Generator& pivot,
+                                         dimension_type column,
+                                         Swapping_Vector<Grid_Generator>& sys,
                                          dimension_type num_columns);
 
   //! Reduce \p row using \p pivot.
@@ -57713,9 +57781,9 @@ private:
   // This takes a parameter with type Swapping_Vector<Congruence> (instead of
   // Congruence_System) to simplify the implementation of `conversion()'.
   static void reduce_congruence_with_equality(Congruence& row,
-					      const Congruence& pivot,
-					      dimension_type column,
-					      Swapping_Vector<Congruence>& sys);
+                                              const Congruence& pivot,
+                                              dimension_type column,
+                                              Swapping_Vector<Congruence>& sys);
 
   //! Reduce column \p dim in rows preceding \p pivot_index in \p sys.
   /*!
@@ -57757,19 +57825,19 @@ private:
   // fix/check this.
   static void reduce_reduced(Swapping_Vector<typename M::row_type>& sys,
                              dimension_type dim,
-			     dimension_type pivot_index,
-			     dimension_type start, dimension_type end,
-			     const Dimension_Kinds& sys_dim_kinds,
-			     bool generators = true);
+                             dimension_type pivot_index,
+                             dimension_type start, dimension_type end,
+                             const Dimension_Kinds& sys_dim_kinds,
+                             bool generators = true);
 
   //! Multiply the elements of \p dest by \p multiplier.
   // A member of Grid for access to Matrix<Dense_Row>::rows and cgs::operator[].
   // The type of `dest' is Swapping_Vector<Congruence> instead of
   // Congruence_System to simplify the implementation of conversion().
   static void multiply_grid(const Coefficient& multiplier,
-			    Congruence& cg,
+                            Congruence& cg,
                             Swapping_Vector<Congruence>& dest,
-			    dimension_type num_rows);
+                            dimension_type num_rows);
 
   //! Multiply the elements of \p dest by \p multiplier.
   // A member of Grid for access to Grid_Generator::operator[].
@@ -57778,23 +57846,23 @@ private:
   // NOTE: This does not check whether the rows are OK(). Client code
   // should do that.
   static void multiply_grid(const Coefficient& multiplier,
-			    Grid_Generator& gen,
-			    Swapping_Vector<Grid_Generator>& dest,
-			    dimension_type num_rows);
+                            Grid_Generator& gen,
+                            Swapping_Vector<Grid_Generator>& dest,
+                            dimension_type num_rows);
 
   /*! \brief
     If \p sys is lower triangular return <CODE>true</CODE>, else
     return <CODE>false</CODE>.
   */
   static bool lower_triangular(const Congruence_System& sys,
-			       const Dimension_Kinds& dim_kinds);
+                               const Dimension_Kinds& dim_kinds);
 
   /*! \brief
     If \p sys is upper triangular return <CODE>true</CODE>, else
     return <CODE>false</CODE>.
   */
   static bool upper_triangular(const Grid_Generator_System& sys,
-			       const Dimension_Kinds& dim_kinds);
+                               const Dimension_Kinds& dim_kinds);
 
 #ifndef NDEBUG
   //! Checks that trailing rows contain only zero terms.
@@ -57808,9 +57876,9 @@ private:
   */
   template <typename M, typename R>
   static bool rows_are_zero(M& system,
-			    dimension_type first,
-			    dimension_type last,
-			    dimension_type row_size);
+                            dimension_type first,
+                            dimension_type last,
+                            dimension_type row_size);
 #endif
 
   //@} // Minimization-Related Static Member Functions
@@ -57821,40 +57889,40 @@ private:
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 protected:
   void throw_dimension_incompatible(const char* method,
-				    const char* other_name,
-				    dimension_type other_dim) const;
+                                    const char* other_name,
+                                    dimension_type other_dim) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* gr_name,
-				    const Grid& gr) const;
+                                    const char* gr_name,
+                                    const Grid& gr) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* le_name,
-				    const Linear_Expression& le) const;
+                                    const char* le_name,
+                                    const Linear_Expression& le) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* cg_name,
-				    const Congruence& cg) const;
+                                    const char* cg_name,
+                                    const Congruence& cg) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* c_name,
-				    const Constraint& c) const;
+                                    const char* c_name,
+                                    const Constraint& c) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* g_name,
-				    const Grid_Generator& g) const;
+                                    const char* g_name,
+                                    const Grid_Generator& g) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* g_name,
-				    const Generator& g) const;
+                                    const char* g_name,
+                                    const Generator& g) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* cgs_name,
-				    const Congruence_System& cgs) const;
+                                    const char* cgs_name,
+                                    const Congruence_System& cgs) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* cs_name,
-				    const Constraint_System& cs) const;
+                                    const char* cs_name,
+                                    const Constraint_System& cs) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* gs_name,
-				    const Grid_Generator_System& gs) const;
+                                    const char* gs_name,
+                                    const Grid_Generator_System& gs) const;
   void throw_dimension_incompatible(const char* method,
-				    const char* var_name,
-				    Variable var) const;
+                                    const char* var_name,
+                                    Variable var) const;
   void throw_dimension_incompatible(const char* method,
-				    dimension_type required_space_dim) const;
+                                    dimension_type required_space_dim) const;
 
   static void throw_invalid_argument(const char* method,
                                      const char* reason);
@@ -57872,7 +57940,7 @@ protected:
 
 };
 
-/* Automatically generated from PPL source file ../src/Grid_Status.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Status_inlines.hh line 1. */
 /* Grid::Status class implementation: inline functions.
 */
 
@@ -58067,12 +58135,12 @@ Grid::Status::set_sat_g_up_to_date() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_inlines.hh line 1. */
 /* Grid class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid.inlines.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_inlines.hh line 30. */
 #include <algorithm>
 
 namespace Parma_Polyhedra_Library {
@@ -58158,15 +58226,15 @@ Grid::max_space_dimension() {
   // One dimension is reserved to have a value of type dimension_type
   // that does not represent a legal dimension.
   return std::min(std::numeric_limits<dimension_type>::max() - 1,
-		  std::min(Congruence_System::max_space_dimension(),
-			   Grid_Generator_System::max_space_dimension()
-			   )
-		  );
+                  std::min(Congruence_System::max_space_dimension(),
+                           Grid_Generator_System::max_space_dimension()
+                           )
+                  );
 }
 
 inline
 Grid::Grid(dimension_type num_dimensions,
-	   const Degenerate_Element kind)
+           const Degenerate_Element kind)
   : con_sys(),
     gen_sys(check_space_dimension_overflow(num_dimensions,
                                            max_space_dimension(),
@@ -58371,27 +58439,27 @@ Grid::bounds_from_below(const Linear_Expression& expr) const {
 
 inline bool
 Grid::maximize(const Linear_Expression& expr,
-	       Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const {
+               Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const {
   return max_min(expr, "maximize(e, ...)", sup_n, sup_d, maximum);
 }
 
 inline bool
 Grid::maximize(const Linear_Expression& expr,
-	       Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-	       Generator& point) const {
+               Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+               Generator& point) const {
   return max_min(expr, "maximize(e, ...)", sup_n, sup_d, maximum, &point);
 }
 
 inline bool
 Grid::minimize(const Linear_Expression& expr,
-	       Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const {
+               Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const {
   return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum);
 }
 
 inline bool
 Grid::minimize(const Linear_Expression& expr,
-	       Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-	       Generator& point) const {
+               Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+               Generator& point) const {
   return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum, &point);
 }
 
@@ -58426,12 +58494,12 @@ swap(Grid& x, Grid& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_templates.hh line 1. */
 /* Grid class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid.templates.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_templates.hh line 30. */
 #include <algorithm>
 #include <deque>
 
@@ -58473,37 +58541,37 @@ Grid::Grid(const Box<Interval>& box, Complexity_Class)
       bool closed = false;
       // TODO: Consider producing the system(s) in minimized form.
       if (box.has_lower_bound(v_k, l_n, l_d, closed)) {
-	if (box.has_upper_bound(v_k, u_n, u_d, closed))
-	  if (l_n * u_d == u_n * l_d) {
-	    // A point interval sets dimension k of every point to a
-	    // single value.
-	    con_sys.insert(l_d * v_k == l_n);
+        if (box.has_upper_bound(v_k, u_n, u_d, closed))
+          if (l_n * u_d == u_n * l_d) {
+            // A point interval sets dimension k of every point to a
+            // single value.
+            con_sys.insert(l_d * v_k == l_n);
 
             // This is declared here because it may be invalidated
             // by the call to gen_sys.insert() at the end of the loop.
             Grid_Generator& point = gen_sys.sys.rows[0];
 
-	    // Scale the point to use as divisor the lcm of the
-	    // divisors of the existing point and the lower bound.
-	    const Coefficient& point_divisor = point.divisor();
-	    gcd_assign(u_n, l_d, point_divisor);
-	    // `u_n' now holds the gcd.
-	    exact_div_assign(u_n, point_divisor, u_n);
-	    if (l_d < 0)
-	      neg_assign(u_n);
-	    // l_d * u_n == abs(l_d * (point_divisor / gcd(l_d, point_divisor)))
-	    point.scale_to_divisor(l_d * u_n);
-	    // Set dimension k of the point to the lower bound.
-	    if (l_d < 0)
-	      neg_assign(u_n);
-	    // point[k + 1] = l_n * point_divisor / gcd(l_d, point_divisor)
-	    point.expr.set(Variable(k), l_n * u_n);
+            // Scale the point to use as divisor the lcm of the
+            // divisors of the existing point and the lower bound.
+            const Coefficient& point_divisor = point.divisor();
+            gcd_assign(u_n, l_d, point_divisor);
+            // `u_n' now holds the gcd.
+            exact_div_assign(u_n, point_divisor, u_n);
+            if (l_d < 0)
+              neg_assign(u_n);
+            // l_d * u_n == abs(l_d * (point_divisor / gcd(l_d, point_divisor)))
+            point.scale_to_divisor(l_d * u_n);
+            // Set dimension k of the point to the lower bound.
+            if (l_d < 0)
+              neg_assign(u_n);
+            // point[k + 1] = l_n * point_divisor / gcd(l_d, point_divisor)
+            point.expr.set(Variable(k), l_n * u_n);
             PPL_ASSERT(point.OK());
 
             PPL_ASSERT(gen_sys.sys.OK());
 
-	    continue;
-	  }
+            continue;
+          }
       }
       // A universe interval allows any value in dimension k.
       gen_sys.insert(grid_line(v_k));
@@ -58524,7 +58592,7 @@ Grid::map_space_dimensions(const Partial_Function& pfunc) {
   if (pfunc.has_empty_codomain()) {
     // All dimensions vanish: the grid becomes zero_dimensional.
     if (marked_empty()
-	|| (!generators_are_up_to_date() && !update_generators())) {
+        || (!generators_are_up_to_date() && !update_generators())) {
       // Removing all dimensions from the empty grid.
       space_dim = 0;
       set_empty();
@@ -58553,23 +58621,23 @@ Grid::map_space_dimensions(const Partial_Function& pfunc) {
 
     for (dimension_type i = space_dim; i-- > 0; ) {
       if (!visited[i]) {
-	dimension_type j = i;
-	do {
-	  visited[j] = true;
-	  // The following initialization is only to make the compiler happy.
-	  dimension_type k = 0;
-	  if (!pfunc.maps(j, k))
-	    throw_invalid_argument("map_space_dimensions(pfunc)",
-				   " pfunc is inconsistent");
-	  if (k == j)
-	    break;
-
-	  cycle.push_back(Variable(j));
-	  // Go along the cycle.
-	  j = k;
-	} while (!visited[j]);
-
-	// End of cycle.
+        dimension_type j = i;
+        do {
+          visited[j] = true;
+          // The following initialization is only to make the compiler happy.
+          dimension_type k = 0;
+          if (!pfunc.maps(j, k))
+            throw_invalid_argument("map_space_dimensions(pfunc)",
+                                   " pfunc is inconsistent");
+          if (k == j)
+            break;
+
+          cycle.push_back(Variable(j));
+          // Go along the cycle.
+          j = k;
+        } while (!visited[j]);
+
+        // End of cycle.
 
         // Avoid calling clear_*_minimized() if cycle.size() is less than 2,
         // to improve efficiency.
@@ -58628,26 +58696,26 @@ Grid::map_space_dimensions(const Partial_Function& pfunc) {
   const Coefficient& system_divisor = i->divisor();
   for (i = old_gensys.begin(); i != old_gensys_end; ++i) {
     const Grid_Generator& old_g = *i;
-    const Grid_Generator::Expression& old_g_e = old_g.expression();
+    const Grid_Generator::expr_type old_g_e = old_g.expression();
     Linear_Expression expr;
     expr.set_space_dimension(new_space_dimension);
     bool all_zeroes = true;
-    for (Grid_Generator::Expression::const_iterator j = old_g_e.begin(),
+    for (Grid_Generator::expr_type::const_iterator j = old_g_e.begin(),
           j_end = old_g_e.end(); j != j_end; ++j) {
       const dimension_type mapped_id = pfunc_maps[j.variable().id()];
       if (mapped_id != not_a_dimension()) {
         add_mul_assign(expr, *j, Variable(mapped_id));
-	all_zeroes = false;
+        all_zeroes = false;
       }
     }
     switch (old_g.type()) {
     case Grid_Generator::LINE:
       if (!all_zeroes)
-	new_gensys.insert(grid_line(expr));
+        new_gensys.insert(grid_line(expr));
       break;
     case Grid_Generator::PARAMETER:
       if (!all_zeroes)
-	new_gensys.insert(parameter(expr, system_divisor));
+        new_gensys.insert(parameter(expr, system_divisor));
       break;
     case Grid_Generator::POINT:
       new_gensys.insert(grid_point(expr, old_g.divisor()));
@@ -58666,12 +58734,12 @@ Grid::map_space_dimensions(const Partial_Function& pfunc) {
 template <typename M>
 void
 Grid::reduce_reduced(Swapping_Vector<typename M::row_type>& rows,
-		     const dimension_type dim,
-		     const dimension_type pivot_index,
-		     const dimension_type start,
-		     const dimension_type end,
-		     const Dimension_Kinds& sys_dim_kinds,
-		     const bool generators) {
+                     const dimension_type dim,
+                     const dimension_type pivot_index,
+                     const dimension_type start,
+                     const dimension_type end,
+                     const Dimension_Kinds& sys_dim_kinds,
+                     const bool generators) {
   // TODO: Remove this.
   typedef typename M::row_type M_row_type;
 
@@ -58706,8 +58774,8 @@ Grid::reduce_reduced(Swapping_Vector<typename M::row_type>& rows,
 
     // row_kind CONGRUENCE is included as PARAMETER
     if (row_is_line_or_equality
-	|| (row_kind == PARAMETER
-	    && sys_dim_kinds[kinds_index] == PARAMETER)) {
+        || (row_kind == PARAMETER
+            && sys_dim_kinds[kinds_index] == PARAMETER)) {
       M_row_type& row = rows[row_index];
 
       const Coefficient& row_dim = row.expr.get(dim);
@@ -58720,11 +58788,11 @@ Grid::reduce_reduced(Swapping_Vector<typename M::row_type>& rows,
       // -5 < row_dim <= 5.
       row_dim_remainder = row_dim % pivot_dim;
       if (row_dim_remainder < 0) {
-	if (row_dim_remainder <= -pivot_dim_half)
-	  --num_rows_to_subtract;
+        if (row_dim_remainder <= -pivot_dim_half)
+          --num_rows_to_subtract;
       }
       else if (row_dim_remainder > 0 && row_dim_remainder > pivot_dim_half)
-	++num_rows_to_subtract;
+        ++num_rows_to_subtract;
 
       // Subtract num_rows_to_subtract copies of pivot from row i.  Only the
       // entries from dim need to be subtracted, as the preceding
@@ -58741,19 +58809,19 @@ Grid::reduce_reduced(Swapping_Vector<typename M::row_type>& rows,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid.defs.hh line 2664. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_defs.hh line 2664. */
 
-/* Automatically generated from PPL source file ../src/BD_Shape.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_defs.hh line 1. */
 /* BD_Shape class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_defs.hh line 1. */
 /* DB_Matrix class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -58763,12 +58831,12 @@ class DB_Matrix;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/DB_Row.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_defs.hh line 1. */
 /* DB_Row class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/DB_Row.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -58781,12 +58849,12 @@ class DB_Row;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Ptr_Iterator.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ptr_Iterator_defs.hh line 1. */
 /* Ptr_Iterator class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Ptr_Iterator.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ptr_Iterator_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -58800,7 +58868,7 @@ class Ptr_Iterator;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Ptr_Iterator.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ptr_Iterator_defs.hh line 28. */
 #include <iterator>
 
 namespace Parma_Polyhedra_Library {
@@ -58831,7 +58899,7 @@ operator-(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y);
 
 template<typename P>
 Ptr_Iterator<P> operator+(typename Ptr_Iterator<P>::difference_type m,
-			  const Ptr_Iterator<P>& y);
+                          const Ptr_Iterator<P>& y);
 
 } // namespace Implementation
 
@@ -58843,10 +58911,10 @@ Ptr_Iterator<P> operator+(typename Ptr_Iterator<P>::difference_type m,
 template <typename P>
 class Parma_Polyhedra_Library::Implementation::Ptr_Iterator
   : public std::iterator<typename std::iterator_traits<P>::iterator_category,
-			 typename std::iterator_traits<P>::value_type,
-			 typename std::iterator_traits<P>::difference_type,
-			 typename std::iterator_traits<P>::pointer,
-			 typename std::iterator_traits<P>::reference> {
+                         typename std::iterator_traits<P>::value_type,
+                         typename std::iterator_traits<P>::difference_type,
+                         typename std::iterator_traits<P>::pointer,
+                         typename std::iterator_traits<P>::reference> {
 public:
   typedef typename std::iterator_traits<P>::difference_type difference_type;
   typedef typename std::iterator_traits<P>::reference reference;
@@ -58940,16 +59008,16 @@ private:
   friend Ptr_Iterator<P>
   Parma_Polyhedra_Library::Implementation::
   operator+<>(typename Ptr_Iterator<P>::difference_type m,
-	      const Ptr_Iterator<P>& y);
+              const Ptr_Iterator<P>& y);
 };
 
-/* Automatically generated from PPL source file ../src/Ptr_Iterator.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ptr_Iterator_inlines.hh line 1. */
 /* Ptr_Iterator class implementation: inline functions.
 */
 
 
 #include <algorithm>
-/* Automatically generated from PPL source file ../src/Ptr_Iterator.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ptr_Iterator_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -59102,7 +59170,7 @@ operator-(const Ptr_Iterator<P>& x, const Ptr_Iterator<Q>& y) {
 template<typename P>
 inline Ptr_Iterator<P>
 operator+(typename Ptr_Iterator<P>::difference_type m,
-	  const Ptr_Iterator<P>& y) {
+          const Ptr_Iterator<P>& y) {
   return Ptr_Iterator<P>(m + y.base());
 }
 
@@ -59110,9 +59178,9 @@ operator+(typename Ptr_Iterator<P>::difference_type m,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Ptr_Iterator.defs.hh line 171. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Ptr_Iterator_defs.hh line 171. */
 
-/* Automatically generated from PPL source file ../src/DB_Row.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_defs.hh line 30. */
 #include <cstddef>
 #include <vector>
 
@@ -59244,7 +59312,7 @@ public:
   */
   template <typename U>
   void construct_upward_approximation(const DB_Row<U>& y,
-				      dimension_type capacity);
+                                      dimension_type capacity);
 
   //@}
 
@@ -59406,7 +59474,7 @@ void swap(DB_Row<T>& x, DB_Row<T>& y);
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename T>
 void iter_swap(typename std::vector<DB_Row<T> >::iterator x,
-	       typename std::vector<DB_Row<T> >::iterator y);
+               typename std::vector<DB_Row<T> >::iterator y);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! \name Classical comparison operators.
@@ -59534,9 +59602,9 @@ private:
   //! The vector of coefficients.
   T vec_[
 #if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-         0
+          0
 #else
-         1
+          1
 #endif
   ];
 
@@ -59550,12 +59618,12 @@ private:
   void copy_construct(const Impl& y);
 };
 
-/* Automatically generated from PPL source file ../src/DB_Row.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_inlines.hh line 1. */
 /* DB_Row class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/DB_Row.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_inlines.hh line 29. */
 #include <cstddef>
 #include <limits>
 #include <algorithm>
@@ -59566,7 +59634,7 @@ namespace Parma_Polyhedra_Library {
 template <typename T>
 inline void*
 DB_Row_Impl_Handler<T>::Impl::operator new(const size_t fixed_size,
-					   const dimension_type capacity) {
+                                           const dimension_type capacity) {
 #if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
   return ::operator new(fixed_size + capacity*sizeof(T));
 #else
@@ -59703,9 +59771,9 @@ template <typename T>
 inline void
 DB_Row<T>::allocate(
 #if PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
-	       const
+               const
 #endif
-	       dimension_type capacity) {
+               dimension_type capacity) {
   DB_Row<T>& x = *this;
   PPL_ASSERT(capacity <= max_size());
 #if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
@@ -59746,7 +59814,7 @@ template <typename T>
 template <typename U>
 inline void
 DB_Row<T>::construct_upward_approximation(const DB_Row<U>& y,
-					  const dimension_type capacity) {
+                                          const dimension_type capacity) {
   DB_Row<T>& x = *this;
   PPL_ASSERT(y.size() <= capacity && capacity <= max_size());
   allocate(capacity);
@@ -59757,7 +59825,7 @@ DB_Row<T>::construct_upward_approximation(const DB_Row<U>& y,
 template <typename T>
 inline void
 DB_Row<T>::construct(const dimension_type sz,
-		     const dimension_type capacity) {
+                     const dimension_type capacity) {
   PPL_ASSERT(sz <= capacity && capacity <= max_size());
   allocate(capacity);
   expand_within_capacity(sz);
@@ -59772,7 +59840,7 @@ DB_Row<T>::construct(const dimension_type sz) {
 template <typename T>
 inline
 DB_Row<T>::DB_Row(const dimension_type sz,
-		  const dimension_type capacity)
+                  const dimension_type capacity)
   : DB_Row_Impl_Handler<T>() {
   construct(sz, capacity);
 }
@@ -59796,7 +59864,7 @@ DB_Row<T>::DB_Row(const DB_Row& y)
 template <typename T>
 inline
 DB_Row<T>::DB_Row(const DB_Row& y,
-		  const	dimension_type capacity)
+                  const dimension_type capacity)
   : DB_Row_Impl_Handler<T>() {
   PPL_ASSERT(y.impl);
   PPL_ASSERT(y.size() <= capacity && capacity <= max_size());
@@ -59807,8 +59875,8 @@ DB_Row<T>::DB_Row(const DB_Row& y,
 template <typename T>
 inline
 DB_Row<T>::DB_Row(const DB_Row& y,
-		  const dimension_type sz,
-		  const	dimension_type capacity)
+                  const dimension_type sz,
+                  const dimension_type capacity)
   : DB_Row_Impl_Handler<T>() {
   PPL_ASSERT(y.impl);
   PPL_ASSERT(y.size() <= sz && sz <= capacity && capacity <= max_size());
@@ -59949,18 +60017,18 @@ swap(DB_Row<T>& x, DB_Row<T>& y) {
 template <typename T>
 inline void
 iter_swap(typename std::vector<DB_Row<T> >::iterator x,
-	  typename std::vector<DB_Row<T> >::iterator y) {
+          typename std::vector<DB_Row<T> >::iterator y) {
   swap(*x, *y);
 }
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/DB_Row.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_templates.hh line 1. */
 /* DB_Row class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/DB_Row.templates.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_templates.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -60060,11 +60128,11 @@ DB_Row_Impl_Handler<T>::Impl::external_memory_in_bytes() const {
 template <typename T>
 bool
 DB_Row<T>::OK(const dimension_type row_size,
-	      const dimension_type
+              const dimension_type
 #if PPL_DB_ROW_EXTRA_DEBUG
-	      row_capacity
+              row_capacity
 #endif
-	      ) const {
+              ) const {
 #ifndef NDEBUG
   using std::endl;
   using std::cerr;
@@ -60077,7 +60145,7 @@ DB_Row<T>::OK(const dimension_type row_size,
 # if !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
   if (x.capacity_ == 0) {
     cerr << "Illegal row capacity: is 0, should be at least 1"
-	 << endl;
+         << endl;
     is_broken = true;
   }
   else if (x.capacity_ == 1 && row_capacity == 0)
@@ -60087,8 +60155,8 @@ DB_Row<T>::OK(const dimension_type row_size,
 # endif // !PPL_CXX_SUPPORTS_ZERO_LENGTH_ARRAYS
   if (x.capacity_ != row_capacity) {
     cerr << "DB_Row capacity mismatch: is " << x.capacity_
-	 << ", should be " << row_capacity << "."
-	 << endl;
+         << ", should be " << row_capacity << "."
+         << endl;
     is_broken = true;
   }
 #endif // PPL_DB_ROW_EXTRA_DEBUG
@@ -60096,8 +60164,8 @@ DB_Row<T>::OK(const dimension_type row_size,
   if (x.size() != row_size) {
 #ifndef NDEBUG
     cerr << "DB_Row size mismatch: is " << x.size()
-	 << ", should be " << row_size << "."
-	 << endl;
+         << ", should be " << row_size << "."
+         << endl;
 #endif
     is_broken = true;
   }
@@ -60106,8 +60174,8 @@ DB_Row<T>::OK(const dimension_type row_size,
   if (x.capacity_ < x.size()) {
 #ifndef NDEBUG
     cerr << "DB_Row is completely broken: capacity is " << x.capacity_
-	 << ", size is " << x.size() << "."
-	 << endl;
+         << ", size is " << x.size() << "."
+         << endl;
 #endif
     is_broken = true;
   }
@@ -60124,7 +60192,7 @@ DB_Row<T>::OK(const dimension_type row_size,
     if (is_not_a_number(element)) {
 #ifndef NDEBUG
       cerr << "Not-a-number found in DB_Row."
-	   << endl;
+           << endl;
 #endif
       is_broken = true;
       break;
@@ -60148,9 +60216,9 @@ operator==(const DB_Row<T>& x, const DB_Row<T>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/DB_Row.defs.hh line 469. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Row_defs.hh line 469. */
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_defs.hh line 32. */
 #include <vector>
 #include <cstddef>
 #include <iosfwd>
@@ -60388,12 +60456,12 @@ bool operator!=(const DB_Matrix<T>& x, const DB_Matrix<T>& y);
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Temp, typename To, typename T>
 bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-				 const DB_Matrix<T>& x,
-				 const DB_Matrix<T>& y,
-				 Rounding_Dir dir,
-				 Temp& tmp0,
-				 Temp& tmp1,
-				 Temp& tmp2);
+                                 const DB_Matrix<T>& x,
+                                 const DB_Matrix<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Computes the euclidean distance between \p x and \p y.
@@ -60410,12 +60478,12 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Temp, typename To, typename T>
 bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			       const DB_Matrix<T>& x,
-			       const DB_Matrix<T>& y,
-			       Rounding_Dir dir,
-			       Temp& tmp0,
-			       Temp& tmp1,
-			       Temp& tmp2);
+                               const DB_Matrix<T>& x,
+                               const DB_Matrix<T>& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Computes the \f$L_\infty\f$ distance between \p x and \p y.
@@ -60441,12 +60509,12 @@ bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_inlines.hh line 1. */
 /* DB_Matrix class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.inlines.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_inlines.hh line 31. */
 #include <iostream>
 
 namespace Parma_Polyhedra_Library {
@@ -60626,12 +60694,12 @@ DB_Matrix<T>::operator=(const DB_Matrix& y) {
 template <typename Specialization, typename Temp, typename To, typename T>
 inline bool
 l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const DB_Matrix<T>& x,
-		    const DB_Matrix<T>& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0,
-		    Temp& tmp1,
-		    Temp& tmp2) {
+                    const DB_Matrix<T>& x,
+                    const DB_Matrix<T>& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0,
+                    Temp& tmp1,
+                    Temp& tmp2) {
   const dimension_type x_num_rows = x.num_rows();
   if (x_num_rows != y.num_rows())
     return false;
@@ -60643,26 +60711,26 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
       const T& x_i_j = x_i[j];
       const T& y_i_j = y_i[j];
       if (is_plus_infinity(x_i_j)) {
-	if (is_plus_infinity(y_i_j))
-	  continue;
-	else {
-	pinf:
-	  assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-	  return true;
-	}
+        if (is_plus_infinity(y_i_j))
+          continue;
+        else {
+        pinf:
+          assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+          return true;
+        }
       }
       else if (is_plus_infinity(y_i_j))
-	goto pinf;
+        goto pinf;
 
       const Temp* tmp1p;
       const Temp* tmp2p;
       if (x_i_j > y_i_j) {
-	maybe_assign(tmp1p, tmp1, x_i_j, dir);
-	maybe_assign(tmp2p, tmp2, y_i_j, inverse(dir));
+        maybe_assign(tmp1p, tmp1, x_i_j, dir);
+        maybe_assign(tmp2p, tmp2, y_i_j, inverse(dir));
       }
       else {
-	maybe_assign(tmp1p, tmp1, y_i_j, dir);
-	maybe_assign(tmp2p, tmp2, x_i_j, inverse(dir));
+        maybe_assign(tmp1p, tmp1, y_i_j, dir);
+        maybe_assign(tmp2p, tmp2, x_i_j, inverse(dir));
       }
       sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
       PPL_ASSERT(sgn(tmp1) >= 0);
@@ -60680,18 +60748,18 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const DB_Matrix<T>& x,
-			    const DB_Matrix<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
+                            const DB_Matrix<T>& x,
+                            const DB_Matrix<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
   return
     l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >(r, x, y,
-								    dir,
-								    tmp0,
-								    tmp1,
-								    tmp2);
+                                                                    dir,
+                                                                    tmp0,
+                                                                    tmp1,
+                                                                    tmp2);
 }
 
 
@@ -60701,18 +60769,18 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const DB_Matrix<T>& x,
-			  const DB_Matrix<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
+                          const DB_Matrix<T>& x,
+                          const DB_Matrix<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
   return
     l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >(r, x, y,
-								  dir,
-								  tmp0,
-								  tmp1,
-								  tmp2);
+                                                                  dir,
+                                                                  tmp0,
+                                                                  tmp1,
+                                                                  tmp2);
 }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -60721,18 +60789,18 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const DB_Matrix<T>& x,
-			   const DB_Matrix<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
+                           const DB_Matrix<T>& x,
+                           const DB_Matrix<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
   return
     l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >(r, x, y,
-								   dir,
-								   tmp0,
-								   tmp1,
-								   tmp2);
+                                                                   dir,
+                                                                   tmp0,
+                                                                   tmp1,
+                                                                   tmp2);
 }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -60746,7 +60814,7 @@ swap(DB_Matrix<T>& x, DB_Matrix<T>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_templates.hh line 1. */
 /* DB_Matrix class implementation: non-inline template functions.
 */
 
@@ -60786,27 +60854,27 @@ DB_Matrix<T>::grow(const dimension_type new_n_rows) {
     if (new_n_rows <= row_capacity) {
       // We can recycle the old rows.
       if (rows.capacity() < new_n_rows) {
-	// Reallocation will take place.
-	std::vector<DB_Row<T> > new_rows;
-	new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
-	new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
-	// Construct the new rows.
-	dimension_type i = new_n_rows;
-	while (i-- > old_n_rows)
-	  new_rows[i].construct(new_n_rows, row_capacity);
-	// Steal the old rows.
-	++i;
-	while (i-- > 0)
-	  swap(new_rows[i], rows[i]);
-	// Put the new vector into place.
+        // Reallocation will take place.
+        std::vector<DB_Row<T> > new_rows;
+        new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
+        new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
+        // Construct the new rows.
+        dimension_type i = new_n_rows;
+        while (i-- > old_n_rows)
+          new_rows[i].construct(new_n_rows, row_capacity);
+        // Steal the old rows.
+        ++i;
+        while (i-- > 0)
+          swap(new_rows[i], rows[i]);
+        // Put the new vector into place.
         using std::swap;
-	swap(rows, new_rows);
+        swap(rows, new_rows);
       }
       else {
-	// Reallocation will NOT take place.
-	rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
-	for (dimension_type i = new_n_rows; i-- > old_n_rows; )
-	  rows[i].construct(new_n_rows, row_capacity);
+        // Reallocation will NOT take place.
+        rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
+        for (dimension_type i = new_n_rows; i-- > old_n_rows; )
+          rows[i].construct(new_n_rows, row_capacity);
       }
     }
     else {
@@ -60817,19 +60885,19 @@ DB_Matrix<T>::grow(const dimension_type new_n_rows) {
       // Construct the new rows.
       new_matrix.row_size = new_n_rows;
       new_matrix.row_capacity = compute_capacity(new_n_rows,
-						 max_num_columns());
+                                                 max_num_columns());
       dimension_type i = new_n_rows;
       while (i-- > old_n_rows)
-	new_matrix.rows[i].construct(new_matrix.row_size,
-				     new_matrix.row_capacity);
+        new_matrix.rows[i].construct(new_matrix.row_size,
+                                     new_matrix.row_capacity);
       // Copy the old rows.
       ++i;
       while (i-- > 0) {
-	// FIXME: copying may be unnecessarily costly.
-	DB_Row<T> new_row(rows[i],
-			  new_matrix.row_size,
-			  new_matrix.row_capacity);
-	swap(new_matrix.rows[i], new_row);
+        // FIXME: copying may be unnecessarily costly.
+        DB_Row<T> new_row(rows[i],
+                          new_matrix.row_size,
+                          new_matrix.row_capacity);
+        swap(new_matrix.rows[i], new_row);
       }
       // Put the new vector into place.
       m_swap(new_matrix);
@@ -60842,16 +60910,16 @@ DB_Matrix<T>::grow(const dimension_type new_n_rows) {
     if (new_n_rows <= row_capacity)
       // But we have enough capacity: we resize existing rows.
       for (dimension_type i = old_n_rows; i-- > 0; )
-	rows[i].expand_within_capacity(new_n_rows);
+        rows[i].expand_within_capacity(new_n_rows);
     else {
       // Capacity exhausted: we must reallocate the rows and
       // make sure all the rows have the same capacity.
       const dimension_type new_row_capacity
-	= compute_capacity(new_n_rows, max_num_columns());
+        = compute_capacity(new_n_rows, max_num_columns());
       for (dimension_type i = old_n_rows; i-- > 0; ) {
-	// FIXME: copying may be unnecessarily costly.
-	DB_Row<T> new_row(rows[i], new_n_rows, new_row_capacity);
-	swap(rows[i], new_row);
+        // FIXME: copying may be unnecessarily costly.
+        DB_Row<T> new_row(rows[i], new_n_rows, new_row_capacity);
+        swap(rows[i], new_row);
       }
       row_capacity = new_row_capacity;
     }
@@ -60870,30 +60938,30 @@ DB_Matrix<T>::resize_no_copy(const dimension_type new_n_rows) {
     if (new_n_rows <= row_capacity) {
       // We can recycle the old rows.
       if (rows.capacity() < new_n_rows) {
-	// Reallocation (of vector `rows') will take place.
-	std::vector<DB_Row<T> > new_rows;
-	new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
-	new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
-	// Construct the new rows (be careful: each new row must have
-	// the same capacity as each one of the old rows).
-	dimension_type i = new_n_rows;
-	while (i-- > old_n_rows)
-	  new_rows[i].construct(new_n_rows, row_capacity);
-	// Steal the old rows.
-	++i;
-	while (i-- > 0)
-	  swap(new_rows[i], rows[i]);
-	// Put the new vector into place.
+        // Reallocation (of vector `rows') will take place.
+        std::vector<DB_Row<T> > new_rows;
+        new_rows.reserve(compute_capacity(new_n_rows, max_num_rows()));
+        new_rows.insert(new_rows.end(), new_n_rows, DB_Row<T>());
+        // Construct the new rows (be careful: each new row must have
+        // the same capacity as each one of the old rows).
+        dimension_type i = new_n_rows;
+        while (i-- > old_n_rows)
+          new_rows[i].construct(new_n_rows, row_capacity);
+        // Steal the old rows.
+        ++i;
+        while (i-- > 0)
+          swap(new_rows[i], rows[i]);
+        // Put the new vector into place.
         using std::swap;
-	swap(rows, new_rows);
+        swap(rows, new_rows);
       }
       else {
-	// Reallocation (of vector `rows') will NOT take place.
-	rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
-	// Be careful: each new row must have
-	// the same capacity as each one of the old rows.
-	for (dimension_type i = new_n_rows; i-- > old_n_rows; )
-	  rows[i].construct(new_n_rows, row_capacity);
+        // Reallocation (of vector `rows') will NOT take place.
+        rows.insert(rows.end(), new_n_rows - old_n_rows, DB_Row<T>());
+        // Be careful: each new row must have
+        // the same capacity as each one of the old rows.
+        for (dimension_type i = new_n_rows; i-- > old_n_rows; )
+          rows[i].construct(new_n_rows, row_capacity);
       }
     }
     else {
@@ -60917,15 +60985,15 @@ DB_Matrix<T>::resize_no_copy(const dimension_type new_n_rows) {
     if (new_n_rows <= row_capacity)
       // But we have enough capacity: we resize existing rows.
       for (dimension_type i = old_n_rows; i-- > 0; )
-	rows[i].expand_within_capacity(new_n_rows);
+        rows[i].expand_within_capacity(new_n_rows);
     else {
       // Capacity exhausted: we must reallocate the rows and
       // make sure all the rows have the same capacity.
       const dimension_type new_row_capacity
-	= compute_capacity(new_n_rows, max_num_columns());
+        = compute_capacity(new_n_rows, max_num_columns());
       for (dimension_type i = old_n_rows; i-- > 0; ) {
-	DB_Row<T> new_row(new_n_rows, new_row_capacity);
-	swap(rows[i], new_row);
+        DB_Row<T> new_row(new_n_rows, new_row_capacity);
+        swap(rows[i], new_row);
       }
       row_capacity = new_row_capacity;
     }
@@ -60964,7 +61032,7 @@ DB_Matrix<T>::ascii_load(std::istream& s) {
     for (dimension_type j = 0; j < nrows; ++j) {
       Result r = input(x[i][j], s, ROUND_CHECK);
       if (result_relation(r) != VR_EQ || is_minus_infinity(x[i][j]))
-	return false;
+        return false;
     }
 
   // Check invariants.
@@ -61008,9 +61076,9 @@ DB_Matrix<T>::OK() const {
   if (num_rows() != row_size) {
 #ifndef NDEBUG
     cerr << "DB_Matrix has fewer columns than rows:\n"
-	 << "row_size is " << row_size
-	 << ", num_rows() is " << num_rows() << "!"
-	 << endl;
+         << "row_size is " << row_size
+         << ", num_rows() is " << num_rows() << "!"
+         << endl;
 #endif
     return false;
   }
@@ -61043,19 +61111,19 @@ IO_Operators::operator<<(std::ostream& s, const DB_Matrix<T>& c) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/DB_Matrix.defs.hh line 324. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/DB_Matrix_defs.hh line 324. */
 
-/* Automatically generated from PPL source file ../src/WRD_coefficient_types.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/WRD_coefficient_types_defs.hh line 1. */
 /* Coefficient types of weakly-relational domains: declarations.
 */
 
 
-/* Automatically generated from PPL source file ../src/WRD_coefficient_types.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/WRD_coefficient_types_defs.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   The production policy for checked numbers used in weakly-relational
   domains.
  */
@@ -61114,7 +61182,7 @@ struct WRD_Extended_Number_Policy {
 };
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   The debugging policy for checked numbers used in weakly-relational
   domains.
  */
@@ -61174,7 +61242,7 @@ struct Debug_WRD_Extended_Number_Policy {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/WRD_coefficient_types.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/WRD_coefficient_types_inlines.hh line 1. */
 /* Coefficient types of weakly-relational domains: inline functions.
 */
 
@@ -61195,9 +61263,9 @@ Debug_WRD_Extended_Number_Policy::handle_result(Result r) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/WRD_coefficient_types.defs.hh line 152. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/WRD_coefficient_types_defs.hh line 152. */
 
-/* Automatically generated from PPL source file ../src/BD_Shape.defs.hh line 52. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_defs.hh line 52. */
 #include <cstddef>
 #include <iosfwd>
 #include <vector>
@@ -61250,7 +61318,7 @@ bool operator!=(const BD_Shape<T>& x, const BD_Shape<T>& y);
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename T>
 bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -61267,7 +61335,7 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename T>
 bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -61304,7 +61372,7 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename T>
 bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -61321,7 +61389,7 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename T>
 bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -61358,7 +61426,7 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename T>
 bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -61375,7 +61443,7 @@ bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename T>
 bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -63086,13 +63154,13 @@ private:
   DB_Matrix<N> dbm;
 
 #define PPL_IN_BD_Shape_CLASS
-/* Automatically generated from PPL source file ../src/BDS_Status.idefs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BDS_Status_idefs.hh line 1. */
 /* BD_Shape<T>::Status class declaration.
 */
 
 
 #ifndef PPL_IN_BD_Shape_CLASS
-#error "Do not include BDS_Status.idefs.hh directly; use BD_Shape.defs.hh instead"
+#error "Do not include BDS_Status_idefs.hh directly; use BD_Shape_defs.hh instead"
 #endif
 
 //! A conjunctive assertion about a BD_Shape<T> object.
@@ -63181,7 +63249,7 @@ private:
   void reset(flags_t mask);
 };
 
-/* Automatically generated from PPL source file ../src/BD_Shape.defs.hh line 1941. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_defs.hh line 1941. */
 #undef PPL_IN_BD_Shape_CLASS
 
   //! The status flags to keep track of the internal state.
@@ -63458,64 +63526,68 @@ private:
                                Coefficient_traits::const_reference sc_denom,
                                const N& ub_v);
 
-  /* \brief
+  /*! \brief
     Auxiliary function for \ref affine_form_relation "affine form image" that
-    handle the general case: \f$l \equal c\f$
+    handle the general case: \f$l = c\f$
   */
   template <typename Interval_Info>
   void inhomogeneous_affine_form_image(const dimension_type& var_id,
-				                       const Interval<T, Interval_Info>& b);
+                                       const Interval<T, Interval_Info>& b);
 
-  /* \brief
-    Auxiliary function for \ref affine_form_relation "affine form image" that
-    handle the general case: \f$l \equal ax + c\f$
+  /*! \brief
+    Auxiliary function for \ref affine_form_relation "affine form
+    image" that handle the general case: \f$l = ax + c\f$
   */
   template <typename Interval_Info>
-  void one_variable_affine_form_image(const dimension_type& var_id,
-                               const Interval<T, Interval_Info>& b,
-                               const Interval<T, Interval_Info>& w_coeff,
-                               const dimension_type& w_id,
-                               const dimension_type& space_dim);
+  void one_variable_affine_form_image
+  (const dimension_type& var_id,
+   const Interval<T, Interval_Info>& b,
+   const Interval<T, Interval_Info>& w_coeff,
+   const dimension_type& w_id,
+   const dimension_type& space_dim);
 
-  /* \brief
+  /*! \brief
     Auxiliary function for \ref affine_form_relation "affine form image" that
-    handle the general case: \f$l \equal ax + by + c\f$
+    handle the general case: \f$l = ax + by + c\f$
   */
   template <typename Interval_Info>
-  void two_variables_affine_form_image(const dimension_type& var_id,
-                 const Linear_Form<Interval<T,Interval_Info> >& lf,
-                                   const dimension_type& space_dim);
+  void two_variables_affine_form_image
+  (const dimension_type& var_id,
+   const Linear_Form<Interval<T,Interval_Info> >& lf,
+   const dimension_type& space_dim);
 
-  /* \brief
+  /*! \brief
     Auxiliary function for refine with linear form that handle
-    the general case: \f$l \equal ax + c\f$
+    the general case: \f$l = ax + c\f$
   */
   template <typename Interval_Info>
-  void left_inhomogeneous_refine(const dimension_type& right_t,
-				 const dimension_type& right_w_id,
-		   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
+  void left_inhomogeneous_refine
+  (const dimension_type& right_t,
+   const dimension_type& right_w_id,
+   const Linear_Form<Interval<T, Interval_Info> >& left,
+   const Linear_Form<Interval<T, Interval_Info> >& right);
 
-  /* \brief
+  /*! \brief
     Auxiliary function for refine with linear form that handle
-    the general case: \f$ax +b \equal cy + d\f$
+    the general case: \f$ax + b = cy + d\f$
   */
   template <typename Interval_Info>
-  void left_one_var_refine(const dimension_type& left_w_id,
-			   const dimension_type& right_t,
-			   const dimension_type& right_w_id,
-		   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
+  void left_one_var_refine
+  (const dimension_type& left_w_id,
+   const dimension_type& right_t,
+   const dimension_type& right_w_id,
+   const Linear_Form<Interval<T, Interval_Info> >& left,
+   const Linear_Form<Interval<T, Interval_Info> >& right);
 
-/* \brief
+  /*! \brief
     Auxiliary function for refine with linear form that handle
     the general case.
   */
   template <typename Interval_Info>
   void general_refine(const dimension_type& left_w_id,
-			   const dimension_type& right_w_id,
-		   const Linear_Form<Interval<T, Interval_Info> >& left,
-                   const Linear_Form<Interval<T, Interval_Info> >& right);
+                      const dimension_type& right_w_id,
+                      const Linear_Form<Interval<T, Interval_Info> >& left,
+                      const Linear_Form<Interval<T, Interval_Info> >& right);
 
   template <typename Interval_Info>
   void linear_form_upper_bound(const Linear_Form<Interval<T, Interval_Info> >&
@@ -63604,7 +63676,7 @@ private:
   //@} // Exception Throwers
 };
 
-/* Automatically generated from PPL source file ../src/BDS_Status.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BDS_Status_inlines.hh line 1. */
 /* BD_Shape<T>::Status class implementation: inline functions.
 */
 
@@ -63740,7 +63812,7 @@ BD_Shape<T>::Status::OK() const {
     else {
 #ifndef NDEBUG
       std::cerr << "The empty flag is incompatible with any other one."
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
@@ -63753,8 +63825,8 @@ BD_Shape<T>::Status::OK() const {
     else {
 #ifndef NDEBUG
       std::cerr << "The shortest-path reduction flag should also imply "
-		<< "the closure flag."
-		<< std::endl;
+                << "the closure flag."
+                << std::endl;
 #endif
       return false;
     }
@@ -63850,17 +63922,17 @@ BD_Shape<T>::Status::ascii_load(std::istream& s) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/BD_Shape.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_inlines.hh line 1. */
 /* BD_Shape class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/C_Polyhedron.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Polyhedron_defs.hh line 1. */
 /* C_Polyhedron class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/C_Polyhedron.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Polyhedron_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -63869,7 +63941,7 @@ class C_Polyhedron;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/NNC_Polyhedron.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/NNC_Polyhedron_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -63878,7 +63950,7 @@ class NNC_Polyhedron;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/C_Polyhedron.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Polyhedron_defs.hh line 33. */
 
 //! A closed convex polyhedron.
 /*! \ingroup PPL_CXX_interface
@@ -63922,7 +63994,7 @@ public:
     by default, a 0-dimension space universe C polyhedron is built.
   */
   explicit C_Polyhedron(dimension_type num_dimensions = 0,
-			Degenerate_Element kind = UNIVERSE);
+                        Degenerate_Element kind = UNIVERSE);
 
   //! Builds a C polyhedron from a system of constraints.
   /*!
@@ -64124,7 +64196,7 @@ public:
   bool upper_bound_assign_if_exact(const C_Polyhedron& y);
 };
 
-/* Automatically generated from PPL source file ../src/C_Polyhedron.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Polyhedron_inlines.hh line 1. */
 /* C_Polyhedron class implementation: inline functions.
 */
 
@@ -64140,14 +64212,14 @@ C_Polyhedron::~C_Polyhedron() {
 
 inline
 C_Polyhedron::C_Polyhedron(dimension_type num_dimensions,
-			   Degenerate_Element kind)
+                           Degenerate_Element kind)
   : Polyhedron(NECESSARILY_CLOSED,
                check_space_dimension_overflow(num_dimensions,
                                               NECESSARILY_CLOSED,
                                               "C_Polyhedron(n, k)",
                                               "n exceeds the maximum "
                                               "allowed space dimension"),
-	       kind) {
+               kind) {
 }
 
 inline
@@ -64168,7 +64240,7 @@ C_Polyhedron::C_Polyhedron(Constraint_System& cs, Recycle_Input)
                                                   "the space dimension of cs "
                                                   "exceeds the maximum allowed "
                                                   "space dimension"),
-	       Recycle_Input()) {
+               Recycle_Input()) {
 }
 
 inline
@@ -64189,7 +64261,7 @@ C_Polyhedron::C_Polyhedron(Generator_System& gs, Recycle_Input)
                                                   "the space dimension of gs "
                                                   "exceeds the maximum allowed "
                                                   "space dimension"),
-	       Recycle_Input()) {
+               Recycle_Input()) {
 }
 
 template <typename Interval>
@@ -64256,19 +64328,19 @@ C_Polyhedron::upper_bound_assign_if_exact(const C_Polyhedron& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/C_Polyhedron.defs.hh line 279. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/C_Polyhedron_defs.hh line 279. */
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_defs.hh line 1. */
 /* Octagonal_Shape class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_defs.hh line 1. */
 /* OR_Matrix class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -64278,7 +64350,7 @@ class OR_Matrix;
 
 }
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_defs.hh line 31. */
 #include <cstddef>
 #include <iosfwd>
 
@@ -64802,12 +64874,12 @@ bool operator!=(const OR_Matrix<T>& x, const OR_Matrix<T>& y);
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Temp, typename To, typename T>
 bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-				 const OR_Matrix<T>& x,
-				 const OR_Matrix<T>& y,
-				 Rounding_Dir dir,
-				 Temp& tmp0,
-				 Temp& tmp1,
-				 Temp& tmp2);
+                                 const OR_Matrix<T>& x,
+                                 const OR_Matrix<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Computes the euclidean distance between \p x and \p y.
@@ -64824,12 +64896,12 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Temp, typename To, typename T>
 bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			       const OR_Matrix<T>& x,
-			       const OR_Matrix<T>& y,
-			       Rounding_Dir dir,
-			       Temp& tmp0,
-			       Temp& tmp1,
-			       Temp& tmp2);
+                               const OR_Matrix<T>& x,
+                               const OR_Matrix<T>& y,
+                               Rounding_Dir dir,
+                               Temp& tmp0,
+                               Temp& tmp1,
+                               Temp& tmp2);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Computes the \f$L_\infty\f$ distance between \p x and \p y.
@@ -64846,21 +64918,21 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Temp, typename To, typename T>
 bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-				 const OR_Matrix<T>& x,
-				 const OR_Matrix<T>& y,
-				 Rounding_Dir dir,
-				 Temp& tmp0,
-				 Temp& tmp1,
-				 Temp& tmp2);
+                                 const OR_Matrix<T>& x,
+                                 const OR_Matrix<T>& y,
+                                 Rounding_Dir dir,
+                                 Temp& tmp0,
+                                 Temp& tmp1,
+                                 Temp& tmp2);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_inlines.hh line 1. */
 /* OR_Matrix class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.inlines.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_inlines.hh line 33. */
 #include <algorithm>
 
 namespace Parma_Polyhedra_Library {
@@ -64904,9 +64976,9 @@ template <typename U>
 inline
 OR_Matrix<T>::Pseudo_Row<U>::Pseudo_Row(U& y
 #if PPL_OR_MATRIX_EXTRA_DEBUG
-		, dimension_type s
+                , dimension_type s
 #endif
-		)
+                )
   : first(&y)
 #if PPL_OR_MATRIX_EXTRA_DEBUG
   , size_(s)
@@ -64974,9 +65046,9 @@ inline
 OR_Matrix<T>::any_row_iterator<U>::any_row_iterator(U& base)
   :  value(base
 #if PPL_OR_MATRIX_EXTRA_DEBUG
-	   , OR_Matrix<T>::row_size(0)
+           , OR_Matrix<T>::row_size(0)
 #endif
-	   ),
+           ),
      e(0),
      i(0) {
 }
@@ -65281,7 +65353,7 @@ isqrt(dimension_type x) {
   dimension_type r = 0;
   const dimension_type FIRST_BIT_MASK = 0x40000000U;
   for (dimension_type t = FIRST_BIT_MASK; t != 0; t >>= 2) {
-    dimension_type s = r + t;
+    const dimension_type s = r + t;
     if (s <= x) {
       x -= s;
       r = s + t;
@@ -65296,7 +65368,7 @@ inline dimension_type
 OR_Matrix<T>::max_num_rows() {
   // Compute the maximum number of rows that are contained in a DB_Row
   // that allocates a pseudo-triangular matrix.
-  dimension_type k = isqrt(2*DB_Row<T>::max_size() + 1);
+  const dimension_type k = isqrt(2*DB_Row<T>::max_size() + 1);
   return (k - 1) - (k - 1) % 2;
 }
 
@@ -65324,9 +65396,9 @@ inline typename OR_Matrix<T>::row_reference_type
 OR_Matrix<T>::operator[](dimension_type k) {
   return row_reference_type(vec[row_first_element_index(k)]
 #if PPL_OR_MATRIX_EXTRA_DEBUG
-			    , row_size(k)
+                            , row_size(k)
 #endif
-			    );
+                            );
 }
 
 template <typename T>
@@ -65334,9 +65406,9 @@ inline typename OR_Matrix<T>::const_row_reference_type
 OR_Matrix<T>::operator[](dimension_type k) const {
   return const_row_reference_type(vec[row_first_element_index(k)]
 #if PPL_OR_MATRIX_EXTRA_DEBUG
-				  , row_size(k)
+                                  , row_size(k)
 #endif
-				  );
+                                  );
 }
 
 template <typename T>
@@ -65421,8 +65493,8 @@ OR_Matrix<T>::grow(const dimension_type new_dim) {
       OR_Matrix<T> new_matrix(new_dim);
       element_iterator j = new_matrix.element_begin();
       for (element_iterator i = element_begin(),
-	     mend = element_end(); i != mend; ++i, ++j)
-	assign_or_swap(*j, *i);
+             mend = element_end(); i != mend; ++i, ++j)
+        assign_or_swap(*j, *i);
       m_swap(new_matrix);
     }
   }
@@ -65463,27 +65535,27 @@ OR_Matrix<T>::resize_no_copy(const dimension_type new_dim) {
 template <typename Specialization, typename Temp, typename To, typename T>
 inline bool
 l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const OR_Matrix<T>& x,
-		    const OR_Matrix<T>& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0,
-		    Temp& tmp1,
-		    Temp& tmp2) {
+                    const OR_Matrix<T>& x,
+                    const OR_Matrix<T>& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0,
+                    Temp& tmp1,
+                    Temp& tmp2) {
   if (x.num_rows() != y.num_rows())
     return false;
   assign_r(tmp0, 0, ROUND_NOT_NEEDED);
   for (typename OR_Matrix<T>::const_element_iterator
-	 i = x.element_begin(), j = y.element_begin(),
-	 mat_end = x.element_end(); i != mat_end; ++i, ++j) {
+         i = x.element_begin(), j = y.element_begin(),
+         mat_end = x.element_end(); i != mat_end; ++i, ++j) {
     const T& x_i = *i;
     const T& y_i = *j;
     if (is_plus_infinity(x_i)) {
       if (is_plus_infinity(y_i))
-	continue;
+        continue;
       else {
       pinf:
-	assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
-	return true;
+        assign_r(r, PLUS_INFINITY, ROUND_NOT_NEEDED);
+        return true;
       }
     }
     else if (is_plus_infinity(y_i))
@@ -65516,18 +65588,18 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const OR_Matrix<T>& x,
-			    const OR_Matrix<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
+                            const OR_Matrix<T>& x,
+                            const OR_Matrix<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
   return
     l_m_distance_assign<Rectilinear_Distance_Specialization<Temp> >(r, x, y,
-								    dir,
-								    tmp0,
-								    tmp1,
-								    tmp2);
+                                                                    dir,
+                                                                    tmp0,
+                                                                    tmp1,
+                                                                    tmp2);
 }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -65536,18 +65608,18 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const OR_Matrix<T>& x,
-			  const OR_Matrix<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
+                          const OR_Matrix<T>& x,
+                          const OR_Matrix<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
   return
     l_m_distance_assign<Euclidean_Distance_Specialization<Temp> >(r, x, y,
-								  dir,
-								  tmp0,
-								  tmp1,
-								  tmp2);
+                                                                  dir,
+                                                                  tmp0,
+                                                                  tmp1,
+                                                                  tmp2);
 }
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -65556,18 +65628,18 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const OR_Matrix<T>& x,
-			   const OR_Matrix<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
+                           const OR_Matrix<T>& x,
+                           const OR_Matrix<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
   return
     l_m_distance_assign<L_Infinity_Distance_Specialization<Temp> >(r, x, y,
-								   dir,
-								   tmp0,
-								   tmp1,
-								   tmp2);
+                                                                   dir,
+                                                                   tmp0,
+                                                                   tmp1,
+                                                                   tmp2);
 }
 
 /*! \relates OR_Matrix */
@@ -65579,7 +65651,7 @@ swap(OR_Matrix<T>& x, OR_Matrix<T>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_templates.hh line 1. */
 /* OR_Matrix class implementation: non-inline template functions.
 */
 
@@ -65628,7 +65700,7 @@ OR_Matrix<T>::ascii_dump(std::ostream& s) const {
   dimension_type space = x.space_dimension();
   s << space << separator << "\n";
   for (const_row_iterator i = x.row_begin(),
-	 x_row_end = x.row_end(); i != x_row_end; ++i) {
+         x_row_end = x.row_end(); i != x_row_end; ++i) {
     const_row_reference_type r = *i;
     dimension_type rs = i.row_size();
     for (dimension_type j = 0; j < rs; ++j) {
@@ -65649,13 +65721,13 @@ OR_Matrix<T>::ascii_load(std::istream& s) {
     return false;
   resize_no_copy(space);
   for (row_iterator i = row_begin(),
-	 this_row_end = row_end(); i != this_row_end; ++i) {
+         this_row_end = row_end(); i != this_row_end; ++i) {
     row_reference_type r_i = *i;
     const dimension_type rs = i.row_size();
     for (dimension_type j = 0; j < rs; ++j) {
       Result r = input(r_i[j], s, ROUND_CHECK);
       if (result_relation(r) != VR_EQ || is_minus_infinity(r_i[j]))
-	return false;
+        return false;
     }
   }
   PPL_ASSERT(OK());
@@ -65669,7 +65741,7 @@ template <typename T>
 std::ostream&
 IO_Operators::operator<<(std::ostream& s, const OR_Matrix<T>& m) {
   for (typename OR_Matrix<T>::const_row_iterator m_iter = m.row_begin(),
-	 m_end = m.row_end(); m_iter != m_end; ++m_iter) {
+         m_end = m.row_end(); m_iter != m_end; ++m_iter) {
     typename OR_Matrix<T>::const_row_reference_type r_m = *m_iter;
     const dimension_type mr_size = m_iter.row_size();
     for (dimension_type j = 0; j < mr_size; ++j)
@@ -65681,9 +65753,9 @@ IO_Operators::operator<<(std::ostream& s, const OR_Matrix<T>& m) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/OR_Matrix.defs.hh line 609. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/OR_Matrix_defs.hh line 609. */
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.defs.hh line 50. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_defs.hh line 50. */
 #include <vector>
 #include <cstddef>
 #include <climits>
@@ -65741,7 +65813,7 @@ bool operator!=(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y);
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename T>
 bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -65758,7 +65830,7 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename T>
 bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -65795,7 +65867,7 @@ bool rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename T>
 bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -65812,7 +65884,7 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename T>
 bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -65849,7 +65921,7 @@ bool euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<To, Extended_Number_Policy>.
+  <CODE>Checked_Number\<To, Extended_Number_Policy\></CODE>.
 */
 template <typename To, typename T>
 bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -65866,7 +65938,7 @@ bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   The direction of the approximation is specified by \p dir.
 
   All computations are performed using variables of type
-  Checked_Number<Temp, Extended_Number_Policy>.
+  <CODE>Checked_Number\<Temp, Extended_Number_Policy\></CODE>.
 */
 template <typename Temp, typename To, typename T>
 bool l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
@@ -67550,19 +67622,19 @@ private:
   dimension_type space_dim;
 
   // Please, do not move the following include directive:
-  // `Og_Status.idefs.hh' must be included exactly at this point.
+  // `Og_Status_idefs.hh' must be included exactly at this point.
   // And please do not remove the space separating `#' from `include':
   // this ensures that the directive will not be moved during the
   // procedure that automatically creates the library's include file
   // (see `Makefile.am' in the `src' directory).
 #define PPL_IN_Octagonal_Shape_CLASS
-/* Automatically generated from PPL source file ../src/Og_Status.idefs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Og_Status_idefs.hh line 1. */
 /* Octagonal_Shape<T>::Status class declaration.
 */
 
 
 #ifndef PPL_IN_Octagonal_Shape_CLASS
-#error "Do not include Og_Status.idefs.hh directly; use Octagonal_Shape.defs.hh instead"
+#error "Do not include Og_Status_idefs.hh directly; use Octagonal_Shape_defs.hh instead"
 #endif
 
 //! A conjunctive assertion about a Octagonal_Shape<T> object.
@@ -67646,7 +67718,7 @@ private:
 
 };
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.defs.hh line 1923. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_defs.hh line 1923. */
 #undef PPL_IN_Octagonal_Shape_CLASS
 
   //! The status flags to keep track of the internal state.
@@ -67698,7 +67770,7 @@ private:
   */
   template <typename Interval_Info>
   void linear_form_upper_bound(
-		   const Linear_Form< Interval<T, Interval_Info> >& lf,
+                   const Linear_Form< Interval<T, Interval_Info> >& lf,
                    N& result) const;
 
   // FIXME: this function is currently not used. Consider removing it.
@@ -68044,7 +68116,7 @@ private:
   //@} // Exception Throwers
 };
 
-/* Automatically generated from PPL source file ../src/Og_Status.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Og_Status_inlines.hh line 1. */
 /* Octagonal_Shape<T>::Status class implementation: inline functions.
 */
 
@@ -68160,7 +68232,7 @@ Octagonal_Shape<T>::Status::OK() const {
     else {
 #ifndef NDEBUG
       std::cerr << "The empty flag is incompatible with any other one."
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
@@ -68247,17 +68319,17 @@ Octagonal_Shape<T>::Status::ascii_load(std::istream& s) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_inlines.hh line 1. */
 /* Octagonal_Shape class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/wrap_assign.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/wrap_assign.hh line 1. */
 /* Generic implementation of the wrap_assign() function.
 */
 
 
-/* Automatically generated from PPL source file ../src/wrap_assign.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/wrap_assign.hh line 32. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -68509,7 +68581,7 @@ wrap_assign(PSET& pointset,
     div_2exp_assign_r(l_n, l_n, w, ROUND_DOWN);
     div_2exp_assign_r(u_n, u_n, w, ROUND_DOWN);
     Coefficient& first_quadrant = l_n;
-    Coefficient& last_quadrant = u_n;
+    const Coefficient& last_quadrant = u_n;
 
     // Special case: this variable does not need wrapping.
     if (first_quadrant == 0 && last_quadrant == 0)
@@ -68606,7 +68678,7 @@ wrap_assign(PSET& pointset,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.inlines.hh line 36. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_inlines.hh line 36. */
 #include <algorithm>
 
 namespace Parma_Polyhedra_Library {
@@ -68679,7 +68751,7 @@ Octagonal_Shape<T>::reset_strongly_closed() {
 template <typename T>
 inline
 Octagonal_Shape<T>::Octagonal_Shape(const dimension_type num_dimensions,
-				    const Degenerate_Element kind)
+                                    const Degenerate_Element kind)
   : matrix(num_dimensions), space_dim(num_dimensions), status() {
   if (kind == EMPTY)
     set_empty();
@@ -68849,34 +68921,34 @@ Octagonal_Shape<T>::bounds_from_below(const Linear_Expression& expr) const {
 template <typename T>
 inline bool
 Octagonal_Shape<T>::maximize(const Linear_Expression& expr,
-			     Coefficient& sup_n, Coefficient& sup_d,
-			     bool& maximum) const {
+                             Coefficient& sup_n, Coefficient& sup_d,
+                             bool& maximum) const {
   return max_min(expr, true, sup_n, sup_d, maximum);
 }
 
 template <typename T>
 inline bool
 Octagonal_Shape<T>::maximize(const Linear_Expression& expr,
-			     Coefficient& sup_n, Coefficient& sup_d,
-			     bool& maximum,
-			     Generator& g) const {
+                             Coefficient& sup_n, Coefficient& sup_d,
+                             bool& maximum,
+                             Generator& g) const {
   return max_min(expr, true, sup_n, sup_d, maximum, g);
 }
 
 template <typename T>
 inline bool
 Octagonal_Shape<T>::minimize(const Linear_Expression& expr,
-			     Coefficient& inf_n, Coefficient& inf_d,
-			     bool& minimum) const {
+                             Coefficient& inf_n, Coefficient& inf_d,
+                             bool& minimum) const {
   return max_min(expr, false, inf_n, inf_d, minimum);
 }
 
 template <typename T>
 inline bool
 Octagonal_Shape<T>::minimize(const Linear_Expression& expr,
-			     Coefficient& inf_n, Coefficient& inf_d,
-			     bool& minimum,
-			     Generator& g) const {
+                             Coefficient& inf_n, Coefficient& inf_d,
+                             bool& minimum,
+                             Generator& g) const {
   return max_min(expr, false, inf_n, inf_d, minimum, g);
 }
 
@@ -68929,7 +69001,7 @@ operator!=(const Octagonal_Shape<T>& x, const Octagonal_Shape<T>& y) {
 template <typename T>
 inline const typename Octagonal_Shape<T>::coefficient_type&
 Octagonal_Shape<T>::matrix_at(const dimension_type i,
-			      const dimension_type j) const {
+                              const dimension_type j) const {
   PPL_ASSERT(i < matrix.num_rows() && j < matrix.num_rows());
   using namespace Implementation::Octagonal_Shapes;
   return (j < matrix.row_size(i))
@@ -68940,7 +69012,7 @@ Octagonal_Shape<T>::matrix_at(const dimension_type i,
 template <typename T>
 inline typename Octagonal_Shape<T>::coefficient_type&
 Octagonal_Shape<T>::matrix_at(const dimension_type i,
-			      const dimension_type j) {
+                              const dimension_type j) {
   PPL_ASSERT(i < matrix.num_rows() && j < matrix.num_rows());
   using namespace Implementation::Octagonal_Shapes;
   return (j < matrix.row_size(i))
@@ -68958,8 +69030,8 @@ Octagonal_Shape<T>::minimized_constraints() const {
 template <typename T>
 inline void
 Octagonal_Shape<T>::add_octagonal_constraint(const dimension_type i,
-					     const dimension_type j,
-					     const N& k) {
+                                             const dimension_type j,
+                                             const N& k) {
   // Private method: the caller has to ensure the following.
 #ifndef NDEBUG
   PPL_ASSERT(i < 2*space_dim && j < 2*space_dim && i != j);
@@ -68978,9 +69050,9 @@ template <typename T>
 inline void
 Octagonal_Shape<T>
 ::add_octagonal_constraint(const dimension_type i,
-			   const dimension_type j,
-			   Coefficient_traits::const_reference numer,
-			   Coefficient_traits::const_reference denom) {
+                           const dimension_type j,
+                           Coefficient_traits::const_reference numer,
+                           Coefficient_traits::const_reference denom) {
 #ifndef NDEBUG
   // Private method: the caller has to ensure the following.
   PPL_ASSERT(i < 2*space_dim && j < 2*space_dim && i != j);
@@ -69041,7 +69113,7 @@ Octagonal_Shape<T>::refine_with_constraints(const Constraint_System& cs) {
                            "cs and *this are space-dimension incompatible");
 
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
     refine_no_check(*i);
 }
 
@@ -69066,7 +69138,7 @@ Octagonal_Shape<T>::refine_with_congruences(const Congruence_System& cgs) {
                            "cgs and *this are space-dimension incompatible");
 
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
+         cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
     refine_no_check(*i);
 }
 
@@ -69107,7 +69179,7 @@ Octagonal_Shape<T>
   // Dimension-compatibility check.
   if (new_dimension > space_dim)
     throw_dimension_incompatible("remove_higher_space_dimension(nd)",
-				 new_dimension);
+                                 new_dimension);
   // The removal of no dimensions from any octagon is a no-op.
   // Note that this case also captures the only legal removal of
   // dimensions from an octagon in a 0-dim space.
@@ -69150,7 +69222,7 @@ Octagonal_Shape<T>::widening_assign(const Octagonal_Shape& y, unsigned* tp) {
 template <typename T>
 inline void
 Octagonal_Shape<T>::CC76_extrapolation_assign(const Octagonal_Shape& y,
-					      unsigned* tp) {
+                                              unsigned* tp) {
   static N stop_points[] = {
     N(-2, ROUND_UP),
     N(-1, ROUND_UP),
@@ -69159,10 +69231,10 @@ Octagonal_Shape<T>::CC76_extrapolation_assign(const Octagonal_Shape& y,
     N( 2, ROUND_UP)
   };
   CC76_extrapolation_assign(y,
-			    stop_points,
-			    stop_points
-			    + sizeof(stop_points)/sizeof(stop_points[0]),
-			    tp);
+                            stop_points,
+                            stop_points
+                            + sizeof(stop_points)/sizeof(stop_points[0]),
+                            tp);
 }
 
 template <typename T>
@@ -69192,8 +69264,8 @@ template <typename T>
 template <typename Interval_Info>
 inline void
 Octagonal_Shape<T>::generalized_refine_with_linear_form_inequality(
-		    const Linear_Form< Interval<T, Interval_Info> >& left,
-		    const Linear_Form< Interval<T, Interval_Info> >& right,
+                    const Linear_Form< Interval<T, Interval_Info> >& left,
+                    const Linear_Form< Interval<T, Interval_Info> >& right,
                     const Relation_Symbol relsym) {
   switch (relsym) {
   case EQUAL:
@@ -69222,7 +69294,7 @@ template <typename Interval_Info>
 inline void
 Octagonal_Shape<T>::
 refine_fp_interval_abstract_store(
-	  Box< Interval<T, Interval_Info> >& store) const {
+          Box< Interval<T, Interval_Info> >& store) const {
 
   // Check that T is a floating point type.
   PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
@@ -69238,12 +69310,12 @@ refine_fp_interval_abstract_store(
 template <typename Temp, typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Octagonal_Shape<T>& x,
-			    const Octagonal_Shape<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
+                            const Octagonal_Shape<T>& x,
+                            const Octagonal_Shape<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
   // Dimension-compatibility check.
   if (x.space_dim != y.space_dim)
     return false;
@@ -69272,16 +69344,16 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   }
 
   return rectilinear_distance_assign(r, x.matrix, y.matrix, dir,
-				     tmp0, tmp1, tmp2);
+                                     tmp0, tmp1, tmp2);
 }
 
 /*! \relates Octagonal_Shape */
 template <typename Temp, typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Octagonal_Shape<T>& x,
-			    const Octagonal_Shape<T>& y,
-			    const Rounding_Dir dir) {
+                            const Octagonal_Shape<T>& x,
+                            const Octagonal_Shape<T>& y,
+                            const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -69293,9 +69365,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const Octagonal_Shape<T>& x,
-			    const Octagonal_Shape<T>& y,
-			    const Rounding_Dir dir) {
+                            const Octagonal_Shape<T>& x,
+                            const Octagonal_Shape<T>& y,
+                            const Rounding_Dir dir) {
   return rectilinear_distance_assign<To, To, T>(r, x, y, dir);
 }
 
@@ -69303,12 +69375,12 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Octagonal_Shape<T>& x,
-			  const Octagonal_Shape<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
+                          const Octagonal_Shape<T>& x,
+                          const Octagonal_Shape<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
   // Dimension-compatibility check.
   if (x.space_dim != y.space_dim)
     return false;
@@ -69337,16 +69409,16 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   }
 
   return euclidean_distance_assign(r, x.matrix, y.matrix, dir,
-				   tmp0, tmp1, tmp2);
+                                   tmp0, tmp1, tmp2);
 }
 
 /*! \relates Octagonal_Shape */
 template <typename Temp, typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Octagonal_Shape<T>& x,
-			  const Octagonal_Shape<T>& y,
-			  const Rounding_Dir dir) {
+                          const Octagonal_Shape<T>& x,
+                          const Octagonal_Shape<T>& y,
+                          const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -69358,9 +69430,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const Octagonal_Shape<T>& x,
-			  const Octagonal_Shape<T>& y,
-			  const Rounding_Dir dir) {
+                          const Octagonal_Shape<T>& x,
+                          const Octagonal_Shape<T>& y,
+                          const Rounding_Dir dir) {
   return euclidean_distance_assign<To, To, T>(r, x, y, dir);
 }
 
@@ -69368,12 +69440,12 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Octagonal_Shape<T>& x,
-			   const Octagonal_Shape<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
+                           const Octagonal_Shape<T>& x,
+                           const Octagonal_Shape<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
   // Dimension-compatibility check.
   if (x.space_dim != y.space_dim)
     return false;
@@ -69402,16 +69474,16 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
   }
 
   return l_infinity_distance_assign(r, x.matrix, y.matrix, dir,
-				    tmp0, tmp1, tmp2);
+                                    tmp0, tmp1, tmp2);
 }
 
 /*! \relates Octagonal_Shape */
 template <typename Temp, typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Octagonal_Shape<T>& x,
-			   const Octagonal_Shape<T>& y,
-			   const Rounding_Dir dir) {
+                           const Octagonal_Shape<T>& x,
+                           const Octagonal_Shape<T>& y,
+                           const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -69423,9 +69495,9 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const Octagonal_Shape<T>& x,
-			   const Octagonal_Shape<T>& y,
-			   const Rounding_Dir dir) {
+                           const Octagonal_Shape<T>& x,
+                           const Octagonal_Shape<T>& y,
+                           const Rounding_Dir dir) {
   return l_infinity_distance_assign<To, To, T>(r, x, y, dir);
 }
 
@@ -69463,12 +69535,12 @@ swap(Octagonal_Shape<T>& x, Octagonal_Shape<T>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_templates.hh line 1. */
 /* Octagonal_Shape class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.templates.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_templates.hh line 35. */
 #include <vector>
 #include <deque>
 #include <string>
@@ -69539,8 +69611,10 @@ Octagonal_Shape<T>::Octagonal_Shape(const Polyhedron& ph,
       for (Constraint_System::const_iterator i = ph_cs.begin(),
              ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
         const Constraint& c = *i;
-        if (c.is_strict_inequality())
-          lp.add_constraint(Linear_Expression(c) >= 0);
+        if (c.is_strict_inequality()) {
+          Linear_Expression expr(c.expression());
+          lp.add_constraint(expr >= 0);
+        }
         else
           lp.add_constraint(c);
       }
@@ -69650,7 +69724,7 @@ Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
     return;
   }
 
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typename OR_Matrix<N>::row_iterator mat_begin = matrix.row_begin();
 
   PPL_DIRTY_TEMP(N, tmp);
@@ -69674,8 +69748,8 @@ Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
         for (dimension_type i = 0; i < space_dim; ++i) {
           const Coefficient& g_i = g.coefficient(Variable(i));
           const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
           for (dimension_type j = 0; j < i; ++j) {
             const Coefficient& g_j = g.coefficient(Variable(j));
             const dimension_type dj = 2*j;
@@ -69704,8 +69778,8 @@ Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
         for (dimension_type i = 0; i < space_dim; ++i) {
           const Coefficient& g_i = g.coefficient(Variable(i));
           const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
           for (dimension_type j = 0; j < i; ++j) {
             const Coefficient& g_j = g.coefficient(Variable(j));
             const dimension_type dj = 2*j;
@@ -69754,8 +69828,8 @@ Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
         for (dimension_type i = 0; i < space_dim; ++i) {
           const Coefficient& g_i = g.coefficient(Variable(i));
           const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
           for (dimension_type j = 0; j < i; ++j) {
             const Coefficient& g_j = g.coefficient(Variable(j));
             const dimension_type dj = 2*j;
@@ -69785,8 +69859,8 @@ Octagonal_Shape<T>::Octagonal_Shape(const Generator_System& gs)
         for (dimension_type i = 0; i < space_dim; ++i) {
           const Coefficient& g_i = g.coefficient(Variable(i));
           const dimension_type di = 2*i;
-          Row_Reference x_i = *(mat_begin + di);
-          Row_Reference x_ii = *(mat_begin + (di + 1));
+          row_reference x_i = *(mat_begin + di);
+          row_reference x_ii = *(mat_begin + (di + 1));
           for (dimension_type j = 0; j < i; ++j) {
             const Coefficient& g_j = g.coefficient(Variable(j));
             const dimension_type dj = 2*j;
@@ -69938,8 +70012,8 @@ template <typename T>
 template <typename Interval_Info>
 void
 Octagonal_Shape<T>::refine_with_linear_form_inequality(
-		    const Linear_Form< Interval<T, Interval_Info> >& left,
-		    const Linear_Form< Interval<T, Interval_Info> >& right) {
+                    const Linear_Form< Interval<T, Interval_Info> >& left,
+                    const Linear_Form< Interval<T, Interval_Info> >& right) {
 
   // Check that T is a floating point type.
   PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
@@ -69991,8 +70065,8 @@ Octagonal_Shape<T>::refine_with_linear_form_inequality(
         right_w_id = i;
     }
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
   typedef Interval<T, Interval_Info> FP_Interval_Type;
@@ -70012,7 +70086,7 @@ Octagonal_Shape<T>::refine_with_linear_form_inequality(
       // The constraint has the form [a-, a+] <= [b-, b+] + [c-, c+] * x.
       // Reduce it to the constraint +/-x <= b+ - a- if [c-, c+] = +/-[1, 1].
       const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
+                              right.coefficient(Variable(right_w_id));
       if (right_w_coeff == 1) {
         const dimension_type n_right = right_w_id * 2;
         PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
@@ -70047,7 +70121,7 @@ Octagonal_Shape<T>::refine_with_linear_form_inequality(
       // The constraint has the form [b-, b+] + [c-, c+] * x <= [a-, a+]
       // Reduce it to the constraint +/-x <= a+ - b- if [c-, c+] = +/-[1, 1].
       const FP_Interval_Type& left_w_coeff =
-	                      left.coefficient(Variable(left_w_id));
+                              left.coefficient(Variable(left_w_id));
       if (left_w_coeff == 1) {
         const dimension_type n_left = left_w_id * 2;
         PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
@@ -70085,7 +70159,7 @@ Octagonal_Shape<T>::refine_with_linear_form_inequality(
       const FP_Interval_Type& left_w_coeff =
                               left.coefficient(Variable(left_w_id));
       const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
+                              right.coefficient(Variable(right_w_id));
       bool is_left_coeff_one = (left_w_coeff == 1);
       bool is_left_coeff_minus_one = (left_w_coeff == -1);
       bool is_right_coeff_one = (right_w_coeff == 1);
@@ -70311,15 +70385,15 @@ Octagonal_Shape<T>::refine_with_linear_form_inequality(
     Now move the newly computed coefficients from the main diagonal to
     their proper place, and restore +infinity on the diagonal.
   */
-  Row_Iterator m_ite = matrix.row_begin();
-  Row_Iterator m_end = matrix.row_end();
+  row_iterator m_ite = matrix.row_begin();
+  row_iterator m_end = matrix.row_end();
   for (dimension_type i = 0; m_ite != m_end; i += 2) {
-    Row_Reference upper = *m_ite;
+    row_reference upper = *m_ite;
     N& ul = upper[i];
     add_octagonal_constraint(i, i + 1, ul);
     assign_r(ul, PLUS_INFINITY, ROUND_NOT_NEEDED);
     ++m_ite;
-    Row_Reference lower = *m_ite;
+    row_reference lower = *m_ite;
     N& lr = lower[i + 1];
     add_octagonal_constraint(i + 1, i, lr);
     assign_r(lr, PLUS_INFINITY, ROUND_NOT_NEEDED);
@@ -70623,27 +70697,27 @@ Octagonal_Shape<T>::is_disjoint_from(const Octagonal_Shape& y) const {
 
   const dimension_type n_rows = matrix.num_rows();
 
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
 
-  const Row_Iterator y_begin = y.matrix.row_begin();
+  const row_iterator y_begin = y.matrix.row_begin();
 
   PPL_DIRTY_TEMP(N, neg_y_ci_cj);
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
     using namespace Implementation::Octagonal_Shapes;
     const dimension_type i = i_iter.index();
     const dimension_type ci = coherent_index(i);
     const dimension_type rs_i = i_iter.row_size();
-    Row_Reference m_i = *i_iter;
+    row_reference m_i = *i_iter;
     for (dimension_type j = 0; j < n_rows; ++j) {
       const dimension_type cj = coherent_index(j);
-      Row_Reference m_cj = *(m_begin + cj);
+      row_reference m_cj = *(m_begin + cj);
       const N& m_i_j = (j < rs_i) ? m_i[j] : m_cj[ci];
-      Row_Reference y_ci = *(y_begin + ci);
-      Row_Reference y_j = *(y_begin + j);
+      row_reference y_ci = *(y_begin + ci);
+      row_reference y_j = *(y_begin + j);
       const N& y_ci_cj = (j < rs_i) ? y_ci[cj] : y_j[i];
       neg_assign_r(neg_y_ci_cj, y_ci_cj, ROUND_UP);
       if (m_i_j < neg_y_ci_cj)
@@ -70791,16 +70865,16 @@ Octagonal_Shape<T>::frequency(const Linear_Expression& expr,
   // than `v' and are already in `le', then this is set to true.
   bool constant_v = false;
 
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
 
   PPL_DIRTY_TEMP_COEFFICIENT(val_denom);
   val_denom = 1;
 
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
     constant_v = false;
     dimension_type i = i_iter.index();
     const Variable v(i/2);
@@ -70810,8 +70884,8 @@ Octagonal_Shape<T>::frequency(const Linear_Expression& expr,
       continue;
     }
     // We check the unary constraints.
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ii = *(i_iter + 1);
+    row_reference m_i = *i_iter;
+    row_reference m_ii = *(i_iter + 1);
     const N& m_i_ii = m_i[i + 1];
     const N& m_ii_i = m_ii[i];
     if ((!is_plus_infinity(m_i_ii) && !is_plus_infinity(m_ii_i))
@@ -70832,7 +70906,7 @@ Octagonal_Shape<T>::frequency(const Linear_Expression& expr,
       PPL_ASSERT(!constant_v);
       using namespace Implementation::Octagonal_Shapes;
       const dimension_type ci = coherent_index(i);
-      for (Row_Iterator j_iter = i_iter; j_iter != m_end; j_iter += 2) {
+      for (row_iterator j_iter = i_iter; j_iter != m_end; j_iter += 2) {
         dimension_type j = j_iter.index();
         const Variable vj(j/2);
         coeff_j = le.coefficient(vj);
@@ -70842,8 +70916,8 @@ Octagonal_Shape<T>::frequency(const Linear_Expression& expr,
         const dimension_type cj = coherent_index(j);
         const dimension_type cjj = coherent_index(j + 1);
 
-        Row_Reference m_j = *(m_begin + j);
-        Row_Reference m_cj = *(m_begin + cj);
+        row_reference m_j = *(m_begin + j);
+        row_reference m_cj = *(m_begin + cj);
         const N& m_j_i = m_j[i];
         const N& m_i_j = m_cj[ci];
         if ((!is_plus_infinity(m_i_j) && !is_plus_infinity(m_j_i))
@@ -71226,7 +71300,7 @@ Octagonal_Shape<T>::relation_with(const Congruence& cg) const {
 
   // Find the lower bound for a hyperplane with direction
   // defined by the congruence.
-  Linear_Expression le = Linear_Expression(cg);
+  Linear_Expression le(cg.expression());
   PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
   PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
   bool min_included;
@@ -71567,21 +71641,21 @@ Octagonal_Shape<T>::relation_with(const Generator& g) const {
   // studying the sign of the scalar product between the generator and
   // all the constraints in the octagon.
 
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
 
   PPL_DIRTY_TEMP_COEFFICIENT(numer);
   PPL_DIRTY_TEMP_COEFFICIENT(denom);
   PPL_DIRTY_TEMP_COEFFICIENT(product);
 
   // We find in `*this' all the constraints.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) {
     dimension_type i = i_iter.index();
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ii = *(i_iter + 1);
+    row_reference m_i = *i_iter;
+    row_reference m_ii = *(i_iter + 1);
     const N& m_i_ii = m_i[i + 1];
     const N& m_ii_i = m_ii[i];
     // We have the unary constraints.
@@ -71657,10 +71731,10 @@ Octagonal_Shape<T>::relation_with(const Generator& g) const {
   }
 
   // We have the binary constraints.
-  for (Row_Iterator i_iter = m_begin ; i_iter != m_end; i_iter += 2) {
+  for (row_iterator i_iter = m_begin ; i_iter != m_end; i_iter += 2) {
     dimension_type i = i_iter.index();
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ii = *(i_iter + 1);
+    row_reference m_i = *i_iter;
+    row_reference m_ii = *(i_iter + 1);
     for (dimension_type j = 0; j < i; j += 2) {
       const N& m_i_j = m_i[j];
       const N& m_ii_jj = m_ii[j + 1];
@@ -71822,15 +71896,15 @@ Octagonal_Shape<T>::strong_closure_assign() const {
   // is going to be modified by the closure algorithm.
   Octagonal_Shape& x = const_cast<Octagonal_Shape<T>&>(*this);
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
 
   const dimension_type n_rows = x.matrix.num_rows();
-  const Row_Iterator m_begin = x.matrix.row_begin();
-  const Row_Iterator m_end = x.matrix.row_end();
+  const row_iterator m_begin = x.matrix.row_begin();
+  const row_iterator m_end = x.matrix.row_end();
 
   // Fill the main diagonal with zeros.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
+  for (row_iterator i = m_begin; i != m_end; ++i) {
     PPL_ASSERT(is_plus_infinity((*i)[i.index()]));
     assign_r((*i)[i.index()], 0, ROUND_NOT_NEEDED);
   }
@@ -71851,17 +71925,17 @@ Octagonal_Shape<T>::strong_closure_assign() const {
   std::vector<N> vec_ck(n_rows);
   PPL_DIRTY_TEMP(N, sum1);
   PPL_DIRTY_TEMP(N, sum2);
-  Row_Reference x_k;
-  Row_Reference x_ck;
-  Row_Reference x_i;
-  Row_Reference x_ci;
+  row_reference x_k;
+  row_reference x_ck;
+  row_reference x_i;
+  row_reference x_ci;
 
   // Since the index `j' of the inner loop will go from 0 up to `i',
   // the three nested loops have to be executed twice.
   for (int twice = 0; twice < 2; ++twice) {
 
-    Row_Iterator x_k_iter = m_begin;
-    Row_Iterator x_i_iter = m_begin;
+    row_iterator x_k_iter = m_begin;
+    row_iterator x_i_iter = m_begin;
     for (dimension_type k = 0; k < n_rows; k += 2) {
       const dimension_type ck = k + 1;
       // Re-initialize the element iterator.
@@ -71936,7 +72010,7 @@ Octagonal_Shape<T>::strong_closure_assign() const {
 
   // Check for emptiness: the octagon is empty if and only if there is a
   // negative value in the main diagonal.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
+  for (row_iterator i = m_begin; i != m_end; ++i) {
     N& x_i_i = (*i)[i.index()];
     if (sgn(x_i_i) < 0) {
       x.set_empty();
@@ -72051,14 +72125,14 @@ Octagonal_Shape<T>
 
   Octagonal_Shape& x = const_cast<Octagonal_Shape<T>&>(*this);
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
 
-  const Row_Iterator m_begin = x.matrix.row_begin();
-  const Row_Iterator m_end = x.matrix.row_end();
+  const row_iterator m_begin = x.matrix.row_begin();
+  const row_iterator m_end = x.matrix.row_end();
 
   // Fill the main diagonal with zeros.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
+  for (row_iterator i = m_begin; i != m_end; ++i) {
     PPL_ASSERT(is_plus_infinity((*i)[i.index()]));
     assign_r((*i)[i.index()], 0, ROUND_NOT_NEEDED);
   }
@@ -72067,27 +72141,27 @@ Octagonal_Shape<T>
   // Step 1: Improve all constraints on variable `var'.
   const dimension_type v = 2*var.id();
   const dimension_type cv = v + 1;
-  Row_Iterator v_iter = m_begin + v;
-  Row_Iterator cv_iter = v_iter + 1;
-  Row_Reference x_v = *v_iter;
-  Row_Reference x_cv = *cv_iter;
+  row_iterator v_iter = m_begin + v;
+  row_iterator cv_iter = v_iter + 1;
+  row_reference x_v = *v_iter;
+  row_reference x_cv = *cv_iter;
   const dimension_type rs_v = v_iter.row_size();
   const dimension_type n_rows = x.matrix.num_rows();
   PPL_DIRTY_TEMP(N, sum);
   using namespace Implementation::Octagonal_Shapes;
-  for (Row_Iterator k_iter = m_begin; k_iter != m_end; ++k_iter) {
+  for (row_iterator k_iter = m_begin; k_iter != m_end; ++k_iter) {
     const dimension_type k = k_iter.index();
     const dimension_type ck = coherent_index(k);
     const dimension_type rs_k = k_iter.row_size();
-    Row_Reference x_k = *k_iter;
-    Row_Reference x_ck = (k % 2 != 0) ? *(k_iter-1) : *(k_iter + 1);
+    row_reference x_k = *k_iter;
+    row_reference x_ck = (k % 2 != 0) ? *(k_iter-1) : *(k_iter + 1);
 
-    for (Row_Iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
+    for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
       const dimension_type i = i_iter.index();
       const dimension_type ci = coherent_index(i);
       const dimension_type rs_i = i_iter.row_size();
-      Row_Reference x_i = *i_iter;
-      Row_Reference x_ci = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
+      row_reference x_i = *i_iter;
+      row_reference x_ci = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1);
 
       const N& x_i_k = (k < rs_i) ? x_i[k] : x_ck[ci];
       if (!is_plus_infinity(x_i_k)) {
@@ -72125,18 +72199,18 @@ Octagonal_Shape<T>
 
   // Step 2: improve the other bounds by using the precise bounds
   // for the constraints on `var'.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) {
     const dimension_type i = i_iter.index();
     const dimension_type ci = coherent_index(i);
     const dimension_type rs_i = i_iter.row_size();
-    Row_Reference x_i = *i_iter;
+    row_reference x_i = *i_iter;
     const N& x_i_v = (v < rs_i) ? x_i[v] : x_cv[ci];
     // TODO: see if it is possible to optimize this inner loop
     // by splitting it into several parts, so as to avoid
     // conditional expressions.
     for (dimension_type j = 0; j < n_rows; ++j) {
       const dimension_type cj = coherent_index(j);
-      Row_Reference x_cj = *(m_begin + cj);
+      row_reference x_cj = *(m_begin + cj);
       N& x_i_j = (j < rs_i) ? x_i[j] : x_cj[ci];
       if (!is_plus_infinity(x_i_v)) {
         const N& x_v_j = (j < rs_v) ? x_v[j] : x_cj[cv];
@@ -72158,7 +72232,7 @@ Octagonal_Shape<T>
 
   // Check for emptiness: the octagon is empty if and only if there is a
   // negative value on the main diagonal.
-  for (Row_Iterator i = m_begin; i != m_end; ++i) {
+  for (row_iterator i = m_begin; i != m_end; ++i) {
     N& x_i_i = (*i)[i.index()];
     if (sgn(x_i_i) < 0) {
       x.set_empty();
@@ -72515,7 +72589,7 @@ Octagonal_Shape<T>::difference_assign(const Octagonal_Shape& y) {
     if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
       continue;
     Octagonal_Shape z = x;
-    const Linear_Expression e = Linear_Expression(c);
+    const Linear_Expression e(c.expression());
     z.add_constraint(e <= 0);
     if (!z.is_empty())
       new_oct.upper_bound_assign(z);
@@ -72927,12 +73001,12 @@ Octagonal_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
   // We create a new matrix with the new space dimension.
   OR_Matrix<N> x(new_space_dim);
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
 
-  Row_Iterator m_begin = x.row_begin();
+  row_iterator m_begin = x.row_begin();
 
-  for (Row_Iterator i_iter = matrix.row_begin(), i_end = matrix.row_end();
+  for (row_iterator i_iter = matrix.row_begin(), i_end = matrix.row_end();
        i_iter != i_end; i_iter += 2) {
     dimension_type new_i;
     dimension_type i = i_iter.index()/2;
@@ -72940,12 +73014,12 @@ Octagonal_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
     // the `matrix' that refer to both mapped variables,
     // the variable `i' and `j'.
     if (pfunc.maps(i, new_i)) {
-      Row_Reference r_i = *i_iter;
-      Row_Reference r_ii = *(i_iter + 1);
+      row_reference r_i = *i_iter;
+      row_reference r_ii = *(i_iter + 1);
       dimension_type double_new_i = 2*new_i;
-      Row_Iterator x_iter = m_begin + double_new_i;
-      Row_Reference x_i = *x_iter;
-      Row_Reference x_ii = *(x_iter + 1);
+      row_iterator x_iter = m_begin + double_new_i;
+      row_reference x_i = *x_iter;
+      row_reference x_ii = *(x_iter + 1);
       for (dimension_type j = 0; j <= i; ++j) {
         dimension_type new_j;
         // If also the second variable is mapped, we work.
@@ -72963,9 +73037,9 @@ Octagonal_Shape<T>::map_space_dimensions(const Partial_Function& pfunc) {
             assign_or_swap(x_i[double_new_j + 1], r_i[dj + 1]);
           }
           else {
-            Row_Iterator x_j_iter = m_begin + double_new_j;
-            Row_Reference x_j = *x_j_iter;
-            Row_Reference x_jj = *(x_j_iter + 1);
+            row_iterator x_j_iter = m_begin + double_new_j;
+            row_reference x_j = *x_j_iter;
+            row_reference x_jj = *(x_j_iter + 1);
             assign_or_swap(x_jj[double_new_i + 1], r_i[dj]);
             assign_or_swap(x_jj[double_new_i], r_ii[dj]);
             assign_or_swap(x_j[double_new_i + 1], r_i[dj + 1]);
@@ -73124,15 +73198,15 @@ Octagonal_Shape<T>
 
     typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
     typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
-    typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-    typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+    typedef typename OR_Matrix<N>::row_iterator row_iterator;
+    typedef typename OR_Matrix<N>::row_reference_type row_reference;
     Row_iterator m_begin = matrix.row_begin();
     // Select the cell to be modified for the "<=" part of the constraint.
     Row_iterator i_iter = m_begin + i;
     Row_reference m_i = *i_iter;
     OR_Matrix<N>& lo_mat = limiting_octagon.matrix;
-    Row_Iterator lo_iter = lo_mat.row_begin() + i;
-    Row_Reference lo_m_i = *lo_iter;
+    row_iterator lo_iter = lo_mat.row_begin() + i;
+    row_reference lo_m_i = *lo_iter;
     N& lo_m_i_j = lo_m_i[j];
     if (coeff < 0)
       neg_assign(coeff);
@@ -73155,7 +73229,7 @@ Octagonal_Shape<T>
             --lo_iter;
           }
           Row_reference m_ci = *i_iter;
-          Row_Reference lo_m_ci = *lo_iter;
+          row_reference lo_m_ci = *lo_iter;
           // Select the right column of the cell.
           using namespace Implementation::Octagonal_Shapes;
           dimension_type cj = coherent_index(j);
@@ -73721,12 +73795,12 @@ Octagonal_Shape<T>::refine(const Variable var,
   // - If t == 0, then expr == b, with `b' a constant;
   // - If t == 1, then expr == a*j + b, where `j != v';
   // - If t == 2, then `expr' is of the general form.
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
+  const row_iterator m_begin = matrix.row_begin();
   const dimension_type n_var = 2*var_id;
   PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
   neg_assign(minus_denom, denominator);
@@ -74079,14 +74153,14 @@ Octagonal_Shape<T>::refine(const Variable var,
         PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
         // Note: indices above `w_id' can be disregarded, as they all have
         // a zero coefficient in `expr'.
-        for (Row_Iterator m_iter = m_begin,
+        for (row_iterator m_iter = m_begin,
                m_iter_end = m_begin + (2 * w_id + 2);
              m_iter != m_iter_end; ) {
           const dimension_type n_i = m_iter.index();
           const dimension_type id = n_i/2;
-          Row_Reference m_i = *m_iter;
+          row_reference m_i = *m_iter;
           ++m_iter;
-          Row_Reference m_ci = *m_iter;
+          row_reference m_ci = *m_iter;
           ++m_iter;
           const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
           const int sign_i = sgn(sc_i);
@@ -74164,14 +74238,14 @@ Octagonal_Shape<T>::refine(const Variable var,
         PPL_DIRTY_TEMP(N, coeff_i);
         PPL_DIRTY_TEMP(N, approx_i);
         PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
-        for (Row_Iterator m_iter = m_begin,
+        for (row_iterator m_iter = m_begin,
                m_iter_end = m_begin + (2 * w_id + 2);
              m_iter != m_iter_end; ) {
           const dimension_type n_i = m_iter.index();
           const dimension_type id = n_i/2;
-          Row_Reference m_i = *m_iter;
+          row_reference m_i = *m_iter;
           ++m_iter;
-          Row_Reference m_ci = *m_iter;
+          row_reference m_ci = *m_iter;
           ++m_iter;
           const Coefficient& sc_i = sc_expr.coefficient(Variable(id));
           const int sign_i = sgn(sc_i);
@@ -74289,8 +74363,8 @@ Octagonal_Shape<T>::affine_image(const Variable var,
     --w_id;
   }
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
   using std::swap;
@@ -74341,12 +74415,12 @@ Octagonal_Shape<T>::affine_image(const Variable var,
         div_round_up(minus_d, b, minus_denom);
         if (sign_symmetry)
           swap(d, minus_d);
-        const Row_Iterator m_begin = matrix.row_begin();
-        const Row_Iterator m_end = matrix.row_end();
-        Row_Iterator m_iter = m_begin + n_var;
-        Row_Reference m_v = *m_iter;
+        const row_iterator m_begin = matrix.row_begin();
+        const row_iterator m_end = matrix.row_end();
+        row_iterator m_iter = m_begin + n_var;
+        row_reference m_v = *m_iter;
         ++m_iter;
-        Row_Reference m_cv = *m_iter;
+        row_reference m_cv = *m_iter;
         ++m_iter;
         // NOTE: delay update of unary constraints on `var'.
         for (dimension_type j = n_var; j-- > 0; ) {
@@ -74358,7 +74432,7 @@ Octagonal_Shape<T>::affine_image(const Variable var,
             swap(m_v_j, m_cv_j);
         }
         for ( ; m_iter != m_end; ++m_iter) {
-          Row_Reference m_i = *m_iter;
+          row_reference m_i = *m_iter;
           N& m_i_v = m_i[n_var];
           add_assign_r(m_i_v, m_i_v, d, ROUND_UP);
           N& m_i_cv = m_i[n_var + 1];
@@ -74460,7 +74534,7 @@ Octagonal_Shape<T>::affine_image(const Variable var,
   PPL_DIRTY_TEMP_COEFFICIENT(minus_sc_i);
   // Note: indices above `w' can be disregarded, as they all have
   // a zero coefficient in `sc_expr'.
-  const Row_Iterator m_begin = matrix.row_begin();
+  const row_iterator m_begin = matrix.row_begin();
   for (Row_iterator m_iter = m_begin, m_iter_end = m_begin + (2 * w_id + 2);
        m_iter != m_iter_end; ) {
     const dimension_type n_i = m_iter.index();
@@ -74677,8 +74751,8 @@ Octagonal_Shape<T>::affine_form_image(const Variable var,
         w_id = i;
     }
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
   typedef Interval<T, Interval_Info> FP_Interval_Type;
@@ -74732,12 +74806,12 @@ Octagonal_Shape<T>::affine_form_image(const Variable var,
         // `b_ub' or subtracting the value `b_lb'.
         if (is_w_coeff_minus_one)
           swap(b_ub, b_mlb);
-        const Row_Iterator m_begin = matrix.row_begin();
-        const Row_Iterator m_end = matrix.row_end();
-        Row_Iterator m_iter = m_begin + n_var;
-        Row_Reference m_v = *m_iter;
+        const row_iterator m_begin = matrix.row_begin();
+        const row_iterator m_end = matrix.row_end();
+        row_iterator m_iter = m_begin + n_var;
+        row_reference m_v = *m_iter;
         ++m_iter;
-        Row_Reference m_cv = *m_iter;
+        row_reference m_cv = *m_iter;
         ++m_iter;
         // NOTE: delay update of unary constraints on `var'.
         for (dimension_type j = n_var; j-- > 0; ) {
@@ -74749,7 +74823,7 @@ Octagonal_Shape<T>::affine_form_image(const Variable var,
             swap(m_v_j, m_cv_j);
         }
         for ( ; m_iter != m_end; ++m_iter) {
-          Row_Reference m_i = *m_iter;
+          row_reference m_i = *m_iter;
           N& m_i_v = m_i[n_var];
           add_assign_r(m_i_v, m_i_v, b_ub, ROUND_UP);
           N& m_i_cv = m_i[n_var + 1];
@@ -74817,13 +74891,13 @@ Octagonal_Shape<T>::affine_form_image(const Variable var,
   // Declare temporaries outside the loop.
   PPL_DIRTY_TEMP(N, upper_bound);
 
-  Row_Iterator m_iter = matrix.row_begin();
+  row_iterator m_iter = matrix.row_begin();
   m_iter += n_var;
-  Row_Reference var_ite = *m_iter;
+  row_reference var_ite = *m_iter;
   ++m_iter;
-  Row_Reference var_cv_ite = *m_iter;
+  row_reference var_cv_ite = *m_iter;
   ++m_iter;
-  Row_Iterator m_end = matrix.row_end();
+  row_iterator m_end = matrix.row_end();
 
   // Update binary constraints on var FIRST.
   for (dimension_type curr_var = var_id,
@@ -74840,9 +74914,9 @@ Octagonal_Shape<T>::affine_form_image(const Variable var,
     n_curr_var -= 2;
   }
   for (dimension_type curr_var = var_id + 1; m_iter != m_end; ++m_iter) {
-    Row_Reference m_v_ite = *m_iter;
+    row_reference m_v_ite = *m_iter;
     ++m_iter;
-    Row_Reference m_cv_ite = *m_iter;
+    row_reference m_cv_ite = *m_iter;
     Variable current(curr_var);
     linear_form_upper_bound(lf + current, upper_bound);
     assign_r(m_cv_ite[n_var], upper_bound, ROUND_NOT_NEEDED);
@@ -75148,13 +75222,13 @@ Octagonal_Shape<T>
     --w_id;
   }
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
   const dimension_type n_var = 2*var_id;
   const Coefficient& b = expr.inhomogeneous_term();
   PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
@@ -75214,16 +75288,16 @@ Octagonal_Shape<T>
               // Translate all the constraints of the form `v - w <= cost'
               // into the constraint `v - w <= cost + b/denominator';
               // forget each constraint `w - v <= cost1'.
-              Row_Iterator m_iter = m_begin + n_var;
-              Row_Reference m_v = *m_iter;
+              row_iterator m_iter = m_begin + n_var;
+              row_reference m_v = *m_iter;
               N& m_v_cv = m_v[n_var + 1];
               ++m_iter;
-              Row_Reference m_cv = *m_iter;
+              row_reference m_cv = *m_iter;
               N& m_cv_v = m_cv[n_var];
               ++m_iter;
               // NOTE: delay update of m_v_cv and m_cv_v.
               for ( ; m_iter != m_end; ++m_iter) {
-                Row_Reference m_i = *m_iter;
+                row_reference m_i = *m_iter;
                 N& m_i_v = m_i[n_var];
                 add_assign_r(m_i_v, m_i_v, d, ROUND_UP);
                 assign_r(m_i[n_var + 1], PLUS_INFINITY, ROUND_NOT_NEEDED);
@@ -75282,16 +75356,16 @@ Octagonal_Shape<T>
               // Translate each constraint `w - v <= cost'
               // into the constraint `w - v <= cost - b/denominator';
               // forget each constraint `v - w <= cost1'.
-              Row_Iterator m_iter = m_begin + n_var;
-              Row_Reference m_v = *m_iter;
+              row_iterator m_iter = m_begin + n_var;
+              row_reference m_v = *m_iter;
               N& m_v_cv = m_v[n_var + 1];
               ++m_iter;
-              Row_Reference m_cv = *m_iter;
+              row_reference m_cv = *m_iter;
               N& m_cv_v = m_cv[n_var];
               ++m_iter;
               // NOTE: delay update of m_v_cv and m_cv_v.
               for ( ; m_iter != m_end; ++m_iter) {
-                Row_Reference m_i = *m_iter;
+                row_reference m_i = *m_iter;
                 assign_r(m_i[n_var], PLUS_INFINITY, ROUND_NOT_NEEDED);
                 add_assign_r(m_i[n_var + 1], m_i[n_var + 1], d, ROUND_UP);
               }
@@ -75817,12 +75891,12 @@ Octagonal_Shape<T>::bounded_affine_image(const Variable var,
     --w_id;
   }
 
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
+  const row_iterator m_begin = matrix.row_begin();
   const dimension_type n_var = 2*var_id;
   const Coefficient& b = lb_expr.inhomogeneous_term();
   PPL_DIRTY_TEMP_COEFFICIENT(minus_denom);
@@ -76387,17 +76461,17 @@ Octagonal_Shape<T>::constraints() const {
     return cs;
   }
 
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
 
-  Row_Iterator m_begin = matrix.row_begin();
-  Row_Iterator m_end = matrix.row_end();
+  row_iterator m_begin = matrix.row_begin();
+  row_iterator m_end = matrix.row_end();
 
   PPL_DIRTY_TEMP_COEFFICIENT(a);
   PPL_DIRTY_TEMP_COEFFICIENT(b);
 
   // Go through all the unary constraints in `matrix'.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
     const dimension_type i = i_iter.index();
     const Variable x(i/2);
     const N& c_i_ii = (*i_iter)[i + 1];
@@ -76426,11 +76500,11 @@ Octagonal_Shape<T>::constraints() const {
     }
   }
   //  Go through all the binary constraints in `matrix'.
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
     const dimension_type i = i_iter.index();
-    Row_Reference r_i = *i_iter;
+    row_reference r_i = *i_iter;
     ++i_iter;
-    Row_Reference r_ii = *i_iter;
+    row_reference r_ii = *i_iter;
     ++i_iter;
     const Variable y(i/2);
     for (dimension_type j = 0; j < i; j += 2) {
@@ -76505,22 +76579,22 @@ Octagonal_Shape<T>::expand_space_dimension(Variable var, dimension_type m) {
   // For each constraints involving variable `var', we add a
   // similar constraint with the new variable substituted for
   // variable `var'.
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   typedef typename OR_Matrix<N>::const_row_iterator Row_iterator;
   typedef typename OR_Matrix<N>::const_row_reference_type Row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
-  const Row_Iterator m_end = matrix.row_end();
+  const row_iterator m_begin = matrix.row_begin();
+  const row_iterator m_end = matrix.row_end();
   const dimension_type n_var = 2*var_id;
   Row_iterator v_iter = m_begin + n_var;
   Row_reference m_v = *v_iter;
   Row_reference m_cv = *(v_iter + 1);
 
-  for (Row_Iterator i_iter = m_begin + old_num_rows; i_iter != m_end;
+  for (row_iterator i_iter = m_begin + old_num_rows; i_iter != m_end;
        i_iter += 2) {
-    Row_Reference m_i = *i_iter;
-    Row_Reference m_ci = *(i_iter + 1);
+    row_reference m_i = *i_iter;
+    row_reference m_ci = *(i_iter + 1);
     const dimension_type i = i_iter.index();
     const dimension_type ci = i + 1;
     m_i[ci] = m_v[n_var + 1];
@@ -76530,8 +76604,8 @@ Octagonal_Shape<T>::expand_space_dimension(Variable var, dimension_type m) {
       m_ci[j] = m_cv[j];
     }
     for (dimension_type j = n_var + 2; j < old_num_rows; ++j) {
-      Row_Iterator j_iter = m_begin + j;
-      Row_Reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
+      row_iterator j_iter = m_begin + j;
+      row_reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
       m_i[j] = m_cj[n_var + 1];
       m_ci[j] = m_cj[n_var];
     }
@@ -76569,24 +76643,24 @@ Octagonal_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
   // to variable `dest' by taking the join of their value with the
   // value of the corresponding elements in the row and column of the
   // variable `vars'.
-  typedef typename OR_Matrix<N>::row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
 
-  const Row_Iterator m_begin = matrix.row_begin();
+  const row_iterator m_begin = matrix.row_begin();
 
   strong_closure_assign();
   const dimension_type n_rows = matrix.num_rows();
   const dimension_type n_dest = 2*dest.id();
-  Row_Iterator v_iter = m_begin + n_dest;
-  Row_Reference m_v = *v_iter;
-  Row_Reference m_cv = *(v_iter + 1);
+  row_iterator v_iter = m_begin + n_dest;
+  row_reference m_v = *v_iter;
+  row_reference m_cv = *(v_iter + 1);
   for (Variables_Set::const_iterator i = vars.begin(),
          vs_end = vars.end(); i != vs_end; ++i) {
     const dimension_type tbf_id = *i;
     const dimension_type tbf_var = 2*tbf_id;
-    Row_Iterator tbf_iter = m_begin + tbf_var;
-    Row_Reference m_tbf = *tbf_iter;
-    Row_Reference m_ctbf = *(tbf_iter + 1);
+    row_iterator tbf_iter = m_begin + tbf_var;
+    row_reference m_tbf = *tbf_iter;
+    row_reference m_ctbf = *(tbf_iter + 1);
     max_assign(m_v[n_dest + 1], m_tbf[tbf_var + 1]);
     max_assign(m_cv[n_dest], m_ctbf[tbf_var]);
 
@@ -76603,9 +76677,9 @@ Octagonal_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
     }
     for (dimension_type j = min_id + 2; j < max_id; ++j) {
       const dimension_type cj = coherent_index(j);
-      Row_Iterator j_iter = m_begin + j;
-      Row_Reference m_j = *j_iter;
-      Row_Reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
+      row_iterator j_iter = m_begin + j;
+      row_reference m_j = *j_iter;
+      row_reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
       if (n_dest == min_id) {
         max_assign(m_cj[n_dest + 1], m_tbf[j]);
         max_assign(m_cj[n_dest], m_ctbf[j]);
@@ -76620,9 +76694,9 @@ Octagonal_Shape<T>::fold_space_dimensions(const Variables_Set& vars,
       }
     }
     for (dimension_type j = max_id + 2; j < n_rows; ++j) {
-      Row_Iterator j_iter = m_begin + j;
-      Row_Reference m_j = *j_iter;
-      Row_Reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
+      row_iterator j_iter = m_begin + j;
+      row_reference m_j = *j_iter;
+      row_reference m_cj = (j % 2 != 0) ? *(j_iter-1) : *(j_iter + 1);
       max_assign(m_cj[n_dest + 1], m_cj[tbf_var + 1]);
       max_assign(m_cj[n_dest], m_cj[tbf_var]);
       max_assign(m_j[n_dest], m_j[tbf_var]);
@@ -76681,21 +76755,21 @@ Octagonal_Shape<T>::upper_bound_assign_if_exact(const Octagonal_Shape& y) {
   PPL_DIRTY_TEMP(N, temp_zero);
   assign_r(temp_zero, 0, ROUND_NOT_NEEDED);
 
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
   const dimension_type n_rows = x.matrix.num_rows();
-  const Row_Iterator x_m_begin = x.matrix.row_begin();
-  const Row_Iterator y_m_begin = y.matrix.row_begin();
-  const Row_Iterator ub_m_begin = ub.matrix.row_begin();
+  const row_iterator x_m_begin = x.matrix.row_begin();
+  const row_iterator y_m_begin = y.matrix.row_begin();
+  const row_iterator ub_m_begin = ub.matrix.row_begin();
 
   for (dimension_type i = n_rows; i-- > 0; ) {
     const Bit_Row& x_non_red_i = x_non_red[i];
     using namespace Implementation::Octagonal_Shapes;
     const dimension_type ci = coherent_index(i);
     const dimension_type row_size_i = OR_Matrix<N>::row_size(i);
-    Row_Reference x_i = *(x_m_begin + i);
-    Row_Reference y_i = *(y_m_begin + i);
-    Row_Reference ub_i = *(ub_m_begin + i);
+    row_reference x_i = *(x_m_begin + i);
+    row_reference y_i = *(y_m_begin + i);
+    row_reference ub_i = *(ub_m_begin + i);
     const N& ub_i_ci = ub_i[ci];
     for (dimension_type j = row_size_i; j-- > 0; ) {
       // Check redundancy of x_i_j.
@@ -76707,15 +76781,15 @@ Octagonal_Shape<T>::upper_bound_assign_if_exact(const Octagonal_Shape& y) {
         continue;
       const dimension_type cj = coherent_index(j);
       const dimension_type row_size_cj = OR_Matrix<N>::row_size(cj);
-      Row_Reference ub_cj = *(ub_m_begin + cj);
+      row_reference ub_cj = *(ub_m_begin + cj);
       const N& ub_cj_j = ub_cj[j];
       for (dimension_type k = 0; k < n_rows; ++k) {
         const Bit_Row& y_non_red_k = y_non_red[k];
         const dimension_type ck = coherent_index(k);
         const dimension_type row_size_k = OR_Matrix<N>::row_size(k);
-        Row_Reference x_k = *(x_m_begin + k);
-        Row_Reference y_k = *(y_m_begin + k);
-        Row_Reference ub_k = *(ub_m_begin + k);
+        row_reference x_k = *(x_m_begin + k);
+        row_reference y_k = *(y_m_begin + k);
+        row_reference ub_k = *(ub_m_begin + k);
         const N& ub_k_ck = ub_k[ck];
         // Be careful: for each index h, the diagonal element m[h][h]
         // is (by convention) +infty in our implementation; however,
@@ -76738,7 +76812,7 @@ Octagonal_Shape<T>::upper_bound_assign_if_exact(const Octagonal_Shape& y) {
           if (y_k_ell >= x_k[ell])
             continue;
           const dimension_type cell = coherent_index(ell);
-          Row_Reference ub_cell = *(ub_m_begin + cell);
+          row_reference ub_cell = *(ub_m_begin + cell);
           const N& ub_i_ell
             = (i == ell)
             ? temp_zero
@@ -76867,21 +76941,21 @@ Octagonal_Shape<T>
   PPL_DIRTY_TEMP(N, temp_two);
   assign_r(temp_two, 2, ROUND_NOT_NEEDED);
 
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
   const dimension_type n_rows = tx.matrix.num_rows();
-  const Row_Iterator tx_m_begin = tx.matrix.row_begin();
-  const Row_Iterator ty_m_begin = ty.matrix.row_begin();
-  const Row_Iterator ub_m_begin = ub.matrix.row_begin();
+  const row_iterator tx_m_begin = tx.matrix.row_begin();
+  const row_iterator ty_m_begin = ty.matrix.row_begin();
+  const row_iterator ub_m_begin = ub.matrix.row_begin();
 
   for (dimension_type i = n_rows; i-- > 0; ) {
     const Bit_Row& tx_non_red_i = tx_non_red[i];
     using namespace Implementation::Octagonal_Shapes;
     const dimension_type ci = coherent_index(i);
     const dimension_type row_size_i = OR_Matrix<N>::row_size(i);
-    Row_Reference tx_i = *(tx_m_begin + i);
-    Row_Reference ty_i = *(ty_m_begin + i);
-    Row_Reference ub_i = *(ub_m_begin + i);
+    row_reference tx_i = *(tx_m_begin + i);
+    row_reference ty_i = *(ty_m_begin + i);
+    row_reference ub_i = *(ub_m_begin + i);
     const N& ub_i_ci = ub_i[ci];
     for (dimension_type j = row_size_i; j-- > 0; ) {
       // Check redundancy of tx_i_j.
@@ -76895,15 +76969,15 @@ Octagonal_Shape<T>
       if (lhs_i_j > ty_i[j])
         continue;
       const dimension_type row_size_cj = OR_Matrix<N>::row_size(cj);
-      Row_Reference ub_cj = *(ub_m_begin + cj);
+      row_reference ub_cj = *(ub_m_begin + cj);
       const N& ub_cj_j = ub_cj[j];
       for (dimension_type k = 0; k < n_rows; ++k) {
         const Bit_Row& ty_non_red_k = ty_non_red[k];
         const dimension_type ck = coherent_index(k);
         const dimension_type row_size_k = OR_Matrix<N>::row_size(k);
-        Row_Reference tx_k = *(tx_m_begin + k);
-        Row_Reference ty_k = *(ty_m_begin + k);
-        Row_Reference ub_k = *(ub_m_begin + k);
+        row_reference tx_k = *(tx_m_begin + k);
+        row_reference ty_k = *(ty_m_begin + k);
+        row_reference ub_k = *(ub_m_begin + k);
         const N& ub_k_ck = ub_k[ck];
         // Be careful: for each index h, the diagonal element m[h][h]
         // is (by convention) +infty in our implementation; however,
@@ -76928,7 +77002,7 @@ Octagonal_Shape<T>
           add_assign_r(lhs_k_ell, ty_k_ell, eps_k_ell, ROUND_NOT_NEEDED);
           if (lhs_k_ell > tx_k[ell])
             continue;
-          Row_Reference ub_cell = *(ub_m_begin + cell);
+          row_reference ub_cell = *(ub_m_begin + cell);
           const N& ub_i_ell
             = (i == ell)
             ? temp_zero
@@ -77041,12 +77115,12 @@ Octagonal_Shape<T>
   const Variables_Set::const_iterator v_begin = vars.begin();
   const Variables_Set::const_iterator v_end = vars.end();
   PPL_ASSERT(v_begin != v_end);
-  typedef typename OR_Matrix<N>::row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::row_reference_type row_reference;
   for (Variables_Set::const_iterator v_i = v_begin; v_i != v_end; ++v_i) {
     const dimension_type i = 2 * (*v_i);
     const dimension_type ci = i + 1;
-    Row_Reference m_i = matrix[i];
-    Row_Reference m_ci = matrix[ci];
+    row_reference m_i = matrix[i];
+    row_reference m_ci = matrix[ci];
 
     // Unary constraints: should be even integers.
     N& m_i_ci = m_i[ci];
@@ -77140,21 +77214,21 @@ IO_Operators::operator<<(std::ostream& s, const Octagonal_Shape<T>& oct) {
   }
 
   typedef typename Octagonal_Shape<T>::coefficient_type N;
-  typedef typename OR_Matrix<N>::const_row_iterator Row_Iterator;
-  typedef typename OR_Matrix<N>::const_row_reference_type Row_Reference;
+  typedef typename OR_Matrix<N>::const_row_iterator row_iterator;
+  typedef typename OR_Matrix<N>::const_row_reference_type row_reference;
 
   // Records whether or not we still have to print the first constraint.
   bool first = true;
 
-  Row_Iterator m_begin = oct.matrix.row_begin();
-  Row_Iterator m_end = oct.matrix.row_end();
+  row_iterator m_begin = oct.matrix.row_begin();
+  row_iterator m_end = oct.matrix.row_end();
 
   // Temporaries.
   PPL_DIRTY_TEMP(N, negation);
   PPL_DIRTY_TEMP(N, half);
   // Go through all the unary constraints.
   // (Note: loop iterator is incremented in the loop body.)
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
     const dimension_type i = i_iter.index();
     const Variable v_i(i/2);
     const N& c_i_ii = (*i_iter)[i + 1];
@@ -77214,12 +77288,12 @@ IO_Operators::operator<<(std::ostream& s, const Octagonal_Shape<T>& oct) {
 
   // Go through all the binary constraints.
   // (Note: loop iterator is incremented in the loop body.)
-  for (Row_Iterator i_iter = m_begin; i_iter != m_end; ) {
+  for (row_iterator i_iter = m_begin; i_iter != m_end; ) {
     const dimension_type i = i_iter.index();
     const Variable v_i(i/2);
-    Row_Reference r_i = *i_iter;
+    row_reference r_i = *i_iter;
     ++i_iter;
-    Row_Reference r_ii = *i_iter;
+    row_reference r_ii = *i_iter;
     ++i_iter;
 
     for (dimension_type j = 0; j < i; j += 2) {
@@ -77547,9 +77621,9 @@ Octagonal_Shape<T>::throw_invalid_argument(const char* method,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Octagonal_Shape.defs.hh line 2323. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Octagonal_Shape_defs.hh line 2323. */
 
-/* Automatically generated from PPL source file ../src/BD_Shape.inlines.hh line 38. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_inlines.hh line 38. */
 #include <vector>
 #include <iostream>
 #include <algorithm>
@@ -77562,7 +77636,7 @@ BD_Shape<T>::max_space_dimension() {
   // One dimension is reserved to have a value of type dimension_type
   // that does not represent a legal dimension.
   return std::min(DB_Matrix<N>::max_num_rows() - 1,
-		  DB_Matrix<N>::max_num_columns() - 1);
+                  DB_Matrix<N>::max_num_columns() - 1);
 }
 
 template <typename T>
@@ -77628,7 +77702,7 @@ BD_Shape<T>::reset_shortest_path_reduced() {
 template <typename T>
 inline
 BD_Shape<T>::BD_Shape(const dimension_type num_dimensions,
-		      const Degenerate_Element kind)
+                      const Degenerate_Element kind)
   : dbm(num_dimensions + 1), status(), redundancy_dbm() {
   if (kind == EMPTY)
     set_empty();
@@ -77674,7 +77748,7 @@ template <typename T>
 inline void
 BD_Shape<T>::add_constraints(const Constraint_System& cs) {
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     add_constraint(*i);
 }
 
@@ -77688,7 +77762,7 @@ template <typename T>
 inline void
 BD_Shape<T>::add_congruences(const Congruence_System& cgs) {
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i)
+         cgs_end = cgs.end(); i != cgs_end; ++i)
     add_congruence(*i);
 }
 
@@ -77719,7 +77793,7 @@ BD_Shape<T>::refine_with_constraints(const Constraint_System& cs) {
                            "cs and *this are space-dimension incompatible");
 
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
     refine_no_check(*i);
 }
 
@@ -77744,7 +77818,7 @@ BD_Shape<T>::refine_with_congruences(const Congruence_System& cgs) {
                            "cgs and *this are space-dimension incompatible");
 
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
+         cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
     refine_no_check(*i);
 }
 
@@ -77888,32 +77962,32 @@ BD_Shape<T>::bounds_from_below(const Linear_Expression& expr) const {
 template <typename T>
 inline bool
 BD_Shape<T>::maximize(const Linear_Expression& expr,
-		      Coefficient& sup_n, Coefficient& sup_d,
-		      bool& maximum) const {
+                      Coefficient& sup_n, Coefficient& sup_d,
+                      bool& maximum) const {
   return max_min(expr, true, sup_n, sup_d, maximum);
 }
 
 template <typename T>
 inline bool
 BD_Shape<T>::maximize(const Linear_Expression& expr,
-		      Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		      Generator& g) const {
+                      Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                      Generator& g) const {
   return max_min(expr, true, sup_n, sup_d, maximum, g);
 }
 
 template <typename T>
 inline bool
 BD_Shape<T>::minimize(const Linear_Expression& expr,
-		      Coefficient& inf_n, Coefficient& inf_d,
-		      bool& minimum) const {
+                      Coefficient& inf_n, Coefficient& inf_d,
+                      bool& minimum) const {
   return max_min(expr, false, inf_n, inf_d, minimum);
 }
 
 template <typename T>
 inline bool
 BD_Shape<T>::minimize(const Linear_Expression& expr,
-		      Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		      Generator& g) const {
+                      Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                      Generator& g) const {
   return max_min(expr, false, inf_n, inf_d, minimum, g);
 }
 
@@ -77977,12 +78051,12 @@ operator!=(const BD_Shape<T>& x, const BD_Shape<T>& y) {
 template <typename Temp, typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const BD_Shape<T>& x,
-			    const BD_Shape<T>& y,
-			    const Rounding_Dir dir,
-			    Temp& tmp0,
-			    Temp& tmp1,
-			    Temp& tmp2) {
+                            const BD_Shape<T>& x,
+                            const BD_Shape<T>& y,
+                            const Rounding_Dir dir,
+                            Temp& tmp0,
+                            Temp& tmp1,
+                            Temp& tmp2) {
   const dimension_type x_space_dim = x.space_dimension();
   // Dimension-compatibility check.
   if (x_space_dim != y.space_dimension())
@@ -78018,9 +78092,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const BD_Shape<T>& x,
-			    const BD_Shape<T>& y,
-			    const Rounding_Dir dir) {
+                            const BD_Shape<T>& x,
+                            const BD_Shape<T>& y,
+                            const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -78032,9 +78106,9 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename T>
 inline bool
 rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			    const BD_Shape<T>& x,
-			    const BD_Shape<T>& y,
-			    const Rounding_Dir dir) {
+                            const BD_Shape<T>& x,
+                            const BD_Shape<T>& y,
+                            const Rounding_Dir dir) {
   return rectilinear_distance_assign<To, To, T>(r, x, y, dir);
 }
 
@@ -78042,12 +78116,12 @@ rectilinear_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const BD_Shape<T>& x,
-			  const BD_Shape<T>& y,
-			  const Rounding_Dir dir,
-			  Temp& tmp0,
-			  Temp& tmp1,
-			  Temp& tmp2) {
+                          const BD_Shape<T>& x,
+                          const BD_Shape<T>& y,
+                          const Rounding_Dir dir,
+                          Temp& tmp0,
+                          Temp& tmp1,
+                          Temp& tmp2) {
   const dimension_type x_space_dim = x.space_dimension();
   // Dimension-compatibility check.
   if (x_space_dim != y.space_dimension())
@@ -78083,9 +78157,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const BD_Shape<T>& x,
-			  const BD_Shape<T>& y,
-			  const Rounding_Dir dir) {
+                          const BD_Shape<T>& x,
+                          const BD_Shape<T>& y,
+                          const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -78097,9 +78171,9 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename T>
 inline bool
 euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			  const BD_Shape<T>& x,
-			  const BD_Shape<T>& y,
-			  const Rounding_Dir dir) {
+                          const BD_Shape<T>& x,
+                          const BD_Shape<T>& y,
+                          const Rounding_Dir dir) {
   return euclidean_distance_assign<To, To, T>(r, x, y, dir);
 }
 
@@ -78107,12 +78181,12 @@ euclidean_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const BD_Shape<T>& x,
-			   const BD_Shape<T>& y,
-			   const Rounding_Dir dir,
-			   Temp& tmp0,
-			   Temp& tmp1,
-			   Temp& tmp2) {
+                           const BD_Shape<T>& x,
+                           const BD_Shape<T>& y,
+                           const Rounding_Dir dir,
+                           Temp& tmp0,
+                           Temp& tmp1,
+                           Temp& tmp2) {
   const dimension_type x_space_dim = x.space_dimension();
   // Dimension-compatibility check.
   if (x_space_dim != y.space_dimension())
@@ -78148,9 +78222,9 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename Temp, typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const BD_Shape<T>& x,
-			   const BD_Shape<T>& y,
-			   const Rounding_Dir dir) {
+                           const BD_Shape<T>& x,
+                           const BD_Shape<T>& y,
+                           const Rounding_Dir dir) {
   typedef Checked_Number<Temp, Extended_Number_Policy> Checked_Temp;
   PPL_DIRTY_TEMP(Checked_Temp, tmp0);
   PPL_DIRTY_TEMP(Checked_Temp, tmp1);
@@ -78162,17 +78236,17 @@ l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 template <typename To, typename T>
 inline bool
 l_infinity_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-			   const BD_Shape<T>& x,
-			   const BD_Shape<T>& y,
-			   const Rounding_Dir dir) {
+                           const BD_Shape<T>& x,
+                           const BD_Shape<T>& y,
+                           const Rounding_Dir dir) {
   return l_infinity_distance_assign<To, To, T>(r, x, y, dir);
 }
 
 template <typename T>
 inline void
 BD_Shape<T>::add_dbm_constraint(const dimension_type i,
-				const dimension_type j,
-				const N& k) {
+                                const dimension_type j,
+                                const N& k) {
   // Private method: the caller has to ensure the following.
   PPL_ASSERT(i <= space_dimension() && j <= space_dimension() && i != j);
   N& dbm_ij = dbm[i][j];
@@ -78186,9 +78260,9 @@ BD_Shape<T>::add_dbm_constraint(const dimension_type i,
 template <typename T>
 inline void
 BD_Shape<T>::add_dbm_constraint(const dimension_type i,
-				const dimension_type j,
-				Coefficient_traits::const_reference numer,
-				Coefficient_traits::const_reference denom) {
+                                const dimension_type j,
+                                Coefficient_traits::const_reference numer,
+                                Coefficient_traits::const_reference denom) {
   // Private method: the caller has to ensure the following.
   PPL_ASSERT(i <= space_dimension() && j <= space_dimension() && i != j);
   PPL_ASSERT(denom != 0);
@@ -78254,7 +78328,7 @@ BD_Shape<T>
   const dimension_type space_dim = space_dimension();
   if (new_dimension > space_dim)
     throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
-				 new_dimension);
+                                 new_dimension);
 
   // The removal of no dimensions from any BDS is a no-op.
   // Note that this case also captures the only legal removal of
@@ -78306,10 +78380,10 @@ BD_Shape<T>::CC76_extrapolation_assign(const BD_Shape& y, unsigned* tp) {
     N( 2, ROUND_UP)
   };
   CC76_extrapolation_assign(y,
-			    stop_points,
-			    stop_points
-			    + sizeof(stop_points)/sizeof(stop_points[0]),
-			    tp);
+                            stop_points,
+                            stop_points
+                            + sizeof(stop_points)/sizeof(stop_points[0]),
+                            tp);
 }
 
 template <typename T>
@@ -78334,8 +78408,8 @@ BD_Shape<T>::widening_assign(const BD_Shape& y, unsigned* tp) {
 template <typename T>
 inline void
 BD_Shape<T>::limited_H79_extrapolation_assign(const BD_Shape& y,
-					      const Constraint_System& cs,
-					      unsigned* tp) {
+                                              const Constraint_System& cs,
+                                              unsigned* tp) {
   // Compute the limited H79 extrapolation on polyhedra.
   // TODO: provide a direct implementation.
   C_Polyhedron ph_x(constraints());
@@ -78362,8 +78436,8 @@ template <typename T>
 template <typename Interval_Info>
 inline void
 BD_Shape<T>::generalized_refine_with_linear_form_inequality(
-	     const Linear_Form<Interval<T, Interval_Info> >& left,
-	     const Linear_Form<Interval<T, Interval_Info> >& right,
+             const Linear_Form<Interval<T, Interval_Info> >& left,
+             const Linear_Form<Interval<T, Interval_Info> >& right,
              const Relation_Symbol relsym) {
   switch (relsym) {
   case EQUAL:
@@ -78422,12 +78496,12 @@ swap(BD_Shape<T>& x, BD_Shape<T>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/BD_Shape.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_templates.hh line 1. */
 /* BD_Shape class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/BD_Shape.templates.hh line 40. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_templates.hh line 40. */
 #include <vector>
 #include <deque>
 #include <iostream>
@@ -78476,17 +78550,21 @@ BD_Shape<T>::BD_Shape(const Generator_System& gs)
         dbm_initialized = true;
         const Coefficient& d = g.divisor();
         // TODO: Check if the following loop can be optimized used
-        // Generator::Expression::const_iterator.
+        // Generator::expr_type::const_iterator.
         for (dimension_type i = space_dim; i > 0; --i) {
           const Coefficient& g_i = g.expression().get(Variable(i - 1));
           DB_Row<N>& dbm_i = dbm[i];
           for (dimension_type j = space_dim; j > 0; --j)
-            if (i != j)
-              div_round_up(dbm_i[j], g.expression().get(Variable(j - 1)) - g_i, d);
+            if (i != j) {
+              const Coefficient& g_j = g.expression().get(Variable(j - 1));
+              div_round_up(dbm_i[j], g_j - g_i, d);
+            }
           div_round_up(dbm_i[0], -g_i, d);
         }
-        for (dimension_type j = space_dim; j > 0; --j)
-          div_round_up(dbm_0[j], g.expression().get(Variable(j - 1)), d);
+        for (dimension_type j = space_dim; j > 0; --j) {
+          const Coefficient& g_j = g.expression().get(Variable(j - 1));
+          div_round_up(dbm_0[j], g_j, d);
+        }
         // Note: no need to initialize the first element of the main diagonal.
       }
       else {
@@ -78494,20 +78572,22 @@ BD_Shape<T>::BD_Shape(const Generator_System& gs)
         // valid values and we must compute maxima.
         const Coefficient& d = g.divisor();
         // TODO: Check if the following loop can be optimized used
-        // Generator::Expression::const_iterator.
+        // Generator::expr_type::const_iterator.
         for (dimension_type i = space_dim; i > 0; --i) {
           const Coefficient& g_i = g.expression().get(Variable(i - 1));
           DB_Row<N>& dbm_i = dbm[i];
           // The loop correctly handles the case when i == j.
           for (dimension_type j = space_dim; j > 0; --j) {
-            div_round_up(tmp, g.expression().get(Variable(j - 1)) - g_i, d);
+            const Coefficient& g_j = g.expression().get(Variable(j - 1));
+            div_round_up(tmp, g_j - g_i, d);
             max_assign(dbm_i[j], tmp);
           }
           div_round_up(tmp, -g_i, d);
           max_assign(dbm_i[0], tmp);
         }
         for (dimension_type j = space_dim; j > 0; --j) {
-          div_round_up(tmp, g.expression().get(Variable(j - 1)), d);
+          const Coefficient& g_j = g.expression().get(Variable(j - 1));
+          div_round_up(tmp, g_j, d);
           max_assign(dbm_0[j], tmp);
         }
       }
@@ -78531,7 +78611,7 @@ BD_Shape<T>::BD_Shape(const Generator_System& gs)
     switch (g.type()) {
     case Generator::LINE:
       // TODO: Check if the following loop can be optimized used
-      // Generator::Expression::const_iterator.
+      // Generator::expr_type::const_iterator.
       for (dimension_type i = space_dim; i > 0; --i) {
         const Coefficient& g_i = g.expression().get(Variable(i - 1));
         DB_Row<N>& dbm_i = dbm[i];
@@ -78542,14 +78622,14 @@ BD_Shape<T>::BD_Shape(const Generator_System& gs)
         if (g_i != 0)
           assign_r(dbm_i[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
       }
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
             i_end = g.expression().end(); i != i_end; ++i)
         assign_r(dbm_0[i.variable().space_dimension()],
                  PLUS_INFINITY, ROUND_NOT_NEEDED);
       break;
     case Generator::RAY:
       // TODO: Check if the following loop can be optimized used
-      // Generator::Expression::const_iterator.
+      // Generator::expr_type::const_iterator.
       for (dimension_type i = space_dim; i > 0; --i) {
         const Coefficient& g_i = g.expression().get(Variable(i - 1));
         DB_Row<N>& dbm_i = dbm[i];
@@ -78560,7 +78640,7 @@ BD_Shape<T>::BD_Shape(const Generator_System& gs)
         if (g_i < 0)
           assign_r(dbm_i[0], PLUS_INFINITY, ROUND_NOT_NEEDED);
       }
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
             i_end = g.expression().end(); i != i_end; ++i)
         if (*i > 0)
           assign_r(dbm_0[i.variable().space_dimension()],
@@ -78634,8 +78714,10 @@ BD_Shape<T>::BD_Shape(const Polyhedron& ph, const Complexity_Class complexity)
       for (Constraint_System::const_iterator i = ph_cs.begin(),
              ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
         const Constraint& c = *i;
-        if (c.is_strict_inequality())
-          lp.add_constraint(Linear_Expression(c) >= 0);
+        if (c.is_strict_inequality()) {
+          Linear_Expression expr(c.expression());
+          lp.add_constraint(expr >= 0);
+        }
         else
           lp.add_constraint(c);
       }
@@ -79744,7 +79826,7 @@ BD_Shape<T>::relation_with(const Congruence& cg) const {
 
   // Find the lower bound for a hyperplane with direction
   // defined by the congruence.
-  Linear_Expression le = Linear_Expression(cg);
+  Linear_Expression le = Linear_Expression(cg.expression());
   PPL_DIRTY_TEMP_COEFFICIENT(min_numer);
   PPL_DIRTY_TEMP_COEFFICIENT(min_denom);
   bool min_included;
@@ -79849,7 +79931,7 @@ BD_Shape<T>::relation_with(const Constraint& c) const {
     // Find the linear expression for the constraint and use that to
     // find if the expression is bounded from above or below and if it
     // is, find the maximum and minimum values.
-    Linear_Expression le(c);
+    Linear_Expression le(c.expression());
     le.set_inhomogeneous_term(Coefficient_zero());
 
     PPL_DIRTY_TEMP(Coefficient, max_numer);
@@ -80772,7 +80854,7 @@ BD_Shape<T>::difference_assign(const BD_Shape& y) {
     if (x.relation_with(c).implies(Poly_Con_Relation::is_included()))
       continue;
     BD_Shape z = x;
-    const Linear_Expression e = Linear_Expression(c);
+    const Linear_Expression e(c.expression());
     z.add_constraint(e <= 0);
     if (!z.is_empty())
       new_bd_shape.upper_bound_assign(z);
@@ -81394,7 +81476,7 @@ BD_Shape<T>::get_limiting_shape(const Constraint_System& cs,
             ls_x = d;
             changed = true;
           }
-	}
+        }
         else {
           // Compute the bound for `y', rounding towards plus infinity.
           neg_assign(minus_c_term, c.inhomogeneous_term());
@@ -81402,10 +81484,10 @@ BD_Shape<T>::get_limiting_shape(const Constraint_System& cs,
           if (y <= d1) {
             N& ls_x = negative ? ls_dbm[i][j] : ls_dbm[j][i];
             N& ls_y = negative ? ls_dbm[j][i] : ls_dbm[i][j];
-	    if ((ls_x >= d && ls_y > d1) || (ls_x > d && ls_y >= d1)) {
-	      ls_x = d;
-	      ls_y = d1;
-	      changed = true;
+            if ((ls_x >= d && ls_y > d1) || (ls_x > d && ls_y >= d1)) {
+              ls_x = d;
+              ls_y = d1;
+              changed = true;
             }
           }
         }
@@ -82555,7 +82637,7 @@ BD_Shape<T>::affine_form_image(const Variable var,
 
   // Check that T is a floating point type.
   PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-		    "BD_Shape<T>::affine_form_image(Variable, Linear_Form):"
+                    "BD_Shape<T>::affine_form_image(Variable, Linear_Form):"
                     " T not a floating point type.");
 
   // Dimension-compatibility checks.
@@ -82646,10 +82728,10 @@ template <typename T>
 template <typename Interval_Info>
 void BD_Shape<T>
 ::one_variable_affine_form_image(const dimension_type& var_id,
-			    const Interval<T, Interval_Info>& b,
-			    const Interval<T, Interval_Info>& w_coeff,
-			    const dimension_type& w_id,
-			    const dimension_type& space_dim) {
+                            const Interval<T, Interval_Info>& b,
+                            const Interval<T, Interval_Info>& w_coeff,
+                            const dimension_type& w_id,
+                            const dimension_type& space_dim) {
 
   PPL_DIRTY_TEMP(N, b_ub);
   assign_r(b_ub, b.upper(), ROUND_NOT_NEEDED);
@@ -82786,8 +82868,8 @@ void BD_Shape<T>::refine_with_linear_form_inequality(
                    const Linear_Form< Interval<T, Interval_Info> >& right) {
     // Check that T is a floating point type.
     PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
-		    "Octagonal_Shape<T>::refine_with_linear_form_inequality:"
-		    " T not a floating point type.");
+                    "Octagonal_Shape<T>::refine_with_linear_form_inequality:"
+                    " T not a floating point type.");
 
     //We assume that the analyzer will not try to apply an unreachable filter.
     PPL_ASSERT(!marked_empty());
@@ -82858,9 +82940,9 @@ void BD_Shape<T>::refine_with_linear_form_inequality(
   else if (left_t == 1) {
     if (left_w_coeff == 1 || left_w_coeff == -1) {
       if (right_t == 0 || (right_w_coeff == 1 || right_w_coeff == -1)) {
-	left_one_var_refine(left_w_id, right_t, right_w_id, left, right);
-	PPL_ASSERT(OK());
-	return;
+        left_one_var_refine(left_w_id, right_t, right_w_id, left, right);
+        PPL_ASSERT(OK());
+        return;
       }
     }
   }
@@ -82914,9 +82996,9 @@ template <typename T>
 template <typename Interval_Info>
 void
 BD_Shape<T>::left_inhomogeneous_refine(const dimension_type& right_t,
-				       const dimension_type& right_w_id,
-		    const Linear_Form< Interval<T, Interval_Info> >& left,
-		    const Linear_Form< Interval<T, Interval_Info> >& right) {
+                                       const dimension_type& right_w_id,
+                    const Linear_Form< Interval<T, Interval_Info> >& left,
+                    const Linear_Form< Interval<T, Interval_Info> >& right) {
 
   typedef Interval<T, Interval_Info> FP_Interval_Type;
 
@@ -82924,7 +83006,7 @@ BD_Shape<T>::left_inhomogeneous_refine(const dimension_type& right_t,
     // The constraint has the form [a-, a+] <= [b-, b+] + [c-, c+] * x.
     // Reduce it to the constraint +/-x <= b+ - a- if [c-, c+] = +/-[1, 1].
       const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
+                              right.coefficient(Variable(right_w_id));
       if (right_w_coeff == 1) {
         PPL_DIRTY_TEMP(N, b_plus_minus_a_minus);
         const FP_Interval_Type& left_a = left.inhomogeneous_term();
@@ -82953,10 +83035,10 @@ template <typename Interval_Info>
 void
 BD_Shape<T>
 ::left_one_var_refine(const dimension_type& left_w_id,
-		      const dimension_type& right_t,
-		      const dimension_type& right_w_id,
-	        const Linear_Form< Interval<T, Interval_Info> >& left,
-		const Linear_Form< Interval<T, Interval_Info> >& right) {
+                      const dimension_type& right_t,
+                      const dimension_type& right_w_id,
+                const Linear_Form< Interval<T, Interval_Info> >& left,
+                const Linear_Form< Interval<T, Interval_Info> >& right) {
 
   typedef Interval<T, Interval_Info> FP_Interval_Type;
 
@@ -82964,7 +83046,7 @@ BD_Shape<T>
       // The constraint has the form [b-, b+] + [c-, c+] * x <= [a-, a+]
       // Reduce it to the constraint +/-x <= a+ - b- if [c-, c+] = +/-[1, 1].
       const FP_Interval_Type& left_w_coeff =
-	left.coefficient(Variable(left_w_id));
+        left.coefficient(Variable(left_w_id));
 
       if (left_w_coeff == 1) {
         PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
@@ -82995,7 +83077,7 @@ BD_Shape<T>
                               left.coefficient(Variable(left_w_id));
 
       const FP_Interval_Type& right_w_coeff =
-	                      right.coefficient(Variable(right_w_id));
+                              right.coefficient(Variable(right_w_id));
 
       bool is_left_coeff_one = (left_w_coeff == 1);
       bool is_left_coeff_minus_one = (left_w_coeff == -1);
@@ -83022,7 +83104,7 @@ BD_Shape<T>
         }
         if (is_left_coeff_minus_one && is_right_coeff_one) {
           // We fall back to a previous case.
-	  PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
+          PPL_DIRTY_TEMP(N, a_plus_minus_b_minus);
           const FP_Interval_Type& left_b = left.inhomogeneous_term();
           const FP_Interval_Type& right_a = right.inhomogeneous_term();
           sub_assign_r(a_plus_minus_b_minus, right_a.upper(), left_b.lower(),
@@ -83077,16 +83159,16 @@ BD_Shape<T>
           add_assign_r(ub, ub, a_plus_minus_b_minus, ROUND_UP);
           add_dbm_constraint(0, right_w_id + 1, ub);
         }
-	    return;
+            return;
       }
       if (is_left_coeff_one && is_right_coeff_one) {
-	PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
-	const FP_Interval_Type& left_a = left.inhomogeneous_term();
+        PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
+        const FP_Interval_Type& left_a = left.inhomogeneous_term();
         const FP_Interval_Type& right_c = right.inhomogeneous_term();
         sub_assign_r(c_plus_minus_a_minus, right_c.upper(), left_a.lower(),
                      ROUND_UP);
         add_dbm_constraint(right_w_id+1, left_w_id+1, c_plus_minus_a_minus);
-	return;
+        return;
       }
       if (is_left_coeff_minus_one && is_right_coeff_minus_one) {
         PPL_DIRTY_TEMP(N, c_plus_minus_a_minus);
@@ -83105,9 +83187,9 @@ template <typename Interval_Info>
 void
 BD_Shape<T>
 ::general_refine(const dimension_type& left_w_id,
-		 const dimension_type& right_w_id,
-		 const Linear_Form< Interval<T, Interval_Info> >& left,
-		 const Linear_Form< Interval<T, Interval_Info> >& right) {
+                 const dimension_type& right_w_id,
+                 const Linear_Form< Interval<T, Interval_Info> >& left,
+                 const Linear_Form< Interval<T, Interval_Info> >& right) {
 
   typedef Interval<T, Interval_Info> FP_Interval_Type;
   Linear_Form<FP_Interval_Type> right_minus_left(right);
@@ -83124,13 +83206,13 @@ BD_Shape<T>
     for (dimension_type second_v = first_v+1;
          second_v <= max_w_id; ++second_v) {
       const FP_Interval_Type& lfv_coefficient =
-	left.coefficient(Variable(first_v));
+        left.coefficient(Variable(first_v));
       const FP_Interval_Type& lsv_coefficient =
-	left.coefficient(Variable(second_v));
+        left.coefficient(Variable(second_v));
       const FP_Interval_Type& rfv_coefficient =
-	right.coefficient(Variable(first_v));
+        right.coefficient(Variable(first_v));
       const FP_Interval_Type& rsv_coefficient =
-	right.coefficient(Variable(second_v));
+        right.coefficient(Variable(second_v));
       // We update the constraints only when both variables appear in at
       // least one argument.
       bool do_update = false;
@@ -83217,7 +83299,7 @@ template <typename Interval_Info>
 void
 BD_Shape<T>::
 linear_form_upper_bound(const Linear_Form< Interval<T, Interval_Info> >& lf,
-			N& result) const {
+                        N& result) const {
 
   // Check that T is a floating point type.
   PPL_COMPILE_TIME_CHECK(!std::numeric_limits<T>::is_exact,
@@ -83244,8 +83326,8 @@ linear_form_upper_bound(const Linear_Form< Interval<T, Interval_Info> >& lf,
   for (dimension_type curr_var = 0, n_var = 0; curr_var < lf_space_dimension;
        ++curr_var) {
     n_var = curr_var + 1;
-    const FP_Interval_Type& curr_coefficient =
-                            lf.coefficient(Variable(curr_var));
+    const FP_Interval_Type&
+      curr_coefficient = lf.coefficient(Variable(curr_var));
     assign_r(curr_lb, curr_coefficient.lower(), ROUND_NOT_NEEDED);
     assign_r(curr_ub, curr_coefficient.upper(), ROUND_NOT_NEEDED);
     if (curr_lb != 0 || curr_ub != 0) {
@@ -85149,7 +85231,7 @@ void
 BD_Shape<T>::throw_dimension_incompatible(const char* method,
                                           const char* lf_name,
                                           const Linear_Form< Interval<T,
-					  Interval_Info> >& lf) const {
+                                          Interval_Info> >& lf) const {
   std::ostringstream s;
   s << "PPL::BD_Shape::" << method << ":" << std::endl
     << "this->space_dimension() == " << space_dimension()
@@ -85169,14 +85251,14 @@ BD_Shape<T>::throw_invalid_argument(const char* method, const char* reason) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/BD_Shape.defs.hh line 2366. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BD_Shape_defs.hh line 2370. */
 
-/* Automatically generated from PPL source file ../src/Rational_Interval.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rational_Interval.hh line 1. */
 /* Rational_Interval class declaration and implementation.
 */
 
 
-/* Automatically generated from PPL source file ../src/Rational_Interval.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rational_Interval.hh line 28. */
 #include <gmpxx.h>
 
 namespace Parma_Polyhedra_Library {
@@ -85203,7 +85285,7 @@ typedef Interval<mpq_class, Rational_Interval_Info> Rational_Interval;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.templates.hh line 42. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_templates.hh line 42. */
 #include <vector>
 #include <map>
 #include <iostream>
@@ -85307,36 +85389,36 @@ Box<ITV>::Box(const Generator_System& gs)
   bool point_seen = false;
   // Going through all the points.
   for (Generator_System::const_iterator
-	 gs_i = gs_begin; gs_i != gs_end; ++gs_i) {
+         gs_i = gs_begin; gs_i != gs_end; ++gs_i) {
     const Generator& g = *gs_i;
     if (g.is_point()) {
       const Coefficient& d = g.divisor();
       if (point_seen) {
-	// This is not the first point: `seq' already contains valid values.
-	// TODO: If the variables in the expression that have coefficient 0
+        // This is not the first point: `seq' already contains valid values.
+        // TODO: If the variables in the expression that have coefficient 0
         // have no effect on seq[i], this loop can be optimized using
-        // Generator::Expression::const_iterator.
-	for (dimension_type i = space_dim; i-- > 0; ) {
-	  assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-	  assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
-	  q.canonicalize();
-	  PPL_DIRTY_TEMP(ITV, iq);
-	  iq.build(i_constraint(EQUAL, q));
-	  seq[i].join_assign(iq);
-	}
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i-- > 0; ) {
+          assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+          assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
+          q.canonicalize();
+          PPL_DIRTY_TEMP(ITV, iq);
+          iq.build(i_constraint(EQUAL, q));
+          seq[i].join_assign(iq);
+        }
       }
       else {
-	// This is the first point seen: initialize `seq'.
-	point_seen = true;
+        // This is the first point seen: initialize `seq'.
+        point_seen = true;
         // TODO: If the variables in the expression that have coefficient 0
         // have no effect on seq[i], this loop can be optimized using
-        // Generator::Expression::const_iterator.
-	for (dimension_type i = space_dim; i-- > 0; ) {
-	  assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-	  assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
-	  q.canonicalize();
-	  seq[i].build(i_constraint(EQUAL, q));
-	}
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i-- > 0; ) {
+          assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+          assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
+          q.canonicalize();
+          seq[i].build(i_constraint(EQUAL, q));
+        }
       }
     }
   }
@@ -85344,51 +85426,50 @@ Box<ITV>::Box(const Generator_System& gs)
   if (!point_seen)
     // The generator system is not empty, but contains no points.
     throw std::invalid_argument("PPL::Box<ITV>::Box(gs):\n"
-				"the non-empty generator system gs "
-				"contains no points.");
+                                "the non-empty generator system gs "
+                                "contains no points.");
 
   // Going through all the lines, rays and closure points.
-  ITV q_interval;
   for (Generator_System::const_iterator gs_i = gs_begin;
        gs_i != gs_end; ++gs_i) {
     const Generator& g = *gs_i;
     switch (g.type()) {
     case Generator::LINE:
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
               i_end = g.expression().end();
               i != i_end; ++i)
-	  seq[i.variable().id()].assign(UNIVERSE);
+          seq[i.variable().id()].assign(UNIVERSE);
       break;
     case Generator::RAY:
-      for (Generator::Expression::const_iterator i = g.expression().begin(),
+      for (Generator::expr_type::const_iterator i = g.expression().begin(),
               i_end = g.expression().end();
               i != i_end; ++i)
-	switch (sgn(*i)) {
-	case 1:
-	  seq[i.variable().id()].upper_extend();
-	  break;
-	case -1:
-	  seq[i.variable().id()].lower_extend();
-	  break;
-	default:
+        switch (sgn(*i)) {
+        case 1:
+          seq[i.variable().id()].upper_extend();
+          break;
+        case -1:
+          seq[i.variable().id()].lower_extend();
+          break;
+        default:
           PPL_UNREACHABLE;
-	  break;
-	}
+          break;
+        }
       break;
     case Generator::CLOSURE_POINT:
       {
-	const Coefficient& d = g.divisor();
+        const Coefficient& d = g.divisor();
         // TODO: If the variables in the expression that have coefficient 0
         // have no effect on seq[i], this loop can be optimized using
-        // Generator::Expression::const_iterator.
-	for (dimension_type i = space_dim; i-- > 0; ) {
-	  assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
-	  assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
-	  q.canonicalize();
-	  ITV& seq_i = seq[i];
-	  seq_i.lower_extend(i_constraint(GREATER_THAN, q));
-	  seq_i.upper_extend(i_constraint(LESS_THAN, q));
-	}
+        // Generator::expr_type::const_iterator.
+        for (dimension_type i = space_dim; i-- > 0; ) {
+          assign_r(q.get_num(), g.coefficient(Variable(i)), ROUND_NOT_NEEDED);
+          assign_r(q.get_den(), d, ROUND_NOT_NEEDED);
+          q.canonicalize();
+          ITV& seq_i = seq[i];
+          seq_i.lower_extend(i_constraint(GREATER_THAN, q));
+          seq_i.upper_extend(i_constraint(LESS_THAN, q));
+        }
       }
       break;
     default:
@@ -85544,7 +85625,7 @@ Box<ITV>::Box(const Polyhedron& ph, Complexity_Class complexity)
     for (dimension_type i = space_dim; i-- > 0; )
       seq[i].assign(UNIVERSE);
     // Get a simplified version of the constraints.
-    Constraint_System cs = ph.simplified_constraints();
+    const Constraint_System cs = ph.simplified_constraints();
     // Propagate easy-to-find bounds from the constraints,
     // allowing for a limited number of iterations.
     // FIXME: 20 is just a wild guess.
@@ -85559,12 +85640,14 @@ Box<ITV>::Box(const Polyhedron& ph, Complexity_Class complexity)
     else
       // Adding to `lp' a topologically closed version of `ph_cs'.
       for (Constraint_System::const_iterator i = ph_cs.begin(),
-	     ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
-	const Constraint& c = *i;
-	if (c.is_strict_inequality())
-	  lp.add_constraint(Linear_Expression(c) >= 0);
-	else
-	  lp.add_constraint(c);
+             ph_cs_end = ph_cs.end(); i != ph_cs_end; ++i) {
+        const Constraint& c = *i;
+        if (c.is_strict_inequality()) {
+          const Linear_Expression expr(c.expression());
+          lp.add_constraint(expr >= 0);
+        }
+        else
+          lp.add_constraint(c);
       }
     // Check for unsatisfiability.
     if (!lp.is_satisfiable()) {
@@ -85585,22 +85668,22 @@ Box<ITV>::Box(const Polyhedron& ph, Complexity_Class complexity)
       // Evaluate upper bound.
       lp.set_optimization_mode(MAXIMIZATION);
       if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-	g = lp.optimizing_point();
-	lp.evaluate_objective_function(g, bound_numer, bound_denom);
-	assign_r(upper_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
-	assign_r(upper_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
-	PPL_ASSERT(is_canonical(upper_bound));
-	upper.set(LESS_OR_EQUAL, upper_bound);
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, bound_numer, bound_denom);
+        assign_r(upper_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
+        assign_r(upper_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
+        PPL_ASSERT(is_canonical(upper_bound));
+        upper.set(LESS_OR_EQUAL, upper_bound);
       }
       // Evaluate optimal lower bound.
       lp.set_optimization_mode(MINIMIZATION);
       if (lp.solve() == OPTIMIZED_MIP_PROBLEM) {
-	g = lp.optimizing_point();
-	lp.evaluate_objective_function(g, bound_numer, bound_denom);
-	assign_r(lower_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
-	assign_r(lower_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
-	PPL_ASSERT(is_canonical(lower_bound));
-	lower.set(GREATER_OR_EQUAL, lower_bound);
+        g = lp.optimizing_point();
+        lp.evaluate_objective_function(g, bound_numer, bound_denom);
+        assign_r(lower_bound.get_num(), bound_numer, ROUND_NOT_NEEDED);
+        assign_r(lower_bound.get_den(), bound_denom, ROUND_NOT_NEEDED);
+        PPL_ASSERT(is_canonical(lower_bound));
+        lower.set(GREATER_OR_EQUAL, lower_bound);
       }
       seq_i.build(lower, upper);
     }
@@ -85745,8 +85828,8 @@ Box<ITV>::bounds(const Linear_Expression& expr, const bool from_above) const {
   const dimension_type space_dim = space_dimension();
   if (space_dim < expr_space_dim)
     throw_dimension_incompatible((from_above
-				  ? "bounds_from_above(e)"
-				  : "bounds_from_below(e)"), "e", expr);
+                                  ? "bounds_from_above(e)"
+                                  : "bounds_from_below(e)"), "e", expr);
   // A zero-dimensional or empty Box bounds everything.
   if (space_dim == 0 || is_empty())
     return true;
@@ -85760,14 +85843,14 @@ Box<ITV>::bounds(const Linear_Expression& expr, const bool from_above) const {
     switch (sgn(*i) * from_above_sign) {
     case 1:
       if (seq[v.id()].upper_is_boundary_infinity())
-	return false;
+        return false;
       break;
     case 0:
       PPL_UNREACHABLE;
       break;
     case -1:
       if (seq[v.id()].lower_is_boundary_infinity())
-	return false;
+        return false;
       break;
     }
   }
@@ -85777,9 +85860,9 @@ Box<ITV>::bounds(const Linear_Expression& expr, const bool from_above) const {
 template <typename ITV>
 Poly_Con_Relation
 interval_relation(const ITV& i,
-		  const Constraint::Type constraint_type,
-		  Coefficient_traits::const_reference numer,
-		  Coefficient_traits::const_reference denom) {
+                  const Constraint::Type constraint_type,
+                  Coefficient_traits::const_reference numer,
+                  Coefficient_traits::const_reference denom) {
 
   if (i.is_universe())
     return Poly_Con_Relation::strictly_intersects();
@@ -85799,13 +85882,13 @@ interval_relation(const ITV& i,
       sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
       switch (sgn(bound_diff)) {
       case 1:
-	return Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::strictly_intersects();
       case 0:
-	return i.upper_is_open()
-	  ? Poly_Con_Relation::is_disjoint()
-	  : Poly_Con_Relation::strictly_intersects();
+        return i.upper_is_open()
+          ? Poly_Con_Relation::is_disjoint()
+          : Poly_Con_Relation::strictly_intersects();
       case -1:
-	return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       }
     }
     else {
@@ -85813,32 +85896,32 @@ interval_relation(const ITV& i,
       sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
       switch (sgn(bound_diff)) {
       case 1:
-	return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       case 0:
-	if (i.lower_is_open())
-	  return Poly_Con_Relation::is_disjoint();
+        if (i.lower_is_open())
+          return Poly_Con_Relation::is_disjoint();
         if (i.is_singleton())
           return Poly_Con_Relation::is_included()
             && Poly_Con_Relation::saturates();
         return Poly_Con_Relation::strictly_intersects();
       case -1:
-	if (i.upper_is_boundary_infinity())
-	  return Poly_Con_Relation::strictly_intersects();
-	else {
-	  assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-	  sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-	  switch (sgn(bound_diff)) {
-	  case 1:
-	    return Poly_Con_Relation::strictly_intersects();
-	  case 0:
-	    if (i.upper_is_open())
-	      return Poly_Con_Relation::is_disjoint();
-	    else
-	      return Poly_Con_Relation::strictly_intersects();
-	  case -1:
-	    return Poly_Con_Relation::is_disjoint();
-	  }
-	}
+        if (i.upper_is_boundary_infinity())
+          return Poly_Con_Relation::strictly_intersects();
+        else {
+          assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+          sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+          switch (sgn(bound_diff)) {
+          case 1:
+            return Poly_Con_Relation::strictly_intersects();
+          case 0:
+            if (i.upper_is_open())
+              return Poly_Con_Relation::is_disjoint();
+            else
+              return Poly_Con_Relation::strictly_intersects();
+          case -1:
+            return Poly_Con_Relation::is_disjoint();
+          }
+        }
       }
     }
   }
@@ -85851,15 +85934,15 @@ interval_relation(const ITV& i,
       sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
       switch (sgn(bound_diff)) {
       case 1:
-	return Poly_Con_Relation::strictly_intersects();
+        return Poly_Con_Relation::strictly_intersects();
       case 0:
-	if (constraint_type == Constraint::STRICT_INEQUALITY
-	    || i.upper_is_open())
-	  return Poly_Con_Relation::is_disjoint();
-	else
-	  return Poly_Con_Relation::strictly_intersects();
+        if (constraint_type == Constraint::STRICT_INEQUALITY
+            || i.upper_is_open())
+          return Poly_Con_Relation::is_disjoint();
+        else
+          return Poly_Con_Relation::strictly_intersects();
       case -1:
-	return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       }
     }
     else {
@@ -85867,43 +85950,43 @@ interval_relation(const ITV& i,
       sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
       switch (sgn(bound_diff)) {
       case 1:
-	return Poly_Con_Relation::is_included();
+        return Poly_Con_Relation::is_included();
       case 0:
-	if (constraint_type == Constraint::NONSTRICT_INEQUALITY
-	    || i.lower_is_open()) {
-	  Poly_Con_Relation result = Poly_Con_Relation::is_included();
-	  if (i.is_singleton())
-	    result = result && Poly_Con_Relation::saturates();
-	  return result;
-	}
-	else {
-	  PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
-		 && !i.lower_is_open());
-	  if (i.is_singleton())
-	    return Poly_Con_Relation::is_disjoint()
-	      && Poly_Con_Relation::saturates();
-	  else
-	    return Poly_Con_Relation::strictly_intersects();
-	}
+        if (constraint_type == Constraint::NONSTRICT_INEQUALITY
+            || i.lower_is_open()) {
+          Poly_Con_Relation result = Poly_Con_Relation::is_included();
+          if (i.is_singleton())
+            result = result && Poly_Con_Relation::saturates();
+          return result;
+        }
+        else {
+          PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
+                 && !i.lower_is_open());
+          if (i.is_singleton())
+            return Poly_Con_Relation::is_disjoint()
+              && Poly_Con_Relation::saturates();
+          else
+            return Poly_Con_Relation::strictly_intersects();
+        }
       case -1:
-	if (i.upper_is_boundary_infinity())
-	  return Poly_Con_Relation::strictly_intersects();
-	else {
-	  assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
-	  sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-	  switch (sgn(bound_diff)) {
-	  case 1:
-	    return Poly_Con_Relation::strictly_intersects();
-	  case 0:
-	    if (constraint_type == Constraint::STRICT_INEQUALITY
-		|| i.upper_is_open())
-	      return Poly_Con_Relation::is_disjoint();
-	    else
-	      return Poly_Con_Relation::strictly_intersects();
-	  case -1:
-	    return Poly_Con_Relation::is_disjoint();
-	  }
-	}
+        if (i.upper_is_boundary_infinity())
+          return Poly_Con_Relation::strictly_intersects();
+        else {
+          assign_r(bound_diff, i.upper(), ROUND_NOT_NEEDED);
+          sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+          switch (sgn(bound_diff)) {
+          case 1:
+            return Poly_Con_Relation::strictly_intersects();
+          case 0:
+            if (constraint_type == Constraint::STRICT_INEQUALITY
+                || i.upper_is_open())
+              return Poly_Con_Relation::is_disjoint();
+            else
+              return Poly_Con_Relation::strictly_intersects();
+          case -1:
+            return Poly_Con_Relation::is_disjoint();
+          }
+        }
       }
     }
   }
@@ -85916,43 +85999,43 @@ interval_relation(const ITV& i,
       sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
       switch (sgn(bound_diff)) {
       case -1:
-	return Poly_Con_Relation::is_included();
+        return Poly_Con_Relation::is_included();
       case 0:
-	if (constraint_type == Constraint::NONSTRICT_INEQUALITY
-	    || i.upper_is_open()) {
-	  Poly_Con_Relation result = Poly_Con_Relation::is_included();
-	  if (i.is_singleton())
-	    result = result && Poly_Con_Relation::saturates();
-	  return result;
-	}
-	else {
-	  PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
-		 && !i.upper_is_open());
-	  if (i.is_singleton())
-	    return Poly_Con_Relation::is_disjoint()
-	      && Poly_Con_Relation::saturates();
-	  else
-	    return Poly_Con_Relation::strictly_intersects();
-	}
+        if (constraint_type == Constraint::NONSTRICT_INEQUALITY
+            || i.upper_is_open()) {
+          Poly_Con_Relation result = Poly_Con_Relation::is_included();
+          if (i.is_singleton())
+            result = result && Poly_Con_Relation::saturates();
+          return result;
+        }
+        else {
+          PPL_ASSERT(constraint_type == Constraint::STRICT_INEQUALITY
+                 && !i.upper_is_open());
+          if (i.is_singleton())
+            return Poly_Con_Relation::is_disjoint()
+              && Poly_Con_Relation::saturates();
+          else
+            return Poly_Con_Relation::strictly_intersects();
+        }
       case 1:
-	if (i.lower_is_boundary_infinity())
-	  return Poly_Con_Relation::strictly_intersects();
-	else {
-	  assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
-	  sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
-	  switch (sgn(bound_diff)) {
-	  case -1:
-	    return Poly_Con_Relation::strictly_intersects();
-	  case 0:
-	    if (constraint_type == Constraint::STRICT_INEQUALITY
-		|| i.lower_is_open())
-	      return Poly_Con_Relation::is_disjoint();
-	    else
-	      return Poly_Con_Relation::strictly_intersects();
-	  case 1:
-	    return Poly_Con_Relation::is_disjoint();
-	  }
-	}
+        if (i.lower_is_boundary_infinity())
+          return Poly_Con_Relation::strictly_intersects();
+        else {
+          assign_r(bound_diff, i.lower(), ROUND_NOT_NEEDED);
+          sub_assign_r(bound_diff, bound_diff, bound, ROUND_NOT_NEEDED);
+          switch (sgn(bound_diff)) {
+          case -1:
+            return Poly_Con_Relation::strictly_intersects();
+          case 0:
+            if (constraint_type == Constraint::STRICT_INEQUALITY
+                || i.lower_is_open())
+              return Poly_Con_Relation::is_disjoint();
+            else
+              return Poly_Con_Relation::strictly_intersects();
+          case 1:
+            return Poly_Con_Relation::is_disjoint();
+          }
+        }
       }
     }
   }
@@ -85982,7 +86065,7 @@ Box<ITV>::relation_with(const Congruence& cg) const {
       return Poly_Con_Relation::is_disjoint();
     else
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
   }
 
   if (cg.is_equality()) {
@@ -85994,7 +86077,7 @@ Box<ITV>::relation_with(const Congruence& cg) const {
   PPL_DIRTY_TEMP(Rational_Interval, t);
   PPL_DIRTY_TEMP(mpq_class, m);
   r = 0;
-  for (Congruence::Expression::const_iterator i = cg.expression().begin(),
+  for (Congruence::expr_type::const_iterator i = cg.expression().begin(),
       i_end = cg.expression().end(); i != i_end; ++i) {
     const Coefficient& cg_i = *i;
     const Variable v = i.variable();
@@ -86041,16 +86124,16 @@ Box<ITV>::relation_with(const Constraint& c) const {
 
   if (space_dim == 0) {
     if ((c.is_equality() && c.inhomogeneous_term() != 0)
-	|| (c.is_inequality() && c.inhomogeneous_term() < 0))
+        || (c.is_inequality() && c.inhomogeneous_term() < 0))
       return Poly_Con_Relation::is_disjoint();
     else if (c.is_strict_inequality() && c.inhomogeneous_term() == 0)
       // The constraint 0 > 0 implicitly defines the hyperplane 0 = 0;
       // thus, the zero-dimensional point also saturates it.
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_disjoint();
+        && Poly_Con_Relation::is_disjoint();
     else if (c.is_equality() || c.inhomogeneous_term() == 0)
       return Poly_Con_Relation::saturates()
-	&& Poly_Con_Relation::is_included();
+        && Poly_Con_Relation::is_included();
     else
       // The zero-dimensional point saturates
       // neither the positivity constraint 1 >= 0,
@@ -86066,23 +86149,23 @@ Box<ITV>::relation_with(const Constraint& c) const {
       // c is a trivial constraint.
       switch (sgn(c.inhomogeneous_term())) {
       case -1:
-	return Poly_Con_Relation::is_disjoint();
+        return Poly_Con_Relation::is_disjoint();
       case 0:
-	if (c.is_strict_inequality())
-	  return Poly_Con_Relation::saturates()
-	    && Poly_Con_Relation::is_disjoint();
-	else
-	  return Poly_Con_Relation::saturates()
-	    && Poly_Con_Relation::is_included();
+        if (c.is_strict_inequality())
+          return Poly_Con_Relation::saturates()
+            && Poly_Con_Relation::is_disjoint();
+        else
+          return Poly_Con_Relation::saturates()
+            && Poly_Con_Relation::is_included();
       case 1:
-	return Poly_Con_Relation::is_included();
+        return Poly_Con_Relation::is_included();
       }
     else {
       // c is an interval constraint.
       return interval_relation(seq[c_only_var],
-			       c.type(),
-			       c.inhomogeneous_term(),
-			       c.coefficient(Variable(c_only_var)));
+                               c.type(),
+                               c.inhomogeneous_term(),
+                               c.coefficient(Variable(c_only_var)));
     }
   else {
     // Deal with a non-trivial and non-interval constraint.
@@ -86090,8 +86173,8 @@ Box<ITV>::relation_with(const Constraint& c) const {
     PPL_DIRTY_TEMP(Rational_Interval, t);
     PPL_DIRTY_TEMP(mpq_class, m);
     r = 0;
-    const Constraint::Expression& e = c.expression();
-    for (Constraint::Expression::const_iterator i = e.begin(), i_end = e.end();
+    const Constraint::expr_type& e = c.expression();
+    for (Constraint::expr_type::const_iterator i = e.begin(), i_end = e.end();
           i != i_end; ++i) {
       assign_r(m, *i, ROUND_NOT_NEEDED);
       const Variable v = i.variable();
@@ -86101,8 +86184,8 @@ Box<ITV>::relation_with(const Constraint& c) const {
       r += t;
     }
     return interval_relation(r,
-			     c.type(),
-			     c.inhomogeneous_term());
+                             c.type(),
+                             c.inhomogeneous_term());
   }
 
   // Quiet a compiler warning: this program point is unreachable.
@@ -86131,32 +86214,32 @@ Box<ITV>::relation_with(const Generator& g) const {
 
   if (g.is_line_or_ray()) {
     if (g.is_line()) {
-      const Generator::Expression& e = g.expression();
-      for (Generator::Expression::const_iterator i = e.begin(), i_end = e.end();
+      const Generator::expr_type& e = g.expression();
+      for (Generator::expr_type::const_iterator i = e.begin(), i_end = e.end();
            i != i_end; ++i)
-	if (!seq[i.variable().id()].is_universe())
-	  return Poly_Gen_Relation::nothing();
+        if (!seq[i.variable().id()].is_universe())
+          return Poly_Gen_Relation::nothing();
       return Poly_Gen_Relation::subsumes();
     }
     else {
       PPL_ASSERT(g.is_ray());
-      const Generator::Expression& e = g.expression();
-      for (Generator::Expression::const_iterator i = e.begin(), i_end = e.end();
+      const Generator::expr_type& e = g.expression();
+      for (Generator::expr_type::const_iterator i = e.begin(), i_end = e.end();
            i != i_end; ++i) {
         const Variable v = i.variable();
-	switch (sgn(*i)) {
-	case 1:
-	  if (!seq[v.id()].upper_is_boundary_infinity())
-	    return Poly_Gen_Relation::nothing();
-	  break;
-	case 0:
+        switch (sgn(*i)) {
+        case 1:
+          if (!seq[v.id()].upper_is_boundary_infinity())
+            return Poly_Gen_Relation::nothing();
+          break;
+        case 0:
           PPL_UNREACHABLE;
-	  break;
-	case -1:
-	  if (!seq[v.id()].lower_is_boundary_infinity())
-	    return Poly_Gen_Relation::nothing();
-	  break;
-	}
+          break;
+        case -1:
+          if (!seq[v.id()].lower_is_boundary_infinity())
+            return Poly_Gen_Relation::nothing();
+          break;
+        }
       }
       return Poly_Gen_Relation::subsumes();
     }
@@ -86168,7 +86251,7 @@ Box<ITV>::relation_with(const Generator& g) const {
   PPL_DIRTY_TEMP(mpq_class, bound);
   // TODO: If the variables in the expression that have coefficient 0
   // have no effect on seq[i], this loop can be optimized using
-  // Generator::Expression::const_iterator.
+  // Generator::expr_type::const_iterator.
   for (dimension_type i = g_space_dim; i-- > 0; ) {
     const ITV& seq_i = seq[i];
     if (seq_i.is_universe())
@@ -86180,24 +86263,24 @@ Box<ITV>::relation_with(const Generator& g) const {
     if (!seq_i.lower_is_boundary_infinity()) {
       assign_r(bound, seq_i.lower(), ROUND_NOT_NEEDED);
       if (g_coord <= bound) {
-	if (seq_i.lower_is_open()) {
-	  if (g.is_point() || g_coord != bound)
-	    return Poly_Gen_Relation::nothing();
-	}
-	else if (g_coord != bound)
-	  return Poly_Gen_Relation::nothing();
+        if (seq_i.lower_is_open()) {
+          if (g.is_point() || g_coord != bound)
+            return Poly_Gen_Relation::nothing();
+        }
+        else if (g_coord != bound)
+          return Poly_Gen_Relation::nothing();
       }
     }
     // Check upper bound.
     if (!seq_i.upper_is_boundary_infinity()) {
       assign_r(bound, seq_i.upper(), ROUND_NOT_NEEDED);
       if (g_coord >= bound) {
-	if (seq_i.upper_is_open()) {
-	  if (g.is_point() || g_coord != bound)
-	    return Poly_Gen_Relation::nothing();
-	}
-	else if (g_coord != bound)
-	  return Poly_Gen_Relation::nothing();
+        if (seq_i.upper_is_open()) {
+          if (g.is_point() || g_coord != bound)
+            return Poly_Gen_Relation::nothing();
+        }
+        else if (g_coord != bound)
+          return Poly_Gen_Relation::nothing();
       }
     }
   }
@@ -86216,8 +86299,8 @@ Box<ITV>::max_min(const Linear_Expression& expr,
   const dimension_type expr_space_dim = expr.space_dimension();
   if (space_dim < expr_space_dim)
     throw_dimension_incompatible((maximize
-				  ? "maximize(e, ...)"
-				  : "minimize(e, ...)"), "e", expr);
+                                  ? "maximize(e, ...)"
+                                  : "minimize(e, ...)"), "e", expr);
   // Deal with zero-dim Box first.
   if (space_dim == 0) {
     if (marked_empty())
@@ -86247,22 +86330,22 @@ Box<ITV>::max_min(const Linear_Expression& expr,
     switch (sgn(expr_i) * maximize_sign) {
     case 1:
       if (seq_i.upper_is_boundary_infinity())
-	return false;
+        return false;
       assign_r(bound_i, seq_i.upper(), ROUND_NOT_NEEDED);
       add_mul_assign_r(result, bound_i, expr_i, ROUND_NOT_NEEDED);
       if (seq_i.upper_is_open())
-	is_included = false;
+        is_included = false;
       break;
     case 0:
       PPL_UNREACHABLE;
       break;
     case -1:
       if (seq_i.lower_is_boundary_infinity())
-	return false;
+        return false;
       assign_r(bound_i, seq_i.lower(), ROUND_NOT_NEEDED);
       add_mul_assign_r(result, bound_i, expr_i, ROUND_NOT_NEEDED);
       if (seq_i.lower_is_open())
-	is_included = false;
+        is_included = false;
       break;
     }
   }
@@ -86307,36 +86390,36 @@ Box<ITV>::max_min(const Linear_Expression& expr,
       // (and directly proceed to the next iteration).
       // FIXME: name qualification issue.
       if (seq_i.contains(0))
-	continue;
+        continue;
       if (!seq_i.lower_is_boundary_infinity())
-	if (seq_i.lower_is_open())
-	  if (!seq_i.upper_is_boundary_infinity())
-	    if (seq_i.upper_is_open()) {
-	      // Bounded and open interval: compute middle point.
-	      assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
-	      PPL_DIRTY_TEMP(mpq_class, q_seq_i_upper);
-	      assign_r(q_seq_i_upper, seq_i.upper(), ROUND_NOT_NEEDED);
-	      g_coord += q_seq_i_upper;
-	      g_coord /= 2;
-	    }
-	    else
-	      // The upper bound is in the interval.
-	      assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
-	  else {
-	    // Lower is open, upper is unbounded.
-	    assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
-	    ++g_coord;
-	  }
-	else
-	  // The lower bound is in the interval.
-	  assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+        if (seq_i.lower_is_open())
+          if (!seq_i.upper_is_boundary_infinity())
+            if (seq_i.upper_is_open()) {
+              // Bounded and open interval: compute middle point.
+              assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+              PPL_DIRTY_TEMP(mpq_class, q_seq_i_upper);
+              assign_r(q_seq_i_upper, seq_i.upper(), ROUND_NOT_NEEDED);
+              g_coord += q_seq_i_upper;
+              g_coord /= 2;
+            }
+            else
+              // The upper bound is in the interval.
+              assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
+          else {
+            // Lower is open, upper is unbounded.
+            assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
+            ++g_coord;
+          }
+        else
+          // The lower bound is in the interval.
+          assign_r(g_coord, seq_i.lower(), ROUND_NOT_NEEDED);
       else {
-	// Lower is unbounded, hence upper is bounded
-	// (since we know that 0 does not belong to the interval).
-	PPL_ASSERT(!seq_i.upper_is_boundary_infinity());
-	assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
-	if (seq_i.upper_is_open())
-	  --g_coord;
+        // Lower is unbounded, hence upper is bounded
+        // (since we know that 0 does not belong to the interval).
+        PPL_ASSERT(!seq_i.upper_is_boundary_infinity());
+        assign_r(g_coord, seq_i.upper(), ROUND_NOT_NEEDED);
+        if (seq_i.upper_is_open())
+          --g_coord;
       }
       break;
     case -1:
@@ -86459,7 +86542,7 @@ Box<ITV>::OK() const {
     if (tmp.check_empty()) {
 #ifndef NDEBUG
       std::cerr << "The box is empty, but it is marked as non-empty."
-		<< std::endl;
+                << std::endl;
 #endif // NDEBUG
       return false;
     }
@@ -86469,7 +86552,7 @@ Box<ITV>::OK() const {
   if (!marked_empty()) {
     for (dimension_type k = seq.size(); k-- > 0; )
       if (!seq[k].OK())
-	return false;
+        return false;
   }
 
   return true;
@@ -86998,7 +87081,7 @@ Box<ITV>::concatenate_assign(const Box& y) {
 
   // Here neither `x' nor `y' are marked empty: concatenate them.
   std::copy(y.seq.begin(), y.seq.end(),
-	    std::back_insert_iterator<Sequence>(x.seq));
+            std::back_insert_iterator<Sequence>(x.seq));
   // Update the `empty_up_to_date' flag.
   if (!y.status.test_empty_up_to_date())
     reset_empty_up_to_date();
@@ -87170,10 +87253,10 @@ Box<ITV>::time_elapse_assign(const Box& y) {
     const ITV& y_seq_i = y.seq[i];
     if (!x_seq_i.lower_is_boundary_infinity())
       if (y_seq_i.lower_is_boundary_infinity() || y_seq_i.lower() < 0)
-	x_seq_i.lower_extend();
+        x_seq_i.lower_extend();
     if (!x_seq_i.upper_is_boundary_infinity())
       if (y_seq_i.upper_is_boundary_infinity() || y_seq_i.upper() > 0)
-	x_seq_i.upper_extend();
+        x_seq_i.upper_extend();
   }
   PPL_ASSERT(x.OK());
 }
@@ -87195,7 +87278,7 @@ Box<ITV>::remove_space_dimensions(const Variables_Set& vars) {
   const dimension_type vsi_space_dim = vars.space_dimension();
   if (old_space_dim < vsi_space_dim)
     throw_dimension_incompatible("remove_space_dimensions(vs)",
-				 vsi_space_dim);
+                                 vsi_space_dim);
 
   const dimension_type new_space_dim = old_space_dim - vars.size();
 
@@ -87239,7 +87322,7 @@ Box<ITV>::remove_higher_space_dimensions(const dimension_type new_dimension) {
   const dimension_type space_dim = space_dimension();
   if (new_dimension > space_dim)
     throw_dimension_incompatible("remove_higher_space_dimensions(nd)",
-				 new_dimension);
+                                 new_dimension);
 
   // The removal of no dimensions from any box is a no-op.
   // Note that this case also captures the only legal removal of
@@ -87302,7 +87385,7 @@ Box<ITV>::fold_space_dimensions(const Variables_Set& vars,
   // All variables in `vars' should be dimensions of the box.
   if (vars.space_dimension() > space_dim)
     throw_dimension_incompatible("fold_space_dimensions(vs, v)",
-				 vars.space_dimension());
+                                 vars.space_dimension());
 
   // Moreover, `dest.id()' should not occur in `vars'.
   if (vars.find(dest.id()) != vars.end())
@@ -87315,7 +87398,7 @@ Box<ITV>::fold_space_dimensions(const Variables_Set& vars,
     // corresponding to the variables in `vars'.
     ITV& seq_v = seq[dest.id()];
     for (Variables_Set::const_iterator i = vars.begin(),
-	   vs_end = vars.end(); i != vs_end; ++i)
+           vs_end = vars.end(); i != vs_end; ++i)
       seq_v.join_assign(seq[*i]);
   }
   remove_space_dimensions(vars);
@@ -87349,7 +87432,7 @@ Box<ITV>::add_constraint_no_check(const Constraint& c) {
     // Dealing with a trivial constraint.
     if (n < 0
         || (c.is_equality() && n != 0)
-	|| (c.is_strict_inequality() && n == 0))
+        || (c.is_strict_inequality() && n == 0))
       set_empty();
     return;
   }
@@ -87367,7 +87450,7 @@ Box<ITV>::add_constraints_no_check(const Constraint_System& cs) {
   // through all the constraints to fulfill the method's contract
   // for what concerns exception throwing.
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     add_constraint_no_check(*i);
   PPL_ASSERT(OK());
 }
@@ -87423,7 +87506,7 @@ Box<ITV>::add_congruences_no_check(const Congruence_System& cgs) {
   // through all the congruences to fulfill the method's contract
   // for what concerns exception throwing.
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i)
+         cgs_end = cgs.end(); i != cgs_end; ++i)
     add_congruence_no_check(*i);
   PPL_ASSERT(OK());
 }
@@ -87462,7 +87545,7 @@ void
 Box<ITV>::refine_no_check(const Constraint_System& cs) {
   PPL_ASSERT(cs.space_dimension() <= space_dimension());
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
+         cs_end = cs.end(); !marked_empty() && i != cs_end; ++i)
     refine_no_check(*i);
   PPL_ASSERT(OK());
 }
@@ -87492,7 +87575,7 @@ void
 Box<ITV>::refine_no_check(const Congruence_System& cgs) {
   PPL_ASSERT(cgs.space_dimension() <= space_dimension());
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
+         cgs_end = cgs.end(); !marked_empty() && i != cgs_end; ++i)
     refine_no_check(*i);
   PPL_ASSERT(OK());
 }
@@ -87547,7 +87630,8 @@ Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
   const Coefficient& c_inhomogeneous_term = c.inhomogeneous_term();
 
   // Find a space dimension having a non-zero coefficient (if any).
-  dimension_type last_k = c.expression().last_nonzero(1, c_space_dim + 1);
+  const dimension_type last_k
+    = c.expression().last_nonzero(1, c_space_dim + 1);
   if (last_k == c_space_dim + 1) {
     // Constraint c is trivial: check if it is inconsistent.
     if (c_inhomogeneous_term < 0
@@ -87563,144 +87647,146 @@ Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
   Temp_Boundary_Type t_a;
   Temp_Boundary_Type t_x;
   Ternary open;
-  const Constraint::Expression& c_e = c.expression();
-  for (Constraint::Expression::const_iterator k = c_e.begin(),
+  const Constraint::expr_type c_e = c.expression();
+  for (Constraint::expr_type::const_iterator k = c_e.begin(),
          k_end = c_e.lower_bound(Variable(last_k)); k != k_end; ++k) {
     const Coefficient& a_k = *k;
     const Variable k_var = k.variable();
-    int sgn_a_k = sgn(a_k);
+    const int sgn_a_k = sgn(a_k);
     if (sgn_a_k == 0)
       continue;
     Result r;
     if (sgn_a_k > 0) {
       open = (c_type == Constraint::STRICT_INEQUALITY) ? T_YES : T_NO;
       if (open == T_NO)
-	maybe_reset_fpu_inexact<Temp_Boundary_Type>();
+        maybe_reset_fpu_inexact<Temp_Boundary_Type>();
       r = assign_r(t_bound, c_inhomogeneous_term, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
+        goto maybe_refine_upper_1;
       r = neg_assign_r(t_bound, t_bound, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
+        goto maybe_refine_upper_1;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
             i_end = c_e.lower_bound(Variable(last_k)); i != i_end; ++i) {
         const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.lower_is_boundary_infinity())
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.upper_is_boundary_infinity())
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_1;
-	}
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.lower_is_boundary_infinity())
+            goto maybe_refine_upper_1;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.upper_is_boundary_infinity())
+            goto maybe_refine_upper_1;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_1;
+        }
       }
       r = assign_r(t_a, a_k, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
+        goto maybe_refine_upper_1;
       r = div_assign_r(t_bound, t_bound, t_a, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_1;
+        goto maybe_refine_upper_1;
 
       // Refine the lower bound of `seq[k]' with `t_bound'.
       if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
       {
-        Relation_Symbol rel = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
+        const Relation_Symbol rel
+          = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
         seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
       }
       reset_empty_up_to_date();
     maybe_refine_upper_1:
       if (c_type != Constraint::EQUALITY)
-	continue;
+        continue;
       open = T_NO;
       maybe_reset_fpu_inexact<Temp_Boundary_Type>();
       r = assign_r(t_bound, c_inhomogeneous_term, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
+        goto next_k;
       r = neg_assign_r(t_bound, t_bound, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
+        goto next_k;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
             i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
         const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.upper_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.lower_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.upper_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.lower_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
       }
       r = assign_r(t_a, a_k, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
+        goto next_k;
       r = div_assign_r(t_bound, t_bound, t_a, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
+        goto next_k;
 
       // Refine the upper bound of seq[k] with t_bound.
       if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
-      Relation_Symbol rel = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
+      const Relation_Symbol rel
+        = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
       seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
       reset_empty_up_to_date();
     }
@@ -87708,132 +87794,134 @@ Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
       PPL_ASSERT(sgn_a_k < 0);
       open = (c_type == Constraint::STRICT_INEQUALITY) ? T_YES : T_NO;
       if (open == T_NO)
-	maybe_reset_fpu_inexact<Temp_Boundary_Type>();
+        maybe_reset_fpu_inexact<Temp_Boundary_Type>();
       r = assign_r(t_bound, c_inhomogeneous_term, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
+        goto maybe_refine_upper_2;
       r = neg_assign_r(t_bound, t_bound, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
+        goto maybe_refine_upper_2;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
             i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
         const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.lower_is_boundary_infinity())
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.upper_is_boundary_infinity())
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto maybe_refine_upper_2;
-	}
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.lower_is_boundary_infinity())
+            goto maybe_refine_upper_2;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.upper_is_boundary_infinity())
+            goto maybe_refine_upper_2;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto maybe_refine_upper_2;
+        }
       }
       r = assign_r(t_a, a_k, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
+        goto maybe_refine_upper_2;
       r = div_assign_r(t_bound, t_bound, t_a, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto maybe_refine_upper_2;
+        goto maybe_refine_upper_2;
 
       // Refine the upper bound of seq[k] with t_bound.
       if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
       {
-        Relation_Symbol rel = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
+        const Relation_Symbol rel
+          = (open == T_YES) ? LESS_THAN : LESS_OR_EQUAL;
         seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
       }
       reset_empty_up_to_date();
     maybe_refine_upper_2:
       if (c_type != Constraint::EQUALITY)
-	continue;
+        continue;
       open = T_NO;
       maybe_reset_fpu_inexact<Temp_Boundary_Type>();
       r = assign_r(t_bound, c_inhomogeneous_term, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
+        goto next_k;
       r = neg_assign_r(t_bound, t_bound, ROUND_UP);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
-      for (Constraint::Expression::const_iterator i = c_e.begin(),
+        goto next_k;
+      for (Constraint::expr_type::const_iterator i = c_e.begin(),
             i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
         const Variable i_var = i.variable();
-	if (i_var.id() == k_var.id())
-	  continue;
-	const Coefficient& a_i = *i;
-	int sgn_a_i = sgn(a_i);
-	ITV& x_i = seq[i_var.id()];
-	if (sgn_a_i < 0) {
-	  if (x_i.upper_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.upper(), ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.upper_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
-	else {
-	  PPL_ASSERT(sgn_a_i > 0);
-	  if (x_i.lower_is_boundary_infinity())
-	    goto next_k;
-	  r = assign_r(t_a, a_i, ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	  if (x_i.lower_is_open())
-	    open = T_YES;
-	  r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
-	  if (propagate_constraint_check_result(r, open))
-	    goto next_k;
-	}
+        if (i_var.id() == k_var.id())
+          continue;
+        const Coefficient& a_i = *i;
+        const int sgn_a_i = sgn(a_i);
+        ITV& x_i = seq[i_var.id()];
+        if (sgn_a_i < 0) {
+          if (x_i.upper_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.upper(), ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.upper_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
+        else {
+          PPL_ASSERT(sgn_a_i > 0);
+          if (x_i.lower_is_boundary_infinity())
+            goto next_k;
+          r = assign_r(t_a, a_i, ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          r = assign_r(t_x, x_i.lower(), ROUND_DOWN);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+          if (x_i.lower_is_open())
+            open = T_YES;
+          r = sub_mul_assign_r(t_bound, t_a, t_x, ROUND_UP);
+          if (propagate_constraint_check_result(r, open))
+            goto next_k;
+        }
       }
       r = assign_r(t_a, a_k, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
+        goto next_k;
       r = div_assign_r(t_bound, t_bound, t_a, ROUND_DOWN);
       if (propagate_constraint_check_result(r, open))
-	goto next_k;
+        goto next_k;
 
       // Refine the lower bound of seq[k] with t_bound.
       if (open == T_MAYBE
-	  && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
-	open = T_YES;
-      Relation_Symbol rel = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
+          && maybe_check_fpu_inexact<Temp_Boundary_Type>() == 1)
+        open = T_YES;
+      const Relation_Symbol rel
+        = (open == T_YES) ? GREATER_THAN : GREATER_OR_EQUAL;
       seq[k_var.id()].add_constraint(i_constraint(rel, t_bound));
       reset_empty_up_to_date();
     }
@@ -87852,7 +87940,7 @@ Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
   dimension_type c_space_dim = c.space_dimension();
   ITV k[c_space_dim];
   ITV p[c_space_dim];
-  for (Constraint::Expression::const_iterator i = c_e.begin(),
+  for (Constraint::expr_type::const_iterator i = c_e.begin(),
         i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
     const Variable i_var = i.variable();
     k[i_var.id()] = *i;
@@ -87861,16 +87949,16 @@ Box<ITV>::propagate_constraint_no_check(const Constraint& c) {
     p_i.mul_assign(p_i, k[i_var.id()]);
   }
   const Coefficient& inhomogeneous_term = c.inhomogeneous_term();
-  for (Constraint::Expression::const_iterator i = c_e.begin(),
+  for (Constraint::expr_type::const_iterator i = c_e.begin(),
         i_end = c_e.lower_bound(Variable(c_space_dim)); i != i_end; ++i) {
     const Variable i_var = i.variable();
     int sgn_coefficient_i = sgn(*i);
     ITV q(inhomogeneous_term);
-    for (Constraint::Expression::const_iterator j = c_e.begin(),
+    for (Constraint::expr_type::const_iterator j = c_e.begin(),
           j_end = c_e.lower_bound(Variable(c_space_dim)); j != j_end; ++j) {
       const Variable j_var = j.variable();
       if (i_var == j_var)
-	continue;
+        continue;
       q.add_assign(q, p[j_var.id()]);
     }
     q.div_assign(q, k[i_var.id()]);
@@ -87964,7 +88052,9 @@ Box<ITV>::affine_image(const Variable var,
   if (is_empty())
     return;
 
-  Tmp_Interval_Type expr_value, temp0, temp1;
+  Tmp_Interval_Type expr_value;
+  Tmp_Interval_Type temp0;
+  Tmp_Interval_Type temp1;
   expr_value.assign(expr.inhomogeneous_term());
   for (Linear_Expression::const_iterator i = expr.begin(),
           i_end = expr.end(); i != i_end; ++i) {
@@ -88044,7 +88134,9 @@ Box<ITV>::affine_preimage(const Variable var,
   const Coefficient& expr_v = expr.coefficient(var);
   const bool invertible = (expr_v != 0);
   if (!invertible) {
-    Tmp_Interval_Type expr_value, temp0, temp1;
+    Tmp_Interval_Type expr_value;
+    Tmp_Interval_Type temp0;
+    Tmp_Interval_Type temp1;
     expr_value.assign(expr.inhomogeneous_term());
     for (Linear_Expression::const_iterator i = expr.begin(),
             i_end = expr.end(); i != i_end; ++i) {
@@ -88095,11 +88187,11 @@ Box<ITV>
   const dimension_type lb_space_dim = lb_expr.space_dimension();
   if (space_dim < lb_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "lb", lb_expr);
+                                 "lb", lb_expr);
   const dimension_type ub_space_dim = ub_expr.space_dimension();
   if (space_dim < ub_space_dim)
     throw_dimension_incompatible("bounded_affine_image(v, lb, ub, d)",
-				 "ub", ub_expr);
+                                 "ub", ub_expr);
     // `var' should be one of the dimensions of the box.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
@@ -88119,9 +88211,9 @@ Box<ITV>
   if (lb_expr.coefficient(var) == 0) {
     // Here `var' can only occur in `ub_expr'.
     generalized_affine_image(var,
-			     LESS_OR_EQUAL,
-			     ub_expr,
-			     denominator);
+                             LESS_OR_EQUAL,
+                             ub_expr,
+                             denominator);
     if (denominator > 0)
       refine_with_constraint(lb_expr <= denominator*var);
     else
@@ -88130,9 +88222,9 @@ Box<ITV>
   else if (ub_expr.coefficient(var) == 0) {
     // Here `var' can only occur in `lb_expr'.
     generalized_affine_image(var,
-			     GREATER_OR_EQUAL,
-			     lb_expr,
-			     denominator);
+                             GREATER_OR_EQUAL,
+                             lb_expr,
+                             denominator);
     if (denominator > 0)
       refine_with_constraint(denominator*var <= ub_expr);
     else
@@ -88152,42 +88244,42 @@ Box<ITV>
     ITV& seq_v = seq[var.id()];
     if (maximize(ub_expr, max_numer, max_denom, max_included)) {
       if (minimize(lb_expr, min_numer, min_denom, min_included)) {
-	// The `ub_expr' has a maximum value and the `lb_expr'
-	// has a minimum value for the box.
-	// Set the bounds for `var' using the minimum for `lb_expr'.
-	min_denom *= denominator;
-	PPL_DIRTY_TEMP(mpq_class, q1);
-	PPL_DIRTY_TEMP(mpq_class, q2);
-	assign_r(q1.get_num(), min_numer, ROUND_NOT_NEEDED);
-	assign_r(q1.get_den(), min_denom, ROUND_NOT_NEEDED);
-	q1.canonicalize();
-	// Now make the maximum of lb_expr the upper bound.  If the
-	// maximum is not at a box point, then inequality is strict.
-	max_denom *= denominator;
-	assign_r(q2.get_num(), max_numer, ROUND_NOT_NEEDED);
-	assign_r(q2.get_den(), max_denom, ROUND_NOT_NEEDED);
-	q2.canonicalize();
+        // The `ub_expr' has a maximum value and the `lb_expr'
+        // has a minimum value for the box.
+        // Set the bounds for `var' using the minimum for `lb_expr'.
+        min_denom *= denominator;
+        PPL_DIRTY_TEMP(mpq_class, q1);
+        PPL_DIRTY_TEMP(mpq_class, q2);
+        assign_r(q1.get_num(), min_numer, ROUND_NOT_NEEDED);
+        assign_r(q1.get_den(), min_denom, ROUND_NOT_NEEDED);
+        q1.canonicalize();
+        // Now make the maximum of lb_expr the upper bound.  If the
+        // maximum is not at a box point, then inequality is strict.
+        max_denom *= denominator;
+        assign_r(q2.get_num(), max_numer, ROUND_NOT_NEEDED);
+        assign_r(q2.get_den(), max_denom, ROUND_NOT_NEEDED);
+        q2.canonicalize();
 
         if (denominator > 0) {
           Relation_Symbol gr = min_included ? GREATER_OR_EQUAL : GREATER_THAN;
           Relation_Symbol lr = max_included ? LESS_OR_EQUAL : LESS_THAN;
           seq_v.build(i_constraint(gr, q1), i_constraint(lr, q2));
         }
-	else {
+        else {
           Relation_Symbol gr = max_included ? GREATER_OR_EQUAL : GREATER_THAN;
           Relation_Symbol lr = min_included ? LESS_OR_EQUAL : LESS_THAN;
           seq_v.build(i_constraint(gr, q2), i_constraint(lr, q1));
         }
       }
       else {
-	// The `ub_expr' has a maximum value but the `lb_expr'
-	// has no minimum value for the box.
-	// Set the bounds for `var' using the maximum for `lb_expr'.
-	PPL_DIRTY_TEMP(mpq_class, q);
-	max_denom *= denominator;
-	assign_r(q.get_num(), max_numer, ROUND_NOT_NEEDED);
-	assign_r(q.get_den(), max_denom, ROUND_NOT_NEEDED);
-	q.canonicalize();
+        // The `ub_expr' has a maximum value but the `lb_expr'
+        // has no minimum value for the box.
+        // Set the bounds for `var' using the maximum for `lb_expr'.
+        PPL_DIRTY_TEMP(mpq_class, q);
+        max_denom *= denominator;
+        assign_r(q.get_num(), max_numer, ROUND_NOT_NEEDED);
+        assign_r(q.get_den(), max_denom, ROUND_NOT_NEEDED);
+        q.canonicalize();
         Relation_Symbol rel = (denominator > 0)
           ? (max_included ? LESS_OR_EQUAL : LESS_THAN)
           : (max_included ? GREATER_OR_EQUAL : GREATER_THAN);
@@ -88195,14 +88287,14 @@ Box<ITV>
       }
     }
     else if (minimize(lb_expr, min_numer, min_denom, min_included)) {
-	// The `ub_expr' has no maximum value but the `lb_expr'
-	// has a minimum value for the box.
-	// Set the bounds for `var' using the minimum for `lb_expr'.
-	min_denom *= denominator;
-	PPL_DIRTY_TEMP(mpq_class, q);
-	assign_r(q.get_num(), min_numer, ROUND_NOT_NEEDED);
-	assign_r(q.get_den(), min_denom, ROUND_NOT_NEEDED);
-	q.canonicalize();
+        // The `ub_expr' has no maximum value but the `lb_expr'
+        // has a minimum value for the box.
+        // Set the bounds for `var' using the minimum for `lb_expr'.
+        min_denom *= denominator;
+        PPL_DIRTY_TEMP(mpq_class, q);
+        assign_r(q.get_num(), min_numer, ROUND_NOT_NEEDED);
+        assign_r(q.get_den(), min_denom, ROUND_NOT_NEEDED);
+        q.canonicalize();
 
         Relation_Symbol rel = (denominator > 0)
           ? (min_included ? GREATER_OR_EQUAL : GREATER_THAN)
@@ -88236,17 +88328,17 @@ Box<ITV>
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "v", var);
+                                 "v", var);
   // The dimension of `lb_expr' and `ub_expr' should not be
   // greater than the dimension of `*this'.
   const dimension_type lb_space_dim = lb_expr.space_dimension();
   if (space_dim < lb_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "lb", lb_expr);
+                                 "lb", lb_expr);
   const dimension_type ub_space_dim = ub_expr.space_dimension();
   if (space_dim < ub_space_dim)
     throw_dimension_incompatible("bounded_affine_preimage(v, lb, ub, d)",
-				 "ub", ub_expr);
+                                 "ub", ub_expr);
 
   // Any preimage of an empty polyhedron is empty.
   if (marked_empty())
@@ -88406,12 +88498,12 @@ Box<ITV>
   // of `*this'.
   if (space_dim < expr.space_dimension())
     throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-				 "e", expr);
+                                 "e", expr);
   // `var' should be one of the dimensions of the box.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("generalized_affine_image(v, r, e, d)",
-				 "v", var);
+                                 "v", var);
 
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
@@ -88474,12 +88566,12 @@ Box<ITV>
   // of `*this'.
   if (space_dim < expr.space_dimension())
     throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-				 "e", expr);
+                                 "e", expr);
   // `var' should be one of the dimensions of the box.
   const dimension_type var_space_dim = var.space_dimension();
   if (space_dim < var_space_dim)
     throw_dimension_incompatible("generalized_affine_preimage(v, r, e, d)",
-				 "v", var);
+                                 "v", var);
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
     throw_invalid_argument("generalized_affine_preimage(v, r, e, d)",
@@ -88525,7 +88617,7 @@ Box<ITV>
       ? relsym
       : reversed_relsym;
     generalized_affine_image(var, inverse_relsym, inverse_expr,
-			     inverse_denominator);
+                             inverse_denominator);
     return;
   }
 
@@ -88613,13 +88705,13 @@ Box<ITV>
   const dimension_type space_dim = space_dimension();
   if (space_dim < lhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e1", lhs);
+                                 "e1", lhs);
   // The dimension of `rhs' should not be greater than the dimension
   // of `*this'.
   const dimension_type rhs_space_dim = rhs.space_dimension();
   if (space_dim < rhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e2", rhs);
+                                 "e2", rhs);
 
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
@@ -88712,16 +88804,16 @@ Box<ITV>
           seq_var.assign(UNIVERSE);
         break;
       case EQUAL:
-	{
-	  I_Constraint<mpq_class> l;
-	  I_Constraint<mpq_class> u;
-	  if (max_rhs)
-	    u.set(max_included ? LESS_OR_EQUAL : LESS_THAN, q_max);
-	  if (min_rhs)
-	    l.set(min_included ? GREATER_OR_EQUAL : GREATER_THAN, q_min);
-	  seq_var.build(l, u);
+        {
+          I_Constraint<mpq_class> l;
+          I_Constraint<mpq_class> u;
+          if (max_rhs)
+            u.set(max_included ? LESS_OR_EQUAL : LESS_THAN, q_max);
+          if (min_rhs)
+            l.set(min_included ? GREATER_OR_EQUAL : GREATER_THAN, q_min);
+          seq_var.build(l, u);
           break;
-	}
+        }
       case GREATER_OR_EQUAL:
         if (min_rhs) {
           Relation_Symbol rel = min_included ? GREATER_OR_EQUAL : GREATER_THAN;
@@ -88759,16 +88851,16 @@ Box<ITV>
           seq_var.assign(UNIVERSE);
         break;
       case EQUAL:
-	{
-	  I_Constraint<mpq_class> l;
-	  I_Constraint<mpq_class> u;
-	  if (max_rhs)
-	    l.set(max_included ? GREATER_OR_EQUAL : GREATER_THAN, q_max);
-	  if (min_rhs)
-	    u.set(min_included ? LESS_OR_EQUAL : LESS_THAN, q_min);
-	  seq_var.build(l, u);
+        {
+          I_Constraint<mpq_class> l;
+          I_Constraint<mpq_class> u;
+          if (max_rhs)
+            l.set(max_included ? GREATER_OR_EQUAL : GREATER_THAN, q_max);
+          if (min_rhs)
+            u.set(min_included ? LESS_OR_EQUAL : LESS_THAN, q_min);
+          seq_var.build(l, u);
           break;
-	}
+        }
       case LESS_OR_EQUAL:
         if (max_rhs) {
           Relation_Symbol rel = max_included ? GREATER_OR_EQUAL : GREATER_THAN;
@@ -88831,13 +88923,13 @@ Box<ITV>::generalized_affine_preimage(const Linear_Expression& lhs,
   const dimension_type space_dim = space_dimension();
   if (space_dim < lhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e1", lhs);
+                                 "e1", lhs);
   // The dimension of `rhs' should not be greater than the dimension
   // of `*this'.
   const dimension_type rhs_space_dim = rhs.space_dimension();
   if (space_dim < rhs_space_dim)
     throw_dimension_incompatible("generalized_affine_image(e1, r, e2)",
-				 "e2", rhs);
+                                 "e2", rhs);
 
   // The relation symbol cannot be a disequality.
   if (relsym == NOT_EQUAL)
@@ -88906,9 +88998,9 @@ Box<ITV>::CC76_widening_assign(const T& y, unsigned* tp) {
     return;
   }
   x.CC76_widening_assign(y,
-			 stop_points,
-			 stop_points
-			 + sizeof(stop_points)/sizeof(stop_points[0]));
+                         stop_points,
+                         stop_points
+                         + sizeof(stop_points)/sizeof(stop_points[0]));
 }
 
 template <typename ITV>
@@ -89016,12 +89108,12 @@ Box<ITV>::CC76_narrowing_assign(const T& y) {
     ITV& x_i = seq[i];
     const ITV& y_i = y.seq[i];
     if (!x_i.lower_is_boundary_infinity()
-	&& !y_i.lower_is_boundary_infinity()
-	&& x_i.lower() != y_i.lower())
+        && !y_i.lower_is_boundary_infinity()
+        && x_i.lower() != y_i.lower())
       x_i.lower() = y_i.lower();
     if (!x_i.upper_is_boundary_infinity()
-	&& !y_i.upper_is_boundary_infinity()
-	&& x_i.upper() != y_i.upper())
+        && !y_i.upper_is_boundary_infinity()
+        && x_i.upper() != y_i.upper())
       x_i.upper() = y_i.upper();
   }
   PPL_ASSERT(OK());
@@ -89162,13 +89254,13 @@ IO_Operators::operator<<(std::ostream& s, const Box<ITV>& box) {
     s << "true";
   else
     for (dimension_type k = 0,
-	   space_dim = box.space_dimension(); k < space_dim; ) {
+           space_dim = box.space_dimension(); k < space_dim; ) {
       s << Variable(k) << " in " << box[k];
       ++k;
       if (k < space_dim)
-	s << ", ";
+        s << ", ";
       else
-	break;
+        break;
     }
   return s;
 }
@@ -89229,7 +89321,7 @@ template <typename ITV>
 void
 Box<ITV>
 ::throw_dimension_incompatible(const char* method,
-			       dimension_type required_dim) const {
+                               dimension_type required_dim) const {
   std::ostringstream s;
   s << "PPL::Box::" << method << ":" << std::endl
     << "this->space_dimension() == " << space_dimension()
@@ -89352,12 +89444,12 @@ Box<ITV>::throw_invalid_argument(const char* method, const char* reason) {
 /*! \relates Box */
 #endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
 template <typename Specialization,
-	  typename Temp, typename To, typename ITV>
+          typename Temp, typename To, typename ITV>
 bool
 l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
-		    const Box<ITV>& x, const Box<ITV>& y,
-		    const Rounding_Dir dir,
-		    Temp& tmp0, Temp& tmp1, Temp& tmp2) {
+                    const Box<ITV>& x, const Box<ITV>& y,
+                    const Rounding_Dir dir,
+                    Temp& tmp0, Temp& tmp1, Temp& tmp2) {
   const dimension_type x_space_dim = x.space_dimension();
   // Dimension-compatibility check.
   if (x_space_dim != y.space_dimension())
@@ -89393,7 +89485,7 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
     // Dealing with the lower bounds.
     if (x_i.lower_is_boundary_infinity()) {
       if (!y_i.lower_is_boundary_infinity())
-	goto pinf;
+        goto pinf;
     }
     else if (y_i.lower_is_boundary_infinity())
       goto pinf;
@@ -89401,12 +89493,12 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
       const Temp* tmp1p;
       const Temp* tmp2p;
       if (x_i.lower() > y_i.lower()) {
-	maybe_assign(tmp1p, tmp1, x_i.lower(), dir);
-	maybe_assign(tmp2p, tmp2, y_i.lower(), inverse(dir));
+        maybe_assign(tmp1p, tmp1, x_i.lower(), dir);
+        maybe_assign(tmp2p, tmp2, y_i.lower(), inverse(dir));
       }
       else {
-	maybe_assign(tmp1p, tmp1, y_i.lower(), dir);
-	maybe_assign(tmp2p, tmp2, x_i.lower(), inverse(dir));
+        maybe_assign(tmp1p, tmp1, y_i.lower(), dir);
+        maybe_assign(tmp2p, tmp2, x_i.lower(), inverse(dir));
       }
       sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
       PPL_ASSERT(sgn(tmp1) >= 0);
@@ -89415,21 +89507,21 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
     // Dealing with the lower bounds.
     if (x_i.upper_is_boundary_infinity())
       if (y_i.upper_is_boundary_infinity())
-	continue;
+        continue;
       else
-	goto pinf;
+        goto pinf;
     else if (y_i.upper_is_boundary_infinity())
       goto pinf;
     else {
       const Temp* tmp1p;
       const Temp* tmp2p;
       if (x_i.upper() > y_i.upper()) {
-	maybe_assign(tmp1p, tmp1, x_i.upper(), dir);
-	maybe_assign(tmp2p, tmp2, y_i.upper(), inverse(dir));
+        maybe_assign(tmp1p, tmp1, x_i.upper(), dir);
+        maybe_assign(tmp2p, tmp2, y_i.upper(), inverse(dir));
       }
       else {
-	maybe_assign(tmp1p, tmp1, y_i.upper(), dir);
-	maybe_assign(tmp2p, tmp2, x_i.upper(), inverse(dir));
+        maybe_assign(tmp1p, tmp1, y_i.upper(), dir);
+        maybe_assign(tmp2p, tmp2, x_i.upper(), inverse(dir));
       }
       sub_assign_r(tmp1, *tmp1p, *tmp2p, dir);
       PPL_ASSERT(sgn(tmp1) >= 0);
@@ -89447,9 +89539,9 @@ l_m_distance_assign(Checked_Number<To, Extended_Number_Policy>& r,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Box.defs.hh line 2285. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Box_defs.hh line 2285. */
 
-/* Automatically generated from PPL source file ../src/Linear_Form.templates.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Linear_Form_templates.hh line 30. */
 #include <stdexcept>
 #include <iostream>
 #include <cmath>
@@ -89689,7 +89781,7 @@ operator+=(Linear_Form<C>& f, const Variable v) {
   if (v_space_dim > Linear_Form<C>::max_space_dimension())
     throw std::length_error("Linear_Form<C>& "
                             "operator+=(e, v):\n"
-			    "v exceeds the maximum allowed space dimension.");
+                            "v exceeds the maximum allowed space dimension.");
   if (v_space_dim > f.space_dimension())
     f.extend(v_space_dim+1);
   f[v_space_dim] += C(typename C::boundary_type(1));
@@ -89717,7 +89809,7 @@ operator-=(Linear_Form<C>& f, const Variable v) {
   if (v_space_dim > Linear_Form<C>::max_space_dimension())
     throw std::length_error("Linear_Form<C>& "
                             "operator-=(e, v):\n"
-			    "v exceeds the maximum allowed space dimension.");
+                            "v exceeds the maximum allowed space dimension.");
   if (v_space_dim > f.space_dimension())
     f.extend(v_space_dim+1);
   f[v_space_dim] -= C(typename C::boundary_type(1));
@@ -89805,7 +89897,7 @@ Linear_Form<C>::OK() const {
 template <typename C>
 void
 Linear_Form<C>::relative_error(
-		const Floating_Point_Format analyzed_format,
+                const Floating_Point_Format analyzed_format,
                 Linear_Form& result) const {
   typedef typename C::boundary_type analyzer_format;
 
@@ -89928,7 +90020,7 @@ IO_Operators::operator<<(std::ostream& s, const Linear_Form<C>& f) {
   const C& it = f[0];
   if (it != 0) {
     if (!first)
-	s << " + ";
+        s << " + ";
     else
       first = false;
     s << it;
@@ -89947,17 +90039,17 @@ C Linear_Form<C>::zero(typename C::boundary_type(0));
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/linearize.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/linearize.hh line 1. */
 /* Linearization function implementation.
 */
 
 
-/* Automatically generated from PPL source file ../src/Concrete_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Concrete_Expression_defs.hh line 1. */
 /* Concrete_Expression class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Concrete_Expression.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Concrete_Expression_defs.hh line 30. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -90058,20 +90150,20 @@ public:
   //! Returns the kind of \* this.
   Concrete_Expression_Kind kind() const;
 
-  //! Tests if \p *this has the same kind as <CODE>Derived<Target></CODE>.
+  //! Tests if \p *this has the same kind as <CODE>Derived\<Target\></CODE>.
   template <template <typename T> class Derived>
   bool is() const;
 
   /*! \brief
     Returns a pointer to \p *this converted to type
-    <CODE>Derived<Target>*</CODE>.
+    <CODE>Derived\<Target\>*</CODE>.
   */
   template <template <typename T> class Derived>
   Derived<Target>* as();
 
   /*! \brief
     Returns a pointer to \p *this converted to type
-    <CODE>const Derived<Target>*</CODE>.
+    <CODE>const Derived\<Target\>*</CODE>.
   */
   template <template <typename T> class Derived>
   const Derived<Target>* as() const;
@@ -90127,7 +90219,7 @@ class Approximable_Reference_Common {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Concrete_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Concrete_Expression_inlines.hh line 1. */
 /* Concrete_Expression class implementation: inline functions.
 */
 
@@ -90180,25 +90272,25 @@ Concrete_Expression_Type::is_floating_point() const {
 
 inline Bounded_Integer_Type_Width
 Concrete_Expression_Type::bounded_integer_type_width() const {
-  unsigned int u = impl.bounded_integer_type_width;
+  const unsigned int u = impl.bounded_integer_type_width;
   return static_cast<Bounded_Integer_Type_Width>(u);
 }
 
 inline Bounded_Integer_Type_Representation
 Concrete_Expression_Type::bounded_integer_type_representation() const {
-  unsigned int u = impl.bounded_integer_type_representation;
+  const unsigned int u = impl.bounded_integer_type_representation;
   return static_cast<Bounded_Integer_Type_Representation>(u);
 }
 
 inline Bounded_Integer_Type_Overflow
 Concrete_Expression_Type::bounded_integer_type_overflow() const {
-  unsigned int u = impl.bounded_integer_type_overflow;
+  const unsigned int u = impl.bounded_integer_type_overflow;
   return static_cast<Bounded_Integer_Type_Overflow>(u);
 }
 
 inline Floating_Point_Format
 Concrete_Expression_Type::floating_point_format() const {
-  unsigned int u = impl.floating_point_format;
+  const unsigned int u = impl.floating_point_format;
   return static_cast<Floating_Point_Format>(u);
 }
 
@@ -90228,9 +90320,9 @@ Concrete_Expression_Common<Target>::as() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Concrete_Expression.defs.hh line 200. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Concrete_Expression_defs.hh line 200. */
 
-/* Automatically generated from PPL source file ../src/linearize.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/linearize.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -91029,7 +91121,7 @@ linearize(const Concrete_Expression<Target>& expr,
 
       result = FP_Linear_Form(variable_value->second);
       /* FIXME: do we really need to contemplate the possibility
-	 that an unbounded linear form was saved into lf_store? */
+         that an unbounded linear form was saved into lf_store? */
       return !result.overflows();
     }
 
@@ -91071,12 +91163,12 @@ linearize(const Concrete_Expression<Target>& expr,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/PIP_Tree.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Tree_defs.hh line 1. */
 /* PIP_Tree_Node class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/PIP_Tree.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Tree_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -91089,17 +91181,17 @@ typedef const PIP_Tree_Node* PIP_Tree;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_defs.hh line 1. */
 /* PIP_Problem class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.defs.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_defs.hh line 35. */
 #include <vector>
 #include <deque>
 #include <iosfwd>
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.defs.hh line 40. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_defs.hh line 40. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -91601,7 +91693,7 @@ public:
   */
   template <typename In>
   PIP_Problem(dimension_type dim, In first, In last,
-	      const Variables_Set& p_vars);
+              const Variables_Set& p_vars);
 
   //! Ordinary copy-constructor.
   PIP_Problem(const PIP_Problem& y);
@@ -91891,7 +91983,7 @@ private:
   friend class PIP_Solution_Node;
 };
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_inlines.hh line 1. */
 /* PIP_Problem class implementation: inline functions.
 */
 
@@ -91965,12 +92057,12 @@ swap(PIP_Problem& x, PIP_Problem& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_templates.hh line 1. */
 /* PIP_Problem class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.templates.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_templates.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -92024,11 +92116,11 @@ PIP_Problem::PIP_Problem(dimension_type dim,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/PIP_Problem.defs.hh line 833. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Problem_defs.hh line 833. */
 
-/* Automatically generated from PPL source file ../src/PIP_Tree.defs.hh line 36. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Tree_defs.hh line 36. */
 
-/* Automatically generated from PPL source file ../src/PIP_Tree.defs.hh line 40. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Tree_defs.hh line 40. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -92055,7 +92147,7 @@ protected:
 
   /*! \brief
     Returns \c true if and only if all the nodes in the subtree
-    rooted in \p *this is owned by \p *pip.
+    rooted in \p *this are owned by \p *owner.
   */
   virtual bool check_ownership(const PIP_Problem* owner) const = 0;
 
@@ -92823,7 +92915,7 @@ std::ostream& operator<<(std::ostream& os,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/PIP_Tree.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Tree_inlines.hh line 1. */
 /* PIP_Tree related class implementation: inline functions.
 */
 
@@ -92941,14 +93033,14 @@ swap(PIP_Tree_Node::Artificial_Parameter& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/PIP_Tree.defs.hh line 835. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/PIP_Tree_defs.hh line 835. */
 
-/* Automatically generated from PPL source file ../src/BHRZ03_Certificate.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BHRZ03_Certificate_defs.hh line 1. */
 /* BHRZ03_Certificate class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/BHRZ03_Certificate.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BHRZ03_Certificate_defs.hh line 31. */
 #include <vector>
 
 //! The convergence certificate for the BHRZ03 widening operator.
@@ -93006,7 +93098,7 @@ public:
   struct Compare {
     //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
     bool operator()(const BHRZ03_Certificate& x,
-		    const BHRZ03_Certificate& y) const;
+                    const BHRZ03_Certificate& y) const;
   };
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -93034,7 +93126,7 @@ private:
   std::vector<dimension_type> num_rays_null_coord;
 };
 
-/* Automatically generated from PPL source file ../src/BHRZ03_Certificate.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BHRZ03_Certificate_inlines.hh line 1. */
 /* BHRZ03_Certificate class implementation: inline functions.
 */
 
@@ -93067,7 +93159,7 @@ BHRZ03_Certificate::is_stabilizing(const Polyhedron& ph) const {
 
 inline bool
 BHRZ03_Certificate::Compare::operator()(const BHRZ03_Certificate& x,
-					const BHRZ03_Certificate& y) const {
+                                        const BHRZ03_Certificate& y) const {
   // For an efficient evaluation of the multiset ordering based
   // on this LGO relation, we want larger elements to come first.
   return x.compare(y) == 1;
@@ -93075,14 +93167,14 @@ BHRZ03_Certificate::Compare::operator()(const BHRZ03_Certificate& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/BHRZ03_Certificate.defs.hh line 117. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/BHRZ03_Certificate_defs.hh line 117. */
 
-/* Automatically generated from PPL source file ../src/H79_Certificate.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/H79_Certificate_defs.hh line 1. */
 /* H79_Certificate class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/H79_Certificate.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/H79_Certificate_defs.hh line 31. */
 #include <vector>
 
 //! A convergence certificate for the H79 widening operator.
@@ -93138,7 +93230,7 @@ public:
   struct Compare {
     //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
     bool operator()(const H79_Certificate& x,
-		    const H79_Certificate& y) const;
+                    const H79_Certificate& y) const;
   };
 
 private:
@@ -93148,12 +93240,12 @@ private:
   dimension_type num_constraints;
 };
 
-/* Automatically generated from PPL source file ../src/H79_Certificate.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/H79_Certificate_inlines.hh line 1. */
 /* H79_Certificate class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/H79_Certificate.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/H79_Certificate_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -93174,7 +93266,7 @@ H79_Certificate::~H79_Certificate() {
 
 inline bool
 H79_Certificate::Compare::operator()(const H79_Certificate& x,
-				     const H79_Certificate& y) const {
+                                     const H79_Certificate& y) const {
   // For an efficient evaluation of the multiset ordering based
   // on this LGO relation, we want larger elements to come first.
   return x.compare(y) == 1;
@@ -93197,16 +93289,16 @@ H79_Certificate::compare(const PH& ph) const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/H79_Certificate.defs.hh line 97. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/H79_Certificate_defs.hh line 97. */
 
-/* Automatically generated from PPL source file ../src/Grid_Certificate.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Certificate_defs.hh line 1. */
 /* Grid_Certificate class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Grid_Certificate.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Certificate_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/Grid_Certificate.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Certificate_defs.hh line 32. */
 #include <vector>
 
 //! The convergence certificate for the Grid widening operator.
@@ -93260,7 +93352,7 @@ public:
   struct Compare {
     //! Returns <CODE>true</CODE> if and only if \p x comes before \p y.
     bool operator()(const Grid_Certificate& x,
-		    const Grid_Certificate& y) const;
+                    const Grid_Certificate& y) const;
   };
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -93277,7 +93369,7 @@ private:
   dimension_type num_proper_congruences;
 };
 
-/* Automatically generated from PPL source file ../src/Grid_Certificate.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Certificate_inlines.hh line 1. */
 /* Grid_Certificate class implementation: inline functions.
 */
 
@@ -93308,7 +93400,7 @@ Grid_Certificate::is_stabilizing(const Grid& gr) const {
 
 inline bool
 Grid_Certificate::Compare::operator()(const Grid_Certificate& x,
-				      const Grid_Certificate& y) const {
+                                      const Grid_Certificate& y) const {
   // For an efficient evaluation of the multiset ordering based
   // on this LGO relation, we want larger elements to come first.
   return x.compare(y) == 1;
@@ -93316,14 +93408,14 @@ Grid_Certificate::Compare::operator()(const Grid_Certificate& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Grid_Certificate.defs.hh line 103. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Grid_Certificate_defs.hh line 103. */
 
-/* Automatically generated from PPL source file ../src/Partial_Function.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partial_Function_defs.hh line 1. */
 /* Partial_Function class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Partial_Function.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partial_Function_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -93332,7 +93424,7 @@ class Partial_Function;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partial_Function.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partial_Function_defs.hh line 29. */
 #include <vector>
 #ifndef NDEBUG
 #include <set>
@@ -93389,13 +93481,13 @@ private:
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partial_Function.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partial_Function_inlines.hh line 1. */
 /* Partial_Function class implementation: inline functions.
 */
 
 
 #include <stdexcept>
-/* Automatically generated from PPL source file ../src/Partial_Function.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partial_Function_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -93414,7 +93506,7 @@ inline dimension_type
 Partial_Function::max_in_codomain() const {
   if (has_empty_codomain())
     throw std::runtime_error("Partial_Function::max_in_codomain() called"
-			     " when has_empty_codomain()");
+                             " when has_empty_codomain()");
   PPL_ASSERT(codomain.begin() != codomain.end()
              && max == *codomain.rbegin());
   return max;
@@ -93448,7 +93540,7 @@ inline bool
 Partial_Function::maps(dimension_type i, dimension_type& j) const {
   if (i >= vec.size())
     return false;
-  dimension_type vec_i = vec[i];
+  const dimension_type vec_i = vec[i];
   if (vec_i == not_a_dimension())
     return false;
   j = vec_i;
@@ -93457,14 +93549,14 @@ Partial_Function::maps(dimension_type i, dimension_type& j) const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partial_Function.defs.hh line 86. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partial_Function_defs.hh line 86. */
 
-/* Automatically generated from PPL source file ../src/Widening_Function.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Widening_Function_defs.hh line 1. */
 /* Widening_Function class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Widening_Function.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Widening_Function_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -93477,7 +93569,7 @@ class Limited_Widening_Function;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Widening_Function.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Widening_Function_defs.hh line 29. */
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 //! Wraps a widening method into a function object.
@@ -93527,7 +93619,7 @@ public:
     The constraint system limiting the widening.
   */
   Limited_Widening_Function(Limited_Widening_Method lwm,
-			    const CSYS& cs);
+                            const CSYS& cs);
 
   //! Function-application operator.
   /*!
@@ -93570,16 +93662,16 @@ widen_fun_ref(void (PSET::* wm)(const PSET&, unsigned*));
 template <typename PSET, typename CSYS>
 Limited_Widening_Function<PSET, CSYS>
 widen_fun_ref(void (PSET::* lwm)(const PSET&, const CSYS&, unsigned*),
-	      const CSYS& cs);
+              const CSYS& cs);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Widening_Function.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Widening_Function_inlines.hh line 1. */
 /* Widening_Function class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Widening_Function.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Widening_Function_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -93598,7 +93690,7 @@ operator()(PSET& x, const PSET& y, unsigned* tp) const {
 template <typename PSET, typename CSYS>
 Limited_Widening_Function<PSET, CSYS>::
 Limited_Widening_Function(Limited_Widening_Method lwm,
-			  const CSYS& cs)
+                          const CSYS& cs)
   : lw_method(lwm), limiting_cs(cs) {
 }
 
@@ -93620,26 +93712,26 @@ widen_fun_ref(void (PSET::* wm)(const PSET&, unsigned*)) {
 template <typename PSET, typename CSYS>
 inline Limited_Widening_Function<PSET, CSYS>
 widen_fun_ref(void (PSET::* lwm)(const PSET&, const CSYS&, unsigned*),
-	      const CSYS& cs) {
+              const CSYS& cs) {
   return Limited_Widening_Function<PSET, CSYS>(lwm, cs);
 }
 
 } // namespace Parma_Polyhedra_Library
 
 
-/* Automatically generated from PPL source file ../src/Widening_Function.defs.hh line 126. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Widening_Function_defs.hh line 126. */
 
-/* Automatically generated from PPL source file ../src/max_space_dimension.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/max_space_dimension.hh line 1. */
 /* Definition of functions yielding maximal space dimensions.
 */
 
 
-/* Automatically generated from PPL source file ../src/NNC_Polyhedron.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/NNC_Polyhedron_defs.hh line 1. */
 /* NNC_Polyhedron class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/NNC_Polyhedron.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/NNC_Polyhedron_defs.hh line 31. */
 
 //! A not necessarily closed convex polyhedron.
 /*! \ingroup PPL_CXX_interface
@@ -93672,7 +93764,7 @@ public:
     by default, a 0-dimension space universe NNC polyhedron is built.
   */
   explicit NNC_Polyhedron(dimension_type num_dimensions = 0,
-			  Degenerate_Element kind = UNIVERSE);
+                          Degenerate_Element kind = UNIVERSE);
 
   //! Builds an NNC polyhedron from a system of constraints.
   /*!
@@ -93863,12 +93955,12 @@ public:
   bool upper_bound_assign_if_exact(const NNC_Polyhedron& y);
 };
 
-/* Automatically generated from PPL source file ../src/NNC_Polyhedron.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/NNC_Polyhedron_inlines.hh line 1. */
 /* NNC_Polyhedron class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/NNC_Polyhedron.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/NNC_Polyhedron_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -93878,14 +93970,14 @@ NNC_Polyhedron::~NNC_Polyhedron() {
 
 inline
 NNC_Polyhedron::NNC_Polyhedron(dimension_type num_dimensions,
-			       Degenerate_Element kind)
+                               Degenerate_Element kind)
   : Polyhedron(NOT_NECESSARILY_CLOSED,
                check_space_dimension_overflow(num_dimensions,
                                               NOT_NECESSARILY_CLOSED,
                                               "NNC_Polyhedron(n, k)",
                                               "n exceeds the maximum "
                                               "allowed space dimension"),
-	       kind) {
+               kind) {
 }
 
 inline
@@ -93906,7 +93998,7 @@ NNC_Polyhedron::NNC_Polyhedron(Constraint_System& cs, Recycle_Input)
                                                   "the space dimension of cs "
                                                   "exceeds the maximum allowed "
                                                   "space dimension"),
-	       Recycle_Input()) {
+               Recycle_Input()) {
 }
 
 inline
@@ -93927,7 +94019,7 @@ NNC_Polyhedron::NNC_Polyhedron(Generator_System& gs, Recycle_Input)
                                                   "the space dimension of gs "
                                                   "exceeds the maximum allowed "
                                                   "space dimension"),
-	       Recycle_Input()) {
+               Recycle_Input()) {
 }
 
 template <typename Interval>
@@ -93994,14 +94086,14 @@ NNC_Polyhedron::upper_bound_assign_if_exact(const NNC_Polyhedron& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/NNC_Polyhedron.defs.hh line 255. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/NNC_Polyhedron_defs.hh line 255. */
 
-/* Automatically generated from PPL source file ../src/Rational_Box.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rational_Box.hh line 1. */
 /* Rational_Box class declaration and implementation.
 */
 
 
-/* Automatically generated from PPL source file ../src/Rational_Box.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Rational_Box.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -94012,7 +94104,7 @@ typedef Box<Rational_Interval> Rational_Box;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/max_space_dimension.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/max_space_dimension.hh line 34. */
 #include <algorithm>
 
 namespace Parma_Polyhedra_Library {
@@ -94056,17 +94148,17 @@ max_space_dimension() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/algorithms.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/algorithms.hh line 1. */
 /* A collection of useful convex polyhedra algorithms: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_defs.hh line 1. */
 /* Pointset_Powerset class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -94076,12 +94168,12 @@ class Pointset_Powerset;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_defs.hh line 1. */
 /* Partially_Reduced_Product class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.defs.hh line 49. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_defs.hh line 49. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -94102,7 +94194,7 @@ operator<<(std::ostream& s, const Partially_Reduced_Product<D1, D2, R>& dp);
 /*! \relates Partially_Reduced_Product */
 template <typename D1, typename D2, typename R>
 void swap(Partially_Reduced_Product<D1, D2, R>& x,
-	  Partially_Reduced_Product<D1, D2, R>& y);
+          Partially_Reduced_Product<D1, D2, R>& y);
 
 /*! \brief
   Returns <CODE>true</CODE> if and only if the components of \p x and \p y
@@ -94114,7 +94206,7 @@ void swap(Partially_Reduced_Product<D1, D2, R>& x,
 */
 template <typename D1, typename D2, typename R>
 bool operator==(const Partially_Reduced_Product<D1, D2, R>& x,
-		const Partially_Reduced_Product<D1, D2, R>& y);
+                const Partially_Reduced_Product<D1, D2, R>& y);
 
 /*! \brief
   Returns <CODE>true</CODE> if and only if the components of \p x and \p y
@@ -94126,7 +94218,7 @@ bool operator==(const Partially_Reduced_Product<D1, D2, R>& x,
 */
 template <typename D1, typename D2, typename R>
 bool operator!=(const Partially_Reduced_Product<D1, D2, R>& x,
-		const Partially_Reduced_Product<D1, D2, R>& y);
+                const Partially_Reduced_Product<D1, D2, R>& y);
 
 } // namespace Parma_Polyhedra_Library
 
@@ -94347,11 +94439,11 @@ public:
   <CODE>C_Polyhedron</CODE>,
   <CODE>NNC_Polyhedron</CODE>,
   <CODE>Grid</CODE>,
-  <CODE>Octagonal_Shape<T></CODE>,
-  <CODE>BD_Shape<T></CODE>,
-  <CODE>Box<T></CODE>.
+  <CODE>Octagonal_Shape\<T\></CODE>,
+  <CODE>BD_Shape\<T\></CODE>,
+  <CODE>Box\<T\></CODE>.
 
-  An object of the class <CODE>Partially_Reduced_Product<D1, D2, R></CODE>
+  An object of the class <CODE>Partially_Reduced_Product\<D1, D2, R\></CODE>
   represents the (partially reduced) product of two pointset domains \p D1
   and \p D2 where the form of any reduction is defined by the
   reduction class \p R.
@@ -94372,8 +94464,8 @@ public:
   The operations are defined to be the result of applying the corresponding
   operations on each of the components provided the product is already reduced
   by the reduction method defined by \p R.
-  In particular, if \p R is the <CODE>No_Reduction<D1, D2></CODE> class,
-  then the class <CODE>Partially_Reduced_Product<D1, D2, R></CODE> domain
+  In particular, if \p R is the <CODE>No_Reduction\<D1, D2\></CODE> class,
+  then the class <CODE>Partially_Reduced_Product\<D1, D2, R\></CODE> domain
   is the direct product as defined in \ref CC79 "[CC79]".
 
   How the results on the components are interpreted and
@@ -94392,7 +94484,7 @@ public:
 
   \par
   In all the examples it is assumed that the template \c R is the
-  <CODE>No_Reduction<D1, D2></CODE> class and that variables
+  <CODE>No_Reduction\<D1, D2\></CODE> class and that variables
   \c x and \c y are defined (where they are used) as follows:
   \code
   Variable x(0);
@@ -94472,7 +94564,7 @@ public:
     dimension.
   */
   explicit Partially_Reduced_Product(dimension_type num_dimensions = 0,
-				     Degenerate_Element kind = UNIVERSE);
+                                     Degenerate_Element kind = UNIVERSE);
 
   //! Builds a pair, copying a system of congruences.
   /*!
@@ -94838,7 +94930,7 @@ public:
     maximum are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -94869,8 +94961,8 @@ public:
     and \p g are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -94897,7 +94989,7 @@ public:
     and \p minimum are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty and
@@ -94928,8 +95020,8 @@ public:
     and \p point are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if each component of \p *this
@@ -95150,9 +95242,9 @@ public:
 
   */
   void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		    = Coefficient_one());
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                    = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the \ref  Single_Update_Affine_Functions
@@ -95175,9 +95267,9 @@ public:
     dimension-incompatible or if \p var is not a space dimension of \p *this.
   */
   void affine_preimage(Variable var,
-		       const Linear_Expression& expr,
-		       Coefficient_traits::const_reference denominator
-		         = Coefficient_one());
+                       const Linear_Expression& expr,
+                       Coefficient_traits::const_reference denominator
+                         = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -95207,10 +95299,10 @@ public:
     relation symbol.
   */
   void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				= Coefficient_one());
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -95241,10 +95333,10 @@ public:
   */
   void
   generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -95268,8 +95360,8 @@ public:
     relation symbol.
   */
   void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -95293,8 +95385,8 @@ public:
     relation symbol.
   */
   void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
 
   /*!
     \brief
@@ -95323,10 +95415,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
 
   /*!
     \brief
@@ -95355,10 +95447,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the result of computing the \ref Time_Elapse_Operator
@@ -95603,7 +95695,7 @@ public:
   //@} // Member Functions that May Modify the Dimension of the Vector Space
 
   friend bool operator==<>(const Partially_Reduced_Product<D1, D2, R>& x,
-			   const Partially_Reduced_Product<D1, D2, R>& y);
+                           const Partially_Reduced_Product<D1, D2, R>& y);
 
   friend std::ostream&
   Parma_Polyhedra_Library::IO_Operators::
@@ -95695,8 +95787,8 @@ namespace Parma_Polyhedra_Library {
   be supported in C++.
 
   When template typedefs will be supported in C++, what now is verbosely
-  denoted by Domain_Product<Domain1, Domain2>::Direct_Product will simply
-  be denoted by Direct_Product<Domain1, Domain2>.
+  denoted by <CODE>Domain_Product\<Domain1, Domain2\>::%Direct_Product</CODE>
+  will simply be denoted by <CODE>Direct_Product\<Domain1, Domain2\></CODE>.
 */
 template <typename D1, typename D2>
 class Domain_Product {
@@ -95719,12 +95811,12 @@ public:
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_inlines.hh line 1. */
 /* Partially_Reduced_Product class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.inlines.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_inlines.hh line 32. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -95740,7 +95832,7 @@ template <typename D1, typename D2, typename R>
 inline
 Partially_Reduced_Product<D1, D2, R>
 ::Partially_Reduced_Product(dimension_type num_dimensions,
-			    const Degenerate_Element kind)
+                            const Degenerate_Element kind)
   : d1(num_dimensions <= max_space_dimension()
        ? num_dimensions
        : (throw_space_dimension_overflow("Partially_Reduced_Product(n, k)",
@@ -95852,14 +95944,11 @@ inline
 Partially_Reduced_Product<D1, D2, R>
 ::Partially_Reduced_Product(const Partially_Reduced_Product<E1, E2, S>& y,
                             Complexity_Class complexity)
-  : d1(y.space_dimension()), d2(y.space_dimension()) {
+  : d1(y.space_dimension()), d2(y.space_dimension()), reduced(false) {
   Partially_Reduced_Product<D1, D2, R> pg1(y.domain1(), complexity);
   Partially_Reduced_Product<D1, D2, R> pg2(y.domain2(), complexity);
   pg1.intersection_assign(pg2);
   m_swap(pg1);
-  /* Even if y is reduced, the built product may not be reduced as
-     the reduction method may have changed (i.e., S != R). */
-  clear_reduced_flag();
 }
 
 template <typename D1, typename D2, typename R>
@@ -95964,8 +96053,8 @@ template <typename D1, typename D2, typename R>
 inline void
 Partially_Reduced_Product<D1, D2, R>
 ::affine_image(Variable var,
-	       const Linear_Expression& expr,
-	       Coefficient_traits::const_reference denominator) {
+               const Linear_Expression& expr,
+               Coefficient_traits::const_reference denominator) {
   d1.affine_image(var, expr, denominator);
   d2.affine_image(var, expr, denominator);
   clear_reduced_flag();
@@ -95975,8 +96064,8 @@ template <typename D1, typename D2, typename R>
 inline void
 Partially_Reduced_Product<D1, D2, R>
 ::affine_preimage(Variable var,
-		  const Linear_Expression& expr,
-		  Coefficient_traits::const_reference denominator) {
+                  const Linear_Expression& expr,
+                  Coefficient_traits::const_reference denominator) {
   d1.affine_preimage(var, expr, denominator);
   d2.affine_preimage(var, expr, denominator);
   clear_reduced_flag();
@@ -95986,9 +96075,9 @@ template <typename D1, typename D2, typename R>
 inline void
 Partially_Reduced_Product<D1, D2, R>
 ::generalized_affine_image(Variable var,
-			   const Relation_Symbol relsym,
-			   const Linear_Expression& expr,
-			   Coefficient_traits::const_reference denominator) {
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& expr,
+                           Coefficient_traits::const_reference denominator) {
   d1.generalized_affine_image(var, relsym, expr, denominator);
   d2.generalized_affine_image(var, relsym, expr, denominator);
   clear_reduced_flag();
@@ -95998,9 +96087,9 @@ template <typename D1, typename D2, typename R>
 inline void
 Partially_Reduced_Product<D1, D2, R>
 ::generalized_affine_preimage(Variable var,
-			      const Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator) {
+                              const Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator) {
   d1.generalized_affine_preimage(var, relsym, expr, denominator);
   d2.generalized_affine_preimage(var, relsym, expr, denominator);
   clear_reduced_flag();
@@ -96010,8 +96099,8 @@ template <typename D1, typename D2, typename R>
 inline void
 Partially_Reduced_Product<D1, D2, R>
 ::generalized_affine_image(const Linear_Expression& lhs,
-			   const Relation_Symbol relsym,
-			   const Linear_Expression& rhs) {
+                           const Relation_Symbol relsym,
+                           const Linear_Expression& rhs) {
   d1.generalized_affine_image(lhs, relsym, rhs);
   d2.generalized_affine_image(lhs, relsym, rhs);
   clear_reduced_flag();
@@ -96338,7 +96427,7 @@ template <typename D1, typename D2, typename R>
 inline void
 Partially_Reduced_Product<D1, D2, R>
 ::fold_space_dimensions(const Variables_Set& vars,
-			Variable dest) {
+                        Variable dest) {
   d1.fold_space_dimensions(vars, dest);
   d2.fold_space_dimensions(vars, dest);
 }
@@ -96418,7 +96507,7 @@ Partially_Reduced_Product<D1, D2, R>::hash_code() const {
 template <typename D1, typename D2, typename R>
 inline bool
 operator==(const Partially_Reduced_Product<D1, D2, R>& x,
-	   const Partially_Reduced_Product<D1, D2, R>& y) {
+           const Partially_Reduced_Product<D1, D2, R>& y) {
   x.reduce();
   y.reduce();
   return x.d1 == y.d1 && x.d2 == y.d2;
@@ -96428,7 +96517,7 @@ operator==(const Partially_Reduced_Product<D1, D2, R>& x,
 template <typename D1, typename D2, typename R>
 inline bool
 operator!=(const Partially_Reduced_Product<D1, D2, R>& x,
-	   const Partially_Reduced_Product<D1, D2, R>& y) {
+           const Partially_Reduced_Product<D1, D2, R>& y) {
   return !(x == y);
 }
 
@@ -96438,9 +96527,9 @@ inline std::ostream&
 IO_Operators::operator<<(std::ostream& s,
                          const Partially_Reduced_Product<D1, D2, R>& dp) {
   return s << "Domain 1:\n"
-	   << dp.d1
-	   << "Domain 2:\n"
-	   << dp.d2;
+           << dp.d1
+           << "Domain 2:\n"
+           << dp.d2;
 }
 
 } // namespace Parma_Polyhedra_Library
@@ -96511,13 +96600,13 @@ swap(Partially_Reduced_Product<D1, D2, R>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_templates.hh line 1. */
 /* Partially_Reduced_Product class implementation:
    non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.templates.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_templates.hh line 31. */
 #include <algorithm>
 #include <deque>
 
@@ -96541,7 +96630,7 @@ Partially_Reduced_Product<D1, D2, R>::constraints() const {
   Constraint_System cs = d2.constraints();
   const Constraint_System& cs1 = d1.constraints();
   for (Constraint_System::const_iterator i = cs1.begin(),
-	 cs_end = cs1.end(); i != cs_end; ++i)
+         cs_end = cs1.end(); i != cs_end; ++i)
     cs.insert(*i);
   return cs;
 }
@@ -96553,7 +96642,7 @@ Partially_Reduced_Product<D1, D2, R>::minimized_constraints() const {
   Constraint_System cs = d2.constraints();
   const Constraint_System& cs1 = d1.constraints();
   for (Constraint_System::const_iterator i = cs1.begin(),
-	 cs_end = cs1.end(); i != cs_end; ++i)
+         cs_end = cs1.end(); i != cs_end; ++i)
     cs.insert(*i);
   if (cs.has_strict_inequalities()) {
     NNC_Polyhedron ph(cs);
@@ -96572,7 +96661,7 @@ Partially_Reduced_Product<D1, D2, R>::congruences() const {
   Congruence_System cgs = d2.congruences();
   const Congruence_System& cgs1 = d1.congruences();
   for (Congruence_System::const_iterator i = cgs1.begin(),
-	 cgs_end = cgs1.end(); i != cgs_end; ++i)
+         cgs_end = cgs1.end(); i != cgs_end; ++i)
     cgs.insert(*i);
   return cgs;
 }
@@ -96584,7 +96673,7 @@ Partially_Reduced_Product<D1, D2, R>::minimized_congruences() const {
   Congruence_System cgs = d2.congruences();
   const Congruence_System& cgs1 = d1.congruences();
   for (Congruence_System::const_iterator i = cgs1.begin(),
-	 cgs_end = cgs1.end(); i != cgs_end; ++i)
+         cgs_end = cgs1.end(); i != cgs_end; ++i)
     cgs.insert(*i);
   Grid gr(cgs);
   return gr.minimized_congruences();
@@ -96698,9 +96787,9 @@ template <typename D1, typename D2, typename R>
 bool
 Partially_Reduced_Product<D1, D2, R>
 ::maximize(const Linear_Expression& expr,
-	   Coefficient& sup_n,
-	   Coefficient& sup_d,
-	   bool& maximum) const {
+           Coefficient& sup_n,
+           Coefficient& sup_d,
+           bool& maximum) const {
   reduce();
 
   if (is_empty())
@@ -96749,9 +96838,9 @@ template <typename D1, typename D2, typename R>
 bool
 Partially_Reduced_Product<D1, D2, R>
 ::minimize(const Linear_Expression& expr,
-	   Coefficient& inf_n,
-	   Coefficient& inf_d,
-	   bool& minimum) const {
+           Coefficient& inf_n,
+           Coefficient& inf_d,
+           bool& minimum) const {
   reduce();
 
   if (is_empty())
@@ -96801,10 +96890,10 @@ template <typename D1, typename D2, typename R>
 bool
 Partially_Reduced_Product<D1, D2, R>
 ::maximize(const Linear_Expression& expr,
-	   Coefficient& sup_n,
-	   Coefficient& sup_d,
-	   bool& maximum,
-	   Generator& g) const {
+           Coefficient& sup_n,
+           Coefficient& sup_d,
+           bool& maximum,
+           Generator& g) const {
   reduce();
 
   if (is_empty())
@@ -96860,10 +96949,10 @@ template <typename D1, typename D2, typename R>
 bool
 Partially_Reduced_Product<D1, D2, R>
 ::minimize(const Linear_Expression& expr,
-	   Coefficient& inf_n,
-	   Coefficient& inf_d,
-	   bool& minimum,
-	   Generator& g) const {
+           Coefficient& inf_n,
+           Coefficient& inf_d,
+           bool& minimum,
+           Generator& g) const {
   reduce();
 
   if (is_empty())
@@ -97008,7 +97097,7 @@ bool shrink_to_congruence_no_check(D1& d1, D2& d2, const Congruence& cg) {
   // It is assumed that cg is satisfied by all points in d1.
   PPL_ASSERT(d1.relation_with(cg) == Poly_Con_Relation::is_included());
 
-  Linear_Expression e(cg);
+  Linear_Expression e(cg.expression());
 
   // Find the maximum and minimum bounds for the domain element d with the
   // linear expression e.
@@ -97081,7 +97170,7 @@ bool shrink_to_congruence_no_check(D1& d1, D2& d2, const Congruence& cg) {
 
 template <typename D1, typename D2>
 void
-  Congruences_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
+Congruences_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
   if (d1.is_empty() || d2.is_empty()) {
     // If one of the components is empty, do the smash reduction and return.
     Parma_Polyhedra_Library::Smash_Reduction<D1, D2> sr;
@@ -97118,12 +97207,12 @@ void
 
 template <typename D1, typename D2>
 void
-  Shape_Preserving_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
-    // First do the congruences reduction.
-    Parma_Polyhedra_Library::Congruences_Reduction<D1, D2> cgr;
-    cgr.product_reduce(d1, d2);
-    if (d1.is_empty())
-      return;
+Shape_Preserving_Reduction<D1, D2>::product_reduce(D1& d1, D2& d2) {
+  // First do the congruences reduction.
+  Parma_Polyhedra_Library::Congruences_Reduction<D1, D2> cgr;
+  cgr.product_reduce(d1, d2);
+  if (d1.is_empty())
+    return;
 
   PPL_DIRTY_TEMP_COEFFICIENT(freq_n);
   PPL_DIRTY_TEMP_COEFFICIENT(freq_d);
@@ -97140,7 +97229,7 @@ void
       continue;
     // Check the frequency and value of the linear expression for
     // the constraint `c'.
-    Linear_Expression le(c);
+    Linear_Expression le(c.expression());
     if (!d1.frequency(le, freq_n, freq_d, val_n, val_d))
       // Nothing to do.
       continue;
@@ -97170,7 +97259,7 @@ void
       continue;
     // Check the frequency and value of the linear expression for
     // the constraint `c'.
-    Linear_Expression le(c);
+    Linear_Expression le(c.expression());
     if (!d2.frequency(le, freq_n, freq_d, val_n, val_d))
       // Nothing to do.
       continue;
@@ -97197,14 +97286,14 @@ void
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Partially_Reduced_Product.defs.hh line 1688. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Partially_Reduced_Product_defs.hh line 1688. */
 
-/* Automatically generated from PPL source file ../src/Determinate.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_defs.hh line 1. */
 /* Determinate class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Determinate.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -97214,9 +97303,9 @@ class Determinate;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Determinate.defs.hh line 32. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_defs.hh line 32. */
 #include <iosfwd>
-/* Automatically generated from PPL source file ../src/Determinate.defs.hh line 34. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_defs.hh line 34. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -97261,7 +97350,7 @@ operator<<(std::ostream&, const Determinate<PSET>&);
   in \ref Bag98 "[Bag98]".
 
   The implementation uses a copy-on-write optimization, making the
-  class suitable for constructions, like the <EM>finite powerset</EM></A>
+  class suitable for constructions, like the <EM>finite powerset</EM>
   and <EM>ask-and-tell</EM> of \ref Bag98 "[Bag98]", that are likely
   to perform many copies.
 
@@ -97512,19 +97601,19 @@ private:
   operator!=<PSET>(const Determinate<PSET>& x, const Determinate<PSET>& y);
 };
 
-/* Automatically generated from PPL source file ../src/Determinate.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_inlines.hh line 1. */
 /* Determinate class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Determinate.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
 template <typename PSET>
 inline
 Determinate<PSET>::Rep::Rep(dimension_type num_dimensions,
-			  Degenerate_Element kind)
+                          Degenerate_Element kind)
   : references(0), pset(num_dimensions, kind) {
 }
 
@@ -97638,7 +97727,7 @@ template <typename PSET>
 inline void
 Determinate<PSET>::mutate() {
   if (prep->is_shared()) {
-    Rep* new_prep = new Rep(prep->pset);
+    Rep* const new_prep = new Rep(prep->pset);
     (void) prep->del_reference();
     new_prep->new_reference();
     prep = new_prep;
@@ -97795,14 +97884,14 @@ swap(Determinate<PSET>& x, Determinate<PSET>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Determinate.defs.hh line 330. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Determinate_defs.hh line 330. */
 
-/* Automatically generated from PPL source file ../src/Powerset.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_defs.hh line 1. */
 /* Powerset class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Powerset.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -97812,12 +97901,12 @@ class Powerset;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/iterator_to_const.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/iterator_to_const_defs.hh line 1. */
 /* iterator_to_const and const_iterator_to_const class declarations.
 */
 
 
-/* Automatically generated from PPL source file ../src/iterator_to_const.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/iterator_to_const_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -97830,8 +97919,8 @@ class const_iterator_to_const;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/iterator_to_const.defs.hh line 29. */
-//#include "Ask_Tell.types.hh"
+/* Automatically generated from PPL source file ../../ppl/ppl/src/iterator_to_const_defs.hh line 29. */
+//#include "Ask_Tell_types.hh"
 #include <iterator>
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
@@ -98004,7 +98093,7 @@ namespace Parma_Polyhedra_Library {
 template <typename Container>
 bool
 operator==(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y);
+           const const_iterator_to_const<Container>& y);
 
 #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 /*! \brief
@@ -98017,11 +98106,11 @@ operator==(const iterator_to_const<Container>& x,
 template <typename Container>
 bool
 operator!=(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y);
+           const const_iterator_to_const<Container>& y);
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/iterator_to_const.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/iterator_to_const_inlines.hh line 1. */
 /* iterator_to_const and const_iterator_to_const class implementations:
    inline functions.
 */
@@ -98187,7 +98276,7 @@ const_iterator_to_const<Container>
 template <typename Container>
 inline bool
 operator==(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y) {
+           const const_iterator_to_const<Container>& y) {
   return const_iterator_to_const<Container>(x).operator==(y);
 }
 
@@ -98195,15 +98284,15 @@ operator==(const iterator_to_const<Container>& x,
 template <typename Container>
 inline bool
 operator!=(const iterator_to_const<Container>& x,
-	   const const_iterator_to_const<Container>& y) {
+           const const_iterator_to_const<Container>& y) {
   return !(x == y);
 }
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/iterator_to_const.defs.hh line 220. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/iterator_to_const_defs.hh line 220. */
 
-/* Automatically generated from PPL source file ../src/Powerset.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_defs.hh line 30. */
 #include <iosfwd>
 #include <iterator>
 #include <list>
@@ -98583,8 +98672,8 @@ protected:
     it will be reduced upon successful return from the method.
   */
   iterator add_non_bottom_disjunct_preserve_reduction(const D& d,
-						      iterator first,
-						      iterator last);
+                                                      iterator first,
+                                                      iterator last);
 
   /*! \brief
     Adds to \p *this the disjunct \p d, assuming \p d is not the
@@ -98605,7 +98694,7 @@ protected:
   */
   template <typename Binary_Operator_Assign>
   void pairwise_apply_assign(const Powerset& y,
-			     Binary_Operator_Assign op_assign);
+                             Binary_Operator_Assign op_assign);
 
 private:
   /*! \brief
@@ -98621,13 +98710,13 @@ private:
   void collapse(Sequence_iterator sink);
 };
 
-/* Automatically generated from PPL source file ../src/Powerset.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_inlines.hh line 1. */
 /* Powerset class implementation: inline functions.
 */
 
 
 #include <algorithm>
-/* Automatically generated from PPL source file ../src/Powerset.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -98830,14 +98919,14 @@ swap(Powerset<D>& x, Powerset<D>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Powerset.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_templates.hh line 1. */
 /* Powerset class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Powerset.templates.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_templates.hh line 28. */
 #include <algorithm>
-/* Automatically generated from PPL source file ../src/Powerset.templates.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_templates.hh line 30. */
 #include <iostream>
 
 namespace Parma_Polyhedra_Library {
@@ -98885,17 +98974,17 @@ Powerset<D>::omega_reduce() const {
     bool dropping_xi = false;
     for (iterator yi = x.begin(); yi != x.end(); )
       if (xi == yi)
-	++yi;
+        ++yi;
       else {
-	const D& yv = *yi;
-	if (yv.definitely_entails(xv))
-	  yi = x.drop_disjunct(yi);
-	else if (xv.definitely_entails(yv)) {
-	  dropping_xi = true;
-	  break;
-	}
-	else
-	  ++yi;
+        const D& yv = *yi;
+        if (yv.definitely_entails(xv))
+          yi = x.drop_disjunct(yi);
+        else if (xv.definitely_entails(yv)) {
+          dropping_xi = true;
+          break;
+        }
+        else
+          ++yi;
       }
     if (dropping_xi)
       xi = x.drop_disjunct(xi);
@@ -98934,16 +99023,16 @@ template <typename D>
 bool
 Powerset<D>::check_omega_reduced() const {
   for (const_iterator x_begin = begin(), x_end = end(),
-	 xi = x_begin; xi != x_end; ++xi) {
+         xi = x_begin; xi != x_end; ++xi) {
     const D& xv = *xi;
     if (xv.is_bottom())
       return false;
     for (const_iterator yi = x_begin; yi != x_end; ++yi) {
       if (xi == yi)
-	continue;
+        continue;
       const D& yv = *yi;
       if (xv.definitely_entails(yv) || yv.definitely_entails(xv))
-	return false;
+        return false;
     }
   }
   return true;
@@ -98960,8 +99049,8 @@ Powerset<D>::is_omega_reduced() const {
 template <typename D>
 typename Powerset<D>::iterator
 Powerset<D>::add_non_bottom_disjunct_preserve_reduction(const D& d,
-							iterator first,
-							iterator last) {
+                                                        iterator first,
+                                                        iterator last) {
   PPL_ASSERT_HEAVY(!d.is_bottom());
   for (iterator xi = first; xi != last; ) {
     const D& xv = *xi;
@@ -98969,7 +99058,7 @@ Powerset<D>::add_non_bottom_disjunct_preserve_reduction(const D& d,
       return first;
     else if (xv.definitely_entails(d)) {
       if (xi == first)
-	++first;
+        ++first;
       xi = drop_disjunct(xi);
     }
     else
@@ -98986,10 +99075,10 @@ Powerset<D>::definitely_entails(const Powerset& y) const {
   const Powerset<D>& x = *this;
   bool found = true;
   for (const_iterator xi = x.begin(),
-	 x_end = x.end(); found && xi != x_end; ++xi) {
+         x_end = x.end(); found && xi != x_end; ++xi) {
     found = false;
     for (const_iterator yi = y.begin(),
-	   y_end = y.end(); !found && yi != y_end; ++yi)
+           y_end = y.end(); !found && yi != y_end; ++yi)
       found = (*xi).definitely_entails(*yi);
   }
   return found;
@@ -99006,7 +99095,7 @@ operator==(const Powerset<D>& x, const Powerset<D>& y) {
   // Take a copy of `y' and work with it.
   Powerset<D> z = y;
   for (typename Powerset<D>::const_iterator xi = x.begin(),
-	 x_end = x.end(); xi != x_end; ++xi) {
+         x_end = x.end(); xi != x_end; ++xi) {
     typename Powerset<D>::iterator zi = z.begin();
     typename Powerset<D>::iterator z_end = z.end();
     zi = std::find(zi, z_end, *xi);
@@ -99022,18 +99111,18 @@ template <typename D>
 template <typename Binary_Operator_Assign>
 void
 Powerset<D>::pairwise_apply_assign(const Powerset& y,
-				   Binary_Operator_Assign op_assign) {
+                                   Binary_Operator_Assign op_assign) {
   // Ensure omega-reduction here, since what follows has quadratic complexity.
   omega_reduce();
   y.omega_reduce();
   Sequence new_sequence;
   for (const_iterator xi = begin(), x_end = end(),
-	 y_begin = y.begin(), y_end = y.end(); xi != x_end; ++xi)
+         y_begin = y.begin(), y_end = y.end(); xi != x_end; ++xi)
     for (const_iterator yi = y_begin; yi != y_end; ++yi) {
       D zi = *xi;
       op_assign(zi, *yi);
       if (!zi.is_bottom())
-	new_sequence.push_back(zi);
+        new_sequence.push_back(zi);
     }
   // Put the new sequence in place.
   using std::swap;
@@ -99052,8 +99141,8 @@ Powerset<D>::least_upper_bound_assign(const Powerset& y) {
   iterator old_end = end();
   for (const_iterator i = y.begin(), y_end = y.end(); i != y_end; ++i)
     old_begin = add_non_bottom_disjunct_preserve_reduction(*i,
-							   old_begin,
-							   old_end);
+                                                           old_begin,
+                                                           old_end);
   PPL_ASSERT_HEAVY(OK());
 }
 
@@ -99069,11 +99158,11 @@ operator<<(std::ostream& s, const Powerset<D>& x) {
     s << "true";
   else
     for (typename Powerset<D>::const_iterator i = x.begin(),
-	   x_end = x.end(); i != x_end; ) {
+           x_end = x.end(); i != x_end; ) {
       s << "{ " << *i << " }";
       ++i;
       if (i != x_end)
-	s << ", ";
+        s << ", ";
     }
   return s;
 }
@@ -99103,7 +99192,7 @@ Powerset<D>::OK(const bool disallow_bottom) const {
     if (disallow_bottom && xi->is_bottom()) {
 #ifndef NDEBUG
       std::cerr << "Bottom element in powerset!"
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
@@ -99111,7 +99200,7 @@ Powerset<D>::OK(const bool disallow_bottom) const {
   if (reduced && !check_omega_reduced()) {
 #ifndef NDEBUG
     std::cerr << "Powerset claims to be reduced, but it is not!"
-	      << std::endl;
+              << std::endl;
 #endif
     return false;
   }
@@ -99120,25 +99209,24 @@ Powerset<D>::OK(const bool disallow_bottom) const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Powerset.defs.hh line 449. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Powerset_defs.hh line 449. */
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.defs.hh line 44. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_defs.hh line 44. */
 #include <iosfwd>
 #include <list>
 #include <map>
 
 //! The powerset construction instantiated on PPL pointset domains.
-/*! \ingroup PPL_CXX_interface */
-/*!
+/*! \ingroup PPL_CXX_interface
   \warning
   At present, the supported instantiations for the
   disjunct domain template \p PSET are the simple pointset domains:
   <CODE>C_Polyhedron</CODE>,
   <CODE>NNC_Polyhedron</CODE>,
   <CODE>Grid</CODE>,
-  <CODE>Octagonal_Shape<T></CODE>,
-  <CODE>BD_Shape<T></CODE>,
-  <CODE>Box<T></CODE>.
+  <CODE>Octagonal_Shape\<T\></CODE>,
+  <CODE>BD_Shape\<T\></CODE>,
+  <CODE>Box\<T\></CODE>.
 */
 template <typename PSET>
 class Parma_Polyhedra_Library::Pointset_Powerset
@@ -99168,7 +99256,7 @@ public:
   */
   explicit
   Pointset_Powerset(dimension_type num_dimensions = 0,
-		    Degenerate_Element kind = UNIVERSE);
+                    Degenerate_Element kind = UNIVERSE);
 
   //! Ordinary copy constructor.
   /*!
@@ -99448,7 +99536,7 @@ public:
     and \p maximum are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -99479,8 +99567,8 @@ public:
     and \p g are left untouched.
   */
   bool maximize(const Linear_Expression& expr,
-		Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
-		Generator& g) const;
+                Coefficient& sup_n, Coefficient& sup_d, bool& maximum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this is not empty
@@ -99507,7 +99595,7 @@ public:
     and \p minimum are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
 
 
   /*! \brief
@@ -99539,8 +99627,8 @@ public:
     and \p g are left untouched.
   */
   bool minimize(const Linear_Expression& expr,
-		Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
-		Generator& g) const;
+                Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
+                Generator& g) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if \p *this geometrically
@@ -99850,9 +99938,9 @@ public:
     \p *this.
   */
   void affine_image(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the
@@ -99876,9 +99964,9 @@ public:
     \p *this.
   */
   void affine_preimage(Variable var,
-		    const Linear_Expression& expr,
-		    Coefficient_traits::const_reference denominator
-		      = Coefficient_one());
+                    const Linear_Expression& expr,
+                    Coefficient_traits::const_reference denominator
+                      = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -99907,10 +99995,10 @@ public:
     relation symbol.
   */
   void generalized_affine_image(Variable var,
-				Relation_Symbol relsym,
-				const Linear_Expression& expr,
-				Coefficient_traits::const_reference denominator
-				  = Coefficient_one());
+                                Relation_Symbol relsym,
+                                const Linear_Expression& expr,
+                                Coefficient_traits::const_reference denominator
+                                  = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -99940,10 +100028,10 @@ public:
   */
   void
   generalized_affine_preimage(Variable var,
-			      Relation_Symbol relsym,
-			      const Linear_Expression& expr,
-			      Coefficient_traits::const_reference denominator
-			      = Coefficient_one());
+                              Relation_Symbol relsym,
+                              const Linear_Expression& expr,
+                              Coefficient_traits::const_reference denominator
+                              = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the image of \p *this with respect to the
@@ -99966,8 +100054,8 @@ public:
     relation symbol.
   */
   void generalized_affine_image(const Linear_Expression& lhs,
-				Relation_Symbol relsym,
-				const Linear_Expression& rhs);
+                                Relation_Symbol relsym,
+                                const Linear_Expression& rhs);
 
   /*! \brief
     Assigns to \p *this the preimage of \p *this with respect to the
@@ -99990,8 +100078,8 @@ public:
     relation symbol.
   */
   void generalized_affine_preimage(const Linear_Expression& lhs,
-				   Relation_Symbol relsym,
-				   const Linear_Expression& rhs);
+                                   Relation_Symbol relsym,
+                                   const Linear_Expression& rhs);
 
   /*!
     \brief
@@ -100020,10 +100108,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_image(Variable var,
-			    const Linear_Expression& lb_expr,
-			    const Linear_Expression& ub_expr,
-			    Coefficient_traits::const_reference denominator
-			    = Coefficient_one());
+                            const Linear_Expression& lb_expr,
+                            const Linear_Expression& ub_expr,
+                            Coefficient_traits::const_reference denominator
+                            = Coefficient_one());
 
   /*!
     \brief
@@ -100052,10 +100140,10 @@ public:
     dimension of \p *this.
   */
   void bounded_affine_preimage(Variable var,
-			       const Linear_Expression& lb_expr,
-			       const Linear_Expression& ub_expr,
-			       Coefficient_traits::const_reference denominator
-			       = Coefficient_one());
+                               const Linear_Expression& lb_expr,
+                               const Linear_Expression& ub_expr,
+                               Coefficient_traits::const_reference denominator
+                               = Coefficient_one());
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -100160,8 +100248,8 @@ public:
   */
   template <typename Widening>
   void BGP99_extrapolation_assign(const Pointset_Powerset& y,
-				  Widening widen_fun,
-				  unsigned max_disjuncts);
+                                  Widening widen_fun,
+                                  unsigned max_disjuncts);
 
   /*! \brief
     Assigns to \p *this the result of computing the
@@ -100366,7 +100454,7 @@ private:
   //! Records in \p cert_ms the certificates for this set of disjuncts.
   template <typename Cert>
   void collect_certificates(std::map<Cert, size_type,
-			             typename Cert::Compare>& cert_ms) const;
+                                     typename Cert::Compare>& cert_ms) const;
 
   /*! \brief
     Returns <CODE>true</CODE> if and only if the current set of disjuncts
@@ -100375,7 +100463,7 @@ private:
   template <typename Cert>
   bool is_cert_multiset_stabilizing(const std::map<Cert, size_type,
                                                    typename Cert::Compare>&
-				    y_cert_ms) const;
+                                    y_cert_ms) const;
 
   // FIXME: here it should be enough to befriend the template constructor
   // template <typename QH>
@@ -100423,7 +100511,7 @@ linear_partition(const PSET& p, const PSET& q);
 */
 bool
 check_containment(const NNC_Polyhedron& ph,
-		  const Pointset_Powerset<NNC_Polyhedron>& ps);
+                  const Pointset_Powerset<NNC_Polyhedron>& ps);
 
 
 /*! \brief
@@ -100458,7 +100546,7 @@ approximate_partition(const Grid& p, const Grid& q, bool& finite_partition);
 */
 bool
 check_containment(const Grid& ph,
-		  const Pointset_Powerset<Grid>& ps);
+                  const Pointset_Powerset<Grid>& ps);
 
 /*! \brief
   Returns <CODE>true</CODE> if and only if the union of
@@ -100526,12 +100614,12 @@ Pointset_Powerset<Grid>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_inlines.hh line 1. */
 /* Pointset_Powerset class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.inlines.hh line 35. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_inlines.hh line 35. */
 #include <algorithm>
 #include <deque>
 
@@ -100552,7 +100640,7 @@ Pointset_Powerset<PSET>::max_space_dimension() {
 template <typename PSET>
 inline
 Pointset_Powerset<PSET>::Pointset_Powerset(dimension_type num_dimensions,
-					   Degenerate_Element kind)
+                                           Degenerate_Element kind)
   : Base(), space_dim(num_dimensions) {
   Pointset_Powerset& x = *this;
   if (kind == UNIVERSE)
@@ -100563,14 +100651,14 @@ Pointset_Powerset<PSET>::Pointset_Powerset(dimension_type num_dimensions,
 template <typename PSET>
 inline
 Pointset_Powerset<PSET>::Pointset_Powerset(const Pointset_Powerset& y,
-					   Complexity_Class)
+                                           Complexity_Class)
   : Base(y), space_dim(y.space_dim) {
 }
 
 template <typename PSET>
 inline
 Pointset_Powerset<PSET>::Pointset_Powerset(const C_Polyhedron& ph,
-					   Complexity_Class complexity)
+                                           Complexity_Class complexity)
   : Base(), space_dim(ph.space_dimension()) {
   Pointset_Powerset& x = *this;
   if (complexity == ANY_COMPLEXITY) {
@@ -100587,7 +100675,7 @@ Pointset_Powerset<PSET>::Pointset_Powerset(const C_Polyhedron& ph,
 template <typename PSET>
 inline
 Pointset_Powerset<PSET>::Pointset_Powerset(const NNC_Polyhedron& ph,
-					   Complexity_Class complexity)
+                                           Complexity_Class complexity)
   : Base(), space_dim(ph.space_dimension()) {
   Pointset_Powerset& x = *this;
   if (complexity == ANY_COMPLEXITY) {
@@ -100603,7 +100691,7 @@ Pointset_Powerset<PSET>::Pointset_Powerset(const NNC_Polyhedron& ph,
 template <typename PSET>
 inline
 Pointset_Powerset<PSET>::Pointset_Powerset(const Grid& gr,
-					   Complexity_Class)
+                                           Complexity_Class)
   : Base(), space_dim(gr.space_dimension()) {
   Pointset_Powerset& x = *this;
   if (!gr.is_empty()) {
@@ -100634,7 +100722,7 @@ Pointset_Powerset<PSET>
 template <typename PSET>
 template <typename Interval>
 Pointset_Powerset<PSET>::Pointset_Powerset(const Box<Interval>& box,
-					   Complexity_Class)
+                                           Complexity_Class)
   : Base(), space_dim(box.space_dimension()) {
   Pointset_Powerset& x = *this;
   if (!box.is_empty())
@@ -100645,7 +100733,7 @@ Pointset_Powerset<PSET>::Pointset_Powerset(const Box<Interval>& box,
 template <typename PSET>
 template <typename T>
 Pointset_Powerset<PSET>::Pointset_Powerset(const Octagonal_Shape<T>& os,
-					   Complexity_Class)
+                                           Complexity_Class)
   : Base(), space_dim(os.space_dimension()) {
   Pointset_Powerset& x = *this;
   if (!os.is_empty())
@@ -100656,7 +100744,7 @@ Pointset_Powerset<PSET>::Pointset_Powerset(const Octagonal_Shape<T>& os,
 template <typename PSET>
 template <typename T>
 Pointset_Powerset<PSET>::Pointset_Powerset(const BD_Shape<T>& bds,
-					   Complexity_Class)
+                                           Complexity_Class)
   : Base(), space_dim(bds.space_dimension()) {
   Pointset_Powerset& x = *this;
   if (!bds.is_empty())
@@ -100803,9 +100891,9 @@ check_containment(const PSET& ph, const Pointset_Powerset<PSET>& ps) {
 template <>
 inline bool
 check_containment(const C_Polyhedron& ph,
-		  const Pointset_Powerset<C_Polyhedron>& ps) {
+                  const Pointset_Powerset<C_Polyhedron>& ps) {
   return check_containment(NNC_Polyhedron(ph),
-			   Pointset_Powerset<NNC_Polyhedron>(ps));
+                           Pointset_Powerset<NNC_Polyhedron>(ps));
 }
 
 /*! \relates Pointset_Powerset */
@@ -100817,12 +100905,12 @@ swap(Pointset_Powerset<PSET>& x, Pointset_Powerset<PSET>& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_templates.hh line 1. */
 /* Pointset_Powerset class implementation: non-inline template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.templates.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_templates.hh line 33. */
 #include <algorithm>
 #include <deque>
 #include <string>
@@ -100856,9 +100944,9 @@ Pointset_Powerset<NNC_Polyhedron>
   : Base(), space_dim(y.space_dimension()) {
   Pointset_Powerset& x = *this;
   for (typename Pointset_Powerset<QH>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
+         y_end = y.end(); i != y_end; ++i)
     x.sequence.push_back(Determinate<NNC_Polyhedron>
-			 (NNC_Polyhedron(i->pointset(), complexity)));
+                         (NNC_Polyhedron(i->pointset(), complexity)));
 
   // FIXME: If the domain elements can be represented _exactly_ as NNC
   // polyhedra, then having x.reduced = y.reduced is correct. This is
@@ -100882,7 +100970,7 @@ Pointset_Powerset<PSET>
   : Base(), space_dim(y.space_dimension()) {
   Pointset_Powerset& x = *this;
   for (typename Pointset_Powerset<QH>::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
+         y_end = y.end(); i != y_end; ++i)
     x.sequence.push_back(Determinate<PSET>(PSET(i->pointset(), complexity)));
   // Note: this might be non-reduced even when `y' is known to be
   // omega-reduced, because the constructor of PSET may have made
@@ -100900,7 +100988,7 @@ Pointset_Powerset<PSET>::concatenate_assign(const Pointset_Powerset& y) {
   y.omega_reduce();
   Pointset_Powerset<PSET> new_x(x.space_dim + y.space_dim, EMPTY);
   for (const_iterator xi = x.begin(), x_end = x.end(),
-	 y_begin = y.begin(), y_end = y.end(); xi != x_end; ) {
+         y_begin = y.begin(), y_end = y.end(); xi != x_end; ) {
     for (const_iterator yi = y_begin; yi != y_end; ++yi) {
       Det_PSET zi = *xi;
       zi.concatenate_assign(*yi);
@@ -100913,11 +101001,11 @@ Pointset_Powerset<PSET>::concatenate_assign(const Pointset_Powerset& y) {
       // Hurry up!
       PSET x_ph = xi->pointset();
       for (++xi; xi != x_end; ++xi)
-	x_ph.upper_bound_assign(xi->pointset());
+        x_ph.upper_bound_assign(xi->pointset());
       const_iterator yi = y_begin;
       PSET y_ph = yi->pointset();
       for (++yi; yi != y_end; ++yi)
-	y_ph.upper_bound_assign(yi->pointset());
+        y_ph.upper_bound_assign(yi->pointset());
       x_ph.concatenate_assign(y_ph);
       swap(x, new_x);
       x.add_disjunct(x_ph);
@@ -100934,7 +101022,7 @@ void
 Pointset_Powerset<PSET>::add_constraint(const Constraint& c) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().add_constraint(c);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -100945,7 +101033,7 @@ void
 Pointset_Powerset<PSET>::refine_with_constraint(const Constraint& c) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().refine_with_constraint(c);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -100956,7 +101044,7 @@ void
 Pointset_Powerset<PSET>::add_constraints(const Constraint_System& cs) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().add_constraints(cs);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -100967,7 +101055,7 @@ void
 Pointset_Powerset<PSET>::refine_with_constraints(const Constraint_System& cs) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().refine_with_constraints(cs);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -100978,7 +101066,7 @@ void
 Pointset_Powerset<PSET>::add_congruence(const Congruence& cg) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().add_congruence(cg);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -100989,7 +101077,7 @@ void
 Pointset_Powerset<PSET>::refine_with_congruence(const Congruence& cg) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().refine_with_congruence(cg);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -101000,7 +101088,7 @@ void
 Pointset_Powerset<PSET>::add_congruences(const Congruence_System& cgs) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().add_congruences(cgs);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -101011,7 +101099,7 @@ void
 Pointset_Powerset<PSET>::refine_with_congruences(const Congruence_System& cgs) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().refine_with_congruences(cgs);
   x.reduced = false;
   PPL_ASSERT_HEAVY(x.OK());
@@ -101046,7 +101134,7 @@ void
 Pointset_Powerset<PSET>::add_space_dimensions_and_embed(dimension_type m) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().add_space_dimensions_and_embed(m);
   x.space_dim += m;
   PPL_ASSERT_HEAVY(x.OK());
@@ -101057,7 +101145,7 @@ void
 Pointset_Powerset<PSET>::add_space_dimensions_and_project(dimension_type m) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().add_space_dimensions_and_project(m);
   x.space_dim += m;
   PPL_ASSERT_HEAVY(x.OK());
@@ -101070,7 +101158,7 @@ Pointset_Powerset<PSET>::remove_space_dimensions(const Variables_Set& vars) {
   Variables_Set::size_type num_removed = vars.size();
   if (num_removed > 0) {
     for (Sequence_iterator si = x.sequence.begin(),
-	   s_end = x.sequence.end(); si != s_end; ++si) {
+           s_end = x.sequence.end(); si != s_end; ++si) {
       si->pointset().remove_space_dimensions(vars);
       x.reduced = false;
     }
@@ -101086,7 +101174,7 @@ Pointset_Powerset<PSET>
   Pointset_Powerset& x = *this;
   if (new_dimension < x.space_dim) {
     for (Sequence_iterator si = x.sequence.begin(),
-	   s_end = x.sequence.end(); si != s_end; ++si) {
+           s_end = x.sequence.end(); si != s_end; ++si) {
       si->pointset().remove_higher_space_dimensions(new_dimension);
       x.reduced = false;
     }
@@ -101105,14 +101193,14 @@ Pointset_Powerset<PSET>::map_space_dimensions(const Partial_Function& pfunc) {
     for (dimension_type i = x.space_dim; i-- > 0; ) {
       dimension_type new_i;
       if (pfunc.maps(i, new_i))
-	++n;
+        ++n;
     }
     x.space_dim = n;
   }
   else {
     Sequence_iterator s_begin = x.sequence.begin();
     for (Sequence_iterator si = s_begin,
-	   s_end = x.sequence.end(); si != s_end; ++si)
+           s_end = x.sequence.end(); si != s_end; ++si)
       si->pointset().map_space_dimensions(pfunc);
     x.space_dim = s_begin->pointset().space_dimension();
     x.reduced = false;
@@ -101422,7 +101510,7 @@ template <typename PSET>
 void
 Pointset_Powerset<PSET>
 ::drop_some_non_integer_points(const Variables_Set& vars,
-			       Complexity_Class complexity) {
+                               Complexity_Class complexity) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
          s_end = x.sequence.end(); si != s_end; ++si)
@@ -101962,7 +102050,7 @@ Pointset_Powerset<PSET>::wrap_assign(const Variables_Set& vars,
                                      bool wrap_individually) {
   Pointset_Powerset& x = *this;
   for (Sequence_iterator si = x.sequence.begin(),
-	 s_end = x.sequence.end(); si != s_end; ++si)
+         s_end = x.sequence.end(); si != s_end; ++si)
     si->pointset().wrap_assign(vars, w, r, o, cs_p,
                                complexity_threshold, wrap_individually);
   x.reduced = false;
@@ -101987,21 +102075,21 @@ Pointset_Powerset<PSET>::pairwise_reduce() {
     unsigned si_index = 0;
     for (Sequence_iterator si = s_begin; si != s_end; ++si, ++si_index) {
       if (marked[si_index])
-	continue;
+        continue;
       PSET& pi = si->pointset();
       Sequence_const_iterator sj = si;
       unsigned sj_index = si_index;
       for (++sj, ++sj_index; sj != s_end; ++sj, ++sj_index) {
-	if (marked[sj_index])
-	  continue;
-	const PSET& pj = sj->pointset();
-	if (pi.upper_bound_assign_if_exact(pj)) {
-	  marked[si_index] = true;
+        if (marked[sj_index])
+          continue;
+        const PSET& pj = sj->pointset();
+        if (pi.upper_bound_assign_if_exact(pj)) {
+          marked[si_index] = true;
           marked[sj_index] = true;
-	  new_x.add_non_bottom_disjunct_preserve_reduction(pi);
-	  ++deleted;
-	  goto next;
-	}
+          new_x.add_non_bottom_disjunct_preserve_reduction(pi);
+          ++deleted;
+          goto next;
+        }
       }
     next:
       ;
@@ -102010,9 +102098,9 @@ Pointset_Powerset<PSET>::pairwise_reduce() {
     iterator new_x_end = new_x.end();
     unsigned xi_index = 0;
     for (const_iterator xi = x.begin(),
-	   x_end = x.end(); xi != x_end; ++xi, ++xi_index)
+           x_end = x.end(); xi != x_end; ++xi, ++xi_index)
       if (!marked[xi_index])
-	new_x_begin
+        new_x_begin
           = new_x.add_non_bottom_disjunct_preserve_reduction(*xi,
                                                              new_x_begin,
                                                              new_x_end);
@@ -102047,15 +102135,15 @@ BGP99_heuristics_assign(const Pointset_Powerset& y, Widening widen_fun) {
   const_iterator x_end = x.end();
   unsigned i_index = 0;
   for (const_iterator i = x_begin,
-	 y_begin = y.begin(), y_end = y.end(); i != x_end; ++i, ++i_index)
+         y_begin = y.begin(), y_end = y.end(); i != x_end; ++i, ++i_index)
     for (const_iterator j = y_begin; j != y_end; ++j) {
       const PSET& pi = i->pointset();
       const PSET& pj = j->pointset();
       if (pi.contains(pj)) {
-	PSET pi_copy = pi;
-	widen_fun(pi_copy, pj);
-	new_x.add_non_bottom_disjunct_preserve_reduction(pi_copy);
-	marked[i_index] = true;
+        PSET pi_copy = pi;
+        widen_fun(pi_copy, pj);
+        new_x.add_non_bottom_disjunct_preserve_reduction(pi_copy);
+        marked[i_index] = true;
       }
     }
   iterator new_x_begin = new_x.begin();
@@ -102078,8 +102166,8 @@ template <typename Widening>
 void
 Pointset_Powerset<PSET>::
 BGP99_extrapolation_assign(const Pointset_Powerset& y,
-			   Widening widen_fun,
-			   unsigned max_disjuncts) {
+                           Widening widen_fun,
+                           unsigned max_disjuncts) {
   // `x' is the current iteration value.
   Pointset_Powerset& x = *this;
 
@@ -102122,11 +102210,10 @@ is_cert_multiset_stabilizing(const std::map<Cert, size_type,
   typedef std::map<Cert, size_type, typename Cert::Compare> Cert_Multiset;
   Cert_Multiset x_cert_ms;
   collect_certificates(x_cert_ms);
-  typename Cert_Multiset::const_iterator
-    xi = x_cert_ms.begin(),
-    x_cert_ms_end = x_cert_ms.end(),
-    yi = y_cert_ms.begin(),
-    y_cert_ms_end = y_cert_ms.end();
+  typename Cert_Multiset::const_iterator xi = x_cert_ms.begin();
+  typename Cert_Multiset::const_iterator x_cert_ms_end = x_cert_ms.end();
+  typename Cert_Multiset::const_iterator yi = y_cert_ms.begin();
+  typename Cert_Multiset::const_iterator y_cert_ms_end = y_cert_ms.end();
   while (xi != x_cert_ms_end && yi != y_cert_ms_end) {
     const Cert& xi_cert = xi->first;
     const Cert& yi_cert = yi->first;
@@ -102134,17 +102221,17 @@ is_cert_multiset_stabilizing(const std::map<Cert, size_type,
     case 0:
       // xi_cert == yi_cert: check the number of multiset occurrences.
       {
-	const size_type& xi_count = xi->second;
-	const size_type& yi_count = yi->second;
-	if (xi_count == yi_count) {
-	  // Same number of occurrences: compare the next pair.
-	  ++xi;
-	  ++yi;
-	}
-	else
-	  // Different number of occurrences: can decide ordering.
-	  return xi_count < yi_count;
-	break;
+        const size_type& xi_count = xi->second;
+        const size_type& yi_count = yi->second;
+        if (xi_count == yi_count) {
+          // Same number of occurrences: compare the next pair.
+          ++xi;
+          ++yi;
+        }
+        else
+          // Different number of occurrences: can decide ordering.
+          return xi_count < yi_count;
+        break;
       }
     case 1:
       // xi_cert > yi_cert: it is not stabilizing.
@@ -102226,7 +102313,7 @@ Pointset_Powerset<PSET>::BHZ03_widening_assign(const Pointset_Powerset& y,
   // Compute the poly-hull of `bgp99_heuristics'.
   PSET bgp99_heuristics_hull(x.space_dim, EMPTY);
   for (const_iterator i = bgp99_heuristics.begin(),
-	 b_h_end = bgp99_heuristics.end(); i != b_h_end; ++i)
+         b_h_end = bgp99_heuristics.end(); i != b_h_end; ++i)
     bgp99_heuristics_hull.upper_bound_assign(i->pointset());
 
   // Check for stabilization and, if successful,
@@ -102333,9 +102420,9 @@ Pointset_Powerset<PSET>::OK() const {
     if (pi.space_dimension() != x.space_dim) {
 #ifndef NDEBUG
       std::cerr << "Space dimension mismatch: is " << pi.space_dimension()
-		<< " in an element of the sequence,\nshould be "
-		<< x.space_dim << "."
-		<< std::endl;
+                << " in an element of the sequence,\nshould be "
+                << x.space_dim << "."
+                << std::endl;
 #endif
       return false;
     }
@@ -102358,9 +102445,9 @@ namespace Pointset_Powersets {
 template <typename PSET>
 void
 linear_partition_aux(const Constraint& c,
-		     PSET& pset,
-		     Pointset_Powerset<NNC_Polyhedron>& r) {
-  Linear_Expression le(c);
+                     PSET& pset,
+                     Pointset_Powerset<NNC_Polyhedron>& r) {
+  const Linear_Expression le(c.expression());
   const Constraint& neg_c = c.is_strict_inequality() ? (le <= 0) : (le < 0);
   NNC_Polyhedron nnc_ph_pset(pset);
   nnc_ph_pset.add_constraint(neg_c);
@@ -102384,12 +102471,12 @@ linear_partition(const PSET& p, const PSET& q) {
   PSET pset = q;
   const Constraint_System& p_constraints = p.constraints();
   for (Constraint_System::const_iterator i = p_constraints.begin(),
-	 p_constraints_end = p_constraints.end();
+         p_constraints_end = p_constraints.end();
        i != p_constraints_end;
        ++i) {
     const Constraint& c = *i;
     if (c.is_equality()) {
-      Linear_Expression le(c);
+      const Linear_Expression le(c.expression());
       linear_partition_aux(le <= 0, pset, r);
       linear_partition_aux(le >= 0, pset, r);
     }
@@ -102401,11 +102488,11 @@ linear_partition(const PSET& p, const PSET& q) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pointset_Powerset.defs.hh line 1449. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pointset_Powerset_defs.hh line 1448. */
 
-/* Automatically generated from PPL source file ../src/algorithms.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/algorithms.hh line 29. */
 #include <utility>
-/* Automatically generated from PPL source file ../src/algorithms.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/algorithms.hh line 31. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -102447,14 +102534,14 @@ poly_hull_assign_if_exact(PH& p, const PH& q) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/termination.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_defs.hh line 1. */
 /* Utilities for termination analysis: declarations.
 */
 
 
-/* Automatically generated from PPL source file ../src/termination.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_defs.hh line 28. */
 
-/* Automatically generated from PPL source file ../src/termination.defs.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_defs.hh line 33. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -102485,7 +102572,7 @@ public:
 //! \name Functions for the Synthesis of Linear Rankings
 //@{
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Termination test using an improvement of the method by Mesnard and
   Serebrenik \ref BMPZ10 "[BMPZ10]".
 
@@ -102518,7 +102605,7 @@ template <typename PSET>
 bool
 termination_test_MS(const PSET& pset);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Termination test using an improvement of the method by Mesnard and
   Serebrenik \ref BMPZ10 "[BMPZ10]".
 
@@ -102560,7 +102647,7 @@ template <typename PSET>
 bool
 termination_test_MS_2(const PSET& pset_before, const PSET& pset_after);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Termination test with witness ranking function using an improvement
   of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
 
@@ -102602,7 +102689,7 @@ template <typename PSET>
 bool
 one_affine_ranking_function_MS(const PSET& pset, Generator& mu);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Termination test with witness ranking function using an improvement
   of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
 
@@ -102652,10 +102739,10 @@ one_affine_ranking_function_MS(const PSET& pset, Generator& mu);
 template <typename PSET>
 bool
 one_affine_ranking_function_MS_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu);
+                                 const PSET& pset_after,
+                                 Generator& mu);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Termination test with ranking function space using an improvement
   of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
 
@@ -102697,7 +102784,7 @@ template <typename PSET>
 void
 all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Termination test with ranking function space using an improvement
   of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
 
@@ -102747,10 +102834,10 @@ all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space);
 template <typename PSET>
 void
 all_affine_ranking_functions_MS_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  C_Polyhedron& mu_space);
+                                  const PSET& pset_after,
+                                  C_Polyhedron& mu_space);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Computes the spaces of affine \e quasi ranking functions
   using an improvement of the method by Mesnard and Serebrenik
   \ref BMPZ10 "[BMPZ10]".
@@ -102802,7 +102889,7 @@ all_affine_quasi_ranking_functions_MS(const PSET& pset,
                                       C_Polyhedron& decreasing_mu_space,
                                       C_Polyhedron& bounded_mu_space);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Computes the spaces of affine \e quasi ranking functions
   using an improvement of the method by Mesnard and Serebrenik
   \ref BMPZ10 "[BMPZ10]".
@@ -102864,7 +102951,7 @@ all_affine_quasi_ranking_functions_MS_2(const PSET& pset_before,
                                         C_Polyhedron& decreasing_mu_space,
                                         C_Polyhedron& bounded_mu_space);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Like termination_test_MS() but using the method by Podelski and
   Rybalchenko \ref BMPZ10 "[BMPZ10]".
 */
@@ -102872,7 +102959,7 @@ template <typename PSET>
 bool
 termination_test_PR(const PSET& pset);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Like termination_test_MS_2() but using an alternative formalization
   of the method by Podelski and Rybalchenko \ref BMPZ10 "[BMPZ10]".
 */
@@ -102880,7 +102967,7 @@ template <typename PSET>
 bool
 termination_test_PR_2(const PSET& pset_before, const PSET& pset_after);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Like one_affine_ranking_function_MS() but using the method by Podelski
   and Rybalchenko \ref BMPZ10 "[BMPZ10]".
 */
@@ -102888,7 +102975,7 @@ template <typename PSET>
 bool
 one_affine_ranking_function_PR(const PSET& pset, Generator& mu);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Like one_affine_ranking_function_MS_2() but using an alternative
   formalization of the method by Podelski and Rybalchenko
   \ref BMPZ10 "[BMPZ10]".
@@ -102896,10 +102983,10 @@ one_affine_ranking_function_PR(const PSET& pset, Generator& mu);
 template <typename PSET>
 bool
 one_affine_ranking_function_PR_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu);
+                                 const PSET& pset_after,
+                                 Generator& mu);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Like all_affine_ranking_functions_MS() but using the method by Podelski
   and Rybalchenko \ref BMPZ10 "[BMPZ10]".
 */
@@ -102907,7 +102994,7 @@ template <typename PSET>
 void
 all_affine_ranking_functions_PR(const PSET& pset, NNC_Polyhedron& mu_space);
 
-/*! \brief \ingroup PPL_CXX_interface
+/*! \ingroup PPL_CXX_interface \brief
   Like all_affine_ranking_functions_MS_2() but using an alternative
   formalization of the method by Podelski and Rybalchenko
   \ref BMPZ10 "[BMPZ10]".
@@ -102915,19 +103002,19 @@ all_affine_ranking_functions_PR(const PSET& pset, NNC_Polyhedron& mu_space);
 template <typename PSET>
 void
 all_affine_ranking_functions_PR_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  NNC_Polyhedron& mu_space);
+                                  const PSET& pset_after,
+                                  NNC_Polyhedron& mu_space);
 
 //@} // Functions for the Synthesis of Linear Rankings
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/termination.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_templates.hh line 1. */
 /* Utilities for termination analysis: template functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/termination.templates.hh line 33. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_templates.hh line 33. */
 
 #include <stdexcept>
 
@@ -102991,7 +103078,7 @@ output_function_MS(std::ostream& s, const Variable v) {
     else if (id == output_function_MS_n)
       s << "mu0";
     else if (output_function_MS_which == 2
-	     && id <= output_function_MS_n + output_function_MS_m + 2)
+             && id <= output_function_MS_n + output_function_MS_m + 2)
       s << "z" << id - output_function_MS_n;
     else
       s << "WHAT?";
@@ -103037,30 +103124,30 @@ output_function_PR(std::ostream& s, const Variable v) {
 
 void
 assign_all_inequalities_approximation(const Constraint_System& cs_in,
-				      Constraint_System& cs_out);
+                                      Constraint_System& cs_out);
 
 template <typename PSET>
 inline void
 assign_all_inequalities_approximation(const PSET& pset,
-				      Constraint_System& cs) {
+                                      Constraint_System& cs) {
   assign_all_inequalities_approximation(pset.minimized_constraints(), cs);
 }
 
 template <>
 void
 assign_all_inequalities_approximation(const C_Polyhedron& ph,
-				      Constraint_System& cs);
+                                      Constraint_System& cs);
 
 bool
 termination_test_MS(const Constraint_System& cs);
 
 bool
 one_affine_ranking_function_MS(const Constraint_System& cs,
-			       Generator& mu);
+                               Generator& mu);
 
 void
 all_affine_ranking_functions_MS(const Constraint_System& cs,
-				C_Polyhedron& mu_space);
+                                C_Polyhedron& mu_space);
 
 void
 all_affine_quasi_ranking_functions_MS(const Constraint_System& cs,
@@ -103069,17 +103156,17 @@ all_affine_quasi_ranking_functions_MS(const Constraint_System& cs,
 
 bool
 termination_test_PR(const Constraint_System& cs_before,
-		    const Constraint_System& cs_after);
+                    const Constraint_System& cs_after);
 
 bool
 one_affine_ranking_function_PR(const Constraint_System& cs_before,
-			       const Constraint_System& cs_after,
-			       Generator& mu);
+                               const Constraint_System& cs_after,
+                               Generator& mu);
 
 void
 all_affine_ranking_functions_PR(const Constraint_System& cs_before,
-				const Constraint_System& cs_after,
-				NNC_Polyhedron& mu_space);
+                                const Constraint_System& cs_after,
+                                NNC_Polyhedron& mu_space);
 
 bool
 termination_test_PR_original(const Constraint_System& cs);
@@ -103174,8 +103261,8 @@ one_affine_ranking_function_MS(const PSET& pset, Generator& mu) {
 template <typename PSET>
 bool
 one_affine_ranking_function_MS_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu) {
+                                 const PSET& pset_after,
+                                 Generator& mu) {
   const dimension_type before_space_dim = pset_before.space_dimension();
   const dimension_type after_space_dim = pset_after.space_dimension();
   if (after_space_dim != 2*before_space_dim) {
@@ -103220,8 +103307,8 @@ all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space) {
 template <typename PSET>
 void
 all_affine_ranking_functions_MS_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  C_Polyhedron& mu_space) {
+                                  const PSET& pset_after,
+                                  C_Polyhedron& mu_space) {
   const dimension_type before_space_dim = pset_before.space_dimension();
   const dimension_type after_space_dim = pset_after.space_dimension();
   if (after_space_dim != 2*before_space_dim) {
@@ -103351,8 +103438,8 @@ termination_test_PR(const PSET& pset) {
 template <typename PSET>
 bool
 one_affine_ranking_function_PR_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu) {
+                                 const PSET& pset_after,
+                                 Generator& mu) {
   const dimension_type before_space_dim = pset_before.space_dimension();
   const dimension_type after_space_dim = pset_after.space_dimension();
   if (after_space_dim != 2*before_space_dim) {
@@ -103394,8 +103481,8 @@ one_affine_ranking_function_PR(const PSET& pset, Generator& mu) {
 template <typename PSET>
 void
 all_affine_ranking_functions_PR_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  NNC_Polyhedron& mu_space) {
+                                  const PSET& pset_after,
+                                  NNC_Polyhedron& mu_space) {
   const dimension_type before_space_dim = pset_before.space_dimension();
   const dimension_type after_space_dim = pset_after.space_dimension();
   if (after_space_dim != 2*before_space_dim) {
@@ -103424,7 +103511,7 @@ all_affine_ranking_functions_PR_2(const PSET& pset_before,
 template <typename PSET>
 void
 all_affine_ranking_functions_PR(const PSET& pset,
-				NNC_Polyhedron& mu_space) {
+                                NNC_Polyhedron& mu_space) {
   const dimension_type space_dim = pset.space_dimension();
   if (space_dim % 2 != 0) {
     std::ostringstream s;
@@ -103447,14 +103534,14 @@ all_affine_ranking_functions_PR(const PSET& pset,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/termination.defs.hh line 501. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/termination_defs.hh line 501. */
 
-/* Automatically generated from PPL source file ../src/wrap_string.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/wrap_string.hh line 1. */
 /* Declaration of string wrapping function.
 */
 
 
-/* Automatically generated from PPL source file ../src/wrap_string.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/wrap_string.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -103479,21 +103566,21 @@ namespace IO_Operators {
 */
 std::string
 wrap_string(const std::string& src_string,
-	    unsigned indent_depth,
-	    unsigned preferred_first_line_length,
-	    unsigned preferred_line_length);
+            unsigned indent_depth,
+            unsigned preferred_first_line_length,
+            unsigned preferred_line_length);
 
 } // namespace IO_Operators
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Cast_Floating_Point_Expression class and
    its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -103503,7 +103590,7 @@ class Cast_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -103639,7 +103726,7 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Cast_Floating_Point_Expression(
-			  const Cast_Floating_Point_Expression& y);
+                          const Cast_Floating_Point_Expression& y);
 
   #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   /*! \brief
@@ -103647,18 +103734,18 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAIL
   Cast_Floating_Point_Expression& operator=(
-		          const Cast_Floating_Point_Expression& y);
+                          const Cast_Floating_Point_Expression& y);
 
 }; // class Cast_Floating_Point_Expression
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_inlines.hh line 1. */
 /* Cast_Floating_Point_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -103695,9 +103782,9 @@ swap(Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.defs.hh line 181. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_defs.hh line 181. */
 
-/* Automatically generated from PPL source file ../src/Cast_Floating_Point_Expression.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Cast_Floating_Point_Expression_templates.hh line 1. */
 /* Cast_Floating_Point_Expression class implementation:
    non-inline template functions.
 */
@@ -103721,13 +103808,13 @@ bool Cast_Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constant_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constant_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Constant_Floating_Point_Expression class and
    its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constant_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constant_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -103737,7 +103824,7 @@ class Constant_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constant_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constant_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -103864,7 +103951,7 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Constant_Floating_Point_Expression(
-			  const Constant_Floating_Point_Expression& y);
+                          const Constant_Floating_Point_Expression& y);
 
   #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   /*! \brief
@@ -103872,18 +103959,18 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAIL
   Constant_Floating_Point_Expression& operator=(
-		          const Constant_Floating_Point_Expression& y);
+                          const Constant_Floating_Point_Expression& y);
 
 }; // class Constant_Floating_Point_Expression
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constant_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constant_Floating_Point_Expression_inlines.hh line 1. */
 /* Constant_Floating_Point_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Constant_Floating_Point_Expression.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constant_Floating_Point_Expression_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -103936,15 +104023,15 @@ swap(Constant_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Constant_Floating_Point_Expression.defs.hh line 172. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Constant_Floating_Point_Expression_defs.hh line 172. */
 
-/* Automatically generated from PPL source file ../src/Variable_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Variable_Floating_Point_Expression class and
    its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Variable_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -103954,7 +104041,7 @@ class Variable_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variable_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 #include <utility>
 
@@ -104092,7 +104179,7 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Variable_Floating_Point_Expression(
-			  const Variable_Floating_Point_Expression& y);
+                          const Variable_Floating_Point_Expression& y);
 
   #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   /*! \brief
@@ -104100,7 +104187,7 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Variable_Floating_Point_Expression& operator=(
-		          const Variable_Floating_Point_Expression& y);
+                          const Variable_Floating_Point_Expression& y);
 
   //! The index of the variable.
   dimension_type variable_index;
@@ -104109,12 +104196,12 @@ private:
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variable_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_Floating_Point_Expression_inlines.hh line 1. */
 /* Variable_Floating_Point_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Variable_Floating_Point_Expression.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_Floating_Point_Expression_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -104181,15 +104268,15 @@ swap(Variable_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Variable_Floating_Point_Expression.defs.hh line 186. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Variable_Floating_Point_Expression_defs.hh line 186. */
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Sum_Floating_Point_Expression class and
    its   constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -104199,7 +104286,7 @@ class Sum_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -104208,7 +104295,7 @@ namespace Parma_Polyhedra_Library {
 /*! \relates Sum_Floating_Point_Expression */
 template <typename FP_Interval_Type, typename FP_Format>
 void swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-	  Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+          Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
 
 /*! \brief
   A generic Sum Floating Point Expression.
@@ -104314,7 +104401,7 @@ public:
     corresponding to \p x \f$\oplus\f$ \p y.
   */
   Sum_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
            Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
 
   //! Destructor.
@@ -104372,20 +104459,20 @@ private:
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
   operator=(const Sum_Floating_Point_Expression<FP_Interval_Type,
-	    FP_Format>& e);
+            FP_Format>& e);
 
 
 }; // class Sum_Floating_Point_Expression
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_inlines.hh line 1. */
 /* Sum_Floating_Point_Expression class implementation: inline
    functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -104427,7 +104514,7 @@ swap(Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_templates.hh line 1. */
 /* Sum_Floating_Point_Expression class implementation:
    non-inline template functions.
 */
@@ -104458,15 +104545,15 @@ bool Sum_Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Sum_Floating_Point_Expression.defs.hh line 212. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Sum_Floating_Point_Expression_defs.hh line 212. */
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Difference_Floating_Point_Expression class and
    its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -104476,7 +104563,7 @@ class Difference_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -104597,7 +104684,7 @@ public:
     expression corresponding to \p x \f$\ominus\f$ \p y.
   */
   Difference_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
            Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
 
   //! Destructor.
@@ -104657,20 +104744,20 @@ private:
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
   operator=(const Difference_Floating_Point_Expression<FP_Interval_Type,
-	                                               FP_Format>& e);
+                                                       FP_Format>& e);
 
 
 }; // class Difference_Floating_Point_Expression
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_inlines.hh line 1. */
 /* Difference_Floating_Point_Expression class implementation: inline
    functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -104712,7 +104799,7 @@ swap(Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_templates.hh line 1. */
 /* Difference_Floating_Point_Expression class implementation:
    non-inline template functions.
 */
@@ -104743,15 +104830,15 @@ bool Difference_Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Difference_Floating_Point_Expression.defs.hh line 220. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Difference_Floating_Point_Expression_defs.hh line 220. */
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Multiplication_Floating_Point_Expression class and
    its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -104761,7 +104848,7 @@ class Multiplication_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -104912,7 +104999,7 @@ public:
     expression corresponding to \p x \f$\otimes\f$ \p y.
   */
   Multiplication_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const x,
            Floating_Point_Expression<FP_Interval_Type, FP_Format>* const y);
 
   //! Destructor.
@@ -104942,7 +105029,7 @@ public:
     is computed.
   */
   bool linearize(const FP_Interval_Abstract_Store& int_store,
-		         const FP_Linear_Form_Abstract_Store& lf_store,
+                         const FP_Linear_Form_Abstract_Store& lf_store,
                        FP_Linear_Form& result) const;
 
   //! Swaps \p *this with \p y.
@@ -104972,20 +105059,20 @@ private:
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
   operator=(const Multiplication_Floating_Point_Expression<FP_Interval_Type,
-	    FP_Format>& e);
+            FP_Format>& e);
 
 
 }; // class Multiplication_Floating_Point_Expression
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_inlines.hh line 1. */
 /* Multiplication_Floating_Point_Expression class implementation: inline
    functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.inlines.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_inlines.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -105028,7 +105115,7 @@ swap(Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_templates.hh line 1. */
 /* Multiplication_Floating_Point_Expression class implementation:
    non-inline template functions.
 */
@@ -105115,15 +105202,15 @@ bool Multiplication_Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Multiplication_Floating_Point_Expression.defs.hh line 250. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Multiplication_Floating_Point_Expression_defs.hh line 250. */
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Division_Floating_Point_Expression class and its
    constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105133,7 +105220,7 @@ class Division_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -105142,7 +105229,7 @@ namespace Parma_Polyhedra_Library {
 /*! \relates Division_Floating_Point_Expression */
 template <typename FP_Interval_Type, typename FP_Format>
 void swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
-	  Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
+          Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& y);
 
 /*! \brief
   A generic Division Floating Point Expression.
@@ -105271,7 +105358,7 @@ public:
     expression corresponding to \p num \f$\oslash\f$ \p den.
   */
   Division_Floating_Point_Expression(
-	   Floating_Point_Expression<FP_Interval_Type, FP_Format>* const num,
+           Floating_Point_Expression<FP_Interval_Type, FP_Format>* const num,
            Floating_Point_Expression<FP_Interval_Type, FP_Format>* const den);
 
   //! Destructor.
@@ -105306,7 +105393,7 @@ public:
 
   //! Swaps \p *this with \p y.
   void m_swap(Division_Floating_Point_Expression<FP_Interval_Type,
-	                                         FP_Format>& y);
+                                                 FP_Format>& y);
 
 private:
 
@@ -105331,19 +105418,18 @@ private:
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>&
   operator=(const Division_Floating_Point_Expression<FP_Interval_Type,
-	    FP_Format>& e);
-
+            FP_Format>& e);
 
 }; // class Division_Floating_Point_Expression
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_inlines.hh line 1. */
 /* Division_Floating_Point_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -105356,7 +105442,7 @@ Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
   : first_operand(num), second_operand(den) {
   assert(num != 0);
   assert(den != 0);
- }
+}
 
 template <typename FP_Interval_Type, typename FP_Format>
 inline
@@ -105385,7 +105471,7 @@ swap(Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_templates.hh line 1. */
 /* Division_Floating_Point_Expression class implementation:
    non-inline template functions.
 */
@@ -105424,15 +105510,15 @@ bool Division_Floating_Point_Expression<FP_Interval_Type, FP_Format>
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Division_Floating_Point_Expression.defs.hh line 237. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Division_Floating_Point_Expression_defs.hh line 236. */
 
-/* Automatically generated from PPL source file ../src/Opposite_Floating_Point_Expression.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Opposite_Floating_Point_Expression_defs.hh line 1. */
 /* Declarations for the Opposite_Floating_Point_Expression class and
    its constituents.
 */
 
 
-/* Automatically generated from PPL source file ../src/Opposite_Floating_Point_Expression.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Opposite_Floating_Point_Expression_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105442,7 +105528,7 @@ class Opposite_Floating_Point_Expression;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Opposite_Floating_Point_Expression.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Opposite_Floating_Point_Expression_defs.hh line 31. */
 #include <map>
 
 namespace Parma_Polyhedra_Library {
@@ -105498,40 +105584,40 @@ class Opposite_Floating_Point_Expression
 
 public:
 
-  /* \brief
-     Alias for the Linear_Form<FP_Interval_Type> from
-     Floating_Point_Expression
+  /*! \brief
+    Alias for the Linear_Form<FP_Interval_Type> from
+    Floating_Point_Expression
   */
   typedef typename
   Floating_Point_Expression<FP_Interval_Type, FP_Format>::
   FP_Linear_Form FP_Linear_Form;
 
-  /* \brief
-     Alias for the std::map<dimension_type, FP_Interval_Type> from
-     Floating_Point_Expression.
+  /*! \brief
+    Alias for the std::map<dimension_type, FP_Interval_Type> from
+    Floating_Point_Expression.
   */
   typedef typename
   Floating_Point_Expression<FP_Interval_Type, FP_Format>::
   FP_Interval_Abstract_Store FP_Interval_Abstract_Store;
 
-  /* \brief
-     Alias for the std::map<dimension_type, FP_Linear_Form> from
-     Floating_Point_Expression.
+  /*! \brief
+    Alias for the std::map<dimension_type, FP_Linear_Form> from
+    Floating_Point_Expression.
   */
   typedef typename
   Floating_Point_Expression<FP_Interval_Type, FP_Format>::
   FP_Linear_Form_Abstract_Store FP_Linear_Form_Abstract_Store;
 
-  /* \brief
-     Alias for the FP_Interval_Type::boundary_type from
-     Floating_Point_Expression.
+  /*! \brief
+    Alias for the FP_Interval_Type::boundary_type from
+    Floating_Point_Expression.
   */
   typedef typename
   Floating_Point_Expression<FP_Interval_Type, FP_Format>::boundary_type
   boundary_type;
 
-  /* \brief
-     Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
+  /*! \brief
+    Alias for the FP_Interval_Type::info_type from Floating_Point_Expression.
   */
   typedef typename
   Floating_Point_Expression<FP_Interval_Type, FP_Format>::info_type info_type;
@@ -105586,7 +105672,7 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Opposite_Floating_Point_Expression(
-			  const Opposite_Floating_Point_Expression& y);
+                          const Opposite_Floating_Point_Expression& y);
 
   #ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   /*! \brief
@@ -105594,7 +105680,7 @@ private:
   */
   #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
   Opposite_Floating_Point_Expression& operator=(
-			  const Opposite_Floating_Point_Expression& y);
+                          const Opposite_Floating_Point_Expression& y);
 
   //! Pointer to the operand.
   Floating_Point_Expression<FP_Interval_Type, FP_Format>* operand;
@@ -105603,12 +105689,12 @@ private:
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Opposite_Floating_Point_Expression.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Opposite_Floating_Point_Expression_inlines.hh line 1. */
 /* Opposite_Floating_Point_Expression class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Opposite_Floating_Point_Expression.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Opposite_Floating_Point_Expression_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -105660,14 +105746,14 @@ swap(Opposite_Floating_Point_Expression<FP_Interval_Type, FP_Format>& x,
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Opposite_Floating_Point_Expression.defs.hh line 192. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Opposite_Floating_Point_Expression_defs.hh line 192. */
 
-/* Automatically generated from PPL source file ../src/Watchdog.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Watchdog_defs.hh line 1. */
 /* Watchdog and associated classes' declaration and inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Watchdog.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Watchdog_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105676,12 +105762,12 @@ class Watchdog;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Time.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Time_defs.hh line 1. */
 /* Time class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Time.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Time_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105698,7 +105784,7 @@ class Time;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Time.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Time_defs.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -105795,7 +105881,7 @@ private:
   long microsecs;
 };
 
-/* Automatically generated from PPL source file ../src/Time.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Time_inlines.hh line 1. */
 /* Time class implementation: inline functions.
 */
 
@@ -105928,9 +106014,9 @@ operator>=(const Time& x, const Time& y) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Time.defs.hh line 125. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Time_defs.hh line 125. */
 
-/* Automatically generated from PPL source file ../src/Handler.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Handler_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105952,12 +106038,12 @@ class Handler_Function;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pending_List.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_List_defs.hh line 1. */
 /* Pending_List class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Pending_List.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_List_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105975,12 +106061,12 @@ class Pending_List;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pending_Element.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_Element_defs.hh line 1. */
 /* Pending_Element class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Pending_Element.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_Element_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -105998,68 +106084,56 @@ class Pending_Element;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Doubly_Linked_Object.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Doubly_Linked_Object_defs.hh line 1. */
 /* Doubly_Linked_Object class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Doubly_Linked_Object.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Doubly_Linked_Object_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 class Doubly_Linked_Object;
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/EList.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 template <typename T>
 class EList;
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/EList_Iterator.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_Iterator_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 template <typename T>
 class EList_Iterator;
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Doubly_Linked_Object.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Doubly_Linked_Object_defs.hh line 30. */
 
 //! A (base) class for doubly linked objects.
-class Parma_Polyhedra_Library::Implementation::Watchdog::Doubly_Linked_Object {
+class Parma_Polyhedra_Library::Implementation::Doubly_Linked_Object {
 public:
   //! Default constructor.
   Doubly_Linked_Object();
@@ -106090,7 +106164,7 @@ private:
   template <typename T> friend class EList_Iterator;
 };
 
-/* Automatically generated from PPL source file ../src/Doubly_Linked_Object.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Doubly_Linked_Object_inlines.hh line 1. */
 /* Doubly_Linked_Object class implementation: inline functions.
 */
 
@@ -106099,15 +106173,13 @@ namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 inline
 Doubly_Linked_Object::Doubly_Linked_Object() {
 }
 
 inline
 Doubly_Linked_Object::Doubly_Linked_Object(Doubly_Linked_Object* f,
-					   Doubly_Linked_Object* b)
+                                           Doubly_Linked_Object* b)
   : next(f),
     prev(b) {
 }
@@ -106140,15 +106212,13 @@ Doubly_Linked_Object::~Doubly_Linked_Object() {
   erase();
 }
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Doubly_Linked_Object.defs.hh line 64. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Doubly_Linked_Object_defs.hh line 64. */
 
-/* Automatically generated from PPL source file ../src/Pending_Element.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_Element_defs.hh line 30. */
 
 //! A class for pending watchdog events with embedded links.
 /*!
@@ -106163,13 +106233,13 @@ class Parma_Polyhedra_Library::Implementation::Watchdog::Pending_Element
 public:
   //! Constructs an element with the given attributes.
   Pending_Element(const Threshold& deadline,
-		  const Handler& handler,
-		  bool& expired_flag);
+                  const Handler& handler,
+                  bool& expired_flag);
 
   //! Modifies \p *this so that it has the given attributes.
   void assign(const Threshold& deadline,
-	      const Handler& handler,
-	      bool& expired_flag);
+              const Handler& handler,
+              bool& expired_flag);
 
   //! Returns the deadline of the event.
   const Threshold& deadline() const;
@@ -106194,7 +106264,7 @@ private:
   bool* p_f;
 };
 
-/* Automatically generated from PPL source file ../src/Pending_Element.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_Element_inlines.hh line 1. */
 /* Pending_Element class implementation: inline functions.
 */
 
@@ -106216,8 +106286,8 @@ Pending_Element<Threshold>::OK() const {
 template <typename Threshold>
 inline
 Pending_Element<Threshold>::Pending_Element(const Threshold& deadline,
-					    const Handler& handler,
-					    bool& expired_flag)
+                                            const Handler& handler,
+                                            bool& expired_flag)
   : d(deadline), p_h(&handler), p_f(&expired_flag) {
   assert(OK());
 }
@@ -106225,8 +106295,8 @@ Pending_Element<Threshold>::Pending_Element(const Threshold& deadline,
 template <typename Threshold>
 inline void
 Pending_Element<Threshold>::assign(const Threshold& deadline,
-				   const Handler& handler,
-				   bool& expired_flag) {
+                                   const Handler& handler,
+                                   bool& expired_flag) {
   d = deadline;
   p_h = &handler;
   p_f = &expired_flag;
@@ -106257,26 +106327,24 @@ Pending_Element<Threshold>::expired_flag() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pending_Element.defs.hh line 76. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_Element_defs.hh line 76. */
 
-/* Automatically generated from PPL source file ../src/EList.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_defs.hh line 1. */
 /* EList class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/EList_Iterator.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_Iterator_defs.hh line 1. */
 /* EList_Iterator class declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/EList_Iterator.defs.hh line 29. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_Iterator_defs.hh line 29. */
 
 namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 //! Returns <CODE>true</CODE> if and only if \p x and \p y are equal.
 template <typename T>
 bool operator==(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
@@ -106285,15 +106353,13 @@ bool operator==(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
 template <typename T>
 bool operator!=(const EList_Iterator<T>& x, const EList_Iterator<T>& y);
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
 //! A class providing iterators for embedded lists.
 template <typename T>
-class Parma_Polyhedra_Library::Implementation::Watchdog::EList_Iterator {
+class Parma_Polyhedra_Library::Implementation::EList_Iterator {
 public:
   //! Constructs an iterator pointing to nothing.
   EList_Iterator();
@@ -106331,19 +106397,17 @@ private:
   friend bool operator!=<T>(const EList_Iterator& x, const EList_Iterator& y);
 };
 
-/* Automatically generated from PPL source file ../src/EList_Iterator.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_Iterator_inlines.hh line 1. */
 /* EList_Iterator class implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/EList_Iterator.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_Iterator_inlines.hh line 28. */
 
 namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 template <typename T>
 inline
 EList_Iterator<T>::EList_Iterator() {
@@ -106416,29 +106480,27 @@ operator!=(const EList_Iterator<T>& x, const EList_Iterator<T>& y) {
   return x.ptr != y.ptr;
 }
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/EList_Iterator.defs.hh line 91. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_Iterator_defs.hh line 87. */
 
-/* Automatically generated from PPL source file ../src/EList.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_defs.hh line 30. */
 
 /*! \brief
   A simple kind of embedded list (i.e., a doubly linked objects
   where the links are embedded in the objects themselves).
 */
 template <typename T>
-class Parma_Polyhedra_Library::Implementation::Watchdog::EList
+class Parma_Polyhedra_Library::Implementation::EList
   : private Doubly_Linked_Object {
 public:
   //! A const iterator to traverse the list.
-  typedef EList_Iterator<const T> Const_Iterator;
+  typedef EList_Iterator<const T> const_iterator;
 
   //! A non-const iterator to traverse the list.
-  typedef EList_Iterator<T> Iterator;
+  typedef EList_Iterator<T> iterator;
 
   //! Constructs an empty list.
   EList();
@@ -106456,34 +106518,34 @@ public:
     Inserts \p obj just before \p position and returns an iterator
     that points to the inserted object.
   */
-  Iterator insert(Iterator position, T& obj);
+  iterator insert(iterator position, T& obj);
 
   /*! \brief
     Removes the element pointed to by \p position, returning
     an iterator pointing to the next element, if any, or end(), otherwise.
   */
-  Iterator erase(Iterator position);
+  iterator erase(iterator position);
 
   //! Returns <CODE>true</CODE> if and only if the list is empty.
   bool empty() const;
 
   //! Returns an iterator pointing to the beginning of the list.
-  Iterator begin();
+  iterator begin();
 
   //! Returns an iterator pointing one past the last element in the list.
-  Iterator end();
+  iterator end();
 
   //! Returns a const iterator pointing to the beginning of the list.
-  Const_Iterator begin() const;
+  const_iterator begin() const;
 
   //! Returns a const iterator pointing one past the last element in the list.
-  Const_Iterator end() const;
+  const_iterator end() const;
 
   //! Checks if all the invariants are satisfied.
   bool OK() const;
 };
 
-/* Automatically generated from PPL source file ../src/EList.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_inlines.hh line 1. */
 /* EList class implementation: inline functions.
 */
 
@@ -106494,8 +106556,6 @@ namespace Parma_Polyhedra_Library {
 
 namespace Implementation {
 
-namespace Watchdog {
-
 template <typename T>
 inline
 EList<T>::EList()
@@ -106515,34 +106575,34 @@ EList<T>::push_back(T& obj) {
 }
 
 template <typename T>
-inline typename EList<T>::Iterator
-EList<T>::insert(Iterator position, T& obj) {
+inline typename EList<T>::iterator
+EList<T>::insert(iterator position, T& obj) {
   position->insert_before(obj);
-  return Iterator(&obj);
+  return iterator(&obj);
 }
 
 template <typename T>
-inline typename EList<T>::Iterator
+inline typename EList<T>::iterator
 EList<T>::begin() {
-  return Iterator(next);
+  return iterator(next);
 }
 
 template <typename T>
-inline typename EList<T>::Iterator
+inline typename EList<T>::iterator
 EList<T>::end() {
-  return Iterator(this);
+  return iterator(this);
 }
 
 template <typename T>
-inline typename EList<T>::Const_Iterator
+inline typename EList<T>::const_iterator
 EList<T>::begin() const {
-  return Const_Iterator(next);
+  return const_iterator(next);
 }
 
 template <typename T>
-inline typename EList<T>::Const_Iterator
+inline typename EList<T>::const_iterator
 EList<T>::end() const {
-  return Const_Iterator(const_cast<EList<T>*>(this));
+  return const_iterator(const_cast<EList<T>*>(this));
 }
 
 template <typename T>
@@ -106552,17 +106612,17 @@ EList<T>::empty() const {
 }
 
 template <typename T>
-inline typename EList<T>::Iterator
-EList<T>::erase(Iterator position) {
+inline typename EList<T>::iterator
+EList<T>::erase(iterator position) {
   assert(!empty());
-  return Iterator(position->erase());
+  return iterator(position->erase());
 }
 
 template <typename T>
 inline
 EList<T>::~EList() {
   // Erase and deallocate all the elements.
-  for (Iterator i = begin(), lend = end(), next; i != lend; i = next) {
+  for (iterator i = begin(), lend = end(), next; i != lend; i = next) {
     next = erase(i);
     delete &*i;
   }
@@ -106571,32 +106631,30 @@ EList<T>::~EList() {
 template <typename T>
 inline bool
 EList<T>::OK() const {
-  for (Const_Iterator i = begin(), lend = end(); i != lend; ++i)
+  for (const_iterator i = begin(), lend = end(); i != lend; ++i)
     if (!i->OK())
       return false;
 
   return true;
 }
 
-} // namespace Watchdog
-
 } // namespace Implementation
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/EList.defs.hh line 89. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/EList_defs.hh line 89. */
 
-/* Automatically generated from PPL source file ../src/Pending_List.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_List_defs.hh line 31. */
 
 //! An ordered list for recording pending watchdog events.
 template <typename Traits>
 class Parma_Polyhedra_Library::Implementation::Watchdog::Pending_List {
 public:
   //! A non-const iterator to traverse the list.
-  typedef typename EList<Pending_Element<typename Traits::Threshold> >::Iterator Iterator;
+  typedef typename EList<Pending_Element<typename Traits::Threshold> >::iterator iterator;
 
   //! A const iterator to traverse the list.
-  typedef typename EList<Pending_Element<typename Traits::Threshold> >::Const_Iterator Const_Iterator;
+  typedef typename EList<Pending_Element<typename Traits::Threshold> >::const_iterator const_iterator;
 
   //! Constructs an empty list.
   Pending_List();
@@ -106605,24 +106663,24 @@ public:
   ~Pending_List();
 
   //! Inserts a new Pending_Element object with the given attributes.
-  Iterator insert(const typename Traits::Threshold& deadline,
-		  const Handler& handler,
-		  bool& expired_flag);
+  iterator insert(const typename Traits::Threshold& deadline,
+                  const Handler& handler,
+                  bool& expired_flag);
 
   /*! \brief
     Removes the element pointed to by \p position, returning
     an iterator pointing to the next element, if any, or end(), otherwise.
   */
-  Iterator erase(Iterator position);
+  iterator erase(iterator position);
 
   //! Returns <CODE>true</CODE> if and only if the list is empty.
   bool empty() const;
 
   //! Returns an iterator pointing to the beginning of the list.
-  Iterator begin();
+  iterator begin();
 
   //! Returns an iterator pointing one past the last element in the list.
-  Iterator end();
+  iterator end();
 
   //! Checks if all the invariants are satisfied.
   bool OK() const;
@@ -106632,7 +106690,7 @@ private:
   EList<Pending_Element<typename Traits::Threshold> > free_list;
 };
 
-/* Automatically generated from PPL source file ../src/Pending_List.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_List_inlines.hh line 1. */
 /* Pending_List class implementation: inline functions.
 */
 
@@ -106659,13 +106717,13 @@ Pending_List<Traits>::~Pending_List() {
 }
 
 template <typename Traits>
-inline typename Pending_List<Traits>::Iterator
+inline typename Pending_List<Traits>::iterator
 Pending_List<Traits>::begin() {
   return active_list.begin();
 }
 
 template <typename Traits>
-inline typename Pending_List<Traits>::Iterator
+inline typename Pending_List<Traits>::iterator
 Pending_List<Traits>::end() {
   return active_list.end();
 }
@@ -106677,10 +106735,10 @@ Pending_List<Traits>::empty() const {
 }
 
 template <typename Traits>
-inline typename Pending_List<Traits>::Iterator
-Pending_List<Traits>::erase(Iterator position) {
+inline typename Pending_List<Traits>::iterator
+Pending_List<Traits>::erase(iterator position) {
   assert(!empty());
-  Iterator next = active_list.erase(position);
+  iterator next = active_list.erase(position);
   free_list.push_back(*position);
   assert(OK());
   return next;
@@ -106692,7 +106750,7 @@ Pending_List<Traits>::erase(Iterator position) {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pending_List.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_List_templates.hh line 1. */
 /* Pending_List class implementation.
 */
 
@@ -106706,17 +106764,17 @@ namespace Implementation {
 namespace Watchdog {
 
 template <typename Traits>
-typename Pending_List<Traits>::Iterator
+typename Pending_List<Traits>::iterator
 Pending_List<Traits>::insert(const typename Traits::Threshold& deadline,
-			     const Handler& handler,
-			     bool& expired_flag) {
-  Iterator position = active_list.begin();
-  for (Iterator active_list_end = active_list.end();
+                             const Handler& handler,
+                             bool& expired_flag) {
+  iterator position = active_list.begin();
+  for (iterator active_list_end = active_list.end();
        position != active_list_end
          && Traits::less_than(position->deadline(), deadline);
        ++position)
     ;
-  Iterator pending_element_p;
+  iterator pending_element_p;
   // Only allocate a new element if the free list is empty.
   if (free_list.empty())
     pending_element_p
@@ -106728,7 +106786,7 @@ Pending_List<Traits>::insert(const typename Traits::Threshold& deadline,
     free_list.erase(pending_element_p);
     pending_element_p->assign(deadline, handler, expired_flag);
   }
-  Iterator r = active_list.insert(position, *pending_element_p);
+  iterator r = active_list.insert(position, *pending_element_p);
   assert(OK());
   return r;
 }
@@ -106743,15 +106801,15 @@ Pending_List<Traits>::OK() const {
     return false;
 
   const typename Traits::Threshold* old;
-  Const_Iterator i = active_list.begin();
+  const_iterator i = active_list.begin();
   old = &i->deadline();
   ++i;
-  for (Const_Iterator active_list_end = active_list.end(); i != active_list_end; ++i) {
+  for (const_iterator active_list_end = active_list.end(); i != active_list_end; ++i) {
     const typename Traits::Threshold& t = i->deadline();
     if (Traits::less_than(t, *old)) {
 #ifndef NDEBUG
       std::cerr << "The active list is not sorted!"
-		<< std::endl;
+                << std::endl;
 #endif
       return false;
     }
@@ -106766,9 +106824,9 @@ Pending_List<Traits>::OK() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Pending_List.defs.hh line 78. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Pending_List_defs.hh line 78. */
 
-/* Automatically generated from PPL source file ../src/Watchdog.defs.hh line 31. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Watchdog_defs.hh line 31. */
 #include <cassert>
 #include <functional>
 
@@ -106798,7 +106856,7 @@ public:
     Constructor: if not reset, the watchdog will trigger after \p csecs
     centiseconds, invoking handler \p function.
   */
-  Watchdog(long csecs, void (*function)());
+  Watchdog(long csecs, void (* const function)());
 
   //! Destructor.
   ~Watchdog();
@@ -106821,7 +106879,7 @@ private:
   WD_Handler;
 
   const WD_Handler& handler;
-  WD_Pending_List::Iterator pending_position;
+  WD_Pending_List::iterator pending_position;
 
   // Private and not implemented: copy construction is not allowed.
   Watchdog(const Watchdog&);
@@ -106862,13 +106920,13 @@ private:
   static void handle_timeout(int);
 
   //! Handles the addition of a new watchdog event.
-  static WD_Pending_List::Iterator
+  static WD_Pending_List::iterator
   new_watchdog_event(long csecs,
                      const WD_Handler& handler,
                      bool& expired_flag);
 
   //! Handles the removal of the watchdog event referred by \p position.
-  void remove_watchdog_event(WD_Pending_List::Iterator position);
+  void remove_watchdog_event(WD_Pending_List::iterator position);
 
   //! Whether the alarm clock is running.
   static volatile bool alarm_clock_running;
@@ -106883,17 +106941,17 @@ private:
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Watchdog.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Watchdog_inlines.hh line 1. */
 /* Watchdog and associated classes' implementation: inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Handler.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Handler_defs.hh line 1. */
 /* Handler and derived classes' declaration.
 */
 
 
-/* Automatically generated from PPL source file ../src/Handler.defs.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Handler_defs.hh line 28. */
 
 //! Abstract base class for handlers of the watchdog events.
 class Parma_Polyhedra_Library::Implementation::Watchdog::Handler {
@@ -106907,8 +106965,9 @@ public:
 
 //! A kind of Handler that installs a flag onto a flag-holder.
 /*!
-  The template class Handler_Flag<Flag_Base, Flag> is an handler whose
-  job is to install a flag onto an <EM>holder</EM> for the flag.
+  The template class <CODE>Handler_Flag\<Flag_Base, Flag\></CODE>
+  is an handler whose job is to install a flag onto an <EM>holder</EM>
+  for the flag.
   The flag is of type \p Flag and the holder is a (volatile) pointer
   to \p Flag_Base.  Installing the flag onto the holder means making
   the holder point to the flag, so that it must be possible to assign
@@ -106949,17 +107008,17 @@ class Parma_Polyhedra_Library::Implementation::Watchdog::Handler_Function
   : public Handler {
 public:
   //! Constructor with a given function.
-  Handler_Function(void (*function)());
+  Handler_Function(void (* const function)());
 
   //! Does its job: calls the embedded function.
   virtual void act() const;
 
 private:
   //! Pointer to the embedded function.
-  void (*f)();
+  void (* const f)();
 };
 
-/* Automatically generated from PPL source file ../src/Handler.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Handler_inlines.hh line 1. */
 /* Handler and derived classes' implementation: inline functions.
 */
 
@@ -106976,7 +107035,7 @@ Handler::~Handler() {
 
 template <typename Flag_Base, typename Flag>
 Handler_Flag<Flag_Base, Flag>::Handler_Flag(const Flag_Base* volatile& holder,
-					    Flag& flag)
+                                            Flag& flag)
   : h(holder), f(flag) {
 }
 
@@ -106988,7 +107047,7 @@ Handler_Flag<Flag_Base, Flag>::act() const {
 }
 
 inline
-Handler_Function::Handler_Function(void (*function)())
+Handler_Function::Handler_Function(void (* const function)())
   : f(function) {
 }
 
@@ -107003,9 +107062,9 @@ Handler_Function::act() const {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Handler.defs.hh line 94. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Handler_defs.hh line 95. */
 
-/* Automatically generated from PPL source file ../src/Watchdog.inlines.hh line 28. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Watchdog_inlines.hh line 28. */
 #include <stdexcept>
 
 namespace Parma_Polyhedra_Library {
@@ -107014,7 +107073,7 @@ namespace Parma_Polyhedra_Library {
 
 template <typename Flag_Base, typename Flag>
 Watchdog::Watchdog(long csecs,
-		   const Flag_Base* volatile& holder,
+                   const Flag_Base* volatile& holder,
                    Flag& flag)
   : expired(false),
     handler(*new
@@ -107022,19 +107081,19 @@ Watchdog::Watchdog(long csecs,
                                                                     flag)) {
   if (csecs == 0)
     throw std::invalid_argument("Watchdog constructor called with a"
-				" non-positive number of centiseconds");
+                                " non-positive number of centiseconds");
   in_critical_section = true;
   pending_position = new_watchdog_event(csecs, handler, expired);
   in_critical_section = false;
 }
 
 inline
-Watchdog::Watchdog(long csecs, void (*function)())
+Watchdog::Watchdog(long csecs, void (* const function)())
   : expired(false),
     handler(*new Implementation::Watchdog::Handler_Function(function)) {
   if (csecs == 0)
     throw std::invalid_argument("Watchdog constructor called with a"
-				" non-positive number of centiseconds");
+                                " non-positive number of centiseconds");
   in_critical_section = true;
   pending_position = new_watchdog_event(csecs, handler, expired);
   in_critical_section = false;
@@ -107059,7 +107118,7 @@ Watchdog::reschedule() {
 
 template <typename Flag_Base, typename Flag>
 Watchdog::Watchdog(long /* csecs */,
-		   const Flag_Base* volatile& /* holder */,
+                   const Flag_Base* volatile& /* holder */,
                    Flag& /* flag */) {
   throw std::logic_error("PPL::Watchdog::Watchdog objects not supported:"
                          " system does not provide setitimer()");
@@ -107079,15 +107138,15 @@ Watchdog::~Watchdog() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Watchdog.defs.hh line 146. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Watchdog_defs.hh line 146. */
 
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.defs.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_defs.hh line 1. */
 /* Threshold_Watcher and associated classes' declaration and inline functions.
 */
 
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.types.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_types.hh line 1. */
 
 
 namespace Parma_Polyhedra_Library {
@@ -107097,7 +107156,7 @@ class Threshold_Watcher;
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.defs.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_defs.hh line 30. */
 #include <cassert>
 
 /*! \brief
@@ -107126,7 +107185,7 @@ private:
 
   bool expired;
   const TW_Handler& handler;
-  typename TW_Pending_List::Iterator pending_position;
+  typename TW_Pending_List::iterator pending_position;
 
   // Just to prevent their use.
   Threshold_Watcher(const Threshold_Watcher&);
@@ -107139,14 +107198,14 @@ private:
   static Initialize init;
 
   // Handle the addition of a new threshold.
-  static typename TW_Pending_List::Iterator
+  static typename TW_Pending_List::iterator
   add_threshold(typename Traits::Threshold threshold,
-		const TW_Handler& handler,
-		bool& expired_flag);
+                const TW_Handler& handler,
+                bool& expired_flag);
 
   // Handle the removal of a threshold.
-  static typename TW_Pending_List::Iterator
-  remove_threshold(typename TW_Pending_List::Iterator position);
+  static typename TW_Pending_List::iterator
+  remove_threshold(typename TW_Pending_List::iterator position);
 
   //! Check threshold reaching.
   static void check();
@@ -107160,14 +107219,14 @@ typename
 Parma_Polyhedra_Library::Threshold_Watcher<Traits>::Initialize
 Parma_Polyhedra_Library::Threshold_Watcher<Traits>::init;
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.inlines.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_inlines.hh line 1. */
 /* Threshold_Watcher and associated classes' implementation: inline functions.
 */
 
 
 #include <stdexcept>
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.inlines.hh line 30. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_inlines.hh line 30. */
 
 namespace Parma_Polyhedra_Library {
 
@@ -107185,7 +107244,7 @@ Threshold_Watcher<Traits>
   Traits::from_delta(threshold, delta);
   if (!Traits::less_than(Traits::get(), threshold))
     throw std::invalid_argument("Threshold_Watcher constructor called with a"
-				" threshold already reached");
+                                " threshold already reached");
   pending_position = add_threshold(threshold, handler, expired);
 }
 
@@ -107198,13 +107257,13 @@ Threshold_Watcher<Traits>::Threshold_Watcher(const typename Traits::Delta& delta
   Traits::from_delta(threshold, delta);
   if (!Traits::less_than(Traits::get(), threshold))
     throw std::invalid_argument("Threshold_Watcher constructor called with a"
-				" threshold already reached");
+                                " threshold already reached");
   pending_position = add_threshold(threshold, handler, expired);
 }
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.templates.hh line 1. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_templates.hh line 1. */
 /* Threshold_Watcher and associated classes'.
 */
 
@@ -107212,7 +107271,7 @@ Threshold_Watcher<Traits>::Threshold_Watcher(const typename Traits::Delta& delta
 namespace Parma_Polyhedra_Library {
 
 template <typename Traits>
-typename Threshold_Watcher<Traits>::TW_Pending_List::Iterator
+typename Threshold_Watcher<Traits>::TW_Pending_List::iterator
 Threshold_Watcher<Traits>::add_threshold(typename Traits::Threshold threshold,
                                          const TW_Handler& handler,
                                          bool& expired_flag) {
@@ -107221,10 +107280,10 @@ Threshold_Watcher<Traits>::add_threshold(typename Traits::Threshold threshold,
 }
 
 template <typename Traits>
-typename Threshold_Watcher<Traits>::TW_Pending_List::Iterator
+typename Threshold_Watcher<Traits>::TW_Pending_List::iterator
 Threshold_Watcher<Traits>
-::remove_threshold(typename TW_Pending_List::Iterator position) {
-  typename TW_Pending_List::Iterator i = init.pending.erase(position);
+::remove_threshold(typename TW_Pending_List::iterator position) {
+  typename TW_Pending_List::iterator i = init.pending.erase(position);
   if (init.pending.empty())
     Traits::check_function = 0;
   return i;
@@ -107240,7 +107299,7 @@ Threshold_Watcher<Traits>::~Threshold_Watcher() {
 template <typename Traits>
 void
 Threshold_Watcher<Traits>::check() {
-  typename TW_Pending_List::Iterator i = init.pending.begin();
+  typename TW_Pending_List::iterator i = init.pending.begin();
   assert(i != init.pending.end());
   const typename Traits::Threshold& current = Traits::get();
   while (!Traits::less_than(current, i->deadline())) {
@@ -107254,7 +107313,7 @@ Threshold_Watcher<Traits>::check() {
 
 } // namespace Parma_Polyhedra_Library
 
-/* Automatically generated from PPL source file ../src/Threshold_Watcher.defs.hh line 94. */
+/* Automatically generated from PPL source file ../../ppl/ppl/src/Threshold_Watcher_defs.hh line 94. */
 
 
 
diff --git a/src/ppl_header.hh b/src/ppl_header.hh
index d661ea8..ca25513 100644
--- a/src/ppl_header.hh
+++ b/src/ppl_header.hh
@@ -1,6 +1,6 @@
 /* This is the header file of the Parma Polyhedra Library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/stdiobuf.cc b/src/stdiobuf.cc
index a10a7ed..318c07b 100644
--- a/src/stdiobuf.cc
+++ b/src/stdiobuf.cc
@@ -1,6 +1,6 @@
 /* stdiobuf class implementation (non-inline functions).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "stdiobuf.defs.hh"
-#include "globals.defs.hh"
+#include "stdiobuf_defs.hh"
+#include "globals_defs.hh"
 #include "assert.hh"
 #include <cstddef>
 
@@ -37,14 +37,14 @@ stdiobuf::uflow() {
 
 stdiobuf::int_type
 stdiobuf::underflow() {
-  int_type c = getc(fp);
+  const int_type c = getc(fp);
   return ungetc(c, fp);
 }
 
 std::streamsize
 stdiobuf::xsgetn(char_type* s, std::streamsize n) {
   PPL_ASSERT(n >= 0);
-  size_t r = fread(s, 1, static_cast<size_t>(n), fp);
+  const size_t r = fread(s, 1, static_cast<size_t>(n), fp);
   if (r > 0)
     unget_char_buf = traits_type::to_int_type(s[r - 1]);
   else
@@ -55,7 +55,7 @@ stdiobuf::xsgetn(char_type* s, std::streamsize n) {
 stdiobuf::int_type
 stdiobuf::pbackfail(int_type c) {
   const int_type eof = traits_type::eof();
-  int_type u = traits_type::eq_int_type(c, eof) ? unget_char_buf : c;
+  const int_type u = traits_type::eq_int_type(c, eof) ? unget_char_buf : c;
   unget_char_buf = eof;
   return traits_type::eq_int_type(u, eof) ? eof : ungetc(u, fp);
 }
@@ -63,7 +63,7 @@ stdiobuf::pbackfail(int_type c) {
 std::streamsize
 stdiobuf::xsputn(const char_type* s, std::streamsize n) {
   PPL_ASSERT(n >= 0);
-  size_t r = fwrite(s, 1, static_cast<size_t>(n), fp);
+  const size_t r = fwrite(s, 1, static_cast<size_t>(n), fp);
   return static_cast<std::streamsize>(r);
 }
 
diff --git a/src/stdiobuf.defs.hh b/src/stdiobuf.defs.hh
deleted file mode 100644
index 235f5e5..0000000
--- a/src/stdiobuf.defs.hh
+++ /dev/null
@@ -1,111 +0,0 @@
-/* stdiobuf class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_stdiobuf_defs_hh
-#define PPL_stdiobuf_defs_hh 1
-
-#include "stdiobuf.types.hh"
-#include <cstdio>
-#include <streambuf>
-
-class Parma_Polyhedra_Library::stdiobuf
-  : public std::basic_streambuf<char, std::char_traits<char> > {
-public:
-  //! Constructor.
-  stdiobuf(FILE* file);
-
-protected:
-  /*! \brief
-    Gets a character in case of underflow.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
-  */
-  virtual int_type underflow();
-
-  /*! \brief
-    In case of underflow, gets a character and advances the next pointer.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
-  */
-  virtual int_type uflow();
-
-  /*! \brief
-    Gets a sequence of characters.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
-  */
-  virtual std::streamsize xsgetn(char_type* s, std::streamsize n);
-
-  /*! \brief
-    Puts character back in case of backup underflow.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.4.
-  */
-  virtual int_type pbackfail(int_type c = traits_type::eof());
-
-  /*! \brief
-    Writes a sequence of characters.
-
-    \remarks
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
-  */
-  virtual std::streamsize xsputn(const char_type* s, std::streamsize n);
-
-  /*! \brief
-    Writes a character in case of overflow.
-
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
-  */
-  virtual int_type overflow(int_type c);
-
-  /*! \brief
-    Synchronizes the stream buffer.
-
-    Specified by ISO/IEC 14882:1998: 27.5.2.4.2.
-  */
-  virtual int sync();
-
-private:
-  //! Character type of the streambuf.
-  typedef char char_type;
-
-  //! Traits type of the streambuf.
-  typedef std::char_traits<char_type> traits_type;
-
-  //! Integer type of the streambuf.
-  typedef traits_type::int_type int_type;
-
-  //! The encapsulated stdio file.
-  FILE* fp;
-
-  //! Buffer for the last character read.
-  int_type unget_char_buf;
-};
-
-#include "stdiobuf.inlines.hh"
-
-#endif // !defined(PPL_stdiobuf_defs_hh)
diff --git a/src/stdiobuf.inlines.hh b/src/stdiobuf.inlines.hh
deleted file mode 100644
index 44c85b9..0000000
--- a/src/stdiobuf.inlines.hh
+++ /dev/null
@@ -1,36 +0,0 @@
-/* stdiobuf class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_stdiobuf_inlines_hh
-#define PPL_stdiobuf_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-stdiobuf::stdiobuf(FILE* file)
-  : fp(file), unget_char_buf(traits_type::eof()) {
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_stdiobuf_inlines_hh)
diff --git a/src/stdiobuf.types.hh b/src/stdiobuf.types.hh
deleted file mode 100644
index 9da3559..0000000
--- a/src/stdiobuf.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_stdiobuf_types_hh
-#define PPL_stdiobuf_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class stdiobuf;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_stdiobuf_types_hh)
diff --git a/src/stdiobuf_defs.hh b/src/stdiobuf_defs.hh
new file mode 100644
index 0000000..103e480
--- /dev/null
+++ b/src/stdiobuf_defs.hh
@@ -0,0 +1,111 @@
+/* stdiobuf class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_stdiobuf_defs_hh
+#define PPL_stdiobuf_defs_hh 1
+
+#include "stdiobuf_types.hh"
+#include <cstdio>
+#include <streambuf>
+
+class Parma_Polyhedra_Library::stdiobuf
+  : public std::basic_streambuf<char, std::char_traits<char> > {
+public:
+  //! Constructor.
+  stdiobuf(FILE* file);
+
+protected:
+  /*! \brief
+    Gets a character in case of underflow.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
+  */
+  virtual int_type underflow();
+
+  /*! \brief
+    In case of underflow, gets a character and advances the next pointer.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
+  */
+  virtual int_type uflow();
+
+  /*! \brief
+    Gets a sequence of characters.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.3.
+  */
+  virtual std::streamsize xsgetn(char_type* s, std::streamsize n);
+
+  /*! \brief
+    Puts character back in case of backup underflow.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.4.
+  */
+  virtual int_type pbackfail(int_type c = traits_type::eof());
+
+  /*! \brief
+    Writes a sequence of characters.
+
+    \remarks
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
+  */
+  virtual std::streamsize xsputn(const char_type* s, std::streamsize n);
+
+  /*! \brief
+    Writes a character in case of overflow.
+
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.5.
+  */
+  virtual int_type overflow(int_type c);
+
+  /*! \brief
+    Synchronizes the stream buffer.
+
+    Specified by ISO/IEC 14882:1998: 27.5.2.4.2.
+  */
+  virtual int sync();
+
+private:
+  //! Character type of the streambuf.
+  typedef char char_type;
+
+  //! Traits type of the streambuf.
+  typedef std::char_traits<char_type> traits_type;
+
+  //! Integer type of the streambuf.
+  typedef traits_type::int_type int_type;
+
+  //! The encapsulated stdio file.
+  FILE* fp;
+
+  //! Buffer for the last character read.
+  int_type unget_char_buf;
+};
+
+#include "stdiobuf_inlines.hh"
+
+#endif // !defined(PPL_stdiobuf_defs_hh)
diff --git a/src/stdiobuf_inlines.hh b/src/stdiobuf_inlines.hh
new file mode 100644
index 0000000..53b8c44
--- /dev/null
+++ b/src/stdiobuf_inlines.hh
@@ -0,0 +1,36 @@
+/* stdiobuf class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_stdiobuf_inlines_hh
+#define PPL_stdiobuf_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+stdiobuf::stdiobuf(FILE* file)
+  : fp(file), unget_char_buf(traits_type::eof()) {
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_stdiobuf_inlines_hh)
diff --git a/src/stdiobuf_types.hh b/src/stdiobuf_types.hh
new file mode 100644
index 0000000..f028d2a
--- /dev/null
+++ b/src/stdiobuf_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_stdiobuf_types_hh
+#define PPL_stdiobuf_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class stdiobuf;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_stdiobuf_types_hh)
diff --git a/src/swapping_sort.templates.hh b/src/swapping_sort.templates.hh
deleted file mode 100644
index 39dcdd3..0000000
--- a/src/swapping_sort.templates.hh
+++ /dev/null
@@ -1,179 +0,0 @@
-/* Sorting objects for which copies cost more than swaps.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_swapping_sort_templates_hh
-#define PPL_swapping_sort_templates_hh 1
-
-#include <vector>
-#include <algorithm>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-template <typename RA_Container, typename Compare>
-struct Indirect_Sort_Compare {
-  typedef typename RA_Container::size_type size_type;
-
-  Indirect_Sort_Compare(const RA_Container& cont,
-                        size_type base = 0,
-                        Compare comp = Compare())
-    : container(cont), base_index(base), compare(comp) {
-  }
-
-  bool operator()(size_type i, size_type j) const {
-    return compare(container[base_index + i], container[base_index + j]);
-  }
-
-  const RA_Container& container;
-  const size_type base_index;
-  const Compare compare;
-}; // struct Indirect_Sort_Compare
-
-template <typename RA_Container>
-struct Indirect_Unique_Compare {
-  typedef typename RA_Container::size_type size_type;
-
-  Indirect_Unique_Compare(const RA_Container& cont, size_type base = 0)
-    : container(cont), base_index(base) {
-  }
-
-  bool operator()(size_type i, size_type j) const {
-    return container[base_index + i] == container[base_index + j];
-  }
-
-  const RA_Container& container;
-  const size_type base_index;
-}; // struct Indirect_Unique_Compare
-
-template <typename RA_Container>
-struct Indirect_Swapper {
-  typedef typename RA_Container::size_type size_type;
-
-  Indirect_Swapper(RA_Container& cont, size_type base = 0)
-    : container(cont), base_index(base) {
-  }
-
-  void operator()(size_type i, size_type j) const {
-    using std::swap;
-    swap(container[base_index + i], container[base_index + j]);
-  }
-
-  RA_Container& container;
-  const size_type base_index;
-}; // struct Indirect_Swapper
-
-template <typename RA_Container1, typename RA_Container2>
-struct Indirect_Swapper2 {
-  typedef typename RA_Container1::size_type size_type;
-
-  Indirect_Swapper2(RA_Container1& cont1, RA_Container2& cont2)
-    : container1(cont1), container2(cont2) {
-  }
-
-  void operator()(size_type i, size_type j) const {
-    using std::swap;
-    swap(container1[i], container1[j]);
-    swap(container2[i], container2[j]);
-  }
-
-  RA_Container1& container1;
-  RA_Container2& container2;
-}; // struct Indirect_Swapper2
-
-template <typename Sort_Comparer, typename Unique_Comparer, typename Swapper>
-typename Sort_Comparer::size_type
-indirect_sort_and_unique(typename Sort_Comparer::size_type num_elems,
-                         Sort_Comparer sort_cmp,
-                         Unique_Comparer unique_cmp,
-                         Swapper indirect_swap) {
-  typedef typename Sort_Comparer::size_type index_type;
-  // `iv' is a vector of indices for the portion of rows to be sorted.
-  PPL_ASSERT(num_elems >= 2);
-  std::vector<index_type> iv;
-  iv.reserve(num_elems);
-  for (index_type i = 0, i_end = num_elems; i != i_end; ++i)
-    iv.push_back(i);
-
-  typedef typename std::vector<index_type>::iterator Iter;
-  const Iter iv_begin = iv.begin();
-  Iter iv_end = iv.end();
-
-  // Sort `iv' by comparing the rows indexed by its elements.
-  std::sort(iv_begin, iv_end, sort_cmp);
-
-  // Swap the indexed rows according to `iv':
-  // for each index `i', the element that should be placed in
-  // position dst = i is the one placed in position src = iv[i].
-  for (index_type i = num_elems; i-- > 0; ) {
-    if (i != iv[i]) {
-      index_type dst = i;
-      index_type src = iv[i];
-      do {
-        indirect_swap(src, dst);
-        iv[dst] = dst;
-        dst = src;
-        src = iv[dst];
-      } while (i != src);
-      iv[dst] = dst;
-    }
-  }
-
-  // Restore `iv' indices to 0 .. num_elems-1 for the call to unique.
-  for (index_type i = num_elems; i-- > 0; )
-    iv[i] = i;
-
-  // Unique `iv' by comparing the rows indexed by its elements.
-  iv_end = std::unique(iv_begin, iv_end, unique_cmp);
-
-  const index_type num_sorted = static_cast<index_type>(iv_end - iv_begin);
-  const index_type num_duplicates = num_elems - num_sorted;
-  if (num_duplicates == 0)
-    return 0;
-
-  // There were duplicates: swap the rows according to `iv'.
-  index_type dst = 0;
-  while (dst < num_sorted && dst == iv[dst])
-    ++dst;
-  if (dst == num_sorted)
-    return num_duplicates;
-  do {
-    const index_type src = iv[dst];
-    indirect_swap(src, dst);
-    ++dst;
-  }
-  while (dst < num_sorted);
-  return num_duplicates;
-}
-
-template <typename Iter>
-Iter
-swapping_unique(Iter first, Iter last) {
-  return swapping_unique(first, last, std::iter_swap<Iter, Iter>);
-}
-
-} // namespace Implementation
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_swapping_sort_templates_hh)
diff --git a/src/swapping_sort_templates.hh b/src/swapping_sort_templates.hh
new file mode 100644
index 0000000..6535621
--- /dev/null
+++ b/src/swapping_sort_templates.hh
@@ -0,0 +1,179 @@
+/* Sorting objects for which copies cost more than swaps.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_swapping_sort_templates_hh
+#define PPL_swapping_sort_templates_hh 1
+
+#include <vector>
+#include <algorithm>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+template <typename RA_Container, typename Compare>
+struct Indirect_Sort_Compare {
+  typedef typename RA_Container::size_type size_type;
+
+  Indirect_Sort_Compare(const RA_Container& cont,
+                        size_type base = 0,
+                        Compare comp = Compare())
+    : container(cont), base_index(base), compare(comp) {
+  }
+
+  bool operator()(size_type i, size_type j) const {
+    return compare(container[base_index + i], container[base_index + j]);
+  }
+
+  const RA_Container& container;
+  const size_type base_index;
+  const Compare compare;
+}; // struct Indirect_Sort_Compare
+
+template <typename RA_Container>
+struct Indirect_Unique_Compare {
+  typedef typename RA_Container::size_type size_type;
+
+  Indirect_Unique_Compare(const RA_Container& cont, size_type base = 0)
+    : container(cont), base_index(base) {
+  }
+
+  bool operator()(size_type i, size_type j) const {
+    return container[base_index + i] == container[base_index + j];
+  }
+
+  const RA_Container& container;
+  const size_type base_index;
+}; // struct Indirect_Unique_Compare
+
+template <typename RA_Container>
+struct Indirect_Swapper {
+  typedef typename RA_Container::size_type size_type;
+
+  Indirect_Swapper(RA_Container& cont, size_type base = 0)
+    : container(cont), base_index(base) {
+  }
+
+  void operator()(size_type i, size_type j) const {
+    using std::swap;
+    swap(container[base_index + i], container[base_index + j]);
+  }
+
+  RA_Container& container;
+  const size_type base_index;
+}; // struct Indirect_Swapper
+
+template <typename RA_Container1, typename RA_Container2>
+struct Indirect_Swapper2 {
+  typedef typename RA_Container1::size_type size_type;
+
+  Indirect_Swapper2(RA_Container1& cont1, RA_Container2& cont2)
+    : container1(cont1), container2(cont2) {
+  }
+
+  void operator()(size_type i, size_type j) const {
+    using std::swap;
+    swap(container1[i], container1[j]);
+    swap(container2[i], container2[j]);
+  }
+
+  RA_Container1& container1;
+  RA_Container2& container2;
+}; // struct Indirect_Swapper2
+
+template <typename Sort_Comparer, typename Unique_Comparer, typename Swapper>
+typename Sort_Comparer::size_type
+indirect_sort_and_unique(typename Sort_Comparer::size_type num_elems,
+                         Sort_Comparer sort_cmp,
+                         Unique_Comparer unique_cmp,
+                         Swapper indirect_swap) {
+  typedef typename Sort_Comparer::size_type index_type;
+  // `iv' is a vector of indices for the portion of rows to be sorted.
+  PPL_ASSERT(num_elems >= 2);
+  std::vector<index_type> iv;
+  iv.reserve(num_elems);
+  for (index_type i = 0, i_end = num_elems; i != i_end; ++i)
+    iv.push_back(i);
+
+  typedef typename std::vector<index_type>::iterator Iter;
+  const Iter iv_begin = iv.begin();
+  Iter iv_end = iv.end();
+
+  // Sort `iv' by comparing the rows indexed by its elements.
+  std::sort(iv_begin, iv_end, sort_cmp);
+
+  // Swap the indexed rows according to `iv':
+  // for each index `i', the element that should be placed in
+  // position dst = i is the one placed in position src = iv[i].
+  for (index_type i = num_elems; i-- > 0; ) {
+    if (i != iv[i]) {
+      index_type dst = i;
+      index_type src = iv[i];
+      do {
+        indirect_swap(src, dst);
+        iv[dst] = dst;
+        dst = src;
+        src = iv[dst];
+      } while (i != src);
+      iv[dst] = dst;
+    }
+  }
+
+  // Restore `iv' indices to 0 .. num_elems-1 for the call to unique.
+  for (index_type i = num_elems; i-- > 0; )
+    iv[i] = i;
+
+  // Unique `iv' by comparing the rows indexed by its elements.
+  iv_end = std::unique(iv_begin, iv_end, unique_cmp);
+
+  const index_type num_sorted = static_cast<index_type>(iv_end - iv_begin);
+  const index_type num_duplicates = num_elems - num_sorted;
+  if (num_duplicates == 0)
+    return 0;
+
+  // There were duplicates: swap the rows according to `iv'.
+  index_type dst = 0;
+  while (dst < num_sorted && dst == iv[dst])
+    ++dst;
+  if (dst == num_sorted)
+    return num_duplicates;
+  do {
+    const index_type src = iv[dst];
+    indirect_swap(src, dst);
+    ++dst;
+  }
+  while (dst < num_sorted);
+  return num_duplicates;
+}
+
+template <typename Iter>
+Iter
+swapping_unique(Iter first, Iter last) {
+  return swapping_unique(first, last, std::iter_swap<Iter, Iter>);
+}
+
+} // namespace Implementation
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_swapping_sort_templates_hh)
diff --git a/src/termination.cc b/src/termination.cc
index ddee538..18e7abd 100644
--- a/src/termination.cc
+++ b/src/termination.cc
@@ -1,6 +1,6 @@
 /* Utilities for termination analysis: non-inline, non-template functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,8 +22,8 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl-config.h"
-#include "termination.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
+#include "termination_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -33,7 +33,7 @@ namespace Termination {
 
 void
 assign_all_inequalities_approximation(const Constraint_System& cs_in,
-				      Constraint_System& cs_out) {
+                                      Constraint_System& cs_out) {
   if (cs_in.has_strict_inequalities() || cs_in.has_equalities()) {
     // Here we have some strict inequality and/or equality constraints:
     // translate them into non-strict inequality constraints.
@@ -42,12 +42,15 @@ assign_all_inequalities_approximation(const Constraint_System& cs_in,
       const Constraint& c = *i;
       if (c.is_equality()) {
         // Insert the two corresponding opposing inequalities.
-        cs_out.insert(Linear_Expression(c) >= 0);
-        cs_out.insert(Linear_Expression(c) <= 0);
+        const Linear_Expression expr(c.expression());
+        cs_out.insert(expr >= 0);
+        cs_out.insert(expr <= 0);
       }
-      else if (c.is_strict_inequality())
+      else if (c.is_strict_inequality()) {
         // Insert the non-strict approximation.
-        cs_out.insert(Linear_Expression(c) >= 0);
+        const Linear_Expression expr(c.expression());
+        cs_out.insert(expr >= 0);
+      }
       else
         // Insert as is.
         cs_out.insert(c);
@@ -61,21 +64,22 @@ assign_all_inequalities_approximation(const Constraint_System& cs_in,
 template <>
 void
 assign_all_inequalities_approximation(const C_Polyhedron& ph,
-				      Constraint_System& cs) {
+                                      Constraint_System& cs) {
   const Constraint_System& ph_cs = ph.minimized_constraints();
   if (ph_cs.has_equalities()) {
     // Translate equalities into inequalities.
     for (Constraint_System::const_iterator i = ph_cs.begin(),
-	   i_end = ph_cs.end(); i != i_end; ++i) {
+           i_end = ph_cs.end(); i != i_end; ++i) {
       const Constraint& c = *i;
       if (c.is_equality()) {
-	// Insert the two corresponding opposing inequalities.
-	cs.insert(Linear_Expression(c) >= 0);
-	cs.insert(Linear_Expression(c) <= 0);
+        // Insert the two corresponding opposing inequalities.
+        const Linear_Expression expr(c.expression());
+        cs.insert(expr >= 0);
+        cs.insert(expr <= 0);
       }
       else
-	// Insert as is.
-	cs.insert(c);
+        // Insert as is.
+        cs.insert(c);
     }
   }
   else
@@ -124,8 +128,8 @@ assign_all_inequalities_approximation(const C_Polyhedron& ph,
 */
 void
 fill_constraint_systems_MS(const Constraint_System& cs,
-			   Constraint_System& cs_out1,
-			   Constraint_System& cs_out2) {
+                           Constraint_System& cs_out1,
+                           Constraint_System& cs_out2) {
   PPL_ASSERT(cs.space_dimension() % 2 == 0);
   const dimension_type n = cs.space_dimension() / 2;
   const dimension_type m = num_constraints(cs);
@@ -144,8 +148,8 @@ fill_constraint_systems_MS(const Constraint_System& cs,
   std::cout << cs << std::endl;
 #endif
 
-  dimension_type y_begin = n+1;
-  dimension_type z_begin = y_begin + ((&cs_out1 == &cs_out2) ? m : 0);
+  const dimension_type y_begin = n+1;
+  const dimension_type z_begin = y_begin + ((&cs_out1 == &cs_out2) ? m : 0);
 
   // Make sure linear expressions have the correct space dimension.
   Linear_Expression y_le;
@@ -158,9 +162,9 @@ fill_constraint_systems_MS(const Constraint_System& cs,
   dimension_type y = y_begin;
   dimension_type z = z_begin;
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i) {
-    Variable v_y(y);
-    Variable v_z(z);
+         cs_end = cs.end(); i != cs_end; ++i) {
+    const Variable v_y(y);
+    const Variable v_z(z);
     ++y;
     ++z;
     cs_out1.insert(v_y >= 0);
@@ -173,7 +177,7 @@ fill_constraint_systems_MS(const Constraint_System& cs,
       sub_mul_assign(y_le, b_i, v_y);
       sub_mul_assign(z_le, b_i, v_z);
     }
-    for (Constraint::Expression::const_iterator j = c_i.expression().begin(),
+    for (Constraint::expr_type::const_iterator j = c_i.expression().begin(),
           j_end = c_i.expression().end(); j != j_end; ++j) {
       Coefficient_traits::const_reference a_i_j = *j;
       const Variable v = j.variable();
@@ -338,9 +342,9 @@ fill_constraint_systems_MS(const Constraint_System& cs,
 */
 void
 fill_constraint_system_PR(const Constraint_System& cs_before,
-			  const Constraint_System& cs_after,
-			  Constraint_System& cs_out,
-			  Linear_Expression& le_out) {
+                          const Constraint_System& cs_after,
+                          Constraint_System& cs_out,
+                          Linear_Expression& le_out) {
   PPL_ASSERT(cs_after.space_dimension() % 2 == 0);
   PPL_ASSERT(2*cs_before.space_dimension() == cs_after.space_dimension());
   const dimension_type n = cs_before.space_dimension();
@@ -355,13 +359,13 @@ fill_constraint_system_PR(const Constraint_System& cs_before,
 
   dimension_type row_index = 0;
   for (Constraint_System::const_iterator i = cs_before.begin(),
-	 cs_before_end = cs_before.end();
+         cs_before_end = cs_before.end();
        i != cs_before_end;
        ++i, ++row_index) {
-    Variable u1_i(m + row_index);
-    Variable u2_i(s + row_index);
-    const Constraint::Expression& e_i = i->expression();
-    for (Constraint::Expression::const_iterator
+    const Variable u1_i(m + row_index);
+    const Variable u2_i(s + row_index);
+    const Constraint::expr_type e_i = i->expression();
+    for (Constraint::expr_type::const_iterator
            j = e_i.begin(), j_end = e_i.end(); j != j_end; ++j) {
       Coefficient_traits::const_reference A_ij_B = *j;
       const Variable v = j.variable();
@@ -379,26 +383,26 @@ fill_constraint_system_PR(const Constraint_System& cs_before,
 
   row_index = 0;
   for (Constraint_System::const_iterator i = cs_after.begin(),
-	 cs_after_end = cs_after.end();
+         cs_after_end = cs_after.end();
        i != cs_after_end;
        ++i, ++row_index) {
-    Variable u3_i(row_index);
-    const Constraint::Expression& e_i = i->expression();
-    for (Constraint::Expression::const_iterator
-           i = e_i.lower_bound(Variable(n)),
-           i_end = e_i.end(); i != i_end; ++i) {
-      Coefficient_traits::const_reference A_ij_C = *i;
-      const Variable v = i.variable();
+    const Variable u3_i(row_index);
+    const Constraint::expr_type e_i = i->expression();
+    for (Constraint::expr_type::const_iterator
+           j = e_i.lower_bound(Variable(n)),
+           j_end = e_i.end(); j != j_end; ++j) {
+      Coefficient_traits::const_reference A_ij_C = *j;
+      const Variable v = j.variable();
       // - u3 A_C, in the context of the j-th constraint.
       sub_mul_assign(les_eq[v.id() - n], A_ij_C, u3_i);
       // u3 A_C, in the context of the (j+n)-th constraint.
       add_mul_assign(les_eq[v.id()], A_ij_C, u3_i);
     }
-    for (Constraint::Expression::const_iterator i = e_i.begin(),
-           i_end = e_i.lower_bound(Variable(n)); i != i_end; ++i) {
-      Coefficient_traits::const_reference Ap_ij_C = *i;
+    for (Constraint::expr_type::const_iterator j = e_i.begin(),
+           j_end = e_i.lower_bound(Variable(n)); j != j_end; ++j) {
+      Coefficient_traits::const_reference Ap_ij_C = *j;
       // u3 Ap_C, in the context of the (j+n)-th constraint.
-      add_mul_assign(les_eq[i.variable().id() + n], Ap_ij_C, u3_i);
+      add_mul_assign(les_eq[j.variable().id() + n], Ap_ij_C, u3_i);
     }
     Coefficient_traits::const_reference b_C = e_i.inhomogeneous_term();
     if (b_C != 0)
@@ -429,24 +433,24 @@ fill_constraint_system_PR_original(const Constraint_System& cs,
 
   dimension_type row_index = 0;
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i, ++row_index) {
-    const Constraint::Expression& e_i = i->expression();
+         cs_end = cs.end(); i != cs_end; ++i, ++row_index) {
+    const Constraint::expr_type e_i = i->expression();
     const Variable lambda1_i(row_index);
     const Variable lambda2_i(m + row_index);
-    for (Constraint::Expression::const_iterator i = e_i.begin(),
-          i_end = e_i.lower_bound(Variable(n)); i != i_end; ++i) {
-      Coefficient_traits::const_reference Ap_ij = *i;
-      const Variable v = i.variable();
+    for (Constraint::expr_type::const_iterator j = e_i.begin(),
+          j_end = e_i.lower_bound(Variable(n)); j != j_end; ++j) {
+      Coefficient_traits::const_reference Ap_ij = *j;
+      const Variable v = j.variable();
       // lambda_1 A'
       add_mul_assign(les_eq[v.id()], Ap_ij, lambda1_i);
       // lambda_2 A'
       add_mul_assign(les_eq[v.id()+n+n], Ap_ij, lambda2_i);
     }
-    for (Constraint::Expression::const_iterator
-           i = e_i.lower_bound(Variable(n)),
-           i_end = e_i.end(); i != i_end; ++i) {
-      Coefficient_traits::const_reference A_ij = *i;
-      const Variable v = i.variable();
+    for (Constraint::expr_type::const_iterator
+           j = e_i.lower_bound(Variable(n)),
+           j_end = e_i.end(); j != j_end; ++j) {
+      Coefficient_traits::const_reference A_ij = *j;
+      const Variable v = j.variable();
       // (lambda_1 - lambda_2) A
       add_mul_assign(les_eq[v.id()], A_ij, lambda1_i);
       sub_mul_assign(les_eq[v.id()], A_ij, lambda2_i);
@@ -472,7 +476,7 @@ termination_test_MS(const Constraint_System& cs) {
   Constraint_System cs_mip;
   fill_constraint_systems_MS(cs, cs_mip, cs_mip);
 
-  MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip);
+  const MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip);
   return mip.is_satisfiable();
 }
 
@@ -481,21 +485,21 @@ one_affine_ranking_function_MS(const Constraint_System& cs, Generator& mu) {
   Constraint_System cs_mip;
   fill_constraint_systems_MS(cs, cs_mip, cs_mip);
 
-  MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip);
+  const MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip);
   if (!mip.is_satisfiable())
     return false;
 
-  Generator fp = mip.feasible_point();
+  const Generator fp = mip.feasible_point();
   PPL_ASSERT(fp.is_point());
   const dimension_type n = cs.space_dimension() / 2;
-  Linear_Expression le(fp.expression(), n + 1);
+  const Linear_Expression le(fp.expression(), n + 1);
   mu = point(le, fp.divisor());
   return true;
 }
 
 void
 all_affine_ranking_functions_MS(const Constraint_System& cs,
-				C_Polyhedron& mu_space) {
+                                C_Polyhedron& mu_space) {
   Constraint_System cs_out1;
   Constraint_System cs_out2;
   fill_constraint_systems_MS(cs, cs_out1, cs_out2);
@@ -586,13 +590,13 @@ termination_test_PR_original(const Constraint_System& cs) {
   // Turn minimization problem into satisfiability.
   cs_mip.insert(le_ineq <= -1);
 
-  MIP_Problem mip(cs_mip.space_dimension(), cs_mip);
+  const MIP_Problem mip(cs_mip.space_dimension(), cs_mip);
   return mip.is_satisfiable();
 }
 
 bool
 termination_test_PR(const Constraint_System& cs_before,
-		    const Constraint_System& cs_after) {
+                    const Constraint_System& cs_after) {
   Constraint_System cs_mip;
   Linear_Expression le_ineq;
   fill_constraint_system_PR(cs_before, cs_after, cs_mip, le_ineq);
@@ -617,14 +621,14 @@ termination_test_PR(const Constraint_System& cs_before,
   // Turn minimization problem into satisfiability.
   cs_mip.insert(le_ineq <= -1);
 
-  MIP_Problem mip(cs_mip.space_dimension(), cs_mip);
+  const MIP_Problem mip(cs_mip.space_dimension(), cs_mip);
   return mip.is_satisfiable();
 }
 
 bool
 one_affine_ranking_function_PR(const Constraint_System& cs_before,
-			       const Constraint_System& cs_after,
-			       Generator& mu) {
+                               const Constraint_System& cs_after,
+                               Generator& mu) {
   return Termination_Helpers
     ::one_affine_ranking_function_PR(cs_before, cs_after, mu);
 }
@@ -637,8 +641,8 @@ one_affine_ranking_function_PR_original(const Constraint_System& cs,
 
 void
 all_affine_ranking_functions_PR(const Constraint_System& cs_before,
-				const Constraint_System& cs_after,
-				NNC_Polyhedron& mu_space) {
+                                const Constraint_System& cs_after,
+                                NNC_Polyhedron& mu_space) {
   Termination_Helpers::all_affine_ranking_functions_PR(cs_before, cs_after,
                                                        mu_space);
 }
@@ -683,7 +687,7 @@ Termination_Helpers
   // Turn minimization problem into satisfiability.
   cs_mip.insert(le_ineq <= -1);
 
-  MIP_Problem mip(cs_mip.space_dimension(), cs_mip);
+  const MIP_Problem mip(cs_mip.space_dimension(), cs_mip);
   if (!mip.is_satisfiable())
     return false;
 
@@ -735,7 +739,7 @@ Termination_Helpers
   // Turn minimization problem into satisfiability.
   cs_mip.insert(le_ineq <= -1);
 
-  MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip);
+  const MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip);
   if (!mip.is_satisfiable())
     return false;
 
@@ -749,7 +753,7 @@ Termination_Helpers
   dimension_type row_index = m;
   for (Constraint_System::const_iterator i = cs.begin(),
          cs_end = cs.end(); i != cs_end; ++i, ++row_index) {
-    Variable lambda_2(row_index);
+    const Variable lambda_2(row_index);
     Coefficient_traits::const_reference fp_i = fp.coefficient(lambda_2);
     if (fp_i != 0)
       le.linear_combine(i->expr, 1, -fp_i, 1, n + 1);
@@ -871,7 +875,7 @@ Termination_Helpers
   NNC_Polyhedron ph(cs_eqs);
   ph.add_constraint(le_ineq < 0);
   // lambda_2 corresponds to space dimensions m, ..., 2*m-1.
-  Variables_Set lambda1(Variable(0), Variable(m-1));
+  const Variables_Set lambda1(Variable(0), Variable(m-1));
   ph.remove_space_dimensions(lambda1);
 
 #if PRINT_DEBUG_INFO
@@ -897,7 +901,7 @@ Termination_Helpers
       dimension_type row_index = 0;
       for (Constraint_System::const_iterator i = cs.begin(),
              cs_end = cs.end(); i != cs_end; ++i, ++row_index) {
-        Variable lambda2_i(row_index);
+        const Variable lambda2_i(row_index);
         Coefficient_traits::const_reference g_i = g.coefficient(lambda2_i);
         if (g_i != 0)
           le.linear_combine(i->expr, 1, -g_i, 1, n + 1);
diff --git a/src/termination.defs.hh b/src/termination.defs.hh
deleted file mode 100644
index f8151ee..0000000
--- a/src/termination.defs.hh
+++ /dev/null
@@ -1,502 +0,0 @@
-/* Utilities for termination analysis: declarations.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_termination_defs_hh
-#define PPL_termination_defs_hh 1
-
-#include "termination.types.hh"
-
-#include "Generator.types.hh"
-#include "C_Polyhedron.types.hh"
-#include "NNC_Polyhedron.types.hh"
-#include "Constraint_System.types.hh"
-
-namespace Parma_Polyhedra_Library {
-
-class Termination_Helpers {
-public:
-  static void
-  all_affine_ranking_functions_PR(const Constraint_System& cs_before,
-                                  const Constraint_System& cs_after,
-                                  NNC_Polyhedron& mu_space);
-  static bool
-  one_affine_ranking_function_PR(const Constraint_System& cs_before,
-                                 const Constraint_System& cs_after,
-                                 Generator& mu);
-  static bool
-  one_affine_ranking_function_PR_original(const Constraint_System& cs,
-                                          Generator& mu);
-  static void
-  all_affine_ranking_functions_PR_original(const Constraint_System& cs,
-                                           NNC_Polyhedron& mu_space);
-
-  template <typename PSET>
-  static void
-  assign_all_inequalities_approximation(const PSET& pset_before,
-                                        const PSET& pset_after,
-                                        Constraint_System& cs);
-}; // class Termination_Helpers
-
-//! \name Functions for the Synthesis of Linear Rankings
-//@{
-
-/*! \brief \ingroup PPL_CXX_interface
-  Termination test using an improvement of the method by Mesnard and
-  Serebrenik \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset
-  A pointset approximating the behavior of a loop whose termination
-  is being analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-  .
-  where unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.
-
-  \return
-  <CODE>true</CODE> if any loop approximated by \p pset definitely
-  terminates; <CODE>false</CODE> if the test is inconclusive.
-  However, if \p pset <EM>precisely</EM> characterizes the effect
-  of the loop body onto the loop-relevant program variables,
-  then <CODE>true</CODE> is returned <EM>if and only if</EM>
-  the loop terminates.
-*/
-template <typename PSET>
-bool
-termination_test_MS(const PSET& pset);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Termination test using an improvement of the method by Mesnard and
-  Serebrenik \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset_before
-  A pointset approximating the values of loop-relevant variables
-  <EM>before</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$.
-
-  \param pset_after
-  A pointset approximating the values of loop-relevant variables
-  <EM>after</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-
-  Note that unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.  Note also that unprimed variables are assigned
-  to different space dimensions in \p pset_before and \p pset_after.
-
-  \return
-  <CODE>true</CODE> if any loop approximated by \p pset definitely
-  terminates; <CODE>false</CODE> if the test is inconclusive.
-  However, if \p pset_before and \p pset_after <EM>precisely</EM>
-  characterize the effect of the loop body onto the loop-relevant
-  program variables, then <CODE>true</CODE> is returned
-  <EM>if and only if</EM> the loop terminates.
-*/
-template <typename PSET>
-bool
-termination_test_MS_2(const PSET& pset_before, const PSET& pset_after);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Termination test with witness ranking function using an improvement
-  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset
-  A pointset approximating the behavior of a loop whose termination
-  is being analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-  .
-  where unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.
-
-  \param mu
-  When <CODE>true</CODE> is returned, this is assigned a point
-  of space dimension \f$ n+1 \f$ encoding one (not further specified)
-  affine ranking function for the loop being analyzed.
-  The ranking function is of the form \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
-  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ are the coefficients
-  of \p mu corresponding to the space dimensions \f$ n, 0, \ldots, n-1 \f$,
-  respectively.
-
-  \return
-  <CODE>true</CODE> if any loop approximated by \p pset definitely
-  terminates; <CODE>false</CODE> if the test is inconclusive.
-  However, if \p pset <EM>precisely</EM> characterizes the effect
-  of the loop body onto the loop-relevant program variables,
-  then <CODE>true</CODE> is returned <EM>if and only if</EM>
-  the loop terminates.
-*/
-template <typename PSET>
-bool
-one_affine_ranking_function_MS(const PSET& pset, Generator& mu);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Termination test with witness ranking function using an improvement
-  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset_before
-  A pointset approximating the values of loop-relevant variables
-  <EM>before</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$.
-
-  \param pset_after
-  A pointset approximating the values of loop-relevant variables
-  <EM>after</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-
-  Note that unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.  Note also that unprimed variables are assigned
-  to different space dimensions in \p pset_before and \p pset_after.
-
-  \param mu
-  When <CODE>true</CODE> is returned, this is assigned a point
-  of space dimension \f$ n+1 \f$ encoding one (not further specified)
-  affine ranking function for the loop being analyzed.
-  The ranking function is of the form \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
-  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ are the coefficients
-  of \p mu corresponding to the space dimensions \f$ n, 0, \ldots, n-1 \f$,
-  respectively.
-
-  \return
-  <CODE>true</CODE> if any loop approximated by \p pset definitely
-  terminates; <CODE>false</CODE> if the test is inconclusive.
-  However, if \p pset_before and \p pset_after <EM>precisely</EM>
-  characterize the effect of the loop body onto the loop-relevant
-  program variables, then <CODE>true</CODE> is returned
-  <EM>if and only if</EM> the loop terminates.
-*/
-template <typename PSET>
-bool
-one_affine_ranking_function_MS_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Termination test with ranking function space using an improvement
-  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset
-  A pointset approximating the behavior of a loop whose termination
-  is being analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-  .
-  where unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.
-
-  \param mu_space
-  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
-  representing the space of all the affine ranking functions for the loops
-  that are precisely characterized by \p pset.
-  These ranking functions are of the form
-  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
-  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
-  \p mu_space polyhedron.
-  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
-  correspond to the space dimensions of \p mu_space
-  \f$ n, 0, \ldots, n-1 \f$, respectively.
-  When \p mu_space is empty, it means that the test is inconclusive.
-  However, if \p pset <EM>precisely</EM> characterizes the effect
-  of the loop body onto the loop-relevant program variables,
-  then \p mu_space is empty <EM>if and only if</EM>
-  the loop does <EM>not</EM> terminate.
-*/
-template <typename PSET>
-void
-all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Termination test with ranking function space using an improvement
-  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset_before
-  A pointset approximating the values of loop-relevant variables
-  <EM>before</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$.
-
-  \param pset_after
-  A pointset approximating the values of loop-relevant variables
-  <EM>after</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-
-  Note that unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.  Note also that unprimed variables are assigned
-  to different space dimensions in \p pset_before and \p pset_after.
-
-  \param mu_space
-  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
-  representing the space of all the affine ranking functions for the loops
-  that are precisely characterized by \p pset.
-  These ranking functions are of the form
-  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
-  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
-  \p mu_space polyhedron.
-  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
-  correspond to the space dimensions of \p mu_space
-  \f$ n, 0, \ldots, n-1 \f$, respectively.
-  When \p mu_space is empty, it means that the test is inconclusive.
-  However, if \p pset_before and \p pset_after <EM>precisely</EM>
-  characterize the effect of the loop body onto the loop-relevant
-  program variables, then \p mu_space is empty <EM>if and only if</EM>
-  the loop does <EM>not</EM> terminate.
-*/
-template <typename PSET>
-void
-all_affine_ranking_functions_MS_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  C_Polyhedron& mu_space);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Computes the spaces of affine \e quasi ranking functions
-  using an improvement of the method by Mesnard and Serebrenik
-  \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset
-  A pointset approximating the behavior of a loop whose termination
-  is being analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-  .
-  where unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.
-
-  \param decreasing_mu_space
-  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
-  representing the space of all the decreasing affine functions
-  for the loops that are precisely characterized by \p pset.
-
-  \param bounded_mu_space
-  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
-  representing the space of all the lower bounded affine functions
-  for the loops that are precisely characterized by \p pset.
-
-  These quasi-ranking functions are of the form
-  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
-  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
-  \p decreasing_mu_space and \p bounded_mu_space polyhedrons.
-  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
-  correspond to the space dimensions \f$ n, 0, \ldots, n-1 \f$, respectively.
-  When \p decreasing_mu_space (resp., \p bounded_mu_space) is empty,
-  it means that the test is inconclusive.
-  However, if \p pset <EM>precisely</EM> characterizes the effect
-  of the loop body onto the loop-relevant program variables,
-  then \p decreasing_mu_space (resp., \p bounded_mu_space) will be empty
-  <EM>if and only if</EM> there is no decreasing (resp., lower bounded)
-  affine function, so that the loop does not terminate.
-*/
-template <typename PSET>
-void
-all_affine_quasi_ranking_functions_MS(const PSET& pset,
-                                      C_Polyhedron& decreasing_mu_space,
-                                      C_Polyhedron& bounded_mu_space);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Computes the spaces of affine \e quasi ranking functions
-  using an improvement of the method by Mesnard and Serebrenik
-  \ref BMPZ10 "[BMPZ10]".
-
-  \tparam PSET
-  Any pointset supported by the PPL that provides the
-  <CODE>minimized_constraints()</CODE> method.
-
-  \param pset_before
-  A pointset approximating the values of loop-relevant variables
-  <EM>before</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$.
-
-  \param pset_after
-  A pointset approximating the values of loop-relevant variables
-  <EM>after</EM> the update performed in the loop body that is being
-  analyzed.  The variables indices are allocated as follows:
-  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
-    \f$ 0, \ldots, n-1 \f$,
-  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
-    \f$ n, \ldots, 2n-1 \f$,
-
-  Note that unprimed variables represent the values of the loop-relevant
-  program variables before the update performed in the loop body,
-  and primed variables represent the values of those program variables
-  after the update.  Note also that unprimed variables are assigned
-  to different space dimensions in \p pset_before and \p pset_after.
-
-  \param decreasing_mu_space
-  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
-  representing the space of all the decreasing affine functions
-  for the loops that are precisely characterized by \p pset.
-
-  \param bounded_mu_space
-  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
-  representing the space of all the lower bounded affine functions
-  for the loops that are precisely characterized by \p pset.
-
-  These ranking functions are of the form
-  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
-  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
-  \p decreasing_mu_space and \p bounded_mu_space polyhedrons.
-  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
-  correspond to the space dimensions \f$ n, 0, \ldots, n-1 \f$, respectively.
-  When \p decreasing_mu_space (resp., \p bounded_mu_space) is empty,
-  it means that the test is inconclusive.
-  However, if \p pset_before and \p pset_after <EM>precisely</EM>
-  characterize the effect of the loop body onto the loop-relevant
-  program variables, then \p decreasing_mu_space (resp., \p bounded_mu_space)
-  will be empty <EM>if and only if</EM> there is no decreasing
-  (resp., lower bounded) affine function, so that the loop does not terminate.
-*/
-template <typename PSET>
-void
-all_affine_quasi_ranking_functions_MS_2(const PSET& pset_before,
-                                        const PSET& pset_after,
-                                        C_Polyhedron& decreasing_mu_space,
-                                        C_Polyhedron& bounded_mu_space);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Like termination_test_MS() but using the method by Podelski and
-  Rybalchenko \ref BMPZ10 "[BMPZ10]".
-*/
-template <typename PSET>
-bool
-termination_test_PR(const PSET& pset);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Like termination_test_MS_2() but using an alternative formalization
-  of the method by Podelski and Rybalchenko \ref BMPZ10 "[BMPZ10]".
-*/
-template <typename PSET>
-bool
-termination_test_PR_2(const PSET& pset_before, const PSET& pset_after);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Like one_affine_ranking_function_MS() but using the method by Podelski
-  and Rybalchenko \ref BMPZ10 "[BMPZ10]".
-*/
-template <typename PSET>
-bool
-one_affine_ranking_function_PR(const PSET& pset, Generator& mu);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Like one_affine_ranking_function_MS_2() but using an alternative
-  formalization of the method by Podelski and Rybalchenko
-  \ref BMPZ10 "[BMPZ10]".
-*/
-template <typename PSET>
-bool
-one_affine_ranking_function_PR_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Like all_affine_ranking_functions_MS() but using the method by Podelski
-  and Rybalchenko \ref BMPZ10 "[BMPZ10]".
-*/
-template <typename PSET>
-void
-all_affine_ranking_functions_PR(const PSET& pset, NNC_Polyhedron& mu_space);
-
-/*! \brief \ingroup PPL_CXX_interface
-  Like all_affine_ranking_functions_MS_2() but using an alternative
-  formalization of the method by Podelski and Rybalchenko
-  \ref BMPZ10 "[BMPZ10]".
-*/
-template <typename PSET>
-void
-all_affine_ranking_functions_PR_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  NNC_Polyhedron& mu_space);
-
-//@} // Functions for the Synthesis of Linear Rankings
-
-} // namespace Parma_Polyhedra_Library
-
-#include "termination.templates.hh"
-
-#endif // !defined(PPL_termination_defs_hh)
diff --git a/src/termination.templates.hh b/src/termination.templates.hh
deleted file mode 100644
index 9038218..0000000
--- a/src/termination.templates.hh
+++ /dev/null
@@ -1,552 +0,0 @@
-/* Utilities for termination analysis: template functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_termination_templates_hh
-#define PPL_termination_templates_hh 1
-
-#include "globals.defs.hh"
-#include "Variable.defs.hh"
-#include "Generator.defs.hh"
-#include "Constraint_System.defs.hh"
-#include "C_Polyhedron.defs.hh"
-#include "NNC_Polyhedron.defs.hh"
-
-#include <stdexcept>
-
-#define PRINT_DEBUG_INFO 0
-
-#if PRINT_DEBUG_INFO
-#include <iostream>
-#endif
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-
-namespace Termination {
-
-#if PRINT_DEBUG_INFO
-static dimension_type output_function_MS_n;
-static dimension_type output_function_MS_m;
-
-/* Encodes which object are we printing:
-
-   0 means input constraint system;
-   1 means first output constraint system;
-   2 means second output constraint system;
-   3 means only output constraint system
-     (i.e., when first and second are the same);
-   4 means mu space.
-*/
-static int output_function_MS_which = -1;
-
-/*
-  Debugging output function.  See the documentation of
-  fill_constraint_systems_MS() for the allocation of variable indices.
-*/
-inline void
-output_function_MS(std::ostream& s, const Variable v) {
-  dimension_type id = v.id();
-  switch (output_function_MS_which) {
-  case 0:
-    if (id < output_function_MS_n)
-      s << "x'" << id + 1;
-    else if (id < 2*output_function_MS_n)
-      s << "x" << id - output_function_MS_n + 1;
-    else
-      s << "WHAT?";
-    break;
-  case 1:
-    if (id < output_function_MS_n)
-      s << "mu" << id + 1;
-    else if (id == output_function_MS_n)
-      s << "WHAT?";
-    else if (id <= output_function_MS_n + output_function_MS_m)
-      s << "y" << id - output_function_MS_n;
-    else
-      s << "WHAT?";
-    break;
-  case 2:
-  case 4:
-    if (id < output_function_MS_n)
-      s << "mu" << id + 1;
-    else if (id == output_function_MS_n)
-      s << "mu0";
-    else if (output_function_MS_which == 2
-	     && id <= output_function_MS_n + output_function_MS_m + 2)
-      s << "z" << id - output_function_MS_n;
-    else
-      s << "WHAT?";
-    break;
-  case 3:
-    if (id < output_function_MS_n)
-      s << "mu" << id + 1;
-    else if (id == output_function_MS_n)
-      s << "mu0";
-    else if (id <= output_function_MS_n + output_function_MS_m)
-      s << "y" << id - output_function_MS_n;
-    else if (id <= output_function_MS_n + 2*output_function_MS_m + 2)
-      s << "z" << id - (output_function_MS_n + output_function_MS_m);
-    else
-      s << "WHAT?";
-    break;
-  default:
-    abort();
-    break;
-  }
-}
-
-static dimension_type output_function_PR_s;
-static dimension_type output_function_PR_r;
-
-/*
-  Debugging output function.  See the documentation of
-  fill_constraint_system_PR() for the allocation of variable indices.
-*/
-inline void
-output_function_PR(std::ostream& s, const Variable v) {
-  dimension_type id = v.id();
-  if (id < output_function_PR_s)
-    s << "u3_" << id + 1;
-  else if (id < output_function_PR_s + output_function_PR_r)
-    s << "u2_" << id - output_function_PR_s + 1;
-  else if (id < output_function_PR_s + 2*output_function_PR_r)
-    s << "u1_" << id - (output_function_PR_s + output_function_PR_r) + 1;
-  else
-    s << "WHAT?";
-}
-#endif
-
-void
-assign_all_inequalities_approximation(const Constraint_System& cs_in,
-				      Constraint_System& cs_out);
-
-template <typename PSET>
-inline void
-assign_all_inequalities_approximation(const PSET& pset,
-				      Constraint_System& cs) {
-  assign_all_inequalities_approximation(pset.minimized_constraints(), cs);
-}
-
-template <>
-void
-assign_all_inequalities_approximation(const C_Polyhedron& ph,
-				      Constraint_System& cs);
-
-bool
-termination_test_MS(const Constraint_System& cs);
-
-bool
-one_affine_ranking_function_MS(const Constraint_System& cs,
-			       Generator& mu);
-
-void
-all_affine_ranking_functions_MS(const Constraint_System& cs,
-				C_Polyhedron& mu_space);
-
-void
-all_affine_quasi_ranking_functions_MS(const Constraint_System& cs,
-                                      C_Polyhedron& decreasing_mu_space,
-                                      C_Polyhedron& bounded_mu_space);
-
-bool
-termination_test_PR(const Constraint_System& cs_before,
-		    const Constraint_System& cs_after);
-
-bool
-one_affine_ranking_function_PR(const Constraint_System& cs_before,
-			       const Constraint_System& cs_after,
-			       Generator& mu);
-
-void
-all_affine_ranking_functions_PR(const Constraint_System& cs_before,
-				const Constraint_System& cs_after,
-				NNC_Polyhedron& mu_space);
-
-bool
-termination_test_PR_original(const Constraint_System& cs);
-
-bool
-one_affine_ranking_function_PR_original(const Constraint_System& cs,
-                                        Generator& mu);
-
-void
-all_affine_ranking_functions_PR_original(const Constraint_System& cs,
-                                         NNC_Polyhedron& mu_space);
-
-} // namespace Termination
-
-} // namespace Implementation
-
-template <typename PSET>
-void
-Termination_Helpers
-::assign_all_inequalities_approximation(const PSET& pset_before,
-                                        const PSET& pset_after,
-                                        Constraint_System& cs) {
-  Implementation::Termination
-    ::assign_all_inequalities_approximation(pset_before, cs);
-  cs.shift_space_dimensions(Variable(0), cs.space_dimension());
-  Constraint_System cs_after;
-  Implementation::Termination
-    ::assign_all_inequalities_approximation(pset_after, cs_after);
-  // FIXME: provide an "append" for constraint systems.
-  for (Constraint_System::const_iterator i = cs_after.begin(),
-         cs_after_end = cs_after.end(); i != cs_after_end; ++i)
-    cs.insert(*i);
-}
-
-template <typename PSET>
-bool
-termination_test_MS(const PSET& pset) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::termination_test_MS(pset):\n"
-         "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  return termination_test_MS(cs);
-}
-
-template <typename PSET>
-bool
-termination_test_MS_2(const PSET& pset_before, const PSET& pset_after) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::termination_test_MS_2(pset_before, pset_after):\n"
-         "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  Termination_Helpers
-    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
-  return termination_test_MS(cs);
-}
-
-template <typename PSET>
-bool
-one_affine_ranking_function_MS(const PSET& pset, Generator& mu) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::one_affine_ranking_function_MS(pset, mu):\n"
-         "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  return one_affine_ranking_function_MS(cs, mu);
-}
-
-template <typename PSET>
-bool
-one_affine_ranking_function_MS_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::one_affine_ranking_function_MS_2(pset_before, pset_after, mu):\n"
-         "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  Termination_Helpers
-    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
-  return one_affine_ranking_function_MS(cs, mu);
-}
-
-template <typename PSET>
-void
-all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::all_affine_ranking_functions_MS(pset, mu_space):\n"
-         "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  if (pset.is_empty()) {
-    mu_space = C_Polyhedron(1 + space_dim/2, UNIVERSE);
-    return;
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  all_affine_ranking_functions_MS(cs, mu_space);
-}
-
-template <typename PSET>
-void
-all_affine_ranking_functions_MS_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  C_Polyhedron& mu_space) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::all_affine_ranking_functions_MS_2"
-      << "(pset_before, pset_after, mu_space):\n"
-      << "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  if (pset_before.is_empty()) {
-    mu_space = C_Polyhedron(1 + before_space_dim, UNIVERSE);
-    return;
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  Termination_Helpers
-    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
-  all_affine_ranking_functions_MS(cs, mu_space);
-}
-
-template <typename PSET>
-void
-all_affine_quasi_ranking_functions_MS(const PSET& pset,
-                                      C_Polyhedron& decreasing_mu_space,
-                                      C_Polyhedron& bounded_mu_space) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::all_affine_quasi_ranking_functions_MS"
-      << "(pset, decr_space, bounded_space):\n"
-      << "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  if (pset.is_empty()) {
-    decreasing_mu_space = C_Polyhedron(1 + space_dim/2, UNIVERSE);
-    bounded_mu_space = decreasing_mu_space;
-    return;
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  all_affine_quasi_ranking_functions_MS(cs,
-                                        decreasing_mu_space,
-                                        bounded_mu_space);
-}
-
-template <typename PSET>
-void
-all_affine_quasi_ranking_functions_MS_2(const PSET& pset_before,
-                                        const PSET& pset_after,
-                                        C_Polyhedron& decreasing_mu_space,
-                                        C_Polyhedron& bounded_mu_space) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::all_affine_quasi_ranking_functions_MS_2"
-      << "(pset_before, pset_after, decr_space, bounded_space):\n"
-      << "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  if (pset_before.is_empty()) {
-    decreasing_mu_space = C_Polyhedron(1 + before_space_dim, UNIVERSE);
-    bounded_mu_space = decreasing_mu_space;
-    return;
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  Termination_Helpers
-    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
-  all_affine_quasi_ranking_functions_MS(cs,
-                                        decreasing_mu_space,
-                                        bounded_mu_space);
-}
-
-template <typename PSET>
-bool
-termination_test_PR_2(const PSET& pset_before, const PSET& pset_after) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::termination_test_PR_2(pset_before, pset_after):\n"
-      << "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs_before;
-  Constraint_System cs_after;
-  assign_all_inequalities_approximation(pset_before, cs_before);
-  assign_all_inequalities_approximation(pset_after, cs_after);
-  return termination_test_PR(cs_before, cs_after);
-}
-
-template <typename PSET>
-bool
-termination_test_PR(const PSET& pset) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::termination_test_PR(pset):\n"
-      << "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  return termination_test_PR_original(cs);
-}
-
-template <typename PSET>
-bool
-one_affine_ranking_function_PR_2(const PSET& pset_before,
-				 const PSET& pset_after,
-				 Generator& mu) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::one_affine_ranking_function_PR_2"
-      << "(pset_before, pset_after, mu):\n"
-      << "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs_before;
-  Constraint_System cs_after;
-  assign_all_inequalities_approximation(pset_before, cs_before);
-  assign_all_inequalities_approximation(pset_after, cs_after);
-  return one_affine_ranking_function_PR(cs_before, cs_after, mu);
-}
-
-template <typename PSET>
-bool
-one_affine_ranking_function_PR(const PSET& pset, Generator& mu) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::one_affine_ranking_function_PR(pset, mu):\n"
-      << "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  return one_affine_ranking_function_PR_original(cs, mu);
-}
-
-template <typename PSET>
-void
-all_affine_ranking_functions_PR_2(const PSET& pset_before,
-				  const PSET& pset_after,
-				  NNC_Polyhedron& mu_space) {
-  const dimension_type before_space_dim = pset_before.space_dimension();
-  const dimension_type after_space_dim = pset_after.space_dimension();
-  if (after_space_dim != 2*before_space_dim) {
-    std::ostringstream s;
-    s << "PPL::all_affine_ranking_functions_MS_2"
-      << "(pset_before, pset_after, mu_space):\n"
-      << "pset_before.space_dimension() == " << before_space_dim
-      << ", pset_after.space_dimension() == " << after_space_dim
-      << ";\nthe latter should be twice the former.";
-    throw std::invalid_argument(s.str());
-  }
-
-  if (pset_before.is_empty()) {
-    mu_space = NNC_Polyhedron(1 + before_space_dim);
-    return;
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs_before;
-  Constraint_System cs_after;
-  assign_all_inequalities_approximation(pset_before, cs_before);
-  assign_all_inequalities_approximation(pset_after, cs_after);
-  all_affine_ranking_functions_PR(cs_before, cs_after, mu_space);
-}
-
-template <typename PSET>
-void
-all_affine_ranking_functions_PR(const PSET& pset,
-				NNC_Polyhedron& mu_space) {
-  const dimension_type space_dim = pset.space_dimension();
-  if (space_dim % 2 != 0) {
-    std::ostringstream s;
-    s << "PPL::all_affine_ranking_functions_PR(pset, mu_space):\n"
-      << "pset.space_dimension() == " << space_dim
-      << " is odd.";
-    throw std::invalid_argument(s.str());
-  }
-
-  if (pset.is_empty()) {
-    mu_space = NNC_Polyhedron(1 + space_dim/2);
-    return;
-  }
-
-  using namespace Implementation::Termination;
-  Constraint_System cs;
-  assign_all_inequalities_approximation(pset, cs);
-  all_affine_ranking_functions_PR_original(cs, mu_space);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_termination_templates_hh)
diff --git a/src/termination.types.hh b/src/termination.types.hh
deleted file mode 100644
index a7d3685..0000000
--- a/src/termination.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_termination_types_hh
-#define PPL_termination_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Termination_Helpers;
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_termination_types_hh)
diff --git a/src/termination_defs.hh b/src/termination_defs.hh
new file mode 100644
index 0000000..e4334bf
--- /dev/null
+++ b/src/termination_defs.hh
@@ -0,0 +1,502 @@
+/* Utilities for termination analysis: declarations.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_termination_defs_hh
+#define PPL_termination_defs_hh 1
+
+#include "termination_types.hh"
+
+#include "Generator_types.hh"
+#include "C_Polyhedron_types.hh"
+#include "NNC_Polyhedron_types.hh"
+#include "Constraint_System_types.hh"
+
+namespace Parma_Polyhedra_Library {
+
+class Termination_Helpers {
+public:
+  static void
+  all_affine_ranking_functions_PR(const Constraint_System& cs_before,
+                                  const Constraint_System& cs_after,
+                                  NNC_Polyhedron& mu_space);
+  static bool
+  one_affine_ranking_function_PR(const Constraint_System& cs_before,
+                                 const Constraint_System& cs_after,
+                                 Generator& mu);
+  static bool
+  one_affine_ranking_function_PR_original(const Constraint_System& cs,
+                                          Generator& mu);
+  static void
+  all_affine_ranking_functions_PR_original(const Constraint_System& cs,
+                                           NNC_Polyhedron& mu_space);
+
+  template <typename PSET>
+  static void
+  assign_all_inequalities_approximation(const PSET& pset_before,
+                                        const PSET& pset_after,
+                                        Constraint_System& cs);
+}; // class Termination_Helpers
+
+//! \name Functions for the Synthesis of Linear Rankings
+//@{
+
+/*! \ingroup PPL_CXX_interface \brief
+  Termination test using an improvement of the method by Mesnard and
+  Serebrenik \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset
+  A pointset approximating the behavior of a loop whose termination
+  is being analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+  .
+  where unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.
+
+  \return
+  <CODE>true</CODE> if any loop approximated by \p pset definitely
+  terminates; <CODE>false</CODE> if the test is inconclusive.
+  However, if \p pset <EM>precisely</EM> characterizes the effect
+  of the loop body onto the loop-relevant program variables,
+  then <CODE>true</CODE> is returned <EM>if and only if</EM>
+  the loop terminates.
+*/
+template <typename PSET>
+bool
+termination_test_MS(const PSET& pset);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Termination test using an improvement of the method by Mesnard and
+  Serebrenik \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset_before
+  A pointset approximating the values of loop-relevant variables
+  <EM>before</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$.
+
+  \param pset_after
+  A pointset approximating the values of loop-relevant variables
+  <EM>after</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+
+  Note that unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.  Note also that unprimed variables are assigned
+  to different space dimensions in \p pset_before and \p pset_after.
+
+  \return
+  <CODE>true</CODE> if any loop approximated by \p pset definitely
+  terminates; <CODE>false</CODE> if the test is inconclusive.
+  However, if \p pset_before and \p pset_after <EM>precisely</EM>
+  characterize the effect of the loop body onto the loop-relevant
+  program variables, then <CODE>true</CODE> is returned
+  <EM>if and only if</EM> the loop terminates.
+*/
+template <typename PSET>
+bool
+termination_test_MS_2(const PSET& pset_before, const PSET& pset_after);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Termination test with witness ranking function using an improvement
+  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset
+  A pointset approximating the behavior of a loop whose termination
+  is being analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+  .
+  where unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.
+
+  \param mu
+  When <CODE>true</CODE> is returned, this is assigned a point
+  of space dimension \f$ n+1 \f$ encoding one (not further specified)
+  affine ranking function for the loop being analyzed.
+  The ranking function is of the form \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
+  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ are the coefficients
+  of \p mu corresponding to the space dimensions \f$ n, 0, \ldots, n-1 \f$,
+  respectively.
+
+  \return
+  <CODE>true</CODE> if any loop approximated by \p pset definitely
+  terminates; <CODE>false</CODE> if the test is inconclusive.
+  However, if \p pset <EM>precisely</EM> characterizes the effect
+  of the loop body onto the loop-relevant program variables,
+  then <CODE>true</CODE> is returned <EM>if and only if</EM>
+  the loop terminates.
+*/
+template <typename PSET>
+bool
+one_affine_ranking_function_MS(const PSET& pset, Generator& mu);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Termination test with witness ranking function using an improvement
+  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset_before
+  A pointset approximating the values of loop-relevant variables
+  <EM>before</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$.
+
+  \param pset_after
+  A pointset approximating the values of loop-relevant variables
+  <EM>after</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+
+  Note that unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.  Note also that unprimed variables are assigned
+  to different space dimensions in \p pset_before and \p pset_after.
+
+  \param mu
+  When <CODE>true</CODE> is returned, this is assigned a point
+  of space dimension \f$ n+1 \f$ encoding one (not further specified)
+  affine ranking function for the loop being analyzed.
+  The ranking function is of the form \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
+  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ are the coefficients
+  of \p mu corresponding to the space dimensions \f$ n, 0, \ldots, n-1 \f$,
+  respectively.
+
+  \return
+  <CODE>true</CODE> if any loop approximated by \p pset definitely
+  terminates; <CODE>false</CODE> if the test is inconclusive.
+  However, if \p pset_before and \p pset_after <EM>precisely</EM>
+  characterize the effect of the loop body onto the loop-relevant
+  program variables, then <CODE>true</CODE> is returned
+  <EM>if and only if</EM> the loop terminates.
+*/
+template <typename PSET>
+bool
+one_affine_ranking_function_MS_2(const PSET& pset_before,
+                                 const PSET& pset_after,
+                                 Generator& mu);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Termination test with ranking function space using an improvement
+  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset
+  A pointset approximating the behavior of a loop whose termination
+  is being analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+  .
+  where unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.
+
+  \param mu_space
+  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
+  representing the space of all the affine ranking functions for the loops
+  that are precisely characterized by \p pset.
+  These ranking functions are of the form
+  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
+  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
+  \p mu_space polyhedron.
+  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
+  correspond to the space dimensions of \p mu_space
+  \f$ n, 0, \ldots, n-1 \f$, respectively.
+  When \p mu_space is empty, it means that the test is inconclusive.
+  However, if \p pset <EM>precisely</EM> characterizes the effect
+  of the loop body onto the loop-relevant program variables,
+  then \p mu_space is empty <EM>if and only if</EM>
+  the loop does <EM>not</EM> terminate.
+*/
+template <typename PSET>
+void
+all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Termination test with ranking function space using an improvement
+  of the method by Mesnard and Serebrenik \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset_before
+  A pointset approximating the values of loop-relevant variables
+  <EM>before</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$.
+
+  \param pset_after
+  A pointset approximating the values of loop-relevant variables
+  <EM>after</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+
+  Note that unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.  Note also that unprimed variables are assigned
+  to different space dimensions in \p pset_before and \p pset_after.
+
+  \param mu_space
+  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
+  representing the space of all the affine ranking functions for the loops
+  that are precisely characterized by \p pset.
+  These ranking functions are of the form
+  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
+  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
+  \p mu_space polyhedron.
+  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
+  correspond to the space dimensions of \p mu_space
+  \f$ n, 0, \ldots, n-1 \f$, respectively.
+  When \p mu_space is empty, it means that the test is inconclusive.
+  However, if \p pset_before and \p pset_after <EM>precisely</EM>
+  characterize the effect of the loop body onto the loop-relevant
+  program variables, then \p mu_space is empty <EM>if and only if</EM>
+  the loop does <EM>not</EM> terminate.
+*/
+template <typename PSET>
+void
+all_affine_ranking_functions_MS_2(const PSET& pset_before,
+                                  const PSET& pset_after,
+                                  C_Polyhedron& mu_space);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Computes the spaces of affine \e quasi ranking functions
+  using an improvement of the method by Mesnard and Serebrenik
+  \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset
+  A pointset approximating the behavior of a loop whose termination
+  is being analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+  .
+  where unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.
+
+  \param decreasing_mu_space
+  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
+  representing the space of all the decreasing affine functions
+  for the loops that are precisely characterized by \p pset.
+
+  \param bounded_mu_space
+  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
+  representing the space of all the lower bounded affine functions
+  for the loops that are precisely characterized by \p pset.
+
+  These quasi-ranking functions are of the form
+  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
+  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
+  \p decreasing_mu_space and \p bounded_mu_space polyhedrons.
+  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
+  correspond to the space dimensions \f$ n, 0, \ldots, n-1 \f$, respectively.
+  When \p decreasing_mu_space (resp., \p bounded_mu_space) is empty,
+  it means that the test is inconclusive.
+  However, if \p pset <EM>precisely</EM> characterizes the effect
+  of the loop body onto the loop-relevant program variables,
+  then \p decreasing_mu_space (resp., \p bounded_mu_space) will be empty
+  <EM>if and only if</EM> there is no decreasing (resp., lower bounded)
+  affine function, so that the loop does not terminate.
+*/
+template <typename PSET>
+void
+all_affine_quasi_ranking_functions_MS(const PSET& pset,
+                                      C_Polyhedron& decreasing_mu_space,
+                                      C_Polyhedron& bounded_mu_space);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Computes the spaces of affine \e quasi ranking functions
+  using an improvement of the method by Mesnard and Serebrenik
+  \ref BMPZ10 "[BMPZ10]".
+
+  \tparam PSET
+  Any pointset supported by the PPL that provides the
+  <CODE>minimized_constraints()</CODE> method.
+
+  \param pset_before
+  A pointset approximating the values of loop-relevant variables
+  <EM>before</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$.
+
+  \param pset_after
+  A pointset approximating the values of loop-relevant variables
+  <EM>after</EM> the update performed in the loop body that is being
+  analyzed.  The variables indices are allocated as follows:
+  - \f$ x'_1, \ldots, x'_n \f$ go onto space dimensions
+    \f$ 0, \ldots, n-1 \f$,
+  - \f$ x_1, \ldots, x_n \f$ go onto space dimensions
+    \f$ n, \ldots, 2n-1 \f$,
+
+  Note that unprimed variables represent the values of the loop-relevant
+  program variables before the update performed in the loop body,
+  and primed variables represent the values of those program variables
+  after the update.  Note also that unprimed variables are assigned
+  to different space dimensions in \p pset_before and \p pset_after.
+
+  \param decreasing_mu_space
+  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
+  representing the space of all the decreasing affine functions
+  for the loops that are precisely characterized by \p pset.
+
+  \param bounded_mu_space
+  This is assigned a closed polyhedron of space dimension \f$ n+1 \f$
+  representing the space of all the lower bounded affine functions
+  for the loops that are precisely characterized by \p pset.
+
+  These ranking functions are of the form
+  \f$ \mu_0 + \sum_{i=1}^n \mu_i x_i \f$
+  where \f$ \mu_0, \mu_1, \ldots, \mu_n \f$ identify any point of the
+  \p decreasing_mu_space and \p bounded_mu_space polyhedrons.
+  The variables \f$ \mu_0, \mu_1, \ldots, \mu_n \f$
+  correspond to the space dimensions \f$ n, 0, \ldots, n-1 \f$, respectively.
+  When \p decreasing_mu_space (resp., \p bounded_mu_space) is empty,
+  it means that the test is inconclusive.
+  However, if \p pset_before and \p pset_after <EM>precisely</EM>
+  characterize the effect of the loop body onto the loop-relevant
+  program variables, then \p decreasing_mu_space (resp., \p bounded_mu_space)
+  will be empty <EM>if and only if</EM> there is no decreasing
+  (resp., lower bounded) affine function, so that the loop does not terminate.
+*/
+template <typename PSET>
+void
+all_affine_quasi_ranking_functions_MS_2(const PSET& pset_before,
+                                        const PSET& pset_after,
+                                        C_Polyhedron& decreasing_mu_space,
+                                        C_Polyhedron& bounded_mu_space);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Like termination_test_MS() but using the method by Podelski and
+  Rybalchenko \ref BMPZ10 "[BMPZ10]".
+*/
+template <typename PSET>
+bool
+termination_test_PR(const PSET& pset);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Like termination_test_MS_2() but using an alternative formalization
+  of the method by Podelski and Rybalchenko \ref BMPZ10 "[BMPZ10]".
+*/
+template <typename PSET>
+bool
+termination_test_PR_2(const PSET& pset_before, const PSET& pset_after);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Like one_affine_ranking_function_MS() but using the method by Podelski
+  and Rybalchenko \ref BMPZ10 "[BMPZ10]".
+*/
+template <typename PSET>
+bool
+one_affine_ranking_function_PR(const PSET& pset, Generator& mu);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Like one_affine_ranking_function_MS_2() but using an alternative
+  formalization of the method by Podelski and Rybalchenko
+  \ref BMPZ10 "[BMPZ10]".
+*/
+template <typename PSET>
+bool
+one_affine_ranking_function_PR_2(const PSET& pset_before,
+                                 const PSET& pset_after,
+                                 Generator& mu);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Like all_affine_ranking_functions_MS() but using the method by Podelski
+  and Rybalchenko \ref BMPZ10 "[BMPZ10]".
+*/
+template <typename PSET>
+void
+all_affine_ranking_functions_PR(const PSET& pset, NNC_Polyhedron& mu_space);
+
+/*! \ingroup PPL_CXX_interface \brief
+  Like all_affine_ranking_functions_MS_2() but using an alternative
+  formalization of the method by Podelski and Rybalchenko
+  \ref BMPZ10 "[BMPZ10]".
+*/
+template <typename PSET>
+void
+all_affine_ranking_functions_PR_2(const PSET& pset_before,
+                                  const PSET& pset_after,
+                                  NNC_Polyhedron& mu_space);
+
+//@} // Functions for the Synthesis of Linear Rankings
+
+} // namespace Parma_Polyhedra_Library
+
+#include "termination_templates.hh"
+
+#endif // !defined(PPL_termination_defs_hh)
diff --git a/src/termination_templates.hh b/src/termination_templates.hh
new file mode 100644
index 0000000..b106e52
--- /dev/null
+++ b/src/termination_templates.hh
@@ -0,0 +1,552 @@
+/* Utilities for termination analysis: template functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_termination_templates_hh
+#define PPL_termination_templates_hh 1
+
+#include "globals_defs.hh"
+#include "Variable_defs.hh"
+#include "Generator_defs.hh"
+#include "Constraint_System_defs.hh"
+#include "C_Polyhedron_defs.hh"
+#include "NNC_Polyhedron_defs.hh"
+
+#include <stdexcept>
+
+#define PRINT_DEBUG_INFO 0
+
+#if PRINT_DEBUG_INFO
+#include <iostream>
+#endif
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+
+namespace Termination {
+
+#if PRINT_DEBUG_INFO
+static dimension_type output_function_MS_n;
+static dimension_type output_function_MS_m;
+
+/* Encodes which object are we printing:
+
+   0 means input constraint system;
+   1 means first output constraint system;
+   2 means second output constraint system;
+   3 means only output constraint system
+     (i.e., when first and second are the same);
+   4 means mu space.
+*/
+static int output_function_MS_which = -1;
+
+/*
+  Debugging output function.  See the documentation of
+  fill_constraint_systems_MS() for the allocation of variable indices.
+*/
+inline void
+output_function_MS(std::ostream& s, const Variable v) {
+  dimension_type id = v.id();
+  switch (output_function_MS_which) {
+  case 0:
+    if (id < output_function_MS_n)
+      s << "x'" << id + 1;
+    else if (id < 2*output_function_MS_n)
+      s << "x" << id - output_function_MS_n + 1;
+    else
+      s << "WHAT?";
+    break;
+  case 1:
+    if (id < output_function_MS_n)
+      s << "mu" << id + 1;
+    else if (id == output_function_MS_n)
+      s << "WHAT?";
+    else if (id <= output_function_MS_n + output_function_MS_m)
+      s << "y" << id - output_function_MS_n;
+    else
+      s << "WHAT?";
+    break;
+  case 2:
+  case 4:
+    if (id < output_function_MS_n)
+      s << "mu" << id + 1;
+    else if (id == output_function_MS_n)
+      s << "mu0";
+    else if (output_function_MS_which == 2
+             && id <= output_function_MS_n + output_function_MS_m + 2)
+      s << "z" << id - output_function_MS_n;
+    else
+      s << "WHAT?";
+    break;
+  case 3:
+    if (id < output_function_MS_n)
+      s << "mu" << id + 1;
+    else if (id == output_function_MS_n)
+      s << "mu0";
+    else if (id <= output_function_MS_n + output_function_MS_m)
+      s << "y" << id - output_function_MS_n;
+    else if (id <= output_function_MS_n + 2*output_function_MS_m + 2)
+      s << "z" << id - (output_function_MS_n + output_function_MS_m);
+    else
+      s << "WHAT?";
+    break;
+  default:
+    abort();
+    break;
+  }
+}
+
+static dimension_type output_function_PR_s;
+static dimension_type output_function_PR_r;
+
+/*
+  Debugging output function.  See the documentation of
+  fill_constraint_system_PR() for the allocation of variable indices.
+*/
+inline void
+output_function_PR(std::ostream& s, const Variable v) {
+  dimension_type id = v.id();
+  if (id < output_function_PR_s)
+    s << "u3_" << id + 1;
+  else if (id < output_function_PR_s + output_function_PR_r)
+    s << "u2_" << id - output_function_PR_s + 1;
+  else if (id < output_function_PR_s + 2*output_function_PR_r)
+    s << "u1_" << id - (output_function_PR_s + output_function_PR_r) + 1;
+  else
+    s << "WHAT?";
+}
+#endif
+
+void
+assign_all_inequalities_approximation(const Constraint_System& cs_in,
+                                      Constraint_System& cs_out);
+
+template <typename PSET>
+inline void
+assign_all_inequalities_approximation(const PSET& pset,
+                                      Constraint_System& cs) {
+  assign_all_inequalities_approximation(pset.minimized_constraints(), cs);
+}
+
+template <>
+void
+assign_all_inequalities_approximation(const C_Polyhedron& ph,
+                                      Constraint_System& cs);
+
+bool
+termination_test_MS(const Constraint_System& cs);
+
+bool
+one_affine_ranking_function_MS(const Constraint_System& cs,
+                               Generator& mu);
+
+void
+all_affine_ranking_functions_MS(const Constraint_System& cs,
+                                C_Polyhedron& mu_space);
+
+void
+all_affine_quasi_ranking_functions_MS(const Constraint_System& cs,
+                                      C_Polyhedron& decreasing_mu_space,
+                                      C_Polyhedron& bounded_mu_space);
+
+bool
+termination_test_PR(const Constraint_System& cs_before,
+                    const Constraint_System& cs_after);
+
+bool
+one_affine_ranking_function_PR(const Constraint_System& cs_before,
+                               const Constraint_System& cs_after,
+                               Generator& mu);
+
+void
+all_affine_ranking_functions_PR(const Constraint_System& cs_before,
+                                const Constraint_System& cs_after,
+                                NNC_Polyhedron& mu_space);
+
+bool
+termination_test_PR_original(const Constraint_System& cs);
+
+bool
+one_affine_ranking_function_PR_original(const Constraint_System& cs,
+                                        Generator& mu);
+
+void
+all_affine_ranking_functions_PR_original(const Constraint_System& cs,
+                                         NNC_Polyhedron& mu_space);
+
+} // namespace Termination
+
+} // namespace Implementation
+
+template <typename PSET>
+void
+Termination_Helpers
+::assign_all_inequalities_approximation(const PSET& pset_before,
+                                        const PSET& pset_after,
+                                        Constraint_System& cs) {
+  Implementation::Termination
+    ::assign_all_inequalities_approximation(pset_before, cs);
+  cs.shift_space_dimensions(Variable(0), cs.space_dimension());
+  Constraint_System cs_after;
+  Implementation::Termination
+    ::assign_all_inequalities_approximation(pset_after, cs_after);
+  // FIXME: provide an "append" for constraint systems.
+  for (Constraint_System::const_iterator i = cs_after.begin(),
+         cs_after_end = cs_after.end(); i != cs_after_end; ++i)
+    cs.insert(*i);
+}
+
+template <typename PSET>
+bool
+termination_test_MS(const PSET& pset) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::termination_test_MS(pset):\n"
+         "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  return termination_test_MS(cs);
+}
+
+template <typename PSET>
+bool
+termination_test_MS_2(const PSET& pset_before, const PSET& pset_after) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::termination_test_MS_2(pset_before, pset_after):\n"
+         "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  Termination_Helpers
+    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
+  return termination_test_MS(cs);
+}
+
+template <typename PSET>
+bool
+one_affine_ranking_function_MS(const PSET& pset, Generator& mu) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::one_affine_ranking_function_MS(pset, mu):\n"
+         "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  return one_affine_ranking_function_MS(cs, mu);
+}
+
+template <typename PSET>
+bool
+one_affine_ranking_function_MS_2(const PSET& pset_before,
+                                 const PSET& pset_after,
+                                 Generator& mu) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::one_affine_ranking_function_MS_2(pset_before, pset_after, mu):\n"
+         "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  Termination_Helpers
+    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
+  return one_affine_ranking_function_MS(cs, mu);
+}
+
+template <typename PSET>
+void
+all_affine_ranking_functions_MS(const PSET& pset, C_Polyhedron& mu_space) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::all_affine_ranking_functions_MS(pset, mu_space):\n"
+         "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  if (pset.is_empty()) {
+    mu_space = C_Polyhedron(1 + space_dim/2, UNIVERSE);
+    return;
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  all_affine_ranking_functions_MS(cs, mu_space);
+}
+
+template <typename PSET>
+void
+all_affine_ranking_functions_MS_2(const PSET& pset_before,
+                                  const PSET& pset_after,
+                                  C_Polyhedron& mu_space) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::all_affine_ranking_functions_MS_2"
+      << "(pset_before, pset_after, mu_space):\n"
+      << "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  if (pset_before.is_empty()) {
+    mu_space = C_Polyhedron(1 + before_space_dim, UNIVERSE);
+    return;
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  Termination_Helpers
+    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
+  all_affine_ranking_functions_MS(cs, mu_space);
+}
+
+template <typename PSET>
+void
+all_affine_quasi_ranking_functions_MS(const PSET& pset,
+                                      C_Polyhedron& decreasing_mu_space,
+                                      C_Polyhedron& bounded_mu_space) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::all_affine_quasi_ranking_functions_MS"
+      << "(pset, decr_space, bounded_space):\n"
+      << "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  if (pset.is_empty()) {
+    decreasing_mu_space = C_Polyhedron(1 + space_dim/2, UNIVERSE);
+    bounded_mu_space = decreasing_mu_space;
+    return;
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  all_affine_quasi_ranking_functions_MS(cs,
+                                        decreasing_mu_space,
+                                        bounded_mu_space);
+}
+
+template <typename PSET>
+void
+all_affine_quasi_ranking_functions_MS_2(const PSET& pset_before,
+                                        const PSET& pset_after,
+                                        C_Polyhedron& decreasing_mu_space,
+                                        C_Polyhedron& bounded_mu_space) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::all_affine_quasi_ranking_functions_MS_2"
+      << "(pset_before, pset_after, decr_space, bounded_space):\n"
+      << "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  if (pset_before.is_empty()) {
+    decreasing_mu_space = C_Polyhedron(1 + before_space_dim, UNIVERSE);
+    bounded_mu_space = decreasing_mu_space;
+    return;
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  Termination_Helpers
+    ::assign_all_inequalities_approximation(pset_before, pset_after, cs);
+  all_affine_quasi_ranking_functions_MS(cs,
+                                        decreasing_mu_space,
+                                        bounded_mu_space);
+}
+
+template <typename PSET>
+bool
+termination_test_PR_2(const PSET& pset_before, const PSET& pset_after) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::termination_test_PR_2(pset_before, pset_after):\n"
+      << "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs_before;
+  Constraint_System cs_after;
+  assign_all_inequalities_approximation(pset_before, cs_before);
+  assign_all_inequalities_approximation(pset_after, cs_after);
+  return termination_test_PR(cs_before, cs_after);
+}
+
+template <typename PSET>
+bool
+termination_test_PR(const PSET& pset) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::termination_test_PR(pset):\n"
+      << "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  return termination_test_PR_original(cs);
+}
+
+template <typename PSET>
+bool
+one_affine_ranking_function_PR_2(const PSET& pset_before,
+                                 const PSET& pset_after,
+                                 Generator& mu) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::one_affine_ranking_function_PR_2"
+      << "(pset_before, pset_after, mu):\n"
+      << "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs_before;
+  Constraint_System cs_after;
+  assign_all_inequalities_approximation(pset_before, cs_before);
+  assign_all_inequalities_approximation(pset_after, cs_after);
+  return one_affine_ranking_function_PR(cs_before, cs_after, mu);
+}
+
+template <typename PSET>
+bool
+one_affine_ranking_function_PR(const PSET& pset, Generator& mu) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::one_affine_ranking_function_PR(pset, mu):\n"
+      << "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  return one_affine_ranking_function_PR_original(cs, mu);
+}
+
+template <typename PSET>
+void
+all_affine_ranking_functions_PR_2(const PSET& pset_before,
+                                  const PSET& pset_after,
+                                  NNC_Polyhedron& mu_space) {
+  const dimension_type before_space_dim = pset_before.space_dimension();
+  const dimension_type after_space_dim = pset_after.space_dimension();
+  if (after_space_dim != 2*before_space_dim) {
+    std::ostringstream s;
+    s << "PPL::all_affine_ranking_functions_MS_2"
+      << "(pset_before, pset_after, mu_space):\n"
+      << "pset_before.space_dimension() == " << before_space_dim
+      << ", pset_after.space_dimension() == " << after_space_dim
+      << ";\nthe latter should be twice the former.";
+    throw std::invalid_argument(s.str());
+  }
+
+  if (pset_before.is_empty()) {
+    mu_space = NNC_Polyhedron(1 + before_space_dim);
+    return;
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs_before;
+  Constraint_System cs_after;
+  assign_all_inequalities_approximation(pset_before, cs_before);
+  assign_all_inequalities_approximation(pset_after, cs_after);
+  all_affine_ranking_functions_PR(cs_before, cs_after, mu_space);
+}
+
+template <typename PSET>
+void
+all_affine_ranking_functions_PR(const PSET& pset,
+                                NNC_Polyhedron& mu_space) {
+  const dimension_type space_dim = pset.space_dimension();
+  if (space_dim % 2 != 0) {
+    std::ostringstream s;
+    s << "PPL::all_affine_ranking_functions_PR(pset, mu_space):\n"
+      << "pset.space_dimension() == " << space_dim
+      << " is odd.";
+    throw std::invalid_argument(s.str());
+  }
+
+  if (pset.is_empty()) {
+    mu_space = NNC_Polyhedron(1 + space_dim/2);
+    return;
+  }
+
+  using namespace Implementation::Termination;
+  Constraint_System cs;
+  assign_all_inequalities_approximation(pset, cs);
+  all_affine_ranking_functions_PR_original(cs, mu_space);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_termination_templates_hh)
diff --git a/src/termination_types.hh b/src/termination_types.hh
new file mode 100644
index 0000000..314c0b9
--- /dev/null
+++ b/src/termination_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_termination_types_hh
+#define PPL_termination_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Termination_Helpers;
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_termination_types_hh)
diff --git a/src/version.cc b/src/version.cc
index fbfc395..3337409 100644
--- a/src/version.cc
+++ b/src/version.cc
@@ -1,6 +1,6 @@
 /* Definition of functions providing version and licensing information.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -33,7 +33,7 @@ const char version_string[] = PPL_PACKAGE_VERSION;
 const char banner_string[] =
 "This is "PPL_PACKAGE_NAME" (PPL) version "PPL_PACKAGE_VERSION".\n"
 "Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>\n"
-"Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)\n"
+"Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)\n"
 "\n"
 "The PPL is free software; see the source for copying conditions.\n"
 "There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A\n"
diff --git a/src/version.hh.in b/src/version.hh.in
index 0c40ac2..4d0fd20 100644
--- a/src/version.hh.in
+++ b/src/version.hh.in
@@ -1,7 +1,7 @@
 /* Declaration of macros and functions providing version  -*- C++ -*-
    and licensing information.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/src/wrap_assign.hh b/src/wrap_assign.hh
index 3703a57..d45f9d6 100644
--- a/src/wrap_assign.hh
+++ b/src/wrap_assign.hh
@@ -1,6 +1,6 @@
 /* Generic implementation of the wrap_assign() function.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,10 +24,10 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_wrap_assign_hh
 #define PPL_wrap_assign_hh 1
 
-#include "globals.defs.hh"
-#include "Coefficient.defs.hh"
-#include "Variable.defs.hh"
-#include "Constraint_System.defs.hh"
+#include "globals_defs.hh"
+#include "Coefficient_defs.hh"
+#include "Variable_defs.hh"
+#include "Constraint_System_defs.hh"
 #include "assert.hh"
 
 namespace Parma_Polyhedra_Library {
@@ -280,7 +280,7 @@ wrap_assign(PSET& pointset,
     div_2exp_assign_r(l_n, l_n, w, ROUND_DOWN);
     div_2exp_assign_r(u_n, u_n, w, ROUND_DOWN);
     Coefficient& first_quadrant = l_n;
-    Coefficient& last_quadrant = u_n;
+    const Coefficient& last_quadrant = u_n;
 
     // Special case: this variable does not need wrapping.
     if (first_quadrant == 0 && last_quadrant == 0)
diff --git a/src/wrap_string.cc b/src/wrap_string.cc
index b9ba6f4..e789f3a 100644
--- a/src/wrap_string.cc
+++ b/src/wrap_string.cc
@@ -1,6 +1,6 @@
 /* String wrapping helper function.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -32,9 +32,9 @@ namespace IO_Operators {
 
 std::string
 wrap_string(const std::string& src_string,
-	    const unsigned indent_depth,
-	    const unsigned preferred_first_line_length,
-	    const unsigned preferred_line_length) {
+            const unsigned indent_depth,
+            const unsigned preferred_first_line_length,
+            const unsigned preferred_line_length) {
   const unsigned npos = C_Integer<unsigned>::max;
   std::string dst_string;
   const char *src = src_string.c_str();
@@ -48,29 +48,29 @@ wrap_string(const std::string& src_string,
     unsigned idx;
     for (idx = 0; idx <= line_length; ++idx) {
       if (src[idx] == '\0' || src[idx] == '\n') {
-	split_pos = idx;
-	break;
+        split_pos = idx;
+        break;
       }
       if (src[idx] == ',' && idx < line_length)
-	last_comma = idx;
+        last_comma = idx;
       if (is_space(src[idx]) && (idx == 0 || !is_space(src[idx-1])))
-	last_space = idx;
+        last_space = idx;
     }
     if (split_pos == npos) {
       if (last_comma != npos)
-	split_pos = last_comma + 1;
+        split_pos = last_comma + 1;
       else if (last_space != npos)
-	split_pos = last_space;
+        split_pos = last_space;
       else {
-	for ( ; src[idx] != '\0'; ++idx) {
-	  if (src[idx] == ',') {
-	    ++idx;
-	    break;
-	  }
-	  if (is_space(src[idx]))
-	    break;
-	}
-	split_pos = idx;
+        for ( ; src[idx] != '\0'; ++idx) {
+          if (src[idx] == ',') {
+            ++idx;
+            break;
+          }
+          if (is_space(src[idx]))
+            break;
+        }
+        split_pos = idx;
       }
     }
     PPL_ASSERT(split_pos != npos);
diff --git a/src/wrap_string.hh b/src/wrap_string.hh
index 17af66b..fa278c7 100644
--- a/src/wrap_string.hh
+++ b/src/wrap_string.hh
@@ -1,6 +1,6 @@
 /* Declaration of string wrapping function.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,7 +24,7 @@ site: http://bugseng.com/products/ppl/ . */
 #ifndef PPL_wrap_hh
 #define PPL_wrap_hh 1
 
-#include "globals.defs.hh"
+#include "globals_defs.hh"
 
 namespace Parma_Polyhedra_Library {
 
@@ -49,9 +49,9 @@ namespace IO_Operators {
 */
 std::string
 wrap_string(const std::string& src_string,
-	    unsigned indent_depth,
-	    unsigned preferred_first_line_length,
-	    unsigned preferred_line_length);
+            unsigned indent_depth,
+            unsigned preferred_first_line_length,
+            unsigned preferred_line_length);
 
 } // namespace IO_Operators
 
diff --git a/tests/BD_Shape/Makefile.am b/tests/BD_Shape/Makefile.am
index 930d68e..a517149 100644
--- a/tests/BD_Shape/Makefile.am
+++ b/tests/BD_Shape/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/BD_Shape/Makefile.in b/tests/BD_Shape/Makefile.in
index 54c8f44..a051377 100644
--- a/tests/BD_Shape/Makefile.in
+++ b/tests/BD_Shape/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -94,7 +110,8 @@ check_PROGRAMS = addconstraints1$(EXEEXT) addspacedims1$(EXEEXT) \
 XFAIL_TESTS =
 subdir = tests/BD_Shape
 DIST_COMMON = $(dist_check_SCRIPTS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -136,6 +153,7 @@ addconstraints1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_addspacedims1_OBJECTS = addspacedims1.$(OBJEXT)
 addspacedims1_OBJECTS = $(am_addspacedims1_OBJECTS)
 addspacedims1_LDADD = $(LDADD)
@@ -588,6 +606,18 @@ writebdshape1_LDADD = $(LDADD)
 writebdshape1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -600,20 +630,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addconstraints1_SOURCES) $(addspacedims1_SOURCES) \
 	$(affinedimension1_SOURCES) $(affineimage1_SOURCES) \
 	$(affineimage2_SOURCES) $(affinepreimage1_SOURCES) \
@@ -690,10 +716,17 @@ DIST_SOURCES = $(addconstraints1_SOURCES) $(addspacedims1_SOURCES) \
 	$(unconstrain1_SOURCES) $(universe1_SOURCES) \
 	$(upperbound1_SOURCES) $(upperboundifexact1_SOURCES) \
 	$(wrap1_SOURCES) $(writebdshape1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -1421,6 +1454,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1434,7 +1481,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -1661,8 +1708,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/BD_Shape/addconstraints1.cc b/tests/BD_Shape/addconstraints1.cc
index 4e91fd7..36c855c 100644
--- a/tests/BD_Shape/addconstraints1.cc
+++ b/tests/BD_Shape/addconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::add_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/addspacedims1.cc b/tests/BD_Shape/addspacedims1.cc
index 09bae2a..b5a2bf6 100644
--- a/tests/BD_Shape/addspacedims1.cc
+++ b/tests/BD_Shape/addspacedims1.cc
@@ -1,7 +1,7 @@
 /* Test BD_Shape::add_space_dimensions_and_embed():
    we add two variables to a BD_Shape.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/affinedimension1.cc b/tests/BD_Shape/affinedimension1.cc
index c34095a..5b06632 100644
--- a/tests/BD_Shape/affinedimension1.cc
+++ b/tests/BD_Shape/affinedimension1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::affine_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/affineimage1.cc b/tests/BD_Shape/affineimage1.cc
index 2f00331..eb9de6a 100644
--- a/tests/BD_Shape/affineimage1.cc
+++ b/tests/BD_Shape/affineimage1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/affineimage2.cc b/tests/BD_Shape/affineimage2.cc
index 0e802be..07cfca4 100644
--- a/tests/BD_Shape/affineimage2.cc
+++ b/tests/BD_Shape/affineimage2.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/affinepreimage1.cc b/tests/BD_Shape/affinepreimage1.cc
index 5196067..268cee8 100644
--- a/tests/BD_Shape/affinepreimage1.cc
+++ b/tests/BD_Shape/affinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/ascii_dump_load1.cc b/tests/BD_Shape/ascii_dump_load1.cc
index 3613e70..5161c4c 100644
--- a/tests/BD_Shape/ascii_dump_load1.cc
+++ b/tests/BD_Shape/ascii_dump_load1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::ascii_dump() and BD_Shape::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/bgp99extrapolation1.cc b/tests/BD_Shape/bgp99extrapolation1.cc
index 6cad928..e44b969 100644
--- a/tests/BD_Shape/bgp99extrapolation1.cc
+++ b/tests/BD_Shape/bgp99extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BGP99_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/bhmz05widening1.cc b/tests/BD_Shape/bhmz05widening1.cc
index 826afff..b742e0d 100644
--- a/tests/BD_Shape/bhmz05widening1.cc
+++ b/tests/BD_Shape/bhmz05widening1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BHMZ05_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/bhz03widening1.cc b/tests/BD_Shape/bhz03widening1.cc
index 789ac0a..bdc1f10 100644
--- a/tests/BD_Shape/bhz03widening1.cc
+++ b/tests/BD_Shape/bhz03widening1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BHZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/bounded1.cc b/tests/BD_Shape/bounded1.cc
index fcbecdf..205a00f 100644
--- a/tests/BD_Shape/bounded1.cc
+++ b/tests/BD_Shape/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/boundedaffineimage1.cc b/tests/BD_Shape/boundedaffineimage1.cc
index 793bb6f..f1b2ad5 100644
--- a/tests/BD_Shape/boundedaffineimage1.cc
+++ b/tests/BD_Shape/boundedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/boundedaffinepreimage1.cc b/tests/BD_Shape/boundedaffinepreimage1.cc
index 917842b..e0f39f9 100644
--- a/tests/BD_Shape/boundedaffinepreimage1.cc
+++ b/tests/BD_Shape/boundedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::bounded_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/bounds1.cc b/tests/BD_Shape/bounds1.cc
index b170e0f..63fea67 100644
--- a/tests/BD_Shape/bounds1.cc
+++ b/tests/BD_Shape/bounds1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::bounds_from_below() and BD_Shape::bounds_from_above().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/cc76extrapolation1.cc b/tests/BD_Shape/cc76extrapolation1.cc
index 46101ad..7e0c5c4 100644
--- a/tests/BD_Shape/cc76extrapolation1.cc
+++ b/tests/BD_Shape/cc76extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::CC76_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/cc76narrowing1.cc b/tests/BD_Shape/cc76narrowing1.cc
index cc915d8..9783a85 100644
--- a/tests/BD_Shape/cc76narrowing1.cc
+++ b/tests/BD_Shape/cc76narrowing1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::CC76_narrowing_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/closure1.cc b/tests/BD_Shape/closure1.cc
index bad5ee7..f86472f 100644
--- a/tests/BD_Shape/closure1.cc
+++ b/tests/BD_Shape/closure1.cc
@@ -1,6 +1,6 @@
 /* Test shortest path closure.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/concatenate1.cc b/tests/BD_Shape/concatenate1.cc
index 5e2fe8f..8ea7dad 100644
--- a/tests/BD_Shape/concatenate1.cc
+++ b/tests/BD_Shape/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::concatenate_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/congruences1.cc b/tests/BD_Shape/congruences1.cc
index 759b479..4aaac30 100644
--- a/tests/BD_Shape/congruences1.cc
+++ b/tests/BD_Shape/congruences1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/constrains1.cc b/tests/BD_Shape/constrains1.cc
index 5e70a55..091dd44 100644
--- a/tests/BD_Shape/constrains1.cc
+++ b/tests/BD_Shape/constrains1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::constrains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,16 +23,16 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
 
-#define TEST_PREDICATE_TRUE(pred)		\
-  if (!pred) {					\
-    nout << "!" #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_TRUE(pred)               \
+  if (!pred) {                                  \
+    nout << "!" #pred << endl;                  \
+    ok = false;                                 \
   }
 
-#define TEST_PREDICATE_FALSE(pred)		\
-  if (pred) {					\
-    nout << #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_FALSE(pred)              \
+  if (pred) {                                   \
+    nout << #pred << endl;                      \
+    ok = false;                                 \
   }
 
 namespace {
diff --git a/tests/BD_Shape/constraints1.cc b/tests/BD_Shape/constraints1.cc
index 3f94621..5e90c46 100644
--- a/tests/BD_Shape/constraints1.cc
+++ b/tests/BD_Shape/constraints1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/contains1.cc b/tests/BD_Shape/contains1.cc
index e434d97..99514f9 100644
--- a/tests/BD_Shape/contains1.cc
+++ b/tests/BD_Shape/contains1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::contains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/containsintegerpoint1.cc b/tests/BD_Shape/containsintegerpoint1.cc
index 3702215..66b3063 100644
--- a/tests/BD_Shape/containsintegerpoint1.cc
+++ b/tests/BD_Shape/containsintegerpoint1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::contains_integer_point().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/difference1.cc b/tests/BD_Shape/difference1.cc
index 8acbfa0..7bdc0cf 100644
--- a/tests/BD_Shape/difference1.cc
+++ b/tests/BD_Shape/difference1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::difference_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/discrete1.cc b/tests/BD_Shape/discrete1.cc
index 4b2dc8a..a9a56e5 100644
--- a/tests/BD_Shape/discrete1.cc
+++ b/tests/BD_Shape/discrete1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::is_discrete().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/disjoint1.cc b/tests/BD_Shape/disjoint1.cc
index 0537917..0474325 100644
--- a/tests/BD_Shape/disjoint1.cc
+++ b/tests/BD_Shape/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::is_disjoint_from(const BD_Shape& y).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/dropsomenonintegerpoints1.cc b/tests/BD_Shape/dropsomenonintegerpoints1.cc
index efd322c..f383155 100644
--- a/tests/BD_Shape/dropsomenonintegerpoints1.cc
+++ b/tests/BD_Shape/dropsomenonintegerpoints1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::drop_some_non_integer_points().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/empty1.cc b/tests/BD_Shape/empty1.cc
index c65ea7e..5990f0b 100644
--- a/tests/BD_Shape/empty1.cc
+++ b/tests/BD_Shape/empty1.cc
@@ -1,6 +1,6 @@
 /* Different ways of creating an empty BD_Shape.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/equality1.cc b/tests/BD_Shape/equality1.cc
index 2089f29..cd96684 100644
--- a/tests/BD_Shape/equality1.cc
+++ b/tests/BD_Shape/equality1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::operator==().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/expandspacedim1.cc b/tests/BD_Shape/expandspacedim1.cc
index 0d03d92..3e286a0 100644
--- a/tests/BD_Shape/expandspacedim1.cc
+++ b/tests/BD_Shape/expandspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::expand_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/foldspacedims1.cc b/tests/BD_Shape/foldspacedims1.cc
index e885b56..36a3aa1 100644
--- a/tests/BD_Shape/foldspacedims1.cc
+++ b/tests/BD_Shape/foldspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::fold_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/frequency1.cc b/tests/BD_Shape/frequency1.cc
index 1306ca6..ca980b2 100644
--- a/tests/BD_Shape/frequency1.cc
+++ b/tests/BD_Shape/frequency1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::frequency().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/frombdshape1.cc b/tests/BD_Shape/frombdshape1.cc
index 828234f..982576d 100644
--- a/tests/BD_Shape/frombdshape1.cc
+++ b/tests/BD_Shape/frombdshape1.cc
@@ -1,7 +1,7 @@
 /* Test BD_Shape copy construct, construction from other
    BD shapes and assignment.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/frombox1.cc b/tests/BD_Shape/frombox1.cc
index 0125482..9482023 100644
--- a/tests/BD_Shape/frombox1.cc
+++ b/tests/BD_Shape/frombox1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const Box<Interval>&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/fromgensys1.cc b/tests/BD_Shape/fromgensys1.cc
index e022b7e..313dc09 100644
--- a/tests/BD_Shape/fromgensys1.cc
+++ b/tests/BD_Shape/fromgensys1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const Generator_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/fromgrid1.cc b/tests/BD_Shape/fromgrid1.cc
index 0f7e691..3bbb65c 100644
--- a/tests/BD_Shape/fromgrid1.cc
+++ b/tests/BD_Shape/fromgrid1.cc
@@ -1,7 +1,7 @@
 /* Test C_Polyhedron::C_Polyhedron(const Grid&)
    and NNC_Polyhedron::NNC_Polyhedron(const Grid&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/fromoctagonalshape1.cc b/tests/BD_Shape/fromoctagonalshape1.cc
index 85d0b9b..51ed504 100644
--- a/tests/BD_Shape/fromoctagonalshape1.cc
+++ b/tests/BD_Shape/fromoctagonalshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const Octagonal_Shape&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/frompolyhedron1.cc b/tests/BD_Shape/frompolyhedron1.cc
index dca7317..95c2cdd 100644
--- a/tests/BD_Shape/frompolyhedron1.cc
+++ b/tests/BD_Shape/frompolyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/fromspacedim1.cc b/tests/BD_Shape/fromspacedim1.cc
index 937826e..97aa7a4 100644
--- a/tests/BD_Shape/fromspacedim1.cc
+++ b/tests/BD_Shape/fromspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(dimension_type, Degenerate_Element).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/generalizedaffineimage1.cc b/tests/BD_Shape/generalizedaffineimage1.cc
index ae57b1e..9c533c3 100644
--- a/tests/BD_Shape/generalizedaffineimage1.cc
+++ b/tests/BD_Shape/generalizedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/generalizedaffineimage2.cc b/tests/BD_Shape/generalizedaffineimage2.cc
index 3d00e76..35bad23 100644
--- a/tests/BD_Shape/generalizedaffineimage2.cc
+++ b/tests/BD_Shape/generalizedaffineimage2.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/generalizedaffinepreimage1.cc b/tests/BD_Shape/generalizedaffinepreimage1.cc
index c1a8551..336e7d9 100644
--- a/tests/BD_Shape/generalizedaffinepreimage1.cc
+++ b/tests/BD_Shape/generalizedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/generalizedaffinepreimage2.cc b/tests/BD_Shape/generalizedaffinepreimage2.cc
index f0d5ae0..63f19a3 100644
--- a/tests/BD_Shape/generalizedaffinepreimage2.cc
+++ b/tests/BD_Shape/generalizedaffinepreimage2.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/generalizedaffinepreimage3.cc b/tests/BD_Shape/generalizedaffinepreimage3.cc
index b1aa63b..90b3388 100644
--- a/tests/BD_Shape/generalizedaffinepreimage3.cc
+++ b/tests/BD_Shape/generalizedaffinepreimage3.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/geomcovers1.cc b/tests/BD_Shape/geomcovers1.cc
index 3e24f00..0a734f9 100644
--- a/tests/BD_Shape/geomcovers1.cc
+++ b/tests/BD_Shape/geomcovers1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<BD_Shape>::geometrically_covers().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/h79widening1.cc b/tests/BD_Shape/h79widening1.cc
index 658b0b9..da59149 100644
--- a/tests/BD_Shape/h79widening1.cc
+++ b/tests/BD_Shape/h79widening1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::H79_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/integerupperboundifexact1.cc b/tests/BD_Shape/integerupperboundifexact1.cc
index fc9bbc8..b222eab 100644
--- a/tests/BD_Shape/integerupperboundifexact1.cc
+++ b/tests/BD_Shape/integerupperboundifexact1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::integer_upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/intersection1.cc b/tests/BD_Shape/intersection1.cc
index 85d7e6c..4a02ae5 100644
--- a/tests/BD_Shape/intersection1.cc
+++ b/tests/BD_Shape/intersection1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/limitedbhmz05extrapolation1.cc b/tests/BD_Shape/limitedbhmz05extrapolation1.cc
index c8f7f77..9c33473 100644
--- a/tests/BD_Shape/limitedbhmz05extrapolation1.cc
+++ b/tests/BD_Shape/limitedbhmz05extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::limited_BHMZ05_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/limitedcc76extrapolation1.cc b/tests/BD_Shape/limitedcc76extrapolation1.cc
index 5987046..ceb222c 100644
--- a/tests/BD_Shape/limitedcc76extrapolation1.cc
+++ b/tests/BD_Shape/limitedcc76extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::limited_CC76_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/limitedh79extrapolation1.cc b/tests/BD_Shape/limitedh79extrapolation1.cc
index a51f5b2..95836c2 100644
--- a/tests/BD_Shape/limitedh79extrapolation1.cc
+++ b/tests/BD_Shape/limitedh79extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::limited_H79_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/mapspacedims1.cc b/tests/BD_Shape/mapspacedims1.cc
index d8889f4..84b1223 100644
--- a/tests/BD_Shape/mapspacedims1.cc
+++ b/tests/BD_Shape/mapspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::map_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/max_min1.cc b/tests/BD_Shape/max_min1.cc
index 3b713ac..283592b 100644
--- a/tests/BD_Shape/max_min1.cc
+++ b/tests/BD_Shape/max_min1.cc
@@ -1,7 +1,7 @@
 /* Test BD_Shape::maximize(const Linear_Expression&, ...)
    and BD_Shape::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/max_min2.cc b/tests/BD_Shape/max_min2.cc
index d783ccf..11001ca 100644
--- a/tests/BD_Shape/max_min2.cc
+++ b/tests/BD_Shape/max_min2.cc
@@ -1,7 +1,7 @@
 /* Test BD_Shape::maximize(const Linear_Expression&, ...)
    and BD_Shape::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/maxspacedim1.cc b/tests/BD_Shape/maxspacedim1.cc
index 8cb0b55..c3cb1b6 100644
--- a/tests/BD_Shape/maxspacedim1.cc
+++ b/tests/BD_Shape/maxspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::max_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/membytes1.cc b/tests/BD_Shape/membytes1.cc
index a17c9bd..d43396b 100644
--- a/tests/BD_Shape/membytes1.cc
+++ b/tests/BD_Shape/membytes1.cc
@@ -1,6 +1,6 @@
 /* Test the total_memory_in_bytes() and external_memory_in_bytes() methods.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/minconstraints1.cc b/tests/BD_Shape/minconstraints1.cc
index 3b70ddb..08cb03d 100644
--- a/tests/BD_Shape/minconstraints1.cc
+++ b/tests/BD_Shape/minconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape<T>::minimized_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/relations1.cc b/tests/BD_Shape/relations1.cc
index ec64084..4cf7b40 100644
--- a/tests/BD_Shape/relations1.cc
+++ b/tests/BD_Shape/relations1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/relations2.cc b/tests/BD_Shape/relations2.cc
index cde8853..0ed503b 100644
--- a/tests/BD_Shape/relations2.cc
+++ b/tests/BD_Shape/relations2.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/relations3.cc b/tests/BD_Shape/relations3.cc
index 43063b7..db5aae6 100644
--- a/tests/BD_Shape/relations3.cc
+++ b/tests/BD_Shape/relations3.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/relations4.cc b/tests/BD_Shape/relations4.cc
index 451bb7c..4519c68 100644
--- a/tests/BD_Shape/relations4.cc
+++ b/tests/BD_Shape/relations4.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/removespacedims1.cc b/tests/BD_Shape/removespacedims1.cc
index 6df6496..3972733 100644
--- a/tests/BD_Shape/removespacedims1.cc
+++ b/tests/BD_Shape/removespacedims1.cc
@@ -1,6 +1,6 @@
 /* Remove some variables from the space.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/run_tests b/tests/BD_Shape/run_tests
index 2d572a2..ad5730e 100755
--- a/tests/BD_Shape/run_tests
+++ b/tests/BD_Shape/run_tests
@@ -2,7 +2,7 @@
 
 # Run the BD_Shape tests.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/BD_Shape/simplifyusingcontext1.cc b/tests/BD_Shape/simplifyusingcontext1.cc
index fe67333..cbe21a7 100644
--- a/tests/BD_Shape/simplifyusingcontext1.cc
+++ b/tests/BD_Shape/simplifyusingcontext1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::simplify_using_context_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/timeelapse1.cc b/tests/BD_Shape/timeelapse1.cc
index 5ac4ed8..71e9e60 100644
--- a/tests/BD_Shape/timeelapse1.cc
+++ b/tests/BD_Shape/timeelapse1.cc
@@ -1,6 +1,6 @@
 /* Test time_elapse_assign() for particular polyhedra.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/unconstrain1.cc b/tests/BD_Shape/unconstrain1.cc
index 215d2e1..747a36e 100644
--- a/tests/BD_Shape/unconstrain1.cc
+++ b/tests/BD_Shape/unconstrain1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::unconstrain().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/universe1.cc b/tests/BD_Shape/universe1.cc
index 427e40b..1d4b9eb 100644
--- a/tests/BD_Shape/universe1.cc
+++ b/tests/BD_Shape/universe1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::is_universe().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/upperbound1.cc b/tests/BD_Shape/upperbound1.cc
index 9d635d2..05a8c15 100644
--- a/tests/BD_Shape/upperbound1.cc
+++ b/tests/BD_Shape/upperbound1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::upper_bound_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/upperboundifexact1.cc b/tests/BD_Shape/upperboundifexact1.cc
index ed18f67..cc90f37 100644
--- a/tests/BD_Shape/upperboundifexact1.cc
+++ b/tests/BD_Shape/upperboundifexact1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/wrap1.cc b/tests/BD_Shape/wrap1.cc
index 2f66b3e..fdfcdf4 100644
--- a/tests/BD_Shape/wrap1.cc
+++ b/tests/BD_Shape/wrap1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::wrap_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/BD_Shape/writebdshape1.cc b/tests/BD_Shape/writebdshape1.cc
index 019f696..bf04e8e 100644
--- a/tests/BD_Shape/writebdshape1.cc
+++ b/tests/BD_Shape/writebdshape1.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(ostream&, const BD_Shape&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/Makefile.am b/tests/Box/Makefile.am
index 3d923cf..7b82a18 100644
--- a/tests/Box/Makefile.am
+++ b/tests/Box/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Box/Makefile.in b/tests/Box/Makefile.in
index 32134de..ca12c22 100644
--- a/tests/Box/Makefile.in
+++ b/tests/Box/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_3) $(am__EXEEXT_4)
 subdir = tests/Box
 DIST_COMMON = $(dist_check_SCRIPTS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -138,6 +155,7 @@ addconstraints1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_addspacedims1_OBJECTS = addspacedims1.$(OBJEXT)
 addspacedims1_OBJECTS = $(am_addspacedims1_OBJECTS)
 addspacedims1_LDADD = $(LDADD)
@@ -587,6 +605,18 @@ writebox1_LDADD = $(LDADD)
 writebox1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -599,20 +629,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addconstraints1_SOURCES) $(addspacedims1_SOURCES) \
 	$(affinedimension1_SOURCES) $(affineimage1_SOURCES) \
 	$(affinepreimage1_SOURCES) $(ascii_dump_load1_SOURCES) \
@@ -693,10 +719,17 @@ DIST_SOURCES = $(addconstraints1_SOURCES) $(addspacedims1_SOURCES) \
 	$(universe1_SOURCES) $(upperbound1_SOURCES) \
 	$(upperboundifexact1_SOURCES) $(wrap1_SOURCES) \
 	$(writebox1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -1510,6 +1543,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1523,7 +1570,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -1750,8 +1797,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Box/addconstraints1.cc b/tests/Box/addconstraints1.cc
index d713a8c..0dfee27 100644
--- a/tests/Box/addconstraints1.cc
+++ b/tests/Box/addconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Box::add_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/addspacedims1.cc b/tests/Box/addspacedims1.cc
index 428d8a5..0e7f489 100644
--- a/tests/Box/addspacedims1.cc
+++ b/tests/Box/addspacedims1.cc
@@ -1,7 +1,7 @@
 /* Test Box::add_space_dimensions_and_embed():
    we add two variables to a Box.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/affinedimension1.cc b/tests/Box/affinedimension1.cc
index 65f4685..cd5efe7 100644
--- a/tests/Box/affinedimension1.cc
+++ b/tests/Box/affinedimension1.cc
@@ -1,6 +1,6 @@
 /* Test Box::affine_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/affineimage1.cc b/tests/Box/affineimage1.cc
index 5339750..cf91d94 100644
--- a/tests/Box/affineimage1.cc
+++ b/tests/Box/affineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Box::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/affinepreimage1.cc b/tests/Box/affinepreimage1.cc
index 1f3ddb7..32bca96 100644
--- a/tests/Box/affinepreimage1.cc
+++ b/tests/Box/affinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Box::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/ascii_dump_load1.cc b/tests/Box/ascii_dump_load1.cc
index f9237a5..704b472 100644
--- a/tests/Box/ascii_dump_load1.cc
+++ b/tests/Box/ascii_dump_load1.cc
@@ -1,6 +1,6 @@
 /* Test Box::ascii_dump() and Box::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/bgp99extrapolation1.cc b/tests/Box/bgp99extrapolation1.cc
index c056082..0022d4f 100644
--- a/tests/Box/bgp99extrapolation1.cc
+++ b/tests/Box/bgp99extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BGP99_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/bhz03widening1.cc b/tests/Box/bhz03widening1.cc
index 19ef69a..106ffc5 100644
--- a/tests/Box/bhz03widening1.cc
+++ b/tests/Box/bhz03widening1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BHZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/bounded1.cc b/tests/Box/bounded1.cc
index 42ddb21..dabdf00 100644
--- a/tests/Box/bounded1.cc
+++ b/tests/Box/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test Box::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/boundedaffineimage1.cc b/tests/Box/boundedaffineimage1.cc
index c39fcf3..4ee40a2 100644
--- a/tests/Box/boundedaffineimage1.cc
+++ b/tests/Box/boundedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Box::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/boundedaffinepreimage1.cc b/tests/Box/boundedaffinepreimage1.cc
index 1eee1b7..ce740dc 100644
--- a/tests/Box/boundedaffinepreimage1.cc
+++ b/tests/Box/boundedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Box::bounded_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/cc76narrowing1.cc b/tests/Box/cc76narrowing1.cc
index 172dc24..0d87fc1 100644
--- a/tests/Box/cc76narrowing1.cc
+++ b/tests/Box/cc76narrowing1.cc
@@ -1,6 +1,6 @@
 /* Test Box::CC76_narrowing_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/cc76widening.cc b/tests/Box/cc76widening.cc
index 4c80c4d..b125612 100644
--- a/tests/Box/cc76widening.cc
+++ b/tests/Box/cc76widening.cc
@@ -1,6 +1,6 @@
 /* Test Box::CC76_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/concatenate1.cc b/tests/Box/concatenate1.cc
index 53f1496..45e7aa8 100644
--- a/tests/Box/concatenate1.cc
+++ b/tests/Box/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test Box::concatenate_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/congruences1.cc b/tests/Box/congruences1.cc
index 860e24b..861779f 100644
--- a/tests/Box/congruences1.cc
+++ b/tests/Box/congruences1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const Congruence_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/constrains1.cc b/tests/Box/constrains1.cc
index 76a1835..ce7bee4 100644
--- a/tests/Box/constrains1.cc
+++ b/tests/Box/constrains1.cc
@@ -1,6 +1,6 @@
 /* Test Box::constrains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,16 +23,16 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
 
-#define TEST_PREDICATE_TRUE(pred)		\
-  if (!pred) {					\
-    nout << "!" #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_TRUE(pred)               \
+  if (!pred) {                                  \
+    nout << "!" #pred << endl;                  \
+    ok = false;                                 \
   }
 
-#define TEST_PREDICATE_FALSE(pred)		\
-  if (pred) {					\
-    nout << #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_FALSE(pred)              \
+  if (pred) {                                   \
+    nout << #pred << endl;                      \
+    ok = false;                                 \
   }
 
 namespace {
diff --git a/tests/Box/constraints1.cc b/tests/Box/constraints1.cc
index 033d5c8..49ae495 100644
--- a/tests/Box/constraints1.cc
+++ b/tests/Box/constraints1.cc
@@ -1,6 +1,6 @@
 /* Test Box::constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/contains1.cc b/tests/Box/contains1.cc
index 4eb2b5c..0e09726 100644
--- a/tests/Box/contains1.cc
+++ b/tests/Box/contains1.cc
@@ -1,6 +1,6 @@
 /* Test Box::contains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/containsintegerpoint1.cc b/tests/Box/containsintegerpoint1.cc
index 4ce414f..bb87bda 100644
--- a/tests/Box/containsintegerpoint1.cc
+++ b/tests/Box/containsintegerpoint1.cc
@@ -1,6 +1,6 @@
 /* Test Box::contains_integer_point().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/difference1.cc b/tests/Box/difference1.cc
index 623b58e..208ac5c 100644
--- a/tests/Box/difference1.cc
+++ b/tests/Box/difference1.cc
@@ -1,6 +1,6 @@
 /* Test Box::difference_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/discrete1.cc b/tests/Box/discrete1.cc
index 78f51be..f69b0b2 100644
--- a/tests/Box/discrete1.cc
+++ b/tests/Box/discrete1.cc
@@ -1,6 +1,6 @@
 /* Test Box::is_discrete().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/disjoint1.cc b/tests/Box/disjoint1.cc
index 64ac523..44861d2 100644
--- a/tests/Box/disjoint1.cc
+++ b/tests/Box/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test Box::is_disjoint_from(const Box& y).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/empty1.cc b/tests/Box/empty1.cc
index 26b894e..dd60569 100644
--- a/tests/Box/empty1.cc
+++ b/tests/Box/empty1.cc
@@ -1,6 +1,6 @@
 /* Different ways of creating an empty Box.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/equality1.cc b/tests/Box/equality1.cc
index 30f6e72..df59182 100644
--- a/tests/Box/equality1.cc
+++ b/tests/Box/equality1.cc
@@ -1,6 +1,6 @@
 /* Test Box::operator==().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/expandspacedim1.cc b/tests/Box/expandspacedim1.cc
index d8410b4..e11ad1a 100644
--- a/tests/Box/expandspacedim1.cc
+++ b/tests/Box/expandspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Box::expand_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/foldspacedims1.cc b/tests/Box/foldspacedims1.cc
index a3bb7e0..a6cb5ba 100644
--- a/tests/Box/foldspacedims1.cc
+++ b/tests/Box/foldspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Box::fold_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/frequency1.cc b/tests/Box/frequency1.cc
index 22f56e5..7ab5a4e 100644
--- a/tests/Box/frequency1.cc
+++ b/tests/Box/frequency1.cc
@@ -1,6 +1,6 @@
 /* Test Box::frequency().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/frombdshape1.cc b/tests/Box/frombdshape1.cc
index e39ef4b..9f28610 100644
--- a/tests/Box/frombdshape1.cc
+++ b/tests/Box/frombdshape1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const BD_Shape&, Complexity_Class).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/frombox1.cc b/tests/Box/frombox1.cc
index 739e3db..742c36a 100644
--- a/tests/Box/frombox1.cc
+++ b/tests/Box/frombox1.cc
@@ -1,6 +1,6 @@
 /* Test Box<Interval>::Box(const Box<Other_Interval>&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/fromgensys1.cc b/tests/Box/fromgensys1.cc
index e5a806c..44df261 100644
--- a/tests/Box/fromgensys1.cc
+++ b/tests/Box/fromgensys1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const Generator_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/fromgrid1.cc b/tests/Box/fromgrid1.cc
index 8d17e23..3aea0f3 100644
--- a/tests/Box/fromgrid1.cc
+++ b/tests/Box/fromgrid1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const Grid&, Complexity_Class).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/frompartiallyreducedproduct1.cc b/tests/Box/frompartiallyreducedproduct1.cc
index f6b758a..2000dd1 100644
--- a/tests/Box/frompartiallyreducedproduct1.cc
+++ b/tests/Box/frompartiallyreducedproduct1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const Direct_Product<D1, D2>&, Complexity_Class).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/frompolyhedron1.cc b/tests/Box/frompolyhedron1.cc
index e9578f9..eeb56fd 100644
--- a/tests/Box/frompolyhedron1.cc
+++ b/tests/Box/frompolyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const Polyhedron&, Complexity_Class).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/frompolyhedron2.cc b/tests/Box/frompolyhedron2.cc
index 7441e14..f88d563 100644
--- a/tests/Box/frompolyhedron2.cc
+++ b/tests/Box/frompolyhedron2.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(const NNC_Polyhedron&, Complexity_Class).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/fromspacedim1.cc b/tests/Box/fromspacedim1.cc
index aa736e3..6aa0aee 100644
--- a/tests/Box/fromspacedim1.cc
+++ b/tests/Box/fromspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Box::Box(dimension_type, Degenerate_Element).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/generalizedaffineimage1.cc b/tests/Box/generalizedaffineimage1.cc
index 789fb1d..7792965 100644
--- a/tests/Box/generalizedaffineimage1.cc
+++ b/tests/Box/generalizedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Box::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/generalizedaffineimage2.cc b/tests/Box/generalizedaffineimage2.cc
index 10c44e2..2270dd3 100644
--- a/tests/Box/generalizedaffineimage2.cc
+++ b/tests/Box/generalizedaffineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Box::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/generalizedaffinepreimage1.cc b/tests/Box/generalizedaffinepreimage1.cc
index 1de8021..816edcc 100644
--- a/tests/Box/generalizedaffinepreimage1.cc
+++ b/tests/Box/generalizedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /*Test Box::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/geomcovers1.cc b/tests/Box/geomcovers1.cc
index 7e10521..8b95cc5 100644
--- a/tests/Box/geomcovers1.cc
+++ b/tests/Box/geomcovers1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<Box>::geometrically_covers().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/intersection1.cc b/tests/Box/intersection1.cc
index f1e5bcb..015e7a4 100644
--- a/tests/Box/intersection1.cc
+++ b/tests/Box/intersection1.cc
@@ -1,6 +1,6 @@
 /* Test Box::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/interval1.cc b/tests/Box/interval1.cc
index 4c59a54..5d8efbe 100644
--- a/tests/Box/interval1.cc
+++ b/tests/Box/interval1.cc
@@ -1,7 +1,7 @@
 /* Test Box::add_space_dimensions_and_embed():
    we add two variables to a Box.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/limitedcc76extrapolation1.cc b/tests/Box/limitedcc76extrapolation1.cc
index a2be344..a15caab 100644
--- a/tests/Box/limitedcc76extrapolation1.cc
+++ b/tests/Box/limitedcc76extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Box::limited_CC76_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/mapspacedims1.cc b/tests/Box/mapspacedims1.cc
index 1e90432..d194122 100644
--- a/tests/Box/mapspacedims1.cc
+++ b/tests/Box/mapspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Box::map_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/max_min1.cc b/tests/Box/max_min1.cc
index 513eac8..81eec69 100644
--- a/tests/Box/max_min1.cc
+++ b/tests/Box/max_min1.cc
@@ -1,7 +1,7 @@
 /* Test Box::maximize(const Linear_Expression&, ...)
    and Box::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/maxspacedim1.cc b/tests/Box/maxspacedim1.cc
index 35e10a1..b194d6c 100644
--- a/tests/Box/maxspacedim1.cc
+++ b/tests/Box/maxspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Box::max_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/membytes1.cc b/tests/Box/membytes1.cc
index 4649659..a2a99c5 100644
--- a/tests/Box/membytes1.cc
+++ b/tests/Box/membytes1.cc
@@ -1,6 +1,6 @@
 /* Test the total_memory_in_bytes() and external_memory_in_bytes() methods.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/minconstraints1.cc b/tests/Box/minconstraints1.cc
index d9960f5..c21ac34 100644
--- a/tests/Box/minconstraints1.cc
+++ b/tests/Box/minconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Box<T>::minimized_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/propagateconstraints1.cc b/tests/Box/propagateconstraints1.cc
index b7aac8f..79a3d24 100644
--- a/tests/Box/propagateconstraints1.cc
+++ b/tests/Box/propagateconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Box::propagate_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/propagateconstraints2.cc b/tests/Box/propagateconstraints2.cc
index a17acb8..3a18d5f 100644
--- a/tests/Box/propagateconstraints2.cc
+++ b/tests/Box/propagateconstraints2.cc
@@ -1,6 +1,6 @@
 /* Test Box::propagate_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/refinewithcongruence1.cc b/tests/Box/refinewithcongruence1.cc
index 6b61c50..9def123 100644
--- a/tests/Box/refinewithcongruence1.cc
+++ b/tests/Box/refinewithcongruence1.cc
@@ -1,6 +1,6 @@
 /* Test Box::refine_with_congruences(const Congruence_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -191,5 +191,7 @@ BEGIN_MAIN
   DO_TEST(test02);
   DO_TEST(test03);
   DO_TEST(test04);
+  DO_TEST(test05);
+  DO_TEST(test06);
   DO_TEST(test07);
 END_MAIN
diff --git a/tests/Box/refinewithcongruences1.cc b/tests/Box/refinewithcongruences1.cc
index 020fb90..3f4a8d0 100644
--- a/tests/Box/refinewithcongruences1.cc
+++ b/tests/Box/refinewithcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test Box::refine_with_congruences(const Congruence_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -122,7 +122,8 @@ test05() {
   cgs.insert(B %= 0);
   cgs.insert(C %= 7);
 
-  TBox box(cgs);
+  TBox box(3);
+  box.refine_with_congruences(cgs);
 
   TBox box1(box.congruences());
 
@@ -147,16 +148,13 @@ test06() {
   Congruence_System cgs;
   cgs.insert((A %= 7) / 0);
   cgs.insert((B %= 3) / 0);
-  // This inconsistent equality is ignored when congruences
-  // are added to the box.
   cgs.insert((A + B %= 0) / 0);
   cgs.insert(C %= 7);
 
-  TBox box(cgs);
+  TBox box(3);
+  box.refine_with_congruences(cgs);
 
-  Rational_Box known_result(3);
-  known_result.add_constraint(A == 7);
-  known_result.add_constraint(B == 3);
+  Rational_Box known_result(3, EMPTY);
 
   bool ok = check_result(box, known_result);
 
@@ -376,6 +374,8 @@ BEGIN_MAIN
   DO_TEST(test02);
   DO_TEST(test03);
   DO_TEST(test04);
+  DO_TEST(test05);
+  DO_TEST(test06);
   DO_TEST(test07);
   DO_TEST(test08);
   DO_TEST(test09);
diff --git a/tests/Box/refinewithconstraint1.cc b/tests/Box/refinewithconstraint1.cc
index fbb7acc..50d9f0f 100644
--- a/tests/Box/refinewithconstraint1.cc
+++ b/tests/Box/refinewithconstraint1.cc
@@ -1,6 +1,6 @@
 /* Test Box::refine_with_constraint(const Constraint&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/refinewithconstraint2.cc b/tests/Box/refinewithconstraint2.cc
index c5b71b0..98934db 100644
--- a/tests/Box/refinewithconstraint2.cc
+++ b/tests/Box/refinewithconstraint2.cc
@@ -1,6 +1,6 @@
 /* Test Box::refine_with_constraint(const Constraint&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/refinewithconstraints1.cc b/tests/Box/refinewithconstraints1.cc
index fc986c6..2f2de64 100644
--- a/tests/Box/refinewithconstraints1.cc
+++ b/tests/Box/refinewithconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Box::refine_with_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/refinewithconstraints2.cc b/tests/Box/refinewithconstraints2.cc
index 39f04fb..3e30eda 100644
--- a/tests/Box/refinewithconstraints2.cc
+++ b/tests/Box/refinewithconstraints2.cc
@@ -1,7 +1,7 @@
 /* Test Box::refine_with_constraints(const Constraint_System&) with
    instances that may require a watchdog timer.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/relations1.cc b/tests/Box/relations1.cc
index 5d4732c..af5a5a2 100644
--- a/tests/Box/relations1.cc
+++ b/tests/Box/relations1.cc
@@ -1,6 +1,6 @@
 /* Test Box::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/relations2.cc b/tests/Box/relations2.cc
index cbc8620..bd1833d 100644
--- a/tests/Box/relations2.cc
+++ b/tests/Box/relations2.cc
@@ -1,6 +1,6 @@
 /* Test Box::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/relations3.cc b/tests/Box/relations3.cc
index 350a283..4a20c8a 100644
--- a/tests/Box/relations3.cc
+++ b/tests/Box/relations3.cc
@@ -1,6 +1,6 @@
 /* Test Box::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/relations4.cc b/tests/Box/relations4.cc
index 83b1f02..342d2f3 100644
--- a/tests/Box/relations4.cc
+++ b/tests/Box/relations4.cc
@@ -1,6 +1,6 @@
 /* Test Box::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/removespacedims1.cc b/tests/Box/removespacedims1.cc
index 4ace914..4ebc992 100644
--- a/tests/Box/removespacedims1.cc
+++ b/tests/Box/removespacedims1.cc
@@ -1,6 +1,6 @@
 /* Remove some variables from the space.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/run_tests b/tests/Box/run_tests
index dff47d6..6a9c2b4 100755
--- a/tests/Box/run_tests
+++ b/tests/Box/run_tests
@@ -2,7 +2,7 @@
 
 # Run the Box tests.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Box/simplifyusingcontext1.cc b/tests/Box/simplifyusingcontext1.cc
index 7afc558..83a2e53 100644
--- a/tests/Box/simplifyusingcontext1.cc
+++ b/tests/Box/simplifyusingcontext1.cc
@@ -1,6 +1,6 @@
 /* Test Box::simplify_using_context_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/timeelapse1.cc b/tests/Box/timeelapse1.cc
index c6c4a2c..06af25c 100644
--- a/tests/Box/timeelapse1.cc
+++ b/tests/Box/timeelapse1.cc
@@ -1,6 +1,6 @@
 /* Test Box<Interval>::time_elapse_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/topclosed1.cc b/tests/Box/topclosed1.cc
index f299abe..9a32cb8 100644
--- a/tests/Box/topclosed1.cc
+++ b/tests/Box/topclosed1.cc
@@ -1,6 +1,6 @@
 /* Test Box::is_topologically_closed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/unconstrain1.cc b/tests/Box/unconstrain1.cc
index 94c70f7..00ac3ca 100644
--- a/tests/Box/unconstrain1.cc
+++ b/tests/Box/unconstrain1.cc
@@ -1,6 +1,6 @@
 /* Test Box::unconstrain().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/universe1.cc b/tests/Box/universe1.cc
index a25513d..e169b3f 100644
--- a/tests/Box/universe1.cc
+++ b/tests/Box/universe1.cc
@@ -1,6 +1,6 @@
 /* Test Box::is_universe().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/upperbound1.cc b/tests/Box/upperbound1.cc
index d011423..f46b881 100644
--- a/tests/Box/upperbound1.cc
+++ b/tests/Box/upperbound1.cc
@@ -1,6 +1,6 @@
 /* Test Box::upper_bound_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/upperboundifexact1.cc b/tests/Box/upperboundifexact1.cc
index 52e7a65..0022fd3 100644
--- a/tests/Box/upperboundifexact1.cc
+++ b/tests/Box/upperboundifexact1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/wrap1.cc b/tests/Box/wrap1.cc
index 87e722f..a579d0e 100644
--- a/tests/Box/wrap1.cc
+++ b/tests/Box/wrap1.cc
@@ -1,6 +1,6 @@
 /* Test Box::wrap_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Box/writebox1.cc b/tests/Box/writebox1.cc
index d7231ae..a54a49e 100644
--- a/tests/Box/writebox1.cc
+++ b/tests/Box/writebox1.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(ostream&, const Box&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/CO_Tree/Makefile.am b/tests/CO_Tree/Makefile.am
index a7a8cee..12048cc 100644
--- a/tests/CO_Tree/Makefile.am
+++ b/tests/CO_Tree/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/CO_Tree/Makefile.in b/tests/CO_Tree/Makefile.in
index d09f082..ea17ce8 100644
--- a/tests/CO_Tree/Makefile.in
+++ b/tests/CO_Tree/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ TESTS = cotree1$(EXEEXT)
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1) $(am__EXEEXT_2)
 subdir = tests/CO_Tree
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -104,6 +121,19 @@ cotree1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -116,26 +146,29 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(cotree1_SOURCES)
 DIST_SOURCES = $(cotree1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -488,6 +521,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -501,7 +548,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -724,8 +771,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/CO_Tree/cotree1.cc b/tests/CO_Tree/cotree1.cc
index b65d6ef..c0a5361 100644
--- a/tests/CO_Tree/cotree1.cc
+++ b/tests/CO_Tree/cotree1.cc
@@ -1,6 +1,6 @@
 /* Test the CO_Tree class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/C_Expr.cc b/tests/Concrete_Expression/C_Expr.cc
index 25c8c79..977b71b 100644
--- a/tests/Concrete_Expression/C_Expr.cc
+++ b/tests/Concrete_Expression/C_Expr.cc
@@ -1,7 +1,7 @@
 /* Definitions for the C_Expr class and its subclasses: non-inline,
    non-template functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -24,7 +24,7 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
 
-#include "C_Expr.defs.hh"
+#include "C_Expr_defs.hh"
 
 int
 main() {
diff --git a/tests/Concrete_Expression/C_Expr.defs.hh b/tests/Concrete_Expression/C_Expr.defs.hh
deleted file mode 100644
index 9e109bc..0000000
--- a/tests/Concrete_Expression/C_Expr.defs.hh
+++ /dev/null
@@ -1,257 +0,0 @@
-/* Declarations for the C_Expr class and its subclasses.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_C_Expr_defs_hh
-#define PPL_C_Expr_defs_hh 1
-
-#include "Concrete_Expression.defs.hh"
-
-namespace Parma_Polyhedra_Library {
-
-struct C_Expr;
-
-enum C_Expr_Kind {
-  BOP,
-  UOP,
-  CAST,
-  INT_CON,
-  FP_CON,
-  APPROX_REF
-};
-
-//! Toy class for testing analysis of floating point computations.
-template <>
-class Concrete_Expression<C_Expr> : public Concrete_Expression_Common<C_Expr> {
-public:
-  //! Builds a concrete expression of the given kind.
-  Concrete_Expression<C_Expr>(Concrete_Expression_Type type, C_Expr_Kind KIND);
-
-  //! Returns the type of \* this.
-  Concrete_Expression_Type type() const;
-
-  //! Returns the kind of \* this.
-  Concrete_Expression_Kind kind() const;
-
-  //! The expression's type.
-  Concrete_Expression_Type expr_type;
-
-  //! The expression's kind.
-  C_Expr_Kind expr_kind;
-};
-
-template <>
-class Binary_Operator<C_Expr> : public Concrete_Expression<C_Expr>,
-                                public Binary_Operator_Common<C_Expr> {
-public:
-  //! Constructor from operator, lhs and rhs.
-  Binary_Operator<C_Expr>(Concrete_Expression_Type type,
-                          Concrete_Expression_BOP binary_operator,
-                          const Concrete_Expression<C_Expr>* left_hand_side,
-                          const Concrete_Expression<C_Expr>* right_hand_side);
-
-  //! Do-nothing destructor.
-  ~Binary_Operator<C_Expr>();
-
-  //! Returns the type of \p *this.
-  Concrete_Expression_Type type() const;
-
-  //! Returns the binary operator of \p *this.
-  Concrete_Expression_BOP binary_operator() const;
-
-  //! Returns the left-hand side of \p *this.
-  const Concrete_Expression<C_Expr>* left_hand_side() const;
-
-  //! Returns the right-hand side of \p *this.
-  const Concrete_Expression<C_Expr>* right_hand_side() const;
-
-  //! Constant identifying binary operator nodes.
-  enum Kind {
-    KIND = BOP
-  };
-
-  //! Constants encoding the different binary operators.
-  enum Operation {
-    ADD,
-    SUB,
-    MUL,
-    DIV,
-    REM,
-    BAND,
-    BOR,
-    BXOR,
-    LSHIFT,
-    RSHIFT
-  };
-
-  //! The operator of \p *this.
-  const Concrete_Expression_BOP bop;
-
-  //! The left-hand side of \p *this.
-  const Concrete_Expression<C_Expr>* lhs;
-
-  //! The right-hand side of \p *this.
-  const Concrete_Expression<C_Expr>* rhs;
-};
-
-template <>
-class Unary_Operator<C_Expr> : public Concrete_Expression<C_Expr>,
-                               public Unary_Operator_Common<C_Expr> {
-public:
-  //! Constructor from operator and argument.
-  Unary_Operator<C_Expr>(Concrete_Expression_Type type,
-                         Concrete_Expression_UOP unary_operator,
-                         const Concrete_Expression<C_Expr>* argument);
-
-  //! Do-nothing destructor.
-  ~Unary_Operator<C_Expr>();
-
-  //! Returns the type of \p *this.
-  Concrete_Expression_Type type() const;
-
-  //! Returns the unary operator of \p *this.
-  Concrete_Expression_UOP unary_operator() const;
-
-  //! Returns the argument of \p *this.
-  const Concrete_Expression<C_Expr>* argument() const;
-
-  //! Constant identifying unary operator nodes.
-  enum Kind {
-    KIND = UOP
-  };
-
-  //! Constants encoding the different unary operators.
-  enum Operation {
-    UPLUS,
-    UMINUS,
-    BNOT
-  };
-
-  //! The operator of \p *this.
-  const Concrete_Expression_UOP uop;
-
-  //! The argument of \p *this.
-  const Concrete_Expression<C_Expr>* arg;
-};
-
-template <>
-class Cast_Operator<C_Expr>
-  : public Concrete_Expression<C_Expr>,
-    public Cast_Operator_Common<C_Expr> {
-public:
-  //! Constructor from cast type and argument.
-  Cast_Operator<C_Expr>(Concrete_Expression_Type type,
-                        const Concrete_Expression<C_Expr>* ar);
-
-  //! Do-nothing destructor.
-  ~Cast_Operator<C_Expr>();
-
-  //! Returns the type of \p *this.
-  Concrete_Expression_Type type() const;
-
-  //! Returns the casted expression.
-  const Concrete_Expression<C_Expr>* argument() const;
-
-  //! Constant identifying cast nodes.
-  enum Kind { KIND = CAST };
-
-  //! The casted expression.
-  const Concrete_Expression<C_Expr>* arg;
-};
-
-template <>
-class Integer_Constant<C_Expr>
-  : public Concrete_Expression<C_Expr>,
-    public Integer_Constant_Common<C_Expr> {
-public:
-  //! Constructor from type and value.
-  Integer_Constant<C_Expr>(Concrete_Expression_Type type,
-                  const Integer_Interval& val);
-
-  //! Do-nothing destructor.
-  ~Integer_Constant<C_Expr>();
-
-  //! Returns the type of \p *this.
-  Concrete_Expression_Type type() const;
-
-  //! Constant identifying integer constant nodes.
-  enum Kind { KIND = INT_CON };
-
-  //! An interval in which the value of the constant falls.
-  Integer_Interval value;
-};
-
-template <>
-class Floating_Point_Constant<C_Expr>
-  : public Concrete_Expression<C_Expr>,
-    public Floating_Point_Constant_Common<C_Expr> {
-public:
-  //! Constructor from value.
-  Floating_Point_Constant<C_Expr>(const char* value_string,
-                                  unsigned int string_size);
-
-  //! Do-nothing destructor.
-  ~Floating_Point_Constant<C_Expr>();
-
-  //! Returns the type of \p *this.
-  Concrete_Expression_Type type() const;
-
-  //! Constant identifying floating constant nodes.
-  enum Kind { KIND = FP_CON };
-
-  //! The floating point constant as written.
-  char* value;
-};
-
-// The use of Integer_Interval here is for simplicity only.
-template <>
-class Approximable_Reference<C_Expr>
-  : public Concrete_Expression<C_Expr>,
-    public Approximable_Reference_Common<C_Expr> {
-public:
-  //! Builds a reference to the entity having the given index.
-  Approximable_Reference<C_Expr>(Concrete_Expression_Type type,
-				 const Integer_Interval& val,
-                                 dimension_type index);
-
-  //! Do-nothing destructor.
-  ~Approximable_Reference<C_Expr>();
-
-  //! Returns the type of \p *this.
-  Concrete_Expression_Type type() const;
-
-  //! Constant identifying approximable reference nodes.
-  enum Kind { KIND = APPROX_REF };
-
-  //! An interval in which the referenced entity's value falls.
-  Integer_Interval value;
-
-  //! The set of possible indexes for the referenced entity.
-  std::set<dimension_type> dimensions;
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "C_Expr.inlines.hh"
-//#include "C_Expr.templates.hh"
-
-#endif // !defined(PPL_C_Expr_defs_hh)
diff --git a/tests/Concrete_Expression/C_Expr.inlines.hh b/tests/Concrete_Expression/C_Expr.inlines.hh
deleted file mode 100644
index 8ae81fd..0000000
--- a/tests/Concrete_Expression/C_Expr.inlines.hh
+++ /dev/null
@@ -1,187 +0,0 @@
-/* Definitions for the C_Expr class and its subclasses: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_C_Expr_inlines_hh
-#define PPL_C_Expr_inlines_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-inline
-Concrete_Expression<C_Expr>::
-Concrete_Expression(const Concrete_Expression_Type type,
-                    const C_Expr_Kind KIND)
-  : expr_type(type),
-    expr_kind(KIND) {
-}
-
-inline Concrete_Expression_Kind
-Concrete_Expression<C_Expr>::kind() const {
-  return expr_kind;
-}
-
-inline Concrete_Expression_Type
-Concrete_Expression<C_Expr>::type() const {
-  return expr_type;
-}
-
-inline
-Binary_Operator<C_Expr>
-::Binary_Operator(const Concrete_Expression_Type type,
-                  const Concrete_Expression_BOP binary_operator,
-                  const Concrete_Expression<C_Expr>* left_hand_side,
-                  const Concrete_Expression<C_Expr>* right_hand_side)
-  : Concrete_Expression<C_Expr>(type, BOP),
-    bop(binary_operator),
-    lhs(left_hand_side),
-    rhs(right_hand_side) {
-}
-
-inline
-Binary_Operator<C_Expr>::~Binary_Operator<C_Expr>() {
-}
-
-inline Concrete_Expression_Type
-Binary_Operator<C_Expr>::type() const {
-  return expr_type;
-}
-
-inline Concrete_Expression_BOP
-Binary_Operator<C_Expr>::binary_operator() const {
-  return bop;
-}
-
-inline const Concrete_Expression<C_Expr>*
-Binary_Operator<C_Expr>::left_hand_side() const {
-  return lhs;
-}
-
-inline const Concrete_Expression<C_Expr>*
-Binary_Operator<C_Expr>::right_hand_side() const {
-  return rhs;
-}
-
-inline
-Unary_Operator<C_Expr>
-::Unary_Operator(const Concrete_Expression_Type type,
-                 const Concrete_Expression_UOP unary_operator,
-                 const Concrete_Expression<C_Expr>* argument)
-  : Concrete_Expression<C_Expr>(type, UOP),
-    uop(unary_operator),
-    arg(argument) {
-}
-
-inline
-Unary_Operator<C_Expr>::~Unary_Operator<C_Expr>() {
-}
-
-inline Concrete_Expression_Type
-Unary_Operator<C_Expr>::type() const {
-  return expr_type;
-}
-
-inline Concrete_Expression_BOP
-Unary_Operator<C_Expr>::unary_operator() const {
-  return uop;
-}
-
-inline const Concrete_Expression<C_Expr>*
-Unary_Operator<C_Expr>::argument() const {
-  return arg;
-}
-
-inline
-Cast_Operator<C_Expr>::
-Cast_Operator(const Concrete_Expression_Type type,
-              const Concrete_Expression<C_Expr>* ar)
-  : Concrete_Expression<C_Expr>(type, CAST),
-    arg(ar) {
-}
-
-inline
-Cast_Operator<C_Expr>::~Cast_Operator<C_Expr>() {
-}
-
-inline Concrete_Expression_Type
-Cast_Operator<C_Expr>::type() const {
-  return expr_type;
-}
-
-inline const Concrete_Expression<C_Expr>*
-Cast_Operator<C_Expr>::argument() const {
-  return arg;
-}
-
-inline
-Integer_Constant<C_Expr>::
-Integer_Constant(Concrete_Expression_Type type,
-                 const Integer_Interval& val)
-  : Concrete_Expression<C_Expr>(type, INT_CON),
-    value(val) {
-}
-
-inline
-Integer_Constant<C_Expr>::~Integer_Constant<C_Expr>() {
-}
-
-inline
-Floating_Point_Constant<C_Expr>::
-Floating_Point_Constant(const char* value_string,
-                        const unsigned int string_size)
-  : Concrete_Expression<C_Expr>(Concrete_Expression_Type::floating_point(ANALYZED_FP_FORMAT), FP_CON),
-    value(new char[string_size]) {
-  strcpy(value, value_string);
-}
-
-inline
-Floating_Point_Constant<C_Expr>::~Floating_Point_Constant<C_Expr>() {
-  delete[] value;
-}
-
-inline Concrete_Expression_Type
-Floating_Point_Constant<C_Expr>::type() const {
-  return expr_type;
-}
-
-inline
-Approximable_Reference<C_Expr>::
-Approximable_Reference(Concrete_Expression_Type type,
-		       const Integer_Interval& val,
-                       dimension_type index)
-  : Concrete_Expression<C_Expr>(type, APPROX_REF),
-    value(val),
-    dimensions() {
-  dimensions.insert(index);
-}
-
-inline
-Approximable_Reference<C_Expr>::~Approximable_Reference<C_Expr>() {
-}
-
-inline Concrete_Expression_Type
-Approximable_Reference<C_Expr>::type() const {
-  return expr_type;
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_C_Expr_inlines_hh)
diff --git a/tests/Concrete_Expression/C_Expr_defs.hh b/tests/Concrete_Expression/C_Expr_defs.hh
new file mode 100644
index 0000000..a635a19
--- /dev/null
+++ b/tests/Concrete_Expression/C_Expr_defs.hh
@@ -0,0 +1,257 @@
+/* Declarations for the C_Expr class and its subclasses.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_C_Expr_defs_hh
+#define PPL_C_Expr_defs_hh 1
+
+#include "Concrete_Expression_defs.hh"
+
+namespace Parma_Polyhedra_Library {
+
+struct C_Expr;
+
+enum C_Expr_Kind {
+  BOP,
+  UOP,
+  CAST,
+  INT_CON,
+  FP_CON,
+  APPROX_REF
+};
+
+//! Toy class for testing analysis of floating point computations.
+template <>
+class Concrete_Expression<C_Expr> : public Concrete_Expression_Common<C_Expr> {
+public:
+  //! Builds a concrete expression of the given kind.
+  Concrete_Expression<C_Expr>(Concrete_Expression_Type type, C_Expr_Kind KIND);
+
+  //! Returns the type of \* this.
+  Concrete_Expression_Type type() const;
+
+  //! Returns the kind of \* this.
+  Concrete_Expression_Kind kind() const;
+
+  //! The expression's type.
+  Concrete_Expression_Type expr_type;
+
+  //! The expression's kind.
+  C_Expr_Kind expr_kind;
+};
+
+template <>
+class Binary_Operator<C_Expr> : public Concrete_Expression<C_Expr>,
+                                public Binary_Operator_Common<C_Expr> {
+public:
+  //! Constructor from operator, lhs and rhs.
+  Binary_Operator<C_Expr>(Concrete_Expression_Type type,
+                          Concrete_Expression_BOP binary_operator,
+                          const Concrete_Expression<C_Expr>* left_hand_side,
+                          const Concrete_Expression<C_Expr>* right_hand_side);
+
+  //! Do-nothing destructor.
+  ~Binary_Operator<C_Expr>();
+
+  //! Returns the type of \p *this.
+  Concrete_Expression_Type type() const;
+
+  //! Returns the binary operator of \p *this.
+  Concrete_Expression_BOP binary_operator() const;
+
+  //! Returns the left-hand side of \p *this.
+  const Concrete_Expression<C_Expr>* left_hand_side() const;
+
+  //! Returns the right-hand side of \p *this.
+  const Concrete_Expression<C_Expr>* right_hand_side() const;
+
+  //! Constant identifying binary operator nodes.
+  enum Kind {
+    KIND = BOP
+  };
+
+  //! Constants encoding the different binary operators.
+  enum Operation {
+    ADD,
+    SUB,
+    MUL,
+    DIV,
+    REM,
+    BAND,
+    BOR,
+    BXOR,
+    LSHIFT,
+    RSHIFT
+  };
+
+  //! The operator of \p *this.
+  const Concrete_Expression_BOP bop;
+
+  //! The left-hand side of \p *this.
+  const Concrete_Expression<C_Expr>* lhs;
+
+  //! The right-hand side of \p *this.
+  const Concrete_Expression<C_Expr>* rhs;
+};
+
+template <>
+class Unary_Operator<C_Expr> : public Concrete_Expression<C_Expr>,
+                               public Unary_Operator_Common<C_Expr> {
+public:
+  //! Constructor from operator and argument.
+  Unary_Operator<C_Expr>(Concrete_Expression_Type type,
+                         Concrete_Expression_UOP unary_operator,
+                         const Concrete_Expression<C_Expr>* argument);
+
+  //! Do-nothing destructor.
+  ~Unary_Operator<C_Expr>();
+
+  //! Returns the type of \p *this.
+  Concrete_Expression_Type type() const;
+
+  //! Returns the unary operator of \p *this.
+  Concrete_Expression_UOP unary_operator() const;
+
+  //! Returns the argument of \p *this.
+  const Concrete_Expression<C_Expr>* argument() const;
+
+  //! Constant identifying unary operator nodes.
+  enum Kind {
+    KIND = UOP
+  };
+
+  //! Constants encoding the different unary operators.
+  enum Operation {
+    UPLUS,
+    UMINUS,
+    BNOT
+  };
+
+  //! The operator of \p *this.
+  const Concrete_Expression_UOP uop;
+
+  //! The argument of \p *this.
+  const Concrete_Expression<C_Expr>* arg;
+};
+
+template <>
+class Cast_Operator<C_Expr>
+  : public Concrete_Expression<C_Expr>,
+    public Cast_Operator_Common<C_Expr> {
+public:
+  //! Constructor from cast type and argument.
+  Cast_Operator<C_Expr>(Concrete_Expression_Type type,
+                        const Concrete_Expression<C_Expr>* ar);
+
+  //! Do-nothing destructor.
+  ~Cast_Operator<C_Expr>();
+
+  //! Returns the type of \p *this.
+  Concrete_Expression_Type type() const;
+
+  //! Returns the casted expression.
+  const Concrete_Expression<C_Expr>* argument() const;
+
+  //! Constant identifying cast nodes.
+  enum Kind { KIND = CAST };
+
+  //! The casted expression.
+  const Concrete_Expression<C_Expr>* arg;
+};
+
+template <>
+class Integer_Constant<C_Expr>
+  : public Concrete_Expression<C_Expr>,
+    public Integer_Constant_Common<C_Expr> {
+public:
+  //! Constructor from type and value.
+  Integer_Constant<C_Expr>(Concrete_Expression_Type type,
+                  const Integer_Interval& val);
+
+  //! Do-nothing destructor.
+  ~Integer_Constant<C_Expr>();
+
+  //! Returns the type of \p *this.
+  Concrete_Expression_Type type() const;
+
+  //! Constant identifying integer constant nodes.
+  enum Kind { KIND = INT_CON };
+
+  //! An interval in which the value of the constant falls.
+  Integer_Interval value;
+};
+
+template <>
+class Floating_Point_Constant<C_Expr>
+  : public Concrete_Expression<C_Expr>,
+    public Floating_Point_Constant_Common<C_Expr> {
+public:
+  //! Constructor from value.
+  Floating_Point_Constant<C_Expr>(const char* value_string,
+                                  unsigned int string_size);
+
+  //! Do-nothing destructor.
+  ~Floating_Point_Constant<C_Expr>();
+
+  //! Returns the type of \p *this.
+  Concrete_Expression_Type type() const;
+
+  //! Constant identifying floating constant nodes.
+  enum Kind { KIND = FP_CON };
+
+  //! The floating point constant as written.
+  char* value;
+};
+
+// The use of Integer_Interval here is for simplicity only.
+template <>
+class Approximable_Reference<C_Expr>
+  : public Concrete_Expression<C_Expr>,
+    public Approximable_Reference_Common<C_Expr> {
+public:
+  //! Builds a reference to the entity having the given index.
+  Approximable_Reference<C_Expr>(Concrete_Expression_Type type,
+                                 const Integer_Interval& val,
+                                 dimension_type index);
+
+  //! Do-nothing destructor.
+  ~Approximable_Reference<C_Expr>();
+
+  //! Returns the type of \p *this.
+  Concrete_Expression_Type type() const;
+
+  //! Constant identifying approximable reference nodes.
+  enum Kind { KIND = APPROX_REF };
+
+  //! An interval in which the referenced entity's value falls.
+  Integer_Interval value;
+
+  //! The set of possible indexes for the referenced entity.
+  std::set<dimension_type> dimensions;
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "C_Expr_inlines.hh"
+//#include "C_Expr_templates.hh"
+
+#endif // !defined(PPL_C_Expr_defs_hh)
diff --git a/tests/Concrete_Expression/C_Expr_inlines.hh b/tests/Concrete_Expression/C_Expr_inlines.hh
new file mode 100644
index 0000000..c35f888
--- /dev/null
+++ b/tests/Concrete_Expression/C_Expr_inlines.hh
@@ -0,0 +1,187 @@
+/* Definitions for the C_Expr class and its subclasses: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_C_Expr_inlines_hh
+#define PPL_C_Expr_inlines_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+inline
+Concrete_Expression<C_Expr>::
+Concrete_Expression(const Concrete_Expression_Type type,
+                    const C_Expr_Kind KIND)
+  : expr_type(type),
+    expr_kind(KIND) {
+}
+
+inline Concrete_Expression_Kind
+Concrete_Expression<C_Expr>::kind() const {
+  return expr_kind;
+}
+
+inline Concrete_Expression_Type
+Concrete_Expression<C_Expr>::type() const {
+  return expr_type;
+}
+
+inline
+Binary_Operator<C_Expr>
+::Binary_Operator(const Concrete_Expression_Type type,
+                  const Concrete_Expression_BOP binary_operator,
+                  const Concrete_Expression<C_Expr>* left_hand_side,
+                  const Concrete_Expression<C_Expr>* right_hand_side)
+  : Concrete_Expression<C_Expr>(type, BOP),
+    bop(binary_operator),
+    lhs(left_hand_side),
+    rhs(right_hand_side) {
+}
+
+inline
+Binary_Operator<C_Expr>::~Binary_Operator<C_Expr>() {
+}
+
+inline Concrete_Expression_Type
+Binary_Operator<C_Expr>::type() const {
+  return expr_type;
+}
+
+inline Concrete_Expression_BOP
+Binary_Operator<C_Expr>::binary_operator() const {
+  return bop;
+}
+
+inline const Concrete_Expression<C_Expr>*
+Binary_Operator<C_Expr>::left_hand_side() const {
+  return lhs;
+}
+
+inline const Concrete_Expression<C_Expr>*
+Binary_Operator<C_Expr>::right_hand_side() const {
+  return rhs;
+}
+
+inline
+Unary_Operator<C_Expr>
+::Unary_Operator(const Concrete_Expression_Type type,
+                 const Concrete_Expression_UOP unary_operator,
+                 const Concrete_Expression<C_Expr>* argument)
+  : Concrete_Expression<C_Expr>(type, UOP),
+    uop(unary_operator),
+    arg(argument) {
+}
+
+inline
+Unary_Operator<C_Expr>::~Unary_Operator<C_Expr>() {
+}
+
+inline Concrete_Expression_Type
+Unary_Operator<C_Expr>::type() const {
+  return expr_type;
+}
+
+inline Concrete_Expression_BOP
+Unary_Operator<C_Expr>::unary_operator() const {
+  return uop;
+}
+
+inline const Concrete_Expression<C_Expr>*
+Unary_Operator<C_Expr>::argument() const {
+  return arg;
+}
+
+inline
+Cast_Operator<C_Expr>::
+Cast_Operator(const Concrete_Expression_Type type,
+              const Concrete_Expression<C_Expr>* ar)
+  : Concrete_Expression<C_Expr>(type, CAST),
+    arg(ar) {
+}
+
+inline
+Cast_Operator<C_Expr>::~Cast_Operator<C_Expr>() {
+}
+
+inline Concrete_Expression_Type
+Cast_Operator<C_Expr>::type() const {
+  return expr_type;
+}
+
+inline const Concrete_Expression<C_Expr>*
+Cast_Operator<C_Expr>::argument() const {
+  return arg;
+}
+
+inline
+Integer_Constant<C_Expr>::
+Integer_Constant(Concrete_Expression_Type type,
+                 const Integer_Interval& val)
+  : Concrete_Expression<C_Expr>(type, INT_CON),
+    value(val) {
+}
+
+inline
+Integer_Constant<C_Expr>::~Integer_Constant<C_Expr>() {
+}
+
+inline
+Floating_Point_Constant<C_Expr>::
+Floating_Point_Constant(const char* value_string,
+                        const unsigned int string_size)
+  : Concrete_Expression<C_Expr>(Concrete_Expression_Type::floating_point(ANALYZED_FP_FORMAT), FP_CON),
+    value(new char[string_size]) {
+  strcpy(value, value_string);
+}
+
+inline
+Floating_Point_Constant<C_Expr>::~Floating_Point_Constant<C_Expr>() {
+  delete[] value;
+}
+
+inline Concrete_Expression_Type
+Floating_Point_Constant<C_Expr>::type() const {
+  return expr_type;
+}
+
+inline
+Approximable_Reference<C_Expr>::
+Approximable_Reference(Concrete_Expression_Type type,
+                       const Integer_Interval& val,
+                       dimension_type index)
+  : Concrete_Expression<C_Expr>(type, APPROX_REF),
+    value(val),
+    dimensions() {
+  dimensions.insert(index);
+}
+
+inline
+Approximable_Reference<C_Expr>::~Approximable_Reference<C_Expr>() {
+}
+
+inline Concrete_Expression_Type
+Approximable_Reference<C_Expr>::type() const {
+  return expr_type;
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_C_Expr_inlines_hh)
diff --git a/tests/Concrete_Expression/Makefile.am b/tests/Concrete_Expression/Makefile.am
index 428d71d..8e43812 100644
--- a/tests/Concrete_Expression/Makefile.am
+++ b/tests/Concrete_Expression/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -140,7 +140,7 @@ print_INSTANCES:
 # Sources for the tests
 #
 
-C_Expr_SOURCES = C_Expr.defs.hh C_Expr.inlines.hh C_Expr.cc
+C_Expr_SOURCES = C_Expr_defs.hh C_Expr_inlines.hh C_Expr.cc
 
 bdshape1_SOURCES = bdshape1.cc
 
diff --git a/tests/Concrete_Expression/Makefile.in b/tests/Concrete_Expression/Makefile.in
index 51db3fd..68c3ecf 100644
--- a/tests/Concrete_Expression/Makefile.in
+++ b/tests/Concrete_Expression/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -62,7 +78,8 @@ host_triplet = @host@
 XFAIL_TESTS =
 subdir = tests/Concrete_Expression
 DIST_COMMON = $(dist_check_SCRIPTS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -109,6 +126,7 @@ C_Expr_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_bdshape1_OBJECTS = bdshape1.$(OBJEXT)
 bdshape1_OBJECTS = $(am_bdshape1_OBJECTS)
 bdshape1_LDADD = $(LDADD)
@@ -163,6 +181,18 @@ polyhedron2_LDADD = $(LDADD)
 polyhedron2_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -175,17 +205,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -194,17 +223,16 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(C_Expr_SOURCES) $(bdshape1_SOURCES) $(bdshape2_SOURCES) \
 	$(digitalfilters1_SOURCES) $(linearform1_SOURCES) \
 	$(linearize_SOURCES) $(octagonalshape1_SOURCES) \
@@ -215,10 +243,17 @@ DIST_SOURCES = $(C_Expr_SOURCES) $(bdshape1_SOURCES) \
 	$(linearform1_SOURCES) $(linearize_SOURCES) \
 	$(octagonalshape1_SOURCES) $(octagonalshape2_SOURCES) \
 	$(polyhedron1_SOURCES) $(polyhedron2_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -488,7 +523,7 @@ $(LONG_DOUBLE_INSTANCES)
 #
 # Sources for the tests
 #
-C_Expr_SOURCES = C_Expr.defs.hh C_Expr.inlines.hh C_Expr.cc
+C_Expr_SOURCES = C_Expr_defs.hh C_Expr_inlines.hh C_Expr.cc
 bdshape1_SOURCES = bdshape1.cc
 bdshape2_SOURCES = bdshape2.cc
 digitalfilters1_SOURCES = digitalfilters1.cc
@@ -671,6 +706,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -684,7 +733,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -910,8 +959,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Concrete_Expression/bdshape1.cc b/tests/Concrete_Expression/bdshape1.cc
index d686412..f94e8d1 100644
--- a/tests/Concrete_Expression/bdshape1.cc
+++ b/tests/Concrete_Expression/bdshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::affine_form_image on interval linear forms.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/bdshape2.cc b/tests/Concrete_Expression/bdshape2.cc
index 6436762..2f36e90 100644
--- a/tests/Concrete_Expression/bdshape2.cc
+++ b/tests/Concrete_Expression/bdshape2.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::refine_wiht_linear_form_inequaity on interval linear forms.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/digitalfilters1.cc b/tests/Concrete_Expression/digitalfilters1.cc
index 2d00d3a..ef83d12 100644
--- a/tests/Concrete_Expression/digitalfilters1.cc
+++ b/tests/Concrete_Expression/digitalfilters1.cc
@@ -1,6 +1,6 @@
 /* Test Rate Limiter on differents abstract domains.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
-#include "C_Expr.defs.hh"
+#include "C_Expr_defs.hh"
 
 namespace {
 
diff --git a/tests/Concrete_Expression/linearform1.cc b/tests/Concrete_Expression/linearform1.cc
index e29f9af..e6417c8 100644
--- a/tests/Concrete_Expression/linearform1.cc
+++ b/tests/Concrete_Expression/linearform1.cc
@@ -1,6 +1,6 @@
 /* Testing Linear_Form on floating point intervals.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/linearize.cc b/tests/Concrete_Expression/linearize.cc
index 45d5b7d..6b909b8 100644
--- a/tests/Concrete_Expression/linearize.cc
+++ b/tests/Concrete_Expression/linearize.cc
@@ -1,6 +1,6 @@
 /* Testing linearization algorithm ad its related functions.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -22,7 +22,7 @@ For the most up-to-date information see the Parma Polyhedra Library
 site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
-#include "C_Expr.defs.hh"
+#include "C_Expr_defs.hh"
 
 namespace {
 
diff --git a/tests/Concrete_Expression/octagonalshape1.cc b/tests/Concrete_Expression/octagonalshape1.cc
index 2fc1f5f..e7e5a3b 100644
--- a/tests/Concrete_Expression/octagonalshape1.cc
+++ b/tests/Concrete_Expression/octagonalshape1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::affine_form_image on interval linear forms.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/octagonalshape2.cc b/tests/Concrete_Expression/octagonalshape2.cc
index ec42c0b..d00e9c1 100644
--- a/tests/Concrete_Expression/octagonalshape2.cc
+++ b/tests/Concrete_Expression/octagonalshape2.cc
@@ -1,7 +1,7 @@
 /* Test Octagonal_Shape::refine_fp_interval_abstract_store and
    Octagonal_Shape::refine_with_linear_form_inequality.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/polyhedron1.cc b/tests/Concrete_Expression/polyhedron1.cc
index 8c82f15..48efb2b 100644
--- a/tests/Concrete_Expression/polyhedron1.cc
+++ b/tests/Concrete_Expression/polyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::affine_form_image on interval linear forms.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Concrete_Expression/polyhedron2.cc b/tests/Concrete_Expression/polyhedron2.cc
index 8ac9cf3..9b4a65f 100644
--- a/tests/Concrete_Expression/polyhedron2.cc
+++ b/tests/Concrete_Expression/polyhedron2.cc
@@ -2,7 +2,7 @@
    Polyhedron::refine_with_linear_form_inequality and
    Polyhedron::generalized_refine_with_linear_form_inequality.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -85,13 +85,13 @@ test03() {
 
   C_Polyhedron ph(3);
   ph.refine_with_linear_form_inequality(-FP_Linear_Form(A),
-				 FP_Linear_Form(FP_Interval(0)));
+                                 FP_Linear_Form(FP_Interval(0)));
   ph.refine_with_linear_form_inequality(FP_Linear_Form(A),
-				 FP_Linear_Form(FP_Interval(2)));
+                                 FP_Linear_Form(FP_Interval(2)));
   ph.refine_with_linear_form_inequality(-FP_Linear_Form(A),
-				 FP_Linear_Form(FP_Interval(1)));
+                                 FP_Linear_Form(FP_Interval(1)));
   ph.refine_with_linear_form_inequality(-FP_Linear_Form(B),
-				 FP_Linear_Form(FP_Interval(-1)));
+                                 FP_Linear_Form(FP_Interval(-1)));
   ph.generalized_refine_with_linear_form_inequality(
     FP_Linear_Form(C), FP_Linear_Form(tmp), EQUAL);
   ph.generalized_refine_with_linear_form_inequality(
@@ -119,27 +119,26 @@ test04() {
   FP_Interval_Abstract_Store store(2);
   store.set_interval(A, tmp0);
   store.set_interval(B, tmp0);
-  FP_Interval tmp(tmp0);
-  tmp = 2;
-  tmp /= FP_Interval(3);
   FP_Linear_Form la(A);
   FP_Linear_Form lb(B);
-  FP_Linear_Form lk(tmp);
+
+  FP_Interval tmp(2);
+  tmp /= FP_Interval(3);
 
   C_Polyhedron ph(2);
   ph.generalized_refine_with_linear_form_inequality(
-    lk, la, GREATER_THAN);
-  tmp = 1;
-  lk -= tmp;
+    FP_Linear_Form(tmp), la, GREATER_THAN);
+  tmp = -1;
+  tmp /= FP_Interval(3);
   ph.generalized_refine_with_linear_form_inequality(
-    lk, -la, GREATER_OR_EQUAL);
+    FP_Linear_Form(tmp), -la, GREATER_OR_EQUAL);
+  tmp = 1;
+  tmp /= FP_Interval(3);
   ph.generalized_refine_with_linear_form_inequality(
-    lb, -lk, LESS_OR_EQUAL);
+    lb, FP_Linear_Form(tmp), LESS_OR_EQUAL);
   tmp = 0;
-  lk = FP_Linear_Form(tmp);
   ph.generalized_refine_with_linear_form_inequality(
-    -lb, lk, LESS_THAN);
-  print_constraints(ph, "*** ph ***");
+    -lb, FP_Linear_Form(tmp), LESS_THAN);
 
   C_Polyhedron known_result1(2);
   known_result1.add_constraint(3*A >= 1);
@@ -148,11 +147,17 @@ test04() {
   known_result1.add_constraint(3*B <= 1);
   print_constraints(known_result1, "*** known_result1 ***");
 
+  Box<FP_Interval> box(ph);
+  print_constraints(ph, "*** ph ***");
+  print_constraints(box, "*** box ***");
+
   bool ok1 = ph.contains(known_result1);
 
   ph.refine_fp_interval_abstract_store(store);
   nout << "*** FP_Interval_Abstract_Store ***" << endl;
 
+  nout << "tmp0 = " << tmp0 << endl;
+
   nout << "A = " << store.get_interval(A) << endl;
   bool ok2 = tmp0.contains(store.get_interval(A));
 
diff --git a/tests/Concrete_Expression/run_tests b/tests/Concrete_Expression/run_tests
index 7922901..2f4ce05 100755
--- a/tests/Concrete_Expression/run_tests
+++ b/tests/Concrete_Expression/run_tests
@@ -2,7 +2,7 @@
 
 # Run the Floating_Point_Expression tests.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Grid/Makefile.am b/tests/Grid/Makefile.am
index acfb4d5..1f250f0 100644
--- a/tests/Grid/Makefile.am
+++ b/tests/Grid/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Grid/Makefile.in b/tests/Grid/Makefile.in
index 0c8f9e9..b6594a7 100644
--- a/tests/Grid/Makefile.in
+++ b/tests/Grid/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -106,7 +122,8 @@ TESTS = addcongruence1$(EXEEXT) addcongruences1$(EXEEXT) \
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1)
 subdir = tests/Grid
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -195,6 +212,7 @@ addcongruence1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_addcongruences1_OBJECTS = addcongruences1.$(OBJEXT)
 addcongruences1_OBJECTS = $(am_addcongruences1_OBJECTS)
 addcongruences1_LDADD = $(LDADD)
@@ -791,6 +809,18 @@ writecongruencesystem_DEPENDENCIES =  \
 	$(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -803,20 +833,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addcongruence1_SOURCES) $(addcongruences1_SOURCES) \
 	$(addconstraint1_SOURCES) $(addconstraints1_SOURCES) \
 	$(addgenerator1_SOURCES) $(addgenerators1_SOURCES) \
@@ -919,10 +945,17 @@ DIST_SOURCES = $(addcongruence1_SOURCES) $(addcongruences1_SOURCES) \
 	$(upperbound2_SOURCES) $(widening1_SOURCES) \
 	$(widening2_SOURCES) $(widening3_SOURCES) $(wrap1_SOURCES) \
 	$(writecongruencesystem_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -1747,6 +1780,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1760,7 +1807,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -1984,8 +2031,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Grid/addcongruence1.cc b/tests/Grid/addcongruence1.cc
index 894732e..0afc774 100644
--- a/tests/Grid/addcongruence1.cc
+++ b/tests/Grid/addcongruence1.cc
@@ -1,6 +1,6 @@
 /* Test methods which add a single congruence to a grid.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -48,7 +48,7 @@ test01() {
   bool ok = (gr == known_gr) ;
 
   print_congruences(gr,
-		    "*** gr.add_congruence((A + B %= 0) / 3) ***");
+                    "*** gr.add_congruence((A + B %= 0) / 3) ***");
 
   return ok;
 }
diff --git a/tests/Grid/addcongruences1.cc b/tests/Grid/addcongruences1.cc
index 662ec5e..40365af 100644
--- a/tests/Grid/addcongruences1.cc
+++ b/tests/Grid/addcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test methods which can add multiple congruences to a grid.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -148,7 +148,7 @@ test05() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_recycled_congruences(cgs) ***");
+                    "*** gr.add_recycled_congruences(cgs) ***");
 
   return ok;
 }
@@ -195,7 +195,7 @@ test07() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_recycled_congruences(cgs) ***");
+                    "*** gr.add_recycled_congruences(cgs) ***");
 
   return ok;
 }
@@ -223,7 +223,7 @@ test08() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_recycled_congruences(cgs) ***");
+                    "*** gr.add_recycled_congruences(cgs) ***");
 
   return ok;
 }
@@ -250,7 +250,7 @@ test09() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_recycled_congruences(cgs) ***");
+                    "*** gr.add_recycled_congruences(cgs) ***");
 
   return ok;
 }
@@ -310,7 +310,7 @@ test11() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_recycled_congruences(cgs) ***");
+                    "*** gr.add_recycled_congruences(cgs) ***");
 
   return ok;
 }
diff --git a/tests/Grid/addconstraint1.cc b/tests/Grid/addconstraint1.cc
index 144479e..8fa2cb4 100644
--- a/tests/Grid/addconstraint1.cc
+++ b/tests/Grid/addconstraint1.cc
@@ -1,6 +1,6 @@
 /* Test adding single constraints to grids.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -71,7 +71,7 @@ test02() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_constraint(*ph.constraints().begin()) ***");
+                    "*** gr.add_constraint(*ph.constraints().begin()) ***");
 
   return ok;
 }
diff --git a/tests/Grid/addconstraints1.cc b/tests/Grid/addconstraints1.cc
index e43ba70..784634d 100644
--- a/tests/Grid/addconstraints1.cc
+++ b/tests/Grid/addconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test adding constraints to a grid.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/addgenerator1.cc b/tests/Grid/addgenerator1.cc
index e5181bc..529ddfb 100644
--- a/tests/Grid/addgenerator1.cc
+++ b/tests/Grid/addgenerator1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::add_grid_generator().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -110,7 +110,7 @@ test04() {
   print_congruences(gr, "*** gr ***");
 
   for (Grid_Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     gr.add_grid_generator(*i);
 
   Grid known_gr(2);
@@ -170,7 +170,7 @@ test06() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_grid_generator(grid_point(12*A + 7*D)) ***");
+                    "*** gr.add_grid_generator(grid_point(12*A + 7*D)) ***");
 
   return ok;
 }
@@ -199,7 +199,7 @@ test07() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_grid_generator(grid_point(B, 3)) ***");
+                    "*** gr.add_grid_generator(grid_point(B, 3)) ***");
 
   return ok;
 }
diff --git a/tests/Grid/addgenerators1.cc b/tests/Grid/addgenerators1.cc
index 8ef159a..e47a33f 100644
--- a/tests/Grid/addgenerators1.cc
+++ b/tests/Grid/addgenerators1.cc
@@ -1,6 +1,6 @@
 /* Test method which can add multiple generators to a grid.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -132,7 +132,7 @@ test05() {
   bool ok = (gr == known_gr);
 
   print_generators(gr,
-		   "*** gr.add_recycled_grid_generators(gs) ***");
+                   "*** gr.add_recycled_grid_generators(gs) ***");
 
   return ok;
 }
@@ -151,7 +151,7 @@ test06() {
   bool ok = (gr == known_gr);
 
   print_generators(gr,
-		   "*** gr.add_grid_generators(Grid_Generator_System::zero_dim_univ()) ***");
+                   "*** gr.add_grid_generators(Grid_Generator_System::zero_dim_univ()) ***");
 
   return ok;
 }
diff --git a/tests/Grid/addspacedims1.cc b/tests/Grid/addspacedims1.cc
index 1e05231..d13203e 100644
--- a/tests/Grid/addspacedims1.cc
+++ b/tests/Grid/addspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::add_space_dimensions_and_embed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/affinedim1.cc b/tests/Grid/affinedim1.cc
index 361f704..c9564be 100644
--- a/tests/Grid/affinedim1.cc
+++ b/tests/Grid/affinedim1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::affine_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/affineimage1.cc b/tests/Grid/affineimage1.cc
index c82e3a8..8d0055e 100644
--- a/tests/Grid/affineimage1.cc
+++ b/tests/Grid/affineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/affineimage2.cc b/tests/Grid/affineimage2.cc
index 3aec6c8..273b740 100644
--- a/tests/Grid/affineimage2.cc
+++ b/tests/Grid/affineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/affinepreimage1.cc b/tests/Grid/affinepreimage1.cc
index ae39f7f..2510b11 100644
--- a/tests/Grid/affinepreimage1.cc
+++ b/tests/Grid/affinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/affinepreimage2.cc b/tests/Grid/affinepreimage2.cc
index 225ed1d..159450d 100644
--- a/tests/Grid/affinepreimage2.cc
+++ b/tests/Grid/affinepreimage2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/approximatepartition1.cc b/tests/Grid/approximatepartition1.cc
index 2a490ab..8843c98 100644
--- a/tests/Grid/approximatepartition1.cc
+++ b/tests/Grid/approximatepartition1.cc
@@ -1,6 +1,6 @@
 /* Test approximate_partition().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -82,10 +82,10 @@ test02() {
     result = approximate_partition(q, p, finite_partition);
 
   print_congruences(result.first,
-		    "*** result.first ***");
+                    "*** result.first ***");
 
   print_congruences(result.second,
-		    "*** result.second ***");
+                    "*** result.second ***");
 
   if (finite_partition)
     return false;
diff --git a/tests/Grid/asciidumpload1.cc b/tests/Grid/asciidumpload1.cc
index 46d93bd..a59b18f 100644
--- a/tests/Grid/asciidumpload1.cc
+++ b/tests/Grid/asciidumpload1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::ascii_dump() and Grid::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/asciidumpload2.cc b/tests/Grid/asciidumpload2.cc
index ff23400..b6814d3 100644
--- a/tests/Grid/asciidumpload2.cc
+++ b/tests/Grid/asciidumpload2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::ascii_dump() and Grid::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/asciidumpload3.cc b/tests/Grid/asciidumpload3.cc
index 0881544..8faabbc 100644
--- a/tests/Grid/asciidumpload3.cc
+++ b/tests/Grid/asciidumpload3.cc
@@ -1,6 +1,6 @@
 /* Test Congruence::ascii_dump() and Congruence::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/asciidumpload4.cc b/tests/Grid/asciidumpload4.cc
index 8db258b..bcc0d6a 100644
--- a/tests/Grid/asciidumpload4.cc
+++ b/tests/Grid/asciidumpload4.cc
@@ -1,6 +1,6 @@
 /* Test Congruence_System ascii_dump() and ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/asciidumpload5.cc b/tests/Grid/asciidumpload5.cc
index 0e84a6d..e9f571e 100644
--- a/tests/Grid/asciidumpload5.cc
+++ b/tests/Grid/asciidumpload5.cc
@@ -1,6 +1,6 @@
 /* Test Grid_Generator ascii_dump() and ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/asciidumpload6.cc b/tests/Grid/asciidumpload6.cc
index d04c6b6..91a35d2 100644
--- a/tests/Grid/asciidumpload6.cc
+++ b/tests/Grid/asciidumpload6.cc
@@ -1,6 +1,6 @@
 /* Test Generator_System ascii_dump() and ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/bhz03widening1.cc b/tests/Grid/bhz03widening1.cc
index 378af81..b451163 100644
--- a/tests/Grid/bhz03widening1.cc
+++ b/tests/Grid/bhz03widening1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<Grid>::BHZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/bounded1.cc b/tests/Grid/bounded1.cc
index 5730c89..8e5a869 100644
--- a/tests/Grid/bounded1.cc
+++ b/tests/Grid/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/boundedaffineimage1.cc b/tests/Grid/boundedaffineimage1.cc
index d82cc1e..5ab38ad 100644
--- a/tests/Grid/boundedaffineimage1.cc
+++ b/tests/Grid/boundedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/boundedaffinepreimage1.cc b/tests/Grid/boundedaffinepreimage1.cc
index b2eef5b..0307a89 100644
--- a/tests/Grid/boundedaffinepreimage1.cc
+++ b/tests/Grid/boundedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/bounds1.cc b/tests/Grid/bounds1.cc
index dea1510..d024ad7 100644
--- a/tests/Grid/bounds1.cc
+++ b/tests/Grid/bounds1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::bounds_from_above() and Grid::bounds_from_below().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -31,7 +31,7 @@ test01() {
   Grid gr(7, EMPTY);
 
   bool ok = (gr.bounds_from_above(Linear_Expression(0))
-	     && gr.bounds_from_below(Linear_Expression(0)));
+             && gr.bounds_from_below(Linear_Expression(0)));
 
   print_congruences(gr, "*** gr ***");
 
@@ -44,7 +44,7 @@ test02() {
   Grid gr(0, EMPTY);
 
   bool ok = (gr.bounds_from_above(Linear_Expression(3))
-	     && gr.bounds_from_below(Linear_Expression(3)));
+             && gr.bounds_from_below(Linear_Expression(3)));
 
   print_congruences(gr, "*** gr ***");
 
@@ -57,7 +57,7 @@ test03() {
   Grid gr(0);
 
   bool ok = (gr.bounds_from_above(Linear_Expression(1))
-	     && gr.bounds_from_below(Linear_Expression(1)));
+             && gr.bounds_from_below(Linear_Expression(1)));
 
   print_congruences(gr, "*** gr ***");
 
diff --git a/tests/Grid/certificate1.cc b/tests/Grid/certificate1.cc
index ec3800d..2767649 100644
--- a/tests/Grid/certificate1.cc
+++ b/tests/Grid/certificate1.cc
@@ -1,6 +1,6 @@
 /* Test class Grid_Certificate.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/concatenate1.cc b/tests/Grid/concatenate1.cc
index 2b0192f..570b40f 100644
--- a/tests/Grid/concatenate1.cc
+++ b/tests/Grid/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::concatenate_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/congruence1.cc b/tests/Grid/congruence1.cc
index 01ab2e7..668c3cf 100644
--- a/tests/Grid/congruence1.cc
+++ b/tests/Grid/congruence1.cc
@@ -1,6 +1,6 @@
 /* Test class Congruence.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -34,7 +34,7 @@ public:
 };
 
 // Negative inhomogeneous term.
-static bool
+bool
 test01() {
   Variable A(0);
   Variable B(1);
@@ -55,7 +55,7 @@ test01() {
 }
 
 // Positive inhomogeneous term.
-static bool
+bool
 test02() {
   Variable A(0);
   Variable B(1);
@@ -76,7 +76,7 @@ test02() {
 }
 
 // Common factors and reducible positive inhomogeneous term.
-static bool
+bool
 test03() {
   Variable A(0);
   Variable B(1);
@@ -97,7 +97,7 @@ test03() {
 }
 
 // Negative first coefficient.
-static bool
+bool
 test04() {
   Variable A(0);
   Variable B(1);
@@ -118,7 +118,7 @@ test04() {
 }
 
 // Constructed with only the %= operator.
-static bool
+bool
 test05() {
   Variable A(0);
   Variable B(1);
@@ -142,7 +142,7 @@ test05() {
 }
 
 // Equality congruence (a modulus of 0).
-static bool
+bool
 test06() {
   Variable A(0);
   Variable B(1);
@@ -163,7 +163,7 @@ test06() {
 }
 
 // Constructed from a Constraint with the `/' operator.
-static bool
+bool
 test07() {
   Variable A(0);
   Variable B(1);
@@ -184,7 +184,7 @@ test07() {
 }
 
 // Constructed from a Constraint.
-static bool
+bool
 test08() {
   Variable A(0);
   Variable B(1);
@@ -205,7 +205,7 @@ test08() {
 }
 
 // Set modulus with `/='.
-static bool
+bool
 test09() {
   Variable A(0);
   Variable B(1);
@@ -228,7 +228,7 @@ test09() {
 }
 
 // is_tautological and is_inconsistent.
-static bool
+bool
 test10() {
   Variable A(0);
   Variable B(1);
@@ -287,7 +287,7 @@ test10() {
 }
 
 // Negative moduli.
-static bool
+bool
 test11() {
   Variable A(0);
   Variable B(1);
@@ -308,7 +308,7 @@ test11() {
 }
 
 // Negative modulus and negative first coefficient.
-static bool
+bool
 test12() {
   Variable A(0);
   Variable B(1);
@@ -331,7 +331,7 @@ test12() {
 }
 
 // Create from empty linear expression.
-static bool
+bool
 test13() {
   Linear_Expression le;
   Test_Congruence a(le %= le);
@@ -349,7 +349,7 @@ test13() {
 }
 
 // Linear expressions on both sides.
-static bool
+bool
 test14() {
   Variable A(0);
   Variable B(1);
@@ -370,7 +370,7 @@ test14() {
 }
 
 // Try construct congruence from inequality constraint.
-static bool
+bool
 test15() {
   Variable A(0);
   Variable C(2);
@@ -389,7 +389,7 @@ test15() {
 
 // Try access the coefficient of a space dimension higher than that of
 // a congruence.
-static bool
+bool
 test16() {
   Variable A(0);
   Variable C(2);
@@ -409,7 +409,7 @@ test16() {
 }
 
 // Check if the congruences are equivalent.
-static bool
+bool
 test17() {
   Variable A(0);
   Variable B(1);
diff --git a/tests/Grid/congruences1.cc b/tests/Grid/congruences1.cc
index 53d59fd..0a08531 100644
--- a/tests/Grid/congruences1.cc
+++ b/tests/Grid/congruences1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/congruences2.cc b/tests/Grid/congruences2.cc
index e0814e6..8072568 100644
--- a/tests/Grid/congruences2.cc
+++ b/tests/Grid/congruences2.cc
@@ -1,6 +1,6 @@
 /* Test Congruence_System::satisfies_all_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -190,8 +190,8 @@ test07() {
 */
 bool
 satisfies(const Grid_Generator& g,
-	  const Test_Congruence_System& cgs,
-	  bool expected = true) {
+          const Test_Congruence_System& cgs,
+          bool expected = true) {
   if (cgs.satisfies_all_congruences(g) == expected)
     return true;
 
@@ -208,7 +208,7 @@ satisfies(const Grid_Generator& g,
 
 inline bool
 fails_to_satisfy(const Grid_Generator& g,
-		 const Congruence_System& cgs) {
+                 const Congruence_System& cgs) {
   return satisfies(g, cgs, false);
 }
 
@@ -252,7 +252,7 @@ test08() {
   cgs0.insert((A %= 0) / 2);
   ok &= (fails_to_satisfy(grid_line(3*A), cgs0));
   print_congruences(cgs0,
-		    "*** cgs0.clear(); cgs0.insert((A %= 0) / 2) ***");
+                    "*** cgs0.clear(); cgs0.insert((A %= 0) / 2) ***");
 
   return ok;
 }
@@ -265,7 +265,7 @@ test09() {
 
   Test_Congruence_System cgs0((A - B %= 0) / 7);
   print_congruences(cgs0,
-		    "*** cgs0((A - B %= 0) / 7) ***");
+                    "*** cgs0((A - B %= 0) / 7) ***");
 
   // Points.
 
@@ -297,7 +297,7 @@ test09() {
   cgs0.insert((A %= 0) / 2);
   ok &= (fails_to_satisfy(grid_line(3*A), cgs0));
   print_congruences(cgs0,
-		    "*** cgs0.clear(); cgs0.insert((A %= 0) / 2) ***");
+                    "*** cgs0.clear(); cgs0.insert((A %= 0) / 2) ***");
 
   return ok;
 }
diff --git a/tests/Grid/constraints1.cc b/tests/Grid/constraints1.cc
index b7e29a3..1afa37f 100644
--- a/tests/Grid/constraints1.cc
+++ b/tests/Grid/constraints1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/contains1.cc b/tests/Grid/contains1.cc
index c585d0a..ead6055 100644
--- a/tests/Grid/contains1.cc
+++ b/tests/Grid/contains1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::contains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/containsintegerpoint1.cc b/tests/Grid/containsintegerpoint1.cc
index 84e7244..7f89045 100644
--- a/tests/Grid/containsintegerpoint1.cc
+++ b/tests/Grid/containsintegerpoint1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::contains_integer_point().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/discrete1.cc b/tests/Grid/discrete1.cc
index 6bd168a..8cc08d1 100644
--- a/tests/Grid/discrete1.cc
+++ b/tests/Grid/discrete1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::is_pointed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/disjoint1.cc b/tests/Grid/disjoint1.cc
index 0f28a89..e279f89 100644
--- a/tests/Grid/disjoint1.cc
+++ b/tests/Grid/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::is_disjoint_from().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/dropnonintegerpoints1.cc b/tests/Grid/dropnonintegerpoints1.cc
index 826ca60..13fd988 100644
--- a/tests/Grid/dropnonintegerpoints1.cc
+++ b/tests/Grid/dropnonintegerpoints1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::drop_some_non_integer_points().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/equals1.cc b/tests/Grid/equals1.cc
index 4abd116..535b760 100644
--- a/tests/Grid/equals1.cc
+++ b/tests/Grid/equals1.cc
@@ -1,7 +1,7 @@
 /* Test operator==(const Grid&, const Grid&)
    and operator!=(const Grid&, const Grid&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/expandspacedim1.cc b/tests/Grid/expandspacedim1.cc
index 46f9b98..5272ee2 100644
--- a/tests/Grid/expandspacedim1.cc
+++ b/tests/Grid/expandspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::expand_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/foldspacedims1.cc b/tests/Grid/foldspacedims1.cc
index 5a6d2ea..4564ef0 100644
--- a/tests/Grid/foldspacedims1.cc
+++ b/tests/Grid/foldspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::fold_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/frequency1.cc b/tests/Grid/frequency1.cc
index aba6d3a..a377192 100644
--- a/tests/Grid/frequency1.cc
+++ b/tests/Grid/frequency1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::frequency().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/frombdshape1.cc b/tests/Grid/frombdshape1.cc
index a043de3..72051cd 100644
--- a/tests/Grid/frombdshape1.cc
+++ b/tests/Grid/frombdshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/frombox1.cc b/tests/Grid/frombox1.cc
index 2817186..8f280ad 100644
--- a/tests/Grid/frombox1.cc
+++ b/tests/Grid/frombox1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::Grid(const Box&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/fromgrid1.cc b/tests/Grid/fromgrid1.cc
index 1927e68..21272fc 100644
--- a/tests/Grid/fromgrid1.cc
+++ b/tests/Grid/fromgrid1.cc
@@ -1,6 +1,6 @@
 /* Test copy construction and assignment for grids.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/fromoctagonalshape1.cc b/tests/Grid/fromoctagonalshape1.cc
index 2a20c20..091ebda 100644
--- a/tests/Grid/fromoctagonalshape1.cc
+++ b/tests/Grid/fromoctagonalshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/frompolyhedron1.cc b/tests/Grid/frompolyhedron1.cc
index e11f3a1..e74d03a 100644
--- a/tests/Grid/frompolyhedron1.cc
+++ b/tests/Grid/frompolyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test construction of grids from polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/generalizedaffineimage1.cc b/tests/Grid/generalizedaffineimage1.cc
index af48a1b..18105ed 100644
--- a/tests/Grid/generalizedaffineimage1.cc
+++ b/tests/Grid/generalizedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generalized_affine_image(var, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -44,7 +44,7 @@ test01() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, Linear_Expression::zero(), 1, 0) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, Linear_Expression::zero(), 1, 0) ***");
 
   return ok;
 }
@@ -71,7 +71,7 @@ test02() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, Linear_Expression::zero(), 2, 1) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, Linear_Expression::zero(), 2, 1) ***");
 
   return ok;
 }
@@ -98,7 +98,7 @@ test03() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, A + 1, 1, 1) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, A + 1, 1, 1) ***");
 
   return ok;
 }
@@ -125,7 +125,7 @@ test04() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, A + 1, 2, 1) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, A + 1, 2, 1) ***");
 
   return ok;
 }
@@ -152,7 +152,7 @@ test05() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, A + 1, 2, 3) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, A + 1, 2, 3) ***");
 
   return ok;
 }
@@ -179,7 +179,7 @@ test06() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, A + 2, -2, 1) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, A + 2, -2, 1) ***");
 
   return ok;
 }
@@ -206,7 +206,7 @@ test07() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, EQUAL, A + 2, 1, -7) ***");
+                    "*** gr.generalized_affine_image(B, EQUAL, A + 2, 1, -7) ***");
 
   return ok;
 }
@@ -236,7 +236,7 @@ test08() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, EQUAL, A - C + 2, 1, 5) ***");
+                    "*** gr.generalized_affine_image(A, EQUAL, A - C + 2, 1, 5) ***");
 
   return ok;
 }
@@ -266,7 +266,7 @@ test09() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, EQUAL, A - C + 2, 1, 0) ***");
+                    "*** gr.generalized_affine_image(A, EQUAL, A - C + 2, 1, 0) ***");
 
   return ok;
 }
@@ -289,7 +289,7 @@ test10() {
   bool ok = (gr == known_gr);
 
   print_generators(gr,
-		   "*** gr.generalized_affine_image(A, EQUAL, A - 2*C + 3, 4, 7) ***");
+                   "*** gr.generalized_affine_image(A, EQUAL, A - 2*C + 3, 4, 7) ***");
 
   return ok;
 }
@@ -312,7 +312,7 @@ test11() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, EQUAL, A + 2, 1, 1) ***");
+                    "*** gr.generalized_affine_image(A, EQUAL, A + 2, 1, 1) ***");
 
   return ok;
 }
@@ -333,7 +333,7 @@ test12() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, EQUAL, A + 2, 1, 1) ***");
+                    "*** gr.generalized_affine_image(A, EQUAL, A + 2, 1, 1) ***");
 
   return ok;
 }
@@ -429,7 +429,7 @@ test16() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - B + C, EQUAL, 2*A - B - C, 5) ***");
+                    "*** gr.generalized_affine_image(A - B + C, EQUAL, 2*A - B - C, 5) ***");
 
   return ok;
 }
@@ -454,7 +454,7 @@ test17() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - B, EQUAL, 2*A - 2*B, 5) ***");
+                    "*** gr.generalized_affine_image(A - B, EQUAL, 2*A - 2*B, 5) ***");
 
   return ok;
 }
@@ -478,7 +478,7 @@ test18() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(2*A - 2*B, EQUAL, A - B, 5) ***");
+                    "*** gr.generalized_affine_image(2*A - 2*B, EQUAL, A - B, 5) ***");
 
   return ok;
 }
diff --git a/tests/Grid/generalizedaffineimage2.cc b/tests/Grid/generalizedaffineimage2.cc
index 592ddf3..cfc93e6 100644
--- a/tests/Grid/generalizedaffineimage2.cc
+++ b/tests/Grid/generalizedaffineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generalized_affine_image(lhs, rhs, modulus).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -49,7 +49,7 @@ test01() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(1*B, Linear_Expression::zero(), 0) ***");
+                    "*** gr.generalized_affine_image(1*B, Linear_Expression::zero(), 0) ***");
 
   return ok;
 }
@@ -76,7 +76,7 @@ test02() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(2*B, Linear_Expression::zero()) ***");
+                    "*** gr.generalized_affine_image(2*B, Linear_Expression::zero()) ***");
 
   return ok;
 }
@@ -262,7 +262,7 @@ test09() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(1*A, A - C + 2, 5) ***");
+                    "*** gr.generalized_affine_image(1*A, A - C + 2, 5) ***");
 
   return ok;
 }
@@ -291,7 +291,7 @@ test10() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(1*A, A - C + 2, 0) ***");
+                    "*** gr.generalized_affine_image(1*A, A - C + 2, 0) ***");
 
   return ok;
 }
@@ -372,7 +372,7 @@ test14() {
   print_congruences(gr, "*** gr ***");
 
   gr.generalized_affine_image(Linear_Expression::zero(), EQUAL,
-			      Linear_Expression(1), 1);
+                              Linear_Expression(1), 1);
 
   Grid known_gr(2, EMPTY);
   known_gr.add_grid_generator(grid_point());
@@ -382,7 +382,7 @@ test14() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(Linear_Expression::zero(), EQUAL, Linear_Expression(1), 1) ***");
+                    "*** gr.generalized_affine_image(Linear_Expression::zero(), EQUAL, Linear_Expression(1), 1) ***");
 
   return ok;
 }
@@ -408,7 +408,7 @@ test15() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(Linear_Expression::zero(), EQUAL, A - B, 5) ***");
+                    "*** gr.generalized_affine_image(Linear_Expression::zero(), EQUAL, A - B, 5) ***");
 
   return ok;
 }
@@ -437,7 +437,7 @@ test16() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - B, EQUAL, C, 1) ***");
+                    "*** gr.generalized_affine_image(A - B, EQUAL, C, 1) ***");
 
   return ok;
 }
@@ -460,7 +460,7 @@ test17() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - B, EQUAL, A) ***");
+                    "*** gr.generalized_affine_image(A - B, EQUAL, A) ***");
 
   return ok;
 }
@@ -487,7 +487,7 @@ test18() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A + 2*B, EQUAL, A - B, 3) ***");
+                    "*** gr.generalized_affine_image(A + 2*B, EQUAL, A - B, 3) ***");
 
   return ok;
 }
@@ -514,7 +514,7 @@ test19() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - C, EQUAL, B + 3, 0) ***");
+                    "*** gr.generalized_affine_image(A - C, EQUAL, B + 3, 0) ***");
 
   return ok;
 }
diff --git a/tests/Grid/generalizedaffineimage3.cc b/tests/Grid/generalizedaffineimage3.cc
index d2290d2..1d014ff 100644
--- a/tests/Grid/generalizedaffineimage3.cc
+++ b/tests/Grid/generalizedaffineimage3.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generalized_affine_image(var, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -45,7 +45,7 @@ test01() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(B, LESS_OR_EQUAL, Linear_Expression::zero()) ***");
+                    "*** gr.generalized_affine_image(B, LESS_OR_EQUAL, Linear_Expression::zero()) ***");
 
   return ok;
 }
@@ -69,7 +69,7 @@ test02() {
   bool ok = (gr == known_gr);
 
   print_generators(gr,
-		   "*** gr.generalized_affine_image(A, GREATER_OR_EQUAL, A - 2*C + 3, 4) ***");
+                   "*** gr.generalized_affine_image(A, GREATER_OR_EQUAL, A - 2*C + 3, 4) ***");
 
   return ok;
 }
@@ -92,7 +92,7 @@ test03() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, LESS_THAN, A + 2, 1, 0) ***");
+                    "*** gr.generalized_affine_image(A, LESS_THAN, A + 2, 1, 0) ***");
 
   return ok;
 }
@@ -211,7 +211,7 @@ test08() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - B + C, GREATER_THAN, 2*A - B - C) ***");
+                    "*** gr.generalized_affine_image(A - B + C, GREATER_THAN, 2*A - B - C) ***");
 
   return ok;
 }
@@ -237,7 +237,7 @@ test09() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A - B, GREATER_THAN, 2*A - 2*B, 0) ***");
+                    "*** gr.generalized_affine_image(A - B, GREATER_THAN, 2*A - 2*B, 0) ***");
 
   return ok;
 }
@@ -305,7 +305,7 @@ test12() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, GREATER_THAN , A + 2, 1, 1) ***");
+                    "*** gr.generalized_affine_image(A, GREATER_THAN , A + 2, 1, 1) ***");
 
   return ok;
 }
@@ -352,7 +352,7 @@ test14() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_image(A, LESS_THAN, A + 2) ***");
+                    "*** gr.generalized_affine_image(A, LESS_THAN, A + 2) ***");
 
   return ok;
 }
diff --git a/tests/Grid/generalizedaffinepreimage1.cc b/tests/Grid/generalizedaffinepreimage1.cc
index eb9b081..f40e168 100644
--- a/tests/Grid/generalizedaffinepreimage1.cc
+++ b/tests/Grid/generalizedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generalized_affine_preimage(var, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -251,7 +251,7 @@ test06() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, EQUAL, A - C + 2, 1, 5) ***");
+                    "*** gr.generalized_affine_preimage(A, EQUAL, A - C + 2, 1, 5) ***");
 
   return ok;
 }
@@ -280,7 +280,7 @@ test07() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, EQUAL, A - C + 2, 1, 0) ***");
+                    "*** gr.generalized_affine_preimage(A, EQUAL, A - C + 2, 1, 0) ***");
 
   return ok;
 }
@@ -303,7 +303,7 @@ test08() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, EQUAL, A - 2*C + 3, 4, 7) ***");
+                    "*** gr.generalized_affine_preimage(A, EQUAL, A - 2*C + 3, 4, 7) ***");
 
   return ok;
 }
@@ -326,7 +326,7 @@ test09() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, EQUAL, A + 2, 1, 1) ***");
+                    "*** gr.generalized_affine_preimage(A, EQUAL, A + 2, 1, 1) ***");
 
   return ok;
 }
@@ -347,7 +347,7 @@ test10() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, EQUAL, A + 2, 1, 1) ***");
+                    "*** gr.generalized_affine_preimage(A, EQUAL, A + 2, 1, 1) ***");
 
   return ok;
 }
@@ -447,7 +447,7 @@ test14() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(B, EQUAL, A + B, 1, 0) ***");
+                    "*** gr.generalized_affine_preimage(B, EQUAL, A + B, 1, 0) ***");
 
   return ok;
 }
@@ -476,7 +476,7 @@ test15() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(B, EQUAL, A + B, 1, -7) ***");
+                    "*** gr.generalized_affine_preimage(B, EQUAL, A + B, 1, -7) ***");
 
   return ok;
 }
@@ -511,7 +511,7 @@ test16() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A + 2*B, EQUAL, A - B, 3) ***");
+                    "*** gr.generalized_affine_preimage(A + 2*B, EQUAL, A - B, 3) ***");
 
   return ok;
 }
diff --git a/tests/Grid/generalizedaffinepreimage2.cc b/tests/Grid/generalizedaffinepreimage2.cc
index 0aeab54..d6f06c1 100644
--- a/tests/Grid/generalizedaffinepreimage2.cc
+++ b/tests/Grid/generalizedaffinepreimage2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generalized_affine_preimage(lhs, rhs, modulus).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -37,7 +37,7 @@ test01() {
   print_congruences(gr, "*** gr ***");
 
   gr.generalized_affine_preimage(Linear_Expression::zero(), EQUAL,
-				 Linear_Expression(1), 1);
+                                 Linear_Expression(1), 1);
 
   Grid known_gr(2, EMPTY);
   known_gr.add_grid_generator(grid_point());
@@ -47,7 +47,7 @@ test01() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(Linear_Expression::zero(), EQUAL, Linear_Expression(1), 1) ***");
+                    "*** gr.generalized_affine_preimage(Linear_Expression::zero(), EQUAL, Linear_Expression(1), 1) ***");
 
   return ok;
 }
@@ -73,7 +73,7 @@ test02() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(Linear_Expression::zero(), EQUAL, A - B, 5) ***");
+                    "*** gr.generalized_affine_preimage(Linear_Expression::zero(), EQUAL, A - B, 5) ***");
 
   return ok;
 }
@@ -125,7 +125,7 @@ test04() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A - B, EQUAL, A, 0) ***");
+                    "*** gr.generalized_affine_preimage(A - B, EQUAL, A, 0) ***");
 
   return ok;
 }
@@ -176,7 +176,7 @@ test06() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A - B + C, EQUAL, 2*A - B - C, 5) ***");
+                    "*** gr.generalized_affine_preimage(A - B + C, EQUAL, 2*A - B - C, 5) ***");
 
   return ok;
 }
@@ -201,7 +201,7 @@ test07() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A - B, EQUAL, 2*A - 2*B, 5) ***");
+                    "*** gr.generalized_affine_preimage(A - B, EQUAL, 2*A - 2*B, 5) ***");
 
   return ok;
 }
@@ -226,7 +226,7 @@ test08() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(2*A - 2*B, EQUAL, A - B, 5) ***");
+                    "*** gr.generalized_affine_preimage(2*A - 2*B, EQUAL, A - B, 5) ***");
 
   return ok;
 }
@@ -299,7 +299,7 @@ test11() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A - B, EQUAL, C, -5) ***");
+                    "*** gr.generalized_affine_preimage(A - B, EQUAL, C, -5) ***");
 
   return ok;
 }
diff --git a/tests/Grid/generalizedaffinepreimage3.cc b/tests/Grid/generalizedaffinepreimage3.cc
index 42e54b5..84722b5 100644
--- a/tests/Grid/generalizedaffinepreimage3.cc
+++ b/tests/Grid/generalizedaffinepreimage3.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generalized_affine_preimage(var, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -97,7 +97,7 @@ test03() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, LESS_OR_EQUAL, A - 2*C + 3, 4) ***");
+                    "*** gr.generalized_affine_preimage(A, LESS_OR_EQUAL, A - 2*C + 3, 4) ***");
 
   return ok;
 }
@@ -120,7 +120,7 @@ test04() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, LESS_THAN A + 2, 1) ***");
+                    "*** gr.generalized_affine_preimage(A, LESS_THAN A + 2, 1) ***");
 
   return ok;
 }
@@ -141,7 +141,7 @@ test05() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, LESS_THAN, A + 2, 1) ***");
+                    "*** gr.generalized_affine_preimage(A, LESS_THAN, A + 2, 1) ***");
 
   return ok;
 }
@@ -266,7 +266,7 @@ test10() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(B, GREATER_THAN, A + B) ***");
+                    "*** gr.generalized_affine_preimage(B, GREATER_THAN, A + B) ***");
 
   return ok;
 }
@@ -291,7 +291,7 @@ test11() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A - B + C, GREATER_THAN, 2*A - B - C) ***");
+                    "*** gr.generalized_affine_preimage(A - B + C, GREATER_THAN, 2*A - B - C) ***");
 
   return ok;
 }
@@ -317,7 +317,7 @@ test12() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A - B, GREATER_THAN, 2*A - 2*B, 0) ***");
+                    "*** gr.generalized_affine_preimage(A - B, GREATER_THAN, 2*A - 2*B, 0) ***");
 
   return ok;
 }
@@ -385,7 +385,7 @@ test15() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, GREATER_THAN , A + 2, 1, 1) ***");
+                    "*** gr.generalized_affine_preimage(A, GREATER_THAN , A + 2, 1, 1) ***");
 
   return ok;
 }
@@ -432,7 +432,7 @@ test17() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.generalized_affine_preimage(A, LESS_THAN, A + 2) ***");
+                    "*** gr.generalized_affine_preimage(A, LESS_THAN, A + 2) ***");
 
   return ok;
 }
diff --git a/tests/Grid/generator1.cc b/tests/Grid/generator1.cc
index c558e13..784e0cc 100644
--- a/tests/Grid/generator1.cc
+++ b/tests/Grid/generator1.cc
@@ -1,6 +1,6 @@
 /* Test class Grid_Generator.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -26,7 +26,7 @@ site: http://bugseng.com/products/ppl/ . */
 namespace {
 
 // Point.
-static bool
+bool
 test01() {
   Variable A(0);
   Variable B(1);
@@ -45,7 +45,7 @@ test01() {
 }
 
 // Point with divisor.
-static bool
+bool
 test02() {
   Variable A(0);
   Variable B(1);
@@ -64,7 +64,7 @@ test02() {
 }
 
 // Line.
-static bool
+bool
 test03() {
   Variable A(0);
   Variable B(1);
@@ -83,7 +83,7 @@ test03() {
 }
 
 // Parameter.
-static bool
+bool
 test04() {
   Variable A(0);
   Variable B(1);
@@ -102,7 +102,7 @@ test04() {
 }
 
 // Parameter with divisor.
-static bool
+bool
 test05() {
   Variable A(0);
   Variable B(1);
@@ -121,7 +121,7 @@ test05() {
 }
 
 // Negative first coefficient.
-static bool
+bool
 test06() {
   Variable A(0);
   Variable B(1);
@@ -140,7 +140,7 @@ test06() {
 }
 
 // Construction from Generator.
-static bool
+bool
 test07() {
   Variable A(0);
   Variable B(1);
@@ -159,7 +159,7 @@ test07() {
 }
 
 // Construction from reference to Generator.
-static bool
+bool
 test08() {
   Variable A(0);
   Variable B(1);
@@ -181,7 +181,7 @@ test08() {
 }
 
 // Create from empty linear expression.
-static bool
+bool
 test09() {
   Linear_Expression le;
   Grid_Generator a(grid_point(le));
@@ -197,7 +197,7 @@ test09() {
 }
 
 // Parameter with negative divisor.
-static bool
+bool
 test10() {
   Variable A(0);
   Variable B(1);
@@ -216,7 +216,7 @@ test10() {
 }
 
 // Point with negative divisor.
-static bool
+bool
 test11() {
   Variable A(0);
   Variable B(1);
@@ -235,7 +235,7 @@ test11() {
 }
 
 // Parameter with zero divisor.
-static bool
+bool
 test12() {
   Variable A(0);
   Variable B(1);
@@ -254,7 +254,7 @@ test12() {
 }
 
 // Point with zero divisor.
-static bool
+bool
 test13() {
   Variable A(0);
   Variable B(1);
@@ -273,7 +273,7 @@ test13() {
 }
 
 // Line.
-static bool
+bool
 test14() {
   Variable A(0);
   Variable B(1);
@@ -292,7 +292,7 @@ test14() {
 }
 
 // is_equivalent_to() and is_equal_to(): generators have different types
-static bool
+bool
 test15() {
   Variable A(0);
 
@@ -321,7 +321,7 @@ test15() {
 }
 
 // is_equivalent_to(): generators have different space dimensions
-static bool
+bool
 test16() {
   Variable A(0);
   Variable B(1);
@@ -348,8 +348,8 @@ test16() {
 }
 
 // Getting coefficients of dimensions and rebuilding a generator from
-// them. This is based on Example 6 in Grid_Generator.defs.hh
-static bool
+// them. This is based on Example 6 in Grid_Generator_defs.hh
+bool
 test17() {
   Variable A(0);
   Variable B(1);
@@ -373,7 +373,7 @@ test17() {
 }
 
 // Copy construction of a grid generator.
-static bool
+bool
 test18() {
   Variable A(0);
   Variable B(1);
@@ -392,7 +392,7 @@ test18() {
 }
 
 // Method zero_dim_point.
-static bool
+bool
 test19() {
   Grid_Generator a(Grid_Generator::zero_dim_point());
 
@@ -407,7 +407,7 @@ test19() {
 }
 
 // Method `type'.
-static bool
+bool
 test20() {
   Variable C(2);
 
@@ -424,7 +424,7 @@ test20() {
 }
 
 // Exception when trying to get the divisor of a line.
-static bool
+bool
 test21() {
   Variable C(2);
 
@@ -444,15 +444,12 @@ test21() {
   return false;
 }
 
-// Method zero_dim_point.
-static bool
+bool
 test22() {
   Variable A(0);
   Variable B(1);
   Variable C(2);
 
-  Linear_Expression le(grid_point(A - B - 2*C));
-
   bool ok = (grid_point(A - B - 2*C) == grid_point(A - B - 2*C));
 
   return ok;
diff --git a/tests/Grid/generators1.cc b/tests/Grid/generators1.cc
index 774729c..07f8eab 100644
--- a/tests/Grid/generators1.cc
+++ b/tests/Grid/generators1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -353,7 +353,7 @@ test14() {
 
 // test clear() for empty generator system.
 // This test showed a bug in the code for clear() in
-// Grid_Generator_System.inlines.hh which is now corrected.
+// Grid_Generator_System_inlines.hh which is now corrected.
 bool
 test15() {
   Grid_Generator_System gs;
diff --git a/tests/Grid/generators2.cc b/tests/Grid/generators2.cc
index f388a7b..8a6e8a7 100644
--- a/tests/Grid/generators2.cc
+++ b/tests/Grid/generators2.cc
@@ -1,6 +1,6 @@
 /* Test class Grid_Generator_System.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/grid1.cc b/tests/Grid/grid1.cc
index f4d2a77..3f6f6f8 100644
--- a/tests/Grid/grid1.cc
+++ b/tests/Grid/grid1.cc
@@ -1,6 +1,6 @@
 /* Test reduction and conversion of grids created from generators.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -46,7 +46,7 @@ test01() {
   bool ok = (gr == known_gr);
 
   print_congruences(gr,
-		    "*** gr.add_grid_generator(grid_point(2*A)) ***");
+                    "*** gr.add_grid_generator(grid_point(2*A)) ***");
 
   return ok;
 }
diff --git a/tests/Grid/grid2.cc b/tests/Grid/grid2.cc
index 55a3eb1..1d22076 100644
--- a/tests/Grid/grid2.cc
+++ b/tests/Grid/grid2.cc
@@ -1,6 +1,6 @@
 /* Test reduction and conversion of grids created from congruences.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/grid3.cc b/tests/Grid/grid3.cc
index 2875977..673e6b5 100644
--- a/tests/Grid/grid3.cc
+++ b/tests/Grid/grid3.cc
@@ -1,6 +1,6 @@
 /* Test construction of grids from constraints.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/griddifference1.cc b/tests/Grid/griddifference1.cc
index 4ec29ee..8555d4d 100644
--- a/tests/Grid/griddifference1.cc
+++ b/tests/Grid/griddifference1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::difference_assign() (a.k.a. Grid::difference_assign()).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/intersection1.cc b/tests/Grid/intersection1.cc
index a3fbd94..691c415 100644
--- a/tests/Grid/intersection1.cc
+++ b/tests/Grid/intersection1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -203,7 +203,7 @@ bool
 test07() {
   Congruence_System cgs;
   Linear_Expression le;
-  cgs.insert((le %= le) / 1);	// (0 %= 0) / 1
+  cgs.insert((le %= le) / 1);   // (0 %= 0) / 1
 
   Grid gr1(cgs);
   print_congruences(gr1, "*** gr1 ***");
diff --git a/tests/Grid/isempty1.cc b/tests/Grid/isempty1.cc
index dbc2509..8c52503 100644
--- a/tests/Grid/isempty1.cc
+++ b/tests/Grid/isempty1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::is_empty().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/isuniverse1.cc b/tests/Grid/isuniverse1.cc
index ea4068f..5a03998 100644
--- a/tests/Grid/isuniverse1.cc
+++ b/tests/Grid/isuniverse1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::is_universe().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/limitedextrapolation1.cc b/tests/Grid/limitedextrapolation1.cc
index 7554e9e..4dd0933 100644
--- a/tests/Grid/limitedextrapolation1.cc
+++ b/tests/Grid/limitedextrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::limited_congruence_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/limitedextrapolation2.cc b/tests/Grid/limitedextrapolation2.cc
index 2a2a07f..59701ef 100644
--- a/tests/Grid/limitedextrapolation2.cc
+++ b/tests/Grid/limitedextrapolation2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::limited_generator_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/limitedextrapolation3.cc b/tests/Grid/limitedextrapolation3.cc
index ae7ede1..eca8ec1 100644
--- a/tests/Grid/limitedextrapolation3.cc
+++ b/tests/Grid/limitedextrapolation3.cc
@@ -1,6 +1,6 @@
 /* Test Grid::limited_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/mapspacedims1.cc b/tests/Grid/mapspacedims1.cc
index 4412c3e..749ef8d 100644
--- a/tests/Grid/mapspacedims1.cc
+++ b/tests/Grid/mapspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::map_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/maxmin1.cc b/tests/Grid/maxmin1.cc
index 0974b7e..14d00f5 100644
--- a/tests/Grid/maxmin1.cc
+++ b/tests/Grid/maxmin1.cc
@@ -1,7 +1,7 @@
 /* Test Grid::maximize(const Linear_Expression&, ...)
    and Grid::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -31,13 +31,13 @@ namespace {
 
 bool
 check_both(Grid& gr, const Linear_Expression& le,
-	   const std::string grid_name) {
+           const std::string grid_name) {
   Generator ext_pnt(point());
   bool dummy;
   Coefficient ext_n, ext_d;
 
   bool ok = (!gr.maximize(le, ext_n, ext_d, dummy, ext_pnt)
-	     && !gr.minimize(le, ext_n, ext_d, dummy, ext_pnt));
+             && !gr.minimize(le, ext_n, ext_d, dummy, ext_pnt));
 
   if (!ok)
     nout << grid_name << " bounded expr" << endl;
@@ -47,46 +47,46 @@ check_both(Grid& gr, const Linear_Expression& le,
 
 bool
 check_minimize(Grid& gr, const Linear_Expression& le,
-	       Coefficient_traits::const_reference expected_n,
-	       Coefficient_traits::const_reference expected_d,
-	       const Generator& expected_pnt,
-	       const std::string grid_name) {
+               Coefficient_traits::const_reference expected_n,
+               Coefficient_traits::const_reference expected_d,
+               const Generator& expected_pnt,
+               const std::string grid_name) {
   Generator inf_pnt(point());
 
   bool dummy;
   Coefficient inf_n, inf_d;
 
   bool ok = (gr.minimize(le, inf_n, inf_d, dummy, inf_pnt)
-	     && inf_n == expected_n
-	     && inf_d == expected_d
-	     && inf_pnt == expected_pnt);
+             && inf_n == expected_n
+             && inf_d == expected_d
+             && inf_pnt == expected_pnt);
 
   if (!ok)
     nout << "grid name " << grid_name << " min point " << inf_pnt
-	 << " (expected " << expected_pnt << ")" << endl;
+         << " (expected " << expected_pnt << ")" << endl;
 
   return ok;
 }
 
 bool
 check_maximize(Grid& gr, const Linear_Expression& le,
-	       Coefficient_traits::const_reference expected_n,
-	       Coefficient_traits::const_reference expected_d,
-	       const Generator& expected_pnt,
-	       const std::string grid_name) {
+               Coefficient_traits::const_reference expected_n,
+               Coefficient_traits::const_reference expected_d,
+               const Generator& expected_pnt,
+               const std::string grid_name) {
   Generator sup_pnt(point());
 
   bool dummy;
   Coefficient sup_n, sup_d;
 
   bool ok = (gr.maximize(le, sup_n, sup_d, dummy, sup_pnt)
-	     && sup_n == expected_n
-	     && sup_d == expected_d
-	     && sup_pnt == expected_pnt);
+             && sup_n == expected_n
+             && sup_d == expected_d
+             && sup_pnt == expected_pnt);
 
   if (!ok)
     nout << "grid name " << grid_name << " max point " << sup_pnt
-	 << " (expected " << expected_pnt << ")" << endl;
+         << " (expected " << expected_pnt << ")" << endl;
 
   return ok;
 }
@@ -101,7 +101,7 @@ test01() {
   Generator pnt(point());
 
   bool ok = (!gr.maximize(Linear_Expression(0), extr_n, extr_d, dummy, pnt)
-	     && !gr.minimize(Linear_Expression(0), extr_n, extr_d, dummy, pnt));
+             && !gr.minimize(Linear_Expression(0), extr_n, extr_d, dummy, pnt));
   return ok;
 }
 
diff --git a/tests/Grid/membytes1.cc b/tests/Grid/membytes1.cc
index d073ff6..98e456f 100644
--- a/tests/Grid/membytes1.cc
+++ b/tests/Grid/membytes1.cc
@@ -1,7 +1,7 @@
 /* Test Grid::total_memory_in_bytes() and
    Grid::external_memory_in_bytes().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -168,7 +168,7 @@ test01() {
   Grid gr2(3, EMPTY);
   unsigned n = 0;
   for (Grid_Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i) {
+         gs_end = gs.end(); i != gs_end; ++i) {
     add_grid_generator(gr2, *i);
     if (++n % 4 == 0)
       minimize(gr2);
@@ -182,7 +182,7 @@ test01() {
 
   memory_size_type cgs_elements_size = 0;
   for (Congruence_System::const_iterator i = cgs.begin(),
-	 cgs_end = cgs.end(); i != cgs_end; ++i)
+         cgs_end = cgs.end(); i != cgs_end; ++i)
     cgs_elements_size += i->total_memory_in_bytes();
 
   nout << "Sum of sizes of contained congruences = " << cgs_elements_size
@@ -194,7 +194,7 @@ test01() {
 
   memory_size_type gs_elements_size = 0;
   for (Grid_Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     gs_elements_size += i->total_memory_in_bytes();
 
   nout << "Sum of sizes of contained generators = " << gs_elements_size
diff --git a/tests/Grid/mincongruences1.cc b/tests/Grid/mincongruences1.cc
index 4a57984..8a1d41d 100644
--- a/tests/Grid/mincongruences1.cc
+++ b/tests/Grid/mincongruences1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::minimized_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/mingenerators1.cc b/tests/Grid/mingenerators1.cc
index 543432f..1c28e64 100644
--- a/tests/Grid/mingenerators1.cc
+++ b/tests/Grid/mingenerators1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::minimized_grid_generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/outputoperator1.cc b/tests/Grid/outputoperator1.cc
index 6ac29de..5422174 100644
--- a/tests/Grid/outputoperator1.cc
+++ b/tests/Grid/outputoperator1.cc
@@ -1,6 +1,6 @@
 /* Test IO_Operators::operator<<(s, gr).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/outputoperator2.cc b/tests/Grid/outputoperator2.cc
index 6ee2af0..9340008 100644
--- a/tests/Grid/outputoperator2.cc
+++ b/tests/Grid/outputoperator2.cc
@@ -1,6 +1,6 @@
 /* Test Grid_Generator IO operators.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/outputoperator3.cc b/tests/Grid/outputoperator3.cc
index 4741099..b467c0e 100644
--- a/tests/Grid/outputoperator3.cc
+++ b/tests/Grid/outputoperator3.cc
@@ -1,6 +1,6 @@
 /* Test Grid_Generator_System IO operators.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/partition1.cc b/tests/Grid/partition1.cc
index 2f298ba..e5cbd3d 100644
--- a/tests/Grid/partition1.cc
+++ b/tests/Grid/partition1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<Grid>.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -33,11 +33,11 @@ site: http://bugseng.com/products/ppl/ . */
 #endif // PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS
 void
 partition_aux(const Congruence& c,
-	      Grid& qq,
-	      Pointset_Powerset<Grid>& r) {
+              Grid& qq,
+              Pointset_Powerset<Grid>& r) {
   const Coefficient& c_modulus = c.modulus();
   const Coefficient& c_inhomogeneous_term = c.inhomogeneous_term();
-  Linear_Expression le(c);
+  Linear_Expression le(c.expression());
   le -= c_inhomogeneous_term;
   PPL_DIRTY_TEMP_COEFFICIENT(n);
   rem_assign(n, c_inhomogeneous_term, c_modulus);
@@ -47,7 +47,7 @@ partition_aux(const Congruence& c,
       Grid qqq(qq);
       qqq.add_congruence((le+i %= 0) / c_modulus);
       if (qqq.is_empty())
-	r.add_disjunct(qqq);
+        r.add_disjunct(qqq);
     }
   qq.add_congruence(c);
 }
@@ -59,7 +59,7 @@ partition(const Grid& p, const Grid& q) {
   Grid qq = q;
   const Congruence_System& pcs = p.congruences();
   for (Congruence_System::const_iterator i = pcs.begin(),
-	 pcs_end = pcs.end(); i != pcs_end; ++i)
+         pcs_end = pcs.end(); i != pcs_end; ++i)
     partition_aux(*i, qq, r);
   return std::pair<Grid, Pointset_Powerset<Grid> >(qq, r);
 }
diff --git a/tests/Grid/powersetdifference1.cc b/tests/Grid/powersetdifference1.cc
index 8efdb6a..2aec297 100644
--- a/tests/Grid/powersetdifference1.cc
+++ b/tests/Grid/powersetdifference1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<Grid>.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/powersetgeometricallycovers1.cc b/tests/Grid/powersetgeometricallycovers1.cc
index 11b1cff..8060451 100644
--- a/tests/Grid/powersetgeometricallycovers1.cc
+++ b/tests/Grid/powersetgeometricallycovers1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<Grid>.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/powersetgeometricallyequals1.cc b/tests/Grid/powersetgeometricallyequals1.cc
index f6c965f..3e2b5e1 100644
--- a/tests/Grid/powersetgeometricallyequals1.cc
+++ b/tests/Grid/powersetgeometricallyequals1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<Grid>.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/refinewithcongruences1.cc b/tests/Grid/refinewithcongruences1.cc
index 04cfabc..deed92e 100644
--- a/tests/Grid/refinewithcongruences1.cc
+++ b/tests/Grid/refinewithcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test refine_with_congruence() and refine_with_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/refinewithconstraints1.cc b/tests/Grid/refinewithconstraints1.cc
index dd25f4d..540ac5f 100644
--- a/tests/Grid/refinewithconstraints1.cc
+++ b/tests/Grid/refinewithconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test refine_with_constraint() and refine_with_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/relations1.cc b/tests/Grid/relations1.cc
index 42880f4..e325139 100644
--- a/tests/Grid/relations1.cc
+++ b/tests/Grid/relations1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::relation_with(g).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -98,7 +98,7 @@ test05() {
   print_congruences(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(grid_point()) == Poly_Gen_Relation::nothing()
-	     && gr.relation_with(grid_point(-B)) == Poly_Gen_Relation::nothing());
+             && gr.relation_with(grid_point(-B)) == Poly_Gen_Relation::nothing());
 
   return ok;
 }
@@ -235,7 +235,7 @@ test14() {
   print_congruences(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(point()) == Poly_Gen_Relation::nothing()
-	     && gr.relation_with(point(-B)) == Poly_Gen_Relation::nothing());
+             && gr.relation_with(point(-B)) == Poly_Gen_Relation::nothing());
 
   return ok;
 }
diff --git a/tests/Grid/relations2.cc b/tests/Grid/relations2.cc
index ccd648b..991c17b 100644
--- a/tests/Grid/relations2.cc
+++ b/tests/Grid/relations2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::relation_with(cg).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -121,9 +121,9 @@ test06() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with((B %= 0) / 2)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-		 && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -147,19 +147,19 @@ test07() {
        // Proper congruence.
        && gr.relation_with(Linear_Expression(1) %= 1)
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::saturates())
+           && Poly_Con_Relation::saturates())
        // Proper congruence.
        && gr.relation_with((Linear_Expression(5) %= 1) / 4)
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::saturates())
+           && Poly_Con_Relation::saturates())
        // Equality.
        && gr.relation_with(Linear_Expression(1) %= 1)
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::saturates())
+           && Poly_Con_Relation::saturates())
        // Integrality congruence.
        && gr.relation_with(Congruence::zero_dim_integrality())
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::saturates()));
+           && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -212,7 +212,7 @@ test10() {
        == Poly_Con_Relation::is_disjoint()
        && gr.relation_with((2*A %= 1) / 0)
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::saturates())
+           && Poly_Con_Relation::saturates())
        && gr.relation_with(2*A %= 1)
        == Poly_Con_Relation::is_included());
 
@@ -230,7 +230,7 @@ test11() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with((10*A %= 1) / 0)
-	     == Poly_Con_Relation::is_disjoint());
+             == Poly_Con_Relation::is_disjoint());
 
   return ok;
 }
@@ -304,8 +304,8 @@ test15() {
   bool ok
     = (gr.relation_with((B %= 0) / 2)
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::is_disjoint()
-	   && Poly_Con_Relation::saturates()));
+           && Poly_Con_Relation::is_disjoint()
+           && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -376,8 +376,8 @@ test19() {
   bool ok
     = (gr.relation_with((A %= 0) / 8)
        == (Poly_Con_Relation::is_included()
-	   && Poly_Con_Relation::is_disjoint()
-	   && Poly_Con_Relation::saturates()));
+           && Poly_Con_Relation::is_disjoint()
+           && Poly_Con_Relation::saturates()));
 
   return ok;
 }
diff --git a/tests/Grid/relations3.cc b/tests/Grid/relations3.cc
index 08a56b9..5bc8244 100644
--- a/tests/Grid/relations3.cc
+++ b/tests/Grid/relations3.cc
@@ -1,6 +1,6 @@
 /* Test Grid::relation_with(const Constraint&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -54,19 +54,19 @@ test02() {
   using namespace Parma_Polyhedra_Library::IO_Operators;
 
   bool ok = (gr.relation_with(A + 0*B == 0)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(B > -2)
-	     == Poly_Con_Relation::is_included()
- 	     && gr.relation_with(B > 2)
- 	     == Poly_Con_Relation::is_disjoint()
- 	     && gr.relation_with(B >= 2)
- 	     == Poly_Con_Relation::is_disjoint()
- 	     && gr.relation_with(B < -2)
- 	     == Poly_Con_Relation::is_disjoint()
- 	     && gr.relation_with(B <= -2)
- 	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(B == -2)
-	     == Poly_Con_Relation::is_disjoint());
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(B > -2)
+             == Poly_Con_Relation::is_included()
+             && gr.relation_with(B > 2)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(B >= 2)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(B < -2)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(B <= -2)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(B == -2)
+             == Poly_Con_Relation::is_disjoint());
 
   return ok;
 }
@@ -82,8 +82,8 @@ test03() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(B == 1)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -98,13 +98,13 @@ test04() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(B == 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates())
-	     && gr.relation_with(B > 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates())
+             && gr.relation_with(B > 0)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -116,24 +116,24 @@ test05() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (// False.
-	     gr.relation_with(Linear_Expression(1) == 0)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(Linear_Expression(0) > 0)
-	     == (Poly_Con_Relation::saturates()
-		 && Poly_Con_Relation::is_disjoint())
-	     // True.
-	     && gr.relation_with(Linear_Expression(1) == 1)
-	     == (Poly_Con_Relation::saturates()
-		 && Poly_Con_Relation::is_included())
-	     && gr.relation_with(Linear_Expression(0) >= 0)
-	     == (Poly_Con_Relation::saturates()
-		 && Poly_Con_Relation::is_included())
-	     // False.
-	     && gr.relation_with(Linear_Expression(1) < 0)
-	     == Poly_Con_Relation::is_disjoint()
-	     // True.
-	     && gr.relation_with(Linear_Expression(1) >= 0)
-	     == Poly_Con_Relation::is_included());
+             gr.relation_with(Linear_Expression(1) == 0)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(Linear_Expression(0) > 0)
+             == (Poly_Con_Relation::saturates()
+                 && Poly_Con_Relation::is_disjoint())
+             // True.
+             && gr.relation_with(Linear_Expression(1) == 1)
+             == (Poly_Con_Relation::saturates()
+                 && Poly_Con_Relation::is_included())
+             && gr.relation_with(Linear_Expression(0) >= 0)
+             == (Poly_Con_Relation::saturates()
+                 && Poly_Con_Relation::is_included())
+             // False.
+             && gr.relation_with(Linear_Expression(1) < 0)
+             == Poly_Con_Relation::is_disjoint()
+             // True.
+             && gr.relation_with(Linear_Expression(1) >= 0)
+             == Poly_Con_Relation::is_included());
 
   return ok;
 }
@@ -150,11 +150,11 @@ test06() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(5*A - 2*B == 1)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(5*A - 2*B > 1)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(5*A - 2*B >= 1)
-	     == Poly_Con_Relation::is_disjoint());
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(5*A - 2*B > 1)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(5*A - 2*B >= 1)
+             == Poly_Con_Relation::is_disjoint());
 
   return ok;
 }
@@ -169,15 +169,15 @@ test07() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A == 3)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(2*A == 1)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::saturates())
-	     && gr.relation_with(2*A < 1)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(2*A >= 1)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::saturates()));
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(2*A == 1)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates())
+             && gr.relation_with(2*A < 1)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(2*A >= 1)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -193,9 +193,9 @@ test08() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(10*A == 1)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(Linear_Expression(10) > 10)
-	     == Poly_Con_Relation::is_disjoint());
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(Linear_Expression(10) > 10)
+             == Poly_Con_Relation::is_disjoint());
 
   return ok;
 }
@@ -211,11 +211,11 @@ test09() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(Linear_Expression(10) == 10)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::saturates())
-	     && gr.relation_with(Linear_Expression(10) >= 10)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates())
+             && gr.relation_with(Linear_Expression(10) >= 10)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -232,9 +232,9 @@ test10() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A + B == 0)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(A + B >= 0)
-	     == Poly_Con_Relation::strictly_intersects());
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(A + B >= 0)
+             == Poly_Con_Relation::strictly_intersects());
 
   return ok;
 }
@@ -272,13 +272,13 @@ test12() {
   print_congruences(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(B == 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates())
-	     && gr.relation_with(B >= 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates())
+             && gr.relation_with(B >= 0)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -294,7 +294,7 @@ test13() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A == 0)
-	     == Poly_Con_Relation::is_disjoint());
+             == Poly_Con_Relation::is_disjoint());
 
   return ok;
 }
@@ -312,7 +312,7 @@ test14() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A + B == 0)
-	     == Poly_Con_Relation::strictly_intersects());
+             == Poly_Con_Relation::strictly_intersects());
 
   return ok;
 }
@@ -330,7 +330,7 @@ test15() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A + B == 0)
-	     == Poly_Con_Relation::strictly_intersects());
+             == Poly_Con_Relation::strictly_intersects());
 
   return ok;
 }
@@ -347,13 +347,13 @@ test16() {
   print_congruences(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A + B == 8)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates())
-	     && gr.relation_with(A + B > 8)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates())
+             && gr.relation_with(A + B > 8)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -370,13 +370,13 @@ test17() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A > 1)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(A >= 1)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(A < 1)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(A <= 1)
-	     == Poly_Con_Relation::strictly_intersects());
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(A >= 1)
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(A < 1)
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(A <= 1)
+             == Poly_Con_Relation::strictly_intersects());
 
   return ok;
 }
@@ -396,14 +396,14 @@ test18() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(A + B + C == 0)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(A + B == 0)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(A == 0)
-	     == Poly_Con_Relation::strictly_intersects()
-	     && gr.relation_with(Linear_Expression(0) == 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::saturates()));
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(A + B == 0)
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(A == 0)
+             == Poly_Con_Relation::strictly_intersects()
+             && gr.relation_with(Linear_Expression(0) == 0)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -415,25 +415,25 @@ test19() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (// False.
-	     gr.relation_with(Linear_Expression(1) == 0)
-	     == (Poly_Con_Relation::is_disjoint()
-		 && Poly_Con_Relation::is_included()
-	         && Poly_Con_Relation::saturates())
-	     // True.
-	     && gr.relation_with(Linear_Expression(1) == 1)
-	     == (Poly_Con_Relation::is_disjoint()
-		 && Poly_Con_Relation::is_included()
-	         && Poly_Con_Relation::saturates())
-	     // False.
-	     && gr.relation_with(Linear_Expression(1) < 0)
-	     == (Poly_Con_Relation::is_disjoint()
-		 && Poly_Con_Relation::is_included()
-	         && Poly_Con_Relation::saturates())
-	     // True.
-	     && gr.relation_with(Linear_Expression(1) >= 0)
-	     == (Poly_Con_Relation::is_disjoint()
-		 && Poly_Con_Relation::is_included()
-	         && Poly_Con_Relation::saturates()));
+             gr.relation_with(Linear_Expression(1) == 0)
+             == (Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates())
+             // True.
+             && gr.relation_with(Linear_Expression(1) == 1)
+             == (Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates())
+             // False.
+             && gr.relation_with(Linear_Expression(1) < 0)
+             == (Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates())
+             // True.
+             && gr.relation_with(Linear_Expression(1) >= 0)
+             == (Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::saturates()));
 
   return ok;
 }
@@ -452,11 +452,11 @@ test20() {
   print_generators(gr, "*** gr ***");
 
   bool ok = (gr.relation_with(5*A - 2*B == 1)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(5*A - 2*B > 1)
-	     == Poly_Con_Relation::is_disjoint()
-	     && gr.relation_with(5*A - 2*B >= 1)
-	     == Poly_Con_Relation::is_disjoint());
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(5*A - 2*B > 1)
+             == Poly_Con_Relation::is_disjoint()
+             && gr.relation_with(5*A - 2*B >= 1)
+             == Poly_Con_Relation::is_disjoint());
 
   return ok;
 }
diff --git a/tests/Grid/removespacedims1.cc b/tests/Grid/removespacedims1.cc
index 202851c..cf97d9e 100644
--- a/tests/Grid/removespacedims1.cc
+++ b/tests/Grid/removespacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::remove_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/removespacedims2.cc b/tests/Grid/removespacedims2.cc
index aa0ba4c..b11f2be 100644
--- a/tests/Grid/removespacedims2.cc
+++ b/tests/Grid/removespacedims2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::remove_higher_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/simplifyusingcontext1.cc b/tests/Grid/simplifyusingcontext1.cc
index 4b1742a..0f0e13f 100644
--- a/tests/Grid/simplifyusingcontext1.cc
+++ b/tests/Grid/simplifyusingcontext1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::simplify_using_context_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/timeelapse1.cc b/tests/Grid/timeelapse1.cc
index 564a5a4..5048665 100644
--- a/tests/Grid/timeelapse1.cc
+++ b/tests/Grid/timeelapse1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::time_elapse_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/topclosed1.cc b/tests/Grid/topclosed1.cc
index 1ee052c..8a0ef5c 100644
--- a/tests/Grid/topclosed1.cc
+++ b/tests/Grid/topclosed1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::is_topologically_closed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/topclosure1.cc b/tests/Grid/topclosure1.cc
index 1a05bcf..4c8f269 100644
--- a/tests/Grid/topclosure1.cc
+++ b/tests/Grid/topclosure1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::topological_closure_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/unconstrain1.cc b/tests/Grid/unconstrain1.cc
index fcc1cdf..dc3189a 100644
--- a/tests/Grid/unconstrain1.cc
+++ b/tests/Grid/unconstrain1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::unconstrain().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/upperbound1.cc b/tests/Grid/upperbound1.cc
index 94078fa..b3fae44 100644
--- a/tests/Grid/upperbound1.cc
+++ b/tests/Grid/upperbound1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::upper_bound_assign()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/upperbound2.cc b/tests/Grid/upperbound2.cc
index b84e414..4054767 100644
--- a/tests/Grid/upperbound2.cc
+++ b/tests/Grid/upperbound2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::upper_bound_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/widening1.cc b/tests/Grid/widening1.cc
index 6da3845..2b93614 100644
--- a/tests/Grid/widening1.cc
+++ b/tests/Grid/widening1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::congruence_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/widening2.cc b/tests/Grid/widening2.cc
index fd954d7..4f58f62 100644
--- a/tests/Grid/widening2.cc
+++ b/tests/Grid/widening2.cc
@@ -1,6 +1,6 @@
 /* Test Grid::generator_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/widening3.cc b/tests/Grid/widening3.cc
index ccd249f..a1316bd 100644
--- a/tests/Grid/widening3.cc
+++ b/tests/Grid/widening3.cc
@@ -1,6 +1,6 @@
 /* Test Grid::widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/wrap1.cc b/tests/Grid/wrap1.cc
index c826567..dc8101e 100644
--- a/tests/Grid/wrap1.cc
+++ b/tests/Grid/wrap1.cc
@@ -1,6 +1,6 @@
 /* Test Grid::wrap_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Grid/writecongruencesystem.cc b/tests/Grid/writecongruencesystem.cc
index 6f8563d..422dfab 100644
--- a/tests/Grid/writecongruencesystem.cc
+++ b/tests/Grid/writecongruencesystem.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(std::ostream&, const Congruence_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/MIP_Problem/Makefile.am b/tests/MIP_Problem/Makefile.am
index 434e050..100f0bc 100644
--- a/tests/MIP_Problem/Makefile.am
+++ b/tests/MIP_Problem/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/MIP_Problem/Makefile.in b/tests/MIP_Problem/Makefile.in
index 9ed7ced..fcd7aa6 100644
--- a/tests/MIP_Problem/Makefile.in
+++ b/tests/MIP_Problem/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -62,7 +78,8 @@ TESTS = ascii_dump_load1$(EXEEXT) exceptions1$(EXEEXT) \
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1) $(am__EXEEXT_2)
 subdir = tests/MIP_Problem
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -108,6 +125,7 @@ ascii_dump_load1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_exceptions1_OBJECTS = exceptions1.$(OBJEXT)
 exceptions1_OBJECTS = $(am_exceptions1_OBJECTS)
 exceptions1_LDADD = $(LDADD)
@@ -138,6 +156,18 @@ mipproblem4_LDADD = $(LDADD)
 mipproblem4_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -150,30 +180,33 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(ascii_dump_load1_SOURCES) $(exceptions1_SOURCES) \
 	$(mipproblem1_SOURCES) $(mipproblem2_SOURCES) \
 	$(mipproblem3_SOURCES) $(mipproblem4_SOURCES)
 DIST_SOURCES = $(ascii_dump_load1_SOURCES) $(exceptions1_SOURCES) \
 	$(mipproblem1_SOURCES) $(mipproblem2_SOURCES) \
 	$(mipproblem3_SOURCES) $(mipproblem4_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -555,6 +588,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -568,7 +615,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -792,8 +839,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/MIP_Problem/ascii_dump_load1.cc b/tests/MIP_Problem/ascii_dump_load1.cc
index 8eb1777..f34a673 100644
--- a/tests/MIP_Problem/ascii_dump_load1.cc
+++ b/tests/MIP_Problem/ascii_dump_load1.cc
@@ -1,6 +1,6 @@
 /* Test MIP_Problem::ascii_dump() and MIP_Problem::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/MIP_Problem/exceptions1.cc b/tests/MIP_Problem/exceptions1.cc
index 2ea9c94..51aecdd 100644
--- a/tests/MIP_Problem/exceptions1.cc
+++ b/tests/MIP_Problem/exceptions1.cc
@@ -1,6 +1,6 @@
 /* Test that the right exceptions are thrown in case of incorrect uses.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -227,7 +227,7 @@ test10() {
   try {
     // This tries to overflow the maximum space dimension.
     MIP_Problem mip(MIP_Problem::max_space_dimension() + 1,
-		    cs, cost, MAXIMIZATION);
+                    cs, cost, MAXIMIZATION);
   }
   catch (std::length_error& e) {
     nout << "length_error: " << e.what() << endl << endl;
@@ -394,8 +394,8 @@ test16() {
   try {
     // This tries to overflow the maximum space dimension.
     MIP_Problem mip(MIP_Problem::max_space_dimension() + 1,
-		    cs.begin(), cs.end(),
-		    A + B, MAXIMIZATION);
+                    cs.begin(), cs.end(),
+                    A + B, MAXIMIZATION);
   }
   catch (std::length_error& e) {
     nout << "length_error: " << e.what() << endl << endl;
@@ -421,8 +421,8 @@ test17() {
   try {
     // This tries to let exceed the objective function space dimension.
     MIP_Problem mip(cs.space_dimension(),
-		    cs.begin(), cs.end(),
-		    A + B + C, MAXIMIZATION);
+                    cs.begin(), cs.end(),
+                    A + B + C, MAXIMIZATION);
   }
   catch (std::invalid_argument& e) {
     nout << "invalid_argument: " << e.what() << endl << endl;
@@ -447,7 +447,7 @@ test18() {
   try {
     // This tries to build an MIP_Problem with strict inequalities..
     MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(),
-		    A + B, MAXIMIZATION);
+                    A + B, MAXIMIZATION);
   }
   catch (std::invalid_argument& e) {
     nout << "invalid_argument: " << e.what() << endl << endl;
@@ -472,7 +472,7 @@ test19() {
   try {
     // This tries to build an MIP_Problem with a wrong space dimension.
     MIP_Problem mip(cs.space_dimension() - 1, cs.begin(), cs.end(),
-		    A + B, MAXIMIZATION);
+                    A + B, MAXIMIZATION);
   }
   catch (std::invalid_argument& e) {
     nout << "invalid_argument: " << e.what() << endl << endl;
diff --git a/tests/MIP_Problem/mipproblem1.cc b/tests/MIP_Problem/mipproblem1.cc
index 46eb895..099082e 100644
--- a/tests/MIP_Problem/mipproblem1.cc
+++ b/tests/MIP_Problem/mipproblem1.cc
@@ -1,6 +1,6 @@
 /* Test the MIP_Problem class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -74,10 +74,10 @@ test01() {
   cs.insert(X02 - Coefficient("3152519739159347")*X14 >= 0);
   cs.insert(X06 + X07 + X08 + X09 - X14 - X15 == 0);
   cs.insert(Coefficient("2386907802506363")*X06
-	    + Coefficient("2386907802506363")*X07
-	    + Coefficient("1080863910568919")*X08
-	    + Coefficient("7746191359077253")*X09
-	    - X16 == 0);
+            + Coefficient("2386907802506363")*X07
+            + Coefficient("1080863910568919")*X08
+            + Coefficient("7746191359077253")*X09
+            - X16 == 0);
   cs.insert(-X06 + X10 >= -80);
   cs.insert(-X07 + X11 >= 0);
   cs.insert(-X08 + X12 >= 0);
@@ -87,30 +87,30 @@ test01() {
   cs.insert(-X22 >= -500);
   cs.insert(X23 - Coefficient("3152519739159347")*X36 >= 0);
   cs.insert(Coefficient("7746191359077253")*X28
-	    + Coefficient("7746191359077253")*X29
-	    + Coefficient("3512807709348987")*X30
-	    + Coefficient("3332663724254167")*X31
-	    - X38 == 0);
+            + Coefficient("7746191359077253")*X29
+            + Coefficient("3512807709348987")*X30
+            + Coefficient("3332663724254167")*X31
+            - X38 == 0);
   cs.insert(X28 + X29 + X30 + X31 - X36 + X37 + X39 == 44);
   cs.insert(-X28 + X32 >= -500);
   cs.insert(-X29 + X33 >= 0);
   cs.insert(-X30 + X34 >= 0);
   cs.insert(-X31 + X35 >= 0);
   cs.insert(Coefficient("-2661627379775963")*X10
-	    - Coefficient("2686397177726501")*X11
-	    - Coefficient("5422333951354077")*X12
-	    - Coefficient("5469621747441467")*X13
-	    + X25
-	    - Coefficient("2466846695892189")*X32
-	    - Coefficient("4996743786567565")*X33
-	    - Coefficient("5064297780978123")*X34
-	    - Coefficient("641481471923585")*X35 >= 0);
+            - Coefficient("2686397177726501")*X11
+            - Coefficient("5422333951354077")*X12
+            - Coefficient("5469621747441467")*X13
+            + X25
+            - Coefficient("2466846695892189")*X32
+            - Coefficient("4996743786567565")*X33
+            - Coefficient("5064297780978123")*X34
+            - Coefficient("641481471923585")*X35 >= 0);
   cs.insert(X03 - Coefficient("7854277750134145")*X22 >= 0);
   cs.insert(X15
-	    - Coefficient("7854277750134145")*X28
-	    - Coefficient("7782220156096217")*X29
-	    - Coefficient("7782220156096217")*X30
-	    - Coefficient("7710162562058289")*X31 >= 0);
+            - Coefficient("7854277750134145")*X28
+            - Coefficient("7782220156096217")*X29
+            - Coefficient("7782220156096217")*X30
+            - Coefficient("7710162562058289")*X31 >= 0);
   cs.insert(Coefficient("-5422333951354077")*X01 + X24 >= 0);
   cs.insert(X21 >= 2);
   cs.insert(-X16 - X38 >= -300);
@@ -217,8 +217,8 @@ test02() {
   nout << "Optimizing point = ";
   print_generator(pg);
   pg_kr = point(17100*A + 26174*B + 2274482*C
-		+ 1063871*D + 388070456*E + 18627830*F + 0*H,
-		94392);
+                + 1063871*D + 388070456*E + 18627830*F + 0*H,
+                94392);
   if (pg != pg_kr)
     return false;
 
@@ -239,485 +239,485 @@ test03() {
 
   Constraint_System cs;
   cs.insert(Coefficient("2251799813685248")*A
-	    >= Coefficient("-5895288448651847"));
+            >= Coefficient("-5895288448651847"));
   cs.insert(Coefficient("5895288437392848")*A
-	    + Coefficient("3643488632714799")*B
-	    - Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554137963492"));
+            + Coefficient("3643488632714799")*B
+            - Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554137963492"));
   cs.insert(Coefficient("5895288437392848")*A +
-	    Coefficient("3643488632714799")*B
-	    + Coefficient("2251799813685248")*C >=
-	    Coefficient("-19077554137963492"));
+            Coefficient("3643488632714799")*B
+            + Coefficient("2251799813685248")*C >=
+            Coefficient("-19077554137963492"));
   cs.insert(Coefficient("11790576874785696")*A
-	    + Coefficient("4503599627370496")*B
-	    + Coefficient("7286977274436797")*D
-	    >= Coefficient("-38155108284934184"));
+            + Coefficient("4503599627370496")*B
+            + Coefficient("7286977274436797")*D
+            >= Coefficient("-38155108284934184"));
   cs.insert(Coefficient("11790576874785696")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*D
-	    >= Coefficient("-38155108284934184"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("7286977274436797")*D
+            >= Coefficient("-38155108284934184"));
   cs.insert(Coefficient("11790576879289294")*A
-	    + Coefficient("7286977274436797")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            + Coefficient("7286977274436797")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    + Coefficient("7286977274436797")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            + Coefficient("7286977274436797")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    - Coefficient("7286977274436797")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            - Coefficient("7286977274436797")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    - Coefficient("7286977274436797")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            - Coefficient("7286977274436797")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("2947644225451823")*A
-	    - Coefficient("1125899906842624")*B
-	    + Coefficient("1821744319735099")*D
-	    >= Coefficient("-9538777088122044"));
+            - Coefficient("1125899906842624")*B
+            + Coefficient("1821744319735099")*D
+            >= Coefficient("-9538777088122044"));
   cs.insert(Coefficient("11790576892800094")*A
-	    - Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*D
-	    >= Coefficient("-38155108325466584"));
+            - Coefficient("4503599627370496")*B
+            - Coefficient("7286977274436797")*D
+            >= Coefficient("-38155108325466584"));
   cs.insert(Coefficient("5895288437392848")*A
-	    - Coefficient("3643488630462999")*B
-	    + Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554133459892"));
+            - Coefficient("3643488630462999")*B
+            + Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554133459892"));
   cs.insert(Coefficient("2947644218696424")*A
-	    - Coefficient("1821744320860999")*B
-	    - Coefficient("1125899906842624")*C
-	    >= Coefficient("-9538777072359446"));
+            - Coefficient("1821744320860999")*B
+            - Coefficient("1125899906842624")*C
+            >= Coefficient("-9538777072359446"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("11790576924325290")*B
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108379509776"));
+            + Coefficient("11790576924325290")*B
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108379509776"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("11790576924325290")*B
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108379509776"));
+            + Coefficient("11790576924325290")*B
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108379509776"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644226577723"));
+            + Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644226577723"));
+            + Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644225451823"));
+            + Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644225451823"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644225451823"));
+            + Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644225451823"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("4503599627370496")*B
-	    + Coefficient("11790576865778496")*C
-	    >= Coefficient("-38155108266919784"));
+            + Coefficient("4503599627370496")*B
+            + Coefficient("11790576865778496")*C
+            >= Coefficient("-38155108266919784"));
   cs.insert(Coefficient("7286977251918799")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("11790576870282096")*C
-	    >= Coefficient("-38155108244401792"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("11790576870282096")*C
+            >= Coefficient("-38155108244401792"));
   cs.insert(Coefficient("1821744320860999")*A
-	    + Coefficient("1125899906842624")*C
-	    + Coefficient("2947644226577723")*D
-	    >= Coefficient("-9538777093751544"));
+            + Coefficient("1125899906842624")*C
+            + Coefficient("2947644226577723")*D
+            >= Coefficient("-9538777093751544"));
   cs.insert(Coefficient("1821744320860999")*A
-	    + Coefficient("1125899906842624")*C
-	    - Coefficient("2947644226577723")*
-	    D >= Coefficient("-9538777093751544"));
+            + Coefficient("1125899906842624")*C
+            - Coefficient("2947644226577723")*
+            D >= Coefficient("-9538777093751544"));
   cs.insert(Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("2947644228829523")*D
-	    >= Coefficient("-9538777096003344"));
+            - Coefficient("1125899906842624")*C
+            + Coefficient("2947644228829523")*D
+            >= Coefficient("-9538777096003344"));
   cs.insert(Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("2947644228829523")*D
-	    >= Coefficient("-9538777096003344"));
+            - Coefficient("1125899906842624")*C
+            - Coefficient("2947644228829523")*D
+            >= Coefficient("-9538777096003344"));
   cs.insert(Coefficient("3643488664239996")*A
-	    - Coefficient("2251799813685248")*B
-	    + Coefficient("5895288468918045")*C
-	    >= Coefficient("-19077554257308884"));
+            - Coefficient("2251799813685248")*B
+            + Coefficient("5895288468918045")*C
+            >= Coefficient("-19077554257308884"));
   cs.insert(Coefficient("3643488652980997")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("5895288468918045")*C
-	    >= Coefficient("-19077554232539084"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("5895288468918045")*C
+            >= Coefficient("-19077554232539084"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644226577723"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644229392473"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644229392473"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644227140673"));
+            - Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644227140673"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644227703623"));
+            - Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644227703623"));
   cs.insert(Coefficient("7286977314969193")*A
-	    - Coefficient("11790576906310892")*B
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108447063768"));
+            - Coefficient("11790576906310892")*B
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108447063768"));
   cs.insert(Coefficient("3643488655232797")*A
-	    - Coefficient("5895288446400047")*B
-	    - Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554203265688"));
+            - Coefficient("5895288446400047")*B
+            - Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554203265688"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576753188506")*B
-	    + Coefficient("7286977179861205")*C
-	    >= Coefficient("-38155107920142616"));
+            + Coefficient("11790576753188506")*B
+            + Coefficient("7286977179861205")*C
+            >= Coefficient("-38155107920142616"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576766699304")*B
-	    - Coefficient("7286977179861205")*C
-	    >= Coefficient("-38155107965178608"));
+            + Coefficient("11790576766699304")*B
+            - Coefficient("7286977179861205")*C
+            >= Coefficient("-38155107965178608"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("7286977157343207")*B
-	    + Coefficient("11790576712656108")*D
-	    >= Coefficient("-38155107816559824"));
+            + Coefficient("7286977157343207")*B
+            + Coefficient("11790576712656108")*D
+            >= Coefficient("-38155107816559824"));
   cs.insert(Coefficient("2251799813685248")*A
-	    + Coefficient("3643488592182402")*B
-	    - Coefficient("5895288374342453")*D
-	    >= Coefficient("-19077553960071308"));
+            + Coefficient("3643488592182402")*B
+            - Coefficient("5895288374342453")*D
+            >= Coefficient("-19077553960071308"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576753188506")*C
-	    + Coefficient("7286977175357605")*D
-	    >= Coefficient("-38155107924646216"));
+            + Coefficient("11790576753188506")*C
+            + Coefficient("7286977175357605")*D
+            >= Coefficient("-38155107924646216"));
   cs.insert(Coefficient("2251799813685248")*A
-	    + Coefficient("5895288390105051")*C
-	    - Coefficient("3643488594434202")*D
-	    >= Coefficient("-19077553996100104"));
+            + Coefficient("5895288390105051")*C
+            - Coefficient("3643488594434202")*D
+            >= Coefficient("-19077553996100104"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("5895288421630249")*C
-	    + Coefficient("3643488619204000")*D
-	    >= Coefficient("-19077554088423896"));
+            - Coefficient("5895288421630249")*C
+            + Coefficient("3643488619204000")*D
+            >= Coefficient("-19077554088423896"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("11790576865778496")*C
-	    - Coefficient("7286977247415199")*D
-	    >= Coefficient("-38155108244401792"));
+            - Coefficient("11790576865778496")*C
+            - Coefficient("7286977247415199")*D
+            >= Coefficient("-38155108244401792"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("7286977247415199")*B
-	    + Coefficient("11790576888296494")*D
-	    >= Coefficient("-38155108307452184"));
+            - Coefficient("7286977247415199")*B
+            + Coefficient("11790576888296494")*D
+            >= Coefficient("-38155108307452184"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("3643488639470198")*B
-	    - Coefficient("5895288464414445")*D
-	    >= Coefficient("-19077554210021088"));
+            - Coefficient("3643488639470198")*B
+            - Coefficient("5895288464414445")*D
+            >= Coefficient("-19077554210021088"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("5895288428385648")*B
-	    + Coefficient("3643488630462999")*C
-	    >= Coefficient("-19077554131208092"));
+            - Coefficient("5895288428385648")*B
+            + Coefficient("3643488630462999")*C
+            >= Coefficient("-19077554131208092"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("11790576843260498")*B
-	    - Coefficient("7286977224897201")*C
-	    >= Coefficient("-38155108163336992"));
+            - Coefficient("11790576843260498")*B
+            - Coefficient("7286977224897201")*C
+            >= Coefficient("-38155108163336992"));
   cs.insert(Coefficient("1125899906842624")*B
-	    >= Coefficient("-2947644227703623"));
+            >= Coefficient("-2947644227703623"));
   cs.insert(Coefficient("5895288459910846")*B
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("3643488630462999")*D
-	    >= Coefficient("-19077554198762088"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("3643488630462999")*D
+            >= Coefficient("-19077554198762088"));
   cs.insert(Coefficient("5895288457659046")*B
-	    + Coefficient("2251799813685248")*C
-	    - Coefficient("3643488628211199")*D
-	    >= Coefficient("-19077554189754888"));
+            + Coefficient("2251799813685248")*C
+            - Coefficient("3643488628211199")*D
+            >= Coefficient("-19077554189754888"));
   cs.insert(Coefficient("11790576915318092")*B
-	    - Coefficient("4503599627370496")*C
-	    + Coefficient("7286977269933197")*D
-	    >= Coefficient("-38155108393020576"));
+            - Coefficient("4503599627370496")*C
+            + Coefficient("7286977269933197")*D
+            >= Coefficient("-38155108393020576"));
   cs.insert(Coefficient("5895288457659046")*B
-	    - Coefficient("2251799813685248")*C
-	    - Coefficient("3643488632714799")*D
-	    >= Coefficient("-19077554187503088"));
+            - Coefficient("2251799813685248")*C
+            - Coefficient("3643488632714799")*D
+            >= Coefficient("-19077554187503088"));
   cs.insert(Coefficient("7286977292451195")*B
-	    + Coefficient("11790576919821692")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108433552976"));
+            + Coefficient("11790576919821692")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108433552976"));
   cs.insert(Coefficient("3643488664239996")*B
-	    + Coefficient("5895288486932443")*C
-	    - Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554304596680"));
+            + Coefficient("5895288486932443")*C
+            - Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554304596680"));
   cs.insert(Coefficient("3643488643973798")*B
-	    - Coefficient("5895288446400047")*C
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554180747688"));
+            - Coefficient("5895288446400047")*C
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554180747688"));
   cs.insert(Coefficient("7286977314969193")*B
-	    - Coefficient("11790576937836090")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108510114168"));
+            - Coefficient("11790576937836090")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108510114168"));
   cs.insert(Coefficient("4503599627370496")*B
-	    + Coefficient("7286977247415199")*C
-	    + Coefficient("11790576883792894")*D
-	    >= Coefficient("-38155108289437784"));
+            + Coefficient("7286977247415199")*C
+            + Coefficient("11790576883792894")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("4503599627370496")*B
-	    + Coefficient("7286977251918799")*C
-	    - Coefficient("11790576883792894")*D
-	    >= Coefficient("-38155108280430584"));
+            + Coefficient("7286977251918799")*C
+            - Coefficient("11790576883792894")*D
+            >= Coefficient("-38155108280430584"));
   cs.insert(Coefficient("4503599627370496")*B
-	    - Coefficient("7286977229400801")*C
-	    + Coefficient("11790576852267696")*D
-	    >= Coefficient("-38155108181351392"));
+            - Coefficient("7286977229400801")*C
+            + Coefficient("11790576852267696")*D
+            >= Coefficient("-38155108181351392"));
   cs.insert(Coefficient("1125899906842624")*D
-	    >= Coefficient("-2947644225451823"));
+            >= Coefficient("-2947644225451823"));
   cs.insert(Coefficient("4503599627370496")*B
-	    - Coefficient("7286977229400801")*C
-	    - Coefficient("11790576852267696")*D
-	    >= Coefficient("-38155108167840592"));
+            - Coefficient("7286977229400801")*C
+            - Coefficient("11790576852267696")*D
+            >= Coefficient("-38155108167840592"));
   cs.insert(Coefficient("-2251799813685248")*D
-	    >= Coefficient("-5895288448651847"));
+            >= Coefficient("-5895288448651847"));
   cs.insert(Coefficient("2251799813685248")*C
-	    >= Coefficient("-5895288446400047"));
+            >= Coefficient("-5895288446400047"));
   cs.insert(Coefficient("-2251799813685248")*C
-	    >= Coefficient("-5895288444148247"));
+            >= Coefficient("-5895288444148247"));
   cs.insert(Coefficient("-1125899906842624")*B
-	    + Coefficient("1821744321986899")*C
-	    + Coefficient("2947644226577723")*D
-	    >= Coefficient("-9538777088122044"));
+            + Coefficient("1821744321986899")*C
+            + Coefficient("2947644226577723")*D
+            >= Coefficient("-9538777088122044"));
   cs.insert(Coefficient("-3643488607945001")*B
-	    + Coefficient("5895288414874849")*C
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554059150500"));
+            + Coefficient("5895288414874849")*C
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554059150500"));
   cs.insert(Coefficient("-4503599627370496")*B
-	    + Coefficient("7286977292451195")*C
-	    - Coefficient("11790576906310892")*D
-	    >= Coefficient("-38155108343480984"));
+            + Coefficient("7286977292451195")*C
+            - Coefficient("11790576906310892")*D
+            >= Coefficient("-38155108343480984"));
   cs.insert(Coefficient("-7286977220393601")*B
-	    + Coefficient("11790576829749698")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108086775800"));
+            + Coefficient("11790576829749698")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108086775800"));
   cs.insert(Coefficient("-4503599627370496")*B
-	    - Coefficient("7286977274436797")*C
-	    + Coefficient("11790576901807292")*D
-	    >= Coefficient("-38155108325466584"));
+            - Coefficient("7286977274436797")*C
+            + Coefficient("11790576901807292")*D
+            >= Coefficient("-38155108325466584"));
   cs.insert(Coefficient("-3643488605693201")*B
-	    - Coefficient("5895288414874849")*C
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554059150500"));
+            - Coefficient("5895288414874849")*C
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554059150500"));
   cs.insert(Coefficient("-1125899906842624")*B
-	    - Coefficient("1821744319735099")*C
-	    - Coefficient("2947644225451823")*D
-	    >= Coefficient("-9538777079114846"));
+            - Coefficient("1821744319735099")*C
+            - Coefficient("2947644225451823")*D
+            >= Coefficient("-9538777079114846"));
   cs.insert(Coefficient("-7286977220393601")*B
-	    - Coefficient("11790576834253298")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108113797400"));
+            - Coefficient("11790576834253298")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108113797400"));
   cs.insert(Coefficient("-5895288462162645")*B
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("3643488639470198")*D
-	    >= Coefficient("-19077554144718892"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("3643488639470198")*D
+            >= Coefficient("-19077554144718892"));
   cs.insert(Coefficient("-11790576924325290")*B
-	    - Coefficient("4503599627370496")*C
-	    + Coefficient("7286977292451195")*D
-	    >= Coefficient("-38155108320962984"));
+            - Coefficient("4503599627370496")*C
+            + Coefficient("7286977292451195")*D
+            >= Coefficient("-38155108320962984"));
   cs.insert(Coefficient("-5895288468918045")*B
-	    + Coefficient("2251799813685248")*C
-	    - Coefficient("3643488641721998")*D
-	    >= Coefficient("-19077554160481492"));
+            + Coefficient("2251799813685248")*C
+            - Coefficient("3643488641721998")*D
+            >= Coefficient("-19077554160481492"));
   cs.insert(Coefficient("-11790576928828890")*B
-	    - Coefficient("4503599627370496")*C
-	    - Coefficient("7286977292451195")*D
-	    >= Coefficient("-38155108329970184"));
+            - Coefficient("4503599627370496")*C
+            - Coefficient("7286977292451195")*D
+            >= Coefficient("-38155108329970184"));
   cs.insert(Coefficient("-281474976710656")*B
-	    >= Coefficient("-736911053829681"));
+            >= Coefficient("-736911053829681"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    + Coefficient("11790576658612912")*B
-	    + Coefficient("7286977125818009")*C
-	    >= Coefficient("-38155107627408640"));
+            + Coefficient("11790576658612912")*B
+            + Coefficient("7286977125818009")*C
+            >= Coefficient("-38155107627408640"));
   cs.insert(Coefficient("-2251799813685248")*A
-	    + Coefficient("5895288336061856")*B
-	    - Coefficient("3643488560657205")*C
-	    >= Coefficient("-19077553829466920"));
+            + Coefficient("5895288336061856")*B
+            - Coefficient("3643488560657205")*C
+            >= Coefficient("-19077553829466920"));
   cs.insert(Coefficient("-2251799813685248")*A
-	    + Coefficient("3643488535887407")*B
-	    + Coefficient("5895288288774060")*D
-	    >= Coefficient("-19077553683099932"));
+            + Coefficient("3643488535887407")*B
+            + Coefficient("5895288288774060")*D
+            >= Coefficient("-19077553683099932"));
   cs.insert(Coefficient("-7286977274436797")*A
-	    + Coefficient("11790576766699304")*B
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108032732608"));
+            + Coefficient("11790576766699304")*B
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108032732608"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    + Coefficient("7286977098796411")*B
-	    - Coefficient("11790576609073318")*D
-	    >= Coefficient("-38155107483293448"));
+            + Coefficient("7286977098796411")*B
+            - Coefficient("11790576609073318")*D
+            >= Coefficient("-38155107483293448"));
   cs.insert(Coefficient("-7286977301458395")*A
-	    + Coefficient("11790576735174106")*B
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155107983193008"));
+            + Coefficient("11790576735174106")*B
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155107983193008"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    + Coefficient("11790576708152508")*C
-	    + Coefficient("7286977148336007")*D
-	    >= Coefficient("-38155107771523824"));
+            + Coefficient("11790576708152508")*C
+            + Coefficient("7286977148336007")*D
+            >= Coefficient("-38155107771523824"));
   cs.insert(Coefficient("-281474976710656")*A
-	    + Coefficient("281474976710656")*B
-	    + Coefficient("281474976710656")*C
-	    + Coefficient("281474976710656")*D
-	    >= Coefficient("-1473822119481311"));
+            + Coefficient("281474976710656")*B
+            + Coefficient("281474976710656")*C
+            + Coefficient("281474976710656")*D
+            >= Coefficient("-1473822119481311"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("2947644178164027")*C
-	    - Coefficient("1821744285958102")*D
-	    >= Coefficient("-9538776941755056"));
+            + Coefficient("2947644178164027")*C
+            - Coefficient("1821744285958102")*D
+            >= Coefficient("-9538776941755056"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    + Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288471169845"));
+            + Coefficient("1125899906842624")*B
+            + Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288471169845"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("11790576856771296")*C
-	    + Coefficient("7286977247415199")*D
-	    >= Coefficient("-38155108221883792"));
+            - Coefficient("11790576856771296")*C
+            + Coefficient("7286977247415199")*D
+            >= Coefficient("-38155108221883792"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288471169845"));
+            + Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            + Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288471169845"));
   cs.insert(Coefficient("-140737488355328")*A
-	    - Coefficient("368455526774103")*C
-	    - Coefficient("227718038700250")*D
-	    >= Coefficient("-1192347131793131"));
+            - Coefficient("368455526774103")*C
+            - Coefficient("227718038700250")*D
+            >= Coefficient("-1192347131793131"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288464414445"));
+            + Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288464414445"));
   cs.insert(Coefficient("-3643488643973798")*A
-	    + Coefficient("2251799813685248")*B
-	    + Coefficient("5895288441896447")*C
-	    >= Coefficient("-19077554158229692"));
+            + Coefficient("2251799813685248")*B
+            + Coefficient("5895288441896447")*C
+            >= Coefficient("-19077554158229692"));
   cs.insert(Coefficient("-7286977296954795")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("11790576892800094")*C
-	    >= Coefficient("-38155108352488176"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("11790576892800094")*C
+            >= Coefficient("-38155108352488176"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("7286977269933197")*B
-	    + Coefficient("11790576924325290")*D
-	    >= Coefficient("-38155108411034976"));
+            - Coefficient("7286977269933197")*B
+            + Coefficient("11790576924325290")*D
+            >= Coefficient("-38155108411034976"));
   cs.insert(Coefficient("-3643488639470198")*A
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("5895288466666245")*D
-	    >= Coefficient("-19077554219028288"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("5895288466666245")*D
+            >= Coefficient("-19077554219028288"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("7286977296954795")*B
-	    - Coefficient("11790576955850488")*D
-	    >= Coefficient("-38155108514617768"));
+            - Coefficient("7286977296954795")*B
+            - Coefficient("11790576955850488")*D
+            >= Coefficient("-38155108514617768"));
   cs.insert(Coefficient("-7286977251918799")*A
-	    + Coefficient("4503599627370496")*C
-	    - Coefficient("11790576892800094")*D
-	    >= Coefficient("-38155108311955784"));
+            + Coefficient("4503599627370496")*C
+            - Coefficient("11790576892800094")*D
+            >= Coefficient("-38155108311955784"));
   cs.insert(Coefficient("-3643488655232797")*A
-	    - Coefficient("2251799813685248")*C
-	    + Coefficient("5895288480177044")*D
-	    >= Coefficient("-19077554264064284"));
+            - Coefficient("2251799813685248")*C
+            + Coefficient("5895288480177044")*D
+            >= Coefficient("-19077554264064284"));
   cs.insert(Coefficient("-1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("2947644229955423")*D
-	    >= Coefficient("-9538777099381044"));
+            - Coefficient("1125899906842624")*C
+            - Coefficient("2947644229955423")*D
+            >= Coefficient("-9538777099381044"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("11790576874785696")*B
-	    + Coefficient("7286977269933197")*C
-	    >= Coefficient("-38155108302948584"));
+            - Coefficient("11790576874785696")*B
+            + Coefficient("7286977269933197")*C
+            >= Coefficient("-38155108302948584"));
   cs.insert(Coefficient("-7286977274436797")*A
-	    - Coefficient("4503599627370496")*B
-	    + Coefficient("11790576937836090")*C
-	    >= Coefficient("-38155108424545776"));
+            - Coefficient("4503599627370496")*B
+            + Coefficient("11790576937836090")*C
+            >= Coefficient("-38155108424545776"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("11790576802728102")*B
-	    - Coefficient("7286977197875603")*C
-	    >= Coefficient("-38155108019221808"));
+            - Coefficient("11790576802728102")*B
+            - Coefficient("7286977197875603")*C
+            >= Coefficient("-38155108019221808"));
   cs.insert(Coefficient("-3643488664239996")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("5895288493687843")*C
-	    >= Coefficient("-19077554284330480"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("5895288493687843")*C
+            >= Coefficient("-19077554284330480"));
   cs.insert(Coefficient("-562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644250784571"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644250784571"));
   cs.insert(Coefficient("-281474976710656")*A
-	    - Coefficient("281474976710656")*B
-	    + Coefficient("281474976710656")*C
-	    - Coefficient("281474976710656")*D
-	    >= Coefficient("-1473822131021785"));
+            - Coefficient("281474976710656")*B
+            + Coefficient("281474976710656")*C
+            - Coefficient("281474976710656")*D
+            >= Coefficient("-1473822131021785"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    - Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288464414445"));
+            - Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            + Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288464414445"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    - Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288468918045"));
+            - Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288468918045"));
   cs.insert(Coefficient("-3643488412038417")*A
-	    - Coefficient("5895288318047457")*B
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077553665085532"));
+            - Coefficient("5895288318047457")*B
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077553665085532"));
   cs.insert(Coefficient("-1821744199263809")*A
-	    - Coefficient("2947644153394229")*B
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-9538776813402468"));
+            - Coefficient("2947644153394229")*B
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-9538776813402468"));
   cs.insert(Coefficient("-5895288378846052")*A
-	    + Coefficient("3643488632714799")*B
-	    + Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554023121704"));
+            + Coefficient("3643488632714799")*B
+            + Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554023121704"));
   cs.insert(Coefficient("-11790576834253298")*A
-	    + Coefficient("7286977314969193")*B
-	    - Coefficient("4503599627370496")*C
-	    >= Coefficient("-38155108302948584"));
+            + Coefficient("7286977314969193")*B
+            - Coefficient("4503599627370496")*C
+            >= Coefficient("-38155108302948584"));
   cs.insert(Coefficient("-736911041726257")*A
-	    + Coefficient("281474976710656")*B
-	    + Coefficient("455436077400500")*D
-	    >= Coefficient("-2384694241068264"));
+            + Coefficient("281474976710656")*B
+            + Coefficient("455436077400500")*D
+            >= Coefficient("-2384694241068264"));
   cs.insert(Coefficient("-5895288347320855")*A
-	    + Coefficient("2251799813685248")*B
-	    - Coefficient("3643488616952200")*D
-	    >= Coefficient("-19077553951064108"));
+            + Coefficient("2251799813685248")*B
+            - Coefficient("3643488616952200")*D
+            >= Coefficient("-19077553951064108"));
   cs.insert(Coefficient("-2947644201807925")*A
-	    + Coefficient("1821744319735099")*C
-	    + Coefficient("1125899906842624")*D
-	    >= Coefficient("-9538777048715548"));
+            + Coefficient("1821744319735099")*C
+            + Coefficient("1125899906842624")*D
+            >= Coefficient("-9538777048715548"));
   cs.insert(Coefficient("-11790576820742500")*A
-	    + Coefficient("7286977296954795")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108248905384"));
+            + Coefficient("7286977296954795")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108248905384"));
   cs.insert(Coefficient("-11790576996382886")*A
-	    - Coefficient("7286977251918799")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108523624968"));
+            - Coefficient("7286977251918799")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108523624968"));
   cs.insert(Coefficient("-5895288507198642")*A
-	    - Coefficient("3643488632714799")*C
-	    - Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554291085880"));
+            - Coefficient("3643488632714799")*C
+            - Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554291085880"));
   cs.insert(Coefficient("-11790577113476476")*A
-	    - Coefficient("4503599627370496")*B
-	    + Coefficient("7286977319472793")*D
-	    >= Coefficient("-38155108861394936"));
+            - Coefficient("4503599627370496")*B
+            + Coefficient("7286977319472793")*D
+            >= Coefficient("-38155108861394936"));
   cs.insert(Coefficient("-5895288572500836")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("3643488652980997")*D
-	    >= Coefficient("-19077554450963668"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("3643488652980997")*D
+            >= Coefficient("-19077554450963668"));
   cs.insert(Coefficient("-5895288484680644")*A
-	    - Coefficient("3643488607945001")*B
-	    + Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554212272888"));
+            - Coefficient("3643488607945001")*B
+            + Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554212272888"));
   cs.insert(Coefficient("-2947644274991419")*A
-	    - Coefficient("1821744320860999")*B
-	    - Coefficient("1125899906842624")*C
-	    >= Coefficient("-9538777190578936"));
+            - Coefficient("1821744320860999")*B
+            - Coefficient("1125899906842624")*C
+            >= Coefficient("-9538777190578936"));
   cs.insert(Coefficient("-2251799813685248")*A
-	    >= Coefficient("-5895288448651847"));
+            >= Coefficient("-5895288448651847"));
 
   // Cost function
   Linear_Expression cost(10*A + 21*B + 31*C + 45*D);
@@ -815,8 +815,8 @@ test04() {
   nout << "Optimizing point = ";
   print_generator(pg);
   pg_kr = point(17100*A + 26174*B + 2274482*C
-		+ 1063871*D + 388070456*E + 18627830*F + 0*H,
-		94392);
+                + 1063871*D + 388070456*E + 18627830*F + 0*H,
+                94392);
   if (pg != pg_kr)
     return false;
 
@@ -838,485 +838,485 @@ test05() {
   Variable D(3);
   Constraint_System cs;
   cs.insert(Coefficient("2251799813685248")*A
-	    >= Coefficient("-5895288448651847"));
+            >= Coefficient("-5895288448651847"));
   cs.insert(Coefficient("5895288437392848")*A
-	    + Coefficient("3643488632714799")*B
-	    - Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554137963492"));
+            + Coefficient("3643488632714799")*B
+            - Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554137963492"));
   cs.insert(Coefficient("5895288437392848")*A +
-	    Coefficient("3643488632714799")*B
-	    + Coefficient("2251799813685248")*C >=
-	    Coefficient("-19077554137963492"));
+            Coefficient("3643488632714799")*B
+            + Coefficient("2251799813685248")*C >=
+            Coefficient("-19077554137963492"));
   cs.insert(Coefficient("11790576874785696")*A
-	    + Coefficient("4503599627370496")*B
-	    + Coefficient("7286977274436797")*D
-	    >= Coefficient("-38155108284934184"));
+            + Coefficient("4503599627370496")*B
+            + Coefficient("7286977274436797")*D
+            >= Coefficient("-38155108284934184"));
   cs.insert(Coefficient("11790576874785696")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*D
-	    >= Coefficient("-38155108284934184"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("7286977274436797")*D
+            >= Coefficient("-38155108284934184"));
   cs.insert(Coefficient("11790576879289294")*A
-	    + Coefficient("7286977274436797")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            + Coefficient("7286977274436797")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    + Coefficient("7286977274436797")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            + Coefficient("7286977274436797")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    - Coefficient("7286977274436797")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            - Coefficient("7286977274436797")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    - Coefficient("7286977274436797")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108289437784"));
+            - Coefficient("7286977274436797")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("2947644225451823")*A
-	    - Coefficient("1125899906842624")*B
-	    + Coefficient("1821744319735099")*D
-	    >= Coefficient("-9538777088122044"));
+            - Coefficient("1125899906842624")*B
+            + Coefficient("1821744319735099")*D
+            >= Coefficient("-9538777088122044"));
   cs.insert(Coefficient("11790576892800094")*A
-	    - Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*D
-	    >= Coefficient("-38155108325466584"));
+            - Coefficient("4503599627370496")*B
+            - Coefficient("7286977274436797")*D
+            >= Coefficient("-38155108325466584"));
   cs.insert(Coefficient("5895288437392848")*A
-	    - Coefficient("3643488630462999")*B
-	    + Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554133459892"));
+            - Coefficient("3643488630462999")*B
+            + Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554133459892"));
   cs.insert(Coefficient("2947644218696424")*A
-	    - Coefficient("1821744320860999")*B
-	    - Coefficient("1125899906842624")*C
-	    >= Coefficient("-9538777072359446"));
+            - Coefficient("1821744320860999")*B
+            - Coefficient("1125899906842624")*C
+            >= Coefficient("-9538777072359446"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("11790576924325290")*B
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108379509776"));
+            + Coefficient("11790576924325290")*B
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108379509776"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("11790576924325290")*B
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108379509776"));
+            + Coefficient("11790576924325290")*B
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108379509776"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644226577723"));
+            + Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644226577723"));
+            + Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644225451823"));
+            + Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644225451823"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644225451823"));
+            + Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644225451823"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("4503599627370496")*B
-	    + Coefficient("11790576865778496")*C
-	    >= Coefficient("-38155108266919784"));
+            + Coefficient("4503599627370496")*B
+            + Coefficient("11790576865778496")*C
+            >= Coefficient("-38155108266919784"));
   cs.insert(Coefficient("7286977251918799")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("11790576870282096")*C
-	    >= Coefficient("-38155108244401792"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("11790576870282096")*C
+            >= Coefficient("-38155108244401792"));
   cs.insert(Coefficient("1821744320860999")*A
-	    + Coefficient("1125899906842624")*C
-	    + Coefficient("2947644226577723")*D
-	    >= Coefficient("-9538777093751544"));
+            + Coefficient("1125899906842624")*C
+            + Coefficient("2947644226577723")*D
+            >= Coefficient("-9538777093751544"));
   cs.insert(Coefficient("1821744320860999")*A
-	    + Coefficient("1125899906842624")*C
-	    - Coefficient("2947644226577723")*
-	    D >= Coefficient("-9538777093751544"));
+            + Coefficient("1125899906842624")*C
+            - Coefficient("2947644226577723")*
+            D >= Coefficient("-9538777093751544"));
   cs.insert(Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("2947644228829523")*D
-	    >= Coefficient("-9538777096003344"));
+            - Coefficient("1125899906842624")*C
+            + Coefficient("2947644228829523")*D
+            >= Coefficient("-9538777096003344"));
   cs.insert(Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("2947644228829523")*D
-	    >= Coefficient("-9538777096003344"));
+            - Coefficient("1125899906842624")*C
+            - Coefficient("2947644228829523")*D
+            >= Coefficient("-9538777096003344"));
   cs.insert(Coefficient("3643488664239996")*A
-	    - Coefficient("2251799813685248")*B
-	    + Coefficient("5895288468918045")*C
-	    >= Coefficient("-19077554257308884"));
+            - Coefficient("2251799813685248")*B
+            + Coefficient("5895288468918045")*C
+            >= Coefficient("-19077554257308884"));
   cs.insert(Coefficient("3643488652980997")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("5895288468918045")*C
-	    >= Coefficient("-19077554232539084"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("5895288468918045")*C
+            >= Coefficient("-19077554232539084"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644226577723"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644229392473"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644229392473"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644227140673"));
+            - Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644227140673"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644227703623"));
+            - Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= Coefficient("-2947644227703623"));
   cs.insert(Coefficient("7286977314969193")*A
-	    - Coefficient("11790576906310892")*B
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108447063768"));
+            - Coefficient("11790576906310892")*B
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108447063768"));
   cs.insert(Coefficient("3643488655232797")*A
-	    - Coefficient("5895288446400047")*B
-	    - Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554203265688"));
+            - Coefficient("5895288446400047")*B
+            - Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554203265688"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576753188506")*B
-	    + Coefficient("7286977179861205")*C
-	    >= Coefficient("-38155107920142616"));
+            + Coefficient("11790576753188506")*B
+            + Coefficient("7286977179861205")*C
+            >= Coefficient("-38155107920142616"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576766699304")*B
-	    - Coefficient("7286977179861205")*C
-	    >= Coefficient("-38155107965178608"));
+            + Coefficient("11790576766699304")*B
+            - Coefficient("7286977179861205")*C
+            >= Coefficient("-38155107965178608"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("7286977157343207")*B
-	    + Coefficient("11790576712656108")*D
-	    >= Coefficient("-38155107816559824"));
+            + Coefficient("7286977157343207")*B
+            + Coefficient("11790576712656108")*D
+            >= Coefficient("-38155107816559824"));
   cs.insert(Coefficient("2251799813685248")*A
-	    + Coefficient("3643488592182402")*B
-	    - Coefficient("5895288374342453")*D
-	    >= Coefficient("-19077553960071308"));
+            + Coefficient("3643488592182402")*B
+            - Coefficient("5895288374342453")*D
+            >= Coefficient("-19077553960071308"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576753188506")*C
-	    + Coefficient("7286977175357605")*D
-	    >= Coefficient("-38155107924646216"));
+            + Coefficient("11790576753188506")*C
+            + Coefficient("7286977175357605")*D
+            >= Coefficient("-38155107924646216"));
   cs.insert(Coefficient("2251799813685248")*A
-	    + Coefficient("5895288390105051")*C
-	    - Coefficient("3643488594434202")*D
-	    >= Coefficient("-19077553996100104"));
+            + Coefficient("5895288390105051")*C
+            - Coefficient("3643488594434202")*D
+            >= Coefficient("-19077553996100104"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("5895288421630249")*C
-	    + Coefficient("3643488619204000")*D
-	    >= Coefficient("-19077554088423896"));
+            - Coefficient("5895288421630249")*C
+            + Coefficient("3643488619204000")*D
+            >= Coefficient("-19077554088423896"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("11790576865778496")*C
-	    - Coefficient("7286977247415199")*D
-	    >= Coefficient("-38155108244401792"));
+            - Coefficient("11790576865778496")*C
+            - Coefficient("7286977247415199")*D
+            >= Coefficient("-38155108244401792"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("7286977247415199")*B
-	    + Coefficient("11790576888296494")*D
-	    >= Coefficient("-38155108307452184"));
+            - Coefficient("7286977247415199")*B
+            + Coefficient("11790576888296494")*D
+            >= Coefficient("-38155108307452184"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("3643488639470198")*B
-	    - Coefficient("5895288464414445")*D
-	    >= Coefficient("-19077554210021088"));
+            - Coefficient("3643488639470198")*B
+            - Coefficient("5895288464414445")*D
+            >= Coefficient("-19077554210021088"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("5895288428385648")*B
-	    + Coefficient("3643488630462999")*C
-	    >= Coefficient("-19077554131208092"));
+            - Coefficient("5895288428385648")*B
+            + Coefficient("3643488630462999")*C
+            >= Coefficient("-19077554131208092"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("11790576843260498")*B
-	    - Coefficient("7286977224897201")*C
-	    >= Coefficient("-38155108163336992"));
+            - Coefficient("11790576843260498")*B
+            - Coefficient("7286977224897201")*C
+            >= Coefficient("-38155108163336992"));
   cs.insert(Coefficient("1125899906842624")*B
-	    >= Coefficient("-2947644227703623"));
+            >= Coefficient("-2947644227703623"));
   cs.insert(Coefficient("5895288459910846")*B
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("3643488630462999")*D
-	    >= Coefficient("-19077554198762088"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("3643488630462999")*D
+            >= Coefficient("-19077554198762088"));
   cs.insert(Coefficient("5895288457659046")*B
-	    + Coefficient("2251799813685248")*C
-	    - Coefficient("3643488628211199")*D
-	    >= Coefficient("-19077554189754888"));
+            + Coefficient("2251799813685248")*C
+            - Coefficient("3643488628211199")*D
+            >= Coefficient("-19077554189754888"));
   cs.insert(Coefficient("11790576915318092")*B
-	    - Coefficient("4503599627370496")*C
-	    + Coefficient("7286977269933197")*D
-	    >= Coefficient("-38155108393020576"));
+            - Coefficient("4503599627370496")*C
+            + Coefficient("7286977269933197")*D
+            >= Coefficient("-38155108393020576"));
   cs.insert(Coefficient("5895288457659046")*B
-	    - Coefficient("2251799813685248")*C
-	    - Coefficient("3643488632714799")*D
-	    >= Coefficient("-19077554187503088"));
+            - Coefficient("2251799813685248")*C
+            - Coefficient("3643488632714799")*D
+            >= Coefficient("-19077554187503088"));
   cs.insert(Coefficient("7286977292451195")*B
-	    + Coefficient("11790576919821692")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108433552976"));
+            + Coefficient("11790576919821692")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108433552976"));
   cs.insert(Coefficient("3643488664239996")*B
-	    + Coefficient("5895288486932443")*C
-	    - Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554304596680"));
+            + Coefficient("5895288486932443")*C
+            - Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554304596680"));
   cs.insert(Coefficient("3643488643973798")*B
-	    - Coefficient("5895288446400047")*C
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554180747688"));
+            - Coefficient("5895288446400047")*C
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554180747688"));
   cs.insert(Coefficient("7286977314969193")*B
-	    - Coefficient("11790576937836090")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108510114168"));
+            - Coefficient("11790576937836090")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108510114168"));
   cs.insert(Coefficient("4503599627370496")*B
-	    + Coefficient("7286977247415199")*C
-	    + Coefficient("11790576883792894")*D
-	    >= Coefficient("-38155108289437784"));
+            + Coefficient("7286977247415199")*C
+            + Coefficient("11790576883792894")*D
+            >= Coefficient("-38155108289437784"));
   cs.insert(Coefficient("4503599627370496")*B
-	    + Coefficient("7286977251918799")*C
-	    - Coefficient("11790576883792894")*D
-	    >= Coefficient("-38155108280430584"));
+            + Coefficient("7286977251918799")*C
+            - Coefficient("11790576883792894")*D
+            >= Coefficient("-38155108280430584"));
   cs.insert(Coefficient("4503599627370496")*B
-	    - Coefficient("7286977229400801")*C
-	    + Coefficient("11790576852267696")*D
-	    >= Coefficient("-38155108181351392"));
+            - Coefficient("7286977229400801")*C
+            + Coefficient("11790576852267696")*D
+            >= Coefficient("-38155108181351392"));
   cs.insert(Coefficient("1125899906842624")*D
-	    >= Coefficient("-2947644225451823"));
+            >= Coefficient("-2947644225451823"));
   cs.insert(Coefficient("4503599627370496")*B
-	    - Coefficient("7286977229400801")*C
-	    - Coefficient("11790576852267696")*D
-	    >= Coefficient("-38155108167840592"));
+            - Coefficient("7286977229400801")*C
+            - Coefficient("11790576852267696")*D
+            >= Coefficient("-38155108167840592"));
   cs.insert(Coefficient("-2251799813685248")*D
-	    >= Coefficient("-5895288448651847"));
+            >= Coefficient("-5895288448651847"));
   cs.insert(Coefficient("2251799813685248")*C
-	    >= Coefficient("-5895288446400047"));
+            >= Coefficient("-5895288446400047"));
   cs.insert(Coefficient("-2251799813685248")*C
-	    >= Coefficient("-5895288444148247"));
+            >= Coefficient("-5895288444148247"));
   cs.insert(Coefficient("-1125899906842624")*B
-	    + Coefficient("1821744321986899")*C
-	    + Coefficient("2947644226577723")*D
-	    >= Coefficient("-9538777088122044"));
+            + Coefficient("1821744321986899")*C
+            + Coefficient("2947644226577723")*D
+            >= Coefficient("-9538777088122044"));
   cs.insert(Coefficient("-3643488607945001")*B
-	    + Coefficient("5895288414874849")*C
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554059150500"));
+            + Coefficient("5895288414874849")*C
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554059150500"));
   cs.insert(Coefficient("-4503599627370496")*B
-	    + Coefficient("7286977292451195")*C
-	    - Coefficient("11790576906310892")*D
-	    >= Coefficient("-38155108343480984"));
+            + Coefficient("7286977292451195")*C
+            - Coefficient("11790576906310892")*D
+            >= Coefficient("-38155108343480984"));
   cs.insert(Coefficient("-7286977220393601")*B
-	    + Coefficient("11790576829749698")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108086775800"));
+            + Coefficient("11790576829749698")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108086775800"));
   cs.insert(Coefficient("-4503599627370496")*B
-	    - Coefficient("7286977274436797")*C
-	    + Coefficient("11790576901807292")*D
-	    >= Coefficient("-38155108325466584"));
+            - Coefficient("7286977274436797")*C
+            + Coefficient("11790576901807292")*D
+            >= Coefficient("-38155108325466584"));
   cs.insert(Coefficient("-3643488605693201")*B
-	    - Coefficient("5895288414874849")*C
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554059150500"));
+            - Coefficient("5895288414874849")*C
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554059150500"));
   cs.insert(Coefficient("-1125899906842624")*B
-	    - Coefficient("1821744319735099")*C
-	    - Coefficient("2947644225451823")*D
-	    >= Coefficient("-9538777079114846"));
+            - Coefficient("1821744319735099")*C
+            - Coefficient("2947644225451823")*D
+            >= Coefficient("-9538777079114846"));
   cs.insert(Coefficient("-7286977220393601")*B
-	    - Coefficient("11790576834253298")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108113797400"));
+            - Coefficient("11790576834253298")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108113797400"));
   cs.insert(Coefficient("-5895288462162645")*B
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("3643488639470198")*D
-	    >= Coefficient("-19077554144718892"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("3643488639470198")*D
+            >= Coefficient("-19077554144718892"));
   cs.insert(Coefficient("-11790576924325290")*B
-	    - Coefficient("4503599627370496")*C
-	    + Coefficient("7286977292451195")*D
-	    >= Coefficient("-38155108320962984"));
+            - Coefficient("4503599627370496")*C
+            + Coefficient("7286977292451195")*D
+            >= Coefficient("-38155108320962984"));
   cs.insert(Coefficient("-5895288468918045")*B
-	    + Coefficient("2251799813685248")*C
-	    - Coefficient("3643488641721998")*D
-	    >= Coefficient("-19077554160481492"));
+            + Coefficient("2251799813685248")*C
+            - Coefficient("3643488641721998")*D
+            >= Coefficient("-19077554160481492"));
   cs.insert(Coefficient("-11790576928828890")*B
-	    - Coefficient("4503599627370496")*C
-	    - Coefficient("7286977292451195")*D
-	    >= Coefficient("-38155108329970184"));
+            - Coefficient("4503599627370496")*C
+            - Coefficient("7286977292451195")*D
+            >= Coefficient("-38155108329970184"));
   cs.insert(Coefficient("-281474976710656")*B
-	    >= Coefficient("-736911053829681"));
+            >= Coefficient("-736911053829681"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    + Coefficient("11790576658612912")*B
-	    + Coefficient("7286977125818009")*C
-	    >= Coefficient("-38155107627408640"));
+            + Coefficient("11790576658612912")*B
+            + Coefficient("7286977125818009")*C
+            >= Coefficient("-38155107627408640"));
   cs.insert(Coefficient("-2251799813685248")*A
-	    + Coefficient("5895288336061856")*B
-	    - Coefficient("3643488560657205")*C
-	    >= Coefficient("-19077553829466920"));
+            + Coefficient("5895288336061856")*B
+            - Coefficient("3643488560657205")*C
+            >= Coefficient("-19077553829466920"));
   cs.insert(Coefficient("-2251799813685248")*A
-	    + Coefficient("3643488535887407")*B
-	    + Coefficient("5895288288774060")*D
-	    >= Coefficient("-19077553683099932"));
+            + Coefficient("3643488535887407")*B
+            + Coefficient("5895288288774060")*D
+            >= Coefficient("-19077553683099932"));
   cs.insert(Coefficient("-7286977274436797")*A
-	    + Coefficient("11790576766699304")*B
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108032732608"));
+            + Coefficient("11790576766699304")*B
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108032732608"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    + Coefficient("7286977098796411")*B
-	    - Coefficient("11790576609073318")*D
-	    >= Coefficient("-38155107483293448"));
+            + Coefficient("7286977098796411")*B
+            - Coefficient("11790576609073318")*D
+            >= Coefficient("-38155107483293448"));
   cs.insert(Coefficient("-7286977301458395")*A
-	    + Coefficient("11790576735174106")*B
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155107983193008"));
+            + Coefficient("11790576735174106")*B
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155107983193008"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    + Coefficient("11790576708152508")*C
-	    + Coefficient("7286977148336007")*D
-	    >= Coefficient("-38155107771523824"));
+            + Coefficient("11790576708152508")*C
+            + Coefficient("7286977148336007")*D
+            >= Coefficient("-38155107771523824"));
   cs.insert(Coefficient("-281474976710656")*A
-	    + Coefficient("281474976710656")*B
-	    + Coefficient("281474976710656")*C
-	    + Coefficient("281474976710656")*D
-	    >= Coefficient("-1473822119481311"));
+            + Coefficient("281474976710656")*B
+            + Coefficient("281474976710656")*C
+            + Coefficient("281474976710656")*D
+            >= Coefficient("-1473822119481311"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("2947644178164027")*C
-	    - Coefficient("1821744285958102")*D
-	    >= Coefficient("-9538776941755056"));
+            + Coefficient("2947644178164027")*C
+            - Coefficient("1821744285958102")*D
+            >= Coefficient("-9538776941755056"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    + Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288471169845"));
+            + Coefficient("1125899906842624")*B
+            + Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288471169845"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("11790576856771296")*C
-	    + Coefficient("7286977247415199")*D
-	    >= Coefficient("-38155108221883792"));
+            - Coefficient("11790576856771296")*C
+            + Coefficient("7286977247415199")*D
+            >= Coefficient("-38155108221883792"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288471169845"));
+            + Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            + Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288471169845"));
   cs.insert(Coefficient("-140737488355328")*A
-	    - Coefficient("368455526774103")*C
-	    - Coefficient("227718038700250")*D
-	    >= Coefficient("-1192347131793131"));
+            - Coefficient("368455526774103")*C
+            - Coefficient("227718038700250")*D
+            >= Coefficient("-1192347131793131"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288464414445"));
+            + Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288464414445"));
   cs.insert(Coefficient("-3643488643973798")*A
-	    + Coefficient("2251799813685248")*B
-	    + Coefficient("5895288441896447")*C
-	    >= Coefficient("-19077554158229692"));
+            + Coefficient("2251799813685248")*B
+            + Coefficient("5895288441896447")*C
+            >= Coefficient("-19077554158229692"));
   cs.insert(Coefficient("-7286977296954795")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("11790576892800094")*C
-	    >= Coefficient("-38155108352488176"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("11790576892800094")*C
+            >= Coefficient("-38155108352488176"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("7286977269933197")*B
-	    + Coefficient("11790576924325290")*D
-	    >= Coefficient("-38155108411034976"));
+            - Coefficient("7286977269933197")*B
+            + Coefficient("11790576924325290")*D
+            >= Coefficient("-38155108411034976"));
   cs.insert(Coefficient("-3643488639470198")*A
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("5895288466666245")*D
-	    >= Coefficient("-19077554219028288"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("5895288466666245")*D
+            >= Coefficient("-19077554219028288"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("7286977296954795")*B
-	    - Coefficient("11790576955850488")*D
-	    >= Coefficient("-38155108514617768"));
+            - Coefficient("7286977296954795")*B
+            - Coefficient("11790576955850488")*D
+            >= Coefficient("-38155108514617768"));
   cs.insert(Coefficient("-7286977251918799")*A
-	    + Coefficient("4503599627370496")*C
-	    - Coefficient("11790576892800094")*D
-	    >= Coefficient("-38155108311955784"));
+            + Coefficient("4503599627370496")*C
+            - Coefficient("11790576892800094")*D
+            >= Coefficient("-38155108311955784"));
   cs.insert(Coefficient("-3643488655232797")*A
-	    - Coefficient("2251799813685248")*C
-	    + Coefficient("5895288480177044")*D
-	    >= Coefficient("-19077554264064284"));
+            - Coefficient("2251799813685248")*C
+            + Coefficient("5895288480177044")*D
+            >= Coefficient("-19077554264064284"));
   cs.insert(Coefficient("-1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("2947644229955423")*D
-	    >= Coefficient("-9538777099381044"));
+            - Coefficient("1125899906842624")*C
+            - Coefficient("2947644229955423")*D
+            >= Coefficient("-9538777099381044"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("11790576874785696")*B
-	    + Coefficient("7286977269933197")*C
-	    >= Coefficient("-38155108302948584"));
+            - Coefficient("11790576874785696")*B
+            + Coefficient("7286977269933197")*C
+            >= Coefficient("-38155108302948584"));
   cs.insert(Coefficient("-7286977274436797")*A
-	    - Coefficient("4503599627370496")*B
-	    + Coefficient("11790576937836090")*C
-	    >= Coefficient("-38155108424545776"));
+            - Coefficient("4503599627370496")*B
+            + Coefficient("11790576937836090")*C
+            >= Coefficient("-38155108424545776"));
   cs.insert(Coefficient("-4503599627370496")*A
-	    - Coefficient("11790576802728102")*B
-	    - Coefficient("7286977197875603")*C
-	    >= Coefficient("-38155108019221808"));
+            - Coefficient("11790576802728102")*B
+            - Coefficient("7286977197875603")*C
+            >= Coefficient("-38155108019221808"));
   cs.insert(Coefficient("-3643488664239996")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("5895288493687843")*C
-	    >= Coefficient("-19077554284330480"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("5895288493687843")*C
+            >= Coefficient("-19077554284330480"));
   cs.insert(Coefficient("-562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= Coefficient("-2947644250784571"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= Coefficient("-2947644250784571"));
   cs.insert(Coefficient("-281474976710656")*A
-	    - Coefficient("281474976710656")*B
-	    + Coefficient("281474976710656")*C
-	    - Coefficient("281474976710656")*D
-	    >= Coefficient("-1473822131021785"));
+            - Coefficient("281474976710656")*B
+            + Coefficient("281474976710656")*C
+            - Coefficient("281474976710656")*D
+            >= Coefficient("-1473822131021785"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    - Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288464414445"));
+            - Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            + Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288464414445"));
   cs.insert(Coefficient("-1125899906842624")*A
-	    - Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-5895288468918045"));
+            - Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-5895288468918045"));
   cs.insert(Coefficient("-3643488412038417")*A
-	    - Coefficient("5895288318047457")*B
-	    + Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077553665085532"));
+            - Coefficient("5895288318047457")*B
+            + Coefficient("2251799813685248")*D
+            >= Coefficient("-19077553665085532"));
   cs.insert(Coefficient("-1821744199263809")*A
-	    - Coefficient("2947644153394229")*B
-	    - Coefficient("1125899906842624")*D
-	    >= Coefficient("-9538776813402468"));
+            - Coefficient("2947644153394229")*B
+            - Coefficient("1125899906842624")*D
+            >= Coefficient("-9538776813402468"));
   cs.insert(Coefficient("-5895288378846052")*A
-	    + Coefficient("3643488632714799")*B
-	    + Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554023121704"));
+            + Coefficient("3643488632714799")*B
+            + Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554023121704"));
   cs.insert(Coefficient("-11790576834253298")*A
-	    + Coefficient("7286977314969193")*B
-	    - Coefficient("4503599627370496")*C
-	    >= Coefficient("-38155108302948584"));
+            + Coefficient("7286977314969193")*B
+            - Coefficient("4503599627370496")*C
+            >= Coefficient("-38155108302948584"));
   cs.insert(Coefficient("-736911041726257")*A
-	    + Coefficient("281474976710656")*B
-	    + Coefficient("455436077400500")*D
-	    >= Coefficient("-2384694241068264"));
+            + Coefficient("281474976710656")*B
+            + Coefficient("455436077400500")*D
+            >= Coefficient("-2384694241068264"));
   cs.insert(Coefficient("-5895288347320855")*A
-	    + Coefficient("2251799813685248")*B
-	    - Coefficient("3643488616952200")*D
-	    >= Coefficient("-19077553951064108"));
+            + Coefficient("2251799813685248")*B
+            - Coefficient("3643488616952200")*D
+            >= Coefficient("-19077553951064108"));
   cs.insert(Coefficient("-2947644201807925")*A
-	    + Coefficient("1821744319735099")*C
-	    + Coefficient("1125899906842624")*D
-	    >= Coefficient("-9538777048715548"));
+            + Coefficient("1821744319735099")*C
+            + Coefficient("1125899906842624")*D
+            >= Coefficient("-9538777048715548"));
   cs.insert(Coefficient("-11790576820742500")*A
-	    + Coefficient("7286977296954795")*C
-	    - Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108248905384"));
+            + Coefficient("7286977296954795")*C
+            - Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108248905384"));
   cs.insert(Coefficient("-11790576996382886")*A
-	    - Coefficient("7286977251918799")*C
-	    + Coefficient("4503599627370496")*D
-	    >= Coefficient("-38155108523624968"));
+            - Coefficient("7286977251918799")*C
+            + Coefficient("4503599627370496")*D
+            >= Coefficient("-38155108523624968"));
   cs.insert(Coefficient("-5895288507198642")*A
-	    - Coefficient("3643488632714799")*C
-	    - Coefficient("2251799813685248")*D
-	    >= Coefficient("-19077554291085880"));
+            - Coefficient("3643488632714799")*C
+            - Coefficient("2251799813685248")*D
+            >= Coefficient("-19077554291085880"));
   cs.insert(Coefficient("-11790577113476476")*A
-	    - Coefficient("4503599627370496")*B
-	    + Coefficient("7286977319472793")*D
-	    >= Coefficient("-38155108861394936"));
+            - Coefficient("4503599627370496")*B
+            + Coefficient("7286977319472793")*D
+            >= Coefficient("-38155108861394936"));
   cs.insert(Coefficient("-5895288572500836")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("3643488652980997")*D
-	    >= Coefficient("-19077554450963668"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("3643488652980997")*D
+            >= Coefficient("-19077554450963668"));
   cs.insert(Coefficient("-5895288484680644")*A
-	    - Coefficient("3643488607945001")*B
-	    + Coefficient("2251799813685248")*C
-	    >= Coefficient("-19077554212272888"));
+            - Coefficient("3643488607945001")*B
+            + Coefficient("2251799813685248")*C
+            >= Coefficient("-19077554212272888"));
   cs.insert(Coefficient("-2947644274991419")*A
-	    - Coefficient("1821744320860999")*B
-	    - Coefficient("1125899906842624")*C
-	    >= Coefficient("-9538777190578936"));
+            - Coefficient("1821744320860999")*B
+            - Coefficient("1125899906842624")*C
+            >= Coefficient("-9538777190578936"));
   cs.insert(Coefficient("-2251799813685248")*A
-	    >= Coefficient("-5895288448651847"));
+            >= Coefficient("-5895288448651847"));
 
   // Cost function
   Linear_Expression cost(10*A + 21*B + 31*C + 45*D);
@@ -1517,7 +1517,7 @@ test08() {
   if (num != num_kr || den != den_kr)
     return false;
   pg_kr = point(Coefficient("6651564805")*A + 196469466*B + 232165453*C + 0*D,
-		Coefficient("6651564805"));
+                Coefficient("6651564805"));
   nout << "Optimizing point = ";
   print_generator(pg);
   if (pg != pg_kr)
@@ -1667,7 +1667,7 @@ test10() {
   Linear_Expression cost(-2*A - 3*B - 4*C);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), ivs, cost,
-		  MINIMIZATION);
+                  MINIMIZATION);
 
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
diff --git a/tests/MIP_Problem/mipproblem2.cc b/tests/MIP_Problem/mipproblem2.cc
index 60a07b0..73b74fa 100644
--- a/tests/MIP_Problem/mipproblem2.cc
+++ b/tests/MIP_Problem/mipproblem2.cc
@@ -1,6 +1,6 @@
 /* Test the MIP_Problem class with instances that require a watchdog timer.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,7 +27,7 @@ site: http://bugseng.com/products/ppl/ . */
 namespace {
 
 class Timeout : virtual public std::exception,
-		public Parma_Polyhedra_Library::Throwable {
+                public Parma_Polyhedra_Library::Throwable {
 public:
   const char* what() const throw() {
     return "Timeout in refine1.cc";
diff --git a/tests/MIP_Problem/mipproblem3.cc b/tests/MIP_Problem/mipproblem3.cc
index f44b7ed..6b2d8a0 100644
--- a/tests/MIP_Problem/mipproblem3.cc
+++ b/tests/MIP_Problem/mipproblem3.cc
@@ -1,6 +1,6 @@
 /* Test the MIP_Problem class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -44,7 +44,7 @@ test01() {
   Linear_Expression cost(A - 2*B);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), ivs, cost,
-		  MAXIMIZATION);
+                  MAXIMIZATION);
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
 
@@ -72,13 +72,13 @@ test02() {
   Variable B(1);
   Constraint_System cs;
   cs.insert(Coefficient("-3152519739159347")*A
-	    - Coefficient("4503599627370496")*B
-	    >= Coefficient("-2837267765243412480"));
+            - Coefficient("4503599627370496")*B
+            >= Coefficient("-2837267765243412480"));
   cs.insert(Coefficient("-14411518807585588")*A
-	    - Coefficient("3602879701896397")*B
-	    >= Coefficient("-19455550390240542720"));
+            - Coefficient("3602879701896397")*B
+            >= Coefficient("-19455550390240542720"));
   cs.insert(Coefficient("6325070415853456823515479584966165845298645305129441198653167438357198111499854590373761990669910140474596183259900372230931523043306046152094168748148078435047419508642698792639590866940413010663742739952273283392562733857021646831815729864036236135650314266011211548510419206725953204130822734645187695728365866909171712")*A
-	    >= Coefficient("134217729"));
+            >= Coefficient("134217729"));
   cs.insert(B >= 20);
   cs.insert(-B >= -500);
 
@@ -89,10 +89,10 @@ test02() {
   Linear_Expression cost(-4*A - B);
 
   MIP_Problem mip = MIP_Problem(cs.space_dimension(),
-				cs.begin(), cs.end(),
-				ivs,
-				cost,
-				MINIMIZATION);
+                                cs.begin(), cs.end(),
+                                ivs,
+                                cost,
+                                MINIMIZATION);
 
   Generator pg = mip.optimizing_point();
   nout << "Optimizing point = ";
@@ -159,7 +159,7 @@ test05() {
   Linear_Expression cost(A + B);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), ivs, cost,
-		  MAXIMIZATION);
+                  MAXIMIZATION);
 
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
@@ -189,7 +189,7 @@ test06() {
   Linear_Expression cost(A + B);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), cost,
-		  MAXIMIZATION);
+                  MAXIMIZATION);
   // Disallow floating point based steepest-edge pricing, so that
   // predictable overflow behavior is obtained when configured
   // to use checked 8-bit integers as coefficients.
@@ -224,7 +224,7 @@ test07() {
   Linear_Expression cost(10*A + 6*B);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), cost,
-		  MINIMIZATION);
+                  MINIMIZATION);
 
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
@@ -254,485 +254,485 @@ test08() {
   // Feasible region.
   Constraint_System cs;
   cs.insert(Coefficient("2251799813685248")*A
-	    >= -Coefficient("5895288448651847"));
+            >= -Coefficient("5895288448651847"));
   cs.insert(Coefficient("5895288437392848")*A
-	    + Coefficient("3643488632714799")*B
-	    - Coefficient("2251799813685248")*C
-	    >= -Coefficient("19077554137963492"));
+            + Coefficient("3643488632714799")*B
+            - Coefficient("2251799813685248")*C
+            >= -Coefficient("19077554137963492"));
   cs.insert(Coefficient("5895288437392848")*A
-	    + Coefficient("3643488632714799")*B
-	    + Coefficient("2251799813685248")*C
-	    >= -Coefficient("19077554137963492"));
+            + Coefficient("3643488632714799")*B
+            + Coefficient("2251799813685248")*C
+            >= -Coefficient("19077554137963492"));
   cs.insert(Coefficient("11790576874785696")*A
-	    + Coefficient("4503599627370496")*B
-	    + Coefficient("7286977274436797")*D
-	    >= -Coefficient("38155108284934184"));
+            + Coefficient("4503599627370496")*B
+            + Coefficient("7286977274436797")*D
+            >= -Coefficient("38155108284934184"));
   cs.insert(Coefficient("11790576874785696")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*D
-	    >= -Coefficient("38155108284934184"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("7286977274436797")*D
+            >= -Coefficient("38155108284934184"));
   cs.insert(Coefficient("11790576879289294")*A
-	    + Coefficient("7286977274436797")*C
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108289437784"));
+            + Coefficient("7286977274436797")*C
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    + Coefficient("7286977274436797")*C
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108289437784"));
+            + Coefficient("7286977274436797")*C
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    - Coefficient("7286977274436797")*C
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108289437784"));
+            - Coefficient("7286977274436797")*C
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108289437784"));
   cs.insert(Coefficient("11790576879289294")*A
-	    - Coefficient("7286977274436797")*C
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108289437784"));
+            - Coefficient("7286977274436797")*C
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108289437784"));
   cs.insert(Coefficient("2947644225451823")*A
-	    - Coefficient("1125899906842624")*B
-	    + Coefficient("1821744319735099")*D
-	    >= -Coefficient("9538777088122044"));
+            - Coefficient("1125899906842624")*B
+            + Coefficient("1821744319735099")*D
+            >= -Coefficient("9538777088122044"));
   cs.insert(Coefficient("11790576892800094")*A
-	    - Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*D
-	    >= -Coefficient("38155108325466584"));
+            - Coefficient("4503599627370496")*B
+            - Coefficient("7286977274436797")*D
+            >= -Coefficient("38155108325466584"));
   cs.insert(Coefficient("5895288437392848")*A
-	    - Coefficient("3643488630462999")*B
-	    + Coefficient("2251799813685248")*C
-	    >= -Coefficient("19077554133459892"));
+            - Coefficient("3643488630462999")*B
+            + Coefficient("2251799813685248")*C
+            >= -Coefficient("19077554133459892"));
   cs.insert(Coefficient("2947644218696424")*A
-	    - Coefficient("1821744320860999")*B
-	    - Coefficient("1125899906842624")*C
-	    >= -Coefficient("9538777072359446"));
+            - Coefficient("1821744320860999")*B
+            - Coefficient("1125899906842624")*C
+            >= -Coefficient("9538777072359446"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("11790576924325290")*B
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108379509776"));
+            + Coefficient("11790576924325290")*B
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108379509776"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("11790576924325290")*B
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108379509776"));
+            + Coefficient("11790576924325290")*B
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108379509776"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644226577723"));
+            + Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= -Coefficient("2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644226577723"));
+            + Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= -Coefficient("2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644225451823"));
+            + Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= -Coefficient("2947644225451823"));
   cs.insert(Coefficient("562949953421312")*A
-	    + Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644225451823"));
+            + Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= -Coefficient("2947644225451823"));
   cs.insert(Coefficient("7286977269933197")*A
-	    + Coefficient("4503599627370496")*B
-	    + Coefficient("11790576865778496")*C
-	    >= -Coefficient("38155108266919784"));
+            + Coefficient("4503599627370496")*B
+            + Coefficient("11790576865778496")*C
+            >= -Coefficient("38155108266919784"));
   cs.insert(Coefficient("7286977251918799")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("11790576870282096")*C
-	    >= -Coefficient("38155108244401792"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("11790576870282096")*C
+            >= -Coefficient("38155108244401792"));
   cs.insert(Coefficient("1821744320860999")*A
-	    + Coefficient("1125899906842624")*C
-	    + Coefficient("2947644226577723")*D
-	    >= -Coefficient("9538777093751544"));
+            + Coefficient("1125899906842624")*C
+            + Coefficient("2947644226577723")*D
+            >= -Coefficient("9538777093751544"));
   cs.insert(Coefficient("1821744320860999")*A
-	    + Coefficient("1125899906842624")*C
-	    - Coefficient("2947644226577723")*D
-	    >= -Coefficient("9538777093751544"));
+            + Coefficient("1125899906842624")*C
+            - Coefficient("2947644226577723")*D
+            >= -Coefficient("9538777093751544"));
   cs.insert(Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("2947644228829523")*D
-	    >= -Coefficient("9538777096003344"));
+            - Coefficient("1125899906842624")*C
+            + Coefficient("2947644228829523")*D
+            >= -Coefficient("9538777096003344"));
   cs.insert(Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("2947644228829523")*D
-	    >= -Coefficient("9538777096003344"));
+            - Coefficient("1125899906842624")*C
+            - Coefficient("2947644228829523")*D
+            >= -Coefficient("9538777096003344"));
   cs.insert(Coefficient("3643488664239996")*A
-	    - Coefficient("2251799813685248")*B
-	    + Coefficient("5895288468918045")*C
-	    >= -Coefficient("19077554257308884"));
+            - Coefficient("2251799813685248")*B
+            + Coefficient("5895288468918045")*C
+            >= -Coefficient("19077554257308884"));
   cs.insert(Coefficient("3643488652980997")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("5895288468918045")*C
-	    >= -Coefficient("19077554232539084"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("5895288468918045")*C
+            >= -Coefficient("19077554232539084"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644226577723"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= -Coefficient("2947644226577723"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644229392473"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= -Coefficient("2947644229392473"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644227140673"));
+            - Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= -Coefficient("2947644227140673"));
   cs.insert(Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    - Coefficient("562949953421312")*C
-	    - Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644227703623"));
+            - Coefficient("562949953421312")*B
+            - Coefficient("562949953421312")*C
+            - Coefficient("562949953421312")*D
+            >= -Coefficient("2947644227703623"));
   cs.insert(Coefficient("7286977314969193")*A
-	    - Coefficient("11790576906310892")*B
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108447063768"));
+            - Coefficient("11790576906310892")*B
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108447063768"));
   cs.insert(Coefficient("3643488655232797")*A
-	    - Coefficient("5895288446400047")*B
-	    - Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077554203265688"));
+            - Coefficient("5895288446400047")*B
+            - Coefficient("2251799813685248")*D
+            >= -Coefficient("19077554203265688"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576753188506")*B
-	    + Coefficient("7286977179861205")*C
-	    >= -Coefficient("38155107920142616"));
+            + Coefficient("11790576753188506")*B
+            + Coefficient("7286977179861205")*C
+            >= -Coefficient("38155107920142616"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576766699304")*B
-	    - Coefficient("7286977179861205")*C
-	    >= -Coefficient("38155107965178608"));
+            + Coefficient("11790576766699304")*B
+            - Coefficient("7286977179861205")*C
+            >= -Coefficient("38155107965178608"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("7286977157343207")*B
-	    + Coefficient("11790576712656108")*D
-	    >= -Coefficient("38155107816559824"));
+            + Coefficient("7286977157343207")*B
+            + Coefficient("11790576712656108")*D
+            >= -Coefficient("38155107816559824"));
   cs.insert(Coefficient("2251799813685248")*A
-	    + Coefficient("3643488592182402")*B
-	    - Coefficient("5895288374342453")*D
-	    >= -Coefficient("19077553960071308"));
+            + Coefficient("3643488592182402")*B
+            - Coefficient("5895288374342453")*D
+            >= -Coefficient("19077553960071308"));
   cs.insert(Coefficient("4503599627370496")*A
-	    + Coefficient("11790576753188506")*C
-	    + Coefficient("7286977175357605")*D
-	    >= -Coefficient("38155107924646216"));
+            + Coefficient("11790576753188506")*C
+            + Coefficient("7286977175357605")*D
+            >= -Coefficient("38155107924646216"));
   cs.insert(Coefficient("2251799813685248")*A
-	    + Coefficient("5895288390105051")*C
-	    - Coefficient("3643488594434202")*D
-	    >= -Coefficient("19077553996100104"));
+            + Coefficient("5895288390105051")*C
+            - Coefficient("3643488594434202")*D
+            >= -Coefficient("19077553996100104"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("5895288421630249")*C
-	    + Coefficient("3643488619204000")*D
-	    >= -Coefficient("19077554088423896"));
+            - Coefficient("5895288421630249")*C
+            + Coefficient("3643488619204000")*D
+            >= -Coefficient("19077554088423896"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("11790576865778496")*C
-	    - Coefficient("7286977247415199")*D
-	    >= -Coefficient("38155108244401792"));
+            - Coefficient("11790576865778496")*C
+            - Coefficient("7286977247415199")*D
+            >= -Coefficient("38155108244401792"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("7286977247415199")*B
-	    + Coefficient("11790576888296494")*D
-	    >= -Coefficient("38155108307452184"));
+            - Coefficient("7286977247415199")*B
+            + Coefficient("11790576888296494")*D
+            >= -Coefficient("38155108307452184"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("3643488639470198")*B
-	    - Coefficient("5895288464414445")*D
-	    >= -Coefficient("19077554210021088"));
+            - Coefficient("3643488639470198")*B
+            - Coefficient("5895288464414445")*D
+            >= -Coefficient("19077554210021088"));
   cs.insert(Coefficient("2251799813685248")*A
-	    - Coefficient("5895288428385648")*B
-	    + Coefficient("3643488630462999")*C
-	    >= -Coefficient("19077554131208092"));
+            - Coefficient("5895288428385648")*B
+            + Coefficient("3643488630462999")*C
+            >= -Coefficient("19077554131208092"));
   cs.insert(Coefficient("4503599627370496")*A
-	    - Coefficient("11790576843260498")*B
-	    - Coefficient("7286977224897201")*C
-	    >= -Coefficient("38155108163336992"));
+            - Coefficient("11790576843260498")*B
+            - Coefficient("7286977224897201")*C
+            >= -Coefficient("38155108163336992"));
   cs.insert(Coefficient("1125899906842624")*B
-	    >= -Coefficient("2947644227703623"));
+            >= -Coefficient("2947644227703623"));
   cs.insert(Coefficient("5895288459910846")*B
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("3643488630462999")*D
-	    >= -Coefficient("19077554198762088"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("3643488630462999")*D
+            >= -Coefficient("19077554198762088"));
   cs.insert(Coefficient("5895288457659046")*B
-	    + Coefficient("2251799813685248")*C
-	    - Coefficient("3643488628211199")*D
-	    >= -Coefficient("19077554189754888"));
+            + Coefficient("2251799813685248")*C
+            - Coefficient("3643488628211199")*D
+            >= -Coefficient("19077554189754888"));
   cs.insert(Coefficient("11790576915318092")*B
-	    - Coefficient("4503599627370496")*C
-	    + Coefficient("7286977269933197")*D
-	    >= -Coefficient("38155108393020576"));
+            - Coefficient("4503599627370496")*C
+            + Coefficient("7286977269933197")*D
+            >= -Coefficient("38155108393020576"));
   cs.insert(Coefficient("5895288457659046")*B
-	    - Coefficient("2251799813685248")*C
-	    - Coefficient("3643488632714799")*D
-	    >= -Coefficient("19077554187503088"));
+            - Coefficient("2251799813685248")*C
+            - Coefficient("3643488632714799")*D
+            >= -Coefficient("19077554187503088"));
   cs.insert(Coefficient("7286977292451195")*B
-	    + Coefficient("11790576919821692")*C
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108433552976"));
+            + Coefficient("11790576919821692")*C
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108433552976"));
   cs.insert(Coefficient("3643488664239996")*B
-	    + Coefficient("5895288486932443")*C
-	    - Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077554304596680"));
+            + Coefficient("5895288486932443")*C
+            - Coefficient("2251799813685248")*D
+            >= -Coefficient("19077554304596680"));
   cs.insert(Coefficient("3643488643973798")*B
-	    - Coefficient("5895288446400047")*C
-	    + Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077554180747688"));
+            - Coefficient("5895288446400047")*C
+            + Coefficient("2251799813685248")*D
+            >= -Coefficient("19077554180747688"));
   cs.insert(Coefficient("7286977314969193")*B
-	    - Coefficient("11790576937836090")*C
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108510114168"));
+            - Coefficient("11790576937836090")*C
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108510114168"));
   cs.insert(Coefficient("4503599627370496")*B
-	    + Coefficient("7286977247415199")*C
-	    + Coefficient("11790576883792894")*D
-	    >= -Coefficient("38155108289437784"));
+            + Coefficient("7286977247415199")*C
+            + Coefficient("11790576883792894")*D
+            >= -Coefficient("38155108289437784"));
   cs.insert(Coefficient("4503599627370496")*B
-	    + Coefficient("7286977251918799")*C
-	    - Coefficient("11790576883792894")*D
-	    >= -Coefficient("38155108280430584"));
+            + Coefficient("7286977251918799")*C
+            - Coefficient("11790576883792894")*D
+            >= -Coefficient("38155108280430584"));
   cs.insert(Coefficient("4503599627370496")*B
-	    - Coefficient("7286977229400801")*C
-	    + Coefficient("11790576852267696")*D
-	    >= -Coefficient("38155108181351392"));
+            - Coefficient("7286977229400801")*C
+            + Coefficient("11790576852267696")*D
+            >= -Coefficient("38155108181351392"));
   cs.insert(Coefficient("1125899906842624")*D
-	    >= -Coefficient("2947644225451823"));
+            >= -Coefficient("2947644225451823"));
   cs.insert(Coefficient("4503599627370496")*B
-	    - Coefficient("7286977229400801")*C
-	    - Coefficient("11790576852267696")*D
-	    >= -Coefficient("38155108167840592"));
+            - Coefficient("7286977229400801")*C
+            - Coefficient("11790576852267696")*D
+            >= -Coefficient("38155108167840592"));
   cs.insert(-Coefficient("2251799813685248")*D
-	    >= -Coefficient("5895288448651847"));
+            >= -Coefficient("5895288448651847"));
   cs.insert(Coefficient("2251799813685248")*C
-	    >= -Coefficient("5895288446400047"));
+            >= -Coefficient("5895288446400047"));
   cs.insert(-Coefficient("2251799813685248")*C
-	    >= -Coefficient("5895288444148247"));
+            >= -Coefficient("5895288444148247"));
   cs.insert(-Coefficient("1125899906842624")*B
-	    + Coefficient("1821744321986899")*C
-	    + Coefficient("2947644226577723")*D
-	    >= -Coefficient("9538777088122044"));
+            + Coefficient("1821744321986899")*C
+            + Coefficient("2947644226577723")*D
+            >= -Coefficient("9538777088122044"));
   cs.insert(-Coefficient("3643488607945001")*B
-	    + Coefficient("5895288414874849")*C
-	    + Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077554059150500"));
+            + Coefficient("5895288414874849")*C
+            + Coefficient("2251799813685248")*D
+            >= -Coefficient("19077554059150500"));
   cs.insert(-Coefficient("4503599627370496")*B
-	    + Coefficient("7286977292451195")*C
-	    - Coefficient("11790576906310892")*D
-	    >= -Coefficient("38155108343480984"));
+            + Coefficient("7286977292451195")*C
+            - Coefficient("11790576906310892")*D
+            >= -Coefficient("38155108343480984"));
   cs.insert(-Coefficient("7286977220393601")*B
-	    + Coefficient("11790576829749698")*C
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108086775800"));
+            + Coefficient("11790576829749698")*C
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108086775800"));
   cs.insert(-Coefficient("4503599627370496")*B
-	    - Coefficient("7286977274436797")*C
-	    + Coefficient("11790576901807292")*D
-	    >= -Coefficient("38155108325466584"));
+            - Coefficient("7286977274436797")*C
+            + Coefficient("11790576901807292")*D
+            >= -Coefficient("38155108325466584"));
   cs.insert(-Coefficient("3643488605693201")*B
-	    - Coefficient("5895288414874849")*C
-	    + Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077554059150500"));
+            - Coefficient("5895288414874849")*C
+            + Coefficient("2251799813685248")*D
+            >= -Coefficient("19077554059150500"));
   cs.insert(-Coefficient("1125899906842624")*B
-	    - Coefficient("1821744319735099")*C
-	    - Coefficient("2947644225451823")*D
-	    >= -Coefficient("9538777079114846"));
+            - Coefficient("1821744319735099")*C
+            - Coefficient("2947644225451823")*D
+            >= -Coefficient("9538777079114846"));
   cs.insert(-Coefficient("7286977220393601")*B
-	    - Coefficient("11790576834253298")*C
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108113797400"));
+            - Coefficient("11790576834253298")*C
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108113797400"));
   cs.insert(-Coefficient("5895288462162645")*B
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("3643488639470198")*D
-	    >= -Coefficient("19077554144718892"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("3643488639470198")*D
+            >= -Coefficient("19077554144718892"));
   cs.insert(-Coefficient("11790576924325290")*B
-	    - Coefficient("4503599627370496")*C
-	    + Coefficient("7286977292451195")*D
-	    >= -Coefficient("38155108320962984"));
+            - Coefficient("4503599627370496")*C
+            + Coefficient("7286977292451195")*D
+            >= -Coefficient("38155108320962984"));
   cs.insert(-Coefficient("5895288468918045")*B
-	    + Coefficient("2251799813685248")*C
-	    - Coefficient("3643488641721998")*D
-	    >= -Coefficient("19077554160481492"));
+            + Coefficient("2251799813685248")*C
+            - Coefficient("3643488641721998")*D
+            >= -Coefficient("19077554160481492"));
   cs.insert(-Coefficient("11790576928828890")*B
-	    - Coefficient("4503599627370496")*C
-	    - Coefficient("7286977292451195")*D
-	    >= -Coefficient("38155108329970184"));
+            - Coefficient("4503599627370496")*C
+            - Coefficient("7286977292451195")*D
+            >= -Coefficient("38155108329970184"));
   cs.insert(-Coefficient("281474976710656")*B
-	    >= -Coefficient("736911053829681"));
+            >= -Coefficient("736911053829681"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    + Coefficient("11790576658612912")*B
-	    + Coefficient("7286977125818009")*C
-	    >= -Coefficient("38155107627408640"));
+            + Coefficient("11790576658612912")*B
+            + Coefficient("7286977125818009")*C
+            >= -Coefficient("38155107627408640"));
   cs.insert(-Coefficient("2251799813685248")*A
-	    + Coefficient("5895288336061856")*B
-	    - Coefficient("3643488560657205")*C
-	    >= -Coefficient("19077553829466920"));
+            + Coefficient("5895288336061856")*B
+            - Coefficient("3643488560657205")*C
+            >= -Coefficient("19077553829466920"));
   cs.insert(-Coefficient("2251799813685248")*A
-	    + Coefficient("3643488535887407")*B
-	    + Coefficient("5895288288774060")*D
-	    >= -Coefficient("19077553683099932"));
+            + Coefficient("3643488535887407")*B
+            + Coefficient("5895288288774060")*D
+            >= -Coefficient("19077553683099932"));
   cs.insert(-Coefficient("7286977274436797")*A
-	    + Coefficient("11790576766699304")*B
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108032732608"));
+            + Coefficient("11790576766699304")*B
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108032732608"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    + Coefficient("7286977098796411")*B
-	    - Coefficient("11790576609073318")*D
-	    >= -Coefficient("38155107483293448"));
+            + Coefficient("7286977098796411")*B
+            - Coefficient("11790576609073318")*D
+            >= -Coefficient("38155107483293448"));
   cs.insert(-Coefficient("7286977301458395")*A
-	    + Coefficient("11790576735174106")*B
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155107983193008"));
+            + Coefficient("11790576735174106")*B
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155107983193008"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    + Coefficient("11790576708152508")*C
-	    + Coefficient("7286977148336007")*D
-	    >= -Coefficient("38155107771523824"));
+            + Coefficient("11790576708152508")*C
+            + Coefficient("7286977148336007")*D
+            >= -Coefficient("38155107771523824"));
   cs.insert(-Coefficient("281474976710656")*A
-	    + Coefficient("281474976710656")*B
-	    + Coefficient("281474976710656")*C
-	    + Coefficient("281474976710656")*D
-	    >= -Coefficient("1473822119481311"));
+            + Coefficient("281474976710656")*B
+            + Coefficient("281474976710656")*C
+            + Coefficient("281474976710656")*D
+            >= -Coefficient("1473822119481311"));
   cs.insert(-Coefficient("1125899906842624")*A
-	    + Coefficient("2947644178164027")*C
-	    - Coefficient("1821744285958102")*D
-	    >= -Coefficient("9538776941755056"));
+            + Coefficient("2947644178164027")*C
+            - Coefficient("1821744285958102")*D
+            >= -Coefficient("9538776941755056"));
   cs.insert(-Coefficient("1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    + Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= -Coefficient("5895288471169845"));
+            + Coefficient("1125899906842624")*B
+            + Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= -Coefficient("5895288471169845"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    - Coefficient("11790576856771296")*C
-	    + Coefficient("7286977247415199")*D
-	    >= -Coefficient("38155108221883792"));
+            - Coefficient("11790576856771296")*C
+            + Coefficient("7286977247415199")*D
+            >= -Coefficient("38155108221883792"));
   cs.insert(-Coefficient("1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("1125899906842624")*D
-	    >= -Coefficient("5895288471169845"));
+            + Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            + Coefficient("1125899906842624")*D
+            >= -Coefficient("5895288471169845"));
   cs.insert(-Coefficient("140737488355328")*A
-	    - Coefficient("368455526774103")*C
-	    - Coefficient("227718038700250")*D
-	    >= -Coefficient("1192347131793131"));
+            - Coefficient("368455526774103")*C
+            - Coefficient("227718038700250")*D
+            >= -Coefficient("1192347131793131"));
   cs.insert(-Coefficient("1125899906842624")*A
-	    + Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= -Coefficient("5895288464414445"));
+            + Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= -Coefficient("5895288464414445"));
   cs.insert(-Coefficient("3643488643973798")*A
-	    + Coefficient("2251799813685248")*B
-	    + Coefficient("5895288441896447")*C
-	    >= -Coefficient("19077554158229692"));
+            + Coefficient("2251799813685248")*B
+            + Coefficient("5895288441896447")*C
+            >= -Coefficient("19077554158229692"));
   cs.insert(-Coefficient("7286977296954795")*A
-	    + Coefficient("4503599627370496")*B
-	    - Coefficient("11790576892800094")*C
-	    >= -Coefficient("38155108352488176"));
+            + Coefficient("4503599627370496")*B
+            - Coefficient("11790576892800094")*C
+            >= -Coefficient("38155108352488176"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    - Coefficient("7286977269933197")*B
-	    + Coefficient("11790576924325290")*D
-	    >= -Coefficient("38155108411034976"));
+            - Coefficient("7286977269933197")*B
+            + Coefficient("11790576924325290")*D
+            >= -Coefficient("38155108411034976"));
   cs.insert(-Coefficient("3643488639470198")*A
-	    + Coefficient("2251799813685248")*C
-	    + Coefficient("5895288466666245")*D
-	    >= -Coefficient("19077554219028288"));
+            + Coefficient("2251799813685248")*C
+            + Coefficient("5895288466666245")*D
+            >= -Coefficient("19077554219028288"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    - Coefficient("7286977296954795")*B
-	    - Coefficient("11790576955850488")*D
-	    >= -Coefficient("38155108514617768"));
+            - Coefficient("7286977296954795")*B
+            - Coefficient("11790576955850488")*D
+            >= -Coefficient("38155108514617768"));
   cs.insert(-Coefficient("7286977251918799")*A
-	    + Coefficient("4503599627370496")*C
-	    - Coefficient("11790576892800094")*D
-	    >= -Coefficient("38155108311955784"));
+            + Coefficient("4503599627370496")*C
+            - Coefficient("11790576892800094")*D
+            >= -Coefficient("38155108311955784"));
   cs.insert(-Coefficient("3643488655232797")*A
-	    - Coefficient("2251799813685248")*C
-	    + Coefficient("5895288480177044")*D
-	    >= -Coefficient("19077554264064284"));
+            - Coefficient("2251799813685248")*C
+            + Coefficient("5895288480177044")*D
+            >= -Coefficient("19077554264064284"));
   cs.insert(-Coefficient("1821744320860999")*A
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("2947644229955423")*D
-	    >= -Coefficient("9538777099381044"));
+            - Coefficient("1125899906842624")*C
+            - Coefficient("2947644229955423")*D
+            >= -Coefficient("9538777099381044"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    - Coefficient("11790576874785696")*B
-	    + Coefficient("7286977269933197")*C
-	    >= -Coefficient("38155108302948584"));
+            - Coefficient("11790576874785696")*B
+            + Coefficient("7286977269933197")*C
+            >= -Coefficient("38155108302948584"));
   cs.insert(-Coefficient("7286977274436797")*A
-	    - Coefficient("4503599627370496")*B
-	    + Coefficient("11790576937836090")*C
-	    >= -Coefficient("38155108424545776"));
+            - Coefficient("4503599627370496")*B
+            + Coefficient("11790576937836090")*C
+            >= -Coefficient("38155108424545776"));
   cs.insert(-Coefficient("4503599627370496")*A
-	    - Coefficient("11790576802728102")*B
-	    - Coefficient("7286977197875603")*C
-	    >= -Coefficient("38155108019221808"));
+            - Coefficient("11790576802728102")*B
+            - Coefficient("7286977197875603")*C
+            >= -Coefficient("38155108019221808"));
   cs.insert(-Coefficient("3643488664239996")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("5895288493687843")*C
-	    >= -Coefficient("19077554284330480"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("5895288493687843")*C
+            >= -Coefficient("19077554284330480"));
   cs.insert(-Coefficient("562949953421312")*A
-	    - Coefficient("562949953421312")*B
-	    + Coefficient("562949953421312")*C
-	    + Coefficient("562949953421312")*D
-	    >= -Coefficient("2947644250784571"));
+            - Coefficient("562949953421312")*B
+            + Coefficient("562949953421312")*C
+            + Coefficient("562949953421312")*D
+            >= -Coefficient("2947644250784571"));
   cs.insert(-Coefficient("281474976710656")*A
-	    - Coefficient("281474976710656")*B
-	    + Coefficient("281474976710656")*C
-	    - Coefficient("281474976710656")*D
-	    >= -Coefficient("1473822131021785"));
+            - Coefficient("281474976710656")*B
+            + Coefficient("281474976710656")*C
+            - Coefficient("281474976710656")*D
+            >= -Coefficient("1473822131021785"));
   cs.insert(-Coefficient("1125899906842624")*A
-	    - Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    + Coefficient("1125899906842624")*D
-	    >= -Coefficient("5895288464414445"));
+            - Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            + Coefficient("1125899906842624")*D
+            >= -Coefficient("5895288464414445"));
   cs.insert(-Coefficient("1125899906842624")*A
-	    - Coefficient("1125899906842624")*B
-	    - Coefficient("1125899906842624")*C
-	    - Coefficient("1125899906842624")*D
-	    >= -Coefficient("5895288468918045"));
+            - Coefficient("1125899906842624")*B
+            - Coefficient("1125899906842624")*C
+            - Coefficient("1125899906842624")*D
+            >= -Coefficient("5895288468918045"));
   cs.insert(-Coefficient("3643488412038417")*A
-	    - Coefficient("5895288318047457")*B
-	    + Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077553665085532"));
+            - Coefficient("5895288318047457")*B
+            + Coefficient("2251799813685248")*D
+            >= -Coefficient("19077553665085532"));
   cs.insert(-Coefficient("1821744199263809")*A
-	    - Coefficient("2947644153394229")*B
-	    - Coefficient("1125899906842624")*D
-	    >= -Coefficient("9538776813402468"));
+            - Coefficient("2947644153394229")*B
+            - Coefficient("1125899906842624")*D
+            >= -Coefficient("9538776813402468"));
   cs.insert(-Coefficient("5895288378846052")*A
-	    + Coefficient("3643488632714799")*B
-	    + Coefficient("2251799813685248")*C
-	    >= -Coefficient("19077554023121704"));
+            + Coefficient("3643488632714799")*B
+            + Coefficient("2251799813685248")*C
+            >= -Coefficient("19077554023121704"));
   cs.insert(-Coefficient("11790576834253298")*A
-	    + Coefficient("7286977314969193")*B
-	    - Coefficient("4503599627370496")*C
-	    >= -Coefficient("38155108302948584"));
+            + Coefficient("7286977314969193")*B
+            - Coefficient("4503599627370496")*C
+            >= -Coefficient("38155108302948584"));
   cs.insert(-Coefficient("736911041726257")*A
-	    + Coefficient("281474976710656")*B
-	    + Coefficient("455436077400500")*D
-	    >= -Coefficient("2384694241068264"));
+            + Coefficient("281474976710656")*B
+            + Coefficient("455436077400500")*D
+            >= -Coefficient("2384694241068264"));
   cs.insert(-Coefficient("5895288347320855")*A
-	    + Coefficient("2251799813685248")*B
-	    - Coefficient("3643488616952200")*D
-	    >= -Coefficient("19077553951064108"));
+            + Coefficient("2251799813685248")*B
+            - Coefficient("3643488616952200")*D
+            >= -Coefficient("19077553951064108"));
   cs.insert(-Coefficient("2947644201807925")*A
-	    + Coefficient("1821744319735099")*C
-	    + Coefficient("1125899906842624")*D
-	    >= -Coefficient("9538777048715548"));
+            + Coefficient("1821744319735099")*C
+            + Coefficient("1125899906842624")*D
+            >= -Coefficient("9538777048715548"));
   cs.insert(-Coefficient("11790576820742500")*A
-	    + Coefficient("7286977296954795")*C
-	    - Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108248905384"));
+            + Coefficient("7286977296954795")*C
+            - Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108248905384"));
   cs.insert(-Coefficient("11790576996382886")*A
-	    - Coefficient("7286977251918799")*C
-	    + Coefficient("4503599627370496")*D
-	    >= -Coefficient("38155108523624968"));
+            - Coefficient("7286977251918799")*C
+            + Coefficient("4503599627370496")*D
+            >= -Coefficient("38155108523624968"));
   cs.insert(-Coefficient("5895288507198642")*A
-	    - Coefficient("3643488632714799")*C
-	    - Coefficient("2251799813685248")*D
-	    >= -Coefficient("19077554291085880"));
+            - Coefficient("3643488632714799")*C
+            - Coefficient("2251799813685248")*D
+            >= -Coefficient("19077554291085880"));
   cs.insert(-Coefficient("11790577113476476")*A
-	    - Coefficient("4503599627370496")*B
-	    + Coefficient("7286977319472793")*D
-	    >= -Coefficient("38155108861394936"));
+            - Coefficient("4503599627370496")*B
+            + Coefficient("7286977319472793")*D
+            >= -Coefficient("38155108861394936"));
   cs.insert(-Coefficient("5895288572500836")*A
-	    - Coefficient("2251799813685248")*B
-	    - Coefficient("3643488652980997")*D
-	    >= -Coefficient("19077554450963668"));
+            - Coefficient("2251799813685248")*B
+            - Coefficient("3643488652980997")*D
+            >= -Coefficient("19077554450963668"));
   cs.insert(-Coefficient("5895288484680644")*A
-	    - Coefficient("3643488607945001")*B
-	    + Coefficient("2251799813685248")*C
-	    >= -Coefficient("19077554212272888"));
+            - Coefficient("3643488607945001")*B
+            + Coefficient("2251799813685248")*C
+            >= -Coefficient("19077554212272888"));
   cs.insert(-Coefficient("2947644274991419")*A
-	    - Coefficient("1821744320860999")*B
-	    - Coefficient("1125899906842624")*C
-	    >= -Coefficient("9538777190578936"));
+            - Coefficient("1821744320860999")*B
+            - Coefficient("1125899906842624")*C
+            >= -Coefficient("9538777190578936"));
   cs.insert(-Coefficient("2251799813685248")*A
-	    >= -Coefficient("5895288448651847"));
+            >= -Coefficient("5895288448651847"));
 
   // Cost function.
   Linear_Expression cost(A + B + C + D);
@@ -741,7 +741,7 @@ test08() {
   Variables_Set ivs(A, D);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), ivs, cost,
-		  MINIMIZATION);
+                  MINIMIZATION);
 
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
@@ -796,7 +796,7 @@ test09() {
   Linear_Expression cost(12*A + 6*B + 4*C + 3*D);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), cost,
-		  MAXIMIZATION);
+                  MAXIMIZATION);
 
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
@@ -825,13 +825,13 @@ test10() {
   // Feasible region.
   Constraint_System cs;
   cs.insert(Coefficient("-3152519739159347")*x1
-	    - Coefficient("4503599627370496")*x2
-	    >= Coefficient("-2837267765243412480"));
+            - Coefficient("4503599627370496")*x2
+            >= Coefficient("-2837267765243412480"));
   cs.insert(Coefficient("-14411518807585588")*x1
-	    - Coefficient("3602879701896397")*x2
-	    >= Coefficient("-19455550390240542720"));
+            - Coefficient("3602879701896397")*x2
+            >= Coefficient("-19455550390240542720"));
   cs.insert(Coefficient("25300281663413827294061918339864663381194581220517764794612669753428792445999418361495047962679640561898384733039601488923726092173224184608376674992592313740189678034570795170558363467761652042654970959809093133570250935428086587327262919456144944542601257064044846194041676826903812816523290938580750782913463467636686848")*x1
-	    >= Coefficient("17591821432561"));
+            >= Coefficient("17591821432561"));
   cs.insert(x2 >= 20);
   cs.insert(-x2 >= -500);
 
@@ -839,7 +839,7 @@ test10() {
   Linear_Expression cost(4*x1 + x2);
 
   MIP_Problem mip(cs.space_dimension(), cs.begin(), cs.end(), cost,
-		  MAXIMIZATION);
+                  MAXIMIZATION);
 
   if (mip.solve() != OPTIMIZED_MIP_PROBLEM)
     return false;
@@ -855,8 +855,8 @@ test10() {
   nout << "Maximum value = " << num << "/" << den << endl;
 
   if (pg != point(Coefficient("2747195772696002560")*x1
-		  + Coefficient("63050394783186940")*x2,
-		  Coefficient("3152519739159347"))
+                  + Coefficient("63050394783186940")*x2,
+                  Coefficient("3152519739159347"))
       || num != Coefficient("11051833485567197180")
       || den != Coefficient("3152519739159347"))
     return false;
diff --git a/tests/MIP_Problem/mipproblem4.cc b/tests/MIP_Problem/mipproblem4.cc
index 9514128..ead6d5e 100644
--- a/tests/MIP_Problem/mipproblem4.cc
+++ b/tests/MIP_Problem/mipproblem4.cc
@@ -1,6 +1,6 @@
 /* Test the MIP_Problem class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -34,8 +34,22 @@ test01() {
   return true;
 }
 
+bool
+test02() {
+  Variable A(0);
+  Variable B(1);
+  MIP_Problem mip(1);
+  Generator p1 = mip.optimizing_point();
+  bool ok1 = (p1 == point(0*A));
+  mip.add_space_dimensions_and_embed(1);
+  Generator p2 = mip.optimizing_point();
+  bool ok2 = (p2 == point(0*A + 0*B));
+  return ok1 && ok2;
+}
+
 } // namespace
 
 BEGIN_MAIN
   DO_TEST(test01);
+  DO_TEST(test02);
 END_MAIN
diff --git a/tests/Makefile.am b/tests/Makefile.am
index 77b8864..065145f 100644
--- a/tests/Makefile.am
+++ b/tests/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -52,8 +52,8 @@ libppl_tests.a \
 
 noinst_HEADERS = \
 ppl_test.hh \
-Random_Number_Generator.defs.hh \
-Random_Number_Generator.inlines.hh \
-Random_Number_Generator.types.hh
+Random_Number_Generator_defs.hh \
+Random_Number_Generator_inlines.hh \
+Random_Number_Generator_types.hh
 
 EXTRA_DIST = valgrind_suppressions
diff --git a/tests/Makefile.in b/tests/Makefile.in
index e051b7a..214dca6 100644
--- a/tests/Makefile.in
+++ b/tests/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -59,7 +75,8 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = tests
 DIST_COMMON = README $(noinst_HEADERS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -95,14 +112,24 @@ CONFIG_CLEAN_VPATH_FILES =
 ARFLAGS = cru
 AM_V_AR = $(am__v_AR_ at AM_V@)
 am__v_AR_ = $(am__v_AR_ at AM_DEFAULT_V@)
-am__v_AR_0 = @echo "  AR    " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_AR_0 = @echo "  AR      " $@;
+am__v_AR_1 = 
 libppl_tests_a_AR = $(AR) $(ARFLAGS)
 libppl_tests_a_LIBADD =
 am_libppl_tests_a_OBJECTS = files.$(OBJEXT) ppl_test.$(OBJEXT)
 libppl_tests_a_OBJECTS = $(am_libppl_tests_a_OBJECTS)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -112,20 +139,23 @@ CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \
 	$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -134,17 +164,16 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_tests_a_SOURCES)
 DIST_SOURCES = $(libppl_tests_a_SOURCES)
 RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
@@ -154,6 +183,11 @@ RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
 	install-pdf-recursive install-ps-recursive install-recursive \
 	installcheck-recursive installdirs-recursive pdf-recursive \
 	ps-recursive uninstall-recursive
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 HEADERS = $(noinst_HEADERS)
 RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
   distclean-recursive maintainer-clean-recursive
@@ -410,9 +444,9 @@ libppl_tests.a \
 
 noinst_HEADERS = \
 ppl_test.hh \
-Random_Number_Generator.defs.hh \
-Random_Number_Generator.inlines.hh \
-Random_Number_Generator.types.hh
+Random_Number_Generator_defs.hh \
+Random_Number_Generator_inlines.hh \
+Random_Number_Generator_types.hh
 
 EXTRA_DIST = valgrind_suppressions
 all: all-recursive
@@ -494,12 +528,12 @@ clean-libtool:
 	-rm -rf .libs _libs
 
 # This directory's subdirectories are mostly independent; you can cd
-# into them and run `make' without going through this Makefile.
-# To change the values of `make' variables: instead of editing Makefiles,
-# (1) if the variable is set in `config.status', edit `config.status'
-#     (which will cause the Makefiles to be regenerated when you run `make');
-# (2) otherwise, pass the desired values on the `make' command line.
-$(RECURSIVE_TARGETS):
+# into them and run 'make' without going through this Makefile.
+# To change the values of 'make' variables: instead of editing Makefiles,
+# (1) if the variable is set in 'config.status', edit 'config.status'
+#     (which will cause the Makefiles to be regenerated when you run 'make');
+# (2) otherwise, pass the desired values on the 'make' command line.
+$(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS):
 	@fail= failcom='exit 1'; \
 	for f in x $$MAKEFLAGS; do \
 	  case $$f in \
@@ -509,7 +543,11 @@ $(RECURSIVE_TARGETS):
 	done; \
 	dot_seen=no; \
 	target=`echo $@ | sed s/-recursive//`; \
-	list='$(SUBDIRS)'; for subdir in $$list; do \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	for subdir in $$list; do \
 	  echo "Making $$target in $$subdir"; \
 	  if test "$$subdir" = "."; then \
 	    dot_seen=yes; \
@@ -523,37 +561,6 @@ $(RECURSIVE_TARGETS):
 	if test "$$dot_seen" = "no"; then \
 	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
 	fi; test -z "$$fail"
-
-$(RECURSIVE_CLEAN_TARGETS):
-	@fail= failcom='exit 1'; \
-	for f in x $$MAKEFLAGS; do \
-	  case $$f in \
-	    *=* | --[!k]*);; \
-	    *k*) failcom='fail=yes';; \
-	  esac; \
-	done; \
-	dot_seen=no; \
-	case "$@" in \
-	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
-	  *) list='$(SUBDIRS)' ;; \
-	esac; \
-	rev=''; for subdir in $$list; do \
-	  if test "$$subdir" = "."; then :; else \
-	    rev="$$subdir $$rev"; \
-	  fi; \
-	done; \
-	rev="$$rev ."; \
-	target=`echo $@ | sed s/-recursive//`; \
-	for subdir in $$rev; do \
-	  echo "Making $$target in $$subdir"; \
-	  if test "$$subdir" = "."; then \
-	    local_target="$$target-am"; \
-	  else \
-	    local_target="$$target"; \
-	  fi; \
-	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
-	  || eval $$failcom; \
-	done && test -z "$$fail"
 tags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
@@ -562,6 +569,10 @@ ctags-recursive:
 	list='$(SUBDIRS)'; for subdir in $$list; do \
 	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
 	done
+cscopelist-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \
+	done
 
 ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
 	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
@@ -625,6 +636,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -660,13 +685,10 @@ distdir: $(DISTFILES)
 	done
 	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
 	  if test "$$subdir" = .; then :; else \
-	    test -d "$(distdir)/$$subdir" \
-	    || $(MKDIR_P) "$(distdir)/$$subdir" \
-	    || exit 1; \
-	  fi; \
-	done
-	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
-	  if test "$$subdir" = .; then :; else \
+	    $(am__make_dryrun) \
+	      || test -d "$(distdir)/$$subdir" \
+	      || $(MKDIR_P) "$(distdir)/$$subdir" \
+	      || exit 1; \
 	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
 	    $(am__relativize); \
 	    new_distdir=$$reldir; \
@@ -794,22 +816,23 @@ ps-am:
 uninstall-am:
 
 .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) check-am \
-	ctags-recursive install-am install-strip tags-recursive
+	cscopelist-recursive ctags-recursive install-am install-strip \
+	tags-recursive
 
 .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
 	all all-am check check-am clean clean-checkLIBRARIES \
-	clean-generic clean-libtool ctags ctags-recursive distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-data install-data-am install-dvi \
-	install-dvi-am install-exec install-exec-am install-html \
-	install-html-am install-info install-info-am install-man \
-	install-pdf install-pdf-am install-ps install-ps-am \
-	install-strip installcheck installcheck-am installdirs \
-	installdirs-am maintainer-clean maintainer-clean-generic \
-	mostlyclean mostlyclean-compile mostlyclean-generic \
-	mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \
-	uninstall uninstall-am
+	clean-generic clean-libtool cscopelist cscopelist-recursive \
+	ctags ctags-recursive distclean distclean-compile \
+	distclean-generic distclean-libtool distclean-tags distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	install-data install-data-am install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-ps install-ps-am install-strip \
+	installcheck installcheck-am installdirs installdirs-am \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
+	pdf pdf-am ps ps-am tags tags-recursive uninstall uninstall-am
 
 
 # Tell versions [3.59,3.63) of GNU make to not export all variables.
diff --git a/tests/Octagonal_Shape/Makefile.am b/tests/Octagonal_Shape/Makefile.am
index b9648a3..1250565 100644
--- a/tests/Octagonal_Shape/Makefile.am
+++ b/tests/Octagonal_Shape/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Octagonal_Shape/Makefile.in b/tests/Octagonal_Shape/Makefile.in
index e751430..0891997 100644
--- a/tests/Octagonal_Shape/Makefile.in
+++ b/tests/Octagonal_Shape/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -96,7 +112,8 @@ check_PROGRAMS = addspacedims1$(EXEEXT) affinedimension1$(EXEEXT) \
 XFAIL_TESTS =
 subdir = tests/Octagonal_Shape
 DIST_COMMON = $(dist_check_SCRIPTS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -138,6 +155,7 @@ addspacedims1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_affinedimension1_OBJECTS = affinedimension1.$(OBJEXT)
 affinedimension1_OBJECTS = $(am_affinedimension1_OBJECTS)
 affinedimension1_LDADD = $(LDADD)
@@ -592,6 +610,18 @@ writeoctagon1_LDADD = $(LDADD)
 writeoctagon1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -604,20 +634,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addspacedims1_SOURCES) $(affinedimension1_SOURCES) \
 	$(affineimage1_SOURCES) $(affineimage2_SOURCES) \
 	$(affinepreimage1_SOURCES) $(affinepreimage2_SOURCES) \
@@ -698,10 +724,17 @@ DIST_SOURCES = $(addspacedims1_SOURCES) $(affinedimension1_SOURCES) \
 	$(unconstrain1_SOURCES) $(universe1_SOURCES) \
 	$(upperbound1_SOURCES) $(upperboundifexact1_SOURCES) \
 	$(wrap1_SOURCES) $(writeoctagon1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -1424,6 +1457,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1437,7 +1484,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -1664,8 +1711,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Octagonal_Shape/addspacedims1.cc b/tests/Octagonal_Shape/addspacedims1.cc
index 917d3cd..e002767 100644
--- a/tests/Octagonal_Shape/addspacedims1.cc
+++ b/tests/Octagonal_Shape/addspacedims1.cc
@@ -1,7 +1,7 @@
 /* Test Octagonal_Shape::add_space_dimensions_and_embed() and
    Octagonal_Shape::add_space_dimensions_and_project().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/affinedimension1.cc b/tests/Octagonal_Shape/affinedimension1.cc
index c092107..dc93425 100644
--- a/tests/Octagonal_Shape/affinedimension1.cc
+++ b/tests/Octagonal_Shape/affinedimension1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::affine_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/affineimage1.cc b/tests/Octagonal_Shape/affineimage1.cc
index a0a7940..4e4385a 100644
--- a/tests/Octagonal_Shape/affineimage1.cc
+++ b/tests/Octagonal_Shape/affineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/affineimage2.cc b/tests/Octagonal_Shape/affineimage2.cc
index b367e06..fc413ae 100644
--- a/tests/Octagonal_Shape/affineimage2.cc
+++ b/tests/Octagonal_Shape/affineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/affinepreimage1.cc b/tests/Octagonal_Shape/affinepreimage1.cc
index 5c3b28f..5fdd4fd 100644
--- a/tests/Octagonal_Shape/affinepreimage1.cc
+++ b/tests/Octagonal_Shape/affinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/affinepreimage2.cc b/tests/Octagonal_Shape/affinepreimage2.cc
index 545799c..e058320 100644
--- a/tests/Octagonal_Shape/affinepreimage2.cc
+++ b/tests/Octagonal_Shape/affinepreimage2.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/ascii_dump_load1.cc b/tests/Octagonal_Shape/ascii_dump_load1.cc
index 77341df..46076e9 100644
--- a/tests/Octagonal_Shape/ascii_dump_load1.cc
+++ b/tests/Octagonal_Shape/ascii_dump_load1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::ascii_dump() and Octagonal_Shape::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/bhmz05widening1.cc b/tests/Octagonal_Shape/bhmz05widening1.cc
index b360aad..7400712 100644
--- a/tests/Octagonal_Shape/bhmz05widening1.cc
+++ b/tests/Octagonal_Shape/bhmz05widening1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::BHMZ05_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/bhz03widening1.cc b/tests/Octagonal_Shape/bhz03widening1.cc
index dc801fb..7eac4a7 100644
--- a/tests/Octagonal_Shape/bhz03widening1.cc
+++ b/tests/Octagonal_Shape/bhz03widening1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BHZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/bounded1.cc b/tests/Octagonal_Shape/bounded1.cc
index 76f336e..7adf68f 100644
--- a/tests/Octagonal_Shape/bounded1.cc
+++ b/tests/Octagonal_Shape/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/boundedaffineimage1.cc b/tests/Octagonal_Shape/boundedaffineimage1.cc
index f3dd792..cfa67be 100644
--- a/tests/Octagonal_Shape/boundedaffineimage1.cc
+++ b/tests/Octagonal_Shape/boundedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/boundedaffinepreimage1.cc b/tests/Octagonal_Shape/boundedaffinepreimage1.cc
index 0323db4..2b93086 100644
--- a/tests/Octagonal_Shape/boundedaffinepreimage1.cc
+++ b/tests/Octagonal_Shape/boundedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::bounded_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/bounds1.cc b/tests/Octagonal_Shape/bounds1.cc
index b2c37d4..4109060 100644
--- a/tests/Octagonal_Shape/bounds1.cc
+++ b/tests/Octagonal_Shape/bounds1.cc
@@ -1,7 +1,7 @@
 /* Test OctagonalShape::bounds_from_below() and
    Octagonal_Shape::bounds_from_above().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/cc76extrapolation1.cc b/tests/Octagonal_Shape/cc76extrapolation1.cc
index c05cc02..cc418a2 100644
--- a/tests/Octagonal_Shape/cc76extrapolation1.cc
+++ b/tests/Octagonal_Shape/cc76extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::CC76_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/cc76narrowing1.cc b/tests/Octagonal_Shape/cc76narrowing1.cc
index 3a2a8df..dd4087f 100644
--- a/tests/Octagonal_Shape/cc76narrowing1.cc
+++ b/tests/Octagonal_Shape/cc76narrowing1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::CC76_narrowing_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/chinainit.cc b/tests/Octagonal_Shape/chinainit.cc
index 33cd26b..f0adb75 100644
--- a/tests/Octagonal_Shape/chinainit.cc
+++ b/tests/Octagonal_Shape/chinainit.cc
@@ -1,6 +1,6 @@
 /* Simulate the initialization phase of the China analyzer.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/concatenate1.cc b/tests/Octagonal_Shape/concatenate1.cc
index da6bbea..aea79aa 100644
--- a/tests/Octagonal_Shape/concatenate1.cc
+++ b/tests/Octagonal_Shape/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::concatenate_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/congruences1.cc b/tests/Octagonal_Shape/congruences1.cc
index 0a21225..e309700 100644
--- a/tests/Octagonal_Shape/congruences1.cc
+++ b/tests/Octagonal_Shape/congruences1.cc
@@ -2,7 +2,7 @@
    congruences of an octagon  that is defined by a system of
    congruences that contains only a trivially false congruence.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/constrains1.cc b/tests/Octagonal_Shape/constrains1.cc
index d1c0437..35217a9 100644
--- a/tests/Octagonal_Shape/constrains1.cc
+++ b/tests/Octagonal_Shape/constrains1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::constrains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,16 +23,16 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
 
-#define TEST_PREDICATE_TRUE(pred)		\
-  if (!pred) {					\
-    nout << "!" #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_TRUE(pred)               \
+  if (!pred) {                                  \
+    nout << "!" #pred << endl;                  \
+    ok = false;                                 \
   }
 
-#define TEST_PREDICATE_FALSE(pred)		\
-  if (pred) {					\
-    nout << #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_FALSE(pred)              \
+  if (pred) {                                   \
+    nout << #pred << endl;                      \
+    ok = false;                                 \
   }
 
 namespace {
diff --git a/tests/Octagonal_Shape/constraints1.cc b/tests/Octagonal_Shape/constraints1.cc
index 62b50e7..9c891b6 100644
--- a/tests/Octagonal_Shape/constraints1.cc
+++ b/tests/Octagonal_Shape/constraints1.cc
@@ -2,7 +2,7 @@
    constraints of an octagon  that is defined by a system of
    constraints that contains only a trivially false constraint.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/contains1.cc b/tests/Octagonal_Shape/contains1.cc
index 649f3ea..ddc4df7 100644
--- a/tests/Octagonal_Shape/contains1.cc
+++ b/tests/Octagonal_Shape/contains1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::contains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/containsintegerpoint1.cc b/tests/Octagonal_Shape/containsintegerpoint1.cc
index dedc6e9..7e335a1 100644
--- a/tests/Octagonal_Shape/containsintegerpoint1.cc
+++ b/tests/Octagonal_Shape/containsintegerpoint1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::contains_integer_point().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/difference1.cc b/tests/Octagonal_Shape/difference1.cc
index 37737f9..f406344 100644
--- a/tests/Octagonal_Shape/difference1.cc
+++ b/tests/Octagonal_Shape/difference1.cc
@@ -2,7 +2,7 @@
    contained in `oct2', the result of `oct1.difference_assign(oct2)'
    is an empty octagon.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/discrete1.cc b/tests/Octagonal_Shape/discrete1.cc
index a933408..0ba31df 100644
--- a/tests/Octagonal_Shape/discrete1.cc
+++ b/tests/Octagonal_Shape/discrete1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::is_discrete().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/disjoint1.cc b/tests/Octagonal_Shape/disjoint1.cc
index 83973d3..bd28dbe 100644
--- a/tests/Octagonal_Shape/disjoint1.cc
+++ b/tests/Octagonal_Shape/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::is_disjoint_from(const Octagonal_Shape& y).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/dropsomenonintegerpoints1.cc b/tests/Octagonal_Shape/dropsomenonintegerpoints1.cc
index ae9bf5e..7a12d83 100644
--- a/tests/Octagonal_Shape/dropsomenonintegerpoints1.cc
+++ b/tests/Octagonal_Shape/dropsomenonintegerpoints1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::drop_some_non_integer_points().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/empty1.cc b/tests/Octagonal_Shape/empty1.cc
index 37ced2a..a14832e 100644
--- a/tests/Octagonal_Shape/empty1.cc
+++ b/tests/Octagonal_Shape/empty1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::is_empty() .
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/expandspacedim1.cc b/tests/Octagonal_Shape/expandspacedim1.cc
index ed2c496..125371f 100644
--- a/tests/Octagonal_Shape/expandspacedim1.cc
+++ b/tests/Octagonal_Shape/expandspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::expand_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/foldspacedims1.cc b/tests/Octagonal_Shape/foldspacedims1.cc
index 9ca5634..9816cc5 100644
--- a/tests/Octagonal_Shape/foldspacedims1.cc
+++ b/tests/Octagonal_Shape/foldspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::fold_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/frequency1.cc b/tests/Octagonal_Shape/frequency1.cc
index c97081c..2959faf 100644
--- a/tests/Octagonal_Shape/frequency1.cc
+++ b/tests/Octagonal_Shape/frequency1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::frequency().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/frombdshape1.cc b/tests/Octagonal_Shape/frombdshape1.cc
index ce15faa..71eff8b 100644
--- a/tests/Octagonal_Shape/frombdshape1.cc
+++ b/tests/Octagonal_Shape/frombdshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/frombox1.cc b/tests/Octagonal_Shape/frombox1.cc
index f0c88a9..de330f3 100644
--- a/tests/Octagonal_Shape/frombox1.cc
+++ b/tests/Octagonal_Shape/frombox1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::Octagonal_Shape(const Box<Interval>&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/fromgensys1.cc b/tests/Octagonal_Shape/fromgensys1.cc
index b8426fa..3ed4315 100644
--- a/tests/Octagonal_Shape/fromgensys1.cc
+++ b/tests/Octagonal_Shape/fromgensys1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::Octagonal_Shape(const Generator_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/fromgrid1.cc b/tests/Octagonal_Shape/fromgrid1.cc
index fddbb7f..4ca9147 100644
--- a/tests/Octagonal_Shape/fromgrid1.cc
+++ b/tests/Octagonal_Shape/fromgrid1.cc
@@ -1,7 +1,7 @@
 /* Test C_Polyhedron::C_Polyhedron(const Grid&)
    and NNC_Polyhedron::NNC_Polyhedron(const Grid&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/fromoctagonalshape1.cc b/tests/Octagonal_Shape/fromoctagonalshape1.cc
index 91f3f39..c9754ad 100644
--- a/tests/Octagonal_Shape/fromoctagonalshape1.cc
+++ b/tests/Octagonal_Shape/fromoctagonalshape1.cc
@@ -1,7 +1,7 @@
 /* Test Octagonal_Shape copy construct, construction from other
    Octagonal shapes and assignment.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/frompolyhedron1.cc b/tests/Octagonal_Shape/frompolyhedron1.cc
index db5646e..c036e5e 100644
--- a/tests/Octagonal_Shape/frompolyhedron1.cc
+++ b/tests/Octagonal_Shape/frompolyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::Octagonal_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/fromspacedim1.cc b/tests/Octagonal_Shape/fromspacedim1.cc
index 818deea..21ba78f 100644
--- a/tests/Octagonal_Shape/fromspacedim1.cc
+++ b/tests/Octagonal_Shape/fromspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::Octagonal_Shape(dimension_type, Degenerate_Element).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffineimage1.cc b/tests/Octagonal_Shape/generalizedaffineimage1.cc
index 345d99a..860b721 100644
--- a/tests/Octagonal_Shape/generalizedaffineimage1.cc
+++ b/tests/Octagonal_Shape/generalizedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffineimage2.cc b/tests/Octagonal_Shape/generalizedaffineimage2.cc
index 1417f50..5a470e1 100644
--- a/tests/Octagonal_Shape/generalizedaffineimage2.cc
+++ b/tests/Octagonal_Shape/generalizedaffineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffineimage3.cc b/tests/Octagonal_Shape/generalizedaffineimage3.cc
index 2cff451..7242b2b 100644
--- a/tests/Octagonal_Shape/generalizedaffineimage3.cc
+++ b/tests/Octagonal_Shape/generalizedaffineimage3.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffineimage4.cc b/tests/Octagonal_Shape/generalizedaffineimage4.cc
index b284b04..bb11643 100644
--- a/tests/Octagonal_Shape/generalizedaffineimage4.cc
+++ b/tests/Octagonal_Shape/generalizedaffineimage4.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffineimage5.cc b/tests/Octagonal_Shape/generalizedaffineimage5.cc
index 7335aaf..c865a08 100644
--- a/tests/Octagonal_Shape/generalizedaffineimage5.cc
+++ b/tests/Octagonal_Shape/generalizedaffineimage5.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffinepreimage1.cc b/tests/Octagonal_Shape/generalizedaffinepreimage1.cc
index 41d7244..dc3c7c1 100644
--- a/tests/Octagonal_Shape/generalizedaffinepreimage1.cc
+++ b/tests/Octagonal_Shape/generalizedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffinepreimage2.cc b/tests/Octagonal_Shape/generalizedaffinepreimage2.cc
index dc7dc0c..e9ee9f1 100644
--- a/tests/Octagonal_Shape/generalizedaffinepreimage2.cc
+++ b/tests/Octagonal_Shape/generalizedaffinepreimage2.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffinepreimage3.cc b/tests/Octagonal_Shape/generalizedaffinepreimage3.cc
index cfcadaa..410b6e9 100644
--- a/tests/Octagonal_Shape/generalizedaffinepreimage3.cc
+++ b/tests/Octagonal_Shape/generalizedaffinepreimage3.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/generalizedaffinepreimage4.cc b/tests/Octagonal_Shape/generalizedaffinepreimage4.cc
index 4caf678..0078fd1 100644
--- a/tests/Octagonal_Shape/generalizedaffinepreimage4.cc
+++ b/tests/Octagonal_Shape/generalizedaffinepreimage4.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/integerupperboundifexact1.cc b/tests/Octagonal_Shape/integerupperboundifexact1.cc
index 9bf39e3..e0c8a8f 100644
--- a/tests/Octagonal_Shape/integerupperboundifexact1.cc
+++ b/tests/Octagonal_Shape/integerupperboundifexact1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::integer_upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/intersection1.cc b/tests/Octagonal_Shape/intersection1.cc
index 8422839..57eff5e 100644
--- a/tests/Octagonal_Shape/intersection1.cc
+++ b/tests/Octagonal_Shape/intersection1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/limitedbhmz05extrapolation1.cc b/tests/Octagonal_Shape/limitedbhmz05extrapolation1.cc
index 9294b9b..a9a57b3 100644
--- a/tests/Octagonal_Shape/limitedbhmz05extrapolation1.cc
+++ b/tests/Octagonal_Shape/limitedbhmz05extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::limited_BHMZ05_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/limitedcc76extrapolation1.cc b/tests/Octagonal_Shape/limitedcc76extrapolation1.cc
index 702e04e..2880e84 100644
--- a/tests/Octagonal_Shape/limitedcc76extrapolation1.cc
+++ b/tests/Octagonal_Shape/limitedcc76extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::limited_CC76_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/mapspacedims1.cc b/tests/Octagonal_Shape/mapspacedims1.cc
index f816a0b..bb92cc1 100644
--- a/tests/Octagonal_Shape/mapspacedims1.cc
+++ b/tests/Octagonal_Shape/mapspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::map_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/max_min1.cc b/tests/Octagonal_Shape/max_min1.cc
index 8792161..a5270d4 100644
--- a/tests/Octagonal_Shape/max_min1.cc
+++ b/tests/Octagonal_Shape/max_min1.cc
@@ -1,7 +1,7 @@
 /* Test Octagonal_Shape::maximize(const Linear_Expression&, ...)
    and Octagonal_Shape::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/max_min2.cc b/tests/Octagonal_Shape/max_min2.cc
index b325fc3..627bf06 100644
--- a/tests/Octagonal_Shape/max_min2.cc
+++ b/tests/Octagonal_Shape/max_min2.cc
@@ -1,7 +1,7 @@
 /* Test Octagonal_Shape::maximize(const Linear_Expression&, ...)
    and Octagonal_Shape::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/maxspacedim1.cc b/tests/Octagonal_Shape/maxspacedim1.cc
index 6274aee..1bfc423 100644
--- a/tests/Octagonal_Shape/maxspacedim1.cc
+++ b/tests/Octagonal_Shape/maxspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::max_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/membytes1.cc b/tests/Octagonal_Shape/membytes1.cc
index 531c5ed..a6482cb 100644
--- a/tests/Octagonal_Shape/membytes1.cc
+++ b/tests/Octagonal_Shape/membytes1.cc
@@ -1,6 +1,6 @@
 /* Test the total_memory_in_bytes() and external_memory_in_bytes() methods.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/minconstraints1.cc b/tests/Octagonal_Shape/minconstraints1.cc
index a0b541c..666962e 100644
--- a/tests/Octagonal_Shape/minconstraints1.cc
+++ b/tests/Octagonal_Shape/minconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape<T>::minimized_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/relatwithcons1.cc b/tests/Octagonal_Shape/relatwithcons1.cc
index 8896420..f16186d 100644
--- a/tests/Octagonal_Shape/relatwithcons1.cc
+++ b/tests/Octagonal_Shape/relatwithcons1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::relation_with(c).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/relatwithcons2.cc b/tests/Octagonal_Shape/relatwithcons2.cc
index 3f33723..286720b 100644
--- a/tests/Octagonal_Shape/relatwithcons2.cc
+++ b/tests/Octagonal_Shape/relatwithcons2.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::relation_with(c).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/relatwithcons3.cc b/tests/Octagonal_Shape/relatwithcons3.cc
index 48ef8a2..97d6e02 100644
--- a/tests/Octagonal_Shape/relatwithcons3.cc
+++ b/tests/Octagonal_Shape/relatwithcons3.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/relatwithgen1.cc b/tests/Octagonal_Shape/relatwithgen1.cc
index 9cffb4e..a3ba655 100644
--- a/tests/Octagonal_Shape/relatwithgen1.cc
+++ b/tests/Octagonal_Shape/relatwithgen1.cc
@@ -1,7 +1,7 @@
 /* Test Octagonal_Shape::relation_with(g): we verify that a generator
    is not subsumed by an empty octagon.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/removespacedims1.cc b/tests/Octagonal_Shape/removespacedims1.cc
index fd4fca5..2977601 100644
--- a/tests/Octagonal_Shape/removespacedims1.cc
+++ b/tests/Octagonal_Shape/removespacedims1.cc
@@ -1,6 +1,6 @@
 /* Remove the higher variables from the space.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/run_tests b/tests/Octagonal_Shape/run_tests
index 2aec4dc..7f5e33b 100755
--- a/tests/Octagonal_Shape/run_tests
+++ b/tests/Octagonal_Shape/run_tests
@@ -2,7 +2,7 @@
 
 # Run the Octagonal_Shape tests.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Octagonal_Shape/simplifyusingcontext1.cc b/tests/Octagonal_Shape/simplifyusingcontext1.cc
index acca4f3..2b8163a 100644
--- a/tests/Octagonal_Shape/simplifyusingcontext1.cc
+++ b/tests/Octagonal_Shape/simplifyusingcontext1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::simplify_using_context_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/timeelapse1.cc b/tests/Octagonal_Shape/timeelapse1.cc
index 0fd18e2..2c191f7 100644
--- a/tests/Octagonal_Shape/timeelapse1.cc
+++ b/tests/Octagonal_Shape/timeelapse1.cc
@@ -1,6 +1,6 @@
 /* Test time_elapse_assign() for particular polyhedra.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/unconstrain1.cc b/tests/Octagonal_Shape/unconstrain1.cc
index 3b3b90b..57e0814 100644
--- a/tests/Octagonal_Shape/unconstrain1.cc
+++ b/tests/Octagonal_Shape/unconstrain1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::unconstrain().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/universe1.cc b/tests/Octagonal_Shape/universe1.cc
index 4946fc5..9f3ce1e 100644
--- a/tests/Octagonal_Shape/universe1.cc
+++ b/tests/Octagonal_Shape/universe1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::is_universe().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/upperbound1.cc b/tests/Octagonal_Shape/upperbound1.cc
index 531a371..d3ee77a 100644
--- a/tests/Octagonal_Shape/upperbound1.cc
+++ b/tests/Octagonal_Shape/upperbound1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::poly_hull_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/upperboundifexact1.cc b/tests/Octagonal_Shape/upperboundifexact1.cc
index d56d3a1..64d9cd7 100644
--- a/tests/Octagonal_Shape/upperboundifexact1.cc
+++ b/tests/Octagonal_Shape/upperboundifexact1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/wrap1.cc b/tests/Octagonal_Shape/wrap1.cc
index 11946f4..d31ebaa 100644
--- a/tests/Octagonal_Shape/wrap1.cc
+++ b/tests/Octagonal_Shape/wrap1.cc
@@ -1,6 +1,6 @@
 /* Test Octagonal_Shape::wrap_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Octagonal_Shape/writeoctagon1.cc b/tests/Octagonal_Shape/writeoctagon1.cc
index 9f1915e..276e012 100644
--- a/tests/Octagonal_Shape/writeoctagon1.cc
+++ b/tests/Octagonal_Shape/writeoctagon1.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(ostream&, const Octagonal_Shape&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/PIP_Problem/Makefile.am b/tests/PIP_Problem/Makefile.am
index 8bab0f7..d64b2ea 100644
--- a/tests/PIP_Problem/Makefile.am
+++ b/tests/PIP_Problem/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/PIP_Problem/Makefile.in b/tests/PIP_Problem/Makefile.in
index e5a2100..b65ad7a 100644
--- a/tests/PIP_Problem/Makefile.in
+++ b/tests/PIP_Problem/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -62,7 +78,8 @@ TESTS = ascii_dump_load1$(EXEEXT) exceptions1$(EXEEXT) \
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1) $(am__EXEEXT_2)
 subdir = tests/PIP_Problem
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -108,6 +125,7 @@ ascii_dump_load1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_exceptions1_OBJECTS = exceptions1.$(OBJEXT)
 exceptions1_OBJECTS = $(am_exceptions1_OBJECTS)
 exceptions1_LDADD = $(LDADD)
@@ -138,6 +156,18 @@ weightwatch1_LDADD = $(LDADD)
 weightwatch1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -150,30 +180,33 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(ascii_dump_load1_SOURCES) $(exceptions1_SOURCES) \
 	$(pipproblem1_SOURCES) $(pipproblem2_SOURCES) \
 	$(pipproblem3_SOURCES) $(weightwatch1_SOURCES)
 DIST_SOURCES = $(ascii_dump_load1_SOURCES) $(exceptions1_SOURCES) \
 	$(pipproblem1_SOURCES) $(pipproblem2_SOURCES) \
 	$(pipproblem3_SOURCES) $(weightwatch1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -556,6 +589,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -569,7 +616,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -793,8 +840,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/PIP_Problem/ascii_dump_load1.cc b/tests/PIP_Problem/ascii_dump_load1.cc
index 30e6fec..49cd163 100644
--- a/tests/PIP_Problem/ascii_dump_load1.cc
+++ b/tests/PIP_Problem/ascii_dump_load1.cc
@@ -1,6 +1,6 @@
 /* Test PIP_Problem::ascii_dump() and PIP_Problem::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/PIP_Problem/exceptions1.cc b/tests/PIP_Problem/exceptions1.cc
index b5f9a6c..f5bcd0b 100644
--- a/tests/PIP_Problem/exceptions1.cc
+++ b/tests/PIP_Problem/exceptions1.cc
@@ -1,6 +1,6 @@
 /* Test that the right exceptions are thrown in case of incorrect uses.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/PIP_Problem/pipproblem1.cc b/tests/PIP_Problem/pipproblem1.cc
index 0c2f23d..21e0f7c 100644
--- a/tests/PIP_Problem/pipproblem1.cc
+++ b/tests/PIP_Problem/pipproblem1.cc
@@ -1,6 +1,6 @@
 /* Test the PIP_Problem class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/PIP_Problem/pipproblem2.cc b/tests/PIP_Problem/pipproblem2.cc
index eee0986..dcf0562 100644
--- a/tests/PIP_Problem/pipproblem2.cc
+++ b/tests/PIP_Problem/pipproblem2.cc
@@ -1,6 +1,6 @@
 /* Test the PIP_Problem class
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/PIP_Problem/pipproblem3.cc b/tests/PIP_Problem/pipproblem3.cc
index fd75b32..a876364 100644
--- a/tests/PIP_Problem/pipproblem3.cc
+++ b/tests/PIP_Problem/pipproblem3.cc
@@ -1,6 +1,6 @@
 /* Test the PIP_Problem class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/PIP_Problem/weightwatch1.cc b/tests/PIP_Problem/weightwatch1.cc
index 0218b12..0d65f8f 100644
--- a/tests/PIP_Problem/weightwatch1.cc
+++ b/tests/PIP_Problem/weightwatch1.cc
@@ -1,6 +1,6 @@
 /* Test PIP_Problem (and MIP_Problem) with respect to deterministic timeouts.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/Makefile.am b/tests/Partially_Reduced_Product/Makefile.am
index 731141b..b803761 100644
--- a/tests/Partially_Reduced_Product/Makefile.am
+++ b/tests/Partially_Reduced_Product/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Partially_Reduced_Product/Makefile.in b/tests/Partially_Reduced_Product/Makefile.in
index 8df89f4..5144f98 100644
--- a/tests/Partially_Reduced_Product/Makefile.in
+++ b/tests/Partially_Reduced_Product/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -39,6 +38,23 @@
 # site: http://bugseng.com/products/ppl/ .
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -62,7 +78,8 @@ XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_3)
 subdir = tests/Partially_Reduced_Product
 DIST_COMMON = $(noinst_HEADERS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -128,6 +145,7 @@ addcongruences1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_affineimage1_OBJECTS = affineimage1.$(OBJEXT)
 affineimage1_OBJECTS = $(am_affineimage1_OBJECTS)
 affineimage1_LDADD = $(LDADD)
@@ -451,6 +469,18 @@ upperbound1_LDADD = $(LDADD)
 upperbound1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -463,20 +493,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addcongruences1_SOURCES) $(affineimage1_SOURCES) \
 	$(asciidumpload1_SOURCES) $(bounded1_SOURCES) \
 	$(boundedaffineimage1_SOURCES) $(bounds1_SOURCES) \
@@ -529,11 +555,18 @@ DIST_SOURCES = $(addcongruences1_SOURCES) $(affineimage1_SOURCES) \
 	$(spacedims1_SOURCES) $(timeelapse1_SOURCES) \
 	$(topclosed1_SOURCES) $(topclosure1_SOURCES) \
 	$(upperbound1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 HEADERS = $(noinst_HEADERS)
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -1257,6 +1290,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1270,7 +1317,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -1494,8 +1541,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Partially_Reduced_Product/addcongruences1.cc b/tests/Partially_Reduced_Product/addcongruences1.cc
index 8f21326..f5e3372 100644
--- a/tests/Partially_Reduced_Product/addcongruences1.cc
+++ b/tests/Partially_Reduced_Product/addcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test Smash_Product.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/affineimage1.cc b/tests/Partially_Reduced_Product/affineimage1.cc
index c9446a1..6bbe194 100644
--- a/tests/Partially_Reduced_Product/affineimage1.cc
+++ b/tests/Partially_Reduced_Product/affineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/asciidumpload1.cc b/tests/Partially_Reduced_Product/asciidumpload1.cc
index 8b06fb6..c6eee38 100644
--- a/tests/Partially_Reduced_Product/asciidumpload1.cc
+++ b/tests/Partially_Reduced_Product/asciidumpload1.cc
@@ -1,6 +1,6 @@
 /* Test Direct_Product<nnc_ph, gr> ascii_dump() and ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/bounded1.cc b/tests/Partially_Reduced_Product/bounded1.cc
index 917b733..2c12b75 100644
--- a/tests/Partially_Reduced_Product/bounded1.cc
+++ b/tests/Partially_Reduced_Product/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test Product<>::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/boundedaffineimage1.cc b/tests/Partially_Reduced_Product/boundedaffineimage1.cc
index 35634d4..7b77d24 100644
--- a/tests/Partially_Reduced_Product/boundedaffineimage1.cc
+++ b/tests/Partially_Reduced_Product/boundedaffineimage1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::bounds_from_above() and
    Product<NNC_Polyhedron, Grid>::bounds_from_below()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -37,7 +37,7 @@ test01() {
   Product prp(7, EMPTY);
 
   bool ok = (prp.bounds_from_above(Linear_Expression(0))
-	     && prp.bounds_from_below(Linear_Expression(0)));
+             && prp.bounds_from_below(Linear_Expression(0)));
 
   print_congruences(prp, "*** prp congruences ***");
   print_constraints(prp, "*** prp constraints ***");
@@ -51,7 +51,7 @@ test02() {
   Product prp(0, EMPTY);
 
   bool ok = (prp.bounds_from_above(Linear_Expression(3))
-	     && prp.bounds_from_below(Linear_Expression(3)));
+             && prp.bounds_from_below(Linear_Expression(3)));
 
   print_congruences(prp, "*** prp congruences ***");
   print_constraints(prp, "*** prp constraints ***");
@@ -65,7 +65,7 @@ test03() {
   Product prp(0);
 
   bool ok = (prp.bounds_from_above(Linear_Expression(1))
-	     && prp.bounds_from_below(Linear_Expression(1)));
+             && prp.bounds_from_below(Linear_Expression(1)));
 
   print_congruences(prp, "*** prp congruences ***");
   print_constraints(prp, "*** prp constraints ***");
@@ -196,7 +196,7 @@ test08() {
 
 // Non-empty product. bounded_affine_preimage/3
 bool
-test16() {
+test09() {
   Variable A(0);
   Variable B(1);
   Variable C(2);
@@ -229,7 +229,7 @@ test16() {
 
 // Empty product. bounded_affine_preimage/3
 bool
-test09() {
+test10() {
   Variable A(0);
   Variable B(1);
   Variable C(2);
@@ -266,4 +266,5 @@ BEGIN_MAIN
   DO_TEST(test07);
   DO_TEST(test08);
   DO_TEST(test09);
+  DO_TEST(test10);
 END_MAIN
diff --git a/tests/Partially_Reduced_Product/bounds1.cc b/tests/Partially_Reduced_Product/bounds1.cc
index 2a740ba..1a45043 100644
--- a/tests/Partially_Reduced_Product/bounds1.cc
+++ b/tests/Partially_Reduced_Product/bounds1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::bounds_from_above() and
    Product<NNC_Polyhedron, Grid>::bounds_from_below()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -37,7 +37,7 @@ test01() {
   Product prp(7, EMPTY);
 
   bool ok = (prp.bounds_from_above(Linear_Expression(0))
-	     && prp.bounds_from_below(Linear_Expression(0)));
+             && prp.bounds_from_below(Linear_Expression(0)));
 
   print_congruences(prp, "*** prp congruences ***");
   print_constraints(prp, "*** prp constraints ***");
@@ -51,7 +51,7 @@ test02() {
   Product prp(0, EMPTY);
 
   bool ok = (prp.bounds_from_above(Linear_Expression(3))
-	     && prp.bounds_from_below(Linear_Expression(3)));
+             && prp.bounds_from_below(Linear_Expression(3)));
 
   print_congruences(prp, "*** prp congruences ***");
   print_constraints(prp, "*** prp constraints ***");
@@ -65,7 +65,7 @@ test03() {
   Product prp(0);
 
   bool ok = (prp.bounds_from_above(Linear_Expression(1))
-	     && prp.bounds_from_below(Linear_Expression(1)));
+             && prp.bounds_from_below(Linear_Expression(1)));
 
   print_congruences(prp, "*** prp congruences ***");
   print_constraints(prp, "*** prp constraints ***");
diff --git a/tests/Partially_Reduced_Product/concatenate1.cc b/tests/Partially_Reduced_Product/concatenate1.cc
index d6a92d8..0c10b47 100644
--- a/tests/Partially_Reduced_Product/concatenate1.cc
+++ b/tests/Partially_Reduced_Product/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::concatenate_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/congruences1.cc b/tests/Partially_Reduced_Product/congruences1.cc
index ef52529..e1d4bfc 100644
--- a/tests/Partially_Reduced_Product/congruences1.cc
+++ b/tests/Partially_Reduced_Product/congruences1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/congruencesproduct1.cc b/tests/Partially_Reduced_Product/congruencesproduct1.cc
index 2cf6f0a..173dd39 100644
--- a/tests/Partially_Reduced_Product/congruencesproduct1.cc
+++ b/tests/Partially_Reduced_Product/congruencesproduct1.cc
@@ -1,6 +1,6 @@
 /* Test Partially_Reduced_Product<>:: Congruences_Reduction()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/constraints1.cc b/tests/Partially_Reduced_Product/constraints1.cc
index 609cd76..042369b 100644
--- a/tests/Partially_Reduced_Product/constraints1.cc
+++ b/tests/Partially_Reduced_Product/constraints1.cc
@@ -1,6 +1,6 @@
 /* Test constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/constraintsproduct1.cc b/tests/Partially_Reduced_Product/constraintsproduct1.cc
index 48713ac..6c532f1 100644
--- a/tests/Partially_Reduced_Product/constraintsproduct1.cc
+++ b/tests/Partially_Reduced_Product/constraintsproduct1.cc
@@ -1,6 +1,6 @@
 /* Test Partially_Reduced_Product<>:: Shrink_Using_Congruences_Reduction()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/contains1.cc b/tests/Partially_Reduced_Product/contains1.cc
index fd32700..5630207 100644
--- a/tests/Partially_Reduced_Product/contains1.cc
+++ b/tests/Partially_Reduced_Product/contains1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::contains() and
    Product<NNC_Polyhedron, Grid>::strictly_contains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/difference1.cc b/tests/Partially_Reduced_Product/difference1.cc
index b3b4dac..7ece934 100644
--- a/tests/Partially_Reduced_Product/difference1.cc
+++ b/tests/Partially_Reduced_Product/difference1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::difference_assign() and.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/dimension1.cc b/tests/Partially_Reduced_Product/dimension1.cc
index 5df0564..e27ad53 100644
--- a/tests/Partially_Reduced_Product/dimension1.cc
+++ b/tests/Partially_Reduced_Product/dimension1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::space_dimension() and
    Product<NNC_Polyhedron, Grid>::affine_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/directproduct1.cc b/tests/Partially_Reduced_Product/directproduct1.cc
index 48579d2..fbf02e6 100644
--- a/tests/Partially_Reduced_Product/directproduct1.cc
+++ b/tests/Partially_Reduced_Product/directproduct1.cc
@@ -1,6 +1,6 @@
 /* Test Direct_Product<NNC_Polyhedron, Grid>.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/discrete1.cc b/tests/Partially_Reduced_Product/discrete1.cc
index 9563de6..e298d8b 100644
--- a/tests/Partially_Reduced_Product/discrete1.cc
+++ b/tests/Partially_Reduced_Product/discrete1.cc
@@ -1,6 +1,6 @@
 /* Test Product<>::is_discrete().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/disjoint1.cc b/tests/Partially_Reduced_Product/disjoint1.cc
index 753811d..b1a00ba 100644
--- a/tests/Partially_Reduced_Product/disjoint1.cc
+++ b/tests/Partially_Reduced_Product/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test Product<>::is_disjoint().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/dropsomenonintegerpoints1.cc b/tests/Partially_Reduced_Product/dropsomenonintegerpoints1.cc
index 45312d7..3bd0b1f 100644
--- a/tests/Partially_Reduced_Product/dropsomenonintegerpoints1.cc
+++ b/tests/Partially_Reduced_Product/dropsomenonintegerpoints1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::drop_some_non_integer_points().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/equals1.cc b/tests/Partially_Reduced_Product/equals1.cc
index b3c01f4..c38acef 100644
--- a/tests/Partially_Reduced_Product/equals1.cc
+++ b/tests/Partially_Reduced_Product/equals1.cc
@@ -1,6 +1,6 @@
 /* Test operator==() and operator!=().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/frombdshape1.cc b/tests/Partially_Reduced_Product/frombdshape1.cc
index 97dfc32..56a8f16 100644
--- a/tests/Partially_Reduced_Product/frombdshape1.cc
+++ b/tests/Partially_Reduced_Product/frombdshape1.cc
@@ -1,6 +1,6 @@
 /* Test construction of product from BD_Shape.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/frombox1.cc b/tests/Partially_Reduced_Product/frombox1.cc
index 393e6da..7eb7c05 100644
--- a/tests/Partially_Reduced_Product/frombox1.cc
+++ b/tests/Partially_Reduced_Product/frombox1.cc
@@ -1,6 +1,6 @@
 /* Test construction of product from a Box.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/fromgrid1.cc b/tests/Partially_Reduced_Product/fromgrid1.cc
index 99c27a4..67cb6d7 100644
--- a/tests/Partially_Reduced_Product/fromgrid1.cc
+++ b/tests/Partially_Reduced_Product/fromgrid1.cc
@@ -1,6 +1,6 @@
 /* Test construction of product from a grid.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/fromoctagonalshape1.cc b/tests/Partially_Reduced_Product/fromoctagonalshape1.cc
index 5159c7e..51fe88f 100644
--- a/tests/Partially_Reduced_Product/fromoctagonalshape1.cc
+++ b/tests/Partially_Reduced_Product/fromoctagonalshape1.cc
@@ -1,6 +1,6 @@
 /* Test construction of product from octagonal shape.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/frompolyhedron1.cc b/tests/Partially_Reduced_Product/frompolyhedron1.cc
index 8c4c87b..0969988 100644
--- a/tests/Partially_Reduced_Product/frompolyhedron1.cc
+++ b/tests/Partially_Reduced_Product/frompolyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test construction of product from a polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/fromproduct1.cc b/tests/Partially_Reduced_Product/fromproduct1.cc
index 94f0c3d..2f34301 100644
--- a/tests/Partially_Reduced_Product/fromproduct1.cc
+++ b/tests/Partially_Reduced_Product/fromproduct1.cc
@@ -1,6 +1,6 @@
 /* Test construction of product from another product.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/generalizedaffineimage1.cc b/tests/Partially_Reduced_Product/generalizedaffineimage1.cc
index 6db9fc6..25791ca 100644
--- a/tests/Partially_Reduced_Product/generalizedaffineimage1.cc
+++ b/tests/Partially_Reduced_Product/generalizedaffineimage1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::generalized_affine_image() and
    Product<NNC_Polyhedron, Grid>::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/intersection1.cc b/tests/Partially_Reduced_Product/intersection1.cc
index 72b7ab0..ae33049 100644
--- a/tests/Partially_Reduced_Product/intersection1.cc
+++ b/tests/Partially_Reduced_Product/intersection1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/isempty1.cc b/tests/Partially_Reduced_Product/isempty1.cc
index 5325dbe..abc31be 100644
--- a/tests/Partially_Reduced_Product/isempty1.cc
+++ b/tests/Partially_Reduced_Product/isempty1.cc
@@ -1,6 +1,6 @@
 /* Test Product<>::is_empty().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/isuniverse1.cc b/tests/Partially_Reduced_Product/isuniverse1.cc
index 8106c01..01b932f 100644
--- a/tests/Partially_Reduced_Product/isuniverse1.cc
+++ b/tests/Partially_Reduced_Product/isuniverse1.cc
@@ -1,6 +1,6 @@
 /* Test Product<>::is_universe1().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/maxmin1.cc b/tests/Partially_Reduced_Product/maxmin1.cc
index 11e19fa..b171f03 100644
--- a/tests/Partially_Reduced_Product/maxmin1.cc
+++ b/tests/Partially_Reduced_Product/maxmin1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::maximize() and
    Product<NNC_Polyhedron, Grid>::minimize()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/partially_reduced_product_test.hh b/tests/Partially_Reduced_Product/partially_reduced_product_test.hh
index fa4dc49..e05b6fb 100644
--- a/tests/Partially_Reduced_Product/partially_reduced_product_test.hh
+++ b/tests/Partially_Reduced_Product/partially_reduced_product_test.hh
@@ -1,6 +1,6 @@
 /* Header file for partially_reduced_product test programs.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/refinewithcongruences1.cc b/tests/Partially_Reduced_Product/refinewithcongruences1.cc
index 7f3c989..ef37833 100644
--- a/tests/Partially_Reduced_Product/refinewithcongruences1.cc
+++ b/tests/Partially_Reduced_Product/refinewithcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test refine_with_congruence() and refine_with_congruences()..
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/refinewithconstraints1.cc b/tests/Partially_Reduced_Product/refinewithconstraints1.cc
index d5ad49f..f86ce29 100644
--- a/tests/Partially_Reduced_Product/refinewithconstraints1.cc
+++ b/tests/Partially_Reduced_Product/refinewithconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test refine_with_constraint() and refine_with_constraints()..
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/relations1.cc b/tests/Partially_Reduced_Product/relations1.cc
index 4f077aa..8f46ced 100644
--- a/tests/Partially_Reduced_Product/relations1.cc
+++ b/tests/Partially_Reduced_Product/relations1.cc
@@ -1,6 +1,6 @@
 /* Test relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -80,13 +80,13 @@ test03() {
   dp.refine_with_congruence((A %= 2) / 0);
 
   bool ok = (dp.relation_with(B == 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates())
-	     && dp.relation_with(B >= 0)
-	     == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates()));
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates())
+             && dp.relation_with(B >= 0)
+             == (Poly_Con_Relation::is_included()
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates()));
 
   print_constraints(dp, "*** dp constraints ***");
   print_congruences(dp, "*** dp congruences ***");
@@ -126,13 +126,13 @@ test04() {
   Poly_Con_Relation rel7 = dp.relation_with(2*A + B >= 3);
   Poly_Con_Relation rel8 = dp.relation_with(3*A + 3*B + C >= 7);
   bool ok = (rel3 == Poly_Con_Relation::nothing()
-	     && rel4 == Poly_Con_Relation::nothing()
-	     && rel5 == Poly_Con_Relation::nothing()
-	     && rel6 == (Poly_Con_Relation::is_included()
-			 && Poly_Con_Relation::saturates())
-	     && rel7 == Poly_Con_Relation::is_included()
-	     && rel8 == (Poly_Con_Relation::is_included()
-			 && Poly_Con_Relation::saturates()));
+             && rel4 == Poly_Con_Relation::nothing()
+             && rel5 == Poly_Con_Relation::nothing()
+             && rel6 == (Poly_Con_Relation::is_included()
+                         && Poly_Con_Relation::saturates())
+             && rel7 == Poly_Con_Relation::is_included()
+             && rel8 == (Poly_Con_Relation::is_included()
+                         && Poly_Con_Relation::saturates()));
 
   nout << "dp.relation_with(A + B + C %= 0) == " << rel3 << endl;
   nout << "dp.relation_with(A + B %= 0) == " << rel4 << endl;
@@ -211,8 +211,8 @@ test07() {
 
   Poly_Con_Relation rel = dp.relation_with(B %= 0);
   bool ok = (rel == (Poly_Con_Relation::is_included()
-		 && Poly_Con_Relation::is_disjoint()
-	         && Poly_Con_Relation::saturates()));
+                 && Poly_Con_Relation::is_disjoint()
+                 && Poly_Con_Relation::saturates()));
 
   nout << "dp.relation_with(B %= 0) == " << rel << endl;
   print_constraints(dp, "*** dp constraints ***");
@@ -253,13 +253,13 @@ test08() {
   Poly_Con_Relation rel7 = dp.relation_with(2*A + B %= 3);
   Poly_Con_Relation rel8 = dp.relation_with(3*A + 3*B + C %= 7);
   bool ok = (rel3 == Poly_Con_Relation::nothing()
-	     && rel4 == Poly_Con_Relation::nothing()
-	     && rel5 == Poly_Con_Relation::nothing()
-	     && rel6 == (Poly_Con_Relation::is_included()
-			 && Poly_Con_Relation::saturates())
-	     && rel7 == Poly_Con_Relation::is_included()
-	     && rel8 == (Poly_Con_Relation::is_included()
-			 && Poly_Con_Relation::saturates()));
+             && rel4 == Poly_Con_Relation::nothing()
+             && rel5 == Poly_Con_Relation::nothing()
+             && rel6 == (Poly_Con_Relation::is_included()
+                         && Poly_Con_Relation::saturates())
+             && rel7 == Poly_Con_Relation::is_included()
+             && rel8 == (Poly_Con_Relation::is_included()
+                         && Poly_Con_Relation::saturates()));
 
   nout << "dp.relation_with(A + B + C %= 0) == " << rel3 << endl;
   nout << "dp.relation_with(A + B %= 0) == " << rel4 << endl;
@@ -285,14 +285,14 @@ test09() {
   dp.refine_with_congruence(6*A + 3*B %= 0);
 
   bool okdp1 = (dp.domain1().relation_with(2*A + B %= 3)
-		== Poly_Con_Relation::strictly_intersects());
+                == Poly_Con_Relation::strictly_intersects());
 
   bool okdp2 = (dp.domain2().relation_with(2*A + B %= 3)
-	       == Poly_Con_Relation::strictly_intersects());
+               == Poly_Con_Relation::strictly_intersects());
 
   Poly_Con_Relation rel = dp.relation_with(2*A + B %= 3);
   bool ok = (okdp1 && okdp2
-	     && rel == Poly_Con_Relation::nothing());
+             && rel == Poly_Con_Relation::nothing());
 
   print_constraints(dp, "*** dp constraints ***");
   print_congruences(dp, "*** dp congruences ***");
diff --git a/tests/Partially_Reduced_Product/shapepreservingproduct1.cc b/tests/Partially_Reduced_Product/shapepreservingproduct1.cc
index 96a495e..af03d55 100644
--- a/tests/Partially_Reduced_Product/shapepreservingproduct1.cc
+++ b/tests/Partially_Reduced_Product/shapepreservingproduct1.cc
@@ -1,6 +1,6 @@
 /* Test Partially_Reduced_Product<>:: Shape_Preserving_Reduction()
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/smashproduct1.cc b/tests/Partially_Reduced_Product/smashproduct1.cc
index a7ee2c1..4529ff3 100644
--- a/tests/Partially_Reduced_Product/smashproduct1.cc
+++ b/tests/Partially_Reduced_Product/smashproduct1.cc
@@ -1,6 +1,6 @@
 /* Test Smash_Product.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -424,7 +424,7 @@ test14() {
   sp2.refine_with_congruence((B %= 1) / 3);
 
   bool smash_ok = (!sp1.upper_bound_assign_if_exact(sp2)
-		   && !sp2.upper_bound_assign_if_exact(sp1));
+                   && !sp2.upper_bound_assign_if_exact(sp1));
 
   if (!smash_ok) {
     print_congruences(sp1, "*** sp1 congruences ub exact ***");
diff --git a/tests/Partially_Reduced_Product/spacedims1.cc b/tests/Partially_Reduced_Product/spacedims1.cc
index 33c1382..439cebd 100644
--- a/tests/Partially_Reduced_Product/spacedims1.cc
+++ b/tests/Partially_Reduced_Product/spacedims1.cc
@@ -7,7 +7,7 @@
    Product<NNC_Polyhedron, Grid>::expand_space_dimension() and
    Product<NNC_Polyhedron, Grid>::map_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/timeelapse1.cc b/tests/Partially_Reduced_Product/timeelapse1.cc
index 32ed612..5eec79e 100644
--- a/tests/Partially_Reduced_Product/timeelapse1.cc
+++ b/tests/Partially_Reduced_Product/timeelapse1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::time_elapse_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/topclosed1.cc b/tests/Partially_Reduced_Product/topclosed1.cc
index 2cc1c90..1edcd74 100644
--- a/tests/Partially_Reduced_Product/topclosed1.cc
+++ b/tests/Partially_Reduced_Product/topclosed1.cc
@@ -1,6 +1,6 @@
 /* Test Product<>::is_topologically_closed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/topclosure1.cc b/tests/Partially_Reduced_Product/topclosure1.cc
index bd81270..f9a0a5e 100644
--- a/tests/Partially_Reduced_Product/topclosure1.cc
+++ b/tests/Partially_Reduced_Product/topclosure1.cc
@@ -1,6 +1,6 @@
 /* Test Product<NNC_Polyhedron, Grid>::topological_closure_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Partially_Reduced_Product/upperbound1.cc b/tests/Partially_Reduced_Product/upperbound1.cc
index 4ea6787..3b14537 100644
--- a/tests/Partially_Reduced_Product/upperbound1.cc
+++ b/tests/Partially_Reduced_Product/upperbound1.cc
@@ -1,7 +1,7 @@
 /* Test Product<NNC_Polyhedron, Grid>::upper_bound_assign()
    Product<NNC_Polyhedron, Grid>::upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -136,7 +136,7 @@ test04() {
   prp2.refine_with_congruence((B %= 1) / 3);
 
   bool cons_ok = (!prp1.upper_bound_assign_if_exact(prp2)
-		   && !prp2.upper_bound_assign_if_exact(prp1));
+                   && !prp2.upper_bound_assign_if_exact(prp1));
 
   if (!cons_ok) {
     print_congruences(prp1, "*** prp1 congruences ub exact ***");
diff --git a/tests/Polyhedron/Makefile.am b/tests/Polyhedron/Makefile.am
index 5bcc76d..fcfcc69 100644
--- a/tests/Polyhedron/Makefile.am
+++ b/tests/Polyhedron/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Polyhedron/Makefile.in b/tests/Polyhedron/Makefile.in
index e8348d2..43834db 100644
--- a/tests/Polyhedron/Makefile.in
+++ b/tests/Polyhedron/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ TESTS = $(am__EXEEXT_1) $(am__EXEEXT_2)
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_3) $(am__EXEEXT_4)
 subdir = tests/Polyhedron
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -205,6 +222,7 @@ addcongruence1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_addcongruences1_OBJECTS = addcongruences1.$(OBJEXT)
 addcongruences1_OBJECTS = $(am_addcongruences1_OBJECTS)
 addcongruences1_LDADD = $(LDADD)
@@ -1808,6 +1826,18 @@ writevariable1_LDADD = $(LDADD)
 writevariable1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -1820,20 +1850,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addcongruence1_SOURCES) $(addcongruences1_SOURCES) \
 	$(addconstraint1_SOURCES) $(addconstraints1_SOURCES) \
 	$(addconstraints2_SOURCES) $(addgenerator1_SOURCES) \
@@ -2054,10 +2080,17 @@ DIST_SOURCES = $(addcongruence1_SOURCES) $(addcongruences1_SOURCES) \
 	$(writeconsys1_SOURCES) $(writegensys1_SOURCES) \
 	$(writepolyhedron1_SOURCES) $(writepolyhedron2_SOURCES) \
 	$(writerelation1_SOURCES) $(writevariable1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -4687,6 +4720,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -4700,7 +4747,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -4924,8 +4971,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Polyhedron/addcongruence1.cc b/tests/Polyhedron/addcongruence1.cc
index 281fdd9..9bb09aa 100644
--- a/tests/Polyhedron/addcongruence1.cc
+++ b/tests/Polyhedron/addcongruence1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_congruence().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/addcongruences1.cc b/tests/Polyhedron/addcongruences1.cc
index 823733a..7f238ce 100644
--- a/tests/Polyhedron/addcongruences1.cc
+++ b/tests/Polyhedron/addcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/addconstraint1.cc b/tests/Polyhedron/addconstraint1.cc
index c9a4b60..abcd094 100644
--- a/tests/Polyhedron/addconstraint1.cc
+++ b/tests/Polyhedron/addconstraint1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_constraint().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -38,7 +38,7 @@ test01() {
 
   C_Polyhedron ph2(2);
   for (Constraint_System::const_iterator i = ph1.constraints().begin(),
-	 cs_end = ph1.constraints().end(); i != cs_end; ++i)
+         cs_end = ph1.constraints().end(); i != cs_end; ++i)
     ph2.add_constraint(*i);
 
   C_Polyhedron known_result(2);
diff --git a/tests/Polyhedron/addconstraints1.cc b/tests/Polyhedron/addconstraints1.cc
index e16c2af..a1d3d60 100644
--- a/tests/Polyhedron/addconstraints1.cc
+++ b/tests/Polyhedron/addconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_constrains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -46,8 +46,8 @@ test01() {
   C_Polyhedron univ_result;
 
   bool ok = (ph1 == empty_result
-	     && ph2 == empty_result
-	     && ph3 == univ_result);
+             && ph2 == empty_result
+             && ph3 == univ_result);
 
   print_constraints(ph1, "*** ph1 ***");
   print_constraints(ph2, "*** ph2 ***");
diff --git a/tests/Polyhedron/addconstraints2.cc b/tests/Polyhedron/addconstraints2.cc
index 568152b..9b20536 100644
--- a/tests/Polyhedron/addconstraints2.cc
+++ b/tests/Polyhedron/addconstraints2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_constrains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/addgenerator1.cc b/tests/Polyhedron/addgenerator1.cc
index e235537..96f4a9c 100644
--- a/tests/Polyhedron/addgenerator1.cc
+++ b/tests/Polyhedron/addgenerator1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_generator().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/addgenerator2.cc b/tests/Polyhedron/addgenerator2.cc
index 483140b..d9d295d 100644
--- a/tests/Polyhedron/addgenerator2.cc
+++ b/tests/Polyhedron/addgenerator2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_generator().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -45,7 +45,7 @@ test01() {
 
   const Generator_System& gs1 = ph1.minimized_generators();
   for (Generator_System::const_iterator i = gs1.begin(),
-	 gs1_end = gs1.end(); i != gs1_end; ++i)
+         gs1_end = gs1.end(); i != gs1_end; ++i)
     ph2.add_generator(*i);
 
   C_Polyhedron known_result(2);
@@ -75,7 +75,7 @@ test02() {
 
   const Generator_System& gs1 = ph1.minimized_generators();
   for (Generator_System::const_iterator i = gs1.begin(),
-	 gs1_end = gs1.end(); i != gs1_end; ++i)
+         gs1_end = gs1.end(); i != gs1_end; ++i)
     ph2.add_generator(*i);
 
   C_Polyhedron known_result(2);
@@ -104,7 +104,7 @@ test03() {
   C_Polyhedron ph(2, EMPTY);
 
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     if (!(*i).is_closure_point())
       ph.add_generator(*i);
 
diff --git a/tests/Polyhedron/addgenerators1.cc b/tests/Polyhedron/addgenerators1.cc
index d726073..2797566 100644
--- a/tests/Polyhedron/addgenerators1.cc
+++ b/tests/Polyhedron/addgenerators1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/addgenerators2.cc b/tests/Polyhedron/addgenerators2.cc
index 85d5196..12ed28a 100644
--- a/tests/Polyhedron/addgenerators2.cc
+++ b/tests/Polyhedron/addgenerators2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::add_generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -64,7 +64,7 @@ test01() {
   C_Polyhedron closed_known_result(known_result);
 
   bool ok = (ph == known_result
-	     && closed_ph == closed_known_result);
+             && closed_ph == closed_known_result);
 
   print_generators(ph, "*** after add_generators(gs) ***");
   print_generators(closed_ph, "*** closed_ph ***");
diff --git a/tests/Polyhedron/addspacedims1.cc b/tests/Polyhedron/addspacedims1.cc
index fd5ae37..e8a87c6 100644
--- a/tests/Polyhedron/addspacedims1.cc
+++ b/tests/Polyhedron/addspacedims1.cc
@@ -1,7 +1,7 @@
 /* Test Polyhedron::add_space_dimensions_and_project()
    and  Polyhedron::add_space_dimensions_and_embed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -71,7 +71,7 @@ test02() {
   C_Polyhedron known_result(7, EMPTY);
 
   bool ok = (computed_result1 == known_result
-	     && computed_result2 == known_result);
+             && computed_result2 == known_result);
 
   print_constraints(computed_result1, "*** computed_result1 ***");
   print_constraints(computed_result2, "*** computed_result2 ***");
@@ -159,7 +159,7 @@ test05() {
   bool ok = (ph == known_result);
 
   print_constraints(ph,
-		    "*** after ph.add_space_dimensions_and_project(1) ***");
+                    "*** after ph.add_space_dimensions_and_project(1) ***");
 
   return ok;
 }
@@ -183,9 +183,9 @@ test06() {
   bool ok = (ph1 == ph2);
 
   print_constraints(ph1,
-		    "*** after ph1.add_space_dimensions_and_embed(0) ***");
+                    "*** after ph1.add_space_dimensions_and_embed(0) ***");
   print_constraints(ph2,
-		    "*** after ph2.add_space_dimensions_and_project(0) ***");
+                    "*** after ph2.add_space_dimensions_and_project(0) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/addspacedims2.cc b/tests/Polyhedron/addspacedims2.cc
index c50301d..5f07e06 100644
--- a/tests/Polyhedron/addspacedims2.cc
+++ b/tests/Polyhedron/addspacedims2.cc
@@ -1,7 +1,7 @@
 /* Test Polyhedron::add_space_dimensions_and_project()
    and  Polyhedron::add_space_dimensions_and_embed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -210,7 +210,7 @@ test06() {
   bool ok = (ph1 == known_result);
 
   print_constraints(ph1,
-		    "*** after ph1.add_space_dimensions_and_embed(1) ***");
+                    "*** after ph1.add_space_dimensions_and_embed(1) ***");
   print_generators(ph1, "*** after ph1.add_space_dimensions_and_embed(1) ***");
 
   return ok;
diff --git a/tests/Polyhedron/affineimage1.cc b/tests/Polyhedron/affineimage1.cc
index 7814145..b411e3e 100644
--- a/tests/Polyhedron/affineimage1.cc
+++ b/tests/Polyhedron/affineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -221,7 +221,7 @@ test08() {
 
   print_generators(ph, "*** after ph.affine_image(A, A + 1) ***");
   print_generators(copy_ph,
-		   "*** after copy_ph.affine_image(A, -A - 1, -1) ***");
+                   "*** after copy_ph.affine_image(A, -A - 1, -1) ***");
 
   return ok;
 }
@@ -246,7 +246,7 @@ test09() {
 
   print_generators(ph, "*** after ph.affine_image(B, A + 1) ***");
   print_generators(copy_ph,
-		   "*** after copy_ph.affine_image(B, -A - 1, -1) ***");
+                   "*** after copy_ph.affine_image(B, -A - 1, -1) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/affineimage2.cc b/tests/Polyhedron/affineimage2.cc
index 840a068..818f37c 100644
--- a/tests/Polyhedron/affineimage2.cc
+++ b/tests/Polyhedron/affineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/affinepreimage1.cc b/tests/Polyhedron/affinepreimage1.cc
index 44ed059..a11c33c 100644
--- a/tests/Polyhedron/affinepreimage1.cc
+++ b/tests/Polyhedron/affinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -297,7 +297,7 @@ test11() {
 
   print_generators(ph, "*** after ph.affine_preimage(A, A + 1) ***");
   print_generators(copy_ph,
-		   "*** after copy_ph.affine_preimage(A, -A - 1, -1) ***");
+                   "*** after copy_ph.affine_preimage(A, -A - 1, -1) ***");
   return ok;
 }
 
@@ -321,7 +321,7 @@ test12() {
 
   print_generators(ph, "*** after ph.affine_preimage(B, A + 1) ***");
   print_generators(copy_ph,
-		   "*** after copy_ph.affine_preimage(B, -A - 1, -1) ***");
+                   "*** after copy_ph.affine_preimage(B, -A - 1, -1) ***");
   return ok;
 }
 
diff --git a/tests/Polyhedron/affinetrans.cc b/tests/Polyhedron/affinetrans.cc
index 048c23b..e928e16 100644
--- a/tests/Polyhedron/affinetrans.cc
+++ b/tests/Polyhedron/affinetrans.cc
@@ -1,6 +1,6 @@
 /* Use of the functions affine_image and affine_preimage.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/append1.cc b/tests/Polyhedron/append1.cc
index d3e2aeb..5dac713 100644
--- a/tests/Polyhedron/append1.cc
+++ b/tests/Polyhedron/append1.cc
@@ -1,6 +1,6 @@
 /* An example of iteration to a post-fixpoint.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,8 +27,8 @@ namespace {
 
 void
 shift_rename_add(const C_Polyhedron& p,
-		 dimension_type offset,
-		 C_Polyhedron& q) {
+                 dimension_type offset,
+                 C_Polyhedron& q) {
   C_Polyhedron r(offset);
   r.concatenate_assign(p);
   q.intersection_assign(r);
diff --git a/tests/Polyhedron/append2.cc b/tests/Polyhedron/append2.cc
index 40deb6b..c87c2fb 100644
--- a/tests/Polyhedron/append2.cc
+++ b/tests/Polyhedron/append2.cc
@@ -1,6 +1,6 @@
 /* An example of iteration to a post-fixpoint.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,8 +27,8 @@ namespace {
 
 void
 shift_rename_add(const C_Polyhedron& p,
-		 dimension_type offset,
-		 C_Polyhedron& q) {
+                 dimension_type offset,
+                 C_Polyhedron& q) {
   C_Polyhedron r(offset);
   r.concatenate_assign(p);
   q.intersection_assign(r);
@@ -37,7 +37,7 @@ shift_rename_add(const C_Polyhedron& p,
 void
 append_init(C_Polyhedron& base, C_Polyhedron& induct, C_Polyhedron& expect,
             dimension_type& offset, unsigned int& arity,
-	    unsigned int& num_vars) {
+            unsigned int& num_vars) {
   offset = 3;
   arity = 3;
   num_vars = 6;
diff --git a/tests/Polyhedron/ascii_dump_load1.cc b/tests/Polyhedron/ascii_dump_load1.cc
index 0fd23fa..319b600 100644
--- a/tests/Polyhedron/ascii_dump_load1.cc
+++ b/tests/Polyhedron/ascii_dump_load1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::ascii_dump() and Polyhedron::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/ascii_dump_load2.cc b/tests/Polyhedron/ascii_dump_load2.cc
index e8f3eb7..b91e485 100644
--- a/tests/Polyhedron/ascii_dump_load2.cc
+++ b/tests/Polyhedron/ascii_dump_load2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::ascii_dump() and Polyhedron::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/ascii_dump_load3.cc b/tests/Polyhedron/ascii_dump_load3.cc
index c0ca78a..c7f5f43 100644
--- a/tests/Polyhedron/ascii_dump_load3.cc
+++ b/tests/Polyhedron/ascii_dump_load3.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::ascii_dump() and Polyhedron::ascii_load().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/bgp99extrapolation1.cc b/tests/Polyhedron/bgp99extrapolation1.cc
index 916e625..1ecf2cb 100644
--- a/tests/Polyhedron/bgp99extrapolation1.cc
+++ b/tests/Polyhedron/bgp99extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BGP99_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -89,8 +89,8 @@ aux2_test01(unsigned n) {
   case 1:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 1 << ", "
-	 << "P" << p_base + 3 << " }" << endl;
+         << "P" << p_base + 1 << ", "
+         << "P" << p_base + 3 << " }" << endl;
 
     s.add_disjunct(aux1_test01(p_base + 1));
     s.add_disjunct(aux1_test01(p_base + 3));
@@ -98,8 +98,8 @@ aux2_test01(unsigned n) {
   case 2:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 2 << ", "
-	 << "P" << p_base + 3 << " }" << endl;
+         << "P" << p_base + 2 << ", "
+         << "P" << p_base + 3 << " }" << endl;
 
     s.add_disjunct(aux1_test01(p_base + 2));
     s.add_disjunct(aux1_test01(p_base + 3));
@@ -107,8 +107,8 @@ aux2_test01(unsigned n) {
   case 0:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 2 << ", "
-	 << "P" << p_base + 4 << " }" << endl;
+         << "P" << p_base + 2 << ", "
+         << "P" << p_base + 4 << " }" << endl;
 
     s.add_disjunct(aux1_test01(p_base + 2));
     s.add_disjunct(aux1_test01(p_base + 4));
diff --git a/tests/Polyhedron/bgp99extrapolation2.cc b/tests/Polyhedron/bgp99extrapolation2.cc
index 4290272..d4f4ef3 100644
--- a/tests/Polyhedron/bgp99extrapolation2.cc
+++ b/tests/Polyhedron/bgp99extrapolation2.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BGP99_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/bhrz03widening1.cc b/tests/Polyhedron/bhrz03widening1.cc
index e85f86c..052d618 100644
--- a/tests/Polyhedron/bhrz03widening1.cc
+++ b/tests/Polyhedron/bhrz03widening1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::BHRZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -352,7 +352,7 @@ test09() {
 
   for (unsigned i = 1; i <= 100; ++i) {
     print_generators(q_i_minus_1.generators(),
-		     "*** Result of the previous iteration ***");
+                     "*** Result of the previous iteration ***");
 
     C_Polyhedron p_i = aux2_test09(i);
     print_generators(p_i.generators(), "*** New stuff ***");
@@ -360,11 +360,11 @@ test09() {
     C_Polyhedron q_i = q_i_minus_1;
     q_i.upper_bound_assign(p_i);
     print_generators(q_i.generators(),
-		     "*** Poly-hull of previous with new ***");
+                     "*** Poly-hull of previous with new ***");
 
     q_i.BHRZ03_widening_assign(q_i_minus_1);
     print_generators(q_i.generators(),
-		     "*** Result of widening poly-hull with new ***");
+                     "*** Result of widening poly-hull with new ***");
 
     if (q_i == q_i_minus_1) {
 
diff --git a/tests/Polyhedron/bhrz03widening2.cc b/tests/Polyhedron/bhrz03widening2.cc
index 4b67376..35b7dd4 100644
--- a/tests/Polyhedron/bhrz03widening2.cc
+++ b/tests/Polyhedron/bhrz03widening2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::BHRZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/bhrz03widening3.cc b/tests/Polyhedron/bhrz03widening3.cc
index 9a5aac1..37fe98f 100644
--- a/tests/Polyhedron/bhrz03widening3.cc
+++ b/tests/Polyhedron/bhrz03widening3.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::BHRZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -162,7 +162,7 @@ test03() {
 
   for (unsigned i = 1; i <= 100; ++i) {
     print_generators(q_i_minus_1.generators(),
-		     "*** Result of the previous iteration ***");
+                     "*** Result of the previous iteration ***");
 
     C_Polyhedron p_i = aux3_test03(i);
     print_generators(p_i.generators(), "*** New stuff ***");
@@ -170,11 +170,11 @@ test03() {
     C_Polyhedron q_i = q_i_minus_1;
     q_i.upper_bound_assign(p_i);
     print_generators(q_i.generators(),
-		     "*** Poly-hull of previous with new ***");
+                     "*** Poly-hull of previous with new ***");
 
     q_i.BHRZ03_widening_assign(q_i_minus_1);
     print_generators(q_i.generators(),
-		     "*** Result of widening poly-hull with new ***");
+                     "*** Result of widening poly-hull with new ***");
 
     if (q_i == q_i_minus_1) {
       C_Polyhedron known_result(2);
@@ -206,16 +206,19 @@ aux1_test04() {
 Generator
 aux2_test04(const Generator& p1, const Generator& p2, unsigned magic_number) {
   // Splitting segment.
+  Linear_Expression expr1(p1.expression());
+  Linear_Expression expr2(p2.expression());
   const Coefficient& d1 = p1.divisor();
   const Coefficient& d2 = p2.divisor();
-  Linear_Expression expr = d2 * Linear_Expression(p1);
-  expr += d1 * Linear_Expression(p2);
+  expr1 *= d2;
+  expr2 *= d1;
+  expr1 += expr2;
   // The divisor for the average is 2 * d1 * d2.
   // by carefully taking a smaller divisor, we obtain a point
   // that won't be redundant in the polyhedron.
   // NOTE: I am not *sure* this dirty kludge of using such
   // a magic number will always succeed.
-  return point((magic_number+1)*expr, magic_number*2*d1*d2);
+  return point((magic_number+1)*expr1, magic_number*2*d1*d2);
 }
 
 Generator_System
@@ -284,7 +287,7 @@ test04() {
 
   for (unsigned i = 1; i <= 100; ++i) {
     print_generators(q_i_minus_1.generators(),
-		     "*** Result of the previous iteration ***");
+                     "*** Result of the previous iteration ***");
 
     C_Polyhedron p_i = aux4_test04(i);
     print_generators(p_i.generators(), "*** New stuff ***");
@@ -292,11 +295,11 @@ test04() {
     C_Polyhedron q_i = q_i_minus_1;
     q_i.upper_bound_assign(p_i);
     print_generators(q_i.generators(),
-		     "*** Poly-hull of previous with new ***");
+                     "*** Poly-hull of previous with new ***");
 
     q_i.BHRZ03_widening_assign(q_i_minus_1);
     print_generators(q_i.generators(),
-		     "*** Result of widening poly-hull with new ***");
+                     "*** Result of widening poly-hull with new ***");
 
     if (q_i == q_i_minus_1) {
       C_Polyhedron known_result(2);
@@ -333,15 +336,14 @@ aux2_test05(const Generator& r1, const Generator& r2, unsigned magic_number) {
   //  Variable A(0);
   //  Variable B(1);
   Variable C(2);
-
-  Linear_Expression expr;
-  expr += Linear_Expression(r1);
-  expr += Linear_Expression(r2);
+  Linear_Expression expr1(r1.expression());
+  Linear_Expression expr2(r2.expression());
+  expr1 += expr2;
   // NOTE: I am not *sure* this dirty kludge of using such
   // a magic number will always succeed.
-  expr *= magic_number + 1;
-  expr -= C;
-  return ray(expr);
+  expr1 *= (magic_number + 1);
+  expr1 -= C;
+  return ray(expr1);
 }
 
 Generator_System
diff --git a/tests/Polyhedron/bhz03widening1.cc b/tests/Polyhedron/bhz03widening1.cc
index 719a48d..d2886a1 100644
--- a/tests/Polyhedron/bhz03widening1.cc
+++ b/tests/Polyhedron/bhz03widening1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::BHZ03_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -91,8 +91,8 @@ aux2_test01(unsigned n) {
   case 1:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 1 << ", "
-	 << "P" << p_base + 3 << " }" << endl;
+         << "P" << p_base + 1 << ", "
+         << "P" << p_base + 3 << " }" << endl;
 
     s.add_disjunct(aux1_test01(p_base + 1));
     s.add_disjunct(aux1_test01(p_base + 3));
@@ -100,8 +100,8 @@ aux2_test01(unsigned n) {
   case 2:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 2 << ", "
-	 << "P" << p_base + 3 << " }" << endl;
+         << "P" << p_base + 2 << ", "
+         << "P" << p_base + 3 << " }" << endl;
 
     s.add_disjunct(aux1_test01(p_base + 2));
     s.add_disjunct(aux1_test01(p_base + 3));
@@ -109,8 +109,8 @@ aux2_test01(unsigned n) {
   case 0:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 2 << ", "
-	 << "P" << p_base + 4 << " }" << endl;
+         << "P" << p_base + 2 << ", "
+         << "P" << p_base + 4 << " }" << endl;
 
     s.add_disjunct(aux1_test01(p_base + 2));
     s.add_disjunct(aux1_test01(p_base + 4));
@@ -321,8 +321,8 @@ aux2_test04(unsigned n) {
   case 1:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 1 << ", "
-	 << "P" << p_base + 3 << " }" << endl;
+         << "P" << p_base + 1 << ", "
+         << "P" << p_base + 3 << " }" << endl;
 
     s.add_disjunct(aux1_test04(p_base + 1));
     s.add_disjunct(aux1_test04(p_base + 3));
@@ -330,8 +330,8 @@ aux2_test04(unsigned n) {
   case 2:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 2 << ", "
-	 << "P" << p_base + 3 << " }" << endl;
+         << "P" << p_base + 2 << ", "
+         << "P" << p_base + 3 << " }" << endl;
 
     s.add_disjunct(aux1_test04(p_base + 2));
     s.add_disjunct(aux1_test04(p_base + 3));
@@ -339,8 +339,8 @@ aux2_test04(unsigned n) {
   case 0:
 
     nout << "S" << n << " = { "
-	 << "P" << p_base + 2 << ", "
-	 << "P" << p_base + 4 << " }" << endl;
+         << "P" << p_base + 2 << ", "
+         << "P" << p_base + 4 << " }" << endl;
 
     s.add_disjunct(aux1_test04(p_base + 2));
     s.add_disjunct(aux1_test04(p_base + 4));
diff --git a/tests/Polyhedron/bounded1.cc b/tests/Polyhedron/bounded1.cc
index 1d2cb04..db12664 100644
--- a/tests/Polyhedron/bounded1.cc
+++ b/tests/Polyhedron/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/boundedaffineimage1.cc b/tests/Polyhedron/boundedaffineimage1.cc
index ffb3a4c..e52ee53 100644
--- a/tests/Polyhedron/boundedaffineimage1.cc
+++ b/tests/Polyhedron/boundedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -52,7 +52,7 @@ test01() {
   bool ok = (ph == kr1);
 
   print_generators(ph,
-		   "*** ph.bounded_affine_image(A, 7-B, B+3) ***");
+                   "*** ph.bounded_affine_image(A, 7-B, B+3) ***");
 
   return ok;
 }
@@ -84,9 +84,9 @@ test02() {
   bool ok = (ph == kr1);
 
   print_generators(ph,
-		   "*** ph.bounded_affine_image(A, 7-3*A+2*B, B+5*A-3) ***");
+                   "*** ph.bounded_affine_image(A, 7-3*A+2*B, B+5*A-3) ***");
   print_generators(kr1,
-		   "*** kr1.bounded_affine_image(A, 7-3*A+2*B, B+5*A-3) ***");
+                   "*** kr1.bounded_affine_image(A, 7-3*A+2*B, B+5*A-3) ***");
 
   return ok;
 }
@@ -140,10 +140,10 @@ test04() {
   bool ok = (kr1 == ph);
 
   print_constraints(ph,
-		    "*** ph.bounded_affine_image("
-		    "x, -2*x+y+1, -2*x+y+1, -1) ***");
+                    "*** ph.bounded_affine_image("
+                    "x, -2*x+y+1, -2*x+y+1, -1) ***");
   print_constraints(kr1,
-		    "*** kr1 ***");
+                    "*** kr1 ***");
 
   return ok;
 }
@@ -174,10 +174,10 @@ test05() {
   bool ok = (kr1 == ph);
 
   print_constraints(ph,
-		    "*** ph.bounded_affine_image("
-		    "x, 2*x+y+1, 2*x+y+1, -1) ***");
+                    "*** ph.bounded_affine_image("
+                    "x, 2*x+y+1, 2*x+y+1, -1) ***");
   print_constraints(kr1,
-		    "*** kr1 ***");
+                    "*** kr1 ***");
 
   return ok;
 }
@@ -208,10 +208,10 @@ test06() {
   bool ok = (kr1 == ph);
 
   print_constraints(ph,
-		    "*** ph.bounded_affine_image("
-		    "x, -2*x+y+1, -2*x+y+1) ***");
+                    "*** ph.bounded_affine_image("
+                    "x, -2*x+y+1, -2*x+y+1) ***");
   print_constraints(kr1,
-		    "*** kr1 ***");
+                    "*** kr1 ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/boundedaffinepreimage1.cc b/tests/Polyhedron/boundedaffinepreimage1.cc
index b5915a0..53be8ee 100644
--- a/tests/Polyhedron/boundedaffinepreimage1.cc
+++ b/tests/Polyhedron/boundedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::bounded_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -88,7 +88,7 @@ test02() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** "
-		   "ph.bounded_affine_preimage(B, 7-3*A+2*B, B+5*A-3) ***");
+                   "ph.bounded_affine_preimage(B, 7-3*A+2*B, B+5*A-3) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/boundedbhrz03extrapolation1.cc b/tests/Polyhedron/boundedbhrz03extrapolation1.cc
index 9d4e205..8250529 100644
--- a/tests/Polyhedron/boundedbhrz03extrapolation1.cc
+++ b/tests/Polyhedron/boundedbhrz03extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::bounded_BHRZ03_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/boundedh79extrapolation1.cc b/tests/Polyhedron/boundedh79extrapolation1.cc
index bb8025a..ce27ef8 100644
--- a/tests/Polyhedron/boundedh79extrapolation1.cc
+++ b/tests/Polyhedron/boundedh79extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::bounded_H79_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -62,8 +62,8 @@ test01() {
   bool ok = (ph2 == known_result);
 
   print_constraints(ph2,
-		    "*** after ph2.bounded_H79_extrapolation_assign(ph1, cs) "
-		    "***");
+                    "*** after ph2.bounded_H79_extrapolation_assign(ph1, cs) "
+                    "***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/bounds1.cc b/tests/Polyhedron/bounds1.cc
index b4122b6..9ee3b59 100644
--- a/tests/Polyhedron/bounds1.cc
+++ b/tests/Polyhedron/bounds1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::bounds_from_below() and Polyhedron::bounds_from_above().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/cnncconversion1.cc b/tests/Polyhedron/cnncconversion1.cc
index f0e9741..092a48f 100644
--- a/tests/Polyhedron/cnncconversion1.cc
+++ b/tests/Polyhedron/cnncconversion1.cc
@@ -1,6 +1,6 @@
 /* Test conversions between C_Polyhedron and NNC_Polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/concatenate1.cc b/tests/Polyhedron/concatenate1.cc
index 8854d9a..a222d52 100644
--- a/tests/Polyhedron/concatenate1.cc
+++ b/tests/Polyhedron/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::concatenate_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/congruences1.cc b/tests/Polyhedron/congruences1.cc
index 4189a0a..da0af52 100644
--- a/tests/Polyhedron/congruences1.cc
+++ b/tests/Polyhedron/congruences1.cc
@@ -1,6 +1,6 @@
 /* Test C_Polyhedron(Congruence_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/constrains1.cc b/tests/Polyhedron/constrains1.cc
index 03e3534..8fb2a87 100644
--- a/tests/Polyhedron/constrains1.cc
+++ b/tests/Polyhedron/constrains1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::constrains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,16 +23,16 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
 
-#define TEST_PREDICATE_TRUE(pred)		\
-  if (!pred) {					\
-    nout << "!" #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_TRUE(pred)               \
+  if (!pred) {                                  \
+    nout << "!" #pred << endl;                  \
+    ok = false;                                 \
   }
 
-#define TEST_PREDICATE_FALSE(pred)		\
-  if (pred) {					\
-    nout << #pred << endl;			\
-    ok = false;					\
+#define TEST_PREDICATE_FALSE(pred)              \
+  if (pred) {                                   \
+    nout << #pred << endl;                      \
+    ok = false;                                 \
   }
 
 namespace {
diff --git a/tests/Polyhedron/constraints1.cc b/tests/Polyhedron/constraints1.cc
index 85d86f9..39f9827 100644
--- a/tests/Polyhedron/constraints1.cc
+++ b/tests/Polyhedron/constraints1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/contains1.cc b/tests/Polyhedron/contains1.cc
index deb572f..212f846 100644
--- a/tests/Polyhedron/contains1.cc
+++ b/tests/Polyhedron/contains1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::contains(const Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/contains2.cc b/tests/Polyhedron/contains2.cc
index 7a222cc..69fa50a 100644
--- a/tests/Polyhedron/contains2.cc
+++ b/tests/Polyhedron/contains2.cc
@@ -1,6 +1,6 @@
 /* Test NNC_Polyhedron::contains(const Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/containsintegerpoint1.cc b/tests/Polyhedron/containsintegerpoint1.cc
index 1c63fbf..0c31432 100644
--- a/tests/Polyhedron/containsintegerpoint1.cc
+++ b/tests/Polyhedron/containsintegerpoint1.cc
@@ -1,6 +1,6 @@
 /* Test C_Polyhedron::contains_integer_point().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/disjoint1.cc b/tests/Polyhedron/disjoint1.cc
index bba2243..39ec4ad 100644
--- a/tests/Polyhedron/disjoint1.cc
+++ b/tests/Polyhedron/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::is_disjoint_from(const Polyhedron& y).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -52,7 +52,7 @@ C_Polyhedron
 half_strip(const Generator& p, const Linear_Expression& e) {
   assert(p.is_point());
 
-  Linear_Expression e1(p);
+  Linear_Expression e1(p.expression());
   e1 += 3*Variable(0);
 
   Generator_System gs;
diff --git a/tests/Polyhedron/disjoint2.cc b/tests/Polyhedron/disjoint2.cc
index a8d1225..54d1646 100644
--- a/tests/Polyhedron/disjoint2.cc
+++ b/tests/Polyhedron/disjoint2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::is_disjoint_from(const Polyhedron& y).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,11 +27,11 @@ namespace {
 
 NNC_Polyhedron
 half_strip(const Generator& p,
-	   const Linear_Expression& e,
-	   bool closed = true) {
+           const Linear_Expression& e,
+           bool closed = true) {
   assert((p.is_point() && closed) || (p.is_closure_point() && ! closed));
 
-  Linear_Expression e1(p);
+  Linear_Expression e1(p.expression());
   e1 += 3*Variable(0);
 
   Generator_System gs;
diff --git a/tests/Polyhedron/dropsomenonintegerpoints1.cc b/tests/Polyhedron/dropsomenonintegerpoints1.cc
index d6e9071..a1851e9 100644
--- a/tests/Polyhedron/dropsomenonintegerpoints1.cc
+++ b/tests/Polyhedron/dropsomenonintegerpoints1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::drop_some_non_integer_points().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/dropsomenonintegerpoints2.cc b/tests/Polyhedron/dropsomenonintegerpoints2.cc
index 4adcce6..42176d9 100644
--- a/tests/Polyhedron/dropsomenonintegerpoints2.cc
+++ b/tests/Polyhedron/dropsomenonintegerpoints2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::drop_some_non_integer_points().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -150,6 +150,40 @@ test05() {
   return ok;
 }
 
+bool
+test06() {
+  Variable A(0);
+  Variable B(1);
+
+  C_Polyhedron ph(2, EMPTY);
+  ph.add_generator(point(A, 2));
+  ph.add_generator(point(B, 2));
+
+  print_generators(ph, "*** ph ***");
+
+  ph.drop_some_non_integer_points(Variables_Set(B));
+
+  C_Polyhedron known_result1(2, EMPTY);
+  known_result1.add_generator(point(A, 2));
+
+  bool ok = (ph == known_result1);
+
+  print_constraints(ph, "*** after ph.drop_some_non_integer_points({B}) ***");
+
+  if (!ok)
+    return ok;
+
+  ph.drop_some_non_integer_points(Variables_Set(A));
+
+  C_Polyhedron known_result2(2, EMPTY);
+
+  ok = (ph == known_result2);
+
+  print_constraints(ph, "*** after ph.drop_some_non_integer_points({A}) ***");
+
+  return ok;
+}
+
 } // namespace
 
 BEGIN_MAIN
@@ -158,4 +192,5 @@ BEGIN_MAIN
   DO_TEST(test03);
   DO_TEST(test04);
   DO_TEST(test05);
+  DO_TEST(test06);
 END_MAIN
diff --git a/tests/Polyhedron/dualhypercubes.cc b/tests/Polyhedron/dualhypercubes.cc
index f6d3ffa..ea46875 100644
--- a/tests/Polyhedron/dualhypercubes.cc
+++ b/tests/Polyhedron/dualhypercubes.cc
@@ -1,6 +1,6 @@
 /* Exploit smf when computing the intersection of NNC dual hypercubes.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -39,9 +39,9 @@ namespace {
 
 void
 closure_points_dual_hypercube(const dimension_type dims,
-			      const Linear_Expression& weight_center,
-			      const Coefficient& half_diagonal,
-			      Generator_System& gs) {
+                              const Linear_Expression& weight_center,
+                              const Coefficient& half_diagonal,
+                              Generator_System& gs) {
   // An ill-formed (it has no points at all) generator system
   // for a dual hypercube.
   for (dimension_type axis = dims; axis-- > 0; ) {
@@ -52,12 +52,12 @@ closure_points_dual_hypercube(const dimension_type dims,
 
 void
 add_facets(dimension_type& to_be_added,
-	   Generator_System& gs,
-	   const Linear_Expression& expr,
-	   const dimension_type axis,
-	   const dimension_type dims,
-	   const Linear_Expression& weight_center,
-	   const Coefficient& half_diagonal) {
+           Generator_System& gs,
+           const Linear_Expression& expr,
+           const dimension_type axis,
+           const dimension_type dims,
+           const Linear_Expression& weight_center,
+           const Coefficient& half_diagonal) {
   // Return if we have already added all facets.
   if (to_be_added == 0)
     return;
@@ -81,20 +81,20 @@ add_facets(dimension_type& to_be_added,
   // First recursive call with variable with index `axis'
   // having coordinate 1/dims.
   add_facets(to_be_added, gs, expr1,
-	     axis-1, dims, weight_center, half_diagonal);
+             axis-1, dims, weight_center, half_diagonal);
   if (to_be_added == 0)
     return;
   // Second recursive call with variable with index `axis'
   // having coordinate -1/dims.
   add_facets(to_be_added, gs, expr2,
-	     axis-1, dims, weight_center, half_diagonal);
+             axis-1, dims, weight_center, half_diagonal);
 }
 
 NNC_Polyhedron
 NNC_dual_hypercube(const dimension_type dims,
-		   const Linear_Expression& weight_center,
-		   const Coefficient& half_diagonal,
-		   const int facet_percentage) {
+                   const Linear_Expression& weight_center,
+                   const Coefficient& half_diagonal,
+                   const int facet_percentage) {
   Generator_System gs;
   closure_points_dual_hypercube(dims, weight_center, half_diagonal, gs);
   // Number of facets in the closed dual hypercube.
@@ -107,15 +107,15 @@ NNC_dual_hypercube(const dimension_type dims,
     gs.insert(point(weight_center));
   else
     add_facets(facets_to_be_added, gs, Linear_Expression(0),
-	       dims-1, dims, weight_center, half_diagonal);
+               dims-1, dims, weight_center, half_diagonal);
   // Actually build the polyhedron.
   return NNC_Polyhedron(gs);
 }
 
 void
 build_polyhedra(const dimension_type dims,
-		const int percentage,
-		std::vector<NNC_Polyhedron>& ph) {
+                const int percentage,
+                std::vector<NNC_Polyhedron>& ph) {
 
   Linear_Expression weight_center;
 
@@ -346,10 +346,10 @@ test01() {
     for (int percentage = 25; percentage <= 50; percentage += 25) {
 
       nout << endl
-	   << "++++++++ DIMENSIONS = " << dims << "  ++++++++"
-	   << endl
-	   << "++++++++ PERCENTAGE = " << percentage << " ++++++++"
-	   << endl;
+           << "++++++++ DIMENSIONS = " << dims << "  ++++++++"
+           << endl
+           << "++++++++ PERCENTAGE = " << percentage << " ++++++++"
+           << endl;
 
       // Standard evaluation strategy.
       ph.clear();
@@ -359,11 +359,11 @@ test01() {
       // Check if there is a known result.
       known_result = standard_cardinalities.find(make_pair(dims, percentage));
       if (known_result != standard_cardinalities.end()
-	  && known_result->second != standard_eval_card) {
-	++num_errors;
-	nout << "Cardinality mismatch: "
-	     << "expected " << known_result->second << ", "
-	     << "obtained " << standard_eval_card << ".\n";
+          && known_result->second != standard_eval_card) {
+        ++num_errors;
+        nout << "Cardinality mismatch: "
+             << "expected " << known_result->second << ", "
+             << "obtained " << standard_eval_card << ".\n";
       }
 
       // Enhanced evaluation strategy.
@@ -374,11 +374,11 @@ test01() {
       // Check if there is a known result.
       known_result = enhanced_cardinalities.find(make_pair(dims, percentage));
       if (known_result != enhanced_cardinalities.end()
-	  && known_result->second != enhanced_eval_card) {
-	++num_errors;
-	nout << "Cardinality mismatch: "
-	     << "expected " << known_result->second << ", "
-	     << "obtained " << enhanced_eval_card <<".\n";
+          && known_result->second != enhanced_eval_card) {
+        ++num_errors;
+        nout << "Cardinality mismatch: "
+             << "expected " << known_result->second << ", "
+             << "obtained " << enhanced_eval_card <<".\n";
       }
 
     }
diff --git a/tests/Polyhedron/empty1.cc b/tests/Polyhedron/empty1.cc
index 8960bf5..3f9cf06 100644
--- a/tests/Polyhedron/empty1.cc
+++ b/tests/Polyhedron/empty1.cc
@@ -1,6 +1,6 @@
 /* Different ways of creating an empty polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/equals1.cc b/tests/Polyhedron/equals1.cc
index 146bb64..1998212 100644
--- a/tests/Polyhedron/equals1.cc
+++ b/tests/Polyhedron/equals1.cc
@@ -1,6 +1,6 @@
 /* Test operator==(const Polyhedron&, const Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/exceptions1.cc b/tests/Polyhedron/exceptions1.cc
index 261c321..ec8dba0 100644
--- a/tests/Polyhedron/exceptions1.cc
+++ b/tests/Polyhedron/exceptions1.cc
@@ -1,6 +1,6 @@
 /* Test that the right exceptions are thrown in case of incorrect uses.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/exceptions2.cc b/tests/Polyhedron/exceptions2.cc
index 278976b..70381b3 100644
--- a/tests/Polyhedron/exceptions2.cc
+++ b/tests/Polyhedron/exceptions2.cc
@@ -1,6 +1,6 @@
 /* Test that the right exceptions are thrown in case of incorrect uses.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/exceptions3.cc b/tests/Polyhedron/exceptions3.cc
index 5a47a38..8967dc4 100644
--- a/tests/Polyhedron/exceptions3.cc
+++ b/tests/Polyhedron/exceptions3.cc
@@ -1,6 +1,6 @@
 /* Test that the right exceptions are thrown in case of incorrect uses.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -206,7 +206,7 @@ test09() {
     // vector space will have a dimension greater than
     // C_Polyhedron::max_space_dimension().
     ph.expand_space_dimension(Variable(0),
-			      C_Polyhedron::max_space_dimension());
+                              C_Polyhedron::max_space_dimension());
 
     // It is an error if the exception is not thrown.
   }
diff --git a/tests/Polyhedron/expandspacedim1.cc b/tests/Polyhedron/expandspacedim1.cc
index cdcc4a3..5a890f5 100644
--- a/tests/Polyhedron/expandspacedim1.cc
+++ b/tests/Polyhedron/expandspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::expand_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -215,8 +215,8 @@ test07() {
   bool ok = (ph1 == known_result);
 
   print_constraints(ph1,
-		    "*** after ph1.expand_space_dimension(A, 1);"
-		    " ph1.expand_space_dimension(C, 1) ***");
+                    "*** after ph1.expand_space_dimension(A, 1);"
+                    " ph1.expand_space_dimension(C, 1) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/expandspacedim2.cc b/tests/Polyhedron/expandspacedim2.cc
index e6a6395..d9dee50 100644
--- a/tests/Polyhedron/expandspacedim2.cc
+++ b/tests/Polyhedron/expandspacedim2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::expand_space_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/foldspacedims1.cc b/tests/Polyhedron/foldspacedims1.cc
index a5f6a04..48db5a3 100644
--- a/tests/Polyhedron/foldspacedims1.cc
+++ b/tests/Polyhedron/foldspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::fold_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/foldspacedims2.cc b/tests/Polyhedron/foldspacedims2.cc
index 6fd5dd5..7580197 100644
--- a/tests/Polyhedron/foldspacedims2.cc
+++ b/tests/Polyhedron/foldspacedims2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::fold_space_dimensions() for non-closed polyhedra.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/frequency1.cc b/tests/Polyhedron/frequency1.cc
index 935d923..1e068ca 100644
--- a/tests/Polyhedron/frequency1.cc
+++ b/tests/Polyhedron/frequency1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::frequency().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/frombdshape1.cc b/tests/Polyhedron/frombdshape1.cc
index 52264ba..df03661 100644
--- a/tests/Polyhedron/frombdshape1.cc
+++ b/tests/Polyhedron/frombdshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/frombox1.cc b/tests/Polyhedron/frombox1.cc
index 39c8922..0a44c5f 100644
--- a/tests/Polyhedron/frombox1.cc
+++ b/tests/Polyhedron/frombox1.cc
@@ -1,7 +1,7 @@
 /* Test C_Polyhedron::C_Polyhedron(const Box<Interval>&)
    and NNC_Polyhedron::NNC_Polyhedron(const Box<Interval>&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/frombox2.cc b/tests/Polyhedron/frombox2.cc
index 3671a9d..2c2c1d7 100644
--- a/tests/Polyhedron/frombox2.cc
+++ b/tests/Polyhedron/frombox2.cc
@@ -1,6 +1,6 @@
 /* Test NNC_Polyhedron::NNC_Polyhedron(const Box<Interval>&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/fromgrid1.cc b/tests/Polyhedron/fromgrid1.cc
index bb3daa8..1c997cc 100644
--- a/tests/Polyhedron/fromgrid1.cc
+++ b/tests/Polyhedron/fromgrid1.cc
@@ -1,7 +1,7 @@
 /* Test C_Polyhedron::C_Polyhedron(const Grid&)
    and NNC_Polyhedron::NNC_Polyhedron(const Grid&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/fromoctagonalshape1.cc b/tests/Polyhedron/fromoctagonalshape1.cc
index 063e50f..10ffbac 100644
--- a/tests/Polyhedron/fromoctagonalshape1.cc
+++ b/tests/Polyhedron/fromoctagonalshape1.cc
@@ -1,6 +1,6 @@
 /* Test BD_Shape::BD_Shape(const C_Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/generalizedaffineimage1.cc b/tests/Polyhedron/generalizedaffineimage1.cc
index cb84724..90db9cd 100644
--- a/tests/Polyhedron/generalizedaffineimage1.cc
+++ b/tests/Polyhedron/generalizedaffineimage1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -48,8 +48,8 @@ test01() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, GREATER_OR_EQUAL, A+2)"
-		   " ***");
+                   "ph.generalized_affine_image(B, GREATER_OR_EQUAL, A+2)"
+                   " ***");
 
   return ok;
 }
@@ -77,8 +77,8 @@ test02() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, GREATER_OR_EQUAL,"
-		   " A+2, -2) ***");
+                   "ph.generalized_affine_image(B, GREATER_OR_EQUAL,"
+                   " A+2, -2) ***");
 
   return ok;
 }
@@ -106,8 +106,8 @@ test03() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, LESS_OR_EQUAL,"
-		   " A-B+2, -3) ***");
+                   "ph.generalized_affine_image(B, LESS_OR_EQUAL,"
+                   " A-B+2, -3) ***");
 
   return ok;
 }
@@ -132,8 +132,8 @@ test04() {
   bool ok = (ph == known_result);
 
   print_generators(ph,
-		   "*** after ph.generalized_affine_image"
-		   "(A, EQUAL, A + 2) ***");
+                   "*** after ph.generalized_affine_image"
+                   "(A, EQUAL, A + 2) ***");
 
   return ok;
 }
@@ -159,8 +159,8 @@ test05() {
   bool ok = (ph == known_result);
 
   print_generators(ph,
-		   "*** after ph.generalized_affine_image"
-		   "(A + B, GREATER_OR_EQUAL, 2*A - B + 2) ***");
+                   "*** after ph.generalized_affine_image"
+                   "(A + B, GREATER_OR_EQUAL, 2*A - B + 2) ***");
 
   return ok;
 }
@@ -181,7 +181,7 @@ test06() {
   bool ok = (ph1 == known_result);
 
   print_constraints(ph1, "*** after ph1.generalized_affine_image"
-		    "(A, LESS_OR_EQUAL, B + 1) ***");
+                    "(A, LESS_OR_EQUAL, B + 1) ***");
 
   return ok;
 }
@@ -202,7 +202,7 @@ test07() {
   bool ok = (ph1 == known_result);
 
   print_constraints(ph1, "*** after ph1.generalized_affine_image"
-		    "(A + B, GREATER_OR_EQUAL, A + B + 1) ***");
+                    "(A + B, GREATER_OR_EQUAL, A + B + 1) ***");
 
   return ok;
 }
@@ -224,8 +224,8 @@ test08() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(A, GREATER_OR_EQUAL, A+2)"
-		   " ***");
+                   "ph.generalized_affine_image(A, GREATER_OR_EQUAL, A+2)"
+                   " ***");
 
   return ok;
 }
@@ -247,9 +247,9 @@ test09() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image"
+                   "ph.generalized_affine_image"
                    "(A+1, GREATER_OR_EQUAL, A+2)"
-		   " ***");
+                   " ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/generalizedaffineimage2.cc b/tests/Polyhedron/generalizedaffineimage2.cc
index 1f04d5f..c31a2a6 100644
--- a/tests/Polyhedron/generalizedaffineimage2.cc
+++ b/tests/Polyhedron/generalizedaffineimage2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::generalized_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -50,7 +50,7 @@ test01() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, LESS_THAN, B+2) ***");
+                   "ph.generalized_affine_image(B, LESS_THAN, B+2) ***");
 
   return ok;
 }
@@ -76,8 +76,8 @@ test02() {
   bool ok = (ph == ph2);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, GREATER_OR_EQUAL,"
-		   " A+2) ***");
+                   "ph.generalized_affine_image(B, GREATER_OR_EQUAL,"
+                   " A+2) ***");
 
   return ok;
 }
@@ -103,8 +103,8 @@ test03() {
   bool ok = (ph == ph2);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, GREATER_OR_EQUAL,"
-		   " A+2, -2) ***");
+                   "ph.generalized_affine_image(B, GREATER_OR_EQUAL,"
+                   " A+2, -2) ***");
 
   return ok;
 }
@@ -130,8 +130,8 @@ test04() {
   bool ok = (ph == ph2);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, LESS_OR_EQUAL,"
-		   " A-B+2, -3) ***");
+                   "ph.generalized_affine_image(B, LESS_OR_EQUAL,"
+                   " A-B+2, -3) ***");
 
   return ok;
 }
@@ -157,7 +157,7 @@ test05() {
   bool ok = (ph == ph2);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_image(B, LESS_THAN, B+2) ***");
+                   "ph.generalized_affine_image(B, LESS_THAN, B+2) ***");
 
   return ok;
 }
@@ -181,8 +181,8 @@ test06() {
   bool ok = (ph == ph2);
 
   print_generators(ph,
-		   "*** after ph.generalized_affine_image"
-		   "(A, EQUAL, A + 2) ***");
+                   "*** after ph.generalized_affine_image"
+                   "(A, EQUAL, A + 2) ***");
 
   return ok;
 }
@@ -204,14 +204,14 @@ test07() {
 
   ph.generalized_affine_image(A + B, GREATER_OR_EQUAL, 2*A - B + 2);
   ph2.generalized_affine_image(-3*(A + B),
-			       LESS_OR_EQUAL,
-			       -3*(2*A - B + 2));
+                               LESS_OR_EQUAL,
+                               -3*(2*A - B + 2));
 
   bool ok = (ph == ph2);
 
   print_generators(ph,
-		   "*** after ph.generalized_affine_image"
-		   "(A + B, GREATER_OR_EQUAL, 2*A - B + 2) ***");
+                   "*** after ph.generalized_affine_image"
+                   "(A + B, GREATER_OR_EQUAL, 2*A - B + 2) ***");
 
   return ok;
 }
@@ -238,9 +238,9 @@ test08() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(B, GREATER_THAN, A + B + 1) ***");
+                    "(B, GREATER_THAN, A + B + 1) ***");
   print_generators(ph, "*** after ph.generalized_affine_image"
-		   "(B, GREATER_THAN, A + B + 1) ***");
+                   "(B, GREATER_THAN, A + B + 1) ***");
 
   return ok;
 }
@@ -265,7 +265,7 @@ test09() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(Linear_Expression(2), EQUAL, A + B) ***");
+                    "(Linear_Expression(2), EQUAL, A + B) ***");
 
   return ok;
 }
@@ -284,16 +284,16 @@ test10() {
   print_constraints(ph, "*** ph ***");
 
   ph.generalized_affine_image(Linear_Expression(2),
-			      GREATER_OR_EQUAL,
-			      A + B);
+                              GREATER_OR_EQUAL,
+                              A + B);
 
   known_result.add_constraint(2 >= A + B);
 
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(Linear_Expression(2), GREATER_OR_EQUAL, A + B)"
-		    "***");
+                    "(Linear_Expression(2), GREATER_OR_EQUAL, A + B)"
+                    "***");
   return ok;
 }
 
@@ -317,7 +317,7 @@ test11() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(Linear_Expression(2), LESS_OR_EQUAL, A + B) ***");
+                    "(Linear_Expression(2), LESS_OR_EQUAL, A + B) ***");
 
   return ok;
 }
@@ -342,7 +342,7 @@ test12() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(Linear_Expression(2), GREATER_THAN, A + B) ***");
+                    "(Linear_Expression(2), GREATER_THAN, A + B) ***");
 
   return ok;
 }
@@ -367,7 +367,7 @@ test13() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(Linear_Expression(2), LESS_THAN, A + B) ***");
+                    "(Linear_Expression(2), LESS_THAN, A + B) ***");
 
   return ok;
 }
@@ -393,9 +393,9 @@ test14() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** after ph.generalized_affine_image"
-		    "(A - C, EQUAL, B + 3) ***");
+                    "(A - C, EQUAL, B + 3) ***");
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - C, EQUAL, B + 3) ***");
+                    "(A - C, EQUAL, B + 3) ***");
 
   return ok;
 }
@@ -421,9 +421,9 @@ test15() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - C, GREATER_OR_EQUAL, B + 3) ***");
+                    "(A - C, GREATER_OR_EQUAL, B + 3) ***");
   print_generators(ph, "*** after ph.generalized_affine_image"
-		    "(A - C, GREATER_OR_EQUAL, B + 3) ***");
+                    "(A - C, GREATER_OR_EQUAL, B + 3) ***");
 
   return ok;
 }
@@ -448,9 +448,9 @@ test16() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - C, LESS_OR_EQUAL, B - 1) ***");
+                    "(A - C, LESS_OR_EQUAL, B - 1) ***");
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - C, LESS_OR_EQUAL, B - 1) ***");
+                    "(A - C, LESS_OR_EQUAL, B - 1) ***");
 
   return ok;
 }
@@ -475,9 +475,9 @@ test17() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - 2*C, LESS_THAN, B - 1) ***");
+                    "(A - 2*C, LESS_THAN, B - 1) ***");
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - 2*C, LESS_THAN, B - 1) ***");
+                    "(A - 2*C, LESS_THAN, B - 1) ***");
 
   return ok;
 }
@@ -502,9 +502,9 @@ test18() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - 2*C + 3, GREATER_THAN, B - 1) ***");
+                    "(A - 2*C + 3, GREATER_THAN, B - 1) ***");
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A - 2*C + 3, GREATER_THAN, B - 1) ***");
+                    "(A - 2*C + 3, GREATER_THAN, B - 1) ***");
 
   return ok;
 }
@@ -530,7 +530,7 @@ test19() {
   bool ok = (ph == known_result);
 
   print_constraints(ph, "*** after ph.generalized_affine_image"
-		    "(A + B, LESS_THAN, 2*A - 3*B) ***");
+                    "(A + B, LESS_THAN, 2*A - 3*B) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/generalizedaffinepreimage1.cc b/tests/Polyhedron/generalizedaffinepreimage1.cc
index 744b336..527a2bb 100644
--- a/tests/Polyhedron/generalizedaffinepreimage1.cc
+++ b/tests/Polyhedron/generalizedaffinepreimage1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -47,8 +47,8 @@ test01() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_preimage"
-		   "(B, GREATER_OR_EQUAL, A+2) ***");
+                   "ph.generalized_affine_preimage"
+                   "(B, GREATER_OR_EQUAL, A+2) ***");
 
   return ok;
 }
@@ -76,7 +76,7 @@ test02() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_preimage"
+                   "ph.generalized_affine_preimage"
                    "(B, GREATER_OR_EQUAL, A+2, -2) ***");
 
   return ok;
@@ -109,8 +109,8 @@ test03() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_preimage"
-		   "(B, LESS_OR_EQUAL, A-B+2, -3) ***");
+                   "ph.generalized_affine_preimage"
+                   "(B, LESS_OR_EQUAL, A-B+2, -3) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/generalizedaffinepreimage2.cc b/tests/Polyhedron/generalizedaffinepreimage2.cc
index e136e76..c4a12c9 100644
--- a/tests/Polyhedron/generalizedaffinepreimage2.cc
+++ b/tests/Polyhedron/generalizedaffinepreimage2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::generalized_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -52,7 +52,7 @@ test01() {
   bool ok = (ph == known_result);
 
   print_generators(ph, "*** ph after "
-		   "ph.generalized_affine_preimage(B, LESS_THAN, B+2) ***");
+                   "ph.generalized_affine_preimage(B, LESS_THAN, B+2) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/generators1.cc b/tests/Polyhedron/generators1.cc
index 8848f09..b03ac65 100644
--- a/tests/Polyhedron/generators1.cc
+++ b/tests/Polyhedron/generators1.cc
@@ -1,6 +1,6 @@
 /* Test the construction of a polyhedron using generators.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -69,8 +69,8 @@ test02() {
   C_Polyhedron ph(gs);
 
   bool ok = (gs.space_dimension() == known_result.space_dimension()
-	     && gs.begin() == gs.end()
-	     && ph == known_result);
+             && gs.begin() == gs.end()
+             && ph == known_result);
 
   print_generators(ph, "*** ph ***");
 
@@ -101,8 +101,8 @@ test03() {
   known_result2.insert(point());
 
   bool ok = (gs1.begin() == gs1.end()
-	     && C_Polyhedron(gs2) == C_Polyhedron(known_result2)
-	     && gs3.begin() == gs3.end());
+             && C_Polyhedron(gs2) == C_Polyhedron(known_result2)
+             && gs3.begin() == gs3.end());
 
   print_generators(gs1, "*** gs1 ***");
   print_generators(gs2, "*** gs2 ***");
diff --git a/tests/Polyhedron/geomcovers1.cc b/tests/Polyhedron/geomcovers1.cc
index e06aa05..3d55be0 100644
--- a/tests/Polyhedron/geomcovers1.cc
+++ b/tests/Polyhedron/geomcovers1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::geometrically_covers().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/h79widening1.cc b/tests/Polyhedron/h79widening1.cc
index ad44d9e..900d63e 100644
--- a/tests/Polyhedron/h79widening1.cc
+++ b/tests/Polyhedron/h79widening1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::H79_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/h79widening2.cc b/tests/Polyhedron/h79widening2.cc
index 0e97e13..3e667fc 100644
--- a/tests/Polyhedron/h79widening2.cc
+++ b/tests/Polyhedron/h79widening2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::H79_widening_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/hybrid.cc b/tests/Polyhedron/hybrid.cc
index 3dc0011..33e0cac 100644
--- a/tests/Polyhedron/hybrid.cc
+++ b/tests/Polyhedron/hybrid.cc
@@ -1,7 +1,7 @@
 /* Test three examples for linear hybrid systems.  These are based on
    the examples in HalbwachsPR94 and HalbwachsPR97 papers.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -475,8 +475,8 @@ test03() {
     ph_t2.H79_widening_assign(ph_t2_prev);
 
     if (ph_idle == ph_idle_prev
-	&& ph_t1 == ph_t1_prev
-	&& ph_t2 == ph_t2_prev) {
+        && ph_t1 == ph_t1_prev
+        && ph_t2 == ph_t2_prev) {
 
       NNC_Polyhedron known_result_idle(6);
       known_result_idle.add_constraint(c2 >= 0);
@@ -775,8 +775,8 @@ test04() {
     // The simpler test disjunct_covers() which is sufficient here
     // should be more efficient than geometrically_covers().
     if (disjunct_covers(ph_idle_prev, ph_idle)
- 	 && disjunct_covers(ph_t1_prev, ph_t1)
-  	 && disjunct_covers(ph_t2_prev, ph_t2)) {
+         && disjunct_covers(ph_t1_prev, ph_t1)
+         && disjunct_covers(ph_t2_prev, ph_t2)) {
 
       //  if (ph_idle_prev.geometrically_covers(ph_idle)
       //       && ph_t1_prev.geometrically_covers(ph_t1)
diff --git a/tests/Polyhedron/intersection1.cc b/tests/Polyhedron/intersection1.cc
index 26ba39d..cc8b8a1 100644
--- a/tests/Polyhedron/intersection1.cc
+++ b/tests/Polyhedron/intersection1.cc
@@ -1,6 +1,6 @@
 /* Testing Polyhedron::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -119,12 +119,12 @@ test02() {
     int num_points_below;
   } ph_nv[]
       = { {-1*(pyramid_height/4), 5, 0},
-	  { 0*(pyramid_height/4), 5, 4},
-	  { 1*(pyramid_height/4), 5, 8},
-	  { 2*(pyramid_height/4), 5, 8},
-	  { 3*(pyramid_height/4), 5, 8},
-	  { 4*(pyramid_height/4), 1, 5},
-	  { 5*(pyramid_height/4), 0, 5}
+          { 0*(pyramid_height/4), 5, 4},
+          { 1*(pyramid_height/4), 5, 8},
+          { 2*(pyramid_height/4), 5, 8},
+          { 3*(pyramid_height/4), 5, 8},
+          { 4*(pyramid_height/4), 1, 5},
+          { 5*(pyramid_height/4), 0, 5}
       };
 
   Generator_System gs;
@@ -149,7 +149,7 @@ test02() {
     computed_result.intersection_assign(hyper_space_above);
 
     if (ok
-	&& aux_test02(computed_result) != ph_nv[i].num_points_above)
+        && aux_test02(computed_result) != ph_nv[i].num_points_above)
       ok = false;
 
     print_constraints(hyper_space_above, "*** hyper_space_above ***");
@@ -163,7 +163,7 @@ test02() {
     computed_result.intersection_assign(hyper_space_below);
 
     if (ok
-	&& aux_test02(computed_result) != ph_nv[i].num_points_below)
+        && aux_test02(computed_result) != ph_nv[i].num_points_below)
       ok = false;
 
     print_constraints(hyper_space_below, "*** hyper_space_below ***");
@@ -232,7 +232,7 @@ test04() {
   C_Polyhedron known_result(2, EMPTY);
 
   bool ok = (computed_result1 == known_result
-	     && computed_result2 == known_result);
+             && computed_result2 == known_result);
 
   print_constraints(computed_result1, "*** after intersection_assign ***");
   print_constraints(computed_result2, "*** after intersection_assign ***");
@@ -308,9 +308,9 @@ test06() {
 
 bool
 aux_test07(C_Polyhedron& ph1,
-	   const C_Polyhedron& ph2,
-	   // Note intentional call-by-value!
-	   C_Polyhedron known_result) {
+           const C_Polyhedron& ph2,
+           // Note intentional call-by-value!
+           C_Polyhedron known_result) {
 
   print_constraints(ph1, "*** ph1 ***");
   print_constraints(ph2, "*** ph2 ***");
diff --git a/tests/Polyhedron/limitedbhrz03extrapolation1.cc b/tests/Polyhedron/limitedbhrz03extrapolation1.cc
index ae75aea..83e86bf 100644
--- a/tests/Polyhedron/limitedbhrz03extrapolation1.cc
+++ b/tests/Polyhedron/limitedbhrz03extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::limited_BHRZ03_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/limitedh79extrapolation1.cc b/tests/Polyhedron/limitedh79extrapolation1.cc
index 628978d..44b2b98 100644
--- a/tests/Polyhedron/limitedh79extrapolation1.cc
+++ b/tests/Polyhedron/limitedh79extrapolation1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::limited_H79_extrapolation_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -67,7 +67,7 @@ test01() {
   known_result.add_constraint(x <= 5);
 
   print_constraints(computed_result,
-		    "*** after limited_H79_extrapolation_assign ***");
+                    "*** after limited_H79_extrapolation_assign ***");
 
   return computed_result == known_result;
 }
@@ -109,7 +109,7 @@ test02() {
   known_result.add_generator(point(5*x + 5*y));
 
   print_constraints(computed_result,
-		    "*** after limited_H79_extrapolation_assign ***");
+                    "*** after limited_H79_extrapolation_assign ***");
 
   return computed_result == known_result;
 }
@@ -142,7 +142,7 @@ test03() {
   C_Polyhedron known_result(cs);
 
   print_constraints(computed_result,
-		    "*** after limited_H79_extrapolation_assign ***");
+                    "*** after limited_H79_extrapolation_assign ***");
 
   return computed_result == known_result;
 }
@@ -173,8 +173,8 @@ test04() {
   bool ok = (ph2 == known_result);
 
   print_constraints(ph2,
-		    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
-		    " ***");
+                    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
+                    " ***");
   return ok;
 }
 
@@ -200,8 +200,8 @@ test05() {
   bool ok = (ph2 == known_result);
 
   print_constraints(ph2,
-		    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
-		    " ***");
+                    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
+                    " ***");
   return ok;
 }
 
@@ -225,8 +225,8 @@ test06() {
   bool ok = (ph2 == known_result);
 
   print_constraints(ph2,
-		    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
-		    " ***");
+                    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
+                    " ***");
   return ok;
 }
 
@@ -256,8 +256,8 @@ test07() {
   bool ok = (ph2 == known_result);
 
   print_constraints(ph2,
-		    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
-		    " ***");
+                    "*** after ph2.limited_H79_extrapolation_assign(ph1, cs)"
+                    " ***");
   return ok;
 }
 
diff --git a/tests/Polyhedron/linearexpression1.cc b/tests/Polyhedron/linearexpression1.cc
index a87c807..a934216 100644
--- a/tests/Polyhedron/linearexpression1.cc
+++ b/tests/Polyhedron/linearexpression1.cc
@@ -1,6 +1,6 @@
 /* Testing Linear_Expression.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/linearpartition1.cc b/tests/Polyhedron/linearpartition1.cc
index 71aad94..98b5e4d 100644
--- a/tests/Polyhedron/linearpartition1.cc
+++ b/tests/Polyhedron/linearpartition1.cc
@@ -1,6 +1,6 @@
 /* Test linear_partition().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,9 +27,9 @@ namespace {
 
 bool
 aux_test01(const C_Polyhedron& p,
-	   const C_Polyhedron& q,
-	   const std::pair<C_Polyhedron,
-	   Pointset_Powerset<NNC_Polyhedron> >& partition) {
+           const C_Polyhedron& q,
+           const std::pair<C_Polyhedron,
+           Pointset_Powerset<NNC_Polyhedron> >& partition) {
   const C_Polyhedron& r = partition.first;
   // `r' must be a subset of or equal to `q'.
   if (!q.contains(r))
@@ -50,7 +50,7 @@ aux_test01(const C_Polyhedron& p,
       const NNC_Polyhedron& b = j->pointset();
       // All elements of `s' must be pairwise disjoint.
       if (!a.is_disjoint_from(b))
-	return false;
+        return false;
     }
     the_union.upper_bound_assign(a);
   }
@@ -100,9 +100,9 @@ test01() {
 
 bool
 aux_test02(const C_Polyhedron& p,
-	   const C_Polyhedron& q,
-	   const std::pair<C_Polyhedron,
-	   Pointset_Powerset<NNC_Polyhedron> >& partition) {
+           const C_Polyhedron& q,
+           const std::pair<C_Polyhedron,
+           Pointset_Powerset<NNC_Polyhedron> >& partition) {
   const C_Polyhedron& r = partition.first;
   // `r' must be a subset of or equal to `q'.
   if (!q.contains(r))
@@ -123,7 +123,7 @@ aux_test02(const C_Polyhedron& p,
       const NNC_Polyhedron& b = j->pointset();
       // All elements of `s' must be pairwise disjoint.
       if (!a.is_disjoint_from(b))
-	return false;
+        return false;
     }
     the_union.upper_bound_assign(a);
   }
@@ -173,9 +173,9 @@ test02() {
 
 bool
 aux_test03(const C_Polyhedron& p,
-	   const C_Polyhedron& q,
-	   const std::pair<C_Polyhedron,
-	   Pointset_Powerset<NNC_Polyhedron> >& partition) {
+           const C_Polyhedron& q,
+           const std::pair<C_Polyhedron,
+           Pointset_Powerset<NNC_Polyhedron> >& partition) {
   const C_Polyhedron& r = partition.first;
   // `r' must be a subset of or equal to `q'.
   if (!q.contains(r))
@@ -196,7 +196,7 @@ aux_test03(const C_Polyhedron& p,
       const NNC_Polyhedron& b = j->pointset();
       // All elements of `s' must be pairwise disjoint.
       if (!a.is_disjoint_from(b))
-	return false;
+        return false;
     }
     the_union.upper_bound_assign(a);
   }
diff --git a/tests/Polyhedron/linearsystem1.cc b/tests/Polyhedron/linearsystem1.cc
index 49aa01c..6e1ca90 100644
--- a/tests/Polyhedron/linearsystem1.cc
+++ b/tests/Polyhedron/linearsystem1.cc
@@ -1,6 +1,6 @@
 /* Test some functionality of class Linear_System.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -57,16 +57,16 @@ test01() {
       // The following workaround is to avoid trivial positive overflows
       // when using bounded coefficients.
       if (std::numeric_limits<Coefficient>::is_bounded
-	  && c == std::numeric_limits<Coefficient>::min())
-	// Here the randomly generated coefficients is equal to the
-	// allowed minimum value for a signed integer data type that
-	// might adopt the 2's complement representation
-	// (e.g., -128 for 8 bit signed integers).
-	// Thus, it would cause a positive overflow during the normalization
-	// of the Linear_Row, because the GCD computation will try to negate
-	// such a coefficient.
-	// To avoid the problem, we simply increment the coefficient.
-	++c;
+          && c == std::numeric_limits<Coefficient>::min())
+        // Here the randomly generated coefficients is equal to the
+        // allowed minimum value for a signed integer data type that
+        // might adopt the 2's complement representation
+        // (e.g., -128 for 8 bit signed integers).
+        // Thus, it would cause a positive overflow during the normalization
+        // of the Linear_Row, because the GCD computation will try to negate
+        // such a coefficient.
+        // To avoid the problem, we simply increment the coefficient.
+        ++c;
       
       if (col == 0)
         e += c;
@@ -92,7 +92,7 @@ test01() {
       continue;
 
     nout << "Linear_System<Constraint>::ascii_dump/load test failed." << endl
-	 << "m1.ascii_dump() gives" << endl;
+         << "m1.ascii_dump() gives" << endl;
     ls1.ascii_dump(nout);
     nout << "m2.ascii_dump() gives" << endl;
     ls2.ascii_dump(nout);
diff --git a/tests/Polyhedron/mapspacedims1.cc b/tests/Polyhedron/mapspacedims1.cc
index 2b101f0..4d9ddea 100644
--- a/tests/Polyhedron/mapspacedims1.cc
+++ b/tests/Polyhedron/mapspacedims1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::map_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/matrix1.cc b/tests/Polyhedron/matrix1.cc
index 730c779..823bf59 100644
--- a/tests/Polyhedron/matrix1.cc
+++ b/tests/Polyhedron/matrix1.cc
@@ -1,6 +1,6 @@
 /* Test some functionality of class Matrix.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -41,8 +41,8 @@ test01() {
     for (dimension_type num_cols = 0; num_cols <= 3; ++num_cols) {
       Matrix<Dense_Row> m1(num_rows, num_cols);
       for (dimension_type row = 0; row < num_rows; ++row)
-	for (dimension_type col = 0; col < num_cols; ++col)
-	  r.get(m1[row][col], 0);
+        for (dimension_type col = 0; col < num_cols; ++col)
+          r.get(m1[row][col], 0);
 
       std::fstream f;
       open(f, data_file, std::ios_base::out);
@@ -56,13 +56,13 @@ test01() {
 
       if (m1 != m2) {
 
-	nout << "Matrix<Dense_Row>::ascii_dump/load test failed." << endl
-	     << "m1.ascii_dump() gives" << endl;
-	m1.ascii_dump(nout);
-	nout << "m2.ascii_dump() gives" << endl;
-	m2.ascii_dump(nout);
+        nout << "Matrix<Dense_Row>::ascii_dump/load test failed." << endl
+             << "m1.ascii_dump() gives" << endl;
+        m1.ascii_dump(nout);
+        nout << "m2.ascii_dump() gives" << endl;
+        m2.ascii_dump(nout);
 
-	return false;
+        return false;
       }
     }
   return true;
diff --git a/tests/Polyhedron/max_min1.cc b/tests/Polyhedron/max_min1.cc
index 64e5008..572d3ce 100644
--- a/tests/Polyhedron/max_min1.cc
+++ b/tests/Polyhedron/max_min1.cc
@@ -1,7 +1,7 @@
 /* Test Polyhedron::maximize(const Linear_Expression&, ...)
    and Polyhedron::minimize(const Linear_Expression&, ...).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/maxspacedim1.cc b/tests/Polyhedron/maxspacedim1.cc
index 646a51c..3842a8b 100644
--- a/tests/Polyhedron/maxspacedim1.cc
+++ b/tests/Polyhedron/maxspacedim1.cc
@@ -1,6 +1,6 @@
 /* Test the *::max_space_dimension() methods.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -23,10 +23,10 @@ site: http://bugseng.com/products/ppl/ . */
 
 #include "ppl_test.hh"
 
-#define test01_DO_CLASS(T)				\
-  nout << #T "::max_space_dimension() = "		\
-    << T::max_space_dimension() << endl;		\
-  if (T::max_space_dimension() < max_space_dimension())	\
+#define test01_DO_CLASS(T)                              \
+  nout << #T "::max_space_dimension() = "               \
+    << T::max_space_dimension() << endl;                \
+  if (T::max_space_dimension() < max_space_dimension()) \
     return false
 
 #if PPL_SUPPORTED_FLOAT
@@ -45,21 +45,21 @@ site: http://bugseng.com/products/ppl/ . */
 #define test01_DO_WRD_LONG_DOUBLE(WRD)
 #endif
 
-#define test01_DO_WRD(WRD)			\
-  test01_DO_CLASS(WRD<int8_t>);			\
-  test01_DO_CLASS(WRD<int16_t>);		\
-  test01_DO_CLASS(WRD<int32_t>);		\
-  test01_DO_CLASS(WRD<int64_t>);		\
-  test01_DO_CLASS(WRD<mpz_class>);		\
-  test01_DO_CLASS(WRD<mpq_class>);		\
+#define test01_DO_WRD(WRD)                      \
+  test01_DO_CLASS(WRD<int8_t>);                 \
+  test01_DO_CLASS(WRD<int16_t>);                \
+  test01_DO_CLASS(WRD<int32_t>);                \
+  test01_DO_CLASS(WRD<int64_t>);                \
+  test01_DO_CLASS(WRD<mpz_class>);              \
+  test01_DO_CLASS(WRD<mpq_class>);              \
   test01_DO_WRD_FLOAT(WRD);                     \
   test01_DO_WRD_DOUBLE(WRD);                    \
   test01_DO_WRD_LONG_DOUBLE(WRD)
 
-#define test01_DO_CONSTR_CLASS(CONSTR, T)				\
-  nout << #CONSTR "<" #T ">::max_space_dimension() = "			\
-       << CONSTR<T>::max_space_dimension() << endl;			\
-  if (CONSTR<T>::max_space_dimension() < max_space_dimension())		\
+#define test01_DO_CONSTR_CLASS(CONSTR, T)                               \
+  nout << #CONSTR "<" #T ">::max_space_dimension() = "                  \
+       << CONSTR<T>::max_space_dimension() << endl;                     \
+  if (CONSTR<T>::max_space_dimension() < max_space_dimension())         \
     return false
 
 #if PPL_SUPPORTED_FLOAT
@@ -81,13 +81,13 @@ site: http://bugseng.com/products/ppl/ . */
 #define test01_DO_CONSTR_WRD_LONG_DOUBLE(CONSTR, WRD)
 #endif
 
-#define test01_DO_CONSTR_WRD(CONSTR, WRD)			\
-  test01_DO_CONSTR_CLASS(CONSTR, WRD<int8_t>);			\
-  test01_DO_CONSTR_CLASS(CONSTR, WRD<int16_t>);			\
-  test01_DO_CONSTR_CLASS(CONSTR, WRD<int32_t>);			\
-  test01_DO_CONSTR_CLASS(CONSTR, WRD<int64_t>);			\
-  test01_DO_CONSTR_CLASS(CONSTR, WRD<mpz_class>);		\
-  test01_DO_CONSTR_CLASS(CONSTR, WRD<mpq_class>);		\
+#define test01_DO_CONSTR_WRD(CONSTR, WRD)                       \
+  test01_DO_CONSTR_CLASS(CONSTR, WRD<int8_t>);                  \
+  test01_DO_CONSTR_CLASS(CONSTR, WRD<int16_t>);                 \
+  test01_DO_CONSTR_CLASS(CONSTR, WRD<int32_t>);                 \
+  test01_DO_CONSTR_CLASS(CONSTR, WRD<int64_t>);                 \
+  test01_DO_CONSTR_CLASS(CONSTR, WRD<mpz_class>);               \
+  test01_DO_CONSTR_CLASS(CONSTR, WRD<mpq_class>);               \
   test01_DO_CONSTR_WRD_FLOAT(CONSTR, WRD);                      \
   test01_DO_CONSTR_WRD_DOUBLE(CONSTR, WRD);                     \
   test01_DO_CONSTR_WRD_LONG_DOUBLE(CONSTR, WRD)
diff --git a/tests/Polyhedron/mc91.cc b/tests/Polyhedron/mc91.cc
index d5b5974..ecb7e95 100644
--- a/tests/Polyhedron/mc91.cc
+++ b/tests/Polyhedron/mc91.cc
@@ -1,6 +1,6 @@
 /* Test the Pointset_Powerset construction with McCarthy's 91 function.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/membytes1.cc b/tests/Polyhedron/membytes1.cc
index 32494a2..5cdcd7b 100644
--- a/tests/Polyhedron/membytes1.cc
+++ b/tests/Polyhedron/membytes1.cc
@@ -1,6 +1,6 @@
 /* Test the total_memory_in_bytes() and external_memory_in_bytes() methods.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -182,7 +182,7 @@ test01() {
   C_Polyhedron qh(3, EMPTY);
   unsigned n = 0;
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i) {
+         gs_end = gs.end(); i != gs_end; ++i) {
     add_generator(qh, *i);
     if (++n % 4 == 0)
       minimize(qh);
@@ -197,7 +197,7 @@ test01() {
 
   memory_size_type cs_elements_size = 0;
   for (Constraint_System::const_iterator i = cs.begin(),
-	 cs_end = cs.end(); i != cs_end; ++i)
+         cs_end = cs.end(); i != cs_end; ++i)
     cs_elements_size += i->total_memory_in_bytes();
 
   nout << "Sum of sizes of contained constraints = " << cs_elements_size
@@ -210,7 +210,7 @@ test01() {
 
   memory_size_type gs_elements_size = 0;
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     gs_elements_size += i->total_memory_in_bytes();
 
   nout << "Sum of sizes of contained generators = " << gs_elements_size
diff --git a/tests/Polyhedron/memory1.cc b/tests/Polyhedron/memory1.cc
index fadae8d..c8f1e72 100644
--- a/tests/Polyhedron/memory1.cc
+++ b/tests/Polyhedron/memory1.cc
@@ -1,6 +1,6 @@
 /* Test the allocation error recovery facility of the library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -83,16 +83,16 @@ compute_open_hypercube_generators(dimension_type dimension) {
 }
 
 #define LIMIT(WHAT) \
-  do {									\
-    if (getrlimit(WHAT, &t) != 0) {					\
-      std::cerr << "getrlimit failed: " << strerror(errno) << endl;	\
-      exit(1);								\
-    }									\
-    t.rlim_cur = bytes;							\
-    if (setrlimit(WHAT, &t) != 0) {					\
-      std::cerr << "setrlimit failed: " << strerror(errno) << endl;	\
-      exit(1);								\
-    }									\
+  do {                                                                  \
+    if (getrlimit(WHAT, &t) != 0) {                                     \
+      std::cerr << "getrlimit failed: " << strerror(errno) << endl;     \
+      exit(1);                                                          \
+    }                                                                   \
+    t.rlim_cur = bytes;                                                 \
+    if (setrlimit(WHAT, &t) != 0) {                                     \
+      std::cerr << "setrlimit failed: " << strerror(errno) << endl;     \
+      exit(1);                                                          \
+    }                                                                   \
   } while (0)
 
 void
@@ -118,7 +118,7 @@ limit_memory(unsigned long bytes) {
 
 bool
 guarded_compute_open_hypercube_generators(dimension_type dimension,
-					  unsigned long max_memory_in_bytes) {
+                                          unsigned long max_memory_in_bytes) {
   try {
     limit_memory(max_memory_in_bytes);
     compute_open_hypercube_generators(dimension);
diff --git a/tests/Polyhedron/memory2.cc b/tests/Polyhedron/memory2.cc
index 6c1ccdb..fcd2c84 100644
--- a/tests/Polyhedron/memory2.cc
+++ b/tests/Polyhedron/memory2.cc
@@ -1,6 +1,6 @@
 /* Test the allocation error recovery facility of the library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -49,7 +49,7 @@ unsigned long realloc_threshold = 0;
 
 void
 reset_allocators(unsigned long new_malloc_threshold,
-		 unsigned long new_realloc_threshold) {
+                 unsigned long new_realloc_threshold) {
   mallocated = reallocated = freed = 0;
   malloc_threshold = new_malloc_threshold;
   realloc_threshold = new_realloc_threshold;
@@ -59,13 +59,13 @@ void
 fail_if_leaked() {
   if (mallocated != freed) {
     nout << "Memory leak: allocated " << mallocated
-	 << ", freed " << freed
-	 << endl;
+         << ", freed " << freed
+         << endl;
     exit(1);
   }
   else {
     nout << "allocated = freed = " << mallocated
-	 << endl;
+         << endl;
   }
 }
 
@@ -187,7 +187,7 @@ test_every_allocation(const dimension_type d, const Threshold threshold) {
       C_Polyhedron ph(d);
       ph.add_constraint(Variable(0) == ULONG_MAX);
       for (dimension_type i = 1; i < d; ++i)
-	ph.add_constraint(Variable(i) == ULONG_MAX*Variable(i-1));
+        ph.add_constraint(Variable(i) == ULONG_MAX*Variable(i-1));
 
       (void) ph.minimized_generators();
     }
@@ -224,11 +224,11 @@ test3() {
 
 } // namespace
 
-#define IGNORE_OVERFLOWS(fun)			\
-  try {						\
-    fun;					\
-  }						\
-  catch (const std::overflow_error&) {		\
+#define IGNORE_OVERFLOWS(fun)                   \
+  try {                                         \
+    fun;                                        \
+  }                                             \
+  catch (const std::overflow_error&) {          \
   }
 
 extern "C" void
diff --git a/tests/Polyhedron/minconstraints1.cc b/tests/Polyhedron/minconstraints1.cc
index 7f8092f..ad02887 100644
--- a/tests/Polyhedron/minconstraints1.cc
+++ b/tests/Polyhedron/minconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::minimized_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/minconstraints2.cc b/tests/Polyhedron/minconstraints2.cc
index 552dd02..fecb201 100644
--- a/tests/Polyhedron/minconstraints2.cc
+++ b/tests/Polyhedron/minconstraints2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::minimized_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -37,7 +37,7 @@ test01() {
   const Constraint_System& min_cs = ph2.minimized_constraints();
 
   bool ok = (ph1 == ph2
-	     && min_cs.begin() == min_cs.end());
+             && min_cs.begin() == min_cs.end());
 
   print_constraints(ph1, "*** ph1 ***");
   print_constraints(cs, "*** cs ***");
diff --git a/tests/Polyhedron/mingenerators1.cc b/tests/Polyhedron/mingenerators1.cc
index c1e316a..ad6ebb8 100644
--- a/tests/Polyhedron/mingenerators1.cc
+++ b/tests/Polyhedron/mingenerators1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::minimized_generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/mingenerators2.cc b/tests/Polyhedron/mingenerators2.cc
index c86ec5c..8dbb799 100644
--- a/tests/Polyhedron/mingenerators2.cc
+++ b/tests/Polyhedron/mingenerators2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::minimized_generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/nncminimize1.cc b/tests/Polyhedron/nncminimize1.cc
index a988454..6b8da8c 100644
--- a/tests/Polyhedron/nncminimize1.cc
+++ b/tests/Polyhedron/nncminimize1.cc
@@ -1,6 +1,6 @@
 /* Test minimization of NNC polyhedra.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -265,9 +265,9 @@ test04() {
   print_generators(ph.generators(), "*** ph generators ***");
 
   print_constraints(known_result.constraints(),
-		    "*** known_result constraints ***");
+                    "*** known_result constraints ***");
   print_generators(known_result.generators(),
-		   "*** known_result generators ***");
+                   "*** known_result generators ***");
   return ok && ok1;
 }
 
@@ -301,7 +301,7 @@ test05() {
 
   const Constraint_System& ph1_min_cs = ph1.minimized_constraints();
   const int num_minimized_constraints = std::distance(ph1_min_cs.begin(),
-						      ph1_min_cs.end());
+                                                      ph1_min_cs.end());
 
   print_constraints(ph1, "*** after ph1.minimized_constraints() ***");
   nout << "num_constraints = " << num_constraints << endl;
@@ -310,7 +310,7 @@ test05() {
 
   int num_points = 0;
   for (Generator_System::const_iterator i = copy_ph1.generators().begin(),
-	 gs_end = copy_ph1.generators().end(); i != gs_end; ++i)
+         gs_end = copy_ph1.generators().end(); i != gs_end; ++i)
     if ((*i).is_point() || (*i).is_closure_point())
       ++num_points;
 
@@ -318,15 +318,15 @@ test05() {
 
   int num_minimized_points = 0;
   for (Generator_System::const_iterator i = copy_ph1.generators().begin(),
-	 gs_end = copy_ph1.generators().end(); i != gs_end; ++i)
+         gs_end = copy_ph1.generators().end(); i != gs_end; ++i)
     if ((*i).is_point() || (*i).is_closure_point())
       ++num_minimized_points;
 
   bool ok = (num_constraints == num_minimized_constraints + 1
-	     && num_points == num_minimized_points + 1);
+             && num_points == num_minimized_points + 1);
 
   print_generators(copy_ph1,
-		   "*** after copy_ph1_minimized_generators() ***");
+                   "*** after copy_ph1_minimized_generators() ***");
   nout << "num_points = " << num_points << endl;
   nout << "num_minimized_points = "
        << num_minimized_points << endl;
diff --git a/tests/Polyhedron/nncminimize2.cc b/tests/Polyhedron/nncminimize2.cc
index acffd11..e6cd0bc 100644
--- a/tests/Polyhedron/nncminimize2.cc
+++ b/tests/Polyhedron/nncminimize2.cc
@@ -1,6 +1,6 @@
 /* Test NNC_Polyhedron::ph.minimized_generators().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/numberinput1.cc b/tests/Polyhedron/numberinput1.cc
index 086c822..890e322 100644
--- a/tests/Polyhedron/numberinput1.cc
+++ b/tests/Polyhedron/numberinput1.cc
@@ -1,6 +1,6 @@
 /* Test number input.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -56,9 +56,9 @@ Test_Extended_Number_Policy::handle_result(Result r) {
 
 bool
 aux_test(std::string input_string,
-	 std::string expected_output,
-	 std::string expected_residual,
-	 Result expected_result) {
+         std::string expected_output,
+         std::string expected_residual,
+         Result expected_result) {
   std::stringstream input_stream(input_string);
   Checked_Number<mpq_class, Test_Extended_Number_Policy> value;
   Result result = input(value, input_stream, ROUND_UP);
@@ -72,8 +72,8 @@ aux_test(std::string input_string,
   std::string output = output_stream.str();
 
   bool ok = (result == expected_result
-	     && residual == expected_residual
-	     && output == expected_output);
+             && residual == expected_residual
+             && output == expected_output);
 
   nout << "input = \"" << input_string << "\""
        << endl
@@ -124,12 +124,12 @@ test03() {
     && aux_test("15", "15", "", V_EQ)
     && aux_test("34976098", "34976098", "", V_EQ)
     && aux_test("34976098349760983497609834976098",
-		"34976098349760983497609834976098", "", V_EQ)
+                "34976098349760983497609834976098", "", V_EQ)
     && aux_test("3/-inf", "nan", "", V_CVT_STR_UNK)
     && aux_test("+77", "77", "", V_EQ)
     && aux_test("-77", "-77", "", V_EQ)
     && aux_test("-7777777777777777777777777",
-		"-7777777777777777777777777", "", V_EQ)
+                "-7777777777777777777777777", "", V_EQ)
     && aux_test("-77 ", "-77", " ", V_EQ)
     && aux_test("-77   ", "-77", "   ", V_EQ)
     && aux_test("-77ab", "-77", "ab", V_EQ)
@@ -143,8 +143,8 @@ test04() {
   return aux_test("71.3", "713/10", "", V_EQ)
     && aux_test("0.123456", "1929/15625", "", V_EQ)
     && aux_test("12345678910111213141516.12345678910111213141516",
-		"308641972752780328537903086419727527803285379/25000000000000000000000",
-		"", V_EQ)
+                "308641972752780328537903086419727527803285379/25000000000000000000000",
+                "", V_EQ)
     && aux_test("0.123456 101", "1929/15625", " 101", V_EQ)
     && aux_test("0.123456   101", "1929/15625", "   101", V_EQ)
     && aux_test("0.123456     ", "1929/15625", "     ", V_EQ)
@@ -162,8 +162,8 @@ test05() {
     && aux_test("15*^8", "1500000000", "", V_EQ)
     && aux_test("1*^009", "1000000000", "", V_EQ)
     && aux_test("15*^111",
-		"15000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-		"", V_EQ)
+                "15000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+                "", V_EQ)
     && aux_test("151515e+1", "1515150", "", V_EQ)
     && aux_test("151515151515151515e+1", "1515151515151515150", "", V_EQ)
     && aux_test("9200e-2", "92", "", V_EQ)
@@ -231,14 +231,14 @@ test08() {
     // Fraction and exponent.
     && aux_test("0x0.1*^3", "256", "", V_EQ)
     && aux_test("-0x29382a093589c501594f729e672567.2f09f342582b4598*^-2",
-		"-493504168323155221903720496056512238754896365637429427/590295810358705651712",
-		"", V_EQ)
+                "-493504168323155221903720496056512238754896365637429427/590295810358705651712",
+                "", V_EQ)
     && aux_test("-0x29382a093589c501594f729e672567.2f09f342582b4598*^-20",
-		"-493504168323155221903720496056512238754896365637429427/2787593149816327892691964784081045188247552",
-		"", V_EQ)
+                "-493504168323155221903720496056512238754896365637429427/2787593149816327892691964784081045188247552",
+                "", V_EQ)
     && aux_test("-0x29382a093589c501594f729e672567.2f09f342582b4598*^-20b",
-		"-493504168323155221903720496056512238754896365637429427/2787593149816327892691964784081045188247552",
-		"b", V_EQ)
+                "-493504168323155221903720496056512238754896365637429427/2787593149816327892691964784081045188247552",
+                "b", V_EQ)
     && aux_test("0x0.1*^3   -0", "256", "   -0", V_EQ);
 }
 
@@ -319,7 +319,7 @@ test13() {
     // Hexadecimal.
     aux_test("0xf/0x3", "5", "", V_EQ)
     && aux_test("3048227.23429e3/0x230abc43",
-		"304822723429/58790611500", "", V_EQ)
+                "304822723429/58790611500", "", V_EQ)
     && aux_test("0xf/0x3g", "5", "g", V_EQ)
     // Base.
     && aux_test("16^^f/4^^3.0e0*^3", "5", "*^3", V_EQ);
diff --git a/tests/Polyhedron/onepoint.cc b/tests/Polyhedron/onepoint.cc
index b233df1..3494347 100644
--- a/tests/Polyhedron/onepoint.cc
+++ b/tests/Polyhedron/onepoint.cc
@@ -1,6 +1,6 @@
 /* Creation of a one-point polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/permute.cc b/tests/Polyhedron/permute.cc
index 255076a..b460bcc 100644
--- a/tests/Polyhedron/permute.cc
+++ b/tests/Polyhedron/permute.cc
@@ -1,6 +1,6 @@
 /* An example of iteration to a post-fixpoint.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -27,8 +27,8 @@ namespace {
 
 void
 shift_rename_add(const C_Polyhedron& p,
-		 dimension_type offset,
-		 C_Polyhedron& q) {
+                 dimension_type offset,
+                 C_Polyhedron& q) {
   C_Polyhedron r(offset);
   r.concatenate_assign(p);
   q.intersection_assign(r);
diff --git a/tests/Polyhedron/polydifference1.cc b/tests/Polyhedron/polydifference1.cc
index 0ea6ec2..f58ebdc 100644
--- a/tests/Polyhedron/polydifference1.cc
+++ b/tests/Polyhedron/polydifference1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::difference_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/polydifference2.cc b/tests/Polyhedron/polydifference2.cc
index 55d38aa..663d002 100644
--- a/tests/Polyhedron/polydifference2.cc
+++ b/tests/Polyhedron/polydifference2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::difference_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/polyhull1.cc b/tests/Polyhedron/polyhull1.cc
index be2c71e..0a62855 100644
--- a/tests/Polyhedron/polyhull1.cc
+++ b/tests/Polyhedron/polyhull1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::upper_bound_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -89,7 +89,7 @@ test02() {
   bool ok = (computed_result1 == known_result);
 
   print_generators(computed_result1,
-		   "*** after upper_bound_assign ***");
+                   "*** after upper_bound_assign ***");
 
   return ok;
 }
@@ -131,8 +131,8 @@ test03() {
 
 bool
 aux_test04(C_Polyhedron& ph1, const C_Polyhedron& ph2,
-	   // Note intentional call-by-value!
-	   C_Polyhedron known_result) {
+           // Note intentional call-by-value!
+           C_Polyhedron known_result) {
   print_constraints(ph1, "*** ph1 ***");
   print_constraints(ph2, "*** ph2 ***");
 
@@ -190,7 +190,7 @@ test05() {
   bool ok = (ph1 == known_result);
 
   print_generators(ph1,
-		   "*** after ph1.upper_bound_assign(ph2) ***");
+                   "*** after ph1.upper_bound_assign(ph2) ***");
 
   return ok;
 }
@@ -210,7 +210,7 @@ test06() {
   bool ok = (ph1 == known_result);
 
   print_generators(ph1,
-		   "*** after ph1.upper_bound_assign(ph2) ***");
+                   "*** after ph1.upper_bound_assign(ph2) ***");
 
   return ok;
 }
@@ -246,7 +246,7 @@ test07() {
   bool ok = (ph1 == known_result);
 
   print_generators(ph1,
-		   "*** after ph1.upper_bound_assign(ph2) ***");
+                   "*** after ph1.upper_bound_assign(ph2) ***");
 
   return ok;
 }
@@ -318,7 +318,7 @@ test10() {
 
   print_generators(ph1, "*** after upper_bound_assign ***");
   print_generators(copy_ph1,
-		    "*** after upper_bound_assign ***");
+                    "*** after upper_bound_assign ***");
 
   return ok;
 }
@@ -352,7 +352,7 @@ test11() {
 
   print_generators(ph1, "*** after upper_bound_assign ***");
   print_generators(copy_ph1,
-		    "*** after upper_bound_assign ***");
+                    "*** after upper_bound_assign ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/polyhull2.cc b/tests/Polyhedron/polyhull2.cc
index 3b2f681..75fed42 100644
--- a/tests/Polyhedron/polyhull2.cc
+++ b/tests/Polyhedron/polyhull2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::upper_bound_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/polyhullifexact1.cc b/tests/Polyhedron/polyhullifexact1.cc
index 12bcb2b..8d6064f 100644
--- a/tests/Polyhedron/polyhullifexact1.cc
+++ b/tests/Polyhedron/polyhullifexact1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -364,10 +364,10 @@ test10() {
   cs.insert(X02 - Coefficient("3152519739159347")*X14 >= 0);
   cs.insert(X06 + X07 + X08 + X09 - X14 - X15 == 0);
   cs.insert(Coefficient("2386907802506363")*X06
-	    + Coefficient("2386907802506363")*X07
-	    + Coefficient("1080863910568919")*X08
-	    + Coefficient("7746191359077253")*X09
-	    - X16 == 0);
+            + Coefficient("2386907802506363")*X07
+            + Coefficient("1080863910568919")*X08
+            + Coefficient("7746191359077253")*X09
+            - X16 == 0);
   cs.insert(-X06 + X10 >= -80);
   cs.insert(-X07 + X11 >= 0);
   cs.insert(-X08 + X12 >= 0);
@@ -377,30 +377,30 @@ test10() {
   cs.insert(-X22 >= -500);
   cs.insert(X23 - Coefficient("3152519739159347")*X36 >= 0);
   cs.insert(Coefficient("7746191359077253")*X28
-	    + Coefficient("7746191359077253")*X29
-	    + Coefficient("3512807709348987")*X30
-	    + Coefficient("3332663724254167")*X31
-	    - X38 == 0);
+            + Coefficient("7746191359077253")*X29
+            + Coefficient("3512807709348987")*X30
+            + Coefficient("3332663724254167")*X31
+            - X38 == 0);
   cs.insert(X28 + X29 + X30 + X31 - X36 + X37 + X39 == 44);
   cs.insert(-X28 + X32 >= -500);
   cs.insert(-X29 + X33 >= 0);
   cs.insert(-X30 + X34 >= 0);
   cs.insert(-X31 + X35 >= 0);
   cs.insert(Coefficient("-2661627379775963")*X10
-	    - Coefficient("2686397177726501")*X11
-	    - Coefficient("5422333951354077")*X12
-	    - Coefficient("5469621747441467")*X13
-	    + X25
-	    - Coefficient("2466846695892189")*X32
-	    - Coefficient("4996743786567565")*X33
-	    - Coefficient("5064297780978123")*X34
-	    - Coefficient("641481471923585")*X35 >= 0);
+            - Coefficient("2686397177726501")*X11
+            - Coefficient("5422333951354077")*X12
+            - Coefficient("5469621747441467")*X13
+            + X25
+            - Coefficient("2466846695892189")*X32
+            - Coefficient("4996743786567565")*X33
+            - Coefficient("5064297780978123")*X34
+            - Coefficient("641481471923585")*X35 >= 0);
   cs.insert(X03 - Coefficient("7854277750134145")*X22 >= 0);
   cs.insert(X15
-	    - Coefficient("7854277750134145")*X28
-	    - Coefficient("7782220156096217")*X29
-	    - Coefficient("7782220156096217")*X30
-	    - Coefficient("7710162562058289")*X31 >= 0);
+            - Coefficient("7854277750134145")*X28
+            - Coefficient("7782220156096217")*X29
+            - Coefficient("7782220156096217")*X30
+            - Coefficient("7710162562058289")*X31 >= 0);
   cs.insert(Coefficient("-5422333951354077")*X01 + X24 >= 0);
   cs.insert(X21 >= 2);
   cs.insert(-X16 - X38 >= -300);
diff --git a/tests/Polyhedron/polyhullifexact2.cc b/tests/Polyhedron/polyhullifexact2.cc
index 4c56434..d3d124b 100644
--- a/tests/Polyhedron/polyhullifexact2.cc
+++ b/tests/Polyhedron/polyhullifexact2.cc
@@ -1,6 +1,6 @@
 /* Test NNC_Polyhedron::upper_bound_assign_if_exact().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/randphull1.cc b/tests/Polyhedron/randphull1.cc
index eb43cdd..554c64a 100644
--- a/tests/Polyhedron/randphull1.cc
+++ b/tests/Polyhedron/randphull1.cc
@@ -1,6 +1,6 @@
 /* Compute poly-hulls of random polytopes.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -38,7 +38,7 @@ count_points(const C_Polyhedron& ph) {
   int count = 0;
   const Generator_System& gs = ph.minimized_generators();
   for (Generator_System::const_iterator i = gs.begin(),
-	 gs_end = gs.end(); i != gs_end; ++i)
+         gs_end = gs.end(); i != gs_end; ++i)
     if (i->type() == Generator::POINT)
       ++count;
   return count;
@@ -95,8 +95,8 @@ namespace test02_namespace {
 
 void
 point_on_the_unit_n_sphere(unsigned n,
-			   const std::vector<float>& theta,
-			   std::vector<float>& coordinate) {
+                           const std::vector<float>& theta,
+                           std::vector<float>& coordinate) {
   assert(n >= 2);
 
   if (n == 2) {
@@ -114,9 +114,9 @@ point_on_the_unit_n_sphere(unsigned n,
 
 void
 random_polytope(C_Polyhedron& ph,
-		unsigned dimension,
-		unsigned num_points,
-		float radius = 1.0) {
+                unsigned dimension,
+                unsigned num_points,
+                float radius = 1.0) {
   assert(dimension >= 2);
 
   // This setting and resetting of the rounding mode was prompted by
@@ -172,23 +172,23 @@ test02() {
     const Constraint_System& cs = ph.minimized_constraints();
     unsigned num_constraints = 0;
     for (Constraint_System::const_iterator i = cs.begin(),
-	   cs_end = cs.end(); i != cs_end; ++i)
+           cs_end = cs.end(); i != cs_end; ++i)
       ++num_constraints;
     // Count the number of generators.
     const Generator_System& gs = ph.minimized_generators();
     unsigned num_points = 0;
     for (Generator_System::const_iterator i = gs.begin(),
-	   gs_end = gs.end(); i != gs_end; ++i)
+           gs_end = gs.end(); i != gs_end; ++i)
       if (i->type() == Generator::POINT)
-	++num_points;
+        ++num_points;
       else {
-	using namespace Parma_Polyhedra_Library::IO_Operators;
-	nout << "i->type() == " << i->type() << endl;
-	return false;
+        using namespace Parma_Polyhedra_Library::IO_Operators;
+        nout << "i->type() == " << i->type() << endl;
+        return false;
       }
     nout << "dimension = " << dimension
-	 << ", points = " << num_points << " (" << dimension*dimension << ")"
-	 << ", constraints = " << num_constraints << endl;
+         << ", points = " << num_points << " (" << dimension*dimension << ")"
+         << ", constraints = " << num_constraints << endl;
   }
   return true;
 }
diff --git a/tests/Polyhedron/refinewithcongruence1.cc b/tests/Polyhedron/refinewithcongruence1.cc
index 91cb8eb..7fa0ea7 100644
--- a/tests/Polyhedron/refinewithcongruence1.cc
+++ b/tests/Polyhedron/refinewithcongruence1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::refine_with_congruence().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -93,7 +93,7 @@ test03() {
   bool ok = (ph == known_result);
 
   print_constraints(ph,
-		    "*** after ph.refine_with_congruence(B >= 1) ***");
+                    "*** after ph.refine_with_congruence(B >= 1) ***");
   return ok;
 }
 
diff --git a/tests/Polyhedron/refinewithcongruences1.cc b/tests/Polyhedron/refinewithcongruences1.cc
index 68905e9..fcb6925 100644
--- a/tests/Polyhedron/refinewithcongruences1.cc
+++ b/tests/Polyhedron/refinewithcongruences1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::refine_with_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -89,7 +89,7 @@ test03() {
   bool ok = (computed_result == ph);
 
   print_constraints(computed_result,
-		    "*** after refine_with_congruences ***");
+                    "*** after refine_with_congruences ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/refinewithconstraint1.cc b/tests/Polyhedron/refinewithconstraint1.cc
index ba7a42b..95ce198 100644
--- a/tests/Polyhedron/refinewithconstraint1.cc
+++ b/tests/Polyhedron/refinewithconstraint1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::refine_with_constraint().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -39,7 +39,7 @@ test01() {
 
   C_Polyhedron ph2(2);
   for (Constraint_System::const_iterator i = ph1.constraints().begin(),
-	 cs_end = ph1.constraints().end(); i != cs_end; ++i)
+         cs_end = ph1.constraints().end(); i != cs_end; ++i)
     ph2.refine_with_constraint(*i);
 
   C_Polyhedron known_result(2);
@@ -96,7 +96,7 @@ test03() {
   bool ok = (ph == known_result);
 
   print_constraints(ph,
-		    "*** after ph.refine_with_constraint(B >= 1) ***");
+                    "*** after ph.refine_with_constraint(B >= 1) ***");
   return ok;
 }
 
diff --git a/tests/Polyhedron/refinewithconstraints1.cc b/tests/Polyhedron/refinewithconstraints1.cc
index 879b4b3..cca5c02 100644
--- a/tests/Polyhedron/refinewithconstraints1.cc
+++ b/tests/Polyhedron/refinewithconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::refine_with_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -95,7 +95,7 @@ test03() {
   bool ok = (computed_result == ph);
 
   print_constraints(computed_result,
-		    "*** after refine_with_constraints ***");
+                    "*** after refine_with_constraints ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/relations1.cc b/tests/Polyhedron/relations1.cc
index 6bc93c2..b733baa 100644
--- a/tests/Polyhedron/relations1.cc
+++ b/tests/Polyhedron/relations1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::relation_with(g) and Polyhedron::relation_with(c).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/relations2.cc b/tests/Polyhedron/relations2.cc
index b3e018f..f1c3cfa 100644
--- a/tests/Polyhedron/relations2.cc
+++ b/tests/Polyhedron/relations2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::relation_with(c) and Polyhedron::relation_with(g).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/relations3.cc b/tests/Polyhedron/relations3.cc
index a1ced07..8cd07a2 100644
--- a/tests/Polyhedron/relations3.cc
+++ b/tests/Polyhedron/relations3.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::relation_with(c) and Polyhedron::relation_with(g).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -124,7 +124,7 @@ test05() {
   NNC_Polyhedron ph(gs);
   Generator_System gs1;
   for (Generator_System::const_iterator i = ph.generators().begin(),
-	 gs_end = ph.generators().end(); i != gs_end; ++i)
+         gs_end = ph.generators().end(); i != gs_end; ++i)
     if (!(*i).is_closure_point())
       gs.insert(*i);
   C_Polyhedron ph1(gs);
@@ -154,7 +154,7 @@ test06() {
   ph1.add_constraint(B == 1);
   Generator_System gs1;
   for (Generator_System::const_iterator i = ph.generators().begin(),
-	 gs_end = ph.generators().end(); i != gs_end; ++i)
+         gs_end = ph.generators().end(); i != gs_end; ++i)
     if (!(*i).is_closure_point())
       gs1.insert(*i);
   ph1.add_generators(gs1);
diff --git a/tests/Polyhedron/removespacedims1.cc b/tests/Polyhedron/removespacedims1.cc
index 4e07eac..cc6c264 100644
--- a/tests/Polyhedron/removespacedims1.cc
+++ b/tests/Polyhedron/removespacedims1.cc
@@ -1,6 +1,6 @@
 /* Removing space dimensions from a polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -233,7 +233,7 @@ test07() {
   bool ok = (ph == known_result);
 
   print_constraints(ph,
-		    "*** after ph.remove_space_dimensions(to_be_removed) ***");
+                    "*** after ph.remove_space_dimensions(to_be_removed) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/removespacedims2.cc b/tests/Polyhedron/removespacedims2.cc
index cd38d81..fea8601 100644
--- a/tests/Polyhedron/removespacedims2.cc
+++ b/tests/Polyhedron/removespacedims2.cc
@@ -1,6 +1,6 @@
 /* Removing space dimensions form an NNC polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -55,7 +55,7 @@ test01() {
 
   print_constraints(ph1, "*** after remove_higher_space_dimensions(1) ***");
   print_constraints(ph2,
-		    "*** after remove_space_dimensions(to_be_removed) ***");
+                    "*** after remove_space_dimensions(to_be_removed) ***");
 
   return ok;
 }
diff --git a/tests/Polyhedron/simplifyusingcontext1.cc b/tests/Polyhedron/simplifyusingcontext1.cc
index 822f047..f7b0496 100644
--- a/tests/Polyhedron/simplifyusingcontext1.cc
+++ b/tests/Polyhedron/simplifyusingcontext1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::simplify_using_context_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/smm1.cc b/tests/Polyhedron/smm1.cc
index 71bbb19..fa438ed 100644
--- a/tests/Polyhedron/smm1.cc
+++ b/tests/Polyhedron/smm1.cc
@@ -1,6 +1,6 @@
 /* SEND + MORE = MONEY.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -46,18 +46,18 @@ less_than(C_Polyhedron& ph, Variable X, Variable Y) {
 
 void
 constraints(C_Polyhedron& ph,
-	    Variable S,
-	    Variable E,
-	    Variable N,
-	    Variable D,
-	    Variable M,
-	    Variable O,
-	    Variable R,
-	    Variable Y,
-	    int C1,
-	    int C2,
-	    int C3,
-	    int C4) {
+            Variable S,
+            Variable E,
+            Variable N,
+            Variable D,
+            Variable M,
+            Variable O,
+            Variable R,
+            Variable Y,
+            int C1,
+            int C2,
+            int C3,
+            int C4) {
   ph.add_constraint(S >= 0);
   ph.add_constraint(E >= 0);
   ph.add_constraint(N >= 0);
@@ -109,39 +109,39 @@ test01() {
   for (int C1 = 0; C1 <= 1; ++C1)
     for (int C2 = 0; C2 <= 1; ++C2)
       for (int C3 = 0; C3 <= 1; ++C3)
-	for (int C4 = 0; C4 <= 1; ++C4) {
-	  C_Polyhedron ph(8);
-	  test01_namespace::constraints(ph,
-					S, E, N, D, M, O, R, Y,
-					C1, C2, C3, C4);
-	  if (ph.is_empty())
-	    continue;
-
-	  nout << "Solution constraints" << endl;
-	  const Constraint_System& cs = ph.constraints();
-	  std::copy(cs.begin(), cs.end(),
-		    std::ostream_iterator<Constraint>(nout, "\n"));
-	  nout << "Solution generators" << endl;
-	  const Generator_System& gs = ph.generators();
-	  std::copy(gs.begin(), gs.end(),
-		    std::ostream_iterator<Generator>(nout, "\n"));
-	  if (solution_found)
-	    return true;
-	  solution_found = true;
-
-	  C_Polyhedron expected(8);
-	  expected.add_constraint(S == 9);
-	  expected.add_constraint(E == 5);
-	  expected.add_constraint(N == 6);
-	  expected.add_constraint(D == 7);
-	  expected.add_constraint(M == 1);
-	  expected.add_constraint(O == 0);
-	  expected.add_constraint(R == 8);
-	  expected.add_constraint(Y == 2);
-
-	  if (ph != expected)
-	    return false;
-	}
+        for (int C4 = 0; C4 <= 1; ++C4) {
+          C_Polyhedron ph(8);
+          test01_namespace::constraints(ph,
+                                        S, E, N, D, M, O, R, Y,
+                                        C1, C2, C3, C4);
+          if (ph.is_empty())
+            continue;
+
+          nout << "Solution constraints" << endl;
+          const Constraint_System& cs = ph.constraints();
+          std::copy(cs.begin(), cs.end(),
+                    std::ostream_iterator<Constraint>(nout, "\n"));
+          nout << "Solution generators" << endl;
+          const Generator_System& gs = ph.generators();
+          std::copy(gs.begin(), gs.end(),
+                    std::ostream_iterator<Generator>(nout, "\n"));
+          if (solution_found)
+            return true;
+          solution_found = true;
+
+          C_Polyhedron expected(8);
+          expected.add_constraint(S == 9);
+          expected.add_constraint(E == 5);
+          expected.add_constraint(N == 6);
+          expected.add_constraint(D == 7);
+          expected.add_constraint(M == 1);
+          expected.add_constraint(O == 0);
+          expected.add_constraint(R == 8);
+          expected.add_constraint(Y == 2);
+
+          if (ph != expected)
+            return false;
+        }
   return true;
 }
 
diff --git a/tests/Polyhedron/sparserow1.cc b/tests/Polyhedron/sparserow1.cc
index 5849b2a..744e846 100644
--- a/tests/Polyhedron/sparserow1.cc
+++ b/tests/Polyhedron/sparserow1.cc
@@ -1,6 +1,6 @@
 /* Test the Sparse_Matrix class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/termination1.cc b/tests/Polyhedron/termination1.cc
index 4c8d68a..1e35daf 100644
--- a/tests/Polyhedron/termination1.cc
+++ b/tests/Polyhedron/termination1.cc
@@ -1,6 +1,6 @@
 /* Test the termination analysis facilities of the PPL.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/termination2.cc b/tests/Polyhedron/termination2.cc
index dc333cf..05a8c7e 100644
--- a/tests/Polyhedron/termination2.cc
+++ b/tests/Polyhedron/termination2.cc
@@ -1,6 +1,6 @@
 /* Test the termination analysis facilities of the PPL.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/timeelapse1.cc b/tests/Polyhedron/timeelapse1.cc
index e184cd1..588b14b 100644
--- a/tests/Polyhedron/timeelapse1.cc
+++ b/tests/Polyhedron/timeelapse1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::time_elapse_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/timeelapse2.cc b/tests/Polyhedron/timeelapse2.cc
index cdd926a..a0d8f32 100644
--- a/tests/Polyhedron/timeelapse2.cc
+++ b/tests/Polyhedron/timeelapse2.cc
@@ -1,6 +1,6 @@
 /* Test time_elapse_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/topclosed1.cc b/tests/Polyhedron/topclosed1.cc
index 123b314..a2e6c79 100644
--- a/tests/Polyhedron/topclosed1.cc
+++ b/tests/Polyhedron/topclosed1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::is_topologically_closed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/topclosure1.cc b/tests/Polyhedron/topclosure1.cc
index 110f263..c41adf3 100644
--- a/tests/Polyhedron/topclosure1.cc
+++ b/tests/Polyhedron/topclosure1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::topological_closure_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/unconstrain1.cc b/tests/Polyhedron/unconstrain1.cc
index f827bcf..dfb04e0 100644
--- a/tests/Polyhedron/unconstrain1.cc
+++ b/tests/Polyhedron/unconstrain1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::unconstrain().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/universe1.cc b/tests/Polyhedron/universe1.cc
index 8e812b4..0a53180 100644
--- a/tests/Polyhedron/universe1.cc
+++ b/tests/Polyhedron/universe1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::is_universe().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/universe2.cc b/tests/Polyhedron/universe2.cc
index 980bedd..913f662 100644
--- a/tests/Polyhedron/universe2.cc
+++ b/tests/Polyhedron/universe2.cc
@@ -1,6 +1,6 @@
 /* Test the function is_universe() for a NNC_polyhedron.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/variablesset1.cc b/tests/Polyhedron/variablesset1.cc
index 41b1f65..6c2881a 100644
--- a/tests/Polyhedron/variablesset1.cc
+++ b/tests/Polyhedron/variablesset1.cc
@@ -1,6 +1,6 @@
 /* Test the Variables_Set class.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -103,23 +103,23 @@ test04() {
   Variables_Set vs_intersection;
 
   std::set_union(vs1.begin(), vs1.end(),
-		 vs2.begin(), vs2.end(),
-		 std::inserter(vs_union, vs_union.begin()));
+                 vs2.begin(), vs2.end(),
+                 std::inserter(vs_union, vs_union.begin()));
   nout << "*** vs_union ***" << endl << vs_union << endl;
   if (vs_union != Variables_Set(A, I))
     return false;
 
   std::set_difference(vs1.begin(), vs1.end(),
-		      vs2.begin(), vs2.end(),
-		      std::inserter(vs_difference, vs_difference.begin()));
+                      vs2.begin(), vs2.end(),
+                      std::inserter(vs_difference, vs_difference.begin()));
   nout << "*** vs_difference ***" << endl << vs_difference << endl;
   if (vs_difference != Variables_Set(A, B))
     return false;
 
   std::set_intersection(vs1.begin(), vs1.end(),
-			vs2.begin(), vs2.end(),
-			std::inserter(vs_intersection,
-				      vs_intersection.begin()));
+                        vs2.begin(), vs2.end(),
+                        std::inserter(vs_intersection,
+                                      vs_intersection.begin()));
   nout << "*** vs_intersection ***" << endl << vs_intersection << endl;
   if (vs_intersection != Variables_Set(C))
     return false;
diff --git a/tests/Polyhedron/watchdog1.cc b/tests/Polyhedron/watchdog1.cc
index 21f067e..69f2f09 100644
--- a/tests/Polyhedron/watchdog1.cc
+++ b/tests/Polyhedron/watchdog1.cc
@@ -1,6 +1,6 @@
 /* Test the timeout facility of the library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -38,7 +38,7 @@ compute_open_hypercube_generators(dimension_type dimension) {
 }
 
 class Timeout : virtual public std::exception,
-		public Parma_Polyhedra_Library::Throwable {
+                public Parma_Polyhedra_Library::Throwable {
 public:
   const char* what() const throw() {
     return "timeout in watchdog1.cc";
diff --git a/tests/Polyhedron/weightwatch1.cc b/tests/Polyhedron/weightwatch1.cc
index 28d903e..a5a3649 100644
--- a/tests/Polyhedron/weightwatch1.cc
+++ b/tests/Polyhedron/weightwatch1.cc
@@ -1,6 +1,6 @@
 /* Test the weightwatch (i.e., deterministic timeout) facility of the library.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/wrap1.cc b/tests/Polyhedron/wrap1.cc
index 5b06914..d87faf2 100644
--- a/tests/Polyhedron/wrap1.cc
+++ b/tests/Polyhedron/wrap1.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::wrap_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/wrap2.cc b/tests/Polyhedron/wrap2.cc
index 16b123e..9e26ea6 100644
--- a/tests/Polyhedron/wrap2.cc
+++ b/tests/Polyhedron/wrap2.cc
@@ -1,6 +1,6 @@
 /* Test Polyhedron::wrap_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/writeconsys1.cc b/tests/Polyhedron/writeconsys1.cc
index a679a92..1b15530 100644
--- a/tests/Polyhedron/writeconsys1.cc
+++ b/tests/Polyhedron/writeconsys1.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(std::ostream&, const Constraint_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/writegensys1.cc b/tests/Polyhedron/writegensys1.cc
index af772e4..24a3086 100644
--- a/tests/Polyhedron/writegensys1.cc
+++ b/tests/Polyhedron/writegensys1.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(std::ostream&, const Generator_System&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/writepolyhedron1.cc b/tests/Polyhedron/writepolyhedron1.cc
index 9c5ad10..039509c 100644
--- a/tests/Polyhedron/writepolyhedron1.cc
+++ b/tests/Polyhedron/writepolyhedron1.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(std::ostream&, const Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/writepolyhedron2.cc b/tests/Polyhedron/writepolyhedron2.cc
index dadde05..3022794 100644
--- a/tests/Polyhedron/writepolyhedron2.cc
+++ b/tests/Polyhedron/writepolyhedron2.cc
@@ -1,6 +1,6 @@
 /* Test operator<<(std::ostream&, const Polyhedron&).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/writerelation1.cc b/tests/Polyhedron/writerelation1.cc
index bd98f50..5bc0158 100644
--- a/tests/Polyhedron/writerelation1.cc
+++ b/tests/Polyhedron/writerelation1.cc
@@ -1,7 +1,7 @@
 /* Test operator<<(std::ostream& s, const Poly_Con_Relation& r)
    and operator<<(std::ostream& s, const Poly_Gen_Relation& r).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Polyhedron/writevariable1.cc b/tests/Polyhedron/writevariable1.cc
index 0c2b5b5..79bd3ef 100644
--- a/tests/Polyhedron/writevariable1.cc
+++ b/tests/Polyhedron/writevariable1.cc
@@ -1,7 +1,7 @@
 /* Test operator<<(std::ostream& s, Variable v)
    and the related machinery.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -73,7 +73,7 @@ main() TRY {
   write_variables();
   // ... read back.
   read_variables_and_check("A F K P U Z E1 J1 O1 T1 Y1 "
-			   "D2 I2 N2 S2 X2 C3 H3 M3 R3 W3 ");
+                           "D2 I2 N2 S2 X2 C3 H3 M3 R3 W3 ");
 
   // Save the default output function.
   Variable::output_function_type* p_default_output_function
@@ -90,7 +90,7 @@ main() TRY {
   write_variables();
   // ... read back.
   read_variables_and_check("x0 x5 x10 x15 x20 x25 x30 x35 x40 x45 "
-			   "x50 x55 x60 x65 x70 x75 x80 x85 x90 x95 x100 ");
+                           "x50 x55 x60 x65 x70 x75 x80 x85 x90 x95 x100 ");
 
   // Restore the default output function.
   Variable::set_output_function(p_default_output_function);
diff --git a/tests/Powerset/Makefile.am b/tests/Powerset/Makefile.am
index d750ccd..16c6046 100644
--- a/tests/Powerset/Makefile.am
+++ b/tests/Powerset/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Powerset/Makefile.in b/tests/Powerset/Makefile.in
index 4320a1b..28ea95d 100644
--- a/tests/Powerset/Makefile.in
+++ b/tests/Powerset/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ .
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -76,7 +92,8 @@ TESTS = addcongruences1$(EXEEXT) addconstraints1$(EXEEXT) \
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1)
 subdir = tests/Powerset
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -135,6 +152,7 @@ addcongruences1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 am_addconstraints1_OBJECTS = addconstraints1.$(OBJEXT)
 addconstraints1_OBJECTS = $(am_addconstraints1_OBJECTS)
 addconstraints1_LDADD = $(LDADD)
@@ -379,6 +397,18 @@ upperbound1_LDADD = $(LDADD)
 upperbound1_DEPENDENCIES = $(top_builddir)/utils/libppl_utils.a \
 	$(top_builddir)/tests/libppl_tests.a \
 	$(top_builddir)/src/libppl.la
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -391,20 +421,16 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(addcongruences1_SOURCES) $(addconstraints1_SOURCES) \
 	$(affinedimension1_SOURCES) $(affineimage1_SOURCES) \
 	$(affinepreimage1_SOURCES) $(bounded1_SOURCES) \
@@ -441,10 +467,17 @@ DIST_SOURCES = $(addcongruences1_SOURCES) $(addconstraints1_SOURCES) \
 	$(relationwith1_SOURCES) $(simplifyusingcontext1_SOURCES) \
 	$(size1_SOURCES) $(spacedims1_SOURCES) $(universe1_SOURCES) \
 	$(upperbound1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -995,6 +1028,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -1008,7 +1055,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -1231,8 +1278,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Powerset/addcongruences1.cc b/tests/Powerset/addcongruences1.cc
index 5c557ef..5053689 100644
--- a/tests/Powerset/addcongruences1.cc
+++ b/tests/Powerset/addcongruences1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::add_congruence().
         Pointset_Powerset<PH>::add_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/addconstraints1.cc b/tests/Powerset/addconstraints1.cc
index 5964347..664ad47 100644
--- a/tests/Powerset/addconstraints1.cc
+++ b/tests/Powerset/addconstraints1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::add_constraint().
         Pointset_Powerset<PH>::add_constraints().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/affinedimension1.cc b/tests/Powerset/affinedimension1.cc
index e27d6aa..8c0d0c9 100644
--- a/tests/Powerset/affinedimension1.cc
+++ b/tests/Powerset/affinedimension1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::affine_dimension().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/affineimage1.cc b/tests/Powerset/affineimage1.cc
index d50e772..41d6db4 100644
--- a/tests/Powerset/affineimage1.cc
+++ b/tests/Powerset/affineimage1.cc
@@ -2,7 +2,7 @@
         Pointset_Powerset<PH>::generalized_affine_image(),
         Pointset_Powerset<PH>::bounded_affine_image().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/affinepreimage1.cc b/tests/Powerset/affinepreimage1.cc
index 6b7b490..04f4158 100644
--- a/tests/Powerset/affinepreimage1.cc
+++ b/tests/Powerset/affinepreimage1.cc
@@ -2,7 +2,7 @@
         Pointset_Powerset<PH>::generalized_affine_preimage(),
         Pointset_Powerset<PH>::bounded_affine_preimage().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/bounded1.cc b/tests/Powerset/bounded1.cc
index 28031e7..4cae2ad 100644
--- a/tests/Powerset/bounded1.cc
+++ b/tests/Powerset/bounded1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::is_bounded().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/bounds1.cc b/tests/Powerset/bounds1.cc
index c54a29f..2f09478 100644
--- a/tests/Powerset/bounds1.cc
+++ b/tests/Powerset/bounds1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::bounds_from_above(),
         Pointset_Powerset<PH>::bounds_from_below().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/closed1.cc b/tests/Powerset/closed1.cc
index 910b24b..60cbfb3 100644
--- a/tests/Powerset/closed1.cc
+++ b/tests/Powerset/closed1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::is_topologically_closed().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/closure1.cc b/tests/Powerset/closure1.cc
index a373764..524debc 100644
--- a/tests/Powerset/closure1.cc
+++ b/tests/Powerset/closure1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::topological_closure_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/collapse1.cc b/tests/Powerset/collapse1.cc
index ff8ad59..fe1a92f 100644
--- a/tests/Powerset/collapse1.cc
+++ b/tests/Powerset/collapse1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::collapse().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/concatenate1.cc b/tests/Powerset/concatenate1.cc
index 188e9b3..235d98b 100644
--- a/tests/Powerset/concatenate1.cc
+++ b/tests/Powerset/concatenate1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::concatenate().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/contains1.cc b/tests/Powerset/contains1.cc
index 68e61e0..5c38033 100644
--- a/tests/Powerset/contains1.cc
+++ b/tests/Powerset/contains1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::contains(),
         Pointset_Powerset<PH>::strictly_contains().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/containsintegerpoint1.cc b/tests/Powerset/containsintegerpoint1.cc
index f03e6f7..18dd0ef 100644
--- a/tests/Powerset/containsintegerpoint1.cc
+++ b/tests/Powerset/containsintegerpoint1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::contains_integer_point(),
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/difference1.cc b/tests/Powerset/difference1.cc
index 40031b8..543754a 100644
--- a/tests/Powerset/difference1.cc
+++ b/tests/Powerset/difference1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::difference_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -119,11 +119,11 @@ test03() {
   // intersection will consist of objects of affine dimension at most 1.
   bool ok1 = true;
   for (Pointset_Powerset<C_Polyhedron>::const_iterator
-	 i = intersection.begin(), in_end = intersection.end();
+         i = intersection.begin(), in_end = intersection.end();
        i != in_end; ++i)
     if (i->pointset().affine_dimension() > 1) {
       nout << "intersection contains " << i->pointset() << "," << endl
-	   << "which is of affine dimension greater than 1" << endl;
+           << "which is of affine dimension greater than 1" << endl;
       ok1 = false;
     }
 
diff --git a/tests/Powerset/discrete1.cc b/tests/Powerset/discrete1.cc
index 457ba7b..c46522a 100644
--- a/tests/Powerset/discrete1.cc
+++ b/tests/Powerset/discrete1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::is_discrete().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/disjoint1.cc b/tests/Powerset/disjoint1.cc
index f51c697..6c171ce 100644
--- a/tests/Powerset/disjoint1.cc
+++ b/tests/Powerset/disjoint1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::is_disjoint_from().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/disjunct1.cc b/tests/Powerset/disjunct1.cc
index 9ddf32e..bf01aa5 100644
--- a/tests/Powerset/disjunct1.cc
+++ b/tests/Powerset/disjunct1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::add_disjunct().
         Pointset_Powerset<PH>::drop_disjunct().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/empty1.cc b/tests/Powerset/empty1.cc
index 63744b1..1a6bc7c 100644
--- a/tests/Powerset/empty1.cc
+++ b/tests/Powerset/empty1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::is_empty(),
         Pointset_Powerset<PH>::empty().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/entails1.cc b/tests/Powerset/entails1.cc
index 0de60a5..837d5d8 100644
--- a/tests/Powerset/entails1.cc
+++ b/tests/Powerset/entails1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::definitely_entails().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/equals1.cc b/tests/Powerset/equals1.cc
index 3200197..6f66873 100644
--- a/tests/Powerset/equals1.cc
+++ b/tests/Powerset/equals1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::equals(),
         Pointset_Powerset<PH>::geometrically_equals().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/frombdshape1.cc b/tests/Powerset/frombdshape1.cc
index 6f2804b..9104bdc 100644
--- a/tests/Powerset/frombdshape1.cc
+++ b/tests/Powerset/frombdshape1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::Pointset_Powerset(BD_Shape<T>),
    Pointset_Powerset<PH>::Pointset_Powerset(Pointset_Powerset(BD_Shape<T>)).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/frombox1.cc b/tests/Powerset/frombox1.cc
index 96b9bae..aafdbdf 100644
--- a/tests/Powerset/frombox1.cc
+++ b/tests/Powerset/frombox1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::Pointset_Powerset(Box<T>),
    Pointset_Powerset<PH>::Pointset_Powerset(Pointset_Powerset(Box<T>)).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/fromcongruences1.cc b/tests/Powerset/fromcongruences1.cc
index d1bf145..adf53e8 100644
--- a/tests/Powerset/fromcongruences1.cc
+++ b/tests/Powerset/fromcongruences1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::
           Pointset_Powerset(Congruence_System).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/fromconstraints1.cc b/tests/Powerset/fromconstraints1.cc
index 5518696..c9800a7 100644
--- a/tests/Powerset/fromconstraints1.cc
+++ b/tests/Powerset/fromconstraints1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::Pointset_Powerset(Constraint_System).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -177,4 +177,6 @@ BEGIN_MAIN
   DO_TEST(test08);
   DO_TEST(test09);
   DO_TEST(test10);
+  DO_TEST(test11);
+  DO_TEST(test12);
 END_MAIN
diff --git a/tests/Powerset/fromgrid1.cc b/tests/Powerset/fromgrid1.cc
index 8711bb6..dbac760 100644
--- a/tests/Powerset/fromgrid1.cc
+++ b/tests/Powerset/fromgrid1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::Pointset_Powerset(Grid),
         Pointset_Powerset<PH>::Pointset_Powerset(Pointset_Powerset(Grid)).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/fromoctagonalshape1.cc b/tests/Powerset/fromoctagonalshape1.cc
index 0e6c44a..6d3da9d 100644
--- a/tests/Powerset/fromoctagonalshape1.cc
+++ b/tests/Powerset/fromoctagonalshape1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::Pointset_Powerset(BD_Shape<T>),
    Pointset_Powerset<PH>::Pointset_Powerset(Pointset_Powerset(BD_Shape<T>)).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/frompolyhedron1.cc b/tests/Powerset/frompolyhedron1.cc
index ded28d4..e663f0a 100644
--- a/tests/Powerset/frompolyhedron1.cc
+++ b/tests/Powerset/frompolyhedron1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::Pointset_Powerset(C_Polyhedron),
         Pointset_Powerset<PH>::Pointset_Powerset(NNC_Polyhedron).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/fromspacedimension1.cc b/tests/Powerset/fromspacedimension1.cc
index f98575d..08656cc 100644
--- a/tests/Powerset/fromspacedimension1.cc
+++ b/tests/Powerset/fromspacedimension1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::
           Pointset_Powerset(dimension_type, Degenerate_Element).
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/intersection1.cc b/tests/Powerset/intersection1.cc
index 09cf667..fff3652 100644
--- a/tests/Powerset/intersection1.cc
+++ b/tests/Powerset/intersection1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::intersection_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/maxmin1.cc b/tests/Powerset/maxmin1.cc
index a1ca637..a08d224 100644
--- a/tests/Powerset/maxmin1.cc
+++ b/tests/Powerset/maxmin1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::maximize().
         Pointset_Powerset<PH>::minimize().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/meet1.cc b/tests/Powerset/meet1.cc
index 949bba3..981cf70 100644
--- a/tests/Powerset/meet1.cc
+++ b/tests/Powerset/meet1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::meet_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/membytes1.cc b/tests/Powerset/membytes1.cc
index 0a22665..ea127ef 100644
--- a/tests/Powerset/membytes1.cc
+++ b/tests/Powerset/membytes1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::total_memory_in_bytes().
         Pointset_Powerset<PH>::external_memory_in_bytes().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/powerset1.cc b/tests/Powerset/powerset1.cc
index e534968..215bd3a 100644
--- a/tests/Powerset/powerset1.cc
+++ b/tests/Powerset/powerset1.cc
@@ -1,6 +1,6 @@
 /* Test Powerset<D>.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -90,7 +90,7 @@ test01() {
   // Constant reverse iterator.
   count = 0;
   for (PSET::const_reverse_iterator i = ps3.rbegin(),
-	 ps3_rend = ps3.rend(); i != ps3_rend; ++i)
+         ps3_rend = ps3.rend(); i != ps3_rend; ++i)
     ++count;
   if (count != 1)
     return false;
diff --git a/tests/Powerset/reduce1.cc b/tests/Powerset/reduce1.cc
index 225bd72..b424eea 100644
--- a/tests/Powerset/reduce1.cc
+++ b/tests/Powerset/reduce1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::omega_reduce().
         Pointset_Powerset<PH>::pairwise_reduce().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/refinewith1.cc b/tests/Powerset/refinewith1.cc
index 43fa8a5..db886be 100644
--- a/tests/Powerset/refinewith1.cc
+++ b/tests/Powerset/refinewith1.cc
@@ -3,7 +3,7 @@
         Pointset_Powerset<PH>::refine_with_congruence().
         Pointset_Powerset<PH>::refine_with_congruences().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/relationwith1.cc b/tests/Powerset/relationwith1.cc
index 8e4693a..d587f85 100644
--- a/tests/Powerset/relationwith1.cc
+++ b/tests/Powerset/relationwith1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::relation_with().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/simplifyusingcontext1.cc b/tests/Powerset/simplifyusingcontext1.cc
index 42e6715..28af59e 100644
--- a/tests/Powerset/simplifyusingcontext1.cc
+++ b/tests/Powerset/simplifyusingcontext1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset::simplify_using_context_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/size1.cc b/tests/Powerset/size1.cc
index b1f592b..dad4020 100644
--- a/tests/Powerset/size1.cc
+++ b/tests/Powerset/size1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::size().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/spacedims1.cc b/tests/Powerset/spacedims1.cc
index dbc0d04..1bdef39 100644
--- a/tests/Powerset/spacedims1.cc
+++ b/tests/Powerset/spacedims1.cc
@@ -4,7 +4,7 @@
         Pointset_Powerset<PH>::expand_space_dimensions(),
         Pointset_Powerset<PH>::fold_space_dimensions().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/universe1.cc b/tests/Powerset/universe1.cc
index c4cb171..6f67d28 100644
--- a/tests/Powerset/universe1.cc
+++ b/tests/Powerset/universe1.cc
@@ -1,6 +1,6 @@
 /* Test Pointset_Powerset<PH>::is_universe().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Powerset/upperbound1.cc b/tests/Powerset/upperbound1.cc
index 912cb66..ecd9b86 100644
--- a/tests/Powerset/upperbound1.cc
+++ b/tests/Powerset/upperbound1.cc
@@ -1,7 +1,7 @@
 /* Test Pointset_Powerset<PH>::upper_bound_assign(),
         Pointset_Powerset<PH>::least_upper_bound_assign().
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/README b/tests/README
index 82826d1..efcc5f2 100644
--- a/tests/README
+++ b/tests/README
@@ -1,5 +1,5 @@
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 See below for the copying conditions.
 
 How To Use the Test Programs (If You Really Want To Use Them)
@@ -86,7 +86,7 @@ f) Run `mytest' and enjoy!
 --------
 
 Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This document describes the Parma Polyhedra Library (PPL).
 
diff --git a/tests/Random_Number_Generator.defs.hh b/tests/Random_Number_Generator.defs.hh
deleted file mode 100644
index 8514a58..0000000
--- a/tests/Random_Number_Generator.defs.hh
+++ /dev/null
@@ -1,47 +0,0 @@
-/* Random_Number_Generator class declaration.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Random_Number_Generator_defs_hh
-#define PPL_Random_Number_Generator_defs_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Random_Number_Generator {
-public:
-  Random_Number_Generator();
-
-  explicit Random_Number_Generator(unsigned long seed);
-
-  template <typename T>
-  void get(T& x, unsigned int info);
-
-private:
-  gmp_randclass rand;
-  unsigned int max_bits;
-};
-
-} // namespace Parma_Polyhedra_Library
-
-#include "Random_Number_Generator.inlines.hh"
-
-#endif // !defined(PPL_Random_Number_Generator_defs_hh)
diff --git a/tests/Random_Number_Generator.inlines.hh b/tests/Random_Number_Generator.inlines.hh
deleted file mode 100644
index 89f8513..0000000
--- a/tests/Random_Number_Generator.inlines.hh
+++ /dev/null
@@ -1,92 +0,0 @@
-/* Random_Number_Generator class implementation: inline functions.
-   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is part of the Parma Polyhedra Library (PPL).
-
-The PPL is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3 of the License, or (at your
-option) any later version.
-
-The PPL is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software Foundation,
-Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
-
-For the most up-to-date information see the Parma Polyhedra Library
-site: http://bugseng.com/products/ppl/ . */
-
-#ifndef PPL_Random_Number_Generator_inlines_hh
-#define PPL_Random_Number_Generator_inlines_hh 1
-
-#include <ctime>
-
-namespace Parma_Polyhedra_Library {
-
-namespace Implementation {
-namespace Random_Numbers {
-
-template <typename T>
-class Random_Number_Generator_Aux {
-public:
-  Random_Number_Generator_Aux(unsigned int max_bits) {
-    if (std::numeric_limits<T>::is_bounded) {
-      assign_r(zmin, std::numeric_limits<T>::min(), ROUND_NOT_NEEDED);
-      assign_r(zrange, std::numeric_limits<T>::max(), ROUND_NOT_NEEDED);
-      zrange -= zmin;
-      ++zrange;
-    }
-    else if (std::numeric_limits<T>::is_signed) {
-      zmin = 1;
-      zmin <<= (max_bits - 1);
-      zmin = -zmin;
-    }
-    else {
-      assign_r(zmin, std::numeric_limits<T>::min(), ROUND_NOT_NEEDED);
-    }
-  }
-  mpz_class zmin;
-  mpz_class zrange;
-};
-
-} // namespace Random_Numbers
-} // namespace Implementation
-
-inline
-Random_Number_Generator::Random_Number_Generator()
-  : rand(gmp_randinit_default), max_bits(512) {
-  // Seed the random number generator with the current time.
-  rand.seed((unsigned long) time(0));
-}
-
-inline
-Random_Number_Generator::Random_Number_Generator(const unsigned long seed)
-  : rand(gmp_randinit_default), max_bits(512) {
-  // Seed the random number generator with the given value.
-  rand.seed(seed);
-}
-
-template <typename T>
-inline void
-Random_Number_Generator::get(T& x, unsigned int) {
-  using Implementation::Random_Numbers::Random_Number_Generator_Aux;
-  static Random_Number_Generator_Aux<T> aux(max_bits);
-  mpz_class n;
-  if (std::numeric_limits<T>::is_bounded) {
-    n = rand.get_z_range(aux.zrange);
-  }
-  else {
-    n = rand.get_z_bits(max_bits);
-  }
-  n += aux.zmin;
-  assign_r(x, n, ROUND_NOT_NEEDED);
-}
-
-} // namespace Parma_Polyhedra_Library
-
-#endif // !defined(PPL_Random_Number_Generator_inlines_hh)
diff --git a/tests/Random_Number_Generator.types.hh b/tests/Random_Number_Generator.types.hh
deleted file mode 100644
index 60b4b96..0000000
--- a/tests/Random_Number_Generator.types.hh
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
-
-This file is free software; as a special exception the author gives
-unlimited permission to copy and/or distribute it, with or without
-modifications, as long as this notice is preserved.
-
-This program is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
-implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-PURPOSE. */
-
-#ifndef PPL_Random_Number_Generator_types_hh
-#define PPL_Random_Number_Generator_types_hh 1
-
-namespace Parma_Polyhedra_Library {
-
-class Random_Number_Generator;
-
-}
-
-#endif // !defined(PPL_Random_Number_Generator_types_hh)
diff --git a/tests/Random_Number_Generator_defs.hh b/tests/Random_Number_Generator_defs.hh
new file mode 100644
index 0000000..6dd7f96
--- /dev/null
+++ b/tests/Random_Number_Generator_defs.hh
@@ -0,0 +1,47 @@
+/* Random_Number_Generator class declaration.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Random_Number_Generator_defs_hh
+#define PPL_Random_Number_Generator_defs_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Random_Number_Generator {
+public:
+  Random_Number_Generator();
+
+  explicit Random_Number_Generator(unsigned long seed);
+
+  template <typename T>
+  void get(T& x, unsigned int info);
+
+private:
+  gmp_randclass rand;
+  unsigned int max_bits;
+};
+
+} // namespace Parma_Polyhedra_Library
+
+#include "Random_Number_Generator_inlines.hh"
+
+#endif // !defined(PPL_Random_Number_Generator_defs_hh)
diff --git a/tests/Random_Number_Generator_inlines.hh b/tests/Random_Number_Generator_inlines.hh
new file mode 100644
index 0000000..885f2b0
--- /dev/null
+++ b/tests/Random_Number_Generator_inlines.hh
@@ -0,0 +1,92 @@
+/* Random_Number_Generator class implementation: inline functions.
+   Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is part of the Parma Polyhedra Library (PPL).
+
+The PPL is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 3 of the License, or (at your
+option) any later version.
+
+The PPL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software Foundation,
+Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
+
+For the most up-to-date information see the Parma Polyhedra Library
+site: http://bugseng.com/products/ppl/ . */
+
+#ifndef PPL_Random_Number_Generator_inlines_hh
+#define PPL_Random_Number_Generator_inlines_hh 1
+
+#include <ctime>
+
+namespace Parma_Polyhedra_Library {
+
+namespace Implementation {
+namespace Random_Numbers {
+
+template <typename T>
+class Random_Number_Generator_Aux {
+public:
+  Random_Number_Generator_Aux(unsigned int max_bits) {
+    if (std::numeric_limits<T>::is_bounded) {
+      assign_r(zmin, std::numeric_limits<T>::min(), ROUND_NOT_NEEDED);
+      assign_r(zrange, std::numeric_limits<T>::max(), ROUND_NOT_NEEDED);
+      zrange -= zmin;
+      ++zrange;
+    }
+    else if (std::numeric_limits<T>::is_signed) {
+      zmin = 1;
+      zmin <<= (max_bits - 1);
+      zmin = -zmin;
+    }
+    else {
+      assign_r(zmin, std::numeric_limits<T>::min(), ROUND_NOT_NEEDED);
+    }
+  }
+  mpz_class zmin;
+  mpz_class zrange;
+};
+
+} // namespace Random_Numbers
+} // namespace Implementation
+
+inline
+Random_Number_Generator::Random_Number_Generator()
+  : rand(gmp_randinit_default), max_bits(512) {
+  // Seed the random number generator with the current time.
+  rand.seed((unsigned long) time(0));
+}
+
+inline
+Random_Number_Generator::Random_Number_Generator(const unsigned long seed)
+  : rand(gmp_randinit_default), max_bits(512) {
+  // Seed the random number generator with the given value.
+  rand.seed(seed);
+}
+
+template <typename T>
+inline void
+Random_Number_Generator::get(T& x, unsigned int) {
+  using Implementation::Random_Numbers::Random_Number_Generator_Aux;
+  static Random_Number_Generator_Aux<T> aux(max_bits);
+  mpz_class n;
+  if (std::numeric_limits<T>::is_bounded) {
+    n = rand.get_z_range(aux.zrange);
+  }
+  else {
+    n = rand.get_z_bits(max_bits);
+  }
+  n += aux.zmin;
+  assign_r(x, n, ROUND_NOT_NEEDED);
+}
+
+} // namespace Parma_Polyhedra_Library
+
+#endif // !defined(PPL_Random_Number_Generator_inlines_hh)
diff --git a/tests/Random_Number_Generator_types.hh b/tests/Random_Number_Generator_types.hh
new file mode 100644
index 0000000..45e2bf5
--- /dev/null
+++ b/tests/Random_Number_Generator_types.hh
@@ -0,0 +1,22 @@
+/* Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
+
+This file is free software; as a special exception the author gives
+unlimited permission to copy and/or distribute it, with or without
+modifications, as long as this notice is preserved.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY, to the extent permitted by law; without even the
+implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+PURPOSE. */
+
+#ifndef PPL_Random_Number_Generator_types_hh
+#define PPL_Random_Number_Generator_types_hh 1
+
+namespace Parma_Polyhedra_Library {
+
+class Random_Number_Generator;
+
+}
+
+#endif // !defined(PPL_Random_Number_Generator_types_hh)
diff --git a/tests/Watchdog/Makefile.am b/tests/Watchdog/Makefile.am
index 7d0e822..dbb66ca 100644
--- a/tests/Watchdog/Makefile.am
+++ b/tests/Watchdog/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/tests/Watchdog/Makefile.in b/tests/Watchdog/Makefile.in
index 723f4c9..0e55033 100644
--- a/tests/Watchdog/Makefile.in
+++ b/tests/Watchdog/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -38,6 +37,23 @@
 # For the most up-to-date information see the Parma Polyhedra Library
 # site: http://bugseng.com/products/ppl/ . */
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ TESTS = watchdog1$(EXEEXT)
 XFAIL_TESTS =
 check_PROGRAMS = $(am__EXEEXT_1)
 subdir = tests/Watchdog
-DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(top_srcdir)/depcomp $(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -102,6 +119,19 @@ watchdog1_DEPENDENCIES = $(top_builddir)/tests/libppl_tests.a \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -114,26 +144,29 @@ LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 SOURCES = $(watchdog1_SOURCES)
 DIST_SOURCES = $(watchdog1_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
-am__tty_colors = \
-red=; grn=; lgn=; blu=; std=
+am__tty_colors_dummy = \
+  mgn= red= grn= lgn= blu= brg= std=; \
+  am__color_tests=no
+am__tty_colors = $(am__tty_colors_dummy)
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
 ACLOCAL = @ACLOCAL@
 AMTAR = @AMTAR@
@@ -483,6 +516,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -496,7 +543,7 @@ check-TESTS: $(TESTS)
 	    if test -f ./$$tst; then dir=./; \
 	    elif test -f $$tst; then dir=; \
 	    else dir="$(srcdir)/"; fi; \
-	    if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \
+	    if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \
 	      all=`expr $$all + 1`; \
 	      case " $(XFAIL_TESTS) " in \
 	      *[\ \	]$$tst[\ \	]*) \
@@ -719,8 +766,8 @@ uninstall-am:
 .MAKE: check-am install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \
-	clean-checkPROGRAMS clean-generic clean-libtool ctags \
-	distclean distclean-compile distclean-generic \
+	clean-checkPROGRAMS clean-generic clean-libtool cscopelist \
+	ctags distclean distclean-compile distclean-generic \
 	distclean-libtool distclean-tags distdir dvi dvi-am html \
 	html-am info info-am install install-am install-data \
 	install-data-am install-dvi install-dvi-am install-exec \
diff --git a/tests/Watchdog/watchdog1.cc b/tests/Watchdog/watchdog1.cc
index 33ad705..5738a38 100644
--- a/tests/Watchdog/watchdog1.cc
+++ b/tests/Watchdog/watchdog1.cc
@@ -1,6 +1,6 @@
 /* Some simple tests for the basic functionality of PPL::Watchdog.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/files.cc b/tests/files.cc
index 8c542b9..2fe1004 100644
--- a/tests/files.cc
+++ b/tests/files.cc
@@ -1,6 +1,6 @@
 /* Definition of simple helper functions to open and close files.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/files.hh b/tests/files.hh
index b716ed1..a9531f2 100644
--- a/tests/files.hh
+++ b/tests/files.hh
@@ -1,6 +1,6 @@
 /* Declaration of simple helper functions to open and close files.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
diff --git a/tests/ppl_test.cc b/tests/ppl_test.cc
index d59ab16..ad9d6df 100644
--- a/tests/ppl_test.cc
+++ b/tests/ppl_test.cc
@@ -1,6 +1,6 @@
 /* Implementation of utility functions used in test programs.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -52,7 +52,7 @@ void
 fpe_sigaction(int sig, siginfo_t* sip, void*) {
   if (sig != SIGFPE) {
     std::cerr << "fpe_handler called on signal different from SIGFPE"
-	      << std::endl;
+              << std::endl;
     exit(1);
   }
   const char* s = 0;
@@ -86,10 +86,10 @@ fpe_sigaction(int sig, siginfo_t* sip, void*) {
   }
   if (s != 0)
     std::cerr << "SIGFPE caught (cause: " << s << ")"
-	      << std::endl;
+              << std::endl;
   else {
     std::cerr << "SIGFPE caught (unknown si_code " << sip->si_code << ")"
-	      << std::endl;
+              << std::endl;
 #if defined(PPL_HAVE_FENV_H)
     std::cerr << "Inquire with fetestexcept(): ";
 #ifdef FE_INEXACT
@@ -124,7 +124,7 @@ void
 fpe_handler(int sig) {
   if (sig != SIGFPE) {
     std::cerr << "fpe_handler called on signal different from SIGFPE"
-	      << std::endl;
+              << std::endl;
     exit(1);
   }
   std::cerr << "SIGFPE caught"
@@ -180,7 +180,7 @@ set_handlers() {
 #endif // !defined(PPL_HAVE_SIGINFO_T) || !defined(SA_SIGINFO)
   if (sigaction(SIGFPE, &action, NULL) != 0) {
     std::cerr << "sigaction() failed"
-	      << std::endl;
+              << std::endl;
     abort();
   }
 #endif // PPL_HAVE_DECL_SIGACTION
@@ -204,7 +204,7 @@ check_distance(const Checked_Number<mpq_class, Extended_Number_Policy>& d,
     else
       nout << raw_value(d).get_d() << " (rounded towards zero)";
     nout << ": should be at most " << max_d << "."
-	 << std::endl;
+         << std::endl;
     return false;
   }
   else
@@ -213,7 +213,7 @@ check_distance(const Checked_Number<mpq_class, Extended_Number_Policy>& d,
 
 bool
 check_result(const BD_Shape<mpq_class>& computed_result,
-	     const BD_Shape<mpq_class>& known_result) {
+             const BD_Shape<mpq_class>& known_result) {
   if (computed_result == known_result)
     return true;
   else {
@@ -230,7 +230,7 @@ check_result(const BD_Shape<mpq_class>& computed_result,
 
 bool
 check_result(const Rational_Box& computed_result,
-	     const Rational_Box& known_result) {
+             const Rational_Box& known_result) {
   if (computed_result == known_result)
     return true;
   else {
@@ -327,7 +327,7 @@ std::ostream&
 operator<<(std::ostream& s, const FCAIBVP& x) {
   s << "{";
   for (FCAIBVP::Set::const_iterator i = x.set.begin(),
-	 x_end = x.set.end(); i != x_end; ) {
+         x_end = x.set.end(); i != x_end; ) {
     const Variable v(*i++);
     using IO_Operators::operator<<;
     s << v;
@@ -340,7 +340,7 @@ operator<<(std::ostream& s, const FCAIBVP& x) {
 
 void
 print_constraint(const Constraint& c,
-		 const std::string& intro, std::ostream& s) {
+                 const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   using IO_Operators::operator<<;
@@ -349,21 +349,21 @@ print_constraint(const Constraint& c,
 
 void
 print_constraints(const Polyhedron& ph,
-		  const std::string& intro, std::ostream& s) {
+                  const std::string& intro, std::ostream& s) {
   print_constraints(ph.constraints(), intro, s);
 }
 
 #if 0
 void
 print_constraints(const Affine_Space& affs,
-		  const std::string& intro, std::ostream& s) {
+                  const std::string& intro, std::ostream& s) {
   print_constraints(affs.constraints(), intro, s);
 }
 #endif
 
 void
 print_constraints(const Constraint_System& cs,
-		  const std::string& intro, std::ostream& s) {
+                  const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   Constraint_System::const_iterator i = cs.begin();
@@ -380,7 +380,7 @@ print_constraints(const Constraint_System& cs,
 
 void
 print_congruence(const Congruence& c,
-		 const std::string& intro, std::ostream& s) {
+                 const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   using IO_Operators::operator<<;
@@ -389,7 +389,7 @@ print_congruence(const Congruence& c,
 
 void
 print_congruences(const Congruence_System& cs,
-		  const std::string& intro, std::ostream& s) {
+                  const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << std::endl;
   Congruence_System::const_iterator i = cs.begin();
@@ -406,13 +406,13 @@ print_congruences(const Congruence_System& cs,
 
 void
 print_congruences(const Grid& gr,
-		  const std::string& intro, std::ostream& s) {
+                  const std::string& intro, std::ostream& s) {
   print_congruences(gr.congruences(), intro, s);
 }
 
 void
 print_generator(const Generator& g,
-		const std::string& intro, std::ostream& s) {
+                const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   using IO_Operators::operator<<;
@@ -421,7 +421,7 @@ print_generator(const Generator& g,
 
 void
 print_generator(const Grid_Generator& g,
-		const std::string& intro, std::ostream& s) {
+                const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   using IO_Operators::operator<<;
@@ -430,19 +430,19 @@ print_generator(const Grid_Generator& g,
 
 void
 print_generators(const Polyhedron& ph,
-		 const std::string& intro, std::ostream& s) {
+                 const std::string& intro, std::ostream& s) {
   print_generators(ph.generators(), intro, s);
 }
 
 void
 print_generators(const Grid& gr,
-		 const std::string& intro, std::ostream& s) {
+                 const std::string& intro, std::ostream& s) {
   print_generators(gr.grid_generators(), intro, s);
 }
 
 void
 print_generators(const Generator_System& gs,
-		 const std::string& intro, std::ostream& s) {
+                 const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   Generator_System::const_iterator i = gs.begin();
@@ -459,7 +459,7 @@ print_generators(const Generator_System& gs,
 
 void
 print_generators(const Grid_Generator_System& gs,
-		 const std::string& intro, std::ostream& s) {
+                 const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << "\n";
   Grid_Generator_System::const_iterator i = gs.begin();
@@ -476,7 +476,7 @@ print_generators(const Grid_Generator_System& gs,
 
 void
 print_function(const Parma_Polyhedra_Library::Partial_Function& function,
-	       const std::string& intro, std::ostream& s) {
+               const std::string& intro, std::ostream& s) {
   if (!intro.empty())
     s << intro << std::endl;
   function.print(s);
diff --git a/tests/ppl_test.hh b/tests/ppl_test.hh
index 1eacfa6..e45338b 100644
--- a/tests/ppl_test.hh
+++ b/tests/ppl_test.hh
@@ -1,6 +1,6 @@
 /* Header file for test programs.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -25,7 +25,7 @@ site: http://bugseng.com/products/ppl/ . */
 #define PPL_ppl_test_hh 1
 
 #include "ppl_header.hh"
-#include "Random_Number_Generator.defs.hh"
+#include "Random_Number_Generator_defs.hh"
 #include <stdexcept>
 #include <sstream>
 #include <list>
@@ -70,67 +70,67 @@ main() try {                                             \
   std::list<std::string> failed_tests;                   \
   std::list<std::string> unexpectedly_succeeded_tests;
 
-#define END_MAIN							\
-  if (!failed_tests.empty()) {						\
-    std::cerr << "tests failed: ";					\
+#define END_MAIN                                                        \
+  if (!failed_tests.empty()) {                                          \
+    std::cerr << "tests failed: ";                                      \
     std::copy(failed_tests.begin(),                                     \
               failed_tests.end(),                                       \
-	      std::ostream_iterator<std::string>(std::cerr, " "));	\
-    std::cerr << std::endl;						\
-    return 1;								\
-  }									\
-  if (!unexpectedly_succeeded_tests.empty()) {				\
+              std::ostream_iterator<std::string>(std::cerr, " "));      \
+    std::cerr << std::endl;                                             \
+    return 1;                                                           \
+  }                                                                     \
+  if (!unexpectedly_succeeded_tests.empty()) {                          \
     std::cerr << "tests unexpectedly succeeded: ";                      \
     std::copy(unexpectedly_succeeded_tests.begin(),                     \
               unexpectedly_succeeded_tests.end(),                       \
-	      std::ostream_iterator<std::string>(std::cerr, " "));	\
-    std::cerr << std::endl;						\
-    return 1;								\
-  }									\
-  return 0;								\
-}									\
-catch (const std::overflow_error& e) {					\
-  std::cerr << "arithmetic overflow (" << e.what() << ")"		\
-            << std::endl;						\
-  exit(1);								\
-}									\
-catch (const std::exception& e) {					\
-  std::cerr << "std::exception caught: "				\
-	    << e.what() << " (type == " << typeid(e).name() << ")"	\
-	    << std::endl;						\
-  exit(1);								\
+              std::ostream_iterator<std::string>(std::cerr, " "));      \
+    std::cerr << std::endl;                                             \
+    return 1;                                                           \
+  }                                                                     \
+  return 0;                                                             \
+}                                                                       \
+catch (const std::overflow_error& e) {                                  \
+  std::cerr << "arithmetic overflow (" << e.what() << ")"               \
+            << std::endl;                                               \
+  exit(1);                                                              \
+}                                                                       \
+catch (const std::exception& e) {                                       \
+  std::cerr << "std::exception caught: "                                \
+            << e.what() << " (type == " << typeid(e).name() << ")"      \
+            << std::endl;                                               \
+  exit(1);                                                              \
 }
 
-#define ANNOUNCE_TEST(test)		 \
+#define ANNOUNCE_TEST(test)              \
   nout << "\n=== " #test " ===" << std::endl
 
-#define RUN_TEST(test)							\
-  try {									\
-    overflow = false;							\
-    succeeded = test();							\
-  }									\
-  catch (const std::overflow_error& e) {				\
-    nout << "arithmetic overflow (" << e.what() << ")"			\
-	 << std::endl;							\
-    overflow = true;							\
-    succeeded = false;							\
-  }									\
-  catch (const std::exception& e) {					\
-    nout << "std::exception caught: "					\
-	 << e.what() << " (type == " << typeid(e).name() << ")"		\
-	 << std::endl;							\
-    succeeded = false;							\
-  }									\
-  catch (...) {								\
-    nout << "unknown exception caught"					\
-	 << std::endl;							\
-    succeeded = false;							\
+#define RUN_TEST(test)                                                  \
+  try {                                                                 \
+    overflow = false;                                                   \
+    succeeded = test();                                                 \
+  }                                                                     \
+  catch (const std::overflow_error& e) {                                \
+    nout << "arithmetic overflow (" << e.what() << ")"                  \
+         << std::endl;                                                  \
+    overflow = true;                                                    \
+    succeeded = false;                                                  \
+  }                                                                     \
+  catch (const std::exception& e) {                                     \
+    nout << "std::exception caught: "                                   \
+         << e.what() << " (type == " << typeid(e).name() << ")"         \
+         << std::endl;                                                  \
+    succeeded = false;                                                  \
+  }                                                                     \
+  catch (...) {                                                         \
+    nout << "unknown exception caught"                                  \
+         << std::endl;                                                  \
+    succeeded = false;                                                  \
   }
 
-#define DO_TEST(test)			 \
-  ANNOUNCE_TEST(test);			 \
-  RUN_TEST(test);			 \
-  if (!succeeded)			 \
+#define DO_TEST(test)                    \
+  ANNOUNCE_TEST(test);                   \
+  RUN_TEST(test);                        \
+  if (!succeeded)                        \
     failed_tests.push_back(#test);
 
 #define DO_TEST_F(test)                                 \
@@ -147,11 +147,11 @@ catch (const std::exception& e) {					\
   else if (!overflow)                                   \
     failed_tests.push_back(#test);
 
-#define DO_TEST_MAY_OVERFLOW_IF_INEXACT(test, shape)			\
-  ANNOUNCE_TEST(test);							\
-  RUN_TEST(test);							\
-  if (!succeeded)							\
-    if (!overflow || has_exact_coefficient_type(shape(0, EMPTY)))	\
+#define DO_TEST_MAY_OVERFLOW_IF_INEXACT(test, shape)                    \
+  ANNOUNCE_TEST(test);                                                  \
+  RUN_TEST(test);                                                       \
+  if (!succeeded)                                                       \
+    if (!overflow || has_exact_coefficient_type(shape(0, EMPTY)))       \
       failed_tests.push_back(#test);
 
 
@@ -389,10 +389,10 @@ private:
 
 public:
   noisy_ostream(const std::basic_ostream<CharT, Traits>& os,
-		const char* environment_variable)
+                const char* environment_variable)
     : std::basic_ostream<CharT, Traits>(check_noisy(environment_variable)
-					? os.rdbuf()
-					: &black_hole) {
+                                        ? os.rdbuf()
+                                        : &black_hole) {
   }
 };
 
@@ -510,26 +510,26 @@ has_exact_coefficient_type(const Box<Interval>&) {
 
 bool
 check_distance(const Checked_Number<mpq_class, Extended_Number_Policy>& d,
-	       const char* max_d_s, const char* d_name);
+               const char* max_d_s, const char* d_name);
 
 template <typename T>
 bool
 check_result_i(const BD_Shape<T>& computed_result,
-	       const BD_Shape<mpq_class>& known_result,
-	       const char* max_r_d_s,
-	       const char* max_e_d_s,
-	       const char* max_l_d_s) {
+               const BD_Shape<mpq_class>& known_result,
+               const char* max_r_d_s,
+               const char* max_e_d_s,
+               const char* max_l_d_s) {
   BD_Shape<mpq_class> q_computed_result(computed_result);
   // Handle in a more efficient way the case where equality is expected.
   if (max_r_d_s == 0 && max_e_d_s == 0 && max_l_d_s == 0) {
     if (q_computed_result != known_result) {
       using IO_Operators::operator<<;
       nout << "Equality does not hold:"
-	   << "\ncomputed result is\n"
-	   << q_computed_result
-	   << "\nknown result is\n"
-	   << known_result
-	   << std::endl;
+           << "\ncomputed result is\n"
+           << q_computed_result
+           << "\nknown result is\n"
+           << known_result
+           << std::endl;
       return false;
     }
     else
@@ -539,11 +539,11 @@ check_result_i(const BD_Shape<T>& computed_result,
   if (!q_computed_result.contains(known_result)) {
     using IO_Operators::operator<<;
     nout << "Containment does not hold:"
-	 << "\ncomputed result is\n"
-	 << q_computed_result
-	 << "\nknown result is\n"
-	 << known_result
-	 << std::endl;
+         << "\ncomputed result is\n"
+         << q_computed_result
+         << "\nknown result is\n"
+         << known_result
+         << std::endl;
     return false;
   }
 
@@ -560,10 +560,10 @@ check_result_i(const BD_Shape<T>& computed_result,
   if (!ok) {
     using IO_Operators::operator<<;
     nout << "Computed result is\n"
-	 << q_computed_result
-	 << "\nknown result is\n"
-	 << known_result
-	 << std::endl;
+         << q_computed_result
+         << "\nknown result is\n"
+         << known_result
+         << std::endl;
   }
   return ok;
 }
@@ -571,21 +571,21 @@ check_result_i(const BD_Shape<T>& computed_result,
 template <typename T>
 bool
 check_result(const BD_Shape<T>& computed_result,
-	     const BD_Shape<mpq_class>& known_result,
-	     const char* max_r_d_s,
-	     const char* max_e_d_s,
-	     const char* max_l_d_s) {
+             const BD_Shape<mpq_class>& known_result,
+             const char* max_r_d_s,
+             const char* max_e_d_s,
+             const char* max_l_d_s) {
   return std::numeric_limits<T>::is_integer
     ? check_result_i(computed_result, known_result,
-		     "+inf", "+inf", "+inf")
+                     "+inf", "+inf", "+inf")
     : check_result_i(computed_result, known_result,
-		     max_r_d_s, max_e_d_s, max_l_d_s);
+                     max_r_d_s, max_e_d_s, max_l_d_s);
 }
 
 template <typename T>
 bool
 check_result(const BD_Shape<T>& computed_result,
-	     const BD_Shape<T>& known_result) {
+             const BD_Shape<T>& known_result) {
   if (computed_result == known_result)
     return true;
   else {
@@ -603,7 +603,7 @@ check_result(const BD_Shape<T>& computed_result,
 template <typename T>
 bool
 check_result(const BD_Shape<T>& computed_result,
-	     const BD_Shape<mpq_class>& known_result) {
+             const BD_Shape<mpq_class>& known_result) {
   return std::numeric_limits<T>::is_integer
     ? check_result_i(computed_result, known_result, "+inf", "+inf", "+inf")
     : check_result_i(computed_result, known_result, 0, 0, 0);
@@ -611,26 +611,26 @@ check_result(const BD_Shape<T>& computed_result,
 
 bool
 check_result(const BD_Shape<mpq_class>& computed_result,
-	     const BD_Shape<mpq_class>& known_result);
+             const BD_Shape<mpq_class>& known_result);
 
 template <typename T>
 bool
 check_result_i(const Octagonal_Shape<T>& computed_result,
-	       const Octagonal_Shape<mpq_class>& known_result,
-	       const char* max_r_d_s,
-	       const char* max_e_d_s,
-	       const char* max_l_d_s) {
+               const Octagonal_Shape<mpq_class>& known_result,
+               const char* max_r_d_s,
+               const char* max_e_d_s,
+               const char* max_l_d_s) {
   Octagonal_Shape<mpq_class> q_computed_result(computed_result);
   // Handle in a more efficient way the case where equality is expected.
   if (max_r_d_s == 0 && max_e_d_s == 0 && max_l_d_s == 0) {
     if (q_computed_result != known_result) {
       using IO_Operators::operator<<;
       nout << "Equality does not hold:"
-	   << "\ncomputed result is\n"
+           << "\ncomputed result is\n"
            << q_computed_result
-	   << "\nknown result is\n"
+           << "\nknown result is\n"
            << known_result
-	   << std::endl;
+           << std::endl;
       return false;
     }
     else
@@ -640,11 +640,11 @@ check_result_i(const Octagonal_Shape<T>& computed_result,
   if (!q_computed_result.contains(known_result)) {
     using IO_Operators::operator<<;
     nout << "Containment does not hold:"
-	 << "\ncomputed result is\n"
-	 << q_computed_result
-	 << "\nknown result is\n"
-	 << known_result
-	 << std::endl;
+         << "\ncomputed result is\n"
+         << q_computed_result
+         << "\nknown result is\n"
+         << known_result
+         << std::endl;
     return false;
   }
 
@@ -661,10 +661,10 @@ check_result_i(const Octagonal_Shape<T>& computed_result,
   if (!ok) {
     using IO_Operators::operator<<;
     nout << "Computed result is\n"
-	 << q_computed_result
-	 << "\nknown result is\n"
-	 << known_result
-	 << std::endl;
+         << q_computed_result
+         << "\nknown result is\n"
+         << known_result
+         << std::endl;
   }
   return ok;
 }
@@ -672,32 +672,32 @@ check_result_i(const Octagonal_Shape<T>& computed_result,
 template <typename T>
 bool
 check_result(const Octagonal_Shape<T>& computed_result,
-	     const Octagonal_Shape<mpq_class>& known_result,
-	     const char* max_r_d_s,
-	     const char* max_e_d_s,
-	     const char* max_l_d_s) {
+             const Octagonal_Shape<mpq_class>& known_result,
+             const char* max_r_d_s,
+             const char* max_e_d_s,
+             const char* max_l_d_s) {
   return std::numeric_limits<T>::is_integer
     ? check_result_i(computed_result, known_result,
-		     "+inf", "+inf", "+inf")
+                     "+inf", "+inf", "+inf")
     : check_result_i(computed_result, known_result,
-		     max_r_d_s, max_e_d_s, max_l_d_s);
+                     max_r_d_s, max_e_d_s, max_l_d_s);
 }
 
 template <>
 inline bool
 check_result(const Octagonal_Shape<mpq_class>& computed_result,
-	     const Octagonal_Shape<mpq_class>& known_result,
-	     const char*,
-	     const char*,
-	     const char*) {
+             const Octagonal_Shape<mpq_class>& known_result,
+             const char*,
+             const char*,
+             const char*) {
   return check_result_i(computed_result, known_result,
-			0, 0, 0);
+                        0, 0, 0);
 }
 
 template <typename T>
 bool
 check_result(const Octagonal_Shape<T>& computed_result,
-	     const Octagonal_Shape<mpq_class>& known_result) {
+             const Octagonal_Shape<mpq_class>& known_result) {
   return std::numeric_limits<T>::is_integer
     ? check_result_i(computed_result, known_result, "+inf", "+inf", "+inf")
     : check_result_i(computed_result, known_result, 0, 0, 0);
@@ -707,21 +707,21 @@ check_result(const Octagonal_Shape<T>& computed_result,
 template <typename Interval>
 bool
 check_result_i(const Box<Interval>& computed_result,
-	       const Rational_Box& known_result,
-	       const char* max_r_d_s,
-	       const char* max_e_d_s,
-	       const char* max_l_d_s) {
+               const Rational_Box& known_result,
+               const char* max_r_d_s,
+               const char* max_e_d_s,
+               const char* max_l_d_s) {
   Rational_Box q_computed_result(computed_result);
   // Handle in a more efficient way the case where equality is expected.
   if (max_r_d_s == 0 && max_e_d_s == 0 && max_l_d_s == 0) {
     if (q_computed_result != known_result) {
       using IO_Operators::operator<<;
       nout << "Equality does not hold:"
-	   << "\ncomputed result is\n"
-	   << q_computed_result
-	   << "\nknown result is\n"
-	   << known_result
-	   << std::endl;
+           << "\ncomputed result is\n"
+           << q_computed_result
+           << "\nknown result is\n"
+           << known_result
+           << std::endl;
       return false;
     }
     else
@@ -731,22 +731,22 @@ check_result_i(const Box<Interval>& computed_result,
   if (!q_computed_result.contains(known_result)) {
     using IO_Operators::operator<<;
     nout << "Containment does not hold:"
-	 << "\ncomputed result is\n"
-	 << q_computed_result
-	 << "\nknown result is\n"
-	 << known_result
-	 << std::endl;
+         << "\ncomputed result is\n"
+         << q_computed_result
+         << "\nknown result is\n"
+         << known_result
+         << std::endl;
     nout << "Individual dimensions where containment does not hold"
-	 << "\n(Variable: computed-result known-result):\n";
+         << "\n(Variable: computed-result known-result):\n";
     for (dimension_type i = 0; i < computed_result.space_dimension(); ++i) {
       if (!q_computed_result.get_interval(Variable(i))
           .contains(known_result.get_interval(Variable(i)))) {
         using IO_Operators::operator<<;
-	nout << Variable(i) << ": "
-	     << q_computed_result.get_interval(Variable(i))
-	     << ' '
-	     << known_result.get_interval(Variable(i))
-	     << std::endl;
+        nout << Variable(i) << ": "
+             << q_computed_result.get_interval(Variable(i))
+             << ' '
+             << known_result.get_interval(Variable(i))
+             << std::endl;
       }
     }
     return false;
@@ -765,10 +765,10 @@ check_result_i(const Box<Interval>& computed_result,
   if (!ok) {
     using IO_Operators::operator<<;
     nout << "Computed result is\n"
-	 << q_computed_result
-	 << "\nknown result is\n"
-	 << known_result
-	 << std::endl;
+         << q_computed_result
+         << "\nknown result is\n"
+         << known_result
+         << std::endl;
   }
   return ok;
 }
@@ -776,21 +776,21 @@ check_result_i(const Box<Interval>& computed_result,
 template <typename Interval>
 bool
 check_result(const Box<Interval>& computed_result,
-	     const Rational_Box& known_result,
-	     const char* max_r_d_s,
-	     const char* max_e_d_s,
-	     const char* max_l_d_s) {
+             const Rational_Box& known_result,
+             const char* max_r_d_s,
+             const char* max_e_d_s,
+             const char* max_l_d_s) {
   return std::numeric_limits<typename Interval::boundary_type>::is_integer
     ? check_result_i(computed_result, known_result,
-		     "+inf", "+inf", "+inf")
+                     "+inf", "+inf", "+inf")
     : check_result_i(computed_result, known_result,
-		     max_r_d_s, max_e_d_s, max_l_d_s);
+                     max_r_d_s, max_e_d_s, max_l_d_s);
 }
 
 template <typename Interval>
 bool
 check_result(const Box<Interval>& computed_result,
-	     const Box<Interval>& known_result) {
+             const Box<Interval>& known_result) {
   if (computed_result == known_result)
     return true;
   else {
@@ -808,7 +808,7 @@ check_result(const Box<Interval>& computed_result,
 template <typename Interval>
 bool
 check_result(const Box<Interval>& computed_result,
-	     const Rational_Box& known_result) {
+             const Rational_Box& known_result) {
   return std::numeric_limits<typename Interval::boundary_type>::is_integer
     ? check_result_i(computed_result, known_result, "+inf", "+inf", "+inf")
     : check_result_i(computed_result, known_result, 0, 0, 0);
@@ -816,7 +816,7 @@ check_result(const Box<Interval>& computed_result,
 
 bool
 check_result(const Rational_Box& computed_result,
-	     const Rational_Box& known_result);
+             const Rational_Box& known_result);
 
 bool
 check_result(const Generator& computed_result,
@@ -904,7 +904,7 @@ inline
 FCAIBVP::FCAIBVP(const Variables_Set& y)
   : set() {
   for (Variables_Set::const_iterator i = y.begin(),
-	 y_end = y.end(); i != y_end; ++i)
+         y_end = y.end(); i != y_end; ++i)
     set.insert(*i);
 }
 
@@ -912,7 +912,7 @@ inline
 FCAIBVP::FCAIBVP(const FCAIBVP& y, unsigned offset)
   : set() {
   for (Set::const_iterator i = y.set.begin(),
-	 y_set_end = y.set.end(); i != y_set_end; ++i)
+         y_set_end = y.set.end(); i != y_set_end; ++i)
     set.insert(*i + offset);
 }
 
@@ -935,7 +935,7 @@ inline bool
 FCAIBVP::definitely_entails(const FCAIBVP& y) const{
   const FCAIBVP& x = *this;
   return std::includes(x.set.begin(), x.set.end(),
-		       y.set.begin(), y.set.end());
+                       y.set.begin(), y.set.end());
 }
 
 inline void
@@ -943,8 +943,8 @@ FCAIBVP::upper_bound_assign(const FCAIBVP& y) {
   FCAIBVP& x = *this;
   FCAIBVP z;
   std::set_intersection(x.set.begin(), x.set.end(),
-			y.set.begin(), y.set.end(),
-			std::inserter(z.set, z.set.begin()));
+                        y.set.begin(), y.set.end(),
+                        std::inserter(z.set, z.set.begin()));
   using std::swap;
   swap(x, z);
 }
@@ -954,8 +954,8 @@ FCAIBVP::difference_assign(const FCAIBVP& y) {
   FCAIBVP& x = *this;
   FCAIBVP z;
   std::set_difference(x.set.begin(), x.set.end(),
-		      y.set.begin(), y.set.end(),
-		      std::inserter(z.set, z.set.begin()));
+                      y.set.begin(), y.set.end(),
+                      std::inserter(z.set, z.set.begin()));
   using std::swap;
   swap(x, z);
 }
@@ -992,31 +992,31 @@ operator!=(const FCAIBVP& x, const FCAIBVP& y) {
 
 void
 print_constraint(const Constraint& c,
-		 const std::string& intro = "",
-		 std::ostream& s = nout);
+                 const std::string& intro = "",
+                 std::ostream& s = nout);
 
 void
 print_constraints(const Constraint_System& cs,
-		  const std::string& intro = "",
-		  std::ostream& s = nout);
+                  const std::string& intro = "",
+                  std::ostream& s = nout);
 
 void
 print_constraints(const Polyhedron& ph,
-		  const std::string& intro = "",
-		  std::ostream& s = nout);
+                  const std::string& intro = "",
+                  std::ostream& s = nout);
 
 #if 0
 void
 print_constraints(const Affine_Space& affs,
-		  const std::string& intro = "",
-		  std::ostream& s = nout);
+                  const std::string& intro = "",
+                  std::ostream& s = nout);
 #endif
 
 template <typename Interval>
 void
 print_constraints(const Box<Interval>& box,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   if (!intro.empty())
     s << intro << std::endl;
   using IO_Operators::operator<<;
@@ -1026,8 +1026,8 @@ print_constraints(const Box<Interval>& box,
 template <typename T>
 void
 print_constraints(const BD_Shape<T>& bd,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   if (!intro.empty())
     s << intro << std::endl;
   using IO_Operators::operator<<;
@@ -1037,8 +1037,8 @@ print_constraints(const BD_Shape<T>& bd,
 template <typename T>
 void
 print_constraints(const Octagonal_Shape<T>& oc,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   if (!intro.empty())
     s << intro << std::endl;
   using IO_Operators::operator<<;
@@ -1048,8 +1048,8 @@ print_constraints(const Octagonal_Shape<T>& oc,
 template <typename PH>
 void
 print_constraints(const Pointset_Powerset<PH>& pps,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   if (!intro.empty())
     s << intro << std::endl;
   using IO_Operators::operator<<;
@@ -1059,8 +1059,8 @@ print_constraints(const Pointset_Powerset<PH>& pps,
 template <typename PH>
 void
 print_congruences(const Pointset_Powerset<PH>& pps,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   if (!intro.empty())
     s << intro << std::endl;
   using IO_Operators::operator<<;
@@ -1071,8 +1071,8 @@ print_congruences(const Pointset_Powerset<PH>& pps,
 template <typename PH>
 void
 print_constraints(const Pointset_Ask_Tell<PH>& pat,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   if (!intro.empty())
     s << intro << std::endl;
   using IO_Operators::operator<<;
@@ -1082,69 +1082,69 @@ print_constraints(const Pointset_Ask_Tell<PH>& pat,
 
 void
 print_congruence(const Congruence& c,
-		 const std::string& intro = "",
-		 std::ostream& s = nout);
+                 const std::string& intro = "",
+                 std::ostream& s = nout);
 
 void
 print_congruences(const Congruence_System& cgs,
-		  const std::string& intro = "",
-		  std::ostream& s = nout);
+                  const std::string& intro = "",
+                  std::ostream& s = nout);
 
 void
 print_congruences(const Grid& gr,
-		  const std::string& intro = "",
-		  std::ostream& s = nout);
+                  const std::string& intro = "",
+                  std::ostream& s = nout);
 
 void
 print_generator(const Generator& g,
-		const std::string& intro = "",
-		std::ostream& s = nout);
+                const std::string& intro = "",
+                std::ostream& s = nout);
 
 void
 print_generator(const Grid_Generator& g,
-		const std::string& intro = "",
-		std::ostream& s = nout);
+                const std::string& intro = "",
+                std::ostream& s = nout);
 
 void
 print_generators(const Generator_System& gs,
-		 const std::string& intro = "",
-		 std::ostream& s = nout);
+                 const std::string& intro = "",
+                 std::ostream& s = nout);
 
 void
 print_generators(const Grid_Generator_System& gs,
-		 const std::string& intro = "",
-		 std::ostream& s = nout);
+                 const std::string& intro = "",
+                 std::ostream& s = nout);
 
 void
 print_generators(const Polyhedron& ph,
-		 const std::string& intro = "",
-		 std::ostream& s = nout);
+                 const std::string& intro = "",
+                 std::ostream& s = nout);
 
 void
 print_generators(const Grid& gr,
-		 const std::string& intro = "",
-		 std::ostream& s = nout);
+                 const std::string& intro = "",
+                 std::ostream& s = nout);
 
 template <typename D1, typename D2, typename R>
 void
 print_constraints(const Partially_Reduced_Product<D1, D2, R>& pd,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   print_constraints(pd.constraints(), intro, s);
 }
 
 template <typename D1, typename D2, typename R>
 void
 print_congruences(const Partially_Reduced_Product<D1, D2, R>& pd,
-		  const std::string& intro = "",
-		  std::ostream& s = nout) {
+                  const std::string& intro = "",
+                  std::ostream& s = nout) {
   print_congruences(pd.congruences(), intro, s);
 }
 
 void
 print_function(const Parma_Polyhedra_Library::Partial_Function& function,
-	       const std::string& intro = "",
-	       std::ostream& s = nout);
+               const std::string& intro = "",
+               std::ostream& s = nout);
 
 } // namespace Test
 
diff --git a/utils/Makefile.am b/utils/Makefile.am
index 73261d0..5ab9309 100644
--- a/utils/Makefile.am
+++ b/utils/Makefile.am
@@ -1,6 +1,6 @@
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/utils/Makefile.in b/utils/Makefile.in
index b702504..b42c82b 100644
--- a/utils/Makefile.in
+++ b/utils/Makefile.in
@@ -1,9 +1,8 @@
-# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# Makefile.in generated by automake 1.12.6 from Makefile.am.
 # @configure_input@
 
-# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
-# Foundation, Inc.
+# Copyright (C) 1994-2012 Free Software Foundation, Inc.
+
 # This Makefile.in is free software; the Free Software Foundation
 # gives unlimited permission to copy and/or distribute it,
 # with or without modifications, as long as this notice is preserved.
@@ -17,7 +16,7 @@
 
 # Automake source file for the Parma Polyhedra Library.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
@@ -40,6 +39,23 @@
 
 
 VPATH = @srcdir@
+am__make_dryrun = \
+  { \
+    am__dry=no; \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        echo 'am--echo: ; @echo "AM"  OK' | $(MAKE) -f - 2>/dev/null \
+          | grep '^AM OK$$' >/dev/null || am__dry=yes;; \
+      *) \
+        for am__flg in $$MAKEFLAGS; do \
+          case $$am__flg in \
+            *=*|--*) ;; \
+            *n*) am__dry=yes; break;; \
+          esac; \
+        done;; \
+    esac; \
+    test $$am__dry = yes; \
+  }
 pkgdatadir = $(datadir)/@PACKAGE@
 pkgincludedir = $(includedir)/@PACKAGE@
 pkglibdir = $(libdir)/@PACKAGE@
@@ -60,7 +76,8 @@ build_triplet = @build@
 host_triplet = @host@
 subdir = utils
 DIST_COMMON = $(dist_noinst_SCRIPTS) $(srcdir)/Makefile.am \
-	$(srcdir)/Makefile.in
+	$(srcdir)/Makefile.in $(top_srcdir)/depcomp \
+	$(top_srcdir)/mkinstalldirs
 ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_check_ciao.m4 \
 	$(top_srcdir)/m4/ac_check_fpu_control.m4 \
@@ -97,15 +114,25 @@ LIBRARIES = $(noinst_LIBRARIES)
 ARFLAGS = cru
 AM_V_AR = $(am__v_AR_ at AM_V@)
 am__v_AR_ = $(am__v_AR_ at AM_DEFAULT_V@)
-am__v_AR_0 = @echo "  AR    " $@;
-AM_V_at = $(am__v_at_ at AM_V@)
-am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
-am__v_at_0 = @
+am__v_AR_0 = @echo "  AR      " $@;
+am__v_AR_1 = 
 libppl_utils_a_AR = $(AR) $(ARFLAGS)
 libppl_utils_a_LIBADD =
 am_libppl_utils_a_OBJECTS = timings.$(OBJEXT)
 libppl_utils_a_OBJECTS = $(am_libppl_utils_a_OBJECTS)
 SCRIPTS = $(dist_noinst_SCRIPTS) $(noinst_SCRIPTS)
+AM_V_P = $(am__v_P_ at AM_V@)
+am__v_P_ = $(am__v_P_ at AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_ at AM_V@)
+am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_ at AM_V@)
+am__v_at_ = $(am__v_at_ at AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
 DEFAULT_INCLUDES = -I. at am__isrc@ -I$(top_builddir)
 depcomp = $(SHELL) $(top_srcdir)/depcomp
 am__depfiles_maybe = depfiles
@@ -115,20 +142,23 @@ CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
 AM_V_lt = $(am__v_lt_ at AM_V@)
 am__v_lt_ = $(am__v_lt_ at AM_DEFAULT_V@)
 am__v_lt_0 = --silent
+am__v_lt_1 = 
 LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \
 	$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \
 	$(AM_CXXFLAGS) $(CXXFLAGS)
 AM_V_CXX = $(am__v_CXX_ at AM_V@)
 am__v_CXX_ = $(am__v_CXX_ at AM_DEFAULT_V@)
-am__v_CXX_0 = @echo "  CXX   " $@;
+am__v_CXX_0 = @echo "  CXX     " $@;
+am__v_CXX_1 = 
 CXXLD = $(CXX)
 CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \
 	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CXXLD = $(am__v_CXXLD_ at AM_V@)
 am__v_CXXLD_ = $(am__v_CXXLD_ at AM_DEFAULT_V@)
-am__v_CXXLD_0 = @echo "  CXXLD " $@;
+am__v_CXXLD_0 = @echo "  CXXLD   " $@;
+am__v_CXXLD_1 = 
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
 	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
 LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
@@ -137,19 +167,23 @@ LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(AM_CFLAGS) $(CFLAGS)
 AM_V_CC = $(am__v_CC_ at AM_V@)
 am__v_CC_ = $(am__v_CC_ at AM_DEFAULT_V@)
-am__v_CC_0 = @echo "  CC    " $@;
+am__v_CC_0 = @echo "  CC      " $@;
+am__v_CC_1 = 
 CCLD = $(CC)
 LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \
 	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
 	$(AM_LDFLAGS) $(LDFLAGS) -o $@
 AM_V_CCLD = $(am__v_CCLD_ at AM_V@)
 am__v_CCLD_ = $(am__v_CCLD_ at AM_DEFAULT_V@)
-am__v_CCLD_0 = @echo "  CCLD  " $@;
-AM_V_GEN = $(am__v_GEN_ at AM_V@)
-am__v_GEN_ = $(am__v_GEN_ at AM_DEFAULT_V@)
-am__v_GEN_0 = @echo "  GEN   " $@;
+am__v_CCLD_0 = @echo "  CCLD    " $@;
+am__v_CCLD_1 = 
 SOURCES = $(libppl_utils_a_SOURCES)
 DIST_SOURCES = $(libppl_utils_a_SOURCES)
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
 ETAGS = etags
 CTAGS = ctags
 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
@@ -494,6 +528,20 @@ GTAGS:
 	  && $(am__cd) $(top_srcdir) \
 	  && gtags -i $(GTAGS_ARGS) "$$here"
 
+cscopelist:  $(HEADERS) $(SOURCES) $(LISP)
+	list='$(SOURCES) $(HEADERS) $(LISP)'; \
+	case "$(srcdir)" in \
+	  [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+	  *) sdir=$(subdir)/$(srcdir) ;; \
+	esac; \
+	for i in $$list; do \
+	  if test -f "$$i"; then \
+	    echo "$(subdir)/$$i"; \
+	  else \
+	    echo "$$sdir/$$i"; \
+	  fi; \
+	done >> $(top_builddir)/cscope.files
+
 distclean-tags:
 	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
 
@@ -639,17 +687,18 @@ uninstall-am:
 .MAKE: install-am install-strip
 
 .PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
-	clean-libtool clean-noinstLIBRARIES ctags dist-hook distclean \
-	distclean-compile distclean-generic distclean-libtool \
-	distclean-tags distdir dvi dvi-am html html-am info info-am \
-	install install-am install-data install-data-am install-dvi \
-	install-dvi-am install-exec install-exec-am install-html \
-	install-html-am install-info install-info-am install-man \
-	install-pdf install-pdf-am install-ps install-ps-am \
-	install-strip installcheck installcheck-am installdirs \
-	maintainer-clean maintainer-clean-generic mostlyclean \
-	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
-	pdf pdf-am ps ps-am tags uninstall uninstall-am
+	clean-libtool clean-noinstLIBRARIES cscopelist ctags dist-hook \
+	distclean distclean-compile distclean-generic \
+	distclean-libtool distclean-tags distdir dvi dvi-am html \
+	html-am info info-am install install-am install-data \
+	install-data-am install-dvi install-dvi-am install-exec \
+	install-exec-am install-html install-html-am install-info \
+	install-info-am install-man install-pdf install-pdf-am \
+	install-ps install-ps-am install-strip installcheck \
+	installcheck-am installdirs maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-compile \
+	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags uninstall uninstall-am
 
 
 # Even if the scripts listed in noinst_SCRIPTS are not distributed
diff --git a/utils/build_header.in b/utils/build_header.in
index f563eef..8e0f139 100644
--- a/utils/build_header.in
+++ b/utils/build_header.in
@@ -7,7 +7,7 @@ eval 'case $# in 0) exec @PERL@ -S "$0";; *) exec @PERL@ -S "$0" "$@";; esac'
 
 # Builds a self-contained C++ header file by performing recursive inclusion.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/utils/cm_cleaner.sh b/utils/cm_cleaner.sh
index afd3674..c81a14f 100755
--- a/utils/cm_cleaner.sh
+++ b/utils/cm_cleaner.sh
@@ -2,7 +2,7 @@
 
 # Erases all files listed in the cutting markers found on stdin.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/utils/cm_splitter.sh b/utils/cm_splitter.sh
index b9d2617..9d9e6e0 100755
--- a/utils/cm_splitter.sh
+++ b/utils/cm_splitter.sh
@@ -2,7 +2,7 @@
 
 # Splits stdin according to cutting markers.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/utils/text2cxxarray.in b/utils/text2cxxarray.in
index e484735..e3dc569 100644
--- a/utils/text2cxxarray.in
+++ b/utils/text2cxxarray.in
@@ -7,7 +7,7 @@ eval 'case $# in 0) exec @PERL@ -S "$0";; *) exec @PERL@ -S "$0" "$@";; esac'
 
 # Convert an ASCII text into the declaration of a C++ array.
 # Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-# Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+# Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 #
 # This file is part of the Parma Polyhedra Library (PPL).
 #
diff --git a/utils/timings.cc b/utils/timings.cc
index 20b94fd..f0029b4 100644
--- a/utils/timings.cc
+++ b/utils/timings.cc
@@ -1,6 +1,6 @@
 /* Definitions of simple functions for printing timings.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 
@@ -70,29 +70,29 @@ print_clock(ostream& s) {
     exit(1);
   }
   else {
-    time_t current_secs = usage.ru_utime.tv_sec;
-    time_t current_usecs = usage.ru_utime.tv_usec;
-    time_t saved_secs = saved_ru_utime.tv_sec;
-    time_t saved_usecs = saved_ru_utime.tv_usec;
+    const time_t current_secs = usage.ru_utime.tv_sec;
+    const time_t current_usecs = usage.ru_utime.tv_usec;
+    const time_t saved_secs = saved_ru_utime.tv_sec;
+    const time_t saved_usecs = saved_ru_utime.tv_usec;
     time_t secs;
     time_t csecs;
     secs = current_secs - saved_secs;
     if (current_usecs < saved_usecs) {
       csecs = (((1000000 + current_usecs) - saved_usecs) + 5000) / 10000;
       if (csecs < 100)
-	--secs;
+        --secs;
       else
-	csecs = 0;
+        csecs = 0;
     }
     else {
       csecs = ((current_usecs - saved_usecs) + 5000) / 10000;
       if (csecs == 100) {
-	++secs;
-	csecs = 0;
+        ++secs;
+        csecs = 0;
       }
     }
     assert(csecs >= 0 && csecs < 100 && secs >= 0);
-    char fill_char = s.fill();
+    const char fill_char = s.fill();
     s << secs << "." << setfill('0') << setw(2) << csecs;
     s.fill(fill_char);
   }
diff --git a/utils/timings.hh b/utils/timings.hh
index 2c0eeaf..0fac175 100644
--- a/utils/timings.hh
+++ b/utils/timings.hh
@@ -1,6 +1,6 @@
 /* Declaration of simple functions for printing timings.
    Copyright (C) 2001-2010 Roberto Bagnara <bagnara at cs.unipr.it>
-   Copyright (C) 2010-2012 BUGSENG srl (http://bugseng.com)
+   Copyright (C) 2010-2013 BUGSENG srl (http://bugseng.com)
 
 This file is part of the Parma Polyhedra Library (PPL).
 

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/ppl.git



More information about the debian-science-commits mailing list